From c3aec878e58a3b78ef8eca9da3b714d2caf44f89 Mon Sep 17 00:00:00 2001 From: legrand Date: Tue, 12 Dec 2006 14:49:08 +0000 Subject: [PATCH] Paradiseo-eo sources added git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@40 331e1502-861f-0410-8da2-ba01fb791d7f --- trunk/paradiseo-eo/.cvsignore | 25 + trunk/paradiseo-eo/AUTHORS | 8 + trunk/paradiseo-eo/COPYING | 504 + trunk/paradiseo-eo/CVS/Entries | 17 + trunk/paradiseo-eo/CVS/Entries.Log | 11 + trunk/paradiseo-eo/CVS/Repository | 1 + trunk/paradiseo-eo/CVS/Root | 1 + trunk/paradiseo-eo/ChangeLog | 0 trunk/paradiseo-eo/ForRelease | 17 + trunk/paradiseo-eo/INSTALL | 229 + trunk/paradiseo-eo/LICENSE | 504 + trunk/paradiseo-eo/Makefile.am | 30 + trunk/paradiseo-eo/NEWS | 17 + trunk/paradiseo-eo/README | 102 + trunk/paradiseo-eo/README.html | 115 + trunk/paradiseo-eo/THANKS | 0 trunk/paradiseo-eo/TODO.html | 28 + trunk/paradiseo-eo/Tutorial/CVS/Entries | 1 + trunk/paradiseo-eo/Tutorial/CVS/Repository | 1 + trunk/paradiseo-eo/Tutorial/CVS/Root | 1 + trunk/paradiseo-eo/acinclude.m4 | 61 + trunk/paradiseo-eo/app/.cvsignore | 2 + trunk/paradiseo-eo/app/CVS/Entries | 3 + trunk/paradiseo-eo/app/CVS/Entries.Log | 4 + trunk/paradiseo-eo/app/CVS/Repository | 1 + trunk/paradiseo-eo/app/CVS/Root | 1 + trunk/paradiseo-eo/app/Makefile.am | 3 + trunk/paradiseo-eo/app/gprop/.cvsignore | 4 + trunk/paradiseo-eo/app/gprop/CVS/Entries | 10 + trunk/paradiseo-eo/app/gprop/CVS/Repository | 1 + trunk/paradiseo-eo/app/gprop/CVS/Root | 1 + trunk/paradiseo-eo/app/gprop/Makefile.am | 22 + trunk/paradiseo-eo/app/gprop/gprop.cpp | 170 + trunk/paradiseo-eo/app/gprop/gprop.h | 239 + trunk/paradiseo-eo/app/gprop/l2.h | 140 + trunk/paradiseo-eo/app/gprop/mlp.h | 458 + trunk/paradiseo-eo/app/gprop/mse.h | 140 + trunk/paradiseo-eo/app/gprop/qp.h | 251 + trunk/paradiseo-eo/app/gprop/vecop.h | 214 + trunk/paradiseo-eo/app/gpsymreg/.cvsignore | 1 + trunk/paradiseo-eo/app/gpsymreg/CVS/Entries | 7 + .../paradiseo-eo/app/gpsymreg/CVS/Repository | 1 + trunk/paradiseo-eo/app/gpsymreg/CVS/Root | 1 + trunk/paradiseo-eo/app/gpsymreg/Makefile.am | 15 + trunk/paradiseo-eo/app/gpsymreg/fitness.h | 228 + trunk/paradiseo-eo/app/gpsymreg/main.cpp | 172 + trunk/paradiseo-eo/app/gpsymreg/node.h | 248 + trunk/paradiseo-eo/app/gpsymreg/parameters.h | 112 + trunk/paradiseo-eo/app/master/CVS/Entries | 1 + trunk/paradiseo-eo/app/master/CVS/Repository | 1 + trunk/paradiseo-eo/app/master/CVS/Root | 1 + trunk/paradiseo-eo/app/mastermind/.cvsignore | 4 + trunk/paradiseo-eo/app/mastermind/CVS/Entries | 5 + .../app/mastermind/CVS/Repository | 1 + trunk/paradiseo-eo/app/mastermind/CVS/Root | 1 + trunk/paradiseo-eo/app/mastermind/Makefile.am | 14 + .../app/mastermind/mastermind.cpp | 138 + .../paradiseo-eo/app/mastermind/mastermind.h | 199 + trunk/paradiseo-eo/autogen.sh | 39 + .../build-freebsd-x86/CVS/Entries | 1 + .../build-freebsd-x86/CVS/Repository | 1 + trunk/paradiseo-eo/build-freebsd-x86/CVS/Root | 1 + .../paradiseo-eo/build-linux-x86/CVS/Entries | 1 + .../build-linux-x86/CVS/Repository | 1 + trunk/paradiseo-eo/build-linux-x86/CVS/Root | 1 + trunk/paradiseo-eo/configure.in | 74 + trunk/paradiseo-eo/contrib/.cvsignore | 2 + trunk/paradiseo-eo/contrib/CVS/Entries | 5 + trunk/paradiseo-eo/contrib/CVS/Entries.Log | 3 + trunk/paradiseo-eo/contrib/CVS/Repository | 1 + trunk/paradiseo-eo/contrib/CVS/Root | 1 + trunk/paradiseo-eo/contrib/MGE/CVS/Entries | 4 + trunk/paradiseo-eo/contrib/MGE/CVS/Repository | 1 + trunk/paradiseo-eo/contrib/MGE/CVS/Root | 1 + trunk/paradiseo-eo/contrib/MGE/VirusOp.h | 144 + trunk/paradiseo-eo/contrib/MGE/eoInitVirus.h | 86 + trunk/paradiseo-eo/contrib/MGE/eoVirus.h | 130 + trunk/paradiseo-eo/contrib/Makefile.am | 9 + trunk/paradiseo-eo/contrib/boost/CVS/Entries | 3 + .../contrib/boost/CVS/Entries.Log | 2 + .../paradiseo-eo/contrib/boost/CVS/Repository | 1 + trunk/paradiseo-eo/contrib/boost/CVS/Root | 1 + trunk/paradiseo-eo/contrib/boost/config.hpp | 70 + .../contrib/boost/config/CVS/Entries | 11 + .../contrib/boost/config/CVS/Entries.Log | 4 + .../contrib/boost/config/CVS/Repository | 1 + .../contrib/boost/config/CVS/Root | 1 + .../contrib/boost/config/abi/CVS/Entries | 1 + .../contrib/boost/config/abi/CVS/Repository | 1 + .../contrib/boost/config/abi/CVS/Root | 1 + .../contrib/boost/config/abi_prefix.hpp | 20 + .../contrib/boost/config/abi_suffix.hpp | 23 + .../contrib/boost/config/auto_link.hpp | 354 + .../contrib/boost/config/compiler/CVS/Entries | 17 + .../boost/config/compiler/CVS/Repository | 1 + .../contrib/boost/config/compiler/CVS/Root | 1 + .../contrib/boost/config/compiler/borland.hpp | 175 + .../contrib/boost/config/compiler/comeau.hpp | 59 + .../boost/config/compiler/common_edg.hpp | 62 + .../boost/config/compiler/compaq_cxx.hpp | 19 + .../boost/config/compiler/digitalmars.hpp | 49 + .../contrib/boost/config/compiler/gcc.hpp | 105 + .../boost/config/compiler/greenhills.hpp | 28 + .../contrib/boost/config/compiler/hp_acc.hpp | 70 + .../contrib/boost/config/compiler/intel.hpp | 146 + .../contrib/boost/config/compiler/kai.hpp | 35 + .../boost/config/compiler/metrowerks.hpp | 104 + .../contrib/boost/config/compiler/mpw.hpp | 51 + .../boost/config/compiler/sgi_mipspro.hpp | 24 + .../boost/config/compiler/sunpro_cc.hpp | 90 + .../contrib/boost/config/compiler/vacpp.hpp | 58 + .../contrib/boost/config/compiler/visualc.hpp | 147 + .../contrib/boost/config/platform/CVS/Entries | 12 + .../boost/config/platform/CVS/Repository | 1 + .../contrib/boost/config/platform/CVS/Root | 1 + .../contrib/boost/config/platform/aix.hpp | 33 + .../contrib/boost/config/platform/amigaos.hpp | 15 + .../contrib/boost/config/platform/beos.hpp | 26 + .../contrib/boost/config/platform/bsd.hpp | 71 + .../contrib/boost/config/platform/cygwin.hpp | 48 + .../contrib/boost/config/platform/hpux.hpp | 68 + .../contrib/boost/config/platform/irix.hpp | 31 + .../contrib/boost/config/platform/linux.hpp | 98 + .../contrib/boost/config/platform/macos.hpp | 78 + .../contrib/boost/config/platform/solaris.hpp | 21 + .../contrib/boost/config/platform/win32.hpp | 50 + .../contrib/boost/config/posix_features.hpp | 87 + .../contrib/boost/config/requires_threads.hpp | 92 + .../boost/config/select_compiler_config.hpp | 83 + .../boost/config/select_platform_config.hpp | 86 + .../boost/config/select_stdlib_config.hpp | 68 + .../contrib/boost/config/stdlib/CVS/Entries | 10 + .../boost/config/stdlib/CVS/Repository | 1 + .../contrib/boost/config/stdlib/CVS/Root | 1 + .../boost/config/stdlib/dinkumware.hpp | 106 + .../contrib/boost/config/stdlib/libcomo.hpp | 46 + .../boost/config/stdlib/libstdcpp3.hpp | 61 + .../contrib/boost/config/stdlib/modena.hpp | 30 + .../contrib/boost/config/stdlib/msl.hpp | 59 + .../contrib/boost/config/stdlib/roguewave.hpp | 127 + .../contrib/boost/config/stdlib/sgi.hpp | 111 + .../contrib/boost/config/stdlib/stlport.hpp | 201 + .../contrib/boost/config/stdlib/vacpp.hpp | 18 + .../contrib/boost/config/suffix.hpp | 547 + .../contrib/boost/config/user.hpp | 124 + trunk/paradiseo-eo/contrib/boost/limits.hpp | 143 + .../contrib/boost/numeric/CVS/Entries | 2 + .../contrib/boost/numeric/CVS/Entries.Log | 1 + .../contrib/boost/numeric/CVS/Repository | 1 + .../contrib/boost/numeric/CVS/Root | 1 + .../contrib/boost/numeric/interval.hpp | 32 + .../boost/numeric/interval/CVS/Entries | 17 + .../boost/numeric/interval/CVS/Entries.Log | 3 + .../boost/numeric/interval/CVS/Repository | 1 + .../contrib/boost/numeric/interval/CVS/Root | 1 + .../contrib/boost/numeric/interval/arith.hpp | 305 + .../contrib/boost/numeric/interval/arith2.hpp | 212 + .../contrib/boost/numeric/interval/arith3.hpp | 69 + .../boost/numeric/interval/checking.hpp | 130 + .../boost/numeric/interval/compare.hpp | 19 + .../numeric/interval/compare/CVS/Entries | 7 + .../numeric/interval/compare/CVS/Repository | 1 + .../boost/numeric/interval/compare/CVS/Root | 1 + .../numeric/interval/compare/certain.hpp | 113 + .../numeric/interval/compare/explicit.hpp | 248 + .../interval/compare/lexicographic.hpp | 122 + .../numeric/interval/compare/possible.hpp | 113 + .../boost/numeric/interval/compare/set.hpp | 101 + .../numeric/interval/compare/tribool.hpp | 138 + .../boost/numeric/interval/constants.hpp | 85 + .../boost/numeric/interval/detail/CVS/Entries | 13 + .../numeric/interval/detail/CVS/Repository | 1 + .../boost/numeric/interval/detail/CVS/Root | 1 + .../interval/detail/bcc_rounding_control.hpp | 57 + .../boost/numeric/interval/detail/bugs.hpp | 79 + .../interval/detail/c99_rounding_control.hpp | 47 + .../detail/c99sub_rounding_control.hpp | 43 + .../numeric/interval/detail/division.hpp | 194 + .../interval/detail/interval_prototype.hpp | 41 + .../interval/detail/msvc_rounding_control.hpp | 88 + .../interval/detail/ppc_rounding_control.hpp | 95 + .../detail/sparc_rounding_control.hpp | 112 + .../numeric/interval/detail/test_input.hpp | 76 + .../interval/detail/x86_rounding_control.hpp | 108 + .../detail/x86gcc_rounding_control.hpp | 51 + .../boost/numeric/interval/ext/CVS/Entries | 3 + .../boost/numeric/interval/ext/CVS/Repository | 1 + .../boost/numeric/interval/ext/CVS/Root | 1 + .../boost/numeric/interval/ext/integer.hpp | 70 + .../ext/x86_fast_rounding_control.hpp | 70 + .../boost/numeric/interval/hw_rounding.hpp | 64 + .../boost/numeric/interval/interval.hpp | 450 + .../contrib/boost/numeric/interval/io.hpp | 41 + .../contrib/boost/numeric/interval/limits.hpp | 51 + .../boost/numeric/interval/policies.hpp | 75 + .../boost/numeric/interval/rounded_arith.hpp | 120 + .../boost/numeric/interval/rounded_transc.hpp | 140 + .../boost/numeric/interval/rounding.hpp | 101 + .../contrib/boost/numeric/interval/transc.hpp | 232 + .../boost/numeric/interval/utility.hpp | 331 + trunk/paradiseo-eo/contrib/eoAged.h | 109 + trunk/paradiseo-eo/contrib/eoDrawable.h | 64 + trunk/paradiseo-eo/contrib/mathsym/COPYING | 340 + .../paradiseo-eo/contrib/mathsym/CVS/Entries | 10 + .../contrib/mathsym/CVS/Entries.Log | 7 + .../contrib/mathsym/CVS/Repository | 1 + trunk/paradiseo-eo/contrib/mathsym/CVS/Root | 1 + .../paradiseo-eo/contrib/mathsym/GNUmakefile | 97 + trunk/paradiseo-eo/contrib/mathsym/README | 198 + trunk/paradiseo-eo/contrib/mathsym/README.TCC | 5 + .../contrib/mathsym/eo_interface/CVS/Entries | 10 + .../mathsym/eo_interface/CVS/Repository | 1 + .../contrib/mathsym/eo_interface/CVS/Root | 1 + .../contrib/mathsym/eo_interface/eoSym.h | 65 + .../mathsym/eo_interface/eoSymCrossover.cpp | 78 + .../mathsym/eo_interface/eoSymCrossover.h | 64 + .../contrib/mathsym/eo_interface/eoSymEval.h | 96 + .../contrib/mathsym/eo_interface/eoSymInit.h | 64 + .../eo_interface/eoSymLambdaMutate.cpp | 29 + .../mathsym/eo_interface/eoSymLambdaMutate.h | 47 + .../mathsym/eo_interface/eoSymMutate.cpp | 73 + .../mathsym/eo_interface/eoSymMutate.h | 114 + .../contrib/mathsym/eval/BoundsCheck.cpp | 80 + .../contrib/mathsym/eval/BoundsCheck.h | 58 + .../contrib/mathsym/eval/CVS/Entries | 10 + .../contrib/mathsym/eval/CVS/Repository | 1 + .../contrib/mathsym/eval/CVS/Root | 1 + .../contrib/mathsym/eval/Interval.h | 115 + .../contrib/mathsym/eval/MultiFuncs.cpp | 26 + .../contrib/mathsym/eval/MultiFunction.cpp | 341 + .../contrib/mathsym/eval/MultiFunction.h | 26 + .../contrib/mathsym/eval/c_compile.c | 57 + .../contrib/mathsym/eval/sym_compile.cpp | 219 + .../contrib/mathsym/eval/sym_compile.h | 36 + .../contrib/mathsym/fun/CVS/Entries | 7 + .../contrib/mathsym/fun/CVS/Repository | 1 + .../paradiseo-eo/contrib/mathsym/fun/CVS/Root | 1 + .../contrib/mathsym/fun/FunDef.cpp | 893 + .../paradiseo-eo/contrib/mathsym/fun/FunDef.h | 186 + .../contrib/mathsym/fun/SymOps.cpp | 109 + .../paradiseo-eo/contrib/mathsym/fun/SymOps.h | 31 + .../contrib/mathsym/fun/sym_operations.cpp | 174 + .../paradiseo-eo/contrib/mathsym/fun/util.cpp | 27 + .../contrib/mathsym/gen/CVS/Entries | 7 + .../contrib/mathsym/gen/CVS/Repository | 1 + .../paradiseo-eo/contrib/mathsym/gen/CVS/Root | 1 + .../contrib/mathsym/gen/LanguageTable.cpp | 98 + .../contrib/mathsym/gen/LanguageTable.h | 56 + .../contrib/mathsym/gen/NodeSelector.cpp | 50 + .../contrib/mathsym/gen/NodeSelector.h | 65 + .../contrib/mathsym/gen/TreeBuilder.cpp | 46 + .../contrib/mathsym/gen/TreeBuilder.h | 45 + trunk/paradiseo-eo/contrib/mathsym/header | 17 + .../contrib/mathsym/regression/CVS/Entries | 10 + .../contrib/mathsym/regression/CVS/Repository | 1 + .../contrib/mathsym/regression/CVS/Root | 1 + .../contrib/mathsym/regression/Dataset.cpp | 133 + .../contrib/mathsym/regression/Dataset.h | 51 + .../mathsym/regression/ErrorMeasure.cpp | 340 + .../contrib/mathsym/regression/ErrorMeasure.h | 61 + .../contrib/mathsym/regression/Scaling.cpp | 417 + .../contrib/mathsym/regression/Scaling.h | 95 + .../contrib/mathsym/regression/TargetInfo.cpp | 138 + .../contrib/mathsym/regression/TargetInfo.h | 65 + .../contrib/mathsym/regression/stats.h | 119 + .../paradiseo-eo/contrib/mathsym/shared_ptr.h | 102 + .../contrib/mathsym/sym/CVS/Entries | 7 + .../contrib/mathsym/sym/CVS/Repository | 1 + .../paradiseo-eo/contrib/mathsym/sym/CVS/Root | 1 + .../contrib/mathsym/sym/README.cpp | 364 + .../paradiseo-eo/contrib/mathsym/sym/Sym.cpp | 155 + trunk/paradiseo-eo/contrib/mathsym/sym/Sym.h | 174 + .../contrib/mathsym/sym/SymImpl.cpp | 109 + .../contrib/mathsym/sym/SymImpl.h | 113 + .../paradiseo-eo/contrib/mathsym/sym/token.h | 28 + trunk/paradiseo-eo/contrib/mathsym/symreg.cpp | 393 + trunk/paradiseo-eo/contrib/mathsym/tcc.tar.gz | Bin 0 -> 427170 bytes .../contrib/mathsym/test/CVS/Entries | 7 + .../contrib/mathsym/test/CVS/Repository | 1 + .../contrib/mathsym/test/CVS/Root | 1 + .../contrib/mathsym/test/test_compile.cpp | 185 + .../contrib/mathsym/test/test_diff.cpp | 17 + .../contrib/mathsym/test/test_lambda.cpp | 34 + .../contrib/mathsym/test/test_mf.cpp | 45 + .../contrib/mathsym/test/test_simplify.cpp | 21 + .../contrib/mathsym/test/testeo.cpp | 119 + .../contrib/mathsym/test_data.txt | 102 + trunk/paradiseo-eo/doc/.cvsignore | 6 + trunk/paradiseo-eo/doc/CVS/Entries | 10 + trunk/paradiseo-eo/doc/CVS/Repository | 1 + trunk/paradiseo-eo/doc/CVS/Root | 1 + trunk/paradiseo-eo/doc/EO_EA2001.pdf | Bin 0 -> 205478 bytes trunk/paradiseo-eo/doc/LeCreusot.pdf | Bin 0 -> 134256 bytes trunk/paradiseo-eo/doc/Makefile.am | 10 + trunk/paradiseo-eo/doc/eo.cfg | 1119 ++ trunk/paradiseo-eo/doc/eo.doxytag | 14501 ++++++++++++++++ .../doc/html/_bit_e_a_8cpp-source.html | 102 + .../doc/html/_bounds_check_8cpp-source.html | 95 + .../doc/html/_bounds_check_8h-source.html | 73 + .../doc/html/_c_m_a_params_8cpp-source.html | 249 + .../doc/html/_c_m_a_params_8h-source.html | 67 + .../doc/html/_c_m_a_state_8cpp-source.html | 380 + .../doc/html/_c_m_a_state_8h-source.html | 59 + .../doc/html/_dataset_8cpp-source.html | 148 + .../doc/html/_dataset_8h-source.html | 66 + .../paradiseo-eo/doc/html/_e_o_8h-source.html | 125 + .../doc/html/_e_s_e_a_8cpp-source.html | 139 + .../doc/html/_error_measure_8cpp-source.html | 355 + .../doc/html/_error_measure_8h-source.html | 76 + .../doc/html/_first_bit_e_a_8cpp-source.html | 194 + .../doc/html/_first_bit_g_a_8cpp-source.html | 168 + .../doc/html/_first_real_e_a_8cpp-source.html | 193 + .../doc/html/_first_real_g_a_8cpp-source.html | 163 + .../doc/html/_fun_def_8cpp-source.html | 905 + .../doc/html/_fun_def_8h-source.html | 171 + .../doc/html/_interval_8h-source.html | 130 + .../doc/html/_language_table_8cpp-source.html | 113 + .../doc/html/_language_table_8h-source.html | 71 + .../doc/html/_multi_funcs_8cpp-source.html | 41 + .../doc/html/_multi_function_8cpp-source.html | 356 + .../doc/html/_multi_function_8h-source.html | 41 + .../doc/html/_my_struct_e_a_8cpp-source.html | 181 + .../html/_my_struct_lib_e_a_8cpp-source.html | 155 + .../html/_my_struct_s_e_a_8cpp-source.html | 338 + .../doc/html/_n_e_w_s-source.html | 30 + .../doc/html/_node_selector_8cpp-source.html | 65 + .../doc/html/_node_selector_8h-source.html | 77 + .../doc/html/_one_max_e_a_8cpp-source.html | 181 + .../html/_one_max_lib_e_a_8cpp-source.html | 155 + .../doc/html/_py_e_o_8cpp-source.html | 245 + .../doc/html/_py_e_o_8h-source.html | 171 + .../doc/html/_r_e_a_d_m_e-source.html | 115 + .../doc/html/_r_e_a_d_m_e_8cpp-source.html | 379 + .../doc/html/_real_e_a_8cpp-source.html | 79 + .../doc/html/_royal_road_8h-source.html | 74 + .../doc/html/_scaling_8cpp-source.html | 432 + .../doc/html/_scaling_8h-source.html | 110 + .../doc/html/_second_bit_e_a_8cpp-source.html | 351 + .../html/_second_real_e_a_8cpp-source.html | 332 + .../doc/html/_sym_8cpp-source.html | 170 + .../paradiseo-eo/doc/html/_sym_8h-source.html | 189 + .../doc/html/_sym_impl_8cpp-source.html | 124 + .../doc/html/_sym_impl_8h-source.html | 128 + .../doc/html/_sym_ops_8cpp-source.html | 124 + .../doc/html/_sym_ops_8h-source.html | 46 + .../doc/html/_target_info_8cpp-source.html | 153 + .../doc/html/_target_info_8h-source.html | 80 + .../doc/html/_tree_builder_8cpp-source.html | 61 + .../doc/html/_tree_builder_8h-source.html | 60 + .../doc/html/_virus_op_8h-source.html | 133 + .../doc/html/abstract1_8cpp-source.html | 61 + .../doc/html/algos_8cpp-source.html | 121 + trunk/paradiseo-eo/doc/html/annotated.html | 361 + .../doc/html/apply_8h-source.html | 56 + .../doc/html/breeders_8cpp-source.html | 66 + .../class_biased_node_selector-members.html | 19 + .../doc/html/class_biased_node_selector.html | 44 + .../doc/html/class_biased_node_selector.png | Bin 0 -> 446 bytes .../doc/html/class_cov-members.html | 23 + trunk/paradiseo-eo/doc/html/class_cov.html | 54 + .../doc/html/class_e_o-members.html | 49 + trunk/paradiseo-eo/doc/html/class_e_o.html | 434 + trunk/paradiseo-eo/doc/html/class_e_o.png | Bin 0 -> 615 bytes .../doc/html/class_mem_pool-members.html | 22 + .../paradiseo-eo/doc/html/class_mem_pool.html | 55 + .../html/class_minimizing_traits-members.html | 17 + .../doc/html/class_minimizing_traits.html | 35 + .../doc/html/class_minimizing_traits.png | Bin 0 -> 486 bytes .../doc/html/class_node_selector-members.html | 16 + .../doc/html/class_node_selector.html | 38 + .../doc/html/class_node_selector.png | Bin 0 -> 629 bytes .../class_random_node_selector-members.html | 16 + .../doc/html/class_random_node_selector.html | 37 + .../doc/html/class_random_node_selector.png | Bin 0 -> 454 bytes .../class_u_f__random__generator-members.html | 17 + .../html/class_u_f__random__generator.html | 42 + .../html/class_virus_bit_flip-members.html | 28 + .../doc/html/class_virus_bit_flip.html | 91 + .../doc/html/class_virus_bit_flip.png | Bin 0 -> 1789 bytes .../class_virus_shift_mutation-members.html | 29 + .../doc/html/class_virus_shift_mutation.html | 95 + .../doc/html/class_virus_shift_mutation.png | Bin 0 -> 1860 bytes .../html/classboolean__generator-members.html | 18 + .../doc/html/classboolean__generator.html | 42 + .../doc/html/classd_matrix-members.html | 19 + .../paradiseo-eo/doc/html/classd_matrix.html | 48 + .../doc/html/classeo1_pt_bit_crossover.html | 29 + .../doc/html/classeo_aged-members.html | 24 + trunk/paradiseo-eo/doc/html/classeo_aged.html | 233 + .../doc/html/classeo_algo-members.html | 18 + trunk/paradiseo-eo/doc/html/classeo_algo.html | 42 + trunk/paradiseo-eo/doc/html/classeo_algo.png | Bin 0 -> 2054 bytes .../html/classeo_arithmetic_crossover.html | 26 + ...ssembled_fitness_average_stat-members.html | 41 + ...lasseo_assembled_fitness_average_stat.html | 59 + ...classeo_assembled_fitness_average_stat.png | Bin 0 -> 2829 bytes ...o_assembled_fitness_best_stat-members.html | 41 + .../classeo_assembled_fitness_best_stat.html | 59 + .../classeo_assembled_fitness_best_stat.png | Bin 0 -> 2790 bytes .../html/classeo_atom_exchange-members.html | 20 + .../doc/html/classeo_atom_exchange.html | 47 + .../doc/html/classeo_atom_exchange.png | Bin 0 -> 1761 bytes .../html/classeo_average_stat-members.html | 44 + .../doc/html/classeo_average_stat.html | 77 + .../doc/html/classeo_average_stat.png | Bin 0 -> 2744 bytes .../doc/html/classeo_b_f-members.html | 18 + trunk/paradiseo-eo/doc/html/classeo_b_f.html | 52 + trunk/paradiseo-eo/doc/html/classeo_b_f.png | Bin 0 -> 435 bytes .../classeo_best_fitness_stat-members.html | 42 + .../doc/html/classeo_best_fitness_stat.html | 70 + .../doc/html/classeo_best_fitness_stat.png | Bin 0 -> 2762 bytes .../doc/html/classeo_best_select-members.html | 19 + .../doc/html/classeo_best_select.html | 43 + .../doc/html/classeo_best_select.png | Bin 0 -> 1893 bytes .../html/classeo_bin_clone_op-members.html | 29 + .../doc/html/classeo_bin_clone_op.html | 51 + .../doc/html/classeo_bin_clone_op.png | Bin 0 -> 1931 bytes .../doc/html/classeo_bin_gen_op-members.html | 32 + .../doc/html/classeo_bin_gen_op.html | 58 + .../doc/html/classeo_bin_gen_op.png | Bin 0 -> 1941 bytes .../doc/html/classeo_bin_op-members.html | 29 + .../paradiseo-eo/doc/html/classeo_bin_op.html | 46 + .../paradiseo-eo/doc/html/classeo_bin_op.png | Bin 0 -> 1728 bytes ...lasseo_binary_functor_counter-members.html | 34 + .../html/classeo_binary_functor_counter.html | 102 + .../html/classeo_binary_functor_counter.png | Bin 0 -> 839 bytes .../doc/html/classeo_bit-members.html | 51 + trunk/paradiseo-eo/doc/html/classeo_bit.html | 201 + trunk/paradiseo-eo/doc/html/classeo_bit.png | Bin 0 -> 1532 bytes .../doc/html/classeo_bit_bit_flip.html | 29 + .../doc/html/classeo_bit_gx_over-members.html | 31 + .../doc/html/classeo_bit_gx_over.html | 115 + .../doc/html/classeo_bit_gx_over.png | Bin 0 -> 1836 bytes .../html/classeo_bit_inversion-members.html | 28 + .../doc/html/classeo_bit_inversion.html | 94 + .../doc/html/classeo_bit_inversion.png | Bin 0 -> 1570 bytes .../html/classeo_bit_mutation-members.html | 31 + .../doc/html/classeo_bit_mutation.html | 155 + .../doc/html/classeo_bit_mutation.png | Bin 0 -> 1576 bytes .../doc/html/classeo_bit_next-members.html | 28 + .../doc/html/classeo_bit_next.html | 94 + .../doc/html/classeo_bit_next.png | Bin 0 -> 1554 bytes .../html/classeo_bit_op_factory-members.html | 21 + .../doc/html/classeo_bit_op_factory.html | 104 + .../doc/html/classeo_bit_op_factory.png | Bin 0 -> 642 bytes .../doc/html/classeo_bit_prev-members.html | 28 + .../doc/html/classeo_bit_prev.html | 94 + .../doc/html/classeo_bit_prev.png | Bin 0 -> 1547 bytes .../doc/html/classeo_bool_flip-members.html | 28 + .../doc/html/classeo_bool_flip.html | 45 + .../doc/html/classeo_bool_flip.png | Bin 0 -> 1346 bytes .../classeo_boolean_generator-members.html | 22 + .../doc/html/classeo_boolean_generator.html | 50 + .../doc/html/classeo_boolean_generator.png | Bin 0 -> 748 bytes .../html/classeo_boolean_init-members.html | 22 + .../doc/html/classeo_boolean_init.html | 50 + .../doc/html/classeo_boolean_init.png | Bin 0 -> 1185 bytes .../html/classeo_branch_mutation-members.html | 34 + .../doc/html/classeo_branch_mutation.html | 165 + .../doc/html/classeo_branch_mutation.png | Bin 0 -> 2308 bytes .../doc/html/classeo_breed-members.html | 18 + .../paradiseo-eo/doc/html/classeo_breed.html | 43 + trunk/paradiseo-eo/doc/html/classeo_breed.png | Bin 0 -> 3083 bytes .../doc/html/classeo_c_m_a_breed-members.html | 23 + .../doc/html/classeo_c_m_a_breed.html | 56 + .../doc/html/classeo_c_m_a_breed.png | Bin 0 -> 2948 bytes .../doc/html/classeo_c_m_a_init-members.html | 23 + .../doc/html/classeo_c_m_a_init.html | 53 + .../doc/html/classeo_c_m_a_init.png | Bin 0 -> 1788 bytes .../classeo_cellular_easy_e_a-members.html | 29 + .../doc/html/classeo_cellular_easy_e_a.html | 79 + .../doc/html/classeo_cellular_easy_e_a.png | Bin 0 -> 1565 bytes .../doc/html/classeo_check_point-members.html | 35 + .../doc/html/classeo_check_point.html | 89 + .../doc/html/classeo_check_point.png | Bin 0 -> 2262 bytes ...seo_collapse_subtree_mutation-members.html | 34 + .../classeo_collapse_subtree_mutation.html | 165 + .../classeo_collapse_subtree_mutation.png | Bin 0 -> 2382 bytes .../classeo_combined_continue-members.html | 29 + .../doc/html/classeo_combined_continue.html | 74 + .../doc/html/classeo_combined_continue.png | Bin 0 -> 2275 bytes .../html/classeo_combined_init-members.html | 24 + .../doc/html/classeo_combined_init.html | 106 + .../doc/html/classeo_combined_init.png | Bin 0 -> 1296 bytes .../classeo_comma_replacement-members.html | 22 + .../doc/html/classeo_comma_replacement.html | 46 + .../doc/html/classeo_comma_replacement.png | Bin 0 -> 2208 bytes .../doc/html/classeo_continue-members.html | 23 + .../doc/html/classeo_continue.html | 152 + .../doc/html/classeo_continue.png | Bin 0 -> 5497 bytes .../classeo_counted_dyn_update-members.html | 25 + .../doc/html/classeo_counted_dyn_update.html | 51 + .../doc/html/classeo_counted_dyn_update.png | Bin 0 -> 830 bytes .../classeo_counted_state_saver-members.html | 30 + .../doc/html/classeo_counted_state_saver.html | 75 + .../doc/html/classeo_counted_state_saver.png | Bin 0 -> 698 bytes .../html/classeo_ctrl_c_continue-members.html | 24 + .../doc/html/classeo_ctrl_c_continue.html | 52 + .../doc/html/classeo_ctrl_c_continue.png | Bin 0 -> 2273 bytes .../html/classeo_det_bit_flip-members.html | 30 + .../doc/html/classeo_det_bit_flip.html | 143 + .../doc/html/classeo_det_bit_flip.png | Bin 0 -> 1571 bytes .../doc/html/classeo_det_select-members.html | 20 + .../doc/html/classeo_det_select.html | 101 + .../doc/html/classeo_det_select.png | Bin 0 -> 1889 bytes ...classeo_det_tournament_select-members.html | 21 + .../html/classeo_det_tournament_select.html | 50 + .../html/classeo_det_tournament_select.png | Bin 0 -> 1956 bytes ...asseo_det_tournament_truncate-members.html | 20 + .../html/classeo_det_tournament_truncate.html | 52 + .../html/classeo_det_tournament_truncate.png | Bin 0 -> 1948 bytes ...det_tournament_truncate_split-members.html | 22 + ...classeo_det_tournament_truncate_split.html | 59 + .../classeo_det_tournament_truncate_split.png | Bin 0 -> 1950 bytes ...o_det_tournament_worth_select-members.html | 26 + .../classeo_det_tournament_worth_select.html | 58 + .../classeo_det_tournament_worth_select.png | Bin 0 -> 2382 bytes .../classeo_det_uniform_mutation-members.html | 35 + .../html/classeo_det_uniform_mutation.html | 287 + .../doc/html/classeo_det_uniform_mutation.png | Bin 0 -> 1515 bytes ...eterministic_sa_d_replacement-members.html | 25 + ...lasseo_deterministic_sa_d_replacement.html | 71 + ...classeo_deterministic_sa_d_replacement.png | Bin 0 -> 1955 bytes ...deterministic_survive_and_die-members.html | 22 + ...classeo_deterministic_survive_and_die.html | 50 + .../classeo_deterministic_survive_and_die.png | Bin 0 -> 1955 bytes .../doc/html/classeo_distance-members.html | 18 + .../doc/html/classeo_distance.html | 39 + .../doc/html/classeo_distance.png | Bin 0 -> 2657 bytes .../html/classeo_distrib_updater-members.html | 18 + .../doc/html/classeo_distrib_updater.html | 46 + .../doc/html/classeo_distrib_updater.png | Bin 0 -> 2278 bytes .../html/classeo_distribution-members.html | 25 + .../doc/html/classeo_distribution.html | 50 + .../doc/html/classeo_distribution.png | Bin 0 -> 2254 bytes .../html/classeo_dominance_map-members.html | 24 + .../doc/html/classeo_dominance_map.html | 146 + .../doc/html/classeo_dominance_map.png | Bin 0 -> 1575 bytes .../html/classeo_double_exchange-members.html | 29 + .../doc/html/classeo_double_exchange.html | 49 + .../doc/html/classeo_double_exchange.png | Bin 0 -> 1841 bytes .../classeo_double_intermediate-members.html | 29 + .../doc/html/classeo_double_intermediate.html | 49 + .../doc/html/classeo_double_intermediate.png | Bin 0 -> 1842 bytes .../doc/html/classeo_drawable-members.html | 18 + .../doc/html/classeo_drawable.html | 99 + .../classeo_dyn_s_g_a_transform-members.html | 28 + .../doc/html/classeo_dyn_s_g_a_transform.html | 123 + .../doc/html/classeo_dyn_s_g_a_transform.png | Bin 0 -> 1595 bytes .../doc/html/classeo_dyn_updater-members.html | 23 + .../doc/html/classeo_dyn_updater.html | 49 + .../doc/html/classeo_dyn_updater.png | Bin 0 -> 1175 bytes .../doc/html/classeo_e_d_a-members.html | 18 + .../paradiseo-eo/doc/html/classeo_e_d_a.html | 41 + trunk/paradiseo-eo/doc/html/classeo_e_d_a.png | Bin 0 -> 1816 bytes .../doc/html/classeo_e_p_reduce-members.html | 22 + .../doc/html/classeo_e_p_reduce.html | 59 + .../doc/html/classeo_e_p_reduce.png | Bin 0 -> 1860 bytes .../html/classeo_e_p_replacement-members.html | 22 + .../doc/html/classeo_e_p_replacement.html | 50 + .../doc/html/classeo_e_p_replacement.png | Bin 0 -> 2195 bytes .../doc/html/classeo_easy_e_a-members.html | 38 + .../doc/html/classeo_easy_e_a.html | 113 + .../doc/html/classeo_easy_e_a.png | Bin 0 -> 1508 bytes ...asseo_elite_sequential_select-members.html | 22 + .../html/classeo_elite_sequential_select.html | 61 + .../html/classeo_elite_sequential_select.png | Bin 0 -> 1976 bytes .../doc/html/classeo_elitism-members.html | 21 + .../doc/html/classeo_elitism.html | 56 + .../paradiseo-eo/doc/html/classeo_elitism.png | Bin 0 -> 2192 bytes .../html/classeo_es_chrom_init-members.html | 31 + .../doc/html/classeo_es_chrom_init.html | 360 + .../doc/html/classeo_es_chrom_init.png | Bin 0 -> 1566 bytes .../doc/html/classeo_es_full-members.html | 54 + .../doc/html/classeo_es_full.html | 108 + .../paradiseo-eo/doc/html/classeo_es_full.png | Bin 0 -> 1446 bytes .../html/classeo_es_global_xover-members.html | 38 + .../doc/html/classeo_es_global_xover.html | 270 + .../doc/html/classeo_es_global_xover.png | Bin 0 -> 1990 bytes .../doc/html/classeo_es_mutate-members.html | 42 + .../doc/html/classeo_es_mutate.html | 465 + .../doc/html/classeo_es_mutate.png | Bin 0 -> 1453 bytes .../classeo_es_mutation_init-members.html | 31 + .../doc/html/classeo_es_mutation_init.html | 142 + .../doc/html/classeo_es_simple-members.html | 53 + .../doc/html/classeo_es_simple.html | 107 + .../doc/html/classeo_es_simple.png | Bin 0 -> 1476 bytes .../classeo_es_standard_xover-members.html | 36 + .../doc/html/classeo_es_standard_xover.html | 78 + .../doc/html/classeo_es_standard_xover.png | Bin 0 -> 1985 bytes .../doc/html/classeo_es_stdev-members.html | 53 + .../doc/html/classeo_es_stdev.html | 105 + .../doc/html/classeo_es_stdev.png | Bin 0 -> 1473 bytes .../html/classeo_eval_continue-members.html | 27 + .../doc/html/classeo_eval_continue.html | 63 + .../doc/html/classeo_eval_continue.png | Bin 0 -> 2269 bytes .../doc/html/classeo_eval_func-members.html | 20 + .../doc/html/classeo_eval_func.html | 50 + .../doc/html/classeo_eval_func.png | Bin 0 -> 3367 bytes .../classeo_eval_func_counter-members.html | 39 + .../doc/html/classeo_eval_func_counter.html | 54 + .../doc/html/classeo_eval_func_counter.png | Bin 0 -> 1917 bytes .../classeo_expansion_mutation-members.html | 34 + .../doc/html/classeo_expansion_mutation.html | 165 + .../doc/html/classeo_expansion_mutation.png | Bin 0 -> 2334 bytes .../html/classeo_external_bin_op-members.html | 30 + .../doc/html/classeo_external_bin_op.html | 54 + .../doc/html/classeo_external_bin_op.png | Bin 0 -> 2194 bytes .../html/classeo_external_e_o-members.html | 47 + .../doc/html/classeo_external_e_o.html | 102 + .../doc/html/classeo_external_e_o.png | Bin 0 -> 1161 bytes .../classeo_external_eval_func-members.html | 22 + .../doc/html/classeo_external_eval_func.html | 53 + .../doc/html/classeo_external_eval_func.png | Bin 0 -> 1880 bytes .../html/classeo_external_init-members.html | 21 + .../doc/html/classeo_external_init.html | 53 + .../doc/html/classeo_external_init.png | Bin 0 -> 1527 bytes .../html/classeo_external_mon_op-members.html | 30 + .../doc/html/classeo_external_mon_op.html | 54 + .../doc/html/classeo_external_mon_op.png | Bin 0 -> 2082 bytes .../classeo_external_quad_op-members.html | 30 + .../doc/html/classeo_external_quad_op.html | 54 + .../doc/html/classeo_external_quad_op.png | Bin 0 -> 2291 bytes .../doc/html/classeo_f-members.html | 19 + trunk/paradiseo-eo/doc/html/classeo_f.html | 57 + trunk/paradiseo-eo/doc/html/classeo_f.png | Bin 0 -> 355 bytes .../classeo_f_d_c_file_snapshot-members.html | 36 + .../doc/html/classeo_f_d_c_file_snapshot.html | 117 + .../doc/html/classeo_f_d_c_file_snapshot.png | Bin 0 -> 927 bytes .../doc/html/classeo_f_d_c_stat-members.html | 47 + .../doc/html/classeo_f_d_c_stat.html | 81 + .../doc/html/classeo_f_d_c_stat.png | Bin 0 -> 2664 bytes .../doc/html/classeo_factory-members.html | 19 + .../doc/html/classeo_factory.html | 95 + .../paradiseo-eo/doc/html/classeo_factory.png | Bin 0 -> 443 bytes .../html/classeo_file_monitor-members.html | 34 + .../doc/html/classeo_file_monitor.html | 76 + .../doc/html/classeo_file_monitor.png | Bin 0 -> 806 bytes .../html/classeo_file_snapshot-members.html | 41 + .../doc/html/classeo_file_snapshot.html | 110 + .../doc/html/classeo_file_snapshot.png | Bin 0 -> 1329 bytes .../html/classeo_fit_continue-members.html | 26 + .../doc/html/classeo_fit_continue.html | 103 + .../doc/html/classeo_fit_continue.png | Bin 0 -> 2245 bytes ...lasseo_fitness_scaling_select-members.html | 27 + .../html/classeo_fitness_scaling_select.html | 90 + .../html/classeo_fitness_scaling_select.png | Bin 0 -> 2694 bytes .../html/classeo_fitness_stat-members.html | 39 + .../doc/html/classeo_fitness_stat.html | 49 + .../doc/html/classeo_fitness_stat.png | Bin 0 -> 2933 bytes .../html/classeo_fl_or1pt_bin_op-members.html | 31 + .../doc/html/classeo_fl_or1pt_bin_op.html | 56 + .../doc/html/classeo_fl_or1pt_bin_op.png | Bin 0 -> 1954 bytes .../classeo_fl_or1pt_quad_op-members.html | 30 + .../doc/html/classeo_fl_or1pt_quad_op.html | 56 + .../doc/html/classeo_fl_or1pt_quad_op.png | Bin 0 -> 1723 bytes ...classeo_fl_or_all_atom_bin_op-members.html | 32 + .../html/classeo_fl_or_all_atom_bin_op.html | 63 + .../html/classeo_fl_or_all_atom_bin_op.png | Bin 0 -> 1962 bytes ...lasseo_fl_or_all_atom_quad_op-members.html | 32 + .../html/classeo_fl_or_all_atom_quad_op.html | 63 + .../html/classeo_fl_or_all_atom_quad_op.png | Bin 0 -> 1756 bytes .../classeo_fl_or_all_mutation-members.html | 32 + .../doc/html/classeo_fl_or_all_mutation.html | 63 + .../doc/html/classeo_fl_or_all_mutation.png | Bin 0 -> 1493 bytes .../classeo_fl_or_k_atom_bin_op-members.html | 32 + .../doc/html/classeo_fl_or_k_atom_bin_op.html | 63 + .../doc/html/classeo_fl_or_k_atom_bin_op.png | Bin 0 -> 1972 bytes .../classeo_fl_or_k_atom_quad_op-members.html | 33 + .../html/classeo_fl_or_k_atom_quad_op.html | 63 + .../doc/html/classeo_fl_or_k_atom_quad_op.png | Bin 0 -> 1740 bytes .../classeo_fl_or_k_mutation-members.html | 32 + .../doc/html/classeo_fl_or_k_mutation.html | 63 + .../doc/html/classeo_fl_or_k_mutation.png | Bin 0 -> 1502 bytes .../classeo_fl_or_uniform_bin_op-members.html | 31 + .../html/classeo_fl_or_uniform_bin_op.html | 60 + .../doc/html/classeo_fl_or_uniform_bin_op.png | Bin 0 -> 1957 bytes ...classeo_fl_or_uniform_quad_op-members.html | 31 + .../html/classeo_fl_or_uniform_quad_op.html | 60 + .../html/classeo_fl_or_uniform_quad_op.png | Bin 0 -> 1748 bytes .../html/classeo_functor_base-members.html | 15 + .../doc/html/classeo_functor_base.html | 115 + .../doc/html/classeo_functor_base.png | Bin 0 -> 35207 bytes .../html/classeo_functor_store-members.html | 20 + .../doc/html/classeo_functor_store.html | 62 + .../doc/html/classeo_functor_store.png | Bin 0 -> 376 bytes .../html/classeo_g3_replacement-members.html | 22 + .../doc/html/classeo_g3_replacement.html | 56 + .../doc/html/classeo_g3_replacement.png | Bin 0 -> 1875 bytes .../html/classeo_gen_continue-members.html | 48 + .../doc/html/classeo_gen_continue.html | 178 + .../doc/html/classeo_gen_continue.png | Bin 0 -> 2911 bytes .../doc/html/classeo_gen_op-members.html | 30 + .../paradiseo-eo/doc/html/classeo_gen_op.html | 70 + .../paradiseo-eo/doc/html/classeo_gen_op.png | Bin 0 -> 5143 bytes .../classeo_gene_del_chooser-members.html | 19 + .../doc/html/classeo_gene_del_chooser.html | 42 + .../doc/html/classeo_gene_del_chooser.png | Bin 0 -> 1546 bytes .../html/classeo_general_breeder-members.html | 24 + .../doc/html/classeo_general_breeder.html | 240 + .../doc/html/classeo_general_breeder.png | Bin 0 -> 1921 bytes .../classeo_general_int_bounds-members.html | 41 + .../doc/html/classeo_general_int_bounds.html | 126 + .../doc/html/classeo_general_int_bounds.png | Bin 0 -> 654 bytes .../classeo_general_real_bounds-members.html | 38 + .../doc/html/classeo_general_real_bounds.html | 122 + .../doc/html/classeo_general_real_bounds.png | Bin 0 -> 729 bytes ...sseo_generational_replacement-members.html | 18 + .../classeo_generational_replacement.html | 43 + .../html/classeo_generational_replacement.png | Bin 0 -> 1938 bytes .../doc/html/classeo_gnuplot-members.html | 23 + .../doc/html/classeo_gnuplot.html | 242 + .../paradiseo-eo/doc/html/classeo_gnuplot.png | Bin 0 -> 678 bytes .../classeo_gnuplot1_d_monitor-members.html | 40 + .../doc/html/classeo_gnuplot1_d_monitor.html | 63 + .../doc/html/classeo_gnuplot1_d_monitor.png | Bin 0 -> 1256 bytes .../classeo_gnuplot1_d_snapshot-members.html | 50 + .../doc/html/classeo_gnuplot1_d_snapshot.html | 73 + .../doc/html/classeo_gnuplot1_d_snapshot.png | Bin 0 -> 1353 bytes .../classeo_hamming_distance-members.html | 18 + .../doc/html/classeo_hamming_distance.html | 43 + .../doc/html/classeo_hamming_distance.png | Bin 0 -> 1963 bytes .../html/classeo_hoist_mutation-members.html | 32 + .../doc/html/classeo_hoist_mutation.html | 147 + .../doc/html/classeo_hoist_mutation.png | Bin 0 -> 2288 bytes .../doc/html/classeo_how_many-members.html | 27 + .../doc/html/classeo_how_many.html | 250 + .../doc/html/classeo_how_many.png | Bin 0 -> 480 bytes .../doc/html/classeo_incrementor-members.html | 24 + .../doc/html/classeo_incrementor.html | 57 + .../doc/html/classeo_incrementor.png | Bin 0 -> 624 bytes .../classeo_incrementor_param-members.html | 41 + .../doc/html/classeo_incrementor_param.html | 60 + .../doc/html/classeo_incrementor_param.png | Bin 0 -> 1303 bytes .../doc/html/classeo_init-members.html | 19 + trunk/paradiseo-eo/doc/html/classeo_init.html | 91 + trunk/paradiseo-eo/doc/html/classeo_init.png | Bin 0 -> 3130 bytes .../html/classeo_init_adaptor-members.html | 30 + .../doc/html/classeo_init_adaptor.html | 54 + .../doc/html/classeo_init_adaptor.png | Bin 0 -> 1465 bytes .../classeo_init_fixed_length-members.html | 23 + .../doc/html/classeo_init_fixed_length.html | 58 + .../doc/html/classeo_init_fixed_length.png | Bin 0 -> 1330 bytes .../html/classeo_init_generator-members.html | 21 + .../doc/html/classeo_init_generator.html | 50 + .../doc/html/classeo_init_generator.png | Bin 0 -> 600 bytes .../classeo_init_variable_length-members.html | 25 + .../html/classeo_init_variable_length.html | 64 + .../doc/html/classeo_init_variable_length.png | Bin 0 -> 1338 bytes .../doc/html/classeo_init_virus-members.html | 22 + .../doc/html/classeo_init_virus.html | 54 + .../doc/html/classeo_init_virus.png | Bin 0 -> 1528 bytes .../html/classeo_init_virus1bit-members.html | 22 + .../doc/html/classeo_init_virus1bit.html | 54 + .../doc/html/classeo_init_virus1bit.png | Bin 0 -> 1541 bytes ...lasseo_inner_exchange_quad_op-members.html | 32 + .../html/classeo_inner_exchange_quad_op.html | 64 + .../html/classeo_inner_exchange_quad_op.png | Bin 0 -> 1766 bytes .../html/classeo_int_above_bound-members.html | 37 + .../doc/html/classeo_int_above_bound.html | 180 + .../doc/html/classeo_int_above_bound.png | Bin 0 -> 621 bytes .../html/classeo_int_below_bound-members.html | 37 + .../doc/html/classeo_int_below_bound.html | 180 + .../doc/html/classeo_int_below_bound.png | Bin 0 -> 613 bytes .../doc/html/classeo_int_bounds-members.html | 34 + .../doc/html/classeo_int_bounds.html | 113 + .../doc/html/classeo_int_bounds.png | Bin 0 -> 1589 bytes .../html/classeo_int_interval-members.html | 39 + .../doc/html/classeo_int_interval.html | 186 + .../doc/html/classeo_int_interval.png | Bin 0 -> 564 bytes .../html/classeo_int_no_bounds-members.html | 35 + .../doc/html/classeo_int_no_bounds.html | 172 + .../doc/html/classeo_int_no_bounds.png | Bin 0 -> 598 bytes .../classeo_invalidate_bin_op-members.html | 30 + .../doc/html/classeo_invalidate_bin_op.html | 55 + .../doc/html/classeo_invalidate_bin_op.png | Bin 0 -> 1955 bytes .../classeo_invalidate_mon_op-members.html | 30 + .../doc/html/classeo_invalidate_mon_op.html | 55 + .../doc/html/classeo_invalidate_mon_op.png | Bin 0 -> 1498 bytes .../classeo_invalidate_quad_op-members.html | 30 + .../doc/html/classeo_invalidate_quad_op.html | 55 + .../doc/html/classeo_invalidate_quad_op.png | Bin 0 -> 1723 bytes .../classeo_linear_fit_scaling-members.html | 41 + .../doc/html/classeo_linear_fit_scaling.html | 54 + .../doc/html/classeo_linear_fit_scaling.png | Bin 0 -> 2469 bytes .../classeo_linear_random_split-members.html | 21 + .../doc/html/classeo_linear_random_split.html | 54 + .../doc/html/classeo_linear_random_split.png | Bin 0 -> 1893 bytes .../html/classeo_linear_truncate-members.html | 18 + .../doc/html/classeo_linear_truncate.html | 45 + .../doc/html/classeo_linear_truncate.png | Bin 0 -> 1886 bytes ...classeo_linear_truncate_split-members.html | 21 + .../html/classeo_linear_truncate_split.html | 56 + .../html/classeo_linear_truncate_split.png | Bin 0 -> 1890 bytes .../classeo_m_g_g_replacement-members.html | 22 + .../doc/html/classeo_m_g_g_replacement.html | 56 + .../doc/html/classeo_m_g_g_replacement.png | Bin 0 -> 1895 bytes .../classeo_m_o_fitness_stat-members.html | 40 + .../doc/html/classeo_m_o_fitness_stat.html | 54 + .../doc/html/classeo_m_o_fitness_stat.png | Bin 0 -> 2859 bytes .../doc/html/classeo_merge-members.html | 18 + .../paradiseo-eo/doc/html/classeo_merge.html | 40 + trunk/paradiseo-eo/doc/html/classeo_merge.png | Bin 0 -> 1598 bytes .../html/classeo_merge_reduce-members.html | 21 + .../doc/html/classeo_merge_reduce.html | 56 + .../doc/html/classeo_merge_reduce.png | Bin 0 -> 3044 bytes .../html/classeo_mon_clone_op-members.html | 29 + .../doc/html/classeo_mon_clone_op.html | 51 + .../doc/html/classeo_mon_clone_op.png | Bin 0 -> 1465 bytes .../doc/html/classeo_mon_gen_op-members.html | 32 + .../doc/html/classeo_mon_gen_op.html | 58 + .../doc/html/classeo_mon_gen_op.png | Bin 0 -> 1957 bytes .../doc/html/classeo_mon_op-members.html | 29 + .../paradiseo-eo/doc/html/classeo_mon_op.html | 48 + .../paradiseo-eo/doc/html/classeo_mon_op.png | Bin 0 -> 1345 bytes .../doc/html/classeo_monitor-members.html | 24 + .../doc/html/classeo_monitor.html | 99 + .../paradiseo-eo/doc/html/classeo_monitor.png | Bin 0 -> 2524 bytes .../classeo_n_d_plus_replacement-members.html | 23 + .../html/classeo_n_d_plus_replacement.html | 63 + .../doc/html/classeo_n_d_plus_replacement.png | Bin 0 -> 2665 bytes .../doc/html/classeo_n_d_sorting-members.html | 49 + .../doc/html/classeo_n_d_sorting.html | 162 + .../doc/html/classeo_n_d_sorting.png | Bin 0 -> 3469 bytes ...seo_n_d_sorting_1_1_dummy_e_o-members.html | 45 + .../classeo_n_d_sorting_1_1_dummy_e_o.html | 41 + .../classeo_n_d_sorting_1_1_dummy_e_o.png | Bin 0 -> 1169 bytes .../html/classeo_n_d_sorting___i-members.html | 47 + .../doc/html/classeo_n_d_sorting___i.html | 101 + .../doc/html/classeo_n_d_sorting___i.png | Bin 0 -> 3211 bytes .../classeo_n_d_sorting___i_i-members.html | 47 + .../doc/html/classeo_n_d_sorting___i_i.html | 59 + .../doc/html/classeo_n_d_sorting___i_i.png | Bin 0 -> 3221 bytes .../html/classeo_n_pts_bit_xover-members.html | 30 + .../doc/html/classeo_n_pts_bit_xover.html | 112 + .../doc/html/classeo_n_pts_bit_xover.png | Bin 0 -> 1864 bytes .../classeo_neg_exp_generator-members.html | 22 + .../doc/html/classeo_neg_exp_generator.html | 55 + .../doc/html/classeo_neg_exp_generator.png | Bin 0 -> 782 bytes .../html/classeo_neg_exp_init-members.html | 22 + .../doc/html/classeo_neg_exp_init.html | 55 + .../doc/html/classeo_neg_exp_init.png | Bin 0 -> 1186 bytes .../doc/html/classeo_no_elitism-members.html | 20 + .../doc/html/classeo_no_elitism.html | 39 + .../doc/html/classeo_no_elitism.png | Bin 0 -> 2195 bytes .../html/classeo_no_perf2_worth-members.html | 39 + .../doc/html/classeo_no_perf2_worth.html | 45 + .../doc/html/classeo_no_perf2_worth.png | Bin 0 -> 2505 bytes .../doc/html/classeo_no_select-members.html | 21 + .../doc/html/classeo_no_select.html | 51 + .../doc/html/classeo_no_select.png | Bin 0 -> 1883 bytes .../classeo_normal_generator-members.html | 22 + .../doc/html/classeo_normal_generator.html | 55 + .../doc/html/classeo_normal_generator.png | Bin 0 -> 756 bytes .../doc/html/classeo_normal_init-members.html | 22 + .../doc/html/classeo_normal_init.html | 55 + .../doc/html/classeo_normal_init.png | Bin 0 -> 1154 bytes .../html/classeo_normal_mutation-members.html | 34 + .../doc/html/classeo_normal_mutation.html | 232 + .../doc/html/classeo_normal_mutation.png | Bin 0 -> 1811 bytes .../classeo_normal_vec_mutation-members.html | 33 + .../doc/html/classeo_normal_vec_mutation.html | 225 + .../doc/html/classeo_normal_vec_mutation.png | Bin 0 -> 1512 bytes ...sseo_nth_element_fitness_stat-members.html | 43 + .../classeo_nth_element_fitness_stat.html | 69 + .../html/classeo_nth_element_fitness_stat.png | Bin 0 -> 2930 bytes .../doc/html/classeo_object-members.html | 16 + .../paradiseo-eo/doc/html/classeo_object.html | 100 + .../paradiseo-eo/doc/html/classeo_object.png | Bin 0 -> 5899 bytes .../classeo_one_fifth_mutation-members.html | 41 + .../doc/html/classeo_one_fifth_mutation.html | 198 + .../doc/html/classeo_one_fifth_mutation.png | Bin 0 -> 1934 bytes .../doc/html/classeo_one_max-members.html | 51 + .../doc/html/classeo_one_max.html | 219 + .../paradiseo-eo/doc/html/classeo_one_max.png | Bin 0 -> 859 bytes .../classeo_one_max_eval_func-members.html | 21 + .../doc/html/classeo_one_max_eval_func.html | 92 + .../doc/html/classeo_one_max_eval_func.png | Bin 0 -> 1405 bytes .../html/classeo_one_max_init-members.html | 21 + .../doc/html/classeo_one_max_init.html | 98 + .../doc/html/classeo_one_max_init.png | Bin 0 -> 1468 bytes .../classeo_one_max_mutation-members.html | 29 + .../doc/html/classeo_one_max_mutation.html | 98 + .../doc/html/classeo_one_max_mutation.png | Bin 0 -> 1801 bytes ...lasseo_one_max_quad_crossover-members.html | 29 + .../html/classeo_one_max_quad_crossover.html | 108 + .../html/classeo_one_max_quad_crossover.png | Bin 0 -> 2131 bytes .../doc/html/classeo_op-members.html | 24 + trunk/paradiseo-eo/doc/html/classeo_op.html | 67 + trunk/paradiseo-eo/doc/html/classeo_op.png | Bin 0 -> 940 bytes .../html/classeo_op_container-members.html | 37 + .../doc/html/classeo_op_container.html | 122 + .../doc/html/classeo_op_container.png | Bin 0 -> 2536 bytes .../html/classeo_op_sel_mason-members.html | 25 + .../doc/html/classeo_op_sel_mason.html | 113 + .../doc/html/classeo_op_sel_mason.png | Bin 0 -> 793 bytes .../classeo_p_b_i_l_additive-members.html | 26 + .../doc/html/classeo_p_b_i_l_additive.html | 73 + .../doc/html/classeo_p_b_i_l_additive.png | Bin 0 -> 2076 bytes .../html/classeo_p_b_i_l_distrib-members.html | 45 + .../doc/html/classeo_p_b_i_l_distrib.html | 118 + .../doc/html/classeo_p_b_i_l_distrib.png | Bin 0 -> 2975 bytes .../doc/html/classeo_p_b_i_l_org-members.html | 22 + .../doc/html/classeo_p_b_i_l_org.html | 60 + .../doc/html/classeo_p_b_i_l_org.png | Bin 0 -> 2044 bytes .../doc/html/classeo_param-members.html | 31 + .../paradiseo-eo/doc/html/classeo_param.html | 179 + trunk/paradiseo-eo/doc/html/classeo_param.png | Bin 0 -> 5769 bytes .../classeo_param_param_type-members.html | 18 + .../doc/html/classeo_param_param_type.html | 43 + .../classeo_parameter_loader-members.html | 19 + .../doc/html/classeo_parameter_loader.html | 185 + .../doc/html/classeo_parameter_loader.png | Bin 0 -> 406 bytes .../html/classeo_pareto_fitness-members.html | 26 + .../doc/html/classeo_pareto_fitness.html | 73 + ...classeo_pareto_fitness_traits-members.html | 17 + .../html/classeo_pareto_fitness_traits.html | 46 + .../html/classeo_pareto_fitness_traits.png | Bin 0 -> 1143 bytes ...pareto_one_constraint_fitness-members.html | 32 + ...classeo_pareto_one_constraint_fitness.html | 95 + .../html/classeo_pareto_ranking-members.html | 43 + .../doc/html/classeo_pareto_ranking.html | 55 + .../doc/html/classeo_pareto_ranking.png | Bin 0 -> 2853 bytes .../doc/html/classeo_parse_tree-members.html | 51 + .../doc/html/classeo_parse_tree.html | 298 + .../doc/html/classeo_parse_tree.png | Bin 0 -> 1213 bytes ...classeo_parse_tree_depth_init-members.html | 28 + .../html/classeo_parse_tree_depth_init.html | 184 + .../html/classeo_parse_tree_depth_init.png | Bin 0 -> 2060 bytes .../doc/html/classeo_parser-members.html | 51 + .../paradiseo-eo/doc/html/classeo_parser.html | 519 + .../paradiseo-eo/doc/html/classeo_parser.png | Bin 0 -> 1063 bytes .../doc/html/classeo_perf2_worth-members.html | 39 + .../doc/html/classeo_perf2_worth.html | 58 + .../doc/html/classeo_perf2_worth.png | Bin 0 -> 2624 bytes ...perf2_worth_1_1compare__worth-members.html | 17 + ...classeo_perf2_worth_1_1compare__worth.html | 42 + .../classeo_perf2_worth_cached-members.html | 42 + .../doc/html/classeo_perf2_worth_cached.html | 101 + .../doc/html/classeo_perf2_worth_cached.png | Bin 0 -> 2605 bytes ...orth_cached_1_1compare__worth-members.html | 17 + ..._perf2_worth_cached_1_1compare__worth.html | 42 + .../doc/html/classeo_persistent-members.html | 18 + .../doc/html/classeo_persistent.html | 108 + .../doc/html/classeo_persistent.png | Bin 0 -> 4317 bytes .../doc/html/classeo_plus-members.html | 18 + trunk/paradiseo-eo/doc/html/classeo_plus.html | 43 + trunk/paradiseo-eo/doc/html/classeo_plus.png | Bin 0 -> 1836 bytes .../classeo_plus_replacement-members.html | 22 + .../doc/html/classeo_plus_replacement.html | 46 + .../doc/html/classeo_plus_replacement.png | Bin 0 -> 2203 bytes .../html/classeo_point_mutation-members.html | 33 + .../doc/html/classeo_point_mutation.html | 152 + .../doc/html/classeo_point_mutation.png | Bin 0 -> 2290 bytes .../doc/html/classeo_pop-members.html | 49 + trunk/paradiseo-eo/doc/html/classeo_pop.html | 615 + trunk/paradiseo-eo/doc/html/classeo_pop.png | Bin 0 -> 688 bytes .../doc/html/classeo_pop_algo-members.html | 18 + .../doc/html/classeo_pop_algo.html | 37 + .../doc/html/classeo_pop_algo.png | Bin 0 -> 1257 bytes .../html/classeo_pop_eval_func-members.html | 18 + .../doc/html/classeo_pop_eval_func.html | 45 + .../doc/html/classeo_pop_eval_func.png | Bin 0 -> 2111 bytes .../html/classeo_pop_loop_eval-members.html | 20 + .../doc/html/classeo_pop_loop_eval.html | 51 + .../doc/html/classeo_pop_loop_eval.png | Bin 0 -> 1843 bytes .../doc/html/classeo_pop_stat-members.html | 40 + .../doc/html/classeo_pop_stat.html | 143 + .../doc/html/classeo_pop_stat.png | Bin 0 -> 2651 bytes .../doc/html/classeo_populator-members.html | 31 + .../doc/html/classeo_populator.html | 213 + .../doc/html/classeo_populator.png | Bin 0 -> 848 bytes .../doc/html/classeo_printable-members.html | 16 + .../doc/html/classeo_printable.html | 105 + .../doc/html/classeo_printable.png | Bin 0 -> 4327 bytes .../classeo_procedure_counter-members.html | 34 + .../doc/html/classeo_procedure_counter.html | 93 + .../doc/html/classeo_procedure_counter.png | Bin 0 -> 786 bytes .../classeo_prop_combined_bin_op-members.html | 32 + .../html/classeo_prop_combined_bin_op.html | 61 + .../doc/html/classeo_prop_combined_bin_op.png | Bin 0 -> 1993 bytes .../classeo_prop_combined_mon_op-members.html | 33 + .../html/classeo_prop_combined_mon_op.html | 66 + .../doc/html/classeo_prop_combined_mon_op.png | Bin 0 -> 1628 bytes ...classeo_prop_combined_quad_op-members.html | 33 + .../html/classeo_prop_combined_quad_op.html | 66 + .../html/classeo_prop_combined_quad_op.png | Bin 0 -> 1767 bytes .../html/classeo_prop_g_a_gen_op-members.html | 38 + .../doc/html/classeo_prop_g_a_gen_op.html | 77 + .../doc/html/classeo_prop_g_a_gen_op.png | Bin 0 -> 1981 bytes .../html/classeo_proportional_op-members.html | 35 + .../doc/html/classeo_proportional_op.html | 48 + .../doc/html/classeo_proportional_op.png | Bin 0 -> 2267 bytes .../classeo_proportional_select-members.html | 22 + .../doc/html/classeo_proportional_select.html | 62 + .../doc/html/classeo_proportional_select.png | Bin 0 -> 1933 bytes .../html/classeo_quad2_bin_op-members.html | 30 + .../doc/html/classeo_quad2_bin_op.html | 93 + .../doc/html/classeo_quad2_bin_op.png | Bin 0 -> 1949 bytes .../html/classeo_quad_clone_op-members.html | 29 + .../doc/html/classeo_quad_clone_op.html | 51 + .../doc/html/classeo_quad_clone_op.png | Bin 0 -> 1699 bytes .../html/classeo_quad_distance-members.html | 18 + .../doc/html/classeo_quad_distance.html | 43 + .../doc/html/classeo_quad_distance.png | Bin 0 -> 1941 bytes .../doc/html/classeo_quad_gen_op-members.html | 32 + .../doc/html/classeo_quad_gen_op.html | 58 + .../doc/html/classeo_quad_gen_op.png | Bin 0 -> 1961 bytes .../doc/html/classeo_quad_op-members.html | 29 + .../doc/html/classeo_quad_op.html | 48 + .../paradiseo-eo/doc/html/classeo_quad_op.png | Bin 0 -> 1759 bytes .../html/classeo_random_reduce-members.html | 18 + .../doc/html/classeo_random_reduce.html | 43 + .../doc/html/classeo_random_reduce.png | Bin 0 -> 1898 bytes .../html/classeo_random_select-members.html | 19 + .../doc/html/classeo_random_select.html | 43 + .../doc/html/classeo_random_select.png | Bin 0 -> 1915 bytes .../html/classeo_random_split-members.html | 21 + .../doc/html/classeo_random_split.html | 54 + .../doc/html/classeo_random_split.png | Bin 0 -> 1851 bytes .../doc/html/classeo_ranking-members.html | 43 + .../doc/html/classeo_ranking.html | 60 + .../paradiseo-eo/doc/html/classeo_ranking.png | Bin 0 -> 2415 bytes .../html/classeo_ranking_select-members.html | 27 + .../doc/html/classeo_ranking_select.html | 102 + .../doc/html/classeo_ranking_select.png | Bin 0 -> 2661 bytes .../doc/html/classeo_real-members.html | 51 + trunk/paradiseo-eo/doc/html/classeo_real.html | 101 + trunk/paradiseo-eo/doc/html/classeo_real.png | Bin 0 -> 1617 bytes .../classeo_real_above_bound-members.html | 34 + .../doc/html/classeo_real_above_bound.html | 177 + .../doc/html/classeo_real_above_bound.png | Bin 0 -> 647 bytes ...asseo_real_base_vector_bounds-members.html | 37 + .../html/classeo_real_base_vector_bounds.html | 162 + .../html/classeo_real_base_vector_bounds.png | Bin 0 -> 648 bytes .../classeo_real_below_bound-members.html | 34 + .../doc/html/classeo_real_below_bound.html | 177 + .../doc/html/classeo_real_below_bound.png | Bin 0 -> 637 bytes .../doc/html/classeo_real_bounds-members.html | 31 + .../doc/html/classeo_real_bounds.html | 102 + .../doc/html/classeo_real_bounds.png | Bin 0 -> 1641 bytes .../classeo_real_init_bounded-members.html | 23 + .../doc/html/classeo_real_init_bounded.html | 59 + .../doc/html/classeo_real_init_bounded.png | Bin 0 -> 1589 bytes .../html/classeo_real_interval-members.html | 36 + .../doc/html/classeo_real_interval.html | 183 + .../doc/html/classeo_real_interval.png | Bin 0 -> 596 bytes .../html/classeo_real_no_bounds-members.html | 32 + .../doc/html/classeo_real_no_bounds.html | 169 + .../doc/html/classeo_real_no_bounds.png | Bin 0 -> 633 bytes .../doc/html/classeo_real_ux_over.html | 26 + .../classeo_real_vector_bounds-members.html | 53 + .../doc/html/classeo_real_vector_bounds.html | 175 + .../doc/html/classeo_real_vector_bounds.png | Bin 0 -> 1196 bytes ...classeo_real_vector_no_bounds-members.html | 52 + .../html/classeo_real_vector_no_bounds.html | 111 + .../html/classeo_real_vector_no_bounds.png | Bin 0 -> 1144 bytes .../doc/html/classeo_reduce-members.html | 18 + .../paradiseo-eo/doc/html/classeo_reduce.html | 46 + .../paradiseo-eo/doc/html/classeo_reduce.png | Bin 0 -> 3666 bytes .../html/classeo_reduce_merge-members.html | 21 + .../doc/html/classeo_reduce_merge.html | 59 + .../doc/html/classeo_reduce_merge.png | Bin 0 -> 3232 bytes .../classeo_reduce_merge_reduce-members.html | 26 + .../doc/html/classeo_reduce_merge_reduce.html | 68 + .../doc/html/classeo_reduce_merge_reduce.png | Bin 0 -> 1886 bytes .../html/classeo_reduce_split-members.html | 18 + .../doc/html/classeo_reduce_split.html | 42 + .../doc/html/classeo_reduce_split.png | Bin 0 -> 3224 bytes .../doc/html/classeo_replacement-members.html | 18 + .../doc/html/classeo_replacement.html | 49 + .../doc/html/classeo_replacement.png | Bin 0 -> 5255 bytes .../html/classeo_rnd_generator-members.html | 20 + .../doc/html/classeo_rnd_generator.html | 47 + .../doc/html/classeo_rnd_generator.png | Bin 0 -> 1363 bytes .../doc/html/classeo_rng-members.html | 48 + trunk/paradiseo-eo/doc/html/classeo_rng.html | 581 + trunk/paradiseo-eo/doc/html/classeo_rng.png | Bin 0 -> 633 bytes ...classeo_roulette_worth_select-members.html | 26 + .../html/classeo_roulette_worth_select.html | 62 + .../html/classeo_roulette_worth_select.png | Bin 0 -> 2338 bytes .../doc/html/classeo_s_g_a-members.html | 26 + .../paradiseo-eo/doc/html/classeo_s_g_a.html | 71 + trunk/paradiseo-eo/doc/html/classeo_s_g_a.png | Bin 0 -> 1478 bytes .../html/classeo_s_g_a_gen_op-members.html | 38 + .../doc/html/classeo_s_g_a_gen_op.html | 79 + .../doc/html/classeo_s_g_a_gen_op.png | Bin 0 -> 1968 bytes .../html/classeo_s_g_a_transform-members.html | 23 + .../doc/html/classeo_s_g_a_transform.html | 107 + .../doc/html/classeo_s_g_a_transform.png | Bin 0 -> 1546 bytes ..._a_det_tournament_replacement-members.html | 22 + ...eo_s_s_g_a_det_tournament_replacement.html | 52 + ...seo_s_s_g_a_det_tournament_replacement.png | Bin 0 -> 2304 bytes ..._stoch_tournament_replacement-members.html | 22 + ..._s_s_g_a_stoch_tournament_replacement.html | 53 + ...o_s_s_g_a_stoch_tournament_replacement.png | Bin 0 -> 2306 bytes ...seo_s_s_g_a_worse_replacement-members.html | 22 + .../classeo_s_s_g_a_worse_replacement.html | 48 + .../classeo_s_s_g_a_worse_replacement.png | Bin 0 -> 2248 bytes .../doc/html/classeo_s_t_l_b_f-members.html | 17 + .../doc/html/classeo_s_t_l_b_f.html | 45 + .../doc/html/classeo_s_t_l_f-members.html | 18 + .../doc/html/classeo_s_t_l_f.html | 49 + .../doc/html/classeo_s_t_l_u_f-members.html | 17 + .../doc/html/classeo_s_t_l_u_f.html | 45 + .../html/classeo_scalar_fitness-members.html | 25 + .../doc/html/classeo_scalar_fitness.html | 67 + ...sseo_scalar_fitness_assembled-members.html | 37 + .../classeo_scalar_fitness_assembled.html | 145 + ...alar_fitness_assembled_traits-members.html | 21 + ...asseo_scalar_fitness_assembled_traits.html | 57 + .../classeo_scalar_fitness_stat-members.html | 40 + .../doc/html/classeo_scalar_fitness_stat.html | 53 + .../doc/html/classeo_scalar_fitness_stat.png | Bin 0 -> 2972 bytes .../classeo_second_moment_stats-members.html | 42 + .../doc/html/classeo_second_moment_stats.html | 66 + .../doc/html/classeo_second_moment_stats.png | Bin 0 -> 2808 bytes .../classeo_segment_crossover-members.html | 33 + .../doc/html/classeo_segment_crossover.html | 213 + .../doc/html/classeo_segment_crossover.png | Bin 0 -> 1752 bytes .../html/classeo_sel_bin_gen_op-members.html | 33 + .../doc/html/classeo_sel_bin_gen_op.html | 61 + .../doc/html/classeo_sel_bin_gen_op.png | Bin 0 -> 1979 bytes .../doc/html/classeo_select-members.html | 18 + .../paradiseo-eo/doc/html/classeo_select.html | 45 + .../paradiseo-eo/doc/html/classeo_select.png | Bin 0 -> 3829 bytes .../html/classeo_select_factory-members.html | 23 + .../doc/html/classeo_select_factory.html | 99 + .../doc/html/classeo_select_factory.png | Bin 0 -> 730 bytes .../classeo_select_from_worth-members.html | 23 + .../doc/html/classeo_select_from_worth.html | 62 + .../doc/html/classeo_select_from_worth.png | Bin 0 -> 2016 bytes .../doc/html/classeo_select_many-members.html | 22 + .../doc/html/classeo_select_many.html | 115 + .../doc/html/classeo_select_many.png | Bin 0 -> 1909 bytes .../html/classeo_select_number-members.html | 21 + .../doc/html/classeo_select_number.html | 112 + .../doc/html/classeo_select_number.png | Bin 0 -> 1917 bytes .../doc/html/classeo_select_one-members.html | 19 + .../doc/html/classeo_select_one.html | 46 + .../doc/html/classeo_select_one.png | Bin 0 -> 1632 bytes .../doc/html/classeo_select_perc-members.html | 21 + .../doc/html/classeo_select_perc.html | 112 + .../doc/html/classeo_select_perc.png | Bin 0 -> 1899 bytes .../classeo_select_transform-members.html | 21 + .../doc/html/classeo_select_transform.html | 55 + .../doc/html/classeo_select_transform.png | Bin 0 -> 1924 bytes .../classeo_selective_populator-members.html | 32 + .../doc/html/classeo_selective_populator.html | 50 + .../doc/html/classeo_selective_populator.png | Bin 0 -> 539 bytes .../html/classeo_seq_populator-members.html | 31 + .../doc/html/classeo_seq_populator.html | 48 + .../doc/html/classeo_seq_populator.png | Bin 0 -> 505 bytes .../html/classeo_sequential_op-members.html | 38 + .../doc/html/classeo_sequential_op.html | 59 + .../doc/html/classeo_sequential_op.png | Bin 0 -> 2283 bytes .../classeo_sequential_select-members.html | 23 + .../doc/html/classeo_sequential_select.html | 64 + .../doc/html/classeo_sequential_select.png | Bin 0 -> 1954 bytes .../doc/html/classeo_sharing-members.html | 42 + .../doc/html/classeo_sharing.html | 55 + .../paradiseo-eo/doc/html/classeo_sharing.png | Bin 0 -> 2420 bytes .../html/classeo_sharing_select-members.html | 27 + .../doc/html/classeo_sharing_select.html | 101 + .../doc/html/classeo_sharing_select.png | Bin 0 -> 2660 bytes .../html/classeo_simple_e_d_a-members.html | 23 + .../doc/html/classeo_simple_e_d_a.html | 119 + .../doc/html/classeo_simple_e_d_a.png | Bin 0 -> 1780 bytes .../html/classeo_sorted_pop_stat-members.html | 40 + .../doc/html/classeo_sorted_pop_stat.html | 143 + .../doc/html/classeo_sorted_pop_stat.png | Bin 0 -> 2913 bytes .../doc/html/classeo_sorted_stat-members.html | 38 + .../doc/html/classeo_sorted_stat.html | 47 + .../doc/html/classeo_sorted_stat.png | Bin 0 -> 2581 bytes .../classeo_sorted_stat_base-members.html | 20 + .../doc/html/classeo_sorted_stat_base.html | 55 + .../doc/html/classeo_sorted_stat_base.png | Bin 0 -> 5299 bytes .../classeo_st_branch_mutation-members.html | 34 + .../doc/html/classeo_st_branch_mutation.html | 165 + .../doc/html/classeo_st_branch_mutation.png | Bin 0 -> 2330 bytes .../classeo_st_hoist_mutation-members.html | 34 + .../doc/html/classeo_st_hoist_mutation.html | 165 + .../doc/html/classeo_st_hoist_mutation.png | Bin 0 -> 2321 bytes ...sseo_st_parse_tree_depth_init-members.html | 27 + .../classeo_st_parse_tree_depth_init.html | 181 + .../html/classeo_st_parse_tree_depth_init.png | Bin 0 -> 2083 bytes .../classeo_st_point_mutation-members.html | 33 + .../doc/html/classeo_st_point_mutation.html | 153 + .../doc/html/classeo_st_point_mutation.png | Bin 0 -> 2315 bytes .../classeo_st_subtree_x_over-members.html | 33 + .../doc/html/classeo_st_subtree_x_over.html | 109 + .../doc/html/classeo_st_subtree_x_over.png | Bin 0 -> 3208 bytes .../doc/html/classeo_stat-members.html | 38 + trunk/paradiseo-eo/doc/html/classeo_stat.html | 47 + trunk/paradiseo-eo/doc/html/classeo_stat.png | Bin 0 -> 2309 bytes .../doc/html/classeo_stat_base-members.html | 20 + .../doc/html/classeo_stat_base.html | 58 + .../doc/html/classeo_stat_base.png | Bin 0 -> 7078 bytes .../doc/html/classeo_state-members.html | 33 + .../paradiseo-eo/doc/html/classeo_state.html | 276 + trunk/paradiseo-eo/doc/html/classeo_state.png | Bin 0 -> 373 bytes .../html/classeo_stdout_monitor-members.html | 28 + .../doc/html/classeo_stdout_monitor.html | 56 + .../doc/html/classeo_stdout_monitor.png | Bin 0 -> 644 bytes .../classeo_steady_fit_continue-members.html | 37 + .../doc/html/classeo_steady_fit_continue.html | 144 + .../doc/html/classeo_steady_fit_continue.png | Bin 0 -> 2327 bytes ...asseo_stoch_tournament_select-members.html | 21 + .../html/classeo_stoch_tournament_select.html | 50 + .../html/classeo_stoch_tournament_select.png | Bin 0 -> 1975 bytes ...seo_stoch_tournament_truncate-members.html | 20 + .../classeo_stoch_tournament_truncate.html | 52 + .../classeo_stoch_tournament_truncate.png | Bin 0 -> 1960 bytes ...och_tournament_truncate_split-members.html | 23 + ...asseo_stoch_tournament_truncate_split.html | 59 + ...lasseo_stoch_tournament_truncate_split.png | Bin 0 -> 1999 bytes ...stoch_tournament_worth_select-members.html | 26 + ...classeo_stoch_tournament_worth_select.html | 58 + .../classeo_stoch_tournament_worth_select.png | Bin 0 -> 2398 bytes ...o_stochastic_universal_select-members.html | 22 + .../classeo_stochastic_universal_select.html | 59 + .../classeo_stochastic_universal_select.png | Bin 0 -> 2011 bytes .../doc/html/classeo_string-members.html | 48 + .../paradiseo-eo/doc/html/classeo_string.html | 104 + .../paradiseo-eo/doc/html/classeo_string.png | Bin 0 -> 971 bytes .../html/classeo_subtree_x_over-members.html | 33 + .../doc/html/classeo_subtree_x_over.html | 109 + .../doc/html/classeo_subtree_x_over.png | Bin 0 -> 3181 bytes .../html/classeo_survive_and_die-members.html | 21 + .../doc/html/classeo_survive_and_die.html | 49 + .../doc/html/classeo_survive_and_die.png | Bin 0 -> 1979 bytes .../doc/html/classeo_sym_init-members.html | 26 + .../doc/html/classeo_sym_init.html | 67 + .../doc/html/classeo_sym_init.png | Bin 0 -> 1378 bytes .../html/classeo_time_counter-members.html | 40 + .../doc/html/classeo_time_counter.html | 46 + .../doc/html/classeo_time_counter.png | Bin 0 -> 1173 bytes ...lasseo_time_varying_loop_eval-members.html | 20 + .../html/classeo_time_varying_loop_eval.html | 51 + .../html/classeo_time_varying_loop_eval.png | Bin 0 -> 1928 bytes .../classeo_timed_dyn_update-members.html | 26 + .../doc/html/classeo_timed_dyn_update.html | 54 + .../doc/html/classeo_timed_dyn_update.png | Bin 0 -> 762 bytes .../html/classeo_timed_monitor-members.html | 29 + .../doc/html/classeo_timed_monitor.html | 59 + .../doc/html/classeo_timed_monitor.png | Bin 0 -> 645 bytes .../classeo_timed_state_saver-members.html | 28 + .../doc/html/classeo_timed_state_saver.html | 65 + .../doc/html/classeo_timed_state_saver.png | Bin 0 -> 648 bytes .../doc/html/classeo_transform-members.html | 18 + .../doc/html/classeo_transform.html | 39 + .../doc/html/classeo_transform.png | Bin 0 -> 2201 bytes .../html/classeo_trunc_select-members.html | 21 + .../doc/html/classeo_trunc_select.html | 111 + .../doc/html/classeo_trunc_select.png | Bin 0 -> 1891 bytes .../doc/html/classeo_truncate-members.html | 18 + .../doc/html/classeo_truncate.html | 43 + .../doc/html/classeo_truncate.png | Bin 0 -> 1843 bytes .../html/classeo_truncate_split-members.html | 21 + .../doc/html/classeo_truncate_split.html | 54 + .../doc/html/classeo_truncate_split.png | Bin 0 -> 1855 bytes ...classeo_truncated_select_many-members.html | 23 + .../html/classeo_truncated_select_many.html | 121 + .../html/classeo_truncated_select_many.png | Bin 0 -> 1960 bytes .../classeo_truncated_select_one-members.html | 25 + .../html/classeo_truncated_select_one.html | 115 + .../doc/html/classeo_truncated_select_one.png | Bin 0 -> 1965 bytes .../doc/html/classeo_u_bit_xover-members.html | 30 + .../doc/html/classeo_u_bit_xover.html | 112 + .../doc/html/classeo_u_bit_xover.png | Bin 0 -> 1836 bytes .../doc/html/classeo_u_f-members.html | 18 + trunk/paradiseo-eo/doc/html/classeo_u_f.html | 53 + trunk/paradiseo-eo/doc/html/classeo_u_f.png | Bin 0 -> 644 bytes ...classeo_unary_functor_counter-members.html | 34 + .../html/classeo_unary_functor_counter.html | 96 + .../html/classeo_unary_functor_counter.png | Bin 0 -> 841 bytes ...classeo_uniform_atom_exchange-members.html | 23 + .../html/classeo_uniform_atom_exchange.html | 61 + .../html/classeo_uniform_atom_exchange.png | Bin 0 -> 1751 bytes .../classeo_uniform_gene_chooser-members.html | 20 + .../html/classeo_uniform_gene_chooser.html | 46 + .../doc/html/classeo_uniform_gene_chooser.png | Bin 0 -> 1536 bytes .../classeo_uniform_generator-members.html | 25 + .../doc/html/classeo_uniform_generator.html | 68 + .../doc/html/classeo_uniform_generator.png | Bin 0 -> 761 bytes .../html/classeo_uniform_init-members.html | 26 + .../doc/html/classeo_uniform_init.html | 73 + .../doc/html/classeo_uniform_init.png | Bin 0 -> 1146 bytes .../classeo_uniform_mutation-members.html | 35 + .../doc/html/classeo_uniform_mutation.html | 285 + .../doc/html/classeo_uniform_mutation.png | Bin 0 -> 1486 bytes .../doc/html/classeo_updatable-members.html | 16 + .../doc/html/classeo_updatable.html | 41 + .../doc/html/classeo_updatable.png | Bin 0 -> 494 bytes .../doc/html/classeo_updater-members.html | 21 + .../doc/html/classeo_updater.html | 51 + .../paradiseo-eo/doc/html/classeo_updater.png | Bin 0 -> 2379 bytes .../doc/html/classeo_value_param-members.html | 31 + .../doc/html/classeo_value_param.html | 216 + .../doc/html/classeo_value_param.png | Bin 0 -> 911 bytes ...lasseo_variable_pareto_traits-members.html | 21 + .../html/classeo_variable_pareto_traits.html | 52 + .../html/classeo_variable_pareto_traits.png | Bin 0 -> 523 bytes .../doc/html/classeo_vector-members.html | 50 + .../paradiseo-eo/doc/html/classeo_vector.html | 124 + .../paradiseo-eo/doc/html/classeo_vector.png | Bin 0 -> 1167 bytes .../html/classeo_vl_add_mutation-members.html | 32 + .../doc/html/classeo_vl_add_mutation.html | 114 + .../doc/html/classeo_vl_add_mutation.png | Bin 0 -> 1489 bytes ...sseo_vl_atom_exchange_quad_op-members.html | 33 + .../classeo_vl_atom_exchange_quad_op.html | 66 + .../html/classeo_vl_atom_exchange_quad_op.png | Bin 0 -> 1792 bytes .../html/classeo_vl_del_mutation-members.html | 34 + .../doc/html/classeo_vl_del_mutation.html | 203 + .../doc/html/classeo_vl_del_mutation.png | Bin 0 -> 1489 bytes .../classeo_vl_uniform_bin_op-members.html | 33 + .../doc/html/classeo_vl_uniform_bin_op.html | 63 + .../doc/html/classeo_vl_uniform_bin_op.png | Bin 0 -> 1951 bytes .../classeo_vl_uniform_quad_op-members.html | 33 + .../doc/html/classeo_vl_uniform_quad_op.html | 63 + .../doc/html/classeo_vl_uniform_quad_op.png | Bin 0 -> 1719 bytes ...sseo_weak_elitist_replacement-members.html | 21 + .../classeo_weak_elitist_replacement.html | 56 + .../html/classeo_weak_elitist_replacement.png | Bin 0 -> 1935 bytes trunk/paradiseo-eo/doc/html/classes.html | 38 + ...sgp__parse__tree_1_1_mem_pool-members.html | 22 + .../classgp__parse__tree_1_1_mem_pool.html | 55 + .../html/classnegexp__generator-members.html | 18 + .../doc/html/classnegexp__generator.html | 47 + .../html/classnormal__generator-members.html | 18 + .../doc/html/classnormal__generator.html | 47 + .../html/classrandom__generator-members.html | 21 + .../doc/html/classrandom__generator.html | 55 + .../html/classuniform__generator-members.html | 20 + .../doc/html/classuniform__generator.html | 51 + .../doc/html/compatibility_8h-source.html | 97 + .../doc/html/continuators_8cpp-source.html | 105 + ...contrib_2mathsym_2_r_e_a_d_m_e-source.html | 213 + .../def__abstract__functor_8h-source.html | 154 + trunk/paradiseo-eo/doc/html/dir_000000.html | 242 + trunk/paradiseo-eo/doc/html/dir_000001.html | 63 + trunk/paradiseo-eo/doc/html/dir_000002.html | 115 + trunk/paradiseo-eo/doc/html/dir_000003.html | 34 + trunk/paradiseo-eo/doc/html/dir_000004.html | 29 + trunk/paradiseo-eo/doc/html/dir_000005.html | 29 + trunk/paradiseo-eo/doc/html/dir_000006.html | 29 + trunk/paradiseo-eo/doc/html/dir_000007.html | 28 + trunk/paradiseo-eo/doc/html/dir_000008.html | 40 + trunk/paradiseo-eo/doc/html/dir_000009.html | 35 + trunk/paradiseo-eo/doc/html/dir_000010.html | 105 + trunk/paradiseo-eo/doc/html/dir_000011.html | 115 + trunk/paradiseo-eo/doc/html/dir_000012.html | 37 + trunk/paradiseo-eo/doc/html/dir_000013.html | 57 + trunk/paradiseo-eo/doc/html/dir_000014.html | 25 + trunk/paradiseo-eo/doc/html/dir_000015.html | 25 + trunk/paradiseo-eo/doc/html/dir_000016.html | 39 + trunk/paradiseo-eo/doc/html/dir_000017.html | 33 + trunk/paradiseo-eo/doc/html/dir_000018.html | 37 + trunk/paradiseo-eo/doc/html/dir_000019.html | 25 + trunk/paradiseo-eo/doc/html/dir_000020.html | 25 + trunk/paradiseo-eo/doc/html/dir_000021.html | 27 + trunk/paradiseo-eo/doc/html/dir_000022.html | 31 + trunk/paradiseo-eo/doc/html/dir_000023.html | 33 + trunk/paradiseo-eo/doc/html/dir_000024.html | 31 + trunk/paradiseo-eo/doc/html/dir_000025.html | 43 + trunk/paradiseo-eo/doc/html/dir_000026.html | 33 + trunk/paradiseo-eo/doc/html/dir_000027.html | 23 + trunk/paradiseo-eo/doc/html/dir_000028.html | 31 + trunk/paradiseo-eo/doc/html/dir_000029.html | 31 + trunk/paradiseo-eo/doc/html/doxygen.css | 271 + trunk/paradiseo-eo/doc/html/doxygen.png | Bin 0 -> 1281 bytes .../doc/html/eig_8cpp-source.html | 274 + .../paradiseo-eo/doc/html/eig_8h-source.html | 40 + .../doc/html/eo_aged_8h-source.html | 91 + .../doc/html/eo_algo_8h-source.html | 51 + .../eo_assembled_fitness_stat_8h-source.html | 116 + .../doc/html/eo_bit_8h-source.html | 108 + .../doc/html/eo_bit_op_8h-source.html | 343 + .../doc/html/eo_bit_op_factory_8h-source.html | 167 + .../doc/html/eo_bool_flip_8h-source.html | 57 + .../doc/html/eo_breed_8h-source.html | 55 + .../doc/html/eo_c_m_a_breed_8h-source.html | 91 + .../doc/html/eo_c_m_a_init_8h-source.html | 68 + .../html/eo_cellular_easy_e_a_8h-source.html | 164 + .../doc/html/eo_check_point_8h-source.html | 165 + .../doc/html/eo_clone_ops_8h-source.html | 74 + .../html/eo_combined_continue_8h-source.html | 89 + .../doc/html/eo_combined_init_8h-source.html | 91 + .../doc/html/eo_continue_8h-source.html | 65 + .../doc/html/eo_counter_8h-source.html | 142 + .../html/eo_ctrl_c_continue_8cpp-source.html | 65 + .../html/eo_ctrl_c_continue_8h-source.html | 85 + .../doc/html/eo_data_8cpp-source.html | 26 + .../doc/html/eo_data_8h-source.html | 45 + .../doc/html/eo_det_select_8h-source.html | 66 + .../eo_det_tournament_select_8h-source.html | 85 + .../doc/html/eo_distance_8h-source.html | 99 + .../html/eo_distrib_updater_8h-source.html | 57 + .../doc/html/eo_distribution_8h-source.html | 57 + .../doc/html/eo_dominance_map_8h-source.html | 119 + .../doc/html/eo_drawable_8h-source.html | 66 + .../doc/html/eo_e_d_a_8h-source.html | 53 + .../doc/html/eo_easy_e_a_8h-source.html | 236 + .../doc/html/eo_es_chrom_init_8h-source.html | 160 + .../doc/html/eo_es_full_8h-source.html | 93 + .../html/eo_es_global_xover_8h-source.html | 116 + .../doc/html/eo_es_mutate_8h-source.html | 213 + .../html/eo_es_mutation_init_8h-source.html | 112 + .../doc/html/eo_es_simple_8h-source.html | 82 + .../html/eo_es_standard_xover_8h-source.html | 100 + .../doc/html/eo_es_stdev_8h-source.html | 88 + .../doc/html/eo_eval_continue_8h-source.html | 76 + .../doc/html/eo_eval_func_8h-source.html | 53 + .../html/eo_eval_func_counter_8h-source.html | 67 + .../doc/html/eo_eval_func_ptr_8h-source.html | 45 + .../doc/html/eo_external_e_o_8h-source.html | 91 + .../eo_external_op_functions_8h-source.html | 140 + .../doc/html/eo_f_d_c_stat_8h-source.html | 130 + .../doc/html/eo_factory_8h-source.html | 68 + .../doc/html/eo_file_monitor_8cpp-source.html | 92 + .../doc/html/eo_file_monitor_8h-source.html | 86 + .../doc/html/eo_file_snapshot_8h-source.html | 176 + .../doc/html/eo_fit_continue_8h-source.html | 72 + .../eo_fitness_scaling_select_8h-source.html | 62 + .../doc/html/eo_fl_or_bin_op_8h-source.html | 199 + .../doc/html/eo_fl_or_mon_op_8h-source.html | 113 + .../doc/html/eo_fl_or_quad_op_8h-source.html | 198 + .../doc/html/eo_functor_8h-source.html | 127 + .../html/eo_functor_store_8cpp-source.html | 30 + .../doc/html/eo_functor_store_8h-source.html | 76 + .../doc/html/eo_g3_replacement_8h-source.html | 69 + .../doc/html/eo_gen_continue_8h-source.html | 108 + .../doc/html/eo_gen_op_8h-source.html | 177 + .../html/eo_general_breeder_8h-source.html | 99 + .../eo_gnuplot1_d_monitor_8cpp-source.html | 100 + .../html/eo_gnuplot1_d_monitor_8h-source.html | 83 + .../eo_gnuplot1_d_snapshot_8cpp-source.html | 47 + .../eo_gnuplot1_d_snapshot_8h-source.html | 123 + .../doc/html/eo_gnuplot_8cpp-source.html | 113 + .../doc/html/eo_gnuplot_8h-source.html | 83 + .../doc/html/eo_how_many_8h-source.html | 153 + .../doc/html/eo_init_8h-source.html | 156 + .../doc/html/eo_init_virus_8h-source.html | 95 + .../doc/html/eo_int_bounds_8cpp-source.html | 110 + .../doc/html/eo_int_bounds_8h-source.html | 525 + .../doc/html/eo_invalidate_ops_8h-source.html | 110 + .../html/eo_linear_fit_scaling_8h-source.html | 75 + .../html/eo_m_g_g_replacement_8h-source.html | 86 + .../html/eo_m_o_fitness_stat_8h-source.html | 98 + .../doc/html/eo_merge_8h-source.html | 128 + .../doc/html/eo_merge_reduce_8h-source.html | 87 + .../doc/html/eo_monitor_8h-source.html | 69 + .../doc/html/eo_n_d_sorting_8h-source.html | 439 + .../html/eo_normal_mutation_8h-source.html | 208 + .../doc/html/eo_object_8h-source.html | 64 + .../doc/html/eo_one_max_8h-source.html | 90 + .../html/eo_one_max_eval_func_8h-source.html | 68 + .../doc/html/eo_one_max_init_8h-source.html | 60 + .../html/eo_one_max_mutation_8h-source.html | 58 + .../eo_one_max_quad_crossover_8h-source.html | 59 + .../html/eo_one_to_one_breeder_8h-source.html | 123 + .../doc/html/eo_op_8h-source.html | 118 + .../doc/html/eo_op_container_8h-source.html | 149 + .../doc/html/eo_op_sel_mason_8h-source.html | 105 + .../html/eo_p_b_i_l_additive_8h-source.html | 118 + .../html/eo_p_b_i_l_distrib_8h-source.html | 97 + .../doc/html/eo_p_b_i_l_org_8h-source.html | 82 + .../doc/html/eo_param_8h-source.html | 365 + ...o_pareto_constraint_fitness_8h-source.html | 215 + .../html/eo_pareto_fitness_8cpp-source.html | 53 + .../doc/html/eo_pareto_fitness_8h-source.html | 221 + .../doc/html/eo_pareto_ranking_8h-source.html | 57 + .../doc/html/eo_parse_tree_8h-source.html | 166 + .../eo_parse_tree_depth_init_8h-source.html | 208 + .../doc/html/eo_parse_tree_op_8h-source.html | 303 + .../doc/html/eo_parser_8cpp-source.html | 427 + .../doc/html/eo_parser_8h-source.html | 210 + .../doc/html/eo_perf2_worth_8h-source.html | 216 + .../html/eo_periodic_continue_8h-source.html | 75 + .../doc/html/eo_persistent_8cpp-source.html | 30 + .../doc/html/eo_persistent_8h-source.html | 74 + .../doc/html/eo_pop_8h-source.html | 243 + .../doc/html/eo_pop_algo_8h-source.html | 28 + .../doc/html/eo_pop_eval_func_8h-source.html | 63 + .../doc/html/eo_pop_stat_8h-source.html | 104 + .../doc/html/eo_populator_8h-source.html | 182 + .../doc/html/eo_printable_8cpp-source.html | 37 + .../doc/html/eo_printable_8h-source.html | 63 + .../html/eo_prop_g_a_gen_op_8h-source.html | 88 + ...eo_proportional_combined_op_8h-source.html | 183 + .../eo_proportional_select_8h-source.html | 91 + .../doc/html/eo_r_n_g_8cpp-source.html | 28 + .../doc/html/eo_r_n_g_8h-source.html | 355 + .../doc/html/eo_random_select_8h-source.html | 96 + .../doc/html/eo_ranking_8h-source.html | 97 + .../doc/html/eo_ranking_select_8h-source.html | 60 + .../doc/html/eo_real_8h-source.html | 65 + .../html/eo_real_atom_xover_8h-source.html | 62 + .../doc/html/eo_real_bounds_8cpp-source.html | 267 + .../doc/html/eo_real_bounds_8h-source.html | 493 + .../html/eo_real_init_bounded_8h-source.html | 76 + .../doc/html/eo_real_op_8h-source.html | 382 + .../html/eo_real_vector_bounds_8h-source.html | 334 + .../doc/html/eo_reduce_8h-source.html | 280 + .../doc/html/eo_reduce_merge_8h-source.html | 89 + .../eo_reduce_merge_reduce_8h-source.html | 126 + .../doc/html/eo_reduce_split_8h-source.html | 298 + .../doc/html/eo_replacement_8h-source.html | 71 + .../doc/html/eo_rnd_generators_8h-source.html | 123 + .../doc/html/eo_s_b_xcross_8h-source.html | 127 + .../doc/html/eo_s_g_a_8h-source.html | 125 + .../doc/html/eo_s_g_a_gen_op_8h-source.html | 91 + .../html/eo_s_g_a_transform_8h-source.html | 155 + .../doc/html/eo_s_t_l_functor_8h-source.html | 107 + .../doc/html/eo_scalar_fitness_8h-source.html | 97 + ..._scalar_fitness_assembled_8cpp-source.html | 56 + ...eo_scalar_fitness_assembled_8h-source.html | 248 + .../eo_scalar_fitness_stat_8h-source.html | 75 + .../doc/html/eo_select_8h-source.html | 31 + .../doc/html/eo_select_factory_8h-source.html | 90 + .../html/eo_select_from_worth_8h-source.html | 194 + .../doc/html/eo_select_many_8h-source.html | 59 + .../doc/html/eo_select_number_8h-source.html | 53 + .../doc/html/eo_select_one_8h-source.html | 41 + .../doc/html/eo_select_perc_8h-source.html | 53 + .../html/eo_sequential_select_8h-source.html | 128 + .../doc/html/eo_sharing_8h-source.html | 115 + .../doc/html/eo_sharing_select_8h-source.html | 60 + .../doc/html/eo_simple_e_d_a_8h-source.html | 103 + ...eo_st_parse_tree_depth_init_8h-source.html | 178 + .../html/eo_st_parse_tree_op_8h-source.html | 271 + .../doc/html/eo_stat_8h-source.html | 414 + .../doc/html/eo_state_8cpp-source.html | 210 + .../doc/html/eo_state_8h-source.html | 105 + .../html/eo_stdout_monitor_8cpp-source.html | 70 + .../doc/html/eo_stdout_monitor_8h-source.html | 64 + .../eo_steady_fit_continue_8h-source.html | 117 + .../eo_stoch_tournament_select_8h-source.html | 83 + ...stochastic_universal_select_8h-source.html | 117 + .../doc/html/eo_string_8h-source.html | 85 + .../html/eo_survive_and_die_8h-source.html | 150 + .../doc/html/eo_sym_8h-source.html | 80 + .../html/eo_sym_crossover_8cpp-source.html | 93 + .../doc/html/eo_sym_crossover_8h-source.html | 76 + .../doc/html/eo_sym_eval_8h-source.html | 103 + .../doc/html/eo_sym_init_8h-source.html | 75 + .../eo_sym_lambda_mutate_8cpp-source.html | 44 + .../html/eo_sym_lambda_mutate_8h-source.html | 62 + .../doc/html/eo_sym_mutate_8cpp-source.html | 88 + .../doc/html/eo_sym_mutate_8h-source.html | 119 + .../doc/html/eo_time_counter_8h-source.html | 75 + .../doc/html/eo_timed_monitor_8h-source.html | 87 + .../doc/html/eo_transform_8h-source.html | 31 + .../doc/html/eo_trunc_select_8h-source.html | 53 + .../eo_truncated_select_many_8h-source.html | 88 + .../eo_truncated_select_one_8h-source.html | 88 + .../doc/html/eo_uniform_init_8h-source.html | 123 + .../doc/html/eo_updatable_8h-source.html | 112 + .../doc/html/eo_updater_8cpp-source.html | 63 + .../doc/html/eo_updater_8h-source.html | 149 + ...o_variable_length_crossover_8h-source.html | 316 + ...eo_variable_length_mutation_8h-source.html | 134 + .../doc/html/eo_vector_8h-source.html | 135 + .../doc/html/eo_virus_8h-source.html | 116 + .../doc/html/es_2make__op_8h-source.html | 303 + trunk/paradiseo-eo/doc/html/es_8h-source.html | 78 + .../doc/html/exercise1_83_8cpp-source.html | 159 + .../doc/html/exercise2_83_8cpp-source.html | 198 + .../doc/html/exercise3_81_8cpp-source.html | 407 + trunk/paradiseo-eo/doc/html/files.html | 431 + .../doc/html/fitness_8h-source.html | 243 + .../doc/html/fitness__traits_8cpp-source.html | 448 + trunk/paradiseo-eo/doc/html/ftv2blank.png | Bin 0 -> 174 bytes trunk/paradiseo-eo/doc/html/ftv2doc.png | Bin 0 -> 255 bytes .../doc/html/ftv2folderclosed.png | Bin 0 -> 259 bytes .../paradiseo-eo/doc/html/ftv2folderopen.png | Bin 0 -> 261 bytes trunk/paradiseo-eo/doc/html/ftv2lastnode.png | Bin 0 -> 233 bytes trunk/paradiseo-eo/doc/html/ftv2link.png | Bin 0 -> 358 bytes trunk/paradiseo-eo/doc/html/ftv2mlastnode.png | Bin 0 -> 160 bytes trunk/paradiseo-eo/doc/html/ftv2mnode.png | Bin 0 -> 194 bytes trunk/paradiseo-eo/doc/html/ftv2node.png | Bin 0 -> 235 bytes trunk/paradiseo-eo/doc/html/ftv2plastnode.png | Bin 0 -> 165 bytes trunk/paradiseo-eo/doc/html/ftv2pnode.png | Bin 0 -> 200 bytes trunk/paradiseo-eo/doc/html/ftv2vertline.png | Bin 0 -> 229 bytes trunk/paradiseo-eo/doc/html/functions.html | 403 + .../paradiseo-eo/doc/html/functions_func.html | 382 + .../paradiseo-eo/doc/html/functions_type.html | 22 + .../paradiseo-eo/doc/html/functions_vars.html | 36 + .../doc/html/ga_2make__op_8h-source.html | 223 + trunk/paradiseo-eo/doc/html/ga_8h-source.html | 57 + .../doc/html/genetic_ops_8cpp-source.html | 173 + .../doc/html/gprop_8cpp-source.html | 185 + .../doc/html/gprop_8h-source.html | 254 + .../html/group___evolution_strategies.html | 41 + .../doc/html/group___operators.html | 17 + .../doc/html/group___parse_tree.html | 116 + .../html/group___prop_combined_operators.html | 17 + .../doc/html/group___st_parse_tree.html | 40 + .../doc/html/group__bitstring.html | 57 + .../doc/html/group__selectors.html | 16 + trunk/paradiseo-eo/doc/html/hierarchy.html | 1323 ++ trunk/paradiseo-eo/doc/html/index.html | 8 + .../doc/html/index_8h-source.html | 20 + trunk/paradiseo-eo/doc/html/installdox | 117 + trunk/paradiseo-eo/doc/html/l2_8h-source.html | 155 + trunk/paradiseo-eo/doc/html/main.html | 23 + .../doc/html/main_8cpp-source.html | 187 + .../html/make___my_struct_8cpp-source.html | 137 + .../doc/html/make___one_max_8cpp-source.html | 137 + .../html/make___p_b_i_ldistrib_8h-source.html | 105 + .../html/make___p_b_i_lupdate_8h-source.html | 83 + .../doc/html/make__algo__easea_8h-source.html | 349 + .../html/make__algo__pareto_8h-source.html | 218 + .../html/make__algo__scalar_8h-source.html | 326 + .../make__algo__scalar__es_8cpp-source.html | 85 + .../make__algo__scalar__ga_8cpp-source.html | 63 + .../make__algo__scalar__real_8cpp-source.html | 63 + .../doc/html/make__checkpoint_8h-source.html | 288 + .../make__checkpoint___f_d_c_8h-source.html | 292 + ...make__checkpoint__assembled_8h-source.html | 215 + .../make__checkpoint__es_8cpp-source.html | 83 + .../make__checkpoint__ga_8cpp-source.html | 63 + .../make__checkpoint__pareto_8h-source.html | 245 + .../make__checkpoint__real_8cpp-source.html | 63 + .../doc/html/make__continue_8h-source.html | 173 + .../html/make__continue__es_8cpp-source.html | 83 + .../html/make__continue__ga_8cpp-source.html | 63 + .../make__continue__pareto_8h-source.html | 120 + .../make__continue__real_8cpp-source.html | 63 + .../doc/html/make__es_8h-source.html | 142 + .../doc/html/make__ga_8h-source.html | 96 + .../make__general__replacement_8h-source.html | 175 + .../make__genotype___my_struct_8h-source.html | 88 + .../make__genotype___one_max_8h-source.html | 90 + .../html/make__genotype__es_8cpp-source.html | 108 + .../html/make__genotype__ga_8cpp-source.html | 58 + .../html/make__genotype__ga_8h-source.html | 91 + .../make__genotype__real_8cpp-source.html | 64 + .../html/make__genotype__real_8h-source.html | 107 + .../doc/html/make__help_8cpp-source.html | 107 + .../html/make__op___my_struct_8h-source.html | 211 + .../html/make__op___one_max_8h-source.html | 211 + .../doc/html/make__op__es_8cpp-source.html | 81 + .../doc/html/make__op__es_8h-source.html | 210 + .../doc/html/make__op__ga_8cpp-source.html | 61 + .../doc/html/make__op__real_8cpp-source.html | 60 + .../doc/html/make__op__real_8h-source.html | 297 + .../doc/html/make__pop_8h-source.html | 114 + .../doc/html/make__pop__es_8cpp-source.html | 86 + .../doc/html/make__pop__ga_8cpp-source.html | 64 + .../doc/html/make__pop__real_8cpp-source.html | 64 + .../doc/html/make__real_8h-source.html | 98 + .../doc/html/make__run_8h-source.html | 60 + .../doc/html/make__run__es_8cpp-source.html | 87 + .../doc/html/make__run__ga_8cpp-source.html | 65 + .../doc/html/make__run__real_8cpp-source.html | 65 + .../doc/html/mastermind_8cpp-source.html | 153 + .../doc/html/mastermind_8h-source.html | 214 + .../doc/html/matrices_8h-source.html | 57 + .../doc/html/mergers_8cpp-source.html | 56 + .../paradiseo-eo/doc/html/mlp_8h-source.html | 472 + trunk/paradiseo-eo/doc/html/modules.html | 22 + .../doc/html/monitors_8cpp-source.html | 80 + .../paradiseo-eo/doc/html/mse_8h-source.html | 155 + .../doc/html/namespacegp__parse__tree.html | 111 + .../doc/html/namespacemembers.html | 19 + .../doc/html/namespacemembers_func.html | 19 + trunk/paradiseo-eo/doc/html/namespaces.html | 16 + .../paradiseo-eo/doc/html/node_8h-source.html | 263 + .../doc/html/node__pool_8h-source.html | 312 + trunk/paradiseo-eo/doc/html/pages.html | 21 + .../doc/html/parameters_8h-source.html | 127 + .../doc/html/parse__tree_8h-source.html | 862 + .../doc/html/perf2worth_8cpp-source.html | 103 + .../doc/html/pickle_8h-source.html | 78 + .../doc/html/pipecom_8cpp-source.html | 187 + .../doc/html/pipecom_8h-source.html | 62 + trunk/paradiseo-eo/doc/html/qp_8h-source.html | 266 + .../doc/html/random__numbers_8cpp-source.html | 122 + .../doc/html/reduce_8cpp-source.html | 80 + trunk/paradiseo-eo/doc/html/related.html | 15 + .../doc/html/replacement_8cpp-source.html | 87 + .../doc/html/rnd__generators_8h-source.html | 150 + trunk/paradiseo-eo/doc/html/search.idx | Bin 0 -> 1173672 bytes trunk/paradiseo-eo/doc/html/search.php | 357 + .../doc/html/select_one_8cpp-source.html | 122 + .../doc/html/selectors_8cpp-source.html | 76 + .../doc/html/selectors_8h-source.html | 349 + .../doc/html/shared__ptr_8h-source.html | 117 + .../doc/html/src_2pyeo_2_n_e_w_s-source.html | 15 + .../html/src_2pyeo_2_r_e_a_d_m_e-source.html | 19 + .../doc/html/statistics_8cpp-source.html | 76 + .../doc/html/stats_8h-source.html | 133 + .../doc/html/struct_dummy-members.html | 56 + trunk/paradiseo-eo/doc/html/struct_dummy.html | 255 + trunk/paradiseo-eo/doc/html/struct_dummy.png | Bin 0 -> 1564 bytes .../html/struct_t__pickle__suite-members.html | 17 + .../doc/html/struct_t__pickle__suite.html | 41 + .../html/structeo_eval_func_ptr-members.html | 22 + .../doc/html/structeo_eval_func_ptr.html | 95 + .../doc/html/structeo_eval_func_ptr.png | Bin 0 -> 1552 bytes ...functor_base_1_1binary__function__tag.html | 28 + ...ructeo_functor_base_1_1procedure__tag.html | 28 + ..._functor_base_1_1unary__function__tag.html | 28 + .../html/structeo_pop_1_1_cmp-members.html | 15 + .../doc/html/structeo_pop_1_1_cmp.html | 35 + .../html/structeo_pop_1_1_ref-members.html | 15 + .../doc/html/structeo_pop_1_1_ref.html | 35 + ...ucteo_state_1_1loading__error-members.html | 15 + .../structeo_state_1_1loading__error.html | 32 + .../doc/html/sym__compile_8cpp-source.html | 234 + .../doc/html/sym__compile_8h-source.html | 51 + .../doc/html/sym__operations_8cpp-source.html | 189 + .../doc/html/symreg_8cpp-source.html | 408 + .../html/t-_m_g_e-control_8cpp-source.html | 119 + .../doc/html/t-_m_g_e1bit_8cpp-source.html | 126 + .../doc/html/t-_m_g_e_8cpp-source.html | 123 + .../doc/html/t-eo_8cpp-source.html | 38 + .../doc/html/t-eo_atom_ops_8cpp-source.html | 81 + .../html/t-eo_base_functions_8cpp-source.html | 41 + .../doc/html/t-eo_c_m_a_e_s_8cpp-source.html | 143 + .../html/t-eo_checkpointing_8cpp-source.html | 198 + .../doc/html/t-eo_e_s_all_8cpp-source.html | 151 + .../doc/html/t-eo_e_s_full_8cpp-source.html | 194 + .../doc/html/t-eo_e_s_ops_8cpp-source.html | 130 + .../doc/html/t-eo_easy_e_a_8cpp-source.html | 99 + .../html/t-eo_external_e_o_8cpp-source.html | 147 + .../t-eo_fitness_assembled_8cpp-source.html | 120 + ...-eo_fitness_assembled_e_a_8cpp-source.html | 183 + .../doc/html/t-eo_functor_8cpp-source.html | 63 + .../doc/html/t-eo_g_a_8cpp-source.html | 79 + .../doc/html/t-eo_g_op_sel_8cpp-source.html | 146 + .../doc/html/t-eo_gen_op_8cpp-source.html | 438 + .../html/t-eo_non_uniform_8cpp-source.html | 46 + .../doc/html/t-eo_p_b_i_l_8cpp-source.html | 146 + .../doc/html/t-eo_pareto_8cpp-source.html | 259 + .../html/t-eo_pareto_fitness_8cpp-source.html | 207 + .../doc/html/t-eo_random_8cpp-source.html | 77 + .../doc/html/t-eo_real_8cpp-source.html | 79 + .../html/t-eo_replacement_8cpp-source.html | 238 + .../doc/html/t-eo_roulette_8cpp-source.html | 83 + .../doc/html/t-eo_s_s_g_a_8cpp-source.html | 132 + .../doc/html/t-eo_select_8cpp-source.html | 239 + .../doc/html/t-eo_sharing_8cpp-source.html | 255 + .../t-eo_state_and_parser_8cpp-source.html | 154 + .../doc/html/t-eo_symreg_8cpp-source.html | 306 + .../doc/html/t-eo_uniform_8cpp-source.html | 37 + .../doc/html/t-eo_vector_8cpp-source.html | 89 + .../doc/html/t-eo_virus_8cpp-source.html | 92 + .../doc/html/t-eobin_8cpp-source.html | 233 + .../doc/html/t-eobreeder_8cpp-source.html | 102 + .../doc/html/t-eofitness_8cpp-source.html | 105 + .../doc/html/t-eogeneration_8cpp-source.html | 160 + .../doc/html/t-eoinclusion_8cpp-source.html | 112 + .../doc/html/t-eoinsertion_8cpp-source.html | 123 + .../doc/html/t-eolottery_8cpp-source.html | 69 + .../doc/html/t-eoproblem_8cpp-source.html | 70 + .../doc/html/t-select_one_8cpp-source.html | 103 + .../html/test_2binary__value_8h-source.html | 26 + .../doc/html/test_2real__value_8h-source.html | 29 + .../doc/html/test__compile_8cpp-source.html | 200 + .../doc/html/test__diff_8cpp-source.html | 32 + .../doc/html/test__lambda_8cpp-source.html | 49 + .../doc/html/test__mf_8cpp-source.html | 60 + .../doc/html/test__simplify_8cpp-source.html | 36 + .../doc/html/testeo_8cpp-source.html | 134 + trunk/paradiseo-eo/doc/html/todo.html | 22 + .../doc/html/token_8h-source.html | 43 + trunk/paradiseo-eo/doc/html/tree.html | 2495 +++ ...al_2_lesson2_2binary__value_8h-source.html | 28 + ...rial_2_lesson2_2real__value_8h-source.html | 30 + ...al_2_lesson3_2binary__value_8h-source.html | 28 + ...rial_2_lesson3_2real__value_8h-source.html | 30 + ...al_2_lesson4_2binary__value_8h-source.html | 35 + ...rial_2_lesson4_2real__value_8h-source.html | 29 + .../html/tutorial_2_r_e_a_d_m_e-source.html | 28 + ...rial_2_templates_2_r_e_a_d_m_e-source.html | 164 + .../doc/html/util_8cpp-source.html | 42 + .../doc/html/value_param_8cpp-source.html | 209 + .../doc/html/value_param_8h-source.html | 58 + .../doc/html/vecop_8h-source.html | 229 + trunk/paradiseo-eo/doc/html/webpages.html | 15 + trunk/paradiseo-eo/doc/index.h | 67 + trunk/paradiseo-eo/doc/latex/Helvetica.ttf | Bin 0 -> 32760 bytes trunk/paradiseo-eo/doc/latex/Makefile | 39 + trunk/paradiseo-eo/doc/latex/annotated.tex | 349 + .../doc/latex/class_biased_node_selector.eps | 197 + .../doc/latex/class_biased_node_selector.tex | 41 + trunk/paradiseo-eo/doc/latex/class_cov.tex | 49 + trunk/paradiseo-eo/doc/latex/class_e_o.eps | 209 + trunk/paradiseo-eo/doc/latex/class_e_o.tex | 244 + .../paradiseo-eo/doc/latex/class_mem_pool.tex | 53 + .../doc/latex/class_minimizing_traits.eps | 197 + .../doc/latex/class_minimizing_traits.tex | 29 + .../doc/latex/class_node_selector.eps | 203 + .../doc/latex/class_node_selector.tex | 31 + .../doc/latex/class_random_node_selector.eps | 197 + .../doc/latex/class_random_node_selector.tex | 32 + .../latex/class_u_f__random__generator.tex | 36 + .../doc/latex/class_virus_bit_flip.eps | 221 + .../doc/latex/class_virus_bit_flip.tex | 54 + .../doc/latex/class_virus_shift_mutation.eps | 221 + .../doc/latex/class_virus_shift_mutation.tex | 57 + .../doc/latex/classboolean__generator.tex | 37 + .../paradiseo-eo/doc/latex/classd_matrix.tex | 40 + .../doc/latex/classeo1_pt_bit_crossover.tex | 17 + trunk/paradiseo-eo/doc/latex/classeo_aged.tex | 121 + trunk/paradiseo-eo/doc/latex/classeo_algo.eps | 225 + trunk/paradiseo-eo/doc/latex/classeo_algo.tex | 29 + .../latex/classeo_arithmetic_crossover.tex | 17 + ...classeo_assembled_fitness_average_stat.eps | 233 + ...classeo_assembled_fitness_average_stat.tex | 50 + .../classeo_assembled_fitness_best_stat.eps | 233 + .../classeo_assembled_fitness_best_stat.tex | 50 + .../doc/latex/classeo_atom_exchange.eps | 215 + .../doc/latex/classeo_atom_exchange.tex | 36 + .../doc/latex/classeo_average_stat.eps | 233 + .../doc/latex/classeo_average_stat.tex | 69 + trunk/paradiseo-eo/doc/latex/classeo_b_f.eps | 197 + trunk/paradiseo-eo/doc/latex/classeo_b_f.tex | 44 + .../doc/latex/classeo_best_fitness_stat.eps | 233 + .../doc/latex/classeo_best_fitness_stat.tex | 60 + .../doc/latex/classeo_best_select.eps | 215 + .../doc/latex/classeo_best_select.tex | 33 + .../doc/latex/classeo_bin_clone_op.eps | 221 + .../doc/latex/classeo_bin_clone_op.tex | 39 + .../doc/latex/classeo_bin_gen_op.eps | 221 + .../doc/latex/classeo_bin_gen_op.tex | 48 + .../paradiseo-eo/doc/latex/classeo_bin_op.eps | 215 + .../paradiseo-eo/doc/latex/classeo_bin_op.tex | 36 + .../latex/classeo_binary_functor_counter.eps | 203 + .../latex/classeo_binary_functor_counter.tex | 65 + trunk/paradiseo-eo/doc/latex/classeo_bit.eps | 233 + trunk/paradiseo-eo/doc/latex/classeo_bit.tex | 97 + .../doc/latex/classeo_bit_bit_flip.tex | 17 + .../doc/latex/classeo_bit_gx_over.eps | 221 + .../doc/latex/classeo_bit_gx_over.tex | 66 + .../doc/latex/classeo_bit_inversion.eps | 221 + .../doc/latex/classeo_bit_inversion.tex | 54 + .../doc/latex/classeo_bit_mutation.eps | 221 + .../doc/latex/classeo_bit_mutation.tex | 82 + .../doc/latex/classeo_bit_next.eps | 221 + .../doc/latex/classeo_bit_next.tex | 54 + .../doc/latex/classeo_bit_op_factory.eps | 203 + .../doc/latex/classeo_bit_op_factory.tex | 72 + .../doc/latex/classeo_bit_prev.eps | 221 + .../doc/latex/classeo_bit_prev.tex | 54 + .../doc/latex/classeo_bool_flip.eps | 221 + .../doc/latex/classeo_bool_flip.tex | 34 + .../doc/latex/classeo_boolean_generator.eps | 209 + .../doc/latex/classeo_boolean_generator.tex | 43 + .../doc/latex/classeo_boolean_init.eps | 215 + .../doc/latex/classeo_boolean_init.tex | 43 + .../doc/latex/classeo_branch_mutation.eps | 221 + .../doc/latex/classeo_branch_mutation.tex | 91 + .../paradiseo-eo/doc/latex/classeo_breed.eps | 229 + .../paradiseo-eo/doc/latex/classeo_breed.tex | 33 + .../doc/latex/classeo_c_m_a_breed.eps | 215 + .../doc/latex/classeo_c_m_a_breed.tex | 51 + .../doc/latex/classeo_c_m_a_init.eps | 215 + .../doc/latex/classeo_c_m_a_init.tex | 48 + .../doc/latex/classeo_cellular_easy_e_a.eps | 215 + .../doc/latex/classeo_cellular_easy_e_a.tex | 72 + .../doc/latex/classeo_check_point.eps | 227 + .../doc/latex/classeo_check_point.tex | 77 + .../classeo_collapse_subtree_mutation.eps | 221 + .../classeo_collapse_subtree_mutation.tex | 91 + .../doc/latex/classeo_combined_continue.eps | 227 + .../doc/latex/classeo_combined_continue.tex | 64 + .../doc/latex/classeo_combined_init.eps | 215 + .../doc/latex/classeo_combined_init.tex | 69 + .../doc/latex/classeo_comma_replacement.eps | 221 + .../doc/latex/classeo_comma_replacement.tex | 36 + .../doc/latex/classeo_continue.eps | 257 + .../doc/latex/classeo_continue.tex | 81 + .../doc/latex/classeo_counted_dyn_update.eps | 215 + .../doc/latex/classeo_counted_dyn_update.tex | 43 + .../doc/latex/classeo_counted_state_saver.eps | 209 + .../doc/latex/classeo_counted_state_saver.tex | 71 + .../doc/latex/classeo_ctrl_c_continue.eps | 227 + .../doc/latex/classeo_ctrl_c_continue.tex | 39 + .../doc/latex/classeo_det_bit_flip.eps | 221 + .../doc/latex/classeo_det_bit_flip.tex | 79 + .../doc/latex/classeo_det_select.eps | 215 + .../doc/latex/classeo_det_select.tex | 58 + .../latex/classeo_det_tournament_select.eps | 215 + .../latex/classeo_det_tournament_select.tex | 42 + .../latex/classeo_det_tournament_truncate.eps | 215 + .../latex/classeo_det_tournament_truncate.tex | 44 + .../classeo_det_tournament_truncate_split.eps | 215 + .../classeo_det_tournament_truncate_split.tex | 50 + .../classeo_det_tournament_worth_select.eps | 221 + .../classeo_det_tournament_worth_select.tex | 50 + .../latex/classeo_det_uniform_mutation.eps | 221 + .../latex/classeo_det_uniform_mutation.tex | 126 + ...classeo_deterministic_sa_d_replacement.eps | 215 + ...classeo_deterministic_sa_d_replacement.tex | 59 + .../classeo_deterministic_survive_and_die.eps | 215 + .../classeo_deterministic_survive_and_die.tex | 40 + .../doc/latex/classeo_distance.eps | 225 + .../doc/latex/classeo_distance.tex | 27 + .../doc/latex/classeo_distrib_updater.eps | 221 + .../doc/latex/classeo_distrib_updater.tex | 35 + .../doc/latex/classeo_distribution.eps | 237 + .../doc/latex/classeo_distribution.tex | 37 + .../doc/latex/classeo_dominance_map.eps | 209 + .../doc/latex/classeo_dominance_map.tex | 87 + .../doc/latex/classeo_double_exchange.eps | 221 + .../doc/latex/classeo_double_exchange.tex | 37 + .../doc/latex/classeo_double_intermediate.eps | 221 + .../doc/latex/classeo_double_intermediate.tex | 37 + .../doc/latex/classeo_drawable.tex | 54 + .../doc/latex/classeo_dyn_s_g_a_transform.eps | 215 + .../doc/latex/classeo_dyn_s_g_a_transform.tex | 88 + .../doc/latex/classeo_dyn_updater.eps | 221 + .../doc/latex/classeo_dyn_updater.tex | 40 + .../paradiseo-eo/doc/latex/classeo_e_d_a.eps | 215 + .../paradiseo-eo/doc/latex/classeo_e_d_a.tex | 31 + .../doc/latex/classeo_e_p_reduce.eps | 215 + .../doc/latex/classeo_e_p_reduce.tex | 51 + .../doc/latex/classeo_e_p_replacement.eps | 221 + .../doc/latex/classeo_e_p_replacement.tex | 42 + .../doc/latex/classeo_easy_e_a.eps | 215 + .../doc/latex/classeo_easy_e_a.tex | 103 + .../latex/classeo_elite_sequential_select.eps | 215 + .../latex/classeo_elite_sequential_select.tex | 52 + .../doc/latex/classeo_elitism.eps | 221 + .../doc/latex/classeo_elitism.tex | 47 + .../doc/latex/classeo_es_chrom_init.eps | 221 + .../doc/latex/classeo_es_chrom_init.tex | 169 + .../doc/latex/classeo_es_full.eps | 227 + .../doc/latex/classeo_es_full.tex | 71 + .../doc/latex/classeo_es_global_xover.eps | 221 + .../doc/latex/classeo_es_global_xover.tex | 126 + .../doc/latex/classeo_es_mutate.eps | 221 + .../doc/latex/classeo_es_mutate.tex | 224 + .../doc/latex/classeo_es_mutation_init.tex | 103 + .../doc/latex/classeo_es_simple.eps | 227 + .../doc/latex/classeo_es_simple.tex | 72 + .../doc/latex/classeo_es_standard_xover.eps | 221 + .../doc/latex/classeo_es_standard_xover.tex | 71 + .../doc/latex/classeo_es_stdev.eps | 227 + .../doc/latex/classeo_es_stdev.tex | 68 + .../doc/latex/classeo_eval_continue.eps | 227 + .../doc/latex/classeo_eval_continue.tex | 51 + .../doc/latex/classeo_eval_func.eps | 241 + .../doc/latex/classeo_eval_func.tex | 40 + .../doc/latex/classeo_eval_func_counter.eps | 227 + .../doc/latex/classeo_eval_func_counter.tex | 44 + .../doc/latex/classeo_expansion_mutation.eps | 221 + .../doc/latex/classeo_expansion_mutation.tex | 91 + .../doc/latex/classeo_external_bin_op.eps | 221 + .../doc/latex/classeo_external_bin_op.tex | 46 + .../doc/latex/classeo_external_e_o.eps | 215 + .../doc/latex/classeo_external_e_o.tex | 64 + .../doc/latex/classeo_external_eval_func.eps | 215 + .../doc/latex/classeo_external_eval_func.tex | 46 + .../doc/latex/classeo_external_init.eps | 215 + .../doc/latex/classeo_external_init.tex | 46 + .../doc/latex/classeo_external_mon_op.eps | 221 + .../doc/latex/classeo_external_mon_op.tex | 46 + .../doc/latex/classeo_external_quad_op.eps | 221 + .../doc/latex/classeo_external_quad_op.tex | 46 + trunk/paradiseo-eo/doc/latex/classeo_f.eps | 197 + trunk/paradiseo-eo/doc/latex/classeo_f.tex | 50 + .../doc/latex/classeo_f_d_c_file_snapshot.eps | 215 + .../doc/latex/classeo_f_d_c_file_snapshot.tex | 55 + .../doc/latex/classeo_f_d_c_stat.eps | 233 + .../doc/latex/classeo_f_d_c_stat.tex | 63 + .../doc/latex/classeo_factory.eps | 197 + .../doc/latex/classeo_factory.tex | 65 + .../doc/latex/classeo_file_monitor.eps | 215 + .../doc/latex/classeo_file_monitor.tex | 71 + .../doc/latex/classeo_file_snapshot.eps | 221 + .../doc/latex/classeo_file_snapshot.tex | 99 + .../doc/latex/classeo_fit_continue.eps | 227 + .../doc/latex/classeo_fit_continue.tex | 68 + .../latex/classeo_fitness_scaling_select.eps | 227 + .../latex/classeo_fitness_scaling_select.tex | 55 + .../doc/latex/classeo_fitness_stat.eps | 233 + .../doc/latex/classeo_fitness_stat.tex | 36 + .../doc/latex/classeo_fl_or1pt_bin_op.eps | 221 + .../doc/latex/classeo_fl_or1pt_bin_op.tex | 45 + .../doc/latex/classeo_fl_or1pt_quad_op.eps | 221 + .../doc/latex/classeo_fl_or1pt_quad_op.tex | 45 + .../latex/classeo_fl_or_all_atom_bin_op.eps | 221 + .../latex/classeo_fl_or_all_atom_bin_op.tex | 54 + .../latex/classeo_fl_or_all_atom_quad_op.eps | 221 + .../latex/classeo_fl_or_all_atom_quad_op.tex | 54 + .../doc/latex/classeo_fl_or_all_mutation.eps | 221 + .../doc/latex/classeo_fl_or_all_mutation.tex | 54 + .../doc/latex/classeo_fl_or_k_atom_bin_op.eps | 221 + .../doc/latex/classeo_fl_or_k_atom_bin_op.tex | 54 + .../latex/classeo_fl_or_k_atom_quad_op.eps | 221 + .../latex/classeo_fl_or_k_atom_quad_op.tex | 54 + .../doc/latex/classeo_fl_or_k_mutation.eps | 221 + .../doc/latex/classeo_fl_or_k_mutation.tex | 54 + .../latex/classeo_fl_or_uniform_bin_op.eps | 221 + .../latex/classeo_fl_or_uniform_bin_op.tex | 51 + .../latex/classeo_fl_or_uniform_quad_op.eps | 221 + .../latex/classeo_fl_or_uniform_quad_op.tex | 51 + .../doc/latex/classeo_functor_base.eps | 558 + .../doc/latex/classeo_functor_base.tex | 39 + .../doc/latex/classeo_functor_store.eps | 197 + .../doc/latex/classeo_functor_store.tex | 55 + .../doc/latex/classeo_g3_replacement.eps | 215 + .../doc/latex/classeo_g3_replacement.tex | 48 + .../doc/latex/classeo_gen_continue.eps | 239 + .../doc/latex/classeo_gen_continue.tex | 110 + .../paradiseo-eo/doc/latex/classeo_gen_op.eps | 264 + .../paradiseo-eo/doc/latex/classeo_gen_op.tex | 52 + .../doc/latex/classeo_gene_del_chooser.eps | 215 + .../doc/latex/classeo_gene_del_chooser.tex | 33 + .../doc/latex/classeo_general_breeder.eps | 215 + .../doc/latex/classeo_general_breeder.tex | 101 + .../doc/latex/classeo_general_int_bounds.eps | 209 + .../doc/latex/classeo_general_int_bounds.tex | 103 + .../doc/latex/classeo_general_real_bounds.eps | 209 + .../doc/latex/classeo_general_real_bounds.tex | 100 + .../classeo_generational_replacement.eps | 215 + .../classeo_generational_replacement.tex | 33 + .../doc/latex/classeo_gnuplot.eps | 203 + .../doc/latex/classeo_gnuplot.tex | 129 + .../doc/latex/classeo_gnuplot1_d_monitor.eps | 221 + .../doc/latex/classeo_gnuplot1_d_monitor.tex | 54 + .../doc/latex/classeo_gnuplot1_d_snapshot.eps | 221 + .../doc/latex/classeo_gnuplot1_d_snapshot.tex | 67 + .../doc/latex/classeo_hamming_distance.eps | 215 + .../doc/latex/classeo_hamming_distance.tex | 33 + .../doc/latex/classeo_hoist_mutation.eps | 221 + .../doc/latex/classeo_hoist_mutation.tex | 82 + .../doc/latex/classeo_how_many.eps | 203 + .../doc/latex/classeo_how_many.tex | 146 + .../doc/latex/classeo_incrementor.eps | 209 + .../doc/latex/classeo_incrementor.tex | 48 + .../doc/latex/classeo_incrementor_param.eps | 221 + .../doc/latex/classeo_incrementor_param.tex | 48 + trunk/paradiseo-eo/doc/latex/classeo_init.eps | 245 + trunk/paradiseo-eo/doc/latex/classeo_init.tex | 52 + .../doc/latex/classeo_init_adaptor.eps | 221 + .../doc/latex/classeo_init_adaptor.tex | 46 + .../doc/latex/classeo_init_fixed_length.eps | 215 + .../doc/latex/classeo_init_fixed_length.tex | 51 + .../doc/latex/classeo_init_generator.eps | 203 + .../doc/latex/classeo_init_generator.tex | 42 + .../latex/classeo_init_variable_length.eps | 215 + .../latex/classeo_init_variable_length.tex | 57 + .../doc/latex/classeo_init_virus.eps | 215 + .../doc/latex/classeo_init_virus.tex | 45 + .../doc/latex/classeo_init_virus1bit.eps | 215 + .../doc/latex/classeo_init_virus1bit.tex | 45 + .../latex/classeo_inner_exchange_quad_op.eps | 221 + .../latex/classeo_inner_exchange_quad_op.tex | 56 + .../doc/latex/classeo_int_above_bound.eps | 209 + .../doc/latex/classeo_int_above_bound.tex | 115 + .../doc/latex/classeo_int_below_bound.eps | 209 + .../doc/latex/classeo_int_below_bound.tex | 115 + .../doc/latex/classeo_int_bounds.eps | 227 + .../doc/latex/classeo_int_bounds.tex | 89 + .../doc/latex/classeo_int_interval.eps | 209 + .../doc/latex/classeo_int_interval.tex | 121 + .../doc/latex/classeo_int_no_bounds.eps | 209 + .../doc/latex/classeo_int_no_bounds.tex | 106 + .../doc/latex/classeo_invalidate_bin_op.eps | 221 + .../doc/latex/classeo_invalidate_bin_op.tex | 48 + .../doc/latex/classeo_invalidate_mon_op.eps | 221 + .../doc/latex/classeo_invalidate_mon_op.tex | 48 + .../doc/latex/classeo_invalidate_quad_op.eps | 221 + .../doc/latex/classeo_invalidate_quad_op.tex | 48 + .../doc/latex/classeo_linear_fit_scaling.eps | 227 + .../doc/latex/classeo_linear_fit_scaling.tex | 44 + .../doc/latex/classeo_linear_random_split.eps | 215 + .../doc/latex/classeo_linear_random_split.tex | 45 + .../doc/latex/classeo_linear_truncate.eps | 215 + .../doc/latex/classeo_linear_truncate.tex | 35 + .../latex/classeo_linear_truncate_split.eps | 215 + .../latex/classeo_linear_truncate_split.tex | 47 + .../doc/latex/classeo_m_g_g_replacement.eps | 215 + .../doc/latex/classeo_m_g_g_replacement.tex | 48 + .../doc/latex/classeo_m_o_fitness_stat.eps | 233 + .../doc/latex/classeo_m_o_fitness_stat.tex | 42 + .../paradiseo-eo/doc/latex/classeo_merge.eps | 209 + .../paradiseo-eo/doc/latex/classeo_merge.tex | 31 + .../doc/latex/classeo_merge_reduce.eps | 231 + .../doc/latex/classeo_merge_reduce.tex | 45 + .../doc/latex/classeo_mon_clone_op.eps | 221 + .../doc/latex/classeo_mon_clone_op.tex | 39 + .../doc/latex/classeo_mon_gen_op.eps | 221 + .../doc/latex/classeo_mon_gen_op.tex | 48 + .../paradiseo-eo/doc/latex/classeo_mon_op.eps | 215 + .../paradiseo-eo/doc/latex/classeo_mon_op.tex | 38 + .../doc/latex/classeo_monitor.eps | 245 + .../doc/latex/classeo_monitor.tex | 66 + .../latex/classeo_n_d_plus_replacement.eps | 239 + .../latex/classeo_n_d_plus_replacement.tex | 52 + .../doc/latex/classeo_n_d_sorting.eps | 245 + .../doc/latex/classeo_n_d_sorting.tex | 91 + .../classeo_n_d_sorting_1_1_dummy_e_o.eps | 215 + .../classeo_n_d_sorting_1_1_dummy_e_o.tex | 31 + .../doc/latex/classeo_n_d_sorting___i.eps | 239 + .../doc/latex/classeo_n_d_sorting___i.tex | 55 + .../doc/latex/classeo_n_d_sorting___i_i.eps | 239 + .../doc/latex/classeo_n_d_sorting___i_i.tex | 48 + .../doc/latex/classeo_n_pts_bit_xover.eps | 221 + .../doc/latex/classeo_n_pts_bit_xover.tex | 63 + .../doc/latex/classeo_neg_exp_generator.eps | 209 + .../doc/latex/classeo_neg_exp_generator.tex | 47 + .../doc/latex/classeo_neg_exp_init.eps | 215 + .../doc/latex/classeo_neg_exp_init.tex | 47 + .../doc/latex/classeo_no_elitism.eps | 221 + .../doc/latex/classeo_no_elitism.tex | 27 + .../doc/latex/classeo_no_perf2_worth.eps | 227 + .../doc/latex/classeo_no_perf2_worth.tex | 33 + .../doc/latex/classeo_no_select.eps | 215 + .../doc/latex/classeo_no_select.tex | 42 + .../doc/latex/classeo_normal_generator.eps | 209 + .../doc/latex/classeo_normal_generator.tex | 47 + .../doc/latex/classeo_normal_init.eps | 215 + .../doc/latex/classeo_normal_init.tex | 47 + .../doc/latex/classeo_normal_mutation.eps | 227 + .../doc/latex/classeo_normal_mutation.tex | 116 + .../doc/latex/classeo_normal_vec_mutation.eps | 221 + .../doc/latex/classeo_normal_vec_mutation.tex | 111 + .../classeo_nth_element_fitness_stat.eps | 233 + .../classeo_nth_element_fitness_stat.tex | 60 + .../paradiseo-eo/doc/latex/classeo_object.eps | 294 + .../paradiseo-eo/doc/latex/classeo_object.tex | 57 + .../doc/latex/classeo_one_fifth_mutation.eps | 233 + .../doc/latex/classeo_one_fifth_mutation.tex | 105 + .../doc/latex/classeo_one_max.eps | 215 + .../doc/latex/classeo_one_max.tex | 108 + .../doc/latex/classeo_one_max_eval_func.eps | 215 + .../doc/latex/classeo_one_max_eval_func.tex | 56 + .../doc/latex/classeo_one_max_init.eps | 215 + .../doc/latex/classeo_one_max_init.tex | 64 + .../doc/latex/classeo_one_max_mutation.eps | 221 + .../doc/latex/classeo_one_max_mutation.tex | 61 + .../latex/classeo_one_max_quad_crossover.eps | 221 + .../latex/classeo_one_max_quad_crossover.tex | 61 + trunk/paradiseo-eo/doc/latex/classeo_op.eps | 207 + trunk/paradiseo-eo/doc/latex/classeo_op.tex | 53 + .../doc/latex/classeo_op_container.eps | 233 + .../doc/latex/classeo_op_container.tex | 76 + .../doc/latex/classeo_op_sel_mason.eps | 203 + .../doc/latex/classeo_op_sel_mason.tex | 83 + .../doc/latex/classeo_p_b_i_l_additive.eps | 215 + .../doc/latex/classeo_p_b_i_l_additive.tex | 66 + .../doc/latex/classeo_p_b_i_l_distrib.eps | 249 + .../doc/latex/classeo_p_b_i_l_distrib.tex | 76 + .../doc/latex/classeo_p_b_i_l_org.eps | 215 + .../doc/latex/classeo_p_b_i_l_org.tex | 52 + .../paradiseo-eo/doc/latex/classeo_param.eps | 273 + .../paradiseo-eo/doc/latex/classeo_param.tex | 98 + .../doc/latex/classeo_param_param_type.tex | 36 + .../doc/latex/classeo_parameter_loader.eps | 197 + .../doc/latex/classeo_parameter_loader.tex | 82 + .../doc/latex/classeo_pareto_fitness.tex | 67 + .../latex/classeo_pareto_fitness_traits.eps | 211 + .../latex/classeo_pareto_fitness_traits.tex | 39 + .../classeo_pareto_one_constraint_fitness.tex | 94 + .../doc/latex/classeo_pareto_ranking.eps | 233 + .../doc/latex/classeo_pareto_ranking.tex | 44 + .../doc/latex/classeo_parse_tree.eps | 215 + .../doc/latex/classeo_parse_tree.tex | 148 + .../latex/classeo_parse_tree_depth_init.eps | 215 + .../latex/classeo_parse_tree_depth_init.tex | 101 + .../paradiseo-eo/doc/latex/classeo_parser.eps | 213 + .../paradiseo-eo/doc/latex/classeo_parser.tex | 238 + .../doc/latex/classeo_perf2_worth.eps | 227 + .../doc/latex/classeo_perf2_worth.tex | 47 + .../classeo_perf2_worth_1_1compare__worth.tex | 36 + .../doc/latex/classeo_perf2_worth_cached.eps | 227 + .../doc/latex/classeo_perf2_worth_cached.tex | 64 + ...o_perf2_worth_cached_1_1compare__worth.tex | 36 + .../doc/latex/classeo_persistent.eps | 305 + .../doc/latex/classeo_persistent.tex | 57 + trunk/paradiseo-eo/doc/latex/classeo_plus.eps | 215 + trunk/paradiseo-eo/doc/latex/classeo_plus.tex | 33 + .../doc/latex/classeo_plus_replacement.eps | 221 + .../doc/latex/classeo_plus_replacement.tex | 36 + .../doc/latex/classeo_point_mutation.eps | 221 + .../doc/latex/classeo_point_mutation.tex | 88 + trunk/paradiseo-eo/doc/latex/classeo_pop.eps | 209 + trunk/paradiseo-eo/doc/latex/classeo_pop.tex | 284 + .../doc/latex/classeo_pop_algo.eps | 209 + .../doc/latex/classeo_pop_algo.tex | 27 + .../doc/latex/classeo_pop_eval_func.eps | 221 + .../doc/latex/classeo_pop_eval_func.tex | 37 + .../doc/latex/classeo_pop_loop_eval.eps | 215 + .../doc/latex/classeo_pop_loop_eval.tex | 42 + .../doc/latex/classeo_pop_stat.eps | 233 + .../doc/latex/classeo_pop_stat.tex | 73 + .../doc/latex/classeo_populator.eps | 203 + .../doc/latex/classeo_populator.tex | 121 + .../doc/latex/classeo_printable.eps | 305 + .../doc/latex/classeo_printable.tex | 54 + .../doc/latex/classeo_procedure_counter.eps | 203 + .../doc/latex/classeo_procedure_counter.tex | 65 + .../latex/classeo_prop_combined_bin_op.eps | 221 + .../latex/classeo_prop_combined_bin_op.tex | 51 + .../latex/classeo_prop_combined_mon_op.eps | 221 + .../latex/classeo_prop_combined_mon_op.tex | 56 + .../latex/classeo_prop_combined_quad_op.eps | 221 + .../latex/classeo_prop_combined_quad_op.tex | 56 + .../doc/latex/classeo_prop_g_a_gen_op.eps | 221 + .../doc/latex/classeo_prop_g_a_gen_op.tex | 66 + .../doc/latex/classeo_proportional_op.eps | 227 + .../doc/latex/classeo_proportional_op.tex | 36 + .../doc/latex/classeo_proportional_select.eps | 215 + .../doc/latex/classeo_proportional_select.tex | 53 + .../doc/latex/classeo_quad2_bin_op.eps | 221 + .../doc/latex/classeo_quad2_bin_op.tex | 58 + .../doc/latex/classeo_quad_clone_op.eps | 221 + .../doc/latex/classeo_quad_clone_op.tex | 39 + .../doc/latex/classeo_quad_distance.eps | 215 + .../doc/latex/classeo_quad_distance.tex | 33 + .../doc/latex/classeo_quad_gen_op.eps | 221 + .../doc/latex/classeo_quad_gen_op.tex | 48 + .../doc/latex/classeo_quad_op.eps | 215 + .../doc/latex/classeo_quad_op.tex | 38 + .../doc/latex/classeo_random_reduce.eps | 215 + .../doc/latex/classeo_random_reduce.tex | 33 + .../doc/latex/classeo_random_select.eps | 215 + .../doc/latex/classeo_random_select.tex | 33 + .../doc/latex/classeo_random_split.eps | 215 + .../doc/latex/classeo_random_split.tex | 45 + .../doc/latex/classeo_ranking.eps | 227 + .../doc/latex/classeo_ranking.tex | 50 + .../doc/latex/classeo_ranking_select.eps | 227 + .../doc/latex/classeo_ranking_select.tex | 57 + trunk/paradiseo-eo/doc/latex/classeo_real.eps | 227 + trunk/paradiseo-eo/doc/latex/classeo_real.tex | 54 + .../doc/latex/classeo_real_above_bound.eps | 209 + .../doc/latex/classeo_real_above_bound.tex | 112 + .../latex/classeo_real_base_vector_bounds.eps | 203 + .../latex/classeo_real_base_vector_bounds.tex | 118 + .../doc/latex/classeo_real_below_bound.eps | 209 + .../doc/latex/classeo_real_below_bound.tex | 112 + .../doc/latex/classeo_real_bounds.eps | 227 + .../doc/latex/classeo_real_bounds.tex | 80 + .../doc/latex/classeo_real_init_bounded.eps | 221 + .../doc/latex/classeo_real_init_bounded.tex | 48 + .../doc/latex/classeo_real_interval.eps | 209 + .../doc/latex/classeo_real_interval.tex | 118 + .../doc/latex/classeo_real_no_bounds.eps | 209 + .../doc/latex/classeo_real_no_bounds.tex | 103 + .../doc/latex/classeo_real_ux_over.tex | 17 + .../doc/latex/classeo_real_vector_bounds.eps | 215 + .../doc/latex/classeo_real_vector_bounds.tex | 115 + .../latex/classeo_real_vector_no_bounds.eps | 215 + .../latex/classeo_real_vector_no_bounds.tex | 87 + .../paradiseo-eo/doc/latex/classeo_reduce.eps | 241 + .../paradiseo-eo/doc/latex/classeo_reduce.tex | 29 + .../doc/latex/classeo_reduce_merge.eps | 231 + .../doc/latex/classeo_reduce_merge.tex | 49 + .../doc/latex/classeo_reduce_merge_reduce.eps | 215 + .../doc/latex/classeo_reduce_merge_reduce.tex | 60 + .../doc/latex/classeo_reduce_split.eps | 233 + .../doc/latex/classeo_reduce_split.tex | 27 + .../doc/latex/classeo_replacement.eps | 255 + .../doc/latex/classeo_replacement.tex | 34 + .../doc/latex/classeo_rnd_generator.eps | 219 + .../doc/latex/classeo_rnd_generator.tex | 37 + trunk/paradiseo-eo/doc/latex/classeo_rng.eps | 209 + trunk/paradiseo-eo/doc/latex/classeo_rng.tex | 304 + .../latex/classeo_roulette_worth_select.eps | 221 + .../latex/classeo_roulette_worth_select.tex | 53 + .../paradiseo-eo/doc/latex/classeo_s_g_a.eps | 215 + .../paradiseo-eo/doc/latex/classeo_s_g_a.tex | 62 + .../doc/latex/classeo_s_g_a_gen_op.eps | 221 + .../doc/latex/classeo_s_g_a_gen_op.tex | 68 + .../doc/latex/classeo_s_g_a_transform.eps | 215 + .../doc/latex/classeo_s_g_a_transform.tex | 73 + ...seo_s_s_g_a_det_tournament_replacement.eps | 221 + ...seo_s_s_g_a_det_tournament_replacement.tex | 44 + ...o_s_s_g_a_stoch_tournament_replacement.eps | 221 + ...o_s_s_g_a_stoch_tournament_replacement.tex | 44 + .../classeo_s_s_g_a_worse_replacement.eps | 221 + .../classeo_s_s_g_a_worse_replacement.tex | 38 + .../doc/latex/classeo_s_t_l_b_f.tex | 40 + .../doc/latex/classeo_s_t_l_f.tex | 46 + .../doc/latex/classeo_s_t_l_u_f.tex | 40 + .../doc/latex/classeo_scalar_fitness.tex | 61 + .../classeo_scalar_fitness_assembled.tex | 111 + ...lasseo_scalar_fitness_assembled_traits.tex | 54 + .../doc/latex/classeo_scalar_fitness_stat.eps | 233 + .../doc/latex/classeo_scalar_fitness_stat.tex | 42 + .../doc/latex/classeo_second_moment_stats.eps | 233 + .../doc/latex/classeo_second_moment_stats.tex | 56 + .../doc/latex/classeo_segment_crossover.eps | 221 + .../doc/latex/classeo_segment_crossover.tex | 105 + .../doc/latex/classeo_sel_bin_gen_op.eps | 221 + .../doc/latex/classeo_sel_bin_gen_op.tex | 51 + .../paradiseo-eo/doc/latex/classeo_select.eps | 241 + .../paradiseo-eo/doc/latex/classeo_select.tex | 29 + .../doc/latex/classeo_select_factory.eps | 203 + .../doc/latex/classeo_select_factory.tex | 70 + .../doc/latex/classeo_select_from_worth.eps | 215 + .../doc/latex/classeo_select_from_worth.tex | 59 + .../doc/latex/classeo_select_many.eps | 215 + .../doc/latex/classeo_select_many.tex | 72 + .../doc/latex/classeo_select_number.eps | 215 + .../doc/latex/classeo_select_number.tex | 69 + .../doc/latex/classeo_select_one.eps | 209 + .../doc/latex/classeo_select_one.tex | 39 + .../doc/latex/classeo_select_perc.eps | 215 + .../doc/latex/classeo_select_perc.tex | 69 + .../doc/latex/classeo_select_transform.eps | 215 + .../doc/latex/classeo_select_transform.tex | 47 + .../doc/latex/classeo_selective_populator.eps | 197 + .../doc/latex/classeo_selective_populator.tex | 44 + .../doc/latex/classeo_seq_populator.eps | 197 + .../doc/latex/classeo_seq_populator.tex | 42 + .../doc/latex/classeo_sequential_op.eps | 227 + .../doc/latex/classeo_sequential_op.tex | 51 + .../doc/latex/classeo_sequential_select.eps | 215 + .../doc/latex/classeo_sequential_select.tex | 55 + .../doc/latex/classeo_sharing.eps | 227 + .../doc/latex/classeo_sharing.tex | 45 + .../doc/latex/classeo_sharing_select.eps | 227 + .../doc/latex/classeo_sharing_select.tex | 57 + .../doc/latex/classeo_simple_e_d_a.eps | 215 + .../doc/latex/classeo_simple_e_d_a.tex | 64 + .../doc/latex/classeo_sorted_pop_stat.eps | 233 + .../doc/latex/classeo_sorted_pop_stat.tex | 73 + .../doc/latex/classeo_sorted_stat.eps | 227 + .../doc/latex/classeo_sorted_stat.tex | 36 + .../doc/latex/classeo_sorted_stat_base.eps | 267 + .../doc/latex/classeo_sorted_stat_base.tex | 36 + .../doc/latex/classeo_st_branch_mutation.eps | 221 + .../doc/latex/classeo_st_branch_mutation.tex | 91 + .../doc/latex/classeo_st_hoist_mutation.eps | 221 + .../doc/latex/classeo_st_hoist_mutation.tex | 91 + .../classeo_st_parse_tree_depth_init.eps | 215 + .../classeo_st_parse_tree_depth_init.tex | 98 + .../doc/latex/classeo_st_point_mutation.eps | 221 + .../doc/latex/classeo_st_point_mutation.tex | 88 + .../doc/latex/classeo_st_subtree_x_over.eps | 221 + .../doc/latex/classeo_st_subtree_x_over.tex | 70 + trunk/paradiseo-eo/doc/latex/classeo_stat.eps | 227 + trunk/paradiseo-eo/doc/latex/classeo_stat.tex | 36 + .../doc/latex/classeo_stat_base.eps | 277 + .../doc/latex/classeo_stat_base.tex | 38 + .../paradiseo-eo/doc/latex/classeo_state.eps | 197 + .../paradiseo-eo/doc/latex/classeo_state.tex | 153 + .../doc/latex/classeo_stdout_monitor.eps | 209 + .../doc/latex/classeo_stdout_monitor.tex | 50 + .../doc/latex/classeo_steady_fit_continue.eps | 227 + .../doc/latex/classeo_steady_fit_continue.tex | 97 + .../latex/classeo_stoch_tournament_select.eps | 215 + .../latex/classeo_stoch_tournament_select.tex | 42 + .../classeo_stoch_tournament_truncate.eps | 215 + .../classeo_stoch_tournament_truncate.tex | 44 + ...lasseo_stoch_tournament_truncate_split.eps | 215 + ...lasseo_stoch_tournament_truncate_split.tex | 50 + .../classeo_stoch_tournament_worth_select.eps | 221 + .../classeo_stoch_tournament_worth_select.tex | 50 + .../classeo_stochastic_universal_select.eps | 215 + .../classeo_stochastic_universal_select.tex | 51 + .../paradiseo-eo/doc/latex/classeo_string.eps | 215 + .../paradiseo-eo/doc/latex/classeo_string.tex | 72 + .../doc/latex/classeo_subtree_x_over.eps | 221 + .../doc/latex/classeo_subtree_x_over.tex | 70 + .../doc/latex/classeo_survive_and_die.eps | 215 + .../doc/latex/classeo_survive_and_die.tex | 42 + .../doc/latex/classeo_sym_init.eps | 215 + .../doc/latex/classeo_sym_init.tex | 57 + .../doc/latex/classeo_time_counter.eps | 221 + .../doc/latex/classeo_time_counter.tex | 37 + .../latex/classeo_time_varying_loop_eval.eps | 215 + .../latex/classeo_time_varying_loop_eval.tex | 42 + .../doc/latex/classeo_timed_dyn_update.eps | 215 + .../doc/latex/classeo_timed_dyn_update.tex | 46 + .../doc/latex/classeo_timed_monitor.eps | 209 + .../doc/latex/classeo_timed_monitor.tex | 52 + .../doc/latex/classeo_timed_state_saver.eps | 209 + .../doc/latex/classeo_timed_state_saver.tex | 59 + .../doc/latex/classeo_transform.eps | 225 + .../doc/latex/classeo_transform.tex | 27 + .../doc/latex/classeo_trunc_select.eps | 215 + .../doc/latex/classeo_trunc_select.tex | 67 + .../doc/latex/classeo_truncate.eps | 215 + .../doc/latex/classeo_truncate.tex | 33 + .../doc/latex/classeo_truncate_split.eps | 215 + .../doc/latex/classeo_truncate_split.tex | 45 + .../latex/classeo_truncated_select_many.eps | 215 + .../latex/classeo_truncated_select_many.tex | 81 + .../latex/classeo_truncated_select_one.eps | 215 + .../latex/classeo_truncated_select_one.tex | 79 + .../doc/latex/classeo_u_bit_xover.eps | 221 + .../doc/latex/classeo_u_bit_xover.tex | 63 + trunk/paradiseo-eo/doc/latex/classeo_u_f.eps | 203 + trunk/paradiseo-eo/doc/latex/classeo_u_f.tex | 44 + .../latex/classeo_unary_functor_counter.eps | 203 + .../latex/classeo_unary_functor_counter.tex | 71 + .../latex/classeo_uniform_atom_exchange.eps | 215 + .../latex/classeo_uniform_atom_exchange.tex | 51 + .../latex/classeo_uniform_gene_chooser.eps | 215 + .../latex/classeo_uniform_gene_chooser.tex | 36 + .../doc/latex/classeo_uniform_generator.eps | 209 + .../doc/latex/classeo_uniform_generator.tex | 60 + .../doc/latex/classeo_uniform_init.eps | 215 + .../doc/latex/classeo_uniform_init.tex | 63 + .../doc/latex/classeo_uniform_mutation.eps | 221 + .../doc/latex/classeo_uniform_mutation.tex | 124 + .../doc/latex/classeo_updatable.eps | 197 + .../doc/latex/classeo_updatable.tex | 34 + .../doc/latex/classeo_updater.eps | 243 + .../doc/latex/classeo_updater.tex | 36 + .../doc/latex/classeo_value_param.eps | 209 + .../doc/latex/classeo_value_param.tex | 101 + .../latex/classeo_variable_pareto_traits.eps | 197 + .../latex/classeo_variable_pareto_traits.tex | 47 + .../paradiseo-eo/doc/latex/classeo_vector.eps | 215 + .../paradiseo-eo/doc/latex/classeo_vector.tex | 75 + .../doc/latex/classeo_vl_add_mutation.eps | 221 + .../doc/latex/classeo_vl_add_mutation.tex | 70 + .../classeo_vl_atom_exchange_quad_op.eps | 221 + .../classeo_vl_atom_exchange_quad_op.tex | 57 + .../doc/latex/classeo_vl_del_mutation.eps | 221 + .../doc/latex/classeo_vl_del_mutation.tex | 107 + .../doc/latex/classeo_vl_uniform_bin_op.eps | 221 + .../doc/latex/classeo_vl_uniform_bin_op.tex | 56 + .../doc/latex/classeo_vl_uniform_quad_op.eps | 221 + .../doc/latex/classeo_vl_uniform_quad_op.tex | 56 + .../classeo_weak_elitist_replacement.eps | 215 + .../classeo_weak_elitist_replacement.tex | 50 + .../classgp__parse__tree_1_1_mem_pool.tex | 53 + .../doc/latex/classnegexp__generator.tex | 41 + .../doc/latex/classnormal__generator.tex | 41 + .../doc/latex/classrandom__generator.tex | 48 + .../doc/latex/classuniform__generator.tex | 45 + trunk/paradiseo-eo/doc/latex/dir_000000.tex | 230 + trunk/paradiseo-eo/doc/latex/dir_000001.tex | 49 + trunk/paradiseo-eo/doc/latex/dir_000002.tex | 101 + trunk/paradiseo-eo/doc/latex/dir_000003.tex | 22 + trunk/paradiseo-eo/doc/latex/dir_000004.tex | 15 + trunk/paradiseo-eo/doc/latex/dir_000005.tex | 15 + trunk/paradiseo-eo/doc/latex/dir_000006.tex | 15 + trunk/paradiseo-eo/doc/latex/dir_000007.tex | 16 + trunk/paradiseo-eo/doc/latex/dir_000008.tex | 28 + trunk/paradiseo-eo/doc/latex/dir_000009.tex | 21 + trunk/paradiseo-eo/doc/latex/dir_000010.tex | 91 + trunk/paradiseo-eo/doc/latex/dir_000011.tex | 101 + trunk/paradiseo-eo/doc/latex/dir_000012.tex | 23 + trunk/paradiseo-eo/doc/latex/dir_000013.tex | 43 + trunk/paradiseo-eo/doc/latex/dir_000014.tex | 11 + trunk/paradiseo-eo/doc/latex/dir_000015.tex | 11 + trunk/paradiseo-eo/doc/latex/dir_000016.tex | 25 + trunk/paradiseo-eo/doc/latex/dir_000017.tex | 19 + trunk/paradiseo-eo/doc/latex/dir_000018.tex | 23 + trunk/paradiseo-eo/doc/latex/dir_000019.tex | 11 + trunk/paradiseo-eo/doc/latex/dir_000020.tex | 11 + trunk/paradiseo-eo/doc/latex/dir_000021.tex | 13 + trunk/paradiseo-eo/doc/latex/dir_000022.tex | 17 + trunk/paradiseo-eo/doc/latex/dir_000023.tex | 19 + trunk/paradiseo-eo/doc/latex/dir_000024.tex | 17 + trunk/paradiseo-eo/doc/latex/dir_000025.tex | 29 + trunk/paradiseo-eo/doc/latex/dir_000026.tex | 19 + trunk/paradiseo-eo/doc/latex/dir_000027.tex | 9 + trunk/paradiseo-eo/doc/latex/dir_000028.tex | 17 + trunk/paradiseo-eo/doc/latex/dir_000029.tex | 17 + trunk/paradiseo-eo/doc/latex/doxygen.sty | 64 + .../latex/group___evolution_strategies.tex | 21 + .../doc/latex/group___operators.tex | 3 + .../doc/latex/group___parse_tree.tex | 50 + .../latex/group___prop_combined_operators.tex | 3 + .../doc/latex/group___st_parse_tree.tex | 24 + .../doc/latex/group__bitstring.tex | 35 + .../doc/latex/group__selectors.tex | 2 + trunk/paradiseo-eo/doc/latex/hierarchy.tex | 1311 ++ trunk/paradiseo-eo/doc/latex/main.tex | 5 + trunk/paradiseo-eo/doc/latex/modules.tex | 10 + .../doc/latex/namespacegp__parse__tree.tex | 149 + trunk/paradiseo-eo/doc/latex/namespaces.tex | 4 + trunk/paradiseo-eo/doc/latex/pages.tex | 9 + trunk/paradiseo-eo/doc/latex/refman.tex | 404 + trunk/paradiseo-eo/doc/latex/related.tex | 3 + trunk/paradiseo-eo/doc/latex/struct_dummy.eps | 297 + trunk/paradiseo-eo/doc/latex/struct_dummy.tex | 147 + .../doc/latex/struct_t__pickle__suite.tex | 33 + .../doc/latex/structeo_eval_func_ptr.eps | 215 + .../doc/latex/structeo_eval_func_ptr.tex | 62 + ..._functor_base_1_1binary__function__tag.tex | 19 + ...tructeo_functor_base_1_1procedure__tag.tex | 19 + ...o_functor_base_1_1unary__function__tag.tex | 19 + .../doc/latex/structeo_pop_1_1_cmp.tex | 27 + .../doc/latex/structeo_pop_1_1_ref.tex | 27 + .../structeo_state_1_1loading__error.tex | 25 + trunk/paradiseo-eo/doc/latex/todo.tex | 9 + trunk/paradiseo-eo/doc/latex/webpages.tex | 3 + trunk/paradiseo-eo/doc/mainpage.html | 317 + trunk/paradiseo-eo/doc/make_snapshot.out | 1449 ++ .../doc/man/man3/BiasedNodeSelector.3 | 40 + trunk/paradiseo-eo/doc/man/man3/Bitstring.3 | 64 + trunk/paradiseo-eo/doc/man/man3/Cov.3 | 53 + trunk/paradiseo-eo/doc/man/man3/Dummy.3 | 150 + trunk/paradiseo-eo/doc/man/man3/EO.3 | 263 + .../doc/man/man3/EvolutionStrategies.3 | 41 + trunk/paradiseo-eo/doc/man/man3/MemPool.3 | 58 + .../doc/man/man3/MinimizingTraits.3 | 28 + .../paradiseo-eo/doc/man/man3/NodeSelector.3 | 30 + trunk/paradiseo-eo/doc/man/man3/Operators.3 | 8 + trunk/paradiseo-eo/doc/man/man3/ParseTree.3 | 75 + .../doc/man/man3/PropCombinedOperators.3 | 8 + .../doc/man/man3/RandomNodeSelector.3 | 30 + trunk/paradiseo-eo/doc/man/man3/Selectors.3 | 5 + trunk/paradiseo-eo/doc/man/man3/StParseTree.3 | 44 + .../doc/man/man3/T_pickle_suite.3 | 36 + .../doc/man/man3/UF_random_generator.3 | 40 + .../paradiseo-eo/doc/man/man3/VirusBitFlip.3 | 53 + .../doc/man/man3/VirusShiftMutation.3 | 57 + ..._users_dsa_marc_WWW_EO_eo.19Oct2006_app_.3 | 18 + ..._dsa_marc_WWW_EO_eo.19Oct2006_app_gprop_.3 | 30 + ...a_marc_WWW_EO_eo.19Oct2006_app_gpsymreg_.3 | 21 + ...marc_WWW_EO_eo.19Oct2006_app_mastermind_.3 | 15 + ...rs_dsa_marc_WWW_EO_eo.19Oct2006_contrib_.3 | 25 + ...sa_marc_WWW_EO_eo.19Oct2006_contrib_MGE_.3 | 18 + ...arc_WWW_EO_eo.19Oct2006_contrib_mathsym_.3 | 43 + ....19Oct2006_contrib_mathsym_eo_interface_.3 | 36 + ...WW_EO_eo.19Oct2006_contrib_mathsym_eval_.3 | 33 + ...WWW_EO_eo.19Oct2006_contrib_mathsym_fun_.3 | 27 + ...WWW_EO_eo.19Oct2006_contrib_mathsym_gen_.3 | 27 + ...eo.19Oct2006_contrib_mathsym_regression_.3 | 36 + ...WWW_EO_eo.19Oct2006_contrib_mathsym_sym_.3 | 27 + ...WW_EO_eo.19Oct2006_contrib_mathsym_test_.3 | 27 + ..._users_dsa_marc_WWW_EO_eo.19Oct2006_src_.3 | 346 + ...ers_dsa_marc_WWW_EO_eo.19Oct2006_src_do_.3 | 45 + ...ers_dsa_marc_WWW_EO_eo.19Oct2006_src_es_.3 | 138 + ...ers_dsa_marc_WWW_EO_eo.19Oct2006_src_ga_.3 | 66 + ...ers_dsa_marc_WWW_EO_eo.19Oct2006_src_gp_.3 | 30 + ..._dsa_marc_WWW_EO_eo.19Oct2006_src_other_.3 | 18 + ...s_dsa_marc_WWW_EO_eo.19Oct2006_src_pyeo_.3 | 75 + ..._dsa_marc_WWW_EO_eo.19Oct2006_src_utils_.3 | 153 + ...users_dsa_marc_WWW_EO_eo.19Oct2006_test_.3 | 153 + ...s_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_.3 | 34 + ...rc_WWW_EO_eo.19Oct2006_tutorial_Lesson1_.3 | 18 + ...rc_WWW_EO_eo.19Oct2006_tutorial_Lesson2_.3 | 24 + ...rc_WWW_EO_eo.19Oct2006_tutorial_Lesson3_.3 | 24 + ...rc_WWW_EO_eo.19Oct2006_tutorial_Lesson4_.3 | 24 + ...rc_WWW_EO_eo.19Oct2006_tutorial_Lesson5_.3 | 39 + ..._WWW_EO_eo.19Oct2006_tutorial_Templates_.3 | 30 + .../doc/man/man3/boolean_generator.3 | 41 + trunk/paradiseo-eo/doc/man/man3/dMatrix.3 | 47 + .../doc/man/man3/eo1PtBitCrossover.3 | 22 + trunk/paradiseo-eo/doc/man/man3/eoAged.3 | 141 + trunk/paradiseo-eo/doc/man/man3/eoAlgo.3 | 29 + .../doc/man/man3/eoArithmeticCrossover.3 | 21 + .../man/man3/eoAssembledFitnessAverageStat.3 | 52 + .../doc/man/man3/eoAssembledFitnessBestStat.3 | 52 + .../doc/man/man3/eoAtomExchange.3 | 39 + .../paradiseo-eo/doc/man/man3/eoAverageStat.3 | 77 + trunk/paradiseo-eo/doc/man/man3/eoBF.3 | 47 + .../doc/man/man3/eoBestFitnessStat.3 | 67 + .../paradiseo-eo/doc/man/man3/eoBestSelect.3 | 33 + .../paradiseo-eo/doc/man/man3/eoBinCloneOp.3 | 40 + trunk/paradiseo-eo/doc/man/man3/eoBinGenOp.3 | 50 + trunk/paradiseo-eo/doc/man/man3/eoBinOp.3 | 36 + .../doc/man/man3/eoBinaryFunctorCounter.3 | 64 + trunk/paradiseo-eo/doc/man/man3/eoBit.3 | 97 + .../paradiseo-eo/doc/man/man3/eoBitBitFlip.3 | 21 + trunk/paradiseo-eo/doc/man/man3/eoBitGxOver.3 | 69 + .../doc/man/man3/eoBitInversion.3 | 53 + .../paradiseo-eo/doc/man/man3/eoBitMutation.3 | 81 + trunk/paradiseo-eo/doc/man/man3/eoBitNext.3 | 53 + .../doc/man/man3/eoBitOpFactory.3 | 83 + trunk/paradiseo-eo/doc/man/man3/eoBitPrev.3 | 53 + trunk/paradiseo-eo/doc/man/man3/eoBoolFlip.3 | 35 + .../doc/man/man3/eoBooleanGenerator.3 | 44 + .../paradiseo-eo/doc/man/man3/eoBooleanInit.3 | 44 + .../doc/man/man3/eoBranchMutation.3 | 94 + trunk/paradiseo-eo/doc/man/man3/eoBreed.3 | 36 + trunk/paradiseo-eo/doc/man/man3/eoCMABreed.3 | 52 + trunk/paradiseo-eo/doc/man/man3/eoCMAInit.3 | 49 + .../doc/man/man3/eoCellularEasyEA.3 | 75 + .../paradiseo-eo/doc/man/man3/eoCheckPoint.3 | 79 + .../doc/man/man3/eoCollapseSubtreeMutation.3 | 94 + .../doc/man/man3/eoCombinedContinue.3 | 69 + .../doc/man/man3/eoCombinedInit.3 | 72 + .../doc/man/man3/eoCommaReplacement.3 | 35 + trunk/paradiseo-eo/doc/man/man3/eoContinue.3 | 83 + .../doc/man/man3/eoCountedDynUpdate.3 | 44 + .../doc/man/man3/eoCountedStateSaver.3 | 72 + .../doc/man/man3/eoCtrlCContinue.3 | 40 + .../paradiseo-eo/doc/man/man3/eoDetBitFlip.3 | 78 + trunk/paradiseo-eo/doc/man/man3/eoDetSelect.3 | 59 + .../doc/man/man3/eoDetTournamentSelect.3 | 43 + .../doc/man/man3/eoDetTournamentTruncate.3 | 45 + .../man/man3/eoDetTournamentTruncateSplit.3 | 52 + .../doc/man/man3/eoDetTournamentWorthSelect.3 | 52 + .../doc/man/man3/eoDetUniformMutation.3 | 135 + .../man/man3/eoDeterministicSaDReplacement.3 | 62 + .../man/man3/eoDeterministicSurviveAndDie.3 | 41 + trunk/paradiseo-eo/doc/man/man3/eoDistance.3 | 27 + .../doc/man/man3/eoDistribUpdater.3 | 37 + .../doc/man/man3/eoDistribution.3 | 39 + .../doc/man/man3/eoDominanceMap.3 | 93 + .../doc/man/man3/eoDoubleExchange.3 | 39 + .../doc/man/man3/eoDoubleIntermediate.3 | 39 + trunk/paradiseo-eo/doc/man/man3/eoDrawable.3 | 66 + .../doc/man/man3/eoDynSGATransform.3 | 89 + .../paradiseo-eo/doc/man/man3/eoDynUpdater.3 | 43 + trunk/paradiseo-eo/doc/man/man3/eoEDA.3 | 31 + trunk/paradiseo-eo/doc/man/man3/eoEPReduce.3 | 54 + .../doc/man/man3/eoEPReplacement.3 | 42 + trunk/paradiseo-eo/doc/man/man3/eoEasyEA.3 | 110 + .../doc/man/man3/eoEliteSequentialSelect.3 | 55 + trunk/paradiseo-eo/doc/man/man3/eoElitism.3 | 50 + .../paradiseo-eo/doc/man/man3/eoEsChromInit.3 | 190 + trunk/paradiseo-eo/doc/man/man3/eoEsFull.3 | 76 + .../doc/man/man3/eoEsGlobalXover.3 | 130 + trunk/paradiseo-eo/doc/man/man3/eoEsMutate.3 | 254 + .../doc/man/man3/eoEsMutationInit.3 | 116 + trunk/paradiseo-eo/doc/man/man3/eoEsSimple.3 | 80 + .../doc/man/man3/eoEsStandardXover.3 | 76 + trunk/paradiseo-eo/doc/man/man3/eoEsStdev.3 | 73 + .../doc/man/man3/eoEvalContinue.3 | 54 + trunk/paradiseo-eo/doc/man/man3/eoEvalFunc.3 | 41 + .../doc/man/man3/eoEvalFuncCounter.3 | 45 + .../paradiseo-eo/doc/man/man3/eoEvalFuncPtr.3 | 67 + .../doc/man/man3/eoExpansionMutation.3 | 94 + .../doc/man/man3/eoExternalBinOp.3 | 47 + .../paradiseo-eo/doc/man/man3/eoExternalEO.3 | 66 + .../doc/man/man3/eoExternalEvalFunc.3 | 47 + .../doc/man/man3/eoExternalInit.3 | 47 + .../doc/man/man3/eoExternalMonOp.3 | 47 + .../doc/man/man3/eoExternalQuadOp.3 | 47 + trunk/paradiseo-eo/doc/man/man3/eoF.3 | 55 + .../doc/man/man3/eoFDCFileSnapshot.3 | 55 + trunk/paradiseo-eo/doc/man/man3/eoFDCStat.3 | 67 + trunk/paradiseo-eo/doc/man/man3/eoFactory.3 | 74 + .../paradiseo-eo/doc/man/man3/eoFileMonitor.3 | 76 + .../doc/man/man3/eoFileSnapshot.3 | 109 + .../paradiseo-eo/doc/man/man3/eoFitContinue.3 | 70 + .../doc/man/man3/eoFitnessScalingSelect.3 | 54 + .../paradiseo-eo/doc/man/man3/eoFitnessStat.3 | 36 + .../doc/man/man3/eoFlOr1ptBinOp.3 | 48 + .../doc/man/man3/eoFlOr1ptQuadOp.3 | 48 + .../doc/man/man3/eoFlOrAllAtomBinOp.3 | 58 + .../doc/man/man3/eoFlOrAllAtomQuadOp.3 | 58 + .../doc/man/man3/eoFlOrAllMutation.3 | 58 + .../doc/man/man3/eoFlOrKAtomBinOp.3 | 58 + .../doc/man/man3/eoFlOrKAtomQuadOp.3 | 58 + .../doc/man/man3/eoFlOrKMutation.3 | 58 + .../doc/man/man3/eoFlOrUniformBinOp.3 | 55 + .../doc/man/man3/eoFlOrUniformQuadOp.3 | 55 + .../paradiseo-eo/doc/man/man3/eoFunctorBase.3 | 42 + .../man3/eoFunctorBase_binary_function_tag.3 | 21 + .../man/man3/eoFunctorBase_procedure_tag.3 | 21 + .../man3/eoFunctorBase_unary_function_tag.3 | 21 + .../doc/man/man3/eoFunctorStore.3 | 60 + .../doc/man/man3/eoG3Replacement.3 | 49 + .../paradiseo-eo/doc/man/man3/eoGenContinue.3 | 117 + trunk/paradiseo-eo/doc/man/man3/eoGenOp.3 | 58 + .../doc/man/man3/eoGeneDelChooser.3 | 34 + .../doc/man/man3/eoGeneralBreeder.3 | 112 + .../doc/man/man3/eoGeneralIntBounds.3 | 123 + .../doc/man/man3/eoGeneralRealBounds.3 | 119 + .../doc/man/man3/eoGenerationalReplacement.3 | 33 + trunk/paradiseo-eo/doc/man/man3/eoGnuplot.3 | 143 + .../doc/man/man3/eoGnuplot1DMonitor.3 | 62 + .../doc/man/man3/eoGnuplot1DSnapshot.3 | 74 + .../doc/man/man3/eoHammingDistance.3 | 33 + .../doc/man/man3/eoHoistMutation.3 | 81 + trunk/paradiseo-eo/doc/man/man3/eoHowMany.3 | 160 + .../paradiseo-eo/doc/man/man3/eoIncrementor.3 | 50 + .../doc/man/man3/eoIncrementorParam.3 | 51 + trunk/paradiseo-eo/doc/man/man3/eoInit.3 | 55 + .../paradiseo-eo/doc/man/man3/eoInitAdaptor.3 | 52 + .../doc/man/man3/eoInitFixedLength.3 | 54 + .../doc/man/man3/eoInitGenerator.3 | 44 + .../doc/man/man3/eoInitVariableLength.3 | 60 + trunk/paradiseo-eo/doc/man/man3/eoInitVirus.3 | 47 + .../doc/man/man3/eoInitVirus1bit.3 | 47 + .../doc/man/man3/eoInnerExchangeQuadOp.3 | 59 + .../doc/man/man3/eoIntAboveBound.3 | 129 + .../doc/man/man3/eoIntBelowBound.3 | 129 + trunk/paradiseo-eo/doc/man/man3/eoIntBounds.3 | 114 + .../paradiseo-eo/doc/man/man3/eoIntInterval.3 | 135 + .../paradiseo-eo/doc/man/man3/eoIntNoBounds.3 | 118 + .../doc/man/man3/eoInvalidateBinOp.3 | 49 + .../doc/man/man3/eoInvalidateMonOp.3 | 49 + .../doc/man/man3/eoInvalidateQuadOp.3 | 49 + .../doc/man/man3/eoLinearFitScaling.3 | 45 + .../doc/man/man3/eoLinearRandomSplit.3 | 47 + .../doc/man/man3/eoLinearTruncate.3 | 35 + .../doc/man/man3/eoLinearTruncateSplit.3 | 49 + .../doc/man/man3/eoMGGReplacement.3 | 49 + .../doc/man/man3/eoMOFitnessStat.3 | 44 + trunk/paradiseo-eo/doc/man/man3/eoMerge.3 | 29 + .../paradiseo-eo/doc/man/man3/eoMergeReduce.3 | 48 + .../paradiseo-eo/doc/man/man3/eoMonCloneOp.3 | 40 + trunk/paradiseo-eo/doc/man/man3/eoMonGenOp.3 | 50 + trunk/paradiseo-eo/doc/man/man3/eoMonOp.3 | 38 + trunk/paradiseo-eo/doc/man/man3/eoMonitor.3 | 68 + .../doc/man/man3/eoNDPlusReplacement.3 | 53 + trunk/paradiseo-eo/doc/man/man3/eoNDSorting.3 | 94 + .../doc/man/man3/eoNDSorting_DummyEO.3 | 30 + .../paradiseo-eo/doc/man/man3/eoNDSorting_I.3 | 54 + .../doc/man/man3/eoNDSorting_II.3 | 49 + .../doc/man/man3/eoNPtsBitXover.3 | 66 + .../doc/man/man3/eoNegExpGenerator.3 | 48 + .../paradiseo-eo/doc/man/man3/eoNegExpInit.3 | 48 + trunk/paradiseo-eo/doc/man/man3/eoNoElitism.3 | 25 + .../doc/man/man3/eoNoPerf2Worth.3 | 33 + trunk/paradiseo-eo/doc/man/man3/eoNoSelect.3 | 44 + .../doc/man/man3/eoNormalGenerator.3 | 48 + .../paradiseo-eo/doc/man/man3/eoNormalInit.3 | 48 + .../doc/man/man3/eoNormalMutation.3 | 124 + .../doc/man/man3/eoNormalVecMutation.3 | 116 + .../doc/man/man3/eoNthElementFitnessStat.3 | 63 + trunk/paradiseo-eo/doc/man/man3/eoObject.3 | 59 + .../doc/man/man3/eoOneFifthMutation.3 | 114 + trunk/paradiseo-eo/doc/man/man3/eoOneMax.3 | 109 + .../doc/man/man3/eoOneMaxEvalFunc.3 | 55 + .../paradiseo-eo/doc/man/man3/eoOneMaxInit.3 | 64 + .../doc/man/man3/eoOneMaxMutation.3 | 60 + .../doc/man/man3/eoOneMaxQuadCrossover.3 | 62 + trunk/paradiseo-eo/doc/man/man3/eoOp.3 | 54 + .../paradiseo-eo/doc/man/man3/eoOpContainer.3 | 81 + .../paradiseo-eo/doc/man/man3/eoOpSelMason.3 | 94 + .../doc/man/man3/eoPBILAdditive.3 | 68 + .../paradiseo-eo/doc/man/man3/eoPBILDistrib.3 | 80 + trunk/paradiseo-eo/doc/man/man3/eoPBILOrg.3 | 54 + trunk/paradiseo-eo/doc/man/man3/eoParam.3 | 116 + .../doc/man/man3/eoParamParamType.3 | 39 + .../doc/man/man3/eoParameterLoader.3 | 94 + .../doc/man/man3/eoParetoFitness.3 | 75 + .../doc/man/man3/eoParetoFitnessTraits.3 | 38 + .../man/man3/eoParetoOneConstraintFitness.3 | 103 + .../doc/man/man3/eoParetoRanking.3 | 45 + trunk/paradiseo-eo/doc/man/man3/eoParseTree.3 | 148 + .../doc/man/man3/eoParseTreeDepthInit.3 | 108 + trunk/paradiseo-eo/doc/man/man3/eoParser.3 | 267 + .../paradiseo-eo/doc/man/man3/eoPerf2Worth.3 | 52 + .../doc/man/man3/eoPerf2WorthCached.3 | 65 + .../man3/eoPerf2WorthCached_compare_worth.3 | 40 + .../doc/man/man3/eoPerf2Worth_compare_worth.3 | 40 + .../paradiseo-eo/doc/man/man3/eoPersistent.3 | 58 + trunk/paradiseo-eo/doc/man/man3/eoPlus.3 | 33 + .../doc/man/man3/eoPlusReplacement.3 | 35 + .../doc/man/man3/eoPointMutation.3 | 89 + trunk/paradiseo-eo/doc/man/man3/eoPop.3 | 309 + trunk/paradiseo-eo/doc/man/man3/eoPopAlgo.3 | 25 + .../paradiseo-eo/doc/man/man3/eoPopEvalFunc.3 | 37 + .../paradiseo-eo/doc/man/man3/eoPopLoopEval.3 | 44 + trunk/paradiseo-eo/doc/man/man3/eoPopStat.3 | 72 + trunk/paradiseo-eo/doc/man/man3/eoPop_Cmp.3 | 30 + trunk/paradiseo-eo/doc/man/man3/eoPop_Ref.3 | 30 + trunk/paradiseo-eo/doc/man/man3/eoPopulator.3 | 130 + trunk/paradiseo-eo/doc/man/man3/eoPrintable.3 | 55 + .../doc/man/man3/eoProcedureCounter.3 | 64 + .../doc/man/man3/eoPropCombinedBinOp.3 | 53 + .../doc/man/man3/eoPropCombinedMonOp.3 | 58 + .../doc/man/man3/eoPropCombinedQuadOp.3 | 58 + .../paradiseo-eo/doc/man/man3/eoPropGAGenOp.3 | 69 + .../doc/man/man3/eoProportionalOp.3 | 36 + .../doc/man/man3/eoProportionalSelect.3 | 57 + .../paradiseo-eo/doc/man/man3/eoQuad2BinOp.3 | 58 + .../paradiseo-eo/doc/man/man3/eoQuadCloneOp.3 | 40 + .../doc/man/man3/eoQuadDistance.3 | 33 + trunk/paradiseo-eo/doc/man/man3/eoQuadGenOp.3 | 50 + trunk/paradiseo-eo/doc/man/man3/eoQuadOp.3 | 38 + .../doc/man/man3/eoRandomReduce.3 | 33 + .../doc/man/man3/eoRandomSelect.3 | 33 + .../paradiseo-eo/doc/man/man3/eoRandomSplit.3 | 47 + trunk/paradiseo-eo/doc/man/man3/eoRanking.3 | 51 + .../doc/man/man3/eoRankingSelect.3 | 58 + trunk/paradiseo-eo/doc/man/man3/eoReal.3 | 53 + .../doc/man/man3/eoRealAboveBound.3 | 126 + .../doc/man/man3/eoRealBaseVectorBounds.3 | 135 + .../doc/man/man3/eoRealBelowBound.3 | 126 + .../paradiseo-eo/doc/man/man3/eoRealBounds.3 | 103 + .../doc/man/man3/eoRealInitBounded.3 | 53 + .../doc/man/man3/eoRealInterval.3 | 132 + .../doc/man/man3/eoRealNoBounds.3 | 115 + .../paradiseo-eo/doc/man/man3/eoRealUxOver.3 | 21 + .../doc/man/man3/eoRealVectorBounds.3 | 126 + .../doc/man/man3/eoRealVectorNoBounds.3 | 101 + trunk/paradiseo-eo/doc/man/man3/eoReduce.3 | 29 + .../paradiseo-eo/doc/man/man3/eoReduceMerge.3 | 52 + .../doc/man/man3/eoReduceMergeReduce.3 | 61 + .../paradiseo-eo/doc/man/man3/eoReduceSplit.3 | 27 + .../paradiseo-eo/doc/man/man3/eoReplacement.3 | 38 + .../doc/man/man3/eoRndGenerator.3 | 38 + trunk/paradiseo-eo/doc/man/man3/eoRng.3 | 345 + .../doc/man/man3/eoRouletteWorthSelect.3 | 56 + trunk/paradiseo-eo/doc/man/man3/eoSGA.3 | 64 + trunk/paradiseo-eo/doc/man/man3/eoSGAGenOp.3 | 71 + .../doc/man/man3/eoSGATransform.3 | 73 + .../man/man3/eoSSGADetTournamentReplacement.3 | 44 + .../man3/eoSSGAStochTournamentReplacement.3 | 44 + .../doc/man/man3/eoSSGAWorseReplacement.3 | 37 + trunk/paradiseo-eo/doc/man/man3/eoSTLBF.3 | 44 + trunk/paradiseo-eo/doc/man/man3/eoSTLF.3 | 51 + trunk/paradiseo-eo/doc/man/man3/eoSTLUF.3 | 44 + .../doc/man/man3/eoScalarFitness.3 | 66 + .../doc/man/man3/eoScalarFitnessAssembled.3 | 134 + .../man/man3/eoScalarFitnessAssembledTraits.3 | 60 + .../doc/man/man3/eoScalarFitnessStat.3 | 43 + .../doc/man/man3/eoSecondMomentStats.3 | 58 + .../doc/man/man3/eoSegmentCrossover.3 | 108 + .../paradiseo-eo/doc/man/man3/eoSelBinGenOp.3 | 53 + trunk/paradiseo-eo/doc/man/man3/eoSelect.3 | 29 + .../doc/man/man3/eoSelectFactory.3 | 81 + .../doc/man/man3/eoSelectFromWorth.3 | 61 + .../paradiseo-eo/doc/man/man3/eoSelectMany.3 | 74 + .../doc/man/man3/eoSelectNumber.3 | 71 + trunk/paradiseo-eo/doc/man/man3/eoSelectOne.3 | 42 + .../paradiseo-eo/doc/man/man3/eoSelectPerc.3 | 71 + .../doc/man/man3/eoSelectTransform.3 | 48 + .../doc/man/man3/eoSelectivePopulator.3 | 45 + .../doc/man/man3/eoSeqPopulator.3 | 43 + .../doc/man/man3/eoSequentialOp.3 | 53 + .../doc/man/man3/eoSequentialSelect.3 | 58 + trunk/paradiseo-eo/doc/man/man3/eoSharing.3 | 46 + .../doc/man/man3/eoSharingSelect.3 | 56 + trunk/paradiseo-eo/doc/man/man3/eoSimpleEDA.3 | 64 + .../doc/man/man3/eoSortedPopStat.3 | 72 + .../paradiseo-eo/doc/man/man3/eoSortedStat.3 | 35 + .../doc/man/man3/eoSortedStatBase.3 | 37 + .../doc/man/man3/eoStBranchMutation.3 | 94 + .../doc/man/man3/eoStHoistMutation.3 | 94 + .../doc/man/man3/eoStParseTreeDepthInit.3 | 103 + .../doc/man/man3/eoStPointMutation.3 | 89 + .../doc/man/man3/eoStSubtreeXOver.3 | 73 + trunk/paradiseo-eo/doc/man/man3/eoStat.3 | 35 + trunk/paradiseo-eo/doc/man/man3/eoStatBase.3 | 39 + trunk/paradiseo-eo/doc/man/man3/eoState.3 | 154 + .../doc/man/man3/eoState_loading_error.3 | 28 + .../doc/man/man3/eoStdoutMonitor.3 | 50 + .../doc/man/man3/eoSteadyFitContinue.3 | 102 + .../doc/man/man3/eoStochTournamentSelect.3 | 43 + .../doc/man/man3/eoStochTournamentTruncate.3 | 45 + .../man/man3/eoStochTournamentTruncateSplit.3 | 52 + .../man/man3/eoStochTournamentWorthSelect.3 | 52 + .../man/man3/eoStochasticUniversalSelect.3 | 55 + trunk/paradiseo-eo/doc/man/man3/eoString.3 | 85 + .../doc/man/man3/eoSubtreeXOver.3 | 73 + .../doc/man/man3/eoSurviveAndDie.3 | 44 + trunk/paradiseo-eo/doc/man/man3/eoSymInit.3 | 60 + .../paradiseo-eo/doc/man/man3/eoTimeCounter.3 | 38 + .../doc/man/man3/eoTimeVaryingLoopEval.3 | 44 + .../doc/man/man3/eoTimedDynUpdate.3 | 47 + .../doc/man/man3/eoTimedMonitor.3 | 53 + .../doc/man/man3/eoTimedStateSaver.3 | 59 + trunk/paradiseo-eo/doc/man/man3/eoTransform.3 | 27 + .../paradiseo-eo/doc/man/man3/eoTruncSelect.3 | 69 + trunk/paradiseo-eo/doc/man/man3/eoTruncate.3 | 33 + .../doc/man/man3/eoTruncateSplit.3 | 47 + .../doc/man/man3/eoTruncatedSelectMany.3 | 83 + .../doc/man/man3/eoTruncatedSelectOne.3 | 83 + trunk/paradiseo-eo/doc/man/man3/eoUBitXover.3 | 66 + trunk/paradiseo-eo/doc/man/man3/eoUF.3 | 49 + .../doc/man/man3/eoUnaryFunctorCounter.3 | 70 + .../doc/man/man3/eoUniformAtomExchange.3 | 54 + .../doc/man/man3/eoUniformGeneChooser.3 | 36 + .../doc/man/man3/eoUniformGenerator.3 | 62 + .../paradiseo-eo/doc/man/man3/eoUniformInit.3 | 67 + .../doc/man/man3/eoUniformMutation.3 | 133 + trunk/paradiseo-eo/doc/man/man3/eoUpdatable.3 | 34 + trunk/paradiseo-eo/doc/man/man3/eoUpdater.3 | 37 + .../paradiseo-eo/doc/man/man3/eoValueParam.3 | 118 + .../doc/man/man3/eoVariableParetoTraits.3 | 48 + trunk/paradiseo-eo/doc/man/man3/eoVector.3 | 80 + .../doc/man/man3/eoVlAddMutation.3 | 74 + .../doc/man/man3/eoVlAtomExchangeQuadOp.3 | 61 + .../doc/man/man3/eoVlDelMutation.3 | 108 + .../doc/man/man3/eoVlUniformBinOp.3 | 58 + .../doc/man/man3/eoVlUniformQuadOp.3 | 58 + .../doc/man/man3/eoWeakElitistReplacement.3 | 52 + .../paradiseo-eo/doc/man/man3/gp_parse_tree.3 | 175 + .../doc/man/man3/gp_parse_tree_MemPool.3 | 58 + .../doc/man/man3/negexp_generator.3 | 45 + .../doc/man/man3/normal_generator.3 | 45 + .../doc/man/man3/random_generator.3 | 52 + trunk/paradiseo-eo/doc/man/man3/related.3 | 8 + trunk/paradiseo-eo/doc/man/man3/todo.3 | 15 + .../doc/man/man3/uniform_generator.3 | 49 + trunk/paradiseo-eo/doc/man/man3/webpages.3 | 17 + trunk/paradiseo-eo/doc/publications.html | 77 + trunk/paradiseo-eo/doc/sflogo-hammer1.jpg | Bin 0 -> 4793 bytes trunk/paradiseo-eo/gp/CVS/Entries | 1 + trunk/paradiseo-eo/gp/CVS/Repository | 1 + trunk/paradiseo-eo/gp/CVS/Root | 1 + trunk/paradiseo-eo/src/.cvsignore | 6 + trunk/paradiseo-eo/src/CVS/Entries | 108 + trunk/paradiseo-eo/src/CVS/Entries.Log | 10 + trunk/paradiseo-eo/src/CVS/Repository | 1 + trunk/paradiseo-eo/src/CVS/Root | 1 + trunk/paradiseo-eo/src/EO.h | 152 + trunk/paradiseo-eo/src/MGE/CVS/Entries | 1 + trunk/paradiseo-eo/src/MGE/CVS/Repository | 1 + trunk/paradiseo-eo/src/MGE/CVS/Root | 1 + trunk/paradiseo-eo/src/Makefile.am | 116 + trunk/paradiseo-eo/src/apply.h | 44 + trunk/paradiseo-eo/src/do/.cvsignore | 1 + trunk/paradiseo-eo/src/do/CVS/Entries | 16 + trunk/paradiseo-eo/src/do/CVS/Repository | 1 + trunk/paradiseo-eo/src/do/CVS/Root | 1 + trunk/paradiseo-eo/src/do/Makefile.am | 15 + trunk/paradiseo-eo/src/do/Readme | 36 + trunk/paradiseo-eo/src/do/make_algo_easea.h | 368 + trunk/paradiseo-eo/src/do/make_algo_pareto.h | 203 + trunk/paradiseo-eo/src/do/make_algo_scalar.h | 311 + trunk/paradiseo-eo/src/do/make_checkpoint.h | 291 + .../paradiseo-eo/src/do/make_checkpoint_FDC.h | 298 + .../src/do/make_checkpoint_assembled.h | 202 + .../src/do/make_checkpoint_pareto.h | 247 + trunk/paradiseo-eo/src/do/make_continue.h | 160 + .../src/do/make_continue_pareto.h | 108 + .../src/do/make_general_replacement.h | 181 + trunk/paradiseo-eo/src/do/make_pop.h | 108 + trunk/paradiseo-eo/src/do/make_run.h | 45 + trunk/paradiseo-eo/src/eo | 154 + trunk/paradiseo-eo/src/eoAlgo.h | 43 + trunk/paradiseo-eo/src/eoBreed.h | 75 + trunk/paradiseo-eo/src/eoCellularEasyEA.h | 161 + trunk/paradiseo-eo/src/eoCloneOps.h | 79 + trunk/paradiseo-eo/src/eoCombinedContinue.h | 92 + trunk/paradiseo-eo/src/eoCombinedInit.h | 89 + trunk/paradiseo-eo/src/eoContinue.h | 54 + trunk/paradiseo-eo/src/eoCounter.h | 219 + trunk/paradiseo-eo/src/eoCtrlCContinue.cpp | 50 + trunk/paradiseo-eo/src/eoCtrlCContinue.h | 76 + trunk/paradiseo-eo/src/eoDetSelect.h | 83 + .../paradiseo-eo/src/eoDetTournamentSelect.h | 73 + trunk/paradiseo-eo/src/eoDistribUpdater.h | 50 + trunk/paradiseo-eo/src/eoDistribution.h | 52 + trunk/paradiseo-eo/src/eoDominanceMap.h | 162 + trunk/paradiseo-eo/src/eoEDA.h | 46 + trunk/paradiseo-eo/src/eoEasyEA.h | 243 + trunk/paradiseo-eo/src/eoEvalContinue.h | 68 + trunk/paradiseo-eo/src/eoEvalFunc.h | 49 + trunk/paradiseo-eo/src/eoEvalFuncCounter.h | 56 + trunk/paradiseo-eo/src/eoEvalFuncPtr.h | 66 + trunk/paradiseo-eo/src/eoFactory.h | 72 + trunk/paradiseo-eo/src/eoFitContinue.h | 66 + .../paradiseo-eo/src/eoFitnessScalingSelect.h | 54 + trunk/paradiseo-eo/src/eoFlOrBinOp.h | 219 + trunk/paradiseo-eo/src/eoFlOrMonOp.h | 118 + trunk/paradiseo-eo/src/eoFlOrQuadOp.h | 213 + trunk/paradiseo-eo/src/eoFunctor.h | 177 + trunk/paradiseo-eo/src/eoFunctorStore.cpp | 16 + trunk/paradiseo-eo/src/eoFunctorStore.h | 70 + trunk/paradiseo-eo/src/eoG3Replacement.h | 86 + trunk/paradiseo-eo/src/eoGenContinue.h | 103 + trunk/paradiseo-eo/src/eoGenOp.h | 224 + trunk/paradiseo-eo/src/eoGeneralBreeder.h | 106 + trunk/paradiseo-eo/src/eoInit.h | 172 + trunk/paradiseo-eo/src/eoInvalidateOps.h | 134 + trunk/paradiseo-eo/src/eoLinearFitScaling.h | 92 + trunk/paradiseo-eo/src/eoMGGReplacement.h | 103 + trunk/paradiseo-eo/src/eoMerge.h | 134 + trunk/paradiseo-eo/src/eoMergeReduce.h | 115 + trunk/paradiseo-eo/src/eoNDSorting.h | 496 + trunk/paradiseo-eo/src/eoObject.h | 75 + trunk/paradiseo-eo/src/eoOneToOneBreeder.h | 123 + trunk/paradiseo-eo/src/eoOp.h | 170 + trunk/paradiseo-eo/src/eoOpContainer.h | 159 + trunk/paradiseo-eo/src/eoOpSelMason.h | 109 + .../src/eoParetoConstraintFitness.h | 229 + trunk/paradiseo-eo/src/eoParetoFitness.cpp | 38 + trunk/paradiseo-eo/src/eoParetoFitness.h | 234 + trunk/paradiseo-eo/src/eoParetoRanking.h | 71 + trunk/paradiseo-eo/src/eoPerf2Worth.h | 247 + trunk/paradiseo-eo/src/eoPeriodicContinue.h | 63 + trunk/paradiseo-eo/src/eoPersistent.cpp | 15 + trunk/paradiseo-eo/src/eoPersistent.h | 72 + trunk/paradiseo-eo/src/eoPop.h | 304 + trunk/paradiseo-eo/src/eoPopAlgo.h | 17 + trunk/paradiseo-eo/src/eoPopEvalFunc.h | 101 + trunk/paradiseo-eo/src/eoPopulator.h | 208 + trunk/paradiseo-eo/src/eoPrintable.cpp | 22 + trunk/paradiseo-eo/src/eoPrintable.h | 61 + trunk/paradiseo-eo/src/eoPropGAGenOp.h | 87 + .../src/eoProportionalCombinedOp.h | 210 + trunk/paradiseo-eo/src/eoProportionalSelect.h | 85 + trunk/paradiseo-eo/src/eoRandomSelect.h | 98 + trunk/paradiseo-eo/src/eoRanking.h | 110 + trunk/paradiseo-eo/src/eoRankingSelect.h | 55 + trunk/paradiseo-eo/src/eoReduce.h | 288 + trunk/paradiseo-eo/src/eoReduceMerge.h | 119 + trunk/paradiseo-eo/src/eoReduceMergeReduce.h | 143 + trunk/paradiseo-eo/src/eoReduceSplit.h | 323 + trunk/paradiseo-eo/src/eoReplacement.h | 128 + trunk/paradiseo-eo/src/eoSGA.h | 120 + trunk/paradiseo-eo/src/eoSGAGenOp.h | 91 + trunk/paradiseo-eo/src/eoSGATransform.h | 164 + trunk/paradiseo-eo/src/eoSTLFunctor.h | 118 + trunk/paradiseo-eo/src/eoScalarFitness.h | 99 + .../src/eoScalarFitnessAssembled.cpp | 41 + .../src/eoScalarFitnessAssembled.h | 270 + trunk/paradiseo-eo/src/eoSelect.h | 43 + trunk/paradiseo-eo/src/eoSelectFactory.h | 89 + trunk/paradiseo-eo/src/eoSelectFromWorth.h | 224 + trunk/paradiseo-eo/src/eoSelectMany.h | 80 + trunk/paradiseo-eo/src/eoSelectNumber.h | 72 + trunk/paradiseo-eo/src/eoSelectOne.h | 54 + trunk/paradiseo-eo/src/eoSelectPerc.h | 72 + trunk/paradiseo-eo/src/eoSequentialSelect.h | 144 + trunk/paradiseo-eo/src/eoSharing.h | 137 + trunk/paradiseo-eo/src/eoSharingSelect.h | 56 + trunk/paradiseo-eo/src/eoSimpleEDA.h | 105 + trunk/paradiseo-eo/src/eoSteadyFitContinue.h | 114 + .../src/eoStochTournamentSelect.h | 73 + .../src/eoStochasticUniversalSelect.h | 109 + trunk/paradiseo-eo/src/eoSurviveAndDie.h | 191 + trunk/paradiseo-eo/src/eoTransform.h | 41 + trunk/paradiseo-eo/src/eoTruncSelect.h | 73 + .../paradiseo-eo/src/eoTruncatedSelectMany.h | 117 + trunk/paradiseo-eo/src/eoTruncatedSelectOne.h | 111 + .../src/eoVariableLengthCrossover.h | 348 + .../src/eoVariableLengthMutation.h | 158 + trunk/paradiseo-eo/src/eoVector.h | 138 + trunk/paradiseo-eo/src/es.h | 63 + trunk/paradiseo-eo/src/es/.cvsignore | 6 + trunk/paradiseo-eo/src/es/CMAParams.cpp | 234 + trunk/paradiseo-eo/src/es/CMAParams.h | 52 + trunk/paradiseo-eo/src/es/CMAState.cpp | 365 + trunk/paradiseo-eo/src/es/CMAState.h | 79 + trunk/paradiseo-eo/src/es/CVS/Entries | 46 + trunk/paradiseo-eo/src/es/CVS/Repository | 1 + trunk/paradiseo-eo/src/es/CVS/Root | 1 + trunk/paradiseo-eo/src/es/Makefile.am | 54 + trunk/paradiseo-eo/src/es/eig.cpp | 259 + trunk/paradiseo-eo/src/es/eig.h | 25 + trunk/paradiseo-eo/src/es/eoCMABreed.h | 77 + trunk/paradiseo-eo/src/es/eoCMAInit.h | 54 + trunk/paradiseo-eo/src/es/eoEsChromInit.h | 202 + trunk/paradiseo-eo/src/es/eoEsFull.h | 85 + trunk/paradiseo-eo/src/es/eoEsGlobalXover.h | 149 + trunk/paradiseo-eo/src/es/eoEsMutate.h | 286 + trunk/paradiseo-eo/src/es/eoEsMutationInit.h | 121 + trunk/paradiseo-eo/src/es/eoEsSimple.h | 77 + trunk/paradiseo-eo/src/es/eoEsStandardXover.h | 120 + trunk/paradiseo-eo/src/es/eoEsStdev.h | 80 + trunk/paradiseo-eo/src/es/eoNormalMutation.h | 276 + trunk/paradiseo-eo/src/es/eoReal.h | 58 + trunk/paradiseo-eo/src/es/eoRealAtomXover.h | 94 + trunk/paradiseo-eo/src/es/eoRealInitBounded.h | 68 + trunk/paradiseo-eo/src/es/eoRealOp.h | 504 + trunk/paradiseo-eo/src/es/eoSBXcross.h | 133 + .../src/es/make_algo_scalar_es.cpp | 85 + .../src/es/make_algo_scalar_real.cpp | 61 + .../src/es/make_checkpoint_es.cpp | 83 + .../src/es/make_checkpoint_real.cpp | 61 + .../paradiseo-eo/src/es/make_continue_es.cpp | 83 + .../src/es/make_continue_real.cpp | 61 + trunk/paradiseo-eo/src/es/make_es.h | 146 + .../paradiseo-eo/src/es/make_genotype_es.cpp | 121 + .../src/es/make_genotype_real.cpp | 73 + .../paradiseo-eo/src/es/make_genotype_real.h | 136 + trunk/paradiseo-eo/src/es/make_op.h | 294 + trunk/paradiseo-eo/src/es/make_op_es.cpp | 80 + trunk/paradiseo-eo/src/es/make_op_es.h | 197 + trunk/paradiseo-eo/src/es/make_op_real.cpp | 59 + trunk/paradiseo-eo/src/es/make_op_real.h | 284 + trunk/paradiseo-eo/src/es/make_pop_es.cpp | 86 + trunk/paradiseo-eo/src/es/make_pop_real.cpp | 62 + trunk/paradiseo-eo/src/es/make_real.h | 102 + trunk/paradiseo-eo/src/es/make_run_es.cpp | 87 + trunk/paradiseo-eo/src/es/make_run_real.cpp | 63 + trunk/paradiseo-eo/src/es/matrices.h | 42 + trunk/paradiseo-eo/src/ga.h | 42 + trunk/paradiseo-eo/src/ga/.cvsignore | 6 + trunk/paradiseo-eo/src/ga/CVS/Entries | 23 + trunk/paradiseo-eo/src/ga/CVS/Repository | 1 + trunk/paradiseo-eo/src/ga/CVS/Root | 1 + trunk/paradiseo-eo/src/ga/Makefile.am | 32 + trunk/paradiseo-eo/src/ga/Readme | 21 + trunk/paradiseo-eo/src/ga/eoBit.h | 118 + trunk/paradiseo-eo/src/ga/eoBitOp.h | 448 + trunk/paradiseo-eo/src/ga/eoBitOpFactory.h | 170 + trunk/paradiseo-eo/src/ga/eoBoolFlip.h | 46 + trunk/paradiseo-eo/src/ga/eoPBILAdditive.h | 120 + trunk/paradiseo-eo/src/ga/eoPBILDistrib.h | 100 + trunk/paradiseo-eo/src/ga/eoPBILOrg.h | 78 + trunk/paradiseo-eo/src/ga/make_PBILdistrib.h | 101 + trunk/paradiseo-eo/src/ga/make_PBILupdate.h | 79 + .../src/ga/make_algo_scalar_ga.cpp | 64 + .../src/ga/make_checkpoint_ga.cpp | 64 + .../paradiseo-eo/src/ga/make_continue_ga.cpp | 64 + trunk/paradiseo-eo/src/ga/make_ga.h | 94 + .../paradiseo-eo/src/ga/make_genotype_ga.cpp | 55 + trunk/paradiseo-eo/src/ga/make_genotype_ga.h | 77 + trunk/paradiseo-eo/src/ga/make_op.h | 211 + trunk/paradiseo-eo/src/ga/make_op_ga.cpp | 62 + trunk/paradiseo-eo/src/ga/make_pop_ga.cpp | 63 + trunk/paradiseo-eo/src/ga/make_run_ga.cpp | 66 + trunk/paradiseo-eo/src/gp/.cvsignore | 6 + trunk/paradiseo-eo/src/gp/CVS/Entries | 10 + trunk/paradiseo-eo/src/gp/CVS/Repository | 1 + trunk/paradiseo-eo/src/gp/CVS/Root | 1 + trunk/paradiseo-eo/src/gp/Makefile.am | 11 + trunk/paradiseo-eo/src/gp/eoParseTree.h | 189 + .../src/gp/eoParseTreeDepthInit.h | 218 + trunk/paradiseo-eo/src/gp/eoParseTreeOp.h | 380 + .../src/gp/eoStParseTreeDepthInit.h | 190 + trunk/paradiseo-eo/src/gp/eoStParseTreeOp.h | 315 + trunk/paradiseo-eo/src/gp/node_pool.h | 313 + trunk/paradiseo-eo/src/gp/parse_tree.h | 999 ++ trunk/paradiseo-eo/src/obsolete/.cvsignore | 6 + trunk/paradiseo-eo/src/obsolete/CVS/Entries | 80 + .../paradiseo-eo/src/obsolete/CVS/Repository | 1 + trunk/paradiseo-eo/src/obsolete/CVS/Root | 1 + trunk/paradiseo-eo/src/obsolete/Makefile.am | 14 + trunk/paradiseo-eo/src/obsolete/eo1d.h | 199 + .../paradiseo-eo/src/obsolete/eo1dWDistance.h | 136 + trunk/paradiseo-eo/src/obsolete/eo2d.h | 242 + trunk/paradiseo-eo/src/obsolete/eo2dVector.h | 334 + .../paradiseo-eo/src/obsolete/eoAtomBitFlip.h | 58 + trunk/paradiseo-eo/src/obsolete/eoAtomCreep.h | 66 + .../paradiseo-eo/src/obsolete/eoAtomRandom.h | 64 + .../src/obsolete/eoBackInserter.h | 56 + trunk/paradiseo-eo/src/obsolete/eoBin.h | 89 + trunk/paradiseo-eo/src/obsolete/eoBreeder.h | 116 + trunk/paradiseo-eo/src/obsolete/eoCopyElite.h | 110 + trunk/paradiseo-eo/src/obsolete/eoDEA.h | 46 + .../src/obsolete/eoDetTournament.h | 69 + .../obsolete/eoDetTournamentIndiSelector.h | 58 + .../src/obsolete/eoDetTournamentInserter.h | 70 + trunk/paradiseo-eo/src/obsolete/eoDistance.h | 63 + trunk/paradiseo-eo/src/obsolete/eoDup.h | 70 + trunk/paradiseo-eo/src/obsolete/eoES.h | 164 + trunk/paradiseo-eo/src/obsolete/eoESChrom.h | 164 + .../paradiseo-eo/src/obsolete/eoESFullChrom.h | 267 + trunk/paradiseo-eo/src/obsolete/eoESFullMut.h | 261 + .../src/obsolete/eoEsObjectiveBounds.h | 81 + .../src/obsolete/eoEvalFuncPtrCnt.h | 62 + .../src/obsolete/eoEvolutionStrategy.h | 101 + trunk/paradiseo-eo/src/obsolete/eoFitTerm.h | 59 + trunk/paradiseo-eo/src/obsolete/eoFitness.h | 57 + .../paradiseo-eo/src/obsolete/eoGOpBreeder.h | 62 + .../paradiseo-eo/src/obsolete/eoGOpSelector.h | 181 + trunk/paradiseo-eo/src/obsolete/eoGenTerm.h | 68 + .../paradiseo-eo/src/obsolete/eoGeneration.h | 85 + .../src/obsolete/eoGenericBinOp.h | 75 + .../src/obsolete/eoGenericMonOp.h | 75 + .../src/obsolete/eoGenericQuadOp.h | 83 + trunk/paradiseo-eo/src/obsolete/eoID.h | 110 + trunk/paradiseo-eo/src/obsolete/eoInclusion.h | 64 + .../src/obsolete/eoIndiSelector.h | 160 + .../src/obsolete/eoInplaceTransform.h | 193 + trunk/paradiseo-eo/src/obsolete/eoInserter.h | 93 + trunk/paradiseo-eo/src/obsolete/eoInsertion.h | 96 + trunk/paradiseo-eo/src/obsolete/eoKill.h | 62 + trunk/paradiseo-eo/src/obsolete/eoLottery.h | 105 + trunk/paradiseo-eo/src/obsolete/eoMutation.h | 90 + trunk/paradiseo-eo/src/obsolete/eoNegExp.h | 67 + .../paradiseo-eo/src/obsolete/eoNonUniform.h | 87 + trunk/paradiseo-eo/src/obsolete/eoNormal.h | 89 + trunk/paradiseo-eo/src/obsolete/eoOpFactory.h | 87 + .../paradiseo-eo/src/obsolete/eoOpSelector.h | 94 + trunk/paradiseo-eo/src/obsolete/eoParser.h | 838 + .../src/obsolete/eoParserUtils.cpp | 35 + .../paradiseo-eo/src/obsolete/eoParserUtils.h | 24 + trunk/paradiseo-eo/src/obsolete/eoPopOps.h | 142 + trunk/paradiseo-eo/src/obsolete/eoProblem.h | 45 + .../src/obsolete/eoProportional.h | 71 + .../src/obsolete/eoProportionalGOpSel.h | 51 + .../src/obsolete/eoProportionalOpSel.h | 158 + .../paradiseo-eo/src/obsolete/eoRandomBreed.h | 200 + .../src/obsolete/eoRandomIndiSelector.h | 53 + .../src/obsolete/eoRandomSelect.h | 130 + trunk/paradiseo-eo/src/obsolete/eoRank.h | 140 + trunk/paradiseo-eo/src/obsolete/eoScheme.h | 360 + .../src/obsolete/eoSelectRandom.h | 52 + .../src/obsolete/eoSequentialGOpSel.h | 55 + trunk/paradiseo-eo/src/obsolete/eoSimpleDEA.h | 105 + .../src/obsolete/eoSteadyStateEA.h | 84 + .../src/obsolete/eoSteadyStateInserter.h | 53 + .../src/obsolete/eoSteadyStateTransform.h | 88 + .../src/obsolete/eoStochTournament.h | 69 + .../src/obsolete/eoStochTournamentInserter.h | 75 + .../src/obsolete/eoStringMutation.h | 77 + trunk/paradiseo-eo/src/obsolete/eoTerm.h | 56 + .../paradiseo-eo/src/obsolete/eoTournament.h | 157 + trunk/paradiseo-eo/src/obsolete/eoTranspose.h | 94 + .../src/obsolete/eoUniformXOver.h | 176 + trunk/paradiseo-eo/src/obsolete/eoVector.h | 170 + .../paradiseo-eo/src/obsolete/eoWrappedOps.h | 200 + trunk/paradiseo-eo/src/obsolete/eoXOver2.h | 107 + .../src/obsolete/evolution_strategies | 15 + trunk/paradiseo-eo/src/other/.cvsignore | 6 + trunk/paradiseo-eo/src/other/CVS/Entries | 7 + trunk/paradiseo-eo/src/other/CVS/Repository | 1 + trunk/paradiseo-eo/src/other/CVS/Root | 1 + trunk/paradiseo-eo/src/other/Makefile.am | 11 + trunk/paradiseo-eo/src/other/eoExternalEO.h | 93 + .../src/other/eoExternalOpFunctions.h | 170 + trunk/paradiseo-eo/src/other/eoString.h | 81 + trunk/paradiseo-eo/src/other/external_eo | 2 + trunk/paradiseo-eo/src/paradisEO/CVS/Entries | 1 + .../src/paradisEO/CVS/Entries.Log | 3 + .../paradiseo-eo/src/paradisEO/CVS/Repository | 1 + trunk/paradiseo-eo/src/paradisEO/CVS/Root | 1 + .../src/paradisEO/comm/CVS/Entries | 1 + .../src/paradisEO/comm/CVS/Entries.Log | 1 + .../src/paradisEO/comm/CVS/Repository | 1 + .../paradiseo-eo/src/paradisEO/comm/CVS/Root | 1 + .../src/paradisEO/comm/messages/CVS/Entries | 1 + .../paradisEO/comm/messages/CVS/Entries.Log | 2 + .../paradisEO/comm/messages/CVS/Repository | 1 + .../src/paradisEO/comm/messages/CVS/Root | 1 + .../paradisEO/comm/messages/from/CVS/Entries | 1 + .../comm/messages/from/CVS/Repository | 1 + .../src/paradisEO/comm/messages/from/CVS/Root | 1 + .../paradisEO/comm/messages/to/CVS/Entries | 1 + .../paradisEO/comm/messages/to/CVS/Repository | 1 + .../src/paradisEO/comm/messages/to/CVS/Root | 1 + .../src/paradisEO/eval/CVS/Entries | 1 + .../src/paradisEO/eval/CVS/Repository | 1 + .../paradiseo-eo/src/paradisEO/eval/CVS/Root | 1 + .../src/paradisEO/island/CVS/Entries | 1 + .../src/paradisEO/island/CVS/Entries.Log | 1 + .../src/paradisEO/island/CVS/Repository | 1 + .../src/paradisEO/island/CVS/Root | 1 + .../paradisEO/island/topologies/CVS/Entries | 1 + .../island/topologies/CVS/Repository | 1 + .../src/paradisEO/island/topologies/CVS/Root | 1 + trunk/paradiseo-eo/src/pyeo/AUTHORS | 3 + trunk/paradiseo-eo/src/pyeo/BUILDING | 174 + trunk/paradiseo-eo/src/pyeo/COPYING | 340 + trunk/paradiseo-eo/src/pyeo/CVS/Entries | 28 + trunk/paradiseo-eo/src/pyeo/CVS/Entries.Log | 2 + trunk/paradiseo-eo/src/pyeo/CVS/Repository | 1 + trunk/paradiseo-eo/src/pyeo/CVS/Root | 1 + trunk/paradiseo-eo/src/pyeo/Makefile | 36 + trunk/paradiseo-eo/src/pyeo/Makefile.rpm | 31 + trunk/paradiseo-eo/src/pyeo/NEWS | 0 trunk/paradiseo-eo/src/pyeo/PyEO.cpp | 230 + trunk/paradiseo-eo/src/pyeo/PyEO.h | 156 + trunk/paradiseo-eo/src/pyeo/PyEO/CVS/Entries | 2 + .../paradiseo-eo/src/pyeo/PyEO/CVS/Repository | 1 + trunk/paradiseo-eo/src/pyeo/PyEO/CVS/Root | 1 + trunk/paradiseo-eo/src/pyeo/PyEO/__init__.py | 87 + trunk/paradiseo-eo/src/pyeo/README | 4 + trunk/paradiseo-eo/src/pyeo/abstract1.cpp | 46 + trunk/paradiseo-eo/src/pyeo/algos.cpp | 106 + trunk/paradiseo-eo/src/pyeo/breeders.cpp | 51 + trunk/paradiseo-eo/src/pyeo/continuators.cpp | 90 + .../src/pyeo/def_abstract_functor.h | 139 + trunk/paradiseo-eo/src/pyeo/geneticOps.cpp | 158 + trunk/paradiseo-eo/src/pyeo/mergers.cpp | 41 + trunk/paradiseo-eo/src/pyeo/monitors.cpp | 72 + trunk/paradiseo-eo/src/pyeo/perf2worth.cpp | 88 + trunk/paradiseo-eo/src/pyeo/pickle.h | 69 + .../paradiseo-eo/src/pyeo/random_numbers.cpp | 107 + trunk/paradiseo-eo/src/pyeo/reduce.cpp | 65 + trunk/paradiseo-eo/src/pyeo/replacement.cpp | 72 + trunk/paradiseo-eo/src/pyeo/selectOne.cpp | 107 + trunk/paradiseo-eo/src/pyeo/selectors.cpp | 61 + trunk/paradiseo-eo/src/pyeo/statistics.cpp | 61 + trunk/paradiseo-eo/src/pyeo/test/CVS/Entries | 11 + .../paradiseo-eo/src/pyeo/test/CVS/Repository | 1 + trunk/paradiseo-eo/src/pyeo/test/CVS/Root | 1 + trunk/paradiseo-eo/src/pyeo/test/maxone.py | 91 + trunk/paradiseo-eo/src/pyeo/test/run_tests.sh | 9 + .../src/pyeo/test/test_breeders.py | 33 + trunk/paradiseo-eo/src/pyeo/test/test_mo.py | 176 + .../src/pyeo/test/test_pickling.py | 100 + .../src/pyeo/test/test_populator.py | 86 + .../paradiseo-eo/src/pyeo/test/test_reduce.py | 34 + .../src/pyeo/test/test_selectone.py | 66 + trunk/paradiseo-eo/src/pyeo/test/test_sga.py | 44 + .../src/pyeo/test/test_transform.py | 61 + trunk/paradiseo-eo/src/pyeo/valueParam.cpp | 194 + trunk/paradiseo-eo/src/pyeo/valueParam.h | 43 + trunk/paradiseo-eo/src/utils/.cvsignore | 6 + trunk/paradiseo-eo/src/utils/CVS/Entries | 52 + trunk/paradiseo-eo/src/utils/CVS/Repository | 1 + trunk/paradiseo-eo/src/utils/CVS/Root | 1 + trunk/paradiseo-eo/src/utils/Makefile.am | 57 + trunk/paradiseo-eo/src/utils/checkpointing | 21 + trunk/paradiseo-eo/src/utils/compatibility.h | 82 + .../src/utils/eoAssembledFitnessStat.h | 112 + trunk/paradiseo-eo/src/utils/eoCheckPoint.h | 163 + trunk/paradiseo-eo/src/utils/eoData.cpp | 11 + trunk/paradiseo-eo/src/utils/eoData.h | 52 + trunk/paradiseo-eo/src/utils/eoDistance.h | 98 + trunk/paradiseo-eo/src/utils/eoFDCStat.h | 139 + .../paradiseo-eo/src/utils/eoFileMonitor.cpp | 77 + trunk/paradiseo-eo/src/utils/eoFileMonitor.h | 78 + trunk/paradiseo-eo/src/utils/eoFileSnapshot.h | 190 + trunk/paradiseo-eo/src/utils/eoGnuplot.cpp | 98 + trunk/paradiseo-eo/src/utils/eoGnuplot.h | 99 + .../src/utils/eoGnuplot1DMonitor.cpp | 85 + .../src/utils/eoGnuplot1DMonitor.h | 83 + .../src/utils/eoGnuplot1DSnapshot.cpp | 32 + .../src/utils/eoGnuplot1DSnapshot.h | 119 + trunk/paradiseo-eo/src/utils/eoHowMany.h | 192 + trunk/paradiseo-eo/src/utils/eoIntBounds.cpp | 98 + trunk/paradiseo-eo/src/utils/eoIntBounds.h | 692 + .../paradiseo-eo/src/utils/eoMOFitnessStat.h | 91 + trunk/paradiseo-eo/src/utils/eoMonitor.h | 65 + trunk/paradiseo-eo/src/utils/eoParam.h | 441 + trunk/paradiseo-eo/src/utils/eoParser.cpp | 413 + trunk/paradiseo-eo/src/utils/eoParser.h | 287 + trunk/paradiseo-eo/src/utils/eoPopStat.h | 133 + trunk/paradiseo-eo/src/utils/eoRNG.cpp | 14 + trunk/paradiseo-eo/src/utils/eoRNG.h | 533 + trunk/paradiseo-eo/src/utils/eoRealBounds.cpp | 259 + trunk/paradiseo-eo/src/utils/eoRealBounds.h | 652 + .../src/utils/eoRealVectorBounds.h | 421 + .../paradiseo-eo/src/utils/eoRndGenerators.h | 149 + .../src/utils/eoScalarFitnessStat.h | 63 + trunk/paradiseo-eo/src/utils/eoStat.h | 443 + trunk/paradiseo-eo/src/utils/eoState.cpp | 195 + trunk/paradiseo-eo/src/utils/eoState.h | 135 + .../src/utils/eoStdoutMonitor.cpp | 55 + .../paradiseo-eo/src/utils/eoStdoutMonitor.h | 52 + trunk/paradiseo-eo/src/utils/eoTimeCounter.h | 65 + trunk/paradiseo-eo/src/utils/eoTimedMonitor.h | 76 + trunk/paradiseo-eo/src/utils/eoUniformInit.h | 155 + trunk/paradiseo-eo/src/utils/eoUpdatable.h | 111 + trunk/paradiseo-eo/src/utils/eoUpdater.cpp | 48 + trunk/paradiseo-eo/src/utils/eoUpdater.h | 157 + trunk/paradiseo-eo/src/utils/make_help.cpp | 109 + trunk/paradiseo-eo/src/utils/pipecom.cpp | 172 + trunk/paradiseo-eo/src/utils/pipecom.h | 47 + trunk/paradiseo-eo/src/utils/rnd_generators.h | 168 + trunk/paradiseo-eo/src/utils/selectors.h | 338 + trunk/paradiseo-eo/test/.cvsignore | 29 + trunk/paradiseo-eo/test/CVS/Entries | 53 + trunk/paradiseo-eo/test/CVS/Repository | 1 + trunk/paradiseo-eo/test/CVS/Root | 1 + trunk/paradiseo-eo/test/Makefile.am | 93 + trunk/paradiseo-eo/test/RoyalRoad.h | 60 + trunk/paradiseo-eo/test/binary_value.h | 16 + trunk/paradiseo-eo/test/fitness_traits.cpp | 433 + trunk/paradiseo-eo/test/real_value.h | 19 + trunk/paradiseo-eo/test/run_tests | 9 + trunk/paradiseo-eo/test/t-MGE-control.cpp | 104 + trunk/paradiseo-eo/test/t-MGE.cpp | 108 + trunk/paradiseo-eo/test/t-MGE1bit.cpp | 111 + trunk/paradiseo-eo/test/t-eo.cpp | 23 + trunk/paradiseo-eo/test/t-eo2dVector.cc | 220 + trunk/paradiseo-eo/test/t-eoAtomOps.cpp | 66 + trunk/paradiseo-eo/test/t-eoBaseFunctions.cpp | 26 + trunk/paradiseo-eo/test/t-eoCMAES.cpp | 128 + trunk/paradiseo-eo/test/t-eoCheckpointing.cpp | 183 + trunk/paradiseo-eo/test/t-eoESAll.cpp | 150 + trunk/paradiseo-eo/test/t-eoESFull.cpp | 180 + trunk/paradiseo-eo/test/t-eoESOps.cpp | 116 + trunk/paradiseo-eo/test/t-eoEasyEA.cpp | 84 + trunk/paradiseo-eo/test/t-eoExternalEO.cpp | 132 + .../test/t-eoFitnessAssembled.cpp | 105 + .../test/t-eoFitnessAssembledEA.cpp | 174 + trunk/paradiseo-eo/test/t-eoFunctor.cpp | 49 + trunk/paradiseo-eo/test/t-eoGA.cpp | 72 + trunk/paradiseo-eo/test/t-eoGOpSel.cpp | 131 + trunk/paradiseo-eo/test/t-eoGenOp.cpp | 428 + trunk/paradiseo-eo/test/t-eoNonUniform.cpp | 31 + trunk/paradiseo-eo/test/t-eoPBIL.cpp | 141 + trunk/paradiseo-eo/test/t-eoPareto.cpp | 248 + trunk/paradiseo-eo/test/t-eoParetoFitness.cpp | 196 + trunk/paradiseo-eo/test/t-eoRandom.cpp | 66 + trunk/paradiseo-eo/test/t-eoReal.cpp | 72 + trunk/paradiseo-eo/test/t-eoReplacement.cpp | 223 + trunk/paradiseo-eo/test/t-eoRoulette.cpp | 68 + trunk/paradiseo-eo/test/t-eoSSGA.cpp | 117 + trunk/paradiseo-eo/test/t-eoSelect.cpp | 224 + trunk/paradiseo-eo/test/t-eoSharing.cpp | 240 + .../paradiseo-eo/test/t-eoStateAndParser.cpp | 139 + trunk/paradiseo-eo/test/t-eoSymreg.cpp | 295 + trunk/paradiseo-eo/test/t-eoUniform.cpp | 22 + trunk/paradiseo-eo/test/t-eoVector.cpp | 74 + trunk/paradiseo-eo/test/t-eoVirus.cpp | 77 + trunk/paradiseo-eo/test/t-eobin.cpp | 218 + trunk/paradiseo-eo/test/t-eobreeder.cpp | 87 + trunk/paradiseo-eo/test/t-eofitness.cpp | 90 + trunk/paradiseo-eo/test/t-eogeneration.cpp | 145 + trunk/paradiseo-eo/test/t-eoinclusion.cpp | 97 + trunk/paradiseo-eo/test/t-eoinsertion.cpp | 108 + trunk/paradiseo-eo/test/t-eolottery.cpp | 54 + trunk/paradiseo-eo/test/t-eoproblem.cpp | 55 + trunk/paradiseo-eo/test/t-selectOne.cpp | 88 + trunk/paradiseo-eo/tutorial/.cvsignore | 1 + trunk/paradiseo-eo/tutorial/CVS/Entries | 6 + trunk/paradiseo-eo/tutorial/CVS/Entries.Log | 10 + trunk/paradiseo-eo/tutorial/CVS/Repository | 1 + trunk/paradiseo-eo/tutorial/CVS/Root | 1 + .../paradiseo-eo/tutorial/Lesson1/.cvsignore | 1 + .../paradiseo-eo/tutorial/Lesson1/CVS/Entries | 7 + .../tutorial/Lesson1/CVS/Repository | 1 + trunk/paradiseo-eo/tutorial/Lesson1/CVS/Root | 1 + .../tutorial/Lesson1/FirstBitGA.cpp | 167 + .../tutorial/Lesson1/FirstRealGA.cpp | 162 + .../paradiseo-eo/tutorial/Lesson1/Makefile.am | 16 + .../tutorial/Lesson1/Makefile.simple | 25 + .../tutorial/Lesson1/exercise1.3.cpp | 162 + .../paradiseo-eo/tutorial/Lesson2/.cvsignore | 1 + .../paradiseo-eo/tutorial/Lesson2/CVS/Entries | 9 + .../tutorial/Lesson2/CVS/Repository | 1 + trunk/paradiseo-eo/tutorial/Lesson2/CVS/Root | 1 + .../tutorial/Lesson2/FirstBitEA.cpp | 193 + .../tutorial/Lesson2/FirstRealEA.cpp | 192 + .../paradiseo-eo/tutorial/Lesson2/Makefile.am | 23 + .../tutorial/Lesson2/Makefile.simple | 34 + .../tutorial/Lesson2/binary_value.h | 17 + .../tutorial/Lesson2/exercise2.3.cpp | 197 + .../tutorial/Lesson2/real_value.h | 20 + .../paradiseo-eo/tutorial/Lesson3/.cvsignore | 1 + .../paradiseo-eo/tutorial/Lesson3/CVS/Entries | 9 + .../tutorial/Lesson3/CVS/Repository | 1 + trunk/paradiseo-eo/tutorial/Lesson3/CVS/Root | 1 + .../paradiseo-eo/tutorial/Lesson3/Makefile.am | 22 + .../tutorial/Lesson3/Makefile.simple | 33 + .../tutorial/Lesson3/SecondBitEA.cpp | 348 + .../tutorial/Lesson3/SecondRealEA.cpp | 329 + .../tutorial/Lesson3/binary_value.h | 17 + .../tutorial/Lesson3/exercise3.1.cpp | 404 + .../tutorial/Lesson3/real_value.h | 20 + .../paradiseo-eo/tutorial/Lesson4/.cvsignore | 1 + trunk/paradiseo-eo/tutorial/Lesson4/BitEA.cpp | 95 + .../paradiseo-eo/tutorial/Lesson4/CVS/Entries | 11 + .../tutorial/Lesson4/CVS/Repository | 1 + trunk/paradiseo-eo/tutorial/Lesson4/CVS/Root | 1 + trunk/paradiseo-eo/tutorial/Lesson4/ESEA.cpp | 137 + .../paradiseo-eo/tutorial/Lesson4/ESEA.param | 62 + .../paradiseo-eo/tutorial/Lesson4/Makefile.am | 26 + .../tutorial/Lesson4/Makefile.simple | 33 + .../paradiseo-eo/tutorial/Lesson4/RealEA.cpp | 72 + .../tutorial/Lesson4/RealEA.param | 57 + .../tutorial/Lesson4/binary_value.h | 25 + .../tutorial/Lesson4/real_value.h | 19 + .../paradiseo-eo/tutorial/Lesson5/.cvsignore | 1 + .../paradiseo-eo/tutorial/Lesson5/CVS/Entries | 14 + .../tutorial/Lesson5/CVS/Repository | 1 + trunk/paradiseo-eo/tutorial/Lesson5/CVS/Root | 1 + .../paradiseo-eo/tutorial/Lesson5/Makefile.am | 28 + .../tutorial/Lesson5/Makefile.simple | 56 + .../tutorial/Lesson5/OneMaxEA.cpp | 188 + .../tutorial/Lesson5/OneMaxLibEA.cpp | 162 + .../paradiseo-eo/tutorial/Lesson5/eoOneMax.h | 111 + .../tutorial/Lesson5/eoOneMaxEvalFunc.h | 68 + .../tutorial/Lesson5/eoOneMaxInit.h | 63 + .../tutorial/Lesson5/eoOneMaxMutation.h | 68 + .../tutorial/Lesson5/eoOneMaxQuadCrossover.h | 70 + .../tutorial/Lesson5/make_OneMax.cpp | 129 + .../tutorial/Lesson5/make_genotype_OneMax.h | 75 + .../tutorial/Lesson5/make_op_OneMax.h | 210 + trunk/paradiseo-eo/tutorial/Makefile.am | 2 + trunk/paradiseo-eo/tutorial/Makefile.simple | 29 + .../tutorial/ParadisEO/CVS/Entries | 1 + .../tutorial/ParadisEO/CVS/Entries.Log | 3 + .../tutorial/ParadisEO/CVS/Repository | 1 + .../paradiseo-eo/tutorial/ParadisEO/CVS/Root | 1 + .../tutorial/ParadisEO/Lesson1/CVS/Entries | 1 + .../tutorial/ParadisEO/Lesson1/CVS/Repository | 1 + .../tutorial/ParadisEO/Lesson1/CVS/Root | 1 + .../tutorial/ParadisEO/Lesson2/CVS/Entries | 1 + .../tutorial/ParadisEO/Lesson2/CVS/Repository | 1 + .../tutorial/ParadisEO/Lesson2/CVS/Root | 1 + .../tutorial/ParadisEO/Lesson3/CVS/Entries | 1 + .../tutorial/ParadisEO/Lesson3/CVS/Repository | 1 + .../tutorial/ParadisEO/Lesson3/CVS/Root | 1 + trunk/paradiseo-eo/tutorial/README | 13 + .../tutorial/Templates/CVS/Entries | 24 + .../tutorial/Templates/CVS/Repository | 1 + .../paradiseo-eo/tutorial/Templates/CVS/Root | 1 + trunk/paradiseo-eo/tutorial/Templates/EO.tpl | 938 + .../tutorial/Templates/MakeSimple.tmpl | 28 + .../tutorial/Templates/Makefile.tmpl | 48 + .../tutorial/Templates/MyStructEA.cpp | 188 + .../tutorial/Templates/MyStructLibEA.cpp | 162 + .../tutorial/Templates/MyStructSEA.cpp | 350 + trunk/paradiseo-eo/tutorial/Templates/README | 149 + .../tutorial/Templates/binCrossover.tmpl | 70 + .../tutorial/Templates/continue.tmpl | 65 + .../paradiseo-eo/tutorial/Templates/create.sh | 62 + .../tutorial/Templates/createSimple | 59 + .../tutorial/Templates/eoMyStruct.tmpl | 118 + .../tutorial/Templates/evalFunc.tmpl | 65 + .../paradiseo-eo/tutorial/Templates/init.tmpl | 58 + .../lessOffspringExternalSelectorGenOp.tmpl | 81 + .../lessOffspringSameSelectorGenOp.tmpl | 76 + .../tutorial/Templates/make_MyStruct.cpp | 129 + .../Templates/make_genotype_MyStruct.h | 73 + .../tutorial/Templates/make_op_MyStruct.h | 210 + .../Templates/moreOffspringGenOp.tmpl | 77 + .../tutorial/Templates/mutation.tmpl | 68 + .../tutorial/Templates/quadCrossover.tmpl | 71 + .../paradiseo-eo/tutorial/Templates/stat.tmpl | 64 + .../tutorial/examples/CVS/Entries | 1 + .../tutorial/examples/CVS/Repository | 1 + trunk/paradiseo-eo/tutorial/examples/CVS/Root | 1 + trunk/paradiseo-eo/tutorial/html/BitEA.html | 261 + trunk/paradiseo-eo/tutorial/html/CVS/Entries | 45 + .../paradiseo-eo/tutorial/html/CVS/Repository | 1 + trunk/paradiseo-eo/tutorial/html/CVS/Root | 1 + .../tutorial/html/EA_tutorial.jpg | Bin 0 -> 177758 bytes .../tutorial/html/FirstBitEA.html | 369 + .../tutorial/html/FirstBitGA.html | 312 + .../tutorial/html/FirstRealEA.html | 354 + .../tutorial/html/FirstRealGA.html | 350 + .../tutorial/html/Firstmerge.html | 286 + trunk/paradiseo-eo/tutorial/html/NoWay.html | 77 + .../paradiseo-eo/tutorial/html/OneMaxEA.html | 360 + .../tutorial/html/SecondBitEA.html | 569 + .../tutorial/html/SecondRealEA.html | 468 + trunk/paradiseo-eo/tutorial/html/beige009.jpg | Bin 0 -> 6643 bytes .../tutorial/html/binary_value.html | 57 + trunk/paradiseo-eo/tutorial/html/debut.html | 21 + .../tutorial/html/eoBottomUp.html | 77 + .../tutorial/html/eoCheckPoint.html | 150 + .../paradiseo-eo/tutorial/html/eoEngine.html | 778 + trunk/paradiseo-eo/tutorial/html/eoEval.html | 34 + .../tutorial/html/eoGeneration.html | 19 + trunk/paradiseo-eo/tutorial/html/eoInit.html | 36 + trunk/paradiseo-eo/tutorial/html/eoIo.html | 25 + .../paradiseo-eo/tutorial/html/eoLesson1.html | 440 + .../paradiseo-eo/tutorial/html/eoLesson2.html | 357 + .../paradiseo-eo/tutorial/html/eoLesson3.html | 565 + .../paradiseo-eo/tutorial/html/eoLesson4.html | 940 + .../paradiseo-eo/tutorial/html/eoLesson5.html | 415 + .../paradiseo-eo/tutorial/html/eoOneMax.html | 209 + .../tutorial/html/eoOneMaxEvalFunc.html | 160 + .../tutorial/html/eoOneMaxInit.html | 153 + .../tutorial/html/eoOneMaxMutation.html | 168 + .../tutorial/html/eoOneMaxQuadCrossover.html | 168 + .../tutorial/html/eoOneMax_complete.html | 192 + .../tutorial/html/eoOperators.html | 818 + .../paradiseo-eo/tutorial/html/eoOutput.html | 19 + .../tutorial/html/eoProgramming.html | 498 + .../tutorial/html/eoRepresentation.html | 19 + trunk/paradiseo-eo/tutorial/html/eoSGA.html | 157 + .../paradiseo-eo/tutorial/html/eoSelect.html | 19 + trunk/paradiseo-eo/tutorial/html/eoStop.html | 25 + .../paradiseo-eo/tutorial/html/eoTopDown.html | 120 + .../tutorial/html/eoTutorial.html | 271 + .../tutorial/html/make_genotype_OneMax.html | 160 + .../tutorial/html/make_op_OneMax.html | 351 + .../tutorial/html/real_value.html | 56 + trunk/paradiseo-eo/tutorial/index.html | 26 + trunk/paradiseo-eo/tutorial/pdf/CVS/Entries | 2 + .../paradiseo-eo/tutorial/pdf/CVS/Repository | 1 + trunk/paradiseo-eo/tutorial/pdf/CVS/Root | 1 + .../tutorial/pdf/paradiseoJet7.pdf | Bin 0 -> 530785 bytes trunk/paradiseo-eo/win/.cvsignore | 7 + trunk/paradiseo-eo/win/CVS/Entries | 61 + trunk/paradiseo-eo/win/CVS/Entries.Log | 1 + trunk/paradiseo-eo/win/CVS/Repository | 1 + trunk/paradiseo-eo/win/CVS/Root | 1 + trunk/paradiseo-eo/win/Makefile.am | 1 + trunk/paradiseo-eo/win/Readme | 20 + trunk/paradiseo-eo/win/all_lib.dsp | 112 + trunk/paradiseo-eo/win/all_tests.dsp | 96 + trunk/paradiseo-eo/win/all_tut.dsp | 96 + trunk/paradiseo-eo/win/create_all_dsp.sh | 38 + trunk/paradiseo-eo/win/create_dsp.sh | 37 + trunk/paradiseo-eo/win/create_tut.sh | 38 + trunk/paradiseo-eo/win/create_tut_para.sh | 38 + trunk/paradiseo-eo/win/eo.dsp | 126 + trunk/paradiseo-eo/win/eo.dsw | 728 + trunk/paradiseo-eo/win/eo.org | 65 + trunk/paradiseo-eo/win/es.dsp | 224 + trunk/paradiseo-eo/win/ga.dsp | 144 + trunk/paradiseo-eo/win/lib/CVS/Entries | 2 + trunk/paradiseo-eo/win/lib/CVS/Repository | 1 + trunk/paradiseo-eo/win/lib/CVS/Root | 1 + trunk/paradiseo-eo/win/lib/Readme | 4 + trunk/paradiseo-eo/win/make_snapshot.out | 49 + trunk/paradiseo-eo/win/t_eo.dsp | 102 + trunk/paradiseo-eo/win/t_eobin.dsp | 102 + trunk/paradiseo-eo/win/t_eocheckpointing.dsp | 102 + trunk/paradiseo-eo/win/t_eoesall.dsp | 102 + trunk/paradiseo-eo/win/t_eoexternaleo.dsp | 102 + trunk/paradiseo-eo/win/t_eofitness.dsp | 102 + .../paradiseo-eo/win/t_eofitnessassembled.dsp | 102 + .../win/t_eofitnessassembledea.dsp | 102 + trunk/paradiseo-eo/win/t_eoga.dsp | 102 + trunk/paradiseo-eo/win/t_eogenop.dsp | 102 + trunk/paradiseo-eo/win/t_eopareto.dsp | 102 + trunk/paradiseo-eo/win/t_eoparetofitness.dsp | 102 + trunk/paradiseo-eo/win/t_eopbil.dsp | 102 + trunk/paradiseo-eo/win/t_eorandom.dsp | 102 + trunk/paradiseo-eo/win/t_eoreal.dsp | 102 + trunk/paradiseo-eo/win/t_eoreplacement.dsp | 102 + trunk/paradiseo-eo/win/t_eoselect.dsp | 102 + trunk/paradiseo-eo/win/t_eossga.dsp | 102 + trunk/paradiseo-eo/win/t_eostateandparser.dsp | 102 + trunk/paradiseo-eo/win/t_eosymreg.dsp | 102 + trunk/paradiseo-eo/win/t_eovector.dsp | 102 + trunk/paradiseo-eo/win/t_eovirus.dsp | 102 + trunk/paradiseo-eo/win/t_mge-control.dsp | 102 + trunk/paradiseo-eo/win/t_mge.dsp | 102 + trunk/paradiseo-eo/win/t_mge1bit.dsp | 102 + trunk/paradiseo-eo/win/test_dsp.tmpl | 102 + trunk/paradiseo-eo/win/tut_1_bit.dsp | 102 + trunk/paradiseo-eo/win/tut_1_ex3.dsp | 102 + trunk/paradiseo-eo/win/tut_1_real.dsp | 102 + trunk/paradiseo-eo/win/tut_2_bit.dsp | 102 + trunk/paradiseo-eo/win/tut_2_ex3.dsp | 102 + trunk/paradiseo-eo/win/tut_2_real.dsp | 102 + trunk/paradiseo-eo/win/tut_3_bit.dsp | 102 + trunk/paradiseo-eo/win/tut_3_ex1.dsp | 102 + trunk/paradiseo-eo/win/tut_4_bit.dsp | 102 + trunk/paradiseo-eo/win/tut_4_es.dsp | 102 + trunk/paradiseo-eo/win/tut_4_real.dsp | 102 + trunk/paradiseo-eo/win/tut_N_XXX.tmpl | 102 + trunk/paradiseo-eo/win/tut_para1_full.dsp | 102 + trunk/paradiseo-eo/win/tut_para1_ring1.dsp | 102 + trunk/paradiseo-eo/win/tut_para1_ring2.dsp | 102 + trunk/paradiseo-eo/win/tut_para2_master.dsp | 102 + trunk/paradiseo-eo/win/tut_para2_slave.dsp | 102 + trunk/paradiseo-eo/win/tut_paraN_XXX.tmpl | 102 + trunk/paradiseo-eo/win/utils.dsp | 240 + 3609 files changed, 342772 insertions(+) create mode 100644 trunk/paradiseo-eo/.cvsignore create mode 100644 trunk/paradiseo-eo/AUTHORS create mode 100644 trunk/paradiseo-eo/COPYING create mode 100644 trunk/paradiseo-eo/CVS/Entries create mode 100644 trunk/paradiseo-eo/CVS/Entries.Log create mode 100644 trunk/paradiseo-eo/CVS/Repository create mode 100644 trunk/paradiseo-eo/CVS/Root create mode 100644 trunk/paradiseo-eo/ChangeLog create mode 100644 trunk/paradiseo-eo/ForRelease create mode 100644 trunk/paradiseo-eo/INSTALL create mode 100644 trunk/paradiseo-eo/LICENSE create mode 100644 trunk/paradiseo-eo/Makefile.am create mode 100644 trunk/paradiseo-eo/NEWS create mode 100644 trunk/paradiseo-eo/README create mode 100644 trunk/paradiseo-eo/README.html create mode 100644 trunk/paradiseo-eo/THANKS create mode 100644 trunk/paradiseo-eo/TODO.html create mode 100644 trunk/paradiseo-eo/Tutorial/CVS/Entries create mode 100644 trunk/paradiseo-eo/Tutorial/CVS/Repository create mode 100644 trunk/paradiseo-eo/Tutorial/CVS/Root create mode 100644 trunk/paradiseo-eo/acinclude.m4 create mode 100644 trunk/paradiseo-eo/app/.cvsignore create mode 100644 trunk/paradiseo-eo/app/CVS/Entries create mode 100644 trunk/paradiseo-eo/app/CVS/Entries.Log create mode 100644 trunk/paradiseo-eo/app/CVS/Repository create mode 100644 trunk/paradiseo-eo/app/CVS/Root create mode 100644 trunk/paradiseo-eo/app/Makefile.am create mode 100644 trunk/paradiseo-eo/app/gprop/.cvsignore create mode 100644 trunk/paradiseo-eo/app/gprop/CVS/Entries create mode 100644 trunk/paradiseo-eo/app/gprop/CVS/Repository create mode 100644 trunk/paradiseo-eo/app/gprop/CVS/Root create mode 100644 trunk/paradiseo-eo/app/gprop/Makefile.am create mode 100644 trunk/paradiseo-eo/app/gprop/gprop.cpp create mode 100644 trunk/paradiseo-eo/app/gprop/gprop.h create mode 100644 trunk/paradiseo-eo/app/gprop/l2.h create mode 100644 trunk/paradiseo-eo/app/gprop/mlp.h create mode 100644 trunk/paradiseo-eo/app/gprop/mse.h create mode 100644 trunk/paradiseo-eo/app/gprop/qp.h create mode 100644 trunk/paradiseo-eo/app/gprop/vecop.h create mode 100644 trunk/paradiseo-eo/app/gpsymreg/.cvsignore create mode 100644 trunk/paradiseo-eo/app/gpsymreg/CVS/Entries create mode 100644 trunk/paradiseo-eo/app/gpsymreg/CVS/Repository create mode 100644 trunk/paradiseo-eo/app/gpsymreg/CVS/Root create mode 100644 trunk/paradiseo-eo/app/gpsymreg/Makefile.am create mode 100644 trunk/paradiseo-eo/app/gpsymreg/fitness.h create mode 100644 trunk/paradiseo-eo/app/gpsymreg/main.cpp create mode 100644 trunk/paradiseo-eo/app/gpsymreg/node.h create mode 100644 trunk/paradiseo-eo/app/gpsymreg/parameters.h create mode 100644 trunk/paradiseo-eo/app/master/CVS/Entries create mode 100644 trunk/paradiseo-eo/app/master/CVS/Repository create mode 100644 trunk/paradiseo-eo/app/master/CVS/Root create mode 100644 trunk/paradiseo-eo/app/mastermind/.cvsignore create mode 100644 trunk/paradiseo-eo/app/mastermind/CVS/Entries create mode 100644 trunk/paradiseo-eo/app/mastermind/CVS/Repository create mode 100644 trunk/paradiseo-eo/app/mastermind/CVS/Root create mode 100644 trunk/paradiseo-eo/app/mastermind/Makefile.am create mode 100644 trunk/paradiseo-eo/app/mastermind/mastermind.cpp create mode 100644 trunk/paradiseo-eo/app/mastermind/mastermind.h create mode 100755 trunk/paradiseo-eo/autogen.sh create mode 100644 trunk/paradiseo-eo/build-freebsd-x86/CVS/Entries create mode 100644 trunk/paradiseo-eo/build-freebsd-x86/CVS/Repository create mode 100644 trunk/paradiseo-eo/build-freebsd-x86/CVS/Root create mode 100644 trunk/paradiseo-eo/build-linux-x86/CVS/Entries create mode 100644 trunk/paradiseo-eo/build-linux-x86/CVS/Repository create mode 100644 trunk/paradiseo-eo/build-linux-x86/CVS/Root create mode 100644 trunk/paradiseo-eo/configure.in create mode 100644 trunk/paradiseo-eo/contrib/.cvsignore create mode 100644 trunk/paradiseo-eo/contrib/CVS/Entries create mode 100644 trunk/paradiseo-eo/contrib/CVS/Entries.Log create mode 100644 trunk/paradiseo-eo/contrib/CVS/Repository create mode 100644 trunk/paradiseo-eo/contrib/CVS/Root create mode 100644 trunk/paradiseo-eo/contrib/MGE/CVS/Entries create mode 100644 trunk/paradiseo-eo/contrib/MGE/CVS/Repository create mode 100644 trunk/paradiseo-eo/contrib/MGE/CVS/Root create mode 100644 trunk/paradiseo-eo/contrib/MGE/VirusOp.h create mode 100644 trunk/paradiseo-eo/contrib/MGE/eoInitVirus.h create mode 100644 trunk/paradiseo-eo/contrib/MGE/eoVirus.h create mode 100644 trunk/paradiseo-eo/contrib/Makefile.am create mode 100644 trunk/paradiseo-eo/contrib/boost/CVS/Entries create mode 100644 trunk/paradiseo-eo/contrib/boost/CVS/Entries.Log create mode 100644 trunk/paradiseo-eo/contrib/boost/CVS/Repository create mode 100644 trunk/paradiseo-eo/contrib/boost/CVS/Root create mode 100644 trunk/paradiseo-eo/contrib/boost/config.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/CVS/Entries create mode 100644 trunk/paradiseo-eo/contrib/boost/config/CVS/Entries.Log create mode 100644 trunk/paradiseo-eo/contrib/boost/config/CVS/Repository create mode 100644 trunk/paradiseo-eo/contrib/boost/config/CVS/Root create mode 100644 trunk/paradiseo-eo/contrib/boost/config/abi/CVS/Entries create mode 100644 trunk/paradiseo-eo/contrib/boost/config/abi/CVS/Repository create mode 100644 trunk/paradiseo-eo/contrib/boost/config/abi/CVS/Root create mode 100644 trunk/paradiseo-eo/contrib/boost/config/abi_prefix.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/abi_suffix.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/auto_link.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/compiler/CVS/Entries create mode 100644 trunk/paradiseo-eo/contrib/boost/config/compiler/CVS/Repository create mode 100644 trunk/paradiseo-eo/contrib/boost/config/compiler/CVS/Root create mode 100644 trunk/paradiseo-eo/contrib/boost/config/compiler/borland.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/compiler/comeau.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/compiler/common_edg.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/compiler/compaq_cxx.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/compiler/digitalmars.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/compiler/gcc.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/compiler/greenhills.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/compiler/hp_acc.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/compiler/intel.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/compiler/kai.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/compiler/metrowerks.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/compiler/mpw.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/compiler/sgi_mipspro.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/compiler/sunpro_cc.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/compiler/vacpp.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/compiler/visualc.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/platform/CVS/Entries create mode 100644 trunk/paradiseo-eo/contrib/boost/config/platform/CVS/Repository create mode 100644 trunk/paradiseo-eo/contrib/boost/config/platform/CVS/Root create mode 100644 trunk/paradiseo-eo/contrib/boost/config/platform/aix.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/platform/amigaos.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/platform/beos.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/platform/bsd.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/platform/cygwin.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/platform/hpux.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/platform/irix.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/platform/linux.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/platform/macos.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/platform/solaris.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/platform/win32.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/posix_features.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/requires_threads.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/select_compiler_config.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/select_platform_config.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/select_stdlib_config.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/stdlib/CVS/Entries create mode 100644 trunk/paradiseo-eo/contrib/boost/config/stdlib/CVS/Repository create mode 100644 trunk/paradiseo-eo/contrib/boost/config/stdlib/CVS/Root create mode 100644 trunk/paradiseo-eo/contrib/boost/config/stdlib/dinkumware.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/stdlib/libcomo.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/stdlib/libstdcpp3.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/stdlib/modena.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/stdlib/msl.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/stdlib/roguewave.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/stdlib/sgi.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/stdlib/stlport.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/stdlib/vacpp.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/suffix.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/config/user.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/limits.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/CVS/Entries create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/CVS/Entries.Log create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/CVS/Repository create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/CVS/Root create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/CVS/Entries create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/CVS/Entries.Log create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/CVS/Repository create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/CVS/Root create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/arith.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/arith2.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/arith3.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/checking.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/compare.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/CVS/Entries create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/CVS/Repository create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/CVS/Root create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/certain.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/explicit.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/lexicographic.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/possible.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/set.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/tribool.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/constants.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/CVS/Entries create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/CVS/Repository create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/CVS/Root create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/bcc_rounding_control.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/bugs.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/c99_rounding_control.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/c99sub_rounding_control.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/division.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/interval_prototype.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/msvc_rounding_control.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/ppc_rounding_control.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/sparc_rounding_control.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/test_input.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/x86_rounding_control.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/x86gcc_rounding_control.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/ext/CVS/Entries create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/ext/CVS/Repository create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/ext/CVS/Root create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/ext/integer.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/ext/x86_fast_rounding_control.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/hw_rounding.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/interval.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/io.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/limits.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/policies.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/rounded_arith.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/rounded_transc.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/rounding.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/transc.hpp create mode 100644 trunk/paradiseo-eo/contrib/boost/numeric/interval/utility.hpp create mode 100644 trunk/paradiseo-eo/contrib/eoAged.h create mode 100644 trunk/paradiseo-eo/contrib/eoDrawable.h create mode 100644 trunk/paradiseo-eo/contrib/mathsym/COPYING create mode 100644 trunk/paradiseo-eo/contrib/mathsym/CVS/Entries create mode 100644 trunk/paradiseo-eo/contrib/mathsym/CVS/Entries.Log create mode 100644 trunk/paradiseo-eo/contrib/mathsym/CVS/Repository create mode 100644 trunk/paradiseo-eo/contrib/mathsym/CVS/Root create mode 100644 trunk/paradiseo-eo/contrib/mathsym/GNUmakefile create mode 100644 trunk/paradiseo-eo/contrib/mathsym/README create mode 100644 trunk/paradiseo-eo/contrib/mathsym/README.TCC create mode 100644 trunk/paradiseo-eo/contrib/mathsym/eo_interface/CVS/Entries create mode 100644 trunk/paradiseo-eo/contrib/mathsym/eo_interface/CVS/Repository create mode 100644 trunk/paradiseo-eo/contrib/mathsym/eo_interface/CVS/Root create mode 100644 trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSym.h create mode 100644 trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymCrossover.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymCrossover.h create mode 100644 trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymEval.h create mode 100644 trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymInit.h create mode 100644 trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymLambdaMutate.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymLambdaMutate.h create mode 100644 trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymMutate.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymMutate.h create mode 100644 trunk/paradiseo-eo/contrib/mathsym/eval/BoundsCheck.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/eval/BoundsCheck.h create mode 100644 trunk/paradiseo-eo/contrib/mathsym/eval/CVS/Entries create mode 100644 trunk/paradiseo-eo/contrib/mathsym/eval/CVS/Repository create mode 100644 trunk/paradiseo-eo/contrib/mathsym/eval/CVS/Root create mode 100644 trunk/paradiseo-eo/contrib/mathsym/eval/Interval.h create mode 100644 trunk/paradiseo-eo/contrib/mathsym/eval/MultiFuncs.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/eval/MultiFunction.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/eval/MultiFunction.h create mode 100644 trunk/paradiseo-eo/contrib/mathsym/eval/c_compile.c create mode 100644 trunk/paradiseo-eo/contrib/mathsym/eval/sym_compile.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/eval/sym_compile.h create mode 100644 trunk/paradiseo-eo/contrib/mathsym/fun/CVS/Entries create mode 100644 trunk/paradiseo-eo/contrib/mathsym/fun/CVS/Repository create mode 100644 trunk/paradiseo-eo/contrib/mathsym/fun/CVS/Root create mode 100644 trunk/paradiseo-eo/contrib/mathsym/fun/FunDef.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/fun/FunDef.h create mode 100644 trunk/paradiseo-eo/contrib/mathsym/fun/SymOps.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/fun/SymOps.h create mode 100644 trunk/paradiseo-eo/contrib/mathsym/fun/sym_operations.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/fun/util.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/gen/CVS/Entries create mode 100644 trunk/paradiseo-eo/contrib/mathsym/gen/CVS/Repository create mode 100644 trunk/paradiseo-eo/contrib/mathsym/gen/CVS/Root create mode 100644 trunk/paradiseo-eo/contrib/mathsym/gen/LanguageTable.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/gen/LanguageTable.h create mode 100644 trunk/paradiseo-eo/contrib/mathsym/gen/NodeSelector.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/gen/NodeSelector.h create mode 100644 trunk/paradiseo-eo/contrib/mathsym/gen/TreeBuilder.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/gen/TreeBuilder.h create mode 100644 trunk/paradiseo-eo/contrib/mathsym/header create mode 100644 trunk/paradiseo-eo/contrib/mathsym/regression/CVS/Entries create mode 100644 trunk/paradiseo-eo/contrib/mathsym/regression/CVS/Repository create mode 100644 trunk/paradiseo-eo/contrib/mathsym/regression/CVS/Root create mode 100644 trunk/paradiseo-eo/contrib/mathsym/regression/Dataset.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/regression/Dataset.h create mode 100644 trunk/paradiseo-eo/contrib/mathsym/regression/ErrorMeasure.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/regression/ErrorMeasure.h create mode 100644 trunk/paradiseo-eo/contrib/mathsym/regression/Scaling.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/regression/Scaling.h create mode 100644 trunk/paradiseo-eo/contrib/mathsym/regression/TargetInfo.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/regression/TargetInfo.h create mode 100644 trunk/paradiseo-eo/contrib/mathsym/regression/stats.h create mode 100644 trunk/paradiseo-eo/contrib/mathsym/shared_ptr.h create mode 100644 trunk/paradiseo-eo/contrib/mathsym/sym/CVS/Entries create mode 100644 trunk/paradiseo-eo/contrib/mathsym/sym/CVS/Repository create mode 100644 trunk/paradiseo-eo/contrib/mathsym/sym/CVS/Root create mode 100644 trunk/paradiseo-eo/contrib/mathsym/sym/README.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/sym/Sym.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/sym/Sym.h create mode 100644 trunk/paradiseo-eo/contrib/mathsym/sym/SymImpl.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/sym/SymImpl.h create mode 100644 trunk/paradiseo-eo/contrib/mathsym/sym/token.h create mode 100644 trunk/paradiseo-eo/contrib/mathsym/symreg.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/tcc.tar.gz create mode 100644 trunk/paradiseo-eo/contrib/mathsym/test/CVS/Entries create mode 100644 trunk/paradiseo-eo/contrib/mathsym/test/CVS/Repository create mode 100644 trunk/paradiseo-eo/contrib/mathsym/test/CVS/Root create mode 100644 trunk/paradiseo-eo/contrib/mathsym/test/test_compile.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/test/test_diff.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/test/test_lambda.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/test/test_mf.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/test/test_simplify.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/test/testeo.cpp create mode 100644 trunk/paradiseo-eo/contrib/mathsym/test_data.txt create mode 100644 trunk/paradiseo-eo/doc/.cvsignore create mode 100644 trunk/paradiseo-eo/doc/CVS/Entries create mode 100644 trunk/paradiseo-eo/doc/CVS/Repository create mode 100644 trunk/paradiseo-eo/doc/CVS/Root create mode 100644 trunk/paradiseo-eo/doc/EO_EA2001.pdf create mode 100644 trunk/paradiseo-eo/doc/LeCreusot.pdf create mode 100644 trunk/paradiseo-eo/doc/Makefile.am create mode 100644 trunk/paradiseo-eo/doc/eo.cfg create mode 100644 trunk/paradiseo-eo/doc/eo.doxytag create mode 100644 trunk/paradiseo-eo/doc/html/_bit_e_a_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_bounds_check_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_bounds_check_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_c_m_a_params_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_c_m_a_params_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_c_m_a_state_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_c_m_a_state_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_dataset_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_dataset_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_e_o_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_e_s_e_a_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_error_measure_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_error_measure_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_first_bit_e_a_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_first_bit_g_a_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_first_real_e_a_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_first_real_g_a_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_fun_def_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_fun_def_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_interval_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_language_table_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_language_table_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_multi_funcs_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_multi_function_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_multi_function_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_my_struct_e_a_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_my_struct_lib_e_a_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_my_struct_s_e_a_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_n_e_w_s-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_node_selector_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_node_selector_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_one_max_e_a_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_one_max_lib_e_a_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_py_e_o_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_py_e_o_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_r_e_a_d_m_e-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_r_e_a_d_m_e_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_real_e_a_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_royal_road_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_scaling_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_scaling_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_second_bit_e_a_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_second_real_e_a_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_sym_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_sym_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_sym_impl_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_sym_impl_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_sym_ops_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_sym_ops_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_target_info_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_target_info_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_tree_builder_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_tree_builder_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/_virus_op_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/abstract1_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/algos_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/annotated.html create mode 100644 trunk/paradiseo-eo/doc/html/apply_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/breeders_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/class_biased_node_selector-members.html create mode 100644 trunk/paradiseo-eo/doc/html/class_biased_node_selector.html create mode 100644 trunk/paradiseo-eo/doc/html/class_biased_node_selector.png create mode 100644 trunk/paradiseo-eo/doc/html/class_cov-members.html create mode 100644 trunk/paradiseo-eo/doc/html/class_cov.html create mode 100644 trunk/paradiseo-eo/doc/html/class_e_o-members.html create mode 100644 trunk/paradiseo-eo/doc/html/class_e_o.html create mode 100644 trunk/paradiseo-eo/doc/html/class_e_o.png create mode 100644 trunk/paradiseo-eo/doc/html/class_mem_pool-members.html create mode 100644 trunk/paradiseo-eo/doc/html/class_mem_pool.html create mode 100644 trunk/paradiseo-eo/doc/html/class_minimizing_traits-members.html create mode 100644 trunk/paradiseo-eo/doc/html/class_minimizing_traits.html create mode 100644 trunk/paradiseo-eo/doc/html/class_minimizing_traits.png create mode 100644 trunk/paradiseo-eo/doc/html/class_node_selector-members.html create mode 100644 trunk/paradiseo-eo/doc/html/class_node_selector.html create mode 100644 trunk/paradiseo-eo/doc/html/class_node_selector.png create mode 100644 trunk/paradiseo-eo/doc/html/class_random_node_selector-members.html create mode 100644 trunk/paradiseo-eo/doc/html/class_random_node_selector.html create mode 100644 trunk/paradiseo-eo/doc/html/class_random_node_selector.png create mode 100644 trunk/paradiseo-eo/doc/html/class_u_f__random__generator-members.html create mode 100644 trunk/paradiseo-eo/doc/html/class_u_f__random__generator.html create mode 100644 trunk/paradiseo-eo/doc/html/class_virus_bit_flip-members.html create mode 100644 trunk/paradiseo-eo/doc/html/class_virus_bit_flip.html create mode 100644 trunk/paradiseo-eo/doc/html/class_virus_bit_flip.png create mode 100644 trunk/paradiseo-eo/doc/html/class_virus_shift_mutation-members.html create mode 100644 trunk/paradiseo-eo/doc/html/class_virus_shift_mutation.html create mode 100644 trunk/paradiseo-eo/doc/html/class_virus_shift_mutation.png create mode 100644 trunk/paradiseo-eo/doc/html/classboolean__generator-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classboolean__generator.html create mode 100644 trunk/paradiseo-eo/doc/html/classd_matrix-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classd_matrix.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo1_pt_bit_crossover.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_aged-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_aged.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_algo-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_algo.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_algo.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_arithmetic_crossover.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_assembled_fitness_average_stat-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_assembled_fitness_average_stat.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_assembled_fitness_average_stat.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_assembled_fitness_best_stat-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_assembled_fitness_best_stat.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_assembled_fitness_best_stat.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_atom_exchange-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_atom_exchange.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_atom_exchange.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_average_stat-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_average_stat.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_average_stat.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_b_f-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_b_f.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_b_f.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_best_fitness_stat-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_best_fitness_stat.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_best_fitness_stat.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_best_select-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_best_select.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_best_select.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bin_clone_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bin_clone_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bin_clone_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bin_gen_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bin_gen_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bin_gen_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bin_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bin_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bin_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_binary_functor_counter-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_binary_functor_counter.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_binary_functor_counter.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bit-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bit.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bit.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bit_bit_flip.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bit_gx_over-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bit_gx_over.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bit_gx_over.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bit_inversion-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bit_inversion.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bit_inversion.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bit_mutation-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bit_mutation.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bit_mutation.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bit_next-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bit_next.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bit_next.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bit_op_factory-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bit_op_factory.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bit_op_factory.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bit_prev-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bit_prev.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bit_prev.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bool_flip-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bool_flip.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_bool_flip.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_boolean_generator-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_boolean_generator.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_boolean_generator.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_boolean_init-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_boolean_init.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_boolean_init.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_branch_mutation-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_branch_mutation.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_branch_mutation.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_breed-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_breed.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_breed.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_c_m_a_breed-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_c_m_a_breed.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_c_m_a_breed.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_c_m_a_init-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_c_m_a_init.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_c_m_a_init.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_cellular_easy_e_a-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_cellular_easy_e_a.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_cellular_easy_e_a.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_check_point-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_check_point.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_check_point.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_collapse_subtree_mutation-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_collapse_subtree_mutation.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_collapse_subtree_mutation.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_combined_continue-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_combined_continue.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_combined_continue.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_combined_init-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_combined_init.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_combined_init.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_comma_replacement-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_comma_replacement.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_comma_replacement.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_continue-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_continue.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_continue.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_counted_dyn_update-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_counted_dyn_update.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_counted_dyn_update.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_counted_state_saver-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_counted_state_saver.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_counted_state_saver.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_ctrl_c_continue-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_ctrl_c_continue.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_ctrl_c_continue.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_det_bit_flip-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_det_bit_flip.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_det_bit_flip.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_det_select-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_det_select.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_det_select.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_det_tournament_select-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_det_tournament_select.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_det_tournament_select.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_det_tournament_truncate-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_det_tournament_truncate.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_det_tournament_truncate.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_det_tournament_truncate_split-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_det_tournament_truncate_split.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_det_tournament_truncate_split.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_det_tournament_worth_select-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_det_tournament_worth_select.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_det_tournament_worth_select.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_det_uniform_mutation-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_det_uniform_mutation.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_det_uniform_mutation.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_deterministic_sa_d_replacement-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_deterministic_sa_d_replacement.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_deterministic_sa_d_replacement.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_deterministic_survive_and_die-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_deterministic_survive_and_die.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_deterministic_survive_and_die.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_distance-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_distance.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_distance.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_distrib_updater-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_distrib_updater.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_distrib_updater.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_distribution-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_distribution.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_distribution.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_dominance_map-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_dominance_map.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_dominance_map.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_double_exchange-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_double_exchange.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_double_exchange.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_double_intermediate-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_double_intermediate.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_double_intermediate.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_drawable-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_drawable.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_dyn_s_g_a_transform-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_dyn_s_g_a_transform.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_dyn_s_g_a_transform.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_dyn_updater-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_dyn_updater.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_dyn_updater.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_e_d_a-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_e_d_a.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_e_d_a.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_e_p_reduce-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_e_p_reduce.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_e_p_reduce.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_e_p_replacement-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_e_p_replacement.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_e_p_replacement.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_easy_e_a-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_easy_e_a.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_easy_e_a.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_elite_sequential_select-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_elite_sequential_select.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_elite_sequential_select.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_elitism-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_elitism.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_elitism.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_es_chrom_init-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_es_chrom_init.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_es_chrom_init.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_es_full-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_es_full.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_es_full.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_es_global_xover-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_es_global_xover.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_es_global_xover.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_es_mutate-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_es_mutate.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_es_mutate.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_es_mutation_init-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_es_mutation_init.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_es_simple-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_es_simple.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_es_simple.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_es_standard_xover-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_es_standard_xover.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_es_standard_xover.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_es_stdev-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_es_stdev.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_es_stdev.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_eval_continue-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_eval_continue.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_eval_continue.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_eval_func-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_eval_func.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_eval_func.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_eval_func_counter-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_eval_func_counter.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_eval_func_counter.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_expansion_mutation-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_expansion_mutation.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_expansion_mutation.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_external_bin_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_external_bin_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_external_bin_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_external_e_o-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_external_e_o.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_external_e_o.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_external_eval_func-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_external_eval_func.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_external_eval_func.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_external_init-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_external_init.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_external_init.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_external_mon_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_external_mon_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_external_mon_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_external_quad_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_external_quad_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_external_quad_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_f-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_f.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_f.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_f_d_c_file_snapshot-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_f_d_c_file_snapshot.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_f_d_c_file_snapshot.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_f_d_c_stat-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_f_d_c_stat.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_f_d_c_stat.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_factory-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_factory.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_factory.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_file_monitor-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_file_monitor.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_file_monitor.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_file_snapshot-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_file_snapshot.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_file_snapshot.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fit_continue-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fit_continue.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fit_continue.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fitness_scaling_select-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fitness_scaling_select.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fitness_scaling_select.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fitness_stat-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fitness_stat.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fitness_stat.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or1pt_bin_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or1pt_bin_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or1pt_bin_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or1pt_quad_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or1pt_quad_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or1pt_quad_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or_all_atom_bin_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or_all_atom_bin_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or_all_atom_bin_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or_all_atom_quad_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or_all_atom_quad_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or_all_atom_quad_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or_all_mutation-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or_all_mutation.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or_all_mutation.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or_k_atom_bin_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or_k_atom_bin_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or_k_atom_bin_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or_k_atom_quad_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or_k_atom_quad_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or_k_atom_quad_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or_k_mutation-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or_k_mutation.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or_k_mutation.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or_uniform_bin_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or_uniform_bin_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or_uniform_bin_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or_uniform_quad_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or_uniform_quad_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_fl_or_uniform_quad_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_functor_base-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_functor_base.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_functor_base.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_functor_store-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_functor_store.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_functor_store.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_g3_replacement-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_g3_replacement.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_g3_replacement.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_gen_continue-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_gen_continue.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_gen_continue.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_gen_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_gen_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_gen_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_gene_del_chooser-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_gene_del_chooser.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_gene_del_chooser.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_general_breeder-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_general_breeder.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_general_breeder.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_general_int_bounds-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_general_int_bounds.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_general_int_bounds.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_general_real_bounds-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_general_real_bounds.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_general_real_bounds.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_generational_replacement-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_generational_replacement.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_generational_replacement.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_gnuplot-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_gnuplot.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_gnuplot.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_gnuplot1_d_monitor-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_gnuplot1_d_monitor.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_gnuplot1_d_monitor.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_gnuplot1_d_snapshot-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_gnuplot1_d_snapshot.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_gnuplot1_d_snapshot.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_hamming_distance-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_hamming_distance.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_hamming_distance.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_hoist_mutation-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_hoist_mutation.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_hoist_mutation.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_how_many-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_how_many.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_how_many.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_incrementor-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_incrementor.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_incrementor.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_incrementor_param-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_incrementor_param.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_incrementor_param.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_init-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_init.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_init.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_init_adaptor-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_init_adaptor.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_init_adaptor.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_init_fixed_length-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_init_fixed_length.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_init_fixed_length.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_init_generator-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_init_generator.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_init_generator.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_init_variable_length-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_init_variable_length.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_init_variable_length.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_init_virus-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_init_virus.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_init_virus.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_init_virus1bit-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_init_virus1bit.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_init_virus1bit.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_inner_exchange_quad_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_inner_exchange_quad_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_inner_exchange_quad_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_int_above_bound-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_int_above_bound.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_int_above_bound.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_int_below_bound-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_int_below_bound.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_int_below_bound.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_int_bounds-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_int_bounds.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_int_bounds.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_int_interval-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_int_interval.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_int_interval.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_int_no_bounds-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_int_no_bounds.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_int_no_bounds.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_invalidate_bin_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_invalidate_bin_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_invalidate_bin_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_invalidate_mon_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_invalidate_mon_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_invalidate_mon_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_invalidate_quad_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_invalidate_quad_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_invalidate_quad_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_linear_fit_scaling-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_linear_fit_scaling.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_linear_fit_scaling.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_linear_random_split-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_linear_random_split.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_linear_random_split.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_linear_truncate-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_linear_truncate.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_linear_truncate.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_linear_truncate_split-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_linear_truncate_split.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_linear_truncate_split.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_m_g_g_replacement-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_m_g_g_replacement.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_m_g_g_replacement.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_m_o_fitness_stat-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_m_o_fitness_stat.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_m_o_fitness_stat.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_merge-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_merge.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_merge.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_merge_reduce-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_merge_reduce.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_merge_reduce.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_mon_clone_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_mon_clone_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_mon_clone_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_mon_gen_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_mon_gen_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_mon_gen_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_mon_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_mon_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_mon_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_monitor-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_monitor.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_monitor.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_n_d_plus_replacement-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_n_d_plus_replacement.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_n_d_plus_replacement.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_n_d_sorting-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_n_d_sorting.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_n_d_sorting.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_n_d_sorting_1_1_dummy_e_o-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_n_d_sorting_1_1_dummy_e_o.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_n_d_sorting_1_1_dummy_e_o.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_n_d_sorting___i-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_n_d_sorting___i.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_n_d_sorting___i.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_n_d_sorting___i_i-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_n_d_sorting___i_i.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_n_d_sorting___i_i.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_n_pts_bit_xover-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_n_pts_bit_xover.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_n_pts_bit_xover.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_neg_exp_generator-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_neg_exp_generator.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_neg_exp_generator.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_neg_exp_init-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_neg_exp_init.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_neg_exp_init.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_no_elitism-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_no_elitism.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_no_elitism.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_no_perf2_worth-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_no_perf2_worth.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_no_perf2_worth.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_no_select-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_no_select.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_no_select.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_normal_generator-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_normal_generator.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_normal_generator.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_normal_init-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_normal_init.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_normal_init.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_normal_mutation-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_normal_mutation.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_normal_mutation.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_normal_vec_mutation-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_normal_vec_mutation.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_normal_vec_mutation.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_nth_element_fitness_stat-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_nth_element_fitness_stat.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_nth_element_fitness_stat.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_object-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_object.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_object.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_one_fifth_mutation-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_one_fifth_mutation.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_one_fifth_mutation.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_one_max-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_one_max.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_one_max.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_one_max_eval_func-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_one_max_eval_func.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_one_max_eval_func.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_one_max_init-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_one_max_init.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_one_max_init.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_one_max_mutation-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_one_max_mutation.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_one_max_mutation.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_one_max_quad_crossover-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_one_max_quad_crossover.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_one_max_quad_crossover.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_op_container-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_op_container.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_op_container.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_op_sel_mason-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_op_sel_mason.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_op_sel_mason.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_additive-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_additive.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_additive.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_distrib-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_distrib.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_distrib.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_org-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_org.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_org.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_param-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_param.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_param.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_param_param_type-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_param_param_type.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_parameter_loader-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_parameter_loader.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_parameter_loader.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_pareto_fitness-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_pareto_fitness.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_pareto_fitness_traits-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_pareto_fitness_traits.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_pareto_fitness_traits.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_pareto_one_constraint_fitness-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_pareto_one_constraint_fitness.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_pareto_ranking-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_pareto_ranking.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_pareto_ranking.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_parse_tree-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_parse_tree.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_parse_tree.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_parse_tree_depth_init-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_parse_tree_depth_init.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_parse_tree_depth_init.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_parser-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_parser.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_parser.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_perf2_worth-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_perf2_worth.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_perf2_worth.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_perf2_worth_1_1compare__worth-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_perf2_worth_1_1compare__worth.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_perf2_worth_cached-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_perf2_worth_cached.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_perf2_worth_cached.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_perf2_worth_cached_1_1compare__worth-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_perf2_worth_cached_1_1compare__worth.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_persistent-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_persistent.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_persistent.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_plus-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_plus.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_plus.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_plus_replacement-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_plus_replacement.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_plus_replacement.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_point_mutation-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_point_mutation.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_point_mutation.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_pop-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_pop.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_pop.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_pop_algo-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_pop_algo.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_pop_algo.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_pop_eval_func-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_pop_eval_func.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_pop_eval_func.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_pop_loop_eval-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_pop_loop_eval.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_pop_loop_eval.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_pop_stat-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_pop_stat.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_pop_stat.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_populator-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_populator.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_populator.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_printable-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_printable.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_printable.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_procedure_counter-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_procedure_counter.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_procedure_counter.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_prop_combined_bin_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_prop_combined_bin_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_prop_combined_bin_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_prop_combined_mon_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_prop_combined_mon_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_prop_combined_mon_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_prop_combined_quad_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_prop_combined_quad_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_prop_combined_quad_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_prop_g_a_gen_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_prop_g_a_gen_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_prop_g_a_gen_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_proportional_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_proportional_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_proportional_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_proportional_select-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_proportional_select.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_proportional_select.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_quad2_bin_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_quad2_bin_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_quad2_bin_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_quad_clone_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_quad_clone_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_quad_clone_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_quad_distance-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_quad_distance.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_quad_distance.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_quad_gen_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_quad_gen_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_quad_gen_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_quad_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_quad_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_quad_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_random_reduce-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_random_reduce.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_random_reduce.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_random_select-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_random_select.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_random_select.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_random_split-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_random_split.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_random_split.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_ranking-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_ranking.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_ranking.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_ranking_select-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_ranking_select.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_ranking_select.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_above_bound-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_above_bound.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_above_bound.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_base_vector_bounds-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_base_vector_bounds.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_base_vector_bounds.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_below_bound-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_below_bound.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_below_bound.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_bounds-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_bounds.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_bounds.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_init_bounded-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_init_bounded.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_init_bounded.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_interval-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_interval.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_interval.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_no_bounds-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_no_bounds.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_no_bounds.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_ux_over.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_vector_bounds-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_vector_bounds.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_vector_bounds.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_vector_no_bounds-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_vector_no_bounds.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_real_vector_no_bounds.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_reduce-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_reduce.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_reduce.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_reduce_merge-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_reduce_merge.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_reduce_merge.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_reduce_merge_reduce-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_reduce_merge_reduce.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_reduce_merge_reduce.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_reduce_split-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_reduce_split.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_reduce_split.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_replacement-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_replacement.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_replacement.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_rnd_generator-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_rnd_generator.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_rnd_generator.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_rng-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_rng.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_rng.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_roulette_worth_select-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_roulette_worth_select.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_roulette_worth_select.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_s_g_a-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_s_g_a.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_s_g_a.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_s_g_a_gen_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_s_g_a_gen_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_s_g_a_gen_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_s_g_a_transform-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_s_g_a_transform.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_s_g_a_transform.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_s_s_g_a_det_tournament_replacement-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_s_s_g_a_det_tournament_replacement.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_s_s_g_a_det_tournament_replacement.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_s_s_g_a_stoch_tournament_replacement-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_s_s_g_a_stoch_tournament_replacement.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_s_s_g_a_stoch_tournament_replacement.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_s_s_g_a_worse_replacement-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_s_s_g_a_worse_replacement.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_s_s_g_a_worse_replacement.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_s_t_l_b_f-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_s_t_l_b_f.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_s_t_l_f-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_s_t_l_f.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_s_t_l_u_f-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_s_t_l_u_f.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_scalar_fitness-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_scalar_fitness.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_scalar_fitness_assembled-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_scalar_fitness_assembled.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_scalar_fitness_assembled_traits-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_scalar_fitness_assembled_traits.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_scalar_fitness_stat-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_scalar_fitness_stat.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_scalar_fitness_stat.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_second_moment_stats-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_second_moment_stats.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_second_moment_stats.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_segment_crossover-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_segment_crossover.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_segment_crossover.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_sel_bin_gen_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_sel_bin_gen_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_sel_bin_gen_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_select-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_select.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_select.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_select_factory-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_select_factory.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_select_factory.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_select_from_worth-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_select_from_worth.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_select_from_worth.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_select_many-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_select_many.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_select_many.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_select_number-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_select_number.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_select_number.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_select_one-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_select_one.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_select_one.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_select_perc-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_select_perc.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_select_perc.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_select_transform-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_select_transform.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_select_transform.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_selective_populator-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_selective_populator.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_selective_populator.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_seq_populator-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_seq_populator.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_seq_populator.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_sequential_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_sequential_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_sequential_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_sequential_select-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_sequential_select.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_sequential_select.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_sharing-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_sharing.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_sharing.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_sharing_select-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_sharing_select.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_sharing_select.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_simple_e_d_a-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_simple_e_d_a.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_simple_e_d_a.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_sorted_pop_stat-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_sorted_pop_stat.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_sorted_pop_stat.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_sorted_stat-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_sorted_stat.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_sorted_stat.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_sorted_stat_base-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_sorted_stat_base.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_sorted_stat_base.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_st_branch_mutation-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_st_branch_mutation.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_st_branch_mutation.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_st_hoist_mutation-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_st_hoist_mutation.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_st_hoist_mutation.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_st_parse_tree_depth_init-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_st_parse_tree_depth_init.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_st_parse_tree_depth_init.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_st_point_mutation-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_st_point_mutation.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_st_point_mutation.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_st_subtree_x_over-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_st_subtree_x_over.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_st_subtree_x_over.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_stat-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_stat.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_stat.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_stat_base-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_stat_base.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_stat_base.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_state-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_state.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_state.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_stdout_monitor-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_stdout_monitor.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_stdout_monitor.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_steady_fit_continue-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_steady_fit_continue.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_steady_fit_continue.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_select-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_select.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_select.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_truncate-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_truncate.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_truncate.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_truncate_split-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_truncate_split.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_truncate_split.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_worth_select-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_worth_select.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_worth_select.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_stochastic_universal_select-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_stochastic_universal_select.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_stochastic_universal_select.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_string-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_string.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_string.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_subtree_x_over-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_subtree_x_over.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_subtree_x_over.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_survive_and_die-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_survive_and_die.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_survive_and_die.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_sym_init-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_sym_init.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_sym_init.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_time_counter-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_time_counter.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_time_counter.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_time_varying_loop_eval-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_time_varying_loop_eval.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_time_varying_loop_eval.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_timed_dyn_update-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_timed_dyn_update.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_timed_dyn_update.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_timed_monitor-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_timed_monitor.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_timed_monitor.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_timed_state_saver-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_timed_state_saver.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_timed_state_saver.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_transform-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_transform.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_transform.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_trunc_select-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_trunc_select.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_trunc_select.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_truncate-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_truncate.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_truncate.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_truncate_split-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_truncate_split.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_truncate_split.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_truncated_select_many-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_truncated_select_many.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_truncated_select_many.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_truncated_select_one-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_truncated_select_one.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_truncated_select_one.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_u_bit_xover-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_u_bit_xover.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_u_bit_xover.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_u_f-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_u_f.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_u_f.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_unary_functor_counter-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_unary_functor_counter.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_unary_functor_counter.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_uniform_atom_exchange-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_uniform_atom_exchange.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_uniform_atom_exchange.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_uniform_gene_chooser-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_uniform_gene_chooser.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_uniform_gene_chooser.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_uniform_generator-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_uniform_generator.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_uniform_generator.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_uniform_init-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_uniform_init.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_uniform_init.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_uniform_mutation-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_uniform_mutation.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_uniform_mutation.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_updatable-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_updatable.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_updatable.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_updater-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_updater.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_updater.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_value_param-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_value_param.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_value_param.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_variable_pareto_traits-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_variable_pareto_traits.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_variable_pareto_traits.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_vector-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_vector.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_vector.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_vl_add_mutation-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_vl_add_mutation.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_vl_add_mutation.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_vl_atom_exchange_quad_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_vl_atom_exchange_quad_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_vl_atom_exchange_quad_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_vl_del_mutation-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_vl_del_mutation.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_vl_del_mutation.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_vl_uniform_bin_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_vl_uniform_bin_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_vl_uniform_bin_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_vl_uniform_quad_op-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_vl_uniform_quad_op.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_vl_uniform_quad_op.png create mode 100644 trunk/paradiseo-eo/doc/html/classeo_weak_elitist_replacement-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_weak_elitist_replacement.html create mode 100644 trunk/paradiseo-eo/doc/html/classeo_weak_elitist_replacement.png create mode 100644 trunk/paradiseo-eo/doc/html/classes.html create mode 100644 trunk/paradiseo-eo/doc/html/classgp__parse__tree_1_1_mem_pool-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classgp__parse__tree_1_1_mem_pool.html create mode 100644 trunk/paradiseo-eo/doc/html/classnegexp__generator-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classnegexp__generator.html create mode 100644 trunk/paradiseo-eo/doc/html/classnormal__generator-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classnormal__generator.html create mode 100644 trunk/paradiseo-eo/doc/html/classrandom__generator-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classrandom__generator.html create mode 100644 trunk/paradiseo-eo/doc/html/classuniform__generator-members.html create mode 100644 trunk/paradiseo-eo/doc/html/classuniform__generator.html create mode 100644 trunk/paradiseo-eo/doc/html/compatibility_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/continuators_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/contrib_2mathsym_2_r_e_a_d_m_e-source.html create mode 100644 trunk/paradiseo-eo/doc/html/def__abstract__functor_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000000.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000001.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000002.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000003.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000004.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000005.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000006.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000007.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000008.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000009.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000010.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000011.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000012.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000013.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000014.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000015.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000016.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000017.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000018.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000019.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000020.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000021.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000022.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000023.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000024.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000025.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000026.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000027.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000028.html create mode 100644 trunk/paradiseo-eo/doc/html/dir_000029.html create mode 100644 trunk/paradiseo-eo/doc/html/doxygen.css create mode 100644 trunk/paradiseo-eo/doc/html/doxygen.png create mode 100644 trunk/paradiseo-eo/doc/html/eig_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eig_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_aged_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_algo_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_assembled_fitness_stat_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_bit_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_bit_op_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_bit_op_factory_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_bool_flip_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_breed_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_c_m_a_breed_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_c_m_a_init_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_cellular_easy_e_a_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_check_point_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_clone_ops_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_combined_continue_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_combined_init_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_continue_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_counter_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_ctrl_c_continue_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_ctrl_c_continue_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_data_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_data_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_det_select_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_det_tournament_select_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_distance_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_distrib_updater_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_distribution_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_dominance_map_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_drawable_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_e_d_a_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_easy_e_a_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_es_chrom_init_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_es_full_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_es_global_xover_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_es_mutate_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_es_mutation_init_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_es_simple_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_es_standard_xover_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_es_stdev_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_eval_continue_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_eval_func_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_eval_func_counter_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_eval_func_ptr_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_external_e_o_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_external_op_functions_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_f_d_c_stat_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_factory_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_file_monitor_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_file_monitor_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_file_snapshot_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_fit_continue_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_fitness_scaling_select_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_fl_or_bin_op_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_fl_or_mon_op_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_fl_or_quad_op_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_functor_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_functor_store_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_functor_store_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_g3_replacement_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_gen_continue_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_gen_op_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_general_breeder_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_gnuplot1_d_monitor_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_gnuplot1_d_monitor_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_gnuplot1_d_snapshot_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_gnuplot1_d_snapshot_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_gnuplot_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_gnuplot_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_how_many_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_init_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_init_virus_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_int_bounds_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_int_bounds_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_invalidate_ops_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_linear_fit_scaling_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_m_g_g_replacement_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_m_o_fitness_stat_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_merge_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_merge_reduce_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_monitor_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_n_d_sorting_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_normal_mutation_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_object_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_one_max_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_one_max_eval_func_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_one_max_init_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_one_max_mutation_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_one_max_quad_crossover_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_one_to_one_breeder_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_op_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_op_container_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_op_sel_mason_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_p_b_i_l_additive_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_p_b_i_l_distrib_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_p_b_i_l_org_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_param_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_pareto_constraint_fitness_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_pareto_fitness_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_pareto_fitness_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_pareto_ranking_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_parse_tree_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_parse_tree_depth_init_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_parse_tree_op_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_parser_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_parser_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_perf2_worth_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_periodic_continue_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_persistent_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_persistent_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_pop_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_pop_algo_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_pop_eval_func_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_pop_stat_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_populator_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_printable_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_printable_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_prop_g_a_gen_op_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_proportional_combined_op_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_proportional_select_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_r_n_g_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_r_n_g_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_random_select_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_ranking_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_ranking_select_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_real_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_real_atom_xover_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_real_bounds_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_real_bounds_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_real_init_bounded_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_real_op_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_real_vector_bounds_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_reduce_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_reduce_merge_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_reduce_merge_reduce_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_reduce_split_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_replacement_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_rnd_generators_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_s_b_xcross_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_s_g_a_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_s_g_a_gen_op_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_s_g_a_transform_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_s_t_l_functor_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_scalar_fitness_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_scalar_fitness_assembled_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_scalar_fitness_assembled_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_scalar_fitness_stat_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_select_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_select_factory_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_select_from_worth_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_select_many_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_select_number_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_select_one_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_select_perc_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_sequential_select_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_sharing_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_sharing_select_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_simple_e_d_a_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_st_parse_tree_depth_init_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_st_parse_tree_op_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_stat_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_state_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_state_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_stdout_monitor_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_stdout_monitor_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_steady_fit_continue_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_stoch_tournament_select_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_stochastic_universal_select_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_string_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_survive_and_die_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_sym_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_sym_crossover_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_sym_crossover_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_sym_eval_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_sym_init_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_sym_lambda_mutate_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_sym_lambda_mutate_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_sym_mutate_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_sym_mutate_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_time_counter_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_timed_monitor_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_transform_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_trunc_select_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_truncated_select_many_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_truncated_select_one_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_uniform_init_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_updatable_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_updater_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_updater_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_variable_length_crossover_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_variable_length_mutation_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_vector_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/eo_virus_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/es_2make__op_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/es_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/exercise1_83_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/exercise2_83_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/exercise3_81_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/files.html create mode 100644 trunk/paradiseo-eo/doc/html/fitness_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/fitness__traits_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/ftv2blank.png create mode 100644 trunk/paradiseo-eo/doc/html/ftv2doc.png create mode 100644 trunk/paradiseo-eo/doc/html/ftv2folderclosed.png create mode 100644 trunk/paradiseo-eo/doc/html/ftv2folderopen.png create mode 100644 trunk/paradiseo-eo/doc/html/ftv2lastnode.png create mode 100644 trunk/paradiseo-eo/doc/html/ftv2link.png create mode 100644 trunk/paradiseo-eo/doc/html/ftv2mlastnode.png create mode 100644 trunk/paradiseo-eo/doc/html/ftv2mnode.png create mode 100644 trunk/paradiseo-eo/doc/html/ftv2node.png create mode 100644 trunk/paradiseo-eo/doc/html/ftv2plastnode.png create mode 100644 trunk/paradiseo-eo/doc/html/ftv2pnode.png create mode 100644 trunk/paradiseo-eo/doc/html/ftv2vertline.png create mode 100644 trunk/paradiseo-eo/doc/html/functions.html create mode 100644 trunk/paradiseo-eo/doc/html/functions_func.html create mode 100644 trunk/paradiseo-eo/doc/html/functions_type.html create mode 100644 trunk/paradiseo-eo/doc/html/functions_vars.html create mode 100644 trunk/paradiseo-eo/doc/html/ga_2make__op_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/ga_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/genetic_ops_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/gprop_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/gprop_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/group___evolution_strategies.html create mode 100644 trunk/paradiseo-eo/doc/html/group___operators.html create mode 100644 trunk/paradiseo-eo/doc/html/group___parse_tree.html create mode 100644 trunk/paradiseo-eo/doc/html/group___prop_combined_operators.html create mode 100644 trunk/paradiseo-eo/doc/html/group___st_parse_tree.html create mode 100644 trunk/paradiseo-eo/doc/html/group__bitstring.html create mode 100644 trunk/paradiseo-eo/doc/html/group__selectors.html create mode 100644 trunk/paradiseo-eo/doc/html/hierarchy.html create mode 100644 trunk/paradiseo-eo/doc/html/index.html create mode 100644 trunk/paradiseo-eo/doc/html/index_8h-source.html create mode 100755 trunk/paradiseo-eo/doc/html/installdox create mode 100644 trunk/paradiseo-eo/doc/html/l2_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/main.html create mode 100644 trunk/paradiseo-eo/doc/html/main_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make___my_struct_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make___one_max_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make___p_b_i_ldistrib_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make___p_b_i_lupdate_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__algo__easea_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__algo__pareto_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__algo__scalar_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__algo__scalar__es_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__algo__scalar__ga_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__algo__scalar__real_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__checkpoint_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__checkpoint___f_d_c_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__checkpoint__assembled_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__checkpoint__es_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__checkpoint__ga_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__checkpoint__pareto_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__checkpoint__real_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__continue_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__continue__es_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__continue__ga_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__continue__pareto_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__continue__real_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__es_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__ga_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__general__replacement_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__genotype___my_struct_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__genotype___one_max_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__genotype__es_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__genotype__ga_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__genotype__ga_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__genotype__real_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__genotype__real_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__help_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__op___my_struct_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__op___one_max_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__op__es_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__op__es_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__op__ga_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__op__real_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__op__real_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__pop_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__pop__es_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__pop__ga_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__pop__real_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__real_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__run_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__run__es_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__run__ga_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/make__run__real_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/mastermind_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/mastermind_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/matrices_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/mergers_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/mlp_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/modules.html create mode 100644 trunk/paradiseo-eo/doc/html/monitors_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/mse_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/namespacegp__parse__tree.html create mode 100644 trunk/paradiseo-eo/doc/html/namespacemembers.html create mode 100644 trunk/paradiseo-eo/doc/html/namespacemembers_func.html create mode 100644 trunk/paradiseo-eo/doc/html/namespaces.html create mode 100644 trunk/paradiseo-eo/doc/html/node_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/node__pool_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/pages.html create mode 100644 trunk/paradiseo-eo/doc/html/parameters_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/parse__tree_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/perf2worth_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/pickle_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/pipecom_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/pipecom_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/qp_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/random__numbers_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/reduce_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/related.html create mode 100644 trunk/paradiseo-eo/doc/html/replacement_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/rnd__generators_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/search.idx create mode 100644 trunk/paradiseo-eo/doc/html/search.php create mode 100644 trunk/paradiseo-eo/doc/html/select_one_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/selectors_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/selectors_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/shared__ptr_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/src_2pyeo_2_n_e_w_s-source.html create mode 100644 trunk/paradiseo-eo/doc/html/src_2pyeo_2_r_e_a_d_m_e-source.html create mode 100644 trunk/paradiseo-eo/doc/html/statistics_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/stats_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/struct_dummy-members.html create mode 100644 trunk/paradiseo-eo/doc/html/struct_dummy.html create mode 100644 trunk/paradiseo-eo/doc/html/struct_dummy.png create mode 100644 trunk/paradiseo-eo/doc/html/struct_t__pickle__suite-members.html create mode 100644 trunk/paradiseo-eo/doc/html/struct_t__pickle__suite.html create mode 100644 trunk/paradiseo-eo/doc/html/structeo_eval_func_ptr-members.html create mode 100644 trunk/paradiseo-eo/doc/html/structeo_eval_func_ptr.html create mode 100644 trunk/paradiseo-eo/doc/html/structeo_eval_func_ptr.png create mode 100644 trunk/paradiseo-eo/doc/html/structeo_functor_base_1_1binary__function__tag.html create mode 100644 trunk/paradiseo-eo/doc/html/structeo_functor_base_1_1procedure__tag.html create mode 100644 trunk/paradiseo-eo/doc/html/structeo_functor_base_1_1unary__function__tag.html create mode 100644 trunk/paradiseo-eo/doc/html/structeo_pop_1_1_cmp-members.html create mode 100644 trunk/paradiseo-eo/doc/html/structeo_pop_1_1_cmp.html create mode 100644 trunk/paradiseo-eo/doc/html/structeo_pop_1_1_ref-members.html create mode 100644 trunk/paradiseo-eo/doc/html/structeo_pop_1_1_ref.html create mode 100644 trunk/paradiseo-eo/doc/html/structeo_state_1_1loading__error-members.html create mode 100644 trunk/paradiseo-eo/doc/html/structeo_state_1_1loading__error.html create mode 100644 trunk/paradiseo-eo/doc/html/sym__compile_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/sym__compile_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/sym__operations_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/symreg_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-_m_g_e-control_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-_m_g_e1bit_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-_m_g_e_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_atom_ops_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_base_functions_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_c_m_a_e_s_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_checkpointing_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_e_s_all_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_e_s_full_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_e_s_ops_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_easy_e_a_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_external_e_o_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_fitness_assembled_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_fitness_assembled_e_a_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_functor_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_g_a_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_g_op_sel_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_gen_op_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_non_uniform_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_p_b_i_l_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_pareto_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_pareto_fitness_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_random_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_real_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_replacement_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_roulette_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_s_s_g_a_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_select_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_sharing_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_state_and_parser_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_symreg_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_uniform_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_vector_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eo_virus_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eobin_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eobreeder_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eofitness_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eogeneration_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eoinclusion_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eoinsertion_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eolottery_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-eoproblem_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/t-select_one_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/test_2binary__value_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/test_2real__value_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/test__compile_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/test__diff_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/test__lambda_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/test__mf_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/test__simplify_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/testeo_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/todo.html create mode 100644 trunk/paradiseo-eo/doc/html/token_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/tree.html create mode 100644 trunk/paradiseo-eo/doc/html/tutorial_2_lesson2_2binary__value_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/tutorial_2_lesson2_2real__value_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/tutorial_2_lesson3_2binary__value_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/tutorial_2_lesson3_2real__value_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/tutorial_2_lesson4_2binary__value_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/tutorial_2_lesson4_2real__value_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/tutorial_2_r_e_a_d_m_e-source.html create mode 100644 trunk/paradiseo-eo/doc/html/tutorial_2_templates_2_r_e_a_d_m_e-source.html create mode 100644 trunk/paradiseo-eo/doc/html/util_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/value_param_8cpp-source.html create mode 100644 trunk/paradiseo-eo/doc/html/value_param_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/vecop_8h-source.html create mode 100644 trunk/paradiseo-eo/doc/html/webpages.html create mode 100644 trunk/paradiseo-eo/doc/index.h create mode 100644 trunk/paradiseo-eo/doc/latex/Helvetica.ttf create mode 100644 trunk/paradiseo-eo/doc/latex/Makefile create mode 100644 trunk/paradiseo-eo/doc/latex/annotated.tex create mode 100644 trunk/paradiseo-eo/doc/latex/class_biased_node_selector.eps create mode 100644 trunk/paradiseo-eo/doc/latex/class_biased_node_selector.tex create mode 100644 trunk/paradiseo-eo/doc/latex/class_cov.tex create mode 100644 trunk/paradiseo-eo/doc/latex/class_e_o.eps create mode 100644 trunk/paradiseo-eo/doc/latex/class_e_o.tex create mode 100644 trunk/paradiseo-eo/doc/latex/class_mem_pool.tex create mode 100644 trunk/paradiseo-eo/doc/latex/class_minimizing_traits.eps create mode 100644 trunk/paradiseo-eo/doc/latex/class_minimizing_traits.tex create mode 100644 trunk/paradiseo-eo/doc/latex/class_node_selector.eps create mode 100644 trunk/paradiseo-eo/doc/latex/class_node_selector.tex create mode 100644 trunk/paradiseo-eo/doc/latex/class_random_node_selector.eps create mode 100644 trunk/paradiseo-eo/doc/latex/class_random_node_selector.tex create mode 100644 trunk/paradiseo-eo/doc/latex/class_u_f__random__generator.tex create mode 100644 trunk/paradiseo-eo/doc/latex/class_virus_bit_flip.eps create mode 100644 trunk/paradiseo-eo/doc/latex/class_virus_bit_flip.tex create mode 100644 trunk/paradiseo-eo/doc/latex/class_virus_shift_mutation.eps create mode 100644 trunk/paradiseo-eo/doc/latex/class_virus_shift_mutation.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classboolean__generator.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classd_matrix.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo1_pt_bit_crossover.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_aged.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_algo.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_algo.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_arithmetic_crossover.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_assembled_fitness_average_stat.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_assembled_fitness_average_stat.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_assembled_fitness_best_stat.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_assembled_fitness_best_stat.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_atom_exchange.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_atom_exchange.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_average_stat.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_average_stat.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_b_f.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_b_f.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_best_fitness_stat.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_best_fitness_stat.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_best_select.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_best_select.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_bin_clone_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_bin_clone_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_bin_gen_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_bin_gen_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_bin_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_bin_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_binary_functor_counter.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_binary_functor_counter.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_bit.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_bit.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_bit_bit_flip.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_bit_gx_over.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_bit_gx_over.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_bit_inversion.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_bit_inversion.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_bit_mutation.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_bit_mutation.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_bit_next.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_bit_next.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_bit_op_factory.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_bit_op_factory.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_bit_prev.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_bit_prev.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_bool_flip.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_bool_flip.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_boolean_generator.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_boolean_generator.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_boolean_init.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_boolean_init.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_branch_mutation.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_branch_mutation.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_breed.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_breed.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_c_m_a_breed.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_c_m_a_breed.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_c_m_a_init.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_c_m_a_init.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_cellular_easy_e_a.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_cellular_easy_e_a.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_check_point.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_check_point.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_collapse_subtree_mutation.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_collapse_subtree_mutation.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_combined_continue.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_combined_continue.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_combined_init.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_combined_init.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_comma_replacement.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_comma_replacement.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_continue.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_continue.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_counted_dyn_update.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_counted_dyn_update.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_counted_state_saver.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_counted_state_saver.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_ctrl_c_continue.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_ctrl_c_continue.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_det_bit_flip.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_det_bit_flip.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_det_select.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_det_select.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_det_tournament_select.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_det_tournament_select.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_det_tournament_truncate.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_det_tournament_truncate.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_det_tournament_truncate_split.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_det_tournament_truncate_split.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_det_tournament_worth_select.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_det_tournament_worth_select.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_det_uniform_mutation.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_det_uniform_mutation.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_deterministic_sa_d_replacement.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_deterministic_sa_d_replacement.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_deterministic_survive_and_die.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_deterministic_survive_and_die.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_distance.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_distance.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_distrib_updater.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_distrib_updater.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_distribution.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_distribution.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_dominance_map.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_dominance_map.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_double_exchange.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_double_exchange.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_double_intermediate.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_double_intermediate.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_drawable.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_dyn_s_g_a_transform.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_dyn_s_g_a_transform.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_dyn_updater.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_dyn_updater.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_e_d_a.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_e_d_a.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_e_p_reduce.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_e_p_reduce.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_e_p_replacement.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_e_p_replacement.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_easy_e_a.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_easy_e_a.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_elite_sequential_select.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_elite_sequential_select.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_elitism.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_elitism.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_es_chrom_init.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_es_chrom_init.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_es_full.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_es_full.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_es_global_xover.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_es_global_xover.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_es_mutate.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_es_mutate.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_es_mutation_init.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_es_simple.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_es_simple.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_es_standard_xover.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_es_standard_xover.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_es_stdev.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_es_stdev.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_eval_continue.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_eval_continue.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_eval_func.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_eval_func.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_eval_func_counter.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_eval_func_counter.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_expansion_mutation.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_expansion_mutation.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_external_bin_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_external_bin_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_external_e_o.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_external_e_o.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_external_eval_func.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_external_eval_func.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_external_init.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_external_init.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_external_mon_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_external_mon_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_external_quad_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_external_quad_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_f.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_f.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_f_d_c_file_snapshot.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_f_d_c_file_snapshot.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_f_d_c_stat.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_f_d_c_stat.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_factory.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_factory.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_file_monitor.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_file_monitor.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_file_snapshot.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_file_snapshot.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_fit_continue.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_fit_continue.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_fitness_scaling_select.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_fitness_scaling_select.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_fitness_stat.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_fitness_stat.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_fl_or1pt_bin_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_fl_or1pt_bin_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_fl_or1pt_quad_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_fl_or1pt_quad_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_fl_or_all_atom_bin_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_fl_or_all_atom_bin_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_fl_or_all_atom_quad_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_fl_or_all_atom_quad_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_fl_or_all_mutation.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_fl_or_all_mutation.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_fl_or_k_atom_bin_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_fl_or_k_atom_bin_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_fl_or_k_atom_quad_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_fl_or_k_atom_quad_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_fl_or_k_mutation.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_fl_or_k_mutation.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_fl_or_uniform_bin_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_fl_or_uniform_bin_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_fl_or_uniform_quad_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_fl_or_uniform_quad_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_functor_base.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_functor_base.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_functor_store.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_functor_store.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_g3_replacement.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_g3_replacement.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_gen_continue.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_gen_continue.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_gen_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_gen_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_gene_del_chooser.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_gene_del_chooser.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_general_breeder.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_general_breeder.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_general_int_bounds.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_general_int_bounds.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_general_real_bounds.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_general_real_bounds.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_generational_replacement.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_generational_replacement.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_gnuplot.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_gnuplot.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_gnuplot1_d_monitor.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_gnuplot1_d_monitor.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_gnuplot1_d_snapshot.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_gnuplot1_d_snapshot.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_hamming_distance.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_hamming_distance.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_hoist_mutation.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_hoist_mutation.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_how_many.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_how_many.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_incrementor.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_incrementor.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_incrementor_param.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_incrementor_param.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_init.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_init.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_init_adaptor.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_init_adaptor.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_init_fixed_length.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_init_fixed_length.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_init_generator.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_init_generator.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_init_variable_length.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_init_variable_length.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_init_virus.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_init_virus.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_init_virus1bit.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_init_virus1bit.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_inner_exchange_quad_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_inner_exchange_quad_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_int_above_bound.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_int_above_bound.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_int_below_bound.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_int_below_bound.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_int_bounds.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_int_bounds.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_int_interval.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_int_interval.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_int_no_bounds.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_int_no_bounds.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_invalidate_bin_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_invalidate_bin_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_invalidate_mon_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_invalidate_mon_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_invalidate_quad_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_invalidate_quad_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_linear_fit_scaling.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_linear_fit_scaling.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_linear_random_split.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_linear_random_split.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_linear_truncate.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_linear_truncate.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_linear_truncate_split.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_linear_truncate_split.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_m_g_g_replacement.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_m_g_g_replacement.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_m_o_fitness_stat.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_m_o_fitness_stat.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_merge.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_merge.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_merge_reduce.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_merge_reduce.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_mon_clone_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_mon_clone_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_mon_gen_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_mon_gen_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_mon_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_mon_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_monitor.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_monitor.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_n_d_plus_replacement.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_n_d_plus_replacement.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting_1_1_dummy_e_o.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting_1_1_dummy_e_o.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting___i.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting___i.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting___i_i.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting___i_i.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_n_pts_bit_xover.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_n_pts_bit_xover.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_neg_exp_generator.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_neg_exp_generator.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_neg_exp_init.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_neg_exp_init.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_no_elitism.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_no_elitism.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_no_perf2_worth.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_no_perf2_worth.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_no_select.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_no_select.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_normal_generator.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_normal_generator.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_normal_init.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_normal_init.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_normal_mutation.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_normal_mutation.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_normal_vec_mutation.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_normal_vec_mutation.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_nth_element_fitness_stat.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_nth_element_fitness_stat.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_object.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_object.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_one_fifth_mutation.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_one_fifth_mutation.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_one_max.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_one_max.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_one_max_eval_func.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_one_max_eval_func.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_one_max_init.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_one_max_init.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_one_max_mutation.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_one_max_mutation.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_one_max_quad_crossover.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_one_max_quad_crossover.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_op_container.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_op_container.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_op_sel_mason.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_op_sel_mason.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_p_b_i_l_additive.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_p_b_i_l_additive.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_p_b_i_l_distrib.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_p_b_i_l_distrib.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_p_b_i_l_org.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_p_b_i_l_org.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_param.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_param.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_param_param_type.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_parameter_loader.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_parameter_loader.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_pareto_fitness.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_pareto_fitness_traits.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_pareto_fitness_traits.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_pareto_one_constraint_fitness.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_pareto_ranking.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_pareto_ranking.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_parse_tree.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_parse_tree.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_parse_tree_depth_init.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_parse_tree_depth_init.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_parser.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_parser.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_perf2_worth.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_perf2_worth.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_perf2_worth_1_1compare__worth.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_perf2_worth_cached.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_perf2_worth_cached.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_perf2_worth_cached_1_1compare__worth.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_persistent.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_persistent.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_plus.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_plus.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_plus_replacement.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_plus_replacement.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_point_mutation.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_point_mutation.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_pop.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_pop.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_pop_algo.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_pop_algo.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_pop_eval_func.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_pop_eval_func.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_pop_loop_eval.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_pop_loop_eval.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_pop_stat.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_pop_stat.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_populator.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_populator.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_printable.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_printable.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_procedure_counter.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_procedure_counter.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_prop_combined_bin_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_prop_combined_bin_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_prop_combined_mon_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_prop_combined_mon_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_prop_combined_quad_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_prop_combined_quad_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_prop_g_a_gen_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_prop_g_a_gen_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_proportional_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_proportional_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_proportional_select.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_proportional_select.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_quad2_bin_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_quad2_bin_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_quad_clone_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_quad_clone_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_quad_distance.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_quad_distance.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_quad_gen_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_quad_gen_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_quad_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_quad_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_random_reduce.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_random_reduce.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_random_select.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_random_select.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_random_split.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_random_split.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_ranking.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_ranking.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_ranking_select.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_ranking_select.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_real.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_real.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_real_above_bound.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_real_above_bound.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_real_base_vector_bounds.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_real_base_vector_bounds.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_real_below_bound.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_real_below_bound.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_real_bounds.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_real_bounds.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_real_init_bounded.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_real_init_bounded.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_real_interval.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_real_interval.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_real_no_bounds.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_real_no_bounds.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_real_ux_over.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_real_vector_bounds.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_real_vector_bounds.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_real_vector_no_bounds.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_real_vector_no_bounds.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_reduce.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_reduce.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_reduce_merge.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_reduce_merge.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_reduce_merge_reduce.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_reduce_merge_reduce.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_reduce_split.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_reduce_split.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_replacement.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_replacement.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_rnd_generator.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_rnd_generator.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_rng.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_rng.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_roulette_worth_select.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_roulette_worth_select.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_s_g_a.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_s_g_a.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_s_g_a_gen_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_s_g_a_gen_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_s_g_a_transform.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_s_g_a_transform.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_s_s_g_a_det_tournament_replacement.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_s_s_g_a_det_tournament_replacement.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_s_s_g_a_stoch_tournament_replacement.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_s_s_g_a_stoch_tournament_replacement.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_s_s_g_a_worse_replacement.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_s_s_g_a_worse_replacement.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_s_t_l_b_f.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_s_t_l_f.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_s_t_l_u_f.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_scalar_fitness.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_scalar_fitness_assembled.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_scalar_fitness_assembled_traits.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_scalar_fitness_stat.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_scalar_fitness_stat.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_second_moment_stats.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_second_moment_stats.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_segment_crossover.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_segment_crossover.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_sel_bin_gen_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_sel_bin_gen_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_select.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_select.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_select_factory.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_select_factory.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_select_from_worth.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_select_from_worth.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_select_many.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_select_many.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_select_number.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_select_number.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_select_one.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_select_one.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_select_perc.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_select_perc.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_select_transform.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_select_transform.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_selective_populator.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_selective_populator.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_seq_populator.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_seq_populator.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_sequential_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_sequential_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_sequential_select.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_sequential_select.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_sharing.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_sharing.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_sharing_select.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_sharing_select.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_simple_e_d_a.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_simple_e_d_a.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_sorted_pop_stat.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_sorted_pop_stat.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_sorted_stat.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_sorted_stat.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_sorted_stat_base.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_sorted_stat_base.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_st_branch_mutation.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_st_branch_mutation.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_st_hoist_mutation.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_st_hoist_mutation.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_st_parse_tree_depth_init.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_st_parse_tree_depth_init.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_st_point_mutation.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_st_point_mutation.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_st_subtree_x_over.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_st_subtree_x_over.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_stat.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_stat.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_stat_base.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_stat_base.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_state.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_state.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_stdout_monitor.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_stdout_monitor.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_steady_fit_continue.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_steady_fit_continue.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_select.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_select.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_truncate.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_truncate.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_truncate_split.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_truncate_split.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_worth_select.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_worth_select.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_stochastic_universal_select.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_stochastic_universal_select.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_string.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_string.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_subtree_x_over.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_subtree_x_over.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_survive_and_die.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_survive_and_die.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_sym_init.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_sym_init.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_time_counter.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_time_counter.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_time_varying_loop_eval.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_time_varying_loop_eval.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_timed_dyn_update.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_timed_dyn_update.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_timed_monitor.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_timed_monitor.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_timed_state_saver.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_timed_state_saver.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_transform.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_transform.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_trunc_select.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_trunc_select.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_truncate.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_truncate.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_truncate_split.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_truncate_split.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_truncated_select_many.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_truncated_select_many.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_truncated_select_one.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_truncated_select_one.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_u_bit_xover.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_u_bit_xover.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_u_f.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_u_f.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_unary_functor_counter.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_unary_functor_counter.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_uniform_atom_exchange.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_uniform_atom_exchange.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_uniform_gene_chooser.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_uniform_gene_chooser.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_uniform_generator.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_uniform_generator.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_uniform_init.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_uniform_init.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_uniform_mutation.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_uniform_mutation.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_updatable.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_updatable.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_updater.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_updater.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_value_param.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_value_param.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_variable_pareto_traits.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_variable_pareto_traits.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_vector.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_vector.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_vl_add_mutation.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_vl_add_mutation.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_vl_atom_exchange_quad_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_vl_atom_exchange_quad_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_vl_del_mutation.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_vl_del_mutation.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_vl_uniform_bin_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_vl_uniform_bin_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_vl_uniform_quad_op.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_vl_uniform_quad_op.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_weak_elitist_replacement.eps create mode 100644 trunk/paradiseo-eo/doc/latex/classeo_weak_elitist_replacement.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classgp__parse__tree_1_1_mem_pool.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classnegexp__generator.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classnormal__generator.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classrandom__generator.tex create mode 100644 trunk/paradiseo-eo/doc/latex/classuniform__generator.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000000.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000001.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000002.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000003.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000004.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000005.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000006.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000007.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000008.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000009.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000010.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000011.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000012.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000013.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000014.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000015.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000016.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000017.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000018.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000019.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000020.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000021.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000022.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000023.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000024.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000025.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000026.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000027.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000028.tex create mode 100644 trunk/paradiseo-eo/doc/latex/dir_000029.tex create mode 100644 trunk/paradiseo-eo/doc/latex/doxygen.sty create mode 100644 trunk/paradiseo-eo/doc/latex/group___evolution_strategies.tex create mode 100644 trunk/paradiseo-eo/doc/latex/group___operators.tex create mode 100644 trunk/paradiseo-eo/doc/latex/group___parse_tree.tex create mode 100644 trunk/paradiseo-eo/doc/latex/group___prop_combined_operators.tex create mode 100644 trunk/paradiseo-eo/doc/latex/group___st_parse_tree.tex create mode 100644 trunk/paradiseo-eo/doc/latex/group__bitstring.tex create mode 100644 trunk/paradiseo-eo/doc/latex/group__selectors.tex create mode 100644 trunk/paradiseo-eo/doc/latex/hierarchy.tex create mode 100644 trunk/paradiseo-eo/doc/latex/main.tex create mode 100644 trunk/paradiseo-eo/doc/latex/modules.tex create mode 100644 trunk/paradiseo-eo/doc/latex/namespacegp__parse__tree.tex create mode 100644 trunk/paradiseo-eo/doc/latex/namespaces.tex create mode 100644 trunk/paradiseo-eo/doc/latex/pages.tex create mode 100644 trunk/paradiseo-eo/doc/latex/refman.tex create mode 100644 trunk/paradiseo-eo/doc/latex/related.tex create mode 100644 trunk/paradiseo-eo/doc/latex/struct_dummy.eps create mode 100644 trunk/paradiseo-eo/doc/latex/struct_dummy.tex create mode 100644 trunk/paradiseo-eo/doc/latex/struct_t__pickle__suite.tex create mode 100644 trunk/paradiseo-eo/doc/latex/structeo_eval_func_ptr.eps create mode 100644 trunk/paradiseo-eo/doc/latex/structeo_eval_func_ptr.tex create mode 100644 trunk/paradiseo-eo/doc/latex/structeo_functor_base_1_1binary__function__tag.tex create mode 100644 trunk/paradiseo-eo/doc/latex/structeo_functor_base_1_1procedure__tag.tex create mode 100644 trunk/paradiseo-eo/doc/latex/structeo_functor_base_1_1unary__function__tag.tex create mode 100644 trunk/paradiseo-eo/doc/latex/structeo_pop_1_1_cmp.tex create mode 100644 trunk/paradiseo-eo/doc/latex/structeo_pop_1_1_ref.tex create mode 100644 trunk/paradiseo-eo/doc/latex/structeo_state_1_1loading__error.tex create mode 100644 trunk/paradiseo-eo/doc/latex/todo.tex create mode 100644 trunk/paradiseo-eo/doc/latex/webpages.tex create mode 100644 trunk/paradiseo-eo/doc/mainpage.html create mode 100644 trunk/paradiseo-eo/doc/make_snapshot.out create mode 100644 trunk/paradiseo-eo/doc/man/man3/BiasedNodeSelector.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/Bitstring.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/Cov.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/Dummy.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/EO.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/EvolutionStrategies.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/MemPool.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/MinimizingTraits.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/NodeSelector.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/Operators.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/ParseTree.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/PropCombinedOperators.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/RandomNodeSelector.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/Selectors.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/StParseTree.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/T_pickle_suite.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/UF_random_generator.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/VirusBitFlip.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/VirusShiftMutation.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_app_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_app_gprop_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_app_gpsymreg_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_app_mastermind_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_MGE_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_eo_interface_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_eval_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_fun_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_gen_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_regression_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_sym_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_test_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_do_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_es_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_ga_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_gp_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_other_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_pyeo_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_utils_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_test_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_Lesson1_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_Lesson2_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_Lesson3_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_Lesson4_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_Lesson5_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_Templates_.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/boolean_generator.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/dMatrix.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eo1PtBitCrossover.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoAged.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoAlgo.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoArithmeticCrossover.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoAssembledFitnessAverageStat.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoAssembledFitnessBestStat.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoAtomExchange.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoAverageStat.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoBF.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoBestFitnessStat.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoBestSelect.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoBinCloneOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoBinGenOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoBinOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoBinaryFunctorCounter.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoBit.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoBitBitFlip.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoBitGxOver.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoBitInversion.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoBitMutation.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoBitNext.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoBitOpFactory.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoBitPrev.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoBoolFlip.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoBooleanGenerator.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoBooleanInit.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoBranchMutation.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoBreed.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoCMABreed.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoCMAInit.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoCellularEasyEA.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoCheckPoint.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoCollapseSubtreeMutation.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoCombinedContinue.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoCombinedInit.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoCommaReplacement.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoContinue.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoCountedDynUpdate.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoCountedStateSaver.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoCtrlCContinue.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoDetBitFlip.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoDetSelect.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoDetTournamentSelect.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoDetTournamentTruncate.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoDetTournamentTruncateSplit.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoDetTournamentWorthSelect.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoDetUniformMutation.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoDeterministicSaDReplacement.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoDeterministicSurviveAndDie.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoDistance.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoDistribUpdater.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoDistribution.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoDominanceMap.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoDoubleExchange.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoDoubleIntermediate.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoDrawable.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoDynSGATransform.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoDynUpdater.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoEDA.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoEPReduce.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoEPReplacement.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoEasyEA.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoEliteSequentialSelect.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoElitism.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoEsChromInit.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoEsFull.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoEsGlobalXover.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoEsMutate.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoEsMutationInit.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoEsSimple.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoEsStandardXover.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoEsStdev.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoEvalContinue.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoEvalFunc.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoEvalFuncCounter.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoEvalFuncPtr.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoExpansionMutation.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoExternalBinOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoExternalEO.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoExternalEvalFunc.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoExternalInit.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoExternalMonOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoExternalQuadOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoF.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoFDCFileSnapshot.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoFDCStat.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoFactory.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoFileMonitor.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoFileSnapshot.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoFitContinue.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoFitnessScalingSelect.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoFitnessStat.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoFlOr1ptBinOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoFlOr1ptQuadOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoFlOrAllAtomBinOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoFlOrAllAtomQuadOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoFlOrAllMutation.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoFlOrKAtomBinOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoFlOrKAtomQuadOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoFlOrKMutation.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoFlOrUniformBinOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoFlOrUniformQuadOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoFunctorBase.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoFunctorBase_binary_function_tag.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoFunctorBase_procedure_tag.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoFunctorBase_unary_function_tag.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoFunctorStore.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoG3Replacement.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoGenContinue.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoGenOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoGeneDelChooser.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoGeneralBreeder.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoGeneralIntBounds.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoGeneralRealBounds.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoGenerationalReplacement.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoGnuplot.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoGnuplot1DMonitor.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoGnuplot1DSnapshot.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoHammingDistance.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoHoistMutation.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoHowMany.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoIncrementor.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoIncrementorParam.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoInit.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoInitAdaptor.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoInitFixedLength.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoInitGenerator.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoInitVariableLength.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoInitVirus.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoInitVirus1bit.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoInnerExchangeQuadOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoIntAboveBound.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoIntBelowBound.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoIntBounds.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoIntInterval.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoIntNoBounds.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoInvalidateBinOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoInvalidateMonOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoInvalidateQuadOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoLinearFitScaling.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoLinearRandomSplit.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoLinearTruncate.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoLinearTruncateSplit.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoMGGReplacement.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoMOFitnessStat.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoMerge.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoMergeReduce.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoMonCloneOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoMonGenOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoMonOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoMonitor.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoNDPlusReplacement.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoNDSorting.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoNDSorting_DummyEO.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoNDSorting_I.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoNDSorting_II.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoNPtsBitXover.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoNegExpGenerator.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoNegExpInit.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoNoElitism.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoNoPerf2Worth.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoNoSelect.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoNormalGenerator.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoNormalInit.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoNormalMutation.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoNormalVecMutation.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoNthElementFitnessStat.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoObject.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoOneFifthMutation.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoOneMax.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoOneMaxEvalFunc.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoOneMaxInit.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoOneMaxMutation.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoOneMaxQuadCrossover.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoOpContainer.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoOpSelMason.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoPBILAdditive.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoPBILDistrib.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoPBILOrg.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoParam.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoParamParamType.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoParameterLoader.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoParetoFitness.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoParetoFitnessTraits.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoParetoOneConstraintFitness.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoParetoRanking.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoParseTree.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoParseTreeDepthInit.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoParser.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoPerf2Worth.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoPerf2WorthCached.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoPerf2WorthCached_compare_worth.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoPerf2Worth_compare_worth.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoPersistent.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoPlus.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoPlusReplacement.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoPointMutation.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoPop.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoPopAlgo.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoPopEvalFunc.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoPopLoopEval.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoPopStat.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoPop_Cmp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoPop_Ref.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoPopulator.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoPrintable.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoProcedureCounter.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoPropCombinedBinOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoPropCombinedMonOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoPropCombinedQuadOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoPropGAGenOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoProportionalOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoProportionalSelect.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoQuad2BinOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoQuadCloneOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoQuadDistance.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoQuadGenOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoQuadOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoRandomReduce.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoRandomSelect.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoRandomSplit.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoRanking.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoRankingSelect.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoReal.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoRealAboveBound.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoRealBaseVectorBounds.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoRealBelowBound.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoRealBounds.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoRealInitBounded.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoRealInterval.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoRealNoBounds.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoRealUxOver.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoRealVectorBounds.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoRealVectorNoBounds.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoReduce.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoReduceMerge.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoReduceMergeReduce.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoReduceSplit.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoReplacement.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoRndGenerator.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoRng.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoRouletteWorthSelect.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSGA.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSGAGenOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSGATransform.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSSGADetTournamentReplacement.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSSGAStochTournamentReplacement.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSSGAWorseReplacement.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSTLBF.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSTLF.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSTLUF.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoScalarFitness.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoScalarFitnessAssembled.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoScalarFitnessAssembledTraits.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoScalarFitnessStat.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSecondMomentStats.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSegmentCrossover.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSelBinGenOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSelect.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSelectFactory.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSelectFromWorth.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSelectMany.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSelectNumber.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSelectOne.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSelectPerc.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSelectTransform.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSelectivePopulator.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSeqPopulator.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSequentialOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSequentialSelect.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSharing.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSharingSelect.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSimpleEDA.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSortedPopStat.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSortedStat.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSortedStatBase.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoStBranchMutation.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoStHoistMutation.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoStParseTreeDepthInit.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoStPointMutation.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoStSubtreeXOver.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoStat.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoStatBase.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoState.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoState_loading_error.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoStdoutMonitor.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSteadyFitContinue.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoStochTournamentSelect.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoStochTournamentTruncate.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoStochTournamentTruncateSplit.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoStochTournamentWorthSelect.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoStochasticUniversalSelect.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoString.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSubtreeXOver.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSurviveAndDie.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoSymInit.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoTimeCounter.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoTimeVaryingLoopEval.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoTimedDynUpdate.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoTimedMonitor.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoTimedStateSaver.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoTransform.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoTruncSelect.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoTruncate.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoTruncateSplit.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoTruncatedSelectMany.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoTruncatedSelectOne.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoUBitXover.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoUF.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoUnaryFunctorCounter.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoUniformAtomExchange.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoUniformGeneChooser.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoUniformGenerator.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoUniformInit.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoUniformMutation.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoUpdatable.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoUpdater.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoValueParam.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoVariableParetoTraits.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoVector.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoVlAddMutation.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoVlAtomExchangeQuadOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoVlDelMutation.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoVlUniformBinOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoVlUniformQuadOp.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/eoWeakElitistReplacement.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/gp_parse_tree.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/gp_parse_tree_MemPool.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/negexp_generator.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/normal_generator.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/random_generator.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/related.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/todo.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/uniform_generator.3 create mode 100644 trunk/paradiseo-eo/doc/man/man3/webpages.3 create mode 100644 trunk/paradiseo-eo/doc/publications.html create mode 100644 trunk/paradiseo-eo/doc/sflogo-hammer1.jpg create mode 100644 trunk/paradiseo-eo/gp/CVS/Entries create mode 100644 trunk/paradiseo-eo/gp/CVS/Repository create mode 100644 trunk/paradiseo-eo/gp/CVS/Root create mode 100644 trunk/paradiseo-eo/src/.cvsignore create mode 100644 trunk/paradiseo-eo/src/CVS/Entries create mode 100644 trunk/paradiseo-eo/src/CVS/Entries.Log create mode 100644 trunk/paradiseo-eo/src/CVS/Repository create mode 100644 trunk/paradiseo-eo/src/CVS/Root create mode 100644 trunk/paradiseo-eo/src/EO.h create mode 100644 trunk/paradiseo-eo/src/MGE/CVS/Entries create mode 100644 trunk/paradiseo-eo/src/MGE/CVS/Repository create mode 100644 trunk/paradiseo-eo/src/MGE/CVS/Root create mode 100644 trunk/paradiseo-eo/src/Makefile.am create mode 100644 trunk/paradiseo-eo/src/apply.h create mode 100644 trunk/paradiseo-eo/src/do/.cvsignore create mode 100644 trunk/paradiseo-eo/src/do/CVS/Entries create mode 100644 trunk/paradiseo-eo/src/do/CVS/Repository create mode 100644 trunk/paradiseo-eo/src/do/CVS/Root create mode 100644 trunk/paradiseo-eo/src/do/Makefile.am create mode 100644 trunk/paradiseo-eo/src/do/Readme create mode 100644 trunk/paradiseo-eo/src/do/make_algo_easea.h create mode 100644 trunk/paradiseo-eo/src/do/make_algo_pareto.h create mode 100644 trunk/paradiseo-eo/src/do/make_algo_scalar.h create mode 100644 trunk/paradiseo-eo/src/do/make_checkpoint.h create mode 100644 trunk/paradiseo-eo/src/do/make_checkpoint_FDC.h create mode 100644 trunk/paradiseo-eo/src/do/make_checkpoint_assembled.h create mode 100644 trunk/paradiseo-eo/src/do/make_checkpoint_pareto.h create mode 100644 trunk/paradiseo-eo/src/do/make_continue.h create mode 100644 trunk/paradiseo-eo/src/do/make_continue_pareto.h create mode 100644 trunk/paradiseo-eo/src/do/make_general_replacement.h create mode 100644 trunk/paradiseo-eo/src/do/make_pop.h create mode 100644 trunk/paradiseo-eo/src/do/make_run.h create mode 100644 trunk/paradiseo-eo/src/eo create mode 100644 trunk/paradiseo-eo/src/eoAlgo.h create mode 100644 trunk/paradiseo-eo/src/eoBreed.h create mode 100644 trunk/paradiseo-eo/src/eoCellularEasyEA.h create mode 100644 trunk/paradiseo-eo/src/eoCloneOps.h create mode 100644 trunk/paradiseo-eo/src/eoCombinedContinue.h create mode 100644 trunk/paradiseo-eo/src/eoCombinedInit.h create mode 100644 trunk/paradiseo-eo/src/eoContinue.h create mode 100644 trunk/paradiseo-eo/src/eoCounter.h create mode 100644 trunk/paradiseo-eo/src/eoCtrlCContinue.cpp create mode 100644 trunk/paradiseo-eo/src/eoCtrlCContinue.h create mode 100644 trunk/paradiseo-eo/src/eoDetSelect.h create mode 100755 trunk/paradiseo-eo/src/eoDetTournamentSelect.h create mode 100644 trunk/paradiseo-eo/src/eoDistribUpdater.h create mode 100644 trunk/paradiseo-eo/src/eoDistribution.h create mode 100644 trunk/paradiseo-eo/src/eoDominanceMap.h create mode 100644 trunk/paradiseo-eo/src/eoEDA.h create mode 100644 trunk/paradiseo-eo/src/eoEasyEA.h create mode 100644 trunk/paradiseo-eo/src/eoEvalContinue.h create mode 100644 trunk/paradiseo-eo/src/eoEvalFunc.h create mode 100644 trunk/paradiseo-eo/src/eoEvalFuncCounter.h create mode 100644 trunk/paradiseo-eo/src/eoEvalFuncPtr.h create mode 100644 trunk/paradiseo-eo/src/eoFactory.h create mode 100644 trunk/paradiseo-eo/src/eoFitContinue.h create mode 100644 trunk/paradiseo-eo/src/eoFitnessScalingSelect.h create mode 100644 trunk/paradiseo-eo/src/eoFlOrBinOp.h create mode 100644 trunk/paradiseo-eo/src/eoFlOrMonOp.h create mode 100644 trunk/paradiseo-eo/src/eoFlOrQuadOp.h create mode 100644 trunk/paradiseo-eo/src/eoFunctor.h create mode 100644 trunk/paradiseo-eo/src/eoFunctorStore.cpp create mode 100644 trunk/paradiseo-eo/src/eoFunctorStore.h create mode 100644 trunk/paradiseo-eo/src/eoG3Replacement.h create mode 100644 trunk/paradiseo-eo/src/eoGenContinue.h create mode 100644 trunk/paradiseo-eo/src/eoGenOp.h create mode 100644 trunk/paradiseo-eo/src/eoGeneralBreeder.h create mode 100644 trunk/paradiseo-eo/src/eoInit.h create mode 100644 trunk/paradiseo-eo/src/eoInvalidateOps.h create mode 100644 trunk/paradiseo-eo/src/eoLinearFitScaling.h create mode 100644 trunk/paradiseo-eo/src/eoMGGReplacement.h create mode 100644 trunk/paradiseo-eo/src/eoMerge.h create mode 100644 trunk/paradiseo-eo/src/eoMergeReduce.h create mode 100644 trunk/paradiseo-eo/src/eoNDSorting.h create mode 100644 trunk/paradiseo-eo/src/eoObject.h create mode 100644 trunk/paradiseo-eo/src/eoOneToOneBreeder.h create mode 100644 trunk/paradiseo-eo/src/eoOp.h create mode 100644 trunk/paradiseo-eo/src/eoOpContainer.h create mode 100644 trunk/paradiseo-eo/src/eoOpSelMason.h create mode 100644 trunk/paradiseo-eo/src/eoParetoConstraintFitness.h create mode 100644 trunk/paradiseo-eo/src/eoParetoFitness.cpp create mode 100644 trunk/paradiseo-eo/src/eoParetoFitness.h create mode 100644 trunk/paradiseo-eo/src/eoParetoRanking.h create mode 100644 trunk/paradiseo-eo/src/eoPerf2Worth.h create mode 100644 trunk/paradiseo-eo/src/eoPeriodicContinue.h create mode 100644 trunk/paradiseo-eo/src/eoPersistent.cpp create mode 100644 trunk/paradiseo-eo/src/eoPersistent.h create mode 100644 trunk/paradiseo-eo/src/eoPop.h create mode 100644 trunk/paradiseo-eo/src/eoPopAlgo.h create mode 100644 trunk/paradiseo-eo/src/eoPopEvalFunc.h create mode 100644 trunk/paradiseo-eo/src/eoPopulator.h create mode 100644 trunk/paradiseo-eo/src/eoPrintable.cpp create mode 100644 trunk/paradiseo-eo/src/eoPrintable.h create mode 100644 trunk/paradiseo-eo/src/eoPropGAGenOp.h create mode 100644 trunk/paradiseo-eo/src/eoProportionalCombinedOp.h create mode 100755 trunk/paradiseo-eo/src/eoProportionalSelect.h create mode 100644 trunk/paradiseo-eo/src/eoRandomSelect.h create mode 100644 trunk/paradiseo-eo/src/eoRanking.h create mode 100644 trunk/paradiseo-eo/src/eoRankingSelect.h create mode 100644 trunk/paradiseo-eo/src/eoReduce.h create mode 100644 trunk/paradiseo-eo/src/eoReduceMerge.h create mode 100644 trunk/paradiseo-eo/src/eoReduceMergeReduce.h create mode 100644 trunk/paradiseo-eo/src/eoReduceSplit.h create mode 100644 trunk/paradiseo-eo/src/eoReplacement.h create mode 100644 trunk/paradiseo-eo/src/eoSGA.h create mode 100644 trunk/paradiseo-eo/src/eoSGAGenOp.h create mode 100644 trunk/paradiseo-eo/src/eoSGATransform.h create mode 100644 trunk/paradiseo-eo/src/eoSTLFunctor.h create mode 100644 trunk/paradiseo-eo/src/eoScalarFitness.h create mode 100644 trunk/paradiseo-eo/src/eoScalarFitnessAssembled.cpp create mode 100644 trunk/paradiseo-eo/src/eoScalarFitnessAssembled.h create mode 100644 trunk/paradiseo-eo/src/eoSelect.h create mode 100644 trunk/paradiseo-eo/src/eoSelectFactory.h create mode 100644 trunk/paradiseo-eo/src/eoSelectFromWorth.h create mode 100644 trunk/paradiseo-eo/src/eoSelectMany.h create mode 100644 trunk/paradiseo-eo/src/eoSelectNumber.h create mode 100644 trunk/paradiseo-eo/src/eoSelectOne.h create mode 100644 trunk/paradiseo-eo/src/eoSelectPerc.h create mode 100644 trunk/paradiseo-eo/src/eoSequentialSelect.h create mode 100644 trunk/paradiseo-eo/src/eoSharing.h create mode 100644 trunk/paradiseo-eo/src/eoSharingSelect.h create mode 100644 trunk/paradiseo-eo/src/eoSimpleEDA.h create mode 100755 trunk/paradiseo-eo/src/eoSteadyFitContinue.h create mode 100755 trunk/paradiseo-eo/src/eoStochTournamentSelect.h create mode 100755 trunk/paradiseo-eo/src/eoStochasticUniversalSelect.h create mode 100644 trunk/paradiseo-eo/src/eoSurviveAndDie.h create mode 100644 trunk/paradiseo-eo/src/eoTransform.h create mode 100644 trunk/paradiseo-eo/src/eoTruncSelect.h create mode 100644 trunk/paradiseo-eo/src/eoTruncatedSelectMany.h create mode 100644 trunk/paradiseo-eo/src/eoTruncatedSelectOne.h create mode 100644 trunk/paradiseo-eo/src/eoVariableLengthCrossover.h create mode 100644 trunk/paradiseo-eo/src/eoVariableLengthMutation.h create mode 100644 trunk/paradiseo-eo/src/eoVector.h create mode 100644 trunk/paradiseo-eo/src/es.h create mode 100644 trunk/paradiseo-eo/src/es/.cvsignore create mode 100644 trunk/paradiseo-eo/src/es/CMAParams.cpp create mode 100644 trunk/paradiseo-eo/src/es/CMAParams.h create mode 100644 trunk/paradiseo-eo/src/es/CMAState.cpp create mode 100644 trunk/paradiseo-eo/src/es/CMAState.h create mode 100644 trunk/paradiseo-eo/src/es/CVS/Entries create mode 100644 trunk/paradiseo-eo/src/es/CVS/Repository create mode 100644 trunk/paradiseo-eo/src/es/CVS/Root create mode 100644 trunk/paradiseo-eo/src/es/Makefile.am create mode 100644 trunk/paradiseo-eo/src/es/eig.cpp create mode 100644 trunk/paradiseo-eo/src/es/eig.h create mode 100644 trunk/paradiseo-eo/src/es/eoCMABreed.h create mode 100644 trunk/paradiseo-eo/src/es/eoCMAInit.h create mode 100644 trunk/paradiseo-eo/src/es/eoEsChromInit.h create mode 100644 trunk/paradiseo-eo/src/es/eoEsFull.h create mode 100644 trunk/paradiseo-eo/src/es/eoEsGlobalXover.h create mode 100644 trunk/paradiseo-eo/src/es/eoEsMutate.h create mode 100644 trunk/paradiseo-eo/src/es/eoEsMutationInit.h create mode 100644 trunk/paradiseo-eo/src/es/eoEsSimple.h create mode 100644 trunk/paradiseo-eo/src/es/eoEsStandardXover.h create mode 100644 trunk/paradiseo-eo/src/es/eoEsStdev.h create mode 100644 trunk/paradiseo-eo/src/es/eoNormalMutation.h create mode 100644 trunk/paradiseo-eo/src/es/eoReal.h create mode 100644 trunk/paradiseo-eo/src/es/eoRealAtomXover.h create mode 100644 trunk/paradiseo-eo/src/es/eoRealInitBounded.h create mode 100644 trunk/paradiseo-eo/src/es/eoRealOp.h create mode 100644 trunk/paradiseo-eo/src/es/eoSBXcross.h create mode 100644 trunk/paradiseo-eo/src/es/make_algo_scalar_es.cpp create mode 100644 trunk/paradiseo-eo/src/es/make_algo_scalar_real.cpp create mode 100644 trunk/paradiseo-eo/src/es/make_checkpoint_es.cpp create mode 100644 trunk/paradiseo-eo/src/es/make_checkpoint_real.cpp create mode 100644 trunk/paradiseo-eo/src/es/make_continue_es.cpp create mode 100644 trunk/paradiseo-eo/src/es/make_continue_real.cpp create mode 100644 trunk/paradiseo-eo/src/es/make_es.h create mode 100644 trunk/paradiseo-eo/src/es/make_genotype_es.cpp create mode 100644 trunk/paradiseo-eo/src/es/make_genotype_real.cpp create mode 100644 trunk/paradiseo-eo/src/es/make_genotype_real.h create mode 100644 trunk/paradiseo-eo/src/es/make_op.h create mode 100644 trunk/paradiseo-eo/src/es/make_op_es.cpp create mode 100644 trunk/paradiseo-eo/src/es/make_op_es.h create mode 100644 trunk/paradiseo-eo/src/es/make_op_real.cpp create mode 100644 trunk/paradiseo-eo/src/es/make_op_real.h create mode 100644 trunk/paradiseo-eo/src/es/make_pop_es.cpp create mode 100644 trunk/paradiseo-eo/src/es/make_pop_real.cpp create mode 100644 trunk/paradiseo-eo/src/es/make_real.h create mode 100644 trunk/paradiseo-eo/src/es/make_run_es.cpp create mode 100644 trunk/paradiseo-eo/src/es/make_run_real.cpp create mode 100644 trunk/paradiseo-eo/src/es/matrices.h create mode 100644 trunk/paradiseo-eo/src/ga.h create mode 100644 trunk/paradiseo-eo/src/ga/.cvsignore create mode 100644 trunk/paradiseo-eo/src/ga/CVS/Entries create mode 100644 trunk/paradiseo-eo/src/ga/CVS/Repository create mode 100644 trunk/paradiseo-eo/src/ga/CVS/Root create mode 100644 trunk/paradiseo-eo/src/ga/Makefile.am create mode 100644 trunk/paradiseo-eo/src/ga/Readme create mode 100644 trunk/paradiseo-eo/src/ga/eoBit.h create mode 100644 trunk/paradiseo-eo/src/ga/eoBitOp.h create mode 100644 trunk/paradiseo-eo/src/ga/eoBitOpFactory.h create mode 100644 trunk/paradiseo-eo/src/ga/eoBoolFlip.h create mode 100644 trunk/paradiseo-eo/src/ga/eoPBILAdditive.h create mode 100644 trunk/paradiseo-eo/src/ga/eoPBILDistrib.h create mode 100644 trunk/paradiseo-eo/src/ga/eoPBILOrg.h create mode 100644 trunk/paradiseo-eo/src/ga/make_PBILdistrib.h create mode 100644 trunk/paradiseo-eo/src/ga/make_PBILupdate.h create mode 100644 trunk/paradiseo-eo/src/ga/make_algo_scalar_ga.cpp create mode 100644 trunk/paradiseo-eo/src/ga/make_checkpoint_ga.cpp create mode 100644 trunk/paradiseo-eo/src/ga/make_continue_ga.cpp create mode 100644 trunk/paradiseo-eo/src/ga/make_ga.h create mode 100644 trunk/paradiseo-eo/src/ga/make_genotype_ga.cpp create mode 100644 trunk/paradiseo-eo/src/ga/make_genotype_ga.h create mode 100644 trunk/paradiseo-eo/src/ga/make_op.h create mode 100644 trunk/paradiseo-eo/src/ga/make_op_ga.cpp create mode 100644 trunk/paradiseo-eo/src/ga/make_pop_ga.cpp create mode 100644 trunk/paradiseo-eo/src/ga/make_run_ga.cpp create mode 100644 trunk/paradiseo-eo/src/gp/.cvsignore create mode 100644 trunk/paradiseo-eo/src/gp/CVS/Entries create mode 100644 trunk/paradiseo-eo/src/gp/CVS/Repository create mode 100644 trunk/paradiseo-eo/src/gp/CVS/Root create mode 100644 trunk/paradiseo-eo/src/gp/Makefile.am create mode 100644 trunk/paradiseo-eo/src/gp/eoParseTree.h create mode 100644 trunk/paradiseo-eo/src/gp/eoParseTreeDepthInit.h create mode 100644 trunk/paradiseo-eo/src/gp/eoParseTreeOp.h create mode 100644 trunk/paradiseo-eo/src/gp/eoStParseTreeDepthInit.h create mode 100644 trunk/paradiseo-eo/src/gp/eoStParseTreeOp.h create mode 100644 trunk/paradiseo-eo/src/gp/node_pool.h create mode 100644 trunk/paradiseo-eo/src/gp/parse_tree.h create mode 100644 trunk/paradiseo-eo/src/obsolete/.cvsignore create mode 100644 trunk/paradiseo-eo/src/obsolete/CVS/Entries create mode 100644 trunk/paradiseo-eo/src/obsolete/CVS/Repository create mode 100644 trunk/paradiseo-eo/src/obsolete/CVS/Root create mode 100644 trunk/paradiseo-eo/src/obsolete/Makefile.am create mode 100644 trunk/paradiseo-eo/src/obsolete/eo1d.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eo1dWDistance.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eo2d.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eo2dVector.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoAtomBitFlip.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoAtomCreep.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoAtomRandom.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoBackInserter.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoBin.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoBreeder.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoCopyElite.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoDEA.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoDetTournament.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoDetTournamentIndiSelector.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoDetTournamentInserter.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoDistance.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoDup.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoES.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoESChrom.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoESFullChrom.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoESFullMut.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoEsObjectiveBounds.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoEvalFuncPtrCnt.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoEvolutionStrategy.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoFitTerm.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoFitness.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoGOpBreeder.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoGOpSelector.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoGenTerm.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoGeneration.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoGenericBinOp.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoGenericMonOp.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoGenericQuadOp.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoID.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoInclusion.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoIndiSelector.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoInplaceTransform.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoInserter.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoInsertion.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoKill.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoLottery.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoMutation.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoNegExp.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoNonUniform.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoNormal.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoOpFactory.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoOpSelector.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoParser.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoParserUtils.cpp create mode 100644 trunk/paradiseo-eo/src/obsolete/eoParserUtils.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoPopOps.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoProblem.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoProportional.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoProportionalGOpSel.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoProportionalOpSel.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoRandomBreed.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoRandomIndiSelector.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoRandomSelect.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoRank.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoScheme.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoSelectRandom.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoSequentialGOpSel.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoSimpleDEA.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoSteadyStateEA.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoSteadyStateInserter.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoSteadyStateTransform.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoStochTournament.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoStochTournamentInserter.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoStringMutation.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoTerm.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoTournament.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoTranspose.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoUniformXOver.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoVector.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoWrappedOps.h create mode 100644 trunk/paradiseo-eo/src/obsolete/eoXOver2.h create mode 100644 trunk/paradiseo-eo/src/obsolete/evolution_strategies create mode 100644 trunk/paradiseo-eo/src/other/.cvsignore create mode 100644 trunk/paradiseo-eo/src/other/CVS/Entries create mode 100644 trunk/paradiseo-eo/src/other/CVS/Repository create mode 100644 trunk/paradiseo-eo/src/other/CVS/Root create mode 100644 trunk/paradiseo-eo/src/other/Makefile.am create mode 100644 trunk/paradiseo-eo/src/other/eoExternalEO.h create mode 100644 trunk/paradiseo-eo/src/other/eoExternalOpFunctions.h create mode 100644 trunk/paradiseo-eo/src/other/eoString.h create mode 100644 trunk/paradiseo-eo/src/other/external_eo create mode 100644 trunk/paradiseo-eo/src/paradisEO/CVS/Entries create mode 100644 trunk/paradiseo-eo/src/paradisEO/CVS/Entries.Log create mode 100644 trunk/paradiseo-eo/src/paradisEO/CVS/Repository create mode 100644 trunk/paradiseo-eo/src/paradisEO/CVS/Root create mode 100644 trunk/paradiseo-eo/src/paradisEO/comm/CVS/Entries create mode 100644 trunk/paradiseo-eo/src/paradisEO/comm/CVS/Entries.Log create mode 100644 trunk/paradiseo-eo/src/paradisEO/comm/CVS/Repository create mode 100644 trunk/paradiseo-eo/src/paradisEO/comm/CVS/Root create mode 100644 trunk/paradiseo-eo/src/paradisEO/comm/messages/CVS/Entries create mode 100644 trunk/paradiseo-eo/src/paradisEO/comm/messages/CVS/Entries.Log create mode 100644 trunk/paradiseo-eo/src/paradisEO/comm/messages/CVS/Repository create mode 100644 trunk/paradiseo-eo/src/paradisEO/comm/messages/CVS/Root create mode 100644 trunk/paradiseo-eo/src/paradisEO/comm/messages/from/CVS/Entries create mode 100644 trunk/paradiseo-eo/src/paradisEO/comm/messages/from/CVS/Repository create mode 100644 trunk/paradiseo-eo/src/paradisEO/comm/messages/from/CVS/Root create mode 100644 trunk/paradiseo-eo/src/paradisEO/comm/messages/to/CVS/Entries create mode 100644 trunk/paradiseo-eo/src/paradisEO/comm/messages/to/CVS/Repository create mode 100644 trunk/paradiseo-eo/src/paradisEO/comm/messages/to/CVS/Root create mode 100644 trunk/paradiseo-eo/src/paradisEO/eval/CVS/Entries create mode 100644 trunk/paradiseo-eo/src/paradisEO/eval/CVS/Repository create mode 100644 trunk/paradiseo-eo/src/paradisEO/eval/CVS/Root create mode 100644 trunk/paradiseo-eo/src/paradisEO/island/CVS/Entries create mode 100644 trunk/paradiseo-eo/src/paradisEO/island/CVS/Entries.Log create mode 100644 trunk/paradiseo-eo/src/paradisEO/island/CVS/Repository create mode 100644 trunk/paradiseo-eo/src/paradisEO/island/CVS/Root create mode 100644 trunk/paradiseo-eo/src/paradisEO/island/topologies/CVS/Entries create mode 100644 trunk/paradiseo-eo/src/paradisEO/island/topologies/CVS/Repository create mode 100644 trunk/paradiseo-eo/src/paradisEO/island/topologies/CVS/Root create mode 100644 trunk/paradiseo-eo/src/pyeo/AUTHORS create mode 100644 trunk/paradiseo-eo/src/pyeo/BUILDING create mode 100644 trunk/paradiseo-eo/src/pyeo/COPYING create mode 100644 trunk/paradiseo-eo/src/pyeo/CVS/Entries create mode 100644 trunk/paradiseo-eo/src/pyeo/CVS/Entries.Log create mode 100644 trunk/paradiseo-eo/src/pyeo/CVS/Repository create mode 100644 trunk/paradiseo-eo/src/pyeo/CVS/Root create mode 100644 trunk/paradiseo-eo/src/pyeo/Makefile create mode 100644 trunk/paradiseo-eo/src/pyeo/Makefile.rpm create mode 100644 trunk/paradiseo-eo/src/pyeo/NEWS create mode 100644 trunk/paradiseo-eo/src/pyeo/PyEO.cpp create mode 100644 trunk/paradiseo-eo/src/pyeo/PyEO.h create mode 100644 trunk/paradiseo-eo/src/pyeo/PyEO/CVS/Entries create mode 100644 trunk/paradiseo-eo/src/pyeo/PyEO/CVS/Repository create mode 100644 trunk/paradiseo-eo/src/pyeo/PyEO/CVS/Root create mode 100644 trunk/paradiseo-eo/src/pyeo/PyEO/__init__.py create mode 100644 trunk/paradiseo-eo/src/pyeo/README create mode 100644 trunk/paradiseo-eo/src/pyeo/abstract1.cpp create mode 100644 trunk/paradiseo-eo/src/pyeo/algos.cpp create mode 100644 trunk/paradiseo-eo/src/pyeo/breeders.cpp create mode 100644 trunk/paradiseo-eo/src/pyeo/continuators.cpp create mode 100644 trunk/paradiseo-eo/src/pyeo/def_abstract_functor.h create mode 100644 trunk/paradiseo-eo/src/pyeo/geneticOps.cpp create mode 100644 trunk/paradiseo-eo/src/pyeo/mergers.cpp create mode 100644 trunk/paradiseo-eo/src/pyeo/monitors.cpp create mode 100644 trunk/paradiseo-eo/src/pyeo/perf2worth.cpp create mode 100644 trunk/paradiseo-eo/src/pyeo/pickle.h create mode 100644 trunk/paradiseo-eo/src/pyeo/random_numbers.cpp create mode 100644 trunk/paradiseo-eo/src/pyeo/reduce.cpp create mode 100644 trunk/paradiseo-eo/src/pyeo/replacement.cpp create mode 100644 trunk/paradiseo-eo/src/pyeo/selectOne.cpp create mode 100644 trunk/paradiseo-eo/src/pyeo/selectors.cpp create mode 100644 trunk/paradiseo-eo/src/pyeo/statistics.cpp create mode 100644 trunk/paradiseo-eo/src/pyeo/test/CVS/Entries create mode 100644 trunk/paradiseo-eo/src/pyeo/test/CVS/Repository create mode 100644 trunk/paradiseo-eo/src/pyeo/test/CVS/Root create mode 100644 trunk/paradiseo-eo/src/pyeo/test/maxone.py create mode 100755 trunk/paradiseo-eo/src/pyeo/test/run_tests.sh create mode 100644 trunk/paradiseo-eo/src/pyeo/test/test_breeders.py create mode 100644 trunk/paradiseo-eo/src/pyeo/test/test_mo.py create mode 100644 trunk/paradiseo-eo/src/pyeo/test/test_pickling.py create mode 100644 trunk/paradiseo-eo/src/pyeo/test/test_populator.py create mode 100644 trunk/paradiseo-eo/src/pyeo/test/test_reduce.py create mode 100644 trunk/paradiseo-eo/src/pyeo/test/test_selectone.py create mode 100644 trunk/paradiseo-eo/src/pyeo/test/test_sga.py create mode 100644 trunk/paradiseo-eo/src/pyeo/test/test_transform.py create mode 100644 trunk/paradiseo-eo/src/pyeo/valueParam.cpp create mode 100644 trunk/paradiseo-eo/src/pyeo/valueParam.h create mode 100644 trunk/paradiseo-eo/src/utils/.cvsignore create mode 100644 trunk/paradiseo-eo/src/utils/CVS/Entries create mode 100644 trunk/paradiseo-eo/src/utils/CVS/Repository create mode 100644 trunk/paradiseo-eo/src/utils/CVS/Root create mode 100644 trunk/paradiseo-eo/src/utils/Makefile.am create mode 100644 trunk/paradiseo-eo/src/utils/checkpointing create mode 100644 trunk/paradiseo-eo/src/utils/compatibility.h create mode 100644 trunk/paradiseo-eo/src/utils/eoAssembledFitnessStat.h create mode 100644 trunk/paradiseo-eo/src/utils/eoCheckPoint.h create mode 100644 trunk/paradiseo-eo/src/utils/eoData.cpp create mode 100644 trunk/paradiseo-eo/src/utils/eoData.h create mode 100644 trunk/paradiseo-eo/src/utils/eoDistance.h create mode 100644 trunk/paradiseo-eo/src/utils/eoFDCStat.h create mode 100644 trunk/paradiseo-eo/src/utils/eoFileMonitor.cpp create mode 100644 trunk/paradiseo-eo/src/utils/eoFileMonitor.h create mode 100644 trunk/paradiseo-eo/src/utils/eoFileSnapshot.h create mode 100644 trunk/paradiseo-eo/src/utils/eoGnuplot.cpp create mode 100644 trunk/paradiseo-eo/src/utils/eoGnuplot.h create mode 100644 trunk/paradiseo-eo/src/utils/eoGnuplot1DMonitor.cpp create mode 100644 trunk/paradiseo-eo/src/utils/eoGnuplot1DMonitor.h create mode 100644 trunk/paradiseo-eo/src/utils/eoGnuplot1DSnapshot.cpp create mode 100644 trunk/paradiseo-eo/src/utils/eoGnuplot1DSnapshot.h create mode 100644 trunk/paradiseo-eo/src/utils/eoHowMany.h create mode 100644 trunk/paradiseo-eo/src/utils/eoIntBounds.cpp create mode 100644 trunk/paradiseo-eo/src/utils/eoIntBounds.h create mode 100644 trunk/paradiseo-eo/src/utils/eoMOFitnessStat.h create mode 100644 trunk/paradiseo-eo/src/utils/eoMonitor.h create mode 100644 trunk/paradiseo-eo/src/utils/eoParam.h create mode 100644 trunk/paradiseo-eo/src/utils/eoParser.cpp create mode 100644 trunk/paradiseo-eo/src/utils/eoParser.h create mode 100644 trunk/paradiseo-eo/src/utils/eoPopStat.h create mode 100644 trunk/paradiseo-eo/src/utils/eoRNG.cpp create mode 100644 trunk/paradiseo-eo/src/utils/eoRNG.h create mode 100644 trunk/paradiseo-eo/src/utils/eoRealBounds.cpp create mode 100644 trunk/paradiseo-eo/src/utils/eoRealBounds.h create mode 100644 trunk/paradiseo-eo/src/utils/eoRealVectorBounds.h create mode 100644 trunk/paradiseo-eo/src/utils/eoRndGenerators.h create mode 100644 trunk/paradiseo-eo/src/utils/eoScalarFitnessStat.h create mode 100644 trunk/paradiseo-eo/src/utils/eoStat.h create mode 100644 trunk/paradiseo-eo/src/utils/eoState.cpp create mode 100644 trunk/paradiseo-eo/src/utils/eoState.h create mode 100644 trunk/paradiseo-eo/src/utils/eoStdoutMonitor.cpp create mode 100644 trunk/paradiseo-eo/src/utils/eoStdoutMonitor.h create mode 100644 trunk/paradiseo-eo/src/utils/eoTimeCounter.h create mode 100644 trunk/paradiseo-eo/src/utils/eoTimedMonitor.h create mode 100644 trunk/paradiseo-eo/src/utils/eoUniformInit.h create mode 100644 trunk/paradiseo-eo/src/utils/eoUpdatable.h create mode 100644 trunk/paradiseo-eo/src/utils/eoUpdater.cpp create mode 100644 trunk/paradiseo-eo/src/utils/eoUpdater.h create mode 100644 trunk/paradiseo-eo/src/utils/make_help.cpp create mode 100644 trunk/paradiseo-eo/src/utils/pipecom.cpp create mode 100644 trunk/paradiseo-eo/src/utils/pipecom.h create mode 100644 trunk/paradiseo-eo/src/utils/rnd_generators.h create mode 100644 trunk/paradiseo-eo/src/utils/selectors.h create mode 100644 trunk/paradiseo-eo/test/.cvsignore create mode 100644 trunk/paradiseo-eo/test/CVS/Entries create mode 100644 trunk/paradiseo-eo/test/CVS/Repository create mode 100644 trunk/paradiseo-eo/test/CVS/Root create mode 100644 trunk/paradiseo-eo/test/Makefile.am create mode 100644 trunk/paradiseo-eo/test/RoyalRoad.h create mode 100644 trunk/paradiseo-eo/test/binary_value.h create mode 100644 trunk/paradiseo-eo/test/fitness_traits.cpp create mode 100644 trunk/paradiseo-eo/test/real_value.h create mode 100755 trunk/paradiseo-eo/test/run_tests create mode 100644 trunk/paradiseo-eo/test/t-MGE-control.cpp create mode 100644 trunk/paradiseo-eo/test/t-MGE.cpp create mode 100644 trunk/paradiseo-eo/test/t-MGE1bit.cpp create mode 100644 trunk/paradiseo-eo/test/t-eo.cpp create mode 100644 trunk/paradiseo-eo/test/t-eo2dVector.cc create mode 100644 trunk/paradiseo-eo/test/t-eoAtomOps.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoBaseFunctions.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoCMAES.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoCheckpointing.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoESAll.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoESFull.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoESOps.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoEasyEA.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoExternalEO.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoFitnessAssembled.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoFitnessAssembledEA.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoFunctor.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoGA.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoGOpSel.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoGenOp.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoNonUniform.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoPBIL.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoPareto.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoParetoFitness.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoRandom.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoReal.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoReplacement.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoRoulette.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoSSGA.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoSelect.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoSharing.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoStateAndParser.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoSymreg.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoUniform.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoVector.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoVirus.cpp create mode 100644 trunk/paradiseo-eo/test/t-eobin.cpp create mode 100644 trunk/paradiseo-eo/test/t-eobreeder.cpp create mode 100644 trunk/paradiseo-eo/test/t-eofitness.cpp create mode 100644 trunk/paradiseo-eo/test/t-eogeneration.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoinclusion.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoinsertion.cpp create mode 100644 trunk/paradiseo-eo/test/t-eolottery.cpp create mode 100644 trunk/paradiseo-eo/test/t-eoproblem.cpp create mode 100644 trunk/paradiseo-eo/test/t-selectOne.cpp create mode 100644 trunk/paradiseo-eo/tutorial/.cvsignore create mode 100644 trunk/paradiseo-eo/tutorial/CVS/Entries create mode 100644 trunk/paradiseo-eo/tutorial/CVS/Entries.Log create mode 100644 trunk/paradiseo-eo/tutorial/CVS/Repository create mode 100644 trunk/paradiseo-eo/tutorial/CVS/Root create mode 100644 trunk/paradiseo-eo/tutorial/Lesson1/.cvsignore create mode 100644 trunk/paradiseo-eo/tutorial/Lesson1/CVS/Entries create mode 100644 trunk/paradiseo-eo/tutorial/Lesson1/CVS/Repository create mode 100644 trunk/paradiseo-eo/tutorial/Lesson1/CVS/Root create mode 100644 trunk/paradiseo-eo/tutorial/Lesson1/FirstBitGA.cpp create mode 100644 trunk/paradiseo-eo/tutorial/Lesson1/FirstRealGA.cpp create mode 100644 trunk/paradiseo-eo/tutorial/Lesson1/Makefile.am create mode 100644 trunk/paradiseo-eo/tutorial/Lesson1/Makefile.simple create mode 100644 trunk/paradiseo-eo/tutorial/Lesson1/exercise1.3.cpp create mode 100644 trunk/paradiseo-eo/tutorial/Lesson2/.cvsignore create mode 100644 trunk/paradiseo-eo/tutorial/Lesson2/CVS/Entries create mode 100644 trunk/paradiseo-eo/tutorial/Lesson2/CVS/Repository create mode 100644 trunk/paradiseo-eo/tutorial/Lesson2/CVS/Root create mode 100644 trunk/paradiseo-eo/tutorial/Lesson2/FirstBitEA.cpp create mode 100644 trunk/paradiseo-eo/tutorial/Lesson2/FirstRealEA.cpp create mode 100644 trunk/paradiseo-eo/tutorial/Lesson2/Makefile.am create mode 100644 trunk/paradiseo-eo/tutorial/Lesson2/Makefile.simple create mode 100644 trunk/paradiseo-eo/tutorial/Lesson2/binary_value.h create mode 100644 trunk/paradiseo-eo/tutorial/Lesson2/exercise2.3.cpp create mode 100644 trunk/paradiseo-eo/tutorial/Lesson2/real_value.h create mode 100644 trunk/paradiseo-eo/tutorial/Lesson3/.cvsignore create mode 100644 trunk/paradiseo-eo/tutorial/Lesson3/CVS/Entries create mode 100644 trunk/paradiseo-eo/tutorial/Lesson3/CVS/Repository create mode 100644 trunk/paradiseo-eo/tutorial/Lesson3/CVS/Root create mode 100644 trunk/paradiseo-eo/tutorial/Lesson3/Makefile.am create mode 100644 trunk/paradiseo-eo/tutorial/Lesson3/Makefile.simple create mode 100644 trunk/paradiseo-eo/tutorial/Lesson3/SecondBitEA.cpp create mode 100644 trunk/paradiseo-eo/tutorial/Lesson3/SecondRealEA.cpp create mode 100644 trunk/paradiseo-eo/tutorial/Lesson3/binary_value.h create mode 100644 trunk/paradiseo-eo/tutorial/Lesson3/exercise3.1.cpp create mode 100644 trunk/paradiseo-eo/tutorial/Lesson3/real_value.h create mode 100644 trunk/paradiseo-eo/tutorial/Lesson4/.cvsignore create mode 100644 trunk/paradiseo-eo/tutorial/Lesson4/BitEA.cpp create mode 100644 trunk/paradiseo-eo/tutorial/Lesson4/CVS/Entries create mode 100644 trunk/paradiseo-eo/tutorial/Lesson4/CVS/Repository create mode 100644 trunk/paradiseo-eo/tutorial/Lesson4/CVS/Root create mode 100644 trunk/paradiseo-eo/tutorial/Lesson4/ESEA.cpp create mode 100644 trunk/paradiseo-eo/tutorial/Lesson4/ESEA.param create mode 100644 trunk/paradiseo-eo/tutorial/Lesson4/Makefile.am create mode 100644 trunk/paradiseo-eo/tutorial/Lesson4/Makefile.simple create mode 100644 trunk/paradiseo-eo/tutorial/Lesson4/RealEA.cpp create mode 100644 trunk/paradiseo-eo/tutorial/Lesson4/RealEA.param create mode 100644 trunk/paradiseo-eo/tutorial/Lesson4/binary_value.h create mode 100644 trunk/paradiseo-eo/tutorial/Lesson4/real_value.h create mode 100644 trunk/paradiseo-eo/tutorial/Lesson5/.cvsignore create mode 100644 trunk/paradiseo-eo/tutorial/Lesson5/CVS/Entries create mode 100644 trunk/paradiseo-eo/tutorial/Lesson5/CVS/Repository create mode 100644 trunk/paradiseo-eo/tutorial/Lesson5/CVS/Root create mode 100644 trunk/paradiseo-eo/tutorial/Lesson5/Makefile.am create mode 100644 trunk/paradiseo-eo/tutorial/Lesson5/Makefile.simple create mode 100644 trunk/paradiseo-eo/tutorial/Lesson5/OneMaxEA.cpp create mode 100644 trunk/paradiseo-eo/tutorial/Lesson5/OneMaxLibEA.cpp create mode 100644 trunk/paradiseo-eo/tutorial/Lesson5/eoOneMax.h create mode 100644 trunk/paradiseo-eo/tutorial/Lesson5/eoOneMaxEvalFunc.h create mode 100644 trunk/paradiseo-eo/tutorial/Lesson5/eoOneMaxInit.h create mode 100644 trunk/paradiseo-eo/tutorial/Lesson5/eoOneMaxMutation.h create mode 100644 trunk/paradiseo-eo/tutorial/Lesson5/eoOneMaxQuadCrossover.h create mode 100644 trunk/paradiseo-eo/tutorial/Lesson5/make_OneMax.cpp create mode 100644 trunk/paradiseo-eo/tutorial/Lesson5/make_genotype_OneMax.h create mode 100644 trunk/paradiseo-eo/tutorial/Lesson5/make_op_OneMax.h create mode 100644 trunk/paradiseo-eo/tutorial/Makefile.am create mode 100644 trunk/paradiseo-eo/tutorial/Makefile.simple create mode 100644 trunk/paradiseo-eo/tutorial/ParadisEO/CVS/Entries create mode 100644 trunk/paradiseo-eo/tutorial/ParadisEO/CVS/Entries.Log create mode 100644 trunk/paradiseo-eo/tutorial/ParadisEO/CVS/Repository create mode 100644 trunk/paradiseo-eo/tutorial/ParadisEO/CVS/Root create mode 100644 trunk/paradiseo-eo/tutorial/ParadisEO/Lesson1/CVS/Entries create mode 100644 trunk/paradiseo-eo/tutorial/ParadisEO/Lesson1/CVS/Repository create mode 100644 trunk/paradiseo-eo/tutorial/ParadisEO/Lesson1/CVS/Root create mode 100644 trunk/paradiseo-eo/tutorial/ParadisEO/Lesson2/CVS/Entries create mode 100644 trunk/paradiseo-eo/tutorial/ParadisEO/Lesson2/CVS/Repository create mode 100644 trunk/paradiseo-eo/tutorial/ParadisEO/Lesson2/CVS/Root create mode 100644 trunk/paradiseo-eo/tutorial/ParadisEO/Lesson3/CVS/Entries create mode 100644 trunk/paradiseo-eo/tutorial/ParadisEO/Lesson3/CVS/Repository create mode 100644 trunk/paradiseo-eo/tutorial/ParadisEO/Lesson3/CVS/Root create mode 100644 trunk/paradiseo-eo/tutorial/README create mode 100644 trunk/paradiseo-eo/tutorial/Templates/CVS/Entries create mode 100644 trunk/paradiseo-eo/tutorial/Templates/CVS/Repository create mode 100644 trunk/paradiseo-eo/tutorial/Templates/CVS/Root create mode 100644 trunk/paradiseo-eo/tutorial/Templates/EO.tpl create mode 100644 trunk/paradiseo-eo/tutorial/Templates/MakeSimple.tmpl create mode 100644 trunk/paradiseo-eo/tutorial/Templates/Makefile.tmpl create mode 100644 trunk/paradiseo-eo/tutorial/Templates/MyStructEA.cpp create mode 100644 trunk/paradiseo-eo/tutorial/Templates/MyStructLibEA.cpp create mode 100644 trunk/paradiseo-eo/tutorial/Templates/MyStructSEA.cpp create mode 100644 trunk/paradiseo-eo/tutorial/Templates/README create mode 100644 trunk/paradiseo-eo/tutorial/Templates/binCrossover.tmpl create mode 100644 trunk/paradiseo-eo/tutorial/Templates/continue.tmpl create mode 100755 trunk/paradiseo-eo/tutorial/Templates/create.sh create mode 100755 trunk/paradiseo-eo/tutorial/Templates/createSimple create mode 100644 trunk/paradiseo-eo/tutorial/Templates/eoMyStruct.tmpl create mode 100644 trunk/paradiseo-eo/tutorial/Templates/evalFunc.tmpl create mode 100644 trunk/paradiseo-eo/tutorial/Templates/init.tmpl create mode 100644 trunk/paradiseo-eo/tutorial/Templates/lessOffspringExternalSelectorGenOp.tmpl create mode 100644 trunk/paradiseo-eo/tutorial/Templates/lessOffspringSameSelectorGenOp.tmpl create mode 100644 trunk/paradiseo-eo/tutorial/Templates/make_MyStruct.cpp create mode 100644 trunk/paradiseo-eo/tutorial/Templates/make_genotype_MyStruct.h create mode 100644 trunk/paradiseo-eo/tutorial/Templates/make_op_MyStruct.h create mode 100644 trunk/paradiseo-eo/tutorial/Templates/moreOffspringGenOp.tmpl create mode 100644 trunk/paradiseo-eo/tutorial/Templates/mutation.tmpl create mode 100644 trunk/paradiseo-eo/tutorial/Templates/quadCrossover.tmpl create mode 100644 trunk/paradiseo-eo/tutorial/Templates/stat.tmpl create mode 100644 trunk/paradiseo-eo/tutorial/examples/CVS/Entries create mode 100644 trunk/paradiseo-eo/tutorial/examples/CVS/Repository create mode 100644 trunk/paradiseo-eo/tutorial/examples/CVS/Root create mode 100644 trunk/paradiseo-eo/tutorial/html/BitEA.html create mode 100644 trunk/paradiseo-eo/tutorial/html/CVS/Entries create mode 100644 trunk/paradiseo-eo/tutorial/html/CVS/Repository create mode 100644 trunk/paradiseo-eo/tutorial/html/CVS/Root create mode 100644 trunk/paradiseo-eo/tutorial/html/EA_tutorial.jpg create mode 100644 trunk/paradiseo-eo/tutorial/html/FirstBitEA.html create mode 100644 trunk/paradiseo-eo/tutorial/html/FirstBitGA.html create mode 100644 trunk/paradiseo-eo/tutorial/html/FirstRealEA.html create mode 100644 trunk/paradiseo-eo/tutorial/html/FirstRealGA.html create mode 100644 trunk/paradiseo-eo/tutorial/html/Firstmerge.html create mode 100644 trunk/paradiseo-eo/tutorial/html/NoWay.html create mode 100644 trunk/paradiseo-eo/tutorial/html/OneMaxEA.html create mode 100644 trunk/paradiseo-eo/tutorial/html/SecondBitEA.html create mode 100644 trunk/paradiseo-eo/tutorial/html/SecondRealEA.html create mode 100644 trunk/paradiseo-eo/tutorial/html/beige009.jpg create mode 100644 trunk/paradiseo-eo/tutorial/html/binary_value.html create mode 100644 trunk/paradiseo-eo/tutorial/html/debut.html create mode 100644 trunk/paradiseo-eo/tutorial/html/eoBottomUp.html create mode 100644 trunk/paradiseo-eo/tutorial/html/eoCheckPoint.html create mode 100644 trunk/paradiseo-eo/tutorial/html/eoEngine.html create mode 100644 trunk/paradiseo-eo/tutorial/html/eoEval.html create mode 100644 trunk/paradiseo-eo/tutorial/html/eoGeneration.html create mode 100644 trunk/paradiseo-eo/tutorial/html/eoInit.html create mode 100644 trunk/paradiseo-eo/tutorial/html/eoIo.html create mode 100644 trunk/paradiseo-eo/tutorial/html/eoLesson1.html create mode 100644 trunk/paradiseo-eo/tutorial/html/eoLesson2.html create mode 100644 trunk/paradiseo-eo/tutorial/html/eoLesson3.html create mode 100644 trunk/paradiseo-eo/tutorial/html/eoLesson4.html create mode 100644 trunk/paradiseo-eo/tutorial/html/eoLesson5.html create mode 100644 trunk/paradiseo-eo/tutorial/html/eoOneMax.html create mode 100644 trunk/paradiseo-eo/tutorial/html/eoOneMaxEvalFunc.html create mode 100644 trunk/paradiseo-eo/tutorial/html/eoOneMaxInit.html create mode 100644 trunk/paradiseo-eo/tutorial/html/eoOneMaxMutation.html create mode 100644 trunk/paradiseo-eo/tutorial/html/eoOneMaxQuadCrossover.html create mode 100644 trunk/paradiseo-eo/tutorial/html/eoOneMax_complete.html create mode 100644 trunk/paradiseo-eo/tutorial/html/eoOperators.html create mode 100644 trunk/paradiseo-eo/tutorial/html/eoOutput.html create mode 100644 trunk/paradiseo-eo/tutorial/html/eoProgramming.html create mode 100644 trunk/paradiseo-eo/tutorial/html/eoRepresentation.html create mode 100644 trunk/paradiseo-eo/tutorial/html/eoSGA.html create mode 100644 trunk/paradiseo-eo/tutorial/html/eoSelect.html create mode 100644 trunk/paradiseo-eo/tutorial/html/eoStop.html create mode 100644 trunk/paradiseo-eo/tutorial/html/eoTopDown.html create mode 100644 trunk/paradiseo-eo/tutorial/html/eoTutorial.html create mode 100644 trunk/paradiseo-eo/tutorial/html/make_genotype_OneMax.html create mode 100644 trunk/paradiseo-eo/tutorial/html/make_op_OneMax.html create mode 100644 trunk/paradiseo-eo/tutorial/html/real_value.html create mode 100644 trunk/paradiseo-eo/tutorial/index.html create mode 100644 trunk/paradiseo-eo/tutorial/pdf/CVS/Entries create mode 100644 trunk/paradiseo-eo/tutorial/pdf/CVS/Repository create mode 100644 trunk/paradiseo-eo/tutorial/pdf/CVS/Root create mode 100644 trunk/paradiseo-eo/tutorial/pdf/paradiseoJet7.pdf create mode 100644 trunk/paradiseo-eo/win/.cvsignore create mode 100644 trunk/paradiseo-eo/win/CVS/Entries create mode 100644 trunk/paradiseo-eo/win/CVS/Entries.Log create mode 100644 trunk/paradiseo-eo/win/CVS/Repository create mode 100644 trunk/paradiseo-eo/win/CVS/Root create mode 100644 trunk/paradiseo-eo/win/Makefile.am create mode 100644 trunk/paradiseo-eo/win/Readme create mode 100644 trunk/paradiseo-eo/win/all_lib.dsp create mode 100644 trunk/paradiseo-eo/win/all_tests.dsp create mode 100644 trunk/paradiseo-eo/win/all_tut.dsp create mode 100755 trunk/paradiseo-eo/win/create_all_dsp.sh create mode 100755 trunk/paradiseo-eo/win/create_dsp.sh create mode 100755 trunk/paradiseo-eo/win/create_tut.sh create mode 100755 trunk/paradiseo-eo/win/create_tut_para.sh create mode 100644 trunk/paradiseo-eo/win/eo.dsp create mode 100644 trunk/paradiseo-eo/win/eo.dsw create mode 100644 trunk/paradiseo-eo/win/eo.org create mode 100644 trunk/paradiseo-eo/win/es.dsp create mode 100644 trunk/paradiseo-eo/win/ga.dsp create mode 100644 trunk/paradiseo-eo/win/lib/CVS/Entries create mode 100644 trunk/paradiseo-eo/win/lib/CVS/Repository create mode 100644 trunk/paradiseo-eo/win/lib/CVS/Root create mode 100644 trunk/paradiseo-eo/win/lib/Readme create mode 100644 trunk/paradiseo-eo/win/make_snapshot.out create mode 100644 trunk/paradiseo-eo/win/t_eo.dsp create mode 100644 trunk/paradiseo-eo/win/t_eobin.dsp create mode 100644 trunk/paradiseo-eo/win/t_eocheckpointing.dsp create mode 100644 trunk/paradiseo-eo/win/t_eoesall.dsp create mode 100644 trunk/paradiseo-eo/win/t_eoexternaleo.dsp create mode 100644 trunk/paradiseo-eo/win/t_eofitness.dsp create mode 100644 trunk/paradiseo-eo/win/t_eofitnessassembled.dsp create mode 100644 trunk/paradiseo-eo/win/t_eofitnessassembledea.dsp create mode 100644 trunk/paradiseo-eo/win/t_eoga.dsp create mode 100644 trunk/paradiseo-eo/win/t_eogenop.dsp create mode 100644 trunk/paradiseo-eo/win/t_eopareto.dsp create mode 100644 trunk/paradiseo-eo/win/t_eoparetofitness.dsp create mode 100644 trunk/paradiseo-eo/win/t_eopbil.dsp create mode 100644 trunk/paradiseo-eo/win/t_eorandom.dsp create mode 100644 trunk/paradiseo-eo/win/t_eoreal.dsp create mode 100644 trunk/paradiseo-eo/win/t_eoreplacement.dsp create mode 100644 trunk/paradiseo-eo/win/t_eoselect.dsp create mode 100644 trunk/paradiseo-eo/win/t_eossga.dsp create mode 100644 trunk/paradiseo-eo/win/t_eostateandparser.dsp create mode 100644 trunk/paradiseo-eo/win/t_eosymreg.dsp create mode 100644 trunk/paradiseo-eo/win/t_eovector.dsp create mode 100644 trunk/paradiseo-eo/win/t_eovirus.dsp create mode 100644 trunk/paradiseo-eo/win/t_mge-control.dsp create mode 100644 trunk/paradiseo-eo/win/t_mge.dsp create mode 100644 trunk/paradiseo-eo/win/t_mge1bit.dsp create mode 100644 trunk/paradiseo-eo/win/test_dsp.tmpl create mode 100644 trunk/paradiseo-eo/win/tut_1_bit.dsp create mode 100644 trunk/paradiseo-eo/win/tut_1_ex3.dsp create mode 100644 trunk/paradiseo-eo/win/tut_1_real.dsp create mode 100644 trunk/paradiseo-eo/win/tut_2_bit.dsp create mode 100644 trunk/paradiseo-eo/win/tut_2_ex3.dsp create mode 100644 trunk/paradiseo-eo/win/tut_2_real.dsp create mode 100644 trunk/paradiseo-eo/win/tut_3_bit.dsp create mode 100644 trunk/paradiseo-eo/win/tut_3_ex1.dsp create mode 100644 trunk/paradiseo-eo/win/tut_4_bit.dsp create mode 100644 trunk/paradiseo-eo/win/tut_4_es.dsp create mode 100644 trunk/paradiseo-eo/win/tut_4_real.dsp create mode 100644 trunk/paradiseo-eo/win/tut_N_XXX.tmpl create mode 100644 trunk/paradiseo-eo/win/tut_para1_full.dsp create mode 100644 trunk/paradiseo-eo/win/tut_para1_ring1.dsp create mode 100644 trunk/paradiseo-eo/win/tut_para1_ring2.dsp create mode 100644 trunk/paradiseo-eo/win/tut_para2_master.dsp create mode 100644 trunk/paradiseo-eo/win/tut_para2_slave.dsp create mode 100644 trunk/paradiseo-eo/win/tut_paraN_XXX.tmpl create mode 100644 trunk/paradiseo-eo/win/utils.dsp diff --git a/trunk/paradiseo-eo/.cvsignore b/trunk/paradiseo-eo/.cvsignore new file mode 100644 index 000000000..3e34ecb4c --- /dev/null +++ b/trunk/paradiseo-eo/.cvsignore @@ -0,0 +1,25 @@ +*.la +*.lo +.deps +.libs +Makefile +Makefile.in +aclocal.m4 +autom4te.cache +build* +confdefs.h +config.cache +config.guess +config.h +config.h.in +config.log +config.status +config.sub +configure +depcomp +install-sh +libtool +missing +mkinstalldirs +stamp-h +stamp-h.in diff --git a/trunk/paradiseo-eo/AUTHORS b/trunk/paradiseo-eo/AUTHORS new file mode 100644 index 000000000..298d1c11b --- /dev/null +++ b/trunk/paradiseo-eo/AUTHORS @@ -0,0 +1,8 @@ +Pedro Angel Castillo Valdivieso +Juan Julian Merelo Guervos +Victor Manuel Rivas Santos +Gustavo Romero Lopez +Maarten Keijzer +Marc Schoenauer +Jeroen Eggermont + diff --git a/trunk/paradiseo-eo/COPYING b/trunk/paradiseo-eo/COPYING new file mode 100644 index 000000000..223ede7de --- /dev/null +++ b/trunk/paradiseo-eo/COPYING @@ -0,0 +1,504 @@ + GNU LESSER GENERAL PUBLIC LICENSE + Version 2.1, February 1999 + + Copyright (C) 1991, 1999 Free Software Foundation, Inc. + 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + +[This is the first released version of the Lesser GPL. It also counts + as the successor of the GNU Library Public License, version 2, hence + the version number 2.1.] + + Preamble + + The licenses for most software are designed to take away your +freedom to share and change it. By contrast, the GNU General Public +Licenses are intended to guarantee your freedom to share and change +free software--to make sure the software is free for all its users. + + This license, the Lesser General Public License, applies to some +specially designated software packages--typically libraries--of the +Free Software Foundation and other authors who decide to use it. You +can use it too, but we suggest you first think carefully about whether +this license or the ordinary General Public License is the better +strategy to use in any particular case, based on the explanations below. + + When we speak of free software, we are referring to freedom of use, +not price. Our General Public Licenses are designed to make sure that +you have the freedom to distribute copies of free software (and charge +for this service if you wish); that you receive source code or can get +it if you want it; that you can change the software and use pieces of +it in new free programs; and that you are informed that you can do +these things. + + To protect your rights, we need to make restrictions that forbid +distributors to deny you these rights or to ask you to surrender these +rights. These restrictions translate to certain responsibilities for +you if you distribute copies of the library or if you modify it. + + For example, if you distribute copies of the library, whether gratis +or for a fee, you must give the recipients all the rights that we gave +you. You must make sure that they, too, receive or can get the source +code. If you link other code with the library, you must provide +complete object files to the recipients, so that they can relink them +with the library after making changes to the library and recompiling +it. And you must show them these terms so they know their rights. + + We protect your rights with a two-step method: (1) we copyright the +library, and (2) we offer you this license, which gives you legal +permission to copy, distribute and/or modify the library. + + To protect each distributor, we want to make it very clear that +there is no warranty for the free library. Also, if the library is +modified by someone else and passed on, the recipients should know +that what they have is not the original version, so that the original +author's reputation will not be affected by problems that might be +introduced by others. + + Finally, software patents pose a constant threat to the existence of +any free program. We wish to make sure that a company cannot +effectively restrict the users of a free program by obtaining a +restrictive license from a patent holder. Therefore, we insist that +any patent license obtained for a version of the library must be +consistent with the full freedom of use specified in this license. + + Most GNU software, including some libraries, is covered by the +ordinary GNU General Public License. This license, the GNU Lesser +General Public License, applies to certain designated libraries, and +is quite different from the ordinary General Public License. We use +this license for certain libraries in order to permit linking those +libraries into non-free programs. + + When a program is linked with a library, whether statically or using +a shared library, the combination of the two is legally speaking a +combined work, a derivative of the original library. The ordinary +General Public License therefore permits such linking only if the +entire combination fits its criteria of freedom. The Lesser General +Public License permits more lax criteria for linking other code with +the library. + + We call this license the "Lesser" General Public License because it +does Less to protect the user's freedom than the ordinary General +Public License. It also provides other free software developers Less +of an advantage over competing non-free programs. These disadvantages +are the reason we use the ordinary General Public License for many +libraries. However, the Lesser license provides advantages in certain +special circumstances. + + For example, on rare occasions, there may be a special need to +encourage the widest possible use of a certain library, so that it becomes +a de-facto standard. To achieve this, non-free programs must be +allowed to use the library. A more frequent case is that a free +library does the same job as widely used non-free libraries. In this +case, there is little to gain by limiting the free library to free +software only, so we use the Lesser General Public License. + + In other cases, permission to use a particular library in non-free +programs enables a greater number of people to use a large body of +free software. For example, permission to use the GNU C Library in +non-free programs enables many more people to use the whole GNU +operating system, as well as its variant, the GNU/Linux operating +system. + + Although the Lesser General Public License is Less protective of the +users' freedom, it does ensure that the user of a program that is +linked with the Library has the freedom and the wherewithal to run +that program using a modified version of the Library. + + The precise terms and conditions for copying, distribution and +modification follow. Pay close attention to the difference between a +"work based on the library" and a "work that uses the library". The +former contains code derived from the library, whereas the latter must +be combined with the library in order to run. + + GNU LESSER GENERAL PUBLIC LICENSE + TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION + + 0. This License Agreement applies to any software library or other +program which contains a notice placed by the copyright holder or +other authorized party saying it may be distributed under the terms of +this Lesser General Public License (also called "this License"). +Each licensee is addressed as "you". + + A "library" means a collection of software functions and/or data +prepared so as to be conveniently linked with application programs +(which use some of those functions and data) to form executables. + + The "Library", below, refers to any such software library or work +which has been distributed under these terms. A "work based on the +Library" means either the Library or any derivative work under +copyright law: that is to say, a work containing the Library or a +portion of it, either verbatim or with modifications and/or translated +straightforwardly into another language. (Hereinafter, translation is +included without limitation in the term "modification".) + + "Source code" for a work means the preferred form of the work for +making modifications to it. For a library, complete source code means +all the source code for all modules it contains, plus any associated +interface definition files, plus the scripts used to control compilation +and installation of the library. + + Activities other than copying, distribution and modification are not +covered by this License; they are outside its scope. The act of +running a program using the Library is not restricted, and output from +such a program is covered only if its contents constitute a work based +on the Library (independent of the use of the Library in a tool for +writing it). Whether that is true depends on what the Library does +and what the program that uses the Library does. + + 1. You may copy and distribute verbatim copies of the Library's +complete source code as you receive it, in any medium, provided that +you conspicuously and appropriately publish on each copy an +appropriate copyright notice and disclaimer of warranty; keep intact +all the notices that refer to this License and to the absence of any +warranty; and distribute a copy of this License along with the +Library. + + You may charge a fee for the physical act of transferring a copy, +and you may at your option offer warranty protection in exchange for a +fee. + + 2. You may modify your copy or copies of the Library or any portion +of it, thus forming a work based on the Library, and copy and +distribute such modifications or work under the terms of Section 1 +above, provided that you also meet all of these conditions: + + a) The modified work must itself be a software library. + + b) You must cause the files modified to carry prominent notices + stating that you changed the files and the date of any change. + + c) You must cause the whole of the work to be licensed at no + charge to all third parties under the terms of this License. + + d) If a facility in the modified Library refers to a function or a + table of data to be supplied by an application program that uses + the facility, other than as an argument passed when the facility + is invoked, then you must make a good faith effort to ensure that, + in the event an application does not supply such function or + table, the facility still operates, and performs whatever part of + its purpose remains meaningful. + + (For example, a function in a library to compute square roots has + a purpose that is entirely well-defined independent of the + application. Therefore, Subsection 2d requires that any + application-supplied function or table used by this function must + be optional: if the application does not supply it, the square + root function must still compute square roots.) + +These requirements apply to the modified work as a whole. If +identifiable sections of that work are not derived from the Library, +and can be reasonably considered independent and separate works in +themselves, then this License, and its terms, do not apply to those +sections when you distribute them as separate works. But when you +distribute the same sections as part of a whole which is a work based +on the Library, the distribution of the whole must be on the terms of +this License, whose permissions for other licensees extend to the +entire whole, and thus to each and every part regardless of who wrote +it. + +Thus, it is not the intent of this section to claim rights or contest +your rights to work written entirely by you; rather, the intent is to +exercise the right to control the distribution of derivative or +collective works based on the Library. + +In addition, mere aggregation of another work not based on the Library +with the Library (or with a work based on the Library) on a volume of +a storage or distribution medium does not bring the other work under +the scope of this License. + + 3. You may opt to apply the terms of the ordinary GNU General Public +License instead of this License to a given copy of the Library. To do +this, you must alter all the notices that refer to this License, so +that they refer to the ordinary GNU General Public License, version 2, +instead of to this License. (If a newer version than version 2 of the +ordinary GNU General Public License has appeared, then you can specify +that version instead if you wish.) Do not make any other change in +these notices. + + Once this change is made in a given copy, it is irreversible for +that copy, so the ordinary GNU General Public License applies to all +subsequent copies and derivative works made from that copy. + + This option is useful when you wish to copy part of the code of +the Library into a program that is not a library. + + 4. You may copy and distribute the Library (or a portion or +derivative of it, under Section 2) in object code or executable form +under the terms of Sections 1 and 2 above provided that you accompany +it with the complete corresponding machine-readable source code, which +must be distributed under the terms of Sections 1 and 2 above on a +medium customarily used for software interchange. + + If distribution of object code is made by offering access to copy +from a designated place, then offering equivalent access to copy the +source code from the same place satisfies the requirement to +distribute the source code, even though third parties are not +compelled to copy the source along with the object code. + + 5. A program that contains no derivative of any portion of the +Library, but is designed to work with the Library by being compiled or +linked with it, is called a "work that uses the Library". Such a +work, in isolation, is not a derivative work of the Library, and +therefore falls outside the scope of this License. + + However, linking a "work that uses the Library" with the Library +creates an executable that is a derivative of the Library (because it +contains portions of the Library), rather than a "work that uses the +library". The executable is therefore covered by this License. +Section 6 states terms for distribution of such executables. + + When a "work that uses the Library" uses material from a header file +that is part of the Library, the object code for the work may be a +derivative work of the Library even though the source code is not. +Whether this is true is especially significant if the work can be +linked without the Library, or if the work is itself a library. The +threshold for this to be true is not precisely defined by law. + + If such an object file uses only numerical parameters, data +structure layouts and accessors, and small macros and small inline +functions (ten lines or less in length), then the use of the object +file is unrestricted, regardless of whether it is legally a derivative +work. (Executables containing this object code plus portions of the +Library will still fall under Section 6.) + + Otherwise, if the work is a derivative of the Library, you may +distribute the object code for the work under the terms of Section 6. +Any executables containing that work also fall under Section 6, +whether or not they are linked directly with the Library itself. + + 6. As an exception to the Sections above, you may also combine or +link a "work that uses the Library" with the Library to produce a +work containing portions of the Library, and distribute that work +under terms of your choice, provided that the terms permit +modification of the work for the customer's own use and reverse +engineering for debugging such modifications. + + You must give prominent notice with each copy of the work that the +Library is used in it and that the Library and its use are covered by +this License. You must supply a copy of this License. If the work +during execution displays copyright notices, you must include the +copyright notice for the Library among them, as well as a reference +directing the user to the copy of this License. Also, you must do one +of these things: + + a) Accompany the work with the complete corresponding + machine-readable source code for the Library including whatever + changes were used in the work (which must be distributed under + Sections 1 and 2 above); and, if the work is an executable linked + with the Library, with the complete machine-readable "work that + uses the Library", as object code and/or source code, so that the + user can modify the Library and then relink to produce a modified + executable containing the modified Library. (It is understood + that the user who changes the contents of definitions files in the + Library will not necessarily be able to recompile the application + to use the modified definitions.) + + b) Use a suitable shared library mechanism for linking with the + Library. A suitable mechanism is one that (1) uses at run time a + copy of the library already present on the user's computer system, + rather than copying library functions into the executable, and (2) + will operate properly with a modified version of the library, if + the user installs one, as long as the modified version is + interface-compatible with the version that the work was made with. + + c) Accompany the work with a written offer, valid for at + least three years, to give the same user the materials + specified in Subsection 6a, above, for a charge no more + than the cost of performing this distribution. + + d) If distribution of the work is made by offering access to copy + from a designated place, offer equivalent access to copy the above + specified materials from the same place. + + e) Verify that the user has already received a copy of these + materials or that you have already sent this user a copy. + + For an executable, the required form of the "work that uses the +Library" must include any data and utility programs needed for +reproducing the executable from it. However, as a special exception, +the materials to be distributed need not include anything that is +normally distributed (in either source or binary form) with the major +components (compiler, kernel, and so on) of the operating system on +which the executable runs, unless that component itself accompanies +the executable. + + It may happen that this requirement contradicts the license +restrictions of other proprietary libraries that do not normally +accompany the operating system. Such a contradiction means you cannot +use both them and the Library together in an executable that you +distribute. + + 7. You may place library facilities that are a work based on the +Library side-by-side in a single library together with other library +facilities not covered by this License, and distribute such a combined +library, provided that the separate distribution of the work based on +the Library and of the other library facilities is otherwise +permitted, and provided that you do these two things: + + a) Accompany the combined library with a copy of the same work + based on the Library, uncombined with any other library + facilities. This must be distributed under the terms of the + Sections above. + + b) Give prominent notice with the combined library of the fact + that part of it is a work based on the Library, and explaining + where to find the accompanying uncombined form of the same work. + + 8. You may not copy, modify, sublicense, link with, or distribute +the Library except as expressly provided under this License. Any +attempt otherwise to copy, modify, sublicense, link with, or +distribute the Library is void, and will automatically terminate your +rights under this License. However, parties who have received copies, +or rights, from you under this License will not have their licenses +terminated so long as such parties remain in full compliance. + + 9. You are not required to accept this License, since you have not +signed it. However, nothing else grants you permission to modify or +distribute the Library or its derivative works. These actions are +prohibited by law if you do not accept this License. Therefore, by +modifying or distributing the Library (or any work based on the +Library), you indicate your acceptance of this License to do so, and +all its terms and conditions for copying, distributing or modifying +the Library or works based on it. + + 10. Each time you redistribute the Library (or any work based on the +Library), the recipient automatically receives a license from the +original licensor to copy, distribute, link with or modify the Library +subject to these terms and conditions. You may not impose any further +restrictions on the recipients' exercise of the rights granted herein. +You are not responsible for enforcing compliance by third parties with +this License. + + 11. If, as a consequence of a court judgment or allegation of patent +infringement or for any other reason (not limited to patent issues), +conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot +distribute so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you +may not distribute the Library at all. For example, if a patent +license would not permit royalty-free redistribution of the Library by +all those who receive copies directly or indirectly through you, then +the only way you could satisfy both it and this License would be to +refrain entirely from distribution of the Library. + +If any portion of this section is held invalid or unenforceable under any +particular circumstance, the balance of the section is intended to apply, +and the section as a whole is intended to apply in other circumstances. + +It is not the purpose of this section to induce you to infringe any +patents or other property right claims or to contest validity of any +such claims; this section has the sole purpose of protecting the +integrity of the free software distribution system which is +implemented by public license practices. Many people have made +generous contributions to the wide range of software distributed +through that system in reliance on consistent application of that +system; it is up to the author/donor to decide if he or she is willing +to distribute software through any other system and a licensee cannot +impose that choice. + +This section is intended to make thoroughly clear what is believed to +be a consequence of the rest of this License. + + 12. If the distribution and/or use of the Library is restricted in +certain countries either by patents or by copyrighted interfaces, the +original copyright holder who places the Library under this License may add +an explicit geographical distribution limitation excluding those countries, +so that distribution is permitted only in or among countries not thus +excluded. In such case, this License incorporates the limitation as if +written in the body of this License. + + 13. The Free Software Foundation may publish revised and/or new +versions of the Lesser General Public License from time to time. +Such new versions will be similar in spirit to the present version, +but may differ in detail to address new problems or concerns. + +Each version is given a distinguishing version number. If the Library +specifies a version number of this License which applies to it and +"any later version", you have the option of following the terms and +conditions either of that version or of any later version published by +the Free Software Foundation. If the Library does not specify a +license version number, you may choose any version ever published by +the Free Software Foundation. + + 14. If you wish to incorporate parts of the Library into other free +programs whose distribution conditions are incompatible with these, +write to the author to ask for permission. For software which is +copyrighted by the Free Software Foundation, write to the Free +Software Foundation; we sometimes make exceptions for this. Our +decision will be guided by the two goals of preserving the free status +of all derivatives of our free software and of promoting the sharing +and reuse of software generally. + + NO WARRANTY + + 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO +WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. +EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR +OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY +KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE +IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE +LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME +THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN +WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY +AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU +FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR +CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE +LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING +RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A +FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF +SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH +DAMAGES. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Libraries + + If you develop a new library, and you want it to be of the greatest +possible use to the public, we recommend making it free software that +everyone can redistribute and change. You can do so by permitting +redistribution under these terms (or, alternatively, under the terms of the +ordinary General Public License). + + To apply these terms, attach the following notices to the library. It is +safest to attach them to the start of each source file to most effectively +convey the exclusion of warranty; and each file should have at least the +"copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This library is free software; you can redistribute it and/or + modify it under the terms of the GNU Lesser General Public + License as published by the Free Software Foundation; either + version 2 of the License, or (at your option) any later version. + + This library is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + Lesser General Public License for more details. + + You should have received a copy of the GNU Lesser General Public + License along with this library; if not, write to the Free Software + Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + +Also add information on how to contact you by electronic and paper mail. + +You should also get your employer (if you work as a programmer) or your +school, if any, to sign a "copyright disclaimer" for the library, if +necessary. Here is a sample; alter the names: + + Yoyodyne, Inc., hereby disclaims all copyright interest in the + library `Frob' (a library for tweaking knobs) written by James Random Hacker. + + , 1 April 1990 + Ty Coon, President of Vice + +That's all there is to it! + + diff --git a/trunk/paradiseo-eo/CVS/Entries b/trunk/paradiseo-eo/CVS/Entries new file mode 100644 index 000000000..ed48183b3 --- /dev/null +++ b/trunk/paradiseo-eo/CVS/Entries @@ -0,0 +1,17 @@ +/.cvsignore/5.7/Tue Sep 21 17:01:14 2004// +/AUTHORS/5.5/Mon Nov 12 14:59:32 2001// +/COPYING/5.3/Thu Oct 6 10:06:25 2005// +/ChangeLog/5.1/Fri Feb 12 17:38:58 1999// +/ForRelease/5.2/Sat Oct 1 16:05:01 2005// +/INSTALL/5.4/Fri Sep 17 16:53:31 2004// +/LICENSE/5.1/Mon Sep 20 11:37:00 1999// +/Makefile.am/5.30/Sun Oct 2 21:42:08 2005// +/NEWS/5.5/Sun Mar 26 10:04:00 2006// +/README/5.9/Fri Sep 30 21:16:24 2005// +/README.html/5.1/Thu Aug 3 15:44:00 2000// +/THANKS/5.1/Wed Sep 22 17:30:11 2004// +/TODO.html/5.1/Thu Aug 3 15:44:00 2000// +/acinclude.m4/5.11/Thu Mar 23 18:06:10 2006// +/autogen.sh/5.14/Sun Oct 2 21:42:08 2005// +/configure.in/5.47/Sun Oct 2 21:42:08 2005// +D diff --git a/trunk/paradiseo-eo/CVS/Entries.Log b/trunk/paradiseo-eo/CVS/Entries.Log new file mode 100644 index 000000000..7f0c96b10 --- /dev/null +++ b/trunk/paradiseo-eo/CVS/Entries.Log @@ -0,0 +1,11 @@ +A D/Tutorial//// +A D/app//// +A D/build-freebsd-x86//// +A D/build-linux-x86//// +A D/contrib//// +A D/doc//// +A D/gp//// +A D/src//// +A D/test//// +A D/tutorial//// +A D/win//// diff --git a/trunk/paradiseo-eo/CVS/Repository b/trunk/paradiseo-eo/CVS/Repository new file mode 100644 index 000000000..16381313e --- /dev/null +++ b/trunk/paradiseo-eo/CVS/Repository @@ -0,0 +1 @@ +eo diff --git a/trunk/paradiseo-eo/CVS/Root b/trunk/paradiseo-eo/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/ChangeLog b/trunk/paradiseo-eo/ChangeLog new file mode 100644 index 000000000..e69de29bb diff --git a/trunk/paradiseo-eo/ForRelease b/trunk/paradiseo-eo/ForRelease new file mode 100644 index 000000000..6e9af59a7 --- /dev/null +++ b/trunk/paradiseo-eo/ForRelease @@ -0,0 +1,17 @@ +In oder to create a new release from the current cvs sources perform +the following steps: + +- Set version number in configure.in and doc/eo.cfg. +- Check/update NEWS file, set release date and version in NEWS. +- Run `make check && make dist`. +- Test distribution (unpack, configure, make check). +- Put distributions at SourceForge. +- Post news on SourceForge project-page. +- Send announcement to mailing lists. +- Bump version number to next x.y.z-cvs in configure.in and doc/eo.cfg. + +# Local Variables: +# coding: iso-8859-1 +# mode: text +# fill-column: 80 +# End: diff --git a/trunk/paradiseo-eo/INSTALL b/trunk/paradiseo-eo/INSTALL new file mode 100644 index 000000000..a4b34144d --- /dev/null +++ b/trunk/paradiseo-eo/INSTALL @@ -0,0 +1,229 @@ +Copyright 1994, 1995, 1996, 1999, 2000, 2001, 2002 Free Software +Foundation, Inc. + + This file is free documentation; the Free Software Foundation gives +unlimited permission to copy, distribute and modify it. + +Basic Installation +================== + + These are generic installation instructions. + + The `configure' shell script attempts to guess correct values for +various system-dependent variables used during compilation. It uses +those values to create a `Makefile' in each directory of the package. +It may also create one or more `.h' files containing system-dependent +definitions. Finally, it creates a shell script `config.status' that +you can run in the future to recreate the current configuration, and a +file `config.log' containing compiler output (useful mainly for +debugging `configure'). + + It can also use an optional file (typically called `config.cache' +and enabled with `--cache-file=config.cache' or simply `-C') that saves +the results of its tests to speed up reconfiguring. (Caching is +disabled by default to prevent problems with accidental use of stale +cache files.) + + If you need to do unusual things to compile the package, please try +to figure out how `configure' could check whether to do them, and mail +diffs or instructions to the address given in the `README' so they can +be considered for the next release. If you are using the cache, and at +some point `config.cache' contains results you don't want to keep, you +may remove or edit it. + + The file `configure.ac' (or `configure.in') is used to create +`configure' by a program called `autoconf'. You only need +`configure.ac' if you want to change it or regenerate `configure' using +a newer version of `autoconf'. + +The simplest way to compile this package is: + + 1. `cd' to the directory containing the package's source code and type + `./configure' to configure the package for your system. If you're + using `csh' on an old version of System V, you might need to type + `sh ./configure' instead to prevent `csh' from trying to execute + `configure' itself. + + Running `configure' takes awhile. While running, it prints some + messages telling which features it is checking for. + + 2. Type `make' to compile the package. + + 3. Optionally, type `make check' to run any self-tests that come with + the package. + + 4. Type `make install' to install the programs and any data files and + documentation. + + 5. You can remove the program binaries and object files from the + source code directory by typing `make clean'. To also remove the + files that `configure' created (so you can compile the package for + a different kind of computer), type `make distclean'. There is + also a `make maintainer-clean' target, but that is intended mainly + for the package's developers. If you use it, you may have to get + all sorts of other programs in order to regenerate files that came + with the distribution. + +Compilers and Options +===================== + + Some systems require unusual options for compilation or linking that +the `configure' script does not know about. Run `./configure --help' +for details on some of the pertinent environment variables. + + You can give `configure' initial values for configuration parameters +by setting variables in the command line or in the environment. Here +is an example: + + ./configure CC=c89 CFLAGS=-O2 LIBS=-lposix + + *Note Defining Variables::, for more details. + +Compiling For Multiple Architectures +==================================== + + You can compile the package for more than one kind of computer at the +same time, by placing the object files for each architecture in their +own directory. To do this, you must use a version of `make' that +supports the `VPATH' variable, such as GNU `make'. `cd' to the +directory where you want the object files and executables to go and run +the `configure' script. `configure' automatically checks for the +source code in the directory that `configure' is in and in `..'. + + If you have to use a `make' that does not support the `VPATH' +variable, you have to compile the package for one architecture at a +time in the source code directory. After you have installed the +package for one architecture, use `make distclean' before reconfiguring +for another architecture. + +Installation Names +================== + + By default, `make install' will install the package's files in +`/usr/local/bin', `/usr/local/man', etc. You can specify an +installation prefix other than `/usr/local' by giving `configure' the +option `--prefix=PATH'. + + You can specify separate installation prefixes for +architecture-specific files and architecture-independent files. If you +give `configure' the option `--exec-prefix=PATH', the package will use +PATH as the prefix for installing programs and libraries. +Documentation and other data files will still use the regular prefix. + + In addition, if you use an unusual directory layout you can give +options like `--bindir=PATH' to specify different values for particular +kinds of files. Run `configure --help' for a list of the directories +you can set and what kinds of files go in them. + + If the package supports it, you can cause programs to be installed +with an extra prefix or suffix on their names by giving `configure' the +option `--program-prefix=PREFIX' or `--program-suffix=SUFFIX'. + +Optional Features +================= + + Some packages pay attention to `--enable-FEATURE' options to +`configure', where FEATURE indicates an optional part of the package. +They may also pay attention to `--with-PACKAGE' options, where PACKAGE +is something like `gnu-as' or `x' (for the X Window System). The +`README' should mention any `--enable-' and `--with-' options that the +package recognizes. + + For packages that use the X Window System, `configure' can usually +find the X include and library files automatically, but if it doesn't, +you can use the `configure' options `--x-includes=DIR' and +`--x-libraries=DIR' to specify their locations. + +Specifying the System Type +========================== + + There may be some features `configure' cannot figure out +automatically, but needs to determine by the type of machine the package +will run on. Usually, assuming the package is built to be run on the +_same_ architectures, `configure' can figure that out, but if it prints +a message saying it cannot guess the machine type, give it the +`--build=TYPE' option. TYPE can either be a short name for the system +type, such as `sun4', or a canonical name which has the form: + + CPU-COMPANY-SYSTEM + +where SYSTEM can have one of these forms: + + OS KERNEL-OS + + See the file `config.sub' for the possible values of each field. If +`config.sub' isn't included in this package, then this package doesn't +need to know the machine type. + + If you are _building_ compiler tools for cross-compiling, you should +use the `--target=TYPE' option to select the type of system they will +produce code for. + + If you want to _use_ a cross compiler, that generates code for a +platform different from the build platform, you should specify the +"host" platform (i.e., that on which the generated programs will +eventually be run) with `--host=TYPE'. + +Sharing Defaults +================ + + If you want to set default values for `configure' scripts to share, +you can create a site shell script called `config.site' that gives +default values for variables like `CC', `cache_file', and `prefix'. +`configure' looks for `PREFIX/share/config.site' if it exists, then +`PREFIX/etc/config.site' if it exists. Or, you can set the +`CONFIG_SITE' environment variable to the location of the site script. +A warning: not all `configure' scripts look for a site script. + +Defining Variables +================== + + Variables not defined in a site shell script can be set in the +environment passed to `configure'. However, some packages may run +configure again during the build, and the customized values of these +variables may be lost. In order to avoid this problem, you should set +them in the `configure' command line, using `VAR=value'. For example: + + ./configure CC=/usr/local2/bin/gcc + +will cause the specified gcc to be used as the C compiler (unless it is +overridden in the site shell script). + +`configure' Invocation +====================== + + `configure' recognizes the following options to control how it +operates. + +`--help' +`-h' + Print a summary of the options to `configure', and exit. + +`--version' +`-V' + Print the version of Autoconf used to generate the `configure' + script, and exit. + +`--cache-file=FILE' + Enable the cache: use and save the results of the tests in FILE, + traditionally `config.cache'. FILE defaults to `/dev/null' to + disable caching. + +`--config-cache' +`-C' + Alias for `--cache-file=config.cache'. + +`--quiet' +`--silent' +`-q' + Do not print messages saying which checks are being made. To + suppress all normal output, redirect it to `/dev/null' (any error + messages will still be shown). + +`--srcdir=DIR' + Look for the package's source code in directory DIR. Usually + `configure' can determine that directory automatically. + +`configure' also accepts some other, not widely useful, options. Run +`configure --help' for more details. + diff --git a/trunk/paradiseo-eo/LICENSE b/trunk/paradiseo-eo/LICENSE new file mode 100644 index 000000000..223ede7de --- /dev/null +++ b/trunk/paradiseo-eo/LICENSE @@ -0,0 +1,504 @@ + GNU LESSER GENERAL PUBLIC LICENSE + Version 2.1, February 1999 + + Copyright (C) 1991, 1999 Free Software Foundation, Inc. + 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + +[This is the first released version of the Lesser GPL. It also counts + as the successor of the GNU Library Public License, version 2, hence + the version number 2.1.] + + Preamble + + The licenses for most software are designed to take away your +freedom to share and change it. By contrast, the GNU General Public +Licenses are intended to guarantee your freedom to share and change +free software--to make sure the software is free for all its users. + + This license, the Lesser General Public License, applies to some +specially designated software packages--typically libraries--of the +Free Software Foundation and other authors who decide to use it. You +can use it too, but we suggest you first think carefully about whether +this license or the ordinary General Public License is the better +strategy to use in any particular case, based on the explanations below. + + When we speak of free software, we are referring to freedom of use, +not price. Our General Public Licenses are designed to make sure that +you have the freedom to distribute copies of free software (and charge +for this service if you wish); that you receive source code or can get +it if you want it; that you can change the software and use pieces of +it in new free programs; and that you are informed that you can do +these things. + + To protect your rights, we need to make restrictions that forbid +distributors to deny you these rights or to ask you to surrender these +rights. These restrictions translate to certain responsibilities for +you if you distribute copies of the library or if you modify it. + + For example, if you distribute copies of the library, whether gratis +or for a fee, you must give the recipients all the rights that we gave +you. You must make sure that they, too, receive or can get the source +code. If you link other code with the library, you must provide +complete object files to the recipients, so that they can relink them +with the library after making changes to the library and recompiling +it. And you must show them these terms so they know their rights. + + We protect your rights with a two-step method: (1) we copyright the +library, and (2) we offer you this license, which gives you legal +permission to copy, distribute and/or modify the library. + + To protect each distributor, we want to make it very clear that +there is no warranty for the free library. Also, if the library is +modified by someone else and passed on, the recipients should know +that what they have is not the original version, so that the original +author's reputation will not be affected by problems that might be +introduced by others. + + Finally, software patents pose a constant threat to the existence of +any free program. We wish to make sure that a company cannot +effectively restrict the users of a free program by obtaining a +restrictive license from a patent holder. Therefore, we insist that +any patent license obtained for a version of the library must be +consistent with the full freedom of use specified in this license. + + Most GNU software, including some libraries, is covered by the +ordinary GNU General Public License. This license, the GNU Lesser +General Public License, applies to certain designated libraries, and +is quite different from the ordinary General Public License. We use +this license for certain libraries in order to permit linking those +libraries into non-free programs. + + When a program is linked with a library, whether statically or using +a shared library, the combination of the two is legally speaking a +combined work, a derivative of the original library. The ordinary +General Public License therefore permits such linking only if the +entire combination fits its criteria of freedom. The Lesser General +Public License permits more lax criteria for linking other code with +the library. + + We call this license the "Lesser" General Public License because it +does Less to protect the user's freedom than the ordinary General +Public License. It also provides other free software developers Less +of an advantage over competing non-free programs. These disadvantages +are the reason we use the ordinary General Public License for many +libraries. However, the Lesser license provides advantages in certain +special circumstances. + + For example, on rare occasions, there may be a special need to +encourage the widest possible use of a certain library, so that it becomes +a de-facto standard. To achieve this, non-free programs must be +allowed to use the library. A more frequent case is that a free +library does the same job as widely used non-free libraries. In this +case, there is little to gain by limiting the free library to free +software only, so we use the Lesser General Public License. + + In other cases, permission to use a particular library in non-free +programs enables a greater number of people to use a large body of +free software. For example, permission to use the GNU C Library in +non-free programs enables many more people to use the whole GNU +operating system, as well as its variant, the GNU/Linux operating +system. + + Although the Lesser General Public License is Less protective of the +users' freedom, it does ensure that the user of a program that is +linked with the Library has the freedom and the wherewithal to run +that program using a modified version of the Library. + + The precise terms and conditions for copying, distribution and +modification follow. Pay close attention to the difference between a +"work based on the library" and a "work that uses the library". The +former contains code derived from the library, whereas the latter must +be combined with the library in order to run. + + GNU LESSER GENERAL PUBLIC LICENSE + TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION + + 0. This License Agreement applies to any software library or other +program which contains a notice placed by the copyright holder or +other authorized party saying it may be distributed under the terms of +this Lesser General Public License (also called "this License"). +Each licensee is addressed as "you". + + A "library" means a collection of software functions and/or data +prepared so as to be conveniently linked with application programs +(which use some of those functions and data) to form executables. + + The "Library", below, refers to any such software library or work +which has been distributed under these terms. A "work based on the +Library" means either the Library or any derivative work under +copyright law: that is to say, a work containing the Library or a +portion of it, either verbatim or with modifications and/or translated +straightforwardly into another language. (Hereinafter, translation is +included without limitation in the term "modification".) + + "Source code" for a work means the preferred form of the work for +making modifications to it. For a library, complete source code means +all the source code for all modules it contains, plus any associated +interface definition files, plus the scripts used to control compilation +and installation of the library. + + Activities other than copying, distribution and modification are not +covered by this License; they are outside its scope. The act of +running a program using the Library is not restricted, and output from +such a program is covered only if its contents constitute a work based +on the Library (independent of the use of the Library in a tool for +writing it). Whether that is true depends on what the Library does +and what the program that uses the Library does. + + 1. You may copy and distribute verbatim copies of the Library's +complete source code as you receive it, in any medium, provided that +you conspicuously and appropriately publish on each copy an +appropriate copyright notice and disclaimer of warranty; keep intact +all the notices that refer to this License and to the absence of any +warranty; and distribute a copy of this License along with the +Library. + + You may charge a fee for the physical act of transferring a copy, +and you may at your option offer warranty protection in exchange for a +fee. + + 2. You may modify your copy or copies of the Library or any portion +of it, thus forming a work based on the Library, and copy and +distribute such modifications or work under the terms of Section 1 +above, provided that you also meet all of these conditions: + + a) The modified work must itself be a software library. + + b) You must cause the files modified to carry prominent notices + stating that you changed the files and the date of any change. + + c) You must cause the whole of the work to be licensed at no + charge to all third parties under the terms of this License. + + d) If a facility in the modified Library refers to a function or a + table of data to be supplied by an application program that uses + the facility, other than as an argument passed when the facility + is invoked, then you must make a good faith effort to ensure that, + in the event an application does not supply such function or + table, the facility still operates, and performs whatever part of + its purpose remains meaningful. + + (For example, a function in a library to compute square roots has + a purpose that is entirely well-defined independent of the + application. Therefore, Subsection 2d requires that any + application-supplied function or table used by this function must + be optional: if the application does not supply it, the square + root function must still compute square roots.) + +These requirements apply to the modified work as a whole. If +identifiable sections of that work are not derived from the Library, +and can be reasonably considered independent and separate works in +themselves, then this License, and its terms, do not apply to those +sections when you distribute them as separate works. But when you +distribute the same sections as part of a whole which is a work based +on the Library, the distribution of the whole must be on the terms of +this License, whose permissions for other licensees extend to the +entire whole, and thus to each and every part regardless of who wrote +it. + +Thus, it is not the intent of this section to claim rights or contest +your rights to work written entirely by you; rather, the intent is to +exercise the right to control the distribution of derivative or +collective works based on the Library. + +In addition, mere aggregation of another work not based on the Library +with the Library (or with a work based on the Library) on a volume of +a storage or distribution medium does not bring the other work under +the scope of this License. + + 3. You may opt to apply the terms of the ordinary GNU General Public +License instead of this License to a given copy of the Library. To do +this, you must alter all the notices that refer to this License, so +that they refer to the ordinary GNU General Public License, version 2, +instead of to this License. (If a newer version than version 2 of the +ordinary GNU General Public License has appeared, then you can specify +that version instead if you wish.) Do not make any other change in +these notices. + + Once this change is made in a given copy, it is irreversible for +that copy, so the ordinary GNU General Public License applies to all +subsequent copies and derivative works made from that copy. + + This option is useful when you wish to copy part of the code of +the Library into a program that is not a library. + + 4. You may copy and distribute the Library (or a portion or +derivative of it, under Section 2) in object code or executable form +under the terms of Sections 1 and 2 above provided that you accompany +it with the complete corresponding machine-readable source code, which +must be distributed under the terms of Sections 1 and 2 above on a +medium customarily used for software interchange. + + If distribution of object code is made by offering access to copy +from a designated place, then offering equivalent access to copy the +source code from the same place satisfies the requirement to +distribute the source code, even though third parties are not +compelled to copy the source along with the object code. + + 5. A program that contains no derivative of any portion of the +Library, but is designed to work with the Library by being compiled or +linked with it, is called a "work that uses the Library". Such a +work, in isolation, is not a derivative work of the Library, and +therefore falls outside the scope of this License. + + However, linking a "work that uses the Library" with the Library +creates an executable that is a derivative of the Library (because it +contains portions of the Library), rather than a "work that uses the +library". The executable is therefore covered by this License. +Section 6 states terms for distribution of such executables. + + When a "work that uses the Library" uses material from a header file +that is part of the Library, the object code for the work may be a +derivative work of the Library even though the source code is not. +Whether this is true is especially significant if the work can be +linked without the Library, or if the work is itself a library. The +threshold for this to be true is not precisely defined by law. + + If such an object file uses only numerical parameters, data +structure layouts and accessors, and small macros and small inline +functions (ten lines or less in length), then the use of the object +file is unrestricted, regardless of whether it is legally a derivative +work. (Executables containing this object code plus portions of the +Library will still fall under Section 6.) + + Otherwise, if the work is a derivative of the Library, you may +distribute the object code for the work under the terms of Section 6. +Any executables containing that work also fall under Section 6, +whether or not they are linked directly with the Library itself. + + 6. As an exception to the Sections above, you may also combine or +link a "work that uses the Library" with the Library to produce a +work containing portions of the Library, and distribute that work +under terms of your choice, provided that the terms permit +modification of the work for the customer's own use and reverse +engineering for debugging such modifications. + + You must give prominent notice with each copy of the work that the +Library is used in it and that the Library and its use are covered by +this License. You must supply a copy of this License. If the work +during execution displays copyright notices, you must include the +copyright notice for the Library among them, as well as a reference +directing the user to the copy of this License. Also, you must do one +of these things: + + a) Accompany the work with the complete corresponding + machine-readable source code for the Library including whatever + changes were used in the work (which must be distributed under + Sections 1 and 2 above); and, if the work is an executable linked + with the Library, with the complete machine-readable "work that + uses the Library", as object code and/or source code, so that the + user can modify the Library and then relink to produce a modified + executable containing the modified Library. (It is understood + that the user who changes the contents of definitions files in the + Library will not necessarily be able to recompile the application + to use the modified definitions.) + + b) Use a suitable shared library mechanism for linking with the + Library. A suitable mechanism is one that (1) uses at run time a + copy of the library already present on the user's computer system, + rather than copying library functions into the executable, and (2) + will operate properly with a modified version of the library, if + the user installs one, as long as the modified version is + interface-compatible with the version that the work was made with. + + c) Accompany the work with a written offer, valid for at + least three years, to give the same user the materials + specified in Subsection 6a, above, for a charge no more + than the cost of performing this distribution. + + d) If distribution of the work is made by offering access to copy + from a designated place, offer equivalent access to copy the above + specified materials from the same place. + + e) Verify that the user has already received a copy of these + materials or that you have already sent this user a copy. + + For an executable, the required form of the "work that uses the +Library" must include any data and utility programs needed for +reproducing the executable from it. However, as a special exception, +the materials to be distributed need not include anything that is +normally distributed (in either source or binary form) with the major +components (compiler, kernel, and so on) of the operating system on +which the executable runs, unless that component itself accompanies +the executable. + + It may happen that this requirement contradicts the license +restrictions of other proprietary libraries that do not normally +accompany the operating system. Such a contradiction means you cannot +use both them and the Library together in an executable that you +distribute. + + 7. You may place library facilities that are a work based on the +Library side-by-side in a single library together with other library +facilities not covered by this License, and distribute such a combined +library, provided that the separate distribution of the work based on +the Library and of the other library facilities is otherwise +permitted, and provided that you do these two things: + + a) Accompany the combined library with a copy of the same work + based on the Library, uncombined with any other library + facilities. This must be distributed under the terms of the + Sections above. + + b) Give prominent notice with the combined library of the fact + that part of it is a work based on the Library, and explaining + where to find the accompanying uncombined form of the same work. + + 8. You may not copy, modify, sublicense, link with, or distribute +the Library except as expressly provided under this License. Any +attempt otherwise to copy, modify, sublicense, link with, or +distribute the Library is void, and will automatically terminate your +rights under this License. However, parties who have received copies, +or rights, from you under this License will not have their licenses +terminated so long as such parties remain in full compliance. + + 9. You are not required to accept this License, since you have not +signed it. However, nothing else grants you permission to modify or +distribute the Library or its derivative works. These actions are +prohibited by law if you do not accept this License. Therefore, by +modifying or distributing the Library (or any work based on the +Library), you indicate your acceptance of this License to do so, and +all its terms and conditions for copying, distributing or modifying +the Library or works based on it. + + 10. Each time you redistribute the Library (or any work based on the +Library), the recipient automatically receives a license from the +original licensor to copy, distribute, link with or modify the Library +subject to these terms and conditions. You may not impose any further +restrictions on the recipients' exercise of the rights granted herein. +You are not responsible for enforcing compliance by third parties with +this License. + + 11. If, as a consequence of a court judgment or allegation of patent +infringement or for any other reason (not limited to patent issues), +conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot +distribute so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you +may not distribute the Library at all. For example, if a patent +license would not permit royalty-free redistribution of the Library by +all those who receive copies directly or indirectly through you, then +the only way you could satisfy both it and this License would be to +refrain entirely from distribution of the Library. + +If any portion of this section is held invalid or unenforceable under any +particular circumstance, the balance of the section is intended to apply, +and the section as a whole is intended to apply in other circumstances. + +It is not the purpose of this section to induce you to infringe any +patents or other property right claims or to contest validity of any +such claims; this section has the sole purpose of protecting the +integrity of the free software distribution system which is +implemented by public license practices. Many people have made +generous contributions to the wide range of software distributed +through that system in reliance on consistent application of that +system; it is up to the author/donor to decide if he or she is willing +to distribute software through any other system and a licensee cannot +impose that choice. + +This section is intended to make thoroughly clear what is believed to +be a consequence of the rest of this License. + + 12. If the distribution and/or use of the Library is restricted in +certain countries either by patents or by copyrighted interfaces, the +original copyright holder who places the Library under this License may add +an explicit geographical distribution limitation excluding those countries, +so that distribution is permitted only in or among countries not thus +excluded. In such case, this License incorporates the limitation as if +written in the body of this License. + + 13. The Free Software Foundation may publish revised and/or new +versions of the Lesser General Public License from time to time. +Such new versions will be similar in spirit to the present version, +but may differ in detail to address new problems or concerns. + +Each version is given a distinguishing version number. If the Library +specifies a version number of this License which applies to it and +"any later version", you have the option of following the terms and +conditions either of that version or of any later version published by +the Free Software Foundation. If the Library does not specify a +license version number, you may choose any version ever published by +the Free Software Foundation. + + 14. If you wish to incorporate parts of the Library into other free +programs whose distribution conditions are incompatible with these, +write to the author to ask for permission. For software which is +copyrighted by the Free Software Foundation, write to the Free +Software Foundation; we sometimes make exceptions for this. Our +decision will be guided by the two goals of preserving the free status +of all derivatives of our free software and of promoting the sharing +and reuse of software generally. + + NO WARRANTY + + 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO +WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. +EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR +OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY +KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE +IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE +LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME +THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN +WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY +AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU +FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR +CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE +LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING +RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A +FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF +SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH +DAMAGES. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Libraries + + If you develop a new library, and you want it to be of the greatest +possible use to the public, we recommend making it free software that +everyone can redistribute and change. You can do so by permitting +redistribution under these terms (or, alternatively, under the terms of the +ordinary General Public License). + + To apply these terms, attach the following notices to the library. It is +safest to attach them to the start of each source file to most effectively +convey the exclusion of warranty; and each file should have at least the +"copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This library is free software; you can redistribute it and/or + modify it under the terms of the GNU Lesser General Public + License as published by the Free Software Foundation; either + version 2 of the License, or (at your option) any later version. + + This library is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + Lesser General Public License for more details. + + You should have received a copy of the GNU Lesser General Public + License along with this library; if not, write to the Free Software + Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + +Also add information on how to contact you by electronic and paper mail. + +You should also get your employer (if you work as a programmer) or your +school, if any, to sign a "copyright disclaimer" for the library, if +necessary. Here is a sample; alter the names: + + Yoyodyne, Inc., hereby disclaims all copyright interest in the + library `Frob' (a library for tweaking knobs) written by James Random Hacker. + + , 1 April 1990 + Ty Coon, President of Vice + +That's all there is to it! + + diff --git a/trunk/paradiseo-eo/Makefile.am b/trunk/paradiseo-eo/Makefile.am new file mode 100644 index 000000000..de05f3939 --- /dev/null +++ b/trunk/paradiseo-eo/Makefile.am @@ -0,0 +1,30 @@ +## Makefile.am for eo + +if USE_APPLICATIONS +SUBDIRS_APP = app +endif + +if USE_TUTORIAL +SUBDIRS_TUT = tutorial +endif + +SUBDIRS = src doc contrib win $(SUBDIRS_APP) $(SUBDIRS_TUT) test + + +# Directory for documents +DOCDIR = ~/public_html/eodocs + +# Directory for indices -- not useful for the user +IDXDIR = ~/index + + +# Add documentation to distribution +dist-hook: + $(MAKE) documentation + $(INSTALL_DATA) -d $(srcdir)/doc/html $(srcdir)/doc/latex $(srcdir)/doc/man $(distdir)/doc/ + +# Prepare documentation +documentation: + cd doc && $(MAKE) doc && cd .. +# convinience-target +doc: documentation diff --git a/trunk/paradiseo-eo/NEWS b/trunk/paradiseo-eo/NEWS new file mode 100644 index 000000000..2c10c8c81 --- /dev/null +++ b/trunk/paradiseo-eo/NEWS @@ -0,0 +1,17 @@ +* release 0.9.4 (not yet released) + - Update introductory pages of documentation and webpage. + - Remove support for pre-standard C++ compiler (i.e. gcc-2.x), which allows to + clean up the code considerably. Assume availability of sstream and limits. + - Implement CMA-ES. + + +* release 0.9.3z.1 (1. Oct. 2005) + - Support gcc-3.4 and gcc.4.x. + - Provide full automake/autoconf/configure support. + + +# Local Variables: +# coding: iso-8859-1 +# mode: text +# fill-column: 80 +# End: diff --git a/trunk/paradiseo-eo/README b/trunk/paradiseo-eo/README new file mode 100644 index 000000000..b11266535 --- /dev/null +++ b/trunk/paradiseo-eo/README @@ -0,0 +1,102 @@ + EO README FILE +======================================================================= + check latest news at http://eodev.sourceforge.net/ +======================================================================= + +Welcome to EO, the Evolving Objects library. + +The latest news about EO can be found on the sourceforge repository at + +http://eodev.sourceforge.net/ + +In case of any problem, please e-mail us at + +eodev@egroups.com, eodev-main@lists.sourceforge.net + + +================================================================== + BUILDING EO +================================================================== +The basic installation procedure goes the following: + +Go to your build-directory and run + $(SRCDIR)/configure + make + make check + make install +where $(SRCDIR) is the top-level source directory of EO, i.e. where +the sources where unpacked. + +See $(SRCDIR)/configure for possible options. You can specify to not +build example applications, the tutorial, or to build the ParadisEO +tutorial. You may also change the installation directory that way. + +Now you should probably go to the tutorial and start learning about EO +features and programming. + + +In case of problems, you can read the INSTALL file - but remember this +is a standard installation file from GNU and that it contains nothing +specific about EO. + + +=================================================================== + DIRECTORY STRUCTURE +=================================================================== +After unpacking the archive file, you should end up with the following +structure: + +.../ the MAIN EO dir, created when unpacking + | + +-- src SOURCE dir. Contains most EO .h files + | | + | +- utils general utilities (e.g. RNG-related source files) + | | + | +- ga bistring-genotypes source files + | | + | +- es real-valued-genotypes source files + | | + | +- gp Genetic Programming source files + | | + | +- obsolete files from old versions - for upward compatibility + | + | + | + +-- tutorial TUTORIAL dir (indeed :-) + | | + | +- html all html files - start by browsing index.html + | | + | +- LessonX for X=1, 2, 3, ... : example of increasing complexity + | + | + | + +-- doc DOCUMENTATION dir (generated by Doxygen) + | | + | +- html HTML files - start at index.html (see also tutorial) + | | + | +- latex latex files - use to generate Poatscript doc. + | | + | +- man Unix man format documentation + | + | + +-- test TEST files - for debugging purposes only + | + | + +-- app APPLICATIONS - one dir per separate application + | | + | +- gprop GA/backpropagation for neural nets + | | + | +- mastermind the wellknown MasterMind game + | + | + +-- win WINDOWS dir: project files for MS/VC5+ + + + +=================================================================== + NOTES +=================================================================== +If you extracted a fresh snapshot from the cvs-repository, remember +to run + ./autogen.sh +in the source-directory before building the libraries. diff --git a/trunk/paradiseo-eo/README.html b/trunk/paradiseo-eo/README.html new file mode 100644 index 000000000..00e147c65 --- /dev/null +++ b/trunk/paradiseo-eo/README.html @@ -0,0 +1,115 @@ + + + + + + EO evolutionary computation framework + + + + + +
+

EO Evolutionary Computation Framework and Library

+ +EO (Evolvable|Evolutionary objects) is a C++ toolbox for evolutionary computation which defines interfaces for +many classes of algorithms used in evolutionary computation, and, at the +same time, provides some examples that use those interfaces. The client/user +can include those objects in his or her programs, or create their own. If new objects are created, the GeNeura team commit themselves to test them, and make them available +to the Evolutionary Computation community. In this way, no changes have +to be made to the library design or to a program that implements an EC algorithm: just new classes added. Our intention would be that, in the future, somebody implementing an EC algorithm would say "I am using EO, plus a class that hs been made publicly available", improving repeatability of EC results and easing its availability. +
EO uses STL, and ANSI C++. So far, it has been tested and works +with gcc 2.8.1 and egcs 1.0.2 in Linux, Irix, Win95/NT (with Cygwin) and +Solaris Machines, and with Visual C++ 5.0 in WinNT machines. Makefiles for Unix and project +files and makefiles for NT are provided. + + +

Installing EO and compiling examples in UNIX

+To start and use it, first you can untar or unzip it (depending on the distribution you got), by doing, +
bash$ zcat eo-0.6.tgz | tar xvf -
+or +
bash$ unzip eo-0.6.zip

+

+Once everything is decompressed to the eo-0.6 directory (or whatever), cd to it and type +
bash$ configure
+or +
bash$ configure --prefix=/my/fav/directory
+if you intend to use it from another directory. If you do so, you´ll have then to copy manually all the .h and .a files to it. Right now, EO is mostly templates-based, so it has mainly got header files, plus a small and independent utility library.

+

After that, type +
bash$ make +
This makes the object and library files needed, makes the examples +in the apps/examples directory, and builds the genetic mastermind + application in the apps/master directory. If anything goes wrong at this stage, e-mail us. It should work properly with the compilers mentioned so far. +

+

Then, to unzip the documentation +
bash$ make docunzip +
which unzips the HTML documentation into the doc directory.

+

If there is any problem, write to any of the addresses below, or +just do +
bash$ make bug-report +
and tell us your problem, indicating EO release, the C++ compiler you +are using, and the platform. +

+ +

Installing EO and compiling examples in Win95/NT

+ +Unzip the library to your favorite directory by double-clicking on the eo-0.6 icon, and then load apps/examples/examples.dsw or + apps/examples/master.dsw workspaces; then define the main + directory you installed it to as default include directory (in + tools->directories or somesuch) and press F7 for compiling. Alternatively, if you favor makefiles, change into the apps/examples directory and run
+C:\my\dir\eo-0.6\apps\examples> nmake /f examples.mak
+which will create debug executables for all the examples.

+ +

In the CygWin environment, everything should work in the same way as in UNIX, but for a couple of things. To run configure, type
+bash$ sh ./configure, or, much better, create a \bin directory and copy sh.exe to it; that way, shell scripts will work properly.

+ +

Availability

+The latest versions of EO are always available from http://geneura.ugr.es/~jmerelo/eo +and ftp://geneura.ugr.es/pub/eo. + + +

Working with EO

+For a quick dive into the eo library, check the SGA +
Then go ahead to the EasyGA, +which is a more flexible implementation of a Genetic Algorithm. +
Then, why not, see how EO implements Simulated Annealing in EOSimAnnAlg. If you have unzipped the documentation, there should be also local copies of these files. + + +

Tell us something!

+If you have any problem, have created a new class, or just want to +tell us something, write to eo@kal-el.ugr.es. +The eo mailing list is hosted by OneList, + + +[Click to subscribe to eodev@onelist.com]. + + +
+ +

Legal Stuff

+EO is free and free distribution; however, if you include parts of EO in +a commercial product, you have to request authorization from us. +
The usual things apply too. If it does not work, if your wife or dogs +abandons you, or your room humector stops working, it's not our fault. +
  + +
+
+ Search EO documentation + + + + +
+
+ + diff --git a/trunk/paradiseo-eo/THANKS b/trunk/paradiseo-eo/THANKS new file mode 100644 index 000000000..e69de29bb diff --git a/trunk/paradiseo-eo/TODO.html b/trunk/paradiseo-eo/TODO.html new file mode 100644 index 000000000..74f802dd0 --- /dev/null +++ b/trunk/paradiseo-eo/TODO.html @@ -0,0 +1,28 @@ + + + + TODO list for EO + + + +

TODO list for EO

+
    +
  • Provide a way to easily manipulate the algorithm in runtime, be it + from grafically or text; expand command-line capabities? +
  • Provide a graphical interface for Windows, in VC++ or BBuilder. +
  • Creare more examples of the objects of which there is only one instance: + algorithms, evaluators. Try to adapt most well-know algorithms to EO +
  • Integrate the gTK interface seamlessly in the library. +
  • Complete documentation. +
  • Try to implemente as algorithms the best known paradigms: Evolution Strategies, Evolutionary programming. +
+ + +
+
Juan Julian Merelo Guervos
+ + +Last modified: Wed May 13 11:12:34 CEST 1998 + + + diff --git a/trunk/paradiseo-eo/Tutorial/CVS/Entries b/trunk/paradiseo-eo/Tutorial/CVS/Entries new file mode 100644 index 000000000..178481050 --- /dev/null +++ b/trunk/paradiseo-eo/Tutorial/CVS/Entries @@ -0,0 +1 @@ +D diff --git a/trunk/paradiseo-eo/Tutorial/CVS/Repository b/trunk/paradiseo-eo/Tutorial/CVS/Repository new file mode 100644 index 000000000..849b39181 --- /dev/null +++ b/trunk/paradiseo-eo/Tutorial/CVS/Repository @@ -0,0 +1 @@ +eo/Tutorial diff --git a/trunk/paradiseo-eo/Tutorial/CVS/Root b/trunk/paradiseo-eo/Tutorial/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/Tutorial/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/acinclude.m4 b/trunk/paradiseo-eo/acinclude.m4 new file mode 100644 index 000000000..8a3244382 --- /dev/null +++ b/trunk/paradiseo-eo/acinclude.m4 @@ -0,0 +1,61 @@ +# AC_APPLICATIONS() +# +# Compile applications unless user requests not to do it. +AC_DEFUN([AC_APPLICATIONS],[dnl + AC_ARG_ENABLE([applications], + AC_HELP_STRING([--enable-applications], [build applications (default=yes)]), + [ case "${enableval}" in + yes) applications=true ;; + no) applications=false ;; + *) AC_MSG_ERROR(bad value ${enableval} for applications option) ;; + esac], + [applications=true]) + if test "$applications" = "true"; then + AM_CONDITIONAL([USE_APPLICATIONS], true) + else + AM_CONDITIONAL([USE_APPLICATIONS], false) + fi +]) + + + +# AC_GNUPLOT() +# +# Compile applications unless user requests not to do it. +AC_DEFUN([AC_GNUPLOT], [dnl + AC_ARG_ENABLE([gnuplot], + AC_HELP_STRING([--enable-gnuplot], [use gnuplot for graphical display (default=yes)]), + [ac_cv_use_gnuplot=$enableval], + [ac_cv_use_gnuplot=yes]) + AC_CACHE_CHECK([use gnuplot for graphical display], + [ac_cv_use_gnuplot], + [ac_cv_use_gnuplot=no]) + if test "$ac_cv_use_gnuplot" = "yes"; then + AC_ARG_VAR([GNUPLOT], [gnuplot executable used for graphical display]) + AC_CHECK_PROG([GNUPLOT], [gnuplot], [gnuplot], [true]) + AC_DEFINE([HAVE_GNUPLOT], [1], [gnuplot graphical display]) + else + AC_DEFINE([NO_GNUPLOT], [1], [no gnuplot graphical display -- deprecated, will be reomoved!]) + fi +]) + + + +# AC_TUTORIAL() +# +# Compile tutorial unless user requests not to do it. +AC_DEFUN([AC_TUTORIAL],[dnl + AC_ARG_ENABLE([tutorial], + AC_HELP_STRING([--enable-tutorial], [build tutorial (default=yes)]), + [ case "${enableval}" in + yes) tutorial=true ;; + no) tutorial=false ;; + *) AC_MSG_ERROR(bad value ${enableval} for tutorial option) ;; + esac], + [tutorial=true]) + if test "$tutorial" = "true"; then + AM_CONDITIONAL([USE_TUTORIAL], true) + else + AM_CONDITIONAL([USE_TUTORIAL], false) + fi +]) diff --git a/trunk/paradiseo-eo/app/.cvsignore b/trunk/paradiseo-eo/app/.cvsignore new file mode 100644 index 000000000..3dda72986 --- /dev/null +++ b/trunk/paradiseo-eo/app/.cvsignore @@ -0,0 +1,2 @@ +Makefile.in +Makefile diff --git a/trunk/paradiseo-eo/app/CVS/Entries b/trunk/paradiseo-eo/app/CVS/Entries new file mode 100644 index 000000000..305ff6862 --- /dev/null +++ b/trunk/paradiseo-eo/app/CVS/Entries @@ -0,0 +1,3 @@ +/.cvsignore/1.1/Thu Nov 23 19:44:47 2000// +/Makefile.am/1.8/Wed Sep 22 18:18:31 2004// +D diff --git a/trunk/paradiseo-eo/app/CVS/Entries.Log b/trunk/paradiseo-eo/app/CVS/Entries.Log new file mode 100644 index 000000000..edf59c191 --- /dev/null +++ b/trunk/paradiseo-eo/app/CVS/Entries.Log @@ -0,0 +1,4 @@ +A D/gprop//// +A D/gpsymreg//// +A D/master//// +A D/mastermind//// diff --git a/trunk/paradiseo-eo/app/CVS/Repository b/trunk/paradiseo-eo/app/CVS/Repository new file mode 100644 index 000000000..1b3b048fd --- /dev/null +++ b/trunk/paradiseo-eo/app/CVS/Repository @@ -0,0 +1 @@ +eo/app diff --git a/trunk/paradiseo-eo/app/CVS/Root b/trunk/paradiseo-eo/app/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/app/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/app/Makefile.am b/trunk/paradiseo-eo/app/Makefile.am new file mode 100644 index 000000000..662248021 --- /dev/null +++ b/trunk/paradiseo-eo/app/Makefile.am @@ -0,0 +1,3 @@ +## Makefile.am for app dir in eo + +SUBDIRS = mastermind gprop gpsymreg diff --git a/trunk/paradiseo-eo/app/gprop/.cvsignore b/trunk/paradiseo-eo/app/gprop/.cvsignore new file mode 100644 index 000000000..8bf1bd921 --- /dev/null +++ b/trunk/paradiseo-eo/app/gprop/.cvsignore @@ -0,0 +1,4 @@ +Makefile.in +Makefile +gprop +.deps diff --git a/trunk/paradiseo-eo/app/gprop/CVS/Entries b/trunk/paradiseo-eo/app/gprop/CVS/Entries new file mode 100644 index 000000000..5e326ef20 --- /dev/null +++ b/trunk/paradiseo-eo/app/gprop/CVS/Entries @@ -0,0 +1,10 @@ +/.cvsignore/1.3/Mon Dec 11 09:28:40 2000// +/Makefile.am/1.4/Wed Sep 22 18:18:31 2004// +/gprop.cpp/1.3/Tue Jan 13 20:21:52 2004// +/gprop.h/1.12/Wed Sep 29 18:37:20 2004// +/l2.h/1.1/Thu Nov 23 19:14:09 2000// +/mlp.h/1.10/Sun Oct 2 21:42:08 2005// +/mse.h/1.1/Thu Nov 23 19:14:09 2000// +/qp.h/1.1/Thu Nov 23 19:14:09 2000// +/vecop.h/1.2/Sat Feb 2 05:51:31 2002// +D diff --git a/trunk/paradiseo-eo/app/gprop/CVS/Repository b/trunk/paradiseo-eo/app/gprop/CVS/Repository new file mode 100644 index 000000000..69b1ec52f --- /dev/null +++ b/trunk/paradiseo-eo/app/gprop/CVS/Repository @@ -0,0 +1 @@ +eo/app/gprop diff --git a/trunk/paradiseo-eo/app/gprop/CVS/Root b/trunk/paradiseo-eo/app/gprop/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/app/gprop/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/app/gprop/Makefile.am b/trunk/paradiseo-eo/app/gprop/Makefile.am new file mode 100644 index 000000000..b1515ce53 --- /dev/null +++ b/trunk/paradiseo-eo/app/gprop/Makefile.am @@ -0,0 +1,22 @@ +# Makefile.am for app/gprop + +noinst_PROGRAMS = gprop + + +gprop_SOURCES = gprop.cpp + +noinst_HEADERS = gprop.h \ + l2.h \ + mlp.h \ + mse.h \ + qp.h \ + vecop.h + + +AM_CXXFLAGS = -I$(top_srcdir)/src + +LIBEO = $(top_builddir)/src/libeo.a +LIBEOUTILS = $(top_builddir)/src/utils/libeoutils.a + +DEPS = $(LIBEO) $(LIBEOUTILS) +LIBS = $(LIBEO) $(LIBEOUTILS) diff --git a/trunk/paradiseo-eo/app/gprop/gprop.cpp b/trunk/paradiseo-eo/app/gprop/gprop.cpp new file mode 100644 index 000000000..10871d21e --- /dev/null +++ b/trunk/paradiseo-eo/app/gprop/gprop.cpp @@ -0,0 +1,170 @@ +//----------------------------------------------------------------------------- +// gprop +//----------------------------------------------------------------------------- +using namespace std; + +#include // EXIT_SUCCESS EXIT_FAILURE +#include // exception +#include // cerr cout +#include // ifstream +#include // string +#include // all usefull eo stuff +#include "gprop.h" // Chrom eoChromInit eoChromMutation eoChromXover eoChromEvaluator + +//----------------------------------------------------------------------------- +// global variables +//----------------------------------------------------------------------------- + +unsigned in, out, hidden; +mlp::set train, validate, test; + +//----------------------------------------------------------------------------- +// parameters +//----------------------------------------------------------------------------- + +eoValueParam pop_size(10, "pop_size", "population size", 'p'); +eoValueParam generations(10, "generations", "number of generation", 'g'); +eoValueParam mut_rate(0.25, "mut_rate", "mutation rate", 'm'); +eoValueParam xover_rate(0.25, "xover_rate", "default crossover rate", 'x'); +eoValueParam file("", "file", "common start of patterns filenames *.trn *.val and *.tst", 'f'); +eoValueParam hiddenp(0, "hidden", "number of neurons in hidden layer", 'd'); + +//----------------------------------------------------------------------------- +// auxiliar functions +//----------------------------------------------------------------------------- + +void arg(int argc, char** argv); +void load_file(mlp::set& s, const string& s); +void ga(); + +//----------------------------------------------------------------------------- +// main +//----------------------------------------------------------------------------- + +int main(int argc, char** argv) +{ + try + { + arg(argc, argv); + ga(); + } + catch (exception& e) + { + cerr << argv[0] << ": " << e.what() << endl; + exit(EXIT_FAILURE); + } + + return 0; +} + +//----------------------------------------------------------------------------- +// implementation +//----------------------------------------------------------------------------- + +void arg(int argc, char** argv) +{ + eoParser parser(argc, argv); + + parser.processParam(pop_size, "genetic operators"); + parser.processParam(generations, "genetic operators"); + parser.processParam(mut_rate, "genetic operators"); + parser.processParam(xover_rate, "genetic operators"); + parser.processParam(file, "files"); + parser.processParam(hiddenp, "genetic operators"); + + if (parser.userNeedsHelp()) + { + parser.printHelp(cout); + exit(EXIT_SUCCESS); + } + + load_file(train, "trn"); + load_file(validate, "val"); + load_file(test, "tst"); + + phenotype::trn_max = train.size(); + phenotype::val_max = validate.size(); + phenotype::tst_max = test.size(); + + in = train.front().input.size(); + out = train.front().output.size(); + gprop_use_datasets(&train, &validate, &test); + hidden = hiddenp.value(); +} + +//----------------------------------------------------------------------------- + +void load_file(mlp::set& set, const string& ext) +{ + string filename = file.value(); filename += "." + ext; + + ifstream ifs(filename.c_str()); + if (!ifs) + { + cerr << "can't open file \"" << filename << "\"" << endl; + exit(EXIT_FAILURE); + } + + ifs >> set; + + if (set.size() == 0) + { + cerr << filename << " data file is empty!"; + exit(EXIT_FAILURE); + } +} + +//----------------------------------------------------------------------------- + +void ga() +{ + // create population + eoInitChrom init; + eoPop pop(pop_size.value(), init); + + // evaluate population + eoEvalFuncPtr evaluator(eoChromEvaluator); + apply(evaluator, pop); + + // selector + eoStochTournamentSelect select; + + // genetic operators + eoChromMutation mutation; + eoChromXover xover; + + // stop condition + eoGenContinue continuator1(generations.value()); + phenotype p; p.val_ok = validate.size() - 1; p.mse_error = 0; + eoFitContinue continuator2(p); + eoCombinedContinue continuator(continuator1, continuator2); + + // checkpoint + eoCheckPoint checkpoint(continuator); + + // monitor + eoStdoutMonitor monitor; + checkpoint.add(monitor); + + // statistics + eoBestFitnessStat stats; + checkpoint.add(stats); + monitor.add(stats); + + // genetic algorithm + eoSGA sga(select, + xover, xover_rate.value(), + mutation, mut_rate.value(), + evaluator, + checkpoint); + + sga(pop); + + cout << "best: " << *max_element(pop.begin(), pop.end()) << endl; +} + +//----------------------------------------------------------------------------- + +// Local Variables: +// mode:C++ +// End: diff --git a/trunk/paradiseo-eo/app/gprop/gprop.h b/trunk/paradiseo-eo/app/gprop/gprop.h new file mode 100644 index 000000000..60e3bce6a --- /dev/null +++ b/trunk/paradiseo-eo/app/gprop/gprop.h @@ -0,0 +1,239 @@ +// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- + +//----------------------------------------------------------------------------- +// gprop.h +// (c) GeNeura Team 1998 +/* + This library is free software; you can redistribute it and/or + modify it under the terms of the GNU Lesser General Public + License as published by the Free Software Foundation; either + version 2 of the License, or (at your option) any later version. + + This library is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + Lesser General Public License for more details. + + You should have received a copy of the GNU Lesser General Public + License along with this library; if not, write to the Free Software + Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + + Contact: todos@geneura.ugr.es, http://geneura.ugr.es + */ +//----------------------------------------------------------------------------- + + +#ifndef gprop_h +#define gprop_h + +//----------------------------------------------------------------------------- + +#include // istream ostream +#include // setprecision +#include // string +#include // EO +#include // eoMonOp eoQuadraticOp +#include // eoInit +#include // normal_generator +#include "mlp.h" // mlp::net mlp::set +#include "qp.h" // qp::set +#include "mse.h" // mse::error + +//----------------------------------------------------------------------------- +// phenotype +//----------------------------------------------------------------------------- + +struct phenotype +{ + int trn_ok, val_ok, tst_ok; + double mse_error; + + static int trn_max, val_max, tst_max; + + friend bool operator<(const phenotype& a, const phenotype& b) + { + return a.val_ok < b.val_ok || !(b.val_ok < a.val_ok) && b.mse_error < a.mse_error; + } + + friend bool operator==(const phenotype& a, const phenotype& b) + { + return a.val_ok == b.val_ok && b.mse_error == a.mse_error; + } + + friend bool operator>=(const phenotype& a, const phenotype& b) + { + return !(a < b); + } + + friend bool operator>(const phenotype& a, const phenotype& b) + { + return (!(a == b)) && (!(a < b)); + } + + + + friend ostream& operator<<(ostream& os, const phenotype& p) + { + return os << p.trn_ok << "/" << p.trn_max << " " + << p.val_ok << "/" << p.val_max << " " + << p.tst_ok << "/" << p.tst_max << " " + << p.mse_error; + } + + friend istream& operator>>(istream& is, phenotype& p) + { + return is; // complete me + } +}; + + +int phenotype::trn_max = 0, phenotype::val_max = 0, phenotype::tst_max = 0; + +//----------------------------------------------------------------------------- +// genotype +//----------------------------------------------------------------------------- +#ifndef GPROP_GENOTYPE +#define GPROP_GENOTYPE mlp::net +#endif + +typedef GPROP_GENOTYPE genotype; + +//----------------------------------------------------------------------------- +// Chrom +//----------------------------------------------------------------------------- + +extern unsigned in, out, hidden; + +class Chrom: public EO, public genotype +{ +public: + Chrom(): genotype(in, out, vector(hidden < 1 ? 0 : 1, hidden)) {} + + string className() const { return "Chrom"; } + + void printOn (ostream& os) const + { + os << setprecision(3) << static_cast(*this) << " \t" + << fitness(); + // os << fitness(); + } + + void readFrom (istream& is) + { + invalidate(); // complete me + } +}; + +//----------------------------------------------------------------------------- +// eoChromInit +//----------------------------------------------------------------------------- + +class eoInitChrom: public eoInit +{ +public: + void operator()(Chrom& chrom) + { + chrom.reset(); + chrom.invalidate(); + } +}; + +//----------------------------------------------------------------------------- +// global variables +//----------------------------------------------------------------------------- + +mlp::set *trn_set = 0, *val_set = 0, *tst_set = 0; + +void gprop_use_datasets(mlp::set *trn, mlp::set *val, mlp::set *tst) { + trn_set = trn; + val_set = val; + tst_set = tst; +} + +void ensure_datasets_initialized() { + if (!trn_set) { + cerr << "trn_set is not initialized. Must call gprop_use_datasets before training\n"; + cerr.flush(); + abort(); + } +} + +//----------------------------------------------------------------------------- +// eoChromMutation +//----------------------------------------------------------------------------- + +class eoChromMutation: public eoMonOp +{ +public: + bool operator()(Chrom& chrom) + { + mse::net tmp(chrom); + tmp.train(*trn_set, 10, 0, 0.001); + return true; + } +}; + +//----------------------------------------------------------------------------- +// eoChromXover +//----------------------------------------------------------------------------- + +class eoChromXover: public eoQuadOp +{ +public: + bool operator()(Chrom& chrom1, Chrom& chrom2) + { + chrom1.normalize(); + chrom2.desaturate(); + + mse::net tmp1(chrom1), tmp2(chrom2); + ensure_datasets_initialized(); + tmp1.train(*trn_set, 100, 0, 0.001); + tmp2.train(*trn_set, 100, 0, 0.001); + + return true; + } +}; + +//----------------------------------------------------------------------------- +// eoChromEvaluator +//----------------------------------------------------------------------------- + +int correct(const mlp::net& net, const mlp::set& set) +{ + int sum = 0; + + for (mlp::set::const_iterator s = set.begin(); s != set.end(); ++s) + { + unsigned partial = 0; + + for (unsigned i = 0; i < s->output.size(); ++i) + if (s->output[i] < 0.5 && net(s->input)[i] < 0.5 || + s->output[i] > 0.5 && net(s->input)[i] > 0.5) + ++partial; + + if (partial == s->output.size()) + ++sum; + } + + return sum; +} + +phenotype eoChromEvaluator(const Chrom& chrom) +{ + phenotype p; + ensure_datasets_initialized(); + p.trn_ok = correct(chrom, *trn_set); + p.val_ok = correct(chrom, *val_set); + p.tst_ok = correct(chrom, *tst_set); + p.mse_error = mse::error(chrom, *val_set); + + return p; +}; + +//----------------------------------------------------------------------------- + +#endif // gprop_h + +// Local Variables: +// mode:C++ +// End: diff --git a/trunk/paradiseo-eo/app/gprop/l2.h b/trunk/paradiseo-eo/app/gprop/l2.h new file mode 100644 index 000000000..011c66109 --- /dev/null +++ b/trunk/paradiseo-eo/app/gprop/l2.h @@ -0,0 +1,140 @@ +//----------------------------------------------------------------------------- +// l2.h +//----------------------------------------------------------------------------- + +#ifndef l2_h +#define l2_h + +//----------------------------------------------------------------------------- + +#include // log +#include // neuron layer net set + +//----------------------------------------------------------------------------- + +namespace l2 +{ + //--------------------------------------------------------------------------- + // useful typedefs + //--------------------------------------------------------------------------- + + using qp::real; + using qp::vector; + using qp::max_real; + using qp::min_real; + using qp::set; + using qp::neuron; + using qp::layer; + + //--------------------------------------------------------------------------- + // error + //--------------------------------------------------------------------------- + + real error(const mlp::net& net, const set& ts) + { + real error_ = 0.0; + + for (set::const_iterator s = ts.begin(); s != ts.end(); ++s) + { + vector out = net(s->input); + + for (unsigned i = 0; i < out.size(); ++i) + { + real target = s->output[i]; + real value = out[i]; + error_ -= target * log(value + min_real) + + (1.0 - target) * log(1.0 - value + min_real); + } + } + + return error_; + } + + //------------------------------------------------------------------------- + // l2 + //------------------------------------------------------------------------- + + class net: public qp::net + { + public: + net(mlp::net& n): qp::net(n) {} + + real error(const set& ts) + { + real error_ = 0; + + for (set::const_iterator s = ts.begin(); s != ts.end(); ++s) + { + forward(s->input); + error_ -= backward(s->input, s->output); + } + + return error_; + } + + private: + real backward(const vector& input, const vector& output) + { + reverse_iterator current_layer = rbegin(); + reverse_iterator backward_layer = current_layer + 1; + real error_ = 0; + + // output layer + for (unsigned j = 0; j < current_layer->size(); ++j) + { + neuron& n = (*current_layer)[j]; + real out = output[j]; + n.ndelta += n.delta = (out - n.out) / + (n.out * (1.0 - n.out) + min_real) * n.out * (1.0 - n.out); + + if (size() == 1) // monolayer + n.dxo += n.delta * input; + else // multilayer + for (unsigned k = 0; k < n.dxo.size(); ++k) + n.dxo[k] += n.delta * (*backward_layer)[k].out; + + error_ += out * log(n.out + min_real) + + (1.0 - out) * log(1.0 - n.out + min_real); + } + + // hidden layers + while (++current_layer != rend()) + { + reverse_iterator forward_layer = current_layer - 1; + reverse_iterator backward_layer = current_layer + 1; + + for (unsigned j = 0; j < current_layer->size(); ++j) + { + neuron& n = (*current_layer)[j]; + real sum = 0; + for (unsigned k = 0; k < forward_layer->size(); ++k) + { + neuron& nf = (*forward_layer)[k]; + sum += nf.delta * (nf.n->weight[j] + nf.dweight1[j]); + } + n.delta = n.out * (1.0 - n.out) * sum; + n.ndelta += n.delta; + + if (backward_layer == rend()) // first hidden layer + n.dxo += n.delta * input; + else // rest of hidden layers + for (unsigned k = 0; k < n.dxo.size(); ++k) + n.dxo[k] += n.delta * (*backward_layer)[k].out; + } + } + + return error_; + } + }; + + //--------------------------------------------------------------------------- + +} // namespace l2 + +//----------------------------------------------------------------------------- + +#endif // l2_h + +// Local Variables: +// mode:C++ +// End: diff --git a/trunk/paradiseo-eo/app/gprop/mlp.h b/trunk/paradiseo-eo/app/gprop/mlp.h new file mode 100644 index 000000000..a674f576c --- /dev/null +++ b/trunk/paradiseo-eo/app/gprop/mlp.h @@ -0,0 +1,458 @@ +//----------------------------------------------------------------------------- +// mlp.h +//----------------------------------------------------------------------------- + +#ifndef mlp_h +#define mlp_h + +#include // generate +#include // exp +#include +#include +#include +#include // invalid_argument +#include +#include +#include // eoRng +#include // normal_generator +#include // * + + + + +namespace mlp +{ + using namespace std; + + typedef double real; + typedef std::vector vector; +} + + +namespace std { + ostream& operator<<(ostream& os, const mlp::vector& v) + { + ostream_iterator oi(os, " "); + copy(v.begin(), v.end(), oi); + return os; + } + + istream& operator>>(istream& is, mlp::vector& v) + { + for (mlp::vector::iterator vi = v.begin() ; vi != v.end() ; vi++) { + is >> *vi; + } + return is; + } +} + +namespace mlp +{ + using namespace std; + + //--------------------------------------------------------------------------- + // useful typedefs + //--------------------------------------------------------------------------- + + + const real max_real = std::numeric_limits::max(); + const real min_real = std::numeric_limits::min(); + + + //--------------------------------------------------------------------------- + // sigmoid + //--------------------------------------------------------------------------- + + real sigmoid(const real& x) + { + return 1.0 / (1.0 + exp(-x)); + } + + + //--------------------------------------------------------------------------- + // neuron + //--------------------------------------------------------------------------- + + struct neuron + { + real bias; + vector weight; + + neuron(const unsigned& num_inputs = 0): weight(num_inputs) {} + + void reset() + { + normal_generator rnd(1.0); + bias = rnd(); + generate(weight.begin(), weight.end(), rnd); + } + + real operator()(const vector& input) const + { + return sigmoid(bias + weight * input); + } + + unsigned length() const { return weight.size() + 1; } + + void normalize() + { + real n = sqrt(bias * bias + weight * weight); + bias /= n; + weight /= n; + } + + void desaturate() + { + bias = -5.0 + 10.0 / (1.0 + exp(bias / -5.0)); + + for (vector::iterator w = weight.begin(); w != weight.end(); ++w) + *w = -5.0 + 10.0 / (1.0 + exp(*w / -5.0)); + } + + void perturb_num(double &num, double magnitude) { + double scale = max(num, 0.05) * magnitude; + double perturbation = scale * (drand48() - 0.5); + num += perturbation; + } + + void perturb(double magnitude = 0.3, double probability = 1.0) + { + + for (vector::iterator w = weight.begin(); w != weight.end(); ++w) + if ( probability >= 1.0 || drand48() < probability) + perturb_num(*w, magnitude); + if ( probability >= 1.0 || drand48() < probability) + perturb_num(bias, magnitude); + } + }; +} + +namespace std { + + ostream& operator<<(ostream& os, const mlp::neuron& n) + { + return os << n.bias << " " << n.weight; + } + + istream& operator>>(istream& is, mlp::neuron& n) + { + return is >> n.bias >> n.weight; + } + +} + +namespace mlp { + + //--------------------------------------------------------------------------- + // layer + //--------------------------------------------------------------------------- + + class layer: public std::vector + { + public: + layer(const unsigned& num_inputs = 0, const unsigned& num_neurons = 0): + std::vector(num_neurons, neuron(num_inputs)) {} + + void reset() + { + normal_generator rnd(1.0); + for(iterator n = begin(); n != end(); ++n) + n->reset(); + } + + vector operator()(const vector& input) const + { + vector output(size()); + + for(unsigned i = 0; i < output.size(); ++i) + output[i] = (*this)[i](input); + + return output; + } + + unsigned length() const { return front().length() * size(); } + + void normalize() + { + for(iterator n = begin(); n != end(); ++n) + n->normalize(); + } + + void desaturate() + { + for(iterator n = begin(); n != end(); ++n) + n->desaturate(); + } + + void perturb(double magnitude = 0.3, double probability = 1.0) + { + for(iterator n = begin(); n != end(); ++n) + n->perturb(); + } + + }; + +} + +namespace std { + + ostream& operator<<(ostream& os, const mlp::layer& l) + { + ostream_iterator oi(os, " "); + copy(l.begin(), l.end(), oi); + return os; + } + + istream& operator>>(istream& is, mlp::layer& l) + { + for (mlp::layer::iterator li = l.begin() ; li != l.end() ; li++) { + is >> *li; + } + return is; + } + +} + +namespace mlp { + + + //--------------------------------------------------------------------------- + // net + //--------------------------------------------------------------------------- + + class net: public std::vector + { + public: + net(const unsigned& num_inputs = 0, + const unsigned& num_outputs = 0, + const std::vector& hidden = std::vector()) + { + init(num_inputs,num_outputs,hidden); + } + + + net(istream &is) { + load(is); + } + + /** Virtual destructor */ + virtual ~net() {}; + + void load(istream &is) { + unsigned num_inputs; + unsigned num_outputs; + unsigned num_hidden_layers; + + is >> num_inputs >> num_outputs >> num_hidden_layers; + + std::vector layer_sizes; + for (unsigned i=0; i> layer_size; + layer_sizes.push_back(layer_size); + } + unsigned check_outputs; + is >> check_outputs; + assert (check_outputs == num_outputs); + init (num_inputs,num_outputs,layer_sizes); + // skip forward to pass up opening '<' char + char c=' '; + while (c!='<' && !is.eof()) { is >> c;} + for (iterator l =begin() ; l != end(); l++) { + is >> *l; + } + do { is >> c; } while (c == ' ' && !is.eof()); + assert(c == '>'); + } + + void init( unsigned num_inputs, + unsigned num_outputs, + const std::vector& hidden ) { + clear(); + switch(hidden.size()) + { + case 0: + push_back(layer(num_inputs, num_outputs)); + break; + default: + push_back(layer(num_inputs, hidden.front())); + for (unsigned i = 0; i < hidden.size() - 1; ++i) + push_back(layer(hidden[i], hidden[i + 1])); + push_back(layer(hidden.back(), num_outputs)); + break; + } + } + + void reset() + { + normal_generator rnd(1.0); + for(iterator l = begin(); l != end(); ++l) + l->reset(); + } + + virtual vector operator()(const vector& input) const ; + + unsigned winner(const vector& input) const + { + vector tmp = (*this)(input); + return (max_element(tmp.begin(), tmp.end()) - tmp.begin()); + } + + void save(ostream &os) const { + // Save the number of inputs, number of outputs, and number of hidden layers + os << num_inputs() << "\n" << num_outputs() << "\n" << num_hidden_layers() << "\n"; + for(const_iterator l = begin(); l != end(); ++l) + os << l->size() << " "; + os << "\n"; + os << *this; + os << "\n"; + } + + unsigned num_inputs() const { return front().front().length() - 1; } + unsigned num_outputs() const { return back().size(); } + unsigned num_hidden_layers() const { + signed s = (signed) size() -1; + return (s<0) ? 0 : s ; + } + + + unsigned length() + { + unsigned sum = 0; + + for(iterator l = begin(); l != end(); ++l) + sum += l->length(); + + return sum; + } + + void normalize() + { + for(iterator l = begin(); l != end(); ++l) + l->normalize(); + } + + void desaturate() + { + for(iterator l = begin(); l != end(); ++l) + l->desaturate(); + } + + void perturb(double magnitude = 0.3, double probability = 1.0) + { + for(iterator l = begin(); l != end(); ++l) + l->perturb(); + } + }; + +#ifndef NO_MLP_VIRTUALS + vector net::operator()(const vector& input) const + { + vector tmp = input; + + for(const_iterator l = begin(); l != end(); ++l) + tmp = (*l)(tmp); + + return tmp; + } +#endif + + + //--------------------------------------------------------------------------- + // sample + //--------------------------------------------------------------------------- + + struct sample + { + vector input, output; + + sample(unsigned input_size = 0, unsigned output_size = 0): + input(input_size), output(output_size) {} + }; + + istream& operator>>(istream& is, sample& s) + { + return is >> s.input >> s.output; + } + + ostream& operator<<(ostream& os, const sample& s) + { + return os << s.input << " " << s.output; + } + + + //--------------------------------------------------------------------------- + // set + //--------------------------------------------------------------------------- + + class set: public std::vector + { + public: + set(unsigned input_size = 0, unsigned output_size = 0, + unsigned num_samples = 0): + std::vector(num_samples, sample(input_size, output_size)) {} + + set(istream& is) : std::vector(0, sample(0, 0)) { + clear(); + load(is); + } + + void load(istream &is) { + unsigned input_size, output_size; + is >> input_size >> output_size; + sample samp(input_size, output_size);; + while (is >> samp) { push_back(samp); } + } + + void save(ostream &os) const { + os << front().input.size() << " " << front().output.size() << endl; + copy(begin(), end(), ostream_iterator(os,"\n")); + } + }; + + ostream& operator<<(ostream& os, const set& s) + { + os << "<" << endl; + for (unsigned i = 0; i < s.size(); ++i) + os << s[i] << endl; + return os << ">"; + } + + //--------------------------------------------------------------------------- + // euclidean_distance + //--------------------------------------------------------------------------- + + real euclidean_distance(const net& n1, const net& n2) + { + real sum = 0; + + for(net::const_reverse_iterator l1 = n1.rbegin(), l2 = n2.rbegin(); + l1 != n1.rend() && l2 != n2.rend(); ++l1, ++l2) + for(layer::const_iterator n1 = l1->begin(), n2 = l2->begin(); + n1 != l1->end() && n2 != l2->end(); ++n1, ++n2) + { + real b = n1->bias - n2->bias; + vector w = n1->weight - n2->weight; + sum += b * b + w * w; + } + /* + #include + std::ofstream file("dist.stat", ios::app); + file << sqrt(sum) << endl; + */ + return sqrt(sum); + } + + //--------------------------------------------------------------------------- + +} // namespace mlp + + + +#endif // mlp_h + + +// Local Variables: +// mode:C++ +// c-file-style: "Stroustrup" +// End: diff --git a/trunk/paradiseo-eo/app/gprop/mse.h b/trunk/paradiseo-eo/app/gprop/mse.h new file mode 100644 index 000000000..841a88e3e --- /dev/null +++ b/trunk/paradiseo-eo/app/gprop/mse.h @@ -0,0 +1,140 @@ +//----------------------------------------------------------------------------- +// mse.h +//----------------------------------------------------------------------------- + +#ifndef mse_h +#define mse_h + +//----------------------------------------------------------------------------- + +#include // neuron layer net set + +//----------------------------------------------------------------------------- + +namespace mse +{ + //--------------------------------------------------------------------------- + // useful typedefs + //--------------------------------------------------------------------------- + + using qp::real; + using qp::vector; + using qp::max_real; + using qp::min_real; + using qp::set; + using qp::neuron; + using qp::layer; + + //--------------------------------------------------------------------------- + // error + //--------------------------------------------------------------------------- + + real error(const mlp::net& net, const set& ts) + { + real error_ = 0.0; + + for (set::const_iterator s = ts.begin(); s != ts.end(); ++s) + { + vector out = net(s->input); + + for (unsigned i = 0; i < out.size(); ++i) + { + real diff = s->output[i] - out[i]; + error_ += diff * diff; + } + } + + return error_ / ts.size(); + } + //------------------------------------------------------------------------- + // mse + //------------------------------------------------------------------------- + + class net: public qp::net + { + public: + net(mlp::net& n): qp::net(n) {} + + real error(const set& ts) + { + real error_ = 0; + + for (set::const_iterator s = ts.begin(); s != ts.end(); ++s) + { + forward(s->input); + error_ += backward(s->input, s->output); + } + error_ /= ts.size(); + + return error_; + } + + private: + real backward(const vector& input, const vector& output) + { + reverse_iterator current_layer = rbegin(); + reverse_iterator backward_layer = current_layer + 1; + real error_ = 0; + + // output layer + for (unsigned j = 0; j < current_layer->size(); ++j) + { + neuron& n = (*current_layer)[j]; + + real diff = output[j] - n.out; + n.ndelta += n.delta = diff * n.out * (1.0 - n.out); + + if (size() == 1) // monolayer + n.dxo += n.delta * input; + else // multilayer + for (unsigned k = 0; k < n.dxo.size(); ++k) + n.dxo[k] += n.delta * (*backward_layer)[k].out; + + error_ += diff * diff; + } + + // hidden layers + while (++current_layer != rend()) + { + reverse_iterator forward_layer = current_layer - 1; + reverse_iterator backward_layer = current_layer + 1; + + for (unsigned j = 0; j < current_layer->size(); ++j) + { + + neuron& n = (*current_layer)[j]; + real sum = 0; + + for (unsigned k = 0; k < forward_layer->size(); ++k) + { + neuron& nf = (*forward_layer)[k]; + sum += nf.delta * (nf.n->weight[j] + nf.dweight1[j]); + } + + n.delta = n.out * (1.0 - n.out) * sum; + n.ndelta += n.delta; + + + if (backward_layer == rend()) // first hidden layer + n.dxo += n.delta * input; + else // rest of hidden layers + for (unsigned k = 0; k < n.dxo.size(); ++k) + n.dxo[k] += n.delta * (*backward_layer)[k].out; + } + } + + return error_; + } + }; + + //--------------------------------------------------------------------------- + +} // namespace mse + +//----------------------------------------------------------------------------- + +#endif // mse_h + +// Local Variables: +// mode:C++ +// End: diff --git a/trunk/paradiseo-eo/app/gprop/qp.h b/trunk/paradiseo-eo/app/gprop/qp.h new file mode 100644 index 000000000..e91425623 --- /dev/null +++ b/trunk/paradiseo-eo/app/gprop/qp.h @@ -0,0 +1,251 @@ +//----------------------------------------------------------------------------- +// qp.h +//----------------------------------------------------------------------------- + +#ifndef qp_h +#define qp_h + +//----------------------------------------------------------------------------- + +#include // istream ostream +#include // fill +#include // vector +#include // uniform_generator +#include // neuron layer net + +//----------------------------------------------------------------------------- + +namespace qp +{ + //--------------------------------------------------------------------------- + // useful typedefs + //--------------------------------------------------------------------------- + + using mlp::real; + using mlp::vector; + + using mlp::max_real; + using mlp::min_real; + + using mlp::set; + + //--------------------------------------------------------------------------- + // useful constants + //--------------------------------------------------------------------------- + + const real eta_default = 0.5; + const real eta_floor = 0.0001; + const real alpha_default = 0.9; + const real lambda_default = 0.5; + const real lambda0 = 0.1; + const real backtrack_step = 0.5; + const real me_floor = 0.0001; + const real mw_floor = 0.0001; + + + //--------------------------------------------------------------------------- + // neuron + //--------------------------------------------------------------------------- + + struct neuron + { + mlp::neuron* n; + real out, delta, ndelta, dbias1, dbias2; + vector dweight1, dweight2, dxo; + + neuron(mlp::neuron& _n): + n(&_n), out(0), delta(0), ndelta(0), dbias1(0), dbias2(0), + dweight1(n->weight.size(), 0), + dweight2(n->weight.size(), 0), + dxo(n->weight.size(), 0) {} + + void reset() + { + // underlaying neuron + n->reset(); + + // addons + out = delta = ndelta = dbias1 = dbias2 = 0; + fill(dweight1.begin(), dweight1.end(), 0); + fill(dweight2.begin(), dweight2.end(), 0); + fill(dxo.begin(), dxo.end(), 0); + } + + real operator()(const vector& input) + { + return out = mlp::sigmoid(n->bias + dbias1 + + (n->weight + dweight1) * input); + } + }; + + ostream& operator<<(ostream& os, const neuron& n) + { + return os << *n.n << " " << n.out << " " << n.delta << " " + << n.ndelta << " " << n.dbias1 << " " << n.dbias2 << " " + << n.dweight1 << " " << n.dweight2 << " " << n.dxo; + } + + + //--------------------------------------------------------------------------- + // layer + //--------------------------------------------------------------------------- + + class layer: public std::vector + { + public: + layer(mlp::layer& l)//: std::vector(l.begin(), l.end()) {} + { + for (mlp::layer::iterator n = l.begin(); n != l.end(); ++n) + push_back(neuron(*n)); + } + + void reset() + { + for(iterator n = begin(); n != end(); ++n) + n->reset(); + } + + vector operator()(const vector& input) + { + vector output(size()); + + for(unsigned i = 0; i < output.size(); ++i) + output[i] = (*this)[i](input); + + return output; + } + }; + + + //--------------------------------------------------------------------------- + // net + //--------------------------------------------------------------------------- + + class net: public std::vector + { + public: + net(mlp::net& n) //: std::vector(n.begin(), n.end()) { reset(); } + { + for (mlp::net::iterator l = n.begin(); l != n.end(); ++l) + push_back(*l); + } + + virtual ~net() {} + + void reset() + { + for(iterator l = begin(); l != end(); ++l) + l->reset(); + } + + real train(const set& ts, + unsigned epochs, + real target_error, + real tolerance, + real eta = eta_default, + real momentum = alpha_default, + real lambda = lambda_default) + { + real error_ = max_real; + + while (epochs-- && error_ > target_error) + { + real last_error = error_; + + init_delta(); + + error_ = error(ts); + + if (error_ < last_error + tolerance) + { + coeff_adapt(eta, momentum, lambda); + weight_update(ts.size(), true, eta, momentum); + } + else + { + eta *= backtrack_step; + eta = max(eta, eta_floor); + momentum = eta * lambda; + weight_update(ts.size(), false, eta, momentum); + error_ = last_error; + } + } + + return error_; + } + + virtual real error(const set& ts) = 0; + + // protected: + void forward(vector input) + { + for (iterator l = begin(); l != end(); ++l) + { + vector tmp = (*l)(input); + input.swap(tmp); + } + } + + // private: + void init_delta() + { + for (iterator l = begin(); l != end(); ++l) + for (layer::iterator n = l->begin(); n != l->end(); ++n) + fill(n->dxo.begin(), n->dxo.end(), n->ndelta = 0.0); + } + + void coeff_adapt(real& eta, real& momentum, real& lambda) + { + real me = 0, mw = 0, ew = 0; + + for (iterator l = begin(); l != end(); ++l) + for (layer::iterator n = l->begin(); n != l->end(); ++n) + { + me += n->dxo * n->dxo; + mw += n->dweight1 * n->dweight1; + ew += n->dxo * n->dweight1; + } + + me = max(static_cast(sqrt(me)), me_floor); + mw = max(static_cast(sqrt(mw)), mw_floor); + eta *= (1.0 + 0.5 * ew / ( me * mw)); + eta = max(eta, eta_floor); + lambda = lambda0 * me / mw; + momentum = eta * lambda; +#ifdef DEBUG + cout << me << " \t" << mw << " \t" << ew << " \t" + << eta << " \t" << momentum << " \t" << lambda << endl; +#endif // DEBUG + } + + void weight_update(unsigned size, bool fire, real eta, real momentum) + { + for (iterator l = begin(); l != end(); ++l) + for (layer::iterator n = l->begin(); n != l->end(); ++n) + { + n->ndelta /= size; + n->dxo /= size; + if (fire) + { + n->n->weight += n->dweight1; + n->dweight2 = n->dweight1; + n->n->bias += n->dbias1; + n->dbias2 = n->dbias1; + } + n->dweight1 = eta * n->dxo + momentum * n->dweight2; + n->dbias1 = eta * n->ndelta + momentum * n->dbias2; + } + } + }; + + //--------------------------------------------------------------------------- + +} // namespace qp + +//----------------------------------------------------------------------------- + +#endif // qp_h + +// Local Variables: +// mode:C++ +// End: diff --git a/trunk/paradiseo-eo/app/gprop/vecop.h b/trunk/paradiseo-eo/app/gprop/vecop.h new file mode 100644 index 000000000..7cd5a6095 --- /dev/null +++ b/trunk/paradiseo-eo/app/gprop/vecop.h @@ -0,0 +1,214 @@ +//----------------------------------------------------------------------------- +// vecop.h +//----------------------------------------------------------------------------- + +#ifndef VECOP_H +#define VECOP_H + +//----------------------------------------------------------------------------- + +#include // ostream istream +#include // vector +#include // plus minus multiplies divides +#include // inner_product + +//----------------------------------------------------------------------------- +// vector + vector +//----------------------------------------------------------------------------- + +template vector operator+(const vector& v1, const vector& v2) +{ + vector tmp = v1; + transform(tmp.begin(), tmp.end(), v2.begin(), tmp.begin(), plus()); + return tmp; +} + +template vector operator-(const vector& v1, const vector& v2) +{ + vector tmp = v1; + transform(tmp.begin(), tmp.end(), v2.begin(), tmp.begin(), minus()); + return tmp; +} + +template T operator*(const vector& v1, const vector& v2) +{ + return inner_product(v1.begin(), v1.end(), v2.begin(), static_cast(0)); +} + +template T operator/(const vector& v1, const vector& v2) +{ + return inner_product(v1.begin(), v1.end(), v2.begin(), static_cast(0), + plus(), divides()); +} + +//----------------------------------------------------------------------------- +// vector += vector +//----------------------------------------------------------------------------- + +template vector& operator+=(vector& v1, const vector& v2) +{ + transform(v1.begin(), v1.end(), v2.begin(), v1.begin(), plus()); + return v1; +} + +template vector& operator-=(vector& v1, const vector& v2) +{ + transform(v1.begin(), v1.end(), v2.begin(), v1.begin(), minus()); + return v1; +} + +//----------------------------------------------------------------------------- +// vector + number +//----------------------------------------------------------------------------- + +template vector operator+(const vector& a, const B& b) +{ + vector tmp = a; + transform(tmp.begin(), tmp.end(), tmp.begin(), bind2nd(plus(), b)); + return tmp; +} + +template vector operator-(const vector& a, const B& b) +{ + vector tmp = a; + transform(tmp.begin(), tmp.end(), tmp.begin(), bind2nd(minus(), b)); + return tmp; +} + +template vector operator*(const vector& a, const B& b) +{ + vector tmp = a; + transform(tmp.begin(), tmp.end(), tmp.begin(), bind2nd(multiplies(), b)); + return tmp; +} + +template vector operator/(const vector& a, const B& b) +{ + vector tmp = a; + transform(tmp.begin(), tmp.end(), tmp.begin(), bind2nd(divides(), b)); + return tmp; +} + +//----------------------------------------------------------------------------- +// number + vector +//----------------------------------------------------------------------------- + +template vector operator+(const B& b, const vector& a) +{ + vector tmp = a; + transform(tmp.begin(), tmp.end(), tmp.begin(), bind2nd(plus(), b)); + return tmp; +} + +template vector operator-(const B& b, const vector& a) +{ + vector tmp(a.size(), b); + transform(tmp.begin(), tmp.end(), a.begin(), tmp.begin(), minus()); + return tmp; +} + +template vector operator*(const B& b, const vector& a) +{ + vector tmp = a; + transform(tmp.begin(), tmp.end(), tmp.begin(), bind2nd(multiplies(), b)); + return tmp; +} + +template vector operator/(const B& b, const vector& a) +{ + vector tmp(a.size(), b); + transform(tmp.begin(), tmp.end(), a.begin(), tmp.begin(), divides()); + return tmp; +} + +//----------------------------------------------------------------------------- +// vector += number +//----------------------------------------------------------------------------- + +template vector& operator+=(vector& a, const B& b) +{ + transform(a.begin(), a.end(), a.begin(), bind2nd(plus(), b)); + return a; +} + +template vector& operator-=(vector& a, const B& b) +{ + transform(a.begin(), a.end(), a.begin(), bind2nd(minus(), b)); + return a; +} + +template vector& operator*=(vector& a, const B& b) +{ + transform(a.begin(), a.end(), a.begin(), bind2nd(multiplies(), b)); + return a; +} + +template vector& operator/=(vector& a, const B& b) +{ + transform(a.begin(), a.end(), a.begin(), bind2nd(divides(), b)); + return a; +} + +//----------------------------------------------------------------------------- +// I/O +//----------------------------------------------------------------------------- + +template ostream& operator<<(ostream& os, const vector& v) +{ + os << '<'; + if (v.size()) + { + copy(v.begin(), v.end() - 1, ostream_iterator(os, " ")); + os << v.back(); + } + return os << '>'; +} + +template istream& operator>>(istream& is, vector& v) +{ + v.clear(); + + char c; + is >> c; + if (!is || c != '<') + is.setstate(ios::failbit); + else + { + T t; + do { + is >> c; + if (is && c!= '>') + { + is.putback(c); + is >> t; + if (is) + v.push_back(t); + } + } while (is && c != '>'); + } + + return is; +} + +//----------------------------------------------------------------------------- +// euclidean_distance +//----------------------------------------------------------------------------- + +template T euclidean_distance(const vector& v1, + const vector& v2) +{ + T sum = 0, tmp; + + for (unsigned i = 0; i < v1.size(); ++i) + { + tmp = v1[i] - v2[i]; + sum += tmp * tmp; + } + + return sqrt(sum); +} + +//----------------------------------------------------------------------------- + +#endif + diff --git a/trunk/paradiseo-eo/app/gpsymreg/.cvsignore b/trunk/paradiseo-eo/app/gpsymreg/.cvsignore new file mode 100644 index 000000000..70845e08e --- /dev/null +++ b/trunk/paradiseo-eo/app/gpsymreg/.cvsignore @@ -0,0 +1 @@ +Makefile.in diff --git a/trunk/paradiseo-eo/app/gpsymreg/CVS/Entries b/trunk/paradiseo-eo/app/gpsymreg/CVS/Entries new file mode 100644 index 000000000..3c6e51430 --- /dev/null +++ b/trunk/paradiseo-eo/app/gpsymreg/CVS/Entries @@ -0,0 +1,7 @@ +/.cvsignore/1.1/Fri Sep 17 17:00:04 2004// +/Makefile.am/1.7/Sun Oct 2 21:42:08 2005// +/fitness.h/1.7/Mon Mar 27 18:55:19 2006// +/main.cpp/1.6/Wed Oct 5 21:34:19 2005// +/node.h/1.6/Mon Feb 4 14:28:00 2002// +/parameters.h/1.1/Thu Jun 28 14:39:36 2001// +D diff --git a/trunk/paradiseo-eo/app/gpsymreg/CVS/Repository b/trunk/paradiseo-eo/app/gpsymreg/CVS/Repository new file mode 100644 index 000000000..54901c042 --- /dev/null +++ b/trunk/paradiseo-eo/app/gpsymreg/CVS/Repository @@ -0,0 +1 @@ +eo/app/gpsymreg diff --git a/trunk/paradiseo-eo/app/gpsymreg/CVS/Root b/trunk/paradiseo-eo/app/gpsymreg/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/app/gpsymreg/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/app/gpsymreg/Makefile.am b/trunk/paradiseo-eo/app/gpsymreg/Makefile.am new file mode 100644 index 000000000..0ada4ba5e --- /dev/null +++ b/trunk/paradiseo-eo/app/gpsymreg/Makefile.am @@ -0,0 +1,15 @@ +# Makefile.am for app/gpsymreg + +noinst_PROGRAMS = gpsymreg + +gpsymreg_SOURCES = main.cpp + +noinst_HEADERS = fitness.h node.h parameters.h + + +LIBEO = $(top_builddir)/src/libeo.a +LIBEOUTILS = $(top_builddir)/src/utils/libeoutils.a + +AM_CXXFLAGS = -I$(top_srcdir)/src +DEPS = $(LIBEO) $(LIBEOUTILS) +LIBS = $(LIBEO) $(LIBEOUTILS) diff --git a/trunk/paradiseo-eo/app/gpsymreg/fitness.h b/trunk/paradiseo-eo/app/gpsymreg/fitness.h new file mode 100644 index 000000000..d8a3f5482 --- /dev/null +++ b/trunk/paradiseo-eo/app/gpsymreg/fitness.h @@ -0,0 +1,228 @@ +/* + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 2 of the License, or + (at your option) any later version. + + This library is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + Lesser General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this library; if not, write to the Free Software + Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + + Contact: todos@geneura.ugr.es, http://geneura.ugr.es + jeggermo@liacs.nl +*/ + +#ifndef _FITNESS_FUNCTION_H +#define _FITNESS_FUNCTION_H + +#include +#include + +#include +#include "parameters.h" +#include "node.h" + +using namespace gp_parse_tree; +using namespace std; + + + +// the first fitness is the normal goal fitness +// the second fitness is the tree size (we prefer smaller trees) +// lets use names to define the different fitnesses +#define NORMAL 0 // Stepwise Adaptation of Weights Fitness +#define SMALLESTSIZE 1 // The size of the tree, we want to minimize this one -- statistics will tell us the smallest tree size + + +// Look: overloading the maximization without overhead (thing can be inlined) +class MinimizingFitnessTraits : public eoParetoFitnessTraits +{ + public : + static bool maximizing(int which) { return false;} // we want to minimize both fitnesses + static unsigned nObjectives() { return 2;} // the number of fitnesses } +}; + +// Lets define our MultiObjective FitnessType +typedef eoParetoFitness FitnessType; + + +// John Koza's sextic polynomial (our example problem) + +double sextic_polynomial(double x) +{ + double result=0; + result = pow(x,6) - (2*pow(x,4)) + pow(x,2); + return result; +}; + +// we use the following functions for the basic math functions + +double _plus(double arg1, double arg2) +{ + return arg1 + arg2; +} + +double _minus(double arg1, double arg2) +{ + return arg1 - arg2; +} + +double _multiplies(double arg1, double arg2) +{ + return arg1 * arg2; +} + +// the function for a protected divide looks a little bit different +double _divides(double arg1, double arg2) +{ + if (arg2 ==0) + return 0; + else + return arg1 / arg2; +} + +double _negate(double arg1) +{ + return -arg1; +} + + + +// now let's define our tree nodes + +void init(vector &initSequence) +{ + + // we have only one variable (X) + Operation varX( (unsigned int) 0, string("X") ); + + + // the main binary operators + Operation OpPLUS ( _plus, string("+")); + Operation OpMINUS( _minus,string("-")); + Operation OpMULTIPLIES(_multiplies,string("*")); + // We can use a protected divide function. + Operation OpDIVIDE( _divides, string("/") ); + + + // Now the functions as binary functions + Operation PLUS( string("plus"), _plus); + Operation MINUS( string("minus"), _minus); + Operation MULTIPLIES( string("multiply"), _multiplies); + Operation DIVIDE( string("divide"), _divides); + + + // and some unary functions + Operation NEGATE( _negate,string("-")); + Operation SIN ( sin, string("sin")); + Operation COS ( cos, string("cos")); + + // Now we are ready to add the possible nodes to our initSequence (which is used by the eoDepthInitializer) + + // so lets start with our variable + initSequence.push_back(varX); + + // followed by the constants 2, 4, 6 + for(unsigned int i=2; i <= 6; i+=2) + { + char text[255]; + sprintf(text, "%i", i); + Operation op(i*1.0, text); + initSequence.push_back( op ); + // and we add the variable again (so we have get lots of variables); + initSequence.push_back( varX ); + } + + // next we add the unary functions + + initSequence.push_back( NEGATE ); + initSequence.push_back( SIN ); + initSequence.push_back( COS ); + + // and the binary functions + initSequence.push_back( PLUS); + initSequence.push_back( MINUS ); + initSequence.push_back( MULTIPLIES ); + initSequence.push_back( DIVIDE ); + + // and the binary operators + initSequence.push_back( OpPLUS); + initSequence.push_back( OpMINUS ); + + initSequence.push_back( OpMULTIPLIES ); + initSequence.push_back( OpDIVIDE ); + + +}; + + + +class RegFitness: public eoEvalFunc< eoParseTree > +{ + public: + + typedef eoParseTree EoType; + + void operator()(EoType &_eo) + { + + vector< double > input(1); // the input variable(s) + double output(0.); + double target; + FitnessType fitness; + + + float x=0; + double fit=0; + for(x=-1; x <= 1; x+=0.1) + { + input[0] = x; + target = sextic_polynomial(x); + _eo.apply(output,input); + + fit += pow(target - output, 2); + } + + fitness[NORMAL] = fit; + + fitness[SMALLESTSIZE] = _eo.size() / (1.0*parameter.MaxSize); + _eo.fitness(fitness); + + if (fitness[NORMAL] < best[NORMAL]) + { + best[NORMAL] = fitness[NORMAL]; + tree=""; + _eo.apply(tree); + } + + } + + + + RegFitness(eoValueParam &_generationCounter, vector< Node > &initSequence, Parameters &_parameter) : eoEvalFunc(), generationCounter(_generationCounter), parameter(_parameter) + { + init(initSequence); + best[NORMAL] = 1000; + tree= "not found"; + }; + + ~RegFitness() + { + cerr << "Best Fitness= " << best[NORMAL] << endl; + cerr << tree << endl; + }; + + private: + eoValueParam &generationCounter; // so we know the current generation + Parameters ¶meter; // the parameters + FitnessType best; // the best found fitness + string tree; +}; + +#endif + diff --git a/trunk/paradiseo-eo/app/gpsymreg/main.cpp b/trunk/paradiseo-eo/app/gpsymreg/main.cpp new file mode 100644 index 000000000..aeb7c6450 --- /dev/null +++ b/trunk/paradiseo-eo/app/gpsymreg/main.cpp @@ -0,0 +1,172 @@ +/* + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 2 of the License, or + (at your option) any later version. + + This library is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + Lesser General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this library; if not, write to the Free Software + Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + + Contact: todos@geneura.ugr.es, http://geneura.ugr.es + jeggermo@liacs.nl +*/ + +#ifdef _MSC_VER +#pragma warning(disable:4786) +#endif + +#ifdef HAVE_CONFIG_H +#include +#endif + +#include +#include "gp/eoParseTree.h" +#include "eo" + +using namespace gp_parse_tree; +using namespace std; + +//----------------------------------------------------------------------------- + +#include "node.h" +#include "parameters.h" +#include "fitness.h" + + +// TYPE DECLARATIONS FOR GP + + +typedef eoParseTree EoType; +typedef eoPop Pop; + +//----------------------------------------------------------------------------- + +int main(int argc, char *argv[]) +{ + + // the vector containing the possible nodes + vector initSequence; + + // initialise parameters + Parameters parameter(argc, argv); + + // set the randomseed + rng.reseed(parameter.randomseed); + + // Create a generation counter + eoValueParam generationCounter(0, "Gen."); + + // Create an incrementor (sub-class of eoUpdater). Note that the + // parameter's value is passed by reference, + // so every time the incrementer is updated (every generation), + // the data in generationCounter will change. + eoIncrementor increment(generationCounter.value()); + + + // create an instantiation of the fitness/evaluation function + // it initializes the initSequence vector + // the parameters are passed on as well + RegFitness eval(generationCounter, initSequence, parameter); + + // Depth Initializor, set for Ramped Half and Half Initialization + eoParseTreeDepthInit initializer(parameter.InitMaxDepth, initSequence, true, true); + + // create the initial population + Pop pop(parameter.population_size, initializer); + + // and evaluate the individuals + apply(eval, pop); + + generationCounter.value()++; // set the generationCounter to 1 + + + // define X-OVER + + eoSubtreeXOver xover(parameter.MaxSize); + + // define MUTATION + eoBranchMutation mutation(initializer, parameter.MaxSize); +// eoExpansionMutation mutation(initializer, parameter.MaxSize); +// eoCollapseSubtreeMutation mutation(initializer, parameter.MaxSize); +// eoPointMutation mutation(initSequence); +// eoHoistMutation mutation; + + // The operators are encapsulated into an eoTRansform object, + // that performs sequentially crossover and mutation + eoSGATransform transform(xover, parameter.xover_rate, mutation, parameter.mutation_rate); + + // The robust tournament selection + // in our case 5-tournament selection + eoDetTournamentSelect selectOne(parameter.tournamentsize); + // is now encapsulated in a eoSelectMany + eoSelectMany select(selectOne, parameter.offspring_size, eo_is_an_integer); + + // and the generational replacement + //eoGenerationalReplacement replace; + // or the SteadtState replacment + //eoSSGAWorseReplacement replace; + // or comma selection + eoCommaReplacement replace; + + // Terminators + eoGenContinue term(parameter.nGenerations); + + eoCheckPoint checkPoint(term); + + // STATISTICS + eoAverageStat avg; + eoBestFitnessStat best; + + + // Add it to the checkpoint, + // so the counter is updated (here, incremented) every generation + checkPoint.add(increment); + checkPoint.add(avg); + checkPoint.add(best); + +#ifdef HAVE_GNUPLOT + eoGnuplot1DMonitor gnuplotmonitor("gnuplotBestStats"); + gnuplotmonitor.add(generationCounter); + gnuplotmonitor.add(best); + // we need to add a empty string variable if we want to seed the second fitness value + eoValueParam dummy1("", "Smallest Tree Size"); + gnuplotmonitor.add(dummy1); + + eoGnuplot1DMonitor gnuplotAvgmonitor("gnuplotAvgStats"); + gnuplotAvgmonitor.add(generationCounter); + gnuplotAvgmonitor.add(avg); + // we need to add a empty string variable if we want to seed the second fitness value + eoValueParam dummy2("", "Average Tree Size"); + gnuplotAvgmonitor.add(dummy2); + + checkPoint.add(gnuplotmonitor); + checkPoint.add(gnuplotAvgmonitor); +#endif + // GP Generation + eoEasyEA gp(checkPoint, eval, select, transform, replace); + + cout << "Initialization done" << endl; + + + try + { + gp(pop); + } + catch (exception& e) + { + cout << "exception: " << e.what() << endl;; + exit(EXIT_FAILURE); + } + + return 1; + +}; + + + diff --git a/trunk/paradiseo-eo/app/gpsymreg/node.h b/trunk/paradiseo-eo/app/gpsymreg/node.h new file mode 100644 index 000000000..85aa4479e --- /dev/null +++ b/trunk/paradiseo-eo/app/gpsymreg/node.h @@ -0,0 +1,248 @@ +/* + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 2 of the License, or + (at your option) any later version. + + This library is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + Lesser General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this library; if not, write to the Free Software + Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + + Contact: todos@geneura.ugr.es, http://geneura.ugr.es + jeggermo@liacs.nl +*/ + +#ifndef _NODE_H +#define _NODE_H + + + +#include +#include +#include // for finite(double) function + +using namespace gp_parse_tree; +using namespace std; + + +/* A new Operation and Node class for even more flexibility. + + Improvements over the t-eoSymreg code are: + + * No hardcoded functions or operators. The Operation and Node class below + allow you to specify your own unary and binary functions as well as + binary operators (like +,-,*,/). Moreover you can detemine if you want + to allow primitve subroutines with either one or two arguments. + + If a Node has a subroutine Operation it will take evaluate the first + (and possible second) child branch and use them as input variables for + the remaining second (or third) child branch. +*/ + + +typedef enum {Variable, UFunction, BFunction, BOperator, Const} Type; + +typedef double (*BinaryFunction)(const double,const double); +typedef double (*UnaryFunction)(const double); + +struct Operation +{ + public: + + typedef unsigned int VariableID; + typedef string Label; + + + // if your compiler allows you to have nameless unions you can make this a + // union by removing the //'s below + + //union + //{ + UnaryFunction uFunction; + BinaryFunction bFunction; + VariableID id; + double constant; + //}; + + + + Label label; + Type type; + + // the default constructor results in a constant with value 0 + Operation() : constant(0), label("0"), type(Const){}; + // two possible constructors for Unary Functions + Operation(UnaryFunction _uf, Label _label): uFunction(_uf), label(_label), type(UFunction) {}; + Operation(Label _label, UnaryFunction _uf): uFunction(_uf), label(_label), type(UFunction) {}; + + // Watch out there are two constructors using pointers two binary functions: + // Binary Function (printed as label(subtree0,subtree1) (e.g. pow(x,y)) + // Binary Operator (printed as (subtree0 label subtree1) (e.g. x^y) + // The difference is purely cosmetic. + + // If you specify the label before the function pointer -> Binary Function + Operation(Label _label, BinaryFunction _bf): bFunction(_bf), label(_label), type(BFunction) {}; + // If you specify the function pointer before the label -> Binary Operator + Operation(BinaryFunction _bf, Label _label): bFunction(_bf), label(_label), type(BOperator) {}; + + // A constructor for variables + Operation(VariableID _id, Label _label): id(_id), label(_label), type(Variable) {}; + // A constructor for constants + Operation(double _constant, Label _label): constant(_constant), label(_label), type(Const) {}; + + + Operation(const Operation &_op) + { + switch(_op.type) + { + case Variable: id = _op.id; break; + case UFunction: uFunction = _op.uFunction; break; + case BFunction: bFunction = _op.bFunction; break; + case BOperator: bFunction = _op.bFunction; break; + case Const: constant = _op.constant; break; + } + type = _op.type; + label = _op.label; + }; + virtual ~Operation(){}; + +}; + + +class Node +{ + private: + Operation op; + + public: + + Node(void): op(Operation()){}; + Node(Operation &_op) : op(_op){}; + virtual ~Node(void) {} + + int arity(void) const + { + switch(op.type) + { + case Variable: return 0; + case UFunction: return 1; + case BFunction: return 2; + case BOperator: return 2; + case Const: return 0; + } + return 0; + } + + void randomize(void) {} + + template + void operator()(double& result, Children args, vector &var) const + { + double result0; + double result1; + + + switch(op.type) + { + case Variable: result = var[op.id%var.size()]; //%var.size() used in the case of Subroutines and as a security measure + break; + case UFunction: args[0].apply(result0, var); + result = op.uFunction(result0); + break; + case BFunction: + case BOperator: args[0].apply(result0, var); + args[1].apply(result1, var); + result = op.bFunction(result0,result1); + break; + case Const: result = op.constant; + break; + + } + + } + + template + void operator()(string& result, Children args) const + { + + string subtree0; + string subtree1; + string subtree2; + + switch(op.type) + { + + case Variable: + case Const: result += op.label; + break; + + case UFunction: result += op.label; + result += "("; + args[0].apply(subtree0); + result += subtree0; + result += ")"; + break; + case BFunction: result += op.label; + result += "("; + args[0].apply(subtree0); + result += subtree0; + result += ","; + args[1].apply(subtree1); + result += subtree1; + result += ")"; + break; + case BOperator: result += "("; + args[0].apply(subtree0); + result += subtree0; + result += op.label; + args[1].apply(subtree1); + result += subtree1; + result += ")"; + break; + default: result += "ERROR in Node::operator(string,...) \n"; break; + } + } + + Operation getOp(void) const {return op;} + +}; + + + + + + + + + + + +//----------------------------------------------------------- +// saving, loading LETS LEAVE IT OUT FOR NOW + + + +std::ostream& operator<<(std::ostream& os, const Node& eot) +{ + Operation op(eot.getOp()); + + os << (eot.getOp()).label; + return os; +} + + +// we can't load because we are using function pointers. Instead we prevent a compiler warning by calling the arity() function. +std::istream& operator>>(std::istream& is, Node& eot) +{ + eot.arity(); + return is; +} + + + +#endif diff --git a/trunk/paradiseo-eo/app/gpsymreg/parameters.h b/trunk/paradiseo-eo/app/gpsymreg/parameters.h new file mode 100644 index 000000000..4cd23ec09 --- /dev/null +++ b/trunk/paradiseo-eo/app/gpsymreg/parameters.h @@ -0,0 +1,112 @@ +/* + This library is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 2 of the License, or + (at your option) any later version. + + This library is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + Lesser General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this library; if not, write to the Free Software + Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + + Contact: todos@geneura.ugr.es, http://geneura.ugr.es + jeggermo@liacs.nl +*/ + +#ifndef _PARAMETERS_FUNCTION_H +#define _PARAMETERS_FUNCTION_H + +#include +#include + +using namespace gp_parse_tree; +using namespace std; + +struct Parameters{ + unsigned int nGenerations; // -G + unsigned population_size; // -P + unsigned offspring_size; // -O + unsigned int MaxSize; // -S + unsigned int InitMaxDepth; // -D + unsigned int randomseed; // -R + double xover_rate; // -x + double mutation_rate; // -y + unsigned int tournamentsize; // -t + + + Parameters(int argc, char **argv) + { + eoParser parser(argc,argv); + + // generations + eoValueParam paramGenerations(1, "generations", "Generations", 'G', false); + parser.processParam( paramGenerations ); + nGenerations = paramGenerations.value(); + cerr << "nGenerations= " << nGenerations << endl; + + // populationsize + eoValueParam paramPopulationSize(10, "populationsize", "PopulationSize", 'P', false); + parser.processParam( paramPopulationSize ); + population_size = paramPopulationSize.value(); + cerr << "population_size= " << population_size << endl; + + // offspringsize + eoValueParam paramOffspringSize(population_size, "offspringsize", "OffspringSize", 'O', false); + parser.processParam( paramOffspringSize ); + offspring_size = paramOffspringSize.value(); + cerr << "offspring_size= " << offspring_size << endl; + + // maxsize + eoValueParam paramMaxSize(15, "maxsize", "MaxSize", 'S', false); + parser.processParam( paramMaxSize ); + MaxSize = paramMaxSize.value(); + cerr << "MaxSize= " << MaxSize << endl; + + // initialmaxdepth + eoValueParam paramInitialMaxDepth(4, "initialmaxdepth", "InitialMaxDepth", 'D', false); + parser.processParam( paramInitialMaxDepth ); + InitMaxDepth = paramInitialMaxDepth.value(); + cerr << "InitMaxDepth= " << InitMaxDepth << endl; + + // randomseed + eoValueParam paramRandomSeed(1, "randomseed", "Random Seed", 'R', false); + parser.processParam( paramRandomSeed ); + randomseed = paramRandomSeed.value(); + cerr << "randomseed= " << randomseed << endl; + + + // crossover-rate + eoValueParam paramXover(0.75, "crossoverrate", "crossover rate", 'x', false); + parser.processParam(paramXover ); + xover_rate = paramXover.value(); + cerr << "xover_rate= " << xover_rate << endl; + + //mutation-rate + eoValueParam paramMutation(0.25, "mutationrate", "mutation rate", 'm', false); + parser.processParam(paramMutation ); + mutation_rate = paramMutation.value(); + cerr << "mutation_rate= " << mutation_rate << endl; + + //tournament size + eoValueParam paramTournamentSize(5, "tournamentsize", "tournament size", 't', false); + parser.processParam(paramTournamentSize ); + tournamentsize = paramTournamentSize.value(); + cerr << "Tournament Size= " << tournamentsize << endl; + + + if (parser.userNeedsHelp()) + { + parser.printHelp(cout); + exit(1); + } + + }; + + ~Parameters(){}; +}; + +#endif diff --git a/trunk/paradiseo-eo/app/master/CVS/Entries b/trunk/paradiseo-eo/app/master/CVS/Entries new file mode 100644 index 000000000..178481050 --- /dev/null +++ b/trunk/paradiseo-eo/app/master/CVS/Entries @@ -0,0 +1 @@ +D diff --git a/trunk/paradiseo-eo/app/master/CVS/Repository b/trunk/paradiseo-eo/app/master/CVS/Repository new file mode 100644 index 000000000..9d16e7422 --- /dev/null +++ b/trunk/paradiseo-eo/app/master/CVS/Repository @@ -0,0 +1 @@ +eo/app/master diff --git a/trunk/paradiseo-eo/app/master/CVS/Root b/trunk/paradiseo-eo/app/master/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/app/master/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/app/mastermind/.cvsignore b/trunk/paradiseo-eo/app/mastermind/.cvsignore new file mode 100644 index 000000000..2b85cb056 --- /dev/null +++ b/trunk/paradiseo-eo/app/mastermind/.cvsignore @@ -0,0 +1,4 @@ +Makefile.in +Makefile +mastermind +.deps diff --git a/trunk/paradiseo-eo/app/mastermind/CVS/Entries b/trunk/paradiseo-eo/app/mastermind/CVS/Entries new file mode 100644 index 000000000..ad51786f6 --- /dev/null +++ b/trunk/paradiseo-eo/app/mastermind/CVS/Entries @@ -0,0 +1,5 @@ +/.cvsignore/1.1/Mon Dec 11 09:28:40 2000// +/Makefile.am/1.6/Sun Oct 2 21:42:08 2005// +/mastermind.cpp/1.5/Thu Dec 23 15:29:07 2004// +/mastermind.h/1.9/Sun Oct 2 21:42:08 2005// +D diff --git a/trunk/paradiseo-eo/app/mastermind/CVS/Repository b/trunk/paradiseo-eo/app/mastermind/CVS/Repository new file mode 100644 index 000000000..39d31c0b0 --- /dev/null +++ b/trunk/paradiseo-eo/app/mastermind/CVS/Repository @@ -0,0 +1 @@ +eo/app/mastermind diff --git a/trunk/paradiseo-eo/app/mastermind/CVS/Root b/trunk/paradiseo-eo/app/mastermind/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/app/mastermind/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/app/mastermind/Makefile.am b/trunk/paradiseo-eo/app/mastermind/Makefile.am new file mode 100644 index 000000000..91caec05d --- /dev/null +++ b/trunk/paradiseo-eo/app/mastermind/Makefile.am @@ -0,0 +1,14 @@ +# Makefile.am for app/mastermind + +noinst_PROGRAMS = mastermind + +mastermind_SOURCES = mastermind.cpp + +noinst_HEADERS = mastermind.h + +LIBEO = $(top_builddir)/src/libeo.a +LIBEOUTILS = $(top_builddir)/src/utils/libeoutils.a + +AM_CXXFLAGS = -I$(top_srcdir)/src +DEPS = $(LIBEO) $(LIBEOUTILS) +LIBS = $(LIBEO) $(LIBEOUTILS) diff --git a/trunk/paradiseo-eo/app/mastermind/mastermind.cpp b/trunk/paradiseo-eo/app/mastermind/mastermind.cpp new file mode 100644 index 000000000..9a2ed163e --- /dev/null +++ b/trunk/paradiseo-eo/app/mastermind/mastermind.cpp @@ -0,0 +1,138 @@ +//----------------------------------------------------------------------------- +// mastermind +//----------------------------------------------------------------------------- + +#include // EXIT_SUCCESS EXIT_FAILURE +#include // exception +#include // cerr cout +#include // ifstream +#include // string +#include // all usefull eo stuff + +#include "mastermind.h" // Chrom eoChromInit eoChromMutation eoChromXover eoChromEvaluator + +using namespace std; + +//----------------------------------------------------------------------------- +// global variables +//----------------------------------------------------------------------------- + +unsigned in, out, hidden; + +//----------------------------------------------------------------------------- +// parameters +//----------------------------------------------------------------------------- + +eoValueParam pop_size(16, "pop_size", "population size", 'p'); +eoValueParam generations(100, "generations", "number of generation", 'g'); +eoValueParam mut_rate(0.1, "mut_rate", "mutation rate", 'm'); +eoValueParam xover_rate(0.5, "xover_rate", "default crossover rate", 'x'); +eoValueParam col_p(default_colors, "colors", "number of colors", 'c'); +eoValueParam len_p(default_length, "legth", "solution legth", 'l'); +eoValueParam sol_p(default_solution, "solution", "problem solution", 's'); + +//----------------------------------------------------------------------------- +// auxiliar functions +//----------------------------------------------------------------------------- + +void arg(int argc, char** argv); +void ga(); + +//----------------------------------------------------------------------------- +// main +//----------------------------------------------------------------------------- + +int main(int argc, char** argv) +{ + try + { + arg(argc, argv); + ga(); + } + catch (exception& e) + { + cerr << argv[0] << ": " << e.what() << endl; + exit(EXIT_FAILURE); + } + + return 0; +} + +//----------------------------------------------------------------------------- +// implementation +//----------------------------------------------------------------------------- + +void arg(int argc, char** argv) +{ + eoParser parser(argc, argv); + + parser.processParam(pop_size, "genetic operators"); + parser.processParam(generations, "genetic operators"); + parser.processParam(mut_rate, "genetic operators"); + parser.processParam(xover_rate, "genetic operators"); + parser.processParam(col_p, "problem"); + parser.processParam(len_p, "problem"); + parser.processParam(sol_p, "problem"); + + if (parser.userNeedsHelp()) + { + parser.printHelp(cout); + exit(EXIT_SUCCESS); + } + + init_eoChromEvaluator(col_p.value(), len_p.value(), sol_p.value()); +} + +//----------------------------------------------------------------------------- + +void ga() +{ + // create population + eoInitChrom init; + eoPop pop(pop_size.value(), init); + + // evaluate population + eoEvalFuncPtr evaluator(eoChromEvaluator); + apply(evaluator, pop); + + // selector + eoProportionalSelect select(pop); + + // genetic operators + eoChromMutation mutation; + eoChromXover xover; + + // stop condition + eoGenContinue continuator1(generations.value()); + eoFitContinue continuator2(solution.fitness()); + eoCombinedContinue continuator(continuator1, continuator2); + + // checkpoint + eoCheckPoint checkpoint(continuator); + + // monitor + eoStdoutMonitor monitor; + checkpoint.add(monitor); + + // statistics + eoBestFitnessStat stats; + checkpoint.add(stats); + monitor.add(stats); + + // genetic algorithm + eoSGA sga(select, + xover, xover_rate.value(), + mutation, mut_rate.value(), + evaluator, + checkpoint); + sga(pop); + + cout << "solution = " << solution << endl + << "best = " << *max_element(pop.begin(), pop.end()) << endl; +} + +//----------------------------------------------------------------------------- + +// Local Variables: +// mode:C++ +// End: diff --git a/trunk/paradiseo-eo/app/mastermind/mastermind.h b/trunk/paradiseo-eo/app/mastermind/mastermind.h new file mode 100644 index 000000000..60cd2662c --- /dev/null +++ b/trunk/paradiseo-eo/app/mastermind/mastermind.h @@ -0,0 +1,199 @@ +//----------------------------------------------------------------------------- +// mastermind.h +//----------------------------------------------------------------------------- + +#ifndef mastermind_h +#define mastermind_h + +//----------------------------------------------------------------------------- + +#include // exit EXIT_FAILURE +#include // eoVectorLength +#include // eoMonOp eoQuadraticOp +#include // eoInit +#include "utils/rnd_generators.h" // uniform_generator + +//----------------------------------------------------------------------------- +// phenotype +//----------------------------------------------------------------------------- + +typedef float phenotype; + +//----------------------------------------------------------------------------- +// genotype +//----------------------------------------------------------------------------- + +typedef std::vector genotype; + +//----------------------------------------------------------------------------- +// Chrom +//----------------------------------------------------------------------------- + +typedef eoVector Chrom; + +//----------------------------------------------------------------------------- +// eoChromEvaluator +//----------------------------------------------------------------------------- + +// const unsigned points_per_black = 3, points_per_white = 1; +Chrom solution; + +phenotype eoChromEvaluator(const Chrom& chrom) +{ + Chrom tmp = solution; + unsigned black = 0, white = 0; + + // look for blacks + for (unsigned i = 0; i < chrom.size(); ++i) + if (chrom[i] == tmp[i]) + { + ++black; + tmp[i] = -1; + } + + // look for whites + for (unsigned i = 0; i < chrom.size(); ++i) + for (unsigned j = 0; j < tmp.size(); ++j) + if (chrom[i] == tmp[j]) + { + ++white; + tmp[j] = -1; + break; + } + + // return black * points_per_black + white * points_per_white; + return black * chrom.size() + white; +}; + +const unsigned default_length = 8; +const unsigned default_colors = 8; +const std::string default_solution = "01234567"; + + +unsigned num_colors; + +void init_eoChromEvaluator(const unsigned& c, const unsigned& l, std::string s) +{ + num_colors = c; + + // check consistency between parameters + if (s != default_solution) + { + // check length + if (l != default_length && s.size() != l) + { + std::cerr << "solution length != length" << std::endl; + exit(EXIT_FAILURE); + } + + // check number of colors + if ((c != default_colors) && (c < unsigned(*max_element(s.begin(), s.end()) - '0'))) + { + std::cerr << "too high color number found!" << std::endl; + exit(EXIT_FAILURE); + } + } + else + if (l != default_length || c != default_colors ) + // generate a random solution + if(num_colors <= 10) + { + uniform_generator color('0', static_cast('0' + c)); + s.resize(l); + generate(s.begin(), s.end(), color); + } + + // put the solution parameter on the solution chromosome + if (num_colors <= 10) + { + solution.resize(s.size()); + for (unsigned i = 0; i < solution.size(); ++i) + solution[i] = s[i] - '0'; + } + else + { + solution.resize(l); + uniform_generator color(0, num_colors); + generate(solution.begin(), solution.end(), color); + } + + solution.fitness(eoChromEvaluator(solution)); +} + +//----------------------------------------------------------------------------- +// eoChromInit +//----------------------------------------------------------------------------- + +class eoInitChrom: public eoInit +{ +public: + void operator()(Chrom& chrom) + { + uniform_generator color(0, num_colors); + chrom.resize(solution.size()); + generate(chrom.begin(), chrom.end(), color); + chrom.invalidate(); + } +}; + +//----------------------------------------------------------------------------- +// eoChromMutation +//----------------------------------------------------------------------------- + +class eoChromMutation: public eoMonOp +{ + // many operators in one :( + bool operator()(Chrom& chrom) + { + uniform_generator what(0, 2); + uniform_generator position(0, chrom.size()); + + switch(what()) + { + case 0: + { + // mutation + uniform_generator color(0, num_colors); + chrom[position()] = color(); + break; + } + case 1: + { + // transposition + std::swap(chrom[position()], chrom[position()]); + break; + } + default: + { + std::cerr << "unknown operator!" << std::endl; + exit(EXIT_FAILURE); + break; + } + } + + return true; + } +}; + +//----------------------------------------------------------------------------- +// eoChromXover +//----------------------------------------------------------------------------- + +class eoChromXover: public eoQuadOp +{ +public: + bool operator()(Chrom& chrom1, Chrom& chrom2) + { + uniform_generator position(0, chrom1.size()); + swap_ranges(chrom1.begin(), chrom1.begin() + position(), chrom2.begin()); + return true; + } +}; + +//----------------------------------------------------------------------------- + +#endif // mastermind_h + +// Local Variables: +// mode:C++ +// End: diff --git a/trunk/paradiseo-eo/autogen.sh b/trunk/paradiseo-eo/autogen.sh new file mode 100755 index 000000000..7825332c3 --- /dev/null +++ b/trunk/paradiseo-eo/autogen.sh @@ -0,0 +1,39 @@ +#!/bin/sh + +DIE=0 +PROG=eo + +(autoconf --version) < /dev/null > /dev/null 2>&1 || +{ + echo + echo "You must have autoconf installed to compile $PROG." + DIE=1 +} + +(automake --version) < /dev/null > /dev/null 2>&1 || +{ + echo + echo "You must have automake installed to compile $PROG." + DIE=1 +} + +if test "$DIE" -eq 1; then + exit 1 +fi + +set aclocalinclude="$ACLOCAL_FLAGS" +aclocal $aclocalinclude +unset $aclocalinclude +autoheader +automake -a -c +autoconf + +# we want doc to be recompiled - and it keeps saying it's up to date!!! +# touch doc/eo.cfg + +echo +echo "Now run 'configure' and 'make' to build $PROG." +echo "You can check the libraries by running 'make check'" +echo +echo "If you have Doxygen installed, type 'make doc' to generate $PROG documentation." +echo diff --git a/trunk/paradiseo-eo/build-freebsd-x86/CVS/Entries b/trunk/paradiseo-eo/build-freebsd-x86/CVS/Entries new file mode 100644 index 000000000..178481050 --- /dev/null +++ b/trunk/paradiseo-eo/build-freebsd-x86/CVS/Entries @@ -0,0 +1 @@ +D diff --git a/trunk/paradiseo-eo/build-freebsd-x86/CVS/Repository b/trunk/paradiseo-eo/build-freebsd-x86/CVS/Repository new file mode 100644 index 000000000..fca224234 --- /dev/null +++ b/trunk/paradiseo-eo/build-freebsd-x86/CVS/Repository @@ -0,0 +1 @@ +eo/build-freebsd-x86 diff --git a/trunk/paradiseo-eo/build-freebsd-x86/CVS/Root b/trunk/paradiseo-eo/build-freebsd-x86/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/build-freebsd-x86/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/build-linux-x86/CVS/Entries b/trunk/paradiseo-eo/build-linux-x86/CVS/Entries new file mode 100644 index 000000000..178481050 --- /dev/null +++ b/trunk/paradiseo-eo/build-linux-x86/CVS/Entries @@ -0,0 +1 @@ +D diff --git a/trunk/paradiseo-eo/build-linux-x86/CVS/Repository b/trunk/paradiseo-eo/build-linux-x86/CVS/Repository new file mode 100644 index 000000000..4216116a2 --- /dev/null +++ b/trunk/paradiseo-eo/build-linux-x86/CVS/Repository @@ -0,0 +1 @@ +eo/build-linux-x86 diff --git a/trunk/paradiseo-eo/build-linux-x86/CVS/Root b/trunk/paradiseo-eo/build-linux-x86/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/build-linux-x86/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/configure.in b/trunk/paradiseo-eo/configure.in new file mode 100644 index 000000000..9f30947f0 --- /dev/null +++ b/trunk/paradiseo-eo/configure.in @@ -0,0 +1,74 @@ +dnl Process this file with autoconf to produce a configure script. +dnl +dnl Change the version number here +AC_INIT([Evolving Objects], [0.9.4-cvs], [eodev-help@sourceforge.net], [eo]) +AC_PREREQ(2.53) + +dnl make sure we are compiling from the correct sources +AC_CONFIG_SRCDIR(src/eoOp.h) + +dnl define host, build, and target machine +AC_CANONICAL_BUILD +AC_CANONICAL_HOST +AC_CANONICAL_TARGET + +dnl automake initialization +AM_INIT_AUTOMAKE([gnu dist-bzip2 dist-zip]) +AM_CONFIG_HEADER(config.h) + +dnl Checks for programs. +AC_PROG_CC +AC_PROG_CXX +AC_PROG_INSTALL +AC_PROG_LN_S +AC_PROG_MAKE_SET +AC_PROG_RANLIB +AC_PATH_PROG([AR], [ar], [false], [$PATH:/usr/ccs/bin]) # solaris-x86 needs extra path +AC_ARG_VAR([DOXYGEN], [automatic documentation generation]) +AC_CHECK_PROGS([DOXYGEN], [doxygen], [true]) + +dnl Checks for header files. +AC_LANG(C++) +AC_HEADER_STDC +AC_CHECK_HEADERS(limits, [], AC_MSG_ERROR([Need limits C++ include.])) +AC_CHECK_HEADERS(sstream, [], AC_MSG_ERROR([Need sstream C++ include.])) +AC_CHECK_HEADERS(stdint.h, [], AC_MSG_WARN([Need C99 standard header.])) + +dnl Checks for typedefs, structures, and compiler characteristics. +AC_CHECK_SIZEOF(unsigned long) +AC_CHECK_TYPES(uint32_t, [], AC_MSG_WARN([Need uint32_t from C99 standard.])) +AC_TYPE_SIZE_T + +dnl Checks for libraries. + +dnl Checks for library functions. +AC_CHECK_LIB(m, cos) + +dnl user-switches +AC_APPLICATIONS +AC_GNUPLOT +AC_TUTORIAL + +dnl create makefiles +AC_OUTPUT(Makefile \ + app/Makefile \ + app/mastermind/Makefile \ + app/gprop/Makefile \ + app/gpsymreg/Makefile \ + contrib/Makefile \ + doc/Makefile \ + src/Makefile \ + src/do/Makefile \ + src/es/Makefile \ + src/gp/Makefile \ + src/ga/Makefile \ + src/other/Makefile \ + src/utils/Makefile \ + test/Makefile \ + tutorial/Makefile \ + tutorial/Lesson1/Makefile \ + tutorial/Lesson2/Makefile \ + tutorial/Lesson3/Makefile \ + tutorial/Lesson4/Makefile \ + tutorial/Lesson5/Makefile \ + win/Makefile) diff --git a/trunk/paradiseo-eo/contrib/.cvsignore b/trunk/paradiseo-eo/contrib/.cvsignore new file mode 100644 index 000000000..3dda72986 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/.cvsignore @@ -0,0 +1,2 @@ +Makefile.in +Makefile diff --git a/trunk/paradiseo-eo/contrib/CVS/Entries b/trunk/paradiseo-eo/contrib/CVS/Entries new file mode 100644 index 000000000..c21b64fb3 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/CVS/Entries @@ -0,0 +1,5 @@ +/.cvsignore/1.2/Thu Nov 23 19:15:31 2000// +/Makefile.am/1.4/Tue Sep 21 10:23:32 2004// +/eoAged.h/1.2/Thu Feb 27 19:26:54 2003// +/eoDrawable.h/1.1/Wed Mar 22 14:48:49 2000// +D diff --git a/trunk/paradiseo-eo/contrib/CVS/Entries.Log b/trunk/paradiseo-eo/contrib/CVS/Entries.Log new file mode 100644 index 000000000..b1a5f9119 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/CVS/Entries.Log @@ -0,0 +1,3 @@ +A D/MGE//// +A D/boost//// +A D/mathsym//// diff --git a/trunk/paradiseo-eo/contrib/CVS/Repository b/trunk/paradiseo-eo/contrib/CVS/Repository new file mode 100644 index 000000000..9d8eeefcf --- /dev/null +++ b/trunk/paradiseo-eo/contrib/CVS/Repository @@ -0,0 +1 @@ +eo/contrib diff --git a/trunk/paradiseo-eo/contrib/CVS/Root b/trunk/paradiseo-eo/contrib/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/contrib/MGE/CVS/Entries b/trunk/paradiseo-eo/contrib/MGE/CVS/Entries new file mode 100644 index 000000000..0e9072d39 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/MGE/CVS/Entries @@ -0,0 +1,4 @@ +/VirusOp.h/1.3/Thu Feb 27 19:26:43 2003// +/eoInitVirus.h/1.1/Thu May 17 10:08:25 2001// +/eoVirus.h/1.4/Thu Oct 6 17:22:40 2005// +D diff --git a/trunk/paradiseo-eo/contrib/MGE/CVS/Repository b/trunk/paradiseo-eo/contrib/MGE/CVS/Repository new file mode 100644 index 000000000..82f9e9f9b --- /dev/null +++ b/trunk/paradiseo-eo/contrib/MGE/CVS/Repository @@ -0,0 +1 @@ +eo/contrib/MGE diff --git a/trunk/paradiseo-eo/contrib/MGE/CVS/Root b/trunk/paradiseo-eo/contrib/MGE/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/MGE/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/contrib/MGE/VirusOp.h b/trunk/paradiseo-eo/contrib/MGE/VirusOp.h new file mode 100644 index 000000000..c0daa8ccb --- /dev/null +++ b/trunk/paradiseo-eo/contrib/MGE/VirusOp.h @@ -0,0 +1,144 @@ +/* + ViruOp.h + (c) GeNeura Team 2001, Marc Schoenauer 2000 + + This library is free software; you can redistribute it and/or + modify it under the terms of the GNU Lesser General Public + License as published by the Free Software Foundation; either + version 2 of the License, or (at your option) any later version. + + This library is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + Lesser General Public License for more details. + + You should have received a copy of the GNU Lesser General Public + License along with this library; if not, write to the Free Software + Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + + Contact: todos@geneura.ugr.es, http://geneura.ugr.es + Marc.Schoenauer@polytechnique.fr +CVS Info: $Date: 2003/02/27 19:26:43 $ $Header: /cvsroot/eodev/eo/contrib/MGE/VirusOp.h,v 1.3 2003/02/27 19:26:43 okoenig Exp $ $Author: okoenig $ +*/ + +#ifndef VirusOp_h +#define VirusOp_h + +//----------------------------------------------------------------------------- + +#include // ostream, istream +#include // bind2nd +#include // std::string + +#include +#include "../contrib/MGE/eoVirus.h" + +/** VirusBitFlip --> changes 1 bit +*/ + +template +class VirusBitFlip: public eoMonOp > { + public: + /// The class name. + virtual std::string className() const { return "VirusBitFlip"; }; + + /** + * Change one bit. + * @param chrom The cromosome which one bit is going to be changed. + */ + bool operator()(eoVirus& _chrom) { + unsigned i = eo::rng.random(_chrom.size()); + _chrom.virusBitSet(i, _chrom.virusBit(i) ? false : true ); + return true; + } +}; + +template +class VirusMutation: public eoMonOp > { + public: + /// The class name. + virtual std::string className() const { return "VirusMutation"; }; + + /** + * Change one bit. + * @param chrom The cromosome which one bit is going to be changed. + */ + bool operator()(eoVirus& _chrom) { + // Search for virus bits + std::vector bitsSet; + for ( unsigned i = 0; i < _chrom.size(); i ++ ) { + if ( _chrom.virusBit(i) ) { + bitsSet.push_back( i ); + } + } + if ( !bitsSet.size() ) { + return false; + } + unsigned flipSite = eo::rng.random(bitsSet.size()); + unsigned flipValue = bitsSet[ flipSite ]; + _chrom[flipValue] = _chrom[flipValue] ? false : true; + return true; + } +}; + +/// Works for 1-bit virus; shifts the one to the right or left +template +class VirusShiftMutation: public eoMonOp > { + public: + + /// Ctor + VirusShiftMutation( ) {}; + + /// The class name. + virtual std::string className() const { return "VirusShiftMutation"; }; + + /** + * Change one bit. + * @param chrom The cromosome which one bit is going to be changed. + */ + bool operator()(eoVirus& _chrom) { + // Search for virus bits + eoBooleanGenerator gen; + for ( unsigned i = 0; i < _chrom.size(); i ++ ) { + if ( _chrom.virusBit(i) ) { + if ( gen() ) { + if ( i + 1 < _chrom.size() ) { + _chrom.virusBitSet(i+1,true); + _chrom.virusBitSet(i, false); + } + } else { + if ( i - 1 > 0 ) { + _chrom.virusBitSet(i-1,true); + _chrom.virusBitSet(i, false); + } + } + } + } + return true; + } + + private: +}; + + +template +class VirusTransmission: public eoBinOp > { + public: + /// The class name. + virtual std::string className() const { return "VirusTransmission"; }; + + /** + * Change one bit. + * @param _chrom The "receptor" chromosome + * @param _chrom2 The "donor" chromosome + */ + bool operator()(eoVirus& _chrom,const eoVirus& _chrom2) { + // Search for virus bits + for ( unsigned i = 0; i < _chrom.size(); i ++ ) { + _chrom.virusBitSet(i, _chrom2.virusBit(i) ); + } + return true; + } +}; + +#endif //VirusOp_h diff --git a/trunk/paradiseo-eo/contrib/MGE/eoInitVirus.h b/trunk/paradiseo-eo/contrib/MGE/eoInitVirus.h new file mode 100644 index 000000000..082339c81 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/MGE/eoInitVirus.h @@ -0,0 +1,86 @@ +// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- + +//----------------------------------------------------------------------------- +// eoInit.h +// (c) Maarten Keijzer 2000, GeNeura Team, 2000 +/* + This library is free software; you can redistribute it and/or + modify it under the terms of the GNU Lesser General Public + License as published by the Free Software Foundation; either + version 2 of the License, or (at your option) any later version. + + This library is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + Lesser General Public License for more details. + + You should have received a copy of the GNU Lesser General Public + License along with this library; if not, write to the Free Software + Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + + Contact: todos@geneura.ugr.es, http://geneura.ugr.es + Marc.Schoenauer@polytechnique.fr + mak@dhi.dk + */ +//----------------------------------------------------------------------------- + +#ifndef _eoInitVirus_H +#define _eoInitVirus_H + +#include + +#include +#include +#include +#include + +/** + Initializer for binary chromosome with MGE +*/ +template +class eoInitVirus: public eoInit< eoVirus > { +public: + + eoInitVirus(unsigned _combien, eoRndGenerator& _generator ) + : combien(_combien), generator(_generator) {} + + virtual void operator()( eoVirus& chrom) + { + chrom.resize(combien); + chrom.virResize(combien); + std::generate(chrom.begin(), chrom.end(), generator); + for ( unsigned i = 0; i < combien; i ++ ) { + chrom.virusBitSet(i, generator() ); + } + chrom.invalidate(); + } + +private : + unsigned combien; + /// generic wrapper for eoFunctor (s), to make them have the function-pointer style copy semantics + eoSTLF generator; +}; + +/// Inits the virus with one bit to the left set to one +template +class eoInitVirus1bit: public eoInit< eoVirus > { +public: + + eoInitVirus1bit(unsigned _combien, eoRndGenerator& _generator ) + : combien(_combien), generator(_generator) {} + + virtual void operator()( eoVirus& chrom) + { + chrom.resize(combien); + chrom.virResize(combien); + std::generate(chrom.begin(), chrom.end(), generator); + chrom.virusBitSet(0, true ); + chrom.invalidate(); + } + +private : + unsigned combien; + /// generic wrapper for eoFunctor (s), to make them have the function-pointer style copy semantics + eoSTLF generator; +}; +#endif diff --git a/trunk/paradiseo-eo/contrib/MGE/eoVirus.h b/trunk/paradiseo-eo/contrib/MGE/eoVirus.h new file mode 100644 index 000000000..a7c6aaeea --- /dev/null +++ b/trunk/paradiseo-eo/contrib/MGE/eoVirus.h @@ -0,0 +1,130 @@ +/* eoVirus.h + +(c) GeNeura Team 2001, Marc Schoenauer 2000 + +This library is free software; you can redistribute it and/or modify +it under the terms of the GNU Lesser General Public License as +published by the Free Software Foundation; either version 2 of the +License, or (at your option) any later version. + +This library is distributed in the hope that it will be useful, but +WITHOUT ANY WARRANTY; without even the implied warranty of +MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +Lesser General Public License for more details. + +You should have received a copy of the GNU Lesser General Public +License along with this library; if not, write to the Free Software +Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 +USA + +Contact: todos@geneura.ugr.es, http://geneura.ugr.es + Marc.Schoenauer@polytechnique.fr +*/ + + +#ifndef eoVirus_h +#define eoVirus_h + +#include +#include +#include +#include + +#include "ga/eoBit.h" + +/** +\defgroup bitstring + + Various functions for a bitstring representation +*/ + +/** Implementation of bitstring chromosome. + +@class eoBit eoBit.h ga/eoBit.h +@ingroup bitstring + +Based on STL's vector specialization. +*/ +template +class eoVirus : public eoBit +{ +public: + + using eoBit::begin; + using eoBit::end; + using eoBit::size; + + + /** (Default) Constructor + + @param size Size of the binary std::string. + */ + eoVirus(unsigned _size = 0, bool _value = false, bool _virValue = false): + eoBit(_size, _value), virus( _size, _virValue) {} + + /// My class name + virtual std::string className() const { + return "eoVirus"; + } + + /// Access to virus features + void virResize( unsigned _i ) { + virus.resize(_i ); + } + + /// Access to virus features + bool virusBit( unsigned _i ) const { + return virus[_i]; + } + + /// Change virus features + void virusBitSet( unsigned _i, bool _bit ) { + virus[_i ] = _bit; + } + + /** To print me on a stream. + + @param os The ostream. + */ + virtual void printOn(std::ostream& os) const { + EO::printOn(os); + os << ' '; + os << size() << ' '; + std::copy(begin(), end(), std::ostream_iterator(os)); + std::cout << std::endl; + std::copy(virus.begin(), virus.end(), std::ostream_iterator(os)); + } + + /** To read me from a stream. + + @param is The istream. + */ + virtual void readFrom(std::istream& is){ + eoBit::readFrom(is); + unsigned s; + is >> s; + std::string bits; + is >> bits; + if (is) { + virus.resize(bits.size()); + std::transform(bits.begin(), bits.end(), virus.begin(), + std::bind2nd(std::equal_to(), '1')); + } + } + + +private: + + std::vector virus; +}; + +//----------------------------------------------------------------------------- + +#endif //eoBit_h + + +// Local Variables: +// coding: iso-8859-1 +// mode: C++ +// c-file-style: "Stroustrup" +// End: diff --git a/trunk/paradiseo-eo/contrib/Makefile.am b/trunk/paradiseo-eo/contrib/Makefile.am new file mode 100644 index 000000000..e01377206 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/Makefile.am @@ -0,0 +1,9 @@ +############################################################################### +## +## Makefile.am for eo/src +## +############################################################################### + +pkginclude_HEADERS = eoAged.h eoDrawable.h + +EXTRA_DIST = MGE/VirusOp.h MGE/eoInitVirus.h MGE/eoVirus.h diff --git a/trunk/paradiseo-eo/contrib/boost/CVS/Entries b/trunk/paradiseo-eo/contrib/boost/CVS/Entries new file mode 100644 index 000000000..a00302f7a --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/CVS/Entries @@ -0,0 +1,3 @@ +/config.hpp/1.1/Thu Oct 6 12:13:52 2005// +/limits.hpp/1.1/Thu Oct 6 12:13:52 2005// +D diff --git a/trunk/paradiseo-eo/contrib/boost/CVS/Entries.Log b/trunk/paradiseo-eo/contrib/boost/CVS/Entries.Log new file mode 100644 index 000000000..79d299e96 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/CVS/Entries.Log @@ -0,0 +1,2 @@ +A D/config//// +A D/numeric//// diff --git a/trunk/paradiseo-eo/contrib/boost/CVS/Repository b/trunk/paradiseo-eo/contrib/boost/CVS/Repository new file mode 100644 index 000000000..aedab39a0 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/CVS/Repository @@ -0,0 +1 @@ +eo/contrib/boost diff --git a/trunk/paradiseo-eo/contrib/boost/CVS/Root b/trunk/paradiseo-eo/contrib/boost/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/contrib/boost/config.hpp b/trunk/paradiseo-eo/contrib/boost/config.hpp new file mode 100644 index 000000000..055a27855 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config.hpp @@ -0,0 +1,70 @@ +// Boost config.hpp configuration header file ------------------------------// + +// (C) Copyright John Maddock 2002. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org/libs/config for most recent version. + +// Boost config.hpp policy and rationale documentation has been moved to +// http://www.boost.org/libs/config +// +// CAUTION: This file is intended to be completely stable - +// DO NOT MODIFY THIS FILE! +// + +#ifndef BOOST_CONFIG_HPP +#define BOOST_CONFIG_HPP + +// if we don't have a user config, then use the default location: +#if !defined(BOOST_USER_CONFIG) && !defined(BOOST_NO_USER_CONFIG) +# define BOOST_USER_CONFIG +#endif +// include it first: +#ifdef BOOST_USER_CONFIG +# include BOOST_USER_CONFIG +#endif + +// if we don't have a compiler config set, try and find one: +#if !defined(BOOST_COMPILER_CONFIG) && !defined(BOOST_NO_COMPILER_CONFIG) && !defined(BOOST_NO_CONFIG) +# include +#endif +// if we have a compiler config, include it now: +#ifdef BOOST_COMPILER_CONFIG +# include BOOST_COMPILER_CONFIG +#endif + +// if we don't have a std library config set, try and find one: +#if !defined(BOOST_STDLIB_CONFIG) && !defined(BOOST_NO_STDLIB_CONFIG) && !defined(BOOST_NO_CONFIG) +# include +#endif +// if we have a std library config, include it now: +#ifdef BOOST_STDLIB_CONFIG +# include BOOST_STDLIB_CONFIG +#endif + +// if we don't have a platform config set, try and find one: +#if !defined(BOOST_PLATFORM_CONFIG) && !defined(BOOST_NO_PLATFORM_CONFIG) && !defined(BOOST_NO_CONFIG) +# include +#endif +// if we have a platform config, include it now: +#ifdef BOOST_PLATFORM_CONFIG +# include BOOST_PLATFORM_CONFIG +#endif + +// get config suffix code: +#include + +#endif // BOOST_CONFIG_HPP + + + + + + + + + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/CVS/Entries b/trunk/paradiseo-eo/contrib/boost/config/CVS/Entries new file mode 100644 index 000000000..d5431df9d --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/CVS/Entries @@ -0,0 +1,11 @@ +/abi_prefix.hpp/1.1/Thu Oct 6 12:13:52 2005// +/abi_suffix.hpp/1.1/Thu Oct 6 12:13:52 2005// +/auto_link.hpp/1.1/Thu Oct 6 12:13:52 2005// +/posix_features.hpp/1.1/Thu Oct 6 12:13:52 2005// +/requires_threads.hpp/1.1/Thu Oct 6 12:13:52 2005// +/select_compiler_config.hpp/1.1/Thu Oct 6 12:13:52 2005// +/select_platform_config.hpp/1.1/Thu Oct 6 12:13:52 2005// +/select_stdlib_config.hpp/1.1/Thu Oct 6 12:13:52 2005// +/suffix.hpp/1.1/Thu Oct 6 12:13:52 2005// +/user.hpp/1.1/Thu Oct 6 12:13:52 2005// +D diff --git a/trunk/paradiseo-eo/contrib/boost/config/CVS/Entries.Log b/trunk/paradiseo-eo/contrib/boost/config/CVS/Entries.Log new file mode 100644 index 000000000..33a02e196 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/CVS/Entries.Log @@ -0,0 +1,4 @@ +A D/abi//// +A D/compiler//// +A D/platform//// +A D/stdlib//// diff --git a/trunk/paradiseo-eo/contrib/boost/config/CVS/Repository b/trunk/paradiseo-eo/contrib/boost/config/CVS/Repository new file mode 100644 index 000000000..93a1d3aa4 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/CVS/Repository @@ -0,0 +1 @@ +eo/contrib/boost/config diff --git a/trunk/paradiseo-eo/contrib/boost/config/CVS/Root b/trunk/paradiseo-eo/contrib/boost/config/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/contrib/boost/config/abi/CVS/Entries b/trunk/paradiseo-eo/contrib/boost/config/abi/CVS/Entries new file mode 100644 index 000000000..178481050 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/abi/CVS/Entries @@ -0,0 +1 @@ +D diff --git a/trunk/paradiseo-eo/contrib/boost/config/abi/CVS/Repository b/trunk/paradiseo-eo/contrib/boost/config/abi/CVS/Repository new file mode 100644 index 000000000..aafc1c11e --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/abi/CVS/Repository @@ -0,0 +1 @@ +eo/contrib/boost/config/abi diff --git a/trunk/paradiseo-eo/contrib/boost/config/abi/CVS/Root b/trunk/paradiseo-eo/contrib/boost/config/abi/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/abi/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/contrib/boost/config/abi_prefix.hpp b/trunk/paradiseo-eo/contrib/boost/config/abi_prefix.hpp new file mode 100644 index 000000000..1733dc036 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/abi_prefix.hpp @@ -0,0 +1,20 @@ +// abi_prefix header -------------------------------------------------------// + +// © Copyright John Maddock 2003 + +// Use, modification and distribution are subject to the Boost Software License, +// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at +// http://www.boost.org/LICENSE_1_0.txt). + +#ifndef BOOST_CONFIG_ABI_PREFIX_HPP +# define BOOST_CONFIG_ABI_PREFIX_HPP +#else +# error double inclusion of header boost/config/abi_prefix.hpp is an error +#endif + +#include + +// this must occur after all other includes and before any code appears: +#ifdef BOOST_HAS_ABI_HEADERS +# include BOOST_ABI_PREFIX +#endif diff --git a/trunk/paradiseo-eo/contrib/boost/config/abi_suffix.hpp b/trunk/paradiseo-eo/contrib/boost/config/abi_suffix.hpp new file mode 100644 index 000000000..6339da631 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/abi_suffix.hpp @@ -0,0 +1,23 @@ +// abi_sufffix header -------------------------------------------------------// + +// © Copyright John Maddock 2003 + +// Use, modification and distribution are subject to the Boost Software License, +// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at +// http://www.boost.org/LICENSE_1_0.txt). + +// This header should be #included AFTER code that was preceded by a #include +// . + +#ifndef BOOST_CONFIG_ABI_PREFIX_HPP +# error Header boost/config/abi_prefix.hpp must only be used after boost/config/abi_prefix.hpp +#else +# undef BOOST_CONFIG_ABI_PREFIX_HPP +#endif + +// the suffix header occurs after all of our code: +#ifdef BOOST_HAS_ABI_HEADERS +# include BOOST_ABI_SUFFIX +#endif + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/auto_link.hpp b/trunk/paradiseo-eo/contrib/boost/config/auto_link.hpp new file mode 100644 index 000000000..0c36f7b0f --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/auto_link.hpp @@ -0,0 +1,354 @@ +// (C) Copyright John Maddock 2003. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + + /* + * LOCATION: see http://www.boost.org for most recent version. + * FILE auto_link.hpp + * VERSION see + * DESCRIPTION: Automatic library inclusion for Borland/Microsoft compilers. + */ + +/************************************************************************* + +USAGE: +~~~~~~ + +Before including this header you must define one or more of define the following macros: + +BOOST_LIB_NAME: Required: A string containing the basename of the library, + for example boost_regex. +BOOST_LIB_TOOLSET: Optional: the base name of the toolset. +BOOST_DYN_LINK: Optional: when set link to dll rather than static library. +BOOST_LIB_DIAGNOSTIC: Optional: when set the header will print out the name + of the library selected (useful for debugging). +BOOST_AUTO_LINK_NOMANGLE: Specifies that we should link to BOOST_LIB_NAME.lib, + rather than a mangled-name version. + +These macros will be undef'ed at the end of the header, further this header +has no include guards - so be sure to include it only once from your library! + +Algorithm: +~~~~~~~~~~ + +Libraries for Borland and Microsoft compilers are automatically +selected here, the name of the lib is selected according to the following +formula: + +BOOST_LIB_PREFIX + + BOOST_LIB_NAME + + "_" + + BOOST_LIB_TOOLSET + + BOOST_LIB_THREAD_OPT + + BOOST_LIB_RT_OPT + "-" + + BOOST_LIB_VERSION + +These are defined as: + +BOOST_LIB_PREFIX: "lib" for static libraries otherwise "". + +BOOST_LIB_NAME: The base name of the lib ( for example boost_regex). + +BOOST_LIB_TOOLSET: The compiler toolset name (vc6, vc7, bcb5 etc). + +BOOST_LIB_THREAD_OPT: "-mt" for multithread builds, otherwise nothing. + +BOOST_LIB_RT_OPT: A suffix that indicates the runtime library used, + contains one or more of the following letters after + a hiphen: + + s static runtime (dynamic if not present). + d debug build (release if not present). + g debug/diagnostic runtime (release if not present). + p STLPort Build. + +BOOST_LIB_VERSION: The Boost version, in the form x_y, for Boost version x.y. + + +***************************************************************************/ + +#ifdef __cplusplus +# ifndef BOOST_CONFIG_HPP +# include +# endif +#elif defined(_MSC_VER) && !defined(__MWERKS__) && !defined(__EDG_VERSION__) +// +// C language compatability (no, honestly) +// +# define BOOST_MSVC _MSC_VER +# define BOOST_STRINGIZE(X) BOOST_DO_STRINGIZE(X) +# define BOOST_DO_STRINGIZE(X) #X +#endif +// +// Only include what follows for known and supported compilers: +// +#if defined(BOOST_MSVC) \ + || defined(__BORLANDC__) \ + || (defined(__MWERKS__) && defined(_WIN32) && (__MWERKS__ >= 0x3000)) \ + || (defined(__ICL) && defined(_MSC_EXTENSIONS) && (_MSC_VER >= 1200)) + +#ifndef BOOST_VERSION_HPP +# include +#endif + +#ifndef BOOST_LIB_NAME +# error "Macro BOOST_LIB_NAME not set (internal error)" +#endif + +// +// error check: +// +#if defined(__MSVC_RUNTIME_CHECKS) && !defined(_DEBUG) +# pragma message("Using the /RTC option without specifying a debug runtime will lead to linker errors") +# pragma message("Hint: go to the code generation options and switch to one of the debugging runtimes") +# error "Incompatible build options" +#endif +// +// select toolset if not defined already: +// +#ifndef BOOST_LIB_TOOLSET +#if defined(BOOST_MSVC) && (BOOST_MSVC == 1200) + + // vc6: +# define BOOST_LIB_TOOLSET "vc6" + +#elif defined(BOOST_MSVC) && (BOOST_MSVC == 1300) + + // vc7: +# define BOOST_LIB_TOOLSET "vc7" + +#elif defined(BOOST_MSVC) && (BOOST_MSVC == 1310) + + // vc71: +# define BOOST_LIB_TOOLSET "vc71" + +#elif defined(BOOST_MSVC) && (BOOST_MSVC >= 1400) + + // vc80: +# define BOOST_LIB_TOOLSET "vc80" + +#elif defined(__BORLANDC__) + + // CBuilder 6: +# define BOOST_LIB_TOOLSET "bcb" + +#elif defined(__ICL) + + // Intel C++, no version number: +# define BOOST_LIB_TOOLSET "iw" + +#elif defined(__MWERKS__) && (__MWERKS__ <= 0x31FF ) + + // Metrowerks CodeWarrior 8.x +# define BOOST_LIB_TOOLSET "cw8" + +#elif defined(__MWERKS__) && (__MWERKS__ <= 0x32FF ) + + // Metrowerks CodeWarrior 9.x +# define BOOST_LIB_TOOLSET "cw9" + +#endif +#endif // BOOST_LIB_TOOLSET + +// +// select thread opt: +// +#if defined(_MT) || defined(__MT__) +# define BOOST_LIB_THREAD_OPT "-mt" +#else +# define BOOST_LIB_THREAD_OPT +#endif + +#if defined(_MSC_VER) || defined(__MWERKS__) + +# ifdef _DLL + +# if (defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION)) && (defined(_STLP_OWN_IOSTREAMS) || defined(__STL_OWN_IOSTREAMS)) + +# if defined(_DEBUG) && (defined(__STL_DEBUG) || defined(_STLP_DEBUG)) +# define BOOST_LIB_RT_OPT "-gdp" +# elif defined(_DEBUG) +# define BOOST_LIB_RT_OPT "-gdp" +# pragma message("warning: STLPort debug versions are built with /D_STLP_DEBUG=1") +# error "Build options aren't compatible with pre-built libraries" +# else +# define BOOST_LIB_RT_OPT "-p" +# endif + +# elif defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION) + +# if defined(_DEBUG) && (defined(__STL_DEBUG) || defined(_STLP_DEBUG)) +# define BOOST_LIB_RT_OPT "-gdpn" +# elif defined(_DEBUG) +# define BOOST_LIB_RT_OPT "-gdpn" +# pragma message("warning: STLPort debug versions are built with /D_STLP_DEBUG=1") +# error "Build options aren't compatible with pre-built libraries" +# else +# define BOOST_LIB_RT_OPT "-pn" +# endif + +# else + +# if defined(_DEBUG) +# define BOOST_LIB_RT_OPT "-gd" +# else +# define BOOST_LIB_RT_OPT +# endif + +# endif + +# else + +# if (defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION)) && (defined(_STLP_OWN_IOSTREAMS) || defined(__STL_OWN_IOSTREAMS)) + +# if defined(_DEBUG) && (defined(__STL_DEBUG) || defined(_STLP_DEBUG)) +# define BOOST_LIB_RT_OPT "-sgdp" +# elif defined(_DEBUG) +# define BOOST_LIB_RT_OPT "-sgdp" +# pragma message("warning: STLPort debug versions are built with /D_STLP_DEBUG=1") +# error "Build options aren't compatible with pre-built libraries" +# else +# define BOOST_LIB_RT_OPT "-sp" +# endif + +# elif defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION) + +# if defined(_DEBUG) && (defined(__STL_DEBUG) || defined(_STLP_DEBUG)) +# define BOOST_LIB_RT_OPT "-sgdpn" +# elif defined(_DEBUG) +# define BOOST_LIB_RT_OPT "-sgdpn" +# pragma message("warning: STLPort debug versions are built with /D_STLP_DEBUG=1") +# error "Build options aren't compatible with pre-built libraries" +# else +# define BOOST_LIB_RT_OPT "-spn" +# endif + +# else + +# if defined(_DEBUG) +# define BOOST_LIB_RT_OPT "-sgd" +# else +# define BOOST_LIB_RT_OPT "-s" +# endif + +# endif + +# endif + +#elif defined(__BORLANDC__) + +// +// figure out whether we want the debug builds or not: +// +#if __BORLANDC__ > 0x561 +#pragma defineonoption BOOST_BORLAND_DEBUG -v +#endif +// +// sanity check: +// +#if defined(__STL_DEBUG) || defined(_STLP_DEBUG) +#error "Pre-built versions of the Boost libraries are not provided in STLPort-debug form" +#endif + +# ifdef _RTLDLL + +# ifdef BOOST_BORLAND_DEBUG +# define BOOST_LIB_RT_OPT "-d" +# else +# define BOOST_LIB_RT_OPT +# endif + +# else + +# ifdef BOOST_BORLAND_DEBUG +# define BOOST_LIB_RT_OPT "-sd" +# else +# define BOOST_LIB_RT_OPT "-s" +# endif + +# endif + +#endif + +// +// select linkage opt: +// +#if (defined(_DLL) || defined(_RTLDLL)) && defined(BOOST_DYN_LINK) +# define BOOST_LIB_PREFIX +#elif defined(BOOST_DYN_LINK) +# error "Mixing a dll boost library with a static runtime is a really bad idea..." +#else +# define BOOST_LIB_PREFIX "lib" +#endif + +// +// now include the lib: +// +#if defined(BOOST_LIB_NAME) \ + && defined(BOOST_LIB_PREFIX) \ + && defined(BOOST_LIB_TOOLSET) \ + && defined(BOOST_LIB_THREAD_OPT) \ + && defined(BOOST_LIB_RT_OPT) \ + && defined(BOOST_LIB_VERSION) + +#ifndef BOOST_AUTO_LINK_NOMANGLE +# pragma comment(lib, BOOST_LIB_PREFIX BOOST_STRINGIZE(BOOST_LIB_NAME) "-" BOOST_LIB_TOOLSET BOOST_LIB_THREAD_OPT BOOST_LIB_RT_OPT "-" BOOST_LIB_VERSION ".lib") +# ifdef BOOST_LIB_DIAGNOSTIC +# pragma message ("Linking to lib file: " BOOST_LIB_PREFIX BOOST_STRINGIZE(BOOST_LIB_NAME) "-" BOOST_LIB_TOOLSET BOOST_LIB_THREAD_OPT BOOST_LIB_RT_OPT "-" BOOST_LIB_VERSION ".lib") +# endif +#else +# pragma comment(lib, BOOST_STRINGIZE(BOOST_LIB_NAME) ".lib") +# ifdef BOOST_LIB_DIAGNOSTIC +# pragma message ("Linking to lib file: " BOOST_STRINGIZE(BOOST_LIB_NAME) ".lib") +# endif +#endif + +#else +# error "some required macros where not defined (internal logic error)." +#endif + + +#endif // _MSC_VER || __BORLANDC__ + +// +// finally undef any macros we may have set: +// +#ifdef BOOST_LIB_PREFIX +# undef BOOST_LIB_PREFIX +#endif +#if defined(BOOST_LIB_NAME) +# undef BOOST_LIB_NAME +#endif +#if defined(BOOST_LIB_TOOLSET) +# undef BOOST_LIB_TOOLSET +#endif +#if defined(BOOST_LIB_THREAD_OPT) +# undef BOOST_LIB_THREAD_OPT +#endif +#if defined(BOOST_LIB_RT_OPT) +# undef BOOST_LIB_RT_OPT +#endif +#if defined(BOOST_LIB_LINK_OPT) +# undef BOOST_LIB_LINK_OPT +#endif +#if defined(BOOST_LIB_DEBUG_OPT) +# undef BOOST_LIB_DEBUG_OPT +#endif +#if defined(BOOST_DYN_LINK) +# undef BOOST_DYN_LINK +#endif +#if defined(BOOST_AUTO_LINK_NOMANGLE) +# undef BOOST_AUTO_LINK_NOMANGLE +#endif + + + + + + + + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/compiler/CVS/Entries b/trunk/paradiseo-eo/contrib/boost/config/compiler/CVS/Entries new file mode 100644 index 000000000..d2881275f --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/compiler/CVS/Entries @@ -0,0 +1,17 @@ +/borland.hpp/1.1/Thu Oct 6 12:13:52 2005// +/comeau.hpp/1.1/Thu Oct 6 12:13:52 2005// +/common_edg.hpp/1.1/Thu Oct 6 12:13:52 2005// +/compaq_cxx.hpp/1.1/Thu Oct 6 12:13:52 2005// +/digitalmars.hpp/1.1/Thu Oct 6 12:13:52 2005// +/gcc.hpp/1.1/Thu Oct 6 12:13:52 2005// +/greenhills.hpp/1.1/Thu Oct 6 12:13:52 2005// +/hp_acc.hpp/1.1/Thu Oct 6 12:13:52 2005// +/intel.hpp/1.1/Thu Oct 6 12:13:52 2005// +/kai.hpp/1.1/Thu Oct 6 12:13:52 2005// +/metrowerks.hpp/1.1/Thu Oct 6 12:13:52 2005// +/mpw.hpp/1.1/Thu Oct 6 12:13:52 2005// +/sgi_mipspro.hpp/1.1/Thu Oct 6 12:13:52 2005// +/sunpro_cc.hpp/1.1/Thu Oct 6 12:13:52 2005// +/vacpp.hpp/1.1/Thu Oct 6 12:13:52 2005// +/visualc.hpp/1.1/Thu Oct 6 12:13:52 2005// +D diff --git a/trunk/paradiseo-eo/contrib/boost/config/compiler/CVS/Repository b/trunk/paradiseo-eo/contrib/boost/config/compiler/CVS/Repository new file mode 100644 index 000000000..fb29c86b3 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/compiler/CVS/Repository @@ -0,0 +1 @@ +eo/contrib/boost/config/compiler diff --git a/trunk/paradiseo-eo/contrib/boost/config/compiler/CVS/Root b/trunk/paradiseo-eo/contrib/boost/config/compiler/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/compiler/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/contrib/boost/config/compiler/borland.hpp b/trunk/paradiseo-eo/contrib/boost/config/compiler/borland.hpp new file mode 100644 index 000000000..66769bec5 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/compiler/borland.hpp @@ -0,0 +1,175 @@ +// (C) Copyright John Maddock 2001 - 2003. +// (C) Copyright David Abrahams 2002 - 2003. +// (C) Copyright Aleksey Gurtovoy 2002. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// Borland C++ compiler setup: + +// Version 5.0 and below: +# if __BORLANDC__ <= 0x0550 +// Borland C++Builder 4 and 5: +# define BOOST_NO_MEMBER_TEMPLATE_FRIENDS +# if __BORLANDC__ == 0x0550 +// Borland C++Builder 5, command-line compiler 5.5: +# define BOOST_NO_OPERATORS_IN_NAMESPACE +# endif +# endif + +// Version 5.51 and below: +#if (__BORLANDC__ <= 0x551) +# define BOOST_NO_CV_SPECIALIZATIONS +# define BOOST_NO_CV_VOID_SPECIALIZATIONS +# define BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS +# define BOOST_NO_DEDUCED_TYPENAME +// workaround for missing WCHAR_MAX/WCHAR_MIN: +#include +#include +#ifndef WCHAR_MAX +# define WCHAR_MAX 0xffff +#endif +#ifndef WCHAR_MIN +# define WCHAR_MIN 0 +#endif +#endif + +// Version 7.0 (Kylix) and below: +#if (__BORLANDC__ <= 0x570) +# define BOOST_NO_SFINAE +# define BOOST_NO_INTEGRAL_INT64_T +# define BOOST_NO_DEPENDENT_NESTED_DERIVATIONS +# define BOOST_NO_PRIVATE_IN_AGGREGATE +# define BOOST_NO_USING_TEMPLATE +# define BOOST_BCB_PARTIAL_SPECIALIZATION_BUG +# define BOOST_NO_TEMPLATE_TEMPLATES +# define BOOST_NO_USING_DECLARATION_OVERLOADS_FROM_TYPENAME_BASE +# define BOOST_NO_MEMBER_TEMPLATE_FRIENDS + // we shouldn't really need this - but too many things choke + // without it, this needs more investigation: +# define BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS +# define BOOST_FUNCTION_SCOPE_USING_DECLARATION_BREAKS_ADL +# define BOOST_NO_IS_ABSTRACT +# ifdef NDEBUG + // fix broken so that Boost.test works: +# include +# undef strcmp +# endif + +// +// new bug in 5.61: +#if (__BORLANDC__ >= 0x561) && (__BORLANDC__ <= 0x570) + // this seems to be needed by the command line compiler, but not the IDE: +# define BOOST_NO_MEMBER_FUNCTION_SPECIALIZATIONS +#endif + +# ifdef _WIN32 +# define BOOST_NO_SWPRINTF +# elif defined(linux) || defined(__linux__) || defined(__linux) + // we should really be able to do without this + // but the wcs* functions aren't imported into std:: +# define BOOST_NO_STDC_NAMESPACE + // _CPPUNWIND doesn't get automatically set for some reason: +# pragma defineonoption BOOST_CPPUNWIND -x +# endif +#endif + +// +// Post 0x561 we have long long and stdint.h: +#if __BORLANDC__ >= 0x561 +# ifndef __NO_LONG_LONG +# define BOOST_HAS_LONG_LONG +# endif + // On non-Win32 platforms let the platform config figure this out: +# ifdef _WIN32 +# define BOOST_HAS_STDINT_H +# endif +#endif + +// Borland C++Builder 6 defaults to using STLPort. If _USE_OLD_RW_STL is +// defined, then we have 0x560 or greater with the Rogue Wave implementation +// which presumably has the std::DBL_MAX bug. +#if ((__BORLANDC__ >= 0x550) && (__BORLANDC__ < 0x560)) || defined(_USE_OLD_RW_STL) +// is partly broken, some macros define symbols that are really in +// namespace std, so you end up having to use illegal constructs like +// std::DBL_MAX, as a fix we'll just include float.h and have done with: +#include +#endif +// +// __int64: +// +#if (__BORLANDC__ >= 0x530) && !defined(__STRICT_ANSI__) +# define BOOST_HAS_MS_INT64 +#endif +// +// check for exception handling support: +// +#if !defined(_CPPUNWIND) && !defined(BOOST_CPPUNWIND) && !defined(__EXCEPTIONS) +# define BOOST_NO_EXCEPTIONS +#endif +// +// all versions have a : +// +#ifndef __STRICT_ANSI__ +# define BOOST_HAS_DIRENT_H +#endif +// +// all versions support __declspec: +// +#ifndef __STRICT_ANSI__ +# define BOOST_HAS_DECLSPEC +#endif +// +// ABI fixing headers: +// +#if __BORLANDC__ < 0x600 // not implemented for version 6 compiler yet +#ifndef BOOST_ABI_PREFIX +# define BOOST_ABI_PREFIX "boost/config/abi/borland_prefix.hpp" +#endif +#ifndef BOOST_ABI_SUFFIX +# define BOOST_ABI_SUFFIX "boost/config/abi/borland_suffix.hpp" +#endif +#endif +// +// Disable Win32 support in ANSI mode: +// +#if __BORLANDC__ < 0x600 +# pragma defineonoption BOOST_DISABLE_WIN32 -A +#elif defined(__STRICT_ANSI__) +# define BOOST_DISABLE_WIN32 +#endif +// +// MSVC compatibility mode does some nasty things: +// +#if defined(_MSC_VER) && (_MSC_VER <= 1200) +# define BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP +# define BOOST_NO_VOID_RETURNS +#endif + +#define BOOST_COMPILER "Borland C++ version " BOOST_STRINGIZE(__BORLANDC__) + +// +// versions check: +// we don't support Borland prior to version 5.4: +#if __BORLANDC__ < 0x540 +# error "Compiler not supported or configured - please reconfigure" +#endif +// +// last known and checked version is 1536 (Builder X preview): +#if (__BORLANDC__ > 1536) +# if defined(BOOST_ASSERT_CONFIG) +# error "Unknown compiler version - please run the configure tests and report the results" +# else +# pragma message( "Unknown compiler version - please run the configure tests and report the results") +# endif +#endif + + + + + + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/compiler/comeau.hpp b/trunk/paradiseo-eo/contrib/boost/config/compiler/comeau.hpp new file mode 100644 index 000000000..1b71008e0 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/compiler/comeau.hpp @@ -0,0 +1,59 @@ +// (C) Copyright John Maddock 2001. +// (C) Copyright Douglas Gregor 2001. +// (C) Copyright Peter Dimov 2001. +// (C) Copyright Aleksey Gurtovoy 2003. +// (C) Copyright Beman Dawes 2003. +// (C) Copyright Jens Maurer 2003. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// Comeau C++ compiler setup: + +#include "boost/config/compiler/common_edg.hpp" + +#if (__COMO_VERSION__ <= 4245) + +# if defined(_MSC_VER) && _MSC_VER <= 1300 +# if _MSC_VER > 100 + // only set this in non-strict mode: +# define BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP +# endif +# endif + +// Void returns don't work when emulating VC 6 (Peter Dimov) + +# if defined(_MSC_VER) && (_MSC_VER == 1200) +# define BOOST_NO_VOID_RETURNS +# endif + +#endif // version 4245 + +// +// enable __int64 support in VC emulation mode +// +# if defined(_MSC_VER) && (_MSC_VER >= 1200) +# define BOOST_HAS_MS_INT64 +# endif + +#define BOOST_COMPILER "Comeau compiler version " BOOST_STRINGIZE(__COMO_VERSION__) + +// +// versions check: +// we don't know Comeau prior to version 4245: +#if __COMO_VERSION__ < 4245 +# error "Compiler not configured - please reconfigure" +#endif +// +// last known and checked version is 4245: +#if (__COMO_VERSION__ > 4245) +# if defined(BOOST_ASSERT_CONFIG) +# error "Unknown compiler version - please run the configure tests and report the results" +# endif +#endif + + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/compiler/common_edg.hpp b/trunk/paradiseo-eo/contrib/boost/config/compiler/common_edg.hpp new file mode 100644 index 000000000..0443be1ae --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/compiler/common_edg.hpp @@ -0,0 +1,62 @@ +// (C) Copyright John Maddock 2001 - 2002. +// (C) Copyright Jens Maurer 2001. +// (C) Copyright David Abrahams 2002. +// (C) Copyright Aleksey Gurtovoy 2002. +// (C) Copyright Markus Schoepflin 2005. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// +// Options common to all edg based compilers. +// +// This is included from within the individual compiler mini-configs. + +#ifndef __EDG_VERSION__ +# error This file requires that __EDG_VERSION__ be defined. +#endif + +#if (__EDG_VERSION__ <= 238) +# define BOOST_NO_INTEGRAL_INT64_T +# define BOOST_NO_SFINAE +#endif + +#if (__EDG_VERSION__ <= 240) +# define BOOST_NO_VOID_RETURNS +#endif + +#if (__EDG_VERSION__ <= 241) && !defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP) +# define BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP +#endif + +#if (__EDG_VERSION__ <= 244) && !defined(BOOST_NO_TEMPLATE_TEMPLATES) +# define BOOST_NO_TEMPLATE_TEMPLATES +#endif + +#if (__EDG_VERSION__ < 300) && !defined(BOOST_NO_IS_ABSTRACT) +# define BOOST_NO_IS_ABSTRACT +#endif + +#if (__EDG_VERSION__ <= 303) && !defined(BOOST_FUNCTION_SCOPE_USING_DECLARATION_BREAKS_ADL) +# define BOOST_FUNCTION_SCOPE_USING_DECLARATION_BREAKS_ADL +#endif + +// See also kai.hpp which checks a Kai-specific symbol for EH +# if !defined(__KCC) && !defined(__EXCEPTIONS) +# define BOOST_NO_EXCEPTIONS +# endif + +# if !defined(__NO_LONG_LONG) +# define BOOST_HAS_LONG_LONG +# endif + +#ifdef c_plusplus +// EDG has "long long" in non-strict mode +// However, some libraries have insufficient "long long" support +// #define BOOST_HAS_LONG_LONG +#endif + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/compiler/compaq_cxx.hpp b/trunk/paradiseo-eo/contrib/boost/config/compiler/compaq_cxx.hpp new file mode 100644 index 000000000..a52e66a29 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/compiler/compaq_cxx.hpp @@ -0,0 +1,19 @@ +// (C) Copyright John Maddock 2001 - 2003. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// Dec Alpha True64 C++ compiler setup: + +#define BOOST_COMPILER "Dec Alpha True64 " BOOST_STRINGIZE(__DECCXX_VER) + +#include "boost/config/compiler/common_edg.hpp" + +// +// versions check: +// Nothing to do here? + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/compiler/digitalmars.hpp b/trunk/paradiseo-eo/contrib/boost/config/compiler/digitalmars.hpp new file mode 100644 index 000000000..32fc71faf --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/compiler/digitalmars.hpp @@ -0,0 +1,49 @@ +// Copyright (C) Christof Meerwald 2003 +// Copyright (C) Dan Watkins 2003 +// +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// Digital Mars C++ compiler setup: +#define BOOST_COMPILER __DMC_VERSION_STRING__ + +#define BOOST_HAS_LONG_LONG +#define BOOST_HAS_PRAGMA_ONCE + +#if (__DMC__ <= 0x833) +#define BOOST_FUNCTION_SCOPE_USING_DECLARATION_BREAKS_ADL +#define BOOST_NO_TEMPLATE_TEMPLATES +#define BOOST_NEEDS_TOKEN_PASTING_OP_FOR_TOKENS_JUXTAPOSING +#define BOOST_NO_ARRAY_TYPE_SPECIALIZATIONS +#define BOOST_NO_EXPLICIT_FUNCTION_TEMPLATE_ARGUMENTS +#endif +#if (__DMC__ <= 0x840) || !defined(BOOST_STRICT_CONFIG) +#define BOOST_NO_EXPLICIT_FUNCTION_TEMPLATE_ARGUMENTS +#define BOOST_NO_MEMBER_TEMPLATE_FRIENDS +#define BOOST_NO_OPERATORS_IN_NAMESPACE +#define BOOST_NO_UNREACHABLE_RETURN_DETECTION +#define BOOST_NO_SFINAE +#define BOOST_NO_USING_TEMPLATE +#define BOOST_FUNCTION_SCOPE_USING_DECLARATION_BREAKS_ADL +#endif + +// +// has macros: +#if (__DMC__ >= 0x840) +#define BOOST_HAS_DIRENT_H +#define BOOST_HAS_STDINT_H +#define BOOST_HAS_WINTHREADS +#endif + + +// check for exception handling support: +#ifndef _CPPUNWIND +# define BOOST_NO_EXCEPTIONS +#endif + +#if (__DMC__ < 0x840) +# if defined(BOOST_ASSERT_CONFIG) +# error "Unknown compiler version - please run the configure tests and report the results" +# endif +#endif diff --git a/trunk/paradiseo-eo/contrib/boost/config/compiler/gcc.hpp b/trunk/paradiseo-eo/contrib/boost/config/compiler/gcc.hpp new file mode 100644 index 000000000..d94b16b76 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/compiler/gcc.hpp @@ -0,0 +1,105 @@ +// (C) Copyright John Maddock 2001 - 2003. +// (C) Copyright Darin Adler 2001 - 2002. +// (C) Copyright Jens Maurer 2001 - 2002. +// (C) Copyright Beman Dawes 2001 - 2003. +// (C) Copyright Douglas Gregor 2002. +// (C) Copyright David Abrahams 2002 - 2003. +// (C) Copyright Synge Todo 2003. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// GNU C++ compiler setup: + +#if __GNUC__ < 3 +# if __GNUC_MINOR__ == 91 + // egcs 1.1 won't parse shared_ptr.hpp without this: +# define BOOST_NO_AUTO_PTR +# endif +# if __GNUC_MINOR__ < 95 + // + // Prior to gcc 2.95 member templates only partly + // work - define BOOST_MSVC6_MEMBER_TEMPLATES + // instead since inline member templates mostly work. + // +# define BOOST_NO_MEMBER_TEMPLATES +# if __GNUC_MINOR__ >= 9 +# define BOOST_MSVC6_MEMBER_TEMPLATES +# endif +# endif + +# if __GNUC_MINOR__ < 96 +# define BOOST_NO_SFINAE +# endif + +# if __GNUC_MINOR__ <= 97 +# define BOOST_NO_MEMBER_TEMPLATE_FRIENDS +# define BOOST_NO_OPERATORS_IN_NAMESPACE +# endif + +# define BOOST_NO_USING_DECLARATION_OVERLOADS_FROM_TYPENAME_BASE +# define BOOST_FUNCTION_SCOPE_USING_DECLARATION_BREAKS_ADL +# define BOOST_NO_IS_ABSTRACT +#elif __GNUC__ == 3 + // + // gcc-3.x problems: + // + // Bug specific to gcc 3.1 and 3.2: + // +# if ((__GNUC_MINOR__ == 1) || (__GNUC_MINOR__ == 2)) +# define BOOST_NO_EXPLICIT_FUNCTION_TEMPLATE_ARGUMENTS +# endif +# if __GNUC_MINOR__ < 4 +# define BOOST_NO_IS_ABSTRACT +# endif +#endif + +#ifndef __EXCEPTIONS +# define BOOST_NO_EXCEPTIONS +#endif + + +// +// Threading support: Turn this on unconditionally here (except for +// those platforms where we can know for sure). It will get turned off again +// later if no threading API is detected. +// +#if !defined(__MINGW32__) && !defined(linux) && !defined(__linux) && !defined(__linux__) +# define BOOST_HAS_THREADS +#endif + +// +// gcc has "long long" +// +#define BOOST_HAS_LONG_LONG + +// +// gcc implements the named return value optimization since version 3.1 +// +#if __GNUC__ > 3 || ( __GNUC__ == 3 && __GNUC_MINOR__ >= 1 ) +#define BOOST_HAS_NRVO +#endif + +#define BOOST_COMPILER "GNU C++ version " __VERSION__ + +// +// versions check: +// we don't know gcc prior to version 2.90: +#if (__GNUC__ == 2) && (__GNUC_MINOR__ < 90) +# error "Compiler not configured - please reconfigure" +#endif +// +// last known and checked version is 4.0 (Pre-release): +#if (__GNUC__ > 4) || ((__GNUC__ == 4) && (__GNUC_MINOR__ > 0)) +# if defined(BOOST_ASSERT_CONFIG) +# error "Unknown compiler version - please run the configure tests and report the results" +# else +// we don't emit warnings here anymore since there are no defect macros defined for +// gcc post 3.4, so any failures are gcc regressions... +//# warning "Unknown compiler version - please run the configure tests and report the results" +# endif +#endif + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/compiler/greenhills.hpp b/trunk/paradiseo-eo/contrib/boost/config/compiler/greenhills.hpp new file mode 100644 index 000000000..038b6b2b5 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/compiler/greenhills.hpp @@ -0,0 +1,28 @@ +// (C) Copyright John Maddock 2001. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// Greenhills C++ compiler setup: + +#define BOOST_COMPILER "Greenhills C++ version " BOOST_STRINGIZE(__ghs) + +#include "boost/config/compiler/common_edg.hpp" + +// +// versions check: +// we don't support Greenhills prior to version 0: +#if __ghs < 0 +# error "Compiler not supported or configured - please reconfigure" +#endif +// +// last known and checked version is 0: +#if (__ghs > 0) +# if defined(BOOST_ASSERT_CONFIG) +# error "Unknown compiler version - please run the configure tests and report the results" +# endif +#endif + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/compiler/hp_acc.hpp b/trunk/paradiseo-eo/contrib/boost/config/compiler/hp_acc.hpp new file mode 100644 index 000000000..3d05ba563 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/compiler/hp_acc.hpp @@ -0,0 +1,70 @@ +// (C) Copyright John Maddock 2001 - 2003. +// (C) Copyright Jens Maurer 2001 - 2003. +// (C) Copyright Aleksey Gurtovoy 2002. +// (C) Copyright David Abrahams 2002 - 2003. +// (C) Copyright Toon Knapen 2003. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// HP aCC C++ compiler setup: + +#if (__HP_aCC <= 33100) +# define BOOST_NO_INTEGRAL_INT64_T +# define BOOST_NO_OPERATORS_IN_NAMESPACE +# if !defined(_NAMESPACE_STD) +# define BOOST_NO_STD_LOCALE +# define BOOST_NO_STRINGSTREAM +# endif +#endif + +#if (__HP_aCC <= 33300) +// member templates are sufficiently broken that we disable them for now +# define BOOST_NO_MEMBER_TEMPLATES +# define BOOST_NO_DEPENDENT_NESTED_DERIVATIONS +# define BOOST_NO_USING_DECLARATION_OVERLOADS_FROM_TYPENAME_BASE +#endif + +#if (__HP_aCC <= 33900) || !defined(BOOST_STRICT_CONFIG) +# define BOOST_NO_UNREACHABLE_RETURN_DETECTION +# define BOOST_NO_TEMPLATE_TEMPLATES +# define BOOST_NO_SWPRINTF +# define BOOST_NO_DEPENDENT_TYPES_IN_TEMPLATE_VALUE_PARAMETERS +# define BOOST_NO_IS_ABSTRACT +// std lib config should set this one already: +//# define BOOST_NO_STD_ALLOCATOR +#endif + +// optional features rather than defects: +#if (__HP_aCC >= 33900) +# define BOOST_HAS_LONG_LONG +# define BOOST_HAS_PARTIAL_STD_ALLOCATOR +#endif + +#if (__HP_aCC >= 50000 ) && (__HP_aCC <= 53800 ) || (__HP_aCC < 31300 ) +# define BOOST_NO_MEMBER_TEMPLATE_KEYWORD +#endif + +#define BOOST_NO_MEMBER_TEMPLATE_FRIENDS + +#define BOOST_COMPILER "HP aCC version " BOOST_STRINGIZE(__HP_aCC) + +// +// versions check: +// we don't support HP aCC prior to version 0: +#if __HP_aCC < 33000 +# error "Compiler not supported or configured - please reconfigure" +#endif +// +// last known and checked version is 0: +#if (__HP_aCC > 53800) +# if defined(BOOST_ASSERT_CONFIG) +# error "Unknown compiler version - please run the configure tests and report the results" +# endif +#endif + + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/compiler/intel.hpp b/trunk/paradiseo-eo/contrib/boost/config/compiler/intel.hpp new file mode 100644 index 000000000..652557766 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/compiler/intel.hpp @@ -0,0 +1,146 @@ +// (C) Copyright John Maddock 2001. +// (C) Copyright Peter Dimov 2001. +// (C) Copyright Jens Maurer 2001. +// (C) Copyright David Abrahams 2002 - 2003. +// (C) Copyright Aleksey Gurtovoy 2002 - 2003. +// (C) Copyright Guillaume Melquiond 2002 - 2003. +// (C) Copyright Beman Dawes 2003. +// (C) Copyright Martin Wille 2003. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// Intel compiler setup: + +#include "boost/config/compiler/common_edg.hpp" + +#if defined(__INTEL_COMPILER) +# define BOOST_INTEL_CXX_VERSION __INTEL_COMPILER +#elif defined(__ICL) +# define BOOST_INTEL_CXX_VERSION __ICL +#elif defined(__ICC) +# define BOOST_INTEL_CXX_VERSION __ICC +#elif defined(__ECC) +# define BOOST_INTEL_CXX_VERSION __ECC +#endif + +#define BOOST_COMPILER "Intel C++ version " BOOST_STRINGIZE(BOOST_INTEL_CXX_VERSION) +#define BOOST_INTEL BOOST_INTEL_CXX_VERSION + +#if defined(_WIN32) || defined(_WIN64) +# define BOOST_INTEL_WIN BOOST_INTEL +#else +# define BOOST_INTEL_LINUX BOOST_INTEL +#endif + +#if (BOOST_INTEL_CXX_VERSION <= 500) && defined(_MSC_VER) +# define BOOST_NO_EXPLICIT_FUNCTION_TEMPLATE_ARGUMENTS +# define BOOST_NO_TEMPLATE_TEMPLATES +#endif + +#if (BOOST_INTEL_CXX_VERSION <= 600) + +# if defined(_MSC_VER) && (_MSC_VER <= 1300) // added check for <= VC 7 (Peter Dimov) + +// Boost libraries assume strong standard conformance unless otherwise +// indicated by a config macro. As configured by Intel, the EDG front-end +// requires certain compiler options be set to achieve that strong conformance. +// Particularly /Qoption,c,--arg_dep_lookup (reported by Kirk Klobe & Thomas Witt) +// and /Zc:wchar_t,forScope. See boost-root/tools/build/intel-win32-tools.jam for +// details as they apply to particular versions of the compiler. When the +// compiler does not predefine a macro indicating if an option has been set, +// this config file simply assumes the option has been set. +// Thus BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP will not be defined, even if +// the compiler option is not enabled. + +# define BOOST_NO_SWPRINTF +# endif + +// Void returns, 64 bit integrals don't work when emulating VC 6 (Peter Dimov) + +# if defined(_MSC_VER) && (_MSC_VER <= 1200) +# define BOOST_NO_VOID_RETURNS +# define BOOST_NO_INTEGRAL_INT64_T +# endif + +#endif + +#if (BOOST_INTEL_CXX_VERSION <= 710) && defined(_WIN32) +# define BOOST_NO_POINTER_TO_MEMBER_TEMPLATE_PARAMETERS +#endif + +// See http://aspn.activestate.com/ASPN/Mail/Message/boost/1614864 +#if BOOST_INTEL_CXX_VERSION < 600 +# define BOOST_NO_INTRINSIC_WCHAR_T +#else +// We should test the macro _WCHAR_T_DEFINED to check if the compiler +// supports wchar_t natively. *BUT* there is a problem here: the standard +// headers define this macro if they typedef wchar_t. Anyway, we're lucky +// because they define it without a value, while Intel C++ defines it +// to 1. So we can check its value to see if the macro was defined natively +// or not. +// Under UNIX, the situation is exactly the same, but the macro _WCHAR_T +// is used instead. +# if ((_WCHAR_T_DEFINED + 0) == 0) && ((_WCHAR_T + 0) == 0) +# define BOOST_NO_INTRINSIC_WCHAR_T +# endif +#endif + +// +// Verify that we have actually got BOOST_NO_INTRINSIC_WCHAR_T +// set correctly, if we don't do this now, we will get errors later +// in type_traits code among other things, getting this correct +// for the Intel compiler is actually remarkably fragile and tricky: +// +#if defined(BOOST_NO_INTRINSIC_WCHAR_T) +#include +template< typename T > struct assert_no_intrinsic_wchar_t; +template<> struct assert_no_intrinsic_wchar_t { typedef void type; }; +// if you see an error here then you need to unset BOOST_NO_INTRINSIC_WCHAR_T +// where it is defined above: +typedef assert_no_intrinsic_wchar_t::type assert_no_intrinsic_wchar_t_; +#else +template< typename T > struct assert_intrinsic_wchar_t; +template<> struct assert_intrinsic_wchar_t {}; +// if you see an error here then define BOOST_NO_INTRINSIC_WCHAR_T on the command line: +template<> struct assert_intrinsic_wchar_t {}; +#endif + +#if _MSC_VER+0 >= 1000 +# if _MSC_VER >= 1200 +# define BOOST_HAS_MS_INT64 +# endif +# define BOOST_NO_SWPRINTF +#elif defined(_WIN32) +# define BOOST_DISABLE_WIN32 +#endif + +// I checked version 6.0 build 020312Z, it implements the NRVO. +// Correct this as you find out which version of the compiler +// implemented the NRVO first. (Daniel Frey) +#if (BOOST_INTEL_CXX_VERSION >= 600) +# define BOOST_HAS_NRVO +#endif + +// +// versions check: +// we don't support Intel prior to version 5.0: +#if BOOST_INTEL_CXX_VERSION < 500 +# error "Compiler not supported or configured - please reconfigure" +#endif +// +// last known and checked version: +#if (BOOST_INTEL_CXX_VERSION > 900) +# if defined(BOOST_ASSERT_CONFIG) +# error "Unknown compiler version - please run the configure tests and report the results" +# elif defined(_MSC_VER) +# pragma message("Unknown compiler version - please run the configure tests and report the results") +# endif +#endif + + + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/compiler/kai.hpp b/trunk/paradiseo-eo/contrib/boost/config/compiler/kai.hpp new file mode 100644 index 000000000..de16f1a67 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/compiler/kai.hpp @@ -0,0 +1,35 @@ +// (C) Copyright John Maddock 2001. +// (C) Copyright David Abrahams 2002. +// (C) Copyright Aleksey Gurtovoy 2002. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// Kai C++ compiler setup: + +#include "boost/config/compiler/common_edg.hpp" + +# if (__KCC_VERSION <= 4001) || !defined(BOOST_STRICT_CONFIG) + // at least on Sun, the contents of is not in namespace std +# define BOOST_NO_STDC_NAMESPACE +# endif + +// see also common_edg.hpp which needs a special check for __KCC +# if !defined(_EXCEPTIONS) +# define BOOST_NO_EXCEPTIONS +# endif + +#define BOOST_COMPILER "Kai C++ version " BOOST_STRINGIZE(__KCC_VERSION) + +// +// last known and checked version is 4001: +#if (__KCC_VERSION > 4001) +# if defined(BOOST_ASSERT_CONFIG) +# error "Unknown compiler version - please run the configure tests and report the results" +# endif +#endif + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/compiler/metrowerks.hpp b/trunk/paradiseo-eo/contrib/boost/config/compiler/metrowerks.hpp new file mode 100644 index 000000000..f173295eb --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/compiler/metrowerks.hpp @@ -0,0 +1,104 @@ +// (C) Copyright John Maddock 2001. +// (C) Copyright Darin Adler 2001. +// (C) Copyright Peter Dimov 2001. +// (C) Copyright David Abrahams 2001 - 2002. +// (C) Copyright Beman Dawes 2001 - 2003. +// (C) Copyright Stefan Slapeta 2004. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// Metrowerks C++ compiler setup: + +// locale support is disabled when linking with the dynamic runtime +# ifdef _MSL_NO_LOCALE +# define BOOST_NO_STD_LOCALE +# endif + +# if __MWERKS__ <= 0x2301 // 5.3 +# define BOOST_NO_FUNCTION_TEMPLATE_ORDERING +# define BOOST_NO_POINTER_TO_MEMBER_CONST +# define BOOST_NO_DEPENDENT_TYPES_IN_TEMPLATE_VALUE_PARAMETERS +# define BOOST_NO_MEMBER_TEMPLATE_KEYWORD +# endif + +# if __MWERKS__ <= 0x2401 // 6.2 +//# define BOOST_NO_FUNCTION_TEMPLATE_ORDERING +# endif + +# if(__MWERKS__ <= 0x2407) // 7.x +# define BOOST_NO_MEMBER_FUNCTION_SPECIALIZATIONS +# define BOOST_NO_UNREACHABLE_RETURN_DETECTION +# endif + +# if(__MWERKS__ <= 0x3003) // 8.x +# define BOOST_NO_SFINAE +# endif + +// the "|| !defined(BOOST_STRICT_CONFIG)" part should apply to the last +// tested version *only*: +# if(__MWERKS__ <= 0x3206) || !defined(BOOST_STRICT_CONFIG) // 9.5 +# define BOOST_NO_MEMBER_TEMPLATE_FRIENDS +# define BOOST_NO_IS_ABSTRACT +# endif + +#if !__option(wchar_type) +# define BOOST_NO_INTRINSIC_WCHAR_T +#endif + +#if !__option(exceptions) +# define BOOST_NO_EXCEPTIONS +#endif + +#if (__INTEL__ && _WIN32) || (__POWERPC__ && macintosh) +# if __MWERKS__ == 0x3000 +# define BOOST_COMPILER_VERSION 8.0 +# elif __MWERKS__ == 0x3001 +# define BOOST_COMPILER_VERSION 8.1 +# elif __MWERKS__ == 0x3002 +# define BOOST_COMPILER_VERSION 8.2 +# elif __MWERKS__ == 0x3003 +# define BOOST_COMPILER_VERSION 8.3 +# elif __MWERKS__ == 0x3200 +# define BOOST_COMPILER_VERSION 9.0 +# elif __MWERKS__ == 0x3201 +# define BOOST_COMPILER_VERSION 9.1 +# elif __MWERKS__ == 0x3202 +# define BOOST_COMPILER_VERSION 9.2 +# elif __MWERKS__ == 0x3204 +# define BOOST_COMPILER_VERSION 9.3 +# elif __MWERKS__ == 0x3205 +# define BOOST_COMPILER_VERSION 9.4 +# elif __MWERKS__ == 0x3206 +# define BOOST_COMPILER_VERSION 9.5 +# else +# define BOOST_COMPILER_VERSION __MWERKS__ +# endif +#else +# define BOOST_COMPILER_VERSION __MWERKS__ +#endif + +#define BOOST_COMPILER "Metrowerks CodeWarrior C++ version " BOOST_STRINGIZE(BOOST_COMPILER_VERSION) + +// +// versions check: +// we don't support Metrowerks prior to version 5.3: +#if __MWERKS__ < 0x2301 +# error "Compiler not supported or configured - please reconfigure" +#endif +// +// last known and checked version: +#if (__MWERKS__ > 0x3205) +# if defined(BOOST_ASSERT_CONFIG) +# error "Unknown compiler version - please run the configure tests and report the results" +# endif +#endif + + + + + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/compiler/mpw.hpp b/trunk/paradiseo-eo/contrib/boost/config/compiler/mpw.hpp new file mode 100644 index 000000000..8ab2aacb6 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/compiler/mpw.hpp @@ -0,0 +1,51 @@ +// (C) Copyright John Maddock 2001 - 2002. +// (C) Copyright Aleksey Gurtovoy 2002. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// MPW C++ compilers setup: + +# if defined(__SC__) +# define BOOST_COMPILER "MPW SCpp version " BOOST_STRINGIZE(__SC__) +# elif defined(__MRC__) +# define BOOST_COMPILER "MPW MrCpp version " BOOST_STRINGIZE(__MRC__) +# else +# error "Using MPW compiler configuration by mistake. Please update." +# endif + +// +// MPW 8.90: +// +#if (MPW_CPLUS <= 0x890) || !defined(BOOST_STRICT_CONFIG) +# define BOOST_NO_CV_SPECIALIZATIONS +# define BOOST_NO_DEPENDENT_NESTED_DERIVATIONS +# define BOOST_NO_DEPENDENT_TYPES_IN_TEMPLATE_VALUE_PARAMETERS +# define BOOST_NO_INCLASS_MEMBER_INITIALIZATION +# define BOOST_NO_INTRINSIC_WCHAR_T +# define BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION +# define BOOST_NO_USING_TEMPLATE + +# define BOOST_NO_CWCHAR +# define BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS + +# define BOOST_NO_STD_ALLOCATOR /* actually a bug with const reference overloading */ +#endif + +// +// versions check: +// we don't support MPW prior to version 8.9: +#if MPW_CPLUS < 0x890 +# error "Compiler not supported or configured - please reconfigure" +#endif +// +// last known and checked version is 0x890: +#if (MPW_CPLUS > 0x890) +# if defined(BOOST_ASSERT_CONFIG) +# error "Unknown compiler version - please run the configure tests and report the results" +# endif +#endif + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/compiler/sgi_mipspro.hpp b/trunk/paradiseo-eo/contrib/boost/config/compiler/sgi_mipspro.hpp new file mode 100644 index 000000000..689b67eeb --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/compiler/sgi_mipspro.hpp @@ -0,0 +1,24 @@ +// (C) Copyright John Maddock 2001 - 2002. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// SGI C++ compiler setup: + +#define BOOST_COMPILER "SGI Irix compiler version " BOOST_STRINGIZE(_COMPILER_VERSION) + +#include "boost/config/compiler/common_edg.hpp" + +// +// Threading support: +// Turn this on unconditionally here, it will get turned off again later +// if no threading API is detected. +// +#define BOOST_HAS_THREADS +// +// version check: +// probably nothing to do here? + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/compiler/sunpro_cc.hpp b/trunk/paradiseo-eo/contrib/boost/config/compiler/sunpro_cc.hpp new file mode 100644 index 000000000..eca19feb0 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/compiler/sunpro_cc.hpp @@ -0,0 +1,90 @@ +// (C) Copyright John Maddock 2001. +// (C) Copyright Jens Maurer 2001 - 2003. +// (C) Copyright Peter Dimov 2002. +// (C) Copyright Aleksey Gurtovoy 2002 - 2003. +// (C) Copyright David Abrahams 2002. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// Sun C++ compiler setup: + +# if __SUNPRO_CC <= 0x500 +# define BOOST_NO_MEMBER_TEMPLATES +# define BOOST_NO_FUNCTION_TEMPLATE_ORDERING +# endif + +# if (__SUNPRO_CC <= 0x520) + // + // Sunpro 5.2 and earler: + // + // although sunpro 5.2 supports the syntax for + // inline initialization it often gets the value + // wrong, especially where the value is computed + // from other constants (J Maddock 6th May 2001) +# define BOOST_NO_INCLASS_MEMBER_INITIALIZATION + + // Although sunpro 5.2 supports the syntax for + // partial specialization, it often seems to + // bind to the wrong specialization. Better + // to disable it until suppport becomes more stable + // (J Maddock 6th May 2001). +# define BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION +# endif + +# if (__SUNPRO_CC <= 0x530) + // Requesting debug info (-g) with Boost.Python results + // in an internal compiler error for "static const" + // initialized in-class. + // >> Assertion: (../links/dbg_cstabs.cc, line 611) + // while processing ../test.cpp at line 0. + // (Jens Maurer according to Gottfried Ganßauge 04 Mar 2002) +# define BOOST_NO_INCLASS_MEMBER_INITIALIZATION + + // SunPro 5.3 has better support for partial specialization, + // but breaks when compiling std::less > + // (Jens Maurer 4 Nov 2001). + + // std::less specialization fixed as reported by George + // Heintzelman; partial specialization re-enabled + // (Peter Dimov 17 Jan 2002) + +//# define BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION + + // integral constant expressions with 64 bit numbers fail +# define BOOST_NO_INTEGRAL_INT64_T +# endif + +# if (__SUNPRO_CC < 0x570) +# define BOOST_NO_TEMPLATE_TEMPLATES + // see http://lists.boost.org/MailArchives/boost/msg47184.php + // and http://lists.boost.org/MailArchives/boost/msg47220.php +# define BOOST_NO_INCLASS_MEMBER_INITIALIZATION +# define BOOST_NO_SFINAE +# define BOOST_NO_ARRAY_TYPE_SPECIALIZATIONS +# define BOOST_NO_IS_ABSTRACT +# endif + +#define BOOST_COMPILER "Sun compiler version " BOOST_STRINGIZE(__SUNPRO_CC) + +// +// versions check: +// we don't support sunpro prior to version 4: +#if __SUNPRO_CC < 0x400 +#error "Compiler not supported or configured - please reconfigure" +#endif +// +// last known and checked version is 0x570: +#if (__SUNPRO_CC > 0x570) +# if defined(BOOST_ASSERT_CONFIG) +# error "Unknown compiler version - please run the configure tests and report the results" +# endif +#endif + + + + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/compiler/vacpp.hpp b/trunk/paradiseo-eo/contrib/boost/config/compiler/vacpp.hpp new file mode 100644 index 000000000..4cf0de7c1 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/compiler/vacpp.hpp @@ -0,0 +1,58 @@ +// (C) Copyright John Maddock 2001 - 2003. +// (C) Copyright Toon Knapen 2001 - 2003. +// (C) Copyright Lie-Quan Lee 2001. +// (C) Copyright Markus Schöpflin 2002 - 2003. +// (C) Copyright Beman Dawes 2002 - 2003. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// Visual Age (IBM) C++ compiler setup: + +#if __IBMCPP__ <= 501 +# define BOOST_NO_MEMBER_TEMPLATE_FRIENDS +# define BOOST_NO_MEMBER_FUNCTION_SPECIALIZATIONS +#endif + +#if (__IBMCPP__ <= 502) +// Actually the compiler supports inclass member initialization but it +// requires a definition for the class member and it doesn't recognize +// it as an integral constant expression when used as a template argument. +# define BOOST_NO_INCLASS_MEMBER_INITIALIZATION +# define BOOST_NO_INTEGRAL_INT64_T +# define BOOST_NO_MEMBER_TEMPLATE_KEYWORD +#endif + +#if (__IBMCPP__ <= 600) || !defined(BOOST_STRICT_CONFIG) +# define BOOST_NO_POINTER_TO_MEMBER_TEMPLATE_PARAMETERS +# define BOOST_MPL_CFG_ASSERT_USE_RELATION_NAMES 1 +#endif + +// +// On AIX thread support seems to be indicated by _THREAD_SAFE: +// +#ifdef _THREAD_SAFE +# define BOOST_HAS_THREADS +#endif + +#define BOOST_COMPILER "IBM Visual Age version " BOOST_STRINGIZE(__IBMCPP__) + +// +// versions check: +// we don't support Visual age prior to version 5: +#if __IBMCPP__ < 500 +#error "Compiler not supported or configured - please reconfigure" +#endif +// +// last known and checked version is 600: +#if (__IBMCPP__ > 600) +# if defined(BOOST_ASSERT_CONFIG) +# error "Unknown compiler version - please run the configure tests and report the results" +# endif +#endif + + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/compiler/visualc.hpp b/trunk/paradiseo-eo/contrib/boost/config/compiler/visualc.hpp new file mode 100644 index 000000000..1ce600ccf --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/compiler/visualc.hpp @@ -0,0 +1,147 @@ +// (C) Copyright John Maddock 2001 - 2003. +// (C) Copyright Darin Adler 2001 - 2002. +// (C) Copyright Peter Dimov 2001. +// (C) Copyright Aleksey Gurtovoy 2002. +// (C) Copyright David Abrahams 2002 - 2003. +// (C) Copyright Beman Dawes 2002 - 2003. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// Microsoft Visual C++ compiler setup: + +#define BOOST_MSVC _MSC_VER + +// turn off the warnings before we #include anything +#pragma warning( disable : 4503 ) // warning: decorated name length exceeded + +#if _MSC_VER < 1300 // 1200 == VC++ 6.0, 1201 == EVC4.2 +#pragma warning( disable : 4786 ) // ident trunc to '255' chars in debug info +# define BOOST_NO_DEPENDENT_TYPES_IN_TEMPLATE_VALUE_PARAMETERS +# define BOOST_NO_VOID_RETURNS +# define BOOST_NO_EXCEPTION_STD_NAMESPACE + // disable min/max macro defines on vc6: + // +#endif + +#if (_MSC_VER <= 1300) // 1300 == VC++ 7.0 + +#if !defined(_MSC_EXTENSIONS) && !defined(BOOST_NO_DEPENDENT_TYPES_IN_TEMPLATE_VALUE_PARAMETERS) // VC7 bug with /Za +# define BOOST_NO_DEPENDENT_TYPES_IN_TEMPLATE_VALUE_PARAMETERS +#endif + +# define BOOST_NO_EXPLICIT_FUNCTION_TEMPLATE_ARGUMENTS +# define BOOST_NO_INCLASS_MEMBER_INITIALIZATION +# define BOOST_NO_PRIVATE_IN_AGGREGATE +# define BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP +# define BOOST_NO_INTEGRAL_INT64_T +# define BOOST_NO_DEDUCED_TYPENAME +# define BOOST_NO_USING_DECLARATION_OVERLOADS_FROM_TYPENAME_BASE + +// VC++ 6/7 has member templates but they have numerous problems including +// cases of silent failure, so for safety we define: +# define BOOST_NO_MEMBER_TEMPLATES +// For VC++ experts wishing to attempt workarounds, we define: +# define BOOST_MSVC6_MEMBER_TEMPLATES + +# define BOOST_NO_MEMBER_TEMPLATE_FRIENDS +# define BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION +# define BOOST_NO_CV_VOID_SPECIALIZATIONS +# define BOOST_NO_FUNCTION_TEMPLATE_ORDERING +# define BOOST_NO_USING_TEMPLATE +# define BOOST_NO_SWPRINTF +# define BOOST_NO_TEMPLATE_TEMPLATES +# define BOOST_NO_SFINAE +# define BOOST_NO_POINTER_TO_MEMBER_TEMPLATE_PARAMETERS +# define BOOST_NO_IS_ABSTRACT +# if (_MSC_VER > 1200) +# define BOOST_NO_MEMBER_FUNCTION_SPECIALIZATIONS +# endif + +#endif + +#if _MSC_VER < 1310 // 1310 == VC++ 7.1 +# define BOOST_NO_SWPRINTF +#endif + +#if _MSC_VER <= 1400 // 1400 == VC++ 8.0 +# define BOOST_NO_MEMBER_TEMPLATE_FRIENDS +#endif + +#ifndef _NATIVE_WCHAR_T_DEFINED +# define BOOST_NO_INTRINSIC_WCHAR_T +#endif + +#ifdef _WIN32_WCE +# define BOOST_NO_THREADEX +# define BOOST_NO_GETSYSTEMTIMEASFILETIME +#endif + +// +// check for exception handling support: +#ifndef _CPPUNWIND +# define BOOST_NO_EXCEPTIONS +#endif + +// +// __int64 support: +// +#if (_MSC_VER >= 1200) +# define BOOST_HAS_MS_INT64 +#endif +#if (_MSC_VER >= 1310) && defined(_MSC_EXTENSIONS) +# define BOOST_HAS_LONG_LONG +#endif +// +// disable Win32 API's if compiler extentions are +// turned off: +// +#ifndef _MSC_EXTENSIONS +# define BOOST_DISABLE_WIN32 +#endif + +// +// all versions support __declspec: +// +#define BOOST_HAS_DECLSPEC +// +// prefix and suffix headers: +// +#ifndef BOOST_ABI_PREFIX +# define BOOST_ABI_PREFIX "boost/config/abi/msvc_prefix.hpp" +#endif +#ifndef BOOST_ABI_SUFFIX +# define BOOST_ABI_SUFFIX "boost/config/abi/msvc_suffix.hpp" +#endif + +# if _MSC_VER == 1200 +# define BOOST_COMPILER_VERSION 6.0 +# elif _MSC_VER == 1300 +# define BOOST_COMPILER_VERSION 7.0 +# elif _MSC_VER == 1310 +# define BOOST_COMPILER_VERSION 7.1 +# elif _MSC_VER == 1400 +# define BOOST_COMPILER_VERSION 8.0 +# else +# define BOOST_COMPILER_VERSION _MSC_VER +# endif + +#define BOOST_COMPILER "Microsoft Visual C++ version " BOOST_STRINGIZE(BOOST_COMPILER_VERSION) + +// +// versions check: +// we don't support Visual C++ prior to version 6: +#if _MSC_VER < 1200 +#error "Compiler not supported or configured - please reconfigure" +#endif +// +// last known and checked version is 1310: +#if (_MSC_VER > 1400) +# if defined(BOOST_ASSERT_CONFIG) +# error "Unknown compiler version - please run the configure tests and report the results" +# else +# pragma message("Unknown compiler version - please run the configure tests and report the results") +# endif +#endif diff --git a/trunk/paradiseo-eo/contrib/boost/config/platform/CVS/Entries b/trunk/paradiseo-eo/contrib/boost/config/platform/CVS/Entries new file mode 100644 index 000000000..33bf9ee8f --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/platform/CVS/Entries @@ -0,0 +1,12 @@ +/aix.hpp/1.1/Thu Oct 6 12:13:52 2005// +/amigaos.hpp/1.1/Thu Oct 6 12:13:52 2005// +/beos.hpp/1.1/Thu Oct 6 12:13:52 2005// +/bsd.hpp/1.1/Thu Oct 6 12:13:52 2005// +/cygwin.hpp/1.1/Thu Oct 6 12:13:52 2005// +/hpux.hpp/1.1/Thu Oct 6 12:13:52 2005// +/irix.hpp/1.1/Thu Oct 6 12:13:52 2005// +/linux.hpp/1.1/Thu Oct 6 12:13:52 2005// +/macos.hpp/1.1/Thu Oct 6 12:13:52 2005// +/solaris.hpp/1.1/Thu Oct 6 12:13:52 2005// +/win32.hpp/1.1/Thu Oct 6 12:13:52 2005// +D diff --git a/trunk/paradiseo-eo/contrib/boost/config/platform/CVS/Repository b/trunk/paradiseo-eo/contrib/boost/config/platform/CVS/Repository new file mode 100644 index 000000000..e2ab22e35 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/platform/CVS/Repository @@ -0,0 +1 @@ +eo/contrib/boost/config/platform diff --git a/trunk/paradiseo-eo/contrib/boost/config/platform/CVS/Root b/trunk/paradiseo-eo/contrib/boost/config/platform/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/platform/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/contrib/boost/config/platform/aix.hpp b/trunk/paradiseo-eo/contrib/boost/config/platform/aix.hpp new file mode 100644 index 000000000..894ef42ce --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/platform/aix.hpp @@ -0,0 +1,33 @@ +// (C) Copyright John Maddock 2001 - 2002. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// IBM/Aix specific config options: + +#define BOOST_PLATFORM "IBM Aix" + +#define BOOST_HAS_UNISTD_H +#define BOOST_HAS_NL_TYPES_H +#define BOOST_HAS_NANOSLEEP +#define BOOST_HAS_CLOCK_GETTIME + +// This needs support in "boost/cstdint.hpp" exactly like FreeBSD. +// This platform has header named which includes all +// the things needed. +#define BOOST_HAS_STDINT_H + +// Threading API's: +#define BOOST_HAS_PTHREADS +#define BOOST_HAS_PTHREAD_DELAY_NP +#define BOOST_HAS_SCHED_YIELD +//#define BOOST_HAS_PTHREAD_YIELD + +// boilerplate code: +#include + + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/platform/amigaos.hpp b/trunk/paradiseo-eo/contrib/boost/config/platform/amigaos.hpp new file mode 100644 index 000000000..34bcf4128 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/platform/amigaos.hpp @@ -0,0 +1,15 @@ +// (C) Copyright John Maddock 2002. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +#define BOOST_PLATFORM "AmigaOS" + +#define BOOST_DISABLE_THREADS +#define BOOST_NO_CWCHAR +#define BOOST_NO_STD_WSTRING +#define BOOST_NO_INTRINSIC_WCHAR_T + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/platform/beos.hpp b/trunk/paradiseo-eo/contrib/boost/config/platform/beos.hpp new file mode 100644 index 000000000..48c3d8dc5 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/platform/beos.hpp @@ -0,0 +1,26 @@ +// (C) Copyright John Maddock 2001. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// BeOS specific config options: + +#define BOOST_PLATFORM "BeOS" + +#define BOOST_NO_CWCHAR +#define BOOST_NO_CWCTYPE +#define BOOST_HAS_UNISTD_H + +#define BOOST_HAS_BETHREADS + +#ifndef BOOST_DISABLE_THREADS +# define BOOST_HAS_THREADS +#endif + +// boilerplate code: +#include + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/platform/bsd.hpp b/trunk/paradiseo-eo/contrib/boost/config/platform/bsd.hpp new file mode 100644 index 000000000..09988e0ca --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/platform/bsd.hpp @@ -0,0 +1,71 @@ +// (C) Copyright John Maddock 2001 - 2003. +// (C) Copyright Darin Adler 2001. +// (C) Copyright Douglas Gregor 2002. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// generic BSD config options: + +#if !defined(__FreeBSD__) && !defined(__NetBSD__) && !defined(__OpenBSD__) +#error "This platform is not BSD" +#endif + +#ifdef __FreeBSD__ +#define BOOST_PLATFORM "FreeBSD " BOOST_STRINGIZE(__FreeBSD__) +#elif defined(__NetBSD__) +#define BOOST_PLATFORM "NetBSD " BOOST_STRINGIZE(__NetBSD__) +#elif defined(__OpenBSD__) +#define BOOST_PLATFORM "OpenBSD " BOOST_STRINGIZE(__OpenBSD__) +#endif + +// +// is this the correct version check? +// FreeBSD has but does not +// advertise the fact in : +// +#if defined(__FreeBSD__) && (__FreeBSD__ >= 3) +# define BOOST_HAS_NL_TYPES_H +#endif + +// +// FreeBSD 3.x has pthreads support, but defines _POSIX_THREADS in +// and not in +// +#if defined(__FreeBSD__) && (__FreeBSD__ <= 3) +# define BOOST_HAS_PTHREADS +#endif + +// +// No wide character support in the BSD header files: +// +#if !(defined(__FreeBSD__) && (__FreeBSD__ >= 5)) +# define BOOST_NO_CWCHAR +#endif +// +// The BSD has macros only, no functions: +// +#if !defined(__OpenBSD__) +# define BOOST_NO_CTYPE_FUNCTIONS +#endif + +// +// thread API's not auto detected: +// +#define BOOST_HAS_SCHED_YIELD +#define BOOST_HAS_NANOSLEEP +#define BOOST_HAS_GETTIMEOFDAY +#define BOOST_HAS_PTHREAD_MUTEXATTR_SETTYPE +#define BOOST_HAS_SIGACTION + +// boilerplate code: +#define BOOST_HAS_UNISTD_H +#include + + + + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/platform/cygwin.hpp b/trunk/paradiseo-eo/contrib/boost/config/platform/cygwin.hpp new file mode 100644 index 000000000..0fd2ebe2d --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/platform/cygwin.hpp @@ -0,0 +1,48 @@ +// (C) Copyright John Maddock 2001 - 2003. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// cygwin specific config options: + +#define BOOST_PLATFORM "Cygwin" +#define BOOST_NO_CWCTYPE +#define BOOST_NO_CWCHAR +#define BOOST_NO_SWPRINTF +#define BOOST_HAS_DIRENT_H + +// +// Threading API: +// See if we have POSIX threads, if we do use them, otherwise +// revert to native Win threads. +#define BOOST_HAS_UNISTD_H +#include +#if defined(_POSIX_THREADS) && (_POSIX_THREADS+0 >= 0) && !defined(BOOST_HAS_WINTHREADS) +# define BOOST_HAS_PTHREADS +# define BOOST_HAS_SCHED_YIELD +# define BOOST_HAS_GETTIMEOFDAY +# define BOOST_HAS_PTHREAD_MUTEXATTR_SETTYPE +# define BOOST_HAS_SIGACTION +#else +# if !defined(BOOST_HAS_WINTHREADS) +# define BOOST_HAS_WINTHREADS +# endif +# define BOOST_HAS_FTIME +#endif + +// +// find out if we have a stdint.h, there should be a better way to do this: +// +#include +#ifdef _STDINT_H +#define BOOST_HAS_STDINT_H +#endif + +// boilerplate code: +#include + + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/platform/hpux.hpp b/trunk/paradiseo-eo/contrib/boost/config/platform/hpux.hpp new file mode 100644 index 000000000..fa773aa79 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/platform/hpux.hpp @@ -0,0 +1,68 @@ +// (C) Copyright John Maddock 2001 - 2003. +// (C) Copyright Jens Maurer 2001 - 2003. +// (C) Copyright David Abrahams 2002. +// (C) Copyright Toon Knapen 2003. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// hpux specific config options: + +#define BOOST_PLATFORM "HP-UX" + +// In principle, HP-UX has a nice under the name +// However, it has the following problem: +// Use of UINT32_C(0) results in "0u l" for the preprocessed source +// (verifyable with gcc 2.95.3, assumed for HP aCC) +// #define BOOST_HAS_STDINT_H + +#define BOOST_NO_SWPRINTF +#define BOOST_NO_CWCTYPE + +#if defined(__GNUC__) +# if (__GNUC__ < 3) || ((__GNUC__ == 3) && (__GNUC_MINOR__ < 3)) + // GNU C on HP-UX does not support threads (checked up to gcc 3.3) +# define BOOST_DISABLE_THREADS +# elif !defined(BOOST_DISABLE_THREADS) + // threads supported from gcc-3.3 onwards: +# define BOOST_HAS_THREADS +# define BOOST_HAS_PTHREADS +# endif +#endif + +// boilerplate code: +#define BOOST_HAS_UNISTD_H +#include + +// the following are always available: +#ifndef BOOST_HAS_GETTIMEOFDAY +# define BOOST_HAS_GETTIMEOFDAY +#endif +#ifndef BOOST_HAS_SCHED_YIELD +# define BOOST_HAS_SCHED_YIELD +#endif +#ifndef BOOST_HAS_PTHREAD_MUTEXATTR_SETTYPE +# define BOOST_HAS_PTHREAD_MUTEXATTR_SETTYPE +#endif +#ifndef BOOST_HAS_NL_TYPES_H +# define BOOST_HAS_NL_TYPES_H +#endif +#ifndef BOOST_HAS_NANOSLEEP +# define BOOST_HAS_NANOSLEEP +#endif +#ifndef BOOST_HAS_GETTIMEOFDAY +# define BOOST_HAS_GETTIMEOFDAY +#endif +#ifndef BOOST_HAS_DIRENT_H +# define BOOST_HAS_DIRENT_H +#endif +#ifndef BOOST_HAS_CLOCK_GETTIME +# define BOOST_HAS_CLOCK_GETTIME +#endif +#ifndef BOOST_HAS_SIGACTION +# define BOOST_HAS_SIGACTION +#endif + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/platform/irix.hpp b/trunk/paradiseo-eo/contrib/boost/config/platform/irix.hpp new file mode 100644 index 000000000..aeae49c8b --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/platform/irix.hpp @@ -0,0 +1,31 @@ +// (C) Copyright John Maddock 2001 - 2003. +// (C) Copyright Jens Maurer 2003. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + + +// See http://www.boost.org for most recent version. + +// SGI Irix specific config options: + +#define BOOST_PLATFORM "SGI Irix" + +#define BOOST_NO_SWPRINTF +// +// these are not auto detected by POSIX feature tests: +// +#define BOOST_HAS_GETTIMEOFDAY +#define BOOST_HAS_PTHREAD_MUTEXATTR_SETTYPE + +#ifdef __GNUC__ + // GNU C on IRIX does not support threads (checked up to gcc 3.3) +# define BOOST_DISABLE_THREADS +#endif + +// boilerplate code: +#define BOOST_HAS_UNISTD_H +#include + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/platform/linux.hpp b/trunk/paradiseo-eo/contrib/boost/config/platform/linux.hpp new file mode 100644 index 000000000..51ae13347 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/platform/linux.hpp @@ -0,0 +1,98 @@ +// (C) Copyright John Maddock 2001 - 2003. +// (C) Copyright Jens Maurer 2001 - 2003. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// linux specific config options: + +#define BOOST_PLATFORM "linux" + +// make sure we have __GLIBC_PREREQ if available at all +#include + +// +// added to glibc 2.1.1 +// We can only test for 2.1 though: +// +#if defined(__GLIBC__) && ((__GLIBC__ > 2) || ((__GLIBC__ == 2) && (__GLIBC_MINOR__ >= 1))) + // defines int64_t unconditionally, but defines + // int64_t only if __GNUC__. Thus, assume a fully usable + // only when using GCC. +# if defined __GNUC__ +# define BOOST_HAS_STDINT_H +# endif +#endif + +#if defined(__LIBCOMO__) + // + // como on linux doesn't have std:: c functions: + // NOTE: versions of libcomo prior to beta28 have octal version numbering, + // e.g. version 25 is 21 (dec) + // +# if __LIBCOMO_VERSION__ <= 20 +# define BOOST_NO_STDC_NAMESPACE +# endif + +# if __LIBCOMO_VERSION__ <= 21 +# define BOOST_NO_SWPRINTF +# endif + +#endif + +// +// If glibc is past version 2 then we definitely have +// gettimeofday, earlier versions may or may not have it: +// +#if defined(__GLIBC__) && (__GLIBC__ >= 2) +# define BOOST_HAS_GETTIMEOFDAY +#endif + +#ifdef __USE_POSIX199309 +# define BOOST_HAS_NANOSLEEP +#endif + +#if defined(__GLIBC__) && defined(__GLIBC_PREREQ) +// __GLIBC_PREREQ is available since 2.1.2 + + // swprintf is available since glibc 2.2.0 +# if !__GLIBC_PREREQ(2,2) || (!defined(__USE_ISOC99) && !defined(__USE_UNIX98)) +# define BOOST_NO_SWPRINTF +# endif +#else +# define BOOST_NO_SWPRINTF +#endif + +// boilerplate code: +#define BOOST_HAS_UNISTD_H +#include + +#ifndef __GNUC__ +// +// if the compiler is not gcc we still need to be able to parse +// the GNU system headers, some of which (mainly ) +// use GNU specific extensions: +// +# ifndef __extension__ +# define __extension__ +# endif +# ifndef __const__ +# define __const__ const +# endif +# ifndef __volatile__ +# define __volatile__ volatile +# endif +# ifndef __signed__ +# define __signed__ signed +# endif +# ifndef __typeof__ +# define __typeof__ typeof +# endif +# ifndef __inline__ +# define __inline__ inline +# endif +#endif + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/platform/macos.hpp b/trunk/paradiseo-eo/contrib/boost/config/platform/macos.hpp new file mode 100644 index 000000000..d6877d311 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/platform/macos.hpp @@ -0,0 +1,78 @@ +// (C) Copyright John Maddock 2001 - 2003. +// (C) Copyright Darin Adler 2001 - 2002. +// (C) Copyright Bill Kempf 2002. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// Mac OS specific config options: + +#define BOOST_PLATFORM "Mac OS" + +#if __MACH__ && !defined(_MSL_USING_MSL_C) + +// Using the Mac OS X system BSD-style C library. + +# ifndef BOOST_HAS_UNISTD_H +# define BOOST_HAS_UNISTD_H +# endif +// +// Begin by including our boilerplate code for POSIX +// feature detection, this is safe even when using +// the MSL as Metrowerks supply their own +// to replace the platform-native BSD one. G++ users +// should also always be able to do this on MaxOS X. +// +# include +# ifndef BOOST_HAS_STDINT_H +# define BOOST_HAS_STDINT_H +# endif + +// +// BSD runtime has pthreads, sigaction, sched_yield and gettimeofday, +// of these only pthreads are advertised in , so set the +// other options explicitly: +// +# define BOOST_HAS_SCHED_YIELD +# define BOOST_HAS_GETTIMEOFDAY +# define BOOST_HAS_SIGACTION + +# if (__GNUC__ < 3) && !defined( __APPLE_CC__) + +// GCC strange "ignore std" mode works better if you pretend everything +// is in the std namespace, for the most part. + +# define BOOST_NO_STDC_NAMESPACE +# endif + +#else + +// Using the MSL C library. + +// We will eventually support threads in non-Carbon builds, but we do +// not support this yet. +# if ( defined(TARGET_API_MAC_CARBON) && TARGET_API_MAC_CARBON ) || ( defined(TARGET_CARBON) && TARGET_CARBON ) + +# if !defined(BOOST_HAS_PTHREADS) +# define BOOST_HAS_MPTASKS +# elif ( __dest_os == __mac_os_x ) +// We are doing a Carbon/Mach-O/MSL build which has pthreads, but only the +// gettimeofday and no posix. +# define BOOST_HAS_GETTIMEOFDAY +# endif + +// The MP task implementation of Boost Threads aims to replace MP-unsafe +// parts of the MSL, so we turn on threads unconditionally. +# define BOOST_HAS_THREADS + +// The remote call manager depends on this. +# define BOOST_BIND_ENABLE_PASCAL + +# endif + +#endif + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/platform/solaris.hpp b/trunk/paradiseo-eo/contrib/boost/config/platform/solaris.hpp new file mode 100644 index 000000000..700dc3ce6 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/platform/solaris.hpp @@ -0,0 +1,21 @@ +// (C) Copyright John Maddock 2001 - 2003. +// (C) Copyright Jens Maurer 2003. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// sun specific config options: + +#define BOOST_PLATFORM "Sun Solaris" + +#define BOOST_HAS_GETTIMEOFDAY + +// boilerplate code: +#define BOOST_HAS_UNISTD_H +#include + + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/platform/win32.hpp b/trunk/paradiseo-eo/contrib/boost/config/platform/win32.hpp new file mode 100644 index 000000000..548bff280 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/platform/win32.hpp @@ -0,0 +1,50 @@ +// (C) Copyright John Maddock 2001 - 2003. +// (C) Copyright Bill Kempf 2001. +// (C) Copyright Aleksey Gurtovoy 2003. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// Win32 specific config options: + +#define BOOST_PLATFORM "Win32" + +#if defined(__GNUC__) && !defined(BOOST_NO_SWPRINTF) +# define BOOST_NO_SWPRINTF +#endif + +#if !defined(__GNUC__) && !defined(BOOST_HAS_DECLSPEC) +# define BOOST_HAS_DECLSPEC +#endif + +#if defined(__MINGW32__) && ((__GNUC__ > 3) || ((__GNUC__ == 3) && (__GNUC_MINOR__ >= 2))) +# define BOOST_HAS_STDINT_H +# define __STDC_LIMIT_MACROS +#endif + +// +// Win32 will normally be using native Win32 threads, +// but there is a pthread library avaliable as an option, +// we used to disable this when BOOST_DISABLE_WIN32 was +// defined but no longer - this should allow some +// files to be compiled in strict mode - while maintaining +// a consistent setting of BOOST_HAS_THREADS across +// all translation units (needed for shared_ptr etc). +// + +#ifdef _WIN32_WCE +# define BOOST_NO_ANSI_APIS +#endif + +#ifndef BOOST_HAS_PTHREADS +# define BOOST_HAS_WINTHREADS +#endif + +#ifndef BOOST_DISABLE_WIN32 +// WEK: Added +#define BOOST_HAS_FTIME +#define BOOST_WINDOWS 1 + +#endif diff --git a/trunk/paradiseo-eo/contrib/boost/config/posix_features.hpp b/trunk/paradiseo-eo/contrib/boost/config/posix_features.hpp new file mode 100644 index 000000000..4afb476b7 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/posix_features.hpp @@ -0,0 +1,87 @@ +// (C) Copyright John Maddock 2001 - 2003. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + + +// See http://www.boost.org for most recent version. + +// All POSIX feature tests go in this file, +// Note that we test _POSIX_C_SOURCE and _XOPEN_SOURCE as well +// _POSIX_VERSION and _XOPEN_VERSION: on some systems POSIX API's +// may be present but none-functional unless _POSIX_C_SOURCE and +// _XOPEN_SOURCE have been defined to the right value (it's up +// to the user to do this *before* including any header, although +// in most cases the compiler will do this for you). + +# if defined(BOOST_HAS_UNISTD_H) +# include + + // XOpen has , but is this the correct version check? +# if defined(_XOPEN_VERSION) && (_XOPEN_VERSION >= 3) +# define BOOST_HAS_NL_TYPES_H +# endif + + // POSIX version 6 requires +# if defined(_POSIX_VERSION) && (_POSIX_VERSION >= 200100) +# define BOOST_HAS_STDINT_H +# endif + + // POSIX version 2 requires +# if defined(_POSIX_VERSION) && (_POSIX_VERSION >= 199009L) +# define BOOST_HAS_DIRENT_H +# endif + + // POSIX version 3 requires to have sigaction: +# if defined(_POSIX_VERSION) && (_POSIX_VERSION >= 199506L) +# define BOOST_HAS_SIGACTION +# endif + // POSIX defines _POSIX_THREADS > 0 for pthread support, + // however some platforms define _POSIX_THREADS without + // a value, hence the (_POSIX_THREADS+0 >= 0) check. + // Strictly speaking this may catch platforms with a + // non-functioning stub , but such occurrences should + // occur very rarely if at all. +# if defined(_POSIX_THREADS) && (_POSIX_THREADS+0 >= 0) && !defined(BOOST_HAS_WINTHREADS) && !defined(BOOST_HAS_MPTASKS) +# define BOOST_HAS_PTHREADS +# endif + + // BOOST_HAS_NANOSLEEP: + // This is predicated on _POSIX_TIMERS or _XOPEN_REALTIME: +# if (defined(_POSIX_TIMERS) && (_POSIX_TIMERS+0 >= 0)) \ + || (defined(_XOPEN_REALTIME) && (_XOPEN_REALTIME+0 >= 0)) +# define BOOST_HAS_NANOSLEEP +# endif + + // BOOST_HAS_CLOCK_GETTIME: + // This is predicated on _POSIX_TIMERS (also on _XOPEN_REALTIME + // but at least one platform - linux - defines that flag without + // defining clock_gettime): +# if (defined(_POSIX_TIMERS) && (_POSIX_TIMERS+0 >= 0)) +# define BOOST_HAS_CLOCK_GETTIME +# endif + + // BOOST_HAS_SCHED_YIELD: + // This is predicated on _POSIX_PRIORITY_SCHEDULING or + // on _POSIX_THREAD_PRIORITY_SCHEDULING or on _XOPEN_REALTIME. +# if defined(_POSIX_PRIORITY_SCHEDULING) && (_POSIX_PRIORITY_SCHEDULING+0 > 0)\ + || (defined(_POSIX_THREAD_PRIORITY_SCHEDULING) && (_POSIX_THREAD_PRIORITY_SCHEDULING+0 > 0))\ + || (defined(_XOPEN_REALTIME) && (_XOPEN_REALTIME+0 >= 0)) +# define BOOST_HAS_SCHED_YIELD +# endif + + // BOOST_HAS_GETTIMEOFDAY: + // BOOST_HAS_PTHREAD_MUTEXATTR_SETTYPE: + // These are predicated on _XOPEN_VERSION, and appears to be first released + // in issue 4, version 2 (_XOPEN_VERSION > 500). +# if defined(_XOPEN_VERSION) && (_XOPEN_VERSION+0 >= 500) +# define BOOST_HAS_GETTIMEOFDAY +# if defined(_XOPEN_SOURCE) && (_XOPEN_SOURCE+0 >= 500) +# define BOOST_HAS_PTHREAD_MUTEXATTR_SETTYPE +# endif +# endif + +# endif + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/requires_threads.hpp b/trunk/paradiseo-eo/contrib/boost/config/requires_threads.hpp new file mode 100644 index 000000000..cfaff2302 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/requires_threads.hpp @@ -0,0 +1,92 @@ +// (C) Copyright John Maddock 2003. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + + +#ifndef BOOST_CONFIG_REQUIRES_THREADS_HPP +#define BOOST_CONFIG_REQUIRES_THREADS_HPP + +#ifndef BOOST_CONFIG_HPP +# include +#endif + +#if defined(BOOST_DISABLE_THREADS) + +// +// special case to handle versions of gcc which don't currently support threads: +// +#if defined(__GNUC__) && ((__GNUC__ < 3) || (__GNUC_MINOR__ <= 3) || !defined(BOOST_STRICT_CONFIG)) +// +// this is checked up to gcc 3.3: +// +#if defined(__sgi) || defined(__hpux) +# error "Multi-threaded programs are not supported by gcc on HPUX or Irix (last checked with gcc 3.3)" +#endif + +#endif + +# error "Threading support unavaliable: it has been explicitly disabled with BOOST_DISABLE_THREADS" + +#elif !defined(BOOST_HAS_THREADS) + +# if defined __COMO__ +// Comeau C++ +# error "Compiler threading support is not turned on. Please set the correct command line options for threading: -D_MT (Windows) or -D_REENTRANT (Unix)" + +#elif defined(__INTEL_COMPILER) || defined(__ICL) || defined(__ICC) || defined(__ECC) +// Intel +#ifdef _WIN32 +# error "Compiler threading support is not turned on. Please set the correct command line options for threading: either /MT /MTd /MD or /MDd" +#else +# error "Compiler threading support is not turned on. Please set the correct command line options for threading: -openmp" +#endif + +# elif defined __GNUC__ +// GNU C++: +# error "Compiler threading support is not turned on. Please set the correct command line options for threading: -pthread (Linux), -pthreads (Solaris) or -mthreads (Mingw32)" + +#elif defined __sgi +// SGI MIPSpro C++ +# error "Compiler threading support is not turned on. Please set the correct command line options for threading: -D_SGI_MP_SOURCE" + +#elif defined __DECCXX +// Compaq Tru64 Unix cxx +# error "Compiler threading support is not turned on. Please set the correct command line options for threading: -pthread" + +#elif defined __BORLANDC__ +// Borland +# error "Compiler threading support is not turned on. Please set the correct command line options for threading: -tWM" + +#elif defined __MWERKS__ +// Metrowerks CodeWarrior +# error "Compiler threading support is not turned on. Please set the correct command line options for threading: either -runtime sm, -runtime smd, -runtime dm, or -runtime dmd" + +#elif defined __SUNPRO_CC +// Sun Workshop Compiler C++ +# error "Compiler threading support is not turned on. Please set the correct command line options for threading: -mt" + +#elif defined __HP_aCC +// HP aCC +# error "Compiler threading support is not turned on. Please set the correct command line options for threading: -mt" + +#elif defined(__IBMCPP__) +// IBM Visual Age +# error "Compiler threading support is not turned on. Please compile the code with the xlC_r compiler" + +#elif defined _MSC_VER +// Microsoft Visual C++ +// +// Must remain the last #elif since some other vendors (Metrowerks, for +// example) also #define _MSC_VER +# error "Compiler threading support is not turned on. Please set the correct command line options for threading: either /MT /MTd /MD or /MDd" + +#else + +# error "Compiler threading support is not turned on. Please consult your compiler's documentation for the appropriate options to use" + +#endif // compilers + +#endif // BOOST_HAS_THREADS + +#endif // BOOST_CONFIG_REQUIRES_THREADS_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/config/select_compiler_config.hpp b/trunk/paradiseo-eo/contrib/boost/config/select_compiler_config.hpp new file mode 100644 index 000000000..3453f1a35 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/select_compiler_config.hpp @@ -0,0 +1,83 @@ +// Boost compiler configuration selection header file + +// (C) Copyright John Maddock 2001 - 2003. +// (C) Copyright Martin Wille 2003. +// (C) Copyright Guillaume Melquiond 2003. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// locate which compiler we are using and define +// BOOST_COMPILER_CONFIG as needed: + +# if defined __COMO__ +// Comeau C++ +# define BOOST_COMPILER_CONFIG "boost/config/compiler/comeau.hpp" + +#elif defined __DMC__ +// Digital Mars C++ +# define BOOST_COMPILER_CONFIG "boost/config/compiler/digitalmars.hpp" + +#elif defined(__INTEL_COMPILER) || defined(__ICL) || defined(__ICC) || defined(__ECC) +// Intel +# define BOOST_COMPILER_CONFIG "boost/config/compiler/intel.hpp" + +# elif defined __GNUC__ +// GNU C++: +# define BOOST_COMPILER_CONFIG "boost/config/compiler/gcc.hpp" + +#elif defined __KCC +// Kai C++ +# define BOOST_COMPILER_CONFIG "boost/config/compiler/kai.hpp" + +#elif defined __sgi +// SGI MIPSpro C++ +# define BOOST_COMPILER_CONFIG "boost/config/compiler/sgi_mipspro.hpp" + +#elif defined __DECCXX +// Compaq Tru64 Unix cxx +# define BOOST_COMPILER_CONFIG "boost/config/compiler/compaq_cxx.hpp" + +#elif defined __ghs +// Greenhills C++ +# define BOOST_COMPILER_CONFIG "boost/config/compiler/greenhills.hpp" + +#elif defined __BORLANDC__ +// Borland +# define BOOST_COMPILER_CONFIG "boost/config/compiler/borland.hpp" + +#elif defined __MWERKS__ +// Metrowerks CodeWarrior +# define BOOST_COMPILER_CONFIG "boost/config/compiler/metrowerks.hpp" + +#elif defined __SUNPRO_CC +// Sun Workshop Compiler C++ +# define BOOST_COMPILER_CONFIG "boost/config/compiler/sunpro_cc.hpp" + +#elif defined __HP_aCC +// HP aCC +# define BOOST_COMPILER_CONFIG "boost/config/compiler/hp_acc.hpp" + +#elif defined(__MRC__) || defined(__SC__) +// MPW MrCpp or SCpp +# define BOOST_COMPILER_CONFIG "boost/config/compiler/mpw.hpp" + +#elif defined(__IBMCPP__) +// IBM Visual Age +# define BOOST_COMPILER_CONFIG "boost/config/compiler/vacpp.hpp" + +#elif defined _MSC_VER +// Microsoft Visual C++ +// +// Must remain the last #elif since some other vendors (Metrowerks, for +// example) also #define _MSC_VER +# define BOOST_COMPILER_CONFIG "boost/config/compiler/visualc.hpp" + +#elif defined (BOOST_ASSERT_CONFIG) +// this must come last - generate an error if we don't +// recognise the compiler: +# error "Unknown compiler - please configure (http://www.boost.org/libs/config/config.htm#configuring) and report the results to the main boost mailing list (http://www.boost.org/more/mailing_lists.htm#main)" + +#endif diff --git a/trunk/paradiseo-eo/contrib/boost/config/select_platform_config.hpp b/trunk/paradiseo-eo/contrib/boost/config/select_platform_config.hpp new file mode 100644 index 000000000..60bfa5095 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/select_platform_config.hpp @@ -0,0 +1,86 @@ +// Boost compiler configuration selection header file + +// (C) Copyright John Maddock 2001 - 2002. +// (C) Copyright Jens Maurer 2001. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// locate which platform we are on and define BOOST_PLATFORM_CONFIG as needed. +// Note that we define the headers to include using "header_name" not +// in order to prevent macro expansion within the header +// name (for example "linux" is a macro on linux systems). + +#if defined(linux) || defined(__linux) || defined(__linux__) +// linux: +# define BOOST_PLATFORM_CONFIG "boost/config/platform/linux.hpp" + +#elif defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__) +// BSD: +# define BOOST_PLATFORM_CONFIG "boost/config/platform/bsd.hpp" + +#elif defined(sun) || defined(__sun) +// solaris: +# define BOOST_PLATFORM_CONFIG "boost/config/platform/solaris.hpp" + +#elif defined(__sgi) +// SGI Irix: +# define BOOST_PLATFORM_CONFIG "boost/config/platform/irix.hpp" + +#elif defined(__hpux) +// hp unix: +# define BOOST_PLATFORM_CONFIG "boost/config/platform/hpux.hpp" + +#elif defined(__CYGWIN__) +// cygwin is not win32: +# define BOOST_PLATFORM_CONFIG "boost/config/platform/cygwin.hpp" + +#elif defined(_WIN32) || defined(__WIN32__) || defined(WIN32) +// win32: +# define BOOST_PLATFORM_CONFIG "boost/config/platform/win32.hpp" + +#elif defined(__BEOS__) +// BeOS +# define BOOST_PLATFORM_CONFIG "boost/config/platform/beos.hpp" + +#elif defined(macintosh) || defined(__APPLE__) || defined(__APPLE_CC__) +// MacOS +# define BOOST_PLATFORM_CONFIG "boost/config/platform/macos.hpp" + +#elif defined(__IBMCPP__) || defined(_AIX) +// IBM +# define BOOST_PLATFORM_CONFIG "boost/config/platform/aix.hpp" + +#elif defined(__amigaos__) +// AmigaOS +# define BOOST_PLATFORM_CONFIG "boost/config/platform/amigaos.hpp" + +#else + +# if defined(unix) \ + || defined(__unix) \ + || defined(_XOPEN_SOURCE) \ + || defined(_POSIX_SOURCE) + + // generic unix platform: + +# ifndef BOOST_HAS_UNISTD_H +# define BOOST_HAS_UNISTD_H +# endif + +# include + +# endif + +# if defined (BOOST_ASSERT_CONFIG) + // this must come last - generate an error if we don't + // recognise the platform: +# error "Unknown platform - please configure and report the results to boost.org" +# endif + +#endif + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/select_stdlib_config.hpp b/trunk/paradiseo-eo/contrib/boost/config/select_stdlib_config.hpp new file mode 100644 index 000000000..b7bf59143 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/select_stdlib_config.hpp @@ -0,0 +1,68 @@ +// Boost compiler configuration selection header file + +// (C) Copyright John Maddock 2001 - 2003. +// (C) Copyright Jens Maurer 2001 - 2002. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + + +// See http://www.boost.org for most recent version. + +// locate which std lib we are using and define BOOST_STDLIB_CONFIG as needed: + +// we need to include a std lib header here in order to detect which +// library is in use, use as it's about the smallest +// of the std lib headers - do not rely on this header being included - +// users can short-circuit this header if they know whose std lib +// they are using. + +#include + +#if defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION) +// STLPort library; this _must_ come first, otherwise since +// STLport typically sits on top of some other library, we +// can end up detecting that first rather than STLport: +# define BOOST_STDLIB_CONFIG "boost/config/stdlib/stlport.hpp" + +#elif defined(__LIBCOMO__) +// Comeau STL: +#define BOOST_STDLIB_CONFIG "boost/config/stdlib/libcomo.hpp" + +#elif defined(__STD_RWCOMPILER_H__) || defined(_RWSTD_VER) +// Rogue Wave library: +# define BOOST_STDLIB_CONFIG "boost/config/stdlib/roguewave.hpp" + +#elif defined(__GLIBCPP__) || defined(__GLIBCXX__) +// GNU libstdc++ 3 +# define BOOST_STDLIB_CONFIG "boost/config/stdlib/libstdcpp3.hpp" + +#elif defined(__STL_CONFIG_H) +// generic SGI STL +# define BOOST_STDLIB_CONFIG "boost/config/stdlib/sgi.hpp" + +#elif defined(__MSL_CPP__) +// MSL standard lib: +# define BOOST_STDLIB_CONFIG "boost/config/stdlib/msl.hpp" + +#elif defined(__IBMCPP__) +// take the default VACPP std lib +# define BOOST_STDLIB_CONFIG "boost/config/stdlib/vacpp.hpp" + +#elif defined(MSIPL_COMPILE_H) +// Modena C++ standard library +# define BOOST_STDLIB_CONFIG "boost/config/stdlib/modena.hpp" + +#elif (defined(_YVALS) && !defined(__IBMCPP__)) || defined(_CPPLIB_VER) +// Dinkumware Library (this has to appear after any possible replacement libraries): +# define BOOST_STDLIB_CONFIG "boost/config/stdlib/dinkumware.hpp" + +#elif defined (BOOST_ASSERT_CONFIG) +// this must come last - generate an error if we don't +// recognise the library: +# error "Unknown standard library - please configure and report the results to boost.org" + +#endif + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/stdlib/CVS/Entries b/trunk/paradiseo-eo/contrib/boost/config/stdlib/CVS/Entries new file mode 100644 index 000000000..d7a4c40c1 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/stdlib/CVS/Entries @@ -0,0 +1,10 @@ +/dinkumware.hpp/1.1/Thu Oct 6 12:13:52 2005// +/libcomo.hpp/1.1/Thu Oct 6 12:13:52 2005// +/libstdcpp3.hpp/1.1/Thu Oct 6 12:13:52 2005// +/modena.hpp/1.1/Thu Oct 6 12:13:52 2005// +/msl.hpp/1.1/Thu Oct 6 12:13:52 2005// +/roguewave.hpp/1.1/Thu Oct 6 12:13:52 2005// +/sgi.hpp/1.1/Thu Oct 6 12:13:52 2005// +/stlport.hpp/1.1/Thu Oct 6 12:13:52 2005// +/vacpp.hpp/1.1/Thu Oct 6 12:13:52 2005// +D diff --git a/trunk/paradiseo-eo/contrib/boost/config/stdlib/CVS/Repository b/trunk/paradiseo-eo/contrib/boost/config/stdlib/CVS/Repository new file mode 100644 index 000000000..0bdf66d0a --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/stdlib/CVS/Repository @@ -0,0 +1 @@ +eo/contrib/boost/config/stdlib diff --git a/trunk/paradiseo-eo/contrib/boost/config/stdlib/CVS/Root b/trunk/paradiseo-eo/contrib/boost/config/stdlib/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/stdlib/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/contrib/boost/config/stdlib/dinkumware.hpp b/trunk/paradiseo-eo/contrib/boost/config/stdlib/dinkumware.hpp new file mode 100644 index 000000000..aa214fc1b --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/stdlib/dinkumware.hpp @@ -0,0 +1,106 @@ +// (C) Copyright John Maddock 2001 - 2003. +// (C) Copyright Jens Maurer 2001. +// (C) Copyright Peter Dimov 2001. +// (C) Copyright David Abrahams 2002. +// (C) Copyright Guillaume Melquiond 2003. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// Dinkumware standard library config: + +#if !defined(_YVALS) && !defined(_CPPLIB_VER) +#include +#if !defined(_YVALS) && !defined(_CPPLIB_VER) +#error This is not the Dinkumware lib! +#endif +#endif + + +#if defined(_CPPLIB_VER) && (_CPPLIB_VER >= 306) + // full dinkumware 3.06 and above + // fully conforming provided the compiler supports it: +# if !(defined(_GLOBAL_USING) && (_GLOBAL_USING+0 > 0)) && !defined(__BORLANDC__) && !defined(_STD) && !(defined(__ICC) && (__ICC >= 700)) // can be defined in yvals.h +# define BOOST_NO_STDC_NAMESPACE +# endif +# if !(defined(_HAS_MEMBER_TEMPLATES_REBIND) && (_HAS_MEMBER_TEMPLATES_REBIND+0 > 0)) && !(defined(_MSC_VER) && (_MSC_VER > 1300)) && defined(BOOST_MSVC) +# define BOOST_NO_STD_ALLOCATOR +# endif +# define BOOST_HAS_PARTIAL_STD_ALLOCATOR +# if defined(BOOST_MSVC) && (BOOST_MSVC < 1300) + // if this lib version is set up for vc6 then there is no std::use_facet: +# define BOOST_NO_STD_USE_FACET +# define BOOST_HAS_TWO_ARG_USE_FACET + // C lib functions aren't in namespace std either: +# define BOOST_NO_STDC_NAMESPACE + // and nor is +# define BOOST_NO_EXCEPTION_STD_NAMESPACE +# endif +// There's no numeric_limits support unless _LONGLONG is defined: +# if !defined(_LONGLONG) && (_CPPLIB_VER <= 310) +# define BOOST_NO_MS_INT64_NUMERIC_LIMITS +# endif +// 3.06 appears to have (non-sgi versions of) & , +// and no at all +#else +# define BOOST_MSVC_STD_ITERATOR 1 +# define BOOST_NO_STD_ITERATOR +# define BOOST_NO_TEMPLATED_ITERATOR_CONSTRUCTORS +# define BOOST_NO_STD_ALLOCATOR +# define BOOST_NO_STDC_NAMESPACE +# define BOOST_NO_STD_USE_FACET +# define BOOST_NO_STD_OUTPUT_ITERATOR_ASSIGN +# define BOOST_HAS_MACRO_USE_FACET +# ifndef _CPPLIB_VER + // Updated Dinkum library defines this, and provides + // its own min and max definitions. +# define BOOST_NO_STD_MIN_MAX +# define BOOST_NO_MS_INT64_NUMERIC_LIMITS +# endif +#endif + +// +// std extension namespace is stdext for vc7.1 and later, +// the same applies to other compilers that sit on top +// of vc7.1 (Intel and Comeau): +// +#if defined(_MSC_VER) && (_MSC_VER >= 1310) && !defined(__BORLANDC__) +# define BOOST_STD_EXTENSION_NAMESPACE stdext +#endif + + +#if (defined(_MSC_VER) && (_MSC_VER <= 1300) && !defined(__BORLANDC__)) || !defined(_CPPLIB_VER) || (_CPPLIB_VER < 306) + // if we're using a dinkum lib that's + // been configured for VC6/7 then there is + // no iterator traits (true even for icl) +# define BOOST_NO_STD_ITERATOR_TRAITS +#endif + +#if defined(__ICL) && (__ICL < 800) && defined(_CPPLIB_VER) && (_CPPLIB_VER <= 310) +// Intel C++ chokes over any non-trivial use of +// this may be an overly restrictive define, but regex fails without it: +# define BOOST_NO_STD_LOCALE +#endif + +#ifdef _CPPLIB_VER +# define BOOST_DINKUMWARE_STDLIB _CPPLIB_VER +#else +# define BOOST_DINKUMWARE_STDLIB 1 +#endif + +#ifdef _CPPLIB_VER +# define BOOST_STDLIB "Dinkumware standard library version " BOOST_STRINGIZE(_CPPLIB_VER) +#else +# define BOOST_STDLIB "Dinkumware standard library version 1.x" +#endif + + + + + + + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/stdlib/libcomo.hpp b/trunk/paradiseo-eo/contrib/boost/config/stdlib/libcomo.hpp new file mode 100644 index 000000000..b2c8e4400 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/stdlib/libcomo.hpp @@ -0,0 +1,46 @@ +// (C) Copyright John Maddock 2002 - 2003. +// (C) Copyright Jens Maurer 2002 - 2003. +// (C) Copyright Beman Dawes 2002 - 2003. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// Comeau STL: + +#if !defined(__LIBCOMO__) +# include +# if !defined(__LIBCOMO__) +# error "This is not the Comeau STL!" +# endif +#endif + +// +// std::streambuf is non-standard +// NOTE: versions of libcomo prior to beta28 have octal version numbering, +// e.g. version 25 is 21 (dec) +#if __LIBCOMO_VERSION__ <= 22 +# define BOOST_NO_STD_WSTREAMBUF +#endif + +#if (__LIBCOMO_VERSION__ <= 31) && defined(_WIN32) +#define BOOST_NO_SWPRINTF +#endif + +#if __LIBCOMO_VERSION__ >= 31 +# define BOOST_HAS_HASH +# define BOOST_HAS_SLIST +#endif + +// +// Intrinsic type_traits support. +// The SGI STL has it's own __type_traits class, which +// has intrinsic compiler support with SGI's compilers. +// Whatever map SGI style type traits to boost equivalents: +// +#define BOOST_HAS_SGI_TYPE_TRAITS + +#define BOOST_STDLIB "Comeau standard library " BOOST_STRINGIZE(__LIBCOMO_VERSION__) + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/stdlib/libstdcpp3.hpp b/trunk/paradiseo-eo/contrib/boost/config/stdlib/libstdcpp3.hpp new file mode 100644 index 000000000..f367fa0f1 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/stdlib/libstdcpp3.hpp @@ -0,0 +1,61 @@ +// (C) Copyright John Maddock 2001. +// (C) Copyright Jens Maurer 2001. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// config for libstdc++ v3 +// not much to go in here: + +#ifdef __GLIBCXX__ +#define BOOST_STDLIB "GNU libstdc++ version " BOOST_STRINGIZE(__GLIBCXX__) +#else +#define BOOST_STDLIB "GNU libstdc++ version " BOOST_STRINGIZE(__GLIBCPP__) +#endif + +#if !defined(_GLIBCPP_USE_WCHAR_T) && !defined(_GLIBCXX_USE_WCHAR_T) +# define BOOST_NO_CWCHAR +# define BOOST_NO_CWCTYPE +# define BOOST_NO_STD_WSTRING +# define BOOST_NO_STD_WSTREAMBUF +#endif + +#if defined(__osf__) && !defined(_REENTRANT) \ + && ( defined(_GLIBCXX_HAVE_GTHR_DEFAULT) || defined(_GLIBCPP_HAVE_GTHR_DEFAULT) ) +// GCC 3 on Tru64 forces the definition of _REENTRANT when any std lib header +// file is included, therefore for consistency we define it here as well. +# define _REENTRANT +#endif + +#ifdef __GLIBCXX__ // gcc 3.4 and greater: +# ifdef _GLIBCXX_HAVE_GTHR_DEFAULT + // + // If the std lib has thread support turned on, then turn it on in Boost + // as well. We do this because some gcc-3.4 std lib headers define _REENTANT + // while others do not... + // +# define BOOST_HAS_THREADS +# else +# define BOOST_DISABLE_THREADS +# endif +#elif defined(__GLIBCPP__) && !defined(_GLIBCPP_HAVE_GTHR_DEFAULT) + // disable thread support if the std lib was built single threaded: +# define BOOST_DISABLE_THREADS +#endif + +#if (defined(linux) || defined(__linux) || defined(__linux__)) && defined(__arm__) && defined(_GLIBCPP_HAVE_GTHR_DEFAULT) +// linux on arm apparently doesn't define _REENTRANT +// so just turn on threading support whenever the std lib is thread safe: +# define BOOST_HAS_THREADS +#endif + + +#if !defined(_GLIBCPP_USE_LONG_LONG) \ + && !defined(_GLIBCXX_USE_LONG_LONG)\ + && defined(BOOST_HAS_LONG_LONG) +// May have been set by compiler/*.hpp, but "long long" without library +// support is useless. +# undef BOOST_HAS_LONG_LONG +#endif diff --git a/trunk/paradiseo-eo/contrib/boost/config/stdlib/modena.hpp b/trunk/paradiseo-eo/contrib/boost/config/stdlib/modena.hpp new file mode 100644 index 000000000..61e31b7d1 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/stdlib/modena.hpp @@ -0,0 +1,30 @@ +// (C) Copyright Jens Maurer 2001. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// Modena C++ standard library (comes with KAI C++) + +#if !defined(MSIPL_COMPILE_H) +# include +# if !defined(__MSIPL_COMPILE_H) +# error "This is not the Modena C++ library!" +# endif +#endif + +#ifndef MSIPL_NL_TYPES +#define BOOST_NO_STD_MESSAGES +#endif + +#ifndef MSIPL_WCHART +#define BOOST_NO_STD_WSTRING +#endif + +#define BOOST_STDLIB "Modena C++ standard library" + + + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/stdlib/msl.hpp b/trunk/paradiseo-eo/contrib/boost/config/stdlib/msl.hpp new file mode 100644 index 000000000..0df8e0e3b --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/stdlib/msl.hpp @@ -0,0 +1,59 @@ +// (C) Copyright John Maddock 2001. +// (C) Copyright Darin Adler 2001. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// Metrowerks standard library: + +#ifndef __MSL_CPP__ +# include +# ifndef __MSL_CPP__ +# error This is not the MSL standard library! +# endif +#endif + +#if __MSL_CPP__ >= 0x6000 // Pro 6 +# define BOOST_HAS_HASH +# define BOOST_STD_EXTENSION_NAMESPACE Metrowerks +#endif +#define BOOST_HAS_SLIST + +#if __MSL_CPP__ < 0x6209 +# define BOOST_NO_STD_MESSAGES +#endif + +// check C lib version for +#include + +#if defined(__MSL__) && (__MSL__ >= 0x5000) +# define BOOST_HAS_STDINT_H +# if !defined(__PALMOS_TRAPS__) +# define BOOST_HAS_UNISTD_H +# endif + // boilerplate code: +# include +#endif + +#if defined(_MWMT) || _MSL_THREADSAFE +# define BOOST_HAS_THREADS +#endif + +#ifdef _MSL_NO_EXPLICIT_FUNC_TEMPLATE_ARG +# define BOOST_NO_STD_USE_FACET +# define BOOST_HAS_TWO_ARG_USE_FACET +#endif + + +#define BOOST_STDLIB "Metrowerks Standard Library version " BOOST_STRINGIZE(__MSL_CPP__) + + + + + + + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/stdlib/roguewave.hpp b/trunk/paradiseo-eo/contrib/boost/config/stdlib/roguewave.hpp new file mode 100644 index 000000000..b331f6538 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/stdlib/roguewave.hpp @@ -0,0 +1,127 @@ +// (C) Copyright John Maddock 2001 - 2003. +// (C) Copyright Jens Maurer 2001. +// (C) Copyright David Abrahams 2003. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// Rogue Wave std lib: + +#if !defined(__STD_RWCOMPILER_H__) && !defined(_RWSTD_VER) +# include +# if !defined(__STD_RWCOMPILER_H__) && !defined(_RWSTD_VER) +# error This is not the Rogue Wave standard library +# endif +#endif +// +// figure out a consistent version number: +// +#ifndef _RWSTD_VER +# define BOOST_RWSTD_VER 0x010000 +#elif _RWSTD_VER < 0x010000 +# define BOOST_RWSTD_VER (_RWSTD_VER << 8) +#else +# define BOOST_RWSTD_VER _RWSTD_VER +#endif + +#ifndef _RWSTD_VER +# define BOOST_STDLIB "Rogue Wave standard library version (Unknown version)" +#else +# define BOOST_STDLIB "Rogue Wave standard library version " BOOST_STRINGIZE(_RWSTD_VER) +#endif + +// +// Prior to version 2.2.0 the primary template for std::numeric_limits +// does not have compile time constants, even though specializations of that +// template do: +// +#if BOOST_RWSTD_VER < 0x020200 +# define BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS +#endif + +// Sun CC 5.5 patch 113817-07 adds long long specialization, but does not change the +// library version number (http://sunsolve6.sun.com/search/document.do?assetkey=1-21-113817): +#if BOOST_RWSTD_VER <= 0x020101 && (!defined(__SUNPRO_CC) || (__SUNPRO_CC < 0x550)) +# define BOOST_NO_LONG_LONG_NUMERIC_LIMITS +# endif + +// +// Borland version of numeric_limits lacks __int64 specialisation: +// +#ifdef __BORLANDC__ +# define BOOST_NO_MS_INT64_NUMERIC_LIMITS +#endif + +// +// No std::iterator if it can't figure out default template args: +// +#if defined(_RWSTD_NO_SIMPLE_DEFAULT_TEMPLATES) || defined(RWSTD_NO_SIMPLE_DEFAULT_TEMPLATES) || (BOOST_RWSTD_VER < 0x020000) +# define BOOST_NO_STD_ITERATOR +#endif + +// +// No iterator traits without partial specialization: +// +#if defined(_RWSTD_NO_CLASS_PARTIAL_SPEC) || defined(RWSTD_NO_CLASS_PARTIAL_SPEC) +# define BOOST_NO_STD_ITERATOR_TRAITS +#endif + +// +// Prior to version 2.0, std::auto_ptr was buggy, and there were no +// new-style iostreams, and no conformant std::allocator: +// +#if (BOOST_RWSTD_VER < 0x020000) +# define BOOST_NO_AUTO_PTR +# define BOOST_NO_STRINGSTREAM +# define BOOST_NO_STD_ALLOCATOR +# define BOOST_NO_STD_LOCALE +#endif + +// +// No template iterator constructors without member template support: +// +#if defined(RWSTD_NO_MEMBER_TEMPLATES) || defined(_RWSTD_NO_MEMBER_TEMPLATES) +# define BOOST_NO_TEMPLATED_ITERATOR_CONSTRUCTORS +#endif + +// +// RW defines _RWSTD_ALLOCATOR if the allocator is conformant and in use +// (the or _HPACC_ part is a hack - the library seems to define _RWSTD_ALLOCATOR +// on HP aCC systems even though the allocator is in fact broken): +// +#if !defined(_RWSTD_ALLOCATOR) || (defined(__HP_aCC) && __HP_aCC <= 33100) +# define BOOST_NO_STD_ALLOCATOR +#endif + +// +// If we have a std::locale, we still may not have std::use_facet: +// +#if defined(_RWSTD_NO_TEMPLATE_ON_RETURN_TYPE) && !defined(BOOST_NO_STD_LOCALE) +# define BOOST_NO_STD_USE_FACET +# define BOOST_HAS_TWO_ARG_USE_FACET +#endif + +// +// There's no std::distance prior to version 2, or without +// partial specialization support: +// +#if (BOOST_RWSTD_VER < 0x020000) || defined(_RWSTD_NO_CLASS_PARTIAL_SPEC) + #define BOOST_NO_STD_DISTANCE +#endif + +// +// Some versions of the rogue wave library don't have assignable +// OutputIterators: +// +#if BOOST_RWSTD_VER < 0x020100 +# define BOOST_NO_STD_OUTPUT_ITERATOR_ASSIGN +#endif + +// +// Disable BOOST_HAS_LONG_LONG when the library has no support for it. +// +#if !defined(_RWSTD_LONG_LONG) && defined(BOOST_HAS_LONG_LONG) +# undef BOOST_HAS_LONG_LONG +#endif diff --git a/trunk/paradiseo-eo/contrib/boost/config/stdlib/sgi.hpp b/trunk/paradiseo-eo/contrib/boost/config/stdlib/sgi.hpp new file mode 100644 index 000000000..67f7a0a4b --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/stdlib/sgi.hpp @@ -0,0 +1,111 @@ +// (C) Copyright John Maddock 2001 - 2003. +// (C) Copyright Darin Adler 2001. +// (C) Copyright Jens Maurer 2001 - 2003. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// generic SGI STL: + +#if !defined(__STL_CONFIG_H) +# include +# if !defined(__STL_CONFIG_H) +# error "This is not the SGI STL!" +# endif +#endif + +// +// No std::iterator traits without partial specialisation: +// +#if !defined(__STL_CLASS_PARTIAL_SPECIALIZATION) +# define BOOST_NO_STD_ITERATOR_TRAITS +#endif + +// +// No std::stringstream with gcc < 3 +// +#if defined(__GNUC__) && (__GNUC__ < 3) && \ + ((__GNUC_MINOR__ < 95) || (__GNUC_MINOR__ == 96)) && \ + !defined(__STL_USE_NEW_IOSTREAMS) || \ + defined(__APPLE_CC__) + // Note that we only set this for GNU C++ prior to 2.95 since the + // latest patches for that release do contain a minimal + // If you are running a 2.95 release prior to 2.95.3 then this will need + // setting, but there is no way to detect that automatically (other + // than by running the configure script). + // Also, the unofficial GNU C++ 2.96 included in RedHat 7.1 doesn't + // have . +# define BOOST_NO_STRINGSTREAM +#endif + +// +// Assume no std::locale without own iostreams (this may be an +// incorrect assumption in some cases): +// +#if !defined(__SGI_STL_OWN_IOSTREAMS) && !defined(__STL_USE_NEW_IOSTREAMS) +# define BOOST_NO_STD_LOCALE +#endif + +// +// Original native SGI streams have non-standard std::messages facet: +// +#if defined(__sgi) && (_COMPILER_VERSION <= 650) && !defined(__SGI_STL_OWN_IOSTREAMS) +# define BOOST_NO_STD_LOCALE +#endif + +// +// SGI's new iostreams have missing "const" in messages<>::open +// +#if defined(__sgi) && (_COMPILER_VERSION <= 740) && defined(__STL_USE_NEW_IOSTREAMS) +# define BOOST_NO_STD_MESSAGES +#endif + +// +// No template iterator constructors, or std::allocator +// without member templates: +// +#if !defined(__STL_MEMBER_TEMPLATES) +# define BOOST_NO_TEMPLATED_ITERATOR_CONSTRUCTORS +# define BOOST_NO_STD_ALLOCATOR +#endif + +// +// We always have SGI style hash_set, hash_map, and slist: +// +#define BOOST_HAS_HASH +#define BOOST_HAS_SLIST + +// +// If this is GNU libstdc++2, then no and no std::wstring: +// +#if (defined(__GNUC__) && (__GNUC__ < 3)) +# include +# if defined(__BASTRING__) +# define BOOST_NO_LIMITS +// Note: will provide compile-time constants +# undef BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS +# define BOOST_NO_STD_WSTRING +# endif +#endif + +// +// There is no standard iterator unless we have namespace support: +// +#if !defined(__STL_USE_NAMESPACES) +# define BOOST_NO_STD_ITERATOR +#endif + +// +// Intrinsic type_traits support. +// The SGI STL has it's own __type_traits class, which +// has intrinsic compiler support with SGI's compilers. +// Whatever map SGI style type traits to boost equivalents: +// +#define BOOST_HAS_SGI_TYPE_TRAITS + +#define BOOST_STDLIB "SGI standard library" + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/stdlib/stlport.hpp b/trunk/paradiseo-eo/contrib/boost/config/stdlib/stlport.hpp new file mode 100644 index 000000000..4843ea59b --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/stdlib/stlport.hpp @@ -0,0 +1,201 @@ +// (C) Copyright John Maddock 2001 - 2002. +// (C) Copyright Darin Adler 2001. +// (C) Copyright Jens Maurer 2001. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// STLPort standard library config: + +#if !defined(__SGI_STL_PORT) && !defined(_STLPORT_VERSION) +# include +# if !defined(__SGI_STL_PORT) && !defined(_STLPORT_VERSION) +# error "This is not STLPort!" +# endif +#endif + +// +// __STL_STATIC_CONST_INIT_BUG implies BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS +// for versions prior to 4.1(beta) +// +#if (defined(__STL_STATIC_CONST_INIT_BUG) || defined(_STLP_STATIC_CONST_INIT_BUG)) && (__SGI_STL_PORT <= 0x400) +# define BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS +#endif + +// +// If STLport thinks that there is no partial specialisation, then there is no +// std::iterator traits: +// +#if !(defined(_STLP_CLASS_PARTIAL_SPECIALIZATION) || defined(__STL_CLASS_PARTIAL_SPECIALIZATION)) +# define BOOST_NO_STD_ITERATOR_TRAITS +#endif + +// +// No new style iostreams on GCC without STLport's iostreams enabled: +// +#if (defined(__GNUC__) && (__GNUC__ < 3)) && !(defined(__SGI_STL_OWN_IOSTREAMS) || defined(_STLP_OWN_IOSTREAMS)) +# define BOOST_NO_STRINGSTREAM +#endif + +// +// No new iostreams implies no std::locale, and no std::stringstream: +// +#if defined(__STL_NO_IOSTREAMS) || defined(__STL_NO_NEW_IOSTREAMS) || defined(_STLP_NO_IOSTREAMS) || defined(_STLP_NO_NEW_IOSTREAMS) +# define BOOST_NO_STD_LOCALE +# define BOOST_NO_STRINGSTREAM +#endif + +// +// If the streams are not native, and we have a "using ::x" compiler bug +// then the io stream facets are not available in namespace std:: +// +#ifdef _STLPORT_VERSION +# if !defined(_STLP_OWN_IOSTREAMS) && defined(_STLP_USE_NAMESPACES) && defined(BOOST_NO_USING_TEMPLATE) && !defined(__BORLANDC__) +# define BOOST_NO_STD_LOCALE +# endif +#else +# if !defined(__SGI_STL_OWN_IOSTREAMS) && defined(__STL_USE_NAMESPACES) && defined(BOOST_NO_USING_TEMPLATE) && !defined(__BORLANDC__) +# define BOOST_NO_STD_LOCALE +# endif +#endif + +// +// Without member template support enabled, their are no template +// iterate constructors, and no std::allocator: +// +#if !(defined(__STL_MEMBER_TEMPLATES) || defined(_STLP_MEMBER_TEMPLATES)) +# define BOOST_NO_TEMPLATED_ITERATOR_CONSTRUCTORS +# define BOOST_NO_STD_ALLOCATOR +#endif +// +// however we always have at least a partial allocator: +// +#define BOOST_HAS_PARTIAL_STD_ALLOCATOR + +#if !defined(_STLP_MEMBER_TEMPLATE_CLASSES) +# define BOOST_NO_STD_ALLOCATOR +#endif + +#if defined(_STLP_NO_MEMBER_TEMPLATE_KEYWORD) && defined(BOOST_MSVC) && (BOOST_MSVC <= 1300) +# define BOOST_NO_STD_ALLOCATOR +#endif + +// +// If STLport thinks there is no wchar_t at all, then we have to disable +// the support for the relevant specilazations of std:: templates. +// +#if !defined(_STLP_HAS_WCHAR_T) && !defined(_STLP_WCHAR_T_IS_USHORT) +# ifndef BOOST_NO_STD_WSTRING +# define BOOST_NO_STD_WSTRING +# endif +# ifndef BOOST_NO_STD_WSTREAMBUF +# define BOOST_NO_STD_WSTREAMBUF +# endif +#endif + +// +// We always have SGI style hash_set, hash_map, and slist: +// +#define BOOST_HAS_HASH +#define BOOST_HAS_SLIST + +// +// STLport does a good job of importing names into namespace std::, +// but doesn't always get them all, define BOOST_NO_STDC_NAMESPACE, since our +// workaround does not conflict with STLports: +// +// +// Harold Howe says: +// Borland switched to STLport in BCB6. Defining BOOST_NO_STDC_NAMESPACE with +// BCB6 does cause problems. If we detect C++ Builder, then don't define +// BOOST_NO_STDC_NAMESPACE +// +#if !defined(__BORLANDC__) && !defined(__DMC__) +// +// If STLport is using it's own namespace, and the real names are in +// the global namespace, then we duplicate STLport's using declarations +// (by defining BOOST_NO_STDC_NAMESPACE), we do this because STLport doesn't +// necessarily import all the names we need into namespace std:: +// +# if (defined(__STL_IMPORT_VENDOR_CSTD) \ + || defined(__STL_USE_OWN_NAMESPACE) \ + || defined(_STLP_IMPORT_VENDOR_CSTD) \ + || defined(_STLP_USE_OWN_NAMESPACE)) \ + && (defined(__STL_VENDOR_GLOBAL_CSTD) || defined (_STLP_VENDOR_GLOBAL_CSTD)) +# define BOOST_NO_STDC_NAMESPACE +# define BOOST_NO_EXCEPTION_STD_NAMESPACE +# endif +#elif defined(__BORLANDC__) && __BORLANDC__ < 0x560 +// STLport doesn't import std::abs correctly: +#include +namespace std { using ::abs; } +// and strcmp/strcpy don't get imported either ('cos they are macros) +#include +#ifdef strcpy +# undef strcpy +#endif +#ifdef strcmp +# undef strcmp +#endif +#ifdef _STLP_VENDOR_CSTD +namespace std{ using _STLP_VENDOR_CSTD::strcmp; using _STLP_VENDOR_CSTD::strcpy; } +#endif +#endif + +// +// std::use_facet may be non-standard, uses a class instead: +// +#if defined(__STL_NO_EXPLICIT_FUNCTION_TMPL_ARGS) || defined(_STLP_NO_EXPLICIT_FUNCTION_TMPL_ARGS) +# define BOOST_NO_STD_USE_FACET +# define BOOST_HAS_STLP_USE_FACET +#endif + +// +// If STLport thinks there are no wide functions, etc. is not working; but +// only if BOOST_NO_STDC_NAMESPACE is not defined (if it is then we do the import +// into std:: ourselves). +// +#if defined(_STLP_NO_NATIVE_WIDE_FUNCTIONS) && !defined(BOOST_NO_STDC_NAMESPACE) +# define BOOST_NO_CWCHAR +# define BOOST_NO_CWCTYPE +#endif + +// +// If STLport for some reason was configured so that it thinks that wchar_t +// is not an intrinsic type, then we have to disable the support for it as +// well (we would be missing required specializations otherwise). +// +#if !defined( _STLP_HAS_WCHAR_T) || defined(_STLP_WCHAR_T_IS_USHORT) +# undef BOOST_NO_INTRINSIC_WCHAR_T +# define BOOST_NO_INTRINSIC_WCHAR_T +#endif + +// +// Borland ships a version of STLport with C++ Builder 6 that lacks +// hashtables and the like: +// +#if defined(__BORLANDC__) && (__BORLANDC__ == 0x560) +# undef BOOST_HAS_HASH +#endif + +// +// gcc-2.95.3/STLPort does not like the using declarations we use to get ADL with std::min/max +// +#if defined(__GNUC__) && (__GNUC__ < 3) +# include // for std::min and std::max +# define BOOST_USING_STD_MIN() ((void)0) +# define BOOST_USING_STD_MAX() ((void)0) +namespace boost { using std::min; using std::max; } +#endif + +#define BOOST_STDLIB "STLPort standard library version " BOOST_STRINGIZE(__SGI_STL_PORT) + + + + + + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/stdlib/vacpp.hpp b/trunk/paradiseo-eo/contrib/boost/config/stdlib/vacpp.hpp new file mode 100644 index 000000000..8321ee0cc --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/stdlib/vacpp.hpp @@ -0,0 +1,18 @@ +// (C) Copyright John Maddock 2001 - 2002. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +#if __IBMCPP__ <= 501 +# define BOOST_NO_STD_ALLOCATOR +#endif + +#define BOOST_HAS_MACRO_USE_FACET +#define BOOST_NO_STD_MESSAGES + +#define BOOST_STDLIB "Visual Age default standard library" + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/suffix.hpp b/trunk/paradiseo-eo/contrib/boost/config/suffix.hpp new file mode 100644 index 000000000..d4d9502d4 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/suffix.hpp @@ -0,0 +1,547 @@ +// Boost config.hpp configuration header file ------------------------------// + +// (C) Copyright John Maddock 2001 - 2003. +// (C) Copyright Darin Adler 2001. +// (C) Copyright Peter Dimov 2001. +// (C) Copyright Bill Kempf 2002. +// (C) Copyright Jens Maurer 2002. +// (C) Copyright David Abrahams 2002 - 2003. +// (C) Copyright Gennaro Prota 2003. +// (C) Copyright Eric Friedman 2003. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// See http://www.boost.org for most recent version. + +// Boost config.hpp policy and rationale documentation has been moved to +// http://www.boost.org/libs/config +// +// This file is intended to be stable, and relatively unchanging. +// It should contain boilerplate code only - no compiler specific +// code unless it is unavoidable - no changes unless unavoidable. + +#ifndef BOOST_CONFIG_SUFFIX_HPP +#define BOOST_CONFIG_SUFFIX_HPP + +// +// look for long long by looking for the appropriate macros in . +// Note that we use limits.h rather than climits for maximal portability, +// remember that since these just declare a bunch of macros, there should be +// no namespace issues from this. +// +#include +# if !defined(BOOST_HAS_LONG_LONG) \ + && !defined(BOOST_MSVC) && !defined(__BORLANDC__) \ + && (defined(ULLONG_MAX) || defined(ULONG_LONG_MAX) || defined(ULONGLONG_MAX)) +# define BOOST_HAS_LONG_LONG +#endif + +// TODO: Remove the following lines after the 1.33 release because the presence +// of an integral 64 bit type has nothing to do with support for long long. + +#if !defined(BOOST_HAS_LONG_LONG) && !defined(BOOST_NO_INTEGRAL_INT64_T) && !defined(__DECCXX_VER) +# define BOOST_NO_INTEGRAL_INT64_T +#endif + +// GCC 3.x will clean up all of those nasty macro definitions that +// BOOST_NO_CTYPE_FUNCTIONS is intended to help work around, so undefine +// it under GCC 3.x. +#if defined(__GNUC__) && (__GNUC__ >= 3) && defined(BOOST_NO_CTYPE_FUNCTIONS) +# undef BOOST_NO_CTYPE_FUNCTIONS +#endif + + +// +// Assume any extensions are in namespace std:: unless stated otherwise: +// +# ifndef BOOST_STD_EXTENSION_NAMESPACE +# define BOOST_STD_EXTENSION_NAMESPACE std +# endif + +// +// If cv-qualified specializations are not allowed, then neither are cv-void ones: +// +# if defined(BOOST_NO_CV_SPECIALIZATIONS) \ + && !defined(BOOST_NO_CV_VOID_SPECIALIZATIONS) +# define BOOST_NO_CV_VOID_SPECIALIZATIONS +# endif + +// +// If there is no numeric_limits template, then it can't have any compile time +// constants either! +// +# if defined(BOOST_NO_LIMITS) \ + && !defined(BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS) +# define BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS +# define BOOST_NO_MS_INT64_NUMERIC_LIMITS +# define BOOST_NO_LONG_LONG_NUMERIC_LIMITS +# endif + +// +// if there is no long long then there is no specialisation +// for numeric_limits either: +// +#if !defined(BOOST_HAS_LONG_LONG) && !defined(BOOST_NO_LONG_LONG_NUMERIC_LIMITS) +# define BOOST_NO_LONG_LONG_NUMERIC_LIMITS +#endif + +// +// if there is no __int64 then there is no specialisation +// for numeric_limits<__int64> either: +// +#if !defined(BOOST_HAS_MS_INT64) && !defined(BOOST_NO_MS_INT64_NUMERIC_LIMITS) +# define BOOST_NO_MS_INT64_NUMERIC_LIMITS +#endif + +// +// if member templates are supported then so is the +// VC6 subset of member templates: +// +# if !defined(BOOST_NO_MEMBER_TEMPLATES) \ + && !defined(BOOST_MSVC6_MEMBER_TEMPLATES) +# define BOOST_MSVC6_MEMBER_TEMPLATES +# endif + +// +// Without partial specialization, can't test for partial specialisation bugs: +// +# if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) \ + && !defined(BOOST_BCB_PARTIAL_SPECIALIZATION_BUG) +# define BOOST_BCB_PARTIAL_SPECIALIZATION_BUG +# endif + +// +// Without partial specialization, we can't have array-type partial specialisations: +// +# if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) \ + && !defined(BOOST_NO_ARRAY_TYPE_SPECIALIZATIONS) +# define BOOST_NO_ARRAY_TYPE_SPECIALIZATIONS +# endif + +// +// Without partial specialization, std::iterator_traits can't work: +// +# if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) \ + && !defined(BOOST_NO_STD_ITERATOR_TRAITS) +# define BOOST_NO_STD_ITERATOR_TRAITS +# endif + +// +// Without member template support, we can't have template constructors +// in the standard library either: +// +# if defined(BOOST_NO_MEMBER_TEMPLATES) \ + && !defined(BOOST_MSVC6_MEMBER_TEMPLATES) \ + && !defined(BOOST_NO_TEMPLATED_ITERATOR_CONSTRUCTORS) +# define BOOST_NO_TEMPLATED_ITERATOR_CONSTRUCTORS +# endif + +// +// Without member template support, we can't have a conforming +// std::allocator template either: +// +# if defined(BOOST_NO_MEMBER_TEMPLATES) \ + && !defined(BOOST_MSVC6_MEMBER_TEMPLATES) \ + && !defined(BOOST_NO_STD_ALLOCATOR) +# define BOOST_NO_STD_ALLOCATOR +# endif + +// +// without ADL support then using declarations will break ADL as well: +// +#if defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP) && !defined(BOOST_FUNCTION_SCOPE_USING_DECLARATION_BREAKS_ADL) +# define BOOST_FUNCTION_SCOPE_USING_DECLARATION_BREAKS_ADL +#endif + +// +// If we have a standard allocator, then we have a partial one as well: +// +#if !defined(BOOST_NO_STD_ALLOCATOR) +# define BOOST_HAS_PARTIAL_STD_ALLOCATOR +#endif + +// +// We can't have a working std::use_facet if there is no std::locale: +// +# if defined(BOOST_NO_STD_LOCALE) && !defined(BOOST_NO_STD_USE_FACET) +# define BOOST_NO_STD_USE_FACET +# endif + +// +// We can't have a std::messages facet if there is no std::locale: +// +# if defined(BOOST_NO_STD_LOCALE) && !defined(BOOST_NO_STD_MESSAGES) +# define BOOST_NO_STD_MESSAGES +# endif + +// +// We can't have a working std::wstreambuf if there is no std::locale: +// +# if defined(BOOST_NO_STD_LOCALE) && !defined(BOOST_NO_STD_WSTREAMBUF) +# define BOOST_NO_STD_WSTREAMBUF +# endif + +// +// We can't have a if there is no : +// +# if defined(BOOST_NO_CWCHAR) && !defined(BOOST_NO_CWCTYPE) +# define BOOST_NO_CWCTYPE +# endif + +// +// We can't have a swprintf if there is no : +// +# if defined(BOOST_NO_CWCHAR) && !defined(BOOST_NO_SWPRINTF) +# define BOOST_NO_SWPRINTF +# endif + +// +// If Win32 support is turned off, then we must turn off +// threading support also, unless there is some other +// thread API enabled: +// +#if defined(BOOST_DISABLE_WIN32) && defined(_WIN32) \ + && !defined(BOOST_DISABLE_THREADS) && !defined(BOOST_HAS_PTHREADS) +# define BOOST_DISABLE_THREADS +#endif + +// +// Turn on threading support if the compiler thinks that it's in +// multithreaded mode. We put this here because there are only a +// limited number of macros that identify this (if there's any missing +// from here then add to the appropriate compiler section): +// +#if (defined(__MT__) || defined(_MT) || defined(_REENTRANT) \ + || defined(_PTHREADS)) && !defined(BOOST_HAS_THREADS) +# define BOOST_HAS_THREADS +#endif + +// +// Turn threading support off if BOOST_DISABLE_THREADS is defined: +// +#if defined(BOOST_DISABLE_THREADS) && defined(BOOST_HAS_THREADS) +# undef BOOST_HAS_THREADS +#endif + +// +// Turn threading support off if we don't recognise the threading API: +// +#if defined(BOOST_HAS_THREADS) && !defined(BOOST_HAS_PTHREADS)\ + && !defined(BOOST_HAS_WINTHREADS) && !defined(BOOST_HAS_BETHREADS)\ + && !defined(BOOST_HAS_MPTASKS) +# undef BOOST_HAS_THREADS +#endif + +// +// Turn threading detail macros off if we don't (want to) use threading +// +#ifndef BOOST_HAS_THREADS +# undef BOOST_HAS_PTHREADS +# undef BOOST_HAS_PTHREAD_MUTEXATTR_SETTYPE +# undef BOOST_HAS_WINTHREADS +# undef BOOST_HAS_BETHREADS +# undef BOOST_HAS_MPTASKS +#endif + +// +// If the compiler claims to be C99 conformant, then it had better +// have a : +// +# if defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901) +# define BOOST_HAS_STDINT_H +# endif + +// +// Define BOOST_NO_SLIST and BOOST_NO_HASH if required. +// Note that this is for backwards compatibility only. +// +# ifndef BOOST_HAS_SLIST +# define BOOST_NO_SLIST +# endif + +# ifndef BOOST_HAS_HASH +# define BOOST_NO_HASH +# endif + +// BOOST_HAS_ABI_HEADERS +// This macro gets set if we have headers that fix the ABI, +// and prevent ODR violations when linking to external libraries: +#if defined(BOOST_ABI_PREFIX) && defined(BOOST_ABI_SUFFIX) && !defined(BOOST_HAS_ABI_HEADERS) +# define BOOST_HAS_ABI_HEADERS +#endif + +#if defined(BOOST_HAS_ABI_HEADERS) && defined(BOOST_DISABLE_ABI_HEADERS) +# undef BOOST_HAS_ABI_HEADERS +#endif + +// BOOST_NO_STDC_NAMESPACE workaround --------------------------------------// +// Because std::size_t usage is so common, even in boost headers which do not +// otherwise use the C library, the workaround is included here so +// that ugly workaround code need not appear in many other boost headers. +// NOTE WELL: This is a workaround for non-conforming compilers; +// must still be #included in the usual places so that inclusion +// works as expected with standard conforming compilers. The resulting +// double inclusion of is harmless. + +# ifdef BOOST_NO_STDC_NAMESPACE +# include + namespace std { using ::ptrdiff_t; using ::size_t; } +# endif + +// Workaround for the unfortunate min/max macros defined by some platform headers + +#define BOOST_PREVENT_MACRO_SUBSTITUTION + +#ifndef BOOST_USING_STD_MIN +# define BOOST_USING_STD_MIN() using std::min +#endif + +#ifndef BOOST_USING_STD_MAX +# define BOOST_USING_STD_MAX() using std::max +#endif + +// BOOST_NO_STD_MIN_MAX workaround -----------------------------------------// + +# ifdef BOOST_NO_STD_MIN_MAX + +namespace std { + template + inline const _Tp& min BOOST_PREVENT_MACRO_SUBSTITUTION (const _Tp& __a, const _Tp& __b) { + return __b < __a ? __b : __a; + } + template + inline const _Tp& max BOOST_PREVENT_MACRO_SUBSTITUTION (const _Tp& __a, const _Tp& __b) { + return __a < __b ? __b : __a; + } +} + +# endif + +// BOOST_STATIC_CONSTANT workaround --------------------------------------- // +// On compilers which don't allow in-class initialization of static integral +// constant members, we must use enums as a workaround if we want the constants +// to be available at compile-time. This macro gives us a convenient way to +// declare such constants. + +# ifdef BOOST_NO_INCLASS_MEMBER_INITIALIZATION +# define BOOST_STATIC_CONSTANT(type, assignment) enum { assignment } +# else +# define BOOST_STATIC_CONSTANT(type, assignment) static const type assignment +# endif + +// BOOST_USE_FACET / HAS_FACET workaround ----------------------------------// +// When the standard library does not have a conforming std::use_facet there +// are various workarounds available, but they differ from library to library. +// The same problem occurs with has_facet. +// These macros provide a consistent way to access a locale's facets. +// Usage: +// replace +// std::use_facet(loc); +// with +// BOOST_USE_FACET(Type, loc); +// Note do not add a std:: prefix to the front of BOOST_USE_FACET! +// Use for BOOST_HAS_FACET is analagous. + +#if defined(BOOST_NO_STD_USE_FACET) +# ifdef BOOST_HAS_TWO_ARG_USE_FACET +# define BOOST_USE_FACET(Type, loc) std::use_facet(loc, static_cast(0)) +# define BOOST_HAS_FACET(Type, loc) std::has_facet(loc, static_cast(0)) +# elif defined(BOOST_HAS_MACRO_USE_FACET) +# define BOOST_USE_FACET(Type, loc) std::_USE(loc, Type) +# define BOOST_HAS_FACET(Type, loc) std::_HAS(loc, Type) +# elif defined(BOOST_HAS_STLP_USE_FACET) +# define BOOST_USE_FACET(Type, loc) (*std::_Use_facet(loc)) +# define BOOST_HAS_FACET(Type, loc) std::has_facet< Type >(loc) +# endif +#else +# define BOOST_USE_FACET(Type, loc) std::use_facet< Type >(loc) +# define BOOST_HAS_FACET(Type, loc) std::has_facet< Type >(loc) +#endif + +// BOOST_NESTED_TEMPLATE workaround ------------------------------------------// +// Member templates are supported by some compilers even though they can't use +// the A::template member syntax, as a workaround replace: +// +// typedef typename A::template rebind binder; +// +// with: +// +// typedef typename A::BOOST_NESTED_TEMPLATE rebind binder; + +#ifndef BOOST_NO_MEMBER_TEMPLATE_KEYWORD +# define BOOST_NESTED_TEMPLATE template +#else +# define BOOST_NESTED_TEMPLATE +#endif + +// BOOST_UNREACHABLE_RETURN(x) workaround -------------------------------------// +// Normally evaluates to nothing, unless BOOST_NO_UNREACHABLE_RETURN_DETECTION +// is defined, in which case it evaluates to return x; Use when you have a return +// statement that can never be reached. + +#ifdef BOOST_NO_UNREACHABLE_RETURN_DETECTION +# define BOOST_UNREACHABLE_RETURN(x) return x; +#else +# define BOOST_UNREACHABLE_RETURN(x) +#endif + +// BOOST_DEDUCED_TYPENAME workaround ------------------------------------------// +// +// Some compilers don't support the use of `typename' for dependent +// types in deduced contexts, e.g. +// +// template void f(T, typename T::type); +// ^^^^^^^^ +// Replace these declarations with: +// +// template void f(T, BOOST_DEDUCED_TYPENAME T::type); + +#ifndef BOOST_NO_DEDUCED_TYPENAME +# define BOOST_DEDUCED_TYPENAME typename +#else +# define BOOST_DEDUCED_TYPENAME +#endif + +// long long workaround ------------------------------------------// +// On gcc (and maybe other compilers?) long long is alway supported +// but it's use may generate either warnings (with -ansi), or errors +// (with -pedantic -ansi) unless it's use is prefixed by __extension__ +// +#if defined(BOOST_HAS_LONG_LONG) +namespace boost{ +# ifdef __GNUC__ + __extension__ typedef long long long_long_type; + __extension__ typedef unsigned long long ulong_long_type; +# else + typedef long long long_long_type; + typedef unsigned long long ulong_long_type; +# endif +} +#endif + +// BOOST_[APPEND_]EXPLICIT_TEMPLATE_[NON_]TYPE macros --------------------------// +// +// Some compilers have problems with function templates whose +// template parameters don't appear in the function parameter +// list (basically they just link one instantiation of the +// template in the final executable). These macros provide a +// uniform way to cope with the problem with no effects on the +// calling syntax. + +// Example: +// +// #include +// #include +// #include +// +// template +// void f() { std::cout << n << ' '; } +// +// template +// void g() { std::cout << typeid(T).name() << ' '; } +// +// int main() { +// f<1>(); +// f<2>(); +// +// g(); +// g(); +// } +// +// With VC++ 6.0 the output is: +// +// 2 2 double double +// +// To fix it, write +// +// template +// void f(BOOST_EXPLICIT_TEMPLATE_NON_TYPE(int, n)) { ... } +// +// template +// void g(BOOST_EXPLICIT_TEMPLATE_TYPE(T)) { ... } +// + + +#if defined BOOST_NO_EXPLICIT_FUNCTION_TEMPLATE_ARGUMENTS + +# include "boost/type.hpp" +# include "boost/non_type.hpp" + +# define BOOST_EXPLICIT_TEMPLATE_TYPE(t) boost::type* = 0 +# define BOOST_EXPLICIT_TEMPLATE_TYPE_SPEC(t) boost::type* +# define BOOST_EXPLICIT_TEMPLATE_NON_TYPE(t, v) boost::non_type* = 0 +# define BOOST_EXPLICIT_TEMPLATE_NON_TYPE_SPEC(t, v) boost::non_type* + +# define BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(t) \ + , BOOST_EXPLICIT_TEMPLATE_TYPE(t) +# define BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE_SPEC(t) \ + , BOOST_EXPLICIT_TEMPLATE_TYPE_SPEC(t) +# define BOOST_APPEND_EXPLICIT_TEMPLATE_NON_TYPE(t, v) \ + , BOOST_EXPLICIT_TEMPLATE_NON_TYPE(t, v) +# define BOOST_APPEND_EXPLICIT_TEMPLATE_NON_TYPE_SPEC(t, v) \ + , BOOST_EXPLICIT_TEMPLATE_NON_TYPE_SPEC(t, v) + +#else + +// no workaround needed: expand to nothing + +# define BOOST_EXPLICIT_TEMPLATE_TYPE(t) +# define BOOST_EXPLICIT_TEMPLATE_TYPE_SPEC(t) +# define BOOST_EXPLICIT_TEMPLATE_NON_TYPE(t, v) +# define BOOST_EXPLICIT_TEMPLATE_NON_TYPE_SPEC(t, v) + +# define BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(t) +# define BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE_SPEC(t) +# define BOOST_APPEND_EXPLICIT_TEMPLATE_NON_TYPE(t, v) +# define BOOST_APPEND_EXPLICIT_TEMPLATE_NON_TYPE_SPEC(t, v) + + +#endif // defined BOOST_NO_EXPLICIT_FUNCTION_TEMPLATE_ARGUMENTS + + +// ---------------------------------------------------------------------------// + +// +// Helper macro BOOST_STRINGIZE: +// Converts the parameter X to a string after macro replacement +// on X has been performed. +// +#define BOOST_STRINGIZE(X) BOOST_DO_STRINGIZE(X) +#define BOOST_DO_STRINGIZE(X) #X + +// +// Helper macro BOOST_JOIN: +// The following piece of macro magic joins the two +// arguments together, even when one of the arguments is +// itself a macro (see 16.3.1 in C++ standard). The key +// is that macro expansion of macro arguments does not +// occur in BOOST_DO_JOIN2 but does in BOOST_DO_JOIN. +// +#define BOOST_JOIN( X, Y ) BOOST_DO_JOIN( X, Y ) +#define BOOST_DO_JOIN( X, Y ) BOOST_DO_JOIN2(X,Y) +#define BOOST_DO_JOIN2( X, Y ) X##Y + +// +// Set some default values for compiler/library/platform names. +// These are for debugging config setup only: +// +# ifndef BOOST_COMPILER +# define BOOST_COMPILER "Unknown ISO C++ Compiler" +# endif +# ifndef BOOST_STDLIB +# define BOOST_STDLIB "Unknown ISO standard library" +# endif +# ifndef BOOST_PLATFORM +# if defined(unix) || defined(__unix) || defined(_XOPEN_SOURCE) \ + || defined(_POSIX_SOURCE) +# define BOOST_PLATFORM "Generic Unix" +# else +# define BOOST_PLATFORM "Unknown" +# endif +# endif + +#endif + + + diff --git a/trunk/paradiseo-eo/contrib/boost/config/user.hpp b/trunk/paradiseo-eo/contrib/boost/config/user.hpp new file mode 100644 index 000000000..5a4a9d477 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/config/user.hpp @@ -0,0 +1,124 @@ +// boost/config/user.hpp ---------------------------------------------------// + +// (C) Copyright John Maddock 2001. +// Use, modification and distribution are subject to the +// Boost Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +// Do not check in modified versions of this file, +// This file may be customized by the end user, but not by boost. + +// +// Use this file to define a site and compiler specific +// configuration policy: +// + +// define this to locate a compiler config file: +// #define BOOST_COMPILER_CONFIG + +// define this to locate a stdlib config file: +// #define BOOST_STDLIB_CONFIG + +// define this to locate a platform config file: +// #define BOOST_PLATFORM_CONFIG + +// define this to disable compiler config, +// use if your compiler config has nothing to set: +// #define BOOST_NO_COMPILER_CONFIG + +// define this to disable stdlib config, +// use if your stdlib config has nothing to set: +// #define BOOST_NO_STDLIB_CONFIG + +// define this to disable platform config, +// use if your platform config has nothing to set: +// #define BOOST_NO_PLATFORM_CONFIG + +// define this to disable all config options, +// excluding the user config. Use if your +// setup is fully ISO compliant, and has no +// useful extensions, or for autoconf generated +// setups: +// #define BOOST_NO_CONFIG + +// define this to make the config "optimistic" +// about unknown compiler versions. Normally +// unknown compiler versions are assumed to have +// all the defects of the last known version, however +// setting this flag, causes the config to assume +// that unknown compiler versions are fully conformant +// with the standard: +// #define BOOST_STRICT_CONFIG + +// define this to cause the config to halt compilation +// with an #error if it encounters anything unknown -- +// either an unknown compiler version or an unknown +// compiler/platform/library: +// #define BOOST_ASSERT_CONFIG + + +// define if you want to disable threading support, even +// when available: +// #define BOOST_DISABLE_THREADS + +// define when you want to disable Win32 specific features +// even when available: +// #define BOOST_DISABLE_WIN32 + +// BOOST_DISABLE_ABI_HEADERS: Stops boost headers from including any +// prefix/suffix headers that normally control things like struct +// packing and alignment. +// #define BOOST_DISABLE_ABI_HEADERS + +// BOOST_ABI_PREFIX: A prefix header to include in place of whatever +// boost.config would normally select, any replacement should set up +// struct packing and alignment options as required. +// #define BOOST_ABI_PREFIX my-header-name + +// BOOST_ABI_SUFFIX: A suffix header to include in place of whatever +// boost.config would normally select, any replacement should undo +// the effects of the prefix header. +// #define BOOST_ABI_SUFFIX my-header-name + +// BOOST_ALL_DYN_LINK: Forces all libraries that have separate source, +// to be linked as dll's rather than static libraries on Microsoft Windows +// (this macro is used to turn on __declspec(dllimport) modifiers, so that +// the compiler knows which symbols to look for in a dll rather than in a +// static library). Note that there may be some libraries that can only +// be statically linked (Boost.Test for example) and others which may only +// be dynamically linked (Boost.Threads for example), in these cases this +// macro has no effect. +// #define BOOST_ALL_DYN_LINK + +// BOOST_WHATEVER_DYN_LINK: Forces library "whatever" to be linked as a dll +// rather than a static library on Microsoft Windows: replace the WHATEVER +// part of the macro name with the name of the library that you want to +// dynamically link to, for example use BOOST_DATE_TIME_DYN_LINK or +// BOOST_REGEX_DYN_LINK etc (this macro is used to turn on __declspec(dllimport) +// modifiers, so that the compiler knows which symbols to look for in a dll +// rather than in a static library). +// Note that there may be some libraries that can only be statically linked +// (Boost.Test for example) and others which may only be dynamically linked +// (Boost.Threads for example), in these cases this macro is unsupported. +// #define BOOST_WHATEVER_DYN_LINK + +// BOOST_ALL_NO_LIB: Tells the config system not to automatically select +// which libraries to link against. +// Normally if a compiler supports #pragma lib, then the correct library +// build variant will be automatically selected and linked against, +// simply by the act of including one of that library's headers. +// This macro turns that feature off. +// #define BOOST_ALL_NO_LIB + +// BOOST_WHATEVER_NO_LIB: Tells the config system not to automatically +// select which library to link against for library "whatever", +// replace WHATEVER in the macro name with the name of the library; +// for example BOOST_DATE_TIME_NO_LIB or BOOST_REGEX_NO_LIB. +// Normally if a compiler supports #pragma lib, then the correct library +// build variant will be automatically selected and linked against, simply +// by the act of including one of that library's headers. This macro turns +// that feature off. +// #define BOOST_WHATEVER_NO_LIB + + + diff --git a/trunk/paradiseo-eo/contrib/boost/limits.hpp b/trunk/paradiseo-eo/contrib/boost/limits.hpp new file mode 100644 index 000000000..f468dbce7 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/limits.hpp @@ -0,0 +1,143 @@ + +// (C) Copyright John maddock 1999. +// (C) David Abrahams 2002. Distributed under the Boost +// Software License, Version 1.0. (See accompanying file +// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +// +// use this header as a workaround for missing + +// See http://www.boost.org/libs/utility/limits.html for documentation. + +#ifndef BOOST_LIMITS +#define BOOST_LIMITS + +#include + +#ifdef BOOST_NO_LIMITS +# include +#else +# include +#endif + +#if (defined(BOOST_HAS_LONG_LONG) && defined(BOOST_NO_LONG_LONG_NUMERIC_LIMITS)) \ + || (defined(BOOST_HAS_MS_INT64) && defined(BOOST_NO_MS_INT64_NUMERIC_LIMITS)) +// Add missing specializations for numeric_limits: +#ifdef BOOST_HAS_MS_INT64 +# define BOOST_LLT __int64 +# define BOOST_ULLT unsigned __int64 +#else +# define BOOST_LLT ::boost::long_long_type +# define BOOST_ULLT ::boost::ulong_long_type +#endif + +namespace std +{ + template<> + class numeric_limits + { + public: + + BOOST_STATIC_CONSTANT(bool, is_specialized = true); +#ifdef BOOST_HAS_MS_INT64 + static BOOST_LLT min BOOST_PREVENT_MACRO_SUBSTITUTION (){ return 0x8000000000000000i64; } + static BOOST_LLT max BOOST_PREVENT_MACRO_SUBSTITUTION (){ return 0x7FFFFFFFFFFFFFFFi64; } +#elif defined(LLONG_MAX) + static BOOST_LLT min BOOST_PREVENT_MACRO_SUBSTITUTION (){ return LLONG_MIN; } + static BOOST_LLT max BOOST_PREVENT_MACRO_SUBSTITUTION (){ return LLONG_MAX; } +#elif defined(LONGLONG_MAX) + static BOOST_LLT min BOOST_PREVENT_MACRO_SUBSTITUTION (){ return LONGLONG_MIN; } + static BOOST_LLT max BOOST_PREVENT_MACRO_SUBSTITUTION (){ return LONGLONG_MAX; } +#else + static BOOST_LLT min BOOST_PREVENT_MACRO_SUBSTITUTION (){ return 1LL << (sizeof(BOOST_LLT) * CHAR_BIT - 1); } + static BOOST_LLT max BOOST_PREVENT_MACRO_SUBSTITUTION (){ return ~(min)(); } +#endif + BOOST_STATIC_CONSTANT(int, digits = sizeof(BOOST_LLT) * CHAR_BIT -1); + BOOST_STATIC_CONSTANT(int, digits10 = (CHAR_BIT * sizeof (BOOST_LLT) - 1) * 301L / 1000); + BOOST_STATIC_CONSTANT(bool, is_signed = true); + BOOST_STATIC_CONSTANT(bool, is_integer = true); + BOOST_STATIC_CONSTANT(bool, is_exact = true); + BOOST_STATIC_CONSTANT(int, radix = 2); + static BOOST_LLT epsilon() throw() { return 0; }; + static BOOST_LLT round_error() throw() { return 0; }; + + BOOST_STATIC_CONSTANT(int, min_exponent = 0); + BOOST_STATIC_CONSTANT(int, min_exponent10 = 0); + BOOST_STATIC_CONSTANT(int, max_exponent = 0); + BOOST_STATIC_CONSTANT(int, max_exponent10 = 0); + + BOOST_STATIC_CONSTANT(bool, has_infinity = false); + BOOST_STATIC_CONSTANT(bool, has_quiet_NaN = false); + BOOST_STATIC_CONSTANT(bool, has_signaling_NaN = false); + BOOST_STATIC_CONSTANT(bool, has_denorm = false); + BOOST_STATIC_CONSTANT(bool, has_denorm_loss = false); + static BOOST_LLT infinity() throw() { return 0; }; + static BOOST_LLT quiet_NaN() throw() { return 0; }; + static BOOST_LLT signaling_NaN() throw() { return 0; }; + static BOOST_LLT denorm_min() throw() { return 0; }; + + BOOST_STATIC_CONSTANT(bool, is_iec559 = false); + BOOST_STATIC_CONSTANT(bool, is_bounded = false); + BOOST_STATIC_CONSTANT(bool, is_modulo = false); + + BOOST_STATIC_CONSTANT(bool, traps = false); + BOOST_STATIC_CONSTANT(bool, tinyness_before = false); + BOOST_STATIC_CONSTANT(float_round_style, round_style = round_toward_zero); + + }; + + template<> + class numeric_limits + { + public: + + BOOST_STATIC_CONSTANT(bool, is_specialized = true); +#ifdef BOOST_HAS_MS_INT64 + static BOOST_ULLT min BOOST_PREVENT_MACRO_SUBSTITUTION (){ return 0ui64; } + static BOOST_ULLT max BOOST_PREVENT_MACRO_SUBSTITUTION (){ return 0xFFFFFFFFFFFFFFFFui64; } +#elif defined(ULLONG_MAX) && defined(ULLONG_MIN) + static BOOST_ULLT min BOOST_PREVENT_MACRO_SUBSTITUTION (){ return ULLONG_MIN; } + static BOOST_ULLT max BOOST_PREVENT_MACRO_SUBSTITUTION (){ return ULLONG_MAX; } +#elif defined(ULONGLONG_MAX) && defined(ULONGLONG_MIN) + static BOOST_ULLT min BOOST_PREVENT_MACRO_SUBSTITUTION (){ return ULONGLONG_MIN; } + static BOOST_ULLT max BOOST_PREVENT_MACRO_SUBSTITUTION (){ return ULONGLONG_MAX; } +#else + static BOOST_ULLT min BOOST_PREVENT_MACRO_SUBSTITUTION (){ return 0uLL; } + static BOOST_ULLT max BOOST_PREVENT_MACRO_SUBSTITUTION (){ return ~0uLL; } +#endif + BOOST_STATIC_CONSTANT(int, digits = sizeof(BOOST_LLT) * CHAR_BIT); + BOOST_STATIC_CONSTANT(int, digits10 = (CHAR_BIT * sizeof (BOOST_LLT)) * 301L / 1000); + BOOST_STATIC_CONSTANT(bool, is_signed = false); + BOOST_STATIC_CONSTANT(bool, is_integer = true); + BOOST_STATIC_CONSTANT(bool, is_exact = true); + BOOST_STATIC_CONSTANT(int, radix = 2); + static BOOST_ULLT epsilon() throw() { return 0; }; + static BOOST_ULLT round_error() throw() { return 0; }; + + BOOST_STATIC_CONSTANT(int, min_exponent = 0); + BOOST_STATIC_CONSTANT(int, min_exponent10 = 0); + BOOST_STATIC_CONSTANT(int, max_exponent = 0); + BOOST_STATIC_CONSTANT(int, max_exponent10 = 0); + + BOOST_STATIC_CONSTANT(bool, has_infinity = false); + BOOST_STATIC_CONSTANT(bool, has_quiet_NaN = false); + BOOST_STATIC_CONSTANT(bool, has_signaling_NaN = false); + BOOST_STATIC_CONSTANT(bool, has_denorm = false); + BOOST_STATIC_CONSTANT(bool, has_denorm_loss = false); + static BOOST_ULLT infinity() throw() { return 0; }; + static BOOST_ULLT quiet_NaN() throw() { return 0; }; + static BOOST_ULLT signaling_NaN() throw() { return 0; }; + static BOOST_ULLT denorm_min() throw() { return 0; }; + + BOOST_STATIC_CONSTANT(bool, is_iec559 = false); + BOOST_STATIC_CONSTANT(bool, is_bounded = false); + BOOST_STATIC_CONSTANT(bool, is_modulo = false); + + BOOST_STATIC_CONSTANT(bool, traps = false); + BOOST_STATIC_CONSTANT(bool, tinyness_before = false); + BOOST_STATIC_CONSTANT(float_round_style, round_style = round_toward_zero); + + }; +} +#endif + +#endif diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/CVS/Entries b/trunk/paradiseo-eo/contrib/boost/numeric/CVS/Entries new file mode 100644 index 000000000..dc52fccd1 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/CVS/Entries @@ -0,0 +1,2 @@ +/interval.hpp/1.1/Thu Oct 6 12:13:52 2005// +D diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/CVS/Entries.Log b/trunk/paradiseo-eo/contrib/boost/numeric/CVS/Entries.Log new file mode 100644 index 000000000..6c4ec9dda --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/CVS/Entries.Log @@ -0,0 +1 @@ +A D/interval//// diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/CVS/Repository b/trunk/paradiseo-eo/contrib/boost/numeric/CVS/Repository new file mode 100644 index 000000000..03c46be7c --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/CVS/Repository @@ -0,0 +1 @@ +eo/contrib/boost/numeric diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/CVS/Root b/trunk/paradiseo-eo/contrib/boost/numeric/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval.hpp new file mode 100644 index 000000000..e6f976df0 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval.hpp @@ -0,0 +1,32 @@ +/* Boost interval.hpp header file + * + * Copyright 2000 Jens Maurer + * Copyright 2002 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_HPP +#define BOOST_NUMERIC_INTERVAL_HPP + +#include +#include +#include + +#include +#include +#include +#include + +#include +#include +#include + +#include +#include +#include +#include + +#endif // BOOST_NUMERIC_INTERVAL_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/CVS/Entries b/trunk/paradiseo-eo/contrib/boost/numeric/interval/CVS/Entries new file mode 100644 index 000000000..321839ecf --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/CVS/Entries @@ -0,0 +1,17 @@ +/arith.hpp/1.1/Thu Oct 6 12:13:52 2005// +/arith2.hpp/1.1/Thu Oct 6 12:13:52 2005// +/arith3.hpp/1.1/Thu Oct 6 12:13:52 2005// +/checking.hpp/1.1/Thu Oct 6 12:13:52 2005// +/compare.hpp/1.1/Thu Oct 6 12:13:52 2005// +/constants.hpp/1.1/Thu Oct 6 12:13:52 2005// +/hw_rounding.hpp/1.1/Thu Oct 6 12:13:52 2005// +/interval.hpp/1.1/Thu Oct 6 12:13:52 2005// +/io.hpp/1.1/Thu Oct 6 12:13:52 2005// +/limits.hpp/1.1/Thu Oct 6 12:13:52 2005// +/policies.hpp/1.1/Thu Oct 6 12:13:52 2005// +/rounded_arith.hpp/1.1/Thu Oct 6 12:13:52 2005// +/rounded_transc.hpp/1.1/Thu Oct 6 12:13:52 2005// +/rounding.hpp/1.1/Thu Oct 6 12:13:52 2005// +/transc.hpp/1.1/Thu Oct 6 12:13:52 2005// +/utility.hpp/1.1/Thu Oct 6 12:13:52 2005// +D diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/CVS/Entries.Log b/trunk/paradiseo-eo/contrib/boost/numeric/interval/CVS/Entries.Log new file mode 100644 index 000000000..ed1afc48d --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/CVS/Entries.Log @@ -0,0 +1,3 @@ +A D/compare//// +A D/detail//// +A D/ext//// diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/CVS/Repository b/trunk/paradiseo-eo/contrib/boost/numeric/interval/CVS/Repository new file mode 100644 index 000000000..6841d56cd --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/CVS/Repository @@ -0,0 +1 @@ +eo/contrib/boost/numeric/interval diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/CVS/Root b/trunk/paradiseo-eo/contrib/boost/numeric/interval/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/arith.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/arith.hpp new file mode 100644 index 000000000..64a8e97ee --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/arith.hpp @@ -0,0 +1,305 @@ +/* Boost interval/arith.hpp template implementation file + * + * Copyright 2000 Jens Maurer + * Copyright 2002-2003 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_ARITH_HPP +#define BOOST_NUMERIC_INTERVAL_ARITH_HPP + +#include +#include +#include +#include +#include +#include + +namespace boost { +namespace numeric { + +/* + * Basic arithmetic operators + */ + +template inline +const interval& operator+(const interval& x) +{ + return x; +} + +template inline +interval operator-(const interval& x) +{ + if (interval_lib::detail::test_input(x)) + return interval::empty(); + return interval(-x.upper(), -x.lower(), true); +} + +template inline +interval& interval::operator+=(const interval& r) +{ + if (interval_lib::detail::test_input(*this, r)) + set_empty(); + else { + typename Policies::rounding rnd; + set(rnd.add_down(low, r.low), rnd.add_up(up, r.up)); + } + return *this; +} + +template inline +interval& interval::operator+=(const T& r) +{ + if (interval_lib::detail::test_input(*this, r)) + set_empty(); + else { + typename Policies::rounding rnd; + set(rnd.add_down(low, r), rnd.add_up(up, r)); + } + return *this; +} + +template inline +interval& interval::operator-=(const interval& r) +{ + if (interval_lib::detail::test_input(*this, r)) + set_empty(); + else { + typename Policies::rounding rnd; + set(rnd.sub_down(low, r.up), rnd.sub_up(up, r.low)); + } + return *this; +} + +template inline +interval& interval::operator-=(const T& r) +{ + if (interval_lib::detail::test_input(*this, r)) + set_empty(); + else { + typename Policies::rounding rnd; + set(rnd.sub_down(low, r), rnd.sub_up(up, r)); + } + return *this; +} + +template inline +interval& interval::operator*=(const interval& r) +{ + return *this = *this * r; +} + +template inline +interval& interval::operator*=(const T& r) +{ + return *this = r * *this; +} + +template inline +interval& interval::operator/=(const interval& r) +{ + return *this = *this / r; +} + +template inline +interval& interval::operator/=(const T& r) +{ + return *this = *this / r; +} + +template inline +interval operator+(const interval& x, + const interval& y) +{ + if (interval_lib::detail::test_input(x, y)) + return interval::empty(); + typename Policies::rounding rnd; + return interval(rnd.add_down(x.lower(), y.lower()), + rnd.add_up (x.upper(), y.upper()), true); +} + +template inline +interval operator+(const T& x, const interval& y) +{ + if (interval_lib::detail::test_input(x, y)) + return interval::empty(); + typename Policies::rounding rnd; + return interval(rnd.add_down(x, y.lower()), + rnd.add_up (x, y.upper()), true); +} + +template inline +interval operator+(const interval& x, const T& y) +{ return y + x; } + +template inline +interval operator-(const interval& x, + const interval& y) +{ + if (interval_lib::detail::test_input(x, y)) + return interval::empty(); + typename Policies::rounding rnd; + return interval(rnd.sub_down(x.lower(), y.upper()), + rnd.sub_up (x.upper(), y.lower()), true); +} + +template inline +interval operator-(const T& x, const interval& y) +{ + if (interval_lib::detail::test_input(x, y)) + return interval::empty(); + typename Policies::rounding rnd; + return interval(rnd.sub_down(x, y.upper()), + rnd.sub_up (x, y.lower()), true); +} + +template inline +interval operator-(const interval& x, const T& y) +{ + if (interval_lib::detail::test_input(x, y)) + return interval::empty(); + typename Policies::rounding rnd; + return interval(rnd.sub_down(x.lower(), y), + rnd.sub_up (x.upper(), y), true); +} + +template inline +interval operator*(const interval& x, + const interval& y) +{ + BOOST_USING_STD_MIN(); + BOOST_USING_STD_MAX(); + typedef interval I; + if (interval_lib::detail::test_input(x, y)) + return I::empty(); + typename Policies::rounding rnd; + const T& xl = x.lower(); + const T& xu = x.upper(); + const T& yl = y.lower(); + const T& yu = y.upper(); + + if (interval_lib::user::is_neg(xl)) + if (interval_lib::user::is_pos(xu)) + if (interval_lib::user::is_neg(yl)) + if (interval_lib::user::is_pos(yu)) // M * M + return I(min BOOST_PREVENT_MACRO_SUBSTITUTION(rnd.mul_down(xl, yu), rnd.mul_down(xu, yl)), + max BOOST_PREVENT_MACRO_SUBSTITUTION(rnd.mul_up (xl, yl), rnd.mul_up (xu, yu)), true); + else // M * N + return I(rnd.mul_down(xu, yl), rnd.mul_up(xl, yl), true); + else + if (interval_lib::user::is_pos(yu)) // M * P + return I(rnd.mul_down(xl, yu), rnd.mul_up(xu, yu), true); + else // M * Z + return I(static_cast(0), static_cast(0), true); + else + if (interval_lib::user::is_neg(yl)) + if (interval_lib::user::is_pos(yu)) // N * M + return I(rnd.mul_down(xl, yu), rnd.mul_up(xl, yl), true); + else // N * N + return I(rnd.mul_down(xu, yu), rnd.mul_up(xl, yl), true); + else + if (interval_lib::user::is_pos(yu)) // N * P + return I(rnd.mul_down(xl, yu), rnd.mul_up(xu, yl), true); + else // N * Z + return I(static_cast(0), static_cast(0), true); + else + if (interval_lib::user::is_pos(xu)) + if (interval_lib::user::is_neg(yl)) + if (interval_lib::user::is_pos(yu)) // P * M + return I(rnd.mul_down(xu, yl), rnd.mul_up(xu, yu), true); + else // P * N + return I(rnd.mul_down(xu, yl), rnd.mul_up(xl, yu), true); + else + if (interval_lib::user::is_pos(yu)) // P * P + return I(rnd.mul_down(xl, yl), rnd.mul_up(xu, yu), true); + else // P * Z + return I(static_cast(0), static_cast(0), true); + else // Z * ? + return I(static_cast(0), static_cast(0), true); +} + +template inline +interval operator*(const T& x, const interval& y) +{ + typedef interval I; + if (interval_lib::detail::test_input(x, y)) + return I::empty(); + typename Policies::rounding rnd; + const T& yl = y.lower(); + const T& yu = y.upper(); + // x is supposed not to be infinite + if (interval_lib::user::is_neg(x)) + return I(rnd.mul_down(x, yu), rnd.mul_up(x, yl), true); + else if (interval_lib::user::is_zero(x)) + return I(static_cast(0), static_cast(0), true); + else + return I(rnd.mul_down(x, yl), rnd.mul_up(x, yu), true); +} + +template inline +interval operator*(const interval& x, const T& y) +{ return y * x; } + +template inline +interval operator/(const interval& x, + const interval& y) +{ + if (interval_lib::detail::test_input(x, y)) + return interval::empty(); + if (in_zero(y)) + if (!interval_lib::user::is_zero(y.lower())) + if (!interval_lib::user::is_zero(y.upper())) + return interval_lib::detail::div_zero(x); + else + return interval_lib::detail::div_negative(x, y.lower()); + else + if (!interval_lib::user::is_zero(y.upper())) + return interval_lib::detail::div_positive(x, y.upper()); + else + return interval::empty(); + else + return interval_lib::detail::div_non_zero(x, y); +} + +template inline +interval operator/(const T& x, const interval& y) +{ + if (interval_lib::detail::test_input(x, y)) + return interval::empty(); + if (in_zero(y)) + if (!interval_lib::user::is_zero(y.lower())) + if (!interval_lib::user::is_zero(y.upper())) + return interval_lib::detail::div_zero(x); + else + return interval_lib::detail::div_negative(x, y.lower()); + else + if (!interval_lib::user::is_zero(y.upper())) + return interval_lib::detail::div_positive(x, y.upper()); + else + return interval::empty(); + else + return interval_lib::detail::div_non_zero(x, y); +} + +template inline +interval operator/(const interval& x, const T& y) +{ + if (interval_lib::detail::test_input(x, y) || interval_lib::user::is_zero(y)) + return interval::empty(); + typename Policies::rounding rnd; + const T& xl = x.lower(); + const T& xu = x.upper(); + if (interval_lib::user::is_neg(y)) + return interval(rnd.div_down(xu, y), rnd.div_up(xl, y), true); + else + return interval(rnd.div_down(xl, y), rnd.div_up(xu, y), true); +} + +} // namespace numeric +} // namespace boost + +#endif // BOOST_NUMERIC_INTERVAL_ARITH_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/arith2.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/arith2.hpp new file mode 100644 index 000000000..274a68119 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/arith2.hpp @@ -0,0 +1,212 @@ +/* Boost interval/arith2.hpp template implementation file + * + * This header provides some auxiliary arithmetic + * functions: fmod, sqrt, square, pov, inverse and + * a multi-interval division. + * + * Copyright 2002-2003 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_ARITH2_HPP +#define BOOST_NUMERIC_INTERVAL_ARITH2_HPP + +#include +#include +#include +#include +#include +#include +#include +#include +#include + +namespace boost { +namespace numeric { + +template inline +interval fmod(const interval& x, + const interval& y) +{ + if (interval_lib::detail::test_input(x, y)) + return interval::empty(); + typename Policies::rounding rnd; + typedef typename interval_lib::unprotect >::type I; + T const &yb = interval_lib::user::is_neg(x.lower()) ? y.lower() : y.upper(); + T n = rnd.int_down(rnd.div_down(x.lower(), yb)); + return (const I&)x - n * (const I&)y; +} + +template inline +interval fmod(const interval& x, const T& y) +{ + if (interval_lib::detail::test_input(x, y)) + return interval::empty(); + typename Policies::rounding rnd; + typedef typename interval_lib::unprotect >::type I; + T n = rnd.int_down(rnd.div_down(x.lower(), y)); + return (const I&)x - n * I(y); +} + +template inline +interval fmod(const T& x, const interval& y) +{ + if (interval_lib::detail::test_input(x, y)) + return interval::empty(); + typename Policies::rounding rnd; + typedef typename interval_lib::unprotect >::type I; + T const &yb = interval_lib::user::is_neg(x) ? y.lower() : y.upper(); + T n = rnd.int_down(rnd.div_down(x, yb)); + return x - n * (const I&)y; +} + +namespace interval_lib { + +template inline +interval division_part1(const interval& x, + const interval& y, bool& b) +{ + typedef interval I; + b = false; + if (detail::test_input(x, y)) + return I::empty(); + if (in_zero(y)) + if (!user::is_zero(y.lower())) + if (!user::is_zero(y.upper())) + return detail::div_zero_part1(x, y, b); + else + return detail::div_negative(x, y.lower()); + else + if (!user::is_zero(y.upper())) + return detail::div_positive(x, y.upper()); + else + return I::empty(); + else + return detail::div_non_zero(x, y); +} + +template inline +interval division_part2(const interval& x, + const interval& y, bool b = true) +{ + if (!b) return interval::empty(); + return detail::div_zero_part2(x, y); +} + +template inline +interval multiplicative_inverse(const interval& x) +{ + typedef interval I; + if (detail::test_input(x)) + return I::empty(); + T one = static_cast(1); + typename Policies::rounding rnd; + if (in_zero(x)) { + typedef typename Policies::checking checking; + if (!user::is_zero(x.lower())) + if (!user::is_zero(x.upper())) + return I::whole(); + else + return I(checking::neg_inf(), rnd.div_up(one, x.lower()), true); + else + if (!user::is_zero(x.upper())) + return I(rnd.div_down(one, x.upper()), checking::pos_inf(), true); + else + return I::empty(); + } else + return I(rnd.div_down(one, x.upper()), rnd.div_up(one, x.lower()), true); +} + +namespace detail { + +template inline +T pow_aux(const T& x_, int pwr, Rounding& rnd) // x and pwr are positive +{ + T x = x_; + T y = (pwr & 1) ? x_ : static_cast(1); + pwr >>= 1; + while (pwr > 0) { + x = rnd.mul_up(x, x); + if (pwr & 1) y = rnd.mul_up(x, y); + pwr >>= 1; + } + return y; +} + +} // namespace detail +} // namespace interval_lib + +template inline +interval pow(const interval& x, int pwr) +{ + BOOST_USING_STD_MAX(); + using interval_lib::detail::pow_aux; + typedef interval I; + + if (interval_lib::detail::test_input(x)) + return I::empty(); + + if (pwr == 0) + if (interval_lib::user::is_zero(x.lower()) + && interval_lib::user::is_zero(x.upper())) + return I::empty(); + else + return I(static_cast(1)); + else if (pwr < 0) + return interval_lib::multiplicative_inverse(pow(x, -pwr)); + + typename Policies::rounding rnd; + + if (interval_lib::user::is_neg(x.upper())) { // [-2,-1] + T yl = pow_aux(-x.upper(), pwr, rnd); + T yu = pow_aux(-x.lower(), pwr, rnd); + if (pwr & 1) // [-2,-1]^1 + return I(-yu, -yl, true); + else // [-2,-1]^2 + return I(yl, yu, true); + } else if (interval_lib::user::is_neg(x.lower())) { // [-1,1] + if (pwr & 1) { // [-1,1]^1 + return I(-pow_aux(-x.lower(), pwr, rnd), pow_aux(x.upper(), pwr, rnd), true); + } else { // [-1,1]^2 + return I(static_cast(0), pow_aux(max BOOST_PREVENT_MACRO_SUBSTITUTION(-x.lower(), x.upper()), pwr, rnd), true); + } + } else { // [1,2] + return I(pow_aux(x.lower(), pwr, rnd), pow_aux(x.upper(), pwr, rnd), true); + } +} + +template inline +interval sqrt(const interval& x) +{ + typedef interval I; + if (interval_lib::detail::test_input(x) || interval_lib::user::is_neg(x.upper())) + return I::empty(); + typename Policies::rounding rnd; + T l = !interval_lib::user::is_pos(x.lower()) ? static_cast(0) : rnd.sqrt_down(x.lower()); + return I(l, rnd.sqrt_up(x.upper()), true); +} + +template inline +interval square(const interval& x) +{ + typedef interval I; + if (interval_lib::detail::test_input(x)) + return I::empty(); + typename Policies::rounding rnd; + const T& xl = x.lower(); + const T& xu = x.upper(); + if (interval_lib::user::is_neg(xu)) + return I(rnd.mul_down(xu, xu), rnd.mul_up(xl, xl), true); + else if (interval_lib::user::is_pos(x.lower())) + return I(rnd.mul_down(xl, xl), rnd.mul_up(xu, xu), true); + else + return I(static_cast(0), (-xl > xu ? rnd.mul_up(xl, xl) : rnd.mul_up(xu, xu)), true); +} + +} // namespace numeric +} // namespace boost + +#endif // BOOST_NUMERIC_INTERVAL_ARITH2_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/arith3.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/arith3.hpp new file mode 100644 index 000000000..518e6182f --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/arith3.hpp @@ -0,0 +1,69 @@ +/* Boost interval/arith3.hpp template implementation file + * + * This headers provides arithmetical functions + * which compute an interval given some base + * numbers. The resulting interval encloses the + * real result of the arithmetic operation. + * + * Copyright 2003 Guillaume Melquiond + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_ARITH3_HPP +#define BOOST_NUMERIC_INTERVAL_ARITH3_HPP + +#include +#include + +namespace boost { +namespace numeric { +namespace interval_lib { + +template inline +I add(const typename I::base_type& x, const typename I::base_type& y) +{ + typedef typename I::traits_type Policies; + if (detail::test_input(x, y)) + return I::empty(); + typename Policies::rounding rnd; + return I(rnd.add_down(x, y), rnd.add_up(x, y), true); +} + +template inline +I sub(const typename I::base_type& x, const typename I::base_type& y) +{ + typedef typename I::traits_type Policies; + if (detail::test_input(x, y)) + return I::empty(); + typename Policies::rounding rnd; + return I(rnd.sub_down(x, y), rnd.sub_up(x, y), true); +} + +template inline +I mul(const typename I::base_type& x, const typename I::base_type& y) +{ + typedef typename I::traits_type Policies; + if (detail::test_input(x, y)) + return I::empty(); + typename Policies::rounding rnd; + return I(rnd.mul_down(x, y), rnd.mul_up(x, y), true); +} + +template inline +I div(const typename I::base_type& x, const typename I::base_type& y) +{ + typedef typename I::traits_type Policies; + if (detail::test_input(x, y) || user::is_zero(y)) + return I::empty(); + typename Policies::rounding rnd; + return I(rnd.div_down(x, y), rnd.div_up(x, y), true); +} + +} // namespace interval_lib +} // namespace numeric +} // namespace boost + +#endif // BOOST_NUMERIC_INTERVAL_ARITH3_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/checking.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/checking.hpp new file mode 100644 index 000000000..2db486a0b --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/checking.hpp @@ -0,0 +1,130 @@ +/* Boost interval/checking.hpp template implementation file + * + * Copyright 2002 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_CHECKING_HPP +#define BOOST_NUMERIC_INTERVAL_CHECKING_HPP + +#include +#include +#include +#include + +namespace boost { +namespace numeric { +namespace interval_lib { + +struct exception_create_empty +{ + void operator()() + { + throw std::runtime_error("boost::interval: empty interval created"); + } +}; + +struct exception_invalid_number +{ + void operator()() + { + throw std::invalid_argument("boost::interval: invalid number"); + } +}; + +template +struct checking_base +{ + static T pos_inf() + { + assert(std::numeric_limits::has_infinity); + return std::numeric_limits::infinity(); + } + static T neg_inf() + { + assert(std::numeric_limits::has_infinity); + return -std::numeric_limits::infinity(); + } + static T nan() + { + assert(std::numeric_limits::has_quiet_NaN); + return std::numeric_limits::quiet_NaN(); + } + static bool is_nan(const T& x) + { + return std::numeric_limits::has_quiet_NaN && (x != x); + } + static T empty_lower() + { + return (std::numeric_limits::has_quiet_NaN ? + std::numeric_limits::quiet_NaN() : static_cast(1)); + } + static T empty_upper() + { + return (std::numeric_limits::has_quiet_NaN ? + std::numeric_limits::quiet_NaN() : static_cast(0)); + } + static bool is_empty(const T& l, const T& u) + { + return !(l <= u); // safety for partial orders + } +}; + +template, + class Exception = exception_create_empty> +struct checking_no_empty: Checking +{ + static T nan() + { + assert(false); + return Checking::nan(); + } + static T empty_lower() + { + Exception()(); + return Checking::empty_lower(); + } + static T empty_upper() + { + Exception()(); + return Checking::empty_upper(); + } + static bool is_empty(const T&, const T&) + { + return false; + } +}; + +template > +struct checking_no_nan: Checking +{ + static bool is_nan(const T&) + { + return false; + } +}; + +template, + class Exception = exception_invalid_number> +struct checking_catch_nan: Checking +{ + static bool is_nan(const T& x) + { + if (Checking::is_nan(x)) Exception()(); + return false; + } +}; + +template +struct checking_strict: + checking_no_nan > +{}; + +} // namespace interval_lib +} // namespace numeric +} // namespace boost + +#endif // BOOST_NUMERIC_INTERVAL_CHECKING_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare.hpp new file mode 100644 index 000000000..f21753e71 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare.hpp @@ -0,0 +1,19 @@ +/* Boost interval/compare.hpp template implementation file + * + * Copyright 2002 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_COMPARE_HPP +#define BOOST_NUMERIC_INTERVAL_COMPARE_HPP + +#include +#include +#include +#include +#include + +#endif // BOOST_NUMERIC_INTERVAL_COMPARE_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/CVS/Entries b/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/CVS/Entries new file mode 100644 index 000000000..9c39a8c8d --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/CVS/Entries @@ -0,0 +1,7 @@ +/certain.hpp/1.1/Thu Oct 6 12:13:52 2005// +/explicit.hpp/1.1/Thu Oct 6 12:13:52 2005// +/lexicographic.hpp/1.1/Thu Oct 6 12:13:52 2005// +/possible.hpp/1.1/Thu Oct 6 12:13:52 2005// +/set.hpp/1.1/Thu Oct 6 12:13:52 2005// +/tribool.hpp/1.1/Thu Oct 6 12:13:52 2005// +D diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/CVS/Repository b/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/CVS/Repository new file mode 100644 index 000000000..f9bef5f70 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/CVS/Repository @@ -0,0 +1 @@ +eo/contrib/boost/numeric/interval/compare diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/CVS/Root b/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/certain.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/certain.hpp new file mode 100644 index 000000000..9232d5cd8 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/certain.hpp @@ -0,0 +1,113 @@ +/* Boost interval/compare/certain.hpp template implementation file + * + * Copyright 2003 Guillaume Melquiond + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_COMPARE_CERTAIN_HPP +#define BOOST_NUMERIC_INTERVAL_COMPARE_CERTAIN_HPP + +#include +#include + +namespace boost { +namespace numeric { +namespace interval_lib { +namespace compare { +namespace certain { + +template inline +bool operator<(const interval& x, const interval& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.upper() < y.lower(); +} + +template inline +bool operator<(const interval& x, const T& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.upper() < y; +} + +template inline +bool operator<=(const interval& x, const interval& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.upper() <= y.lower(); +} + +template inline +bool operator<=(const interval& x, const T& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.upper() <= y; +} + +template inline +bool operator>(const interval& x, const interval& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.lower() > y.upper(); +} + +template inline +bool operator>(const interval& x, const T& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.lower() > y; +} + +template inline +bool operator>=(const interval& x, const interval& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.lower() >= y.upper(); +} + +template inline +bool operator>=(const interval& x, const T& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.lower() >= y; +} + +template inline +bool operator==(const interval& x, const interval& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.upper() == y.lower() && x.lower() == y.upper(); +} + +template inline +bool operator==(const interval& x, const T& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.upper() == y && x.lower() == y; +} + +template inline +bool operator!=(const interval& x, const interval& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.upper() < y.lower() || x.lower() > y.upper(); +} + +template inline +bool operator!=(const interval& x, const T& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.upper() < y || x.lower() > y; +} + +} // namespace certain +} // namespace compare +} // namespace interval_lib +} // namespace numeric +} // namespace boost + + +#endif // BOOST_NUMERIC_INTERVAL_COMPARE_CERTAIN_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/explicit.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/explicit.hpp new file mode 100644 index 000000000..8c68be891 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/explicit.hpp @@ -0,0 +1,248 @@ +/* Boost interval/compare/explicit.hpp template implementation file + * + * Copyright 2000 Jens Maurer + * Copyright 2002 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_COMPARE_EXPLICIT_HPP +#define BOOST_NUMERIC_INTERVAL_COMPARE_EXPLICIT_HPP + +#include + +namespace boost { +namespace numeric { +namespace interval_lib { + +/* + * Certainly... operations + */ + +template inline +bool cerlt(const interval& x, const interval& y) +{ + return x.upper() < y.lower(); +} + +template inline +bool cerlt(const interval& x, const T& y) +{ + return x.upper() < y; +} + +template inline +bool cerlt(const T& x, const interval& y) +{ + return x < y.lower(); +} + +template inline +bool cerle(const interval& x, const interval& y) +{ + return x.upper() <= y.lower(); +} + +template inline +bool cerle(const interval& x, const T& y) +{ + return x.upper() <= y; +} + +template inline +bool cerle(const T& x, const interval& y) +{ + return x <= y.lower(); +} + +template inline +bool cergt(const interval& x, const interval& y) +{ + return x.lower() > y.upper(); +} + +template inline +bool cergt(const interval& x, const T& y) +{ + return x.lower() > y; +} + +template inline +bool cergt(const T& x, const interval& y) +{ + return x > y.upper(); +} + +template inline +bool cerge(const interval& x, const interval& y) +{ + return x.lower() >= y.upper(); +} + +template inline +bool cerge(const interval& x, const T& y) +{ + return x.lower() >= y; +} + +template inline +bool cerge(const T& x, const interval& y) +{ + return x >= y.upper(); +} + +template inline +bool cereq(const interval& x, const interval& y) +{ + return x.lower() == y.upper() && y.lower() == x.upper(); +} + +template inline +bool cereq(const interval& x, const T& y) +{ + return x.lower() == y && x.upper() == y; +} + +template inline +bool cereq(const T& x, const interval& y) +{ + return x == y.lower() && x == y.upper(); +} + +template inline +bool cerne(const interval& x, const interval& y) +{ + return x.upper() < y.lower() || y.upper() < x.lower(); +} + +template inline +bool cerne(const interval& x, const T& y) +{ + return x.upper() < y || y < x.lower(); +} + +template inline +bool cerne(const T& x, const interval& y) +{ + return x < y.lower() || y.upper() < x; +} + +/* + * Possibly... comparisons + */ + +template inline +bool poslt(const interval& x, const interval& y) +{ + return x.lower() < y.upper(); +} + +template inline +bool poslt(const interval& x, const T& y) +{ + return x.lower() < y; +} + +template inline +bool poslt(const T& x, const interval& y) +{ + return x < y.upper(); +} + +template inline +bool posle(const interval& x, const interval& y) +{ + return x.lower() <= y.upper(); +} + +template inline +bool posle(const interval& x, const T& y) +{ + return x.lower() <= y; +} + +template inline +bool posle(const T& x, const interval& y) +{ + return x <= y.upper(); +} + +template inline +bool posgt(const interval& x, const interval& y) +{ + return x.upper() > y.lower(); +} + +template inline +bool posgt(const interval& x, const T& y) +{ + return x.upper() > y; +} + +template inline +bool posgt(const T& x, const interval & y) +{ + return x > y.lower(); +} + +template inline +bool posge(const interval& x, const interval& y) +{ + return x.upper() >= y.lower(); +} + +template inline +bool posge(const interval& x, const T& y) +{ + return x.upper() >= y; +} + +template inline +bool posge(const T& x, const interval& y) +{ + return x >= y.lower(); +} + +template inline +bool poseq(const interval& x, const interval& y) +{ + return x.upper() >= y.lower() && y.upper() >= x.lower(); +} + +template inline +bool poseq(const interval& x, const T& y) +{ + return x.upper() >= y && y >= x.lower(); +} + +template inline +bool poseq(const T& x, const interval& y) +{ + return x >= y.lower() && y.upper() >= x; +} + +template inline +bool posne(const interval& x, const interval& y) +{ + return x.upper() != y.lower() || y.upper() != x.lower(); +} + +template inline +bool posne(const interval& x, const T& y) +{ + return x.upper() != y || y != x.lower(); +} + +template inline +bool posne(const T& x, const interval& y) +{ + return x != y.lower() || y.upper() != x; +} + +} // namespace interval_lib +} // namespace numeric +} //namespace boost + +#endif // BOOST_NUMERIC_INTERVAL_COMPARE_EXPLICIT_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/lexicographic.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/lexicographic.hpp new file mode 100644 index 000000000..03f6036d2 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/lexicographic.hpp @@ -0,0 +1,122 @@ +/* Boost interval/compare/lexicographic.hpp template implementation file + * + * Copyright 2002-2003 Guillaume Melquiond + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_COMPARE_LEXICOGRAPHIC_HPP +#define BOOST_NUMERIC_INTERVAL_COMPARE_LEXICOGRAPHIC_HPP + +#include +#include + +namespace boost { +namespace numeric { +namespace interval_lib { +namespace compare { +namespace lexicographic { + +template inline +bool operator<(const interval& x, const interval& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + const T& xl = x.lower(); + const T& yl = y.lower(); + return xl < yl || (xl == yl && x.upper() < y.upper()); +} + +template inline +bool operator<(const interval& x, const T& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.lower() < y; +} + +template inline +bool operator<=(const interval& x, const interval& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + const T& xl = x.lower(); + const T& yl = y.lower(); + return xl < yl || (xl == yl && x.upper() <= y.upper()); +} + +template inline +bool operator<=(const interval& x, const T& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + const T& xl = x.lower(); + return xl < y || (xl == y && x.upper() <= y); +} + +template inline +bool operator>(const interval& x, const interval& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + const T& xl = x.lower(); + const T& yl = y.lower(); + return xl > yl || (xl == yl && x.upper() > y.upper()); +} + +template inline +bool operator>(const interval& x, const T& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + const T& xl = x.lower(); + return xl > y || (xl == y && x.upper() > y); +} + +template inline +bool operator>=(const interval& x, const interval& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + const T& xl = x.lower(); + const T& yl = y.lower(); + return xl > yl || (xl == yl && x.upper() >= y.upper()); +} + +template inline +bool operator>=(const interval& x, const T& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.lower() >= y; +} + +template inline +bool operator==(const interval& x, const interval& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.lower() == y.lower() && x.upper() == y.upper(); +} + +template inline +bool operator==(const interval& x, const T& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.lower() == y && x.upper() == y; +} + +template inline +bool operator!=(const interval& x, const interval& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.lower() != y.lower() || x.upper() != y.upper(); +} + +template inline +bool operator!=(const interval& x, const T& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.lower() != y || x.upper() != y; +} + +} // namespace lexicographic +} // namespace compare +} // namespace interval_lib +} // namespace numeric +} // namespace boost + +#endif // BOOST_NUMERIC_INTERVAL_COMPARE_LEXICOGRAPHIC_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/possible.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/possible.hpp new file mode 100644 index 000000000..59bec31b9 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/possible.hpp @@ -0,0 +1,113 @@ +/* Boost interval/compare/possible.hpp template implementation file + * + * Copyright 2003 Guillaume Melquiond + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_COMPARE_POSSIBLE_HPP +#define BOOST_NUMERIC_INTERVAL_COMPARE_POSSIBLE_HPP + +#include +#include + +namespace boost { +namespace numeric { +namespace interval_lib { +namespace compare { +namespace possible { + +template inline +bool operator<(const interval& x, const interval& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.lower() < y.upper(); +} + +template inline +bool operator<(const interval& x, const T& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.lower() < y; +} + +template inline +bool operator<=(const interval& x, const interval& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.lower() <= y.upper(); +} + +template inline +bool operator<=(const interval& x, const T& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.lower() <= y; +} + +template inline +bool operator>(const interval& x, const interval& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.upper() > y.lower(); +} + +template inline +bool operator>(const interval& x, const T& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.upper() > y; +} + +template inline +bool operator>=(const interval& x, const interval& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.upper() >= y.lower(); +} + +template inline +bool operator>=(const interval& x, const T& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.upper() >= y; +} + +template inline +bool operator==(const interval& x, const interval& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.lower() <= y.upper() && x.upper() >= y.lower(); +} + +template inline +bool operator==(const interval& x, const T& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.lower() <= y && x.upper() >= y; +} + +template inline +bool operator!=(const interval& x, const interval& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.lower() != y.upper() || x.upper() != y.lower(); +} + +template inline +bool operator!=(const interval& x, const T& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + return x.lower() != y || x.upper() != y; +} + +} // namespace possible +} // namespace compare +} // namespace interval_lib +} // namespace numeric +} // namespace boost + + +#endif // BOOST_NUMERIC_INTERVAL_COMPARE_POSSIBLE_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/set.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/set.hpp new file mode 100644 index 000000000..aa4f1716b --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/set.hpp @@ -0,0 +1,101 @@ +/* Boost interval/compare/set.hpp template implementation file + * + * Copyright 2002-2003 Guillaume Melquiond + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_COMPARE_SET_HPP +#define BOOST_NUMERIC_INTERVAL_COMPARE_SET_HPP + +#include +#include +#include + +namespace boost { +namespace numeric { +namespace interval_lib { +namespace compare { +namespace set { + +template inline +bool operator<(const interval& x, const interval& y) +{ + return proper_subset(x, y); +} + +template inline +bool operator<(const interval& x, const T& y) +{ + throw comparison_error(); +} + +template inline +bool operator<=(const interval& x, const interval& y) +{ + return subset(x, y); +} + +template inline +bool operator<=(const interval& x, const T& y) +{ + throw comparison_error(); +} + +template inline +bool operator>(const interval& x, const interval& y) +{ + return proper_subset(y, x); +} + +template inline +bool operator>(const interval& x, const T& y) +{ + throw comparison_error(); +} + +template inline +bool operator>=(const interval& x, const interval& y) +{ + return subset(y, x); +} + +template inline +bool operator>=(const interval& x, const T& y) +{ + throw comparison_error(); +} + +template inline +bool operator==(const interval& x, const interval& y) +{ + return equal(y, x); +} + +template inline +bool operator==(const interval& x, const T& y) +{ + throw comparison_error(); +} + +template inline +bool operator!=(const interval& x, const interval& y) +{ + return !equal(y, x); +} + +template inline +bool operator!=(const interval& x, const T& y) +{ + throw comparison_error(); +} + +} // namespace set +} // namespace compare +} // namespace interval_lib +} // namespace numeric +} // namespace boost + +#endif // BOOST_NUMERIC_INTERVAL_COMPARE_SET_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/tribool.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/tribool.hpp new file mode 100644 index 000000000..6e4a83e27 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/compare/tribool.hpp @@ -0,0 +1,138 @@ +/* Boost interval/compare/tribool.hpp template implementation file + * + * Copyright 2002-2003 Guillaume Melquiond + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_COMPARE_TRIBOOL_HPP +#define BOOST_NUMERIC_INTERVAL_COMPARE_TRIBOOL_HPP + +#include +#include +#include + +namespace boost { +namespace numeric { +namespace interval_lib { +namespace compare { +namespace tribool { + +template inline +logic::tribool operator<(const interval& x, const interval& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + if (x.upper() < y.lower()) return true; + if (x.lower() >= y.upper()) return false; + return logic::indeterminate; +} + +template inline +logic::tribool operator<(const interval& x, const T& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + if (x.upper() < y) return true; + if (x.lower() >= y) return false; + return logic::indeterminate; +} + +template inline +logic::tribool operator<=(const interval& x, const interval& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + if (x.upper() <= y.lower()) return true; + if (x.lower() > y.upper()) return false; + return logic::indeterminate; +} + +template inline +logic::tribool operator<=(const interval& x, const T& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + if (x.upper() <= y) return true; + if (x.lower() > y) return false; + return logic::indeterminate; +} + +template inline +logic::tribool operator>(const interval& x, const interval& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + if (x.lower() > y.upper()) return true; + if (x.upper() <= y.lower()) return false; + return logic::indeterminate; +} + +template inline +logic::tribool operator>(const interval& x, const T& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + if (x.lower() > y) return true; + if (x.upper() <= y) return false; + return logic::indeterminate; +} + +template inline +logic::tribool operator>=(const interval& x, const interval& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + if (x.lower() >= y.upper()) return true; + if (x.upper() < y.lower()) return false; + return logic::indeterminate; +} + +template inline +logic::tribool operator>=(const interval& x, const T& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + if (x.lower() >= y) return true; + if (x.upper() < y) return false; + return logic::indeterminate; +} + +template inline +logic::tribool operator==(const interval& x, const interval& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + if (x.upper() == y.lower() && x.lower() == y.upper()) return true; + if (x.upper() < y.lower() || x.lower() > y.upper()) return false; + return logic::indeterminate; +} + +template inline +logic::tribool operator==(const interval& x, const T& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + if (x.upper() == y && x.lower() == y) return true; + if (x.upper() < y || x.lower() > y) return false; + return logic::indeterminate; +} + +template inline +logic::tribool operator!=(const interval& x, const interval& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + if (x.upper() < y.lower() || x.lower() > y.upper()) return true; + if (x.upper() == y.lower() && x.lower() == y.upper()) return false; + return logic::indeterminate; +} + +template inline +logic::tribool operator!=(const interval& x, const T& y) +{ + if (detail::test_input(x, y)) throw comparison_error(); + if (x.upper() < y || x.lower() > y) return true; + if (x.upper() == y && x.lower() == y) return false; + return logic::indeterminate; +} + +} // namespace tribool +} // namespace compare +} // namespace interval_lib +} // namespace numeric +} // namespace boost + + +#endif // BOOST_NUMERIC_INTERVAL_COMPARE_TRIBOOL_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/constants.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/constants.hpp new file mode 100644 index 000000000..a3a42efec --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/constants.hpp @@ -0,0 +1,85 @@ +/* Boost interval/constants.hpp template implementation file + * + * Copyright 2002 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_CONSTANTS_HPP +#define BOOST_NUMERIC_INTERVAL_CONSTANTS_HPP + +namespace boost { +namespace numeric { +namespace interval_lib { +namespace constants { + +// These constants should be exactly computed. +// Decimal representations wouldn't do it since the standard doesn't +// specify the rounding (even nearest) that should be used. + +static const float pi_f_l = 13176794.0f/(1<<22); +static const float pi_f_u = 13176795.0f/(1<<22); +static const double pi_d_l = (3373259426.0 + 273688.0 / (1<<21)) / (1<<30); +static const double pi_d_u = (3373259426.0 + 273689.0 / (1<<21)) / (1<<30); + +template inline T pi_lower() { return 3; } +template inline T pi_upper() { return 4; } +template inline T pi_half_lower() { return 1; } +template inline T pi_half_upper() { return 2; } +template inline T pi_twice_lower() { return 6; } +template inline T pi_twice_upper() { return 7; } + +template<> inline float pi_lower() { return pi_f_l; } +template<> inline float pi_upper() { return pi_f_u; } +template<> inline float pi_half_lower() { return pi_f_l / 2; } +template<> inline float pi_half_upper() { return pi_f_u / 2; } +template<> inline float pi_twice_lower() { return pi_f_l * 2; } +template<> inline float pi_twice_upper() { return pi_f_u * 2; } + +template<> inline double pi_lower() { return pi_d_l; } +template<> inline double pi_upper() { return pi_d_u; } +template<> inline double pi_half_lower() { return pi_d_l / 2; } +template<> inline double pi_half_upper() { return pi_d_u / 2; } +template<> inline double pi_twice_lower() { return pi_d_l * 2; } +template<> inline double pi_twice_upper() { return pi_d_u * 2; } + +template<> inline long double pi_lower() { return pi_d_l; } +template<> inline long double pi_upper() { return pi_d_u; } +template<> inline long double pi_half_lower() { return pi_d_l / 2; } +template<> inline long double pi_half_upper() { return pi_d_u / 2; } +template<> inline long double pi_twice_lower() { return pi_d_l * 2; } +template<> inline long double pi_twice_upper() { return pi_d_u * 2; } + +} // namespace constants + +template inline +I pi() +{ + typedef typename I::base_type T; + return I(constants::pi_lower(), + constants::pi_upper(), true); +} + +template inline +I pi_half() +{ + typedef typename I::base_type T; + return I(constants::pi_half_lower(), + constants::pi_half_upper(), true); +} + +template inline +I pi_twice() +{ + typedef typename I::base_type T; + return I(constants::pi_twice_lower(), + constants::pi_twice_upper(), true); +} + +} // namespace interval_lib +} // namespace numeric +} // namespace boost + +#endif // BOOST_NUMERIC_INTERVAL_CONSTANTS_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/CVS/Entries b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/CVS/Entries new file mode 100644 index 000000000..34c839f66 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/CVS/Entries @@ -0,0 +1,13 @@ +/bcc_rounding_control.hpp/1.1/Thu Oct 6 12:13:52 2005// +/bugs.hpp/1.1/Thu Oct 6 12:13:52 2005// +/c99_rounding_control.hpp/1.1/Thu Oct 6 12:13:52 2005// +/c99sub_rounding_control.hpp/1.1/Thu Oct 6 12:13:52 2005// +/division.hpp/1.1/Thu Oct 6 12:13:52 2005// +/interval_prototype.hpp/1.1/Thu Oct 6 12:13:52 2005// +/msvc_rounding_control.hpp/1.1/Thu Oct 6 12:13:52 2005// +/ppc_rounding_control.hpp/1.1/Thu Oct 6 12:13:52 2005// +/sparc_rounding_control.hpp/1.1/Thu Oct 6 12:13:52 2005// +/test_input.hpp/1.1/Thu Oct 6 12:13:52 2005// +/x86_rounding_control.hpp/1.1/Thu Oct 6 12:13:52 2005// +/x86gcc_rounding_control.hpp/1.1/Thu Oct 6 12:13:52 2005// +D diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/CVS/Repository b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/CVS/Repository new file mode 100644 index 000000000..249fad08b --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/CVS/Repository @@ -0,0 +1 @@ +eo/contrib/boost/numeric/interval/detail diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/CVS/Root b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/bcc_rounding_control.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/bcc_rounding_control.hpp new file mode 100644 index 000000000..e3aaf046c --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/bcc_rounding_control.hpp @@ -0,0 +1,57 @@ +/* Boost interval/detail/bcc_rounding_control.hpp file + * + * Copyright 2000 Jens Maurer + * Copyright 2002 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_DETAIL_BCC_ROUNDING_CONTROL_HPP +#define BOOST_NUMERIC_INTERVAL_DETAIL_BCC_ROUNDING_CONTROL_HPP + +#ifndef __BORLANDC__ +# error This header is only intended for Borland C++. +#endif + +#ifndef _M_IX86 +# error This header only works on x86 CPUs. +#endif + +#include // Borland C++ rounding control + +namespace boost { +namespace numeric { +namespace interval_lib { +namespace detail { + +#ifndef BOOST_NUMERIC_INTERVAL_KEEP_EXCEPTIONS_FOR_BCC +extern "C" { unsigned int _RTLENTRY _fm_init(void); } + +struct borland_workaround { + borland_workaround() { _fm_init(); } +}; + +static borland_workaround borland_workaround_exec; +#endif // BOOST_NUMERIC_INTERVAL_KEEP_EXCEPTIONS_FOR_BCC + +__inline double rint(double) +{ __emit__(0xD9); __emit__(0xFC); /* asm FRNDINT */ } + +struct x86_rounding +{ + typedef unsigned int rounding_mode; + static void get_rounding_mode(rounding_mode& mode) + { mode = _control87(0, 0); } + static void set_rounding_mode(const rounding_mode mode) + { _control87(mode, 0xffff); } + static double to_int(const double& x) { return rint(x); } +}; + +} // namespace detail +} // namespace interval_lib +} // namespace numeric +} // namespace boost + +#endif /* BOOST_NUMERIC_INTERVAL_DETAIL_BCC_ROUNDING_CONTROL_HPP */ diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/bugs.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/bugs.hpp new file mode 100644 index 000000000..2058b9aee --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/bugs.hpp @@ -0,0 +1,79 @@ +/* Boost interval/detail/bugs.hpp file + * + * Copyright 2000 Jens Maurer + * Copyright 2002 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_DETAIL_BUGS +#define BOOST_NUMERIC_INTERVAL_DETAIL_BUGS + +#include + +#if defined(__GLIBC__) && (defined(__USE_MISC) || defined(__USE_XOPEN_EXTENDED) || defined(__USE_ISOC99)) && !defined(__ICC) +# define BOOST_HAS_INV_HYPERBOLIC +#endif + +#ifdef BOOST_NO_STDC_NAMESPACE +# define BOOST_NUMERIC_INTERVAL_using_math(a) using ::a +# ifdef BOOST_HAS_INV_HYPERBOLIC +# define BOOST_NUMERIC_INTERVAL_using_ahyp(a) using ::a +# endif +#else +# define BOOST_NUMERIC_INTERVAL_using_math(a) using std::a +# if defined(BOOST_HAS_INV_HYPERBOLIC) +# if defined(__GLIBCPP__) || defined(__GLIBCXX__) +# define BOOST_NUMERIC_INTERVAL_using_ahyp(a) using ::a +# else +# define BOOST_NUMERIC_INTERVAL_using_ahyp(a) using std::a +# endif +# endif +#endif + +#if defined(__COMO__) || defined(BOOST_INTEL) +# define BOOST_NUMERIC_INTERVAL_using_max(a) using std::a +#elif defined(BOOST_NO_STDC_NAMESPACE) +# define BOOST_NUMERIC_INTERVAL_using_max(a) using ::a +#else +# define BOOST_NUMERIC_INTERVAL_using_max(a) using std::a +#endif + +#ifndef BOOST_NUMERIC_INTERVAL_using_ahyp +# define BOOST_NUMERIC_INTERVAL_using_ahyp(a) +#endif + +#if defined(__GNUC__) && (__GNUC__ <= 2) +// cf PR c++/1981 for a description of the bug +#include +#include +namespace boost { +namespace numeric { + using std::min; + using std::max; + using std::sqrt; + using std::exp; + using std::log; + using std::cos; + using std::tan; + using std::asin; + using std::acos; + using std::atan; + using std::ceil; + using std::floor; + using std::sinh; + using std::cosh; + using std::tanh; +# undef BOOST_NUMERIC_INTERVAL_using_max +# undef BOOST_NUMERIC_INTERVAL_using_math +# define BOOST_NUMERIC_INTERVAL_using_max(a) +# define BOOST_NUMERIC_INTERVAL_using_math(a) +# undef BOOST_NUMERIC_INTERVAL_using_ahyp +# define BOOST_NUMERIC_INTERVAL_using_ahyp(a) +} // namespace numeric +} // namespace boost +#endif + +#endif // BOOST_NUMERIC_INTERVAL_DETAIL_BUGS diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/c99_rounding_control.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/c99_rounding_control.hpp new file mode 100644 index 000000000..181d28666 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/c99_rounding_control.hpp @@ -0,0 +1,47 @@ +/* Boost interval/detail/c99_rounding_control.hpp file + * + * Copyright 2000 Jens Maurer + * Copyright 2002 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_DETAIL_C99_ROUNDING_CONTROL_HPP +#define BOOST_NUMERIC_INTERVAL_DETAIL_C99_ROUNDING_CONTROL_HPP + +#include + +namespace boost { +namespace numeric { +namespace interval_lib { +namespace detail { + +struct c99_rounding_control: c99_rounding +{ + template + static T force_rounding(const T& r) { volatile T r_ = r; return r_; } +}; + +} // namespace detail + +template<> +struct rounding_control: + detail::c99_rounding_control { }; + +template<> +struct rounding_control: + detail::c99_rounding_control { }; + +template<> +struct rounding_control: + detail::c99_rounding_control { }; + +} // namespace interval_lib +} // namespace numeric +} // namespace boost + +#undef BOOST_NUMERIC_INTERVAL_NO_HARDWARE + +#endif // BOOST_NUMERIC_INTERVAL_DETAIL_C99_ROUNDING_CONTROL_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/c99sub_rounding_control.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/c99sub_rounding_control.hpp new file mode 100644 index 000000000..571c51fcc --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/c99sub_rounding_control.hpp @@ -0,0 +1,43 @@ +/* Boost interval/detail/c99sub_rounding_control.hpp file + * + * Copyright 2000 Jens Maurer + * Copyright 2002 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_DETAIL_C99SUB_ROUNDING_CONTROL_HPP +#define BOOST_NUMERIC_INTERVAL_DETAIL_C99SUB_ROUNDING_CONTROL_HPP + +#include // ISO C 99 rounding mode control + +namespace boost { +namespace numeric { +namespace interval_lib { +namespace detail { + +extern "C" { double rint(double); } + +struct c99_rounding +{ + typedef int rounding_mode; + + static void set_rounding_mode(const rounding_mode mode) { fesetround(mode); } + static void get_rounding_mode(rounding_mode &mode) { mode = fegetround(); } + static void downward() { set_rounding_mode(FE_DOWNWARD); } + static void upward() { set_rounding_mode(FE_UPWARD); } + static void to_nearest() { set_rounding_mode(FE_TONEAREST); } + static void toward_zero() { set_rounding_mode(FE_TOWARDZERO); } + + template + static T to_int(const T& r) { return rint(r); } +}; + +} // namespace detail +} // namespace interval_lib +} // namespace numeric +} // namespace boost + +#endif // BOOST_NUMERIC_INTERVAL_DETAIL_C99SUB_ROUBDING_CONTROL_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/division.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/division.hpp new file mode 100644 index 000000000..24fb025ad --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/division.hpp @@ -0,0 +1,194 @@ +/* Boost interval/detail/division.hpp file + * + * Copyright 2003 Guillaume Melquiond, Sylvain Pion + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_DETAIL_DIVISION_HPP +#define BOOST_NUMERIC_INTERVAL_DETAIL_DIVISION_HPP + +#include +#include +#include +#include +#include + +namespace boost { +namespace numeric { +namespace interval_lib { +namespace detail { + +template inline +interval div_non_zero(const interval& x, + const interval& y) +{ + // assert(!in_zero(y)); + typename Policies::rounding rnd; + typedef interval I; + const T& xl = x.lower(); + const T& xu = x.upper(); + const T& yl = y.lower(); + const T& yu = y.upper(); + if (::boost::numeric::interval_lib::user::is_neg(xu)) + if (::boost::numeric::interval_lib::user::is_neg(yu)) + return I(rnd.div_down(xu, yl), rnd.div_up(xl, yu), true); + else + return I(rnd.div_down(xl, yl), rnd.div_up(xu, yu), true); + else if (::boost::numeric::interval_lib::user::is_neg(xl)) + if (::boost::numeric::interval_lib::user::is_neg(yu)) + return I(rnd.div_down(xu, yu), rnd.div_up(xl, yu), true); + else + return I(rnd.div_down(xl, yl), rnd.div_up(xu, yl), true); + else + if (::boost::numeric::interval_lib::user::is_neg(yu)) + return I(rnd.div_down(xu, yu), rnd.div_up(xl, yl), true); + else + return I(rnd.div_down(xl, yu), rnd.div_up(xu, yl), true); +} + +template inline +interval div_non_zero(const T& x, const interval& y) +{ + // assert(!in_zero(y)); + typename Policies::rounding rnd; + typedef interval I; + const T& yl = y.lower(); + const T& yu = y.upper(); + if (::boost::numeric::interval_lib::user::is_neg(x)) + return I(rnd.div_down(x, yl), rnd.div_up(x, yu), true); + else + return I(rnd.div_down(x, yu), rnd.div_up(x, yl), true); +} + +template inline +interval div_positive(const interval& x, const T& yu) +{ + // assert(::boost::numeric::interval_lib::user::is_pos(yu)); + if (::boost::numeric::interval_lib::user::is_zero(x.lower()) && + ::boost::numeric::interval_lib::user::is_zero(x.upper())) + return x; + typename Policies::rounding rnd; + typedef interval I; + const T& xl = x.lower(); + const T& xu = x.upper(); + typedef typename Policies::checking checking; + if (::boost::numeric::interval_lib::user::is_neg(xu)) + return I(checking::neg_inf(), rnd.div_up(xu, yu), true); + else if (::boost::numeric::interval_lib::user::is_neg(xl)) + return I(checking::neg_inf(), checking::pos_inf(), true); + else + return I(rnd.div_down(xl, yu), checking::pos_inf(), true); +} + +template inline +interval div_positive(const T& x, const T& yu) +{ + // assert(::boost::numeric::interval_lib::user::is_pos(yu)); + typedef interval I; + if (::boost::numeric::interval_lib::user::is_zero(x)) + return I(static_cast(0), static_cast(0), true); + typename Policies::rounding rnd; + typedef typename Policies::checking checking; + if (::boost::numeric::interval_lib::user::is_neg(x)) + return I(checking::neg_inf(), rnd.div_up(x, yu), true); + else + return I(rnd.div_down(x, yu), checking::pos_inf(), true); +} + +template inline +interval div_negative(const interval& x, const T& yl) +{ + // assert(::boost::numeric::interval_lib::user::is_neg(yl)); + if (::boost::numeric::interval_lib::user::is_zero(x.lower()) && + ::boost::numeric::interval_lib::user::is_zero(x.upper())) + return x; + typename Policies::rounding rnd; + typedef interval I; + const T& xl = x.lower(); + const T& xu = x.upper(); + typedef typename Policies::checking checking; + if (::boost::numeric::interval_lib::user::is_neg(xu)) + return I(rnd.div_down(xu, yl), checking::pos_inf(), true); + else if (::boost::numeric::interval_lib::user::is_neg(xl)) + return I(checking::neg_inf(), checking::pos_inf(), true); + else + return I(checking::neg_inf(), rnd.div_up(xl, yl), true); +} + +template inline +interval div_negative(const T& x, const T& yl) +{ + // assert(::boost::numeric::interval_lib::user::is_neg(yl)); + typedef interval I; + if (::boost::numeric::interval_lib::user::is_zero(x)) + return I(static_cast(0), static_cast(0), true); + typename Policies::rounding rnd; + typedef typename Policies::checking checking; + if (::boost::numeric::interval_lib::user::is_neg(x)) + return I(rnd.div_down(x, yl), checking::pos_inf(), true); + else + return I(checking::neg_inf(), rnd.div_up(x, yl), true); +} + +template inline +interval div_zero(const interval& x) +{ + if (::boost::numeric::interval_lib::user::is_zero(x.lower()) && + ::boost::numeric::interval_lib::user::is_zero(x.upper())) + return x; + else return interval::whole(); +} + +template inline +interval div_zero(const T& x) +{ + if (::boost::numeric::interval_lib::user::is_zero(x)) + return interval(static_cast(0), static_cast(0), true); + else return interval::whole(); +} + +template inline +interval div_zero_part1(const interval& x, + const interval& y, bool& b) +{ + // assert(::boost::numeric::interval_lib::user::is_neg(y.lower()) && ::boost::numeric::interval_lib::user::is_pos(y.upper())); + if (::boost::numeric::interval_lib::user::is_zero(x.lower()) && ::boost::numeric::interval_lib::user::is_zero(x.upper())) + { b = false; return x; } + typename Policies::rounding rnd; + typedef interval I; + const T& xl = x.lower(); + const T& xu = x.upper(); + const T& yl = y.lower(); + const T& yu = y.upper(); + typedef typename Policies::checking checking; + if (::boost::numeric::interval_lib::user::is_neg(xu)) + { b = true; return I(checking::neg_inf(), rnd.div_up(xu, yu), true); } + else if (::boost::numeric::interval_lib::user::is_neg(xl)) + { b = false; return I(checking::neg_inf(), checking::pos_inf(), true); } + else + { b = true; return I(checking::neg_inf(), rnd.div_up(xl, yl), true); } +} + +template inline +interval div_zero_part2(const interval& x, + const interval& y) +{ + // assert(::boost::numeric::interval_lib::user::is_neg(y.lower()) && ::boost::numeric::interval_lib::user::is_pos(y.upper()) && (div_zero_part1(x, y, b), b)); + typename Policies::rounding rnd; + typedef interval I; + typedef typename Policies::checking checking; + if (::boost::numeric::interval_lib::user::is_neg(x.upper())) + return I(rnd.div_down(x.upper(), y.lower()), checking::pos_inf(), true); + else + return I(rnd.div_down(x.lower(), y.upper()), checking::pos_inf(), true); +} + +} // namespace detail +} // namespace interval_lib +} // namespace numeric +} // namespace boost + +#endif // BOOST_NUMERIC_INTERVAL_DETAIL_DIVISION_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/interval_prototype.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/interval_prototype.hpp new file mode 100644 index 000000000..ac9029b70 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/interval_prototype.hpp @@ -0,0 +1,41 @@ +/* Boost interval/detail/interval_prototype.hpp file + * + * Copyright 2002 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_DETAIL_INTERVAL_PROTOTYPE_HPP +#define BOOST_NUMERIC_INTERVAL_DETAIL_INTERVAL_PROTOTYPE_HPP + +namespace boost { +namespace numeric { + +namespace interval_lib { + +template struct rounded_math; +template struct checking_strict; +class comparison_error; +template struct policies; + +/* + * default policies class + */ + +template +struct default_policies +{ + typedef policies, checking_strict > type; +}; + +} // namespace interval_lib + +template::type > +class interval; + +} // namespace numeric +} // namespace boost + +#endif // BOOST_NUMERIC_INTERVAL_DETAIL_INTERVAL_PROTOTYPE_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/msvc_rounding_control.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/msvc_rounding_control.hpp new file mode 100644 index 000000000..2068c934c --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/msvc_rounding_control.hpp @@ -0,0 +1,88 @@ +/* Boost interval/detail/msvc_rounding_control.hpp file + * + * Copyright 2000 Maarten Keijzer + * Copyright 2002 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_DETAIL_MSVC_ROUNDING_CONTROL_HPP +#define BOOST_NUMERIC_INTERVAL_DETAIL_MSVC_ROUNDING_CONTROL_HPP + +#ifndef _MSC_VER +# error This header is only intended for MSVC, but might work for Borland as well +#endif + +#include // MSVC rounding control + +namespace boost { +namespace numeric { +namespace interval_lib { +namespace detail { + +extern "C" { double rint(double); } + +struct x86_rounding +{ + static unsigned int hard2msvc(unsigned short m) { + unsigned int n = 0; + if (m & 0x01) n |= _EM_INVALID; + if (m & 0x02) n |= _EM_DENORMAL; + if (m & 0x04) n |= _EM_ZERODIVIDE; + if (m & 0x08) n |= _EM_OVERFLOW; + if (m & 0x10) n |= _EM_UNDERFLOW; + if (m & 0x20) n |= _EM_INEXACT; + switch (m & 0x300) { + case 0x000: n |= _PC_24; break; + case 0x200: n |= _PC_53; break; + case 0x300: n |= _PC_64; break; + } + switch (m & 0xC00) { + case 0x000: n |= _RC_NEAR; break; + case 0x400: n |= _RC_DOWN; break; + case 0x800: n |= _RC_UP; break; + case 0xC00: n |= _RC_CHOP; break; + } + if (m & 0x1000) n |= _IC_AFFINE; // only useful on 287 + return n; + } + + static unsigned short msvc2hard(unsigned int n) { + unsigned short m = 0; + if (n & _EM_INVALID) m |= 0x01; + if (n & _EM_DENORMAL) m |= 0x02; + if (n & _EM_ZERODIVIDE) m |= 0x04; + if (n & _EM_OVERFLOW) m |= 0x08; + if (n & _EM_UNDERFLOW) m |= 0x10; + if (n & _EM_INEXACT) m |= 0x20; + switch (n & _MCW_RC) { + case _RC_NEAR: m |= 0x000; break; + case _RC_DOWN: m |= 0x400; break; + case _RC_UP: m |= 0x800; break; + case _RC_CHOP: m |= 0xC00; break; + } + switch (n & _MCW_PC) { + case _PC_24: m |= 0x000; break; + case _PC_53: m |= 0x200; break; + case _PC_64: m |= 0x300; break; + } + if ((n & _MCW_IC) == _IC_AFFINE) m |= 0x1000; + return m; + } + + typedef unsigned short rounding_mode; + static void get_rounding_mode(rounding_mode& mode) + { mode = msvc2hard(_control87(0, 0)); } + static void set_rounding_mode(const rounding_mode mode) + { _control87(hard2msvc(mode), _MCW_EM | _MCW_RC | _MCW_PC | _MCW_IC); } + static double to_int(const double& x) { return rint(x); } +}; + +} // namespace detail +} // namespace interval_lib +} // namespace numeric +} // namespace boost + +#endif /* BOOST_NUMERIC_INTERVAL_DETAIL_MSVC_ROUNDING_CONTROL_HPP */ diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/ppc_rounding_control.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/ppc_rounding_control.hpp new file mode 100644 index 000000000..400522a75 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/ppc_rounding_control.hpp @@ -0,0 +1,95 @@ +/* Boost interval/detail/ppc_rounding_control.hpp file + * + * Copyright 2000 Jens Maurer + * Copyright 2002 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion + * Copyright 2005 Guillaume Melquiond + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_DETAIL_PPC_ROUNDING_CONTROL_HPP +#define BOOST_NUMERIC_INTERVAL_DETAIL_PPC_ROUNDING_CONTROL_HPP + +#if !defined(powerpc) && !defined(__powerpc__) && !defined(__ppc__) +#error This header only works on PPC CPUs. +#endif + +#if defined(__GNUC__ ) || (__IBMCPP__ >= 700) + +namespace boost { +namespace numeric { +namespace interval_lib { +namespace detail { + +typedef union { + ::boost::long_long_type imode; + double dmode; +} rounding_mode_struct; + +static const rounding_mode_struct mode_upward = { 0xFFF8000000000002LL }; +static const rounding_mode_struct mode_downward = { 0xFFF8000000000003LL }; +static const rounding_mode_struct mode_to_nearest = { 0xFFF8000000000001LL }; +static const rounding_mode_struct mode_toward_zero = { 0xFFF8000000000000LL }; + +struct ppc_rounding_control +{ + typedef double rounding_mode; + + static void set_rounding_mode(const rounding_mode mode) + { __asm__ __volatile__ ("mtfsf 255,%0" : : "f"(mode)); } + + static void get_rounding_mode(rounding_mode& mode) + { __asm__ __volatile__ ("mffs %0" : "=f"(mode)); } + + static void downward() { set_rounding_mode(mode_downward.dmode); } + static void upward() { set_rounding_mode(mode_upward.dmode); } + static void to_nearest() { set_rounding_mode(mode_to_nearest.dmode); } + static void toward_zero() { set_rounding_mode(mode_toward_zero.dmode); } +}; + +} // namespace detail + +extern "C" { + float rintf(float); + double rint(double); +} + +template<> +struct rounding_control: + detail::ppc_rounding_control +{ + static float force_rounding(const float r) + { + float tmp; + __asm__ __volatile__ ("frsp %0, %1" : "=f" (tmp) : "f" (r)); + return tmp; + } + static float to_int(const float& x) { return rintf(x); } +}; + +template<> +struct rounding_control: + detail::ppc_rounding_control +{ + static const double & force_rounding(const double& r) { return r; } + static double to_int(const double& r) { return rint(r); } +}; + +template<> +struct rounding_control: + detail::ppc_rounding_control +{ + static const long double & force_rounding(const long double& r) { return r; } + static long double to_int(const long double& r) { return rint(r); } +}; + +} // namespace interval_lib +} // namespace numeric +} // namespace boost + +#undef BOOST_NUMERIC_INTERVAL_NO_HARDWARE +#endif + +#endif /* BOOST_NUMERIC_INTERVAL_DETAIL_PPC_ROUNDING_CONTROL_HPP */ diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/sparc_rounding_control.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/sparc_rounding_control.hpp new file mode 100644 index 000000000..6ba5baf03 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/sparc_rounding_control.hpp @@ -0,0 +1,112 @@ +/* Boost interval/detail/sparc_rounding_control.hpp file + * + * Copyright 2000 Jens Maurer + * Copyright 2002 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + * + * The basic code in this file was kindly provided by Jeremy Siek. + */ + +#ifndef BOOST_NUMERIC_INTERVAL_DETAIL_SPARC_ROUNDING_CONTROL_HPP +#define BOOST_NUMERIC_INTERVAL_DETAIL_SPARC_ROUNDING_CONTROL_HPP + +#if !defined(sparc) && !defined(__sparc__) +# error This header is only intended for SPARC CPUs. +#endif + +#ifdef __SUNPRO_CC +# include +#endif + + +namespace boost { +namespace numeric { +namespace interval_lib { +namespace detail { + +struct sparc_rounding_control +{ + typedef unsigned int rounding_mode; + + static void set_rounding_mode(const rounding_mode& mode) + { +# if defined(__GNUC__) + __asm__ __volatile__("ld %0, %%fsr" : : "m"(mode)); +# elif defined (__SUNPRO_CC) + fpsetround(fp_rnd(mode)); +# elif defined(__KCC) + asm("sethi %hi(mode), %o1"); + asm("ld [%o1+%lo(mode)], %fsr"); +# else +# error Unsupported compiler for Sparc rounding control. +# endif + } + + static void get_rounding_mode(rounding_mode& mode) + { +# if defined(__GNUC__) + __asm__ __volatile__("st %%fsr, %0" : "=m"(mode)); +# elif defined (__SUNPRO_CC) + mode = fpgetround(); +# elif defined(__KCC) +# error KCC on Sun SPARC get_round_mode: please fix me + asm("st %fsr, [mode]"); +# else +# error Unsupported compiler for Sparc rounding control. +# endif + } + +#if defined(__SUNPRO_CC) + static void downward() { set_rounding_mode(FP_RM); } + static void upward() { set_rounding_mode(FP_RP); } + static void to_nearest() { set_rounding_mode(FP_RN); } + static void toward_zero() { set_rounding_mode(FP_RZ); } +#else + static void downward() { set_rounding_mode(0xc0000000); } + static void upward() { set_rounding_mode(0x80000000); } + static void to_nearest() { set_rounding_mode(0x00000000); } + static void toward_zero() { set_rounding_mode(0x40000000); } +#endif +}; + +} // namespace detail + +extern "C" { + float rintf(float); + double rint(double); +} + +template<> +struct rounding_control: + detail::sparc_rounding_control +{ + static const float& force_rounding(const float& x) { return x; } + static float to_int(const float& x) { return rintf(x); } +}; + +template<> +struct rounding_control: + detail::sparc_rounding_control +{ + static const double& force_rounding(const double& x) { return x; } + static double to_int(const double& x) { return rint(x); } +}; + +template<> +struct rounding_control: + detail::sparc_rounding_control +{ + static const long double& force_rounding(const long double& x) { return x; } + static long double to_int(const long double& x) { return rint(x); } +}; + +} // namespace interval_lib +} // namespace numeric +} // namespace boost + +#undef BOOST_NUMERIC_INTERVAL_NO_HARDWARE + +#endif /* BOOST_NUMERIC_INTERVAL_DETAIL_SPARC_ROUNDING_CONTROL_HPP */ diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/test_input.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/test_input.hpp new file mode 100644 index 000000000..58695fec3 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/test_input.hpp @@ -0,0 +1,76 @@ +/* Boost interval/detail/test_input.hpp file + * + * Copyright 2002 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_DETAIL_TEST_INPUT_HPP +#define BOOST_NUMERIC_INTERVAL_DETAIL_TEST_INPUT_HPP + +#include + +namespace boost { +namespace numeric { +namespace interval_lib { +namespace user { + +template inline +bool is_zero(T const &v) { return v == static_cast(0); } + +template inline +bool is_neg (T const &v) { return v < static_cast(0); } + +template inline +bool is_pos (T const &v) { return v > static_cast(0); } + +} // namespace user + +namespace detail { + +template inline +bool test_input(const interval& x) { + typedef typename Policies::checking checking; + return checking::is_empty(x.lower(), x.upper()); +} + +template inline +bool test_input(const interval& x, const interval& y) { + typedef typename Policies1::checking checking1; + typedef typename Policies2::checking checking2; + return checking1::is_empty(x.lower(), x.upper()) || + checking2::is_empty(y.lower(), y.upper()); +} + +template inline +bool test_input(const T& x, const interval& y) { + typedef typename Policies::checking checking; + return checking::is_nan(x) || checking::is_empty(y.lower(), y.upper()); +} + +template inline +bool test_input(const interval& x, const T& y) { + typedef typename Policies::checking checking; + return checking::is_empty(x.lower(), x.upper()) || checking::is_nan(y); +} + +template inline +bool test_input(const T& x) { + typedef typename Policies::checking checking; + return checking::is_nan(x); +} + +template inline +bool test_input(const T& x, const T& y) { + typedef typename Policies::checking checking; + return checking::is_nan(x) || checking::is_nan(y); +} + +} // namespace detail +} // namespace interval_lib +} // namespace numeric +} // namespace boost + +#endif // BOOST_NUMERIC_INTERVAL_DETAIL_TEST_INPUT_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/x86_rounding_control.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/x86_rounding_control.hpp new file mode 100644 index 000000000..3eebdbac5 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/x86_rounding_control.hpp @@ -0,0 +1,108 @@ +/* Boost interval/detail/x86_rounding_control.hpp file + * + * Copyright 2000 Jens Maurer + * Copyright 2002 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_DETAIL_X86_ROUNDING_CONTROL_HPP +#define BOOST_NUMERIC_INTERVAL_DETAIL_X86_ROUNDING_CONTROL_HPP + +#ifdef __GNUC__ +# include +#elif defined(__BORLANDC__) +# include +#elif defined(_MSC_VER) +# include +#elif defined(__MWERKS__) || defined(__ICC) +# define BOOST_NUMERIC_INTERVAL_USE_C99_SUBSYSTEM +# include +#else +# error Unsupported C++ compiler. +#endif + +namespace boost { +namespace numeric { +namespace interval_lib { + +namespace detail { + +#ifdef BOOST_NUMERIC_INTERVAL_USE_C99_SUBSYSTEM +typedef c99_rounding x86_rounding_control; +#undef BOOST_NUMERIC_INTERVAL_USE_C99_SUBSYSTEM +#else +struct fpu_rounding_modes +{ + unsigned short to_nearest; + unsigned short downward; + unsigned short upward; + unsigned short toward_zero; +}; + +// exceptions masked, extended precision +// hardware default is 0x037f (0x1000 only has a meaning on 287) +static const fpu_rounding_modes rnd_mode = { 0x137f, 0x177f, 0x1b7f, 0x1f7f }; + +struct x86_rounding_control: x86_rounding +{ + static void to_nearest() { set_rounding_mode(rnd_mode.to_nearest); } + static void downward() { set_rounding_mode(rnd_mode.downward); } + static void upward() { set_rounding_mode(rnd_mode.upward); } + static void toward_zero() { set_rounding_mode(rnd_mode.toward_zero); } +}; +#endif // BOOST_NUMERIC_INTERVAL_USE_C99_SUBSYSTEM + +} // namespace detail + +template<> +struct rounding_control: detail::x86_rounding_control +{ + static float force_rounding(const float& r) + { volatile float r_ = r; return r_; } +}; + +template<> +struct rounding_control: detail::x86_rounding_control +{ + /*static double force_rounding(double r) + { asm volatile ("" : "+m"(r) : ); return r; }*/ + static double force_rounding(const double& r) + { volatile double r_ = r; return r_; } +}; + +namespace detail { + +template +struct x86_rounding_control_long_double; + +template<> +struct x86_rounding_control_long_double: x86_rounding_control +{ + static long double force_rounding(long double const &r) + { volatile long double r_ = r; return r_; } +}; + +template<> +struct x86_rounding_control_long_double: x86_rounding_control +{ + static long double const &force_rounding(long double const &r) + { return r; } +}; + +} // namespace detail + +template<> +struct rounding_control: + detail::x86_rounding_control_long_double< (sizeof(long double) >= 10) > +{}; + +} // namespace interval_lib +} // namespace numeric +} // namespace boost + +#undef BOOST_NUMERIC_INTERVAL_NO_HARDWARE + +#endif /* BOOST_NUMERIC_INTERVAL_DETAIL_X86_ROUNDING_CONTROL_HPP */ diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/x86gcc_rounding_control.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/x86gcc_rounding_control.hpp new file mode 100644 index 000000000..079d681df --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/detail/x86gcc_rounding_control.hpp @@ -0,0 +1,51 @@ +/* Boost interval/detail/x86gcc_rounding_control.hpp file + * + * Copyright 2000 Jens Maurer + * Copyright 2002 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_DETAIL_X86GCC_ROUNDING_CONTROL_HPP +#define BOOST_NUMERIC_INTERVAL_DETAIL_X86GCC_ROUNDING_CONTROL_HPP + +#ifndef __GNUC__ +# error This header only works with GNU CC. +#endif + +#ifndef __i386__ +# error This header only works on x86 CPUs. +#endif + +namespace boost { +namespace numeric { +namespace interval_lib { +namespace detail { + +struct x86_rounding +{ + typedef unsigned short rounding_mode; + + static void set_rounding_mode(const rounding_mode& mode) + { __asm__ __volatile__ ("fldcw %0" : : "m"(mode)); } + + static void get_rounding_mode(rounding_mode& mode) + { __asm__ __volatile__ ("fnstcw %0" : "=m"(mode)); } + + template + static T to_int(T r) + { + T r_; + __asm__ ("frndint" : "=&t"(r_) : "0"(r)); + return r_; + } +}; + +} // namespace detail +} // namespace interval_lib +} // namespace numeric +} // namespace boost + +#endif /* BOOST_NUMERIC_INTERVAL_DETAIL_X86GCC_ROUNDING_CONTROL_HPP */ diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/ext/CVS/Entries b/trunk/paradiseo-eo/contrib/boost/numeric/interval/ext/CVS/Entries new file mode 100644 index 000000000..3439d5415 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/ext/CVS/Entries @@ -0,0 +1,3 @@ +/integer.hpp/1.1/Thu Oct 6 12:13:52 2005// +/x86_fast_rounding_control.hpp/1.1/Thu Oct 6 12:13:52 2005// +D diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/ext/CVS/Repository b/trunk/paradiseo-eo/contrib/boost/numeric/interval/ext/CVS/Repository new file mode 100644 index 000000000..0282308cb --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/ext/CVS/Repository @@ -0,0 +1 @@ +eo/contrib/boost/numeric/interval/ext diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/ext/CVS/Root b/trunk/paradiseo-eo/contrib/boost/numeric/interval/ext/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/ext/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/ext/integer.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/ext/integer.hpp new file mode 100644 index 000000000..628a343ac --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/ext/integer.hpp @@ -0,0 +1,70 @@ +/* Boost interval/ext/integer.hpp template implementation file + * + * Copyright 2003 Guillaume Melquiond + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_EXT_INTEGER_HPP +#define BOOST_NUMERIC_INTERVAL_EXT_INTEGER_HPP + +#include +#include + +namespace boost { +namespace numeric { + +template inline +interval operator+ (const interval& x, int y) +{ + return x + static_cast(y); +} + +template inline +interval operator+ (int x, const interval& y) +{ + return static_cast(x) + y; +} + +template inline +interval operator- (const interval& x, int y) +{ + return x - static_cast(y); +} + +template inline +interval operator- (int x, const interval& y) +{ + return static_cast(x) - y; +} + +template inline +interval operator* (const interval& x, int y) +{ + return x * static_cast(y); +} + +template inline +interval operator* (int x, const interval& y) +{ + return static_cast(x) * y; +} + +template inline +interval operator/ (const interval& x, int y) +{ + return x / static_cast(y); +} + +template inline +interval operator/ (int x, const interval& y) +{ + return static_cast(x) / y; +} + +} // namespace numeric +} // namespace boost + +#endif // BOOST_NUMERIC_INTERVAL_EXT_INTEGER_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/ext/x86_fast_rounding_control.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/ext/x86_fast_rounding_control.hpp new file mode 100644 index 000000000..7f89a4e54 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/ext/x86_fast_rounding_control.hpp @@ -0,0 +1,70 @@ +/* Boost interval/detail/x86gcc_rounding_control.hpp file + * + * This header provides a rounding control policy + * that avoids flushing results to memory. In + * order for this optimization to be reliable, it + * should be used only when no underflow or + * overflow would happen without it. Indeed, only + * values in range are correctly rounded. + * + * Copyright 2002 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_EXT_X86_FAST_ROUNDING_CONTROL_HPP +#define BOOST_NUMERIC_INTERVAL_EXT_X86_FAST_ROUNDING_CONTROL_HPP + +namespace boost { +namespace numeric { +namespace interval_lib { + +namespace detail { + +// exceptions masked, expected precision (the mask is 0x0300) +static const fpu_rounding_modes rnd_mode_f = { 0x107f, 0x147f, 0x187f, 0x1c7f }; +static const fpu_rounding_modes rnd_mode_d = { 0x127f, 0x167f, 0x1a7f, 0x1e7f }; +static const fpu_rounding_modes rnd_mode_l = { 0x137f, 0x177f, 0x1b7f, 0x1f7f }; + +} // namespace detail + +template +struct x86_fast_rounding_control; + +template<> +struct x86_fast_rounding_control: detail::x86_rounding +{ + static void to_nearest() { set_rounding_mode(detail::rnd_mode_f.to_nearest); } + static void downward() { set_rounding_mode(detail::rnd_mode_f.downward); } + static void upward() { set_rounding_mode(detail::rnd_mode_f.upward); } + static void toward_zero() { set_rounding_mode(detail::rnd_mode_f.toward_zero); } + static const float& force_rounding(const float& r) { return r; } +}; + +template<> +struct x86_fast_rounding_control: detail::x86_rounding +{ + static void to_nearest() { set_rounding_mode(detail::rnd_mode_d.to_nearest); } + static void downward() { set_rounding_mode(detail::rnd_mode_d.downward); } + static void upward() { set_rounding_mode(detail::rnd_mode_d.upward); } + static void toward_zero() { set_rounding_mode(detail::rnd_mode_d.toward_zero); } + static const double& force_rounding(const double& r) { return r; } +}; + +template<> +struct x86_fast_rounding_control: detail::x86_rounding +{ + static void to_nearest() { set_rounding_mode(detail::rnd_mode_l.to_nearest); } + static void downward() { set_rounding_mode(detail::rnd_mode_l.downward); } + static void upward() { set_rounding_mode(detail::rnd_mode_l.upward); } + static void toward_zero() { set_rounding_mode(detail::rnd_mode_l.toward_zero); } + static const long double& force_rounding(const long double& r) { return r; } +}; + +} // namespace interval_lib +} // namespace numeric +} // namespace boost + +#endif // BOOST_NUMERIC_INTERVAL_EXT_X86_FAST_ROUNDING_CONTROL_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/hw_rounding.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/hw_rounding.hpp new file mode 100644 index 000000000..ed225d405 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/hw_rounding.hpp @@ -0,0 +1,64 @@ +/* Boost interval/hw_rounding.hpp template implementation file + * + * Copyright 2002 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion + * Copyright 2005 Guillaume Melquiond + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_HW_ROUNDING_HPP +#define BOOST_NUMERIC_INTERVAL_HW_ROUNDING_HPP + +#include +#include + +#define BOOST_NUMERIC_INTERVAL_NO_HARDWARE + +// define appropriate specialization of rounding_control for built-in types +#if defined(__i386__) || defined(_M_IX86) || defined(__BORLANDC__) +# include +#elif defined(powerpc) || defined(__powerpc__) || defined(__ppc__) +# include +#elif defined(sparc) || defined(__sparc__) +# include +#endif + +#if defined(BOOST_NUMERIC_INTERVAL_NO_HARDWARE) && (defined(__USE_ISOC99) || defined(__MSL__)) +# include +#endif + +#if defined(BOOST_NUMERIC_INTERVAL_NO_HARDWARE) +# undef BOOST_NUMERIC_INTERVAL_NO_HARDWARE +# error Boost.Numeric.Interval: Please specify rounding control mechanism. +#endif + +namespace boost { +namespace numeric { +namespace interval_lib { + +/* + * Three specializations of rounded_math + */ + +template<> +struct rounded_math + : save_state > +{}; + +template<> +struct rounded_math + : save_state > +{}; + +template<> +struct rounded_math + : save_state > +{}; + +} // namespace interval_lib +} // namespace numeric +} // namespace boost + +#endif // BOOST_NUMERIC_INTERVAL_HW_ROUNDING_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/interval.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/interval.hpp new file mode 100644 index 000000000..0b2d0eec6 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/interval.hpp @@ -0,0 +1,450 @@ +/* Boost interval/interval.hpp header file + * + * Copyright 2002-2003 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_INTERVAL_HPP +#define BOOST_NUMERIC_INTERVAL_INTERVAL_HPP + +#include +#include +#include + +namespace boost { +namespace numeric { + +namespace interval_lib { + +class comparison_error + : public std::runtime_error +{ +public: + comparison_error() + : std::runtime_error("boost::interval: uncertain comparison") + { } +}; + +} // namespace interval_lib + +/* + * interval class + */ + +template +class interval +{ +private: + struct interval_holder; + struct number_holder; +public: + typedef T base_type; + typedef Policies traits_type; + + T const &lower() const; + T const &upper() const; + + interval(); + interval(T const &v); + template interval(T1 const &v); + interval(T const &l, T const &u); + template interval(T1 const &l, T2 const &u); + interval(interval const &r); + template interval(interval const &r); + template interval(interval const &r); + + interval &operator=(T const &v); + template interval &operator=(T1 const &v); + interval &operator=(interval const &r); + template interval &operator=(interval const &r); + template interval &operator=(interval const &r); + + void assign(const T& l, const T& u); + + static interval empty(); + static interval whole(); + static interval hull(const T& x, const T& y); + + interval& operator+= (const T& r); + interval& operator+= (const interval& r); + interval& operator-= (const T& r); + interval& operator-= (const interval& r); + interval& operator*= (const T& r); + interval& operator*= (const interval& r); + interval& operator/= (const T& r); + interval& operator/= (const interval& r); + + bool operator< (const interval_holder& r) const; + bool operator> (const interval_holder& r) const; + bool operator<= (const interval_holder& r) const; + bool operator>= (const interval_holder& r) const; + bool operator== (const interval_holder& r) const; + bool operator!= (const interval_holder& r) const; + + bool operator< (const number_holder& r) const; + bool operator> (const number_holder& r) const; + bool operator<= (const number_holder& r) const; + bool operator>= (const number_holder& r) const; + bool operator== (const number_holder& r) const; + bool operator!= (const number_holder& r) const; + + // the following is for internal use only, it is not a published interface + // nevertheless, it's public because friends don't always work correctly. + interval(const T& l, const T& u, bool): low(l), up(u) {} + void set_empty(); + void set_whole(); + void set(const T& l, const T& u); + +private: + struct interval_holder { + template + interval_holder(const interval& r) + : low(r.lower()), up(r.upper()) + { + typedef typename Policies2::checking checking2; + if (checking2::is_empty(low, up)) + throw interval_lib::comparison_error(); + } + + const T& low; + const T& up; + }; + + struct number_holder { + number_holder(const T& r) : val(r) + { + typedef typename Policies::checking checking; + if (checking::is_nan(r)) + throw interval_lib::comparison_error(); + } + + const T& val; + }; + + typedef typename Policies::checking checking; + typedef typename Policies::rounding rounding; + + T low; + T up; +}; + +template inline +interval::interval(): + low(static_cast(0)), up(static_cast(0)) +{} + +template inline +interval::interval(T const &v): low(v), up(v) +{ + if (checking::is_nan(v)) set_empty(); +} + +template template inline +interval::interval(T1 const &v) +{ + if (checking::is_nan(v)) set_empty(); + else { + rounding rnd; + low = rnd.conv_down(v); + up = rnd.conv_up (v); + } +} + +template template inline +interval::interval(T1 const &l, T2 const &u) +{ + if (checking::is_nan(l) || checking::is_nan(u) || !(l <= u)) set_empty(); + else { + rounding rnd; + low = rnd.conv_down(l); + up = rnd.conv_up (u); + } +} + +template inline +interval::interval(T const &l, T const &u): low(l), up(u) +{ + if (checking::is_nan(l) || checking::is_nan(u) || !(l <= u)) + set_empty(); +} + + +template inline +interval::interval(interval const &r): low(r.lower()), up(r.upper()) +{} + +template template inline +interval::interval(interval const &r): low(r.lower()), up(r.upper()) +{ + typedef typename Policies1::checking checking1; + if (checking1::is_empty(r.lower(), r.upper())) set_empty(); +} + +template template inline +interval::interval(interval const &r) +{ + typedef typename Policies1::checking checking1; + if (checking1::is_empty(r.lower(), r.upper())) set_empty(); + else { + rounding rnd; + low = rnd.conv_down(r.lower()); + up = rnd.conv_up (r.upper()); + } +} + +template inline +interval &interval::operator=(T const &v) +{ + if (checking::is_nan(v)) set_empty(); + else low = up = v; + return *this; +} + +template template inline +interval &interval::operator=(T1 const &v) +{ + if (checking::is_nan(v)) set_empty(); + else { + rounding rnd; + low = rnd.conv_down(v); + up = rnd.conv_up (v); + } + return *this; +} + +template inline +interval &interval::operator=(interval const &r) +{ + low = r.lower(); + up = r.upper(); + return *this; +} + +template template inline +interval &interval::operator=(interval const &r) +{ + typedef typename Policies1::checking checking1; + if (checking1::is_empty(r.lower(), r.upper())) set_empty(); + else { + low = r.lower(); + up = r.upper(); + } + return *this; +} + +template template inline +interval &interval::operator=(interval const &r) +{ + typedef typename Policies1::checking checking1; + if (checking1::is_empty(r.lower(), r.upper())) set_empty(); + else { + rounding rnd; + low = rnd.conv_down(r.lower()); + up = rnd.conv_up (r.upper()); + } + return *this; +} + +template inline +void interval::assign(const T& l, const T& u) +{ + if (checking::is_nan(l) || checking::is_nan(u) || !(l <= u)) + set_empty(); + else set(l, u); +} + +template inline +void interval::set(const T& l, const T& u) +{ + low = l; + up = u; +} + +template inline +void interval::set_empty() +{ + low = checking::empty_lower(); + up = checking::empty_upper(); +} + +template inline +void interval::set_whole() +{ + low = checking::neg_inf(); + up = checking::pos_inf(); +} + +template inline +interval interval::hull(const T& x, const T& y) +{ + bool bad_x = checking::is_nan(x); + bool bad_y = checking::is_nan(y); + if (bad_x) + if (bad_y) return interval::empty(); + else return interval(y, y, true); + else + if (bad_y) return interval(x, x, true); + if (x <= y) return interval(x, y, true); + else return interval(y, x, true); +} + +template inline +interval interval::empty() +{ + return interval(checking::empty_lower(), + checking::empty_upper(), true); +} + +template inline +interval interval::whole() +{ + return interval(checking::neg_inf(), checking::pos_inf(), true); +} + +template inline +const T& interval::lower() const +{ + return low; +} + +template inline +const T& interval::upper() const +{ + return up; +} + +/* + * interval/interval comparisons + */ + +template inline +bool interval::operator< (const interval_holder& r) const +{ + if (!checking::is_empty(low, up)) { + if (up < r.low) return true; + else if (low >= r.up) return false; + } + throw interval_lib::comparison_error(); +} + +template inline +bool interval::operator> (const interval_holder& r) const +{ + if (!checking::is_empty(low, up)) { + if (low > r.up) return true; + else if (up <= r.low) return false; + } + throw interval_lib::comparison_error(); +} + +template inline +bool interval::operator<= (const interval_holder& r) const +{ + if (!checking::is_empty(low, up)) { + if (up <= r.low) return true; + else if (low > r.up) return false; + } + throw interval_lib::comparison_error(); +} + +template inline +bool interval::operator>= (const interval_holder& r) const +{ + if (!checking::is_empty(low, up)) { + if (low >= r.up) return true; + else if (up < r.low) return false; + } + throw interval_lib::comparison_error(); +} + +template inline +bool interval::operator== (const interval_holder& r) const +{ + if (!checking::is_empty(low, up)) { + if (up == r.low && low == r.up) return true; + else if (up < r.low || low > r.up) return false; + } + throw interval_lib::comparison_error(); +} + +template inline +bool interval::operator!= (const interval_holder& r) const +{ + if (!checking::is_empty(low, up)) { + if (up < r.low || low > r.up) return true; + else if (up == r.low && low == r.up) return false; + } + throw interval_lib::comparison_error(); +} + +/* + * interval/number comparisons + */ + +template inline +bool interval::operator< (const number_holder& r) const +{ + if (!checking::is_empty(low, up)) { + if (up < r.val) return true; + else if (low >= r.val) return false; + } + throw interval_lib::comparison_error(); +} + +template inline +bool interval::operator> (const number_holder& r) const +{ + if (!checking::is_empty(low, up)) { + if (low > r.val) return true; + else if (up <= r.val) return false; + } + throw interval_lib::comparison_error(); +} + +template inline +bool interval::operator<= (const number_holder& r) const +{ + if (!checking::is_empty(low, up)) { + if (up <= r.val) return true; + else if (low > r.val) return false; + } + throw interval_lib::comparison_error(); +} + +template inline +bool interval::operator>= (const number_holder& r) const +{ + if (!checking::is_empty(low, up)) { + if (low >= r.val) return true; + else if (up < r.val) return false; + } + throw interval_lib::comparison_error(); +} + +template inline +bool interval::operator== (const number_holder& r) const +{ + if (!checking::is_empty(low, up)) { + if (up == r.val && low == r.val) return true; + else if (up < r.val || low > r.val) return false; + } + throw interval_lib::comparison_error(); +} + +template inline +bool interval::operator!= (const number_holder& r) const +{ + if (!checking::is_empty(low, up)) { + if (up < r.val || low > r.val) return true; + else if (up == r.val && low == r.val) return false; + } + throw interval_lib::comparison_error(); +} + +} // namespace numeric +} // namespace boost + +#endif // BOOST_NUMERIC_INTERVAL_INTERVAL_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/io.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/io.hpp new file mode 100644 index 000000000..dc4179e52 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/io.hpp @@ -0,0 +1,41 @@ +/* Boost interval/io.hpp header file + * + * This file is only meant to provide a quick + * implementation of the output operator. It is + * provided for test programs that aren't even + * interested in the precision of the results. + * A real progam should define its own operators + * and never include this header. + * + * Copyright 2003 Guillaume Melquiond + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_IO_HPP +#define BOOST_NUMERIC_INTERVAL_IO_HPP + +#include +#include +#include + +namespace boost { +namespace numeric { + +template +std::basic_ostream &operator<< + (std::basic_ostream &stream, + interval const &value) +{ + if (empty(value)) + return stream << "[]"; + else + return stream << '[' << lower(value) << ',' << upper(value) << ']'; +} + +} // namespace numeric +} // namespace boost + +#endif // BOOST_NUMERIC_INTERVAL_IO_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/limits.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/limits.hpp new file mode 100644 index 000000000..d691ccee2 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/limits.hpp @@ -0,0 +1,51 @@ +/* Boost interval/limits.hpp template implementation file + * + * Copyright 2000 Jens Maurer + * Copyright 2002-2003 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_LIMITS_HPP +#define BOOST_NUMERIC_INTERVAL_LIMITS_HPP + +#ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION + +#include +#include +#include + +namespace std { + +template +class numeric_limits > + : public numeric_limits +{ +private: + typedef boost::numeric::interval I; + typedef numeric_limits bl; +public: + static I min BOOST_PREVENT_MACRO_SUBSTITUTION () throw() { return I((bl::min)(), (bl::min)()); } + static I max BOOST_PREVENT_MACRO_SUBSTITUTION () throw() { return I((bl::max)(), (bl::max)()); } + static I epsilon() throw() { return I(bl::epsilon(), bl::epsilon()); } + + BOOST_STATIC_CONSTANT(float_round_style, round_style = round_indeterminate); + BOOST_STATIC_CONSTANT(bool, is_iec559 = false); + + static I infinity () throw() { return I::whole(); } + static I quiet_NaN() throw() { return I::empty(); } + static I signaling_NaN() throw() + { return I(bl::signaling_NaN(), bl::signaling_Nan()); } + static I denorm_min() throw() + { return I(bl::denorm_min(), bl::denorm_min()); } +private: + static I round_error(); // hide this on purpose, not yet implemented +}; + +} // namespace std + +#endif + +#endif // BOOST_NUMERIC_INTERVAL_LIMITS_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/policies.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/policies.hpp new file mode 100644 index 000000000..70ad220d9 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/policies.hpp @@ -0,0 +1,75 @@ +/* Boost interval/policies.hpp template implementation file + * + * Copyright 2003 Guillaume Melquiond + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_POLICIES_HPP +#define BOOST_NUMERIC_INTERVAL_POLICIES_HPP + +#include + +namespace boost { +namespace numeric { +namespace interval_lib { + +/* + * policies class + */ + +template +struct policies +{ + typedef Rounding rounding; + typedef Checking checking; +}; + +/* + * policies switching classes + */ + +template +class change_rounding +{ + typedef typename OldInterval::base_type T; + typedef typename OldInterval::traits_type p; + typedef typename p::checking checking; +public: + typedef interval > type; +}; + +template +class change_checking +{ + typedef typename OldInterval::base_type T; + typedef typename OldInterval::traits_type p; + typedef typename p::rounding rounding; +public: + typedef interval > type; +}; + +/* + * Protect / unprotect: control whether the rounding mode is set/reset + * at each operation, rather than once and for all. + */ + +template +class unprotect +{ + typedef typename OldInterval::base_type T; + typedef typename OldInterval::traits_type p; + typedef typename p::rounding r; + typedef typename r::unprotected_rounding newRounding; +public: + typedef typename change_rounding::type type; +}; + +} // namespace interval_lib +} // namespace numeric +} // namespace boost + + +#endif // BOOST_NUMERIC_INTERVAL_POLICIES_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/rounded_arith.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/rounded_arith.hpp new file mode 100644 index 000000000..6ce5c7f7e --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/rounded_arith.hpp @@ -0,0 +1,120 @@ +/* Boost interval/rounded_arith.hpp template implementation file + * + * Copyright 2002-2003 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_ROUNDED_ARITH_HPP +#define BOOST_NUMERIC_INTERVAL_ROUNDED_ARITH_HPP + +#include +#include +#include + +namespace boost { +namespace numeric { +namespace interval_lib { + +/* + * Three classes of rounding: exact, std, opp + * See documentation for details. + */ + +template +struct rounded_arith_exact: Rounding { + void init() { } + template T conv_down(U const &v) { return v; } + template T conv_up (U const &v) { return v; } + T add_down (const T& x, const T& y) { return x + y; } + T add_up (const T& x, const T& y) { return x + y; } + T sub_down (const T& x, const T& y) { return x - y; } + T sub_up (const T& x, const T& y) { return x - y; } + T mul_down (const T& x, const T& y) { return x * y; } + T mul_up (const T& x, const T& y) { return x * y; } + T div_down (const T& x, const T& y) { return x / y; } + T div_up (const T& x, const T& y) { return x / y; } + T median (const T& x, const T& y) { return (x + y) / 2; } + T sqrt_down(const T& x) + { BOOST_NUMERIC_INTERVAL_using_math(sqrt); return sqrt(x); } + T sqrt_up (const T& x) + { BOOST_NUMERIC_INTERVAL_using_math(sqrt); return sqrt(x); } + T int_down (const T& x) + { BOOST_NUMERIC_INTERVAL_using_math(floor); return floor(x); } + T int_up (const T& x) + { BOOST_NUMERIC_INTERVAL_using_math(ceil); return ceil(x); } +}; + +template +struct rounded_arith_std: Rounding { +# define BOOST_DN(EXPR) this->downward(); return this->force_rounding(EXPR) +# define BOOST_NR(EXPR) this->to_nearest(); return this->force_rounding(EXPR) +# define BOOST_UP(EXPR) this->upward(); return this->force_rounding(EXPR) + void init() { } + template T conv_down(U const &v) { BOOST_DN(v); } + template T conv_up (U const &v) { BOOST_UP(v); } + T add_down(const T& x, const T& y) { BOOST_DN(x + y); } + T sub_down(const T& x, const T& y) { BOOST_DN(x - y); } + T mul_down(const T& x, const T& y) { BOOST_DN(x * y); } + T div_down(const T& x, const T& y) { BOOST_DN(x / y); } + T add_up (const T& x, const T& y) { BOOST_UP(x + y); } + T sub_up (const T& x, const T& y) { BOOST_UP(x - y); } + T mul_up (const T& x, const T& y) { BOOST_UP(x * y); } + T div_up (const T& x, const T& y) { BOOST_UP(x / y); } + T median(const T& x, const T& y) { BOOST_NR((x + y) / 2); } + T sqrt_down(const T& x) + { BOOST_NUMERIC_INTERVAL_using_math(sqrt); BOOST_DN(sqrt(x)); } + T sqrt_up (const T& x) + { BOOST_NUMERIC_INTERVAL_using_math(sqrt); BOOST_UP(sqrt(x)); } + T int_down(const T& x) { this->downward(); return to_int(x); } + T int_up (const T& x) { this->upward(); return to_int(x); } +# undef BOOST_DN +# undef BOOST_NR +# undef BOOST_UP +}; + +template +struct rounded_arith_opp: Rounding { + void init() { this->upward(); } +# define BOOST_DN(EXPR) \ + this->downward(); \ + T r = this->force_rounding(EXPR); \ + this->upward(); \ + return r +# define BOOST_NR(EXPR) \ + this->to_nearest(); \ + T r = this->force_rounding(EXPR); \ + this->upward(); \ + return r +# define BOOST_UP(EXPR) return this->force_rounding(EXPR) +# define BOOST_UP_NEG(EXPR) return -this->force_rounding(EXPR) + template T conv_down(U const &v) { BOOST_UP_NEG(-v); } + template T conv_up (U const &v) { BOOST_UP(v); } + T add_down(const T& x, const T& y) { BOOST_UP_NEG((-x) - y); } + T sub_down(const T& x, const T& y) { BOOST_UP_NEG(y - x); } + T mul_down(const T& x, const T& y) { BOOST_UP_NEG(x * (-y)); } + T div_down(const T& x, const T& y) { BOOST_UP_NEG(x / (-y)); } + T add_up (const T& x, const T& y) { BOOST_UP(x + y); } + T sub_up (const T& x, const T& y) { BOOST_UP(x - y); } + T mul_up (const T& x, const T& y) { BOOST_UP(x * y); } + T div_up (const T& x, const T& y) { BOOST_UP(x / y); } + T median (const T& x, const T& y) { BOOST_NR((x + y) / 2); } + T sqrt_down(const T& x) + { BOOST_NUMERIC_INTERVAL_using_math(sqrt); BOOST_DN(sqrt(x)); } + T sqrt_up (const T& x) + { BOOST_NUMERIC_INTERVAL_using_math(sqrt); BOOST_UP(sqrt(x)); } + T int_down(const T& x) { return -to_int(-x); } + T int_up (const T& x) { return to_int(x); } +# undef BOOST_DN +# undef BOOST_NR +# undef BOOST_UP +# undef BOOST_UP_NEG +}; + +} // namespace interval_lib +} // namespace numeric +} // namespace boost + +#endif // BOOST_NUMERIC_INTERVAL_ROUNDED_ARITH_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/rounded_transc.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/rounded_transc.hpp new file mode 100644 index 000000000..e1704f5f2 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/rounded_transc.hpp @@ -0,0 +1,140 @@ +/* Boost interval/rounded_transc.hpp template implementation file + * + * Copyright 2002-2003 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_ROUNDED_TRANSC_HPP +#define BOOST_NUMERIC_INTERVAL_ROUNDED_TRANSC_HPP + +#include +#include +#include + +namespace boost { +namespace numeric { +namespace interval_lib { + +template +struct rounded_transc_exact: Rounding +{ +# define BOOST_NUMERIC_INTERVAL_new_func(f) \ + T f##_down(const T& x) { BOOST_NUMERIC_INTERVAL_using_math(f); return f(x); } \ + T f##_up (const T& x) { BOOST_NUMERIC_INTERVAL_using_math(f); return f(x); } + BOOST_NUMERIC_INTERVAL_new_func(exp) + BOOST_NUMERIC_INTERVAL_new_func(log) + BOOST_NUMERIC_INTERVAL_new_func(sin) + BOOST_NUMERIC_INTERVAL_new_func(cos) + BOOST_NUMERIC_INTERVAL_new_func(tan) + BOOST_NUMERIC_INTERVAL_new_func(asin) + BOOST_NUMERIC_INTERVAL_new_func(acos) + BOOST_NUMERIC_INTERVAL_new_func(atan) + BOOST_NUMERIC_INTERVAL_new_func(sinh) + BOOST_NUMERIC_INTERVAL_new_func(cosh) + BOOST_NUMERIC_INTERVAL_new_func(tanh) +# undef BOOST_NUMERIC_INTERVAL_new_func +# define BOOST_NUMERIC_INTERVAL_new_func(f) \ + T f##_down(const T& x) { BOOST_NUMERIC_INTERVAL_using_ahyp(f); return f(x); } \ + T f##_up (const T& x) { BOOST_NUMERIC_INTERVAL_using_ahyp(f); return f(x); } + BOOST_NUMERIC_INTERVAL_new_func(asinh) + BOOST_NUMERIC_INTERVAL_new_func(acosh) + BOOST_NUMERIC_INTERVAL_new_func(atanh) +# undef BOOST_NUMERIC_INTERVAL_new_func +}; + +template +struct rounded_transc_std: Rounding +{ +# define BOOST_NUMERIC_INTERVAL_new_func(f) \ + T f##_down(const T& x) \ + { BOOST_NUMERIC_INTERVAL_using_math(f); \ + this->downward(); return this->force_rounding(f(x)); } \ + T f##_up (const T& x) \ + { BOOST_NUMERIC_INTERVAL_using_math(f); \ + this->upward(); return this->force_rounding(f(x)); } + BOOST_NUMERIC_INTERVAL_new_func(exp) + BOOST_NUMERIC_INTERVAL_new_func(log) + BOOST_NUMERIC_INTERVAL_new_func(sin) + BOOST_NUMERIC_INTERVAL_new_func(cos) + BOOST_NUMERIC_INTERVAL_new_func(tan) + BOOST_NUMERIC_INTERVAL_new_func(asin) + BOOST_NUMERIC_INTERVAL_new_func(acos) + BOOST_NUMERIC_INTERVAL_new_func(atan) + BOOST_NUMERIC_INTERVAL_new_func(sinh) + BOOST_NUMERIC_INTERVAL_new_func(cosh) + BOOST_NUMERIC_INTERVAL_new_func(tanh) +# undef BOOST_NUMERIC_INTERVAL_new_func +# define BOOST_NUMERIC_INTERVAL_new_func(f) \ + T f##_down(const T& x) \ + { BOOST_NUMERIC_INTERVAL_using_ahyp(f); \ + this->downward(); return this->force_rounding(f(x)); } \ + T f##_up (const T& x) \ + { BOOST_NUMERIC_INTERVAL_using_ahyp(f); \ + this->upward(); return this->force_rounding(f(x)); } + BOOST_NUMERIC_INTERVAL_new_func(asinh) + BOOST_NUMERIC_INTERVAL_new_func(acosh) + BOOST_NUMERIC_INTERVAL_new_func(atanh) +# undef BOOST_NUMERIC_INTERVAL_new_func +}; + +template +struct rounded_transc_opp: Rounding +{ +# define BOOST_NUMERIC_INTERVAL_new_func(f) \ + T f##_down(const T& x) \ + { BOOST_NUMERIC_INTERVAL_using_math(f); \ + this->downward(); T y = this->force_rounding(f(x)); \ + this->upward(); return y; } \ + T f##_up (const T& x) \ + { BOOST_NUMERIC_INTERVAL_using_math(f); \ + return this->force_rounding(f(x)); } + BOOST_NUMERIC_INTERVAL_new_func(exp) + BOOST_NUMERIC_INTERVAL_new_func(log) + BOOST_NUMERIC_INTERVAL_new_func(cos) + BOOST_NUMERIC_INTERVAL_new_func(acos) + BOOST_NUMERIC_INTERVAL_new_func(cosh) +# undef BOOST_NUMERIC_INTERVAL_new_func +# define BOOST_NUMERIC_INTERVAL_new_func(f) \ + T f##_down(const T& x) \ + { BOOST_NUMERIC_INTERVAL_using_math(f); \ + return -this->force_rounding(-f(x)); } \ + T f##_up (const T& x) \ + { BOOST_NUMERIC_INTERVAL_using_math(f); \ + return this->force_rounding(f(x)); } + BOOST_NUMERIC_INTERVAL_new_func(sin) + BOOST_NUMERIC_INTERVAL_new_func(tan) + BOOST_NUMERIC_INTERVAL_new_func(asin) + BOOST_NUMERIC_INTERVAL_new_func(atan) + BOOST_NUMERIC_INTERVAL_new_func(sinh) + BOOST_NUMERIC_INTERVAL_new_func(tanh) +# undef BOOST_NUMERIC_INTERVAL_new_func +# define BOOST_NUMERIC_INTERVAL_new_func(f) \ + T f##_down(const T& x) \ + { BOOST_NUMERIC_INTERVAL_using_ahyp(f); \ + this->downward(); T y = this->force_rounding(f(x)); \ + this->upward(); return y; } \ + T f##_up (const T& x) \ + { BOOST_NUMERIC_INTERVAL_using_ahyp(f); \ + return this->force_rounding(f(x)); } + BOOST_NUMERIC_INTERVAL_new_func(asinh) + BOOST_NUMERIC_INTERVAL_new_func(atanh) +# undef BOOST_NUMERIC_INTERVAL_new_func +# define BOOST_NUMERIC_INTERVAL_new_func(f) \ + T f##_down(const T& x) \ + { BOOST_NUMERIC_INTERVAL_using_ahyp(f); \ + return -this->force_rounding(-f(x)); } \ + T f##_up (const T& x) \ + { BOOST_NUMERIC_INTERVAL_using_ahyp(f); \ + return this->force_rounding(f(x)); } + BOOST_NUMERIC_INTERVAL_new_func(acosh) +# undef BOOST_NUMERIC_INTERVAL_new_func +}; + +} // namespace interval_lib +} // namespace numeric +} // namespace boost + +#endif // BOOST_NUMERIC_INTERVAL_ROUNDED_TRANSC_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/rounding.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/rounding.hpp new file mode 100644 index 000000000..f69e2e4b5 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/rounding.hpp @@ -0,0 +1,101 @@ +/* Boost interval/rounding.hpp template implementation file + * + * Copyright 2002-2003 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_ROUNDING_HPP +#define BOOST_NUMERIC_INTERVAL_ROUNDING_HPP + +namespace boost { +namespace numeric { +namespace interval_lib { + +/* + * Default rounding_control class (does nothing) + */ + +template +struct rounding_control +{ + typedef int rounding_mode; + static void get_rounding_mode(rounding_mode&) {} + static void set_rounding_mode(rounding_mode) {} + static void upward() {} + static void downward() {} + static void to_nearest() {} + static const T& to_int(const T& x) { return x; } + static const T& force_rounding(const T& x) { return x; } +}; + +/* + * A few rounding control classes (exact/std/opp: see documentation) + * rounded_arith_* control the rounding of the arithmetic operators + * rounded_transc_* control the rounding of the transcendental functions + */ + +template > +struct rounded_arith_exact; + +template > +struct rounded_arith_std; + +template > +struct rounded_arith_opp; + +template +struct rounded_transc_dummy; + +template > +struct rounded_transc_exact; + +template > +struct rounded_transc_std; + +template > +struct rounded_transc_opp; + +/* + * State-saving classes: allow to set and reset rounding control + */ + +namespace detail { + +template +struct save_state_unprotected: Rounding +{ + typedef save_state_unprotected unprotected_rounding; +}; + +} // namespace detail + +template +struct save_state: Rounding +{ + typename Rounding::rounding_mode mode; + save_state() { + this->get_rounding_mode(mode); + this->init(); + } + ~save_state() { this->set_rounding_mode(mode); } + typedef detail::save_state_unprotected unprotected_rounding; +}; + +template +struct save_state_nothing: Rounding +{ + typedef save_state_nothing unprotected_rounding; +}; + +template +struct rounded_math: save_state_nothing > +{}; + +} // namespace interval_lib +} // namespace numeric +} // namespace boost + +#endif // BOOST_NUMERIC_INTERVAL_ROUNDING_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/transc.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/transc.hpp new file mode 100644 index 000000000..88aebd6b3 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/transc.hpp @@ -0,0 +1,232 @@ +/* Boost interval/transc.hpp template implementation file + * + * Copyright 2000 Jens Maurer + * Copyright 2002 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_TRANSC_HPP +#define BOOST_NUMERIC_INTERVAL_TRANSC_HPP + +#include +#include +#include +#include +#include +#include +#include +#include +#include + +namespace boost { +namespace numeric { + +template inline +interval exp(const interval& x) +{ + typedef interval I; + if (interval_lib::detail::test_input(x)) + return I::empty(); + typename Policies::rounding rnd; + return I(rnd.exp_down(x.lower()), rnd.exp_up(x.upper()), true); +} + +template inline +interval log(const interval& x) +{ + typedef interval I; + if (interval_lib::detail::test_input(x) || + !interval_lib::user::is_pos(x.upper())) + return I::empty(); + typename Policies::rounding rnd; + typedef typename Policies::checking checking; + T l = !interval_lib::user::is_pos(x.lower()) + ? checking::neg_inf() : rnd.log_down(x.lower()); + return I(l, rnd.log_up(x.upper()), true); +} + +template inline +interval cos(const interval& x) +{ + if (interval_lib::detail::test_input(x)) + return interval::empty(); + typename Policies::rounding rnd; + typedef interval I; + typedef typename interval_lib::unprotect::type R; + + // get lower bound within [0, pi] + const R pi2 = interval_lib::pi_twice(); + R tmp = fmod((const R&)x, pi2); + if (width(tmp) >= pi2.lower()) + return I(static_cast(-1), static_cast(1), true); // we are covering a full period + if (tmp.lower() >= interval_lib::constants::pi_upper()) + return -cos(tmp - interval_lib::pi()); + T l = tmp.lower(); + T u = tmp.upper(); + + BOOST_USING_STD_MIN(); + // separate into monotone subintervals + if (u <= interval_lib::constants::pi_lower()) + return I(rnd.cos_down(u), rnd.cos_up(l), true); + else if (u <= pi2.lower()) + return I(static_cast(-1), rnd.cos_up(min BOOST_PREVENT_MACRO_SUBSTITUTION(rnd.sub_down(pi2.lower(), u), l)), true); + else + return I(static_cast(-1), static_cast(1), true); +} + +template inline +interval sin(const interval& x) +{ + typedef interval I; + if (interval_lib::detail::test_input(x)) + return I::empty(); + typename Policies::rounding rnd; + typedef typename interval_lib::unprotect::type R; + I r = cos((const R&)x - interval_lib::pi_half()); + (void)&rnd; + return r; +} + +template inline +interval tan(const interval& x) +{ + typedef interval I; + if (interval_lib::detail::test_input(x)) + return I::empty(); + typename Policies::rounding rnd; + typedef typename interval_lib::unprotect::type R; + + // get lower bound within [-pi/2, pi/2] + const R pi = interval_lib::pi(); + R tmp = fmod((const R&)x, pi); + const T pi_half_d = interval_lib::constants::pi_half_lower(); + if (tmp.lower() >= pi_half_d) + tmp -= pi; + if (tmp.lower() <= -pi_half_d || tmp.upper() >= pi_half_d) + return I::whole(); + return I(rnd.tan_down(tmp.lower()), rnd.tan_up(tmp.upper()), true); +} + +template inline +interval asin(const interval& x) +{ + typedef interval I; + if (interval_lib::detail::test_input(x) + || x.upper() < static_cast(-1) || x.lower() > static_cast(1)) + return I::empty(); + typename Policies::rounding rnd; + T l = (x.lower() <= static_cast(-1)) + ? -interval_lib::constants::pi_half_upper() + : rnd.asin_down(x.lower()); + T u = (x.upper() >= static_cast(1) ) + ? interval_lib::constants::pi_half_upper() + : rnd.asin_up (x.upper()); + return I(l, u, true); +} + +template inline +interval acos(const interval& x) +{ + typedef interval I; + if (interval_lib::detail::test_input(x) + || x.upper() < static_cast(-1) || x.lower() > static_cast(1)) + return I::empty(); + typename Policies::rounding rnd; + T l = (x.upper() >= static_cast(1) ) + ? static_cast(0) + : rnd.acos_down(x.upper()); + T u = (x.lower() <= static_cast(-1)) + ? interval_lib::constants::pi_upper() + : rnd.acos_up (x.lower()); + return I(l, u, true); +} + +template inline +interval atan(const interval& x) +{ + typedef interval I; + if (interval_lib::detail::test_input(x)) + return I::empty(); + typename Policies::rounding rnd; + return I(rnd.atan_down(x.lower()), rnd.atan_up(x.upper()), true); +} + +template inline +interval sinh(const interval& x) +{ + typedef interval I; + if (interval_lib::detail::test_input(x)) + return I::empty(); + typename Policies::rounding rnd; + return I(rnd.sinh_down(x.lower()), rnd.sinh_up(x.upper()), true); +} + +template inline +interval cosh(const interval& x) +{ + typedef interval I; + if (interval_lib::detail::test_input(x)) + return I::empty(); + typename Policies::rounding rnd; + if (interval_lib::user::is_neg(x.upper())) + return I(rnd.cosh_down(x.upper()), rnd.cosh_up(x.lower()), true); + else if (!interval_lib::user::is_neg(x.lower())) + return I(rnd.cosh_down(x.lower()), rnd.cosh_up(x.upper()), true); + else + return I(static_cast(0), rnd.cosh_up(-x.lower() > x.upper() ? x.lower() : x.upper()), true); +} + +template inline +interval tanh(const interval& x) +{ + typedef interval I; + if (interval_lib::detail::test_input(x)) + return I::empty(); + typename Policies::rounding rnd; + return I(rnd.tanh_down(x.lower()), rnd.tanh_up(x.upper()), true); +} + +template inline +interval asinh(const interval& x) +{ + typedef interval I; + if (interval_lib::detail::test_input(x)) + return I::empty(); + typename Policies::rounding rnd; + return I(rnd.asinh_down(x.lower()), rnd.asinh_up(x.upper()), true); +} + +template inline +interval acosh(const interval& x) +{ + typedef interval I; + if (interval_lib::detail::test_input(x) || x.upper() < static_cast(1)) + return I::empty(); + typename Policies::rounding rnd; + T l = x.lower() <= static_cast(1) ? static_cast(0) : rnd.acosh_down(x.lower()); + return I(l, rnd.acosh_up(x.upper()), true); +} + +template inline +interval atanh(const interval& x) +{ + typedef interval I; + if (interval_lib::detail::test_input(x) + || x.upper() < static_cast(-1) || x.lower() > static_cast(1)) + return I::empty(); + typename Policies::rounding rnd; + typedef typename Policies::checking checking; + T l = (x.lower() <= static_cast(-1)) + ? checking::neg_inf() : rnd.atanh_down(x.lower()); + T u = (x.upper() >= static_cast(1) ) + ? checking::pos_inf() : rnd.atanh_up (x.upper()); + return I(l, u, true); +} + +} // namespace numeric +} // namespace boost + +#endif // BOOST_NUMERIC_INTERVAL_TRANSC_HPP diff --git a/trunk/paradiseo-eo/contrib/boost/numeric/interval/utility.hpp b/trunk/paradiseo-eo/contrib/boost/numeric/interval/utility.hpp new file mode 100644 index 000000000..d24d84d7a --- /dev/null +++ b/trunk/paradiseo-eo/contrib/boost/numeric/interval/utility.hpp @@ -0,0 +1,331 @@ +/* Boost interval/utility.hpp template implementation file + * + * Copyright 2000 Jens Maurer + * Copyright 2002-2003 Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion + * + * Distributed under the Boost Software License, Version 1.0. + * (See accompanying file LICENSE_1_0.txt or + * copy at http://www.boost.org/LICENSE_1_0.txt) + */ + +#ifndef BOOST_NUMERIC_INTERVAL_UTILITY_HPP +#define BOOST_NUMERIC_INTERVAL_UTILITY_HPP + +#include +#include +#include +#include +#include +#include + +/* + * Implementation of simple functions + */ + +namespace boost { +namespace numeric { + +/* + * Utility Functions + */ + +template inline +const T& lower(const interval& x) +{ + return x.lower(); +} + +template inline +const T& upper(const interval& x) +{ + return x.upper(); +} + +template inline +T checked_lower(const interval& x) +{ + if (empty(x)) { + typedef typename Policies::checking checking; + return checking::nan(); + } + return x.lower(); +} + +template inline +T checked_upper(const interval& x) +{ + if (empty(x)) { + typedef typename Policies::checking checking; + return checking::nan(); + } + return x.upper(); +} + +template inline +T width(const interval& x) +{ + if (interval_lib::detail::test_input(x)) return static_cast(0); + typename Policies::rounding rnd; + return rnd.sub_up(x.upper(), x.lower()); +} + +template inline +T median(const interval& x) +{ + if (interval_lib::detail::test_input(x)) { + typedef typename Policies::checking checking; + return checking::nan(); + } + typename Policies::rounding rnd; + return rnd.median(x.lower(), x.upper()); +} + +template inline +interval widen(const interval& x, const T& v) +{ + if (interval_lib::detail::test_input(x)) + return interval::empty(); + typename Policies::rounding rnd; + return interval(rnd.sub_down(x.lower(), v), + rnd.add_up (x.upper(), v), true); +} + +/* + * Set-like operations + */ + +template inline +bool empty(const interval& x) +{ + return interval_lib::detail::test_input(x); +} + +template inline +bool in_zero(const interval& x) +{ + if (interval_lib::detail::test_input(x)) return false; + return (!interval_lib::user::is_pos(x.lower())) && + (!interval_lib::user::is_neg(x.upper())); +} + +template inline +bool in(const T& x, const interval& y) +{ + if (interval_lib::detail::test_input(x, y)) return false; + return y.lower() <= x && x <= y.upper(); +} + +template inline +bool subset(const interval& x, + const interval& y) +{ + if (empty(x)) return true; + return !empty(y) && y.lower() <= x.lower() && x.upper() <= y.upper(); +} + +template inline +bool proper_subset(const interval& x, + const interval& y) +{ + if (empty(y)) return false; + if (empty(x)) return true; + return y.lower() <= x.lower() && x.upper() <= y.upper() && + (y.lower() != x.lower() || x.upper() != y.upper()); +} + +template inline +bool overlap(const interval& x, + const interval& y) +{ + if (interval_lib::detail::test_input(x, y)) return false; + return x.lower() <= y.lower() && y.lower() <= x.upper() || + y.lower() <= x.lower() && x.lower() <= y.upper(); +} + +template inline +bool singleton(const interval& x) +{ + return !empty(x) && x.lower() == x.upper(); +} + +template inline +bool equal(const interval& x, const interval& y) +{ + if (empty(x)) return empty(y); + return !empty(y) && x.lower() == y.lower() && x.upper() == y.upper(); +} + +template inline +interval intersect(const interval& x, + const interval& y) +{ + BOOST_USING_STD_MIN(); + BOOST_USING_STD_MAX(); + if (interval_lib::detail::test_input(x, y)) + return interval::empty(); + const T& l = max BOOST_PREVENT_MACRO_SUBSTITUTION(x.lower(), y.lower()); + const T& u = min BOOST_PREVENT_MACRO_SUBSTITUTION(x.upper(), y.upper()); + if (l <= u) return interval(l, u, true); + else return interval::empty(); +} + +template inline +interval hull(const interval& x, + const interval& y) +{ + BOOST_USING_STD_MIN(); + BOOST_USING_STD_MAX(); + bool bad_x = interval_lib::detail::test_input(x); + bool bad_y = interval_lib::detail::test_input(y); + if (bad_x) + if (bad_y) return interval::empty(); + else return y; + else + if (bad_y) return x; + return interval(min BOOST_PREVENT_MACRO_SUBSTITUTION(x.lower(), y.lower()), + max BOOST_PREVENT_MACRO_SUBSTITUTION(x.upper(), y.upper()), true); +} + +template inline +interval hull(const interval& x, const T& y) +{ + BOOST_USING_STD_MIN(); + BOOST_USING_STD_MAX(); + bool bad_x = interval_lib::detail::test_input(x); + bool bad_y = interval_lib::detail::test_input(y); + if (bad_y) + if (bad_x) return interval::empty(); + else return x; + else + if (bad_x) return interval(y, y, true); + return interval(min BOOST_PREVENT_MACRO_SUBSTITUTION(x.lower(), y), + max BOOST_PREVENT_MACRO_SUBSTITUTION(x.upper(), y), true); +} + +template inline +interval hull(const T& x, const interval& y) +{ + BOOST_USING_STD_MIN(); + BOOST_USING_STD_MAX(); + bool bad_x = interval_lib::detail::test_input(x); + bool bad_y = interval_lib::detail::test_input(y); + if (bad_x) + if (bad_y) return interval::empty(); + else return y; + else + if (bad_y) return interval(x, x, true); + return interval(min BOOST_PREVENT_MACRO_SUBSTITUTION(x, y.lower()), + max BOOST_PREVENT_MACRO_SUBSTITUTION(x, y.upper()), true); +} + +template inline +interval hull(const T& x, const T& y) +{ + return interval::hull(x, y); +} + +template inline +std::pair, interval > +bisect(const interval& x) +{ + typedef interval I; + if (interval_lib::detail::test_input(x)) + return std::pair(I::empty(), I::empty()); + const T m = median(x); + return std::pair(I(x.lower(), m, true), I(m, x.upper(), true)); +} + +/* + * Elementary functions + */ + +template inline +T norm(const interval& x) +{ + typedef interval I; + if (interval_lib::detail::test_input(x)) { + typedef typename Policies::checking checking; + return checking::nan(); + } + BOOST_USING_STD_MAX(); + return max BOOST_PREVENT_MACRO_SUBSTITUTION(-x.lower(), x.upper()); +} + +template inline +interval abs(const interval& x) +{ + typedef interval I; + if (interval_lib::detail::test_input(x)) + return I::empty(); + if (!interval_lib::user::is_neg(x.lower())) return x; + if (!interval_lib::user::is_pos(x.upper())) return -x; + BOOST_USING_STD_MAX(); + return I(static_cast(0), max BOOST_PREVENT_MACRO_SUBSTITUTION(-x.lower(), x.upper()), true); +} + +template inline +interval max BOOST_PREVENT_MACRO_SUBSTITUTION (const interval& x, + const interval& y) +{ + typedef interval I; + if (interval_lib::detail::test_input(x, y)) + return I::empty(); + BOOST_USING_STD_MAX(); + return I(max BOOST_PREVENT_MACRO_SUBSTITUTION(x.lower(), y.lower()), max BOOST_PREVENT_MACRO_SUBSTITUTION(x.upper(), y.upper()), true); +} + +template inline +interval max BOOST_PREVENT_MACRO_SUBSTITUTION (const interval& x, const T& y) +{ + typedef interval I; + if (interval_lib::detail::test_input(x, y)) + return I::empty(); + BOOST_USING_STD_MAX(); + return I(max BOOST_PREVENT_MACRO_SUBSTITUTION(x.lower(), y), max BOOST_PREVENT_MACRO_SUBSTITUTION(x.upper(), y), true); +} + +template inline +interval max BOOST_PREVENT_MACRO_SUBSTITUTION (const T& x, const interval& y) +{ + typedef interval I; + if (interval_lib::detail::test_input(x, y)) + return I::empty(); + BOOST_USING_STD_MAX(); + return I(max BOOST_PREVENT_MACRO_SUBSTITUTION(x, y.lower()), max BOOST_PREVENT_MACRO_SUBSTITUTION(x, y.upper()), true); +} + +template inline +interval min BOOST_PREVENT_MACRO_SUBSTITUTION (const interval& x, + const interval& y) +{ + typedef interval I; + if (interval_lib::detail::test_input(x, y)) + return I::empty(); + BOOST_USING_STD_MIN(); + return I(min BOOST_PREVENT_MACRO_SUBSTITUTION(x.lower(), y.lower()), min BOOST_PREVENT_MACRO_SUBSTITUTION(x.upper(), y.upper()), true); +} + +template inline +interval min BOOST_PREVENT_MACRO_SUBSTITUTION (const interval& x, const T& y) +{ + typedef interval I; + if (interval_lib::detail::test_input(x, y)) + return I::empty(); + BOOST_USING_STD_MIN(); + return I(min BOOST_PREVENT_MACRO_SUBSTITUTION(x.lower(), y), min BOOST_PREVENT_MACRO_SUBSTITUTION(x.upper(), y), true); +} + +template inline +interval min BOOST_PREVENT_MACRO_SUBSTITUTION (const T& x, const interval& y) +{ + typedef interval I; + if (interval_lib::detail::test_input(x, y)) + return I::empty(); + BOOST_USING_STD_MIN(); + return I(min BOOST_PREVENT_MACRO_SUBSTITUTION(x, y.lower()), min BOOST_PREVENT_MACRO_SUBSTITUTION(x, y.upper()), true); +} + +} // namespace numeric +} // namespace boost + +#endif // BOOST_NUMERIC_INTERVAL_UTILITY_HPP diff --git a/trunk/paradiseo-eo/contrib/eoAged.h b/trunk/paradiseo-eo/contrib/eoAged.h new file mode 100644 index 000000000..c4c02fc3f --- /dev/null +++ b/trunk/paradiseo-eo/contrib/eoAged.h @@ -0,0 +1,109 @@ +// eoAged.h +// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- + +//----------------------------------------------------------------------------- +// eoAge.h +// (c) GeNeura Team, 1998 +/* + This library is free software; you can redistribute it and/or + modify it under the terms of the GNU Lesser General Public + License as published by the Free Software Foundation; either + version 2 of the License, or (at your option) any later version. + + This library is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + Lesser General Public License for more details. + + You should have received a copy of the GNU Lesser General Public + License along with this library; if not, write to the Free Software + Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + + Contact: todos@geneura.ugr.es, http://geneura.ugr.es + */ +//----------------------------------------------------------------------------- + +#ifndef EOAGED_H +#define EOAGED_H + +//----------------------------------------------------------------------------- + +#include // istream, ostream +#include // para std::string + +using namespace std; + +//----------------------------------------------------------------------------- +// eoAge +//----------------------------------------------------------------------------- + +/** eoAge is a template class that adds an age to an object.\\ +Requisites for template instantiation are that the object must admit a default ctor +and a copy ctor. The Object must be an eoObject, thus, it must have its methods: className, +printOn, readFrom. +@see eoObject +*/ +template +class eoAged: public Object +{ + public: + /// Main ctor from an already built Object. + eoAged( const Object& _o): Object( _o ), age(0) {}; + + /// Copy constructor. + eoAged( const eoAged& _a): Object( _a ), age( _a.age ) {}; + + /// Virtual dtor. They are needed in virtual class hierarchies + virtual ~eoAged() {}; + + + ///returns the age of the object + unsigned long Age() const {return age;} + + /// Increments age + const eoAged& operator ++ () { age++; return *this;} + + /** @name Methods from eoObject + readFrom and printOn are directly inherited from eo1d + */ +//@{ + /** Return the class id. This should be redefined in each class; but + it's got code as an example of implementation. Only "leaf" classes + can be non-virtual. + */ + virtual std::string className() const { return std::string("eoAged")+Object::className(); }; + + /** + * Read object. + * @param _is A istream. + * @throw runtime_exception If a valid object can't be read. + */ + virtual void readFrom(istream& _is) { + Object::readFrom( _is ); + _is >> age; + } + + + /** + * Write object. It's called printOn since it prints the object _on_ a stream. + * @param _os A ostream. + */ + virtual void printOn(ostream& _os) const{ + Object::printOn( _os ); + _os << age; + } +//@} + + private: + + /** Default Constructor. \\ + It´s private so that it is not used anywhere; the right way of using this object + is to create an Object and passing it to an aged by means of the copy ctor; that way + it´s turned into an Aged object*/ + eoAged(): Object(), age(0) {}; + + unsigned long age; +}; + +#endif EOAGE_H + diff --git a/trunk/paradiseo-eo/contrib/eoDrawable.h b/trunk/paradiseo-eo/contrib/eoDrawable.h new file mode 100644 index 000000000..221bf2c1e --- /dev/null +++ b/trunk/paradiseo-eo/contrib/eoDrawable.h @@ -0,0 +1,64 @@ +// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- + +//----------------------------------------------------------------------------- +// eoDrawable.h +// (c) GeNeura Team, 1999 +/* + This library is free software; you can redistribute it and/or + modify it under the terms of the GNU Lesser General Public + License as published by the Free Software Foundation; either + version 2 of the License, or (at your option) any later version. + + This library is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + Lesser General Public License for more details. + + You should have received a copy of the GNU Lesser General Public + License along with this library; if not, write to the Free Software + Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + + Contact: todos@geneura.ugr.es, http://geneura.ugr.es + */ +//----------------------------------------------------------------------------- + +#ifndef EODRAWABLE_H +#define EODRAWABLE_H + +//----------------------------------------------------------------------------- + +using namespace std; + +//----------------------------------------------------------------------------- +// eoDrawable +//----------------------------------------------------------------------------- + +/** eoDrawable is a template class that adds a drawing interface to an object.\\ +Requisites for template instantiation are that the object must admit a default ctor +and a copy ctor. The Object must be an eoObject, thus, it must have its methods: className, +eoDrawables can be drawn on any two-dimensional surface; it can be added to any +object with above characteristics. +@see eoObject +*/ +template +class eoDrawable +{ + public: + /// Main ctor from an already built Object. + eoDrawable( const Object& _o): Object( _o ){}; + + /// Copy constructor. + eoDrawable( const eoDrawable& _d): Object( _d ){}; + + /// Virtual dtor. They are needed in virtual class hierarchies + virtual ~eoDrawable() {}; + + + /**Draws the object. It must be redefined in any subclass, it´s impossible + to have a general drawing method + @param _x, _y coorinates */ + virtual void draw( unsigned _x, unsigned _y) = 0; + +}; + +#endif EODRAWABLE_H diff --git a/trunk/paradiseo-eo/contrib/mathsym/COPYING b/trunk/paradiseo-eo/contrib/mathsym/COPYING new file mode 100644 index 000000000..d60c31a97 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/COPYING @@ -0,0 +1,340 @@ + GNU GENERAL PUBLIC LICENSE + Version 2, June 1991 + + Copyright (C) 1989, 1991 Free Software Foundation, Inc. + 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The licenses for most software are designed to take away your +freedom to share and change it. By contrast, the GNU General Public +License is intended to guarantee your freedom to share and change free +software--to make sure the software is free for all its users. This +General Public License applies to most of the Free Software +Foundation's software and to any other program whose authors commit to +using it. (Some other Free Software Foundation software is covered by +the GNU Library General Public License instead.) You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +this service if you wish), that you receive source code or can get it +if you want it, that you can change the software or use pieces of it +in new free programs; and that you know you can do these things. + + To protect your rights, we need to make restrictions that forbid +anyone to deny you these rights or to ask you to surrender the rights. +These restrictions translate to certain responsibilities for you if you +distribute copies of the software, or if you modify it. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must give the recipients all the rights that +you have. You must make sure that they, too, receive or can get the +source code. And you must show them these terms so they know their +rights. + + We protect your rights with two steps: (1) copyright the software, and +(2) offer you this license which gives you legal permission to copy, +distribute and/or modify the software. + + Also, for each author's protection and ours, we want to make certain +that everyone understands that there is no warranty for this free +software. If the software is modified by someone else and passed on, we +want its recipients to know that what they have is not the original, so +that any problems introduced by others will not reflect on the original +authors' reputations. + + Finally, any free program is threatened constantly by software +patents. We wish to avoid the danger that redistributors of a free +program will individually obtain patent licenses, in effect making the +program proprietary. To prevent this, we have made it clear that any +patent must be licensed for everyone's free use or not licensed at all. + + The precise terms and conditions for copying, distribution and +modification follow. + + GNU GENERAL PUBLIC LICENSE + TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION + + 0. This License applies to any program or other work which contains +a notice placed by the copyright holder saying it may be distributed +under the terms of this General Public License. The "Program", below, +refers to any such program or work, and a "work based on the Program" +means either the Program or any derivative work under copyright law: +that is to say, a work containing the Program or a portion of it, +either verbatim or with modifications and/or translated into another +language. (Hereinafter, translation is included without limitation in +the term "modification".) Each licensee is addressed as "you". + +Activities other than copying, distribution and modification are not +covered by this License; they are outside its scope. The act of +running the Program is not restricted, and the output from the Program +is covered only if its contents constitute a work based on the +Program (independent of having been made by running the Program). +Whether that is true depends on what the Program does. + + 1. You may copy and distribute verbatim copies of the Program's +source code as you receive it, in any medium, provided that you +conspicuously and appropriately publish on each copy an appropriate +copyright notice and disclaimer of warranty; keep intact all the +notices that refer to this License and to the absence of any warranty; +and give any other recipients of the Program a copy of this License +along with the Program. + +You may charge a fee for the physical act of transferring a copy, and +you may at your option offer warranty protection in exchange for a fee. + + 2. You may modify your copy or copies of the Program or any portion +of it, thus forming a work based on the Program, and copy and +distribute such modifications or work under the terms of Section 1 +above, provided that you also meet all of these conditions: + + a) You must cause the modified files to carry prominent notices + stating that you changed the files and the date of any change. + + b) You must cause any work that you distribute or publish, that in + whole or in part contains or is derived from the Program or any + part thereof, to be licensed as a whole at no charge to all third + parties under the terms of this License. + + c) If the modified program normally reads commands interactively + when run, you must cause it, when started running for such + interactive use in the most ordinary way, to print or display an + announcement including an appropriate copyright notice and a + notice that there is no warranty (or else, saying that you provide + a warranty) and that users may redistribute the program under + these conditions, and telling the user how to view a copy of this + License. (Exception: if the Program itself is interactive but + does not normally print such an announcement, your work based on + the Program is not required to print an announcement.) + +These requirements apply to the modified work as a whole. If +identifiable sections of that work are not derived from the Program, +and can be reasonably considered independent and separate works in +themselves, then this License, and its terms, do not apply to those +sections when you distribute them as separate works. But when you +distribute the same sections as part of a whole which is a work based +on the Program, the distribution of the whole must be on the terms of +this License, whose permissions for other licensees extend to the +entire whole, and thus to each and every part regardless of who wrote it. + +Thus, it is not the intent of this section to claim rights or contest +your rights to work written entirely by you; rather, the intent is to +exercise the right to control the distribution of derivative or +collective works based on the Program. + +In addition, mere aggregation of another work not based on the Program +with the Program (or with a work based on the Program) on a volume of +a storage or distribution medium does not bring the other work under +the scope of this License. + + 3. You may copy and distribute the Program (or a work based on it, +under Section 2) in object code or executable form under the terms of +Sections 1 and 2 above provided that you also do one of the following: + + a) Accompany it with the complete corresponding machine-readable + source code, which must be distributed under the terms of Sections + 1 and 2 above on a medium customarily used for software interchange; or, + + b) Accompany it with a written offer, valid for at least three + years, to give any third party, for a charge no more than your + cost of physically performing source distribution, a complete + machine-readable copy of the corresponding source code, to be + distributed under the terms of Sections 1 and 2 above on a medium + customarily used for software interchange; or, + + c) Accompany it with the information you received as to the offer + to distribute corresponding source code. (This alternative is + allowed only for noncommercial distribution and only if you + received the program in object code or executable form with such + an offer, in accord with Subsection b above.) + +The source code for a work means the preferred form of the work for +making modifications to it. For an executable work, complete source +code means all the source code for all modules it contains, plus any +associated interface definition files, plus the scripts used to +control compilation and installation of the executable. However, as a +special exception, the source code distributed need not include +anything that is normally distributed (in either source or binary +form) with the major components (compiler, kernel, and so on) of the +operating system on which the executable runs, unless that component +itself accompanies the executable. + +If distribution of executable or object code is made by offering +access to copy from a designated place, then offering equivalent +access to copy the source code from the same place counts as +distribution of the source code, even though third parties are not +compelled to copy the source along with the object code. + + 4. You may not copy, modify, sublicense, or distribute the Program +except as expressly provided under this License. Any attempt +otherwise to copy, modify, sublicense or distribute the Program is +void, and will automatically terminate your rights under this License. +However, parties who have received copies, or rights, from you under +this License will not have their licenses terminated so long as such +parties remain in full compliance. + + 5. You are not required to accept this License, since you have not +signed it. However, nothing else grants you permission to modify or +distribute the Program or its derivative works. These actions are +prohibited by law if you do not accept this License. Therefore, by +modifying or distributing the Program (or any work based on the +Program), you indicate your acceptance of this License to do so, and +all its terms and conditions for copying, distributing or modifying +the Program or works based on it. + + 6. Each time you redistribute the Program (or any work based on the +Program), the recipient automatically receives a license from the +original licensor to copy, distribute or modify the Program subject to +these terms and conditions. You may not impose any further +restrictions on the recipients' exercise of the rights granted herein. +You are not responsible for enforcing compliance by third parties to +this License. + + 7. If, as a consequence of a court judgment or allegation of patent +infringement or for any other reason (not limited to patent issues), +conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot +distribute so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you +may not distribute the Program at all. For example, if a patent +license would not permit royalty-free redistribution of the Program by +all those who receive copies directly or indirectly through you, then +the only way you could satisfy both it and this License would be to +refrain entirely from distribution of the Program. + +If any portion of this section is held invalid or unenforceable under +any particular circumstance, the balance of the section is intended to +apply and the section as a whole is intended to apply in other +circumstances. + +It is not the purpose of this section to induce you to infringe any +patents or other property right claims or to contest validity of any +such claims; this section has the sole purpose of protecting the +integrity of the free software distribution system, which is +implemented by public license practices. Many people have made +generous contributions to the wide range of software distributed +through that system in reliance on consistent application of that +system; it is up to the author/donor to decide if he or she is willing +to distribute software through any other system and a licensee cannot +impose that choice. + +This section is intended to make thoroughly clear what is believed to +be a consequence of the rest of this License. + + 8. If the distribution and/or use of the Program is restricted in +certain countries either by patents or by copyrighted interfaces, the +original copyright holder who places the Program under this License +may add an explicit geographical distribution limitation excluding +those countries, so that distribution is permitted only in or among +countries not thus excluded. In such case, this License incorporates +the limitation as if written in the body of this License. + + 9. The Free Software Foundation may publish revised and/or new versions +of the General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + +Each version is given a distinguishing version number. If the Program +specifies a version number of this License which applies to it and "any +later version", you have the option of following the terms and conditions +either of that version or of any later version published by the Free +Software Foundation. If the Program does not specify a version number of +this License, you may choose any version ever published by the Free Software +Foundation. + + 10. If you wish to incorporate parts of the Program into other free +programs whose distribution conditions are different, write to the author +to ask for permission. For software which is copyrighted by the Free +Software Foundation, write to the Free Software Foundation; we sometimes +make exceptions for this. Our decision will be guided by the two goals +of preserving the free status of all derivatives of our free software and +of promoting the sharing and reuse of software generally. + + NO WARRANTY + + 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY +FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN +OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES +PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED +OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF +MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS +TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE +PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, +REPAIR OR CORRECTION. + + 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR +REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, +INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING +OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED +TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY +YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER +PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE +POSSIBILITY OF SUCH DAMAGES. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +convey the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 2 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program; if not, write to the Free Software + Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + + +Also add information on how to contact you by electronic and paper mail. + +If the program is interactive, make it output a short notice like this +when it starts in an interactive mode: + + Gnomovision version 69, Copyright (C) year name of author + Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, the commands you use may +be called something other than `show w' and `show c'; they could even be +mouse-clicks or menu items--whatever suits your program. + +You should also get your employer (if you work as a programmer) or your +school, if any, to sign a "copyright disclaimer" for the program, if +necessary. Here is a sample; alter the names: + + Yoyodyne, Inc., hereby disclaims all copyright interest in the program + `Gnomovision' (which makes passes at compilers) written by James Hacker. + + , 1 April 1989 + Ty Coon, President of Vice + +This General Public License does not permit incorporating your program into +proprietary programs. If your program is a subroutine library, you may +consider it more useful to permit linking proprietary applications with the +library. If this is what you want to do, use the GNU Library General +Public License instead of this License. diff --git a/trunk/paradiseo-eo/contrib/mathsym/CVS/Entries b/trunk/paradiseo-eo/contrib/mathsym/CVS/Entries new file mode 100644 index 000000000..7e30f357d --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/CVS/Entries @@ -0,0 +1,10 @@ +/COPYING/1.1/Thu Oct 6 12:13:52 2005// +/GNUmakefile/1.8/Thu Nov 24 09:35:33 2005// +/README/1.3/Thu Nov 24 09:35:33 2005// +/README.TCC/1.1/Thu Oct 6 12:13:52 2005// +/header/1.1/Thu Oct 6 12:13:52 2005// +/shared_ptr.h/1.1/Thu Oct 6 12:13:52 2005// +/symreg.cpp/1.7/Thu Nov 24 09:35:33 2005// +/tcc.tar.gz/1.1/Thu Oct 6 12:13:52 2005/-kb/ +/test_data.txt/1.1/Thu Oct 6 12:13:52 2005// +D diff --git a/trunk/paradiseo-eo/contrib/mathsym/CVS/Entries.Log b/trunk/paradiseo-eo/contrib/mathsym/CVS/Entries.Log new file mode 100644 index 000000000..ef83df9f6 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/CVS/Entries.Log @@ -0,0 +1,7 @@ +A D/eo_interface//// +A D/eval//// +A D/fun//// +A D/gen//// +A D/regression//// +A D/sym//// +A D/test//// diff --git a/trunk/paradiseo-eo/contrib/mathsym/CVS/Repository b/trunk/paradiseo-eo/contrib/mathsym/CVS/Repository new file mode 100644 index 000000000..305d2a9b0 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/CVS/Repository @@ -0,0 +1 @@ +eo/contrib/mathsym diff --git a/trunk/paradiseo-eo/contrib/mathsym/CVS/Root b/trunk/paradiseo-eo/contrib/mathsym/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/contrib/mathsym/GNUmakefile b/trunk/paradiseo-eo/contrib/mathsym/GNUmakefile new file mode 100644 index 000000000..f33c6efc7 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/GNUmakefile @@ -0,0 +1,97 @@ +COMPILEFLAGS=-Wno-deprecated -g -Wall -mpreferred-stack-boundary=2 -falign-functions=0#-DINTERVAL_DEBUG +OPTFLAGS= #-O3 -DNDEBUG + +PROFILE_FLAGS=#-pg +LDFLAGS=#-a + +INCLUDES=-I. -Isym -Ifun -Igen -Ieval -Iregression -I../../src -Ieo_interface -I.. + +CPPFLAGS=$(COMPILEFLAGS) $(OPTFLAGS) $(INCLUDES) $(PROFILE_FLAGS) -D__I386__ -DSIZEOF_UNSIGNED_LONG=4 +EXTLIBS=tcc/libtcc.a tcc/libtcc1.a ../../src/libeo.a ../../src/utils/libeoutils.a + +LIBS=${EXTLIBS} -ldl + +SYMLIB=libsym.a + +VPATH=sym fun gen eval regression eo_interface + +CXXSOURCES=FunDef.cpp Sym.cpp SymImpl.cpp SymOps.cpp sym_compile.cpp TreeBuilder.cpp LanguageTable.cpp\ + Dataset.cpp ErrorMeasure.cpp Scaling.cpp TargetInfo.cpp BoundsCheck.cpp util.cpp NodeSelector.cpp\ + eoSymCrossover.cpp sym_operations.cpp eoSymMutate.cpp eoSymLambdaMutate.cpp MultiFunction.cpp + +TESTPROGRAMS=test/test_compile test/testeo test/test_simplify test/test_diff test/test_lambda test/test_mf + +OBJS= $(CXXSOURCES:.cpp=.o) c_compile.o + +all: tcc/ symreg + +include $(CXXSOURCES:.cpp=.d) symreg.d + +clean: + rm *.o *.d $(TESTPROGRAMS) $(SYMLIB) symreg test/*.o || true + +distclean: clean + rm -rf tcc + +symreg: libsym.a symreg.o $(EXTLIBS) + $(CXX) -o symreg symreg.o libsym.a $(LIBS) $(PROFILE_FLAGS) ${LDFLAGS} + +libsym.a: $(OBJS) + rm libsym.a; ar cq $(SYMLIB) $(OBJS) + +check: $(TESTPROGRAMS) + test/test_compile && test/testeo && test/test_simplify && test/test_diff && test/test_lambda && echo "all tests succeeded" + +test/test_compile: test/test_compile.o ${SYMLIB} + $(CXX) -o test/test_compile test/test_compile.o $(SYMLIB) ${LIBS} + +test/testeo: test/testeo.o ${SYMLIB} + $(CXX) -o test/testeo test/testeo.o $(SYMLIB) ${LIBS} + +test/test_simplify: test/test_simplify.o $(SYMLIB) + $(CXX) -o test/test_simplify test/test_simplify.o $(SYMLIB) ${LIBS} + +test/test_diff: test/test_diff.o $(SYMLIB) + $(CXX) -o test/test_diff test/test_diff.o $(SYMLIB) ${LIBS} + +test/test_lambda: test/test_lambda.o $(SYMLIB) + $(CXX) -o test/test_lambda test/test_lambda.o $(SYMLIB) ${LIBS} + +test/test_mf: test/test_mf.o $(SYMLIB) + $(CXX) -o test/test_mf test/test_mf.o $(SYMLIB) ${LIBS} + +# eo +../../src/libeo.a: + make -C ../../src libeo.a + +../../src/utils/libeoutils.a: + make -C ../../src/utils libeoutils.a + +# tiny cc +tcc/: tcc.tar.gz + tar xvfz tcc.tar.gz && cd tcc && ./configure && make + +tcc/Makefile: tcc/ + cd tcc && ./configure + +tcc/libtcc.a: tcc/Makefile + make -Ctcc + +tcc/libtcc1.a: tcc/Makefile + make -Ctcc + +#rules +c_compile.o: eval/c_compile.c + $(CC) -c eval/c_compile.c -I./tcc $(COMPILEFLAGS) $(OPTFLAGS) + +%.o:%.cpp + $(CXX) -o $@ -c $< $(CPPFLAGS) $(INCLUDE) + +%.d: %.cpp + $(SHELL) -ec '$(CXX) -M $(CPPFLAGS) $< | sed "s/$*.o/& $@/g" > $@ ' + + +%.d: %.c + $(SHELL) -ec '$(CXX) -M $(CPPFLAGS) $< | sed "s/$*.o/& $@/g" > $@ ' + + diff --git a/trunk/paradiseo-eo/contrib/mathsym/README b/trunk/paradiseo-eo/contrib/mathsym/README new file mode 100644 index 000000000..0ac57dbc3 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/README @@ -0,0 +1,198 @@ + +This is not yet another gp system (nyagp). For one, it is not general. +It does one thing, find mathematical functions, and tries to do that well. + +So, if you're trying to steer ants on various New Mexico trails, or build your +own tiny block world, you're in the wrong place. However, if you're interested +in finding mathematical functions either through direct application on data or +running it through a simulator, you might find what you're looking for here. + +=== Representation (sym/ + gen/) ======== + +Mathsym has a few interesting characteristics. First and foremost is the +basic representation. It uses trees, but these trees are stored in a +reference counted hashtable. This means that every distinct subtree that is alive +is stored once and only once. +The reference counting mechanism takes care of memory management. + +The idea of using a hashtable (for offline analysis) comes from Walter Tackett, in his +1994 dissertation. The current system is just a real-time implementation of this +idea, adding the reference counting for ease of use. + +The hashtable brings overhead. It's still pretty fast, but a string based representation +would run circles around it. However, by virtue of it storing every subtree only once, it +is fairly tight on memory. This helps tremendously when confronted with excessively growing populations, bloat. +The hashtable implementation can not stop bloat, but does make it more manageable. In a typical +GP run, the number of distinct subtrees is only 10-20% of the total number of subtrees. + +Other advantages of the hashtable are in the ability to examine the run more thoroughly. It is easy +to check how many subtrees are present in the system, and for each subtree you can check the reference +count. + +The basic tree is called a Sym. A Sym is simply a tree, and has children, accessible through args(). +A Sym simply contains an iterator (== decorated pointer) to an entry in the hashtable. +Every time you create a Sym, it is either looked up in the hashtable or added to the hashtable. +A Sym has several members: size, depth, args, etc. One interesting member is the refcount(). +This returns the reference count of the Sym in the hashtable, and thus returns the number +of distinct contexts in which the Sym is used. + +Another nice thing of these hashtable Syms is that a check for equality reduces to a pointer comparison. + +The Sym nodes are identified by a simple token, of type token_t (usually an unsigned int). It +is completely generic and could conceivably be adapted to steer ants. The rest of the library +is however targeted at mathematical functions purely. + +sym/Sym.h is the file to look into for the functionality provided by Sym. The sym/ directory +is where the source files are stored that are relevant for the generic Sym functionality. The +'gen/' directory contains some generic functionality to build and traverse trees, independent of +the function and terminal set. + +The file sym/README.cpp documents the use of the sym library for general GP use. + +=== Function Set (fun/) === + +The standard GP function set of binary functions: addition, multiplication, subtraction and +division is NOT supported. + +What is however supported are the functions of: + +summation: arbitrary arity, arity zero meaning 0.0. Arity 2 is standard addition +product: arbitrary arity, arity zero meaning 1.0. Arity 2 is standard multiplication +inversion: 1.0 / x. Only arity 1 +unary minus: -x. Only arity 1 + +Plus a whole bunch of other functions (see "fun/FunDef.h") + +The reason for this is the observation (actually from a friend of mine, thanks Luuk), +that this set of functions is complete and slightly more orthogonal than a binary set. + +The directory 'fun' contains the functionality for the function and terminal set, together +with ERC's etc. fun/FunDef.cpp contains the definition of the functionality. Stuff can be +added here, but best to contact me if you miss particular functions. + +With the sym and the function set in place, some fairly nice overloading is possible. A quick tour: + +To create a variable that reads the first value from the inputs, do: + +Sym var = SymVar(0); + +To create a constant of value 0.4432, do + +Sym cnst = SymConst(0.4432); + +The constants are also stored uniquely so that: + +Sym cnst2 = SymConst(0.4432) + +will lead to: + +cnst == cnst2 + +to be true (this happens without value compare, they point to the same element in the hashtable) + +To add two values, do + +Sym sym = var + const; + +This will create a tree with tree nodes. All other operations work identically. + +=== Evaluation (eval/) === + +The second important thing is evaluation. Although Syms can be evaluated through an interpreter, +this is not the fastest way to go about with it. The standard way of evaluating a Sym is to +first *compile* it to a function, and then run it in your favourite environment. Compilation +is done through the use of the excellent tinycc compiler, which is blazingly fast and produces +pretty good functions. + +Compilation comes in several flavours: compile a single function and retrieve a pointer to a function +of signature: + +double func(const double* x); + +where x is the input array. Another option is to compile a bunch of functions in one go, and retrieve an array +of such function pointers. The Syms are simply printed and compiled. An example: + +double func(const double* x) { return x*x + x * 1./x; } + +The batch version proceeds significantly more quickly than calling compile every time. The function pointers +can be given to a simulation for extremely quick evaluation. + +A third option is to compile a complete population in one go, and return a single pointer of signature + +void func(const double* x, double* y); + +Where 'y' is the (preallocated) output array. This allows to evaluate a complete population in one function +call, storing the results in 'y'. It uses the hashtable to store every calculation only once. An example +for the two function x*x + x*1./x and x + sin(x*x) is: + +void func(const double* x, double* y) { + double a0 = x; + double a1 = a0 * a0; + double a2 = 1.0; + double a3 = a2 / a0; + double a4 = a2 * a3; + y[0] = a4; + double a5 = sin(a1); + double a6 = a0 + a5; + y[1] = a6; +} + +This is the fastest way to evaluate even humongous populations quickly. You might be surprised at +the amount of code re-use in a GP population. + +The three compilation functions can be found in eval/sym_compile.h + +A limiting factor in tinycc is that the struct TCCState that is used to hold the compilation context, +is not really self-contained. This unfortunately means that with every call to 'compile' ALL previous +pointers that have been produced become unsafe for use. I'm still looking at ways to circumvent this. + +To work with mathsym, a few small changes in tccelf.c were necessary, check README.TCC for details. + +=== Interval Arithmetic (eval/) === + +GP is pretty good at finding mathematical expressions that are numerically unsound. Take for instance +the function '1 / x'. This is well defined only when x is strictly positive, but will lead to problems +when x equals 0. The standard answer is to define some pseudo-arithmetical function called 'protected +division' that will return some value (usually 1) when a division by zero occurs. This leads to a number +of protected functions (sqrt, log, tan, etc.) which all need to be protected. Interpreting results from +GP using such functions is in general hard. + +Interval arithmetic (through another excellent library boost/numeric/interval) is used to calculate +if particular functions can conceivably produce problems. This completely annihilates the use for Koza-style +protected operators and is a more safe and sound method. For interval arithmetic to function, the bounds +on the input variables need to be known. As for every function we can calculate a guarenteed, +though not necessarily tight, output interval given the input intervals, we can check arbitrary functions +for possible problems. If, for example for division, the input interval contains 0, we know that a division +by zero is theoretically possible. It's then best to throw away the entire function. + +Interval Arithmetic is accessible through the class IntervalBoundsCheck (eval/BoundsCheck.h) + +=== More generic support (gen/) === + +The gen subdirectory contains some general utility classes for defining function sets and for +creating trees. The idea is that these functions are generic and only append on the sym/ part +of the library. Unfortunately, the language table currently needs an ERC function, a default +implementation is hidden inside fun/FunDef.cpp. Will fix at some point. + +gen/LanguageTable.cpp -> defines the functions/terminals that can be used +gen/TreeBuilder.cpp -> can create trees based on a LanguageTable + +=== Data and Errors (regression/) === + +The above classes are generic and apply for any type of problem where a mathematical function can be +used to steer some process, run a simulation, whatever. First check the intervals, then compile the +Sym(s) to a (set of) function pointer(s), and use the pointers in some way to evaluate for fitness. +One particular type of problem for which support is built in is 'symbolic regression'. This type of +problem involves finding an mathematical input/output relationship based on some data. + +To enable this, regression/ introduces the class Dataset to contain the data and ErrorMeasure to calculate +error. Currently supported: mean squared error, mean absolute error and mean squared error scaled (proportional +to correlation squared). They use some helper classes such as Scaling and TargetInfo. + +=== EO interface (eo_interface/) === + +Contains the classes to make it all work with EO. Check the root application 'symreg' for ways to use this + + + + diff --git a/trunk/paradiseo-eo/contrib/mathsym/README.TCC b/trunk/paradiseo-eo/contrib/mathsym/README.TCC new file mode 100644 index 000000000..8441c232f --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/README.TCC @@ -0,0 +1,5 @@ + +To refrain tcc from searching for libtcc1.a in the path, uncomment +out the lines looking for that in 'tccelf.c'. Search for libtcc1 and uncomment +these two lines. All should be well. + diff --git a/trunk/paradiseo-eo/contrib/mathsym/eo_interface/CVS/Entries b/trunk/paradiseo-eo/contrib/mathsym/eo_interface/CVS/Entries new file mode 100644 index 000000000..9795716af --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/eo_interface/CVS/Entries @@ -0,0 +1,10 @@ +/eoSym.h/1.4/Thu Nov 24 09:35:34 2005// +/eoSymCrossover.cpp/1.2/Sun Oct 16 15:38:38 2005// +/eoSymCrossover.h/1.1/Thu Oct 6 12:13:52 2005// +/eoSymEval.h/1.3/Thu Nov 24 09:35:34 2005// +/eoSymInit.h/1.1/Thu Oct 6 12:13:52 2005// +/eoSymLambdaMutate.cpp/1.1/Thu Nov 24 09:38:05 2005// +/eoSymLambdaMutate.h/1.1/Thu Nov 24 09:35:34 2005// +/eoSymMutate.cpp/1.3/Thu Nov 24 09:35:34 2005// +/eoSymMutate.h/1.4/Sun Oct 16 15:38:38 2005// +D diff --git a/trunk/paradiseo-eo/contrib/mathsym/eo_interface/CVS/Repository b/trunk/paradiseo-eo/contrib/mathsym/eo_interface/CVS/Repository new file mode 100644 index 000000000..6fef177a1 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/eo_interface/CVS/Repository @@ -0,0 +1 @@ +eo/contrib/mathsym/eo_interface diff --git a/trunk/paradiseo-eo/contrib/mathsym/eo_interface/CVS/Root b/trunk/paradiseo-eo/contrib/mathsym/eo_interface/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/eo_interface/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSym.h b/trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSym.h new file mode 100644 index 000000000..747850e22 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSym.h @@ -0,0 +1,65 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef EOSYM_H_ +#define EOSYM_H_ + +#include +#include +#include + + +template +class EoSym : public EO, public Sym { + + public: + + void set(const Sym& sym) { + EO::invalidate(); + static_cast(this)->operator=(sym); + } + + Sym& get() { return static_cast(*this); }; + Sym get() const { return static_cast(*this); }; + + virtual void printOn(std::ostream& os) const; + virtual void readFrom(std::istream& is); +}; + + +template +void EoSym::printOn(std::ostream& os) const { + EO::printOn(os); + os << ' '; + write_raw(os, *this); +} + +template +void EoSym::readFrom(std::istream& is) { + EO::readFrom(is); + read_raw(is, *this); +} + +template +inline std::ostream& operator<<(std::ostream& os, const EoSym& f) { f.printOn(os); return os; } +template +inline std::istream& operator>>(std::istream& is, EoSym& f) { f.readFrom(is); return is; } + + +#endif + + diff --git a/trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymCrossover.cpp b/trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymCrossover.cpp new file mode 100644 index 000000000..412ac78ee --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymCrossover.cpp @@ -0,0 +1,78 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + + +#include +#include + +#include +#include + +bool subtree_quad(Sym& a, Sym& b, NodeSelector& select) { + NodeSelector::NodeSelection sel_a = select.select_node(a); + NodeSelector::NodeSelection sel_b = select.select_node(b); + + Sym aprime = insert_subtree(a, sel_a.idx(), sel_b.subtree() ); + Sym bprime = insert_subtree(b, sel_b.idx(), sel_a.subtree() ); + + a = aprime; + b = bprime; + return true; +} + +bool subtree_bin(Sym& a, const Sym& b, NodeSelector& select) { + NodeSelector::NodeSelection sel_a = select.select_node(a); + NodeSelector::NodeSelection sel_b = select.select_node(b); + + a = insert_subtree(a, sel_a.idx(), sel_b.subtree()); + + return true; +} + +Sym homologous_binimpl(Sym a, Sym b) { + + if(a == b) { return a; } // no point + + bool use_a = rng.random(2); + + token_t head = (use_a? a : b).token(); + SymVec args = use_a?a.args() : b.args(); + + const SymVec& a_args = a.args(); + const SymVec& b_args = b.args(); + unsigned mn = std::min(a_args.size(), b_args.size()); + + bool changed = !use_a; + + for (unsigned i = 0; i < mn; ++i) { + args[i] = homologous_binimpl(a_args[i], b_args[i]); + if (args[i] != a_args[i]) { + changed = true; + } + } + + return changed? Sym(head, args) : a; +} + +bool homologous_bin(Sym& a, const Sym& b) { + if (a==b) return false; + Sym org = a; + a = homologous_binimpl(a,b); + return org != a; +} + + diff --git a/trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymCrossover.h b/trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymCrossover.h new file mode 100644 index 000000000..faa9acfaf --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymCrossover.h @@ -0,0 +1,64 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef EOSYMCROSSOVER_H +#define EOSYMCROSSOVER_H + +class NodeSelector; +class Sym; + +#include + +extern bool subtree_quad(Sym& a, Sym& b, NodeSelector& select); +template +class eoQuadSubtreeCrossover : public eoQuadOp { + NodeSelector& node_selector; + + public: + eoQuadSubtreeCrossover(NodeSelector& _node_selector) : node_selector(_node_selector) {} + + bool operator()(EoType& a, EoType& b) { return subtree_quad(a,b, node_selector); } +}; + + +extern bool subtree_bin(Sym& a, const Sym& b, NodeSelector& select); +template +class eoBinSubtreeCrossover : public eoBinOp { + NodeSelector& node_selector; + + public : + + eoBinSubtreeCrossover(NodeSelector& _node_selector) : node_selector(_node_selector) {} + + bool operator()(EoType& a, const EoType& b) { return subtree_bin(a, b, node_selector); } +}; + +/** Yet another homologous crossover, afaik not particularly + * defined in the literature + */ +extern bool homologous_bin(Sym& a, const Sym& b); +template +class eoBinHomologousCrossover : public eoBinOp { + public: + bool operator()(EoType& a, const EoType& b) { + return homologous_bin(a,b); + } +}; + + +#endif + diff --git a/trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymEval.h b/trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymEval.h new file mode 100644 index 000000000..9eb5f15c2 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymEval.h @@ -0,0 +1,96 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef SYMEVAL_H +#define SYMEVAL_H + +#include +#include +#include +#include + +#include + +template +class eoSymPopEval : public eoPopEvalFunc { + + BoundsCheck& check; + ErrorMeasure& measure; + unsigned size_cap; + + public: + + eoSymPopEval(BoundsCheck& _check, ErrorMeasure& _measure, unsigned _size_cap) : + check(_check), measure(_measure), size_cap(_size_cap) {} + + /** apparently this thing works on two populations, + * + * In any case, currently only implemented the population wide + * evaluation version, as that one is much faster. This because the + * compile going on behind the scenes is much faster when done in one + * go (and using subtree similarity) then when done on a case by case + * basis. + */ + void operator()(eoPop& p1, eoPop& p2) { + + std::vector unevaluated; + std::vector tmppop; + + for (unsigned i = 0; i < p1.size(); ++i) { + if (p1[i].invalid()) { + + if (expand_all(p1[i]).size() < size_cap && check.in_bounds(p1[i])) { + unevaluated.push_back(i); + tmppop.push_back( static_cast(p1[i]) ); + } else { + p1[i].fitness( measure.worst_performance() ); + } + } + } + + for (unsigned i = 0; i < p2.size(); ++i) { + if (p2[i].invalid()) { + + if (expand_all(p2[i]).size() < size_cap && check.in_bounds(p2[i])) { + + unevaluated.push_back(p1.size() + i); + tmppop.push_back( static_cast(p2[i]) ); + + } else { + p2[i].fitness( measure.worst_performance() ); // pretty bad error + } + } + } + + std::vector result = measure.calc_error(tmppop); + + for (unsigned i = 0; i < result.size(); ++i) { + unsigned idx = unevaluated[i]; + + if (idx < p1.size()) { + p1[idx].fitness(result[i].error); + } else { + idx -= p1.size(); + p2[idx].fitness(result[i].error); + } + } + } + +}; + + +#endif diff --git a/trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymInit.h b/trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymInit.h new file mode 100644 index 000000000..591b0050a --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymInit.h @@ -0,0 +1,64 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef EOSYMINIT_H +#define EOSYMINIT_H + +#include +#include + +/** Default initializer, Koza style */ +template +class eoSymInit : public eoInit { + + TreeBuilder& builder; + + double own_grow_prob; + unsigned own_max_depth; + + + double& grow_prob; + unsigned& max_depth; + + public: + + /** By default build ramped half and half with max depth 6 */ + eoSymInit(TreeBuilder& _builder) + : builder(_builder), + own_grow_prob(0.5), + own_max_depth(6), + grow_prob(own_grow_prob), + max_depth(own_max_depth) + {} + + /** Control the grow_prob and max_depth externally */ + eoSymInit(TreeBuilder& _builder, double& _grow_prob, unsigned& _max_depth) + : builder(_builder), + grow_prob(_grow_prob), + max_depth(_max_depth) + {} + + /** build the tree */ + void operator()(EoType& tree) { + int depth_to_use = rng.random(max_depth-2) + 2; // two levels minimum + builder.build_tree(tree, depth_to_use, rng.flip(grow_prob)); + } + +}; + +#endif + diff --git a/trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymLambdaMutate.cpp b/trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymLambdaMutate.cpp new file mode 100644 index 000000000..e7eeecf58 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymLambdaMutate.cpp @@ -0,0 +1,29 @@ +#include +#include "FunDef.h" +#include "NodeSelector.h" + +Sym compress(Sym sym, NodeSelector& sel) { + + return ::compress(sym); + + NodeSelector::NodeSelection s = sel.select_node(sym); + + Sym f = SymLambda( s.subtree()); + + if (f == s.subtree()) { return sym; } + + return insert_subtree(sym, s.idx(), f); +} + +extern Sym expand(Sym sym, NodeSelector& sel) { + + return ::expand_all(sym); + + NodeSelector::NodeSelection s = sel.select_node(sym); + + Sym f = SymUnlambda( s.subtree()); + + if (f == s.subtree()) { return sym; } + + return insert_subtree(sym, s.idx(), f); +} diff --git a/trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymLambdaMutate.h b/trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymLambdaMutate.h new file mode 100644 index 000000000..d29111521 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymLambdaMutate.h @@ -0,0 +1,47 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef SYMLAMBDAMUTATE_H +#define SYMLAMBDAMUTATE_H + +#include + +class NodeSelector; +class Sym; +extern Sym compress(Sym, NodeSelector&); +extern Sym expand(Sym, NodeSelector&); + + +template +class eoSymLambdaMutate : public eoMonOp { + NodeSelector& selector; + public : + eoSymLambdaMutate(NodeSelector& s) : selector(s) {} + + bool operator()(EoType& tomutate) { + if (rng.flip()) { + tomutate.set( expand(tomutate, selector)); + } else { + tomutate.set( compress(tomutate, selector)); + } + return true; + } + +}; + + +#endif diff --git a/trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymMutate.cpp b/trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymMutate.cpp new file mode 100644 index 000000000..0ab3f26ba --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymMutate.cpp @@ -0,0 +1,73 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#include +#include +#include + +using namespace std; + +std::pair do_mutate(Sym sym, double p, const LanguageTable& table) { + + bool changed = false; + SymVec args = sym.args(); + if (rng.flip(p)) { + token_t new_token = table.get_random_function(sym.token(), args.size()); + if (new_token != sym.token()) { + changed = true; + sym = Sym(new_token, args); + } + } + + for (unsigned i = 0; i < args.size(); ++i) { + std::pair r = do_mutate(args[i], p, table); + changed |= r.second; + if (r.second) + args[i] = r.first; + } + + if (changed) + return std::make_pair(Sym(sym.token(), args), true); + // else + return std::make_pair(sym, false); +} + + +// these two can (should?) move to an impl file +bool mutate(Sym& sym, double p, const LanguageTable& table) { + std::pair r = do_mutate(sym, p, table); + sym = r.first; + return r.second; +} + + +bool mutate_constants(Sym& sym, double stdev) { + vector values = get_constants(sym); + + if (values.empty()) { + return false; + } + + for (unsigned i = 0; i < values.size(); ++i) { + values[i] += rng.normal() * stdev; + } + + sym = set_constants(sym, values); + + return true; +} + diff --git a/trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymMutate.h b/trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymMutate.h new file mode 100644 index 000000000..aabe9141b --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/eo_interface/eoSymMutate.h @@ -0,0 +1,114 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef SYMMUTATE_H +#define SYMMUTATE_H + +#include +#include + +#include +#include + +template +class eoSymSubtreeMutate : public eoMonOp { + + TreeBuilder& subtree_builder; + NodeSelector& node_selector; + public : + + eoSymSubtreeMutate(TreeBuilder& _subtree_builder, NodeSelector& _node_selector) + : subtree_builder(_subtree_builder), node_selector(_node_selector) {} + + + bool operator()(EoType& tomutate) { + unsigned xover_point = node_selector.select_node(tomutate).idx(); + // create subtree + Sym newtree = subtree_builder.build_tree(6, true); // TODO, parameterize + static_cast(tomutate) = insert_subtree(tomutate, xover_point, newtree); + return true; + } + +}; + +/** Class for doing node mutation + * Two parameters: + * + * mutation_rate (the rate at which to do mutation) + * is_rate_absolute : don't rescale the rate to the size of the tree + */ + +extern bool mutate(Sym& sym, double p, const LanguageTable& table); + +template +class eoSymNodeMutate : public eoMonOp { + + LanguageTable& table; + double own_mutation_rate; + bool own_is_rate_absolute; + + + public: + + double& mutation_rate; + bool& is_rate_absolute; + + eoSymNodeMutate(LanguageTable& _table) + : table(_table), + own_mutation_rate(1.0), + own_is_rate_absolute(false), // this means a probability of node mutation of 1/sym.size() + mutation_rate(own_mutation_rate), + is_rate_absolute(own_is_rate_absolute) + {} + + eoSymNodeMutate(LanguageTable& _table, double& _mutation_rate, bool& _is_rate_absolute) + : table(_table), + mutation_rate(_mutation_rate), + is_rate_absolute(_is_rate_absolute) + {} + + + bool operator()(EoType& _eo) { + double p = mutation_rate; + if (!is_rate_absolute) p /= _eo.size(); + + return mutate(_eo, p, table); + } + +}; + +/** + * Simple constant mutation class, adds gaussian noise (configurable variance) to the individuals + **/ +extern bool mutate_constants(Sym& sym, double stdev); +template +class eoSymConstantMutate : public eoMonOp { + + double& stdev; + + + public : + eoSymConstantMutate(double& _stdev) : stdev(_stdev) {} + + bool operator()(EoType& _eo) { + return mutate_constants(_eo, stdev); + } + + +}; + +#endif diff --git a/trunk/paradiseo-eo/contrib/mathsym/eval/BoundsCheck.cpp b/trunk/paradiseo-eo/contrib/mathsym/eval/BoundsCheck.cpp new file mode 100644 index 000000000..715ebf524 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/eval/BoundsCheck.cpp @@ -0,0 +1,80 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#include + +#include "BoundsCheck.h" +#include +#include +#include + +using namespace std; + +class IntervalBoundsCheckImpl { + public : + vector bounds; +}; + +IntervalBoundsCheck::IntervalBoundsCheck(const vector& mins, const vector& maxes) { + pimpl = new IntervalBoundsCheckImpl; + vector& b = pimpl->bounds; + + b.resize( mins.size()); + + for (unsigned i = 0; i < b.size(); ++i) { + b[i] = Interval(mins[i], maxes[i]); + } + +} + +IntervalBoundsCheck::~IntervalBoundsCheck() { delete pimpl; } +IntervalBoundsCheck::IntervalBoundsCheck(const IntervalBoundsCheck& that) { pimpl = new IntervalBoundsCheckImpl(*that.pimpl); } +IntervalBoundsCheck& IntervalBoundsCheck::operator=(const IntervalBoundsCheck& that) { *pimpl = *that.pimpl; return *this; } + +bool IntervalBoundsCheck::in_bounds(const Sym& sym) const { + Interval bounds; + + try { + bounds = eval(sym, pimpl->bounds); + if (!valid(bounds)) return false; + } catch (interval_error) { + return false; + } + return true; +} + +std::string IntervalBoundsCheck::get_bounds(const Sym& sym) const { + + try { + Interval bounds = eval(sym, pimpl->bounds); + if (!valid(bounds)) return "err"; + ostringstream os; + os << bounds; + return os.str(); + } catch (interval_error) { + return "err"; + } +} + + +std::pair IntervalBoundsCheck::calc_bounds(const Sym& sym) const { + + Interval bounds = eval(sym, pimpl->bounds); + return make_pair(bounds.lower(), bounds.upper()); +} + + diff --git a/trunk/paradiseo-eo/contrib/mathsym/eval/BoundsCheck.h b/trunk/paradiseo-eo/contrib/mathsym/eval/BoundsCheck.h new file mode 100644 index 000000000..d484d0293 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/eval/BoundsCheck.h @@ -0,0 +1,58 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef BOUNDS_CHECK_H_ +#define BOUNDS_CHECK_H_ + +#include + +class IntervalBoundsCheckImpl; +class Sym; + +class BoundsCheck { + public : + virtual ~BoundsCheck() {}; + virtual bool in_bounds(const Sym&) const = 0; + virtual std::string get_bounds(const Sym&) const = 0; +}; + +// checks if a formula keeps within bounds using interval arithmetic +class IntervalBoundsCheck : public BoundsCheck { + + IntervalBoundsCheckImpl* pimpl; + + public: + + IntervalBoundsCheck(const std::vector& minima, const std::vector& maxima); + ~IntervalBoundsCheck(); + IntervalBoundsCheck(const IntervalBoundsCheck&); + IntervalBoundsCheck& operator=(const IntervalBoundsCheck&); + + bool in_bounds(const Sym&) const; + std::string get_bounds(const Sym&) const; + + std::pair calc_bounds(const Sym&) const; +}; + +class NoBoundsCheck : public BoundsCheck { + bool in_bounds(const Sym&) const { return false; } + std::string get_bounds(const Sym&) const { return ""; } +}; + +#endif + + diff --git a/trunk/paradiseo-eo/contrib/mathsym/eval/CVS/Entries b/trunk/paradiseo-eo/contrib/mathsym/eval/CVS/Entries new file mode 100644 index 000000000..5d2c8c632 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/eval/CVS/Entries @@ -0,0 +1,10 @@ +/BoundsCheck.cpp/1.1/Thu Oct 6 12:13:52 2005// +/BoundsCheck.h/1.1/Thu Oct 6 12:13:52 2005// +/Interval.h/1.1/Thu Oct 6 12:13:52 2005// +/MultiFuncs.cpp/1.1/Thu Nov 24 09:35:34 2005// +/MultiFunction.cpp/1.1/Thu Nov 24 09:35:34 2005// +/MultiFunction.h/1.1/Thu Nov 24 09:35:34 2005// +/c_compile.c/1.2/Thu Nov 24 09:35:34 2005// +/sym_compile.cpp/1.7/Thu Nov 24 09:35:34 2005// +/sym_compile.h/1.2/Thu Nov 24 09:35:34 2005// +D diff --git a/trunk/paradiseo-eo/contrib/mathsym/eval/CVS/Repository b/trunk/paradiseo-eo/contrib/mathsym/eval/CVS/Repository new file mode 100644 index 000000000..e10acc776 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/eval/CVS/Repository @@ -0,0 +1 @@ +eo/contrib/mathsym/eval diff --git a/trunk/paradiseo-eo/contrib/mathsym/eval/CVS/Root b/trunk/paradiseo-eo/contrib/mathsym/eval/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/eval/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/contrib/mathsym/eval/Interval.h b/trunk/paradiseo-eo/contrib/mathsym/eval/Interval.h new file mode 100644 index 000000000..1849af4cd --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/eval/Interval.h @@ -0,0 +1,115 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef INTERVAL__H__ +#define INTERVAL__H__ + +#include +#include +#include + + +typedef boost::numeric::interval_lib::rounded_transc_exact RoundingTransc; +typedef boost::numeric::interval_lib::save_state Rounding; +typedef boost::numeric::interval_lib::checking_base Checking; +typedef boost::numeric::interval_lib::policies Policy; +typedef boost::numeric::interval Interval; + +struct interval_error{}; + +inline bool valid(const Interval& val) { + if (!finite(val.lower()) || !finite(val.upper())) return false; + + return val.lower() > -1e10 && val.upper() < 1e10; +} + +inline Interval sqrt(const Interval& val) { + if (val.lower() < 0.0) { + return Interval::whole(); + } + + return boost::numeric::sqrt(val); +} + +inline Interval sqr(const Interval& val) { + return square(val); +} + +inline Interval acos(const Interval& val) { + if (val.lower() < 1.0 || val.upper() > 1.0) { + return Interval::whole(); + } + + return boost::numeric::acos(val); +} + +inline Interval asin(const Interval& val) { + if (val.lower() < 1.0 || val.upper() > 1.0) { + return Interval::whole(); + } + + return boost::numeric::asin(val); +} + +inline Interval acosh(const Interval& val) { + if (val.lower() < 1.0) return Interval::whole(); + return boost::numeric::acosh(val); +} + +inline +std::ostream& operator<<(std::ostream& os, const Interval& val) { + os << '[' << val.lower() << ", " << val.upper() << ']'; + return os; +} + +#ifdef TEST_INTERVAL +using namespace std; +using namespace boost::numeric; + +int main() { + Interval a(0, 10); + Interval b(-1.5, 2); + cout << "a = " << a << endl; + cout << "b = " << b << endl; + cout << "a + b = " << a + b << endl; + cout << "a - b = " << a - b << endl; + cout << "b - a = " << b - a << endl; + cout << "-a = " << -a << endl; + cout << "a * b = " << a * b << endl; + cout << "b/(a+1) = " << b / (a + 1.0) << endl; + cout << "b * a = " << b * a << endl; + + cout << "b / a = " << b/a << endl; + + cout << "cos(a) = " << cos(a) << endl; + cout << "cos(b) = " << cos(b) << endl; + + cout << "log(b) = " << log(b) << endl; + + cout << "sqrt(b) = " << sqrt(b) << endl; + cout << "sqrt(a) = " << sqrt(a) << endl; + cout << "sqr(b) = " << sqr(b) << endl; + + cout << "exp(b*a)= " << exp(b*a) << endl; + + cout << "atan(a) = " << atan(a) << endl; + cout << "cosh(b) = " << cosh(b) << endl; + +} +#endif + +#endif diff --git a/trunk/paradiseo-eo/contrib/mathsym/eval/MultiFuncs.cpp b/trunk/paradiseo-eo/contrib/mathsym/eval/MultiFuncs.cpp new file mode 100644 index 000000000..a06be64a3 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/eval/MultiFuncs.cpp @@ -0,0 +1,26 @@ + +namespace multi_function { + +double plus(arg_ptr args) { + return *args[0] + *args[1]; +} + +double mult(arg_ptr args) { + return *args[0] * *args[1]; +} + +double min(arg_ptr args) { + return -**args; +} + +double inv(arg_ptr args) { + return 1 / **args; +} + +//template class F { public: double operator()(double a) { return f(a); } }; + +double exp(arg_ptr args) { + return ::exp(**args); +} + +} // namespace diff --git a/trunk/paradiseo-eo/contrib/mathsym/eval/MultiFunction.cpp b/trunk/paradiseo-eo/contrib/mathsym/eval/MultiFunction.cpp new file mode 100644 index 000000000..ec1929d29 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/eval/MultiFunction.cpp @@ -0,0 +1,341 @@ +#include + + +#include "MultiFunction.h" +#include "Sym.h" +#include "FunDef.h" + +using namespace std; + + +typedef vector::const_iterator data_ptr; +typedef vector data_ptrs; +typedef data_ptrs::const_iterator arg_ptr; + +#include "MultiFuncs.cpp" + +typedef double (*fptr)( arg_ptr ); + +string print_function( fptr f) { + if (f == multi_function::plus) return "+"; + if (f == multi_function::mult) return "*"; + if (f == multi_function::min) return "-"; + if (f == multi_function::inv) return "/"; + if (f == multi_function::exp) return "e"; + return "unknown"; +} + + +struct Function { + + fptr function; + arg_ptr args; + + double operator()() const { return function(args); } +}; + +static vector token_2_function; + +Sym make_binary(Sym sym) { + if (sym.args().size() == 2) return sym; + SymVec args = sym.args(); + Sym an = args.back(); + args.pop_back(); + Sym nw = make_binary( Sym( sym.token(), args) ); + args.resize(2); + args[0] = nw; + args[1] = an; + return Sym(sym.token(), args); +} + +class Compiler { + + public: + + enum func_type {constant, variable, function}; + + typedef pair entry; + +#if USE_TR1 + typedef std::tr1::unordered_map HashMap; +#else + typedef hash_map HashMap; +#endif + + HashMap map; + + vector constants; + vector variables; + vector< fptr > functions; + vector< vector > function_args; + + unsigned total_args; + + vector outputs; + + Compiler() : total_args(0) {} + + entry do_add(Sym sym) { + + HashMap::iterator it = map.find(sym); + + if (it == map.end()) { // new entry + + token_t token = sym.token(); + + if (is_constant(token)) { + constants.push_back( get_constant_value(token) ); // set value + entry e = make_pair(constant, constants.size()-1); + map.insert( make_pair(sym, e) ); + return e; + + } else if (is_variable(token)) { + unsigned idx = get_variable_index(token); + variables.push_back(idx); + entry e = make_pair(variable, variables.size()-1); + map.insert( make_pair(sym, e) ); + return e; + } // else + + fptr f; + vector vec; + const SymVec& args = sym.args(); + + switch (token) { + case sum_token: + { + if (args.size() == 0) { + return do_add( SymConst(0.0)); + } + if (args.size() == 1) { + return do_add(args[0]); + } + if (args.size() == 2) { + vec.push_back(do_add(args[0])); + vec.push_back(do_add(args[1])); + f = multi_function::plus; + //cout << "Adding + " << vec[0].second << ' ' << vec[1].second << endl; + break; + + } else { + return do_add( make_binary(sym) ); + } + + } + case prod_token: + { + if (args.size() == 0) { + return do_add( SymConst(1.0)); + } + if (args.size() == 1) { + return do_add(args[0]); + } + if (args.size() == 2) { + vec.push_back(do_add(args[0])); + vec.push_back(do_add(args[1])); + f = multi_function::mult; + //cout << "Adding * " << vec[0].second << ' ' << vec[1].second << endl; + break; + + + } else { + return do_add( make_binary(sym) ); + } + } + case sqr_token: + { + SymVec newargs(2); + newargs[0] = args[0]; + newargs[1] = args[0]; + return do_add( Sym(prod_token, newargs)); + } + default : + { + if (args.size() != 1) { + cerr << "Unknown function " << sym << " encountered" << endl; + exit(1); + } + + vec.push_back(do_add(args[0])); + + switch (token) { + case min_token: f = multi_function::min; break; + case inv_token: f = multi_function::inv; break; + case exp_token :f = multi_function::exp; break; + default : + { + cerr << "Unimplemented token encountered " << sym << endl; + exit(1); + } + } + + //cout << "Adding " << print_function(f) << ' ' << vec[0].second << endl; + + + } + + } + + total_args += vec.size(); + function_args.push_back(vec); + functions.push_back(f); + + entry e = make_pair(function, functions.size()-1); + map.insert( make_pair(sym, e) ); + return e; + + } + + return it->second; // entry + } + + void add(Sym sym) { + entry e = do_add(sym); + outputs.push_back(e); + } + +}; + +class MultiFunctionImpl { + public: + + // input mapping + vector input_idx; + + unsigned constant_offset; + unsigned var_offset; + + // evaluation + vector data; + vector funcs; + data_ptrs args; + + vector output_idx; + + MultiFunctionImpl() {} + + void clear() { + input_idx.clear(); + data.clear(); + funcs.clear(); + args.clear(); + output_idx.clear(); + constant_offset = 0; + } + + void eval(const double* x, double* y) { + unsigned i; + // evaluate variables + for (i = constant_offset; i < constant_offset + input_idx.size(); ++i) { + data[i] = x[input_idx[i-constant_offset]]; + } + + for(; i < data.size(); ++i) { + data[i] = funcs[i-var_offset](); + //cout << i << " " << data[i] << endl; + } + + for (i = 0; i < output_idx.size(); ++i) { + y[i] = data[output_idx[i]]; + } + } + + void eval(const vector& x, vector& y) { + eval(&x[0], &y[0]); + } + + void setup(const vector& pop) { + + clear(); + Compiler compiler; + + for (unsigned i = 0; i < pop.size(); ++i) { + Sym sym = (expand_all(pop[i])); + compiler.add(sym); + } + + // compiler is setup so get the data + constant_offset = compiler.constants.size(); + var_offset = constant_offset + compiler.variables.size(); + int n = var_offset + compiler.functions.size(); + + data.resize(n); + funcs.resize(compiler.functions.size()); + args.resize(compiler.total_args); + + // constants + for (unsigned i = 0; i < constant_offset; ++i) { + data[i] = compiler.constants[i]; + //cout << i << ' ' << data[i] << endl; + } + + // variables + input_idx = compiler.variables; + + //for (unsigned i = constant_offset; i < var_offset; ++i) { + //cout << i << " x" << input_idx[i-constant_offset] << endl; + //} + + // functions + unsigned which_arg = 0; + for (unsigned i = 0; i < funcs.size(); ++i) { + + Function f; + f.function = compiler.functions[i]; + + //cout << i+var_offset << ' ' << print_function(f.function); + + // interpret args + for (unsigned j = 0; j < compiler.function_args[i].size(); ++j) { + + Compiler::entry e = compiler.function_args[i][j]; + + unsigned idx = e.second; + + switch (e.first) { + case Compiler::function: idx += compiler.variables.size(); + case Compiler::variable: idx += compiler.constants.size(); + case Compiler::constant: {} + } + + args[which_arg + j] = data.begin() + idx; + //cout << ' ' << idx << "(" << e.second << ")"; + } + + //cout << endl; + + f.args = args.begin() + which_arg; + which_arg += compiler.function_args[i].size(); + funcs[i] = f; + } + + // output indices + output_idx.resize(compiler.outputs.size()); + for (unsigned i = 0; i < output_idx.size(); ++i) { + output_idx[i] = compiler.outputs[i].second; + switch(compiler.outputs[i].first) { + case Compiler::function: output_idx[i] += compiler.variables.size(); + case Compiler::variable: output_idx[i] += compiler.constants.size(); + case Compiler::constant: {} + } + //cout << "out " << output_idx[i] << endl; + } + } + +}; + + + +MultiFunction::MultiFunction(const std::vector& pop) : pimpl(new MultiFunctionImpl) { + pimpl->setup(pop); +} + +MultiFunction::~MultiFunction() { delete pimpl; } + +void MultiFunction::operator()(const std::vector& x, std::vector& y) { + pimpl->eval(x,y); +} + +void MultiFunction::operator()(const double* x, double* y) { + pimpl->eval(x,y); +} diff --git a/trunk/paradiseo-eo/contrib/mathsym/eval/MultiFunction.h b/trunk/paradiseo-eo/contrib/mathsym/eval/MultiFunction.h new file mode 100644 index 000000000..bc333915b --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/eval/MultiFunction.h @@ -0,0 +1,26 @@ +#ifndef MULTIFUNCTION_H_ +#define MULTIFUNCTION_H_ + +#include + +class Sym; +class MultiFunctionImpl; + +class MultiFunction { + MultiFunction& operator=(const MultiFunction&); + MultiFunction(const MultiFunction&); + + MultiFunctionImpl* pimpl; + + public: + + MultiFunction(const std::vector& pop); + ~MultiFunction(); + + void operator()(const std::vector& x, std::vector& y); + void operator()(const double* x, double* y); + +}; + +#endif + diff --git a/trunk/paradiseo-eo/contrib/mathsym/eval/c_compile.c b/trunk/paradiseo-eo/contrib/mathsym/eval/c_compile.c new file mode 100644 index 000000000..36ad392a9 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/eval/c_compile.c @@ -0,0 +1,57 @@ +#include +#include +#include + +static TCCState* s = 0; + +extern void symc_init() { + if (s != 0) { + tcc_delete(s); + } + s = tcc_new(); + if (s == 0) { + fprintf(stderr, "Tiny cc doesn't function properly"); + exit(1); + } + + tcc_set_output_type(s, TCC_OUTPUT_MEMORY); +} + +extern int symc_compile(const char* func_str) { + //printf("Compiling %s\n", func_str); + int err = tcc_compile_string(s, func_str); + + if (err) { + fprintf(stderr,"Compile failed"); + } + return err; +} + +extern int symc_link() { + int err = tcc_relocate(s); + if (err) { + fprintf(stderr,"Compile failed"); + exit(1); + } + return err; +} + +extern void* symc_get_fun(const char* func_name) { + unsigned long val; + tcc_get_symbol(s, &val, func_name); + + if (val == 0) { + fprintf(stderr,"getfun failed"); + exit(1); + } + + return (void*) val; +} + +extern void* symc_make(const char* func_str, const char* func_name) { + symc_init(); + symc_compile(func_str); + symc_link(); + return symc_get_fun(func_name); +} + diff --git a/trunk/paradiseo-eo/contrib/mathsym/eval/sym_compile.cpp b/trunk/paradiseo-eo/contrib/mathsym/eval/sym_compile.cpp new file mode 100644 index 000000000..f75bbd5ce --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/eval/sym_compile.cpp @@ -0,0 +1,219 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + + +#include "Sym.h" +#include "FunDef.h" +#include "sym_compile.h" + +#include + +using namespace std; + +extern "C" { + void symc_init(); + int symc_compile(const char* func_str); + int symc_link(); + void* symc_get_fun(const char* func_name); + void* symc_make(const char* func_str, const char* func_name); +} + +string make_prototypes() { + string prot = get_prototypes(); + prot += "double sqr(double x) { return x*x; }"; + return prot; +} + +// contains variable names, like 'a0', 'a1', etc. or regular code + +#if USE_TR1 +typedef std::tr1::unordered_map HashMap; +#else +typedef hash_map HashMap; +#endif + +// prints 'num' in reverse notation. Does not matter as it's a unique id +string make_var(unsigned num) { + string str = "a"; + do { + str += char('0' + (num % 10)); + num /= 10; + } while (num); + return str; +} + +template +string to_string(T t) { + ostringstream os; + os << t; + return os.str(); +} + + +HashMap::iterator find_entry(const Sym& sym, string& str, HashMap& map) { + HashMap::iterator result = map.find(sym); + + if (result == map.end()) { // new entry + const SymVec& args = sym.args(); + + vector argstr(args.size()); + for (unsigned i = 0; i < args.size(); ++i) { + argstr[i] = find_entry(args[i], str, map)->second; + } + + string var = make_var(map.size()); // map.size(): unique id + string code; + // write out the code + const FunDef& fun = get_element(sym.token()); + code = fun.c_print(argstr, vector() ); + + str += "double " + var + "=" + code + ";\n"; + result = map.insert( make_pair(sym, var ) ).first; // only want iterator + } + + return result; +} + +void write_entry(const Sym& sym, string& str, HashMap& map, unsigned out) { + HashMap::iterator it = find_entry(sym, str, map); + + str += "y[" + to_string(out) + "]=" + it->second + ";\n"; + //cout << "wrote " << out << '\n'; +} + +#include +multi_function compile(const std::vector& syms) { + + //cout << "Multifunction " << syms.size() << endl; + // static stream to avoid fragmentation of these LARGE strings + static string str; + str.clear(); + str += make_prototypes(); + + str += "extern double func(const double* x, double* y) { \n "; + + multi_function result; + HashMap map(Sym::get_dag().size()); + + for (unsigned i = 0; i < syms.size(); ++i) { + write_entry(syms[i], str, map, i); + } + + str += ";}"; + + + /*static int counter = 0; + ostringstream nm; + nm << "cmp/compiled" << (counter++) << ".c"; + cout << "Saving as " << nm.str() << endl; + ofstream cmp(nm.str().c_str()); + cmp << str; + cmp.close(); + + //cout << "Multifunction " << syms.size() << endl; + cout << "Size of map " << map.size() << endl; +*/ + + result = (multi_function) symc_make(str.c_str(), "func"); + + if (result==0) { // error + cout << "Error in compile " << endl; + } + + return result; +} + +single_function compile(Sym sym) { + + ostringstream os; + + os << make_prototypes(); + os << "double func(const double* x) { return "; + + string code = c_print(sym); + os << code; + os << ";}"; + string func_str = os.str(); + + //cout << "compiling " << func_str << endl; + + return (single_function) symc_make(func_str.c_str(), "func"); +} + +/* finds and inserts the full code in a hashmap */ +HashMap::iterator find_code(Sym sym, HashMap& map) { + HashMap::iterator result = map.find(sym); + + if (result == map.end()) { // new entry + const SymVec& args = sym.args(); + vector argstr(args.size()); + for (unsigned i = 0; i < args.size(); ++i) { + argstr[i] = find_code(args[i], map)->second; + } + + // write out the code + const FunDef& fun = get_element(sym.token()); + string code = fun.c_print(argstr, vector()); + result = map.insert( make_pair(sym, code) ).first; // only want iterator + } + + return result; +} + +string print_code(Sym sym, HashMap& map) { + HashMap::iterator it = find_code(sym, map); + return it->second; +} + +void compile(const std::vector& syms, std::vector& functions) { + symc_init(); + + static ostringstream os; + os.str(""); + + os << make_prototypes(); + HashMap map(Sym::get_dag().size()); + for (unsigned i = 0; i < syms.size(); ++i) { + + os << "double func" << i << "(const double* x) { return "; + os << print_code(syms[i], map); //c_print(syms[i]); + os << ";}\n"; + + //symc_compile(os.str().c_str()); + //cout << "compiling " << os.str() << endl; + } + + os << ends; +#ifdef INTERVAL_DEBUG + //cout << "Compiling " << os.str() << endl; +#endif + + symc_compile(os.str().c_str()); + symc_link(); + + functions.resize(syms.size()); + for (unsigned i = 0; i < syms.size(); ++i) { + ostringstream os2; + os2 << "func" << i; + + functions[i] = (single_function) symc_get_fun(os2.str().c_str()); + } + +} + + + diff --git a/trunk/paradiseo-eo/contrib/mathsym/eval/sym_compile.h b/trunk/paradiseo-eo/contrib/mathsym/eval/sym_compile.h new file mode 100644 index 000000000..a0980d8e8 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/eval/sym_compile.h @@ -0,0 +1,36 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef SYMCOMPILE_H_ +#define SYMCOMPILE_H_ + +#include + + +typedef double (*single_function)(const double []); +typedef double (*multi_function)(const double[], double[]); + +/* + * Important, after every call of the functions below, the function pointers of the previous + * call are invalidated. Sorry, but that's the way the cookie crumbles (in tcc) + * */ + +single_function compile(Sym sym); +multi_function compile(const std::vector& sym); +void compile(const std::vector& sym, std::vector& functions); + +#endif diff --git a/trunk/paradiseo-eo/contrib/mathsym/fun/CVS/Entries b/trunk/paradiseo-eo/contrib/mathsym/fun/CVS/Entries new file mode 100644 index 000000000..f7db61316 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/fun/CVS/Entries @@ -0,0 +1,7 @@ +/FunDef.cpp/1.8/Thu Nov 24 09:35:34 2005// +/FunDef.h/1.7/Thu Nov 24 09:35:34 2005// +/SymOps.cpp/1.1/Thu Oct 6 12:13:52 2005// +/SymOps.h/1.1/Thu Oct 6 12:13:52 2005// +/sym_operations.cpp/1.3/Thu Nov 24 09:35:34 2005// +/util.cpp/1.1/Thu Oct 6 12:13:52 2005// +D diff --git a/trunk/paradiseo-eo/contrib/mathsym/fun/CVS/Repository b/trunk/paradiseo-eo/contrib/mathsym/fun/CVS/Repository new file mode 100644 index 000000000..c0a1981e5 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/fun/CVS/Repository @@ -0,0 +1 @@ +eo/contrib/mathsym/fun diff --git a/trunk/paradiseo-eo/contrib/mathsym/fun/CVS/Root b/trunk/paradiseo-eo/contrib/mathsym/fun/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/fun/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/contrib/mathsym/fun/FunDef.cpp b/trunk/paradiseo-eo/contrib/mathsym/fun/FunDef.cpp new file mode 100644 index 000000000..9a25afdff --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/fun/FunDef.cpp @@ -0,0 +1,893 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + + +#include +#include "Sym.h" +#include "FunDef.h" +#include + +using namespace std; +using namespace boost::numeric; + +vector language; + +token_t add_function(FunDef* function) { + language.push_back(function); + return token_t(language.size()-1); +} + +const FunDef& get_element(token_t token) { return *language[token]; } + +/* Printing */ + +string c_print(const Sym& sym) { + return c_print(sym, vector()); +} + +string c_print(const Sym& sym, const vector& vars) { + const SymVec& args = sym.args(); + vector names(args.size()); + for (unsigned i = 0; i < args.size(); ++i) { + names[i] = c_print(args[i], vars); + } + return language[sym.token()]->c_print(names, vars); +} + +/* Evaluation */ + + +double eval(const Sym& sym, const std::vector& inputs) { + return language[sym.token()]->eval(sym.args(), inputs); +} + + +/* Interval Logic */ +Interval eval(const Sym& sym, const vector& inputs) { + const SymVec& args = sym.args(); + vector interv(args.size()); + for (unsigned i = 0; i < args.size(); ++i) { + interv[i] = eval(args[i], inputs); + + if (!valid(interv[i])) throw interval_error(); + } + return language[sym.token()]->eval(interv, inputs); +} + +/* */ +void add_function_to_table(LanguageTable& table, token_t token) { + const FunDef& fundef = *language[token]; + + if (fundef.has_varargs() == false) { + table.add_function(token, fundef.min_arity()); + } else { // sum or prod (or min or max) + table.add_function(token, 2); + } +} + + +// by default it is eager +double FunDef::eval(const SymVec& args, const vector& inputs) const { + vector values(args.size()); + for (unsigned i = 0; i < args.size(); ++i) { + values[i] = ::eval(args[i], inputs); + } + + return eval(values, inputs); +} + +/* Variable Handling */ +FunDef* make_var(int idx); // defined in FunDefs.h +static vector var_token; + +Sym SymVar(unsigned idx) { + if (var_token.size() <= idx) { + // it is new + var_token.resize(idx+1, token_t(-1)); + var_token[idx] = add_function( make_var(idx) ); + } else if (var_token[idx] == token_t(-1)) { + var_token[idx] = add_function( make_var(idx) ); + } + return Sym(var_token[idx]); +} + + +/* Constant Handling */ + +struct HashDouble{ + size_t operator()(double val) const { + unsigned long h = 0; + char* s = (char*)&val; + for (unsigned i=0 ; i DoubleSet; +typedef std::tr1::unordered_map LambdaSet; +#else +typedef hash_map DoubleSet; +typedef hash_map LambdaSet; +#endif + +static DoubleSet doubleSet; // for quick checking if a constant already exists +static vector token_value; + +static LambdaSet lambdaSet; +static vector token_lambda; + +static std::vector free_list; + +void delete_val(token_t token) { // clean up the information about this value + + if (is_constant(token)) { + //cout << "Deleting constant token " << token << endl; + double value = token_value[token]; + doubleSet.erase(value); + + delete language[token]; + language[token] = 0; + free_list.push_back(token); + } + else if (is_lambda(token)) { + //cout << "Deleting lambda token " << token << endl; + + Sym expression = token_lambda[token]; + lambdaSet.erase(expression); + + delete language[token]; + language[token] = 0; + free_list.push_back(token); + } +} + + +FunDef* make_const(double value); + +void extend_free_list(); + +Sym SymConst(double value) { + + DoubleSet::iterator it = doubleSet.find(value); + + if (it != doubleSet.end()) { + return Sym(it->second); // already exists + } + + + if (free_list.empty()) { // make space for tokens; + extend_free_list(); + } + + token_t token = free_list.back(); + free_list.pop_back(); + //cout << "Creating constant with token " << token << endl; + assert(language[token] == 0); + + language[token] = make_const(value); + + doubleSet[value] = token; + if (token_value.size() < token) token_value.resize(token+1); + token_value[token] = value; + + return Sym(token); +} + +/* LanguageTable depends on this one, XXX move somewhere safe.*/ +#include +extern Sym default_const() { return SymConst(rng.normal()); } + +/* The functions */ +namespace { + +class Var : public FunDef { + public : + unsigned idx; + string default_str; + + Var(unsigned _idx) : idx(_idx) { + ostringstream os; + os << "x[" << idx << ']'; // CompiledCode expects this form + default_str = os.str(); + } + + double eval(const vector& _, const vector& inputs) const { return inputs[idx]; } + double eval(const SymVec& _, const vector& inputs) const { return inputs[idx]; } + string c_print(const vector& _, const vector& names) const { + if (names.empty()) { + return default_str; + } + return names[idx]; + } + + Interval eval(const vector& _, const vector& inputs) const { + return inputs[idx]; + } + + unsigned min_arity() const { return 0; } + + string name() const { return "var"; } + +}; + +class Const : public FunDef { + public: + double value; + string value_str; + + Const(double _value) : value(_value) { + ostringstream os; + os.precision(17); + os.setf(ios::showpoint); + os << '(' << value << ')'; + value_str = os.str(); + } + + + double eval(const vector& _, const vector& inputs) const { return value; } + double eval(const SymVec& _, const vector& inputs) const { return value; } + string c_print(const vector& _, const vector& names) const { + return value_str; + } + + Interval eval(const vector& _, const vector& inputs) const { + // Profil/Bias seems to have a problem with 0 * inf when the Interval is exact zero (fpe) + //if (value == 0.0) return Interval(-BiasEpsilon,BiasEpsilon); + return Interval(value); + } + + unsigned min_arity() const { return 0; } + + string name() const { return "parameter"; } +}; + +} // namespace + +void get_constants(Sym sym, vector& ret) { + token_t token = sym.token(); + if (is_constant(token)) { + double val = static_cast(language[token])->value; + ret.push_back(val); + } + + const SymVec& args = sym.args(); + for (unsigned i = 0; i < args.size(); ++i) { + get_constants(args[i], ret); + } + +} + +double get_constant_value(token_t token) { + return static_cast(language[token])->value; +} + +/** Get out the values for all constants in the expression */ +vector get_constants(Sym sym) { + vector retval; + get_constants(sym, retval); + return retval; +} + +/** Set the values for all constants in the expression. Vector needs to be the same size as the one get_constants returns + * The argument isn't touched, it will return a new sym with the constants set. */ +Sym set_constants(Sym sym, vector::const_iterator& it) { + + token_t token = sym.token(); + if (is_constant(token)) { + return SymConst(*it++); + } + + SymVec args = sym.args(); + for (unsigned i = 0; i < args.size(); ++i) { + args[i] = set_constants(args[i], it); + } + + return Sym(token, args); +} + +Sym set_constants(Sym sym, const vector& constants) { + vector::const_iterator it = constants.begin(); + return set_constants(sym, it); +} + +// Get functions out, excluding Const and Var +vector get_defined_functions() { + vector res; + for (unsigned i = 0; i < language.size(); ++i) { + res.push_back(language[i]); + + if (is_constant(i) || is_variable(i)) { + res.back() = 0; // erase + } + } + + return res; +} + +FunDef* make_var(int idx) { return new Var(idx); } +FunDef* make_const(double value) { return new Const(value); } + +bool is_constant(token_t token) { + const Const* cnst = dynamic_cast( language[token] ); + return cnst != 0; +} + +bool is_variable(token_t token) { + const Var* var = dynamic_cast( language[token] ); + return var != 0; +} + +unsigned get_variable_index(token_t token) { + const Var* var = static_cast( language[token] ); + return var->idx; +} + +namespace { +class Lambda : public FunDef { + public: + Sym expression; + int arity; + + Lambda(Sym expr, int arity_) : expression(expr), arity(arity_) {} + + double eval(const vector& vals, const vector& _) const { + return ::eval(expression, vals); + } + + string c_print(const vector& args, const vector& _) const { + return string("/*f*/") + ::c_print(expression, args) + string("/*eof*/"); + } + + Interval eval(const vector& args, const vector& _) const { + return ::eval(expression, args); + } + + unsigned min_arity() const { return arity; } + string name() const { return "F"; } + +}; + Sym normalize(Sym sym, SymVec& args) { + // check if it's a variable + token_t token = sym.token(); + const Var* var = dynamic_cast< const Var*>(language[token]); + + if (var != 0) { + for (unsigned i = 0; i < args.size(); ++i) { + if (sym == args[i]) { + return SymVar(i); // replace with reference to arg + } + } + + // not replaced, add it + args.push_back(sym); + return SymVar(args.size()-1); + + } + + SymVec a = sym.args(); + for (unsigned i = 0; i < a.size(); ++i) { + a[i] = normalize(a[i], args); + } + + return Sym(token, a); + } +} + +bool is_lambda(token_t token) { + const Lambda* lambda = dynamic_cast( language[token]); + return lambda != 0; +} + +std::ostream& print_list(Sym sym, ostream& os) { + os << sym.token() << ' '; + + const SymVec& args = sym.args(); + for (unsigned i = 0; i < args.size(); ++i) { + print_list(args[i], os); + } + return os; +} + +token_t new_lambda(Sym sym, int arity) { + // check if already present + + LambdaSet::iterator it = lambdaSet.find(sym); + if (it != lambdaSet.end()) { + return it->second; + } + + + // new, insert + Lambda* lambda = new Lambda(sym, arity); + + if (free_list.empty()) { + extend_free_list(); + } + + token_t token = free_list.back(); + free_list.pop_back(); + language[token] = lambda; + + lambdaSet[sym] = token; + if (token_lambda.size() <= token) token_lambda.resize(token+1); + token_lambda[token] = sym; + + return token; +} + +/* Compression */ +typedef hash_map OccMap; + +void count_occurances(Sym sym, OccMap& occ) { + occ[sym]++; + const SymVec& args = sym.args(); + for (unsigned i = 0; i < args.size(); ++i) { + count_occurances(args[i], occ); + } +} + +Sym create_lambda(Sym sym, OccMap& occ, unsigned nvars, vector& args) { + unsigned o = occ[sym]; + unsigned sz = sym.size(); + + if (o * sz > o + sz + nvars || is_variable(sym.token()) ) { + // check if it's already present + for (unsigned i = 0; i < args.size(); ++i) { + if (args[i] == sym) { + return SymVar(i); + } + } + // push_back + args.push_back(sym); + return SymVar(args.size()-1); + } + + SymVec sym_args = sym.args(); + for (unsigned i = 0; i < sym_args.size(); ++i) { + sym_args[i] = create_lambda(sym_args[i], occ, nvars, args); + } + + return Sym(sym.token(), sym_args); + +} + +Sym compress(Sym sym) { + OccMap occ(sym.size()); + count_occurances(sym, occ); + + unsigned nvars = 0; + for (OccMap::iterator it = occ.begin(); it != occ.end(); ++it) { + if (is_variable(it->first.token())) nvars++; + } + + SymVec args; + Sym body = create_lambda(sym, occ, nvars, args); + + + if (body.size() < sym.size()) { + // see if the body can be compressed some more + body = compress(body); + + token_t token = new_lambda(body, args.size()); + + for (unsigned i = 0; i < args.size(); ++i) { + args[i] = compress(args[i]); + } + + Sym result = Sym(token, args); + return compress(result); // see if it can be compressed some more + } + + return sym; +} + +Sym SymLambda(Sym expr) { return compress(expr); } + +Sym expand(Sym expr, const SymVec& args) { + + const Var* var = dynamic_cast( language[expr.token()] ); + if (var != 0) { + return args[var->idx]; + } + + SymVec expr_args = expr.args(); + for (unsigned i = 0; i < expr_args.size(); ++i) { + expr_args[i] = expand(expr_args[i], args); + } + + return Sym(expr.token(), expr_args); +} + +Sym SymUnlambda(Sym sym) { + Sym retval = sym; + const Lambda* lambda = dynamic_cast( language[sym.token()] ); + if (lambda != 0) { + retval = expand(lambda->expression, sym.args()); + } + + return retval; +} + +Sym expand_all(Sym sym) { + SymVec args = sym.args(); + for (unsigned i = 0; i < args.size(); ++i) { + args[i] = expand_all(args[i]); + } + + Sym nw = SymUnlambda( Sym(sym.token(), args) ); + + if (nw != sym) { + nw = expand_all(nw); + } + + return nw; +} + +namespace { + +class Sum : public FunDef { + + public : + + double eval(const vector& vals, const vector& _) const { + double res = 0; + for (unsigned i = 0; i < vals.size(); ++i) res += vals[i]; + return res; + } + + string c_print(const vector& args, const vector& _) const { + if (args.empty()) { return "0.0"; } + + ostringstream os; + os << "(" << args[0]; + for (unsigned i = 1; i < args.size(); ++i) { + os << "+" << args[i]; + } + os << ")"; + return os.str(); + } + + Interval eval(const vector& args, const vector& inputs) const { + Interval interv(0.0); + for (unsigned i = 0; i < args.size(); ++i) { + interv += args[i]; + } + return interv; + } + + unsigned min_arity() const { return 0; } + bool has_varargs() const { return true; } + + string name() const { return "sum"; } +}; + + +class Prod : public FunDef { + + public : + + double eval(const vector& vals, const vector& _) const { + double res = 1; + for (unsigned i = 0; i < vals.size(); ++i) res *= vals[i]; + return res; + } + + string c_print(const vector& args, const vector& _) const { + if (args.empty()) { return "1.0"; } + + ostringstream os; + os << "(" << args[0]; + for (unsigned i = 1; i < args.size(); ++i) { + os << "*" << args[i]; + } + os << ")"; + + return os.str(); + } + + Interval eval(const vector& args, const vector& inputs) const { + Interval interv(1.0); + for (unsigned i = 0; i < args.size(); ++i) { + interv *= args[i]; + } + return interv; + } + + unsigned min_arity() const { return 0; } + bool has_varargs() const { return true; } + + string name() const { return "prod"; } +}; + + +class Power : public FunDef { + public : + double eval(const vector& vals, const vector& _) const { + return pow(vals[0], vals[1]); + } + + string c_print(const vector& args, const vector& _) const { + return "pow(" + args[0] + ',' + args[1] + ')'; + } + + Interval eval(const vector& args, const vector& _) const { + Interval first = args[0]; + Interval second = args[1]; + Interval lg = log(first); + if (!valid(lg)) throw interval_error(); + return exp(second * lg); + } + + unsigned min_arity() const { return 2; } + + string name() const { return "pow"; } +}; + +class IsNeg : public FunDef { + + public: + double eval(const vector& vals, const vector& _) const { + if (vals[0] < 0.0) return vals[1]; + return vals[2]; + } + + double eval(const Sym& sym, const vector& inputs) const { + const SymVec& args = sym.args(); + double arg0 = ::eval(args[0], inputs); + if (arg0 < 0.0) { + return ::eval(args[1], inputs); + } + return ::eval(args[2], inputs); + } + + string c_print(const vector& args, const vector& _) const { + return "((" + args[0] + "<0.0)?" + args[1] + ":" + args[2]+")"; + } + + Interval eval(const vector& args, const vector& _) const { + Interval a0 = args[0]; + if (a0.upper() < 0.0) return args[1]; + if (a0.lower() >= 0.0) return args[2]; + + return Interval( std::min(args[1].lower(), args[2].lower()), std::max(args[1].upper(), args[2].upper())); + } + + unsigned min_arity() const { return 3; } + + string name() const { return "ifltz"; } +}; + +template +class Unary : public FunDef { + + Func un; + + double eval(const vector& vals, const vector& _) const { + return un(vals[0]); + } + + string c_print(const vector& args, const vector& _) const { + return un(args[0]); + } + + Interval eval(const vector& args, const vector& _) const { + return un(args[0]); + } + + unsigned min_arity() const { return 1; } + + string name() const { return un.name(); } + +}; + +struct Inv { + double operator()(double val) const { return 1.0 / val; } + string operator()(string v) const { return "(1./" + v + ")"; } + Interval operator()(Interval v) const { return 1.0 / v; } + + string name() const { return "inv"; } +}; + +struct Min { + double operator()(double val) const { return -val; } + string operator()(string v) const { return "(-" + v + ")"; } + Interval operator()(Interval v) const { return -v; } + + string name() const { return "min"; } +}; + +} // namespace + +string prototypes = "double pow(double, double);"; +string get_prototypes() { return prototypes; } +unsigned add_prototype(string str) { prototypes += string("double ") + str + "(double);"; return prototypes.size(); } + +token_t add_function(FunDef* function, token_t where) { + if (language.size() <= where) language.resize(where+1); + language[where] = function; + return 0; +} + +namespace { + +#define FUNCDEF(funcname) struct funcname##_struct { \ + double operator()(double val) const { return funcname(val); }\ + string operator()(string val) const { return string(#funcname) + '(' + val + ')'; }\ + Interval operator()(Interval val) const { return funcname(val); }\ + string name() const { return string(#funcname); }\ +};\ +static const token_t funcname##_token_static = add_function( new Unary, funcname##_token);\ +unsigned funcname##_size = add_prototype(#funcname); + +static token_t ssum_token = add_function( new Sum , sum_token); +static token_t sprod_token = add_function( new Prod, prod_token); +static token_t sinv_token = add_function( new Unary, inv_token); +static token_t smin_token = add_function( new Unary, min_token); +static token_t spow_token = add_function( new Power, pow_token); +static token_t sifltz_token = add_function( new IsNeg, ifltz_token); + +FUNCDEF(sin); +FUNCDEF(cos); +FUNCDEF(tan); +FUNCDEF(asin); +FUNCDEF(acos); +FUNCDEF(atan); + +FUNCDEF(sinh); +FUNCDEF(cosh); +FUNCDEF(tanh); +FUNCDEF(asinh); +FUNCDEF(acosh); +FUNCDEF(atanh); + +FUNCDEF(exp); +FUNCDEF(log); +} // namespace + +double sqr(double x) { return x*x; } + +namespace { +FUNCDEF(sqr); +FUNCDEF(sqrt); + +const int buildInFunctionOffset = language.size(); +} // namespace + +void add_tokens() { + unsigned sz = language.size(); + language.resize(sz + sz+1); // double + + for (unsigned i = sz; i < language.size(); ++i) { + free_list.push_back(i); + } +} + +void extend_free_list() { + // first check if we can clean up unused tokens; + const vector& refcount = Sym::token_refcount(); + for (unsigned i = buildInFunctionOffset; i < refcount.size(); ++i) { + if (language[i] == 0) continue; + + bool c = is_constant(i); + bool l = is_lambda(i); + + if (refcount[i] == 0 && (c || l)) { + + if (c) { + doubleSet.erase(token_value[i]); + } + + if (l) { + lambdaSet.erase(token_lambda[i]); + } + + delete language[i]; + language[i] = 0; + free_list.push_back(i); + } + } + + // if still empty, add new tokens + if (free_list.empty()) { + add_tokens(); + } +} + + +/* Serialization */ +void write_raw(ostream& os, const Sym& sym) { + token_t token = sym.token(); + const SymVec& args = sym.args(); + + if (is_constant(token)) { + os << "c" << language[token]->c_print(vector(), vector()); + } else { + + const Var* var = dynamic_cast( language[token] ); + + if (var != 0) { + os << "v" << var->idx; + } else { + os << "f" << token << ' ' << args.size(); + } + } + + for (unsigned i = 0; i < args.size(); ++i) { + write_raw(os, args[i]); + } +} + +string write_raw(const Sym& sym) { + + ostringstream os; + write_raw(os, sym); + + return os.str(); +} + +Sym read_raw(istream& is) { + char id = is.get(); + + switch (id) { + case 'c' : + { + double val; + is.get(); // skip '(' + is >> val; + is.get(); // skip ')' + return SymConst(val); + } + case 'v' : + { + unsigned idx; + is >> idx; + return SymVar(idx); + } + case 'f' : + { + token_t token; + unsigned arity; + is >> token; + is >> arity; + SymVec args(arity); + for (unsigned i = 0; i < arity; ++i) { + args[i] = read_raw(is); + } + + return Sym(token, args); + } + default : { + cerr << "Character = " << id << " Could not read formula from stream" << endl; + exit(1); + } + + } + + return Sym(); +} + +Sym read_raw(string str) { + istringstream is(str); + return read_raw(is); +} + +void read_raw(istream& is, Sym& sym) { + sym = read_raw(is); +} + diff --git a/trunk/paradiseo-eo/contrib/mathsym/fun/FunDef.h b/trunk/paradiseo-eo/contrib/mathsym/fun/FunDef.h new file mode 100644 index 000000000..2c88af05c --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/fun/FunDef.h @@ -0,0 +1,186 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef FUNCTION_DEF_H_ +#define FUNCTION_DEF_H_ + +#include +#include +#include +#include + +#include "Sym.h" +#include "Interval.h" + +class FunDef { + public: + + virtual ~FunDef() {} + + // (possibly) lazy evaluation function, default implementation calls 'eager' eval + virtual double eval(const SymVec& args, const std::vector& inputs) const; + + // eager evaluation function + virtual double eval(const std::vector& args, const std::vector& inputs) const = 0; + + // interval evaluation + virtual Interval eval(const std::vector& args, const std::vector& inputs) const = 0; + + // prints 'c' like code + virtual std::string c_print(const std::vector& names, const std::vector& names) const = 0; + + virtual unsigned min_arity() const = 0; + virtual bool has_varargs() const { return false; } // sum, prod, min, max are variable arity + + virtual std::string name() const = 0; + + protected: + +}; + +/** Gets out all function that are defined (excluding constants and variables) */ +extern std::vector get_defined_functions(); + +/** Gets a specific function (including vars and constants) out */ +extern const FunDef& get_element(token_t token); + +/** Single case evaluation */ +extern double eval(const Sym& sym, const std::vector& inputs); + +/** Static analysis through interval arithmetic */ +extern Interval eval(const Sym& sym, const std::vector& inputs); + +/** Pretty printers, second version allows setting of variable names */ +extern std::string c_print(const Sym& sym); + +/** Pretty printers, allows setting of variable names */ +extern std::string c_print(const Sym& sym, const std::vector& var_names); + +/** Pretty printer streamer */ +inline std::ostream& operator<<(std::ostream& os, const Sym& sym) { return os << c_print(sym); } + +/* Support for Ephemeral Random Constants (ERC) */ + +/** Create constant with this value, memory is managed. If reference count drops to zero value is deleted. */ +extern Sym SymConst(double value); +/** Create variable */ +extern Sym SymVar(unsigned idx); + +/** Create 'lambda expression; + * This is a neutral operation. It will replace + * all variables in the expression by arguments, + * wrap the expression in a Lambda function + * and returns a tree applying the lambda function + * to the original variable. + * + * A call like SymLambda( SymVar(1) + SymVar(1) * 3.1) will result in + * a Lambda function (a0 + a0 * 3.1) with one argument: SymVar(1)*/ + +extern Sym SymLambda(Sym expression); + +extern Sym SymUnlambda(Sym sym); + +/** Expands all lambda expressions inline */ +extern Sym expand_all(Sym sym); +extern Sym compress(Sym sym); + +/** Get out the values for all constants in the expression */ +std::vector get_constants(Sym sym); + +/** Set the values for all constants in the expression. Vector needs to be the same size as the one get_constants returns + * The argument isn't touched, it will return a new sym with the constants set. */ +Sym set_constants(Sym sym, const std::vector& constants); + +/** check if a token is a constant */ +extern bool is_constant(token_t token); +extern double get_constant_value(token_t token); +/** check if a token is a variable */ +extern bool is_variable(token_t token); +extern unsigned get_variable_index(token_t token); + +/** check if a token is a user/automatically defined function */ +extern bool is_lambda(token_t token); + + +/** simplifies a sym (sym_operations.cpp) Currently only simplifies constants */ +extern Sym simplify(Sym sym); + +/** differentiates a sym to a token (sym_operations.cpp) + * The token can be a variable or a constant +*/ +extern Sym differentiate(Sym sym, token_t dx); +struct differentiation_error{}; // thrown in case of ifltz + +/* Add function to the language table (and take a guess at the arity) */ +class LanguageTable; +extern void add_function_to_table(LanguageTable& table, token_t token); + +enum { + sum_token, + prod_token, + inv_token, + min_token, + pow_token, + ifltz_token, + sin_token, cos_token, tan_token, + asin_token, acos_token, atan_token, + sinh_token, cosh_token, tanh_token, + acosh_token, asinh_token, atanh_token, + exp_token, log_token, + sqr_token, sqrt_token +}; + +/* Defition of function overloads: for example, this define the function 'Sym sin(Sym)' */ + +#define HEADERFUNC(name) inline Sym name(Sym arg) { return Sym(name##_token, arg); } + +/* This defines the tokens: sin_token, cos_token, etc. */ +HEADERFUNC(inv); +HEADERFUNC(sin); +HEADERFUNC(cos); +HEADERFUNC(tan); +HEADERFUNC(asin); +HEADERFUNC(acos); +HEADERFUNC(atan); + +HEADERFUNC(sinh); +HEADERFUNC(cosh); +HEADERFUNC(tanh); +HEADERFUNC(asinh); +HEADERFUNC(acosh); +HEADERFUNC(atanh); + +HEADERFUNC(exp); +HEADERFUNC(log); + +HEADERFUNC(sqr); +HEADERFUNC(sqrt); + +/* Get the prototype functions out, this is needed for compilation */ +extern std::string get_prototypes(); + +// reading and writing in internal format, no parser for symbolic functions implemented yet +extern std::string write_raw(const Sym& sym); +extern void write_raw(std::ostream& os, const Sym& sym); +extern Sym read_raw(std::string str); +extern Sym read_raw(std::istream& is); +extern void read_raw(std::istream& is, Sym& sym); + +#include "SymOps.h" + +#endif + diff --git a/trunk/paradiseo-eo/contrib/mathsym/fun/SymOps.cpp b/trunk/paradiseo-eo/contrib/mathsym/fun/SymOps.cpp new file mode 100644 index 000000000..2d66b0d05 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/fun/SymOps.cpp @@ -0,0 +1,109 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#include "FunDef.h" +#include "SymOps.h" +#include "Sym.h" + +using namespace std; + +void collect(token_t t, Sym a, SymVec& args) { + + if (a.token() == t) { + const SymVec& a_args = a.args(); + for (unsigned i = 0; i < a_args.size(); ++i) { + collect(t, a_args[i], args); + } + return; + } + + args.push_back(a); +} + +Sym operator+(Sym a, Sym b) { + + SymVec args; + + collect(sum_token, a, args); + collect(sum_token, b, args); + + return Sym(sum_token, args); +} + +Sym operator*(Sym a, Sym b) { + + SymVec args; + + collect(prod_token, a, args); + collect(prod_token, b, args); + + return Sym(prod_token, args); +} + +Sym operator/(Sym a, Sym b) { + + SymVec args; + + collect(prod_token, a, args); + + SymVec args2; + collect(prod_token, b, args2); + + SymVec inv; + inv.push_back(Sym(prod_token, args2)); + + args.push_back( Sym(inv_token, inv) ); + + return Sym(prod_token, args); +} + +Sym operator-(Sym a, Sym b) { + + SymVec args; + + collect(sum_token, a, args); + + SymVec args2; + collect(sum_token, b, args2); + + SymVec min; + min.push_back(Sym(sum_token, args2)); + + args.push_back( Sym(min_token, min) ); + + return Sym(sum_token, args); +} + +Sym operator-(Sym a) { + return Sym(min_token, a); +} + +Sym pow(Sym a, Sym b) { + SymVec args; + args.push_back(a); + args.push_back(b); + return Sym(pow_token, args); +} + +Sym ifltz(Sym a, Sym b, Sym c) { + SymVec args; + args.push_back(a); + args.push_back(b); + args.push_back(c); + return Sym(ifltz_token, args); +} + diff --git a/trunk/paradiseo-eo/contrib/mathsym/fun/SymOps.h b/trunk/paradiseo-eo/contrib/mathsym/fun/SymOps.h new file mode 100644 index 000000000..16eb35fe3 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/fun/SymOps.h @@ -0,0 +1,31 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef SYMOPS_H +#define SYMOPS_H + +#include "Sym.h" + +extern Sym operator+(Sym a, Sym b); +extern Sym operator*(Sym a, Sym b); +extern Sym operator/(Sym a, Sym b); +extern Sym operator-(Sym a, Sym b); +extern Sym pow(Sym a, Sym b); +extern Sym ifltz(Sym a, Sym b, Sym c); +extern Sym operator-(Sym a); + +#endif diff --git a/trunk/paradiseo-eo/contrib/mathsym/fun/sym_operations.cpp b/trunk/paradiseo-eo/contrib/mathsym/fun/sym_operations.cpp new file mode 100644 index 000000000..124c657ad --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/fun/sym_operations.cpp @@ -0,0 +1,174 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#include + +using namespace std; + +Sym simplify_constants(Sym sym) { + + SymVec args = sym.args(); + token_t token = sym.token(); + + bool has_changed = false; + bool all_constants = true; + + for (unsigned i = 0; i < args.size(); ++i) { + + Sym arg = simplify_constants(args[i]); + + if (arg != args[i]) { + has_changed = true; + } + args[i] = arg; + + all_constants &= is_constant(args[i].token()); + } + + if (args.size() == 0) { + + if (sym.token() == sum_token) return SymConst(0.0); + if (sym.token() == prod_token) return SymConst(1.0); + + return sym; // variable or constant + } + + if (all_constants) { + // evaluate + + vector dummy; + + double v = ::eval(sym, dummy); + + Sym result = SymConst(v); + + return result; + } + + if (has_changed) { + return Sym(token, args); + } + + return sym; + +} + +// currently only simplifies constants +Sym simplify(Sym sym) { + + return simplify_constants(sym); + +} + +Sym derivative(token_t token, Sym x) { + Sym one = Sym(prod_token); + + switch (token) { + case inv_token : return Sym(inv_token, sqr(x)); + + case sin_token : return -cos(x); + case cos_token : return sin(x); + case tan_token : return one + sqr(tan(x)); + + case asin_token : return inv( sqrt(one - sqr(x))); + case acos_token: return -inv( sqrt(one - sqr(x))); + case atan_token : return inv( sqrt(one + sqr(x))); + + case cosh_token : return -sinh(x); + case sinh_token : return cosh(x); + case tanh_token : return one - sqr( tanh(x) ); + + case asinh_token : return inv( sqrt( one + sqr(x) )); + case acosh_token : return inv( sqrt(x-one) * sqrt(x + one) ); + case atanh_token : return inv(one - sqr(x)); + + case exp_token : return exp(x); + case log_token : return inv(x); + + case sqr_token : return SymConst(2.0) * x; + case sqrt_token : return SymConst(0.5) * inv( sqrt(x)); + default : + throw differentiation_error(); + } + + return x; +} + +extern Sym differentiate(Sym sym, token_t dx) { + + token_t token = sym.token(); + + Sym zero = Sym(sum_token); + Sym one = Sym(prod_token); + + if (token == dx) { + return one; + } + + SymVec args = sym.args(); + + if (args.size() == 0) { // df/dx with f != x + return zero; + } + + switch (token) { + + case sum_token: + { + for (unsigned i = 0; i < args.size(); ++i) { + args[i] = differentiate(args[i], dx); + } + + if (args.size() == 1) return args[0]; + return Sym(sum_token, args); + } + case min_token : + { + return -differentiate(args[0],dx); + } + case prod_token: + { + if (args.size() == 1) return differentiate(args[0], dx); + + if (args.size() == 2) { + return args[0] * differentiate(args[1], dx) + args[1] * differentiate(args[0], dx); + } + // else + Sym c = args.back(); + args.pop_back(); + Sym f = Sym(prod_token, args); + Sym df = differentiate( f, dx); + + return c * df + f * differentiate(c,dx); + } + case pow_token : + { + return pow(args[0], args[1]) * args[1] * inv(args[0]); + } + case ifltz_token : + { // cannot be differentiated + throw differentiation_error(); // TODO define proper exception + } + + default: // unary function: apply chain rule + { + Sym arg = args[0]; + return derivative(token, arg) * differentiate(arg, dx); + } + } + +} diff --git a/trunk/paradiseo-eo/contrib/mathsym/fun/util.cpp b/trunk/paradiseo-eo/contrib/mathsym/fun/util.cpp new file mode 100644 index 000000000..83e751dec --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/fun/util.cpp @@ -0,0 +1,27 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#include +#include + +using namespace std; + +double error(string errstr) { + cerr << "ERROR: " << errstr << endl; + exit(1); +} + diff --git a/trunk/paradiseo-eo/contrib/mathsym/gen/CVS/Entries b/trunk/paradiseo-eo/contrib/mathsym/gen/CVS/Entries new file mode 100644 index 000000000..e6fefca34 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/gen/CVS/Entries @@ -0,0 +1,7 @@ +/LanguageTable.cpp/1.3/Thu Nov 24 09:35:34 2005// +/LanguageTable.h/1.2/Thu Nov 24 09:35:34 2005// +/NodeSelector.cpp/1.2/Sun Oct 16 15:38:38 2005// +/NodeSelector.h/1.3/Sun Oct 16 15:38:38 2005// +/TreeBuilder.cpp/1.1/Thu Oct 6 12:13:53 2005// +/TreeBuilder.h/1.1/Thu Oct 6 12:13:53 2005// +D diff --git a/trunk/paradiseo-eo/contrib/mathsym/gen/CVS/Repository b/trunk/paradiseo-eo/contrib/mathsym/gen/CVS/Repository new file mode 100644 index 000000000..1dcdfacbb --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/gen/CVS/Repository @@ -0,0 +1 @@ +eo/contrib/mathsym/gen diff --git a/trunk/paradiseo-eo/contrib/mathsym/gen/CVS/Root b/trunk/paradiseo-eo/contrib/mathsym/gen/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/gen/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/contrib/mathsym/gen/LanguageTable.cpp b/trunk/paradiseo-eo/contrib/mathsym/gen/LanguageTable.cpp new file mode 100644 index 000000000..293f6569b --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/gen/LanguageTable.cpp @@ -0,0 +1,98 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + + +#include "LanguageTable.h" +#include "Sym.h" + +#include + +using namespace std; + +extern Sym default_const(); + +class LanguageImpl { + public : + std::vector vars; + LanguageTable::erc_func erc; + + std::vector functions; + std::vector< std::vector > functions_per_arity; + + LanguageImpl() : erc(default_const) {} +}; + +LanguageTable::LanguageTable() { + pimpl = new LanguageImpl; +} + +LanguageTable::~LanguageTable() { + delete pimpl; +} + +LanguageTable::LanguageTable(const LanguageTable& that) { + pimpl = new LanguageImpl(*that.pimpl); +} + +LanguageTable& LanguageTable::operator=(const LanguageTable& that) { + *pimpl = *that.pimpl; + return *this; +} + +void LanguageTable::add_function(token_t token, unsigned arity) { + functor_t f = {token, arity}; + add_function( f ); +} + +void LanguageTable::add_function(functor_t f) { + + if (f.arity > 0) { + pimpl->functions.push_back(f); + + } else { + pimpl->vars.push_back(Sym(f.token)); + } + + if (pimpl->functions_per_arity.size() <= f.arity) pimpl->functions_per_arity.resize(f.arity+1); + pimpl->functions_per_arity[f.arity].push_back(f.token); + +} + +void LanguageTable::set_erc( erc_func func) { pimpl->erc = func; } + +/* Getting info out */ + +extern Sym SymConst(double val); + +Sym LanguageTable::get_random_var() const { return rng.choice(pimpl->vars); } +Sym LanguageTable::get_random_const() const { return pimpl->erc(); } + +functor_t LanguageTable::get_random_function() const +{ + return rng.choice(pimpl->functions); +} + +token_t LanguageTable::get_random_function(token_t token, unsigned arity) const +{ + if (pimpl->functions_per_arity.size() <= arity || pimpl->functions_per_arity[arity].empty()) { + return token; // return original token if no functions of this arity are found + } + return rng.choice(pimpl->functions_per_arity[arity]); +} + + + diff --git a/trunk/paradiseo-eo/contrib/mathsym/gen/LanguageTable.h b/trunk/paradiseo-eo/contrib/mathsym/gen/LanguageTable.h new file mode 100644 index 000000000..dcbb0292f --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/gen/LanguageTable.h @@ -0,0 +1,56 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef LANGUAGE_TABLE_H +#define LANGUAGE_TABLE_H + +#include "token.h" + +class LanguageImpl; +class Sym; + +class LanguageTable { + + LanguageImpl* pimpl; + + public: + + LanguageTable(); + ~LanguageTable(); + + LanguageTable(const LanguageTable& org); + + LanguageTable& operator=(const LanguageTable& org); + + /* setting it up */ + typedef Sym (*erc_func)(); + + void add_function(token_t token, unsigned arity); + void add_function(functor_t functor); + void set_erc(erc_func func); + + /* Getting info out */ + + Sym get_random_var() const; + Sym get_random_const() const; + + functor_t get_random_function() const; + token_t get_random_function(token_t org, unsigned arity) const; +}; + +#endif + diff --git a/trunk/paradiseo-eo/contrib/mathsym/gen/NodeSelector.cpp b/trunk/paradiseo-eo/contrib/mathsym/gen/NodeSelector.cpp new file mode 100644 index 000000000..aefa4dd6f --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/gen/NodeSelector.cpp @@ -0,0 +1,50 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#include "NodeSelector.h" +#include "Sym.h" + +#include + +// If subtree is not set (by randomnodeselector for instance, find it now +Sym NodeSelector::NodeSelection::subtree() { + if (subtree_.empty()) { + subtree_ = get_subtree(root_, subtree_index_); + } + return subtree_; +} + +NodeSelector::NodeSelection RandomNodeSelector::select_node(Sym sym) const { + unsigned idx = rng.random(sym.size()); + return NodeSelection(sym, idx, Sym() ); // empty subtree, find it when needed +} + +NodeSelector::NodeSelection BiasedNodeSelector::select_node(Sym sym) const { + + unsigned p = rng.random(sym.size()); + Sym res; + for (unsigned i = 0; i < nRounds; ++i) { + res = get_subtree(sym, p); + + if (res.args().size() > 0) break; + + p = rng.random(sym.size()); + } + + return NodeSelection(sym, p, res); +} + diff --git a/trunk/paradiseo-eo/contrib/mathsym/gen/NodeSelector.h b/trunk/paradiseo-eo/contrib/mathsym/gen/NodeSelector.h new file mode 100644 index 000000000..e30abd9f8 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/gen/NodeSelector.h @@ -0,0 +1,65 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef NODESELECTOR_H +#define NODESELECTOR_H + +#include + +/** Base class for selecting nodes */ +class NodeSelector { + public: + + class NodeSelection { + Sym root_; + unsigned subtree_index_; + Sym subtree_; + + public : + NodeSelection(Sym r, unsigned idx, Sym s) + : root_(r), subtree_index_(idx), subtree_(s) {} + + Sym root() const { return root_; } + unsigned idx() const { return subtree_index_; } + Sym subtree(); + + }; + + virtual ~NodeSelector() {} + + virtual NodeSelection select_node(Sym sym) const = 0; +}; + + +/** Select nodes uniformly */ +class RandomNodeSelector : public NodeSelector { + public: + NodeSelection select_node(Sym sym) const; +}; + +/** A node selector that does a specified number of rounds ignoring terminals */ +class BiasedNodeSelector : public NodeSelector { + public: + unsigned nRounds; + + BiasedNodeSelector() : nRounds(3) {} // 3: for binary trees 87.5% chance of selecting an internal node + BiasedNodeSelector(unsigned n) : nRounds(n) {} + + NodeSelection select_node(Sym sym) const; +}; + +#endif diff --git a/trunk/paradiseo-eo/contrib/mathsym/gen/TreeBuilder.cpp b/trunk/paradiseo-eo/contrib/mathsym/gen/TreeBuilder.cpp new file mode 100644 index 000000000..70b7ef53e --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/gen/TreeBuilder.cpp @@ -0,0 +1,46 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#include +#include "TreeBuilder.h" + +Sym TreeBuilder::make_terminal() const { + if (rng.flip(vcprob)) { + return table.get_random_var(); + } + + return table.get_random_const(); +} + +Sym TreeBuilder::build_tree(unsigned max_depth, bool grow) const { + if (max_depth == 0 || grow && rng.random(2) == 0) { + return make_terminal(); + } + + // pick a random function, no matter what arity + + functor_t func = table.get_random_function(); + + SymVec args(func.arity); + + for (unsigned i = 0; i < args.size(); ++i) { + args[i] = build_tree(max_depth-1, grow); + } + + return Sym(func.token, args); +} + diff --git a/trunk/paradiseo-eo/contrib/mathsym/gen/TreeBuilder.h b/trunk/paradiseo-eo/contrib/mathsym/gen/TreeBuilder.h new file mode 100644 index 000000000..1969a52be --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/gen/TreeBuilder.h @@ -0,0 +1,45 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef TREEBUILDER_H_ +#define TREEBUILDER_H_ + +#include "Sym.h" +#include "LanguageTable.h" + +class TreeBuilder { + const LanguageTable& table; + + // probability of selecting a var versus a const when the choice boils down to selecting a terminal + double vcprob; + + Sym make_terminal() const; + public: + + TreeBuilder(const LanguageTable& t) : table(t), vcprob(0.9) {}; + TreeBuilder(const LanguageTable& t, double vc) : table(t), vcprob(vc) {}; + + void set_var_vs_const_probability(double p) { vcprob = p; } + + Sym build_tree(unsigned max_depth, bool grow) const; + + void build_tree(Sym& tree, unsigned max_depth, bool grow) const { tree = build_tree(max_depth, grow); } + +}; + +#endif + diff --git a/trunk/paradiseo-eo/contrib/mathsym/header b/trunk/paradiseo-eo/contrib/mathsym/header new file mode 100644 index 000000000..a4ea44583 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/header @@ -0,0 +1,17 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + diff --git a/trunk/paradiseo-eo/contrib/mathsym/regression/CVS/Entries b/trunk/paradiseo-eo/contrib/mathsym/regression/CVS/Entries new file mode 100644 index 000000000..fd956636a --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/regression/CVS/Entries @@ -0,0 +1,10 @@ +/Dataset.cpp/1.1/Thu Oct 6 12:13:53 2005// +/Dataset.h/1.1/Thu Oct 6 12:13:53 2005// +/ErrorMeasure.cpp/1.6/Thu Nov 24 09:35:34 2005// +/ErrorMeasure.h/1.1/Thu Oct 6 12:13:53 2005// +/Scaling.cpp/1.1/Thu Oct 6 12:13:53 2005// +/Scaling.h/1.2/Fri Oct 7 13:31:20 2005// +/TargetInfo.cpp/1.1/Thu Oct 6 12:13:53 2005// +/TargetInfo.h/1.1/Thu Oct 6 12:13:53 2005// +/stats.h/1.1/Wed Oct 12 18:35:13 2005// +D diff --git a/trunk/paradiseo-eo/contrib/mathsym/regression/CVS/Repository b/trunk/paradiseo-eo/contrib/mathsym/regression/CVS/Repository new file mode 100644 index 000000000..4d8357b60 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/regression/CVS/Repository @@ -0,0 +1 @@ +eo/contrib/mathsym/regression diff --git a/trunk/paradiseo-eo/contrib/mathsym/regression/CVS/Root b/trunk/paradiseo-eo/contrib/mathsym/regression/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/regression/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/contrib/mathsym/regression/Dataset.cpp b/trunk/paradiseo-eo/contrib/mathsym/regression/Dataset.cpp new file mode 100644 index 000000000..bdb314551 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/regression/Dataset.cpp @@ -0,0 +1,133 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#include "Dataset.h" +#include +#include + +#include + +using namespace std; + +class DataSetImpl { + public: + vector< vector > inputs; + vector targets; + + void read_data(vector strings) { + // find the number of inputs + + istringstream cnt(strings[0]); + unsigned n = 0; + for (;;) { + string s; + cnt >> s; + if (!cnt) break; + ++n; + } + + inputs.resize(strings.size(), vector(n-1)); + targets.resize(strings.size()); + + for (unsigned i = 0; i < strings.size(); ++i) { + istringstream is(strings[i]); + for (unsigned j = 0; j < n; ++j) { + + if (!is) { + cerr << "Too few targets in record " << i << endl; + exit(1); + } + + if (j < n-1) { + is >> inputs[i][j]; + } else { + is >> targets[i]; + } + + } + } + + } + +}; + +Dataset::Dataset() { pimpl = new DataSetImpl; } +Dataset::~Dataset() { delete pimpl; } +Dataset::Dataset(const Dataset& that) { pimpl = new DataSetImpl(*that.pimpl); } +Dataset& Dataset::operator=(const Dataset& that) { *pimpl = *that.pimpl; return *this; } + +unsigned Dataset::n_records() const { return pimpl->targets.size(); } +unsigned Dataset::n_fields() const { return pimpl->inputs[0].size(); } +const std::vector& Dataset::get_inputs(unsigned record) const { return pimpl->inputs[record]; } +double Dataset::get_target(unsigned record) const { return pimpl->targets[record]; } + +double error(string errstr); + +void Dataset::load_data(std::string filename) { + vector strings; // first load it in strings + + ifstream is(filename.c_str()); + + for(;;) { + string s; + getline(is, s); + if (!is) break; + + if (s[0] == '#') continue; // comment, skip + + strings.push_back(s); + } + + is.close(); + + if (strings.size() == 0) { + error("No data could be loaded"); + } + + pimpl->read_data(strings); + +} + +std::vector Dataset::input_minima() const { + vector >& in = pimpl->inputs; + + vector mn(in[0].size(), 1e+50); + for (unsigned i = 0; i < in.size(); ++i) { + for (unsigned j = 0; j < in[i].size(); ++j) { + mn[j] = std::min(mn[j], in[i][j]); + } + } + + return mn; +} + +vector Dataset::input_maxima() const { + vector >& in = pimpl->inputs; + + vector mx(in[0].size(), -1e+50); + for (unsigned i = 0; i < in.size(); ++i) { + for (unsigned j = 0; j < in[i].size(); ++j) { + mx[j] = std::max(mx[j], in[i][j]); + } + } + + return mx; +} + + + + diff --git a/trunk/paradiseo-eo/contrib/mathsym/regression/Dataset.h b/trunk/paradiseo-eo/contrib/mathsym/regression/Dataset.h new file mode 100644 index 000000000..395036db5 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/regression/Dataset.h @@ -0,0 +1,51 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef DATASET_H_ +#define DATASET_H_ + +#include +#include + +class DataSetImpl; + +class Dataset { + + DataSetImpl* pimpl; + + Dataset& operator=(const Dataset&); // cannot assign + public: + + Dataset(); + ~Dataset(); + Dataset(const Dataset&); + + void load_data(std::string filename); + + unsigned n_records() const; + unsigned n_fields() const; + + const std::vector& get_inputs(unsigned record) const; + double get_target(unsigned record) const; + + std::vector input_minima() const; + std::vector input_maxima() const; + +}; + +#endif + diff --git a/trunk/paradiseo-eo/contrib/mathsym/regression/ErrorMeasure.cpp b/trunk/paradiseo-eo/contrib/mathsym/regression/ErrorMeasure.cpp new file mode 100644 index 000000000..3a33d0d05 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/regression/ErrorMeasure.cpp @@ -0,0 +1,340 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + + +#include +#include + +#include "MultiFunction.h" + +#include "ErrorMeasure.h" +#include "Dataset.h" +#include "Sym.h" +#include "FunDef.h" +#include "sym_compile.h" +#include "TargetInfo.h" +#include "stats.h" + +using namespace std; + +#ifdef INTERVAL_DEBUG + +#include +#include + +vector none; +IntervalBoundsCheck bounds(none, none); + +#endif + + + +static double not_a_number = atof("nan"); + +class ErrorMeasureImpl { + public: + const Dataset& data; + TargetInfo train_info; + + ErrorMeasure::measure measure; + + Scaling no_scaling; + + ErrorMeasureImpl(const Dataset& d, double t_p, ErrorMeasure::measure m) : data(d), measure(m) { + +#ifdef INTERVAL_DEBUG + bounds = IntervalBoundsCheck(d.input_minima(), d.input_maxima()); +#endif + + unsigned nrecords = d.n_records(); + unsigned cases = unsigned(t_p * nrecords); + + valarray t(cases); + + for (unsigned i = 0; i < cases; ++i) { + t[i] = data.get_target(i); + } + + train_info = TargetInfo(t); + no_scaling = Scaling(new NoScaling); + } + + ErrorMeasure::result eval(const valarray& y) { + + ErrorMeasure::result result; + result.scaling = no_scaling; + + + switch(measure) { + case ErrorMeasure::mean_squared: + result.error = pow(train_info.targets() - y, 2.0).sum() / y.size(); + return result; + case ErrorMeasure::absolute: + result.error = abs(train_info.targets() - y).sum() / y.size(); + return result; + case ErrorMeasure::mean_squared_scaled: + result.scaling = ols(y, train_info); + result.error = pow(train_info.targets() - result.scaling->transform(y), 2.0).sum() / y.size(); + return result; + default: + cerr << "Unknown measure encountered: " << measure << " " << __FILE__ << " " << __LINE__ << endl; + } + + return result; + } + + unsigned train_cases() const { + return train_info.targets().size(); + } + + vector multi_function_eval(const vector& pop) { + + if (pop.size() == 0) return vector(); + + multi_function all = compile(pop); + //MultiFunction all(pop); + std::vector y(pop.size()); + + Scaling noScaling = Scaling(new NoScaling); + + const std::valarray& t = train_info.targets(); + + cout << "Population size " << pop.size() << endl; + + if (measure == ErrorMeasure::mean_squared_scaled) { + std::vector var(pop.size()); + std::vector cov(pop.size()); + + Var vart; + + for (unsigned i = 0; i < t.size(); ++i) { + vart.update(t[i]); + + all(&data.get_inputs(i)[0], &y[0]); // evalutate + //all(data.get_inputs(i), y); // evalutate + + for (unsigned j = 0; j < pop.size(); ++j) { + var[j].update(y[j]); + cov[j].update(y[j], t[i]); + } + } + + std::vector result(pop.size()); + + for (unsigned i = 0; i < pop.size(); ++i) { + + // calculate scaling + double b = cov[i].get_cov() / var[i].get_var(); + + if (!finite(b)) { + result[i].scaling = noScaling; + result[i].error = vart.get_var(); // largest error + continue; + } + + double a = vart.get_mean() - b * var[i].get_mean(); + + result[i].scaling = Scaling( new LinearScaling(a,b)); + + // calculate error + double c = cov[i].get_cov(); + c *= c; + + double err = vart.get_var() - c / var[i].get_var(); + result[i].error = err; + if (!finite(err)) { + //cout << pop[i] << endl; + cout << "b " << b << endl; + cout << "var t " << vart.get_var() << endl; + cout << "var i " << var[i].get_var() << endl; + cout << "cov " << cov[i].get_cov() << endl; + + for (unsigned j = 0; j < t.size(); ++j) { + all(&data.get_inputs(i)[0], &y[0]); // evalutate + //all(data.get_inputs(j), y); // evalutate + + cout << y[i] << ' ' << ::eval(pop[i], data.get_inputs(j)) << endl; + } + + exit(1); + } + } + + return result; + } + + + std::vector err(pop.size()); + + for (unsigned i = 0; i < train_cases(); ++i) { + // evaluate + all(&data.get_inputs(i)[0], &y[0]); + //all(data.get_inputs(i), y); + + for (unsigned j = 0; j < pop.size(); ++j) { + double diff = y[j] - t[i]; + if (measure == ErrorMeasure::mean_squared) { // branch prediction will probably solve this inefficiency + err[j] += diff * diff; + } else { + err[j] += fabs(diff); + } + + } + + } + + std::vector result(pop.size()); + + double n = train_cases(); + for (unsigned i = 0; i < pop.size(); ++i) { + result[i].error = err[i] / n; + result[i].scaling = noScaling; + } + + return result; + + } + + vector single_function_eval(const vector & pop) { + + vector funcs(pop.size()); + compile(pop, funcs); // get one function pointer for each individual + + valarray y(train_cases()); + vector result(pop.size()); + for (unsigned i = 0; i < funcs.size(); ++i) { + for (unsigned j = 0; j < train_cases(); ++j) { + y[j] = funcs[i](&data.get_inputs(j)[0]); + } + +#ifdef INTERVAL_DEBUG + //cout << "eval func " << i << " " << pop[i] << endl; + pair b = bounds.calc_bounds(pop[i]); + + // check if y is in bounds + for (unsigned j = 0; j < y.size(); ++j) { + if (y[j] < b.first -1e-4 || y[j] > b.second + 1e-4 || !finite(y[j])) { + cout << "Error " << y[j] << " not in " << b.first << ' ' << b.second << endl; + cout << "Function " << pop[i] << endl; + exit(1); + } + } +#endif + + result[i] = eval(y); + } + + return result; + } + + vector calc_error(const vector& pop) { + + // first declone +#if USE_TR1 + typedef std::tr1::unordered_map HashMap; +#else + typedef hash_map HashMap; +#endif + HashMap clone_map; + vector decloned; + decloned.reserve(pop.size()); + + for (unsigned i = 0; i < pop.size(); ++i) { + HashMap::iterator it = clone_map.find(pop[i]); + + if (it == clone_map.end()) { // new + clone_map[ pop[i] ] = decloned.size(); + decloned.push_back(pop[i]); + } + + } + + // evaluate + vector dresult; + // currently we can only accumulate simple measures such as absolute and mean_squared + switch(measure) { + case ErrorMeasure::mean_squared: + case ErrorMeasure::absolute: + dresult = multi_function_eval(decloned); + break; + case ErrorMeasure::mean_squared_scaled: + dresult = multi_function_eval(decloned); + break; + } + + vector result(pop.size()); + for (unsigned i = 0; i < result.size(); ++i) { + result[i] = dresult[ clone_map[pop[i]] ]; + } + + return result; + } + +}; + +ErrorMeasure::result::result() { + error = 0.0; + scaling = Scaling(0); +} + +bool ErrorMeasure::result::valid() const { + return isfinite(error); +} + +ErrorMeasure::ErrorMeasure(const Dataset& data, double train_perc, measure meas) { + pimpl = new ErrorMeasureImpl(data, train_perc, meas); +} + +ErrorMeasure::~ErrorMeasure() { delete pimpl; } +ErrorMeasure::ErrorMeasure(const ErrorMeasure& that) { pimpl = new ErrorMeasureImpl(*that.pimpl); } + + +ErrorMeasure::result ErrorMeasure::calc_error(Sym sym) { + + single_function f = compile(sym); + + valarray y(pimpl->train_cases()); + + for (unsigned i = 0; i < y.size(); ++i) { + + y[i] = f(&pimpl->data.get_inputs(i)[0]); + + if (!finite(y[i])) { + result res; + res.scaling = Scaling(new NoScaling); + res.error = not_a_number; + return res; + } + } + + return pimpl->eval(y); +} + +vector ErrorMeasure::calc_error(const vector& syms) { + return pimpl->calc_error(syms); + +} + +double ErrorMeasure::worst_performance() const { + + if (pimpl->measure == mean_squared_scaled) { + return pimpl->train_info.tvar(); + } + + return 1e+20; +} + diff --git a/trunk/paradiseo-eo/contrib/mathsym/regression/ErrorMeasure.h b/trunk/paradiseo-eo/contrib/mathsym/regression/ErrorMeasure.h new file mode 100644 index 000000000..17619fe97 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/regression/ErrorMeasure.h @@ -0,0 +1,61 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef ERROR_MEASURE_H +#define ERROR_MEASURE_H + +#include "Scaling.h" + +class ErrorMeasureImpl; +class Sym; +class Dataset; + +class ErrorMeasure { + + ErrorMeasureImpl* pimpl; + + public : + + enum measure { + absolute, + mean_squared, + mean_squared_scaled, + }; + + struct result { + double error; + Scaling scaling; + + result(); + bool valid() const; + }; + + ErrorMeasure(const Dataset& data, double train_perc, measure meas = mean_squared); + + ~ErrorMeasure(); + ErrorMeasure(const ErrorMeasure& that); + ErrorMeasure& operator=(const ErrorMeasure& that); + + result calc_error(Sym sym); + + std::vector calc_error(const std::vector& sym); + + double worst_performance() const; +}; + +#endif + diff --git a/trunk/paradiseo-eo/contrib/mathsym/regression/Scaling.cpp b/trunk/paradiseo-eo/contrib/mathsym/regression/Scaling.cpp new file mode 100644 index 000000000..dd6b0d0fc --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/regression/Scaling.cpp @@ -0,0 +1,417 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#include "Scaling.h" +#include "TargetInfo.h" + +using namespace std; + +Scaling slope(const std::valarray& x, const TargetInfo& targets) { + + double xx = 0.0; + double xy = 0.0; + + const valarray& y = targets.targets(); + + for (unsigned i = 0; i < x.size(); ++i) { + xx += x[i] * x[i]; + xy += x[i] * y[i]; + } + + if (xx < 1e-7) return Scaling(new LinearScaling(0.0,0.0)); + + double b = xy / xx; + + return Scaling(new LinearScaling(0.0, b)); + +} + +// Still needs proper testing with non-trivial lambda +Scaling regularized_least_squares(const std::valarray& inputs, const TargetInfo& targets, double lambda) { + + double n = inputs.size(); + + valarray x = inputs; + + double a,b,d; + a=b=d=0; + + for (unsigned i = 0; i < n; ++i) { + a += 1 + lambda; + b += x[i]; + d += x[i] * x[i] + lambda; + } + + //invert + + double ad_bc = a*d - b * b; + // if ad_bc equals zero there's a problem + + if (ad_bc < 1e-17) return Scaling(new LinearScaling); + + double ai = d/ad_bc; + double bi = -b/ad_bc; + double di = a/ad_bc; + double ci = bi; + + // Now multiply this inverted covariance matrix (C^-1) with x' * t + + std::valarray ones = x; + + // calculate C^-1 * x' ) + for (unsigned i = 0; i < n; ++i) + { + ones[i] = (ai + bi * x[i]); + x[i] = (ci + di * x[i]); + } + + // results are in [ones, x], now multiply with y + + a = 0.0; // intercept + b = 0.0; // slope + + const valarray& t = targets.targets(); + + for (unsigned i = 0; i < n; ++i) + { + a += ones[i] * t[i]; + b += x[i] * t[i]; + } + + return Scaling(new LinearScaling(a,b)); +} + +Scaling ols(const std::valarray& y, const std::valarray& t) { + double n = y.size(); + + double y_mean = y.sum() / n; + double t_mean = t.sum() / n; + + std::valarray y_var = (y - y_mean); + std::valarray t_var = (t - t_mean); + std::valarray cov = t_var * y_var; + + y_var *= y_var; + t_var *= t_var; + + double sumvar = y_var.sum(); + + if (sumvar == 0. || sumvar/n < 1e-7 || sumvar/n > 1e+7) // breakout when numerical problems are likely + return Scaling(new LinearScaling(t_mean,0.)); + + + double b = cov.sum() / sumvar; + double a = t_mean - b * y_mean; + + Scaling s = Scaling(new LinearScaling(a,b)); + + return s; +} + +Scaling ols(const std::valarray& y, const TargetInfo& targets) { + double n = y.size(); + + double y_mean = y.sum() / n; + + std::valarray y_var = (y - y_mean); + std::valarray cov = targets.tcov_part() * y_var; + + y_var *= y_var; + + double sumvar = y_var.sum(); + + if (sumvar == 0. || sumvar/n < 1e-7 || sumvar/n > 1e+7) // breakout when numerical problems are likely + return Scaling(new LinearScaling(targets.tmean(),0.)); + + + double b = cov.sum() / sumvar; + double a = targets.tmean() - b * y_mean; + + if (!finite(b)) { + + cout << a << ' ' << b << endl; + cout << sumvar << endl; + cout << y_mean << endl; + cout << cov.sum() << endl; + exit(1); + } + + Scaling s = Scaling(new LinearScaling(a,b)); + + return s; +} + + +Scaling wls(const std::valarray& inputs, const TargetInfo& targets) { + + std::valarray x = inputs; + const std::valarray& w = targets.weights(); + + unsigned n = x.size(); + // First calculate x'*W (as W is a diagonal matrix it's simply elementwise multiplication + std::valarray wx = targets.weights() * x; + + // Now x'*W is contained in [w,wx], calculate x' * W * x (the covariance) + double a,b,d; + a=b=d=0.0; + + for (unsigned i = 0; i < n; ++i) + { + a += w[i]; + b += wx[i]; + d += x[i] * wx[i]; + } + + //invert + + double ad_bc = a*d - b * b; + // if ad_bc equals zero there's a problem + + if (ad_bc < 1e-17) return Scaling(new LinearScaling); + + double ai = d/ad_bc; + double bi = -b/ad_bc; + double di = a/ad_bc; + double ci = bi; + + // Now multiply this inverted covariance matrix (C^-1) with x' * W * y + + // create alias to reuse the wx we do not need anymore + std::valarray& ones = wx; + + // calculate C^-1 * x' * W (using the fact that W is diagonal) + for (unsigned i = 0; i < n; ++i) + { + ones[i] = w[i]*(ai + bi * x[i]); + x[i] = w[i]*(ci + di * x[i]); + } + + // results are in [ones, x], now multiply with y + + a = 0.0; // intercept + b = 0.0; // slope + + const valarray& t = targets.targets(); + + for (unsigned i = 0; i < n; ++i) + { + a += ones[i] * t[i]; + b += x[i] * t[i]; + } + + return Scaling(new LinearScaling(a,b)); +} + + +//Scaling med(const std::valarray& inputs, const TargetInfo& targets); + +double mse(const std::valarray& y, const TargetInfo& t) { + + valarray residuals = t.targets()-y; + residuals *= residuals; + double sz = residuals.size(); + if (t.has_weights()) { + residuals *= t.weights(); + sz = 1.0; + } + + return residuals.sum() / sz; +} + +double rms(const std::valarray& y, const TargetInfo& t) { + return sqrt(mse(y,t)); +} + +double mae(const std::valarray& y, const TargetInfo& t) { + valarray residuals = abs(t.targets()-y); + if (t.has_weights()) residuals *= t.weights(); + return residuals.sum() / residuals.size(); +} + + +/* + double standard_error(const std::valarray& y, const std::pair& scaling) { + double a = scaling.first; + double b = scaling.second; + double n = y.size(); + double se = sqrt( pow(a+b*y-current_set->targets,2.0).sum() / (n-2)); + + double mean_y = y.sum() / n; + double sxx = pow( y - mean_y, 2.0).sum(); + + return se / sqrt(sxx); + } + + double scaled_mse(const std::valarray& y){ + std::pair scaling; + return scaled_mse(y,scaling); + } + + double scaled_mse(const std::valarray& y, std::pair& scaling) + { + scaling = scale(y); + + double a = scaling.first; + double b = scaling.second; + + std::valarray tmp = current_set->targets - a - b * y; + tmp *= tmp; + + if (weights.size()) + return (weights * tmp).sum(); + + return tmp.sum() / tmp.size(); + } + + double robust_mse(const std::valarray& ny, std::pair& scaling) { + + double smse = scaled_mse(ny,scaling); + + std::valarray y = ny; + // find maximum covariance case + double n = y.size(); + + int largest = 0; + + { + double y_mean = y.sum() / n; + + std::valarray y_var = (y - y_mean); + std::valarray cov = tcov * y_var; + + std::valarray maxcov = cov == cov.max(); + + for (unsigned i = 0; i < maxcov.size(); ++i) { + if (maxcov[i]) { + largest = i; + break; + } + } + } + + double y_mean = (y.sum() - y[largest]) / (n-1); + y[largest] = y_mean; // dissappears from covariance calculation + + std::valarray y_var = (y - y_mean); + std::valarray cov = tcov * y_var; + y_var *= y_var; + + double sumvar = y_var.sum(); + + if (sumvar == 0. || sumvar/n < 1e-7 || sumvar/n > 1e+7) // breakout when numerical problems are likely + return worst_performance(); + + double b = cov.sum() / sumvar; + double a = tmean - b * y_mean; + + std::valarray tmp = current_set->targets - a - b * y; + tmp[largest] = 0.0; + tmp *= tmp; + + double smse2 = tmp.sum() / (tmp.size()-1); + + static std::ofstream os("smse.txt"); + os << smse << ' ' << smse2 << '\n'; + + if (smse2 > smse) { + return worst_performance(); + //std::cerr << "overfit? " << smse << ' ' << smse2 << '\n'; + } + + scaling.first = a; + scaling.second = b; + + return smse2; + } + + class Sorter { + const std::valarray& scores; + public: + Sorter(const std::valarray& _scores) : scores(_scores) {} + + bool operator()(unsigned i, unsigned j) const { + return scores[i] < scores[j]; + } + }; + + double coc(const std::valarray& y) { + std::vector indices(y.size()); + for (unsigned i = 0; i < y.size(); ++i) indices[i] = i; + std::sort(indices.begin(), indices.end(), Sorter(y)); + + const std::valarray& targets = current_set->targets; + + double neg = 1.0 - targets[indices[0]]; + double pos = targets[indices[0]]; + + double cumpos = 0; + double cumneg = 0; + double sum=0; + + double last_score = y[indices[0]]; + + for(unsigned i = 1; i < targets.size(); ++i) { + + if (fabs(y[indices[i]] - last_score) < 1e-9) { // we call it tied + pos += targets[indices[i]]; + neg += 1.0 - targets[indices[i]]; + + if (i < targets.size()-1) + continue; + } + sum += pos * cumneg + (pos * neg) * 0.5; + cumneg += neg; + cumpos += pos; + pos = targets[indices[i]]; + neg = 1.0 - targets[indices[i]]; + last_score = y[indices[i]]; + } + + return sum / (cumneg * cumpos); + } + + // iterative re-weighted least squares (for parameters.classification) + double irls(const std::valarray& scores, std::pair& scaling) { + const std::valarray& t = current_set->targets; + + std::valarray e(scores.size()); + std::valarray u(scores.size()); + std::valarray w(scores.size()); + std::valarray z(scores.size()); + + parameters.use_irls = false; parameters.classification=false; + scaling = scale(scores); + parameters.use_irls=true;parameters.classification=true; + + if (scaling.second == 0.0) return worst_performance(); + + for (unsigned i = 0; i < 10; ++i) { + e = exp(scaling.first + scaling.second*scores); + u = e / (e + exp(-(scaling.first + scaling.second * scores))); + w = u*(1.-u); + z = (t-u)/w; + scaling = wls(scores, u, w); + //double ll = (log(u)*t + (1.-log(u))*(1.-t)).sum(); + //std::cout << "Scale " << i << ' ' << scaling.first << " " << scaling.second << " LL " << 2*ll << std::endl; + } + + // log-likelihood + u = exp(scaling.first + scaling.second*scores) / (1 + exp(scaling.first + scaling.second*scores)); + double ll = (log(u)*t + (1.-log(u))*(1.-t)).sum(); + return 2*ll; + } +*/ diff --git a/trunk/paradiseo-eo/contrib/mathsym/regression/Scaling.h b/trunk/paradiseo-eo/contrib/mathsym/regression/Scaling.h new file mode 100644 index 000000000..efa98a01a --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/regression/Scaling.h @@ -0,0 +1,95 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef SCALING_H_ +#define SCALING_H_ + +#include "shared_ptr.h" + +#include +#include +#include + +class TargetInfo; + +class ScalingBase { + public: + + virtual ~ScalingBase() {} + + std::valarray apply(const std::valarray& x) { + std::valarray xtmp = x; + transform(xtmp); + return xtmp; + } + + virtual double transform(double input) const = 0; + virtual void transform(std::valarray& inputs) const = 0; + virtual std::ostream& print(std::ostream& os, std::string str) const = 0; + virtual std::valarray transform(const std::valarray& inputs) const = 0; +}; + +typedef shared_ptr Scaling; + +class LinearScaling : public ScalingBase { + + double a,b; + + public: + LinearScaling() : a(0.0), b(1.0) {} + LinearScaling(double _a, double _b) : a(_a), b(_b) {} + + double transform(double input) const { input *=b; input += a; return input; } + void transform(std::valarray& inputs) const { inputs *= b; inputs += a; } + std::valarray transform(const std::valarray& inputs) const { + std::valarray y = a + b * inputs; + return y; + } + + double intercept() const { return a; } + double slope() const { return b; } + + std::ostream& print(std::ostream& os, std::string str) const { + os.precision(16); + os << a << " + " << b << " * " << str; + return os; + } +}; + +class NoScaling : public ScalingBase{ + void transform(std::valarray&) const {} + double transform(double input) const { return input; } + std::valarray transform(const std::valarray& inputs) const { return inputs; } + std::ostream& print(std::ostream& os, std::string str) const { return os << str; } +}; + +extern Scaling slope(const std::valarray& inputs, const TargetInfo& targets); // slope only +extern Scaling ols(const std::valarray& inputs, const TargetInfo& targets); +extern Scaling wls(const std::valarray& inputs, const TargetInfo& targets); +extern Scaling med(const std::valarray& inputs, const TargetInfo& targets); + +extern Scaling ols(const std::valarray& inputs, const std::valarray& outputs); + +extern double mse(const std::valarray& y, const TargetInfo& t); +extern double rms(const std::valarray& y, const TargetInfo& t); +extern double mae(const std::valarray& y, const TargetInfo& t); + +// Todo Logistic Scaling + +#endif + + diff --git a/trunk/paradiseo-eo/contrib/mathsym/regression/TargetInfo.cpp b/trunk/paradiseo-eo/contrib/mathsym/regression/TargetInfo.cpp new file mode 100644 index 000000000..1d386e8c9 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/regression/TargetInfo.cpp @@ -0,0 +1,138 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#include "TargetInfo.h" + +using namespace std; + +TargetInfo::TargetInfo(const TargetInfo& org) { operator=(org); } + +TargetInfo& TargetInfo::operator=(const TargetInfo& org) { + _targets.resize(org._targets.size()); + _weights.resize(org._weights.size()); + _tcov_part.resize(org._tcov_part.size()); + + _targets = org._targets; + _weights = org._weights; + _tcov_part = org._tcov_part; + + _tmean = org._tmean; + _tvar = org._tvar; + _tstd = org._tstd; + _tmed = org._tmed; + return *this; +} + + +TargetInfo::TargetInfo(const std::valarray& t) { + _weights.resize(0); + _targets.resize(t.size()); + _targets = t; + + _tmean = _targets.sum()/_targets.size(); + + _tcov_part.resize(_targets.size()); + _tcov_part = _targets; + _tcov_part -= _tmean; + + std::valarray tmp = _tcov_part; + tmp = _tcov_part; + tmp *= tmp; + + _tvar = tmp.sum() / (tmp.size()-1); + _tstd = sqrt(_tvar); + _tmed = 0; +} + +TargetInfo::TargetInfo(const std::valarray& t, const std::valarray& w) { + + _targets.resize(t.size()); + _weights.resize(w.size()); + + _targets = t; + _weights = w; + + double sumw = _weights.sum(); + // scale weights so that they'll add up to 1 + _weights /= sumw; + + _tmean = (_targets * _weights).sum(); + _tcov_part.resize(_targets.size()); + _tcov_part = _targets; + _tcov_part -= _tmean; + + _tvar = (pow(_targets - _tmean, 2.0) * _weights).sum(); + _tstd = sqrt(_tvar); + _tmed = 0.; +} + +// calculate the members, now in the context of a mask +void TargetInfo::set_training_mask(const std::valarray& tmask) { + + TargetInfo tmp; + + if (has_weights() ) { + tmp = TargetInfo( _targets[tmask], _weights[tmask]); + } else { + tmp = TargetInfo( _targets[tmask] ); + } + + _tcov_part.resize(tmp._tcov_part.size()); + _tcov_part = tmp._tcov_part; + + _tmean = tmp._tmean; + _tvar = tmp._tvar; + _tstd = tmp._tstd; + _tmed = tmp._tmed; + + _training_mask.resize(tmask.size()); + _training_mask = tmask; +} + +struct SortOnTargets +{ + const valarray& t; + SortOnTargets(const valarray& v) : t(v) {} + + bool operator()(int i, int j) const { + return fabs(t[i]) < fabs(t[j]); + } +}; + +vector TargetInfo::sort() { + + vector ind(_targets.size()); + for (unsigned i = 0; i < ind.size(); ++i) { ind[i] = i; } + + std::sort(ind.begin(), ind.end(), SortOnTargets(_targets)); + + valarray tmptargets = _targets; + valarray tmpweights = _weights; + valarray tmpcov = _tcov_part; + + for (unsigned i = 0; i < ind.size(); ++i) + { + _targets[i] = tmptargets[ ind[i] ]; + _tcov_part[i] = tmpcov[ ind[i] ]; + if (_weights.size()) _weights[i] = tmpweights[ ind[i] ]; + } + + return ind; +} + + + diff --git a/trunk/paradiseo-eo/contrib/mathsym/regression/TargetInfo.h b/trunk/paradiseo-eo/contrib/mathsym/regression/TargetInfo.h new file mode 100644 index 000000000..ee9a307ff --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/regression/TargetInfo.h @@ -0,0 +1,65 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef TARGETINFO_H_ +#define TARGETINFO_H_ + +#include +#include + +class TargetInfo { + std::valarray _targets; + std::valarray _weights; + std::valarray _training_mask; + + // some stuff for ols + std::valarray _tcov_part; + double _tmean; + double _tvar; + double _tstd; + double _tmed; + + public: + TargetInfo() {} + + TargetInfo(const std::valarray& t); + TargetInfo(const std::valarray& t, const std::valarray& w); + + TargetInfo(const TargetInfo& org); + TargetInfo& operator=(const TargetInfo& org); + ~TargetInfo() {} + + const std::valarray& targets() const { return _targets; } + const std::valarray& weights() const { return _weights; } + const std::valarray& mask() const { return _training_mask; } + + void set_training_mask(const std::valarray& mask); + + bool has_weights() const { return _weights.size(); } + bool has_mask() const { return _training_mask.size(); } + + std::vector sort(); + + const std::valarray& tcov_part() const { return _tcov_part; } + double tmean() const { return _tmean; } + double tvar() const { return _tvar; } + double tstd() const { return _tstd; } + double devmedian() const { return _tmed; } +}; + +#endif + diff --git a/trunk/paradiseo-eo/contrib/mathsym/regression/stats.h b/trunk/paradiseo-eo/contrib/mathsym/regression/stats.h new file mode 100644 index 000000000..0ead60685 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/regression/stats.h @@ -0,0 +1,119 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#include + +class Mean { + + double n; + double mean; + + public: + Mean() : n(0), mean(0) {} + + void update(double v) { + n++; + double d = v - mean; + mean += 1/n * d; + } + + double get_mean() const { return mean; } +}; + +class Var { + double n; + double mean; + double sumvar; + + public: + Var() : n(0), mean(0), sumvar(0) {} + + void update(double v) { + n++; + double d = v - mean; + mean += 1/n * d; + sumvar += (n-1)/n * d * d; + } + + double get_mean() const { return mean; } + double get_var() const { return sumvar / (n-1); } + double get_std() const { return sqrt(get_var()); } +}; + +/** Single covariance between two variates */ +class Cov { + double n; + double meana; + double meanb; + double sumcov; + + public: + Cov() : n(0), meana(0), meanb(0), sumcov(0) {} + + void update(double a, double b) { + ++n; + double da = a - meana; + double db = b - meanb; + + meana += 1/n * da; + meanb += 1/n * db; + + sumcov += (n-1)/n * da * db; + } + + double get_meana() const { return meana; } + double get_meanb() const { return meanb; } + double get_cov() const { return sumcov / (n-1); } +}; + +class CovMatrix { + double n; + std::vector mean; + std::vector< std::vector > sumcov; + + public: + CovMatrix(unsigned dim) : n(0), mean(dim), sumcov(dim , std::vector(dim)) {} + + void update(const std::vector& v) { + n++; + + for (unsigned i = 0; i < v.size(); ++i) { + double d = v[i] - mean[i]; + mean[i] += 1/n * d; + + sumcov[i][i] += (n-1)/n * d * d; + + for (unsigned j = i; j < v.size(); ++j) { + double e = v[j] - mean[j]; // mean[j] is not updated yet + + double upd = (n-1)/n * d * e; + + sumcov[i][j] += upd; + sumcov[j][i] += upd; + + } + } + + } + + double get_mean(int i) const { return mean[i]; } + double get_var(int i ) const { return sumcov[i][i] / (n-1); } + double get_std(int i) const { return sqrt(get_var(i)); } + double get_cov(int i, int j) const { return sumcov[i][j] / (n-1); } + +}; + diff --git a/trunk/paradiseo-eo/contrib/mathsym/shared_ptr.h b/trunk/paradiseo-eo/contrib/mathsym/shared_ptr.h new file mode 100644 index 000000000..58353fe91 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/shared_ptr.h @@ -0,0 +1,102 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef _SHARED_PTR_H +#define _SHARED_PTR_H + + +template class weak_ptr; + +template +class shared_ptr { + private: + T* ptr; + unsigned* count; // + + /* special case, null pointer (nil-code) */ + static unsigned* nil() { static unsigned nil_counter(1); return &nil_counter; } + + void decref() { if (--(*count) == 0) { delete ptr; delete count; }} + void incref() { ++(*count); } + + friend class weak_ptr; + + public: + + shared_ptr() : ptr(0), count(nil()) { incref(); } + ~shared_ptr() { decref(); } + + shared_ptr(const shared_ptr& o) : ptr(o.ptr), count(o.count) { incref(); } + shared_ptr(T* p) : ptr(p), count(new unsigned(1)) {} + explicit shared_ptr(const weak_ptr& w) : ptr(w.ptr), count(w.count) { incref(); } + + shared_ptr& operator=(const shared_ptr& o) { + if (ptr == o.ptr) return *this; + decref(); + ptr = o.ptr; + count = o.count; + incref(); + return *this; + } + + T* get() { return ptr; } + T* operator->() { return ptr; } + T& operator*() { return *ptr; } + + const T* get() const { return ptr; } + const T* operator->() const { return ptr; } + const T& operator*() const { return *ptr; } + + bool operator==(const shared_ptr& o) const { return ptr == o.ptr; } + bool operator!=(const shared_ptr& o) const { return ptr != o.ptr; } + bool operator<(const shared_ptr& o) const { return ptr < o.ptr; } + + unsigned refcount() const { return *count; } +}; + +template +class weak_ptr { + T* ptr; + unsigned* count; + + friend class shared_ptr; + + public: + + weak_ptr() : ptr(0), count(shared_ptr::nil()) {} + explicit weak_ptr( const shared_ptr& s) : ptr(s.ptr), count(s.count) {} + + shared_ptr lock() const { return shared_ptr(*this); } + + + T* get() { return ptr; } + T* operator->() { return ptr; } + T& operator*() { return *ptr; } + + const T* get() const { return ptr; } + const T* operator->() const { return ptr; } + const T& operator*() const { return *ptr; } + + bool operator==(const shared_ptr& o) const { return ptr == o.ptr; } + bool operator!=(const shared_ptr& o) const { return ptr != o.ptr; } + bool operator<(const shared_ptr& o) const { return ptr < o.ptr; } + + unsigned refcount() const { return *count; } + +}; + +#endif diff --git a/trunk/paradiseo-eo/contrib/mathsym/sym/CVS/Entries b/trunk/paradiseo-eo/contrib/mathsym/sym/CVS/Entries new file mode 100644 index 000000000..9acf76824 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/sym/CVS/Entries @@ -0,0 +1,7 @@ +/README.cpp/1.1/Thu Oct 6 12:13:53 2005// +/Sym.cpp/1.3/Thu Nov 24 09:35:34 2005// +/Sym.h/1.4/Thu Nov 24 09:35:34 2005// +/SymImpl.cpp/1.2/Sat Oct 15 21:27:47 2005// +/SymImpl.h/1.4/Thu Nov 24 09:35:34 2005// +/token.h/1.1/Thu Oct 6 12:13:53 2005// +D diff --git a/trunk/paradiseo-eo/contrib/mathsym/sym/CVS/Repository b/trunk/paradiseo-eo/contrib/mathsym/sym/CVS/Repository new file mode 100644 index 000000000..96b277661 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/sym/CVS/Repository @@ -0,0 +1 @@ +eo/contrib/mathsym/sym diff --git a/trunk/paradiseo-eo/contrib/mathsym/sym/CVS/Root b/trunk/paradiseo-eo/contrib/mathsym/sym/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/sym/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/contrib/mathsym/sym/README.cpp b/trunk/paradiseo-eo/contrib/mathsym/sym/README.cpp new file mode 100644 index 000000000..c62e6cbac --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/sym/README.cpp @@ -0,0 +1,364 @@ + +/* + DESCRIPTION: + + +The class 'Sym' in this package provides a reference counted, hashed tree structure that can be used in genetic programming. +The hash table behind the scenes makes sure that every subtree in the application is stored only once. +This has a couple of advantages: + +o Memory: all subtrees are stored only once +o Comparison: comparison for equality for two subtrees boils down to a pointer comparison +o Overview: by accessing the hashtable, you get an instant overview of the state of the population + + +The disadvantage of this method is the constant time overhead for computing hashes. In practice, +it seems to be fast enough. + + +===== How to Use this ========= + +In essence, the Sym data structure contains two important pieces of data, +the 'token' (of type token_t = int) and the children, a vector of Sym (called SymVec). +The token should contain all information to be able to figure out which +function/terminal is represented by the node in the tree. By retrieving this token value +and the SymVec it is possible to write recursive traversal routines for evaluation, printing, +etc. + +*/ + +#include +#include "Sym.h" + +using namespace std; + + +/* + * Suppose token value '0' designates our terminal, and token value '1' designates a binary function. + * Later on a ternary function will be used as well, designated with token value '2' + * The function below will create a tree of size three +*/ +Sym test1() { + + SymVec children; + children.push_back( Sym(0) ); // push_back is a member from std::vector, SymVec is derived from std::vector + children.push_back( Sym(0) ); + + Sym tree = Sym(token_t(1), children); // creates the tree + + /* Done, now print some information about the node */ + + cout << "Size = " << tree.size() << endl; // prints 3 + cout << "Depth = " << tree.depth() << endl; // prints 2 + cout << "Refcount = " << tree.refcount() << endl; // prints 1 + + Sym tree2 = tree; // make a copy (this only changes refcount) + + cout << "Refcount now = " << tree.refcount() << endl; // print 2 + + return tree; // tree2 will be deleted and reference count returns to 1 +} + +/* To actually use the tree, evaluate it, the following simple recursive function + * can be used +*/ + +int eval(const Sym& sym) { + if (sym.token() == 0) { // it's a terminal in this example + return 1; + } + // else it's the function + const SymVec& children = sym.args(); // get the children out, children.size() is the arity + + // let's assume that we've also got a ternary function designated by token '2' + + if (sym.token() == token_t(1)) + return eval(children[0]) + eval(children[1]); // evaluate + + return eval(children[0]) + eval(children[1]) * eval(children[2]); // a ternary function +} + +/* Note that you simply use the stored token that was defined above. Simply checking the size of SymVec in + * this particular example could have sufficed, but it's instructive to use the tokens. + * + * And to test this: +*/ + +void test_eval() { + + Sym tree = test1(); + + cout << "Evaluating tree1 returns " << eval(tree) << endl; +} + +/* Writing initialization functions. + * + * As the Sym class is recursive in nature, initialization can simply be done using + * recursive routines as above. As an example, the following code does 'full' initialization. + */ + +Sym init_full(int depth_left) { + if (depth_left == 0) return Sym(0); // create terminal + // else create either a binary or a ternary function + + depth_left--; + + if (rand() % 2 == 0) { // create binary + SymVec vec(2); + vec[0] = init_full(depth_left); + vec[1] = init_full(depth_left); + + return Sym(token_t(1), vec); + + } else { // create ternary tree + SymVec vec(3); + vec[0] = init_full(depth_left); + vec[1] = init_full(depth_left); + vec[2] = init_full(depth_left); + + return Sym(token_t(2), vec); // token value 2 designates a ternary now, even though the arity can simply be read from the size of the 'SymVec' + } + +} + + +/* Examining the hash table. + * + * The hash table is a static member of the Sym class, but can be obtained and inspected + * at any point during the run. The hash table follows the SGI implementation of hashmap (and effectively + * uses it in gcc). An example: + */ + +void inspect_hashtable() { + SymMap& dag = Sym::get_dag(); // get the hashmap + unsigned i = 0; + for (SymMap::iterator it = dag.begin(); it != dag.end(); ++it) { + Sym node(it); // initialize a 'sym' with the iterator + + cout << "Node " << i++ << " size " << node.size(); + cout << " refcount " << node.refcount()-1; // -1: note that by creating the Sym above the refcount is increased + cout << " depth " << node.depth(); + cout << '\n'; + } + +} + +/* The above code effectively examines all distinct subtrees in use in the application and prints some stats for the node */ + +/* Manipulating trees + * + * The Sym class is set up in such a way that you cannot change a Sym, so how do you perform crossover and mutation? + * + * Simple, you create new syms. The Sym class supports two functions to make this easier: 'get_subtree' and 'insert_subtree'. + * These traverse the tree by index, where 0 designates the root and other values are indexed depth first. + */ + +Sym subtree_xover(Sym a, Sym b) { + + Sym to_insert = get_subtree(a, rand() % a.size() ); // select random subtree, will crash if too high a value is given + + /* 'insert' it into b. This will not really insert, it will however create a new sym, + * equal to 'b' but with a's subtree inserted at the designated spot. */ + return insert_subtree(b, rand() % b.size(), to_insert); + +} + +/* Tying it together, we can create a simple genetic programming system. Mutation is not implemented here, + * but would be easy enough to add by using recursion and/or 'set'. */ + +void run_gp() { + + int ngens = 50; + int popsize = 1000; + + cout << "Starting running " << popsize << " individuals for " << ngens << " generations." << endl; + + vector pop(popsize); + + // init population + for (unsigned i = 0; i < pop.size(); ++i) { + pop[i] = init_full(5); + } + + double best = 0.0; + + // do a very simple steady state tournament + for (unsigned gen = 0; gen < ngens * pop.size(); ++gen) { + int sel1 = rand()% pop.size(); + int sel2 = rand() % pop.size(); + int sel3 = rand() % pop.size(); + + double ev1 = eval(pop[sel1]); + double ev3 = eval(pop[sel3]); + + double bst = max(ev1,ev3); + if (bst > best) { + best = bst; + } + + if (ev3 > ev1) { + sel1 = sel3; // selection pressure + } + + Sym child = subtree_xover(pop[sel1], pop[sel2]); + + // Check for uniqueness + if (child.refcount() == 1) pop[ rand() % pop.size() ] = child; + } + + // and at the end: + + inspect_hashtable(); + + // and also count number of nodes in the population + int sz = 0; + for (unsigned i = 0; i < pop.size(); ++i) { sz += pop[i].size(); } + cout << "Number of distinct nodes " << Sym::get_dag().size() << endl; + cout << "Nodes in population " << sz << endl; + cout << "ratio " << double(Sym::get_dag().size())/sz << endl; + cout << "Best fitness " << best << endl; + +} + +/* One extra mechanism is supported to add annotations to nodes. Something derived from + * 'UniqueNodeStats' can be used to attach new information to nodes. For this to function, + * we need to supply a 'factory' function that creates these node-stats; attach this function to the + * Sym class, so that it gets called whenever a new node is created. The constructors of the Sym class + * take care of this. + * + * IMPORTANT: + * in a realistic application, the factory function needs to be set BEFORE any Syms are created + * Mixing Syms creating with and without the factory can lead to unexpected results + * + * First we derive some structure from UniqueNodeStats: */ + +struct MyNodeStats : public UniqueNodeStats { + + int sumsize; + + ~MyNodeStats() { cout << "MyNodeStats::~MyNodeStats, sumsize = " << sumsize << endl; } +}; + +/* then define the factory function. It will get a Sym, which is just created. */ +UniqueNodeStats* create_stats(const Sym& sym) { + MyNodeStats* stats = new MyNodeStats; // Sym will take care of memory management + + int sumsize = sym.size(); + for (unsigned i = 0; i < sym.args().size(); ++i) { + // retrieve the extra node stats of the child + UniqueNodeStats* unique_stats = sym.args()[i].extra_stats(); // extra_stats retrieves the stats + MyNodeStats* child_stats = static_cast(unique_stats); // cast it to the right struct + sumsize += child_stats->sumsize; + } + + stats->sumsize = sumsize; + return stats; // now it will get attached to the node and deleted when its reference count goes to zero +} + +void test_node_stats() { + + if (Sym::get_dag().size() != 0) { + cerr << "Cannot mix nodes with and without factory functions" << endl; + exit(1); + } + + /* Very Important: attach the factory function to the Sym class */ + Sym::set_factory_function(create_stats); + + Sym tree = init_full(5); // create a tree + + // get extra node stats out + MyNodeStats* stats = static_cast( tree.extra_stats() ); + + cout << "Size = " << tree.size() << " SumSize = " << stats->sumsize << endl; + + Sym::clear_factory_function(); // reset +} + + +/* And run the code above */ + +int main() { + srand(time(0)); + cout << "********** TEST EVALUATION **************\n"; + test_eval(); + cout << "********** TEST ALGORITHM ***************\n"; + run_gp(); + + cout << "********** TEST FACTORY ****************\n"; + test_node_stats(); // can work because there are no live nodes + +} + +/* ********** Member function reference: ******************** + * + * Sym() The default constructor will create an undefined node (no token and no children), check for empty() to see if a node is undefined + * + * Sym(token_t) Create a terminal + * + * Sym(token_t, const SymVec&) + * Create a node with token and SymVec as the children + * + * Sym(SymIterator it) + * Create a sym from an iterator (taken from the hashtable directly, or from Sym::iterator) + * + * dtor, copy-ctor and assignment + * + * UniqueNodeStats* extra_stats() + * Returns an UniqueNodeStats pointer (= 0 if no factory is defined) + * + * + * int hashcode() returns the hashcode for the node + * + * int refcount() returns the reference count for the node + * + * bool operator== checks for equality (note that this is a pointer compare, really really fast) + * + * bool empty() returns whether the node is undefined, i.e. created through the default ctor + * + * int arity() shorthand for sym.args().size() + * + * token_t token() return identifying token for the node + * + * const SymVec& args() + * returns the children of the node (in a vector) + * + * unsigned size() returns the size, i.e., number of nodes + * + * unsigned depth() returns the depth + * + * iterator() returns the pointer to the node in the hashtable + * + * + ********** Static functions: ******************** + * + * + * + * SymMap& get_dag() returns the hash table containing all nodes. This should only be used for inspection, + * even though the dag itself is not const. This to enable the use of the ctor Sym(SymIterator) to inspect + * using the Sym interface (rather than the hash table interface). This does allow you to make destructive + * changes to the class, so use with care + * + * set_factory_function( UniqueNodeStats (*)(const Sym&) ) + * Set the factory function + * + * clear_factory_function() + * Clears the factory function, allocated UniqueNodeStats will still be deleted, but no new ones will be created. + * + ********** Utility Functions ******************** + * + * Sym get_subtree(const Sym& org, int i) + * Retreive the i-th subtree from the Sym. Standard depth first ordering, where root has index 0 and the + * rightmost terminal has index sym.size()-1 + * + * Sym insert_subtree(const Sym& org, int i, const Sym& subtree) + * Returns a Sym that is equal to 'org', for which the i-th subtree (same ordering as get_subtree) is replaced + * by the third argument subtree. + * + * Sym next(const Sym&) + * Returns the successor of the argument sym from the hashtable with wrap around. This is implemented just because + * it can be done. It may be an interesting way to mutate... + * + * */ + + diff --git a/trunk/paradiseo-eo/contrib/mathsym/sym/Sym.cpp b/trunk/paradiseo-eo/contrib/mathsym/sym/Sym.cpp new file mode 100644 index 000000000..4d3c2227d --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/sym/Sym.cpp @@ -0,0 +1,155 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#include +#include + +#include "Sym.h" + +using namespace std; + +typedef UniqueNodeStats* (*NodeStatFunc)(Sym&); + +UniqueNodeStats* (*Sym::factory)(const Sym&) = 0; + +SymMap Sym::dag(100000); // reserve space for so many nodes +std::vector Sym::token_count; + + +size_t get_size(const SymVec& vec) { + size_t sz = 0; + for (unsigned i = 0; i < vec.size(); ++i) { + sz += vec[i].size(); + } + return sz; +} + +size_t get_depth(const SymVec& vec) { + size_t dp = 1; + for (unsigned i = 0; i < vec.size(); ++i) { + dp = std::max(dp, vec[i].depth()); + } + return dp; +} + +Sym::Sym(token_t tok, const SymVec& args_) : node(dag.end()) +{ + detail::SymKey key(tok, detail::SymArgs(args_)); + detail::SymValue val; + + node = dag.insert(pair(key, val)).first; + + if (__unchecked_refcount() == 0) { // new node, set some stats + node->second.size = 1 + get_size(args_); + node->second.depth = 1 + get_depth(args_); + + // token count + if (tok >= token_count.size()) { + token_count.resize(tok+1); + } + + incref(); + node->first.fixate(); + // call the factory function if available + if (factory) node->second.uniqueNodeStats = factory(*this); + + } + else incref(); +} + +Sym::Sym(token_t tok, const Sym& a) : node(dag.end()) { + SymVec args_; args_.push_back(a); + detail::SymKey key(tok, detail::SymArgs(args_)); + detail::SymValue val; + + node = dag.insert(pair(key, val)).first; + + if (__unchecked_refcount() == 0) { // new node, set some stats + node->second.size = 1 + get_size(args_); + node->second.depth = 1 + get_depth(args_); + + // token count + if (tok >= token_count.size()) { + token_count.resize(tok+1); + } + + incref(); + node->first.fixate(); + // call the factory function if available + if (factory) node->second.uniqueNodeStats = factory(*this); + } + else incref(); +} + +Sym::Sym(token_t tok) : node(dag.end()) { + detail::SymKey key(tok); + detail::SymValue val; + node = dag.insert(pair(key, val)).first; + + if (__unchecked_refcount() == 0) { // new node, set some stats + node->second.size = 1; + node->second.depth = 1; + + // token count + if (tok >= token_count.size()) { + token_count.resize(tok+1); + } + + incref(); + + // call the factory function if available + if (factory) node->second.uniqueNodeStats = factory(*this); + + } + else incref(); +} + +std::pair insert_subtree_impl(const Sym& cur, size_t w, const Sym& nw) { + if (w-- == 0) return make_pair(nw, !(nw == cur)); + + const SymVec& vec = cur.args(); + std::pair result; + unsigned i; + + for (i = 0; i < vec.size(); ++i) { + if (w < vec[i].size()) { + result = insert_subtree_impl(vec[i], w, nw); + if (result.second == false) return std::make_pair(cur, false); // unchanged + break; + } + w -= vec[i].size(); + } + SymVec newvec = cur.args(); + newvec[i] = result.first; + return make_pair(Sym(cur.token(), newvec), true); +} + +Sym insert_subtree(const Sym& cur, size_t w, const Sym& nw) { + return insert_subtree_impl(cur,w,nw).first; +} +Sym get_subtree(const Sym& cur, size_t w) { + if (w-- == 0) return cur; + + const SymVec& vec = cur.args(); + for (unsigned i = 0; i < vec.size(); ++i) { + if (w < vec[i].size()) return get_subtree(vec[i], w); + w-=vec[i].size(); + } + return cur; +} + + diff --git a/trunk/paradiseo-eo/contrib/mathsym/sym/Sym.h b/trunk/paradiseo-eo/contrib/mathsym/sym/Sym.h new file mode 100644 index 000000000..e90882fb9 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/sym/Sym.h @@ -0,0 +1,174 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef SYMNODE_H_ +#define SYMNODE_H_ + +#include + +#if __GNUC__ >= 3 +#include +#elif __GNUC__ < 3 +#include +using std::hash_map; +#endif + +/* Empty 'extra statistics' structure, derive from this to keep other characteristics of nodes */ +struct UniqueNodeStats { virtual ~UniqueNodeStats(){} }; + +#include "SymImpl.h" +#include "token.h" + +#if __GNUC__ == 4 +#define USE_TR1 1 +#else +#define USE_TR1 0 +#endif + +#if USE_TR1 +#include +typedef std::tr1::unordered_map SymMap; +#else +typedef hash_map SymMap; +#endif + +typedef SymMap::iterator SymIterator; + +/* Sym is the tree, for which all the nodes are stored in a hash table. + * This makes checking for equality O(1) */ +class Sym +{ + public: + + Sym() : node(dag.end()) {} + explicit Sym(token_t token, const SymVec& args); + explicit Sym(token_t token, const Sym& args); + explicit Sym(token_t var); + + explicit Sym(SymIterator it) : node(it) { incref(); } + + Sym(const Sym& oth) : node(oth.node) { incref(); } + ~Sym() { decref(); } + + const Sym& operator=(const Sym& oth) { + if (oth.node == node) return *this; + decref(); + node = oth.node; + incref(); + return *this; + } + + /* Unique Stats are user defined */ + UniqueNodeStats* extra_stats() const { return empty()? 0 : node->second.uniqueNodeStats; } + + int hashcode() const { return node->first.get_hash_code(); } //detail::SymKey::Hash hash; return hash(node->first); } + + // Friends, need to touch the node + friend struct detail::SymKey::Hash; + friend struct detail::SymKey; + + unsigned refcount() const { return empty()? 0: node->second.refcount; } + + bool operator==(const Sym& other) const { + return node == other.node; + } + bool operator!=(const Sym& other) const { return !(*this == other); } + + bool empty() const { return node == dag.end(); } + + /* Support for traversing trees */ + unsigned arity() const { return node->first.arity(); } + token_t token() const { return node->first.token; } + + const SymVec& args() const { return node->first.vec(); } + + /* size() - depth */ + unsigned size() const { return empty()? 0 : node->second.size; } + unsigned depth() const { return empty()? 0 : node->second.depth; } + + SymMap::iterator iterator() const { return node; } + + /* Statics accessing some static members */ + static SymMap& get_dag() { return dag; } + + /* This function can be set to create some UniqueNodeStats derivative that can contain extra stats for a node, + * it can for instance be used to create ERC's and what not. */ + static void set_factory_function(UniqueNodeStats* (*f)(const Sym&)) { factory=f; } + static void clear_factory_function() { factory = 0; } + + static const std::vector& token_refcount() { return token_count; } + + unsigned address() const { return reinterpret_cast(&*node); } + + private : + + // implements getting subtrees + Sym private_get(size_t w) const; + + unsigned __unchecked_refcount() const { return node->second.refcount; } + + void incref() { + if (!empty()) { + ++(node->second.refcount); + ++token_count[token()]; + } + } + void decref() { + if (!empty()) { + --token_count[token()]; + if (--(node->second.refcount) == 0) { + dag.erase(node); + } + } + } + + // The one and only data member, an iterator into the static map below + SymIterator node; + + // A static hash_map that contains all live nodes.. + static SymMap dag; + + static std::vector token_count; + + // Factory function for creating extra node stats, default will be 0 + static UniqueNodeStats* (*factory)(const Sym&); + +}; + +/* Utility hash functor for syms */ +class HashSym { + public: + int operator()(const Sym& sym) const { return sym.hashcode(); } +}; + +/* Utility Functions */ + +// get_subtree retrieves a subtree by standard ordering (0=root, and then depth first) +Sym get_subtree(const Sym& org, size_t w); + +// insert_subtree uses the same ordering as get and inserts the second argument, returning a new tree +Sym insert_subtree(const Sym& org, size_t w, const Sym& nw); + +/* Get the successor from the hashtable, no particular purpose other than an interesting way to mutate */ +inline Sym next(const Sym& sym) { + SymIterator it = sym.iterator(); + ++it; + if (it == Sym::get_dag().end()) it = Sym::get_dag().begin(); + return Sym(it); +} + +#endif diff --git a/trunk/paradiseo-eo/contrib/mathsym/sym/SymImpl.cpp b/trunk/paradiseo-eo/contrib/mathsym/sym/SymImpl.cpp new file mode 100644 index 000000000..b2d568a61 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/sym/SymImpl.cpp @@ -0,0 +1,109 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ +#include "Sym.h" + +using namespace std; +namespace detail { + +class SymArgsImpl { + public: + std::vector owned_args; +}; + +size_t SymArgs::len() const { + return vec().size(); +} + +SymArgs::SymArgs() : pimpl( new SymArgsImpl ) { + args_ptr = &pimpl->owned_args; +} + +SymArgs::SymArgs(const std::vector& v) : pimpl(0) { + args_ptr = &v; +} + +SymArgs::~SymArgs() { + delete pimpl; +} + +SymArgs::SymArgs(const SymArgs& args) : pimpl(0), args_ptr(args.args_ptr) { + if (args.pimpl && args.args_ptr == &args.pimpl->owned_args) { + pimpl = new SymArgsImpl(*args.pimpl); + args_ptr = &pimpl->owned_args; + } +} + +const SymArgs& SymArgs::operator=(const SymArgs& args) { + if (args.pimpl && args.args_ptr == &args.pimpl->owned_args) { + pimpl = new SymArgsImpl(*args.pimpl); + args_ptr = &pimpl->owned_args; + } else { + args_ptr = args.args_ptr; + } + + return *this; +} + +void SymArgs::fixate() const { + assert(pimpl == 0); + pimpl = new SymArgsImpl; + pimpl->owned_args = *args_ptr; + args_ptr = &pimpl->owned_args; +} + +// For Tackett's hashcode +#define PRIMET 21523 +#define HASHMOD 277218551 + +const int nprimes = 4; +const unsigned long primes[] = {3221225473ul, 201326611ul, 1610612741ul, 805306457ul}; + +int SymKey::calc_hash() const { + unsigned long hash = unsigned(token); + hash *= PRIMET; + + const std::vector& v = args.vec(); + for (unsigned i = 0; i < v.size(); ++i) { + hash += ( (v[i].address() >> 3) * primes[i%nprimes]) % HASHMOD; + } + + return hash;// % HASHMOD; +} + +bool SymKey::operator==(const SymKey& other) const { + if (token != other.token) return false; + return args.vec() == other.args.vec(); +} + +/* Just to store this info somewhere: + * + * Address Based Hash Function Implementation + * uint32 address_hash(char* addr) + * { + * register uint32 key; + * key = (uint32) addr; + * return (key >> 3) * 2654435761; + * } + */ + +SymValue::SymValue() : refcount(0), size(0), depth(0), uniqueNodeStats(0) {} + +SymValue::~SymValue() { delete uniqueNodeStats; } + + + +} // namespace detail diff --git a/trunk/paradiseo-eo/contrib/mathsym/sym/SymImpl.h b/trunk/paradiseo-eo/contrib/mathsym/sym/SymImpl.h new file mode 100644 index 000000000..64251f57c --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/sym/SymImpl.h @@ -0,0 +1,113 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ +#ifndef __SYM_IMPL_H__ +#define __SYM_IMPL_H__ + +#include + +#include "token.h" + +class Sym; + +#if __GNUC__ > 4 +#include +typedef std::vector > std::vector; +//typedef std::vector SymVec; +#else +typedef std::vector SymVec; +#endif + + +namespace detail { + +class SymArgsImpl; +class SymArgs { + + mutable SymArgsImpl* pimpl; // contains circular reference to vector + mutable const std::vector* args_ptr; + + public: + + SymArgs(); + SymArgs(const std::vector& v); + ~SymArgs(); + + SymArgs(const SymArgs& args); + const SymArgs& SymArgs::operator=(const SymArgs& other); + + size_t len() const; + const std::vector& vec() const { return *args_ptr; } + void fixate() const; +}; + +class SymKey +{ + public: + SymKey(token_t _token) : args(), token(_token), hash_code(calc_hash()) {} + SymKey(token_t _token, const detail::SymArgs& _args) : args(_args), token(_token), hash_code(calc_hash()) {} + + bool operator==(const SymKey& other) const; + + struct Hash + { + int operator()(const SymKey& k) const { return k.calc_hash(); }; + }; + + unsigned arity() const { return args.len(); } + const std::vector& vec() const { return args.vec(); } + + // fixates (i.e. claims memory) for the embedded vector of Syms + void fixate() const { args.fixate(); } + + int get_hash_code() const { return hash_code; } + + detail::SymArgs args; + token_t token; // identifies the function + + private: + int calc_hash() const; + int hash_code; +}; + +struct SymValue +{ + friend class Sym; + + SymValue(); + ~SymValue(); + + unsigned getRefCount() const { return refcount; } + unsigned getSize() const { return size; } + unsigned getDepth() const { return depth; } + + + + // for reference counting + unsigned refcount; + + // some simple stats + unsigned size; + unsigned depth; + UniqueNodeStats* uniqueNodeStats; + +}; + + +} // namespace detail + +#endif + diff --git a/trunk/paradiseo-eo/contrib/mathsym/sym/token.h b/trunk/paradiseo-eo/contrib/mathsym/sym/token.h new file mode 100644 index 000000000..68008959d --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/sym/token.h @@ -0,0 +1,28 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ +#ifndef TOKEN_H +#define TOKEN_H + + +typedef unsigned token_t; + +struct functor_t { + token_t token; + unsigned arity; +}; + +#endif diff --git a/trunk/paradiseo-eo/contrib/mathsym/symreg.cpp b/trunk/paradiseo-eo/contrib/mathsym/symreg.cpp new file mode 100644 index 000000000..cc90e4e15 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/symreg.cpp @@ -0,0 +1,393 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + + +#include +#include +#include +#include + +#include +#include +#include +#include +//#include +#include +#include +#include +#include +#include +#include +#include +#include + +#include +#include +#include +#include +#include + +using namespace std; + +typedef EoSym EoType; + +static int functions_added = 0; + +void add_function(LanguageTable& table, eoParser& parser, string name, unsigned arity, token_t token, const FunDef& fun); +void setup_language(LanguageTable& table, eoParser& parser); + +template +T& select(bool check, T& a, T& b) { if (check) return a; return b; } + +class eoBestIndividualStat : public eoSortedStat { + public: + eoBestIndividualStat() : eoSortedStat("", "best individual") {} + + void operator()(const vector& _pop) { + ostringstream os; + os << (Sym) *_pop[0]; + value() = os.str(); + } + +}; + +class AverageSizeStat : public eoStat { + public: + AverageSizeStat() : eoStat(0.0, "Average size population") {} + + void operator()(const eoPop& _pop) { + double total = 0.0; + for (unsigned i = 0; i < _pop.size(); ++i) { + total += _pop[i].size(); + } + value() = total/_pop.size(); + } +}; + +class SumSizeStat : public eoStat { + public: + SumSizeStat() : eoStat(0u, "Number of subtrees") {} + + void operator()(const eoPop& _pop) { + unsigned total = 0; + for (unsigned i = 0; i < _pop.size(); ++i) { + total += _pop[i].size(); + } + value() = total; + } +}; + +class DagSizeStat : public eoStat { + public: + DagSizeStat() : eoStat(0u, "Number of distinct subtrees") {} + + void operator()(const eoPop& _pop) { + value() = Sym::get_dag().size(); + } +}; + +int main(int argc, char* argv[]) { + + eoParser parser(argc, argv); + + /* Language */ + LanguageTable table; + setup_language(table, parser); + + /* Data */ + + eoValueParam datafile = parser.createParam(string(""), "datafile", "Training data", 'd', string("Regression"), true); // mandatory + double train_percentage = parser.createParam(1.0, "trainperc", "Percentage of data used for training", 0, string("Regression")).value(); + + /* Population */ + + unsigned pop_size = parser.createParam(1500u, "population-size", "Population Size", 'p', string("Population")).value(); + + uint32_t seed = parser.createParam( uint32_t(time(0)), "random-seed", "Seed for rng", 'D').value(); + + cout << "Seed " << seed << endl; + rng.reseed(seed); + + double var_prob = parser.createParam( + 0.9, + "var-prob", + "Probability of selecting a var vs. const when creating a terminal", + 0, + "Population").value(); + + + double grow_prob = parser.createParam( + 0.5, + "grow-prob", + "Probability of selecting 'grow' method instead of 'full' in initialization and mutation", + 0, + "Population").value(); + + unsigned max_depth = parser.createParam( + 8u, + "max-depth", + "Maximum depth used in initialization and mutation", + 0, + "Population").value(); + + + bool use_uniform = parser.createParam( + false, + "use-uniform", + "Use uniform node selection instead of bias towards internal nodes (functions)", + 0, + "Population").value(); + + double constant_mut_prob = parser.createParam( + 0.1, + "constant-mut-rate", + "Probability of performing constant mutation", + 0, + "Population").value(); + + + double subtree_mut_prob = parser.createParam( + 0.2, + "subtree-mut-rate", + "Probability of performing subtree mutation", + 0, + "Population").value(); + + double node_mut_prob = parser.createParam( + 0.2, + "node-mut-rate", + "Probability of performing node mutation", + 0, + "Population").value(); + +/* double lambda_mut_prob = parser.createParam( + 1.0, + "lambda-mut-rate", + "Probability of performing (neutral) lambda extraction/expansion", + 0, + "Population").value(); +*/ + double subtree_xover_prob = parser.createParam( + 0.4, + "xover-rate", + "Probability of performing subtree crossover", + 0, + "Population").value(); + + double homologous_prob = parser.createParam( + 0.4, + "homologous-rate", + "Probability of performing homologous crossover", + 0, + "Population").value(); + + unsigned max_gens = parser.createParam( + 50, + "max-gens", + "Maximum number of generations to run", + 'g', + "Population").value(); + + unsigned tournamentsize = parser.createParam( + 5, + "tournament-size", + "Tournament size used for selection", + 't', + "Population").value(); + + unsigned maximumSize = parser.createParam( + -1u, + "maximum-size", + "Maximum size after crossover", + 's', + "Population").value(); + + unsigned meas_param = parser.createParam( + 2u, + "measure", + "Error measure:\n\ + 0 -> absolute error\n\ + 1 -> mean squared error\n\ + 2 -> mean squared error scaled (equivalent with correlation)\n\ + ", + 'm', + "Regression").value(); + + + ErrorMeasure::measure meas = ErrorMeasure::mean_squared_scaled; + if (meas_param == 0) meas = ErrorMeasure::absolute; + if (meas_param == 1) meas = ErrorMeasure::mean_squared; + + + /* End parsing */ + if (parser.userNeedsHelp()) + { + parser.printHelp(std::cout); + return 1; + } + + if (functions_added == 0) { + cout << "ERROR: no functions defined" << endl; + exit(1); + } + + + Dataset dataset; + dataset.load_data(datafile.value()); + + cout << "Data " << datafile.value() << " loaded " << endl; + + /* Add Variables */ + unsigned nvars = dataset.n_fields(); + for (unsigned i = 0; i < nvars; ++i) { + table.add_function( SymVar(i).token(), 0); + } + + TreeBuilder builder(table, var_prob); + eoSymInit init(builder, grow_prob, max_depth); + + eoPop pop(pop_size, init); + + BiasedNodeSelector biased_sel; + RandomNodeSelector random_sel; + + NodeSelector& node_selector = select(use_uniform, random_sel, biased_sel); + + //eoProportionalOp genetic_operator; + eoSequentialOp genetic_operator; + + eoSymSubtreeMutate submutate(builder, node_selector); + genetic_operator.add( submutate, subtree_mut_prob); + + // todo, make this parameter, etc + double std = 0.01; + eoSymConstantMutate constmutate(std); + genetic_operator.add(constmutate, constant_mut_prob); + + eoSymNodeMutate nodemutate(table); + genetic_operator.add(nodemutate, node_mut_prob); + +// eoSymLambdaMutate lambda_mutate(node_selector); +// genetic_operator.add(lambda_mutate, lambda_mut_prob); // TODO: prob should be settable + + //eoQuadSubtreeCrossover quad(node_selector); + eoBinSubtreeCrossover bin(node_selector); + genetic_operator.add(bin, subtree_xover_prob); + + eoBinHomologousCrossover hom; + genetic_operator.add(hom, homologous_prob); + + + IntervalBoundsCheck check(dataset.input_minima(), dataset.input_maxima()); + ErrorMeasure measure(dataset, train_percentage, meas); + + eoSymPopEval evaluator(check, measure, maximumSize); + + eoDetTournamentSelect selectOne(tournamentsize); + eoGeneralBreeder breeder(selectOne, genetic_operator); + eoPlusReplacement replace; + + // Terminators + eoGenContinue term(max_gens); + eoCheckPoint checkpoint(term); + + eoBestFitnessStat beststat; + checkpoint.add(beststat); + + eoBestIndividualStat printer; + AverageSizeStat avgSize; + DagSizeStat dagSize; + SumSizeStat sumSize; + + checkpoint.add(printer); + checkpoint.add(avgSize); + checkpoint.add(dagSize); + checkpoint.add(sumSize); + + eoStdoutMonitor genmon; + genmon.add(beststat); + genmon.add(printer); + genmon.add(avgSize); + genmon.add(dagSize); + genmon.add(sumSize); + genmon.add(term); // add generation counter + + checkpoint.add(genmon); + + eoPop dummy; + evaluator(pop, dummy); + + eoEasyEA ea(checkpoint, evaluator, breeder, replace); + + ea(pop); // run + +} + +void add_function(LanguageTable& table, eoParser& parser, string name, unsigned arity, token_t token, const FunDef& fun, bool all) { + ostringstream desc; + desc << "Enable function " << name << " arity = " << arity; + bool enabled = parser.createParam(false, name, desc.str(), 0, "Language").value(); + + if (enabled || all) { + cout << "Func " << name << " enabled" << endl; + table.add_function(token, arity); + if (arity > 0) functions_added++; + } +} + +void setup_language(LanguageTable& table, eoParser& parser) { + + bool all = parser.createParam(false,"all", "Enable all functions").value(); + bool ratio = parser.createParam(false,"ratio","Enable rational functions (inv,min,sum,prod)").value(); + bool poly = parser.createParam(false,"poly","Enable polynomial functions (min,sum,prod)").value(); + + // assumes that at this point all tokens are defined (none are zeroed out, which can happen with ERCs) + vector lang = get_defined_functions(); + + for (token_t i = 0; i < lang.size(); ++i) { + + if (lang[i] == 0) continue; + + bool is_poly = false; + if (poly && (i == prod_token || i == sum_token || i == min_token) ) { + is_poly = true; + } + + bool is_ratio = false; + if (ratio && (is_poly || i == inv_token)) { + is_ratio = true; + } + + const FunDef& fun = *lang[i]; + + if (fun.has_varargs() ) { + + for (unsigned j = fun.min_arity(); j < fun.min_arity() + 8; ++j) { + if (j==1) continue; // prod 1 and sum 1 are useless + ostringstream nm; + nm << fun.name() << j; + bool addanyway = (all || is_ratio || is_poly) && j == 2; + add_function(table, parser, nm.str(), j, i, fun, addanyway); + } + } + else { + add_function(table, parser, fun.name(), fun.min_arity(), i, fun, all || is_ratio || is_poly); + } + } +} + + diff --git a/trunk/paradiseo-eo/contrib/mathsym/tcc.tar.gz b/trunk/paradiseo-eo/contrib/mathsym/tcc.tar.gz new file mode 100644 index 0000000000000000000000000000000000000000..5b935473328f928c39320b732179e76b5868aab8 GIT binary patch literal 427170 zcmV(=K-s?^iwFRR_e4Vg1MFLEbK^LU?$7xZ+?}e8-Qzfx{N6o1Q;y>#o_6ekVuF){5bir2zD*f4kl4wAu};3I1={-Od}<_$`zzi4?`#MfJ{&> zw?WGGNxVs%9fKeJgmae0e)ixb{5^Y$bLKh`OSl)LSrV-CjI$tPPUM}(3ERb9;6DjL zFqlUkPgu6)EaS;8Ww9@Qxt`v$Yaa2$3E5q~4g;4>K$9rt%z?RaB;9h4tw|8FT%i^V zsRg@=L9&Aje9w3Qc)|`mN#S>9t4XB98jBMlrQ&3$d;&&7#wuw1#6l-4c&W6oo!=4 z`GJ$HV7Ctg5DiO9oG5#O6$lZxqxtX#cm@~a$$0r07Q(K^%jsybU{|v_8?d{#cR#n7)z}}Sc>l*5Ydkg@RUEvSj|LxMc%5+P z3jvk@CYOWx^{N3-=sC%z-XPF6Kud!bflULnHE0vqGQg$=n*_EcIGGLQoMG&$IXebu zX;9ADH9%W~a?YLsHZ>^c>zCcG$MX>s3xH7FpvQ9xQO3AHT^%@tQ7x$FW` zT#4jT-o0DS1+vc)0?4Lr*HY7ooVMc94f^5Tt+JFQ#4fAQ^ z5k!7jKzB2|!2}9b-rW+Ua^QG+xf)ZF3nH%`P?BqP4EVl)a|w4%ZoA;79N6la+y$IV zxNmZ|3U0~^Eyv_8;9SCMle<@NQ|f5BCS0HddImTzM9YlS;wD^(mRYIgoABtWz_~97 z+6`H;3W78%5m*Mn*wVPPdfPT(yMW1V?WPI03YfHSw@kQKz@&YU0?G3=4U%_n?=i*ha>}r6^6BOH6XxyUK!a;FNRbQUDstPd zOuV-u@$P8QQ-eegm4H<$|bBB>tvYlfL4rp(bH5B*t;J*q+Jl^fJJ-IB%~>5H4W z7?hMvHAou3xYD3Q)}M~9v64gXF+Y-vE0WB=>ck0-S43>H5yv05zv{e8(-od(A2LV#hN;&6!J1uB+;&@q8%@ z>mf*_8OS@syV=E$i0$L`&jRSGZi0Z&(}3zF7P2cyWmnL(rR{$rmWV%So~Be{u^dhY zi-pi4&D;>qCqzJg8!yJw1?m{2L6nk)-L_#DayVH=`MleaQ8!&(4wlryI#E=IBa2NfacLUek6e0wY-_negYudCh-FSD*ateF2ySSkixmUE`WhT9D-DHPdsU+ zc~rt%C~2vNxB(3`CIzadexW34zMe{QWa~6jrtVpVxn`fPAhr#g#RnfkTp6xsACcO} zq_!q)9+9?=Nn4tzWt3 z_K%izyeduT9LYQusR?DvBSKOIWY1NbXfU7CCUO$mUp*B?lhKq;XLLTkAbktb^V4(aBmREHluHqB-n-oN{D^CB*7q%twz6DlF%|FPzLL_N)ikL znd18Gl7yZifzn*RQz9^Mg1aU>HzttTx8Exf7!$}0-0znNWZyv)vajf?YXPl8nwdJR zOR#0&($H>+z%~e^9la7k%OH@e;3a~dK_FM*n*?)1g0zFvC=nPEq#YcqL?GL%k{z7m zykeC$3N3csJl^}|jZZ|!xx_9>BCD*Avxr^J3q*93KZ?Rl*^7vtWsY*%Aflt3QB-+K zZbWpHE$&N1vNW$9*-2durk_6zCZd`0o#^S{Q1|0XLw>v(Psd9<@3>#YO*I{QTr%P9 zN0NYz-WL);a8VcKQ5&nGK5n~R1E!M+;p%YW_KLbX8eFQX${ngeZePPUvoXYjqS(d( z1cW4Vj)_cNB&DI#T9Z!(7m_M;sHJsXL!T?H4#k}7X%MWTdjK$pYyn)Z3GQyj65elV zYq}~)E@vNQa?Ro|GQD~YqrK9xCF9C7%54$CGJHK_BaC$~NYHUXEd>#g90mVx+#&m90@EQmIEpDye^ zzn+XmGwURqFp%A>C2!V;;`YOpw;z_gRv(I+4tJwyZ8a);h~g^3lGo`&apU2Jile1Q zB}Zs*s2X~;q!9Nrg{b0*Cj^D!5uu=6|Z4vqQqZXd{TRW@O@HF+g1k$!;;6y!)u z6-wd~SJe_x-SuQPtjU{biMRzaP>_LPK88)}Kj)@X)VheXDhZ8Yu|0XSKX<|_We zj8oHP$?NfZ2+#5LR3y0^qBGb;GR0Z)hWyiPGFXnqt<)h7oh*=7Q>AMpK&o}fNOZP#vf^6}ng8x*R7qh>zzq5xe>~2q`}voqKI06URY zpfZOcizBf({9GUm)&N*_S7;QZ&N}30PP)TSCiL%Xcgw-b^lbtzDdV`LAj&~pdcFb4 zxCU?&V9@n2k@THPwZ>Mfbq)z0%+DY9+|4RD4>FvdjZURRTnzrSgAB($Emxv|fW5`C za5gt!d+d~93=&i>9022|XX{g32mb72{4vN_Wg2Y288>kf@v3y=S@`()NDjCS+^qxn zaO)&N_9V=RBw6A_>E1~|Fv}zSQe(eH>zwCFdJYZ>bB~{=Pw9CIPUcyC3w+SExB)aG zYrb_3f%taA7aoNFM2zDH6Hh7ofmK$keV(nLok`fvag!J|`$mdgMf@>iX};gbNhUsg zIM35WPa1+%G7xe?A8p8QAJW|S@#`4+P6B)ZF~(CAy9K|&ZaMvdJ=WM0d&hn`#f9V% zmJg2|VBP3aCO*M|%KD3l7FIc}0bL5SpwR=5C*o@oH%?%cS@?vXzN8#1?`<~c>Ok@n)3r_L`Q4IT4Z4zQkIZZCQ7>rz8!%$8e zL|~`DqZ9$-xQoC;DbSxn9;h7HhYzd*TK862^-w*yWGk6(mFJLd~mn4iNr6j;C-_^BDI@JE;L zDJh~bsxg$XAapnQXg6_EHrTI1(D_q@wje?<7dlV)ZFJ{08eu^NEg6IQ>eCFV$V`mgo2@jz`0K-0PL6tm3w`}4pPXB=UYzLhx z?o_NaaSRTMirtQ1!f^;M$VtbVum>m&PMC1VdjeKnSGXtKf?NMCe&EU75I+$d%x@_) zWuU?kMw9HU1hhdj!T5Z<7}8z?v7mr|Td)yL8=4!7S`xc33Cu5pBH_jdt2#O8jtjiZDu4P@js5L!HTJ{1 zs$4QA8ezHhliG|&D@MIwJ`|=C2`m%}wN6t`;%>pnqB9knW%%v4?+T|-vZn122%FW| z4m90?Q%=R(zEhR+koh5qnl|O))hf+AJegyE2AVuR)`cNqnm9aATR}Y^XtASk=Gh5; zI9Zo@?V4w|v6qMZh8hlJ@xm}wIBi{2O)S2me+Maa;umE{_(=9FhZrg$^h&z4tya*z zzujj^6}m=z{;v-+zd!%$2haZ$N_F?Qn&b8Jf4kEWfB#{g|C_B=^Y`=rzv7YK|1X2+ zi4EDUERc`@MOTqhw&2O{e+uyXp91_F{waXE1YqAmL5424zWu&D7R1kn@JsWfu>?;p zV$6p?_Mxbwq8E$H)yklwLN4fd1krzTa(=F^$}VR2)63Q6=;HobypmBjaxujYog2hS z1mjGe8!Ob!)l#6v~EYY;*G-z znowQ8RSYv$p}#Z6y?|%nE*F54Zy*-L3FqSZg6Tw4bab%qrO1I<{sD+yMy*mvKRd8^Ooe@<$@Oxk>b zwD}_Gi1cKwXPVh+S>@$_`?@@2dqGV_EP|3!gSmw(pEl=M_)ci zBGlE=b0JETLQLc2L|%!@t8j|t5uC%H*k8q+I$j{+TR6IK#-1j7{}KQS(D-vfZ}Fz{ zC8i)7RY=g(U(P$kt5wWfB}$%6vehO@4*nV#4-j<6H85oT!xvLlv0`XU!@}V-@*WU zylK?S{f39oI=&#pkn$p%aMvr7i=4m8?Dvo#(WasV?1e$mmU)ETlNbh9|5s_N=$e>R6DB*z&4d{X}s2=&g)MKBzoO#3ubeVnvs3JtL(ml&MHAH-PU zcq74jU(c>bs7YW|<_26`DRtEXS^p%$#&8ezq;V)W0knI*(*{nvdj6)2)(r_~ zo`=oMM4k6!H;FE(660z5^~fiq&{JR8{o-}6v75M{Kn9X_D%TnLCGjcJmN$nyC70X=qOpEMzl4#ixgk`a|F5sQpg zv?wy{C&|o0wuuUQCCF8{e33wR2U8IZkm1A85YP93U-9gXd?pl&G@ytJaRkp5qc$8* zNTc2CRL_sA%}kF6dgVWF7p^s;)cO8rP|(*XqqKp$Y$9Z6U9M$zJDQLep>Y z=j|6shGa|&#Kf2N?mog~F{YJ8icM2Ywyf5ngx)2}qtC*Ge-_KH`(Ro@#I1no(>;5V zj>#6Hz(KV3?>Fx0BmQ|b;h)bG))7o`v3+ln0MjRBQFc0m;{INzV@Q4!)P0OdQ&fl( z2zGXu()&fFO*eBY&CW?9)1PEPh$czDhy96r@K$K1UO4J>;J-579e!jsM#0U{`QZou za+3QYzu`RFIK0|$0HX^liUIp*RKSOy^Y0F@2W-E7&#EfgJmgTvTNSr643tnL|*$3lt=(xG;MPsD)|K8|GKwGt{#FShqkHFUwr9S20k0=ts^N`2Uu9%3ga z!orD-E`NrtICF52U{X$SXyV4=A!zwoORQ01rihaA2nSbx6GqtNXV*YE!CD3VJHgi| zox!?eS*hWCiVZm4y@`)EJ0U-B$QgFEQU9jKJ8fufkE}Vm=D6}&usxqK9;CtelvK$c zHBm3(6{Pwhjd_wG0bi|Esg-dkC7S5rg%wpHF8>|&ZMu+@x}8d#$Gze4wAh;<$8Yr}>L(9L8L2c^i>1pR+0zrDp;(}ZeiyMdPQ7Wg5yy<)GU-Ck*sBx#1td>ES z6ve`F6im7U|jU52oP^ zC5ebT#UKrRu0oW$da%^MJ#rEZS>5e|(QTePbjEX+fV|U2jCzCpNuMV!#N!?NVU$l8Uhl=}{K%T)w%1jyg&PkHcNk=|7n7{B+ zUN)MpSVYmG8}JE8Iz#*}WA;gD+wrIlA%=wxhW|{KxruUGAFt7Y&qOR&JPXG_Lo+%} z#PUPTh>G6ansVhsHT&Uxk2b7Gh#fNwz!W~MYSA~Pa!8#=Z^ZwxUN1t*O!!6~1ch`^`h2eQGG z$PypLeAF;ChJJBi$)ey8EE59Ciu1UCm&JF9%rzJxYW(pCY&%tTVI3n9 zD$Pf^1O`brIF;`x<&2i*;*mn2Ln@3D#mKfRWt?ONZ7DezH}NE_0U29+o!duSKI}LnMi7aus3V)=49aNkNw$ptmHjEIEpo4&rGTC}5Rtgp#Aru$gH1-6U0rLsn6y zM&phJZcrZS79zLtOsqwDh7t)9HW(nEHu-u04Hk%sDbYCHXC%c-2TmphCmZdiMJVg` zljDpH1ur^A_$PLj;kzpdTa1++_24*d%2WD#bgO z=wJiVUX_~X)$}5u=F&=Irop}~o9TXf)Mr{vQ2X`k*UzNW ziWUYe^U;5vW%Y&Z@)@>ObRB$s+v+n}Vx?tZ1(@U`cRZBjw-g?&4S6%f2`Y}U<4}4E zI&~oTC#DWF^dw=n*=i1sE!QE+7VAX!x$&g7@;~k39W;CwAN1Hwqv&QWL&fA~ zE$%a-X@m*a#JxY2mD9MLyX1a5u*Q;m>)3qkx;k~)y1uTfsaxw*$+*L=tC&~Usg`}0 z-DuLh!p@D_m)fyvCq|i>4?)(k$iKl|YOykUG+s*vQ#k`}=S zU!?5@4GDc_~JWhFiX z3prKA2ia+$)E0*Az#g^}F=>cjMQ|gG?_VsvjYd!pM3R<|td1$GWY~pZb!v|Ca;xd> zW1c#k-!R@r@&w5XNdIw6XU#ZvNTgv-h%sFx%Dys#-XnjH43Wd|@7Xl&1!eSF<4JbZ zVJ{+a!B##4B*cusX0Q!u$7}J;!Z^0jJ|nA8bdkyM5cE(EdmY0Mg58qdp~TP_Nm6reK5oAZvMW%rQ?+HH1Ijv{j2$7V16IPjNIp~c}Hl-_@uB6EID{~&j zJZzeCDZ5Y`6`oNOr}wtxBP>K=X)moFD4&9hmjYwe0-Annp(o|OI2 zIGl4HGMK5kBu*zy(ZQ-~8&HP+jC-D6u%uPGKMI78Un%L$N0WsYk#g!53kAaFoL}U9 zBoPH6ELTMI?Cn@i>u7ISuyJ^V{N+hM{{4Zeeu zh(Z$T0Hwp*XY@DFD?6zF1vE%QH;!ITLF#$Zr+8wfcqK`TW+Me2al(8uSQ{O%_(B0^ zq;+J@aohGqr#r`@ ze^os%7S?OkBd9j)4cCv#re1sciGn z;noNrqXo&~_pnm;{T3}UZ+drF02=&%IGI0ZUXb1K*LpLXD`XAO;{Kkq#a@CfrNJEL z*U90btKqXQhXbnIk5z_m<6w)EfNepkhp+UA-mD*2Tcy@vaQO==?9Ntiy?Wkig8_6X zJPzyYmg|{EsnM*%Xu>-DbEfjT(z-aw+O^8fdaK2?9vyb~o@|*_9dA0aJ_u4o^%=}; zXE2%oI->@5SB_PwSw79?u(#R!QIgUy|7~N3s`o^W^en=@^6(HMdRZqO9jt)qTs{0H zo`1lj!)})!9^jJU;BxAbF~fHXX<>xxVB{WdKgPOSN88R;b$fjsX8M`)=M2%5m8p{C zLyjJl$mNj5Hnw`0^nW%Q(nTg$RD^mKU_r?;TO+4?&E{fz#N zPulW7g86KH?f+p$MSLG~YaTCl4$vVtcKq&j;B1r-T^pl#>OXB9IQ;>j?RF*5Ge`b_ zwYmmtxSVy2m0X4K2%JCvKj+UsGBq{~{8(S3p;JUWhuWelkU~{;6WBrFgwRB$pX87IPH?~M{HT1o_I2a{HeAYx25{W7Zq6$lhD#VFuaSKT_ z!M=rWB0Qpe^jqyM7BM#K)!JsQ`2^7khhaK zs5^qXoh8)m#Hl+fldYW~EWcN84$3E$q+PD$G`W{ro%&A>UQ2a$oPEd5%daP;YVFV| zIJ?dh=c(hmj$6QYMAk1^xD!UXJiE}F|3~S=(T@6aMj_4~po_{%0STQmMg~`?iR#aP z9>@;H5=TCU75A8)fH<%VQLT8pz9xU+z?^skOo}!M!T~+-N8zB1oSt%Zqd59dq(9($ zo96F$-*9-otanNDj{PeyjoySVuR1{eL3-Dyd2$bPqxGMVcfyG;1o}GtlZBdpTY&$8 z^rW2D+mG?LTPW@Wn-qb4+&plIv!jYhH32zH6`}hJssdK0xSI%B1V|`a2OQ5FLX@!K ztIZzjW3A%iTHiaT_%?FH{7BM~P2KI8*k4GsyYk1(`u?!b|M0?*EaZRU@($i_UrWX6 zS{Ghp;lxj*@)%Dq+NCCD&udf^)ldbEk_B4y*P=CjBsEQG%6Ae?sKBR@6r*Fw0O7Nt zDby$(yF3lTFgn@cdQ8>-oyTlFYBR|8@%zf-gI~HqzrU1~%6m@|Xown9zuO$Grx-}z z$RY!_0or=OhtR>N>|qxHiz~^f1$y<@MN-Gv8uBaWAXS9xqg+-G1SlIXNeF#U8<3zU zhoKR4*9OCl@F5i=hrfE|xl%h3YE_8745;RI>PLTV9sU{P8_|_9xaEgmA4AiRb53`P znk0S_|LP5g`d|1~GyJQ2{XU$%-wv|Ms0k96%S;Gc3t^(gBg1fVdi97;}V0BFE`>pP=?Sy z@S$z^7rns_|Gn`*I$VYDuf%-nfSulmOzc;}ECFYwQDZTlSv6_OV$eKzn9XD4Z_jRL z76!4tyZD0mv-P#<$l2;U4}WzYf@FCJLncgrHiu~~U70Q$r~|wVe-B6zwFaV#(P3Ak zU`!^G@+c`#kADKni4FLW#MQ%X7(U|iNzgO>UUp?c%+H|6?!0sKKMA>7b0$j$>+AUR zDtFnT|HzID@7cBCMw9=XfzFS6#AF)u2b6AGI0s3POym}+yycNSr_+dO8}JDca?j*0 zL5VQ&fgI-QbuF=;X))4xdg#=tg4XSD3D{iLE0GL7SD1%X(PaW zKq7S#c7P<$=QEQppk;|^!H%znL}?ZHh3sbo7kUEBpD<4|SnU2R4cnpJN;NikL zXi?gGDu1-pZb$=b)Y%TqN~)>jNF8>Yey^gZ)xAk}`vuNb;P3;oG6}0O2F`biDst4S z25CUPXRnHM1a=L2zFz<)pse~y^h?^sZ;b{8fYC|YiLSMsLPru~0z*B!xtySBLHSXEe_rXl|rea5&_IU*VoWYi|QY+bx ze9buB9(_XofENGRz3Dr@%JOaaw0-qYNBo2i`L}$WT7KDbvdJy|&gZ`{hL4q%`IXvO zeE$EW=w^p z2a~($;OctjWV%_Wkk1#LV{bh0ht7-P|JQvFVDjzvBQNCFv<)5M^3FN&E~kU8?;OF3 z^`<>hyNyrGvE@y#m(#W0P(0#(;M@gs@lqY?aQrqerRp2^9tYT>GYUY)-{H48*j7`z zP=MEoL-URKnhzW6H1gCuLd%Ejz0jH9$MBl3E5zQDH{OyzaD0$|)L(UCT#&5^gml9+ z17hh8FJWNxRxr*|wByjjO;x~cr;LK`Y)|ImyACG$4wJZPAtEz#hytH^e^qUt)-T#l z>HH1m1!IVbg|Q*s)mX1iLxsFj*d8JUW1k@WnTHyDPp z|8HQL#RV?9cQy69{@}*Pe4mtF=U!7uS8hM>>L9v+6IY&V_!)JYQ<@&Rs_A&ke>O(BzIfxuVjdVwDz8o&$c7zh92 z0-t5K%?>ono$7g;=+57wpvO>DYKhWb&HO8Ws(WGsp4954wgfDgfMkHDfi?4vZg0mb zagCCF$0{o5A~$c96m?0#E^!O0WXCEwF-X|AOEd{?-Y(G;6e1;>f*rf0+N{vnie6)? z82Q2wM;$&}HpVprgPV*2)UkjfTozB3Ms$)wN_^J%Sy+Dt0%z=vd^WA*{V}x|d{{0b z2DJ^V0lRwWd>;l#vnVpRhSpAOb3!WO9Nh?VrSSecj|`(HA| zdYZ?V%mmAScT>-u%HWzvBIK(HV*1)*uEr*7t=?cA6@Jw6l=2jg@j@Q zc`>0_jF-x6H^Zy6pxKA-Dewdn(HGrBTu zE2t6B^Q*%<(8EXx4r_{nHqFB0!NOHdS1>I4%UnMv` zCPi0`b_jq*x);oGOQt&{Xc1G`CmPAgC~C*`i=$eF(K!3D?{p0q@Kbi1+rbFLnZn5P zOFwaJW>TZ28@ehuoA@5p)0}ku-)B+b-H4~xdgS8F3ua}CiixZOYKspi2Gg>adk>ZEj(9K z<$pbEbXv7~TbBRzLVPgll+>G0!fIn2`28O#E_nRqqm9*CPILFD100pB>l+-az}V(xwC zDhPVc1Qk!x_vpfy*Q1PBmxHSV$?_lSq5IGZQ_19mNRD?M^{@QwoAf$Yww zotb|->j?J?U#k$8GP*JroPK}D*2%RunSg%n^tb)nZA3y(QHq*x#~a#7zX2-h=1j>I zzEy!ab^O~2CQ)GRaXzE_VD#d+6i?fH?}J{HLAswiQ98GtBae0DwRDlJO%$s8$Wf>q z4Flm$Mu^W?J$i)O``|%gcbABG{`_$NGa#I=(}=kTMiVa1`~40La)h0NNzVQtZnV%g zJ-zFU{i{Q|{A1S|cS+-d(qO{ZgP=+X237Yu6HFe!qB$Yo4UWCIXoQZo{Ovw{e&#%W z3=C=(?5F}*7J^YE0qT-8wRady{+7Qj8}BkeLHBU0D}NX_egty2q_B^I8>^(EOK!$1 zw7U~+_typO78LSZ^hD5~K|j+yJp46}?meOH(1@LY{*Qx}{g{Cd&!4+{S^S#)sEAB& zhX-`r`+_D)MiX*u%8L9;w4axbjT@VkMT6sNUI?a3N9W`u5C2;@9C)8gUA49Ob!6P4 zmbW-F-5(3Pds(^)i5`D)4za58~y*DGKW^0RJtlVdy9nniHu;_BQzG!PPq(bM~Lv3!EaJb=)+8=MRwcA5e z#sJ`r5Yw4kmcIe~1HTwK79t7Ies=fX<;FL;agYlNxv`Ptb&&fdCwRyEIsfhu$CZBu zg+u0#e!riG|Mi)*@dNVtk3a5Y56n5kY=7<^U4$3Y0Rr^hVFv!*a^F3FUI2LhH?TlH zcAefWn4o+^e(-1qONx&MT($;%&fGjeH19roKmYPBn>{?Ffm_2-hz`>OtcSB4FD+2% zFS1nLR$gOX7zc4dI4&Fph3L1N!>yao?#MXWlW}raVA945`Z6wXaaw0IW&5dw36j_F zb5JGxCM~9w&BuoYwQ$bS<5* zvWx7|L76fMLUKG%{%QP2-x~~B z_rXtFhfv`W>0S8q@uAR*Ded6%L-{UL9`n55rysY}C%G9wWyZ;KDir6F>g%)0Gi_~y zf__Cu5}=_M3ui}>%kg=+vB}@JdETk>ABhweeJJ=y&SOV}-qruAb95)FU~Z z9m>zh1BZvh*`pmfvkz}!04h?00(Ayf{e+DrGojGKTjv3&$}nGfLm1HakB0_#4re(p z=NkLIekTzJgvWvhK@SiOPA{8o0`w6w10a~8p z0MM$B`1H=yR6V9!yXo`*Eir-)55<@Y1a3jF9MCGL+@V+Mrr#a9JNKkicm-2PjpZc- ze(ci7Mi}Q3lvk1$55aEde}q?K`p3w-#cv8AydLyts&`obIak51;Lit{jQit{Ty4wE zW)teDnzwOJWz{;W9`s*Uww+dr;n=KKONI zlA#3Dy+iyA|4r)17tsG>0{MiM^t79MAdO9@J)2N62s?BrnE|zj>{F#{Js|Ds0W5(B z*hhh*`n!{VYIS&5J^;OlEXR?|oi-*o z4`yC6d*;>Gc<=h%#92>KYONf$NKJ}lg1(vRIP|kv5?%$f^_-MJhWA=a_|}^)lgd0FW2~`{p)Y>#yA2h7MH%(A9|tw-!PprJ#oExTsbZR9ZD`8()Uv-F z#o9^GtdT$a(+ug)+-sODb<?K_!D??dKh z7EC~3!%$|l2-Ti}Y&J<$B?L5xr$R+o8u^bzK*;T(d6L-6VE`7liV`a)cXSGUFm_zW zAWbT4z)*Iyq-d?7Al>T*;wR zir&q0%!ILk1}PDGNGcVWIDiJ+N>XUk?DwKiL z^w4^aZZKn;*b@xhG$O$VjERH3w>jKXC;6WQlTbn-0t3(!?}kTP*RNn*Q7|lGr=>l< z>|hQJy|y`0TfE5xDjSw|MEEv2L+?h;Lk_5A)j+Ie%F#U;dgGsW-u+y7clfV=ZMnHE z_fszAzn`RvI173K#u(+C_r5>L5sm^NIs8{XNB{SUR6U$zi~k~y(5W_Z$OD75es#0j zs9-*@`9yV2CS9ip5%?j7#W`>WTU&Srs%!q}xO>h)*0B1Ci+|o4yp#G@!bVH+@mfHM zHnBdxIrG560qT`}Ey=1cUsEdLlaId^WvM3a(V?Rs@-z&S6-X4yP6EaqMt2`%QlCk{ zwts(YwFT%*h0ee%2bwri%;uI0tzbl(LhyJeaR}AdRq3nM&tJs3gm#=b0d9nVwdA(t z>mU3-lT&e>L>V@JFn~5iJHWO2*_fO0G?>jY2=vHR(oyZ*U&ykIAjYqFLz13b;|O_r z`2v5M&!;crYQiBNJ42bKUmD}rWW{w9jZSJwTh_}h^4=n%QI}kVy{m&x^)pcRJ^++J zYrmp*1o(5D;^4T!HzTa!m}(u!+}Llz58fnW{3K&q|3(a3tFLNhFPT%B)l)V-M1z4v z9xrbqJjUG%xWJMMYQ_|k+N*d09(x5VMEjPbBT^V&+Kyw8E}xiznE<;duBc1XN7mby z)z};}r}wyUjOOFV=|`%KcGYK1is`iq4F(KJz31CGs4GoD(Z~4U;Ro+7^Ny@6hkGm++Ecu0@ zx*)&4JKS%f~OT z#!vD4f8%%R3KW8BARiMW*I+FG{ep<3>#OB6vxd?gy>Xy>2fL=yF zkR7~HTUl0m@$gw*6x*TrOdY_C1@n-S^^PV1<#4dBG@J8{5r&dHrPZNk%uSBt+5%4U za}|#`maCBGh=R<<7+|I0_+cXWU_HGvHbvSNwcpiMEz zM3&_r$g2xtdK4r3u`a-> zgpVg%m{C_TGiovohQSpjnLv@bIopibFI*v0ZeuZ-q0vM^%M<@9NIPSkqu^sQ zWyEXM$Uf9Zg#ZSR`$%7I$OnBl;_l<;b)0Y7VG!A&4w)47SJ0%mCc3f_1y47hYNJ(cW!H^$gNwSu_+*ZVQj`OZ-F-X+Qh{RGM;vH#gl3+5a*bqWDd%zcBiC(t3E?ZrhvLdqq8RWe0~7=H z(&vxHL!JrlL>8-0k4kE`#hcMI;URh%x{6_e3>~>1J!9TsZ>p2oLTW`%w{`>z%`Xud zZj|~JKY0bqaUR|y3_i|SAU&jS)Y2^@_qdb{5h6)2qgpq+PfyCi1Ne|!d%*5LPr8qG z-f3NukDaNjGhsP9NubddAMR^OmnlGI3l*<+|yd^4{kB#fN&2gCWq$rEevt} zf@t!x3Fs&zqJwg1b1=Tyq$?fc8-FU&ygDtCHa3p~g^)BhB*fAaA#I>d5UP=OD#L!$J4 zu?1{0VKf2l(}VGibz=XWrbKAJ`0qn?t|}Ga_|2F#x(JjTPS~EBnVLR7;i%A=_6FUh zU6WOe%P^Be9pFLiEbiM(Sm(P%IlTJ18Va!Z{g}0c%P|u%;AjKQk|_U_Wd34JVp$!8 zLGc#R$xV!*TJF>^9U7Lbt31u0xbFT(bxgWvTk+3D{3>vx{T)bx5;Ig=tzof7U^U3j zMBSWFAOa>&s0^@KJLrv!6u5^$_ z#TTbinCALZ(*K1jqLL}dsiC96%}1Lueq8|GDi1(c-^q_&w#OkU9Uqt7XXL}|^*Hxk z*PB8|j5O1F#}vq)u7G@VD@N1KiZrz@js#7(y{|~q?maqONb2xB^y64d_aM2DL~
~!Q7@eVh?ThfT{xmthOwZD3Ez(Qf#lphrJ#E^6?y7*L2w-6az|F^EP!*cS zarLFdgF@pFKXy93!A&?QYK+B2q+BH9n6Hdv^M}m@_)*Zi2MuTS<0KmHiR7YITZQXH z=$c}@!eQj-B&%DDv#0(d!8-n}Y)kqIEyXUg#z%C-aES1*5OJ#lqNxS`7;y+)FFwOLuUtdS@G{(QkJ?yuj>0=-LMM%!G#D$7%6-=Dx zhw`E%x-8+tkB8!BplKGRDVnybDKqitZb!vf;hD`RDrTDaWY@YA@bBjN^cjou{Kvy- z3hDP|?f#c=W!E$Tp>+_CeG%^2r6q_tmHJcrbUb2>q%iAR_c!2EgAxvros#&+o7S-- zGMinaoK#d?jo#GG)iAj9hIk^9c|h)_VA$)hUlf1psiR|*qBeVVw3QBfGtO+H>@Sm> zCXf}`pG5qqu!1o0LL{_57sx|0`+hXq*DS@@W->Ewa?%kU;dw7k`_AArBGOE%qQeJe zjCwS@pl|RN(V?9=aX2%azy$0`z*xyp_@px54Se74^ata?%+K_*aZ;y;!py_Nj34vc zD#Z*INbS9UxYd^m0M^IfPK;MvFeWy08!{Ea<{wtgxsHcVdM*x^OpExO-sG zx*I9nGpLRAZ6V0>PwrE!-Mck1;MEiS~1DN9I2-cCrqfv_xmPLy>g#f^gNuS*I1*0ieHEgW{0YOTa`bhnI!GNo*nm};;f73Xf@ zIbJOwKPg|1C7M|$?ys+b?b0pa?St56g+-}Nrs*Gsb0$K@kB6($VGK-Sr`IC=)ptCA zJweCny4)5vO>Gr*Thmaq<=zv!#1*A`Wm-RPI3GqB2W=iPrC*(eXe`yd(FDnI4)|Zx zBN{AM57ubjPwV4jn`O*q)v)hqOud`FqUJYem0g2XdSA#YQJQ}vR-wO_YDZ)2lP}8{6B4M;a{w+ zXU*uMiL@qh29raTgeI-BAW>Jwd@re(qm^q5D!+)5@nQiPm=?$UeJ)$NeQ@}z#Va@o z=&OML+SoWmkQrC*A-Lx=o}`@Vj|@x?Fkc|I5cT6wK&X+WiT(|wAGSm`-H;* zgLOH-!o=J&Q2Bw8{*uLuBelVJe(RhxE*yU}AL7eVSQFoi!5rXtQp_H7*z^5=%)Oy- zFdfR~#KpNonf6C!*wA%eRLnZmsnr*^-WP?yQya9sHIf6x*cHw2&131bTn>Uj{{qEjS zm{30!fPotOB^|zB&JI&FRbj$hN+Xe8Wclc*-*ns6`a<_Tm35cwj}go!Ln{qex3x9N zEB$$w9Mc6cn3gX@8`O&SjFF$^qf)s^=Z+Q;P4O@wvUmD@efgRXc6Wv6E8>h1%QK}D z91ms3YH_9vXaH|s?r+5&PQWrs*h+Gw-+x}%-DUY;67|U-?&#P(*>^Q@A9eCSR`l?9 zG{*^h^7NhacubiQ`NS|gGA+LKIi__INi=i&*31>eGBAP_%o78xOeuC!5%$y(%yK&) zch%I#xmG3S5tNumH^bp97>W)Vmm`cSp;_fVZYoP}Gdxssa3lUH$@wCG=|OZH){R7N zh6l=8&nQYaa#ln~RJQad9K1ABVkIUS`miEC8W%qBKb$=<#uh)#9vqr70#@{5 z2{Jo86zfd~rp~SCplKobevC0a{lP7)(Xbz?SQ*JL3RvCxkAd|TfhkKoC80qIHj%d= zR(dN+g%uxj*ex72e$7LJ%s>`6YpvQpA2;Y36h7AlBJ@bPv-k0hB4;_7WR zX^!mfhyC6_ud&3*NdoJogDshybZp-zuW~5A73F$@)>Wjny5;xv)_-gsq|wZiUJ!2U znsQsGxwG#fGjJk}>@-S7V6w+xoa_k1pvp1b6;BczmP)}_3-Ot4_AlbOntUIX)Ra>5 z48tX%0F!9bjcR(>YcMunexv{tI~q;WOOJQ=_{>f`1*ECMuSNi~b)SMKL8@kq4rU(j zLLgC*H(}|;s4w~Rc>VW&;`on03;y8y&)vNz|GxL13vOYjkdMCqT-@9FIoLM*#$-Unf zUqH}r^~5+z5xl0cwuUE>_=f16Qz{tc<=0SV78Z@d<4ECAUKfHCiWIuKkb9PkeAtbA zIEvOdiq* zk-N&_cEo7$! zHq(tYgWM!=GbO!P6}{cW2s<``zlgMO7JI-x(k^nZtc_b1*EZP}3wEu7T~%;oK^$p_ zBMah4L*SNVpxV;~PppC`8kGfcq#=$hh$9VwTaJNhUl%;J3Z80I7Q~T;IIzR4MXHqCfUaGIE zm+G|u4+rBb(0=LRdtRlnck4|QH5&!(Ct~{`6j5+`TU{OaWuxd$5-5^8NQ@5ssCcRN zs`RGSLH)kj#$fxm>v(teEshsGr48S*Z>39KxEbjg`Y~$e*3)H9AJZ;Ci$8?Ve&}uF zoKEMYTB~$A_^(>^9R8I(c)R{d=4Z%f(ZqoDjV9g|SUlY>T0P_Up~$E@0TD-jNu851 zU@MUFKI9M@e?gDs4m4rwU_OyH66J?>@?5}^W4;-E6 zPNjAtCW|_w8mXLh+U0VmU247nF$KTMdwC&sRRUo;cR;#}1zLP`$KEJ61zzX4)Gl?3 zXcaUO7yQ#G{Oehx)2h|mvQYjus+8-EH!Rb*3jQ|8t)0N^mw*#X$H&biI}~d)N-yO6 zaD3tyj9tphm$76V2j=YqDhBb6RbV~JqN94fhBC3k$tyaTyuyORGLD&}Y+nHS{h$vW zOLp_140j%4`2YDut)|Y-#Jiq|>xy59;{zCxlxy5`m*B;!eUOObSwGXyIUCLo`Tf_h zYv9S6aXyEbI4_X%$WckdFj5P?Kc|STY%C)*XK3iil$X8i`kE-|&_vw7Ya$N50RPUKa>8J1*A4hHK_cISLv2#c4AL1-I&W9dnIVBwF58+@k@L7(o0!XbJh8#hKWsftK^qQVo>9tTc) z9+;Ib^po@ZDj`n*DvmNHQ|N&hdFXhT(3zaW!JWV=Atlkh_D6WV>mT^G3cj#HY8&=- z1Uee3n^SRwI}hsFuJx(afKPkYr=uc#dSZP#!CL!v ztpa>{YJDoBO8>u=X5HCx(IjrM^2!cu+%3m}@z5h`l_>7l*-=pDqkd2cNiQs;&%k`S zn5LbKY%n?Av&mE1*#aYJ-3T%;{JJoanW?j78X8$4P9Ed<;b|HZ5eTjPN*oagf&c`n z;jS~b2~las^I5k2$H8=jK75#4oM{;|O1UDag79IfJ2wRFW)}h%1!yq=w6GX7&!EEp zWrG$MgSrCLje=rKy&g$=9-6}H4X;mjO))*p4(NC&q0#)JGne6vtrpc(CPT^E<U8Ihz9`j$k;2Qxtyo6y=jTzeMDxKz*f&jYE9} z8IOXzz=HiV1Ub*m3Ig1<1@L0H;$pZJCP2O#}g$zB- z@-Q@+H=Ir3|1%-ju-h$ngYFokscg=GO*~ZZjwS-4u#q*#?h9!=UQXljy=grDavBYH zfftS>iNb*7|6KBalplfo7`Lz#u2=9Rkh7X^U!tp`A58plW&

Gzj|q_Uv}H0bThp z+pw-6m=1^^@;k4c4QXyjH%Gz*gfItBRq$jRfsFB}(tT-ePP z7+)~KtzH#bv*w9el-X<|QrMiW&0`1IzJXBSmudj!l$ zb;YDYEitk8nZyJ$Au^?ky#LmjJ^f>5zk)3O7H0P7kD2{1Ri98AKeDFQc5Zc@A02vd z`|D15_gkOx{~9q3NGbzdF62Zx*dEx8J^56t#=~dnWe3W@cAd zvj4Yc_VYbd-`2$bMoV_*zh+`T->3XvIkAQRnu$HV_+w_xna%&#%u;?Je+%<^^vAsZ`xW8eep=%vdS7>1-EVnX ze=R#@ zmcl~*(g(<{s>j{KQZd}O6jI)u1|g=cfik?-WueaB7AdZMFL8eIxBIclbNYi@zn46P z-PjcNIctvd*@v$%i!c6|#pSd3^jn|B%K!W^i%Vy5|67^G_1G;hOROIMF_lZEvhW`u zR{xmArL*`SAXfjF#ig_O&4|@>iTcMJE}p|(3Mbr6nZvzrU=CmWF^5a$aOaz!!^;2s zF^5amVewm^!&>{|k4aoIiT!VV5?}l=iA$yFw>^nR&T-YY_{A6#o`P_4cBjz@je;1+ zf2z-(;kWFLO^4v^&az(SjefQAk6Z3%cV~MkKX#EH-DGa+O80S6zdf_xgYivdK$bCJ zH=O~k1B6BFX0RG`{JTgnc>cEcMH;kg%z{kz+$wzTRGhust}UI6%b0NJnhSkJCNwAG zH7I>5{;~u4M_FG!DUt`VYKWomvWf@&MKK_E$ zx`02te;Dg|B+5@ul0u`5)WF@5>F}vX1}y583eha>L#?EgO!HzsO7a2S423X`cVK`QeLP z0Dthq{rO@48|DYFD*liUzcW94%cp9<4}Zvq-)=&^m2yx4s4gEDekP_8H)}IFcYY z^f!7a33Gq($K-##$uE4{lVAH|?!V%~FMh*w|M6q#`1q%!$ro?fjst%D)S3GKm=C6Y z&-n!p`tknA?3z1^G|<1NU7Ca6Y3KcrrVr4(C1X-Vk6>(}rS4sKXfDCUjitUGyzH@G^VMGGhtT<<$N&F! zypeN&Y%hn833rWGd_Uo1<pXtj?z ztwyJmx1Um1;E_ij83&=kbpWLfe38Ww%%@8*pDx6Fx&ZU5C753=#QbUj=A%xd-86@E zT1XocMm#M1zFG)%$jQvJaim8nlwPbx>O~r@7b(Q9hW989?@nBc!$(_oKDd z*lw*r?ETQbSPdhJwY=_o ze_n69ZLlqRU=ft6z*l-@T9E(dOMMXj)6r(0$>>NaU691t^Y}qc~oIqSd%q zfsBh~bSy`5ybuZAY@3(xDS$pE`KUP{;tl zG!zs7v_y)C7@-9nS;nd|EOkLgmU6p@TwBnQWhi8D%K{YDr5LIU5VTHfOFBVkY7CnM z-drLz#DVMr1WV!L;Gm{GB(JlxIo))~>wM!4=f1NU-fTJ#A2WWeAd$CTQu#wCR83HO zIS2N_{)|1teW(}?{^{cpN6ztwq;MTj<)eDN=3I=!!PVIBL3!UBhCUYw)Hkl!DEm_= z4{x@fPr1B56TfG76MtLa>vzS+?)H2r0B;cQ6!y=T?as?m?X1-Li7VqFf-I;(37s9_ z#~VCKz>l?hS$rl$?l!mOP$>xR1645PZv+4vw!o;%kshR@D?ZU6!ni!RakJtRbr3qY zW}Ila70iXzOPPJ?M?V;GFDoL(@;@FkG$PB@=Tg6YifZDdoh znn;h{v^7RCUG6fti~!^=U!1q9FU~8+*(5yp)0k<{0xBy|)jF*=+fj6dRmdX9C3F?; zMVB=Pktq-e_cf?pu!9Bb>$vfDul??O#0<;|_J!xrxiDH7Q@`&|{c%@s#WPUja}I$4 zz<>;rS+~n}30EG#q<^^fW>`AA9*p0I0;@NLjeO=$3ED;oR)nHrAgmm)&hF5z@K7lj zgaEh=0>NGn#N7`bAmz_NBbI$6^Aj<5@U0LU1;Nt6)XB`~Xw#X2=6fELp_$V3Dr|sp zncrIovrh2yBH1$WcO34x&`@o)H(}Q9@@xY{)XXz`U25Wvtpg*l5`gNmk zbTmx*S{^rOYCCf1tWT6psMD39)<2(}WfL|}!KpT9DS>LR?8b3nEkcOZS>Iy+I*Elb`o{ZH-%lcM8Ac6*?kD{3NkfUdvzK6rP8~D> zx1KxG#O{>O8j;QrmToWth0*U&)YU!E{q?NjeEjGbKdTBo3dtm=@XO6=p86 zD`3+MF%p%Gg5ID%0Er&}=T8MD-T=f&1bp@r=)>&Qi)f6D_jh0{M`!LPb*}W%UTDq< z0feY9pB12^v{ot8FW##9#Ez427EFC*Jdq0pcE6$UpcoDmsu=U2SPm3)nOqt!6cm!= zQ&HX%?E^`2fhZ3MeVOu?Bp=8nVz5Spze9gszkdA;i0KAXG*QT4h3S|%VruX|&?DtZ zK}<34#44VNxLj7K*!qu|?1~FiMRH!mTn_PiYMPCj`=VylUKb`^Y~Zqqy9NxHTCgL3 z6in|7a~{V@F`!1ce0TXuo6G(8mal9sBq&*8DaxoxSP+aY5)N6)OMNt^94QQ^$rw(T zVAw%PuGJHT?o~3nR|;LcJ5gvA8Z>1wBL~WjhBlV+KfCX2cT_4v+B>uIHgxd~*q~2h z2c1PQ{uA=PINtPXPOA9q+M6jT^e<^glIb{dF6T3HUf?!92o2W?qYK%2wCy;j!3Q6= zr~xbn@6NgQZhUgPD3B1o^yHDc@W2fELI^-xUxx?Qt9dK*GOZuj)Dd`Iy++ z7Gq76xP@-Khk3b^3#l-?V@hxVqy{OX!!8K{Tl&>vi(X9l)GIz^v)BlI{Wdbrl^ z@7^*9jJmkiw111_&`Lfo@;t45fp-f!vCy+6^z3AY);8eIfnGya!F`QGih}qLu?&}q zEz5$D0?RaD7R#&%c-#)Vhro*9vTUiO$yKHp#W%RNsB`cmNG%kc(H6A26m3RsE4CY9 znauA;hVNm2dJlQukBnYA^io;hj|?87S~zkkk{&g?n3V5NNy^I+(t0Im6`O;w^UG+m ziNbi(-PA67&-rCOnxJk0{5TtQ9a1i@P&{^mDZ+3N7lE6~r8q!q-Hn`wpavXh9WHY- z3nsk1Wc2=`&$F^|-N)2>Xr}>s*tk}xBEC_8(05l9j1mzjsW`+5)*P--*dfLoEJd3I zb^55dzQh~K&3`3VtBpLt*_tf7^7k;#?+If>?&W#4mhsE~R+{z5;>8fXTUf)Unj&~a z@h+NryIemUj3z@K^&DSBn}8Ak6)Z=N*i&))%W*sj9V4^%1*dcBhayJpsOa?Oq=@wV zA?OC-FqnmOsssFZh|}MJe}UoM&phZ}d(#ei3VfIXFmj;lvB}^WaCO|YbxF!3V4=U| zYxr=|b?h~ZIgW};Cwk4|j8y?}B8%J)oHpo-HyGpCLqV7#l3{&fU2p98qsi>fX_Siv zbHzRsFF7UOiiT6U$X0 z`FIH-+q=fHg*(R9!8WQmWIXE!e4r$8{sET0j!FBvam=3nY;i#7#Fh)Xi zD;`h;jtq`DP~Wj$hm4Y+Q;dpt#{eB z4eufWBrwnb)q^!;qR7$cQx132R1~An{wFk(25cq`z)TY4!Vh5<8LEc}u!%e9TJ7dV zS-V@(gpX+_|Aq*)XcS@u(K;DDR5GTUV<-RVXO);#o-}|PbO)p*fiX%tkKvVELT#;9 zKYzg+wCPi$zv8hzh6G*-x#6)}$z^xn22A{h*Dazz7@;zz*(nw{vX+Wz(c$joo(v}e z>?=Sp3XROf8%(nTSnn>R1kpA1Ou>2R46<3nE*;7JKw8Wo6T2Q>xhE0fl8eK^LxI5% zT1Q8_0~1aT41YLOcwjJKRm>+?73mrKAq*J{o6+FvdPbi64^zwo0n~>afotfCba!>C zNV}hHK}C(6Q;gadV1gCjIhiXE_1HI*X>v$uZ_ZjyKSTHo-YFX%BWK>|SubzzLqXEp61X|@cJvTn<9QJOqw zsj{_&gTs;}LOz>wYJB;kTN||r!4Z!D%|iz-su*ryQ8%Tc?!RSj+=xr?cmj# zFw2$`1&Ix22Tp0{S!q|;R7X3{j&_k55Y*=dM5G55)S90bF8p)}=d(yX?VUgGvB87{{oJ z(eX(S7FjTsN>K(nJm^3EfP|t_!L*{-=lrrgHjhXhFa znz?PG%8&!5A6$*)*^JuiVQ8ZEH8B+9Lrh}lW+hSK2V2?iivt^p3m4zrNQJy&vn)Er z#v&#`b&iJvT?2eWYCiSFT%$$pk?ul$kb99(NDaaI@UbT0W+n+>vejlKN|)`cTn+t; zNI9%8>cArs@rHhI9@P8g`Sb*8qvpbzknCd5?+?bl$q<4OFJW0;t!QlBt zjUC}M$A``XqZ4RncF;eXp^tbV`)ljXS?8o$sU7DWR?Xv~ygBLv3JI}IVMP)%83uVk z>|j)2!TkuNF*Z>=;ONiyzCUqhQxuHolgBFXU+JU<4I-dwA8;{@u_8Nup}RgRUD`Jf z(|Whg4sJg|;Nnkj0?a&_l61vfFzahcj^xPj8xlWK^5~IHdUA4cUKUeLcdpJrbHXi& z>^){aUb^~hK=PV&5M`L_SJ2I@7+R4lMe!2TswFZp-4so)`K4B>(Wv!8^m-FZ(Bk@w zWF_**>os>Mdv^>RP|FHF)+niEa*wN+dJ#2%u?Lp3Wdz&3bJD;A<5E6ayCrI$G|bv9 zs(sQ}mpde#{i_|8Ha|=J<92Hvq%a^DaJu(V4LmZjN)umSiyj1!0sy$A@#v2(VG0E^ z$_<~+g0MlDj;(!}zl&6vX?%i*?Otz!9Br(h&z5hiDup4HYbB*`Qpb>JF=;_=246dD#!c*}h#X;3VXL zH=K;}UHsFZqWTFM#MGM(hId)bk2Lm@6XRcxihSWCafkFl#|^F`yCQ$g;1{_OqTx24 ziL)dScU!~(n7#4=asjz7sIUC;*UY=)9g}?y`{L*aS(Bo>Xha0(fa0adRDLWoy6b~C z;FCy>by>*+dQ>$0Mh?1=t;TQ_uIn=o>eiB}5Y>&FpnMfH>%@E~ThDvm%yS;$LEl;e z>tu6Svc-e>D2)Nl;V2rzk?iXb2LyCfI`l4m^0y&@SMqFNX89t7(C5Da8K7xZE5QN>HZUKZ@UBa60&rM#z&RWNULkNY%NT zBOFCdO@sLi)fD*W93`_z(8U+W!)q{{B^b{z5)tO8+Bo>Y?nvQW0mc^EFcUqLka$v} zHU*&;$%&Er|I`OT?ES-_R?^*}7v?!H?CH3~gfpGlcnCa*^Ey)=(g|8<&tqJ1P!-$FWFAg1;Rb0=BFV!6m3^eb%!J=o zjZ~q$mV0)*9w0)PStMJ8sH89v-WehU!JAxnrsS5G6WbGx#U!d{asf~nu!2ZB2^5EP z6h&%zjP>-GqAy(N?H`m{l$jHJW!Paq!av+aMHIbq^#{zFK%Mk|~8yd$_D>$*_$wCyo zCfHvFh=;f_(r$98mke*F^6*d0fqfvmCSo#}Xic9;eQa$dt80x*q8^rQDSGex@{MHe zCbDlhH_=VvCbBK4AaQdSSi3QWzOW{f0yId}-z*mHQN30zx)p_dd~T$HOH*w4@g?WP zRb^D6XZ{ri@ejrxC`Q2qOT-dkWtrCJfFxsJ2N`jwQ!we~92u@2ei&eGqD(-i^!SBz zoXtm@&-5=`>tIWj-DhjK^`PUDuS0lKAVE+kmnopvUJfZP_Mfre9hD*A_syBp3z&Hv zvAKrk;l5_+bxyEE+W1vKEB2v_I~z$UEYcgCV2XQoTGitUD7?n98hP(w{bRW4)X88v@vISXd*rl4V&rn;!aSPLI5oC)j-$YN{dvoM zw~fx$zWS1<53DgH>nOTQhuni&+tPnHkDr*+xZ-1~GAfCKc^In^zo>jZ;@NbbjyFc| zi{FOeT8!Y;5icUR@;_0$mH+uo2tJPyygK4V1Yaca#Kmty@ zSog_U_aT@H&rF;p>sX(@`+T3u8J1o65e1ej9oc;hx>Z)KjvT zd^`yAKk{dT?&D!_H9+qpwXHf3?LqV3--G6bIZ-Q-UHTTtP8s-A$~Pb5!ockS`_RGL zF;bPKxDq@kfC@L^2XB(07`%skbVoJBA)nWENv&RDF;4$lj={L; zZ1{}K%g$o!miL{f>YGdz7hTE5jhBT9){-tThw*U86$g+G*uTt7OSjTiz1l7lT_>uk z;`*Md*NWHsQlszRP3MX>uP?lmqvePb?{Q9yg-e5#KIH zPrOo?SJ0T3tISeU?XjC*>&`Ld+0vdP>hlS!&!+y2pKJ6vHux!>ZvF0^?*G=EHjD*-AeBHt6pV`qz=Y0lP@sHag^WHSlSu^?J!G0){~}y zvQ}GGt(pLgO$f%xHYXmDjX9%N!k{Ou4}AP3o?2kZpitCK;$q=xqj;3Ziezy=4Oc(X zypBeuF~@82?0PV>GaEa2PsT9Dc>dRTCKNlbnN4AKt~`M8u|rCyq*060cxcMD>^WSV z9<)WP7Q1}o4aD6!8W@aGgd*}WlwU{ga~jBxU#rCvg=@9*@#T`dr#QwRLX$thxDbz+ z`-3;7%f#Y_fRI?M+BJ?BaL92ghqx&mB1N*vBCvGUmUG9y(w?TZm-lEgN8b|pwS?f( zix|IJVcph^HaC8w4N!{Us@MB_4!!g%{9?hBCH9y6dA$Co|6_k<-R@(5*x$bXif!cK z&)&`s{?~o7n>YUp|Jr-9^Thp=n=kC{?CtF4-Qu6%e|b0mCnx_EX;OdYctg=~{xo{; z4}STlKTWH*to%Rp53Hv)uJAs_9CBDUy$y!XfAyS7?SwYqFsHBdg&Yhv^6-KAZCsz_ zU~)I5>&2OJ)^VRc-Ob_Od-V4c`g@=Le(IcHE`wIkpM5~j^9emO#(~+@ahH&3Y6f(n zb0#CnUYuVzWv4c{oO;tc(JmS$mn2>;@0_YPc4{65C%3)3A&7$?2j2Mqb?>e~a&3bg zdcM8R4McEZLzH776m%Upcfp)u)nK;(G0JUFX#BYMIG7?9$}@V0-=GU3A{^xHC^X5H z4ZPq`dZz)q9N0s(LDwILc+!KICis!^r9mGMGHr|w9DhJ65Qd+kB~=h@Ar^r%hmo=w z*i@khQ;I7L#+XIoPQ=;?&;=u*J4`pckf7^e;goD%+0J@_jkfJOm3z8xK$^bwtmf!Nwo*7`%a* z4zKC8KRWuD`dxp3SA#KLZ*sSMHjTk|JkrqV#5=~Z2e6y^;$}54ce&npQ$2sNU8^2J zPpT9yNP{VE=LZW}ftO3p*?sD?eaZ;YpsNa7PHT?f#bTb29R=YGYoC>ze8F|yEs(6R zATL@aXcSXGd_U-q@j_(>R(j`j{d<-GYy8u3b%j^e^I`#hjl07+?72UJl1+kP`}+C% z_hgePR2?YW@60-kt0$4h3lIT92*Vh!g*aU0K$fl1?Gc58s$P0DM=H)#kUx5z28qoOJx?T$=5T;(M6y zL0yw&%>$Ex+$kU_HHAd0R6FO@7^ zSFlly=X7Nk`I%iEgKS^rto9t zlOAW*#l;78g?4Zd!!0!q0|Yq{KN$J|lmz3Dg?z5zXaKHbOV)6Z%OG*KM z&XUr-yw8%-<9M$nrNKUPNtp=lzoazuXD%rd!Tpz%3H^CX3NVNz1z;xwe@L%(^KC_5 zLJrzwciU_i!g6{jY<$}E#a67cyU+=iQD0PLW7vlUVqhQy>gE|=sKm)7J6hytkMFE! zr5E|NwLEq6g!}cuPCuJ~fhQUaNAPS2) zp&^lS!1uyCx&Vi)N?H3+Rb~c|1}L|`wzl!seewi;Y^ai!EZVU;TCSB^t+gH9(e40x zK!v{$bLJ7HNxh@`=k@c7;IQf#m~+q*UBCsy6t5wk0-kp)%HFV5DA zR!5FY?b6!XF2Nt;ya425+84hMMl0?0M zH%x8=Z(C`;PpQTl7dwm&9xO@%D>cv7)}B5gEu(psOfQV-ajAxrU)bGUQ;vio zo}^|l2N0&E$f9{OH2Q506rholu+JI|bk)#K%({)zF;GOcj`Zxnil2a1B6&2Ff}!SL z(K`<$^l9aHIB{tZ(Xp~o>EG@UKMRIF4{UYJsMf61q}Xn9-Vv>>*flG!D`hElE4O}k zo?7$x&AAkrEzmIWAq#_EyKcGO1TtCdl+n2usk4S%0j3uV`kdt_44CkNv8yM7v{r94 z>*Y1P7N5_jDOEPeX;p#r`wKu)rbTG9n7vYKv$0t@6SLx|X_0UyF=w4KkdfYfyJ`AEH1qtq;~IXow=i*tuQL@E{cK{Pl;A=zgB(Am$!w@9tM{hy!~&%;?T z3#P%)b4Gjn@14Fk8Vv6u)%U6TZlwBtTJ;^GVb7vrCq~2m9*m3g#Ht0~qJvXyw4fR< zHT>Z;i+LCtkegcxauY_W_yqCtsw<6p-t{m6WvAKN=^Rzo+`NH!XCdNdYY)oTT(NxU zS9HQ*LaMFun#)6V+Gvy_NXF$0Y?a4`encv~Y&3SU6&{z9`7eW6ICuDK5Z!~b-i**!y@TZM(w3jdUah(;p6X%t( zgCCsGpAI5x^9)2eqAJ?G!H?0wJ;g;(5ES-RPZfQi*|t>ra!t3 z06nFjDxFfTaavm2;fXvRTn%Qhz)Qo)wHF=XQ$WS*?G!4(;&oc5Nwe_s>DrDEfwU%X zo=RoLuH0@`Nd)fj(rXP+3kaR|bkGf^QMrJteQjq~n9Wzg*qhHBYN-PX-)`Pu!!v){ z<@`<2Rr-2umuCsL={~+TgrB!wN9vaAwd0d2jO%W}mQm$k*y|5sgSEGRT6PO-yG6V9 z8Gnyd=KW}g_JXQ>&SmW5Zh^;J7;6=xhXuZU0D}&U{y}#D3-M5>`U!Wb(KBy9G?Df9pNz7jlk2>uzVUfze=$2~T`!Np`RC+?LKx zyTNccAl-w`(Nyb{t8Bc5XKDsbOip~G;uVpQN%%kU!08e z5L^yfdCSHeqyQ}3VFqy2xh!iMjvrYy=0GL47SyFIyjE4yrG=h%pY*bbqZ$2E0L{Lq zNK*^^yZ{n+(xiH8CCG3ve$OB^%${S!9m)fd1R!)O3TI$XWq8pCD8No5FAWyEPI)P9 zLg^DdVwM17`JXD<)img7`Elh$ zh{=nww0w*KF)PFDs_~(~`$=Qy;Xl8#;1le`E|gYC0*<$wC_nfej+9Y+b6Jc(<}S7+!l zC@k`lSRP_(uU4ce&z$m=T`HQ;!coIoe1LTv~+^-<8 zmBS1XM4Da+yjH&ep^M=AN$nf%)&&$O6mbgD5Tr?O)|!;~rk`>7ebRZ=tb&BexR`4* zpT!1WO$P}=>;x>R8jKIubg5>&+nrBPP>Kh}#rt!X)@5Qqk8AZD#IwLs$VPmxk@}cJ zQ*OY6j7hCk?td<>U9#hTcE#_{`aHYpMZ2xwNfqkxoN{*s>2YP2J~oyh6^2) zdBRcJifrkopt<&k>Jo^M)J`8mhoY{~+6gZ7cIT*iew={;$*!$sG8s!`XB{e_JmNdq zI4Is0RiOA^P7Iz<6Nf2tNzXoznTk!}Pf8%ZlXV`6$DJgGEcN&Z_6seMsK-hcPy#EJ z^ePzpTNHbc&}D-d1hsl>jRN;JUf<}Z)%CRcvCdk<;E0~*9PV*8SwWOEh4V}53x!yV z&Sj)nWjPyD8rw(w7MWnL8a*JAu;iiMi(35%DzfqSf^s{g)O=Mb{UpxfU-{nqc&#<8 zMN6T050j8+1%twkxPH>CL8wm#h_E|_?!BP4Fgx6$jem)~K+Q1V?sB(M+6)qxESkYY zpG}*b3IHnR&(yK-xtOtNI%3QNSpDd)DD>U6sIVpff)JJw7<{>Gtq_BtYr4r0EocKn zPl_gxr`=!dlu2|JVtdtEMMPgP=w`^;r@TW*KPITZx+}6(`(A9-{#>?d z-;1qc7L#-eVsvJoHbHsc4?SC#^X_{eU(p+r{Kg`LLbVg^Q@LafFPQc*(2a^vY+kHg z%l!R4v}%32_-H(o;c*i=slKBpsz0Bya@kT8{FxsL=hSRcMWn$TOgIZCJE-*Pq; z#Ttfh)bwi0+pO#(rN@G$T#^sE3NLGRnH5GB=F~csD#fqLkcB;!7IMUEtITA5S;{uw zp)MOZRleF9`gjTV1K7#~FgwV=FxgMU?Xpq?u=F&q>KT3lT-uHxN%wP&J1kqR=QPm0<;Hp-@fLz**RpLdK zPm`{>ltvM;vHFZk0dubz)j;=|Q6;7BF{K8~>T_xUtu#|mzoFtXVz%Q%o$c$XiP(v2 z4RN%;rsB=huEoWV_8Vxx;Kcw}cnG{6)t^LGz6~M|$qV;6BX6`>nQRDkPSQzFiGp4y z9{4t@(}}t;5li!1&{8SSNh*3i=-y2|=7uVb)8povxUj;pGdRlDPz`1g?=KH9*qu*S zw>ulc>|9Ga;7&Iv8^Zcri=V141X7_hpK+qvFm52Me4d)Ztm-J!5D!teM&qROdd)h< zl#2rtML+R`5kOw8S?8Gs$cKbOPylGISx1)!06y!M0C4Xk%vk@y9`V(R>G@%II+&nO ze5TS~bmcV@P8O<~KgR%@R=d>3=y?t?mFGw@lg(rr&b-+?6oT9&9-vPe&B}{br7f0Z z47xwT=idEUGIXQaXrW>tR%SxmlaPUU{|ECDF!>Ah2(5Y1g^bOJx&?u;fIBN zMg-jJl<@}mNVgN07wYjVtTE%lS2Umzh>_RjBCE_(M?!q`ZTOnx_9m^pm4X%6`s#IN z-jz_UBpTj{wTd+#15(PA_%D$!Qfqro509}0f~t5?(KyD|wNWF2+LPH-)RtD7Rr?cE znU4>YiU>3<(h!AR_SwCVs*vi&!d?iy?w-8>DDFiP#}MUCrWYeRx+fjmD%6=beIH8y zW-l`T26H1=rE-j`l2rpbg6dP;7N(98Nylu6My=hf)LQ>5y<%2aG5|w4zr!BJ0bkVH zT6+?XIH`rGF)~0X^igV1`f=B||JMc+VVS!zxRe0RV-@qcm(o-c2!(VC8Ein1w<>V} z5CFza+{+5^q7*6NOM&pX_Ng9isE=1{HB7ww(2P8Y5)g~~PIp7xSQA$7nf+|g>UkAU zk_*v6K+m3)cHMwE0iZRxg%~iH!f-HV#W)4DRp)(R$70vex+xnOzDB8iDmM<9MKAR6 zt|`73dmSH&qk0WY1F=`I4l0I0fYGzFu}NB!+k?#tsgsH`l)?$AFf>bvjF89&yi(=; zLz&--Yr=}fg=zyFSB@@TtQABm3R;_&^Q$Z1n}f8|I)G|dUUNGI?KyKsl#^3rs@%pW z!y{0CJ!=q9j13ay$J#L;BZE!#YOSziiV&{sDMxaQ4b}vob}%*Mo3(x@Y8ru2bNcx6%)aB# zG5e0c%y3J<8rZe{ouM9_U}Sx{UNdB>?vPZPWs`Nwsj)xw<$7d5B7ZKJt*qntVJF^37z* zf-?c~yzaGayc=!G8R_NomSm{6PHLqW9aoie{Pzjjzo>ecz05g&zmM9(_)3K(&CJsh zUHdLZ3B?ux$Et>WYgZBhO}xWoBr9i=kZ{+-WxO*LhK5`W`sMVMA7Rg3LQ!#`)Y=E z+r<$^cS^v4di|PxE5lT^sA0aeL%O~qNgz+bXpz;o$r46G0s=WvV7InQFRI6{Gho(a z*D@AfXUn0_S=J#C4Xo;E&!2vmiVDHpJ&rk;kLhT$CzgfC4zh)ZbrZ0JaFr=GQrX8g z;@iXqGTqc0U!l}J@+rTNM+f%tm2~mCTC0|tZ}>vD*oAs3!H%851(qeoasn6i(Tf%h z(WRZc)~+z%$x3&u+SU9+J6*SHIMMGoRv9Vy`3P{fD$Dq%*D;m#!q(@vH zLls4Y#~&x4=qp4nX;JOz;OdHEYKAl4C(fgkXESGtQ4%9Rh6okUlWMcoR+tKTizHPc zN>jXV^+x4fq1nktdWNORLxkLweg`dF=Cz_Ug*QDr@ukE!^=}5zM6wdVI2x4IQ|``7 z2)@W+0#u_B46JQG#5ur#6!z4@&fD{q~a0yH`~Y|6;hNxqNd%Rc}FIAuyvKCx6b z!i<8)d)TOQEk~hoS3XFCrY)Oq52{T=c?P6o?j@BkyLPeqR2cv(PL%<%Y^sc^pD|VP zeED8eWdMD~R2k4;I8}g2O;w@?QqPdeMWSXWYl}75mN8VXV`Kw750X-h$ciiHBvF`Q z2Vx(?ivd3BAghYZkZFE*$uznLCc~I#d}f1qapS1eLILesb85&XnF2j_4G#(3PTAZhD?^B~DUIjvQ8kx_88rNs`7}k(q!W7cYF|=w)#m z_b1eX{6azn+cTl|o}*f~^pIs+&Nx|)1$}M$#dn7B7wrsViUYAmL9inU9l5=#5iq)z zfNPl)8ZX!|#;eT-+6N062P-V!GVU|f2GEyC_TONr4P2iw)CTmI4mGpB80utkIlh<3 zNArzkzOzi|Q&pKVbtS3K$U*Eo%jLd~u(2)C`wP*rXKdxCdiSP~8B07RENaixP>v0G zBHfS+6-xj&?iOFDc&8YFT6i8uND>DM40GwsG!B!98Dj(zq=S&&;#6!sF$M&N8bI{Y&}CK80}0|5Amw@N96iQJC$`EJ*n zcyyI;U_F3`8zZyj74$d+DULfyG$jf@nb^3X_yIKI|4D@?5GMWTwm@r z=PTSJ`JBFJ(9i6PMzC66p#HhKY4OuI_%IeOl7L?DG?}&)485t~+kqb@vcffAogA1Q zGj3avJnFRSHO#`kwt<<}B-#zlfwBP<`gl?slBf+=Lk<9IYa8(QhKN)(?<1&QaSj4* z**GQ8R)pHFG8hcSr&$9Ub9!+d#Xd=W8G{QV$cqLlD4J;FsQz!Ib6Q2$q)ix&pN`Zu zI;;t!$385JvwdxCs<2qYK{%rhBC+8!x~7Vpkbj2Hh3LAfzL>*NQT9N2@xZz ze!bPHRnIS88yRfOGU6RKu}JW2L1wa1Dar9k24y-Lr{{X|=+y=eK8t8!O?>7d;@ghJ z+;JuKT93$7R4ic5BPU)F_Njtd(cMd_xG!}rQE@+|UZV_ci{Q92lIPJTEeJ@c4ixOh zstYm_s_zSh%B;PgT=_-44YcrHCfYZlpg6AUDM%oT6)Qo?>X7?FnwOv! z>ub9|fyBDhz66m=0QT!r6Wd=}y-~x#6AD?v=wXPYaX~N!4C5y>wS)m&2D~p7ulN`) z1Eo>iv#72u>?Muj6N}Qt062>KCUpy{Q_e0CE{o5^%P?Mj2A(icwfYf0gC&Dz%Tpg? z9TqUpU(XtyR;}KaVY31P2}^;%i0*dvWkm+emMBsSl|yM5T%r~7kg^i|x(Q=W8l~xjYSdk=DVI>KL)me%Zqw6wZUV&L~+N8%h{N0&7R{lL;*BA<)toMEo6q=I&< zZl=I9N*Y+=CY3bL>X-yCT7p4PbjNZne|rLd@^Q47e7SScaz(nqq#CECTBqr*iBy7l z4p-!nNm+vow{#V9wS9XTChW~zFGcf6sHv8py|NQ(9#>n9{RHhJl?Vh_Spm@?Kv7%^ zNhj+S!Q{pIvtaTB6J8JcGutm_!Ge_DkHHoS%V1Bd04SgExw@7R2{oafScGDX)2o6? z;94{67SpQM>VQ;e9Bq(iT{`D<^J(=_r^!p5BLF_7uja$ZXLLCSqL3m(p8? z{`3s78yqnj^m;=nJP613_I4s$oMEfX6Sd%j1T-2?0c=Q$pCnN{>Cz0PQ{0e5@23#G zxM?Q)sX_MD)ktCvJW*RI~D;+QQ2a;#onF(Rb=! z4Z;~+T*Sk?#61ZgMBGW35Nl70gP|sBF^b@H3+x^ikkH%l%&@08Y?m3s4- z?(~Saxtwi0g{ON>V#h)W^T7*acX1_>2EOJ5e!Om>qeRDC&E|A)cRx z{y*maxSI(38gn!t?0&3hZ|A7m?z}p!Hfwn8Dq37Rsul>cSV$`C)XzZ|f0W=+fv$4kt{=f`D|RkcDNC zMFCleLKc@n?g+?Y6mn-7%MkieQ#J$mR zjtujvgB%&-RYy27z^e{#WOP>@+sM$aFtDq?S;(mQWj@DvPOvnjLD zG<5VyiREt!MnrWhE~+u-Ewx*#9@Su9)weIje8w(b3P}xHDJBfG`yg z9ysLPv{e47^r8|)^(46_%wx3XeiC`L<5*{(#_Ls2N@dxyQS&m9G1?d;AF0`m*Q_`2 z34>O&W{-w?5O)3H&>Q;!=t056P;g>+S{Tt6!Q$rQ^-hi}t#Yhl0&j!(NmvDLA&FVe zTQS~qiwQH5*!E7sTCSIq+TM-VEM2@#s=1dq&`C8D7zbN##|JZkacb4`c*heMrCSCLClJ_H5*{VRK9I{efTR@q5KQ#z~Ao2B_edP~O_4eC=~3{U*| zl`vusD?`|rn7_+sIX0s&a@6JW=V@-?{5m3;OQjffW_x{lOM&c2H}mvP%Ej)*g4%aj9CA9U#MCe#y>^nHlS9bVNo0Urm7X57e~Ytum=X?Of^7;B){@Oz~ku?#~N< z>`x7kW#}Yc~m5_nig@B!kg)+({-73$eRv0Z@ZA*@qp>b8?5@pQ*n_*L*$^X z?r=`|PRth{A}`U({?cNLyeH33eBhm8@!g{v4}LEvDb5pXi%rH-tt}?k56u1qIJc56 zE*cTuojM~rhz7&_9fx#N?2#~4M%~CJSwH@XuM5$pcp)ujTkK&a!QAZ6O*f+AfNF1V ztx*D<%5B%5@NFpOTe>lsWNaXG1C#X^%^}BE5Eg=*zG{@(<@f;5gvE>Z(t&u6=xsVR}XRn`1cY&9(hx6!m5z zhJ>K1ztbKV;UFrpXI2W+D05X_<1G~s3Ygu;r37FnjmoA>pm%lw=ENo53c$r2WjYC5 zdQHHrwprk%Hw&RLHb1{6)IJ2J8(shOr-3sP+TRGn&=Wvg7$PRryfr?I>H5MCj@NbM zD;T4o=l>;v>|^w22qjR%_lJQ;4jR7NMaE4E3Q$?g)mG)Cv8EAP6^^T|vudlgCbURC zhzdu85Je|&>!7DXOy~i$@Gr@8Q$2r4Ij#)jT^1czU*hl?E(}>xKcRGh`JGtFg(xW` zG*rQf%yWd_nR?PUoyWYfxt^^=#d-_MH4>pX3>n7 z1h)TEAih2+ZCX4X0VaIlC)qEd*YC7m!xxtAu5pk`ihOQ(EV zDgRVCHWI{H^;}i2Rw?P!Wch+N8&cwtgi%FrDW`{DQY{QjGoPqViesdT7!Xrf5>zQY zi&(d~O1L8dVBpe@8A`YyTtgUQNcFA?KuD#zR>z8aGL|H@9vSCYmG-+Ajm2S|!VLzt zBASY{f<(0;?4+nbCj?J$J9JHC?WqBh5*o)QWtnCtze=nryI@N->W1qkwt(E4l%(7o z1)Ms!5FG|RcTu3$Y4xPNiwD|?B}mMZXvy9VeBDnN9ExXwvZqO9xRU}4=99|mCoM4Q z3vN;wbBp2bGRl}i3=fy2{o)8d??gXW&s&vdyHkR)-IOwfiw%WHo48hp4aI5o#c8Dp zC9&b466#fKG;o@^TgBLDP#JZr7#odN`CN=}F*X`v0Tg3HQ93^ERL{;T$5nLs6=P%4 z`0K?PVvG$4V8mnjwPI{I{#vTxP5dYK2~AP?uGfnD3!m+Z_~aUKpIpN>l_ROVS38?g zINF$#+dMHN93n!NjEf$g>5~g#YOZNL@IywM~Hu1b4l>*CDx zkm6kEbv?W=28xlbEiEP4=pR8mZ$La$=4vJPOAylp82UX0&jol^6cLpQ15f6MYHu3&i6bD%MnuNhqm4=RZ2=-dHQ_Oi3T;HPYYXu3iz|%A zI7zhe9KSio)2sz(F3v%JuDrJU#k;O>Z{E%@!O~FTO27d_7vm4Ns8Q%`A5_+KG^bVE zSED`Jv3rEL$ez%Ts-*M`#l=~v5g}_Y!bH>g*kRETkW>Q;IF_hdAE$N1Ii5bhWH;S# z<~ij@kHjn31UX1Z!yHG|iSWU`WA#=$WjW!-S^|niZQucA>6}l^^$DqyK=WXXS)sbo zhYXX^A=UaA^KB$#Z(fLB;Z)oh&U(KC%T$U8F4~y z-P0%4jQQLOn$)n721{D8I^r+wNDO`{7h+HJv2RK@u7hDuIh}dHB)h|ZrwQ)P=m?t9b|)V}88*7z`G~Gbt6m;)pjNLN)b5>>y#pfvK?tN{SWnrW2Ov7M!BUT6vpR#eo8D$TH4G_jZh2NkHVD6oqR9_oI#?c=> zIW3)V-tQ0SWTh7d>ZKC%0gB5zq{hKyyu)DPk26^cTTYp!a{a7PDz_t}*2g9@^3^biThD?8>{`#MHNhhcB$E>%I0gg7ochX zV?F>ofgWm#0G`*|jk*cM@7+@7Ps+lB@xqhf1B=T-92~_^v($V8oZG0ug21Qg9P=gI zD&?_rfWc)=eBvzu(OLav#UP}ZwJNk;U_^TDjZtIAuJPic)GWceWD%;X?b_9ZWbZU; z7cKfr*W61(NFysHGuM4$*X8gbjcPyICMg2xrausS9(1# zV?B$gjnxPgD%c$|s1IW1b);%nn9v7Ndpc6j%3@tjviBnZMk-uoAP?*SV5kzb zf@O@R3SN4OU6K*-cwd4~Wn}J6%2SNjiMEZWqtd|X3KK=5_2~)|ZT99>Br)v_|5zuL z6W#Wv{xed7D7f!(tx?)SypFq#H+`?Re9-;9v8v(bjT&xJjeQ%(a4?$<{b;49HX6H9 z+U(r#c7+%p@?YE6D$o@|vn@R|7_1o&yp0U7beqNoIBkwhBIFBD=1q%Z#gf>UKXXja zpHp$1Rcp1XMp5KQ`yp^V-o~2-bFj~%UI+vH;v8RZ*YI@5;$nG<4&X5=Q+Ka zVgP$h5cQG{3axoZnbTGrt3fK^3=Sn zY(HP;FV=%eay{kHT%b-kHjkb~iJHgNCY_dAhvHk}9(|JBHX#dcO-SyV-=8@JSLHYG z`~7V>j_L63lcqRhZ_=y9?vwi>*lCJmcY$E%J_s7+W~GLG*yY3NEqPRo*Ti*y7C|Ec zdok##Nz6j{wGNkl?#bYma*%mRMj zvloPbx>1ZHSg9WZ!^s+-RoED)Cw;poDOg}%qmJxGv5?~u7d7`t&GFKn0Y>WC-U5u& zMTK%{R|)0GnmG7KMk)KO`F*@}9o0%l6!GEiFOXsA@xp^_Ek#Si$+h=esK+u{UQ9hM z)f%UzPO)%QZ3_Wg8V-#o%Vp>!SQ{^nV%jZ3mrLiECh9dy*`{#<(5EQ%p?6CU{N4`2 z+2ZXsrZ@uK#%}vqKHfX~5YXjwOj6-fl8SBs12{#EnfAz}E2ME1fyw9VsD|#CP$w3_ zkm7JlR2l3}m|H$0=Nn5);|b)In;7o9NUD3h3B#Dr>y4Ld6f`P!*~Uwl4>DJKX)vw! zF;GO7A^;M<0+fE~1xXP~oHOiQO`_bIvgu2LmW0a5;XbL=&tF8h{CF^ys{TJ07&>l- z%_ZgKF~(a(&Lu}*MPXDF+D=N~+K0z@U@#Jy{Zmj};9C+T0PALDe0hMzRkV^!GzS#P z6JC3Z#Wb9aB(S3l5i|;G^;dSFAeT`% z8XkLK&giG<#iv!wY?n`|fYESV!%eAi)D#s8DHUpUN+uX9rR0g23Gnf1$rDAFRUT&= z;>EcW8AK;?-ZMZ_@^?w8Br`cb;WhgkBytu~6r=MB`|Lq$;BiUA%AKnYtW^#SS;;(} z?+F)^xZzSdsz<HX6!Ei+n|yqAapv0T-Hg83x1oEHTbX17XfaT6Kjz0^+(kMdx+ z$ZU7fK&8RLf@+t3s+_Owrxl-b`O`=_S{pk_BDjzswgrHjD1VdWyaG`4xrLNsL7!WU zl#9S_cPHsPO|-k4ScFq(iAJNS6p5Y2q6V8@(Ew^JVxi+k$4*HVTM}ZCk{-4Q6dh(M zVGBPjq9}>NPNN(NoW`;XxdaQ*k+_g6r4StmvA-6gqrizt?U-pj1XL6q0?N)$!(E6D z0~g_N7o)=)FPl5E zPExCtv!l+rm~%HD9X(Zw`*c1!fJP|}m79-_qgesQ%gsjz)2dK{3ege83NVFLYCp`Hc%3zW0?PnoQ0%tKn1nKlVWeV$3X3sO-bw8kN|VMBfsYY%&**M6@4oIgofZweOS)&89zn?X zkE>0}YPBzMF>TI_=g_6btlszmS9_x?`rG;X&h0 z6)ikmvU0BkBI?#oDx&56l6bIVyNP&`dZyl#ga7xO$#pQk6IL==-p%?cKNiaSM8IF^RmR$lk>in zlqf~Hw<1SZh=yhccUChgBj7ZSuevflsb`%UC1ESq&yFi6s{2XUkh$?v_k1`TO!Onb zhFg|6a4??C`DI^D$p=erqC8e+KO+}_VjXQTWvwH}9(jwjE1Fr=QBo&_KvslF@2WDr zLQH$nRra7A{FKOSRBN`)CnG zn*|%-C0-hQYFjTBK5fyfm)=HCEwXhrQNmGGE7fTZsFvCQbOOr)jVK=&1n*540 z>NWRqwxOgYSDQ%E-aZ4_m@n@=xxGzSi=f`?*RP*}eMicVdX4^$U!jZQkwV^TxxAO} za5`)}w2Tz2{_GjnzR$B~SpS~So)JO!dG-te?)B^$0({1^XJVx8^X!=bx!<#AHay-H zm#V?;u9(2bk1c!Q?B!3VjxYQIHaK1n?(mf;mHwe<*oxPpiyj%QJ-YqMbk(5B;o?=?cE#tHO5~O*UL-9b%am4V|4K)4CBbbYh3Hw{h3pK1;q4; zAf!V9`3O`Q_Yy#W(*A%dVpl;3&L{lbJ?7l=x)?}31N|TzioFmWoiOC`n2GNbpgHsQ zVP6_!1`QJ>56xdEs>qD>kZBkt1>`Hl)komV0f()F$Qu%jB_9eHjx8`EELHo<;`NcirMq0Q=EK4Hyg}`P>|VfpJsEyw}C%f z_%l=ji#}b$rvW}#4?n7tEUzJIfEiCTGV-SHWuVpTAD<(~HR{LEr#fDxoP!9?Id{Pv z$-MS%R9G9Tn|Q$*Q3dlEdS&jY_OMS^OHh=Id=HOO`tzZ5Z*G%hdpkZcn9X;pulb*| zkyAzbo{=z}y?s0W;q7b#eiSxHQemC()cL{5^S@zWPJjSC+W790SU@<&sNXrLT%u|( zL+wk$58hp<%dhVyAd#u`0LBZ(_rQwLJm0mJ`YehOt&y?CCD+AU^NuO2JroP@5+aX=+1&EI{;~@ zSa9LL1o7q~`2JLmHU4<%Z10cs&l6|6X#D)ydE0mO&v)>%!LvhKTLf(;!i!aSRO2pjzkUJ zh;aY8#76iRl?JhvAHDqm6?^`s7@O?l0-@a6E{+M$&)Dgnk6SQ)(al2HJ3`vqGTWT= zsLcyBvH0Tz`2ceH5^e-EX) z!(<|XP#QjRtDrx)+y`za0~o8D^M{4U#VjfpZh+Nv584t(_^5!u1wjSE6d&(yN?d_# zL_vD6Xk`l?)ZQUx^r@`mJ0)3GQe_pzFx_A}l^YJ#!Gn&myJBJLl)O{pw(h$FOJtI_g&eer<1WQ-!0qThsa2Di%My=~XBy zG7b3tOS4L8O>8o(g0~NF*+Gv%o0s{tDH6p)O9%9odH0%6sjq-omHq@{Trk1~bmzXj zs4x&ob2P$rFistB7zSXT_+5;N_ z_!J)sKmtiM^lv@fped6!zV$UF&#E|KyBc(#37cfQ+5ioG<841vKH`bPBv{^d7r(rM z5@!b$cdkd@QmVobQ(YL(Dk#Oy23C)q~e4CFrLw4W-~b-XvX3=bE9aIB12@dWRqggF&1*WyPeWgY?`UR zT)DR?Fo`|Jx>nV+$$?*&^ee|l!O*7>^zF*0YZd0`U`b?H){}L+B>Scu};KO*8;0+^vhzvFY8!$RRDoNe!n@_T_WYWi)5Ul(FiBfy<13KIKs-? ztrcmss;5#aYi+DIroQwvu+s}2kn#%!UWTDR660xLxBImo?U$&yYVX4P^)6hgcj3l* zNfMvI5Hw1aqmW zy#)gT`5F7-O~nZH7z&oV3DC(!(i7nM`IwNJr^83s4Z>@GICMnGw(};KQ_(s-D}Vt< zy`Hf*eE;3!c{qJc=~y3M4#tnwrmpr2(5OT>5WjPS-WuTH5dPEknbz%>mremF7H5M_ zB349d*5Ma#eCNk-)*A%d*Utfsuh8upRR`pE!cELEzW&SjH~yJSptn7m{Nl-}5DZCY-YWSXEa|tv9Hb9qP4oeJG=+*DX+{-+c!FhXG?Oy~ ze9pm)(L+p$JPV|IR5Gu|ZMJy?`dhp?{JOD@$1})E6Az@|2Rvh-pU51P@&=w=j-OxmX z>KpU9^E28vXxzlHCe_mNLJk+#ka7cI@O~!l2RH`!$}pMCcGMs20uB{pgh}W*$+`~C^wubO;JVn~s?uxZIS%?05 zjwBvN3#sGq82#EepB?D-_Er%?Deb38C#ZnpDM29NKVYo8Iey~n;Y0XwlU*RBfH&e| z2SlFM5n#oMNqJ^)Vl{DDRe4#FW`2j_!qcI)vIDr-kahGgq0jr6CW_Nz;v@^sy7upE zb$^?NwsjX`lY4j& zfjeb77@rDU2UYCKy=SZ1}Ie{WP3Gl$b zSessl+S_=Hc7t;hN<}GzMT)#FpCN=2fO4rjCnA^47P&u0UUwSMLS2^C5NzVBdtr7Vnd)K;;|jHL=}j zZHM5bUPEae@U=z(Wwo`WrO#<6p%v^Uzb~KA#yAjVz+(aNi&7;cZ_?9|dOU}f+0u|B zKi+P!ld225MM9IJmQe}xd(am#oPkOlT_W{DJ%N}y2>GBa2xGo^Wix>()IP*X_&_QY z?QF1QB?k%D+t=Z>R|&lK3Xk0e-NB65j#lB@EhDBfPPl?l0A~FS8V1<0L1}ViO`WXD z%;s%U0jxQnOoAzFvI#93r51kUJ8ktZc&qRG9$xhjPEwTJ^1d$Y-&!TG2%yIS-)@O0 znFJcBf-K)yKl9%E@=1+uKKeBd;!Zm*_wRmY;wpH72> z^~v9XcP}w1nW^Uu`iiG`2*Pk~FUnWIcL^BbE8v6ax*^Tn;7wGR@i|GyCP}!-Ug7h$ z#w4Qlr#LS*yv*k!6I{ZIsU@lbwFPQ`xW&P0^&P9;@){JO9BQ48w(WJfZJQuGSoU@e z<#v0k~wwIH9NRj(be(^}6rKWti^ ziJ&!%y`hLhPt7-GT9*MoT3E;o>`J7d--GbuL3<&tk%dt@X_ z^EgZyy7ly-do|3x-D+c4V@^cDCkUZo&aR?OYUQ1wg!@=WJ<$VQM}tlwjkOANat_a2 ze>6*O)vN((V@R@qYopIedIqQtuRpy7S%o5L>~^z-jhGHTAG27#-5M14_mVt$MsbWp zDq~3DHmlT5$htL~R&1ZO8-^JKc1miKOJdClfb}E#FKp+SzBEI*s5mvOVlZw$(q1>{ z_mf(~@3FS1vgj0M4@>A(dc%Cf(zw8Rw3Z$=vJIDuFD)eBD|qeaZ0sTJrdrazLKGTMQ*{j zA2V*2p-LC+(|Xf}k>5_d%jux&J4gNyH1S^QbrpI4qx%)_7%aN~;kv~qPxkgA_dkmG zpFi$@{0@H}KU{YnIuxN3550jBD#a^m9MYfZW}O1e+ExLxW=EOKA!M|k40W|X^)a}l zKf^cU4@h>RcNVyRfQG`Qh?9Ut@;IP2M?nwu{=tl`bM~qG(@`j;-iz}Kr-paCrw)s( zq0^XOf(?q$HK1sWFA;{$1V4t?`U?07lF|~SI43BdM1ZkBzymIXmrnx}WNQK;ogHLY z_{(i2OKBp&6vOK<@;D@U6m(~m-hK_59q%XPIp_QlEQNB20?!{`Rbf3}w4KuV8|PK2 ziEo#@IUpH@ma&iCZMuHXQWb5uDVV5tKs#bMt2E1}08%=t)~f9{*n^X5`yAhHJgGOG zlG7+P+tu<#t<-cH7tKb!g>S00d|wVT4QSFxt6|11nSAvEeyYdrjpq5Izpx0K~8!p!GWrW;uuKPN{QSlZ>%vy$WF3$E*KfjD~NI2Wzbx_Oh4ZV9*Q7tL~IU3u3* zzZv%jSKHSc>+rD;Rp~v)>WdDnu%mjty>8S6xqBG|GpsC;>dN>&4NMK*JsgI<0cJSx z6OJ6MPoNz|zoB7ne*>ju9047ni{1J%9|QaLBFJD5^M>}fes?^JdFy;~9WSaIX%xQBF+T(t4h9nOUrZwLojosn$y7}ZUGv;9 zKEN(K4>CaQ{XURxXU5}XnVpJ=vcqR%gm2e_KQ-pRpDH@ zRMB)}Csl9gy0R@YL0kJ});tB^2 z`A(cgWFlS3Iu9Ns76P4A_7>9uCDs69^jk0yvGDiV{QQ9MP-9 zIDGz?%r4U4S>NP92SEbRD6RfPN>j9?;eVF43lTC_*Hx zqy@%Mm76e|bROw!NH^(*?i)y%+Ql)wu2%kup9FM_T!Yn<98)85vM=vu{Pr}~xCsV5=OLbUQXRHRoJ~Ge z+Qg-~NvXUxO|lSEN4R4A-a!PBQ9`>gs?1~O{GwLN(XlF>EMEG=f>@LD-F}j!vzVc? zE`3Wffyc^itfKpwz)MrVkE2C38Ld206Tt!oR$zZq=GgdMJ#GUe?=%)B7e)Wd| z$m{-rB4WV*lqcf6uo6EqlgfN88DY5?r|H~0&?HixcPI0#oCGT3zlIUyx@a!TBCPSS z3m?o$o5-IujNYYSG9C*aHy*A)da~lP(J}{)rv_^ru-K6kD#%yF@|#CfT}xe#exwt% zB|#JpBt+kxtT9&eR8|13C+H5y zC#vSbsMk%XXN#=JyxUbx1~A8iwgIe*|KN-~IL}OMLVYk%Zm2%~L)IG@oS6jBk&+gF z41#$m0r?~sFFwg(`Q)%*W!}=ydnq|2GeKbv26Y>Xb3(~o0>(HLN{e^6>8~Xo(?F;WH~vi&_N_4 zqV9mNnnsr(W*m_1j_I*e{k%zUPO?v&Cq=Q%NAU%1VT z6F_(%w6Gz1`OSvGjfGN@9;CqNe5E!ZM$MAO5N(Wec##s3IG+G30gd^m`b*~_h6%~n zyMo*$JycK!-D_*9z}gkrky(*Q#3xz$voYf6j4wN=xca>g2#-)B6DeWvLKyazJgxZj zHJ>C#B$Bl3a7{}o$rm5ce&U54YV$7%l!z1KOgEjw2`2Nyo=Ps_2b#oD8SO6UH%`Ha z#H#(&puDd_8N)PCt;3TPz*UFZgUzbenq&#fU*hWPajn)=?`G*eZ0O(k!-RGKl?lO8 z`^EW1875YG`WGsZC0XqlzUlU8aY)S;KTKe6K_NvSRPRIC4U6Z9LOgKo;0YiJHcZ9a zDIZtLpaRpsTkT`a87h9Alv-{4d7CU-!8rCQ<^$UQWRZMeygT*g46rsYFj23=d5ZNz zlib_Kq~kvJL7K_!k5f^ZdkCO8sa9&ojzCjLK_i~4T8yXJYIjQK^)ttQHdEZU1he37 zB=%xyV`|%T6Cc3pZi;pc)HG!0l~;nn=uKD;223AvPo}{vkkZ!ztILi#WP($^?d4FF zTCIxLz8$Bys4+S(*xuew>B}^&FT@x;+&s!6v00ankYm*a@5ruCybu%6q*Ruy<#LC4 z;* z%FTMGe)LyIkC$+s=@{=gfJ%i;Bc`U#28qxxWg5!tHn6CmXa73Km6PguA7$1HBVGLl6on$lLu6s3n*4en*+6)>nUQh~~cWZ@m1Yv^hh4rAt9ViQ97c-c-P; zf$-p0x|t;!K5^*~XB-eBc?iSI^4Jl_Ivg082HFX|8==|KzpO$N=pmg-b;yFDF0y6YC+9q_{CFR?IBN-t$0P{8OJ zeHR^jg=opZ+k4(6F~-j(13hwFCJl6ssmGcntrG6yL5Y#SArZRR&QO|KU-@e_{ zLjyC3Bf|}n!|QE+Q;v)pUkeE)u+MC{Sqp)zDbL$TADf|dmyrr0a)CUH<08@;=?f+4 z60?fqA@0M;8)tap7-kbR7|M;=B4k>BdC2@{Id;_Au)L3^R|9@`QKix-S)tPUEohrP zwv@wEuW!`<_%O7nkRDA|vxJu2u|8w!=8h)!lZluqvW_0RUiaG1DJtn;f@4Vg9{DgR zPz>Wnq0}D^MuRcl2B*dVO(>$;`B4D_FUVNj+hK2E-j^}}cX+Y>6TFg0Oix}G`&Y6^ zQD3zm92sfL70yz7ee!CC^34r)$Ufgxmlh?#rl}cOle}i=*hVj9;Oy@WS@6lG+gvoI z@@eI`BTiXb#$g6X3iE6ku!wN-B+>q`Pis-sAaBxjju}vVvv^Q`6U>AkLm?KWSfOTR z`cc!uVe3v`;#0wtp}5_lJUs?A@J-m}*73X#I!SbKAy*(raY|y4jiI2mKWCF}k8$KRc_Ox5bF=lZ^R(Q(k3O-Z&x! zZ_G(=k(@VW2xHVsM_9u-aSEh=UWTFkC4I0ed$7#XrkA5a3M;*1BDR*l^eONqc%{*c zSl%ULrDK2jfZdLoqQm(pF|;SesL`)CZ7avJ7mkEm7zMNrUckk#qZ_oNd%*~BJhR<@ z`2>x){z3j##@qAxrnm5P#Cos@8(m0RfJ`4BETR{x%)Cou=0Q3e9}Yyo1xETTL=#2g zT>>H-3qFnWOpvWi56)>zdutC$1DU0uXB16=$Y*ldbD!`tIwLw%WVt2yYym;-{Q|M% z6i^Q9jf>Zd#ps&v=xhw)U4zOQI zaO1!VK%!N`7;rJu4Jt*Sjgxt*gXL`YXi`QKVvFHmhU%z(Kwj-23zr-t9^MI6SU7?8 zeOnk5sWNMd_%w+eX*c$1gj()m8cF+M)R%YSV>&%3<55GQa9Vo+xUsIaFLrwl{ME$%2nr>#ngvr2!gvRcq z{3aGh;;3~*Xa||vf)#>cPyB=;w!znpH8cnZJ&b1m_!0gI?1BH*sBP;P>q3i{C`KlBQ)@ZR zkfi`TJcxg%XcuM2QuucnJqTdJM)n_)fa7@wkD(78SHp-~3aLP|Zr29F&?+GSK>w2W zfWqtG!&pyEM4ZEH%Zi82o?fEHCGUsR8INvYQ194FcbjDJv)QDSU zFu3e2c!*So+Q=t!QsovB-X%=;qVox9WF}RJ2kLYP?$FSqj;l>tfOfmuB!-wRl=*c#0 z46!n^ZE^n~q2Wl090a--M;E4tL(oe+jKZWC%M3R_R`qod`ucfM+B>|hm}AoIH<$JF-llT!8M5n5z4e*7&Szu2XPlOLF0k`qBXUe4@)S&hI@V3`ddRpd zGWbF~f~?#GefVw6oH;cB4GXe=@43E&h(L9qgZvAJ&f08FHW z#RCapcuJJs(Cd28PJ}EO1A(&MyzZVDLqVo5MP-=I%TDC8L~UKL#$Y;*QLkUL8y9Un z2sHp$p1+N+=6FL~UV1fS(oh#0gdIt&>1Zat@92CxHivo{IzTY- z{xSEBXwHl%K*ZS$SLI4MYug6pA*+dE7?5L~Uq%z{pTlDO0G5QPB7Rv?kV*_`KSO=V zxI)4Dh7cO4rF)?W)V8(=<;~W+x`eXz0;}53@e2U&B3Nxr!9J~1ML$Px3Pi9(_GgO; z?IH>i`Z?8cZs5hJ5<6~D#+nG4BDV|P8TyZ|#p=(e1M$kZugqjVHDqtzGt;Dc+3vh7 z)y_&S@uGIV-#5!Rbk&h%c`LpZWzS95S>j>KNdExu&ttOHMMx=;m5tDYw;W0})uzjF zQB*Z20}svcV-r+DGALhDUc@AC6=5GBf~D`u}QU+#!q# z8><83(1&G+x&Vk=SV(LdX7EmJ0=lY!Zg(Yge61%F^m?(;eJMtW-e1q>1v+|z3fN<) zqTvk~3`JHj1p(tpT|m*IHeUnu>;hvzT5W!=T{VXgk}tY=G}jY(IK^`v!i9rRTrK7< z){7r=EV!O2w8$}SgXFX@It)nHQT^iln4XCjbVaV5NdkL;I@noCjg?8mNg7OQRh$*< z=dBTeF(eW&MFp;2b6dV%-ZsIKCaiqmsAljB?EDn{O*erZI!ABX6*0Z8q-dz8m9B{- z!L?57%{IdolHhn&5&$pGTh$jBFvGEF5kRGGBtT;135ykr_>U2qKE|5Ls!*6Pg136! zmLr%KW+O9CGyn`IPmUBu%J5AZqLfA`p}ra+43eSxG$aW%U)HNK9*t!X?bitv8||hf zmqm-bT4YzNi1RJ@vnyf~=A%diq)}akMLEu%V?{LoE4`vg|4 zR4U@)j9v4%esNUefqtrMiVHUpu26N|ysm2A*NHB_x{!Y^&tSDxFF$<>izfg*F|oU_ zA)UWq5S~PF4M*}xbPp1h9hWDPXpwa@=arY0rgPB(=J!H}orI{(FI?TicPAX#x<#WBQleFA2y510Q$SwU@i}Q?3qz*e1em#S=%+!c@vtOX zWISXzCz>IVCHJ~rX`YKoz*E$`u%R&>clxs6i^vL0?#aT;ObWjPAe?egQYDbwlw}A? zYGc)NJgioY$sKtxrlSfQEWYGHo>foUjw^1}hu4EXC&p4!$e&1*hi3dC^J7M2cNF6n zWsg?7-YmVSkZc!&`Oz4mk7ma|>fU6d14H}6uNjRon>B8&+QbRt?^z@TD*C=X3Q?m7 zr=CBd*sd{W62OC9bs^md)wrm&VPu~c?2j+-4$jk}^|A6lI0sL6tdBe~Pj@3Y34AYt zlNx$reXNm|^|Wh!e8D(-c1`~1+cg=yZ(muimCiA)_14SVpX*IpC7x?nKdzMdyFCVH zRbKO6QTSyagOQ6-KfKK;iy|_f)pLQ(9;b`r>P!55nYScXZ*VgRBP>tV&+62LOV_Fn zLSR0OU6XD|+#Dp0r+5l49fZus@=R!|^ew#O#k+7A#aFHh!F5?QT$q@JCwSkDRW6^F znpl@2NXR-jjjbe*R+}f{a@W)a_@c6WEI0wI{i@!Awi+1lak)ovt=~sNXH;;MHSa_r zw;18RmQYNfWZ&+U-1wp7DUB*^`Dv4mOPZ7ysP3sq8Z~hJ*p!u}3Xs3;5=V%QKdphX z)ES_@t9IxmKo@5hHDQ!?3l<+03%A9Bv-KR+g3){!1uPvOmt6r^6wWs0q%Q27cjnoA z0%Soz?j%5>_cF>27e}hG-Fr2Lkg~D8)fy{b2-O)t_N^gN!3>F`FEk{8da6dB{z?V8 z5HJAZSq&|R1)Zh-N)UNzi>i9NB^b8bWvd^vH}!&9Y!SCkn^NuR_ACN;zvBdDQAyHJ zA!cBhKaOP7(f0@=Er|$2S8uTR{CSL`5-)oWT}vj$aYSMrETxF8V8VH5@P)`RdRK?) z6NZzbK^hys4oXiD!Ml;qC9<8py=d)=8h-YowU4RxW#lt(9e(abKBEkV&;7{f*L4(* zJwNgpx1#)QzZ=DUij?fT(a$7d_X|3m5<7?j-J1N65l8x{*<_tehLRo3vd)7{hPA$G7hD=Wh#-;MZ<(3;*7Ih<_Iz46 ze>;3zEbe`Tzn|=EJ%3wti`&~!C;$ETZwq^S8wWPyb0|G&ZWK=cI2KJG-6J^S63rGz z?Gh9vDKtAuBP?=lbeZchXhFE~<-_GTUfyMJBW_+t6_Dc!h&W6GL%Dg>-BsN2l_nTW zc<{CMYzYwbC6`)fncFP>Gecb1I_uzudz*8CZ zAGpeg1yzPzWtdVWfvm+;eU&Cp8g5FPeT6m5IUD^A!W<@J?hi~7Hu{5&MRfG-%8Tm` zY%&Ilj%Ys?c0;wZgrJEgXrc%bgR~yywsxh})~z!CA(9~eX`JxwGXANX0O|P&9}{55 z3BXCP37`I%fGw%jgnE}r^}HmC6DlUu3ll&SzD*K7B~g-8FJUT%37}U=_!256)f* zoSmr>a8X7?GQF@a9dX42kg(nN{@sUQ+T;B#89)5xY`o2HENdjPLtQZ4Y~|v8&viS8 zB#uL;6V7_%b${W{&d|X0@u2eD8~G)10xO@lqS(Of!8(7n02`nsme}{Nfs6y&WGHU# zl!DMpnI-jWf!C{Xz)-BN-4RS_T80Y2&?jQD#;}BAekjoC$bYG#8(nsz3x#gf!33t| zP6xO{p_)x+cn3RU7-L!b*o)TcI~lSdQ;LD+jIs;3&QN9Y^oNlodNQHm$B*iBr-OYy zY8`hv*>xRjJjCZG`iT88j&0v=l=rGT|73q+>d}74CA8-xS9|_%}^D9gEOT$0D`UQ8Wn9 zgpphogVd9)Fy;v$=}zu4{OfYwr?rOnIw>!Sy_mx6K?1ZlyFYX!67tdu>E4|^Y49Pd zg%>SLy!9uSR`h#k9MH9^q;kF|g(3PBIho;@|sm={z^FB;CKnBKJ~A-`XHpO`?bF>Z4b zh9t^hL5`u5UJtAI-bl?9tN|EBing1`k6_hyeRdDvF?9zcGpNceVFgj4Eh)rgU=&7V zJ?R@6gK>{g-Xs)G=HYcl@S4TS2Fu{&sY4|*9L|iw$AlNSbTTn44?R=5kk3HWVb^(Y zfdr(8EKw_p-LA#442&u=e)@vzWwfREl8p?zPUNw|LVqY0?5t-u4nmd=w`K#pT|@y9 zCOX#|dRhtu<lF(#J5ck^-=@KAW-s@far_(R zJAzs6j1xsUA@0ZvN_V69gzNS~e-0vjzBIsH*tct1MU$nub3W-SeQ1WR;_ap32q*>O{1$DJWB)_PCXB5YiG!}I_j(I)B*0@xF?WvoB&AL+mc(oE4r#X|!V;G@enmOh z43cw>CcuWqsIQ!oV-d-LeHiwMe@tAKN_sa+0m5DzKxw^Pv4^=dc#;?6e!!ieJa%Hc zzaC?zrv!c2pccBHNbOgoim!8~lcm`Q=!#AxU7RqPC`y%Bc?)<-&b6S2!YUJ5r`yk# zoTY8whBi8e7q?SqIbk@{n(Rz}t433J%U;N03_5fVCWR(`Eqnn10~z$3f}pn;fz6U= z%^_R%hQo}$H5XZSGR+Djp#WjiRZ=>kjI8JFPNmtb%ad}My@LEBBF29pjy&*!3a9ok z4igYfvvN{tR?f?n%nKoS?}smgh=h_o&J35(J8ZN=;R7K3@7+&S z$+}&9VsD#*4J2l9mjeq-oSlE6KC&wb8Q*Nhug<$Fd( z#(NZ0m9YJ+C?}&^WF~`(0kZROCE~jRUC$tPJWi?^IXtrNE%6H^V^Phg}~S4iB^E+Q$bY_qd4p%}tDJpdA50ALo)|dXAmABC~ur=0Qop+XO@BfBTCLdT}$w ztXQDN)2dWZ?M?K^jHikw(RA#ALlXm?JY)SB3T7(m3=#%2j%WLO*=8GE0!w#5G1RMz zPGN@ZIi^4+)Mc9*Q}IMo3d>Ap!|Gm#UZEc@TozdhIGcHYI#+)0)`vsyg;k59;4oM~ z&3B9d?!5pNnw9V!LV{Z4aPC#pKIn2UvpXBX7Gu9ZZFu&cpBd-{OgexE3XS~3<&MKz zNRL4c_20ObUkte3j@y$a1O7EViLz~csN9P>GBl)CLPRuWQbvpAwIfzD#%ldZ$C;<# zz2ys5?fPKI42czkkD6uh%J9GkC?kGGoBoVTeT{Lg&zb8D#afz={>mYXu0GjaaJR3r zRci{p%Vps3b&ng0|Mr`EC%i&iHIR-QTp49cvPvT`09aQn&qi;BTYm(V4$j}QI{EBo zah1bw|H#w2ef!5m6)9tzM#1NoC$Bmu2mhtbwaLQU|9X06;^vYyxBvCc$=OTmOSQGR z>3@B7^!fmdUDX5GJSeUMdR|+<0W^x7P1J3q1vEM>2<4QnrziqF26Ta2!fW+MBzHhC z^UJSL%6hC41}0RHe}7ZzJI4~VQ4WmHrX*Jasy9EqZRV})AKBM=J6l!%|J?pchnb^* zoa7P(c_tyy4u!d-Ks-DhxAq(E>-c^qwu>GchGS5FpbGOJeozcQb6ktmt28dsv3ais z(mPmx|4nZ+DGO_J1YiE4leECUFh>w)K9DSi#D> zcmf7ykefoCUWJ?0Zh;vn40udFl;n61i5kKC9?1lwM1;ZS<1sj`k;%M{6PFYrGJL)U zz(BgC)@t8F;?1TZomB`MH-M)Fp^RFsY=1v{zJ-g1q}}u$T+oQ9gPT?% zfH9`n7*-phY1~6qhF@{~@oQWC-;YFWeD(oYO&i&Mw#fncS2bPhKaDS-4SK0&WUH-1 zEE!WqACF(N7gU@#h$B+<*GdE8{LJ*=f`fpz{waZ{J1g>!evP$XpFUMh_1xRfU%77? zwIrM)oX}_OBm-(xZ|M{3zPz%Pfs2h3tNu{qQSGQdV6lxayP7k6dSM%DIfBY;H!Za) z*5>PtzsuIHG%-d}sWwW8wHZrCdVCxGA7P?83*1&<+mL?l?Hh?`2bOMeI@2)VQCBNRuco$tSFsD%pWpj+h<9 zzPZUi={EtHii+t z*cp1JCYpknS8rsHK8w~%*V5u(v$9X%VmjFuc^DjGa5P5WVEYth z_2Iy_mRb2FAq$#Q^D_g%A?SICeW(LIBERm& zs+cN)t#fWgar!Kp&A1EqKeeQn5AG7|#szh{Efk9Ja)sU%h7%`mUY^?t;G?M;Ud`a& zbtJVEDX|$5<>Rh@>6qbCG(3yw!00SdOtrt3ZL>?t@CSBTr*0LpHRCryE75B0`s0~S z{qe{s)_lb^f=h17ufpl{!?^qODR5$#)(l_j1;zneYDb7$$)r)e%QIzR_HbrPfr7ZIbEBekn9@;-`R6X^yn)_ z?`rBA1~|dMFuVBv5`!-7_^-~7PJ%bDemYf99=udWP^=fi=w0eDLnlQof;EH$KM%A`FE)-wBU;_(E6BS`DbPTBI zU*~od9%+xTMD&koFnx7v4gni~Dox8W4vKUUK6AXIN9a~eD6gmG_8txuCS)2F5Grd7Re8(c$Is*(qe0%M2cGZBaOu`LquUi-eBCo)hxG9cm-nQY*BLJtEKVOk;r| zHuT>OlX?!+v<>`EBRo^S0pRwdEdamR6fH9V0>;^31L7i+a+VJ$JR->8uP$a9Fve<_ z2pCHqjRw!RJ7l_PsoM}vnGHmDKG-sGkk z!@qb_2;%fd3Iz=_AD(X;h%t{*`jFnJKcPtCIYoq`gQpXo2enkUL8wIt7pN0BDImYY z%nIYHg3>S;9aVUoU;#=9RSrqMuCkLeAlk-Y_$ln&a0$3jEv;SM6sL6uG9E?z zA_WXtTZqcLo=iTLVY5ingJ&oe+R5avKsctp>02`OSBJlNwR1S4|h- zq_dO!s_xyyM`H8RAEDO>8#*0K+wNP3i)47gyrP1PSLBaA44yvCJc4@5DYHI@3kGMx zCPY}@kAp{p>|Q|J!MQ;+y9simMyKI-&XiAEAi-=Kc@4a1p<}c(O*cix6uOCEWTd_9 z=;SqA2M`OhQg?v0^gKXhi>#e8i(+mu^Q4>usA1CfxS>Zhm7F=vSWb0;X`T!dz6=b z%d(oli043$v7GLi;x83b1R=kOLTaf0HhkVAqJ*%qzgeF&dr+YZpuN-!cp-bUtRLo)sDg}%}~Fl=n( z4Lsi23-$Nk8{ighXQoRWuoC~}mmn289QQ=ukn2b4oLb&wE&nOq$fQ>-*~lMLjZ~BQ z)Ng|<1cVi^le4|7W0|M05&|)2ibdiULgJlUGD%ua;g5b~w>i2)X8H6X>VF$_piak+ z?dQ{2>8l6(;IV?wn^7j(VegvXWG#?Sv129;Wy^w{xDMO^brb5YYMKE%=esSzqH|bw zbZpC|*3{B@+nay*P9x$V2hV_sk)R~qZq^P2KnM-p*&P6^??7|2UabDzY@k`;II~YS zPzF@kJUa3Xg&9wnW@iIn;^xLF)3zSMw z%zX?^dX^b$%}7>gz}ZSWqki0={C?S>qHA}FF)SED+nt>FYX}mZFl(D?^1bWGiE4!X{GK1* z;?uBd+IHO1f0`<4vl&9JUUsdT_@>n5ioQDVlv2kuppWYBxqD{CY*wL=P+NMJx0Zpv z^5ak-7^}%gFgEN(dYZ;Jy#`+nqm#o(H!-zU6_8gISsqVgPfA6|$+^BiBl#NSbYOPg zdTUmw@`~e=v^GLBOJSaOmqisMXJj3v$~9T?)oB&FRU5b05tz^GO>^z2(qzpuVhNsx zY`1KxSD>=Nmg4pCxnk1~PS4&l_DNQBnbStG5cG5^N_0HH$W1JB7(kEhYu!a$b5vS$ zn0-Ux+dyCsQMS)xlOCE&ps-^pX%(R~RCIONj5R)SYZDvhU^5Rf&SCw6i4I$4t*Nfc z*oKe|qD35l(c!w*J`90~H97k#b;AHqvlTQ3D)0$pC|a+vr#%MvC(L6de$mb+(kJHI z7=9+s#xgqa3X}e7qYzh^#ClC^Qro|^`E=?12ld9M*a67d>`e;g($nDBuGYKR(_!~PpQa9?jihzh{;He6?`ds)-V)r{73 z`gqe`tg^Ju*T1-d?C$cjiACKc?ZK)_|4;>zPeeloun@9<)qeuuqwdrgd_)^^-l-mQ z(*sS({=!GIh+7$u63#x!);wbfX`wvH zt82m5<5EkLMM^M&!=3Gcj9=K+-nG1;(f)xfJ=nQ@anx=(JdmO;+4{vN+D)E|YKJokC1{jL+g( z-TfXrs4wo}xN7~bd%31P%bK;Dss{k3LT((bhi@=oId37%0%&t38s4UrN9eLGiwr?i z$eq`~&IoNI6rw?=OlbqqE=}y#TCGW^oFM=lc&{{mFgA8QEv*@Oi*-l6SO>uQc!-H{ z{u~YvbWE_`B7FE#XawIz10);z#|r=PbE742cfHAc)Q4<+H=v@M&WhfUOcZdFQ6bH7 zuyh2l=}^>yLhY{8po7@(&!Dw>Fok%H?tj@fo-Y*k6%}9}$s|kpx zFD}oIPv3MPAPLf2>W27bmzOlqh%>R;V-H3H>QVcA>N7*WDvZ`_6TxmcHge@rhxTfM z$%G)t&|N{9!E;3&e1hbGv=nGHfkZ>8QxuqhChqjDnsM?otA1|iTi4FOeh}|#EdiyX zQ&W%Dg$yKaJp*c!$Y>{c_1?bYM-hnnU+2RLLZjrpiu{yJ?gT}0P?!+K^9Sd#)Y4N3 zbpOp9#0IzP`|}}#qtJ@l<&%j<#@;@9Y{|i$*wKwfi-rdYlY-HmxOe_3vfJB649J?c z=#v$J0r1sXrkzBY&BlUhU@{wj$Z#vF5x64)5Am$*mh`-rYgnq(B{#YnD zVVLX|#3V16+0NAj7`%S}HmLL_thB#GB}`4^>KQ9t?ZBw;%ZnF#mMdeGIL?SG?eE)4 zk$VUM;R`1V451Khg7aDL8f5q25J>jxmB~EG%l@jxV>XqL4+YjkJ?z5_$t5alO^<1ot(t7>5Ico-d z$Wqwrq7Zo;Wr3v;>Ea+ffo^G;N)p5xS5;&yu>^Q3JJ92Nab88icsAfGOyJMH-PAlA9wQr&acen($2C zsEi4h?Ft!mK-dKE$SoNuDiq)(1qLC^3NVzS&+2dc5lGLOMFaiGxB<}^dy`q85)+o0 zfUqs^X!xFTcrzUh2lrg#{zP35s~Tw^oxEy+j00c&54@v{&n@lvE#DvLfQ3VG&N*7m zgJA?1E+uc2^w0yXzOQL>wIlBezc>d=i(Lq_bVw0sp#~lgyZR2M zAy^|c$Y&Kn&xA^}1w5!u-!vSMeE{Q>u zz2&w&1q(hAvJ5b&Ihq3rVSYzAYelm3t`&9N=tgGQ6o6rBNDoz7+hunnC@5=i8t&v6 zD3H>3W`r(ZveSExo+m^^ZNciYz|%Dg0w#?aOfxJdZ{$4&>7ah5>y7 z$-omKnz)*DCKw<|@aG6!8z-V^Jr2%j467^PiY{N7Z=2HLMX~(H)4^ z9ee;S*4~ruz?0EKcuUm@Tezr)&$^%WeH^}-BD?@=Y>M`xe+|qAny)%+pZrz*CQIqV z?>k3lFDdr2Vn2#WH^9BtFKECme~rABy=;+vF0;&quhuBpy6MAP%DC6Tq(Ir8i2z4m zFguqqyEazZ{#$)}Jj3x3)3*Y93yf3ao3erCt-)Xndp&UWW3YF$4I$824b`MlcNff| z1b&-ONJ~PnI_*#xi=jJkiZi$wCzO0=rx}MD6c!5DM8L4U7s&LqcToR5W2p-yNJ^ z98u6PA6b#q?z>%`+%Nugtj^#2*QgEIm3#%M6wF2spv?f8TNUx4Qk=!j7;jQ*EbL&7 zsBu$5dju9Fje5$Ap%x#`x&unqVC*XQ3+j`~5JR|gFH#$4Vc(XuQmkm|;`m)0QPvy| z=(QP;7x@5_f*ZSL1>1QKbxhWX#sDHD?jvJCi13}y?xC@!i6EyiPk!GD&IOt3b`+wL zf-DE8MyEKi5mEZ=xS=zK86=%e^wxlrY3zY%nBKvaZADZOZ#X?L##(DWeX4yk^oq6| z;p?5nXV^2hF*5rL4Vk@XRt3;JTM0WyJ@CfQAAX+w^7A+%<#ZifS#Q9aB&F^`bvDc{ zR106H^uoSVNEGzdZ;D9;O^dUr#h?xw!V^7&=!m0~dyo%DyI(vuHx_8mm#S*RC0tHi zH6S{tv&q#gzgdZt1?G@|-7<+3upR?Ac=_|sV-&D&WM`Ct0m4n_94ueqC{5%=${sNw zQ+Lyvcv|q&RufWYeAj`X#(^b|1-B`ne+RMw9`Rr~v!Pev=|uo(z5wCpRSW>h0-U$9 zxPg?C4hJt_EB19~sUhN-WG}qKu-u4ytO;MV8=S!Zo-1kK{MT1QmeNU%K0$9a><=^yiw%|D4{SpKInz-#-8B&k3>m1X!k? zk;tlvpfV_&&6m!EjaI|%^g$ygl#S6>94<8Ybt5~Spu+_ibb!}|jW^!Q$2tO!o-(B; zvR7ECk6YvC1_}fqq(0TjFfBFM506X5Qb7~OU_zZ-wQ3O8tPIidO?YoG6vS~NtWFYa z)r=9VsLs@gDSPD8r&6Ep{NvFl6(v2-W_~j?Cbic8l z(|;op>hR!o0nq2S`#A(Czor*%+}zRduZhrWt-zN!O$!ea{JH2b0j~%F+mJ*UO(s*% zkuxd|PcOLDut)LaHP!-)#b_CYpd{09Q~x*n`^*=H1!vIM8Bi`>O5oBL3h|QgTMx5- z|KY(}i&~4;N8Y8>%K4*>n@@Hl4)0mAJ{}N7&UGdO1F6g45gGa6H0!Z1pK}@u+u7A) zWAiLEFnA1+ZSVdz-Q;&*ev718K!XSRef}8EXqkTDSqjk!Gpa|l=2;%$K59GGQF1{x!lE9i78m?qQU#Wzk`Tn|UBF{jZOD zcYHd)BR8yjgW?5{K_KdWn)kpwc+{I?Sh;a=hm?LQJsp;B`hG5kRVAh(qsv)y7?tTujg z2?6nxgaGKU9mRskfF?aIxdc^^2ArSEcQ zw=MZcEhybvn#+YpUYB}y_6ztNV+W4b(sg(!2DMrc^Fb?NZC&y_Ui^vHdls&Daz__K zUt-GGYMRI~6?UR&inCY%14)sCObi%ChBReh382S!ECaA5b%f+khEC6z+ zSM~2u5a4vi6ABK)TwQ`|ReOVZaj;Mdt!SE^;Ef_|qF00X)ouK0*4Rn!96VO$WQV*P zwlNOcNGynX9w3=masWRE1Nb5mVi{6f-xvgGk0q!bA)!@WJJu+FQfW6uqZAYFYgF`j zGZmdSQtBTZ=|gCzx_!{o!7~|nP~uQ&n^t1*YlPqjyA_bPidgO0xZ1q1!0wqra6zWu z<+BIEN~lhQ=SI-gE<<@<*NDH|%#Db(j`F*%5rnyxJk>|koV1p~Vtu^`JJ1Eej=MCV zC4^{Tu%O@yO{FC9*%G2N7)p-uLcowwymv8bmi7lcI=R5?)@#|Md@jD3fFZY&9cfAFOXvlIK>+4IvfcY7@vcVHUK*-^_`zyEw z^j)Y5=ruD!7XdtoCU^%xOvaI3U>X~DfXrG(_icy;W3ohRamQc+&NF2-Q7CI8yS$!L zG(4@x><`Q7C`Ut_yr>n;yODInyCrE^okSKg5Tu3oRaX5UzEPPlHCmhsdbQ(RD=10_TDt% z1D5mPU)E#Ym3w`1b`VxRIX*q|JjGqIV6R-A&vnY_+zJ=V`E)v&RfUd($7!ELcZaXe z-oHFK3TLoX=m6d1cG%6Mn%|i|qKUZ^gkI^&rp?7d^S9xHDytS{VzPswQZUJO|Sz zkF25H1%rVH5e%&@EG}@!Z0fk-VIwx+md;3Nv(MTrRys-=73LoCyLM<#JbpDDb4yrz zYnN)b&ieK`pYP-*K&CK%6}2x>V8qJjd(4piIrs?z4%d=1nivju#N9 zu0^k4s$Cs^w8_GZxIk`Z>E*!pZn%^M(sdE60dB;e01aX&fG@iD!Oz0G!_~d=UFz-+ zJSY|(6tTcoe3GO=Y;7;1K)$?tu>fTLBH5=mq$jX0Uz2PI!V_S&7@bBO!BNv`;Ud)~ zvW?<7L^p(vg~0tDh*u!e$+{wH8cN80!|oOEwo8y5`ey0f<|B7OAWy}0Z9GwpkRRg7 zUPMKC4wo^7C2>}CQu5KpFpJxBMZEh`U6Blxx3g7fz>97d7FWMjG2m)iCR2a}f<|d> zKD{}*MCsUVD?HrvFiYdx4T4ADuK_IO3UQ4ss73f$ag#=~Ja?#&8J?u;JN#Y{^W6ygNK<@*hkK|qwoVFg(~b7F!q zhAn9;s2XI6&P%l7W=7{2_DHRjBEIUDOU?cti7%;#)~iBU=hLUDRgG&fT4~7|J~j2Q z8t)fY32PwP^^h7T53ZrfxQFziX}pCsuoi>(y1n^1z~i-3kVXZ>;KOR1EUpsNAi8vk z8d&RgBc{}*@x-DUmS8hv(KM!sJU5G{337Eqq*lLpr442DfEq*}J*1EK3# z{A*&{v$!r4>x081mC@o0_#DP~frd~#F%9FqV2B{f$N@7^kctj~RfT?0ctRKh-;5s18)8EKW6qLde=Hq))BcGw} z(OxVY*(-jppc1;Vx{9UMv=ys3FQHU`!8G(pVXI0QMjX0IA1*LSbD^m+TsN$-O8~Xy z$x5~|Avl#*1kC^@P7YokopfFu9iAMVAH52VKui+06*{yKyhfet-bgJ%-#U!L{8ri- zk2Mc>leYYkqbc~^zdk$v@!&k_9UiR*V*NvRwr{-&D=GW=r3V!V(P@aig!PwkfdK2T zayl8K%Y&gS4oDO+8AwCg0`Qv7s}0F8EKCF424P*NLOr%g-P{D3M@v&kE`gt&jUeN7 zk;iBid4NHNNRXaL;F2s6YAXt`s@v9rM>Af6Q5!1UmqR4f@_n#4y*`uCO&=Xll-Tg zcNNZvE_Z9x^XlleYC8h$I@pqU~6dJKHbQUeA#`c(bauTQI}TnjRk10pVUF z8j8O4Pz2i(@c>libc+yZSrv0sJS}=~c9!Zt5h=-+YBL~-U0_UbO7`kbAa7vyNkH2M zc5NmATlP&ETvC-0@OwLM%Ktp3%$O`guJ-;yM-wC24X$-EuA*-q%Ch%3vb3BG)C40Y z7@u9W!8`6Y2S&o$v!@ZE;Y%l_TZwR z+K@QV8fhi%s1uQU;;=1#_^YsTvk{_y2?eI!6YYvi;a>W8PootX0s|087eE~Xwjh&< zSe=^G_tDwqg+$fpZlOr0^TR>s;QY-+r?VTC<6Q;r0iQ*yR_G9})vNIwh#S%6Cf(+u znSYiiD;@&#=)=&>`=fhBbB%k|9F_Iz>?(K$_=B{;p>sgJJPSJg&4pz3PVr{YlE<5v zhk!-Xb;8B0;ibJ?l#0}nv767HM>tW^l@}0AQj_WgD-y}3{&AL?a9$hhuNqOzxW|%S zp5B$NR8RF4*Q}ryPJE=y8$$Y|EA2o>F;C#k~Exz8ixt2X>UDuvoa+imuX))D#AepK$h zL0^n3sk5_y*0$GEY(LqL=T#50TJQvXhq&a&+BSWSGQETw;l%(>u%Pm@+!h9d;90WU zCLJ%uT8x2&S`Wg^qA|pl;%vRLWd|Cl$(;)*Xc(k)g(pBgh1~jwA*THF$+m(*_(P-k zUr4H}P6H&>EqEwjI{`7l1+%JxsTC}xE(fJB%Y~r-KtIZw-DNwr~3!i%^1 zn%nP+U=^*O#gn279n^^G%5M<+FEN>fN6F0 zz}s=R6MZP$?WhybFwCRx!3Q1M!p~v8@ch;k(ADE%M~1}HS$=hsledU>5e7)5NVFeWsjCNb~C zYF*3I$<#Dn=^UxI!^ym~<(VjgF9B`?I4uJY;Uhk_G6xrLJJ>@k9Fm+{Vdr2}EdKZl z+E4d3Y^$t3c97tW<6&qz7y_6~1~^?(!9{MdeuL2D)a;aOj`=!5XWR->t`fiqE9LG znE(KI0?7bE0UZD-j7B^R+FO#c3EUzwWFy6oZGqSb{@l;DzJ{VM$j)|f<+H4d9@ zCNhgy&l;`?+rLNnix;CUXf-09$@m&6zOD-~x67=W&5_w9S;v@s3wy?-HV2u;)o_eK z|CxBuN3mAAt-~UzrVV=KC|BR5=(FeO0=QG#KnV8Q*|?2nwtem0$25jEt?$<6_8)#x z6!))f>lSUkZP7=1>4);yIhASDeclgG)&$U%gp^zMWtMLJx($KFe3^zXqXcyW`Z zAf0z#nF)(Ye9;A=MO9If^UNGv6y^nLh|)hzo)JsAVDy^b+7aJ&PLKY|l6Wo%Xb^=< zzzpNY&z~4IzB&{aIky=WZ@}u7XBB2~yyUR&FXC+AS&(NG9vv7V?{^&Q3Xc%=eMM~1 zB)Esiw&UYjo4UKGK(d5l$4Dw-9w|HlWDbpzZn|*z3TgH*&$^8^?|!A@V4&^9uL|!% zMr(zgS$^yEg}3%A=IG>;t{ZrOe_^H($N!KA<0ca;0Z$dz52?>|kQVF8F6h#)0 zD2aAyMR8?1<^8zIKgpB|Jepc*n5As!h%ROJ^UCYvlcUpvw?{v(fVk&{`MIA82bKtP z1*~LVH8BG+I~HwglZ>+e>hR~``;(q)y*lXebJaej z#PmZ~aV0o0s9z#j&>2_Jd_e+rToRj2XB#L>4e3wtA}}xDI|!lh^?o9#99{@MEDE@; zxPj5os;Pez&#* zeLPXyiopVmr`UC2(QUWr<#YY6K`oKat`Sa5(aA=25AHCM2+BN06!lHHgID|%qbfQf z6qoJL9G5}BOcNO2;d-t_!Mj}E#zn3_grp|f%C)-Mi`mBYiUfSxhjcUE($AoLDM7%MA7b-l+W5Boc z31G-*tL+UV1Zne_{C1c&4}c#_%S$m>bVr#$K8(Okv;EHCM3X(UymmO@da(tL)dDAfc6YQ;3XMYSP|J2WQPy=h{a zSJ!1km^k^P877r`YF?N3rT4|}6*LoM%##fjx*x0mJbfz0vS+e)Xh(($XhRx~yz}rW z^Vb+le;5kU+md_FS_$WhdJ<_oLi;xFp>SNFjueWk=7g<0lgOn1_e{E{?o3)C8Vh8F zIuvvafc93T1sg;L_E>gj`FoOjtiLF?;+qn?LMZNNRZ7nvnSm}{C`zmuycfa2o~$ zlMWUTg{<=m#?dXKd;Sy>w;rC5Rex*>;)4-T+$0wJjUXB2TQAREXTR~EVc?0y;UwjN zclA*qD5RYq<&;qa*rZw$gw&|2UoAA{ZAr~UZA86m63cYDShQyFNYWZ85Ps*gt2z1s zp!teAgx{2^A25&WWq;0A#w&_*Us(w{&{A88?9>TJ(?=N|bDY1{bhJLm5eFvdSouQ$ z5NJ3fBQnW69G12z+6T9?zZt}Ui|(h+5)$8962!d*0tB`)Nq(dQJ;Adk^g>do0EWN@ z3Bv>ja0JmJ7ms@{8n-w|3_xI`{#&z=ul-Q6iB3MOEADeuv54uGwP`8*%^SoWO11d6 zz3h2-pwf%MkLH&zhH7EaV)U}8H8b=;bPJlHnvN1{gAQei)N^hG%#IqoZ$M4610pmG zFDoTs3VJ1-o?SdMi5eu9+8PU`c0c^Zf1>(dMb(!>9)2l!!Z6se?I$RtA`VnYIaZJG zG5qLa=ydiNCj^vdR1L5=5JE%v?_JmI{7pA2&+zq-yijY|H4@ z9;{bO=+r`enp-15k7h42yIu)gjB%6D4aVozBA(c~eSWR~l4^{>ETMKa)bGz}R5k%mY>|fyCc!H>Ycr}J_(uf#GBXvU@W@T?SoL1$AK8fhq zYs!V&1i1;dw^wgERp<3O2P-h|kS3+iPnxk+#40yn0K=xkv$t;*dvYN}EDtSoEI9!C z(jS6W6EY5b9s4(liW~8`(MvFI!3EHHge!Jx%?lA`yV&XWXTxk{8lY9(sqZB30(ag&|Eh9**!3Hg?hy}U^tg8Ch8mxE5X zzVoTpzy+0f#u1B39*~I(PIj${b!~ErD8{?XB^BJ`Qm#)aZwZ#gi~^gD9sSpq{cGF) z^*qQoKyUwGzyG`a>s$NR9~-fv7vwS(#T}@wA)>~lSLGuG=2ycik|rZS0rph5wIS*h zBul%xG^fK-^`}-KX=AABLImUQAj(v#*JRIiy)Qe02aTe3B#V+6o6!oYW-n8bI?l1r z67BFOVTZ->jAJSio^-BSGq}2??14Cx6COihVw!Q`6dH`_$?!c1^z(ckYxiDv8O4Lj@ z*-ZB#%?y&w3?9-4fF(9!=&3Z!+y4OXC{=F;E zX7<}ZWZhw9`4<*$_T?%0E^K4*F5vX0`uBxmNUw*3s+Ikw==cs;-kanw-En7x-Mt;dun9nIVC`u`8?>Q6 z;;_Qd+my}5s6A~~8^*a%!%fesfsejR4#l)dgIV6|D99+)n>NU;VV&Am#z57774}Tc zP0#ulqxHei%6%8hThCAf`mZE+DaIYk>*%y==B!psxDkBPq7QxdcR{_V7u7|g+3;8# zQqPYjdDX!=;@aqaV6g|V=B8JZnR0*P*`og%u~5H;nYMyaTR4F6e#_WuHh^9at}8&w zrqeF(^kpNW?jO=C%euf5bh`K?Bf~Fkn50=G3@28~iaUVA!bDs7l|?-8HIfFZXiDyN{Mn?T^cD;QUI zA(Q?q6tjmzjqc*|{P^^Z&3)oU7Mb64s>uW|4F9Ir!XJI?z!(e4tRzH(kt{I)qtEtu zX;9n%xU{94=5@ir^+=r&wFO;Nm2I}f3R7O;9aU&j4RrRxKet=05Lmh(Dcaf;1b3%r zmq$B*Hmk`e6L&^OcgNs^D1y2!KII0WK|JY&B*cZCjI-m5v%^3ADH{#Dz0w5hG%XD) zjAnR;j-3NsVO1n-MWN{~Ic*4LD=>zB(Hq{Vv!#aARR|yS*l>CxfrYVhp%^sTH?2BK`Ui`AR ztv&Oi!K8fQz*D!wW@3_4kmSp3kph-X?A>|#j6!@9P0p8O+Dw_~~rh#mc$+OnMO_>S~E}EE6 z)ft}Ee-(E)j^>vbf)IL26VA0~>FGnxQtVc^E>?%JtP6(ssb;0Yy+ClKJ9!_$b>T{B zqA^@Brvr6oK$BzgA#m$v{#sLK45Wz>x%Hr#N$m#a;o)UF*0vz|IJ+vw6zqqk8%=o) z616b}s|l@O8|fQ8QL~RGbjU2V6ce@eiyGP=w*T~pKYjbh?LU3H0h4E+L+ebaJ?g7T zHT#xb0}l^#sKoG~^C{4@F<{cAD&xPJCZ6n{!d6aloHNL@#-3$5nSi<>W%=2ZlTymxhW?M63c$T>4 zLiV#$dtn9PC+$x&C9yI$d0@`{D$|KET;!Q!SbH$}XT1!Kd1 z>YZn=FO)+Jns%ABIsX5N+sxfiIH*y7xlw)DU4>mO?CC52uc&7$Y{sh<|53cfn31~Z z+}@ka$BNmQ<9}J6S};%2dHZ5AOn|3^(85VkHsO###YkQZ56D`-3&bFN)7*3e>jgZ@ zF}o}aLzt^INVHH=3#Q4vVoEZuE@%?fP@iSr5d$aQ{I#+aNx`<945gkGUs85b&u*vT zvyO>g#O^M`>iP(2ycL@(7-NX88g~`#Tfe9vqDYGVHDo7B*}($<3=x3_ofV@Yj|Ir* z1VIeOf}N6Z^x8G( zAJN!VmHqwf+vllBUJT(-j=NY=S&I?`yFLS#uiRcPuU+yMZW4`>Z%xiaLspU?B zza5&i%D8rm8%!*5{emucK?x^Mm~&_a9zzGxF!Q00+#_5=rA8xH3^n`Kq5{pex0}5! zj5`j2R<`l4?I4pcOKI8LdSEKZcSlEmIc)aY*));MGOA&XfqUDvd3=BN=DJLt;Ge_Q zAzG>?4XCSOw)v5LY%SNva!;6O6OA>r^#z90C2I@kpk{OW46AvibFm1~qPZRWR+O8l z!azLQ0*Jtga(G~FLKA}B+KfX$Mok2ZaoNF`+;e8xrLcx-03Gyx)BZ8c9yYY)CVRB3 z!8~ce$j|#Z@PFR=Ke@@Fce1Ucp&gF<#vAyVHDH78jC6vvAyP*QD-INKf?1--8?TGO zC`0083YgZdh$<`l)am6?>k^m=>m(q>q#HV&No&oXMDGzs(-BM2>tGUSOhrPcZWTqm zxnPDG1&h7hM4(FzKboP45dsXK;^rBn{O-uENVHwzf*Uobm zU2oAvG0${#gFG_4fX8#pO~q|X2K_^6eEH+q#rFs2?=F_SIckB_b68Cwj?6^7&d;9(e``3^5 zufKX_f3olY%O6~)!QGiLyKZNYm&{WI)5$X&lgPXkeKKjYxc7>8@@1i;XWrwr&MoF3M(=kHXJU5M#h()2(o2AY++bn;=V>T^cmd zT*Z_=lzRC(un0=~y;eH)cNwEN+|Vi!yE0)KS8$Hj`0(D7=z{K^;sVg}Df);Lu`5;_9-Fcd`YSD5UKjP3}PG z3IG%O#Dm)vW)W&))C5Z5=M~XfdUbqXWKr54+Xi}WnI=%UBgNL-syBC=h6Jui8*vl^ zQ`?b-8=dkc2QE45iKB=|@9$qzH@N|!Ur=s}zk*=FURq|TuAs$>>JmmAX`C>!5)>=b z4`EcX%HSF@-Nhdb{v!?w?ctOFM3`8|q4fnoms~Lx%ArBVBz1ABwKOrdQ?=v59Ry{< zk~E$S?_#L{FhE0<7(@t=OS4PZ*8?I=JS4&d{rb+n|C4%e`>$UH;I2{FffoqMEK!-< z#srd6W74C3j;7ZNw!x)lGRr`U8$=%i50l|1b)$6e6}@;geP{het&g9B=CtxK@X251 z+}1+i6B}&+KoC%c{<9}|2)U=JLH8+x-1SDxjhW&VvumrgS)2QN%Km=WXtji!Cb+>q z^BwxJ5Z!ShY!B==tZ$HQMTBbSj*E+JB38lGr3-mqH5v5o-Rb+cHArg1=Y369oBpJ7 zd0>p+-LOJq<$P35wD>F+Y+aIEvW*)N(tit2y0{)2;VEY)Ty+%TJ%`X@3)BTz@Cj9l zcHLOesgI$4G})rt8pu7p06S}*aibxDR&hi)&~C;OVH2ctHjm@er&ALdY1)RqAj4%HoJeN|o^W&!t%(9GQec3l zHXrX6>I{t4$t~S6YAr{Tc@q#qJ2@D3M2GRm7v?jV6@^)w2sUxm>5dk!OWK&tkB2iA{s21{%^}q|F;KC z|Lpwto4wGMIQie|CeJ4QbooigZZ|a}Jw84B9k=||l3V`tfm^=5{On`j+L|H1I{F=F zfARk1gV0x9W9R2*KQ6bF>k9!$+b}ksG};;cv#0*SpFN=(}AxQ{gPfD2%WEve^?Hno-KVg_2!^LU+2Fr{atB#Y;()| z^}+k~i}&jv-mlNzueSGV*ZZ~O{ra=_>wmmo|DVPVj2$zu&UH%Fyex|w#iRwG_5V=O z{;=}QX=u5aSk7Dix;WRGb()W7MQ?I7R-8|tF*6V}Z*%)o5Hv3e+MKXlaApc9kAVET zIuT=&H2G*xMW@UdP?0U{UNQxZjU}zEr9MB{nsy^Q%*U828ItI#B7@oF2F5^EPcQ># z@yP=?dvT*Zb6a%|Y-Mv0T+VN|L2I^@j|(c74%|FMf?m?3Z8g$cNKPAmsB#oz!~|j@ zGeAs#3W+=1Zo9vtqwAX_^B{O|Hq9m!kmU$1ZMC79T5=YV4%Ib0VjVYsuFN8;COX(+ zleD$tqEuBBPAhecz%|==n^MO^r`$q%4N5}dmJTkm`Z1nVC|;*=d->*n$Vc-c>)Ggk zq$dt!XGWMtOsqWvg6PY1>m+r8$DW0OcE;ucV+ih&CqZ0NF=Ci(w*&ivg9aH$AP`!r z|I`?SalnH?)$eaG%hPrfwj>Vef+DY^f)H0Sp(rXrJE3J5<@&x5JJ@V-?8OU@R#qy= zsBcSOLE3 z*zT~aO70}$!mSIbOAZ%w@I~ik@o@lu=7GWsUt@|2NLmFU0=mTjGce3Z?+AzyPnPdi|vMqRReh?hm}i= zR6>H=VRfHsU^<(q>NjG_0khgVEH$V+!BXLVT5MEdUMT(~mp`R6#RrZo*yVuFCw2uw z^J@0Nyr;C{d$2NfA;}OtO1z08=iTr@dSQxL)NsKOL=y`U4s$&UD#)LOanGXep=+Q| z04W)WS#m6rg*bm~AbQnq&5*?}3nzkZU;?^_NB0>=yfIIG-UIX4+iPp#^<_te#6rSH zl|MD{=gcFa-mNr(H&0?c<9o4gg>8UPt@JGN8x!lcTM&P7cU@>2H#HQ4QQ@KkrMt=g znSd^hTaoOg>3U=@{9g!)5l?QJyUeWTqB|^N+?TivnJ2p=ge%Tc#se`9ADTe= zZi|sBsSa5Oj#q~conh%LkJnaJbNol+J{%nH$bDaA&rCCx$|+ySJdXe&6f!v|x4HO{0Jvcl+L#K&k%=5d#L@5W0 zKrYpD_eepZ`308CiD5U0djjTF-5wQ)l*`E|;vaoksTp)6QsqyT5U276h||C*cEOdA zCh4>btG>apG%m-@+(Zh{sd_~p4)c(?F6Grox*o$LU2r!5^x-Wh6SGcay@!OKTnZO+ zBoo|e@}9SSGg{wIWI4m4@VRyf@Pt#scC+<;^zW9d$%J}BIvrQ2b4o|R9FBXF83flQ za?GmsB$-ovI#=^pcL&Pt3L%zQ6w05+i71V|Ala&Uq`2mB#7^=fXe#EL-1-^)DNRLF z&{BM7ctVt5nG$L?Xs|AOa@{vn0Z1TI<{PF->YW=g5_ zmm%Gn1R>s7N~9!l-cDnhPz%%?PTx2 zP+v9TT0$6Z;_$0BvmiV@McWU@bHTD3p2sBFlw%6J(^4NvxGkAB*FjQzVJWmHMeSdJ z^ajOUJe;ope%sxI)mitcSAxAx=m<`k{oQ0=!iJP{v8oMRRh)!n4L&S%q7=K}PNEsQwsG72^ql~y$L7Rc$qxU9o$ zT-NAc%Do=&c&O9h?deQ}(9m={A(!Ie0!YFvBAWEwhL|`3Tiy!)NP*o>NE#H=m5Wj`)&q=ce;tWP~!1`aSier z-zwVXVB>c)c>RLy+-|}=XDV!!Pmj5gM+y--_yM$A7@0DlL!MP#a@lOyH`-{OD$!L` z2j8+Tyg7Xn1dtcQsj-1!br-1WZOM?%6+k``*3=1d5O$?2Fgh#J2AGGOa}~A#WIQ(c zcOVR|h6&Y;4ZIl_Dv32O8fm_os`&{lwE z?*P4Rg`Vnu$;tkuN~*Ep!6^4IPkWX!BV1$Wr)Dblrdn#d;PEJcwBQjN2OrtpIC3F> z&@#Tpas-~`%p!1bLck+&WG)29W)1t#pCv3K;1ONRr0$>C@CzW-((xCT8w$!|k#Xxx z^Aae_`YvUOZvB@akPD0AqW&5cWA`Ry{)nx30bKy#Zzg?+{TC&@UT$=?M~Xux9nJ;* zv{b={UbYFcQ<4mI$WR+Gzzc~oOw>-mkPl#<0JNCm*VWxOROeLZ`=}9HJW*qZU`&Yo zSN8Y!R+3m3o?7ok^DwQg-~5Xg4{1L1GZmWGKmzw~ZT0}YN}8+(<&7c{y7wTyO!~{4 zN9TC~-lzk6C&b1w&vF<9*JbV3#fR{r2N3f$eb_{My%LoeaOi)9gn|0amJot1e3rmK zzd|C;=jk#v=N&ir*ALr*eg$jRojh+T(&laUrZ!{>KT7M_|Z`dec3KfNS12IN&NXa>hBy;?!Vda+D z5`%hC4w#qaq&GxanHCBDc|q5X!A%r!Os`ZxxVaMIJTLg!LnfRO{xTALvqp9R{|cO{ zDF2a-B|NPJA8ueY=ssE7!CI3&-#-bU#v12AvyZUP^NsVMksABFzyXa5Mnx+-$&@aA z_66Zx!s0FxwQ`fY(h25VLtBx^&zIn}VMh|uI$;Pm`jZiaki4ygI8{IZd6H2V(aMB2 zlSFuKr1qPWYfdd-IXe^-I=R&h8rAca(v;hqMvGEVU<)Hhf6wcDIxQefn-NBULK}^T zja#C5(2PV|PW0ylFdA$J^KlPBwg(UvCaQ4V)_RF85ND<2h(Rkrs*}JST~?Y^&_oF; zCLBv_dj#w^iR}3~Y->}bYrz=^TeRLWKHygZ2Se#5^%)9eRilk*T1tgXT6hS;)}e`6 zaVuEwv?b%0)tdlg3pg+qmr3`5I!g{1ts$6o zqJhD)={^!I2A)rk3d0{^u*t_|{q2Y^*TOFxGTIKRnFZ64bE_;e!tphdvauZ+56Yhy zWLg|SCLF6FhJa&P>!!usxdA4@FQBdOxtsjHTWA}t1ZBIN6$#FVVVcsoeAE{7l+m?S zmbW7ePkM+yJVH0V*gT_BMWN{5^D*dh;`CCcMf~2O@10@{GKeV2RJcY|M0bkYrgEHsr$%+3I!kzE;&qR;P!29H@Lixd8|$WZ5X24lHg|_F#=FC( zPu*4R+UadndH2Kc7t=l-5eEIV=)TgOC^WND#AA}b?_EA6vTCX$RQ&2C?9;3)QyZ)S zMY{GY>%GGEu(?~c`@QDj<^5FMCzSsQno+n^b5v`$J>LGU7A6Bk-&PaMAa_d%k)CGF zA1*Er4*%lP1-R8PR#_yhfcyo<{>zD2MgWM@c}B-T^)LbZ6JTwTxPTi1_?oL?3_M!V z-^dO|rPU@8-#aSuTUf>)E<6A6_ML+7`#V%+Yop%DSexBXjpiH2ZrWhci|^3enz9P_ zjJmfs>D&IndWIcue=+!R1yUZquJ6y(*;WJl;o#)$!Np&EmgW|agZg-=M*Z7w@Ow4; zpRJaDtLEa#Wac?}p z03P!3WDLVGo2C8)ndoTJ%|{)FXVKcNd8=q!HB_*L{tebf9kR>gLr3kX%GwlEO%9GX z7FK_=&oj2Wx|N@_!yRNs13k_RM+BTOL`_y}VJ6A48yL4)m<)r5TzybDwHWsbe-o$) z2o$e~G;~kS`tzHcduB$*xex@OMO*aHo$%n#0pOgOp%Vo9z-L#<=hWy>=>1|aMU|y> zqjl2hcXLI5-(|Gi`6ya8T9w9a1JM&KL1W$sLD|&qXn28LLvT|_J3{24l#M`w#RF;H za#pMiSTNjPb;sT1vpyRwH-B6naF70ad31j2lj&t0=;{K9tf&bIfIXYX@}Ifj|L0fQ zn82E~ZOaQIuW)$AMf--|yfGWvXGZ5~)K) zQp0WxjYJ&GvSnXSt`@p=SuNAsEa4vlN3*%NGL~V7C)&$fe=qNE1R*oS+tPuw`(rlZ z_d+@b_geBzq~6juaLpC00m{2}Z8vnQM@?hjj=C@oqA(4cr2Uqn-ka8My_SKV^#o5e z*y_e)4N!k+3d;J*=^y6x`WAn`4oYaMZ+n3qzinO^l9tEZ`+cZbPI;|ilR!1G5%lN& zH1&|6sJ$al^9!6L5}Udg99A1SwVQnQ5opuARFo=7#EQbwUQk|$1o zCV3yS6BPN*|w&X_%_F`$?fc02b6IAP54NK-2oX$o|r2nes z0%TDhTlN#xcPr^Lhj+q2&9iFiJ00!3%nxef<>gQBj#?l_hxSg+PTwR9z|7bT%^wd= zCwYL6ngD1(m%r^s^s$PtD~NeU6JS)D@Sk;}yws4^8KirS-)>k$r6(X3(p2-w+2O$n zp=MYlv1pHQyXs%~3>()3yjtG6@OPJohn>rV^EXEdQ$GLhTWQBXefKSSn+=A&9cv2; zUMYjA1B8pqO$-ErXE5PzO7_?1M{gAOkd((xnwy{cf9m&JD4iIT)inF2tUwVdwEDRw z@SgFILs}gFsdI%DVQ7!RP-3`d)t~NVe~@LfwD5>A%;Lw>2;Zc)Q6srpPbNS+fTpYK zywYb=5yc9RTcl0ROlnRqDqMqeDdHeZuhbhsC=O_>3%LV9AUDcgCZ&8cj)e(O*r`9W1w@(5?9I*CQWbXj9Kirk$-h|M(0A=2Bdx7{GUn*xEG z30Q563r3-uYiQ%EY%M#6s|eH{sC5VO7q0MG56>K2-ujhd(dlCEX&SG$-OAVv?8WKJjzR$!yR-QIg)VUXMfqX&i`p{mz+ZdlC%~rTy+GQJ_kCu_soiV} znRoEg&w^W@_rC1yZ=N(2AQm6jXQ;$*tT0X?o}A`4W-%DBuWZ|PeeggEO@xughTD6j zQ3yzMNq_V8&bMm!+mLEv&&*5dF`y7-8DD~``(NB&t)Z`ktgZe|r*_lSHHlY!eb0E} z7IIV!s!Z#soYNlcorlqzKOCL^WI8#1`|j-g^5FCm6}XrU4|Umuv#SdJoTzJ}oP#qS zTpSoWXWXbv3*~e;8reaVHo*H;G44#J!)B|+cX-jxEFd|FUU=b{QlRrBpa?|Ln7R{~ zkYF3kMP<ltpiXfx7jQHdTj~Qt)UEGtliX9x0DvW{2n-YFPd$)SB0$05!V{3e7q$ zZc!$Fqxd53KgS}aa6Zp%<`l#9A=kK`jawes5OQ}V;(~DVp3q{Z|v(3=Tc1q@#ZddFFVc-_GW1Uq1=Gn~vz!@v!QJto%pD;fuo z#YFg$edC0)!E{-cfpDSZYOERXD`f;B;ov#Xz=a$78=4k)Z+f1z2Oi)O9UH*c0#x{n z48t8GfOz{}f%VHHh$unyPRq{p3TjLSzF5I1n)b5)@z@pBNi`exKHl#*UV$3amNN?F zfIZ>Wg!IH}mFY8Aay2DA7NgY_&E;@{Q#7$^F(C*;>>$n0NjJ`IsU^}ZlLEEZ$8S2o zIlVmm{^;;8w05KqG~-1om{fIkrSP4fZUN*Xssdv_oh)n1sA~MxguOtz)h;PuF20CB zaHA&-I)lRybQJ7&T#hnnG2hW_p59j>@{&QUzDtjv^KbxcA}#gvT6*V4PYd8JY&c z&8hh%G9l^rqndg}e%lKnB_5R)B#2=v;OLu?VE}tPksBKtCqClT8r-_a{Oa#V&#UkbvpaI(>ow{Z@hqx!Dwggm^ zOi2+Skc_>RDA;xeY`Nky+F5s4b*7V&{vaVG6ICiCPAlLm`RE_!rB5O`O*11l(_%}y z>puJvA3PI52T#fIB?cAZr$i6TAu(NHf1fn5=kE{If4)C{eF^fW%}>vn=E}@Ps@x1} zXHTt-(B!j@vI0 z;$rj-nvVh6QS^Y?Hg$Ub4iu(!W{A9mRL#S8?}4G1=cCcRIq!hRaYd|&M`;3a5ZVF1 zr;rsxpc(eC9mSh~8JfBSuB1@pk#u*}t$aert4#^iS%QW;+QNXW-8%Z?Q^FUhwMmG7 z)0Owcbv8>2t73B=-xtx0v~ejlY;P3an`cN7ECeMF-VZYlIO8%*%Iw*fv5r3sf3a7m zZ)|3}iR=};1^0)^?H2%5gbs4-UetgeDCGTuOl=u|jEUsWX=2Y5iRdOvn6>*6$1l9>ch9&xZe2lc7yh+gt1B)-NSFQ&rq36p+t`vZH6fAwA-XU}MFR zar-){+-Stk{d|=0-LwTj;jaog-#3_PvTe<*Y7KR|VKODmLb*ofagR||q5#wc6xMsb zO&TXH7)p(bdE-Yg@1@vL`)I$p;JmdSvYB{NYWC+x8{GOXC+-GmO)!o|XH7$(rg}7d z5D1F!YDL*$K7jEz0T@R`DFPup#b7Y(4b{EcLg!EtyHS8D)e4!-TKQ6{5w1VhA-1bY zrEhQBLo%t66G)|e!wnRZ-;Nl$&^*fk8(2`(03z6ZY&;4Ufy*BE6rBx(irE*3;tz?>n#P56$o1#ZUCe^Mb3ry5Pb!y;=kb4ZzZ}|e?Fa#PV$CiJ zqIDdlPzWtqX7oToNM_cu^~4NA?m&t2qf1#eVH-J7MdDUw+unsI#Uh}!-cBy|?Q|k8 zH29IthRaQr*?@;j$*`_OOHiyIiG31vL6}UcErlWgY+0p1f&87!ziOkjDykj_6ZJcrEXN8xRdRK^jDh*LnHVu zh7bu9hc}5OtGSLWbtJx%a0R$8S!LUZq+jL}N+`py{JVVI>zJ5|n=s z#|hUgfI(t~!>&RjjT$F3Px0!=LZOqI(Mka@JXed@>gVv=KXPtEfowd2$pmMEsmT-STp0dJ65?u2oEEL69}A1lq*dUk)J!ayi||GGB2@nr519UNVL{h zNE5t6Obm?HNTrjZ8BAds(fl4-d)jq3Zaiw<8xqe*PCQSn6A!2&jT6rk2+M_MAhhD7m0V)mmzyE|tA=7&*3ziQ0Fr18qul)jaH{my=xV~GYO4qYsn z@PdtI^@x@EJr*L`=Gt|LM(yi5HG}EI*3J}_B81_&;8d6PX2W`s;%css%sjZkXuLi? z4n4&=~xZ%HLGAfFM>Z@I0t2mT<~GhA9uu-`1~Uuwb3>EMBwr?E_XV zT%{TZx%5Q$yb~qM132;!B?Gn%&A)fz}-%C_!&I0CCG2YY0}Lr0gLSS*P5 zU1gvTE&v$HpH^-2fC7g7|XI(vN)|-67DB2!oFEZ3g z>}K(-*WI+&hfv6KWuX;h(@)~Y(ePtIqejuOx>iUG)E~}Bu8)f`rpa&NV$c%k7wS`b zF~*NxjTi>h7qb|Uq(}W{eZ6)~o@PmCUD9pY&?EwRu9U*kPSxbwT?KgfHW{X7or zN$hy%m5r?Y-*dHLsu?x137BM}263VaAQ8p2tmxThFPO;p9I!Q=Q4=DAo3d3*`VRNF zx?;6&{jf3?UO=Fa5ptnXPN8XDq7yn&8KdY5ealP?wb0N@=Jm<@U>Pk!aQhHi?*t;Q zhz=#(`MkaomidEEz2dU%WZ!2e*~wP+{TAN@eZ^F@{RnTu!Ab4#G7)7CPPKN+A_*PH z!XjZ=oza}9c#p+JroGoEX9t16!gJpVNp7qgDE;xB34|J{mbCTW%zKlv-rLgVdrnr0 zaP93-DEj0JSH>&H!~`bSZODBezIzXO(2A)#_8_Hh8UukAr-m_hp+fbJ93heM2vPTB z>IDjEXL&p8w$*DjrJgmhfp6del0faHLJhs^rfN%X7drMdo;7ydFAQ<>>i7qzErkX% zlf1S+yzLKJNME!YhJm_nZ8PuF&CHi=r}0fA(ZtQ9zx+tvp1n$qgtud=@9^E%z8xga zU?imRvDUucGo}YV`qFC_ zu924bZ+!n7tKP5QykBeHuczLxb+%Dy;cSe^V%!{~KcSGrvxH+$wzKa&7fpexGfTt0 zkDrI%)Eh&i2u-bTN9DI4)|e#kFgL~)%;5wl6NojyCwUJxAd=xYS7fxD*?quQW_R`e zEja7@pM_OVkN53K_V#-z*(RC5{6V&Vp{@Ql*#otjSeIaH!d$H3PKU9?+3tB8lo$a4 z*vVEn0;AYl3l)1Y7^mMR8wm&Ub}M@uEkaVaD1Kn9yN0T#m>g68SdT!=sOKU0@fbtQ z&J;m-Qz$aCk6HPeKvTaxes_VnaYobYJaRhqdW+#;GBs(u4_>`G48;FpenVH|;{D68 zhMxB%ihLfzZd2{28rI2nG~h?<9t`Oz95UzzM)v8`r$cYEL`8{?Lq@0<>LGJ&565$ma*rtmT&cjJyo_B3Uq>% zmgMLO?73)HV0qAPH{1^NkcS+phJ_nOO&E)#ova+*Oh>V{*xKfz9>t`(hPZ5Sg4OzM zFdG!ovuKNR{$Rv~?mb4c1G`i-xr$&?P;6@?@MOWnNY(<%uvIq} z)^4I%s)=+Lge7>MN;Qx=C-BH=R@oXHoG<8Fii%om1`;!=LaWbHWJ|;m09)Ad<`V zn3+lATW)63ni!(xw~(5N{k|WAOoR(Z1Xe@!l;j^eolR~bNkg6ua?)oj9E#3%iXwtg zACZM(#BG}=zSQ{Rai?WI^O#(_MlrJ+xBmUY)~~;$^^=9Ij~?2(WQW11fqpT_=cCH! z&LL!(y1;z-i7D_e#)#TjSJ=8S%2>c!dd!K}8*~*?Zfr@ehgaA96OqglzqLDXZgbvc z6!6Fsj+^F2lRLWVHxzj>?s=yhs0I>5Ll9+hHN!^e2Pt*Px_7b>^R`+Bx}A|Q1gAd)Ax&deV^|3J?}U7rIB6#r^v3Do-~3xJqpnXw0Tv5e!&kI z_&I38v~cvF0%K=|l)%{OU{^(Kac7XBq8>90hw$>`NOGis9`j___^ui8W*qI^;^41U z8#-TiGf?5g7#>=jf}m~l(|7;AIiP00E=F=22j_2FU;W#^L8T$YIQX}J1C7nr!6rV6 z8z{!T?kpcGtgXIdR`RV@U4w_;{xKetjx&e;A3%izkzMpxs2$Y)KmoKqFXvNmODg(O zI3@`hveT`OBg9a?%kN9ksV+Y4OP@7$BI?2Zs zLGVB5wKK591Gn2C2;eQ`Kfm2J&hIRCgcgq68aoC037|xQ<45;x9Y6qJvOm%0v3l_6 zkZ3}iQdCZR#rC$)J$CEiJho=dQG`iR&KSX+}~Kaztxocjg|YYrra7Ux8{}e3&vU=Ulruud=tKj zH9HA4iv}{loWt8;396FrefIZaHfg(SN6}NGVQ*NuGQy2A=q0Zdga9~oMjbEm92zBu z;{b)VIkGDfC!#4;HPlfDW?9FNB*}e4wc3q&CT^g&bw!>E(3(? zNUXE~WZ#IR6TwtN-e__K?)D<=ogAFLlG;-jUG2!v&ZSzv{U+6lm}z)wFkavpp-np_ zI}?aJGP$`y3IamoP0Kb}ENw%G5y>sq-Q%K4YL)-^TO$?bRu}km^YJScH3Rw!unS1dybL*C_^N;?N1_oglCWJX+ibw343R@ zA>Kf#e{CiQ9&9@D3S_^5M4pf(Yp%#UkHEFzZkzfN%}x;qxC@X z36IV|I*8&vvPFbTQK*W|hT%4GwW2rnB!Ee1ofsL8px6Q;Qz|@lC|C;Y%yw>F*f~Ul z>w`dW8=fxvj&W4snz`}urQL}JleV{Ib3-F7kWf)pjGMv&l5S%8fl47Xu6gF#w4G68t~BL<=?YJ4R-6TNsFVAnL$4b0&M}Cwu7EoSLAKQMwiW>9dmr zSZjd0f-+I#77GxmW`zl0ij49WX3g=$i<@(rpTgZX9AmNjR@OW?y*S25@~x20donBv z%&V%}YYvcr$^3WQQfyiu{VprhQR@T9XS+t6ql&E86j`GpYc)llsUq=xzKs|6#=p4K zLQU-%O|6cNhsRohK{Q~JdzPAg_Eevb=POJPliOl809=lmh(Ct_wA=yKXIGtp!Pb`? zQ+-0^cBG=CsO)0KNxlFVUw(8&4E$?M9$QHMx(myu{50`X`V`fTrIO)y4-3nt{moq< zI8z^^`eQ{F4~}<**+tO{sqBpBqftjkZn0T@raa3}b6F#{{>lW2rQH*UkB+x$@6&0nn$Q0E!4uTmsBUn^JGcylAY`2ijC+%`zGpyTg zt}Hhseuwd8{A?pjbQNQ7qe9r71%l&7YY(h528U5IFU~@4ecS8(ADKP`ez)%Kuqpkp zKxPVne4;xX=d=6ln{uV?W$c?wrIdX($4>yA2HX8`cKpgiKTQEvdEvyFF$X=<`EIxT z_uJ?`0e1lq!o6w6*U}EQOiY5gSq%|V9v8Cc@?v-I&BP;BR``_~q8nbStaO!sS z0UjA`&?TBU$$*3*19onbiO_byj^94@lEI}Y*GL6mn_vUfWW9yZ0rM52 zH|qojWpHTJB!Wfqw@ocla@*LlK1oQsG#X`rmF=29?8lJ(`W@CBIUr4!K{6RSRj}wR zIcu=&b9RfkfXw!wh~6s0p6uCCn3(@aEl2^o1`|{RV44D2kx>O*1NgGn2LbZd4%+_7e-PGgScQROLS69 zRd}C-9tb`w&$BSty-&bbUfR?Se}=q^Jkww7UPPN&2Vr&YYzreo>yfE-D!>qx+ zReYL4W)%!>J)Tfr4sDa&jl}vkWEe(eRmF8a5j;=AzVs)Qu|ZwsSOmg5c!C*O+Kl*# z()BqMbysk~ugRi_OK{AFzJ&Q?2Y6lf}c}hr56i#XsL#;#(}u@cvL9>w$FoMLQiBFwSn`OpZ~KNiN@P3_*drLG=8x<+ zIr@)C7jgAT0_1OM7?T8bR)mESfbjkZT^CHnT_5hWP5s2tVXA+yp_?dD0j{vYkfJ5B za0OwQJS2;ohWz!(HBzZG-AufXQEYi6q#xB(D*&%lNYd1@d&_BPmb52G7{ugZi#fJE zJZ>!`s`#-h88@`dI@0oazB5D%IAvcsxnZnO!O|#oaIJ+^>1pczdd_ZTU|1%_ggr*T-ZQpA@4WvW^n_d zb$&2{qs1erZGhX_Gu=i=X&C8@7v%@;Z9sd9qGe(>vHmlci5k^xfSR>gjTc7})t4WO zf+Bd4>vZnL%}<})dPAnr)G6>VbQ28mN_v)I*d&QD3)DF-fOk69mC(#6Ze-z0V0{5vmTEFUs1Xv68N(MVq3YdM9jLJ7M}L%J zHP_;2JEr87r)Cu(N3O+;8LzrhjP##N-$Oa4nRdc^y3~L-`FR=vEL82mW-^G1Uvwh2=ElF z^&r`3K0`(8^<-ArOa};PSfB$1@FQI(5xjMWklL-^)wr?RFoAqB{SMdi3^Ef7<$Xmz|9yMW{EViHQ!OYAc9b zWyBV%Mr;u+z3$LtC@iDh#%7}ylc^4CirW|&W@m918vrJh5*e1V0m(VbO4}x@)-V@j z3D=|A=kBoIFUA|8R^1X22|J9kTjAC#dVHY%Q2+0_Sp0@^>Z`l?Uf~oR6>9huL_H&T z)0=95L$NqW|5MnP=8d|)hf_+x(aZa~jk487DSUpfP||QTGHcQ;SgxihPbW+Cc6i{& z*Rcg$l3pm{7F#?BUaFEvTWr^t#IleHhzUH)czlcUh=x(vbzl0psmi47Oc4f}|LO`j zJYB^O5$ZkJ!_I1h&z4~8WNAxPi$QGP`_}iqVO*id1xgBT9*jZT9|$C(;j%I8_5d@c z52hhah(>WK^ImSTykpW`gQN`-?cGV@QwG<^7iWiUX2&|jP{{ zIe2uB%gs{ibIEC*Ja(RF-q&RI)eoGl*zr=cP4^s3xh`D}#_#hFlT})ntm|PlM#&5U zSWJ@-661J5F;RP+m+9-Gu z6+{cP>Ml(Mvsve|VKqE>cJdn_)!TC>;qJP01j8zczF6k<=AkY+$(^@XV zwTTn*FNte`$Ns%=ZQ_pM4F;HD?m4z+JVs~#Q5fQj8;lUeqg(v_5HD%yM3+PJJbDL) zVQkdLt@|UJiB|i8?fet4F&v0^8+_?y9VG{kPq%89h~{E;x24(D1S_Ww`VfRqq}K_h z63@Dm$p}#F;w+I?>=jKBLI!jxWu$J`{ykuwDj$wZt+a;dmmq8h6IZn^Mbw0rheBk3D@G}WkoPRB zma#otBXeAx1(njXYDqf+p&hd|HX1e}zjd678dvAy_`iC!ybNv*Y(z-)FdNy~$t(K~BB=s(l8^7RadF4q`$*IG(t}b>-_@A?+V&?7e#oT> zoKi9`U5jN(=9_C@rkw-JErWYjOYH+3xeyyab?cpN%@(-cvc%9TiuHhYW;Jb~Yz5R_ zFq%*gkM>x z?8h#y+!}5wR2&zd7&D363XQne&Kb7cUJzPfE4<`qbHrTap9Ay@Ikb{dEx9+L>0*9U zfY_inn)ekg15H9a?%`ml_@dTEhH$u^73290S>)oj0*ruH9(l2MI*{F<8jfjI_%cni zCMcNdP6w^z;^Sd`@5z6YduaNe!j8ZYyx3#=6sNiWGY3=hysnb#ZW6}dOthCAC2Qyq#D{Q*35q(5RM(pJB(EPJBFyyoqT0co zIGth05PkU^53>&^#6POCqVT5Jn^okx3Xi8a=ynfYf#5f|2{ znJyK$Q*wHN)l^qoAGZJfTb=uXH(06WSO#2=4(86xqRp3Tmy+K#e%@?2K-UG0ce^`M zQ`K1y9Gzed-27K)K*k4#HDO)i7dCM_0Rv&RsX{AO-mXYY zC{=rE8CGD=SKM(#)qw()4y`h;50ZtrK2n8CHt^HsQQQD*>T>mwvW*)+$-r_gDEd3D zuRwCS+P=2NR0pjFeZME> z6txiT`%=&ntaUU$$B5|m833eK%v<0@A#b#*6Y6s(GtA6wF|(2eLmv)D!wN$lmlcrS z7~VorX^no>&~gEwz>HGnE7~29P7E-)RM8iWp7Rnede8Q`Uj<>p%BuZg2bW(zTq-!D^q!#31vEekI9N$>6sXzo9C_eTm628?J{|1BJqq z0f?yk>*!cLn)E#HE}FVMqE zJ;CdkR)GzT_{s#U=c6VaH?1C5rSY;s#omO{csULvi~_+Z!;dickh${CQ=ied-a#sb z5Bvlz1a|4XEUfe;u?O);_;z877zUuU1WqBSw#}<;t7?6@njdM4eC56=$x}}KcZKL* zqR_;x^>Xl;8-!+LO~3G-C92gYOttbKR9Fz-Voa%2tw8V=OE=+f+0kyG{y$UHB~7+X z`uaAAtqr53{+dooRjSuEzIQk#O;!$)spLiPFrQ{5T5}*1lTCK)wDPqKHKpL4<$G^> zL5=+eyu#E#U=g4_Nx6M=9PfxP0%-(e7r(%+ZxD$%b%%JS2kLs9%%IxoPjldlOs;r;u%{4=KXV1 z+$df+s6_GD%|=6~H=v0uh4rtGRE{9g^xl*bm$1unC_+=EZr!hxz0E7Np>Dp}m$I zs$;2|9MDEZep{H;gkC;Mp$FBiTW}Ba$ zGcl3D@2*NSsFOX-zHP-7Q3rf8xrG>U5Jw6IHXIKoaNXs2<%}kisfRCv%fX;SBn`}* z!JuLt-Q&Zd^J4%s6{IW!Ghd=t#T;hb!vW46!ws1GC& zgQ*$>AjD7V%hhdj)@$whmf%G4#qM3sqVz5=vr=InM-jFuz$_34U`ZvI%touLUFMnl zz~Mn8oQFqeKqzl_qfcRZW**DVJqqZ1tl33CzjXKkB~O1RwaCS>J{0B*7Qjy_MJWqMvw>8IHr#7!GW zLY$<{b24_SA2v`sGY`kT8K!#Aio6{9(R=tREx736NnG~W0%58@2%ik22-D=2v)^s)@Tgcgk_?pMJ}yn_U`QB^4YudBhdA3 zWIdQZ+N4ZA7US&cQ@C{2*DXV-V4_KBb%2XT?>EC(f>feI2*}J%U&eS{05LT3P!|9& zwByGm>9{)XvX4+61Vie2w4VQlmYaODqWr8H7~PnPBUZLe(0;tjXKJJ0oW4KII-R_#X2b5hDmtC4_*4~Ra3I>q4qZ%3 z-22IBG`Z6@b+#B8(ajVNxf-j>zK>Fbbz&#U~ImB(8f{S7KU&C&jD zM~8HR!px3eA%-m~r*IY2Z+>cVrVHCf2V%5tg40ChbnEjmM$ctYIy2R@TG&3wNGK4G z39$>&d;0mkuBnjXG@sqjG^UE>V=9GwmfsYp@KL=Q>{+VY_qjSdz)QBcogjkp6jt3W zck{sf^-9qxYq=*dQLwJFdf-1=XRXeN38i>&d3k>P^8Mw}7RV{24>oHbsF%$FDL)Ps zv^5*@Pu2~D2W~YYKLYiI!UG?_Itt|j#iyxS_~we8VK!E4#KntfX2rD?d}ufx(!hBq z)TJapI=nnSJKfqze%kisa>4Avi9FFkDMQT&pNj^iXeRLF{q=qGeGjtx^*aVat6r}I zTdx>wZ5P*4J@z(wWi?yh2Z#;Y3Kzl+zZDKYmAM+d9*$l~%cDO9%VX97VzxHL=;+d@ z@V%NZ#FXzKqLWHM+hYiMxe4H@{#=EBC>ie)%mo%z!DT1eraSy5O9ALj%OU2%o=)x{ zLh%478!2~RV%d`3f-sr42Y(H{MzBt_-x{-JQNrHTuDm-q{ENIP^d;C6=tHB!D7$bn zJ^bnW3%LvW5_I7wCmm1FjsUQ%4%INMEGeMC*v4=U*A23oeKg2*(*17*`BC8b)QC^d z&W|qNpNmJ?eEZiM_2H|d!xL%9_+dNs;d#8n&L2U$2w=hGcKhP;mEuRlap+IdNc5*= z#-fXgqgmhqWxG2+dh_n!{H-)d{b@N=U5{u8$?Rv(1#AK}p9hK)BLGu~Nns$d%BI|d zP+DBO*9Rb&SG%M5r?E>9?9VcV(E~AnU9nduCr5vM=b5vb0rW@U77AK}Mc6`&D}gtF zxvJLpLBQXckIVTKnv_ziS``3loZLmP3929)S`}Lf!UKe@S_n=<#j*wDmP|2q>aU9u z7==lcl>YIzSVZlB!bbmE-;#p?ByU9F{pY&<@a;6r7}`PT^q>;&u^a8&OLU6H`<|xnCjX@W z>a}%j)LmO%Py=@LZv{*v{gTQ%UjX=LZK_{;RCTVyy0Khn&=h+A;fGvPq?TiZNqOdJ ze9ie*{lkN`+eMVE)gD>DX&vGz`?K{LsUrE~Vq%-`>N7Mx4oOw?I;0%~8nww~PpBo6 zET2j%V^MPz3{ivRAE9joJSMOZtY`@L5ithq2j?E)opSN-SQnUOA21RNn!!Qos1_{=LOS9`-x9=njLvd zGLw1-3hQOru`?uR&-pHUVI4Z*l?Q%%5%`7Brnj&sp)$R7@hAhpT=Ah-+Z!layttWG zo@}n?Uz|EbA{Fyp?Q#$z#Q7O>!@L6O5yCn&cXvhUVtD9yo967i7Y>hI3Vn!%5IzM> ze?N~HrE0^|TgXSnaYZyb2XO9AMx~;ELFq@>8RSLzl^7eU^pAjodWCPb z4%le?6-t))DTfPw)5`RN%j3iJdPo$`0)abTu%9^vCo-1imW%1KDQv`QX^aREgT2+1)ISQa zK{3&Jb$otwm)O=`x7(T3eQ`_3SI(n_+JmVRmzmNWUd31hCe;=Qo z9G^yJiQyyMu6VU+`>xu$^ek}J;g1};h@Y1Ft*AqA@Gz*U$93j0)W7EJ5u{xHnwz35 z6^;|r{qe!uZbe>?KYF#t#T90a$nJ*y>Kd+V)x3nM|h%xQLU8&Kp;RGp4GCNNiCXZjS91)B*e zBt8CiQN_9)W8))4GZ~PrG5AvykbR?~oaHO+-yb#dfC~&cE;VRmK}bZbabu=ex8~M> zXCcJbjI0*;^{DV-yThc^7-mhifrh732Yo=)NA-x;1PpOUU7b0E zX`4WAi)xz5!D5K=&+u_8hdZ=z^%gFbqVD?>oz+PlhGIOKUtMRj$>e77ypg&yBYMh= z(G1W(U^+E`01rcwo_MNeW}Lb?xp=8_tSp$4L7c>cF+0YEQ?UynSUYC*B(AMal+=ra z)n@&S?LO?;ji`Z+y34iZZdtTlX)5=&?$~OB4v3C*Q`}5u_hg-bXBO?p^I4^hB5H=F z?N%31tPYZvz$Kp8BsOnPJ(#Jcr*@4f1+>jv&DQZ({Vu{|`Ox0tvOU=E`n`r{DQw{N zz2H2;gW@l`<9dsaI*oRz!7knsO~4uce{t_jQm|kbK4WTt&E$6s@-t|z0KgK!eN*aX z+xw=!1VE5KZor`1S0ls?SZ<{7*gn(t=gUwfUOTl$>2pJZO>5NDHK|~;3DUSt>(R(NHROWp#vygTJNDlFi9$+WMro|ZCLcw+ zF_6EVUL2pD)>)L?QS4%C9O!HuL$HwKT@V9#IGz`=3zge4kN0pUBHtgJ`{SBtmW6el zU^6JL->DspE4LM^`kPT41A(sB{2pl9Zy+!zn?T5fA~8A--i153q!E)JaEz@3d=M0i zZlXeCLGUlu8h&|bb6zAcY1O}E;&ECRsdZud{IqBBO$%qHX~M*7;tRO?hA3U{8K5VNN9V;wMq z%jlX(%tW(nwOwz=*9iqRfr!<^z;4RjD4@y}%@pB-Xr>4s0@FYvXfUqey9?nnjoB&w zf;1%aO&XQ?mKd1%{P=-gB<-ayLUZZhOE@F}_5T|mE7j63%@F^sZfxgAZ;mf6kIsc5 z9K63g6YVM$NF5)FJ8!;8GcwL{<+1M{0%xz&II*V}bQQdo2xwzDUbQUzRvzG-lM4lgS3&84E88^CfNP z>m9B{yeGwEc8YPJFf~F6v>pT|E2c}HlpqIq!psI&8K9=3ONqT9NO=wY4{IrXo0}TZ zeZIuO@Pp2U=;!lSdZ4tZmJVxL%>LUCUe+s}5KH=|J2EzSJ6Aupv+|g zWP!>97smKrRkM6t4koi3a=5XJ)$2`WeVsAtK*39P829#rPB-LWxjC)mNPuBrGnQ9n zYGj=#Kl6MlCuJ2SeyJC7joaA>(k?Jz*4h*tuiIo!j@mf-7}%0;ahccD1f)tkAV9`1 zvm;Ep$M2L7IgNY;2WbW=OtE{5qXqFT8!9}t?wc0)@;-qFStSGfK^Qc+ceRQ|aIhFb zgEpCoz$D@&;8_|@E40bmN@fAXcI#9GOW2s3XQ39!dg!R}r-kBpD?x0e=}i5#tWZ3D zV|zP2`Y~=rp90bDP)8LtB6Zk9aTEzrIx~wj>#zPDdq$D!(BrRzmx}N|5RD`kjWA(N zP5b3=55YX$2ADcv8JA4E{BiEpamwBshnfxsvDi5$fxTC!p_0W@(2N5G4J`Sl`d?6I z&79Xj9b=ENsD$BYrTrkkCOWWt4g?uMk-+KlB6aR8 zivk#oC(JQSr!`S9L02{c1}7}M`3BN#`OFJGcsA>fy_ha8&(06t_@VR2=A15Ch&4FMnmSgI$>l|{2={V7RSYU*sEq%as9f!WF^-%oSuPvr_a#tYT zeIAozoMp;uH5wcLUpo)Lh0(jt?uMh0$>K<{9xNFlEq8quGtVtj-L%{hiNG9v<-L20 z5p`QMPuRBbyXOzX#MS1Idn}ktEWB!Q78LO#+@vKyngg2jy%w&%48U;Sd~u2q#r=60tSMZ}O^jnO zLei7|e0O{36)E}$Xht#hm1(toSIlo!$S&g8MRp^D>)=pFv!$3tnXc_)-{ zQF|`0T%QpXsjwpn1@iABQD?)d6Rjf+3d8;9i_)VJ$ujl25&h0mXQ3;H2^m9($1gtl zY8D~5e0D%%EHB|qLmm!yK*AW8>{?ki){aA)lFZSu{=NCE1Sb=Y>1=SYvEryzkqQQo zcS{IXQ917)m!7j(Y+R}H4#%SjT%K;nxyq8?D*4bOmsj${)oG4Z@LI-3FszbJH)qDE zc1ovCMZ^Op%}@%r2qP=;oyFvg_X=-)vdxT&JW9#%*hNn+Jckfp2M4GL63g*Yq5Hg$ z?iP2$`HM;u*xz$b+Z3C=udZP3mKM?zYoaG>xEUh5M1hlC50r^{3=uD#!kg1ztOgkpK4okX}$*E zjuG+>L|ba=t@)MU5v9-cFP1jCX`ag$&=gC){sT**PI-XvJYuR0Y@*r-48o`)?I2#o zVU|Vh8f2ng+W3Zvu%WVp1%k*yevD5W z?$>7#FcM(SwFwihWdNY)Ynx6FQXnp-CNjKyUC1tDYq$#iCep_6woPPmKD*+F70WxU z;;3hnA;EkHPFwxGzTb0D!#;XBtL-ufC5$Wxz)OwA=9v!oZ4)NL%yWm_But<#qmaSi z#N_@2i65hMG0EeR$a)WtE}b+~vUx351Ip10M}h|YY<^+Z4`vmqip_yzMRzK*^~t;k zdNWj|@D4H4Bp%#y1n9t~*R8K}(%XRNgB)5H@_0r05!hrM@FIUZM)^fimW(L`6^|ka zu~Gv905zIWNd3*&++kH3-cXKj=``1jFZA>;qHe_`jq~GxVYE}GRUpy>q8Ee-rir+- z-J5X9ocUu-!j{u6t3t5Gh;$G(Ce0Cotff-}k7ajbGqB_lD6b8S!a6pC=!4$Dn0S>=b_XwUPaDV~In;6qr zGEiq$9#ZUN<)9nf^{XHHd7$tW8iQy4%M;&1T!#|IXre$l+0KPyjUb2huiBzLh-g~SG{ zOavw~jqtu>5@_%}iWUG}K%&2ZwqAWVxES0~P1s@o7sVOwkW#-5O@)?bn6X-yhS(6D zyx(v74aT)7Sx{3IZ)avXrE-zTvA(3WU&k#=T5%2enr$suBM4vWQl=NNEIEK%41ml`1SE>$HUO-a9pa35v2b>CnJFz#=2HZ`mqVzF8O==|EiUZlGev3 zPh9LP821tp?bFvnW32}5MEgjxwmK}f`jF0XHxM#;<}3&a3<85xI`p2NA9bXc_y zLm;PJJOCTn#cs;7@O@tu>-|e@4`X;^P!1e`0^Qj+{rPC+ZFIWF5YJmu}Ym z{WnhVMwbfk_d}S;f4qIy&aNtj2m!OU>K5&P9O%qcWY#As zEai{sp)D^22krMM{1JoFy4_659HZpv#?(>EoE<{e0jKD^Pe*glXIihprmzH0>z05V z&;IM^>~$b8z?2o%6D54T?Gx0s;i>DRsEa-+i*5j1gG71zmmEM)h#yFL9TV>c7ekC& zos9TsT`mCkg6eQIB>AdBc%XQ{nU0F85Uq^mG@x?UPAVFXKDy=n4eQQ_BXxmO5^A26 zdYWRIJ(C$`F=L)|KA9-T0uyD5zD9}A9AULEBWr?0H#Q1O=jt|<9+cplZH1iX`(CH` z#(^)*rJ8**`MuKngGsL;^;XAI$3ZlY^3gjbG^oyw_d94iC>n@7L>f&E5WH|6cfW-@ zFo}}kg+mhNv=kia-BqJqdiRb`4+BK`>gezRI8vZFdrd_mS9Q17dd=-6+y_w~=7LyX zbU~aPoWA;EL7s5GV#s#DlU4qaOb~#cQXC1Wjq+@icZ-o^1(S}xZnPRyRklU}7{u?A z*CBZvM(MF_6|@#z)qFR-(m6?0JMHY`;N{Ut=k?k7j|b3ynWW1kV1KX z<2y6d$eTTPR3GXdN}VhLQE6Cm{;Lb&h?{;l1@{|GNMIaPNIyY7E=#Ar!4wrkpf&=A z3`y2%G9nSQYdIVM1SXn|^N}-t&?!`#E!UzX=n7<-Fot1oSanRL4l{SIN&RE$dDhVi z7udcj{&duUd6rnF67B10nmlpkI#f5bc|;^q&2Pe7~+c^`_lmFM?SjC@5`{N>9C(^6ZHz56iiA^2`~W_ z3Sk3Dd`Fr+}7>8<-xhMoQhmNoEXqxxM8J^8rn4L*hO#)hBf`CN+v7P=%#mEaNC z@FZx62uyGi6owNE_AY+F?Vc5Z^D!A<@mnLjQ_wIH(L&P zI%|$68gPxswUyfYu*;_Dleq`BxR5uY0e+CJ^fChx=bomRfn`S=hqQX!O;X+ID#hOP z_+4Klp(0C)vk*9Nr@FLs4Vko}AA!!tAS0L0At)&ZfroX86sHSrHBq3JyL)Pv?mY;s z5rs*yZ4j8p(Z-oK1~p;1A!8AYzFX|tSJ>71hfAlTtkFB9YmXA!y&_e)-y_{kPaQMhOtq10huz~iouB&#j64B?qQ`%bbV_$ zi)c4hFyDr9iJ1J;*`zxvZba(`s{+HZv|+l!BEXn?PO%mj(4Z40u1lU5VWHwH3Rh~o z)=tDlmBxq!WOa~2jKi{nX829hySk23$j|K3`O%xs>+_>aVR*ISR}jiwKT;4VKMGWG z@-TuE7{S7E9*d>oKrOhNs3;B2c}#bvqw2tuPErXEYR-yZQxP*_4-m!dmU*Id0>JoK zOCe*cc?cEeb#dQ0&5#N}1JCaf&plpfY4FVbVo==GdtdlNh!h7%%lbZ2!meG}7#2;v z-pg7T0b2h7Y+-Zngzm-gePKT z&aYrMwC2~aga3G13l2Sd4bQcRdB+}f-k#Y=M=#8~SI0lJcn!|bcm8^I9!dy0_)0E* z@%>3u{Nli)@e+LhlJaOd@2hauWleE^9x2BXctZ0673QJ%BhN#@MOBd1z$FI{wh&uZ zw_jh{N4&EhFGKWRf2W8S}|d#L3tQseSWsTg>CQ6?hg($|WI)04527 z&+LBv!j0G|4VUgLx~!I8xy{8ZcP5JJd?VK1cilz-O7inL;epbgq!t``RH0~frCW#6 zFU=I>%(m74dl02o{a^jvg+IELCg-)(w!EdE&K9s8SOnUw!7&N!4s_d7<$K|=oCvY) zIAQDsNY4fnf%4UDM_>lwsrYrWw3Ab9E$mP_4*moXk$94JzjO(qqSoN+uJv~!`33hy z$wqlfwYqM!0&v8#QU|$s{VqdDG*Q9^qj`B9OU@IA4$}Ty{kNi~!%1JE^-y>tB+e)z z&tU3)0TWy^N-xx6cfI%q7Vh%BBio*neBzd9>c4v0(V-%lioVYDbrZ`1J#^OEujVnW_u=1#sI9# z#$dw>`5W+`lpYl!I?$fR2`{9G3<2M7pC&^3qnebj1JB@9&N(FR(YwoYe}@u!U>gdt zD4l_i@hljQhShy)vs^g0g@Yl5pFf^jC7>IU(}DfogTk2f-jFZ`ygVR^k`2~@W0yjc zys^k*6)6a?7zH+NGKNH~eNjbOZv>q@z338F6<1(>71_C^+81eohn=Fa?e@zKQ5=Wm z3y)CT;NuTaR584v#*;hk(2DC;7V59Qxw68Qsr9)|l4;)kRinGCp%1-em-Sjn8Nxu> zZm}j=ZqG|F3HVg>88sYG%+j(uYAMHqI~r1a0Zb7iK$2aSSQG2-j=z{dTS#;*L^Rd0 zU9S}_0X|X~yVV-7qA#!w-3BHP;gAxWOGIdr7@NlfnW}E{D~N1OrWHg^n#g%@=z=bg z`~+?0?d}8MYAdl6u;M`4H<9@c$$MkgvX{-ah3R;-WkRY#R5$1PC9_+BDCO$scA$?9 zBpM;V%K5&!5O98kH@YDp?BxXZWPDFZnyktuRKCU$Db zvhX!o%Kgk+Chg1nz_o(T63fN>ViW6?>($90v=*Kc_AzUbhcma5EP3*DKGkuBPBtG(~Uu8#le+Tm*%}vAf&YP9oSg9DNuhmnC%whumYs(6eH)&xiO+ zK9S-97)v~1&5dD$AYtR%spr<)^>fT)&|vhmQz)bu!)SHdbMvA!ZhUQ*cK$2Zpz)w* z%cQPftPm{{WVGp^!V6zvTrl8ifIuar9)uv5eY$kdT4YRO0uv6iq<9w}ds(;W<#6jl zJ3}Nm<0xQeKwJ;UaiTA$sZ&?zF}WEcN)4&d`B=L*HBG^|iA{!%`GKKWEEuP~tL_w? zIibh?%*&$Ve)fw2{SxR3gjgu9F0{7UGYUb(PNBN$+gY!j>4Rs&E}B)hzC-BxGoIgc z)xr+Pg9+co{-o0{y7McLaoK^;?4epmRRf40sGDwm-@Z}o1Qr4J1NBw?$D`rE_eU*F zcicSfT!7aVy8HNTz_j|=I)%H12HZm1rm^MVy&Xe1D6=hgYG%pgFtN}pNnrt?L|9B+w6U?LXgxHV(lVFm-(LtgGLI-WUYA;lP zqX67$&rdEQ5soCO?$?r%p`qLt4A-`)povUQA)q>*an(Iv^3Sn=*&9r3eh(A=@%v+6 zXcf*j0@>etD}7BIE!C<*1gqT#EEDVn1Ph!s`KgOG171)u)p$R-FhK+@#6lyyUtCkk z1*4=IlbMdl<~gO3BzZb1qx4VcD-Pw!F`Qutx+=|A<~;6osaZDa5(|~Q=g8U5(<;9_ zid>{5pii5WE_Sgu&oZv|cIwP`KAOGfI&VGT<3{Ro($#0PtE*irswL>(l}t_Hd2~9u zAe-jrXw(?B(AbNo71lycQ^MZK(!eFvBTndH=*{$zlH_>#_dpe6A{%1XD2Q}O;LRXf zLy8)n1SoWb{39y0OJ2@i!$NQ14h#Z<}N^y~*?*#3SG^uH8{2h|)eUCVlVh3b#ZG z7XXiDAoXnGK`n@L3lF(Z+sG1uk4Ia#EvZ^XCpT*HE*DP)3TxFeI5D`@MkX9QsX1;n zYaRwzR?uj7Rg^VSat-i~SXM`?({TtjykAUJdU|%Laf0Q1)XshS?pxUUJB(_M+ER+; zKh?J%Cs_i5!9$rd@-#;(3;rhhhY>yUX?uBobnuseKs63h|2_9fCbYZ*Zq* zrz5)N*AwzWW@PvyfewU;$zxWW_vP{F`=f^pySHH2CIY87@*W>~?{^saYv1k(B^HaC z^hn1?puX@Ls)eG6eC>rV@_+#Ke?DS-DN46?ob?VpMT*^sX0!CFVL_2<#xFoQCj#Wf zwEY(o?HuFQ6YV`89KYggXR`^{-L>`G9f8Xur-qB<_^W#E2`1dFW2bt|5OGsnnVw^3 z5_=Rat9ZVp^}P7;`10`kx;0&fB{ZsG6zJhy4tYUkC8b$Y(u;UWqTmTZIl*lPyKK%6 z-XefeF@^yUAQ-WXcb{TOiMRzoSnZ{D-sX(fQkgbhS@{6&d&=DrqVk@QDLOjWOw1Dn zI1>+uu7tOjTqTeUNLzn+;EO{5zuzjfcFQzQbQ|e|AxFWYdGnhn3Ou)!r4kt5qUBSN z30d2&Es;lD;^45!`gF;v$P3kLP1LF4W?J17?93oA#)^n7!4eIFD(6&mSZ1T)$HED? zjan0c80jWR?Uskaovw5N;3irbEMGD-JC@;7ivVxAIuR#~#uc~Q@fBw+-;e$?SSZ_f z>c*4faN7pogb^|qHMnSUe1c*4Pj14$Ouy2?e)iYC8zCXj08lf!J~qM735ZfUh!i?Z zu2gra9lbtye{#7P3-5$f#S?v1EqgSf&YD~&NIBNf7^&gWn7V3+z#h36(ptPZyR5z9 zxoBst&eYY>*nJvG7<6IT*eJ_H)QCbh^KD2(xwwK+)r530{%s_1ONO5mB3A0@gN1_$ z7RHit!wp6z)?#!tiQ)X>V3%xqaqABWdWoZ{4Sb1Rg-bzqq>XB)WkSOIOVXjaT+=H=h|RO zkBCA~dLbqu>X;m55+1x*>UJ9E#KBt+Ysr(e%sK70gBjNyofys|hE(m3Gq(imF0$wX zJ4I0S-waC(<;&@v@J`r?HqBsoS(t6fw0<$26=cDN0;+*I=#_~!X>;<}6el4Xu0>1# z5+ZYHfE4}Dn8`>-qh7cXPB0aUDltWPl3q@=`jcd>y6)K(B{4^kVQ3ni=8(3#H zM?{Mj$ru<3Z5%Kx9^T4L>v9T>40YVRvK3l9VaB3<0cwK0Qs{}9ceS$%olJVIEEG3u zt%=c!v?tndxQDDi%#3wb;59q(C2HFl8~YEk^-y%Tj-G|V-6j>X=xA91{osE(Bh06v z^L8p8YTWG<5Jah+!GAD(6t%&U5@;h5)1sq8Z58**wC8NS0-m!u@~$T&@fZhhGQ%kl zq4l6f0(b8ZULc4K@BG!r?4#(1FfB!I*5}1CS3W_mluN>-nGdqe<2pz_dawfv*=H*C zBHM&1VxUQ&RX1Vn=+pilMXpVccsN#vgL0M^pTa>$BEQRv1ukt#J+OtS+DUm6qvCpY zBBTpbrb=esDHD3Hef&|cN3UI_^u5I=jX!E{_&AoMS&k>>JjJ7Q=)v@X9r|r(ot_uK zP|)4+GwLG5)kKHuWlwdd*;IT7Z>+i0{l^E1SJ*Z2rMSQeDw2(Ai>WtLhwUT(x@f` z@E~&`6}=A{@eWcH&OpZj9xWXO*mO6Lx)VYK57MiF>nq{6MQ4jh3^j%btc7SAT_6`g zRj<0G@Q|Qr&aa9@tYz(NJCHnWO~xFx6ATIc*0i&-!43)121NwTe|ode6}~S zU6{m;8OOj{iao|f7gLnLWAlR{1apnUv3P!DX zt0KW~APv+M?|2xoPyasvk@Rnv093Cr($77cNtCGCAT9h2Ft}=tHJ*IHx^VVDeo@(d8us>R9XZyB6)OnbSCRS@c8!FW!H+lju*VuSM1C zeL=}1`}gDgM)4SW!}xyVn81lb-F|i!;uValFD$(eE2xu0+kCeE$V^UXg^4leDlIwG z<`)*aqS?082-rUM5tXPS?iJWG4iUd(Lq%ijt{Lk6rvH+X-fa0V4^DqlCAX1fMLVG^*G5H?S>Qg^AA%dcf+ocr zl8A>=21B}yu{IMWo*-ZuVcR>?d3F1HFpH=!Y&%C5*$<25BZinV>i;l=NlAaW)eiEq z`-8xLp!`imVh^E|s`tuA3R zO`Em|(PAi~iB<=+Q|^}=lwX8r)r@_E;_^{9yL=`@A{*04$hKS0?>dsr>~=g zSijmq4!5h8KEeuF3=i1Wx9`G>0pWHNgsduAM4xbz&J4XrE0};i`<4YvkBYQ=C+_Na=u{r+g%k%B{6P$GQ zX?^R2h3A%|%Gw@$E#3aU<5xNt-ygreY+*>#=Y!-xq6V5l3u?8#ZKa#hgKnxpXD?pZ zmRpKzjKVCLg%ncr1SyM~-AWtuzWnL(C=xE%uNU8+onNLu+qfo)?frLA^E@;# z`5a6LW#qrlF0-i0WPUBPon+qL_wCz#ld#BKJvKP!8W!uJKd;d3mZW00`D}=XubX4k z%keM@b!o`RzgseLAq{D?0+v7&FHLp)uXRMJ{>0jy6ZN9$6RpD635j^V?Rdq2!s7}3 z!fbvZT~^e+YAdp@N-VJ8Vku^8W&z!w2dmwv8fd?r567fHqG(#Eq9hg>^g$b0qt`Gh zCY?RXCC{65{~JgIMO$j#DQl=d8XMX1fc}D-poDHCTUz9*D>Bf>O@$^jsftzE_e;FeZ%ssCE0g-V3#GBd9&7G$$t1eK7oj!BBjC_X-VpGd>ta&_`4 zoP#g4-!ej}trinV*ah(!81i32IiNQ6Gyzu?$rZf1fG}C1LPqxJ#G#>9;~$|`gAc^Z zWXO>af*l2RD65$Q;xfA~W_T*R0C-IszFg&fEXLj$OF1Q1im^g0%`A70=p zg98h2|Iv4NO)8Dv1{DcQFn5}p{L}Deeq+K1fCY$Je2Y^O!Lt0B$%+Cq36OuOKNZOk zNs8b}1_Bl9XV35yO$IP9aY=t2PG6@p=QY%H{* zK;_2R%phZs8jtST3E2#3gofQV>S(h1wCD{7LvlkE0M9Irx}E}4cYXdfeod$n&7;MW z9z(DG@83!Uaqt=Lq{OP#+U>xDGS$7!-QkOIcUO?3O0!$$Xz`~9w@|ZbuWOAv-2_@6 zhQG+;H&5~i3jGir|B%+53>9uWl2xnqZh9B#(`?wv*7PmEa4cp-Z7Zfs><~P0R6O}@ z{Kg-lI^kUbsR#!NJws4&GI3}97j4_ZFe!A%&)F3CEFZN!XAwD%#(|f7X_IN zf*`P;&*C(TgwV8MhBucN**K;BT>?KXv!8k^Tc`)B*`)eKkFvDY3$~03F%XJq5t_qk~{H zBxJS7Ojhz+v6n)yMqr`0C(y59ELNEd(t(jft|=p8OGj^WbCgtgMWPj`e{`9Qq1tR=W7d zrf^gmZ(}nMr-q`~v!GFCM0v@_(k-rrW4zN5-!^S@%71KR$0k-p7d#==cA|*{q;eSc z6sGVPW|a92D}w>lc$>pMm;~HYQf{UINA7%L`)prnKRg~B9TPnN-nmW*jJoInM}QoN<2N2TdO zq61e4XXVi08^emwoet`#<#hS(FiBLtLN&HLr!DPh)h>1t+dPGH})annQp7i0dSXVy( zQEFdXo(tzZo6&UC!6*=8z44*eL`a7-m=Eh&j}OMD_qttyqSgneXe7NGrI3r8^P(4X?y#p`{ekrgA7ojVy=x8hVSS-MWAl0dL3A z9q=@uoRp$g!&Rk~mb^P;fqK_yfC)v)-fTFnfN%mj#UoR!K1gkXvqIYqj$LHp8P+;D z{fS>BR?rbzwmO@+Kr`&ZTRU?N7&>+WnoKp2#&upI>^8`PgJL+hL8S?e8Jjpo+UC8& z87SH{BHKm!+HB0Qm0}3G6{v0_xvBEjyo?l`w?T)h3TDPo)W$?{r4=bUtv(ydPX=n$ zCop#W4>mxNGz*|n2SA;2Iv4oPuLyt?S;@QQU1sWjhty=f!gv9Wi#w~NEdhysg&Tn1 z$fy(5vDBcqe%o!s1*nyQZczlHMyZJRuQHy&L5rsi0G12Yqhx>UD@i@lb}jFdx^uQr zR-qvZG`%$VHn#`G#r14KRsYth54Kbx4wn3)LdZcQMxtoZkC#eZ zLO}5gBcunbBcmMRs$XLrx`cy~f_Swb^YO>=-TpHRjdfPw_^d)*svnmRBG2nW*GW@A$(L`CVaO1KO%QtS@ zyK#3L$xLb#y?3)#W;-7f8>sN0cAbZC<$$vout<{Jhb&A$5Q*avZ+RSOc+<<0Z_|%n z(J1;Be-eT^I}Azf8Vg+)Y`6W3t(04(Hqb)5i^_0|BabZ6YHvJ~fps}Yn9bD)hjIgr zo4hxhbjaM#bh_cG+Lt6)iIG$k#g_VCAfTKTQ;_27Bu$*6FxMQLz{5wx`%?Q~RzrnM zd|Xae)_j?k^g8v?-h;5)XLGY)6byyLCzv@ABv4w`2SRP=k8EHEl#kC26S~g(>-$(F zNT=(60>%`_?Trs#fhg1!j5r1OrpT|4e)FbgW0Qq zNTO3l?vrj(kpcaQlcG))jfu2@4#--~)bjD+HdY%tA>3r9N~*gU*oJ;z>rP205?pUf zuZxfLe9N{q-NZCBlu=WI{-^36IBVUax+@g%3hBdyly$*s>jsG2?VITL*p-)}!#r*f z^te zX7`gK+{b9D3+oK{#5s~B42Qgq$%l!$mZ=%sRAZrQv}wA($<58MBAp41B(*d=*+q># zQ@kkJI#mz{3G-2>1C)0!P&Jt>Z{_MH6i1rKi<;i^Y6}!zogI`H?y6Ko;tbP(7ziu1 zl{RXlQ$q^O$u?|KL{Nf%RCkWCe7{RJLBX;hJ$dFC#!`)=usPINY z#iEwJ)KA&xRg++Yael@V5}GVx130hKo{86%CBZ6^x{U5v52r0Zpbq z3SvJ&c$%IOHHh+-s6}`jW7X>sZ?L`(+4{gtGSynQEaS%f`&AexllgETL{AJPmu>Q& zPc?124wjKI)d!EJ{F1G!y-`Q^9-J4zKXa^sv^OJHG<`yC_KHfY$A|HuHfPn7setu& zS&VKA67{HN0SG`U=oJef)SF{Syy#JL8V;BRB*Ey|3ifgVNg3}Z>oVlI!|hqHoDS4A zNRvbtGGfe0b%X*gDdr}0R9=(h`pKR`WS5=OvzNyd_Ni{j%S0E@Q;8!Cuy*2@76f2s zDzza~si+=_ng)QLz=+u;i0E5f>qX?BDflFc z5NsYqjF^Wn@PHMEP6c=3rLg2;KvCP=m2vdv$Pjft?K9-c=sX$9L|cn_)giJ6UBu82 z5W$0_)PY}Da+>fQjRw!RJ4lchNRfvHOx9szf}SgQlx`_$Oe9&+5_Dlyx_upsMd5@z z8>`E724<5|9|di|YO~3P-BK^BylXJKF^NVBswdb*7x<;DI_34a4|;V+gFHz3dH4hB zM0&URC~yEVoRdb#N!Ce+_g0iUfRrl6m0ZcKgbp|6g4`82v0l^qT2jCc2bil+F=)&B zkrG(%O2;ymJwOI?n_1M6F2?Cj^IE(kt))UO+;x!%6CmOK<;4bGIqfSO^6Utd{!8z+ zNW0QZ?r zQ_Av@OGd-}HIn4PtSJ0~{;KE>7fXwynH%DGC&MJbcr5|yLf==+(%LlA38M={Z;tMK z@ZsOLwtsO^lpy(P>FvKkWs1fJl!*>_dDfrb+)$uPQ?49OXNpD}G*zQ*v-#@pRy$ky zrri0aw-xdFFubwi&e~bTs9sziTpk~0f6f|%Mz)hRUK_ItlOeY3%&4c+&g=K5Vw%{^ z*xv(!Z&eDRd#48iMN;D|f9xiE!!pNiM){^EBk&i#SIikq2ai8z&qqT_*=psPNFbtd z_H=~6r4~SEDdQ?*y>$v~p#|DLe8=`Mu!eNX+gq)C)p>p4Z_+h)oe0P6IZdU=d)Ja+ zAuwqBN1*ERO-%w{(WA51k#5p6hwK_Le?Js58&k+|EyElN&1P4~1wdrg(dqlQQk0BT zd6T6tq;-v&D-Pc5$siO@Y#DXRL=)wW4Fkd@Q+;aNk!~D>&3t9HptykQpIdDS`s(=n z=rGJLr-zFaiGw=D23xRoZw=6f^}&wP0HI_x2akpqjJ$~gyBf_P25E;7ayHZ?ZpG~a zS-=4916jOQrh-$#6Dtf&IC%zSaGkrA02w7lQCFK=g4wkFw36~BTS91w6No8sP$MFG zKo1(|QG0J0{nShy3k06j3n{U^FTB)*JbrQ;A5d8?kC9=Q45_3WQy^QQ`Mm~V z;8M(iGlZ1p#J7WVxE4nuv18^-@lB?)$!K!L)HM35&hDv+8A^vh{A>I#ZxmL0<|ad( z6w@JeqTki-HeXYgHCW1m!FEJW155=pMP5{9;dqu)$ibjZWy~pXUkJ`PjOlL=V7NC* z8=1^eAF9W73q`vzkg$u-P_5&pBUd-uK@*;x0)yj~6`Va9s^){DvQh+>aTv*$AI^?n zB}y8aHvX!RNO;VLV=%~*%G?dY;7>v_*^d?%zDI7$U0+n+c z2bL*TxM2CLm{JPc_eBR#UP~f$)FI5}j^|AiCc94ZwZ0DyU=iP@BiPzQ73)#!T-Ve- zA4U=65bj)^rek$}qX;4=$EOhXV{b3MO%sKsE(mNXUxGk?5##UH9B2se*4hy+hSy+9*XgHoMXk(k)UgcDpEoEJ9cV{?9H9_Fgx(WCD~v}o4Q#IY2H`rA+LhKrh+D!< zn8dIpsVh6gaX>||pK%56mh_X_NrNFUgfp2BM|dbbhd?_|EX}sX-+T<1WiO|#Z5lcQ3U*BT!Be&$&c@s9LJiY_^4y}m?M}h=%25JP`+R{?E%<~ zA;aH68^>&f_Ue*-KKgP}Xk(Mt)KD8nb`#pEwYlkhU6iPOi@%NF<0=}A!tKsxr9)$>ddsMVyj4#_qc z{cs$aARxb*ouPG}iGh3vVrtSVDO|(N^o0!^aWhD>RxeC`PdKyD^aK{nh>1*Ouat8A z{}urhJQDE6JL~4hjwvVHs_WT2DKF&PC`+)Gm0rbO%rS^NG4|%BpcccfstK}yv0S=J zNiw2#v}k)pPYT2!KaW=+zuq9yj0!H%Hpqdv>vThj$5&Mp|9XCwlbnE3)jTr-V?F|M6uq#X0oKq1JcwoJ>* zQF;R>L`Zc7kGZ)`xRV`JbgIp=!E=pNv90xhsSYtn?%0|U1)#G)3>nK%n&#a5r z=i8IcU_}r=9YWgTMMkTp(jKprUP-S?Xv!+^lxC0%?Wsu`o`L|jcd^32JioWyH9Sk+ zjPS^T@U-`jHn)td*0swnh+ARQqoOLZI!LiAmK5bLvKGcH+y>{?Tc&!vs>64lh15nB z+eJl#1@NfF-k-&r!$*Ji5<}q_Mh%!1JqW7VhrqUZ_Hif+Y1C$;xM3r^ye@__66oB4 zJ62cmLN~*zvT?k$099%Qlc}mL8jgsNn1kUjde4w~^1X`*wiKc!1k7=1Lf{2YvVy$L z+!L8Jm6E&%$EDan%74sUofD6IRdDZI(^mo>#Fwo1*zUhhNnc3yxVdwJT{LRs2=iO0qK5EYW(MTQL$xO`8 zYn}({zDPIzo0uyV9+B&%58)e0+g+FV-IJC8;rr_7b!ujCa{>hkRn(dlI$+r%;uED+ zk*!7Pr&{7qY%;AS8Jo+H1eie4O(uCR9w#->6C-|#Yh>!VOtXAZ)I-MtHMna`?K*YrayV>A zq2}Rn0XDpRtLee`=fv`>iNx9PG=AE{sdx0w=XFMNiBLSdkA)=3>{%1&M*EOJ}7d1mo zKyZpUS{MO7w(P=xr_(Zhi19BJUD`lepY?$p}gOaoQ}k z5ux{hd6tReZfI*AXDzW^f#Fv8Bxt+GMK>`zK`mmduJf_U<kPoqK7F)QM{+ zf0jcEBQ%*7V{$QX!0*OJc3xET+1N&J!{h-lLNAONGMT+zN4F?$IMR|N-GO1uG*cRQ z8sMZSAWA^vA4}MGD0G6Rc8^aFJFkvjzJG(|jr!%Aawl6;5BhJy@KFgvI|l!P!IU4A zHU!ktrbF@#tngJnreT2l6pF*oFVw|&diHiVbEXe8?7?J5wJ?IfaF}Gm^lkypO{(5q zFl903H-Ltaqk*x4WW>5LC0haq9-X`fiXY@Dug{tnmoH6XwTnx2e;gfN9-p1ImTk;8 z{VT7@<$@XW!E;qqy}N#-d1ED}iZSfvmE<(?j0+nCw~vdn+PNof6Wdwf0peCV(V-7u z|J=T9lp;tpJ+ksskf#GH16%d__~gj?rGZeh)ah~UmYPA8I-f9@R6}V0d{B(;JxSdo z0IL>^U~CB(0*}Olmlwi$HB;7>D&^z`6bR~uqM?!`+gdVKok%lp@k~eiiF-vLlNK%R z%|}z9xf&Jch{2{NG;IL4wJUrk@vh|rnT_tM8EKoT7ursLO1MrdxZUI%lzy9Bs9g{q z5T<}5!f;e^&7octhc?InXN&10;dU{Ijf=ek9(LO1tD~(+Tf*2+kACDqZ?_WDS1r6( zcj24UqgO`lb{X-p!y!X@-h%#x7+GcxHH_a)e`V4aoJI7JiyA@dA zFMer(bG`iuSE)tQ>iquq&9n)F#tX8eesus@kr0m~ZQ8 z`Pt#o#f7TN-a|8|@87x>q`-4c>%8t899x;pO|=n*uX`Eou0^YH#_AjP_at#-E71uVR({@yj01dK{C zcP1YnHKI-uGeZZ6LUN9Bc+6*(dg~6<{RG>zzU4C~M8fqZ(|bn3Q7S>zi28#WbgIrk zM6Bj`LtHDAduoF*q67)BhlL%zj;2qYPL3!e5V@=RuIUfz7cd2f->Vb$a@P)9BMY#+ znh*Tf1v&x1u%5bwK>`fA8E^{6P-5&QkYq1tm-Y>12H%-;?3Ux8pd;PAff2nJhJz?u z>@$2odss54GHcF)|BWZex&rst8%;{PReI58;9=yDy1P$v#sYxj10JT0>_A%=ptBhS z=vDh`ZBG}Ax3lB3&dc|& zI~T|Qb%g%QEw+i^pF#Id4`R))6P_6Z;>2b*e%@?66uciG>o5yKetSAG8iK0MrK4A+h5&$@xHF!h zYTw+*biY$e=A9lXkya!TF!zIeE<6}FMVEqd1Ja~_2O_l6j_2G7y(&rHtHpSDIt<=a zZ5TH&M}ncpnW@j{@u6gHSKD)GE_g;^YUh+w_?zb`>57Ye^TE-tjdLGV0TRh*WAI% z+VY_3hbq%-p=7C?PeG|y^jC1aVMCq)_aoXfnA01(;tXl*(IOn4y?*VN?I|*et%0nz z^lB*fiIvB|#7Gr@-PoigO_h$+Ury$;UZEvegY4a*#!8K8uL0W+mPKm&VZvA(qgap^ zC(w+u8*8G>*9|b?#(x2uFzNysLqsE6+u!}trqB`o zODgU6ge52j3D%hQ+Sycxx#NcnR;~jJP<}W*Jv@2;>Ih{1hkrqw`-`J{u$;~+iJ6|g z5EeG|c|cpK8BGoUtEFva)mN~iu8qx4-)w$2`n0psX3N5vWeIoMX*u@CjVy?-k!(aS z2o(P`&=30(<7Q%Nn{KmOWu({!8qAi~Hv+HG6syE9{fK2I?15_Hg=yGh2^FUAU6aY; znB)zyDZjH$LrzrT9x<5LIPu+&cstg#Ng&c?xYW8(?)j^b6wrQ^>&RHVpLlSnPLOw8>C#h&FwYwl% zZ^z)^7CY{4O6)-Ide+3F)!31AKjiO}QW_b;&(6;h<@QYrFVBanz=>O#LagqjX&eUa z$4Gi%ml)|W$vkULNU9|Fq)cq-*#-3?i!WI@bDq7GUG1k&e~~7V+WMbyH>9I+Koh*aRq8MpmS*=((ZoSUbZjgawXeTz*9eb|@0ZN!@cQBJ_J z1qWt`v2|F5?cHpMf%nya*VlbS6%D9uF4=xIm`!ffjP)xslwWvvVeOWmODFnH8$-gB z?1|PyG=DrkeZGyRh4z(`vb;PyyKGr$L8k-aluif50fXTuoxpL}?Pc2=TL2WQAV_Vp z^P@NFvV8Z|*IE>$e`nFVm+IZicU;V%MaCc~cy|cyF9Qhqr4xTO@ISIy41y^d^!SD` zv#JB$QeeIcK0>`fmasM@_P+KE&cP2G|l6U(t#y%c7J=Xq~ycld&Q zkcRQC<;M+$#Vg7(LkZ`w(m5xlv&oeLVKHnk0EHUb3lO1fZEj-TI`tdy#i!mTJuz_; zsG__%Hbd}k4W=zmIsG}_Zn@GHs}$@oiX>ruzxvu(OaYOX&mfkUF;b5XUhAuepUW>h zmTaXw^%Hp4K|a#?7;_b9qd$dgtY{Numqy^OhDw6kutP4V8{AawY-3}?^nIJ7n|+o~ zCBdR$^f-!8HBhwF%%_SuyD`LAgvih5V>jv@t2eq03*w0KX{s4_Q4^$ZDo9s1n%BbT!`2f=g92Ftrcdx-7DIjw*ETy$YV>c-r%B#p2VjYHt7g zzneA7fj({GB9RUTQ@@Y2*)3)99Vm)xq|GivDYYuDVT1CwUZEIQ{TGfqfC>HCrqXNE zxs_S_u!LrWHVLa1M`CMc50E*$IDYf`9TQ%-lByF$4-PxvMas7gtEoC*;`8eGhn@Jt z>l6QjUP1%$YJK~|+acN`tA&Q^Hgq%$Hd<>h>slO)CX@;mZJKo8RBdZg)3U=|?1NdD zm+vojycZWoZ`ian{G!b-4W)BaUIF2=7Qb$#$1atw0oGt83llw$!g7%^OdEFb$qVy4 zK4G#4zuDmkLMK7q0B%5$zZ}xv1}iBvcJT82GSyn%ohT&K%J7)?6AeY1?6=X&=U3O2 zIZa4pYj74@iw>u6EilpX%uEb_V6iFEyEa3gV`5BDjOyG5pc8E&&uwg3OaOb?I@)GJ zj?r?$UM%hUH!aZ3c1CELtePD;0%H+AJ9{@X&<>@)fY~^UA5&Z5wvP%0Yl#E1oCYhz zen+u>3b9qQVWGd_h~XdRxyf=O7}90OdU8^vM-%gZIEE}*y<#K#(SkQxW}vPZsr4?# zBhFpU3BwO<0SolPETe9}R4@JerPLaEQ$TS${@qccB{Lbxt!5YBzwR8IoSa2mzbk6x z12$2PkZMLV)Z7;6@69qL6wy_5ZW*DP#7(YGYBHSM90+4<~h4r!)J z?-pPUJo-!`ZL$6+1V zK3s+s_`Jf8UT6@>`6JDSEBZghg`1(+sOX?Szk!$$))0%Nt+)AbguZz|yZksD_a}E4 zUX~pe4UKoI!bFJOPzufMl=wFdM3IVIJ1oTmfiL1~uz$x@I2-FTV6Ni-^Jyvespnk`TfD^t6iaz8~L82#=L^X&9u6QoT00()=gf1 zY=zBX^lYTC+L@Yg*Ay9ZY7RREz?)`taQT8LgQs**C7Jg2HL#Y zBy8GA1K2{i*6t>=k8tUAhvR&9@B5m&1P#pJa(+>_P>9NEUUY=RAJy} zvAnv_Ks2jfHHV01ho$ zqe{}HS#pcq;uiuK+nJW3=JBf|6UuU`SN&sguVAsS7fjo+ta*kBK!!|xF?1Z01{ln> zSr}ObHVp#@qVzpFc1i9lFcq9aKDu=@Ti}68U=FiTeWvq!Q`~)R`A$*K!Li7MC`Ic@ zyj;{9MIp?mXcuGMyulO(onvncJgY$cn~T$G+O#2|bxG-TK=a?}w6nJdhv#RVvzPzD zgY36<6Scr?>fyCs9b7)5*5&cr+FE8A)kzxn^I6|6p#j&({<%afbaDCWu+v#_mjt6d z0`tjMZ9}92SP5^NM0*G4Z|j>=1=Rl!zwi8kH(FOCpWUES+{215Q}_Wzsomv=uw?hk zwRiCD@S^j4d%-R!4srgee(|x$aBrlm&V z`@%+lJU_lXGLAkj$+Xm-`mCEHAxOG0d%0*k7LWnuqdN$T;BpthT@BJFjF?dQsd1R0 zf*A?Eq=C@idMp<|y}dkmDdqtTpOp==fk-Cx;zfZVGrhc43wZp)0nAN%f_SzRWKZWA zSHQ&lL#&S5ElZwTSee62~NYGoQ|32>B= zz!O51f{=rPl>&K4juOPZxh)ux%KLZ)!*AHUca2mS+BGd0 z5f$#3!gXT`iY7)ClnPAbMPsoL<2;`iwQ*GCeXLqPo4t$2e zviyroGTbaT&-hF2RD)5|8G)E@EXEo)f9qlt^Caj{tz~0__Xr6dY-{QV^kQZSA-*WT+t5id-E!zIckL`S zSV1+ED6_~srn@KbE;Q9KdeVc}NZFlUc8<=^&(1@+APLIH6VmywV2_wq*P2tVM18{J zWPubsfE%Nc-Elq~ZF#~!94f5fZ@*8*HyC)FzHcxZW9&Tst4KEddqd#VwQCcD2bgM}T9I~F9gw0o zw|v!2UhQQ0TtU#)94rzXCWux9n1Ch>Wfky_m4?6%9>q+JtoVrKHWj0Dbo7_b#Zed% z2O4}KxYY#5gHjwD1|+*y|HOG#Ecmn2;y?m=da~z_HRu!@s1z}UyHNIK!)e7&o;Px6 zVZ+e<;AM$U6mJjSY=+JaUdb(1a;vuFHY>SZTk<(8`8=EyK>%}QBL^kzBGez2(~%;b zJ+GO8AB<6$wXyI}Kz@ECCNpnH?qrMU;alI>kgdi3Dkv+F`Ii6phyz0C;IeQ7|*XY;D!GHaf@FBryu{Cj% zafpd9%(bCv`Q+r_5`%l|E@egdVO?$bb5I7s`E;5?qr4&&+oGY zGVxdg{4pOxYLKfj20&H^C7HHCz#)FG3`oIESE2MKk!UTA3=huLDQsuo#qrPJ`Tb5~ zuoGYcKD;%Ds}-TZRJ00H3?{VJoGbEi>szplZ8dQ|I14D)IsEpI9W}G#$nGl`2t>R{ zjUog&zahMtvNxyivr)foqfBS0eufYxkn#<2vhg}$d&(9kK;S!dgB|s$kfUYzdf??G zyL{Hcm%TY32Vk0X16mbqq<1U>i4mR7HH4`_OcvASBpKW zY>>5nKWnVdpbry}+6rO+EW{*+Wd!uRaQh_IQ&56&%iK_&k`iliL&tjk8G78s_eQw# zABMk(T#+#(6yXkgr1=S65TS<+dq?goU+KKyM#6^?loUq7kUH>pPJbJ#Nt5NRu|BdJ z#q1~S z@~M7%H-O=3XM9#6ZB^HRs;Am0Cqfh6b;6+lDHFZ-o6GFGSwPIc7OtONC|bURF!jri z0nIdD{w(}A2+h2^uHlG+9~2>Kf*au(KPb%L|I z;9!`F3vDcfuF1^e3(%M8{n_1coKJ^eG6>H^SZ^Q1obnPP=p>ME<6}_Uayl9JQSHyP zgd2{h`U&XU~R~909^5Pep?!TgGl^MgdPL zm{9PwDxLX+TLCYExu;exufZh>(+64kn~5wJRARwyQXQ)z#&qNIoGe+m>8pv{U(K39 zgQ|g*y;-&OO#L&=NHSK| zqh-uxm6mZG{q+ch`{@EGQDGuPdlRX_gbEDa%9E%S?{s*4qS_&bj1JEMIF4Q)|5c%W znC-?yx+#{ZIdnB8Q+*vqTjR4IU%@ei&zqk%H#fJ?@>zSzgA_q+>n&PS-CbiM1$e*y zBUoa<`s+qszf$zY4@c*h)W|lO!DB*h3Pz)yA0auOrklUg$@Pp|&uhhQyiz}DX{}g= z{MvT?m&lsXyO4fTb2CltT0J8bGCk1Jb%u~Ws5h)^IQ9;Um9N^Otv8h4iYdNs zim&s~`q16yT~Bojgdc2$MA4eXUc-jVoDh5c!91N_ZIXrjiJG$RRX62 zrx!&jmDWBq#tks%nrRh7W1@eO9-*<`@O>Aa?q$#2c{JgypRn+MpM55$jeZ3LtYi_T z7XXWjqNFI)y`rK0|czKnkd}-4rQBV z_7n!By-ZaFR^CG^Uy+;DGs;Gg^E5@AU(m19ypTDhkAZ}*!qxN}TT#f%S0)BK#t{T< zTu-ej95DW+CGVoJ?sU##)x=T@&9v2?CR++)6MVMkvut~FYRmIUTXFj9$HTIJX4V}3 zMnK0)q1cGVvnUpSuEY0wWGA#>K^>IY%eFI~kRN+cpI+8ijjcHKH1vmc_rYS);H1EU zg~ud?U9~(CmN;=h1Q4)0;`ZOZN^Cys!R&e%m5cIlv?y53r)s7M26D2`OUh(68NlSU z35f?PGz*xkDclS%0nta0KyS+ITevZeX7kWZ*oEfx)DhWl z#ym%_`!q0f`t}d%bVC|5OxZmztpj83-lhIV%ZdA8G z>+6PXm-v3JK3I<3m?~cvqp9caX_D}%ea}Du1DwkW63yzoT^ygCs$c8bB{|j{lI0Be z>>W;~_p>2{>S!LevTa4GuB(6kJ$s#ZXTx5Ry(~tGSn2;fUg4m;GB5M1Vh2uC_F?_@ z7xhmM{+R&n4^Rm|UiODG_;0ru_pafOWBme>=6u*wtMm)}dar){61LC&{;>WdU`i-@ zh0WnVRdx#hJ<(07jluV&g5{!*e<76AHar}|P`5Jr@Ak&V22_NgQ1k{w=_R}k8wr2E zLFb5(ma>;Sai{CI?x)eNY7=*}T|%Xv`)QIzPR65qwQa^71N4!^xtWZMVHlC*4TRjV+a}Sq7H}y}!>Pewy`+ZRPaTs4VTTS?SpF4=)UN8+ z{mT8clQ$7LT;L9e%6HjyVTN;NDz zG_e5?cA!wa{#jm6?$i$*m=5AHP(ogyi;D0RwLC!#ijCeu@>KB4?;M=J(GnS{#Oc|^ z(Yq{T;+9@M1_dShnNx5hEpyQdRhXT+B_z>{YWIu^#l)5)c&zjV1IEe{na{2*Mc@`- zutQDq$sL`%Ylkn7qc^XjH}9i2C()ai(VJ29262DZz0gW``5A$*K?lyXJ z7k4?F7M}2l0MvmknVpkc6z4Wqu2KKNG$$ajD=hac(VLf=&*T9+O2{jRcc_h7#>;*8q)o6 zF@M-n@7JB}42qyg^8VC605CH_`2q}2wCVr90f?ZRG%C7*Y?7>qsXEtcc zoMdl+v!IawRUs??`;U(Rq#uJO9^S&4-@@6$Te$ICxLL3d1Hbs-;T;-W>^EdFw71Fz zJqu+4X?tZ6W3Lm&UI&crSBeoj*3L}zTfg|N-}s&X^)BdIVeX(ez~$MdEdnwICJY&VF7d^;*ut zl(H_REm^fu#;hzF{-vE(ZNYy$;T4qUVmZCRn6O}%!w;xw;AK0r)@j3_$jy9I4X2}` z6W5N;llRrLbK)_^fqBwqRJ)RxRLe$o$?l5MbRvXD=2o>4CV@<{=>`KbYHd0(?mJ%3 z(+YQPZ3>xXXWsEJN;YcNodFGRTal`q%I)L!^d!BBS$wp%Ll}(~G?A_fc&`qK8+}7@ z(YGTRFKnhE=l{#zzxSt+9E;=d`4?Wr#OHfrySlo%y82IC(r>=WSQm}uBOvzaApWFb zHq^qf?o2*3p2cAMwH|lb$Aw4~ZI8Jk9eXZw_UR^BHmnsCeiOh>|H60Ds~{;XWc|~t}q&fK`9_~P>6?}bdW_#sX!=Q1jl zA8+_8)Dxv5n~Dtgr}K#3IM4S+(d*}Wu>7Px?-u7$WTo!sWOJO)Mwm~=L$-AqEP@op z;&d8PL!-a2y3^GUGJ|*n%oEIsPCtsK#q02~ypI%!lsp`6NJ&aCC^D4P6e^Mgs(#NBOF0AE!;ybmd?Q}| z3|UUH&H1tM{4A3yf5m)GZnl-!x_Hoz{lnQkqKj@y`ah%i^d5U@|}=@C4>||X#|h&FRfIME-Y{{^ZrZJVpB*dj0a)AUX@B5M19C| zvv{KkZR1Ak1wK>2w)E>qB{V=pzVecZnLr5D^D}>Gw75wt1QH_LMD6f z3Y^dTQA=6jqmcL$mr`?dwxAw)0-H|`f0EE!HMOf)v`>9hJ&K=77l&c;97x>b$1QyA z!NVhQ<7Sk7nMWL&MHk=8y|tfi+eb~9pa`d@)NPv_q#jR1h4kK;dCBX>qfyGx*#zPK z-ZomCpe9RvX>5da+?4%ZG6~Oj5#-~6vO%J`^Bk7i9skyUE_r|5hvxAh$|$lA8|asc z3{kvtocifmG+QrxG#}c7sy1p&$}uT4Ogyn0?>p)-4X`@8Huo(`bRQIzRbZ;HL^8gmJ<6dn>ElZig}&Swp&qT6)DLM3v*)7eW{q*mY&GvnNH8wl-SRb z*U3r!C~GsT$Y`BmBuRpVwd4E~x{6ENExHLWv9h+=41cIlm&UttLK$=BsTr<-M7J3>_ z2G^xvcpA%yTQzI2p$48BiCfMqc^7kM*X~CnDQK9T-QCQ3V`W9*Me#50QmE!{vWt}& zXtk|mWBv=6akRD!9rRzcee>BxQNXpkvp;u?z*h{c&z-a5S1cFI_E+KKGuxslA_t>f zxl7Hu!rKmRceZLqRA@&XzEzaDuCR$}w!eJ7=?BY<(PL~a%Ura*ReV2Mv!2YDD*ltb z8KdU+*;CIH<5$@wr??CvilSfAma0=ER?rC;QRN)9BkNqW?L5nTt9o6D>BKBTtG0Y? z%d-6CT=-KDU&$3VBv}X5xr(A|%b?S*vc|ovvWmBqXxfTagr1qS+Q;Xo_s(NE*7*wA zTVr@Hy<4cA^wVetq{(z0PjCfeA0UzM9&0^hj25qnamatDAC&tQZG~U`$3N_cgZlO1 zA%5$x4|mP4{QU>)jt>ux4i0zg`~Ly|@#7r+D=KluJ{eq4t4Q24*- zPxn78!2h5z@Duv~@TmUO|6k*0_dmGEX4v$L=7Al2bZ}7C|9f@lbG!c!_v_IAyI-^v zCBJ|3{(trAo0nhihwGluN&F3rrCGE|cCLP_ZzoSC=e-ZT{alp$QtFp7)zPe@`t*^rnl zPL*+yiqLcXTXQ*k=eWQEjm`&X_LiAtyfzMTE1A4i5h3Ag;aa-+^#(8(NrS0S+Hw`1^{&Nm<1Sxs50Itfr zojCO0qDWZAq$AQ8kNHSdyZ#r6O4r?>Rn0~P{AbUw+0+p&L4WJ4NId~Pe|jlQ)ItBl z?(Zd!@oGizh(DsOvn@mo^h=Ynr{7Qb+3WxG>N-iUcibx2v|2~_!mC={X*7rsX!2X^9^Hc+*dGmlY_xJs=w zr?+;R_=1ZA&}wBFvEi!!qB0?7b+8LnNY-rs<^LV*etWb{@Ct0mQ^xgfw`&O7$|HJ! zI9;xCu@7IufPyUzvg=D-oqIKaDrVsL86TVKv0u+E(?2n#R6pax;$ug^1bc zWvoQZjp1iU^!#E` zt+qc6`ooc1ZQvVQt!T=QftOxY8?)I7>}`fV8>?$%0pn@|kFFarL<)nYm-+*5;isuz zB~UyaMb%^fG6*TP;~+g=q}Ag)AO4-TI@P8ZPW?rzS#6?lwHYm@ZDbxd?WKmy1Wyi1g9` zw7dYue0Uj3=P35V1U2WXXg<=&tdRwb319~sVf07?RD0>IEKet#1z0KxjDZGcU{p{S ztt>Qhkg5A5#9s&_Sxo_Je3~hyO35P&ZZ%FoXy>UnZp?9$DCk?$ldg-`LZ+JWSTe zjTXU-YtR~`QFl;n(W!?Xi~;~djUDFPWJt!_CwrdY!8ZXftSR2|Z-S}c^j6-5xGdPd zEd(|Sq2p>R_BL%8h%3KJ!z_Vsh;?h9Ljl|24Cxzu2HvI5U!Y6vaJ@83jecy46K@%y z9lu5nf(6LK#yOaV7>NjIr+GGrBRcnOWC4s}6^L6cskZ;R_7>Q$vYNLfe``WzvB$xm z>Y=7QLm zHC0Q(;zB8maPA6#=qfew4Ii)!OK<2cR|v9J5!)}*FhER(NLw+BZ3K-oLGS5h><>OElMlQgPO|<+7C;BMFrCANB`(^!377v=p@)dI?l7fUSlc(@d=8H~};<fwUh6sJ zrm$HDo@J5B^j&&^E?-Uyex496)~>M#xD4n~Gro=X_)Tcyrx~vtn*@>_fu1%h_`%;n z6bM3+gN|(|!31^7L5pyUFcsd39EZ}QLd*`%_Uy;N-{36@Tpn*tfTBkzE6>mnK0Q!T z*sCK%@nWX;5goKJp2!szJFr70>u?Nofv;)}s(3iiYBlH!+om%wxyIcR^ldP|%OrOe z-2e{c)Tc)!Bq?T}cG=Znm|0Gk(jlS4K*qdqJdYy5D+~g^ic77@8D;!X5!{j?)I!OH zUsCEY8;=UGcJu+M1k9a>H1Lx~z*dy2CgWMuM$klw1tN0+-;)7g^4|4PT zfNSvsZgzQh)$*=fqlg!Ff@GF>H@~F2ymTU;?DNZ02(s2emli(5sg^|7UJ_lkz`3}1 zT?SJYOt5z)Qvm16kLl2ny!LA5>IKZT7BE*XK>bbVQIdDl=lLKDaML-9>z>Q z#7sM1&7@o=5gr&xKutdQca1DyTpgnlD&>7Cb}_3cT40gAWpy&;RJ`k4A~9>%(S0{&`h>?57G)M}sb#`kN)t zLVR#wlCU0%Q120WUivAjdeHSfdSq>7DSRk%z|!l7H*7o=4?{1utyEt~m7{Xy5#@n& zl!8)5J4r@-XGVNyM0_UA^FO;kkQURuno4;kC!^mu+-xCXN>>`z zrN)5teyuYm?I%{)rdCk4cL9^@%vwKy!YU;{dUQS=RsP7IP5)<$#n;#W+&#?c{~qog z9X`?jukrgj`k%-Beiv`xHwGQ21#Buzey8@n(Q9?v&J_T*oz}QNY&o+H@H`2=8QmRx z>~~tuVuib>_{PUeDpoQR7^_She`GpHMJb_+ArVRZ06|j4;&gNhRuQDG9LN1Xp!AlT z|45j>^8DX>eU#JxK78W;zRK@kXa3{76|-+NJa7M>n0>$e&z}EmP2x+d0Np?T_jh0K z=JbD#p7wuV=O^`lbkAEVK(kpRjg}4R7*`v3F|rwjNwo0U({-EPVsYV3ui5W*wLd2N zHH}q}G`gDW_X6&Y92Ri zUpO1#JG5&&X)g(|DasWvDyE+_LEeEbRyvxdjVNq!A6Oz&4us9 z*dWJv5k!02c;BAYsrXg^yM>VS97r_EKZEd+;VfE|m=GUE%sjYk1>PdMY~&!QHMNAz zG>sN4i1fSkGEc+yB6b-1(^Pd10@5H{`}8zq`vzsqO@0HY#g-wu5z5acaC8N=n~kEA z-~#I`fYB*ET&YUEy3;yb=t3nA?H(()*1n=y;Z9@U4_T6^bfHkd9>sT!EP&F?g2q{p z1W?Tyrbp>BaZQ9M<`+IKat&*!qwv07_8b!cymBwXbng%zr{0!n*)*{(g zD@u5}HnM=RP?SOnEY+=mS_Uwrr3xNHc@#+Zf>M(1vCxph{w0}DwZ$*=axJ@Tegg?e zf+5rF6vNVBGeCuK;)r?LTCWx;`Il6o9nP|ZI|o8#rqqwKRlvg<$lecUUX0T9Mh+si ztZdjg2V+Q!)co+QMCel)0GW~n%0**<)X6xFqxFjEh)A#~gyYDnN(>Pp2ez@Xu``$i zvawKaA%jIA#$w9bjAs5o=bHhVn5TZ!X&HX2PF8d~#7x6#6br;yI8v;hFaV5k-pRC- z0RW8HOK5@$9XDJ)PS&9qHn%}4=M=idq-~R-<#u=z#8HTcj=XkY@+BeT>d9z=DeOuI ztn|`#Bwc$d6qb4EdLv!?D#pHwq0kOg)B_DuQ4dwrLlu<*p>nW9qHA=u4zH^xUg|9x zs}&+NEZ>-Y=&Z^aI*N>mYe1=k)HK#`?mh`zh&8QGRyZ0dwA2L<@_djwCT!djhWdh` zU?`=FVZ=0O7sLoJ{a$1oD`MCQKKhgoYupz&)`3hBEicl63?LJMy*)k&Eh-cS>6E39 zqiG^&`edfsZ)1ZGRUt(icF+o(;3f!8ho<73k^r5Mk2Rn~O>cVTGZfEU`*TvkIEfZB z$w_H9WJ6Q%3}z0@vxe=3P+(&uqmS;Qxl|12xW>MKyu84eZeYcY8H)k33CLq?Bu<49 zeo>xg8ZVg3Lw(NXfIcvo$WW%~8M7`YTJ@FcUfS2Ny{ykTkg81V!oD&*jAJcQ831D_ z{#N=>dq=r}4lmL4={k`hnByy8L4|r2LdZ0#^vDg1^oy&*jf`LBy^5g^eLUp$-QaHu zEdy5AFrj1Bawb4vaFY*A&pJ+`ShW-brP7%__swV~XPk*V3etrvfCh}UYUuQihi4-X zGO$vE(=Gs-m~zd?K{_)7CdOtKz&M&!XxQE{d+!#($HQS-OvNQ78|K4~O$?JRh9`0wu^Npm zeb-C4saZ1@H~?7}=GRmKwU-rqqf6w}X`Gn7UjWbHCk#M+VWW9WfY1u&&7-6X8SBS+ z&{%`G#Tr=vVWg>#(G**B@PfVqG@9`i+$N3EFPG{mKhpKF0=y7`gq#^-uG4+uNf?x z`#6e{)PTEJ>lEfuIPmc93aaiJfjEau|3`k6#DI*W7_H2q&YhTv5HMTw_F8!D?#%RK zK?fGJeZJANt^J3!zxHQZz@xbk&1`7`W55go<6eo|plV`T5X#4}>e9&gMfgn9S1zAg zjkH&ga1$`L0qmtMixl)VVLO`x0_R=;)|*Tt$YLNeFe5uj9E1|3T&dTFe!Zlv+Gk&h zG2n^0t_V?-G0+GiuEt2e&J8=qB9tazECJX*4b#IRw4fTRkB|njxK#P&yvRe;Okpr9 zC`K`AuNv5Dii`rh*SqEh&|-jw?Hx<+AEPk45~8d*)7K_Q^|S%B`xygR>H!{Ot_r6Z zbjrsU0;0uwX_ll>2qj!zaua(XWr2)|M;>FmtX5^wvpR0EykqIb(-q++fjD0KAfF)~ zWPsjh+y1fg-%1w~NOl8{D4eI(hAIn^$;dfO9vCy%!g)q^EaeC#(9k!F&t#CC=iwL{ zMS13`War^Rr${(Rt@rn6YcAZ~0C(xOAGhGbtDKxSx@5zVn?$wbYyry@M|b3=W@BXV9axyK=~%lReE})dQKg}BFesh{z-ZxMik^h-Y;07pROO$^CH zClO0<6rVt6uVY`M8S(}25HUu^3r74JItyR#066ugl$=VxB??tQrkNl1_eNLO^`rg0 z_9{TZodyU=9snl2RG+*MV3;m?DbE-Z*)f~mZJxm(6Dzvm8CRhRZgK;t8!174!}K6c zv%F)|%O2*O$*H6;R3#qzT7>_~hcDqPO z!C?s7EFYAT<4Uq6eMFh?))tEnr3*VsyT{56uJxi7+~6k-aOjUBygh)T)hdZ3?_hG` z%ElA4zw$$ISg4$1a#9(kL!As}0E{Zm@063Fa#t?g+2daX8wYTfmlF_scyxZeZHa+_ zzRW>d4g}FjrbH87PKq38TpjrSwYd{(98?R88!##-LdpdO?D#hfjB!@h;p6Sl?^DL|XvaTCmwui>4U?=93uOvA;N$<2wGauC&AMN%OEpNHb9 zHpR`bZ669#0v}h(Y`Wfszi4FqG$L$uNEdC05+~;dm!Y>1Mnu9Hq6wJA6F?i%!%}Kr z;x165mHy&Q=5+#G?My7b?j|6+bF8){eKJsWnX$n#fup~<^!{2f)dPOy$IBqpT5=j7 zQss~2V5N^3SYlL#W+kj;qea4-GwC4V0GeC^0B!8V*My@`%v-D}%vElsIhW_R=vuXB z>X{K_889`&?ac@_tVQ}_=Of9Lf%81n9mv(54IQH(Ur9>6xU@I0 zJUUG5wsCZm)-Mr$^qoYpp<62;XW~ggX^N~E45^C%m)`9>>He zQu|GjDwa9TC8(&pg#|4tVZLa%SS`Kyx;ml32@NY;1A0)Y zI$@$Wx!Ta>g2`e^dS>uN;TwEm%kD$$MFdnCK8(F!>>0nxR9)cnfq*T(4e1!OW4V&w zhIFWqKsi)cAOcr+^4pLO6%s0k3JW<9n0WbZNXPhR-GZ|3|16W6X`Fs(1Hcd1|9yRU zn0x=_$^OGv`pNr0vggg)KmV^&-xY7WRe$%p-N_`3!bzN_0lq#96ZZGN|3jnw`^NFd z-QWNIkN02Ti6fpp84+OIZgH$fQT;Frqo%Ktv;(2nKNP_n#Ys#-|PyX&*eFz(<~g;+AbRpaQxU2Uar{1sd&@ z4Ype#6Z*y|?jMfZ?{&zxr6H5o1%*C3{yhchl9~`%JP9+(BtY%rK2fbUX$D`V)6%?7%knxmyMFS~==;fEkwwF2(I?Em#=l40qsDtc{$wMdH4_Yd zPjIx|Q5;Qtes5x_xbGD>@h7P;dlbp&pE`ra`K0}+*&d8K{oZ8I@AO9Pq5J#aQ?j2r zyPWQY5BoF!_xaILr_q7$tY!jX{$jCXZ!;+mEw0n2Pk-dUzZWQ}-1d|qtV916&A|Gz zA`C0~C(PHzC(!1~OMh?nr!3^8+3}`PLf<3^>6?1$yN3=D4xcOhLgM(DLnq)DPYL-` z-$lnN+Tced1|N!){54MTE7FD!f^TnOSBHkQq*Q;>em`09$s>%vbmrY9hXQQTnRbxWHKBzVLptak5Rzh z)*YlBOc6?co)+MAN5f9F1=gutR||)!g(W{x)A8gMcNps8w=N)E@z8SxR)1; z>m>La`=+pu-#9yz92MwssJ0Es~S_Q z+v$p){el3jy=ml#z0i*y$*kGChS9U64Hzbr(yl`FGka-Fr;!{v>#)`1S_oJBmfW!6 zk7xdDf>F#&WY2EwL8&|0y9iO6ekzihdKU@)T`XV`0ctrFU}$xOU(JG;J~8#m z^y(6gh@s;eU)F&y5$Nd^+VO-h-j1FloVS%Y)hIbR<%D&uH?OPO&=xvZcOqS}#RSKi z3c%aaX)^UfgyO`&nu@tH-JsObn8a!V&(}EXR;}j6B|O!AwPl)1Wn{c zOs=VWS-?I5{OLk`eDPh$uK?VLkMyqOmjGCBpKjh&Cv$2q=md0PY3DQEfX^?{SfdxS zYa^V&;$l6o8Z-%Au<^Z2uS_?M3G{}963#@gpmR>*PVHn=;R&QKL@}sxnNW#BQiS;; z;R4|`E3O51_k1;_LjZ6DzV8D9CWqHf!Htu~>Q30BeD;mKc}RrqF;ui06__p*Oj>B5IXf!NeiZ^h$gfW4dAROgVz&8lR(Q z4`dm`qKoftk)LOYbR|_@QEwB77P037S4D8F0!}ZvOSrVyz5ExWk)qCoo>rW}@Vi{f zs$BWr3i4wI%tCf7kq<%#wJSP+KntV|D%?%3?p6^5K?4Fw7GKB@I}qt7x>odOMt?B~ z7dBY=)ASC%V#Wo@@&bw$u9wQay7Gkk63xj9_qB<1?S&HOnr682;H6dJS<8R0)GOaZp}vRmd=K#Jiz}?oVovPjB7)Ax z3AR99PY)3C$}vI`Yx;}&N8q@;z`w+oBFS6CQM%v{6l;;tNjW)4^oJjsXbURRf{L{C zu6>?f*bNcXid{4)4AuvnD9OX`_d$|I-!BvPEYTCN2ZeUTAVu6MlKFhOVQWa$ml$R)D}SZHrf znUpiLGAwf6ts{kwIAkZR6nQriUE|+t)nkS@Hh+LpNAwUPIi<4u`Ayjp8 z@lYcNjdmQC8x9H;Bve?TM&r2v4jTFRmay;uZa|U0i)Kk<8rR9j!w$PkutydFvPtL( zX|I#|m>B-0(&Ipf%~^FKN4nm*DKe%gm)ystf1`}oaxq@Z)p*Smcg-Ysy+qvt+#)es zvJMxh4vb&93at5baw0e$#qiwdzP&LzcO!R48`za`l#O8VH-eLw`^$~syf;%OknrUu zB?q-AxTxXb8!AYsutJT-4G#`#c=$>`wf9C9MHXLgY&U|>-bhA!BRTDjVzoDd*WO5G zdn38+jbgVqlA+!h%qg|V5;H?>>o+SIBIw*ECRIvu@BkEte;YyNHU@Fp;9j4V zP{1uxlGI?M$iYU@gN-H#8%Ys1iX?0lP1tCnura8@hRMQ4(uIv83>!rTHfoA)5>od7 zhnjesR5_x6|59w)6l~<2*@zjkQB&j&c&t01&v#+f!`C0GxDh5PrJNfis-#^z3n`&2 zxMaa5dyans{IjTD2=)n=m}pv^`oPoCHWPlzbwRV5I{5Km~;&0e)~55efqMK{iz}1c{W)3+9xV08S+o@k0@j7+_rd zMe-sYWO9+dz_g*yHGdZTS=0A+4vc6b2Yw<(yr4x$An2rl$^p~}B`#G#l_V1&c>w4` z2@vCkmv{a^FWkskd!r`Wjr=Ccp@O7iGo>96exP>vfy(0t8xOzG2Kd2B!kQ@#+be0PIr1vxKRQpL$TB5Rj`=x-3>CzdX`*@gH+4cu)V?rEwJ0~qv#r%5xt@sX!RoF zM|2=9s1pgf$tDpn<)sTz_%ImtA$VbNVqhyk!NVQ&P0A)+3c+Nev^Zc~93a8mhuTf> zxQi=7Lp$*rM#gI(vJ;!6p)} z5*G2T7xb?9?hM=NRYQZlEkC(VVKR_M%uU0Mn*C%UHCo*@V1K?YmJP5Z23k1 zHj04bYHQ{#= zg#^Ww7X>pDX%vI0%-Wus2K?(?9@+XJx|R`NZ{`*Ve%&t zDiLuL5K!GSXxLsVIuAXozs(yIXuKGx9j{l~jpm2vq(7uWl#jw- zC=*Rn!6tw(%!SbMQmDD!%V*|c>C8)D>%f;=1!p&71`r`lkCo93H`*a;WC4`wraglt0v#vObj@#yk`D)rb}2j7 z0N~CN4j`fE#7;Yg9lqhlEXXhHz$qu^OP4>Di|VZ08e?2-&w_Lu(#Wi~mn*#dC)ZFW zC2D>Q z27bNdN{j--jmhH3=5%ohYPA|a(UL0Vj=N-9^=31Pt1Id(9BxXoCjCRm+t04VqxXCM_ny>-z!?7}>gg*ZcyG51W z@Q;OGC6|#u_$Xhj zOfamN3x0#v*4R_~K)o-E5r|&wgf5AES@vrA(A-}*U&sN4+h_L*3OUn;6^TXegs3pi z(nsya;%EJ1!#}RdWy@+{h9;1q$W&TG%z7`;fFnL6#Q_P502_D=+b})AU-&TTieO_C zCOtx0YItObkV6_C4uP!!er+n&xbcDow^G6!hiYNl-^c<_SwQMMtfGw%bl#`)0$I&Q&37d;FM5Rj# z4Dt|-%`RmTQn|-u4YBBy1>yDrr6Ej@0T5loYKrXL46Cnf5S53t$?PEy6dLbj_K<8y zKt&t2m#iAvfUylAujCeK{g*RTOT5K+q!$9E8^s>l-Ol*NhEF$c9%ka9&Ba+Tzhi-> z@NhqAHzE=HVw6q;xIMIAbOdrT(wSVAn9wK1kfI% zqCkcRBB4+K$Fs1l7$ur1H9TWs#4(Tn@-v09@GTI;0v>}JVd#5{!jl#Z(5wYr@EH2D z*xQKCl!j+0s9}3?L}mbE8(?~Eid`0-&rdf| zeBJa`-UV_1_%w}S1raxz!h)ax;>t_vqY@x^B-!?b;ITA~CdFxXl6&P+5U%MQ_XrU$Jv0jnW)(W=;a*qC6z#wf0&k%I^v zI%YN)n1<<*#|?$Ru?ZA5_ZkH-3y(caCafGS5Sh8MWJ#_T5V<)4k!uKuTuaE~T0$Pz z6y&&BVU3%Yr?^Uf;+hf@vS){uhVUe%>)-eb1|`>H4>e3z990kwUf&6zg(Gf8IO1l6 zBW_+e;!5F2(GuzwNi^K71i>^zM}sM)iKVEvNQp+YTOIHTSo!y}xzs{jIAv zvWev(Ili)Mr-zZfIThyOlo7as-DX+H*bY& zU3<&v<~NWU#I2?GkFLFcbnRWCYi<6NFTqkbGJd9DHe{TEfd2|=Nn1j4i8co(3R7n! zB1_1xPdm^jyHYtxI9+wuc)d+*s@#pYGM>c|rtnlZD#Lhz+)Y5g(>w!)P1wZKRt&{V zD1eTuTB6ZMdTMzg6xe?2Xaxbv9W_XmR(xTGk0QBwQ7(i+t*)su%&?GOpT*l=#wQCK zrdC5Cuu%vdYv@_41GT0w11Ofq^Y99LQ8JIpEBiMOAuD$<6{v^K=@v#t5X;u$Y?5#u zt}HI^JdADrC<7Q9fIQD)1PZ2ww=7~9kim0W;9E#s)DbipKrS)qk72HSVeLJ=hKLiB zz@)uPr+Vncw@RcT$dBfx|D&Bcd@?*^?HO0conEi&@-7%S2H`(NORRKK z$Ra`o1r(_GHB@}uYYm3|=A_x^c8?p)57K}hF&P~^m`8x@ZfGDRMGfgd+j(JsF>9<= z@1cL9GinRX>H=q!<$FH|{(_GjCuQpblv0beinPGD2mG6jbWC{+f^;eD;IzFB_;IWyLMx3heKrEju3?rpX9AMU* zGxw!fvUV_e@y1K?wx}+cE6`wPMQ^Y9kSCembi5V6VUA~X+YXvmx$&VKyzEy_&pR07 z5*9OPfN9}V=@_*%wARAm;fxL4o{qMoYNi!b+OWutOP-F&@_LWxNiZgxD|#2tTzVf|@VI@i1k9 zRrbO=%n^5wL3rt~d~I>(%wbufq^A5_En@hb%Luz45`>nVLTZUG2ZIx&iNBar$2JK> zg?sBbwP+cnkert~!JJA2YY!!VLC^U*f9wooTWuLb0Y`%)e#-F~qA!68s5H)k@N`Vg za^`+^Vf;l4Xj~~kcf3?Zy-L&7+gGnPo6XJ=s=L{V;!D6+6~L-tQ_CUhoQFtkXxulO zDjB>{hhq-2#LHRGrCboqKEeIa+kCO%xASUB=H7ARZh-L`W!4W#0-b}wRW(Dfd@v71 z7>ruTc>4Cw10L=UiougV!wLZ%&|w_W12xs34>mZ?zyGG@4gVIbD2^P(&{CclA`zqk zV`p>a!!&@|0DT%$GvadsGy>YU9uDs8)IQ+}frPG)#77)8IVG6P_ zXZ{>>>MU1LoI1dsktQZIz}rkW6c9sk5thjsF8?qTIGveFM-Yr8Sipl723 zpQr>P~47;3$BbJ+!u2yh{K;L8YY&-tWrNaQ{ zIbPAcT=0FQ=iFdA{T)~e9F2kZRw~%s5w&;%+djvi&tYikmR?-@ap(g&6EriiX(p*^ z=M(af1z zj}z!^=q@V8%S%WEnix&RIw%}=JRtlqFn6FiM8Cq=faK~s-Zqit(8p2X#n1KheWgufi`dU2cJ8=Q|iAh9MS_4LDPhwgw#?EHG4UWraM>Za)ATw%0r?JMAhT~ zU=+@=8+M!qbf$9?BtfdWbk6L+&IPjrJ9rrx{=7mi99yEiwgvUC?0&n`Sj9VgySsWlN3$mG91JS^k?@t5KM503VM z|3CcVB`Ns*oAdt#{co%_UnY+S_J6yFu-UWw|LFDp)Bf+P{9e8K=Eo47hiKBPSMbkq z-nYBm{sb2Eou>0r@=mzGE1vA7gJv$xO$V@raf%64|5Gp&&TqsnZ0G8?)#^5)4O#@Wy+7l@s1q`m!OJGKUA6(wfEy*%efkd zL>vDx-Ft#oVOSL7$a_#C$h`}rRT3l^bmPOWejTopH8Rh*35SN8i@3aW7s%zHgqDk?R4482V}IK2+>+i#Mr7<09b*Fl@!7u z!(FsfTA*R|N(C)aI^(lRbJ%W-+OTh`RIEXP#loekQn|oKAKz7tIIT7;ef`fADWgPH z+qEOzUn=NNl6yig2kFkvj*-Xk_|o(4cC$9HsMKr$~}AIHdx;lh$| z%r98Vm&7Rpn+%;d{A}>bICu-$Wji3lF~hHzX~wBq%r~F8r_M6D#9;%pve|98uCtk< zSJ6)NKzrfsN|Z+PuyDw(wv*5UW9wL)f2@>p2OkB@{A3yj7d|CGq9#wJfN~xEgmLZH z8yMgTz0?Q=zyY$E?x>nm!N1cj!NH4F@;7yH5rP$;AcND|It zWa2xg=}ub5-DdZL`*(1D9JX7-#u%ON*(pkP5g&WgYgS6bwBH{O&)xT1c#|iMrq`^b zR6Fj%ax~!}S*0ngv^qPfyk6^_qp-Ep>P&!1>2{h8e9T2gV%;7q5`$E<=A5`XV`~^TCvaSB-bGO}UpEO{pE(Gi!?QXw%l>;LgEdcMTKY}kK zzp6jB3s#@j9jn3yZG{S|Y4WGtzc|0sUgs?^qUJfnubzq4!YL{Vo3n_b6%fJA6$*iC z`i5QY*D$NL9qyf7__yW!7XC0BkyQmEWTMa+3j-9wc>Kz5j#{v*id7f-K@8-{L~ zpirEs5G~5_h5*~JEKgRX{kV-VcD{3TGy&l;DtyqB>gr%kC;mH9FF`FV+`PZWIh-B&)nm9C;V2r4&cNYFUb-rbFP>LnS z#E7cWB==|n8XAdPUf-kHC>)n3Y>m_PEvD>*e-5AF zCKL81&zh_u&NH$ymjksK+#6N(yS_y##LyP8^)y<#ke?csn4;KBufQA3g z`L7uyu9veW72;`u{~O06#SU>-*XFpO1Erp3Z;2%I{st8qEu;r3faJ z*#NIvm1cu!te7@~^>X`vWrqCU{^|KI7J@IY{_|7xe-8GKp7ejd#xLLh$=#P$0sHa& ze+ZtZ{{I@k;{IQU0kDHRS6?QNht~hSdiMU$(d)e@{g1Emd-bB~ym0VpEh)gFIxX(S z<-L|O)YjeKlPdc=fQlSa?& zOeV$-pSK(T>4&pm{(oje{V(<_p8xY{m@dB5^nZB%@8#zI;oj5!|Ev6d+WcpH9wbZy z#J!6+ic%TyNGc$(6(RVgTjbyCS3Ljm!K90?HUIYxbMOBg9UkmH&Hu0Q;Z=rt{=tcOB;n-nuytWg?$y)@7^M6tXY(|S9bOx;6 z@tZ07et!|*m6`QUknAMhrT22Z<4t$IU;S33=ZxNWT*vL7jK+;&+W~j4KceeB!_MjZ zQM;w^u%LWD#zCtcSl(zp_wgDY))_B?iYu5azA-e5P=vX|cSXHBN(HdCoh8|X!&_1M z5|R@@)5X5OxZAOElv$bAl|(jI(aIP1Sy2@VuUONCx%rwdTT>e2&ggyreB?BGpB<>+ zu+bZR-fbX}26~jQ8zf`}i}Z)9Sd*ZliP7ZtZZn z)CFR^)(!p;NcbXH1}Wdy+j#i!5*h%5MxqqX+Qa61$gpwT>2^k+vGymOQ4g~{fqWaz zpfMbEn&;id&>5T$2Yt6KTjKu>eY_EcDpK{GJ?H-stg%k7qWG;NZbb=b3x>j52QN3h z+C6wxf9=%w-_{S_?tM$)w7AICrIKA;bifEIdOUeQkw-`dr26WG(-60}_zs_H3s&#N zvAn~Jm|U#nt-jytEQZZVr}we{0mfHVtfu`||E=RHZ6$2b)Q9;p+o58!9+N|_=U$-v z8{a~#pzmF^l0Z|Wl_iXUAYCfId}vnzW=T3GKq=fNHlm9aQA4mR|TK*sA|MzqJ|Ng;~ z{Qs-`eh&XngXBK;pQiTjp7sI%#J>{$|8C_cUyJ`g*nORq{~jH_e$xN>DnG&hbAPMZ z?VAUGWSE6iq0?mBnR%(l_;ml|auHpi6&o)O$STi2!)Cy7x>1@?hEz^`AA1pSQUiY$ zM@|D6XMBy>bAGe(yvyIG!EDD*o;DKTYyU$x68=B?Mq>1N(01+pf`t6s{esY8n@rFu z#)MuUpQKqZUP{PAS7{8xV~zo09W{0xmI@CVGf``38OxeaL$A-sz)nV!R{NyWg8-aC z*f45eFiGFpdnp6iq8gM$p&gMCCN>cFmYABMB_OPdz%4ET zC!Q(6S-;h`iXZ{GUK0%hl-7Slc^IuCv5QM2^2!v+?VP&pkyR)SvYG};miXx-N+S^~ zI!1AcR7Q{7fc~hxt)PS$_Dl0EPronoE9U=!*-O9H{=Z&7Jj(6=4|Wfq`2Vl*WB#A} zTZ;ehmKPB+tBUITTwHx>`?7dUQ-m3^&l=EA8IMK8wHQ7qU37e$E z@i*cr7c;Ef$HY&Tj6ho-Yr8je4mS85W)`MaZ% z5pK+C%Zl>p+#RY?*xAbvO2E!X24OaK5nO1=+H$K>tHEFA*N$k8ExgMtTiPyxi#>mD z6bR2mfpKwf3<%G}fDv+U3<%G}fUdqb283@Jlig&pRYG!@s{wC?;OJK4+zP?*tVXsK zf&*0zSt|sGrW&MH2#!Wkd=pONF5mZRJ?W(W>GH4M!V8e?j-SsAI2aVBJ_ zLeOQkXm*Gh9g`biMdK@jZ;h^k!IeR`hE~DI%Ai~0s$f`U(8Zv7@My7I+CpoL6ra3O z(pPQiV(Ep!YP}$4ht2fj6(nIWNpM=sbIFAhSeZ7E)48;)geFxDE6YgnZ@k6YPb5o0 z2c~m;?I9skwYaKB;evRVAQaZf0r8Icjj4xR4-jo{K{5Sw2l&4oWB|ndD7-rk{08!g zPy|>AF(ogV5;_}rCmdlcJ?11)p6rPCG#z{<+Brd^FFTHloCVrP3esO$=jT{!JhK)O z6j;K*@veeB(f;c?fRymQJ(Oz}qj_z<7Ut}J*Kq3J9XmTav}RX?>;qzhgJUPs8JBcoYl| zpuK#$1(9o7%DZKemEh>W`5!Ws&#mQ%(Ze7b5{?)W1j+~*z33Vc5Agmk<>EtEhZgzjFQWuc!aDyLXV&|2llS|M69RhO~$~{kQ*YBlPL_kNlO~|NNo^ z;DPzSzh7|w#O`&<{%i@I>h;i9`w`}%&JL#=4$B~hFz@ZC?OGBXHRUL^=3V{yM_sn*@92=@|Uvv zC_*%Oh7VI+`1+kLFHxmoiOG&p&eCG$%A_~5KZ@rs-=cEs74I=cvD98{E|9IQq=6*1 zM=;x=OQ-5+OuYWMO#)ZrkwJdj68BsZB@yJ6NGZO)Ncr(wY782Kp#l3c{2?Uy zVRGKGmN3V~v@}I-KC;Pu&=LfTZ^gJR%{g*6zEc_dP;dEa0jq@D& zK>3p*@6$T}&%4fd`qmQ9-k-U;L+r87&snFr+p#B|Zkt}O_wIz&NRd@-v8#Tb&}2iU zkQ4@3B2;kK^EtnfJqzNUE7(CtPKSp@8bv!=uZy}*93o@=Xc$k@ZGM9qXCnAfeHP~_ zLdiBC^&$PdkgJ`DvKzvs`>yGih@)^39Yyr;8w+Eo_Cg-jNX3{Z(FMOF?TYRM_5b^ZVJY037iumVj5MOKvxDkuC2Co*!8le5OBzfcB1`4yQ+U@`MqIm^&8Q#B8c z4koEk8d5!oGme|U)W30*Th_2JP*k)yP*lfM3L-Tkr4>YaD)JS!eC;ertuq;;)<>%` zY8b;x)^MXcSJW@p!3-_xJZ#06by{Rk8Y3oAY&?uK#q#lt?)_2mj0VZ}F~Nl7^Cxt5 zt{wi_x>{82-mcdAKLtH)TvUFPc$^8%iDC?~mlEHLr&lBm0w0n49h1f|-A}MngE?>< zOht(K#01viY{%*2vyYn~A%;pu@SH1PJn>RSBzPnuN19-X%Vq?aE+UAHddD(%M!^-c zxCB6l){7aYOoiAcWo2M=cM(a@I^c*@8JqY%rI8nsOXm)_MAV%|wjjBZ#e zNrIkS`Y=Hj+dfVx!Q^7pST{=Q&H)=?Ysqi#?WXfu&275r3!In_ev!6eB9{?owm{zF71|kdZnmS3j4$;IhMr`gUCB%|F{#G z0{MzE`gZ2s2FvwQ>Rtnzh__6|d{5xZTaybPfNUIY8`$FS@c$1~5_T@FE)m0uLa0(P+-T`5P8#W!pu|qd2cYSbSm6uS&eb|5)pBn}8;0eURi2YcUx){rSH2Lv(E{h+;_I3C1gU}j39;)owtwqS zao@S}<7JQ_GjC-u#wdGs6k0`$2qyjz@egc#k_Fo6W$f&uk5ntNdCSx~k#vzZIZsTS z&pO1Ua{?4CVbdx}-z&XI@>z;$YRO*&_-;C^*8^22dchr*twby>i1OO0;g!LyZM|p0 z0ro7~gnqsepHZBe&{kKftrcGFGu4!=f+W+G$!xu{D+GW&QFl!nD;0xm+V}{Eg{+1P z{tJx`#AFgBbFpq(F@glRlsm_0vkqPmqPN;39IbeR2PPuw|EJKO;KRKT9Vor;;Sn>Nn_FPE_1)JyP6M_)^uAmNHV3#f z_+BU-(CIq#HgrjN$vOzgF$p;bdVL^9;u>rw3*6jq{O7Rz!!+L^5@wx@TlE#qjRm!q z4{Gx6hY2PoAuGw!djA90U#6~r@q zk88ceTQJZqijlQuh>QLGNm>2PMi5x5*%VT z5lL~JwY*l$CdX{6D9CJPI8AehY@%})Wy)cM zOsU?EQEkm=-&22!*>-dbTVW`|{mTTQJV@IK>oEkE%VUyTikhdE z_Ylj+(#oPu)XyQG<10Ug%?DY|#T(Ty%6=zlsx{PL_{I{L+yJ=+kf5}?f$@Ea}WsPN$f38pQC&kwoSgAr4jNJ)G4C1MWoibpVnqbt)nU5 zV{8Nb>`gWwaM3pMf2jHwRsncG|L<^bH>>}5_f;d-9pS%+>AVP>t`|7Jxgz)P zfgbzU-i5!|2^VCLH@%KxSZV=7x_<91Qtu{!#@`A3^tX85dvAAl?-l&pJK78D9$LLUv}Czt`u4kKVq*!a=FWa@>8OkV|dVfFIE z=E8?5JzW4N7}FAcfosVPtkYxwf!>M0U_V-jH{stY7(`JpmM_!fK#58!CGyU~pYv(} zT;z%!F-jTOc>#kpT5=;~e|&iys4;I0MdH^NS3#wTTEm7Z$bfQuv2H`1~7*Jd8Fn z12>c8`3enCSe`Dn5d%I3$=X{SLl;yhXlXSe=wv|>V%0hrG^IqzQW!N7y0GSifNh7z zfgChJrxkYLO|LIwJW*ndX|#xJ41#0=q5Uw3l(Dfa7`Q<;^41=-1iP~a(1xCQ=Hm+V zlaQ43lYmY`0G@D34K5=4&l5+m0uD2*NL&R(klHT9V?8nCm!gGl>x=C;gV@K-1FS0^ zP~sHL4@E?jks>2AQf1?l;S804B5Yz{YUN=XGUh1i3Skw%l0Ipj{R?WH{hv@e6NjL* zVr9-i#d4L|r|QivFI+_%PqBEZBR@lqN{6&pYW`}FZ^L-uut1R8)Y{fh)}csEi2Mke z&!8aveDb-}bBPx)LD?-0ZJ{ME^<+%?7yT9N|8O1qiu=F%(Qdt-+yCu9-T(h8KcW9E zI$cmtTd@ZZ-szM|$+-0MFF@69{MZhD(hmPuT&Mp}X@|q|f{zv0n|BHMQWw1n4FM=H ztcPFdxt2n;UOw{lfepp#R_C-c5@186+8s2SZ2^9Ri~swP<8)6P=OcVi;M*KJjyte2 z9-Q}@A}LeJ8n}khu+IwNdj|Zt+vt6$2)oRfMJkjHAX(G|*``4Z9&8uL-XrU$&2PVT ztX$u>KUH!zoV)Et>-aMncScjv#t3M12k#pdHtxKCpLWc{G9l!pg2Y>d>!rb6A!K#s zS&%6Z$%O@(1(!+*h9Q@+x4N<*Fl_wTf)L+oLy+uS5YmISAnVmClg_P~edz@P;zZ?m zG*76^hd}8Z1P7$t9;(xnZPxpkMlss4g|Y0j76j^s$TNI#R-Q)Lx~7p?YI$6!G=;9fl6#U zg-4T^DXON5WGG27152*CyprpO*;LRR-ii)6fuyL^xpu-PuQ2&b1S1sZ1e8+1OR}j6 zfz8lxo1G3zbnx(rf!NxsRUE<4K@*-+k92=tIo!MXhM(9iZ*+A--(X=KjdZpMF6=uf zXUCJ~`H*z={?o~+l>Vn9^^7zggfA~9({(&qdbd?lmp<$CPRA2i`TD~VzuRP>K#?4L zz6l9NNVFNCaz@4eDu!5LN}6Rr091>~$m!uYSh-Gg_{)|as^8Ujq%d*0 z0?sKG*Ve=>qG*)@>xjf^j#{N|W08l~XhHMS6X~x^;Tp4)By) z&fouT>XX>&#amlQUT_d`otU{U-h|sFl-kEMW|04*sm3fU> zjK4EywYBx`hkFtej6!K*oYsA5DAuAp4Z(ojmx|&C%2VO$+>?f4VD4!eViEuT_!d&D zQ+c_Fue~n~#WdYhF5*T1{-cYhxUcf!QIhwiq4>4(G>93$FAcR~m#0Cyg8S0AeZ&|5 zUK^93GYuj|it^cn52;-t^Mq5jxBwU}5Xfh3g9F*x)4oYN~q1&opDtuCkfcx(L1)g7}{;%XV0utmwoXv(w zQx?kOEemCGk%Q7q&q8_bW}!S1v(Vd2(WE*OY;|NwMAyDEgG6E~NbU`NZ-%D(%}W8q zpp(uTO9qu{uUeZQSehYtYy~Pc;4NdJEk-G&E7sV7vKf<84}j_R>f(+fs~A) zYNu4Ishc00DXPPy^hbk~!h;Nr@Nids8xr#62nTvVCt#w~rhtxOm^oYYCE) zTSFz!T(h=GTeayHGSN!bhH2}i?^i#c=G<#Lgk%+XGYY4$b#@B8Kmiaq<>YQDm8x<1 z_(-o7@ikw)6r+gIN$5FEbsbnlmT`6D;%GH*jvz{T%NB9xnxc%Kku}S8hC!H+F8!}0 zOb${er!+ayCb{GkZ7XN3WYgv1$_>nv`V*3ZQaqnLzh{uiv}95$Elv#AiK4{JOT2{~ zRjHxVg7Hx>I_$Awfb45vahzr2PXE~LciV2W-5b#n3kj+4 z&SWqXnlY%xyupJM6#jc@VBDe{u+lH-&P4i7^FM=fkfoA;wq6FQ^8wGHesc|fe}5Z$ zcTkI~oeeNwvFrY1iz{39zdJpOgD0~9+1R4~|$y3YIhIFmc=xe7x zS?y5o(Ud_ubsmfAFDQy6)gV@Y!*O9~E~&_^cC+ga+Rcf3K0vi0eS~A$P;g#MCc$zw znOp#4xb(h{Vpb!15H$!Niz*I>A4ZOnM-~7OAD2BK;v?XMr$>jXs#7bh{Z@%pMsy4Dwe*;}qR-+oVx6$nEjk?=tWEC%8@vW-XC@UHi_iD9~OgA$!9>&#u^B}G@ zHtxl?2FF8~k1WAM!^5t6(WtO1Ts#=E70r(UvvT>aH!GCuaib2FVnRtz8|ODAFG!;z zko)0e*fzBVP(_kd)W}BlrJurLd5w!HJ{ix4(y&|gr|HhsmT7@nqLF1@Z9_YaQg1Oq zi|4pGd}oBvYiore38W4T%4FroGTaQNXYMJG5&7jg*;oZtk}96ns!GGIm;`IHC`N5w z7<$$Asl75kFXMXi?4Y8ceJ0I|3|w=Pwzi{ zm7kFR%TAY4tu*MxH!tnIemqt{T{(d4@v+FS0gm|}(lS{V#8HD{$a-n~3 zxscmA?KQfV1W1E^_Onp(X0AsDr^Ub*cY}7E^Mo!b(oH9EUx@B8G8)EJmwh}3N;PQ@ zht`cf**JV#5imNv5zQfvHsjYPu=HpX&B3ck2_)7`oRCxdp* zmi;D*uYYG@x$V=Bghq)?`GpK&tOt$WJH2zrY!$)A7YbFQ(VJYM8I&0ii0lEJgZGeQ zyjl2;t|Q^Cz(9mUddI9_d>EI)^coSrj3Ee$cp&2&r*09qf@j4Xq;8YOsDIXJ z7Tnvwrh_ymUK%ZfsdaCoFkb#?F&KSm#P$PfWIAk1-9z@h@jjiRP(-stOABsCKWPnknV{6WMuN?JQ+SD74c=$x#}5MWq8~>IB>R+b z*7Aurvhs!!)YSxgV;jJ8yxZ|DWWN}n9aqRVMP1DLKPnjL_BQG_O3>9vG?V{j&2)NQOM znAoSNG|v?yf#RPM>r3+H0*|ktk;s z?-*+Q0nWi04p*6Zv7uf*SRCJ@T7|FJpmTkO?}FVg=#E;z)0h0)Hv~iZARv;f9(myl z`V*^a3DD=|eu_>TXqQDbys0k>PjE}~gFwa>`A;CV%}Lx1t3UNM>MTkxcg)<;C>@l` zt)$uw8SP7Pbx87goKuLkpSA@V+`~+zHE?nQ>L;3zw!zW<);+hQ3>L zxUW7APZuw3obuO$eob*V+!)=(gPeq!vLqKQd#*5X5LRnu;@@xRzx`K!X}ZHNYa8#= z5k7jNc*4ew87nF8Ap|>X!7`Z}_h#4fyql?Lm#2PT+ehk?U!nTRUjn12zJz~WbGLlI%R=Yo>-|71t^34bE|C>es$XjCn&>6vga~cc9;(hl|ew+Au>QA-pM*kBV zY}^v#c)0l^6>TO>*%%5I>&Y4Z9KhcV0dAM6mrD-a6%NI)Cf|!AX|feoC`#aoF8;l( z)FGK*k4~Yx2*Dq9uf2!GmO>L^RKGI-Q&*J<5w_Pgp0J<4(22XdFVaH^1{RnK$%oo_ z`J4$S>DoApxI>(0Z)QnY?fK-h&STvbGm9WdoRgzoSJD z4R=W6q1`E_(=;ne2u6RL_9JccA#y#WptMcI{@4RVn>nDn!lHWI$NXkV9cT7p7>6B) zWE-Ykh^dqbI9OM~^`;vRSP_ZnL0Gg9#rMQ!oI4F85jx=+zk~iIID-*luT>a@SzLsr zJ+f&pS7>H3N0nj3Ii0?xGIm9qvz)&KL2xC>T17ps>`nbP`wqix|7RLS#An5^R_{mP zWf7BY0vFR5!4KBvT^~^hKg3Cz1n1?)>PeGC%`>4*PK3hSIx^urnWSXB)MK$ykyIxv z;pqpsat?O0y{S_^m$k&+RGS#F2Rm-Q&sMpUQQRS(J|~1kBwUT7lj5Y1ZISha5c#r%vUBVHa927s?2YO6@HX=N9qJ`~Fbv`W0 zx!7IUcmy**l%A2;Lt^jenZgB>8hKv75y;eKh8eX-IZrUkO9MT7I;SGuKi`Tk$fw?w zlNS?cFTI2v2#hW92FBi!=x(8UP6?{&(XuZ}H5JG~%a4 zxtKz@g^Y9?k()D38XM}@SsFia6GGp+-hxUmc>V}_DOf0Es=sT+z^#di@YpE!>G|*O z{3{xBfZ;%T&Cl)Tb4Ky$qqeYX;G^{Mdu5)~xo2dwf|b*r_^hRuFZ47<3Xc?twdIz$ z>SXBA1xe>B$W+wumivGQ4mH<2K1eP&rESf%1@|PLI5xzsQ6$8P46Zon)=u|;^m=$K zV09wVaX*3V2fg*R&NI6D#m(*Z@$k8={@S

2Zv(mZ{-U?l#S6xXKpZ#PHYAw`UG~ zzomIer1Yn-bOFXClRi#=nYyF*lmoNZrjlWV`! z(rkawn#Sr>uz@5r@@qziQZJNhV?LGYYA}(VnNN0~t*7g6>>{r=U5;TVq_nhZ0FNA{ z=%(p*q-K3M4|Ts-{CdMs1AckKl>D#o18#BXwjw-kP|3LK(h-0`q{Et(%|hRdRx*5X z`omx{O-~acaDn_ANV`&M2~xSpvj^gtBZXwI;vTPFq(hby9tzgQP6p(m%;ZskH1%$} z4B#Iwkl6|KLoiBY?~rR|p&i*NW%Wtgzfm5J?E_fBYyzMQiHm=Ofm4YY;CIQg*lK=(N zyrIbIV_3${IjQBoig?{u-84Cy2*4suThuma(zY$B zuGeV#a3(T94Y^o}6vh0sf;A^hrt>OI7y>ZKY&q`NYOddkm_ifx;N>C~1gPcpI2F(T|O^EZDZvk*=4gQI9}n-|58iobZ5Pr!)Fj!uP|he^0hF<)xdnt>1bl|EyQ!^1{}dX9EpOS|#_9 zL9#MnKO`P#1jYtk=0>-#l)Zj|%wum%R{}FpH3~zc5sh5s@iS8d`8aQfJUlz8NVS(t z!cI~OQU)x*Q3ebooV*o|ZjesiFE0Qcy{{dV`X; zvBD3Px^_~H7B#4zFjU3=^N<1ee-D9`fcIsbg3wIc-Ih^UIS4d|+LUf*$~0$vTRM$_ zWpDc&FZO&qt#5j$)8S9L)hNt^7i}!|@`@F0BfhUs%B}3yjN6*l*0}Ki2%ARO z^flP8&A?&30+}Ps929%QL0e8>KqFza|F=m&3L07V>wlYKY@m@P8viv*Qxyj8nzc}W z&)LzzaWe0Q-1gKf#&Ze1nJ1u2iIi2}o(sez?W!oa?CZ`RvJ(G&^{LcCt_4xG*fvsh z$=>GL=CRFA-QHgpkXj=>nftfo=2h+ZA6RR%{MbeimfTOo9v!9hb z!lf6@0IvX%pSVF@s}O2`3`ceOu+|Jsp=y-V81fxHuRPt;-)fDx&h)|Fkgp^r{gVSY z7Xr+uMFzjbibfp5Y@2fySCJ`H>npy@&cfvFui&HYu~P1XT_wF5%Vee0#?4F$(U0+! z<;~`E;k7^Xo*j+Vm%9b9kzmz+8V)SEX_Q|m4x8#Z$cnPhJ2M2Z#Rn#bL8T5(A}yG+ zWtx7dbtoyjf9W2+xW><@{iQQBVlsQyDza;m#>gKoLnn7S>spned4BKT!aSRTKEt;z zEQ!{u^c6c@be#fe`3Sw|kckmX1$(aQRm83K_!*K*9hF=@eX~_F2~BC)kAHDfm|cb* zog!C>{?Z5HH@5tp2;b(mRyl+U39KqL7Z$62td!|_c*`b`8AG(p=vr;6n8$0@gsf&r znx$gaB^&*<#XQ{kPdkrtHHHvj##2_tD0Ts>FUCqMMamHFQhv$?QkioH?QP|>=$3FY z`e-b*pyJv#52ceSn+>%&+-pt>#^}=ZEJU94m_%U_8iCFD3>*u6-WAoF#cP$X4^*wk$IjW|cYyKB;K0nw_y$y{x1vL(sybJiXE+33(7zW0DD+fwCwkQ%vpm zRk@}a#4VOe;T+6veDQD^azCjUJU%PbWA=#%ID?1C&oXS$X=%p{j8zY2wI&~N&*A^+hUWt-D6Pz_ z^i7Yjr=YG(w~A*rV1tvPa41u-IzTbR1lqHK@GoS#)0&4eOVv(t8+?|1He>h*bi(dY z4N5lyb>?pI@PjN_dW@y;XyZL(tiB8A*!)QY=#CXHGMx`Y)=fxfaE;j&o8#lz%Wv!h zvB7{wfZ8pwzrq;x!CCXghPmgI&%Sr)kfCe#P_TjP@})c;6YA(3yt4OYT86QgM?odL zlo(LrbKJ;VCM7B;DTfm8HgURCZK{PB^LJDnTM2Hy)-z3FG(q7^pHd;)3P}WTxG-iY zi8VR(-bPF8WTZ2|FO7p_Yc6iP{`dzV@KdtvAyQuySI9pksHuKDQ{m zKq6$-5DS(wq(6!A%*ZFf%G{$@z#LaYlz1)gG9`cLP6RG14HZpN)i`{11^cgJ2FJjv zSZLHN{+?Y3TGF8%OW6+v=q_i9JCZufhNjjA?_Q2>+#vO(@OfyectI!$d=ulG>Ab^`hh&FY)k{=*%)KXsJT~$(vSqF|x zho${KPnU37q6(t*j8ls0dI9(;Kau_8gB%8cK?w3~*S%!tsJEJw-CEJ2)L@-&BN)%Y zhHx5idAT{1R_Nf%(#G3vQVEh~MK|-MWyq-DClLl`>tZ==M@{S1QqKZk_bDNKnJ3|U zDyxUPr9TYvrV3<9FxNCXExBA>@Q?q}E|MBp+B)5vb_vt8=)JT4iV8r2u6v!yOfVQdhwkU$(G?bnZ}Av!3!R%!TO6yCv7~SZ&XV4>!>YH1d9AM zPa(vg71M(h-1bh0rYF-XWcont&@FN1Zg}**glHj2g^eZ|!FvkMp_dmoF3gV%bAMib z!Mr$Ndx{MpE{%?g2xdybhWrNwyj#oB;-*Q7l(SS!$i)IHBTPfgqQERYA-sx}D>91p zH6n=hwC0ywdN+kf#K;z_ncADl4gmD0o)OuLN8in(usF;-RrRcCp+5kMfo?}jaG8Ts zwh$x__eG-@5*$-)wM0+KIIvc=`BZiCrg9~OQ5{~t#_HuPX19_DH>XNCU|@ONZ8sDR zv>OAjcnJn68YLWL)MH><2IQb?w-&vwJ*<`)q(@CKs%iaZnT8$%1H3*MQY~`VJnOX2 za<0Jzs^Jk1Hxo}y&@Z{yk4PPWj&?MFB5+7#x59pF%Srm*Nf~i;Si|Z!B1kBDonAPI zod#&jy<2$lU@f0Z0c5oPKNE{^VjWppx?V~JHFZ65366uhfThZ0LZcsCRe7R~yF?Be zLJd1C63k(EYO~dF9aGR0b@4aMQQuc^%TVwn;w3M;9%Dn$q4)q;`XS*^bO^x18C>9~ zA*8I~dwnmF!-_lk0#RP)tf7-FSq5B*cS$)>SSDORRY`#mvp7EA1+&A=Dq%gU2lUHc zve8i5tFoT-&x7WEzZq4-o#y_2Kv@h7pfq1ryZ_YN|I?Z~+5e>ZmuLyEJWG0imF}3J z)43pnH$u;&_1%^AE&%Oh`|Z+|9rP7n!2Mwf*)R2xo)%#=PPiEl+5J2d9x7R5XVIeM zpZkP+-;E4JIt3aa3ro64htwAXKSR1eo_S6y+MG)KjUL<=+J6pb?WNi%WKGf#aHw?< zY?Wk-^^3^v1*61^5eyhcKg#IN>AVL{es4Saa)e zGLiwyn6YzUngpKM zRWzdZx!^8Gs$N<-+Xw~jF3TxNFp=gYL~jL4AU;$OOe#JF3K|2c6+Nm>Ca6OM=x(wy zofaKSKAHxOl!`X|%(v?nSvCR&4MY-0$5g9&9b_CC_@)U~Icy}86RzP+`k#1?6O+^F zpu`V$&cLrL4Sd&jRmvj>~lWubFz)r7pwpO!DEE@C2xc zOmx;8g24o4UNSki1PTfBetBeaG#EIkLx|@vSc+!=tb`a5q|-3+FIlOt7MA*e&N`wF zf#v!D2gSawga8MjK5vJB_dy6G3E1%<2xFE27UVuYlmG`%p*F8P5ncrbd@4*tEXmsl z5QD^iwS(UZf0jX&lN6{VsnE#K#*xPdVIY+t+94E(M2Xz|(fk<^(4>%~_)=0xumqJO z4E!`BcFIXoFOsRoqK~fsYE4AZY?|Ton2+A<&^u zsBI%p$12X8u&I!Gb0+D^Du^C8yiDQFp7||u@@x?mj2|ROT) zZ&ps6d4@1Rii@%F#}xTo@N7Uhhxj;veo}#l8bb^C|3*wJnpP4imT+W2^%)<}Ur&w- zqzh$0bNR5%efN}!iMp9ptK+-%w=b_LrpGoxqZi<<7wRGZqx8>*mx782u8=m73Kif@ zx7=;SQ=)VKw64=_WFi4H#b>sa0lg|I2(Ax~arS!~R*JeQTv~gF`j%U; z5S*ftNsyOPTU!V(PKRM$wDpcrpGJAu@g4eaVy2#)7mxIg*Kl{DN!L}U1{M-d(Z{xID86GBQM?yhs(qbRhnaJNHzO5gl$#mtBAXT=boA(sQPxf)y|G@ zfH72Ee`FL zcj{rLsMqUNKu*2>M&GwrtGd}U)E^=g1w0|*2b^_+#!%B_Dcud!s8?b(nW(FTQqC)Q zX1k7Mfm5gT4P*eVFl^PJY92j zN?bd*zJi{6?9|DYuT9XTV-d5pDu{m}`_%Uwh}5@e<|qewS?+WDRMM2lJ6GwZQ-Ig4 zj#}lNCC`m}(xFx6rHX?y)W&CT<(pM1C;V3L7|pf)XI9-mMxvJ_i|^=32s~NsDU~0b zpqgI07p#RSFC$RoYXgR4IMQt~o9x$49zaq(oK67a5gl<`-U(+R4TTe0+K7qQP+!gMCi(+8yUe}h37j>&K45c|%sxOAb{e!n8g`pF>R5oy=b!(0?F=#_hrALeq>T#q(G zrYrevh~_!946KB-Tlb%1t}b6tGweLu@6DQp$Qz>15e=FzyW+D2e>v~Y+>$sb+O`Hx zgH%3Mue!Xji4rkA@Ot7a0V=? zF*SmFDWDpTp^ToSoTPlb9~)I}nmNBuAtis1Ms`l-Nn*@Btli$6GA$yFc#_m@SsxY} z4d5y2)m~2l7zJY9K5TkiwN`yep}}Bz&`ztpwMUrYu@6m5Tf(u&R>Om(Cuy0W#f_0S zXJ!|y1sw{XU&9LwS>`0Wc<{$me-*eyFyH8xG^O^NIxiUT-?}JpZKgtpBlr#sqP( z=xErKVN!qZPMyqiKOJ15IfwA^pBwladZNl8yjZslFK@H6@x@1pJ2|xg3>J>)yHmaw zsM#nt+-!BIrOja^Sd!(f>5XLdN4j|+@I=z~$AX)Wqdk9KZ;Ewq$7|-OviNR{%{;c# zCkui)*Ezc=iCfDZ7)Js82OuZz8ZzQ~&n%2)oQe1LrIg#Nd5w*m-$r_SZ>(FeK8oo- zB=}Jnp&>zO-Pkh&TcT)J_0Od0fYVq~FyFNcQ$5;=vZ>Rw--UuFW&pEFmAACjN< z>^?H-z}(2_Zx3AJ3Cr#}`dT*|-X(Nl=J2TCPiX=4C6&0>8wT^k0_onj{!{l>K{>p~ zn$Acvt*TQBEM2Q6*XcJuIjf-SB3b7Az3`+Ao8WOiZ?RPA;7ZTd-{r(U35<;i-&yvT zGfA&U>1}*^b_o|KghgAe7Af|VNIqhQw(tbg!Q#I-+is}ZdW4&9k(OR_>CKk~M6^eH z6eojrCQ1ivLndcBV2j6;Mj^mhzWMp9m{ zM+=p@&YLb&5q1q}X`m{EU%@z?TODr%Ukci?{ky=Tn3fB<)DL1o-mH{8&K^hfZh#q?Ovc8UAO4!d2t8cr7Q52)EAn(=JY$$!tZ&(V) zUH}zeeZHvT+1a`bB_kOGJ=t5kf7A zJZ>0K6b+};dpRcTu~`*1PtQStZm#cieti)PzH)}Ftu;=rt8u<#VB;@MY3(%$~&QYDwChFglMV=M#oV%cT!~Si?ig+e2-ge&; zSo*x(Juct*HR;WO(LTwae5tXZ#}hLj)&stzwUrY@E^;2WYshN=aO}cBYQjR zciqez*|W-Bd;t$tBwI%cpf?{nHmoSG6Xyv z4&fMQ_VUvCWs8EBF5Z_9<3JHGP>836< zOUU;dK3UL54ojCgvx|B_}K{nDV9{28^2@Flsj3r<%0PqUL_Tk84H+b9mrF1wcAG zrq7c$3?)tMgkv!5YlvNxe+zVxPf7rsvaNhFG04pm;pW1|hk!IbI6yL_)X=Ffrh84# z;Pi>@6*hp9clA8KoitSm3~i|?5~o`y?CegYv9~j?zRxVX;{mf2CE7_pO6+nrey@gVo+^!IT{{j@|zYKFtNVi z1w_w~OI<2wl7z53jR$-k*(G^Tsl<=;K~%s62kqWp%=j+N6v%LJ7fBOCk_NfZDKK(N zR+vxN&(3S}>KxojrUbWX8kCI;rd7u~7_cw5Zty7AhK~JsEaE8f=vN6Ww>n8FlL@A8 zN8<#G4=A7Mll&na?2&T!n+OTay}x5Wt8Zn$uQg9dg3@hOaV0xUNVSqM9d0iBbL>_! zxZ349W2Xj!P-7>jpPxxvIVtDt5LU@g_qw#vXUDMhK+K@({hM^eWc#8=8cn!{Nb-iT zvup>`?&Bd7Zu6^B3KP?Hor_<~c0a2!WH!rvZPGIrK@rVHSWbVxX8F{Z3v1xoNC%f-STO|235fp=@ zmH4F`?Iii|imf*`;Y$xUP=R6PSX4uDAV(&q6Rmez_Uo5Os4dm>kwGyV<13a7gmDBZTeHX6NJn?!~QYw5grgH#|E`&Yn;ZhfiOgvaU?v} z1uand3$YN4!%A59e*|56@5^EUo4lNcW`GNtrotUR=D8>UslRbWom4yZmw1NV&r8?o?si|^ zbe*a|$f&XKve2qnUSu{#njR+b*NS=!uR}6_vnqRgN^zc=bQRJzKi8l~DT5^NFR=@( z{u7dn&2SgcHCWVRI1Je|u7r3Z%iNVKnf^3iK}9@xmm#4tr3+5*Kxf>S22KZ@y1B6U zDMz_w^B*A2|8Pt0GLw&WKlu?%czo{GC(&)`I=e&Zv1I@m?uK5%8?@t0<-0VAsyNc| zhirq;BanFd#0j8uqi8l*h%{h%!WQ!YIU*NsSRE^SSRrhx6l%&2RzSv~r*#bGN&z-u zATLlrXH=kEJGsrK>|rVQQ&_1hC#8^HP_~Ns(g>U&a%I;Y;QIMO<#UfF%oX>HB-% zRhlIBtwKe?3Mr}R1W&XDkG`Kt)vmqG_yY}(a(hFcA8G50L0F)nhhB)}?G6?gQEJo( zo}$-pyVb__o};f#t+azF2KKTf6ZCuRO~6PDPO_}VG)eQiFr9|TDdMcPz@|jJ3Khql zHZpAVa9Yze#@)j)nt7}7WzmY*FdH0u%+4^g7He#O40`e`ic=?1J1z_g0a@`tzh+I& z&UZ5FN}9PYuPSX(HtFVu2GR`W-^mb^G@S-^W^Be@g2WE=QluLj+Pr^YBscn5Ozf`c z%c3jkF*o$J@F((;W}op}wnZlJBzWC?=3`8db>i@bdp2(enOuNkS+R+uSy{8=6UZ4I z^}!CY1l+46sg&eO{jR146C}%C2I9>XG4}!vm8Q+0C6M8xBt&OC$Dwphir~=?+0pjH zwyyk4lMqUpW{P&844B2RL@Nos{e{~myK}WkCn$wpW;8;mR5`Uka^XjQS)Ry>e0r!` zpfE-bFv2`!T~iWfZKx?cF8*5#atIr49SyBOND^5WnE4}}t>_N>@(-aEgM9(iL_jJZ zU_n2XjsMCS(YwZ?brlt@7&?u?_%iLRZh9%dT}nlHxY96x1(HRc zp8U*a^A3)jU4sy7>W~`&w$sd%F2gZrL~Sq)@fEJb_yzSC4)E!c-X>?xp&g~Jxce54 zpvJ}be*c7vk02-|Mp7Np66*a@rAvdHO_xa4Y7+l1oPrb0(x4dvR>&pRm?S| zkQZdhF)b$awx6Ze0+zD$9~xE&@oQBi{9*$~zgm*s{ZbDg^-v~*0!-07Q|XSw$ zd16+?J3f@q7KpWXy1n%Kj1F~8yoX+KBYz#~fn>6cjPRjEh#cHUlUP@9t)~4ZH(kUi zY4LX15s;pT^6@&XMrod5j5$Jnb#+2NbG5par1~gONgO8i{5GtzT5HW`k!9RCi zhft1-9WUQ$yAx35jG-kGchlz>^|d*;nxm%@G4sjb#6wezEPowSbWf#X4t2QK&89~S zn~yc%Mu?*c^who}JJ*o{-cMuAJt8$3Y+g~4_NcsuX)peq8`AUvcXU)G?vY4z(%2XU zN0DtyD+nG#%!RV7 zF3A7nb*aT#>C37$U`YAgZRyFl{IwI!bU=SfqxXsN*vQ=5cYVtgw|PwN$sbR4!MMT>$fq#cv+?#b>Wzh+<7R}H=W-fjtMau{ojSD!H zE5tThu_8c@xhUz3JFY9U6RI&zKf0$Iy;G!vwr!8%PwINdf?S!e)K98VvGr(wdYpNf zIRBc)j8F9u{n&mJ`mhry{pxrIejQi-3;H0OJJp&|HRFg|0-NB0fjoqFI)FYGi_^;= zpHazq+~KS@0=(r)E(D+FX_sL{WRlAuUJ1NEu9Fi&_$-GP3EY56yoTAl^6K7YgUl$C*<*N#ucSLvt zxQkO}hAi{V6G$VD5{`5W1}n6#t3Riz?<=pfJUARYcU;;(^oqNczg%pe*Sl<8KTYLj#{J1%Z{;Kx@ z=2z^xwC4Kz_G5T|T%H%&KA*os+r~US`9}uzHNI0sj_!l9j6sfGO%3;5t*x)F^K5u` zeI4B(cs==92ir`Lj=OAcvdWN8Fm3vEAhi(TTb-DoUBrSGLkkrB&QC?-a93|`n>*MH zUGKCc#cc9W=kS!QJWil8d%ogB*iNR`pTAjskk07#^j*)@NP&{6WS7_`S1w(|g+9iH zoVwV&RG;S{BBYl`CymZxTDAL)s*v_}nMtZ5(L)08{q1cIcdwdBB}PAbkO8PioawdR zjOMb8p)})@@5VUnA~pHLBU`Q!z0SZPA^O-gk&j4zc6G&HhDDq*RNL+bSWQwBmtfIoSKn1 z3>z^Ol~X4SJ@Dzt^88{wB_hW4f6WJoA^0 zz}qJPqbYa$!_r!{ZKA4PE!uAqfFnzG=pGQ@2DQ3BD^ImCuCTf&12^=3HIi#?Is{J4 zl9Jp;U0yz#Av9fpSG4*n*pFQ;5ia@X@>A&5F7O}+h5)TU$@M9zvIb}pM$e+ri^VIw z?IChB`tJ&(X72_(3;x9yT&ya7=Nc4=-*#g6=Aq-^lqOp-yU1;xHBX)~%mkBbuGbW= z${z&TF7+rP{x*iVHM(WN{Kk|Z^*skTFEiL%pt{mYV#aIUNrMz zGAC?=Dz;}4e7rqv0$=3J*@uiMNW)O&9Th9K1Y=>y7Rz1n1n1wCG$XmyqKjd$Q?}_j zb!IWE6a``NRBj1e1oJcWbV(EX$LzF?sG2-d2hJm-js%X>P;3|wDv^5y%ki7X&4#Bn;T@=*u5s98_fKJyPsv)k2XuCrJ*cy7My5#7BnZ z#>Ps1*0o2m)%!{#t5_9Lu!fP&uP$LjE?UE2ysJjFS<|8CoQ>fpn`kn=CC5kO>T$1* zFo3YfgHObUA*bX88`yNPFipcU0=+X>gr`8rSP*preR$#8(ir}Da&-Ros{hQwjE5spi8CZUYmOu8@-!COpd|AZn zRrxCu1P0-FuSLxyTe;Gqm;BZlbea#+aui%qIq<3QbTcF+J4hC_>D&jWKW~yBPgbbb{EDIBl`5OHpq73D zg1jyiKZ(x;N~g;$amP1+Kqe2bA^C^3 z`9z#(dV*ocO@cuLg|2dvVI*|vG4LpK8vBGIs{Sve7tx*lsQDGAV-9qp3KnbY4gS6h z*N~W_H*D@v;*bP1WT2(He;=|uTVioUMKfEu`_(~&%<6d57OWv!Tx{1*#?=k3?IX1j zf$-L(M5sTxyTb7$SX>Fz32YIsGF~yqH@gUGw$luSyjhZuzC^(?a}*BmOhVKDbdkX_ zWjE;Ijk^Ekw?6jQEp~WO?QQXlF#n3r59&2w-}Mx{9vq%ek{OlWjq- zYU}@KK!g&lfWIrF2FY_0MP)8@fSKi;MFnl>;a63MsM{zDNR{2T_&*OVhL@QSV+6EG zkRv|HyAFdokUQ?L|_e4{J;cum!BmD=f4iD?oZ2hHJM~CBzJPQ_+Kh<%?uD zfUM?;uJI0Vk-VV z$JcrRA1+mIv5SE=WSR}knzBkG~eQunlSi0f&L>U(g3t+>yO9JQW<5l2|aX0 zj;<4MYu6Z@v^C8>mB@-_RiSnSXU7V`Ig1SsIGVMPbt=jqjGZw~xvl@0+mVH5KC)F} z3=TcaOd9=&*~#r}X=GHXHFdJ4faqfj*fO9pCc#7a5Y|i+pGw}Hh-sfj5Nc>#S?>l@L%3pH@B z{TJiyLd_+i88a-7-f$BRV<|L21aE-zG|&b5{_mIuNs?&``L|P{BKwtO zNf7}Jouizc?Q8L>)X-|!u`5lh89+HP8Pm$Ro&*k5M`rWx(wuOTD2?h{Xm*D{yBEdl zncOptPt=h{)8GuP(A`j#YJ*AhHEw$Y)s!!JlPgRK;s}^F!@H$3-Ll1Z4rG4o;I6N+5{NIiTflB-G5}7Ltl%`8+sFP zwsGH!UJkK;Uecn3SuNH{jFzdgcfgd*f`X_Nzg#`b0(vLGBQKaD$-I#Db%j@PP6xi8$d zdI57T;_iatR{t__pBT4b|K7OZC^2Pp%xB%-blT`^i-4;#eBInopv@DOh_kt+{mSS)k zV=5TyxryxbTW(S$oE@uKJTOPx$Q=@`NweqXePk%UL5Zh!GobTE_rkv?Z9{!5D7gIu zQ5y3E>{1RVu_!NzERUrnc^zPzuO9caymYC78aHI(JauNGTwjtCoJmn)Zk)h&%z`|| zJ;oZ{+&FY^lB)+*Q#@WEoIie&^7`f~pL?+Hpq>4A@<|}qQ;N|K^iFDt*i~o0Y8}oN zTRrfrH8-uGBp2qGBu~gxb*n6f3~f_Or&9`|iBGc(?84c?A8qwnZ61N)y!sMZJeFO|_2G!QYAtpgf!o#?8(i{aH*sGLM@9mOrLU(_egbf5ON{_KNihDRMQq2V){$}_I|ON z0-Me1Hf`rU2#L=*d^)*&I#z{%Zm5kdK3E;@CXB%ykN9eoC$yK21wqNL%aL8L*$?oI zq5S$y2KNVyPN4HOKVNW9x@hx<{(M-pTXtw!QsasQjYL78h*1Fnc+8d7uMPi3hL!MA z^-G9032tgu08AFKYFJ1j77;gEa+$@$;%_$bXV-16{(<=BtnJlu z;spC2A4`7%{#;nSO=IF{)?4~#?4V{=-ADCO{M*amuz@P14* z2~;0doKm)Ei(23YM}JjCi29av?4-|u#+>+vZ$dV`zYES&6pDY^#AnerJ{}mXJD`}j zqN~fgtjU+H3H;hT;4EzCwF$FtiWEzg37URZ?VtRxUwg9qY@&iaZ0s-|gyjr`=f~7l zTO2gyR>Bdj;Xm}IUPhKB%_^9dx!iJs8x1-eRe1)6$Q7-`e@ozjS2e0wMDf+A=$9ze z+lyio{Nw=oPtDz`4VYVn87Y}Y9pj{nkGH(4kRm38(G6{i0NQ=-)KTQX|48C_(*`L0 z;UX{6pIIXAQre%%xxCr$AG`ui!jjSYO2JMBP}?cqwK1EdqbxebW6(O`HCXLACj&Ti zS)UcQf&pk+`^N1j5cN=H>K({U>`r-un%A}6>qk(#ln#T5LmTw4N(TB9(5$iZSgbn< zhynX+m(7kX#+^!uuwx@PU+u%`${15H9D95F_mK8%oPpXYk`#2Pm7Q{J3Zx}xp8;;^ zbrl#y{a`H`Ld)0*vm_?J3zX7s%x>7nR#JFTi*%S|i-Tq|$}J@zkIWL5&a^Ft0QN^` zk`u_$?i~n5czCW$5Ncq9cZ!OY=;}fcUz%zBA}n@xtsR+^6Jjl?#gId5E@n?WLp^tk z04Sh4L;Wau+sVcxdSRV#?3lc2g!T#Z*k@5ms^qySPpXTHn*fJ#$L6Xgdo6aHn}zn8 z#<6VK(l4}-zljO2#8CWeLu^Y5zr%nEb2qVytn`QZIcvYXf3}EVlXm7obPB@_WI41I zfrZ7r-?>Twc9N0=Inwq)+m1%!>=Nq{I8*haY=!?!6^b_&S`n!=D}x~;(@4eoA3+Hn z=8EBtGQPI8EiC<^bA@Ab9Jx4_zD}8%W(vWJQ!VQscBt+h&CeJ9#E55T=`Hn4xlvy8rwNAdwm_aUe;)@KOhJ?l7m#dg36c?`TOJb|PDttK1D!1g~xS1Y{X` zro5UlsX*ZsKqA#iJ-7ndHDDYM^Ln(5-oZ57RxusS++9p20oN_WiIsmUswyJGF zPGv{L)Y=oY)Y{3&oSnkY%!pMdAkAr;GlYvV1c-qM0^4VF5#p}>qW??MqeFnS@wL7_ zv--ui=H2zZ!uw$N@lvCD-%tXkaBsCvM`ui>268ZSm;L+)({xSAe(CGMZY}K{i5?dP z$bg^SW0Z6d4<1~t~nT?#U} zq^YtObs1R%%(O_qlR{KTN0AO$0+=a|fv^w$*TLTQ+RXm6I9W(xE99 z0e%DiD-l-o-YpuY+Qr8=H;k>|KWjgb^VG=@w&n$Om;mqpWnTz{mR6-MIjN$}Rh~?_a|Y-|U_*=a zcLf&IQ3+vDcwFl#nw{s91e$6Pm6Su=+mckx;GS-g*Sg`HRa){H4|}(Vl`Q{o^gvKf zxUk+aCxyo)714^(`=!SDc=7`&QF92H-_AdPKI_e|`GIe7-cYrAvN-%WY409?Vb7^} z_421cYod@Rr~UerRJE8yq7xu`&<5L#kfQJ?R0^u+C85jfCRsIL@>o~a(_RHQPZelS zChkEZTD8HO2HyfxVHm8uc$FSpv~$0$ce2=${nk?J>iXaf)BO@qFCL$jWUsq%YmC6A zR5grQ(Q>-QEGx>x%P)SWlx$E%^B_U(+UOJeGtx@`H}jf*N2m<$if(9ZE6y)N%Mk|n zCJ#+>kyz}Zu>x%xeGMY(hM^05;8+c~m8BV$(8g>Cpqn@3mkzc=p9t{h(oJ@9oXDwm zCxa?N@r_gY6&)SrY~nSIQ)pDjLv_RZ-HmqX)9&&w%0BSZ%~bKn?RdGiC@|FQ!d?`} z2MsZ1rW%8EBHg>^ozWN+k?r*slq~lukFC3_gS(a>=PS6A&54ipV4Sf|W?p+eg*C>k z>n^*?A=fmQ%?P_=Po1QhojB2Q-;NGT66+{12|QPPu*GtrkLtB;^qv0JZTqvd*U!29 za6GaGGV%-CGb}@)g+cQ5jBwU~oK+VW!vIctR}scp)jUl7rC<{bzF4}4YeGwD6?k3( zzwush`4~7P%O|X5Bn9t9_%#d_WpN!n$5tGnVbbox$v^M{Ingaejj&qw-ZaFABApNH z&M&7H`98!efq?GfNa`Y=um}IxK;RzYl>*8RRe+_yYqIkxT*W!Pl7+&gD>;F-nz&Rr zo`xeSUw&A$49pH$@U6XXc~Jfdj0$k z%P*|G?Kr1vJo3AOa(8IB>^Scs<+s$xR07g6#-u!Pw=IhAoXg+_7?bD1&hm5WZn6`b zq_CUE!usiSXNRc${tuoJ00dz57#Usl0 z=n0nM!cR9oO#aie5e#@a+x z^~@K_dlo(&T&f?9LnLPFd*TpiE6&A z2_9q~1d42^EDH6N#Q7V)5-Z18M)XDZYGhXLvZ2JNsBChl?1sz5P>&BBrs`MY+mbxfImd%HmO%VC~mq%N_!@ zZBE=Xtu7qyo;SHssl29z%Vl*CQAZjAmBn&lr8HbBOj#CiN{)sN)?UdqTzV&TzlZ| z+?O&@E(AkQHpq*9dHKH(Bz(amfCuFNy9fKb+4KLsqx~oO|JV2l`M>IPu`fNbHmxkw zS$Uff_k`0cya+C0JRJr+9R~dJhXGj&6DnXZ>^Grc)7fA}tQ9 z8|`DVxiW&8jFF}tZlssX;h~kCt9!=J0GM?q5@TDOG;PvRK33K6mK*`=CJc?dbsL{6 z#jauBlrqp(*$4%`0`*f+VP@xxJGScv%|8<_XR%NM>BGgt8Ya^Q$GHL>l< z0LG)L%~AXxA7%9uqWt)5Zi*{Y&}fWaoWp~C!;y=tRF3}RGcz6&)&~TW3;z<*xr%XZ zf+`hs_CE~3PLPcNpR z%@A5@g^&3|#-^9smfkg8h=;fIZrAj`8sc+Pq^hzYrIR zw9s6Gd`2RSUPg2m&AE)|aT17Mt1YMJOIH45Mc52kkiL;&za}n!?MWQp6)&%Zk~<6{40-?Zp;5UTo>7=e9{q z|3Z;vRrZQ0<7ZN@q+Ivp<==|jUYL2P2wMLVO5y0@(8WF~Nl~}yUX8PF zI%Aj0r$QEx81}nv&uwaW(=kaTUShRk0jMa~i@uM@j zDU483>6_x@AJt$t#kDEL{_$CT1=*jm&$C3NkF(45OUq@x)-Nyrqch7dssa4K{hxz_ zy{!K4(e9J}@7MVW`Je3cjQG#c`K85@(1O3Q_759DEvy(%^%)j^iy=+rcPa-jSNr!k=Br3C2I3y~;K#Us0C|nX|~}Ubu*s7jhf5 zh@xx9Q@WS@V|$CNgZ6ypPlKhmn2@&DbH~5&QO(6)(qZTY4)qu{vS0(Y&Lk6KEyQFM zCLBHFwxI?yevoThT_Oyo_yPuO-gtQGL~68oTKXOyIgn`xdG|2(7oHeQm;>peg+!6O zg|Zc)6A}gChf24kRU*-?-6lSjW{4CWfHeDEe6d~26bU%`JZKvdMF5@kd+kwU_}LH` z0|!9GE~nf~-^yt=RZ@1?O*p8=opN#(lcbb{|_>**qH1=HPQnb#{Ru)ShL< z3#)_QNhofZ5@_mVlK3kHB}GGMR|UWeV5qP=N$!@gFH&$;;+@`Q;matT6laJb#hGGA zF5{JWUVyA~DQGAjPB5WV#(C^bC$r!(ND~Pz0Iep|WP;C{_&~Tc5DGK7xI>Z5R9Qz4 zi%`Qt)D@Kms+)ucq6Yma%~)1agyAjbdXC}Niip(DLKl&SL4g|ISkN=6FM&t&_o;#W zr&Dq*!YR1!;3x$|2h}-bnav^_x*a;{OrdfwnPm(8MYRMJf&aH+{|oqkzQy_K3+91L z{%c_9%ijNnU+(?yJ>dTjzhD_kfB)wEe`)_C&z>f;FR>4NVE^~};2>-N;q~GElm5q7 z`KcA*xZ$=(Zp*X)V1R!78}PZ;)|FZ<84;r(67)3`WDP+SQh`m5b9gqHqiq!Lef?<|yKL5CbE?W~$X~XQJpBgEUr! zS``<{sjbXBC`Q+akSkIi{Ty0MrQhj|w&-sudPidu@_o4HWKcq)+XgGGrp-rn&6pxW z2|ko)6hWk#6F6J6BdLAtcUmuW*=qFgZeTR+xsJ4^SSrrBj$~R=*jk&>xi2aDg7Q?+ zbs1}9aBE>^YD8Nv>|Bj_)>+Qhno>~wl`;Nxx(k&qV4K;j4W)AIX8{eij0OOo!ht=F ztUna)e`~rmcDF1ng~Y>vOK!&g?QfmB8Ku)RqWrH;!OmN@0_UyTB$K(q5(8Z4u0rzJ z8wkAGB!xp0Sm4yG*!kRzNdIf3vGsFa6p#i#(9Q=|XMbuN5rX4zH`RCHCGCU%Fhq*^JK zw;e7nWht_0XKO8eWU9PmX42J_&i6+?t)jZBDs~>OVL`==`nZp&PGKz=Sufz61ePqw zCg6zipoT+Gkdj^sIVGzUYDn<7tysy zS(Eu)dAp;4xt1hGt`w!THBY?D2`iWOezKaW+M|go53PqNCSw)T%v_R8!3-i@%!bK$ zn)`4&e{4@im^!<3+8V{c$s*~5Xr+`TRi5IN>gYf==+QwQ1Ns6HxCc#y;$@5zJI|(; zL#8q@vT#1I>WV^~i&8vnx071C+-RrT`Tn1`8&)d+fe(s+{^9bUz545;dOa`yIeL=+ ze2t%J{|`sKDgQA*KSBO8QwIGok;b5-t^V$DBw<_mU+&~1zeYNt19 z4myL$sNIG56l|yZY44Drx>m=H^VVed^`X%&1gh6}jrL&B{=wwXs5}D?cPnpf(Ejdj zrG8|?jsUiwO%ERmKgy=}24nAKlH5B0=-y!_(F4RitY?yajmbjAGYNl-McCUt$fR69 zz@!g$zs;mw{}z*Z1D{Og-W*W%;A;mQ9({lszCOyPzxU=t<>(N|Shjr+shs=u-Pf5c z4qsDIkM^K!cF4I)L!~ZcjJj)^CzIA_*m8&F@CM*;=(M|L)_Dytx~k10W% zwJ@V0P1ovb46Gj=cSbm=tnLOfzy&vI4KQq~iiOo`pi&8BdSF7`QGY-8x8fo9kfSS~(tjus?&MO5xGD@d_uPX)7-xy_6!1|F{Fa!L_DwU|+1SWF5 z0D4#{z}?$52L{)-*YCCM4qY| zBYe`f)jmEyr9_RpT~2e@Zj6AbeGlK3g|nB%k;Lv(g+z^V@KO5k(mJeyQdtxLSv&;^~%qqs{vO_t~{k?oJjJ58$+xgfwXBC9P z%G_*s?GcM$8dmmj1#qj~ZI5j71W*_}?kKZb^oiWM_MAfC5NbcNmmF%t{s3l_y|e)Q zBQQWGpY55}I~&jq%8=(2ZvQNeozGP_3eI-eqi~Gnz1%pz7hzD~;d#%T-neP*TMZ7N;U~m2DFwpB zDq-b4`gC&M?b?KG*gvJ?yk@^Q>h#XrCIhL$cv#f)AxK5drB=fKaNcQ~GzU#qA2*sG zU?n;4eVE`gT<&{|TU8i94BCyei97C$n(xh8^#`AMPM$P6-APA`G`A213NdO7VU_6G z^Uy^dGnjAhQQh7#*W=dtpxbF8^=x+gFd*Fi`LNk`3{G2PxDa{LXd-!Z9K-54WqsBd zpkA8}cbwhZIqdr8c|0N?j&qO?p}AX_Ha(_pmh0?%)c#~-iQLj0x0x9X7ogmX(Yy9}((%lVFUJ=)l6uCY@kIw?DB4<9;CqY^(a`y%u5A3o&4Q zQ7D;QP?>RZ{CQ*zbro<1u^X`aIIzR8r*P^PMpS_^awf+NQ6X54UJ8{pC_mpt}t?(hkFh@ZLiffnQgv+4aJkO-ehC-+GC_YZog|SNc^B4MCd%Lfw)mj=eZA3M^{PcB}6?*7_+++(!{ct3TEX z8U~%DwuU|Prx6e8^OKYI(8)2IQ0+Vi+USlOpUu9<#hQsRZXot;xWLwpFoHFWsHlpe zhboizZsU~cA9AVv^V9bgtz%Mv%9a5J0~mC$vD|-sP=B*`P=E(5!u6y)_mAGZ-uN zM#XjT9OXS{co(4wV}Aee@Zey-sIY^++xcXm){kC80qRAirT!SUi4$YS7DnE;uVGhS zh73(MY~#udEqm|=HtBjSbce9}b}Rtwyp5#{SZKsJGy#ZVt|=qjW;=BoV!k5+0OG%# zH)ci*(whPpMzrpXfTMM6Sr2d;Eno?TE)c#?z{udr-tM^_LNzjOx|97q*bh#QJH5v6 zvq60^2qu{fu;cVyXlfaBXax;`LlFV{b^!I52s*HWaJGv8-3Gw1&@KTM@gcG;lWx0r zI(qNab$;)OI#K7Ho+DKR=J{JI0U3-zZ*=8a{U+@CPx?T+(1}whA0|Tf3Szlvx%_-U zw_{9_Zy~6(YsC@&o-4&xNlK4RCzr|)x*LY_S^p!lghu0X$Vul@yJd8f#s?*j-rad&YobI8Lp8A9lbUlkQR<5g(F|r^6_tqDUx7%JPg9 zfQ*8(Ul1Vb$OKl8CqAJgLeS~G2a-85@-stWT#edI*kD1MFkv%i?+AGk+~;!?M{J^N zz!3BAXv;ztQh_q;LmQhpnKEQUQ&R5gMZv*y4iTiPpt&VHg?<01L2O{F)4&IVkp~&^ z(?vNX?nx8LB4rP!d`>;IfF^_56I2vsXWOeeh=g=s=5?D4{?0 zd(ft>f~jN$BhTDw3{Ae;3U4(&ck$Mv**<2t7+o-jPQ*{oGnbbfVwu~-!ne%%>6WiZ z5GMIa*kmIsh>}5^_y;D=03X(JN3{29c3oqggg};i!P0?yavD@eX7I;;7fU7)kOEqA ziPN+8nIMh3HW27&J3~kX95;8?zWNjo-3>11^gZlgj*jejtyY`(U7M5Tpbl_W!xrau zn2CpjZfNty1n>1ptkxWvH5MTvL1%w28v=`eqlX9LMG20mVwO~kLdweh$M&#~kBwV( zH!1|#6r^TTs-phD$0(YxvmIG`Jlsy7yDaP4H319s7qkDY#3q6_}N zo<+x_0N%HETxhvd+I4CCTv3U2B;Hpe<%EgU=4>Z<6u2EUiV3x93QmIalYs7ME zg?E(4v$|g)zUgK$fqj6{&__;HAk|;zQtNixr?53avB2=WX_c|w%BR>9GC-Vb6LlP+ zqU;q^i;D|G8kt%fJ6AcpS`Et*N@ZM1zKxSW;=gHT@lU$_2A&WIF#v2xaAT$;320s1zikiAg0#UJB3+vQo)Y znxgs@&6vu4)2SellWu+zRqmZ)WrKGt*j17G>P&^+x-q`jbSVFHzqiOQ|dQoEYc0F(Ql0#i1xc z=rr5Li3yG`apFDbHk$fW#XKOEICMVV=;E%~Y)2K|YIlL9fX?aQlsWGAN5&LYSk}>u zF$wSn;@SBbZ!!DF|J`nmT(eVUxHu!6@G#iDeXUt-BdWEHCAi+i?ph;{0*m*j6x8XH zh@;z9ENV%*`BZTTwF@OXgY)4jDpWL%@%4{-20j$s zzA?;0mvsdW@(6fXWMC8|;kMf!IB>5hP#s|rNA z>d-iEL2J9`tTIth1xCQ`I3HRo0;eqx-f3{t;i5RvG$lqERAB2-odMX2HXciv=eZe7 zl5Mk&nq!^k7U8`I+IWui-aOMSOz<;s{h5Q^Y;A_8=OjBJUf&inWl-^qXWVJQN_Ez7 zKUl=I{gJmN=3E3A&Q7zXCoOkqwk$xP}CAtVLNG_GAsW{*py+VK&= zXErO7O0R!9;80BBxc|vIvczyaK1FJ&5bU+kRZ5I?3wGAQK}i97R)Cmg=27DN^HHlm zM%H)O9$6=onl)^HYB$eeI`D!#EX0wTUjiA4q;*_SfXQ5tL7@5ed1KT+6FYVlB3S|o ztJUzcW!(PeSy(agQ8^5CZ1P06*B4rChPGs@mD7jD!6<;{DeCZp02*zGYPdN~IamvX zcCeXIuYIVrr;U?>abH0V9gO24-6nwl77VWm?C;tzRD3_m!04I){;{BZBj6wdr5geG z$AXgT|F^kxN%Non+HlhRr@wZ2N%NonTJS?ic(+1-Z8)j%)89;6u;xE~GBri` zZ8?)YI~SoEAx2dt7l2H>G0FwB-Qa+|Y=8?Ro(_~Kct0CVTz`+Wr!f2=8{X~oJ{Tv# z0tyTv5I&jcQ8rlcH=UOAIvXUFGbrMlTwyuzm{?U)`+*cDg$$=Lf`#h%9M5#K7{s-A z@DSiVDS}w5y}-dK-heexwTyL~YomyIcG{NO2kKp(;9-LMzCRW!NcE!N&L8cwVi}-B z$wi40(?}O4jP}vNKytgf1?opxl;L>~7ZtZTY`1&PelB}bsp|Jm+U*uLy18Up7(kUI zin%}PoTR| zTY$s`bvqQ5QG_`^9`1WqIEzEia65=6zl?6Q%6qBoDfkFuET6f^+)eEBUH}4vhd>*X zZe9S?+^D(4kWm8WjU}N%gy)1#(Tyw-{sBm48^-YMUKs}KvKmIIbj?RYC5vixToQB? zhqikx94ZWy7n)2015ExsNt>a$q|LyGk{PrGeP%S|jXjb6X^`K*8LIyKjyuHzuR zYlKmFw~W@wZ+=rZRbgb5P7AkY>eN)l>&*Nx4d%g=Ouv>zK11bzelHt$x$@&A3h#@G zx{9ZncrAZHhDJ*xVGFcBjgT&(8rG@o-#lg;s3(a*NTpaFvF7pIKlFv-L~o==rShJo<3qDVVdPE~$+Ju>|&_1tCyxo~uhZLRnw%`6O%~ir;w-q8#$??+TD;ve zph@idAz1^?q(1tD=s~#l`{Ac(KF?(F$@F(Z%iE6QC~jVPu?g(07YoxrOp}80G%lhz z?T3_tRr>XEdAIkr{u)38*$n*z&0ozV;8PTKgQfP(=j_FM7S8cqN`piCxiO{BO{3MZ zwq%S+Vd=GZJ~#cUdI}KP;Ww%9+9j>yn1as7!2_TCD8Yjdq<$xzQ*+9Tf|JkLd<3Ek z(@X=5hQMLwIJ4=6K^g}9>QwBmFGi4GK}df-PyDnfipZGcB%7%O1EKN$RR0Us220EZ z#!6{laov#5$BNNx+YG$vwV!t7OfZ4Ej*=drsk30}pLxl(0X14y!Opzf(d{4B{@S;J z!y+I~JOhF?%(Rn$HoX}Ngy_04v2$L4NI9!lPrO! z`3i}Ee5I%gD}P!qfbGf7tZ--IC^b3~yGM2-x{EteUP9L+bm)7t4jPcZ@fJwNqqQDP z7&eMh6>zp*q`_(tXnLMQkuP{E1YRHRPb7z-Vr*I+}9)P7e8z;ab99 z24qCVD1p&<%c z#=sBCqFn67juyAf~|)(n_(tOb!gwfI>f`&Wd4v=cg)$!6o)|T z5MQl=gerwpK+SkSt(1~CepE_Pwo3V$!kDs5Fh1W=&V}l71hxF+8n|Br zG78d#$<=-`+@DRjAXh3ZsGGZ6!_#7amNOzPtUvAFfrwSaLfk9#y9=4;kW|JnQd?lyAdP#oTW_+BB62AhOtAv8;`9%Xug&toV5T2&j?Xj4E~ z#R23VxV>Rj*8Q7*!Kc@3C+k$qUd$h6PoG!oIcwj- zWDnaHX_->mWm-fgkb96ZBP)y4`#CdD^?==jM@aYbmVDcP{;3)Bbx3yG_oDtRc2auFmtv=ZAz^lf9#*Z`uXD zxl6{$Hs}c1SK8C+$8t}3VsA#jy7QmsOFA+0X_S0 zR5$Ql@DUmpe$hC<{j>wBJSnO2#->Ww|jAS^E1Yx zQz}y%tS!Ph9bhy8(3YGXz%VYKE6Kod)lDly6tT5-p!LDkI)#x90+e20{n5eME(LbU zt#PmSUeUt9HMDc4G^&eEvI_L7EwcP!AMPSEM^-!SA4<>nkF?4DP@5<_|0AhLzZG(y7_t^EWZjf1WM; zG=&F~OB*@ z2OwqsslpPdNwo5V4bY(6SpOeu@u{1fRc%Ko4P zps@(;SeAI_7-I{Jf7W)VX#Z>N-!ub282=RS+WRlf)dTd)c7Cr{7Y7+XhA?}KK}TJd zuuI3ygH8S=QO%4lZNEhBt8$xwk7TNU%kM%r0QtWruxvU zrTb`M-D@CG!>GBHS8?!Z@EFOEa z#pAK{G(UBJ(Sgq?K1cVXdhF~aStmR%y>cTme>pfey(Xq-(Ufep>O}xO-%jbdJs<50 z8h$KZ6RBxDO0$T|yX9)55hFk}JRR%&sy3t}S_I(9{3lZkKs1s^X7x0GlvMB;F9#3X zMDGdvXpuH)JbQ2B!y_6AmZSOlVWE7#k57_z+AXqIIE@W0Wio4ip5Og+JYfFdMRVAJ zQ9m>iO%2AuP1etbohAk*A9SFR0~;m;pHMg*Xf*u`3xYb8l$So?%`Zrpyk_us2qWl-tVuH1ph-&Ds$$wHs?(bDyaDVw_4j=R50qpF=+A=6;U5Msu z%^w#p%oam+0ta%?)lHUTyRzLAhg!BpiX+~tCYDuF@hZxle}CR=N2{Oau{wC|I@Z5zVC(;I{MI}TB>&4Ho8TvGj61GFzBhJ#}1t?R&97a~>aj{*@mY{1E zAo8)T_KF9_-W!i@DZJ$=YC3`~hy07=UYC?jUT4d1lKRo~1v zxbpzL_*kwwKK|pk7vYmB|7o#F`$dPI)AUgA*z);_ycxQyPwBB$pPJ!dlDHFw8yR^D zc}UV!;SCs%^|Z9Z?$oGWA&G*dI+uY`#IgAk%|B6+`g`jzpFepV)_Ww2@M-Zle!7P) z2Yr9_yuO=TNvbE*-V9FYMW$fmd9l35T~n*sU@{uMb|7*wx*HSbh;{_tNb0B3{r4~u zUb(wzG+~0^X6SyfcydhRs+ah?e4GnHt_t5p>G5v9?5s?v;uv%?TaX_*ws~EGxSY?{ z$ejkL6F=?2AqNUOK#jJo-H~IN4x6n4bWdaJ&n@3wZ}I2MVW zj+ccl`Z%A!<6u>QEXr`<^85@NXyw^3TD2D+VARA!O>_11jl{K^hRqV0U{LvVD-|FH zIs58U4!7b?>mrF5og$W8So*;P?LE%zvbXwquFS2;!~Ed^zBm+1bI`k|ZybnjPzrc_ zf4V&Vc!D^a`S$qu{^T?{{)qo9PfmE2Kh4)Gm*vExg83lFDGQguswXPzA}6>Siu$^^ zF_yk8%_6uu$r=W1M-_%CZ4vcSd4ZY()NicA-KALLSrLe1nV0wOi!;Z@+IJ9%jj%Ww zxyC9&G(oW*kt}T4x6-qe#^ewhTC8^EC(&Kt=dF+DkRRjdv|C`g-3tX82>YzJM( z;lDBA-t6gV@yOSxeI)J5SKb?p@Z>uPPs%CZ&er#M_w~?WyNkxJ8?~JkE^Es<8Vm-j z_13gARDnwf^k$3YX1UrPK4kU~dchbeqx8I;f899~cXm5v-#H0)cW$U;989m?~?scepv zq&i*V)TkGh5_1EOI{WUb5}&!{6ZZv`ngq3)yu4QFX1tlNJ#GJgBd)3X`CE+t4i?6y z<`8r#bA{%RH6wmS(CD!SXO{rB4$EZ{kF3+`pIu_l(kT;tf{vDd>g-R@8O@&X-t~4t zHt2{cWmjV~J$ps9U*#Gck7mA1a64PCVkENzA3;*E1n&l%!g1hEAI(+1*EMjb*p?!cnYLT=_59Ofvz;p=M?sdfxM`v_-)z^bZ-*~` zzNtX<3~FW+heOVxJ!YnIYeH+Wq4BD2DK9>(XX|fh%G#J?+z|gRZnN+aVJztwH=~uc zj!y2MVFmU>_eV-$b4R8c;C>UOyT8}por%OL%lnD{PaBgGzayGpV9I?i|40c zya4u6oJfjd2lGOjI6z}H^xPf}A``3D3+bRwi>Qw0IB`(^$qV!U$MbACSc9zoYL1>_ z78^qI5yT>%t!Eor!;gcB=hNEU0UFvw zqy!PMj+N5@XSh{dOQf91mHxeQXD!z?!Lh0G$()=CuD9ogkc+rIps zHGbkcLV2s)yMo@eEGCv&OWaXVWEU{I7S?n(U%Ai4qfSfH53jup*K#ii@)=CME${EBQ>n z-@U%FJSkpuv#YHcoc?(lX6UW%pMm)gC!)xQ6M=-we1`&m!F+v!?IZ1F;VypJjKJgDn{M7nQ4>*~g~@MUCt-f{eG~^H2sB!c$Ech6)^k*f?H~zj$!_8? zsiU(+FXo*{Pd+3AYa1$>DQ$mGxuazX=EPt!&q%LsDl8@Hjn1(lHf01Vb6qgFD&meq zM&%CFBD{E%9&5I!dc=_?$8p}dLw9Djb1@3b>WbO$GM98$D8XCZ&mYw7s6)_UL_VRT zxpM_`0ruiKkTyHD5B*#;o^ei*beU6%5GE?q6JBVW->!v)(*y9G5h^0d9KOB7iM99dlkU$o33G+2k;`YcCfe*)(gqtA z#Nd^Y)1q`YH4{+8pcxs;Fkp1y=V+lLUHGlmH;vqk<7bTfr(BR-94{V_f3f+Ar0vt} z&L79oUwcUS!}@z@Fb#JwmRCCVeD5X9s`p~bp15zV7eCLr2;YIiH%GqA4pjs*n)YL+ z4t25*cTzT%8S2~FdVxmALw4ZtoTdA3uU|}HKQn9hECB{x9@LZyI2odXbah;Q z<#gWwvNjXTAsf&=`e#W|IGNq9h>3eEW9YQS#K!NQgjAlFOLNc9b2wmkDuPXnm(zD7 z5ceSbO$+2z!-MO?d-(NczJ8o9y~B{eO8+Z6Pu)Odiay`nARMh-)N7u7Dj>A_geG&6 zx1|~YN3!yBx8f7Y66ii*p2tr?2k(}nJjHhs=Ip3l0Cf3dN8mraD%9hv#OqZqj z{JgzieR-reBIa8(Pwx?zIwL9&n?v=!-727_sNdDFr<%7D>Vgna#aG1z1koc7K@4@Z z{s{(aG2e#j><&q`Lxk-@j|#1LgZD_Oy_rfCnzC#M3W0qT4x9F2f6z-H_s+{YW}|cq zzFQ4nml1Ric5Uv~i>K|%JRo$qZ>@RFtaPY{Wwd5@B?aiqHfRuktv?PSNH=`Ts@!QY zQhv9Dw3Ol>C3Z+v@-L6*Id(u*_L3@I$flrepI7Vc3)Ov*r*wLh-bUt>7Wd}qx%oPM z-hN(b?I|j!0b4PCIRB65#d>~!JjTE?SXKnJc>W+Mx|&h8a%{45no96v9Yn>KG@dDN zyV5e8Yw=FxiA0VXf{X3FHiMLiOXUF}?mr>NBOx3@WUJC>Y`?06O`5%k85bFYggID! znXk2IiH2k=DMlLn=Z?J{M#TF}=G<6|$<7r~dk>oxS-L*zUnOb-WnFC| ze#ZxHV3B~3&S58x<_}M9hbz|-tz<>De4Z~{NOaB;ofh-r?A~WwFnIe;Q42$-VyLIT8ocv6s*#Hmqa^64^ugc`I06C1swOCEo~^XvfO_|UCf@Sl-YZ*tUs+D zh1IJh7GR{h=uH~2mnrYi;M_Rw&hF8~dk{1blRc+-266vMp3y|(s-=c1Yjs|Ls!~9W zOOD?x^2A4;M3CuSNyeY(2KMEqmw;}`uJ#b~i#Mf}F1|TX`uo_v`1d4-sRFC@;k*3kZoW#ouj@%j*<6{F~A=e6hKk zp#jOdc7!zc_zX%UZr>A2p2qshiV7Pa7PaxKj!Wct%TN1l;_cj ze-~Kc;EM*Vq9KC1`)w5m9_6#F+~Hh}3=PyXC_0V_U+q74)M5PiQFMx!!y02L8xljA zz}#Xe5pH-G_NndJ#+fJWg;-E$mrpMJBuS2C!ax4ryyuhrkKZMVXVXE}Z{bZuSv;CD zG}B`DYWa9TR5PhOcWSAi5+YqiibjRt970rmDk9XZG@v}ZINP?&vTCqXkVpFBKMfC!6c@xtiA9Q`>?-w7F zWBoz_{0pP`_rFWdzMj?3YA5KT*PqYtH%Wg~KTV23Em^ITCA4wlm`hrks)YE;Nb9A2Bq10o_)O| z=jLO4-p}68RQE%G@dMeZWw{5d1;W(jxz~EK>gi8`B+WbPdnw$X&QI@7lK({^UG-(W z9ktfgKA})3>aV%|>+a;Fto5z=-Fi;@P)(qePca7V=FKjql(NImv_1W~oC{&|x3<5*Rv+P5{gnK zchIoPB!NzMa;*3a65uC}8pR@2vy^j2y(~faiLRQIMKy@7`X-lumpJ^_iv{Pi>!;W? z2r~=m>AFuO?Z2F`y{^$TA@#(o)~D5@3iZK*?{a&~uCrI0-C8o_uR|!TetLdN@9t0^ ziy2gve#EUj#y*2O6W+$1j*GoiBWL1*?&Nz2gY;Z2Q+qc#Q6~yod%DAv8Oh8zrgN9yf$*}!GWZ;hxk%vL zSiZ=p(m92f^%6GSceAaVVtVnD{?!_b%_OrPF;hGtJv@08j^Zp1LUI!AS7=j+8CIrf-3hOxE= zUM_YQbMFFKo_GH;8M8}asLV(>(-N#OU}Q{QIP7q?@4}DG7&hQ~&!E8lj5qsF^?x26 zx~Tk3U0U|S7@MWy_Z#?P>XL&^G0Jbpr#wlc{9wfT;EOuTv+Z2mk5B9pYVHL&k6nN43nTm(Bktf?Z5X}nfJ z9vwpSumW_z%mYb_XlLaCofxVJ>E!Py!U9-8yu<3xBHu;Z;8)88*A8l>X6=rud9mjX ztDYBWE?Pxy!pWbvPtRMjUrFD`eRyRm&|p6QDTrGhi#@hO?;or-dpsd`Y=nhXX0V>4 z3HhK9MOL8E(=UmwyZ4ICuAKK6QUGJ?#h$L=7OMS1b_dN+!8n}i^HN9Cj~^-xp4Xo! zN>dP>iE|bDX8nx?65Q{2D03Wi&4{uL=4(Z^CslA^6$MgL0?pv76 zuix{W>>GpTv3Z=!w+r(5Fq|zmcrr16+FEC9F)Hs?poy#Z<@_sgXwA019ZGZCOkz{T z$-9`(@9Dlr(!x@M=NSS`nWrSL&F>wgCcmB(-vmS?#g0c0Om4RgkfBh26|?k$qT}z& z5Hkk^5FLggAouDIkvuUqLe_LS#|KMsS&h$WjbRrqdw{K?vqlbkFfQ%SVW|GySY->s zaQ?JfZ?(RqizdGD@q&9=A=0tD*U`-zqc?d0y~z%OoB7t0i9$HwCA0^5`#T^(?`W*( zAU@_1s9t|pj+xQB1>6=Gzl7^ZlwU3ow!ip&+~WI#(|Ba|JR(!W^cP{=li27lVgXM|2?n7~N{JpAxub-4hX(E_$(}vl3)4*uV^>&* zc+O+>%u2kO)r;*fsE1$V!p&tQR}mEy{vElrgX* z@`GwNR?yJ~!pLAyj@4TnEGv^C00Pec~w*z)a zx#gDvl_><(kT}y`d>`;&I(shj9ZaYECg0w+$$MjNaGH}H#Q8FNNwv5H;yvBH1LiX{d81+zDLw@GnC-*1X2 z;Wq5r97AYpkFJ9X@@_>%&T<0O0|W}QFDCXCo-zp+yOpFG9KD$o?AD84bvNk*&trGI zr0xnCKYpe;aR9PFO}}p~ETAi(^0O;{Sl8#Lz?4dAi zsYjVGNxjx8o%i5-`9W8)`1Cl_T1onNkL5%k*JKWHOCbG0I%?5N3WVMrM zNza?7`QyF6dlvM+EVg%_cfCJpFl1arfnlW-^I{96+i7W}a-M(m=i+I8hvA=j45;V~ zIpvpO#fL}VJhkq}oQtTb7FEWZi}HW8+$fi~2-5&YUU$(`bO7RwH}p=4I-ml)5b&t! zWVD_=Zf22(O7}cGvcsfDBp()PZ~A%WW(@otpng02(F*SNyhFS=p)$yEVh(-lfO7eJ zxnrNpx65b2V~o)ORAxI}KZ6SJ`NV?;4t?sTRH;kf`0+t_VZ{2k&3@!`kJV@z%MR}X75tY%7|Grpb=a)&E8ESG{nStyI60ZjZbc1=Z?Fq z@H}x-b@{l_d1)pGIm&T&6cf)x&b2%EudqORZDE#08XnyM%3Qme9=~L)^V6x0aScAz z_YS9xw17<=7sh*OxEdTzEYcqB_FK*^T#M=bY-W5qK=xs_Hf)sK6VBa1D{G8zrl9b! zo3)~SI#cg?xm`Rh_3qhhC)En5D)3sKpC3TPF6?DwqAR|pRlr8oP};eMMeuzQ8PR?) zSIOg>m4f`Azv_CKIVNtjlhmS?jr4Vs$)qK$^XY;c;!72QTqbqe^ zWlx;9a{abEd+D*m0TgzJRXVU5dm}3yUYqZTqE<@iz&L6VTCwxR^5exAf%4wnpJCtL zMP%90fqS#<8aPrCU{(Mxif{c!Pq0%rD-TvO6J91G-m0(&{<>ro1rxU4Eh zgZb?M(l5^YWN7nGi$|%Y#nM=Y=fx5|a~@jFhWLo1K()>JTUolxh>r|fVJ*KH(sDjq z+jfaBhGY-7T8r5d@w^0%`t%KjvHc?iWnbB!3@o384<4#7Lqu}Hi}D^aHA%en?jfiu zyZ6!~VC~8md86DzHV=gR?}dA4=Ip?KhTBI&Zv^o|wuivF*n6bfL)1djdkZ;^q#pZ? zJ^<`xu)Yw%bG9C$Fy2HTbM>A+wLVV4+o=rEydTP+61Cvq(ZytPYp5|KMem{B6|K6u{4n(@RNup$}IfNk07BO6*@RflIZ3^ z5Ah*TB0U^UEz4y5E=rO`HtE9WtF3+B-ACuBSfqYvQh_F;hQOVg`!%fgHic_mjc?1d1PhFCLPQXYu3YMPui=3_PNp7vIi9vYLh$ zEY3p{t78zF%|(6@5l8$0BaM;C>aK(aAn0y(ztn=GcQQ+EYI>RcifExl~=N@M(ci{x0+TOa`Yy#-^mh!roL-MauMJ`ua<5 zc3u&(1mw*d|00e><5xQ5{SJl_Tuz8ySYR2%1%cqg07JAc{ldMU`9K-pckTwyU8KYw z!1v7-i2fcR=6B6AgnNLf12xYQ)2K@voOw1+qYnLqePpXq``)=6k$J25&MWQ&SsEP5 ztPQ~dYUD`OB8y`e?-0fzm7X^2I*8brT}`R-^MgH^QFSag_4}D)HQrg(NF8P6=F81I zX24Fr$AF#w8UuFvpKHKQT~=wpc7UA*Y=(B20h?tgGhoM24lrQ5j5`e245{3J&5-sP zusNz{zz#vefX%?W4cMiKF$1=b92l^D1kZpS1D6`GedH1YwvSd~zz)!S1GbM)YQXjp zqXz5}q;dncpP|%%?IZ3rV7m-0`c-Pc=70N z+hr{^U^5iofGt7aVZe?M2o2aJNZ)0^mb9V<>^Mqbz-DOW25g4(5(Bo&R${;w2xSIr zfmCk5_R&gh(E;KimTsBp00Xwj5Gt>+M44r$0lOSEYQUE0Q3JL>iF9Q=xg^sb1GXq@ zp8-2SE;C^7pc*$|%M3dV*aGoz1Gbl~+<+|*Ut($&8Fv}8BZ%cDa)Er90eeT5eFp6P zSr0H^?;^6(fW1584gb()A(a}iqsVaswm{u&z?P_`25gD8*MKe1cNwq)MBjid z5Ml;wfe<%fOO%5Q*dogz25gq0+<@&Pwc`eCA8n@r+ad2XU^}!D19lX_H(+z5z<|wx zdkxqn$T0)9kNQFbc4_u919oYKas#%@;u)|#fHPnR0B6AVK+b?20Gt6^f|vo@0RjVd z2oeTt2Y!J8+s|~M0o%`ZfC1aj@*)E^%Y29dTcUdg>1r9f6$&Y=>5Az~(3i8L)YVod#@<7&Tx!gs1_VgLfLRCE@`FY>^?{14QG8 z@GOTLutm0g2J8U2%z!Nr%MI8LZKna-p&ekrcE~#n*bM1=4A{G~?=fKS%e>Qo9c12T zz%I#9X24F(dpPEoa?GAi@1B;=8~pFpFA@b`{K02{8flSDZ}GvD-~9LdZ13)V`(^Q1 ztNwQJc(;7MpX1l;X@S4y7=+`8&%e5iGx)iv*YS7d^8AedhQBK37iX8hshm~M>lgL& zvr6qZ0KGiF{7rK9H)!A9pXUu|Ug zZ|&F@X$u_BH~n#QI!%86yV|S2e_GEzJ40LB*Bof8AiO+^5 zXI%^E=Tn05G=<#hzfHTH))eCr(v|#*k3nZK{d_cS=i`1Wsrv9iI=W@>nhzi4`Lvhz z-%s;FMpx;xBB}dGDOGve%KDwGm7JH=Qb)792(k~eemWfu)8ZDgU;1FIUDnUXH@8!D z9WS{mE1}WNn{Se9AKXY=K;dm?nD={Gf0R@LMk0o~+?P}W9vbSZnMoyJqCvm|v!oL6 zFdvWdwyt_5V4lr9?7YpAO2ED5cnJI%OKjO-iL_*%#^ zT|#5rZf8RZjFGiqqSXR6sR=sG@^(@SIG}-82*{gmH>m||pkX*34D#U!-8xR6zkIpP)43?5y1Uwr+-;MsL zIDQeZ45oE4$n!4zo5H-m2<1CwpEfaiN4E=|auH)*Ux|)xhTV1%@XxSUiusFxkJu9A z_2~TosuHl#@QJ$kB4DHK1%wyLMZidlP@ojP2pDO``5+w^xQ;}I-ydllU^@oMWx&i~ z1~S%W4_HY{DUG2bxeAB_i;;FOeUl|uVP2U3(@wRXT*X!g6g( zC^|QNsNGfRB0B&ax;1$fbbvz{0*f)G&Q-WhKnHPIcNKI43^{z>Z(4M7WJJ&ntebl2 z;5Nq=Rn7u_ff&L796j5%e1Z+DoP`n+kU9m%tOjVnSza9W@HoT%shkCTwyXGvV(JWs z%0Rf*I zLyDO+=nOD>z-Fb7!LY*I5rswxd%POn?&cFf3B|3I~iF#--x(#{BrYTkCbEl?~0CtxnYh>VUWfDH=Rs}xeRDwuu` z^`Cxr1A5EbOzCcwhzbPh)4Xq$*H8h1>Hmkk)7N7RFhcGs4D8@g148LBZWPr0wW#iB z^Tt(cn>k>os#Z?F0UofDvLXWg0T=-r4F!!*4~M5Ap~|R-N;arHX8TYNc&GLS8XE8o zS3FYS^BfBgbtetadV>+}Ucz-p^Okm!fDo=ay6-eR;2`ZlNpq{z!;PJxZhF2RF8dTz z3%8Frc0#4o%sUE_0t0%C8^BQcwChN3{0`?xHUw!GDx!84gBoCWjG;zKGni;nWT{H1 zl-lw}%?6efE-O}{ZgJto6|vOOJ|*%(?Nm2GKV%OW0Xuu?JFG{mz%5i0xBrz;|D^4YS?WT?QH`BY z-BU_0+c#A%gMLa!d9Tx?5(;noQn@T$!HVn#c{1&fdktI+LT%7sf+E%d763}nbffoZ zjj|GIhSs{%O>bOTk0_4)J z>|ysn_ZOW%Vda8Z*m~dZcKR^Cp1>A_r14?5) zfZseDU&#s4ylcL@K(=rcFULRJAZ&$-`=>W)>ElBH-!Y=MApqrvksC>?4^#(-u{yGTF@3ILQ5&P27rs$Q1L0YKEMbM-P9 zo>&vPDpkXU1QBSj3czxs$sos7rW%Ty0WJzK_7$r_8PkLRclfrWR=#aRO#+QG^>7hN zhn>+a%uHBq?WXiR97Z$}-6%Q_)pf$?($GLLd>*Roz*1?dx(?+(Y@dfJ5OLa2oV^Z( zea2;~Jn4qB<{sLgA(vpC4d-t=Lgx2d9&`-(05Xxql z1KuX?tlTVuN(LEf0#=RtFjw-MKCF-}y+cL3s1SE6_*p2uaViweVV3n#3=)ypIR(Xv zMqo^9Z8Z=QQ&rz&@6mb`Qv*k6EJ0wvMg*c@M_`P9BeI1dG+^8?yMaMCd_P6*KvyZ_ zRlq%qW`qSG1+243FrbX0dlot$0$#T=oJgot7ugWa0I(w%_i2V#&cfZA z)1nC3JT!o~;RaaaXyc$W^_+$KHiL`9@Kz6uaFsGxxE7LUg0VEAXW{dp^r?wZM`s9YoA% zh|G^{0WCujmlP*Ji`vJtpgX(S(5wZRE9fm3jv16eofi>9D~9Q)uz{r=Rt&Ocrwz-M z64QVhwYK3hW0nxWDeouS1Jqc=4HpHC3)3@q#@(~XQHQA`?&wf|!0{CBfc^1Ar{jQF z+Dm#H)}{%mmyGZr#9*79>se%9El2yb`-W;*K9d}GoahP_uSQO~u|5o;p{Fn-n_@lg zGBgnrpA=?jhaV5R9kfZiJY>!|i>PD$79Q2~vQ{TWqkF(`l*!0LXv9bMaC)4qb_yXb2|?a{^z99c*NFN?XdR6GOrND4Ty}r+p z!VU27kJ^A1IY6N;7HL3Oenbbr)d{ATT~Q;aC!oO&2B6rqNVsrARpbmsBP(}?=KF33 zWWo?J1Daam zbWv1cEHbQ6u;e{{R2QDLFdrzCQrXbBLRBIMF0j=rIyjqJASac~kDR*nRK#d#?v3_} ziX6OPy$AV3iBRCl+ia9m8zRRP9;$6_cwk{SrD$5i-Uv@Ea!@WOF#dJ;eZUDV`_KSA zRB|K|YKaBNSlW}Q=SwgH;su2baXVt5r8}e+os@>!AWX2dDDq~c`CZ z`jpa4i@1jgo;540NyG~0nQp2fubBH@wH_`>N;NYypc#Y~(b7rs8`E1oTxzrr2#K4B z5z-Za68|l+Bw~NmJ1rx(c338FhWU7)&y>Tp(4MKo7Jod_Bcu{BO^Q=6 zgH^h%YUMqsyg@5H1k(zW!7H6P+QkTQ%Fk48$qiIt?e%Ukh^1R7Z5J_kr4}oV*UAby z`;VyP1sRc>F!+FT%23vCgT_es5l_HgPO7BJM$RG5MhOZ}5<{J?=77FXBZ!=Ex4n{gy~RDzc$%P@~f( zQJ{u9T31nPYO03oB||g2&WO3(IJTjMD+PtJLEH(K%G5< zeWZxlNEs{a*0LH}LU|({T6k!ZjZjgjhRzF&0I71um#G^1F~F7--4yVZE9k1xu%rFW ztD!@KLY=&UMc2cP9SNXWjNC}H=@_uW)yb{{N`a$>Mm!yut-<)egdPtx$i|~voXt%= z&O*Njb$osUl3}W<9^?L~(;s8^g-#Eq#<(p2nSrKL#4B~nRtp}rK4Pz<^C0K^2P$8v zedRsXa5d8rCniSzIL=3DK^uH)T&jgDDkzO0=ty!HNk-Gg$pg(f{m>WbywJQllol?ms(|C&HGwYFAyo}xI1p%TFgSTCAtwMOlZzq5Z`F) zuZ2skh0-9n&AQkT<*Tjkd~NEeg$pkAy)p3AVy0+SE5t*Dpcjbij6#h0M8R}VWcx`< zA8MNhCtN)>4te=8ynx@`6oqN4M_yXt5~{WlYz#;I_h6i(^Fh`UcoAcZ0!rCe3l~#o zcx)wWg z?q^OUg^Q-!364AD1VpQzLJpm(2q$}Yn~n`mxjH#+kd)8y#a+ZKRVmYE7vbf`_zsn{ z!;ynO>x-ySZ>vuKHUl)Z52YewTWH$aGmeI9p~j&LFAT3#N5>X2K7{Kbx*CkoZH5kn zn66q2S4FWYnWiHcm5ni3hic&hNv#&*RlB~{!u68GD{Z_|7&7mB`Iu-%cfwQ!_J}MZ z#vR8(@d*j&Nh`i36G&Hs^0F_ z!V@U-3cFBY;vR?WeR1OqR*T(?8EJW_PiYV@esUlpPnybQ{7R=fy%H@wGo@c%|zeET~03WSFH3A1W;Wf|h1ll{golXjJUO}XoB0}Z^jDI|V|Fnit54V|`b$NT5k8ZP}^%tp! z`^?*Xgg!MfGe$kK)x;tL_wahevxyLWmxg-8%ZU)trAJko$dzl1{Z{r4F-kk6)5L9t z;dHpm#LXxk0kuG&=QoaExC%mz8~MAb@Gk_!m;jhSm*I5>Joz2M(nLG!dbsgyb~}Sc zj)=yXk7#9m;#{h9e}vmm-O)kJW&44n!B;5(T_cokXFKj)izZZxEe6xtrhiaw;?E zikoiUfMqD}ci$5}B1NuAjcKtWf^@WB5BH?1G+L}du~8=RdblgK3RQzKKYIA7wzx3b zNw;etTDUE3kXXTcyrZ;HjPd~v%y4UpXAHyqz20a<1V_ZeOHOur5TFD`tmx{fEAlPgPb)OkxGTs&BVr)0JQQ;smg7?Ls*d=Q-9iPb^Jm@m*aeZ+g1K^hT#ce*pvvAhn=w?=pfnip_R3T$>J>1GdlLvU-6~zv^ zq#QMrRQd1?x-_9104X4d6`Co5ASpx^C2|ynI}W;ErH>=(;YOCU5p@0+;w;?G(s3uQ zK~f7lkK9K$n6%j^hcUzp4T*-Bx;cFwxe_DGG=56wT)`O*n$v=9!c>5cj=m>%$*ZSO zm4Wh2M|q$z%t{$ihEw%%@T{uP(Gd8JxAH3Dm(GQF^*v1)k2^%~ybLevw+1bn-Ksm$!ZiLk;%79rDE~^2r32vOBE~^2X8GPF66ODk^_H0@2(=V$5yT^Syk(I+D zh;6#^8t_wKs?M(kjB-&Oa0Jy#nbgoTr50li$id-zea3WIE0qOw^ABn}O5Y(~WFWc< zd$<9oQ1FmPmN`zotOX;_dHk|*SC8;Xjej(s8?)PGJs5d-g&F&>pix!yQd|};>*3H- zlF^xDF6#kTxm-3fs2*?@m2JFBVJ3!BATH|xgZ2ERogeaKjGj@K_0pNHT528XFY6(D z1*W#=U)D?IE#iUpg=g(}{BT(hI)hXE6DwP&E`yO+I>?{lQm8A0K_X?44RK9@X^S{j zAIIPDU7klo?dVo@6&`@)s0du1M^-#@ugZ+@^U@KH$G}>SAYRY`#tlH*I1wizZpWJc^Fmev@fcc3K z!UJvte2fmw%FFliGT<^GI4|JKOOM0v>@dOJ=+HuVS@m&>f(#^j4X{yy5Vy7)7q%J0 zk#-TgysSr%VGly?9-8Nfb{?atyQG!&Qc`^{FE1l#I;IeF_qe>gijh;}0D}wBT4@YV zmzUQ8gRpkP47Qm$^*A71o%u*~4~_P=z68ArINo?a%Cv73m+n^q+tEHyjK&Qe1M;#w zngf|~O&Foe(2g#yTk2a7mk}F!4&8>g@47{*&HacM+mb50BJH^&n#<6DPFR^eX0#_h zmk~p{MjdAARzz{z8So6@?Rlz!!?+HHKJ~1)?{FEK(m^A0XC(Gc&t+&*H@*qhf8jE; zs#CN#6&DiMN17=%%++ORU8hKT+0aCta>q;7(sUWx+0E*vC0KZa*dhq(h#I*|!%+31 zCP||3cCkBz##nD7eF}l7r5?mURr?5Bl^+6_TB-%_D%>3#gdn&{`7waWVyzoj z|kvt>BHQpufpxD(WO~H06+_OwJ?gEpt}lpvwSln zwCJmFQ%hTDDA3Hea6e1h?7-epy$W};v>{UdoM>Q2oIs6&ZgrOk)xu61Gyw9(F^UvHm&~Ze}S~X9QC+zFmhR4XsJTe4>uI$!%8Cyog;| zG|lR~%euybSUn3n%|(esaA}w60~U2EQjJ8?z=%RNk~#~<5{aily0jVtK5l60?sf(P z6Y@u(mManz&$pNNJFu!JwMd&iJw>~})FRDSk%PSm@wG_v3kqwcG_F?OM4T{kg2I7a z(jW2$V#EjR)G96!4XPGtxM*-ZPcWFFKi!rusYjS(LZiUs(ZUh)AZo}ZT*sT_$&c{J zjBdg>YrYu|5FB1q#Vv`0M^?KgokNkPgiClm!i1rYD`vt%)kUKVyyK2ujP~t-5Tr%B z1;AR^=_0^*1YCun0yvImqqPtOVzY!;t(shh02iMlgyE(wiKKT%?W7(iw>rguwu@EQ zN^Cd!x*X&4gU_3jkj;XX2>1A>u2cCkDJA($N7D- zTs?kbh5SCLRg&NR&SShIrHi2ue8+2~v_AQVv#)LVaYzMSJ13MoM7ax53?0K3MGOA@ z{qHLmh+g^l@uN@CA`?~kH;!y*n>H}owF;s8ge|5c9AIK(?5QSwygB`NdMDT(uoSxB zpMl6<1HeZBK(#}_-3k22@~C>QH2VCTm6e=C2J;9s#Zdw+KT|(pk6|Q1nkdI#p-x}_ zMKIwjat-rQcmMTRPAyfLv#(d0_{qsXokhk3me3y&c}Dx|$zQ!{GH&5pig&B~`SItq zV^o4)4re&uJTJHH_3A;PZbT0z`0bDf>($fjlX_MG(Hv zP=MV`xI*}bT)L8N9EDa z)h;b09ZcVLGV)m@dyvV(Z3Z$+_72n&vz@i*l^8m?Z|R5&%I(I^(Ygq(hBG=jR#Fas zx@|>H7P;ml_j7lV*P+!zw2=uuW|7V#wA|#Y zOYx*I8r`)2#=$RrI89;n^>R2@0S@lRZ?X}p^>2)%M9k|bCfZ&`xv~m5+|^0CNRfhM86@dt;Nl@LRBIENLCF6Fv7=)&5f zJqiqNB^YPO8R&Nyjjno?V7T>jqs3bsHrQHkrzWCuHgcTf2W^DXdaL5E>&PA!@7%*H zMmKn3G445(ivT4Z(HV)wxb!f(%3s*RuRQqZeUJ4UKV~B^ZmP9Oz~ZDqds4h_!Y~>; zTdXWK7P;vmgGzvMRa=iN8XGGu=z`WTANcZ1#1LahT!>ZpII%dMB#RT0;w(-`2?lo} zzNcn-2Oi5%iDrn5d=c!7KzDZRNF(rXq@ z(1sL^3)ezHQlQU_a4#+q8>G$ zfM1D#fL8-ffOHeT2HY=4BZwN*eFAwQ0s{D2MmmXB06HHpOL2Y9S>S5Q^^D|Sax9@2&#M)LlJep zY6lp8r6WYVT1SXrwNYg)cGtypEK_bP+#dp#ReS~nUk3Brc70ZYCfax1j$-+3EFtE# zlM~YllUm5e{Z=jnZhBUNnde;<0@-3#Vwke2acZKSX{2g?BV%N|7IHGQXYi}iI13O& zJsLg%zY+lfuLcdVkt9X4au!shc^1bKb!kRP`4x(j@@f?)MH{mMLwWabU$M7#4tp?W z*p+?Q?HjYm8zYms*bsYaM0o0*DvMYtMJ(7TX;ourba=>i zDwS5Plv=Z!7fzD2SkLv|1Psm2Jh0$p))r8ojb3JtgI;DE(Xp5I$7#3wzPt|Rx-i8I z?etw^vWka^xA}Cq28UGjkhuS+MXGs7+K=19eYW*;xuvRP=N^V$wJ4rq!L{=2BESSK zh}`K$nKj_X3@nxGGN{G~EfBITR}mySK(!dxepl#+2%PB+u~H8U&)*w#F_0o5SiDA1 zUI!;Q8+BPTK=Jnem8=z@42D^|!}=ie#|5kmUYy(5NF_U<9OiA`swjqeTW0o$xtG}+ z=54=ZwEDA9Yo%4tyVoeLZ`H*9!m!%I9!v*y58UEbeOv@94}XVL^N>K*^-=16{RRVQ zN?Q!1_IZe;?5tzf`)%J^Psb;nK1Q{*IKGL#)$NAG`G$E-2*cl69N#2QRw&&`8M@o*3Hs_lL<`5I1!0Nna$W5 z9yLP6N9d(ZX_wN7+!W_*Hu!6wT}K%(9ahZtLN#w?^pLL#%TTxsylAyA$A==hEil}` z>+Q2~!e|fkKhdfjZnW*D%g~#8qPBb&hSe}OXpL2gVC5Q%eAC>9Oy`gWb+u8FJDeRm zD(!IIqHPn9pE&eNIbChw(uk}APQgd}ds9?2Em3*N^Do2a(u}bwRFP@*A7-sFKADCO zh-TfkQv|9WV$bo@TW5>uZKvme=N@qE2939<7E^7%kJ$vzg0<8MN^|XxuP0Y>-VidK zK+!3%MezkMqTo@WIHS6frzC`ELql5(U-oK0+3?8gN*p(T?a_^YLCT9W5u!4kE%Sxk`3%OJB(k=04*I3)AyZ1$7ZmItyr1V z3CiExB4(vsr7p6iU5DF_5k;r!%(0CRJlhAO6hoi!qsyusd*oZ5>H9LHJXbex6y}w9 zB1>b!XvX!7LTXsFs{oDMu=z0&qFo1Q=Cv*TkekJ92AJJWBXW*{xUERxuqxw&(`;N_ zopEnzjrd2{v~}8@jN+YRxJT{(XS0M2)3aH5`dYlOWu&p;-xyQCA*KOhrk+msrYN8` z0@SqE=-iC+als}ZAco9BxDBIj@nVefhdQ8T0UD^LZCF`x5QWujhl43?sb@HO)2|v~ z@hA~t%t50p7B{h&(#>^ZSIMhpbYNn~aHOzm5g~Wg>GZ{W73h+K;zZ*4XPM=W7XtJC0fG$ z!D@1;GI#|@zfKcv;oNntCYK^XRJfqk!|0>~Rrom`KMOwUIGNYt{VTO+pwuE&Kv4f$Ly&FOO z_2GS&E-PAOZ|c*vYs(IlU}sf7j8LX7x(%~Gu!&revXkK{8w1CyhIk;|bGn5Hn^jWz z9Cj^+jVO5Sy3 zrNZ0&u)uY6_& z^>0D0%^&Xef{dlc6IWP$-`{%n0%hk?&s^|<6=2aKCafu_VYZM;2=q08~^In(PX{Y zZs(85hi^&x2$-9szgjP6_-FFZvq$y!|L^nsq58wqY_pktnm_)qng1Sgjy^9oiZ1+q znyt6V>SHoXKCb8UWV!gTo~^%yCH`PC8VvaJezDoE7ayLt^ZNv9jQF2dPjmQVwoMk> z0_c93 zt=F^1?Ki07tD_!hU7$gZ(gxi$O`wwP&Zv*pbJ%4kX+lqilcg^ijEAs!%%I*d#s7Zs z5g79^F*nkuw^o4gqy=D1Z~EirbejDBcePi4|FoWcdYC0Q&1SOsw%N`frm9uSn+q@x1tXwwyn1H$NnA=JO|LBJgkX?eXsOdiA*Y z^Zfo*k`NQ%pU21T51)TXRJApw`{U_!adCAqot`BB@DIuVu&KRi=iSwXyT_&zk_)^Y zJYPxz=Pw{|9wShH0fBmqKLz-^M_4!G{y1~5FH6^NmKmQ8yZnIcDV%Z^D zF&d7WBOi~dF6YtR)AD(P|D7CM8ZkHlZnE6OF9!I&1`8q{Clyf6pb6-6c@OB8SH7G% zk^26YkyOf%5tRo}^#Jrq=WiGu;Hw3+#=YKq0wV0_xdc!>dajm$YDdqt5>Wl8(osGtiffiEo*97JIfkb*21#pF>&jU0W*Ng zhn9h;@3LW_pfnCPWsqvJsg}WN$)@Iafh@5sXK87rMRCEZCEZj#mT6PWr>3AjF?x+= zq$ObF>SlWn8UjgGE^8rwkao9vlxZJkoB8(J(?+JwzurA@9`sZ@W*=X`6pgrGy`KctsFuU>5*Yi&$ z$i>^HkG%Q$jv-rY3X(GIW+}cSiP2NjKFfEvdU&{BdL4TQ>*`u2-QUlHgomYq%C z{JUA*{RDFk^z=ss9hNd!QZ1{rqV?zXN^w{)hjCT5mE~&S9|P zE&*007jeVssjyf2?BZ(6}8@Sg5b)jC66_d5t@S<>Du`TQF!3n=gn3 zTHELOdY;TS$rtFeQ$)vI6m7BYW{>b6^6mLiR|fVJ4f^le2UIZuquqJe%l-*A zw_DRn9A=F??<&p^12)MFwwjnoOoTlr6iqnCi^uKBDULH_8>6t;nylOP>iNUc@)%f$ zyJ5XQwmh4C+`_((c4>xd*kqzeB|CxfQghNS`;QiMzuLyI+x}Clo>wn@`_JY1`Tw*3 z{8#)$S372&a4X=8?GtuF*=@@!+}NxilfP^JUGf(@Wp!zjJ_dx%Mj+S70r`qKRbqx5fEOjgulJC zXs7RNskIXR-sTN1Xlf<=Ep9t+Q`d%C*$iy-(k?@b@VANK0Aa+XH+s&XCjy~4mjx5i z-FbpkLZEsE6!}#Rfx}E)DZz-pF=&%Q=SEAUr%KKPkb0u6|DJ`O6(DqdjZ~9h6qGnp zO#Ig!=v5qUTrTYpYU`f>eT+|&8m7_pV=c(>C#;%9AEmHL58axCKVfARIzB$o zOuII+mqrg+snCl~1N{)$@TZ@!sR}(Ejqs9QOQKgomTUBGH*r75<$U;SX`_9JsliD} zk+!#V4X<>I0(88y(oNq}7uxIZJF!%#^vD?ENXk(uGL{4qdY489KF1;7{jl3awJ~CT zWGZkR{pwwEu@j4Ko?Y&*bK2?w2g1=I*rcCfd7oVG#2XE>j0cd0n&QQRY&d$44lniz z42z%#j1Jd>3zT{Vr3^t!k!k=(f4!V8Jk$di=_oo_-&Fur5eJjXMF7Dl3Mxi>QVUBQ zW^HvH>mn@CJY17hs$qd@G85VAd049Usn+ibomXVZt?muSue0B*zC zt8kVaL%CF%DD&{QC<_%7s)>1DAbU43sT`4>${{B{{S<=v=1AnerLUaGrxo<8X+E-w zALhO0VBCCtWD11g9(2G@aadp~pr5b^$f{(Hu5Rc|^%WiaP=!n5$mY(2dNEYj1ODVV z#zEmAmTF&N?cx_aWTVo(QDelieJw*La5SZGf>`0TkcmFe)Y~(XVU*@0>RU<@QziOC z*ap`?Jwd)_!s2dt?Nh^wl#s$TlBfE`I9-xGA8yhFyXg%)+Vd++m%!0_9-zxLZe)@jB{DKeD0{eyv>23{Nq)oZyW<7A0?M}O3i1xW$?W58LSDE_5frS* zP-p2nW=}Zsrn=6wFz^w`0l{=Mo}sSICdrdy*mKk;MxtAx=0hT7una84M+8182UO7k zloVm7d$`$dI>dMg;jz(dUTKu086Pc=jb*LAim|NHd}Mqz3LjKektAFOk?v>e<~Qin z4~vz{VAFhL6#<`9pYj*VT=mC&d}F3ayXsx9PQRU-=d742*UR-AsT{#AnJ|thz18hj zE?7pJ4jVD-f_ebaPu&dVUTdH#%d0Rz$wMQ>6+0MAwRTC3EQC_f#Aru3nn#-HuoZyt zrZ-4&Pg_7p(ak3mZ=vo1TJM1auw}S%ro3Nz8diC?-e!l+k)i1n`r?0yM{{7>w7ES(!EtNup5^2c^L)M0^+VH;l`) z$H)2IcCmU42gi(#od>h+XW(@}9V-?j?yuEE)hfyXA(n!AO%AKrBv!EqyY#B5MoP(G zH3QBF#J5mas1k#ym#$bs^Yd&yyW7s!i_La%$04_~$NMExrSC8O`PLKTgZ1JOG77P= z2L8}c7uD60*d@5;jX?)EhD{!**vacbyMIGwAzbWHD@{+1LD)c^Q|jka#6CGR^Mo=_ zRPM+b4m34V;92U~iCjF=RvmRX_=JD(g{FojtTB zj+UrWS=HFcGuwN z7x3m5Xl(OsdVlYxWO^K9AGCB|#!1k9`u72Ot5~W~vf`b$m(E1enUwb1K1#LJ^#9+W zTD3`p*o*4coIT#nmyuq=VSHE?*FT5nsoHV~`6W4Bar?5~Kw*_j(jdtYcX4{KB+eCs2^-*?o^%w zGx#M`s8PP6e_-B8B=6*~ic+~!8$K}O#Lrk#V*WIL%pRW~(qqMT{%M_X!I@AUgK< zQrOJbFB4Fh<3*wg@)(6wwKEhw2W6btjE58n|9)Amf9gDbT&*8wo*Wj+=nF{jb{|H= zj3Tcd-jtx8>JCi%u$Hf1LUOX73RS9A3=LvgTd|cJpApeCxr9vrc5*olFLT~|7n^?ZQ2x8GbshY( z>;9j*a{cSeK)2)4`+v1cy?PPc|GPN5{D1fV{wscB*Y5Sa5jXMw({KMZr>#!f&2N%k z`UW2|OGkO{ScOY>F7EBLJ33+>t8H{98s^<2=O)wE4~UJ9oC{04xb3t@N6vMn{kAh4 zy~*AmIR}_@)Siwyy$mDJ_r3JIpSRoXENeB=<{L&AVfHz=qdHzH?#;g872wr}&1yN{ z&VQiG!;8mcJ-)bbeT5YQMMo%4j^ec>v5 zA=;3`06MzlNw-h|ypYMd3{qQJV|;UTEvVjR-R@CEG_RcxGj#Uvw>mB0c%@QO;b8{D zq#A4c6lvCiI#RM|WiNeq zgB10$0&rW@q=A>}K+DeGBcv`Nbe8}!`BiDc_Tde-evq};=ph&eP1KM}34yjX^Ik87 za;`i`HfrN_LN=P3FtsJaAw|6y${N;0*X2=4`=w5E#99WB;(hlGYZ0WhI-ILmL zRB9CuESn(OJs8peqX!p{&MPq(zP5ODc_He5)9U1nKd4-n7gr&OGJ%4^hWZ=W2YOQ& zl3WI%5~z%Z^0;4lN34`TMpOQomS zx@rH0cNc>Cu;=V{wJ@#9Y&2DddLMtp@726f``m8UzZu=K`%66>L%7=Ubq5k}hUt4q ztMD{@*M~5xJXQC5ou@T#Gkna6HL8bmu|IC4!v;v2H~c1w0b%;lg`lHG;xL_vwg6y| z55@z|nI1MCFJ_GL;Sp&W0z|J_$`+3Mrj{aEKSOv_Kf9LHLH0r|fp+yw5{I4`Kyuwn zhWRe~r-!rs=63XlF$|RU`$!I2xQYy4nNm#cUSS4DK62G-j5#o;O+``W_?%!h2%uLosr}5e}3aI!EE^+!o*C;Lc^g#F@$Jvl8 zZkX2Yj*DCLr)J{{)B8EL_(&Fj?>cCWhu?l8I(WgV)4m-;rdrh_rM1HjXqY3!;1{tP z1x9%6!jd$|`}npy8zlrAsJE0r7brw^C>t!AZ$|l`I64yb>0u|108Z0rNCv1QS!O>Q zDS%*7Z~FFKtKd8u=J;+|F;d*a%Rs=wN~K!6sMT0Q>A7@smky-E2%qLSI#$PvCtM9B zO!JCZ1eGc6EqX8NTb@ezt<4{O0CY{#kRuAIfJ=$T9g`O+b!A5;dBqhtwDa?lt4MrJbH=43!O$z=*E$gtz> z;0<=JW*Asx88#q#qXl{mW;<&ej8g0kwN9UT$)H*C-LXnkkMObrR5Dl9SX{~Wl%D&e zx4_dTT?eMk6B~I-9_n2Nt)ul4pt_*QiZ)>LzIVoT1OvqKLeqhP`kUxlNL_Bh*^D*_ zc#%p)z$hXO193NM-s&%*tQZV>P0SMDO7(=jetZ6^?^+8V5K2X)3LRl6zedrQ)7 zSKNK{Gb?2`J~9Yq^In}@UHKS=tyMh$S)De>HA)-!zHf{Zqg&YDi+&T(PSI-KK@w%ofrhg8hm?)G%zA-%m~ILA-$qyZWxxz3U!Ip7r$0 zd~$u_-Q4cH%f#|1pl{P*hb-qcS+jy3X5^|2CgwvqG%;}uqR_NK48lxunpaSR-iDo! z*(q1yX*4MWY0Emkf6UmNNCZ*Xg?3uFQx|(|1dQ>PbrROy@ivi+2bc{9!S`*2QaJiu z{l<`hUnb@gaY zyrdEACGb-A+1D8zj0z|SAic&G!eW9j>^5`0K@YcigQl=+Oxo?-aCwQ4+kE(^L?Yve zSEyByP9rHsLn{rek65ZIdS6~>Sy{1&aWm`;IF}10sblCgZCq~^X4y@c#Tyg5sn$za zz$cSVafk%Ek_?irN~6t=7`gyrd!K|^)e$nnuwAO)%2f!V{@^V&0M#y0S2VjSN>_d| zwLlb%>phFLRj7XEU9VF5If|Fb5I6?Q8i)4t0Y0t#PK?09&JaG)3N{IV%smHysOn;$ zD#l4!QH1i!B%vkLAK7NHNGhUZigEu<<_R%Kp4{RS&BU+kAf3!C0v#893~Rv;VIY~_ zGDo|l4g1Dl0miOxWnJ3p6dDCZiaN>`5vQi-9X11y>r3 zR1h8>NlO6-1G!`N;OZgUtmR1$4MbCN(NPa!>MbNX7`z(@-vN!wJE0yHq`E;_dXmT< z4RBy{&DrchDVm6Rlat~CTv{Raz}@uLX@CzlyES%wkscuc0zmpQi(y86){ph ze9&G8NE1U%L6Ozz2y|Z9H)h;{g2D9>f|&gZO7=gNoy)dXmogIyx900~+y!u(BP7HA zqm}V(BPN1S!^N#G5^c~*zr=J1bLy?wt6?%7rWLTgysBJF2%Sq|#cNlxi0oanJ1!J0 ze%{_v-ZF3b&JWUHaqD)Q!czlM$#_xcDYTOp)H;1*47uRR#sqq-$^2Dk#@{MKal-NY zO+wY#5Q}6aJAY^mr^B>UWG#%H#CMMfQM!nNR3mvX#{Q5W>)AXCawQ;&PEDjKJg%!b z>fD@V33G)8=bphm_FD2+ua+k=mnL@XweqiC3%p!PnT_WvFRL-`4dV5Smegpgg{8t% z$kxsilqjw9ByEek^70X}WA*o6HSrS((p--a+Zo9mG??f0*u=B%U|C2ZUj1FH?17*p z)3Pwdwx<|$-d}SeIc?#lB(Q+Cjrp(cCHL}v?pp<0Z6}f{B9)BoRgt8PRyC2RrCgmS z+LIm%igb(LPAf5pGJD4$s+d{~1PXd1N2B_A3~Fo^d_@YOiacMQ5J&Z= z;>=kLM8FYIHY_brd&& zpVuxpw4dX)L5|9iHDDc8&+4LCiqoP*wp*&yDrc7hSU_?&qvNld0GNYN(Ul{0sKgV@ z!BN0H<=0pd)uw2mxL6D8%cL>w6fLMkuOoF!0QkG=hHfFVk~PTk%a9;No#ybA=BRtb z&8s-}ZrPN`AW4tuT_Eq&ii12oO@Kz|wHXEZ9VTF-R#{;IJ>|`+sxDZ8eJfTHo#w3~ zI@RO1PL1$<0782_kSxVCB3tuQy@g4q`il}Ik8a1khIKru2O!vl!(wvI(_x-#ZQ@GQ z8;j(2cFpQbZxEmW5@|TZnNz5`#bfUQA1_XlV~Un>VtfRTkJYcm$;nAszKPB^DbJ`c zFuiN9=ku$JV!r+vZz1Uy5|iObdnfsnkI@T_VUbDD$GJLT?*)d%a1+qbEDZq>=FK)# zOGGtN20Z@02dZ-lCZ8HX2ez~*T21kI38-|9ZnOJ_A7wO+8!%-^ zq?QE0TYUgsm4(t)O+H>ir)W@OO{6JnDkKZX3)ozwZ!>hYPK0^`fVa9p!M{!~3(f*= znv*FSQj_CZ28adzo+bFa?NL z<}Hm&NUulI3#z3L0kv=pG6nKnNC-+*daL00AHDjKGZ;3?%b_n5BBZXK*gd01gJCTg zea81$H_7Jt>1nl@-|LrORp$HT!?$Gnd7eD2SD)6ihva#qUwwUCZ4J&V{TS5Zkx=Ol z_UvhqsB5&FACjc=|NT5qmh+EW%t`Ofeq62b`sg#p`BpdOpPtuP{^kcFhs%*(4m)T$ zC3}9tuBAS$=d6lr6HDT5_3*S<&euOAd_`j#9X7U*SCyxBi^ zJ9wam%WV`DH4PCp$Y%#NKWsgoS>aTfKBBv;l(9BQ5*_A|{fi zT=PjQt^L9yZG4!j9^p1omY4VJR-`Tx%WqVU+?7gEFaVqvk6#9v5vj%AeZP^ox#+vp zA>7`*O#Hi-Ixk&d(2fsXnN_ie=dm_L&h&O+?q>S86`c`|c|&2czS-*0R##g+)X3dM zOtv?CJQ|S;kT;VlM#;rn#B6ZsRJ{DlN`zE$Xkh+a8j)@-hg9*#G8@E@O5Mmk+9vdX z9rym4Xfr1Fahrhd4OvUl%`FB#Jpg2`MsQ~{ok2rdA&9wV)O{HDW1HB!6YMERS07DA z`1I)lQtl)-nd*ZK?g^$4&9JEm-q6Oz7G0@$4NiDcuc3U$a4{1@q(KXu6@q-KDG-;Q z=pN$3jSP&zlg;qO8{a;X%o;ffwm`QI$De*1V#7oucXaWO8snr%R@Z^ZXQT z(*C8~Z+OSx?zCu%CR{_)P2{?qGA>-P6q>+jfhM`h;)0>jE$+g}_pVPE%+kJpRWEFH<>8Ew#!iQW^y)UpWvJ zLeE%%Ibx}_5Rje+45)Y+N?*6Q9+Q|ml+5KqQXQLvifnsp}8O91NS(JP7TrTvjE z%Vlpdm_bsxu6O`-&!BpK&eLymyoVr`yg%X*F`{1bB*Nke%DMO=ND6Lv832W$sPg1N ziZA%qWEu7arl9kuE-!%$G<*?2f zb#)zz8@w}g7DDI>KqXAa3yzqj8iHUHaE6*>ke9seCfT*}JOWfU&x=TnLCMMtQvxLa{k|N&{VX_$}bxA~zu5*d3Q!ga0xiIfnnr>gjAn$FC zE1Ax6c#yYrzRY(~Si-GJtw_GSQ#&HbmiKy_Br)}oK*eW@PL@o0Ph-4t?zPg!Xc5<` zs5uPeao|nb|3gQQ^@?aKtvdq@x6&6AQ?bGHt=D4HxmD3<3U|omJERqpbfA~Js%SNq zIDDJ6Dty+nblkbb(rZceB9>lHs@`~jZEaHZ`jyhWUL~t*%^&NOSP3!JaH)A68%=%B z@Vy?7reclBr6H;LBf$c^(a_4rjc(TL0>m2(400I`S6upVzgfEqN3DekKH*@*E7^4R z*i$Ey96reOiDZ$~<)~;h3uA+-O9nAz2yzK#6c{TjOX{ASpld~SPfV!9i-4D=A@$3E zn-+BC^>B~oZQYv(I{DlmBt0X}&i#?nqXBg84+x#?_dD=b0U{DW0YsD2;gCX}ori7K zhN$zf$p+%J7^J@%TIXJyE#TrT$f0RnRDvu9A{yS$MyPKk7wq=$(3n%GeHXIf-7M|X ziTQ;$c3Z>rCb{qitx6QtM~hd1DqN9V`qel7xyhwpeFu>;tcy0j<}F@$Ebo zd+FhQDOy3Jdvcp)T_avEMK8X?aJ}Qyi0n(zneRQI#|IDUuU--=JGPhiJ0pBS`${mT z0D)wpijkcsxvE4=G5;J`Vu&VenLEvb+8~TB9C%gp?Ih`N!Y&Umb;ALa(X1jMWa7ON zN!l-;DIq#l<*$ika=NICq)7SNTqn}T{P1C%ccv;rTScVNaeP%I(P>6aBvB0NqQf6b zcXNUiGgdZ0(3Q4%JIuv3Mo3qvRhcw+uL2(A!y8E-K`I6!g046S!*jNQzPj9f;e*(P zH*xJ>LCxi7d5d4cdg-9nqG}die1)O8#@1;R8HE&JYsP0qV9Ly|WlZWva(OswkPO=jvCJ zEzP?v*IFjn4UDzyq8>n5Juj*O6b8V!sn{42HfJITJrAKbj&Lo28V?JEhI#*#=RG1T zdFpCYzm5PD+x#rHj`hnJL}ikEVO2k`#2_kD6r{RUHpz}_SvSUm^I8m|iiv_$F|tL5 zYxS!jSy5uOY7Wi$ojk@zfbzSM=lGaTZZ`4^ACr|=jXb@_beR3}+#VA(D=zrx#v&=& z1bS`+*yLP8&NLwieQC&dCIC%To_d(4Ai#M5K*tzzgz=a}iB}?#yR(q{ii38VxZ)2e zhKt~9rx|mPz+^mH^Vtf?jg+Vhu6CLfq1opvBzyi49HI{a4NU=5r+}t%0>sayOu-fb zPXiEvwl5gGw>(oqRaCEcRG~@~gjx_ON7YiW(119Q)FsM%RSqA^GeTY~ zx}r$=Yw^+*22i+&SAaBa)K0H>v{;UjHj2DE9%Y`YFzDGw30PMTdL}G%MPk11WL@qW zfF~+b8;Uqdj_IA?le4cM;pfCdBc0ZuR6Hn*Tzwj*5in+~hlAE}}fZw4`ei0{Xcsp;q;h zRUyI;SOH`)Y>Xk;mU0!gqL0SkiY!Nk<3$KRJV%HLw1~k#xu&ZsVL@UyJIa-}feOGa z%%lKnbo1sLVN!)ez2dR`S%<>Q3KLqVP1j~P!48E1=eAWyQKo{5Nb|#4|3F_)AgKs=Nq&fwxE<_B>!!wVQR+QrrfVQKNc z-&8fC-jE*mxAgjfeTsp;boFaK626Ah>3hMmGz_0t7|WwX4bjZI@YBgXA?-6Oy9TJ@ zO^x{0Rv_q2AL}du){m`7|Eoa<8=)ej=#cfoFs0%Bj@AS&gS?F_;|F&pH8^-s>3Snh zr@Y9aBHFy3kedR++LgAukx4b1zaqL=5RTO2vu zwxr-U!%pi4X7{+84m+dw!mh6{@Mw=N#NxullzI&&_YiHIsRwmK=%_R5W}pSpHL_a3 zJc~kM)v5sr6TYvN;oYBV&?N?r*H?vAPlAg-#^p%z*jks*!1ZK*J!I)?Wn- zR0cxyJ%cH5SpvrEH@b{UFoYb6DWwwB1APY5F0tVv7y`^tdmd6JfO^^cBBTrB@6CI~ z-eByE@|&Bk=6z78p0Q*ZqKj_VAxb`clLBYN2?2n}^)MfH{sbdG?V4kRN-aRbOUIq2 zL#fL8qfAk6T!=$LfH;;8hvPnNiLT|CECNAT3E)l;)_fQV!fKEjoVBX-KoDM^g($_F zK{`SWOq>Wh=meCPK{^2X)iAd{sDjSK_6Y4kV!Y9zPiv(#-q3>^;)G8l__8|SC}L>( zmrFfJRyJX!vi57Gz~Yzx40#_yb3@<{s*lR@;|6{DF5rFC`$eZ zBs}>aj6^B_gO+*nKj0k>M>Wrr>k#NI4gqKV#o;O-5m_7p7Ke*Nz$G1GGMcOpKPSMx zTEHH*d<3-@%SVtiTt0$H#m{R4&iiXi(6hnX63~}xOTgQ3Z3%|wL4q){00q3_3sAr+ zz5s>P`2rNuWeZTiLcRb6g}T*66xr5WPZ(3`6h;DZCjos1|I<%iRYQ0H310g2VD@!T z9vzdOcJj<5m}oX@7qL{#0u$u7uakD?T`&7B9eey!lCBk2``usYUdJh3auYQaarSxw<|V$;F#yLm33=9PW~7JpfiN#QL2R zE^aLheW1CjOMt;>Jha=}b2d{EO3BRz{O;gUY{dh@ns;_B!KI>|id>hT-H3t=7bvetP37-m%Ob6IcY z)~DQ+s$Q{!_poMO`)TAKd?{O~!`+HB?W0D1aA(&s5csZR14&z9wXN>9nWah7&(^!+8iglbZ_t}Q`k0~dk|8z>OQ{qKtHc|>DtHe(o0s)-Qv*(*G3gg`QO$e zsrpq+*uRxXaII*5mlQWjsutzv7croc=W<}sb&e~Uq_}Z;C5af9#LHMR8>m;Jo75FE z+xIoWdRS>kIwno^vg$+BY0u?VES+8?0-#4u@1gX#kV}OJrI-B*v12$m5Mvkar4_ai_nDhFD2WqB86I3?PI4eFx$>;NW-2)hrbS@E>~Q9JxS^Lkmt;U z;EPRAHJO~H#aJ(b9wW$k3?=#1m7lJjGX;n!yl>XbbE$54Cx$8o*W+`k67-wSc3MYy@BM1gc3=#lMt zWUu33MfNfZB(hf?$lkB1TzD}kj4Rb3*uIP$PK zd!!2(m6w;Y=CnuEYsU3O2%;6^TIyi5HBF?rrZjg(doGv7!4MgAd0hz-bquD81Ud`SY zYQ>Nu5R-8eVVYS9fM$p1Q**lsDU1PR6$dH&6a;k#DWOMAWQ|mn&{Cl5B-aRaxv(nt z9AoGT;H{uQjw#{@R3{qlNqO-Ws%AFIqOa|>6e+ge2D+Y=)2WO@i zU;k24D%8tJL{%@mt}=@btU6Ky!&SA_#RyEXyrEWP%Zz z)3Bg!mcFIeL(&?$#P1DGKo!G1{3wMv&*GS5qbY+;C-k=T@t3FBdiHRV93O8!uh!d> z+YY^iXVOo6w|Vj!?w}=)Y1|Fk$SD_Oe%)WCt4FD-Y#OO_6&R?>1X@F_1Da07OE+{b zy>vsT7Np~C_$pJC8+}!I5lsdXO+Sk?<))H|-0Zw4Ye{?^j;6}f+%D*nCu^lhBvEK@ zncFUX7d+JlzNyJnO@TjFIZazF9o(l@6#!-8v9P*;b#M(n=SgjlP6k=LEXg3*I}ja7 ztuAQcsKD2#(F4>^ht(cqMlcJ40-&8{khOF$ZSotbF;!3?sjjcpYjLnTHmkAiqynRH zP8ELUL$t&GxC2zH9?+e=5*oJl+C#wwL&cz~`3**pIYg}c<#rpSa@4ARLlvN#p=+XF zn0nj`sQE>W@&Ufn{tiHbyJ#W6y(rG3+IdZaU@08gP8Ri}c-Xprf|Yo+h@zeoGim~+ z_MMhsO~P#V*Xka?>$<83c3l@hc-MJViFDohnTNu39yLL+_kLVEG#!Ie<$!7UrDJLr96MTwjS~P%!aE4!WdOnce`PtT!0F$2^TO z#uZMgX9C>rjWB*V268>)>Es9n3$}g&o1U7jGRwO{K`SAeh?&J#0o>H6R%!tZXjQI# zT9~YaV&%$*_0l0If7rIF524unkfrVc%;U96_pbPjBl%gmyz-K93RN!s;`J5tYoCaX zqEC@hs%L@=js+EVL`r~uhMlEqc2@CWYI0Prf=tF5d|mS)TKBG83HHEfaOG44gNE6l z3nQDFdo3WAR3%J>4M>LFBg!w>Fu3vnr93EjpH_T`>CvgWN;>lZY8?1f?7O(tGoJ?va+2lnJ=9AHf86@FBdaY@8A zYXIO?VYOT5J;~&XcpP-45D2-tQJokZ0DZ38R^{UM8LB>^|`k7y#T|et* z*Ab9jKkJpt2v9u^eCD@MFRk^eUmaD+N|>q|#^39-AS?$jf%>_WVsq^`$Esb|bsu8a z^=naKu3goubqV6y)sq=#d#Wm{+W$Rp|~%|&urAlA_@gD}m|H~_2dT*2 z$<%(Flq&8>t&-Iks&e0Cy?-Z(Nk_fank=g@)PiI~?IH>=QT(}=rQXc*!kACf$Q?%4 zxEJ4unI3A~1#IN(!8PvoJz_S78uv#Y#f%1+Y7S>)qBa}UM5=Z%VDB3Bw4;BgW$cg~ zRv6f^2L4YT%#PF=bLqoku+cQYm?+Q?VwWSq%|rtVRFUCKmN*rTqy2rAlblG$!KwjO z0l@gB?^*LPjieYGj+l0v7IeOTE>kh-LL^!1wn)7hcj$VlSGs=eLKcr>6_k4rlYCCJ zn(xBfmzda0o42B`n(y@S5n6Y}L)uMxa(ZB?i)T?4%wEj85+J;|gS;J$hJK~+R+g%m z)>XW>z5#_Ed~IdJ8*$$YA#@oH0~#PqJedVRdl}8Ve{G>Ry%z8ZSD>8S2MQiR8DV35 zMO4RlcI;}uX;0I)X{YNAZ%n62BjdGVvhzq5Zhr_;hc|ju)gz!n1;)FO<>Yuu*V89I zR{{oH#JH*QROzu|8}v5h^a^!H{TAjms~4U&D9`{*d%nTYTDM zJ-?ejZWB=D?pJr4AGoiNCKBO|g1ENSJ&5zt6|E_X5^@E;UuxZRy*wj)5S1=8RAnk| z=L#QH`?>K21C#rCUxX4@x57izn+WOziW(Pq*|#oJV+1B~0_0jR>I#YGjMJqezsD`K zoLCoMep#lhJ9Z4!qI{?p$F!zS6R%-r#l9j((q@Dysk+UCPjIiw)$cq(!40 zEgF@#XjI-J1UWx$ImwiN(6o5d8CaoQ4Zu!$j^s60gjm17ePd4M*aLfzs883}t9g*9 zG*b3t9;EexXLBJD#{_#14^lvtKDrjP(7*VoBIv6aLPr%*z?-z69v!jWETk2;owj)J z6$$ExIN4qktA~&ORzy_>DG0HnimXjK=m5`-s)93F0qJ-SS80gSQI+QpRwB`1Cm$Zw zM9tB|=BOqZll5CiHPMvYya%*IOX%&unrOy&a8whG(2p02M$qGjb+u?5HkUQ1sJ50b}*3E?S{>wnuf*5M=~8s*9$mhm1v2@JbZ0^jxrXs1ut! z5u=G2Or!dzGL0J0kZII{rc9$Iv}78!A(Ls;2#;--^Z>C;!)9Db z##OK#SCVs8Y{!*kT@~ALC3#oHc3es3Rk0mcl6zHb$CW=SaR&nF*HV6{r%fSQRI{rD z@Y&Z?U=MAw#5STC08-vFfM{Nq#5Sag1`bWCXd>FAvjV+}0F((3Y_w3SwB2JZ84JaOy9Xdh#OC% z9nHH73QV*=q^C6c<-}{R&_FsQMr>A@fsKm;R1B zqwr*Pli*6i=-D1R6S=5i4AImIZfhB=TXo%IAc#(m1; zN_pdAj|w>f>8qas&|3+i<_z)v?uhj38ys$uis!o8@AT6D>1bg7tr*Uxt3Ik1ButTz110Cb~?cp@-7ac|m zlg9lH4c975RcoopJEfY4hkDF4y>M_@h?1t0pKoTsYK^822rHg8Zc7v5aqNQ@esYD|87V9d;&w1%Ya*RxuL?7f(KJ>N5%Vs ztNHIBlOx!RVFBUHJPaMat7$muAB#Hio!*Zu8CZFRaFlkUJ7*e z8VhfC-uMG~o?MGQ#v9^Q-bh*_*@knZkq1aw7rt{*=+9c1^E9wwlNSaa2VL#AL6)$y<ke)h& zVOxc?j;tp`vSe$?Qk7Zsd-fucUA?{X3NT?7FGM;9;u8@DJFT?enW{@uUZNiSeroVg z(PYpz0~5Cb;ebN~73;+w`Lg)GE%nZUHSXkXwN*C*a zjh$g8%1fu_j;ToWeGu|ip%KMQ!({y+Y*i#$%eEvDK1_?LsxTh!x8+`|tx3X$4-}$7 zC_A9X<|DFn>Q!8GQL%ZQfUqtb+1Faz!Sa7i$qz6(I5|Is5w2OSTuvF-J{+NM8t(S=?m=)&&rs zGG@SY0aOD9(=SB2(RC1VDIm8Da^*1qFMX+faQp09z+ew%XJrv_9x0Pl)n3^R1VQ4yQn*vDAog>nIcp zLI_NFKFw@~u8Kod4?!mWvIl}XXot8f34og6eIvbeaIY7Hj{6c`^D0BnoNL%cq&E7T zyy_LI*CeiQP`WYf$>(aL#)nC2-vpGYfsYfUkpoNM3c?<0zB6fYtShGdQ`j#?#i%9h? zv_>&!U%jbwbO`W4F8q{AhE&%{wiY zldfp{dFh`P-X>rfy&_R9RPN0>cdMxjJ6$|(S-!4%l9y$@&GR=Z6JVBB)GH4%4A2OM z8B<-^?w|=(I8`@44$C@mStl>eo4s=dyS)1tB`LV_Cp$<0Ul;|{g~inlsD`Qm@=yPF zc_UW!>&F5nV^HJUG|uM5`XG zES++yDvcWV-lFjokquJSNiWId`X4$6D{FRB5VdL|9N(gBh$Ocr1ICKYcKv*}O}4X781A^6{N>eA z<2~#pKE7S7w?Do*qFeGm&A*vH?;h@deDzC0$fvJ?v-n3DITt+{$YPz7yAQ?U&vPI~ zl~3-!w3o9_8~eQ&Egt6i^R`#a?@Te4$Z4X>vnkPXO;l#mH-mCvf+UOH;xT<(Jj}Lp zDum~tHt~d587jUL46Sh!c6v}ocYtfb(ekOeo&(hZ#uUI-*%#!GK6f5B+u7qC)`0?O z9ewW2AD{6HI`ruCm&bd^HGkZyIv(A9Gk<*5f0zXP?&kfQqs{i)63Hpi4TW$1+@C#o zDb3|Ze#DG1O|mPva{orI-MUR3HNEVZny_Q4A(hJ*qL+T>$z^}Lzu z@{-S!$NThdyZCvoi;}rcRbetQS{@lKdAqPcC9aM>PZp2&t1o)Y;9Ndh+_x9&&9?b@ zu_Rd(=BJ{A)M(i*;HoQ{N@;GFBS8PreRf)c)7$xjtr7g)X;tiC!|&E?JF7^9YJgB> zlO`|>BlU?T^Zci;2QndAB*n8T zZqq@A<)MWAdb`>dPb)pClW+3VOzp%>cBsx|alifi%o5AAi zd`Y!*MG|M+XS9M7P&r19BYMe9mc#kxdATLIff_=xBmss?o%;S_z7^9R=9|szlN^&vXYE@p4>lX8OtVDVw9G8Ey2I|%Ie)JjS^!<;10?Fv*5@p8T3Q~8i z?rF}8a-dS)cULCFYieTf%ITNL>6e)4M;~f7aqh6mn3%bxDk#ZQ9sQ(kkoM!NzkgcK zK0VBmr`g?4$4}3j&!^QBzxtN1WfLS zXTv@eD+K=^bU}nsHDyx3&x0$ZM8N%G`;y90mAvYNRk>TiSmKzp<_J{D+tpLRSR5BR zw(<9j3j2kN)9R6@6kF2yf`J43lB3V9Cj3P=wAXh!T~8A}qC~}r4PJ_u5bLFgN;;Z- z=*}NMp$t?B-TB9DZ?^ulcr+=)#i!3MiD*18RHoK?_T|x3k38CN(iWzAE+sYxDNGYv zc##+PpnmH$KU>de&DWe6%oe1qDIiGD?P@)@-<`+1@zcFxGKuZ=rw@QLU;jM6|JPde z->{CXJggx5jMc7J+)%BYAoOLVFQI%1raE!EAPrI7K7ZO`MSwI`fPUe>LGg6ZVPvRo z;2n)9MH82~jat`K!Z(+ot!v5W4-dWB<|mobTrF3mpqT=o0_M*c6Z*Z|)=;payP02!an_a%!vB8OPX4obJMnot*~QyQz}x7sWuZ29 zGZv@qW6vsLkG5LuM`DDk_!_$EpK z@zXQRab=fNIn`DwRhtI>-IWP{OO8xJmP`)f$>hJ3DHD$=6Q3zjNsJ+RlxKCjo8A;` zxApjWzFvs!CT%5u3=WWfNjxI4a@Z@8L06O)bPO)YnaT`eLiuTx?WneQYJ#q zp>qmUjN)m|W-%T6j#gnhu5U8w{)>?Tl}K8Z+F|NL=Uw(IYFF{z@GKjIjn(>oz7}jP z?$)d2GLm#VM?0Nep_ObFcsk7@vH`0>YJ6y_4>1}xHAck(IUQ8@1qn=u<;HZKk<)~& z#PcRh?d@ zy=Xa7r@@2OdMlE3g0fXMX3zISwkusARP0k1?ogT4gZ57Db9b#@wvc(%p8PHAJ(2Z} zbK8a3I)L3;G`0)W1hbDH=Xcw9s?)FSUoJ;k|If%AqTa}4U>^D9w zk*tZiF(RO?Znq>~zP?{P&gcx7bB&nHzV~qXfZ_3f7ndi06E;sgHpd6Ed$9R0&f6f) zWuR`ciMIWUQD(0_A3)h*M`;aVlS8UO_EsBEb`w-vHQK9@ZHHmpu6~}cM+>C`dxWu7 zUQ)C=gPz(Rg#%MtV6v}w%V%}4W08rt`G}FF^7H|kcW6eR^!80xeBIiH=>s$2fnW&2 zF3(t)4E||)C*{s zGZ!h#oMQF7z7sO2SUft(`=$NhDrf!MOy{=Nt0x9Ua~JFgoEt~(e5v?HmwmaaDk^B| z9OT{i(N56ed=Mvf%gKWobISPq)0_FXc6>aAIV&qP(5h=0P z8k^?gzm5X{ElfAiB*43(42ptBW3 zYm;goe4$G}tMyxTdhhmIhArZ&%RXZ)!T3v^{$M~f>V(N^%|(T^FEDDP3c1f%*>4)HZWkTl{d*Zd|I{RZO|#P6%^pR*k-Dodngab50a^<7OCsUs zjNtf(1P#{np9zG2I8ZNrlc{a+@$&RDzBa7yo)Q4o2ueN?_!EIY*^6)P6q^F{{m+sd zwD{wTPWb!y>GWxH0t)2+dX*%{PbWWo{arW5v2^_USdFRIC;tE#KU#!uzf%t-M-YCI zW#}Rb$OW}hf4fRiVW&h9D);L4O&4WFI_M;1GzWPLn~x8x+4{aa`?h-C9s>s5ay|L+ z6)6M;`~KgbH(Mo)hV#4avA#{L?!qGGo($R7FpIr2E;2rT8?2t5pN`Q3#)rX(Q(8=V zOgav`>#yuWr5Pr%3=@@uB%aBk&SlYQW1&}q4c-0qDQ~y4yU*qt&l7M?wM#Gr@BEq! zjrpg=V{85qkI;}R=!3`V*7$9!DUit1-`x0SUiw}Q8t6`?mxmQ73#OLK)#E3Jvzp!C z%{JTO+Xi%GeNLsT3R`aa9lZ?COF~bS-sV$#vE0tr$KGRjsHo^3!I>zLTZ_%pa`vs5Z@18ioAh|l%HCpd)YQ(2y_qI9(+X#ct);lShw|5A@tW^IGhOcp?k?O607kl;(@LS)F+2%j*YI>2&%WVlF@xbL z+cCfUskQv1Hh@ZIpuE%*%%cjpI4{xI;V)(}x`;cR-7i+L47;;ZHosCX%n2D3EdFA7 zuS6$ah8nEw+C{3!0ob@wSo~;}X!|u?YuOzjtTs+k$5af$Xw5f2 zZE;1#&?7Mf)r6Q{z`(fsTM!4yxfBp_+ivhyPv6qJyZLgy#=YEV_F*{(Ij!P*=U4%UIntec?iI+#znsPK}>$x7r`lbXQ{vKyl4$WKRN6e=T z{Woahjeq@%v_2SHl7=33sSUcL{*|hM2|qI^GN?yq^d6rc8Fm`uQC93EJ8@xoCW7$f zAi~xPq-ZW?%hjj!`19%G>6g=wCnA{+A}#Ec#YE#+lO35S`!aVP?-y$rTv*CBBx1m} zCfh@ZO%5P7;lzY!D=*#+3V9`4>8CpInbS=VqB{9oQH|9RhsSqN@#-|$K}HB3qN7ER zKYj2rv-(FV;P~fj{&zVwTw#Xu4IO444~Rx&?|DFGSfS$CeeqX9%XHkay=xrhWUtjx z3x^Z{vLy4Ll1+@=r5$9+`U2pEgy~E{QU(pf%IXkI+jx#6=bmZn?DWIw-Rb@59Ol%g z)6b`i(|Msa~9=W(g=QW8%sPHSrgh zLTRyrw1y(I*?sHFUTRX~-9ygX$hYPnK^<0BfP;7cF4JU3CT@%I%rFQ#wHx+;y=J=` zl-dTFH)oZ7NsVpZ$-cZc7VZ2a8dfmR@!jdu>GBB;k)F*(N1uEB`Bb5tM2bdNAk@QO z&Ssu-7q7#d+`RLB`F54Z6}Z+MpYtWLvwM>SYSDJR3e;(>O~;XyUKrUn7`U%tM{tCW z9f7;5$Ki7CVMhlo!;KY)rv)e|PpHJ$G`+@a09S)7%A_pYWM?*~hlSZaE$9$3v08X) z4)n_WiOH+A z{M1^k(di=Pv1L8^8O<;ep=1xqLCzmE&R)R z6tC7<-y`_hJ(?n1T-#DH54hyhLbeD-IEIIdvi4X!l(rJ*fNQm}m}u9CXzTJ(#SlDI z-Y;c^;o8uctz(8K1k<&cl#0-FMDXHx+~S>6z!07MN}_y50?iSbv~eK>+di;tbsAp$8bdeh;7*pa4MMA)&Wf1H**K0h!!u@)j;L~OUV@xxon>KhZI ze0hG*RbYy_bkPeH43G zYj512(;dCYtP?qrFej++ir2X0h&cFh)Jce1M%6BqUZDG^3dM3oiomc-!Nv=-jAomk zOqYEI?epnGCDZx80jN#;iGl~blemgu6Bil2yt_=67a;4cI52!7gQ6drapGkx8_@sp zJX>lbzrVm+_I+J!O%v9qcPBgn*28S_ZraUn@^%|ldO=*^Iqk!wz<(>Dut{OImx zzEwA8bp`a&RNUsn5y#nld%Sxy|3-Siag+?|ZqMtvp}<8lL1EL}SS}uaLMOu53TTjU z@rj@8AqHNcLZ`dP&dEg_+>wvEy)-Ajj8UF9w%2lD{&p6+Gb_HP;pyHccX##pDdo#; zDb|Ezv7uvdF!r3kmng>!HW4S%UB=)}R-n$5Xaj_Ur?x}8g-|L}aIB~>)ryVY+sC0U z$5GUxt{SAZukr>3c_t^KmGz;f6#cQC+c zHI1_Gr<-$gn&>gXh*(_NFxBJ^Vu+)R3bW083`&JPe3i_EeI~`cYT4R&1uZ`*<<*S` zPYP&^j?n|@Oq7mNw9Jd+>z#tzN4lOX&oJQ`CgnL+&!8SdH{A)z|k7IKj5U>6Ei zMiAYTQ6Z#C_M4J#W@AdO8oP+n^loW-(KW$hsa4z+Ome`B;<-EfWKZ_UnryPWHAy%) zY6%@_m>LI%@JYou^!zQ2(O^$5&);(5WeXak&9^F!_D(Z^L!XqP2V;-W?LCL`K}UGF zfN6|4p&jBC53fLU-+&Z-a!UwThT|DVvk!4}v+vNTS}=dcod+bbPoHr9G=H=!yOif1 zrg}NY%v;%^gY{yyUNDo7Qa?!Zcx|1OJQWCcq*g;S`;ZutRnD3*A4Nd=)skWzZhUh!Ysj8u@^%_s~=}5RjUihskzHKP{iV?!< zYG4R&te-cZH4^K80QXk+GwmCGe3BgZ$KCEpSQYIZuVry$7silavfdfjeZRgiC_l{a zmC;6q}P)|A;j*jV!sz--6uj;+}cL z2f*cG%T6!7eO08f&<#tor0Uf)UT){Hpxc}3(qiOfQ3WZB-v=$f6zXz?mqNXpq48|k z(Af61xoiI_v&Xit&0YJ~4y=po4X`Y7rJ}^6q4W6jY`O5YmnK(VO3?QyFn|he+2c^r z+0Z@p<P1hZul+&`XbqGcsYT^@?KmI z_26>fnEpIlEXgl1Hj_5Wcx#OTx{qOtzZ-KRF}Vl>OmiVkze-ZJSa&w+mUK)ibT*}K zj2-gCA-9Nxkhea%C+Hs7s?pwwz{A1LV3H`EXe0GhVrM?>cN#j?{#X}PxEgd z?x*vgQEzk?6qvuWN9)aExkM8PbJsZWuPSv{vwP-?x(Uy!_GXEkG|{G6J@vveH5S{4 z*;BlPGVBuK@-7sjE2St-ybK#}Ti{~JuIcW@aq6yCKRrLusSrIO*rLX+ z*5C9!qtLien#0~rA|+ynD_?K+q?Ull-j&OLz{4l#pJz)L7y6JjqUj1WJXv?@6AZ82 z$dkj7C!zw3A%JBZ)*y8wd^5yNVxC7UU*1J!rHRG74)ki-n9rXg=h6nse3AK$pj{cH z8TZtianUSUc`2viAs^4Tqp+Ph-OTmg*V&h0;$`r4S=bycK7Mehg_c+3;4Y%{F~{vIT8VA5OoVE>8%cjH4E&t@{S0gvMkC zjY&X5R36afE^F^aG?r!8-8C+&Fv}mG7be?rIIts4KQM?>q``;g+;$#?k7sPD9M138 zvoBm=T31ChBIvHAxP~^zr^RMFUz0PL(GIO2-|Jo26Ayc`6B}1fiJ!gOO&`}xKL?e; z^%R#wZrI%x<^XKIiIMD7=(j6$M3IqUV(OT|*VacjH+NJ;;FecpIiGFjo`)w}{xyO= zk2wv6#c=)rOKHi4Ou6k*sQVAY9bRxAE=zt|elv5)#OsqNDy9r9J>;#pE4GX>hhsC@ z1s=};r^b5J+0Q(c6e<*<5sz_~XEP3e2NWK2>p)wo_K}m4%#N$zI_}QglYP16WnN~= zJye3SEaox9(yXUN)^DZ7`+k#b+p$G0LatOWmyj!O6PkBut6fIWEpvl|sg+mnMbr+x zI*nQSt1W5SFYYLjapy&Rb~IdgF6a^G(!#lyQ!<^F`o;S`<`MOyU_RzfX%w1r5%s*L zQ?Fg9lK?e_DULnOzDtU=BIXNys*i<3u6Rz!hIi5wR+v-Dl1u3YcS3f2;nvOq{fIw2 ze0`4_eRXWMZ~!`juv-h z^^lxzQOqP>l)7)02(km5I3pRv!EdwV;X8UJ z2OO2@H*h!!&x5f_BPtfi>o8ob-5u_*OvJT<5%p>w03YZA>xUXBSLf1aCT5qEP8 zsC!K`ZjMp@N=G)*lJumQ?DlDM6jt1d?wdP9({vH_aO=sKf^rXem0!j2vdS7 zCK~~Y7uN3SHp)hLG5dI4?0_<93z*(+wG@MHh?b%~e}E%W||>9v;X%@#6T5R_W$$vEYrRqs8vP8VaKs%M*|(z%lW8gD`pI=g*L)NAm1_PANf0Ji4l zx(WHK9C-F*nnW{sl~uWVtq#lp%3JPD7>meq2k7v{BB@g0UOl`AzK4;8}HjJaQW--*dh#^XeBB+m&lU&cDvStvW|bjnueY68&NEJ!RP=$T@{_(_+Bnm(Wg2nK*o$1zauLRry*Bww zR_Qp3@&qs@U#`FdPWE+v=XuYFdMqAMqm{ckn&Ht}D{OB^C(zwQew%#RJgwpTqYDR1 zti*_RjlsXszr`!NT(R-wtsiqMdl3{~0yI7kZ%Mhgp%2ht16Y zp4hjn>=~E+i{4STf7?HQ46;CZ>~Ee8zu1TOGM=%kh_BPv@`A0)wsUja%z;s9F`9@kdd`!5yFBQ_*ULu3P7_LHADDxEx(xli-|Tkq@obaJ zPrkS(b8=Ci#nV6jOF#}S_JU5yyEt*Ewm7%bLy8}1lW6ME&>eSl9Nc@GjS1M z_)Hu_iacWxf7`-~?j2@|Kk(p(`Bxi7?>&U*TLAKjf}PI=#NQCunT58MJA(R0Gl!X? z$TrS<5cfSAB3;HykD}lRl3~fCXxiW%jRnr5SL-0%JYF{k+lbgQJT^z+@u!1$)EtpX z1Q|p+3_Z+3AeYA_jzlUhM^^n+5NKr>-QS%6UiL>q_;`x$_cv_j;cKEetsnPxUjIP(a?NK;y@d{&#?=t_jF54@u2n7L7%K-5u4$zq88m zaE#e#AROR_kBEkp;2EN)Mde`y;^7#APz)t88^RzCk=yXPKbT=Xj-;-nN3W^#4DL3# zcQ-twD(~x--s5!{?G0Og+17&HWlw(FGy=xqEfg66nCPA)0h*gK<9Y75RCh0)Fm{QLHlFITr>r`aDt4uMe?(Lr(G3M?Mk}5`5tf_ zP3S4U`xHkcUKhUZQ06#N?okqVSqR(}Vo0b81da|NDjolLpJiw;qJuO45Y;d-rd-6% zeB%efHj6l`^-gXbQsgWyen4llc&AFiDU(IC$0_V!B?JO*`00#A&_@yWNWuclS%N!M zaG;+p>}LlQA-xVT^E-c+Qe%1?B`~Htv^{2ihq%+s|DRE_J!bwiu-T{IW9CnPjhR3F zJ~MxMn3+HQ^=AI`nq|nSC0hXKjcOdUF^GCA9%={c}rS^T)uR znO{W2jhp%7D1n(jL<`LPAxdE8_fQTs^NVcdW`2QosF~l-RAS~AXuHh(0bGQJ3Xcd1&S!A%Ys3`Ad+>&HN%mnVCOA^)NF(%NR5B zJ8;y@9|K3s{0uE_=8qzjoB4h8z|8L>1ZIAYu+z-%5cit-C2C;im*Bw6FTuiYAIrJp z1i+&t&HNI$*UT@`g_%DDm74h_YGCGPCWLY`e+g1(=4Xg8Gk*;1nfYTVJIwqHJ!a;2 z;E0(&0u0Uk3@L8rmk4{z{LHQsH}f-uU1olX7BTZnggs_{hrGkgUxE~x`D2I&nfb$v z2blSJrihuJ-+DX1%rDU+X8tI`E;D~LL%Eq>qVF;Diz|I`GrvG7H}ea$U1olP$j$r$ z@G>)h$<4$=uP=rdA4AlbnZFDzV&;#ahGu?-bf}r%W!YioXGn*d`CXPhW`2hlG4n@& z(#-D=JTt!o1ZI8)3eEhfxq51T>ASVlyQk&z2LF5Yi$qC&`;aKL6@6&fw>wUdP{+%kwk- z8~;43o>zW@|JE<+=Vz7LZvc8(z5Gpb_BUwX-k;~q7Sx60HxEC}7ytg}`ML~mAN>E& zADDcPH2WH9k&WIDis`MLyCQ9YGxVlEZceAk?|)Z&_4iNf*{6qDa?@-k8IBRiT-H{1I=ShPc&w+!j-etsuV(m`i84ZJzEhrp3-!L5$1Bnf-y)8p-l z%d*{ptm@zC4UQOL+3+Yjm9X87jO{9`_}j7!@v2ABZDrnumEV)WuYQQWz*i1F&hF+% zo9+7fZcBq$!S0XQpgBqY;UAL!VF1leA8OuCo7qWN@bSaR(a<l$3Hic?dI3F<7L_ z8(}-kH5d=Gqu-r5mEg8hOvTp`-cx+_+t;sP@Xxle$NTWSolmF7$9JoTscrYkNwU}^ zs}Gyi60{NE2cN=8?N##WfBw(p=PjOoY?9e}o;;$7Kkxk`P@>zB#?w~T?54wPYT13fIB{LJw_W9QrpJrZ4=*8= z{8RGu{9(DcOFno)XHOkpQVFjVt=;g##30jy>o^=HuOA}gQV*}~9(){Fa#S7J8Yiz$ z;;;qM=l zUy{X-jKZ!w`ZuEQK-=4iu{QYaY-Bf`zQb_KR=>qkomGC)nj%@`MvNDW@0V2_^c z)c^5$zW&y+6Z4oC-Z@EzS-aC|sfZb`PiQFrCqT+=;#4C zj`2u6sF|Vy%%MM`bvrJ8T0F%wM$w0J(7q3;P;j?ThfjdmfPIQ{+K zkDw=C@lBXkbO zzr0G|=lOB7_=I%mopFp~Sou)`HlJ7PEkUZKkeUa%LlYqa>i>H6Z$G~JCBYI;U&9bn ze{=`<`$yh#(MYutQtQXOA$CI^YaLP`2&X&t$O`06hxyb{O0!$=H2Nez9GTuxshuEA zO`?DRBzqL7w03XA)990sJ%H?_IYxE_B^h6hoo<~|&hzu)e!8U=m*hmhH>B%^mhKV9 zU?&xmQn8ps<)S8)sOTd2=Ra^*$AUT@MDa++gu}o8!4sb$<=5)(Qu+~iP>RKo0yks{ z2XsmRMA1R4;pNfv^|Z*E7>3OqRtB=OFcpSCY{fj0SDIxO9FMi>9 zH{O@c1!e{*7qD6oE8geV)f48CJ|I(jQ`yc#*&ixx$|MuGdF6x(O zzWuL$R{MYUzyFFKyV6cNeb^&$>z_+`x$Q4z>vN{P6W5d*2xYSkDFi@T`DAg;Vh)s@&B z4ZG9kltRNLXEK>CGiXr7%hAn?OoOTt)Xi`5c3Z>FC9Jp|k6QVpuc5AWSs(Ym(=G~O zdNY_&)v&C2n`>CzhtYk6qR3hrq2eQ`=%5;Uxc1^r1f6)r232!hm@-`To9UqF=FK-#(35zV zXZ>3Y+t!*w&64W5%P{QR+>WMccLYtQ2D2J>v$h0Py=>IK23VK*1k6>Wxb3uAS*{|m z-!m0wqg;h$HUKur+rzv!rGhHO2-r6ofpiF)K=th9AxbqusftrjqQwfV4Fj~R2wHt~ z8`SH<8x6huEzDh4-Bv!vvDNH$ns1nBQOJ|qEbEeF3HGQMbdKT|gD^XK#u$S5#}Ngi zOLS;SbT9c45-E*>Tk4cw68#5-tV@lmyuq!gC4BmNVE_IxD8J~X-R=|v^>!C~3UE9ODFcySB*C^!XF`994bxB_9C)$QnSZ78cz)$SE z2|gFBD8veDE>h&c4{zq*TB|Rnjmekc{AoVhHdoJ&Tbt%Qy_ztD{bckB(CIH9^w0V) z6{+!_!g#M&SQNQ)BiDkx5O>vrjb1!!pBe zjI2|pdbV~n*pgpjYg!pux3)QQ6sHnv|L`z-yzks2$p8;;U-@YvdA3Sg`iUBS=7kKT z9-@V$NK;^4LYyQ%jsR1Pz+lLuqatGBNQ`u_3*Czd<(yVi8eIhEYvi?~8E}!}@)~f2 z3)FOj@Jpiq`X%A51Qzp87_2cxb`D-9ZZ5GQHjv`DEp zH1sP9k!7?rdyk$j*BN)$M00dcefZ#t)+$`t{1Cm4*l4j;uXXbWJ$K>C7c&7_$wPzaZq-o56bGexBV%R2e~tl!ykpTe(dd5JL7(dN1A=pIHYlxO@c*d1c1oYI8V z>ibAJCcB-5%CD(7-F6?T$#;`d&qPFIhpnBmBs&7HBPpsBeMVwx5IjLrR@CHgUzC+f z>fJf9;+DOw#oaI0yLYMN?s!$sr9i23Zfc%>6DmB;+UV9Op_#-G6sXyG$C`+8PCJM-Puuwu0;{@Wjk+L}a5P39vEUIc!{NP9$m54?8j zD*AD@cE_n113bZB-5Q``! z9+Oe;^~ss=prh;OVdAQO7wF!j{$M%m?WAmv$Y{Cinx# zb1hV-I{sCTr`g?4^LzC0GacyP%`ypoPMv&m5)6Tm#LH>iiThvbGq{F=iLvs%%rDH1 z>6@qd9V1|pj^`&nnR$dnNZ~*NV!WASIKczIRj%9B1bCWlfTQMX>V4X8O+{X=fe=8`yV!+CeqSW z)GtM)a>2=TbE?Ub)k9}mauI?c~}*b zsIufLV$53j+jK+FD7wvq!;xRC32VTw*AU&;1JhDfbU;{LAd=krxLnP)NxPe;%uR|u zfu5I)b;45cO<^pBs>s>?njT($P46$WP|SFi`C6Sqy;i4D4oE!+sVF*JYD?#7nM__E zquK{xvIqkdf3r(Kq>yTqrom}SB&@EerR5Sr=-JWNgRySTm@uKs)t)l>XMF|i_ijk4 z!)F@VEGjgsTg8-e1Zdjdg@RnZgaDDUx+RXV7&FUIW+ z2+@>{CzDPSG)Pw1>LUPB79Xa1>h`A9ftmE9y=SS=j@7%&Ct-S{GwP*-7+^RqZX@Z< zyqgb;K}v5A`#^dF*H66Z4r9ssMRh+p>)(P@OWU1ptble-M?-!x#@>!3zscU8a6xsu z`hqg)Go7HJ%-YOt7hMGy5YE*QN^>cwNhjlECbrY0Iena}HYOIVJdVHjzPx0#k{t5}8 zYf^;n4py@#rd`N%orcY6jdA$-xdv%B8;xT023f3&)O*oEY7reW>WD31TN)im>Q(Cq zBcTbgvC=(}a_tuR!rKmGEV)(Zq`r)$Ndc>_q;RbD{@3kvNNq{RWtgEkf@>RdoOXscxbyP*vU+d?;%Zl&*it@X< z0$o#sZmbGjTZe9}67;sVt;APT(l;!GV5jsimZd&{n*L*8AUY*VAKm{f`8!MhjtW5F zDgJ}x=>y~K)9-;!R^R1SFPu~JSL@X5YG0UY7PgwjkN0S2UPxp)eeEV;;c6oUg z-2bXwp8Y@j?|;P)w|s&^;n{z6%73E$*I7rPED(QA^Y2WDHw|`I3KP276}xGoQtIqt z38a9Q)9z&5R*}?r@*f7-4ZB(bDFc|)?%q_lJ;m$dICc4zFH9bHyB5T*!!*-rKf6gs zowxk98l-mfn<*?Pu*9?bB%N+|j4OU0HPE-6W`>Gr3JU4bSqvv-Bw2DJPO*7ZixzZ# z#_q%k!1>X66mW5VbP)wyo*!Mt0PQNfSI5%Pa*gK)?~Vj=40SZ_-xQ;)&oR?zCDQj@ zyj;W)o6$;j$2q9`P0*tD7Z38a8K(&2Z+esVdg&BEN7eJQvlu9ScXREyOE z$|&>2P6QxPIg4X7x@q$bk=Ox+{B@q4bd+h@`U7P={zo8w5(BDo9i(}y#%4e5W&BDQ z0NVMm=O=@3Xy&~^I%1;?()7Tl`EtbponCsA9f|xsQ0Vw&tPa}pdTEypXh=&3g9hks zAS3vtz}|3ro24z7W-@V*ci%U%KXpKLuLgjdyw7NxRJ;($8X>8SayD6bj#199R%(DH zcNqmi`TSxeK#FXn?jK-Kf_F#PabP~Y$*{M4=-W;utr_%mS7dC6nq%QfBb%C`- zmL&D6$ARXE@+5VSHFzz-Wc08M{@AVc&PJgLVTZh^tv(GWa$ z>SRT7e&+Wih;Ebnyy5|2@-S%C8=RwdH_ux*ZoL5G%eASOW8zJ9w=Eh zaL~P>)L_`RI#2>gDW&8jS7)(u6jE|k@vE*T6!w@iJE4`cst;-4Vv)5hf;Y8L{lWz@9RZ97=pg&9ihysR4%XU z7uRRJ{|5y_z#vQKwevH!04WkylQ}y3T4hytP~;f^dF>5QD|!U21yEGl2viS2SvPGI z1Pm+0bwNV82vDTrM@W|e5~**u=@5PmQ^L85z% zfdesuHv>4++zF#qieYGE5<@ATvKnoVh*0$aqt131jEGm4ia#hkostN7V?zlY%I%E{ zr2`Yh8y23fOJu#l5$L;wodK`B44Xsr)r4^p!2HNm1+$J$aU49 z+;)Niv{Cgs(d@0yzSgSs5JWp-gn8YU!O$5Xg8+^mW@6f`^mW?n4Rg^)BrKaE#T?f{bjV zjg7BW{5dmn-8-v=5*pT8Qh@+`UkgMu+f@+ty5B2Y{l^~lIyCKfdT#H5?5~Bg8lh_M zffO#o;o?TqdF?6~7oq}{n%BM1J~xQ#X8}-*;}7*pfM9k{P9MQy>hb9S_yGM_uLZrp zMaX&GYX#qTBK416J;e?V3%HEKWgXksQLLsv=UG<1VT|Q`mF~ z!|I^jnqtg!Jb6fC>7*AZvvx&5dmuAlWAwDSJ(^0Mi$8hE`pz;D?hFKyv9^lfAdqW-!kAv_<`kO948$swz*3X8W z=2WSq{CEVR{fwN~)F9@u(JZid4=w3U-9Xn*!bm0-lXQT}z%4AV7O5ITYUYFY2BGdD zn7WdG3cIRur^o+T?ydDuzuU zMVe9tc$HpwK+W}94O+wE&beIm`dN*2e+#r{T7*$F;@OFlTZ5E=Qs~5MPS1iaE&z1F zL1~{BOkir0FF3=SjMj71SsG{6st40GZ$cfKDJO>j*djHXIM6u2P|GrC>jkg3rq#x= zS>XVarQJA7SySooNAtT4xtKL+SXDC6II2`+%81E)m0;T9WgVGXU-{|(fA;>gy^-Tc6ouz2 z`d8F=?(vX4REt=+wA$9W1)xBd383IAfM`m`4_*)`lCVI4#?tJzrTg38h+HF=0@y8i znK|N&)u@Qb%*e>d$jB{HvQe=R?~{~qcTC|-wA7LTOc3gUw9&!t1Ku+3376S0e}RfQp{a?^qG6oQ2F#OR-Y zh%=pr7-BY{4%!6w*1&005K!C&%>T+2os3Kq8lV#bH+qj4Vm@FGDT-3f(3QVH6*v z33`GOP39*Fcrpr3jL9F8%dk#_q1*F1j{3N(o<*eAWGWFV=IPqES*?Ip%P1m1+3^4rjF@=v>VJB|iuo)to z90n#D{P4Jy^>5k|T{h6eh(&hhD5F4(iH(yl80H1KYM>iXaqJ8NSu;yz3dw{_GB`14 z!n8yAIyI1NN|xfxPN2^WbSG|#IO2#qH*oJSX`SAhOw-A?C8@A`V?j_8;=Uy@E^oGs z39eQK)8`vYaDsw2ttB;q)9PdiPT+fSqYsn)ux-hVwI+xj(p5Z&q~0GeJpp{xgU_Jb zqyk?nPEW~v<#W8%VjP8znblStQBS&&)leJ}y$>%g_>9f$*dQpJ%RR#tR-$y_{5d+?J{~GiS#L$E#7dq(rPP#=cuX=#iUsCVd_b8 z6?lu|?x)o#0*B6~)ha5#cGGGWfnh$O)gm$x`i*vb2wa!#9GWeGmShA4jaYy8m>FR& zEnzSWUPr-W2>nY-ARPN1eqs}xxHvFS&8UlU*iT&~YaEsOtbjmgaqi<8j56-A+Ip)j zV;6P4;>U6ANQOmL6;U-minlbQIN3#E)!R;g3GHRoT#+!``3}w*fz@5P6LOJ;O&FZP zHij3rkuoXpz?E&LObT3Z@s2Et;xb9UvuzZoNW)&-hm1VZHkb; zqX0t~&%&uFAs9x@3&$QC6#jY=f-FW8$jy#hT|y{c6yStrz3UhcT626>faKhs7hoBu zZwrtHmzH_ZR0fNdrNCid+H_R7uwffdO2JJI^uKB$Nj-UQJnLZN#n~svf>0W1=3Ng( zQs84Kc;GuqEwNG}F>0Q>1WCOe|8Wqh8ow3fbumZdb$~ad^O2<_9h$g1sCIWAI$YKi~~GF zME7t2{)agGLkLw3#I}*aGG86Th221G6jAgLeBeR%A`qKHo|G`sG-aV?skrhZi!?BN zX)y3?I9)>3&_}=sOk`aKz>PG?=#mV8kdT8M_CTmeP%Y8`RME=~bY{s2+FO`Xt?d;$XVQ2arb6!;>TA$QA&bDNN*3y77d-upctU zV6p)ACTf-{CVqhXD5Ti{7Ij+eR#O|MytpiE;JSlO8iA4xa787f8*zwbhYH_P5Wk67 zDx0u&)WoeUnAS8{MQRk?3E$(bi!R-uLooDy4mPNvmjR3)Lo6Hh=!HF$d&gW}l!(lf zJ%_Qoj}&ZQ;cAR9+8augYDTjGPKG#EP&T3X2wgh~n?`8>&jxiofmHKT%XQkoC|Vxn zC?8wu!7uET%5PuVjQiB06LtqJZ~_M@Ug0z(f|F#hbd>RW$Zn1Rgg|@04thA%q-(Dl z!<{ojI0}akml@(wn3QjaxhRwqD~wtQ11k!woSgabywH<#Kb990MmXujY59^kBq_kCWAQg zl8t1Li{Rj^O1XAcJFlMB&JKMk*nJRuv$01CBY5ba99#8aI|J|t_@S2!yuY*RS*?8T zXAQ4!;9+6(&Vl>$vy)?TH377pEh$H71E1U*#u*hMVilNdA2%=cX;W%mE*iZ?JIsW; znw=|%(Gt|h9d%fa|GU={12ZM6b61p1^HjmL6CM3jD#5^L|J%pwdB zgoI}vUTvClm!_9S?38`GpBnop4gu&L-4@XJBHv%k z5*#SZ!dnO2q|*mhxQYq6t&Wc7ppVgtE!D zH04G{*@DA3z^3*U3*Nv(&LM3^aW0?_wz5N&ps(wHLZMh9gX$*1WhoW_MJGp(oq-s36qm!;2w&w0Tlzt?-`aY7}%lHT3{q^#?nC1ae^WEA^L#M!~m{uzZw%U zz<@_kIaW^_8z`v-#v{Rvk&r3riU`!VAuGqVa}Nqw3yi5AvKw8qTaDIO1DK>YYQC3j zSp!XD07}S&N?)>W@I4h8He%F>!F|ETqCmX0TrsHl-DV0BS8%8)0VrO1HJ(^*@JVUY z3`)W11me`lmRZag`+C`AU0=nf!p6x4R~}-%oO%L8US%QmYU6wXEeL&$nNte*IfdI* zYx}C!E~;9)sA}TEMA+ulFxB1P2QJuXTt2SUO!$lYMxjm>_L?1ifTOZLIv^(dRx9k$ z*&W>}yp9B0r)HOO`dQB@wbzh0oaj-6h7s1oSg&cYxb2x?9{{Lh1Q=kPzQ}A0Hh{OT zH5KmREF9+R-z9O=B(`;{=hLlTk#6-0b<0;5c1x1!8aX$|nnoRzB9h`5zN<%S4&a6Y z8~HTS(c5EEX%52UA*6l)%vz)OqZ^z__Gl#$6N+6fT1O7YYF;3Jm2(TzV7Fk5mIOqk zvN9w9@(M@H;Wj!Ezy|_uSZFLE;c#PY0C+0s4YLjKYnlIP_1q{xISAFt*{N9sd%YdI zu(^^7(~42E-k>HLLE^};GX)v3c?_Pl)ZyYBKfqOZd2GH!-uD~zxXR0bDC6C8cHGmgscvF#?)Erbz zqD~ytxkR0sD7vmhC-#6FbT9cXo1wEE5y2{E-HgJ+<~4>trTd_r4qk7}61>I^%70D~ zmoZ+C!cC?V6U-$?Y7S7H#~B5;6PZWN1dBWjPS5}ojuA2hSBgjkKp2IM9lm5Yv`dmm zk%V=&m`&H_@g6=qV`&T-(feLIZp3|a*y<)QDQSlo496Hp^!!EpUhPzjsUPpepMi_J z*Dwk<6`g?;=So>x`)ZZERYt-e)Ac`dqCh$nEb!?+!qdeQHTH5RHCJO~?K z6CtziD^yegCVH=dWWNlgi0_XxFo{XnC)An=+<|gvc_cXwJ+@fGwUje6IfBlu#0b+u zWH%7_!CmesmQB=kmI!0;a&K18R$iYC8_!K z2~CF=V7dwVnntG*7y&QaaQk)*UX~BDh))M<1~}>WlMeM>!V%19&9vgc#wms2vb;%^ zT4xs#q!+^tKP7}Z4SG!sTw)capk)eWrv8A`;=dGE|3wo0mr3P+aw?7avUo~#$9 zZ27_LWJ#BGA_8XLNtYkgq?fnaNt$$ds5r9c9=2P3w2#E}hwrUuc4WPUBk(pFP7$bE zCsF*0ImcEVtfxGQ0{@>SqONE>!aI@j-iU($=6c~pV>0o^1b>*jGg1YA|#} zzCK5HpaE&D!qI)@PD|`Y(S2LYE$XtBL%K)71lGG@yHa#dS;mIIo#JGWHX>sOo>_j} zSf%^0J(xrEFVkdjaY?}!Xp`CE_{9y~n$_^cL;y=-iH7df3Md|9D3NtuBMKbdzUAv6 zt;E>AO~avxqQF8LR1EQ4V-OF#HOd--tmi5m8*n+61efA20zX_p-B4(uh)a;2YN))m zQP{YAOTR?JHsT7mN>w!^fB`LdtJ96BsFz7aDbYBMG9%&6m#Q@%a|%mNf533bFH^AH z^AZW#K~V7pzQk0bAv=-*JF^tGAv>eGTw?~^xSy43hKjSY(>aCY{YM_B??3PLsLP|sleqeKU_#cBw5hs(SJsb zey3EUmyB^0PeP6QW00qj3Jr;9!z7IGA+-y({LAk+BZV2@kQ714khZjN*UB+?T2V>8x47s;@V@Cya67;v_& z!i7zSYL=4@w?pLB!w3Lr#KMj>?S1lII{HIWM|XZeZ*%f(I}xEByC3o7+!KU#apKP) z;`22N76N+_J?R8MF|-hOq@MBh381V|ppJk@d=UfQqyC7_`~3Ym@kxvnh@zVh*$799 zI=knEm;FgK5h*$&BFa8QqjPgbs)v}1&Zs`fViv@rY-3>Z+Ph@N+s3d!;PiN@xY3K= zB0pVbITjj2opF8?P2Nhw(9Vu^9;Q6TWxYd|hz%G~$s+3Rndi2&fD@YLKW8PG_OX>KT|*{04X#WYT+`)OdR)cZ6rHR^gAm{aO|nwS&neNq%CM%5Jp!<W&A3Cg7AN{ihY!0-$>pf-7x#9{drBjb&ss<~*0m+r{sYhDi9r)mQ@xnX<-GLdhXW&NY0HbC) zP>dCl7=igX9NatO`5q4K#LZ^gI3v%&VRwKbiYzenu&52*xiNwZgh*nu9u8pqJF|c| z7c@_@ayT2JTb;f!elzCrN);lE;ag$A;Rzco9*AA*1~~jYR-auLoXN;lAG-k?Xgx~^m=AorW7I(TnFbP8@lbo5P#s-IfkgfMiA?YZ^A?+x3Tap6E=&^0y~ zV4J3V56}R!10U_M5t)36#eb8Qg*h{*dLZJSaUrE69`i7C6(gyMAeM^2LW`VKo)nFN zdvtQ-!p6#%v=rk8fxaPQOab(rm!RT++fnzzh;|?m{G6pxJ0@0R^Qj}QCdR9CG#{1fN%5_CG$iH;QIZf$34K#6Y7}VpoVf$3qwc{Yx+$9B&`` zXm(W5Y^U4kWg5lzH;oRbk>a*n)sJLTW}{nbq{l4dc1wnD0@z(15i;b2%?MXXacR@y z!&eBCn7S5j6vI(^Z>?dP8IHbaCs}r5l*AF9vbgwN;R<*o!Ie_eqH_$s3~dx4;Anzj zYHEm7pxCZ3hI<^a%V{Srh4htAOCBC2^2`|ZE#$djPA%kHWB3=*zC{P znMWXtobh?om2lb)(l2*E7f*lqXBki!;=2NqO=m>z)-N*cbUl4##M;o+PEq`VPoNHv^8wx32h7;c}knZMxGhX zVPnsY2C=bkjRtXqaBQ}UgD;!ziG#104d>virmy1QYnIF65S&=9iz1L=*2|U$;}BFF zKgJ=cI?jwkQgd7yhvdZdYaE(W*R^qI&RoyNp*eT`8;9nt$IEfWckFR?T&l9i<#DMh zo|CRFRaNt~i>wxS0<^niCxIt4d)UBZDolx}`3P@VpwWJt8d(nH^E)!F=&9q5=j`EQ z_MUQzr|GYgtEg$e13n7t4SWI|-+Uk6PQrJuN&|e+9Ddi|DR2WH1P4ld1RVZxUK7V$ zS};XqFQM}vkm?R|(_eMtOJ>O+B475~_f)w!Un|~0FWo-&f#jX~8qTJh2mN`OlSkhr zy8daCuK_m1w@hvyd-L&ve%EK4b#L}DpJTG#HSUdYAhOAeKYHDhKic9~F|Umzjrdk4 za^2*mOtRTub5-U?~7HQFDM|*r^ua3ZI`!vI`nW*@o~Ue#|xoa zj9d_RqVa`L?+l^drTIEveaNR}7gQmMlDj*zb#+NvmK5fIe08(Cg_b`a^>K5a17j7&X=q8_vJsCEsj~4?ad(;pjbB%%S+d)ITKRkU1nzXsF|gjGfOpR zS~XREjpgIhDqpW>%f&mhl=yLcPl|fq%jfG}zUt%~CIbP!vA`zyly8wQ(9zedh=7~;$dF^f%tse7g#_c!0MaX`@p zlUe@p(_i1e^8jyr!0)h1JSQxX|0*s`n<`N{&xN;z0g}yS0C|(j0(oY-SZT?u!gbfV zt{Hvjx@LBs>zdVju4`8JxvshW=el-X^L8O#n%Rf0YyM7jT`TBCkhk597>M*E4F@rH z#_Jy_h>6h#q8M#hIDdK=+rUO9EV$8nfQS~;rzN-?Yoo03)(D#;y7Ieyu;_`F#60TYx&m;6;Aa z2xtu^YYky-VZpE^EKr)?<*R%#$?J0%Gd=L(!)${L;VbZcKs1(%&1$^f5Kw)Ey$Sly z+Moklc((BVmU(C+v#|Gv?<iJ1C;)BUD|g7(iRId_Kk6tskJ10w7t<^2KJn z;W?u8P93b#`0;F(^8xH-FQ3SWXtVpVwAB0A^&kZ zp3gR)jP%elH2L;v&U8rvZeWmH&bL-A`u*g|0zppm@kTkIAduziQMQ2G7a;O)FYlR0 zza}zdZhpS%F+X1d(MC!!P?)mY64;!rpXTFFvYXi8RsNSPDDfwP!lmwf^RS$nuz0b_ z7c}QiKAnxJU(2%HJmf127&jW7@nU;7o@}-&ZPEn>lyr`I4*G~kGecBx{agLqrQ}0q z9nhlus^$M&Etie(tD5go^C405p;q&uZ$!s)$BHe!1Od42TD3@R+x6+sFHSiJXVE(lJYjZil z_P3zPcJs8|*ra3VDO8kq&s?&=hA4^&OZ+ZmXy{{T=w)c=V`%tthK7V8Z<9qGy@nFZ z3`JRR=6=H0$f4okzXchvv+`lembx&%{1J7Eg*t8rPn&rI^pvRCA{|d>TU36&V3lW^ z@oEz;?wQe$u;)B~5-`SrEQE6+zlu1rnZdgP?O-*T*Owm+-dNcN1pH)Kq$&-5@PGP= zg1}Gs!2;cI82<@BdU3=d@WXW(NAJL+XWjOaDEefZ02jZ%olv39}@#LkvP#epVQ@&$|GA%R2KX!xZ=ZnL$pybvEvF6h z+idfRX{F+Fek(^KR;&5#<#;oBz+z--Yy7g{&Ux ztL>W4jYVPeTOj~X7D8!V1Z5hk*luJnr@ZM!E}T7@*umQn1>)pU*znbkP+OV#WS!0K z7h@cJ-VvboXb2rQkCFw1sR^#Z0AkdLXiR+p;Y@uIXit3=%$WKrs92g}ZUewtvw6Ni zzX9Ve;Ekt02^}C+7MegHd&M;TA0npVXUJ*j$f;xP&{Jo%&@h(863Y-`{LE~sQ z(9oR>=xaBu-}LtMMrz3{Ge!*-`C7{LbHkh&6>xZ<^>C0otAl4KmEHRXS3{Le*;hax z+ak^bJ}Q5smJFV9y)+CT#@5MGPIp$Ga^ZRZ6wsWw5vJe9XF{e<_k~bxiu{V zNO$`fEjBAY12VV=WN$o2Kn|BmRHNStF8?B>D zw?Rb$iMo35Ts|%2@X5R@29a|lJ)iKjxxXY1b*$O(Isr-PSDgYeEsL!I}l9sPJ3!x%he^kfvK$*YZX6t#JucRe-N?Ju_ zzHhV#%?Pikx?Y8k+qbRp<81y(jAk5^ z<*V79R4xu0%854r?5&o#+RnQo2a)AYk;`Va{2{*{uV!O|Fa+P!$h)0yU;=|as{(aq z)A?+nN#4te{!ilh$bue%3(le1YoFhl+v)Q=V|!zM7p*7br~HwR*8*m)*~oOX`tTiZ z#`D=ke-9SZd__105LAEmL!N9&DqJPcasmKsZrWPEVtWU$mP@M=2)|YVJAAIC0eTBqm2{mi zrpr}4{XS~rNz`sLNk>kBjqO~x)x5JJtT$dP*L<}>*B;Fl{c6+C-I5y;$qh}(@h00N zIz{x~RCYr{c0*HkMIJte8fC+Bi-qUp6Vjo7m>0sN5(ieE)kx*bNe);(Tyb+!wSLdT_qb0#!@n`2GhuLH;#3U9oKg!J`@%>4D%W6ZeoBZQOi%}MCc^I>EIN8vBxsLjsyV%1H%0ck zQpK9c-^B?6y=*mg7p)fdlGWta;0KkBee=>;mPO@ZV7OnT>Nu{ogY{qMd=^kF3{j$x zhWILAPrn7^w-JIDR+3qaPRR?>-vvd*UG{9kmx#h&QI(;bs>x5>$OysED3tsv;7kN$ zEil)jG)~0x6TjgXkMA12=WzK|P!2}5{GYd*!G_qEZ*K_J#3?Y&8$A*x$}~W{Py@tD zb%>x4n@WLLD~cu%&BZ^8T8muoy zor0HVfC>ugwJ%%@K+wMx>y!9b8NG@8s_ z(MDqCk{i(REiOr|wE>lR3pT{p9!AQiFJ?vQONOkhU&0EWJ?&|M64|%4?2YPDNsDiTRf<;-T~mtY zpH@ZP^bBTH*X98sJ4En#ZNBI&=bs!E;2&eeu`|{}D+@Kl)ec)j96b<#7gXe>?deu! zy{9Ufr`3He@3y|DeHCa&mHxhSDL!`a`QVz&t;S+Oked+1OUS-&)*PojBT zWw|>gT1c&kFs6*ua&v`%iVMX+qfP5*5EI5M&FACI>_e`L;It}x{#lf@dTXkvy*|<@ zM`O8K0#p9Mv+yZ+a4G-Q!5-^2fVs`IhCeI%~$VyV795zHrnVQjehipi)8 zmr(u^t4&LwMOENS952|$=bTyOqAVKIT8?6 zE~TK5om}ki8H5L;BN(8%p(JmY!L8B|H;cEIS^Ig9ili=#<>^OEf1aKDAF)p7 zGs;}bN=#}CKz#3(D>s|}lZFtZDgBL3CB_9{2#te$a^o+x*n2zttiMEw^Zn`*KG-t| z8mB+uBkDFaMt;Cg^46F*ZAJj_38N2KTaqgUz$ZT3NwE4;j4SANU1%Rne&bhot>!J_ zH=DtPZFkZ{VY{96cHDC}#oRSoliKjqB}{sAc#DWQckEM*&jwO{ixC5+m$)fqkQhJ? zN|Rni;n@fOX+E^1C@iq{DcLjBhL_19tiADlkGRp1%`ZNEkwCn0II!8w2pqxVMx1mL zUpzPgz1;V>vG>y+HzvNjA>lVWDWo%-&u3cFhIrVi4GQq}MApG!5}P))G*?sF?5k;OyO0;< z1O(dmQ8<4(1JSthqfNfNHh{Bc7w&IL(N3gXBRQ#Rae@5eAA7b3i^HIVFl7#wOr?4A ziM$CV=1e|)`RYf8)B((3W5zRr?{GcQCj;Rdo8185^@-JDJa0qCinVAnj?megc8KFT`N*54Jt9d2G#A>kXEsL3mKu zgosWlfOrw0XCSf8NjExrmuxx|{&Z(o-s_+fFahCjbr!(Xgk zL#tjMMP)Bj%SW{TCUU!fWIuqJvw}vPI;cs%#29q;W-1x2|EY7sXn^`;}<^42zewqmPS5Zd9Xmi zs*tedlwghT`H1fcSan?)LGPA!M$1>nxwEUD)#bN3mRp%lHi&|Qp_z$Rl{hwLu3_$xTZuG+q+*sA z8R2862mnE#{B8$@u_NIQp}0_h`tNEu47omF+XH<;hZ*kdFvDLv%hzj=ol`Z~Cl8-LN`bl#3aJ2=>`n~ zOcEC5(V$@vi)b?0KAJ=bv6*B*moc8&W`#lB(wq6y=D~nun|v{u&CSHyk9~U zQlY5$rCDd~ZTifJjKiMO=j+*ec0124Xmk9i4wQm!_?jPY@%!OzKcZ;m4FePRVty`! zO~)Vg@tWwP-c{khFJ+S8q0^FUZ!!zH;3mKQcUtivjT;*?m|L+i0nk|Aig`T?kxAiT zqVW!NJ{7?;t!&wSPz%zwL2l3&9ty@?;I8@BfxFT0*JZbV?PWK)I0EbnBgoA(_vx4~ zAptn!G<}-|iuqm$^QXXUZcs2A(6%5x?KdcXUCjGeUCjHt>CMpAo1vpO!Gyw2^i_4EjI%JW2L}5&t~@ycaY6qrH$SXouY_9FE8q2Tk>}t$zErh6Wv9oPfZI6A-*0PC!s_*B$qebUAzr zNq_I*%eaLfxVP~4F{X(2ayGO$^Phdzc%hGfADL++o1yLE8~Cs|FHmuV;^)fs7h~QQ zdr_ysnQQC4UQA>G6xpv&d~U(;Oyl`a?*E;CaGu^MBJl(1Il2FY7g&@mOM}A1(Lh<8%0L&XK)$&f=3~AzqvK2xG4WSrdirDc zD!7&9{o@^740nKPIb31vMRA27tKv4ySr(UEdthxB=yl7(nhb1XfG;x8((w5O^Sf;VAc#(1j_0Y}E%-Uu%Fun@uh6dfRkkz=+ zArfGlynCxh(hM=p(3|MPayF%@F7RrLYC-l zHxmQ?qj?Mu_yYD$qTzv9Z?=oUEue5Uk%o@_kM~jT7_k33iDqDP^WJ!lK>-gg<%wFR z6zo5|kqB;*%Tp2pn1nIXhqmTqXL8y3|I-$5I1aDPPzhV(y7(`*#ctFG_RG#k<` zADRDf8OR~?wLh&g*GKlhM)Kk7qAE3GQWe@z`t=d%i}5yhh+a$Qz}Ku8U3-iHVHd1{ z4=yj-Nj+?TMv~s0Gj+8^0a%d%$MgYBJGc`H~pL#SuV8e!#lr6-C0me-Z`+k z%6IfMWc)KsMf`cD!cMMLuUOBtl94v>N=HgXNmEc24GyLW;oX&G9$9^=m+QVqCFvt{ z2OFSz?d_@<=j48gN1_EWn@_yn*}XAMQ9AyyH;WXwd#N=Mv_4DX(&9<(g3Js2VxACV zqM$`IXBD(}oBzBxli`8UdF_7-)FNBXXH%{eq_Js<%^Vbs4D|=Z9q^KRU388zoL%Cm zd5JaUPBMP=>_A-GF}+!Shw9dG)|Dexa4rLK;nQ=K4_>fpjGxB0v-xZ@%h$FQ5u*27 zl0A93Rz>7iU|9?q^ft?OPYg+{Yq%4Z=4$-RgOD4O9j|_|5p|vWW<_SE(PFA6()@!65w9P5qc zuNS3{K5_KWvV~PqC*H)Fb(*?zX^8T_N&yCr!m1|Ky<63JGf1J#>(;P$br_6@!?Q}fB z;Ax6O&^>q5aWT>wprel)J(yF^&YBb&Q1;s%yj4zVevdN)V`@)Ri)%-(ZH70+65&5R zHt6G~HD4~Lcy8NBCr2nbjWG-2N4J?UrDXi;7C?&!#gpwOG_n^X0-X!c6*lxW3UeCn z%xSnkE3B-42@)|%J!GbQEcX!7sw*P1ppR_4PgeKQN2^)b0Akb6(Q_gf2hs5nJLnL#AYqg+UaEE?B%C+J}E z`00nkK(3jyuR}`K@saV*Z@&%BP2!tf#JJ8*iLZ7MS89Z~(Yd)gm>fMGeL7;KdW~Ey z_D}R;zkoa*7A*RIl8gQh<_E-J$p)XP;FCznB)D)0Br8Dp?YEYU>Mr#}N{8q)P}0y~ z9t}hacBn1I=TtxyH~0>*=qz}K1L)a7Bu&p(BXDOA>)vSB;&6ZYPY;qhoIXWSc=CSiYW zrXS?ZZs^@-5V^5>RV%JU3Y$!%aHX(2#pjmrx%qn=wzs2Ebt=0kmCEcNIEdGmA4v!B zlF-4%f=wh zlGIGG2CE^4Gb_7h!`InO!KnGAa%(;LFdF{U=J@eR@0Pjds2SIpJo>oaV6|R)QUBv0 zY`%7Rh`Djawh^Y1w7HnR>7`}0EbZCgf!vH`+nu{XCNW(^vuZ`CNSqaG<4NzkzchoP zH-o(_@R&Q^v__zootcOQK@lFtn;G3B-kld+FQFNUU5uh#PTPp${1IP$I8eKdG6!Q* z)|X6ON?Y75MK`p`_#wUR1`n6JHqW@CPD|w;C*IQbu}m{{4dV+lHG2b%mh5+6^u#wL zqVmm+4C0|dEY!@d5Z1UyrIenmed z*SbkR_gy1@NfyJMSq$AQY|H8%!EsEhDHb_*R!g)!obiaE+0&xT{92o(R*vR^wu@iR zKjEyr*yN<+HE7uEulb6(3Z5&zo>dkjmW*C!;Bgc-QdGHmuh6jOvu4U&H?8?l~)P5!e3pNKYOekk~pI;=-^qhLDv~JV3_y{Y^g!C5tbVEYt zIhrUa4I^uWK-)<_bm)gJ{q-z=#_PejBy26u6i~ikVPiN0YxKN7OHSv@(CU{!NC$MU z8_kS2{`7W>;c_*f>N9b?G`3)FHcpI}Mb~o0x_J4YW*;v;DU{znM-Ytk?Cz6Cn(h{alkx-9rEqbZv;mJK zLYES}11=|1yFPvaaUxfDcdxGVRJMBVP6ICaVwVztyHV5#>bw@&;z94EzZCmBu1fc2 z-re9mn%bL>KkeMo)!Vl_lJQ`wLg{GqO|Aph6%Ef44Cd$G9^64#SSk%&>M!kH3f?%Y z;_VJ*7qD{z|E-??b(XK(+eechq{T%iS zSuxKB6{PfYMz=x>3pRESWpWXsrl?3`pU_M*^riuqP4>xRqtn}nU?rCEqN7@xkLTd$ zo5$#ACOG(v@ovHkMj)g$8S{5!q@%1AQ9XjKF1TQ^o6tBRr;pL${ksjG2i9UPIMXL6 zhc2aa$OcHM0O|bCrQ9r6;s}&aeDc`XE|Y2wKH2z#|40>kUCZ^VoT1<660x+l^YpTm zYL{KjYF(DSJMr$Mjnk1ubiEK@AA01ZM2C-5Gaz?%`5S(vXT?t_9qCJk4xP2RC@MoY z3^VVBAwAFSh-k-_p(9*-;*}X&hXt!L8Qnwl^!d!QkJu>MNX(p##NGZ!=HFZ4eaPBh zvAa@cZ?7B`A1BOSzEP3w-l&jARD9bN*}mc4b*FMf=ul zGiO28l1Si+gsjH8Rj?Lf`9(do9Bb*|{*^-iWj&7#aMl2e4%KANY9ON)1r_bo_;R=| zD$W#_y|(Dr5P3G5IxhtSoL<-SBHeX6zrph@yvg2Uks7OS{*LTlf-6|F&8)?;9c_hl ze*m*NyPHkMbky;Sv3Pth7@a?R2Aa96DEo@oKV2=bR`%+OZLN;$Su5?{#SnXLZj``sA>-4YS-4;rhmzp6GnfS8 z4wr9U14S)=$T0wyc@WX1DMCJjhr|P9c(C3BmwJiRPd&7$hXv%Q2XnkENEW+$>N><_ zh%f1|g9g5u4;CvvLvn5s7*y=cEx%;!sUJtfcn4FXtNc@FoVqpc|L;gOv{DTVk_~6m z!ULJl_jA0c+JLDN2oWy}rs!AWf2AjZACz3&vlI!$?uw6w#XBK{o~8g=d0~Vw;3MKU zGjs?QqpihCt1t42hdX`HMwTj$&yeY!K?d_FK|wkjr{D~^8$h&^N$ZaG0B03u4mj%w zr_)uwUi&ArK-L-mkPBYK#K$WoF?FXrDQ4Vh4fgq5 zDduY_`usGxpFw{Q6#>01Vup{=brOp%@&^>GeyMOLnp@yP)ldJ%2hqq!n|$e{#`_=S z!+K+b1i*1a&^sVs$Zl`MZk?@;SuKAVZAXr`n4hBcd@oB|p&yM;JG`Y6-LfDX47z6l zNHfrohvdVGj^|B)85^HYNIk7#R%jI`)QUbFZw7*J0z(*t29<|ILSe%UODyMm$t~`hQ5t#p)8h)`0-sH-F2^2C3kNw`Ytmna{CIKd%LcXH2Ubf z0Oyde$t5)dNiLE(7t1uEy1Ya0@fdeQoCE0v$J7fGxd-WOQuB;?!O3$wkvJG`pA+|z z8GMtI*j{4uTsS46DsLULEg&Q3Vt1UFHExiQvzN|UOiHNR(>f4oT&y7n7@Y%+l+ZYD z=pH~ct^pAdcl1QBw!qoa0q^iyYs#$i_#$^P{A_nI{Ds`baKF14+U{cb+3sTa zGu*}S%iP8A7j+lIeePoTW$t45OSy~Ti`>QV^WDYpmvR@irtNVTO+v4`NJwmV(MIib z7j0t8UG$-MxQjM9aTje=fxBpveWtsplfTGa)Z}~J#bQ#gyXcY=chN-da2E-o&s_}Z zn77a6@)Mg^_rAnEbP^T2pT(p*+*?22j{9kl6}yW?WG`|Tjl{d$MT4-&T{MVxxr+wj zZg8Vc$qL*>P4FUjk&+wk zqDJg+7YUK=E^3tJE^5RccTp3*z+Lna?{F7^Jcl9TPW{7I9Y>?d(|o(e|GoOjBKfzU z`L~%&zJ8u9s+F&23l_Enzs659{AV#=zj^q%1;8H${5`GJ@Za*;$ua#G{!Yr3v+BQ< zk1Hp&)7r^#x%zK_tyPZyEja!K%HI38U4v=_!M{EJkk9`7*L+n(w-5i{^bb^Q!E|gG zcf0Lubg49!KxU|e7u`W)Gzz}`eN{cPbJ1u7Yqp_3dSJI>rB?bhH)qc)1;1(hCit7C zo5}#y??>$@Y~lnd3rgjRfoVpq5WIMtH#y>ewa( zvJuP(!bT5>Y6V1bJM3Nz!i%U>wo#cvIXq-h_d;QhKbAqk9g?tKPorz3>V}=DRCNft zVL!f(6hX~lt&t4yEK2FbNh&d?KE@=H@#V74`Dy?KEB35_FGX(6Zoi$~bm~dFRB`pQlXQg)vZz<8xQYS%cRE6*0Rb5H;xdK*QIX1%^fpe7; znpfalVV27$Z%Z{-n3XER-Oh~v?KZ;{ACBY|aIHqt!)Hmtwxs2Bb%(AMrx`TZP0|`h z(G{m^_^FT}Y28FJv!+K|n3*e=YHkAyT%}a=*bk1YmTIm65x82Z<{A)zJ1Ny%<1KKf zrJ8G%1@5d=b2XlubX^m-xeSU*>BMa~gQ8kGDH_mJ-A;;z7FEL&S84{uY3an3ok4L{ zI&me)>=Li(i7P{eg<85&R9L8?D@TQe+PN}R*pt$!D?f!jEuDIeEytdfP75q8V$Vyb zUMtJ7Z%e1HytFiqOQ*YpRW68_@62rgi{@?V%xwi*hR3Bdw=HawxFFy;UrG%KCE zqa{*Az4{GXNH3kcLn4+yvv5a7q##*1VmI#Pm(E>@$60b(eJj2A;M^5AP*lsOr_!Mg z-nxRk$@)=8PJ8&2#xt8q2}O-ibioH10gnmPGtB5rhG4Ejr~?kZrza=GLm(90q|2pH z@nN|mnUQG|rPKHs6JcDD;re|eZ zaYi!e^-PkALxQd{M%}0XoUuu$bA4waeHGtVn+!#Tn;UmxwFxl0PJH0lzIZ<=exCBM!BC2?4`)SyW zxpzg0YZftX;EcjH&kyIXwvLp)9F$Fj^p%5(3CD?e*zT)L1Fb_aKaaav zABv2cBs&0S(C|Y;ql>N#m8l(x^(S+GKmA%Bkuo0#qzW!Nrk)Uv$xXZ976bmWpaYJNkFbH}BBeKr) zj3VnW2wZ90ImKns1>Wh?*tZlryaZL`VkfH$fJpk6&?%w;ScY~`Hbl}*`e6@DO9SuM zQ>Cqr#2A5gsZ8O`IBcX~U>a10)zLL*MH}a>R7O>)yyq0A3@lZJsr=>>Ed=%B$#&Bj1y!o1FG#2~}20;ton z2Lte$UC4J)S`Xttgx%onTPwGEc$tPVAkM5rb$n@k075xCaS#{rpkwp{0mqO_C&w07 z(81zs;OgY9jYz}q;&x!ms-6zIQ9Np5=~>tgJHe^L+n{|BrcBUpO-uuNDDE zJ%ajMEPw|By@d8d22I*Yr;aS2*$5c%0GL2$zens)%*nBxC{17r0xX?d^=W(u>ImcG zv8_T~ZjUVTCiYP%p*u>W-k=UW*=9Ow48kVb^S72*qKlgzj2%`%Q5z;&?Q5Ro*iMr5 z6Ru^J$Xa2PCNM3*y$7@gZ_h1!+(itufQ?AQF4*|0RnSG0q!&=o+qWk+0xU-NCa760 zd67mD=3~|7VgT+_2h;-UVzGP)c59G^8DMG-=3;b(m-f$3>_meusM1YPwVE?-M52CH zUU9dH)hIhqaNIKNlvV*SY(Vcix9QXHkHK5pti-7-)RJDDrD4>DPHJZk4k++$iS7?! zCqx}B+u$CsVsr9`ByA#xHs4p_ci|PNdpEE;!By0~L9fQ*{c11_!3BDIYPD}W>|Zkl zv&wBpU@H?W*ha*4%)fkYgP|MsBk;K+FjqAvQU7wlZSR?-G3~+o2uArqdI55^DhYmW zH~^)nI^d|u`^EWN8`TbPSUX$Aba0$b0;dF+=>XX74xJ=T8UU}9E&6VR?hx;E)v}En zj=qaRrXsfLpveFSWq|#{Y5|xR4@2l+Ry!sg*6fy;d*M~gTK#RsMsz`~AonvH&WgPO zb7YkZuK6H1vFgwRiyQZPIPnWkEur)hR<)YV63mqb7vKU_oy=04LWaS))p>h^DD5X` zs1v&r{1Lo6@J#JNHAQLQ&}p?QjzIvn>YRmxX3Sk^Fa@Vp=^2c+Om(cHaS|OuWne;P zNh)h6*C7lA6*~pMxf5X5FiQsg%Td^3V^PIsk0Gz1BoK|&jNmjw_o-Ud&xR3kS6Q%?Aq)WZv>Df@$N zoH3`$PB}<%73QtgmV+>YhPN^qT%r2|HR+{TL>W`rB1?LtEHxYP<&;nLY-^HDJSRaB@P1`1H zv#qbV+Xu&bKvzr<1&(o>EeTf46u4iNv|3pN9%uI=3d{^a(L=thMrT!s&?_@1CPJ;u zoSJaCWkkh7;1xPWBk(GnV-k4Hm}3&ei7~?@h|{24@gmNGvQ=wylPf6KcAzUk`D6#W zYD_X6G*shk2O27Kz5@+adbNKdF7NE`yqi3MbgUWdU>TOVYTU6y^!__o#Wn(BdaTQ}CWa6sExUXA)2)gRk9wP3l zSAU4mt6mKvqOW>&h%`Xet3{+4s$M-JjZr(^NpNnA9v*_X#`>X8P{+os)<;n`Y_yM} zVobJt6jfsg1PYjiTqH2ibuELb;G;oi8BOkHo6L$)(d3U0&?ZNh@gLIIGLASxT6Xa= z0=|cqQPe!)nhYLTxwOoqrr^teww2WQ_ux>E@N8L}UD_toq7o%h^9h3j`1e_ctQ(R; zMD)i2_;MCCbRAJ<2M$pir|Ty+2K^C~HZ-UTPaH<|2Gq+q4Co&E%W#uN zW#*pz6UX!h^{gNF2iT~b(6hZ9!d!|4G-qs)OEkEbq-%d}BHH~F_iWf2`KgIY`)!G` zwvD3qpp#9QP+zc}<}3)H&pyL4BuFFRv^x@;8G_yb8sz#ou6saNoDUAZejV6q7rg%Zl{~Z@fN=n) zID`J8?xf9^i~9im+flEdzLOcfQfbl#u4*S&QB&VmWO3};Y-j781qH?mz;V+C@}8ri zEF#GPkhbe#<0^Q~9RF4_Quief4`fKbmnIovlHsm2uLC_PaF~v|U*8&*~v|nwJ!W#<$h!e@;1el9%*EJI&|xL^th= zdt&gKokae;`q@cn{Zyj$X0@Gcg3;t@wzyjce|uG8F&jJMk9fr}oBcI^_o~D$xi|B> z@pjH`9)53K;rNrJY3Ji<{nIA@-njh%=%0cHe{$}1yT^aMD_|l27y=hCI0h~w2z>!B zimZ?wq~MXB28-EbIn7Ci?{wh}z+j+34r25Y)Ez(aYzl@Af$WvW=bB+ zpPKn(_Bftr`4a*5AC}wocroQro_&5l-poGa$!eOfB#^%Ysev+mLok?qdc0lES>42i z1n4)S9SLA(4ToP|!=bl|!=GEn;R`A`v@7Xp#>MvWHedY{8}X-rJDaLe^ydz4|9K5U z_#K-3f^=!*z{c|NX}rp_%?e5m510?3!e{E2h)A@~qQpZhF?q*`M(;!-ou0jFBP>FD ziJ|FPE>`3{yqVts++sRjVT8}{!0~#ISmA64I}+~oo=k>LCc~Fy(qw@bFy!(&Ja7j6 zBQ1s9X@^eQ;qJ6N%CR(xP`2yYyfp35P3wQaSf}N!1Etzd+so1o?R3TE^=FS-zK+we zTSg@9&`E2_mnd>;IiJcd;L(1s^6NCi1E10powr_^g1KnHE59(3VE|hZ1C@_!MO4wp z@Ic4(JtE_Maf+co#qiL6JWN__E=!+X5P?L=*z~$cQciweQ{iMdd~Hh6%u)9wgFBuJ zKkJU||61}}%$v?>xHqRE&#I6suI=1LvAp;Kz>d;&ilLRFu#herU-mVP9-($M49#mt zv*_XD^-k4h=Zy=Ln|Bs`_Op1L@jnZzQx3zIur$C>;@m@e1C$ zS#M-=u5o~KjGYwn5eP5g^>{v;$|3Q<6S`QC5WmDXcC;Iv@zXy4$t!A-a+i*I({?~g zGpu5Ni7~-(Hf7m%Zw^*0{bF zIM^6T!n2XE%lAWr;91f9d?ymEgJ*g3vmHrf$g{BXVrLTh@GS1U#G#bWt+VL|`gi^X zSJ@8T5mSmwM&$IM+B{j4m8zAQXa z+dcH?43*8@VVzxSpEac7JD|cjd`EUz+zyF*EOy9qvUOv0AqOxlB#qwt_807JHkGm6 zygFZdLgYe*#y%VEY7U^76!`UYR7GyjSsVbVnzv^a?Q0mxe41Xo#h{XURMNYNpjJfG z1VjBI0W9_OgZ$QbIuoEDMh=w5_#~k!mFud1(mV*BeCWWE#v+HcSr)B48C;(^pmO9nJ&fZIP>@G!?O9wWlf8zaJ(juGMKj1l3>$B1H5?-&uj ze2fUcY>WuMe2fS`cZ>*~F(TYKMuhvui0}ntM7Vd12=|N;;b)H#;mgN}@N>rqUxLCh zB7Er>5$+x%!hK^z_&H-l_>wUqe90IQzI2QTUphvFFBv1kePcxUk})FuMaGEmv&M+< zXN(cy&ln@Z7mpF)OU4L^7jp^|s1Ig|BVNjPM!F# z$JJlszy2fsX#CeSy0GHE3dr9r{;MqO@+!I+HQHg8McF7#l78vn0AYtZn(LuO%zT4B z3xnhkmn~xE0pWF0JcjL1S1fAGGIOY^7F93eQ5L$5XapW$=p?8WaNJ0`t@y$rKe5Q0 zH(h_erTDA@elA?--sPjFYh1-`~5VoW8@I05hxk-qy8w1`j!k#q6`n&$Nd|q;;ysNVWWXJ zNIGG5g_&ew$2mmvVLadFBYffj&(QFLIv?^8124vpcqEXwsRV)_Ui$EtFMgAVT<-fT$BS`cF(!F^0M?JY%UR=sh zl`^Eo41d{jtWpXp&)@X5MYV&@%(jT|8aqfByd+OXx-VCpIUtiFN2g^9Qw+@n!~H3g z7SKY(o6|iX3?DPcC7K;M`na&O9KJkHF5P`xs+@6qyii|Me*1ZRS%xie+#ZTe0DFMt zQZ1$NqY=^Qfe8N~uT!BBkHb(KBhNP_OrA215L+<`m>zM0b+loj9ljen-E^|JRd2#}oHC=LWfSL`|>MOA>vw zU1Un8d{5I6bxBwQ+MXpP6Al^m4?SqkjdtE_5><@$ohXTDW9n&8v>0jWpzA?%9`uM# zN$6PUjExSVIr0<@NKP_UNn)}6M4VM)fS`oh23r={B$DRSGNzPB*ga|j4YcUNMsM~J zaE6KDphT*VnjO}9lvj-ZKf7OsU)C?f&+C`r{(k8var$Mrzh8PteEl-q-7kG;t6w@K zZodq7_sej1zx1K4ei^>BU%G@Z>X&XZProc6a{FcYl71P!q+f=+`(?PVUwR4bei`oX zm;Z#<4}bmJwg0#NF!=}U|5Yp1vitsHx%}(?-#_Ay?*C=i4Qu~TK>qIge_51X$Bif( zg$)e`gKZ+WXVA!nhqZeZ{oKvw1$$vl!n27{?~u*B7poXicZ)KFQSw^zrlB5O2;4XpugPts2WMP8#Vgmtrv=9 zdwe5N7xJD9p~2H$z$YQA`N;6$0rCVS!TfO$rEIJ9iiP7GWb{cyLf1)}xD8cL615jf zVjqdZF|-lis45u`j!1OYPkOzmNvo?cVcH+{a2F6?A@rtH=&FNG2i-1WY7Pc??Z@3g zq!OPvB)t$r7)ku8AKxTTY)S;SZ?DgI^HfP-dG3-8Pt{~DmxF#Y8PY9KC#N**aPeXY zhw~!3Zq%>G-KL~0yEPJomtoo*hH2DG6I_B*S$i5*vViY{MAxAHf$?`*$aDrhAWpiP zZShARcA#yQCha1DN;H$GN01V)WbNvSB#FEIC{2?Ke817JGmH<>Bp#j7yclf~xU!a% zqE*6XlMBFACyO$TI>~k9ZD@-!>azDL0Tt<82b zLc@bc4Lt44tfH?2V-N9lQ`6Y^x+T$kZy%Hol*M>}M6`nO*oqRk8sLHhjLF;tUEt5~ zWby<>^GBaFfAq@mN1x<=+$FCc4JrLdMf0Oy9zS}7@Z+wEyCWD3G#Mn9Z@saD<5}iY z5LPR-aEtK?ndTM|qN6fMxgIB7JSpNtJ)vp~TJ<-1@?rWcT$(;R|Dd4!9PlRFj5h{& zx!A0hb8xdJ`O_w!64Vf<6w$}o1`j~LbMnug^2zLOHt|q29`eZ#z2$7Nq1laRn@a}z zDKMGG5K$(?4f0~*m8kzaRa=32t0j1x>v-zs-kOi^*RF(QeOYW7KT3-%Uu+*iU=2xt z*I`jm8X}Ug?S3+nNkz)`J{8nm-9?botRA6-;Ob zvyky80kt}SY#wOnEt8q5qt!6t#uIyHybbmSN7r{bmZdT5T*?v|24!!cdWRtIrnW)u-Ng z^I$b7F2S*QRP6LW$*4cRXSPNM<$8jtd%l>=^7T7MO&BY?bmgbOTS=6a7x6M74Syja z4GX0-e6g5@1#%kh5R^|9{gN6MNoub;k%>9csk?aHUQT|K$Ha&8rSj{Hhu4ngIaNCy*pq&tWw-&xtiBZ50RjeD} z?e*bjCLikLLo2=Q!t`;{HNuGLH@nTWmrYHGHjKIoG+*jcQTU6v+HG_F)qfFN!veOT zt(sAz4Rgm4Keu%N?gRftws zJ_-c8fS~@sgFNyOr4gS2OQN!$2p1)FP8BcFpv&H7#kZ1>sLCBy!lg%I5-(h7LR_L_ zQmNF;VE}kXvpnJo%Rh=6!r};YH^zzkgsmy$7{*>mo%jKrCz9+E8^6_!J zP;-mY1Xs|P3mn089bQ8dug40b8`$Q7HnNR-aZQH1YBKayW%zff%Wy|sFia;se$P*r z3X2Br#og>a)JDlT%VeCbQvdj&=Ha+K1rGNWXq}uZg4-wS_7q!jE2?bPzN9Y8{-k&- zL8QEd_MPX3!8b^`YbS_3*_(zPQtM$tX2Fh2h#Y9;%w};#>}$gv4ZFAOp;@-kJUdD^ z=ytcVB|Lt-!;zgYwv}*oH)`9>BWmxA+H;2YCHea_#XB2*S^hFxKD#UGsxPm?OG_&1 zqc5+_OH0CInYt{xykZs1j{C}wqJKRW$XDd>mn_nwpcnyw7fI$#-Y#k!#NL~Qzo!jf zkjYj4vv?56UsAqsR8@3BnD)quj5p)k@w&Lj@*5C!7%#cq<;`^rYo`Y+sVhCq19o*-@&(F}h$i;%G;&b2A+7&2ad68G1)o zxBu+V$7eu4D<7tCj=9`5@qcMebaJ#1yB9ObgVFIsZ+k1?b9!|+UT*XbVPr>BMpiON67JJ^1wC5w?6dZ42J#; zhC4FwSuCGZFj&m}V~YX=3R{w_b}1UwAC@X84(7 zS@?6tvhbH4%j^t)k+CfNCC9Sxi^j6>3&yhW3&*nXXN+ax-(@TdzkDnUKX)t(KX)wK znZQ4mg)bS)!Y>)i!p|Gac99p2W#N~MWxhm(V_Eo;u`Jv-mW7`;mhB?$9hW@j!QvJ95+jal%L%#Y4-2Xd1tDT%U z_x~!t#{c|>{L%Y=*HLQS{}YhE`~AOb7=2;z<%fXN{s_v&%Ni6fK%AsZG4#BBP(D63 za&5(c01x%S zg~=O0dufzL?Fe0sij4~UjmwAzyOc@d>#z^G#qB1!%)yZ;0Qg^&rdZum3!C+#MjW};}J_St0hpARj01l?x2XM^+kC>xn!9cy5$uNU5 z$|j=M0a(R`L5Wpw27sv96(X7Qs+Ef zmH=qj>rq(%q}gs$NgyP>rg8vCE9ufmp9s2s-y{)I5rT7-xG`$Sb#h${5EVZw6)XqU z5U;nGJaN=jbW=~lv}tn3aqH$*?!*ccT7f(xeyJ7#^Eol!lo{SPXR? zH84tS#e)L76S1RhR9M){v+Od29^Nuz`T`CE34^7JFq*6ZN7A@EFzpP$>w{LSpCn+m zK%0o*V@#8zjY!CfW{0>Y@Ye*()sK?4(a>>g1XAzWtO2+aLn&a>Eb1(6U=~K%pbD)P zstRo$0cKBiTo}epV7REv+=pr0$BTn~dP@xvS|Id(8e)<`KWSyXun`$I(h$XOqFu)< zS~3gj^CbouxZ3X0iT!ORtnRC z7Jz`N=QX!tov4#wSmnyusjqBctO+d=1g9q_Re$kevzhf>+aFuXq-=e0{9tjqZ!^AU zWBhxr(QFW>XZC0J3z*`p%oF>N@;YCw*)dWDZq4SofOaxJyiMV~)p80P_>!2Yww)Wh zPt_T(fAGOASYju(t{NaH+um+mD8BRHR0M&@&rg9ZwRf*Lo!IXJ-dnT96w`$C47%sP zJ@Hhr`h8fO*U&hS?*B*TH{6wBya4xlK7R>+4zIhjdkKpkhV4u*@(s}(4Dgf9{+i2R z#%go@1!+_?`3NoP|6Gy zztbEqteWu}*ACKfpDe?di7EUtG3`p`>oG4CQ~1KV{~B&;=laiL^NTG1>|Xz=RLdu) zHGBQ10_b1YfBpe~bo~dWBj)lC2YmkO&)2Vm&1$?@&%uphWFX@Ed=v1j*TH5Pbh04- z%XanwAH~|N-vn2A{uFE;W^2fDF?m=m7hoTzc>m^kwt0a6ET+rn^_zz`;&CXE*YsdC znw_4Xjz)*UZ+{#7yMlH`@%wY~REhuur|7Qcb2EdJ&&c4!mqG0_GN}17sD4HURhEIY zS%FP&W&)5A$pSy^(mSIN54%|j8H^_705@^3*RYZTgeJsKH(4irkFWYzRgQZZP0GGK zX;06utdszu3GwrD7bAg=o50|Apl&%{4u13St@m{lO}Ss82bchC%sRUUtG^NEpp@u^) z%r^cwdd>ga9Wqz@wQ!wZvwuhnC0&@xiwyA4BumNvk!M|B^M9>o1*j;EC&990Q9PBW zAXN@eBgh+!Qi-e2#OgGR1vZ`juV23kUI*Qz5B;l;y=9ZHH*1ML3Z5TklZOD{AkVuT zs(l{*#u>YR3Oc}tE`-trYNih*8!BXD@K{LTNXPKjo)LEcg00#5Za=QY)miMdi zBUsoV-u&k}z-ONz=V@@aU9hX2P~q*I8KlL1&XO*-8_a95+{`99Z&;;=ti}g_ISktW z@gIM&Y^_HAMK%4)d0Stc z!aq{Ctus95?CCJ5p{KshYw;8m{?A=eV7goC#Cl{P7?0(6YP1=pP zNx}$lV9$hd!mxXRK;?{Zk6J6%Wq8fviIGKY7GCTkWp5Y0AJyZ2#+JC{SOj&U#Qd8N zl=vUV%N&ONM$%~rNAo}-oKhIxQ~0;Phw_6%KhOG5hN#-tszk?U*Xa&}AAkH}Rt}Yj zW#v(|O!ZRZuq0tk#A!_XJY8;Y=ef$_$RISDUXlo1HVahA086rP(F0YIaA-_IRmdRg zYPIobNxaxpD<7+s{_?bTFh06H3=R%t;=_aS;cN1Bd#GD);7h33<0;7}O&X&lvxoV- zvz%5d-n75_oiD{|Y^0!Ue*3LA!Hyzi3iB*M*v;ZmchGJJ|M`E8|C2b$%oK7=o1vtn zaWD;VZ88eG&=%s?JMB%2EV_MMxEzhvn<@GOWEOz8Og8H&P6HGhyC;Wcaz26MWZlHL;8NIi0l{+nsHyJt2lTV zcRCuc_kol8AEHJdTJ{o~04YjTPN0oYsno#h%)1Gmqwa+mnbII3c0)juZu^Fz$Yvo- zD4Qx7JM>~ibLPs~8pyz%jC~|45xXSL)7lhtFP3j*mY9086DVzk!c9mSJ+mbGi^j4& z-%&Gcl!U6=sALGTDG9x96Pb4#mub?4_9}@(FBDr4eH2JrhO)baVY6g!m)b;(vAtB$ z`=~K^0Uc;8*1+NmPye*yhDp?dKU?0A?wbAU<7*iGYR&v=y;FG(fCbS?PzqqlnQimX2#l(coCObUfzJD}C97 z%^yvz`O(MzkF-T-nFXb>%DKfc@Q;?d{pc0Pk49_$Xe-?83t`8R zcvmm`FkAo?A4(o}u^L;lz%s=_$j(?(T*gfpf1U2A@Z6d?eNy3x4X{;C(S#}J^|h~@edGjP8gHQUQ zm`~ZV&IUc`m0&1I&l9A!ycMa@`!f3>3Y)f*^jSdpG~|yDIK5wR8E3S!a-XUoQ#n0o zW_nh}{G%W!NFn;6j3BS)p>_&vrY4?=kHU`1U8XRPcgG217@ysR_7iWru;&m+Gn+)8 zJ<3ZWnQdYeF?vO&fiALs`I!*C1yMI^?c_kGd;GBH7tHXvA9!>W_HD+SUX zBo|qYwgYiV} znnX_f*n2eKwxwB6J`sBy{blg9%0J*<&HZE&OqP#NGrV;8JYFquf8i*&U5zI{v$fdb7zaUyiwx@i>?j=cFB2TTj)MH2?Ryjv1mo^@KF?;;aJzX} zVyvCu_rc#(I2~N$8(~_N;HP)S?!^wu(%+7c)c^hDrhvh)-7HR0_9SU1jc`XP6;Be@ z-EsY`C{fju2wE2hQ_x?3nwl?7-%oquqeWq*ag!{LSz;+basd<|WmVaV%|0T2=NgI1 zE>SZM+r?OMjf9~qF1n8Q78tVXBH29{akU&tYQ8#N;O(?##t2Sa0(rR|(WiwEu#tqyKGR&1zl^rUWD}`b%DI+~6%b{x7ij8r662-QAf0N}r;y{1-L%!&(W*=Z2xX*t>pE(+Z8Q#1Eo;xt# z_2dw)ac2$^KaN+Qc4fq(ZSYGiW)65azLP&LSDy+}LMKS^<|X%w%*63x0##V&f7~uN zz+-Fj3t(mzgT;C|pG{_)d>SvFwwr=nI$`4y_aCHIu**F%kIs1V0CeGG zvfM6;a_BeeX371@Z2_saca&a+q$|olyb??1*=5|biW>irvv(HO53{Gj7D9(6jq$#) z)k5QG6Vl|XB6ijDS9&(Dm}ZAdd#mLgB;1+4A9uWI@pMB$LM#!6*X~7IdDUhPqTCGJ zm3c1Sd?{8lcEuGtXyOWAYFZus2RSTvG=y~XVVbDq5tv=BH@?qz2t?)p&UM(0x_w`- z?d7Y-@ggr&H(@=D!t3DJZHw9;!|Nxh)db>&>7s@cPa;~)CLTpENW^Yfn<<+4?e@ON z0{`V5LM>Z%s_rQ-zF8Oe^k6%&mnoJ6C08C2k7}R7OVzJ!AI(f46UX}2jJCkjMWs4G=VuhM_FwFK4ZNA(@w5K zZ1S?zNMXCKSg@KY8%9l0DXX3Omtl-xtBLx9^hzYK8fcI<2h7>F+O6A6pmlih6{~#) zS1CA<0%tW*9drRCB#>3Nu8~Y=wG)mX5@oeiJM3QzjMYr-xPLj2QmR;esTHOf3Zr5* z({&v6*)lZSZnl~uOgoB0yFtE-QkI|98Zhp|gc}i7V}REeHC3f7!H2Chz6wJ&hp9T| zAxVWgSDi{lX~J2rT8atgsfqkm-`Z@nL)_l4T1s&he#aEAdS`1_cp0}br<&dH-_@CQ zs#)#Y2cwB|hg!{62Cy1DC%f|vx_WllVx@5krn)}gE*_5VKyVRrslLXuzbmQwuGEP3txdlh$u_WS4kHb z!9*u#c6QykH(<(kV$~J=)g~+GB?dfjNds zB=|~{pyCkl5f~%@J{bQ9{W%H3I1T@}GpFd{rq?$IW{aX7*O`Wp0otMn+c5TWMox-o zV49i0M9mzxEt>uS##WxsSrJVl#`yChf}048jX9>HfCN&4XALt&3y@vrZ5@| zyV3P)ity3!01G(&>?ou^CrOyaon9N)mYcgXyiB?m&|xq9>Zfx9g9na9>;a^*Z+}J^f9Rfq41JKu?d8H2oC3pC&u;=IL~j zs)vJUuZJz}?|G8&ySP&i>%++3`LwU@HYdmJRtZ4^4F)}e6S>VQh_YdvW&U;*6z#$L zs8fe2*@eG(1z86=UXcOSb04=t9H;qkt0O2tLHlW8bp(;gtXn5Z7Q^hVA9Z2s&&`Tk zEj^9#FfEX~xR!%6`qkW?duZgW$5Vvi=X&tWZQ=jTibh#ZQ%?uoD2ACSPGf|l<6(xo z47=D>bFNW6x#|>|Sxwcwf!|qy-7)53o@_K8DiD4bw+q!>Otf~55t4)sHLebkd9}y) z;mA=ZdLK6mS&>9ZGfE3IRnlAx!hVD;`Fp1qi0 zxiU3+|A#m$M2a(Obe|dV(#5OC7bkXFiR-0}UJ-6jwvd!=T^l7Py`+=061sbhcs{O- zuCj(*roa>wDMrU0C?IB@T-gL_O|VFinxGFOEUIYRErhRhm=1dZjWDD-i%xijOOF?E z^Wf=deONkxKXz2{V10P_yWf?M4}TQjPltzQss^N)LmGLb>=4t+Un&pG`H*zK#pRW|L!&}*vy~teKIo3p+!pHIa(4>;PCsG?o>(Hf!BhLbYm643+`=V^zEV#tv%7$w0 zeHn@G!y{@Obhcrmtqx3(K1ji%W=3{OD5gxdU?{v2_;ad~XrL5cBl&l56QAHnR(MI) zKpCm<(tin0mQs2FJiDWm?DlraI)nO@( zb<`aFf6doY=ulQg&3QJ*r}yoO9`>&4%FC2hv#L(2d*ua|=CBu@5G8Is<(uqP8ko9^EqG$y~Dn77zjjY!i zwc5Dh!TfVPmeNb32JZ(^nuh(5R>mQYIs+KtF@QBC!b8G%VI+DlkM1V}4B%U#M4iri zc7rM%@Yg{`;dL1EK)+Q=hhc|0$#v8LqjXxU<3-0S(i4D!HxlZfks*me3`Flcow%sH zQ%YEEf}Dyd&nRWu>}L&1NeIu4Duj{RgVo+N9u811KRk$e}Wi8xzC1jA4u$~KH9&`_gZ8?Ue0yV;DY z4=o2?Sk$eONe{A>0eP$PjMEMq0Il*ZKpMk!8tu((en7Np#; zxRiz$hAvhEFMQkgN*Sp<^xF?Fct z+oL7*yKWEv>tM+}E#gsJMK|IcHuymU+Te)6)7KncG2o)cFr;IEa?;d@#HXgXHVAx1 z8XO7uc@4@w$+I1IuV||xiuW@vP&1LdiN|ncqZo1QUZM{{j(NifcYI8C=F;e5G`vjO zcoXiLT^0djY8>E3iZlXc!AT=tW2+b_=soT5yBlbN0nG1e1}^D|4#+R*5C@!K@ocdw z)=N>ql)w@(TC52Iapp*zB=WPEz_84-I5*Jk=pt+jq7vEZ=SPZtZ?6)C;zv!qM4Hhi z`cqySGK(&x(cG%j^>VPys8TUQEp>-pA0cqAKLv@1`9HPn|HXiX>p!t_?IuFy$~L?a zg1s`rpW{f1@$uunaUsaKEQmBhlPFEarfEi2PS({xo)3REgV3DYG|W6Y?3gs-ISq>) zlcs}LZJWjSoMgSss-HVF{RGT7`b!2oCJn#ii?MMoOC%Tw#?EkAWc#Zd z{{~jHyJFKoO11M`^*8ifdoy%sgdD^}&3(K*lrdM~)IoRn;BKC4(b zuAe#!vMQmgr+y^KTb7K)eh~JDjm6YMAe-?p5m9$!*lLwolI~h*r z@V7AY-@HCNKK$xiI^AbY$wZRymk~xVI5(rTL=OLO8gWY;T%Qc@0LIuch*2j*yfv76 z!JzcYpQge)#UmJeNp3YSowxx(3D13m=&|F?Cl;gt*GP=pSA?)yLAPHVzc%h*5h8x3 zRFy~#o*@r#fmuz{0Xk(#2T#iM%nNdaz6&mjNom}?CY18-I(-U)ve#~xjE5iy4#zEV zdw^Y^H=cti7T9H6GT(+Er1Gq~nD&*t${~qjm|~ZzRWEOnCdKD*O4SoDV~VK8iFUG- zGLulMp6=v{P3lV3^PO3-yBxhnspiNWp9Z22MxBJUrbUuu6@#R9Qj2zxjM{>#VNqSb zZ`v8zBrsK`6exh&$%!ohb}57}pN=k@7-{MvZZI2qYf+*$7LcCVrUEZGhkeySD5Gy{ zc5_1iu19#JUWHmfdiMJ8U&bh`IwPmcj*=&gsyUutvhe6I z(Ulo$nnNfEMrwTNfK$D}hY^xHE2%w>o4pJtoISQCyN4|9FfzL>Y%=L{IL+Y}E7nz< zCb211WD2_@+Jva%OvRlxv?-ZgDmez+qCzK;-IaFQ+orr|Cv_M-`l;h}*p&TtR(iXK zhFyu`uTPhp{_Ip5pCePPv#)vL5Qv0hE1cCEX>v-hA}&r72D`eWenpdhb4Zh@H%KocwvuSi5ly=CX+3t|$1-W~)*{X*oroD`iKy#rLFl}IO04lQ zAI_am+H@63SJ_QhlXTVHbmx+;wwn$lA_z}*6IK<6r@IMH6^my@gxK<3W-La@b*t@} zsG7oV##sZ^fHZI+EemrLvgbM7d8|u{v(u($QfpH3H~oCGTa(UMKiowq789MwdM1@z zsB{(v1lbLa<09_5JCXx7tY=A^g%+b>fHa<);)Aa$J|wqF738`dJNO~M1R`fAx|hZ)90Lf1{@R4PzzPF%<^M~8!cf~&m^FUz95_fRDa z&+B8Elkj(1ckrA>7cqNh)Ym#@F?fiy!9mu3ZtU%q&Y9F`G#{UD~8<B{=x6tszct+e!U9C7m zGSS_-BOpbPMHl6YW5o!%;a|z26!6=%TeJeep|d)Vcy|71r-b+krKoiowp(5qNdh*M z`=rDO{?LJ`WHa?PlPV&1beE#riKDOzeSxzdZzC{tJI1I>?#QDEc1l@N6iS&80F%zx zV39yIoiV`{Bq&U^P!_!~20{8{!OtP>Y)?+Y#0eg&uQrO}kAu+PqMU-s92Cn}7fvC? z?yHHSFyCr-3&Drpy)7#aU8PK~d@aifF3|cmU++!{V{wc#U~*c~x9-&qdl&&p zP#>^!iOb)*SsecR?~m=30h(y}TYeFfxNK`#=hhw7 z`^*5cz5Et|YjE}02A3JU;lL{l-a0n2&n{bZ#S=*Rv0T!i8GE!(1zr!cMjV@SDT_iJ z9nqAhg`{jvBu+U46H=9ZR4C;w%-Lr3(2>hQ6bo?);HPWoo1)$={n zOeHw&X}Ly-WxQLk_+1#VcyvhP_#DTRLr{{a;t+++uxGA%s&KkdBe}q+*Qrc>?$8Lt zftRHpiy8T`u#iKijA7iZRxm7{JlkuYJfuYYRTN29b!*GWG`mjLKkmrS<%|X|mW5Is zm2`Z~yxq16{?TfKA5E$LxT6@CmwEy!!@UhxQ{Z1A0 zil#?__(ONl&yzIrFvZdQWfu=qa*xZsBoyv&Mn9)>bP{zzmR&`5b!j})irO_WP4dOXCMAXLla>80uH{F*JR-XFl zy8a2?QNuQ+CQ?^aqK(s&EJALZownkusn&S_9ZWpRpxJtTcHOTljdo=>r6;8JF0!)O z=6FsWY|w?e^hLvS?xr;LL!$>cOTciP>VUH2MQUQaR)dF`yAjfc_F-pU4ZK`xyjcLE zxrQmNj4<5H=lT5@4=<^-q6#~c#g9+TDYfu!z>&hhTVP@E3RTcg2a!w0H)J$b zD{N<)jK`oB9=2%Ea|;XetwE-P0~pUbPy*IJGvj3lidI6+j0Yw-i8?P{V&}!lHC92u z0%woJ#d7*O21Bcjijtjk(c6I>OW&ig*=A?kOLkrP4J`S_%Bh7Vj~?0y$y0~9W~13| zt5D0$s2^frBQG-SGi2F7%EvG`uHwUqOtqD5)-Oil!3%k(pkg4^8zdqNewG61ss(g% z1XYAJr!;UtM-5GI;w7jy~9h0(8Gf+1?W>BI*UNzyLhH;)an4ynV+c7vpCOD}JM#H&mM$qI%GUuEiA;XnBz9LjBB1t1W70T7gJ|#%V@JS@n6|dZ*f)=sv zbyx0jK|>|`hCrO7fK({#NiwDxp2K)lJov&kx`^!U4bNdbi-AU`r}ff3k7tNWyfs&+ zm(0AR?1=85OV3|AwpHjUK6A%fQc!tSg1u9L`8BRIrB_?IB_*9mk$bfkCBXDrwg4wC z@2r)`UQt)P)S_k%oaDU(O1qnvxU^U%baso3n@K4=iEEwD|KugC$K3(ikBO6MI-tMq{{Bk-Fg?ot%(KU9E<9^ks6|wbF?^Kh~^3l8(rhV3U zG{zdkD>sMISoT(&Vj=`(yAaVNHiC;&VQptqG`r1{Xfu_}Vuv_ZWgmt+WsXxGI=-|R zjI2!L=u@#XaJ^+Q`dEXGXl(5h<2yY)unmadt9)z1ii?%EuLx%zqAqn@*;7D$JZXHz zX644LLms-!*6XJn&j~pG_rE{Tharvg)W7?k+##Yj%Cc6Y`=VUrG0%c*!t~}v*|2lj z1$p$t3t8dc|GxNW@Q*)w3Di;F0=ztqOG?BS!dilDnB{#pDx7Q`?!Q zJATZw?P|5WhlC_m#Z6`M&jU=dFiJRBM?h;tc%y|}kLR-~%lzMYC)ttL;ctJ-w0x&9 z4-47ix1`x?4&AGr&0Ca1hdr{#I;i$VInOclG{thSR4M+Sd; zRoX7_K}5)BzFgb~L36wrm){Za`eC`+FmS~Wu2S&iVZ7p*)V@Fe)4Nwc1y~N$42+TZ z)$ZYscZyB10oP{y1b^I)r@irN^Ud40Z-bv+{YSo-&hD_zrVyZ-PK7Y;8a|~FVg&pP ztQ(Q0HUQ)4J1=Iqnr(7FD*BjDwnfNrK4`cyc{`#|+h zf41i1`!#%Xb(!RNRT~S`iG3N%H?xx=o+<-pgNZ{G$8UIB73z%FKLCg;W;UB<8)yh# zl$~8+k#hc9RNOK@Tdo>`b zvqiEmVMXd6GZ@M3pYzE^Xefiki-#P0&eTBd)gjH$k+OO&Zl9X{%T&wZN7u?h?NQ}_ zew_-~IkGhWB{gCS`ma+XiygZs?N+=tG1Bui|1ew6mJ4a9v)jLxwUM54Bdu(91E1NI z-#}X7s?%m#()Jdn_UnzHet(m-Gg$a3C`#bZ8eLj{wgKf{oN zGGS-^?$s+8yj$`6PV`MMo=$_u}~juO%=Bo9)^F!6d`@ zj$lT!O78B!n>JxtJ_qx%Tq!7exE3LT2px+sp62(n^(J41t9<;Psr~v`F;DOf6tz1X$?}EDVu0*5N2!HOwmV}{!a6$ zY_9e9JG7C_YD8neEGD1B{6x&f4%kHxw{J*8Q*Q6;=@pkknw*-8vOD{^Cx46}P}nWa z((T@QXzL)T-gLRWo##R8iRqdCDjQ!FEn>>|GrphK)6_cxqB_oroipf>QwFRWZ4$m|Rs%t|}&1RgepKm4jeeZak5l?_MnBH!$6KRNlLdo^vcW{z;G%4>Q8xG} z8;q0)&ntv#}w+J!4DIn$73mSJfaEkg+BpV@*KDnt+To@ViESpOD|DBYmbZrVhaXw*lE!U~9fipzb~<-TfiA1^l7$2O$zLY!3niUX-SkeUNI zaUiD-&b?MPU)djdgzoMI;DqB>7gr)a|iO)Z3|EH zI2@&8m&j#uV?!>S>Sqq*yL`1Y_3DW^7aEW)?=}vwHPfR|Z~c-HskX}_&n`b6vL%TA zL%z;~@hT5C4>_Q3xA(zv72Lwi?1x|_9sgjtVEF8^>f2+m9ByTLgP=ZMg;)<3HV(el z=I0~-mp(3BC#*x9bh#VLa0fc01dwd8vF!31CI8fV#weU}wL7@n>&ZpO;{3PElIl znvQo42Z?OHek>~O5Ie;>M`?n9=^o(=#8UeiVyXQMvDEg8#qgJk%PsQ6ewIiH#^mEr z>{+s2B#c(jT8$ss3mXW8zBOA1cMJqSw(EQvY?jb-aAkBH%x90dq8&V~mXmzF1{*aI zxy%+ohRO~Zu`UX>YpQ!3^w(9;=ndAv^TTZN5Il@O>u^{BKopt;$Qv^lE4#4DC(G587mAqpPN#vYakLW0 zcpZ!vP~WHRCU_d7q`){IVTy&!8Y`QRp_*8k8JO**H%GzX95TKA1pF|rMHbHwOBfPZ z)v)AszBvkJ8~iz5ueXobEDz%i|BqFQ$iY(>7$hdH*;HcR6jWB^0ma?s*gR4Z9+#j# z$m@nR@PDplLLq?VV*ZIUC33KMk3Ma~^ zc>oWRag$vXwP18@a{8ZZTb#hgDqlY>p&x-FCB>A=EBAAI$kR%SC4V56WVmfG98eNa>oBA78 z8SRv$A#gqo(((y&V93dj4PoslxP|UA*6o6YuV>SIh1O)e+R!e7omNR}4A2#-)WV&lCOgRR28FKhO2g zx18Nh6Vqw9r0>@82t9P6jD1B2};R)nr*gsci&go@{%>yHql#Gi}UZeHzSkE zMN9d$o$C)sv;Mw(`X_dlD)1Hjk<##iTl_<&6xN&q10Ws#J-uZ9%4@(~7`Atbeif9r zVhGt>zNCeY9M5x)D_7`JIjMK7guS3_bjd#3C$pGyoVCLpE|=(2%I{+H2N*{3kK@T^ zj)U#vcD|WC&2wz3@+mkA8}N6agU$2B{pR6~&v|>m5e0f3j4Qpu0g{XNzrq6jY2PIK)Da-JnZ0hS3&=JYFI?Jz=i_nmC_9 zsh^HyUR7`Ul{bU@<0NMfeFW3l`f0qut@wMH5!4v6SfR53Y@yAm8CeUH!)WGE^SKzr zg9-eXWhydSEw>xo;-`|!gZcOqz-4#PZWHkJxJJG~o*O82j9|sK7@>=uRj-vE&!5Mi z*5F6O#2*BYbt!0*+wE+w{4ubXV`13DQ42xF78?Hk1}AcHSAUg_uZr+U{+h3r%%@*& z_-t93BVr}w9+z5xRNvu-eqA3MUuA>Rz=bBRVtiHUSKmn2H`4WubbT{j&G$=jf>q`Gutt)xAuZ;aGobncLV1;St?>g6n z`~x}F^lr%%&L}bEmu?MMX)9kcAJo&nztbxAD}4LfF*OKfm@hUpEcMT@Gc5g=8yS}T z=U5n)!IzsCmi%*V%V$Y_hizeb{A|Nwi12f)imJxXwJLwt#cCy_!pX$H-eRu&&<7Ft z**38tIWgBJt;M}{4*$i2-obCS3+YJd4LGzfzme;L(%49|@VX~{9ldV%RIav3(!td* ztZUlTS1uyC9Mf1%_3a7;l?NUQGkUE^Q>I5i+hb4LDR?-Yf`aN(6W#6OZNBPBjas{f z#%w``t>=8N3zUbV*+WnfuFSHN7dA&nuX{FVmpsI!c6OM;Nf>x4Cj~F`S0X4QGEajQ z4QzX$n#Jt`yAFTTNR42Bdll$Y&^VNd|91$fMRy`IC-TyPm9OPvV|X0#5C%xX5@3 z^Z7Zu5#-4mZ!7wsZ68>3n=iJHgjZiYTwq%A7A}^HPmjy(`bfj#DLBO7LrmC!KoK;4 zE`gJ9yrd?ck~NnohA8Z6YUy>zu)3p8(u}AGyaYQM>5qf3jsN0nfILvPZY#O);7AkLr?8Po`8>MG`q_!t-FiW73bO}Zy&SJxIU>^ zHNSKY`(ueTW0Xlcw#0YM!I7%^m z_ho{`s%yH}I63=Xy`vu%7A@xmTHP&%DFFKBBrq{^6m73CuW zr1R2Le&AI+j#r;p1$4Fst;*hj?kGmYa^K3XGaqXsKW$=@xFYKWDRi4l2CWbp5eSDg&7_vWm%vGOZT(Z1Ge2C8<Gp1Mn_i$M#-Z{VuOq;w5KBt)>ONZ5G}v{ z(pid;LrFwOZlL~#H==}@lDssb4bcwl4o^)JtD(Fg+{TXl$uxlWc>W>!DYtnUGj_uM z3B%{f7$sN$jy-VO0T<69XhHJmfLKGOo7iNs^Kd(OB>R=<&-|O!<47c;W{0DR0Y4(6 z#F5f}nbg&DLB9dW8hV*1FU_HSW|K`m1wUXdQ)l^l%{rk{GN)$F3t^7WP<%mQpXFntSvtW ziyttla9|`)!V{FAu73V;ko55x+D_chc)tVN+7EhTFb2Kla^A*+`|lLIyId5ZI zar-!2u5eC}GCLD#t0#21t> zXd3wZ+_p-~Mer#_hsEi_6fOdD^2v<(5rk}+{Tbz04BJ`Cg-8ObH+Hh@G^~0*cX4dgCc> zi4bU-{m23O~1MBgO3m5*^JXx&~u zyFgqH)X*sD567zoRN}kkLPg#y6p|FK54S_sEYP(jYqL`~#!ur3o9tPLG)EK3h0Iwd z@{m4>t*3gm`vnsE-#}3m*=#OiTV zfra@|7(DE`Tp0FCM9ES!C^G?<{7*p(=o=U$^G7#SicNxH`xE6lfss!>JFqytLm| zFKXgUmCbY5Jtd_b!Upgzh_@k@tNM8I11|l;3}l*rB+U4-3tl&1K%Py;^DLKsC1JY9 zk0Z2EhHaRk>0NttOx-OoTq@CHzUWF%<5kWMoc$CO*9b&WjC`4Bm{r&zGj^j3PZ?kx z*;x&!mRb|xQ-aBMwI(&-57Oa09tJyp_gO zJf~p*+$Kmee18X82MsteKGSEw=DUs1@jgfvyE zx!7t@fXUOAelFJr`3EccB`L)U=|thw;A8spb7DH1PFWr0|ctHvSF+BYGUVxFgrV# z+Sp_;+}fb&Y~=yjdEKF)Y`VKu?l3ZYe0n64I}NgP1SlR^b(_f&-4q65gqwt`e7+o; z#VkDao!t7M2(ybBZ#PRU$}AiGz8UxXEa;p#KCC(mP$myo2%mzhw=lsE`B-Y0>Sn-I z6^zfH48rFba=W~{^FTQdgs%_m?1KhOfB3+6)@%y^L!k}w9j|-QAwQlGTMV|$ONYlz zC;lIsc!~Lf?(67Gg1?o+)cH}XdJp6O^N`N(4)5FxqXgVu59=c ztM)L#MI|TfFfdF39Dx&C&W5Wt%p7wvGI9)#S2m_e1ZbS?=Ad{1lfCgAeovdUn{ey^ zW;uSmkV10D=6$S96%H3!tim|R$RUOiDmT_+gaWZBad_2TA#m%0LWNL34r1|iai4u! zZ}LZ7ZBBv$*+YW4FjjnNy$DQ^ZEx3wC3=wN%&crT!Xq_=9LANLOq3pSm|QaJ#;If> z640E_ovvWynBj;jSn#15%SXPIXR-0*PlFgMNqdPrn-e_Qqtg%La52TCi1YR|RFCFt z#bVcg`ks??2c3G9;+wCMj4edO5kK|s?Ki5|S@5E6mnNP6ySg3+)rk?icv=}Ro;3J3 z3pSxh*hxk$b&uGT_i9e*p2n+(=}H40XE3bH zmxSbT{LzA}*W@?NdaXNUKAIUA{d;~lHdt7GSSz|6rqq*leosHS7pvLRj-<*zzc&HeF;@^f4diM9 zzzsHQ?Uny&z^6_<3wmI_(dt8 zmcIDIr!_A1YoFHib;T;pPcXi%^^|UhBMjsG_}Lh1l)GPy$mKTN+C{>ciU+rDiHa+a z!boSJ%v92WDwrpjvQ({Lf`8`d#h>=%FI~ze;717Y1xwa!Y;j6%%^+Ti6)E27@Ai`I z$U~!GGW^wJIU$^7#Acd+)$PT{?Gg{dEWB*Be8#70WDP3=_Y3^d#(cb1)<+69+0Hj^$Z+tU$bwW>%oxY_a*v7#$`Fd!162+DP6LIuqG;NS?5{*-{pCg} zv)1OqA_{fzoez!2vRd1P+$_Taj8B*QCQOVMY)z64`j{eIt;U}?cdf}HWZNd9X+B7i z{1kxf-x*>n>h(;-To2Gdz4ORgZH(;dRlB;CJ24R&rc_Jl6MK$|OXH_N?J7$3(JG-- zNP~*(Un6PBT2i;LXc0lw_`|rrY|U2d4aYch6rb79i3~Lm6FP;&C+IB4n<3ldVjM|m zSVk)$$4PN{YOdtw!4-~cQ9Eg zpjUdNE)%PxhC;=X9tjobXF3}7Fth9Yg0YMp70?V?nJ6wT_|F_F+Hp7HvtDz!C=_K; zO@1=Y0#NOh71Bkix@gePlz5mnF7aenC&J9UjtUER%D-`$P^^)%Z`{v~o8M~!cEZ|# z;3Y;rXmTq9EheT!>^oXaxvwP-8tmXo+Z`Xas0T&w@l7`0LSfM|jJ+PJmy>*}NcK8{ z813~8-Z5Wt)NvPIFfBU{#lf%D5&}))AXO?4JXuX~&P?0@TOLZPHlj$Nafi{>ZRmC*FBORfjNIhKm z@w;o#O44DNf;obLruBu~)4l1!ye&2joM!REayC8a_QPJRc2@e}b2P$syB;>K4iDJD z%Ol3*5&L~u*b5<@$B435lU28|Cy!v=J-D8=Kq^N_4~N8@HOBKf9+9(0e~jFTq0#ow zAdM;j)o@wIZDLJ=U#3ymmY}C6~ZXA@CR$m{d++oXhgjrGZ zGd4=Gp70HOM~uSbH8<+tFvL&HuJaK~f|n~ZRxs}B)2V9G$(D~%yu2ZdLA@}WU5s&xmvAOX zM+47^>X)*m^6;{xu>0A;9WbTwUUi|n%+fG`>)WGShOTAzl;B}i;ffe-Ct(xsvbN%j zf1Ia#F<;(-^MQ-ojd@O<2_=Y(9P_jeEQ@Pg$is3=4uj@=w-VopXA?U-y}N!`&ZiCu zTP{L6O2V%a;1S>6D!-e3G!HI_+g|!gfze=MZq~^kp|iT>ibK`7qiSxR%61j6%k5|r zJ%RIK3-xf&?Z=&H)Ead8VyC5w^&I>_dv2`9UL_S3AB~3&S}BD1HWz+Z%lY!2=Ax9= z%Z}DtFS_s;2YbHbAEva%-5c&e_;+phFOaJ}JhKLRBhQ3;Zj$yA>vF_)4pxP^RI1#` zEvlWNrjzM2==WHky8!?T(5C^ny!F00*ARTVhUM1< zS#5xzBJPU%6l(<-TRh#$4^8g4%<0~HK@WLZ&&crZAYQcMm9Tbv>HZs^$+IJ{ z`;xO%TzCe^b0DVhfLZhrZzJYYwoqYcGP~KK+#>^JG`QXa@`!|N1$nT$;@0t41C5T1 zi#6&d%}4|)0X|mvYzk`W?Z!TE`lE+-6v*aU^SCB|eIKm$?r`sR( z<2t?hMgynfvsr2Aj}a?wj&UD>9X=CAfIwtm2?5&PivBRW-96{x^sU*gayz6GrbcYf zBu-ouUER($tMTd+u0M-``JJwwsPOA7pWmVF;NM^-_z%yeG&CHUaJ1`#R*P;^;brRa zYMuAT>VS%Z88?>{O5N+)QGGg<6bbRD;AXbjZgM>*epiUs`+^eRgQ?KQpH!h}DmIDg zjW-YV?cH6zVnb<(?_S<6=d%f(lN0si6z~4E`R?HU7So2ET=Q6Z%zLmhVE6216Far5 zhCc-!jlsjq9&oX?U0^`2Us~lZcyL!ie8FS9+B?y1?Tad}Yie^#t83$m>&yZu+c(1Z zS8%Xks3}zi&6<-b<;_99Q%^oai#A|nQ_Na7>WokO_L_5f?VUdxyj*1g?5q&tTrQID z7J4%ce<|L=FXoNET1+2G9E~ozgT`od`05q6(ii!rv0bh5#fDk=16+(ge5aAh_Djs} zboocH@{3?Jnl0u~;Aj-=Ab-UJIpgow7*L-FaUPAv>qkiVVL6A%|2z*4SnzuI`_1F> z!@Tsr{@305o8yn=s|{2Pf1f^UM~{C@SD-~jSD#9+^O;`A8j+ke$N-eg*#p8HqFu z$kTv>!agB)B>GBcOo$E-jjW+-0xf^u>2CHh7zel8`}PnOo;pWOc5{trC=1N(pZ`0T{# z|EJYo`~N@UkM@61O{@QNhyr!lGhl2uhQ4*Im-l?V~@b7{PsY0`QyW{zU64vnHM>K z6KlHU4{+V)ldFID1n*5Ab!X?{3l$8cFXajV~_y;28-z7Bn0mxLB^f37X@@;!}`8<`2Q| zruZ>hjn?=%s(=dpzn{hr%jKKN^3CF}->QPx^Ls4jc7U6m_ype)7v7)>=&9l;AYSNw z+TPA*6Br{fgzKB&X1NU>$Ddd(Ky@Uif{9}t_!Kb9V;J`@@u|VEdlL-txqxo}=1ma7z$?DuC_4(G_q{aAvLH!= zxYKLLQ8PekUPftDzhU__0v_ z@`}xoUr}!Z7Y)Z+bK66i77o!@j@9=Vw9v5Wi<#|fB-Kqc-$dUrqo^NF`$jx@f_y7 z_uDb{7vWt(KfV*$plJaLuqmsjo>tG+M22v?{>H1)=NX0@a|wji-AIBeGR8>Kz ziiG~oHiFsXx9SzyqO$4KA~>K+k@V5V0Ol27a~u2(f>9@Iq)B#2%0%m{OU-xLVQIv{ zfS->#aW^;stABnNPz2}^$5bn4r{{+h1scLpm2&N@c3wTLodsV7WrGG99%+E+ZKYDJ zo>h*kr{^cNv$K=)<1-i>8NJ0w_&z9C&TJ+CiY%Pj8~|LGZx;rza;>mrU@($rvfp)+%pnZ%@xEZ`}lfN1Z_a;fx)Umd|Uo)3aLb z_^f(%{PyGoJnR!h;i#-z+|aXK=Fn{OQ9BAV(ehFST)a>Kr3x;E&;z9rE``tnr4O&X zY=9tSWBA$N1pJqu4Nk#-`PtwU{FkW(l#hYK$iU`g;IcBXc^SCO3~X)&gdN?aRobL? zFBs{prfuzR+19>>ZS8B<*4}1q?QYf9zD8~BYtz>LCT;C&(boP3ZS8N**1qPf(dL}( z8TiEU66P^n`MHzh}54WkNQVGT2C?nJ7aN>l2;P4_LIA zVlL!rq+c!yYY0Z6v-n~Z_LENBC`eBUin91FawIFKPJAhqjfHHNc)i5gC0kQvI}*Be zHRZ7lgS-z8#5(NZS7o;0Ook_vg;?qPn$72)(f?wzM&+|`&k4K>DBxlUT#k;A5+|3I zF9}qgELd$}a`~9QqJkcx&RYyJkX?7R<@y4@#^cuT$){8W=tG_HWVPfzx732kaUv7{KG`KADP5JHHw?V&Aen&8`N*XoB)d3b~ z4JI~hEoA+WPmjb*g zawG7S_3cRv-P1|TyX;riw3jQZYf?c=O6LM{X5y_V)?#_os&K0 z#Z3&1&5tkuvyu2H_%L40aHau2ak=tNMo*E8|I8=BS21w}dm69!I0^$?2mFBNYK2`D z8sF!Vo^152zu{Xy%%n|&+fRU;gU`~-+1%xK6a4yrZ)dCNo4f6s+4{|Td_Vqb`(`|O z^XI2;KX-@e*A1e7+6K}8BVQ5zCcy2C|A)cwRcYMpyUpiwbl*5sZ6%$2eO&vxd=`|e z-;`_LRNgW?-&msiO6|Blx*QoBO9F&LXb3W8lID@6Wu>`8hf4c~`~L#`JB*5Z|BTz8 z+W#1h@KDK!A3d?5Vpe5?@#u_VGsU;hu9GWJMO~6Scl9lq?r1`>Qil>r@h%olk*)KmM2I zk2zknwtIg4p1e6Xcr^ko-6plcT6y8b6Q0&HG=|G>Q6yP{5RZdP# zU<>cyxZvo0p8-YLCD2XW4YR6XZt@Z>_Z^EC$Gv~k_)YLPYq^0N<~)B~g8}*hPh&x& zeaIKH9Hwh90i5J~S~meRk*l^>qY|HFLO%C6ae~>_J>K31WyOXV&K4c8;lTmU#_(|^7)fMlBu~ihzl;tk-#fqU&@s1Btan%trgVIWvWTGxHpwW5#ngKuXjU$|2uQp-| zDHdOXsp>7k_;&e$NKGgvZ=_Ck-AMbWlDa^y*`v|ZXvB)PZc%UsUQ?0}7KyNol zS__s&Q;dpaSD#RP;1r%(nVEQNX68bf_c6+9B9`JrP%XX-8w8YDi-I#PNc`OD)Hahk z(JSLhL;-V@gh-$F_YhYx<%|%z!-TDiJiIXn_fCD(7^HmFH*i$-KLU{hp#%Km?P#)H zVI+Hg2GbD{C4uS(Qp^ix-ZZOw^Jk*iUxpBKpyc5cr0371B(YJ4(&}W)Dz2#w%vY-g zTL_k(JdVoG;75rQ1gdWjhPV{HWddc1h>CN7yc>r)Um7uxx_~2w1O_aXKuo4E z(P#?etuLWMU|LPZmp8C(0}#G6fy{EDscN>{M@&p(G`9CF{*7HPtq6SZ6@4*1SxCzw>9F>S=Gh{8rc}!Q5PrFC?J`2rpD?S$41~yB>Qvxm z)uucoT3*y&16Pqn*}?uoDFxN^qQc1Xz9krCbnL8U!Il7;CPP+>sf z#?_z_0h-bfz!wO^H?Wsz9^e1zo#vP8m8W!?f(qv|G>e<@Bnv+9KoiWVU2i83dO>>s zEXeKHkLwSU)#l^JH|W7)IYPd4I})V~l3T7nIMAK3&=M|lU*gTv8keYychXTI?;|8q z-b=be%$he>x`ZE(Pz@$LvNTHmj7f(PNFfMJ!!n-Z{jK{4<}-|*?jP~m_zYLHcvLO) zIawq&cDMmXlJQ;6Y??gDD^?5S+7$O8c|He+=%U}}xSGqB74?Km)0iHzVgdg|HN z{<#{cVDcn9A8VvD2YrPoTK`hx7r*YO=RRQ{XzLiKD(Vl?E>Mg&Vgmq@9voooD_pOY zZKN03beMsn%*eW&5tU%N+}_Uf(s;AHD;=;Am`fA11v@jqXEq!cH4!oQB^W(Jia;RL z)JdcY5Igr_B_Hd}YO|ag86OFSI(%oIx*0*;Msb!jqW66^85Zid-fVBze5O0z%qHla zvL*WbnHJ=60QrSCa>c6?HN`Oz|8AD&~y(!$mq|sVI*_DV@KpnIv{)|7E#z z5uqOQ7G~XL&H(uH@SU6jPG=uR8|Ep^#m`kP0+wx8`I>JXvJ-Tyi=!(A;O(5B(1j$J z7Bj-+a@&}1oCqYt1mmYC5G-3B#7*ku>IWH)Wc~>}S3J?Dx8=UNTP(kNnoPdpjC>^u z7iTEhts1!*uC|8d=Dg13QJiDIG-A`(xTYlo!ZCsVWxE8KukuGQS6nDg{I>7 zaBEB~2QaN2-6EM`M2-T>q;SGD9teSQ9`P*2fq|Kuc}THv?9Sf*3k-d@eD?OOo(-^l zYf-&m6hY|)g<}y-xuMA?4bmSBl$-b_@DHzM?qVbU@Kp&$P*&pu0nsBSGCEo=*uFie zdMDF6)^FG%Jhy^;10GDt_;xm*Z9Z`Zr1}bjAu|HoEQW;Ol>$lRfu;(i85uooeFjsu zFq%t12bN3Z_(zzXu)w2y@&Q=l?#@vlI}9JKwV@u}y^QSMB{QsgY4kY$A!i2^4!rEW ze%1vmDn|yQ_-9Y?P9l=(nfoV}Pb>UCTr}AF(Of&9Rflw( z;vy$mq-A?a&$6dD4(6AB6VB|84G!kPiKa?d_UiOXO zyH*Yg+%k`Erku06^uw4ddZ6f!bkai|*^-RdI_Eh$&pKr=`ZHUCkTc)WpM!6I9~=k& z8xX-a!B>EO_YbiH#&t-XW?L*5U*YvE;(~iU#GMiiMib^N z3Y`<%3^W6W*H-CP7`Ul4UtX7ZR`#iu!-(^voMX3iLB?5d9K2BXSTfY8W3NLBB%WSQb=b!z)-jjCQ@%nH(31aL2O!CLaKGFvzhc)da1oua_2L|t_r2L#mis(r z3+hwsP>;+3-#o0?5sLgHR@mIk|jGh z#$$;esE})8=*6Hu+s8x3onC)dMNC-CUC?+8ADrWp1tO<#{`4?L^+I=I!vYfE7Q1mx zDH#2s-j2FK`IJJ~+f?8+>1f3Q2C^K1NWSN({`8JEkurB8ECDw}{B!}kog%g^)+#b_ zE+We@;bS%!>5Cg>#v?!7$ea2=6iv>Ul{o6)aODz+2 zx_TxH4Iai*b$tx;SX={d2b_1r-R5{%21Sii5WGb8?}ub1UnrYm)m@hR*?yVql>amR zvVYW{>;H*k1HWJyyZygP75-=Web2L~`6y+0)*|@n}tC3S&)RT_F7)GEai>$&U-+)Qf#UAlx8}`od~U=7v1?u?3~!2>FzhTA)u;8>ERX{)_eEFQS@f^M zi|(I$sogiWPpyz;B~Qq*k`c1(rQUSlcc%+aNhm~%KWU*3bjkM;%#&iHJNep$5|5qG zDl!-i0p4T}`e`Ehl;1PtF`bS#;}O0nh|aAlu*4U~_)}CRY}wJK#Q&YJ>Fzspj=m~0 z>(UDQ+^X>dOKW+l%S^`)FMocz=N0r@!HASVY0VxOW-!rCr4nw=e2)+I;>Hd(;-6Sy z7(PJi$QleRXd@Q%(>nlWK$*W+4l@k-D?~v;L>CkZxb5ee^#OlR(9DFj2Rzs%yf--|zI%ScM{Mtc1MG&LU3x8dMOjR; zRy4)i{-hz-3lF_KWm%l=!(OJv>tT|WpKqQgf&l`4+A^?6bre|m?Lwq;2*|ZJ@9hJ2e84_8z>eHWF)AqrYbnQI zVOJvv`0|{rj=DC>c6Kp8U%TwgQDlfuFb9Epjc&ZUH!d_7?Tz_CMv@hzB?koE15|;w zNKEi+sxr)ONij0*z((+xeXA|JEf@q0j2pc2khwO7R?#{u+3M`eWM<@L#!AYH;{a3z zmL5%{- aDf(6Zk`$Uj_AftnR4_952R$-AY#yJ$7cqrGu(?3*t%Dd9RyjMj`XYKp z{)n+;Z0Sl7V$GgjBt*V;$mrSWUQdJ3drrpXHF^)DVDK?8*7(zm)2Pv>15hXipy><` zlkhtUX-sE{|bsLvv%80zjC1q)kKln?N_|>Byzh8WoAgKII zlpT02q|%cM;p)IYxcrOR({|2w<3&kmMGcw(MY;V(8D%W@eG$_N_E9}PrG=JhhtE-!j{7a)kw+BDsE zHs$3G*7@q2pfmo2H)dhVHoKcm#(XoT+ZUXuRQEE~#cH{I`X*@3Hc(Z@tdhry354^? zLV4vZRPzBgF-(FMIA@)+$v}=e0mN#-EHd zWK$N%4%}a`Yhy0OwI$rBS>UAk(8}ylW!AyPyBV%>&G=maLN!rT zY{MFNj3gDzBc*=)svf_phetjB|LnbKW7|fOFg#z4Ux7Gli?k`4qz=oL?HO5;9qq`H z9vyMAnJizB1SP~I!4Ra5NwmNHt*bAfK~Z*+nSGvcCNc?hS6|iDRn>Kr3f?wZLBWod zCp=rBU=Kecln4bSTont)?pJs~@AM;HaQ7K5uKVO%Juxj$Ow*!VQA=QJWAtR_9u9pE zyXN7o7Ey~PX;wJUE$``OKQCGnSBQNuC8}CPwLNZ8w@N3NViv40*V+w1bO2MIHp5;y z!(XX&oLd|USTg#Y3HVqt17A6>cETKkbh`Ip*VHOFS3G;d3MBjHdzwnb;KD?)S{hqW zgMneHgH?tpgPRU*E(#Svb|J=tTnVVjJJZ94@oNTA;ERg0CaO(z-|f4V%B5sa_s!(H z(`YeQ_6stCw&s5SaC>XtybXQ0M?@z#sUdo8O!3yrrY93dfxedgOlb*T4QX1b+Q1MfNHUR{uWm zYkxyWo_XL^{}#%4^uMMIA{dHQP-*95uUC09>F;* zDwQ92mCCxHN2~lGuT%~V9kg-J@0Vi&S9<+&PPM1UB+k;oC5w5>1B^R0UT+9ifoOM= z&ca?gTAFguW_eFhr~t*_E#6Cvdg)ar7g9z5tWjm)8}aOqqbwQRglT7rA$^mnlFrz@ ziVX<}T0go>@rp;iiAU$KmFl)zD=I-ScmfvOGY}6i|}Dg=!_tXtVj4H9A^eRKsV>{)eyv!cFAfX(W%05yD^Wx)VNYvYkD*EJjhu&-p8D=#8ts^1Ti6%2GKcROR30L(-@_kjJF=` zqc-3${kX!#*IS8Pc4)Jq#DgFPY5IwPrW417j?H_%!MHQNjl`nIl(kXOz58vqq@Q03iSFJRz-@&Kq z(S9*D7VJSa*T?JVSb`SnlpFuW`XVO_m$mVeP-SK91jrH%Mzf)jne@}~MO1v6b(5s< zv zQ{gEYkrtlL#$ylM>s;5AZ1Mo4XX%Mx!>0X8fazBPZUFR%-(B)8U0yGB-ovh_hY=Sih3LWz0P_7rm1~`dJfhe*@0R?RcLLz=J;YN@m zRx91=kAU&|Aa{c#{|5AfRU@857ueAZPhA=A1Ekgb)IP1a6j5~f{y>#-qjIT}?SV{G zE|}|Y=D(`B+kdSRrYQfjP1PSL|HF^1F6 zAcuPKVh_&__P)bpz~g9|a6nLF5`JD%+g0NJF-1$4Opq=-A-qiyGi)hnteEh%8LbzNDwYrFnkz>(!NhH; zNT6cnr?N~D5S%A(E6QUV%4Flw+zx4I;*mq6p=)Mx&p;|0jnEK`W8Gg(FtX9aq`P|1 zHg$7hTum)A99s-)mF z{dDJIU-u`&yCTGwh-;{Amdc<}ikQm<^`MGHJxk?S{q^LIg*1gc#AuXvetE zt;`>)FP@4_9r87~qxq-0s~$MCeeUdlM>|iZY_u9(W0-UowUQdiqE-9~Ccp6|N7qe= z;nY#JPJf+mdCjw_qJS z)9yFllcFu6z3OIaV7BiE88*cID!`UqY~}ITTV!TRg94Rrsyj|XL7G6>MKjOT=6#Wn zuvIKxW4S~Gha}4<;j!=gA1GM#1@W$fz+?rU44muC8(ISoe zFqSIQ$yLC;vf_07m37b$Dqo6@LkmRdAwZk3Xq`HL(@VYNeie-6! z;5CL;p8!op&B%P5r*Nz{!0cU$zPF7moT+?pZAK!T| zwo}VkclFIHXWhlA`We+Zd}^Leb#vQrYMr}zR!>?QL#9vZ9)xsanq+gR$*E)rM8fP` zht!n;jH1f-JJEc^`hK+fb4YawrT!8^eLp%qk4!H_rM*OYZh9g2EnDidqN~&b|1+~k zh#vCa)zrRt{}aK4Po{t1{cmgSd9!%`yY}b(&mZv-`){@AP6S{MOHOaXVbqqR`bNHo$PR5^w>G>|fzvXbp^gi?*H|iBTYh@hIwGj1!{;5*;j@;((A8 zxSJw=MkYuD2jHf*trP^jw^jaS$`Js_K*_bO5dUrI`5Zf?xkC5#$;n$lX%nYuLT*Hu{BP;<|Pl zEzR0(-8>!Mv}y{`^6Q=F1@82^BVIsb<-ZdzP(1&Ywa#zX#vSMX8YX)xod3-~&;LK- zBj>+b^jro2ZQaFwV3HArv;eTT?&VQNgO z0XX=iG{%F9`e;2C=;SVVB-8n*ASBQysH`ESu=guN4kiVaC)Gc>l0UhUe>GRKzxQG9 z^u+OJGmm}~o0NAZO1o@dh4yUBDIv*ehaDd69`KJzY=?K3ia22~$$wP=Ug!$f?7$2! z_MH?)Ym62Oqv_zr<}XxMsiUpaZ>TnmxV7G3-Acp(;o+I- zzy!Uc)Mh|H2WR_r8Ru!7P5dqAI zW#Nan?R^^Chs>)@TNX8_V^eO42W+oMP70p0890Nv7 z07w=O`VuY>5cxr6=^xh{jivBa*r>WA#&PHo}Q{D=BAm;2JRi462J$o=IZm+jg|G)=k7ab9~ME1aV7~h>8ftyx-Xvv zyFuPnxsIHCbIj0ITF=*?=N=Oxs1j}`bUp6Hf<3^P73_`e#Ind-ls*;BB`&@oG}Wg3 zXgVVg#o}3C4Lg8W8i*O#{^7xUMom4#`$6t4jZYPH$ET~CSw4gMme(vu3gNavO!9_| z(2+I^mrQ^TSo)OH%JWuZWqo69_4)I)jmC2{ z%qx~P!<#ck4Ytz4AhA!}#=@szlc*Cg28ZGHi)+!b=zQk7SzW`apMSr1;C9gJj0WKL zD=(p(SZYv2q}(#FX4H)&qR+HHt@;0Vev0xR8+-qe{y(jiqWypK`JeLNAMttiS(1{% z5g=LPOeL1o#zo4TKzQ4_BGM(d(2REv?EF>20sN~c=l_9^&;O^_Nz=h^NC58K|IJ2z z|F>5E^#A!oK9&>3&fCMo{q{F@sATm>xRmV|FG9o(%&=&uZNp~|+Hc{nel(rT;s-ha zN!SM-E`HE(;+|>nfAS9hx)1LE|mBjGCLV!E{;ru1S1>-%fHPh2;RjJ<_pPQ2Ikpvc=BOu zfB!2|cXomJNV6oR#Mf~bm7LqG&y01KDYX&2j)vm_Cddm=k(703m>oR(1TrnaeYbUT z`c(*0&nZSZa92@ALDMjF+0uEp3s9C18%xxSvjdW&c6YuCw`e(fHy{OaoKteO!ZCLw zauf%^9o*Ez)9r0ilM$cAS#u{>$bj`{gMp&gI8}or8g*l?fS`c6>!!0wrj*sEPl}A1(CiFlWSDqks6w#^BQAx zoMLQv+qqZqYZFk$uZ9Ztcvqx({$fmNf%!i?}-Wi*D~ zy=47a)a!*yUw`#%mQ9|KTh+5pGJ1ydu{@cLmcob?XB21}TBWENX`kZ@tM1mEL11oT z={~DUMe#PIJ63`K6R?wZXG0Zp_GOUU7|m+9hqp0<0mr1JbU4Whpy+-wnq7w%DRjMp zDF0C+CQtB|gqb`1I*jYn>uEK>c**r=-E`DX&S9tF&tddQ|4X_<{UhNfgW&BAs!=eJ zO^s0_Q}6iJz@4pnV6_k~FJHuiF{OsMqDv)uF2fj$^I#CPaD>xI+MChsbP#-`OI?@~ z4oN`w5f}pP(t?-+atW3UD4H5;Leuj}gw~{32Te+$StM&p z%T6NDD;ORp*LC(?!qKX)Fi}YqW=IGznk(cq|HrK$ryNKqH_Y+3>*bP?Sn*!W zSSBM~hT?%BOAxG7!(B#_EC>iqUWQphzo!~~D%iI)yh+>*W>FJLI+|Q3l;9tWumn5GQW0rc9YWLtG>>?48LnO)jp|*-^O_OSbay@ zfYaZPy3?Q&a|*3IqS88bVx-TsbH2jn*08xHYhssjr@%RGBLxC_2snvVO3y5HVqrER zx)-EVM<^?t(sH0057xm4&D>tM6`MrbtdpWe9Jed^*`mhfAbH@ zfAC*7?f2{5->HrH^55EOb0shTt*p2H)c^h=AJ+ed+lTMoG4})VNpB#rWswr$Yc7(G zZzgofThB<0ro8>6U2KCM$69CuTpMvZXZz{e4Xr^ny0{wcH zQY>7taY?2Yy#m>4s4w+Pi5J#Z^b5{yGN#EcjMw@*?8=FBC47hC3{l<9FitQ@I@VWa zNG;Wx0IVT1Q(+EuB5Z9n#PbA`Ug}gk^^#e*pAin-H_=Nbqg-Fhutdl8<-#0nk_A{6FMW(Z(q zrBMSRH=AO~4_jf_Xf>P7WuRZr!|?26D{xG99uiT#cxd#bAGW?bIN3fp30rGxl+q9$ z?0q=<5FVU;c)NQX9=;1tcDGOW4xxzpSQo)i8ZS@Uuw47QVUx*cum#Ki&CYR{wsHSn z^d_7w@$d-YZ0(1YtvZyblJ!pb&FgIt#l$bSnf>}fb@azgr}OQ1X9wFS z)N!LZ zupSWO*=_exScsjA3VB#%+X=jeamU^?{@Mbf(4Y$s| z!wH|;k4B@Hq^WgOb3lG90hiWprBpN!on1_C}mh1r&-4^l*GD5|jz3qm)s1Js%(bv9)K z`gpc|dUm`UIv*f)&akp6v;@7$(DV=g?PL}rB(?BBie{%N@A2?;*w_ph39vH!wznhB z;lnz z(_{#pq}jvLltl9}XU+xAdpPz~0p1C|;AnX~a>8-cD|x21(NMDLfx+n(pw;VUb9IGk z@*|*d-Eea&d>pb)PRBDa$W zxfYJ2UXPV5?>>f|-sGkTwWpvWydqTc;)w=ytwI~)VTk{~qpKYS6m~-q=4|AHngd&a zNz{Cd80kG4InfsU4#(5_J=O=O4HNNBreK6@5Y8cm~i5<;TXZq~k6DeYeq%{}?A@M&Q?a_IuyhAPWVMM5ZK z96V_PGakMIR%Q9kNYk$j9zK0qg|qU3I#HnL;~X=Z0Jrr(okKVc07C(wm%#%}Ia*-F zRFx_DO%r63^cyP-Z+6#=u2v#&J**Eqi zsSU4>SlCr~3phyAG3=oUU5nvuP!Bz{hGcU@t0R3DN8YtYttLp8fqMY*76NUXn9^nOy4gVBX3| zYnmSxsgs`Ke&YrEeOAsQb$|TQIg@|{nFX^4Wpr9ryO*{(aE13Uw-&sc&OidZfO(?3 zKptx<3$IJjbui!GilPcvtrJhL;&`MiR%kZqNT$RGawn}}0E8 zKw3LNfe&Og5K?c3HTnw-Yfsjgq-?FI@hitLLG2*QrtLe*2}m~=F4e(9y%rLTaTmma zu4>)V7NOdc_}1))y@T!jvz^`c$?4Yi-`gj9|Fx@NlXQ&*6BIiEBw7j(T%71OAe9Gl zhRJiEj5j@OjalirI}3mVq7Waag`NH=%hrGFK$8 zDK97cl^QPX7vcDB@K?pGcNGP@oUo5xL#8|;Liie%*Qr(URZ~fdLl014!K!M8S!-(z z7I;@Qi@+YfQtdL8%dV0su(kLKwtE|uVElrR{D}!Q!9olgr+V4Bws%?OxrH1L z9#}eMo-`~^+vC9lTXU>ms%5A+JzUnSvN|bqgk6NaKeETTB2I81aB?8kYyw}o8plYfmnLE zRHY6e7JW4qyuqqtk)`yq*3_wKG~6|W#r5qfbY&rvFu#^P!L-Za8~{{+15hCt>(+*#!x6`upJ&d_G#$q!p4$%-!Y8nNAwMb&yz;7Y6@hl~>;0hW0+zxGw*8CUNwMst7T%85gvv zap=$qBC4W9chCqaWr#d)c^`EbAiX&2+FkkXyYF6-_1;(92`0=mUGB+JGwV~;07~|r zkDXWB&zTb44cqWBbEe}h9^x-e&v@T1wrAbViXdRx+Sry&>8-_m6&6_r*}z_GU}7g5 z%d_Nq6ub5)a*e)`{bn95FBj%XA;;kYXHiI*Wu4P=nvInn~!bKzG&5S}enRZHh7#)6XNES-LQ z0DU5~lma4z6jcCFZY~QaxD3tm?T1zY*nB)krcTOaJph+QA4n48=>P@$c$MA2fQZNfxAJF2!KkD{OCVI0_P85+|@mo={ z$EHRtTsMdFZ>y5XGnI3N{ohO;|6K+0e?!rFp3HoQg!;hjR(FZ>dzLQIc?DHOR)hPr zrlt4_ZH{`^W@&vUKekv|g3b+*x98&TA0~7ER>HGApVYfajG-1s-B^`ahy+*!Cbx39 zbb{@^S#>l5#SObKT@fDUfz4Q!(-`-hxSzhFu&95u+MxBP-r)Z#y+P}KiUYxPhf8*@ z%G3mFHXA1fnL30ivH(;7VL$AWx$y%rEDodDHIfK^^7bA6?)3TBF8zw}7x9PiuePit zzVCrO)gv++rjjE@F#4*fsB86#JeXP`pMF$b*IR@!j8ElPufq-D3B?-9tzQe(`IXxe2q`~z%elEjdSf^CMo`i9 zvJlPzUr;Kz%EJ>*d&@AUX$ll{avncqDraQC%30PpVcDzzfB zkt=UzqkuP0U%O+)6NL2opOP^Jvw#zNFo24PP1fEs>%yx{2RKl!RbCa5?;|ZC%dS*I zRpt;)jj&Ar#J*W6CF#~vz$8m9VAw<{0iXb$m^ka0TtC&weR+;)E zX|xER;O(dI&1(T?AQ7?1erT<&|ESO5Yz&Av?N_o|_>g6G8bdc4Els)Ss@E^WN7+M- z9u7KZRYi66V!l&jJ%I8-aV>ein4hIuIpe|N`W6f&i!1%%@2B4%?N(0Pdk3eraObrB zZu_7XHthdb{m8KU-Kh^3nsaf1$BRl?8Z*?uxx>eDAk?SPxxy&*NX!?lJ71t*%g%gQ zrN!9=D!5mwpMJDUi31Fj8o{nyrwN^Yntrm1kUK{nyXB>4P`rrsPT!&w1-khV-aoV_ z^mkp{vTeM5@EfmOr(YLuAZzX5A^X|5&y@cUJhgA?_3~gf?GTi&Do#Oq+4QTj#p?9S zmnyzvsbc?9Ie6$@tT6odUamMdU;IcfmSy9hS4CB6x^>t)%JXc+^K8|#K5=1vMtEwj z=gtc`7p4^dh=!DGf|oz_;I@&RIo_ zXufD;cg+$7ro!MY96e_cb>cxO=>4s?yZgda%qQ_h`q28UJ%0D8*|=^wkInJuJT~W{ z^LXJiP?$WI*OPz8^u`e<3qqrjFD*7d2$&h1VA?}{Ws3s?DGz7#4#pi?Reers;i@%p zNJ}uJj0Kh2&2)`CkDpkzQFO%U3AsXYMJz+)W|I?ByGgYi0_F6Kv@_T$z^o~?FZ;Ok~qJfaW zO_E3hhg;*I1<918DOHY^HbcWGob0QMRF~&qPG}ZP_3#EwE9RxLS{t&q8b(uzp+${a zM#s4u!V+=*L75C^N%>kMaZhod2Fhs#=FN$?V9ApGFk)Stxj!4X7F`CTWcZ0k{F6Q6 zpOgefLvED_cg2pw^egdI-V>@R1?EC?({d)~fsHN&DKaFDpVr^rB~L!c36m|KH0h|) z6zS8VXhE`kkQXZ-7?~1(JrKFFf_8n?JH$(>Ks}R7EnC1W^hHLJGY$Ooqe!W_d%7D= zPuUX!*&&}Wu#pa9BHgn zS7mMFoV@8&W9`VIh2!~!4F|6~+M;b!+&6kuOxC996n2VZlSs_e?Sj!|1nV556jax1 z@8C_dUB8kU&rF;Om}lt_Mr+^H29U+_9I>LTynf6)=0Xu~)P}jMXD1+TwNF7-3V-GA zJ6oq)>igFI-unai(YRi1H15-X4QXB_iolVp^Y-LqUX^SLG|X42*yGmx9(OUcK>-qm zTbw@;4%pnnXzaOH9HD$f7&}hNeZBm%a>Fw{dNH{W_x399Dj7%S>?S#Kx^x`loh5N4 z%Dk0S-YOK51%u~8MZ_7TQ7<14hbDr8+K})f8rkqP{S=RgLQgXpxJ1p#Md87!bmyw0 zAC<(y89AYb;NXxTM!p+M4Te~(A71?U#Q|}6>Cg-X5=B7hI^oYC|WAY-X#s>K`&qe{n^cE zv7aNjUgY%xx+_^6f2#Cr9=rCZB{t%_I0+}ayMJ$=?4DM?a1Io@=_$a}%U?2h9opm0 zOKa71u~&I~S0%$`tpoXzg~4LaB)Yo^XkuI5q7)75LY$@e54dKz<;(VkOOt2Q@+jak z>9UBdSW~Fs%#TIx7V8ATExV0YvK8?w%q|vgnoI7gm+=ZZ&+;&c+|7l3t528x&&ei4 zS$CJ(2q=gxwhjd zp}Kg>*Hs@ezI?4+$}1IHS^F3c-<1Y4uy6{app{e1(u->N>#yOQnk#qIbo9gceD$8? zH|CWmn*cg|Fcx(n21R)g%{yV(K069r8MNnj0qdo+&Y-+E>!tOpq_u?;ehQV17=sji zjQN#0IICfa)@alB$bbt3v zKDX4dva@!xB)odY#e-MRq!(`wcfQ9yH5Uf~WrJ5o^xvy*j^EH%tWVrb+6M?DG}*|c z`2J=-eQZ)w24lSicn>j@gT52K}1cFo76)8nhc=KjWugHEf`ZRYrN--AR0GwvHyDv!>Bv(xtWoedT zExZ9pEdvSlS*lZcD5Yo%Zve_lc(l7r3B?xaQ>zqj;SE4r<- zv#uxogGoO3)+C?vqeQEmA_Gc4r$klZtL?*`-8X}z17%)4qaP}NfFEcnmcyGj8})D} zzKjQ$zG*27&u2+5F2|5oDbm9mfYl7~R#dU${_d2bJ-h)Bt#CiSEqdmbk+XqE2W4FZ=m{fIH`L@ z^!J|7rAP~J5EQK7oovHODVD+;0@5NxW%Dh%VerE#=NDEO&Pw8)T$DFiZF>zm2FHUX&?yI7qB-bloQlS zqFN8nMwpaPln&d0dXd%ejvPP?W6VA{rA%~~{A_s=4{l&BUsBc_@!T54m_=n2Ap1dA z@hUax1bw9kOp#UYHcSGBA_W9K__`)?P!wgpI zB6Ki6)XGFf6dGSd0oPSQTDOirgca^YG#M_NUQ`JR7CHTJveIg7uRp)OmX=`c zxk`8axm~3men7>jorjRK8>^N$@t~cW5HMIz)5UZ;e);Sf+B|0U^Uf5d3H?Wk@X!F%G{1IA@TKuS9uVc}Ztq(_U{y$0$`|26}u*=%D z0e>=66;4;`fkts@p3xO2x)+p$H#~<9syx87c}U;hOZrOLlgRmm`RFuNQ^{y` zW@WLpn+=G)ktC*s?U+Ip$t8>f6OfpcvT7H8qqY*cb4Z5P42eJA3ry9X8Kmb)_a)Za z*$=l5KOAjspW-lgPT%m(kttIdb;GFMRZ}Os2@3DL2~@7@SEr|M{y#1R-^#K^-_Zhe z{k%E187kz5U8mYO$C7C_lRIxUOE3*cjfJG)+El8Fqya7i=z2;2uvO|~XOTX7rh*=I z)T0_FR)@X}p-(`skWI2jg>Q1h34Fr|=M2Y-MfLD4Gfcq{UtngqZHazBSc9pa`$^oZ zg=)(z>kWeiG`mBIY6o#NL3$sLBRYto$v~s4&UUO5g@`Ni*kc(H8 zNoI6;SEodo_$nZ|j)Q0j?JCXVuE?3>y_Y~)eVq)R#FUqTW)w;RnQWGizg}-_X477h z)-T|DOR~x_`3%KKP`n2oenV-#KVq8ie~cb_?C%tNP-J-g3J1E*D7m!|o(Cser3mFh zS;;vq6#7yj4r9ztl8pz^P1v1HCU{EV!s(o?PQ|WU@x4M6%u;UQNkx^{#7?L^RdY?G7@`QFxJ@0wRw;6L8x(i5YPy z0L&H18I)ufup&_g{zm)~^zM_~SLwz52+l~%WJE2)LciPl4%qe%Vik8FKU_*p?{-15 z?sY8*Im64o48+(hR~zGlEiXS;#=Tcp@;>9HgUikyarsrCE={iCCiL5KZcYd>Q7M*%W4-O zm>#~I>((?^K^M5$I0AxP4|kcPeW`amF6Bd-xaED?``FQB%w)GFR<%#y$EC7ThLyLd zi$#~snVPEP%y*E7z2dGQE{{CFfd(fCBO2&fSh!aZ8_X}^4P%s1bynvH zGIGcQ>pjb6sA~!|aCrrjpX-jFAnar}!yjH>MuXfw-r=OfV|z8lqf)BEFTEu|ZUGRm zD1B6PW50w?$zT^E8fT&ahc{APODJ{iTe3_t>M-g~Qrek;qTHMTx%X1@{5$U|QT287 zR0DAbb!PRAhjTXS-Df~`8>4OAAtn4$9LGUAg;kFukgi3XFeq^iC-bnys&Ls@6}pXV_0WOXV|yqZn-j8=mU3Hq z;If+^-SwPL(XI*%4{PdxX%M`~T3$rMg)D2OkU|57!Sd0W3kP|=4RYmQ7T12a z6}%)-P6gzA6QS(i;as7Jzk=45UyefW1RkMV0+ckkAE?*)K9Ff=4huV|wzXNTq_0td zhm~cs!p`{!7?T5ph8Zfar~*(^p055b7*z=@!K|Iac)GBZ+W57l?yt3Wv6}o>%B4@2LgSEk+%cQGtJA7AYz8n-iE#5y?H9K0wrHuLNNqJLp*-+Wm)GQks?bij%iF7+2^fJ;Jki!*Souw23SyEz)VF4xY zV2>_slp)8C`;gc_`c44Veu0%WmJ)HVTKC?X`)w1+h`iiZynH&yoJjNhmhq99nwQED z3D%1h$b*|;2<$W28%^V(C}WV>9>i?PfdrRHubL!$dKpa;qLhPpbPiGzZAN`jt$~~V z!6uXOs4lW*|BMiNfA7uuDy@;V0Qkoil9@Bj&261)<2ltyQy_{XTOet_g=dy1W579Lkt2>+##&u z?fPss!ugC9V(W`3qs>5gfbFcM?A+kA%?OEmF{)9bX*zMIOoA2sLNN@kYvIjicnc4I zXi}n*U&0?6Kh`ORV2!?F6u(w@tDMDA8y_hVm*;@rB!R7bSyA{Z{q8y2U61zPUjrWGMH$3a=7L#${=B)d+NfJ#%zkFeNrl*-;u{!jkN5z6z?s4r_iB=Kr}K-G8Lo$h z`)$O@g{Rb0hesib5Y{m0z)$?r4^K9Mo?72Mio+)H#lpjNm za1&Qo2iED5qoG*Puikb=xV~`PAz5 zOKkK8{#uP0W_M9AigFOyXx{oz@*lBvxNMzl@9mMAEb8L6Z9Nx^qLk`0tp7R$NuQevt~gud1In_xEa&MAEH(%MYw7Mxmv0zfiem}_wUNR&R>dn}~+ zAk0Sb^%%s`xHqT%turY|hSWw=XJa&leb|{zW9J~g0Gc#llY&gNU;0GC^HLwby1H2B z86~iJQ=n7^i^T|aKuY+^Na+<`hV;lj2Z3Zp7GufS2;GBKx`8%=phD`B4in}pJ~F3Q zDI9llDsWq4H0bT=c7POjV{VPEUr~K@XQO!3G#zp#`Taq0zF-L56|%(wS~FT zEd&8YtRN5$FO*|}lq!N_qUB^n!IwY^IekP;sx@-8u39d$N9{zUM7e1sHq-`O7xm^E z8X8S&Gy824#H8<+Fs)=ItrQOK#7%ox)`4>rW$=voup*$`F>(%U(a^>mgg}PyWF_sX z&+3c0zvnRvO~2*kcJz);%Kn`@t$~|SouX}>(F4@Tco9EH`WwH|O7XEF@%n{Wjf9Vo{@220)pr24G2h|#>E7Xi zL*9vR9m9+vi<+Tm8hT|ipsHDl3ye2-c=HKJr_HH}a|9X&%xKch$U2P))&OK$v|2$Y zn?NLysYBAFMAZ@_^?8Kom-bC})q!On$dTGm9MMYm7Hw-piJK$oB%LBT$GZXLt6XRv zOQrqFwbpMlQZc8@Ak=-Dy*-@=G*G)0K1Hy$w1?u!45uFRUTHD)@z*OGoAig+seBKN zxFMH+s$B}Mt?&I(zImaHS_DUl_7=>#JflKSu%oVA94P0epJv0cf~Z1Q(n+@r}ny_CSQZ9=n-te%=FFeoC_nmoX-ez(;C5~G>9Y|dySED?brYeA; zJizXANVN7e9HEgA(x6_W7WROt?6o!nK*nqcWT@S~Oz{qM05qwh>CMAQJPtR*VS1Sj z{xSN;^r3l!dfra>AFbM>&T8(}Pr&r`bI%aO6>MVjr1|n6QvuTS18MnybQ~b9m*&UI z@ZoF1t?olOh#PPY$nPEe-88>X@OP_fDn4w$lhLzPEb=pct=1kk;ol1CiK;NI@VjMx zuY`K592~@@4ShYHMCU`G2;`buRI`zS0hsWWR;c=r0Li_X zCsO+zrzxOCdE5%^Qj}xp+wIf6gYUOViv_mCEcdc`=((pP!fd0l#Q$9=0!a6 z+&TEF%#c|!cN$Fs>19wX5hFz)UII#Pw|dEWVl-Z;HpN<^m2PyJjizA{EGd;9t!Y0v zcLLrXo*nF*w70+6-TwRD!Ta{%fi)Lu8j`;4T}kR-m?$xr$Z0@w?#F&lbq*R*78=Cz zMmtH+cgl7?Yp&N+CEOe5xC_kQ)0;>^HrvYhCPpD_K;C)0(`W;lx>dGVM>{##*O4|1 z$wR_&3p<$j^#iSKF`p9QiyUqsTZ-G4d@_MYQcu>cs83tFGFn+1Y;jlx*hWg8ovm z4Hzc?jYTFJq}EVw*YG-4ymWDqkt{6Lmyo|&`i~`naESNHK=?W&mH-}80zn^I?T9|e*s5j2U1#r^d88{<~#D34HP7j~f!sS}{KQ6`6 z?*;rMjxu&hOVSBYde+gCC~_$A5T4Y+XSMJVgQ2s&7XDfb|C=9RD>xyCs{dQY{54L* z@gBU^a{=Xw<_na-tFe zDB+N}27o!mnUIRA1?7H#whoy)Bjh1b57C-ssk0PR&`|iEo5RaTGF;#M#;JZ3#`tA;zzRQEA@AjbSyFO?>_dWDUP)(l*)oS=2dhbGfBWn3Z z)bfp}qrL@nQlTD}pj_(rti8_|mQddD}Sl~w1G1~+L>BLQtxI0L#dFtudb z7~x@**Mhqh0_VQY1P-dR(rxrZjp*W!ysPUJ)wS>t-F6C3Q6oQ4as;=mw_#dasQPxfVS@t5yzbGXsrM5ez zQRn@2IjC?}|vJe}(iFnI=LzUcOMk#4W z6!BJ0^GZqxI72F`+-7L{iIzUfD_udu`bG1UTKM6^cmD2&%3=8AWLF(E0FmEUZ|@v01fd84z2A zaK@E+FFrM1nCd!MLPDWrWCwu~TVUzgju(Wm2GYxp#CP$@UfREWoMs7MAdPY{z$!<3 z+f@>YFltq1?x1pJ=z$$EOnXo${vZ8HL5Ku~mrN~&DaT|W!7K}Jhzr$oEwQcQK{7;~ zkMT}RGb24^e9RV!BQx%LxD_I2JwR)A#PTe_SYt}Ilxpk?sx0TTX^jm>V=&(@Q$B~Svc5X(h6qDe&eB^k+!gI<+XS(LL8?MRhPqPCG(r+5K*p z2EDVt&vQ_xugaWXnP&}!a855Kvv6luXhC51Oiqb_agf?j3wV5^bR*ZXoDE@qbh7F6 zRoX~`!NWA>mJe_r)--UDePYb*c)O2h6Ce;VQ2}j90^1iRX$YcOKnhwqNLYEv1Nm_B z?KU}U65GYGr!ak94Ua32&m8R6t{#$^6p>{R^^Bi_2Z>4|nR1NNIgw0D@W;owuKGCF zRUhZN>f>Bjy_QKX=PL1OkZ6&)DhCW>uVAq@atSYOtqfx@MOol@9^rpo*mUBW%Z^|p zqQgRyIA(@~s0b^-XHHNB{uP{BDqxM!V$y|K%EN5dLAgHdD@ZENh1zc#iQgX|o*fkx z>X_R|UuCh2et|vWl80xfM`x$)cZbIxwoaAC-2gh>I)1-?_zQP{Os7OPg-1EcZn`q@{2LEqb;`x zUEYR&(FlEaMRU^%WOM@%Dkj&W#3`ez`0j@{uxb}*-qquv3>+RTa>Jj-y@2{_2Uk?} z+1A?J9x)gyj-X>SU?R?_9)4tpE!7LC6H9O?U6PtrK|+CrnGIQ))`=WQ?)H0~n`B5v$>&9k6F*TaaO-VeZu5STXFk>awF_}>p z>J;byS`rWVvd%mK$P5;~gs-JmrPVMQxiME+)z{nBoZhZl-KCnC!xf$vrgV$F7BRE= z1S2T%W%X~=UDK$i_l?DR?{;^GEwK^u@6$)`JhAta=NKpti@9*9Q#&m3{L*1e83r@D z0Gg(yQCb5#N~^`y>sZ3aDq9~N+uTf}eEZ<8tgRgma=V+nSRXX1#XG^af_b!D8Pv(wM-mtF&uMcuchT8+V+LXH!c zD?B!4#Im%RgpwMOhcOE@d_@8X8U-B0%Q)3p?oZ5{@Ex4uXb~A*-)#KFaW}34olx8q z?hZiuGNtJ!YVj1nWMmnw*miIu)X8cy`jUAp)qNIH4_Fh(4I_NJ<)~-cZh5-YDsU{ubM@aNV^QN{yxA^+4}lc zr7XpIC5n`iR1lmbB9{sxw;RUvf*lGbJ=}J^uyPY&sJKkx(M#-8)&`Oek>niIv7y2Z zRh@Y6ne%>mM{GvU&nifLNNl(f7&$$W`i`jQY{ZjhTMoq4y+C5bgS<%XMBBexR9 zlQWx=O%(YCie_^ODCLr-_p}liJidF80!>i6E#QFwCY>{v++(^g>H^tY$&y@ON59W_F{tyT8z z_oph0ag)kQzGb=>^OQgN=I~gcx41lAha8wOYwCou8(Nns3@T`6@Jd6vRymN+t@$clF8VhYJ0o8 zyX<(FE4g!c_I95q`h_Ve9)fPseO&ZsFzam(i{$)5xiu$KOItln1EQDY*Q-x&)5oG}(poxRtkze0vD>_6Ti zv(^bJ)!56OD8Irgb3d4=Q;AepxCB8Sy8s#TkDdYnRk8PVpb4#sV~Bx<=&8Q$huUnq zETGU1%YJu+r#EAWm}R+yKwqUgPivyLO(z(yg9BB`C5f^OHHWkEI0=M6z4RWDyWgGe z9v=vKfzJkST)x>YC-^6)Tc>;5x>~c*key2^W$pXrRzhNi7fe#AC6%y~P$<_}c@XE4 z1Yex`E1%%Y;$qP3L0x{id<>8^3_2z4j-DnT?tEosEeH7V$|1C+)gC-^@N3FO#n-E^_8UF1zzUFC^nI$~Ft zScs}(t#aZ5c1ASU(JX&X&~q^z^_;jHdIQ;zy9RO~kZth-SlqOm5GO3b#&lRpQ4`N3 zUAD7Sw3;ejsy~1ewaP`>l8}sLB2t2>sCyEIRqXZ!bCtWcjs?bMkfipQ15323YCiIZ z4D-_tNYcK}fymm~djOO^k~QOZ&qHvfoIMCv^*CZaI2ALquH- z7sCn)9ZbiSY+CE+KEi{{#C276O-{2MDqIC|!|XAGz$!$qJMuQkl*Pz2#r*Q28B@O8 z!P)-4Iw_E9p#k=AJWb5yqvIEpAD}#c;UtOBJj9)J(gYRUOZfML(W~ zl2!+zbLvzNlue(SUk~9gHOTPgX3WX2xu9WW4H8WwCLS2OWXgi7T=GdY0!`Ny zJ$F2L4MkTmtqe7`Z?gJi=FS;olqtB@HeI!qkFrsvQIhOTA-1ZaO=7gqY+&8Uk;;aS zENyJA2XD+t)$o+{=>lXEwTo@ng_-xe3IHS5qB(`LJK=Se+NmdqY9EHm!op(cL_dd1 zWf{*KQVvV!?UM$Z529?>?qu2g%EcJWPIbDg@epEXueP={O=nl))mR&`0MkW3_> zkUN`i^KtbnMIe%dh9800t^45%CAmV|`gG+-jDjLgAa_oHU%rRv;_zl@!Q zP2k!qvVvvgPA}`|d%27U$gq)%kwk{kjRh6v8l+|XUR92OVWzORb9>L1qq;8F7U5z&hQFqW|{c!O5vs`Slw) z#pw3dzJAwq)u8f<-?bc=AC5w!M(nTH@BY($x0-vmXT4i<+WS_T!*|Vw)6bLdKNy%T z_uYrHlhf@j93s41ExscMYkarizN6=&JcU<{d|%8}LF2mVd#|qs8rLn~d##>rT(A1x zYo%|+Y4O)w1HTpkTA?CKcsaG~E+3~c+6v_)``Ae53T<7~ri%f0Gns_AY_u=_0!SWI z3=_LQgia;>iE=`(z7dJ0%8Ao$x}I3Ec*vbtD5X0EAC4BE0H7qaP2F+hmgRj`p+wEt zmaZe$@>%@zjP%ePKqk(nLh163u?@UPZE|dXZqI_x0pv1GcdTe~g;Ar8%3h!BGE`_} z%Z{5=Ht4f6NpCWD6g4)hwkL9aG6L>~*_KmcniLf^>U(V@ zW3(5){#vvgHoh568W}B;?iDj zZUUN{!Z!RizYB5uk>*}jj0L;W{ej*X{Ir6%Gg2b$qfQf;O9`grb=pzKJ#R1@rrz+9 zB^E80V(~{rWIxlEJxc6Evo7DD5H7K@#x2GU5&`f_t%N)?MHIOl=?#^>qfG9mM`m8a zwez%Ga29s^>e^^cvRJ5uBq2ur8c>D#7j+V}OIOf`TCf&EkzKW;p#* zNBulP6Y)4ji^W~0*->F1VV|PFYxav+y9f!c45EMD5DX=S+C2b9^WV$j(U^=K^`bcI?oJLWoMH4VetfpMIE!9RZ!XiHmkwr?)ZH($Svk0POFK zRN8cpWCVUpLNS_+**Vg&^-4ss92Y|E7iC;ZJ2DEc(fzD&3w(ZAnRInOwaJOq2gwzo zjGqbAVyH`%rDWYDQ7%rpQZz#uk(IX%>v*ttTw=juD$r8~cD72vASG{uHHlE*};{4pj83(zR*CdRQjw>eAg zPghoXbFLD)=KN_38ZpoATvL8#C+aQ-&6v^sa2cv=8)ni_TV~L<^>T?+f?k{^ZW&Q3 zqJ~bEWa{Tg8@ZC_XCyiT;YL_>;$>55Pv5r5Yu=4#X!phHNKkOxBFb_Y-d}mH0#OTDm_INs>_`#){ zB3G6&F6BxW`6<5jDdD4XmldTZ?ki;CzTxP`+48sizGBVi@Vn-7_+9fk{H}R(5%}CG z*L=Zu*3@muwzA~_>M)MZwOXGv`g9Mfqk1vsf52d{%-3rJyk2sdWX5fkXF*6Z+5u*g zXKsv*Oz;kXye@&7CK+%fR?sk~dgq3WN7N-{#NiTv_w7dAi&&kufytFiJY79BvVAT5 z^;hCRzgiG6C>$@`^`$Jbv_0+f%T+&lReZ*yNpgtaD|;6|d=rpy(cFMD_X@XdMIyX4`U zr0m^K58wP$_HOX-&7kbv@ZpfxI!CMihNY%-ZcC?S12d&eC1%I}FSA)Y1rG6R0b zbv&>YLM{#)NF|5c(y_U?jk%Q`sw5RAuf^T9kZ0$RQTJ#HrEm^Fb)QOWSjmbcb;od8 zR&gsv+1)i?=!!SBP-Xm?ze0*EEWAP(2B4D*7%;yET8?%=GQ7`F)kvUCgj?AACcj2ah~>M?WcK6@i1y>z#i|-s*5e$M- zQz2F)3d#aI2sSna)4RufAuB1@PlD!m4M?5JixX=gycDwZ&i(@yiwWXAMt~m59G~zW zl`u9B#Z&Rma{1^L-?8xMfvUMNp>Gx#QUfbZ7bk0q<5`@n0rD0&-@95-ywl=a1dwZ> z!}r~>A`Mkmg$!C?o?sQ(8Ew&tQY_x$yAg&US#<4#th@!qC@#JfFbI1U78o~L(qT}{ z`yf2*5+`8NeGy+Vxr7Lx#N{|?pTTXw ze304d!rfD{>EhjcC<*Tt-xW&6UAzszx!ld@9Thg53gkEGSQ*djo)WVcXP%%nivR4L zWxCsX_091c9fJkxavTD@MK#x+un(IX;eXD64QVwRYn<}e7q$y6&gv3$hsUE%Hr{O3*VaGPp+9dAcfQAdeRKL@|4s0hKR^E-AHb()97(8I z@BU70peO12>MH)*e7@GO|Ao&=V|DfUUz&~9+Uol1TBEu07x)jp|0QhvPW^E{GrR;0 z!@mqa#mP_qj3;H~?t1^f^z-ZqSy4^UwQU%yKwNc7ym%C0%uc%FO2irfRqB;)6^TSE zd>3^l37nB{i4p+8BW9VYS8E2H?N_j_Xb9*MP#FScVgmzp=<_&zhpT{7s zGz12@Agg)c27=15b?sT@M!D!bZ`4?f9p6rIy*i(JlTb5R+b}}Rj*{W`zjP@FP=sT zg;mBNZE`zLMkSatgB;dyV#YUj@46r&L0v*xpmz!*)@G>Ol4%yV50AdzJ9rQMBv0XK zjr>AmWqVpqQPy6Br!m=29ifR>xE!9$u;R)}qZYhPvndw(uoX61&1Q4CxzYf#b#}4^ z4Fz^Ql#gWj-#*#@%80dMFn6uqiZaFos9b~CWxq1ONw%va7ZkmQb3 z9zZSlL8YzQb_k&F-f=JV93CF;@C;TsT4h)vVAb%6JB?Lc<(s|t-?XXT_TlckcVVSc zk-@p&-t!gztqW1p&15SlXXkMk^t+jG}fKpbE2he)O)L(8^ ztxmuLcipJ6UOTHPT*#-mjIUn7M8V&cR`u6A7ZP)-S{rha#oXU{&|F{HXxU4)FY{{V zlvk?X@4HL2?_Vq4HQZIQ$iZ_2`v$FZ@Uj7SuuYw18f6obL61Y&Iz$XV9@Lcot#NQ1EO!y>zTA>HhIJEtB(hr-9^}uPIp5>eTIv&8O=LME8Keqt^HUj>|Oc?)h z21fQ+_P99oTYuB4#pPjnzWeUGm&AjegLsG`|4@gKj4+njUkO=~zKZ5jX}3`u+in{i z$Yz~(uQwcKStYxug&D9i5&Vk@?mF;qXHbRB7KSSIa^)dZ7=(}3YLA+j@Hp$>ua(-P z#zWkZ4`5@4oZWbWIf&&8^%2g9Mm_{v})xyjCtUw{02c86b8X_0=Riii!y=Hhy{VKo1UK3NV<1Zf80iZ#pl{#B{O=OiWYb zx$cufb*W#)2l;MZLoYWqQ0`MTe689H|2tf1Zkl#)(e@UoSOrgEqC8)79Cx5AIxiRA z)>Ak#Aty))Oj=l_0#KfN94cmzbbv;*>RtYcaSV`OmMCMwq(QF`VL-_0C99!g-9q5F z)z_Z+`eZV$65lCYWq5V9Y5f{OtzOT5G9gNMCV(WjJK`eYWXpQ_Gd%pcX+7uwH5zWB z-eNSuL;7_%!neI1|LD=HUIV}O>KU>H^t!1YFxw2Zu?T?BMMh2afQt~t{OW9H@7wml z?(WV>`v5Q5_V@m4>vZq%04l)i3c`IIHaNAqIu7VXBYXoOtHFa`5Jg~F8b1^K@LAZ{ zp$Uh_W>3OqYFJZ%Q_`qzVws<@UyaQ`z#PYD5-I7cMh(s*^59mQCOpwi{)|l?9AJ|@ z)ueQedrinolhuSmy~gGPsI`+^CS>tA#gIhk#smj{=O)Ch#LX4D-sEme?^Vz59Nis5 zvZiw~4!`0a)7T~xUN@Z4#-@Hk@gixm;0Yile23?FsLBKZOxjA=YT3%t0DqI!^-v-> zR)*H#5mslYhQ_ThK|z=Y*rZI zO=2=RIfwEz-A(iOgBi z0W-dUL^wMXuc_GAS}sh)`HM0=ko6q$q!<vj_`rjTh25u`E+dP=3J;;LLxbX zJqK;(p(yvJx|zo>HRtw}534?$(+9yk%+nlm2;!V>wRqq*aMP1YU-})gUkmuXY=jyqByPg(>P)%#X{el|-w{6OBKWAUQ)V%%yrpyW)y} z(Vy9jrNS9MyS(I|msSy+ekdlxc?FALsr9hM|LIyPJ%OhNMO6obs-4vg0YXEI0aQIQ z0O^SX@QU8s(l|9*68=lXct^*stW*8LU1EQ_`PjZ^g>kCLpny0 zzMI|gDy&crjZXFM4s`5IAxkhLif!&T|#=aXutEixl_8(3O4=) zi{|gwMjNw_Jy9KU)BV(G@}>iYB5)yDIc z=ZzO@Yt8lMdcCn((vrGFMnsW|ZW(;jwJvzRM`FQND5Yg-m+Z_d}*ypDO?)1siHDwk+3=}&uY_xU7U{UvW!Zf z4pPsO2jPUkh8AGI!-`$girK`eblC>K z!@3Rp3nvzGxO%7q<7aFWcIS%j=a+OJ*L2<9mR1}26?K5$V?CGGSE}J>FVMf*P2+d_ zOxeJTe9F*$>-T75uK!OH{?}^c{C`$kYpp;1fBuNiKavr}JB6hm_0#Zg-EjHIvi=F* z19k&j;9a^>(HBNf=NeClhIAMO<}(hj6rj(vwrS~ z7b0h_;TABByMZ74Es^^uVD|gTIUy%L?ZcPgZ`8mzI*)_DMg4R(8AoI4)Hr+&;9`nL z&4v0PEBvxxPi_gqO7J&IDQ}v%;5)fYC@{b0o?z#pQ|R;vUsEy!$mk)Lp%>U~Oma$v zMkt4zrsJBEex?RAF_~259~fXdUU>f4%VZdhFe<%r@XWL`&)>)!^_OpVk5Bdv4{nt& zMhYbc3yMI4Fg_O2$5QkcQ- zN%)om^p%0ynoZLoS(kAjzh#}42_SPi8w9dXPK{+iC=nW!&@OMhsx$?%c52CF&Fq20 z3SUHH#4_h;fRnnt9af@G5&G3tIX^=-M5k~J7khDoMKmK#<@4Gv@7V-p>dKY(nZc%<7Zy2!2ANsSZiKI2vf zl%^X8G!HoOlNrX%hXp>0Cj*@1qnqgkpg4o5%ihva1EEn`dAgS-_dqVF9lrn;XK~7q zb4l1qo8t3opR(K_BDERF@<_*Rm53xbNp_H}pz^oz^(5~9!aMA?DpsM9@)zyx(65g`GCm~ej5P|!(UejN@|H@hEDg}_kLZfPc)~jmW>|S~DvYGb>|j)o zk>nJ+fddA%I#vrz#H&yZgm?LERpte6N^QI%*SM99b&2kXRs;LVXm(9A^D!Cq(kqVa zI$_t=XfVEr0wnv2GG6HNN7JnN2Z8jPFB7XM+VAZqw`Dj*8C+E*FUt@9^KO?96 zDG(eyeKGCUvsR>-KNGbejEgi-oxSFUznookH>h7AVujRr7#qOz>5=aJCYPSmyR{XZK|L zc<+b|b`ja6bBs6~g?>2eUW7!-(GXe+aOhyliK{~3b|sYx&=G(X=KD1QYeKzRuxCgQ@o6PT50JPiMq zL9JhK6_$z2)w{QWEN%EVoYP(zd zsT!*C`sDqF6I`hhHUiLku?N@`^`cYgMQ%X+6N=r|w39SuMTPB+2ejQ^e3R>F;Ol7U z?WlKo>)~5Iq=O*`-i={b_31#SHAOS3eu5ckG`=t2(kmy?G-eQ(ATf+FggJLL&={n! z#pJ!UP}(zj%Wz8GU~QVl&Kzv;PadJH9ah|&X;Op1-`>$SoZI#EHXy*N;nZyyemYC_ z+0Az6V!Z|{>D~KwnY0XGHY9iUliT13b0Si}NcPg(#*7#02{xeEHw9Ezb(#-6%}dF< zI+5K5TdIu;vR=rTnNC!5;Ii^@2a7a3!G(-qeLfR~$`{o$1s&-GNpiT{L2yFM7IMvo ziR$pdN69pBBQO(aSiqlV%#LLjF{Y;H=k*ZX-SHKric~qSd3S&P)w5YPc}7Xmo^_JZ zGe!JvLzQGkiPFRZDz5USbugB~2)n1u-tcICg%&$E|-drBVC0ePa2 z6ecNx4a=9oPLhoW(T&dVi7R1ZVo0&Bv@)gi6!!8~G|hu;&R;n#kK*Zx1Xm5HGz3O?Gb5)cNhm*2uE6`aJpqQLiFU|a}^@huLMEQA?e zSn#b+40)v&_an?~kYuuXj*fTV?R|&Ac%CViR@&+S!*CHCa<96UOhH~&875&eh4Fx6 zj0%51ey3iq11F|78jlHiAuhxF4eL<+2@1Xthqh>Lj*7tWP?W$Xo%A>p0ZJ|%&L~1$ z$&iDcN0bHEIRvACw@?jErAxvhn~{u` ze73g~uE|51oaKGmT;DaD$Ll!T;qm}OkODTW*1I`QaE~(mNS9%TIHrp0XUz($g|=@= z+wQK0$GENauEsAghus=TT+t+a@&tZdR@F|2ERN6Jo_mDV#9&ai zI4gOn>LTJgF2DIDY>CPvFIgQ0J21qG!?ggWp4?>ET2g=!4X!XFvIa$~&+N0>E*aGg z3Uyz~PPJxU$^aF&Ua5zHIcMCBr%Tj<)>!Xvt$eV70eFj)Bj2>Wd3Um#;SaAtV)`-I zVI$VDy&{rvjE_n9fxHW5siZVmmpJd4I+ihgaxR50S8GCF-$}}sWs*LIQ5U@jU_%9p zE~-4UhH2b+SBa{xqo=?JtInQ54=7>Z0v)Y8XlAQAC|)q&*g-mlb)kg!!t0t{a}`Y} z4TIYIltK>}Sd1=xNk$<QYJ$H`lEE2NU;}(`|46?8TU)DFEm<&a(HyhIpt9Q zBPGph^%t#Ls0e*RvI+gzVRfA5Q24RVpWY|0+kEnR3zB$%EVHcE1!5X(^)Ql-a>g<* z6iZ=d3Nvftgl|iGIUeYvJME=};0n)aRz<+6D2tWlfc;+U`*H62exz7O-DJ9~(i|;g z4E2aLLo`Csuc(41ACgtjO!!C32imS~yGFlN@6cFLkxtqbk4~09QZ!#pzlJy z{qj>t{K`dV&y1H+)agzP6nntwdezZkSK^5&92ro=JudKpC6dr@Gm(Sq>uVYmv+_!~ zCO%4OE>)}WFO;qWF-BtQ3?qm$ZAF9%IeU_@|bb93bdgQu~8K4c|wc)2j zeqx$2h~}u8eXMpcm(}J`IZaKqZd#(H+3*buZ1)O_Sy9xg_h_UWWpHIw*u4QhLp2VHfCMz^lIU)YP+GKlRw~zU_&BA5 z=Sx}E`IHSmC>#FAL2daIBk$H=;{d(Nw49Pn`~k=u(|b$i)nyN_?K8H2Eys>} zFuW!eZy+p3-PP6b)1Y9LQErTp)7qTu?r!a$90upzZlzguf!pP_&Q8BMJPvY^U)}O_ zd9FI7@0tLKM&~o!se%laiixj(Su2MN8?$N}DIwjF(d$s%{no5IUXGmwTp2ki!VCT(ZmZ040R?KsYivMI5pgNKcFebzNcEWhsj=ZxAj=6+n*jxs4`?sp z0i@xYuE8de-mBidl-&SQiP{(It2DFLwBa9?gP4iR&5qttcnoyX6!RF{TyFaLp!~h+pa^zTIkX9lt-pRz&Tj z@Q_JtIOBnQ7ov zM|`3TwJ{}GR>R&gat^E2qVX6H4nRd#Q&I-P4$$3CVI?9exBc{~;UTsVZ3v-wgFRyd z(^%oOR-GFm79j$nv)ZR~19L<%+tvP`|Mg*Thw-)`aY56#Ap z;cI;HL*vK#HTv4u=<5x9Z9y4j6N*a3sAGylu@;nE!=G#LU9n zLs&=wsNdwX)#w+61StAVK0AeekxTn#K;;vN=r@J@FNK4KF8lN2@{n}GFneD*6i|hh zUV05|ViENtXLHiVgzbjdUkg`@8$g;o(Z@6$(Z0q(*or#wAm3&wk>EaDzr-%wz~4gC zhKIcuL`83i*c72UnD>vE&Zw=E?Y%ux+(cd6-L2;uLn+qD1UMhqv@g{cd%A&aih2i1 z-WEtCtVZ_&qaBF4pWrn^v0({cytFo$y7Z$~pb*fO7v|QFKb=V&ec}fqQ~4mwM)5TU zOpkkW>KAVv^s%q@p*n0e&dQ;F0rYDi$$~}Aqt7)sfb~(X>xm7GQ7@V|d6EVl)A%mm zr601hE2HY|OWx-8d5U?DEq0Re6rCVL%pjQs6;e5Ln2KNV$veGD;mjltb-N)Z6wnAz z?QYCX(G3`?Sng~QfHmv+z6*(|AajG=*UDu*S9pPmxe)Oj7K=wkm;w?9sIJ3OJ>p= zG6_;e^(+|fjWAhK6(qn+-cXkNWE3c09c5#yluRlKBBM@aT- zVY9fZj+FN9>|h&hJ%p$eXFG=ZLxv|qX|^EG1(httRmRI8ydnd@+RBkwNT6H5rY7Bt zY;KrJ4WLo96hK4oK%|$cL&u~<)e$}Q*@O6(_OW?&EZOI8q&5|&B7i=k6@%zYbCjE; zSftvhCdUg|$7sbgisjON<+^$+=)_DiS6A0Lut~!}eWl^pQ2B7c8X7)|DwI0pJe?Xz z_VHt4n@mea$WXUS(#mC;^zdRyBBvn~X1SDbPjKq;i(Ws$4k-aSP}cIC7gR1Jq%C8_ z$YxXogKF#k@44pqBG6_-I%y{2ZKB!TobkS4&vS{X^$UrsZ1#)Xu?Qd@J<^L|JnW8d zD)L~O)>u4JC9wZM<^UVo({My~7L;mLMeJ&A1}cPeyM3ABmD>QwOhr?Whm&|5Zid73 zG8R&tIf3#|kI;*)?KLN+q&pksBSFjb$ljh5ROa(~O52WP-(s6*aUYZ{m zYWi{aAqHs!;tt<;@OzWLpWt`PtMw%X+#Wq!#n(UM*J_O;Y?J3D%q9G8ncp~-Rl6xx z_#)j=4xCV>Xolu!MR;}3qm0EJHqOY%3?jW6QT_lIR{$GDS0b1kWw(6rS1_lIE>#V) z8{mJgQH9LJYZ&(uqUPGxR;!ciq_kZD;Q+a#UO=7^qh5~tEGV)%vjlfVo3v$Z%D_EM z&_#EQH%I2sHYJs)&Lx6*;J+SEqVr)ya;d9OBXt4r$t$f;wV42syiwZdqBtymOST#_ zFE*;4N<b>GbD?PYOw6eRM1i?vy?f}ZSqEUZQZ?4x=ImF9z#6W}b z8iDIl$e^@we2H+!FxE4c6Y`t7RkmS810mQ=kv0X$L&9<5qFqJA8ImKL8HKqn3n*%+ zacN`UGCbqaQ%#)~R`c3bPS1o~s?Z{{Y@K6_CSluPr@N z+Jr{8I`D5C8CY8|BW*}wL>5hgOQNKpoUBm>10!>R*^j*WPJ`Bqq!({>K-Y5Lcaq*p z8jf09>U=6%Bj@P1aJMJ96!;l=!O}Bw@fp-;ASR=?d9R%Pa$t3T-v#Smbe*=(?)=F0*-25F0{`8C9u}FIe4*HrR*g!0Xv|AYHLs(278{wBuJNC5@HF{IHv?adC=*IBn38E}W#T4Fa7;RGi?2q~PZwrTo?R@;U>2UcC^}@0+N@ZA;jn_{jM`in zf(*+b*+`)FlzL%nxm}$&u~(fDT*FA_i1nZc3!lD6XX0&2Q(WBhD8(7)lzKnm((%fY z_YeY!^hhtH!^`rfwl%+OALWwHB42XO(+5H~`7$o5!@v+}REW6E9ig_{1otT(VQutb zch01-yyuG+-HAP?A(X!+-Id*?&4uBy`j*9826Yh#KXmIUKXeNiJ^VSIMF=r5YcG;euHY16^#mP;}h(+eE8HRt|OZGE4;Zx(}aN zE>4D&-kRb7=kfP47dbj9sb9gyM7xsxNq>@;hr9-hP$gdzuR=}|6xNEX6}`oNDE#i5 zCmz+m&csA*@4Vw6Ft%J)qe$PsIIG{>Y-B7k4;>6$%sRFk-ReUUn1RCn~ zSICVP(+%TIPzoMe^+iLaBij<%B$8!NNkCV7Ckr|qZk2t0| z*nh>i;Uoh4PycWF8JHnX)Z~WDLA1jkmsoMrnOYUoyOm!N_$L15Je0EYDgh%Qn7wcC z9!9Dt8Y7V|R@^Bw`YC)@Nj29hmyJoN1_XROT|%HhENVb{gdjfbie!0>Rw^CEbP+2P zV#L5LUeD*?H|#@oGjSvtJ6Rwjp@}9}pFq+b)zE4joB>k2;veFDv$@KIj3cjvnGrL_ zvZ>W5`wOP<>q%uI)6NzcOG5ezk(wUA?!YACUzAqEyH6{4$Q9j`Fu+gwc#tt0Yi6)* zinEHNW|wBEG%`}`kzJ>Bd2}LzB5nSpqE{1l@lP}>Cj?~^P0IX;FXtZtQSGPOw=U(Q z+#er2eq7!vE)x@DCKM=~AYh(<}LI?!F3r&c@M%gHU@4@lb z%`D{K?VvGfKYweCtYNdaplo7l@Z(cKcBf%9Dc8-`kA!p(SI|~&>i1XGlm!d$}q ze0;s!T#BHmT_wI=ws*d5&L;;O7YiE~U$~_`9smBlaQe|g+1xu5!~?}q#Ay?XG3%Fd z)c>+K$J+M|(Wfk+vBSl_>!q`TT~9KjggKIV;r`H`Y#W4P5I|Pe@&P^dgF++lCN7RB zcAGH4MPXa)2`K6+VU$fCP{`od1c`8TsT|SZSZ6a8M1hZ_KoTi?H? zrse|0rB*Yx<9WT*^dEE2>-i$HsK52R)FlQ#sery-F0jN;;5Ot)T92DXSR(;57`GFm z&K@yZQPU($Jnto-xio1R>Afkum~595!~!V3tdCjpY0b)`)?Xc!lh}Z$e`oCw$Shf0 z1Y1PsX=D(=(L&f@*bPjLz#_GSiB@7-+Y7)MTkAI%eR^o85QU`12 zxAVwm{{4fgcg;)XO<4Phakd5XB?7@=?AkWdmk$-&rWNerhFOOXS`R&1DPO3|lOWBl)SkX>R9QIAb zo9Ebszx`iJ)vN+JjGdKLCbTrmb_4>wjf7MAn{xZbkAjqLIafdsr3i)>yXeb^-JmCi93rhS=U`e0t;2t{_{Wwgqb(1i-j|B}qoEq|?>>z9ZbCg3&QXYoP ztv)gQgk%+{(px2p?x)L+UBNt>1$_O-%_F){nT-@1%%K}mWEKe_gjA-)%!BdB6hIWb zT@?3c&&N1zB_ZYlPl@gVf|JV73$sdWA3R-NPF~khgy)K(qu&{Zt9~egU(c<)%;rpa z4U3WP^QEcV)vjXZ1dNnW*|jh0^)g-iKXh}aVvB?^DG7J^#-C%k9!?&#Gg>-1EEl

ZI3tc4V)oa*@ zr{yXmy#CP5bH``@p_|VP;;cG)^s{lZuDbcww&N|BytyX*N=H`i?^ggN`Dm+p=-5;` zgaxr^wNYikIXBroo15EeGBr%U(xhI%3493mF=-F5txCFGOZAcO7WZ)CdQF4YjqY;w z6RzukMYzlaSi(M(E&?XkBjl~LrHLJf@5{_F{<4pr#zG-#HL?;E>gahbRj^8tN?_JH zboang!pCsHkSR%}bI5=Yr5s_G!YeOwizOS;Zqf$hDO!jv3F_;{AM!twCZtD24ZWF( zk`z_(xkXvs_ban-&GpAQTh@iOiXQvZg1zJB57M$_-xmHooxLH}k*pU5{$ZLqlg`=& zQ62xqmp6tiVR5ty;2Gn6cAxn~VDyKnmzcYdIN%6nD&956Lz$<^)Z!b2tk9%4b z&UIeSZLaOjmF0}+kSjjLS94SFR-^D9c8f<9w9 zza_mPjQCIrH=vNAK?<1{=0ST&W$>s!CM~r(Ol~^8Q}si@q1zE;eG!DZXk#YD)fH$Y z1}BM5xf?pV^gYP6DWbm$l$vcklyi6fG6Ir-y3Yf&oeqS}4#zsU9;3G+>XTT09BfI8 zTj$LS6gGobL{t2F8&hm|Vdm_Fs)_^SXLg#mKcJC_r%Q^TssyM$^cDiez|g}c8+~kq z1xfzaP=LzZIU6%rCC$GRi*Og|Xgaylbn0aS@xYY8zQ4_&K;rmg2V>A;RrP0A3~*p6 z>()I~8Jdm09nimq=^bmDiX{%W6sASC5Kdz<^*wne>EvmerliMtVhk9^6e0Kb$cFa< z-ixGxuh@|=gv|${2ijJdS;m%S8E8t?&f5}XEOE~;yr!j-IExn@6|zB;FIDK8QEUOFZ9r23)Bb|= zwxn68a_Je=xC;@*Sa_zAqL$fCTq38?&P|{b4|tc;_B^b^iJS7GQ>OfXYsto z3X&F)^yOsE5i{X(Dfv!RpJDlmEdxDrC0RIkn(5pYB10;gZ&~>kMo5d#D4=4V^yRh10ye*iG@tF>sWgc+Dx zAd}yTl-O0FHadYn9$DpLZVgo$EtvGO$i(mNYjr{G(7-LjX|04Io>3QFf6%JSBmVN0F~-#R#kW;keESNbLccD6!0=91=V-?mjI;2`SwWS z8NHV{Zt{!RbW|%;jO?ovbI@}BROQDM&+$_OQ@J&G^|pWsie?mQ_^?yrPgAl)_MC=1tw;bwILRDK+!v# z&>GTQvO9K27SdnM9UNYXie3?QgCiY_gN@;O{m7y<%%<#h^)jEX)8R+1fiZQs4JcY# zsj?x{99xir?yyg*4hxI|TX{Q-Z)|~wmz8Z!DcT)7PiSde&qL45D|r>EDl<%&NeE8E&?7j|dU{2J3WezzU+ z5t9?y1F6IM;LW(PJmS0v(6Lm){x6k0Z}DF$`H#l`rIOL6D;q$j?lK6_Mh%CrIX>Q z7GYX?xjA>OmRc&K($6zdlf+|A7m=UKoV@goq)={=3fnbB@7tk@zsC<_nn4-L;aKqw z?~kcwamVg(3QSUpM9%FO%dYal)S%TNte}{ZzJv*gBc2mtWf|R42_TCoS<4x<{&t+Z zOypa%QA@E<)K$Y~d|K7DR%#iIwdJfw8uQ-Bt<>S2?`el|bSyXY`<0vjuKOs`)g>t= zWmG`}8R60H4q^5ac7C9>LEgeIN=sVSGtWb*o~KF8Rh2KKAzk35^7jKI)IsWGS~_Pv z^wjBJ;8MD0&+!tV)xr!dF?)a17@@KxGh~QhK;RY+9by)mYzCter0(pWo&-VU2Umt* zo#0a?V2mkGPHEXa@P1rOjkRddV5>a15%NJ!PT}}VG6F$On_NMV%xNxp}nqJT!g zw9Yjqz0OEKJgo;JK#7Z{BTf)4FouFQp2SYzJha8!CbiBL*e zafwTyJK2@$%$l)0wI^Xi;clQIjS=FRAiuKd!Z3MLZ&I!|EjRQU70{mZKM5{I%2uJ1 z_*3{UD*~R4B$aqf^cqI3_7Gk-PA(m+Bv}4sc=rfzr!Qo#YrW-IK(|1a%9Cn0AtEwH zJeaYWxWbR-5FrL@XoV4ICdE-aJyW!aUiy4AoPIX^*pI3a>CB+8JsgFrKaGBu>my+tZ);FNS_&LS!VhjE=j6(6upwX0n zI?S{r@Q1g2gT|7>aO~tzYyPxI@z@R^Tfuk{!dOSNnp0M8hP$%C9UmmLl>V*rW%?v?{A*!w(al{npjv<2z zK03kjVW#>Gi8DUdY6?{WZHeKHB?@?aQO>)P>YXuR5Ul|xc24uoop>P~+td5aYG zsnnCxntZVd9=ZfP*JEJ#gt?)-s0$7dKU9A6R-}>Im1lRtp-Kw}xsp1bC471P53$>Id6(Gp({qSt7Se-yl!On)C zHBm-u8GFD-hUqvVA|cQn)0rOW&{3QMbhPsRw`sq0#Q7*r&E$ni-Sv5Pi(8>5EN*zf z{UgXJp-dIUmjHdcG}GbRz+JFk{bnnthxk*2_TGJ_=@Vril#5AZj3i z|B(Ukf(27JEbXdrP8z0S`NALI4$WucG&<3%^)OnT{MkC;qT}sBQkZX1#P{FOBk~Q7 zLTZ`&J)RPg`->C=eGcrnQz3<^`;V|*EYY?1I|4a$LcOU1Ri_A&lu3Wh^~<*vZjJv7 zQ_6W$9O5=eD6mzz`sT9DZ5VqyqyDqz)wNvvS8zSW_4$u}TGZ0o+1t5#Uh56|v-Q2} zKDF-t!)f$uD$Ww>f1oKP5O^Uuo2og2U1^ozC4Gf@D5!pcB$Z%op1+zTFLOr$%2wM1SQCCf=o|%9s{`K_$9r94>boq5H#T33R8L(LfpeYs|wkO)}<0BFo zO3Xh=8tX*&z9-L@RPbcE?8^^s2IPwsMx`|}@)lJR%;cc<4Ax|cs|~o0At7|{qKHth zsO_)+tzZQb4>zR7S(gp}P*HsJhk*YxZx!i_Hl^1b@d_*}s;Vw8y3)@-fc|V6h!wz3 zd2zUN&i-T0+h6Gi?2EB*@^F0lD0Q+8r5a#Ta5^xwV>`sKkD&tx!FP^s?(!#Bw|ahf zmhK)x>|AH#UFBp2-NMBV{tpOZb!dJ<6+;M-Y?*DzGYcR&(vUvH5WTz3{qu~Jn1^*- z9|JGMW?Z41yQh6uF#)lDO+UkYTNu+PN!HTn9g$i)rg02nq{yS8dkh(L2S`AR;5a=lZL?>3{rBmxs*)3 z6|4(tv<$Xbz72cs2IxK?23u*N&u<2fJ*C%u8{D6{2lvhu72P+tWr8_GOcK3eQ2X8< zt^VU|yZ+O&U|#8sNHCXxF70%fmteOs+QT$e!hIrD%dj>QYX4_w3(>SnN7*Bkvh(hO zG-+9mDPyqrjA4|0P-Kk@GR~luYE=kF{U>T(uer%FbhI?=uUDzL7wgI13imS7uCqb5 ztC%S?i|F_5L=G++9A|bK&LYLnB^1ocTQrJ&h5^6cpP1@31f>0Qv=pwm2J8yZIyKMi ze(YztM2gmVwa`se$!TVt{(#H-)tfKOXz@Z@GuuzQd{BEAR)fOhEVR|we&x7S9WWD`tmgL$z6Ep3Mk zN~eUl3`BvyHr% z$J&+%qc@~$|6I31F^>wrT~_LXBiQlljp9zNjn73+5U+7)DC5jYug}y#8{U8@{!oZ? zj%Elo&ba{dQlVr%&SNsQJx^;u5~4%zSJwd1R6? z9;X6~cQi6T7F)PK^W@`G0@zOfq~lAp0g+a(0=)L&f+8Y$qP*r|wH?lBVf#8@kat;X zy7Y`FKeMva3hEj`saQd6*@zRcTlX}h(Xne-V4mmIsII42iLiL4Yl>Z)8W6fi8X}l< zoWSX0@BA3TH`TO~IiCG1Ao?~Jn`8tCDZ}w@Pwx$W8k5m@Etdl{ zZvt|XVnau{uYY1zuAbs1E%2@``VFhA(?mF3q&FHm0k2CG=j0Ac)=q*SglZ!1Q7+!B zNS0<6aT+DL#9y5vz1%mmH6M;B!x#Nfd}l{KuG_mMpHyEnU!SG#?IX>HTee?5+1%)z zy<+k2Us@i>o$yZ|uYxaxpDFu;}m#TogE1`KJ$+d}-lUjem93Lu_+%S0+GN zZ$T8V>`nTTO~eZ4r`~vUXYm?&0?)V~quFHu1)QBXA?=UjUK(Ly-pVTXG2NLlsusOl z245%UBVe~*-AZ2_{2t(&(W?;pcY!cKW1%v6*fZGoZ?D3t>QxP*-c9ZiIV8SC_WQ7q zNgu-Lx|YtDmLV9=EwaAra^sMyY@%+MK<}_(DorTs ze8LluZT9S;Irc0c7Y}vm<|et)QU%X=9z9tTN_TZ|YJ&d@(n=uZY*X}s1gWJY2Icsc zn+ELlP&C;(QKkDH59>N=^;U#(hYHO$4Sn}tnr$ljZUvg|1KRCL)9|CIxa82RM;BDk z8CdUKYx2k}K0!EnGN0gqx~;#LOvUb`VsKh$lB-7azaQj33u85cc!PDj;ZpHv)18Ep z`XUS(n$?VmIO^gwucs|#;N-1*J~41p2Gv#;bqZGEJiXuy2bd;ZM3_Z85iP?ydRz5* z{6O`>Dtv!ZZd=$9+n(w{Yx2nECD8|kcUj>`QvydBDGNDy%@gz@aPt}4SQ@}`zfHpk z6fkfD#3n1%Bb0wPrAm#DHbX zW;%C!gUtr1yS#%b(<^4T9Z06CKg4g1fq#M9=~YJT;jk-a{L~vRo|)6rbJ%5(d%iNjYGS{$#1&H{}?vL)|Cl`AO88=^L=-SK0#=y<+qO9Wa33uJIkO6B1v7CgT zuXNhI(D(LN#u^af&13wyY(k}?Nqs}9s5<15*!83i)Swj8doE0 zCr=;_!3V17j&-)tQu;Q;qPf}U#?5W?%K^j)&-v}ZqMW6;vA4yY4!H6@OiifM2;*F0wg)LjQzK=ofba?r3Ou(;ot=U>9Am`T# zl-jGiqpEzoN>MKz6{l4YMy)}4v6YGr%jV8wI>_6yW0QUJ$;Y)p|BWq!c(-K3IN8%bcK(>*%^ANm?e_~!y$#VIMc6UKe zFlkX!3VAV9!vLJx-6C+7?-<_06cr2h{RPi<40=n#pGhUBG{F z_A~U&RBUTVIf8M;?}*Lu6o@%Ita*=O6~?V^H z(of6%L4cOWCh*7Z7bOkB#u}DSNaL*W6#xfFu+m!DM_$91d!jqsCfa5i5RYM-Bvyyf z3jeG_z}+a+@Xsj3Tb48fAVovoVaa;fn7%H)3@&oS+HU-dB9;&b%an~`lTT-K!QTo( zX;OxXc$6QDJ%>8fv%AE63zI*=gOY?ipo@4({)RDxQ#OxyWJnUrMXeKA;5ZUSbtN1u zB|Lp9#w@bym~8vLb8Yqjucj6$;z7c-wq&6?7pZAp2oy^J6T;dKf>_BRx6G5T!G(Xf zzRAZ9EmrM|{~JFvHqd5R1|($Sp~3YVX$#tnFD&yiY35sz@WcIB(Yj`WR5B0SLz5Ga z*=o!v{n!mjj~KJq0hRXHQyKWxCJYihk3aFdg@M=weB8)!aqK*$j0*i{J0irjws!*8 za(PGLGNm)^w)2N|Czn0PN^b(Ns>=#mJltiO@or$lEN|R^v#c zd===?T)z0?or+*=)GI|e<9c;j)M8cpWyher>AV}Om^rAxLM|1ft%)@7%7+WGQL_}~ z%|aF<-FO}u(`zJVUWTOSim1wB@Dhd@!bZ-V9j2A~4+-i~%dFf0$6)s1#)0zodHx?= z#S5rBsb;e0gs&r%0*Qy0Y20E+12*37mpyg6)G+zs*qLx5R^l4lv~_g(X|WbNiAJV0 z@g^VaXbBYd=CA9Ze~|~G@tSTo8=Fgc%}W)PQ4XqWNTukF0$A_Uk|+oKDMvgxSearP zD8EF+Nvj>iqT2k|IoQ}Aui_7m*;DN>X|fl-clvKSwWHn)=!1)=)ewrZ*=upR&pxpt z-U%=zRB@>5I>>5DR3%=YpUU6HyX$k0j$+&g>qXFuGh5Ksr%2_fuVDq* z8OfEY^Hn9@3WEpDCVaebo7zlbn*=g^ene@v2qy6dBD!bt<>Fh)y*(9FeQhC!;=26% z%K)+|1p9uDKCtfrVd|B86_k+r0O#|!HKv1U`b|=O6vms$ihQE>_lbov?U34m=sOAV z2wgoLJi>9pV3qi!d@)O=jA0$9{p;e^#4XTsvc3Ea1g@8}ed@0(N@pAA{F%MbBol}4 zxcI39?_RK<_RL)DKAx~!bzxh++eQZ+R zQgW{)x9;;PW?mBLp%-1tQRWTADMorgx0~LNV#vUG#kGrJlQOAxI-_GBvEG2^Jn<(8 zeMg#5rckZooMJWm{E@_auv5vd4V&y}ZNjCzFEhjlg4O2&vo_S}yqMiI(3$KtXxr!a zv9a|eC69=fN)2oHhqb+oZ&5A1AOv@N%@lO5-7UCB(XcLxZqOMEGdWr6w7$f}0A==bjW$)cG;=tO#u05||auoO3WLG9dh=LZXgR_FO@ zh(Q)cdbFGT57ZNakgTsNv3^8SWQ^6yA)w}x1*GQ)0^`cprn0ie za2|05CZ9O%QOHekPI~gvL}h@xTa(NDEyZIXADF3W=s-;?O~R^Pjv|{}wtA_2A7-Xf zExWd;#Xlc$yf}e3c_g4!-Jp>ur!4yC&aFjnwF&1QM#QjE>CqK7-iW?h*KYv5tW9+* zaO<=)av3^p4tOWg+o3H<-^1K`=<}-V9*b$G?IsR5(@ByOl*0M)P4Mx#<)X$*SP?r`pFzjVj+;&Gu@7X|?lHuXud3{gyp=pnr9Q5u zJpVvjE|Z}pGN(3kP4Ckbjd0oZ6DraavQg^IaLnvr;9<4vjC{1g)wEHQc6OxC&v6gi z+uyx!QJy83)`@{Qaq^Zy@3gM4rOoirCJ3A<(?xSBLbr5)Fm%oZ)*VZ5^g@uf^9pAC zh-b80obpgtnf8Za@QL(PFmaWdNpCxB^*eMV@=+)PXL(QHl6$i=KY`KhA_wnRoG_T- zv)QfqL&LgUhiRR1|8}xu<@vxUKRkO*-pjID{i;9%XIdTa79fc!&{%6Ye*aY|UF@v1 zmmyAHf@`FNGt1~7x@vN^*Q1qOg-+KXD1>`kDUrSVEyxfFZb&K5@qv>TOw|sShwL7U zV<_!CD$zIUdec@SEnF6Odge;tCGyBB3;1I!K`&3V$XxNnh$9njCig%f)(ly$H5~&d ziRr?*4#l*E+Ot#W@95ND^}Y#H@D!sfOzKeHy-Uz5`+g=AGqpZ*v)KrEPriDW9b(sU zqYvo(vV?itJtbPd2(GSB{d{4X>&IK8|&2k;2ssBEtxu?dpzd+_uzm9hcUYqP(HU3EZ_b1ucbw?6tkFfg+&$fep5AdXBXd{?f9E(`O zT7@j?Sjymmw=V zG@!O9YqP%KeV3Bmb&|{b8GdeO$u+vsOWj8sBxLh_IT>qmr0Umtf#ln}!tAN5hWAN9 zQ3g=`talYbip+kOxqO`!6c79gu4dlYzg@0=QrVWC?d|?TB;rSn+4!%#Qfwm?bJEVD zLbHJWz`=VG3G(qLvMR0mE|C(|DK3YZxk`>qgHEon+VW`{_4)I)Bs1z))Xh~Soek0S z3TfJ_mA%mtUiN&cwAJB@u=Cmm2*uu03?S$IV`Qk?!W;r0=W&X%J&0sO;JgfLb7J;F zZE&6n&y<#wt!vJfEO9A4$KkPxF*&Ya^6h~{o&9l%{qdMuscF!Tr^Z?XOaBOD-Qi?V zDm)affBAPtwRa?xJeX)XSsxuuT&+?&n=4zx>CM3@c+U3^RhgSR?!U*SI|g`C6MHpOyMmW%@Drlxh^5i(^GU3r-(bQZ#fLKOh8R^RdZdwxAI;y9eXCS83y@o%ru)K*V!XP;fdKifJU+ROz$TC& zRPd~2w40GcMwSTYC8mzSjin*h!mNrp(}u~TIAkic47#MHfn1Ay^1L21ueFNc#eH>Y zflk&x{aU7}G)Do#L|B6LRYdCzsX=vekgTQqQ{7a+L zp({D~Ecjc8fHn>aJL&$4J&lUo#{veu$xa z$mZ;>K6g9Ff{gXh2aTqxfS+t}67+t2HP{e;FJCk7j>`3^+Fbh{p?*6C1^F|rhB2vC z%7T>V?w?;pEA~PsNGgN59o^1#GCn73a8mh|R zO@|SpHk@>wl{E7hb>*LR*pFWRQiX$#182`v(v{z3Qv`^Vo!F)F5$a!1aOsOmng+k8!1SjDZoIPz3W~^3 ztL7=GQ-vL$UM}B~Y3A(f^1hh#EmT83ynN2W=sHJI_Hz7|d4NUxMy0Eh(4o^7C4Uzq zAe*zy(p6AJuUX5~*b`erqIyi95W6(XAL(bMZ7$~4b?j3)LbCnvv@|#tAI`e$=DSMZ z%#qo3{3cxL?tv4u#;;abN5bn{J=xh|Mj7PU2#1_wpz5Z&F4U3j@(PTt1V z0H8lQR68R7f-D>Q`eO#P$~bUd!bNkXx}xwLHz21gjq&ntb0WP?vyPgfUQEb@ht70{ zR9>Kb> z`LX!gjcuXbfBiiPOJZ!2IvbuVyYKj8YAo%j4s+>5@&Q-OJa{T;lvuOWPg=qBA~kZ+ zN0p$VOtrJG?X)p9Q3*#Xj^Yxc6FU>p0luSqY~R^nrI%=;p(mXiEm24rl15<-`6p#5 zop&be>SD@LX&OfHg|2VC+&$iJJ$6cHK(BM{8VEA>(Dzf zD9%-ntc`$k8ei_W??Kz0%g*MWAb6z*0)=$+{BWHLN8imiHF;7-KNpX*GS*#ARdAp` zKi}PugR4BnE^;M3@(+l9Nt$c${738sEBh3ORgi%T9+3u{YrG}_m_9J_|E3>L5j3D%Vof}Z5kDNoJ_S^URyI9Kimn1s`2cM&f)eYcPl2In z(6U3XG(X1SFyueIq04g3S--ThrS5T%xfnkdxW-_z&6%R61~83@s|gFe6cs|=Ww$;T zS-x;ERiW?O2d;qjA*Gpm6P!0TLT|mga~EnSzr_A*Wm@=amzJmm4a5;Ptq@1a_o*Be zO{r2i*`QF)N{%=5c+}rO_b9{Lj)Hm+&s%3nXoY13%TJd-CpV%$RK9U`ZR0o;4{Zjk zcdzj1$eC9^(+L{$ovtK77-w`5%l7at0CweW@p`JDUGfhr$b%~EvQ`Y$=7!f@ zmetC5i8WmQpuSp*TnTc7Ez+}xbq8yP=S9eV_|WYnoh4Nh24!@X-Hk(d1X%zpOfk7y znVb7Y`m?XP?w3N9_F2I-l4x%^xc0rRvq^@d~AoQuM26!$SFjVTg z@o{!xdEKdeFl$1xUr$@$>LOr+*;~u@Z6T&LC;B&^emN$%;=4|DFg!jXJHfQNA%!e) zO6s+q`%`ijuzQY+4?I;Y-f*`4vlQ2XUbeZ~Smok44%xlV%Ij6(KPR|YJp*Se36Fgv z!!%}ojGe-&3*!!}t)@p3p5yBbv3XFk!Km$-tqk-9AAozk=X|&L;?%)VvRh`W8d;Da z41eJCdlEO`<>{kPJ6O%Omv7tIQ;-2?Wn=F|OWx@FJb2kb|1F}b!*N({p8S(h1E}87 zPGb0>dW&)_Zbh(a$GJ3S0^~s^%WWX|qjVw~(Ui;KKGey`{bvgd)k9H>WRg&j&aX~- zAI_}(e3_Se_ZWJ|(Usc$BoLDZs)QAN>KRzC3pgK|Tn8eK)9EC^oWKBnd-3U;g$iHY znMVTroKqJE2-Ls!$V$-0fMAiRRQUdnBT!VluHc{v6xUg6A$8hVvZI3gAt#gY44_N0CX2n#tGjJQVg|pU9%2!ZfNVs*w3f|uRows=22>^gJRrH|0;mfa$h@^ zULo*g8LR}}u?c*oPh{ByML|1et-6X-os`CXvKzKuId-`r;9b*OcyGdCzGR79sJ4Kd zXR86p8Ksfx>Gtr>_v-vr<#G1Aqpiqdz;gfa3JyPSh?QObUUxi8e?}PTK)lB$(XYr# zaEteTOv+2TDL_uy>Tzkob&A>NCdZOa<#xpspj654|^@n z*1zhH*wA}VEB?wXlwB%6uIf+Qez8-linbCA&(Hmp`Gp?J z7w9I8w!);CGhzW;N;VjvHw(*t!Ge`}X+Q`^0?hlAC_i)+>h%`&w07bI?0|Y6<(H`&z}Srk3ez z&i2=`^0Lx0`eZ_PuXp+M(ialDSI%{77G`Xj1m+*pCki>=7jsTha_8mOzXkYs5N=17 zV4Z4xev!RFc_V?#)R+gS5Ttho2a96Enj%5MHTup#x}Hm0x83J6?bQ#ueAjpYu7w~& zg0kT@z++6N#(f92Ad&q2hda4u6-{fAA8yC_3WWldt8YwvNXH%cd#`}fu*Rma;J5B29F zHDEfgs@JUkilG~&uF^FixZ%5?=Ply5m5e8qb zoM7d`_`6!v04{Sh%B&1giPu)`x!v;<1aWhwSgt8tg+rbe0JaB^&uJyNRu5^uVtq*IDa<$Xe%!%;j$>-gYRBh0Q*38M8<;m0B zMXBau4wJTHptGzFwez4^N_zCUOPP$z;#y~I{C~rUlTx~YVPD}h*t_+N;pgJ#wXeIw zk2>FuJClfN*2!I8rH`uKUZ!`(a_Vxs>%PnNP;PSn?rGuy@wN17iTZ5&0P3B$bD74P zEt%Bh02ewQ4o=RM^6MPs&K}IOM>UNiQcZEK zowsE@`FWA791j2TfBeOI3cTUo$&k0)?k9_Wt6)h-0Gubvi9eSuRu0_s=)z0D=i>e= z8!weca|LsZF;xf@)}V0ADOpB&rTqaUG3J_O_0+#O3xl^#ts?d-fmd>EJeccEZhM^D zbaqh;A3BoX89jHmHIma#WB6W#HL259u@g6gg*qQy^wfgh39g!jWG}5_4rTs=HOSe9bw|Dh%W^35* zY;jfY4G|(Y#WhPhGN%U`gofJ(8X*y}KN2^bYt-t)q|9ARM($K4*rtA9#x=6(sQL_B znJd#F`q==s+o(sD?Ns#{UTQV$l%?emd$lX$+aLBI46x*NzFpwqLs8Unbux1ys7psTL+ z4|tMk1nZfnljpa6o#Hqh*q`S4(@H-aR3F4PTkiF~)f3>|onHK_l|OpBrM<|ojy+KK zjbwwra_K?6W{hZ{I&n;Zwi%G47vk5%il+RG6sRguGY7x;_;BoTYb!d#CGM5EE1_G7 zlMRIKRq&uN?R%CBl=C~@1CrTco0}y6sTRawt|2!TT)LO9^E*H0$fzqdoV4uePpqXB zoVM&G#y6%#Ghuz9`yd6Jld$Gktr=}}dzz~pAPyr1xUf%%w#3&i^E19C+_ZGiN6;rL zj75Y#j904mR141L!K$I)Zz4`e}$7>x*NiUpq|LYO<$w1WR*BnqNDd~uzsQb zdrL=c??36j{CZ@*RA^r5uJ}T6t!-~l=DrMmH@k&j7#l(uZNwAudrq`j6NA6FBf@$H zL;2`8>=F_=!`VJ#q+hwK=9O1u`@LDW_M3dLru~-l+3L%4S?wR27Z@d$;+FLZfjb*# z3ZB&c?9J=JuL(~dUGeAz-f^6$TXsmy*`8i)G4CUgxL>~u9=gw%3C(_O)1Lvu6Y0PR z-bZxt2^pP+M;h#s^3{!5eY_C8tS>#+4)5KITrn$L!+XfMUo$iMtp=t5-&*5B4=MJU z-hzXUgm(ebp9%dQQ&8?Oi46SXsrDNG1Oxv|TCI15(p(k7EL?>u@?|#Dp7hL37V_nZ z7Jb+;J)XlCEAgA1%J=<~Ev%g`QoC>H%M z73);L%41*q>gqHcE5x;$`Aj%N0`k^Ejv=o-U|;(Nrj1#EqPCooji}bUq}+QEDA(Si z*ORc;ke*H$_jw}{ikO8xA2@rhbE)u#peF@b#|V*mWhXMH)qC?dn|$bTTDSaho0B*U zb~8Xn{b-#R#|sq11s;D=9B# z8xC6OR28m6p9>UqgoI(C+o|j4iB_^WGNYcelO^eQdO;&?_5-pR&2F6gm&BdE}JxdcMAu zb(2^4FSpa;8njiT@SA=u3a92y}EZWlv zo~8=GqCLehrd$V^qSb}AJk}AKws@s$HM~YY@){!g`**EJ#r2y0dWyVd@i~Ty%8KNz zRf#5i7Ok)NnkNH3>#I>9761(*=}^OKP(r30UQ@uL;^~}OECAJ9^iUlncAdq}?!iFU zY53c*Zd!`9hsx^&TlAu{Rl8_@qi$mx^Q~gbOdJZ`nNG}DeB+-tmdu&)#n|o4nQWoj1>Yqz%AwyPWKK8B=| zT}5Mt=3{Jlqj?M#wM|jK{FbyuSsnO+30sZ7i@ln$>?%0J~vBU!l)ET zPzPg4Gc_xxL1ow})vtWjJ$BsctG!@jAhOA9=vy?IsSULP&r6B6EetAvhtGLFp5Fs#-gx$05dP%b?ar!oIZpVA^Py4D0SG7o_irdEg#4tF(ptx zOQ*bUBpQN-S=uFm^V|!k*d>Bf?9e#se#$as-Ht8&;^Qk%+zHER)qz7sre_5}Fv%!VheP0YoNwd8#gQS!i@t19wO!uc>BF`>%=2?KA zdxd;$HCT4m0RXjHC4M%G_e5=x*5~#_&hP%cj!9on6eFWSV#Upgl?#(Jzg7wCyPwZ3#tY>fT9o(Q7#z7S(4HpYHVPi7s( z&24-cVVWr~?0(7Z`Qm^SU5UOFkmlyTcx;-R`{KbFZtjaaWw^O7>(y*D?tZ#Z>$m=8 z{bFG1B+q-0d={{t67#+cAqdz&57Vosy(cg|%zKfx5@33m_o7Y(VAq<}xED(ud_5ac z{`vcpmK+pEZk*TE#~z|F?&>)$w1?<59i)`?N7X{_Fbl*81~e{MYAy#((`I zKF^*6;gc}@ZeyJzjY|yjloLjtZg1mjDzcr9Zzjq4#WbvRt6>Y)a2furhVP=zBGua`;eMQD@b0~&A3mCO21yrd??aD9876WK$M`V2 zh1BK!#IKW)cR#S$uNFZOSL8dYna-;5>0Ucm?#YERVf8B zXJnRo^^#dIgVp(eFVb<$320%cD(~|wi~F-d4M9NR@Z;X;H-~4Z;nuC|F^dg0~@ny`QlHque0Av`~BpOX`pzjFb!|w6+H&A8k?cV<0>GwE-cYCJ?yC)~% zyTjvfD?HjdKHb|s+uu44kIs&d4o`OLVR#b9YMN<6eKW168F6KZ_Hw;=8YP2FjsJUC z=Iny9lU`sRiAmgzlgk+MTz3JT?zfbb02c=hbqAo1$$qWIktiVC^HqEA3^21gbHd@VQbGfaT>aV z2&N^g1181lhth)MaVqIm`;&CY3!pM_V-{chJ%%YyFvm;=^KpLJs#JNOUtJ{Ki?El* z8G-@0v*DPN{HB=qxLUUdaJ=2#J2<6&V{nH?Q)epx9Ka-d=XUUTx8l3~!>v8N+-R2e`xNFSi$oCO@@aSGdg6b%78IH7e86=OhFiT}?DEMTawf#b5C zY=39}+OdD36G?!XxFjhe3T&AQMLKrcKq$GG}EI$R|Ocs)GCqw@+$jVVl| z1y6+psL*t96Jp3Ms0f_}uB-crh|IHRsvp#Wlhfm~?NjatFyZZ^(__YQZb>o(!*DQ# zqeEt)Wcy_AzjlST(p2}-8Iom6%80q?qCs*#LNhEsi2a?zv$y-Z3?^*03NN|o$l`@M~&?VYXDtu_<{5{0nftM&3f zKOD7B_76|hOZD3-vVC~;Js*Eu1bx&=k4^RRreph#mdq$aHcr0l}&y+JL;5uM8qWoZT z(VW9iD?29w4&S^9H>`}DJU{WMJ&0FY?lhU&@Qv!ZKb!0B@78K{Q<8j2F1;wsZibz7 zK=ff8O@S@KB$Mcko*^5ROwAHO$u@>XranwL6K7Z{qVhkKaB6sd4O z>P}5SVGJW2^}?@g%0r!ir_>|6>8IhU5OHk19v<^)iNJ6$AW|q1gL-GOv{I_msK>a( z>zEaH9{o%;hB=#X^^e+wPwqq(TrbSUE?HK&i^a_uhAQP17IpRj<=_I5k=N29|1i8I zlgoYyR}3aU&gZ+uy@?YpyK@4v6ejC}WvjUaz)FP<@XU;yQ=6WN5D>kZK62E4R^*_o zaaHF}i%@$o85+#1hfC=g(^f6vP(efmIY*ELo52*}D+pBrSgSk)`5_Wi8X-gD!Ih7e zOThxjmshXC6@xYBbxtonquTLR?s6_AOSOIz8W(@aMk+iqws)QW&*TsS*80dZ(| zr|NBG-D%~Y_h1K!e|5jk6Wm35|J?1px0zzKjSf{()!a%BZRc}og4Ci$ z`<+O9KS$&J+qrPu=w4HjPeveUKKzgC>snYyv1}bJ{>F1Nd0BR<=uyko7{pO{eSKYd z1cyqsq+va71@Imn*#2--Xr2xU9(OHlSVM1kIzY#5p9_KPcYPf`>Uat{{ZRF~4W8S1 z9i%WwzlPS&y?lp}*j@r+HaF*tV``0~SvHQfSV+ZBLpZ|wo?O}_GZY8oHWmJN*qk$M z&M3bEqU}Y17o`&h|6PVpP{dPBT;^La$1!OOQ3YpZ^2R`pW$RSt)V{f6**TRF zxjXt?R);VxfalEBM=m{?@Dtym+d&8pS>IHuPSO@&qG1Ug)NN4``l)ikH?pbHhj3w9=^N*;;*&p_hBU$>(#Z zoNk=YfC65vuUp9GRN#~8*U&sTJlrn=*x0ZDUxC50=Rp43*_d_@>?~W-gP(@&$9MS_ zS2tE{F$F7>omot2pa#$|Dn^mWdp$gt;9zoldY0jfSf`38^jV?Q%*P&0$F@W>*`&wz`l!*Y$`>2CzuUMRCcJ(DM*z zBFm&{22F_JR8Xz6dQr*RN84K3_AZHZMpQ!aa6G*Uu})5ZY!`>J?Rd~{a|fX#)2L&* zSM0E_m*t(ML)*h6G48~8O7WVinIKtXIb3CI!u5ZK2VkPT2Mc3Hor${XAjJe-ZBW%b zT{^$4@HLjzC&c=GKiAxoNrB#}5Decp>qknLmSpM%hq3|JP=_+YKH=z5pJH7>B@Bsgo9b){p#b8& z(Ku7J5P($?)v!}f>vf}sCDl4Yr)@gww4=$nqrT%yBD#vHA^F1hZMiwBg}S%P@+&F!^Y|LbcS@U4e__ zE!IWyj0J@+o^?F**=kCw?DVCf8+ggtPw^DdySS;;uGx5D&Ma)NgxQVr%r|~6frWQx zdtzw0OINt~RWz;?9ugawduq_=>1&!AFV_$IoY*@DZwk^RlN4t0XsD!iOGmNCFu<<2 z2u3p00>KrWS#<|xB;z}v3eQ&tcB2TktZ1|46Fu&SaoA%9hwzHMLiBjvMQ-!%ZeiKA zZtn#k6M@vn2r{WZWWNr63>y{fM73}{LruDe%0F!6(d=&ADQZ#^GHIfF-HO)J!k)g0 zZZf`Nq1p0mMwU3xh^(6sYa%&U>|$jHo0{Fb@L_-d@ZfzOt?}bW2tCobXN56p@igN} zRNUa+X|dqv@c6bs9o8B~?cr}?-lFJl)YoO3@y8%DbUar?vw#oeUJZDslxzeYqaCcJ z&LtEf&CE{X{-$|N=j>};RO^Hh7jY50e4lCfL=pmY%{Q;v^5Wgr$tegO`_1t2V+-)B z-0KzRs2f?l2b_mEJ~JKpH>#5acRAncQ(KSWp0tG~@<*;3m026;cB8n#JCiv2R6IG> zkTrC9sN_e%fplC%fueYhCKP;zJtItVwomajGh|rO=If9Z)O;QDa~h#)C5VXih`nqBw~j%* z_y>Zr_&?41N%PpUXnA<|>Hfg9`*xqb@esD5Wxz}s4)V9#dY`$u3Ix&vr(x4AYwq}! z%xVwGUmgjpd2uXg>^o_^!|%H+K3_|tV6OQ<7A{D_k4CDq`fyU#U|Mc)=;h^9EeJ28 zn)r&mU63PJyIjo>(@^I~WPrH72A?zrJasm@HIGl9+7qlz?QAJX+7J_x3gaLR2`xaX zxbY9p_8kp6ZL8PemEx3{~$QzLAu6%{naD_)!ARu|Y1 zw&k3mMtBxS7>1e=oi^lO{T$8fvQse!na012bXv7QnKZ&I1ul7#rb9Z`$-*z}Uc}u` znEQY%M670eDcb;MZ7NbN=qx)M`Z8(2utdG(+ZBZ>G$4@eZ5w81IJN;IB87CuH9}JM zi9E@-B}a5TPVk6!k7a&X!6!L01>7{fHqmuOA+`?>-tE07v(vZR-|TMxy=3C)S}6a-0n%_fpqGPj1XVBtrHaX|yB@cFtn%o4S`cszSnVxMW@D^R!Joj+ zR34*>zAgCJ=F_1trs7_AKZW%yz;IX7()`ac|Dx^|=uA%g>nN%Vdx#Z65%7N3*VoQO z(yajWHecWR4mO4x%`D^L6b?V_gfE zZAAgEuLtdm_`|!5u?U^-ByEds0HvPRnk|Yl69(rs-H+CA*P>&aRq21jGWFsCa8Up9 zm13!KE#i?)Vs#ZgZ;BmOhVI8+Xj_QOqVTTIF_d)kH)|`ZVSQa%yivn)EmO`RG3QPj z&Ly4GxMgvzxmi{~GwKn;2FDk<#5`t1<2RSlBtb%}d0m!Ik^NjoMoZYw<<-ql>rV{UVO@?pXOtn!Szdn>!e6$DfSV2O_gAk z<^xP)6?ENWt7(MNN5KK+Ijt_bU+MB{dDVl}j3_oPx;PWBZM;}pLw;AO$k0ZoW~trr zcb?dwqE_l4-cUI`0ZyltVK2-SE?H60fXds31N=opKu5iw(Dexru22i@$<2^%E%dSI zX~B?~E{e%+eGqkG;_H#cI9GSX+JasztI<>)NBe>dZ|1@4C)X$&$<>0ut-7P$Emb$>PV((28YxcdPI~q)*Tu1Ata48vGE|I&$ z=rW#6<;@9Q6~&_|yFZW9@i^}3Ih5lYlZ5$u)}zN~?!|3114!=$%mS)L+iI z{UJ5Tn&%8=FYfYn z%Me&1jGTZ9nZiXSO(-JKO0HY#MHd}ADmdrpmQ#fvd7A)QhDu%qS9-%pt>v8)=mndu z729*2Pzd<^{f7Y@cmZmmcOfP+=RYhrf2`-UeSQ71QFxbDoSwnH%n!t|!tE;yK@Z8Z z_auIBt)^66Yx}IP~p;GhiN>8jxb1}XQ+siOLkD7?nQC}JHC&Sr*XnnyPuV5Klifgo7-|R0k zy}(fPr-iD=`Kms&^H$v|RDEtv5~`7ZU!Y0urv2Z0*g%gP*Ui3%fQffPb}@LCT}+;3 z(L}6;JeFcOEyY7&0cS&K;3_uf776J%|HyxH_>*}=eRuo2dk}T97F{Wh>QQ&F;GoJW zcY%;T%M;SGoxN{!kB;0&OOFb5J{;~89-Zx5dj^Fzv@c~o4NiO&&IISr)srYDVH9J0 zuXsw4ln~n{5t*hSo4_$y6f9e~kDbaVNy{__{2GwlvA*mtr}I~(41O6CDD+A{?Oz?0J1_gWK{EQyO= zZ*rcl)&}jx{b)8Qkof2GPFs&chh$;ADxj+%OHf)u(Qn$sVNY92b`S=#6-Ri}t5oeW z)}@@!B8)@Ffg>pXn~w63Ylm)hIhc*v&QJ*%oRiZgDmHVXTHhn8MaFF!kBBj*GnkmW zT_6Lbno_3`Mfb=%)N5_DJ^`5k+~3Wka7;PIyZ&OgxuzS7w_MVU8a$Cu^3<5(bpjIC zQ7jJX5{WRkCV3->;)G~N@yCyK>rTIYzDl1zEwZMLMF2iCT5t*l2&e;vvXp}=0?HA7L|fl6 zeMEYw;<|Kh!gog@W=oAGNrpZkmW_keb0K)|cU=PbK4&&=hX0j(HNDYFQB!^Q|G3}| zcFVvu+#^(86rJ+AFSJYHb@zgN3Y!I=!uUl`Zs#~rZ1KjT(G$slbDf5d+#@7E3f~dF zx)!f)$n_?!+JE39IE|tUZ-|RVe_NIA4#!lwQ7C=uo5TaJcmBPb*QN2i_BT(ZQH9IR z7WjwxxZ)2~&{*rP_Sd;(yg9(88zmi8P4E7nJ6IQXOhfp4VDBEfH@Xh{GZ{FDd5!B4+i+(x%Saf;>ztMLj* zy}X*b)FG<3kyn>!!`FyBF)a_|elY?Q&4A-M!xD;O-Q^yKIQRaTdEH__&4px4)T@WJ`_%p?h}kJ@0JJX|W~EXf%>$Mq_Cd z4V;K?+)F-3>n0S)OBsVK<)Qki15k8kD+wwoBS4ciUggris%nBHv?9{4G8@b}&VrGQ zv242T?VRDW@GMm$v!s3=Jqdi3eL%{ivuzD4Hk}-ILCB( zbA|=U*SYvRz~=POEbxi>K&T!dK#N%UPzR(Mv1uy2$k){DxifwLK}^-!{=_E#bQ5ap zaU>6H!lD+er&_R{j_-i~CkB|Dm93Pt82fxfN)!tU)yE*DMKbB6b6OJyRzLo}nHb_3-kk&+_yMMexMQFwk`jPro@Nb}*W#FNy{PEz-#^MsX@i~C|E zmq_l&x>h$_KDOO0vaA8{U@-P)0}Q4Zce^{`oOie5pm-N)5zQ3RE|A9QGl!ca3e7I7cs8vr>s+@n5 z4xkV%(wF#Cy`kjYGJ{Ksh-3bC1Px(%9N8ywLlVnM-lsUsgJfNY?ow6Q?dAjxidYQasJj`$G6GR80Ip+`5 z<&&g!;?w0OlOTB<^WZRQS1F`PB-oPkVGzO!%jNeTu&j$^H0r z@MrPKaAXsnMiawOJ6>IE+rZ*YE+G+D5fK4TkwbuHO1FFVZ% zQy&453v$_tuf$^{O2FNoZ(lp(A3sC;Z_vOQ}MH3Tm^AeU8+6?PLop z%kw`w?zq_)9N8`!Mlz%}#TcI(hR`nRQt7#t1xB`X4N1Bf!Ob1p z!gjXeHziIEPmJkhYtXE;ZNmqR77<5UQ(Rz}5qBL!TjVV-FhL?ZRApJJ+<*4?#>=@_ zSg62wAW}`v%J?7|PUd;=j5u%tUPi7W4ZAdK>n@709c$^L1ATlmleTzCkI2zRn zMvXq` zTE* zvngwXv?4g-6*-C-If@oaXKck{am>dqp4hdL(My5X2o+%<$;=NK*Ahq|2&fv+$;UR{ zwt>`xv9x=@PXI%uG7*>F1*LqEYyc$ygg8r?aj_h&!G6!Ln*0BLE90N{!}}j;zR-b< zKjs3+hwp!^ZEVyxQ};ivH=51A?tlCTmBQAN|`6wgD)cDO|kvTk-sb?*5nHU};1k(cdfn$N@X=7vaOk6dFW3oPH z!Z=`9&L&I`%Ga*7oOcp=D-|6Gi@$19{mz-H=H+!5NC7v_NX5t#N?3p6C+eqYD?d+z zX+<;i+?FtA&e(BLr_sktg{Erxd(4M4Ci(2Mg zs%=<*l(l4qLlx_yDfkGv6Mk(9J4a@v*V-hd1DX zVf1?%AnlkqKHL@?&d$}QZ9b)G`1*wADTMx9bC>O(*UL3Ro-$l+BGZAn^suL+WVFXY zK4Ng@ zqqImFpH0l~k(fGH>NSlNy;?P;u23?uCl~@0QpqH)OPd(dE&rCMBZ!_g@viL5JV9e^ zA-n4J2Z+q1sJ=96U1yPZAi0%{#~u+=G^Up(C1hp4K3-*WzBRr{*JWjPzFMe}6jGb~ z(tH_*QGtY_PD&UBu05p;A_@s9tWo5a0TOh2R^${hc{M4KS;~5BB#+JHaXoq5NFFzn z$Jfc@o80eg@?ncf08bNa1Z5*^>+iMV#3;P854| z@8g(pGKQQ+TIgqT4Nh!f zZKjL~9%rkSWEWDpQVwvuFj`)(%^S~Ht@8Rc3uTV17JloM*G;?>8g$^l+nRs+57&Q| zHyu0Yv%vm?>cEx4>y3>C>%T^AeLcPYYrfvx{A>O9XZ%*5Rfo>B8eZg9bF1W}jYk6u zt-$dkx~{WPt2NoKISd@jW*=b=n!$)5(A%ASq!?qo0KA4ehY=oe{yk&me=;L~ymz?W zJ2F@+4jIpQQoU{DfAGh9BWJs5xSfXqcM?ePNjA={Mibx2jh$Q$lDbJX_4_I`vy9Cw z=YJe^_O}oA?#uan@=~!3ggJN;j7Km#Pk|wb{*!9y6U^r)!CV-ye3#BtCB|fKICI?5 zzzV!DY#UQ(fFHop{ibaIJ8x_&c^i^<7N1;aD4w8J@g%$j;%#EevV?e$V6m*Wac%)` zFT5}s#BU}PHUk8_wA%*$Z{$F`JAT`sKLF^@+TUk5tXO&SJx8u&BM+$tC=2Lx{PK3^ ztmA(h_}?b}_h!?#?mpUwU9MRWhjH^}6LnS#HGmmRuGU>8lP4tku76>w+4vsk8i(Gs z9k4yq0)^^@7sj0r)xp2bbp^)9LcSG4O&mW|vhg*}3!86iN*=z(d233>YhqBrB?XezaD*0r;3`e zi%?qO&TkKzHu7@fvx$+1cQMw>Wig?E&*JI3ZC!W_%dk6G(F2(y_OktwmB*~{T@Img z8K<-YtjzEw5eO*&u;OV+I3Y6tPCP9Mr^pq6Ro<3_7m^5I#nX~-ylcwTVF0Z4-*Om8 z@+rL5B;m3+EP}L_Z!L&VYAgI*dPqcpS+*$p5yEzNzjQv4LITLuRQ|n@26RU;>L!m-GNjHKzDE+S+Y@J|~Ymw{5FR6wwB^0elt)y0^A z59M+h{s*;Hb)6^z>yfK3f&|4AvG)v($1WZ!*g4o$zDrqybx& z2TK`*Khm}%C~Um1j_j-IbmqFUfjs-g3#RC08WLo#(l}O{PTU%sK;(!RNQHnqP#v+4 zwpY>TfD%SBn|hH@kIcj`1?OPcm2mqAiU10wPFF;o&+IT%x|QrE=u&B%a2+O7$tKa0 z$P`gKKiwG8S`Jdmw`qY{$F9J@bi8S*3z2(qUvc-$4~p?O7<}44=?(@^wuuME3ULDP zzKI+Z31E2~9AP=~86?YgaW?^XOd$d9ShLcQAEZUULHb}~{=vWbYqmcL7*g*FKpM3d563Z!#H=sJut~)>lEX8dDHMLcfcRE*r~AD zY0uLzFs(})1FMhut{}cT;~>;L8cs$(0%ZrQGbZqD86pEE6_Uf|f8-Y8?vn{#_H=Hm zKtlc<9_{S*{+yPFrb4S`$4-JnLYo0tcacpY|H~uWhyJp0o05Zp zK>@V@NiZ(_ozlT_j5R+`gfLiOy`+JF;T4b}G>dp7Qm7EioQhg;X{_N9222`{H~a@( z0*Ct?pa?95oeX49EE88 zdtC9III-+ z!Qk5K{P)g0q*zq}S4bqE=JC&2!n#%duzzs8vqd-ViGjp>9(R^<-kW?guJ4)_ZFdT6 zMR35Rk!lX6lhcJ~EA>&QVMie*y zM}qPmh07vjoD12=(i{rG(6NzET6c^cwkqveO;>RdrlXc#9i2Wh?EsYm%)3knj=M1p z%<0h)a8acrkRGF$#VDB4fQhiwfmP>IfJz=0~MHKQyu|0D-Gu>2Wf<2moBY3}q2obuqp^8c`8Sk=ZGo zf*6v;lOcPq8`%831DAOfAdoiGi`R>|;416PB5#6LFK(ZSH~&+Bi$q|Saa%kZ&l3-9 z!&?Jv&IGeSRbBfjTx_js2y^$dq)JGTSX{l&s7?roScqhm5%VmbgIQ(7M2;tURvBf+ zXtOG-teBedw9P6bcTpq^Ir!??R;#uKTKB)!BP+^NuLk;#{;Za_^-23cA!>sL3RD(quyaVPit*f4q5q# zRbcd^fkw|TkQOzUul=Q0AhV40!Q{omf>M0tp67qF%ZRmnp8rjknO{nxUp-O7k`LX_ zZFHHW!DRu-dtz%356{$9mb>%S2oHT`O^~-#MV+I)N9&1K##t5l{#?grR&)q!$;T?< zi|wphc+L{l?DY=&kJgh~!7KIfoF(e%L&3*8h`y0z_YconriZ>9e(t2IBJ+=zJ(-GA zU?7S?J)yyq7`@BbykbIeN%U)Pzu9P0frm*`%WK4GwI&L1QN6z&9BuapAA6s6_P2YT z{bj07fh?|_>()gziz_ca9UdL*E>rF2&fj);=?B`YsOv{K-90+!_p|B+gu+?W{*EhO z&4j7`ZRe=pJJ|m&B$Ie;=LHBNTPW4>ET8~DT_Zp;l+6eHiY-ejs3n;Zj4*U>@zq!q z*mS~4EY=bW%^9nox^Q6zHUS;o5~nxCc1t|PsW379DJXND2Kut!rX4vUxAAv-Uv?m6 z4>Tlwb*HSVd=={eSOEihNNgSv07Ckzl>8=_m|yn6u5<#i0Grw|@R&fUDjn9Hg8mxo zU6qITae@Q-RcO7V?f{qhZT&-;J_>TkD&8rvVaF7QYUBNjdd#!@FRTpxTayf0nOvdw zUx(&mV?|h+5+#N_gSE0bJ;&uTE)RlN7@;65Isj+kwl<*C^>2>w5le;GADXtk5m8`rEf} zOSlWDM*r8@E(*cEH;%5+O|^@g;Y@z$7uLTOL~)GnWD-qy^NTnI`f2}!b-R?$A2Aa* zn}X!zxLWMio6$ur0jx{VR375i0MPKT2C0Hf;wvruED|w1=NFJ~EV6?Mo#@3EME!{t zY%V*T4PD1#UmVMxhTK1lDd7bz<#5jv04!=vi`fnxsuwzeHA;9vOTmng%0M_fi+}~M z@p8>5DVl0y(v*>mw|U{=!F@b43oW^JK*$a0KJf9(Es?T`*ss0g&j%;Rth4_c`?Yg) z)Y(7&trhP~v~iaNVxntt0WnaI0atH<4}f5A2MjNO=zQ#b=^g)ugzxr__jmezwhJqr z4m<1|9rwB?UphzZ@Z{+5pubaLtZ!48Rzds%E{>@mfK?+qG95Rh#{LHV76M_QA}{!T za+d92crO!VvVZ${=O7y?5({mxNOm9=8Nim5A@l&>?e z2n>S~$kT*74*)n1wXDSPIkYShMt|i#x02_PaCzk`1u9WuJQcT)7X-||SoK@s^jrJv zRk85PR=ZGnRV@Beg*L5>9H@Tk(N$84;~%@Iyp4OMsp{F(#mEC38xbr)`4vkZ-dIQ%m77-R2bt~ zK-vt}i5Bo5YOWB1>bI{SU^v6T!7+07iuTE`tgNyRYxKA!)Dj<>ydEE~*+khhGhG0@ z!??>U1cOg=5cG+eK7>gCs1W4I*YH*Gm-E1z`3Oo6tWsepY8bt3K|3N4?*M^Pj#uH+ z$MZO2>WxGOKF!r#A$f@UBUP_61{DIgGH?!+UGDL`a9iYT~rEa~z&;FNoiMSZftP6qYnv9{q{@(?})T;|Kk@C*>uX0*&#w);6tW1Qr;yLheXQHJKD#au>Lo(pUy^?R<($5}KT2&nt@gte9wDtr)qbVypEXJvBB^4wlmCJ-4Av3dRC zg)H)n%*J1~91IS1=Zt9x+&M(=9rVu((m>A?(Iyk-AT?FOOa1-zgGj(j9MHp=uYk2M zXHB7*-iq;JL$?hkF`$fEH63g5l|Lyvb7Y%t&#gh0rw0h6#xAQzL_nUm!Bw(T}} z;@7xs9y`hY?O#3gZnbUlm^tU3>D>u#wNxsVN~Kb%R0<*~2Q9!}IO1FMtAqrcO)&N; zD4t#g;1|-p1tAu0r55#iY>^Gr3 zq|q@8Qn$`qAkn*DMDxqnWnTtW_h%&FuyD6M||D_mt41U zdHzu8cj1@Sbgy;n#l5&6-R8TOpuonv`uqff1cJ&x0{+J^GDS)izw7gkthX=x7OA=cJ1fw}WH4-b-kiu?QST+8Jm`7M7&1$MqE(Yz z(||lA^CU+Hi#K6Tk`~K%zrFjknQi4ZulCf(_HYtYI_Pg^IyBS#WPQuN-T3Z@;C*iM z`=Xirc6a^#rkT*3g7}$$Y(OZvA2wIbkC)L;1RVaF$s;;GOkdvp)%?)!4yLh&wQhWS zm*329YRaAsZygfKaGnks$r=&%f(U3gisZ=5vNVu}M-gbTN!REMCPN}TmYxp!(*dr_ za{`aYn~y=%?wLrx`)%`a4?UD4JNeV*??vkuBf6Q<`r>+pFg z!TttnnQVp>B_x|!vTMr^f``2CeuGufyHD>|bAZCL?~Bi6^`B&oXn;d|9;!sNyn$JM z64ahON6%y*E{RHEepHn{gXVLC;N|(|DKalFElC51IHrJw(7=M1%20L~Qp(nmCf0t~6-xZa=>R6%CMa`l z<0pLl*ov_0a*7JeOVkoM_2PDN3F=kG9@6KhO#ydSv9c^Cy5)e>TDL=Xb$_s0fFMCa zkb3&@-Rj5nhs+g1A;2zcQIEBh0G6l?Q9G|N+4L;Jb!U<^R7wg86l)%PPln6S#?3N! z6}8eMP)2Up$RrJ~^f^=HPxG3kkoPn!YbaeN&A)`)){MsuDaoJz<_Q5<5=7s}crqRi zu0DQog5`VYSHglxtgm(Clo5+)4LyN<-C^r z;d|FCXU6%Ahxwl6K1pC@OHyd!?AMg>31lCVQi!D z7231Sqlp5x?*8xKezUs%bGUxLd9eN;&Gmn6+F#?%?7Q|F>I@h>YBRb@=;z8dv9T|f zCL7;3HZsEQORH$yJCe>K*ykI|t==$>Nbcs;t_iOq24WTQ34JI){1q2__>~IHuC-X58a*&1^8r z{(76mDuVjYXXmf$C-vZ{RzJKrc}+ICbNW*cYG*&5T%4c1s-0c3vkQ|s2oB!7s0Rc# zP!$CATCI9oKM$&JE?=Hs&_3bC$%~hlIlXU`^%<3j)xIacqkaCer{1wM1zh|a&<_+J zbX+P!^F%SA%$SI_2;-0U@8!k;!ZGY(0ver!VDA3D@m2+y`YY;Iy=nAYXE^*6 zklj-&j<=vxl09ezzOK+VwqTb~7%Ig!T_2d9;h^T_Sjs+uBChu7zDpP+)nI3$)Gv=} z7Z*W>Pr-o*riG@cSC2&yi2nyhacy%mIfCV0o?-K}%W#fOJu)RNj%iC)IGgjLSs8^@ zkQ0_gWNH4}ctdHmw$gcFYMnEryjAGLQ%KDlR?b6DPMC^d4(b7QKf1G&o|`_3c71Hx z01sS%am)Jt?v1?&LYA{K9J>H+tK<;ZB6RtwF} z;e8$*Ixy{TgJGAC4&tQpH}tjd^<>{=^;Zla-&eQn;pWh2*v^}U*hOp*;n;!h7Di9p z3&SrIb}9*B56vQCaVmUO$R%VD-I6Ac%QFF|Gwi|i1Zd#af4$r9f~de)pXg804_o75 z@VBdBPu+Q~R=h&_2ij$Sc=xwEKo-dM!>%G6{oZ)?9yhq2z5UN;&)=^;&*fI%ZM*|T z&!Bv~_6`Q?C<)+Q&d9ch`Fy#om9Hc#%;{D-Q_@O;Hd*iQR-w?l0iz~KJcWW}2$nk5P7QIMokWy_rGOAez}yqi?1CtS#VxGfBA_zB?Qs{w=WdS} z<`<+d?%If25uCI$40J_#8t2$Iqv;rWJ&HF>7RI6<0s2P*EEze^l)^P3jVp6Khy|xi zRhcz!76O5nrO};RsDxd%Y!LGjPeva+YxctH;Dr7>5BOhN-XDl0`ANP{hN66*VxY?{ zDot2WP5y=wOfHoFhQbDjT*Z+g*Xv_x%jZ1JVXrOeMoZvlx^c7$R-&OOrj!^YQkM7* z82RIgV(8V}#WQF!{LVdRq4oW5rB4UX-11ohz@>60Tx3la0XbWGj%9L*LMN)wfi6UH z`2Y)@=tA-4+k=z$&z>7xoyC;gvn*~dtHR%xzArxezWh9yjdJ{uqwJ8ch!t2}SYziO z+`^dP*$_0H(dOiJ7z;a3o0yf3gsXi;QQFdo+2E_KxZ+0S=x)Ropw{(}Mx5|U!YR=1 z!oNu*tcf3I0+B8z`PfL3avha`&9~(C^B!m2u-$IRJXzX2#80$uhd<KGpFNfd$p)GP60H>Kdp1qO&KVo3hJtRd5ek@HVD*c)lpta{R8jjUbf=3aL+A?jSgTWKZH)S&p}4b#R;uV%9V!xO!j>y~ z{f+nEXo&-mU)0XX^2DVOOZtpb9i4Q3ql~Bo%5Bx%U7aS054p82{zrS|{(cYoe}hhn z7Zq(>f1^6)#Q!gpwu^53$L&AkKmIQ~~?|I6%k0jU@X@ z0ALpDPJo-R(Qft3*AQ1BL8BpmF8_5(wZJ=)dt&CLglss<1tEskZZz#jbX)l{ULGI`x6&)xi&0n*iuN2jV*g;-|txkAnb+FFX$d5WeU@2$Goy z>ZA0GgCX4h2b>L=-mm-YYvbwVauN+`LffizP z_8(**e%!Dg#^Q25%uhhN9FK`MMac3&TK8>tFqmvyTTK9#oWg3eaq_DAqSiP%hnc@t zJ*r&yeKh&q6$DFN>7so+`qAlp4E;p~- za{car?n)4i1A_LaeLk0C7Q#I+eetZK%AHv@yn8^|I2H{*!7juTN8<=X7~Vv=07fhu zxt$^-r%3&^H(v{{&Y+AGh7vE@urqXBKqqN{(s4ZWS%Pxrb~tXkJv)s0-L?Q&dlhuqFTM)^vna!%fbzyMXwXhgY#{W5GvZwq%7GHZMa z+yR{rR$semds?68PiL16ypOzk`R1YqvhNO+waV63fyQF3Ko{LBF?I4EwZ{3eU8a&I zS#UQ`i55+pS0M&^7RQe$<&3)byi?~5(|FII&SkeB9l=yvpP(_t`0$!vXRKB4u!&bhc}+W-b*5^@mYDY!Q9;i&R2vr+M_9JBm!w2+9JJxTqYq(g;YUY zy{tBlPA+PPm**Eh3yN`De(a9%s<0}vh1tqFT}`jL-U4BCzm<-7`cdFL+3Km?YbZx$ zv`H8?y>`4|F*{8Jdzvp_VOX8h?%+c-{*l!q^J915{di<_%^|RLGF8YP_}vDE2$LD! z47%xA1ntf{wZUY3Pt0R}J_ut^#hl8ZBq`1=)m^?I2pxKGu@jgjBP?s-$jn{E`(ts( z!Tg4U-uWOX3zR%(SN6eGo$h0?sK&XFr1NtjEW#`WLfSVhSD!ZHS+)DWbL0Nm9h6HV z{YQQ9(CS*OI+@Hv)8coU$m;S6JkBfYHqwrIy~Hqfq1Vx$LI~!Rudoj4cPC!NMyVz7 zW3u4s5ZiK$r$2pC>f$D>4%!GneD=x&+Z6lG*e#dz@K1b7N-9-Hqjq+Q z|Niv){NgfD4^0QPJGz!#VPH-TelRDmY%oPqBKi*nb5X0GzqvS6p*KrnPUR>p4**pA z>9EG`C;XJTS$M|)Y9kMTRIeSrxxm$xcq*iBMy=@>{g@sA=%8A!UDQs`WmM8FQk&7$ zQtPuqxQ!I~( z59q4X^XgH9;~Wt))1bhC9UO{Cf#E~hi0-V{!=y+9WNy|5M-FEH?`mu72= zC1c=;sc>rUTr}S8=cT z`nhEuTSQzLHCaSeNK_?sF1i4|LGEYPvy-O#h_j-$>O(5aS=f)>rT`aPVbcMk_S^E3 z&`q!JV+<&%6t*Qxk7K0`%YB0BGj5p^!faI!CW`RZRc(|eJoB4gFnhm)N*3`l%T$%s z^yHSdz9!1bxjIFWwn?q$DLXx}Qjx^BJ4!v30`bZE=Re3ye&#?S-5@DlrP*U~<@~%u zF6Dd6o121a@LWPA=N&x0^tSk3)5WPJjQ}n(25Z~-ArECfYE%#E=cjKjov~0z&Hoa_ ze~@^JsrgUO|C!7llxD(DmMPE7Up@M}lfROhAHyX!{{HH9_2|gpkge4G@}Ri=Y^Uaj zU*%Gwy-&Ud1AYY%3B%qfYP5%OTvq_?hlZFS9( z2&7^I5hh9rWKk=n2OY9lYIOW&%ijugzc2p(Q{E^n?3jXueRe`$jbzi*H7;b=Oo4+o zP7}@|R!*Za$^S$1%+|3TG??4KLSaWBcO)iCWg1QEBfoX@w|5_GV+ihP9Ez(R5ajlC;&@ZV;b zS1A}h4^k@h`zik0YU979BBhI4gz+OKR9bG9Eh@S#Gh&@vqRwrC_oPgjsh%hNZ;6T! zF56Fx6au*2R&{cr?XvMPGXCutb#99~pHy^h+YEKfsGm}vY-u1O=TlXunOq@Y6+(1N zHbd9>M7FbSw5MX!$rNrI{}Sa(6+wAL+d_W!zq-yH-MydamS*O^k(d%;&PP z<-)O*-(4+W)=!Gc2@@95dN`U`q@H1@#$G5KxV=F7j?S^o-)YfD-xGFhv%ya0q+NR+ zH4S6;Vp&}a_+q7!X7PFDe75p=WefxQVp$a?3mMjV`cA^qrgpp5Vv-oH{oO&ccGO%Sh>F`qa5s^33OyOPKQK){>sv*Or7ie=htvC6XPN+!a`G4A54=yuP#d59UEu zn+jIOk|WR5Hp47pcs3r)?8Ve}S-TN)c{#B~u~;SMzQtm77@HaMsA%qRxOs~y6N$O) zVakF9cR!TE_ZzF7!Ds&Ex&O<6u;#G2`UPwE#KY!*uMJU{wqOG7lIgY~v}e<()xpRu zjR@txY0*O4Y@-cIhM5SNevjjEOTS>l)msdUaO(vS$xvI-_AKhbx+$Q|ejpTlOu_2(8`P&?utMVv zYt*k;i~R<5a)N9paRgxjgiy-{3i4|-9~LiSo?)z*pah`HK!Ha_sZp~r)$UI;usI3^ zSW!S^LQvW+$b&P>c;9kB7bG_Z!>|dY$(l@*$I!Mp7Fd)56vRz0W48%VID2zyY!5-g z(dntN{{smx-kca4Jdl7s!({@CL?=_ope;HltBD!J#k|GUJO<=V-s5PJTlNf0kfj7K z>UD7VWaHxc^Y%R+6$Ba75R8-;M?%HXT?|A~z?-EN6goW#-T1Pf$B>{+JcF3Y+6PX2SNEH zmlIJcSO%=^2is7RFR{UN0kMFy$4X-*kBr_L-Df!+gUzT`${&!Ezhc0#FCo|`MKrK^M%zwS|xh+vhVdM*Y4YtmXo5k3ka5Y`M1z%6kz32~=u2_RaO;BQe1%5CBvU*Jtep zq{eSmt?$>LGqOw9eaQDBn!Fmer@iPU9q_MaC5)T~i)}yxBA;LPb1EGl0)h)cae-@L${fZN?phNJq%{@+{*~iSu`QWkQ>UgujumOt$i|6H1jmD6@pj9z3%P zWK&8&_9fpZvEs`yz_m5RN8?Mg`-D{Tc6XeG|ME!tJn9CB_L8>iZrBTc$ohW6cD8`F zQQ`UJXqR`Nw54ybq?W=?F$ac{o@9jpTpf*AUabzysjbUhPyN)T!#qJ3Xumqx1EO_7 z`c7J{1|Fl!W&uL(ZTG!kER~MQoCLotv9>zk(?Orqe60C4j)yIYn#63te?CO_3t-3y z=HVZxpC>&ihy!qSHB0RT;YFVe=IvS&$9hrD7@%dSmD9A}9c1}um=|eHiI5t(&w^&~ z1N_|$n&yBopoDjeLTLh&P?Cvgf)l_fY-e#>2b7i0NP-wdw~f&-mVm@sZ-_kDnMA!_ zwj(=3#LNKlz}IK{y5v%4G@Z1vg?vDHKRJs=+&K!-;4H8oI7nv)FzT|nUsgcTk;?^- zgMS}5JYm;S%0l+<-!;Y%ojt;&O|+DT4TH(h28ktS=*qF5?|XZ z9H|QwgvKz$f!(2KtfOfCxm*H*PI=qR7&MeK@^D0Ig{}W*T6826x4T<-%QoM#wHrJ_ z3xWwYrz2$)rAkPDK%qs6_81yLd;GlY#5Uywq6o%Xj7n`vakVI;ospJtpPr|?wLpKR zP1lrfa(gx9vzP(Quf}geQLZ9`RpSdo$ol#XcvCjf=x1u2)8IX686p8P1j%6($Qc@7 z2|G%h;>?LCft_q-4%232U_^|u0-7ZZZh@0%Kp@xC845Y5uy(|^MFpN~D4>teKofUm zLwRuy#D;OOWGUp=QpvPze{pyHdAE&=BKzPg&et>%6HIzrry2}rh=1@a^M*l!rV_hKQi zXDu3x?d4!!+^vV2q!0XB;Dt-##SbzkMHb?%Y|}a>DuQ$U_{oA}Xcm;SL+XkGlP7bK z2{Vr>fXwVnSmtbOep|Ca$l`>Rb?m@K2_?4=aV_^!WApAM`E@%JG>6`%_b=4cSoxALlEt3^|2~R? z?4#b4eN%I&n*_Fg@6jEFX3p#SZ@41Du!Pb8nphL%ZJTM{+Kl!rm^|jvl&zc5tgW(G z(7>>lE-yI-QyRhx8%=G4DKeE~BauduoKkTRPp$Bf0-e_w8GXK9#KFso^+<^e1^|2s z67Xs`83H>`2V{{o&F`2WO+0-%7Vs~*Y+99!I)c_1Mq`JzmVHuLpmJz^G~4jlX@uZ< zh0yK-L;+&+_GMoDmcX=yJ4q3%<&aVIc}kmO8HAPL%QidPweVF)utU3%1MiavNJdqDAg8__S>d4 zLakKxC1LEA8&;`3tB_c5X1V2SK{1EsEuKbFoTqXI1i6gS)vj5f?X0pgMI$DiQ6+Vr z90-n?%xJuY{aR200L}u6t;ftYvO}#ceZff1H;KNr)9^L% z^YhJ~C$r#suK+b|5Xu0-^55L)GNq;3?4mtj410%LKW)6^4gv6WSR7XkPc-X8C3<5Q zP#oaSuCT%Ny67KMmV3GcW{s4xr5i+OI^q4-$=K{Ewa8)T^)#NsDJ|>pEA)k6DpaGP zJgN-Joerg_=-xFs+U;!Q(FfUNPbacDetVGh#>@m77IypxaUPdAV878i*!?8P~}k;zy0uD3UV|fB(`SljK&$;Y^$3@M{>&7}&5af+BETp5`q*c6W;%B-p;e zdXG`vlVg5x2+7tGe)2XA!9eck_Z( z2}adP^>Twu)6yhucMG>)jV<&VaGV;{%xFo_yfXOKPLGjrmyMINDju-vGho?qs<=Mk)_N-g1C zS}a$*lbAJ_6B{aq{1H?kqU83l)2_RyEa3jYH0DF527$f8i|t|RLKZ@+fFaB_`Q$GP znr)EQADll_vj z)w_^(X?fYq0x&~W&j}Uu%RSM=dXKP!8I1)UV{sEoryKFE_D@Yo6fWpmK%2s=xf|i1 zX@Y1z5JWTSZ_^5SK`=uChlT)76mQNg-gJsf=cmb-=!UdvCU!|#k!OGQS&FOfd)BNRGsgioTv8X|bGj4-ei6M8?7MkG0mjeoR<0i^acW-ohK3r(LdSd&PIM2q)wywPg1$SRu8oJEY zK#=z8v9Ipwufld)G?EhMJp!Z8Jo)GdM@pXLDG)T58!cP2hp}CVAu^%bxVETwMQ`C2>v5Bwo#VR2ze93@Jkm z!Y+UuRx?I&0c>@pn~ABK6&h6*GnZDifO7M%%IfSD!kSw7i1x;BEphvP*2ezoXz&m& zVl)tMwCo{r^R!Z2*9$8uXzeHAR3O_z$MWLIaLiXZ&_bNM3U5Um183aR zI0}gwu_Lj+sQv!qrov2X^E7GPGg-5gL+@bOKSG1BEuD5XVtsFn0U(1KAvp~svD4$3 zWK>ob>%<_IYU8M)DI;i4l3T2I*hnBn&vPZEa+dcCchuKiqNBziqeomr4YYaAs(CW2 zo6AXCyxUCeJ93xe4@k~M_FB)PKYU6!K?FYp>`#nOuxkYK;Hrcqw&CEB1ihH@J5~se z3E0QlTo2*F9eu*J{_?VM^z&Ku)yW~g95CNKB0h(Lx&;vWaqkfew!GPDS4KsT{n|v5-mk)qHF?YreHSJ)tUb zK+8UQ$Oh>FRnDGlw1Vc2=IRhbVCQf&Ldk^(kI}-rVcV$nys0O9Ii27R+Q*={mE&Gr z((~_{>mRPHy^Mfz`IJD{tuJDl7BXI*1z1}8O+hiS@}NkTWY<$3KWVcwIhrAhDNCaw?ZM{M9;N|=mB+VXA8V5(YTZB?(OE23^_tA)V_4a;nV zO?m;1tNBi`gGiRNknPb^n)OL`Rx<8x=c-ko2816UunP;8uTm)_8MvR6ACZFnNgcVJm0$$dr!ZmX2S)WF=n~Ftz+S z2R!9mArE=tw3ai3vVB-{N$LOC#LLUZ@td>PGKAQ9Tf#jQxrO2?Y;I4pG(?07ccrc4<2_N) zh;E3+s-!a(0d{u=eKyuTGo##LGzPSx%c_xVNIR3%VpopWAnf{ziznK$4=3{0v1X)a zqQ9z#?;P8q+cdiab=7gO@+e-(7-zBN z2|KoG%4yK@kVl1MjMnWw9jbx3T@9Lpld~gx(4g4I?NE#@eX52o27>7X>k^8%1`oGc zqk%Bu)2-A44Esy>Eeq+Smlu}F{-eM)DLls%apN0^Pp$em!4(X93r!wM4$1?7d9A|* zc=}Jo7NvXTfhzaI>B>03YafPF70;A{0+J097_PZzs^vg75Hms?kIadb`d=roDI#I4 zN2wX%qDRVQG35cC8G(8byvx9Jm&uq@nla_0kfpU} zuT>;oc)*h&q3ki?01ZnBX!N#=UT5#sE;(UkXAOc(&M-KnQb|_qdaO7Cm5k3_y~Iwq za>es?0ga!K_Zc?G@1nk!(P=d8xQW;yZdwzjgskWjUQ?Q?_?QWKK;iOT^>Sm7@lQYdaoh~i7 zz*{~8?ku+X9Ohv$>-M3K19*Cy)7zF|+3q5bQQFPmwmH!`zqt+3qg2TezhGFhrGipl z(Gx<-0#h|@Lbh@#`1lcWJO@!#dO}(ZW?$J@kvT01g+`ZV&em_xc!mo&2rby|5>SV8N_cip%VkHQv)XvpPU|Ak*+`iAmoTNm>Jy{)^B46DDc zt)X5$oQ|@}`=78`TQdo^iU?uV$~^_%zY~@u01d?Gx2-@CqdmXU_2m{z(J$zM+W>`& zj{Ug7pHyfCwIy|WdJ%P^aWrT}6hLPjb#yOu*xAJK`4?RX8UX0WZ;K`LlYo*qNZ!(Y zm`3MxuA)ht#f-|kf?qn^J9I2*C8x$xxFk|;e2o>O-0*wNed;(K&)T?tlla+_g9 z8=JyJjDLG{z2%Z-4JZl!TE*7ZM)F7?XIR-=K^9t-aWmxk_uNU_c00rU}6ML6B#E45vBXOov&|husi1!>HFG2H7 z$KI|n+Ex6_cJXQ6y0=}kYb@=;7iKo))T_^+WThK~!JD*aFd6rvfodAHOE({2Nz1Lw zv8QT*St+`qS+YQhX{S>h7j}J8`LQrHn;!#)t?A1xgs~S+dw5747c0;#n7=Uw5?O9P z42HMjdT3laqXT?bt)O|S?CWk}0pJC;X;Z-!_UtfYw6b2}>mgE|Z#fgURT)?E3$C$) zAW0k)sRF9cI3d|Gv3;ojb!>WHE+6Gu^J*H!abq~0kbq>49yWi`$Nwk<<#dAX4v8>l zs~q7J*p5V&RSsrkPgD>nphvJOohV!|iW-$81d!p4^Ea2T-(2EGj0PrnA7J8!3s5~{ zu5IQ6tNm0<0~Xyy4+M68@ORq0;Hgi58D?^6H4GE*=>?52+00-lI)FlKTy<|Ep^AJJ zMzC##!b~;h+wbfN)2F&{mCm2{;97Tz8Z&3mb&<1I^x@GNO1SMO(0cK8k}gQW;7If(h|xEX^e$P9J@=Bb6l_FjQq;JpSK8XT3rf~u!CVdX#>Kf$lwf%sP#BNAVpZrU{h%2;{Do>Z(2YX z{O;Wf#+6Beyh>~Gg8UGT2T`wFQp+W8u4x>N=jFL-cSV*@CfCUwN0a$}SYFCn!!$=A zK{*vU8X$Q%!^b1jtV_dnEOvo?9w(fANegDI z8);flhDgIRVsWpCbdLzb(!7+I4``f-lRK(`DwdmW+oyEfKTlIj8XJJdi_?ytqj34j z@z*k>MsM_nR~Zby#uDj4?M`oQV*8<^Tj%}eQ?m&l4r9^Lt!KlDFz_p;-P4{P(0#_)Adu zM)+9I6a{P${H6aP>i+VtXq=XB-uM5e&*thf%z!W%2H_O9%p<&5q0MfX3pAW8DEew%^H?5$dIA{-H z=E0++*AzpVw&%YyL*G|VPa7xo^TVf42^<{^Lm*{QA`Th{L(rF6!!gG2?OE5TADo|C zrLkaX>{UBox3+aI*MhG~VEOnV1nF>6uf=@Ce$KxKZJ5G`3UvVQW0J zlj7D;7%WwixE;w!gdRpW94oOm9F81tWCOO-Fno@K87R$minzqw0Y)0FoyG>pWIGeM zHDN#|^Ofu*Qm#W#RFbr!lvdwqAL`+a_!BW<)BC+ zV{eOvCYyv8#-3W5-3i@2=*bU*Pt(Et(&-ID4=9uk_+Ro1EQrIgC;j#snnp(Vt6#cD({R>`ltFVkFaE} zqh4>AQR$dQ>3O^rx!2BU1TY{v!^#=qX{l5$KPeT;+dEs8Cr`F^3QuzD#T;|CD(&w&18PE_U$qPGAQj$X2zo0m&aJhW-i(Es?5(ym zx7yN-YE`3y;#$!vM#?s56j9M7I0znZ#!@0ofXGBYuljPrAO=u$OM62Mcymix zX3MKg2#@?dN`=B#hlqqT?W?|^~?Hw*~4_~>aFuXBE8=FHNo&+COBG>Z4n(6%|Ctpbs^TH`E5j@MIw^3=4 zQoNBOn@LU6!P{W{d5yZ<6!m@F4hN;1&lYn=UMQPd;;Z9EjQ^01Yo<~{wjW<9T`|K9 zgh|V0&WRQou*!q~5npJaEH$8>Z05QvIR?v_@3KL}-U8WaGoExOQ*2mwKrKNvHOLCj z7aS{5NaH06`#HB;fBjXG4wScFf6Zk}IfFl_9*lLS$%S4<8^PK6Wo=iRsqPYnj8OK` zVA|{H(nxwBIIsk*2RD=idl7(z$&cR%%q)cjc%Y z<#EaWMC=O`TV8Fkxf$8Aycmn7BPpJFUXAterqlTxZNi)}%v0$mTabfp%McH-b}0qS z42(L%VX?u(oGvuZyjyOD<9CC1%h*Zpij{ZE#mt`1Ze}#3>1f`RZC8tX`2oNc;lEND z{$WjlY_9);|1(cGL-O4n*xG;8BJN)quQ;D>;oD(QxO;?m#2iwl z)0J=q|9y9dmIM0Pa*G)R(UXRe$a<-xIo*l^kLp}cCTzA`RK0oN4-D^2kh#*LO%_;r z_pbcp$qLST@bj+IS&>71g+Ab4Om&K#8s$!%f~T_NsVZtr*}$u$y=XF{4|us`v1u05 znjAIxS@3k*47b=2>3@dfoYj7rgw{G8iQwiSbset;uU=E?n825h_e~&$}FtMVY3&#E#u7bTk!ZX zC4z1)ewEa(a`4G92w_dTNgj_II5u~ebwlw;3XF2C0^|Jxv5rpVZKUclksE;$bSSnv zgNtCn6!v1Vfr@Ja(l8JR=#eiD5A`ZT>5tT1`_N0z%5G0l39i$nnnk;t@eA+`Ed|a0yNl@>x}pOs)_@5CC&UNpmQzbnFT^C^ zrqZOF;!;ep&BlS)`u7|*+qVNJkmf9My=N#!bUm>6O&3(7`eD~D0D6=rwW3=Mb6T&o zw;dfjulTrYO+;#w#h;`^Kw>|}4?GxtP_jc3O2)0BKgB=`kWNw4qyrt&DNC5YU{Nx#2#tcc2!Ol>0%p!z1K-;cXLTAE zPsow8B=)(`rIGdqV1d_?m)) z1j^oRmh!>I$lPnj1b3@hw8Y$LCJwhYnpN9eoUCnTnX6=__&1pqM01Z>cBZq%%pKRA zIADF7%i`mQv9EpRzOsa(wv=Uqtleap%i2hmU8MJrRR@{d$Et3Ix-#b1fGz`(uL?rh zg{OA%d+LuIrS+Q(@jze+n)+*hq~B#@+F!zO8E$ zcjDVBP#CnRQn8$xWfMkI+P6ml+Fco|kB@OdnDXsE_k$;C-#+eBJT33H=jdLU_VL*> zMpaR(ge?=o6kgYj_ap^p5O4OCww}{gXQSlADnU2%k##=8SJ9@bp~Jb2B<_ zM!(JKwzOVr&iH1co1P2%J&jQR4*lutDd}rr&XM18qpXz9An+}fLyDzYECOFs`xw5Z zcM*I{?IZY>+DY&&wU^)<5IG&w8B|Vd-+J1IHO~iY32Ma*BOkVva3$wUzVatu`jfLO zxt!X!Fnr_e?Tu^;%_UGHP`O0`3I4T$fy_jDRj2<4rPG$eN@GQw7x6xuT;~lahOG~8 zi#Tts@{743z8Ov9Yr^Sf!l#>W6mmv(ig&QdwW9%cXn$mV z-Nb`GOp+hWX{wYqPg#9RISt)MLqja-MSP%E7c1ow{9o@~>-=xmK^cJgs zSrXd!80vo9bQo$J#rp<7g=|Tejqojx%*NQTtlUO}LZ5=7W`<&_5M525Yu4zTnAYtp z$SQlLhM*UN2Er6Y?N<-|F}taLVx$y+%5T4lHAT} zjUXR_lUdi-9hgyCRtod67*q-*vKUmQgSXo{$68RHo2!i1H|SiJf~Hr_UL|c2mRUD+ zk~DP$1WL*r72?KC+B^l5Vc?Dg{b_&Zx0L!Qno%k)>EEDSDw=v`pMkKIDHU}mR|+zg zDzQMWSq-yb1;Uyr%vw=@G`WXWfnn*QxUtAF(lkd#t&qpHFJG#yExkxt6lo8q&0Zwf z(U-B}WPB?jCeJ=-dm9<*YKXmsgyZoxf}1!GBn#!=0&Z!xmilyET%zpUWSrf zz(NmgbPS6&y_fWwl-|opkq_y+>CGabc>zrPEgLmXH*TCdA;qXw*20b1RZD77R6v?; z+!|2eEe%3RLBJvs4>YWk5tiQ8pA#9%`qiWYyq1%K3rf!*0z%9)B>v;-@-YY79q&K7 z<1q%wIcy_*06|QzkC~P^z0E{y4JtH+!nU?5l~C7%k9!`s^C@vCr?+$t(}i>B@Ft2i z8lLa&T%yPF7gSrCQ*9}=+VYoFTb@&GIkno#msDGsQ*A|7D;~)NEOI&b6tupy4MxWn zW(w@2JFOPa6~%j*9csPe1MA8A-e*0HhF_+rq&hienY}C}EB_bd8&E3}XrY zEjhwh7uq#;V=+4#j_wM@La9(L2-OeEQ!*&iQK#K$Ipc9>-@g`H6;YUSj~Nf^-Cfj8 z)1jycA1*lG2N!N!+)f2d1TX=b2?+#e08)q~AbP(fa4eTnL9=O4!PBn^{AK`ASUAu; z=@P8ndCV0%c8&N!3Ss=MN?KG9MGH?CENq~tiWb5`b8d0}dU`XlSBjxgjUlq9eopky zmYiZ$iB-L)Z>EmM(GBi}*6}_7ea@+Vdj8MaMYfd-&=`TrCjNf>nEnVOfj(e#{^s>- zk=rQw16dE&f-JtQqltlzsI~Bjnh~=TgISKEaglc!9P5MxZSG?m`();-Fy@7CK7hr4 zhps78i;#kz`o&G1&I<6mST2XYi={B3Sc5S}68bI%)lu8d!=y%Fxlkv*7)$d4!Yhcs zz`{lP>k3`B4A8wG{!$tI>o3CwEFgUmV+3It@sqbrL|MCJ^6&~_WxFeeo|7whi4VYb zz$MSE6#N-0Rz}rXj+cY-^h0|=R<;KX&PiwMadg#<=@|d0+v^E8bk$`AVk&fXmKf28kb?7>MqWy2CN{1TL6iE~HyL z1*#LxT^-H3q2X0&m^_phB(9;eU5nLj&096EHmb%Oaj30nRDRK~q) ziPvw6CNxgtQ3R`};b6~~Jb=M{gE5Y_x3ew+- zzdi$1UBBA9R75xWw6AjfkhM@;)u^l$HnwuRi15}MBOaaAu?$T1F1>lSRug2jbhIQr z4OvLbqjH5xtrz#$C7+Ee9HCTu)?39$y;-OfQ5Y*RsIGok25O#~Q2p{98ZoSmFc!*O zIa>QlVuML1sO>A ztEkvLeDH$LP#_xS{1i4D;|RS&-oD>U`M`F|%}ttmF@<{}46b^^X4s>E9O%pk-7&xm zNz@%4(G7Z*1Q^pRR_8ky+wWxXWC<|sg{1_|fs}yEK$Gd)_qpH7dF+v*GJDL3nBbUL zyM{RiV_~oUT6UFi2@7GEdico1phy^$KkYevTlPCP2jrAF(%Z=P2J&J+2nG{lCLlBl z%Ogd2X2Hz%t2%!CtC?M@mA|QirA+Y2DOySvEn8)OO%zdQlYcEIt3x`f`pU`rDpq~+ ze69|vlhP@If7ZTj@0gAQNgU81-~E&#V0^0q%7nfU$;6^Bv84SGgsQ>A{vW~P-~y^6 zM_p92Ka9ySL_~jZ4*{(ihk!)R((Ifc#(vi#k?ye^QuT6vQRu)BuDCNfRqy01SviyE zigXwaD{?T1vAl|Wk6tf==~i@{x828x9s2WRy;_*2aD$_}a(gW!=qNkD~7mw24W z(VA5>Cx3aFUHXBgPiD;&Umu-vOa_ztFcvG}*%B2lKgBJDu1OVk6%jd+j;SeAn`Md( zeXgo}I?Ct!3E5+qIf{<)*>D#uW)lU9yoot+`NtX=u`s!^#dTsC=ryQBb*1^$5oC0> zk*h|s5U;Cu!C)A$@>6QFteM5F5@X>)t@uZ%ww`lRNtotLLm(_mwn*{Vgf-D*DfLV0 zD1-`z>*vl&FI`flOI%tXZkL~Jlu8OE!{yA!29!Ck96;=~P}ISTd|NOscY`?yna%O_ zzo;j%Ge}|37OH^<4XzO=gghBdHd&@@N^K*=Ch;avUYL+T+SqolmXW|&5)S09#{@6* zp`f^Co%f8eHqg)rM9eR4SSQcMH{)RZCKo$W=u8w83}=H=?9z+!)ZUN~4E2F(oiFk* zm46?BsFusJvzGmZTIl~|QFcxi3(Ra6l_X-K**?U)pKQctXR*NK3_DJix|j|_?1+nF zZKTz*Ta}1K30jHHFJp@ywvV^i;H~WCv_aEK+R& zoTWvG8Kk$R*Z)4B(U##;nv_zu!)Pid5(`*;#lwCS3}IarPKM*e?viNP8h1Y#^IQTL z-#lBQkYRmB;q`fi|GjWw7EGwycEcWIfX4V|aaMn4Oyu~&@vtsE8hYNt%3Bg1!G##Qj|RzBGNWM$tnvWuk_ z)mu_DR1+78o#@;`N}Ov_j- zP);#RQX|A1I1uD=O-c;OL?^(*%LF^DmSX6 zNGzhi?OC78+*wo`9lkCK0ZlI@^QD}jBXhd{isWNOMB~HcCKnX9By-B0K~Bx(6(`7^ z_>E^!$dB$9!6yMg^4M?KZBCIU;Gh+C(IDIO*NX;pE{kA2F`7vYf)#pR9vS3>5*oXm zF}NceNcrBDf{l%hV2ebj=uvS3@$HW6W@Q|4f=n8^LeCiAR+=%!t@Oo4u~oz~K;?Hn zY@z7Zn=uq^j7zG!We?il%hq=o_fMn%AWo>{Wf5JkVj*H67vPox$nSYcx;3of?KXZ> zDJ2D7@Cbj|mh1&3P)7{`pRj^lCcg`WH$t?kc$)PjP#0{91mFCwy4$i{saXfh?W=hP z-x3oOGJusOu`^0Cf8W(#O-W&nwX*BLLokz3$Z))kindrl2d*7ZrIWalu;zsC2wkZ9!kZ+oC=EtZ;hDjsS=at z*I6`sWoG3?f8|Ag<>;*CPnOf-tgpUa)n606ORt}IZb?$(?W6X4{4dx~r-OV@faaxs zMQ5J!QhgF{J>#20_MRmQdOlImvqVA9CklGL!PoN+zMf$BcAz+3=ibSQ3U>S=t7Hw6 z#Nh*>Lojguf11-0=gj#y%P*9QeyLO}Ya^_UM#aXpl4J}S%fdE5%gHUp481sr@|T0C zd^w1%Ss>DEASRi`ytonC!(Anp{K;j1va|`w#UgEr$>mf`=Z7&?S9>^!MA&?_ztxUf zy>J}4i$^gD+e64bwpz>j72MBkus+7fGV%L_AXGZ*h%9B6>Y&fly8SzaqHW1H(XJ!cVJqB93IM8nhm`hW$q%MA2L}RC_LptWDeF5PZEg|pLQ>pD zL6>bQH^yWrc<37$kJh-N0zn(*M+W5{CsL5ok5f}Y&*^4LHcViS2R9mgZ13ejl!2v? z{HcFQ!&oy3sj2IhE-+2^#Eg?iZ@{Gm)=%1J<=Vg5apQe-&=bfwOOI*0a)qWcmC*CZ z&E)u;bjpyn<)l?0?TJpad<{EW`XdGsaRbAc4ckrWK=h^dIO7(T*-$y@OYd~)q;ERy zlYjb_?(Sl#V0^7WN@%=qx$ka=&5n@c_wW~gE8_1~0)Ig$zLJpB@MKUf>3L#))|^kb zo2TXd&d#eUDb22=^nglAW+k7ro8&PDkj#$8@OGCcaX>NfbMHhTNBV#vLX3u&_6@&$N_1-ng{kOR-Juk=CFq0#m~eV)%Xhks zRV4OgBF*3O#ga5rnaX@4UOFKSWKo0p(lcL_yTD}F0ioZa|DSf)XApR?4gd8NNxGqM z&&VlED8S(^H1IU zQ-6NwwnWG2`6e+8@e^){s6d{7rMp8_UFMKRo7u*e{~LN;rF|<>=xg^2a}&^IV>|8R zdZ{cw0Czx$zk?WJ@zcpO$K`{}qfRC#QrmgKV|H>6(hUa0kEi%`SukX05;lu!i(&)q zkQ*S^*S9ukGeJh!aW1zJleT1hKuGwADBcHbn%YPwW+02tT@6Urk*)$!p5z?L$^IgY zQL>Ck_ZKoKmMm$0lp4Po#;9$@L$cnK=;whc#wB$Du44FCQT<9RqOEeJjUsf{#uol6 zN6PgEqbsMBC{Rq>5f+1=QK`I9DvwYL#1HM!x`NRb0qE@7+u^N-=xQRd<2YNlfs0QFW`GLD zn)q2V4k_5-)kHn?CA*5>awKOHLqcw^Sej^i+V9_MMKlG9P(y9XGZto4KS%+pJRVH@ zoFD;_K(;ffJjRI!<0s~_iea#L@=q}WwSNSc+%i`Gc#D)1)jXbGPbE>$W2Yh&PPjK55pR(A;2YY7Xr_OZTcLf6JN+}o zDOSqMsWED%#vnlV<1vPDcTb68B23t)ZTX+8N~3qiF5s`PsCb+_XTUD9C^Q3NsHOydBUyFFor`LF~<13$_(p!b(!KhZBn;9nRQ_kj6TYd`4|HFsN%GJhd>M+9*$5 zoTrN-J+-i&T4+yG@t!i`Q~4i3xB8sf&)}IJyXJR2M^;0=JwUr**9{M|ZdaqwWla@1Z4r!o zu;nDLn~65)(^DHb7Xap|Jkj{GRL+TW#s(ByMw)$%15%uqv5CW7)ymnYgF%JR+&hl0 z_?WMC4a{#w*QoIm3LNN?p{xve55h>SVgG)f`a6HL|BQ}nksw)cXzBo^U+m?HKi5rbZx|Qli zqm_4smD!gXxz}%Su}3TJ`CzvS;v3#0Z6)&Jz9Lp_Z!O|OmnJ~J>nkSgLTyhOyuJd6 z6OONlGwV21W2<;AC*H@vtHpZ^^Sj3_%!Bfe(g^r3E{>v1f6 z*I}5Cfx~CCl06pLiXvn_rk9NLk_xuzy-40!%Mw&|u?W66It_t0Gnn>JGT3`KX~4^HzV<8Dw*AJ1BYoQBMS4BSA!IK1ii3 ze_A#Gy0|R@&~wFtNn?{bS-vbOS9Iio(YmuYr>AaeNv5j9n8w`=DXta76ssJP*KCnc z)Nx8mXz!TlSNW}N!bCaiYl=ezo%>3`BEME+6?$9I zmUP(Fsv}=L0qa#unaqmQDos42lXO0(HLxdLySQ(Wi@Vot9dFItN3cx?!Y6q&;M44( zZWx4|i+EC|1X{`TP~ON3um@Fu zj?&03FJ;EjXb`;{yqjd;1y5NwKCL*GkEkU?B($vRT>CaY%=f?0KXfK0eC6@sANHbAG<+j|8YGNWZMPM z(&6_J{x0(G5Pz5WcME@)b5x=Lzkyh}e5Q!0xQ(07l;9`8$dvJ~h|}NcVBsrB5d_83 z{ir`2-(#-}+bseR)?pDzih7=vz5uefM)yUb0|t{}UYKA+0(L#m$PMAYVE5U~{tEU2 z=#02$)AM_vRI{Rp3AF4OT^HZ#UK9C?PX3aWUv-3}cPoY7b*4AuA`%ZaF(_{4SNthx z&8jpIK@eQLBMnlBn}xh4abegHd4V26C%y{X?KpygVTTTdB;LYnKq``TNzf67?IcEa z&OZVyu|fSz7PDh4%go6*lf@FjI^Jyz39VLU9s+GNNGyN=RF9R9ze?qe2C)(RvZ{@5 z!)Cc;qjG0A|E_g?1%s|x$UnL+P)9GJ>USHCU{1LON!7duzE}bYv;<6sL+|_IHsEV# zy&aC*@sh}8fy^waOxNA3Ya8HhW*->>P+F2h@eUP{CDGq^Db4ll;q|Az?TX#fFz>ja z&G5MxN8+rqA`AdTF~j{*1yJQQh)B-=^HvdE_#)`VpFJV|}PCIXlrJeVl&83^L=PW(d zMA$d>mh?fSC>RVmM#Z3Q#WsWjffRTFa4pRN(Aqrxt4{Yy`3gAY<=N@Hx?M=kn*5nh z-~WV9CZD{LiBGOUR%1zo5pQXvjl-@89_6lyh!OV-cXF458B=eQ;3iMlY_(~l$ElMT z!YIoOqRXm@NTLKC6maYr(LybM9+SwC#{&(?$RE^=F3_s8^UK;UUUW?DfiW7PQT>oF z2abb~e7?rxs5R-`Bcn`)W9VQ$8U}qPH7)ETrI|~zup&fv7^BW)+*CYE0-G`r_tcg2 zGpPlckXB48EFlc5VJ}Dq30H+!Btp5u&Rvc&J}SsK&Aq%7neaQ8&pE=YJRHyY~pOvn*8(A5sc0jQCUQT9;` zBOo@`cYhVo=r8Damh1d1P=Sqy@IfZKn7sdG)VK-N^-k86p2m47jJMf%RsH+<1$qtf zac8r&0MXnHNqn-_`YCy6&71a(^r;zzl^99Q6Re8+rP4nOBVOuvg@rd0>*#KvEX;{> zC7R*!0OlZy+VHIzwZbV#!bz)z4&$To5W@%!#|V8qY)|107I9pv8BK1ZXb?nU>lzfR z50Uc5Ojd6;Bk-BB@d5(FZXi2cvqLr!S89PG7#HH<#U9&C_;3Kp@@l__RVQ*w)!i0~ zfotTr4aXk)xlx*M>u**E?vHO*D)_hfWUFBQ#iz7YDE|ed@K$BJ zvQ;RS{{sJ&OHck16uuco#xuoz=^*$^|3lRMxcU=)0cF)q$73*s(hjIuPolL1P$(yWmUlFHgf-Nl&(XoDrq5Q{O2?$) zmX#!FQQ9b#3YE%sq4E?*OtD;y){EOVR85jXshD%W5s0nAlk(2i4*V$`egelpjO%0E|rU0NF^7%L8Std=^B(qR4!1UMm@_>(`WjU z&`vEnZddFNM93XGO>BG7Yo4a@=BbA{PanXYE;%jsJYAGOlXSEg^fZ-2PZwoTmwv>f zN-I|z^GY@%@&0HL{zVVY|E*!C^9`r}IrIM(jG)B)Uxd$p&i}u|lX7?O=RBJzU|

9zp0AX`4jgAl*#<~-0|S1%7= zO1f!it>Iu2c0pWcM&YD&oeAg=0gz8iFCO4Fw6pW0{$b9hgWvy|3ffHy}QSc)--&o|IoW4A|P$xsg^oAEVnK|nJp+X>Xfn2ccelL{* z=h@s0!shTM3dVRP65WWvSM~y1Rs>_+UUys90a zlS2}~t-j61xjz~$tXtI$;r!-mtVfbX1QXQMPA5X5pKr>p9p)xtS2DL`32|ii@ z{wbiSX){253aaOCEQ*OHZTOG3(pJ>I36p5*fskoP_VxAG0>6^lCjA1 z(yk2i3BSgG#&FQPhv68GNp0m36J60Je=4XFfilqF4Q|KXi4VdotX@}N)EKE?*8m0j zNT+)>9Sgo00Ws}m+gB8P#>{2Vs8A^utn`vhFFaA{2KJD@{7oi`!}C|KK#LM{Ax{_e z%ZoRMmv1g=^)FzE&wor{3NIYh=i{polo47~?al<@2iADlGaJ}PolzjkYMD5W<-q#* zU|`r2jaRi-2epev@nOIgBu#2=AF%4Ub&Z$yQb)XGDV7Px4Vb@;X=NU;jfXr7V)iN` zd&(iKF+d=s>81~)S#cw%-A$tLK&@_I%cC@>$F zl^zPr`Icmdhcxr|V2$j?5O3C=$j-(sgn`UZ7a#RTZuR1rQZoM+^U19Y<^ls{ibuv% z9*ONf_lD5l*V%K7)X^|*b-UO^BQga#$iV|p(LngNxcz=l05yT(Hvsj2H&;L;jr-jJ zZCe>DAOjBWS-dTlyl`kgV;#@>cKcy31;Di1ek;&O0Du(~tQ^{NVO-6CaWx)JM~eXI z58Kh(o%ee_AovXc3|o`b;<#+1`!_wsX(2wZ{tm32-j;Ozf+5z)at+G>SeQkFwqcRP zZH;fBdDm-)XruX}jlFNSwHLPrwq-^VP(Cqp_Kv{~VpERUdd8ku+&~M-*t9Z?uJ7Y6 z?jqoaD4w~m7dLL);y2y#WV&c++gxJcP24lPXlvlx5S-9v;5fWxdju{iCCr)N#!+tu zIK6)~6G(3`7-}dE5V6t2Rs!Ef9|*A}=t`>0Kt%6R8feVgrxb7y8UJ3Vfyn}Z(zhy? zmTcSV5|RO(=(F<{kl$6YHyCTjI=L z(X=Fm#}QX2oswhXIogXtT4&-BNWid{(fj27=W7cOy;0J*to?L}Rb)0$+tw3u;ztuiS{qpD6jf)y>-{DpeF>z)bT}^x87*E24JsP@EJ1<9Z zMB&}THftFcpd*})5yE`%nbBr#l!;CzfxB1>|*AZ0X|WH3GqD2xk0DvWfUQpJs>W zuYV5Y{xt$@4M#*W0H}=8hh*3fNLP$O%UDiw$m}PT`VWT0&DaYVM(~(~@?iL2I8uI# zqa@JK0rUajc%LAV5CdXU-k5CFmM|^G$wZuBNtP613*J|jrdw}WAxy-EyRR$=8CBFS zTRlB_ai+G{aUnn(wK())c8G;1*|67E8%gS1zQuF|r}3&<{|7PMF+f9ACxrROkR^P3 zTC5p{Yr6@1NnrJp|Df&4Y!L%4X0vzDhq{&=#>d_HMjMJ3wbS#%Dk-eBv&)N<#cjjp z^NqAs;%8oexeC%asV!!Ox|mb?BI!AuXdDe%QUjFRhZ;_N-ygK^3?->MXh(ObuneV% zkQamuz|}Zl3D=G7eMl5PV#kMO80vk25-7v1Y0uREk^phSu>cy%n!J3>)Lp0#1Esq# z)r^m*xdh4=Comxkg@z!Io7q?FN4;YvPytEeHswKHUtg8WY=gr^qk3R+z9ts-XEPr5 zrl4}lPF%<1$VN*PdK%o($whHngDV=~-kiOu*Nzrxtp*1jWP(#}D4z)quq##6C*?x+ z1=yM3whVA3*0S=#%)TggW$kEFQ0@MF?9fk0Kr22m!0jxATmsxb&o2ZH1?7~6;Gl~h z+*km2dVVIIwMr(V01+Mx?)Bk?(b$s7D6+Ay57)_+8f{<;fHNCg_BD1kJQtkVSd;Hm zV;=zS+yYlNyW&Ot^{$3F97HQIUr@rQ&?QAJa8L#i6yvN=F1p~176%GN^cJKr7daO@ zD0BW=a&nQ5!Oq6_Y+g<2Ar zM|>*YEo_xsaPV=?NW;nE8>nBWCug|PX zN>yMO5%2pOLXTqoN?gXHEQ=3bt#msbs0b}n805L2D3Oj7nI{87)5}Wxq@^;NCN0xi zL|-I+WbvkvrA(%OkKKQeyYB?JlCI!lI-DhGVD_jA9ee+ zgAg0Y#8Z;xBFF8(E>yp)8l}prk2zeBombd~#8Z)Z$I(?cwr=H4;B{0xmc_ObcvX_b+TKF1&P}e`k%h$G&#Ek|G8zeiC(DzBali z;OPoIQE|cN?;EHB`R3$M6{;i%?&YAGjoFrD1&~b9SS-#wG^m+0*iO*EES}(4n9yIz zqEB3o9ff0<0Vd8tfy2h}N$pfC`^6nm4(EEhXW6pxK>h<*#r{L*F9;h^W~156po2(e zBZ41J9j5qzGDTIUBg=H$GBt~1i?kdg`n6}VEBW9VrOJWc*O7Z`=CDK6z{p}0qBSoM&w}E3okDE3D7idXy9FheR;e3m&*`Hq>oSz1l)dT2>&sMj-nb!m2clPR( zD8Hkq6`ZNfHr%WYTNAWLcG3S>OeG2C0Zx-}ij@W6_*wAizu*xMsZ&E80hjkh;59*J;AUsTF)nHck)6EmpZGMZ8RCb z)y^ciy>QDTbO?m$h4)yKrPG>_T^p->1`WCu$J&|41aa0?XfyJwYhl$;;uc=`X+Tk) z1#?dgYaj{ZDBr_9z;of_F76IX6KNWuOoUK^nTKyJ$+i#-z#W+0yT=ac8|J3CsqQl? zYe0>`hG1_q3vTzjS+I+X?~Po{n@+9`#k59F!FI`<{Nd|wwO+7|lvrCz{p;{1GPYMW zx$q=}|6yRV1R7lEL>&~krznI%+1Ut!bG(J=wi`!zmE8|aI!_Qb&KZm-9Khdr5m)qY zwy-$^^^x?!q}g8ZnW5t)R}^Q`p1od7DejKoZmjLxHl(B4!5h#P*Ar(S1th5!w4>(q zicVYzkPaNNt?wS9TbG(H#AxEtk-lp-D;h}&z(aJdUxK`Tp&6u>o3l>t5 z4K?OcFRKmi#XcD_J?P-P3FuO<<%(8`}y)<)? z=#)?k%wo|jF@J#xh{^sgmTbg~IGVnGe&PgvQ{HUId)QX!z*r z5mdx$iC?$HYnfkn;PstneE~TtIlh}y6xia|l6c+b*Gldi_$X3e;4Fq>NP8-x2HxiY z1Ai<-oiz?F(QT$d>p^0x;uA{`vA+g|?Ly*n(I{OmB)^x;?{@iv%lgaXOZ~lK6|TQL zF+Y}!Y4ZR%i9S)pfh z6QsMa;GymA=f&jAx05)m_P`>aty)XMzO)2Cmt0fIU1Jhn*=}Z#9V30`(a4ON4cTG4 zxNEw~p6zHHTOw!*w0KRpz27z1L!ajRRxcDvlC$0DFUjX7G(u1?FD5#9astYIqB`P# z?cs}T-Cd(&ow^XalJ0&Rm+p7t)}Fs%$-Y8Oy2B$pkAxvAZ8Vz#8>WIrBXL+loRjFZ z1QGr!+po(+gSOovY_Y@+7=`g9X!eG!4`kDq6p&pBQ1=!=9vBt~IzmJ$Y$x5Y@K5#y zWqQko*Y|sNt>O57Z&@d3&H{AAwH3$StvOWKRxI-&oFB-T(V3=9p!`0+k4gj|?>Nv~h{F5x+^1upoj%73D z1WW9;A3NGQCGzvD8fyQxMce#}oAgC(yq5#DEDmCYO2_uH!t5#z1Z0rw zRrSQ&n9Vf$VRw+B#Sk{JacD!xG+GT<_!SDqNu8`Tkah>W#T;*3b0|eU3LBR{o?o22 zFyKsXhU4y)c^nBdXk;J5Z7i4xr0bgrxK&}k^HI1RqXHwj zxQ$ogJuPr;AG#x1G5#!WnIGA6g75QtSD}zN>jvl_5R$LO;yjwms?h$ss z8R>j*uu$Nu1(#1tPO0xtOTl_@iuWx>t-Ix$aBRSZ^WJWjb-&>Ic-#8k zi3M+nb~X`wCl+i#x9Exn%HGr;ZuJK<{nja|}ola@rDY|e<^UfS+lxB?A=3O!ohSoA(%}%YO5u0p)@%3)jSH=Y19}!|O_{}$e z(MLubx`QT-d;E2azkDTnlm&ib98?l4->dlLKI(I}yM?kv^YSgzYLG7~y$UIU13IBZ zZMv>B4-)}fB>Pje=+OyI8Hx!iXfnRZhS_)sxiT-ClFaG(AY(5I* z@yPjrWjtw^uhkzV(gm) zRD@!QZ!OHx!t|F)zpTr@80N&>807TKFFDTnWsr;GX4-~h&SR# z?ksq1t9o^ow#?%s>UT&OdrFRdCC7Hj)5`903s3WlcG2(C3jbXt^!cax9rqWC%ga4_ z`JTSy#b4<0U-}~n4SzBa`XzJp@GVhpjBcy&4-yFS&}&bHX@=akbjDCNHl zRge5K5cL-Ecf`L-@LSBuo#TIQ_$H{!on_-8rj4TmF#zmo@|HY-% z6cR_1A&UU`HBi*RHzafj54~IosnY>L#Q%c4nq-S4wCyC40MrLedGagyVHa=qqp|Oq8*gdOh^wk=*J5_ZsO;x~HR z!J1$Z!2im^@HUl1qT*B4(z1G`HsUrC{27S9y>?5_H=RK|k*~xc)*F0`Z#Cxp%F|cJ z{$zdu`Y=l z&eORI`~0KVF3KOh(nSA^=(&w={+FBZw2(p_Iby6=^EvhIu~;XwQf)z7;L zdX|dhaU@HDh6g>&zd`*|zcGu3I}*9$U&jJO44H?#-0X}8?e0LP!?YQxEc`=dY+Z{V zVN?7->k|FA4S_3`oAGTp;>r7tHRYC^%<&ypdCDL}DW)lfQ!K+w0hMsE=2ehHk_}8G z+VDi81F}1~>5ZT`x(cunTuAeKK6TBj$$$zPbL(zw8+CH}U>U#^0*8T!jLwZ(f|yoX_1 z{N>@&YTokS+qV46!=cswRb-gR921#k(v!{M6j)*3L}EoYDa#)mD6fmEBmNl2T;p|* z-)RKl4`s34Tn&Eu>8IV`IvlhyChIurbnn>h&yyCQMikH=iBJ&9Z5mrfgr4xP43+?J@{ zXMzJ8wIvtz`(>S`*sb3$89Dp?im`%{Xb^lc-_0P(~~MifLMrQY?ziD3Rw++?POpSObgG4s@L3R9x!%(l!1KYOw@ zA`O3WT8wf@fD2^__<1YF#ZbVD;ip*HHsg*l+QoK6Gah>qC!+5R;x#9Rp8e56*Zj@2dR#>T(A>DZE={IG~ zmiBJ_qH}fbNE<5(GZ!bZN``4Ik;b6EFB-KPFZlb9-r@Z7nf2iQe>@4Bf871=u%syb zdH?$#^?-(g2Zw`3(CxoIDYVBQ8DA8xdUpx6BddK4@(r|l@n5EgAb zV0v1u;}Jv*0Lj%N5O&Xs zdGe?K&+qc!8Fh-sFzf_J2S3SU={W9UaoeUC{`c`D>TlrGemET6kGogblOTJT3yM#7 zcJlD=(0+eN}?`=B4E-9mTWk|7L3J} zpgBPM9+cOKE;@q}y1{LEv*s{uNpRck^>B|HM0ID{qcHN2Ir!(v<;(LomqGRH z=ir~!i;L>n<_2A_60Vj?XWGYJibCPY&OlRxg6rZ!TV+*K06O)FU;GFbQT-8@aAOq&Oavu-l87 z20uej$ADw6%|SZGQ7fXuz+r&#_~-YgLHr;jpEPWAlKJ-N4q}P{f_#e6|6!uqI6XOl zmYj5OZUM?31*ufAqYsmeoia~#i z#r0yj@FX9+saM4`OR*%nu?}pHKdAeW!8+q%KRCR<8cbsVJQ@whlMNL$D|pcxHh~N> z5Fo}y!Jr9AF;*|Wxr`p>WOyzdjz0|BW7bvxU0Ath=*^3- zxM^@*URA5&Ez-3R0Q^S^t%7YqD@EPBuqAeMhG3C zM{)s9AHu6>R+BPy4lr21?`Kl#uU|?w*ai&fP2g})uYVy5{u)mYWsNXVW#~=Rct#!A z3GgsUFa`k##TH^X9Ex2gI31XS;)f}<eMbs@urHr>T2wsP1)hGCM%@K&k zjoDU%Gxma$m3|O^h+z7_qJ9KkA7b@o9CWV_Wy95ZHxY+vHwYjDO1wCq$G!PDj}-xF zTQGRq;>NT$J&-wf!H<=V!iKl5GoWpqs>4A;Z=%M`*)TY&UjnH|e0A1+f0yW+5AuaP zMiIyZkwNU^-7ycW^!!!zHC2i{O>eT9(Jif8SU}c?J>V+jk`ow8IFLRJhPT13m@qNW zQ_O>n2N&nTp@nD&$t&hl3R*MnlaNoL`}x7&2`OYc`2BmM^m-V_-6n7l#U|&Q>V*!1 z>PBDOuq^J}l3YxetAoxo?L}$LdVNXFYGJcpUy5d3xZ!5aA(}jAngaVm4AcrT>xCYt zuMnYdy(9wsFyhkz$+$yM|IopE2*V-{?*;8Jq!18LPM1HVjLi~_jS4a={1&yH8t0^u zB*sPL8(L~pv?gOLB4O1)wI`g};;D|IJqZnDUwRXW)S;JvKk_tS=oTD}h7Zz_28FWq zC>0joiZdJ3fd+;AdtiZ@4pyK%D6Xw&9ajoLb3DAo%O$ZiHuHxcf+L5US)qz>s~l7$ zpOoVmu0XuZC`83hkJZyRHH32hW9{O!`npbqbBQ3UIULF?XRY($$D7+raZNtZ*H3vJYZgUHK> zbUbwo)-fUJwP3 zGoS0mz5F(9|EpG5%6l-n{;t` zVib*e`r!p-UuIA+XiY45j^U7#H7}AR{y+vfjnRESx-_vRmqS3JsE?+H)yu<|L{yZI z^d<$7icAK*#|P&lzR|;^tctEmLsCUEOOwW83fjgVtf#1oEcy{1qWt?ZrcV|Ck6Q9=FC_?vOO) zS2Yc(>oAiKFfb;CGaLlcLM!DQs?ab|V1+R;F5z%8z`VoeFLEL+UTsQhR$o|!ATJ9_N zH{-$`E-`tn;-CAJDYKJR7(}z5v*$Q##S@Ibbxk@vt&5$ka{7v~*&+Y7c_w8wA^0Jr z^@Qe!8b>=%asuf6B%sy038w(j5g=YCSb1}dVK7kwj?r|YtS_Kuz@iL#JdJs1l4C(> z@{QyVLt;LVm1Z(gO)^o4OjI+NsM@22>Le0knrQj3)hb16AmGRq^yV9Kz37fEw4k^& zs&Q>YIfb5QQ$lnT(E`&d600&drZ(fSF!8s1As&}DVY^<*sIdq*M2m^I+m3YJV0DBx zyLPlnX&_k+E~5T;AT#;pQ!b2;LV0MjYPNka&2B6}q=@LjVpv5^_DZ7y- ztO$S1!`K-#dZ>&>Q8*SiSV9l-VBkU%3#Bw>`iU8}MU48B;!~yR#;u`-14C5~51<`$|mgybzy?yB1QoG-a_VnJc2zromh^&`4^v zQHb|JuaJOdnub!QoWt{1Br+qKa`4R{$%AVl5sy3!ogob3L_9${f}cxc2ZajB76%o9 zL>2=m@ihXuT}^e<%!g(tw0*^>dtJj4Zz2q0s9wydn|LwW5p_#uyreON3yKw13rR@< zOkPmyc;|`N3umxuItb%PUlt+;5-qyM#I`i7VOV_Ny^syO0O6-sHL|gAwDDMkf>O3M zsCE*Jfv7`r_Cv4RNLge=gmOkk=&8ruyXi=bUj6_Y_=n&&>H!fWv5-j`stzzB5z^oo zS&mdWbTT9gSZ784v2Pp2du0`@&a$zWSxew@vxr)t~S5P~_X8eDErj?Ffdx ziZ0I6n-B(M;}Frh)|p}C0A!g@R(ER_wgxkoOq&C0XD^Tvod~A@cmaI=myE3)HqqhN z5MOx|lkgMQX`HyRjDgc=x%#Sld2#a7@>1iW&+^j8pil_bgW@qUDDr;0c_&s_%z;Zw zA2HjBP`+BgrEy-x^ltJRA77!**_aJ!AD0Da5#IeHUglXnsAFO!5b>)%;-#0!0bB## zN%N7u!0$5u#^fy{`H4(s_&b3JRRzDR!O7Xt1*RSb#~`q4{|8es*0KQq)PQpkV9L>w zD0?gb77Kw$DwYD2BA8YQ>NSd&^%1WFg5Q@6uvnCN%lNjXiawFhb};u5Csy(I0j3_} zuOB(JhI^G~Cuc7h;!_ENG9D?2$Iv1M`oIn*ut(@}qN2u;6$ZNv=#2_D38n!FIBr*| z5a1>j)m$nCv_pi+mEicz86#8zI^YI}D6kXI<^z4H2Dlf1sfPmlQjN2f3&CrdRxSl( zM91VxK&EX<-WFMRg7bsFi>y^lI1J8TUy1|)uTlsuB%YO0@Cqt~AJAKTr4alE?&25D zkKBT_m!Bp%gLP!o7mD>CXS{1%X^5>gc*RVAdVfOH`7I6yoOBpwH%^nomWfTa&)=>t*v z5a>Y)JER=~9zPKphd>V0@hDXQI+TD85zwIobSMBFNi>cSjU$Q1ktls6OCMqBBU$=L zl&%3YOEhZGEkgLzfE@Ufk_DvN4yBz^8Um|HU^M~kSfX-_s2odFjs<{YiOMmSK9;4A zYXMF}m}l*QA@A0fgH=6hNUK7l3>peI@RJ&P>Jyo$@!L1@Q)BcY_@~C?8qVdv<$tY5m(N>6=DBSDnP1xvx?!8A^A+1bl)!gD$ zSGT;gZHCW>++;+^hNFBhj3+r*)CT)OHp{?rkF%7T3)Ub_1U03UwQ}z9zsorj5O67i zL3DDk1{wux07#UfL@tvLR-V= zBtuHK*&S|BU|LBUL6o4;xEf4b4MihG%^$0c)06ro?y$i4K9c^Zf3)|h82^CfA2$Ar zg(q7{|Ih6|$N%r~nByN<(;5GqqLSzypKSJK*lokuD&!RRHyZVm|EM+S#)1Zg*l7Uo z>#zUBiv{H8TO9fJ_t%#fM<>U}GRJ5#hN01E7~_Yn-eL&n**u#Q1G@o2<#ARH`9f~} zIe(_Xj2Azlb+0|-jjU$W!mT&77G1$OZUv={B93(sB!+ik7~F>UWE70}P%*4y;|Q$+ zP;Q012l1a3@~fwkaIgJOWTzCj&x449>FxTA3SPPrhG8SbImzlek9(bHU>Cz%anjI@PZJ?Am2;~qIm_~m^}_i zfNm7rALFZ5UaTxu;pIkl3{0ZvObi_u?}@|KlOVf_{hq^;IZm~&OuGqtd&WszKo%w2 zAiB+p?ATS`#W~}e-;QV{@Le<>qlXDi+-Tx$jUze%2h5EZr(@6M^!>QeT^HluaKa}Q z3*gn8`ekrX3l6KNr?n#(Djht_fG0al=f&Zey$kU2N#hn?#1{0N257ndG3IQ}hW*W4@f;bmnwJW`i< zF)Qwl%bigUNZh;MFlmFOI0Lp5`4ZSLYwkH;TZ|7P<&T!}vmTuPyS;UgncrmUr)T#3Unx{7 ziTMAO!k_1Vf0u{n|KRZC)S0Sj{sy^&pE-*@_1DS;CD7Y~X)C^Tm8c0dIVtx zp_AwIMB^WDRL>8Zpjc=0G&T2d3db{eGY;TU`Q#zI?I&BoE4<0QdIOz$81{jC+gFi1 zbyt4M2kw^Tfji^s_8Vv*xnAmvvJ4yN*+Ju?_QJkYr%WJ1?Wn+0DK!dx&Cml0y@K#+ z`6%9?-E8q9!xNJ$0=tBhqX7~7N>B{XdEq;5uy>(1vUqCo>ZSzqDGg-46CF>Ck=u0~ zPy5307Io%HZo_QA1>Q%B?NXH}SogT{G`y>B;Z?n1V|O|qLd@e)?$$+AsrO`y=wh?MmAs#tvA2M^ z#ZTSh+)q^8Et;h@tu$@rTu{djDA`kq`uQSdaha5Hx#37U?y4aSB0B6%Lm~FZIOx&# zIBqkb%}rVV$=Q#!i%UG5dDsA?1Y8{%q51$Nst?L+EhHElLBOS)Krq z>NLgWVfQNGKW^bc2=GPVj7OtdNAoN*sc;=eqboVu;B6h2B*gn%(G(n1r~uJgTsTgF z*HP7{dp*z<*$?8BFOFp}!A>H*dV2EW4APg)!9`Jo(HjY!|BP)JaWmfwJhFQzKL4gx zlUTfgMfc=LWk6&}&I(c-;X;mPPJBPaja%ZJPZm^S{Lgymz{_w%LR+5~iY>8ta@sh5 z-FSUbJ3jddeY0vJR?5lg`RhXp)$p6jd;U7h$13RpPta1haPZf^vNz#Atk(_G3Ml_v zd5q>25jy4kH4SB6m3Mm$kpq{QZ&`Gt*7kOQ0Czx$zZvjt!Ad@xY&5?LuXgh^khr^% zU6-Y+?AW?69QQR3s`VPs@`B^gh|?46!NdVS{HYwYmfg zrqz#zKR*ijpp}M2_W@YY@R*B5;qKAhJUnDfPO{=*80Tmbxt#&UQP4LgLo6-^aC6!b z2I6U_!Sh^#>x>6;!aPRz-YfTrF@RIdhM>goso(d5)i@9Tg`7YIprYd2($@BSk!FCJ z03c~%LQ^KN-jA2GNy>SfM(Tl)Jng(KpcGztS6ISsfJw5N)VEgH+CF$#FHrBfaf*gPUcRKR7=> zO_pyChrI>M|9n|Xmd8!d#md)To?l#g0Tj0vgHStr^J>>hfpv_XaC(0B!dpkVv{)Ud zsSvg+i$S0zR1yLyx{G4LYM9eBGcf^KVJ89Z&SO2yWLVmp<0$;#^cbnA8c;MI569Vz zp(Nwb=a9VZ;69pUX2V0}PD8_ugZRGRz{5OQWnRuraF$h-1J|4!Um9Q?f#S3&UVjdf zLP&?bc@)TGO@!kR5n6vfAWc)I!V(|PC&I_?_Q^NHoW%VI74!1qXne`RTS#b8={>7( z3Sv~w&dJz?E_#GP2l2~UX|r0L56otNnoFgenVpz+Fl+#g?aqZ&$(QymAuzi4(lE1X zVu4MTb3jUy6A%(yu?Q7 zUc~1h@FiFk3Ik-ssnk}reWLU#+_4N+#w)zE z68#z9=++wBWyqP;PE;NZzbJAG3z?WA*e^wf+yG2DZe< z)<##POhk$-PC`Z(KZWwvat22Lb^y)6ht;H*gbYy4^L@20baMzq)^(1(#CHv)fbLuH z^Vxn-@j=pjBbFMc-m|0X94P(fYQKNDXBoe zh(OSB--tj6`Ku5J04+u!J-=zZC4(NGpVcpYs5`d|Tv7C}SniF_!mECKiZNZxdDYh} z#3I`mpAEc&ZLxu-h1q&h zOS7E?*z6GSY`iLxEQ5cby8<7_rNQZ1fII?crg-`G^WVd#r|MUmpQ>MFf_nJ;@s(PD zkUnn)@pEuns={`;PePHyyBv&z^r+I|*%qmxYlV(7{$3iL?1)s3ozJbaI91Z7bse=n z1ShAsgCHmoNBt0Eb)=2;8GK>$MEx>N=~{4X6M#jAcG@_er(jtkseYNNTrI3vxdcd4 zsum`IUzz&kvho57)O>mF)@>_H-Wg<;qGVz0P&%O^Ev6jJ1-Y|0$kT5CGpPl609qQ* z9Dp9R#0RnDK%84Zl3vR|+9b5Lkqvu5>i#mXp=tk^Pd8dS%&V=uy}v9)Wo!MpN&}In z_n!qibZ1V|oj^GA@YNgHo5^s*wnX~T%54O7?WKeDaG;3+Ug$Hzcq}%;1lC2^+#HiN z`1*ycW9INm8eX+$0#79=hS{b)Ki>vSx;9yAwXoY8pL8&b42@(5X(thhsoGT3%Bao7Y@rD@(A;rNYr z0Pp*IGdRNBus7WIsiSddY4pgQV=}aGk>s6A#t9=wQJ#br<|E(+##0)$17Qz+1Y@Tc zfSwdyMQw+s-txcc?Rlkog#(J8GYp#11f?6s2o`AjJ8`2Q-mxqYwoc*2Hgl(VgTh$F zWM9Q-bQ}5R+4>&sN75>B8Cp1m7f-w zNH{O94X_ECMEJJ0W)55B7iT)$31q~cSXR-LccpT^EwZVDvgnHjPCr@ta08hCyZ-a5 z#_>rFb;4;rxsa1<6fLmnIFz}YV>cm9+C-zS7{G>v;Y7=G$I@#qYL~M{f%1=WDh+w- z12=htUf7I!@|fJ!Fa41%&x9%@cR{$?g9~#@zzY^HL2auUSG5Y@^M(w`Nm+@bqyzC) zkJ{QfRvh{&rqinwsA;7;fW<5B0}XB>(C+w4>hw*mp2U+ZpLD)q)otReZgD@VWh`#> zob4`et;NWz*Y2i|&^9)@!GB_H2IsMJMawFH8<>~p|7g_y&#uLJ2uTp6_J8a(lCimM zfjFzBf;g)+-kdE4<@7QY%IW2TAkq;ztt|%PMLHHQ7R2I3IutJMgqa6MFVJy5kTRpi!h$j+SL}a(^*Z?YF)&_F93}VhWAwj;Jl4e(rfy4W zGz`Wf%`Y&nJXYQAAVzT@1|Ul+irIn(a$K7a#;AF$#;V6#bIP;XnZOgI8~#Nr5?h6i6;_W<)x>W z@+kCu>lF#bogYEJsRipip-htfVXZ�q%p$*FCi4xKc+1H9L4IKnTY?L4bek8~Z! zQalYLj%x(gvROV59dodu@89?TfVRL2I zhWGmDC#0_ikNSj1F`1k9ya_va@^g?IfDp z8S!dtqFO4h`7xJ#I^qelbusMy#o3vT72@A|k+%{Yv zPX|UwHb@d-+H~wLSWL5k7G`HN@R;7?`0o-1>3{6wjQ`TN8virmKUPYGC&}?&`E&gL z9*;hwF9&(Xi1!_Vfe#+yqgviO7JiZbi<6EGpp%E>Y}gc**58(sHdZQ( z!D{vr-!y&J_L3#Z?+`hJqI2f4=YcWc$I9A@$CunsIS;UP8`%060BZuUkbpG_-WLH2 zgH;=|)z1T_JHuC&w%CJBlV!cwv`kDk(=eHh%_o1ShI0{Y0)pW}2nxD?HiB+SI**!G zF8T0?u?30w?H5Nl*mcUyfP}8JV2o5D4##-Yl#o+O7-FH|Sx~l)eF|M|8i!ZWZty7H zmGL@7)Rc{l4Nshn%;lJZp(E900WurNSS#|z>Yx%d!?@eh7P@$Y9Ci@tw}tnnyQU|4 zDsGMyrQ%4n0A11WL&Zn3xNHUI*%v-RLXL747IRwWu!tOi2<$#X!nh(5yNb)Kt-ZHu z?Y_5h)N>3T{ZPoFHz)FBAs?v!uLLWGB?L0LLYam3zMe$8NwF*&`=}i}Y6bA`zI1}} zal1M9bl>OooCYs*^TSM*cT!4bmubG$tV-#wy+-1E(jN`uxZCVGk#p_g`03BJ!5{ZH z`hWQk(EkftPm=N9D}Tm+{av2aMLq`uH@w0{fb*0=Z0!on2x`8-+!h#<+hEU~&q_1q zGpHpP_~x&}VSj{CW(P1$9e10=thd-T^qTZ!J7aumOZsk6q|VyfGHDHy*7eZ;eAuw zGZT2rw1{so&utWbP`9|o!ws_sEPNYNJRmU>Ye9GWB(@Cg2t7{yCww-IP|PFQ6~fDO z_`&isC6D*lDh4p=N8AssjTVsKjOQpVNsv5&CT5{t5qx?z_jqJSYQv=}o*CK?R+=k# z0!qAeRy=29@ajci_jbUyH_=aZxYNwbiTmlCi)0%ZXi&@PL@j5ctq%I>WU}y031g?w z+~o}=d;RsyM&N9`42{SFEj)v!#Gc&Tx3@ZJg0RVhtGjIigqjcI$P`h+);lJUbChp8xz zb_>6bFc?I)ICFhV-*eRgF?T|uneETZVM z8Z>ni-?-tDhull+D>-i$tiGhTu$LTI9=t)+35@R4>KU@6{v<{^cm{z$2h8TUa9Du zPQkx^^=>pCwinUvSf68vIzv>FF;Zs8HuTHb+p|upBxI$KS>NrWhZdbq=a)_M~($0;l8C?%p&A`P~Ggi#9=yE-@v@k$*+wVaC3Fn-naxenxJ_MA`h}YVWLDR)}Q={Q+H1164Zu>!SMaQ$*%!*v;V$+OTA)2pl zBM}RDIOyGzW-Rqiwy+x7jwkHMcd|{;{O`m#_bZd<|8UD2Yu2w0B^`*XF~%;UiLG|T%NYQc`|#ls+MwW85PS%QS=P<95LyBGJRq!}_4-?GN7P{3h_ zcdt;Y#L};d&kW%`f8-E|dHTHyBOsf|mqiEhv1CXl(hr+(ysAC{;~bbjGn8 zF=w)0L>ODbTglo_3A;M{O~RBw3@N^6K^0=taQBJqNf$B!-()i~s*tm79ifQfbLA{q z6uVK#&3F{HXlv<^DHY?gbQ*IXg+z-f-eQc-Pzbg^ZCwZbs6WI@kkAZ=G6uiP(gR`i zpI~b2-cyLJ8br6ecrH5BMM4Q%932LT*_i8f_LdJF%(_NrcXh|o)MFT@*O^vdv3_== zv->TTc;mOSLjb|T9?XR8do{X!0#!E0Co2RC>kUh3lZ{tg*eTBPL13*?1sQ3&dVu+M z9O+woaYM^65XT&8kX_(?B8uy%-yt;=&jLSVHEO3?C$~(9%5K&UvxHO=&?L6Q7Aa7VyGO;SXGw zvklb2DM~-2Yvm>;!S{k#sy};t>s-+~l33(B{ct}*cZiN{YT1%NL=2n1U<_rtme&b= z7kh@AOgAlC3I2m-021}u;pNFWWwBY%d+`dF!KMmA$8WJ7=XBs`ih>)j{%t@*N?D*H zWY0^>7qbi>l<}H`Xkhh+H&Jr`XM)!}H@fX;Fu|HZE7Zo&_cX0Gz4u6hYyQ>Y%j%w={9H z5N5D0QIZx_YK`YiV8t3C+-PvKouElfJoPS-91Y_uvz9qW6&oQxX zB61q(kAS^!Hr0rF6bC3v;vWMIQ%0b}z$^ZoY}S6Dch(o^4}3z)F}};)8eFUA6Ki$1 z+a-YXuIGx-oC%|lZi;8ED3OI zzk@ZXwg4v!+0@weM+HU3*r)IMvu}?MdHUC>*+iFENsA0VQ@RQngu;!ZOZhxGR9k2H zX-M*7HwsHVxp}xX)97i)61TxWp??}CI{YRXy82`TPUI&+ce;4!D&McxDorz;I z0mCuR`6%Pvx3YM*d2g<{g~TuppY!e7FwQlzS>Y#NhN!?Cv zK&$9gGy-|(=u0fe<>OzLn?3R{CZiIB@{IdKk&CcW;G;y9_{=oxcuWTFlV(Dgg={e$ z+!fS!lLEr4hO2@!T8i5#pi5K6dd?&nACTlHdar zNN)Pi);-diZ&Wgy0I~|ooI(PF3^LmSL`We-k{A{W&x4&5$3Je(jvxKm6v8KsO87A0 z=M!p{XWRS<)8OC&hNgg8eLPDUiXsEfn>(qwN=B~Yc51e=k*!oo%~tV*_Ax$h&HlVS z`|}geXNsIb$w3#GigUy7Wb6!?`xnmr3*;sV7kI)S$>%C-RR7ES2XyCr$u=Bcr3p6W z9Zp{EgZYxmy)i|smgEKkp2Kw*Y4*AjAGu^igIStH3n!DPKboMadjr~|oL*yhFnc_a zLdL{u5BJNU7$Z$&$IGoKe65AC1*FwF>ueK@gL_0_h45xv%us1;NQxW>*u7U zPe~U>WwM}c2oFWWxYg~Zr2i|8v3cpGtu+q$IDnBb_c&cLaV;fg3(PdXK1%TIwOjr2 zBE`8|Xmi~5)CC$obJvUb2u?ThB~>ehpJmEH8k0*qPitxZ?C{kWj>?gZEbUM-rpUUH zj&Ec>X|vv!&6&nFvC}6hfELmNKFwriwC{OXREv1Lpt*D+4G15 zN#U2az?S;-9(j!zggHGqs~y*BM@XHeCBO7uTJnK)M1u@#z*p8~2R~#s9>tH^nO*#w z$t8R>i((Tjd5pm{E|b+)n1s`MK%2O*G-gUw1f- zjltn)Dv3>xSq&mhB+-skJ#H`zBm%0p#!)94M}t;!Wj1TW#6uCeMe8E7H<##EQ@u1y zxEYEDO$Q$a!`p#(3upxd-HOjC-5m?=JqgRko)X<@$eXW*m&&BoYRDW7x*>BA`gXV5 zL+tR;c-Vq9p6!!}7Z!l%`z!Qdfs*ki=&=Z&JBfp^iN}07pBhSf?6HOg9Cd=XpMZ*G z=pz)#YaIRh)||Mw)&?x?;1E2uA)BcPxkaCHUO|9+R_yg2;WWOqH;0{ z)jS5s#(TjiRPKred`qs(2!G5*)yMDUO`0ZHj-;qF`64OGyuUzR3WO`#;tPhW2!bwc z02Q*La!sK=_Z9JAdFU;L53OhDn9U-F3<*(V#c?R@y4`jI@ZBIytbMZRuHpmBMtcZE zzCeL)o?D^1WiNX}n|o&`gAK4?54RYm-nOvn=(-jm0SW6v0CAMo_`eOkCOaR*1oI5M-E^7# zb@ifN;~Y4l9G<^=RXe*BP8`@JrYP2JzTP;Nf$Gu(x&-P*S%VoxM!+lMyjd(R|)&b=FDr;zM^CrB1f8yW(mP&=q*- z*gQV%^n&dlhV$l}^XY(~Q;ByKKu0WhSDa*$&&W%uoiOK+rE%979=P{5iRbJ^%@`&R z?WU>MM8vcs@ktUg27V(`ng;G6jfXsl<-UJGlw`wM)y=m{CYn~X+m@FeZpjtv{PraA z$Ep~%QOz80XngcFRCG$kanhT=&bKjSQZg|O+&O-ipa*?7?g(CX3^+8h)>+r4~kQ6oV`F!Kku}S@b#D=v{F_E?Bs~J9x1zqZRL;f`W9YrjdJ)B zG{1vAIneYu2~@aDF%S<~>d=Cn@8YD8FRe-MUWy>-RA3f;9DrLufo_D<%7K&mV# z$nkI2p1>$sMS`o0hPj-H^^<#avy+oDodWcPtaFY-x{?QDvc)pi2`D}=WU^PSR!|Pm z-y2pyZG^_b0CF2r%&ZqhoGxCrZUh&c4ugJmG{QeLs>05MW4$2^qgHzcAZX(ss?U$o^U`U^!2^s153tF-zcdJYZwvVKzhi7YO2 z;gH-X4E9W2LGZof}=l$-c&bWMsL(bTXPw;+bdK@HylIbWr7V(xB;CrE~|F zV2 zh!e*~fo50Wto7$NlO$4@K8~&um)hylblJMdmh5hl?+l!dVv|2f_4HM>{*Rovp853j z{IKddrLVw$ZoRJgZ9Q__P= zSkjEusRgCks=-*OU(FR!;&3BNG%1dJ(#4ULh8`j92)2dD$cwDx;AQW@Bwc05@ymb! zoc5~v6B(7yU)L_GXGfmHgJM9Sr&%8(;NoIWLYOlKjJnp=-n&`XpW|FR%cJ$}gFISg z$!CT=&)ZSbKg{?(~_-wW=0BbJ5&ZLK05wQSWtU)7X`W9PJhr)77u97+6_CaZA|3}EKRm?gDx0%*aXfK1=re^i zkmQv#XZZMUF|kHa^PD@0zPBd#?tqpx<`T!&RJ(aP{n{Y4Dj%TcqZB;pQQPVbo6Ts9 zAL6%X2UOif?L}QW)0s3v>s%LARSK|k8{Wrwd~Dn3c3e9m^XbBpL6~}POuMhHB9##H_@Euh=|VvoDuOsvWW&dj5ps6bXJ2*v}gNh z&x11acqBe4zS&fE;rUuF!th^bayFy7i3Jj%o*QUhrffoW`K0-QZp3QT#4L zUS`67C5N-ah8RJ@RZI4igR1|-Wp+tHJZKjxClC};kP3{kJjs9tN za}}1UjV?N^mOZ8>`ra^XTMUFJh{@Suf%X=BjAL_)Visb5S-o%Dm+x|E(Vh-%b{S(+ z;OEJO3Wp5F84z;KYVe?5zrjSz3 zV|jBFYme@luKoRYnmFbPGkI+B0W$3?yRLlG!D@_EbEqm#U);gvGX{22DF1mmA>RMj z>o(!f#`U+VW6u4bTie^7`~Ql6-v9S|JRpzIX+1bSIk-GLY`k3lt8igg2~uP=8m&=p z8smS<9N90(9A;pek%|Ue4Fc&a1%nQcEnrdSiUdiTdI3Cc|R^meF7Ay#w!Ua=7gY0}wK%+AqSTXbSJd3XK*WoDqbsDAb zI8om0ss@!4;W+5#CsBVUc*ycuHHg7v zwMYc^T!FtU8^IwcAtO58h1?bzm&X_k%kG<0F1>2_ZYLNt*GE${Di$JEg);LZRW8`4 zJSYV(N!p78by>c56J8G~As@7RJx~&4%v1QOF3|+~L3)pU%v$5_Xp&RDWb9)`48P%a zAi_;=hv74*kwtl;?Ku|i+4pup=5hJeJ*1zF*colB{__EU{Z70Ivu zE^19F@T>AD_mnw0J>@bb^7y`oE`_CsWF3E*^Mk*0nKCuf4zg_JaG$LANXs?e;{<3LhWx};0G(3G;6~Srz()2-EBi=x*75c%>GrGYcP{ zA0JB!(Qm;y(XZ1k2#kpLO4mOhsq^EY}|GfVF z&+Fg+y#9TG>)+|7gIEZ5>GGP+(_WdI9D+vIl04(6IqedE$Jcx_1#-2D#u)H&&D@aage|=O=U+U& zjB;dG0{*?iJmf6sI3$U>n6xIVDJlxbqUN;qA)2Vev$bBQTxuk5yk8|ISVeHOO9dZe zVv2@18F6iLCk6=!oAO#9dSNa^h08qIARr}JR0rTt2uaI4WJD}nYky%TS96(skS*bL z1FF^hf*8QkQr3ujS2+cZV}j`-`a@BCz~Z{{H5F-_x@$ks$NAWKh!H8|$%|U!QB1`E zLE2fZ`qL7y5ZNE*dxTGG$s@k7DV{XY>`6gg z>X!!%J`vz}fMDa*=oU<{7Rd5ENFOCAE1y;FNi6*K+Hw09iNU@`d&VIF1DY|gjWhA~ zDG>lEUq7jVO9R=sTUs1xw2vAp>3-k0hFqGpBe4{mCf0`(>@ux9A1~|-g;@a=lDxRE zYtX(+zr=+`KD;;N+~QD?B?EVg8rVL;pc;8?da#JQqmvU$VniD*a*UsBnSmXSAY;}P zGQ_%I#tL?47cHoL-jvA6COe8_Y}PC(zq6%vKM>bdnV&@bP93z<93r$2*%{g&sH^Z4 z4*qq3Vb>uv{Hs2x;fu6g_YQd>bA%|x5u%BE9ovUUl{jyPu@Pw0FFUVw&lz$FA1uws zN&#T*I(9?Gpj89!#zbR^xQQKQ2gAkBBVHoPs|XJ`6*7E zcB9UBa|NKez+@xa=5zbA)CXVyD}SoL`eKqdrSYbJpSH3z^f^*_#9XivE<@$61a{Yo zYm%ap%J5zg%0I#v$I3ki#eL#CO^hxi5p7xO(U%D*212xEf|X-o;*PIk*V?P*#V9D+-aJRHxpfJaXkD7LPq-1 zSo5olTh0X&%qNeB`@7l#o7V5tKo*sHw%toomp7$t!r=z^Y@@q>0jcgrAeSt=FVI_) zNY3NKI^!#jGCqpQva4?mH3%kfHm?ESac`8yG~K6jlxOm8bNm_ zN}$E^wrP@bxN2nE5Z`1eZw1C+S8vXaYR9g)!yOBswEKoiDc`WUfH;k;r6)2=6Pjs> zPyC5HX!#(L-}S19UV)uF>Vy_>bbpYM=kn**H8YPIGUA$A2AZag@U$IA;kb3ZfU=W5 z4D)V?inP&(4;{{L4{_ID7l~CVqpL68J}p^sa@%c1 znZ)2Hs;4X1l2LXO!_!=Vsv&xEc6^?-#i{T@@D|r=Q62v(k;$_#P6BdQ$cY@D6|ru* z)ohk_yIx6Z8ernQoV@tLkTmvE&s-|yxnl%`QJ(*oD4Yl(4+raPeMx&=(qRgFzO^8zD`j`31*o?XYRz7xKt z3OROWOg_(JG+b$)!q2m79p{S&Lc#!2I|#!5EEd;u#e@f=0*n5Dfo44GiJ|cvm57=m?#~$2f(zY z%`}>cZko=JMt;s%=I8thZ%DP+>!p6V$&j*3D7_+=oyR2N{g0zpbPBg2$BODA>9x+Q5 zgPsM1ip(ldFz?h#u@+lvQNe?}<9Axh_#$T&{QuZCp3qW)+ULKvj!sxk~9p zEOYBw%QY|99qd6hPM8fE>Kbst4^}&p0s7&&XdG29tBrEWSUV<}$dv=`6&OBJ<;p)?9(??blEsf0k; z4)7%5tfubIIi#3VTx=3iNix}wq1Q)Y9Fyyh&3ZC$Z^||{SO2S2uoShOo9omjc6Z+9 z^~l(|-k-6r;nMp84*%NpCudN)~+gwFRP+seSW9fvGkr3nYu zupHN?CSy~-v+skUWYxfCqeP0! zNJLesqb2eT8fS}3m<|nX4>P%&X1?(T>*les2ln4=h{>HHo9CSQZ2s<%@Z(~4LtjHZ zJ_HiH(Sg3WjsmjNceW)>gTC)NR>U5mr$z8`$2zl$ zFX!S{5t`dkMY#u(wwc#aCoIL-jqbV_rjWGNY3y2h4ZKsfNmY&BEfYx-z35LNOv+xV zf<9~0bQXc_?U64gwL80zGh?GOYFvXt8%2FmXPbB&eXI^dRu4{O z>-MMPzLpyC&e`Hi>{+ky-Li}9@)-i}8OgiT^NU)&cJX5^#S2pEbWKnAU%NeP&bq-8 zx$kLaw(z|7`W;B9x(y3W#aPB=--WDa~NR`*2%(i-KGy^SwtRwG^j zMZvXV82E%&WcC3KbS5Y)7I{{iIi3CL?(8{~aPv#wq1hAduQQgyx^!NVA|=%5uf&)B zZz)kmXGSNTg;qggb5X;X!ytDbhSRJ$d{wxbisL=X7cr$R2A8}({Azpxtc<=dw&Q`D z>C2euVa%~8%b8^sV<@EBS7fON^(-vHllu0I4nDnfd-#iCq8k`)h3)!2{{7YKM*Z~s zGQG|RG3bl)%h!i9@kcHK?NLkH2R7#X^8EOC0SdYGJfH%%2iTB|;ZS*JY$y-rxVVDW*ZW3s(1oiZ6Y}FyQL5RDGH6oyQ>Z zbWdI3uEKS3%ClfyrOfcz%Vt{PU}d6pT~?#RN$}_{lc$BZ569=v)mc#cgP`3aWd691 z-A0}IiT?;zF}uEcP*+{=n_1GziJ|H%mpVpGSQ2F$Q% zhq8FmhK|l>j!%AiRWstmqpK9nr;qNaw|jTN+eaHackgix3va1@tF*j8g5|T;fop7A zo`e2)uuC2Ohucr|@ITxxG#2h|r;DKM>3MP6rcF{>;Dr$|okB;AyPiwJe3}G>5hLG% z+n~4|H1PzMutbE-c-X_J9Y_%4?4<=^lh&|6)>{g2p`EqS$06zEok&1T1CVBTZ;d1h zMlJ|~Tn^9bKgsb4fA5&1!Z6gJtW|iek|>UutCi6gDbg1{8wGU;)U{dbm8MvR|8LqM8P3xP@2 zu*EqBX0_~zN0K=dF>8}aDYa$I+MYizZs%s#_Q^LY#UcXST7&+*fqB!wq-X_g`pVS$Ic#QFDsD z;#o6|54L?xJ2`1@5ot>|eF&1V%A@fO$;}B`SA%#IwjwuR!8jU)i3>UP<=G!;Dso8C}SwRuj6kZ?qwe;F^vj~TJX0_Ec$9n5{hG0>T z$EH?CJ^R0c&65Eh&9ECjgYv45m80*KeZDUpfD9ejp%NX3@Amsqy9=1~?m_Fiy23jL zhPNyzO5#ksA}5CXvLYi40_(0Rd7HSp*V|@;0j|f4B@M^*;gE^!4(KTDc`V}h*L9CL z0xY{SvGfvAV>{Dc&%7eZsR+?9k3xuGJ8rHu4^c4~kIU@Yfv_LA^q=3DWGVDtG}+8u z*zjPKRu&ffw8Mw00V&KR*^{S&%B8HkWs%pqyTN)Rj$)*&I3o^Tgez#!Zg*s2$w-tc z?&xjVNX3X(pO$BuwsB>hX2FmVz$A)Sk*^IBYcU)NdC(;ZX;2z>a{N|$&#Jh1Ez@hM zLVi#>&b%fVN3;OKTVpqIINXh|rp_r{4dsS);&hVeQRgHO3Wm%Eq-XdP(Cdry7Y8So z^}H5WfI9yE=f%mTG%uSgZ+#$07(vWa+p*(PU&sfQymO3Ap8(Gan)q~SoLyp3fP+JTnAC$fEtbm#yqG%-45%f)M9Q}M&eRXmO zQj4w&$s@Uu?J>BobWr6GdRmS9CEmdB=2`r{KE^ z(7khp82!!liF?NhWCQeFXeeC=i}H2_wSX0Q0-yXo`E)JCJ%pyUy12iKhHJbCHl~|k zX{JMSyyx&A3Jb!@o^`xy5+P9s!dfK`$$Jj)8z=SW05Ws}J(JCKPV()%`Wytc-e?Ru z_C#P-(zAjd!LfO16P{Z(dQKV+$i;;HpE)psIC=&{Sze`!CI`G&%v=^3(a}7j+_@BG4J#rPJJW+T=W7nd z4J&&$!rd!UE0Iyp*%6Yro31)H_##We;2Zai-CNBuuukG=j3JIXS~PRe??+MdF2z8( z0AxU$zt~P&Vl)vFxXif=%QlKuD)q!`E-zJpykG6vInep2nG>>j!FK zfQy1c-gd=Lc&&OCP3GO?_VI566SYE2LB+=+shQ11jy&GYoj^#;UZN(Kr#f0CuL@ZR zzBs?6g`E^TVwveRE;K|2uaUtF)gt1zEV8|k=ET~SMs<@4hPNqYeCVmdxrYk%nZobX znL>NC;1yWif$57$#~{_ROYFQM-*}Ee8Wqv*(|7K&WL{;QJ5V7ct!)_p4uf9fr0Gg& zdknrKjWdojdXF+b>_Fn@xS0~6W_mcyaj=^0;5FNQO?GH|gE zf1kml8etC}g~0#Z!J{a%@Zg~mUv2PM3%mdJqldlLFsI?UmOgsK*R;_iKBtTx{QCQh z9@PkY^e6=W=Z+plnT1CWmH29-2ci8poO%{s;^E_UurT2HD>cs1i$#lCiHPtKz)K5n zF1goLAs_17o5kWly^xQ_;^6q;HiKKV5QefhFrZfzWihez5@9n%RpL@3dlxEiT}wls z)S|-O;k5{$8t(*ojCJhClpv3F6{bnumz1cX#Rn)q_N3cGx>^WG3TaA|3n0 zO-)ugwYf}I0Q3JCeJp3}WEuAo?W=o<#KlK0`bIAy@-M6PmwBhJ_EdR4sc@xkH$&8= zyO0Yz0WxP81Jdq=O23b3&W%vQn?^XG@J@4S@e7}Hh*-j0Z%#|6ze$(~ZH67!p6JN1 zBC7~XF`40$#JqQO&xIHR_~D_Gf@yIrl$3}=2AG8!h~7R_Y9&qw8|?-k)|5UjCjNXW zdw0?x_at$Lxf^1`k`e+rGk(15G0L~g4cgWzGAfROnl>Na77L}yd*=%jG1HmbWaL>@ zRMA1DU=-R$<5A3S7>U+ElKOiu35$*^8<5~#!GYg?C=5o1M6e`;Nf#l~Nc%CB5=|5P zU^_x2+lPQ63~BE1NvpW;VnJbdp5>~N5bOn?6V@DGma}s-l;pf6W9`JEJ7~TOO#+T? z?6*Y_``x@FV$y2it;>^cU*3f6u{p|%r$t7u#Zd)u7A!5duh9hI!*U zg~?Zrak7A4#*6m2@nln7_>y-P&GEY`r06Q2&mZ{MXq#?XvWHmI*fx2j6@3;Li_le( z3r5j?6mL=xZR9LqJG!+UlA8o+V`$bSnU8K1N7;iQ7V`RVw_d)pwq9Pe~H*}A}5N~yl=$7((EYS_ zeDYI}*#wLRdN6-7rkxv@XNJ=lgD(%-;TXGU@F5zjFg{rd;oHQ!X$KJp@s)S5$o(P; z^#dsMpfj@Qdl%h>baOK27M|$nQ^_#~mznDkd@d0rMt3}-A#P{#Z>_l#9W(Gm2IDog z!-uN@ljzPr627ulVArGNeS{w}pQFH-3f;HF+^)yK96x*(=4oL9zcS*UkcNc!pe?b6 zv2i^dkGpubjUvdZ!O`Xb{lfOCHZW6`Gd$Id#*zMJ5+=381GB^LuASYKM(lKjo7wSX zI8p-}2dWyux7S0^_-VnxKFpG6(H$K};2Y@=KR0ac12&jN&|2v@Z+hS2BeEusFuLl4 zxpwq;iQ-L5uDYRaWs{17L5~zd$Y;b0qht_3q}1M?&p_NlBZiBbB*=HI>lC}SKRgMQ z>Bil577Ego(T#zv@y!p1Lb(lu?D04}x`)1OYv!yewZSTCBjsuqd>$ke_s#6qAlOz*H* zDYNH24urae(6^f1LFgW?2#!xqYr$$~rsX=2qJ<2{a-}dFx1-d9%))O+UA;}=ap{X| zlOegfU)<|Hb4BVriE1GN@^!8U&)NAGiC1xIP&D9~;2_~b#3JC81sTr^nYcwt)#p{0nPUqQzv) zeDDjbhWaDgVIU~-jEb0bd;y4Urk{-IJ{kKMe;peX!$0`Jx?lb^epwyyr_r?ojmLT3 zFmU6q*dL}5Z&_%oqwNVRi3HvV(X4>(K zd9~5n?px_e!=Ku<7N%FEA3(;<8d0ao3Dy@Tsg)!*8l1FvqDqo7Nka5C z91p}@D^yP!&8eNK#U9#zZCR~ zL*W;bIsK+wDFTGnrDuO%SZoYsJi6y|qejlOnZ;cKAl;m>)m|!T=jK4&RD=8JOeFpy zh;;PxS^ei%28rgW7yK}k$vCr+BLe2fZOu%2SE%u9hPt+WW#>}FZ*0}lBgrq~o2CVx z`(3C>vkpuF4ptzSPkgXt!MAV^svhVR#B5ot>u@aLnkvcVvtB>P1XNP#6 zg91sbn>SrBB(5g%x)LCE5)dC_H$csUVqJQ2+r@xfptyB;IHw0djURT8!a`%ySJr`Ogsm@<~6}WHX!mP9sh8woysoLgtw9V~OG zx-jWK|CW+OmFaxo{o-62G?psk29C*o_6yO zJoj%o1S%(CB~~xhZRZo<6i4DCeZ#i_pCfyhV=Rpu`%t%1+OIjft+eXZ+YEB~NA-Fu zuAs-ndU97ZX{q0>Te?C4tplVucWuk`>=A71oJ2Ph z)bHT%upf`(EXKSH520ulkA=&ysyps!8Z3BEf+|4S_ydLoaUwq2Ke?QxP1Xme=f|DS zLFb_9T-0N0MKe^*5{j%%kD%Cz;R=}4`Eq)LRxzB*75e9rv#|tPIqB|`FLarnoIHAU zFn`V~5RJ$*n8%l>NGgDQonE>$#8(LjPCMV9_B)3hfwgS$=P~9&K$>ns#ip1G#1HhU ze(P+{+U!%QSSu@mYL%~mEPrh|hLoLCcnmEu9F>Z1!%>6mptQ-Hk0!un@j)UZl{bZ3 z_K5OIp?~Cl;TJLaN^BX6C_L*Rd7OHO_mZ-HkgKPA{;`)vsqreG@D0%o_r|FePS?I_ zO1>T&zTfFEoh>l^i%DQ$d&tlLCX)Nvb9BX0vvKa4S8S5JA7rI%SW3n#F<;>^sPgZb#~qzILB z&zn%kb%!t)z!w5L>$Z~R7wT8-eBUuuOFbYQj8u(VIk*Zp@>Q9gI}HE`L~-o9rB#2` z%dg|t1C9X;>-a0vVakI1C>|yw(k=lPy_)NkD5`N)BcG%z*q|4&cMSu2I_{lzo^xyj z-V~}1M{1r%n6)}jIkO6yS}FBPu0zj}#$dP%Kl>xRqs23mxu>$NSM)eV3V_P3%Xl7V zeDA`9bcEAlx*Ek!5Uz_AhR_fHuy)(rQdC9_l-qmhMg+BpxgrH{^0?F- zcFSU6`Lo$GpG5gNUF)GVf#JVAUoU{SaqC``vL-4!F*K$d+ABezc%HAan6JdvsnXw2 zX?}jve$zQ0bpO#I<%A7`zxkY+Q{2Zgi=U#_zaU}ID!*Bb{cEb&{obJ_f=_q&jc%w> z6jy9+&1rS7xW`S&x^z(2a`!zsJwNQV4~mHVbA@=wwfQK4>aWlH;eX*j-`@dYs_K5XS2955X1Qj6ln@lU zUyqU(Q2i?;Z^ZJ#AJ0SWhH1G)7K8j)d_|KM3$sFE0tU(s>7lC0~1J%xYDh5e6Y!|dN$mdu-h+Mw3GF~e*MyH%;twNPb^@(fFP zOh~=lJ(3i1Yt=g?N&m`z#Sp9Z?^Xr$?>XYCioa$2m5Y(%VhE|YWq$9yoFAVs49hfL z;FH;J_zu1U#i}f_e^ONp(R8PYZ~tKv$JoMm8Nr&EbH8x}d^hS&gLv|XZzJkv_xHzk zSJUBYHy%Ag#Ya+NX2%~Yzl74wP)Lk(GQaSNlkinz_Qe%}xq|pDXA5C0%f~G&0yDOc ztaO>&lX$FE0_MN#Wi`sX@>oSle+>hyFqv4l-CRa@U3r;L^@OXSy;_WHsZCfSWW*|6 zQCPS^M&OpT2kPe*zI{rj&WBs)Wy&t3tX1=4aMr-0ggw0#9-l;N3IS(Z8+sy1Sp%lks-Lx=wrpko_e5Dm0e=;)#Qs4!)J~uc++)CDdE75@DEy z_vc*AQ+>L6!v3*WndqKp$p}p@Dc)FEM3-c92}i5NG|>hYd=15`ATAMNRIUq@e}?IT z6yN>tiJp>skHc70<|LNYWFdeTs(s9sfxe{03i?(u1-e^R!SH1w>C zc-8w(QFHIsURlvwiMdArtR{=Z#NG9GC~C{W>jdDk>xZ`~Ka#P3=k3#$SQ_!y*u99% zo*7k0z#2-x)sI02xo5W)8|-^=x1)ny`uD;IyUp7W;x1)BQZwRDNif6LP@sk$v%&aU zE~Stw&1U8#v}qQ)DlvdN_V|hnMjv@I%q0K9oAo7VM&k`%nEQmqye3pc99+pCfTol-R1sW^^ODID%pp*XaDJiWuvFiwnd6Y~%aebid<`C?KL zg2A%kJH^>qi2g143IH$l6ew{f66sm{S)g-|7*qeCpoZGF0Nq`x9b6o+mSncOi<(vy z)_<%OoA07Xy-j&~7Y*p$l~1=QoS1y6#e`*VA_a+*GG;%GQgFjQT} z*Lca44j*Lf`4Tlbb#WGXlV8+|)%&q=iqNZ{Jd+%6*TO|NR>;^6D^W6aQ@vya;Y}}I z4&8-=DYz%NtEDguisyVO--$!wOR-icPzsfy{OBA}qG-vG_r|&JJ`b+3wfCMRb4Vft3Cz*i?I>d2#%x#k;DzH5|*F z=@^dX5CwK#c(FxFZcRmz_%^ZC=||`~Hwk3Rjn zW#XF5j>yr9rQA9-(wpOiVhv(=DaSQ$-BgiE=n-MyK6GGs_Dm!>XT0j`mtTI#U&kmm zq>Ff7SFr+{VekCAe((73hw#7P&;5R{0lR=Bkh;G;uu zyqn=ea$Ufi1UyT*Ag03<8Yo-0aSf8-c|0ERXh*O(R~MAhyO<+jzxVpJ9@QNc@>s_Y ziYL{EaC#6r=z#2@NPJqf`*h7edZHMD?%t{?yU;=$2cDS#peGJpSa&S%Qv3~ZySCfH z(CQ@$MnURi1Zd5k>M-o1_M5E&qr^qFO_A-2B0HwYPDPPjQ)IWI$P+2Df7l)jcB>kC zDy0tEr|q4?!K;d5h9=lf^_Mr5huRf^q@5f&um)lxreQOLV2oRO<6uVwb=(X(lDWZg%`Pj(BG=X)|i4Bl^OEdn8_W4^P6?$-OsB+PCE^O}rZj)Xbfvj51UZwUfH5 ztRG4=q!Wv|wm9v|lFBw^G4PdTEn;IoSC&V|7hM=1$_+9(U$-t-he}f_iK4oh&5^Py zd$!}bdisL3b)4drCGC`R6-G*{^ex-Y-KS~;PKu;;P$ZGRS{!9L`zhh%i2-f8IvXcJ z(0Dja^SC}%)HBo9Qbd&Ja}`@21A9|1yB01DnldH5>5mI@LOG4%jZ+4w680nuCB+l> zk~KcW%h9CNt*hYUZsa6Gh=>rVI#x9ls|j!fAfc>HPhC z&^gt^jz(07DXCRoCdA#rjBtMBQFm5zhstMfH z=jnVH@7Xg`P0;Sgul5LjEkJ6ILgXV(_!;`pQ)!09P=F>ylH63M&$%5#U+$@kl#N%< zF#~R$?!Gn1m(R)!r9$cx9&(3earH|noBg{LdjV6qmC`W$Rw(<2UMzcx3r9C`KlbBk_%Ms7P5Q4t#g z7*HK_Vco%|K zpQ2^Vz@d=nYf?~3vlZ57$Hl-7<0@m+J=7GGq_`$%L5mW}bbyYu+=`zsvuI`!BrY+v z;IG`=fqFZ0W7Bqx7nLGG;if3BCjPTg9+eMc*?HoEZ6NRI;9ynBWOj8i{`M z41To;2>uk#<0vt+B$6=OtjGS**$rx274wl39w6gET!QxBad~ZyJgY z{GvwWkuJO#pg0S6DcpS4RoG5XJ|D+vTQKfO0ZJ5Iu|64zfOsg-^Bc;y^Y$9vsSpuf2bJLrL4SsMmFtTOvda12Zg249_ChwUQWaK_5Asx6>Q|l) zD|eJ!>ZgTn%6#Q>RAp2uF9g0TONfYM&!qiStQd?bMX6(gfmRn$PI33;W~N0KG%*+_ z@pP1PSjQ{XLqRAco0%-^CrBMuZ9)roO+U*quG41~6yg)vFbi2|&M*DTb-7MWr8~A+ zXn&9;;!%muj#2cNw2QBy-E!5vxj%am4c}j>bnj)Ut&DljG^;$boc-npnUc8ce!#(^ zOlphbN^H`GMhwlT|HksEEOc7R{mud(mP0Gs|DbuR8-E=HB$@*UXqs!e~M3YGd(E&>q89EPcp+>5D{uu zQ}pI4YexA&*^Yo^IRk%(K*2_&;g!BUAn@-I)ZGo}Udc^+2n=+9k@CDEU~bVcTpp#N z5aAWZ1M+35q{2%5rY(O`hWFAe1x)o2g2hRd4~36TzzkzKmS~p6>n!#ikdS(*Bsp@z z@EwMVmdphQcrK4)C#{uF_-?3UqszJ^P{CJ(2(UN7OEl8+{in{MC-33M5_~ z&>YdR#QXIVlpwdBwx4*S8g{q923mF5!>XKBCub!&IiLHeNJ5SU0qM?)Y33uS7;q|2 z+A^!O*htLfEV7?8l)neN;IF^im0^JC%IcLFK(N|3p<|=*K381qk~GN0Dw@SzL+Wh0 zA%_-ivXW!MNoLpQTy`)j;4G>#+1YzmRU7&Ncz+OXMV2is(!_z%~}j= znYzcXdj_ISTKw|0l6~m;;LF>RrIP-P>>}HA-O=i~AQoIPOUl@)=z#mZ#b1L>7QVv; zol5>&4>mi)}ta zRX|bX-S&=DAgk#N)0_L{R>|m{YBs%^LqqUpFI;38++l=@DvSdS!h~P(vQY8zZWYmQ z{@qv3z$lu&RWltfpiE399jDg2vn@K!uMZPU~CGkM&i$DJn)LM3H* zB$`SQX~^)F%M~gm`4v<9Rd{kl(`XoFOW%z{d1)x03N>_mPMYBb=l`7-+$qRXYm+d(_a(;_!g5Yh9uOtwf3dxae5{w!N@W_E@bkh7 zJkcN67X8AMc_d9e)TyCI=;ic)0LWzQ0rDCPt|Z{FGHc8&iJI=@0}YtQ^ZKIkXq&G3 zW1Dvt!RT^7L&i;@_25DNX$h(xJm99*+(+jK0_+a10ct@gLFhC@9h#2o&em$sZG&)2 z#Xi6dJg#s2?dj;p<==An|JGO6Kh8JE=V#G$IroOX7r>PtJ-T2^06!YdAYrYg0eqlf zRO;|V9)?`2;os!3f93XV^{cjXJ2+Wt?^eHGVWhtX5}@IMa*-sr;yO*$97k)9Obffc zlS@09g|${x(@r&|l!TY9l#nR$;htRDsmrC?D$I_1q1tOgc@odmUiRnA+jHbGb zTj^kCTsZRg$%5Mw@<~p6qO%!J;^BM4rD{4t<+V!{Jt_BREyC^X*+>DS0`ME3EZZf^ zbDlTF9$&SvRuoSvFWcz4s75VL|M6q>mm+mo`UPGAq~X5!+b9IOhZN75Y*Rtmo~Cov z&5*k-A$I#`eb@e|Z_LFX;(3X+rp^%)C4k(vi;c>zu7|bpxR^Yb#8fy5>aXj)`p6k#qmy;O`523ZlMw^;c6yai$}9BZFa=VLkoPP2R1 zIc^_y2IW8`%H;qt&D6GbJ>o0~6cKst`DXj%(m7Wm0 zH6h7pit$<`ci0GD=dG|NnZUxW8jyqty=yRjBeKR&0GkET$EtO~Z1XCI1E@|ZWvp1? z?63`ofKC@C-VKz+kdwJU0T8ZfQjMy!a5SA(Fw{2xYwi-`SDMEsI6u>Ww#`XsJ37N3 zqor`@7YVZLnl~@F9P`Zv`{Th45P{K>zhR6K?_lLwaQKxXcQ2mMc`APhi(i)i%{o2T zdM;a;ss0VVxm46WP%k1mOqZ~GR@r)QTs8K)yW_eJxOZ{2RejLTDTK?L7c((S_XTHD z#vJpk>e(KuI=3dhq637kmq^M})ixu@t;KXo!6qxF=@MGG792}>x^PiPPuA`iAT$#fqaCK_|BKnC5iwTr>cisK*8Rv1|YD16mq@Qyfs3LS+#3`L|Fm4 zYx@y$=FO&Z79{GCEDJmH&dEOSl-AR6#uSjdc{q!F59Ub|_X$4t6P>2C#PrHVz6qVA zp+z>v%PGn&7eu45kW#2B{*RBD#L_Ev9-)C$4_5%WdSc~y`WF303#(cuB-`jt&BIef zRYACzQqewPNv*;fBk4mhdd-}1NkFi&m%(4<9zZ@KzfR@glCM zHTEX!pG(PHsMopYkf$xAO>s&QBKPQyUMPwc(l(M(UkMjWO&!~V!oh{2b=BXY<>qk5 z1g?YN-Psaesuo&n{I0fb|LSrNCERw&QT>r5PR?mfnxO5-K?&AmdF>@d1HOqT@zNq{0sBkQMR)xn_`I%P% z5qvm7x>|c!E5y724sG-0#cF)cZn%pm%j0w4@-Sg$-TCSvEH>#@FGTY9hDtbBrY89( z`t=u_-yZ(+(IeE|J+76s%Hwn^nXTYw>8(Yzu+?gXwO<@Cx8?0WoVVxhQvB#Vww$NG zI#2&?ErL5GGg?!ksKZu^^;sR)>*Wg?_7`6uq`!HAW3NzdsnTt`^gnJZy=9mFx~eo1 zUtrfa9=A5nAHDeN^B;d~{`UrMp+*Vy^{9-RPyL_aCX+loy3}Ulc$`I2D$72ctRvb! zj+?I!|5?!Yq5x?Tn7v9g*?)_a=6P8~cwbtt80pFzyEjlL2{c>X@NdPr0ug)hw_*6V z5wWa8_@5;m4RH@!6EO>*s`DZKLX_8X%2;u`gmMm*@=quCKtJ5og~V-mb9@GrlgTQ1 z)QR4hnB~=Mc7sCSu*IpNb;N@*9i3{$A;5~t5@{XIM(>_IvF%PuW_-83we!TXJ}oT` z)*9MFpLoFMaeAR(U)*h^ub1>wn;H-(s}1fDg#vBEM0psyA94zC>MD>7rQ` zH!Jk~G^UO2@yXd~QM2t9deiTnofP%hA2CZaQ#82LOAIdY^#T~?`bOQiYWckwt*dmU z<0_W;02Ya070fG)z#j9pn)5h;`9kl+bX>T^f6EG}->>#6;_=xi9G~h}Liq|UczAHP z$tb{uYEGXtkHRa(@ET)8G4Q1>`>BhIKLfmGCGdVz2bDJrixw%~C{75>TkS<$hn3W& zRw8xp7~^as+XR%SaB<+z*@V@5>GxT||Ir(9J(jp_Rhrz27PSAk|NWov19JEn{ts+T zYw}0+u?4?pPoChv+h0E2vj4^3lP{lb{Rgl-PoF${@^ou^_dnqOPrls#k8tac8j$^4 z;oaOY{EylDIQjXPIIAjm+xP#WKcM3SO2926!1ShyM7)uLM5jbqPt=wA>?0nkj2Vy@v*9e7a$~T`9MkQwyY(EFb51y2>Yh z7xYOq1CC1!-2rQ&>Pyv^Qg#EL8%?23u3A>1{BErKari{b3EXK1Ao!1l~pqRoH==0h=?AHP!D3z>#u@djq zD#~x5s39_TrCItR{`guL99oLVn4NNZ^rO|H6uhJ9csOV1sM>{Oe;%B+PrLi@nN|M&=dr$Xz4(`{}$FDx{D-6217`A%7(hC_uk z1)QN8yQaqZ`R#SS?HvMG4?Ek0Q&WI!akW($9*ik<*S2?^dUqMsVej}2R6-%Bh+S{G z13(nQuS+=Q;{qZvBH)b5@qoYcY*dNcM#Ob?tvYv^NBfL0E?N~au6umgJtnXx^C_Hc z<==Ubs>E&Gah+YO&RquC?+i}+-F?EuEJk){SU^TqhR1VTsa>ZOj-j~IVY~K@sT^+i zIp&>NH&~B`9QN8sAIH-)DvaWwclL@%7s#m>CA6#8JH&oprRlVQ8E<=iY?oqh6$w!P zY@fc899<+pJfYPbrs99ZPz>-ld=_E6FzC+f_Sqq}F1FnQ%#P2FkT%X&vm!qK1H^Yi zchsx{=y?y&Se*b!g4cr_n_`Et$~Z2*(iR1=zwDnL_EeUG?FHjA}yi!86e|UD#AwoqxRTMZshHY(1k=>`rhVUk!#9+mb$Lj065h} zUfdf8{0-UelAYCMzCbR{7dI|BgoFZ*)b1a5>7x!haTv9JEhW5&pASP*ErH*;4K7h^WB;JDe@NWx zC>|D0Qu->~YvuP{^S#*q;Pha>eMmjz%Mq?yMG1lX+A_O#nPOiDhlic-Px$N~O{eko zqU8KP?y+QpBSPzYnQ)`Z@R(GoVuzSx8N>-Xv2t{LTmWwj%*y$KDpr54YKR#AXuk9s zFt1Da=#zH;h?%}iI5P^zo0L#2AC*zZT*y?buvrk{1T&!^dYXMERJU%Wf$Z*n^-MaW zyUA`SMYK~zc^=PT!da1}9vq!7R(Lsb1OF*Glg}3^0s;PuLtr1kl}?)9 zGt*aHW@@!FEiW^jF4O6V=?DK^EHqB8SMxj{=Lw%z`mw6$$SpcrQ}o&`dRTkBimJmF8j~E^qYXCrRw-^p?!F{l8>vhk7M~*V8m#b$j9Oe zWbusp#DB{^uH<8}PaB!|&$YO82UOCS^tnkrt=N(ro$B}&KgRn9I%ws6|8vG<(&?I# z=$MzlDKTEG@W@zZ>68Vk;`?GZbm5|;;@V0p+)88K=JaPpk&!7J``k)L zxqbUEx1W_(d{$Kv&-W=t8nmkEck3&S;%U5$3-$PQf#V=n0yz%)!~cw~ET|HLfBaA4 z&O)qSXQN<7P|p}n#eM|N)Gp4(U%P%jOn&j66YKeMnqEx3=g5AsjIWp0 zBL(2HMw{o>(;|yMB-{Y6K;D)sdklNQp+`ImYk=k>LYIk3pw0 zj1Y2qlsO|ei+#g7xqJRZP&3MM)t$SwX<&a7iUH7 z)fw3jvC~oP^b|W?#ZF(b(^>5F7CYU=PJgr6mh-gjJncA7yUx=S=jo~Q^vrqs(t5gf zJG^##ymq_1cKf_`JH2*$y>`33cKaP>Th7zA^R(kU?K)3SoTsPG(=+GE?r-Vzw{-ej zI{hu3{+3REOQ*l3)8EqRZ*;NcJZ(EqJI>Rt^Yp}ddg?qqbDo_3ocWEM`Hh_Ujhy+7 zocWEM`Hh_Ujhy+#HoY0z4-Rn}Ib_LxxOD0)8$yj=eRo&~%8!p|#9?(?xV%ckbP;Fz zhJq>z{7J(+rCG!NG_;=biwpbP+^&|d>~GgjE5q4B#_^K@xH z#h2F8Y&Er>6890L6Z<1QS_2$T?3OUrkqj}PB;%z!KH!@h_LDugZ0LL&+TVcJcb=SY zQP!{yPZSHT8t(Jddv+c(uXyGa&qj9hsGzaSQ8`R-04UMWOXLavyW|aqK=`=1yD4QCWTeJhM-n zsrPltpY@B=&fv8Evo&3MLD`m_H$&N)GM|fl+^`-p>tSjCo!bvisi6&>eCloc*C)eC2yoQ?N(*fD6FFbu*?wH6?$>4NEnt+-)KpBA^TX3Ra7yY?mg~HCvL$gc(!~&6 zwe>>M?XI%&hfalNc$uZE1^Va#5IM+KNv-YMD&eQCvYI=0s)_&EE~~zK_v-kcorbx@ zuz@_R&E0TdV*%i;@3sU%#>+`hQ*yhsXuw zt7I9s^55SL6umsZeEPKN{@3>I(`TOl=hN+--FyGfKjZiLXOAzE`Qv;N1b9Rb&bp_a z^ON@J+ZTU*+dJwYZs7kncUwF3w?-6vY7IA+AjPk;I5^$kf3eX*SK@Hh z1G@J6F5LL*|JuL{w=kmcC+KTAi6s$j7U!$!^2NqUdob7tINpK#<#oGzxWTW?)c*P| z{HuP#cw*sC0mhI}Q`q<`SAR~!+6dLa08qgwoyTk85?{x|)v^LE4ix@}%~^_>MsW4& zz`F8dYs0Q`YvKPbDe%AdhxETS{E+iy{y(OVTkijEJ>7ch(f=n~Pw(&l{wY5+l3fPy zU-}Hp#TTnf zD0LCfhm+tadLQF0nAU0^@9zd=XuxX0B15{`q@G%rql@zi2zY6BgC$$r z^xs7~!fQI?dz&}gw#_0?_R{;@WcJTKZ)j-F`Nc}P#?G5|Jix+rGNkD z*_ZeH-=FgP5NGK29&WY1Ztd(o4}wkLFOns?MxJy+<||08!516JG3qLrkJ2m3FiUmo zmsyezC+|VH-wbP?i(3}@U)92VwLn9UU&eOOwFAafXE@%uH=_ku2gG zNL}bR1@AeU{^t1IJl*_h8dKccP4u75@*z}!5{}!k4qY&dhFPi|l*h@nJ+{Ds#}2_G z=lBRf)Kb#mE|Xc3bDrGi;d>ZyJPnyK<)n5=9`0`a4VVtR7XtM$sCAsFd`^tta{!{~bv>RY1?-dl>z6%0XrjeC$$Lvpi501jmj$8D;3Eivqx+OO9>} zqU4xYqf#|>Go}_=-e~~AbeWO^AOaj6!NVF|TA*SV$x=1y!fl)2*6tsLu(vMbrCH#E zXbu&^H`D*`{~f-c^8)ii);7oL&eSH}9&6$o>zT$0jAL!{J6w-sm@GHdI5*LIGs+13 zH4VQg$Lbi(5lxSL-%`R4z~K2WULKBL6w}TBYfS2egXL@vfRW2AnuV|9DV%$gXeCG~ zd*t+Ju)DLh|Ln`_>%v@5|BfYLv+VAKd}OQ$Eyazo-Z1M2Z)X@^gWLl*F&nftG%K7C zD7Dh;vIekep^;YBuBB|aHLKnz!KBWZ`)0TLR6g)BC^+R$hUxu%OiE1GClFSZiQy1AeKhi4UBfR#3&$KzU5)s z7GavgpsNCTsI@NVs}}ZwiM4B#TSF&Dkd@L1L!m{mEE0w*5PrgJHK!y3up+Yk>zrMn zh8F;9dQO2vfXW*!XpJrt@ra-SH6~OTV-gS~rkIQy4dZzXvjH>$%vm9rDdu1l?n8SV zKG2)*_SZDu4V9E;Lk|~r7PNPmq9cJKSr*Yl1wJAf1?-|5QJkoi9DgkIDkljFr72Ac zP}5;TiAvUCt^{Sd4Dc9M5$Ckx=>o5YxH^pIIbqV_o0CJc1euC; zE?B3K+{L4>2#-{>A0&F1m9sTz=wZmNMIc-y%L!%;6%#5&4AtdoDh_B3U72eXP4pTb zuu@q26>w?1#I=AEU-HcFGc6`U91Vx@0$>K<1!4>5pmiX$YxW?xPL#|Gd*Vx)%gN!X zS_1q6gM*i-j)FyCQWe%uVjRjLrmn+H!b6}4wG0D1FQO?E{*!nFfN!_LHqJQ;-@qyX zcE`V9)r)wEEzwaJPUWCh=wY|gp2pYV5r{6M=!RgcPgXdtW;mQYoS`-8B32oeCGb&7 z5lVBnx#KvQhOe^pYEBb~@D%zb9x1aAEe`C5Xo#az8^yvNUNUvq@ywkL4ghrkp^w5h z*-idFX?U2chY!M?2d+snO%^~=`pE^_{nRSzgAXx)&rHrz4t0+3vT_WJ&2b1K2vCR{ zn;jt1NrY(ggQB5%Nh=?w$d2ZwDkbNjBo2I#BT-N{kA#-+9V4EU$GmJmvyK!)OQx{x zR=Ca0p}|Go?C)D>3e?I!Rc5d`5@aA1U*@oY&*7AmDbY$=%o~Qy3WqQo$tkqL)XwU0!Q5JUpvnTJiWAScN?IPCrwUT>nD4pjbQ}DJer}v04b&6vL1& zZ>Dh>Y9o%yt^m5Q%$e_^V7Z1Z)w7QjcfjL8NB~a*t95;S{qFqyCljaunF}1QIwt`2 zmN$m6b)B74V;#%_MPu8x?VQ-QZQD-U6WjKQZQE{a+eXu%N$&R>?&Cbq)9gKK?YgHa zh`}L)W*POcyH~UtNOTw`Ng5csZ9Lo5u!wI)DD!Zqa~?+7ON}8y12ogBkdTuKD}mZP znum9R+WLYvZ+P6SKYN2KfqA13)q_D?=pKKxD?DjqALhvta4gXJiYwz zF+T>YrL=7QGZ@FaD0$aG_;y86b>&4sQthMvB(X9rlO5p5G>NzwtY6F)sk5Z(Z@Jfxz;Ej z{a%KeU7$QfDGfT&nW01d3-%_f)jtmFGY-D=ht&-lL)jn_rvO-hhWmG2|LzQFO6Egx7_b%5BOZDOLIYRRl+qMdo4 zp`p|>8Tzhj>O^h9vn&dLNmDn2@G9q*M3;!~xky*1_?4`hjM`(Sh6ZjQWr8c=zBr>Y zu)Si||M060=~Ogw)^xKxcnCzi`P=z; z6?t+wQr36U|7{hUSv zl-D>`N+~$Glo-KaJxiM&RQZdZk_HP)2~eJM0CQU0f0b1jff~08iyE4_m`>^vXR|6x zZ8*?+L}HDnT;GB`RkF!+3=8rlTB2u_C!%W|`6@&bEtHum0_=UH1xciS`pACj9MH*x z-Cp*26c}%xa*+HQh+*u=5GzDpC3a}4gM*V!>KCet8u7b_ZLSr8D|HB z=$elJJ!WBN6@2Yy&sV-@i%#V0nZi!B7;bfoOaLfb%^D9AxS;6b?FD7rwQ1&p&rRR~ z#RhJLCt$g5P*z{7<*xY`XRmJM<(^<-#i9#yszIADgeigCnilbj8F(J1{>r`W&UImk zol4tX0XL2Q;jex!v`ndSi_)w8XEUMO zn2YFiN$rSHBW#DFv9Hnz^Oc4*ACbuevp?!bkw9)y?AA%Xx*rnI4z!*w>s>rtzRYSB z7-o1K5zs>V8xOjS4sLXr)LE8l3SbCVO@+K3c+kOE>qUHOR*6fy8s+gr*dNWE_9fvB zO;m%?n+OsX4Jca0#9GBrZb`PRLE9;dVs!BlGBsQNd6sy(>bn+DKe-C`T~nu)Gs{v> zv!66Aq%A0tCy>s~xV$h1n|yK+xuTw=83kQ;cXYEQ;GcpPe+dWCFVp}2Bj>YcJt_q? zz3!iap;9C%B6yVb+rt;Ghj*1BhiQg$rLo7)9C%7kI>wOU(~Hfmn>efu!vSa6y?#3S z<|>|sR<2yBT>*{oS=A&=R)lJv`jHWyw)m#j*db*$A`IkL_mr(V^G#!$O-$0_l=;YO zh30OL%i*Qq7Z+=nG;NY3Yn}rmC)I#r9+5`CpIQ`EAZ*gj6C;c+61w+`PN`q(tKfbf zbkN5QfN}LxCCL=@Hg?z3IQaAIN4teb#E zs=pl^AV>h8KllBsE8mJ`!7x3H!%`}`w0Ft}flX$i+u5kC4V~I&*UB|fh%Zq5(ALrL znS;cg;+m|IiXCbs6#E{GS&b1;_MBVnDXV`gyCI{h7yqn_AE4Pz`I|I*sBO;P&-cGU zvXNW<6(NfI(o%KR$aUchjL;*x{snZ*k;MOf){`UQ~>#j#6 zI1rn0D8z%YEw*x{0&$)@r0^U6kB;4)+< z+5C16OSQJWNU)zC&(MIJd>MAX*lIG8T8~+rpBD@=$T_J@d96j4q|Z;;K3`6-`8{Mf z`Wb=78Wg`@k>DSq^~gY5u#)Xb1p^xuV8y2k7w#q_|516I%Wv1M-T9behVz`vC3m4U ztZBKbsq9LK4pV-kBmR6HFROP-Qq_Z8?8ns${*ElOa#{-U>4D-$ic;E62*yV?o0%%|6E<>7q3p6EJ@R(M+_1L=3Ym4hv|f668? zdeQKB(pPm3*BX_KQpbvfCxtvzWNkvw0s4ybGL7qJqnJ@r^Q!bouDttv=5q&pKeeTW z{r0+iw!eyh9)E8LycGugJ4L;+=>0xx-k~+YIqY}Y8~^p~@e`FKl6h@Rj(HP7E zP^sf(!-XbvIip0!F`RU2`IMKb(jlvve(V4s!~~3s=8Jj*L1t*6i<%5hOUO^##!MQ= ze>Bi>wx8v^5Zs6Bo@eK^F@d;9_txZtCarz89w|Bk6`Pb?dsvv&Vdx5LnMlZ5gT7ru zaH=d672k<<5SBWx(1G&!QT1pP8Ejy)4P%)IvLZ4XW;m41U?0a2PNO<0cmW8x%;0Pi znP8+!Bw5(1YJ@?4)nGqbfquOUl(`xZe5N?*lZnpL#RDrPj%JjaF%~3nU7 zruTKWKl&u%KCm~)i~f!PHm-I@RBGgiAd9D8OyYP{3A$Whj<=HrRl!wzwN@5Sp_kjy z8T4V`L>H$P^LZ=mlJLry!py?GPV&Mc71)$i_i}&8hEow}$oEneaJ?w<^e~Z(9n&HR zn9=38+DR+Y%dUZ|mo`q0W-!%OjdVQbd$vKuL*PQe@RgXUGkUZHKL8)3QCvOWNOEp8 z1A3Iyq@!eq)c@|QCldIW3GaVK+d#1*^h`SrXnaLEBQx0L)`K^s*+e?JgLDTpp zHu3W!jN{qF@r#{_JyMVP16ko)Bpmtm>1YYmp$vdu)MTu)5f{)pK5j$~VsnzhSYPkmLmC`Ld?^b@QUL(fdN69VSdQ}NrOncbJOvG#$dSSY*?rLH zttuqiD{<5~{qN}Ksuoz!>Na%(f3iuGG#g2=t$TG;j)D@MA>O1*Nh;@d;G=t;ZcuRsgh_3zY6Pu6Fc*=x8>WKj zsY=1Dtl^1)_jG411<~f0yI{KmFbmcVIxzFO;pq(=7^u3(w{!;V!ItPJftFl9QX{Yp zlw?}Cz>m7e@QXHv1|Q7Q!AxwZ6k$i7*MKV9`tkmAE9!6Zk@aNn>#^gxC-^W3s*tz# zGzL!6SAOUg@pVkZwc&=5FR=Sl-(gtb-I=>wPReF-n0h4uo#HPe<@v`l)lBgP)k96P z-PE)diY;bwaY32ra$Igc15@nPN*MMy(s@__m=s|ps(E}Oft2zUR~RBy>ajDCt^d2& zQ;Oq8lqJgnRbEk0CL9~ld}Zz$ydEi@MJ6j~G5Z80Y#udyORVsgEzInp>adObS}kZzYg?*1c7=+i zV0~sE<+_Z&j7fNj0DCtv_~lzJ8Pk!RjG!^E_%9Alyc;ap$>XmMm@1PU{I@T4T^Ubp z+C~LJZL_)K=y4EzUU z5S6kRf_4eNH3FU~M$~WOS3Ji3Z+31dBzpBgYEUcEK$;dreZUGm{%6@js~ud1R>F`_ z8|1etSc_=}Eg@^eJj~xdHEJxwk>SXbBw#GDZZ4a2Jf4(;edj^h!2rwXDhOCBpN#X9 zBEzpEuzejRDc|f49D{qHa{(4qV>>$Hr0B_R+%&d3t}!Y&Bv;{ZB9=;@&N!ukp`s0u zvIRw*+#YnEMGRroqf~#-l1cfKLGvmEN__rikc-Sl%S%*`QJ>1Rsn9nQ`ABCSd z_&5y7HN_2c%w57J%i9fr^WY1}BgDmolsBcd!Q~CdxBt+>})%12q;Hraf~6jBQB03WN)aA@qL2I7%J9 zr7Pr`kBl-X09qZ)>W@O!(#J}AGZHZ66i#2)M!GeWIL>Iz{275j-u7id;UP2G=T1?y zi#IjGb?eF;E1RK5s5_A2?-FYp-Y{oIU5b`ahu!JZwgunC!8M4BxE-3!wB9V9&)RQn z1QK%r?D=xPnrUjOc4?zCt&{0(oi$YxP}wadE3Tjo69zW(i`xI49KUD{c+qmuaQ!Ai z2X|BAmYU4&0EgQFWiuP0j~?|FqX_S^`k5B|*SoB9cd~tRa%GL9bynBYlyfu5p)k@kT1?6)@*pvl%a)QwgPTPKcRpM zuQ3Ztn0Nj#;VQx75~P`HB5g?^*@S6W(Y$Vq?jT|J1v?PW^tt1CK_1(aKLEvVR6y90f6b?=SgcIX-~pHgG1x3NCNBV&lf7>qcT zOvaUh$RLU)fN)6!y66bJ6)E~4661&V^u#G9p%%<_d$~tD@gYbfY2G5vjN(zaf^$jg zP5eQ2GMW*snmrG%)y(3jVY+QyeNGtXq0() zgYC@0Ld0nRxo5*9PA9|m`fsjQaUm#}; z5-$aP5w>1p{XnM&-cDn_I-%>2)`MtTvZN(^Vg@ERw>OD{>)k)e@vN z#m{@9o3?>euEt@(qgpBVcj&KMkLV$!Y^e{04yIYSEf}Zj>Ve8O8K>5Q6iby@u7PRx z3lQ(YH0{lxU2;|`dIR3^MU@pkt6?3c5W72OQb{?B(NBQQPV*FSTP?TlN?9veM2@SY zsO{?TqtU!J%YAIke1bw8OSHd6bcfxSV#?7znKnJGID$X<_#E!|Tvu6pWN+5DM~dco zeszkm28ju{IO|nepW8~!qyk9XaDrWcF0FA(Oh9&?c=&yoX^3Kp^WV(e(HvizKm)vN z1Xsk|I85}6D8u1}u4O<1x~3DCu1;8zOsQTT z8;nsr!c{tg9X&NrL0@V~G`#56P-9cz`P&V?npd1DyL=nWf|_KjrhF=sPzs4Is6XzR zBUBBNSr53nka!4R!D$d8W|lZ=jn4`gQgoEAYl({rNqH!0-qpOuuLxjx3=5}or-b9f zmst{CEy^WOT`(KL5!YF~=3j=}dHPQ58~3n|qIM<oeEEL)*=-Hx|jn^qgboyoY=woK|Vk* z&-oHDH%ud~nh>nhJ7Mrr9C~$A?CMBFN3IM`0K=jFu}qqfa2l^a(oX$%G`v%L(G>#u zAra=P?YrT|+G?!Q~Q{h%wqRwi5~ffWD(=)#?~}duB;OfR1TZkJni;RZ9H>8;pC86O>JQ zXvh<%M31L}jv1B6wNmQmkZ=1oKise0JAy)vuH zhJ`OYxz-q@w9uvduYsa=IXqe-b(UBkzXPpXyWd$6`_f8sio-^qm->PHf&ZI%Z`#vCR(Fny=D8swd7c+ZQ0W3hJE{V!cuRR zVgztDvTb+Nv#pJkv=`?6+qj?Xr#Wk=RyN&CkEfKmJ(#-R*e1t`joCE2)j(UVJRMl` z9&*yH0iq%$nSi_!!K(zL!U}LnPDbGafuok8oJcn2!6r=FCRu&<{-ke zE4y)!Z-lMW5-_>_#!l*FJ1tcPMdski^xpgr_PGCcx*99M%@;S!yguIOGl4vi%g~%MQxN6FTEva>s>_3pJ99x-Z;%(EWL_*CJJ*sngI{on=@vWf=p(LvBPrz8$Lct{U|WJp_Z*&4i0mw z(MFX{AsgtvqRYX?7ha-sq{@)2Bu;>0s`lFs)WZpPhed5ed_`v+?SOa^TA5!6OdyWP z`qgA?|HAtd%l<|Wr(@Om7$(z3+k6To>LwLlK;l6W z9%DL60`U<`6O8yt8pGQR0%@J5%+coO;KbV@CU(WJWAA0BJy7-uqR@uOn05-oimXHs zX|owm%P5@=a%-OUoo5}3rn) z>9*nyt3c8aiW|rL-(g^GB+8ii=Dp!l7Aj$v=MROPDM$M0ibd;~%;)D-peAMA&p{Yu zu{%3P$L@-{8H}gpr^$vAU#U&5;t=OKxm&>FBmNy}5Uy=OVx$q`6h3(O;Oaq2KAlc_ zg!@&>VhAKYN#YlaDQhy6&oBP8Y83ya_f6No$7Zbgr7r~d5_6ra!gV5mR?MKsD_xOY z2mnMpPo_tMU~f0}4EOcVGU6lWMa556l=}n%XeZ-YltO6;7>q7ygP%E)=X|M~XYwBOWK!E-vl; zNDb)*5`&)4^D067BmJO-ov9z#%R5Dy4!6wv!sIh6ftANnZGDMcR(Eh*j({c82pc2H z$+TU1ccD^NC1^W$^ z3G`h(Q?CX0fiSUxgWEiiuN0{DxE_EhgPGkQlBS7QSGs2EL<;yEWH`=AE2CTS(S}Vj zjEH|_oqC$T@eL~c0aW{jhh_cS4in-U7XhD~r5JZ>=kf)u!94T-I_#(PRe;e;O;KEs z(0b=;p)x$Ta6dihiP&DQ8R?vwC!i5hvD(Xkzq6m@vXKy{Y@6|}70>ieFfS*aTP zh1@SIP&%MQ*$9t}GguiG;x5EYJnviQkr*t1ZqK6};Bi+`ctj75#@U1{JfO7ri0~UC z_8?l%3%4kO+U<%V9jfKT;DzWnUh$(5sEH}WG75ux&4)Hu7U-1Z;O_iErnLM2RIQpL zkF-0usTGwJpcIK@GPhBzbsdugo7C`3kU|di>umzNTnn~@%jzLcTfTjr#SP*T*X@S9 zMU5i3=g|=YH?@7^AG(q6B6VR9&D3ZxjNU@@^PE|FW~wUV7mjl}5X5FCfmIO)VFvoI zLMeac1Q>RCWr?*8@%q*%kn(gb1(n_|>v~EvI#psjr045|yHJvcjU>GsAkZDYB1QM;f(p6|2C>6lq?I%L6+h+{@UEVA~b7@)8Q) z2B%3Hmv@RKEHzjsj|Sv3h0;FEa(lH^n<=Setq+_h=ARf{e8WeHhh`TIyYI@$pmz2H z)zBh#uE+P;5klp+oGYjQlDkQj-p;el=qf-yu}d{H#i)7w~|0mt)@NQdUU@w z=it&KO?{AhS#@IJI5Lv(z{qqNc}Z2O5ZNp-T71|rswjQb zzXC`gi30y}$~@ev=26wfA&kFCdRmeOq*$+unwa_F&jlE3d=7a^(utba!{=4wxV;voZITH zT40}U%jb4Mx}=^g6q!fwrw^Xy{I?! z`(8TffH5tdS?@jlUY(UCnnz5KshQKWGU8EhB7NZlowpF0EN9(eebKOwLmI#L|D=DZ)fuA`dJBL?(BLJ;B~@>U#s3!)iOG zO8ljK_U*{K7;RfDH63=hyoV`@amS+|AX_|{{|x3^|H)D8o2NV7D@gsQ|7QyH;+2J~nDV}8Uh-lf{kM;1 zQmScLUW+(Fd|NmA$&EOZ#aZ{S1mTccNkIOr*F#f{AOb;+JTNaDA}jR$;EU4DhsZzokf@RQkl|1_>$~=0o}HngY%iq7HX6NFQ@=Undmvm8;a|>5 zc-oy8Stl*)>q(AqJFkV~5BSNV;QKW%pFxvRZSP64k z-OW=Dh2Amf81&0PS0WHcAtP4pz>XG%mlTBU7@n&QrkA`PL@hK1H)hK}Xj2dFkRiIrES+cGb+^x_00D>4%SXt9 zN^n^4beyOQuVKP<2d2lyM;K%}1Riw^c(q|=6`DFQcUTGY(*!u|*EVi;mI^ooI%#(4 z6Y46;-g8}ftUYc@R_2e(5^4k}gsmvg$#V>CZcg>z5{&*aH$_Z!{q8aWDw+PV=*+lA z=c^Y-YWy~@3ZjDRCz$G@$C%>ymM9k;KISbKja3i$=2Ria-DB^{m5E|}$XRG9jj@L6 zJ4O~3^qqYNqKz4q2&tab&fvIU;jfUe1|5+x<=6!^Z%v~4QM?;=^xet7#&6ier0I9> zrfR!w&VQ9t@TyYDFDgWmoE_4%Bz_-`WtLGfaMK%QNfX|dxJuzwQrIDFR~u6c3hK$p z3~Z>SOV1v-;uljmvXck&aY|j8Q|CIELz;`%lrJKsqK{NwLcyO1cm?`djN!jxk!8Bq zJOTwGWr(1HeVU|awWXsqnuR2a^3EkQ=-nR?eb$gi?ECgz=SRVLfQl=^bIm)MHL zI@`!T_P=Yg_pqTooWl}1z*)ANQ|Zc1pr>G+8-ha3eDrjb1SlHncZH)A)j8uvYbLJbg>x_Xk4S0)f9np*1GfRn3KvbNnmpsTpk&E}DE$sig=gE#5EkZ@y5?d_WN9M4|N`dCKbn z#JBxUfA>7Ib?f#9F~)mETcr-zYhXZ{3HkronZ4sxhEtTkD+2rxYJ1O?EO4GqByV3EX5FN@xqnprLr@re(1PdT2D4|(-T zVF3ij1{hVpMCMF|sUv|-Eqh>1XQ!L2Y-?{7JUm2YlY%2%C3i>jNqW5`b~;&2S+-LBglYUHq!n1uFCExzQQ7U z!O6G8K3a$uBMm`ca{h_}OQ7)DPpn03XhBSY+H~Ftu^t!s3(Hnb# zbU*gDSZ)OWTQeR4F|q~etc#PmQgul`T$ugT?4$BTB@TH1ivu}aW|niTp*@t3!3xIu zOSCEgDR!=~2`buv(awxdmDuEnJs#t7wI|dUr@NL2MAXh`0;8#cAp&pE7+pHY?!5zQyd2|UgyVbUv=33$HBBc#MNqL*hocFJUZmM8&Xyta zZ_%@2@1jmNmVmBVSsT`*Rf^@ojtW}8w|ehO$3)D8gdg%NkU7ds5z5}=)XG%HIvAK( zP(|9wwG=wJf751L0h&YXME)Rvf;)jY8nXbERUpF~P4B`f+^A!~5@y41>EhgPlS@Du0V{TlbPq-?$M=bwkM2fK`2Ai+cB9 z#97?lH#%f>3LPv}f`5PIs?|d@Yx@lAazzUURuiGLb!t)#!S7zGx?y6EkL!%DJ0XTK zjOvrYYhI7$zf5OLgR!59Nov#~RFG$!|6lXWu4>z1KEU9^Jdty|05e9%bb65;!l1^#TLTatGTR5P9#h9`wQ zrkgw%K)*5Xxz8!}0OF1}8LO5&LP6r`qESS+#kMI=gdNGdu=S>QnN+&W$AGwEnqgRI z^h`Xkj>~H9^EIe^x^{z5&ZH$QDCQk)`}MbYRroY1yaE{)SSVY(AtPUo37A#~jpkNS-vx`15LXP7e=0Vgy|0yT># zt3Y9588Un>0*=+UAQ#Hv@f0dEJ z9+gHvOMB^KKZWA#k~|00o1pTS`{Yyz&E2;}@t2Z@hTMwqpY^VtjhCMh^bp`Q=rioc zh0CHiqU|1>>N*M1gCpSDy=iraJ~<7>4N%bWWo&Q~HD3amtg2X|eJEomsj zO5wdW*z>94dA@wpiXXfzHuR9ywWAt!=wY%FPGSb#+=)_u2e%pGt@!L%C`$e4$^J98 zN#2AqYz;UPEJGa8z}xHJ=YIZKGlN4z?OeB04xsLeTVLOSl$+3tFeZe<>gC{Bhtr=` zPVY0D?9kzqB_rwQnE1&GtiVT<*_x?)-oF!+OfQ*2NGE z8Gplq@5o(DMPxDrG}-i_>eku{N5tgzJq4%zJM}*>enq6eH!u(ivNs5rO%CXH*+Rez z@YIDE`C#9qxkzS)2nVS3rtsyaHGe}Rn^w&m^b%nq=bZ9cz{2US7{YNo5}2(W29ZQ* z+~aJn>6jTEsC`Q;=O@54&_B)Ggd?Gjr23n^4P~&pMj;{SYr$JVwojcUBa{Y$i*#)gP-O5}imw9joo6S({&)0ZY74yzm3>|u=kTfW-9?U`fn zGG3xR*2Q~)_%^9N+P%>m0 zfgzUucwQOn>M$dwF`I|f#9L0mH3%>>Z$lRp^dG@fnwhT@3#_g!Ec_O&O*hz1BiQ7bvyQu%=4F2^pE}`gorPL8%xya9NIRd2Uf42%f z1yaah!Ty}BlS7i~^LuQ0YF$_nr( zY`uMztckP&7`BlgY?=8bG7t$|Fu&FdSpP1&lCZ#RpqY@2ygjDVBwGVAy3!2REL^HL zJZCDV*>tJq4WUK1Ed2Fqoog&Yb17rOLTKDRTFl=m(wMbdP(+(v8d1ljvm(VOXu7-b z{c8^V&R(&;6_5w>e?1Ic`wUJo=g-q}T%vsFTN>=u5~}d+MZ1FXfihXs@u*tw8!Te+vfZ zk>s_>lW0!9L@#UULF+@ksX;HcVZ4V+h8<}AbG8EZBbY<3=bkt;o#%FZmRDv}q)GOt zEC2#^XN8Jl?)NBNp3)v4Z+;o2_?Z;y}h{;w`Ue| z!%_z^4i`4@aF!ysJk3ZP5~M2~k{~5|(drOCW(iuu-SI!tyq|afDm<1Y#uKaD+Tk1^ zQj-aT{MP6EX;u|-WB<@WZokXXt80FrD&bT^{{YkAc2Izu6a^tOgMkaf9rWY=H?+u# z1tSb%Vr*hU*Bngq8@IAemt=Lw;Vwx>M;d5wf3`y0YtB?l$UYc5HJ5cCo zN93*D^337t3NhDU6JYq8`)b&98G8j*2AIy&_y@ z6kb@i;la22=Me)ASSpfmMu`g-0+>PEVM;~fh6iNvj36% zDoczSJUx*?XvI94@{q-cX)yodv^D6WYvpmEq2$0j03Y4Jm26h-7Lu|{5DfZ0l>$1{ zYmqW`C@D*Z&lMoQY@+1=7jY)?32gHI9~-o?v>GVU7pr&4==u|;gL=?-<2u^fRF6r% zh1aSGc)Tw3<9rxk1a?#&H9EH9KI|+7&S9im{&(m8$!~I>4z?V&VpZf<^$vNBPUP<$F_-VFdWn%# zKsKa1OczyOfa@2+SG9?m;vMYPyBiU>kbeWTmZ`^(cJPbh)B0*ZAS!uF14%x literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/contrib/mathsym/test/CVS/Entries b/trunk/paradiseo-eo/contrib/mathsym/test/CVS/Entries new file mode 100644 index 000000000..67db073ed --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/test/CVS/Entries @@ -0,0 +1,7 @@ +/test_compile.cpp/1.2/Sun Oct 9 07:03:35 2005// +/test_diff.cpp/1.1/Tue Oct 11 08:15:29 2005// +/test_lambda.cpp/1.1/Sun Oct 16 15:38:38 2005// +/test_mf.cpp/1.1/Thu Nov 24 09:35:34 2005// +/test_simplify.cpp/1.2/Thu Nov 24 09:35:34 2005// +/testeo.cpp/1.3/Tue Oct 11 08:15:29 2005// +D diff --git a/trunk/paradiseo-eo/contrib/mathsym/test/CVS/Repository b/trunk/paradiseo-eo/contrib/mathsym/test/CVS/Repository new file mode 100644 index 000000000..ea3fd5e9a --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/test/CVS/Repository @@ -0,0 +1 @@ +eo/contrib/mathsym/test diff --git a/trunk/paradiseo-eo/contrib/mathsym/test/CVS/Root b/trunk/paradiseo-eo/contrib/mathsym/test/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/test/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/contrib/mathsym/test/test_compile.cpp b/trunk/paradiseo-eo/contrib/mathsym/test/test_compile.cpp new file mode 100644 index 000000000..2c2f02ae5 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/test/test_compile.cpp @@ -0,0 +1,185 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#include + +#include +#include + +#include +#include +#include +#include +#include + +#include + +using namespace std; + +void test_xover(); + +int main() { + Dataset dataset; + dataset.load_data("test_data.txt"); + + cout << "Records/Fields " << dataset.n_records() << ' ' << dataset.n_fields() << endl; + + LanguageTable table; + table.add_function(sum_token, 2); + table.add_function(prod_token, 2); + table.add_function(sum_token, 0); + table.add_function(prod_token, 0); + table.add_function(inv_token, 1); + table.add_function(min_token, 1); + + for (unsigned i = 0; i < dataset.n_fields(); ++i) { + table.add_function( SymVar(i).token(), 0); + } + + TreeBuilder builder(table); + + IntervalBoundsCheck bounds(dataset.input_minima(), dataset.input_maxima() ); + ErrorMeasure measure(dataset, 1.0); + + + unsigned n = 1000; + unsigned k = 0; + + vector pop; + double sumsize = 0; + for (unsigned i = 0; i < n; ++i) { + + Sym sym = builder.build_tree(6, i%2); + pop.push_back(sym); + sumsize += sym.size(); + } + + cout << "Size " << sumsize/pop.size() << endl; + + // shuffle + for (unsigned gen = 0; gen < 10; ++gen) { + random_shuffle(pop.begin(), pop.end()); + for (unsigned i = 0; i < pop.size(); i+=2) { + + unsigned p1 = rng.random(pop[i].size()); + unsigned p2 = rng.random(pop[i+1].size()); + + Sym a = insert_subtree(pop[i], p1, get_subtree(pop[i+1], p2)); + Sym b = insert_subtree(pop[i+1], p2, get_subtree(pop[i], p1)); + + pop[i] = a; + pop[i+1] = b; + + } + cout << gen << ' ' << Sym::get_dag().size() << endl; + } + + vector oldpop; + swap(pop,oldpop); + for (unsigned i = 0; i < oldpop.size(); ++i) { + Sym sym = oldpop[i]; + if (!bounds.in_bounds(sym)) { + k++; + continue; + } + pop.push_back(sym); + } + + cout << "Done" << endl; + + // full compilation + + time_t start_time = time(0); + time_t compile_time; + { + multi_function f = compile(pop); + compile_time = time(0); + vector out(pop.size()); + + for (unsigned j = 0; j < dataset.n_records(); ++j) { + f(&dataset.get_inputs(j)[0], &out[0]); + } + } + + time_t end_time = time(0); + + cout << "Evaluated " << n-k << " syms in " << end_time - start_time << " seconds, compile took " << compile_time - start_time << " seconds" << endl; + + start_time = time(0); + vector funcs; + compile(pop, funcs); + compile_time = time(0); + for (unsigned i = 0; i < pop.size(); ++i) { + + single_function f = funcs[i]; + for (unsigned j = 0; j < dataset.n_records(); ++j) { + f(&dataset.get_inputs(j)[0]); + } + + } + + end_time = time(0); + + cout << "Evaluated " << n-k << " syms in " << end_time - start_time << " seconds, compile took " << compile_time - start_time << " seconds" << endl; + return 0; // skip the 'slow' one-by-one method + start_time = time(0); + for (unsigned i = 0; i < pop.size(); ++i) { + + single_function f = compile(pop[i]); + for (unsigned j = 0; j < dataset.n_records(); ++j) { + f(&dataset.get_inputs(j)[0]); + } + + } + + end_time = time(0); + + cout << "Evaluated " << n-k << " syms in " << end_time - start_time << " seconds" << endl; + +} + +void test_xover() { + Sym c = SymVar(0); + Sym x = c + c * c + c; + + cout << c << endl; + cout << x << endl; + + vector pop; + for (unsigned i = 0; i < x.size(); ++i) { + for (unsigned j = 0; j < x.size(); ++j) { + + Sym s = insert_subtree(x, i, get_subtree(x, j)); + pop.push_back(s); + cout << i << ' ' << j << ' ' << s << endl; + } + } + + x = Sym(); + c = Sym(); + + SymMap& dag = Sym::get_dag(); + + for (SymMap::iterator it = dag.begin(); it != dag.end(); ++it) { + Sym s(it); + cout << s << ' ' << s.refcount() << endl; + } + + + +} + diff --git a/trunk/paradiseo-eo/contrib/mathsym/test/test_diff.cpp b/trunk/paradiseo-eo/contrib/mathsym/test/test_diff.cpp new file mode 100644 index 000000000..09dd292d4 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/test/test_diff.cpp @@ -0,0 +1,17 @@ +#include +#include +#include + +using namespace std; + +int main() { + + Sym v = SymConst(1.2); + + Sym g = exp(-sqr(v)); + + cout << g << endl; + cout << differentiate(g, v.token()) << endl; + +} + diff --git a/trunk/paradiseo-eo/contrib/mathsym/test/test_lambda.cpp b/trunk/paradiseo-eo/contrib/mathsym/test/test_lambda.cpp new file mode 100644 index 000000000..dc8e1ac70 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/test/test_lambda.cpp @@ -0,0 +1,34 @@ +#include + +using namespace std; + +int main() { + + Sym x = SymVar(0); + Sym y = SymVar(1); + + Sym f = y + x*x; + + Sym l = SymLambda(f); + + SymVec args = l.args(); + args[0] = x; + args[1] = y; + l = Sym(l.token(), args); + + vector v(3); + v[0] = 2.0; + v[1] = 3.0; + v[2] = 4.0; + + double v1 = eval(f,v); + double v2 = eval(l,v); + + cout << v1 << ' ' << v2 << endl; + cout << f << endl; + cout << l << endl; + + if (v1 != 7.0) return 1; + if (v2 != 11.0) return 1; +} + diff --git a/trunk/paradiseo-eo/contrib/mathsym/test/test_mf.cpp b/trunk/paradiseo-eo/contrib/mathsym/test/test_mf.cpp new file mode 100644 index 000000000..8cccfb128 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/test/test_mf.cpp @@ -0,0 +1,45 @@ + +#include "Sym.h" +#include "MultiFunction.h" +#include "FunDef.h" + +using namespace std; + +int main() { + + Sym v = SymVar(0); + Sym c = SymConst(0.1); + + Sym sym = inv(v) + c; + Sym a = sym; + + sym = sym * sym; + Sym b = sym; + sym = sym + sym; + + c = sym; + + vector pop; + pop.push_back(sym); + + MultiFunction m(pop); + + + vector vec(1); + vec[0] = 10.0; + cout << sym << endl; + + cout << "Eval " << eval(sym, vec); + + vector y(1); + + m(vec,y); + + cout << " " << y[0] << endl; + + cout << "3 " << eval(a,vec) << endl; + cout << "4 " << eval(b, vec) << endl; + cout << "5 " << eval(c, vec) << endl; + +} + diff --git a/trunk/paradiseo-eo/contrib/mathsym/test/test_simplify.cpp b/trunk/paradiseo-eo/contrib/mathsym/test/test_simplify.cpp new file mode 100644 index 000000000..73c920f2a --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/test/test_simplify.cpp @@ -0,0 +1,21 @@ + +#include + +using namespace std; + +int main() { + + Sym c1 = SymConst(0.4); + Sym c2 = SymConst(0.3); + Sym v1 = SymVar(0); + + Sym expr = (c1 + c2) * ( (c1 + c2) * v1); + + cout << expr << endl; + cout << simplify(expr) << endl; + + Sym dv = differentiate( exp(expr) , v1.token()); + cout << dv << endl; + cout << simplify(dv) << endl; +} + diff --git a/trunk/paradiseo-eo/contrib/mathsym/test/testeo.cpp b/trunk/paradiseo-eo/contrib/mathsym/test/testeo.cpp new file mode 100644 index 000000000..a15303cb0 --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/test/testeo.cpp @@ -0,0 +1,119 @@ +/* + * Copyright (C) 2005 Maarten Keijzer + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of version 2 of the GNU General Public License as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + + +#include +#include +#include +#include + +#include +#include +#include +#include +#include +#include + +typedef EoSym EoType; + +int main() { + + LanguageTable table; + table.add_function(sum_token, 2); + table.add_function(prod_token, 2); + table.add_function(inv_token, 1); + table.add_function(min_token, 1); + table.add_function( SymVar(0).token(), 0); + + table.add_function(tan_token, 1); + + table.add_function(sum_token, 0); + table.add_function(prod_token, 0); + + TreeBuilder builder(table); + + eoSymInit init(builder); + + eoPop pop(10, init); + + for (unsigned i = 0; i < pop.size(); ++i) { + // write out pretty printed + cout << (Sym) pop[i] << endl; + } + + BiasedNodeSelector node_selector; + eoSymSubtreeMutate mutate1(builder, node_selector); + eoSymNodeMutate mutate2(table); + + cout << "****** MUTATION ************" << endl; + + for (unsigned i = 0; i < pop.size(); ++i) { + + cout << "Before " << (Sym) pop[i] << endl; + mutate1(pop[i]); + cout << "After 1 " << (Sym) pop[i] << endl; + mutate2(pop[i]); + cout << "After 2 " << (Sym) pop[i] << endl; + } + + cout << "****** CROSSOVER ***********" << endl; + + eoQuadSubtreeCrossover quad(node_selector); + eoBinSubtreeCrossover bin(node_selector); + eoBinHomologousCrossover hom; + + for (unsigned i = 0; i < pop.size()-1; ++i) { + cout << "Before " << (Sym) pop[i] << endl; + cout << "Before " << (Sym) pop[i+1] << endl; + + hom(pop[i], pop[i+1]); + + cout << "After hom " << (Sym) pop[i] << endl; + cout << "After hom " << (Sym) pop[i+1] << endl; + + + quad(pop[i], pop[i+1]); + + cout << "After quad " << (Sym) pop[i] << endl; + cout << "After quad " << (Sym) pop[i+1] << endl; + + bin(pop[i], pop[i+1]); + + cout << "After bin " << (Sym) pop[i] << endl; + cout << "After bin " << (Sym) pop[i+1] << endl; + + cout << endl; + } + + cout << "****** Evaluation **********" << endl; + + Dataset dataset; + dataset.load_data("test_data.txt"); + IntervalBoundsCheck check(dataset.input_minima(), dataset.input_maxima()); + ErrorMeasure measure(dataset, 0.90, ErrorMeasure::mean_squared_scaled); + + eoSymPopEval evaluator(check, measure, 20000); + + eoPop dummy; + evaluator(pop, dummy); + + for (unsigned i = 0; i < pop.size(); ++i) { + cout << pop[i] << endl; + } + +} + diff --git a/trunk/paradiseo-eo/contrib/mathsym/test_data.txt b/trunk/paradiseo-eo/contrib/mathsym/test_data.txt new file mode 100644 index 000000000..a8c792b1a --- /dev/null +++ b/trunk/paradiseo-eo/contrib/mathsym/test_data.txt @@ -0,0 +1,102 @@ +# 101 2 nan nan + 0 -0 + 0.1 -8.89903723981037e-05 + 0.2 -0.00122598240763888 + 0.3 -0.00517587564272387 + 0.4 -0.0132382052428645 + 0.5 -0.0254643081877282 + 0.6 -0.0407070337997998 + 0.7 -0.057285499199392 + 0.8 -0.0737562490233578 + 0.9 -0.0892727708954409 + 1 -0.103268200413493 + 1.1 -0.114577577792354 + 1.2 -0.120446083316857 + 1.3 -0.116000062935524 + 1.4 -0.0946298417869761 + 1.5 -0.0493963195458011 + 1.6 0.0248409598316732 + 1.7 0.129207388804052 + 1.8 0.259260510831339 + 1.9 0.404709502287215 + 2 0.550653582802201 + 2.1 0.680124882844178 + 2.2 0.777313232294796 + 2.3 0.830628236863242 + 2.4 0.834788256127692 + 2.5 0.79140362503436 + 2.6 0.707953643967287 + 2.7 0.595509207315954 + 2.8 0.46588939354196 + 2.9 0.329064872475183 + 3 0.191504886385553 + 3.1 0.0558518299407852 + 3.2 -0.0781019284912663 + 3.3 -0.211542824409141 + 3.4 -0.344524221510933 + 3.5 -0.474312294176053 + 3.6 -0.594727989459508 + 3.7 -0.696713721292122 + 3.8 -0.769988957905497 + 3.9 -0.805344773512717 + 4 -0.796949283133396 + 4.1 -0.744036874310458 + 4.2 -0.651525836186196 + 4.3 -0.529396820025977 + 4.4 -0.39098574050144 + 4.5 -0.250612439788816 + 4.6 -0.121113466670896 + 4.7 -0.0118426008551395 + 4.8 0.0724429930487275 + 4.9 0.13163323998176 + 5 0.169341449166714 + 5.1 0.191319990014267 + 5.2 0.203657703492626 + 5.3 0.211210264725322 + 5.4 0.216611758596317 + 5.5 0.220036646440173 + 5.6 0.219677788419796 + 5.7 0.212731354762643 + 5.8 0.196574232374672 + 5.9 0.169803441763318 + 6 0.132875383837662 + 6.1 0.0882099910986659 + 6.2 0.0397733622937463 + 6.3 -0.00771703924831375 + 6.4 -0.0497388405970527 + 6.5 -0.0828196592845663 + 6.6 -0.105101954751146 + 6.7 -0.116508794142315 + 6.8 -0.118508967610477 + 6.9 -0.113576955648085 + 7 -0.104507044103426 + 7.1 -0.0937591677397028 + 7.2 -0.0829871341075209 + 7.3 -0.0728391340503617 + 7.4 -0.0630443677389944 + 7.5 -0.0527284491080759 + 7.6 -0.0408508284036276 + 7.7 -0.0266394584962638 + 7.8 -0.00991225704809318 + 7.9 0.00878546797299183 + 8 0.0282459694154097 + 8.1 0.0468334978875681 + 8.2 0.0628175943181446 + 8.3 0.0747179317764707 + 8.4 0.0815794072993519 + 8.5 0.0831208473565567 + 8.6 0.0797359724522078 + 8.7 0.072361534724142 + 8.8 0.0622560784562081 + 8.9 0.0507477567273995 + 9 0.0390091892966309 + 9.1 0.0279034956336959 + 9.2 0.0179233472968783 + 9.3 0.00922050032813963 + 9.4 0.00170282350837218 + 9.5 -0.00483635091477891 + 9.6 -0.010593872761556 + 9.7 -0.0156676782318098 + 9.8 -0.020019888098685 + 9.9 -0.0234934811028401 + 10 -0.0258701880584331 diff --git a/trunk/paradiseo-eo/doc/.cvsignore b/trunk/paradiseo-eo/doc/.cvsignore new file mode 100644 index 000000000..23d7e990f --- /dev/null +++ b/trunk/paradiseo-eo/doc/.cvsignore @@ -0,0 +1,6 @@ +Makefile +Makefile.in +eo.doxytag +html +latex +man diff --git a/trunk/paradiseo-eo/doc/CVS/Entries b/trunk/paradiseo-eo/doc/CVS/Entries new file mode 100644 index 000000000..50869ce7e --- /dev/null +++ b/trunk/paradiseo-eo/doc/CVS/Entries @@ -0,0 +1,10 @@ +/.cvsignore/5.3/Thu Dec 23 17:26:39 2004// +/EO_EA2001.pdf/1.1/Mon Oct 3 10:06:26 2005/-kb/ +/LeCreusot.pdf/1.1/Sat Oct 1 11:59:13 2005/-kb/ +/Makefile.am/5.8/Fri Sep 24 15:00:42 2004// +/eo.cfg/1.13/Mon Oct 3 09:56:02 2005// +/index.h/1.8/Mon Oct 3 10:56:56 2005// +/mainpage.html/1.20/Tue Jun 13 13:35:26 2006// +/publications.html/1.1/Sat Mar 25 13:03:45 2006// +/sflogo-hammer1.jpg/1.1/Mon Oct 3 10:10:09 2005/-kb/ +D diff --git a/trunk/paradiseo-eo/doc/CVS/Repository b/trunk/paradiseo-eo/doc/CVS/Repository new file mode 100644 index 000000000..0a569cc73 --- /dev/null +++ b/trunk/paradiseo-eo/doc/CVS/Repository @@ -0,0 +1 @@ +eo/doc diff --git a/trunk/paradiseo-eo/doc/CVS/Root b/trunk/paradiseo-eo/doc/CVS/Root new file mode 100644 index 000000000..4cf4ab187 --- /dev/null +++ b/trunk/paradiseo-eo/doc/CVS/Root @@ -0,0 +1 @@ +:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev diff --git a/trunk/paradiseo-eo/doc/EO_EA2001.pdf b/trunk/paradiseo-eo/doc/EO_EA2001.pdf new file mode 100644 index 0000000000000000000000000000000000000000..2a3116f3d2e3664d1f9bafb5ed766f09ff484932 GIT binary patch literal 205478 zcma&NL$oNt)}_03wr$(CZQHhOTW8z0ZQHhO+r~S$>VMU_jjC40n2n5?F*4VPZ^lXz zd0|l+23lrFlF_T!0!UVTdVD)WOGs{RI%yMIGiP&rwttEuov4Mivxy@U@|o~>A9hH{ehveX+%qVO&Jg5)qd=LxjVfRaib{F`$iXr){>`OX9>e+3hI zUd@`k!;EC*V&w`w!bw< zNzv-{R6RvBP)({SYd2dKe-sRuB)?f}oG+_TRi^4TYF20vMQhV6*XVW@*^0b3Z0wB~ z%329;Ug$TqnQENBhv+BjC^?&ahfF01Zgna;xqNe8qiiJzX5+pN7AA*I867H~2)-!N zYlx)ecYDs5D_l-{8qOIrXklU6NF(viv!E|OaI9|B8d*mPHSernb?jJ<_}L~Z1MA(h zmJDAa*xs>d@hR)O`lLOASN~yM*?$GG1!wIPG|a5*9(zJ)d={0s0JpREB4jO@#(Z$; zFhKZK;2zOms&vte!G5YglhKYkhje~@d9sP}_0Hp?Kf}U|sV5pZQ+K;{A0}gU`Qynd zx7OJzy(Sh6;e`!zCIiZ1RtFEvCT6R!O}TT@mEA4W=CrvY)7scNA#l+|+N=?ClDK(G z$S=6X`5?mW{c6n3P1q+9{i=Sb#NaCCTxzc*!p%)1yM{E-Jx~f78p?-*4YAjLf7ga5 z7q*=I9r9`&`FOZr!ykx)BURTqGz-6o+Ncpw<3+8?Lq0@xOC?vw#k>f3hk1a3j5r0a zexZ=Xl)jubBhKoL+RMmNcFBSC9;JUJJMvE8C8zhgmIv5(H?4+1r*){0AqFk1xwR zn0n3xb?d~Nxh>TP`iBR1>$KD4cZCcWjyGe=P5&~{>o1z9lj|+f$}9pm^vBc*SGbFm z>#)#FSe6{l*VjpDqFiD|qd61RH~}v^u>|Zoa2UH&n0?0K^ZWv|m&=f2tC zu96Sm1MrK+DV#}Pz9PFvKhHB($W48Y1a*XkMBoHvCaMI(%kZF1KZMupQLs-TJe~K< zFZW~Mqu7wnOqmko$9p*%-0#|J;u+LTD(tWFv-a-nTW;?c6tITLQhJgI9q&Ej@5G5- zLoM`g#fPtk6lQ~e>TgEc5>`W6?2GFwZotLUtut^HF==*vf58bmM-aqI_}fKd9GGvx zEt?nORa|$c+6xOWOBu(-u=Um4(7VyIc;zaz7~G(h3U?RR-zIE8M7LMcES>l?%d%QM zCfu3A0!a^6qR#SD%(HD#k4e1Wkj z#oXH{-qWdjbS@fcF!=WSa&(~rfSK3eTbFOyH=b88Z97&r^7psH6h0MybN+~bGjlM3 zV@YfDKEk&kb(aG`(2knp)4_u{fy6|}9iU;TyKxp|ya?7Zf$!^Yoi!>s3Jr~4RA(+o>b(+M zxWhjF6F#*k34Rvc<(zbrhSMLa0qRwXj}F{-2imU|+(_A%AIP2yv)sP;Cq@j^tWSXK z&VqHOmv#tT4gY;VrvXGN&i@caW`mqqd2~z-=EDgwu@E+E=0&_2U7UT!4F%wJ2!i@; z#G;_caT!oJOHsSKQ{+y0Z8^LcxL$w{%cbAT*D!Iwp`NTuiJwo*3!-;a{JBsjFmA_u zoKs?{>Y-NQ&VWfG+y^X0$hgi{E#WNG$t-wCCsm(;K;9!!2Ob?C5!a;~ZZ=B?=uVn6 zem!sH@<{tj26Q0L{^mA-4QwZ&$ggepC>-Fp$6-MdfPMg>Jti;A@`k3+6#d(1)7lvQ15 z9I2ohq(rSn$i!$9h{7+@&38H7<_&{%txQHiJdKfEcE;8!Kn$P@N{|=bLakX8K}c)+ z+y?i)sdI7L5#4Yu7$kU-sOa6VUU9#l5v9xs^eXO^0*h*=vf*45j{K3_25gUK7Npv5?a}9W8B#9F4rl&2}g5fTwYfIG5J$o^_gFRf*eCmQ>UU(K6}5@*PN*;|smO1`*a# zpiNhdL&s5#T7B2Gj^o#Z2Q+SfG_V+JD^F-2#_B%QeIr_0>T~}BO&mjTlTDa&o9qu} zoua4Ty5MT6t_08SZkJw-Yu#W|{3Nj?R-Jl9z*7T3{dRHpbYPI2oMDf3vWMAZ%h>dL&Rq>VJ$)pi`K;{lZltCPTmweqaYiROK^$Gw>(lnqno2bEcZ~WT8mB7EUsWcHzf-vQ|80Kn* zU?$B8u6I|0MU^!rIa+-3HzzY~@)idAb+ffPO*%dg7TUc>)Vgqa03u+)16#90IKxe$SNXZk_Ulnl z*$55#k=hRryAsGAO)Jl-<-OQL5+ZsD+C*H zqOuf(v!8h2qe7`qgZj-~jX?9ZDMKY8A(D$FH%UssE_NO;lVVekr^{S5b zkDrg;r|Q-gR<+jwH?LA?Oe{oKrZ*D4U=LTFSZz0aQGEl-V z*8bzzjm!Z{EHxukK2Pbl+)PzlNDaFy&f~WBn42+$(UBk2hZ=t)eQBZPBP{c@u9q?{ z-%t@mkjiFZOpt}9Vt$^(0!6Q2m4UV(?>v>YSXoIQ$={nGG8AX5ZZ;t-L|gDcqaEA3 zYCPE=1oR4;Fb?rRBk>kvGn!1Q1PeK~mNqwIBVFxK1$h5XdnQy0B@?92gL^mG{sNceP2ct~{m@xPNEA zAqOt_P{?M?Ov8p^@!Xyde&TYL8{D`o86GNPQpg=^%qRveN-LGXy@I1Bj8;wmCmA?e zlGi*({^e0pj-1m*rwJ-4AXITS`{^3?#(wlsyJ=yn&3E4<^eZ7ih-wRa%ntuN{fWNG z6i>WqO*`ZZAEKAH%$8=P_ZR4sVCKTa*7$#b_21|}kozCB{m+$&jfDa7e>5g~#{WWK zCVHm-7YMG_)KS7ZMX^-`jbKSkS01K(c86xMF(#r13h)<+Mv2$)ah4#7Q>{mp$6~R` z)`S?c$YA|0DXz)%-Ek*fZE@P?+sobS++iZpV_Ymc4~wo_0e$5#a|@Y)G?ptJgvQ(0 ze(bsBnDv-(nrUFAXT`)tFQhv?wMvbt#?it8e>A&^U8RNTYI45P_QvO~d-`B_T|xLD z;b!=IJAeN-pjc`&a3upV;?&UX0jgZu`gHjHOOXd-Q{pm2{9|fi*yvQZfd(Y^9s2hi z9lGM3znrYvjLJ*XQVhW@blSz?Qd@zf@IAw&CnxH3qOrL0Sz9Ce6qyHMf)3dh!s`}n8Xay6M5zw9>`^B|f;P8?szaTzMkHBszxAIODa!Z+y5>Y(Vt^7?SE{$6R=#Opn2f+Q{py3&hQHIW_W}@SSFz#il7H z-6*S^PZT}sMf#L_40X{io){Zm3)SPG{WTMITPM9}6KiS-aN?p=TYS<3PfCxipmAkT ztrftopKcB69P0Ny8c0FxecCcra)NqTxLGpkMTl2z;8;}i)uWMYWz*F@k>F)*u^i%c zJRO|JZ(+?{w&~hzHNj$B_QNBD`HiTLg8VZ~8j*TYLL)1M2IL%Uu_IG=Cp1+fu60O* z%!2;TdxO$Q@j2dcl39;7kg{p`Ja(;tA@xsa7)dMZ;}2ZAj@I~<`s&3d?mU$7FeR>f zXjNhPBzXteQ=Ps?&YL@bw(GyW(TSJfKKQ+LrPuN8D`KJpiD2!|RqidJIuMr_bi($a z2itQOlqVmZW$j!L364 zgOkP7kbEp=_j5lx*uM}HpEM*(11H49-UIArPp0z*kM%K3sI&xP$WmGEbQRVXyD^N1 zIx`S7Z5+SUk(_LT+3q+D_BmbSjfo>WJ-NRiC&_77s$;6mGG0^3YvaCZItghQMClJC ztb+JM9^V_bKeHBAu46FTB)bNkEpiO>%S;}+I{oq5<}lEZj1mpd&>9u+NFeO%m1gq` z9Q+*yg_-)+rs3`JRe4+SRduPYWFyS5U(iDDo@8C^?;9+{e$;?c&nCE^at)h zmCo@A8X=rMnRSBc{~!XNS7}M$dz|yu??S|4jc>JqRAPX{v6!%LPK#8W=Zz)-(FWg} zlLz!ZfL?^I9Z-cKyqABe3dLT}p+d&m#H@=&@05OY0k7ulF5~J%LvpR#fpY<#hacLw zob&{Ahagrc={QQF5r{iXwgw#x7-|$V7Y5T-s`_~bGyuaQtT-)vNMsII0B9E*6sZ*W zO7_zDx{lG#-Nmh(0sSSKxzaBjhwSzUx&W{F_ivaQ|R>~W!M)35W zQbB)R3I6~n6rnOZE+genj5%oA^xzYTTFWpO6L@Bji{&K=9hO4m21N!(##UZ*(12^fY6J%eD4 z<{_C84n&|bc>V%{Gz&=u_#7C<_4hT2Qi_YG z*$MwzIc5UexkrGrw~8Qhi<5av)64BSm^xzr9GGO`W&>J#(*((Pv+|1zO+j7Qg)TI=BrSelq>xUG#B zDx=dVdnBQ~DjQzBhQ&BAsT3#umXt+KSe2Auo3;#Ias;^^O-1Dn$C8M73$YqMVZbiC zh01fVE-?;WO?9--fLPQf7`fUMN&ZmD=uixxVuTx+*4&~{7lp783S;E%v~=6O(5t}S zL~@x-vYiW=c_q5p3-Nrix>dB4aAt>G4uB*38&sbU3VDKdWD@SXRya;_iNgPnW!B#%AjJ$~|Qe<9{!htw;$*!q4IThY=!_svOJ`RVlALA$U`izX2 ze2|Z92ln4K`M_K%8=R*~+-5BY6D;!8)v6UX6Be3oa@QBo(ilV_a670Ah@PurtmJSZ zhM=snZyb~re6KLu?cKevOBzeozH@O~;oJ%V0RhUagf!O5%7dAkA?ibTcVdOV-`k!E z7PJT)6Z~4S8s_=^fu`_+qGapP0;V-Wo-mDJCa?3fX^GO<|Kx+Xa&aoIsVQmPepnPU zNrx~c#I$CJ09^AF;jeXP+3Wa zmPbOsGh}VDD&Y<8XXIqb3$xxf&rDE&f>BO$qp7?$mBhN+?~2v+IEEdE&D3F@iyNaM z$9R%$O9iURv#ArDWJVA9w2^X`$!c11PSrNCsISfXuSQ+bik65 zEo?B`TmGEfLN{B`cI>z@b(`4;y9wf&Yb$P~_KBb} zfXL-L;l^Lf%!DdtE^LEmD94RQ1h;fy`=tAq+NUS)fti~7F@d0+B+nsk7$M7UJC71^ z@H1+xLhn4$l<81J&q`TDRNY5)eS+-$(X!kpCJ!Z{qEnXy7kKOKn%^!-Mf4i#N$qB{ z@dlGbkvt><=f>F8i|o;n6O2&L5N}f^!FUz%nj>H^QV&_QJ*}b#FoXzKQqFV81VuQ@ z!T>R=YV|FXtxcs_+%W|~{?Ytx;vH|Hn)IMeEQ8%vz> z{!Wu)@p7u=7!}z==}SLLhZ0sx+g3WtCd=)C<(k5Fnme0ViE*1zx$sFc@XQ%xak(kH z>&)TRVJ8GF2_pD(MzRPY*Fzda=u;e<7InZJMC*yBEAAW;k3j+KVsfFVX)Ob~xsQ%6 z_m?F-jk_8sGhtBD5mNWYT?GD2ht95EI$!PYA?DwFAIu-KYrUY~oj2jn*>|~0yvY`* z)>tvZuRb?AU%C&_)fk%~s?|mXY6wQWU+zoO%E(>$AdWfert2+XAG6b=s6(=c3`zbX1S-mt9~xts+4-A?bl%fZWS#u`UNMjBF2*w3N0z#5ePaycUJ_1GdnZW z%}TuWtHbCJi;OUp*9z0hOzv=YL%fD`vYmqb^M$KNZ5BsglQ|!1E9N`j#1X}ROJK+< zYab(}Lw6(y6(|qczsj0J2N$`&H;C?!h6f!jo2%B>g34GHf@A^P1}G`d`%|+Ft&=?8 zifh}*zI%HH^y{XivA5B8q^+A`@nCa1cudd9IrMIHD#<92%C1~(0pwZba3Di@E&seJ znPQy{|J$1xcbm%PzhBc0O|?wJym~+@tz@~i)6gkjUo3pMQjc;h)EDQKu~cr7BF73R zzW#9-g9QE{v!J-*l7u^4^uUKcK5FnIx{0!TG(?gy^mZ@2KHjVR3WRP0 z%4orLVM^HcL-5zMEFq}H{o97wZA4A@?^G;|_;DJ#QVQ;Az>g}H~umP_%PAD~4dIaIeqpjx?Ut14Q0 zRv2uA%;vNA^IPQwfp~LFIEl~GtLI|?%m*)twzhZi^#||w4q9#7$&Yb%FZJ2-1!ui* zYLA0U60ZTI3rb-m2 zjl&O0KlH*R+N`t8%0PPg%BuK_IS@i8R4pvaZ&;v&n`Z|H0_E1Rx?OA6hm%%8C-HF{ zW~8-r)z@loIPe?Z!j~cXY*usiy%)k~@nT(S2H&L&Z*$%RTaMD=yy{7Vla7r-2i0$F zD_8yGGdRlDNoNGKj93x@{WNN{LDIf;2w2}BNiL6zm^&xcvp$nOC0K9jq3in1zEOJD zgv{Zj6!5yy)3e^$5_8^vq2~Wa$o~bKEF5hA2R2#h{~I=08U9~j^IF@&T6@(cMvLaT zj^1)CA+Iekmk?M;W3aT94!fR2#57bYjOATC20NxL7+bQ5eXE)IL#a;`dN~ritvZ{1 z+iKEg*+)W$OeT}Id}9~z0Q0Vw|64DzWu#>5cI$N~+if>06wxdRK-7UC@wUrpmgke> zbw{jLJfcbxGJ5Y+nxZ}deSmLy30gyiWOAN*-M&~+P{~GZMF&=+j9*$R*#!%pH&SSZ z_(4uQ5<+F-VE23|qNw3`0FQ~}d`SFY4MHMW^aPOr&E^Tpd>oXVqk$+o39-7j$0^dm z_~<;iP@JgOnXPS{l+edP7*mowPQG0Y!e!kAQB!(gcddOmT)d6Nw&Ab1wBRm{vRDI) zRDe+3u8fM3F-#~c^>zdg1NRBg9e@lgib{Pk)Lqa!rC7bR(h9ajqclH^MRVHSnrDV> zTSLGr|;4G9$}hbes}(0UJ6AZnB`XGRqh(f7#=jp&fL)*-3i zmiXqgij3GC6HA#iOzq8a_9)G2meuIVk2j34&MUuxj57Noecn!H*)vZ>ro;^wjE{GSIX%NuhbK4 zEo-hezA(BjQV6Up{|Etx8YzDvGk$!VIXyrB#P7CjqSOH?;!R1Z-K@0{G$+i?}DFVk5 zVQm^qNfP=ZY?V((2Ev>ei|0LVCHriNlnW7> z9xXb_FA7O&K;a?LJ^7571VeLu0YeraJ0oZ?T)NwVMG=@1peZ+sp%7$qq%!lAPj8LA zgbLvJfND@E;$v>&j7e15OzyT-Tj`8Otl}KKxAy`w25&P6A*5KITfQPs@6e44c<$c9 zZ&8AYuP_?zI2IBSho!ahFIg~ut%!g(A0I0({el+qrK55ma@~H|4qF~nGSuq_FQhx zT`yKzb#RI-Ne;_;A-pMYx}S>#hn9*~Vir;CB1vkat~FnuVLMr3Y4BiO@EmzsiZ&xt zJ4;8?;2p%jnxD<;=WzFz9$Tm-8#3gMLmik&FdT4S=Hd<*vZSPO@X$Vb z4}(dNRxm1VGEPuB#+vCA{0jlQFS5)vg%BPXe&wt@MWB=xA>0)GDwwpb;_tzm zvwMA%%2h>V#e^sY@p3r3hicAgAZNxSBpJou2Ph`%X<&6MGpI&uehs92dVlMz1B z7$+FDy?^;eQ!B9l4K}lTa=uo>WQ?E?C3a~^_nWX^m_~#=Bvz?u8r6(UIqK-L;IIgM z)iQC03}XtA+g&VU5D74U2-vbb#TDU5LDvnqwnNs($bvqWOswS8tW2h5wSTrEO-f~P z#H9SDX7s%Elx9WK0P8`%&E?Al|u;vu(o zsf=%6R%j7JwCRdmP}u9TB+jSYU%rbLiU*~}s~_Rxuv7#dS+7(v>DZjd@;P9NP^~_- zyPxU&a>Mvq+=Agj7EG;-Ps%z;Tis{oAWlSf`P7X?{)a8k@9G|bH{6; z@6aJpgDSG8-psJbF~%9QvR3k3AbCf=N(>@L!9I|JNsEAX90|~vAV?s{CA-3=z4%}Y z!@%ab6)v7PUY8FO`o7O&uBW$s!>h<)fF$(BY60eYIF$|(b5Hdb3ifFR?eqFPk=~+6 z7sVBDL7}@lukEO;oxfk8foNGzt7` z({%p&9zn1aSnNEAX26|I(_!0{eJhXyO)5^ZGV3mOscn7vR^WqB_}ygE39jJK|GbJD zVem498+pUfn|VZZS^~AxoYdQSd?9lj#sNaqXfj2ILeejQg)+1w*cA9m0_8S!`npGg zIZBYV@tKBo=v>8`*#ByNsz8&PlR2w7tr*j~m=pJy5CEJ78d5fSp8$!lm!bqPf#|mM z7#~!GpW)h)FnNPw#h`VvcXOjY61XaL@P%B6Oe^v)anLI;An^i$xwuoz3}>)DY8dkZ z0Xw4>-x>UmwORDMdhMQKZQehJcc)yHBR&@x!XzO&n$bA~=Co%!%YRwtc<~qb7Gbh% z#JrecE!xDC276_{pkiakWPFe}?0>65{m9-@aq;4t3+6u8`M@TSXb!PTcDmyu<(F`j z+Sm+}BUr*4&fh%01ZSTvLf(hpn-|cE1TQx}7N*kAo1fn?EG$$qXll^Zq@EnR?SqNc zTsk5f(%#z7-$lwl#}zD0Eo^Wg%X+FIZ+4Z3c&5{3nmjM1CKu=sNiuCE>dRHV-5v7T zk#xCK>SG;?%-24e*PYFZKUy`mE2XTgq)sC%DKZW#Wm7k>zY4(6blaUSuV|@A#v8Qr zu?^~{30VDaefyE$i7<5N;1D;F=NDy^;) zdMAM_o?v@|2ZxWB4>TR-Pr);EXlZ8->PfYn(@HZkjD@y4Dj0y)4+!IX6Js`%KlBHa z?vOg@zb?COn1<6EC#4=EFXPH}0v%FQ?=zVjIpGEo@fIT+0fMO0y{k!?GJt61=~dA2 zywc;+Jra_(SuF45plq=qrNMpN`S`l&dq+4_Vcdg?C2WM#c}WPGkcOLGEPNeYf4;u1 z+Ry)p&Vc-iQ_M98xuuc{c{_TdOlTr0?sa@OQmV&|t}DxY<7PofjM z-F;ckCg(K2FK-RcEIz7vo^%;bKCCaq)avMF`W2r_PCA~R*J@vRZ+H<*h-O-5Jdsgx z64eRmOYkILxAF2iT+}Cq2zHn}t~*bve~w$Pi?=#&ZK3lf%anG&KA(>An)Kd^w|d82 z&c4D(qd;N};sCoVm|vq2`|ddby$@RN)NEd#=Qy5*`dgR-nYtReQzyzMdrgLMg7Tvx zF`XA?&c2+oH7c$5Tow{xb>pyoIvGia+>!1kih_NHM_*Ozv_70Ksk3e`u=Fc19Sh<0 z?l|_)THs1fOR-p8O`lJL*5{f3Ww%g<@)T!H(udx^o&hQg%H% zvq3Ms{O(BF#CL{TI)S>@D(c?)9KX4-_Up0YQaEu-lB>qn?MaMl`Wvg`a zw0JW4J^3;jLPWN<;NrMexP3X2I zjE@XC*JnKH^2L~p5ptONny4288&Oj=WLR-%y34=YtR=sV{zsnfu2SWPX&{SjVldNQ zxGJN2nby33#Y4Vti!V8VLrDi{CaO#u_*qfq8+$!BcOuCxS#6=bC-Xe#{xoRKzHZCj zFCQRTey$py9}mwCV>*@teC4%d1H$p)`lkC_d6bjMT51(`0-=))o<^rzsBy@0^!WjD z%FXACr)`r~*xl}zI6;EzYbp$G!;6n|$*qwNe53E6FbKST)Xq%Q$vSy}Qi|9bMWCXk z_p;^cB`mwv=W?zU1P8kc55>2kK%EE*)_YHcChfwOY!no%{C*p2&<7ZgR}7+Wmi~Nc z{1ku4%lGAcc6a7SknApP0Uk0iO!YuT`)9iRNtCYt60O+nk$)6a1MlyG}N& zbf!#-|E4t5^wUWkhAl1Zbo8sJ984ndUyZzRp7DJu1jcIQw+QPnW!pqhVT)%|+D7J> zJMgbnp?_JzdFnk>jX8f9xwanVUxlptL1xB1;?KTx_ICT%H2h#C*WS~N_dK~YhpUGx zFWWzo2u=CPAYKgJ@SLJlj~z5I>jdqj05AakNX7Siu!HtWyLnkj_x=4|gFoF>*Y@<1 zDixb`+fiq?eKO~#uI*WmwSG1b@EBW#qov(pzo+)?Z9>jXVB+?7yy2HYa+JOlc-eIE zS?LlG6^p|Bt^XcXvKD8~$wREkSHE7;AMkj+4v~;i@AK{XVTdeM>@n$GjKPO#la0S3 zg+i-d;l+)o`)XIJn@xC zAOf_e0y$t5R8=`0U$khi5aO)!eIHknGiiZTR>4w$Rd9sOup^DU)me@Ze?x9ZKY~xz zfq5A>t}S4RzRwZu95@|GZm<+r`05H(>Bq=$f-g=K6DQKJZ3|t`=PWyW7MmYZDR=#K zi}y6&EjayQ)J~8*;AOUlX%GA3BH!%A=aXxeH;H%Wr>=eWL(%g&-RF8h`Zn=9j>t(d zO^e*y>-U&;vYN*PPVG%UPs-q-o~LS^x$gKObJ{Oz#ubOTT@*e`r~8{DDSAII*#ZeX zF$J!XxK`CdPu<>*+Npr>I20rbt*7%h7bI&vb~o5&r_lHh7meb$pt}56q$m5sY~$`{ zs$eBO+ph%HiRYet-*XQYW%(u?`Hd@%9fRG-4Y@hK)64XYG`#mH8`Bg{IZPHg9x~LL zP>4$XxJiw~wPnudt?jN%*h}3<(830TKleLmnlQU;Kh7tpJV7aACLE(*bTdLOn$g|$ z!-Q$cx75lzLPVrj>*p zpA?3-^(c?=-Iv&{kwXguBB{&Y^L6G5O%LPO#N2|eeuWR)0_A4sXJ@m@O)fcPF5vod zTIf`m7B(U8#_sj`j$#J{jybxPHGYTIvAS-k+byt9T#-u4rR&c*m**G0aMgaf2=cNR zOp5|LG)VJ5UY0F^)gi;0H2Q0ny|4Y?7#5U~*=E!d!%@i;=IU6`}655SK5W4$62XAuY$ceFg{_r_-k zm;Yja_T0l#SU1;SuO$C|V04+BFzWmjog4b*+RER~Hv}qK&oM$4!6Pz5Ru1f0(lK`G z%rs4R^|RZ(MVdOu2UHKSyn@rX39$K}HyuJQGR=7D$rPGj;<32%N3TKC-%{)lTO90< z-`ngnDeTKhiOb5YMQ#& z?Mt2B&yurJAwa$w6gNHLYQaB)fP#oIe>F>c{l58Rz4hjHkxEZbMd`(+)>Pax%0o@x zKb|A)x>)fC^RJDH(THECUS4SRwl;1%z!s56TqF0nu57-(`h zJ{5i2AD=$7Z<6EfV0+gdf#D$ASW`P4@21ulA8VhcJW6{Xh;FwYi*h1kX^&;0mVT&2 zVLtF*98XDUaeQCx8C*^_ivOzV0Y|O^+=dL~l{M}?zZW0!;a}@?-Pvvy|CQ=?dU7ZE zGmYoRBEp!XOV=_5BRKIlwS9N)jZc@5aO%IK-v1Tg{wL~XVPRnT|D#@J29E!VdYKvj z6aW5Sf36A9u=-D5Q4H4*@{&U$V&0k%4WvwPys_$8sH$U?`1}PUVKTpFbTfYOyz@en z0gy}Lc$oC&-_j)GjlX1ijES=l?|ZW@+!nt6W}Xgn{-ht7FgF*`?pN_nj(st|Hv&1XoGmm{avQE%W24WWBU|u1JicLroC~B$UgkK`^ z6G}v0T&dzS--gtimRc3 zDP79*Cs?5yMbsdrp1p|^RU=n{vhmu#dN?|d(vO33k$Lg-RF5dIMJ3D}$TP8NxuBqi zqX*-zW?)bn*pshPY~s5;ae=cHCfA3$d+?@98#!J={Z@?FQYy(T{`knW;5aF!9$%w{ zw6Z-l1CwM#8AnJKh5}QTPyMWW-5%QQSMEA@UXaR`Rv)TYaV>}++MV%!)>Y;{G@9aufj%rY*tHMZ0?BrRL4^o}~QI~S6t54_{ z)+QUG2#sY>!#$a3Y!BU=legHz2WcY-ND`U4M!wq*=cVxe-Y#g_*?;=mP#rg1(!en2 zod735`3L58A&#Dd!%-=9EEr7k!c;&6o5P7kSEeAlhy~`%Q8B46+CLqpb72JmOewhj zhtm~R=EO3bBEtfPy+@-bdq!03Ir5pEt` z$v$nx`C{CW55GA~hF$6u63V`Bp+*u9dFeodyBd&1s;MzFBD*g`ZsW*Z!l|!H!`iZx z7X7{|yt}@srKVOTc`)u=&g_au9ZEotZR#vhQ0n9)5kwfnj2Y(1F{e9?1XWdD0m z2ZSheXw`S~op&#rZNDTIj~JccucIF^aIJ}c{7xE|5;Ve~GSWP8nypmJwdtaMS4ByB z6A>-9F#)9^kipRCYOSp(Uq=T*>L8X;&thw+9^dC;>-YXH4?@&8;R)Q^X^>j2-ZNCA zbwA7BguQS7)y;^LOQhbfH8w{oZ>jaDP{-V?ltDa`KqNknkaAMq@_9l$o#a&?q93V; zk4vI_vKpwwTJXAu_p6+|+)|%Hr!-;-*VI+@TSbwU`2C6Rl0Sji*34VC_vtAmWnAKY zy&A$HFbV?rQKK#VJp7)XgG0V}btGx0>wD$V@vCCC-@Z(iH?Qk?$O|PzWJmVoXvi(L zkvf+{&Y&Q=TmyTk;ix<7Xph08yNt!)otuB4icLBU!up2KgBqOFYzBbllV?za;-hxd z)Y;|rLwM>+8=b-SAN^ljg#tYCl#xJx*2A?J49XqdGJ01Yf9~G`BA%MLwjB9{z6G2NaJ*H9DoIa1|ARr$wCDtQm ziMyh4B?mE;Fm`>``JhoZ$?NSuHMR1Y_yT&u0P>F1@*~LbZaQkretCwE zNrU-&uolSdjoWW5?RuM%-qA0!mxZFpJw^#3>hR^;8xm+HVff~AZ69xXs%2m(LkGE@ zJeM%BS2n%^TjHN9Jl@?YypDdGIlJvYmR!;Yh(h*kl{G~g9lXd1qnK%*;Tk9v&gGv0 zaGq*|V34HaY*|({@&Shum%PGTka}+Zbh74DgH{b5~(trG-wZvMEG_U`iJCEd}(3+FD8E( zPN;aXK)7Jtb7E8<$K&YR7==4_nbiWVU_|Qxr7Pc>Jc2Fd)?(?Y1pL?rC(VSTd1oGO z=z_+>(@Vp`q`7}vZL#&DK#JR(Z#MtD#n&`h%-sB&JQ%2fY zy#_CCU0k14dz;0FK9^y^Mm-eRx@cua)45e9-3cgo{UWSwH!&p)rK$RkX_#{(5vbN& zG#H+WT9yXob>(DWg|uvh5sM9-{pYLPA8wYrH;>nIrviV0wI^Y8RP0h}*-Q{kwd(hx z-pZsnn*%^%haQI#Ng|wq;OV<>>*pJsk!&E%VsWx>GE76!v{RWN$glwG5GoXPmJXLH zI?}yJnv>>bvjMjtRV%5L!BZ?s6|vWi)15{Et?!vT+;Ce|uNv zc>KK*@;O4k)Fr~onImeFWDn@ra;2gJ*6&BA1N<4|m<8Tt484jBZ+Q%~YF&q8tsn{Apm|VNzMka^q`~@O|pzQMN}+ojgp-GdL1n#9Q(aO}oL-rT4I@ zsM8QX*nvRnIW*PrSq3tQEGl@&R#0)sS4<*)0STR}wLHXq^bjS*EP9ePpA~`|#$3^a zQ-TUZUVpO>p3W>lci9#)jHHc6)Qltr-cGc1Fk+Elx0-}dStdz{BlfNwFkC0Bf#`#p zH;q}O4z9~nrdsr-$mXwbY|8(tj`*PDi zkd*p2a!NK=?xN|Kkhr_CpMCYSie@I`jJ3=HxO!Ol5Igy;swul(Vhppa(J(}Z|Dfl@|4Uw&v@s>2TF@lg2L(}xj4X6Ucy?}`nS&5lDMKb{8#2>AuTBQ% zhmve|3B$Pf$0#Ef^_80%blZz?na5NnXZ`HDW{bl6-h9}D6MI`RGcv}BBR+WnxR5Y0CN*rZEjgP4RY6;+|-JNEoh0sBcjYk5Pa(0bE!z_ZV%)0NHicDzkp4y@R80j)upwZpNOFHa`1 zO^G7Y04L}4sRMiG|Mt5nN&#BlajFz#b4X=2C7WxHX99FuXNBC#+wG5BE$pv;h&HV{N7i zPIIPfIBq-Ca+mI-l+3UMn)nG!ZL3>t@UiyFk|motg~6M@`!XopUY$>%`dihOT;e&Yv%Z91$MYKavf`GhdA|cfh*_5_^V`FtsvoT~o)G(_?j#b3bMQK=~v9Ikg;r9%CBI3FgsULVBI) z6Y(}@!)oyMliv*wu=jaET>%%$xH0% z_D*^Nv>HfNqhfI#Z@i<-s-;djl}dV&r?py3e}$B_ z537GM0GTJ-$lzqn2_r%@jgoj>ZL>%Y>^Vg!TOxK3K6}<+?r?fBIbH&rU z)91NerCzpgxt9O3pFMDj`LNM5rxr2K<#XkAz)N_Ez73iW-g(qmeaQi?MHmRfRmA<7^#+D0z_g`Dw(w&0`XtLkDC z;$KY{1Mchzo4Bc0f8KGlIFsBtF30x-3Xf(+k1L7RU+;NF=%FfW{WrIDW`hhLY6{ZV zmcsWbZbUz#)O&iBServP-HDny^n{z0=DzNf>A^0Ztn)HGqbF_n;-d+a3~DYbEoC*g zcJ079Dvp)7Hpl%OZNfy@vn{BE8*E*+J1bbaSMqnTB^h@2e1{-=u3skWdKhf&xTdl$ z&GjK6Htm}fTKL39&{@aGS&D=h>lWq32ei#u0iL!ZialPkFjG2}b>#?#tjo3sV}cvG zakStdoXI_4mhl41g}n7ila2mWxTFDn0XTq!(j^3#z7yh%i%IR$5={|rz(!5#3n3DO z6emFpqcBGEXHOmp`$$u=fpcvFlx%jkW?fz|WNEcUfNr8+{-fN6VW*0a8*xDeDusSq z_bOmHq`%Tft0$25eYDIOIu(2EIXM~nE-@8kzh~p{J$3tPvJTR~13xWJ0n9~biRfZ; z5NBPHIce~Dn6zTEZaNWq<$J9|l!LN9cvw&M+}wQ|1vhT%>vtuRD6d(m1Lx9oUA@e7 zT@F?c+BAS!@F#ZQPQIrbY_SWn>2>6)slo_MBa@am3N~I0F%DOH#BC&p9oFDZ`b_l@ zvzpsr{9|SK(_hFQP9z-JqmUUwK;3%&%mrn>>P z1-cJVvImjFh2zhUHY$WTSi6xUNRL-?817ea_BpZSY2m?z1;~c%jj;h@?R^3GKp$gL zpbvP0`FR)}12G@>F_?|rym0&()MzJvILfTS!FizD;m^X9hC;-vqh-TuOloZmvt23? z03F+`jgIxF{r#jJ4ltSX6->j}OO;6G-&o2L?6L$A0?D1ntAo~#p7b@ePDz5tNN{9{ z8dMI}+IK?HD@QgU;-yGhQ~lru+kBzg)EYa_3rO!a#uYE7&lBIa3zkYq??M)w0^rSL z(`xsR@F0)2$(-*AMwv4PH#zPUK zrbs3CxyXGyJoXGPXOQt{X;NlgS20bk=d7fMo-B$L8U@f2)xsAXx26D2S%k0!MofY+ z!Q%yudhE@qLl_u>Lh0I+#(?cDr=+V=rHKHhEvCsaP%|df={s?B14LUBy>r~KB$`Ul z{`NbvKIaDoc+=!}m}&+z0cNDHen-G$J%}7dL#N{*K51qGH;sFjDWw@vh*MdhK*pm8 zeI#)|CHwH&N_Yuuhs@`N?f82hNK*7~yr!U^DM1H=y)K^uSWw56&y>O7`Ci;B%q|In z&*o{y(>4s3f{>dC*3J}(0be9SS2`{q0ciqi4r}0P1A7r92$O_K9OZ{w5pNn+&1Gne z@EH+;md@;mF_;Rkz5?~z0Q8GHt%7R~{s4n-JW=0w7A`L8W`c_ZE*+J`d>;Z&h6Ij* zGN|%%ZFM|@8396ElG1nk9Yx>#vAl-nI^`C7ON?R19Cv|VEiSYOYbp*p5rqgTPyHTm zX^_b81GK;F|5*tG9*CD6WN$opH$EXd5gw1SH)Y#@vLa|b&+j&3JvZIns2@F2a934e zP=-3NP9)e?{-dZXsm3)BipEh=F@s2F@b*vyORO^mWa$aQ1ELM*j0aJw&eW2RM%u`m zTF#X@%T!AaDFY$&s^{U{a}jT{jwH`rGEd^vEX;5}$=geH_eU@D`96VvjUR-h{HzWZ zr7GTJsd$hk!1i#fnTNq>;JTb?7FZFtBB=jQ>$K2LYE~t}et66%?GvGv^>`e<-l51> zH|LLyKjDs6{&AD}HO?ZwfJhQ+E*1-!k-q&mUN-Wix)d6fWb_fsV!}3%L~l3&Aw!|U zBmsfJn;#mlRe6l~eBBy)`7aaI+&)Jqc(QQvA)iojX)=X2LKc%@cYdY7K~;En9Zh(c zOjIT3P6@7q(!<2a%Kp@zS&|z&?X_of<|JOXOiCiJ*RuSnIx?X_sKVcquUF?mh!h-W zSG);}{*7XT{<|dW4P!ucdDOM`5NWt)Rm{aSvN95dx@JIt3FWBns1-J4mxE3lCznza z#EEgDfHM#!v;$kN+2k@SX|9GlTyhAW*74tbrr<{G8q!EPn<9tXIt?c1^`lP8Vf_z|)F{AY1|f z7bc8}=JFCYy3vRea@Y<`xjcV%K)`M*IxXKF3>6?WZck%C$Bpne@a4zJsxF$%5yU4h z;pm}@WdC~6mkqt|ME`mtR1Q5wU09OQk{lHh0rIUyg6g@_j8 zTNas^GM+F|dY^Ly&^CpLTCiIZ9v!#1JuU)Bw=I$_t-$jXDRlU_CuN-L>e8d)GkeJJ zI|SuHJy>W6WH)jTWpWr7A)GACR!T7TluuqV$bIOT;c*I(S8NzeNJq-z*tb-a@o74g$9{MR8f4 zv!;uBa0b(qtL9fh{75z*!&o*JAwCz6URX8*UOBDZd^xStRJCoHtDa~P-@MkGK!l_Z z1PG7*LAKVg#M25@0`bqho^D<|e4zdz%Du?3DeUMB&lO+?Tzw5BRyEVSw}O~GxCIQF zHezXT3eOmSKmr~VbgDxF+51DT>=%JG38_6?Dg=F+3N;Y4I#_{7QXs2ImQ{aL9aUFw zJynZ|ih>3$dnn7^ghEhCBwa~zm6LdHnKgC%hKp`xg&uh&cYd<8J*Q4DkbKa)ZrA_0 z#cElz+s_>_1Gd%w)~JB{lP9hOL^E+LLD@?dwulps%RC&b+9qY(H-!eGKQ8<+=JmRb z8e?{=okT8_;{vD~|J*{C>)~x-CWWkr+|ujX??QLm&|WIdjm9*lb%|*x!ibA!PZs15 z%BgWSDIlg66k3G!ZjG%$h=(Ega|~Hq#v#a8aYv<}CZSYdQC=+X_$T1f7Ub-~yCPVh zIj6nduH)HB&=ah2cc2a4{dJ(~=g{Ce#5n~&?JgNpZTyAV?)@i zoi~>pjK=su6e(-^l2J()QvazvEUa=n=DR({z-FL&1}eU_l%wzC_*Xs~{dw&57XG1f zE#gN0M&8|1d7w-ZX)V2~luHl;B6zI!p)bf-f7j=el5N5&m(F|fY4;J({*v{8 zwH@ZwAY`9Rg)>4;eMNWK?7lb4d9z+~Q^*^CD;wMso8T~WGrP>y`%g{upfaI6N#M66 zqi|=270%(`gjAL2DqJxN^M8F0!&OYiiQ#%?L%vEfMFt?3kdiS#tPaV9v8f8WV=}0N z%PoMlPmuwaAffnq$a`Ujb_e?HF znN!DGnC$&*5jLypH=CEG>}56lX5OoXFTMB35N_#vNZqEFOz@?D=Xct;f-nq2?Zq~{{3D; zRb{7o5KJQjX`^vFo3jbx8Rh*5buJtpbe0M*sh!S3y_uiOkpRzT%x`V{Af2#l6`HcJYV2III zgeh6yV=aj7ZBf9%7zUP$$jRR20Cx{~?FTx_Fx0)EQO-tkwOX|XM`}~(#{cp}@!Osl zJPqomkql|B4IMa3Bp%30Ub8Wyx7|#PL}^L{a|ql7_x;&`B)(#SMXrXbzfi38r^|oL zbq?wJeM7&T395+D-M!AoU#g$pG%{AuHDOe(rL>@3It@&3;)0k@4!ZXgL}Phqf|`3S zMRN}_%!haNl|I!v%7&w{!Uu}V%^?%N|+5f9j^8a_nouaw(Pg}s$Qv(B5+n|zUVwbXn zUKOf`9P`HTz7Mo=jpaAx!oC(BA~cOryAdu4B#WusQKr>27R@5NA^Qtpg5IIGu-Ua^ z-*5vTeyr=rSpnFUjn=sLlnX!m#O0tVirC;W=au{R@&4mG_hibV5Xx{vmt*a?)E>5s#$l+cl?yRpLjXG`Vg~ftLkA+qcACEjAglf^B8gF=A>V zqXb;>x#l(*wL$E?=oI4ev#yRUbxK{NN@<2-bvbHTY^_epYACu0XywEkU>0^ib6b(h zQ)zBOtYSG+^IFW*5tuT-JQW7^x?Q1PH#z=z_f^|#tHqMNIQ(a<{{UW*)Ma3kXG4{^ zidUxf@$_wdQf~Fdns7|Dds?+0yy0QqvBvIwU7i?KXNO~F7W2xJw4pE!T`A)jakn{( zx)_gz*{XBW)${l3S|`SMchlN*QcP6q=71XfY(vtCBqcyelEeD69!l+e%-X{_hPF-$ zZu1D-GZtSXi!IFJ$jYVBIE40ROSBioH@g2)@l`w~o6O$#?`8X0X2EnKIGJY4Oy>P4>D2tWK5T|wEGI^(S&a zC_nGtrn$Dc3a1G4vRSz~U+>?%1HXFSFDI}#p_`^Ti<4-aTftS-%ta1{6WiB8!YVKZn(-8Vd*2-n$-u1Yn8-U&T^Y`d-JU2<8z0ig#)8w7t9Uzrpnz&c1o!(Vh%xW@u?pjqnj($7PFvLGB<_** zI%P%6YrvKneDSi+E3gX}r6zp(??C;*wjMA2e&(o;^jXH}vBy9~bjY(CnOj&R3D#th zI!LQPjwkaj|KZYxyB2|>VD==1Yn0LjQE<=<%#*HihH5DtCRFzs=K$=SJbHo!gV?gTXW~nu|DT=hE*(=rgIfUc!Ba;}4T~O{=_U>x{E93w@B`vn< zO!9Db3hVxB)Sd2@vhGD!##-ta6* zsPv~O$jdJ{^?I-ZJpfkWB#?q|;m9J>oqe!5tkzVB9IVTXh+sN+_nZqg9XeY#7G@T4 z!w}=lI0@=H^*h3n6pFgW%sJ_*W8FgrB{gh@N4AA{bkL9~^w>m}f66C5R$)NE!Hps` z1;cYLV)$k~U!dO>&?T+8jy*Jv_`Z#z*Fv%EkvtV4^aY)BNLG%CosR1TNF|Ym$?idL zYesTE^Rio$;keXj2bUu#>ylxsrkdEf7~vQXOKs0s7-o(F7^#xtWlqBd zYzMC(+G8W*A6MvxDw>2uW}|DvxhU8Hgff&NdnS07lgPNDbkd#v&ab*hLcmiNaSmOGnzwrx{gFWSSRyFp6q79Au~i5;Os7-l zcyI&g7PB|O--RmXl$Hz;+y}z$T1Begl}F_u0l>#82gCpj=A!}F?hNNWPc{KoZS6de zt7UYL0(dVQrN|;6P`?N}<6be9N3-VNZ?St9PG^ z?lV$&Pi1rOdmJS}NK#83HW30OB45rW>*VZp^(%ib6{8gOS=&;sVf5KMwMsQ;YCiH%u$I*CF87+YzCV=Wf;=z@qYG1Fzi8? zT)5;*vIfeCwCi>Pl6`1W<#UD8x-!|y-e*5&v2xa{7~0nq9>{zw4sA~-BCOi z)+akR6P8z@Gr^k1^+7=A$M)tJ4t(vR!kvN*8=d~^@$v4|_iCZ+%z z4gA+K*1P@wK+9{59o!cF`{d-Ub~n1J@7AylG}ShAmE&WnmCzQ0gb{ z^8Bz!ps#!!DTD;xnRzW-v9@pwOGudcblL_;qLqt;Qw4|=^MV3f#0{6DfzV5-xg8x; zT~B{Ps70*;DYHy6=S-5XB-C9@08cRgU0BX?!PZ|{1M=GO!7^6cX!N(>asGhyWMNc| zsO9L0kvw=l)|{RqNIu_#k%D=Zbz=P0v`FMtAdm(bwg3Yv8zc8 z3}|`kvz(ES?*O@?ql+V@_Of)`uGMyWq{Sx~1L zQwkvTrhuBHMzm^GW+@kSCsS)pt`>nGGV_{OX5DEpWlT2MP`89jyKW;gD_KC)%1&y- zLlhZ0E^V2yN@PW%b?Lm!w8Y~)U= z#+UIVNPqy=nj5%}vN(+gh8Mee{hwBc3i3?H7KEVv9n2KR7A&U8r%jaCJk_V^HLE?? zi@9*5U1%vNZ&7X(l^Dh{Q-1<0!$H&hjDWrSF^|8p73jGSDs$<0-$hSh$rht1Nf48o ziFy3`T5;-S>bhwId4b3@nTtjg2KHTT^c7=i1b&t-%o@PAOvk83+>mxhk&^PhjM*XX zK^&8^W%b245Vedgeq)-Q=}E5vDz-T61)rhQGLnb!U^%ugk`?4I3b;U$NxZC+7%Lju z$>dx8B)))B0$?I!qtdD`b;KN0qHy_S7>|?{-8HkYKBbL@YTi7fZP)HY4h7 zXB+)+8I-2#6pE!!hVurNszVD$yyzlf?NOYphrzhb3Yo6YtbNrh06#D5%dG+$GcV(w ztexrlaku(glhhKzY`VQy{oiGSr*TN}xw%A9Pk0JR2AQ;AHtnY%Csm{C+@r!#`F16j zy^TwJO}bnjZ|nwEoc*YKea59Yo*VE7JGMIU6Y}-kulVAO^6N&5$B&$RE?;jM8`kqG zxb>1WQ#2CFsqqObru-{_3p9UR|0_gX^;LZ|!wU`y-nt5U@7cQw?X)0AT^#p|78Wp0 zd_}Nc$*lpbO;u|rR}A&>I=cTNoMAQhfAZulq5PPI{JCS&0u2L(t!Q+xe z9Km@32d{2h%8BhIlx6Zdx@yP8m>) zU^1wjp@@;M$)7dZ;?yK_C~CFt(VC#5Q2zTpzzyZ;qJUiY0i4uY@EOF&Ms|%dOofk<{&xs_6rAm!;i~P7MK+=bk0oJ!+OhtA(`RMdi{R z-EW*Vw7as~?7o(lUnz61Hnzw%zn+KNyruK-JCKX27`HnR{%5-*=i$ipi$6>*TSZoC zBRKCZaEm0s>3o&xS~+lK6b_`vPZ~pYmdvUMCUP-JkJSqF_olrS^P*l!wTqyWa!`iZ z+-&7dfz55Cqd+=XNaU?>!@L2sGZQfE87IbF(=MY#KW%Vds<0o5HZh<6psYI)@^9G= ze|y=5Zh?xdm&W6cgJMh#dzU~@P+o}>{w2r0WXg)z2UW$QM^MzN@Fi#1hvFUn4y*C^ zMr~@??o!~d%V1_^c^OK_CnWqGL%N3+ezS=Jz6f^vdt~YA)P7TJ;GpOPT|WS*eS6#) zl78{>(XoK|ID^Oqou0`c0FXa;rw@0XZC_1U0gE{9`w*yb*`btESAc&ERhVb5hbWO% z%IkdPO}_+3eX|x^!KEYc(eJFd4Q%_*E%2UTfR5ce;Qr@`KE9WaEtnuTJ@fHXit^uw z9lKvkREURB>&8>L?-z82U%rh+qGqZ5B7)sQZF4@L=b+3Ln~jnAgfWTd;k3J%>H#US z`8a$B36c%NaA}@CRd|H&^U05*OG4v+Qty9Q_CFJKcIN+{sB`>(P%p>-ih6T2_v|#^ zQ0+)e$H*?16~+oGw9LCv#{4_{0lzZYP~LQXQOx`gI!{O2qtq;R4r8m8@?PsH6^&mi z>=ItDP2oR)55sy@C#BZLM0IymYS1in)K0=2IwBrsIp4suqk@Vk6&c=q{c`m3o;c5> zhLEA4auI%+`RH}2zMZ8#s7U9wBl^+`?uG0KbL9rM(Uh!p$BY>+5)_ zKa;vtI$ZKoM9zM#O$b{QHLO!b{>WNP)#af7w8UjnXEOUd9lS&)QjyvXZAm+_tCh>r z^s>{494V-~I@qkIQC|;fR!Ex^XiTCiV%pT6R#UK0p+#f_-Cr$Ze-?O?<36u&6v>tQ zmZUgJI>Yghcs*mUiBh0gqfu)zjWSSw3j;vqvo7huLAtj-nY zgt4MmD$Y<+U3i)(QU?G$wFn|O5OPOdj-LvC3nGQpe1`g%k+Q04bx@pLb_A+Qo(kp+ zm|hf;ct+7B_D`Mo2F&r#ka}U5+LbIrWiR*82UtkXD5`*w+AV+EKi<5mIFzXX@S=*C zxzuD7=m@3yrvzj&t4yY}AeFm36aXQwL}WMmsW>MlFx%gLICm5pyET3MrULdz)&R~! zV!u>-hQKPVsBoCLBG;H1+5--Hx%Ig~4}oy8vmuQ{oRqAsmtf3ZutW~D9carc zr7AOxyg#7OH?ZIs=oM!DME0eFFutpF>=uGK?fnH0z~-Fo14?bPorXe zD7&aXqu}bX%J+Z*ntXV@{?H6Vk_BJH7ksW-^8hpuMuBSruPRg`iLjTOL5__8W;`3@ zLo9sM%i051PG1Nh#mM4Ak+j+bp`TJgS0$zn=(8}GbD7H0!c|vVCfP@#r8ct;*$BL5 zP_$3O#CYY)@+dooT;En&M|Zbs+oi&IKer{5^aq{Fp#uo=&(lsA2_UEcOq!3aAvGYil&XS zij^S`E|^x;004Ke+aqF+Xv*>P7H;e-<{T-hL?ffCR8#IibXWo0LYahfr}|7 z29vQbG_Yg8=+=4O3X`XUZYKJf4VHd9DIzbg7?aRpDdGItC%*RQCv@uJ;i@DHYm+b` z{E&g%*|;{4(fm)YNLty;5Xu+cvU9&Tw*7SgFb4n}hiLA}FomL?DrLhr4geEO#|x=` z97n8el+&=~C%?{x?L%Sjh5H$%p((mBx)DIbfVYL5mN`7$9aysLDD#;(P$Es^YR&1v zp$buDl*6Wde;BhK809jxia88D%}LVrm;f=6RxdJy{bz;sA;NJH+(46%63y&!nbg5ybLt0F+)~qc? zz;=#$vJ=Vi5SsE1gjER?95>5hh5FIrwG?Ck14?p6nJgzl+H|u)6juxqkj7Hk zy(;0K>EzR*7>vLPXyg!Dsm180f5uOHjfP0Wy~5qF#~Qwh2T|{nl%jwCUUR;-ZUdhH z{V{aKOsa#1 zibRPdk$zD~x{w6Gb4h`#?4llE{`A(v^>EFaxIeyr7hIfg1P#Hpn#-EFj<9H5tt+Td zBp-|FD9IN0%FxKzB(jbiA#$GoruWGjm3O9Ntvy|A)d#EX>(}$%MGgD$ri4Gdw)Yo! zirqjw_rU%TvP2yLj@AG&^atUFCE$x=-3~affLe7-5FYq1`9&?RWT(xwTQA;WXP)S+ zkVOgL{ar8swf~_Q#5ZYmu76H!|Ag_;_EWRr^x)c`Jd9j|U?SW<@d3pj3B?!2vruO; z0=*B--7wmk*HBbQz8%$Li1U2e6_xPo@6R4=Jn?jGbwUh+7jODT85>W> z;&0>j!-kwFpKkc=Y3xfbH{Q%f?a9bq$^ObUYog%RAv-)+{LMCa2iA z`>z7{-OvP(DtfY#!VaOha0BPMbnt$Hms#M>OctIUrSJe585rgRLJ0trK6u@*@# zW_WIDsYW3TY=~SB)$ot3#tcheGgJalZdnj>Zl3fw_@E9^u0+tKfLc#PaSy2+G6U_; z@o?~)&Et6ZTPfvEn*++PU{+ehcNrY!k7jRI^8Zrk#Bm?7d8YgYEmJ!m%9p`yHbk5P z^(6AYdbOtaQojmR>}!Qn@052T%($%Z1oc{x;$^KdKm+uOb@iE3pd^3?{flR=qz8_c z$4x{fh#pglN0-EdnOnh(3`MvUYEym)5N(HSo&F>3Y4-_o-5cdFvijsWcH?{>4MXlu zq!3V=x41C*Y{;&4nzq+uV!Lak;dl>fTXom{CiS-deb(#sv}Zlt4}a}*{x#sGE&9gR zmv-BvqkG&^_r_o8+4r#batC7#<2CqzSrwFwTTricRkm|szdji%#k9kD4WQQtXN-lJ zgRc!2Ha27mjBg0hZ9dz66%}l_>LhLoYJ4`q^L|c(q5AR?IDM9)Rs{%(PfAp(k;Y@^ zWLyDDWGm1gT}aS{JEyjssd_Of@#|0PGW*q*bt)j1jjO{^z1r?JhVI{Vk%leu5Swfx3ZXmI+u z8MKy1{rfwStn(Yyd|1wHlGFz79V?`dWOoJ2T~3;*+F*j7t3aR&Qk||v8UNLUdj^SP zl13RN%veY_C^`T$tUM~cpz7MuY5P1hrMi)j2twyzEEbPrzzJ(hN_;rRVt}v6Ti9%4 zOK6jVRA?zXch*4EU(K8(=g5VejnoO)ol^92V?ibm67})1Rl?8KNOJU0(Fq$Cg`I;8 zfpvk`RVt(R1tn}$IHob8cdjBgzU_tcuxIZUB#u9br3c~ ze(z+!`e<(JVxr5%2$&fEQMpoz*FWEW-(cvpVPhFx55Qk9ua@r%(b?s5&Vd8Wy`iCmL6;{f}@C{uLY4krKOolN8@PNHt#853tA4%!P^TaN6U&x87E;SNF` zWD`Ij(jw%6q+9EkD|84fVi8rAG(@7$ZSmntFpJvs%OP3%9gKBklfC%#zt~0L4o(WO zg-Set*ZLiDCsq5keI`PU`~4~Tkt^`QgP~iM%)hL}1BCe?MNFC1Yi5Ow$1A@x(_oQKXP+f@2+0oiC$JrF%dq@2b`1!(1`5h$kgk3TK zfHDh24I-k>6fUPX@Q!#kn+yV5+iiC}8E-S}d(%cEH+d-AzTZYaKdaolDY=na`gB%AxhXncnv!`^X)r~ZF=a}gx)T=>*8}PctZB0rE!MQuURK7D=zgN5 z>l4o7yWfE?tyFU;lMg@M;50Skz%Hze&{EaIZ%UdH6)}g_BX3nr?|;8d9e?GMbnau> z8MBtoGSwa+2^VO?ecuc_%)Zf$2jHDN8>n-0rN-)xMD)owbQ5ELIZ8;u@DmV6FOe`E z>DcwuE-$xzy{pbAXSRIHJ(8$fBqb>6=v~g9HyOTRxoHzC#B|xnP?$ElUeqOl!D;q) zA1?_pe*yd0c^S2{YG+HIJ2lmgEHLzDXU?|Hkcew}H z@C;-|?gqV^7{$V4;5MblsfE6A)eg4<85WQ(fnL!reF_zyb6)i;_D2AX~3jEOf=PG9Kp&4dQ{k zmtJeEnC(m)FGT~Kry1@JnIp1%$B0GD2GG0Om$OTpcB69RyEEECDHNR8G#l^DUhlC@s`&*h8t@Mw1q|Mdyj$Lgq7>-zi@(2BokbxDK0p(bu9{8fZV#@}aXQ+lv zN~7HehKii%!=2%sFdS=*X?pE?3A>m~^Z{lxZP1OvX6+B{W|$!o^@$7F;)#I2xW^TR zb}{ChKwJ}GAjL$zDpix?j`hhwjk^206)LFpcW#1EPy24(eODf%@B=VRl6c6^Sv`j< zR?E@!vkgb>bSXQHc_9T=knOD?-|2GsmebHGjZ@n+J)(Hzl=fhNnQ4H(GshqZ#o^M? zCcQN=Lgn26#liP$G&J(5^GcZE7nwgu-%zy8F<9~Q&0yxo4NUR_Ui}f=p*GcsP;hIs zLb4Mz0p40jUqRYlr+GZ!K0+53!0wB{zKQw);~(hl^@Y(-yx<9NQ2&=Dbs zyoDHW>3x^PQj6LC6c4&;r8^Fh0aXe(9_lQqgo6+0=#rXd3h zbLcOj4iR`M+*APd{3Xyi8S*foL~-Fr9+-NQ?o3u?IaT55M$$JwX*vRxNB?C2-@%V{ z4csJTFvT2(3j#7y?{|H{fN7Hf@TDw-kL zkV#T`&A47%*pQ&3BO^)*njDie#F-obfO`6qp98)UrklVQ9?BbmyW{pv$UlgTj6*RG zDaq#vnu|-2eMUdDX5BYHj&a1bHLR1fyq6vn&X9nCPqRcUOhke#bL8JzX^m_zZ^@V zI%qdYCfsO)*G+*4?GcSrX{86O36QW&@;z=kR$U_QuN%s2T1*zg<|`;QL=+y^(+cD^ zEPpOQNs$MXA6HvJF9%V-Ybe48s9+f6fr=x@GzbcTftAb_u4YQD zk%GVYhJ9-?l|)_cE6BDA0z!Wi$CRk%WE_d&rN?$XQA@?eDFUTnZO0hQaa1d$}ggGX#3ntfCST>}L zkl{kt?9M~s_y~~x-9wR=kzKytY(@1ENEf-9?4du3 z0+xvm6iP@v-ZHAELD(VUt(h&KL<#jeN=(fg)fRnpl7TPn3ZbF7sv&eFVd@lkYgF>7 z0=Lwz6Qh~5%f~OTa7LdS(tiT<=LaU56v2^EHIn;GtD-giUM48ofhZV8o!S&i(j`71 zWCd0eg{7yGD1V=wM=7;0pC>eSi@ z31o_f6xR)|vokubyP>ZJpirrWb^Dos+y$#8HIKpo2KhgY9}v1>Fu8oh!)elNc@3;o0ye5-%lUA`H| z{{FVu66G6<*<-(ixB=wXIbm50Zu`lcQ6HYB?Utgc#P1MH-`&l~G72Ov~|5L(5b zfc!{F%p90LmD#rNQVjQ^^XU@-^B#sk_b>^!XvS3EltNyfSk>L4O5WsfO$fZ+tWy4R zu*?gZkmT_J0f$Px5k7@%Z5kqHV~x=F0bE2arlol!BqP_@8V%2faUvDU(Lu8nIOalD81D#mM?SiVMds3gLke9I}D-} zAwSC`B>_XQ(l0O#RIJ9lKN9rJV2doo#3U~n0axGSVz-;9-pyp^#JLEJMAWh@Dz6jV z>B_|7kh3a*tWGxri%cl*nt0oN_cd%w73HFKbud-D!KcQuQcdX|*}P`6g8a?TaSlMI zY;Y=(6tG@yUhf+4P`9~}+4bhrV}~B5xdL#U5v&_3&zg{7pdp*%S*m9u!&$A#6Gdq3 z>Y}usJTbBdGM)O@{#L2oRXunG;!2P@+8C{=$)V1vxF8y`BTa7NZZy-qXJBe%17afj zNR~|&Ghe?)D<;CWr3WFe3zJ|8Ab$#-SylVCcmDUW>IKt-%2ax|jjyjW;r+4d9{X`Q zZKvS(2szQ-?)kyuUAm8*NEF{}&~965?>sK&@AI$v6Oa&r@!4MqO+uag6C(YlXq!{- z=#owwh7e+*SWZP~)B1y&6jCs>N?`ThL(0RKYp2%Dtj(#LFGKu$HB!%-xo)H4%7e_X z=qv+9z{)Fe6AUkW$v&BIoRG6oqOv87yV^~)3oov|S-iA*1>ni5Q_Gkw%_wp0h+eW? zf+zbO`UK~#jg*(riWh*a>Z?H6QzZc@DXkRpEmCelh%G?f>pqnjSegq{y-xMH65DTWrSU)e|5CjzlUzzJ2&S?Zh-I*i%@ z3$^@n5x;5mG;l@awuvtBxay&= z{04dptGGMElY)~ydGq48Ru3r0q;trA(~thV1*pcFyR9@tO}+zqO+cnhB&Z>CiRg5` z=s&lsL&N;z>1uy;u?kAPz235z_27Ml#YAVZtwu$jI2bV+yFmU*ekZ}C&N?9{mW^`c znDb2TqUDqhv7@(5KrbN5MR(gD9$SO(LeIl|76JPEe6I|(ne7gel^1UEGI0`_B zD)BF3?-s9jp`koBa1@NldWmxog z9%3@ssnoRcM6NoSjwmUf)&?bWf*Cx4`222(x|M?e{l=GfLALoHfd7B6{Xc-u$;SDA z9ptS4X+-<4)BjGVvoig!7GmUR&iohP*Xf8wju6mJQbb-uBpQ|!OqWcPs(mAjY{I1I z`1(tVM`&|tONh)I#}k2(fG`B+YGR;j;|CU^19NuG4*2;8<$B#$@UF@mybuTc^$$00 zhAWw!_Kkm{SaRJDx;gQ(JL~zFvGZlNYcmsqew2pzyY8p=<819^?Il)fHmj$`pX1@? zb8YA;maFmCeHs&M*l#@QQOKJNEq1!vkL%RVjM}qOWhIfCbtsQYIj&2SE9)80xI6!{t|H@EbxnWJvMZbF_@&ZPvf<-JZj`Rqsz*#WT6CZGYKHMI1aF(( zUEbz=B4E?@d@Rh7T3V8#PxBAO9{-ZxCAoDVBRtvphhgo?{B>Hx!4)2xH`4`Z5&EWy z`<(cM+JX$*XXPe8m$>Pq!PLAfCuPZ037NG{O%B_X2d|nrM(95ejZE-`}<5%Ygn8i z;fQX2W2P6t>SE(#;gfuw1!_;!X%PQIn?6TD@E4mD^0Bz}s0YAkZTeQTI|o_Usz$74 z#h#^EhXuNicT);=bAmOce_80)MTZoeC~|FwefKKnaLykXu7dKPclf&Bmy&m>hvB5( zx8S0NfgtL$C=1G=>Z$vnB=%2(7C4`JsR+gbGP z`Wnp_asXZCH08GypJT z`}U3B)81zJd?PX_j3-@-kq7zg-rgQ}B3Tx;+D9Ihcv^GU`Ie%FA=ei zCdZi<#FEBE)(aNIF|mG?E7{)rtRI~c|GKGvLNlU==%SOb^rtX6yc&E6T$273HN z55xg2tTF+OMFmFv>b4K=*5U6Wj4>1Y0h@<|Z;0Xi`V(?6JS|?YZ{XZJ=>w;&L@35n z8ANG1nivx>%gPP4o!ZO#`LZ54;fun0HC}c$9)R;u9TB@FTOba-lN4$Z-DO^GevNob z*>)sCvpgmOq^}x~ZpF=WA=cF?%Lyco5Iq=!Ymi0CU8Z}yXRGmZh6rz&L zPow6HRGvvMJ)i`tt1&`Y8{ysY_D}HS-#EY;zbp`q0?9D0j0uhmMd8kO8K%Adb;^~#l+9HzsGZaGW>eQ8uw@%<1W7)I30vMpsC;F@f<=1t!Gj)KfN2+|wtU?h;3kKDraAlB6G;5*ZEA{6@PF6iDXrm0v4bv^Dx&&)MDP*P(`AC%`QFeK=8*}|Wf;%7o z4=5%p*`XZJH{*$|wh#gaAZ==Xi<*}tmaVn=1SI(Aga-Q{=Y=(zB(=KG4P^z1g8hKc z9D~ESp2#3NPd-Xbkoy9t8YWmH!=k1QRYJwIw+T5w0yBjk{$%tKhkX1J$O0@LQr!1m zTP=`!yb6aMo14#`M-`QYk+`b!_1-N$xM^qBY*JIpDE(=)t_nrTl%({IAg;!e4O^;i zcM_EK1{aPTyEbJ|zwq4>ihL-fG*8vzWd~UhbbnQ9mO(AMa!ENKfhmv>s_29iZ2%0$ zG57e?gRt_%s*0mT0v*XOQD|KIyl~QVg9$~&x4uzU*>3s8HKrBZ-%XP{%@A!0Uqlx# zp9V@9q>pDMFX~o#e!M);Alk$|Pc#^UkVF(5 zR_(*y3Y5n%EAve~vMLX#2Q)DgrItYAl==I4n5&!)!9YIpY0CTey3#0Hng+~c;D<$J z7X)YW;g=|Z?EW}~@*W0TEN%sP*97HqEn&g5+E;;DP&oGSZMeZ+O5>Sr)xh=!jN~fOWp33cha1u9 zr~E^)bIYM5qeP2(iW;)pTjR+K#~EER4Qf+N;LT2e%Jdw0x1R6@twpxDfMq(b|XONyB&{Lr^% zULo;%Qi1ux;i#G3qeRIpQjP7?_p?lcodA=k_f;Y?*^H9S8w;Q6ZD*7Od7c zEJXxJ86pIUh6iO>FkLo?*Y2kCub0hJm$mN|sz)Ilq%4ivKixUO+!P#Yb-PX>GDCY~ zy%A)!?wpqt9+jMlKxjLk6fg*$)J{o~WIc%e;%Etr_p$e!u(r51E`FF~6@gVWW}bz= zaApwlZvq+xgo0~Hc_MJb@^Zc?U`Q+oVO!*92}vjvQ(qKp!!X>mq>5uCeyOQSkAhrZ zpI=HgES3gUNdVU_h*MeQcH*KAQ~E?$lpML-Db!bxa!bWV@CooR{B`gsTDVet%XN*d z%EyF3N)K28S)qxxQ`j`O4F_p8+h z?W@%#-x|uyRSX5M+*LBLL#p_y^c{oCGZA_r@2i>�J7sEk|2FFloDiPPA!m zx8_qjP#C6w^X*|Lz1{f+P2i8C+aK;tIUP5S{_Yn-2^sqG4Q75#wQ^2A{L(Z?=#uP1^!Z1-oyI@RjSD`s85aqCS5lfgFnM&THamu=wt5+qoTspW6 z$H7enKCaL!f#4W*Ak0P(g}{0qpfXmDUFd4Qfq&NlyawFq&UECB{tBm+lHh2rvXNBj zIhKM*Y$g}%e+|hT2W`x^Ae5Vkb^PTN$VEy{u z*z97md-crPBGEQsG+E+<2!EAloaXpYNImL-KD}a1ZW7+>#@Oh95+HJ=Q^$s$)JmZ_ zL!$DPnDvLda2v$tY7)yV;cftla|L!&?7*p-Fx5?xgJhK)AuFrtA{Q4Lwy(4`CWe!& z2@FDmYa)y)<~O;=Ej^+)Piv9@QtnaFg%tgQ;!h2X4_G#rdcG_w4TafOuK2%rYW3b- zuy5!)P)wz-#u9ff?veLOba9@3zuKnn&477B2pLh}ZLrGkL~kjN2DZ+(3^ z`W z{oi!Wj2LL9dH_Y<93f`+k0^TVf&OldjKaD$m2J`^;7ka|Ry^C-9KS+n1THeQ4B{Os z@ip5!`0~{B8!I#;Ic?q>`&09sF+$J}*A`-490;ZqSATfj>BRC5W)k5jDyE_Tg&Nh? z>C}N2gv5f-@|1mVQmJS{N#7Vc3Vh9rvThFF)X0WxVJBXFfzP_@K*{#aFc@BS6Gd3~ zf%x282dBrt_ru$epIq%T(;W^L>VYO}!6;lTo6|8bsN^=ueEtM<)Ays$C*DMnKVA9cFMqXmAdH~oZ_dJ8-voFms#%Jb{%lZaRBB719+$1;E_LK(Kb~OReHb9RnKy(i8dTw3oUuEx1$1BFs+*H-V}J`5o87uSlt^Z4;t} zJLckF^b8_jLtPJZ0QtZ^P0R&!csKUFDNkk38nN*$I;dEVw3mBnBplkG;q8PAj$od8 zl0zDr`#KBL?G_fBhf*KO`ukVF5yZ$cTWJwj@lY&<(3^MZz39K=gtR)6ao)8*1uDuMDoXET zDmx^5SKD`&`Dqnd@dY^rnNLkHPV^KuciMmiMXqDy*r0FI*d6>fXx{qH9k;|{)e3IE z@deeT8|o<@UQgOVm)MWI3EGNqZ{?bnN_AFHh$7%V*DP+-_G(B`b~DFV-*7R_+sbwM z+vfb-uAPg9YWvZ8nN_Fle9F8vTMCatZ)!ZDTS%{+szrjwi^wiCZ)M$ZBwJVRiMR$| z^Aq8QP^qTg<4g<1f~UN=o7f!;ORZO?L;YZ-b&Bm|-O7Mspu&zDlmiPP+VUQcGS@NN zUYx4=Rqu`>#B4wvjUj2YTh~Pjir^{~&bPxQBHh89!0&P#Ut_Ie=W-j-Q6x7-YLnC;6CI z7>X0dCpMqnpmv$@GnE-?z?`gd?xUXgFUbf>Z>w#(Y`zb)p+-L&7-F2r{=ZC|?S6ZA zwm8TeGJoDZN^J|OAq3PAb*eA?SBo_a)F7e8x~Ow?a29;=@d@_|uWJY@E&`+@TPj)7 z-}YM8yCw2jECfZBQb45`E8?p7DK?_rpyj!C(3sFI0@XjPi3(eiU1?@*(Xe~Z9>cMv zg|eH8)1D61_65PH&Nnk%>;f~2h2nfc2Xyka(jQ*OFgp=KdPUhmM|7QKHqaua?l0Fm zJVQITbWt12rveL}G=FwFg)Z>Sd)oPwv4;46Ad^EU(f?my@n0C?KWKu5k^R3LJXx9k zqdxe*fyI9!_Wno9d#R?ag7#`=9rh;Ju8f(sluCFLBCG4ML#S(gU2lgPO-#+4PN_sh z^pNP{D3m`!FgOSBl1qD}wh#jZefFqpR({;q5Oc2W&)U+rb8g1h8^d5AvyjJyq_*2h(=UnE^3(n@)&xP-8e-mjt>DlRp zU6`LMexseGCR6j`Oy+hMTgniv3CP)jKi<=HJ9c)QO(R6t7M$Itr+BQh_Z^Gkebx^& z10`E}Z3yt<=;r7`xPpyz_)?=;+#~O!9piM6*uq5F@zFBYM!--9K=gy8b7Ak|faI*L zh$pSA@283024J%HZBNo>Y0)x}QPxF0*i6*&V`w4Mg7-b`RZKRqda;~Q>&=dB>?ne= zXT5{tSS(@fqfj87?8?`vDlX@AoNV6jvE|Y`tdF4CvmR_vO0}Lh$ZjASZ^|jm%0rA& z@^(e^qrKQa$u2zZ+sk%)39hXa+&t2)B@xEBdCi_OqfCR1JP#~eo)#dFsBcbMFnY%C zr5JEfsRtj3U|C}ZEdN@|yMkdKB35=X6CEESV$Q;q8V;(~%1yp)$PnZsf7x2O=5}{g z^dpwi-)KWc#*DMUOxzy>agN6IA?YNPn*>QaL2d`m9M3mN@4yZX&`a)EcyBYsY6TfX zf+cdG>q9-vw)4r}0zm1u0|_N;3+2=ZB!GBA^eQpCdh&Rc z&7d-b3Pcp<7jXQwVM60m$2yNH8sJQsQ*2>7!UV&XKH_C5B*PEy29?g$$Czb{9b{uK z?E!_QAn9$pE}nu*6ycLg(}C{Cgi#2deP(iUQ!wW+Yz(`%M=#jSpECv75B!&;(e`))IA!4-x`geB09#lxK=DB=wL+kI z&j~1w6__dULV%iId|}!duRZRBTv*W){`EhN?Ur>Jhiyf=gFHUUf=kTNE6uAVB2PhI<$K`38qNA%dC?dw4tNu#EE}#~f z@`1hZi5!@{n6@t zPUQ-QHq6MgIIo8BZdhwE5AF>Kb zpMbNQ1G=cK*r~vnA{5rJSvLp|3^-)PI&TbXj0#Le43su^*~v@;kKeUvY={u|P%Yr1 zd&(YsIcS>WvSFh_PPen-C2CS7qJdD*^Hdpv((FWJ3A05D&}{QXvA?`$GduH-i!k zs5r$-8B?GW!g3WIm7pO>5{b4T+1hjMjnWNZN(PYd!Yef{|G75i7QT)tjxj4}TvA6b zKFr56y~>}cwxT7b;9Q_NG&V-p%UV_*k{eeZjYjUF&mIMxSl&yJTHAglmVsk3?LQO{ z3D63(lFZin{z`>yp!b@^5ZOcs<1iQWgo1ofl|+_6&B0ZGa|2aK8ERse3J}19KkBC| z12Cvcdva&RC!-Q%){;(0Iza4eOA}?cKZLgQKgkFi6@HF5q>S@%A``?ft3;LJC=$q8 z*LEYPL>;P-AI6?k7oG*89(b2+4uH0@wG@{28l!-3ObtCmza*LWi;wSkN>GUT4%f*f zgp!m)kx`VXmr$rfj_Nf=jG6;aXx88elUV40EPE z?OjMEjsO*O?36GB6$v-sTx`xbA zYy9bJk5c9(o(Dho`(>0Lb<82BwxK$!hn2$Tay!@AqVu<{#pj|f%kMAm4ljQ){lBw= z7tJ4cMp4HfQu$4wGwV`KqcMJWSu6;MD5-{OkllJB zt&I)`MK;Vi1P@*WVI%czB($hSTi#|Ycri4%h>{6xZylFO-9zKy=qS;UxGvI&@L%2R z7W6)~s0-ou<(Fwv`6@7r0vjJdw$_xJz3cJG)#P(jw_=Y7(SgR^75OO(V*hico{RsJ zBu&&Vf-t@}BU*-Lfn{c#^LUhWQ*u^!>L@gUx1EFeSOo~bQOEotF`uX<5XQvom4K@P zLdlnQs{`v++(@rXN#3>!BZ;|q{I|uJ1$C`&PZuqs=aIJ~bNJQLTK$2bCQcqAd<>Jr zBQ2A^6t3nw6O`Qnla&WaBn0G9SkMkI{yinzVrBEOt!D%WY5VnhwwS)t`u!_5f5`Vx zTZ|_~3tI+UpeyM$e8l@gv`@rZg=UoRRp|bsRxOhXFxJU}X~BFmlqW}=|7Vt4*Xw*d zvGC7y{DG|^K{A*^3gs8ZMK!>Ee?`U%gAoCCH3 zeI9w50;l@d7}e1Ba{g`=E>(uydnumf z@J0?UAn=Kfxz&N-H=w<)LZyHKf%-?YOBm$k@~R>ZsE-oLymBvJN5{Y-ZgnM%9-kPS zhSa^{Jom0FTrVSM@KIyBzdtr&r6|>lRKZ$c>am^Qo#e{wi6$9-%G*Dxsru-ajX54u zjq9-lhHNuTuzTGpT`IpL11?%|2QR9*d}MHT9G95A+ln2BW-8hb6So%tk9(&t``dQC zO`7L{1-4JvEvJ`-e>uja*QGUCuDyO`ca(wk927}bZp*7`-{Dc=L%m`-e;KA43sV@> z7rH%#b>oeAf+JSj_FIL&x5*0fO`9>pKDvW0G`QI_{X-Zs%*1eT^*g&Bh@5agZB_YPG*ueooV=uI~EL{m9Q z5YC!r^X_}|V4JFbdkU*pDgGRPNa4cA?Z-lBmi#Ry`3LZxa5?zSxM^~0_%pJO^nTB? zeq2%wHU9t(;o_;%&~FvZGmCro6@Gl$*rr@cz0LhyXFE_)^jY_BlH=dYJ`;?L*7)n9 z(jaTfo+q6-{!k~PNLE2AA3|(hja@iYe_X6Vc2f6JQ(ST9Qbc+BziVB+T*YQpXXI;M z!POTp*t_mi?U6S?Iw0=k_ojC34^iWAS#ZS^870uBmD&w4|2AK|QV4Jd<_ki^ zu$g-ZEAIMcOHo$*b>0&a~HWTi_Q;WA$Y zFsFx4g{Q{{yl(JJ{k+&E;mW$IlG`XY-_GmeJobm5D<(z`*BYD+Y_H`E6L}~=J8oM-v-*J+d2uJ@W9h7e@fAf%m((#Ozhv;Lnz6rtuwrR)v#FABVU( zw9WwWmLKMD2q!iE6s}#TH7;N~GU#MGCngu~?*ZB54i_^H|An_SpMwR5i@Qls4>4T% zzh?u_@Q)KJkYBpzHtP%5#H^ZWR`|u1`XDX!`*J8?C-;;Jv&9A30hfN+ZITDgJR zL$e@o)6hS1EBFH1@8Nx8{VT2Q!1g`I1Q0tn8PypQbmDo!@c|WbcfXus)#)JeSh8d#OeSN`dtF8jB5xbGf2O~hl zSKah>Z`QSinIX=40$Hu&p7mTPayCywXdhUH7`4FgZub=Y8CWQ{2Jtu}#hh15F4<#c zTlx|6CN)G@o!_~Y1J{#GVI5CoR~i?;u&UvU8dLBCY%Dv*KW|YQNL3;gFc!D>k2} zye$RaCK4qyHP8tg5e9Q&h9NtF#O{-OM=Qs(EAr7D4?-Pi(M82KLC#hov0u@m; z?b$FMkv!te`BK$k=)0eTcRwlCW0OOd2MQ-w?l_||w-k5sBVzrfIiQ_cMeM$3D%2W$U+ zE%Q&c$C(C#nE(L5xgl#7konZK`wYsja{6UI^XoZqJVLzAkE)lkZYC=4VUd0MC%i+3 z2|s!%!mdUmt_>f%vMGYXwL{R6-pJu$@dHz$@cdx7efmHAFn+p{!u{0!!0!GyR(M{_ z_`k0UUv(_LpwaGGJ>3#3XYs3}tO>U|wgtLP#$gU}{&+9EK-7gayt&nyo@M$=3hG$? zM2HQo1(va%12fVQoVXiXFK;dexudX8*1s;!&FzVS4~7%%u2Vi-jG5Hp52Eu)GbX!Ya8nJ>(Im5!nVrOPR|pdm+ACh9u3l z^W5dbXWs4ucf1m9n_J_E*!TI*4fa~zMxGVox%=qPJA~FZQ^VJ>y7q9IfJxWFveY+% zsd`uQ2<60ID`^7*@6D}ifuHB}pP*KoOS;AQ_h{R^J|X$wvq}@0_T}UpmCy#5($)eB!v1Nw~XSV=y$AgbYKO9N+4)x!7^nlGYU`vTZ@Akah;@i-3U5gd{L4Uhy z$&8jABj0T96tw5a=tF1|@q*OPu%o5Z)5E%m8g0&NtP5&?4em4$lo*qTEWV3yFZ1!K zHbKs%CCb4+zd*>E%2PEgy<9m{-Nj`&B(Q6B`x-qxd#eLIdn-2drvW~EKktwu&q3N8 zaX&L}4E4>D8wG@fM))g)t`H|%4}CvMtT91+FjOSn5bxN~{jz58W*XakXT!25`jjO@ zK{JZHiVQmb&KtN6G$>)Gk!ce@%*4%90Dg~(jVBFLa)=^M?8o5MQB@oW({&*OH=N{# z@P@Qs<~qj7)MWvDxuS#$-cF+tj@EpI5*sKInBL0UZ)qD zkK25N7gOxoF=hWNu3{j*e(w9P8tAMya_6I&!He3JyfG%v9q;`QjnzT})s_&g+>^0< zPjWvqtc=|kt5qX=e)fHMD5m=gvM{Yb+p2Jn9?Jf*>tQaLK1Gz}w0Mql?jf%x0B6g2 zfRet^yg`rMalv~n47X~Dr?*e+h7L&|L>kE~Xq?(qu?~vJEu1seeMFi26yY}DBe*%i zyf6>pNs7FMu6D@I+Av?}SeL3q`WY)LXxsGpgloe&#y0 zQjHOP%cY)%4VNjLc0WJGcS$}_-Ye|D=j_;K)GycJ$sO#rU#_NLFeybO7tc@;TJH8P zT$24XAZUoN$JuoBsF&r~QBMpp0%4J(h8c+vV&4T_aQDJ`yd z85bH+$IF@XqmZp<={jf>nUwSThs3Oy#&y_q9)5JYqdpaoGLFv)RS3Y%?wTbrq=o|>GGz-EB2YjB+d&g`sM7-9pnmS1ueg)wIdKoZEpp4Z~T}S}w zek3Fu2?fBl_|F4u$pJv(%^bS^N}Ik`ME-#wISFuv0ofSFw#Y-dCa-yRzZPaGqyG-_DJK`i)5&0ht~ZG>g zp^5vz1V~rj&IMV=-iZY}iTF0+@xNP9Y-9TjVUUG)2h3%J9JKz?#9* zmaCZAZ>9kOjJ0rkqq+{*4#HVLSL6_9zyCJK44Dk2x%iCgA{ZPR=J?$l0UNC0fc1D0 z;aT%l;Hcc!=iYF}o6!^)BiRBFMRyK1vuK;;>ZauQ!j>}$Nkp`(+N{JZDC6Hx6&)CdsFLD>z;I8Oki5|Ixf0gv&-oDP=rOgq*-aB z4w`K?Ku3@F=oNn+UMp|;^x#|#7D(@L7EGV{PPv5U1P6xFX*_DehwN=g(JdIx1_pr2 zXVoNCY|GY()%R!gmgHCw-N{g_XvD>pRKT?(nw_L<>vIA(rDuSNkwQvDxbAz@v!F<= zz@&*XGe~{8>n)dM@Im4?xzVRf-oL;Zn2`RRj16o$jsE?Oj4fD23l|#uTs$Z5eNT#%{1^d#f@A!;^LMXwQw?#67iWBXwL#0;qFPBx-7GoUU=_mY2#dhJTI$7 z@(I#Rzz~iSOZcfiiQl3ADVv+-u-#$B0ox+k)+qe!f;AVUY(dzUO49{vr(~qvD$+Co zaW#{JWghrTL;kPSr`Y4DXma$y!QgcpV-~)&=@SApvc0~3fB0B2w*pJgYsRqhq|)>K z{MnQa#-knMr@i3z=(|rFHpo0^#!>^!$$e%gHHbGl8yEfo=um-ueGSWDr_oD|>$S+z z82+)a^V4asZs(I_`dK^?TeNh}F~@yGCj`CU{pQ|%kGi&cZF_BVsuIo;F5Ga4${mK7*n zasE!_%BP?%ds(ok%wU3!HS4cSa7LOL(L@%C!gb#M?R6AR$v|g3`_gLVg*c0r)8tIN z>)YNLrkBEZq0`QTa|xPLb;~kdia@y)P$$;{T!$2as-5X2bR3Wl)B^^TsgjWh8!lWa z216{k){>a-9?Wc?DOYxw;12d6T~=f$=L!@I&*1MhNrixz1377imqE(V56TKqiB9zjVhjE2>tJD~|`0^_NUEy^IbT^~wnofXZ)J(L2l=yLX zSND8D>N$fMkYY3&6 zQ1T|m;6(U)!Y!9PIw1RfGoWUgCx+#yq;(fIIbhxB-Wg5bOrR*~j<=wTv`P#jIpk_e zmJJ95TDvMbBKG&JGNTCMSJxJd$b%z`A9~Xef=J2w7-YrlszzkfF}M??AQ}|xF~T_ ze0^40Niyri)#*mX{$G@2EKP!s55HPC*iD;!rVls|94Qi8iC8v*DwnjuCTqbh+^^6l zE)=a5!NPx}q=qy%8>L!?(7B~SUff%u?7E69x7xIS!?^{yhos60RZ<`+!isL4>QwJl zhf&(z50ZCVIft}qZyT_6F-Q(>gR5ti3|N-{3;0uvPM5DY?u@b@js26^weeI6nRWdm z)8F=_^DP9zdZW8aDF4l9q&FbeYDH)XG3W5T-@Yb8UAlpn!=pjy*X6{>BfBN zQQu81E_v^F+S#5vrch56$*;K!gkI{t5R(H=U&@5osLm*sN&=_42=Mtq-Rehsd16J< zo_3$M)Vkv+=wnEM3GdyJRQ?-!9(J%Zg}#@~74ZgQDYg`jOpYBr7D>R0Ku|CnGAALf znCW--ZHvXH9jSm?Dn;mH74b@#<#7`W@QOTvuB^$|n>)#nph|t^H|a_%9L506qy^g{ zBB=$UN?aEfF656R}p0??@-tloE@#?C;dFNzKH6r37S_03Z2FIew=c*zk=QI)s7dFG2a} zupB7m7vYi0k}BT75=w*T#>@NOj(BeJ;NSTo+~uo8y#ClH<4bO#{8$39lrTGTSi|H3 z9F4iUEA(;4iwM&fW>Sx%AZiP5I7N-vAsH~V0luMOxfAQSbNQa17^hD?P&2qlUuUSW5^D*Wa zbJ2tjtp{7%05_RjuTa<+7}RkeUc&oqr#x--0Rx}9^=8|}I#m`*+{3B82^YQCu$i2o z>%P}UaDK1Y!!`tFUmaj2DMyTqE;15*GK4)2Y@dy0b*6A8E%o{oLCsutB3)2VP}OWx&`oojOcl zFqi`5RX^7>;bPZx>u6F_N5AkbBmjTfJTXxJSTP!OCsTh8yp*{?A4~jxu#HH7G8XNM zC9gz^6EuZRUTY7Fym-*4%Aj!5xkKL~5edpJj%|!irRJ)huKw%!ZPnU+8v3;6)njp(lk+ZCSRZ?FPgeCf+E|-}M{Y%5p#P3TL(-OPyf*H`*yLdaEVm zV0fN?{ur0EYz^@hlcB*j9^M7V?VUb;r=*g&?xkXGm`@ntrFS3v-b=TBqtr@lW|^uI zZk4A-HCk^=Ykz&*W_CLg{oNZ~XP{iI%dt1L@v8Q6e1(9z9<$2g>1?;h@Wcg~^x#wr zz+4RbDmw79cS_oj@Gx@pXDr`vd0ee@5xNOgqH3#OUvdGovffn5Vi?;O>H6eWnl3m+ zPPf4yW_@H|sjBREYcx7z5J~g^wcemQ0kLdCw3^rmKq1^8dMzYfO~XKY?;<)1y-by4 zj;;JK6zESR_ZcfX0+9j9TphA)<;Xf}F+=QiQrl+t25F!nEgRn+DG-ndjbO{eFJ{V6 zG>h|f$V_TQ*D=VTmdbFpSo4||GER4|w6g7zt`!aR>cePKplF&z^YWk)rqeoh-lQi5 z#7^P#*qJ}y+-b=*?nHMKziqh`4)4D(a8Aq6J6o%SJf5-^S6GAg1VMxkm2`-6VTK`p~6`rsV0@$027{nvwIz>CN5E>$mX6^jA4OR z6|7c>|MKF9k}Mk~36a=%qFuEOamZvx|E>#MvrV(=F`5r1aa&tf`Zisu(Oaq>NU2(| z;5h$tGEP)gC|{DB>Gu0fgi0-1I@(_CQlZMV-sEzjmgHA%+FgG>u$oCa0PFZS3e;~4 zNy)Jsohd9yiuHTgRHLOm;=3l36Qn5DDywEs%A!x->GUl z;j@05P*!}puf90wQ8vMj__g#RZ-~#SrS)6-B@zp2m4MNq@Rv%(Q*uzq!*cx};W>Q9 zVnH;j2~(1_(p}mF>bA+}33Vk-oVG>VKv;d5lYcx&`FM5UTQc6QlSSKxPQynkLedA;n6k!{O_&1p z`D1YpJ)lhdqVyc;kWL==tv2i|NPAtt#7=Lo)sVu3$|kPD1@>H?-Sc>DGH;TV_Hkrv z<7=7=zb&uCt1-DDhtYpP6$Kt(vi6o^d>RldunPWwKBlq7=qZ_$zafbVcuhy$k+!P8 zr`jmg_ntW5rlu*h(|*=}T5Ka#E-tn*|1qTQ(w=KFi~%d!l}`DPsoM3n$NR?f+&hUh zd8f*1J*QzrOOCBz2A!2tq2K7UNrMgWozjG-Z2qG=AsU72q7LE?b+Lg34Ovs7<%m%e z{AmHVwE!QhWX7;QRmDC%^Ktw}y}e{HXz!!OXV|drbTVnwy++h5^|YJC32FThIJ@{1 zFD^rFm~UxXGUVf9^EuPMa5yIB&-+p6(Dotx+bOH7dCV*q@Zqs6EAA}VvMTPsI~Jmn z%{X!nt@JK46%Q`ue(sVp`nK&a6m(j09nD6t3d20tuGzIX-fX_rr}=5}S@dDFr|tsf zg*}JE?_l@rF8%NOSg#J}YoFrR@o4cgm&xtiM@r~{(JpOKcX%`l(&z+Ay-L0MX4%fb z8}ZdGh3E?lIC?8dQ|RfAkDcQ+ISeSRNoa>C6S!g1)8`EJvC-*RQPPm)XYyE)=%wSj zC?trRE322?QK=`PMqh`t3DqU!i z1)T9KY@KWcaJ!|i!~wMazx*l_2h-6x_9faX!<_Hl^p{ZSLm+Qw9zDOfR!LL+sFlkQ zoTa4px^(*gR(JxxT$vs1LF@P{#WT?<9s#{~%-Ch}a;u}MKpeh7%BoVT%&f|lL#Zg~p3ZmQKJ>>GZt0k}{QnFKIg6qE zZ>DmgDB@01*_14Ah6SbO+;1;^QN{+#|1UfJFCzLMO3KR2^55)~jqyL6^#5e1Z2x6x z`ybiqi1wwu_NgZ%8==!Qy`c6S15Y~>4w#c`#jTD9XOf}=E;6G70Qe5UUv6YFImNlA?SraL4NzG z=iEN0kDi_hJ3a(OX@x6|cXy zR$fq_dsqwguaSJOF5xe`K19y0t*>^z7I#9NGMgxHMtp!4rjvv*&wfYn@h&?o8Z7{rw)CEb+?H zc=ceA!>Qt9N$(Uf7_>1^Z;gsg@%Y~XSH^b3p%1B{N9~3w3q2@7rL9I7eK{8avT?Mb zlY_)KhiM`Uo1{@ESjmDq`weWn*-|Qc99}e*N3$L9eRA+$?!xvzu3t`m9g@zk5!O`i zorWoDQIXJa=2WoB&ZJzg2aQD>-=);}pPM}A$vuU;ylrUP(>n|?A9Y^v_&=SXSNXDNMLg(W0Ttw4x4L?H<}yPAbYs1^hXo@jtW|jp^%oO8)R3cv)Z^ z&pJEKPb*lCt*=i`TAA^Htgfp6Hv6lZvMd0X?kBuAX??h;_0^Izw(;TJwZ~!n*7(WS zVeWh2Z#Xz*Za8z!azR!gVMwJjnpmZ^v_GPY{2pN~*bG$Z$2oHNZz9y|>xpe@KnY4_ zFi8}}RM14x97?rL9&oal2z_PS<=&09XhW&j;d+NoP3HG~;jZKrPa&2%k98$}xH)Rl zc`WiS`=I}&#}EqIcFV(YgVy60PfSW4Ws>VroPx34oe@IIh?pHUQJ)n#@vHl~zp4>G zPhFx{532#~&f8c2&h;ks-Jp)|!&LaT$yhn^el-)Z$V;O10h;$@s@nyo%tg%Lw|%{t z7%c2Y5CB4svkNqzIaRK-uob4vY<1?l!ySr4_PpQgjVP0mi>+@cBxSRW(sc{jyN6+6W|;%LAkuN1%ArlIqRs+MbX=P$KrrDY)jN5{u;=- z5J#YcMJ^C~1L?=$T1Se}oz7x-<83Tq?MD29XqI9{RRHweT{U|Y6xV+4cBg&Eue&6?KPlQJ z){dVYs2hoGoxG-|jv$gQ%o(-Il;~PjchCM;P>PGRN-&_Zf$FktmA<|kch9OvX6YN; zW|ca<1VDjB33kevjGv!Jx4kfN00yY9NM%w}Uttrv;s_$s(ECZ7z4F=XzW^s;f2f-W z%0e?RC^|6*m_yZ8;8|h!q}kSVsGCn2Ks)A}&Xnv}&0Oj024+K`JGKBx-O@fs*--+i zYlA{MJRyy6f_;4=xctRj_tbz~Uo=?NJSn1VLkvKBWoN^c>BLk&qa_0p48T0eU=%C~ zcqkw94wUWpLwnT0Ic?aWF#3te>5dXBvAD_yF=t7oyQYGT|A-hF*undV96)y1uRVy& z{KC(|sHnNUy8T0=X?)TP^qu9z-JPi?t$gKiOxF6fC+M_>Ty}1rv7!+c9J)rwhVmlSddD$Y@9E&)57}QZf|&!oX34*;#!Sb_B~%dCG1-X zz`>%q?`dY<)0ciyZmo)oPiiGa0sNLN<0rRqU+K#;Lh8Gu_j)h@)Z{{Tg1&i752Y`S z9=oX#)*#Jr6*f8(!s^n`2Z8T~s|%YH!ht+C50c1;k&)5ocq3x!S6rmt1fuKNfslk5 zLFi1A5H5S)*v>czj5=^Y3=$Ea%&KMNUc)&M?=pkOT7P#Jx{}FOub41xloYn`Un9Yq znJZAH%WR%-^4c%)UAdRrMbEg=?Ms;!v0kBW3M zZU*;7eHJE^OCy}-`6AG z8aO(5I%?}vEDpR(8i4U(Kr8t+orC}7a#3)Ky?>ZlEV>D0#QT}g~^z*?-#a2io16Rpg!Ti3%60-wiBm*hATibZk9()(|%6lr6iy0HD!R#&o2$EcP>XgbI`{E)A3-AXQpo*&u>8ZEW0e{FxhDrnHGJ zvVv5Iw*7Fsu}o7)^kL-=PF(!+t7El6(xHCy;P(pNbF0)JCsw5C=6GPG{;lKL-LlNf zS(@bKMa!`|!YRx6^eS~Vnz5cRq-byIKVfHrC5&P}tUDMZ1}F{@;JC#IWYEvA?GE;{ zBQh}5-UeU4GrGmV4bqB?Pm7Jml{4gv4Pycvk=1t?@OGyi(S9J?D`G;&xc5ZNKrF}^ zG7&sP&n44h1)lja!J3ct;!az_xuR_X4S=bOt{`Uj+zYaG^P5Z!dU{%hFOBH2x+4t@ zWWsv{2fRRs8jP8qd655-l8>=tLqy26ka3+5zkMS4l7s{DVfTA-q8kX}nxq!OrUrFb ze=jgjj4Vh_z-LSY(KQo#s+GN-@5t!qcP0Cd9&x?=(i7)DZQstF@adyc(KpRyST}=t ztZ%P{XOnCWxM@RxY*T6oYB?7-`FeN^rPIzJrcpesm&!X?7t8mJyooe_p@nBL1DB1W zgY=onELbgs3v)Cp+u}aZnqR1g44-yl%8gbqEsc|AiPntbYXv8mUKYQ*a;anAEB_L$ z<`=^%4}q6SsXVq5>%##q)tN3ZAyhshw5!R?@$#)@xNw3CP>{P@Nyf7I%XBu<@^SNuvbmsAqcCIOqfoX_t$pK}h4 z?VRaezt_Lte;ACzw$Af>p3if6KbKEs+2twXmMdRf_PsXl-C1q7!XCe2{xP~KE=Vg5 z{QbFe%R|nGJYjxi)cWF|-kC2yyJpd-&nL}q8udo6ZNKF1PHq1F6(6sZqGPjC-|(HX zYKQK*pB{c_`HINv+k$%e$4Dnwn!exl!gC`R4E}6+-|PkQ-!9gqY^?k8_DhT7{`r?tDHWxJuS9rzsY6~yE`eVhJXXL-Uyl&1FnRfW1={<%I+m-O;=Mzo^eEXZ<)ZwW|hwOi9R;Bir zj~|{f=F9)4@BiY_GwT+|rb;pybM z2Zr>t9=n*jKIDf@pEmA&>eR>T*UJC*aj&%cpO?0dN&j@{2jn{?Q4bt0>eHD2eci9O zCk5sH7CgQ^Y4O?%>!U>LGGY$gjO`5n^q~#X$LsfCivqQ z$w%LYTpJ-?n*PF%KmNV*;9KK*<^1jS^BaGR(~f+k@1yfeUuutwU;Clqh3VVg*dSTm z`OePmi?%;;zTxb+^$+Zb?)}Fj6VSH3v&$}@yZF-Tz8}rI8T3HHSKlt4G3JMTqYgZ6 zFx(8-ZFzalnu@c9%|_(t+p#Lmvd^&hCG?YJ=E#~l}TC4O?-Fr{qL z*X#cx4f2?`7W7#1k$;G0O4_I`&jx)X(_c7rZf?=5H?L3nU7{TQW83SkN#AU}b9?rx zfO+{>rq)c2N*+GH`lm;8N7Odl++6fp<^GtZWx><_F36Nt&&Xc!?&94~{Jvzs^}@Na zc^w;$4jz5H^Rt-RTd(^`p4!`bCceCN(30A)r*eOfhkqzp^!bF7wJ)4{d-FSO zQ)WxQkZ=F_w^R0GX<|$JoC!H+A~SZ3tRME(mbz4FZNbXBZ)^+B*$C5kLtl@LP)c?tA*EU zEdQIj&%Z9`hrN$>uKQ`jE5T1GKIw7&r#F|5%0D7m`Lku&`{%u zj~tx;j`ZW+4Ie)6OvT>c?xZa+!qL|!-o3i*H^Y{5->M6HSH<=d2YmTMQu(1HeU2Y` zXvX2?hhONu;Oo~PO&R`Ik1eAYojFo+QMH>FC-et)lgp z#dF{MVc72{9(ZnH*twLtE8-{SmCf_B+uEW&BnDeH{ds%ka22ucm(7PtKMQ&yxA+a> zlNHhGyJePs)-&>!H!tQ|t|d>B2HHcO`0Uq1tG_O&TU=o|q#74u-)Wg~eB+On32SeC zoOQHfO>EtG<)2@zOn?v|PT%hGU_@N0uP8zwc@Rru=Q_-gNg3jr48 zCs93qS^ku~ebXW7o|m_jZd05s91~-eO*Z|vDDp@`&tV^?JrrAcGjmE=_rdOT%c+N+YPTcr1Zka`1yJy?i^NtqG&iCnG@$z#29s>^S&nt^r zu`2$tGOyVip9-BB@bIHvel0)8KRoZY(Ba2$eCj;V~D2?e=zlE;2Ps0+mw(qlXv|mG-F;* zve(`)@|Uzzsm-71h-S?YbwtQZX!UL4m8;3Got*n-Y2V)-JWw6{b;?1@;!jZ4K4$*)29c`_SM28@bZ*`*dyA*^iD|X2osUMxOQ=f5C9G$N3lQiS^sQj?pYz zwt3)FkInqzr$=Wk8F(RU%+=VV55f4Xwne^WF8CvjDq{Rm9NTpOv%_@k=igbrASy-i z+JdN=3+69YOw7y@rilQYj2#y%Oo)-p?GyEE<_g7%1ws+L>dghOuMkF4C7y73!CRRt z-+Xn!TQGqu<;~1jpIfjZEh=U5RAJQgW$;D#NXFsv&^}R9 zGpWxJQU9N3`y?jziJAl#;IrQn;u+o4C7^`5>u3=*)Qdq%|G&Ri`o?0Z%2uZvixx@P zi|nn%I)J$U(yc*DF?$#P@GLs6i;>K&#fTkhbN{Vdi-~c)wHOR^V^*@a7UR$e{cqh` zJT0@`BrPVUiFIqE!bNKCr1mY*gP8M$K3}|1Du!A8NUuWy~4; z#J1yE7!g66ni#AV;diWp;3wYi&-S4=7yM-OXe<^R_#Lm&vwdiWJlkik5X`|!FsfpS zgYk4So$wmP3dPdQ*VudOB8*jlT{O_^-etL?W+|2}hiK7*rq2gMy?DhtQOPMY zh2p5^W(q}PMUsCkwwN+Tj1ql%!RxQBSR|B4;)OzCV&YpX-dvzq)`xll^))U|I4)i| zU)%?t;NK~^6A52k)@S1MK2g(W3Rk?jazUS{m*9ncqNc%X`$SDlnIshViJF`y?jr)% zVrtZ+NmJq16p+*z!ZGldNtsJmE_?kgcnjRo^vS}=veuUg0}>up4%%re+_J$It~E<5 z4M2wI$r^RfA@3}cqN^}+>+ge|4k5W#v^pft49(y z)s)ZFT^7Xga03i)#MpFDG*Vwcu`ApD*;Y}kFo|P0*d`Xni&?f&tOmAG+=~`-u?^$| z*apnIf40F{;8>itZ&?|5zWDWxenVw%elUL6wxk?kj!;$=*-;fav^aB5jn2PA-JwR! z9YqMW5R|-7k481J>j{)mMN|>mITJGH9=s-7bzRt`Y_u{s=>uV}9zss8bq$3AOU1!896Py_E{Urqm4JP4*}uRY2zJC^a6v|K z*aLQ!mu>OUlyr^rgl+NBjBu5vs{+3Y{Pmr{2j-9ZBsgcS@2$&yde}FU_wm zNzEB?6*U7l?W;}pRfFdiUmR3XyP)ivu|}&ezj(1lwwMU;`zn9Xm|l15`ij&_QjG*n zlhI$ZXVv(go=~-^Dg5!??VnxDOsnx%ql~v;?g=G56bnnl+XChxm;t44xA!7DBJ&~&s6PmO>via z9RtVchusd2jzJ8&1k_K?WpLH@lIS?s{Q$gvg!pluuR;7cb_w>b3{)3? zAzS&-8o{@MLchcdftkPOZ&)PM-0_PyUCNEWgf0mTCXmc;{7_k72++J|)DU`Qn}0bNzkeS3H#ZRoH3hHj@va}Yy5TTpj{L=8 z2g_ql{<>N-iCDtH-xy&`Ea;m!YL(y_^_k*m>N}@7i=iEcXipr57}jAZZ4wQe?5h;W z$bQ0aJ{MWcH zJ+Wm;P`GgWJiiZ$lmh=-dxFEgWJ=MrA)p{Kr?-E0OKP58BySJt4BgOT&r<_~KFuO* zdwf9pbf`e5e;YL(B@Uv+3VX}4vGq&GYGsO+z%bd;mu_g%Yibv?@HuBdpGzR%pmpQ! zG>)5(5@x%{(LS*oK7y+CFb;^L0$nPsq~ZW1{P~OEEMZo%-{yXQr$*Hz zHRg*T4ru?(bSp9RYR460^`u4hE$Aw+5kJ%@Z_=0{dzuYK`z53n7)-5dt8ZGS>TpH+ zCt(Fhs1?%M-`p zcEO38l>Y!;#C^M6v8>y*{gX)nZGF5H<3lc8n58hPn&ayW)P#B7c9vaD0|qmUV}F=G z%0!WSYE|)CgE<%FB1C8r#PIx4H;!Q3u#9Gw8Q^XVE|=R0^IT+|OV%I0CYoy#rJo4b z8yCFX1}87`8JB1d?L@SDI|10lKcdEE zC$PWMT~H+;ysj((oFkfbXK1C#FKD!P?~$G8^6s~9`*Sc7>izo7o7hvie9P<%zs*Ae zltTM#*|Aw;ytK-ziCZsA?NVe#$V%9e;kGo>pv}`*&FMBt;E0U^)zC?@7n4pMl+FQAS!EK;7f%82!bv@;a1*oD~3bkI)(!n ze_}byxdB}Dn*^d;E&--M8w_8wpbcd$IN8d8HlD!xU7*eOO&MMhMdYMcj=eafMxe~~ zy%0A1@3N@o-fyK=9i6SaM4lxdKnUCeHO)lM@8*;_JLdb1p#FB(t4=kwn9uc!rFhd_ ztQ^I19LqZDCl~v$AI1OvxO-t{u^bA_!Qzg)m&J{BufG!RdH)>x%i;ge#C`OqaMDjH zF*o$naig2}-$N}>;>~_>{{LM)776%luHuWcFHAJcq+e*Yz=eL(=@-w`0;_GBfN)+?#kZtn=%=z z1^<@=zhCPP817OmzrZuQ4xyi=C+=P$^t(5oyn-?TD2`7}RixKHI?1;JrPug>?7zA$ zyYtbt^MZWTHc?VdZG@L!-JrSvUe7X)!}oDqAjl=KlFzMsa2VX3!H&8sp4wXM7uVjw zvANUx9dF>C&^7kiyMKTL?19S)i=f_27)P59nke{%x--|jQvw}A0a|z8&VB+DLPhlU z=^d7g&V5y^DV+3*DE-J0^*(EcqW%mOBAO( zap+<$ChFLMZuQ%Hs0!a`_BB(VQ(e%ggOi zGNPq9m(Y)`FPd9k)6~4H6=mEOZ9X(F{Ca07N!Ay2R;g8;wjriYySk{=oT+Q*B*QE9 zYC^46T}t|OhRW+WKQ4h|Hhvz)-pe1roN#(SS3Cj94v0)4`hIg@V^sHVK1dOgma(#V~ zLEgISdaHHO=n0BKf5lq4YJ?Zx28pNS$caz~VT->Pqj2Eu^!`|mxLQIX4Zv046N@xZ zAI+6&WPk=wyjB)yXj?M*HQ z2~HW!cxv(yK9VIWUv2d@!rIwTNg4vBxpq^l%6@x%yt?(bDOS7HtgstVW`kBuEHepI zL3jA;VH^ugIh-X7tkIg2+m_?HP$%YqeRmZATw_4XGvgp&A03jH9L&MSl*-K9w=rca z3`U){ZT%>rpQB8x5jm(28JuH5ibUI(o7EaqQ2KY%znTUbx2n+( z)qbzGG+puL2XJuE<3xgk!o~b{E1|AHftagK0q<7OXTSj_#9$%?*M+3E?KEM$CwcK0 zmI2$RYfcVN>1TX$?Sx)Fg0zd7)2pi&`M+O8WD)3YZ2jSz-IW#l8|mMaP>*=m8OO`~ zOp3jiOO25cH}Ah!IE<^k_}_oe?r)>oU=HG2WBRu3Njv zt_AhecnF;<<4ue?*2c416|T9E16~hkLE0N)APatPh|W}d zMJY*S(ka!%?BoM2=gQW+oATLVloyIxkddGWZ=t>wKz;YFj*c7oS@Rw%Z_+E1;+vvN z3|ik-Gm(iP)T3SluauX|%l)$hYMP64Ux|=S{Al@NUL<}T2b=?#mWzCVrv_$|_TaEh zhW$sG1x^o+1|mK3;Mh8FVXaCEf!X96vIJ4ei(3PuFiEc8NCQH89YWU?V;64w(N~{Y z9d|kIgir9(F_nAvhph=yZhS`T6&S_q7vM^Hj1bZ!w8Y|ki93mn1vdcM-68_fFh%%WeU^A$V4d9D#n%ET>4G%z z#cjO&b2WF4+ZwZ%CvvpzQ(^gz(!-D(LgjUdB+Xj{Aj9rI&{O z&o3JJC29tH2`VbgN}sz)OLL{kHEK&xhqc2dMRHVc8%@YE4jv2Kiy|tjWp8GU^;e7? zsH_Q?7cg14sP)Al57y=x5%p&zu&P zC5x}ijqD(f%X3%yk`V+#=MILW;^9>jzD2qQWN63{UH@gjNaL*vR{PB21$^joTqiOe z_u#z}9Aez3>hu8+;<)e$Hk-4C;tywN4dqcdIQjwO+e$xumU}9HKRA3`$&hb zBX=UzfmgUt#{GWduwxD%fD^^;KY$|@%PExD9MD3^nga}}azRjxIq(EiWtklb&@*T} zS;$Y@s|I~wtknBh{MU`^43!zxBwZZXrOoIk;OMHUQby1ek!!`;^`@le~6Ia2)%zLb<0@<+~QSPUMciv|$K2_c;cFdY?j zG39fVLk`znX^6wPQ=BKjTO5NsJt8bs_UxgDu;Rv~pH**}GqnP!j?$h|AsE_M@dPw>iQ{BK_q zKRt1^UJ7+Q=DeAC0>YX{YK`fnKs!`+X1-s2#D5Ulj4Z?&bw~U01Ihy>1ICVrM#|;a z_<~R|PM$jJPYyu=B%X3Nu%IyR29|ZW&OtJEH#`z{*4+>qC;)xjxY>>nIwcvPyY#5@ z_{xyU_LlT|A7S;(Cj)s=Au$G#oydZah)e#V{f;IJ_u+xV&MW^C?4x@m{}RSWZ(B0| zkM0z8Y#?XO*Z^G^Cz9KtujmMGdRYwZy)Jv13qc0y1AR+NC98O;EzK#F3_#^k0*KMO zqDK>w6}{Kx_x{T-{^`e?t$JeD0a>rwSLL;n?+&x*#~vL$JXN^KC#RqHub~}e<+;7( z=4GqGqJ|FI*A&snFNp5#FjL<`Z(mNw8B~@ln>Zp5V5hSrW6cNG`6QWAeD|FSx=%^2 zs*g@Km8aKh)<)SxCkaORQMpf&pGO=v*uhtUg=WC~6>^u8cTi zB2nJZa3fT*QPphGbD`Stmej80-Z>b`iSq=|_y@{S$&%lF(Z(C8kEc*rDbBH+z5_CgDooK$cYTqj|Vl%d0|Ra8HPptD9ZV*Uo>s-J#qD-8G|3;MOnWn2TP$ww>Q|Oby+8y zt;?29yc_!^(EN9+5Mj6rSYQ3|u|7oK8WE(8VdB3@N9a zGfsgg7J}a?aHI)L!Lz(D9aWL*V(lC@JyYf4Zml_N30K=Tx}+m&$2E3*-u~-UA2;jG z5zslTH{>PhwWhvvxPVbTNyd5~1LdUT=6peIBm9gX^wlQG$WlSWjRI$v?ns zn^~AOby-W6Oqxvo2Rb~chcEpDkq;klTY?G~338DD#u33)J~&>CeO;$zc4Q4@qS!BP z)=(Oq{{!%V1NR?5ao_0!xZJ9Le=lWgHNAY=RRGrRf7~q7=Lw+paMCsE-34+T zyYO+)Vr}(y!X#MoK>GPLUSY0@Ix0o?7a||B#RM&%IKkVtuYP1*?6+aE0ynb65ruGR zMX>)8hDrti;H8p||2?AepZMRu*Jxq-w&0ezi%MUUEzj?;2q2qCaMLh zCQ)?6f26f%=LAdjiwlf1HdwBud8-2Wtsqw7PQuC!4g<;&%MwX%BB&IlfILo^gZ7X; z^7p#B3pQummY>@z&lqNo7Izrc0T(UpC+3kC^=m@w!{zmVBPb=diEQzPR%_n0CjrQ_ z(kU78#gg#IeV6%iF=FsXocE;!a7-7SM^OapM@ucUkZwq&>w;rFA@!fSV3}~5j2cF= z$1-wAX}&(&Ys%lGGH`#(Ll0a0COp^PKH#EVIz1lZfismI$&@lATk~eFMmEujWw{56 z!ZY5!o!DUN9DGgEe@phYj6?E@ii{vd0spq;fHJvZTUc#e98Fnn z00FpaV%l%>$c}gUZO7}?2in3)sGDaWzxOLgt$9*Zd^Yck5=36D=dJz_b9FLv^`}C4 zD^-Do?Fv&NilIxm?n;gr98hTZ@Fe6Avjvj-2L=;+5LvJ1-&0uQJ1v5P!vRIBthd19 zi{bs{`~jS{6j%XE4qKA(OY!=1H2_KIET$(xr-ZGDDhoALTSWn#HWB&Y6N*-ouR>ov zv{9?etTr|x?bgS0<6F?5p;rIZ{+VfkkEk9nFU;@3H%&^6_fvP;BoIxxNT@hg2!+~E zxCz9ugGnfL4cA>4G!BQ3qCQZ1xWP7-yncId=TVU+ zeD3F7$whlKYe#4UP{b!i{6PqYmb&w!TTm?sK6doC$C4%dFpySQC=tCg)HRe4rHFuVfVHZxhk*A)ogCR)8c%K;I;mtW;>WOX1t!0M zG43hNBF^v!yXj6J09BtZI~Ket=tZH~!_3y<2f^r38y=;A*ijq8U;6|3J71VVigS(C9Rde(rMAq}QI2UOEl{^{TKe!#Z%!!RNLygM;h?>P|SLN7F- zLqZT{1p?P_W)RZ7lqA7*R}DpV7fyq}dl1Wr**tdHDU-HAYiP8S=odt0KcC%nC5nHt z3Y=O1H{rZq9FaV%7X@(R`)2`e>i)S=I@*2rGC>l9IZ7!-b4C@fBCBK z*<6uXrZ&rpF4<8lLOKSq+l8RgZf?2YlHbU0_q=eRP^k@;M}EoQej(=S)aS{5!6Gu? zG%fA?I29$AP;KW4P8Gvs@&J=8eYI&q>ePh-@1jy!l~L#fzqf zfw=&=3w#cFg|ErUH>W|u#2%Sg@=|jL00!s|Wm5n&I9HC)(kQFFJmVyIG07_O+Qa5o z0+6t3C~v|MhYZ~bmVlLX5laX)z|KI<2vj9waPV5gb=O6v0TF7c@1J0{AfmJ=>2$xb zp*Pk;+hnjPyD{I#xG~rF!)6GRXFewnxSqOnY)9dQ11kawYLl|Z2hE0B^fy=B?pGH2 z-R-*kb_?{K=q&zf%#Un+xpi?!_0@-3REuH{jf=md+1h8IkRMFIE7+YEVxZ537h|B8 z4gO)TotY|$f53HDUWl>VPJO>`UWi$@{n+wsL1$;UAoFCRR&QFZ)5>{K0FIdy5-4(V zxp#=HK*ph)3)Yco+QOq);JWL*$6~PGBd0u;1^c&ulHxTjzMolkV_nal`phXkCTYBM zvUdNXokQxa7xPN|9y8Vd*2rY^+bxP(c4(?47}z+}EXYC~a>f$dvTd>#(i zV-p&u^zz*g&3Nr0xxRHX^>V}X4n>EV=%`i`SWbDqwYO`0`->h_xl4s}jmm&@unWml zDjd@NbUu$J7RTk>sc^bG))U7!ri}1G&&=Z_+z8IRvsgMJ% zyGjJz^OxWWq|KK3MQ$&d-QvHp;9`BjE~uhW&pT}QrbcC64TT}ZYLEh`93T)(%OzpD zoK~mS85?z`3X?9#)HtMyA7BAVcJ>w}knner0odZ8x#_LXs&E{Sb8US_g?kc@cVXIP zry_(Q=_)AvXdUbq{!m-eShLKM7b4hWZLwaWD#_7?*%xhN``5-N7pF(c9_Ub}&X^;d z9q{pu?*?nCCk5^`&JHM#*!*A=3INSuX$43yw&V8LYjZaViniv6{Xq?AHY)kUNv;ti z4uZp^_ua%xT=PDlfz_3xAUN!3LY$g+D>xXk@=S18$g1qrYr569Czw~~>N`JWZ(0IzOEp%yt=QI%oOQ(m+$-#mBGn3Z*NSMqC2SNL2ED#e9R2q{2; z&>3PH&S1I%UH1o5Z12hb=qk3~zO6J>rXN3|6m1Q;l~`G>1~*%gMU#iflueUhOpCnu z8|s3a=n0p@IOz>eFaQTi3{|ubhw)|3Z6A$&IFE8X(QMyRY155j$Ov4zWE-Z;_AfeM z%y?haT-zE0)h0xL&g-z;@Y~ zk4{gh4$mGrqDFv{4;V{ewaLM)yU=f)TK^GiGhRJ8K6-bB#wXNVSjvlyK|6u7b{BJ5 zc)UfKYyiDQ@p5ySFnWu6w%V*qT6!#Sdf(xGL%;AR*S^y3H^lB`X&-z!>zTIEmA~hI zJ(IYow;$A1tvV6$@y%+`;yB?*J9qaI4?x<9_Jdw*vJ zbi{7tA6O#h8soy1mim{{=4JT>p|-8NXj=f(!0A?o!bxg{FIqG{@tKs`^9sdRvD3ob zsTWEoI?Emur7@=qG3c-xCxL5*i=&r8?OXPX(>(>8)!iLn*WUdHQ2U&pgnN$3qdMzc zJ^(yJm;DE*1{_vLt5|$$9r!(z)5(c;h_R)VcoH(<$;4DO;IWDweINRHt1Z6BAgHi? z8eFZ`6Rj%?`5WoD#*)Cm2p0;#rh{z&lj2|`DBg0~dOGzT=LxFTmHIAQ>+>sWx-$Ah zg5G1lU8;G!;B=yy_^HsGq|^D^t4p-dPf2aT4pe{?L~E2;F?R6F6ECFfU0Jj7c@=-- zu9$0v3Q)yGEamGvW>Wc0Kb=YSNMUkhQa1oSo3F{BwAo&+byJ#hk1;OTaJ!Xxt~oB; z6#!r{;;F(mSaEnleJD1iV>oL(Y4Z+`EwN9-SKA;{n_-{G3=0=Mq6%&`BkwxtN9dB#L_98NinhI<0Y zMYA~ZjsaeGV=M_Hvm2E@Hx+g@v2pIIqZSBZulmoQO!yXmC$eT`w!M)}Sk$Dt^`)yC zWvWVsB9;TRN;UO!#1#Gxe!O{KtRaVd7^aUSfr|S_o8R}SZrH- zf`as3jn(CmI|lfC*SEeyfKd4jY8OMl8bZ5JjS+g))>MZE&j}Z7_33R?n57kVHEBm? zf_j0mifFH{it;)f(67&cO@%4^B_3Q8Y5t$$jN1#8d7mh2^kcFw)|^e*w{dO`Z^0GU zuoO z4LGgxhMMXz5f}*qnS>uv%VaS_oUA8cP33-Lro~TwlD{ICYcLKN9G8tqWtG`p8ulm* z-d-B!C=8FNWx%zEwb5-$9!*+&ouY$zG%XD==G27|zD;rAP&EckgW(41PZm@IXh8Xl ziHGzJb@$>#+A)H+db7Q9NRRiCmTvbgENL6>p?L zS5$dqIJ+vUAe1alGA6aRqba?N%Aoq1?0KrWf);3sMTFY)zh1r#UIKgJ7h%LuYis(| zz)=3R;~K8Rxpvr8&^`fUCis1V|C@r=vONl7psMLgWa!-oYxA^<+*J=P+tqQrwdQ6^ zQ0C$K>})dRk4smFmhaTbD@#B7v25zz5V@MHxWr$v%QZ)bb66s*9HixFl!~_abj=@^ z!JrMkMkF)#UyLZIkAL(jah3)YMs@-8r5%0mLo-no zbdbi)hI(U1&faq`3{;_w&u?)PWO0ok;u_iuM3lNpRKv5pk)=n7g6z>Q&i9Auoi*HF1dBX8`B~k~Y8}ruv8( zSm5e2Fz5VuQr^K9AC1xwXk$u|W`ALb;%&M}Kp^itxmsSK?#%I%cb=%vAcv}3-#$1P zos6;uRIO6C?t%+9?d8|x=&)6e3e_3>wOWuNcL}M%-*Z_;@Qm53}m5>Vzm0NIvH~`CbT~I z*f4MO(MRl%(EUW)k`er&3gpaOs0CQVg<43C02ob^iw`J+4NvU_xb8|XeZsOwg=Opk z%L$UC6ix57PZZZAB>TlDYvpsNmxXHPi-t{ntmfRq7i*fAAAQFAQO)||FmG>rwl4By zlusxTxSE`}XfCgbmEg0WowqiJ?*Qh9T~a2+go`UUtq)#O&#JN6CEc!kL*u)qeQ3X+ z>JoXW4)0Cj?`md`l8?+rk>!Qce5=C|p`+HAx2;%$kHB#v3~C@aR}TjBVPR!jOx>&= zu6OWk^%#XSN+Uh@RsY^kGNd4MyI_M~_#VB~U>`qkiOdwV^u;iF++e9)@|pEc`5 z5tpU`xdT6erU;%;qR3AXJ)6uUin?Z#ZJ(xiQykzoxaPs(WhaFTcU*c#4b{e`b9?h( zivCJ}?W5<`gKG7q{)|1hk0K0W@YQdYX_9Jf`fdOI})xDP@p!sRu5AB z46Sqw=7v`A*P(3ABVU3oax6VoH@YZljlf_3(3Biuu2&;8q$SU2lKemgnXcW-Z{#dNT6q)Qu0eFJ98s*V)lZmloD*U+b)#>ueOAFK0HG(I%j33k7 zJ6CFtH=<6fO-kzQXf=sUc0I}|s~$r>C|RP`p`ru2Mzvn8Ht5&NZ`ANlnW1{gT&d(R z=l>d&+XJ=I8ee5%I-I&1?kBRhf7XdQZ=RIima31%BDGEW7a|%^b%$D42&u-a*Y$eE zw-u+OY8SaN0~{_3WaeD<833nL(>!)O@k9#nStwcO1XP)(c~ABk+cY1!d-(_`{#*Tq zb)|tIs$-*<8xk@b zU>6wr91_WJ-E~7sJWnJ`*hKPPe)x#1%p`p3QG1j6K+HmVnY`)xvJklRH^AWcp2F_PrMtFjGv zjNBlsNzEmji_!)JzGPPT@IuK{Ie-hv4nY^w+)nWYhn6mruc>LwE*}6st&8YWJcBcV z>DgHH=i!KsQ;AX56R>EHY$yx1e>uWC+)LnR)S9yk%?fp{-b&mKxe1sMDyo%c3Ey6m znA;v=Z5DxIBXwrEjx-1$_t_WejHp#-x2mnn_4T<$4FP%A$162!BW$s}t`cO3TuA4H zA|Q|AWTyCcJ#D5u8VSP=Mv2@};*;n%^uw@h-P04&n(gYN27y-BNs>+Vl=>zOHYut^ z^+cXdJA+)fHSLf$g7(pWw7_r8Iz#a{{8|pQlncF_)$G__(Mt`>OD#4|GIDAG8bwO* zWU0IC)$W|Y9AVazTN3_iIAUyDasc*6O%9bMf`3M&BW+Sp2-Lr}p%b1!L}9qy7H_h) z9waqazsn08D1~m>!BOo3w3-)gl3+K;$sOhzeGhcPcnQW8p*5cyR|IQ5k5oc5tNCEs z9og^l!~NO>so6;yqbkpmq^m?9>?f*WIuslM+R!G*T{9F$Ck+v3J9U{_^Rm%mdGQ4! zAD~8+s=KTzrxOgZCad(A$tgI)4|a@0x8r1zN28#+4hY)ug}|t~P&>5p5}c29!ej-R z)&Et43Z-DO=zr#{t*UooAEV z(;m3%GlE|earhq&TAayky3^uZ2A(5NLy7sn;)?EG8l6}I%Pl~8%px1_K6CbMFzj;* z)Z{~Z)B@cRvP3X`yXonefzZ!J!o&(*_Fz}bNdmYKC5k$BtP7L0;Fka@Z2@tfM~*hz z+qh$B-{pj+H<&5wqPA?Ue9f657ZrI1eUbHN!cc`Wv&lPu%>?gEV5O`Q$_1;G_mHoy z!d`L0y6ESDfhpu*etGAZRK}Sdrm1DrG#$b7TV$GAk1TT6IES5!yh)X2sEEi;(&|Na zbNpYVU2PJ4V6cr>CYx#mnsBkb+1F%hCOhm_6V}>PykQ$JHT);^JGJ&$tlUJ9;eVOb zRxLp^4uw-ARDSty@hfdyf!=++DMjw$lZ*kZ6!0dxje*G#Q1%M0yQ;MRtM=+m(8mxL zY8x&qQbq^%uF+o1^a~bQawFS6y9$M@Hla#DoxX~iJJbllcsu$*cAyMot+yZSAUhxm zSzcq9d$8lkC)ej53{!X)hRHHhqh-(I{b=SGDI~RrMeb+3{Z~i%rC^F;?ik)$oO2;}p?DHelNO-y_a4^6;szH0qGMHt; zKkZb)HKYx0+eN@3l@2eZYX}$;Dfx!WuJTP&=t;K%OCT?lFTs9-^HOk_74W1f51Fns zVm2b>Y{GTd8)ZCXPYPAKJmfM}2x{7J*n#!%wEs2&#z&{qYeLp;CiT5ZbDs9E&g+`B za{kIW2|i8Ei8?NS7yw^@*66(jPbf3Y-#J9jkB;#~(AfFWk=wVOdQCJ4?JhyLL?sA* z+7Av4kN(?)t{hgQgCQ*$xrvaeXbBwC9!|W6+Cyd{eO4ZNJ{(QY)MpPnThIYdD4H?poJa>*I(!$Rm>9`+>Q}}5l-J>e4E+oB7rAAG!MXXuo1C<}H58IO{ za>u9n;p|_)5bIZk>ndBVW|6{p_O7>A65l`*>R5CaGs6XdQ9UqD6SA?R1=n3SI*puo zR35@2C$a0$#^?M7$z*y(%SuCo-xxS0O*`+R;o5-$_1uhuC4VFT`27 zQG{d&rCp+Er5@0Gf?C&v!cTC@jP*gguFY*(=6z(dPpCqf`pS_b1H-tCdrMuhZw=-W%>p~bIkx3@foa&vBNw;}wkkblB%)tS zDc&~ciO&PPf-aeoXX=spZ6Kt>oGL$lxS}F`)5_-(qO>pf--79MLmNlj4)vw3>w~kk z|Avj(9EI)qpAy|GQA+)>$q{g<8Lx+CGs4%os(GR1o~rHVhF ziLyx-!NMEX6g{&A}qz3TL+#0YekrnLz~xF3f`mU%HRqA$~pgWyChKC@l^86j2TF-+E+^gvIVq!vG4@{ux541T^y@v<9A{ zt7s1#)TxF-s7woi+JhBvO;0_=7w})H*Vtc$kO;Lu@%^mtm+R0ae((dEyzWd9bJc)> z3l2CIJ&S{esG0K;IouGOQKe2xyzkJjYxc-K7_I&R5X1i%xq*}-n=-Igd~nh$Qi00A z>w{o7+L<)5>w1r&Jph_EI^4iLBXFIAIP3u=c!FZF9)NADYHPlfpEBkzr}KUItBNID zli#=s#387MWuzAjPusvzEN-H5C5jriF%64@6k68~G{$9}jIaH#NVbz?O{Z^Smrrm~OI`MSHYiG%h>YfN@%(IKgd z2lyMmlyZ0sT+Ozypio`H>_FPV!G-^D-E~2!1C>2o&=|(W87A9c+q!l|?{JnN>ZcVU z;oTdmR^Mhsm@WkQerWBy{%h!stCzPH6fP3-f@yHWF5VE=84v)v0g_6uB2%`C%@166 zrH#T=fi_QompC@pSz3ClPhwI*m@rG2oi+8)q#J9~CwOUV{Nl;VojSYkRdh8R6tdYs z(R>bO5TdL(u_zm5-;T@t1Zwl=v)WTW9NfyDEDPPtIZ#?fO5w6%;V^Pb{ zMQCbhfz}3!cKV@%vIk@}nXL0_^o1uBZ+8ZU`iwy44DB%A+W6r#{6oFc{^nqX6q+Xb zoaPUBIp+a#q`hgq#fSoJXmB$Rrspd<4FrUOYZq?=WE?y)nqa0Z zmtXejx?GQBzpE~{^ygavHdRlNsz%^9ewgS_W5S@f z*14R$TpbZpuR^YlT&9s5?=wxEnKt-1Rd@UZl;5Dc{{O{PS76M(hllFc|)YE}_!TPyo@6ntj48Iyj1(nh0hrw>|Qw z>XPi9Lc!&_Z~z5VN)+Z4&>NizjHtEcPKnZykte|eYp)(T1#a1vVS}=7Xnc-r&$QSx z(UHx_STB&HBmL2a&d|Smexs|(MwN1l(Kdn5uWBLd?Rw%mf@TtGXeeAedl*5#i5haG z@GHOFaz#j}w3O?5140rfgw!at-b@1(#WPNyjp?BBC?uq|Abng@U1;%kQU2da+xl%0 z4ORLWD{@BE%xu5&3kWm}!HKf(Dy%WwmU#IVK4zXBP;gF^9qpsm5OPRd9r2TPMxGJu zCfh%|2s6$$QeiYa4mXBcFZ8qa30_rSc*$Tq-QZ(XKuJUd?_g31_DY?00arx?Q186Q z@n+!U3R7Y230K%nE{Z6X2lgvl_TYd7eNB)izUW{{wYo+gkn%!7ZPdYup*5+G)Lg8a z-L@^^;~wv(OpgAJXjivokTq~Hwz@*G{FO{pIBPtw3}Cp!nOcrL54IZoGUzY_8Gt90 zlEm#foHm>q&oK@D?t!x=VUd#U-=xl-9dKaG^5b)g)3LZ~7z8B7MF-C)g`VATZ~8e!;skd7Y#!RFbSSgxJ^ZxLH|YLRaB>eaUst=iRO zqn0$0M#%KT(0pW91D!ZH0aDxH7x=Hhf@Y&sdCNStEaPgGV(j6%*>e}K8f8FMs<;oF-5TnKZc0A8(@nKm zx#%@&winbi(Rz)h8_$g5p6!Ken&LfC=q%llrKNRYcOUHcnEuPtP}p%JU)AcRGkh0c zL)xp=0wbaZ3*ZO28QG$2Q7ci<*o&?2Y+bzCCwQLGqw~xq7?$r&yW_BX+|cdT!@&rW z(+6;sh>U^rivW1SLc`1g0#1T8s!jG#s0o)qs8>a0&WA;r%bI2ZxdmxHX#+f0Vm z$>(ieb29Yl{%e&5-uzP-BtVAio)Ek439$bZn27fT119pj_HembcXxj|AnhW&}T&R2s42atwdaHi0UcfmmcdK$^GonEC)rEq-1 zf($sb$Mtc;C`U*T(3W9_pLWXLHCDAWo*3afKNzYI_`yZI`MU302_$-4l^(>ZPT?y5 zzNHKMJleNxyc$`i8djQ&$f<97g)auF<$nD7a5`04QK%9P?|K1Q^_Bk?!s_=>5ox!d z_{$ciD7+db+7KE3;dqhCyLhb9KYmI2yka`0Ryy*VeKX6h+t{w zjXLrAzOg6Pd4o0;(Xtw!V5xB{5hk~MwSK^v0Q4Y1>TO%g@*YA(c?SCtYn5(UQH7S! zH}aMi;fD3@i%X4Hb6H&2y@0;a63m>QhqFGMkr{n_o=1lmu*c^O?*(OH8lOocpYSf+ zw=8O|dPU`aQQh1EL&J;}l?OJI>oe+`Z%ue-r#X2|`HOHK@${nl{o}{{xpscU4l%*s zMZq-&5S$nnGXJ&JJNE9JQzz7&4Goz`S66F;@OtS^K$DT}MC}Y@EDS!Q?vO_w&#;MP zN`AK!m%wyiJ*q0ml`Px|L$4mJE@h_qw`M%;k9Z=K@obGXY|TK}ZXa#S_Z8N}Z4Cs^ z+WkZG%5W+-9pt0<5}BEo-VOTbPe1ANRvA3Eh4bI4Uh0Rl`N1c6mEZmWVMB?YK(3O03cmxrfwh}m}5{SC^#5ikfi zRdfi``NPTJHw0}qhuZ}5$3dqv zGz9C+O(*R%d4>TqbVl^tdFmm~C=88Y&VN}<* zz<_Q@@60f6MjaM;IgILR=^)hs78s6xE9xTr#UCJ(T^1AoS7+FL&y>h~2gr^l4y@)i zK(My=C*x3}2IBzmKE-JfcPcCvl-D#+aUR&!SauvhnF<%v1n2Hn!?JQd)}oEiJgo(v ziG5h-NU8H`JMFfx%)%hEvG%*#(7<%Q!7>ugftcKA0rXKZ6*V+2D8|DtII$6WfGNDd z1FG2xrZ&nqT^@O09u3Z<3Zci}j?i!!bDomaBqSdV@<8?;_f~u;MiH%x)tEoC{wW(2O z&(xqo1T;v%yl@jW7P+&|qmYxbT!+y#8~z&)|T-uo)WyN9V8L zFYo~Ibang29#?@NPUvfsu5uXq*)EGv}zH|%CIA% zEzBF)^4}@`pHvMeplEfFXYYJaicGf)B_=dUXRuakt13DJhwH+F-VDkwcGGCdH4_xl zCoW6^kR7U3X}}Gat>W@aKJcB6Y&_E4?2g|N?loSj@9j6fU+0A%TY~abLj)=HHE(y? z=KFge3u)wP;Xqt$NInmRA(T36Xb87F_P_^$7yC;6unVR+d| z&2a&3bU_H69;cK6m@5iz<0>DB#`PecRg<$dU^|8e<^)f8P}EVCW->u3H9162!hCEy z`2>RAdFmfb1tHO$VZGmpl}Eg$Ga&fa7!LUdH^s?Vgq>)F9l^D*(9b|GEN*OYx3KiM z*BDP0_MdUD{u*M<62X%`Lk9|`g=MR9eLII9uCw;~&z~Z{-w~tHR5K|}I@3&wlMGx%jdU|< zoF}PZwwp9^$AbYz*{!Cbm3lQ{uMRiC6d$AAihd@ltVnA#-Tj(4nK<)BN^_A`!fws$ zIFu@qgGImV6P1MK**n~HY=RTzqSRqN6_;28K*JP&(1~C?Kb<>Si1R*Fa^$|9=dSZo zc5LdoZZYyRZf_5q(7UMBnrE#v!6<_}Mbw~+Cb87-iJH6(hnjtja3CYmL1aSJlP!Tj z2J|)*;@Wjq(rRx+M0MEPc`cdO8}zEQAAbl;X_B1achWeAq;k|l0I0!6O1PlNO{7GP zM)efbVA2EucVmN#y;kMh;^9mc6X<5DxES0u_$h#I-5<9eeCpjy{>mQcjpi6_$eF?Vw*m^~yRS@K59e!6 zRrbEx?iZHrWs90#9aN;b^NTqTCQh~#25hiBg6dmJkGJ@Z9xFSu{1{Xi|8IO)&Ulek z*9oTQ5z`*3uLq%vY2LCh1Qqwlr-qO<_vF#lzQHlM)0o`Zrknd@=L@VE`;C&X(a!4CDoGkET=>+^s8uM}E}5qJQCAyhKJQLMTYDTJ!VT1W{l9ZPQak}q8|8{qcege#+L zKpZ$5F$NkD9ZoR@T`*D*3_p;F3k}vFF-fXJv;{qD+rezZX1yB-i%)$sC-GFGV=%_a zu0vi1hSAd?l zLi!N}`<6@!7&&tN89^OTVQW(T8Ls=iZ1-iT{%q@}c^dbfxes?`PPG4MtaeFBVqWuA zG5uQGmZL?{XOj||+RLZ=ojrEec-q(xdCOc3^}!E+6^{lv2S31R#goXi27v62rG=LL z_7nQr-3hVl!tdPTh^_AnpXfFz;$YIiz8kq=F!@vH5ryf1AO(re5(5(E1}_DDI!OFn z-E;(@-CO@KPqQnLsr&SfoAgzhIk(J7%mt>eoj~@L=)grCJMouj?M@_wO+`x~X;5Ay zO$SVf6L|pGj+%?@$XX+wgeD5dPa1o-1I^d7haNM%J9)qy9y!?&^<-D{ORdT}gx#2et88(NxjmPQYMIz=SPb3N=b_EvjLFXef?jm$&_InC*Y)J!a;LD}vB12- z6q&3^hBmv>68%H_!tRM$_KcsuU|amp@Y={ZN^tWu3f&-PP!8Fb-;<4RYt2p$14>PM zdi>m?yl`MPY3Mkr-EA0T%Nel;P9#`8T!Zs1-_PUr+`OxBMqYK}-)CmHYFwMI3arER za&4GPZ45$KB%o0wtMY@D&K<#R@l!?SyIrp-n-}dB?WBw|`e*Diyu?{Qt- zvf5U6xw5ZKLbW5zD%uXjc0CZ)ks*<|u5269?Rrv>uMXc6EO@iJ`W~P3&D5OS4_?=y z2#z=8ehJxuAgFMplZ;!IKoS_7W==|>PE}y=ArWL-=8GF-b|TE~DAsqQX{U>- z2RYxpR+KL`@!O%)b1A~EO^x-~;FB{Que#V#Y)KmTAT2zIM;F|v@C1L1GCHzT)r~H= zQ*C+ek#)tJ65W+&EjPQyxG=S;E^2_qHqMtUEZ&8T0kCok#R1Wgw`TiEmnF*d{L<)Y zRlYRagi&@c#TtS7)R0vKaub*mX%*$Tp5%xr2liB16T!&dg^Wpc1{jUf!?y$m8l?!6 zO{1|2f@K;q9=vYgS4z85ax6z#H{w~UTel!g*4Em-Y{G1JUjN{2k#iE;?8l-PL#h-K z#v>o%H4jhwfI%Pbx;MtE?8MPX4u;Q`+T z$RBw-N{Sq20bC9m4@N3cYpNiEL9%qb9gRa{k)A~V$$-Q=bYRu>O)seIMi8DAo#Jtg zVhivzk_H)}A|U)0GOF)uQ_j>vnC^kxM}HJOVrcLq3+Y}au=O_k{wNWg~)(%Fo;GK z36VP5hyjctjW~$Pz>z#yW{MRfp)%A&^3sE-j4MHEv=wldEGE-+^&A+~Dg)B){7vWG z079CwVNug!je(`VIh~fKDKFW8SkzhC`&U=poHR#@;73+l}?kDJMPLo(wB-TS5p#O`X zS!X&JW!B6zA{$4XOd2#2)E^X6NJ|;4s=&IQ%K0T%Rj3I>2CFK5r6 z16Jn=hm796@kVdW5x>!&Gd1p#D^juka)`n9GMxuZOlO>~m+56(4Fd3Gp?zqdqVq_j zoxC(sCMiV8oPl)?jg$e=-$>&R(=~@40q`_{Z;KF52m3J-I0w!Bkoz&Kf^!6sd$xn| zVe@~ctJa3i3)4nNypg-AG;(V9UgNZr^fP+{Wq6oSnb`bX2(Up()jS%*QRDT zqnSRvZ?oer-`u(n5}IsgEw&HECUTJYyLs{Rh*I}wvn+9MUwvDvZ{>Bo;`0p&&r zX(Wd>Vmr~;n_=6Gv_6!rDJiY2%9;wMmH$UUFF1dc#4?Sh@)tda;~^M>bg~c$+`reX4+ zIxy((k>fJj$fX{*sz#nB`+M2b60;wf5PRn9MSCOX&bfK8XzyFQXJ*9IC%RH6B*lg8 z>&bn$<)$Tz9(XPN>M=88KjEUcL!z z7D1Gk+-FufyCU_ORh3-{_L)t3L#IL0chu@jIZOY<3f)_uTfM!A_ad&yjo^a^~;ef zsA)V*gA3*X3PVIrU<=xp`W~7*1(&b2WpqZtUT9S$cuAx3P13AhAU*y*0i0oFrk;px znw&~j`c_f zqb%KJ__QtCSL{L0WdM+R%C~@u0RtH7E%1txZ$SOw5WsKakiYG=`%zid3vjXl$cmt& z&kClS*TN~^pD?xN$UbG@W*R9a9kI-S_oE8xk)&NGp!TJ=KUM>#Zi+8!SL|E3t#7QMe&f zL8^qT&MZjt0iPlSQLu9+QN~Hi1%46ga!Txws$Zop6LED^d1-rHw#}4yZ1@T#T&7oDJ@UnOD9E%~PgX8W4H( zrOufUueEER&$)A)E^08`w=j^?vIQ3!2rPL463Q9W;B0UfzZ)~7vC%Z+&l9Q~5V)DY zjZt(0X+(_*A#SkaR*e5D+?kw}wO8L~mX>m*yAX3m7zTWY57tbQgwCsG#`akRN8 zf055PZBwD~8w2p!JL^7Se2Jd+ih2MKf<$-3xZhuWi{;8Q|EyG2VI)d1;)oARxCc#G z{GGl#D5(yr84JjnV5);m(P$<=o+Fjc&c*uIywB!L2*0H!#a4P-jQh@nO^N1GvvBn6 zbckmaE)WeD!eTD8XEI66OivMVnwnz)CeV+!o8f4WlHI-vG8i zD!!3|dCJ8%63|J_F-RMV6cs&eto*Ki;>X!WoT z?48CIWto3T@M1K~GmYsDqRt^=7giYi-vWF|3bNp3V z5Younz*M2!F=Q>_tix`XD^1`B{1K`o1jf?2^zlkE75_e^=Fya`FFV#JC4floXo zdit+8@f1NvpLp2e(vFw6y5f$y9 zJ(Q(wU0?7weL*~Gt=1%(#zb%WF5zJy5UHATRaksMWq5pIo+UC47({B!(czOdv$c^4 zv2zkjj7S82s(2F=5{`+C&$UN<^jvMqR|a_B#dqP(9p6gt8;{?U>#juTj9H_1X!Pg| zutVu9Yw+6uOx~Js)p&lx*;UtB~r`Tvp;BJXk_cO|*YujU-t^qmgw z>f*a1^^m2L-WMU=V=f>s^WYvW@eGik;=9CebF=77?G^ICVog(H z)~nzq^^N3xt*$Zn|AWzzcj-|8rXTL|0!-u_fS9>2c^6c2i`mlqq6hg?f zY)a!kVmN(|wv+3Qn&_Hwlaf(bWNcz?);mD0SK>>_ zqJHZg_L^~V0rCbgdf@%DC(T#{&<^|;-~#^b=zr8_uZbQvX@+s=Z^HWzT>76N`0a|( z|LB+FCfx$}#sqKF2k#&K&O`s`OEVTV!hjW7TGMC@mp|~G7U~|Q)1$1g&HlgdG`%K1 zTr(#8%38O}VNE)mU5rExHrnC37QrR$`0IcJAe>wX*8ro5b$r5gm%M5$q>bPjyvV12 z<0e`g*;-Un|SdexN-ej|R7sJT}5 z9N_OhRR}kM&U^&-i2phg;eW^fC2~vuUBTZFejmQo;H&;-MDRxZw~$%Ba|6D|&G0_t zOM}0H{SpI$OLO35C?NlLdINr63A}OWRdIO0_-~DZo1sx|LJX7=XaEBMq9YJ!kUc~h z2o)M=kQ_xEAi3;B$uLJzIVwWq)}(<|$ku~+2)wEr{F{}1#0wc? zS{Vq3+`cPIIpR;F#{7XF@ldDZ-$xwI{lDxHCr4nUJ@Z37;xwAgANUa`@^Iw*Qlrc8 zO8C4eLS;!xkxKu6V{H^-%zxX9{{r?Rg=Fyu?wNoWGSZj&w=(&cRwkj=!4G^30=#GB z7W}uc`xg*)H1ej?_9BH_F@;9o0!THe zRFNQH64F*?5el^zWx_hZXI!=y8>}q2!S*K92iz8351uSMrUB#-A)`>1tV8HK8>{6} zSMpl8G=M(9jboup0yEGT_Sl3`zza0yL~1E2@MIE>B#d5=@JIwOKrN(BC2Y{DiW^hq znvx3{H{{__4Lyz<#D#Z$2`x{U$hmV3aQWoPfZnD={hvnROH2iZnUEL>&{<$YG70>C z$%?`C&?S>Q=c!q;U`vmrtyQnZU5I=*EFpI8^<$bRgPbU~hEZQ{nM}_KXZW>Rb85qL-)fABJgjff!0ilIG&$bw{=P@&$9)p+LOVaYKr+ zOP^adze2ex7b-(WD$^8zWra)yfTf{ig7k-!OD141!}L%lLaLa+JNUBqZm?n^399}h zb<$9Ve+_)}Ex_)&V&|AA1#*<5Gq;9XGpRK41poxYU?iY0f#!_LT}^hXDxh#?u=;67 z*`!OjtIK^1a94{^@!uB5dm|0^WcB!du4DYruLb!L&-fWFZ~|yBd9{Gat3{}FzzBI( z;2o&0)u=^@D;NRlKz$60>i(;|Isu(#{k>M}y77&UumkSG@Mq$cnrEe7N+@~Xubz1H z=~am-)Xt}{)=*R@A;=^!Ehs$&%4(_gpE_paVE=?SUd0fym&dsqOCz&lw>XadTK|EI zM@et3LtnfnM%O*Y?iuGwD1Uf%y-xFRx5O0e6K1;%gszK0a1sQp^t)}Au>Ux_gRsvcU&bt0g@=7f)Hp=<1Te#3)||B&Bg1u8Lz zqdwoypFeKz{peVSxG8;8dXud`VgIx-v6U~jR>$X6DHDaHQz%(e0MQ;YGr${sE0+JT zfn+XHSqFq_L8(LttANWF{zHTe|9wSY>?5zo8jjgZfh}ZE3unb24eVfr?&HVfXYDq> zsmPX*PT^Heh2c?#0+yM?wn>t#qtF0mNd}4Jx)y}nW8{AM@L zapN5bN~O=Ea&g|B1}`fL9P*tNo9X|1DO5&ZATHs$$){{_tV>J8)Hc<7nQUz2xg<&<7=GS1_#9-4?a-yLeN|`p1REel6y%?$rdb{z7vSjzB zJol#`==Shd_a0!b7Z6_P13)L{j}~utHf%q6!QqHqHhaG2lTOE1kNGM(PQMdX|CnEs z=zqdj(JM5HLL=9B@>DjXxx;PezlG(8sv=w?hWHyEM5ykeVx?-7bQ%*Y&H4f92MP}W z<*)_d3DyqaV!>&A)mj0gJ-f%oH{?N5qUY!Hy*Z=bBH3cdH`q7@nT~~xz#BS z_BO9IF&@XNTW%LlF11WqmhCy&R?%AJy)HJ>T|2e8sJpTA>NUW#bZ8)^d7T^ex*G>i z`&l>ePgeBSC~r{y9}MIIJg+GuuDgK3~G-Zi_HF=t4fol%uSV^5^8EthYs5jk6k)| z(%4BTfGUDz)@L=FC^+~Ztp`1HNAV)>w2k*Wd__V>uYgWl5saZl*QdG5i`GEL93QlU zIbigGOEEpn$Hef+@l-;N3%O1i5c4HW48zrMXy1VQpytPG70Zp&DGaStmJ*OhP=Es{ z1z7fAB@Ui7xE`u~_QIL+*nOCKv5{`7g{zI}tG zC3$B*otrdRp41-;6s7kzUwnFC$FZGByJAP%>l9c%ZLh^~ekJ10(i;j_4iuJl5$i`5tywkRk)8ib1Gio=P`$zz}2 zwP?`;lcsD^oIM&l<}ig7RCoA0RprrmCgDJZh*_|HV1_}p!(V|X`0o)eFSs7M^-{=0 zs_KQE5}e3gf7`@ZJbtdo>w>QKOyCd-OBwj^FVSvOZrByMBRW5m?G$zVTHkXSMiJ>SKLGw2}(6>=>(}X+(oB0()%8*RDJPuw>eU0N~qt%H$lB-vzG;KjkV~! z*X!kdPeJjvuOeXJ8BRpaK(^rZw{U2W)$3^vOj+`%P?8euh_?D95(-@7Cv^RUMSWq4 zb)M;v<+;354~BY>l7Y}TjJC=W8LX;R9wLLq&C=qa>O~t?{_d|!9Y)&+j?XgOe-hZm zEOPkQBEOG8R&9Xsf+GgAzzZVB@C?goZs$6di_Rw!;xjte6u+M{?;fTEv0n1Y_!w8) zBTm#e<(N`oZ#uEEhwp`9hOQhmm(D)@)KlWMR5BCbF$%Im$_ht0tR*QNRbj25!by5_ z&iMIPWk$XfaU#zXshgNG&lPcYs>|r;9xOrvi%9kX#3wQiqJf@)Q?p}cJI!GS_Rec9 zF+De_7E^kV$3QLGuxJ!YmLR5YfO_)&06Czc}xf+s@P&y3!M0e(gu`1um0o;A^;SB6(! zp{QoSxD1&KK+%Pc1SlGA4Tip@gb(500F^@-iNrmsCO$O8h6C)J#=5*sd1n(|kNaKN z+1Q-A95%1tx_5HiU~SLu)^p$GCMUh+-pKe&m}+kS#=_RBb9bC{EGcxi7TA@;!D%$t zi&A9_Y8Q&ar4=L9;jm(aDv*}X!Oa;}mcwTTL!CBDrR}wedz(1)&)IKjttjA)?&(G7 z8RT1D)PcM`U{h&14z>KDNdV1ib-D%`0?C}1Fu2_4V$e8$S+aPucYybP!=mxuE?4$B zNg!*4V5O4bzyhZQ7g#ceMpgFkQeWGu+~^>ka8r#K zD-A~hi#)tPi}DgnJ6R28I@q6O!%q$5LuO<{GPi_G;|hh-%kUxv#~}O)TvVzv>Xqyr4<6!@;poD(ZF)AvVP z=6d!=LvC%HqK!vmZKTprNY1a6P?myP$^(?0Up3or$oU2NlF}EM7CAR!XZ3}|6_w$b zlRAIf)NW*tV$sXTV9msZKU;v@0}i8qdC%&^Lo1vG_NCWY_BXaxXl~IjQj9T@bs4ey zAczwxN+HY+QiinWBd+dfN&%w)K*Xp~3Yl`0IbHMB`g_P0yz~oXNlv@pa-ZKbaYv)Q zwd%-qpC;|!?8vpBEWD6$Rm_-dWw(|jI4*B|*heMfgD3cd7#vikC-ve{*C4DWDTnyENM0lv#r9s)Dtj9=Glo2-xy!YW>9xHB}up?pr&87-x^zRD#ABiay zsKUOoBZihj{*#3P%Cc0c{_OQ>x}c8W;@^2K6FR8+xu7JyD?1Nij`L@r!Q!n zlmN~MS#=22gFz>&32fOBU=;+@s8$*Y2B<@$1cL##>MzQ#zu(+$==-%j*U1K^NdpUh zeIc0v7V`EK^0RVk@>2fEkU-fbu`!~aN9=}F3St398>EOK1WKeh3Qt1l(Ue%8RS{+k zu{>{m4LViieeN35I>uhAt+Tr;$CRdryUt$k(H-(06LEj-UPjofiPNEmqv)vJ*lL0{ znZ>iCYueU-Vs>?Drng$5r3zonn&IV2iNy)&(kTf67sKq%Mwd5yqX6E)7@j^yKM!2yp z<3VI~i#o0Yalp)OKtTQ1mHsFmrJwN`QQNPkAg8mf7zYtA>@u_^=QF^jVZPplU*Q~t z?n49M?v;;4H3P`*ORoBRIrBF~7luZMM-_>L=1Q6c*#jmNY7mAB-5-(%jM<$p+rqu* z0k@Y-nJLzb^)5p@gLV!w|J=9~MJA!{0V}^}z(3Ga9&sF78-wL0w2c#mQVTkI;CE*Z z#!dx>5hZ9|I)zX#1w53{#m>M{Olg?JPbKkUg*F2?o(YSsW|%`fS8pNlPHZlX{uua2 z1iYYbo3h@eFyT=n-yqW=6(m*K%J5JUzoE+dOfoPWzPbGM3+5NMR^>icRuh}|O_gSH ztiG}SuIxR(G0@25@)f9KlAQ>U~7 z=UY-qZeV)17}o;?{msw5wXN|);sMX(_$B&ZTs6vZrV#p3CjuHq;7|^UO~@NL8=K73 zMiSCS&Q{~WT-?aV7sZHo+T$mj$aA-j>5Vu!{hGi8O~lD4>-)f&*v}a)2)Pi1JA+$5 zWTD4%jjQ62e*sqY8||*DWoK)cGj@0DbK`1t!IvROeQ#KFKrsbCWBH>pdqVCAL>rk1 z@*cu?si6HcB)o>29gz{lYuIexL46`ps`SRNvTvgMW3y~q?2e=5Ndw;P;h+0O=-t#?|bA?4j<3J06cQ)P0;%r@y%>qAFr%+xpjTcr8*Jnb_Ib zADIPSQ~wtG!X9n)U>@7Q1=<(xMA7AjLE!H7P2_7PQ_1j?$8nTjFahab0QmtxW%Blu4q*%mLFFI!T$B-WT^K#Ks{u z1MpASI-EsABuJhJyg-G>xX95RS@8E866eI0mPUMdSWemc~)ySVZED*dZ{ckilca7@8Q6qd~04(T;{h zfT>DY4iRAPI`Kff!5_BZ1>ihQZh1UX7nb*8@s@5DbstV1M9#hJ-zQJbJNTUDM}e9# z_MWO=M(-KhT4?`tQP{7tfWE<&tHVtBRL>6K3j~YIU?WTiJEbO{+nVvIM zkU~y8YcNnG>oMaBB<^qG@wZ8OXgMVwHk=gQ z&0`_pTlkGI0LhM%gUhp!(9po;=c9nWCC=5KU=A?i?j*358!CpsBHh}R$-!(WBa&$yG6Yz^rUqBkLszVVR@P&+V&j7!l^5ctp zEy~ehQhzaG`Cv&ymoE)__|ozbv|cbfOgrK!>M;N*LAQT*N7eXg;=)Bs^lu~dpDY=c zU?ATD)5$mVt(N@Wro2cLBp9uyJOl?Ib`Q=StPx3*gWLkK1(!otNa~iRCP*4=mbQ4q zgQFZDY*P)Ne=2ku@(FOCQpA&Zqj0PEt#Cc`UNK@AM64QfEJKcXCOXmrn_sa#23|D) zEd1!E6HIGtYuSDAjMmoK+mFh_#ROa#i@Ej-z*4+LY0iSh(p!`E4Wh` z{XI}1kZdnKv16L4I?t~RT_fJbhzS69IdlWU?h8uVAYu_OGgW>_s6BPvw1-6PYqpG) z`g-?WOVWRuT^p^9ydnPe%5aF^$MknL3jJH$s07*}HKD`B&@4miLyip(B50W*@M2z5 zCIZN@M`vvj1wlB(yZnU~o>^1OIhN_$*J*A<+I;hj2|4jKf+MOcBXYcAN`nk=_@q!3 zFA1_phf-$0ATov~VI&?QRT3u1Bb2mj)1*z|29d9`PJ6YSvjz-qmmm30Bi;|o&hi34 zRah@TFdR@lC7f$d1vD#QH=tYyP&=HT4H#UoOE}cYqqTJfkuQO?QVz9Hctulb4V+=) zgV8A!k;&F4*-F#{Az7d5QUJkZ;+tujwtI4u-7m+Nk11JFuJ>gMey!Inux|dhywG)Z zeM_vnwm!N%;wZytq16Ud4S-_?Gr;>DP;ADWUtRC=y1+?+<57XMqPH1!_?gmmla6a* zm2;{TD#=vP9HGYoE@J;fQZ&IX>7!^Gc!_HJ3*IAv0A^lcF8H863fcM|kNs%U{J3M# zFxP+}LL*!~5us=X$7;Iu2ptD64dsQ)Pmp~fLc0y!XsK9FdeF<)qq30Lh+laxiw0O% z1ibkubmX0d^1nTD4F2kMm6kxFU{JKti2X3~lu)T+LL`S2xDJ(^vfzLzy8M_9+~{e#fkze3=}oEASlU5cB-jI=-2TOx8ymOU+|R|ar{od*H-}@ zT6jLXyn6hP3Rc|^$Ga7?fTVt6__$N4A`|?2m?MbLVY^(SqnBzgsC_Rayu2#=bOl?V6k zlax6U{E2&z;PmqY4wuv8FSK{`?lu%0Ke6m3jc?_FvXtp=yEbuI%o)4(LinC#is>9u zP$W;vJV?}F|Kow=(L(+d{QCkHQcBEGScGxH=W=4~{v(bn1#cUf%k9txFVIc?hb}vDR7w~`~pxJW< ze3Za9(@_NUAwz9R3|zhjH9&^Kj-c;&P2ZFsKi?oKS_?3ykv3!st=SmhA4V=FekUz) zCoiU&%Cn1$*=kD(dpyi{W12Q^OsS)Np$kC$iQFJJc%K150IwRM08XBh#|EPje|IeJ zLEaiv*!*lq2t0J zvNwspM|NhQNNhI2^xRSL`ouf4=dXW4JBo#PDc{=VNqQR77gYO%2m(-x;9G(F2l`TW zvM@}Isx2iSOHEcQ=wc~5gA{(R6k3`Q0g9PC%NDu(em_$&)$jFs44m7~`$Z_AW;&JS z72b)%H*X5W+d`HD%zhZ8T&N`@FYq_G9y(Ad38l)!znFyjtYAt-JsD{5%h&0Gp?Bq! zUk87dzCW%wCU8VT#st?w#so_RkrNUyCLu=h1AXZ-i5HKdbRe$7&2doI=n+^p2Jz?Ci9Uvd4+rlb z#R{b{N`;ih*U^xEY%kh zkwwp)lAy4v?0B%gFlkriMi|EptMXdv;d|%;GK1d@hcyMVWFS1@8D3{%VN)G)>9l64$&?09>y3Fk zp`r2k$|iXXZFe$V)g^hp#Iku^i49d+yC!Fg9||BEI-sEo3=Y0Yj{%62`;0X`1Ki2w zgOA-Af0NzvYV{p#_~iJR8PU^zs_16YNU#W9V%e`gjFTQaS7Y!vXp%GHS*$ABv;5vZjwxn2FX0E{7Lm@XR zaaX_#REWDFME}9{M+eK%IRp3v92)?83;RTXY3C8hGw`I~s^Ayh!RsCb{X&D+Av^_D zR*)QMu2FWmDWp{?G>AK{BO^{X90GVk4grBd(NtDC0g$M&xYCDAO>^$UU9-3SId`x; zC$=xX|9;(kLw8O~!bVh!lL3J_n-REAOf*wi;MB}|IiW3MpJS|u@nZ5r*$SbtQb9N> zWPPOwoa7kG&Y?2MU2-V?FB>2p%uPm7DCa#6^=P>Up$L`VjJO(Ck+2ldFQ$GS0^<@t zABT-gZ;z;Vj50ck@c}S!+UVdkgP#B^Dd%sL32EfI8a3i9c$$;moF1c#Jia8cVo>+t z-(QT#69CJ0$wNsjWzZO<0Mi;e5a5LimYcv6yd{+jgrv51s<7a}wsz^DeDT98IL`Zu zpW2<3<~=;ekhJx6CDoEaV~GOI88QN#It=EXNHGy;79vMzo@<(vdr~Dvg1M(RgJY0J zB7F_aH>1AC({hc{kG!wQ5(g*B%UaE2l@|ve`r#&SD&QqThW35A7V3CVK@43-})yc=FE`Rr+t@*_hx5O_=%Pmj}&}Cf8b#+;8 zTLy(yCl!QF$RvJmnB225;=C)|FRU*~ber4D>f&svcv!zelN>%T<~oM#rn>bH&m8lJ)*8ssX zLXH?nU;qF}v{h2&9svPR1uzMaVhF%xyRB(*fHY@(iS6~+XX`)wOI6uI-TC_YfA`by}! zI6m&vU9+Dzy&2uUJb6Xjf`+|UqrI&Ay+PErDq?UD+|<=hECNIhc`*TyTj=#Rwmrg{ z)_Pit9nl|~5{|U!VoV#x0vzR6-HLjKa7qlHf)r|G3y=<3L8ODsd4mlB8hQY;O#ym9 z#RR0vDKN!!W(JL$2b{!^r6Q3nFg7m+;7B4=IkKg$Ze9+LOb`DA&pkqICnmhIsCaF} zQ^lXO&A2f}ba2{E0Wkt|oUPvHDy)9z+HYRm_2a6p)sf08Kml;TxeFQDEKGEng$)_( zA4^L>I#%IdP{LVc5&mxx40Tg}7k{lUapn9^b1Qe&nBA4J#^qO4RQ7N2I(s0+>aJpt zkNH4{SS~-&G#!08e&J%wb?0R-grDjV!5cbJk>JPiJf5}o?w#5U2xBIu*pYWmUmKX4 zqp{uTdnnGUnO^rtA0I})Jd-A2{jUN9f=j#%@>g5?%P^A~LJhWO50x^ka==ke~k>hMdn4U+QKT!j(iE#Z#UN zFtbAj1}<&Lt^rpaQbN+UA)piRD)8{A;TjCvh2)5up=HXT)%3B+bx@-tM2Pi)J_N}i z$b$%mr3h_{XV72;gs}ilbj%Ik0R|yN^k{*Q;y6NQlh7aoScraLKQiMNzKx1l9_8E1=r*FR$H$JSFii1kb%PW}S*wLbRr~-c@6>Y;$fg~ z_7AX-hfpL2${?oE2*n9u>5yFl3Mq(Mm6===WsA%lrUuwNMC7uoCW;L_|CFZifI*|< z`0)^l?{uMFRseD!!Rlu{y1?~N6$G5K5)%^s3M_FD?rQ0au0)Ko!$4yqfu01Efr3(! zPlIeANY*1|c_jlu%|I{4thdE5=oKxiMOscoL!S=uZpWO|q zc${TX7<0tS2P$7W6>G>3WY$Bpvj{P3{O*pW;ack+^Vrtsjh4xpTPy{|iUu%)PbBleB>oEMChq)ExOvx~$}5_a8=}u9 z3&{)6f*!lOeR+d({DB7Xz_RXSMgUP8u50q1GnjmarrrR2yYqTH#{mX^B@bYV>iTT9 zVnmO^jzaazAr3h*I-y)AE7@$S>STj9Thi7)6sKv!f9{OhDK?=P=2#TkQIF6LGm6^T zchA@P>_AUUQ6Oi7sc3Mp95pOm>h^d4(jm4?W4vGYOIG~Tz|z4%?mxC7 z_x>;LzIOhkjWKvO6nz2;dAxPvZSqz zJHyem^>b?CfObuLSGMUpTh>|Il!OhXj_xnEKvkH}xM8{2TytWjMsvd3T4UMgjGTR7 z)>YzN=A8S-o$P5qLfh60RZm7(bn9-@Lfq?WQ%~taz-aCv+XA6x=Hy0h=l=0ohf()HrKE# zf7wnvyhp;gLR$5uN(gCzY*`pNqrK|426>3oZxGNyhx}IHsXVseQ2)~luYdO7T`o6c z-PuskeqZ|Gl)UGSVtXNQ!T)01`jvY9{FwDhRSOw3au*tmi$uRAO-;h!a!8A2kxP(H zRqoD3Nav}_@LE*2N^4>+j{K~_S@q+L!NWI~m*#sL?51y~_8esnCm$;na;l14J^fRi z-R=!cPkB~@y?h2!y0dDPDD46Co0rRhoWImkuEAYQ`Gp_RF z8dq{yoX!}~WrQDbSH$@A0R!s*()9`?kQd`<@BpgmZ;9LPN}kqu-CcQi)FkEo`Swts^uj8rK?U9>qDJHzL^3b*3RL39sG6AcU=iZMDH;X^sxiiU;jp3 zK*rI8?gEK<0K;f5TMAslJW#juBpFP|m-;zdAMX0>V06BNwpI)csct-{Dlg%k^L@U@8 zaqTOv_N~aP%Kl?jk@>6j^W02P2llFTJe~mYaI#p1j`r^Za@`pZEYc{}jAoEb@Q8H; zvmivI!}x$-1*)!KA>j!gHwkA`$DK;HZHk(eObu?^-6s-ni7haTx5EzIXO4_tq-Y*P zG&JPIftO3Wb-*)7=CKTHkocr&OD5qORCU@Kf;DW7a?D9&s^;XKov2+>3NW9YFSzf~ z@(kLrEcp_n?BWg;=G3Gpn@lw(o3FCq9I2UM)a!$^9z0v7P zvGi{;9`cz)ug>4giGHW|;l4t|_|`%*1@r{sPooa2b%kKDdK=0v*IU ze9Q$+^X-7}D^tue6Ad_g0_b}j$P0j?kt{bk_mCgO#~%_ZlnIbfiE7M=^k86fN68d1 zw)EEQ^RAA-W(ZrISdrypMCdA_gE9vZJboU&=@5kCk?*;Pp8}6fkpXBOKr*v8l`wW@ z9q;l+G_PKKMwx9kgU}d`95ls@#;Xn$0Me>UX}nQZT`F`?NPx z@^~GLz4AnR5&$e&q0LdAFNK+8d0g z(fR8G6*%Mr6_id9MZ2DgAIqOo+}RXzCMx7#lHRf)lMLih1R2@c>I7MEXYZ=9WWiWt zKi$!#`B{?(oo?YA$XX;$g{8hQ_PmbqaN>F0x3JL9pjxZ{yIiF0bs?XrZ6j=kL&z%{ z{J2o`J;e2#Ij9+1EGU8&GbsE`DKvC7q^{vG%Ntx8JCSa1UFlR~;da@^)X=H6Sxj23 zFRwZw@`B~%qA&Z+O}!QTF~&WB*7Ao?V_+`ht?fjtfV5iwf8X_Ok^B6@#RAku`3P`JvosCBf!4v|rB>ElvVr)&(M+}D<++r}ME`P*w5b1_1 zj&yzYQtM7BW_#h+4zben+eRO6>pZ6AI=&IT6;S?tNGsw(V84jQ_hk=qEP7Ulw0n5J zzo`GH#Hz4MDP_Rimq(aw)Ay(e#UMYWXqR!gCqyiWCI&`E+ZcTA&^+TAV&-(DJgMc-c zT?omPmc%+Ov5Z$=EjK{Wl-{*7+<>}Xo;Sny*dEYbZjOZyXrBjE>9Y--XLV#R2G&9` zfyl8U=PIcf;H)@LgA>Y(&IN~k4=OW=%E=1i0F79D8f*?08L}~w_LkE!%Gz7X%c$~s zhw?HzO0H=E?S0_1$#c72E-0I?4;L*4|kZpX(0u7`>~9885xpvsR7*2C}mLzESZ{SUU({j-8|2UE&9EX0*mfU-MKk!N#)$%;YMR&3>P(x$4j#`D+fE%W9IAN~b_>Se^KAg=uo0zgf9uvh&~v-6>x zQ4}zVu?$}ws__A82S+oAg(*iflohZP%}}L)gVBs6+gGMfEQV@L?3^1vt}Zd#Pj=Ql zRKH_W1uyhNvYp>gOlUvr=infEQL!7HzwlFLGICf~eh%gs(jMn4go;3xfI0&ykp|Ho z`V8KY_=~CX5?;hjVU+WHy0?ub|P&B$e(8PErjRaTe7UO^qnbT&r~=5 zAuexKT*jC(TdI3s&tM-kT>}Rkrl|-qF*c7Fzrty%cKIGEbwnDv(q<@&EE;zblyHX5 z1i-$6AwH5C0%x1VyJ#XSO$za;33a6nWiFCMFITa8Qi)*==;r;Wt$dTCKuIMm|2#M3BWzSWE9hk1c62z1R7xiWN;vtA+5Yz zPDG{(u7`?fsbM*;s=sWTbf{tZR&y@2Y_8Vcy>j4i;==B59h<*L=&nFLB}Rm5k$8Ot z`^@0tamQC}0=m2AdmA))B__t9<507IS}oTPWk68&Se7~EMBx$3{Ldc?``b1t}}gCvp^P_eoc=ycT?HKe%(*}PfP<|8r0>Cu0`90!sBsyj}^Z&d2h6} zZd$zF+rhOY==}eQ@#tF@+kw1(zu(m`IWZjw8NN>h_eI2dKK!pq#dS z)p|IVLHGd)LIGJ>hNalvzW0*v#;d0TPXH={4F{y-^88i z?RC2a{`WBgbT>T#j5gy1ZjHM`G$=dw1W+~NXu%EB#swJy+495k6TDn(fl+%l^~2i|nvKR% zpYaHXL>3u=h{G)$lszBmIeAVGM?zF+x@|1kkzzF(!v_hz8vVV@;8-)nl zW7XIFq_`$`8s<`0JgfvAIbwRC0xD!z;AmaYHjt~PM~T*{PyYq0rjxET^gTW;H~zNY z?}+X}#;EeLWa9#7kF&>a92|^(550S6fz@;MS6hrFD^9N9zV)w|;`JOha2A1OicSEz zgGUfpli)M?fkMDnx+?pX^{v+`*UD#H%ElCgZl};pBQO$!sWiei3$hrCacUF?_mKdv zRh5w#EYE=`PCAa_XkJdge}-Y~yZ!gaSJb8SW7t9<`54m!MWj~rE$gj&;!XBK#(fO( zbI9srrv16xFE{{IiVlG=T)f)V_**4bM|If|k73zhR82bF?m zD~U#ox)&u8t!gg@!)VX|E4}T>`ZrS}s>1T7?>U?3I9k-|yKnANJGT({;F5Gr=+qif z5aSvDQ;*k!wT60|kf?J29M6c|zIj*t9Ey>;2K4VGAEV9((rM|;ZfMO!4mYh12*zh)kb{87q&3ju47SS}h~6NdzX zoiu{sA4Pvt4*#f8?L*-on`M1p5?h@x;oH2P(x{f$qK5f~Ms%!2OF#y`f&&Qr{^>er zAU%$$acyti{!z(_zbD^VFB-7$>3Z`8Taqq9@N#7z88*diQndVuZ8Boquo)?`1+$b9 z*+TO4Asdrujuc|7QGq)oDsC> zw|;EtMAkuugS4Xdj}74FelGg*QIlH$)@70FjPnSCKv9P*z{oA4&#k-@xaz>25m=}u z6SuN0_K1m#9-ZkJrM{j*ah6K!gaTv!zNDNc)+8YD?y7N-t&XL>lI1lW9$oXAy$OfF zG3h)|*yMG++vKg;A7=`b6namhqrCr^>pQ=_$u(HM)bB~y!1Pc39J)$%XYuyKv)oVR z&7ZBAFncsdmiX)=)}5w!LC-=pB|&G)C}a{Yrk!@V6N;Ku9|9q7TNP7WDZU(EGG8xV z_p{T~jqbY47 z%!iQM23Hkg3X%s-f(x(`M99*tTudSWVG}jSEo%tlwebc$i_j~tSz_l!oYW-2bH&G! z=b<+2XZl3ngdjFKPIQ*-#FPhU`1V2{=;dWdbCajQnTM3)qK z43|8q5YG;s3^1;sj*hG$(c<#91gRXlhPX$WO5{U!(B$8>aop;eky@v(!gJx;zUWV4 zikji%S(^aCnP6@X7`$E!>O_JEKp(8Tb`9uyNWphE)G{R0&MVqL!SrgJlx9`uCQ zjkrz@VoWU##=$VCSTJ@r3G8oKzt77AvUqRZ-#)y5s@J(zF~CS=X}hFOQ7)2_99P)g zq4Ww+lQ?p-4I^kEgiX@>NfI~YFJ#gv$Y9n(RtRT?0HY*jh9qn?mbmoH5P?>!v44YD zV@2C8lSVW~v+W>*kCXTWy#P<}*p)N*GUuC`4E_-3+pZJ0{w?1VIk!FM7=I$&`+9Qh zmjBvhaJjfOUT;f$h48jx-MIv=B&(^#!5#k1S{GZ<(Q(6#mbe%CJ=gR`I9fgz@GB0#Yv-%GtCP`b zMSm>wQi8D{nE^E&58+E#Whs0qk6Y0vO$XOmrMyTFHiY;yBYx<(r`6L6K-j6hEjssU z78EmcqQb|N`wP%IE#p|nbatXf|0h>M!x+}jGFINzf|~aO#%zuIMA_M}5>_!>n+av3 zq3cXXhJk{U#!G_hqsd390fwq@?NDw1*4MVh)T3#ee%mmlBbu`v`Hqry6r>3T7mxhFrvoL9=YF$JeBB+`>?=A@^c;KQ z#GdLYqYNfg*QY>OC1fy|{Sb;3$Y4ludN86zGf~n&a00AI%`pvn*8H2eLMjKCZt@NfWzqHAiszwSTJ zDAiSEQh5A^DH;G%1=Wm_q6rPzra}lTWUjzgf&vFgq>(~2*y@U*7P%>qDpezcATy)? zXqh%fh$wh1z3X%BD_2?nYBT)Na>O#xTW;-uf8}fiXAZv|dd;~D+zu|>qit?JoO8#+ z+Q`iQ>%aSTk%Kwp=S~0$4;4fAB={~iqi0T;)}Ax$>uluqUwy`@`MGAYa;aJ-g#a&w zmUPAw63o65RW|B`5Y?;BV+mF@y|MYq=Mx!Q=^Xt)OY9Rf^xhpFf9Lfs{sbd@xaV62 z&=2SajuW}l#ZJ~z^gsA>=7t~;ZdjVllv2Wh7)Buy5}}6-xL$8xRYpvcQCAw zeE?z(AZaimAOPSA-d&`|5Uz)sgek;6#wCWAZPusA_Obq&Q=4rbw|||t)9(h8?(py3 zRwRnbzE&oUa1ZV(WCS>97z~_VTIUMaLr3txDRkWxhq`_QIVMcUa!Ha6K;1w~=M7Y8 zOYUZB-DQ@iD}3ed(}FTaG?PllN6B*HJ^8(O(QjN^SprZ9ZGG0B?lEOaI(A_XQvqiV znY@4rWdjC=2b{Xlga26$8{VD#k+ANXGoM(pTt}>IugKM{@VZar^#*Ql>R5MJ-`TqT zh!r}Lj8jxkpk6{0GA-#1h<5N}KrzAYlmR+;kHTfj(vr=oN}dOOx3?5iqM77O40o+k zAlVhV3xRh5@E?W)^x%alcWlQqT&dov5T+hc*-Ti}1+pliy z$_!)d)04vwdcP)r_KLv%Z=7lfmcn?W=Mo>9=-AGd<8A zrH8qMQv*||B5#9#c@I2u*j+Up(A|2?talGB(-%}ZR?X@OU!`C2P+V8)D@tBsCU|2Z zTM_~Wp$kon3aBH5Eh(2n5^NO++|WIV%?p*-s-eQEt@)82O5posPFTBo(P!9(! zSbYpSf^(o^bN?~Fu@;dlAh@9X~XFV0c60=Dnut$Z<(oi`5K6c2zu3|=e# zZ6--?j@a@_8uNQW2fnfSs^=5YJtyW~rI}mgDAx-E3~-kLF;){4MxqWRSSt`hYY#zi zA6s8c6Vw$!N5w!6!VrL|fmy=4`?crd!f%E)w~B$VObX2(J%kOVp+WF^5EO|I8AuAs z1|Z-%bp^peaNWVif0pETS7|M^`Tl_-M(`sZmHS~k@Qtkhh|^_qesX_K+>EhtUvK!r zSN8E-$I6@h!hW-dcbw-Mxl;y{SF>0!k0=rq`r_-A9YZQ3AjN6`mmiD?$^Dm&CGrif zQ|5peOR50;!9YdQjHGxBn9y>3>sRv+FnJGF?Pt-%XLRcf0&CK9k_;a5eE_FXCKQsOCoKaI!xdZGX?W zyw09o#cOowV>zqGtI-Kfz333*^)sx1gdWj(bfB%^uY03SxnWo2Qd_TQl6J%+1`n#2 zHh9QGOCAqNNP~fom!2N{B;KK_NN{$r?CXu!G=DWU9D>j$&mLfqjTiYpHlW_>M*-B# zmV;#SL#E9NnOD~0_j1Sso?(lwg+u4&7z6=XJP;}EZvfH*Uxh!gwl@N~d!YutR}>*- zfwwr|qq|S!e(`u@Ud@eT)}r%@Mi%kshfhojZDWJrf=}6WkzD|+6Q}}Bb^+AH0ES$E zxThXB^D(_}JmkM z>y)5G01ZP6@k#!0hMM%oP{IEjuczg{uYY;#liC*DcUxOxv%GeuXs26Xv~Vhrz_^$b zM*jjaet~79ZrSXEug6)Ukq&-?{&CdM^|@kdDwD!qNtXd+l(OiS!U+UTOEvV;B^)V$ zX)oK*OAlt9Z3T6@uJkcbcM-93SzTOS>_c@`+7(sZrQM}2rhNq~wmkpnwMg8E`lfuv z!ua4AVA2N&?7ees?fyfBY$MQn=UbxR=J%PSH5=o)G!qn!H{$n=*y_}PCiDgmVu(KkeaARu;?x==Kr*I9pE`$Z@)It)~?#o+RD2ZiX=phBt?vxjR-;_njvD= zs=aH+-Zb{CRYGH@#3-%UdsoaF-|s%}b3e&@j{kRE|Lgm>Jl=Djv(J71?s3MGU<=;) zc1ZHM!B=u6za5f}-+!(Bdfofv&Z$40c)Wec+Gm&E-HCsHZ(HXpr{3?~|0w^va=&(d z@o?t*2j|}Hy>f4Fm*Uuo^B*@A**|bSrRjrP%B{5L-wpU#x6*%*wf_(2i{AWU8GK14AOi48Cmxnlx=u zJvclvET%?_sK}7s;+?N=RKNB$OgI!$!;Fn%CL^fDWwv%S_(z0vkAZ>dW$=j!4eK3C zv0ethkUrmpg?H}}i^Wb5K2=2TD6f~HacoFLc&JbB?h#?$Q0-dAhDEl9;fFT?;W07c zy}P#w?;6_!pOL}KwpuY(lB9k;LZVxS#a1!I^a%+KGyD)26&u#ION60MNOV~5h_G(4 z?qAVVu^}`nGBU)_CoDQVsw)B!QN58NEG9M_KYR^-h6aX)hDL_Qh5$p5;afusLrX&| zLu*5bA=J>-5N7CR=x*p?2siXHL>M9sy$w-@K89#Rj3L$#XXtB)uj(a6#XmeE4A!;S zqLfAZcSmTf)H1G1EDbn~y2;OgEU{r2?}(7tum)kFQC-6fn!;ok#yN`7?*8nT7}q8t zxMlpFy{5?ndQD#)?!P#4e{9UQ+kcLYTv2oM*|A=SCg!aYQfT8x*``h&F``05=e(0Y zDxYnC+1B56Epl+t!&3*hZjC#Ac5&M7XIsM3cfG3_Gduof@j8!o*Xy6|!k-;`Z@jB} z=~DMs8}m+Tm~-60s}IN2$#}kR@+XT{b!mQfdBIgqpR4Z%e6o8^!+M)W51w&+*S^Ge z-QU(5^!0*@*-M>oI(Na9hn;=iC%9fescPLa{`*aB{T^L>G4sgJvsWFi8ogjkNclqd z>=A#$)QUL2A#_w~z8mlBJUL(eNRxmWFL#X?a((ovW#$dvd@NnU=Wr z=Ve`ARj5#DY~hP(`-_}v7+&|^7HKWR%;6JL+r5vg+kViXZ4vuBx9|MIm007muqKYz zOPfq>QE^rDvY=rVPTm^b_UFXQUj}|tbVu<&s|QZ+UTx6USIe8ci+_G4_{o_2Uo9A! z_PX?phmZ4R|LqcYeW|op#2|Oa1+peXoDPMx%Eh=yo;Xi_v+#J9!TqGiZe2$rl?I{OP-^LFtO= zU-*v6abUsdEe$?@V&5zCOLOMMo%;r*fBPrU1#F1t4&cS5IIBVzm;SKl(F=b$cWMP`2X z^s^Op8rQ8lWaE&-rz$>Zx}ejAEg7W@)6TtJab&@-J0dP^TpYIS=n2Ez_In1ts@wJX z;&J`B(kaywNvucs8$j zl~NZ(Zg`f>c7Dd-`iDk;llS!M#eWYkT&8Pm*q%=+Rb5(P$mpHBYTG-;_1Sy5Z1`7` zS}(ur`}Ad}*vapTT-Y=&SNxwDF^6UrFETl?SoWVE?Mp56>P6FSdp=*8R`E>UH5-#o z`G;8^*KU`XG&9GE$Vn5A1=KA+e(bb|qa0Ok7Ia{zTC(XY4eA_l>?nbT4PfBVt`{J-N z$Ik6)WNhwSxP1HK>ff!MHgt{mSCyYEtrL*2zt2Z2dj!O-D>$Lw_bYd-v$tPeX4ns( zei3yb;%!X7zblomnY3qG`h~;8q9(sBWjCiisdKZyo>HG@+w}V1nSXd~zPjSQZ}!dq z+$cAD#mIJ5qi$Zvee=8DpT2z8aZKaLWS8%q;PjNwlggzATq?Z%+?>U2u52m0`0o<- z{!4EyvbCK5Z0W|$ImZrdVm}?2_s)w$`~Ug8)!26n$1Z5p?&#{@yiR|=<=u$MPbxOt zz45}d`ljpMexH^wG2!)d`{vvKe4Dl-ZU68JT@rpgIcwdysxg*lg%`f@t=A~1eCpxU zcdt)e-_WPLe|t;dzqTc1lE127bil-g$qBitq*z9U9yxq8b!7H$=bmYG@>%nZWH&l`Vuk)ESVy~}y_pIrWO(I1C1 zqCVPCHTLp=jGX^;GI;ycHEWkI zxY26ncMD6dO#AGu>B>N_!}CVuomcZvgH_+GEm_PS-FJF;uPYtBBFq09wB=5tp}ynx z`jx%iaPwD}?>%dD&76F7MEo}`6WRujwFe(;bT9tNuZ9B62HJN_Tl9I~jGFI5%jdY5 z-O;M9@6=8WK3#u%!l6mUH(5GG7xeYs(=@uFtLy#hJA4+EDxLiA>$S%^J*giNle57- z)3Peh{>*p2)1N-3VL_dIu20&wu6&o^-~Mh`Dq%}}P=WLxOZ`zP=`a6;;}yem-+o{A zw}sKS9fd|scxStn5<1bGYBU%(%DASdWxE_~pLX)PeNbeI^GuU)|<8>ajfaC>_BUC%CcYZGm`Q|^xi z2`vJP`W@(QO3hL6S_41dWhYzosJUunZm(AaU=0dXbsww=8FqY3>}eGdj_ zcz4g%IpgS%^}Ua;uaQx0{>2U*yX9EDyOtsF(5%Lz%_R%m41GNQ)9Ah5-T1M3(Ib@x zq}1HLdUgJ1TZZ)yNLuyjN_!)}?wtc$_8it=kE7koGM~+Oe7|etn4I6W_05zHV~^gSFnL~+cEtue9;W;iU)z60PQR}|*=@|3mf{~j zw?wDu@%<9I*-rbl?7a7AyN*4p+Jb>dv$0>zzznRQO!}k}V@PO#Y_K z^rZ*NHtzSna)+jS_EcOqJN?ws$nUbH^+-vXRqVE3?6j1NZAZ+1a{7lRO}xf0Th{P5 z$Iv|;+Kg%Z{qYlP54C;k|IO0(C)1}D=rW>B(6d|iu0FNu)eI;(drqfwiwj=gTzqrS zb>AkG?(Kc8eWP|gs~w4KyXStzq)NMfT$R@9^!C>$2DGWSXY!f&uJsQUeAM{fnFp7z z7I+aG*x^p##S7K?B^GJjIri3wQb2!oj!dQ9O~FM{oM3cIrc^lP3c+q&9h$z z^)7U}_Msfpe=6yiHF|slSDo1%YEIvJsP@iw?SHLxBdKud2I(j5w=&X3%{lqglwutV zOu2b(`rnOTSFz769XO@Kik4TB*HjBWTVcRd+b37c2gWs-I(2QcAM^Gb^rp%`d0#iM z#x3p`oRoBI=vQOc46a_SZ|d3KnjWg&#QRpC$~$KlP5mrzc3QXik7jKBV#N>Nd>!%m z?`sg6eHteBC##{)5i<2X3oXH*nRa zhz7qt=snXur1ptXw}%y(+cG{1_Uy*-e>M?TB_j=jyL zj{j6GZ2BUv)xWj4^?8G!C8@i1*8OE;?A%o;IWL8DzxeycuTySb=`!=oM`zkBnNaA& zt;q$Ocewv(Mr6|PV>N1jH?hX51(UKjzMfp#RD62znZ@Uhd)0dP`J5wzeTG);yztvE z#|$shJutq~n~~>7?BBh!!?wD!=HK4nJWpwt;m2fV2!6&_{ zEH8F+QuCiH&p24R*`-_q%KsYBH}HI~(y`sw2Q_}VbnEk&{PRr+XXKJIMf#)!Jk9lUy#rO&98UYa9kcBtQ?lmE8&?;f<;*ectl?9rJMbmWy`JO1J}7K?@3J! z+|Z|If!HB`2LAom+1W`C)3+|EW$-@~ykkSlay1VA8CL7iz8m&04OUdcW+wUWp&wZL;K8(4h*~I-UPM zul=e|i#)TN*Q|NYzQ07>T0V;pjyZSfx!A@q@jz_Xpk?Rp?(RIK%>~2Gd2uaY zw0W89UGw-$wu`QdUq3$Fs@Y}lXrTk_+}JH{OS==sg` z!@p+xd}#RxKkl+EtGCkj@yeMwK7BPW;?TqJUOjqjnj3L9cgUXI>r4I;{HVc;>(8EE zi8|QRZ9@KZw z&d@$r&t7^xBwI$#g)63&eH;G#z^m~yMyJ22^C&e($Ex#oUPxbkF<-CC2}uj?ueW}i zc)#5EfMet9bv6&Ve(`?o0Xf#TEZ*Wo>7c_?S1jLBE%)lL!opf*Z|bUFV#fGt)5-_T zDLP|Bjj%84%u4vpzvbq7spbyv&)vQE$HA!P)+3vWHc6Nt+A;aFY@41Jc%NEiSDAM2 z@&_f(o>DVB_5R&EJs#aXe7oSaB^kF1mYQDPp8spVl(&OFO78b&aEsnW%A}9*o$I_f zu3Vk-ksUW)_qjH8SEi67;KHw=AE*x_FSZyW?F9ut)UOA#W-weXt=4Z(2AF>!4 z_J&IcE--I$+P4rMuWzHHLSyRGF@%`$l}oqRvIPZjgh04#MZkyv`P(UAbYcBjEJ#zp zfdDO9i#K)zXpLS3YzWYzs|Z*TpmhroupmJGdl8_c3be-;0o*}^04;in0E!kX{vv>) zamj%821Ua?ss&KA*sCIvp=hylM+DFxvCl&U&;_yKiULm5BQ~9hfD-}tc;F4{5u44$ z8`NXuO7XQC_a;^G21SbMR0d1&E_@spm ztM~5y;NxuWGc1(MZbv{HDiijy*~9@R@rFv{dhk^Mn>f-&Z?L)9Cj7A?fCAk9LwaLH zfJ?KP5#WKhp)_$|m-665llz3S2%t1^{#pcV2=Gv0bS|-cSJ=y_v8F$0kUe-e7;LOfu7V8NVFj3Lm0u#C|&cus1R1dengh3Sdd5AZtM_i~N z0;osaX(<92QL$nn0;mUP1l(;iqG)jyEWH8C*u;gnB0xoR3yf4W^$<`x)HG#0+J z($F7qDoqrCdc-~H2!MTT;)ZzojVi^xRrDJ*ihVHj8x>*|O_b!q_=!CM6py;aDKPqt zs>QYm`i+{!8ajT1ZQS2=q2DM+oGPH-C`X(Hrr*dbj;hmd%B%4y_`)WZL=f*l+ZbCM zXd6R|1LZKX;GB<5>~f^^=pzFLu?OP?aR>I_iN0VR*v0@sjKcT;$3C!9OM`M49dL83 z`+LDC9~X$aKf;XPSWa_)mYRMejaa^<->8e39Q!2PpL?fxlrK(>;5SI!D$b$MZwG#B ztOBaHGUsDYvy~YiG;bBh)sP;9ZDme3+wof?3LMa~GM|IQt<2`Qz`*Kcia@8NZpdP!97qiec_X3$P?5N<>EHQsiSEHR7jM1XgEEJhdk5Jf+)U zL{6;EnKI>pmkvspf4Zu}-Chj1S?txoAegXTYts1^qygsFlHrmV6F1I@I+%W3*b~b% zfVy?0!G0bS(~Q&Mr4J`KiH8J0NnfjSH^YSV%wbq%<04IFv->Uyv<~NcnTfH^#Erq- zTqYeu@TFy*P;`ao#OeOT4~hWN>yv||8eL+o+Qf1ON9IjBof*A&%Fqm+F^EN;Yn*Q| zF#`jnOqrmI5_O4UMAvvSu`Q7H<%>RJNO=@diWhUU8Qj1VhzZwzqGt?E_$I2!tj#@y zfQjJ;bM3{f4}$Pw*dPGcrV(G!6pM>A*Wf4yB8VTePC*!beLOLtOl06)mM_Fx+HYLF zr(-Ep7F}Ne954dl(2Gfz{1|E`DF|mX|Hce@nHm0YbA#B#PmKh5F%_Ah_?VeE!NnQ@ zV-74_l?imAqdC?W&3b1+JB$n_OtFP$4foDsM09?2VgPyU!C^el04R&jBZQKAS%67K zG!r1-s&^D4ZDahw9ytst7luz{XarzGZ7h4hBkrROM5U;KM-pFXbALq;@uWX+1(;u} zo5JeW&0NBz%^29N4h;$)?#AjZR)GUTVxzd8#4 z?QzA9M=C`q-SiSrt$j@jgaC{e`Wd}|G6dciNeKSX98}jiq$np%HOQ236pQvq3W^s@g`8U1?*E``iK@^Gm(~l)PbE;zf}pjnnj#)3NL(TQ zcJ#{J`f3)FqAh+)){gIgW9rv?G=KsKA;2vlzGXRQCIy56-VEt!WkAL!>k#15NFQOiGm}EX z%AuJw5*_9tIIMy`sHYHER>n1)ZbE?jV@Bs#Oqij8TUkYf8i0T%6U`>HfMtRi!p+LE z3imSu!Zd+`yU!5Npv??fY|T_SP;{mNilQ?OP!!FmZidorWt-Cs?ZC>&N6>6#RfbGc zs}A!5X|;ypLl$_W4V4LMv{kn(p+{SF%MyyTm6b^nD^}giggmvf_%}hfvFb_*K-rpU zW@6xV%Mw6kWwjFm9kNzelyD4#fggA4Bf!!HD!7GJPv}wzXrcz%0RpTEK`vTYGl52d z0Cx_;#=^R&2?~LQl~LSGi)%o+1(2T>R((v+-7UJx1NFzE8=%nSEv$-|NQ$zqLsqYa zwH>H~&`h{!h;@suctOp#uwFv~+@c$xQ2H&pE(GJ)qN|0F!xnL!BWTnF8^FS7hs6BH{8Lx9lEnCneI3JY_+2_}by867eX0d6&r!orO1RykM!08&_VoefA~VP(n$ zq_8j^2n~*{MyT6(!>tBVSQrn;BDXLe2n~?&08$UC4Oa>XurLHbdqjYV4-jBs2rvNx zEDQnA>k(k$0|ZzY0$^bvz&!;7SQrnWD-~e%i z0QVH&U}0^EG2E$r2aArfU?aD0;GWpZ2}w!320`k5Hioqo+=QsnQ;Pi zY-X5%z@zPfLY9JX%?uK-FwBe*phq)91Srs~BLt<^)hNWir_nU*nmRCUW3QdqZ)(JmJ6pm81!pjM_?44F%pI%<|G zRDOmQvX`0k$t>fJlUc^hLS`e)I5i0HHcvzmF4 z9M>BELtoA`k1-1Rl;exax_NA&Vbeq;(lDu!5Mu=jKeYsq+dNm0Wek7tx86r+sZV<1V&g7cOG@St}y6J2NCb8`d?MyeF&EyJT zc>qn>6hg}feknbq1R z3i`0E?ekyR+9WD9;34KTvjR-EwpoWYQXh1?ne>NDyP1Tf29;!Mn=|cZ&@U^^WO$ny z4b1>a*!AcDnWLn2u+mJ1H!9{gsFXEmGQ45rYi|HNF!DKoN*Png3I~?(8&t}$OIA3Y z-F8<>Dhg}RWQC&@{01%1&1--lD%ReRD#P-DOmdk2{DuIMD}?}s`Oj}iOmL;7^RPNi zhBu6SPKJ6IvB=g&@!A_G+VqincdMa;yOyI6#^WR|=~E>)iYX8WroDCQ`Ln2PXrcJ^<%#8~Map+ajBuzS`%013d^8 zbAVJs9yeGUD1_gj3#?9?U~iaMp*BI&MTuH6SRYsp=K#9Ex*XZ(@DlJFbb%EFTGpmd z$GDpVbiqP72T%_K3R&T(OM3&w)x>~83*PVr@Eg>_fI=oYd;$ChL&e%3+2^R3-=I=P z7c$o23*a|s0iz2pr9gmN02>DtYsqNUhcUzi*g*0821PS$kQEN|pWmP~h7DRIhc7^T z1K4o;yGf~rJ!E3oAp0D?08WPfFl>;qj*9sWDrI$)jCB*k2HEFW;?t4=Hc&hVP#Plz zq!R*M8o&X%8Ye>+7#zqXcl(8@p)ko&yq1hKbjAZnDFnDQvZ)vX$O?B$ZBYPjnTx@<%(k%8*>nbHGGoGG zXSM`aGE;){nDM}B%xPdW<})x8^AaoxHcMb%u=NK6h^-i~7jqYEdFCy!7IPMOiCGEE z!@L8Nk+pI#4)YC|gL#7tIc-wKg0_2rAo5t^fj*f$A-b3Z$tk1_GN_D+jC?@a%#pgT zqc!{!+DrqTdC~#LOq;-8o^TQ^T3SL__fJfzmW!BDYa-}WO9(=6|Dx&B;!uC)GBvG< zay}3mXi}@0{Pns$4!fAKkxU+a(V7<2GOcq=Po{NF7CDbE?Jv>Ib08U#aaSRjbpxIJ zPr8K;ca099aBS%&Iz#|V0C;-XN`;)tw9zqJx{Zz!b;d+f-9rG(V#vy3qLbrNx6xt1 zu?T_yVfg`>#Ucx48VeGLD3(wVp1O?=38~xY5F0EtAT(HJz^$aiI(b4^6Cz)4rjZWD z(v5WT59?Msd7E`Ro&1Vg_sA2ebsCe%NG;YywEojx5RDpW*`A3B_=rYmS>dr@P$X+p z!&Jx%78kIC85?P3MI$*{@c59e4(Z0i4Z?(F39Z~{1P9HOMF;4JBhenMp&oWR^ct-} zv~r@`>9mle8|t6}76jt11X-$@}*mS`QICO8)3BCy*nJAnQ`T<{Wz9tHu1 zn0O!4fy<6*C`i}>)ZKy}HYrWKfL+ZrgWrJ$kNyfu0p){BM-9{-v6?Gf00NA)TzWxb#!wy& zliMFb9TR``G+LPMD5al50LUr8SYToDMNnhuudoR5Ln#KY+$pr@2NDPd(G$7lj2_g= zN27`GFrD5j%OQuLt?_n^Yfu&@X}g#3lt-~ zM46}PF*j~@$=p6+F=yF7VKeDoA~IrW9fg)3X?q&|b0X{j5mG$=6Yrn{aC-V5-gB{~ zjr09)|C6Vk{?YzQ{%3`laY5ubAhzw~2*N+{8#0;pN78TlC)xmh<9AN&H^KmKcRI>T zziA&Y=W~Hk`8UN=In)OFpY}qdy#Q$ZMmlPH*8eG<`=hrVY3MhNjrLCOKc%OIP0>ef z9I0+DgUY6@bY%F^|Fne?V>|I`0eD!Qaraf+- z2rC8xHMmjUnS&$Bz0v=Q)5?YYZf`k?%v>>4c2`xxyMM5hIv?86A z+JBg#6;0dLFJ?eRYH>m?VcV~3C$Ob5PHx6!^oxw zWuaMvtw0aTLh}aYfgY5FrVjcmJtzmw9@H0lP!5_vs2o%v%^{RQdQcWCWua+=$$$q< zBpem=pe!_(aBt9qa?o_bDMAm*0mBkcnp1dJ=s{WRl!c}hT0A`{3(YL-9(qtEG`aBm z(1UW&{K8vA4?)#5$58U=L0KG>g{B#fCwfp8nrV2b=s}gxWW%pT56VIF4R07d#H7%i z!-+-@%HpCdH0|)e(Sx$k%mcjXflA=nqX%-p`$rGtfQOJCG$}Cq=s{U%>R}GjgR;=f z!%ImI%0e>_-zGgMhu~4cq;4*y98jw1Nm&G|3SJe=D!7$q9?n{NP$e|;(81|JIcVnL z{-p<1LNiaxWO&ll!xEqeWg+H;3z{C3g=QX(YkE)?nt8w(JtzmwJe=h8pd7FaI(lc> zc$W!kI5N~VE;KB-h#l*TV`tf$uG&-u*t*hNq*)KY*8&oGdtPp^?_6M3U zoe${d?T&-MB-NMxc=vY4!P99cl{agg5$6#|yOrXEcil4%!w&t{BMt#F^*!UT4@s&6 zL?gCtWlaYP6T9!T#-S}@BZm|xPUA>%PSW9}I2U=3J>#(1R!N5g4=}}~bYh2~6lWvr zUXCM0QHpbtLqLurb2$ETEZcHwW9(%Hy*mgC4;lHy$CfRW?KhvgaP5X(SPoY=f0 z#fgJXQk?>Cabi=A6erH#NO9uenH1+F7oZg9B4>nWoJ;tx zr8u!XBgKiG*m4|HH;U4E#)!jYwCp6sImiVn#kt55_lUz0HFAT>apbm;;>3nBDNgK) zl;Z4U4oYzjsEkS+S*cPwC%FftI2ReJavbzFDGriasRJHir4C3*HLuv%>sbe6p-e+| z2qR^zAbpfJL*yuJhKy0h6h0iK&46e%PMo&#Y#;VKDSgA}SQ52PlVRolg zkz01BI0PxB6GwriIH#gB*g*!$IJ?9qK+n7`RfgJKHge-g>73+T@`!U7jSBrajAEyN zluo4~2Wb*Yc@AYv9Y!a4q&>@nL89b^sUXv?0|tW9W@znd9417m!>RDE14^$_FH{wo zCLK^p<*|o|SL6}M?*rvI6@GI7!{qsJV4tl__YQ2=Rnv(h6Q1LTP29>@VRO4u9^gPJ z59c40v4Z$e^E%0?>RB%ilqzFo6FXR>bYkDJ6emvWN^wpFuN*d~f@=<_DoQ`>V)KG$ zd3JF!LXIOJuM~%wQ{r5TPUvu`a>n5h#{)debBM#+Qk+wfmyiGo);R#N3Ozf;$z9L# zoGLy$T&hfVxKuq1akR?oSsrjh8B>=-(JdSi3V%4E)5zoO1PLj9gSD)t6Du8_^}?c6+6Pup z+JZgY%D7;ExRMTPyV5rt22j(fxC={7k<(6`mXUeY342xP8%|2ebO33jU^~Q{+7FPa zjHgZD1{`^iD`OT5%fU8H664mC7ny* zHy7l&k{5>#mA2r>r5Xn$m+Qdlh(ZT8mET-oEoH2*+M=`tSE|T#?}CA@)Qh2)`4TPw zg)f0%icaIQyA*7Pb)@KjE{AG|x*TABc?=vb1;<@5la;JeN!M&0zsRu~QHyPO)ZfGd$7arWB7jqfy)rBE>mmdjaLSWW2|k zgQBw{PSIHr=a795h;zwu3z~q~&g0n@c#0*gLpnRHrc3FZSOS#dpq41G~!%p9k>ie;tzO-#DNdbI&e*pGA_7` zNog}oCJA3)fhoE&;_R}nhd4O<znj^?drF~A-W`bK; z!9OGR6-ezfLiDKh!c>#eVKGdxIT5Gm@`zJ(d90xs<$4h(4iI|IkxSfSBgHvnnTNbE z?xk@d=90$>geuDvEah2cnSwaQMnoLYSgwOONsW{B19&1oP%oCzWM06=BiUC4hmqK= z<}n87nQZSPow)f(N(Um6+lMouGH+phQK3^bS(fqW2E1-^c{t=P^Ba~^WZfI9ql#}G zaf*J0I9RN59gwxk{K9rt`T_k}8B>UJrOnWlm2tsUaB7_5-@w|g;@?1=UG{?@PO<&q zkXHPEh*R_f#EEOzJm->(U3pxbMp-ul35jDUo_S$dD7@elcgaZUoH9mWCo2#^t``et zN?RaS6(z&$8(c`y;>^(c^LiPb*(bOgTEU|?{92@ei0}ce4XW)VV zKwhVUoj7tY`*N{EL|iK3S%(XY337j73dy{0hP;%=#R8U*+XpEl`*`4KhG8Mq0T->B zj)a+<4*OM9Dzd%J-=R@^pV`bYY z(=+14r5~RC#WJ0YYmkD9U4~1B6g?K^n?eV;%}C*WsDFx00`ya49?*r3TY0n(JY`&X&gqT&lK#F8-r^a6nPERSeI zSu29~UeQ5t+m=jgaI7oXgg9{@ljoSi^{@293TKOFTcD1swgxu-%6tirCBWS?FRgqk zdL1B9(MzE6t8)n*UB(<-kfyd7S1(KBN2?l&eu{hB6pY0!Zz}zL03&easUr6gr}6^K zP??W_u<}^JoN>v%YwW&MeF|3R2j&e9d}*AK*QxkQu~H=amar(~RQ92ej8e;k_tkSQ zu`yH}qV}XAK(<0daB0ah0NTCcGs4}t@}3IcYK!D6^$mGv@QBBiXqK~quePIJBH< z9hf2|9dsX=k7$Wmw%;JP6x$g*t;hw?mAuY`4Z`B?L(e$^M992=eVYpJgY^|Y!d=yh zo&yU)vEv~HWjw_eWpOE_XIrp+NTx~L)UC)FK#uJ9#%^bE9^JD%=pZuBz{{n`H{4V% z(-1aJD{CEy6Swbq*5RUGby!0wi54a*gZjR?qA{H$0BRA?7SC;I@vfU5r)E1$BwL^^S6wnzJDD&={@ z9zI2XhGbOe9!o6B7{D4-uoGWHP-qg`sX|wFDEP`)S(NoqaxJNSgKJpkEvzsrbB0@&2yNmpbw%Crjw7z(OqI-D19D7xe-2azMfbL2V~bKR)JbLhupdsD zbJ|=Xj{#h6N_p@LsBy}^W;g{@AGh800e-{QUuEpEHm1}8RYgvR5mjsJ+>Gs zHmrjdETsNo=oNY7fEPs`KTw9EPvRQ{vd&L*CG#8fY;_F?P%P6a+_4VDW_REKh)f$$ z31xbQv8t|7IiQBgG8y~VWL+69UvZa>2R$QB-aCVI;;RKxI%N+Kj?!QiQXXd*NXnRc z>UFWvA^6U4v{#)v-iDUp{lngkSQQj!Uy9Hgu91|N79V^au R&`AwkqEWG8!ytdJ{{acGde;B| literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/LeCreusot.pdf b/trunk/paradiseo-eo/doc/LeCreusot.pdf new file mode 100644 index 0000000000000000000000000000000000000000..7c0acb95ca3d278ac9e0b2b3c6d1f7c1b2737f0f GIT binary patch literal 134256 zcmagFcT^Kw_dlG_r3)e;B`7K&N=G^YLAs!zBGRRaNJly(fC^Fs1qGx83n0Bpk&@7R z5u`{9JxB|o2GV}xeeQkA`~LA=Gs`UFWSlc+?|t^CoJ+U0b*@QE$S__Pk`nTK^n_7W zRY=lINK)7HuBVWswveSf@V%*!kfe^QpOCeXx;mqihvT2?r2qbbkg6)9q>+<{i{E1* zX@x%*GXmE>^>gw8e)H7c&q>?K!PC)+5%{IApO2HhJ7eI~*nJDnQ4RL+AtsnTy8M#r zFTxtrm0|7uc~S7G^MW&u)88-oZz#T-kKPI4wN=}EK4Qu)`c`%>D=QtFf$NvKf$L(R zHE=p`bX0~U`KG+^e`!t-&CqEd*aN$nj4`$Suu9_oHNORKY?@j65XluOH9YwKVG8_$ zonE;1LvL98`U=~`6R>&qtzjXB=h9vVZ+h&VykrPxR2iWrHPOQH?GdA&W=!YfU2Amp zn?()YwTv%cVP=Z&Q8pe|RJv4BUFBSDN*WDUX=u3&Sz0qnGogb);&ggu__T+M!& zNtbWUZyI$6`G%Sh?LEo*TEClJXZ*$aGhX%-l3)B=znXQ~`6DCEi@da@il=`rbbT40 zejMm?uGkOiJI-@9K5AZ6l>RYMy+y3tpt{{u)amP6KLd|u?9b=tH0!A2`qfb-e$LQYu7dsMeP(_5_;C@|xMp*4CfO!e3RDQYY9Y zMGzDpy!x%r;>zbi#vaeWeuo{8N4DKLv|Gd5-cazkz2)MIIJzT7{6NvV>#o$CA?Tu> zkV<;u82J7a*=xAHO(SmS3e{QN;OBcePqq%k3m5&m)sz}@Z4Hcg{i_%nUOCjb(^NkR zD5;jsNp;)zDRI76Vs}s{I(Yr17Gi)%d$rO@{UF*ReEIxAN4bJ-CiSHk{DopkFFduz> z^8q<)>}rUtLEcUO;X%4gwezpl&OAnkv>W&r%_Vd$mraa~g{eL|8}DZx;TqXglxZ;$ z?6!a2#5h!7m>?(CaB{P|{2M0j%Z|Rv=xSUmrYcZS$H0(t=WCHlT*gfQIfo@x<0T6# zf#HZ4o8~E4{jZvw-^U~QX2oST7qDLTkLBd`jtECd5YulJ9YF5=okag+;h&8Ala7iq z3jbv0pNs{*`YSQ-26;INN#3@1ablFz^7Qa?^6>K&`YUyTG&Obd^?c^z-~@d0SC%tM z-g0tuwZGvRC}b%G+(b@ZRzhA*Mo3mpNhleL{KT9EL z#XnyN$w>d}L*`!}vj6&!``5=`wLwTm>94<81NA`YpE3No;C~fpjkx`Jiu5?{UNlHdSK}i94ygwKHHDYOCDE59nuE0S4 zJd%{qUw;Bu{Ab9re?9BJOPB0l&-{OvF7agFbRQ>fo{Fy2_*?(qA_RkyozecX_{@3i8yE^`871|c zTwNaf2}w&y$pG)f)z9~~laH3CyO*cOpV?9TGu2N$eayV<9e~N#cJg<1a5B}s@t?8& zH6#D`ST~zses>SDD3q?)T|*~#2D+BB(DOvS_j@;WDh%NqS~-4?jC-oirO%NHG*?xv7#kuRx}$qEzwSZFa$L zBRJ=+*;JmA%#I}0{TJj<306W>SqR=?AAeBvxo+M$1DqXsO9SX;d~Xpb>h)`d?v^M4 zPvoytHeoApe$}0+GBs*G!FJD~`C^nV^4PMuqp>gjl@&O-MNTnUSO5uDq;f3u6bQW4 zNyR$lfD-T4BsdQ-hjVZ@GK|GQPEEGfc^`uca z7OURsIwlTqEpDSN7bWj!kLbADcjfFY{}w^0G2AaEFMPTb08j7uSj6P{UA30MF+P)7 z2g3#8Z#NX;VU%np&E;K_F2^2FY7WNBzW;7-#K7StL>Fd($%vTJWGwYeijgy>XZs#K zn%Xwuo6EQDsNZIXJulp`^F#4jFd+*l_F@ncpCz^WidrcV3$CLQd-{u(Z0{oSb&7ER z3rWg#W^}F^J$&fg)r^L<_XM_byM&&*LjHR`eaLZ80i>El_T9l0k8XBNgM=0DY@u#% z*74i-1G??`Mid0tZFJ;2`?hIr2}^Qt38?)CG&GcOyUBh0dv5-FY?)4XE+@ zk@7-jwI~&HZ{(zBI8!M~$Ee0$PDq@foRqBg&K}H{nVbscz6!kGaRGWoUd6gBk_0Zg zR1mA@L*^aU};6BykVN2>j_f4au@&S{j|2_4ymK8+;8pMHieq5~+ z8uClgK~=lM_OI}~d1p{T`+FPH*{jx-%Xo9Gb%&wd)&t9ta&DkXJ|Z7o>C4YcLnvks!!=JX>4o5YoB9YTzJ;k zvigh#di*;XHNKqEn(-)md@H|^dq~aTTWf=-KpSFvuU$>qCNZSF78TNdao}m$pn{{V z$Y{2?9Gk2{a#^X{gNld}+#n31a`1+FUp8MJcsXOywUN6MqI&OClLR@% z_Q7@LGe#bd`M86wdd|uURXuU=A0wrAe4GFD=?PwajXO@HaFS4@plp&&*U0pe z!E}{vQWKOZ)Wh6)gjQ#X$3jD-WDjL{CQr_(W)*IKXl5yfO%S*}2x{}Ev!9aVkv}C5 zOG8>qk9fgS;OCQNbWej%$4^&yE=*HS)jT{PKYiu({x=H-b`DN%EB(8M>5G$b9E8Zo z*4PXW8kL6*vp7T|RCSgVL_rx@et4*PQ{TeI7^D%A|GME}H>vkA>uwi@Q`EQRxhwwG zvXJ|^lmW&YnU>?8U;@G|pOT%C(UFgbuC?QmL9!Mcj1H@)ZuRaS+PZIccIUn_yq`N; z`taUS7zo{^a1#x!#&}82QMoXnDM8b+jo}SrE;#`m2)B*6+Ggez`ZhiUIMq`XBn2n$ z=?(VgTYWgR<(yTi@mA=5c(``+-4SnW;UyW36%!gTf6k5!9j+a2s?Sv}%hZpzrlv1KLmRgu{VSB%|k@6ZgvREcwFZ(fnV$tHh^4EV- zwf9((d`7ucENZ8bU3>TEE4FUjXKT3gi5QAY6*i@-TDDu&-7^?~`gqthY`Io0y@+Bt zL*z})i#;$)UNKQtr&ofAz0D{qqfUkVdv?9)zVr2EekK~( z`C;nh<=vC@Znc)k^zG`ZvZWHRkz$%HsI|lC0-5cnE--00FI00@Lz*ngDzb{wyGgk8 ziGnxz^z9kb48$uqtYWe3U&r4OaD{w@3@cbfbD?Wldx!SP#or`>(zjp$7PiAf2v}_U7X>0RXI+&b4~eRx#9;+ z9=B4oCrY@lm$@ZH9ir5`e6>rpyqtz7hr7YAuFJ72MW&;M?HfQfHut6IQ;f63QU*j* zg?SpNF>-rv_pYRy%auL7&yEC3+`FfaNKLp}+>+03e9G>n3_gC+d~Ze)dS)m+YW;Yj z*HgmV)BgVLZS!r~MTkTJs(-78uW&v(w@uL)4K9cWl$K%R9;mxjh5PON1_v zp9&4@ij!v^gU`;hR7$=9OPm-E!MOf9{?+Z=Jf=F&LcDc>bZ-f@uOBhlnJ|4_4O~-O z&3-tBJ{`hXPT$P0FF?;e5bsg$guuqit8KGBtc?}YBF-*Hyu5f6oi;kW(0BoV?=?eI z2fs)(RclpQDqds6&L(ENpUXE!_M=LO%-Q9$rVpzang#firc)ba6TiwkQ+{_UXJ$Ah zY2GJFCu@5}DRgIaJhvxZ;*wwS*o|r!x3%u7hV=|T_9#wmKux~3?w+wb8B(p_yXZW& zuh@M1K8s!HU(!XLUwz(gC+Gb5vfD+Fu2TNp34Qvj zK44G7)@m9SDf8m`OeZ+`Fp3W{Z19&h-Nl!7wh-i29=JVO301CPJWB4#ID}UuG|0Nu zUXthXlQ75wzj&PvrX-LqPWe(u-C*n&f%}64ng4uL@9>oRoPl}uHEYpWLiBZJ?g3VQfAGm zsD36~Lg4Mj6szH|x6k^(>I|I8fwXxo!z`CO89*paR&8SXy5u5yt~r&GwSO}K+Kw>I zOzAN}n_MCvBGi`NkgA?Tl>L@0d6sH<teKt@3 zHmY|=ELKFGX|}~>Fw2lnE!9KSk9~%$P@E_-Q>YSlXVd&G2!zJ)N1FKW+M6DtRSr&n z#3O#xh1BYzG0i9cRaA9}zu0Zsk#?=s5B%C>GajO9ZkY@}aKD!*ug3Z!<>r%zvX0kl zyoJ>!GUtoo)8Yg>^J#xq7m=~;M+L(+rM7!pb?1@}yy4)E8ozZTe~j#|rRn+Co^uItN7hE&(w}Czm^t<@A7$kh=3XZwgv3}X>pa7kj57qgjyW32 zGcM{e(l~c?aoLoE*ff34&lD(AE5PUF)aD!dSvo(115=;sz!TpqMhV>Uo<8$nmhNzC z=2GgrUow0VwjOR9XTt*^u)yywI4A&k?h*eSe}ki&9k#$h*{t1*l5AM?RB3iVd$=GS zkB%}O8rA2hliWch5@?i*DKktIPTk%71E#wmZTA3v8YIRzUj(|ZZZ{eS5@CKCmT)04 zB4wv47D>O^4KJd&V>O6D7H5TsZG*<;dyY50o4w!5uktyr!aRg$OTH_$hX1?LW||j} zWiQ|2!YSCCiu+<%ihlAqSoOzq^cyqh!8ZG&nk~>wT6X4UXmr*Bm`q%%SOQV6UA%eE z5q2+2e<^?D#(O2s<`=1pT+60DVJdsjG+TC_chnb{-0I{%Hl|{g1Iww?Zon<7oF-be zLRkCS9pQWFdbWyA%APy3wXYX0eV3B#tC-1AQ(&Hy0uQTO;+-k> z>)jObRD$@GIS5>`|V<)#AJQNaf*&jqTz)rkBgvxnU-|ut)rC3|4}(h}juBpb;A? zIWh8}(C0s$J={Q&3YRG%HOEz-X?{N^aauI~C#=~tR#XQ_jF*iJukNe#N(SrUqMHWO zwKTT9DFgc<<*2rx}^=!Ze3vJ?ZU{oQqpf-lk>jLks<^V zKE-@_Gm)?9v5fPhcC-afQar6~BS4jcRZNJ(!aJXwkh%IZub&6KWaH&(@|Bkq&zELE zeLI*bi_gO^b>iNZjATg)fH)qYikE3RX+RT;^}Wc#Z336VY=Abo$#;0h+}cjTD<=;ee=X+CiFII?2_Rfcr6#)fmCNJ3LBfNMMh zvh=Pi#dcT+_MdQ{)KD#Gs=*r;BHy&&HJLa$E zdr5mS1cJCplC%7&#JA&pq-OJxgcJE0n7LZx&st=>iqIr+U1*%8Fa;m2rv ze0*OT+qqCTzA>Y!V=@jQ?udihgzC7{ueT!<;-YRH6tqLtoq1{TJthdpD5|^@EnA_k&Qr<;IOw#NAa1S$O#VO7Y)r1FG1OGjiD`?t#Y`?B~-Gf zoo|pI>{s((32c3CT~%2+?9OKC-I1`x$!L++g4^|C2&iI`>B4A1(|95YOufCnQ8$!nE* zgQ=CMpW;aV?%q7Nr3B(t(d!Z&D^HD{PSFH(KwM<9;TAvQPNfzObPaqM$n}kZdT3wZ zuxjrblj8kN*2Q&M&-0&C-dHhdoIBOO)Z63qL(Q&_DpSkNS(vJ{bxA9VRu=b4NL8|( z9UMiS`2eWfo@YfgC~cRx;1=LU-LJ|BuI3N8RF+oH;RVOr?15_77m2fDl+BI69lb7T ztJom!H!tKXb0d#^vY1(}dtS^`g5#&f$(c{kC4Ui5|E8V{Am?w0T;9k#>H7H2jJT2d z6CQMP&+gZO{As)KldR3)$As6DW-T+XK#L~GPB`Hg7=L-Lj~RBFGEyLGE>W1fxx^?i z9l*!Wi3lE3Y^y86P0#j7WM>X_xLvtkDp^2QOkPYZdR1ab13I+6FBM%tZacBQYThPd z-~#PdFpGw^uSEFXM^e3%B$po(eg|$i_{KA2?2%3Hs-*dE8O{o&=H>uUP z^%VP0mHfl*Q6$e$w(oDBDBbOWN_f)zJ@cDg@mCqYCq}fd~Lf_AXJ4- zUAT}pbKeep>-YbwyUXuH+;HJo6(Bt?Z(}LQ%sWw;Tfs)0h;~3&S+ky(Q{O+Lo;-mh z3b=$R8++v{1}xTPR>X^>sjclXeckbL+@^~WZe*Zl@K*p8(4t)KgnSMdHyDG9`Wu>w zSAS6URAy70h{gxBXJ9WKieD9F9{eyMtIJk*w{-mYZ37w&P$9QB>lJ9g*wf2aGBg1q z9lMnsg3}x_4`s-enm?adX$ON0plWk3GS+RaE|chUwi<;77d*n!&aZZAlYq)jcNc%@ zqtqS+V?&T1Wb}KA4%?qUbzIk;8u&~d5qbdw4Y=@nuSdIZ;{)G@7};(*PXzQ?ncvV% zoB!$4$7gWpgT6!RGSXCTtvRvky_x~e#3!_ZT;&B@I>0>wx7c2`TckFA649dEvd!LI z0w!vLOm1nK(g@Y7>AP<+*V%4A5U@K(Wmph8W2dJ%e;x9vO|kVbe?<3rAePg~Kv^ zG_L=Hnf}Hsw(aL&R0?12&{2=Z`wcOU+0w|ocW{x&xSz_oRi8}pxiT5tM- zlj$GSOHQAiAGL2La{(#G*=3^h9&PPCn((xBC?8zVRr2FSB4o>;7(eu3Aft7wxR9V8 zw{l5QW5x49#kn2tA1!K&L;2M}dyxXUo078Ni{Toet_vXMVWTlG(ttI|r0EI&=oPQi z7PwTyo9pkXw=b9b-H{hmmzqfDe#A|ssuh}lfxLZ#a#B)*-*cVUGr(cv?*1<ttq?Y^yGs%)exZ)m_Ya?(sbz zJp2pnMig5e)(IB9`@NwdBahkXr7J)s}T$JNLqxhF5XGwb70sHKIP$6rZ$tq zpje#V!J7G&ufZ#?J%RER2Myk#@dVcbl;r{~(~ei2^$h?Rc2*yBx1Lj17>t!Crzt_t z@I$A@wupA>hx>Rt0Qt1ncD|CI`KHs34(%`&pig{iiDtI(m~NAx*%;TpMSX!d5tp+LS!mC$eD?s~BjSfUHu=d5Y;ud-*h^izCFN zC>mU%bR_1Q*MI>QXnI5;s+Uu}roh#qSYF+kv|<+XpbnJ@)-?gbnEC$!F+) zpNA&8U3@9JquhfQxabNXK+nHf$Kr*wz*4u_v$-P!bv&AQFH#fxnEU9?WNpk}7|3s-5R7NM@HzRZJli;^VDtQyr|aEEO>Br@{>E}(|X zt`KTY#Ca>a|IsYexj9$>?knv`c`?y)>4}P<-T|>Z1}f+}IDATID;8$K@SOW<%+G5s z2vm3Lhg`$=_2T5QXK&rki<6BGFzr$hk5p96^Z4}n3Ox}R9eWzavkdQxieznWXJAJ4 z7p?}!wzs0e)#zeL0V_IL48+)`WV~E|yDK&Piq5LSV zdYo0@;lV({f!~&yhseWg?tVsT9UO6;iin4TA;#C z;Q5`9QP8H6(4uGl3HP#Nq&-Q(<9pE@V%@VHsx*fFiSIHa1&Jx+V+7(hYi5 z7KpTj%T?qXTw7VvVbq8ONCNpg`{i?Nmm6_l^3(yq{JV_OnG>__QV_)b9(8NnQ1O(a z7tR4hmHlAFM87u_K85KbjlM4{iw9e=e3%K^l}q{*$WO#g=L?%aK)w@1@u7B0yYaTd za5^JuH5bbW?IFsFG=Do5C>O#m$PQF~99{Q1G6q?ng@&b6xk@yW<1kx1iVsn;!UFT z^p|rmmkx+28_tC}LY&-{=nu9^=tanTc?pSU$S#{Ue}@_HFoKHK zo7r#}#|KN;>qi?=r9dS8S2T?T==ma1W5?vx@R2!$+QRHz%3DU!pnLkXk9|%$zz7cw11Yx*)rd6(O^+ZwO-UB-us?`Q+)%@}?dV>LiwnGe$~`Gy zT{R$QW7l4ndYPg6q{|aQhbDBC#R@*5Ub>K2!LNZjZAVFGpbfo2!YZ9Z36Mag{cNOE z?$?i6U9K)*Zz`DM%>Q@}fb%a>p3`Tb2k$D}Ha?-Yd4$x!jkBOZ9cn#cl!72?f;T9ubWay4v^yU=zE^2$DCgu zIoh+>O)16op6~DrVyM%f54ds^mE37Y1RBY2w~pk>10a0cZ@j#DhcZL7k`C}j^QoNy z?DsBLSH-|DGdVbofe19F7%_7DW-8_<-r>IDt?Pry%b}qc+=w6d(s-b$*0gEsNWUJL zxvVwWFE&rud7k9xI;=9EPAfT);JtxMZDKm*(tVxb3@mR=*6YXd2>6N0&+yJK1$I`0 z4`!&`_; zBRQ`m$?x?Qg7bay)5jJAB%9EcdjV!hbxxS&q1ygM@fQ))nedIUEn;HxPEqiL}~C0j?K|& zFMP`b#Bl-j?jte&`F!uLoMV%qxx?eg19E6~%1JGHlcr+4B-Dx>7J5NTB8>vjO+i%C zr>HV};u%!Ls3uxc(ymrqJY!S;bzG9{9~eDvBuqB;g_h#0s%&k4{x1@a{bRwPaNw}K zi3igsL+4<5C)3R)4GQ%n++B*G<9p*Ly3~OBd0zwm4dewIqds?P4+9daQ}z$X9ZsW0W? zwXSf=lkXQo`vm|{z=BJ?3tJO;ahlce^YgtM=D!aV(@B&dD%o}1mC#HPdYzScNH}eT zgDFPER#^k%l#a9vpakbPNy07PA;T1mKhMcjS(jcfMt9@@^nB)J?ArmnHZdXF6MgL# zNR$k)KN(iRB5k&h7!tJ=x*Z>!)$DM_z@(0*%6M@ug)q0L6yGgERv!59Wf(i9I3h|P zkng-?)ic`;$@>8Y-;Lhtu;uJkYC*Qm886^%T8CS@Alc5=&?D0n7N#9Jy!*?zz6)c| z1aT%;*6Mt}P50Q_Jf1yQ8$sQ00w_$Yo*@9-wJz)Baj=K}HBTZJb7psTqBg>_9c6Z8up0r72QI zV;p|3Z+V2j3VFpAzY8HzulWZH>9x0o_qid1`1VT+k8TcWaKZkT5cQ)|K1~mh>|mWF zY++*Q%wjB(x;9!|JdGOWxYBI#$e*sH#IhfS3x1%)_96FpJT2wW%t7o+^~7rDiI;u{ z&`p|EZKZtdJnxTQq{A?s2gH1vQCFj6*)4kon;6pPNka2;UxdqO%1U zz2>?dU2Dh^xxBC>r^Il2@YwXersjDmZw}quTYRWb^`U1>4eZcy)l;7*_DnMQGv%6# z?O0VV=@f2&)cb0}C!3lQgqT<^UWkY*wz?bV3JP^1Zd28BN?)oGvs2NO0>F15gX+i2 zceiL5?;GkxyYqiZr)~$@cxI_0fXffZVLQ%Iw*3|%0YPPikbU&Y=;#>Qb_t0+f_&Rn z1lbS)k%%Mn1-mr69A+Gg90GkErIS6g$P zI61{221dq*CS4@^Q53E2=W$iGX00>^LeaRB?hc7(LJl1Qtgp zLz5e;7k6la)l_zIf*qPBURKEJfe*FgdBH-~0OyhB@RR72XAEhHoO$TS>N6gBlGw&fmC(EMb(??D{M?j0I}ZFH)VtL zxpNIkJMP4gnbt4^!LCa_Cd<6PvcI7C_PL$c2HcE#l*J<{o95vxvng14WxxPRb(1ySc z=oAPW2Eyc;T!T?KVC>m!Ln9Bn{4o(#286_@qe%OE&?vm&WCS0(SDU(u(Sn#7{>w?@ z;~oKc?-2c?&Y*XwAen`aO1Z4Q41;eTg9aM`w_winvDp7OM1N`FhOU-A%OKoSHyBN2 zfR|7X4X<}*wPo-s^PFo`5Qd%K6a*}Z2SZs~;4at7&wGqAGJ8DWa(ciT2V8q~=VwQp zw_yV8{z@3$YTi|K%@exTynJ=L4;9~L;&LtIOuWVL_l??&~<2y<%U?KGL81s9xY z8c!ei!D%>Cdlg#sVe%9dXDdK^!+J zplO=7yQfa?FoAMIicX8ENb*YIHg_7^Jh|UGy3Iz(M4q9Fr z3iGF&YWM+3zNDVj=T`WSg)7qmXYylaC_kyX`(?v;9ewJ}<$HBd6OVsNU#wOW1zDLC2FhC{1UA;2bKV8X>WMnA9;mJss0Si z=GN*SE;=7gne5|L2cz_R-=-Ls{O=@;zBJ9^^g%Y zUjEEG^X_^_hIamPB;+*CMLZmkfo^IOy>HwgE=&yaJ9eO7v)NHyz98*(J&B8Q>0`MO zb3nV!3&2?9Tc-2U<#m1FnTCx$Yv*^!oFv-Qm)jSf(-s-UbzVJhahh?&w%U}PYpVHg$>0*MMmSq$!}$$JDtJX zaRCc61Nz5A^%Z3KzCK|{JFn^8vB|rd2tr0Rah_4iS#xO_*2uj{oGlnkE~wr4+%u(H z_XcqW55wrHz{PgTPIz}53Hg)0!@Plo1aGM-e?Cvu-TjEUDY2o?V{(2Bgq+jKX6ubK z;Kh&d>eHaS6E=S3kNeYcGx_%N5d4?LvVwnDwm)Vt3O9g~5}>K85haI*vC!9hmz2&| z^m@KRX1Y4;BiCK1J&RqQ+wUi!sR`kfJE@*wGkzl~2XFSr_aw8HXc{+)n8v9ra3-;; z7cG%jkNOP#x1jB?{zx5o&;FgF&>97PS+U1uc+1H?QuvCCoX|}g_%-_DI@OBP*8k88 zDSIrFm&{1%Z?Ap&W=Zu30Xu6@8?7S3 zQ$ZrrRzoZs5Fk~?AT~yQonv+MkPbwRdN3-t;u~9p`$k3(EA*}@XBhHqM}6W#(Z-c$-{rmSDn=;gB>7Q8(4#<`!{k`smQL5L)lG?fiKizjc)qho3%+c+`QOAPpfz?6jxrug;*` zd1Kvx%_RZ3KTKj_y;7x}K+fiZ{iYtqSrGss5EPqWf^od41NMHoJBp)Ls>dt#C!{lP zP9}z=&`?{&O4Gzp0P#^vq6ah*4Vmw4>;mMi8<;4Ce%d-sRp0W9XI5|OVGQZ#!mBvv zLs@tH`;)^?3)jv){eJwbgd6K>*BYfuOnyQfy}IAWeJzA#-r|=vDS%X&g=735-{>EK z3XrI@<;lZd@4p{0slW9KJ!z%^hi)Snm@X=SjINwbBEs?=KuLEgDK2Gd9Dcz9p*-9f9O!@b|evdVYvFzDS&swD;Z&*->SnK6hN_#HcD~fX2T3gqShgN))Kb54_w7pd&*zFxBr)!^=Hr@I-ou7P}p)lBD<5=&3;J zC%pNLpKv=&+xhwffqMF`n;2fY76)|w25k)!VBMElrh1b)G+XP-eWXFd zdk!@c?qRE^M$e{LKo)Z&HmS&->?6=uns^95(Vb)x12wr^FhV_}cVp$VmwPPosa7K7NppU^t$88W6aJ?sP9hz!$=Zx9 z2Ca1=P%5DH+F`?ld^2$wJ#3zblG zHf1jl%2BO0QLy|s)c@_KtUQ;rMI?%o#XTAj)FzzBGlBPsOY(m_c}`)R!U`F_+Hbr$mZ?;t;x<= zNF-n%Zm0>sNQ=Bg_Zhu+62P=%x#WSNtaia(uyxh`@1L$-93ahX5jVLgfmo_os4q1D zINO??JXJAqdWkBCj12jW^=|QmHuUT~nf#z6ya+7;wk>cdqIcCuVD_k_*S7vKK+L>00 zYQ7Xdy@Pm9Y4Sp9jn?X&j(Hrs?bHkHB+OGtf$+M=Z3F2SWd(cjF?PrUB1; z35%DUbrT@etscifF`nvT{1RPXK9L39ZCDAe5>7jWyY_|C14Oxu3Ne+dzh!TsU)n^6 zPU!ckQNRp~-yV5E6^I1p=9a+$wr@4uzYqrWS5zmo5b0m!8l>zPS^`||2EK}hC}Zv< znGzE`2<=cOf3?lAr<2^050CoahXO02C>dCxYKxfP_A=6RUaFHnFH2kk=*J**xh1Sy zWO!rIMB2p_N)K$HI{9#%Z%9ClY8An3WF3|r=L=pAm;U!sShk4p>3}`9e@2;S1hoJS z;IA>5#eRU54eRAd(EEd>Cg-7MPX$?zq&li=(*|s)^j{sP?aJ^WcT*OzWh4N*X0pI z{Y{{0N4@zB!*5n?#WDOh<$XIm&&$wBA%5uRPe4NAEFfPX6kKV)MI)5$_&T{@ovXz( z=Hm1(=?T(GjhY6>!TEB$VsFEp@GjpXO!WCGk3v|Bk?S^hoQK_sT8#Tl-NiF>fn3}; zPYnH0ml7&@9SY!5_y7s8EL(f-PJf&&LUcN5U9LdcGi<2w}s4roF_%ld7!lJ==K}y<&5i?)lQ{&$SQq_+|UL@)+ zl@RewU#7!XGGlNpS2=-QIh`U@wA&2qm3ud_c@xv|)a7in zPh~!pfpQGyI5lr$8SP*K#Wv&+z!Lx|o;HZ0*`T`l)nE6NMoylUN8uef_0@dl}v4GZ88)$bq zmBjm@R#u%#RSHyHfsf;>=j+wjZHLjz+IIaM6zhXswJF=Lcfv(JwMG$p`||-y>*P$L z8nwj|ntOos$G-S)hjeb)@3p|F9?aWyHuGB(W47&RV{UF7rdI|Y^8MOT)=Hr3no9sS zzoPYn{gD+ZA4_coK`x1t(S^VgQ3SzG)%-pMQh6VSYrVupJj0$HMgj;?p_;?<-HKfY zhEMQU+95}2GGmCv#ErCAI7%)F@Lk42jX7~HEr3w~k=%C|R=T=pS|^-$;&2=2s+hl| zaTg8{}cAx6npq;O!1%-vZK3dOe((R3xAGfndp6nWObO~Z2AewVvMuZwZ12%8|?NI*9_vI7^wURtf#&J{rY+Z|CJM3*PqnBTw6*O{m;79%FG9b7Q??fieX zQRH-@jSozEcTC=`L#*pNW-qJHjhFTO(iH4v%h@uTiZ+09%mR73CVMxvnawrV4f|x; z=8kD6>oXtkz{iV><+H@dY3^bWo*@>>Zb`wnje0qHxUikhvmHH|Weo00Z2_WoDcV-E z45O6Ee6&fO_R94eMzrP{8LyaqinFV$Lhn3a_DEl6(|uhMrnhZ41&Y1Z!TbvbmM zUm78qn3BA)fT7gx^wAhcHJz@uY^@4%Leu?bL^mR7; z(e?+JKvm9Z)HVRl=`K@wk*u2-JkMl*~NxWJikG{Km5K&yzu|-3KR;kvAqc z08hb@iu;;2QQ8ip)|h+Y!Ig3SU(s;$aNkoZbAKrW|Bt=*fQoWi)`o|SfPkXpFa|_K z8FG*?1Vupv6%-VaoFoi6NSF~2P$U@1U_eljARve!Lk0x_MRLxWAu}-P?*RfG|ZsgT3Rcwj2RDLB(FR0!tm?rj49S_^AaskipOpy#jWN-_|4-ImSY-Q|NeOzMpbLc%oYD0u+6S z#yVim_d7wOzk4))UN2nZ-7{+Qq6}<>V=mHuoG$69hMn(1?8N)7s*-%vxLaT=m<1cz zwdv#Q#B`BwF*g{Rx_zhZCg3yM&NFi=aX3hr=y*l^u0DnQ%uS-c6oITXwr|V4P093f zp5`V`pZ_!`VGS&tQs!FX50);|K%UcqDCs!Geo{6qN|l3&#v*ilaKGZyw35hPi0ONP zRFXhGu_-e+MpGf}{JL{y3Jwm@BKV!{RCNx$JS=R{2*-1C*c3x*=z0oBjXD&NA(q2L zu^VG}^>G*GASR~E^EaIjsO6=r=!ibf%0%JZrv7B5U6$(V4am`FS1yUF;AfS0=zE{{jT%nZ3n*Y5kf8>VF1tvj6H_c) zO-HZpxX|&@|3swFG?FxMCqVC#>MVs6x_&&$v)eCmek6~s923d6z){zIW?Z-$Ij)&U zNAV@eo{)SfIDlX?tXf}4vtaEx2Dq`MjvclS9|EZfjc>aWotuOHs z`~AI0okPwbF&P>_RU#Pu=-4FPT_I<<>Y?4Sj@ZQI9X&9o0tMoM6{3XP_fpxCI?EFf z?YqY)F4si~(K=IB!P`FU1;JY_Ulw+OmFT@RD$dkgFPoe0J=cCsp_NrsB#f$}u>KCb zaLGcQ%6DrX{KOZf&O;zZVMd>ndMluIBd!J}mFY;edhgUT9!tm?-MnpwQp`%_)AeS{ zfZ(Ik7UUy?-9vEaJ)DYS7TD$_Y`9&26!Pp&S9c_A$N1!R{HUdl$2dku6>n7!F~YY9qhq{Z zBS$8wj6ZhuB6JGBL?5A3un>J9b3};6`9Aau)Ep?;I(Hl);uEd?A1S=xv zxeTx5nMTpboSObQQCnHw)2}xQS9#s(ZY6Nab}UYjW_!m1_7jgTjeje7IIplDUR#)L zqAMoH%0hYY5?)e6rxA99#_#)wq?GODKXDxF$HMqmxb`0{MdWS_2lnR%oH?VHQO=c< zk~|LeLRO-xi5UmhR2=Lk_Tyx7ybmk-3&gYZ(*X+mYf0uEnr_|P#axoTbyw0D|fMUXbI40DrDZ?$4iaCA>+Y9O<) zO}!1({=U`7iNsTR2s{VsjQ^D4I)4?inZ7uxpBHRAr?EqepLU@xOs+-^6Wna5lH+;^ zO&%niEQS^<7gu!ReB-wb-0Ah7IJP=UYAw$mf7T72aR&WnSjd?@aAzb)lD2GmrCE!b z9`ljE3E~(gu|ag!DoZEVU(KU(SvqQ2%ASazi-I!->p9|*Z-$?_PGL_fj}1Tdv8Djz8Xw78=3zUAc9tlHljb=IU2f*$!I zKYxKmPSVc7_TZxGSC3CoQXk5b5B68QWkT)Hs(MZ>!S=pndgXCNdRpp!7ac_%^B_dZ zS;pSINE>rjlKQM~Q~BlvAir?rGMGgU<3h#+v-i2f368ZrJv*t43W>_sI5vI@Tkjd5xgmg= zJoS7{5HF;KovnlD6hyIIO^F)SlU+O0$^L}nImNF$Dl#Zf5gO7>D7F2pCi;Y@wy?V2 z6aUaq1b8hmt{d2Og*v76nexv_EWh_m|FzY%1vbo>-00_bM#H3Hz0T@;shx+6(4kdV z;KNkR+K8NLG)GcQ5}q)mJDR?dK0R4`v#!*Uu<8oW8iS9y9+)t{qhtLRzxZK5+6saw-*qW%=^`t!nEMF4%w{k!R#I$sl2^E<;mbj; z-1qho#wEH7UUWJFRJbP*!O90;CEp@BEd;o5J>O|X<7POZ8#NYJ5@>u1D$WL9b-AtR zU1Lr_ne05IKAN6aY|MOTEZ$Cz0i%P^C{n6%*xC5reX5~KbzB#f9hAvG-`eqo0M5k# z2%Q@WP{SLn4B$A=m7UElDVx2zU{kE9wGkzwd^}H%x&ykw>Y{IJh!ecKd*%Gca zeUNJl5gXf(_Cq#Q&+RAP>7GOTmop?^UH>AOxG(Fr2n&BKg&3!Md9(cbDD=X|3thWr zY$ME^P;Rt|=_yLO`7Q&=o!nI4-lJB(w31GHBz>&Y(X(Dc#stRAREK&E3eP%rQ_Q~^ zaiLgeLxbpliqwSIo#P>}{apjJho@p<4^!(gkAeIb9TnP;p4*yK_{Rr?bq7Rgle36A zLlodfil%F<{`$k4C-gs4QOJ=g;BpW6(fO5w3oJc0Pe9rrNt&gIhRB;!pTff+c6n_k z)*#=T>R?Q9hvZ~Z)^TvCI|REm#TDlR98P3^3DZP<`8n+5_?qAb#8Bt#LjM{rN@9^? zk&W#mojjKjepnFFu!Iq~y3dEm3S#5D=@XUvlU2#N{VYkFWzSh zbkjShLk@L-B##R^;%3@RZnV920VAF>H&G%bxHfU;m;M+@-I*~bnr5FKVL0Q5FB_Dd zc;>r`#Pvg(JUb1C5V^Zd z3FW7DpAW1!n>*D1DD6vcI{S6}2nUyAQ(Xhqy#F1fR?^xnN-e!itkA`^pz6Z@gpU3D zijpcWH$E`lqyICQGm#=H=u9BkZDv)guYuHgkJMpKl*1~t5pqO}B>3G&kDlZu4fQ_T znZHo|eO+bMgVSx6KTs1HS^%yL^b-!Z8Ok>;FFd04Sta#`;L!wQ%2bL z+2Ed;vX9P}QjGHjo#s~)lH8H=r`@Tl&^H1&!DT@gR;h~EZh=H|6A-!DT-=5TJ+KOI zZ#+zG9XLLGIjyi)fTc%rf~&x4;0j#x@-TAVG<0hX{Bcpq%>fC~Xc_l!@1qpH$|_GZ zH%~D0yURWq{{#-Gt`3LXshALsN}DdtOVjQweA>m+kMR;m0k&BLhQ?^A!;h$r%Emxm z=4&z?K1|K(C&QA8Vccu=6l6kB#1+J4N)P7O+3_AcU=V&3ZS*oTd_K>4n3JkSM@*Sr zPbSK?vIa!tYwjOzYdhvTe^)HttddCj8bVvvc&AFr)cpfD$W$qf>#pD~dqy?1zO+gs zf*QYAc+<>-4O?#06-<(;tlnVr}&zU2y}mp<(f8bEetsnd~t|4$L@Qxd+_@K z%3Y8zrCipvWOo~PZn}S#O+DNfHS_+Is;yXOJ{%|w>DmDewp%}l7^-5OUXOcM~_?{ZW5FnR%egHPDZBC55T3 zv>Gj;)1N+@%foMaLDf$I9s1zI&eV3KZ;^nFHODDbZ)Y~hSyJd*kDg^T9Kax2VzO!k zgrar^tDx^9SZP^1Xen3*i$#$1$~Y$6hq7N@0{l?Z2kh$V#~JBU6o1ERv=F#FM#<;)NQZ0~CT1T!-e6%!B>Mwc^U`Wk zIAxoR5)7x|(|bv&$t1r6npJc|G3L%?&f|?Nv$^qft9O{)j`7C?E}A&2%DlJM5|`u}${^XCUa?uGDuoAp&P2Uq zIqFyT;)aOS)1StDytF2T*L$`d94(=b9tTFw^-Fsm?Uxu8tBJ=TDQaM%oDE!q5uZeH ze9gUr5JAlD|6G87;#bqJPFmoh&ds)1gNIORhoD-TqcTYY#9R)@cYe?qb}u9s4vxs7 z(c<1$#;UQ7??(bB4VZQ?HBpzl#Et3^X@hM{OpGsZg1tx1>#TUjwS;zQNLHQ281OcE zGs?J{@Ul5sI?LcoX5;cqnstk+Qe3~nt+-WK45HWTMVVH4l=@$dKTq*7FZ5R!iEjA@ zUq~SbS^t8$emAQ~U-~~(y_<`EP6{j@?SXZBeO!L65HQ&aj`>@5noZ9HG!-oMP?EbS zN8y0P$2gPX7mt@|Ag>Z?QEl*vz^A}3-4ziO8vqE?IT5D zi3i3LLIQN)q-z|=Hf*KJWUrVDK8;TyC^$6%1wmOY$+{R52M@OB7OkZmBP!btK?Jn) zXg!ai&Q93|rEUmC5rz=g@%}^o;bm_)`U7Aie9QINnnwqOf`Iddn7MJG70WX($}U&7 zX7#-Cz$wyv=R4z{u7=Hv2?}q63^BT>M0Jjk*mQQ}J^!!Bw*g~R-no=BP?XTlGAABR zbX}Or!&@YY)5{d|Qq-n&YEjtk4E(2qRVI&d>55hMs~@o8m(;&qj%5i?#}4mM$Yk_2 zT!>MIyr2rz87Q|;+hftQJnY#l(v|g7Ia3T?qi32L_dAtEbieoFSxZ0QN?GF+fwWbA zM2f179G3M;vM7L0coX~MW?3w~;8W=Q$snvGw=*tq@0$hLcaY1SM+a*m+8-C|gWHfT zFY6r!h{*>``#R8%4ID>;2kQ1!MefeAgxp0tuue0ANF^}0L3od<_qCTd0%9GPwFThm z7m@|%`JY<*q3FaP8#2@cpX%6M&OcCor>owg*5$l6QL|?NMb(sFNmCNIkxIV1^^j!6o8P~p>S^DWLrv>d8{Ov1 zm{{vRB`FI-#`;*9LdS&EsCi_Z5O(BC_~3im@#@M8HY%ur>73dT0H;2sFrhp88OwHE zj*kgi-LZS*9y=lJ4BB5T8E2NgDD?3K%LT%|?{5}D_Xyoa3pJTsAXv?~AkjqJ)W%0| zbNYoYWal20$b&kkkFa@TwX2$r_E_G>YxbvZkkD{E$AEYBlmO*nIL}I+KI!f&Vh`iM zVu@DTTIGfSt}v!pr&L$j_v#Su;a{^m^(x4vXlLM4%0EDLwF_Loh-pr)RIwEB!w=dq z>y-5Q7Hoie(qA$b<-THv_-xxtBY-v7t65y5J0qeoUvt zuHq4-O`uUgp!7J4%6bNAm4p)TJI3=S>G6qSj{_+G6O@!rQe|IBJ{F`axiqny(P0ov zrZgN?LoFLc&H`_YSKOY!^YW<6)Y79N7d={g9+@tE2$?;0Onb+K-zQt;fNn84x71TT$)cRxM#q*fYla@7jP?l#f(B6#56K& zChA%OC(h)NEoyl=ui9i4ccxQJ%u1@vjfSg!Wp?c5<|+4rHdPoYOoe&|M>u8dpOYjI zaN-*{tb}5&mfNJ4E{7B6uE0$_;5o9G2jMB>_Jp4qdgRzFB>x?xr^`siE=GzTfkmAp zkns9ortjKv6gu8LFmv9eQ}?4MtPO@)G}w7?k#2~XoIfE@=!*+Zy+W0ZjiNsRQV%RJ zPuFz(zfWfjmK@R({-9IZM8rG$WZ~SN3Y4;d!;@uyUgXBQKLjD$?jpm8y}S6^EKkRV z?>KZOE zcytUK3X^_N5k?KI`|8Wh04&lx93A)4J?%7ZTVHBCS}r2VZ5s7AcSVhc zUmV61!hK)0X9;kaNm)%sV%0l%=B`jB`|bB|#ZT=mW1 zTw0wuM6a~4WCGWZB|)y1zO{XLo2r3}syI>4^bAX-=-2_d zOC`oure3iuNh>7H(!iOR8-Y4O6?3&l8+fhLbGtI^QajiTUnO;racQWY>REK zha%t#%|46y569QcU!c)%0tUUV53aoFp*x3r=(}z#`GQl-whR(z-1Tc8xSd3CqnGp+ z>C4q{c^F7>ZNB0h(?FpR61|_&S!2dq?K3?} zYInZE&O?IyiZeRapDPnpo}@1D^0)vXOz~1_1uo<}1(r;`)oBcJCa(}P{dBghDF2t2 zK+|YA}op8Jfv%@90c*^pp&Dp=zJ+|{2FQgJhYFUl=XgJZl^K0G9(a_g&#!CR0MGK zLx8YB5DaCQ|5{_)TDHL8t)Z0xvqY>Cv5R@zbLf7isDesWL8r5!wH zw9K`1y}iBe$o&ySXEpaxc9n(DMXIrN$yOu?$UYaKHcB^tj2)v!u2EWzk{_5FTK6r{QK6$!sY zXHs8-0d@f*7ZxLDO;Tx5V?`c6MomGh*kLF&MZBN!bR81JajEC%P}4G%>HZx$RFzZr z)%1D?dg`+ZW=s47f;_w6whp%WMyrGNL!TPv!Ce#`VYPy<_;O2O8TeIKq{$m>cf{mN zl5wM<)&QozgeRUUl^T_ECYg_6z;J3~)byD)R21XMwC`15+3F4SaQa@?-jP|A0U z<|!$9u_gEGN0F9ai%25f{i>nf2H!p_38a@rpN7;z3N_lyqOe%eFeRD6YNl#IAW(z1+(BT z)3HyC4!dpJX&?VEW4&ZJ9s~le8H$bP{ZJ)GfODg*X0*qQ@-QWB|G~BFbwP$ zU8_?*H@youAF#SGd_3UUxT4_08@MqHCZc3&-Z|C3c~(LHEr`$^3Q# zsT2)v=a)3P- zpOQqe+n1svQJivsr%r~#a}Z_h4(ZoD0Z9ysogyT7q1VcVog+WK&z9{1H&$%L+CGFm z#&&a0Sl>`UYN^R(@_Jr2;t&R|AaDyD=gu-ahiST*d?atxC&*Ar3>)XYxSb6J{yMd2 zu$zv)tci)a6@cUqoF#roa$z}2#aAuqJB()_y`6JhhaIW7xN-_voa?Ed@yN(#^}Fj* z74Ev*b3;;gKm;Vx(a6U+wGdrCNmDvZjJxCA^av!+;1dwbYJpOu>Ff}gpiEs(j9R|P ztN4^V=|N+AJ-#Z~uRqkrR&-XtK6MVW(DmyKU6waFJd@l8vl*(1+l{)3V}7yq}c532F;%SLF5njr=)bw@j=Xo0W=1h_w8_E6h z#BS<|!HY<9)Cq`O-`WNec2|*7Q5D4)B1-9W7C67BK8bi?GX!xtP1SJ-qP!i!#| z%m~t{S_cGJuJ`r~!@MhdLiT3ZHAidBP0%@84@~({F2pb)osQMc+~Afid<1S37t67E zBq4fF^b@>V={UH@DO-&xRr5&%HH9Gu^eLp}NOO6f1vE@XPVOXy!>%&C-&Z8`9mLuM zZqp8L*(=t!vutM6>(qfKKPy!0r8&MFqg zbC@~dCZ~XJDJk78xbC%ek+s>F)Ls588<;5XR3`4!aN3-csE1-(A=u{>lM^Qw zbPFSTg^r!Z9A7V;$b0E-;Cf7@n~}7GtQUL`TFZV38CETQiYf)j>BD6~FF&Sk_T~Ud)G@`iQT#(fQ|to_Y+U!Us&ixuaYev$JAs-UOAptr zBK0&|ouvAZ*-OE$!OsOBy+n3#&+MchAnxYM@uG{qSr@Qh7wVkCl~>bm#~FK?1!Ul6 z%)%8Itf}WFQaIwT;*F!f=g*Jeoam@BCi~N`MXp(%Th=m0ey;IP@iqRngY;YFMixt! zq*J3}BbE|_-Oig%-f61AVm~@Xl=IrzQqTKKhT%%x+iPFUEC=A+W^dXgI*lb$fIDf% zhx7W5&&T)2D)fF#*(21)RTfFx(M_Ghj`E-Y_UsNN2+2OBX4P|?HK;CAwq@<) zx{HpR#m6u>Zhgr`&~bc?YhKY3_jSe2faHcs+R;3!;7S_nHN`(PqO;`CGKTb+!XlA2$J*DvSO@Oh z>3S$D2b{`Ae;}sDYP=rMV97EDSGU6L#Xw2R| z`|gVaN~iOq@{C%%O3Fi)IJ>E|3VAipTMHRn`5 z-?;hkE98>qX>*i2qqaVSTxpX8!xebt(d1(+_*cxrE&Qp>6Vz>RY%5g7i)iNvm^0`dJx}f%&xkS`$Zhaoo;e zO{F#vzFhTzZJ(e*-UUWAk)d4rU01?rWCNqms%SC3Fg~m%JoH+m_+FdZVg0~Vs7(H+ z{rhgpP-}l!Eb+Rgi)idAa+^zuD_U#x!bXqRTS_3tgz+E-qK7AiZc+-RUfYBvAu&R=_lW7ne&g5_Cyv-TPQ#COrX>i|#GPR#Rfw9Y>}0oCzUpY> z$a}rTIqOGH4Z`rZ;1EcI5MJa=cW1>$ZZ-!;Pafh>dv@Q|$AjT-Q`T^~pF*cNCIvFX z7qpMhA{UrfTJ`2yDE(&%l(Y}il)o{lTrJJkp|rH2tm=!xQ4jTh4hVM7K}wJ3S#aeh zL0XFf?^hBE0wR#(H4YuQ*OVlY*~ORub_|Q5 z?Gg@^m)Pg&qP6)^G5A_zLTd(unYcW0X7C;zj>H1@pM2*v1b=7^c}=&AN&4&CnVk)N zj~5>cw3-n&C76kAw>MPJCJ=K85W0jZgy=M3Z!N}vcW>j+Z8P@$9l@$qG1s(RezWIPflk{d(bk_Z}MYcY8@)zJt}i z-6usjvWFE_80MFAGE#b2t`S<`YPeIrwU9XkMD8Wg+k-^3gDfQ2!Bx7LSPk$ga!WnF zDauT_&v$%y?{a4e zt#mPd#u>*S-MgYpi0$M(d4rBU177TnUai1SeGPnvFqoA(^J+BjIGI}{1cG|oA+WDC zRN4WHcp|_7Geyw%g&;1W1)?bFD`e5f<1ytNPYJsC0a;bsbp$WTrw1=Ulr+YsWG(1E zfGi}I9S~}y9enkzN=?yw{!*vW!!gmvN^+%LW3}3ADsZw?=)s8_sZAEbgiCzdV}h?t zD8DuX50IcgFR%o^!bF;{?t6@aVL;^hzV|DmyO8xd*lefsbpdxAtPgZIhz*Z$5CN0( z97OxQ?GwZ82Jj-%%u-B{_W-HWjdVbt$R zsjdl=>-GNp$VIko8lcZqfFtA}JnW+{sn?ga%9N##v_?vnTe_MbgI}0Hzn?`fuC(hC zWlrl+$6WIr|EMcqZA7Td>n(C|oab43ml@E$NrIGgKPlFryLulf$R-7ipM3!Dg@4B2 zpIX>h42Qzhh_%_30=GyX){<%?(F^U!8Z>U<%QR_Y0$pw%QhNY5*HeN{n=)B@7zjoe z!b;p849Flngopb3HG6d7AQCx_^fT-s36w6ibqgdad+mFvLwPVXDv3CD4?~#mkyQOq z1Ak1cmCdHh^z1FXzPj_O0u)aHfdrF+dx~6+@xLo{J)`3J0-uzy7Sz4QADkE^OQE<< z5D4vKiA4tkRHWaOT>KCEE@t{uZgAfB?%XNKeyYqiLn9(nJkp z7Q(TkumD2GuuxEC|8buotX?@LfK)pztE_v5G_72$yCv9QvbKW$DEPJ_rC;#KGznbA zk_N)Bd-a#DK?#|Ru&WHEZZpddY#Ir(7!2J4;@CCH=Gl{%U>dgGsasXwAh`DhEG&v- z(~TonGYm+0>v45FgU!J=TP?^Oa@uj4gQiM>Km$WBZhZFE6{1L6f{gFkG`GJ=5{9qM zD?~dlAy>+GB1O8t!P}>PsFEHN$$QxZYwhtBdBtXK2bcwr!6=|&;Ijf5lop^kB{Zso0KHqFF(4Nr6QniiR<&B6OoIMxR88M7v|IS@$Fyh#D= z$48=~CC~joaoq@d=;4^zUTUy2`{|AQ$km*wJZV4bcPxf}_*fzK*P&c(rJ=2)DI}Jx z@B%XUTIX~4bA#x}#V>u&E@3XR7u_06@y}aLF_J$Z9-@g_##noa8{*Bj2MxX50kk5% zeK}uQ8gz!0+#?iOtPrp;0M$_0obqIS69CV)1`9&w9Lx#u=f6Dvqbfi_fK2{dQrlI4 zP#}NP#2=B`RF(fbS_j?vpT+oZ>-)dHb={qSX7K;kSpMt#v!&vHPLKcPt^YYOlGoZl zJ0brOP5Rfjj?p7e-#=*;{v%DYtp1Ohw|_*F{@j$knK~Xx$#wkr&n9U18ST#A#c%&Ek^R<~BWq&>y8XpFV#b zutm%S2e3TZPYo!Dz20;+0po*>Dj>7B}CbI!q+S3~D8rk&@)Hdsc~}?hAL3Dx1G< zAluE6vXy9C+OiSwvg~f#f>+U+mpmTV2;mGd+y2MKTYR}xfuCqi#Z)P_^-rpFQ$c^Z z;=l<&hpyLx`N%jWd7F)Z>L+AkOcGC=iz(SR3U9|BqT3*`dw9z-q?C-9sVmWfJ|>C~ z>s_t=<0PNXXZydZzotDHezm{&`2AG`?y?ssDa4)&KeGNkUf=-GJ(T<{(uQlUk&>hG z`%COrDf1?^XZXypF?e>51ezl$ZWHT#?Jl4T6-dcJc)|T+!e4fxyM#lK-B!yL!ZG(V zxibsg$P>hr793SPTHY0c987U?5x{cxH7FO$ZJ-gEj~6*A(Ie{lO#%=|tSwg7;en__ zMuD^er^&4|g&Ve9r7#e?e%|*Q@|WFSc#u^CbXw1z}^@7cZpQDV>zxdH_PLV&fa*4u3+ZibI0Ax^()M-2har%sMM2|(Ca6sn9(N*CfA$d;wqvV zT;ae9P0qu5noC`S{JWL#nNEcUrIg+Cb&VM9@lj&MS)6+BRnyL<;+t0;aYj<7FUz94 z30@}Tp;f_pi7Z&jW{UWAh4^=UVVTB{JuLKGKg)E+nu$T+T(O?{D87;%8Q!I1p8w&( zlcj9)b%!XD9?;jZT|^Pdl7l^;bw@<{3ycHa`l;_*y}S%dTt19GUDDb+dWG=ah=rsq z;2t`Kct`OBFa8(@RB|!|S$LrL%E`+aryW`!jpFj@Fw1@C{*pok3CxDhA#9A}t~I^QrjOQ>daM1I$p@{JNEeJNOQTX*!BSB_+Yj3s7Zc z2G}`QgoU1!JJbjYJ9k2Z{MyXMN*!v~~j(ZS3E{6g3uoUH7jFxO3z?sg8AR!~WKD9ptJ;cn#y9y(Y-9qA}?SKGHKw;LdW)|*t zWcF-4>>M^5aImrl)PDYSwX?AWza8zIJOCYMD_3`0gom4%ljSy3pdoWJH_**Z7QwHr z`agbcSKs{k+ne7XZ??Kc!`;=)(#p}y6-dC^4*UoDpzY?c$+_-HC`@l#l$R~-fTTA& zc4hk!kf?)|n;WR)uw4NGcyil*dt>WUTt*6vgNG}5lzgD#GC+{#t_XW8Cv!7b@Dm90 z7hwy8v(Gk{2v#?Hdb!3hBbBMSanT3Lf3v$C;sa|e6@$vB!> zY>v65m5r+v;KSL$!);rF?p_Et44wV5-~gs{XE`s$0qjQ~f0p)h(@51tX#Ulb4g*L{4rKIr%%0lfNo!ZkN;CE~oi> zIn7_?PPzj%)!A-bce|4Ab|u~4E9w3y^sBO?hl9JFvx5&5rn{{L7q=-~+@^5xcM2DO z)x5m@Uf&ksN}df?u8u&*%^iTwn{AUY+b&}EI|;LGCd_`3GTRc985l`0$G3+JC<1xL z!mPH5Sp7}}6#AjhcH8Cbw#(W5Ue4}UIV-Z5oVFWBY*#{TS3>+=3Gt)QugaEoo_4^n zz!2L)^4PBLv0dNe_xc{c>iKNH2PS|lB%hyejDZD({xG-_+gA8DE2)7Xn>sxYbN5Z7 zNj9D0V3f@q0TWluPMAYsYQTnUmAYc)Y<&V)I&(93x8KQpXDc&Tv&}`q-PObD_r}HLwt5I!V1R9{E~-wz zx-h`hz#IpY*+>i&5CiO-2CEa8gHR)K2gHmSU>C@1nvsNzn5dkjEL2=nN?r;o0j}bf zmllW0i;79e7&H7Per-D^U|>}@d!n~B48UgTKw%nou5Rw;`b%=pW;kj zTokah#h9eHyr{Ie%s;}Iw%H%^wXJIZw8SJOBt)gfq<=6bBQGi;E&q=&b_$_pW?}zd z#kH-f|2$i=5~31PKL%1tOjcA%PWm5XOCRw^WZ#T3+rS zVNAmg00;7f`%SrI|6#QkgNj4Nf2zH#yr{f5;7LqcR7zSBDhYl|$w&ZjBr7T@3rhVo zJHPAwwia)LA216pUI0^y{O7Q(ySwvo7|aS`Y2_*EhVXE;u(C$D+E|G?S-Hc60r$T% zFaH;r7YE$RNJ>LxWdPGMPzec1QNTNxx?qO<^SpzEJ5dWqGiOm}goBT}m4&U7or{N+ zsI@CBz{*Ta{J-`>{C9;t0X32aodT9k!_NJ8^!xib{kMh0$#sF5-c+$ogHE=W8WKR6 z$)X}t1qe!lY{@piOF|`nv+U1w}OV<2Wd?ym|Qh`ne3ORY` z-6KBYHzfBXN*i6OU+xNoTzs{V!TI$5xwD@wzTHNozwaSAzuD_N(#ga!5)WzC*OE}U z&YXCR$O*qoj3*T2MLkZHx>%vB8GoHGZ7nbNHR1kOOHZeerw~nhA!eDdr)4bILK+d(}!P^uKaKyxkh#(0HJ+M#!J{_OmN}fmBOLF0uTPm#OKWPgJtr zcQu=X^WiR+c08oT^9YBrnLa$DLw!a(Ze&$5Fy+F@v-hv19p!BhyhP`8`pqkeF(Zcu z-%sztYq6QUx=R`kSPf3&4sYk!?&VISW>e% zO{ILAZ_NFrPi{N^hX&<`1^6DgA>-BTEGl*}R{2vov{WaJ@2vXVgGZL#ovzKCL+&rT zDssN~{&4!NA>r-wC%#>!j?wh5Y2b8UURs*CgvJETTJt82E*%$fEuKkvv-@?G^ttD5 zcO7CJTQ78vYBCPQV08~Y%@!HcILB&#-Zf6+wAjN3(vPk>h7E`M3x*uA&Z^0KtYx%N z5~&jDXvfjHa76h?5>NBcfim~}=6tU7(m)G>okXtep2HP;Xx`l0-S+OHO?p;UotLrl zvl}SU(}zM;W3O>0&xM42Qm=XAFqcW>?Yr|$iQAG@_mwH0`(9sb0jF2ao;kRMUQF@s zpb`p`CvZpOhpkWE?RavfJi>0+Ro(Y<_p19-4>P)5Z>IC2Dgsx&*vcX1jt7)qSD%)? z+7p{15S;7~K%iAiib@JfiMJ#YV7#6wG?C1Vj;^im#!r2T@OmU- zgikkYxs)|`jblzVS-NkMtvsjXw!#sFZ#9E`%l>QDJ`*bnJefW@ypJ#6ra41=NHgu9 z>emg=tDosVq^541{f1P4Rj7~h67#b+YCFt~j&0t}>{S`n>l{Igm>uOfM#a;p_N<8~ z8ck$6d@*rKLBg-OfAyoInlmt{# zN=#H-nrzt5nSo8HJ5+Mh5Hi3vfgag!Ahl%~rM93cs6sYqQd{s+YRkO+Zj(2Q|1h`z z6f*mFVaClK{3Xu*J(zJ*q<@94e-CEd9OA#k*1rieZYtehVeH?583ADWH8TMg*_^3= zk61P*;}72d1Q?NpO8o>QazB6u04(yqo&!|!6UfMk{VD@ciPR6kA}9W%{67OyexKgb zWNYxF1KZ#PZ0Y_KIB7LJ>((v9`f>U`8r7E?x4VW;6;dQ^mlSuTMdr4X9m}4RmtP82 z?0dD0@lu849=RalC@a}$8*-HrI=?zQM|JoPJ^t|i*y#M?3;HvMCKx*uTkd-hOzTb6 z#$$FwAl5@Nruk06yFZ2Q*l?b(;3~i4cETm?5zk3hcKS2={ZDKI{OBrsS-MInjv?5^ z_B{x@@aC3ExQFbZ`HIiR_0{&F_6&QKXKx$dPwzH7!}THiY;V3(-AGKe64Nc=vr0PL z>_sQP#;4dZV$3u1kt+#7$P^aS7{j`mQ46Gv&5j4xHx9w9?`k7-38y8GR!f>cDSaz2 zRTWizH;`xb`%Y1@;i=Kk;V%7*rxK>ROse-U1jd<$vF)rr*x0no`y1D#SEc!ev9X#V zc}Gv~DBpc&c}EBJr9irCE>jP+iWuEK7QSqkN{My~%#t*8Ym#a{C1|}2*M`ZALLTTe z^S>Q=$|NR4F}=RGJGVnWt*$WoPM~%|=H(UWxr(q;_o0iI&ismOXWQPf6uE zplS@#y`k4nDBm4BoKix1jUgf0iv9E6)pMq2OCCz|aa(|aqinF2 z&hk%4dULlE)X$^4q?S2kgp-y`l9sz?OQj1ozUt+ObmJXt@=V&;xnGyHmkO)1BnvKM zJtNgVf53$$hU_;TGS?xM;){=V9fH1en2uN}J;FPd7Ss1?F6>6M#Sxk@ZHxFY z8=UhTXO!lcqCOFqH9ND3DHo8%UlMB4E8uCp!3{Kn;TN3}S+i^&YA-!22@LMDGoA)nJ!gbjE$f66g13{_KbbNyo9*wd@w zC5tr@%e|`KKR+s5Vnr(kyI2&C`e+Wyz3{u6N}s6dasEPISMN9dq6aMKeB;pKc5c$Z zGp-E8;nz%0KGh3Qd<_*_#0h6by!$f9dJp3uWnew4_EFSc&L%jlD^2`No^+aV?UMuHQ{>TCq3;m42#680)42v_u?}hBE?cLCd6t=4{ zwI7Ab?oKYv9e z(pv}x?7PW8MS2UNNN-tD=`Dl!HwNvmdTjn}KCaCk{4llu6q5S);FV30{uRFdJ$Pkv zi2o8>|0cY$sdRsZv400%0lvIn>o~wGn=|$A@yh08{K5M_h*$m_j3WCRj`wRsjj`;cHWrRgyIEZyp=LyGneWvdR%6z{3(o|ov0 zo{wH-T)dkYVtQB2Sv>#p6$+90*8%z;ef*D1&K@XjWNp$EruigtBCO%HpCS8E41yN9 z*u6OOlJ(%OXOfO#`);IERHqXA^MyNKUah1@*(xN)Dob4a=uui5v#Q4QwtHiE09K=r z<7z)O55JxlWy56ObHBqJ7!j)cn1N?jrT!BqL+!wX$N(p0!oi~*p8B^upUND+ zXq2_2bLlIC5^F&8iub-*8zs(?zUyWl<5na$557_p;Pnf2cpWXpI;7Z)htO(m~PGFuB2 zH~`-KwY5M2hwJ7q^6b3uHz)nSI|a8G-S##9=1$f?xH^Kfnaxf9F>xsPCoK(*IeQt1Kk*%hM}GNO^!z-d|FmdyNx+cXs)M=&?#uW^CA480uo)!h^m@O z)gSRu)S=BqlvgX~7#{Uhy`#}aX|z#1VV&|t`6iMSFPw2QvkN*UTCN;c6LRHMf#buF z(mn5(R8QE7KM<{}!3B$XLT~ep&^)JScC@|wM)Eeh^1^;w@p`qFJk>(?RkN#S)*U1t ztmJjtyi2`20uRp$AYES_N4Mpc-Z)_<;%ZICJ;;?LxE#e9;@ytjKM zHFYV1D#Fd=eZjq_1<;q`+$ZwGWHV1WOdYeXxzS49|NNckZ8zD)kgu<@pTI1WZaU)6a_z^c1q)5mV84q%fS%gGpQ8}4sD)T(ckTR2bR+*A1R2)-? za7-cdkc^q9komv&mapl%|N9NM=id7~_wiWH+4kCNt-XHldVlY`-nACP<~;doWje=V zT+9-O0Ug%eqqtcmhZ``Qu&+;dlJ)uydZ2FO;~6@@+pDSvNU1A!@P*FU`p}t3d%oZf z#31pNR51`$8;;fixrXP9)b2-WQV&E}d=B=q96uBCh`5Ge z>Y@#)q%Mx5NAtnHC&miHHsjueQ*n2-dHod5dTEC7Faj@9R#3hCdfppX7uKamYMjOr zq9c7LjnzNj7$s9%ZpiEH;cYdf+{#ruGquvFTCa03@ilwfAp!5rm@rjv`zkTV1D7lnS^u=R+Uhr^ zFc>i_rw^)SRAN2q8qU9c*gx++7a1~^KIrwqt~G_;ED+7lc|rpNxOcw;O$~u<3)?m zM_J5`kJXtP+eYSMym{o?VtC#O6`bvzb3YeVpBio$BXXgWRhhg_jN%?iU-97_x+gaM zQJuPSt#9yUM>x}-9}Yx}GCruVb|$_%fGNX}HJW4s_qNHR9ID3S553GMVTSw2*=Hog z%J zi;}v*8SMBfbPD}PbNzDrGXAw%#;rF*t2-P#wq1c_bKd25z-upDM{r}D{YK`<=3|43 z)9-r{mvJ6GnnBg?;7-Wf3jaXbeshibT85B?G0qm&R!-sd#q;*g!*72T%xqoM^r_|sRVK)Xkf>7bjn_SJmTqKF`N}ZQ87m%R8}CRG#a< z;7@y=RaJFaPt)2ErT-{0GR^kWoTs)gZpzZN$nnI~1CjmDD_+bkurP>Rl8U7yW^_Wyo3rlAaXQ|St7@f9q9M78; zSZC1!(oc|1(9>|(W=Hp^W|i?ROL1Jg!5SxJ3({IyHASq%gFBaSHqNnhem+=B%a|^v zLNAT&28(T2yCS=%JlmbH=4>123url2ik}W89!&eJrGc$*#A(i)}vY&VN+fgf*;}?7=-8)CDl_TmX zB1cc%_*lGe71s6ovp{u~16j$ZM6n}ur>U(jJ2;8@o)anUx+Kbx=p{)~&m3^#{U?W=_m-SN%#kb2-oY^$1lwElr(I zPHYMzsNNeV1Fn5el$V~L`RFbr>qF43h0K6g=6;^EcuA$0guR-Z)-@)S%5_bSeBwQQ zcMoaa881VQpqOx4jJ`vYa;3?iGtdUL1WcT`J0>E&Qy1K8Kg_&atPSa>=}3zVkk7HFMqR#q@*fD{a}QIG$4xd!a?Rxwh(;%!IU9OU4X^UzY2e6eP0oQBdJL z8R@$dXD+N|s$4QRyRo5L_)0@CX?`_R+_fazJaTjFrP%1sMnb{%R*K}w;bB)UEz_x5 z>fHj({y8+R&}lsrSv@%G=OVH9T63!_x2+4DP{odLEjpx==w=-mv6HnW>Q!0hu4l_) zGcIcA^_UZiul%6J<4U}n9y8|bROaUPC4Es1vnACr%C*BU%TS*`)+8z~4iw*tO;k`m zb&na3A*EV4@xs7>DKgGz^jMp&_MsL6pOI!OWqzl3ZB$EK^W+;Yi}^R2OUCTVUk%I+ zX4bm-*~$jA;iV;wxqF#KowrbEquv@fL!p?fDNneNIu_LRR_-Z3_1P`6^G%8kS_wv_G|FgwOghJ)@(}VK=2&M)PN$vM?viEA3sy{hbMC4eGRJx zf&w5?4233%-PEz70m=u%fuPTvK;hsAkX2ekAqP5~a2j5S-Q%6p0cO{Dzs$$!Aoyu` zA)XIh2f_&eyBK<|4iK3D`1ikj=Ai*>4T z)K3S9kpg0LzFg;^;oC14m@VMjFBgdL0^&3G?t$~t@a>li21D(a3q(Hf@0Sb2GXQa# zU+(9m;omP8j-UaeslHqXBE0s?1wxnhiv^-`_DkiZ0Zfv;n}Krn%LIa+IQGi~gJ<^3 z1fnQ7_R9o=z1z;&AMh3Q}_rD|=P|P$Y00Few85eqr|eCeWVs z^CboThrFe4a}%8Y1ap9;eE$RC=le_l_#5bM{0(^Ev%Ux3e!w=~4*}a8K%gi13&bVr zAb?*^;1`G%*5L+zfjD6uUf>sqt+pa%z*uS>z=8$d8<+zy z$C z1IQ52CtwahYJddH0muoEfH?rk01_|U=IR&7}x{B9t!qg0O0@*0Ravn0giymg|GmJzyOEP z0EgfJgs*`mLV$onh=2pb8E^%{1RMed99X^pUV-Wi;Q|f;0}der4nYGBVFM0<0}i1B z4#5Ks;RBR5;0X{yKsg0JL*+ssfkP;PLok6uIDtbzfkQ}vLr{T3SOJ0>z`PJz;1FEk z5MJOAVBip9;1Fcs5N4oAd_Yp5_YA=X4&eq0!UwKH?-_y)9KsG1b`J;@)LsZaa0owe z2taTML2w8{KtLT>69`0b2t{xRMo>gOa2;wdgd{iwB{+m7I0Pm*geEuyCpd&BC{7*_ zVW?aPQg8@Ua0paz2vu+hR&WSc2nbgQ2v-OQR|p7K2nbgQ2v-OQR|p7K2nbgQ2v-OQ zR|sfaK|r`dK)6CcxI#dI>;R*ra3IX8?0pSV(;R*ra3IX8?0pSV(;R*ra3IX8?0pSV( z;R*ra3XEq3o)6&)0pSV(;R*ra3IX8?0pSV(;R*rZ>bs#F)HnM>`4va5LYha9vE0&=$UgSs@&R5{+5|0T#_=X{HnaJ)k~wiGdDP+5-6k6{i}BCF&S^{ zdQ~P}Jud1hCM$1 z*k2EU{tEeL{dMKr{yMkUU!J{hurqdVVY_i~Sy-T)tS~W{i0y%OHb1zq!Qp>k399LjUA5oL@0#?5 z5dNXA`VSE;VCekPUtdKFBJ@Av5Exzmcz*$%_3slcsHQ*k7i5?G)TBS?4F69W3ispA zza0u8L+hu;eX%_LAQ=Ch{k3m#z`qWKkiGa*lfKwbf3QhJ9P;qd1Bx7H2ovHP#zyN? z=O;6-C|!$vN=*>@b`1zj!feL7w_&!?+-$bNj>*HbF^E@uPkp0#oj(=jSVKdvz9G-= zTi=sdb5DCf-Of%uksXhubSglGD!Nf8Zg+Rr=zcqcV4P@mS{9=cc9YwImi}Fa@y`%dH zGi8`Cmp){f`gXhFednNt<9<8t@d(rhC68;{KtVCK?4%yPVVR6HJ=|DNvGk8t)6$%I z;?9~ibg!w2rHLCas*(UZcIQsjt!H=yVG|(O$X?57|DZ`#@jSONJ)!9M2v*Z1)*yaJQt5Dq(1fgNMy$vNWRQ3(6g12A!ZYs`KF zzf%Z*l573z8*}>z`$@@lxHDDV7JyBKM2!RKr#yWOu81Ca_;D9^o$U*7J>nHuF-`L* zGEVjCvU#*YD1YL0m;XV>6VHmZB5I@x$z!eU1l?(`w6>j16c#j?t zb38rjPc*J=%qN@ZH5@91H8sRfn6A!3cnG(ECiD1h4~J=b*1KeDUY?}PcXv}nu2-(RpD+Wip<^xX8dC^g969Cu&^q-y+{3@6}Ie{*!$4Uk`vkfaZO6_AQ$C8~7cX z|GStdVC4P8L?Kt=kDau)vg)7Di9f z^FAoP8_xcuE%UDjz&}@`fH(SQH19X?yT<&_iurG~VgR4;ULSvB#Xz%)KaE)b1y&5; z+Wr}^`wjdKuz$vi`S*Ju0cZV}cENx1Ktgl8KXuZdA?N>I-uD|t|LP%u=Bj^c(x0K| zfCutlKT!V9L-H3rB*47V&tuDezke%^`|F?olRYF*9YJt@V^cz56h8tMm_hrGGE^q+ zoj>Q$;^C82J8_LF>FO@^!9?|h*SeL8Gz%h&?$%=G>8KfReA*R$r7#w@*0`NAUaP)b zu|*Mb<-VlLu*n0Ko2x{1g2#rRypVil(ceY8y%gW1N8`z~E?g!aEhblSS?6A|=vCSV zN1q|Rhn5P1ndzK!un;!_TAC__91)6}m6^>)ZCYO)m_!AfKZoJFO_H?faX9N^OI8z2 zA-rBB!Ram4Rk+BrLZ`Smarq%A|m9;{oeOSEonzWan?n4_{WE_$CYV@QR-(1MY$9R#17Kc zWxOTayoGN!?i)i=nsj>3%V(X?m*_SPqbeUe&iZ&YtH+kN$*Y4)QFQB@yRY~hI6UL= zR_v(HTG418I(}sn>!CbX%&wdlXYt0`u33-(`++PFXC>W=B4xoNVbN^4SHTuws$^A#{tqA-N*@qHZ z#QC>s_G{MYL#s;vPQ8B38hs$T5`xEH-tLj}7p>8U*4_S{_w_5*=mYVmfA(zw(dysq zLkYxhvU38FqTD>}+<-p{!3SsO0m4&xfZaR!5kQdpU)+Zh+{@9xKu5>n=gl0&70!t( zu-~*XHThv%N+1sRYg@p*8X;H8Pdhq7YpeJB;ZN>2@Y}uuVATJ&1I;%ZF`knEwpfP- zyMMeVDI->IyXPz^{Ts$I3bNqox! zGr#?%*t=ME7AYFs_HM0LQN2=qDXAj&@1{xDH!RmWzgk-?ICA&HvBSv$-VKZ)w|HpR zm~b9My6^|(+t3mW20zp=I9VIUN|WT@I_9Hprzfa;4I2}a{8mS!?p?f#^vn|}Cv%%E zoR-BBPF}G-F>+7+1jbWun#Cro*AAaun(TF(pWl}|E zf;tZ;J&LFI=~gjxh+RoN9tvKW7p4s3N-{OZ+CdY4KEr{=X2fjomepOOVwV?q%<@iw z%=$FWnR~=%HgrV9#%>%i{h->9Il)>tzJ?0KyNE5tZ*pl2-5){qBrii&lhIanbejg_ zo)W90Nw6OK=tt`7O1Xz0WEf;W!*|4?Tf(H0Vu*mlYSL zlCN>;S_w;tMjY<-Gaq=uP2=j`aIWNw!@Wn0+QmisHn7NS?SH8}duCTyq}@=YI$ z3B5uTW-L0WNk^=FPGd#DT#Y;p#IKK>&SKzHQM@3)Umu354{1B}VeBy~ayz)gF7{fm zhOG+iP2s%DazwT7m0RaC{s=8jJ*pIr(=ykJcCb~Hk#Ocr7C_)c{DvnU+= zY=l8j&cB5n-1u1GX9@y|3LwyUyxd=%2S9N4SE1U|=Ra%&cFzp~ zL-&UpAS(S2dGUaK7r43Kauz-ZV#_bmUDc!MJJBfLJl3|>$gONqKY<4XfX7E3#`(FE zpaQ^7;)3r7T!D)#e(a;4n-1+>`(?2d4G$cF2W&D9oz8&Z13q88Wn+ECz)H;A)B-pF z0N6!=58S8{IOpN2g^nJu&-x_;yIXn&N|!Hw4O`yZyy>5htg{16p~=PhB08_u$r5#h zd&yQuEJof8w$2{dPPu#5Yh9V6&PpdBuf~dnzWb%Avq~f@hWqA{z`qx5AaWU*$U^Os3j0!moDgCS9e@aS1-x<~d|0%Sif57I0I)O2li1h1# zVPafIp6GcO4Z|Fo%Q^d^2aY^Ykqu-zq6=i&e2NecJG|p6ZMywRjliD)B}~~j>2p3v zOzbE|k%lI!Kxw32m?^h>mRh{OEQ!+%g9|L1*M2NO_O|3|A*+8pn-=gG=Mt-n4BRZ6 zY9Zpyvu4+GOWAg}lWGtKm4VCXR672k%FX6@!p!(~)Gl=M<$DI?;M)lI`IBz(Q&-9Q6>0D63T6=z-}F+i z>XXU|Ym^P%ObRzwDMH!0QRE;eHD2@Mmm`akV9PPrFHvIKyL_Aq1=Ct z?Q$aDNRiw&>w-{@AY*Q}tEPSqLH9cYRVsK~N%uwlU2Ci)^uR0Om#-t-cIQ2( zhl;~0A4WBoBI0a*J2;sxV)wc-c~e`g+F3P|8$a*;FF+9q|?EcN(Y^O@506b!CS~+Y{1`W0R!_ zHDk%`wK81d#OrPYZAYgYGtE7m49udW>FQtSM#uG2^50yNzNQX5-C(jokg2_~{L=hR zq2Yri=^PVVgY~Qnqb*OJp0@cqJX@jMc6>H}<(gdAhKxHb&)Q(_rMh?hiWKI_(Gw`E zX3Nb@BZHS=+hg&)6Bp$;H`5SaK2}#HpV}Qlj+YlN$}WF4$dpchJ#gIXlaP{y`hqVb zbw)XN&L!Gh;u0!Wf{Euf*I!n#HcaU^j$T!jF@NCrpx$+^Ti(LBQf@^kZzMYdX+{5_ zDG;TkNjB{@JAKSVP9|;%?SQnnsu|O-`aZ4Ly05A=3`zSzS}BgwnjZO*iS@!02FI%T z(`if0$Z?5-Y!(KqI|S;!$uM6N(Z&dM{+@`5t0^lv{cb_3^L?qNH?hNDifCBPR0Lmq z`vpE2$BpyOxkwUrBc~pxu^i&QLYd@M^|BLZ_T*|T;zKEdZ}zbO0Z&&6pJ1-wRTwK{ zbEV8ULA}pd#FIU-tdD>r-<;#VBD7qXxZ1+^L@=0j7(FL;Em4}JhhEQ_5NHt~v!O8K z;Y>}9bO9$uE05SAc2l-f70j>vgL;xF=L<`lNs78JPS;jOC^UYl8!O3*bodGC#f50t z7$7PgUxosKK>?M#oX$^l^t5D&)dh|!`xwKa-Y}1 zFmn!4wW@O8aED=9&{srY$QLWcVHcecQ3>y51-=%Y7?Q?N$F-n$&&YXa0^EFsB-QYU z1wBU2!J-ow$OG!Q+D~CG)PdaL;u&MWSKw35K_DaYK=hP!;3*)tf#U5_;Omey@UNTC z+|zJGys*uBJ8dR`=R$XLNJSA409kmh#_i{YZg#mCMQ{YTj+bL23zP>v6#7SFdn(oe zph})FN_^l6P`#mwF566A0iODBNV*pDOTD3r7B#GO=id~Kd7r!OxxTe_M=RfDVsgE! zA>R-eWp&EOsQQ@ASgY&U*tRcYp}W!N#p%>_H-b~SzCfo44^=1cq`f&vPBLcys`6X| zjM>BvfDKAM$p1w*alr(y(7~1P2h?(16(qOMfwx1%OBCW>6 zH&v6e>eSQfDF^2-Ye*RZdSDcNPd${jA!Zy|Bv!wamP35bA1Ie7GNr0BNX0R7t)w%8 z_$AG_bWYZdP&~Df^QXgL=CR1Oo|(@nFfGhO0tRn*jx3_PibG(w#TSZ#dPak!!*;{Z ztJ;mXuAnI_T`35bE?wuI>sxS;)Qqu4AMLUjvr$a+hrNpZxU`gWl>N?y&MLa;s8RL| zu|TznEj~JuGxBC4#iX76q4MuhF4l=i{r=9HD&p=QO=&QlJnYO z!NEPvF%EBda^bH+VYx%-s~wM9qfXV?7Hg(++TF=AoVHqAFIa1MJB7YYQXf$u4DA0i zHaF%bI9Q%gN!I_A{HEF=A(Up!jCX@=D0S@u#r6y5>=B-|;O8@9R##EwW7YQOSE}zV zN_wgH2%>eXo^(;?QaQM|mI}Pq$ZVK9_c{g`D82h*z3-GokvC*gCUrayJ7r@qeVHdq zlkD_?@IiUE%}M#*&a0Mr?L`ZkcHNv1?l>Cxfx&rXur(QD6RJ zt0=^9|80UzUX>un_0Q!OrqL!PaTcy!l4VPzr!@%i|374MWnZ_-&BT%J9GiyaK;i`ZJ0*dL-RB8t@A^P(s!DL!zth446Hc~b= zXPx;rqSfOG?89xzSZS2qn(VF%(-|{t`kB8$O;?iGkU6z_CMx;0*p4bsM;srseY&N) zg7)0Bnq#uLXiDsH~JzJooP2JF(`AXM5=6V)ySf3X>IBZ zJEhjWFrw4JHI;RAiy05(mU+F52jRIhaYt09v}H{>A4jN@^gMGjNf;`(wIkQkb~9*> zsDDrD-8)Q(jI5m%tc{?~LXrrWWC}Deb0>C?bk@(lF6@L^Yu)3Vd$L=^Hh%B*GWxK+ z&Daws1Mw(0W!L#@eG__i??g_AI|17DZN&Vvy@OF*cOp)4{-?(4E9iWsOaU3Y9FqLr zrJd2vmodoZiCrq}dO}*cvYl%4 z-I&hf4R7sxI+hJ;IlY@XYtS;N{AFLU-0Y2^rMWNHfNJi=zx)CX`{)s=2Gncg?1@x|VH+Wd_2g z)g{PK8**Eh70;Bg9&43)p7uV1xvfCrwObS{s$)KJ*-fF?s;@uD(F_>IW8RL<-+HY| zb>jW9L`&aG*M-h7qco*NmGUP-0iQdx5$gPne|7$EAFf|QkO%j0B z@TA8CcZ_wZECKH^y-Z~V%?&&^RkncNe@j5zYHVOxS^#1{1YzTaom|upC38wkV3UyI z;unwA;+PyEvl5&dQEcEvDV4GUx+4BbGt4OAm<&~F77v53m8-8Ku*yTk3F??lw>>+geX^X`93lS}z07*AN9tjK9P=ep5q$6$3da zi|->zG@?EkjiK%+e7xcu9>|BhZF~=dEX9-l6ouyVk8PO1b9r*A7he0jLrf*1Wt+fK z5@-(kbW+HUZ@Q+EU-+jvyw}TgWP1HBhoq$FAuk3}rtRgN3O3Dx^gctJHCM zkRbh{YAR?ol=KDL58mE``{QBshvJkfWeo(wZRi=O6Vpl!B?=p#wPmB2zC1v@_}!$F zW>kQ0DXgYJSKANvUSX*W?J!1`lfErj^Y-eXMgRs_h zm{w+v3{BGKYx0}B9IDpN*zal8T*^o~VClDED9fDED42p#c!zE0$4M*70vlgVIg0Z# z_iwU48uCBZH95;w9tmrRD@(XZ)h#FVL_$TwC@?Xn8!i*|F-~ip(|=3m>CWdJ2UI8O zszMHxlZ%ti_N(dA6PE8UP*cA*?1D|CIy^8Pth>;{I+-}PFw=fDU*l}VDV6lMopzfs z@0{{ek%eS|s1uA+5#Aq!aJ{!#Tmy;l%!1ol&fRuBRlA0wivy*V30+V5tYhXJ|Gh_9 z4gDdHMs_YWpRQLdDVbd}%2M~`TtT}iM{wPGv1~`Zi{8==m@IjFH!Q})BFXw`HdP_4 zINv#L?1Aw7F%nJMq6Z^*^^7EM=uQsmtydg+Ux&1>Nb3`qGm<(TlNkN zuN{soR409O?LvwHot8?}^0e33flFothL?;M0oo~mN~)CWo%LP3hD>~lBw2}S+_8#1 zZ)hRKeVI7E{ib{Z{-(Oid}`2i9}00R(Pd<&*f7% zIYY%63W;2@8B!CkpH68WWd7O|_f zUX)L}o+9Oi*penK@y+b&Bxr@tG#4Qfci9OI+B4(Z4bCpJ9L@GUMmCiRJOlRRonCq# z!HsyEu}%kg@o2SQ!acm?k&ATKjJ+xf8y6C1IgU;iC1r1xQce|2u9({hb=TcOC2J#< zW!EGC-j3#^4DeWwctFrHJ3-Nyw}QTq%FxlDCG+?a%UFzCL|oJ+U>@Ki2{MqH?<2B- z(rxE-@?RHZRVl8Z!+Ns~OAyjrV-fy2zD|X(UGtEDTkiPtrj zC2}aDG)UN!65koGw_#?Z`&1cHKHWk}_=dSYLzXkeZzA1hM%5`tdLKoX2OhOCcXb~Mb9;C-$%p|_~Vv8IW5JuixXyH%ViPep~)D&UEbADW!RhlLEO-j{M zTHg~o;1GnA5?ZKnG+?hysauPtZylD#QzJZPF*f5wR!&7(K9$UvJt~E-8i9FCCo>9YH)aFYLTIr-jpn{!T8om#FRd0(R*9eAx z=(eI?IIDQurpd^*t_KAe^h0!!0Qoprq%@2Rd>DF}^KLH92SZe2Sbd}e(4ez2p$un( zPdwKW0bpoE9)=UetAm3R-8DyXuxG5gFyMNQjXp-s7K@i4OYkAk1>hJ%UgE)8JW zOuFxx?U%8>HQOr$H3WzOX24X`W(lwW;L{iSQ2sdM2H+$`9w@XMV<&9!NeHQk_~IvJ zJZnL3VGMX@JiBpm)p7fUa*1;T7DyYg~(N(l`scYIYAw`55bV2!{5YfVe8V|194t7Oo(E7Zi z-_2T1^q7Oi;jEVnCu%xoX2lcPf3Pjom?(O%Q7EF)T;BEFWCn7jLC=Bo|4WH z77qt#TNc2?)#w~Zf+JsMojZPXzuUYTh%$`xOd{H}pN~= zXx^yV<|eMnh~Zp&1DSN=jW(m0l_M)@pZHCKns>^p#ipX^a&XkBINJpVM!E-7v-RFg zICR=0+PyP1ee-f$ut`6Lll8Gy!?dRTas(63FvyFVPtPZ+xw(WkcN*lLYE9illHf4l z_b~vR+yAOz(LGp{-;#}8N}fQBg3h4Q*#mbd^ADbGJIr z8a+1}HXTaQRXc>9N3RfI`^%Id9^|^xCd)qMK-OkW*@~u5)7$j4vGg zBZdtp_@qGt;6x}n{xQXsJAb-Pj(|+M#k55~D^;e5;+@u$!Z|H7Pxf?|{;7yLE#GO> zQue`+IF^+QG}#CX_I1@UOSAfI)|uC4GgnaN>qQCrTDmrZO5S0}0j!YU8%E1l?76*(@t9UYAp;*3NA9oLu9KN{vj4 zduK0Zx85EhBRuy=iAnZFG#lEqDRt^z^$=R*szUM7#}|6#k;~diFuLaK@n?4w1~MoL z1PfEA&m%< zJ}qlUgKAfAmj!)ImB9%gn6;y2&-`(unZ{VDilYG^L6G`v^OBva@4T2j!)dY?r>T3? zsPH#Ef}L-cAsDMWW$Ljxt50@WQl12$cTWT5tr64b_UL8z2lPeiNhzdqb0b^Mj3ifW ziB+}ul!Sp}J!=--=|H3WWJHsa%M&EK?bt_PcL$j_!1+6KszMzlf#K%aCrdLv;eD_I zT*yTTGR8TYE1xDsK(~N8I%1J%GQ2cDPm?T0t4AYO&@4T6ETLZi{LA+)xZcBj-Oe4b z!goTjupZqHu{qu)VZ@`|#jb0))n)3aZ5xA3`+EVi0NNTD+ZK~P#{(*!l{M;2Bxldc z3ObwPT8Zu8*l@73O&NkY?P=-L6Gyj928Y**0^a8s-vHf)bLgf1K>b(KJVqu8nK;(d z*J{_At;ZHG2{c4_*^p7>Tx}jg_X%EAptzoEQnD;*Bvz_hhPd^-u8g(8p0VcuuPeKL zTFDAs;j~h2HMT~~TuF%+Y}2Y+Dkr{Emg7WEQiKr9giWDG)>*ikAFYJ4 zzBoN=T4Ri3S~I;$oFl$aJSl|AaZTu0v1eo+Fkj3kGdQ!zuaVntTYqTmGoHHJ*&Dh2 z!$%SJ&ZFrz1~}_?qVOhgkN_eSZe~X(CeHG@)I3qLS3=nRLrLZ zUK^>K|1f1fq~2wD-=zZvxYz9s=I-7}byysb>SZWZmky8HM5c`_YUD!?EJir?zLIsh zeeHH`tQei%9j$pz`daMAfHEC@!C0~st*x1cwMw^wp6R%obF2R1FdY>YG#1XFlL^>E z6xnl-h9mxJOWWb{;Edj=G#okJ)@bT{)8&W^!&R!q6mWcPj5yWIB^)BYQ{I8ImY=0s z5uuxtCB4jG&6)IA5(B8lsi^VnlTtw#fTj?B44Unsm%+Ou7d`lEV&V3}4*t#y`&Gekdw~#tr)Iw*8V=kx@@qc= zA!Oj*kzoABkEa6f1&Zuf|IY=H0a0?$#ungH|JFe@K%g10B`#DyFdXg2Lni*=;lJRv zm0w%=TLcIcq4LkeA_kOY6#7I6BYV}@x4eaVmC9ybZwin|he&t$br!zF3FE7*$@4Pp zU7A0?YUY_2b_h?BSS7!XTx{oZ5bbJ(nV5n z;iJIWdK>HMdhz4!a;6nKaBNXYTtm+@@<+MCy36msu9wUbTjtd>(_`oFyz7A-BsP2F zz)h@9-S)S~+n-rH6v*oqsko*iVXng|KP{NSBAG%nm~w+PcdAIIFh$1GBmZA77f)u{j<&pO1O|&^wD~)SeHYg`)2bELK6uj-rJmg3RD9_!OK55shd?Z(Zw5zK@AA=niuGMv(=iN9V$AO8sp$(QO zMSTB9R}antrj&0%(I>ItvOE%4=FKs!Tdw73Tg?uG_;K5@akiX%0ers#>iQIUSBBCg ze0JZ{HEtp$Nf%T@bs1_j{JJBYE65m}jQB;#9z63p7k2uoL+*Ugo6wH~&4;tF-#;k* zD42Jc*wL=6%52KU_JajmdvAuJ_iKS$Lz@Z8wy`bQX|j<9O7tkxyr=Uv6|(+1%k<;x zbjz*Scdpa-Xz<;|WF*|-yH1r5RnyVmvDBK58R;i>IopKWxh<0Btjh7xjXMV3X3s*$ z<)}re3C}gRRWet8s1hA@Jy5I@xYAlA^rmakrGog-ec6HZhF;ajyP|RH>JF)630%$U zN7$M}Cv66VYZ~36$QB|`9`kxhwi&^o?~ErTongyg!0JIUdyKYAd<|yldXhG)gq8sdfrqU=%0IB=e8Kc#s9sb~>*C;$ZVI(q?IsqBJLbLLQQ2R@ zQt|k{(b&IplGu;oX^@nDAD#vsiw0c!%i(Ez=L!LoU~kv}H>!og)1Y&UfH1W$=LUTn zo(67g`*pPV&*B46GxkT}zf`qf#0Q}F`gbb!i}(Q4&ws04zbH6<4|#v5X1|0Fe0M$~ z$Oj;~{T)64N#=g_{~RCqM;zc=o&aoq`6Z(C{|`L>r+nZ$$^LFd!afgxRs;ZJ%s&e} z??B3#w~G*#S=OcA(FxAGo4)yBWzNc2{HpJP$EIfqe7vOOZVz{7k5s%jn$f`Nl2?sN zd(5PS=*e|l9&F5NI$U#%j+hC5%3Q**;W$cM?XJY46P4+hYFDda5}m`i>K~)d)t;@- zc^QGZD}%e`t~eA*B#KWG*6(_6r2g(hEbAmr`)45s_>|LIutM&2&A4ZzKT@KE1CgU| zW5y0)8RD(I|1dt9UVEj)MuWleo|Uw~h5B(R5_>Y8>$ccaI^jWgv<{whm$ObOZa(c) zJJ?F;n0tOh_K5by zYK%r>sFY4+m~nVryuW@Nm1fD=`Apw*{?xiaU<1N!)URrQU^nUCsU(}YZ6x~d4rn6~uGtaj%_mQ)2rI`R~b%Uz?1fbj;|YnnFZgnhze+~`St zgepslRmYEJoqrFj!bq>=3|}Oq|2!Dp-FsFOg%ccUq<%Ks1W$-vFs;^MK)~0Her!b} zuXxg@(t4(L^Q`EW+6lYy>9#zg64|nhbGhT?a}LXkkNA)BlpeL*>S?#3xa==4nuUJs z`SwxuO_%e=?Pl)}q?%f03$Jk{@yVg}U(DF5%*1%HxHE^hM^BOY9N8JIMZXtvB%1x1 z80@dT!Q+Gfwh1M;IsA{>_D5m>iS75qVDE&#KTHh3E#;wbZ^%dmkDvgzpxI+R5p_yd|{R@OG)`vI2P&;UnZ&;V~4s1P2wm;R5h@y{9Lh+o7Ep!fQB-q|l= z22el$t$O_`X0U&b&NmAr{#;l75@zt-s!Wg>K!W=_%m8HA`|tJtyYJhz5dYtO-!2yW z|L*&4dFG#FB!B8y-G3z`fetI$e_Q*E1RzMzVD--!NfT1WoJjO&`9#|*j{XzAMVyIi zFWz2zOhbHFo$x+AE@AJ?%Q!ZrJ2*b?{nsLDFT`@mrQS@9;2g}`?nyMKsN@s!v>Z}5 zFt2>GOi)6vLT(Ok4>LLPAiR)LaSnY-9>=;~^KydDef%f^E{gbYS@%WuZ9mSpM_K*v zJX6}T5KT%ymOXYLJ3g?EMwQ{9Lw3(cXG06F^){hNSIRPe$}4B7N*`oMdlkOCa?Eg% zR!Vp>K3G|YkMQD{rC(M3Nmyz_g>5Ux;-lm;eX)T^p;g~x! zuX){)2}@b{(V@8*%OboWMFqluCwOAFMJ9t@QFy8F-4ZxdWQ4mRZ6OjUYo%~ss<4k~ zX%wGtjM_?>G*ZHy$4^l5N{+U#y7P;((G7w`2NiCJI3d6r zUFdmBvO?-)D%R^+y8!a|NCV-tPq|&8iMve8bI}jyl%_S`-`V7*WPEWHW;I7`F?f64 zK(m-b+DhkwoSQ^gtn0Pdi!heDN~7tJHY{#?au?eSi^-dulp<`Mu8H?Yh72w36AI;P z!XjuAx>LRUHRqFY=4x7rUvPI&htb3zTs*5_V|9l!J2mFiO*?+Z({nBZ1FuvKE2$6H zmz1RB*-6&4e>~PspHxLtK2Ijc7Hi3V@^(#aektFjoPHYP$I`GP+y3{O?&1_QxZcvH zylYtvFCy}83mNjcsCb;0+Ob}?Q$ ze=zvZq8Iz;EBs}h^sDH_{wWE6xnjSFUhE%m@Yn10tLVl4IR$^YX1|19Kqmn1V;@xW zkl_9fy?{h>|HeP3=D&3?{39m>AcJ2V59cI+699lLp!lAX0QS*@=DhZ%6~CQw{C*|; zpL0k6r&4_#o%Yo~wBz?5a!AOS_lgjfTi0uK4?erbFt}zGe2Yq{{i&3U!u4Z^;_n{d zfy*cFYzCDX>zYi6`-J1+8ouXTcHL~cDCI*feetlEqT5x3=BGODUUiiwwB_>`yp{{a zmou;D={~26mV__G;CS^x>sy$b!^=pjOs&%RDGn`5) z>1&_XUuXx~%4iL&w&SMap5ifz!&Tt#hX{K#b|_5;kcxGUzqeFzF%U z*OGBM7PtX%g~w_axngWIuwK$1#1a+L4n0n#S}MD=Bjl2pb%1V0?EZRSOd8Eua?)f) zlhYGtN$Xv8MTwOR{LU!{G)rbqKSxe>nq+IIvv))bKlNx0yp~ig6)$c*>U~LqwY9n3 zq@$62>_Aa>C^=TzSxMu1cdutv;<`uR?DGLfk_XGxq`9$b$i@|h%~9|2By8@6@^x}t zKb?Hw!3npj^TLnHqtC3Hh-Zm&nn{V0uMj_ssi4Fs(|)2Zgnn3+eWln{L*yyl!?LvV zhps)LUQ3gRq15;1Ex4Y6yHfa$@Dk4AYfJn$(!yJhB4j9RHX(a33Hf=z^ z&s7nT+g&o3c~0uXIC?kvLI=^HZFSkF+G*pwPP#^ti!!@dHZ8?(JIddc5)>E7UB@bP zU(-(vx^gepI|7T>j`ySCBA-S;npC(#dx~R-#IePb+#>PJoSKi(qD)Hn668~PN?Zh= zloL-=Pr1w%QD-`gUE_Y`mtg4}(Od?EQuA6*Nc9A5^&5oONDX#s`Lmvy!M%8`Bdt*C z`e2@8xA^t&ZClhUfE*A_PIulP&+VZ`?-49 z!={460aaA7IMz1LNo&HS1T#WMa+Q`%j777j3GT_sghae98O)(6oK2Q6Sn(Z^ihps% zNISa!_*C-y#iDIqDa`BVPo{6Npv(Bg3*7H*OJ}}$BD}-q(0V0z^iX?(DZ%i$wng0+ zjcN4;4W^}cKYwy287DbdzNWRYvx9S1O%Cg4y7Ak_{CvE>ZQ2SRHuqJaf1hqZGXK3d zWB*9ezfL#y4jBdJS-;Q?Xj5{4ZtNW_3jF;Yx&h_cA4&hS=*IpA@qbxI{VKY#zuEg= zuGlZ48&E(0oxc2KaSssk{!Yz)3EkK~$Or02kZwSN`#W?463zYU|4F*RwNDuU`tVH* z1aM>{9Ps|_@rr-WL;fFk!#|9I_-@t%*fiton6yta_D=}@XFi6G>-A=R9E8|TpXgsz z3}$(evJZEvwZFlPJ#g#5+OjKzrM4ph!X?-;>nKE-p^LEkUkc;ku4EN*L23a5P zML%2uq963(A`05pw}_3`DwPNCHl+9t)9s(HA8mpW?jy*C$ji26U!u@KIi#N zFnzJ z54MOC({&VhBcJpZH!@dtAbw9K3H_)`UAG<=XIMOxM~jGcFT=-URfu+OHnP=`#hWbnSZw1 zO?l~_lR>w-EIDssIIHoM(Nhz#_+D(n+dwea=V!IK`+mrE_j?qq)-i_2hzjx3w9tEI zxZ$(&QGi+hD7gYva@m`EnO?njU|3Hd;rZn&UTCJck$$5TMs`iA5nuR#`2-mP3tMh? zT!HSRtZ;b$^RV-(3nrO-&(2NKPWJI_%Q!l%U8St! zGyZi3@AR!zviBz&8arR$BRP#r`dj?C^6tlMKOzQQ5$W%wPKvRN0W={*KDtKRE#s=s%~jztzUydIA9V z7j%#Yo=mTFM;DhVzj?KPSsD zkW!!W62~C^&CLiTMQ{{_tG$;$X7NW8+2baBmx*DT+=Ze3!2sr0zsw%~)l8@C|&cFYzZ71jy=?BN$ux|y~d!R?Q;Zbwy4>SMjumiDfd zdVS`|JLw69k5z@;l}?q0r36H3i3OyQl1>Rh8kX*mQaS|b5CKW)5)q|C5TvA$mM%dlrTon< zqVha`zn|yP*Z24N<5kDmnVp$E=bkxpuKPOox$X&G?7mP#a5`?lN?-$>$(YB16x8);RviNU!xCc??9Yn?NtB9}NL$k4R2wKMTvn;m zu+n)%KJfVwxpt`aon-gyyMlS_8TS*8=HvP}6*fs3Fwy8ruZL9Hi!a631=C{cmUnY= zowu;pTaf6`z%&k`#+IfbAE)42Q?v=Ny+)^gvp-z$e5kPDOJ~~nwsF3;e9kWZ9Zdqw zn^`QAA~@07VlQhR)(sNi2M2q$C8NK(Hatl9?5)^mCCc!Ikj3~0OEn+*hSexrl5T5C z)869Vh#uFc?Y&0t33s6v9`;=x9uI1p_Iyv6-zYZ&eULREMrq%9PKB9uORYJ`H;Da9 zV1nIroM7JATyXqlLa8>qXkd~*OZ)%;{{e%V!|1Timq+m806bp ze)6<7U^T9d9}UWs&y(8vvU)7nF|AZ_iz}9bUr0`(yH-N;1(6aMGgmWyo5+F%yAqXK zub{rS95U5@wf;&#q)l2@Lxb=XF2uF8#Z(;qenQ-S z8{Rw)&x-^-?V9%+w2eZ&?kwDf4y9Ph{FfNpS<6> zm4Bj#2DAO8hdyq&fA67>o90RJ|78#T13&+xQ~hJl4dgZZ%GI+<00F*WcqZTfmAL;$ zjx_irJtzEmIO(qcX)4YEbvc`NY`8TJOSd*Ag8D0u?yVW-GsnhV&$oVFxD#GbEzx^aBM0Vg*eXgoeSv-|;UyZ^~c4=DtA<8|>g+u;pez6{sI9uly(%ju-k(`8)ArxpqWGgvj{Mw`8_05=n3?hJ0@8yuuVdQkQw?HJU2uO&8}w!Ctav)-;QxrbfE%b{(?WPm`;xeUzYcbdOwS^+~b3 zR@}I?nu`pf={?{UO;*C!`fZ5o)>fj2a3;nAfM0S<+OlX*ymsMq8N0R zM^;~l)0%boe~M2-x!d>duy{epFe9k$?=aw7)>sJdx1oG6 z`;Tb(=P=-So)J3h_n~|+``2kczYYVAGt+{=@Z_I>gAVX_a5w-@p9tHA2Me5b)K9XW z{&Lsx=U~7|4%1&R+8=V%;dVXg75|y;PVfT`i~C$cc}2&PWwsLyHhCOpJuol(2!FB==5Z$ z&GQXHM_H5QFu{Ui!?b$Yw6&hL!nFokYS*aYM?}}XCHH-+!Y%Qmghf#?@0p%=qm!xH zpAa0;_j~se_007d>DN*&{h;_^!gg~(;?~-t7d);bdfO@uJ%U7N9~o^Pa=vO?Bf4?^ z9sz5KB8_*kM;c7V^E94GQYO>`SNhMGEchD;kDP8Qt#>?8=&5u$1$M z*7x-%LMpjC$1_LYmGdUtr%``2N5IC`O%|9Kn$c%KBq2x{5K-^%c4$kMscEB0yn#g( zWFT=@Mjqv<1~78ZmB+7n=28WYl{#}r7{Vp4V4@->?hkT4k?HMB%~{HcWz%zucdjIa zlRUM=vOcrQU_{c_%4zFN-xtW@Ah<@&OpE`n@pI;@L!Pmt%qV-yVUHqq>fv(BNN*C9 z*aZADb_L5^KCf2?=W>xGWqt6YXZ?Au@F8%gU>SBlOMuSL*i9IeyXkNjVbgRs+LSoI z{`9uV@#a0k#@@5imxk^-)VznPwsN*NpH6YLW8Y9%spf4Gae&`J!pj4X zFqV&;OoD#0H;tDx-%Dc9HKRx|T9l0hlV7)M?0pbn)uoDuG16LcK$kTBA!(iWR*3QW z9oZ5i`sB3Ndw>E^&4%^rfzyL+Lf(tWb1VHCI$<_v@6{ObU`|)1kv=a#h3HUzVv@dLv38riID-ML8`o(LO_c4_e`1ud9Dd437Chd_FZJo63EFDyU?)XuF;8 z*~HcPe$>4@St}M0et8cLMvz7p<+k0&cbK(b6ocbFZGjq9r_W`Kgro2+iZS88QomBv z{N;J*K*!Y~sMfXhzR>5mUv|hYzhvl)n1Sw2_TFQvSax47yu941Tf8=IHt$;fdfy*M zrrFPGX_Ze`fr342TF7sE;LV+&&(U?@Y7@h zJVWb0r~AS1yhOn9-{u>DkJCni!0=po0BYd)iX!0YzhK)xK@lfe0)M&Z`Ew}ZB<0_) z7wr$B2)JEOI+gz-6mgQ~?UxPq$4~_P$@?9P{Sg!akGwl66%0kd8}3g~#7XjGxMBY# ziuea)!jFjJJF)QFC<2~%_;uc%~65$P)HKboC4uvRmEM zAYN@#LrX3YPQ?f1UcI)j)XK?q#tbmJecohyZau#G1w1}eg_JfsvwJx9k|uj=LzC}5 zF|n@Gj1(=y2L$Xb1^AT2mh(-v<7|}(E!#7IHbMMIEvMdYre2I9l59y3fo~hF^(4)d z5$$60!D2}X`$7)p%(?S9s?2AQ7JmJCgXBKe9rjtI9~rrG>}W z#Oqy}33~S2KhWIHz_2&;kl8k@S%#$Ji)D(GqNl!R+gwgv`_O zk>Ne=VphKM!$NdY750OEl8Y6NoeQyR()S`!D#8}hdY>1Jfz9X(*WT-CXNBe8rdN5V z1d)`vbCk-(R_ZVF#C_p2B1w*lcf+Tt=aci6Y>~wjnzhz>7H2+g zK|qs5CE`dyiY&x1uxXHNg_uw+xPFVQbThbb@hG;?Tssc22U<|NI_K24jvp}XDa3p2 z1OEC`K3*c5)outbyXUo|CBBReK}V7j`U+h_IYpd_g4OnSH%7){#;VHO-&!k9KDm~Q@r{=$DNMw;Zs}S= zJ7-Krt-)6}#Z7B8X6N2PS%s0W=NZ27T224L7xuhf3tD%kqYv!xx_9vKVyMlz(rytaSEW`Ag?0)C%=t6YC-sN%PkqW%cF0OsI+A5w&&3wXo*3A#8*zWEF2 z;ydT?KkFWS=P3RcMDb5_k50AhliXAALZ5((V^y^O3@*mi;Sql|`%$-gl#t8=LKz}k zvkQF(YcieQh`sT(WXHzSR;GP^cYm8aB*s|VIW8NqxBiYa_A|(O=RGNYOrdxBes;qL z1U409u8N3`Lw|6o`RJ`u7pXvB>J>Oo2Vg~Z22XDm4OC8 zh?>>zYu+mmA;3@7=(=PJ3KI~Gm>o;H$$d_~m-0w@!{OtSBZ?Gl6ds2PSsRaYAB~Rs zQ%&$Ewk18(Yf@%*_%3Zvhjv;dEv;FjMBf&6V;?!#Be>slC9CmRU2tQ|EZyji(iATB zu348PN=pzDLH^L;6(k^Z2@w(U(Gx->850ah9Y~ojrExy;W^7=iB~p?X2%w`S5b_F` zk(QA1`&jgPtl^3g1BzQ<5!WgRx~xdRLgc&_-WqqoHnuq^id=m{CwIgta;0E!#ADLi z=S(BGnljpu^br-_>!OPWZ~V|EmM9qm%5Pu>(w@ah%OX;y0bdng}M{nk+?Ee0c90M^9^Z`A~nq}aF8^F5K-1?or&46Lu&L?D_Wy-h|LA( zI;CtghT)pvJaUv0(WOAlRrNvLy^PRd=u*&mck#|!`h8oJkdjJDOi7<7g-tkbdagw| z)#Yubvwi5lXOdNjA+u5Geh3i5-vOLQ}9Hj+JXeK91+Hu*(Y9)nsAzRgPU_T}aZ z{*i^jghZThJZ*lNs+AHXJ^$ziX<3$MjiB1{_2=$Fq6JGvY2K7qRvP)~bTbepLmUYn zKf94VdZzrT$@Q#(_Ymi0?t%xMHKwsfsDZ1uE@g^3NMWCy+;>c-lM!$To&#NiD)(#W zniY!c7F<;CG^rl`Xf+*2Yh0$P7?bbS<-bu)eLsdjd#i1|UWlaz?e5>P!b##cbRLdx zS%bl+L=1n972pl|G!t>0Q12fH9{z-hIL-$L1T=kRAdW?rfbC-j0(`8)bb34ke$Mao zFMkdzoRX~hl`i>DVTDr?Iloe{KZF&2BE|LZLR9`36LCtX?^i7LN3a4smF3B^55o$_ zxg`IlkqCx2&65NFB@^+(c*c*o;pbx;|0l7+DdnyctZ*!k_MfrBz>QA(J~rHx=>&{o zJ?l11^=%7jNiC^!NP)c_TL@$~M>8)4C%?t+S-5k~#Hx+9G@4Ux6v~%UI+PzdTaKJj4C4t9K+@0bWJ?f^$!$`Q6q0XrG8W#Iz55zX zLRB$PAL}J8cd@=*FNN|=oBafx1aL4&lu%TaV!Rb{H%9N`jpo<#S?#3ElCAPGTnJ1$ zJI_PHTZ}$?>M5RMKy#H)R}^ABpzaFgd6hJE`%dlKC-R8MK0HcUcS@+YNm{D3NUl7+ z8E-q4#)8FUs*jC$8?9`0RhlokGn9uIG2_hpc~Vb$KdOpk;=wm>d$Y*&2A+)|-+74k z~c8M@yKYG|hM>+?;mgkCz(@ zs&Oi2AEDH!1rp&^h(Sxl^GC>Tv3=N77u9)ZN6YrqO}QJSK(9GF6#Q|>k|JT*w_E)7 zXBu>Lf+ma2Pcwnjw_bByRpuzlGz@jXcZ(T^^h{kwZ+UY5)%db<4;Jre7L&|yaiWKW z|ItL_K2wV9y%=$k^Se2VN2_>mthnyF#fb+ebIO=*qLsIDvai1}&~i3Z&0q)y8}=4( z=izOmsFI8KZaObb*n;LA-FJ^-F4;wzTzzU2&bH}nKH2i|d4>NnJ6C-|e6hw9CtCUq zP=vZ&Q=*yEeB7aiy|PmtD_nebN~grKH;&p=G`fDVTpr zTZX^<-01V0j#LJ_2|DlX++`NEw%zvB+m8-v(3&L13o~uBSu;^?7kTXIR;sK_wu{A! zj^n+2uj-2-YfXG;4@emI?tOH4Gh>^cTd;a+is-#UR=d@U<{|+7k{^ttJo)NWSvt;Q4%&{sa=A*e+6?$oqpvhhApJ=a_?=V=P~JJtaDq zs5zK*;W>|`43rTiz=4R(Cu=Yk2cwV#Yly@;)%Hq4Dydc`Ndu;$2J-DA9vl-T)V2-* zQ@qTE4x>wjGnX*imETxT4c3|Oc`qQ{>}F?~?poKY2$FkG`Y4uSU-m9-ddVT~xz_EIUK!5$JQLkzdh8W_$JDae)}0ik7SLkQ=vRxZb}lTJ)?`)++8lxf~E>K zb9B$-8#-36KY6m_SW(TQ?>~G`?+1Z`pKumMTlVJM>d{ys*CgY^@QsUO(SO$B+-&8p zHRD^zexn#Vh56uC%CxGXLi9}ch7B|(HaJ;Mwk9Za)IDE{J$#;N^u->+%_8SZ+U?$x zEOiJR-a^619hanOTtIsG6xlZP_BUkulyB`6&%PQ}h!qdzL4DnP-Flfd21O<9$dJ&d z5cS|_38LEJeRGa?y>+HeE%I!b5QDV-=wqA&Y9k@WsGDCn_0>O0@g;@(;1o?foeLx& zkSCPpw8@(@%wDok7DwyItgC&pl*#>oEZa5}nrvBI_yn~@?0oCo#q=xFY(a)9MGppw z7(L5Xo|#xH4>Mlclvt-zthX-)321@os{?IkN~_IzXekM5E3{g zk@GA4+8;s!rxba9sa$_*?BOTkU;hrH{1GH@B7+KN=V5#Tyy5<2>;c|1PoBhohXlTl zE1VvC_|7f-FC4-@Lj|WK!A?*CT#gHHHU6Wlz>RN%3{!6;Kmko^tIY0iIEDL&7Sq;5 zoX$%IF<*+hHz?G*zNQ#MHe`VhJk zK(5^#!$mNUrEYqyHMQ~1!rNlQ^OODpDsySS`E>mGr!AbXB{h}Qy=2yHT}>rq5sgX+ zNa%(#v*h1Tb4@Cfj&3aFlYU{>G^|Q%Uwme>UrKsytog9Uh;ypIyJk7Czdy&c8RTUw z^zMRC0J1P-ERR%FiRIlh%J7UUbs9I$9t2Yb(XzE)p!d=Rg-dXy5=#@3Gc9MpN zG%P;X77YqMt5~XVs;4)^UZ2c0@SgG7e&DDK>GNERU}kMi zE%_{-z6bKw=)KU&td2&B#n<#{ly#VU`n@swN`dL@W;?-q?QWV`eey3p zN!b=2r3R5bR*RjRLAaqwCq7^xg%>v08iIAlx!t)jhd6DUQ+3qN^2QvFw?@~C$AXW~ z_Mg?n=_MpFshJvfU(F!$U4JUWP{6+A@)+gAO*i5@E=lv?{F{+<(HlEqjPoDORxkF{ zh4L2@m_3qkjkj9+(88QUu3Stwvn*z{RF74;{H24QWr^&OMvPW{U3uM0VtWYJSn&&~ z=ukJ+=Vt2MR?j=4lRmbq$t78)q>dTsW@Y5_S0!g9cj)U9TK2MWg~tsWQs3%XEqvVd zS&a{hpG|gQL{2RrUgic0wZclhe>`;!V=uTfe@{xgFY&y526ZL2P1B}(pCdU*VAVok zRq__f<^HoY@%6l_0!S`8K0OUs^V3E^)V~} zAL}8(#E@aXc$zTyZ56#g2NQl??>f`%<(wqHKx&9PP_=#xOe*sK5r49Jc?8OFR2eIqG;Ju+ET%nnT4Ny&B z2XnB%S{pDAg9QQu034h^u4>qEDozHDZnnlCR#~XE1&CDyKqMg6uRmqz2(_^WB*{Un zYRb~b|1p?3I@$|ep+E}_d8XKBfL+zZ5SxoF%#T9^mEM|^YmW;st z|3RSqxOxA(+kd(`JRB?>02v11VqpVjg25^Q0cH#V66)L#-ruSVv%QU>9ShXj9;y$k zf{DGpp`*T~u>&ish?uIhf;_XdyqL7Ah^n-@IIFn20<*EcgR%Zk>v&4d8HViO@7|vv zJNVo6#2Eh$*?mWFr;*){ajHK|dIb*p7UcTdknfbr*a_r2mX`a^kZ(=>wfq>{`SI?6 zTO0Ng<}4Kib#c{aFA!bmSJINhibWt^ z2qBO>BW(F9&6C%N&s&@s!rnOvRjBnfcdZ~=)P20W{lQqOBDCSn9kRovnJ6D@u|{E% zH3=mopF7lZ#L%SHDxNVNqD`!OmhyI@MW}{)exSa-+l|lzr%LWU?s08O8hm7lfFhYY zN_k5ZkLRlG#m-*s(*}}fg!0P|Ua=Q>J9s2eI zE1{+|@_~dp6p<)&x{=6-UHp!Lt&YtR5^u8b(5KRlJ}nVFcB{_A{Dh%`d+i<);X}WE zJ@(-J1v5u5zM~O^RzV`s9Lh^tw1|wj1G*^`Gd%7_(bz|-g8|j7+aDA4=o0<;gjKvreD2Z>JYtlk?_+&{|pi3ZJq~o`uxUn zL@#KyQryd4<#95|*U~?^Om4@1z;0lWu+>3ueX9DxNWZ?VT5w99_6J2+NSyu|irH)9NN?@O#_Q_GiKqIhgpwbdMUOI4a7YP^Za9L-UmLo2R64IpOrrkThmFR@SvdFiYmMla6sv7ro_Fh>hJxYtG1!9XQ#uQ z=Q8U=OMy_|GXGj4#{IW!25acW4h>!DSBmhH+zm!suaZW$j2cgeA5aJ!koT>*9mZKl z;QJXBAK6qR>USW-{GF;f(Z557aB_SbwE2mQ;9oJ>v2x=ns^(bS@t;#QCmL_?&J33H z0{m5W4h+}Q0kGJyiWRViPm%@JKfz$|b57n>|EwQ^>1D8e>xcdv20JAQ^h-tiLsZQv z38G&q*dL;5exh~u?~u+P3;j4HQur$t`y*7%DT!2AhyGPp^>2eVrvyv?Pj~3Q+i!Eg zCFM?<@YjBu<5*wrKlj@M>N*OeZ0BPup4Dy;RzIfeH8{X)<+iCeYvq$GiLJ48N43&Q z&*q|C;y!xiwO(X#?uD1|8Brv)kYbPGHHWU6Ar^5Iuk(1aQv6?(`%}w%E)4U(iRwJm zld9LPhPVNwqq=f>2U`&CxL>80|OPG|*LTkoB9)t_QP$+xZb8DycWw#weG zh`7{UnjYQ?ecEfi6z%&Zrl^6XG@@;@b%I^LITIbb*XxxOo9;Xwy+(-Stgrw(&eP@$ zLgh#LaZua4#5cNy$k#mhG=|Qu0(w&h*Vza#?b6c{o96|p<@p*e54w=gLrhBR+2knR)U{cYcXEGC~GuaZ-#OW-*)sZ(Q8$Y0e$szrWs+sE| zTF4{Spcm6KC7kLm(|h-F8Xt5ble2^|WP)}5o>D4{`rO*U>aCXQ4#mtxN3*EGcIiwk$OJQtRtXVcttqO4lnQH4vEG z9yilF;K|JqcV3Dvuhtb*vFIS46qTeTVh;<>-u3SzYVUj8`qZN=o7+YGIzIiiaU7F0 z0q*&aVuCLiipY0|HXRSztYVpy%|4f0t0vP;l_OWXL^3O;olv~@B;A?TVx~oN4#SDH z%zyVC8s&pFS>sG-EYTS zncPfz+_BRbL`Oaj-{-C^>H`N0oRR#?LW?4_2bCO@i`}L{a0S3f2_Mc zuEuW_?ay@A$9Dalg8iB9`uINoR=NHVWpe!F{Z7gLM0d>rmsC9|70_KDH{8Gb-^We! zWQTR#KsGorGktpy8#=43{@2g! zUZbk#svi7 zZ~-(8Coo}(6L@`b0`q7%0rbfUjCFAUfze#R&>Z|c0Ghy3;laM=0!F8~fKqS)quZRo z1RXBebpRyI4Vac2h@j^NlxsL)*9AZr4=@`Tb}R?1JiztX*?@chm;b;pO)y~L0>1h; z%gK3=ujihuxnT7LBJv>s8w!Eh11JLoC^t7STMYv6YcP9o!paN;Sn~ie!rTBI&kNLv z2dE?5Zh*}oK-ppEa|7CPTmVzc4cHE52VTHV@HzqK!1i$f$n#|RUM)_TbpUk&PS^t6 z4K6?@31$&a0Df`;(0TM(oe~t&J1vg*;PJnmkf>|4wki`jD6MiRv zh(a#lj={cz0M7;dGwfPGa2N1O14;mt5Rfu}Sr29voo_uNToUo*5j{baa2-G3$vWO< z2OcT-41<#$!1az56Hj&k)jXDF10Fhb2S>vn8#LCznYN&4wlGArIGqwV*VW@8jQn4|F8aukNfJ7`ULCUZ*96-R-Ok;az zV{#*_hGOhyn;NFy6-OE-{_ zu?ae>ybbVc#z0yAPZaB~7ng9dw3OGkf?XbNslR=%Zw0k<`+9_pm93Mbu{}u6#>m*- z`mcxHFg~^!Y}m)i>aX8Q1H35IP{i8Q(ip_d&dCC}5b)YT9VDQx#zu-zM?*7^iN2+S zF?>IOuKr>M*gFSa4ptdaH8BwprmwdaeicQ1sI?>fb;ovmS=iC=ZQv%rj0oEX?wvi< z6{O9^!Uo4z0MT&rN#`#=CT?wLV+6G}1!lHzgY@m~_1(~6j52JVi#t0AYHeif3Nm&D zO3cb)ZQ}_10tm2-C&bETbs<9e=+hPZB7^~IyP2izn zwfSKaIMx1#O)e0t!w;L>AXdj8Hi2Jtf^VLFfM9hO6}547X9kovn8Cnnh@B0XZvecH zJWn5}2Iu0XuK|sg2Y5Si!A)oAWN&Y5?FfIAfxCkKb=w3A+(=_%S7Sr;kwF{7tA6J3 z6#=A2)7IrjXUhglmep zLd2uhU4_+u7_SxUJY(7em2>NcD>rqKUZu7);#egIFN{#m+CF1ie@nAH>0EoJSayjW zl1{u9f|5Hlc)00h;oUhkf{|cEGZ%-hlUgMkYplLF8S#2=RnjKIW+dws;mrrz1V`4}sBN{2Z*H!pX$+-K~A0>hiNCc=7H3Xkm z%E-M(oq5B^J42O-*(>ei87Fl^T5X3kFAd)?m()@~GK(0|xTI05&Pvd_A#k=t$p_z} zqz5bz!*2U5mQGpk^C8_w+Ax$Yo&EiZ-7lfUb?b)iR0u>xNH>^xl7yTYm{u4&*oe>c z1+`LX>YGI`IEn~KO<)LzwpeuuO?y25BnQ&q9k_FTFeiv+1dP7K_t`4`(G@u@rn1V` zsGH)h2)vrj*8J1y8_Uggp-Es}2{G*ny=v7VrdI_|>ocwq6a=E^v{p(;WYAWk+6>Q# z5>g2gkX^liD{^yI6=W7Z($MP~v1(T1fzP$~nLMA5JGuAZ>Rfl6TI;j5$K2#zXXboK zEy7t=RWG~qyhpB;DbRE4;VF31+IEpX-bmGhSt;HkKUXF3dFIsFKZ^;Hb@*|I$ zEs@HXCaLxjpkf9Y@9oQsEp)fq3qCmFMkwy5>#^8t3RTxNTH9OC7JYVi23ITG;<|d% z^r%f!MD))Fs6rRc!_PrZ^wCk@!J`ebi%+Buk6qsv0lha9B-R~ z^3M3yWa2r|2xt^u609RGZuGkDb*?A1#8+)+*>R4o#F1U>V~(8zv%xS9S7~Z*>*2=T zGk)F#18AHg4_YK&KPKN*5N97ls(MRZv@BFrCG3UXp_Gk}UB+d3}e?CXp6WmeRB0P@U!QmrGHd4I8ZBExd z1ubv9Ucp1VPEhaAbCw9zpPa9`lAnF*qv{T45^+AfW1_P?>$tt7WoL@~L^n}9PaNg!isuJGEbzytaL8ZQTwtT2W*)}-SlC+kq_wl za$IK?YcLRZlbFt--`QfNTp$13@)UXl_g(eb5~F}e5f9BX-Q^u#EtZ>miW4ehn`(&? z<$2GZyKgFNo2`%V<=HEel8d1(!E!evZ(tBDPau^ZhT0a&u#bjrvrd%1*LKNKr<~z; z5qhf0%(m*FNN86aE z#^~b@*vv3dR#tAau@k*RTw!b6l(>e_x9cOLqfS?=2tE=cG+9AF^>HUO2^1#B* zHA*#yrfW|_b`jEI?ojM+y)|kO@8}b63t|B>-;!qp;t`@1TJg^ zd)?lzmhB`B8wyxHU|7GZQc554z)&ffE>-zzGfmSh6B#;JJ=rBNUTPpN%6(Eo&-`U1 zx%Q277&1cXdap=w0M^B3%QDR$kAW%rRTRJ1PX zY5CTi>G!g_Xq~eDKs=Z3)imU$U&wO}dwYcEizBE{cyxoDeh?1 zInEbBulTQHPrp$V5LD@_QYSKgrw)XWov!fz6seY6hwDBqt+YRF#`F4?u z$eU-6K5-C-%~hv4ToucSzj9O{{rP^&Yh1p3t2A@lMjh0Z&~fGj_1f3(rWxzm=~F)& zm?pimJh%_04F5FY#E0LlBD^6$-gTX*;|WLmAcvtTy29#`h`?rYxc0@?P48QVn4a0e z;}5k8OI5?fw`XT?Gv*huGe79fF}KvFJp=;3)5Yh?BR&b)^SI2c?%c(inp9}od61T? z6cVynCAP`Ocpc*^vM&M7+CWg%&b!FVX>5@(OxL|-$j*cknXCC4b&l{kztEPsk?t0% z$cQB_$9xY%QT@8(;Uu4b6t!e1ml974`okW3*7ufWikVH>Sr$7`vJefcl!xw#@8bO9 zq%iHcvxZBN9}w@VYwq9iQ|x5&&@GO1ET5S$o)ILlQQA~L!ZrHf$Ks^@UQdu2=f(aR zf4wKzo!OF+0p%dnNrI+&CqGQ}`a^MPs?Sk&Rx{e{)@m_s%GmFn!|EoQgn77JYNv2t zO_8u^#_r;149>j2hN^RMSmL9+{qQCNclS;)dd74YH+G5Lv;q$^J_b$C)uw2Fqs4+Z z+7lmKSEbG{_Nul?`Au);?IOLl*x|dUzr0tYx%1k%kTeK14|&wrc44G?D<>G+q!aX@ zPMj;)F{VQJgo^)G9*eCMYEaAQj^R)tMRS7l^kBU&9t>~ zmbGUzt|~?o5>l1|QO7Vz9mKq~ARHvMCm5>Mq*2Mv86h#C{g{`_xXQ&d`Ro{K^_Ca~ zMwp-pkfDv%`!3?b!@2sgPg0Bq49m|lW+PrMEMXB*-hZ^=e`~3UH=MIR=pgC&uI;V- z^RcXFO}|{~Va>~~mbu?KvPfqlRn&C@e0|=F7H!bi)-aW~&1SZ!0B1~REbZWX#Z`a@y-f!^HMcvf*9lDQXtGRVb`>kgex_egYyQ zFQX>f`E1%sZ<)rAFm*yjiflHxs5hH@rf{LSMA5LeADf5QB&Xb_bv)rQbs^d^&$*$c z5|xJLtJ3G{=ZR_A)^5^w-(GyKXp(oeT04p04d%w#=D~MrlEz7dEp#P|FWzEKzDoY6 z9B^hJ4O;blcfQXx!%-@lOTA05|H=S!ESKZMNHw32LEC=yC^u!a8G;pfQ_f1O=?kbw z5OQEMl~}Y$q_~fRzqIzQg^s^Ozj)J@#zX7edGpl{SI@Acmbc56cuAOhzDCzI7(+jM za2crC8ccLFt0UJUukErauY>$=5uM9BKM~U!e~v2r;GAoyyrfl-@H$43wUY4r5)e1K z)xFY$vukeVsryedjka&OYUg&#nr439@3f?hw%iGq+M(aop!REZ*8iPCH?1i)a0mrB~;Qn)pL6Xo7Fdz&r=AGO5nCesX1&r1Q13*^aSxbNBTdkJ@uV{1e_oo~9u-C19?3+$r zEE(Ip+IP822BReKiNRspcn0|f(Iy(W{88~>%z63HYqo+HL;>pHxBj62*4e|1<98ke#&E#)^6-3%xIAV#U^{_; z%pVSgO^k%?<>L4@d-Ir#gY7)+5P!e^kF&-^91H;`4#vNsvx@24N*(*^09}O63M2Ah z-!TK3<&GU?xSRcr?E8!74p51X##ZVe2pFAJt8v_K-@gRtxAn2|B`Xwc)%OjJbpWd>S{P>jh&wxq-k9 zZXg05zVC-M7jPv`!2gFW5P;=_EiiW+HqC_-VD|pHz^(&lKw+%k*XzKJ0cP$1tl#l( z!p{e;0oxBN$H^M@+pzCoj45n^??2fG3`)VigYEmL%gOJ+*05{CI7HY2uOqC!z;D3I z2n;lF1MDU@@Efp*L0BC)fNf5InS}rv>oA^?2e<}oKm1%66AH5(j130vIP4m5`vKqc z0(8sCXD)!PJt^~#>yyv0b78hRS)bSxwhcQ5z70?su+K0%!H)y#4_^cOkL~o8VTN4` z*as^MYz<#vOf+yjFTkVzXtN)9%^!oMPk2qBX7E_(Z@lKQBK!%B3GkZ7((orcV8%LT zKK~Q1sSFf^o#m&bCOb&P381b3o`;){gNF~y`TsMi$@W(=@c$a62^i_Gzb)}67|pM& z<1dhzY7!#AAArn+-Ov9G;$mhjl95!0`QjmpLs?$ zHV6=j1*`Wj@QjxcMNOYY$Umv?tHJOcjzqM~ZkMsUJW-~xm;ZnOd;ZKkrON@SLrArU zQm4fFUAu^cfunh6z4-^XpOb2Qd?4pGXG^{7yMj|y(Z99Ig{aUw@j5p~GxKHgM$1Z? zBEvP+g>z$62o2iK~e!R1IJx(W1>*TyM4XP15qoP zMnBk8JK^tTpgxK|x^+(XQ5yP%lC?7f$jOF#%18_JW!)KfJ zx1g+qcal!JUf!P&Yf7+_l29#1=hwRZNCb;pwiy)G_zi{qU&v1#m?K%o#SN%ANs%JB zf9B6relKJPzZ98Milb1(F`GRCqUViwqGty4hFT%IPi?2(2kZgkSOE zjxpE%AkPw;5WCx^AWdMeUMq2(CctliK8i*Px;&jdT(~vO^DM@`Hy7P9H-#pq1JubQ z;=m?Bs153>h0xH~5r~GbnG3Q``ZbPbmK18pFHJrrV(6>f^!L-(XngpfN!s!`l=%%3 zG1Q%--GM(z7v{scI2~0el3ztIc94ks1 z?nF+Pe)0ql+Q{|Ly!n82*@Zh-Z})ONr2`)x5)Zi3Y~LU#E8azHo7QIfk~A$!rspN{ z;Mz2f$hPhp4(JdXzZzK?tHRzuv}r`rqpH3g5iLXHoBA!wY6-^PzLdf*Ku8tkTiKmt z6y!y-U2GjC@3CrAi&gJGdLlT8-f0lbfhvT)Cv&Ev-hChcCIrbm{=FwpK(dK-i&4!A z*5>mCEx(m5$Ng=e-U-f8FC!KZL!`^gt6I}*%|_L-qWXpQT~Eh%m6x^YKj`VV-FhRM z|HaYwV9{~}jGPG3&ayuvtEhRjV1*t&x1Jr6FO?wLan>OK&S*|h>A2uky|PN zm3?ZP)1Y*V=Aqd{@TF==?`?*$on(|cH-5&4ofy?`4IGvumG*|-V>}=Da8PR*!=Msn z2_jBzz&x_$+rSu1%K9CwC zNUN`MwC3ja@51EnAGh;2A0a`~DXinWN8P4;)`?=770Fog_H;&vD)mj`HB&-v4$qhS z6vmKeZ23Agl())LWHEiG4i7G$t5TgRl(X`DzktW2kXSYS+CE^9SUp>Tr-vRYFRqh= zE1vhD1V!<3f+FbkOBUsJ;~my8F_W>aysN{uZ*+ziwIC`n1*SVW>?>i2U3xO^zGoDl z+%q}{I+&chlgh#B;MC(XM$@&fP^{HG-+YutG^Ur1GqG~wOdEDA%%y_4#JoV<(~k=n zaKB&+JoE$>GV%|Xlk*_J93|K}Cu>+R4-j$*)E`)Yk$oPZOc0=q+^~JX@4#%q30Rg3 zC<`nQi5svBFQCi^0qO>~87w#la7!ToScSQ*T!2~vHxR}GvjH#g)WNRD1#?S*fE*4W z$mV1@sS_t~eJ&t8g%h|3oIoSu0_x8RbGczQ1%j4f_T&J{!U?k<@EsVKpTPsz8WzL@ zbBj5Fz#iDW-~`IY353;|_pASVHV1t0;(!a{U7fqMYsk~m;tIlz5{*#Ksf?=I-6 zdkD)c-{}@^WuuwceTn!%=*Zq;BWCn9Kv?YsU*BNqO>W_{kG<$3- zD&rEApK zOK&&iYboa<6>3vV`7bnH;6F?8RAk2zZ{fYmz>o(9-gJQ)E_tqVM?pR``u!VWn=0>3 z?1Get=NOl_Rz2wXGg$Gm8bob&M9S0mS>??PZ$^*$-hilk7yH@0u2*y&>z~D@OW&F+ zmT2Vc*1Sx%xS2wlR+bgRr4E^Oyy#UZ7e7F+$Y)Fq5B_gLoSSE1@cOLJru-%hX@o%Nj;J zISyS)YdS9Lm0sDsbMqkL<@59Po9LzjpEbOrXFZlR!Q;ei>X-^x@v82fcXX`$uc?*t z$vOC>v#K+DsG(5e^v2ZW5pnw91dAGHo6fa)#(ud#$G#p5I)$OpAasimKAhTGBUq3${;m*%Ficn$e6 zhnLhMwzv&Z3d&a|?pH8;=o3_E@MTYQFu-dQlxi30P5DS8GSnG33?;f+?WRSkS-uh} z{X`O!j`sO1c+RHVl!mH&&ikgyv@%bwkV^0S9978=BJ^t;xG`g&(6g@6h3kL7L+co$ z8{w@d4MAEPWu?I-gv;t!5f>{{7~Ts_qNKhb+@Q zm3ot&V>W_UUX2<*^ts|@rfqs39TW@Jy4_%%fS{dWWB(`|m;W#vdW~|LQhmkQr|t6E z#O{Z8+_zX>4qWbxYmX+%L`dkCA(&xABXdS!S}I#x=C+i`wHSYU9#7#hHEL>43(dZC zSQUYJ%MA1mI_R#qc;~GXHpREWrk((A4T7* zKF^INc#En+Cy>E1sBCM!GWBI)IH|ydCm)Zn$3g#1tESN{%l4$P^>Q2j?kG7d69mnA zgf%ZQ`TO1os3e$?loV?vcQilcXpxi?IZ7>s@*9UGrHc<&jgNg9jl+J)-@G!_Pc;<4 zZ^IQ!-&=@7V5EmGcE-qg;sIfXUA6mp%7&f9gmN>_tQ;f?9*Nwkv$ouKbU_;z{H&_W zS|Tn|1Ue)I*3djr@0nFdoLhCX6m5UdNyE`&y{h?Q>k*!@MDB<|gGW2#s8e^e>B~vMYbwQhdH}bY=*DM!-#~7nP=tgM9NZU1YWxZmiU^j{cg^w@9 zUM*k6-3bz!S6E&+Ga3z{E|fL+3S}9>&Yg-4_kk3y8GE9mPrDc* zU{!5d<#k4-ciAOKK5|mIBE1Z>?h9RB_GgjAP%i~5oMlma5EJe&WSNkbG}t=yx9mf-pQ8SsF2cbu)}6U75e<` z;+=bP{np0di!7^|V`P*Gl)BFpj|Q0i)Sb%_daze!E=s@Le1)_5y0HLv>N8TR8RM%< zcrVB9XfP{;9DOdSn8e8p0d&@*Q~* zly5_(Hc)COF#l=C&3?4gKtn@|6J`^a*8ibr16iXmRd>8;s(DkgbzE! z^sYP*Ovtg|KUX%u0oe;6!voWFlQznj;^-N)WPK5fqT#<$G;|^Jqtgm0)~kjW{06Gr z@)Xn}Lx*o&M4iW(rykp_+kX5|;B);&+vP|0XMLcR6Qunw%5Yrjaw(o%J+E8Ae;CsM zx*Jhh+*hO4W^hQdCC9+v%GIhn^tpZiRU!`buY9j)c9Frj^VnaboPe^X16 z9rtjh>KAM1;dM2e`{v!~Nt=8(yBFUw(O<{ z))U9GSBCG$qRmqm#Y}l)icyo;lsF-;tDvV>$WIf!e)cS zL_|Ok9qWi*%oW`2av^+t6HX}fyhX1Tks6EZoCDYdFNeFS>2Ymjw9_>Xdp7+91a`i- z?gicb770Au8+0~TmOfncZ+?$3Frhs3X)#%$NQtKlzu?0bR}Bx=UDs=V$yRhY^)rip zNGXTxwBh~+SnqM0=%U`4tErS5xC`v2?Gr;ID12YVWQPf1EVmE>X47OOFCMr>)Vi!wnSg`jJgFQiwEt>y3 z_fEU_7~^~EUoZdqS6GgBX5Z7#KIiOq_8xq?=JK`=ns+pRcK(WgSc}75bDtOATid_D zEC15hnz0^ixewdsoL=dhy1a1xZkaA{W_IJ)(Peu^AADAM>^J)>CTcJBOFq$ZY{}zK z;+h2~J`HB;?0^2aT-ii(J+`pisVbG+`ZSWw&WzV*)L1!n@AA4Y<}?^v@Z7XvWlCxB z`VAw!uQinB)tck8L_2JI`O>9X=L`Ey+}mJAOylDbO&hl^?T1&hc9uLlGw|2t zw|{6cY-^pK)vt8(N=iXJk9WgP z2ABC{+*r}ZW73UM-yNOrgc$n;&K+NS#L3TMPp|2?a^T3P_0R3-csRWN>EBc4^1D;kWjA!jm{gFY}=Z%==^!@-aMa94+rfD{_@VnQ_q(*J{T7f^Q>J@`MC3U+N4Hh zJ%M#Ge?hFaG~J(psEYz7k;>q zeY{uQp!56_ucp@QdSrL6sfqiecX z2#)id<^zlB8EZV}@L$&^#% zYcq*}Q#pwP=m@O~8K%?3i4!>yd8VsG*&Zp@gAoWOoJHBh(Eo-=SzzL17q_~Klp#T} z3zZd+KmWN6RC1IGYke!MkYxhR<^|ic9G{o{wH>|XTO956D@sQoDR2eVs*q7 zi^Os1h-I{<6iqBK-(uqQOq_xDK!v+xOoG)IuQ6K_4H|0-6KXMNED4N(f0*JSG3!!wOrqXswZKc3vl>5UK&-}$Qb+I){(saBS63E2X$1K)l!=SOKeQtb zSL&pW>@o=xZ`PpTWUDDfXF;_F9b-w-#OfH_p)zO^`4`$417ox%#*oW!@kSJCFlfw7 zlFrO^Pm_pm7L8HMC+6ia{5b!hhp|xXX&mdX`~KlEG?WVoiyO8YUq;fKL4?`KldOiW6GS*K&-OjbDY(xa&s{cy&D!7wtMr5t0_8+9nlfHAP>67~Ey z(rHGQY}FXhL0l}L0?{pYW^eF~k`KH>S_Ws4{^|5+$tTmCb;wGBe5^FNs z2A9jHVParar)AI|CZ0)P^vqBop@Bm~6O+Uw+pX=GR3?oX&ZILVxO#QATFv|~m)cVF z2CWXx;FOLzWihGF>5Rb*VPKyLDCL+-4yH30^hp-Ih0$u_<1sw^gUmGFfjEP1IGL4{ z1e2AU+z1}E;;niEhbUZ=!h(EQKh{~dpVCna_nvDA3gufIgDZ`?6b4!?g7dmW?!ond zNil1*xV>o}##lu4@L5ghq}-*Gay8RmtH;Vi7hp`~vQ`wV4R^JsG$X@dC_y^|kelHx zSz^O2l1JMTrvkaa)t0|LijWxE@?s>X@XJ` zn4WxfVSMs1K6#i+@-SNhN3KMxAw{2LNN2+MH5tigjpVaNx@3)Xd2AKzr+&9Af(&Du8v1u6M^*gI#v6L$f?tWs#B(qK2c|B*TrPex~NH^r4*m4|9;5< zI2F)+*J6p{7R1W`h8;2&LLE2Xol0P+0lB`Bmb%&@b3u0nN??2Vb7ucD~EhnL4m0zcD%%C zq>ECQl*hfdwTHa3D^0mFZ0U&-o4g~ixBb}bAx};LjIuy;@_j@*IlE%gMxqRdqE~_F ztV&`#jdwCm@lD!G?6fgnxY^H*5%QC?+&B>hE~iMgy+b}|4)GFS$cJds?TvPQ+P{;` zWU%Z{sclfnZ<2=mCK_w=Qw>&#r^!)B?ln zf)hLKT3{|}t*e6tc%R^~j88zczyh@}w7|A#(|>J*+8={=cdDb+tPtP8MLuPbeLSdKZpKc+%s|8eTu5;e}xbe1^YK!AmTYc^?)3 z&n%NaeRS)1=ji&mClv#YM^2tjIF)Ef&`h2Z+}5wjlqJ)0Hf{d>`M0@Dr=zlh_h-yC zmVBK1l|~V?vH7f%2d;XLT)!a0_wx%S;}0$jO_TcO-(0@Ha>1)-|D8UI&lTo8@%^x@ z??vN=o_9A#jdfdfR<>be>5_%VhPCQ-IwZ_eCGqh`7vc(^W^b5qIXi$IHCR*aY~|^5 zL+Y5CU%VoDlAm^Q-aDU8uATc`?!0=LMOVWQ|Nddzy;*nGAF9&kU+z<`#&laG8*oB; zZe{rK3R%llp|U^Bx0iTFPf9h$4h|~Xk??IsX}o%Rg|TZ#Zu+G4A5}*6|6`u!Sk}tm z>t{x?pEsVB^-W^a3DN#@r;n(=C@Lv@_rCXf21FJr%OX$ZE01KC^@)E{bJ5o|#}6O; zXhy>9+(YSQPrvJT@=4C7J;j6W4V>F=Q}(Ew?8C*Dlcxqh8SuO?&eFNT=4;yiW}p3e z$1LgZr*{9U{L$g-@6>4RIc381Q?=ahFTS|W>${12GKwGcNWSr|hhJ8s3-W{&p+7cH zUOuV3cdho`eo5gkm)(6bqf`9xx{a!h?ACoo#Fxh0i8lx7rJE-#SA2PUt=m_Vo_Vh?ulif`}ysW;fRdL6w^#Tpa{nvK# z+A?hVxtW{GGEY>vW|}zYnrcFi+OJAOyRA`{Ca)SWery26d z2daORS0^O8O5nK-F)IdE4ydy_bMOyE=gueXKXz1=^!+qVXG5!o_m}QERjJ<1y3Fc! zX}#)xG3s)=d#RHi9W8mhyg+sMV0hrmYhEKuWmDJge4JYrS-$c!x2ug7f>(RevhV!( zfqPd?9+BMp=}#{o)*TzXe9W)v)9p1AYrPu&>gOR5k22Rq^c`RJ{le0;j;qHl>a|`u zmaVX)RYd4~?dA!2yG{%!u5t6mu=SOP{M6#zvoCgD7`kHivGVWcMRvKcZ2g|&;fdzK z52nRzd)E8>?g`DW1s$s%eiW)>Z6*Jz)!@F-QZC?Z2!5?J~ab(@5#w5Y~FXn(Y9_wCrf`h^!QBDtmt%) zBF)M`zk+{F&NL19X61m|9d1uDM6dsGnjy>mpeeSn=*UlyZ%;l zJv({etq#}o&KHKh^PT(g7x`iAt$X@Y`hXtIf2mycg!{$qQPWHhON{ZJs$F~E3&_kZ z`)SC!(Y4FwSI^UBZMj=(--r1_CEgj0n>}e=5~NjJ?web%WZtXM6E2<``6SJ-&a={y z^*??dpODwQ^Q*JP(G4tXB{!!iSIOK7Ug44-e1mmRx+f<(SCa zHkCJS$!y|&Z%C#|vpJUi;_%(2i?6lKsPi=pyhYVkK3K_K z{>*F8@Y!8&FPZ$0xceV*_g{; zE;IL^J(Uw;FVhKeBy@rlu$d+wC&ZD61pniHaE>A298v{4bn+o1Ky0DOhrA;dDRF(4 z``CI(%2a|wSHMnP4lRq4*s((j#9cjxt-A`cCONV5Cg};=56+vF5~Fe4iBJ-ck@%>< zW~+$&fZQi0i6N&ThVC5CKn&iAJb@UP6VH|6kF8^z_evrPuzl>KV)xAG>RpmFn!G14 z&Qm5Pn>>lnMtk}8akiI7o?K@|)9VxiAb}H4?P35<)aEJ%;O;Xx01yLkA?qCgA_m|E z1%D+5i0IGxS$u;WfH-VawwFr&elLrEpB#XU(tpno9AYT$O7VYiFZq)|n>c`**Z+$b zli~c3X!v+-rQO#eaE##MziRuz?U3Ecedp$mzvdu-&pv8CdVjUAwWVDK zEZO$t(y6L-+Vq~)rkS_$>UDX z8uLi=+YOI_ajD0Swe5A&e`iVQwX_D>-)n_U*&aRoZlj6KCbayuC}P?0$C(-LeRldl zlDp^eiFc+hdOR|$ipTawUG`i&x_jKdYs~a9-L^FfZMgrsEa8Rs{NBK*02-)D0TP#CgbTc&9K}bW;Y7FJ0f{`;m1!RJ*STH?NKnd|AVE4yQ`im ztjE^vRB|?8`m?+$Jr7mNlzw8}@LTrAglTse&!6u39XfTi+tTY}63f-D^L}cB6%(_5 zuj%{sFWNP32a8(QZTab>TSvEf`#jv?yT&@d^3^}8jIFz6%i&d7MVG9dM{GS`Zp#kI z52sbTl4RNqMQua6r=`~{H`P<~;|jOLlCO%ZZA%T_mD%#N+roX9+-t=3>Am*Ks}|tKdrQop;*KYxK0-!8^J=x7_qs#>MSA*eHAT>MjY_vUC-1A70dA z?{7X&cif5kW#piT6$eFsQ#I#^|ETGA>i3U1zBuJ@#H^cT55{Lr0EYF{^ajvub?=_`N7?b6o#5a0W^&J8NaZF}}^O5=;+bxQ{|{4(hCf4x7@ zD`H(t){bDScg^gg^nHDOR?U;iJ}S5LZ0b0_!IBOkYgbiV+M~(OwbLS`h4Ysj+PZM_ zp-ru-)o^RLJNm1F_abgH4Q{H`(iJ(Iq}h^v)h>9HrRrEgKHYD z3hj4)`k74~$1Tk4UU90s_tYP||HG{P!>s)^v&PXpgiw}BCC)3X_KTbzP{KG_ESt|H z50%`>)^P+7$uHp5Y+L|BD!HDNj*>Wf-Oh&Cm^H|o|J3^u-Vl8sf7R8_1h{f)E_O+( zH`yhL&#*sX)*MHt?YML~A_c4)M@0(w4w}Cr0WB=(naN6AOnETj#4INT>NcAqvxi;_ zyCuT%^~U8z?!osE$~5j5tULH8Za5;5t8SQmO-${#tB=JMPEsR_tDW4_7B!URA{q6D ze;mFkh;1mYln+U2pFN&GeY;AfoW>c2^V&2YsjZ_V3?^xWJz%pfyq{}NiDJ-6u)n5K z>7R|PJ+zQ5W`S#={2aWYCsH6DKR^5}Pz)ExlcERwu<^|j%!y3yDv2N{i|K6@Xo_tY zkpfeY)^Kr7`r0Z4j>3FdxKQVKSKDvgg9N+dd@sXqQXJAJ0gt%!d<$&9K`*mhv@S;q z6e+dEH?gHbp;C}+E~TJYDR)QOk;@Md8}`|9$pPWn9edphK)^Y=lmq`kQm}X~5EUS} zjq3tY1H$pA_PWpK zT`U*p-ChTp#X>`m6!5+ls!!CzJ-uL>_>$GFg$P5+v?GiSGr0K{p@1uQ2`dGZP1NhC z%vDCgt!H~-JW2;>;0fLoPjDH#hI5nP(TLoACS~A~Ctedr^SHqY!4e-ul*AY%b`n0V zNQh7$AEvKfm!>m^n{^KJNRlKN7Ak#ACIhUld{WF-WG0YLbVjQX(hrW@O=*!KwnSa^ zDLlmXJAku^as{DI4<;;0XY}VooN^c^=r4iT`|EEdHZP>DFiwFv7xxWuQ-_ies|3nL zBOob4HGOnZK56=t1Rq!`>fmra&IhJKK1td*1liE(;A@`=H=DH9Sa{!W1t^lUGG8sg zJ#^`5u+OrP0SLWo25taE*iD(<%^5xdc3qL@H6s5b&Y3OP7YD zE%1FWLu3RewFU8t90(rg!^30>7E%-LwU5ybQ<5w3Vwi$B-Y0)9>ByCRAxt76#tmW^ zpdy$|Eg@SA`E!)#=O=?DhY$ui32`1FNC*G+5dDZ@YO)E6(vdhELKw2bctZ%o_z`3m z`geaS@ETRuIB~$K*T}q=Tada`ua0+(9RVNr((mm`HH)l9*r0# zCm}h>pA%0d#9f6LrXmNOFdY}GK>%Y}gn|*}#o{I24+ZJa65@`6f@7*(8(7&eJvYDi5*Fu3@n>W~q`C}BFens{BLU=RZfVQ`>9?L)w3LR^wR z=h#EAD$WaMC*yLy$8HMqGf1(-F5HVwe)rV-XDAU&Vd%gC`Ynd5FD( z9tiWoc?i`HKRDfdO*$G+l`2^7iON&U=<={NQSHO_LXC?=Lah(EL`ujY^5+QIunRib*KVWHZmQcyT4S1AdjA!v)Ans|p5!<5wefUX45sD$Z&YvMgo0$h6y z{we5rlc;F?VrHO>kZaXlp} z59bV3hnl7>;Jus3EQD=Q%VEtdg5gLJ;|BDXbemZjwFVV1>K5Y*ju~p+lq`M5DIgqj?B8P@~Ri zD3GahPzkPIJa0-w-W21wQYNLwMG1Rr@%m7L`=#?L#AhC8WfIR&)DI9z6igwZ)(2#e z)cLCf-9(Ka_5-Rda!$M@96z~?I)9bm4#oSp5+2kjyut#e+N@%!GZago?wgW}bt!BM z?w(S0VB*B*5l$ZJOaX?|ZBZ&HdK`LqYW*UTrI?3hB?@9%AeJ+pOkfoT9ukie`X|Wg4H=-zUKNpripryTU8p{(b6O<@TO!H}$9ojsBcdgR zlSoIcX*k`Z&OsIHN1e6Ug@`vxL7QQ}LGcg-g+%?ujzgb~DnC>#E)VrhbpF3^Bn9v1djMxUW7c=iOqsIyiDkB)R5;E=>^Q4;ry zqA>-%ON}!YKb==i?UO37M^s*wlsX3?9-{V6wFH!+xGi8!>GFt0lBmsUxfsVK5LMA@ zOO25cG6LLHOO%xC2I(l-2)0CuK2_sP z7SD$oYyeeSu!E%DxobQE2uhVYPTAH-MU zeFO15C>}?RbxG$XE=5IcA;cL4lT!N&*e&X81SLarFdr+M=dp` zQU#=6;hV8hFfe-n literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/Makefile.am b/trunk/paradiseo-eo/doc/Makefile.am new file mode 100644 index 000000000..1d82cf01c --- /dev/null +++ b/trunk/paradiseo-eo/doc/Makefile.am @@ -0,0 +1,10 @@ +## Makefile.am for eo/doc + + +EXTRA_DIST = eo.cfg foot.html + +doc: + cd $(srcdir) && $(DOXYGEN) eo.cfg + +clean-local: + cd $(srcdir) && rm -rf html latex man diff --git a/trunk/paradiseo-eo/doc/eo.cfg b/trunk/paradiseo-eo/doc/eo.cfg new file mode 100644 index 000000000..5fbd7166e --- /dev/null +++ b/trunk/paradiseo-eo/doc/eo.cfg @@ -0,0 +1,1119 @@ +# Doxyfile 1.3.6 + +# This file describes the settings to be used by the documentation system +# doxygen (www.doxygen.org) for a project +# +# All text after a hash (#) is considered a comment and will be ignored +# The format is: +# TAG = value [value, ...] +# For lists items can also be appended using: +# TAG += value [value, ...] +# Values that contain spaces should be placed between quotes (" ") + +#--------------------------------------------------------------------------- +# Project related configuration options +#--------------------------------------------------------------------------- + +# The PROJECT_NAME tag is a single word (or a sequence of words surrounded +# by quotes) that should identify the project. + +PROJECT_NAME = EO + +# The PROJECT_NUMBER tag can be used to enter a project or revision number. +# This could be handy for archiving the generated documentation or +# if some version control system is used. + +PROJECT_NUMBER = 0.9.4-cvs + +# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) +# base path where the generated documentation will be put. +# If a relative path is entered, it will be relative to the location +# where doxygen was started. If left blank the current directory will be used. + +OUTPUT_DIRECTORY = + +# The OUTPUT_LANGUAGE tag is used to specify the language in which all +# documentation generated by doxygen is written. Doxygen will use this +# information to generate all constant output in the proper language. +# The default language is English, other supported languages are: +# Brazilian, Catalan, Chinese, Chinese-Traditional, Croatian, Czech, Danish, Dutch, +# Finnish, French, German, Greek, Hungarian, Italian, Japanese, Japanese-en +# (Japanese with English messages), Korean, Korean-en, Norwegian, Polish, Portuguese, +# Romanian, Russian, Serbian, Slovak, Slovene, Spanish, Swedish, and Ukrainian. + +OUTPUT_LANGUAGE = English + +# This tag can be used to specify the encoding used in the generated output. +# The encoding is not always determined by the language that is chosen, +# but also whether or not the output is meant for Windows or non-Windows users. +# In case there is a difference, setting the USE_WINDOWS_ENCODING tag to YES +# forces the Windows encoding (this is the default for the Windows binary), +# whereas setting the tag to NO uses a Unix-style encoding (the default for +# all platforms other than Windows). + +USE_WINDOWS_ENCODING = NO + +# If the BRIEF_MEMBER_DESC tag is set to YES (the default) Doxygen will +# include brief member descriptions after the members that are listed in +# the file and class documentation (similar to JavaDoc). +# Set to NO to disable this. + +BRIEF_MEMBER_DESC = YES + +# If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend +# the brief description of a member or function before the detailed description. +# Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the +# brief descriptions will be completely suppressed. + +REPEAT_BRIEF = YES + +# This tag implements a quasi-intelligent brief description abbreviator +# that is used to form the text in various listings. Each string +# in this list, if found as the leading text of the brief description, will be +# stripped from the text and the result after processing the whole list, is used +# as the annotated text. Otherwise, the brief description is used as-is. If left +# blank, the following values are used ("$name" is automatically replaced with the +# name of the entity): "The $name class" "The $name widget" "The $name file" +# "is" "provides" "specifies" "contains" "represents" "a" "an" "the" + +ABBREVIATE_BRIEF = + +# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then +# Doxygen will generate a detailed section even if there is only a brief +# description. + +ALWAYS_DETAILED_SEC = NO + +# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all inherited +# members of a class in the documentation of that class as if those members were +# ordinary class members. Constructors, destructors and assignment operators of +# the base classes will not be shown. + +INLINE_INHERITED_MEMB = NO + +# If the FULL_PATH_NAMES tag is set to YES then Doxygen will prepend the full +# path before files name in the file list and in the header files. If set +# to NO the shortest path that makes the file name unique will be used. + +FULL_PATH_NAMES = NO + +# If the FULL_PATH_NAMES tag is set to YES then the STRIP_FROM_PATH tag +# can be used to strip a user-defined part of the path. Stripping is +# only done if one of the specified strings matches the left-hand part of +# the path. It is allowed to use relative paths in the argument list. +# If left blank the directory from which doxygen is run is used as the +# path to strip. + +STRIP_FROM_PATH = + +# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter +# (but less readable) file names. This can be useful is your file systems +# doesn't support long names like on DOS, Mac, or CD-ROM. + +SHORT_NAMES = NO + +# If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen +# will interpret the first line (until the first dot) of a JavaDoc-style +# comment as the brief description. If set to NO, the JavaDoc +# comments will behave just like the Qt-style comments (thus requiring an +# explicit @brief command for a brief description. + +JAVADOC_AUTOBRIEF = YES + +# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make Doxygen +# treat a multi-line C++ special comment block (i.e. a block of //! or /// +# comments) as a brief description. This used to be the default behaviour. +# The new default is to treat a multi-line C++ comment block as a detailed +# description. Set this tag to YES if you prefer the old behaviour instead. + +MULTILINE_CPP_IS_BRIEF = NO + +# If the DETAILS_AT_TOP tag is set to YES then Doxygen +# will output the detailed description near the top, like JavaDoc. +# If set to NO, the detailed description appears after the member +# documentation. + +DETAILS_AT_TOP = NO + +# If the INHERIT_DOCS tag is set to YES (the default) then an undocumented +# member inherits the documentation from any documented member that it +# re-implements. + +INHERIT_DOCS = YES + +# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC +# tag is set to YES, then doxygen will reuse the documentation of the first +# member in the group (if any) for the other members of the group. By default +# all members of a group must be documented explicitly. + +DISTRIBUTE_GROUP_DOC = NO + +# The TAB_SIZE tag can be used to set the number of spaces in a tab. +# Doxygen uses this value to replace tabs by spaces in code fragments. + +TAB_SIZE = 8 + +# This tag can be used to specify a number of aliases that acts +# as commands in the documentation. An alias has the form "name=value". +# For example adding "sideeffect=\par Side Effects:\n" will allow you to +# put the command \sideeffect (or @sideeffect) in the documentation, which +# will result in a user-defined paragraph with heading "Side Effects:". +# You can put \n's in the value part of an alias to insert newlines. + +ALIASES = + +# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources +# only. Doxygen will then generate output that is more tailored for C. +# For instance, some of the names that are used will be different. The list +# of all members will be omitted, etc. + +OPTIMIZE_OUTPUT_FOR_C = NO + +# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java sources +# only. Doxygen will then generate output that is more tailored for Java. +# For instance, namespaces will be presented as packages, qualified scopes +# will look different, etc. + +OPTIMIZE_OUTPUT_JAVA = NO + +# Set the SUBGROUPING tag to YES (the default) to allow class member groups of +# the same type (for instance a group of public functions) to be put as a +# subgroup of that type (e.g. under the Public Functions section). Set it to +# NO to prevent subgrouping. Alternatively, this can be done per class using +# the \nosubgrouping command. + +SUBGROUPING = YES + +#--------------------------------------------------------------------------- +# Build related configuration options +#--------------------------------------------------------------------------- + +# If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in +# documentation are documented, even if no documentation was available. +# Private class members and static file members will be hidden unless +# the EXTRACT_PRIVATE and EXTRACT_STATIC tags are set to YES + +EXTRACT_ALL = NO + +# If the EXTRACT_PRIVATE tag is set to YES all private members of a class +# will be included in the documentation. + +EXTRACT_PRIVATE = YES + +# If the EXTRACT_STATIC tag is set to YES all static members of a file +# will be included in the documentation. + +EXTRACT_STATIC = YES + +# If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs) +# defined locally in source files will be included in the documentation. +# If set to NO only classes defined in header files are included. + +EXTRACT_LOCAL_CLASSES = YES + +# If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all +# undocumented members of documented classes, files or namespaces. +# If set to NO (the default) these members will be included in the +# various overviews, but no documentation section is generated. +# This option has no effect if EXTRACT_ALL is enabled. + +HIDE_UNDOC_MEMBERS = NO + +# If the HIDE_UNDOC_CLASSES tag is set to YES, Doxygen will hide all +# undocumented classes that are normally visible in the class hierarchy. +# If set to NO (the default) these classes will be included in the various +# overviews. This option has no effect if EXTRACT_ALL is enabled. + +HIDE_UNDOC_CLASSES = NO + +# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, Doxygen will hide all +# friend (class|struct|union) declarations. +# If set to NO (the default) these declarations will be included in the +# documentation. + +HIDE_FRIEND_COMPOUNDS = NO + +# If the HIDE_IN_BODY_DOCS tag is set to YES, Doxygen will hide any +# documentation blocks found inside the body of a function. +# If set to NO (the default) these blocks will be appended to the +# function's detailed documentation block. + +HIDE_IN_BODY_DOCS = NO + +# The INTERNAL_DOCS tag determines if documentation +# that is typed after a \internal command is included. If the tag is set +# to NO (the default) then the documentation will be excluded. +# Set it to YES to include the internal documentation. + +INTERNAL_DOCS = NO + +# If the CASE_SENSE_NAMES tag is set to NO then Doxygen will only generate +# file names in lower-case letters. If set to YES upper-case letters are also +# allowed. This is useful if you have classes or files whose names only differ +# in case and if your file system supports case sensitive file names. Windows +# users are advised to set this option to NO. + +CASE_SENSE_NAMES = NO + +# If the HIDE_SCOPE_NAMES tag is set to NO (the default) then Doxygen +# will show members with their full class and namespace scopes in the +# documentation. If set to YES the scope will be hidden. + +HIDE_SCOPE_NAMES = NO + +# If the SHOW_INCLUDE_FILES tag is set to YES (the default) then Doxygen +# will put a list of the files that are included by a file in the documentation +# of that file. + +SHOW_INCLUDE_FILES = YES + +# If the INLINE_INFO tag is set to YES (the default) then a tag [inline] +# is inserted in the documentation for inline members. + +INLINE_INFO = YES + +# If the SORT_MEMBER_DOCS tag is set to YES (the default) then doxygen +# will sort the (detailed) documentation of file and class members +# alphabetically by member name. If set to NO the members will appear in +# declaration order. + +SORT_MEMBER_DOCS = NO + +# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the +# brief documentation of file, namespace and class members alphabetically +# by member name. If set to NO (the default) the members will appear in +# declaration order. + +SORT_BRIEF_DOCS = NO + +# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be +# sorted by fully-qualified names, including namespaces. If set to +# NO (the default), the class list will be sorted only by class name, +# not including the namespace part. +# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES. +# Note: This option applies only to the class list, not to the +# alphabetical list. + +SORT_BY_SCOPE_NAME = NO + +# The GENERATE_TODOLIST tag can be used to enable (YES) or +# disable (NO) the todo list. This list is created by putting \todo +# commands in the documentation. + +GENERATE_TODOLIST = YES + +# The GENERATE_TESTLIST tag can be used to enable (YES) or +# disable (NO) the test list. This list is created by putting \test +# commands in the documentation. + +GENERATE_TESTLIST = YES + +# The GENERATE_BUGLIST tag can be used to enable (YES) or +# disable (NO) the bug list. This list is created by putting \bug +# commands in the documentation. + +GENERATE_BUGLIST = YES + +# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or +# disable (NO) the deprecated list. This list is created by putting +# \deprecated commands in the documentation. + +GENERATE_DEPRECATEDLIST= YES + +# The ENABLED_SECTIONS tag can be used to enable conditional +# documentation sections, marked by \if sectionname ... \endif. + +ENABLED_SECTIONS = + +# The MAX_INITIALIZER_LINES tag determines the maximum number of lines +# the initial value of a variable or define consists of for it to appear in +# the documentation. If the initializer consists of more lines than specified +# here it will be hidden. Use a value of 0 to hide initializers completely. +# The appearance of the initializer of individual variables and defines in the +# documentation can be controlled using \showinitializer or \hideinitializer +# command in the documentation regardless of this setting. + +MAX_INITIALIZER_LINES = 30 + +# Set the SHOW_USED_FILES tag to NO to disable the list of files generated +# at the bottom of the documentation of classes and structs. If set to YES the +# list will mention the files that were used to generate the documentation. + +SHOW_USED_FILES = YES + +#--------------------------------------------------------------------------- +# configuration options related to warning and progress messages +#--------------------------------------------------------------------------- + +# The QUIET tag can be used to turn on/off the messages that are generated +# by doxygen. Possible values are YES and NO. If left blank NO is used. + +QUIET = YES + +# The WARNINGS tag can be used to turn on/off the warning messages that are +# generated by doxygen. Possible values are YES and NO. If left blank +# NO is used. + +WARNINGS = YES + +# If WARN_IF_UNDOCUMENTED is set to YES, then doxygen will generate warnings +# for undocumented members. If EXTRACT_ALL is set to YES then this flag will +# automatically be disabled. + +WARN_IF_UNDOCUMENTED = YES + +# If WARN_IF_DOC_ERROR is set to YES, doxygen will generate warnings for +# potential errors in the documentation, such as not documenting some +# parameters in a documented function, or documenting parameters that +# don't exist or using markup commands wrongly. + +WARN_IF_DOC_ERROR = YES + +# The WARN_FORMAT tag determines the format of the warning messages that +# doxygen can produce. The string should contain the $file, $line, and $text +# tags, which will be replaced by the file and line number from which the +# warning originated and the warning text. + +WARN_FORMAT = "$file:$line: $text" + +# The WARN_LOGFILE tag can be used to specify a file to which warning +# and error messages should be written. If left blank the output is written +# to stderr. + +WARN_LOGFILE = + +#--------------------------------------------------------------------------- +# configuration options related to the input files +#--------------------------------------------------------------------------- + +# The INPUT tag can be used to specify the files and/or directories that contain +# documented source files. You may enter file names like "myfile.cpp" or +# directories like "/usr/src/myproject". Separate the files or directories +# with spaces. + +INPUT = .. + +# If the value of the INPUT tag contains directories, you can use the +# FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp +# and *.h) to filter out the source-files in the directories. If left +# blank the following patterns are tested: +# *.c *.cc *.cxx *.cpp *.c++ *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh *.hxx *.hpp +# *.h++ *.idl *.odl *.cs *.php *.php3 *.inc + +FILE_PATTERNS = *.cpp \ + *.h \ + NEWS README + +# The RECURSIVE tag can be used to turn specify whether or not subdirectories +# should be searched for input files as well. Possible values are YES and NO. +# If left blank NO is used. + +RECURSIVE = YES + +# The EXCLUDE tag can be used to specify files and/or directories that should +# excluded from the INPUT source files. This way you can easily exclude a +# subdirectory from a directory tree whose root is specified with the INPUT tag. + +EXCLUDE = ../src/obsolete + +# The EXCLUDE_SYMLINKS tag can be used select whether or not files or directories +# that are symbolic links (a Unix filesystem feature) are excluded from the input. + +EXCLUDE_SYMLINKS = NO + +# If the value of the INPUT tag contains directories, you can use the +# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude +# certain files from those directories. + +EXCLUDE_PATTERNS = + +# The EXAMPLE_PATH tag can be used to specify one or more files or +# directories that contain example code fragments that are included (see +# the \include command). + +EXAMPLE_PATH = + +# If the value of the EXAMPLE_PATH tag contains directories, you can use the +# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp +# and *.h) to filter out the source-files in the directories. If left +# blank all files are included. + +EXAMPLE_PATTERNS = + +# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be +# searched for input files to be used with the \include or \dontinclude +# commands irrespective of the value of the RECURSIVE tag. +# Possible values are YES and NO. If left blank NO is used. + +EXAMPLE_RECURSIVE = NO + +# The IMAGE_PATH tag can be used to specify one or more files or +# directories that contain image that are included in the documentation (see +# the \image command). + +IMAGE_PATH = + +# The INPUT_FILTER tag can be used to specify a program that doxygen should +# invoke to filter for each input file. Doxygen will invoke the filter program +# by executing (via popen()) the command , where +# is the value of the INPUT_FILTER tag, and is the name of an +# input file. Doxygen will then use the output that the filter program writes +# to standard output. + +INPUT_FILTER = + +# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using +# INPUT_FILTER) will be used to filter the input files when producing source +# files to browse (i.e. when SOURCE_BROWSER is set to YES). + +FILTER_SOURCE_FILES = NO + +#--------------------------------------------------------------------------- +# configuration options related to source browsing +#--------------------------------------------------------------------------- + +# If the SOURCE_BROWSER tag is set to YES then a list of source files will +# be generated. Documented entities will be cross-referenced with these sources. +# Note: To get rid of all source code in the generated output, make sure also +# VERBATIM_HEADERS is set to NO. + +SOURCE_BROWSER = YES + +# Setting the INLINE_SOURCES tag to YES will include the body +# of functions and classes directly in the documentation. + +INLINE_SOURCES = NO + +# Setting the STRIP_CODE_COMMENTS tag to YES (the default) will instruct +# doxygen to hide any special comment blocks from generated source code +# fragments. Normal C and C++ comments will always remain visible. + +STRIP_CODE_COMMENTS = YES + +# If the REFERENCED_BY_RELATION tag is set to YES (the default) +# then for each documented function all documented +# functions referencing it will be listed. + +REFERENCED_BY_RELATION = YES + +# If the REFERENCES_RELATION tag is set to YES (the default) +# then for each documented function all documented entities +# called/used by that function will be listed. + +REFERENCES_RELATION = YES + +# If the VERBATIM_HEADERS tag is set to YES (the default) then Doxygen +# will generate a verbatim copy of the header file for each class for +# which an include is specified. Set to NO to disable this. + +VERBATIM_HEADERS = YES + +#--------------------------------------------------------------------------- +# configuration options related to the alphabetical class index +#--------------------------------------------------------------------------- + +# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index +# of all compounds will be generated. Enable this if the project +# contains a lot of classes, structs, unions or interfaces. + +ALPHABETICAL_INDEX = YES + +# If the alphabetical index is enabled (see ALPHABETICAL_INDEX) then +# the COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns +# in which this list will be split (can be a number in the range [1..20]) + +COLS_IN_ALPHA_INDEX = 3 + +# In case all classes in a project start with a common prefix, all +# classes will be put under the same header in the alphabetical index. +# The IGNORE_PREFIX tag can be used to specify one or more prefixes that +# should be ignored while generating the index headers. + +IGNORE_PREFIX = eo + +#--------------------------------------------------------------------------- +# configuration options related to the HTML output +#--------------------------------------------------------------------------- + +# If the GENERATE_HTML tag is set to YES (the default) Doxygen will +# generate HTML output. + +GENERATE_HTML = YES + +# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. +# If a relative path is entered the value of OUTPUT_DIRECTORY will be +# put in front of it. If left blank `html' will be used as the default path. + +HTML_OUTPUT = html + +# The HTML_FILE_EXTENSION tag can be used to specify the file extension for +# each generated HTML page (for example: .htm,.php,.asp). If it is left blank +# doxygen will generate files with .html extension. + +HTML_FILE_EXTENSION = .html + +# The HTML_HEADER tag can be used to specify a personal HTML header for +# each generated HTML page. If it is left blank doxygen will generate a +# standard header. + +HTML_HEADER = + +# The HTML_FOOTER tag can be used to specify a personal HTML footer for +# each generated HTML page. If it is left blank doxygen will generate a +# standard footer. + +HTML_FOOTER = + +# The HTML_STYLESHEET tag can be used to specify a user-defined cascading +# style sheet that is used by each HTML page. It can be used to +# fine-tune the look of the HTML output. If the tag is left blank doxygen +# will generate a default style sheet. Note that doxygen will try to copy +# the style sheet file to the HTML output directory, so don't put your own +# stylesheet in the HTML output directory as well, or it will be erased! + +HTML_STYLESHEET = + +# If the HTML_ALIGN_MEMBERS tag is set to YES, the members of classes, +# files or namespaces will be aligned in HTML using tables. If set to +# NO a bullet list will be used. + +HTML_ALIGN_MEMBERS = YES + +# If the GENERATE_HTMLHELP tag is set to YES, additional index files +# will be generated that can be used as input for tools like the +# Microsoft HTML help workshop to generate a compressed HTML help file (.chm) +# of the generated HTML documentation. + +GENERATE_HTMLHELP = NO + +# If the GENERATE_HTMLHELP tag is set to YES, the CHM_FILE tag can +# be used to specify the file name of the resulting .chm file. You +# can add a path in front of the file if the result should not be +# written to the html output directory. + +CHM_FILE = + +# If the GENERATE_HTMLHELP tag is set to YES, the HHC_LOCATION tag can +# be used to specify the location (absolute path including file name) of +# the HTML help compiler (hhc.exe). If non-empty doxygen will try to run +# the HTML help compiler on the generated index.hhp. + +HHC_LOCATION = + +# If the GENERATE_HTMLHELP tag is set to YES, the GENERATE_CHI flag +# controls if a separate .chi index file is generated (YES) or that +# it should be included in the master .chm file (NO). + +GENERATE_CHI = NO + +# If the GENERATE_HTMLHELP tag is set to YES, the BINARY_TOC flag +# controls whether a binary table of contents is generated (YES) or a +# normal table of contents (NO) in the .chm file. + +BINARY_TOC = NO + +# The TOC_EXPAND flag can be set to YES to add extra items for group members +# to the contents of the HTML help documentation and to the tree view. + +TOC_EXPAND = NO + +# The DISABLE_INDEX tag can be used to turn on/off the condensed index at +# top of each HTML page. The value NO (the default) enables the index and +# the value YES disables it. + +DISABLE_INDEX = NO + +# This tag can be used to set the number of enum values (range [1..20]) +# that doxygen will group on one line in the generated HTML documentation. + +ENUM_VALUES_PER_LINE = 4 + +# If the GENERATE_TREEVIEW tag is set to YES, a side panel will be +# generated containing a tree-like index structure (just like the one that +# is generated for HTML Help). For this to work a browser that supports +# JavaScript, DHTML, CSS and frames is required (for instance Mozilla 1.0+, +# Netscape 6.0+, Internet explorer 5.0+, or Konqueror). Windows users are +# probably better off using the HTML help feature. + +GENERATE_TREEVIEW = YES + +# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be +# used to set the initial width (in pixels) of the frame in which the tree +# is shown. + +TREEVIEW_WIDTH = 250 + +#--------------------------------------------------------------------------- +# configuration options related to the LaTeX output +#--------------------------------------------------------------------------- + +# If the GENERATE_LATEX tag is set to YES (the default) Doxygen will +# generate Latex output. + +GENERATE_LATEX = YES + +# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. +# If a relative path is entered the value of OUTPUT_DIRECTORY will be +# put in front of it. If left blank `latex' will be used as the default path. + +LATEX_OUTPUT = latex + +# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be +# invoked. If left blank `latex' will be used as the default command name. + +LATEX_CMD_NAME = latex + +# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to +# generate index for LaTeX. If left blank `makeindex' will be used as the +# default command name. + +MAKEINDEX_CMD_NAME = makeindex + +# If the COMPACT_LATEX tag is set to YES Doxygen generates more compact +# LaTeX documents. This may be useful for small projects and may help to +# save some trees in general. + +COMPACT_LATEX = NO + +# The PAPER_TYPE tag can be used to set the paper type that is used +# by the printer. Possible values are: a4, a4wide, letter, legal and +# executive. If left blank a4wide will be used. + +PAPER_TYPE = a4wide + +# The EXTRA_PACKAGES tag can be to specify one or more names of LaTeX +# packages that should be included in the LaTeX output. + +EXTRA_PACKAGES = + +# The LATEX_HEADER tag can be used to specify a personal LaTeX header for +# the generated latex document. The header should contain everything until +# the first chapter. If it is left blank doxygen will generate a +# standard header. Notice: only use this tag if you know what you are doing! + +LATEX_HEADER = + +# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated +# is prepared for conversion to pdf (using ps2pdf). The pdf file will +# contain links (just like the HTML output) instead of page references +# This makes the output suitable for online browsing using a pdf viewer. + +PDF_HYPERLINKS = NO + +# If the USE_PDFLATEX tag is set to YES, pdflatex will be used instead of +# plain latex in the generated Makefile. Set this option to YES to get a +# higher quality PDF documentation. + +USE_PDFLATEX = NO + +# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode. +# command to the generated LaTeX files. This will instruct LaTeX to keep +# running if errors occur, instead of asking the user for help. +# This option is also used when generating formulas in HTML. + +LATEX_BATCHMODE = NO + +# If LATEX_HIDE_INDICES is set to YES then doxygen will not +# include the index chapters (such as File Index, Compound Index, etc.) +# in the output. + +LATEX_HIDE_INDICES = NO + +#--------------------------------------------------------------------------- +# configuration options related to the RTF output +#--------------------------------------------------------------------------- + +# If the GENERATE_RTF tag is set to YES Doxygen will generate RTF output +# The RTF output is optimized for Word 97 and may not look very pretty with +# other RTF readers or editors. + +GENERATE_RTF = NO + +# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. +# If a relative path is entered the value of OUTPUT_DIRECTORY will be +# put in front of it. If left blank `rtf' will be used as the default path. + +RTF_OUTPUT = rtf + +# If the COMPACT_RTF tag is set to YES Doxygen generates more compact +# RTF documents. This may be useful for small projects and may help to +# save some trees in general. + +COMPACT_RTF = NO + +# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated +# will contain hyperlink fields. The RTF file will +# contain links (just like the HTML output) instead of page references. +# This makes the output suitable for online browsing using WORD or other +# programs which support those fields. +# Note: wordpad (write) and others do not support links. + +RTF_HYPERLINKS = NO + +# Load stylesheet definitions from file. Syntax is similar to doxygen's +# config file, i.e. a series of assignments. You only have to provide +# replacements, missing definitions are set to their default value. + +RTF_STYLESHEET_FILE = + +# Set optional variables used in the generation of an rtf document. +# Syntax is similar to doxygen's config file. + +RTF_EXTENSIONS_FILE = + +#--------------------------------------------------------------------------- +# configuration options related to the man page output +#--------------------------------------------------------------------------- + +# If the GENERATE_MAN tag is set to YES (the default) Doxygen will +# generate man pages + +GENERATE_MAN = YES + +# The MAN_OUTPUT tag is used to specify where the man pages will be put. +# If a relative path is entered the value of OUTPUT_DIRECTORY will be +# put in front of it. If left blank `man' will be used as the default path. + +MAN_OUTPUT = man + +# The MAN_EXTENSION tag determines the extension that is added to +# the generated man pages (default is the subroutine's section .3) + +MAN_EXTENSION = .3 + +# If the MAN_LINKS tag is set to YES and Doxygen generates man output, +# then it will generate one additional man file for each entity +# documented in the real man page(s). These additional files +# only source the real man page, but without them the man command +# would be unable to find the correct page. The default is NO. + +MAN_LINKS = NO + +#--------------------------------------------------------------------------- +# configuration options related to the XML output +#--------------------------------------------------------------------------- + +# If the GENERATE_XML tag is set to YES Doxygen will +# generate an XML file that captures the structure of +# the code including all documentation. + +GENERATE_XML = NO + +# The XML_OUTPUT tag is used to specify where the XML pages will be put. +# If a relative path is entered the value of OUTPUT_DIRECTORY will be +# put in front of it. If left blank `xml' will be used as the default path. + +XML_OUTPUT = xml + +# The XML_SCHEMA tag can be used to specify an XML schema, +# which can be used by a validating XML parser to check the +# syntax of the XML files. + +XML_SCHEMA = + +# The XML_DTD tag can be used to specify an XML DTD, +# which can be used by a validating XML parser to check the +# syntax of the XML files. + +XML_DTD = + +# If the XML_PROGRAMLISTING tag is set to YES Doxygen will +# dump the program listings (including syntax highlighting +# and cross-referencing information) to the XML output. Note that +# enabling this will significantly increase the size of the XML output. + +XML_PROGRAMLISTING = YES + +#--------------------------------------------------------------------------- +# configuration options for the AutoGen Definitions output +#--------------------------------------------------------------------------- + +# If the GENERATE_AUTOGEN_DEF tag is set to YES Doxygen will +# generate an AutoGen Definitions (see autogen.sf.net) file +# that captures the structure of the code including all +# documentation. Note that this feature is still experimental +# and incomplete at the moment. + +GENERATE_AUTOGEN_DEF = NO + +#--------------------------------------------------------------------------- +# configuration options related to the Perl module output +#--------------------------------------------------------------------------- + +# If the GENERATE_PERLMOD tag is set to YES Doxygen will +# generate a Perl module file that captures the structure of +# the code including all documentation. Note that this +# feature is still experimental and incomplete at the +# moment. + +GENERATE_PERLMOD = NO + +# If the PERLMOD_LATEX tag is set to YES Doxygen will generate +# the necessary Makefile rules, Perl scripts and LaTeX code to be able +# to generate PDF and DVI output from the Perl module output. + +PERLMOD_LATEX = NO + +# If the PERLMOD_PRETTY tag is set to YES the Perl module output will be +# nicely formatted so it can be parsed by a human reader. This is useful +# if you want to understand what is going on. On the other hand, if this +# tag is set to NO the size of the Perl module output will be much smaller +# and Perl will parse it just the same. + +PERLMOD_PRETTY = YES + +# The names of the make variables in the generated doxyrules.make file +# are prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. +# This is useful so different doxyrules.make files included by the same +# Makefile don't overwrite each other's variables. + +PERLMOD_MAKEVAR_PREFIX = + +#--------------------------------------------------------------------------- +# Configuration options related to the preprocessor +#--------------------------------------------------------------------------- + +# If the ENABLE_PREPROCESSING tag is set to YES (the default) Doxygen will +# evaluate all C-preprocessor directives found in the sources and include +# files. + +ENABLE_PREPROCESSING = YES + +# If the MACRO_EXPANSION tag is set to YES Doxygen will expand all macro +# names in the source code. If set to NO (the default) only conditional +# compilation will be performed. Macro expansion can be done in a controlled +# way by setting EXPAND_ONLY_PREDEF to YES. + +MACRO_EXPANSION = NO + +# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES +# then the macro expansion is limited to the macros specified with the +# PREDEFINED and EXPAND_AS_PREDEFINED tags. + +EXPAND_ONLY_PREDEF = NO + +# If the SEARCH_INCLUDES tag is set to YES (the default) the includes files +# in the INCLUDE_PATH (see below) will be search if a #include is found. + +SEARCH_INCLUDES = YES + +# The INCLUDE_PATH tag can be used to specify one or more directories that +# contain include files that are not input files but should be processed by +# the preprocessor. + +INCLUDE_PATH = + +# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard +# patterns (like *.h and *.hpp) to filter out the header-files in the +# directories. If left blank, the patterns specified with FILE_PATTERNS will +# be used. + +INCLUDE_FILE_PATTERNS = + +# The PREDEFINED tag can be used to specify one or more macro names that +# are defined before the preprocessor is started (similar to the -D option of +# gcc). The argument of the tag is a list of macros of the form: name +# or name=definition (no spaces). If the definition and the = are +# omitted =1 is assumed. + +PREDEFINED = + +# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then +# this tag can be used to specify a list of macro names that should be expanded. +# The macro definition that is found in the sources will be used. +# Use the PREDEFINED tag if you want to use a different macro definition. + +EXPAND_AS_DEFINED = + +# If the SKIP_FUNCTION_MACROS tag is set to YES (the default) then +# doxygen's preprocessor will remove all function-like macros that are alone +# on a line, have an all uppercase name, and do not end with a semicolon. Such +# function macros are typically used for boiler-plate code, and will confuse the +# parser if not removed. + +SKIP_FUNCTION_MACROS = YES + +#--------------------------------------------------------------------------- +# Configuration::additions related to external references +#--------------------------------------------------------------------------- + +# The TAGFILES option can be used to specify one or more tagfiles. +# Optionally an initial location of the external documentation +# can be added for each tagfile. The format of a tag file without +# this location is as follows: +# TAGFILES = file1 file2 ... +# Adding location for the tag files is done as follows: +# TAGFILES = file1=loc1 "file2 = loc2" ... +# where "loc1" and "loc2" can be relative or absolute paths or +# URLs. If a location is present for each tag, the installdox tool +# does not have to be run to correct the links. +# Note that each tag file must have a unique name +# (where the name does NOT include the path) +# If a tag file is not located in the directory in which doxygen +# is run, you must also specify the path to the tagfile here. + +TAGFILES = + +# When a file name is specified after GENERATE_TAGFILE, doxygen will create +# a tag file that is based on the input files it reads. + +GENERATE_TAGFILE = eo.doxytag + +# If the ALLEXTERNALS tag is set to YES all external classes will be listed +# in the class index. If set to NO only the inherited external classes +# will be listed. + +ALLEXTERNALS = NO + +# If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed +# in the modules index. If set to NO, only the current project's groups will +# be listed. + +EXTERNAL_GROUPS = YES + +# The PERL_PATH should be the absolute path and name of the perl script +# interpreter (i.e. the result of `which perl'). + +PERL_PATH = /usr/bin/perl + +#--------------------------------------------------------------------------- +# Configuration options related to the dot tool +#--------------------------------------------------------------------------- + +# If the CLASS_DIAGRAMS tag is set to YES (the default) Doxygen will +# generate a inheritance diagram (in HTML, RTF and LaTeX) for classes with base or +# super classes. Setting the tag to NO turns the diagrams off. Note that this +# option is superseded by the HAVE_DOT option below. This is only a fallback. It is +# recommended to install and use dot, since it yields more powerful graphs. + +CLASS_DIAGRAMS = YES + +# If set to YES, the inheritance and collaboration graphs will hide +# inheritance and usage relations if the target is undocumented +# or is not a class. + +HIDE_UNDOC_RELATIONS = YES + +# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is +# available from the path. This tool is part of Graphviz, a graph visualization +# toolkit from AT&T and Lucent Bell Labs. The other options in this section +# have no effect if this option is set to NO (the default) + +HAVE_DOT = NO + +# If the CLASS_GRAPH and HAVE_DOT tags are set to YES then doxygen +# will generate a graph for each documented class showing the direct and +# indirect inheritance relations. Setting this tag to YES will force the +# the CLASS_DIAGRAMS tag to NO. + +CLASS_GRAPH = YES + +# If the COLLABORATION_GRAPH and HAVE_DOT tags are set to YES then doxygen +# will generate a graph for each documented class showing the direct and +# indirect implementation dependencies (inheritance, containment, and +# class references variables) of the class with other documented classes. + +COLLABORATION_GRAPH = YES + +# If the UML_LOOK tag is set to YES doxygen will generate inheritance and +# collaboration diagrams in a style similar to the OMG's Unified Modeling +# Language. + +UML_LOOK = NO + +# If set to YES, the inheritance and collaboration graphs will show the +# relations between templates and their instances. + +TEMPLATE_RELATIONS = NO + +# If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDE_GRAPH, and HAVE_DOT +# tags are set to YES then doxygen will generate a graph for each documented +# file showing the direct and indirect include dependencies of the file with +# other documented files. + +INCLUDE_GRAPH = YES + +# If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDED_BY_GRAPH, and +# HAVE_DOT tags are set to YES then doxygen will generate a graph for each +# documented header file showing the documented files that directly or +# indirectly include this file. + +INCLUDED_BY_GRAPH = YES + +# If the CALL_GRAPH and HAVE_DOT tags are set to YES then doxygen will +# generate a call dependency graph for every global function or class method. +# Note that enabling this option will significantly increase the time of a run. +# So in most cases it will be better to enable call graphs for selected +# functions only using the \callgraph command. + +CALL_GRAPH = NO + +# If the GRAPHICAL_HIERARCHY and HAVE_DOT tags are set to YES then doxygen +# will graphical hierarchy of all classes instead of a textual one. + +GRAPHICAL_HIERARCHY = YES + +# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images +# generated by dot. Possible values are png, jpg, or gif +# If left blank png will be used. + +DOT_IMAGE_FORMAT = png + +# The tag DOT_PATH can be used to specify the path where the dot tool can be +# found. If left blank, it is assumed the dot tool can be found on the path. + +DOT_PATH = + +# The DOTFILE_DIRS tag can be used to specify one or more directories that +# contain dot files that are included in the documentation (see the +# \dotfile command). + +DOTFILE_DIRS = + +# The MAX_DOT_GRAPH_WIDTH tag can be used to set the maximum allowed width +# (in pixels) of the graphs generated by dot. If a graph becomes larger than +# this value, doxygen will try to truncate the graph, so that it fits within +# the specified constraint. Beware that most browsers cannot cope with very +# large images. + +MAX_DOT_GRAPH_WIDTH = 1024 + +# The MAX_DOT_GRAPH_HEIGHT tag can be used to set the maximum allows height +# (in pixels) of the graphs generated by dot. If a graph becomes larger than +# this value, doxygen will try to truncate the graph, so that it fits within +# the specified constraint. Beware that most browsers cannot cope with very +# large images. + +MAX_DOT_GRAPH_HEIGHT = 1024 + +# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the +# graphs generated by dot. A depth value of 3 means that only nodes reachable +# from the root by following a path via at most 3 edges will be shown. Nodes that +# lay further from the root node will be omitted. Note that setting this option to +# 1 or 2 may greatly reduce the computation time needed for large code bases. Also +# note that a graph may be further truncated if the graph's image dimensions are +# not sufficient to fit the graph (see MAX_DOT_GRAPH_WIDTH and MAX_DOT_GRAPH_HEIGHT). +# If 0 is used for the depth value (the default), the graph is not depth-constrained. + +MAX_DOT_GRAPH_DEPTH = 0 + +# If the GENERATE_LEGEND tag is set to YES (the default) Doxygen will +# generate a legend page explaining the meaning of the various boxes and +# arrows in the dot generated graphs. + +GENERATE_LEGEND = YES + +# If the DOT_CLEANUP tag is set to YES (the default) Doxygen will +# remove the intermediate dot files that are used to generate +# the various graphs. + +DOT_CLEANUP = YES + +#--------------------------------------------------------------------------- +# Configuration::additions related to the search engine +#--------------------------------------------------------------------------- + +# The SEARCHENGINE tag specifies whether or not a search engine should be +# used. If set to NO the values of all tags below this one will be ignored. + +SEARCHENGINE = YES diff --git a/trunk/paradiseo-eo/doc/eo.doxytag b/trunk/paradiseo-eo/doc/eo.doxytag new file mode 100644 index 000000000..091194a11 --- /dev/null +++ b/trunk/paradiseo-eo/doc/eo.doxytag @@ -0,0 +1,14501 @@ + + + + main + Welcome to Evolving Objects + main + intro + tutorial + install + design + + + eo1PtBitCrossover + classeo1_pt_bit_crossover.html + + + eoAged + classeo_aged.html + Object + + + eoAged + a0 + (const Object &_o) + + + + eoAged + a1 + (const eoAged &_a) + + + virtual + ~eoAged + a2 + () + + + unsigned long + Age + a3 + () const + + + const eoAged & + operator++ + a4 + () + + + virtual std::string + className + z9_0 + () const + + + virtual void + readFrom + z9_1 + (istream &_is) + + + virtual void + printOn + z9_2 + (ostream &_os) const + + + + eoAged + d0 + () + + + unsigned long + age + r0 + + + + + eoAlgo + classeo_algo.html + EOT + eoUF< eoPop< EOT > &, void > + + + eoArithmeticCrossover + classeo_arithmetic_crossover.html + + + eoAssembledFitnessAverageStat + classeo_assembled_fitness_average_stat.html + EOT + eoStat< EOT, double > + + EOT::Fitness + Fitness + w0 + + + + + eoAssembledFitnessAverageStat + a0 + (unsigned _whichTerm=0, std::string _description="Average Fitness") + + + virtual void + operator() + a1 + (const eoPop< EOT > &_pop) + + + unsigned + whichFitnessTerm + r0 + + + + + eoAssembledFitnessBestStat + classeo_assembled_fitness_best_stat.html + EOT + eoStat< EOT, double > + + EOT::Fitness + Fitness + w0 + + + + + eoAssembledFitnessBestStat + a0 + (unsigned _whichTerm=0, std::string _description="Best Fitness") + + + virtual void + operator() + a1 + (const eoPop< EOT > &_pop) + + + unsigned + whichFitnessTerm + r0 + + + + + eoAtomExchange + classeo_atom_exchange.html + Atom + eoBF< unsigned, Atom &, bool > + + virtual void + randomize + a0 + (unsigned int, unsigned int) + + + virtual std::string + className + a1 + () const =0 + + + + eoAverageStat + classeo_average_stat.html + EOT + eoStat< EOT, EOT::Fitness > + + EOT::Fitness + Fitness + w0 + + + + + eoAverageStat + a0 + (std::string _description="Average Fitness") + + + + eoAverageStat + a1 + (double _value, std::string _desc) + + + virtual void + operator() + a2 + (const eoPop< EOT > &_pop) + + + virtual std::string + className + a3 + (void) const + + + Fitness + sumFitness + e0 + (double _sum, const EOT &_eot) + + + void + doit + d0 + (const eoPop< EOT > &_pop, eoParetoFitness< T >) + + + void + doit + d1 + (const eoPop< EOT > &_pop, T) + + + + eoBestFitnessStat + classeo_best_fitness_stat.html + EOT + eoStat< EOT, EOT::Fitness > + + EOT::Fitness + Fitness + w0 + + + + + eoBestFitnessStat + a0 + (std::string _description="Best ") + + + void + operator() + a1 + (const eoPop< EOT > &_pop) + + + virtual std::string + className + a2 + (void) const + + + void + doit + d0 + (const eoPop< EOT > &_pop, eoParetoFitness< T >) + + + void + doit + d1 + (const eoPop< EOT > &_pop, T) + + + + eoBestSelect + classeo_best_select.html + EOT + eoSelectOne< EOT > + + virtual const EOT & + operator() + a0 + (const eoPop< EOT > &_pop) + + + + eoBF + classeo_b_f.html + A1 + A2 + R + eoFunctorBase + + virtual + ~eoBF + a0 + () + + + virtual R + operator() + a1 + (A1, A2)=0 + + + eoFunctorBase::binary_function_tag + functor_category + e0 + () + + + + BiasedNodeSelector + class_biased_node_selector.html + NodeSelector + + + BiasedNodeSelector + a1 + (unsigned n) + + + NodeSelection + select_node + a2 + (Sym sym) const + + + unsigned + nRounds + o0 + + + + + eoBinaryFunctorCounter + classeo_binary_functor_counter.html + BinaryFunctor + eoValueParam< unsigned long > + + + eoBinaryFunctorCounter + a0 + (BinaryFunctor &_func, std::string _name="proc_counter") + + + BinaryFunctor::result_type + operator() + a1 + (typename BinaryFunctor::first_argument_type _arg1, typename BinaryFunctor::second_argument_type _arg2) + + + BinaryFunctor & + func + r0 + + + + + eoBinCloneOp + classeo_bin_clone_op.html + EOT + eoBinOp< EOT > + + + eoBinCloneOp + a0 + () + + + virtual std::string + className + a1 + () const + + + virtual bool + operator() + a2 + (EOT &, const EOT &) + + + + eoBinGenOp + classeo_bin_gen_op.html + EOT + eoGenOp + + + eoBinGenOp + a0 + (eoBinOp< EOT > &_op) + + + unsigned + max_production + a1 + (void) + + + void + apply + a2 + (eoPopulator< EOT > &_pop) + + + virtual std::string + className + a3 + () const + + + eoBinOp< EOT > & + op + r0 + + + + + eoBinOp + classeo_bin_op.html + EOType + eoOp + eoBF< EOType &, const EOType &, bool > + + + eoBinOp + a0 + () + + + virtual std::string + className + a1 + () const + + + + eoBit + classeo_bit.html + FitT + eoVector< FitT, bool > + + + eoBit + a0 + (unsigned size=0, bool value=false) + + + virtual std::string + className + a1 + () const + + + virtual void + printOn + a2 + (std::ostream &os) const + + + virtual void + readFrom + a3 + (std::istream &is) + + + + eoBitBitFlip + classeo_bit_bit_flip.html + + + eoBitGxOver + classeo_bit_gx_over.html + Chrom + eoQuadOp< Chrom > + + + eoBitGxOver + a0 + (const unsigned _gene_size, const unsigned _num_points=2) + + + virtual std::string + className + a1 + () const + + + bool + operator() + a2 + (Chrom &chrom1, Chrom &chrom2) + + + unsigned + gene_size + r0 + + + + unsigned + num_points + r1 + + + + + eoBitInversion + classeo_bit_inversion.html + Chrom + eoMonOp< Chrom > + + virtual std::string + className + a0 + () const + + + bool + operator() + a1 + (Chrom &chrom) + + + + eoBitMutation + classeo_bit_mutation.html + Chrom + eoMonOp< Chrom > + + + eoBitMutation + a0 + (const double &_rate=0.01, bool _normalize=false) + + + virtual std::string + className + a1 + () const + + + bool + operator() + a2 + (Chrom &chrom) + + + double + rate + r0 + + + + bool + normalize + r1 + + + + + eoBitNext + classeo_bit_next.html + Chrom + eoMonOp< Chrom > + + virtual std::string + className + a0 + () const + + + bool + operator() + a1 + (Chrom &chrom) + + + + eoBitOpFactory + classeo_bit_op_factory.html + EOT + eoFactory< EOT > + + virtual eoOp< EOT > * + make + a0 + (std::istream &_is) + + + + eoBitOpFactory + z23_0 + () + + + virtual + ~eoBitOpFactory + z23_1 + () + + + + eoBitPrev + classeo_bit_prev.html + Chrom + eoMonOp< Chrom > + + virtual std::string + className + a0 + () const + + + bool + operator() + a1 + (Chrom &chrom) + + + + boolean_generator + classboolean__generator.html + + + boolean_generator + a0 + (float _bias=0.5, eoRng &_rng=rng) + + + bool + operator() + a1 + (void) + + + float + bias + r0 + + + + eoRng & + gen + r1 + + + + + eoBooleanGenerator + classeo_boolean_generator.html + eoRndGenerator< bool > + + + eoBooleanGenerator + a0 + (float _bias=0.5, eoRng &_rng=rng) + + + bool + operator() + a1 + (void) + + + float + bias + r0 + + + + eoRng & + gen + r1 + + + + + eoBooleanInit + classeo_boolean_init.html + eoInit< bool > + + + eoBooleanInit + a0 + (float _bias=0.5, eoRng &_rng=rng) + + + void + operator() + a1 + (bool &_b) + + + float + bias + r0 + + + + eoRng & + gen + r1 + + + + + eoBoolFlip + classeo_bool_flip.html + eoMonOp< bool > + + bool + operator() + a0 + (bool &_b) + + + virtual string + className + a1 + () const + + + + eoBranchMutation + classeo_branch_mutation.html + FType + Node + eoMonOp< eoParseTree< FType, Node > > + + eoParseTree< FType, Node > + EoType + w0 + + + + + eoBranchMutation + a0 + (eoInit< EoType > &_init, unsigned _max_length) + + + virtual std::string + className + a1 + () const + + + virtual + ~eoBranchMutation + a2 + () + + + bool + operator() + a3 + (EoType &_eo1) + + + unsigned + max_length + r0 + + + + eoInit< EoType > & + initializer + r1 + + + + + eoBreed + classeo_breed.html + EOT + eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > + + + eoCellularEasyEA + classeo_cellular_easy_e_a.html + EOT + eoAlgo + + + eoCellularEasyEA + a0 + (eoContinue< EOT > &_cont, eoEvalFunc< EOT > &_eval, eoSelectOne< EOT > &_sel_neigh, eoBinOp< EOT > &_cross, eoMonOp< EOT > &_mut, eoSelectOne< EOT > &_sel_repl) + + + + eoCellularEasyEA + a1 + (eoContinue< EOT > &_cont, eoEvalFunc< EOT > &_eval, eoSelectOne< EOT > &_sel_neigh, eoQuadOp< EOT > &_cross, eoMonOp< EOT > &_mut, eoSelectOne< EOT > &_sel_child, eoSelectOne< EOT > &_sel_repl) + + + void + operator() + a2 + (eoPop< EOT > &pop) + + + virtual eoPop< EOT > + neighbours + b0 + (const eoPop< EOT > &pop, int rank)=0 + + + eoContinue< EOT > & + cont + r0 + + + + eoEvalFunc< EOT > & + eval + r1 + + + + eoPopLoopEval< EOT > + popEval + r2 + + + + eoSelectOne< EOT > & + sel_neigh + r3 + + + + eoBF< EOT &, EOT &, bool > & + cross + r4 + + + + eoMonOp< EOT > & + mut + r5 + + + + eoSelectOne< EOT > & + sel_child + r6 + + + + eoSelectOne< EOT > & + sel_repl + r7 + + + + + eoCheckPoint + classeo_check_point.html + EOT + eoContinue + + + eoCheckPoint + a0 + (eoContinue< EOT > &_cont) + + + bool + operator() + a1 + (const eoPop< EOT > &_pop) + + + void + add + a2 + (eoContinue< EOT > &_cont) + + + void + add + a3 + (eoSortedStatBase< EOT > &_stat) + + + void + add + a4 + (eoStatBase< EOT > &_stat) + + + void + add + a5 + (eoMonitor &_mon) + + + void + add + a6 + (eoUpdater &_upd) + + + virtual std::string + className + a7 + (void) const + + + std::string + allClassNames + a8 + () const + + + std::vector< eoContinue< EOT > * > + continuators + r0 + + + + std::vector< eoSortedStatBase< EOT > * > + sorted + r1 + + + + std::vector< eoStatBase< EOT > * > + stats + r2 + + + + std::vector< eoMonitor * > + monitors + r3 + + + + std::vector< eoUpdater * > + updaters + r4 + + + + + eoCMABreed + classeo_c_m_a_breed.html + FitT + eoBreed< eoVector< FitT, double > > + + + eoCMABreed + a0 + (eo::CMAState &state_, unsigned lambda_) + + + void + operator() + a1 + (const eoPop< EOT > &parents, eoPop< EOT > &offspring) + + + eoVector< FitT, double > + EOT + y0 + + + + eo::CMAState & + state + r0 + + + + unsigned + lambda + r1 + + + + + eoCMAInit + classeo_c_m_a_init.html + FitT + eoInit< eoVector< FitT, double > > + + + eoCMAInit + a0 + (const eo::CMAState &state_) + + + void + operator() + a1 + (EOT &v) + + + eoVector< FitT, double > + EOT + y0 + + + + const eo::CMAState & + state + r0 + + + + + eoCollapseSubtreeMutation + classeo_collapse_subtree_mutation.html + FType + Node + eoMonOp< eoParseTree< FType, Node > > + + eoParseTree< FType, Node > + EoType + w0 + + + + + eoCollapseSubtreeMutation + a0 + (eoInit< EoType > &_init, unsigned _max_length) + + + virtual std::string + className + a1 + () const + + + virtual + ~eoCollapseSubtreeMutation + a2 + () + + + bool + operator() + a3 + (EoType &_eo1) + + + unsigned + max_length + r0 + + + + eoInit< EoType > & + initializer + r1 + + + + + eoCombinedContinue + classeo_combined_continue.html + EOT + eoContinue + + EOT::Fitness + FitnessType + w0 + + + + + eoCombinedContinue + a0 + (eoContinue< EOT > &_cont) + + + + eoCombinedContinue + a1 + (eoContinue< EOT > &_cont1, eoContinue< EOT > &_cont2) + + + void + add + a2 + (eoContinue< EOT > &_cont) + + + void + removeLast + a3 + (void) + + + virtual bool + operator() + a4 + (const eoPop< EOT > &_pop) + + + virtual std::string + className + a5 + (void) const + + + std::vector< eoContinue< EOT > * > + continuators + r0 + + + + + eoCombinedInit + classeo_combined_init.html + EOT + eoInit + + + eoCombinedInit + a0 + (eoInit< EOT > &_init, double _rate) + + + void + add + a1 + (eoInit< EOT > &_init, double _rate, bool _verbose=false) + + + virtual void + printOn + a2 + (std::ostream &_os) + + + virtual void + operator() + a3 + (EOT &_eo) + + + virtual std::string + className + a4 + (void) const + + + std::vector< eoInit< EOT > * > + initializers + r0 + + + + std::vector< double > + rates + r1 + + + + + eoCommaReplacement + classeo_comma_replacement.html + EOT + eoMergeReduce + + eoNoElitism< EOT > + no_elite + r0 + + + + eoTruncate< EOT > + truncate + r1 + + + + + eoContinue + classeo_continue.html + EOT + eoUF< const eoPop< EOT > &, bool > + eoPersistent + + virtual std::string + className + a0 + (void) const + + + void + readFrom + a1 + (std::istream &__is) + + + void + printOn + a2 + (std::ostream &__os) const + + + + eoCountedDynUpdate + classeo_counted_dyn_update.html + eoDynUpdater + + + eoCountedDynUpdate + a0 + (eoUpdatable &_toUpdate, unsigned _interval) + + + void + operator() + a1 + (void) + + + const unsigned + interval + r0 + + + + unsigned + counter + r1 + + + + + eoCountedStateSaver + classeo_counted_state_saver.html + eoUpdater + + + eoCountedStateSaver + a0 + (unsigned _interval, const eoState &_state, std::string _prefix, bool _saveOnLastCall, std::string _extension="sav", unsigned _counter=0) + + + + eoCountedStateSaver + a1 + (unsigned _interval, const eoState &_state, std::string _prefix="state", std::string _extension="sav", unsigned _counter=0) + + + virtual void + lastCall + a2 + (void) + + + void + operator() + a3 + (void) + + + virtual std::string + className + a4 + (void) const + + + void + doItNow + d0 + (void) + + + const eoState & + state + r0 + + + + const unsigned + interval + r1 + + + + unsigned + counter + r2 + + + + bool + saveOnLastCall + r3 + + + + const std::string + prefix + r4 + + + + const std::string + extension + r5 + + + + + Cov + class_cov.html + + void + update + a1 + (double a, double b) + + + double + get_meana + a2 + () const + + + double + get_meanb + a3 + () const + + + double + get_cov + a4 + () const + + + double + n + r0 + + + + double + meana + r1 + + + + double + meanb + r2 + + + + double + sumcov + r3 + + + + + eoCtrlCContinue + classeo_ctrl_c_continue.html + EOT + eoContinue + + + eoCtrlCContinue + a0 + () + + + virtual bool + operator() + a1 + (const eoPop< EOT > &_vEO) + + + virtual std::string + className + a2 + (void) const + + + + eoDetBitFlip + classeo_det_bit_flip.html + Chrom + eoMonOp< Chrom > + + + eoDetBitFlip + a0 + (const unsigned &_num_bit=1) + + + virtual std::string + className + a1 + () const + + + bool + operator() + a2 + (Chrom &chrom) + + + unsigned + num_bit + r0 + + + + + eoDeterministicSaDReplacement + classeo_deterministic_sa_d_replacement.html + EOT + eoReplacement + + + eoDeterministicSaDReplacement + a0 + (eoReduce< EOT > &_reduceGlobal, double _surviveParents, double _dieParents=0, double _surviveOffspring=0, double _dieOffspring=0, bool _interpret_as_rate=true) + + + + eoDeterministicSaDReplacement + a1 + (double _surviveParents, double _dieParents=0, double _surviveOffspring=0, double _dieOffspring=0, bool _interpret_as_rate=true) + + + void + operator() + a2 + (eoPop< EOT > &_parents, eoPop< EOT > &_offspring) + + + eoReduce< EOT > & + reduceGlobal + r0 + + + + eoDeterministicSurviveAndDie< EOT > + sAdParents + r1 + + + + eoDeterministicSurviveAndDie< EOT > + sAdOffspring + r2 + + + + eoPlus< EOT > + plus + r3 + + + + eoTruncate< EOT > + truncate + r4 + + + + + eoDeterministicSurviveAndDie + classeo_deterministic_survive_and_die.html + EOT + eoSurviveAndDie + + + eoDeterministicSurviveAndDie + a0 + (double _survive, double _die, bool _interpret_as_rate=true) + + + void + operator() + a1 + (eoPop< EOT > &_pop, eoPop< EOT > &_luckyGuys) + + + + eoDetSelect + classeo_det_select.html + EOT + eoSelect + + + eoDetSelect + a0 + (double _rate=1.0, bool _interpret_as_rate=true) + + + virtual void + operator() + a1 + (const eoPop< EOT > &_source, eoPop< EOT > &_dest) + + + eoHowMany + howMany + r0 + + + + + eoDetTournamentSelect + classeo_det_tournament_select.html + EOT + eoSelectOne< EOT > + + + eoDetTournamentSelect + a0 + (unsigned _tSize=2) + + + virtual const EOT & + operator() + a1 + (const eoPop< EOT > &_pop) + + + unsigned + tSize + r0 + + + + + eoDetTournamentTruncate + classeo_det_tournament_truncate.html + EOT + eoReduce + + + eoDetTournamentTruncate + a0 + (unsigned _t_size) + + + void + operator() + a1 + (eoPop< EOT > &_newgen, unsigned _newsize) + + + unsigned + t_size + r0 + + + + + eoDetTournamentTruncateSplit + classeo_det_tournament_truncate_split.html + EOT + eoReduceSplit + + + eoDetTournamentTruncateSplit + a0 + (unsigned _t_size, eoHowMany _howMany, bool _returnEliminated=false) + + + void + operator() + a1 + (eoPop< EOT > &_newgen, eoPop< EOT > &_eliminated) + + + unsigned + t_size + r0 + + + + eoHowMany + howMany + r1 + + + + bool + returnEliminated + r2 + + + + + eoDetTournamentWorthSelect + classeo_det_tournament_worth_select.html + EOT + WorthT + eoSelectFromWorth< EOT, WorthT > + + std::vector< WorthT >::iterator + worthIterator + w0 + + + + + eoDetTournamentWorthSelect + a0 + (eoPerf2Worth< EOT, WorthT > &perf2Worth, unsigned _tSize) + + + virtual const EOT & + operator() + a1 + (const eoPop< EOT > &pop) + + + unsigned + tSize + r0 + + + + + eoDetUniformMutation + classeo_det_uniform_mutation.html + EOT + eoMonOp< EOT > + + + eoDetUniformMutation + a0 + (const double &_epsilon, const unsigned &_no=1) + + + + eoDetUniformMutation + a1 + (eoRealVectorBounds &_bounds, const double &_epsilon, const unsigned &_no=1) + + + + eoDetUniformMutation + a2 + (eoRealVectorBounds &_bounds, const std::vector< double > &_epsilon, const unsigned &_no=1) + + + virtual std::string + className + a3 + () const + + + bool + operator() + a4 + (EOT &_eo) + + + bool + homogeneous + r0 + + + + eoRealVectorBounds & + bounds + r1 + + + + std::vector< double > + epsilon + r2 + + + + unsigned + no + r3 + + + + + eoDistance + classeo_distance.html + EOT + eoBF< const EOT &, const EOT &, double > + + + eoDistribUpdater + classeo_distrib_updater.html + EOT + eoBF< eoDistribution< EOT > &, eoPop< EOT > &, void > + + virtual void + operator() + a0 + (eoDistribution< EOT > &, eoPop< EOT > &)=0 + + + + eoDistribution + classeo_distribution.html + EOT + eoInit + eoPersistent + eoObject + + virtual void + operator() + a0 + (EOT &)=0 + + + + dMatrix + classd_matrix.html + + + dMatrix + a0 + (unsigned _s) + + + double + operator() + a1 + (unsigned _i, unsigned _j) const + + + double & + operator() + a2 + (unsigned _i, unsigned _j) + + + void + printOn + a3 + (std::ostream &_os) + + + unsigned + rSize + r0 + + + + + eoDominanceMap + classeo_dominance_map.html + EoType + eoUF< const eoPop< EoType > &, void > + + void + clear + a0 + () + + + void + operator() + a1 + (const eoPop< EoType > &_pop) + + + void + remove + a2 + (unsigned i) + + + void + setup + a3 + (const eoPop< EoType > &_pop) + + + std::vector< double > + sum_dominators + a4 + () const + + + std::vector< double > + sum_dominants + a5 + () const + + + std::vector< typename EoType::Fitness > + fitness + r0 + + + + + eoDoubleExchange + classeo_double_exchange.html + eoBinOp< double > + + + eoDoubleExchange + a0 + () + + + virtual std::string + className + a1 + () const + + + bool + operator() + a2 + (double &r1, const double &r2) + + + + eoDoubleIntermediate + classeo_double_intermediate.html + eoBinOp< double > + + + eoDoubleIntermediate + a0 + () + + + virtual std::string + className + a1 + () const + + + bool + operator() + a2 + (double &r1, const double &r2) + + + + eoDrawable + classeo_drawable.html + Object + + + eoDrawable + a0 + (const Object &_o) + + + + eoDrawable + a1 + (const eoDrawable &_d) + + + virtual + ~eoDrawable + a2 + () + + + virtual void + draw + a3 + (unsigned _x, unsigned _y)=0 + + + + Dummy + struct_dummy.html + EO< double > + EO< double > + EO< double > + EO< double > + EO< double > + EO< double > + + double + Type + w0 + + + + double + Type + w1 + + + + double + Type + w2 + + + + double + Type + w3 + + + + double + Type + w4 + + + + double + Type + w5 + + + + + Dummy + a0 + (std::string _s="") + + + void + printOn + a1 + (std::ostream &_os) const + + + void + printOn + a2 + (std::ostream &_os) const + + + void + printOn + a3 + (std::ostream &_os) const + + + void + printOn + a4 + (std::ostream &_os) const + + + std::string + s + o0 + + + + double + xdist + o1 + + + + + eoDynSGATransform + classeo_dyn_s_g_a_transform.html + EOT + eoTransform + + + eoDynSGATransform + a0 + (eoQuadOp< EOT > &_cross, double _cProba, eoMonOp< EOT > &_mutate, double _mProba) + + + + eoDynSGATransform + a1 + (eoQuadOp< EOT > &_cross, double *_cProbaRef, eoMonOp< EOT > &_mutate, double *_mProbaRef) + + + void + operator() + a2 + (eoPop< EOT > &_pop) + + + double & + PCrossHandle + a3 + () + + + double & + PMutHandle + a4 + () + + + eoInvalidateQuadOp< EOT > + cross + r0 + + + + double + crossoverProbaHolder + r1 + + + + double & + crossoverProba + r2 + + + + eoInvalidateMonOp< EOT > + mutate + r3 + + + + double + mutationProbaHolder + r4 + + + + double & + mutationProba + r5 + + + + + eoDynUpdater + classeo_dyn_updater.html + eoUpdater + + + eoDynUpdater + a0 + (eoUpdatable &_toUpdate) + + + virtual void + operator() + a1 + () + + + eoUpdatable & + toUpdate + r0 + + + + + eoEasyEA + classeo_easy_e_a.html + EOT + eoAlgo + + + eoEasyEA + a0 + (eoContinue< EOT > &_continuator, eoEvalFunc< EOT > &_eval, eoBreed< EOT > &_breed, eoReplacement< EOT > &_replace) + + + + eoEasyEA + a1 + (eoContinue< EOT > &_continuator, eoPopEvalFunc< EOT > &_eval, eoBreed< EOT > &_breed, eoReplacement< EOT > &_replace) + + + + eoEasyEA + a2 + (eoContinue< EOT > &_continuator, eoEvalFunc< EOT > &_eval, eoBreed< EOT > &_breed, eoMerge< EOT > &_merge, eoReduce< EOT > &_reduce) + + + + eoEasyEA + a3 + (eoContinue< EOT > &_continuator, eoEvalFunc< EOT > &_eval, eoSelect< EOT > &_select, eoTransform< EOT > &_transform, eoReplacement< EOT > &_replace) + + + + eoEasyEA + a4 + (eoContinue< EOT > &_continuator, eoEvalFunc< EOT > &_eval, eoSelect< EOT > &_select, eoTransform< EOT > &_transform, eoMerge< EOT > &_merge, eoReduce< EOT > &_reduce) + + + virtual void + operator() + a5 + (eoPop< EOT > &_pop) + + + eoEasyEA::eoDummySelect + dummySelect + p0 + + + + eoEasyEA::eoDummyTransform + dummyTransform + p1 + + + + eoEasyEA::eoDummyEval + dummyEval + p2 + + + + eoContinue< EOT > & + continuator + p3 + + + + eoEvalFunc< EOT > & + eval + p4 + + + + eoPopLoopEval< EOT > + loopEval + p5 + + + + eoPopEvalFunc< EOT > & + popEval + p6 + + + + eoSelectTransform< EOT > + selectTransform + p7 + + + + eoBreed< EOT > & + breed + p8 + + + + eoNoElitism< EOT > + dummyMerge + p9 + + + + eoTruncate< EOT > + dummyReduce + p10 + + + + eoMergeReduce< EOT > + mergeReduce + p11 + + + + eoReplacement< EOT > & + replace + p12 + + + + friend class + eoIslandsEasyEA<EOT> + n0 + + + + friend class + eoDistEvalEasyEA<EOT> + n1 + + + + + eoEDA + classeo_e_d_a.html + EOT + eoUF< eoDistribution< EOT > &, void > + + + eoEliteSequentialSelect + classeo_elite_sequential_select.html + EOT + eoSelectOne< EOT > + + + eoEliteSequentialSelect + a0 + () + + + void + setup + a1 + (const eoPop< EOT > &_pop) + + + virtual const EOT & + operator() + a2 + (const eoPop< EOT > &_pop) + + + unsigned + current + r0 + + + + std::vector< const EOT * > + eoPters + r1 + + + + + eoElitism + classeo_elitism.html + EOT + eoMerge< EOT > + + + eoElitism + a0 + (double _rate, bool _interpret_as_rate=true) + + + void + operator() + a1 + (const eoPop< EOT > &_pop, eoPop< EOT > &_offspring) + + + double + rate + r0 + + + + unsigned + combien + r1 + + + + + EO + class_e_o.html + F + eoObject + eoPersistent + + F + Fitness + w0 + + + + Traits + fitness_traits + w1 + + + + Traits::storage_type + storage_type + w2 + + + + Traits::performance_type + performance_type + w3 + + + + Traits::worth_type + worth_type + w4 + + + + + EO + a0 + () + + + virtual + ~EO + a1 + () + + + Fitness + fitness + a2 + () const + + + void + invalidate + a3 + () + + + void + fitness + a4 + (const Fitness &_fitness) + + + bool + invalid + a5 + () const + + + bool + operator< + a6 + (const EO &_eo2) const + + + bool + operator> + a7 + (const EO &_eo2) const + + + void + fitness + a9 + (performance_type perf) + + + void + performance + a10 + (performance_type perf) + + + performance_type + performance + a11 + (void) const + + + void + worth + a12 + (worth_type worth) + + + worth_type + worth + a13 + (void) const + + + worth_type + fitness + a14 + (void) const + + + void + invalidate + a15 + (void) + + + void + invalidate_worth + a16 + (void) + + + bool + operator< + a17 + (const EO< Fitness, Traits > &other) const + + + bool + operator> + a18 + (const EO< Fitness, Traits > &other) const + + + virtual std::string + className + z10_0 + () const + + + virtual void + readFrom + z10_1 + (std::istream &_is) + + + virtual void + printOn + z10_2 + (std::ostream &_os) const + + + Fitness + repFitness + r0 + + + + bool + invalidFitness + r1 + + + + bool + valid_performance + r2 + + + + bool + valid_worth + r3 + + + + storage_type + rep_fitness + r4 + + + + + eoEPReduce + classeo_e_p_reduce.html + EOT + eoReduce + + EOT::Fitness + Fitness + w0 + + + + std::pair< float, typename eoPop< EOT >::iterator > + EPpair + w1 + + + + + eoEPReduce + a0 + (unsigned _t_size) + + + void + operator() + a1 + (eoPop< EOT > &_newgen, unsigned _newsize) + + + unsigned + t_size + r0 + + + + + eoEPReplacement + classeo_e_p_replacement.html + EOT + eoMergeReduce + + + eoEPReplacement + a0 + (int _tSize) + + + eoPlus< EOT > + plus + r0 + + + + eoEPReduce< EOT > + truncate + r1 + + + + + eoEsChromInit + classeo_es_chrom_init.html + EOT + eoRealInitBounded + + EOT::Fitness + FitT + w0 + + + + + eoEsChromInit + a0 + (eoRealVectorBounds &_bounds, double _sigma=0.3, bool _to_scale=false) + + + + eoEsChromInit + a1 + (eoRealVectorBounds &_bounds, std::vector< double > _vecSigma) + + + void + operator() + a2 + (EOT &_eo) + + + void + create_self_adapt + d0 + (eoReal< FitT > &) + + + void + create_self_adapt + d1 + (eoEsSimple< FitT > &result) + + + void + create_self_adapt + d2 + (eoEsStdev< FitT > &result) + + + void + create_self_adapt + d3 + (eoEsFull< FitT > &result) + + + double + uniqueSigma + r0 + + + + std::vector< double > + vecSigma + r1 + + + + + eoEsFull + classeo_es_full.html + Fit + eoVector< Fit, double > + + double + Type + w0 + + + + virtual std::string + className + a1 + (void) const + + + void + printOn + a2 + (std::ostream &os) const + + + void + readFrom + a3 + (std::istream &is) + + + std::vector< double > + stdevs + o0 + + + + std::vector< double > + correlations + o1 + + + + + eoEsGlobalXover + classeo_es_global_xover.html + EOT + eoGenOp + + EOT::Fitness + FitT + w0 + + + + + eoEsGlobalXover + a0 + (eoBinOp< double > &_crossObj, eoBinOp< double > &_crossMut) + + + virtual std::string + className + a1 + () const + + + unsigned + max_production + a2 + (void) + + + void + apply + a3 + (eoPopulator< EOT > &_plop) + + + void + cross_self_adapt + d0 + (eoEsSimple< FitT > &_parent, const eoPop< eoEsSimple< FitT > > &_pop) + + + void + cross_self_adapt + d1 + (eoEsStdev< FitT > &_parent, const eoPop< eoEsStdev< FitT > > &_pop) + + + void + cross_self_adapt + d2 + (eoEsFull< FitT > &_parent, const eoPop< eoEsFull< FitT > > &_pop) + + + eoRandomSelect< EOT > + sel + r0 + + + + eoBinOp< double > & + crossObj + r1 + + + + eoBinOp< double > & + crossMut + r2 + + + + + eoEsMutate + classeo_es_mutate.html + EOT + eoMonOp< EOT > + + EOT::Fitness + FitT + w0 + + + + + eoEsMutate + a0 + (eoEsMutationInit &_init, eoRealVectorBounds &_bounds) + + + virtual + ~eoEsMutate + a1 + () + + + virtual std::string + className + a2 + () const + + + virtual bool + operator() + a3 + (eoEsSimple< FitT > &_eo) + + + virtual bool + operator() + a4 + (eoEsStdev< FitT > &_eo) + + + virtual bool + operator() + a5 + (eoEsFull< FitT > &_eo) + + + void + init + d0 + (eoEsSimple< FitT >, eoEsMutationInit &_init) + + + void + init + d1 + (eoEsStdev< FitT >, eoEsMutationInit &_init) + + + void + init + d2 + (eoEsFull< FitT >, eoEsMutationInit &_init) + + + double + TauLcl + r0 + + + + double + TauGlb + r1 + + + + double + TauBeta + r2 + + + + eoRealVectorBounds & + bounds + r3 + + + + const double + stdev_eps + v0 + + + + + eoEsMutationInit + classeo_es_mutation_init.html + + + eoEsMutationInit + a0 + (eoParser &_parser, std::string _section="ES mutation parameters") + + + virtual + ~eoEsMutationInit + a1 + () + + + double + TauLcl + a2 + (void) + + + double + TauGlb + a3 + (void) + + + double + TauBeta + a4 + (void) + + + virtual std::string + section + b0 + (void) + + + virtual std::string + TauLclName + b1 + (void) const + + + virtual char + TauLclShort + b2 + (void) const + + + virtual std::string + TauGlbName + b3 + (void) const + + + virtual char + TauGlbShort + b4 + (void) const + + + virtual std::string + TauBetaName + b5 + (void) const + + + virtual char + TauBetaShort + b6 + (void) const + + + eoParser & + parser + r0 + + + + std::string + repSection + r1 + + + + eoValueParam< double > * + TauLclParam + r2 + + + + eoValueParam< double > * + TauGlbParam + r3 + + + + eoValueParam< double > * + TauBetaParam + r4 + + + + + eoEsSimple + classeo_es_simple.html + Fit + eoVector< Fit, double > + + double + Type + w0 + + + + virtual std::string + className + a1 + () const + + + void + printOn + a2 + (std::ostream &os) const + + + void + readFrom + a3 + (std::istream &is) + + + double + stdev + o0 + + + + + eoEsStandardXover + classeo_es_standard_xover.html + EOT + eoBinOp< EOT > + + EOT::Fitness + FitT + w0 + + + + + eoEsStandardXover + a0 + (eoBinOp< double > &_crossObj, eoBinOp< double > &_crossMut) + + + virtual std::string + className + a1 + () const + + + bool + operator() + a2 + (EOT &_eo1, const EOT &_eo2) + + + bool + cross_self_adapt + d0 + (eoEsSimple< FitT > &_parent1, const eoEsSimple< FitT > &_parent2) + + + bool + cross_self_adapt + d1 + (eoEsStdev< FitT > &_parent1, const eoEsStdev< FitT > &_parent2) + + + bool + cross_self_adapt + d2 + (eoEsFull< FitT > &_parent1, const eoEsFull< FitT > &_parent2) + + + eoRandomSelect< EOT > + sel + r0 + + + + eoBinOp< double > & + crossObj + r1 + + + + eoBinOp< double > & + crossMut + r2 + + + + + eoEsStdev + classeo_es_stdev.html + Fit + eoVector< Fit, double > + + double + Type + w0 + + + + virtual std::string + className + a1 + (void) const + + + void + printOn + a2 + (std::ostream &os) const + + + void + readFrom + a3 + (std::istream &is) + + + std::vector< double > + stdevs + o0 + + + + + eoEvalContinue + classeo_eval_continue.html + EOT + eoContinue + + + eoEvalContinue + a0 + (eoEvalFuncCounter< EOT > &_eval, unsigned long _totalEval) + + + virtual bool + operator() + a1 + (const eoPop< EOT > &_vEO) + + + virtual unsigned long + totalEvaluations + a2 + () + + + virtual std::string + className + a3 + (void) const + + + eoEvalFuncCounter< EOT > & + eval + r0 + + + + unsigned long + repTotalEvaluations + r1 + + + + + eoEvalFunc + classeo_eval_func.html + EOT + eoUF< EOT &, void > + + EOT + EOType + w0 + + + + EOT::Fitness + EOFitT + w1 + + + + + eoEvalFuncCounter + classeo_eval_func_counter.html + EOT + eoEvalFunc + eoValueParam< unsigned long > + + + eoEvalFuncCounter + a0 + (eoEvalFunc< EOT > &_func, std::string _name="Eval. ") + + + virtual void + operator() + a1 + (EOT &_eo) + + + eoEvalFunc< EOT > & + func + r0 + + + + + eoEvalFuncPtr + structeo_eval_func_ptr.html + EOT + FitT + FunctionArg + eoEvalFunc + + + eoEvalFuncPtr + a0 + (FitT(*_eval)(FunctionArg)) + + + virtual void + operator() + a1 + (EOT &_eo) + + + FitT(* + evalFunc + r0 + )(FunctionArg) + + + + eoExpansionMutation + classeo_expansion_mutation.html + FType + Node + eoMonOp< eoParseTree< FType, Node > > + + eoParseTree< FType, Node > + EoType + w0 + + + + + eoExpansionMutation + a0 + (eoInit< EoType > &_init, unsigned _max_length) + + + virtual std::string + className + a1 + () const + + + virtual + ~eoExpansionMutation + a2 + () + + + bool + operator() + a3 + (EoType &_eo1) + + + unsigned + max_length + r0 + + + + eoInit< EoType > & + initializer + r1 + + + + + eoExternalBinOp + classeo_external_bin_op.html + F + External + ExternalEO + eoBinOp< ExternalEO > + + + eoExternalBinOp + a0 + (bool(*_binop)(External &, const External &)) + + + bool + operator() + a1 + (ExternalEO &eo1, const ExternalEO &eo2) + + + bool(* + binop + r0 + )(External &, const External &) + + + + eoExternalEO + classeo_external_e_o.html + Fit + External + EO< Fit > + + + eoExternalEO + a1 + (const External &ext) + + + + eoExternalEO + a2 + (std::istream &is, const External &ext) + + + virtual void + readFrom + a3 + (std::istream &_is) + + + virtual void + printOn + a4 + (std::ostream &_os) const + + + + eoExternalEvalFunc + classeo_external_eval_func.html + F + External + ExternalEO + eoEvalFunc< ExternalEO > + + + eoExternalEvalFunc + a0 + (F(*_eval)(const External &)) + + + void + operator() + a1 + (ExternalEO &eo) + + + F(* + eval + r0 + )(const External &) + + + + eoExternalInit + classeo_external_init.html + F + External + ExternalEO + eoInit< ExternalEO > + + + eoExternalInit + a0 + (External(*_init)(void)) + + + void + operator() + a1 + (ExternalEO &_eo) + + + External(* + init + r0 + )(void) + + + + eoExternalMonOp + classeo_external_mon_op.html + F + External + ExternalEO + eoMonOp< ExternalEO > + + + eoExternalMonOp + a0 + (bool(*_mutate)(External &)) + + + bool + operator() + a1 + (ExternalEO &eo) + + + bool(* + mutate + r0 + )(External &) + + + + eoExternalQuadOp + classeo_external_quad_op.html + F + External + ExternalEO + eoQuadOp< ExternalEO > + + + eoExternalQuadOp + a0 + (bool(*_quadop)(External &, External &)) + + + bool + operator() + a1 + (ExternalEO &eo1, ExternalEO &eo2) + + + bool(* + quadop + r0 + )(External &, External &) + + + + eoF + classeo_f.html + R + eoFunctorBase + + R + result_type + w0 + + + + virtual + ~eoF + a0 + () + + + virtual R + operator() + a1 + ()=0 + + + eoFunctorBase::procedure_tag + functor_category + e0 + () + + + + eoFactory + classeo_factory.html + EOClass + eoObject + + virtual EOClass * + make + a0 + (std::istream &_is)=0 + + + + eoFactory + z11_0 + () + + + virtual + ~eoFactory + z11_1 + () + + + virtual std::string + className + z13_0 + () const + + + + eoFDCFileSnapshot + classeo_f_d_c_file_snapshot.html + EOT + eoFileSnapshot + + + eoFDCFileSnapshot + a0 + (eoFDCStat< EOT > &_FDCstat, std::string _dirname="tmpFDC", unsigned _frequency=1, std::string _filename="FDC", std::string _delim=" ") + + + virtual void + add + a1 + (const eoParam &_param) + + + eoFDCStat< EOT > & + FDCstat + r0 + + + + + eoFDCStat + classeo_f_d_c_stat.html + EOT + eoStat< EOT, double > + + + eoFDCStat + a0 + (eoDistance< EOT > &_dist, std::string _description="FDC") + + + + eoFDCStat + a1 + (eoDistance< EOT > &_dist, EOT &_theBest, std::string _description="FDC") + + + virtual void + operator() + a2 + (const eoPop< EOT > &_pop) + + + const eoValueParam< std::vector< double > > & + theDist + a3 + () + + + const eoValueParam< std::vector< double > > & + theFit + a4 + () + + + eoDistance< EOT > & + dist + r0 + + + + EOT + theBest + r1 + + + + bool + boolOpt + r2 + + + + eoValueParam< std::vector< double > > + distToBest + r3 + + + + eoValueParam< std::vector< double > > + fitnesses + r4 + + + + + eoFileMonitor + classeo_file_monitor.html + eoMonitor + + + eoFileMonitor + a0 + (std::string _filename, std::string _delim=" ", bool _keep=false, bool _header=false) + + + virtual eoMonitor & + operator() + a1 + (void) + + + virtual eoMonitor & + operator() + a2 + (std::ostream &os) + + + void + printHeader + a3 + (void) + + + virtual void + printHeader + a4 + (std::ostream &os) + + + virtual std::string + getFileName + a5 + () + + + std::string + filename + r0 + + + + std::string + delim + r1 + + + + bool + keep + r2 + + + + bool + header + r3 + + + + bool + firstcall + r4 + + + + + eoFileSnapshot + classeo_file_snapshot.html + eoMonitor + + std::vector< double > + vDouble + w0 + + + + eoValueParam< std::vector< double > > + vDoubleParam + w1 + + + + + eoFileSnapshot + a0 + (std::string _dirname, unsigned _frequency=1, std::string _filename="gen", std::string _delim=" ", unsigned _counter=0, bool _rmFiles=true) + + + virtual bool + hasChanged + a1 + () + + + unsigned + getCounter + a2 + () + + + std::string + getFileName + a3 + () + + + void + setCurrentFileName + a4 + () + + + eoMonitor & + operator() + a5 + (void) + + + eoMonitor & + operator() + a6 + (std::ostream &_os) + + + virtual const std::string + getDirName + a7 + () + + + virtual const std::string + baseFileName + a8 + () + + + void + add + a9 + (const eoParam &_param) + + + std::string + dirname + r0 + + + + unsigned + frequency + r1 + + + + std::string + filename + r2 + + + + std::string + delim + r3 + + + + unsigned int + counter + r4 + + + + std::string + currentFileName + r5 + + + + bool + boolChanged + r6 + + + + + eoFitContinue + classeo_fit_continue.html + EOT + eoContinue + + EOT::Fitness + FitnessType + w0 + + + + + eoFitContinue + a0 + (const FitnessType _maximum) + + + virtual bool + operator() + a1 + (const eoPop< EOT > &_pop) + + + virtual std::string + className + a2 + (void) const + + + FitnessType + maximum + r0 + + + + + eoFitnessScalingSelect + classeo_fitness_scaling_select.html + EOT + eoRouletteWorthSelect< EOT, double > + + + eoFitnessScalingSelect + a0 + (double _p=2.0) + + + eoLinearFitScaling< EOT > + scaling + r0 + + + + + eoFitnessStat + classeo_fitness_stat.html + EOT + FitT + eoSortedStat< EOT, std::vector< FitT > > + + + eoFitnessStat + a0 + (std::string _description="AllFitnesses") + + + virtual void + operator() + a1 + (const std::vector< const EOT * > &_popPters) + + + + eoFlOr1ptBinOp + classeo_fl_or1pt_bin_op.html + EOT + eoBinOp< EOT > + + EOT::AtomType + AtomType + w0 + + + + + eoVlUniformBinOp + a0 + () + + + bool + operator() + a1 + (EOT &_eo1, EOT &_eo2) + + + virtual string + className + a2 + () const + + + + eoFlOr1ptQuadOp + classeo_fl_or1pt_quad_op.html + EOT + eoQuadOp< EOT > + + EOT::AtomType + AtomType + w0 + + + + + eoVlUniformQuadOp + a0 + () + + + bool + operator() + a1 + (EOT &_eo1, EOT &_eo2) + + + virtual string + className + a2 + () const + + + + eoFlOrAllAtomBinOp + classeo_fl_or_all_atom_bin_op.html + EOT + eoBinOp< EOT > + + EOT::AtomType + AtomType + w0 + + + + + eoFlOrAllAtomBinOp + a0 + (eoBinOp< AtomType > &_op, float _rate=1.0) + + + bool + operator() + a1 + (EOT &_eo1, const EOT &_eo2) + + + virtual string + className + a2 + () const + + + double + rate + r0 + + + + eoBinOp< AtomType > & + op + r1 + + + + + eoFlOrAllAtomQuadOp + classeo_fl_or_all_atom_quad_op.html + EOT + eoQuadOp< EOT > + + EOT::AtomType + AtomType + w0 + + + + + eoFlOrAllAtomQuadOp + a0 + (eoQuadOp< AtomType > &_op, double _rate=1) + + + bool + operator() + a1 + (EOT &_eo1, EOT &_eo2) + + + virtual string + className + a2 + () const + + + double + rate + r0 + + + + eoQuadOp< AtomType > & + op + r1 + + + + + eoFlOrAllMutation + classeo_fl_or_all_mutation.html + EOT + eoMonOp< EOT > + + EOT::AtomType + AtomType + w0 + + + + + eoFlOrAllMutation + a0 + (eoMonOp< AtomType > &_atomMutation, double _rate=1.0) + + + bool + operator() + a1 + (EOT &_eo) + + + virtual std::string + className + a2 + () const + + + eoMonOp< AtomType > & + atomMutation + r0 + + + + double + rate + r1 + + + + + eoFlOrKAtomBinOp + classeo_fl_or_k_atom_bin_op.html + EOT + eoBinOp< EOT > + + EOT::AtomType + AtomType + w0 + + + + + eoFlOrAtomBinOp + a0 + (eoBinOp< AtomType > &_op, unsigned _k=1) + + + bool + operator() + a1 + (EOT &_eo1, const EOT &_eo2) + + + virtual string + className + a2 + () const + + + unsigned + k + r0 + + + + eoBinOp< AtomType > & + op + r1 + + + + + eoFlOrKAtomQuadOp + classeo_fl_or_k_atom_quad_op.html + EOT + eoQuadOp< EOT > + + EOT::AtomType + AtomType + w0 + + + + + eoFlOrAtomQuadOp + a0 + (eoQuadOp< AtomType > &_op, unsigned _k=1) + + + bool + operator() + a1 + (EOT &_eo1, const EOT &_eo2) + + + virtual string + className + a2 + () const + + + unsigned + k + r0 + + + + eoQuadOp< AtomType > & + op + r1 + + + + + eoFlOrKMutation + classeo_fl_or_k_mutation.html + EOT + eoMonOp< EOT > + + EOT::AtomType + AtomType + w0 + + + + + eoFlOrKMutation + a0 + (eoMonOp< AtomType > &_atomMutation, unsigned _nb=1) + + + bool + operator() + a1 + (EOT &_eo) + + + virtual std::string + className + a2 + () const + + + unsigned + nb + r0 + + + + eoMonOp< AtomType > & + atomMutation + r1 + + + + + eoFlOrUniformBinOp + classeo_fl_or_uniform_bin_op.html + EOT + eoBinOp< EOT > + + EOT::AtomType + AtomType + w0 + + + + + eoFlOrUniformBinOp + a0 + (double _rate=0.5) + + + bool + operator() + a1 + (EOT &_eo1, const EOT &_eo2) + + + virtual string + className + a2 + () const + + + double + rate + r0 + + + + + eoFlOrUniformQuadOp + classeo_fl_or_uniform_quad_op.html + EOT + eoQuadOp< EOT > + + EOT::AtomType + AtomType + w0 + + + + + eoVlUniformQuadOp + a0 + (double _rate=0.5) + + + bool + operator() + a1 + (EOT &_eo1, EOT &_eo2) + + + virtual string + className + a2 + () const + + + double + rate + r0 + + + + + eoFunctorBase + classeo_functor_base.html + + virtual + ~eoFunctorBase + a0 + () + + + + eoFunctorBase::binary_function_tag + structeo_functor_base_1_1binary__function__tag.html + + + eoFunctorBase::procedure_tag + structeo_functor_base_1_1procedure__tag.html + + + eoFunctorBase::unary_function_tag + structeo_functor_base_1_1unary__function__tag.html + + + eoFunctorStore + classeo_functor_store.html + + + eoFunctorStore + a0 + () + + + virtual + ~eoFunctorStore + a1 + () + + + Functor & + storeFunctor + a2 + (Functor *r) + + + + eoFunctorStore + d0 + (const eoFunctorStore &) + + + eoFunctorStore + operator= + d1 + (const eoFunctorStore &) + + + std::vector< eoFunctorBase * > + vec + r0 + + + + + eoG3Replacement + classeo_g3_replacement.html + EOT + eoReplacement + + + eoG3Replacement + a0 + (eoHowMany _howManyEliminatedParents=eoHowMany(2, false)) + + + void + operator() + a1 + (eoPop< EOT > &_parents, eoPop< EOT > &_offspring) + + + eoLinearTruncateSplit< EOT > + split + r0 + + + + eoTruncateSplit< EOT > + reduce + r1 + + + + eoPlus< EOT > + plus + r2 + + + + + eoGenContinue + classeo_gen_continue.html + EOT + eoContinue + eoValueParam< unsigned > + + + eoGenContinue + a0 + (unsigned long _totalGens) + + + + eoGenContinue + a1 + (unsigned long _totalGens, unsigned long &_currentGen) + + + virtual bool + operator() + a2 + (const eoPop< EOT > &_vEO) + + + virtual void + totalGenerations + a3 + (unsigned long _tg) + + + virtual unsigned long + totalGenerations + a4 + () + + + virtual std::string + className + a5 + (void) const + + + void + readFrom + a6 + (std::istream &__is) + + + void + printOn + a7 + (std::ostream &__os) const + + + bool + verbose + o0 + + + + unsigned long + repTotalGenerations + r0 + + + + unsigned long + thisGenerationPlaceHolder + r1 + + + + unsigned long & + thisGeneration + r2 + + + + + eoGeneDelChooser + classeo_gene_del_chooser.html + EOT + eoUF< EOT &, unsigned int > + + virtual std::string + className + a0 + () const =0 + + + + eoGeneralBreeder + classeo_general_breeder.html + EOT + eoBreed + + + eoGeneralBreeder + a0 + (eoSelectOne< EOT > &_select, eoGenOp< EOT > &_op, double _rate=1.0, bool _interpret_as_rate=true) + + + + eoGeneralBreeder + a1 + (eoSelectOne< EOT > &_select, eoGenOp< EOT > &_op, eoHowMany _howMany) + + + void + operator() + a2 + (const eoPop< EOT > &_parents, eoPop< EOT > &_offspring) + + + virtual std::string + className + a3 + () const + + + eoSelectOne< EOT > & + select + r0 + + + + eoGenOp< EOT > & + op + r1 + + + + eoHowMany + howMany + r2 + + + + + eoGeneralIntBounds + classeo_general_int_bounds.html + eoIntBounds + + + eoGeneralIntBounds + a0 + (std::string _s="[-infinity,+infinity]") + + + + eoGeneralIntBounds + a1 + (const eoGeneralIntBounds &_b) + + + eoGeneralIntBounds & + operator= + a2 + (const eoGeneralIntBounds &_b) + + + + ~eoGeneralIntBounds + a3 + () + + + virtual bool + isBounded + a4 + (void) const + + + virtual bool + hasNoBoundAtAll + a5 + (void) const + + + virtual bool + isMinBounded + a6 + (void) const + + + virtual bool + isMaxBounded + a7 + (void) const + + + virtual bool + isInBounds + a8 + (double _x) const + + + virtual void + foldsInBounds + a9 + (double &_x) const + + + virtual void + truncate + a10 + (double &_x) const + + + virtual long int + minimum + a11 + () const + + + virtual long int + maximum + a12 + () const + + + virtual long int + range + a13 + () const + + + virtual double + uniform + a14 + (eoRng &_rng=eo::rng) const + + + virtual long int + random + a15 + (eoRng &_rng=eo::rng) const + + + virtual eoIntBounds * + dup + a16 + () const + + + const eoIntBounds & + theBounds + a17 + () const + + + virtual void + printOn + a18 + (std::ostream &_os) const + + + virtual void + readFrom + a19 + (std::istream &_is) + + + eoIntBounds * + getBoundsFromString + d0 + (std::string) + + + eoIntBounds * + repBound + r0 + + + + + eoGeneralRealBounds + classeo_general_real_bounds.html + eoRealBounds + + + eoGeneralRealBounds + a0 + (std::string _s="[-infinity,+infinity]") + + + + eoGeneralRealBounds + a1 + (const eoGeneralRealBounds &_b) + + + eoGeneralRealBounds & + operator= + a2 + (const eoGeneralRealBounds &_b) + + + + ~eoGeneralRealBounds + a3 + () + + + virtual bool + isBounded + a4 + (void) const + + + virtual bool + hasNoBoundAtAll + a5 + (void) const + + + virtual bool + isMinBounded + a6 + (void) const + + + virtual bool + isMaxBounded + a7 + (void) const + + + virtual bool + isInBounds + a8 + (double _x) const + + + virtual void + foldsInBounds + a9 + (double &_x) const + + + virtual void + truncate + a10 + (double &_x) const + + + virtual double + minimum + a11 + () const + + + virtual double + maximum + a12 + () const + + + virtual double + range + a13 + () const + + + virtual double + uniform + a14 + (eoRng &_rng=eo::rng) const + + + virtual eoRealBounds * + dup + a15 + () const + + + const eoRealBounds & + theBounds + a16 + () const + + + virtual void + printOn + a17 + (std::ostream &_os) const + + + virtual void + readFrom + a18 + (std::istream &_is) + + + eoRealBounds * + getBoundsFromString + d0 + (std::string) + + + eoRealBounds * + repBound + r0 + + + + + eoGenerationalReplacement + classeo_generational_replacement.html + EOT + eoReplacement + + void + operator() + a0 + (eoPop< EOT > &_parents, eoPop< EOT > &_offspring) + + + + eoGenOp + classeo_gen_op.html + EOT + eoOp< EOT > + eoUF< eoPopulator< EOT > &, void > + + + eoGenOp + a0 + () + + + virtual unsigned + max_production + a1 + (void)=0 + + + virtual std::string + className + a2 + () const =0 + + + void + operator() + a3 + (eoPopulator< EOT > &_pop) + + + virtual void + apply + b0 + (eoPopulator< EOT > &_pop)=0 + + + + eoGnuplot + classeo_gnuplot.html + + + eoGnuplot + a0 + (std::string _title, std::string _extra=std::string("")) + + + virtual + ~eoGnuplot + a1 + () + + + virtual std::string + className + a2 + () const + + + void + gnuplotCommand + a3 + (const char *_command) + + + void + gnuplotCommand + a4 + (std::string _command) + + + void + initGnuPlot + b0 + (std::string _title, std::string _extra) + + + bool + firstTime + p0 + + + + PCom * + gpCom + p1 + + + + unsigned + numWindow + t0 + + + + + eoGnuplot1DMonitor + classeo_gnuplot1_d_monitor.html + eoFileMonitor + eoGnuplot + + + eoGnuplot1DMonitor + a0 + (std::string _filename, bool _top=false) + + + virtual + ~eoGnuplot1DMonitor + a1 + () + + + virtual eoMonitor & + operator() + a2 + () + + + virtual void + FirstPlot + a3 + () + + + virtual std::string + className + a4 + () const + + + + eoGnuplot1DSnapshot + classeo_gnuplot1_d_snapshot.html + eoFileSnapshot + eoGnuplot + + + eoGnuplot1DSnapshot + a0 + (std::string _dirname, unsigned _frequency=1, std::string _filename="gen", std::string _delim=" ", unsigned _counter=0, bool _rmFiles=true) + + + + eoGnuplot1DSnapshot + a1 + (std::string _dirname, eoRealVectorBounds &_bounds, unsigned _frequency=1, std::string _filename="gen", std::string _delim=" ", unsigned _counter=0, bool _rmFiles=true) + + + + eoGnuplot1DSnapshot + a2 + (eoFileSnapshot &_fSnapshot) + + + + eoGnuplot1DSnapshot + a3 + (eoFileSnapshot &_fSnapshot, eoRealVectorBounds &_bounds) + + + virtual eoMonitor & + operator() + a5 + () + + + virtual std::string + className + a6 + () const + + + virtual void + handleBounds + a7 + (eoRealVectorBounds &_bounds) + + + void + setPointSize + a8 + (unsigned _pointSize) + + + unsigned + pointSize + p0 + + + + + eoHammingDistance + classeo_hamming_distance.html + EOT + eoDistance + + double + operator() + a0 + (const EOT &_v1, const EOT &_v2) + + + + eoHoistMutation + classeo_hoist_mutation.html + FType + Node + eoMonOp< eoParseTree< FType, Node > > + + eoParseTree< FType, Node > + EoType + w0 + + + + + eoHoistMutation + a0 + () + + + virtual std::string + className + a1 + () const + + + virtual + ~eoHoistMutation + a2 + () + + + bool + operator() + a3 + (EoType &_eo1) + + + + eoHowMany + classeo_how_many.html + eoPersistent + + + eoHowMany + a0 + (double _rate=0.0, bool _interpret_as_rate=true) + + + + eoHowMany + a1 + (int _combien) + + + + eoHowMany + a2 + (unsigned int _combien) + + + virtual + ~eoHowMany + a3 + () + + + unsigned int + operator() + a4 + (unsigned int _size) + + + virtual void + printOn + a5 + (std::ostream &_os) const + + + virtual void + readFrom + a6 + (std::istream &_is) + + + void + readFrom + a7 + (std::string _value) + + + eoHowMany + operator- + a8 + () + + + double + rate + r0 + + + + int + combien + r1 + + + + + eoIncrementor + classeo_incrementor.html + T + eoUpdater + + + eoIncrementor + a0 + (T &_counter, T _stepsize=1) + + + virtual void + operator() + a1 + () + + + virtual std::string + className + a2 + (void) const + + + T & + counter + r0 + + + + T + stepsize + r1 + + + + + eoIncrementorParam + classeo_incrementor_param.html + T + eoUpdater + eoValueParam< T > + + + eoIncrementorParam + a0 + (std::string _name, T _stepsize=1) + + + + eoIncrementorParam + a1 + (std::string _name, T _countValue, T _stepsize) + + + virtual void + operator() + a2 + () + + + virtual std::string + className + a3 + (void) const + + + T + stepsize + r0 + + + + + eoInit + classeo_init.html + EOT + eoUF< EOT &, void > + + virtual std::string + className + a0 + (void) const + + + + eoInitAdaptor + classeo_init_adaptor.html + EOT + eoMonOp< EOT > + + + eoInitAdaptor + a0 + (eoInit< EOT > &_init) + + + bool + operator() + a1 + (EOT &_eot) + + + eoInit< EOT > & + init + r0 + + + + + eoInitFixedLength + classeo_init_fixed_length.html + EOT + eoInit + + EOT::AtomType + AtomType + w0 + + + + + eoInitFixedLength + a0 + (unsigned _combien, eoRndGenerator< AtomType > &_generator) + + + virtual void + operator() + a1 + (EOT &chrom) + + + unsigned + combien + r0 + + + + eoSTLF< AtomType > + generator + r1 + + + + + eoInitGenerator + classeo_init_generator.html + EOT + eoF< EOT > + + + eoInitGenerator + a0 + (eoInit< EOT > &_init) + + + virtual EOT + operator() + a1 + () + + + eoInit< EOT > & + init + r0 + + + + + eoInitVariableLength + classeo_init_variable_length.html + EOT + eoInit + + EOT::AtomType + AtomType + w0 + + + + + eoInitVariableLength + a0 + (unsigned _minSize, unsigned _maxSize, eoInit< AtomType > &_init) + + + virtual void + operator() + a1 + (EOT &_chrom) + + + eoInit< AtomType > & + atomInit + a2 + () + + + unsigned + offset + r0 + + + + unsigned + extent + r1 + + + + eoInit< AtomType > & + init + r2 + + + + + eoInitVirus + classeo_init_virus.html + FitT + eoInit< eoVirus< FitT > > + + + eoInitVirus + a0 + (unsigned _combien, eoRndGenerator< bool > &_generator) + + + virtual void + operator() + a1 + (eoVirus< FitT > &chrom) + + + unsigned + combien + r0 + + + + eoSTLF< bool > + generator + r1 + + + + + eoInitVirus1bit + classeo_init_virus1bit.html + FitT + eoInit< eoVirus< FitT > > + + + eoInitVirus1bit + a0 + (unsigned _combien, eoRndGenerator< bool > &_generator) + + + virtual void + operator() + a1 + (eoVirus< FitT > &chrom) + + + unsigned + combien + r0 + + + + eoSTLF< bool > + generator + r1 + + + + + eoInnerExchangeQuadOp + classeo_inner_exchange_quad_op.html + EOT + eoQuadOp< EOT > + + EOT::AtomType + AtomType + w0 + + + + + eoInnerExchangeQuadOp + a0 + (eoQuadOp< AtomType > &_op, float _rate=0.5) + + + bool + operator() + a1 + (EOT &_eo1, EOT &_eo2) + + + virtual std::string + className + a2 + () const + + + float + rate + r0 + + + + eoQuadOp< AtomType > & + op + r1 + + + + + eoIntAboveBound + classeo_int_above_bound.html + eoIntBounds + + + eoIntAboveBound + a1 + (long int _max=0) + + + virtual long int + maximum + a2 + () const + + + virtual long int + minimum + a3 + () const + + + virtual long int + range + a4 + () const + + + virtual double + uniform + a5 + (eoRng &_rng=eo::rng) const + + + virtual long int + random + a6 + (eoRng &_rng=eo::rng) const + + + virtual bool + isBounded + a7 + (void) const + + + virtual bool + hasNoBoundAtAll + a8 + (void) const + + + virtual bool + isMinBounded + a9 + (void) const + + + virtual bool + isMaxBounded + a10 + (void) const + + + virtual bool + isInBounds + a11 + (double _r) const + + + virtual void + foldsInBounds + a12 + (double &_r) const + + + virtual void + truncate + a13 + (double &_r) const + + + virtual void + readFrom + a14 + (std::istream &_is) + + + virtual void + printOn + a15 + (std::ostream &_os) const + + + virtual eoIntBounds * + dup + a16 + () const + + + long int + repMaximum + r0 + + + + + eoIntBelowBound + classeo_int_below_bound.html + eoIntBounds + + + eoIntBelowBound + a1 + (long int _min=0) + + + virtual long int + minimum + a2 + () const + + + virtual long int + maximum + a3 + () const + + + virtual long int + range + a4 + () const + + + virtual double + uniform + a5 + (eoRng &_rng=eo::rng) const + + + virtual long int + random + a6 + (eoRng &_rng=eo::rng) const + + + virtual bool + isBounded + a7 + (void) const + + + virtual bool + hasNoBoundAtAll + a8 + (void) const + + + virtual bool + isMinBounded + a9 + (void) const + + + virtual bool + isMaxBounded + a10 + (void) const + + + virtual bool + isInBounds + a11 + (double _r) const + + + virtual void + foldsInBounds + a12 + (double &_r) const + + + virtual void + truncate + a13 + (double &_r) const + + + virtual void + readFrom + a14 + (std::istream &_is) + + + virtual void + printOn + a15 + (std::ostream &_os) const + + + virtual eoIntBounds * + dup + a16 + () const + + + long int + repMinimum + r0 + + + + + eoIntBounds + classeo_int_bounds.html + eoPersistent + + virtual bool + isBounded + a1 + (void) const =0 + + + virtual bool + hasNoBoundAtAll + a2 + (void) const =0 + + + virtual bool + isMinBounded + a3 + (void) const =0 + + + virtual bool + isMaxBounded + a4 + (void) const =0 + + + virtual bool + isInBounds + a5 + (double) const =0 + + + virtual void + foldsInBounds + a6 + (double &) const =0 + + + virtual void + foldsInBounds + a7 + (long int &i) const + + + virtual void + truncate + a8 + (double &) const =0 + + + virtual void + truncate + a9 + (long int &i) const + + + virtual long int + minimum + a10 + () const =0 + + + virtual long int + maximum + a11 + () const =0 + + + virtual long int + range + a12 + () const =0 + + + virtual double + uniform + a13 + (eoRng &_rng=eo::rng) const =0 + + + virtual long int + random + a14 + (eoRng &_rng=eo::rng) const =0 + + + virtual eoIntBounds * + dup + a15 + () const =0 + + + + eoIntInterval + classeo_int_interval.html + eoIntBounds + + + eoIntInterval + a1 + (long int _min=0, long int _max=1) + + + virtual long int + minimum + a2 + () const + + + virtual long int + maximum + a3 + () const + + + virtual long int + range + a4 + () const + + + virtual bool + isBounded + a5 + (void) const + + + virtual bool + hasNoBoundAtAll + a6 + (void) const + + + virtual bool + isMinBounded + a7 + (void) const + + + virtual bool + isMaxBounded + a8 + (void) const + + + virtual double + uniform + a9 + (eoRng &_rng=eo::rng) const + + + virtual long int + random + a10 + (eoRng &_rng=eo::rng) const + + + virtual bool + isInBounds + a11 + (double _r) const + + + virtual void + foldsInBounds + a12 + (double &_r) const + + + virtual void + truncate + a13 + (double &_r) const + + + virtual void + readFrom + a14 + (std::istream &_is) + + + virtual void + printOn + a15 + (std::ostream &_os) const + + + virtual eoIntBounds * + dup + a16 + () const + + + long int + repMinimum + r0 + + + + long int + repMaximum + r1 + + + + long int + repRange + r2 + + + + + eoIntNoBounds + classeo_int_no_bounds.html + eoIntBounds + + virtual bool + isBounded + a1 + (void) const + + + virtual bool + hasNoBoundAtAll + a2 + (void) const + + + virtual bool + isMinBounded + a3 + (void) const + + + virtual bool + isMaxBounded + a4 + (void) const + + + virtual void + foldsInBounds + a5 + (double &) const + + + virtual void + truncate + a6 + (double &) const + + + virtual bool + isInBounds + a7 + (double) const + + + virtual long int + minimum + a8 + () const + + + virtual long int + maximum + a9 + () const + + + virtual long int + range + a10 + () const + + + virtual double + uniform + a11 + (eoRng &_rng=eo::rng) const + + + virtual long int + random + a12 + (eoRng &_rng=eo::rng) const + + + virtual void + readFrom + a13 + (std::istream &_is) + + + virtual void + printOn + a14 + (std::ostream &_os) const + + + virtual eoIntBounds * + dup + a15 + () const + + + + eoInvalidateBinOp + classeo_invalidate_bin_op.html + EOT + eoBinOp< EOT > + + + eoInvalidateBinOp + a0 + (eoBinOp< EOT > &_op) + + + bool + operator() + a1 + (EOT &_eo, const EOT &_eo2) + + + eoBinOp< EOT > & + op + r0 + + + + + eoInvalidateMonOp + classeo_invalidate_mon_op.html + EOT + eoMonOp< EOT > + + + eoInvalidateMonOp + a0 + (eoMonOp< EOT > &_op) + + + bool + operator() + a1 + (EOT &_eo) + + + eoMonOp< EOT > & + op + r0 + + + + + eoInvalidateQuadOp + classeo_invalidate_quad_op.html + EOT + eoQuadOp< EOT > + + + eoInvalidateQuadOp + a0 + (eoQuadOp< EOT > &_op) + + + bool + operator() + a1 + (EOT &_eo1, EOT &_eo2) + + + eoQuadOp< EOT > & + op + r0 + + + + + eoLinearFitScaling + classeo_linear_fit_scaling.html + EOT + eoPerf2Worth< EOT > + + + eoLinearFitScaling + a0 + (double _p=2.0) + + + virtual void + operator() + a1 + (const eoPop< EOT > &_pop) + + + double + pressure + r0 + + + + + eoLinearRandomSplit + classeo_linear_random_split.html + EOT + eoReduceSplit + + + eoLinearRandomSplit + a0 + (eoHowMany _howMany, bool _returnEliminated=false) + + + void + operator() + a1 + (eoPop< EOT > &_newgen, eoPop< EOT > &_eliminated) + + + eoHowMany + howMany + r0 + + + + bool + returnEliminated + r1 + + + + + eoLinearTruncate + classeo_linear_truncate.html + EOT + eoReduce + + void + operator() + d0 + (eoPop< EOT > &_newgen, unsigned _newsize) + + + + eoLinearTruncateSplit + classeo_linear_truncate_split.html + EOT + eoReduceSplit + + + eoLinearTruncateSplit + a0 + (eoHowMany _howMany, bool _returnEliminated=false) + + + void + operator() + a1 + (eoPop< EOT > &_newgen, eoPop< EOT > &_eliminated) + + + eoHowMany + howMany + r0 + + + + bool + returnEliminated + r1 + + + + + MemPool + class_mem_pool.html + + + MemPool + a0 + (unsigned int sz) + + + void * + allocate + a2 + () + + + void + deallocate + a3 + (void *b) + + + void + grow + d0 + () + + + Chunk * + chunks + r0 + + + + const unsigned int + esize + r1 + + + + Link * + head + r2 + + + + + eoMerge + classeo_merge.html + Chrom + eoBF< const eoPop< Chrom > &, eoPop< Chrom > &, void > + + + eoMergeReduce + classeo_merge_reduce.html + EOT + eoReplacement + + + eoMergeReduce + a0 + (eoMerge< EOT > &_merge, eoReduce< EOT > &_reduce) + + + void + operator() + a1 + (eoPop< EOT > &_parents, eoPop< EOT > &_offspring) + + + eoMerge< EOT > & + merge + r0 + + + + eoReduce< EOT > & + reduce + r1 + + + + + eoMGGReplacement + classeo_m_g_g_replacement.html + EOT + eoReplacement + + + eoMGGReplacement + a0 + (eoHowMany _howManyEliminatedParents=eoHowMany(2, false), unsigned _tSize=2) + + + void + operator() + a1 + (eoPop< EOT > &_parents, eoPop< EOT > &_offspring) + + + eoLinearTruncateSplit< EOT > + split + r0 + + + + eoPlus< EOT > + plus + r1 + + + + unsigned int + tSize + r2 + + + + + MinimizingTraits + class_minimizing_traits.html + eoParetoFitnessTraits + + bool + maximizing + e0 + (int) + + + + eoMOFitnessStat + classeo_m_o_fitness_stat.html + EOT + PartFitT + eoSortedStat< EOT, std::vector< PartFitT > > + + + eoMOFitnessStat + a0 + (unsigned _objective, std::string _description="MO-Fitness") + + + virtual void + operator() + a1 + (const std::vector< const EOT * > &_popPters) + + + unsigned int + objective + r0 + + + + + eoMonCloneOp + classeo_mon_clone_op.html + EOT + eoMonOp< EOT > + + + eoMonCloneOp + a0 + () + + + virtual std::string + className + a1 + () const + + + virtual bool + operator() + a2 + (EOT &) + + + + eoMonGenOp + classeo_mon_gen_op.html + EOT + eoGenOp + + + eoMonGenOp + a0 + (eoMonOp< EOT > &_op) + + + unsigned + max_production + a1 + (void) + + + void + apply + a2 + (eoPopulator< EOT > &_it) + + + virtual std::string + className + a3 + () const + + + eoMonOp< EOT > & + op + r0 + + + + + eoMonitor + classeo_monitor.html + eoF< eoMonitor & > + + virtual void + lastCall + a0 + () + + + virtual void + add + a1 + (const eoParam &_param) + + + virtual std::string + className + a2 + (void) const + + + std::vector< const eoParam * >::iterator + iterator + x0 + + + + std::vector< const eoParam * > + vec + p0 + + + + + eoMonOp + classeo_mon_op.html + EOType + eoOp + eoUF< EOType &, bool > + + + eoMonOp + a0 + () + + + virtual std::string + className + a1 + () const + + + + eoNDPlusReplacement + classeo_n_d_plus_replacement.html + EOT + WorthT + eoReplacement + eoReplacement + + + eoNDPlusReplacement + a0 + (eoPerf2Worth< EOT, WorthT > &_perf2worth) + + + void + operator() + a1 + (eoPop< EOT > &_parents, eoPop< EOT > &_offspring) + + + + eoNDPlusReplacement + a2 + (eoPerf2Worth< EOT, WorthT > &_perf2worth) + + + void + operator() + a3 + (eoPop< EOT > &_parents, eoPop< EOT > &_offspring) + + + eoPerf2Worth< EOT, WorthT > & + perf2worth + r0 + + + + eoPerf2Worth< EOT, WorthT > & + perf2worth + r1 + + + + + eoNDSorting + classeo_n_d_sorting.html + EOT + eoPerf2WorthCached< EOT, double > + + + eoNDSorting + a0 + (bool nasty_flag_=false) + + + virtual std::vector< double > + niche_penalty + a2 + (const std::vector< unsigned > &current_front, const eoPop< EOT > &_pop)=0 + + + void + calculate_worths + a3 + (const eoPop< EOT > &_pop) + + + bool + nasty_declone_flag_that_only_is_implemented_for_two_objectives + o0 + + + + void + one_objective + d0 + (const eoPop< EOT > &_pop) + + + void + two_objectives + d1 + (const eoPop< EOT > &_pop) + + + void + m_objectives + d2 + (const eoPop< EOT > &_pop) + + + void + rank_to_worth + d3 + () + + + + eoNDSorting::DummyEO + classeo_n_d_sorting_1_1_dummy_e_o.html + EO< EOT::Fitness > + + unsigned + index + o0 + + + + + eoNDSorting_I + classeo_n_d_sorting___i.html + EOT + eoNDSorting + + + eoNDSorting_I + a0 + (double _nicheSize, bool nasty_flag_=false) + + + std::vector< double > + niche_penalty + a1 + (const std::vector< unsigned > &current_front, const eoPop< EOT > &_pop) + + + double + nicheSize + r0 + + + + + eoNDSorting_II + classeo_n_d_sorting___i_i.html + EOT + eoNDSorting + + std::pair< double, unsigned > + double_index_pair + w0 + + + + + eoNDSorting_II + a0 + (bool nasty_flag_=false) + + + std::vector< double > + niche_penalty + a1 + (const std::vector< unsigned > &_cf, const eoPop< EOT > &_pop) + + + + negexp_generator + classnegexp__generator.html + T + + + negexp_generator + a0 + (T _mean=1.0, eoRng &_rng=rng) + + + T + operator() + a1 + (void) + + + T + mean + r0 + + + + eoRng & + negexp + r1 + + + + + eoNegExpGenerator + classeo_neg_exp_generator.html + T + eoRndGenerator + + + eoNegExpGenerator + a0 + (T _mean=1.0, eoRng &_rng=rng) + + + T + operator() + a1 + (void) + + + T + mean + r0 + + + + eoRng & + negexp + r1 + + + + + eoNegExpInit + classeo_neg_exp_init.html + T + eoInit< T > + + + eoNegExpInit + a0 + (T _mean=1.0, eoRng &_rng=rng) + + + void + operator() + a1 + (T &_t) + + + T + mean + r0 + + + + eoRng & + negexp + r1 + + + + + NodeSelector + class_node_selector.html + + virtual NodeSelection + select_node + a1 + (Sym sym) const =0 + + + + eoNoElitism + classeo_no_elitism.html + EOT + eoElitism + + + eoNoPerf2Worth + classeo_no_perf2_worth.html + EOT + eoPerf2Worth< EOT, EOT::Fitness > + + void + operator() + a0 + (const eoPop< EOT > &_pop) + + + + normal_generator + classnormal__generator.html + T + + + normal_generator + a0 + (T _stdev=T(1.0), eoRng &_rng=rng) + + + T + operator() + a1 + (void) + + + T + stdev + r0 + + + + eoRng & + normal + r1 + + + + + eoNormalGenerator + classeo_normal_generator.html + T + eoRndGenerator + + + eoNormalGenerator + a0 + (T _stdev=T(1.0), eoRng &_rng=rng) + + + T + operator() + a1 + (void) + + + T + stdev + r0 + + + + eoRng & + normal + r1 + + + + + eoNormalInit + classeo_normal_init.html + T + eoInit< T > + + + eoNormalInit + a0 + (T _stdev=T(1.0), eoRng &_rng=rng) + + + void + operator() + a1 + (T &_t) + + + T + stdev + r0 + + + + eoRng & + normal + r1 + + + + + eoNormalMutation + classeo_normal_mutation.html + EOT + eoMonOp< EOT > + + + eoNormalMutation + a0 + (double &_sigma, const double &_p_change=1.0) + + + + eoNormalMutation + a1 + (eoRealVectorBounds &_bounds, double _sigma, const double &_p_change=1.0) + + + virtual std::string + className + a2 + () const + + + bool + operator() + a3 + (EOT &_eo) + + + double & + Sigma + a4 + () + + + double & + sigma + r0 + + + + eoRealVectorBounds & + bounds + r1 + + + + double + p_change + r2 + + + + + eoNormalVecMutation + classeo_normal_vec_mutation.html + EOT + eoMonOp< EOT > + + + eoNormalVecMutation + a0 + (double _sigma, const double &_p_change=1.0) + + + + eoNormalVecMutation + a1 + (eoRealVectorBounds &_bounds, double _sigma, const double &_p_change=1.0) + + + virtual std::string + className + a2 + () const + + + bool + operator() + a3 + (EOT &_eo) + + + std::vector< double > + sigma + r0 + + + + eoRealVectorBounds & + bounds + r1 + + + + double + p_change + r2 + + + + + eoNoSelect + classeo_no_select.html + EOT + eoSelectOne< EOT > + + + eoNoSelect + a0 + () + + + virtual const EOT & + operator() + a1 + (const eoPop< EOT > &_pop) + + + unsigned + current + r0 + + + + + eoNPtsBitXover + classeo_n_pts_bit_xover.html + Chrom + eoQuadOp< Chrom > + + + eoNPtsBitXover + a0 + (const unsigned &_num_points=2) + + + virtual std::string + className + a1 + () const + + + bool + operator() + a2 + (Chrom &chrom1, Chrom &chrom2) + + + unsigned + num_points + r0 + + + + + eoNthElementFitnessStat + classeo_nth_element_fitness_stat.html + EOT + eoSortedStat< EOT, EOT::Fitness > + + EOT::Fitness + Fitness + w0 + + + + + eoNthElementFitnessStat + a0 + (unsigned _whichElement, std::string _description="nth element fitness") + + + virtual void + operator() + a1 + (const std::vector< const EOT * > &_pop) + + + virtual std::string + className + a2 + (void) const + + + void + doit + d0 + (const eoPop< EOT > &_pop, eoParetoFitness< T >) + + + void + doit + d1 + (const std::vector< const EOT * > &_pop, T) + + + unsigned + whichElement + r0 + + + + + eoObject + classeo_object.html + + virtual + ~eoObject + a0 + () + + + virtual std::string + className + a1 + () const =0 + + + + eoOneFifthMutation + classeo_one_fifth_mutation.html + EOT + eoNormalMutation + eoUpdatable + + EOT::Fitness + Fitness + w0 + + + + + eoOneFifthMutation + a0 + (eoEvalFunc< EOT > &_eval, double &_sigmaInit, unsigned _windowSize=10, double _updateFactor=0.83, double _threshold=0.2) + + + virtual std::string + className + a1 + () const + + + bool + operator() + a2 + (EOT &_eo) + + + void + update + a3 + () + + + eoEvalFunc< EOT > & + eval + r0 + + + + double + threshold + r1 + + + + double + updateFactor + r2 + + + + std::vector< unsigned > + nbMut + r3 + + + + std::vector< unsigned > + nbSuccess + r4 + + + + unsigned + genIndex + r5 + + + + + eoOneMax + classeo_one_max.html + FitT + EO< FitT > + + + eoOneMax + a0 + () + + + virtual string + className + a2 + () const + + + void + printOn + a3 + (ostream &_os) const + + + void + readFrom + a4 + (istream &_is) + + + void + setB + a5 + (vector< bool > &_b) + + + const vector< bool > & + B + a6 + () + + + std::vector< bool > + b + r0 + + + + + eoOneMaxEvalFunc + classeo_one_max_eval_func.html + EOT + eoEvalFunc + + + eoOneMaxEvalFunc + a0 + () + + + void + operator() + a1 + (EOT &_eo) + + + + eoOneMaxInit + classeo_one_max_init.html + GenotypeT + eoInit< GenotypeT > + + + eoOneMaxInit + a0 + (unsigned _vecSize) + + + void + operator() + a1 + (GenotypeT &_genotype) + + + unsigned + vecSize + r0 + + + + + eoOneMaxMutation + classeo_one_max_mutation.html + GenotypeT + eoMonOp< GenotypeT > + + + eoOneMaxMutation + a0 + () + + + string + className + a1 + () const + + + bool + operator() + a2 + (GenotypeT &_genotype) + + + + eoOneMaxQuadCrossover + classeo_one_max_quad_crossover.html + GenotypeT + eoQuadOp< GenotypeT > + + + eoOneMaxQuadCrossover + a0 + () + + + string + className + a1 + () const + + + bool + operator() + a2 + (GenotypeT &_genotype1, GenotypeT &_genotype2) + + + + eoOp + classeo_op.html + EOType + + + eoOp + z14_1 + (OpType _type) + + + + eoOp + z14_2 + (const eoOp &_eop) + + + virtual + ~eoOp + z14_3 + () + + + OpType + getType + z14_4 + () const + + + OpType + opType + z14_5 + + + + + eoOpContainer + classeo_op_container.html + EOT + eoGenOp + + + eoOpContainer + a0 + () + + + virtual + ~eoOpContainer + a1 + (void) + + + virtual unsigned + max_production + a2 + (void) + + + void + add + a3 + (eoOp< EOT > &_op, double _rate) + + + virtual std::string + className + a4 + () const =0 + + + std::vector< double > + rates + p0 + + + + std::vector< eoGenOp< EOT > * > + ops + p1 + + + + eoFunctorStore + store + r0 + + + + unsigned + max_to_produce + r1 + + + + + eoOpSelMason + classeo_op_sel_mason.html + eoClass + eoFactory< eoOpSelector< eoClass > > + + std::vector< eoOp< eoClass > * > + vOpP + w0 + + + + map< eoOpSelector< eoClass > *, vOpP > + MEV + w1 + + + + virtual eoOpSelector< eoClass > * + make + a0 + (std::istream &_is) + + + + eoOpSelMason + z15_0 + (eoOpFactory< eoClass > &_opFact) + + + virtual + ~eoOpSelMason + z15_1 + () + + + virtual std::string + className + z17_0 + () const + + + map< eoOpSelector< eoClass > *, std::vector< eoOp< eoClass > * > > + allocMap + r0 + + + + eoOpFactory< eoClass > & + operatorFactory + r1 + + + + + eoParam + classeo_param.html + + + eoParam + a0 + () + + + + eoParam + a1 + (std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false) + + + virtual + ~eoParam + a2 + () + + + virtual std::string + getValue + a3 + () const =0 + + + virtual void + setValue + a4 + (const std::string &_value)=0 + + + char + shortName + a5 + () const + + + const std::string & + longName + a6 + () const + + + const std::string & + description + a7 + () const + + + const std::string & + defValue + a8 + () const + + + void + defValue + a9 + (const std::string &str) + + + void + setLongName + a10 + (std::string _longName) + + + bool + required + a11 + () const + + + std::string + repLongName + r0 + + + + std::string + repDefault + r1 + + + + std::string + repDescription + r2 + + + + char + repShortHand + r3 + + + + bool + repRequired + r4 + + + + + eoParameterLoader + classeo_parameter_loader.html + + virtual + ~eoParameterLoader + a0 + () + + + virtual void + processParam + a1 + (eoParam &param, std::string section="")=0 + + + virtual bool + isItThere + a2 + (eoParam &_param) const =0 + + + eoValueParam< ValueType > & + createParam + a3 + (ValueType _defaultValue, std::string _longName, std::string _description, char _shortHand=0, std::string _section="", bool _required=false) + + + std::vector< eoParam * > + ownedParams + r0 + + + + + eoParamParamType + classeo_param_param_type.html + + + eoParamParamType + a0 + (std::string _value) + + + std::ostream & + printOn + a1 + (std::ostream &_os) const + + + std::istream & + readFrom + a2 + (std::istream &_is) + + + void + readFrom + a3 + (std::string &_value) + + + + eoParetoFitness + classeo_pareto_fitness.html + FitnessTraits + + FitnessTraits + fitness_traits + w0 + + + + + eoParetoFitness + a1 + (std::vector< double > &_v) + + + bool + dominates + a2 + (const eoParetoFitness< FitnessTraits > &_other) const + + + bool + operator< + a3 + (const eoParetoFitness< FitnessTraits > &_other) const + + + bool + operator> + a4 + (const eoParetoFitness< FitnessTraits > &_other) const + + + bool + operator<= + a5 + (const eoParetoFitness< FitnessTraits > &_other) const + + + bool + operator>= + a6 + (const eoParetoFitness< FitnessTraits > &_other) const + + + bool + operator== + a7 + (const eoParetoFitness< FitnessTraits > &_other) const + + + bool + operator!= + a8 + (const eoParetoFitness< FitnessTraits > &_other) const + + + void + setUp + e0 + (unsigned _n, std::vector< bool > &_b) + + + bool + maximizing + e1 + (unsigned _i) + + + + eoParetoFitnessTraits + classeo_pareto_fitness_traits.html + + unsigned + nObjectives + e0 + () + + + double + tol + e1 + () + + + bool + maximizing + e2 + (int which) + + + + eoParetoOneConstraintFitness + classeo_pareto_one_constraint_fitness.html + FitnessTraits + + FitnessTraits + fitness_traits + w0 + + + + + eoParetoOneConstraintFitness + a1 + (std::vector< double > &_v) + + + + eoParetoOneConstraintFitness + a2 + (std::vector< double > &_v, double _c) + + + bool + feasible + a3 + () const + + + double + violation + a4 + () const + + + double + ConstraintValue + a5 + () const + + + void + ConstraintValue + a6 + (double _c) + + + bool + dominates + a7 + (const eoParetoOneConstraintFitness< FitnessTraits > &_other) const + + + bool + operator< + a8 + (const eoParetoOneConstraintFitness< FitnessTraits > &_other) const + + + bool + operator> + a9 + (const eoParetoOneConstraintFitness< FitnessTraits > &_other) const + + + bool + operator<= + a10 + (const eoParetoOneConstraintFitness< FitnessTraits > &_other) const + + + bool + operator>= + a11 + (const eoParetoOneConstraintFitness< FitnessTraits > &_other) const + + + bool + operator== + a12 + (const eoParetoOneConstraintFitness< FitnessTraits > &_other) const + + + bool + operator!= + a13 + (const eoParetoOneConstraintFitness< FitnessTraits > &_other) const + + + void + setUp + e0 + (unsigned _n, std::vector< bool > &_b) + + + bool + maximizing + e1 + (unsigned _i) + + + double + constraintValue + r0 + + + + + eoParetoRanking + classeo_pareto_ranking.html + EOT + eoPerf2WorthCached< EOT, double > + + + eoParetoRanking + a0 + (eoDominanceMap< EOT > &_dominanceMap) + + + void + calculate_worths + a1 + (const eoPop< EOT > &_pop) + + + eoDominanceMap< EOT > & + dominanceMap + r0 + + + + + eoParser + classeo_parser.html + eoParameterLoader + eoObject + eoPersistent + + + eoParser + a0 + (unsigned _argc, char **_argv, std::string _programDescription="", std::string _lFileParamName="param-file", char _shortHand= 'p') + + + void + processParam + a1 + (eoParam &param, std::string section="") + + + void + readFrom + a2 + (std::istream &is) + + + void + printOn + a3 + (std::ostream &os) const + + + std::string + className + a4 + (void) const + + + bool + userNeedsHelp + a5 + (void) + + + void + printHelp + a6 + (std::ostream &os) + + + std::string + ProgramName + a7 + () + + + virtual bool + isItThere + a8 + (eoParam &_param) const + + + eoParam * + getParamWithLongName + a9 + (const std::string &_name) const + + + eoValueParam< ValueType > & + getORcreateParam + a10 + (ValueType _defaultValue, std::string _longName, std::string _description, char _shortHand=0, std::string _section="", bool _required=false) + + + eoValueParam< ValueType > & + setORcreateParam + a11 + (ValueType _defaultValue, std::string _longName, std::string _description, char _shortHand=0, std::string _section="", bool _required=false) + + + void + setStopOnUnknownParam + a12 + (bool _b) + + + bool + getStopOnUnknownParam + a13 + () + + + void + setPrefix + a14 + (const std::string &_prefix) + + + void + resetPrefix + a15 + () + + + std::string + getPrefix + a16 + () + + + std::multimap< std::string, eoParam * > + MultiMapType + y0 + + + + std::map< char, std::string > + ShortNameMapType + y1 + + + + std::map< std::string, std::string > + LongNameMapType + y2 + + + + void + doRegisterParam + d0 + (eoParam &param) const + + + std::pair< bool, std::string > + getValue + d1 + (eoParam &_param) const + + + void + updateParameters + d2 + () const + + + MultiMapType + params + r0 + + + + std::string + programName + r1 + + + + std::string + programDescription + r2 + + + + ShortNameMapType + shortNameMap + r3 + + + + LongNameMapType + longNameMap + r4 + + + + eoValueParam< bool > + needHelp + r5 + + + + eoValueParam< bool > + stopOnUnknownParam + r6 + + + + std::vector< std::string > + messages + r7 + + + + std::string + prefix + r8 + + + + + eoParseTree + classeo_parse_tree.html + FType + Node + EO< FType > + + parse_tree< Node >::subtree + Subtree + w0 + + + + Node + reference + w1 + + + + const reference + const_reference + w2 + + + + + eoParseTree + a0 + (void) + + + + eoParseTree + a1 + (const parse_tree< Node > &tree) + + + virtual void + pruneTree + a2 + (unsigned _size) + + + + eoParseTree + a3 + (std::istream &is) + + + std::string + className + a4 + (void) const + + + void + printOn + a5 + (std::ostream &os) const + + + void + readFrom + a6 + (std::istream &is) + + + + eoParseTreeDepthInit + classeo_parse_tree_depth_init.html + FType + Node + eoInit< eoParseTree< FType, Node > > + + eoParseTree< FType, Node > + EoType + w0 + + + + + eoParseTreeDepthInit + a0 + (unsigned _max_depth, const std::vector< Node > &_initializor, bool _grow=true, bool _ramped_half_and_half=false) + + + virtual std::string + className + a1 + () const + + + void + operator() + a2 + (EoType &_tree) + + + void + generate + d0 + (std::list< Node > &sequence, int the_max, int last_terminal=-1) + + + unsigned + max_depth + r0 + + + + std::vector< Node > + initializor + r1 + + + + bool + grow + r2 + + + + bool + ramped_half_and_half + r3 + + + + unsigned + current_depth + r4 + + + + + eoPBILAdditive + classeo_p_b_i_l_additive.html + EOT + eoDistribUpdater + + + eoPBILAdditive + a0 + (double _LRBest, unsigned _nbBest=1, double _tolerance=0.0, double _LRWorst=0.0, unsigned _nbWorst=0) + + + virtual void + operator() + a1 + (eoDistribution< EOT > &_distrib, eoPop< EOT > &_pop) + + + double + maxBound + r0 + + + + double + minBound + r1 + + + + double + LR + r2 + + + + unsigned + nbBest + r3 + + + + unsigned + nbWorst + r4 + + + + double + lrb + r5 + + + + double + lrw + r6 + + + + + eoPBILDistrib + classeo_p_b_i_l_distrib.html + EOT + eoDistribution + eoValueParam< std::vector< double > > + + + eoPBILDistrib + a0 + (unsigned _genomeSize) + + + virtual void + operator() + a1 + (EOT &_eo) + + + unsigned + Size + a2 + () + + + virtual void + printOn + a3 + (std::ostream &os) const + + + virtual void + readFrom + a4 + (std::istream &is) + + + unsigned int + size + a5 + () + + + virtual std::string + className + a6 + () const + + + unsigned + genomeSize + r0 + + + + + eoPBILOrg + classeo_p_b_i_l_org.html + EOT + eoDistribUpdater + + + eoPBILOrg + a0 + (double _LR, double _tolerance=0.0) + + + virtual void + operator() + a1 + (eoDistribution< EOT > &_distrib, eoPop< EOT > &_pop) + + + double + LR + r0 + + + + double + maxBound + r1 + + + + double + minBound + r2 + + + + + eoPerf2Worth + classeo_perf2_worth.html + EOT + WorthT + eoUF< const eoPop< EOT > &, void > + eoValueParam< std::vector< WorthT > > + + + eoPerf2Worth + a0 + (std::string _description="Worths") + + + virtual void + sort_pop + a1 + (eoPop< EOT > &_pop) + + + virtual void + resize + a2 + (eoPop< EOT > &_pop, unsigned sz) + + + virtual void + operator() + a3 + (eoPop< EOT > &_pop) + + + + eoPerf2Worth::compare_worth + classeo_perf2_worth_1_1compare__worth.html + + + compare_worth + a0 + (const std::vector< WorthT > &_worths) + + + bool + operator() + a1 + (unsigned a, unsigned b) const + + + const std::vector< WorthT > & + worths + r0 + + + + + eoPerf2WorthCached + classeo_perf2_worth_cached.html + EOT + WorthT + eoPerf2Worth + + + eoPerf2WorthCached + a0 + (std::string _description="Worths") + + + void + operator() + a1 + (const eoPop< EOT > &_pop) + + + virtual void + calculate_worths + a2 + (const eoPop< EOT > &_pop)=0 + + + virtual void + sort_pop + a3 + (eoPop< EOT > &_pop) + + + virtual void + resize + a4 + (eoPop< EOT > &_pop, unsigned sz) + + + std::vector< typename EOT::Fitness > + fitness_cache + r0 + + + + + eoPerf2WorthCached::compare_worth + classeo_perf2_worth_cached_1_1compare__worth.html + + + compare_worth + a0 + (const std::vector< WorthT > &_worths) + + + bool + operator() + a1 + (unsigned a, unsigned b) const + + + const std::vector< WorthT > & + worths + r0 + + + + + eoPersistent + classeo_persistent.html + eoPrintable + + virtual + ~eoPersistent + a0 + () + + + virtual void + readFrom + a1 + (std::istream &_is)=0 + + + + eoPlus + classeo_plus.html + EOT + eoMerge< EOT > + + void + operator() + a0 + (const eoPop< EOT > &_pop, eoPop< EOT > &_offspring) + + + + eoPlusReplacement + classeo_plus_replacement.html + EOT + eoMergeReduce + + eoPlus< EOT > + plus + r0 + + + + eoTruncate< EOT > + truncate + r1 + + + + + eoPointMutation + classeo_point_mutation.html + FType + Node + eoMonOp< eoParseTree< FType, Node > > + + eoParseTree< FType, Node > + EoType + w0 + + + + + eoPointMutation + a0 + (std::vector< Node > &_initializor) + + + virtual std::string + className + a1 + () const + + + virtual + ~eoPointMutation + a2 + () + + + bool + operator() + a3 + (EoType &_eo1) + + + std::vector< Node > & + initializor + r0 + + + + + eoPop + classeo_pop.html + EOT + eoObject + eoPersistent + + EOT::Fitness + Fitness + w0 + + + + EOT::fitness_traits + fitness_traits + w1 + + + + + eoPop + a0 + () + + + + eoPop + a1 + (unsigned _popSize, eoInit< EOT > &_chromInit) + + + void + append + a2 + (unsigned _newPopSize, eoInit< EOT > &_chromInit) + + + + eoPop + a3 + (std::istream &_is) + + + virtual + ~eoPop + a4 + () + + + void + sort + a5 + (void) + + + void + sort + a6 + (std::vector< const EOT * > &result) const + + + void + shuffle + a7 + (void) + + + void + shuffle + a8 + (std::vector< const EOT * > &result) const + + + eoPop< EOT >::iterator + it_best_element + a9 + () + + + const EOT & + best_element + a10 + () const + + + const EOT & + worse_element + a11 + () const + + + eoPop< EOT >::iterator + it_worse_element + a12 + () + + + eoPop< EOT >::iterator + nth_element + a13 + (int nth) + + + Fitness + nth_element_fitness + a14 + (int which) const + + + void + nth_element + a15 + (int which, std::vector< const EOT * > &result) const + + + void + swap + a16 + (eoPop< EOT > &other) + + + virtual void + sortedPrintOn + a17 + (std::ostream &_os) const + + + virtual void + printOn + a18 + (std::ostream &_os) const + + + virtual void + invalidate + a19 + () + + + void + sort + a21 + () + + + void + scale + a22 + () + + + void + setPerf2Worth + a23 + (eoPerf2Worth< EOT > &_p2w) + + + void + setPerf2Worth + a24 + (eoPerf2Worth< EOT > *_p2w) + + + eoPerf2Worth< EOT > * + getPerf2Worth + a25 + () + + + void + swap + a26 + (eoPop< EOT > &other) + + + virtual void + readFrom + z19_0 + (std::istream &_is) + + + virtual std::string + className + z19_1 + () const + + + eoPerf2Worth< EOT > * + p2w + r0 + + + + + eoPop::Cmp + structeo_pop_1_1_cmp.html + + bool + operator() + a0 + (const EOT *a, const EOT *b) const + + + + eoPop::Ref + structeo_pop_1_1_ref.html + + const EOT * + operator() + a0 + (const EOT &eot) + + + + eoPopAlgo + classeo_pop_algo.html + EOT + eoUF< eoPop< EOT > &, void > + + + eoPopEvalFunc + classeo_pop_eval_func.html + EOT + eoBF< eoPop< EOT > &, eoPop< EOT > &, void > + + + eoPopLoopEval + classeo_pop_loop_eval.html + EOT + eoPopEvalFunc + + + eoPopLoopEval + a0 + (eoEvalFunc< EOT > &_eval) + + + void + operator() + a1 + (eoPop< EOT > &_parents, eoPop< EOT > &_offspring) + + + eoEvalFunc< EOT > & + eval + r0 + + + + + eoPopStat + classeo_pop_stat.html + EOT + eoStat< EOT, std::string > + + + eoPopStat + a0 + (unsigned _howMany=0, std::string _desc="") + + + void + operator() + a1 + (const eoPop< EOT > &_pop) + + + unsigned + combien + r0 + + + + + eoPopulator + classeo_populator.html + EOT + + unsigned + position_type + w0 + + + + + eoPopulator + a0 + (const eoPop< EOT > &_src, eoPop< EOT > &_dest) + + + virtual + ~eoPopulator + a1 + () + + + EOT & + operator * + a2 + (void) + + + eoPopulator & + operator++ + a3 + () + + + void + insert + a4 + (const EOT &_eo) + + + void + reserve + a5 + (int how_many) + + + const eoPop< EOT > & + source + a6 + (void) + + + eoPop< EOT > & + offspring + a7 + (void) + + + position_type + tellp + a8 + () + + + void + seekp + a9 + (position_type pos) + + + bool + exhausted + a10 + (void) + + + virtual const EOT & + select + a11 + ()=0 + + + eoPop< EOT > & + dest + p0 + + + + eoPop< EOT >::iterator + current + p1 + + + + const eoPop< EOT > & + src + p2 + + + + void + get_next + d0 + () + + + + eoPrintable + classeo_printable.html + + virtual + ~eoPrintable + a0 + () + + + virtual void + printOn + a1 + (std::ostream &_os) const =0 + + + + eoProcedureCounter + classeo_procedure_counter.html + Procedure + eoValueParam< unsigned long > + + + eoProcedureCounter + a0 + (Procedure &_proc, std::string _name="proc_counter") + + + Procedure::result_type + operator() + a1 + (void) + + + Procedure & + proc + r0 + + + + + eoPropCombinedBinOp + classeo_prop_combined_bin_op.html + EOT + eoBinOp< EOT > + + + eoPropCombinedBinOp + a0 + (eoBinOp< EOT > &_first, const double _rate) + + + virtual std::string + className + a1 + () const + + + virtual void + add + a2 + (eoBinOp< EOT > &_op, const double _rate, bool _verbose=false) + + + virtual void + operator() + a3 + (EOT &_indi1, const EOT &_indi2) + + + std::vector< eoBinOp< EOT > * > + ops + r0 + + + + std::vector< double > + rates + r1 + + + + + eoPropCombinedMonOp + classeo_prop_combined_mon_op.html + EOT + eoMonOp< EOT > + + + eoPropCombinedMonOp + a0 + (eoMonOp< EOT > &_first, const double _rate) + + + virtual std::string + className + a1 + () const + + + virtual void + add + a2 + (eoMonOp< EOT > &_op, const double _rate, bool _verbose=false) + + + virtual void + printOn + a3 + (std::ostream &_os) + + + virtual bool + operator() + a4 + (EOT &_indi) + + + std::vector< eoMonOp< EOT > * > + ops + p0 + + + + std::vector< double > + rates + p1 + + + + + eoPropCombinedQuadOp + classeo_prop_combined_quad_op.html + EOT + eoQuadOp< EOT > + + + eoPropCombinedQuadOp + a0 + (eoQuadOp< EOT > &_first, const double _rate) + + + virtual std::string + className + a1 + () const + + + virtual void + add + a2 + (eoQuadOp< EOT > &_op, const double _rate, bool _verbose=false) + + + virtual void + printOn + a3 + (std::ostream &_os) + + + virtual bool + operator() + a4 + (EOT &_indi1, EOT &_indi2) + + + std::vector< eoQuadOp< EOT > * > + ops + r0 + + + + std::vector< double > + rates + r1 + + + + + eoPropGAGenOp + classeo_prop_g_a_gen_op.html + EOT + eoGenOp + + + eoPropGAGenOp + a0 + (double _wClone, eoQuadOp< EOT > &_cross, double _wCross, eoMonOp< EOT > &_mut, double _wMut) + + + virtual void + apply + a1 + (eoPopulator< EOT > &_pop) + + + virtual unsigned + max_production + a2 + (void) + + + virtual std::string + className + a3 + () const + + + double + wClone + r0 + + + + eoQuadOp< EOT > & + cross + r1 + + + + double + wCross + r2 + + + + eoMonOp< EOT > & + mut + r3 + + + + double + wMut + r4 + + + + eoProportionalOp< EOT > + propOp + r5 + + + + eoMonCloneOp< EOT > + monClone + r6 + + + + + eoProportionalOp + classeo_proportional_op.html + EOT + eoOpContainer + + void + apply + a0 + (eoPopulator< EOT > &_pop) + + + virtual std::string + className + a1 + () const + + + + eoProportionalSelect + classeo_proportional_select.html + EOT + eoSelectOne< EOT > + + + eoProportionalSelect + a0 + (const eoPop< EOT > &pop=eoPop< EOT >()) + + + void + setup + a1 + (const eoPop< EOT > &_pop) + + + const EOT & + operator() + a2 + (const eoPop< EOT > &_pop) + + + std::vector< typename EOT::Fitness > + FitVec + y0 + + + + FitVec + cumulative + r0 + + + + + eoQuad2BinOp + classeo_quad2_bin_op.html + EOT + eoBinOp< EOT > + + + eoQuad2BinOp + a0 + (eoQuadOp< EOT > &_quadOp) + + + bool + operator() + a1 + (EOT &_eo1, const EOT &_eo2) + + + eoQuadOp< EOT > & + quadOp + r0 + + + + + eoQuadCloneOp + classeo_quad_clone_op.html + EOT + eoQuadOp< EOT > + + + eoQuadCloneOp + a0 + () + + + virtual std::string + className + a1 + () const + + + virtual bool + operator() + a2 + (EOT &, EOT &) + + + + eoQuadDistance + classeo_quad_distance.html + EOT + eoDistance + + double + operator() + a0 + (const EOT &_v1, const EOT &_v2) + + + + eoQuadGenOp + classeo_quad_gen_op.html + EOT + eoGenOp + + + eoQuadGenOp + a0 + (eoQuadOp< EOT > &_op) + + + unsigned + max_production + a1 + (void) + + + void + apply + a2 + (eoPopulator< EOT > &_pop) + + + virtual std::string + className + a3 + () const + + + eoQuadOp< EOT > & + op + r0 + + + + + eoQuadOp + classeo_quad_op.html + EOType + eoOp + eoBF< EOType &, EOType &, bool > + + + eoQuadOp + a0 + () + + + virtual std::string + className + a1 + () const + + + + random_generator + classrandom__generator.html + T + + + random_generator + a0 + (T _max, eoRng &_rng=rng) + + + + random_generator + a1 + (T _min, T _max, eoRng &_rng=rng) + + + T + operator() + a2 + (void) + + + bool + operator() + a3 + (void) + + + T + minim + r0 + + + + T + range + r1 + + + + eoRng & + random + r2 + + + + + RandomNodeSelector + class_random_node_selector.html + NodeSelector + + NodeSelection + select_node + a0 + (Sym sym) const + + + + eoRandomReduce + classeo_random_reduce.html + EOT + eoReduce + + void + operator() + d0 + (eoPop< EOT > &_newgen, unsigned _newsize) + + + + eoRandomSelect + classeo_random_select.html + EOT + eoSelectOne< EOT > + + virtual const EOT & + operator() + a0 + (const eoPop< EOT > &_pop) + + + + eoRandomSplit + classeo_random_split.html + EOT + eoReduceSplit + + + eoRandomSplit + a0 + (eoHowMany _howMany, bool _returnEliminated=false) + + + void + operator() + a1 + (eoPop< EOT > &_newgen, eoPop< EOT > &_eliminated) + + + eoHowMany + howMany + r0 + + + + bool + returnEliminated + r1 + + + + + eoRanking + classeo_ranking.html + EOT + eoPerf2Worth< EOT > + + + eoRanking + a0 + (double _p=2.0, double _e=1.0) + + + int + lookfor + a1 + (const EOT *_eo, const eoPop< EOT > &_pop) + + + virtual void + operator() + a2 + (const eoPop< EOT > &_pop) + + + double + pressure + r0 + + + + double + exponent + r1 + + + + + eoRankingSelect + classeo_ranking_select.html + EOT + eoRouletteWorthSelect< EOT, double > + + + eoRankingSelect + a0 + (double _p=2.0, double _e=1.0) + + + eoRanking< EOT > + ranking + r0 + + + + + eoReal + classeo_real.html + FitT + eoVector< FitT, double > + + + eoReal + a0 + (unsigned size=0, double value=0.0) + + + virtual std::string + className + a1 + () const + + + + eoRealAboveBound + classeo_real_above_bound.html + eoRealBounds + + + eoRealAboveBound + a1 + (double _max=0) + + + virtual double + maximum + a2 + () const + + + virtual double + minimum + a3 + () const + + + virtual double + range + a4 + () const + + + virtual double + uniform + a5 + (eoRng &_rng=eo::rng) const + + + virtual bool + isBounded + a6 + (void) const + + + virtual bool + hasNoBoundAtAll + a7 + (void) const + + + virtual bool + isMinBounded + a8 + (void) const + + + virtual bool + isMaxBounded + a9 + (void) const + + + virtual bool + isInBounds + a10 + (double _r) const + + + virtual void + foldsInBounds + a11 + (double &_r) const + + + virtual void + truncate + a12 + (double &_r) const + + + virtual void + readFrom + a13 + (std::istream &_is) + + + virtual void + printOn + a14 + (std::ostream &_os) const + + + virtual eoRealBounds * + dup + a15 + () const + + + double + repMaximum + r0 + + + + + eoRealBaseVectorBounds + classeo_real_base_vector_bounds.html + + + eoRealBaseVectorBounds + a1 + () + + + + eoRealBaseVectorBounds + a2 + (unsigned _dim, eoRealBounds &_bounds) + + + + eoRealBaseVectorBounds + a3 + (eoRealBounds &_xbounds, eoRealBounds &_ybounds) + + + virtual bool + isBounded + a4 + (unsigned _i) + + + virtual bool + isBounded + a5 + (void) + + + virtual bool + hasNoBoundAtAll + a6 + (unsigned _i) + + + virtual bool + hasNoBoundAtAll + a7 + (void) + + + virtual bool + isMinBounded + a8 + (unsigned _i) + + + virtual bool + isMaxBounded + a9 + (unsigned _i) + + + virtual void + foldsInBounds + a10 + (unsigned _i, double &_r) + + + virtual void + foldsInBounds + a11 + (std::vector< double > &_v) + + + virtual void + truncate + a12 + (unsigned _i, double &_r) + + + virtual void + truncate + a13 + (std::vector< double > &_v) + + + virtual bool + isInBounds + a14 + (unsigned _i, double _r) + + + virtual bool + isInBounds + a15 + (std::vector< double > _v) + + + virtual double + minimum + a16 + (unsigned _i) + + + virtual double + maximum + a17 + (unsigned _i) + + + virtual double + range + a18 + (unsigned _i) + + + virtual double + averageRange + a19 + () + + + virtual double + uniform + a20 + (unsigned _i, eoRng &_rng=eo::rng) + + + void + uniform + a21 + (std::vector< double > &_v, eoRng &_rng=eo::rng) + + + virtual void + printOn + a22 + (std::ostream &_os) const + + + + eoRealBelowBound + classeo_real_below_bound.html + eoRealBounds + + + eoRealBelowBound + a1 + (double _min=0) + + + virtual double + minimum + a2 + () const + + + virtual double + maximum + a3 + () const + + + virtual double + range + a4 + () const + + + virtual double + uniform + a5 + (eoRng &_rng=eo::rng) const + + + virtual bool + isBounded + a6 + (void) const + + + virtual bool + hasNoBoundAtAll + a7 + (void) const + + + virtual bool + isMinBounded + a8 + (void) const + + + virtual bool + isMaxBounded + a9 + (void) const + + + virtual bool + isInBounds + a10 + (double _r) const + + + virtual void + foldsInBounds + a11 + (double &_r) const + + + virtual void + truncate + a12 + (double &_r) const + + + virtual void + readFrom + a13 + (std::istream &_is) + + + virtual void + printOn + a14 + (std::ostream &_os) const + + + virtual eoRealBounds * + dup + a15 + () const + + + double + repMinimum + r0 + + + + + eoRealBounds + classeo_real_bounds.html + eoPersistent + + virtual bool + isBounded + a1 + (void) const =0 + + + virtual bool + hasNoBoundAtAll + a2 + (void) const =0 + + + virtual bool + isMinBounded + a3 + (void) const =0 + + + virtual bool + isMaxBounded + a4 + (void) const =0 + + + virtual bool + isInBounds + a5 + (double) const =0 + + + virtual void + foldsInBounds + a6 + (double &) const =0 + + + virtual void + truncate + a7 + (double &) const =0 + + + virtual double + minimum + a8 + () const =0 + + + virtual double + maximum + a9 + () const =0 + + + virtual double + range + a10 + () const =0 + + + virtual double + uniform + a11 + (eoRng &_rng=eo::rng) const =0 + + + virtual eoRealBounds * + dup + a12 + () const =0 + + + + eoRealInitBounded + classeo_real_init_bounded.html + EOT + eoInit + + + eoRealInitBounded + a0 + (eoRealVectorBounds &_bounds) + + + virtual void + operator() + a1 + (EOT &_eo) + + + virtual eoRealVectorBounds & + theBounds + a2 + () + + + virtual unsigned + size + a3 + () + + + eoRealVectorBounds & + bounds + r0 + + + + + eoRealInterval + classeo_real_interval.html + eoRealBounds + + + eoRealInterval + a1 + (double _min=0, double _max=1) + + + virtual double + minimum + a2 + () const + + + virtual double + maximum + a3 + () const + + + virtual double + range + a4 + () const + + + virtual bool + isBounded + a5 + (void) const + + + virtual bool + hasNoBoundAtAll + a6 + (void) const + + + virtual bool + isMinBounded + a7 + (void) const + + + virtual bool + isMaxBounded + a8 + (void) const + + + virtual double + uniform + a9 + (eoRng &_rng=eo::rng) const + + + virtual bool + isInBounds + a10 + (double _r) const + + + virtual void + foldsInBounds + a11 + (double &_r) const + + + virtual void + truncate + a12 + (double &_r) const + + + virtual void + readFrom + a13 + (std::istream &_is) + + + virtual void + printOn + a14 + (std::ostream &_os) const + + + virtual eoRealBounds * + dup + a15 + () const + + + double + repMinimum + r0 + + + + double + repMaximum + r1 + + + + double + repRange + r2 + + + + + eoRealNoBounds + classeo_real_no_bounds.html + eoRealBounds + + virtual bool + isBounded + a1 + (void) const + + + virtual bool + hasNoBoundAtAll + a2 + (void) const + + + virtual bool + isMinBounded + a3 + (void) const + + + virtual bool + isMaxBounded + a4 + (void) const + + + virtual void + foldsInBounds + a5 + (double &) const + + + virtual void + truncate + a6 + (double &) const + + + virtual bool + isInBounds + a7 + (double) const + + + virtual double + minimum + a8 + () const + + + virtual double + maximum + a9 + () const + + + virtual double + range + a10 + () const + + + virtual double + uniform + a11 + (eoRng &_rng=eo::rng) const + + + virtual void + readFrom + a12 + (std::istream &_is) + + + virtual void + printOn + a13 + (std::ostream &_os) const + + + virtual eoRealBounds * + dup + a14 + () const + + + + eoRealUxOver + classeo_real_ux_over.html + + + eoRealVectorBounds + classeo_real_vector_bounds.html + eoRealBaseVectorBounds + eoPersistent + + + eoRealVectorBounds + a0 + () + + + + eoRealVectorBounds + a1 + (unsigned _dim, eoRealBounds &_bounds) + + + + eoRealVectorBounds + a2 + (eoRealBounds &_xbounds, eoRealBounds &_ybounds) + + + + eoRealVectorBounds + a3 + (unsigned _dim, double _min, double _max) + + + + eoRealVectorBounds + a4 + (std::vector< double > _min, std::vector< double > _max) + + + + eoRealVectorBounds + a5 + (std::string _s) + + + virtual + ~eoRealVectorBounds + a6 + () + + + virtual void + readFrom + a7 + (std::istream &_is) + + + virtual void + readFrom + a8 + (std::string _s) + + + virtual void + printOn + a9 + (std::ostream &_os) const + + + void + adjust_size + a10 + (unsigned _dim) + + + + eoRealVectorBounds + a11 + (const eoRealVectorBounds &) + + + eoRealVectorBounds & + operator= + d0 + (const eoRealVectorBounds &) + + + std::vector< unsigned int > + factor + r0 + + + + std::vector< eoRealBounds * > + ownedBounds + r1 + + + + + eoRealVectorNoBounds + classeo_real_vector_no_bounds.html + eoRealVectorBounds + + + eoRealVectorNoBounds + a1 + (unsigned _dim) + + + virtual bool + isBounded + a2 + (unsigned) + + + virtual bool + isBounded + a3 + (void) + + + virtual bool + hasNoBoundAtAll + a4 + (unsigned) + + + virtual bool + hasNoBoundAtAll + a5 + (void) + + + virtual bool + isMinBounded + a6 + (unsigned) + + + virtual bool + isMaxBounded + a7 + (unsigned) + + + virtual void + foldsInBounds + a8 + (unsigned, double &) + + + virtual void + foldsInBounds + a9 + (std::vector< double > &) + + + virtual void + truncate + a10 + (unsigned, double &) + + + virtual void + truncate + a11 + (std::vector< double > &) + + + virtual bool + isInBounds + a12 + (unsigned, double) + + + virtual bool + isInBounds + a13 + (std::vector< double >) + + + virtual double + minimum + a14 + (unsigned) + + + virtual double + maximum + a15 + (unsigned) + + + virtual double + range + a16 + (unsigned) + + + virtual double + averageRange + a17 + () + + + virtual double + uniform + a18 + (unsigned, eoRng &_rng=eo::rng) + + + void + uniform + a19 + (std::vector< double > &, eoRng &_rng=eo::rng) + + + + eoReduce + classeo_reduce.html + EOT + eoBF< eoPop< EOT > &, unsigned, void > + + + eoReduceMerge + classeo_reduce_merge.html + EOT + eoReplacement + + + eoReduceMerge + a0 + (eoReduce< EOT > &_reduce, eoMerge< EOT > &_merge) + + + void + operator() + a1 + (eoPop< EOT > &_parents, eoPop< EOT > &_offspring) + + + eoReduce< EOT > & + reduce + r0 + + + + eoMerge< EOT > & + merge + r1 + + + + + eoReduceMergeReduce + classeo_reduce_merge_reduce.html + EOT + eoReplacement + + + eoReduceMergeReduce + a0 + (eoHowMany _howManyElite, bool _strongElitism, eoHowMany _howManyReducedParents, eoReduce< EOT > &_reduceParents, eoHowMany _howManyReducedOffspring, eoReduce< EOT > &_reduceOffspring, eoReduce< EOT > &_reduceFinal) + + + void + operator() + a1 + (eoPop< EOT > &_parents, eoPop< EOT > &_offspring) + + + eoHowMany + howManyElite + r0 + + + + bool + strongElitism + r1 + + + + eoHowMany + howManyReducedParents + r2 + + + + eoHowMany + howManyReducedOffspring + r3 + + + + eoReduce< EOT > & + reduceParents + r4 + + + + eoReduce< EOT > & + reduceOffspring + r5 + + + + eoReduce< EOT > & + reduceFinal + r6 + + + + + eoReduceSplit + classeo_reduce_split.html + EOT + eoBF< eoPop< EOT > &, eoPop< EOT > &, void > + + + eoReplacement + classeo_replacement.html + EOT + eoBF< eoPop< EOT > &, eoPop< EOT > &, void > + + + eoRndGenerator + classeo_rnd_generator.html + T + eoF< T > + + T + AtomType + y0 + + + + + eoRng + classeo_rng.html + eoObject + eoPersistent + + + eoRng + a0 + (uint32_t s) + + + void + reseed + a2 + (uint32_t s) + + + void + oldReseed + a3 + (uint32_t s) + + + double + uniform + a4 + (double m=1.0) + + + uint32_t + random + a5 + (uint32_t m) + + + bool + flip + a6 + (float bias=0.5) + + + double + normal + a7 + (void) + + + double + normal + a8 + (double stdev) + + + double + normal + a9 + (double mean, double stdev) + + + double + negexp + a10 + (double mean) + + + uint32_t + rand + a11 + () + + + uint32_t + rand_max + a12 + (void) const + + + int + roulette_wheel + a13 + (const std::vector< TYPE > &vec, TYPE total=0) + + + const TYPE & + choice + a14 + (const std::vector< TYPE > &vec) const + + + TYPE & + choice + a15 + (std::vector< TYPE > &vec) + + + void + printOn + a16 + (std::ostream &_os) const + + + void + readFrom + a17 + (std::istream &_is) + + + std::string + className + a18 + (void) const + + + uint32_t + restart + d0 + (void) + + + void + initialize + d1 + (uint32_t seed) + + + + eoRng + d2 + (const eoRng &) + + + eoRng & + operator= + d3 + (const eoRng &) + + + uint32_t * + state + r0 + + + + uint32_t * + next + r1 + + + + int + left + r2 + + + + bool + cached + r3 + + + + float + cacheValue + r4 + + + + const int + N + r5 + + + + const int + M + r6 + + + + const uint32_t + K + r7 + + + + + eoRouletteWorthSelect + classeo_roulette_worth_select.html + EOT + WorthT + eoSelectFromWorth< EOT, WorthT > + + std::vector< WorthT >::iterator + worthIterator + w0 + + + + + eoRouletteWorthSelect + a0 + (eoPerf2Worth< EOT, WorthT > &_perf2Worth) + + + virtual void + setup + a1 + (const eoPop< EOT > &_pop) + + + virtual const EOT & + operator() + a2 + (const eoPop< EOT > &_pop) + + + double + total + r0 + + + + + eoScalarFitness + classeo_scalar_fitness.html + ScalarType + Compare + + + eoScalarFitness + a1 + (const eoScalarFitness &other) + + + + eoScalarFitness + a2 + (const ScalarType &v) + + + eoScalarFitness & + operator= + a3 + (const eoScalarFitness &other) + + + eoScalarFitness & + operator= + a4 + (const ScalarType &v) + + + + operator ScalarType + a5 + (void) const + + + bool + operator< + a6 + (const eoScalarFitness &other) const + + + bool + operator> + a7 + (const eoScalarFitness< ScalarType, Compare > &y) const + + + bool + operator<= + a8 + (const eoScalarFitness< ScalarType, Compare > &y) const + + + bool + operator>= + a9 + (const eoScalarFitness< ScalarType, Compare > &y) const + + + ScalarType + value + r0 + + + + + eoScalarFitnessAssembled + classeo_scalar_fitness_assembled.html + ScalarType + Compare + FitnessTraits + + std::vector< ScalarType > + baseVector + w0 + + + + baseVector::size_type + size_type + w1 + + + + + eoScalarFitnessAssembled + a1 + (size_type _n, const ScalarType &_val, const std::string &_descr="Unnamed variable") + + + + eoScalarFitnessAssembled + a2 + (const eoScalarFitnessAssembled &other) + + + eoScalarFitnessAssembled & + operator= + a3 + (const eoScalarFitnessAssembled &other) + + + + eoScalarFitnessAssembled + a4 + (const ScalarType &v) + + + eoScalarFitnessAssembled & + operator= + a5 + (const ScalarType &v) + + + void + push_back + a6 + (const ScalarType &_val) + + + void + push_back + a7 + (const ScalarType &_val, const std::string &_descr) + + + void + resize + a8 + (size_type _n, const ScalarType &_val=ScalarType(), const std::string &_descr="Unnamed variable") + + + void + setDescription + a9 + (size_type _idx, std::string _descr) + + + std::string + getDescription + a10 + (size_type _idx) + + + std::vector< std::string > + getDescriptionVector + a11 + () + + + + operator ScalarType + a12 + (void) const + + + void + printAll + a13 + (std::ostream &os) const + + + bool + operator< + a14 + (const eoScalarFitnessAssembled &other) const + + + bool + operator> + a15 + (const eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > &y) const + + + bool + operator<= + a16 + (const eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > &y) const + + + bool + operator>= + a17 + (const eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > &y) const + + + bool + feasible + o0 + + + + bool + failed + o1 + + + + std::string + msg + o2 + + + + + eoScalarFitnessAssembledTraits + classeo_scalar_fitness_assembled_traits.html + + std::vector< std::string >::size_type + size_type + w0 + + + + void + setDescription + e0 + (size_type _idx, std::string _descr) + + + std::string + getDescription + e1 + (size_type _idx) + + + void + resize + e2 + (size_type _n, const std::string &_descr) + + + size_type + size + e3 + () + + + std::vector< std::string > + getDescriptionVector + e4 + () + + + std::vector< std::string > + TermDescriptions + v0 + + + + + eoScalarFitnessStat + classeo_scalar_fitness_stat.html + EOT + FitT + eoSortedStat< EOT, std::vector< double > > + + + eoScalarFitnessStat + a0 + (std::string _description="FitnessES", eoRealVectorBounds &_bounds=eoDummyVectorNoBounds) + + + virtual void + operator() + a1 + (const std::vector< const EOT * > &_popPters) + + + eoRealBounds & + range + r0 + + + + + eoSecondMomentStats + classeo_second_moment_stats.html + EOT + eoStat< EOT, std::pair< double, double > > + + EOT::Fitness + fitness_type + w0 + + + + std::pair< double, double > + SquarePair + w1 + + + + + eoSecondMomentStats + a0 + (std::string _description="Average & Stdev") + + + virtual void + operator() + a1 + (const eoPop< EOT > &_pop) + + + virtual std::string + className + a2 + (void) const + + + SquarePair + sumOfSquares + e0 + (SquarePair _sq, const EOT &_eo) + + + + eoSegmentCrossover + classeo_segment_crossover.html + EOT + eoQuadOp< EOT > + + + eoSegmentCrossover + a0 + (const double &_alpha=0.0) + + + + eoSegmentCrossover + a1 + (eoRealVectorBounds &_bounds, const double &_alpha=0.0) + + + virtual std::string + className + a2 + () const + + + bool + operator() + a3 + (EOT &_eo1, EOT &_eo2) + + + eoRealVectorBounds & + bounds + p0 + + + + double + alpha + p1 + + + + double + range + p2 + + + + + eoSelBinGenOp + classeo_sel_bin_gen_op.html + EOT + eoGenOp + + + eoSelBinGenOp + a0 + (eoBinOp< EOT > &_op, eoSelectOne< EOT > &_sel) + + + unsigned + max_production + a1 + (void) + + + void + apply + a2 + (eoPopulator< EOT > &_pop) + + + virtual std::string + className + a3 + () const + + + eoBinOp< EOT > & + op + r0 + + + + eoSelectOne< EOT > & + sel + r1 + + + + + eoSelect + classeo_select.html + EOT + eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > + + + eoSelectFactory + classeo_select_factory.html + EOT + eoFactory< eoSelect< EOT > > + + virtual eoSelect< EOT > * + make + a0 + (std::istream &_is) + + + + eoSelectFactory + z20_0 + () + + + virtual + ~eoSelectFactory + z20_1 + () + + + void + printOn + z22_0 + (std::ostream &_os) const + + + void + readFrom + z22_1 + (std::istream &_is) + + + + eoSelectFromWorth + classeo_select_from_worth.html + EOT + WorthType + eoSelectOne< EOT > + + + eoSelectFromWorth + a0 + (eoPerf2Worth< EOT, WorthType > &_perf2Worth) + + + virtual void + setup + a1 + (const eoPop< EOT > &pop) + + + void + check_sync + b0 + (unsigned index, const EOT &_eo) + + + eoPerf2Worth< EOT, WorthType > & + perf2Worth + p0 + + + + std::vector< typename EOT::Fitness > + fitness + p1 + + + + + eoSelectivePopulator + classeo_selective_populator.html + EOT + eoPopulator + + + eoSelectivePopulator + a0 + (const eoPop< EOT > &_pop, eoPop< EOT > &_dest, eoSelectOne< EOT > &_sel) + + + const EOT & + select + a1 + () + + + eoSelectOne< EOT > & + sel + r0 + + + + + eoSelectMany + classeo_select_many.html + EOT + eoSelect + + + eoSelectMany + a0 + (eoSelectOne< EOT > &_select, double _rate, bool _interpret_as_rate=true) + + + + eoSelectMany + a1 + (eoSelectOne< EOT > &_select, eoHowMany _howMany) + + + virtual void + operator() + a2 + (const eoPop< EOT > &_source, eoPop< EOT > &_dest) + + + eoSelectOne< EOT > & + select + r0 + + + + eoHowMany + howMany + r1 + + + + + eoSelectNumber + classeo_select_number.html + EOT + eoSelect + + + eoSelectNumber + a0 + (eoSelectOne< EOT > &_select, unsigned _nb_to_select=1) + + + virtual void + operator() + a1 + (const eoPop< EOT > &_source, eoPop< EOT > &_dest) + + + eoSelectOne< EOT > & + select + r0 + + + + unsigned + nb_to_select + r1 + + + + + eoSelectOne + classeo_select_one.html + EOT + WorthT + eoUF< const eoPop< EOT > &, const EOT & > + + virtual void + setup + a0 + (const eoPop< EOT > &_pop) + + + + eoSelectPerc + classeo_select_perc.html + EOT + eoSelect + + + eoSelectPerc + a0 + (eoSelectOne< EOT > &_select, float _rate=1.0) + + + virtual void + operator() + a1 + (const eoPop< EOT > &_source, eoPop< EOT > &_dest) + + + eoSelectOne< EOT > & + select + r0 + + + + float + rate + r1 + + + + + eoSelectTransform + classeo_select_transform.html + EOT + eoBreed + + + eoSelectTransform + a0 + (eoSelect< EOT > &_select, eoTransform< EOT > &_transform) + + + void + operator() + a1 + (const eoPop< EOT > &_parents, eoPop< EOT > &_offspring) + + + eoSelect< EOT > & + select + r0 + + + + eoTransform< EOT > & + transform + r1 + + + + + eoSeqPopulator + classeo_seq_populator.html + EOT + eoPopulator + + + eoSeqPopulator + a0 + (const eoPop< EOT > &_pop, eoPop< EOT > &_dest) + + + const EOT & + select + a1 + (void) + + + unsigned + current + r0 + + + + + eoSequentialOp + classeo_sequential_op.html + EOT + eoOpContainer + + unsigned + position_type + w0 + + + + void + apply + a0 + (eoPopulator< EOT > &_pop) + + + virtual std::string + className + a1 + () const + + + std::vector< size_t > + to_apply + r0 + + + + std::vector< size_t > + production + r1 + + + + + eoSequentialSelect + classeo_sequential_select.html + EOT + eoSelectOne< EOT > + + + eoSequentialSelect + a0 + (bool _ordered=true) + + + void + setup + a1 + (const eoPop< EOT > &_pop) + + + virtual const EOT & + operator() + a2 + (const eoPop< EOT > &_pop) + + + bool + ordered + r0 + + + + unsigned + current + r1 + + + + std::vector< const EOT * > + eoPters + r2 + + + + + eoSGA + classeo_s_g_a.html + EOT + eoAlgo + + + eoSGA + a0 + (eoSelectOne< EOT > &_select, eoQuadOp< EOT > &_cross, float _crate, eoMonOp< EOT > &_mutate, float _mrate, eoEvalFunc< EOT > &_eval, eoContinue< EOT > &_cont) + + + void + operator() + a1 + (eoPop< EOT > &_pop) + + + eoContinue< EOT > & + cont + r0 + + + + eoInvalidateMonOp< EOT > + mutate + r1 + + + + float + mutationRate + r2 + + + + eoInvalidateQuadOp< EOT > + cross + r3 + + + + float + crossoverRate + r4 + + + + eoSelectPerc< EOT > + select + r5 + + + + eoEvalFunc< EOT > & + eval + r6 + + + + + eoSGAGenOp + classeo_s_g_a_gen_op.html + EOT + eoGenOp + + + eoSGAGenOp + a0 + (eoQuadOp< EOT > &_cross, double _pCross, eoMonOp< EOT > &_mut, double _pMut) + + + virtual void + apply + a1 + (eoPopulator< EOT > &_pop) + + + virtual unsigned + max_production + a2 + (void) + + + virtual std::string + className + a3 + () const + + + eoQuadOp< EOT > & + cross + r0 + + + + double + pCross + r1 + + + + eoMonOp< EOT > & + mut + r2 + + + + double + pMut + r3 + + + + eoProportionalOp< EOT > + propOp + r4 + + + + eoQuadCloneOp< EOT > + quadClone + r5 + + + + eoSequentialOp< EOT > + op + r6 + + + + + eoSGATransform + classeo_s_g_a_transform.html + EOT + eoTransform + + + eoSGATransform + a0 + (eoQuadOp< EOT > &_cross, double _cProba, eoMonOp< EOT > &_mutate, double _mProba) + + + void + operator() + a1 + (eoPop< EOT > &_pop) + + + eoInvalidateQuadOp< EOT > + cross + r0 + + + + double + crossoverProba + r1 + + + + eoInvalidateMonOp< EOT > + mutate + r2 + + + + double + mutationProba + r3 + + + + + eoSharing + classeo_sharing.html + EOT + eoPerf2Worth< EOT > + + + eoSharing + a0 + (double _nicheSize, eoDistance< EOT > &_dist) + + + void + operator() + a1 + (const eoPop< EOT > &_pop) + + + double + nicheSize + r0 + + + + eoDistance< EOT > & + dist + r1 + + + + + eoSharingSelect + classeo_sharing_select.html + EOT + eoRouletteWorthSelect< EOT, double > + + + eoSharingSelect + a0 + (double _sigma, eoDistance< EOT > &_dist) + + + eoSharing< EOT > + sharing + r0 + + + + + eoSimpleEDA + classeo_simple_e_d_a.html + EOT + eoEDA + + + eoSimpleEDA + a0 + (eoDistribUpdater< EOT > &_update, eoEvalFunc< EOT > &_eval, unsigned _popSize, eoContinue< EOT > &_continuator) + + + virtual void + operator() + a1 + (eoDistribution< EOT > &_distrib) + + + eoDistribUpdater< EOT > & + update + r0 + + + + eoEvalFunc< EOT > & + eval + r1 + + + + unsigned + popSize + r2 + + + + eoContinue< EOT > & + continuator + r3 + + + + + eoSortedPopStat + classeo_sorted_pop_stat.html + EOT + eoSortedStat< EOT, std::string > + + + eoSortedPopStat + a0 + (unsigned _howMany=0, std::string _desc="") + + + void + operator() + a1 + (const std::vector< const EOT * > &_pop) + + + unsigned + combien + r0 + + + + + eoSortedStat + classeo_sorted_stat.html + EOT + ParamType + eoSortedStatBase + eoValueParam< ParamType > + + + eoSortedStat + a0 + (ParamType _value, std::string _desc) + + + virtual std::string + className + a1 + (void) const + + + + eoSortedStatBase + classeo_sorted_stat_base.html + EOT + eoUF< const std::vector< const EOT * > &, void > + + virtual void + lastCall + a0 + (const std::vector< const EOT * > &) + + + virtual std::string + className + a1 + (void) const + + + + eoSSGADetTournamentReplacement + classeo_s_s_g_a_det_tournament_replacement.html + EOT + eoReduceMerge + + + eoSSGADetTournamentReplacement + a0 + (unsigned _t_size) + + + eoDetTournamentTruncate< EOT > + truncate + r0 + + + + eoPlus< EOT > + plus + r1 + + + + + eoSSGAStochTournamentReplacement + classeo_s_s_g_a_stoch_tournament_replacement.html + EOT + eoReduceMerge + + + eoSSGAStochTournamentReplacement + a0 + (double _t_rate) + + + eoStochTournamentTruncate< EOT > + truncate + r0 + + + + eoPlus< EOT > + plus + r1 + + + + + eoSSGAWorseReplacement + classeo_s_s_g_a_worse_replacement.html + EOT + eoReduceMerge + + eoLinearTruncate< EOT > + truncate + r0 + + + + eoPlus< EOT > + plus + r1 + + + + + eoStat + classeo_stat.html + EOT + T + eoValueParam< T > + eoStatBase + + + eoStat + a0 + (T _value, std::string _description) + + + virtual std::string + className + a1 + (void) const + + + + eoStatBase + classeo_stat_base.html + EOT + eoUF< const eoPop< EOT > &, void > + + virtual void + lastCall + a0 + (const eoPop< EOT > &) + + + virtual std::string + className + a1 + (void) const + + + + eoState + classeo_state.html + eoFunctorStore + + void + registerObject + a2 + (eoPersistent &registrant) + + + T & + takeOwnership + a3 + (const T &persistent) + + + std::string + getCommentString + a4 + (void) const + + + void + load + a5 + (const std::string &_filename) + + + void + load + a6 + (std::istream &is) + + + void + save + a7 + (const std::string &_filename) const + + + void + save + a8 + (std::ostream &os) const + + + std::map< std::string, eoPersistent * > + ObjectMap + y0 + + + + std::string + createObjectName + d0 + (eoObject *obj) + + + + eoState + d1 + (const eoState &) + + + eoState & + operator= + d2 + (const eoState &) + + + ObjectMap + objectMap + r0 + + + + std::vector< ObjectMap::iterator > + creationOrder + r1 + + + + std::vector< eoPersistent * > + ownedObjects + r2 + + + + + eoState::loading_error + structeo_state_1_1loading__error.html + + + loading_error + a0 + (std::string huh="Error while loading") + + + + eoStBranchMutation + classeo_st_branch_mutation.html + FType + Node + eoMonOp< eoParseTree< FType, Node > > + + eoParseTree< FType, Node > + EoType + w0 + + + + + eoStBranchMutation + a0 + (eoInit< EoType > &_init, unsigned _max_length) + + + virtual std::string + className + a1 + () const + + + virtual + ~eoStBranchMutation + a2 + () + + + bool + operator() + a3 + (EoType &_eo1) + + + unsigned + max_length + r0 + + + + eoInit< EoType > & + initializer + r1 + + + + + eoStdoutMonitor + classeo_stdout_monitor.html + eoMonitor + + + eoStdoutMonitor + a0 + (bool _verbose=true, std::string _delim="\t") + + + eoMonitor & + operator() + a1 + (void) + + + virtual std::string + className + a2 + (void) const + + + bool + verbose + r0 + + + + std::string + delim + r1 + + + + bool + firsttime + r2 + + + + + eoSteadyFitContinue + classeo_steady_fit_continue.html + EOT + eoContinue + + EOT::Fitness + Fitness + w0 + + + + + eoSteadyFitContinue + a0 + (unsigned long _minGens, unsigned long _steadyGens) + + + + eoSteadyFitContinue + a1 + (unsigned long _minGens, unsigned long _steadyGen, unsigned long &_currentGen) + + + virtual bool + operator() + a2 + (const eoPop< EOT > &_vEO) + + + virtual void + totalGenerations + a3 + (unsigned long _mg, unsigned long _sg) + + + virtual void + reset + a4 + () + + + virtual unsigned long + minGenerations + a5 + () + + + virtual unsigned long + steadyGenerations + a6 + () + + + virtual std::string + className + a7 + (void) const + + + unsigned long + repMinGenerations + r0 + + + + unsigned long + repSteadyGenerations + r1 + + + + bool + steadyState + r2 + + + + unsigned long + thisGenerationPlaceHolder + r3 + + + + unsigned long & + thisGeneration + r4 + + + + unsigned int + lastImprovement + r5 + + + + Fitness + bestSoFar + r6 + + + + + eoStHoistMutation + classeo_st_hoist_mutation.html + FType + Node + eoMonOp< eoParseTree< FType, Node > > + + eoParseTree< FType, Node > + EoType + w0 + + + + + eoStHoistMutation + a0 + (eoInit< EoType > &_init, unsigned _max_length) + + + virtual std::string + className + a1 + () const + + + virtual + ~eoStHoistMutation + a2 + () + + + bool + operator() + a3 + (EoType &_eo1) + + + unsigned + max_length + r0 + + + + eoInit< EoType > & + initializer + r1 + + + + + eoSTLBF + classeo_s_t_l_b_f.html + A1 + A2 + R + + + eoSTLBF + a0 + (eoUF< A1, R > &_f) + + + R + operator() + a1 + (A1 a1, A2 a2) + + + eoBF< A1, A2, R > & + f + r0 + + + + + eoSTLF + classeo_s_t_l_f.html + R + + R + result_type + w0 + + + + + eoSTLF + a0 + (eoF< R > &_f) + + + R + operator() + a1 + (void) + + + eoF< R > & + f + r0 + + + + + eoSTLUF + classeo_s_t_l_u_f.html + A1 + R + + + eoSTLUF + a0 + (eoUF< A1, R > &_f) + + + R + operator() + a1 + (A1 a) + + + eoUF< A1, R > & + f + r0 + + + + + eoStochasticUniversalSelect + classeo_stochastic_universal_select.html + EOT + eoSelectOne< EOT > + + + eoStochasticUniversalSelect + a0 + (const eoPop< EOT > &pop=eoPop< EOT >()) + + + void + setup + a1 + (const eoPop< EOT > &_pop) + + + const EOT & + operator() + a2 + (const eoPop< EOT > &_pop) + + + std::vector< unsigned > + IndexVec + y0 + + + + IndexVec + indices + r0 + + + + + eoStochTournamentSelect + classeo_stoch_tournament_select.html + EOT + eoSelectOne< EOT > + + + eoStochTournamentSelect + a0 + (double _Trate=1.0) + + + virtual const EOT & + operator() + a1 + (const eoPop< EOT > &pop) + + + double + Trate + r0 + + + + + eoStochTournamentTruncate + classeo_stoch_tournament_truncate.html + EOT + eoReduce + + + eoStochTournamentTruncate + a0 + (double _t_rate) + + + void + operator() + a1 + (eoPop< EOT > &_newgen, unsigned _newsize) + + + double + t_rate + r0 + + + + + eoStochTournamentTruncateSplit + classeo_stoch_tournament_truncate_split.html + EOT + eoReduce + + + eoStochTournamentTruncateSplit + a0 + (double _t_rate, eoHowMany _howMany, bool _returnEliminated=false) + + + void + operator() + a1 + (eoPop< EOT > &_newgen, eoPop< EOT > &_eliminated) + + + double + t_rate + r0 + + + + eoHowMany + howMany + r1 + + + + bool + returnEliminated + r2 + + + + + eoStochTournamentWorthSelect + classeo_stoch_tournament_worth_select.html + EOT + WorthT + eoSelectFromWorth< EOT, WorthT > + + std::vector< WorthT >::iterator + worthIterator + w0 + + + + + eoStochTournamentWorthSelect + a0 + (eoPerf2Worth< EOT, WorthT > &_perf2Worth, double _tRate) + + + virtual const EOT & + operator() + a1 + (const eoPop< EOT > &_pop) + + + double + tRate + r0 + + + + + eoStParseTreeDepthInit + classeo_st_parse_tree_depth_init.html + FType + Node + eoInit< eoParseTree< FType, Node > > + + eoParseTree< FType, Node > + EoType + w0 + + + + + eoStParseTreeDepthInit + a0 + (unsigned _max_depth, const std::vector< Node > &_node, const int &_return_type, bool _grow=true) + + + virtual std::string + className + a1 + () const + + + void + operator() + a2 + (EoType &_tree) + + + bool + generate + d0 + (std::list< Node > &sequence, int the_max, int request_type) + + + unsigned + max_depth + r0 + + + + map< int, map< int, std::vector< Node > > > + node + r1 + + + + int + return_type + r2 + + + + bool + grow + r3 + + + + + eoStPointMutation + classeo_st_point_mutation.html + FType + Node + eoMonOp< eoParseTree< FType, Node > > + + eoParseTree< FType, Node > + EoType + w0 + + + + + eoStPointMutation + a0 + (std::vector< Node > &_node) + + + virtual std::string + className + a1 + () const + + + virtual + ~eoStPointMutation + a2 + () + + + bool + operator() + a3 + (EoType &_eo1) + + + map< int, map< int, std::vector< Node > > > + node + r0 + + + + + eoString + classeo_string.html + fitnessT + EO< fitnessT > + + char + Type + w0 + + + + char + AtomType + w1 + + + + std::string + ContainerType + w2 + + + + + eoString + z24_0 + (const std::string &_str="") + + + virtual void + printOn + z24_1 + (std::ostream &os) const + + + virtual std::string + className + z26_0 + () const + + + + eoStSubtreeXOver + classeo_st_subtree_x_over.html + FType + Node + eoQuadOp< eoParseTree< FType, Node > > + + eoParseTree< FType, Node > + EoType + w0 + + + + + eoStSubtreeXOver + a0 + (unsigned _max_length) + + + virtual std::string + className + a1 + () const + + + virtual + ~eoStSubtreeXOver + a2 + () + + + bool + operator() + a3 + (EoType &_eo1, EoType &_eo2) + + + unsigned + max_length + r0 + + + + + eoSubtreeXOver + classeo_subtree_x_over.html + FType + Node + eoQuadOp< eoParseTree< FType, Node > > + + eoParseTree< FType, Node > + EoType + w0 + + + + + eoSubtreeXOver + a0 + (unsigned _max_length) + + + virtual std::string + className + a1 + () const + + + virtual + ~eoSubtreeXOver + a2 + () + + + bool + operator() + a3 + (EoType &_eo1, EoType &_eo2) + + + unsigned + max_length + r0 + + + + + eoSurviveAndDie + classeo_survive_and_die.html + EOT + eoBF< eoPop< EOT > &, eoPop< EOT > &, void > + + + eoSurviveAndDie + a0 + (double _survive, double _die, bool _interpret_as_rate=true) + + + eoHowMany + howmanySurvive + p0 + + + + eoHowMany + howmanyDie + p1 + + + + + eoSymInit + classeo_sym_init.html + EoType + eoInit< EoType > + + + eoSymInit + a0 + (TreeBuilder &_builder) + + + + eoSymInit + a1 + (TreeBuilder &_builder, double &_grow_prob, unsigned &_max_depth) + + + void + operator() + a2 + (EoType &tree) + + + TreeBuilder & + builder + r0 + + + + double + own_grow_prob + r1 + + + + unsigned + own_max_depth + r2 + + + + double & + grow_prob + r3 + + + + unsigned & + max_depth + r4 + + + + + T_pickle_suite + struct_t__pickle__suite.html + T + + std::string + print_to_string + e0 + (const T &t) + + + boost::python::tuple + getstate + e1 + (const T &t) + + + void + setstate + e2 + (T &t, boost::python::tuple pickled) + + + + eoTimeCounter + classeo_time_counter.html + eoUpdater + eoValueParam< double > + + virtual void + operator() + a1 + () + + + clock_t + utime + r0 + + + + + eoTimedDynUpdate + classeo_timed_dyn_update.html + eoDynUpdater + + + eoTimedDynUpdate + a0 + (eoUpdatable &_toUpdate, time_t _interval) + + + void + operator() + a1 + (void) + + + const time_t + interval + r0 + + + + time_t + last_time + r1 + + + + const time_t + first_time + r2 + + + + + eoTimedMonitor + classeo_timed_monitor.html + eoMonitor + + + eoTimedMonitor + a0 + (int seconds_) + + + eoMonitor & + operator() + a1 + (void) + + + void + add + a2 + (eoMonitor &mon) + + + virtual std::string + className + a3 + (void) const + + + clock_t + last_tick + r0 + + + + int + seconds + r1 + + + + std::vector< eoMonitor * > + monitors + r2 + + + + + eoTimedStateSaver + classeo_timed_state_saver.html + eoUpdater + + + eoTimedStateSaver + a0 + (time_t _interval, const eoState &_state, std::string _prefix="state", std::string _extension="sav") + + + void + operator() + a1 + (void) + + + virtual std::string + className + a2 + (void) const + + + const eoState & + state + r0 + + + + const time_t + interval + r1 + + + + time_t + last_time + r2 + + + + const time_t + first_time + r3 + + + + const std::string + prefix + r4 + + + + const std::string + extension + r5 + + + + + eoTimeVaryingLoopEval + classeo_time_varying_loop_eval.html + EOT + eoPopEvalFunc + + + eoTimeVaryingLoopEval + a0 + (eoEvalFunc< EOT > &_eval) + + + void + operator() + a1 + (eoPop< EOT > &_parents, eoPop< EOT > &_offspring) + + + eoEvalFunc< EOT > & + eval + r0 + + + + + eoTransform + classeo_transform.html + EOT + eoUF< eoPop< EOT > &, void > + + + eoTruncate + classeo_truncate.html + EOT + eoReduce + + void + operator() + d0 + (eoPop< EOT > &_newgen, unsigned _newsize) + + + + eoTruncatedSelectMany + classeo_truncated_select_many.html + EOT + eoSelect + + + eoTruncatedSelectMany + a0 + (eoSelectOne< EOT > &_select, double _rateGenitors, double _rateFertile, bool _interpret_as_rateG=true, bool _interpret_as_rateF=true) + + + + eoTruncatedSelectMany + a1 + (eoSelectOne< EOT > &_select, eoHowMany _howManyGenitors, eoHowMany _howManyFertile) + + + virtual void + operator() + a2 + (const eoPop< EOT > &_source, eoPop< EOT > &_dest) + + + eoSelectOne< EOT > & + select + r0 + + + + eoHowMany + howManyGenitors + r1 + + + + eoHowMany + howManyFertile + r2 + + + + + eoTruncatedSelectOne + classeo_truncated_select_one.html + EOT + eoSelectOne< EOT > + + + eoTruncatedSelectOne + a0 + (eoSelectOne< EOT > &_select, double _rateFertile, bool _interpret_as_rateF=true) + + + + eoTruncatedSelectOne + a1 + (eoSelectOne< EOT > &_select, eoHowMany _howManyFertile) + + + void + setup + a2 + (const eoPop< EOT > &_source) + + + const EOT & + operator() + a3 + (const eoPop< EOT > &_pop) + + + eoSelectOne< EOT > & + select + r0 + + + + eoHowMany + howManyFertile + r1 + + + + eoPop< EOT > + tmpPop + r2 + + + + eoPop< EOT > & + actualPop + r3 + + + + + eoTruncateSplit + classeo_truncate_split.html + EOT + eoReduceSplit + + + eoTruncateSplit + a0 + (eoHowMany _howMany, bool _returnEliminated=false) + + + void + operator() + a1 + (eoPop< EOT > &_newgen, eoPop< EOT > &_eliminated) + + + eoHowMany + howMany + r0 + + + + bool + returnEliminated + r1 + + + + + eoTruncSelect + classeo_trunc_select.html + EOT + eoSelect + + + eoTruncSelect + a0 + (eoSelectOne< EOT > &_select, eoHowMany _howMany) + + + virtual void + operator() + a1 + (const eoPop< EOT > &_source, eoPop< EOT > &_dest) + + + eoSelectOne< EOT > & + select + r0 + + + + eoHowMany + howMany + r1 + + + + + eoUBitXover + classeo_u_bit_xover.html + Chrom + eoQuadOp< Chrom > + + + eoUBitXover + a0 + (const float &_preference=0.5) + + + virtual std::string + className + a1 + () const + + + bool + operator() + a2 + (Chrom &chrom1, Chrom &chrom2) + + + float + preference + r0 + + + + + eoUF + classeo_u_f.html + A1 + R + eoFunctorBase + + virtual + ~eoUF + a0 + () + + + virtual R + operator() + a1 + (A1)=0 + + + eoFunctorBase::unary_function_tag + functor_category + e0 + () + + + + UF_random_generator + class_u_f__random__generator.html + T + + + UF_random_generator + a0 + (eoRng &_rng=rng) + + + T + operator() + a1 + (T _t) + + + eoRng & + random + r0 + + + + + eoUnaryFunctorCounter + classeo_unary_functor_counter.html + UnaryFunctor + eoValueParam< unsigned long > + + + eoUnaryFunctorCounter + a0 + (UnaryFunctor &_func, std::string _name="uf_counter") + + + UnaryFunctor::result_type + operator() + a1 + (typename UnaryFunctor::first_argument_type _arg1) + + + UnaryFunctor & + func + r0 + + + + + uniform_generator + classuniform__generator.html + T + + + uniform_generator + a0 + (T _max=T(1.0), eoRng &_rng=rng) + + + + uniform_generator + a1 + (T _min, T _max, eoRng &_rng=rng) + + + T + operator() + a2 + (void) + + + T + minim + r0 + + + + T + range + r1 + + + + eoRng & + uniform + r2 + + + + + eoUniformAtomExchange + classeo_uniform_atom_exchange.html + Atom + eoAtomExchange + + + eoUniformAtomExchange + a0 + (double _rate=0.5) + + + void + randomize + a1 + (unsigned _size1, unsigned _size2) + + + bool + operator() + a2 + (unsigned _i, Atom &) + + + virtual std::string + className + a3 + () const + + + double + rate + r0 + + + + std::vector< bool > + mask + r1 + + + + + eoUniformGeneChooser + classeo_uniform_gene_chooser.html + EOT + eoGeneDelChooser + + unsigned + operator() + a1 + (EOT &_eo) + + + virtual std::string + className + a2 + () const + + + + eoUniformGenerator + classeo_uniform_generator.html + T + eoRndGenerator + + + eoUniformGenerator + a0 + (T _max=T(1.0), eoRng &_rng=rng) + + + + eoUniformGenerator + a1 + (T _min, T _max, eoRng &_rng=rng) + + + T + operator() + a2 + (void) + + + bool + operator() + a3 + (void) + + + T + minim + r0 + + + + T + range + r1 + + + + eoRng & + uniform + r2 + + + + + eoUniformInit + classeo_uniform_init.html + T + eoInit< T > + + + eoUniformInit + a0 + (T _max=T(1.0), eoRng &_rng=rng) + + + + eoUniformInit + a1 + (eoRealBounds &_bound, eoRng &_rng=rng) + + + + eoUniformInit + a2 + (T _min, T _max, eoRng &_rng=rng) + + + void + operator() + a3 + (T &_t) + + + void + operator() + a4 + (bool &_b) + + + T + minim + r0 + + + + T + range + r1 + + + + eoRng & + uniform + r2 + + + + + eoUniformMutation + classeo_uniform_mutation.html + EOT + eoMonOp< EOT > + + + eoUniformMutation + a0 + (const double &_epsilon, const double &_p_change=1.0) + + + + eoUniformMutation + a1 + (eoRealVectorBounds &_bounds, const double &_epsilon, const double &_p_change=1.0) + + + + eoUniformMutation + a2 + (eoRealVectorBounds &_bounds, const std::vector< double > &_epsilon, const std::vector< double > &_p_change) + + + virtual std::string + className + a3 + () const + + + bool + operator() + a4 + (EOT &_eo) + + + bool + homogeneous + r0 + + + + eoRealVectorBounds & + bounds + r1 + + + + std::vector< double > + epsilon + r2 + + + + std::vector< double > + p_change + r3 + + + + + eoUpdatable + classeo_updatable.html + + virtual + ~eoUpdatable + a0 + () + + + virtual void + update + a1 + ()=0 + + + + eoUpdater + classeo_updater.html + eoF< void > + + virtual void + lastCall + a0 + () + + + virtual std::string + className + a1 + (void) const + + + + eoValueParam + classeo_value_param.html + ValueType + eoParam + + + eoValueParam + a0 + (void) + + + + eoValueParam + a1 + (ValueType _defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false) + + + ValueType & + value + a2 + () + + + const ValueType & + value + a3 + () const + + + std::string + getValue + a4 + (void) const + + + void + setValue + a5 + (const std::string &_value) + + + ValueType + repValue + p0 + + + + + eoVariableParetoTraits + classeo_variable_pareto_traits.html + eoParetoFitnessTraits + + void + setUp + e0 + (unsigned _n, std::vector< bool > &_b) + + + unsigned + nObjectives + e1 + () + + + bool + maximizing + e2 + (unsigned _i) + + + unsigned + nObj + v0 + + + + std::vector< bool > + bObj + v1 + + + + + eoVector + classeo_vector.html + FitT + GeneType + EO< FitT > + + GeneType + AtomType + w0 + + + + std::vector< GeneType > + ContainerType + w1 + + + + + eoVector + a0 + (unsigned size=0, GeneType value=GeneType()) + + + + eoVector + a1 + (const eoVector< OtherFitnessType, GeneType > &_vec) + + + void + value + a2 + (const std::vector< GeneType > &_v) + + + bool + operator< + a3 + (const eoVector< FitT, GeneType > &_eo) const + + + virtual void + printOn + a4 + (std::ostream &os) const + + + virtual void + readFrom + a5 + (std::istream &is) + + + + VirusBitFlip + class_virus_bit_flip.html + FitT + eoMonOp< eoVirus< FitT > > + + virtual std::string + className + a0 + () const + + + bool + operator() + a1 + (eoVirus< FitT > &_chrom) + + + + VirusShiftMutation + class_virus_shift_mutation.html + FitT + eoMonOp< eoVirus< FitT > > + + + VirusShiftMutation + a0 + () + + + virtual std::string + className + a1 + () const + + + bool + operator() + a2 + (eoVirus< FitT > &_chrom) + + + + eoVlAddMutation + classeo_vl_add_mutation.html + EOT + eoMonOp< EOT > + + EOT::AtomType + AtomType + w0 + + + + + eoVlAddMutation + a0 + (unsigned _nMax, eoInit< AtomType > &_atomInit) + + + bool + operator() + a1 + (EOT &_eo) + + + virtual std::string + className + a2 + () const + + + unsigned + nMax + r0 + + + + eoInit< AtomType > & + atomInit + r1 + + + + + eoVlAtomExchangeQuadOp + classeo_vl_atom_exchange_quad_op.html + EOT + eoQuadOp< EOT > + + EOT::AtomType + AtomType + w0 + + + + + eoVlAtomExchangeQuadOp + a0 + (unsigned _Min, unsigned _Max, eoAtomExchange< AtomType > &_atomExchange) + + + bool + operator() + a1 + (EOT &_eo1, EOT &_eo2) + + + virtual std::string + className + a2 + () const + + + unsigned + Min + r0 + + + + unsigned + Max + r1 + + + + eoAtomExchange< AtomType > & + atomExchange + r2 + + + + + eoVlDelMutation + classeo_vl_del_mutation.html + EOT + eoMonOp< EOT > + + EOT::AtomType + AtomType + w0 + + + + + eoVlDelMutation + a0 + (unsigned _nMin, eoGeneDelChooser< EOT > &_chooser) + + + + eoVlDelMutation + a1 + (unsigned _nMin) + + + bool + operator() + a2 + (EOT &_eo) + + + virtual std::string + className + a3 + () const + + + unsigned + nMin + r0 + + + + eoUniformGeneChooser< EOT > + uChooser + r1 + + + + eoGeneDelChooser< EOT > & + chooser + r2 + + + + + eoVlUniformBinOp + classeo_vl_uniform_bin_op.html + EOT + eoBinOp< EOT > + + EOT::AtomType + AtomType + w0 + + + + + eoVlUniformBinOp + a0 + (unsigned _Min, unsigned _Max, double _rate=0.5) + + + bool + operator() + a1 + (EOT &_eo1, const EOT &_eo2) + + + unsigned + Min + r0 + + + + unsigned + Max + r1 + + + + double + rate + r2 + + + + + eoVlUniformQuadOp + classeo_vl_uniform_quad_op.html + EOT + eoQuadOp< EOT > + + EOT::AtomType + AtomType + w0 + + + + + eoVlUniformQuadOp + a0 + (unsigned _Min, unsigned _Max, double _rate=0.5) + + + bool + operator() + a1 + (EOT &_eo1, EOT &_eo2) + + + unsigned + Min + r0 + + + + unsigned + Max + r1 + + + + double + rate + r2 + + + + + eoWeakElitistReplacement + classeo_weak_elitist_replacement.html + EOT + eoReplacement + + EOT::Fitness + Fitness + w0 + + + + + eoWeakElitistReplacement + a0 + (eoReplacement< EOT > &_replace) + + + void + operator() + a1 + (eoPop< EOT > &_pop, eoPop< EOT > &_offspring) + + + eoReplacement< EOT > & + replace + r0 + + + + + webpages + Related webpages + webpages + + + Related + Projects + related + + + Bitstring + Bitstring + group__bitstring.html + eoBit + eoBit + eoBitBitFlip + eoDetBitFlip + eoBitMutation + eoBitInversion + eoBitNext + eoBitPrev + eo1PtBitCrossover + eoUBitXover + eoNPtsBitXover + eoBitGxOver + + + Operators + Operators + group___operators.html + + + PropCombinedOperators + PropCombinedOperators + group___prop_combined_operators.html + + + ParseTree + ParseTree + group___parse_tree.html + eoParseTree + eoParseTreeDepthInit + eoSubtreeXOver + eoBranchMutation + eoPointMutation + eoExpansionMutation + eoCollapseSubtreeMutation + eoHoistMutation + + void + eoInitRampedHalfAndHalf + ga0 + (eoPop< eoParseTree< FType, Node > > &pop, unsigned int population_size, unsigned int init_max_depth, std::vector< Node > &initializor) + + + + StParseTree + StParseTree + group___st_parse_tree.html + eoStParseTreeDepthInit + eoStSubtreeXOver + eoStBranchMutation + eoStPointMutation + eoStHoistMutation + + + EvolutionStrategies + EvolutionStrategies + group___evolution_strategies.html + eoEsChromInit + eoEsFull + eoEsMutate + eoEsMutationInit + eoEsSimple + eoEsStdev + eoIntBounds + eoRealBounds + + + Selectors + Selectors + group__selectors.html + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/app/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/app/ + dir_000020.html + /users/dsa/marc/WWW/EO/eo.19Oct2006/app/gprop/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/app/gpsymreg/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/app/mastermind/ + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/ + dir_000007.html + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/MGE/ + eoAged.h + eoDrawable.h + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/src/do/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/src/do/ + dir_000025.html + make_algo_easea.h + make_algo_pareto.h + make_algo_scalar.h + make_checkpoint.h + make_checkpoint_assembled.h + make_checkpoint_FDC.h + make_checkpoint_pareto.h + make_continue.h + make_continue_pareto.h + make_general_replacement.h + make_pop.h + make_run.h + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eo_interface/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eo_interface/ + dir_000018.html + eoSym.h + eoSymCrossover.cpp + eoSymCrossover.h + eoSymEval.h + eoSymInit.h + eoSymLambdaMutate.cpp + eoSymLambdaMutate.h + eoSymMutate.cpp + eoSymMutate.h + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/ + dir_000010.html + CMAParams.cpp + CMAParams.h + CMAState.cpp + CMAState.h + eig.cpp + eig.h + eoCMABreed.h + eoCMAInit.h + eoEsChromInit.h + eoEsFull.h + eoEsGlobalXover.h + eoEsMutate.h + eoEsMutationInit.h + eoEsSimple.h + eoEsStandardXover.h + eoEsStdev.h + eoNormalMutation.h + eoReal.h + eoRealAtomXover.h + eoRealInitBounded.h + eoRealOp.h + eoSBXcross.h + make_algo_scalar_es.cpp + make_algo_scalar_real.cpp + make_checkpoint_es.cpp + make_checkpoint_real.cpp + make_continue_es.cpp + make_continue_real.cpp + make_es.h + make_genotype_es.cpp + make_genotype_real.cpp + make_genotype_real.h + es/make_op.h + make_op_es.cpp + make_op_es.h + make_op_real.cpp + make_op_real.h + make_pop_es.cpp + make_pop_real.cpp + make_real.h + make_run_es.cpp + make_run_real.cpp + matrices.h + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eval/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eval/ + dir_000009.html + BoundsCheck.cpp + BoundsCheck.h + Interval.h + MultiFuncs.cpp + MultiFunction.cpp + MultiFunction.h + sym_compile.cpp + sym_compile.h + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/fun/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/fun/ + dir_000022.html + FunDef.cpp + FunDef.h + sym_operations.cpp + SymOps.cpp + SymOps.h + util.cpp + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/ + dir_000013.html + eoBit.h + eoBitOp.h + eoBitOpFactory.h + eoBoolFlip.h + eoPBILAdditive.h + eoPBILDistrib.h + eoPBILOrg.h + make_algo_scalar_ga.cpp + make_checkpoint_ga.cpp + make_continue_ga.cpp + make_ga.h + make_genotype_ga.cpp + make_genotype_ga.h + ga/make_op.h + make_op_ga.cpp + make_PBILdistrib.h + make_PBILupdate.h + make_pop_ga.cpp + make_run_ga.cpp + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/gen/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/gen/ + dir_000024.html + LanguageTable.cpp + LanguageTable.h + NodeSelector.cpp + NodeSelector.h + TreeBuilder.cpp + TreeBuilder.h + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/ + dir_000017.html + eoParseTree.h + eoParseTreeDepthInit.h + eoParseTreeOp.h + eoStParseTreeDepthInit.h + eoStParseTreeOp.h + node_pool.h + parse_tree.h + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/app/gprop/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/app/gprop/ + dir_000023.html + gprop.cpp + gprop.h + l2.h + mlp.h + mse.h + qp.h + vecop.h + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/app/gpsymreg/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/app/gpsymreg/ + dir_000021.html + fitness.h + main.cpp + node.h + parameters.h + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson1/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson1/ + dir_000019.html + exercise1.3.cpp + FirstBitGA.cpp + FirstRealGA.cpp + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson2/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson2/ + dir_000004.html + tutorial/Lesson2/binary_value.h + exercise2.3.cpp + FirstBitEA.cpp + FirstRealEA.cpp + tutorial/Lesson2/real_value.h + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson3/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson3/ + dir_000005.html + tutorial/Lesson3/binary_value.h + exercise3.1.cpp + tutorial/Lesson3/real_value.h + SecondBitEA.cpp + SecondRealEA.cpp + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson4/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson4/ + dir_000006.html + tutorial/Lesson4/binary_value.h + BitEA.cpp + ESEA.cpp + tutorial/Lesson4/real_value.h + RealEA.cpp + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson5/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson5/ + dir_000016.html + eoOneMax.h + eoOneMaxEvalFunc.h + eoOneMaxInit.h + eoOneMaxMutation.h + eoOneMaxQuadCrossover.h + make_genotype_OneMax.h + make_OneMax.cpp + make_op_OneMax.h + OneMaxEA.cpp + OneMaxLibEA.cpp + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/app/mastermind/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/app/mastermind/ + dir_000027.html + mastermind.cpp + mastermind.h + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/ + dir_000008.html + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eo_interface/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eval/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/fun/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/gen/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/sym/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/test/ + contrib/mathsym/README + shared_ptr.h + symreg.cpp + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/MGE/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/MGE/ + dir_000015.html + eoInitVirus.h + eoVirus.h + VirusOp.h + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/src/other/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/src/other/ + dir_000014.html + eoExternalEO.h + eoExternalOpFunctions.h + eoString.h + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/ + dir_000001.html + abstract1.cpp + algos.cpp + breeders.cpp + continuators.cpp + def_abstract_functor.h + geneticOps.cpp + mergers.cpp + monitors.cpp + src/pyeo/NEWS + perf2worth.cpp + pickle.h + PyEO.cpp + PyEO.h + random_numbers.cpp + src/pyeo/README + reduce.cpp + replacement.cpp + selectOne.cpp + selectors.cpp + statistics.cpp + valueParam.cpp + valueParam.h + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/ + dir_000012.html + Dataset.cpp + Dataset.h + ErrorMeasure.cpp + ErrorMeasure.h + Scaling.cpp + Scaling.h + stats.h + TargetInfo.cpp + TargetInfo.h + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/src/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/src/ + dir_000000.html + /users/dsa/marc/WWW/EO/eo.19Oct2006/src/do/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/src/other/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/ + apply.h + EO.h + eoAlgo.h + eoBreed.h + eoCellularEasyEA.h + eoCloneOps.h + eoCombinedContinue.h + eoCombinedInit.h + eoContinue.h + eoCounter.h + eoCtrlCContinue.cpp + eoCtrlCContinue.h + eoDetSelect.h + eoDetTournamentSelect.h + eoDistribUpdater.h + eoDistribution.h + eoDominanceMap.h + eoEasyEA.h + eoEDA.h + eoEvalContinue.h + eoEvalFunc.h + eoEvalFuncCounter.h + eoEvalFuncPtr.h + eoFactory.h + eoFitContinue.h + eoFitnessScalingSelect.h + eoFlOrBinOp.h + eoFlOrMonOp.h + eoFlOrQuadOp.h + eoFunctor.h + eoFunctorStore.cpp + eoFunctorStore.h + eoG3Replacement.h + eoGenContinue.h + eoGeneralBreeder.h + eoGenOp.h + eoInit.h + eoInvalidateOps.h + eoLinearFitScaling.h + eoMerge.h + eoMergeReduce.h + eoMGGReplacement.h + eoNDSorting.h + eoObject.h + eoOneToOneBreeder.h + eoOp.h + eoOpContainer.h + eoOpSelMason.h + eoParetoConstraintFitness.h + eoParetoFitness.cpp + eoParetoFitness.h + eoParetoRanking.h + eoPerf2Worth.h + eoPeriodicContinue.h + eoPersistent.cpp + eoPersistent.h + eoPop.h + eoPopAlgo.h + eoPopEvalFunc.h + eoPopulator.h + eoPrintable.cpp + eoPrintable.h + eoPropGAGenOp.h + eoProportionalCombinedOp.h + eoProportionalSelect.h + eoRandomSelect.h + eoRanking.h + eoRankingSelect.h + eoReduce.h + eoReduceMerge.h + eoReduceMergeReduce.h + eoReduceSplit.h + eoReplacement.h + eoScalarFitness.h + eoScalarFitnessAssembled.cpp + eoScalarFitnessAssembled.h + eoSelect.h + eoSelectFactory.h + eoSelectFromWorth.h + eoSelectMany.h + eoSelectNumber.h + eoSelectOne.h + eoSelectPerc.h + eoSequentialSelect.h + eoSGA.h + eoSGAGenOp.h + eoSGATransform.h + eoSharing.h + eoSharingSelect.h + eoSimpleEDA.h + eoSteadyFitContinue.h + eoSTLFunctor.h + eoStochasticUniversalSelect.h + eoStochTournamentSelect.h + eoSurviveAndDie.h + eoTransform.h + eoTruncatedSelectMany.h + eoTruncatedSelectOne.h + eoTruncSelect.h + eoVariableLengthCrossover.h + eoVariableLengthMutation.h + eoVector.h + es.h + ga.h + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/sym/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/sym/ + dir_000028.html + README.cpp + Sym.cpp + Sym.h + SymImpl.cpp + SymImpl.h + token.h + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Templates/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Templates/ + dir_000026.html + make_genotype_MyStruct.h + make_MyStruct.cpp + make_op_MyStruct.h + MyStructEA.cpp + MyStructLibEA.cpp + MyStructSEA.cpp + tutorial/Templates/README + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/test/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/test/ + dir_000029.html + test_compile.cpp + test_diff.cpp + test_lambda.cpp + test_mf.cpp + test_simplify.cpp + testeo.cpp + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/test/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/test/ + dir_000002.html + test/binary_value.h + fitness_traits.cpp + test/real_value.h + RoyalRoad.h + t-eo.cpp + t-eoAtomOps.cpp + t-eoBaseFunctions.cpp + t-eobin.cpp + t-eobreeder.cpp + t-eoCheckpointing.cpp + t-eoCMAES.cpp + t-eoEasyEA.cpp + t-eoESAll.cpp + t-eoESFull.cpp + t-eoESOps.cpp + t-eoExternalEO.cpp + t-eofitness.cpp + t-eoFitnessAssembled.cpp + t-eoFitnessAssembledEA.cpp + t-eoFunctor.cpp + t-eoGA.cpp + t-eogeneration.cpp + t-eoGenOp.cpp + t-eoGOpSel.cpp + t-eoinclusion.cpp + t-eoinsertion.cpp + t-eolottery.cpp + t-eoNonUniform.cpp + t-eoPareto.cpp + t-eoParetoFitness.cpp + t-eoPBIL.cpp + t-eoproblem.cpp + t-eoRandom.cpp + t-eoReal.cpp + t-eoReplacement.cpp + t-eoRoulette.cpp + t-eoSelect.cpp + t-eoSharing.cpp + t-eoSSGA.cpp + t-eoStateAndParser.cpp + t-eoSymreg.cpp + t-eoUniform.cpp + t-eoVector.cpp + t-eoVirus.cpp + t-MGE-control.cpp + t-MGE.cpp + t-MGE1bit.cpp + t-selectOne.cpp + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/ + dir_000003.html + /users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson1/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson2/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson3/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson4/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson5/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Templates/ + tutorial/README + + + /users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/ + /users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/ + dir_000011.html + compatibility.h + eoAssembledFitnessStat.h + eoCheckPoint.h + eoData.cpp + eoData.h + eoDistance.h + eoFDCStat.h + eoFileMonitor.cpp + eoFileMonitor.h + eoFileSnapshot.h + eoGnuplot.cpp + eoGnuplot.h + eoGnuplot1DMonitor.cpp + eoGnuplot1DMonitor.h + eoGnuplot1DSnapshot.cpp + eoGnuplot1DSnapshot.h + eoHowMany.h + eoIntBounds.cpp + eoIntBounds.h + eoMOFitnessStat.h + eoMonitor.h + eoParam.h + eoParser.cpp + eoParser.h + eoPopStat.h + eoRealBounds.cpp + eoRealBounds.h + eoRealVectorBounds.h + eoRndGenerators.h + eoRNG.cpp + eoRNG.h + eoScalarFitnessStat.h + eoStat.h + eoState.cpp + eoState.h + eoStdoutMonitor.cpp + eoStdoutMonitor.h + eoTimeCounter.h + eoTimedMonitor.h + eoUniformInit.h + eoUpdatable.h + eoUpdater.cpp + eoUpdater.h + make_help.cpp + pipecom.cpp + pipecom.h + rnd_generators.h + selectors.h + + + gp_parse_tree + namespacegp__parse__tree.html + gp_parse_tree::MemPool + gp_parse_tree::MemPool::Link + gp_parse_tree::MemPool::Chunk + gp_parse_tree::Node_alloc + gp_parse_tree::Standard_alloc + gp_parse_tree::Standard_Node_alloc + gp_parse_tree::Tree_alloc + gp_parse_tree::parse_tree + gp_parse_tree::parse_tree::subtree + gp_parse_tree::parse_tree::base_iterator + gp_parse_tree::parse_tree::iterator + gp_parse_tree::parse_tree::embedded_iterator + gp_parse_tree::parse_tree::base_const_iterator + gp_parse_tree::parse_tree::const_iterator + gp_parse_tree::parse_tree::embedded_const_iterator + + void + do_the_swap + a0 + (T &a, T &b) + + + + gp_parse_tree::MemPool + classgp__parse__tree_1_1_mem_pool.html + + + MemPool + a0 + (unsigned int sz) + + + void * + allocate + a2 + () + + + void + deallocate + a3 + (void *b) + + + void + grow + d0 + () + + + Chunk * + chunks + r0 + + + + const unsigned int + esize + r1 + + + + Link * + head + r2 + + + + diff --git a/trunk/paradiseo-eo/doc/html/_bit_e_a_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_bit_e_a_8cpp-source.html new file mode 100644 index 000000000..c55150c29 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_bit_e_a_8cpp-source.html @@ -0,0 +1,102 @@ + + +EO: BitEA.cpp Source File + + + + +
+tutorial / Lesson4
+

BitEA.cpp

00001 #include <iostream>
+00002 
+00003 #include <ga/make_ga.h>
+00004 #include <apply.h>
+00005 
+00006 // EVAL
+00007 #include "binary_value.h"
+00008 
+00009 // GENERAL
+00010 using namespace std;
+00011 
+00012 int main(int argc, char* argv[])
+00013 {     
+00014 
+00015   try
+00016   {
+00017 // REPRESENTATION
+00018 //-----------------------------------------------------------------------------
+00019 // define your genotype and fitness types
+00020   typedef eoBit<double> EOT;
+00021 
+00022 // PARAMETRES
+00023   eoParser parser(argc, argv);  // for user-parameter reading
+00024 
+00025 // GENERAL
+00026   eoState state;    // keeps all things allocated
+00027 
+00030 
+00031 // EVAL
+00032   // The evaluation fn - encapsulated into an eval counter for output 
+00033   eoEvalFuncPtr<EOT, double> mainEval( binary_value<EOT> );
+00034   eoEvalFuncCounter<EOT> eval(mainEval);
+00035 
+00036 // REPRESENTATION
+00037   // the genotype - through a genotype initializer
+00038   eoInit<EOT>& init = make_genotype(parser, state, EOT());
+00039 
+00040   // if you want to do sharing, you'll need a distance.
+00041   // here Hamming distance 
+00042   eoHammingDistance<EOT> dist;
+00043 
+00044 // OPERATORS
+00045   // Build the variation operator (any seq/prop construct)
+00046   eoGenOp<EOT>& op = make_op(parser, state, init);
+00047 
+00048 // GENERAL
+00051 
+00052   // initialize the population - and evaluate
+00053   // yes, this is representation indepedent once you have an eoInit
+00054   eoPop<EOT>& pop   = make_pop(parser, state, init);
+00055 
+00056 // STOP
+00057   // stopping criteria
+00058   eoContinue<EOT> & term = make_continue(parser, state, eval);
+00059   // output
+00060   eoCheckPoint<EOT> & checkpoint = make_checkpoint(parser, state, eval, term);
+00061 // GENERATION
+00062   // algorithm (need the operator!)
+00063   eoAlgo<EOT>& ga = make_algo_scalar(parser, state, eval, checkpoint, op, &dist);
+00064 
+00067 // PARAMETRES
+00068   // to be called AFTER all parameters have been read!!!
+00069   make_help(parser);
+00070 
+00073 // EVAL
+00074   // evaluate intial population AFTER help and status in case it takes time
+00075   apply<EOT>(eval, pop);
+00076 // STOP
+00077   // print it out (sort witout modifying) 
+00078   cout << "Initial Population\n";
+00079   pop.sortedPrintOn(cout);
+00080   cout << endl;
+00081 
+00082 // GENERATION
+00083   run_ea(ga, pop); // run the ga
+00084 // STOP
+00085   // print it out (sort witout modifying) 
+00086   cout << "Final Population\n";
+00087   pop.sortedPrintOn(cout);
+00088   cout << endl;
+00089 // GENERAL
+00090   }
+00091   catch(exception& e)
+00092   {
+00093     cout << e.what() << endl;
+00094   }
+00095 }
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_bounds_check_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_bounds_check_8cpp-source.html new file mode 100644 index 000000000..43d76baf1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_bounds_check_8cpp-source.html @@ -0,0 +1,95 @@ + + +EO: BoundsCheck.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / eval
+

BoundsCheck.cpp

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #include <vector>
+00019 
+00020 #include "BoundsCheck.h"
+00021 #include <Sym.h>
+00022 #include <FunDef.h>
+00023 #include <sstream>
+00024 
+00025 using namespace std;
+00026 
+00027 class IntervalBoundsCheckImpl {
+00028     public :
+00029     vector<Interval> bounds;
+00030 };
+00031 
+00032 IntervalBoundsCheck::IntervalBoundsCheck(const vector<double>& mins, const vector<double>& maxes) {
+00033     pimpl = new IntervalBoundsCheckImpl;
+00034     vector<Interval>& b = pimpl->bounds;
+00035 
+00036     b.resize( mins.size());
+00037    
+00038     for (unsigned i = 0; i < b.size(); ++i) {
+00039         b[i] = Interval(mins[i], maxes[i]);
+00040     }
+00041     
+00042 }
+00043 
+00044 IntervalBoundsCheck::~IntervalBoundsCheck() { delete pimpl; }
+00045 IntervalBoundsCheck::IntervalBoundsCheck(const IntervalBoundsCheck& that) { pimpl = new IntervalBoundsCheckImpl(*that.pimpl); }
+00046 IntervalBoundsCheck& IntervalBoundsCheck::operator=(const IntervalBoundsCheck& that)   { *pimpl = *that.pimpl; return *this; }
+00047 
+00048 bool IntervalBoundsCheck::in_bounds(const Sym& sym) const {
+00049     Interval bounds; 
+00050     
+00051     try {
+00052         bounds = eval(sym, pimpl->bounds);
+00053         if (!valid(bounds)) return false;
+00054     } catch (interval_error) {
+00055         return false;
+00056     }
+00057     return true;
+00058 }
+00059 
+00060 std::string IntervalBoundsCheck::get_bounds(const Sym& sym) const {
+00061     
+00062     try {
+00063         Interval bounds = eval(sym, pimpl->bounds);
+00064         if (!valid(bounds)) return "err";
+00065         ostringstream os;
+00066         os << bounds;
+00067         return os.str();
+00068     } catch (interval_error) {
+00069         return "err";
+00070     }
+00071 }
+00072 
+00073 
+00074 std::pair<double, double> IntervalBoundsCheck::calc_bounds(const Sym& sym) const {
+00075 
+00076     Interval bounds = eval(sym, pimpl->bounds);
+00077     return make_pair(bounds.lower(), bounds.upper());
+00078 }
+00079         
+00080 
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_bounds_check_8h-source.html b/trunk/paradiseo-eo/doc/html/_bounds_check_8h-source.html new file mode 100644 index 000000000..ab0ecbee8 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_bounds_check_8h-source.html @@ -0,0 +1,73 @@ + + +EO: BoundsCheck.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / eval
+

BoundsCheck.h

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #ifndef BOUNDS_CHECK_H_
+00019 #define BOUNDS_CHECK_H_
+00020 
+00021 #include <string>
+00022 
+00023 class IntervalBoundsCheckImpl;
+00024 class Sym;
+00025 
+00026 class BoundsCheck {
+00027     public :
+00028         virtual ~BoundsCheck() {};
+00029         virtual bool in_bounds(const Sym&) const = 0;
+00030         virtual std::string get_bounds(const Sym&) const = 0;
+00031 };
+00032 
+00033 // checks if a formula keeps within bounds using interval arithmetic
+00034 class IntervalBoundsCheck : public BoundsCheck {
+00035 
+00036     IntervalBoundsCheckImpl* pimpl;
+00037     
+00038     public:
+00039 
+00040     IntervalBoundsCheck(const std::vector<double>& minima, const std::vector<double>& maxima);
+00041     ~IntervalBoundsCheck();
+00042     IntervalBoundsCheck(const IntervalBoundsCheck&);
+00043     IntervalBoundsCheck& operator=(const IntervalBoundsCheck&);
+00044     
+00045     bool in_bounds(const Sym&) const;
+00046     std::string get_bounds(const Sym&) const;
+00047     
+00048     std::pair<double, double> calc_bounds(const Sym&) const;
+00049 };
+00050 
+00051 class NoBoundsCheck : public BoundsCheck {
+00052     bool in_bounds(const Sym&) const { return false; }
+00053     std::string get_bounds(const Sym&) const { return ""; }
+00054 };
+00055 
+00056 #endif
+00057 
+00058 
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_c_m_a_params_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_c_m_a_params_8cpp-source.html new file mode 100644 index 000000000..da56abf93 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_c_m_a_params_8cpp-source.html @@ -0,0 +1,249 @@ + + +EO: CMAParams.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

CMAParams.cpp

00001 
+00002 /*
+00003  * C++ification of Nikolaus Hansen's original C-source code for the
+00004  * CMA-ES
+00005  *
+00006  * C++-ificiation performed by Maarten Keijzer (C) 2005. Licensed under
+00007  * the LGPL. Original copyright of Nikolaus Hansen can be found below
+00008  *
+00009  *
+00010  * 
+00011  */
+00012 
+00013 /* --------------------------------------------------------- */
+00014 /* --------------------------------------------------------- */
+00015 /* --- File: cmaes.c  -------- Author: Nikolaus Hansen   --- */
+00016 /* --------------------------------------------------------- */
+00017 /*
+00018  *      CMA-ES for non-linear function minimization.
+00019  *
+00020  *           Copyright (C) 1996, 2003  Nikolaus Hansen.
+00021  *           e-mail: hansen@bionik.tu-berlin.de
+00022  *
+00023  *           This library is free software; you can redistribute it and/or
+00024  *           modify it under the terms of the GNU Lesser General Public
+00025  *           License as published by the Free Software Foundation; either
+00026  *           version 2.1 of the License, or (at your option) any later
+00027  *           version (see http://www.gnu.org/copyleft/lesser.html).
+00028  *
+00029  *           This library is distributed in the hope that it will be useful,
+00030  *           but WITHOUT ANY WARRANTY; without even the implied warranty of
+00031  *           MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00032  *           Lesser General Public License for more details.
+00033  * 
+00034  *                                                             */
+00035 /* --- Changes : ---
+00036  *   03/03/21: argument const double *rgFunVal of
+00037  *   cmaes_ReestimateDistribution() was treated incorrectly.
+00038  *   03/03/29: restart via cmaes_resume_distribution() implemented.
+00039  *   03/03/30: Always max std dev / largest axis is printed first.
+00040  *   03/08/30: Damping is adjusted for large mueff.
+00041  *   03/10/30: Damping is adjusted for large mueff always.
+00042  *   04/04/22: Cumulation time and damping for step size adjusted.
+00043  *   No iniphase but conditional update of pc.
+00044  *   Version 2.23.
+00045  *                               */
+00046 
+00047 #include <es/CMAParams.h>
+00048 #include <utils/eoParser.h>
+00049 
+00050 #include <string>
+00051 
+00052 using namespace std;
+00053 
+00054 namespace eo {
+00055 
+00056 CMAParams::CMAParams(eoParser& parser, unsigned dimensionality) {
+00057     
+00058     string section = "CMA parameters";
+00059     
+00060     n = parser.createParam(dimensionality, "dimensionality", "Dimensionality (N) of the problem", 'N', section, dimensionality == 0).value();
+00061     
+00062     maxgen = parser.createParam(
+00063             1000,
+00064             "max-gen",
+00065             "Maximum number of generations that the system will run (needed for damping)",
+00066             'M',
+00067             section).value();
+00068     
+00069     
+00070     if (n == 0) {
+00071         return;
+00072     }
+00073     
+00074     defaults(n, maxgen);
+00075     
+00076     /* handle lambda */
+00077     lambda = parser.createParam(
+00078             lambda,
+00079             "lambda",
+00080             "Number of offspring",
+00081             'l',
+00082             section).value();
+00083 
+00084     if (lambda < 2) {
+00085         lambda = 4+(int)(3*log((double) n));
+00086         cerr << "Too small lambda specified, setting it to " << lambda << endl;
+00087     }
+00088     
+00089     /* handle mu */
+00090     mu = parser.createParam(
+00091             mu,
+00092             "mu",
+00093             "Population size",
+00094             'm',
+00095             section).value();
+00096 
+00097     if (mu >= lambda) {
+00098         mu = lambda/2;
+00099         cerr << "Mu set larger/equal to lambda, setting it to " << mu << endl;
+00100     }
+00101     
+00102     /* handle selection weights */
+00103     
+00104     int weight_type = parser.createParam(
+00105             0,
+00106             "weighting",
+00107             "Weighting scheme (for 'selection'): 0 = logarithmic, 1 = equal, 2 = linear",
+00108             'w',
+00109             section).value();
+00110 
+00111     switch (weight_type) {
+00112         case 1: 
+00113             {
+00114                 for (unsigned i = 0; i < weights.size(); ++i) {
+00115                     weights[i] = mu - i;
+00116                 }
+00117             }
+00118         case 2:
+00119             {
+00120                 weights = 1.;
+00121             }
+00122         default : 
+00123             {
+00124                 for (unsigned i = 0; i < weights.size(); ++i) {
+00125                     weights[i] = log(mu+1.)-log(i+1.);
+00126                 }
+00127             }
+00128         
+00129     }
+00130 
+00131     /* Normalize weights and set mu_eff */
+00132     double sumw = weights.sum();
+00133     mueff =  sumw * sumw / (weights * weights).sum();
+00134     weights /= sumw;
+00135     
+00136 
+00137     /* most of the rest depends on mu_eff, so needs to be set again */
+00138     
+00139     /* set the others using Nikolaus logic. If you want to tweak, you can parameterize over these defaults */
+00140     mucov = mueff;
+00141     ccumsig = (mueff + 2.) / (n + mueff + 3.);
+00142     ccumcov = 4. / (n + 4);
+00143     
+00144     double t1 = 2. / ((n+1.4142)*(n+1.4142));
+00145     double t2 = (2.*mucov-1.) / ((n+2.)*(n+2.)+mucov);
+00146     t2 = (t2 > 1) ? 1 : t2;
+00147     t2 = (1./mucov) * t1 + (1.-1./mucov) * t2;
+00148     
+00149     ccov = t2;
+00150 
+00151     damp = 1 + std::max(0.3,(1.-(double)n/(double)maxgen))
+00152               * (1+2*std::max(0.,sqrt((mueff-1.)/(n+1.))-1)) /* limit sigma increase */
+00153                     / ccumsig;
+00154   
+00155     vector<double> mins(1,0.0);
+00156     mins = parser.createParam(
+00157             mins,
+00158             "min-stdev",
+00159             "Array of minimum stdevs, last one will apply for all remaining axes",
+00160             0,
+00161             section).value();
+00162     
+00163     if (mins.size() > n) mins.resize(n);
+00164 
+00165     if (mins.size()) {
+00166         minStdevs = mins.back();
+00167         for (unsigned i = 0; i < mins.size(); ++i) {
+00168             minStdevs[i] = mins[i];
+00169         }
+00170     }
+00171     
+00172     vector<double> inits(1,0.3);
+00173     inits = parser.createParam(
+00174             inits,
+00175             "init-stdev",
+00176             "Array of initial stdevs, last one will apply for all remaining axes",
+00177             0,
+00178             section).value();
+00179     
+00180     if (inits.size() > n) inits.resize(n);
+00181 
+00182     if (inits.size()) {
+00183         initialStdevs = inits.back();
+00184         for (unsigned i = 0; i < inits.size(); ++i) {
+00185             initialStdevs[i] = inits[i];
+00186         }
+00187     }
+00188     
+00189 }
+00190 
+00191 void CMAParams::defaults(unsigned n_, unsigned maxgen_) {
+00192     n = n_;
+00193     maxgen = maxgen_;
+00194 
+00195     lambda = 4+(int)(3*log((double) n));
+00196     mu = lambda / 2;
+00197     
+00198     weights.resize(mu);
+00199     
+00200     for (unsigned i = 0; i < weights.size(); ++i) {
+00201         weights[i] = log(mu+1.)-log(i+1.);
+00202     }
+00203     
+00204     /* Normalize weights and set mu_eff */
+00205     double sumw = weights.sum();
+00206     mueff =  sumw * sumw / (weights * weights).sum();
+00207     weights /= sumw;
+00208     
+00209     mucov = mueff;
+00210     ccumsig *= (mueff + 2.) / (n + mueff + 3.);
+00211     ccumcov = 4. / (n + 4);
+00212     
+00213     double t1 = 2. / ((n+1.4142)*(n+1.4142));
+00214     double t2 = (2.*mucov-1.) / ((n+2.)*(n+2.)+mucov);
+00215     t2 = (t2 > 1) ? 1 : t2;
+00216     t2 = (1./mucov) * t1 + (1.-1./mucov) * t2;
+00217     
+00218     ccov = t2;
+00219 
+00220     damp = 1 + std::max(0.3,(1.-(double)n/maxgen))
+00221               * (1+2*std::max(0.,sqrt((mueff-1.)/(n+1.))-1)) /* limit sigma increase */
+00222                     / ccumsig;
+00223 
+00224     minStdevs.resize(n);
+00225     minStdevs = 0.0;
+00226     
+00227     initialStdevs.resize(n);
+00228     initialStdevs = 0.3;
+00229     
+00230 
+00231 }
+00232 
+00233 
+00234 }// namespace eo
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_c_m_a_params_8h-source.html b/trunk/paradiseo-eo/doc/html/_c_m_a_params_8h-source.html new file mode 100644 index 000000000..dbaf06f10 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_c_m_a_params_8h-source.html @@ -0,0 +1,67 @@ + + +EO: CMAParams.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

CMAParams.h

00001 /*
+00002  * C++ification of Nikolaus Hansen's original C-source code for the
+00003  * CMA-ES. 
+00004  *
+00005  * Copyright (C) 1996, 2003, Nikolaus Hansen
+00006  *           (C) 2005, Maarten Keijzer
+00007  *
+00008  * License: LGPL 
+00009  * 
+00010  */
+00011 
+00012 #ifndef CMAPARAMS_H__
+00013 #define CMAPARAMS_H__
+00014 
+00015 #include <valarray>
+00016 
+00017 class eoParser;
+00018 namespace eo {
+00019 
+00020 class CMAParams {
+00021    
+00022     public:
+00023     
+00024     CMAParams() { /* Call this and all values need to be set by hand */ }
+00025     CMAParams(eoParser& parser, unsigned dimensionality = 0); // 0 dimensionality -> user needs to set it
+00026  
+00027     void defaults(unsigned n_, unsigned maxgen_); /* apply all defaults using n and maxgen */
+00028     
+00029     unsigned n;
+00030     unsigned maxgen;
+00031    
+00032     unsigned lambda;          /* -> mu */
+00033     unsigned mu;              /* -> weights, lambda */
+00034     
+00035     std::valarray<double> weights;     /* <- mu, -> mueff -> mucov -> ccov */
+00036     double mueff;       /* <- weights */
+00037     
+00038     double mucov;
+00039     
+00040     double damp;         /* <- ccumsig, maxeval, lambda */
+00041     double ccumsig;      /* -> damp, <- N */
+00042     double ccumcov;
+00043     double ccov;         /* <- mucov, N */
+00044 
+00045     std::valarray<double> minStdevs;     /* Minimum standard deviations per coordinate (default = 0.0) */
+00046     std::valarray<double> initialStdevs; /* Initial standard deviations per coordinate (default = 0.3) */
+00047 };
+00048 
+00049 } // namespace eo
+00050 
+00051 #endif
+00052 
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_c_m_a_state_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_c_m_a_state_8cpp-source.html new file mode 100644 index 000000000..db6958867 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_c_m_a_state_8cpp-source.html @@ -0,0 +1,380 @@ + + +EO: CMAState.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

CMAState.cpp

00001 /*
+00002  * C++ification of Nikolaus Hansen's original C-source code for the
+00003  * CMA-ES
+00004  *
+00005  * C++-ificiation performed by Maarten Keijzer (C) 2005. Licensed under
+00006  * the LGPL. Original copyright of Nikolaus Hansen can be found below
+00007  *
+00008  *
+00009  * Some changes have been made to the original flow and logic of the
+00010  * algorithm:
+00011  *
+00012  *      - Numerical issues are now treated 'before' going into the eigenvector decomposition
+00013  *          (this was done out of convenience)
+00014  *      - dMaxSignifiKond (smallest x such that x == x + 1.0) replaced by
+00015  *        numeric_limits<double>::epsilon() (smallest x such that 1.0 != 1.0 + x)
+00016  *        
+00017  * 
+00018  */
+00019 
+00020 /* --------------------------------------------------------- */
+00021 /* --------------------------------------------------------- */
+00022 /* --- File: cmaes.c  -------- Author: Nikolaus Hansen   --- */
+00023 /* --------------------------------------------------------- */
+00024 /*
+00025  *      CMA-ES for non-linear function minimization.
+00026  *
+00027  *           Copyright (C) 1996, 2003  Nikolaus Hansen.
+00028  *           e-mail: hansen@bionik.tu-berlin.de
+00029  *
+00030  *           This library is free software; you can redistribute it and/or
+00031  *           modify it under the terms of the GNU Lesser General Public
+00032  *           License as published by the Free Software Foundation; either
+00033  *           version 2.1 of the License, or (at your option) any later
+00034  *           version (see http://www.gnu.org/copyleft/lesser.html).
+00035  *
+00036  *           This library is distributed in the hope that it will be useful,
+00037  *           but WITHOUT ANY WARRANTY; without even the implied warranty of
+00038  *           MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00039  *           Lesser General Public License for more details.
+00040  * 
+00041  *                                                             */
+00042 /* --- Changes : ---
+00043  *   03/03/21: argument const double *rgFunVal of
+00044  *   cmaes_ReestimateDistribution() was treated incorrectly.
+00045  *   03/03/29: restart via cmaes_resume_distribution() implemented.
+00046  *   03/03/30: Always max std dev / largest axis is printed first.
+00047  *   03/08/30: Damping is adjusted for large mueff.
+00048  *   03/10/30: Damping is adjusted for large mueff always.
+00049  *   04/04/22: Cumulation time and damping for step size adjusted.
+00050  *   No iniphase but conditional update of pc.
+00051  *   Version 2.23.
+00052  *                               */
+00053 
+00054 #include <valarray>
+00055 #include <limits>
+00056 #include <iostream>
+00057 #include <cassert>
+00058 
+00059 #include <utils/eoRNG.h>
+00060 
+00061 #include <es/CMAState.h>
+00062 #include <es/CMAParams.h>
+00063 #include <es/matrices.h>
+00064 #include <es/eig.h>
+00065 
+00066 using namespace std;
+00067 
+00068 namespace eo {
+00069     
+00070 struct CMAStateImpl {
+00071     
+00072     CMAParams p;
+00073     
+00074     lower_triangular_matrix     C; // Covariance matrix
+00075     square_matrix               B; // Eigen vectors (in columns)
+00076     valarray<double>            d; // eigen values (diagonal matrix)
+00077     valarray<double>            pc; // Evolution path
+00078     valarray<double>            ps; // Evolution path for stepsize;
+00079     
+00080     vector<double>              mean; // current mean to sample around
+00081     double                      sigma; // global step size
+00082    
+00083     unsigned                    gen;
+00084     vector<double>              fitnessHistory;
+00085     
+00086     
+00087     CMAStateImpl(const CMAParams& params_, const vector<double>& m, double sigma_) :
+00088         p(params_),
+00089         C(p.n), B(p.n), d(p.n), pc(p.n), ps(p.n), mean(m), sigma(sigma_),
+00090         gen(0), fitnessHistory(3)
+00091     {
+00092         double trace = (p.initialStdevs * p.initialStdevs).sum();
+00093         /* Initialize covariance structure */
+00094         for (unsigned i = 0; i < p.n; ++i)
+00095         {
+00096             B[i][i] = 1.;
+00097             d[i] = p.initialStdevs[i] * sqrt(p.n / trace);
+00098             C[i][i] = d[i] * d[i];
+00099             pc[i] = 0.;
+00100             ps[i] = 0.;
+00101         }
+00102          
+00103     }
+00104 
+00105     void sample(vector<double>& v) {
+00106         unsigned n = p.n;
+00107         v.resize(n);
+00108         
+00109         vector<double> tmp(n);
+00110         for (unsigned i = 0; i < n; ++i)
+00111             tmp[i] = d[i] * rng.normal();
+00112         
+00113         /* add mutation (sigma * B * (D*z)) */
+00114         for (unsigned i = 0; i < n; ++i) {
+00115             double sum = 0;
+00116             for (unsigned j = 0; j < n; ++j) {
+00117                 sum += B[i][j] * tmp[j];
+00118             }
+00119             v[i] = mean[i] + sigma * sum;
+00120         }
+00121     }
+00122     
+00123     void reestimate(const vector<const vector<double>* >& pop, double muBest, double muWorst) {
+00124         
+00125         assert(pop.size() == p.mu);
+00126         
+00127         unsigned n = p.n;
+00128 
+00129         fitnessHistory[gen % fitnessHistory.size()] = muBest; // needed for divergence check
+00130         
+00131         vector<double> oldmean = mean;
+00132         valarray<double> BDz(n);
+00133         
+00134         /* calculate xmean and rgBDz~N(0,C) */
+00135         for (unsigned i = 0; i < n; ++i) {
+00136             mean[i] = 0.;
+00137             for (unsigned j = 0; j < pop.size(); ++j) {
+00138                 mean[i] += p.weights[j] * (*pop[j])[i]; 
+00139             }
+00140             BDz[i] = sqrt(p.mueff)*(mean[i] - oldmean[i])/sigma; 
+00141         }
+00142 
+00143         vector<double> tmp(n);
+00144         /* calculate z := D^(-1) * B^(-1) * rgBDz into rgdTmp */
+00145         for (unsigned i = 0; i < n; ++i) {
+00146             double sum = 0.0;
+00147             for (unsigned j = 0; j < n; ++j) {
+00148                 sum += B[j][i] * BDz[j];
+00149             }
+00150             tmp[i] = sum / d[i];
+00151         }
+00152 
+00153         /* cumulation for sigma (ps) using B*z */
+00154         for (unsigned i = 0; i < n; ++i) {
+00155             double sum = 0.0;
+00156             for (unsigned j = 0; j < n; ++j)
+00157                 sum += B[i][j] * tmp[j];
+00158             
+00159             ps[i] = (1. - p.ccumsig) * ps[i] + sqrt(p.ccumsig * (2. - p.ccumsig)) * sum;
+00160         }
+00161 
+00162         /* calculate norm(ps)^2 */
+00163         double psxps = (ps * ps).sum();
+00164 
+00165         
+00166         double chiN =  sqrt((double) p.n) * (1. - 1./(4.*p.n) + 1./(21.*p.n*p.n));
+00167         /* cumulation for covariance matrix (pc) using B*D*z~N(0,C) */
+00168         double hsig = sqrt(psxps) / sqrt(1. - pow(1.-p.ccumsig, 2.*gen)) / chiN < 1.5 + 1./(p.n-0.5);
+00169         
+00170         pc = (1. - p.ccumcov) * pc + hsig * sqrt(p.ccumcov * (2. - p.ccumcov)) * BDz;
+00171         
+00172         /* stop initial phase (MK, this was not reachable in the org code, deleted) */
+00173 
+00174         /* remove momentum in ps, if ps is large and fitness is getting worse */
+00175 
+00176         if (gen >= fitnessHistory.size()) {
+00177 
+00178             // find direction from muBest and muWorst (muBest == muWorst handled seperately
+00179             double direction = muBest < muWorst? -1.0 : 1.0;
+00180             
+00181             unsigned now = gen % fitnessHistory.size();
+00182             unsigned prev = (gen-1) % fitnessHistory.size();
+00183             unsigned prevprev = (gen-2) % fitnessHistory.size();
+00184 
+00185             bool fitnessWorsens = (muBest == muWorst) || // <- increase norm also when population has converged (this deviates from Hansen's scheme)
+00186                             ( (direction * fitnessHistory[now] < direction * fitnessHistory[prev])
+00187                                             &&
+00188                               (direction * fitnessHistory[now] < direction * fitnessHistory[prevprev]));
+00189         
+00190             if(psxps/p.n > 1.5 + 10.*sqrt(2./p.n) && fitnessWorsens) {
+00191                 double tfac = sqrt((1 + std::max(0., log(psxps/p.n))) * p.n / psxps);
+00192                 ps          *= tfac;
+00193                 psxps   *= tfac*tfac; 
+00194             }
+00195         }
+00196 
+00197         /* update of C  */
+00198         /* Adapt_C(t); not used anymore */
+00199         if (p.ccov != 0.) {
+00200             //flgEigensysIsUptodate = 0;
+00201 
+00202             /* update covariance matrix */
+00203             for (unsigned i = 0; i < n; ++i) {
+00204                 vector<double>::iterator c_row = C[i];
+00205                 for (unsigned j = 0; j <= i; ++j) {
+00206                     c_row[j] = 
+00207                                 (1 - p.ccov) * c_row[j]
+00208                                         +
+00209                                 p.ccov * (1./p.mucov) * pc[i] * pc[j]
+00210                                         +
+00211                                 (1-hsig) * p.ccumcov * (2. - p.ccumcov) * c_row[j];
+00212                     
+00213                     /*C[i][j] = (1 - p.ccov) * C[i][j] 
+00214                         + sp.ccov * (1./sp.mucov) 
+00215                         * (rgpc[i] * rgpc[j] 
+00216                                 + (1-hsig)*sp.ccumcov*(2.-sp.ccumcov) * C[i][j]); */
+00217                     for (unsigned k = 0; k < p.mu; ++k) { /* additional rank mu update */
+00218                         c_row[j] += p.ccov * (1-1./p.mucov) * p.weights[k]  
+00219                             * ( (*pop[k])[i] - oldmean[i])
+00220                             * ( (*pop[k])[j] - oldmean[j])
+00221                             / sigma / sigma;
+00222                     
+00223                            // * (rgrgx[index[k]][i] - rgxold[i]) 
+00224                            // * (rgrgx[index[k]][j] - rgxold[j])
+00225                            // / sigma / sigma; 
+00226                     }
+00227                 }
+00228             }
+00229         }
+00230 
+00231         /* update of sigma */
+00232         sigma *= exp(((sqrt(psxps)/chiN)-1.)/p.damp);
+00233         /* calculate eigensystem, must be done by caller  */
+00234         //cmaes_UpdateEigensystem(0);
+00235 
+00236         
+00237         /* treat minimal standard deviations and numeric problems 
+00238          * Note that in contrast with the original code, some numerical issues are treated *before* we 
+00239          * go into the eigenvalue calculation */
+00240         
+00241         treatNumericalIssues(muBest, muWorst);
+00242 
+00243         gen++; // increase generation
+00244     }
+00245 
+00246     void treatNumericalIssues(double best, double worst) {
+00247         
+00248         /* treat stdevs */
+00249         for (unsigned i = 0; i < p.n; ++i) {
+00250             if (sigma * sqrt(C[i][i]) < p.minStdevs[i]) {
+00251                 // increase stdev
+00252                 sigma *= exp(0.05+1./p.damp);
+00253                 break;
+00254             }
+00255         }
+00256         
+00257         /* treat convergence */
+00258         if (best == worst) {
+00259             sigma *= exp(0.2 + 1./p.damp);
+00260         }
+00261         
+00262         /* Jede Hauptachse i testen, ob x == x + 0.1 * sigma * rgD[i] * B[i] */
+00263         /* Test if all the means are not numerically out of whack with our coordinate system*/
+00264         for (unsigned axis = 0; axis < p.n; ++axis) {
+00265             double fac = 0.1 * sigma * d[axis];
+00266             unsigned coord;
+00267             for (coord = 0; coord < p.n; ++coord) {
+00268                 if (mean[coord] != mean[coord] + fac * B[coord][axis]) {
+00269                     break;
+00270                 }
+00271             }
+00272 
+00273             if (coord == p.n) { // means are way too big (little) for numerical accuraccy. Start rocking the craddle a bit more
+00274                 sigma *= exp(0.2+1./p.damp);
+00275             }
+00276             
+00277         }
+00278             
+00279         /* Testen ob eine Komponente des Objektparameters festhaengt */
+00280         /* Correct issues with scale between objective values and covariances */
+00281         bool theresAnIssue = false;
+00282 
+00283         for (unsigned i = 0; i < p.n; ++i) {
+00284             if (mean[i] == mean[i] + 0.2 * sigma * sqrt(C[i][i])) {
+00285                 C[i][i] *= (1. + p.ccov);
+00286                 theresAnIssue = true;
+00287             }
+00288         }
+00289 
+00290         if (theresAnIssue) {
+00291             sigma *= exp(0.05 + 1./p.damp);
+00292         }
+00293     }
+00294 
+00295     
+00296     bool updateEigenSystem(unsigned max_tries, unsigned max_iters) {
+00297 
+00298         if (max_iters==0) max_iters = 30 * p.n;
+00299         
+00300         static double lastGoodMinimumEigenValue = 1.0;
+00301         
+00302         /* Try to get a valid calculation */
+00303         for (unsigned tries = 0; tries < max_tries; ++tries) {
+00304              
+00305             unsigned iters = eig( p.n, C, d, B, max_iters); 
+00306             if (iters < max_iters) 
+00307             { // all is well
+00308                 
+00309                 /* find largest/smallest eigenvalues */
+00310                 double minEV = d.min(); 
+00311                 double maxEV = d.max(); 
+00312 
+00313                 /* (MK Original comment was) :Limit Condition of C to dMaxSignifKond+1 
+00314                  * replaced dMaxSignifKond with 1./numeric_limits<double>::epsilon()
+00315                  * */
+00316                 if (maxEV * numeric_limits<double>::epsilon() > minEV) {
+00317                     double tmp = maxEV * numeric_limits<double>::epsilon() - minEV;
+00318                     minEV += tmp;
+00319                     for (unsigned i=0;i<p.n;++i) {
+00320                         C[i][i] += tmp;
+00321                         d[i] += tmp;
+00322                     }
+00323                 } /* if */
+00324                 lastGoodMinimumEigenValue = minEV;
+00325 
+00326                 d = sqrt(d);
+00327 
+00328                 //flgEigensysIsUptodate = 1;
+00329                 //genOfEigensysUpdate = gen; 
+00330                 //clockeigensum += clock() - clockeigenbegin;
+00331                 return true;
+00332             } /* if cIterEig < ... */
+00333 
+00334             // numerical problems, ignore them and try again
+00335             
+00336             /* Addition des letzten minEW auf die Diagonale von C */
+00337             /* Add the last known good eigen value to the diagonal of C */
+00338             double summand = lastGoodMinimumEigenValue * exp((double) tries);
+00339             for (unsigned i = 0; i < p.n; ++i)
+00340                 C[i][i] += summand;
+00341 
+00342         } /* for iEigenCalcVers */
+00343         
+00344         return false;
+00345         
+00346     }
+00347     
+00348         
+00349 };
+00350 
+00351 CMAState::CMAState(const CMAParams& params, const std::vector<double>& initial_point, const double initial_sigma) 
+00352     : pimpl(new CMAStateImpl(params, initial_point, initial_sigma)) {}
+00353 
+00354 CMAState::~CMAState() { delete pimpl; }
+00355 CMAState::CMAState(const CMAState& that) : pimpl(new CMAStateImpl(*that.pimpl )) {}
+00356 CMAState& CMAState::operator=(const CMAState& that) { *pimpl = *that.pimpl; return *this; }
+00357 
+00358 void CMAState::sample(vector<double>& v) const {  pimpl->sample(v); }
+00359 
+00360 void CMAState::reestimate(const vector<const vector<double>* >& population, double muBest, double muWorst) { pimpl->reestimate(population, muBest, muWorst); }
+00361 bool CMAState::updateEigenSystem(unsigned max_tries, unsigned max_iters) { return pimpl->updateEigenSystem(max_tries, max_iters); }
+00362 
+00363 
+00364 } // namespace eo
+00365 
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_c_m_a_state_8h-source.html b/trunk/paradiseo-eo/doc/html/_c_m_a_state_8h-source.html new file mode 100644 index 000000000..025a5838d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_c_m_a_state_8h-source.html @@ -0,0 +1,59 @@ + + +EO: CMAState.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

CMAState.h

00001 
+00002 /*
+00003  * C++ification of Nikolaus Hansen's original C-source code for the
+00004  * CMA-ES. 
+00005  *
+00006  * Copyright (C) 1996, 2003, Nikolaus Hansen
+00007  *           (C) 2005, Maarten Keijzer
+00008  *
+00009  * License: LGPL (see source file)
+00010  * 
+00011  */
+00012 
+00013 #ifndef CMASTATE_H_
+00014 #define CMASTATE_H_
+00015 
+00016 #include <vector>
+00017 #include <valarray>
+00018 
+00019 namespace eo {
+00020     
+00021 
+00022 class CMAStateImpl;
+00023 class CMAParams;
+00024 class CMAState {
+00025     
+00026     CMAStateImpl* pimpl; /* pointer to implementation, hidden in source file */
+00027     
+00028     public:
+00029 
+00030     CMAState(const CMAParams&, const std::vector<double>& initial_point, const double initial_sigma = 1.0);
+00031     ~CMAState();
+00032     CMAState(const CMAState&);
+00033     CMAState& operator=(const CMAState&);
+00034 
+00051     void sample(std::vector<double>& v) const;
+00052     
+00063     void reestimate(const std::vector<const std::vector<double>* >& sorted_population, double muBest, double muWorst);
+00064     
+00074     bool updateEigenSystem(unsigned max_tries = 1, unsigned max_iters = 0);  
+00075 };
+00076 
+00077 } // namespace eo
+00078 
+00079 #endif
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_dataset_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_dataset_8cpp-source.html new file mode 100644 index 000000000..a485ab44c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_dataset_8cpp-source.html @@ -0,0 +1,148 @@ + + +EO: Dataset.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / regression
+

Dataset.cpp

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #include "Dataset.h"
+00019 #include <fstream>
+00020 #include <sstream>
+00021 
+00022 #include <iostream>
+00023 
+00024 using namespace std;
+00025 
+00026 class DataSetImpl {
+00027     public: 
+00028     vector< vector<double> > inputs;
+00029     vector<double> targets;
+00030 
+00031     void read_data(vector<string> strings) {
+00032         // find the number of inputs
+00033         
+00034         istringstream cnt(strings[0]);
+00035         unsigned n = 0;
+00036         for (;;) {
+00037             string s;
+00038             cnt >> s;
+00039             if (!cnt) break;
+00040             ++n;
+00041         }
+00042 
+00043         inputs.resize(strings.size(), vector<double>(n-1));
+00044         targets.resize(strings.size());
+00045 
+00046         for (unsigned i = 0; i < strings.size(); ++i) {
+00047             istringstream is(strings[i]);
+00048             for (unsigned j = 0; j < n; ++j) {
+00049                 
+00050                 if (!is) {
+00051                     cerr << "Too few targets in record " << i << endl;
+00052                     exit(1);
+00053                 }
+00054                 
+00055                 if (j < n-1) {
+00056                     is >> inputs[i][j];
+00057                 } else {
+00058                     is >> targets[i];
+00059                 }
+00060                 
+00061             }
+00062         }
+00063         
+00064     }
+00065     
+00066 };
+00067 
+00068 Dataset::Dataset() { pimpl = new DataSetImpl; }
+00069 Dataset::~Dataset() { delete pimpl; }
+00070 Dataset::Dataset(const Dataset& that) { pimpl = new DataSetImpl(*that.pimpl); }
+00071 Dataset& Dataset::operator=(const Dataset& that) { *pimpl = *that.pimpl; return *this; }
+00072 
+00073 unsigned Dataset::n_records() const { return pimpl->targets.size(); }
+00074 unsigned Dataset::n_fields()  const { return pimpl->inputs[0].size(); }
+00075 const std::vector<double>& Dataset::get_inputs(unsigned record) const { return pimpl->inputs[record]; }
+00076 double Dataset::get_target(unsigned record) const { return pimpl->targets[record]; }
+00077 
+00078 double error(string errstr);
+00079 
+00080 void Dataset::load_data(std::string filename) {
+00081     vector<string> strings; // first load it in strings
+00082 
+00083     ifstream is(filename.c_str());
+00084 
+00085     for(;;) {
+00086         string s;
+00087         getline(is, s);
+00088         if (!is) break;
+00089 
+00090         if (s[0] == '#') continue; // comment, skip
+00091 
+00092         strings.push_back(s);
+00093     }
+00094    
+00095     is.close();
+00096 
+00097     if (strings.size() == 0) {
+00098         error("No data could be loaded");
+00099     }
+00100     
+00101     pimpl->read_data(strings);
+00102     
+00103 }
+00104 
+00105 std::vector<double> Dataset::input_minima() const {
+00106     vector<vector<double> >& in = pimpl->inputs;
+00107     
+00108     vector<double> mn(in[0].size(), 1e+50);
+00109     for (unsigned i = 0; i < in.size(); ++i) {
+00110         for (unsigned j = 0; j < in[i].size(); ++j) {
+00111             mn[j] = std::min(mn[j], in[i][j]);
+00112         }
+00113     }
+00114     
+00115     return mn;
+00116 }
+00117 
+00118 vector<double> Dataset::input_maxima() const {
+00119     vector<vector<double> >& in = pimpl->inputs;
+00120     
+00121     vector<double> mx(in[0].size(), -1e+50);
+00122     for (unsigned i = 0; i < in.size(); ++i) {
+00123         for (unsigned j = 0; j < in[i].size(); ++j) {
+00124             mx[j] = std::max(mx[j], in[i][j]);
+00125         }
+00126     }
+00127     
+00128     return mx;
+00129 }
+00130 
+00131 
+00132 
+00133 
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_dataset_8h-source.html b/trunk/paradiseo-eo/doc/html/_dataset_8h-source.html new file mode 100644 index 000000000..57418e1a3 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_dataset_8h-source.html @@ -0,0 +1,66 @@ + + +EO: Dataset.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / regression
+

Dataset.h

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #ifndef DATASET_H_
+00019 #define DATASET_H_
+00020 
+00021 #include <string>
+00022 #include <vector>
+00023 
+00024 class DataSetImpl;
+00025 
+00026 class Dataset {
+00027     
+00028     DataSetImpl* pimpl;
+00029     
+00030     Dataset& operator=(const Dataset&); // cannot assign
+00031     public:
+00032 
+00033     Dataset();
+00034     ~Dataset();
+00035     Dataset(const Dataset&);
+00036 
+00037     void load_data(std::string filename);
+00038     
+00039     unsigned n_records() const;
+00040     unsigned n_fields() const;
+00041 
+00042     const std::vector<double>& get_inputs(unsigned record) const;
+00043     double get_target(unsigned record) const;
+00044 
+00045     std::vector<double> input_minima() const;
+00046     std::vector<double> input_maxima() const;
+00047     
+00048 };
+00049 
+00050 #endif
+00051 
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_e_o_8h-source.html b/trunk/paradiseo-eo/doc/html/_e_o_8h-source.html new file mode 100644 index 000000000..eac179d2f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_e_o_8h-source.html @@ -0,0 +1,125 @@ + + +EO: EO.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

EO.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // EO.h
+00005 // (c) GeNeura Team 1998
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022  */
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef EO_H
+00026 #define EO_H
+00027 
+00028 //-----------------------------------------------------------------------------
+00029 
+00030 #include <stdexcept>       // std::runtime_error
+00031 #include <eoObject.h>      // eoObject
+00032 #include <eoPersistent.h>  // eoPersistent
+00033 
+00034 //-----------------------------------------------------------------------------
+00044 template<class F> class EO: public eoObject, public eoPersistent
+00045 {
+00046 public:
+00047   typedef F Fitness;
+00048 
+00054   EO(): repFitness(Fitness()), invalidFitness(true) {}
+00055 
+00057   virtual ~EO() {};
+00058 
+00060   Fitness fitness() const {
+00061     if (invalid())
+00062       throw std::runtime_error("invalid fitness");
+00063     return repFitness;
+00064   }
+00065 
+00066   // Set fitness as invalid.
+00067   void invalidate() { invalidFitness = true; }
+00068 
+00072   void fitness(const Fitness& _fitness)
+00073   {
+00074     repFitness = _fitness;
+00075     invalidFitness = false;
+00076   }
+00077 
+00081   bool invalid() const { return invalidFitness; }
+00082 
+00086   bool operator<(const EO& _eo2) const { return fitness() < _eo2.fitness(); }
+00087   bool operator>(const EO& _eo2) const { return !(fitness() <= _eo2.fitness()); }
+00088 
+00090 
+00091 
+00095   virtual std::string className() const { return "EO"; }
+00096 
+00105   virtual void readFrom(std::istream& _is) {
+00106      
+00107         // the new version of the reafFrom function.
+00108         // It can distinguish between valid and invalid fitness values. 
+00109         std::string fitness_str;
+00110         int pos = _is.tellg();
+00111         _is >> fitness_str;
+00112 
+00113         if (fitness_str == "INVALID")
+00114         {
+00115                 invalidFitness = true;
+00116         }
+00117         else
+00118         {
+00119                 invalidFitness = false;
+00120                 _is.seekg(pos); // rewind
+00121                 _is >> repFitness;
+00122         }
+00123   }
+00124 
+00129   virtual void printOn(std::ostream& _os) const {
+00130 
+00131 
+00132     // the latest version of the code. Very similar to the old code
+00133     if (invalid()) {
+00134         _os << "INVALID ";
+00135     }
+00136     else
+00137     {
+00138         _os << repFitness << ' ';
+00139     }
+00140               
+00141   }
+00142 
+00144 
+00145 private:
+00146   Fitness repFitness;   // value of fitness for this chromosome
+00147   bool invalidFitness;  // true if the value of fitness is invalid
+00148 };
+00149 
+00150 //-----------------------------------------------------------------------------
+00151 
+00152 #endif
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_e_s_e_a_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_e_s_e_a_8cpp-source.html new file mode 100644 index 000000000..73e7c70da --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_e_s_e_a_8cpp-source.html @@ -0,0 +1,139 @@ + + +EO: ESEA.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Lesson4
+

ESEA.cpp

00001 // Program to test several EO-ES features
+00002 
+00003 #ifdef _MSC_VER
+00004 #pragma warning(disable:4786)
+00005 #endif
+00006 
+00007 #include <algorithm>
+00008 #include <string>
+00009 #include <iostream>
+00010 #include <iterator>
+00011 #include <stdexcept>
+00012 #include <time.h>
+00013 
+00014 using namespace std;
+00015 
+00016 #include <eo>
+00017 
+00018 // representation specific
+00019 #include <es/make_es.h>
+00020 
+00021 #include "real_value.h"         // the sphere fitness
+00022 
+00023 // Now the main 
+00025 typedef eoMinimizingFitness  FitT;
+00026 
+00027 template <class EOT>
+00028 void runAlgorithm(EOT, eoParser& _parser, eoState& _state);
+00029   
+00030 int main_function(int argc, char *argv[]) 
+00031 {
+00032   // Create the command-line parser
+00033   eoParser parser(argc, argv);  // for user-parameter reading
+00034 
+00035   eoState state;    // keeps all things allocated
+00036 
+00037 
+00038   eoValueParam<bool>& simpleParam = parser.createParam(true, "Isotropic", "Isotropic self-adaptive mutation", 'i', "ES mutation");
+00039   eoValueParam<bool>& stdevsParam = parser.createParam(false, "Stdev", "One self-adaptive stDev per variable", 's', "ES mutation");
+00040   eoValueParam<bool>& corrParam = parser.createParam(false, "Correl", "Use correlated mutations", 'c', "ES mutation");
+00041 
+00042     // Run the appropriate algorithm
+00043     if (simpleParam.value() == false)
+00044     {
+00045       cout << "Using eoReal" << endl;
+00046       runAlgorithm(eoReal<FitT>(), parser, state);
+00047     }
+00048     else if (stdevsParam.value() == false)
+00049     {
+00050       cout << "Using eoEsSimple" << endl;
+00051       runAlgorithm(eoEsSimple<FitT>(), parser, state);
+00052     }
+00053     else if (corrParam.value() == false)
+00054     {
+00055       cout << "Using eoEsStdev" << endl;
+00056       runAlgorithm(eoEsStdev<FitT>(), parser, state);
+00057     }
+00058     else 
+00059     {
+00060       cout << "Using eoEsFull" << endl;
+00061       runAlgorithm(eoEsFull<FitT>(), parser, state);
+00062     }
+00063 
+00064         return 0;  
+00065 }
+00066 
+00067 // A main that catches the exceptions
+00068  
+00069 int main(int argc, char **argv)
+00070 {
+00071     try
+00072     {
+00073         main_function(argc, argv);
+00074     }
+00075     catch(exception& e)
+00076     {
+00077         cout << "Exception: " << e.what() << '\n';
+00078     }
+00079  
+00080     return 1;
+00081 }
+00082 
+00087 template <class EOT>
+00088 void runAlgorithm(EOT, eoParser& _parser, eoState& _state)
+00089 {
+00090   typedef typename EOT::Fitness FitT;
+00091 
+00094 
+00095   // The evaluation fn - encapsulated into an eval counter for output 
+00096   eoEvalFuncPtr<EOT, double, const std::vector<double>&> 
+00097                mainEval( real_value );
+00098   eoEvalFuncCounter<EOT> eval(mainEval);
+00099 
+00100   // the genotype - through a genotype initializer
+00101   eoRealInitBounded<EOT>& init = make_genotype(_parser, _state, EOT());
+00102 
+00103   // Build the variation operator (any seq/prop construct)
+00104   eoGenOp<EOT>& op = make_op(_parser, _state, init);
+00105 
+00108 
+00109   // initialize the population - and evaluate
+00110   // yes, this is representation indepedent once you have an eoInit
+00111   eoPop<EOT>& pop   = make_pop(_parser, _state, init);
+00112   apply<EOT>(eval, pop);
+00113 
+00114   // stopping criteria
+00115   eoContinue<EOT> & term = make_continue(_parser, _state, eval);
+00116   // output
+00117   eoCheckPoint<EOT> & checkpoint = make_checkpoint(_parser, _state, eval, term);
+00118   // algorithm (need the operator!)
+00119   eoAlgo<EOT>& ga = make_algo_scalar(_parser, _state, eval, checkpoint, op);
+00120 
+00123   // to be called AFTER all parameters have been read!!!
+00124   make_help(_parser);
+00125 
+00128   cout << "Initial Population\n";
+00129   pop.sortedPrintOn(cout);
+00130   cout << endl;
+00131 
+00132   run_ea(ga, pop); // run the ga
+00133 
+00134   cout << "Final Population\n";
+00135   pop.sortedPrintOn(cout);
+00136   cout << endl;
+00137 }
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_error_measure_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_error_measure_8cpp-source.html new file mode 100644 index 000000000..a964b455a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_error_measure_8cpp-source.html @@ -0,0 +1,355 @@ + + +EO: ErrorMeasure.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / regression
+

ErrorMeasure.cpp

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 
+00019 #include <vector>
+00020 #include <valarray>
+00021 
+00022 #include "MultiFunction.h"
+00023 
+00024 #include "ErrorMeasure.h"
+00025 #include "Dataset.h"
+00026 #include "Sym.h"
+00027 #include "FunDef.h"
+00028 #include "sym_compile.h"
+00029 #include "TargetInfo.h"
+00030 #include "stats.h"
+00031 
+00032 using namespace std;
+00033 
+00034 #ifdef INTERVAL_DEBUG
+00035 
+00036 #include <BoundsCheck.h>
+00037 #include <FunDef.h>
+00038 
+00039 vector<double> none;
+00040 IntervalBoundsCheck bounds(none, none);
+00041 
+00042 #endif
+00043 
+00044 
+00045 
+00046 static double not_a_number = atof("nan");
+00047 
+00048 class ErrorMeasureImpl {
+00049     public:
+00050         const Dataset& data;
+00051         TargetInfo train_info;
+00052         
+00053         ErrorMeasure::measure measure;
+00054         
+00055         Scaling no_scaling;
+00056         
+00057         ErrorMeasureImpl(const Dataset& d, double t_p, ErrorMeasure::measure m) : data(d), measure(m) {
+00058             
+00059 #ifdef INTERVAL_DEBUG
+00060             bounds = IntervalBoundsCheck(d.input_minima(), d.input_maxima());
+00061 #endif
+00062 
+00063             unsigned nrecords = d.n_records();
+00064             unsigned cases = unsigned(t_p * nrecords);
+00065             
+00066             valarray<double> t(cases);
+00067 
+00068             for (unsigned i = 0; i < cases; ++i) {
+00069                 t[i] = data.get_target(i);
+00070             }
+00071 
+00072             train_info = TargetInfo(t);
+00073             no_scaling = Scaling(new NoScaling);
+00074         }
+00075         
+00076         ErrorMeasure::result eval(const valarray<double>& y) {
+00077             
+00078             ErrorMeasure::result result;
+00079             result.scaling = no_scaling;
+00080             
+00081             
+00082             switch(measure) {
+00083                 case ErrorMeasure::mean_squared:
+00084                     result.error = pow(train_info.targets() - y, 2.0).sum() / y.size();
+00085                     return result;
+00086                 case ErrorMeasure::absolute:
+00087                     result.error = abs(train_info.targets() - y).sum() / y.size();
+00088                     return result;
+00089                 case ErrorMeasure::mean_squared_scaled:
+00090                     result.scaling = ols(y, train_info);
+00091                     result.error  = pow(train_info.targets() - result.scaling->transform(y), 2.0).sum() / y.size();
+00092                     return result;
+00093                 default: 
+00094                     cerr << "Unknown measure encountered: " << measure << " " << __FILE__ << " " << __LINE__ << endl;
+00095             }
+00096             
+00097             return result;
+00098         }   
+00099         
+00100         unsigned train_cases() const {
+00101             return train_info.targets().size();
+00102         }
+00103 
+00104         vector<ErrorMeasure::result> multi_function_eval(const vector<Sym>& pop) {
+00105            
+00106             if (pop.size() == 0) return vector<ErrorMeasure::result>();
+00107             
+00108             multi_function all = compile(pop);
+00109             //MultiFunction all(pop);
+00110             std::vector<double> y(pop.size());
+00111             
+00112             Scaling noScaling = Scaling(new NoScaling);
+00113             
+00114             const std::valarray<double>& t = train_info.targets();
+00115             
+00116             cout << "Population size " << pop.size() << endl;
+00117             
+00118             if (measure == ErrorMeasure::mean_squared_scaled) {
+00119                 std::vector<Var> var(pop.size());
+00120                 std::vector<Cov> cov(pop.size());
+00121             
+00122                 Var vart;
+00123 
+00124                 for (unsigned i = 0; i < t.size(); ++i) {
+00125                     vart.update(t[i]);
+00126                     
+00127                     all(&data.get_inputs(i)[0], &y[0]); // evalutate
+00128                     //all(data.get_inputs(i), y); // evalutate
+00129 
+00130                     for (unsigned j = 0; j < pop.size(); ++j) {
+00131                         var[j].update(y[j]);
+00132                         cov[j].update(y[j], t[i]);
+00133                     }
+00134                 }
+00135                 
+00136                 std::vector<ErrorMeasure::result> result(pop.size());
+00137                 
+00138                 for (unsigned i = 0; i < pop.size(); ++i) {
+00139                     
+00140                     // calculate scaling
+00141                     double b = cov[i].get_cov() / var[i].get_var();
+00142                     
+00143                     if (!finite(b)) {
+00144                         result[i].scaling = noScaling;
+00145                         result[i].error = vart.get_var(); // largest error
+00146                         continue;
+00147                     }
+00148                     
+00149                     double a = vart.get_mean() - b * var[i].get_mean();
+00150                     
+00151                     result[i].scaling = Scaling( new LinearScaling(a,b));
+00152 
+00153                     // calculate error
+00154                     double c = cov[i].get_cov();
+00155                     c *= c;
+00156                     
+00157                     double err = vart.get_var() - c / var[i].get_var();
+00158                     result[i].error = err; 
+00159                     if (!finite(err)) {
+00160                         //cout << pop[i] << endl;
+00161                         cout << "b     " << b << endl;
+00162                         cout << "var t " << vart.get_var() << endl;
+00163                         cout << "var i " << var[i].get_var() << endl;
+00164                         cout << "cov   " << cov[i].get_cov() << endl;
+00165                         
+00166                         for (unsigned j = 0; j < t.size(); ++j) {
+00167                             all(&data.get_inputs(i)[0], &y[0]); // evalutate
+00168                             //all(data.get_inputs(j), y); // evalutate
+00169                             
+00170                             cout << y[i] << ' ' << ::eval(pop[i], data.get_inputs(j)) << endl;
+00171                         }
+00172                         
+00173                         exit(1);
+00174                     }
+00175                 }
+00176         
+00177                 return result;
+00178             }
+00179         
+00180             
+00181             std::vector<double> err(pop.size()); 
+00182             
+00183             for (unsigned i = 0; i < train_cases(); ++i) {
+00184                 // evaluate
+00185                 all(&data.get_inputs(i)[0], &y[0]);
+00186                 //all(data.get_inputs(i), y);
+00187 
+00188                 for (unsigned j = 0; j < pop.size(); ++j) {
+00189                     double diff = y[j] - t[i];
+00190                     if (measure == ErrorMeasure::mean_squared) { // branch prediction will probably solve this inefficiency
+00191                         err[j] += diff * diff;
+00192                     } else {
+00193                         err[j] += fabs(diff);
+00194                     }
+00195                     
+00196                 }
+00197                 
+00198             }
+00199             
+00200             std::vector<ErrorMeasure::result> result(pop.size());
+00201 
+00202             double n = train_cases();
+00203             for (unsigned i = 0; i < pop.size(); ++i) {
+00204                 result[i].error = err[i] / n;
+00205                 result[i].scaling = noScaling;
+00206             }
+00207 
+00208             return result;
+00209             
+00210         }
+00211 
+00212         vector<ErrorMeasure::result> single_function_eval(const vector<Sym> & pop) {
+00213             
+00214             vector<single_function> funcs(pop.size());
+00215             compile(pop, funcs); // get one function pointer for each individual
+00216 
+00217             valarray<double> y(train_cases());
+00218             vector<ErrorMeasure::result> result(pop.size());
+00219             for (unsigned i = 0; i < funcs.size(); ++i) {
+00220                 for (unsigned j = 0; j < train_cases(); ++j) {
+00221                     y[j] = funcs[i](&data.get_inputs(j)[0]);
+00222                 }
+00223         
+00224 #ifdef INTERVAL_DEBUG
+00225                 //cout << "eval func " << i << " " << pop[i] << endl;
+00226                 pair<double, double> b = bounds.calc_bounds(pop[i]);
+00227                 
+00228                 // check if y is in bounds
+00229                 for (unsigned j = 0; j < y.size(); ++j) {
+00230                     if (y[j] < b.first -1e-4 || y[j] > b.second + 1e-4 || !finite(y[j])) {
+00231                         cout << "Error " << y[j] << " not in " << b.first << ' ' << b.second << endl;
+00232                         cout << "Function " << pop[i] << endl;
+00233                         exit(1);
+00234                     }
+00235                 }
+00236 #endif
+00237                 
+00238                 result[i] = eval(y);
+00239             }
+00240             
+00241             return result; 
+00242         }
+00243         
+00244         vector<ErrorMeasure::result> calc_error(const vector<Sym>& pop) {
+00245 
+00246             // first declone
+00247 #if USE_TR1
+00248             typedef std::tr1::unordered_map<Sym, unsigned, HashSym> HashMap;
+00249 #else
+00250             typedef hash_map<Sym, unsigned, HashSym> HashMap;
+00251 #endif      
+00252             HashMap clone_map;
+00253             vector<Sym> decloned; 
+00254             decloned.reserve(pop.size());
+00255             
+00256             for (unsigned i = 0; i < pop.size(); ++i) {
+00257                 HashMap::iterator it = clone_map.find(pop[i]);
+00258 
+00259                 if (it == clone_map.end()) { // new
+00260                     clone_map[ pop[i] ] = decloned.size();
+00261                     decloned.push_back(pop[i]);
+00262                 } 
+00263                 
+00264             }
+00265             
+00266             // evaluate 
+00267             vector<ErrorMeasure::result> dresult;
+00268             // currently we can only accumulate simple measures such as absolute and mean_squared
+00269             switch(measure) {
+00270                 case ErrorMeasure::mean_squared:
+00271                 case ErrorMeasure::absolute:
+00272                     dresult = multi_function_eval(decloned);
+00273                     break;
+00274                 case ErrorMeasure::mean_squared_scaled:
+00275                     dresult = multi_function_eval(decloned);
+00276                     break;
+00277             }
+00278             
+00279             vector<ErrorMeasure::result> result(pop.size());
+00280             for (unsigned i = 0; i < result.size(); ++i) {
+00281                 result[i] = dresult[ clone_map[pop[i]] ];
+00282             }
+00283         
+00284             return result;
+00285         }
+00286         
+00287 };
+00288 
+00289 ErrorMeasure::result::result() {
+00290     error = 0.0;
+00291     scaling = Scaling(0);
+00292 }
+00293 
+00294 bool ErrorMeasure::result::valid() const {
+00295     return isfinite(error);
+00296 }
+00297 
+00298 ErrorMeasure::ErrorMeasure(const Dataset& data, double train_perc, measure meas) {
+00299     pimpl = new ErrorMeasureImpl(data, train_perc, meas);
+00300 }
+00301 
+00302 ErrorMeasure::~ErrorMeasure() { delete pimpl; }
+00303 ErrorMeasure::ErrorMeasure(const ErrorMeasure& that) { pimpl = new ErrorMeasureImpl(*that.pimpl); }
+00304 
+00305 
+00306 ErrorMeasure::result ErrorMeasure::calc_error(Sym sym) {
+00307    
+00308     single_function f = compile(sym);
+00309     
+00310     valarray<double> y(pimpl->train_cases());
+00311      
+00312     for (unsigned i = 0; i < y.size(); ++i) {
+00313 
+00314         y[i] = f(&pimpl->data.get_inputs(i)[0]);
+00315         
+00316         if (!finite(y[i])) {
+00317             result res;
+00318             res.scaling = Scaling(new NoScaling);
+00319             res.error = not_a_number;
+00320             return res;
+00321         }
+00322     }
+00323    
+00324     return pimpl->eval(y); 
+00325 }
+00326 
+00327 vector<ErrorMeasure::result> ErrorMeasure::calc_error(const vector<Sym>& syms) {
+00328     return pimpl->calc_error(syms);
+00329     
+00330 }
+00331 
+00332 double ErrorMeasure::worst_performance() const {
+00333     
+00334     if (pimpl->measure == mean_squared_scaled) {
+00335         return pimpl->train_info.tvar();
+00336     }
+00337     
+00338     return 1e+20; 
+00339 }
+00340 
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_error_measure_8h-source.html b/trunk/paradiseo-eo/doc/html/_error_measure_8h-source.html new file mode 100644 index 000000000..d7bac48f8 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_error_measure_8h-source.html @@ -0,0 +1,76 @@ + + +EO: ErrorMeasure.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / regression
+

ErrorMeasure.h

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #ifndef ERROR_MEASURE_H
+00019 #define ERROR_MEASURE_H
+00020 
+00021 #include "Scaling.h"
+00022 
+00023 class ErrorMeasureImpl;
+00024 class Sym;
+00025 class Dataset;
+00026 
+00027 class ErrorMeasure {
+00028     
+00029     ErrorMeasureImpl* pimpl;
+00030     
+00031     public :
+00032 
+00033         enum measure {
+00034             absolute,
+00035             mean_squared,
+00036             mean_squared_scaled,
+00037         };
+00038         
+00039         struct result {
+00040             double  error;
+00041             Scaling scaling;
+00042             
+00043             result();
+00044             bool valid() const;
+00045         };
+00046         
+00047         ErrorMeasure(const Dataset& data, double train_perc, measure meas = mean_squared);
+00048         
+00049         ~ErrorMeasure();
+00050         ErrorMeasure(const ErrorMeasure& that);
+00051         ErrorMeasure& operator=(const ErrorMeasure& that);
+00052         
+00053         result calc_error(Sym sym);
+00054 
+00055         std::vector<result> calc_error(const std::vector<Sym>& sym);
+00056         
+00057         double worst_performance() const;
+00058 };
+00059 
+00060 #endif
+00061 
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_first_bit_e_a_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_first_bit_e_a_8cpp-source.html new file mode 100644 index 000000000..e6759569b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_first_bit_e_a_8cpp-source.html @@ -0,0 +1,194 @@ + + +EO: FirstBitEA.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Lesson2
+

FirstBitEA.cpp

00001 //-----------------------------------------------------------------------------
+00002 // FirstBitEA.cpp
+00003 //-----------------------------------------------------------------------------
+00004 //*
+00005 // Still an instance of a VERY simple Bitstring Genetic Algorithm
+00006 // (see FirstBitGA.cpp) but now with  Breeder - and Combined Ops
+00007 //
+00008 //-----------------------------------------------------------------------------
+00009 #ifdef HAVE_CONFIG_H
+00010 #include <config.h>
+00011 #endif
+00012 
+00013 // standard includes
+00014 #include <stdexcept>  // runtime_error
+00015 #include <iostream>   // cout
+00016 
+00017 // the general include for eo
+00018 #include <eo>
+00019 #include <ga.h>
+00020 
+00021 // Use functions from namespace std
+00022 using namespace std;
+00023 
+00024 // REPRESENTATION
+00025 //-----------------------------------------------------------------------------
+00026 // define your individuals
+00027 typedef eoBit<double> Indi;     // A bitstring with fitness double
+00028 
+00029 // EVALFUNC
+00030 //-----------------------------------------------------------------------------
+00031 // a simple fitness function that computes the number of ones of a bitstring
+00032 // Now in a separate file, and declared as binary_value(const vector<bool> &)
+00033 
+00034 #include "binary_value.h"
+00035 
+00036 // GENERAL
+00037 //-----------------------------------------------------------------------------
+00038 
+00039 void main_function(int argc, char **argv)
+00040 {
+00041 // PARAMETRES
+00042   const unsigned int SEED = 42; // seed for random number generator
+00043   const unsigned int T_SIZE = 3; // size for tournament selection
+00044   const unsigned int VEC_SIZE = 8; // Number of bits in genotypes
+00045   const unsigned int POP_SIZE = 20; // Size of population
+00046 
+00047   const unsigned int MAX_GEN = 500; // Maximum number of generation before STOP
+00048   const unsigned int MIN_GEN = 10;  // Minimum number of generation before ...
+00049   const unsigned int STEADY_GEN = 50; // stop after STEADY_GEN gen. without improvelent
+00050 
+00051   const double P_CROSS = 0.8;   // Crossover probability
+00052   const double P_MUT = 1.0;     // mutation probability
+00053 
+00054   const double P_MUT_PER_BIT = 0.01;    // internal probability for bit-flip mutation
+00055   // some parameters for chosing among different operators
+00056   const double onePointRate = 0.5;     // rate for 1-pt Xover
+00057   const double twoPointsRate = 0.5;     // rate for 2-pt Xover
+00058   const double URate = 0.5;            // rate for Uniform Xover
+00059   const double bitFlipRate = 0.5;      // rate for bit-flip mutation
+00060   const double oneBitRate = 0.5;       // rate for one-bit mutation
+00061 
+00062 // GENERAL
+00064   //  Random seed
+00066   //reproducible random seed: if you don't change SEED above,
+00067   // you'll aways get the same result, NOT a random run
+00068   rng.reseed(SEED);
+00069 
+00070 // EVAL
+00072   // Fitness function
+00074   // Evaluation: from a plain C++ fn to an EvalFunc Object
+00075   // you need to give the full description of the function
+00076   eoEvalFuncPtr<Indi, double, const vector<bool>& > eval(  binary_value );
+00077 
+00078 // INIT
+00080   // Initilisation of population
+00082 
+00083   // based on boolean_generator class (see utils/eoRndGenerators.h)
+00084   eoUniformGenerator<bool> uGen;
+00085   eoInitFixedLength<Indi> random(VEC_SIZE, uGen);
+00086   // Initialization of the population
+00087   eoPop<Indi> pop(POP_SIZE, random);
+00088 
+00089   // and evaluate it in one loop
+00090   apply<Indi>(eval, pop);       // STL syntax
+00091 
+00092 // OUTPUT
+00093   // sort pop before printing it!
+00094   pop.sort();
+00095   // Print (sorted) intial population (raw printout)
+00096   cout << "Initial Population" << endl;
+00097   cout << pop;
+00098 
+00099 // ENGINE
+00101   // selection and replacement
+00103 // SELECT
+00104   // The robust tournament selection
+00105   eoDetTournamentSelect<Indi> selectOne(T_SIZE);       // T_SIZE in [2,POP_SIZE]
+00106   // is now encapsulated in a eoSelectPerc (entage)
+00107   eoSelectPerc<Indi> select(selectOne);// by default rate==1
+00108 
+00109 // REPLACE
+00110   // And we now have the full slection/replacement - though with
+00111   // no replacement (== generational replacement) at the moment :-)
+00112   eoGenerationalReplacement<Indi> replace;
+00113 
+00114 // OPERATORS
+00116   // The variation operators
+00118 // CROSSOVER
+00119   // 1-point crossover for bitstring
+00120   eo1PtBitXover<Indi> xover1;
+00121   // uniform crossover for bitstring
+00122   eoUBitXover<Indi> xoverU;
+00123   // 2-pots xover
+00124   eoNPtsBitXover<Indi> xover2(2);
+00125   // Combine them with relative rates
+00126   eoPropCombinedQuadOp<Indi> xover(xover1, onePointRate);
+00127   xover.add(xoverU, URate);
+00128   xover.add(xover2, twoPointsRate, true);
+00129 
+00130 // MUTATION
+00131   // standard bit-flip mutation for bitstring
+00132   eoBitMutation<Indi>  mutationBitFlip(P_MUT_PER_BIT);
+00133   // mutate exactly 1 bit per individual
+00134   eoDetBitFlip<Indi> mutationOneBit;
+00135   // Combine them with relative rates
+00136   eoPropCombinedMonOp<Indi> mutation(mutationBitFlip, bitFlipRate);
+00137   mutation.add(mutationOneBit, oneBitRate, true);
+00138 
+00139   // The operators are  encapsulated into an eoTRansform object
+00140   eoSGATransform<Indi> transform(xover, P_CROSS, mutation, P_MUT);
+00141 
+00142 // STOP
+00143 // CHECKPOINT
+00145   // termination conditions: use more than one
+00147   // stop after MAX_GEN generations
+00148   eoGenContinue<Indi> genCont(MAX_GEN);
+00149   // do MIN_GEN gen., then stop after STEADY_GEN gen. without improvement
+00150   eoSteadyFitContinue<Indi> steadyCont(MIN_GEN, STEADY_GEN);
+00151   // stop when fitness reaches a target (here VEC_SIZE)
+00152   eoFitContinue<Indi> fitCont(VEC_SIZE);
+00153   // do stop when one of the above says so
+00154   eoCombinedContinue<Indi> continuator(genCont);
+00155   continuator.add(steadyCont);
+00156   continuator.add(fitCont);
+00157 
+00158 // GENERATION
+00160   // the algorithm
+00162 
+00163   // Easy EA requires
+00164   // selection, transformation, eval, replacement, and stopping criterion
+00165   eoEasyEA<Indi> gga(continuator, eval, select, transform, replace);
+00166 
+00167   // Apply algo to pop - that's it!
+00168   cout << "\n        Here we go\n\n";
+00169   gga(pop);
+00170 
+00171 // OUTPUT
+00172   // Print (sorted) intial population
+00173   pop.sort();
+00174   cout << "FINAL Population\n" << pop << endl;
+00175 // GENERAL
+00176 }
+00177 
+00178 // A main that catches the exceptions
+00179 
+00180 int main(int argc, char **argv)
+00181 {
+00182 
+00183     try
+00184     {
+00185         main_function(argc, argv);
+00186     }
+00187     catch(exception& e)
+00188     {
+00189         cout << "Exception: " << e.what() << '\n';
+00190     }
+00191 
+00192     return 1;
+00193 }
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_first_bit_g_a_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_first_bit_g_a_8cpp-source.html new file mode 100644 index 000000000..cf19c6934 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_first_bit_g_a_8cpp-source.html @@ -0,0 +1,168 @@ + + +EO: FirstBitGA.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Lesson1
+

FirstBitGA.cpp

00001 //-----------------------------------------------------------------------------
+00002 // FirstBitGA.cpp
+00003 //-----------------------------------------------------------------------------
+00004 //*
+00005 // An instance of a VERY simple Bitstring Genetic Algorithm
+00006 //
+00007 //-----------------------------------------------------------------------------
+00008 
+00009 #ifdef HAVE_CONFIG_H
+00010 #include <config.h>
+00011 #endif
+00012 
+00013 #include <stdexcept>
+00014 #include <iostream>
+00015 
+00016 #include <eo>
+00017 #include <ga.h>
+00018 
+00019 // Use functions from namespace std
+00020 using namespace std;
+00021 
+00022 // REPRESENTATION
+00023 //-----------------------------------------------------------------------------
+00024 // define your individuals
+00025 typedef eoBit<double> Indi;     // A bitstring with fitness double
+00026 
+00027 // EVAL
+00028 //-----------------------------------------------------------------------------
+00029 // a simple fitness function that computes the number of ones of a bitstring
+00030 //  @param _indi A biststring individual
+00031 
+00032 double binary_value(const Indi & _indi)
+00033 {
+00034   double sum = 0;
+00035   for (unsigned i = 0; i < _indi.size(); i++)
+00036     sum += _indi[i];
+00037   return sum;
+00038 }
+00039 // GENERAL
+00040 //-----------------------------------------------------------------------------
+00041 void main_function(int argc, char **argv)
+00042 {
+00043 // PARAMETRES
+00044   // all parameters are hard-coded!
+00045   const unsigned int SEED = 42;      // seed for random number generator
+00046   const unsigned int T_SIZE = 3;     // size for tournament selection
+00047   const unsigned int VEC_SIZE = 16;   // Number of bits in genotypes
+00048   const unsigned int POP_SIZE = 100;  // Size of population
+00049   const unsigned int MAX_GEN = 400;  // Maximum number of generation before STOP
+00050   const float CROSS_RATE = 0.8;      // Crossover rate
+00051   const double P_MUT_PER_BIT = 0.01; // probability of bit-flip mutation
+00052   const float MUT_RATE = 1.0;        // mutation rate
+00053 
+00054 // GENERAL
+00056   //  Random seed
+00058   //reproducible random seed: if you don't change SEED above,
+00059   // you'll aways get the same result, NOT a random run
+00060   rng.reseed(SEED);
+00061 
+00062 // EVAL
+00064   // Fitness function
+00066   // Evaluation: from a plain C++ fn to an EvalFunc Object
+00067   eoEvalFuncPtr<Indi> eval(  binary_value );
+00068 
+00069 // INIT
+00071   // Initilisation of population
+00073 
+00074   // declare the population
+00075   eoPop<Indi> pop;
+00076   // fill it!
+00077   for (unsigned int igeno=0; igeno<POP_SIZE; igeno++)
+00078     {
+00079       Indi v;           // void individual, to be filled
+00080       for (unsigned ivar=0; ivar<VEC_SIZE; ivar++)
+00081         {
+00082           bool r = rng.flip(); // new value, random in {0,1}
+00083           v.push_back(r);      // append that random value to v
+00084         }
+00085       eval(v);                 // evaluate it
+00086       pop.push_back(v);        // and put it in the population
+00087     }
+00088 
+00089 // OUTPUT
+00090   // sort pop before printing it!
+00091   pop.sort();
+00092   // Print (sorted) intial population (raw printout)
+00093   cout << "Initial Population" << endl;
+00094   cout << pop;
+00095   // shuffle  - this is a test
+00096   pop.shuffle();
+00097   // Print (sorted) intial population (raw printout)
+00098   cout << "Shuffled Population" << endl;
+00099   cout << pop;
+00100 
+00101 // ENGINE
+00103   // selection and replacement
+00105 // SELECT
+00106   // The robust tournament selection
+00107   eoDetTournamentSelect<Indi> select(T_SIZE);  // T_SIZE in [2,POP_SIZE]
+00108 
+00109 // REPLACE
+00110   // The simple GA evolution engine uses generational replacement
+00111   // so no replacement procedure is needed
+00112 
+00113 // OPERATORS
+00115   // The variation operators
+00117 // CROSSOVER
+00118   // 1-point crossover for bitstring
+00119   eo1PtBitXover<Indi> xover;
+00120 // MUTATION
+00121   // standard bit-flip mutation for bitstring
+00122   eoBitMutation<Indi>  mutation(P_MUT_PER_BIT);
+00123 
+00124 // STOP
+00125 // CHECKPOINT
+00127   // termination condition
+00129   // stop after MAX_GEN generations
+00130   eoGenContinue<Indi> continuator(MAX_GEN);
+00131 
+00132 // GENERATION
+00134   // the algorithm
+00136   // standard Generational GA requires as parameters
+00137   // selection, evaluation, crossover and mutation, stopping criterion
+00138 
+00139 
+00140   eoSGA<Indi> gga(select, xover, CROSS_RATE, mutation, MUT_RATE,
+00141                   eval, continuator);
+00142 
+00143   // Apply algo to pop - that's it!
+00144   gga(pop);
+00145 
+00146 // OUTPUT
+00147   // Print (sorted) intial population
+00148   pop.sort();
+00149   cout << "FINAL Population\n" << pop << endl;
+00150 // GENERAL
+00151 }
+00152  // A main that catches the exceptions
+00153 
+00154 int main(int argc, char **argv)
+00155 {
+00156 
+00157     try
+00158     {
+00159         main_function(argc, argv);
+00160     }
+00161     catch(exception& e)
+00162     {
+00163         cout << "Exception: " << e.what() << '\n';
+00164     }
+00165 
+00166     return 1;
+00167 }
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_first_real_e_a_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_first_real_e_a_8cpp-source.html new file mode 100644 index 000000000..8323e10df --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_first_real_e_a_8cpp-source.html @@ -0,0 +1,193 @@ + + +EO: FirstRealEA.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Lesson2
+

FirstRealEA.cpp

00001 //-----------------------------------------------------------------------------
+00002 // FirstRealEA.cpp
+00003 //-----------------------------------------------------------------------------
+00004 //*
+00005 // Still an instance of a VERY simple Real-coded  Genetic Algorithm
+00006 // (see FirstBitGA.cpp) but now with  Breeder - and Combined Ops
+00007 //
+00008 //-----------------------------------------------------------------------------
+00009 #ifdef HAVE_CONFIG_H
+00010 #include <config.h>
+00011 #endif
+00012 
+00013 // standard includes
+00014 #include <stdexcept>  // runtime_error
+00015 #include <iostream>   // cout
+00016 
+00017 // the general include for eo
+00018 #include <eo>
+00019 #include <es.h>
+00020 
+00021 // REPRESENTATION
+00022 //-----------------------------------------------------------------------------
+00023 // define your individuals
+00024 typedef eoReal<double> Indi;
+00025 
+00026 // Use functions from namespace std
+00027 using namespace std;
+00028 
+00029 // EVALFUNC
+00030 //-----------------------------------------------------------------------------
+00031 // a simple fitness function that computes the euclidian norm of a real vector
+00032 // Now in a separate file, and declared as binary_value(const vector<bool> &)
+00033 
+00034 #include "real_value.h"
+00035 
+00036 // GENERAL
+00037 //-----------------------------------------------------------------------------
+00038 
+00039 void main_function(int argc, char **argv)
+00040 {
+00041 // PARAMETRES
+00042   const unsigned int SEED = 42; // seed for random number generator
+00043   const unsigned int T_SIZE = 3; // size for tournament selection
+00044   const unsigned int VEC_SIZE = 8; // Number of object variables in genotypes
+00045   const unsigned int POP_SIZE = 20; // Size of population
+00046 
+00047   const unsigned int MAX_GEN = 500; // Maximum number of generation before STOP
+00048   const unsigned int MIN_GEN = 10;  // Minimum number of generation before ...
+00049   const unsigned int STEADY_GEN = 50; // stop after STEADY_GEN gen. without improvelent
+00050 
+00051   const float P_CROSS = 0.8;    // Crossover probability
+00052   const float P_MUT = 0.5;      // mutation probability
+00053 
+00054   const double EPSILON = 0.01;  // range for real uniform mutation
+00055   double SIGMA = 0.3;           // std dev. for normal mutation
+00056   // some parameters for chosing among different operators
+00057   const double hypercubeRate = 0.5;     // relative weight for hypercube Xover
+00058   const double segmentRate = 0.5;  // relative weight for segment Xover
+00059   const double uniformMutRate = 0.5;  // relative weight for uniform mutation
+00060   const double detMutRate = 0.5;      // relative weight for det-uniform mutation
+00061   const double normalMutRate = 0.5;   // relative weight for normal mutation
+00062 
+00063 // GENERAL
+00065   //  Random seed
+00067   //reproducible random seed: if you don't change SEED above,
+00068   // you'll aways get the same result, NOT a random run
+00069   rng.reseed(SEED);
+00070 
+00071 // EVAL
+00073   // Fitness function
+00075   // Evaluation: from a plain C++ fn to an EvalFunc Object
+00076   // you need to give the full description of the function
+00077   eoEvalFuncPtr<Indi, double, const vector<double>& > eval(  real_value );
+00078 
+00079 // INIT
+00081   // Initilisation of population
+00083   // based on a uniform generator
+00084   eoUniformGenerator<double> uGen(-1.0, 1.0);
+00085   eoInitFixedLength<Indi> random(VEC_SIZE, uGen);
+00086    // Initialization of the population
+00087   eoPop<Indi> pop(POP_SIZE, random);
+00088 
+00089   // and evaluate it in one loop
+00090   apply<Indi>(eval, pop);       // STL syntax
+00091 
+00092 // OUTPUT
+00093   // sort pop before printing it!
+00094   pop.sort();
+00095   // Print (sorted) intial population (raw printout)
+00096   cout << "Initial Population" << endl;
+00097   cout << pop;
+00098 
+00099 // ENGINE
+00101   // selection and replacement
+00103 // SELECT
+00104   // The robust tournament selection
+00105   eoDetTournamentSelect<Indi> selectOne(T_SIZE);
+00106   // is now encapsulated in a eoSelectPerc (entage)
+00107   eoSelectPerc<Indi> select(selectOne);// by default rate==1
+00108 
+00109 // REPLACE
+00110   // And we now have the full slection/replacement - though with
+00111   // no replacement (== generational replacement) at the moment :-)
+00112   eoGenerationalReplacement<Indi> replace;
+00113 
+00114 // OPERATORS
+00116   // The variation operators
+00118 // CROSSOVER
+00119   // uniform chooce on segment made by the parents
+00120   eoSegmentCrossover<Indi> xoverS;
+00121   // uniform choice in hypercube built by the parents
+00122   eoHypercubeCrossover<Indi> xoverA;
+00123   // Combine them with relative weights
+00124   eoPropCombinedQuadOp<Indi> xover(xoverS, segmentRate);
+00125   xover.add(xoverA, hypercubeRate, true);
+00126 
+00127 // MUTATION
+00128   // offspring(i) uniformly chosen in [parent(i)-epsilon, parent(i)+epsilon]
+00129   eoUniformMutation<Indi>  mutationU(EPSILON);
+00130   // k (=1) coordinates of parents are uniformly modified
+00131   eoDetUniformMutation<Indi>  mutationD(EPSILON);
+00132   // all coordinates of parents are normally modified (stDev SIGMA)
+00133   eoNormalMutation<Indi>  mutationN(SIGMA);
+00134   // Combine them with relative weights
+00135   eoPropCombinedMonOp<Indi> mutation(mutationU, uniformMutRate);
+00136   mutation.add(mutationD, detMutRate);
+00137   mutation.add(mutationN, normalMutRate, true);
+00138 
+00139 // STOP
+00140 // CHECKPOINT
+00142   // termination conditions: use more than one
+00144   // stop after MAX_GEN generations
+00145   eoGenContinue<Indi> genCont(MAX_GEN);
+00146   // do MIN_GEN gen., then stop after STEADY_GEN gen. without improvement
+00147   eoSteadyFitContinue<Indi> steadyCont(MIN_GEN, STEADY_GEN);
+00148   // stop when fitness reaches a target (here VEC_SIZE)
+00149   eoFitContinue<Indi> fitCont(0);
+00150   // do stop when one of the above says so
+00151   eoCombinedContinue<Indi> continuator(genCont);
+00152   continuator.add(steadyCont);
+00153   continuator.add(fitCont);
+00154 
+00155   // The operators are  encapsulated into an eoTRansform object
+00156   eoSGATransform<Indi> transform(xover, P_CROSS, mutation, P_MUT);
+00157 
+00158 // GENERATION
+00160   // the algorithm
+00162 
+00163   // Easy EA requires
+00164   // selection, transformation, eval, replacement, and stopping criterion
+00165   eoEasyEA<Indi> gga(continuator, eval, select, transform, replace);
+00166 
+00167   // Apply algo to pop - that's it!
+00168   cout << "\n        Here we go\n\n";
+00169   gga(pop);
+00170 
+00171 // OUTPUT
+00172   // Print (sorted) intial population
+00173   pop.sort();
+00174   cout << "FINAL Population\n" << pop << endl;
+00175 // GENERAL
+00176 }
+00177 
+00178 // A main that catches the exceptions
+00179 
+00180 int main(int argc, char **argv)
+00181 {
+00182     try
+00183     {
+00184         main_function(argc, argv);
+00185     }
+00186     catch(exception& e)
+00187     {
+00188         cout << "Exception: " << e.what() << '\n';
+00189     }
+00190 
+00191     return 1;
+00192 }
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_first_real_g_a_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_first_real_g_a_8cpp-source.html new file mode 100644 index 000000000..3fa1a9eae --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_first_real_g_a_8cpp-source.html @@ -0,0 +1,163 @@ + + +EO: FirstRealGA.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Lesson1
+

FirstRealGA.cpp

00001 //-----------------------------------------------------------------------------
+00002 // FirstRealGA.cpp
+00003 //-----------------------------------------------------------------------------
+00004 //*
+00005 // An instance of a VERY simple Real-coded Genetic Algorithm
+00006 //
+00007 //-----------------------------------------------------------------------------
+00008 #ifdef HAVE_CONFIG_H
+00009 #include <config.h>
+00010 #endif
+00011 
+00012 #include <stdexcept>
+00013 #include <iostream>
+00014 #include <sstream>
+00015 
+00016 #include <eo>
+00017 #include <es.h>
+00018 
+00019 // Use functions from namespace std
+00020 using namespace std;
+00021 
+00022 // REPRESENTATION
+00023 //-----------------------------------------------------------------------------
+00024 // define your individuals
+00025  typedef eoReal<double> Indi;
+00026 
+00027 // EVAL
+00028 //-----------------------------------------------------------------------------
+00029 // a simple fitness function that computes the euclidian norm of a real vector
+00030 //    @param _indi A real-valued individual
+00031 
+00032 double real_value(const Indi & _indi)
+00033 {
+00034   double sum = 0;
+00035   for (unsigned i = 0; i < _indi.size(); i++)
+00036       sum += _indi[i]*_indi[i];
+00037   return (-sum);            // maximizing only
+00038 }
+00039 // GENERAL
+00040 //-----------------------------------------------------------------------------
+00041 void main_function(int argc, char **argv)
+00042 {
+00043 // PARAMETRES
+00044   // all parameters are hard-coded!
+00045   const unsigned int SEED = 42; // seed for random number generator
+00046   const unsigned int VEC_SIZE = 8; // Number of object variables in genotypes
+00047   const unsigned int POP_SIZE = 20; // Size of population
+00048   const unsigned int T_SIZE = 3; // size for tournament selection
+00049   const unsigned int MAX_GEN = 500; // Maximum number of generation before STOP
+00050   const float CROSS_RATE = 0.8; // Crossover rate
+00051   const double EPSILON = 0.01;  // range for real uniform mutation
+00052   const float MUT_RATE = 0.5;   // mutation rate
+00053 
+00054 // GENERAL
+00056   //  Random seed
+00058   //reproducible random seed: if you don't change SEED above,
+00059   // you'll aways get the same result, NOT a random run
+00060   rng.reseed(SEED);
+00061 
+00062 // EVAL
+00064   // Fitness function
+00066   // Evaluation: from a plain C++ fn to an EvalFunc Object
+00067   eoEvalFuncPtr<Indi> eval(  real_value );
+00068 
+00069 // INIT
+00071   // Initilisation of population
+00073 
+00074   // declare the population
+00075   eoPop<Indi> pop;
+00076   // fill it!
+00077   for (unsigned int igeno=0; igeno<POP_SIZE; igeno++)
+00078     {
+00079       Indi v;          // void individual, to be filled
+00080       for (unsigned ivar=0; ivar<VEC_SIZE; ivar++)
+00081         {
+00082           double r = 2*rng.uniform() - 1; // new value, random in [-1,1)
+00083           v.push_back(r);       // append that random value to v
+00084         }
+00085       eval(v);                  // evaluate it
+00086       pop.push_back(v);         // and put it in the population
+00087     }
+00088 
+00089 // OUTPUT
+00090   // sort pop before printing it!
+00091   pop.sort();
+00092   // Print (sorted) intial population (raw printout)
+00093   cout << "Initial Population" << endl;
+00094   cout << pop;
+00095 
+00096 // ENGINE
+00098   // selection and replacement
+00100 // SELECT
+00101   // The robust tournament selection
+00102   eoDetTournamentSelect<Indi> select(T_SIZE);       // T_SIZE in [2,POP_SIZE]
+00103 
+00104 // REPLACE
+00105   // eoSGA uses generational replacement by default
+00106   // so no replacement procedure has to be given
+00107 
+00108 // OPERATORS
+00110   // The variation operators
+00112 // CROSSOVER
+00113   // offspring(i) is a linear combination of parent(i)
+00114   eoSegmentCrossover<Indi> xover;
+00115 // MUTATION
+00116   // offspring(i) uniformly chosen in [parent(i)-epsilon, parent(i)+epsilon]
+00117   eoUniformMutation<Indi>  mutation(EPSILON);
+00118 
+00119 // STOP
+00120 // CHECKPOINT
+00122   // termination condition
+00124   // stop after MAX_GEN generations
+00125   eoGenContinue<Indi> continuator(MAX_GEN);
+00126 
+00127 // GENERATION
+00129   // the algorithm
+00131   // standard Generational GA requires
+00132   // selection, evaluation, crossover and mutation, stopping criterion
+00133 
+00134 
+00135   eoSGA<Indi> gga(select, xover, CROSS_RATE, mutation, MUT_RATE,
+00136                    eval, continuator);
+00137 
+00138   // Apply algo to pop - that's it!
+00139   gga(pop);
+00140 
+00141 // OUTPUT
+00142   // Print (sorted) intial population
+00143   pop.sort();
+00144   cout << "FINAL Population\n" << pop << endl;
+00145 // GENERAL
+00146 }
+00147 
+00148 // A main that catches the exceptions
+00149 
+00150 int main(int argc, char **argv)
+00151 {
+00152     try
+00153     {
+00154         main_function(argc, argv);
+00155     }
+00156     catch(exception& e)
+00157     {
+00158         cout << "Exception: " << e.what() << '\n';
+00159     }
+00160 
+00161     return 1;
+00162 }
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_fun_def_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_fun_def_8cpp-source.html new file mode 100644 index 000000000..21d02c94f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_fun_def_8cpp-source.html @@ -0,0 +1,905 @@ + + +EO: FunDef.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / fun
+

FunDef.cpp

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 
+00019 #include <sstream>
+00020 #include "Sym.h"
+00021 #include "FunDef.h"
+00022 #include <LanguageTable.h>
+00023 
+00024 using namespace std;
+00025 using namespace boost::numeric;
+00026 
+00027 vector<const FunDef*> language; 
+00028 
+00029 token_t add_function(FunDef* function) { 
+00030     language.push_back(function); 
+00031     return token_t(language.size()-1); 
+00032 }
+00033 
+00034 const FunDef& get_element(token_t token) { return *language[token]; }
+00035 
+00036 /* Printing */
+00037 
+00038 string c_print(const Sym& sym) {
+00039     return c_print(sym, vector<string>());
+00040 }
+00041 
+00042 string c_print(const Sym& sym, const vector<string>& vars) {
+00043     const SymVec& args = sym.args();
+00044     vector<string> names(args.size());
+00045     for (unsigned i = 0; i < args.size(); ++i) {
+00046         names[i] = c_print(args[i], vars);
+00047     }
+00048     return language[sym.token()]->c_print(names, vars);
+00049 }
+00050 
+00051 /* Evaluation */
+00052 
+00053 
+00054 double eval(const Sym& sym, const std::vector<double>& inputs) {
+00055     return language[sym.token()]->eval(sym.args(), inputs);
+00056 }
+00057 
+00058 
+00059 /* Interval Logic */
+00060 Interval eval(const Sym& sym, const vector<Interval>& inputs) {
+00061     const SymVec& args = sym.args();
+00062     vector<Interval> interv(args.size());
+00063     for (unsigned i = 0; i < args.size(); ++i) {
+00064         interv[i] = eval(args[i], inputs);
+00065     
+00066         if (!valid(interv[i])) throw interval_error();
+00067     }
+00068     return language[sym.token()]->eval(interv, inputs);
+00069 }
+00070 
+00071 /*  */
+00072 void add_function_to_table(LanguageTable& table, token_t token) {
+00073     const FunDef& fundef = *language[token];
+00074     
+00075     if (fundef.has_varargs() == false) {
+00076         table.add_function(token, fundef.min_arity());
+00077     } else { // sum or prod (or min or max)
+00078         table.add_function(token, 2);
+00079     }
+00080 }
+00081 
+00082 
+00083 // by default it is eager
+00084 double FunDef::eval(const SymVec& args, const vector<double>& inputs) const {
+00085     vector<double> values(args.size());
+00086     for (unsigned i = 0; i < args.size(); ++i) {
+00087         values[i] = ::eval(args[i], inputs);
+00088     }
+00089 
+00090     return eval(values, inputs);
+00091 }
+00092 
+00093 /* Variable Handling */
+00094 FunDef* make_var(int idx); // defined in FunDefs.h
+00095 static vector<token_t> var_token;
+00096 
+00097 Sym SymVar(unsigned idx) {
+00098     if (var_token.size() <= idx) {
+00099         // it is new
+00100         var_token.resize(idx+1, token_t(-1));
+00101         var_token[idx] = add_function( make_var(idx) );
+00102     } else if (var_token[idx] == token_t(-1)) {
+00103         var_token[idx] = add_function( make_var(idx) );
+00104     }
+00105     return Sym(var_token[idx]);
+00106 }
+00107 
+00108 
+00109 /* Constant Handling */
+00110 
+00111 struct HashDouble{
+00112     size_t operator()(double val) const {
+00113         unsigned long h = 0;
+00114         char* s = (char*)&val;
+00115         for (unsigned i=0 ; i<sizeof(double); ++i)
+00116             h = 5*h + s[i];
+00117         return size_t(h);
+00118     }
+00119 };
+00120 
+00121 #if USE_TR1
+00122 typedef std::tr1::unordered_map<double, token_t> DoubleSet;
+00123 typedef std::tr1::unordered_map<Sym, token_t>    LambdaSet;
+00124 #else
+00125 typedef hash_map<double, token_t, HashDouble> DoubleSet;
+00126 typedef hash_map<Sym, token_t, HashSym> LambdaSet;
+00127 #endif
+00128 
+00129 static DoubleSet doubleSet; // for quick checking if a constant already exists
+00130 static vector<double> token_value;
+00131 
+00132 static LambdaSet lambdaSet;
+00133 static vector<Sym> token_lambda;
+00134 
+00135 static std::vector<token_t> free_list;
+00136 
+00137 void delete_val(token_t token) { // clean up the information about this value
+00138      
+00139     if (is_constant(token)) {
+00140         //cout << "Deleting constant token " << token << endl;
+00141         double value = token_value[token];
+00142         doubleSet.erase(value);
+00143         
+00144         delete language[token];
+00145         language[token] = 0;
+00146         free_list.push_back(token);
+00147     }
+00148     else if (is_lambda(token)) {
+00149         //cout << "Deleting lambda token " << token << endl;
+00150         
+00151         Sym expression = token_lambda[token];
+00152         lambdaSet.erase(expression);
+00153         
+00154         delete language[token];
+00155         language[token] = 0;
+00156         free_list.push_back(token);
+00157     }
+00158 }
+00159 
+00160 
+00161 FunDef* make_const(double value);
+00162 
+00163 void extend_free_list();
+00164 
+00165 Sym SymConst(double value) { 
+00166    
+00167     DoubleSet::iterator it = doubleSet.find(value);
+00168     
+00169     if (it != doubleSet.end()) {
+00170         return Sym(it->second); // already exists
+00171     }
+00172        
+00173     
+00174     if (free_list.empty()) { // make space for tokens;
+00175         extend_free_list();
+00176     }
+00177 
+00178     token_t token = free_list.back();
+00179     free_list.pop_back();
+00180     //cout << "Creating constant with token " << token << endl; 
+00181     assert(language[token] == 0);
+00182     
+00183     language[token] = make_const(value);
+00184     
+00185     doubleSet[value] = token;
+00186     if (token_value.size() < token) token_value.resize(token+1);
+00187     token_value[token] = value;
+00188     
+00189     return Sym(token);
+00190 }
+00191 
+00192 /* LanguageTable depends on this one, XXX move somewhere safe.*/
+00193 #include <utils/eoRNG.h>
+00194 extern Sym default_const() { return SymConst(rng.normal()); }
+00195 
+00196 /* The functions */
+00197 namespace {
+00198 
+00199 class Var : public FunDef {
+00200     public :
+00201         unsigned idx;
+00202         string default_str;
+00203 
+00204         Var(unsigned _idx) : idx(_idx) {
+00205             ostringstream os;
+00206             os << "x[" << idx << ']'; // CompiledCode expects this form
+00207             default_str = os.str();
+00208         }
+00209         
+00210         double eval(const vector<double>& _, const vector<double>& inputs) const { return inputs[idx]; }
+00211         double eval(const SymVec& _, const vector<double>& inputs) const { return inputs[idx]; }
+00212         string c_print(const vector<string>& _, const vector<string>& names) const { 
+00213             if (names.empty()) {
+00214                 return default_str;
+00215             }
+00216             return names[idx]; 
+00217         }
+00218 
+00219         Interval eval(const vector<Interval>& _, const vector<Interval>& inputs) const { 
+00220             return inputs[idx]; 
+00221         }
+00222         
+00223         unsigned min_arity() const { return 0; }
+00224 
+00225         string name() const { return "var"; }
+00226         
+00227 };
+00228 
+00229 class Const : public FunDef {
+00230     public:
+00231         double value;
+00232         string value_str;
+00233         
+00234         Const(double _value) : value(_value) {
+00235             ostringstream os;
+00236             os.precision(17);
+00237             os.setf(ios::showpoint);
+00238             os << '(' << value << ')';
+00239             value_str = os.str();       
+00240         }
+00241 
+00242 
+00243         double eval(const vector<double>& _, const vector<double>& inputs) const { return value; }
+00244         double eval(const SymVec& _, const vector<double>& inputs) const { return value; }
+00245         string c_print(const vector<string>& _, const vector<string>& names) const { 
+00246             return value_str; 
+00247         }
+00248         
+00249         Interval eval(const vector<Interval>& _, const vector<Interval>& inputs) const { 
+00250             // Profil/Bias seems to have a problem with 0 * inf when the Interval is exact zero (fpe)
+00251             //if (value == 0.0) return Interval(-BiasEpsilon,BiasEpsilon);
+00252             return Interval(value); 
+00253         }
+00254 
+00255         unsigned min_arity() const { return 0; }
+00256 
+00257         string name() const { return "parameter"; }
+00258 };
+00259 
+00260 } // namespace 
+00261     
+00262 void get_constants(Sym sym, vector<double>& ret) {
+00263     token_t token = sym.token();
+00264     if (is_constant(token)) {
+00265         double val = static_cast<const Const*>(language[token])->value;
+00266         ret.push_back(val);
+00267     }
+00268 
+00269     const SymVec& args = sym.args();
+00270     for (unsigned i = 0; i < args.size(); ++i) {
+00271          get_constants(args[i], ret);
+00272     }
+00273     
+00274 }
+00275 
+00276 double get_constant_value(token_t token) {
+00277     return static_cast<const Const*>(language[token])->value;
+00278 }
+00279 
+00281 vector<double> get_constants(Sym sym) {
+00282     vector<double> retval;
+00283     get_constants(sym, retval);
+00284     return retval;
+00285 }
+00286 
+00289 Sym set_constants(Sym sym, vector<double>::const_iterator& it) {
+00290     
+00291     token_t token = sym.token();
+00292     if (is_constant(token)) {
+00293         return SymConst(*it++);
+00294     }
+00295 
+00296     SymVec args = sym.args();
+00297     for (unsigned i = 0; i < args.size(); ++i) {
+00298          args[i] = set_constants(args[i], it);
+00299     }
+00300     
+00301     return Sym(token, args);
+00302 }
+00303 
+00304 Sym set_constants(Sym sym, const vector<double>& constants) {
+00305     vector<double>::const_iterator it = constants.begin();
+00306     return set_constants(sym, it);
+00307 }
+00308 
+00309 // Get functions out, excluding Const and Var
+00310 vector<const FunDef*> get_defined_functions() {
+00311     vector<const FunDef*> res;
+00312     for (unsigned i = 0; i < language.size(); ++i) {
+00313         res.push_back(language[i]);
+00314 
+00315         if (is_constant(i) || is_variable(i)) {
+00316             res.back() = 0; // erase
+00317         }
+00318     }
+00319 
+00320     return res;
+00321 }
+00322 
+00323 FunDef* make_var(int idx) { return new Var(idx); }
+00324 FunDef* make_const(double value) { return new Const(value); }
+00325 
+00326 bool is_constant(token_t token) {
+00327     const Const* cnst = dynamic_cast<const Const*>( language[token] );
+00328     return cnst != 0;
+00329 }
+00330 
+00331 bool is_variable(token_t token) {
+00332     const Var* var = dynamic_cast<const Var*>( language[token] );
+00333     return var != 0;
+00334 }
+00335 
+00336 unsigned get_variable_index(token_t token) {
+00337     const Var* var = static_cast<const Var*>( language[token] );
+00338     return var->idx;
+00339 }
+00340 
+00341 namespace {
+00342 class Lambda : public FunDef {
+00343     public:
+00344         Sym expression;
+00345         int arity;
+00346     
+00347         Lambda(Sym expr, int arity_) : expression(expr), arity(arity_) {}
+00348         
+00349         double eval(const vector<double>& vals, const vector<double>& _) const {
+00350             return ::eval(expression, vals); 
+00351         }
+00352         
+00353         string c_print(const vector<string>& args, const vector<string>& _) const {
+00354             return string("/*f*/") + ::c_print(expression, args) + string("/*eof*/");
+00355         }
+00356         
+00357         Interval eval(const vector<Interval>& args, const vector<Interval>& _) const { 
+00358             return ::eval(expression, args);
+00359         }
+00360 
+00361         unsigned min_arity() const { return arity; }
+00362         string name() const { return "F"; }
+00363         
+00364 };
+00365     Sym normalize(Sym sym, SymVec& args) {
+00366         // check if it's a variable
+00367         token_t token = sym.token();
+00368         const Var* var = dynamic_cast< const Var*>(language[token]);
+00369     
+00370         if (var != 0) {
+00371             for (unsigned i = 0; i < args.size(); ++i) {
+00372                 if (sym == args[i]) {
+00373                     return SymVar(i); // replace with reference to arg
+00374                 }
+00375             }
+00376 
+00377             // not replaced, add it
+00378             args.push_back(sym);
+00379             return SymVar(args.size()-1);
+00380             
+00381         }
+00382         
+00383         SymVec a = sym.args();
+00384         for (unsigned i = 0; i < a.size(); ++i) {
+00385             a[i] = normalize(a[i], args);
+00386         }
+00387         
+00388         return Sym(token, a);
+00389     }
+00390 }
+00391 
+00392 bool is_lambda(token_t token) {
+00393     const Lambda* lambda = dynamic_cast<const Lambda*>( language[token]); 
+00394     return lambda != 0;
+00395 }
+00396 
+00397 std::ostream& print_list(Sym sym, ostream& os) {
+00398     os << sym.token() << ' ';
+00399     
+00400     const SymVec& args = sym.args();
+00401     for (unsigned i = 0; i < args.size(); ++i) {
+00402         print_list(args[i], os);
+00403     }
+00404     return os;
+00405 }
+00406 
+00407 token_t new_lambda(Sym sym, int arity) {
+00408     // check if already present
+00409 
+00410     LambdaSet::iterator it = lambdaSet.find(sym);
+00411     if (it != lambdaSet.end()) {
+00412         return it->second;
+00413     }
+00414 
+00415     
+00416     // new, insert
+00417     Lambda* lambda = new Lambda(sym, arity);
+00418 
+00419     if (free_list.empty()) {
+00420         extend_free_list();
+00421     }
+00422     
+00423     token_t token = free_list.back();
+00424     free_list.pop_back();
+00425     language[token] = lambda;
+00426     
+00427     lambdaSet[sym] = token;
+00428     if (token_lambda.size() <= token) token_lambda.resize(token+1);
+00429     token_lambda[token] = sym;
+00430     
+00431     return token;
+00432 }
+00433 
+00434 /* Compression */
+00435 typedef hash_map<Sym, unsigned, HashSym> OccMap;
+00436 
+00437 void count_occurances(Sym sym, OccMap& occ) {
+00438     occ[sym]++;
+00439     const SymVec& args = sym.args();
+00440     for (unsigned i = 0; i < args.size(); ++i) {
+00441         count_occurances(args[i], occ);
+00442     }
+00443 }
+00444 
+00445 Sym create_lambda(Sym sym, OccMap& occ, unsigned nvars, vector<Sym>& args) {
+00446     unsigned o = occ[sym];
+00447     unsigned sz = sym.size();
+00448 
+00449     if (o * sz > o + sz + nvars || is_variable(sym.token()) ) {
+00450         // check if it's already present
+00451         for (unsigned i = 0; i < args.size(); ++i) {
+00452             if (args[i] == sym) {
+00453                 return SymVar(i);
+00454             }
+00455         }
+00456         // push_back
+00457         args.push_back(sym);
+00458         return SymVar(args.size()-1);
+00459     }
+00460     
+00461     SymVec sym_args = sym.args();
+00462     for (unsigned i = 0; i < sym_args.size(); ++i) {
+00463         sym_args[i] = create_lambda(sym_args[i], occ, nvars, args);
+00464     }
+00465 
+00466     return Sym(sym.token(), sym_args);
+00467     
+00468 }
+00469 
+00470 Sym compress(Sym sym) { 
+00471     OccMap occ(sym.size());
+00472     count_occurances(sym, occ);
+00473 
+00474     unsigned nvars = 0;
+00475     for (OccMap::iterator it = occ.begin(); it != occ.end(); ++it) {
+00476         if (is_variable(it->first.token())) nvars++;
+00477     }
+00478     
+00479     SymVec args;
+00480     Sym body = create_lambda(sym, occ, nvars, args);
+00481     
+00482     
+00483     if (body.size() < sym.size()) {
+00484         // see if the body can be compressed some more
+00485         body = compress(body);
+00486                 
+00487         token_t token = new_lambda(body, args.size());
+00488         
+00489         for (unsigned i = 0; i < args.size(); ++i) {
+00490             args[i] = compress(args[i]);
+00491         }
+00492 
+00493         Sym result = Sym(token, args);
+00494         return compress(result); // see if it can be compressed some more
+00495     }
+00496     
+00497     return sym; 
+00498 }
+00499 
+00500 Sym SymLambda(Sym expr) { return compress(expr); }
+00501 
+00502 Sym expand(Sym expr, const SymVec& args) {
+00503     
+00504     const Var* var = dynamic_cast<const Var*>( language[expr.token()] );
+00505     if (var != 0) {
+00506         return args[var->idx];
+00507     }
+00508 
+00509     SymVec expr_args = expr.args();
+00510     for (unsigned i = 0; i < expr_args.size(); ++i) {
+00511         expr_args[i] = expand(expr_args[i], args);
+00512     }
+00513     
+00514     return Sym(expr.token(), expr_args);
+00515 }
+00516 
+00517 Sym SymUnlambda(Sym sym) {
+00518     Sym retval = sym;
+00519     const Lambda* lambda = dynamic_cast<const Lambda*>( language[sym.token()] );
+00520     if (lambda != 0) {
+00521         retval = expand(lambda->expression, sym.args());
+00522     }
+00523 
+00524     return retval;
+00525 }
+00526 
+00527 Sym expand_all(Sym sym) {
+00528     SymVec args = sym.args();
+00529     for (unsigned i = 0; i < args.size(); ++i) {
+00530         args[i] = expand_all(args[i]);
+00531     }
+00532     
+00533     Sym nw = SymUnlambda( Sym(sym.token(), args) ); 
+00534     
+00535     if (nw != sym) {
+00536         nw = expand_all(nw);
+00537     }
+00538     
+00539     return nw;
+00540 }
+00541 
+00542 namespace {
+00543 
+00544 class Sum : public FunDef {
+00545 
+00546     public :
+00547         
+00548         double eval(const vector<double>& vals, const vector<double>& _) const { 
+00549             double res = 0;
+00550             for (unsigned i = 0; i < vals.size(); ++i) res += vals[i];
+00551             return res;
+00552         }
+00553         
+00554         string c_print(const vector<string>& args, const vector<string>& _) const { 
+00555             if (args.empty()) { return "0.0"; }
+00556             
+00557             ostringstream os;
+00558             os << "(" << args[0];
+00559             for (unsigned i = 1; i < args.size(); ++i) {
+00560                 os << "+" << args[i];
+00561             }
+00562             os << ")";
+00563             return os.str();
+00564         }
+00565         
+00566         Interval eval(const vector<Interval>& args, const vector<Interval>& inputs) const { 
+00567             Interval interv(0.0); 
+00568             for (unsigned i = 0; i < args.size(); ++i) {
+00569                 interv += args[i];
+00570             }
+00571             return interv;
+00572         }
+00573 
+00574         unsigned min_arity() const { return 0; }
+00575         bool has_varargs() const { return true; }
+00576 
+00577         string name() const { return "sum"; }
+00578 };
+00579 
+00580 
+00581 class Prod : public FunDef {
+00582 
+00583     public :
+00584         
+00585         double eval(const vector<double>& vals, const vector<double>& _) const { 
+00586             double res = 1;
+00587             for (unsigned i = 0; i < vals.size(); ++i) res *= vals[i];
+00588             return res;
+00589         }
+00590         
+00591         string c_print(const vector<string>& args, const vector<string>& _) const { 
+00592             if (args.empty()) { return "1.0"; }
+00593             
+00594             ostringstream os;
+00595             os << "(" << args[0];
+00596             for (unsigned i = 1; i < args.size(); ++i) {
+00597                 os << "*" << args[i];
+00598             }
+00599             os << ")"; 
+00600 
+00601             return os.str();
+00602         }
+00603         
+00604         Interval eval(const vector<Interval>& args, const vector<Interval>& inputs) const { 
+00605             Interval interv(1.0);
+00606             for (unsigned i = 0; i < args.size(); ++i) {
+00607                 interv *= args[i];
+00608             }
+00609             return interv;
+00610         }
+00611 
+00612         unsigned min_arity() const { return 0; }
+00613         bool has_varargs() const { return true; }
+00614 
+00615         string name() const { return "prod"; }
+00616 };
+00617 
+00618 
+00619 class Power : public FunDef {
+00620     public :
+00621         double eval(const vector<double>& vals, const vector<double>& _) const {
+00622             return pow(vals[0], vals[1]);
+00623         }
+00624 
+00625         string c_print(const vector<string>& args, const vector<string>& _) const {
+00626             return "pow(" + args[0] + ',' + args[1] + ')';
+00627         }
+00628 
+00629         Interval eval(const vector<Interval>& args, const vector<Interval>& _) const {
+00630             Interval first = args[0];
+00631             Interval second = args[1];
+00632             Interval lg = log(first);
+00633             if (!valid(lg)) throw interval_error();
+00634             return exp(second * lg); 
+00635         }
+00636 
+00637         unsigned min_arity() const { return 2; }
+00638 
+00639         string name() const { return "pow"; }
+00640 };
+00641 
+00642 class IsNeg : public FunDef {
+00643 
+00644     public:
+00645         double eval(const vector<double>& vals, const vector<double>& _) const {
+00646             if (vals[0] < 0.0) return vals[1];
+00647             return vals[2];
+00648         }
+00649 
+00650         double eval(const Sym& sym, const vector<double>& inputs) const {
+00651             const SymVec& args = sym.args();
+00652             double arg0 = ::eval(args[0], inputs);
+00653             if (arg0 < 0.0) {
+00654                 return ::eval(args[1], inputs);
+00655             }
+00656             return ::eval(args[2], inputs);
+00657         }
+00658 
+00659         string c_print(const vector<string>& args, const vector<string>& _) const {
+00660             return "((" + args[0] + "<0.0)?" + args[1] + ":" + args[2]+")";
+00661         }
+00662         
+00663         Interval eval(const vector<Interval>& args, const vector<Interval>& _) const {
+00664             Interval a0 = args[0];
+00665             if (a0.upper() < 0.0) return args[1]; 
+00666             if (a0.lower() >= 0.0) return args[2];
+00667 
+00668             return Interval( std::min(args[1].lower(), args[2].lower()), std::max(args[1].upper(), args[2].upper()));
+00669         }
+00670 
+00671         unsigned min_arity() const { return 3; }
+00672 
+00673         string name() const { return "ifltz"; }
+00674 };
+00675 
+00676 template <typename Func>
+00677 class Unary : public FunDef {
+00678     
+00679     Func un;
+00680     
+00681     double eval(const vector<double>& vals, const vector<double>& _) const { 
+00682         return un(vals[0]);     
+00683     }
+00684 
+00685     string c_print(const vector<string>& args, const vector<string>& _) const { 
+00686         return un(args[0]);
+00687     }
+00688 
+00689     Interval eval(const vector<Interval>& args, const vector<Interval>& _) const {
+00690         return un(args[0]);
+00691     }
+00692     
+00693     unsigned min_arity() const { return 1; }
+00694 
+00695     string name() const { return un.name(); }
+00696     
+00697 };
+00698 
+00699 struct Inv {
+00700     double operator()(double val) const { return 1.0 / val; }
+00701     string operator()(string v)   const { return "(1./" + v + ")"; }
+00702     Interval operator()(Interval v) const { return 1.0 / v; }
+00703     
+00704     string name() const { return "inv"; }
+00705 };
+00706 
+00707 struct Min {
+00708     double operator()(double val) const { return -val; }
+00709     string operator()(string v) const   { return "(-" + v + ")"; }
+00710     Interval operator()(Interval v) const { return -v; }
+00711 
+00712     string name() const { return "min"; }
+00713 };
+00714 
+00715 } // namespace
+00716 
+00717 string prototypes = "double pow(double, double);";
+00718 string get_prototypes() { return prototypes; }
+00719 unsigned add_prototype(string str) { prototypes += string("double ") + str + "(double);"; return prototypes.size(); }
+00720 
+00721 token_t add_function(FunDef* function, token_t where) {
+00722     if (language.size() <= where) language.resize(where+1);
+00723     language[where] = function;
+00724     return 0;
+00725 }
+00726 
+00727 namespace {
+00728 
+00729 #define FUNCDEF(funcname) struct funcname##_struct { \
+00730     double operator()(double val) const { return funcname(val); }\
+00731     string operator()(string val) const  { return string(#funcname) + '(' + val + ')'; }\
+00732     Interval operator()(Interval val) const { return funcname(val); }\
+00733     string name() const { return string(#funcname); }\
+00734 };\
+00735 static const token_t funcname##_token_static = add_function( new Unary<funcname##_struct>, funcname##_token);\
+00736 unsigned funcname##_size = add_prototype(#funcname);
+00737 
+00738 static token_t ssum_token  = add_function( new Sum , sum_token);
+00739 static token_t sprod_token = add_function( new Prod, prod_token);
+00740 static token_t sinv_token  = add_function( new Unary<Inv>, inv_token);
+00741 static token_t smin_token  = add_function( new Unary<Min>, min_token);
+00742 static token_t spow_token  = add_function( new Power, pow_token);
+00743 static token_t sifltz_token = add_function( new IsNeg, ifltz_token);
+00744 
+00745 FUNCDEF(sin);
+00746 FUNCDEF(cos);
+00747 FUNCDEF(tan);
+00748 FUNCDEF(asin);
+00749 FUNCDEF(acos);
+00750 FUNCDEF(atan);
+00751 
+00752 FUNCDEF(sinh);
+00753 FUNCDEF(cosh);
+00754 FUNCDEF(tanh);
+00755 FUNCDEF(asinh);
+00756 FUNCDEF(acosh);
+00757 FUNCDEF(atanh);
+00758 
+00759 FUNCDEF(exp);
+00760 FUNCDEF(log);
+00761 } // namespace
+00762 
+00763 double sqr(double x) { return x*x; }
+00764 
+00765 namespace {
+00766 FUNCDEF(sqr);
+00767 FUNCDEF(sqrt);
+00768 
+00769 const int buildInFunctionOffset = language.size();
+00770 } // namespace 
+00771 
+00772 void add_tokens() {
+00773     unsigned sz = language.size();
+00774     language.resize(sz + sz+1); // double
+00775     
+00776     for (unsigned i = sz; i < language.size(); ++i) {
+00777        free_list.push_back(i); 
+00778     }
+00779 }
+00780 
+00781 void extend_free_list() {
+00782     // first check if we can clean up unused tokens;
+00783     const vector<unsigned>& refcount = Sym::token_refcount();
+00784     for (unsigned i = buildInFunctionOffset; i < refcount.size(); ++i) {
+00785         if (language[i] == 0) continue;
+00786         
+00787         bool c = is_constant(i);
+00788         bool l = is_lambda(i);
+00789         
+00790         if (refcount[i] == 0 && (c || l)) {
+00791             
+00792             if (c) {
+00793                 doubleSet.erase(token_value[i]);
+00794             }
+00795 
+00796             if (l) {
+00797                 lambdaSet.erase(token_lambda[i]);       
+00798             }
+00799             
+00800             delete language[i];
+00801             language[i] = 0;
+00802             free_list.push_back(i);
+00803         }
+00804     }
+00805 
+00806     // if still empty, add new tokens
+00807     if (free_list.empty()) {
+00808         add_tokens();
+00809     }
+00810 }
+00811 
+00812 
+00813 /* Serialization */
+00814 void write_raw(ostream& os, const Sym& sym) {
+00815     token_t token = sym.token();
+00816     const SymVec& args = sym.args();
+00817     
+00818     if (is_constant(token)) {
+00819         os << "c" << language[token]->c_print(vector<string>(), vector<string>()); 
+00820     } else {
+00821 
+00822         const Var* var = dynamic_cast<const Var*>( language[token] );
+00823         
+00824         if (var != 0) {
+00825             os << "v" << var->idx;
+00826         } else {
+00827             os << "f" << token << ' ' << args.size();
+00828         }
+00829     }
+00830 
+00831     for (unsigned i = 0; i < args.size(); ++i) {
+00832         write_raw(os, args[i]); 
+00833     }
+00834 }
+00835 
+00836 string write_raw(const Sym& sym) {
+00837     
+00838     ostringstream os;
+00839     write_raw(os, sym);
+00840     
+00841     return os.str();
+00842 }
+00843 
+00844 Sym read_raw(istream& is) {
+00845     char id = is.get();
+00846 
+00847     switch (id) {
+00848         case 'c' : 
+00849             {
+00850                 double val;
+00851                 is.get(); // skip '('
+00852                 is >> val;
+00853                 is.get(); // skip ')'
+00854                 return SymConst(val);
+00855             }
+00856         case 'v' : 
+00857             {
+00858                 unsigned idx;
+00859                 is >> idx;
+00860                 return SymVar(idx);
+00861             }
+00862         case 'f' :
+00863             {
+00864                 token_t token;
+00865                 unsigned arity;
+00866                 is >> token;
+00867                 is >> arity;
+00868                 SymVec args(arity);
+00869                 for (unsigned i = 0; i < arity; ++i) {
+00870                     args[i] = read_raw(is);
+00871                 }
+00872 
+00873                 return Sym(token, args);
+00874             }
+00875         default : {
+00876                       cerr << "Character = " << id << " Could not read formula from stream" << endl;
+00877                       exit(1);
+00878                   }
+00879                     
+00880     }
+00881 
+00882     return Sym();
+00883 }
+00884 
+00885 Sym read_raw(string str) {
+00886     istringstream is(str);
+00887     return read_raw(is);
+00888 }
+00889 
+00890 void read_raw(istream& is, Sym& sym) {
+00891     sym = read_raw(is);
+00892 }
+00893 
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_fun_def_8h-source.html b/trunk/paradiseo-eo/doc/html/_fun_def_8h-source.html new file mode 100644 index 000000000..64fe67c48 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_fun_def_8h-source.html @@ -0,0 +1,171 @@ + + +EO: FunDef.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / fun
+

FunDef.h

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #ifndef FUNCTION_DEF_H_
+00019 #define FUNCTION_DEF_H_
+00020 
+00021 #include <string>
+00022 #include <vector>
+00023 #include <memory>
+00024 #include <iostream>
+00025 
+00026 #include "Sym.h"
+00027 #include "Interval.h"
+00028 
+00029 class FunDef {
+00030     public:
+00031     
+00032     virtual ~FunDef() {}
+00033     
+00034     // (possibly) lazy evaluation function, default implementation calls 'eager' eval
+00035     virtual double eval(const SymVec&   args, const std::vector<double>& inputs) const;
+00036 
+00037     // eager evaluation function 
+00038     virtual double eval(const std::vector<double>& args, const std::vector<double>& inputs) const = 0;
+00039    
+00040     // interval evaluation
+00041     virtual Interval eval(const std::vector<Interval>& args, const std::vector<Interval>& inputs) const = 0; 
+00042     
+00043     // prints 'c' like code
+00044     virtual std::string c_print(const std::vector<std::string>&   names, const std::vector<std::string>& names) const = 0;
+00045 
+00046     virtual unsigned min_arity() const = 0;
+00047     virtual bool has_varargs() const { return false; } // sum, prod, min, max are variable arity
+00048 
+00049     virtual std::string name() const = 0;
+00050     
+00051     protected:
+00052     
+00053 };
+00054 
+00056 extern std::vector<const FunDef*> get_defined_functions();
+00057 
+00059 extern const FunDef& get_element(token_t token);
+00060 
+00062 extern double      eval(const Sym& sym, const std::vector<double>& inputs);
+00063 
+00065 extern Interval eval(const Sym& sym, const std::vector<Interval>& inputs);
+00066 
+00068 extern std::string c_print(const Sym& sym);
+00069 
+00071 extern std::string c_print(const Sym& sym, const std::vector<std::string>& var_names);
+00072 
+00074 inline std::ostream& operator<<(std::ostream& os, const Sym& sym) { return os << c_print(sym); }
+00075 
+00076 /* Support for Ephemeral Random Constants (ERC) */
+00077 
+00079 extern Sym SymConst(double value);
+00081 extern Sym SymVar(unsigned idx);
+00082 
+00093 extern Sym SymLambda(Sym expression);
+00094 
+00095 extern Sym SymUnlambda(Sym sym);
+00096 
+00098 extern Sym expand_all(Sym sym);
+00099 extern Sym compress(Sym sym);
+00100 
+00102 std::vector<double> get_constants(Sym sym);
+00103 
+00106 Sym set_constants(Sym sym, const std::vector<double>& constants);
+00107 
+00109 extern bool is_constant(token_t token);
+00110 extern double get_constant_value(token_t token);
+00112 extern bool is_variable(token_t token);
+00113 extern unsigned get_variable_index(token_t token);
+00114 
+00116 extern bool is_lambda(token_t token);
+00117 
+00118 
+00120 extern Sym simplify(Sym sym);
+00121 
+00125 extern Sym differentiate(Sym sym, token_t dx);
+00126 struct differentiation_error{}; // thrown in case of ifltz
+00127 
+00128 /* Add function to the language table (and take a guess at the arity) */
+00129 class LanguageTable;
+00130 extern void add_function_to_table(LanguageTable& table, token_t token);
+00131 
+00132 enum {
+00133     sum_token,
+00134     prod_token,
+00135     inv_token,
+00136     min_token,
+00137     pow_token,
+00138     ifltz_token,
+00139     sin_token, cos_token, tan_token,
+00140     asin_token, acos_token, atan_token,
+00141     sinh_token, cosh_token, tanh_token,
+00142     acosh_token, asinh_token, atanh_token,
+00143     exp_token, log_token,
+00144     sqr_token, sqrt_token
+00145 };
+00146 
+00147 /* Defition of function overloads: for example, this define the function 'Sym sin(Sym)' */
+00148 
+00149 #define HEADERFUNC(name) inline Sym name(Sym arg) { return Sym(name##_token, arg); }
+00150 
+00151 /* This defines the tokens: sin_token, cos_token, etc. */
+00152 HEADERFUNC(inv);
+00153 HEADERFUNC(sin);
+00154 HEADERFUNC(cos);
+00155 HEADERFUNC(tan);
+00156 HEADERFUNC(asin);
+00157 HEADERFUNC(acos);
+00158 HEADERFUNC(atan);
+00159 
+00160 HEADERFUNC(sinh);
+00161 HEADERFUNC(cosh);
+00162 HEADERFUNC(tanh);
+00163 HEADERFUNC(asinh);
+00164 HEADERFUNC(acosh);
+00165 HEADERFUNC(atanh);
+00166 
+00167 HEADERFUNC(exp);
+00168 HEADERFUNC(log);
+00169 
+00170 HEADERFUNC(sqr);
+00171 HEADERFUNC(sqrt);
+00172 
+00173 /* Get the prototype functions out, this is needed for compilation */
+00174 extern std::string get_prototypes();
+00175 
+00176 // reading and writing in internal format, no parser for symbolic functions implemented yet
+00177 extern std::string write_raw(const Sym& sym);
+00178 extern void write_raw(std::ostream& os, const Sym& sym);
+00179 extern Sym read_raw(std::string str);
+00180 extern Sym read_raw(std::istream& is); 
+00181 extern void read_raw(std::istream& is, Sym& sym); 
+00182 
+00183 #include "SymOps.h"
+00184 
+00185 #endif
+00186 
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_interval_8h-source.html b/trunk/paradiseo-eo/doc/html/_interval_8h-source.html new file mode 100644 index 000000000..027026c46 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_interval_8h-source.html @@ -0,0 +1,130 @@ + + +EO: Interval.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / eval
+

Interval.h

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #ifndef INTERVAL__H__
+00019 #define INTERVAL__H__
+00020 
+00021 #include <boost/numeric/interval.hpp>
+00022 #include <iostream>
+00023 #include <limits>
+00024 
+00025 
+00026 typedef boost::numeric::interval_lib::rounded_transc_exact<double> RoundingTransc;
+00027 typedef boost::numeric::interval_lib::save_state<RoundingTransc> Rounding;
+00028 typedef boost::numeric::interval_lib::checking_base<double> Checking;
+00029 typedef boost::numeric::interval_lib::policies<Rounding,Checking> Policy;
+00030 typedef boost::numeric::interval<double, Policy> Interval;
+00031 
+00032 struct interval_error{};
+00033 
+00034 inline bool valid(const Interval& val) {
+00035     if (!finite(val.lower()) || !finite(val.upper())) return false;
+00036     
+00037     return val.lower() > -1e10 && val.upper() < 1e10;
+00038 }
+00039 
+00040 inline Interval sqrt(const Interval& val) {
+00041     if (val.lower() < 0.0) {
+00042         return Interval::whole();
+00043     }
+00044 
+00045     return boost::numeric::sqrt(val);
+00046 }
+00047 
+00048 inline Interval sqr(const Interval& val) {
+00049     return square(val);
+00050 }
+00051 
+00052 inline Interval acos(const Interval& val) {
+00053     if (val.lower() < 1.0 || val.upper() > 1.0) {
+00054         return Interval::whole();
+00055     }
+00056 
+00057     return boost::numeric::acos(val);
+00058 }
+00059 
+00060 inline Interval asin(const Interval& val) {
+00061     if (val.lower() < 1.0 || val.upper() > 1.0) {
+00062         return Interval::whole();
+00063     }
+00064 
+00065     return boost::numeric::asin(val);
+00066 }
+00067 
+00068 inline Interval acosh(const Interval& val) {
+00069     if (val.lower() < 1.0) return Interval::whole();
+00070     return boost::numeric::acosh(val);
+00071 }
+00072 
+00073 inline
+00074 std::ostream& operator<<(std::ostream& os, const Interval& val) {
+00075         os << '[' << val.lower() << ", " << val.upper() << ']';
+00076             return os;
+00077 }
+00078 
+00079 #ifdef TEST_INTERVAL
+00080 using namespace std;
+00081 using namespace boost::numeric;
+00082 
+00083 int main() {
+00084     Interval a(0, 10);
+00085     Interval b(-1.5, 2);
+00086     cout << "a       = " << a << endl;
+00087     cout << "b       = " << b << endl;
+00088     cout << "a + b   = " << a + b << endl;
+00089     cout << "a - b   = " << a - b << endl;
+00090     cout << "b - a   = " << b - a << endl;
+00091     cout << "-a      = " << -a << endl;
+00092     cout << "a * b   = " << a * b << endl;
+00093     cout << "b/(a+1) = " << b / (a + 1.0) << endl;
+00094     cout << "b * a   = " << b * a << endl;
+00095 
+00096     cout << "b / a   = " << b/a << endl;
+00097     
+00098     cout << "cos(a)  = " << cos(a) << endl;
+00099     cout << "cos(b)  = " << cos(b) << endl;
+00100    
+00101     cout << "log(b)  = " << log(b) << endl;
+00102     
+00103     cout << "sqrt(b) = " << sqrt(b) << endl;
+00104     cout << "sqrt(a) = " << sqrt(a) << endl;
+00105     cout << "sqr(b)  = " << sqr(b) << endl;
+00106    
+00107     cout << "exp(b*a)= " << exp(b*a) << endl;
+00108    
+00109     cout << "atan(a) = " << atan(a) << endl;
+00110     cout << "cosh(b) = " << cosh(b) << endl;
+00111     
+00112 }
+00113 #endif
+00114 
+00115 #endif
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_language_table_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_language_table_8cpp-source.html new file mode 100644 index 000000000..df0234067 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_language_table_8cpp-source.html @@ -0,0 +1,113 @@ + + +EO: LanguageTable.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / gen
+

LanguageTable.cpp

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 
+00019 #include "LanguageTable.h"
+00020 #include "Sym.h"
+00021 
+00022 #include <utils/eoRNG.h>
+00023 
+00024 using namespace std;
+00025 
+00026 extern Sym default_const();
+00027 
+00028 class LanguageImpl {
+00029     public :
+00030     std::vector<Sym> vars;
+00031     LanguageTable::erc_func erc;
+00032     
+00033     std::vector<functor_t> functions;
+00034     std::vector< std::vector<token_t> > functions_per_arity;
+00035 
+00036     LanguageImpl() : erc(default_const) {}
+00037 };
+00038 
+00039 LanguageTable::LanguageTable() {
+00040     pimpl = new LanguageImpl;
+00041 }
+00042 
+00043 LanguageTable::~LanguageTable() {
+00044     delete pimpl; 
+00045 }
+00046 
+00047 LanguageTable::LanguageTable(const LanguageTable& that) {
+00048     pimpl = new LanguageImpl(*that.pimpl);
+00049 }
+00050 
+00051 LanguageTable& LanguageTable::operator=(const LanguageTable& that) {
+00052     *pimpl = *that.pimpl;
+00053     return *this;
+00054 }
+00055 
+00056 void LanguageTable::add_function(token_t token, unsigned arity) {
+00057     functor_t f = {token, arity};
+00058     add_function( f );
+00059 }
+00060 
+00061 void LanguageTable::add_function(functor_t f) {
+00062      
+00063     if (f.arity > 0) {
+00064         pimpl->functions.push_back(f);
+00065         
+00066     } else {
+00067         pimpl->vars.push_back(Sym(f.token));
+00068     }
+00069     
+00070     if (pimpl->functions_per_arity.size() <= f.arity) pimpl->functions_per_arity.resize(f.arity+1);
+00071     pimpl->functions_per_arity[f.arity].push_back(f.token);
+00072     
+00073 }
+00074 
+00075 void LanguageTable::set_erc( erc_func func) { pimpl->erc = func; }
+00076 
+00077 /* Getting info out */
+00078 
+00079 extern Sym SymConst(double val);
+00080 
+00081 Sym LanguageTable::get_random_var()   const         { return rng.choice(pimpl->vars); }
+00082 Sym LanguageTable::get_random_const() const         { return pimpl->erc(); }
+00083 
+00084 functor_t LanguageTable::get_random_function() const 
+00085 { 
+00086     return rng.choice(pimpl->functions); 
+00087 }
+00088 
+00089 token_t LanguageTable::get_random_function(token_t token, unsigned arity) const 
+00090 { 
+00091     if (pimpl->functions_per_arity.size() <= arity || pimpl->functions_per_arity[arity].empty()) {
+00092         return token; // return original token if no functions of this arity are found
+00093     }
+00094     return rng.choice(pimpl->functions_per_arity[arity]); 
+00095 }
+00096 
+00097 
+00098 
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_language_table_8h-source.html b/trunk/paradiseo-eo/doc/html/_language_table_8h-source.html new file mode 100644 index 000000000..365906cde --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_language_table_8h-source.html @@ -0,0 +1,71 @@ + + +EO: LanguageTable.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / gen
+

LanguageTable.h

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #ifndef LANGUAGE_TABLE_H
+00019 #define LANGUAGE_TABLE_H
+00020 
+00021 #include "token.h"
+00022 
+00023 class LanguageImpl;
+00024 class Sym;
+00025 
+00026 class LanguageTable {
+00027     
+00028     LanguageImpl* pimpl;
+00029 
+00030     public:
+00031     
+00032     LanguageTable();
+00033     ~LanguageTable();
+00034 
+00035     LanguageTable(const LanguageTable& org);
+00036 
+00037     LanguageTable& operator=(const LanguageTable& org);
+00038     
+00039     /* setting it up */
+00040     typedef Sym (*erc_func)();
+00041     
+00042     void add_function(token_t token, unsigned arity);
+00043     void add_function(functor_t functor); 
+00044     void set_erc(erc_func func);
+00045     
+00046     /* Getting info out */
+00047     
+00048     Sym get_random_var() const;
+00049     Sym get_random_const() const;
+00050     
+00051     functor_t get_random_function() const;
+00052     token_t  get_random_function(token_t org, unsigned arity) const;
+00053 };
+00054 
+00055 #endif
+00056 
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_multi_funcs_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_multi_funcs_8cpp-source.html new file mode 100644 index 000000000..126ba23b8 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_multi_funcs_8cpp-source.html @@ -0,0 +1,41 @@ + + +EO: MultiFuncs.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / eval
+

MultiFuncs.cpp

00001 
+00002 namespace multi_function {
+00003     
+00004 double plus(arg_ptr args) {
+00005     return *args[0] + *args[1];
+00006 }
+00007 
+00008 double mult(arg_ptr args) {
+00009     return *args[0] * *args[1];
+00010 }
+00011 
+00012 double min(arg_ptr args) {
+00013     return -**args;
+00014 }
+00015 
+00016 double inv(arg_ptr args) {
+00017     return 1 / **args;
+00018 }   
+00019 
+00020 //template <typename f> class F { public: double operator()(double a) { return f(a); } };
+00021 
+00022 double exp(arg_ptr args) {
+00023     return ::exp(**args);
+00024 }
+00025 
+00026 } // namespace
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_multi_function_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_multi_function_8cpp-source.html new file mode 100644 index 000000000..c1e16356a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_multi_function_8cpp-source.html @@ -0,0 +1,356 @@ + + +EO: MultiFunction.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / eval
+

MultiFunction.cpp

00001 #include <vector.h>
+00002 
+00003 
+00004 #include "MultiFunction.h"
+00005 #include "Sym.h"
+00006 #include "FunDef.h"
+00007 
+00008 using namespace std;
+00009 
+00010 
+00011 typedef vector<double>::const_iterator data_ptr;
+00012 typedef vector<data_ptr> data_ptrs;
+00013 typedef data_ptrs::const_iterator arg_ptr;
+00014 
+00015 #include "MultiFuncs.cpp"
+00016 
+00017 typedef double (*fptr)( arg_ptr );
+00018 
+00019 string print_function( fptr f) {
+00020     if (f == multi_function::plus) return "+";
+00021     if (f == multi_function::mult) return "*";
+00022     if (f == multi_function::min) return "-";
+00023     if (f == multi_function::inv) return "/";
+00024     if (f == multi_function::exp) return "e";
+00025     return "unknown";
+00026 }
+00027 
+00028 
+00029 struct Function {
+00030     
+00031     fptr function;
+00032     arg_ptr args;
+00033 
+00034     double operator()() const { return function(args); }
+00035 };
+00036 
+00037 static vector<Function> token_2_function;
+00038 
+00039 Sym make_binary(Sym sym) {
+00040     if (sym.args().size() == 2) return sym;
+00041     SymVec args = sym.args();
+00042     Sym an = args.back();
+00043     args.pop_back();
+00044     Sym nw = make_binary( Sym( sym.token(), args) );
+00045     args.resize(2);
+00046     args[0] = nw;
+00047     args[1] = an;
+00048     return Sym(sym.token(), args); 
+00049 }
+00050 
+00051 class Compiler {
+00052     
+00053     public:
+00054 
+00055     enum func_type {constant, variable, function};
+00056     
+00057     typedef pair<func_type, unsigned> entry;
+00058 
+00059 #if USE_TR1
+00060             typedef std::tr1::unordered_map<Sym, entry, HashSym> HashMap;
+00061 #else
+00062             typedef hash_map<Sym, entry, HashSym> HashMap;
+00063 #endif      
+00064    
+00065     HashMap map;
+00066    
+00067     vector<double> constants;
+00068     vector<unsigned> variables;
+00069     vector< fptr > functions;
+00070     vector< vector<entry> > function_args;
+00071     
+00072     unsigned total_args;
+00073     
+00074     vector<entry> outputs;
+00075    
+00076     Compiler() : total_args(0) {}
+00077     
+00078     entry do_add(Sym sym) {
+00079 
+00080         HashMap::iterator it = map.find(sym);
+00081 
+00082         if (it == map.end()) { // new entry
+00083             
+00084             token_t token = sym.token();
+00085 
+00086             if (is_constant(token)) {
+00087                 constants.push_back( get_constant_value(token) ); // set value
+00088                 entry e = make_pair(constant, constants.size()-1);
+00089                 map.insert( make_pair(sym, e) );
+00090                 return e;
+00091                 
+00092             } else if (is_variable(token)) {
+00093                 unsigned idx = get_variable_index(token);
+00094                 variables.push_back(idx);
+00095                 entry e = make_pair(variable, variables.size()-1);
+00096                 map.insert( make_pair(sym, e) );
+00097                 return e;
+00098             } // else 
+00099                 
+00100             fptr f;
+00101             vector<entry> vec;
+00102             const SymVec& args = sym.args();
+00103             
+00104             switch (token) {
+00105                 case sum_token:
+00106                     {
+00107                         if (args.size() == 0) {
+00108                             return do_add( SymConst(0.0));
+00109                         }
+00110                         if (args.size() == 1) {
+00111                             return do_add(args[0]);
+00112                         }
+00113                         if (args.size() == 2) {
+00114                             vec.push_back(do_add(args[0]));
+00115                             vec.push_back(do_add(args[1]));
+00116                             f = multi_function::plus;
+00117                             //cout << "Adding + " << vec[0].second << ' ' << vec[1].second << endl;
+00118                             break;
+00119 
+00120                         } else {
+00121                             return do_add( make_binary(sym) );
+00122                         }
+00123                         
+00124                     }
+00125                 case prod_token:
+00126                     {
+00127                         if (args.size() == 0) {
+00128                             return do_add( SymConst(1.0));
+00129                         }
+00130                         if (args.size() == 1) {
+00131                             return do_add(args[0]);
+00132                         }
+00133                         if (args.size() == 2) {
+00134                             vec.push_back(do_add(args[0]));
+00135                             vec.push_back(do_add(args[1]));
+00136                             f = multi_function::mult;
+00137                             //cout << "Adding * " << vec[0].second << ' ' << vec[1].second << endl;
+00138                             break;
+00139                             
+00140 
+00141                         } else {
+00142                             return do_add( make_binary(sym) );
+00143                         }
+00144                     }
+00145                 case sqr_token: 
+00146                     {
+00147                         SymVec newargs(2);
+00148                         newargs[0] = args[0];
+00149                         newargs[1] = args[0];
+00150                        return do_add( Sym(prod_token, newargs)); 
+00151                     }
+00152                 default :
+00153                     {
+00154                         if (args.size() != 1) {
+00155                             cerr << "Unknown function " << sym << " encountered" << endl;
+00156                             exit(1);
+00157                         }
+00158                         
+00159                         vec.push_back(do_add(args[0]));
+00160 
+00161                         switch (token) {
+00162                             case min_token: f = multi_function::min; break;
+00163                             case inv_token: f = multi_function::inv; break;
+00164                             case exp_token :f = multi_function::exp; break;
+00165                             default :
+00166                                 {
+00167                                     cerr << "Unimplemented token encountered " << sym << endl;
+00168                                     exit(1);
+00169                                 }
+00170                         }
+00171                         
+00172                         //cout << "Adding " << print_function(f) << ' ' << vec[0].second << endl;
+00173                         
+00174                         
+00175                     }
+00176 
+00177             }
+00178             
+00179             total_args += vec.size();
+00180             function_args.push_back(vec);
+00181             functions.push_back(f);
+00182             
+00183             entry e = make_pair(function, functions.size()-1);
+00184             map.insert( make_pair(sym, e) );
+00185             return e;
+00186             
+00187         }
+00188         
+00189         return it->second; // entry
+00190     }
+00191    
+00192     void add(Sym sym) {
+00193         entry e = do_add(sym);
+00194         outputs.push_back(e);
+00195     }
+00196     
+00197 };
+00198 
+00199 class MultiFunctionImpl {
+00200     public:
+00201         
+00202     // input mapping
+00203     vector<unsigned> input_idx;
+00204     
+00205     unsigned constant_offset;
+00206     unsigned var_offset;
+00207 
+00208     // evaluation
+00209     vector<double> data;
+00210     vector<Function> funcs;
+00211     data_ptrs args;     
+00212     
+00213     vector<unsigned> output_idx;
+00214     
+00215     MultiFunctionImpl() {}
+00216 
+00217     void clear() {
+00218         input_idx.clear();
+00219         data.clear();
+00220         funcs.clear();
+00221         args.clear();
+00222         output_idx.clear();
+00223         constant_offset = 0;
+00224     }
+00225     
+00226     void eval(const double* x, double* y) {
+00227         unsigned i;
+00228         // evaluate variables
+00229         for (i = constant_offset; i < constant_offset + input_idx.size(); ++i) {
+00230             data[i] = x[input_idx[i-constant_offset]];
+00231         }
+00232 
+00233         for(; i < data.size(); ++i) {
+00234             data[i] = funcs[i-var_offset]();
+00235             //cout << i << " " << data[i] << endl;
+00236         }
+00237 
+00238         for (i = 0; i < output_idx.size(); ++i) {
+00239             y[i] = data[output_idx[i]];
+00240         }
+00241     }
+00242 
+00243     void eval(const vector<double>& x, vector<double>& y) {
+00244         eval(&x[0], &y[0]);
+00245     }
+00246     
+00247     void setup(const vector<Sym>& pop) {
+00248         
+00249         clear(); 
+00250         Compiler compiler;
+00251         
+00252         for (unsigned i = 0; i < pop.size(); ++i) {
+00253             Sym sym = (expand_all(pop[i]));
+00254             compiler.add(sym);
+00255         }
+00256         
+00257         // compiler is setup so get the data
+00258         constant_offset = compiler.constants.size();
+00259         var_offset = constant_offset + compiler.variables.size();
+00260         int n = var_offset + compiler.functions.size();
+00261 
+00262         data.resize(n);
+00263         funcs.resize(compiler.functions.size());
+00264         args.resize(compiler.total_args);
+00265         
+00266         // constants
+00267         for (unsigned i = 0; i < constant_offset; ++i) {
+00268             data[i] = compiler.constants[i];
+00269             //cout << i << ' ' << data[i] << endl;
+00270         }
+00271         
+00272         // variables
+00273         input_idx = compiler.variables;
+00274 
+00275         //for (unsigned i = constant_offset; i < var_offset; ++i) {
+00276             //cout << i << " x" << input_idx[i-constant_offset] << endl;
+00277         //}
+00278         
+00279         // functions
+00280         unsigned which_arg = 0;
+00281         for (unsigned i = 0; i < funcs.size(); ++i) {
+00282             
+00283             Function f;
+00284             f.function = compiler.functions[i];
+00285             
+00286             //cout << i+var_offset << ' ' << print_function(f.function);
+00287                 
+00288             // interpret args
+00289             for (unsigned j = 0; j < compiler.function_args[i].size(); ++j) {
+00290                 
+00291                 Compiler::entry e = compiler.function_args[i][j];
+00292                 
+00293                 unsigned idx = e.second;
+00294                 
+00295                 switch (e.first) {
+00296                     case Compiler::function: idx += compiler.variables.size();
+00297                     case Compiler::variable: idx += compiler.constants.size();
+00298                     case Compiler::constant: {}
+00299                 }
+00300 
+00301                 args[which_arg + j] = data.begin() + idx;
+00302                 //cout << ' ' << idx << "(" << e.second << ")";
+00303             }
+00304             
+00305             //cout << endl;
+00306 
+00307             f.args = args.begin() + which_arg;
+00308             which_arg += compiler.function_args[i].size();
+00309             funcs[i] = f;    
+00310         }
+00311 
+00312         // output indices
+00313         output_idx.resize(compiler.outputs.size());
+00314         for (unsigned i = 0; i < output_idx.size(); ++i) {
+00315             output_idx[i] = compiler.outputs[i].second;
+00316             switch(compiler.outputs[i].first) {
+00317                     case Compiler::function: output_idx[i] += compiler.variables.size();
+00318                     case Compiler::variable: output_idx[i] += compiler.constants.size();
+00319                     case Compiler::constant: {}
+00320             }
+00321             //cout << "out " << output_idx[i] << endl;
+00322         }
+00323     }
+00324     
+00325 };  
+00326 
+00327 
+00328 
+00329 MultiFunction::MultiFunction(const std::vector<Sym>& pop) : pimpl(new MultiFunctionImpl) {
+00330     pimpl->setup(pop);
+00331 }
+00332 
+00333 MultiFunction::~MultiFunction() { delete pimpl; }
+00334 
+00335 void MultiFunction::operator()(const std::vector<double>& x, std::vector<double>& y) {
+00336     pimpl->eval(x,y);
+00337 }
+00338 
+00339 void MultiFunction::operator()(const double* x, double* y) {
+00340     pimpl->eval(x,y);
+00341 }
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_multi_function_8h-source.html b/trunk/paradiseo-eo/doc/html/_multi_function_8h-source.html new file mode 100644 index 000000000..08942b731 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_multi_function_8h-source.html @@ -0,0 +1,41 @@ + + +EO: MultiFunction.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / eval
+

MultiFunction.h

00001 #ifndef MULTIFUNCTION_H_
+00002 #define MULTIFUNCTION_H_
+00003 
+00004 #include <vector>
+00005 
+00006 class Sym;
+00007 class MultiFunctionImpl;
+00008 
+00009 class MultiFunction {
+00010     MultiFunction& operator=(const MultiFunction&);
+00011     MultiFunction(const MultiFunction&);
+00012 
+00013     MultiFunctionImpl* pimpl;
+00014     
+00015     public:
+00016 
+00017     MultiFunction(const std::vector<Sym>& pop);
+00018     ~MultiFunction();
+00019     
+00020     void operator()(const std::vector<double>& x, std::vector<double>& y);
+00021     void operator()(const double* x, double* y);
+00022     
+00023 };
+00024 
+00025 #endif
+00026 
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_my_struct_e_a_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_my_struct_e_a_8cpp-source.html new file mode 100644 index 000000000..a0de6e349 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_my_struct_e_a_8cpp-source.html @@ -0,0 +1,181 @@ + + +EO: MyStructEA.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Templates
+

MyStructEA.cpp

00001 
+00006 /*
+00007 Template for creating a new representation in EO
+00008 ================================================
+00009 
+00010 This is the template main file.
+00011 It includes all other files that have been generated by the script create.sh
+00012 so it is the only file to compile.
+00013 
+00014 In case you want to build up a separate library for your new Evolving Object,
+00015 you'll need some work - follow what's done in the src/ga dir, used in the
+00016 main file BitEA in tutorial/Lesson4 dir.
+00017 Or you can wait until we do it :-)
+00018 */
+00019 
+00020 // Miscilaneous include and declaration 
+00021 #include <iostream>
+00022 using namespace std;
+00023 
+00024 // eo general include
+00025 #include "eo"
+00026 // the real bounds (not yet in general eo include)
+00027 #include "utils/eoRealVectorBounds.h"
+00028 
+00029 // include here whatever specific files for your representation
+00030 // Basically, this should include at least the following
+00031 
+00035 #include "eoMyStruct.h"
+00036 
+00040 #include "eoMyStructInit.h"
+00041 
+00047 #include "eoMyStructEvalFunc.h"
+00048 
+00049 // GENOTYPE   eoMyStruct ***MUST*** be templatized over the fitness
+00050 
+00051 //*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
+00052 // START fitness type: double or eoMaximizingFitness if you are maximizing
+00053 //                     eoMinimizingFitness if you are minimizing
+00054 typedef eoMinimizingFitness MyFitT ;    // type of fitness 
+00055 // END fitness type
+00056 //*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
+00057 
+00058 // Then define your EO objects using that fitness type
+00059 typedef eoMyStruct<MyFitT> Indi;      // ***MUST*** derive from EO 
+00060 
+00061 // create an initializer
+00062 #include "make_genotype_MyStruct.h"
+00063 eoInit<Indi> & make_genotype(eoParser& _parser, eoState&_state, Indi _eo)
+00064 {
+00065   return do_make_genotype(_parser, _state, _eo);
+00066 } 
+00067 
+00068 // and the variation operaotrs
+00069 #include "make_op_MyStruct.h"
+00070 eoGenOp<Indi>&  make_op(eoParser& _parser, eoState& _state, eoInit<Indi>& _init)
+00071 {
+00072   return do_make_op(_parser, _state, _init);
+00073 }
+00074 
+00075 // Use existing modules to define representation independent routines
+00076 // These are parser-based definitions of objects
+00077 
+00078 // how to initialize the population 
+00079 // it IS representation independent if an eoInit is given
+00080 #include <do/make_pop.h>
+00081 eoPop<Indi >&  make_pop(eoParser& _parser, eoState& _state, eoInit<Indi> & _init)
+00082 {
+00083   return do_make_pop(_parser, _state, _init);
+00084 }
+00085 
+00086 // the stopping criterion
+00087 #include <do/make_continue.h>
+00088 eoContinue<Indi>& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<Indi> & _eval)
+00089 {
+00090   return do_make_continue(_parser, _state, _eval);
+00091 }
+00092 
+00093 // outputs (stats, population dumps, ...)
+00094 #include <do/make_checkpoint.h>
+00095 eoCheckPoint<Indi>& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<Indi>& _eval, eoContinue<Indi>& _continue) 
+00096 {
+00097   return do_make_checkpoint(_parser, _state, _eval, _continue);
+00098 }
+00099 
+00100 // evolution engine (selection and replacement)
+00101 #include <do/make_algo_scalar.h>
+00102 eoAlgo<Indi>&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<Indi>& _eval, eoContinue<Indi>& _continue, eoGenOp<Indi>& _op)
+00103 {
+00104   return do_make_algo_scalar(_parser, _state, _eval, _continue, _op);
+00105 }
+00106 
+00107 // simple call to the algo. stays there for consistency reasons 
+00108 // no template for that one
+00109 #include <do/make_run.h>
+00110 // the instanciating fitnesses
+00111 #include <eoScalarFitness.h>
+00112 void run_ea(eoAlgo<Indi>& _ga, eoPop<Indi>& _pop)
+00113 {
+00114   do_run(_ga, _pop);
+00115 }
+00116 
+00117 // checks for help demand, and writes the status file
+00118 // and make_help; in libutils
+00119 void make_help(eoParser & _parser);
+00120 
+00121 // now use all of the above, + representation dependent things
+00122 int main(int argc, char* argv[])
+00123 {
+00124 
+00125   try
+00126   {
+00127   eoParser parser(argc, argv);  // for user-parameter reading
+00128 
+00129   eoState state;    // keeps all things allocated
+00130 
+00131     // The fitness
+00133    eoMyStructEvalFunc<Indi> plainEval/* (varType  _anyVariable) */;
+00134    // turn that object into an evaluation counter
+00135    eoEvalFuncCounter<Indi> eval(plainEval);
+00136 
+00137   // the genotype - through a genotype initializer
+00138   eoInit<Indi>& init = make_genotype(parser, state, Indi());
+00139 
+00140   // Build the variation operator (any seq/prop construct)
+00141   eoGenOp<Indi>& op = make_op(parser, state, init);
+00142 
+00143 
+00145   //
+00146   // YOU SHOULD NOT NEED TO MODIFY ANYTHING BEYOND THIS POINT
+00147   // unless you want to add specific statistics to the checkpoint
+00149 
+00150   // initialize the population
+00151   // yes, this is representation indepedent once you have an eoInit
+00152   eoPop<Indi>& pop   = make_pop(parser, state, init);
+00153 
+00154   // stopping criteria
+00155   eoContinue<Indi> & term = make_continue(parser, state, eval);
+00156   // output
+00157   eoCheckPoint<Indi> & checkpoint = make_checkpoint(parser, state, eval, term);
+00158   // algorithm (need the operator!)
+00159   eoAlgo<Indi>& ga = make_algo_scalar(parser, state, eval, checkpoint, op);
+00160 
+00162 
+00164   // to be called AFTER all parameters have been read!!!
+00165   make_help(parser);
+00166 
+00169   // evaluate intial population AFTER help and status in case it takes time
+00170   apply<Indi>(eval, pop);
+00171   // if you want to print it out
+00172 //   cout << "Initial Population\n";
+00173 //   pop.sortedPrintOn(cout);
+00174 //   cout << endl;
+00175 
+00176   run_ea(ga, pop); // run the ga
+00177 
+00178   cout << "Final Population\n";
+00179   pop.sortedPrintOn(cout);
+00180   cout << endl;
+00181 
+00182   }
+00183   catch(exception& e)
+00184   {
+00185     cout << e.what() << endl;
+00186   }
+00187   return 0;
+00188 }
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_my_struct_lib_e_a_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_my_struct_lib_e_a_8cpp-source.html new file mode 100644 index 000000000..be2f0b29a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_my_struct_lib_e_a_8cpp-source.html @@ -0,0 +1,155 @@ + + +EO: MyStructLibEA.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Templates
+

MyStructLibEA.cpp

00001 
+00006 /*
+00007 Template for creating a new representation in EO
+00008 ================================================
+00009 
+00010 This is the template main file for compiling after creating a
+00011 "library", i.e. putting everything but the fitness in a separate file 
+00012 (make_MyStruct.cpp) and compiling it once and for all.
+00013 */
+00014 
+00015 // Miscilaneous include and declaration 
+00016 #include <iostream>
+00017 using namespace std;
+00018 
+00019 // eo general include
+00020 #include "eo"
+00021 // the real bounds (not yet in general eo include)
+00022 #include "utils/eoRealVectorBounds.h"
+00023 
+00024 // include here whatever specific files for your representation
+00025 // Basically, this should include at least the following
+00026 
+00030 #include "eoMyStruct.h"
+00031 
+00035 #include "eoMyStructInit.h"
+00036 
+00042 #include "eoMyStructEvalFunc.h"
+00043 
+00044 // GENOTYPE   eoMyStruct ***MUST*** be templatized over the fitness
+00045 
+00046 //
+00047 // START fitness type: double or eoMaximizingFitness if you are maximizing
+00048 //                     eoMinimizingFitness if you are minimizing
+00049 typedef eoMinimizingFitness MyFitT ;    // type of fitness 
+00050 // END fitness type
+00051 //
+00052 
+00053 // Then define your EO objects using that fitness type
+00054 typedef eoMyStruct<MyFitT> Indi;      // ***MUST*** derive from EO 
+00055 
+00056 // create an initializer - done here and NOT in make_MyStruct.cpp
+00057 // because it is NOT representation independent
+00058 #include "make_genotype_MyStruct.h"
+00059 eoInit<Indi> & make_genotype(eoParser& _parser, eoState&_state, Indi _eo)
+00060 {
+00061   return do_make_genotype(_parser, _state, _eo);
+00062 } 
+00063 
+00064 // same thing for the variation operaotrs
+00065 #include "make_op_MyStruct.h"
+00066 eoGenOp<Indi>&  make_op(eoParser& _parser, eoState& _state, eoInit<Indi>& _init)
+00067 {
+00068   return do_make_op(_parser, _state, _init);
+00069 }
+00070 
+00071 // The representation independent routines are simply declared here
+00072 
+00073 // how to initialize the population 
+00074 // it IS representation independent if an eoInit is given
+00075 eoPop<Indi >&  make_pop(eoParser& _parser, eoState& _state, eoInit<Indi> & _init);
+00076 
+00077 // the stopping criterion
+00078 eoContinue<Indi>& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<Indi> & _eval);
+00079 
+00080 // outputs (stats, population dumps, ...)
+00081 eoCheckPoint<Indi>& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<Indi>& _eval, eoContinue<Indi>& _continue);
+00082 
+00083 // evolution engine (selection and replacement)
+00084 eoAlgo<Indi>&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<Indi>& _eval, eoContinue<Indi>& _continue, eoGenOp<Indi>& _op);
+00085 
+00086 // simple call to the algo. stays there for consistency reasons 
+00087 // no template for that one
+00088 void run_ea(eoAlgo<Indi>& _ga, eoPop<Indi>& _pop);
+00089 
+00090 // checks for help demand, and writes the status file
+00091 // and make_help; in libutils - just a declaration, code in libeoutils.a
+00092 void make_help(eoParser & _parser);
+00093 
+00094 // now use all of the above, + representation dependent things
+00095 // from here on, no difference with eoMyStruct.cpp
+00096 int main(int argc, char* argv[])
+00097 {
+00098 
+00099   try
+00100   {
+00101   eoParser parser(argc, argv);  // for user-parameter reading
+00102 
+00103   eoState state;    // keeps all things allocated
+00104 
+00105     // The fitness
+00107    eoMyStructEvalFunc<Indi> plainEval/* (varType  _anyVariable) */;
+00108    // turn that object into an evaluation counter
+00109    eoEvalFuncCounter<Indi> eval(plainEval);
+00110 
+00111   // the genotype - through a genotype initializer
+00112   eoInit<Indi>& init = make_genotype(parser, state, Indi());
+00113 
+00114   // Build the variation operator (any seq/prop construct)
+00115   eoGenOp<Indi>& op = make_op(parser, state, init);
+00116 
+00117 
+00119   //
+00120   // YOU SHOULD NOT NEED TO MODIFY ANYTHING BEYOND THIS POINT
+00121   // unless you want to add specific statistics to the checkpoint
+00123 
+00124   // initialize the population
+00125   // yes, this is representation indepedent once you have an eoInit
+00126   eoPop<Indi>& pop   = make_pop(parser, state, init);
+00127 
+00128   // stopping criteria
+00129   eoContinue<Indi> & term = make_continue(parser, state, eval);
+00130   // output
+00131   eoCheckPoint<Indi> & checkpoint = make_checkpoint(parser, state, eval, term);
+00132   // algorithm (need the operator!)
+00133   eoAlgo<Indi>& ga = make_algo_scalar(parser, state, eval, checkpoint, op);
+00134 
+00136 
+00138   // to be called AFTER all parameters have been read!!!
+00139   make_help(parser);
+00140 
+00143   // evaluate intial population AFTER help and status in case it takes time
+00144   apply<Indi>(eval, pop);
+00145   // if you want to print it out
+00146    cout << "Initial Population\n";
+00147    pop.sortedPrintOn(cout);
+00148    cout << endl;
+00149 
+00150   run_ea(ga, pop); // run the ga
+00151 
+00152   cout << "Final Population\n";
+00153   pop.sortedPrintOn(cout);
+00154   cout << endl;
+00155 
+00156   }
+00157   catch(exception& e)
+00158   {
+00159     cout << e.what() << endl;
+00160   }
+00161   return 0;
+00162 }
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_my_struct_s_e_a_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_my_struct_s_e_a_8cpp-source.html new file mode 100644 index 000000000..6ed0d7590 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_my_struct_s_e_a_8cpp-source.html @@ -0,0 +1,338 @@ + + +EO: MyStructSEA.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Templates
+

MyStructSEA.cpp

00001 
+00006 /*
+00007 Template for creating a new representation in EO
+00008 ================================================
+00009 
+00010 This is the template main file.
+00011 It includes all other files that have been generated by the script create.sh
+00012 so it is the only file to compile.
+00013 
+00014 In case you want to build up a separate library for your new Evolving Object,
+00015 you'll need some work - follow what's done in the src/ga dir, used in the
+00016 main file BitEA in tutorial/Lesson4 dir.
+00017 Or you can wait until we do it :-)
+00018 */
+00019 
+00020 // Miscilaneous include and declaration
+00021 #include <iostream>
+00022 using namespace std;
+00023 
+00024 // eo general include
+00025 #include "eo"
+00026 // the real bounds (not yet in general eo include)
+00027 #include "utils/eoRealVectorBounds.h"
+00028 
+00029 // include here whatever specific files for your representation
+00030 // Basically, this should include at least the following
+00031 
+00035 #include "eoMyStruct.h"
+00036 
+00040 #include "eoMyStructInit.h"
+00041 
+00047 #include "eoMyStructEvalFunc.h"
+00048 
+00053 #include "eoMyStructQuadCrossover.h"
+00054 #include "eoMyStructMutation.h"
+00055 
+00056 /* and (possibly) your personal statistics */
+00057 #include "eoMyStructStat.h"
+00058 
+00059 // GENOTYPE   eoMyStruct ***MUST*** be templatized over the fitness
+00060 
+00061 //*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
+00062 // START fitness type: double or eoMaximizingFitness if you are maximizing
+00063 //                     eoMinimizingFitness if you are minimizing
+00064 typedef eoMinimizingFitness MyFitT ;    // type of fitness
+00065 // END fitness type
+00066 //*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
+00067 
+00068 // Then define your EO objects using that fitness type
+00069 typedef eoMyStruct<MyFitT> Indi;      // ***MUST*** derive from EO
+00070 
+00071 
+00072 // Use existing modules to define representation independent routines
+00073 
+00074 // how to initialize the population
+00075 // it IS representation independent if an eoInit is given
+00076 #include <do/make_pop.h>
+00077 eoPop<Indi >&  make_pop(eoParser& _parser, eoState& _state, eoInit<Indi> & _init)
+00078 {
+00079   return do_make_pop(_parser, _state, _init);
+00080 }
+00081 
+00082 // the stopping criterion
+00083 #include <do/make_continue.h>
+00084 eoContinue<Indi>& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<Indi> & _eval)
+00085 {
+00086   return do_make_continue(_parser, _state, _eval);
+00087 }
+00088 
+00089 // outputs (stats, population dumps, ...)
+00090 #include <do/make_checkpoint.h>
+00091 eoCheckPoint<Indi>& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<Indi>& _eval, eoContinue<Indi>& _continue)
+00092 {
+00093   return do_make_checkpoint(_parser, _state, _eval, _continue);
+00094 }
+00095 
+00096 // evolution engine (selection and replacement)
+00097 #include <do/make_algo_scalar.h>
+00098 eoAlgo<Indi>&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<Indi>& _eval, eoContinue<Indi>& _continue, eoGenOp<Indi>& _op, eoDistance<Indi> *_dist = NULL)
+00099 {
+00100   return do_make_algo_scalar(_parser, _state, _eval, _continue, _op, _dist);
+00101 }
+00102 
+00103 // simple call to the algo. stays there for consistency reasons
+00104 // no template for that one
+00105 #include <do/make_run.h>
+00106 // the instanciating fitnesses
+00107 #include <eoScalarFitness.h>
+00108 void run_ea(eoAlgo<Indi>& _ga, eoPop<Indi>& _pop)
+00109 {
+00110   do_run(_ga, _pop);
+00111 }
+00112 
+00113 // checks for help demand, and writes the status file
+00114 // and make_help; in libutils
+00115 void make_help(eoParser & _parser);
+00116 
+00117 // now use all of the above, + representation dependent things
+00118 int main(int argc, char* argv[])
+00119 {
+00120 try
+00121   {
+00122     eoParser parser(argc, argv);  // for user-parameter reading
+00123 
+00124     eoState state;    // keeps all things allocated
+00125 
+00126     // The fitness
+00128     eoMyStructEvalFunc<Indi> plainEval/* (varType  _anyVariable) */;
+00129     // turn that object into an evaluation counter
+00130     eoEvalFuncCounter<Indi> eval(plainEval);
+00131 
+00132     // a genotype initializer
+00133     eoMyStructInit<Indi> init;
+00134     // or, if you need some parameters, you might as well
+00135     // - write a constructor of the eoMyStructInit that uses a parser
+00136     // - call it from here:
+00137     //        eoMyStructInit<Indi> init(parser);
+00138 
+00139     // if you want to do sharing, you'll need a distance.
+00140     // see file utils/eoDistance.h
+00141     //
+00142     // IF you representation has an operator[]() double-castable,
+00143     // then you can use for instance the quadratic distance (L2 norm)
+00144     //    eoQuadDistance<Indi> dist;
+00145     // or the Hamming distance (L1 norm)
+00146     // eoHammingDistance<Indi> dist;
+00147 
+00148 
+00149     // Build the variation operator (any seq/prop construct)
+00150     // here, a simple example with only 1 crossover (2->2, a QuadOp) and
+00151     // one mutation, is given.
+00152     // Hints to have choice among multiple crossovers and mutations are given
+00153 
+00154     // A (first) crossover (possibly use the parser in its Ctor)
+00155     eoMyStructQuadCrossover<Indi> cross /* (eoParser parser) */;
+00156 
+00157     // IF MORE THAN ONE:
+00158 
+00159     // read its relative rate in the combination
+00160 // double cross1Rate = parser.createParam(1.0, "cross1Rate", "Relative rate for crossover 1", '1', "Variation Operators").value();
+00161 
+00162     // create the combined operator with the first one (rename it cross1 !!!)
+00163 // eoPropCombinedQuadOp<Indi> cross(cross1, cross1Rate);
+00164 
+00165     // and as many as you want the following way:
+00166     // 1- write the new class by mimicking eoMyStructQuadCrossover.h
+00167     // 2- include that file here together with eoMyStructQuadCrossover above
+00168     // 3- uncomment and duplicate the following lines:
+00169     //
+00170 // eoMyStructSecondCrossover<Indi> cross2(eoParser parser);
+00171 // double cross2Rate = parser.createParam(1.0, "cross2Rate", "Relative rate for crossover 2", '2', "Variation Operators").value();
+00172 // cross.add(cross2, cross2Rate);
+00173 
+00174   // NOTE: if you want some gentle output, the last one shoudl be like
+00175   //  cross.add(cross, crossXXXRate, true);
+00176 
+00178 
+00179   // a (first) mutation   (possibly use the parser in its Ctor)
+00180   eoMyStructMutation<Indi> mut /* (parser) */;
+00181 
+00182     // IF MORE THAN ONE:
+00183 
+00184     // read its relative rate in the combination
+00185 // double mut1Rate = parser.createParam(1.0, "mut1Rate", "Relative rate for mutation 1", '1', "Variation Operators").value();
+00186 
+00187     // create the combined operator with the first one (rename it cross1 !!!)
+00188 // eoPropCombinedMonOp<Indi> mut(mut1, mut1Rate);
+00189 
+00190     // and as many as you want the following way:
+00191     // 1- write the new class by mimicking eoMyStructMutation.h
+00192     // 2- include that file here together with eoMyStructMutation above
+00193     // 3- uncomment and duplicate the following lines:
+00194     //
+00195 // eoMyStructSecondMutation<Indi> mut2(eoParser parser);
+00196 // double mut2Rate = parser.createParam(1.0, "mut2Rate", "Relative rate for mutation 2", '2', "Variation Operators").value();
+00197 // mut.add(mut2, mut2Rate);
+00198 
+00199   // NOTE: if you want some gentle output, the last one shoudl be like
+00200   //  mut.add(mut, mutXXXRate, true);
+00201 
+00202   // now encapsulate your crossover(s) and mutation(s) into an eoGeneralOp
+00203   // so you can fully benefit of the existing evolution engines
+00204 
+00205   // First read the individual level parameters
+00206     double pCross = parser.createParam(0.6, "pCross", "Probability of Crossover", 'C', "Variation Operators" ).value();
+00207     // minimum check
+00208     if ( (pCross < 0) || (pCross > 1) )
+00209       throw runtime_error("Invalid pCross");
+00210 
+00211     double pMut = parser.createParam(0.1, "pMut", "Probability of Mutation", 'M', "Variation Operators" ).value();
+00212     // minimum check
+00213     if ( (pMut < 0) || (pMut > 1) )
+00214       throw runtime_error("Invalid pMut");
+00215 
+00216     // now create the generalOp
+00217     eoSGAGenOp<Indi> op(cross, pCross, mut, pMut);
+00218 
+00219 
+00221     //
+00222     // You do not need to modify anything beyond this point
+00223     // unless you want to add specific statistics to the checkpoint
+00224     // in which case you should uncomment the corresponding block
+00225     // and possibly modify the parameters in the stat object creation
+00227 
+00228   // initialize the population
+00229   // yes, this is representation indepedent once you have an eoInit
+00230   eoPop<Indi>& pop   = make_pop(parser, state, init);
+00231 
+00232   // stopping criteria
+00233   eoContinue<Indi> & term = make_continue(parser, state, eval);
+00234   // output
+00235   eoCheckPoint<Indi> & checkpoint = make_checkpoint(parser, state, eval, term);
+00236 
+00237 
+00238   // UNCOMMENT the following commented block if you want to add you stats
+00239 
+00240   // if uncommented, it is assumed that you will want to print some stat.
+00241   // if not, then the following objects will be created uselessly - but what the heck!
+00242 
+00243   eoMyStructStat<Indi>   myStat;       // or maybe myStat(parser);
+00244   checkpoint.add(myStat);
+00245   // This one is probably redundant with the one in make_checkpoint, but w.t.h.
+00246   eoIncrementorParam<unsigned> generationCounter("Gen.");
+00247   checkpoint.add(generationCounter);
+00248   // need to get the name of the redDir param (if any)
+00249   std::string dirName =  parser.getORcreateParam(std::string("Res"), "resDir", "Directory to store DISK outputs", '\0', "Output - Disk").value() + "/";
+00250 
+00251 
+00252   // those need to be pointers because of the if's
+00253   eoStdoutMonitor *myStdOutMonitor;
+00254   eoFileMonitor   *myFileMonitor;
+00255 #ifdef HAVE_GNUPLOT
+00256   eoGnuplot1DMonitor *myGnuMonitor;
+00257 #endif
+00258 
+00259   // now check how you want to output the stat:
+00260   bool printMyStructStat = parser.createParam(false, "coutMyStructStat", "Prints my stat to screen, one line per generation", '\0', "My application").value();
+00261   bool fileMyStructStat = parser.createParam(false, "fileMyStructStat", "Saves my stat to file (in resDir", '\0', "My application").value();
+00262   bool plotMyStructStat = parser.createParam(false, "plotMyStructStat", "On-line plots my stat using gnuplot", '\0', "My application").value();
+00263 
+00264   // should we write it on StdOut ?
+00265   if (printMyStructStat)
+00266     {
+00267       myStdOutMonitor = new eoStdoutMonitor(false);
+00268       // don't forget to store the memory in the state
+00269       state.storeFunctor(myStdOutMonitor);
+00270       // and of course to add the monitor to the checkpoint
+00271       checkpoint.add(*myStdOutMonitor);
+00272       // and the different fields to the monitor
+00273       myStdOutMonitor->add(generationCounter);
+00274       myStdOutMonitor->add(eval);
+00275       myStdOutMonitor->add(myStat);
+00276     }
+00277 
+00278   // first check the directory (and creates it if not exists already):
+00279   if (fileMyStructStat || plotMyStructStat)
+00280       if (! testDirRes(dirName, true) )
+00281         throw runtime_error("Problem with resDir");
+00282 
+00283   // should we write it to a file ?
+00284   if (fileMyStructStat)
+00285     {
+00286       // the file name is hard-coded - of course you can read
+00287       // a string parameter in the parser if you prefer
+00288       myFileMonitor = new eoFileMonitor(dirName + "myStat.xg");
+00289       // don't forget to store the memory in the state
+00290       state.storeFunctor(myFileMonitor);
+00291       // and of course to add the monitor to the checkpoint
+00292       checkpoint.add(*myFileMonitor);
+00293       // and the different fields to the monitor
+00294       myFileMonitor->add(generationCounter);
+00295       myFileMonitor->add(eval);
+00296       myFileMonitor->add(myStat);
+00297     }
+00298 
+00299 #ifdef HAVE_GNUPLOT
+00300   // should we PLOT it on StdOut ? (one dot per generation, incremental plot)
+00301   if (plotMyStructStat)
+00302     {
+00303       myGnuMonitor = new eoGnuplot1DMonitor(dirName+"plot_myStat.xg",minimizing_fitness<Indi>());
+00304       // NOTE: you cand send commands to gnuplot at any time with the method
+00305       // myGnuMonitor->gnuplotCommand(string)
+00306       // par exemple, gnuplotCommand("set logscale y")
+00307 
+00308       // don't forget to store the memory in the state
+00309       state.storeFunctor(myGnuMonitor);
+00310       // and of course to add the monitor to the checkpoint
+00311       checkpoint.add(*myGnuMonitor);
+00312       // and the different fields to the monitor (X = eval, Y = myStat)
+00313       myGnuMonitor->add(eval);
+00314       myGnuMonitor->add(myStat);
+00315     }
+00316 #endif
+00317 
+00318   // algorithm (need the operator!)
+00319   eoAlgo<Indi>& ga = make_algo_scalar(parser, state, eval, checkpoint, op);
+00320   // and the distance if you want to do sharing
+00321   // eoAlgo<Indi>& ga = make_algo_scalar(parser, state, eval, checkpoint, op, &dist);
+00322 
+00324 
+00326   // to be called AFTER all parameters have been read!!!
+00327   make_help(parser);
+00328 
+00331   // evaluate intial population AFTER help and status in case it takes time
+00332   apply<Indi>(eval, pop);
+00333   // if you want to print it out
+00334 //   cout << "Initial Population\n";
+00335 //   pop.sortedPrintOn(cout);
+00336 //   cout << endl;
+00337 
+00338   run_ea(ga, pop); // run the ga
+00339 
+00340   cout << "Final Population\n";
+00341   pop.sortedPrintOn(cout);
+00342   cout << endl;
+00343 
+00344   }
+00345   catch(exception& e)
+00346   {
+00347     cout << e.what() << endl;
+00348   }
+00349   return 0;
+00350 }
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_n_e_w_s-source.html b/trunk/paradiseo-eo/doc/html/_n_e_w_s-source.html new file mode 100644 index 000000000..16dbfb947 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_n_e_w_s-source.html @@ -0,0 +1,30 @@ + + +EO: NEWS Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

NEWS

00001 * release 0.9.4 (not yet released)
+00002   - Update introductory pages of documentation and webpage.
+00003   - Remove support for pre-standard C++ compiler (i.e. gcc-2.x), which allows to
+00004     clean up the code considerably. Assume availability of sstream and limits.
+00005   - Implement CMA-ES.
+00006   
+00007 
+00008 * release 0.9.3z.1 (1. Oct. 2005)
+00009   - Support gcc-3.4 and gcc.4.x.
+00010   - Provide full automake/autoconf/configure support.
+00011 
+00012 
+00013 # Local Variables:
+00014 # coding: iso-8859-1
+00015 # mode: text
+00016 # fill-column: 80
+00017 # End:
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_node_selector_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_node_selector_8cpp-source.html new file mode 100644 index 000000000..cd6a69a5f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_node_selector_8cpp-source.html @@ -0,0 +1,65 @@ + + +EO: NodeSelector.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / gen
+

NodeSelector.cpp

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #include "NodeSelector.h"
+00019 #include "Sym.h"
+00020 
+00021 #include <utils/eoRNG.h>
+00022 
+00023 // If subtree is not set (by randomnodeselector for instance, find it now
+00024 Sym NodeSelector::NodeSelection::subtree() {
+00025     if (subtree_.empty()) {
+00026         subtree_ = get_subtree(root_, subtree_index_);
+00027     }
+00028     return subtree_;
+00029 }
+00030 
+00031 NodeSelector::NodeSelection RandomNodeSelector::select_node(Sym sym) const {
+00032     unsigned idx = rng.random(sym.size());
+00033     return  NodeSelection(sym, idx, Sym() ); // empty subtree, find it when needed
+00034 }
+00035 
+00036 NodeSelector::NodeSelection BiasedNodeSelector::select_node(Sym sym) const {
+00037     
+00038     unsigned p = rng.random(sym.size());
+00039     Sym res;
+00040     for (unsigned i = 0; i < nRounds; ++i) {
+00041         res = get_subtree(sym, p);
+00042         
+00043         if (res.args().size() > 0) break;
+00044         
+00045         p = rng.random(sym.size());
+00046     }
+00047     
+00048     return NodeSelection(sym, p, res);
+00049 }
+00050 
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_node_selector_8h-source.html b/trunk/paradiseo-eo/doc/html/_node_selector_8h-source.html new file mode 100644 index 000000000..4f26f0cde --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_node_selector_8h-source.html @@ -0,0 +1,77 @@ + + +EO: NodeSelector.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / gen
+

NodeSelector.h

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #ifndef NODESELECTOR_H
+00019 #define NODESELECTOR_H
+00020 
+00021 #include <Sym.h>
+00022 
+00024 class NodeSelector {
+00025     public:
+00026         
+00027     class NodeSelection {
+00028         Sym root_;
+00029         unsigned subtree_index_;
+00030         Sym subtree_;
+00031 
+00032         public :
+00033             NodeSelection(Sym r, unsigned idx, Sym s) 
+00034                 : root_(r), subtree_index_(idx), subtree_(s) {}
+00035 
+00036             Sym root() const { return root_; }
+00037             unsigned idx()  const { return subtree_index_; }
+00038             Sym subtree(); 
+00039         
+00040     };
+00041 
+00042     virtual ~NodeSelector() {}
+00043         
+00044     virtual NodeSelection select_node(Sym sym) const = 0;  
+00045 };
+00046 
+00047 
+00049 class RandomNodeSelector : public NodeSelector {
+00050     public:
+00051     NodeSelection select_node(Sym sym) const;
+00052 };
+00053 
+00055 class BiasedNodeSelector : public NodeSelector {
+00056     public:
+00057     unsigned nRounds;
+00058 
+00059     BiasedNodeSelector() : nRounds(3) {} // 3: for binary trees 87.5% chance of selecting an internal node
+00060     BiasedNodeSelector(unsigned n) : nRounds(n) {}
+00061     
+00062     NodeSelection select_node(Sym sym) const;
+00063 };
+00064 
+00065 #endif
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_one_max_e_a_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_one_max_e_a_8cpp-source.html new file mode 100644 index 000000000..3f5ab841c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_one_max_e_a_8cpp-source.html @@ -0,0 +1,181 @@ + + +EO: OneMaxEA.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Lesson5
+

OneMaxEA.cpp

00001 
+00006 /*
+00007 Template for creating a new representation in EO
+00008 ================================================
+00009 
+00010 This is the template main file.
+00011 It includes all other files that have been generated by the script create.sh
+00012 so it is the only file to compile.
+00013 
+00014 In case you want to build up a separate library for your new Evolving Object,
+00015 you'll need some work - follow what's done in the src/ga dir, used in the
+00016 main file BitEA in tutorial/Lesson4 dir.
+00017 Or you can wait until we do it :-)
+00018 */
+00019 
+00020 // Miscilaneous include and declaration 
+00021 #include <iostream>
+00022 using namespace std;
+00023 
+00024 // eo general include
+00025 #include "eo"
+00026 // the real bounds (not yet in general eo include)
+00027 #include "utils/eoRealVectorBounds.h"
+00028 
+00029 // include here whatever specific files for your representation
+00030 // Basically, this should include at least the following
+00031 
+00035 #include "eoOneMax.h"
+00036 
+00040 #include "eoOneMaxInit.h"
+00041 
+00047 #include "eoOneMaxEvalFunc.h"
+00048 
+00049 // GENOTYPE   eoOneMax ***MUST*** be templatized over the fitness
+00050 
+00051 //*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
+00052 // START fitness type: double or eoMaximizingFitness if you are maximizing
+00053 //                     eoMinimizingFitness if you are minimizing
+00054 typedef eoMaximizingFitness MyFitT ;    // type of fitness 
+00055 // END fitness type
+00056 //*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
+00057 
+00058 // Then define your EO objects using that fitness type
+00059 typedef eoOneMax<MyFitT> Indi;      // ***MUST*** derive from EO 
+00060 
+00061 // create an initializer
+00062 #include "make_genotype_OneMax.h"
+00063 eoInit<Indi> & make_genotype(eoParser& _parser, eoState&_state, Indi _eo)
+00064 {
+00065   return do_make_genotype(_parser, _state, _eo);
+00066 } 
+00067 
+00068 // and the variation operaotrs
+00069 #include "make_op_OneMax.h"
+00070 eoGenOp<Indi>&  make_op(eoParser& _parser, eoState& _state, eoInit<Indi>& _init)
+00071 {
+00072   return do_make_op(_parser, _state, _init);
+00073 }
+00074 
+00075 // Use existing modules to define representation independent routines
+00076 // These are parser-based definitions of objects
+00077 
+00078 // how to initialize the population 
+00079 // it IS representation independent if an eoInit is given
+00080 #include <do/make_pop.h>
+00081 eoPop<Indi >&  make_pop(eoParser& _parser, eoState& _state, eoInit<Indi> & _init)
+00082 {
+00083   return do_make_pop(_parser, _state, _init);
+00084 }
+00085 
+00086 // the stopping criterion
+00087 #include <do/make_continue.h>
+00088 eoContinue<Indi>& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<Indi> & _eval)
+00089 {
+00090   return do_make_continue(_parser, _state, _eval);
+00091 }
+00092 
+00093 // outputs (stats, population dumps, ...)
+00094 #include <do/make_checkpoint.h>
+00095 eoCheckPoint<Indi>& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<Indi>& _eval, eoContinue<Indi>& _continue) 
+00096 {
+00097   return do_make_checkpoint(_parser, _state, _eval, _continue);
+00098 }
+00099 
+00100 // evolution engine (selection and replacement)
+00101 #include <do/make_algo_scalar.h>
+00102 eoAlgo<Indi>&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<Indi>& _eval, eoContinue<Indi>& _continue, eoGenOp<Indi>& _op)
+00103 {
+00104   return do_make_algo_scalar(_parser, _state, _eval, _continue, _op);
+00105 }
+00106 
+00107 // simple call to the algo. stays there for consistency reasons 
+00108 // no template for that one
+00109 #include <do/make_run.h>
+00110 // the instanciating fitnesses
+00111 #include <eoScalarFitness.h>
+00112 void run_ea(eoAlgo<Indi>& _ga, eoPop<Indi>& _pop)
+00113 {
+00114   do_run(_ga, _pop);
+00115 }
+00116 
+00117 // checks for help demand, and writes the status file
+00118 // and make_help; in libutils
+00119 void make_help(eoParser & _parser);
+00120 
+00121 // now use all of the above, + representation dependent things
+00122 int main(int argc, char* argv[])
+00123 {
+00124 
+00125   try
+00126   {
+00127   eoParser parser(argc, argv);  // for user-parameter reading
+00128 
+00129   eoState state;    // keeps all things allocated
+00130 
+00131     // The fitness
+00133    eoOneMaxEvalFunc<Indi> plainEval/* (varType  _anyVariable) */;
+00134    // turn that object into an evaluation counter
+00135    eoEvalFuncCounter<Indi> eval(plainEval);
+00136 
+00137   // the genotype - through a genotype initializer
+00138   eoInit<Indi>& init = make_genotype(parser, state, Indi());
+00139 
+00140   // Build the variation operator (any seq/prop construct)
+00141   eoGenOp<Indi>& op = make_op(parser, state, init);
+00142 
+00143 
+00145   //
+00146   // YOU SHOULD NOT NEED TO MODIFY ANYTHING BEYOND THIS POINT
+00147   // unless you want to add specific statistics to the checkpoint
+00149 
+00150   // initialize the population
+00151   // yes, this is representation indepedent once you have an eoInit
+00152   eoPop<Indi>& pop   = make_pop(parser, state, init);
+00153 
+00154   // stopping criteria
+00155   eoContinue<Indi> & term = make_continue(parser, state, eval);
+00156   // output
+00157   eoCheckPoint<Indi> & checkpoint = make_checkpoint(parser, state, eval, term);
+00158   // algorithm (need the operator!)
+00159   eoAlgo<Indi>& ga = make_algo_scalar(parser, state, eval, checkpoint, op);
+00160 
+00162 
+00164   // to be called AFTER all parameters have been read!!!
+00165   make_help(parser);
+00166 
+00169   // evaluate intial population AFTER help and status in case it takes time
+00170   apply<Indi>(eval, pop);
+00171   // if you want to print it out
+00172    cout << "Initial Population\n";
+00173    pop.sortedPrintOn(cout);
+00174    cout << endl;
+00175 
+00176   run_ea(ga, pop); // run the ga
+00177 
+00178   cout << "Final Population\n";
+00179   pop.sortedPrintOn(cout);
+00180   cout << endl;
+00181 
+00182   }
+00183   catch(exception& e)
+00184   {
+00185     cout << e.what() << endl;
+00186   }
+00187   return 0;
+00188 }
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_one_max_lib_e_a_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_one_max_lib_e_a_8cpp-source.html new file mode 100644 index 000000000..7c924c424 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_one_max_lib_e_a_8cpp-source.html @@ -0,0 +1,155 @@ + + +EO: OneMaxLibEA.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Lesson5
+

OneMaxLibEA.cpp

00001 
+00006 /*
+00007 Template for creating a new representation in EO
+00008 ================================================
+00009 
+00010 This is the template main file for compiling after creating a
+00011 library. 
+00012 See make_OneMax.cpp file.
+00013 */
+00014 
+00015 // Miscilaneous include and declaration 
+00016 #include <iostream>
+00017 using namespace std;
+00018 
+00019 // eo general include
+00020 #include "eo"
+00021 // the real bounds (not yet in general eo include)
+00022 #include "utils/eoRealVectorBounds.h"
+00023 
+00024 // include here whatever specific files for your representation
+00025 // Basically, this should include at least the following
+00026 
+00030 #include "eoOneMax.h"
+00031 
+00035 #include "eoOneMaxInit.h"
+00036 
+00042 #include "eoOneMaxEvalFunc.h"
+00043 
+00044 // GENOTYPE   eoOneMax ***MUST*** be templatized over the fitness
+00045 
+00046 //
+00047 // START fitness type: double or eoMaximizingFitness if you are maximizing
+00048 //                     eoMinimizingFitness if you are minimizing
+00049 typedef eoMinimizingFitness MyFitT ;    // type of fitness 
+00050 // END fitness type
+00051 //
+00052 
+00053 // Then define your EO objects using that fitness type
+00054 typedef eoOneMax<MyFitT> Indi;      // ***MUST*** derive from EO 
+00055 
+00056 // create an initializer - done here and NOT in make_OneMax.cpp
+00057 // because it is NOT representation independent
+00058 #include "make_genotype_OneMax.h"
+00059 eoInit<Indi> & make_genotype(eoParser& _parser, eoState&_state, Indi _eo)
+00060 {
+00061   return do_make_genotype(_parser, _state, _eo);
+00062 } 
+00063 
+00064 // same thing for the variation operaotrs
+00065 #include "make_op_OneMax.h"
+00066 eoGenOp<Indi>&  make_op(eoParser& _parser, eoState& _state, eoInit<Indi>& _init)
+00067 {
+00068   return do_make_op(_parser, _state, _init);
+00069 }
+00070 
+00071 // The representation independent routines are simply declared here
+00072 
+00073 // how to initialize the population 
+00074 // it IS representation independent if an eoInit is given
+00075 eoPop<Indi >&  make_pop(eoParser& _parser, eoState& _state, eoInit<Indi> & _init);
+00076 
+00077 // the stopping criterion
+00078 eoContinue<Indi>& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<Indi> & _eval);
+00079 
+00080 // outputs (stats, population dumps, ...)
+00081 eoCheckPoint<Indi>& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<Indi>& _eval, eoContinue<Indi>& _continue);
+00082 
+00083 // evolution engine (selection and replacement)
+00084 eoAlgo<Indi>&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<Indi>& _eval, eoContinue<Indi>& _continue, eoGenOp<Indi>& _op);
+00085 
+00086 // simple call to the algo. stays there for consistency reasons 
+00087 // no template for that one
+00088 void run_ea(eoAlgo<Indi>& _ga, eoPop<Indi>& _pop);
+00089 
+00090 // checks for help demand, and writes the status file
+00091 // and make_help; in libutils - just a declaration, code in libeoutils.a
+00092 void make_help(eoParser & _parser);
+00093 
+00094 // now use all of the above, + representation dependent things
+00095 // from here on, no difference with eoOneMax.cpp
+00096 int main(int argc, char* argv[])
+00097 {
+00098 
+00099   try
+00100   {
+00101   eoParser parser(argc, argv);  // for user-parameter reading
+00102 
+00103   eoState state;    // keeps all things allocated
+00104 
+00105     // The fitness
+00107    eoOneMaxEvalFunc<Indi> plainEval/* (varType  _anyVariable) */;
+00108    // turn that object into an evaluation counter
+00109    eoEvalFuncCounter<Indi> eval(plainEval);
+00110 
+00111   // the genotype - through a genotype initializer
+00112   eoInit<Indi>& init = make_genotype(parser, state, Indi());
+00113 
+00114   // Build the variation operator (any seq/prop construct)
+00115   eoGenOp<Indi>& op = make_op(parser, state, init);
+00116 
+00117 
+00119   //
+00120   // YOU SHOULD NOT NEED TO MODIFY ANYTHING BEYOND THIS POINT
+00121   // unless you want to add specific statistics to the checkpoint
+00123 
+00124   // initialize the population
+00125   // yes, this is representation indepedent once you have an eoInit
+00126   eoPop<Indi>& pop   = make_pop(parser, state, init);
+00127 
+00128   // stopping criteria
+00129   eoContinue<Indi> & term = make_continue(parser, state, eval);
+00130   // output
+00131   eoCheckPoint<Indi> & checkpoint = make_checkpoint(parser, state, eval, term);
+00132   // algorithm (need the operator!)
+00133   eoAlgo<Indi>& ga = make_algo_scalar(parser, state, eval, checkpoint, op);
+00134 
+00136 
+00138   // to be called AFTER all parameters have been read!!!
+00139   make_help(parser);
+00140 
+00143   // evaluate intial population AFTER help and status in case it takes time
+00144   apply<Indi>(eval, pop);
+00145   // if you want to print it out
+00146    cout << "Initial Population\n";
+00147    pop.sortedPrintOn(cout);
+00148    cout << endl;
+00149 
+00150   run_ea(ga, pop); // run the ga
+00151 
+00152   cout << "Final Population\n";
+00153   pop.sortedPrintOn(cout);
+00154   cout << endl;
+00155 
+00156   }
+00157   catch(exception& e)
+00158   {
+00159     cout << e.what() << endl;
+00160   }
+00161   return 0;
+00162 }
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_py_e_o_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_py_e_o_8cpp-source.html new file mode 100644 index 000000000..2191adfd6 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_py_e_o_8cpp-source.html @@ -0,0 +1,245 @@ + + +EO: PyEO.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / pyeo
+

PyEO.cpp

00001 /*
+00002     PyEO
+00003 
+00004     Copyright (C) 2003 Maarten Keijzer
+00005 
+00006     This program is free software; you can redistribute it and/or modify
+00007     it under the terms of the GNU General Public License as published by
+00008     the Free Software Foundation; either version 2 of the License, or
+00009     (at your option) any later version.
+00010 
+00011     This program is distributed in the hope that it will be useful,
+00012     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00013     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00014     GNU General Public License for more details.
+00015 
+00016     You should have received a copy of the GNU General Public License
+00017     along with this program; if not, write to the Free Software
+00018     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00019 */
+00020 
+00021 #include <sstream>
+00022 
+00023 #include "PyEO.h"
+00024 #include <eoPop.h>
+00025 
+00026 
+00027 using namespace std;
+00028 //using namespace boost::python;
+00029 
+00030 // static member, needs to be instantiated somewhere
+00031 std::vector<int> PyFitness::objective_info;
+00032 
+00033 bool PyFitness::dominates(const PyFitness& oth) const
+00034 {
+00035     bool dom = false;
+00036 
+00037     for (unsigned i = 0; i < nObjectives(); ++i)
+00038     {
+00039       int objective = objective_info[i];
+00040 
+00041       if (objective == 0) // ignore
+00042           continue;
+00043 
+00044       bool maxim = objective > 0;
+00045 
+00046       double aval = maxim? (*this)[i] : -(*this)[i];
+00047       double bval = maxim? oth[i] : -oth[i];
+00048 
+00049       if (fabs(aval - bval) > tol())
+00050       {
+00051         if (aval < bval)
+00052         {
+00053           return false; // cannot dominate
+00054         }
+00055         // else aval < bval
+00056         dom = true; // for the moment: goto next objective
+00057       }
+00058       //else they're equal in this objective, goto next
+00059     }
+00060 
+00061     return dom;
+00062 }
+00063 
+00064 bool dominates(const PyEO& a, const PyEO& b)
+00065 {
+00066     return PyFitness(a.fitness()).dominates(b.fitness());
+00067 }
+00068 
+00069 ostream& operator<<(ostream& os, const PyEO& _eo)
+00070 {
+00071     os << _eo.to_string();
+00072     return os;
+00073 }
+00074 
+00075 struct pyPop_pickle_suite : boost::python::pickle_suite
+00076 {
+00077     static boost::python::tuple getstate(const eoPop<PyEO>& _pop)
+00078     {
+00079         boost::python::list entries;
+00080         for (unsigned i = 0; i != _pop.size(); ++i)
+00081             entries.append( PyEO_pickle_suite::getstate(_pop[i]) );
+00082 
+00083         return boost::python::make_tuple(boost::python::object(_pop.size()), entries);
+00084     }
+00085 
+00086     static void setstate( eoPop<PyEO>& _pop, boost::python::tuple pickled)
+00087     {
+00088         int sz = boost::python::extract<int>(pickled[0]);
+00089         boost::python::list entries = boost::python::list(pickled[1]);
+00090         _pop.resize(sz);
+00091         for (unsigned i = 0; i != _pop.size(); ++i)
+00092         {
+00093             PyEO_pickle_suite::setstate(_pop[i], boost::python::tuple(entries[i]) );
+00094         }
+00095     }
+00096 };
+00097 
+00098 
+00099 template <class T>
+00100 boost::python::str to_string(T& _p)
+00101 {
+00102     std::ostringstream os;
+00103     _p.printOn(os);
+00104     return boost::python::str(os.str().c_str());
+00105 }
+00106 
+00107 void pop_sort(eoPop<PyEO>& pop) { pop.sort(); }
+00108 void pop_shuffle(eoPop<PyEO>& pop) { pop.shuffle(); }
+00109 
+00110 void translate_index_error(index_error const& e)
+00111 {
+00112         PyErr_SetString(PyExc_IndexError, e.what.c_str());
+00113 }
+00114 
+00115 PyEO& pop_getitem(eoPop<PyEO>& pop, boost::python::object key)
+00116 {
+00117     boost::python::extract<int> x(key);
+00118     if (!x.check())
+00119         throw index_error("Slicing not allowed");
+00120 
+00121     int i = x();
+00122 
+00123     if (static_cast<unsigned>(i) >= pop.size())
+00124     {
+00125         throw index_error("Index out of bounds");
+00126     }
+00127     return pop[i];
+00128 }
+00129 
+00130 void pop_setitem(eoPop<PyEO>& pop, boost::python::object key, PyEO& value)
+00131 {
+00132     boost::python::extract<int> x(key);
+00133     if (!x.check())
+00134         throw index_error("Slicing not allowed");
+00135 
+00136     int i = x();
+00137 
+00138     if (static_cast<unsigned>(i) >= pop.size())
+00139     {
+00140         throw index_error("Index out of bounds");
+00141     }
+00142 
+00143     pop[i] = value;
+00144 }
+00145 
+00146 void pop_push_back(eoPop<PyEO>& pop, PyEO& p) { pop.push_back(p); }
+00147 void pop_resize(   eoPop<PyEO>& pop, unsigned i) { pop.resize(i); }
+00148 
+00149 extern void abstract1();
+00150 extern void algos();
+00151 extern void random_numbers();
+00152 extern void geneticOps();
+00153 extern void selectOne();
+00154 extern void continuators();
+00155 extern void reduce();
+00156 extern void replacement();
+00157 extern void selectors();
+00158 extern void breeders();
+00159 extern void mergers();
+00160 extern void valueParam();
+00161 extern void perf2worth();
+00162 extern void monitors();
+00163 extern void statistics();
+00164 
+00165 BOOST_PYTHON_MODULE(PyEO)
+00166 {
+00167     using namespace boost::python;
+00168 
+00169     boost::python::register_exception_translator<index_error>(&translate_index_error);
+00170 
+00171     boost::python::class_<PyEO>("EO")
+00172         .add_property("fitness", &PyEO::getFitness, &PyEO::setFitness)
+00173         .add_property("genome", &PyEO::getGenome, &PyEO::setGenome)
+00174         .def_pickle(PyEO_pickle_suite())
+00175         .def("invalidate", &PyEO::invalidate)
+00176         .def("invalid", &PyEO::invalid)
+00177         .def("__str__", &PyEO::to_string)
+00178         ;
+00179 
+00180     boost::python::class_<eoPop<PyEO> >("eoPop", init<>() )
+00181         .def( init< unsigned, eoInit<PyEO>& >()[with_custodian_and_ward<1,3>()] )
+00182         .def("append", &eoPop<PyEO>::append)
+00183         .def("__str__", to_string<eoPop<PyEO> >)
+00184         .def("__len__", &eoPop<PyEO>::size)
+00185         .def("sort",    pop_sort )
+00186         .def("shuffle", pop_shuffle)
+00187         .def("__getitem__", pop_getitem, return_internal_reference<>() )
+00188         .def("__setitem__", pop_setitem)
+00189         .def("best", &eoPop<PyEO>::best_element, return_internal_reference<>() )
+00190         .def("push_back", pop_push_back)
+00191         .def("resize",    pop_resize)
+00192         .def_pickle(pyPop_pickle_suite())
+00193         ;
+00194 
+00195 
+00196     // Other definitions in different compilation units,
+00197     // this to avoid having g++ to choke on the load
+00198     random_numbers();
+00199     valueParam();
+00200     abstract1();
+00201     geneticOps();
+00202     selectOne();
+00203     selectors();
+00204     perf2worth();
+00205     monitors();
+00206     statistics();
+00207     continuators();
+00208     reduce();
+00209     replacement();
+00210     breeders();
+00211     mergers();
+00212     algos();
+00213 
+00214     // The traits class
+00215     class_<PyFitness>("PyFitness");
+00216 
+00217         def("nObjectives", &PyFitness::nObjectives);
+00218         def("tol", &PyFitness::tol);
+00219         def("maximizing", &PyFitness::maximizing);
+00220         def("setObjectivesSize", &PyFitness::setObjectivesSize);
+00221         def("setObjectivesValue", &PyFitness::setObjectivesValue);
+00222         def("dominates", dominates);
+00223 }
+00224 
+00225 
+00226 // to avoid having to build with libeo.a
+00227 ostream & operator << ( ostream& _os, const eoPrintable& _o ) {
+00228             _o.printOn(_os);
+00229                     return _os;
+00230 };
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_py_e_o_8h-source.html b/trunk/paradiseo-eo/doc/html/_py_e_o_8h-source.html new file mode 100644 index 000000000..a572bb9a6 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_py_e_o_8h-source.html @@ -0,0 +1,171 @@ + + +EO: PyEO.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / pyeo
+

PyEO.h

00001 /*
+00002     PyEO
+00003     
+00004     Copyright (C) 2003 Maarten Keijzer
+00005 
+00006     This program is free software; you can redistribute it and/or modify
+00007     it under the terms of the GNU General Public License as published by
+00008     the Free Software Foundation; either version 2 of the License, or
+00009     (at your option) any later version.
+00010 
+00011     This program is distributed in the hope that it will be useful,
+00012     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00013     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00014     GNU General Public License for more details.
+00015 
+00016     You should have received a copy of the GNU General Public License
+00017     along with this program; if not, write to the Free Software
+00018     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00019 */
+00020 
+00021 #ifndef PYEO_H
+00022 #define PYEO_H
+00023 
+00024 
+00025 #include <string>
+00026 #include <vector>
+00027 #include <exception>
+00028 #include <boost/python.hpp>
+00029 
+00030 #include <EO.h>
+00031 struct index_error : public std::exception { 
+00032     index_error(std::string w) : what(w) {}; 
+00033     virtual ~index_error() throw() {}
+00034     std::string what; 
+00035 };
+00036 
+00037 class PyFitness : public boost::python::object
+00038 {
+00039     public :
+00040     
+00041     typedef PyFitness fitness_traits; // it's its own traits class :-)
+00042         
+00043     PyFitness() : boost::python::object() {}
+00044     
+00045     template <class T>
+00046     PyFitness(const T& o) : boost::python::object(o) {}
+00047     
+00048     static unsigned nObjectives() { return objective_info.size(); }
+00049     static double tol() { return 1e-6; }
+00050     static bool maximizing(int which) { return objective_info[which] > 0; }
+00051     
+00052     static void setObjectivesSize(int sz) { objective_info.resize(sz, 0); }
+00053     static void setObjectivesValue(unsigned which, int value)
+00054     {
+00055         if (which >= objective_info.size())
+00056         {
+00057             throw index_error("Too few elements allocated, resize objectives first");
+00058         }
+00059 
+00060         objective_info[which] = value;
+00061     }
+00062     
+00063     static std::vector<int> objective_info;
+00064     
+00065     bool dominates(const PyFitness& oth) const;
+00066     
+00067     double operator[](int i) const 
+00068     { 
+00069         boost::python::extract<double> x(object::operator[](i)); 
+00070     
+00071         if (!x.check())
+00072             throw std::runtime_error("PyFitness: does not contain doubles");
+00073         return x();
+00074     }
+00075  
+00076     bool operator<(const PyFitness& other) const 
+00077     { 
+00078         if (objective_info.size() == 0)
+00079         {
+00080             const object& self = *this;
+00081             const object& oth = other;
+00082             return self < oth;
+00083         }
+00084         // otherwise use objective_info
+00085     
+00086         for (unsigned i = 0; i < objective_info.size(); ++i)
+00087         {
+00088             double a = objective_info[i] * operator[](i);
+00089             double b = objective_info[i] * other[i];
+00090 
+00091             if ( fabs(a - b) > tol())
+00092             {
+00093                 if (a < b)
+00094                     return true;
+00095                 return false;
+00096             }
+00097         }
+00098 
+00099         return false;
+00100     }
+00101     
+00102     bool operator>(const PyFitness& other) const 
+00103     { 
+00104         return other.operator<(*this);
+00105     }
+00106     
+00107     void printOn(std::ostream& os) const { const boost::python::object& o = *this; boost::python::api::operator<<(os,o); }
+00108     friend std::ostream& operator<<(std::ostream& os, const PyFitness& p) { p.printOn(os); return os;  }
+00109     friend std::istream& operator>>(std::istream& is, PyFitness& p) { boost::python::object o; is >> o; p = o; return is; }
+00110 };
+00111 
+00112 struct PyEO : public EO< PyFitness  >
+00113 {  
+00114     typedef PyFitness Fitness;
+00115     
+00116     boost::python::object getFitness() const { return invalid()? Fitness(): fitness(); }
+00117     void setFitness(boost::python::object f) { if (f == Fitness()) invalidate(); else fitness(f); }
+00118 
+00119     boost::python::object getGenome() const { return genome; }
+00120     void setGenome(boost::python::object g) { genome = g; }
+00121     boost::python::object genome;
+00122     
+00123     std::string to_string() const
+00124     {
+00125         std::string result;
+00126         result += boost::python::extract<const char*>(boost::python::str(getFitness()));
+00127         result += ' ';
+00128         result += boost::python::extract<const char*>(boost::python::str(genome));
+00129         return result;
+00130     }
+00131 
+00132     bool operator<(const PyEO& other) const { return EO<Fitness>::operator<(other); }
+00133     bool operator>(const PyEO& other) const { return EO<Fitness>::operator>(other); }
+00134 
+00135 };
+00136 
+00137 std::ostream& operator<<(std::ostream& os, const PyEO& _eo);
+00138 
+00139 struct PyEO_pickle_suite : boost::python::pickle_suite
+00140 {
+00141     typedef PyEO::Fitness Fitness;
+00142     
+00143     static
+00144     boost::python::tuple getstate(const PyEO& _eo)
+00145     {
+00146         return boost::python::make_tuple(_eo.getFitness(), _eo.genome);
+00147     }
+00148     static
+00149     void setstate(PyEO& _eo, boost::python::tuple pickled)
+00150     {
+00151         _eo.setFitness( Fitness(pickled[0]) );
+00152         _eo.genome = pickled[1];
+00153     }
+00154 };
+00155 
+00156 #endif
+
Generated on Thu Oct 19 05:06:42 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_r_e_a_d_m_e-source.html b/trunk/paradiseo-eo/doc/html/_r_e_a_d_m_e-source.html new file mode 100644 index 000000000..40873eadb --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_r_e_a_d_m_e-source.html @@ -0,0 +1,115 @@ + + +EO: README Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

README

00001                       EO README FILE
+00002 =======================================================================
+00003          check latest news at http://eodev.sourceforge.net/
+00004 =======================================================================
+00005 
+00006 Welcome to EO, the Evolving Objects library.
+00007 
+00008 The latest news about EO can be found on the sourceforge repository at
+00009 
+00010 http://eodev.sourceforge.net/
+00011 
+00012 In case of any problem, please e-mail us at
+00013 
+00014 eodev@egroups.com, eodev-main@lists.sourceforge.net
+00015 
+00016 
+00017 ==================================================================
+00018                       BUILDING EO
+00019 ==================================================================
+00020 The basic installation procedure goes the following:
+00021 
+00022 Go to your build-directory and run 
+00023     $(SRCDIR)/configure
+00024     make
+00025     make check
+00026     make install
+00027 where $(SRCDIR) is the top-level source directory of EO, i.e. where
+00028 the sources where unpacked.
+00029 
+00030 See $(SRCDIR)/configure for possible options. You can specify to not
+00031 build example applications, the tutorial, or to build the ParadisEO
+00032 tutorial. You may also change the installation directory that way.
+00033 
+00034 Now you should probably go to the tutorial and start learning about EO
+00035 features and programming.
+00036 
+00037 
+00038 In case of problems, you can read the INSTALL file - but remember this
+00039 is a standard installation file from GNU and that it contains nothing
+00040 specific about EO.
+00041 
+00042 
+00043 ===================================================================
+00044                        DIRECTORY STRUCTURE
+00045 ===================================================================
+00046 After unpacking the archive file, you should end up with the following
+00047 structure:
+00048 
+00049 .../                            the MAIN EO dir, created when unpacking
+00050    |
+00051    +-- src                    SOURCE dir. Contains most EO .h files
+00052    |   |
+00053    |   +- utils          general utilities (e.g. RNG-related source files)
+00054    |   |
+00055    |   +- ga             bistring-genotypes source files
+00056    |   |
+00057    |   +- es             real-valued-genotypes source files  
+00058    |   |
+00059    |   +- gp             Genetic Programming source files
+00060    |   |
+00061    |   +- obsolete       files from old versions - for upward compatibility
+00062    |
+00063    |
+00064    |
+00065    +-- tutorial               TUTORIAL dir (indeed :-)
+00066    |   |
+00067    |   +- html           all html files - start by browsing index.html
+00068    |   | 
+00069    |   +- LessonX        for X=1, 2, 3, ... : example of increasing complexity
+00070    | 
+00071    |
+00072    |
+00073    +-- doc                    DOCUMENTATION dir (generated by Doxygen)
+00074    |   |
+00075    |   +- html             HTML files - start at index.html (see also tutorial)
+00076    |   |
+00077    |   +- latex            latex files - use to generate Poatscript doc.
+00078    |   |
+00079    |   +- man              Unix man format documentation
+00080    |
+00081    |
+00082    +-- test                   TEST files - for debugging purposes only
+00083    |
+00084    |
+00085    +-- app                    APPLICATIONS - one dir per separate application
+00086    |   |
+00087    |   +- gprop            GA/backpropagation for neural nets 
+00088    |   |
+00089    |   +- mastermind       the wellknown MasterMind game
+00090    |
+00091    |
+00092    +-- win                    WINDOWS dir: project files for MS/VC5+
+00093 
+00094 
+00095 
+00096 ===================================================================
+00097               NOTES
+00098 ===================================================================
+00099 If you extracted a fresh snapshot from the cvs-repository, remember
+00100 to run
+00101     ./autogen.sh
+00102 in the source-directory before building the libraries.
+
Generated on Thu Oct 19 05:06:42 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_r_e_a_d_m_e_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_r_e_a_d_m_e_8cpp-source.html new file mode 100644 index 000000000..26d07b64c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_r_e_a_d_m_e_8cpp-source.html @@ -0,0 +1,379 @@ + + +EO: README.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / sym
+

README.cpp

00001 
+00002 /* 
+00003         DESCRIPTION:
+00004 
+00005 
+00006 The class 'Sym' in this package provides a reference counted, hashed tree structure that can be used in genetic programming.
+00007 The hash table behind the scenes makes sure that every subtree in the application is stored only once.
+00008 This has a couple of advantages:
+00009 
+00010 o Memory: all subtrees are stored only once
+00011 o Comparison: comparison for equality for two subtrees boils down to a pointer comparison 
+00012 o Overview: by accessing the hashtable, you get an instant overview of the state of the population
+00013 
+00014 
+00015 The disadvantage of this method is the constant time overhead for computing hashes. In practice,
+00016 it seems to be fast enough.
+00017 
+00018 
+00019 ===== How to Use this =========
+00020 
+00021 In essence, the Sym data structure contains two important pieces of data,
+00022 the 'token' (of type token_t = int) and the children, a vector of Sym (called SymVec).
+00023 The token should contain all information to be able to figure out which 
+00024 function/terminal is represented by the node in the tree. By retrieving this token value
+00025 and the SymVec it is possible to write recursive traversal routines for evaluation, printing,
+00026 etc.
+00027 
+00028 */
+00029 
+00030 #include <iostream>
+00031 #include "Sym.h"
+00032 
+00033 using namespace std;
+00034 
+00035 
+00036 /* 
+00037  * Suppose token value '0' designates our terminal, and token value '1' designates a binary function.
+00038  * Later on a ternary function will be used as well, designated with token value '2'
+00039  * The function below will create a tree of size three
+00040 */
+00041 Sym test1() {
+00042     
+00043     SymVec children; 
+00044     children.push_back( Sym(0) ); // push_back is a member from std::vector, SymVec is derived from std::vector
+00045     children.push_back( Sym(0) );
+00046 
+00047     Sym tree = Sym(token_t(1), children); // creates the tree
+00048 
+00049     /* Done, now print some information about the node */
+00050 
+00051     cout << "Size      =  " << tree.size() << endl;     // prints 3
+00052     cout << "Depth     = " << tree.depth() << endl;    // prints 2
+00053     cout << "Refcount  = " << tree.refcount() << endl; // prints 1
+00054 
+00055     Sym tree2 = tree; // make a copy (this only changes refcount)
+00056 
+00057     cout << "Refcount now = " << tree.refcount() << endl; // print 2
+00058     
+00059     return tree; // tree2 will be deleted and reference count returns to 1
+00060 }
+00061 
+00062 /* To actually use the tree, evaluate it, the following simple recursive function
+00063  * can be used
+00064 */
+00065 
+00066 int eval(const Sym& sym) {
+00067     if (sym.token() == 0) { // it's a terminal in this example
+00068         return 1;
+00069     }
+00070     // else it's the function
+00071     const SymVec& children = sym.args(); // get the children out, children.size() is the arity
+00072 
+00073     // let's assume that we've also got a ternary function designated by token '2'
+00074     
+00075     if (sym.token() == token_t(1))
+00076         return eval(children[0]) + eval(children[1]); // evaluate
+00077 
+00078     return eval(children[0]) + eval(children[1]) * eval(children[2]); // a ternary function
+00079 }
+00080 
+00081 /* Note that you simply use the stored token that was defined above. Simply checking the size of SymVec in
+00082  * this particular example could have sufficed, but it's instructive to use the tokens.
+00083  * 
+00084  * And to test this: 
+00085 */
+00086 
+00087 void test_eval() {
+00088     
+00089     Sym tree = test1();
+00090 
+00091     cout << "Evaluating tree1 returns " << eval(tree) << endl;
+00092 }
+00093 
+00094 /* Writing initialization functions.
+00095  *
+00096  * As the Sym class is recursive in nature, initialization can simply be done using 
+00097  * recursive routines as above. As an example, the following code does 'full' initialization.
+00098  */
+00099 
+00100 Sym init_full(int depth_left) {
+00101     if (depth_left == 0) return Sym(0); // create terminal
+00102     // else create either a binary or a ternary function
+00103     
+00104     depth_left--;
+00105     
+00106     if (rand() % 2 == 0) { // create binary
+00107         SymVec vec(2);
+00108         vec[0] = init_full(depth_left);
+00109         vec[1] = init_full(depth_left);
+00110 
+00111         return Sym(token_t(1), vec);
+00112         
+00113     } else { // create ternary tree
+00114         SymVec vec(3);
+00115         vec[0] = init_full(depth_left);
+00116         vec[1] = init_full(depth_left);
+00117         vec[2] = init_full(depth_left);
+00118 
+00119         return Sym(token_t(2), vec); // token value 2 designates a ternary now, even though the arity can simply be read from the size of the 'SymVec'
+00120     }
+00121     
+00122 }
+00123 
+00124 
+00125 /* Examining the hash table.
+00126  *
+00127  * The hash table is a static member of the Sym class, but can be obtained and inspected
+00128  * at any point during the run. The hash table follows the SGI implementation of hashmap (and effectively
+00129  * uses it in gcc). An example:
+00130  */
+00131 
+00132 void inspect_hashtable() {
+00133     SymMap& dag = Sym::get_dag(); // get the hashmap
+00134     unsigned i = 0;
+00135     for (SymMap::iterator it = dag.begin(); it != dag.end(); ++it) {
+00136         Sym node(it); // initialize a 'sym' with the iterator 
+00137 
+00138         cout << "Node " << i++ << " size " << node.size();
+00139         cout << " refcount " << node.refcount()-1; // -1: note that by creating the Sym above the refcount is increased
+00140         cout << " depth " << node.depth();
+00141         cout << '\n';
+00142     }
+00143     
+00144 }
+00145 
+00146 /* The above code effectively examines all distinct subtrees in use in the application and prints some stats for the node */
+00147 
+00148 /* Manipulating trees 
+00149  *
+00150  * The Sym class is set up in such a way that you cannot change a Sym, so how do you perform crossover and mutation?
+00151  *
+00152  * Simple, you create new syms. The Sym class supports two functions to make this easier: 'get_subtree' and 'insert_subtree'.
+00153  * These traverse the tree by index, where 0 designates the root and other values are indexed depth first.
+00154  */
+00155 
+00156 Sym subtree_xover(Sym a, Sym b) {
+00157     
+00158     Sym to_insert = get_subtree(a,  rand() % a.size() ); // select random subtree, will crash if too high a value is given
+00159     
+00160     /* 'insert' it into b. This will not really insert, it will however create a new sym,
+00161      * equal to 'b' but with a's subtree inserted at the designated spot. */
+00162     return insert_subtree(b, rand() % b.size(), to_insert); 
+00163     
+00164 }
+00165 
+00166 /* Tying it together, we can create a simple genetic programming system. Mutation is not implemented here,
+00167  * but would be easy enough to add by using recursion and/or 'set'. */
+00168 
+00169 void run_gp() {
+00170     
+00171     int ngens = 50;
+00172     int popsize = 1000;
+00173 
+00174     cout << "Starting running " << popsize << " individuals for " << ngens << " generations." << endl;
+00175     
+00176     vector<Sym> pop(popsize); 
+00177     
+00178     // init population
+00179     for (unsigned i = 0; i < pop.size(); ++i) {
+00180         pop[i] = init_full(5); 
+00181     }
+00182     
+00183     double best = 0.0;
+00184     
+00185     // do a very simple steady state tournament 
+00186     for (unsigned gen = 0; gen < ngens * pop.size(); ++gen) {
+00187         int sel1 = rand()% pop.size();
+00188         int sel2 = rand() % pop.size();
+00189         int sel3 = rand() % pop.size();
+00190 
+00191         double ev1 = eval(pop[sel1]);
+00192         double ev3 = eval(pop[sel3]);
+00193         
+00194         double bst = max(ev1,ev3);
+00195         if (bst > best) {
+00196             best = bst;
+00197         }
+00198         
+00199         if (ev3 > ev1) {
+00200             sel1 = sel3; // selection pressure
+00201         }
+00202 
+00203         Sym child = subtree_xover(pop[sel1], pop[sel2]);
+00204         
+00205         // Check for uniqueness
+00206         if (child.refcount() == 1) pop[ rand() % pop.size() ] = child;
+00207     }
+00208     
+00209     // and at the end:
+00210     
+00211     inspect_hashtable();
+00212 
+00213     // and also count number of nodes in the population
+00214     int sz = 0;
+00215     for (unsigned i = 0; i < pop.size(); ++i) { sz += pop[i].size(); }
+00216     cout << "Number of distinct nodes " << Sym::get_dag().size() << endl;
+00217     cout << "Nodes in population      " << sz << endl;
+00218     cout << "ratio                    " << double(Sym::get_dag().size())/sz << endl;
+00219     cout << "Best fitness             " << best << endl;
+00220     
+00221 }
+00222 
+00223 /* One extra mechanism is supported to add annotations to nodes. Something derived from
+00224  * 'UniqueNodeStats' can be used to attach new information to nodes. For this to function,
+00225  * we need to supply a 'factory' function that creates these node-stats; attach this function to the 
+00226  * Sym class, so that it gets called whenever a new node is created. The constructors of the Sym class
+00227  * take care of this.
+00228  *
+00229  * IMPORTANT: 
+00230  *      in a realistic application, the factory function needs to be set BEFORE any Syms are created
+00231  *      Mixing Syms creating with and without the factory can lead to unexpected results    
+00232  *
+00233  * First we derive some structure from UniqueNodeStats: */
+00234 
+00235 struct MyNodeStats : public UniqueNodeStats {
+00236     
+00237     int sumsize;
+00238     
+00239     ~MyNodeStats() { cout << "MyNodeStats::~MyNodeStats, sumsize = " << sumsize << endl; }
+00240 };
+00241 
+00242 /* then define the factory function. It will get a Sym, which is just created.  */
+00243 UniqueNodeStats* create_stats(const Sym& sym) {
+00244     MyNodeStats* stats = new MyNodeStats; // Sym will take care of memory management
+00245     
+00246     int sumsize = sym.size();
+00247     for (unsigned i = 0; i < sym.args().size(); ++i) {
+00248         // retrieve the extra node stats of the child
+00249         UniqueNodeStats* unique_stats = sym.args()[i].extra_stats(); // extra_stats retrieves the stats
+00250         MyNodeStats* child_stats = static_cast<MyNodeStats*>(unique_stats); // cast it to the right struct
+00251         sumsize += child_stats->sumsize;
+00252     }
+00253     
+00254     stats->sumsize = sumsize;
+00255     return stats; // now it will get attached to the node and deleted when its reference count goes to zero
+00256 }
+00257 
+00258 void test_node_stats() {
+00259     
+00260     if (Sym::get_dag().size() != 0) {
+00261         cerr << "Cannot mix nodes with and without factory functions" << endl;
+00262         exit(1);
+00263     }
+00264     
+00265     /* Very Important: attach the factory function to the Sym class */
+00266     Sym::set_factory_function(create_stats);
+00267 
+00268     Sym tree = init_full(5); // create a tree
+00269     
+00270     // get extra node stats out
+00271     MyNodeStats* stats = static_cast<MyNodeStats*>( tree.extra_stats() );
+00272 
+00273     cout << "Size = " << tree.size() << " SumSize = " << stats->sumsize << endl;
+00274     
+00275     Sym::clear_factory_function(); // reset
+00276 }
+00277 
+00278 
+00279 /* And run the code above */
+00280 
+00281 int main() {
+00282     srand(time(0));
+00283     cout << "********** TEST EVALUATION **************\n";
+00284     test_eval();
+00285     cout << "********** TEST ALGORITHM ***************\n";
+00286     run_gp();
+00287 
+00288     cout << "********** TEST FACTORY  ****************\n";
+00289     test_node_stats(); // can work because there are no live nodes
+00290 
+00291 }
+00292 
+00293 /* ********** Member function reference: ********************
+00294  *
+00295  * Sym()            The default constructor will create an undefined node (no token and no children), check for empty() to see if a node is undefined
+00296  * 
+00297  * Sym(token_t)     Create a terminal
+00298  *
+00299  * Sym(token_t, const SymVec&)
+00300  *                  Create a node with token and SymVec as the children
+00301  * 
+00302  * Sym(SymIterator it)
+00303  *                  Create a sym from an iterator (taken from the hashtable directly, or from Sym::iterator)
+00304  *
+00305  * dtor, copy-ctor and assignment
+00306  *
+00307  * UniqueNodeStats* extra_stats()    
+00308  *                  Returns an UniqueNodeStats pointer (= 0 if no factory is defined)
+00309  * 
+00310  * 
+00311  * int hashcode()   returns the hashcode for the node
+00312  * 
+00313  * int refcount()   returns the reference count for the node
+00314  * 
+00315  * bool operator==  checks for equality (note that this is a pointer compare, really really fast)
+00316  * 
+00317  * bool empty()     returns whether the node is undefined, i.e. created through the default ctor 
+00318  * 
+00319  * int arity()      shorthand for sym.args().size()
+00320  * 
+00321  * token_t token()  return identifying token for the node
+00322  * 
+00323  * const SymVec& args()
+00324  *                  returns the children of the node (in a vector<Sym>)
+00325  *                  
+00326  * unsigned size()  returns the size, i.e., number of nodes
+00327  * 
+00328  * unsigned depth() returns the depth
+00329  * 
+00330  * iterator()       returns the pointer to the node in the hashtable
+00331  *
+00332  * 
+00333  ********** Static functions: ********************
+00334  *
+00335  *
+00336  * 
+00337  * SymMap& get_dag()    returns the hash table containing all nodes. This should only be used for inspection,
+00338  *                      even though the dag itself is not const. This to enable the use of the ctor Sym(SymIterator) to inspect
+00339  *                      using the Sym interface (rather than the hash table interface). This does allow you to make destructive
+00340  *                      changes to the class, so use with care
+00341  *
+00342  * set_factory_function( UniqueNodeStats (*)(const Sym&) )
+00343  *                      Set the factory function
+00344  *
+00345  *  clear_factory_function()    
+00346  *                      Clears the factory function, allocated UniqueNodeStats will still be deleted, but no new ones will be created.
+00347  *
+00348  ********** Utility Functions ******************** 
+00349  * 
+00350  * Sym get_subtree(const Sym& org, int i)
+00351  *                      Retreive the i-th subtree from the Sym. Standard depth first ordering, where root has index 0 and the
+00352  *                      rightmost terminal has index sym.size()-1
+00353  *
+00354  * Sym insert_subtree(const Sym& org, int i, const Sym& subtree)
+00355  *                      Returns a Sym that is equal to 'org', for which the i-th subtree (same ordering as get_subtree) is replaced
+00356  *                      by the third argument subtree.
+00357  * 
+00358  * Sym next(const Sym&)
+00359  *                      Returns the successor of the argument sym from the hashtable with wrap around. This is implemented just because
+00360  *                      it can be done. It may be an interesting way to mutate...
+00361  * 
+00362  * */
+00363 
+00364 
+
Generated on Thu Oct 19 05:06:42 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_real_e_a_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_real_e_a_8cpp-source.html new file mode 100644 index 000000000..000c93bdf --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_real_e_a_8cpp-source.html @@ -0,0 +1,79 @@ + + +EO: RealEA.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Lesson4
+

RealEA.cpp

00001 #include <iostream>
+00002 
+00003 #include <es/make_real.h>
+00004 #include "real_value.h"
+00005 #include <apply.h>
+00006 
+00007 using namespace std;
+00008 
+00009 int main(int argc, char* argv[])
+00010 {
+00011 
+00012   try
+00013   {
+00014   typedef eoReal<eoMinimizingFitness> EOT;
+00015 
+00016   eoParser parser(argc, argv);  // for user-parameter reading
+00017 
+00018   eoState state;    // keeps all things allocated
+00019 
+00022 
+00023   // The evaluation fn - encapsulated into an eval counter for output 
+00024   eoEvalFuncPtr<EOT, double, const std::vector<double>&> 
+00025                mainEval( real_value );
+00026   eoEvalFuncCounter<EOT> eval(mainEval);
+00027 
+00028   // the genotype - through a genotype initializer
+00029   eoRealInitBounded<EOT>& init = make_genotype(parser, state, EOT());
+00030 
+00031   // Build the variation operator (any seq/prop construct)
+00032   eoGenOp<EOT>& op = make_op(parser, state, init);
+00033 
+00036 
+00037   // initialize the population - and evaluate
+00038   // yes, this is representation indepedent once you have an eoInit
+00039   eoPop<EOT>& pop   = make_pop(parser, state, init);
+00040 
+00041   // stopping criteria
+00042   eoContinue<EOT> & term = make_continue(parser, state, eval);
+00043   // output
+00044   eoCheckPoint<EOT> & checkpoint = make_checkpoint(parser, state, eval, term);
+00045   // algorithm (need the operator!)
+00046   eoAlgo<EOT>& ea = make_algo_scalar(parser, state, eval, checkpoint, op);
+00047 
+00050   // to be called AFTER all parameters have been read!!!
+00051   make_help(parser);
+00052 
+00055   // evaluate intial population AFTER help and status in case it takes time
+00056   apply<EOT>(eval, pop);
+00057   // print it out
+00058   cout << "Initial Population\n";
+00059   pop.sortedPrintOn(cout);
+00060   cout << endl;
+00061 
+00062   run_ea(ea, pop); // run the ea
+00063 
+00064   cout << "Final Population\n";
+00065   pop.sortedPrintOn(cout);
+00066   cout << endl;
+00067   }
+00068   catch(exception& e)
+00069   {
+00070     cout << e.what() << endl;
+00071   }
+00072 }
+
Generated on Thu Oct 19 05:06:42 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_royal_road_8h-source.html b/trunk/paradiseo-eo/doc/html/_royal_road_8h-source.html new file mode 100644 index 000000000..b7c19c038 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_royal_road_8h-source.html @@ -0,0 +1,74 @@ + + +EO: RoyalRoad.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+test
+

RoyalRoad.h

00001 /*
+00002    RoyalRoad.h
+00003    -- Implementation of the Royal Road function for any length and block size
+00004    (c) GeNeura Team 2001, Marc Schoenauer 2000
+00005 
+00006     This library is free software; you can redistribute it and/or
+00007     modify it under the terms of the GNU Lesser General Public
+00008     License as published by the Free Software Foundation; either
+00009     version 2 of the License, or (at your option) any later version.
+00010 
+00011     This library is distributed in the hope that it will be useful,
+00012     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00013     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00014     Lesser General Public License for more details.
+00015 
+00016     You should have received a copy of the GNU Lesser General Public
+00017     License along with this library; if not, write to the Free Software
+00018     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00019 
+00020     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00021              Marc.Schoenauer@polytechnique.fr
+00022 CVS Info: $Date: 2001/06/21 12:03:17 $ $Header: /cvsroot/eodev/eo/test/RoyalRoad.h,v 1.3 2001/06/21 12:03:17 jmerelo Exp $ $Author: jmerelo $
+00023 */
+00024 
+00025 #ifndef RoyalRoad_h
+00026 #define RoyalRoad_h
+00027 
+00028 template<class EOT>
+00029 class RoyalRoad: public eoEvalFunc<EOT> {
+00030 
+00031  public:
+00032 
+00033   typedef typename EOT::Fitness FitT;
+00034 
+00036   RoyalRoad( unsigned _div ): eoEvalFunc<EOT >(), div( _div ) {};
+00037 
+00038   // Applies the function
+00039   virtual void operator() ( EOT & _eo )  {
+00040         FitT fitness = 0;
+00041     if (_eo.invalid()) {
+00042           for ( unsigned i = 0; i < _eo.size()/div; i ++ ) {
+00043                 bool block = true;
+00044                 for ( unsigned j = 0; j < div; j ++ ) {
+00045                   block &= _eo[i*div+j];
+00046                 }
+00047                 if (block) {
+00048                   fitness += div;
+00049                 }
+00050           }
+00051           _eo.fitness( fitness );
+00052         }
+00053   };
+00054         
+00055   private:
+00056         unsigned div;
+00057 
+00058 };
+00059 
+00060 #endif
+
Generated on Thu Oct 19 05:06:42 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_scaling_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_scaling_8cpp-source.html new file mode 100644 index 000000000..8870ceaa7 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_scaling_8cpp-source.html @@ -0,0 +1,432 @@ + + +EO: Scaling.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / regression
+

Scaling.cpp

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #include "Scaling.h"
+00019 #include "TargetInfo.h"
+00020 
+00021 using namespace std;
+00022 
+00023 Scaling slope(const std::valarray<double>& x, const TargetInfo& targets) {
+00024     
+00025     double xx = 0.0;
+00026     double xy = 0.0;
+00027     
+00028     const valarray<double>& y = targets.targets();
+00029     
+00030     for (unsigned i = 0; i < x.size(); ++i) {
+00031         xx += x[i] * x[i];
+00032         xy += x[i] * y[i];
+00033     }
+00034     
+00035     if (xx < 1e-7) return Scaling(new LinearScaling(0.0,0.0));
+00036     
+00037     double b = xy / xx;
+00038    
+00039     return Scaling(new LinearScaling(0.0, b));
+00040     
+00041 }
+00042 
+00043 // Still needs proper testing with non-trivial lambda
+00044 Scaling regularized_least_squares(const std::valarray<double>& inputs, const TargetInfo& targets, double lambda) {
+00045     
+00046     double n = inputs.size();
+00047     
+00048     valarray<double> x = inputs;
+00049 
+00050     double a,b,d;
+00051     a=b=d=0;
+00052 
+00053     for (unsigned i = 0; i < n; ++i) {
+00054         a += 1 + lambda;
+00055         b += x[i];
+00056         d += x[i] * x[i] + lambda;
+00057     }
+00058     
+00059     //invert
+00060     
+00061     double ad_bc = a*d - b * b;
+00062     // if ad_bc equals zero there's a problem
+00063    
+00064     if (ad_bc < 1e-17) return Scaling(new LinearScaling);
+00065     
+00066     double ai = d/ad_bc;
+00067     double bi = -b/ad_bc;
+00068     double di = a/ad_bc;
+00069     double ci = bi;
+00070     
+00071     // Now multiply this inverted covariance matrix (C^-1) with x' * t
+00072     
+00073     std::valarray<double> ones = x;
+00074     
+00075     // calculate C^-1 * x' )
+00076     for (unsigned i = 0; i < n; ++i) 
+00077     {
+00078         ones[i] = (ai + bi * x[i]);
+00079         x[i]    = (ci + di * x[i]);
+00080     }
+00081 
+00082     // results are in [ones, x], now multiply with y
+00083 
+00084     a = 0.0; // intercept
+00085     b = 0.0; // slope
+00086     
+00087     const valarray<double>& t = targets.targets();
+00088     
+00089     for (unsigned i = 0; i < n; ++i)
+00090     {
+00091         a += ones[i] * t[i];
+00092         b += x[i] * t[i];
+00093     }
+00094     
+00095     return Scaling(new LinearScaling(a,b));
+00096 }
+00097 
+00098 Scaling ols(const std::valarray<double>& y, const std::valarray<double>& t) {
+00099     double n = y.size();
+00100     
+00101     double y_mean = y.sum() / n;
+00102     double t_mean = t.sum() / n;
+00103    
+00104     std::valarray<double> y_var = (y - y_mean);
+00105     std::valarray<double> t_var = (t - t_mean);
+00106     std::valarray<double> cov = t_var * y_var;
+00107     
+00108     y_var *= y_var;
+00109     t_var *= t_var;
+00110     
+00111     double sumvar = y_var.sum();
+00112     
+00113     if (sumvar == 0. || sumvar/n < 1e-7 || sumvar/n > 1e+7) // breakout when numerical problems are likely
+00114         return Scaling(new LinearScaling(t_mean,0.));
+00115 
+00116     
+00117     double b = cov.sum() / sumvar;
+00118     double a = t_mean - b * y_mean;
+00119     
+00120     Scaling s = Scaling(new LinearScaling(a,b));
+00121 
+00122     return s;
+00123 }
+00124 
+00125 Scaling ols(const std::valarray<double>& y, const TargetInfo& targets) {
+00126     double n = y.size();
+00127     
+00128     double y_mean = y.sum() / n;
+00129     
+00130     std::valarray<double> y_var = (y - y_mean);
+00131     std::valarray<double> cov = targets.tcov_part() * y_var;
+00132     
+00133     y_var *= y_var;
+00134 
+00135     double sumvar = y_var.sum();
+00136     
+00137     if (sumvar == 0. || sumvar/n < 1e-7 || sumvar/n > 1e+7) // breakout when numerical problems are likely
+00138         return Scaling(new LinearScaling(targets.tmean(),0.));
+00139 
+00140     
+00141     double b = cov.sum() / sumvar;
+00142     double a = targets.tmean() - b * y_mean;
+00143     
+00144     if (!finite(b)) {
+00145         
+00146         cout << a << ' ' << b << endl;
+00147         cout << sumvar << endl;
+00148         cout << y_mean << endl;
+00149         cout << cov.sum() << endl;
+00150         exit(1);
+00151     }
+00152         
+00153     Scaling s = Scaling(new LinearScaling(a,b));
+00154 
+00155     return s;
+00156 }
+00157 
+00158 
+00159 Scaling wls(const std::valarray<double>& inputs, const TargetInfo& targets) {
+00160     
+00161     std::valarray<double> x = inputs;
+00162     const std::valarray<double>& w = targets.weights();
+00163     
+00164     unsigned n = x.size();
+00165     // First calculate x'*W (as W is a diagonal matrix it's simply elementwise multiplication
+00166     std::valarray<double> wx = targets.weights() * x;
+00167     
+00168     // Now x'*W is contained in [w,wx], calculate x' * W * x (the covariance)
+00169     double a,b,d;
+00170     a=b=d=0.0;
+00171     
+00172     for (unsigned i = 0; i < n; ++i)
+00173     {
+00174         a += w[i];
+00175         b += wx[i];
+00176         d += x[i] * wx[i];
+00177     }
+00178  
+00179     //invert
+00180     
+00181     double ad_bc = a*d - b * b;
+00182     // if ad_bc equals zero there's a problem
+00183    
+00184     if (ad_bc < 1e-17) return Scaling(new LinearScaling);
+00185     
+00186     double ai = d/ad_bc;
+00187     double bi = -b/ad_bc;
+00188     double di = a/ad_bc;
+00189     double ci = bi;
+00190     
+00191     // Now multiply this inverted covariance matrix (C^-1) with x' * W * y
+00192     
+00193     // create alias to reuse the wx we do not need anymore
+00194     std::valarray<double>& ones = wx;
+00195     
+00196     // calculate C^-1 * x' * W (using the fact that W is diagonal)
+00197     for (unsigned i = 0; i < n; ++i) 
+00198     {
+00199         ones[i] = w[i]*(ai + bi * x[i]);
+00200         x[i]    = w[i]*(ci + di * x[i]);
+00201     }
+00202 
+00203     // results are in [ones, x], now multiply with y
+00204 
+00205     a = 0.0; // intercept
+00206     b = 0.0; // slope
+00207     
+00208     const valarray<double>& t = targets.targets();
+00209     
+00210     for (unsigned i = 0; i < n; ++i)
+00211     {
+00212         a += ones[i] * t[i];
+00213         b += x[i] * t[i];
+00214     }
+00215     
+00216     return Scaling(new LinearScaling(a,b));
+00217 }
+00218 
+00219 
+00220 //Scaling med(const std::valarray<double>& inputs, const TargetInfo& targets);
+00221 
+00222 double mse(const std::valarray<double>& y, const TargetInfo& t) {
+00223 
+00224     valarray<double> residuals = t.targets()-y;
+00225     residuals *= residuals;
+00226     double sz = residuals.size();
+00227     if (t.has_weights()) {
+00228         residuals *= t.weights();
+00229         sz = 1.0;
+00230     }
+00231         
+00232     return residuals.sum() / sz;
+00233 }
+00234 
+00235 double rms(const std::valarray<double>& y, const TargetInfo& t) {
+00236     return sqrt(mse(y,t));
+00237 }
+00238     
+00239 double mae(const std::valarray<double>& y, const TargetInfo& t) {
+00240     valarray<double> residuals = abs(t.targets()-y);
+00241     if (t.has_weights()) residuals *= t.weights();
+00242     return residuals.sum() / residuals.size();
+00243 }
+00244 
+00245 
+00246 /*
+00247     double standard_error(const std::valarray<double>& y, const std::pair<double,double>& scaling) {
+00248         double a = scaling.first;
+00249         double b = scaling.second;
+00250         double n = y.size();
+00251         double se = sqrt( pow(a+b*y-current_set->targets,2.0).sum() / (n-2));
+00252         
+00253         double mean_y = y.sum() / n;
+00254         double sxx = pow( y - mean_y, 2.0).sum();
+00255 
+00256         return se / sqrt(sxx);
+00257     }
+00258   
+00259     double scaled_mse(const std::valarray<double>& y){
+00260         std::pair<double,double> scaling;
+00261         return scaled_mse(y,scaling);
+00262     }
+00263     
+00264     double scaled_mse(const std::valarray<double>& y, std::pair<double, double>& scaling)
+00265     {
+00266         scaling = scale(y);
+00267         
+00268         double a = scaling.first;
+00269         double b = scaling.second;
+00270         
+00271         std::valarray<double> tmp = current_set->targets - a - b * y;
+00272         tmp *= tmp;
+00273         
+00274         if (weights.size())
+00275             return (weights * tmp).sum();
+00276 
+00277         return tmp.sum() / tmp.size();
+00278     }
+00279    
+00280     double robust_mse(const std::valarray<double>& ny, std::pair<double, double>& scaling) {
+00281         
+00282         double smse = scaled_mse(ny,scaling);
+00283 
+00284         std::valarray<double> y = ny;
+00285         // find maximum covariance case 
+00286         double n = y.size();
+00287 
+00288         int largest = 0;
+00289         
+00290         {
+00291             double y_mean = y.sum() / n;
+00292         
+00293             std::valarray<double> y_var = (y - y_mean);
+00294             std::valarray<double> cov = tcov * y_var;
+00295         
+00296             std::valarray<bool> maxcov = cov == cov.max();
+00297         
+00298             for (unsigned i = 0; i < maxcov.size(); ++i) {
+00299                 if (maxcov[i]) {
+00300                     largest = i;
+00301                     break;
+00302                 }
+00303             }
+00304         }
+00305         
+00306         double y_mean = (y.sum() - y[largest]) / (n-1);
+00307         y[largest] = y_mean; // dissappears from covariance calculation
+00308         
+00309         std::valarray<double> y_var = (y - y_mean);
+00310         std::valarray<double> cov = tcov * y_var;
+00311         y_var *= y_var;
+00312 
+00313         double sumvar = y_var.sum();
+00314         
+00315         if (sumvar == 0. || sumvar/n < 1e-7 || sumvar/n > 1e+7) // breakout when numerical problems are likely
+00316             return worst_performance();
+00317         
+00318         double b = cov.sum() / sumvar;
+00319         double a = tmean - b * y_mean;
+00320         
+00321         std::valarray<double> tmp = current_set->targets - a - b * y;
+00322         tmp[largest] = 0.0;
+00323         tmp *= tmp;
+00324         
+00325         double smse2 = tmp.sum() / (tmp.size()-1);
+00326         
+00327         static std::ofstream os("smse.txt");
+00328         os << smse << ' ' << smse2 << '\n';
+00329         
+00330         if (smse2 > smse) {
+00331             return worst_performance();
+00332             //std::cerr << "overfit? " << smse << ' ' << smse2 << '\n';
+00333         }
+00334         
+00335         scaling.first = a;
+00336         scaling.second = b;
+00337         
+00338         return smse2;
+00339     }
+00340     
+00341     class Sorter {
+00342         const std::valarray<double>& scores;
+00343         public:
+00344             Sorter(const std::valarray<double>& _scores) : scores(_scores) {}
+00345             
+00346             bool operator()(unsigned i, unsigned j) const {
+00347                 return scores[i] < scores[j];
+00348             }
+00349     };
+00350     
+00351     double coc(const std::valarray<double>& y) {
+00352         std::vector<unsigned> indices(y.size());
+00353         for (unsigned i = 0; i < y.size(); ++i) indices[i] = i;
+00354         std::sort(indices.begin(), indices.end(), Sorter(y));
+00355         
+00356         const std::valarray<double>& targets = current_set->targets;
+00357         
+00358         double neg = 1.0 - targets[indices[0]];
+00359         double pos = targets[indices[0]];
+00360         
+00361         double cumpos = 0;
+00362         double cumneg = 0;
+00363         double sum=0;
+00364         
+00365         double last_score = y[indices[0]];
+00366         
+00367         for(unsigned i = 1; i < targets.size(); ++i) {
+00368                 
+00369             if (fabs(y[indices[i]] - last_score) < 1e-9) { // we call it tied
+00370                 pos += targets[indices[i]];
+00371                 neg += 1.0 - targets[indices[i]];
+00372                 
+00373                 if (i < targets.size()-1)
+00374                     continue;
+00375             }
+00376             sum += pos * cumneg + (pos * neg) * 0.5;
+00377             cumneg += neg;
+00378             cumpos += pos;
+00379             pos = targets[indices[i]];
+00380             neg = 1.0 - targets[indices[i]];
+00381             last_score = y[indices[i]];
+00382         }
+00383         
+00384         return sum / (cumneg * cumpos);
+00385     }
+00386    
+00387     // iterative re-weighted least squares (for parameters.classification)
+00388     double irls(const std::valarray<double>& scores, std::pair<double,double>& scaling) {
+00389         const std::valarray<double>& t = current_set->targets;
+00390         
+00391         std::valarray<double> e(scores.size());
+00392         std::valarray<double> u(scores.size()); 
+00393         std::valarray<double> w(scores.size());
+00394         std::valarray<double> z(scores.size());
+00395         
+00396         parameters.use_irls = false; parameters.classification=false;
+00397         scaling = scale(scores);
+00398         parameters.use_irls=true;parameters.classification=true;
+00399         
+00400         if (scaling.second == 0.0) return worst_performance(); 
+00401         
+00402         for (unsigned i = 0; i < 10; ++i) {
+00403             e = exp(scaling.first + scaling.second*scores);
+00404             u = e / (e + exp(-(scaling.first + scaling.second * scores)));
+00405             w = u*(1.-u);
+00406             z = (t-u)/w;
+00407             scaling = wls(scores, u, w);
+00408             //double ll = (log(u)*t + (1.-log(u))*(1.-t)).sum();
+00409             //std::cout << "Scale " << i << ' ' << scaling.first << " " << scaling.second << " LL " << 2*ll << std::endl;
+00410         }
+00411 
+00412         // log-likelihood
+00413         u = exp(scaling.first + scaling.second*scores) / (1 + exp(scaling.first + scaling.second*scores));
+00414         double ll = (log(u)*t + (1.-log(u))*(1.-t)).sum();
+00415         return 2*ll;
+00416     }
+00417 */
+
Generated on Thu Oct 19 05:06:42 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_scaling_8h-source.html b/trunk/paradiseo-eo/doc/html/_scaling_8h-source.html new file mode 100644 index 000000000..f083c2c35 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_scaling_8h-source.html @@ -0,0 +1,110 @@ + + +EO: Scaling.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / regression
+

Scaling.h

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #ifndef SCALING_H_
+00019 #define SCALING_H_
+00020 
+00021 #include "shared_ptr.h"
+00022 
+00023 #include <valarray>
+00024 #include <iostream>
+00025 #include <string>
+00026 
+00027 class TargetInfo;
+00028 
+00029 class ScalingBase {
+00030     public:
+00031     
+00032     virtual ~ScalingBase() {}
+00033         
+00034     std::valarray<double> apply(const std::valarray<double>& x) { 
+00035         std::valarray<double> xtmp = x;
+00036         transform(xtmp);
+00037         return xtmp;
+00038     }
+00039         
+00040     virtual double transform(double input) const = 0;
+00041     virtual void transform(std::valarray<double>& inputs) const = 0;
+00042     virtual std::ostream& print(std::ostream& os, std::string str) const = 0;
+00043     virtual std::valarray<double> transform(const std::valarray<double>& inputs) const = 0;
+00044 };
+00045 
+00046 typedef shared_ptr<ScalingBase> Scaling;
+00047 
+00048 class LinearScaling : public ScalingBase {
+00049     
+00050     double a,b;
+00051     
+00052     public:
+00053     LinearScaling() : a(0.0), b(1.0) {}
+00054     LinearScaling(double _a, double _b) : a(_a), b(_b) {}
+00055 
+00056     double transform(double input) const { input *=b; input += a; return input; }
+00057     void transform(std::valarray<double>& inputs) const { inputs *= b; inputs += a; }
+00058     std::valarray<double> transform(const std::valarray<double>& inputs) const { 
+00059         std::valarray<double> y = a + b * inputs;
+00060         return y;
+00061     }
+00062     
+00063     double intercept() const { return a; }
+00064     double slope()     const { return b; }
+00065     
+00066     std::ostream& print(std::ostream& os, std::string str) const {
+00067         os.precision(16);
+00068         os << a << " + " << b << " * " << str;
+00069         return os;
+00070     }
+00071 };
+00072 
+00073 class NoScaling : public ScalingBase{
+00074     void transform(std::valarray<double>&) const {}
+00075     double transform(double input) const { return input; }
+00076     std::valarray<double> transform(const std::valarray<double>& inputs) const { return inputs; }
+00077     std::ostream& print(std::ostream& os, std::string str) const { return os << str; }
+00078 };
+00079 
+00080 extern Scaling slope(const std::valarray<double>& inputs, const TargetInfo& targets); // slope only
+00081 extern Scaling ols(const std::valarray<double>& inputs, const TargetInfo& targets);
+00082 extern Scaling wls(const std::valarray<double>& inputs, const TargetInfo& targets);
+00083 extern Scaling med(const std::valarray<double>& inputs, const TargetInfo& targets);
+00084 
+00085 extern Scaling ols(const std::valarray<double>& inputs, const std::valarray<double>& outputs);
+00086 
+00087 extern double mse(const std::valarray<double>& y, const TargetInfo& t);
+00088 extern double rms(const std::valarray<double>& y, const TargetInfo& t);
+00089 extern double mae(const std::valarray<double>& y, const TargetInfo& t);
+00090 
+00091 // Todo Logistic Scaling
+00092 
+00093 #endif
+00094 
+00095 
+
Generated on Thu Oct 19 05:06:42 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_second_bit_e_a_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_second_bit_e_a_8cpp-source.html new file mode 100644 index 000000000..d0e75d5c1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_second_bit_e_a_8cpp-source.html @@ -0,0 +1,351 @@ + + +EO: SecondBitEA.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Lesson3
+

SecondBitEA.cpp

00001 //-----------------------------------------------------------------------------
+00002 // SecondGA.cpp
+00003 //-----------------------------------------------------------------------------
+00004 //*
+00005 // Same code than FirstBitEA as far as Evolutionary Computation is concerned
+00006 // but now you learn to enter the parameters in a more flexible way
+00007 // and to twidle the output to your preferences!
+00008 //-----------------------------------------------------------------------------
+00009 #ifdef HAVE_CONFIG_H
+00010 #include <config.h>
+00011 #endif
+00012 
+00013 // standard includes
+00014 #include <fstream>
+00015 #include <iostream>   // cout
+00016 #include <stdexcept>  // runtime_error
+00017 
+00018 // the general include for eo
+00019 #include <eo>
+00020 #include <ga.h>
+00021 
+00022 // Use functions from namespace std
+00023 using namespace std;
+00024 
+00025 // EVAL
+00026 #include "binary_value.h"
+00027 
+00028 // REPRESENTATION
+00029 //-----------------------------------------------------------------------------
+00030 // define your genotype and fitness types
+00031 typedef eoBit<double> Indi;
+00032 
+00033 // the main_function: nothing changed(!), except variable initialization
+00034 void main_function(int argc, char **argv)
+00035 {
+00036 // PARAMETRES
+00037 //-----------------------------------------------------------------------------
+00038 // instead of having all values of useful parameters as constants, read them:
+00039 // either on the command line (--option=value or -o=value)
+00040 //     or in a parameter file (same syntax, order independent,
+00041 //                             # = usual comment character
+00042 //     or in the environment (TODO)
+00043 
+00044   // First define a parser from the command-line arguments
+00045     eoParser parser(argc, argv);
+00046 
+00047     // For each parameter, define Parameter, read it through the parser,
+00048     // and assign the value to the variable
+00049 
+00050     eoValueParam<uint32_t> seedParam(time(0), "seed", "Random number seed", 'S');
+00051     parser.processParam( seedParam );
+00052     unsigned seed = seedParam.value();
+00053 
+00054    // description of genotype
+00055     eoValueParam<unsigned int> vecSizeParam(8, "vecSize", "Genotype size",'V');
+00056     parser.processParam( vecSizeParam, "Representation" );
+00057     unsigned vecSize = vecSizeParam.value();
+00058 
+00059    // parameters for evolution engine
+00060     eoValueParam<unsigned int> popSizeParam(10, "popSize", "Population size",'P');
+00061     parser.processParam( popSizeParam, "Evolution engine" );
+00062     unsigned popSize = popSizeParam.value();
+00063 
+00064     eoValueParam<unsigned int> tSizeParam(10, "tSize", "Tournament size",'T');
+00065     parser.processParam( tSizeParam, "Evolution Engine" );
+00066     unsigned tSize = tSizeParam.value();
+00067 
+00068    // init and stop
+00069     eoValueParam<string> loadNameParam("", "Load","A save file to restart from",'L');
+00070     parser.processParam( loadNameParam, "Persistence" );
+00071     string loadName = loadNameParam.value();
+00072 
+00073     eoValueParam<unsigned int> maxGenParam(100, "maxGen", "Maximum number of generations",'G');
+00074     parser.processParam( maxGenParam, "Stopping criterion" );
+00075     unsigned maxGen = maxGenParam.value();
+00076 
+00077     eoValueParam<unsigned int> minGenParam(100, "minGen", "Minimum number of generations",'g');
+00078     parser.processParam( minGenParam, "Stopping criterion" );
+00079     unsigned minGen = minGenParam.value();
+00080 
+00081     eoValueParam<unsigned int> steadyGenParam(100, "steadyGen", "Number of generations with no improvement",'s');
+00082     parser.processParam( steadyGenParam, "Stopping criterion" );
+00083     unsigned steadyGen = steadyGenParam.value();
+00084 
+00085    // operators probabilities at the algorithm level
+00086     eoValueParam<double> pCrossParam(0.6, "pCross", "Probability of Crossover", 'C');
+00087     parser.processParam( pCrossParam, "Genetic Operators" );
+00088     double pCross = pCrossParam.value();
+00089 
+00090     eoValueParam<double> pMutParam(0.1, "pMut", "Probability of Mutation", 'M');
+00091     parser.processParam( pMutParam, "Genetic Operators" );
+00092     double pMut = pMutParam.value();
+00093 
+00094    // relative rates for crossovers
+00095     eoValueParam<double> onePointRateParam(1, "onePointRate", "Relative rate for one point crossover", '1');
+00096     parser.processParam( onePointRateParam, "Genetic Operators" );
+00097     double onePointRate = onePointRateParam.value();
+00098 
+00099     eoValueParam<double> twoPointsRateParam(1, "twoPointRate", "Relative rate for two point crossover", '2');
+00100     parser.processParam( twoPointsRateParam, "Genetic Operators" );
+00101     double twoPointsRate = twoPointsRateParam.value();
+00102 
+00103     eoValueParam<double> uRateParam(2, "uRate", "Relative rate for uniform crossover", 'U');
+00104     parser.processParam( uRateParam, "Genetic Operators" );
+00105     double URate =  uRateParam.value();
+00106 
+00107    // relative rates and private parameters for mutations;
+00108     eoValueParam<double> pMutPerBitParam(0.01, "pMutPerBit", "Probability of flipping 1 bit in bit-flip mutation", 'b');
+00109     parser.processParam( pMutPerBitParam, "Genetic Operators" );
+00110     double pMutPerBit = pMutPerBitParam.value();
+00111 
+00112     eoValueParam<double> bitFlipRateParam(0.01, "bitFlipRate", "Relative rate for bit-flip mutation", 'B');
+00113     parser.processParam( bitFlipRateParam, "Genetic Operators" );
+00114     double bitFlipRate =  bitFlipRateParam.value();
+00115 
+00116     eoValueParam<double> oneBitRateParam(0.01, "oneBitRate", "Relative rate for deterministic bit-flip mutation", 'D');
+00117     parser.processParam( oneBitRateParam, "Genetic Operators" );
+00118     double oneBitRate = oneBitRateParam.value();
+00119 
+00120     // the name of the "status" file where all actual parameter values will be saved
+00121     string str_status = parser.ProgramName() + ".status"; // default value
+00122     eoValueParam<string> statusParam(str_status.c_str(), "status","Status file",'S');
+00123     parser.processParam( statusParam, "Persistence" );
+00124 
+00125    // do the following AFTER ALL PARAMETERS HAVE BEEN PROCESSED
+00126    // i.e. in case you need parameters somewhere else, postpone these
+00127     if (parser.userNeedsHelp())
+00128       {
+00129         parser.printHelp(cout);
+00130         exit(1);
+00131       }
+00132     if (statusParam.value() != "")
+00133       {
+00134         ofstream os(statusParam.value().c_str());
+00135         os << parser;           // and you can use that file as parameter file
+00136       }
+00137 
+00138 // EVAL
+00140   // Fitness function
+00142   // Evaluation: from a plain C++ fn to an EvalFunc Object ...
+00143   eoEvalFuncPtr<Indi, double, const vector<bool>& > plainEval( binary_value );
+00144   // ... to an object that counts the nb of actual evaluations
+00145   eoEvalFuncCounter<Indi> eval(plainEval);
+00146 
+00147 // INIT
+00149   // Initilisation of population
+00151   // Either load or initialize
+00152   // create an empty pop
+00153   eoPop<Indi> pop;
+00154   // create a state for reading
+00155   eoState inState;              // a state for loading - WITHOUT the parser
+00156   // register the rng and the pop in the state, so they can be loaded,
+00157   // and the present run will be the exact conitnuation of the saved run
+00158   // eventually with different parameters
+00159   inState.registerObject(rng);
+00160   inState.registerObject(pop);
+00161 
+00162   if (loadName != "")
+00163     {
+00164       inState.load(loadName); //  load the pop and the rng
+00165       // the fitness is read in the file:
+00166       // do only evaluate the pop if the fitness has changed
+00167     }
+00168   else
+00169     {
+00170       rng.reseed(seed);
+00171       // a Indi random initializer
+00172       // based on boolean_generator class (see utils/rnd_generator.h)
+00173       eoUniformGenerator<bool> uGen;
+00174       eoInitFixedLength<Indi> random(vecSize, uGen);
+00175 
+00176       // Init pop from the randomizer: need to use the append function
+00177       pop.append(popSize, random);
+00178       // and evaluate pop (STL syntax)
+00179       apply<Indi>(eval, pop);
+00180     } // end of initializatio of the population
+00181 
+00182 // OUTPUT
+00183   // sort pop for pretty printout
+00184   pop.sort();
+00185   // Print (sorted) intial population (raw printout)
+00186   cout << "Initial Population" << endl << pop << endl;
+00187 
+00188 // ENGINE
+00190   // selection and replacement
+00192 // SELECT
+00193   // The robust tournament selection
+00194   eoDetTournamentSelect<Indi> selectOne(tSize);       // tSize in [2,POPSIZE]
+00195   // is now encapsulated in a eoSelectPerc (stands for Percentage)
+00196   eoSelectPerc<Indi> select(selectOne);
+00197 
+00198 // REPLACE
+00199   // And we now have the full slection/replacement - though with
+00200   // the same generational replacement at the moment :-)
+00201   eoGenerationalReplacement<Indi> replace;
+00202 
+00203 // OPERATORS
+00205   // The variation operators
+00207 // CROSSOVER
+00208   // 1-point crossover for bitstring
+00209   eo1PtBitXover<Indi> xover1;
+00210   // uniform crossover for bitstring
+00211   eoUBitXover<Indi> xoverU;
+00212   // 2-pots xover
+00213   eoNPtsBitXover<Indi> xover2(2);
+00214   // Combine them with relative rates
+00215   eoPropCombinedQuadOp<Indi> xover(xover1, onePointRate);
+00216   xover.add(xoverU, URate);
+00217   xover.add(xover2, twoPointsRate, true);
+00218 
+00219 // MUTATION
+00220   // standard bit-flip mutation for bitstring
+00221   eoBitMutation<Indi>  mutationBitFlip(pMutPerBit);
+00222   // mutate exactly 1 bit per individual
+00223   eoDetBitFlip<Indi> mutationOneBit;
+00224   // Combine them with relative rates
+00225   eoPropCombinedMonOp<Indi> mutation(mutationBitFlip, bitFlipRate);
+00226   mutation.add(mutationOneBit, oneBitRate, true);
+00227 
+00228   // The operators are  encapsulated into an eoTRansform object
+00229   eoSGATransform<Indi> transform(xover, pCross, mutation, pMut);
+00230 
+00231 // STOP
+00233   // termination condition see FirstBitEA.cpp
+00235   eoGenContinue<Indi> genCont(maxGen);
+00236   eoSteadyFitContinue<Indi> steadyCont(minGen, steadyGen);
+00237   eoFitContinue<Indi> fitCont(vecSize);
+00238   eoCombinedContinue<Indi> continuator(genCont);
+00239   continuator.add(steadyCont);
+00240   continuator.add(fitCont);
+00241 
+00242 
+00243 // CHECKPOINT
+00244   // but now you want to make many different things every generation
+00245   // (e.g. statistics, plots, ...).
+00246   // the class eoCheckPoint is dedicated to just that:
+00247 
+00248   // Declare a checkpoint (from a continuator: an eoCheckPoint
+00249   // IS AN eoContinue and will be called in the loop of all algorithms)
+00250   eoCheckPoint<Indi> checkpoint(continuator);
+00251 
+00252     // Create a counter parameter
+00253     eoValueParam<unsigned> generationCounter(0, "Gen.");
+00254 
+00255     // Create an incrementor (sub-class of eoUpdater). Note that the
+00256     // parameter's value is passed by reference,
+00257     // so every time the incrementer is updated (every generation),
+00258     // the data in generationCounter will change.
+00259     eoIncrementor<unsigned> increment(generationCounter.value());
+00260 
+00261     // Add it to the checkpoint,
+00262     // so the counter is updated (here, incremented) every generation
+00263     checkpoint.add(increment);
+00264 
+00265     // now some statistics on the population:
+00266     // Best fitness in population
+00267     eoBestFitnessStat<Indi> bestStat;
+00268     // Second moment stats: average and stdev
+00269     eoSecondMomentStats<Indi> SecondStat;
+00270 
+00271     // Add them to the checkpoint to get them called at the appropriate time
+00272     checkpoint.add(bestStat);
+00273     checkpoint.add(SecondStat);
+00274 
+00275     // The Stdout monitor will print parameters to the screen ...
+00276     eoStdoutMonitor monitor(false);
+00277 
+00278     // when called by the checkpoint (i.e. at every generation)
+00279     checkpoint.add(monitor);
+00280 
+00281     // the monitor will output a series of parameters: add them
+00282     monitor.add(generationCounter);
+00283     monitor.add(eval);          // because now eval is an eoEvalFuncCounter!
+00284     monitor.add(bestStat);
+00285     monitor.add(SecondStat);
+00286 
+00287     // A file monitor: will print parameters to ... a File, yes, you got it!
+00288     eoFileMonitor fileMonitor("stats.xg", " ");
+00289 
+00290     // the checkpoint mechanism can handle multiple monitors
+00291     checkpoint.add(fileMonitor);
+00292 
+00293     // the fileMonitor can monitor parameters, too, but you must tell it!
+00294     fileMonitor.add(generationCounter);
+00295     fileMonitor.add(bestStat);
+00296     fileMonitor.add(SecondStat);
+00297 
+00298     // Last type of item the eoCheckpoint can handle: state savers:
+00299     eoState outState;
+00300     // Register the algorithm into the state (so it has something to save!!)
+00301     outState.registerObject(parser);
+00302     outState.registerObject(pop);
+00303     outState.registerObject(rng);
+00304 
+00305     // and feed the state to state savers
+00306     // save state every 100th  generation
+00307     eoCountedStateSaver stateSaver1(20, outState, "generation");
+00308     // save state every 1 seconds
+00309     eoTimedStateSaver   stateSaver2(1, outState, "time");
+00310 
+00311     // Don't forget to add the two savers to the checkpoint
+00312     checkpoint.add(stateSaver1);
+00313     checkpoint.add(stateSaver2);
+00314     // and that's it for the (control and) output
+00315 
+00316 // GENERATION
+00318   // the algorithm
+00320 
+00321   // Easy EA requires
+00322   // stopping criterion, eval, selection, transformation, replacement
+00323   eoEasyEA<Indi> gga(checkpoint, eval, select, transform, replace);
+00324 
+00325   // Apply algo to pop - that's it!
+00326   gga(pop);
+00327 
+00328 // OUTPUT
+00329   // Print (sorted) intial population
+00330   pop.sort();
+00331   cout << "FINAL Population\n" << pop << endl;
+00332 // GENERAL
+00333 }
+00334 
+00335 // A main that catches the exceptions
+00336 int main(int argc, char **argv)
+00337 {
+00338     try
+00339     {
+00340         main_function(argc, argv);
+00341     }
+00342     catch(exception& e)
+00343     {
+00344         cout << "Exception: " << e.what() << '\n';
+00345     }
+00346 
+00347     return 1;
+00348 }
+
Generated on Thu Oct 19 05:06:42 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_second_real_e_a_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_second_real_e_a_8cpp-source.html new file mode 100644 index 000000000..d18993234 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_second_real_e_a_8cpp-source.html @@ -0,0 +1,332 @@ + + +EO: SecondRealEA.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Lesson3
+

SecondRealEA.cpp

00001 //-----------------------------------------------------------------------------
+00002 // SecondRealEA.cpp
+00003 //-----------------------------------------------------------------------------
+00004 //*
+00005 // Same code than FirstBitEA as far as Evolutionary Computation is concerned
+00006 // but now you learn to enter the parameters in a more flexible way
+00007 // (also slightly different than in SecondBitEA.cpp)
+00008 // and to twidle the output to your preferences (as in SecondBitEA.cpp)
+00009 //
+00010 //-----------------------------------------------------------------------------
+00011 #ifdef HAVE_CONFIG_H
+00012 #include <config.h>
+00013 #endif
+00014 
+00015 // standard includes
+00016 #include <fstream>
+00017 #include <iostream>   // cout
+00018 #include <stdexcept>  // runtime_error
+00019 
+00020 // the general include for eo
+00021 #include <eo>
+00022 #include <es.h>
+00023 
+00024 // REPRESENTATION
+00025 //-----------------------------------------------------------------------------
+00026 // define your individuals
+00027 typedef eoReal<eoMinimizingFitness> Indi;
+00028 
+00029 // Use functions from namespace std
+00030 using namespace std;
+00031 
+00032 // EVALFUNC
+00033 //-----------------------------------------------------------------------------
+00034 // a simple fitness function that computes the euclidian norm of a real vector
+00035 // Now in a separate file, and declared as binary_value(const vector<bool> &)
+00036 
+00037 #include "real_value.h"
+00038 
+00039 // GENERAL
+00040 //-----------------------------------------------------------------------------
+00041 
+00042 void main_function(int argc, char **argv)
+00043 {
+00044 // PARAMETRES
+00045 //-----------------------------------------------------------------------------
+00046 // instead of having all values of useful parameters as constants, read them:
+00047 // either on the command line (--option=value or -o=value)
+00048 //     or in a parameter file (same syntax, order independent,
+00049 //                             # = usual comment character
+00050 //     or in the environment (TODO)
+00051 
+00052   // First define a parser from the command-line arguments
+00053   eoParser parser(argc, argv);
+00054 
+00055   // For each parameter, you can in on single line
+00056   // define the parameter, read it through the parser, and assign it
+00057 
+00058   unsigned seed = parser.createParam(unsigned(time(0)), "seed", "Random number seed", 'S').value(); // will be in default section General
+00059 
+00060   // description of genotype
+00061   unsigned vecSize = parser.createParam(unsigned(8), "vecSize", "Genotype size",'V', "Representation" ).value();
+00062 
+00063    // parameters for evolution engine
+00064     unsigned popSize = parser.createParam(unsigned(10), "popSize", "Population size",'P', "Evolution engine" ).value();
+00065 
+00066     unsigned tSize = parser.createParam(unsigned(2), "tSize", "Tournament size",'T', "Evolution Engine" ).value();
+00067 
+00068    // init and stop
+00069     string loadName = parser.createParam(string(""), "Load","A save file to restart from",'L', "Persistence" ).value();
+00070 
+00071     unsigned maxGen = parser.createParam(unsigned(100), "maxGen", "Maximum number of generations",'G', "Stopping criterion" ).value();
+00072 
+00073     unsigned minGen = parser.createParam(unsigned(100), "minGen", "Minimum number of generations",'g', "Stopping criterion" ).value();
+00074 
+00075     unsigned steadyGen = parser.createParam(unsigned(100), "steadyGen", "Number of generations with no improvement",'s', "Stopping criterion" ).value();
+00076 
+00077    // operators probabilities at the algorithm level
+00078     double pCross = parser.createParam(double(0.6), "pCross", "Probability of Crossover", 'C', "Genetic Operators" ).value();
+00079 
+00080     double pMut = parser.createParam(double(0.1), "pMut", "Probability of Mutation", 'M', "Genetic Operators" ).value();
+00081 
+00082    // relative rates for crossovers
+00083     double hypercubeRate = parser.createParam(double(1), "hypercubeRate", "Relative rate for hypercube crossover", '\0', "Genetic Operators" ).value();
+00084 
+00085     double segmentRate = parser.createParam(double(1), "segmentRate", "Relative rate for segment crossover", '\0', "Genetic Operators" ).value();
+00086 
+00087     // internal parameters for the mutations
+00088     double EPSILON = parser.createParam(double(0.01), "EPSILON", "Width for uniform mutation", '\0', "Genetic Operators" ).value();
+00089 
+00090     double SIGMA = parser.createParam(double(0.3), "SIGMA", "Sigma for normal mutation", '\0', "Genetic Operators" ).value();
+00091 
+00092    // relative rates for mutations
+00093     double uniformMutRate = parser.createParam(double(1), "uniformMutRate", "Relative rate for uniform mutation", '\0', "Genetic Operators" ).value();
+00094 
+00095     double detMutRate = parser.createParam(double(1), "detMutRate", "Relative rate for det-uniform mutation", '\0', "Genetic Operators" ).value();
+00096 
+00097     double normalMutRate = parser.createParam(double(1), "normalMutRate", "Relative rate for normal mutation", '\0', "Genetic Operators" ).value();
+00098 
+00099     // the name of the "status" file where all actual parameter values will be saved
+00100     string str_status = parser.ProgramName() + ".status"; // default value
+00101     string statusName = parser.createParam(str_status, "status","Status file",'S', "Persistence" ).value();
+00102 
+00103    // do the following AFTER ALL PARAMETERS HAVE BEEN PROCESSED
+00104    // i.e. in case you need parameters somewhere else, postpone these
+00105     if (parser.userNeedsHelp())
+00106       {
+00107         parser.printHelp(cout);
+00108         exit(1);
+00109       }
+00110     if (statusName != "")
+00111       {
+00112         ofstream os(statusName.c_str());
+00113         os << parser;           // and you can use that file as parameter file
+00114       }
+00115 
+00116 // EVAL
+00118   // Fitness function
+00120   // Evaluation: from a plain C++ fn to an EvalFunc Object
+00121   // you need to give the full description of the function
+00122   eoEvalFuncPtr<Indi, double, const vector<double>& > plainEval(  real_value );
+00123   // ... to an object that counts the nb of actual evaluations
+00124   eoEvalFuncCounter<Indi> eval(plainEval);
+00125 
+00126 // INIT
+00128   // Initilisation of population
+00130   // Either load or initialize
+00131   // create an empty pop
+00132   eoPop<Indi> pop;
+00133   // create a state for reading
+00134   eoState inState;              // a state for loading - WITHOUT the parser
+00135   // register the rng and the pop in the state, so they can be loaded,
+00136   // and the present run will be the exact conitnuation of the saved run
+00137   // eventually with different parameters
+00138   inState.registerObject(rng);
+00139   inState.registerObject(pop);
+00140 
+00141   if (loadName != "")
+00142     {
+00143       inState.load(loadName); //  load the pop and the rng
+00144       // the fitness is read in the file:
+00145       // do only evaluate the pop if the fitness has changed
+00146     }
+00147   else
+00148     {
+00149       rng.reseed(seed);
+00150       // a Indi random initializer
+00151       // based on boolean_generator class (see utils/rnd_generator.h)
+00152       eoUniformGenerator<double> uGen(-1.0, 1.0);
+00153       eoInitFixedLength<Indi> random(vecSize, uGen);
+00154 
+00155       // Init pop from the randomizer: need to use the append function
+00156       pop.append(popSize, random);
+00157       // and evaluate pop (STL syntax)
+00158       apply<Indi>(eval, pop);
+00159     } // end of initializatio of the population
+00160 
+00161 // OUTPUT
+00162   // sort pop before printing it!
+00163   pop.sort();
+00164   // Print (sorted) intial population (raw printout)
+00165   cout << "Initial Population" << endl;
+00166   cout << pop;
+00167 
+00168 // ENGINE
+00170   // selection and replacement
+00172 // SELECT
+00173   // The robust tournament selection
+00174   eoDetTournamentSelect<Indi> selectOne(tSize);
+00175   // is now encapsulated in a eoSelectPerc (entage)
+00176   eoSelectPerc<Indi> select(selectOne);// by default rate==1
+00177 
+00178 // REPLACE
+00179   // And we now have the full slection/replacement - though with
+00180   // no replacement (== generational replacement) at the moment :-)
+00181   eoGenerationalReplacement<Indi> replace;
+00182 
+00183 // OPERATORS
+00185   // The variation operators
+00187 // CROSSOVER
+00188   // uniform chooce on segment made by the parents
+00189   eoSegmentCrossover<Indi> xoverS;
+00190   // uniform choice in hypercube built by the parents
+00191   eoHypercubeCrossover<Indi> xoverA;
+00192   // Combine them with relative weights
+00193   eoPropCombinedQuadOp<Indi> xover(xoverS, segmentRate);
+00194   xover.add(xoverA, hypercubeRate, true);
+00195 
+00196 // MUTATION
+00197   // offspring(i) uniformly chosen in [parent(i)-epsilon, parent(i)+epsilon]
+00198   eoUniformMutation<Indi>  mutationU(EPSILON);
+00199   // k (=1) coordinates of parents are uniformly modified
+00200   eoDetUniformMutation<Indi>  mutationD(EPSILON);
+00201   // all coordinates of parents are normally modified (stDev SIGMA)
+00202   eoNormalMutation<Indi>  mutationN(SIGMA);
+00203   // Combine them with relative weights
+00204   eoPropCombinedMonOp<Indi> mutation(mutationU, uniformMutRate);
+00205   mutation.add(mutationD, detMutRate);
+00206   mutation.add(mutationN, normalMutRate, true);
+00207 
+00208   // The operators are  encapsulated into an eoTRansform object
+00209   eoSGATransform<Indi> transform(xover, pCross, mutation, pMut);
+00210 
+00211 // STOP
+00213   // termination condition see FirstBitEA.cpp
+00215   eoGenContinue<Indi> genCont(maxGen);
+00216   eoSteadyFitContinue<Indi> steadyCont(minGen, steadyGen);
+00217   eoFitContinue<Indi> fitCont(0);
+00218   eoCombinedContinue<Indi> continuator(genCont);
+00219   continuator.add(steadyCont);
+00220   continuator.add(fitCont);
+00221 
+00222 
+00223 // CHECKPOINT
+00224   // but now you want to make many different things every generation
+00225   // (e.g. statistics, plots, ...).
+00226   // the class eoCheckPoint is dedicated to just that:
+00227 
+00228   // Declare a checkpoint (from a continuator: an eoCheckPoint
+00229   // IS AN eoContinue and will be called in the loop of all algorithms)
+00230   eoCheckPoint<Indi> checkpoint(continuator);
+00231 
+00232     // Create a counter parameter
+00233     eoValueParam<unsigned> generationCounter(0, "Gen.");
+00234 
+00235     // Create an incrementor (sub-class of eoUpdater). Note that the
+00236     // parameter's value is passed by reference,
+00237     // so every time the incrementer is updated (every generation),
+00238     // the data in generationCounter will change.
+00239     eoIncrementor<unsigned> increment(generationCounter.value());
+00240 
+00241     // Add it to the checkpoint,
+00242     // so the counter is updated (here, incremented) every generation
+00243     checkpoint.add(increment);
+00244 
+00245     // now some statistics on the population:
+00246     // Best fitness in population
+00247     eoBestFitnessStat<Indi> bestStat;
+00248     // Second moment stats: average and stdev
+00249     eoSecondMomentStats<Indi> SecondStat;
+00250 
+00251     // Add them to the checkpoint to get them called at the appropriate time
+00252     checkpoint.add(bestStat);
+00253     checkpoint.add(SecondStat);
+00254 
+00255     // The Stdout monitor will print parameters to the screen ...
+00256     eoStdoutMonitor monitor(false);
+00257 
+00258     // when called by the checkpoint (i.e. at every generation)
+00259     checkpoint.add(monitor);
+00260 
+00261     // the monitor will output a series of parameters: add them
+00262     monitor.add(generationCounter);
+00263     monitor.add(eval);          // because now eval is an eoEvalFuncCounter!
+00264     monitor.add(bestStat);
+00265     monitor.add(SecondStat);
+00266 
+00267     // A file monitor: will print parameters to ... a File, yes, you got it!
+00268     eoFileMonitor fileMonitor("stats.xg", " ");
+00269 
+00270     // the checkpoint mechanism can handle multiple monitors
+00271     checkpoint.add(fileMonitor);
+00272 
+00273     // the fileMonitor can monitor parameters, too, but you must tell it!
+00274     fileMonitor.add(generationCounter);
+00275     fileMonitor.add(bestStat);
+00276     fileMonitor.add(SecondStat);
+00277 
+00278     // Last type of item the eoCheckpoint can handle: state savers:
+00279     eoState outState;
+00280     // Register the algorithm into the state (so it has something to save!!)
+00281     outState.registerObject(parser);
+00282     outState.registerObject(pop);
+00283     outState.registerObject(rng);
+00284 
+00285     // and feed the state to state savers
+00286     // save state every 100th  generation
+00287     eoCountedStateSaver stateSaver1(20, outState, "generation");
+00288     // save state every 1 seconds
+00289     eoTimedStateSaver   stateSaver2(1, outState, "time");
+00290 
+00291     // Don't forget to add the two savers to the checkpoint
+00292     checkpoint.add(stateSaver1);
+00293     checkpoint.add(stateSaver2);
+00294     // and that's it for the (control and) output
+00295 
+00296 // GENERATION
+00298   // the algorithm
+00300 
+00301   // Easy EA requires
+00302   // stopping criterion, eval, selection, transformation, replacement
+00303   eoEasyEA<Indi> gga(checkpoint, eval, select, transform, replace);
+00304 
+00305   // Apply algo to pop - that's it!
+00306   gga(pop);
+00307 
+00308 // OUTPUT
+00309   // Print (sorted) intial population
+00310   pop.sort();
+00311   cout << "FINAL Population\n" << pop << endl;
+00312 // GENERAL
+00313 }
+00314 
+00315 // A main that catches the exceptions
+00316 
+00317 int main(int argc, char **argv)
+00318 {
+00319     try
+00320     {
+00321         main_function(argc, argv);
+00322     }
+00323     catch(exception& e)
+00324     {
+00325         cout << "Exception: " << e.what() << '\n';
+00326     }
+00327 
+00328     return 1;
+00329 }
+
Generated on Thu Oct 19 05:06:42 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_sym_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_sym_8cpp-source.html new file mode 100644 index 000000000..db34a2f59 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_sym_8cpp-source.html @@ -0,0 +1,170 @@ + + +EO: Sym.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / sym
+

Sym.cpp

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #include <sstream>
+00019 #include <vector>
+00020 
+00021 #include "Sym.h"
+00022 
+00023 using namespace std;
+00024 
+00025 typedef UniqueNodeStats* (*NodeStatFunc)(Sym&);
+00026 
+00027 UniqueNodeStats* (*Sym::factory)(const Sym&) = 0;
+00028 
+00029 SymMap Sym::dag(100000); // reserve space for so many nodes
+00030 std::vector<unsigned> Sym::token_count;
+00031         
+00032 
+00033 size_t get_size(const SymVec& vec) {
+00034     size_t sz = 0;
+00035     for (unsigned i = 0; i < vec.size(); ++i) {
+00036         sz += vec[i].size();
+00037     }
+00038     return sz;
+00039 }
+00040 
+00041 size_t get_depth(const SymVec& vec) {
+00042     size_t dp = 1;
+00043     for (unsigned i = 0; i < vec.size(); ++i) {
+00044         dp = std::max(dp, vec[i].depth());
+00045     }
+00046     return dp;
+00047 }
+00048 
+00049 Sym::Sym(token_t tok, const SymVec& args_) : node(dag.end())
+00050 {
+00051     detail::SymKey key(tok, detail::SymArgs(args_));
+00052     detail::SymValue val;
+00053 
+00054     node = dag.insert(pair<const detail::SymKey, detail::SymValue>(key, val)).first; 
+00055     
+00056     if (__unchecked_refcount() == 0) { // new node, set some stats 
+00057         node->second.size  = 1 + get_size(args_);
+00058         node->second.depth = 1 + get_depth(args_);
+00059         
+00060         // token count
+00061         if (tok >= token_count.size()) {
+00062             token_count.resize(tok+1);
+00063         }
+00064         
+00065         incref();
+00066         node->first.fixate();   
+00067         // call the factory function if available
+00068         if (factory) node->second.uniqueNodeStats = factory(*this);
+00069     
+00070     }
+00071     else incref();
+00072 }
+00073 
+00074 Sym::Sym(token_t tok, const Sym& a) : node(dag.end()) { 
+00075     SymVec args_; args_.push_back(a); 
+00076     detail::SymKey key(tok, detail::SymArgs(args_));
+00077     detail::SymValue val;
+00078 
+00079     node = dag.insert(pair<const detail::SymKey, detail::SymValue>(key, val)).first; 
+00080     
+00081     if (__unchecked_refcount() == 0) { // new node, set some stats 
+00082         node->second.size = 1 + get_size(args_);
+00083         node->second.depth = 1 + get_depth(args_);
+00084         
+00085         // token count
+00086         if (tok >= token_count.size()) {
+00087             token_count.resize(tok+1);
+00088         }
+00089         
+00090         incref();
+00091         node->first.fixate();
+00092         // call the factory function if available
+00093         if (factory) node->second.uniqueNodeStats = factory(*this);
+00094     }
+00095     else incref();
+00096 }
+00097 
+00098 Sym::Sym(token_t tok) : node(dag.end()) {
+00099     detail::SymKey key(tok);
+00100     detail::SymValue val;
+00101     node = dag.insert(pair<const detail::SymKey, detail::SymValue>(key, val)).first; 
+00102     
+00103     if (__unchecked_refcount() == 0) { // new node, set some stats 
+00104         node->second.size = 1;
+00105         node->second.depth = 1;
+00106         
+00107         // token count
+00108         if (tok >= token_count.size()) {
+00109             token_count.resize(tok+1);
+00110         }
+00111         
+00112         incref();
+00113 
+00114         // call the factory function if available
+00115         if (factory) node->second.uniqueNodeStats = factory(*this);
+00116         
+00117     }
+00118     else incref();
+00119 }
+00120 
+00121 std::pair<Sym,bool> insert_subtree_impl(const Sym& cur, size_t w, const Sym& nw) {
+00122     if (w-- == 0) return make_pair(nw, !(nw == cur));
+00123     
+00124     const SymVec& vec = cur.args();
+00125     std::pair<Sym,bool> result;
+00126     unsigned i; 
+00127     
+00128     for (i = 0; i < vec.size(); ++i) {
+00129         if (w < vec[i].size()) {
+00130             result = insert_subtree_impl(vec[i], w, nw);
+00131             if (result.second == false) return std::make_pair(cur, false); // unchanged
+00132             break;
+00133         }
+00134         w -= vec[i].size();
+00135     }
+00136     SymVec newvec = cur.args();
+00137     newvec[i] = result.first;
+00138     return make_pair(Sym(cur.token(), newvec), true);
+00139 }
+00140 
+00141 Sym insert_subtree(const Sym& cur, size_t w, const Sym& nw) {
+00142     return insert_subtree_impl(cur,w,nw).first;
+00143 }
+00144 Sym get_subtree(const Sym& cur, size_t w) {
+00145     if (w-- == 0) return cur;
+00146     
+00147     const SymVec& vec = cur.args();
+00148     for (unsigned i = 0; i < vec.size(); ++i) {
+00149         if (w < vec[i].size()) return get_subtree(vec[i], w);
+00150         w-=vec[i].size();
+00151     }
+00152     return cur;
+00153 }
+00154 
+00155 
+
Generated on Thu Oct 19 05:06:42 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_sym_8h-source.html b/trunk/paradiseo-eo/doc/html/_sym_8h-source.html new file mode 100644 index 000000000..5d1984c1d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_sym_8h-source.html @@ -0,0 +1,189 @@ + + +EO: Sym.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / sym
+

Sym.h

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #ifndef SYMNODE_H_
+00019 #define SYMNODE_H_
+00020 
+00021 #include <cassert>
+00022 
+00023 #if __GNUC__ >= 3
+00024 #include <backward/hash_map.h>
+00025 #elif __GNUC__ < 3
+00026 #include <hash_map.h>
+00027 using std::hash_map;
+00028 #endif
+00029 
+00030 /* Empty 'extra statistics' structure, derive from this to keep other characteristics of nodes */
+00031 struct UniqueNodeStats { virtual ~UniqueNodeStats(){} };
+00032 
+00033 #include "SymImpl.h"
+00034 #include "token.h"
+00035 
+00036 #if __GNUC__ == 4
+00037 #define USE_TR1 1
+00038 #else
+00039 #define USE_TR1 0
+00040 #endif
+00041 
+00042 #if USE_TR1
+00043 #include <tr1/unordered_map>
+00044 typedef std::tr1::unordered_map<detail::SymKey, detail::SymValue, detail::SymKey::Hash> SymMap;
+00045 #else
+00046 typedef hash_map<detail::SymKey, detail::SymValue, detail::SymKey::Hash> SymMap;
+00047 #endif
+00048 
+00049 typedef SymMap::iterator SymIterator;
+00050 
+00051 /* Sym is the tree, for which all the nodes are stored in a hash table. 
+00052  * This makes checking for equality O(1) */
+00053 class Sym
+00054 {
+00055     public:
+00056         
+00057         Sym() : node(dag.end()) {}
+00058         explicit Sym(token_t token, const SymVec& args);
+00059         explicit Sym(token_t token, const Sym& args);
+00060         explicit Sym(token_t var);
+00061         
+00062         explicit Sym(SymIterator it) : node(it) { incref(); }
+00063         
+00064         Sym(const Sym& oth) : node(oth.node) { incref(); }
+00065         ~Sym() { decref(); }
+00066         
+00067         const Sym& operator=(const Sym& oth) {
+00068             if (oth.node == node) return *this;
+00069             decref();
+00070             node = oth.node;
+00071             incref();
+00072             return *this;
+00073         }
+00074 
+00075         /* Unique Stats are user defined */
+00076         UniqueNodeStats* extra_stats() const { return empty()? 0 : node->second.uniqueNodeStats; }
+00077         
+00078         int hashcode() const { return node->first.get_hash_code(); } //detail::SymKey::Hash hash; return hash(node->first); }
+00079         
+00080         // Friends, need to touch the node
+00081         friend struct detail::SymKey::Hash;
+00082         friend struct detail::SymKey;
+00083         
+00084         unsigned refcount() const { return empty()? 0: node->second.refcount; }
+00085 
+00086         bool operator==(const Sym& other) const {
+00087             return node == other.node;
+00088         }
+00089         bool operator!=(const Sym& other) const { return !(*this == other); }
+00090 
+00091         bool empty() const { return node == dag.end(); }
+00092 
+00093         /* Support for traversing trees */
+00094         unsigned arity() const { return node->first.arity(); }
+00095         token_t    token() const { return node->first.token; }
+00096         
+00097         const SymVec& args() const { return node->first.vec(); }
+00098         
+00099         /* size() - depth */
+00100         unsigned size() const { return empty()? 0 : node->second.size; }
+00101         unsigned depth() const { return empty()? 0 : node->second.depth; }
+00102         
+00103         SymMap::iterator iterator() const { return node; }
+00104 
+00105         /* Statics accessing some static members */
+00106         static SymMap& get_dag() { return dag; }
+00107         
+00108         /* This function can be set to create some UniqueNodeStats derivative that can contain extra stats for a node,
+00109          * it can for instance be used to create ERC's and what not. */
+00110         static void set_factory_function(UniqueNodeStats* (*f)(const Sym&)) { factory=f; } 
+00111         static void clear_factory_function() { factory = 0; }
+00112         
+00113         static const std::vector<unsigned>& token_refcount() { return token_count; }
+00114         
+00115         unsigned address() const { return reinterpret_cast<unsigned>(&*node); }
+00116         
+00117     private :
+00118         
+00119         // implements getting subtrees
+00120         Sym private_get(size_t w) const; 
+00121         
+00122         unsigned __unchecked_refcount() const { return node->second.refcount; }
+00123         
+00124         void incref() {
+00125             if (!empty()) {
+00126                 ++(node->second.refcount);
+00127                 ++token_count[token()];
+00128             }
+00129         }
+00130         void decref() {
+00131             if (!empty()) {
+00132                 --token_count[token()];
+00133                 if (--(node->second.refcount) == 0) {
+00134                     dag.erase(node);
+00135                 }
+00136             }
+00137         }
+00138 
+00139         // The one and only data member, an iterator into the static map below
+00140         SymIterator node;
+00141         
+00142         // A static hash_map that contains all live nodes.. 
+00143         static SymMap dag;
+00144         
+00145         static std::vector<unsigned> token_count;
+00146         
+00147         // Factory function for creating extra node stats, default will be 0
+00148         static UniqueNodeStats* (*factory)(const Sym&);
+00149         
+00150 };
+00151 
+00152 /* Utility hash functor for syms */
+00153 class HashSym {
+00154     public:
+00155     int operator()(const Sym& sym) const { return sym.hashcode(); }
+00156 };
+00157 
+00158 /* Utility Functions */
+00159 
+00160 // get_subtree retrieves a subtree by standard ordering (0=root, and then depth first)
+00161 Sym get_subtree(const Sym& org, size_t w); 
+00162 
+00163 // insert_subtree uses the same ordering as get and inserts the second argument, returning a new tree
+00164 Sym insert_subtree(const Sym& org, size_t w, const Sym& nw);
+00165 
+00166 /* Get the successor from the hashtable, no particular purpose other than an interesting way to mutate */
+00167 inline Sym next(const Sym& sym) {
+00168     SymIterator it = sym.iterator();
+00169     ++it;
+00170     if (it == Sym::get_dag().end()) it = Sym::get_dag().begin();
+00171     return Sym(it);
+00172 }
+00173 
+00174 #endif
+
Generated on Thu Oct 19 05:06:42 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_sym_impl_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_sym_impl_8cpp-source.html new file mode 100644 index 000000000..7295a2ac7 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_sym_impl_8cpp-source.html @@ -0,0 +1,124 @@ + + +EO: SymImpl.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / sym
+

SymImpl.cpp

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 #include "Sym.h"
+00018 
+00019 using namespace std;
+00020 namespace detail {
+00021     
+00022 class SymArgsImpl {
+00023     public:
+00024     std::vector<Sym> owned_args;
+00025 };
+00026 
+00027 size_t SymArgs::len() const { 
+00028     return vec().size(); 
+00029 }
+00030 
+00031 SymArgs::SymArgs() : pimpl( new SymArgsImpl ) {
+00032     args_ptr = &pimpl->owned_args;
+00033 }
+00034 
+00035 SymArgs::SymArgs(const std::vector<Sym>& v) : pimpl(0) {
+00036     args_ptr = &v;
+00037 }
+00038 
+00039 SymArgs::~SymArgs() { 
+00040     delete pimpl; 
+00041 }
+00042 
+00043 SymArgs::SymArgs(const SymArgs& args) : pimpl(0), args_ptr(args.args_ptr) {
+00044     if (args.pimpl && args.args_ptr == &args.pimpl->owned_args) {
+00045         pimpl = new SymArgsImpl(*args.pimpl);
+00046         args_ptr = &pimpl->owned_args; 
+00047     } 
+00048 }
+00049 
+00050 const SymArgs& SymArgs::operator=(const SymArgs& args) {
+00051     if (args.pimpl && args.args_ptr == &args.pimpl->owned_args) {
+00052         pimpl = new SymArgsImpl(*args.pimpl);
+00053         args_ptr = &pimpl->owned_args;
+00054     } else {
+00055         args_ptr = args.args_ptr;
+00056     }
+00057 
+00058     return *this;
+00059 }
+00060 
+00061 void SymArgs::fixate() const {
+00062     assert(pimpl == 0);
+00063     pimpl = new SymArgsImpl;
+00064     pimpl->owned_args = *args_ptr;
+00065     args_ptr = &pimpl->owned_args;
+00066 }
+00067 
+00068 // For Tackett's hashcode
+00069 #define PRIMET 21523
+00070 #define HASHMOD 277218551
+00071 
+00072 const int nprimes = 4;
+00073 const unsigned long primes[] = {3221225473ul, 201326611ul, 1610612741ul, 805306457ul};
+00074     
+00075 int SymKey::calc_hash() const {
+00076     unsigned long hash = unsigned(token);
+00077     hash *= PRIMET;
+00078     
+00079     const std::vector<Sym>& v = args.vec();
+00080     for (unsigned i = 0; i < v.size(); ++i) {
+00081         hash += ( (v[i].address() >> 3) * primes[i%nprimes]) % HASHMOD;
+00082     }
+00083 
+00084     return hash;// % HASHMOD;
+00085 }
+00086 
+00087 bool SymKey::operator==(const SymKey& other) const {
+00088     if (token != other.token) return false;
+00089     return args.vec() == other.args.vec();
+00090 }
+00091 
+00092 /* Just to store this info somewhere:
+00093  * 
+00094  * Address Based Hash Function Implementation
+00095  * uint32 address_hash(char* addr)
+00096  * {
+00097  *   register uint32 key;
+00098  *     key = (uint32) addr;
+00099  *       return (key >> 3) * 2654435761;
+00100  *  }
+00101  */     
+00102 
+00103 SymValue::SymValue() : refcount(0), size(0), depth(0), uniqueNodeStats(0)  {}
+00104 
+00105 SymValue::~SymValue() { delete uniqueNodeStats; }
+00106 
+00107 
+00108 
+00109 } // namespace detail
+
Generated on Thu Oct 19 05:06:42 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_sym_impl_8h-source.html b/trunk/paradiseo-eo/doc/html/_sym_impl_8h-source.html new file mode 100644 index 000000000..a99e18f99 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_sym_impl_8h-source.html @@ -0,0 +1,128 @@ + + +EO: SymImpl.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / sym
+

SymImpl.h

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 #ifndef __SYM_IMPL_H__
+00018 #define __SYM_IMPL_H__
+00019 
+00020 #include <vector>
+00021 
+00022 #include "token.h"
+00023 
+00024 class Sym;
+00025 
+00026 #if __GNUC__ > 4 
+00027 #include <ext/pool_allocator.h>
+00028 typedef std::vector<Sym, __gnu_cxx::__pool_alloc<Sym> > std::vector<Sym>;
+00029 //typedef std::vector<Sym> SymVec;
+00030 #else
+00031 typedef std::vector<Sym> SymVec;
+00032 #endif
+00033 
+00034 
+00035 namespace detail {
+00036 
+00037 class SymArgsImpl;
+00038 class SymArgs {
+00039     
+00040     mutable SymArgsImpl* pimpl; // contains circular reference to vector<Sym>
+00041     mutable const std::vector<Sym>* args_ptr;
+00042     
+00043     public:
+00044 
+00045     SymArgs();
+00046     SymArgs(const std::vector<Sym>& v);
+00047     ~SymArgs();
+00048 
+00049     SymArgs(const SymArgs& args);
+00050     const SymArgs& SymArgs::operator=(const SymArgs& other);
+00051 
+00052     size_t len() const;
+00053     const std::vector<Sym>& vec() const { return *args_ptr; }
+00054     void fixate() const;
+00055 };
+00056 
+00057 class SymKey
+00058 {
+00059     public:
+00060         SymKey(token_t _token) : args(), token(_token), hash_code(calc_hash()) {}
+00061         SymKey(token_t _token, const detail::SymArgs& _args) : args(_args), token(_token), hash_code(calc_hash()) {}
+00062         
+00063         bool operator==(const SymKey& other) const;
+00064         
+00065         struct Hash
+00066         {
+00067             int operator()(const SymKey& k) const { return k.calc_hash(); }; 
+00068         };
+00069         
+00070         unsigned arity() const { return args.len(); }
+00071         const std::vector<Sym>& vec() const { return args.vec(); }
+00072         
+00073         // fixates (i.e. claims memory) for the embedded vector of Syms
+00074         void fixate() const { args.fixate(); }
+00075         
+00076         int get_hash_code() const { return hash_code; }
+00077         
+00078         detail::SymArgs args;
+00079         token_t token;     // identifies the function
+00080 
+00081     private:
+00082         int calc_hash() const;
+00083         int hash_code;
+00084 };
+00085 
+00086 struct SymValue
+00087 {
+00088     friend class Sym;
+00089      
+00090     SymValue();
+00091     ~SymValue(); 
+00092     
+00093     unsigned getRefCount() const { return refcount; }
+00094     unsigned getSize() const     { return size; }
+00095     unsigned getDepth() const    { return depth; }
+00096     
+00097      
+00098     
+00099     // for reference counting
+00100     unsigned refcount;
+00101     
+00102     // some simple stats
+00103     unsigned size;
+00104     unsigned depth;
+00105     UniqueNodeStats* uniqueNodeStats;
+00106     
+00107 };
+00108 
+00109 
+00110 } // namespace detail
+00111 
+00112 #endif
+00113 
+
Generated on Thu Oct 19 05:06:42 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_sym_ops_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_sym_ops_8cpp-source.html new file mode 100644 index 000000000..b6d7d7ee5 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_sym_ops_8cpp-source.html @@ -0,0 +1,124 @@ + + +EO: SymOps.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / fun
+

SymOps.cpp

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #include "FunDef.h"
+00019 #include "SymOps.h"
+00020 #include "Sym.h"
+00021 
+00022 using namespace std;
+00023 
+00024 void collect(token_t t, Sym a, SymVec& args) {
+00025     
+00026     if (a.token() == t) {
+00027         const SymVec& a_args = a.args();
+00028         for (unsigned i = 0; i < a_args.size(); ++i) {
+00029             collect(t, a_args[i], args);
+00030         }
+00031         return;
+00032     }
+00033      
+00034     args.push_back(a);
+00035 }
+00036 
+00037 Sym operator+(Sym a, Sym b) {
+00038     
+00039     SymVec args;
+00040 
+00041     collect(sum_token, a, args);
+00042     collect(sum_token, b, args);
+00043     
+00044     return Sym(sum_token, args);
+00045 }
+00046 
+00047 Sym operator*(Sym a, Sym b) {
+00048     
+00049     SymVec args;
+00050 
+00051     collect(prod_token, a, args);
+00052     collect(prod_token, b, args);
+00053     
+00054     return Sym(prod_token, args);
+00055 }
+00056 
+00057 Sym operator/(Sym a, Sym b) {
+00058     
+00059     SymVec args;
+00060 
+00061     collect(prod_token, a, args);
+00062     
+00063     SymVec args2;
+00064     collect(prod_token, b, args2);
+00065     
+00066     SymVec inv;
+00067     inv.push_back(Sym(prod_token, args2));
+00068     
+00069     args.push_back( Sym(inv_token, inv) );
+00070 
+00071     return Sym(prod_token, args);
+00072 }
+00073 
+00074 Sym operator-(Sym a, Sym b) {
+00075     
+00076     SymVec args;
+00077 
+00078     collect(sum_token, a, args);
+00079     
+00080     SymVec args2;
+00081     collect(sum_token, b, args2);
+00082     
+00083     SymVec min;
+00084     min.push_back(Sym(sum_token, args2));
+00085     
+00086     args.push_back( Sym(min_token, min) );
+00087 
+00088     return Sym(sum_token, args);
+00089 }
+00090 
+00091 Sym operator-(Sym a) {
+00092     return Sym(min_token, a);
+00093 }
+00094 
+00095 Sym pow(Sym a, Sym b) {
+00096     SymVec args;
+00097     args.push_back(a);
+00098     args.push_back(b);
+00099     return Sym(pow_token, args);
+00100 }
+00101 
+00102 Sym ifltz(Sym a, Sym b, Sym c) {
+00103     SymVec args;
+00104     args.push_back(a);
+00105     args.push_back(b);
+00106     args.push_back(c);
+00107     return Sym(ifltz_token, args);
+00108 }
+00109 
+
Generated on Thu Oct 19 05:06:42 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_sym_ops_8h-source.html b/trunk/paradiseo-eo/doc/html/_sym_ops_8h-source.html new file mode 100644 index 000000000..4ce36a5fb --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_sym_ops_8h-source.html @@ -0,0 +1,46 @@ + + +EO: SymOps.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / fun
+

SymOps.h

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #ifndef SYMOPS_H
+00019 #define SYMOPS_H
+00020 
+00021 #include "Sym.h"
+00022 
+00023 extern Sym operator+(Sym a, Sym b);
+00024 extern Sym operator*(Sym a, Sym b);
+00025 extern Sym operator/(Sym a, Sym b);
+00026 extern Sym operator-(Sym a, Sym b);
+00027 extern Sym pow(Sym a, Sym b);
+00028 extern Sym ifltz(Sym a, Sym b, Sym c);
+00029 extern Sym operator-(Sym a);
+00030 
+00031 #endif
+
Generated on Thu Oct 19 05:06:42 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_target_info_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_target_info_8cpp-source.html new file mode 100644 index 000000000..dfd336b79 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_target_info_8cpp-source.html @@ -0,0 +1,153 @@ + + +EO: TargetInfo.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / regression
+

TargetInfo.cpp

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #include "TargetInfo.h"
+00019 
+00020 using namespace std;
+00021 
+00022 TargetInfo::TargetInfo(const TargetInfo& org) { operator=(org); }
+00023 
+00024 TargetInfo& TargetInfo::operator=(const TargetInfo& org) {
+00025     _targets.resize(org._targets.size());
+00026     _weights.resize(org._weights.size());
+00027     _tcov_part.resize(org._tcov_part.size());
+00028     
+00029     _targets = org._targets;
+00030     _weights = org._weights;
+00031     _tcov_part = org._tcov_part;
+00032 
+00033     _tmean = org._tmean;
+00034     _tvar  = org._tvar;
+00035     _tstd  = org._tstd;
+00036     _tmed = org._tmed;
+00037     return *this;
+00038 }
+00039       
+00040 
+00041 TargetInfo::TargetInfo(const std::valarray<double>& t) {
+00042     _weights.resize(0);
+00043     _targets.resize(t.size());
+00044     _targets = t;
+00045     
+00046     _tmean = _targets.sum()/_targets.size();
+00047     
+00048     _tcov_part.resize(_targets.size());
+00049     _tcov_part = _targets;
+00050     _tcov_part -= _tmean;
+00051         
+00052     std::valarray<double> tmp = _tcov_part;
+00053     tmp = _tcov_part;
+00054     tmp *= tmp;
+00055         
+00056     _tvar = tmp.sum() / (tmp.size()-1);
+00057     _tstd = sqrt(_tvar);
+00058     _tmed = 0;
+00059 }
+00060 
+00061 TargetInfo::TargetInfo(const std::valarray<double>& t, const std::valarray<double>& w) {
+00062 
+00063     _targets.resize(t.size());
+00064     _weights.resize(w.size());
+00065 
+00066     _targets = t;
+00067     _weights = w;
+00068     
+00069     double sumw = _weights.sum();
+00070         // scale weights so that they'll add up to 1
+00071     _weights /= sumw;
+00072         
+00073     _tmean = (_targets * _weights).sum();
+00074     _tcov_part.resize(_targets.size());
+00075     _tcov_part = _targets;
+00076     _tcov_part -= _tmean;
+00077 
+00078     _tvar = (pow(_targets - _tmean, 2.0) * _weights).sum();
+00079     _tstd = sqrt(_tvar);
+00080     _tmed = 0.;
+00081 }
+00082 
+00083 // calculate the members, now in the context of a mask
+00084 void TargetInfo::set_training_mask(const std::valarray<bool>& tmask) {
+00085     
+00086     TargetInfo tmp;
+00087     
+00088     if (has_weights() ) {
+00089         tmp = TargetInfo( _targets[tmask], _weights[tmask]);
+00090     } else {
+00091         tmp = TargetInfo( _targets[tmask] );
+00092     }
+00093     
+00094     _tcov_part.resize(tmp._tcov_part.size());
+00095     _tcov_part = tmp._tcov_part;
+00096 
+00097     _tmean = tmp._tmean;
+00098     _tvar  = tmp._tvar;
+00099     _tstd  = tmp._tstd;
+00100     _tmed =  tmp._tmed;
+00101 
+00102     _training_mask.resize(tmask.size());
+00103     _training_mask = tmask;
+00104 }
+00105 
+00106 struct SortOnTargets
+00107 {
+00108     const valarray<double>& t;
+00109     SortOnTargets(const valarray<double>& v) : t(v) {}
+00110 
+00111     bool operator()(int i, int j) const {
+00112         return fabs(t[i]) < fabs(t[j]);
+00113     }
+00114 };
+00115     
+00116 vector<int> TargetInfo::sort() {
+00117     
+00118     vector<int> ind(_targets.size());
+00119     for (unsigned i = 0; i < ind.size(); ++i) { ind[i] = i; }
+00120 
+00121     std::sort(ind.begin(), ind.end(), SortOnTargets(_targets));
+00122 
+00123     valarray<double> tmptargets = _targets;
+00124     valarray<double> tmpweights = _weights;
+00125     valarray<double> tmpcov     = _tcov_part;
+00126     
+00127     for (unsigned i = 0; i < ind.size(); ++i) 
+00128     {
+00129         _targets[i] = tmptargets[ ind[i] ];
+00130         _tcov_part[i] = tmpcov[ ind[i] ];       
+00131         if (_weights.size()) _weights[i] = tmpweights[ ind[i] ];
+00132     }
+00133 
+00134     return ind;
+00135 }
+00136 
+00137 
+00138 
+
Generated on Thu Oct 19 05:06:44 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_target_info_8h-source.html b/trunk/paradiseo-eo/doc/html/_target_info_8h-source.html new file mode 100644 index 000000000..2cc40c34c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_target_info_8h-source.html @@ -0,0 +1,80 @@ + + +EO: TargetInfo.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / regression
+

TargetInfo.h

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #ifndef TARGETINFO_H_
+00019 #define TARGETINFO_H_
+00020 
+00021 #include <valarray>
+00022 #include <vector>
+00023 
+00024 class TargetInfo {
+00025     std::valarray<double> _targets;
+00026     std::valarray<double> _weights;
+00027     std::valarray<bool>   _training_mask;
+00028 
+00029     // some stuff for ols
+00030     std::valarray<double> _tcov_part;
+00031     double _tmean;
+00032     double _tvar;
+00033     double _tstd;
+00034     double _tmed;
+00035 
+00036     public:
+00037     TargetInfo() {}
+00038 
+00039     TargetInfo(const std::valarray<double>& t);
+00040     TargetInfo(const std::valarray<double>& t, const std::valarray<double>& w);
+00041 
+00042     TargetInfo(const TargetInfo& org);
+00043     TargetInfo& operator=(const TargetInfo& org);
+00044     ~TargetInfo() {}
+00045 
+00046     const std::valarray<double>& targets() const { return _targets; }
+00047     const std::valarray<double>& weights() const { return _weights; }
+00048     const std::valarray<bool>&   mask() const { return _training_mask; }
+00049 
+00050     void set_training_mask(const std::valarray<bool>& mask);
+00051 
+00052     bool has_weights() const { return _weights.size(); }
+00053     bool has_mask()    const { return _training_mask.size(); }
+00054 
+00055     std::vector<int> sort();
+00056 
+00057     const std::valarray<double>& tcov_part() const { return _tcov_part; }
+00058     double tmean() const { return _tmean; }
+00059     double tvar()  const { return _tvar; }
+00060     double tstd()  const { return _tstd; }
+00061     double devmedian() const { return _tmed; }
+00062 };
+00063 
+00064 #endif
+00065 
+
Generated on Thu Oct 19 05:06:44 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_tree_builder_8cpp-source.html b/trunk/paradiseo-eo/doc/html/_tree_builder_8cpp-source.html new file mode 100644 index 000000000..1e6789f4b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_tree_builder_8cpp-source.html @@ -0,0 +1,61 @@ + + +EO: TreeBuilder.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / gen
+

TreeBuilder.cpp

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #include <utils/eoRNG.h>
+00019 #include "TreeBuilder.h"
+00020 
+00021 Sym TreeBuilder::make_terminal() const {
+00022     if (rng.flip(vcprob)) {
+00023         return table.get_random_var();
+00024     }
+00025 
+00026     return table.get_random_const();
+00027 }
+00028 
+00029 Sym TreeBuilder::build_tree(unsigned max_depth,  bool grow) const {
+00030     if (max_depth == 0 || grow && rng.random(2) == 0) { 
+00031         return make_terminal();
+00032     }
+00033 
+00034     // pick a random function, no matter what arity
+00035     
+00036     functor_t func = table.get_random_function();
+00037     
+00038     SymVec args(func.arity);
+00039     
+00040     for (unsigned i = 0; i < args.size(); ++i) {
+00041         args[i] = build_tree(max_depth-1, grow);
+00042     }
+00043 
+00044     return Sym(func.token, args);
+00045 }
+00046 
+
Generated on Thu Oct 19 05:06:44 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_tree_builder_8h-source.html b/trunk/paradiseo-eo/doc/html/_tree_builder_8h-source.html new file mode 100644 index 000000000..b99b02916 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_tree_builder_8h-source.html @@ -0,0 +1,60 @@ + + +EO: TreeBuilder.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / gen
+

TreeBuilder.h

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #ifndef TREEBUILDER_H_
+00019 #define TREEBUILDER_H_
+00020 
+00021 #include "Sym.h"
+00022 #include "LanguageTable.h"
+00023 
+00024 class TreeBuilder {
+00025     const LanguageTable& table;
+00026 
+00027     // probability of selecting a var versus a const when the choice boils down to selecting a terminal
+00028     double vcprob;
+00029     
+00030     Sym make_terminal() const;
+00031     public:
+00032 
+00033     TreeBuilder(const LanguageTable& t) : table(t), vcprob(0.9) {};
+00034     TreeBuilder(const LanguageTable& t, double vc) : table(t), vcprob(vc) {};
+00035     
+00036     void set_var_vs_const_probability(double p) { vcprob = p; }
+00037     
+00038     Sym build_tree(unsigned max_depth, bool grow) const;
+00039 
+00040     void build_tree(Sym& tree, unsigned max_depth, bool grow) const { tree = build_tree(max_depth, grow); }
+00041     
+00042 };
+00043 
+00044 #endif
+00045 
+
Generated on Thu Oct 19 05:06:44 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/_virus_op_8h-source.html b/trunk/paradiseo-eo/doc/html/_virus_op_8h-source.html new file mode 100644 index 000000000..c4fe325aa --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/_virus_op_8h-source.html @@ -0,0 +1,133 @@ + + +EO: VirusOp.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / MGE
+

VirusOp.h

00001 /*
+00002    ViruOp.h
+00003    (c) GeNeura Team 2001, Marc Schoenauer 2000
+00004 
+00005     This library is free software; you can redistribute it and/or
+00006     modify it under the terms of the GNU Lesser General Public
+00007     License as published by the Free Software Foundation; either
+00008     version 2 of the License, or (at your option) any later version.
+00009 
+00010     This library is distributed in the hope that it will be useful,
+00011     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00012     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00013     Lesser General Public License for more details.
+00014 
+00015     You should have received a copy of the GNU Lesser General Public
+00016     License along with this library; if not, write to the Free Software
+00017     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00018 
+00019     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00020              Marc.Schoenauer@polytechnique.fr
+00021 CVS Info: $Date: 2003/02/27 19:26:43 $ $Header: /cvsroot/eodev/eo/contrib/MGE/VirusOp.h,v 1.3 2003/02/27 19:26:43 okoenig Exp $ $Author: okoenig $
+00022 */
+00023 
+00024 #ifndef VirusOp_h
+00025 #define VirusOp_h
+00026 
+00027 //-----------------------------------------------------------------------------
+00028 
+00029 #include <iostream>    // ostream, istream
+00030 #include <functional>  // bind2nd
+00031 #include <string>      // std::string
+00032 
+00033 #include <utils/eoRNG.h>
+00034 #include "../contrib/MGE/eoVirus.h"
+00035 
+00039 template<class FitT>
+00040 class VirusBitFlip: public eoMonOp<eoVirus<FitT> > {
+00041  public:
+00043   virtual std::string className() const { return "VirusBitFlip"; };
+00044 
+00049   bool operator()(eoVirus<FitT>& _chrom) {
+00050       unsigned i = eo::rng.random(_chrom.size());
+00051       _chrom.virusBitSet(i, _chrom.virusBit(i) ? false : true );
+00052       return true;
+00053   }
+00054 };
+00055 
+00056 template<class FitT>
+00057 class VirusMutation: public eoMonOp<eoVirus<FitT> > {
+00058  public:
+00060   virtual std::string className() const { return "VirusMutation"; };
+00061 
+00066   bool operator()(eoVirus<FitT>& _chrom) {
+00067         // Search for virus bits
+00068         std::vector<unsigned> bitsSet;
+00069         for ( unsigned i = 0; i < _chrom.size(); i ++ ) {
+00070           if ( _chrom.virusBit(i) ) {
+00071                 bitsSet.push_back( i );
+00072           }
+00073         }
+00074         if ( !bitsSet.size() ) {
+00075           return false;
+00076         }
+00077     unsigned flipSite = eo::rng.random(bitsSet.size());
+00078         unsigned flipValue = bitsSet[ flipSite ];
+00079         _chrom[flipValue] = _chrom[flipValue] ? false : true;
+00080         return true;
+00081   }
+00082 };
+00083 
+00085 template<class FitT>
+00086 class VirusShiftMutation: public eoMonOp<eoVirus<FitT> > {
+00087  public:
+00088 
+00090   VirusShiftMutation( ) {};
+00091 
+00093   virtual std::string className() const { return "VirusShiftMutation"; };
+00094 
+00099   bool operator()(eoVirus<FitT>& _chrom) {
+00100         // Search for virus bits
+00101         eoBooleanGenerator gen;
+00102         for ( unsigned i = 0; i < _chrom.size(); i ++ ) {
+00103           if ( _chrom.virusBit(i) ) {
+00104                 if ( gen() ) {
+00105                   if ( i + 1 < _chrom.size() ) {
+00106                         _chrom.virusBitSet(i+1,true);
+00107                         _chrom.virusBitSet(i, false);
+00108                   }
+00109                 } else {
+00110                   if ( i - 1 > 0 ) {
+00111                         _chrom.virusBitSet(i-1,true);
+00112                         _chrom.virusBitSet(i, false);
+00113                   }
+00114                 }
+00115           }
+00116         }
+00117         return true;
+00118   }
+00119 
+00120  private:
+00121 };
+00122 
+00123 
+00124 template<class FitT>
+00125 class VirusTransmission: public eoBinOp<eoVirus<FitT> > {
+00126  public:
+00128   virtual std::string className() const { return "VirusTransmission"; };
+00129 
+00135   bool operator()(eoVirus<FitT>& _chrom,const eoVirus<FitT>& _chrom2) {
+00136         // Search for virus bits
+00137         for ( unsigned i = 0; i < _chrom.size(); i ++ ) {
+00138           _chrom.virusBitSet(i, _chrom2.virusBit(i) );
+00139         }
+00140         return true;
+00141   }
+00142 };
+00143 
+00144 #endif //VirusOp_h
+
Generated on Thu Oct 19 05:06:44 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/abstract1_8cpp-source.html b/trunk/paradiseo-eo/doc/html/abstract1_8cpp-source.html new file mode 100644 index 000000000..55e3a4c94 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/abstract1_8cpp-source.html @@ -0,0 +1,61 @@ + + +EO: abstract1.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / pyeo
+

abstract1.cpp

00001 /*
+00002     PyEO
+00003     
+00004     Copyright (C) 2003 Maarten Keijzer
+00005 
+00006     This program is free software; you can redistribute it and/or modify
+00007     it under the terms of the GNU General Public License as published by
+00008     the Free Software Foundation; either version 2 of the License, or
+00009     (at your option) any later version.
+00010 
+00011     This program is distributed in the hope that it will be useful,
+00012     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00013     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00014     GNU General Public License for more details.
+00015 
+00016     You should have received a copy of the GNU General Public License
+00017     along with this program; if not, write to the Free Software
+00018     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00019 */
+00020 
+00021 #include <eoEvalFunc.h>
+00022 #include <eoInit.h>
+00023 #include <eoTransform.h>
+00024 #include <eoSGATransform.h>
+00025 #include <eoPopEvalFunc.h>
+00026 
+00027 #include "PyEO.h"
+00028 #include "def_abstract_functor.h"
+00029 
+00030 using namespace boost::python;
+00031 
+00032 void abstract1()
+00033 {
+00034     /* Abstract Classes: overrideble from python */
+00035     def_abstract_functor<eoEvalFunc<PyEO> >("eoEvalFunc");
+00036     def_abstract_functor<eoInit< PyEO > >("eoInit");
+00037   
+00038     def_abstract_functor<eoTransform<PyEO> >("eoTransform");
+00039     
+00040     class_<eoSGATransform<PyEO>, bases<eoTransform<PyEO> > >("eoSGATransform",
+00041             init< eoQuadOp<PyEO>&, double,
+00042                   eoMonOp<PyEO>&, double>())
+00043         .def("__call__", &eoSGATransform<PyEO>::operator());
+00044     
+00045     def_abstract_functor<eoPopEvalFunc<PyEO> >("eoPopEvalFunc");
+00046 }  
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/algos_8cpp-source.html b/trunk/paradiseo-eo/doc/html/algos_8cpp-source.html new file mode 100644 index 000000000..f47d97cdb --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/algos_8cpp-source.html @@ -0,0 +1,121 @@ + + +EO: algos.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / pyeo
+

algos.cpp

00001 /*
+00002     PyEO
+00003     
+00004     Copyright (C) 2003 Maarten Keijzer
+00005 
+00006     This program is free software; you can redistribute it and/or modify
+00007     it under the terms of the GNU General Public License as published by
+00008     the Free Software Foundation; either version 2 of the License, or
+00009     (at your option) any later version.
+00010 
+00011     This program is distributed in the hope that it will be useful,
+00012     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00013     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00014     GNU General Public License for more details.
+00015 
+00016     You should have received a copy of the GNU General Public License
+00017     along with this program; if not, write to the Free Software
+00018     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00019 */
+00020 
+00021 #include <eoSGA.h>
+00022 #include <eoEasyEA.h>
+00023 #include <eoDetSelect.h>
+00024 #include <eoCellularEasyEA.h>
+00025 
+00026 #include "PyEO.h"
+00027 #include "def_abstract_functor.h"
+00028 
+00029 using namespace boost::python;
+00030 
+00031 void algos()
+00032 {
+00033     def_abstract_functor<eoAlgo<PyEO> >("eoAlgo");
+00034     
+00035     /* Algorithms */
+00036     class_<eoSGA<PyEO>, bases<eoAlgo<PyEO> >, boost::noncopyable>("eoSGA", 
+00037             init<eoSelectOne<PyEO>&, 
+00038             eoQuadOp<PyEO>&, float,
+00039             eoMonOp<PyEO>&, float,
+00040             eoEvalFunc<PyEO>&, 
+00041             eoContinue<PyEO>&>()
+00042             [
+00043             with_custodian_and_ward<1,2,
+00044                 with_custodian_and_ward<1,3,
+00045                     with_custodian_and_ward<1,5,
+00046                         with_custodian_and_ward<1,7,
+00047                             with_custodian_and_ward<1,8>
+00048                         >
+00049                     >
+00050                 >
+00051             >()
+00052             ])
+00053         .def("__call__", &eoSGA<PyEO>::operator())
+00054         ;
+00055    
+00056     class_<eoEasyEA<PyEO>, bases<eoAlgo<PyEO> > >("eoEasyEA",
+00057               init<
+00058                 eoContinue<PyEO>&,
+00059                 eoEvalFunc<PyEO>&,
+00060                 eoBreed<PyEO>&,
+00061                 eoReplacement<PyEO>& >() )
+00062         .def( init<
+00063                 eoContinue<PyEO>&,
+00064                 eoPopEvalFunc<PyEO>&,
+00065                 eoBreed<PyEO>&,
+00066                 eoReplacement<PyEO>&>() )
+00067         .def( init<
+00068                 eoContinue<PyEO>&,
+00069                 eoEvalFunc<PyEO>&,
+00070                 eoBreed<PyEO>&,
+00071                 eoMerge<PyEO>&,
+00072                 eoReduce<PyEO>& >() )
+00073         .def( init<
+00074                 eoContinue<PyEO>&,
+00075                 eoEvalFunc<PyEO>&,
+00076                 eoSelect<PyEO>&,
+00077                 eoTransform<PyEO>&,
+00078                 eoReplacement<PyEO>&>())
+00079         .def( init<
+00080                 eoContinue<PyEO>&,
+00081                 eoEvalFunc<PyEO>&,
+00082                 eoSelect<PyEO>&,
+00083                 eoTransform<PyEO>&,
+00084                 eoMerge<PyEO>&,
+00085                 eoReduce<PyEO>&>())
+00086         .def("__call__", &eoEasyEA<PyEO>::operator())
+00087         ;
+00088    
+00089     /*
+00090     class_<eoCellularEasyEA<PyEO>, bases< eoAlgo<PyEO> > >("eoCellularEasyEA", 
+00091             init<   eoContinue<PyEO>&,
+00092                     eoEvalFunc<PyEO>&,
+00093                     eoSelectOne<PyEO>&,
+00094                     eoBinOp<PyEO>&,
+00095                     eoMonOp<PyEO>&,
+00096                     eoSelectOne<PyEO>&>())
+00097         .def(
+00098             init<   eoContinue<PyEO>&,
+00099                     eoEvalFunc<PyEO>&,
+00100                     eoSelectOne<PyEO>&,
+00101                     eoQuadOp<PyEO>&,
+00102                     eoMonOp<PyEO>&,
+00103                     eoSelectOne<PyEO>&>())
+00104         ;
+00105     */
+00106 }
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/annotated.html b/trunk/paradiseo-eo/doc/html/annotated.html new file mode 100644 index 000000000..86fc02b7a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/annotated.html @@ -0,0 +1,361 @@ + + +EO: Class List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

EO Class List

Here are the classes, structs, unions and interfaces with brief descriptions: + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
eo1PtBitCrossoverEo1PtBitXover --> classic 1-point crossover
eoAged< Object >EoAge is a template class that adds an age to an object.\ Requisites for template instantiation are that the object must admit a default ctor and a copy ctor
eoAlgo< EOT >This is a generic class for population-transforming algorithms
eoArithmeticCrossoverEoHypercubeCrossover --> uniform choice in hypercube == arithmetical with different values for each coordinate
eoAssembledFitnessAverageStat< EOT >Average fitness values of a population, where the fitness is of type eoScalarAssembledFitness
eoAssembledFitnessBestStat< EOT >Fitness values of best individuum in a population, where the fitness is of type eoScalarAssembledFitness
eoAtomExchange< Atom >A helper class for choosing which genes to exchange
eoAverageStat< EOT >Average fitness of a population
eoBestFitnessStat< EOT >Best fitness of a population
eoBestSelect< EOT >EoBestSelect: a selection method that always return the best (mainly for testing purposes)
eoBF< A1, A2, R >Basic Binary Functor
BiasedNodeSelectorA node selector that does a specified number of rounds ignoring terminals
eoBinaryFunctorCounter< BinaryFunctor >Generic counter class that counts the number of times a binary function is used
eoBinCloneOp< EOT >Binary clone: two operands, only the first could be modified
eoBinGenOp< EOT >Wrapper for binop: here we use select method of eoPopulator but we could also have an embedded selector to select the second parent
eoBinOp< EOType >Binary genetic operator: subclasses eoOp, and defines basically the operator() with two operands, only the first one can be modified When defining your own, make sure that you return a boolean value indicating that you have changed the content
eoBit< FitT >Implementation of bitstring chromosome
eoBitBitFlipEoBitFlip --> changes 1 bit
eoBitGxOver< Chrom >EoBitGxOver --> Npts crossover when bistd::string considered as a std::string of binary-encoded genes (exchanges genes) Is anybody still using it apart from historians ??? :-)
eoBitInversion< Chrom >EoBitInversion: inverts the bits of the chromosome between an interval
eoBitMutation< Chrom >EoBitMutation --> classical mutation
eoBitNext< Chrom >EoBitNext --> next value when bitstring considered as binary value
eoBitOpFactory< EOT >EO Factory
eoBitPrev< Chrom >EoBitPrev --> previous value when bitstring treated as binary value
boolean_generatorThe class boolean_generator can be used in the STL generate function to easily generate random booleans with a specified bias
eoBooleanGeneratorThe class eoBooleanGenerator can be used in the STL generate function to easily generate random booleans with a specified bias
eoBooleanInitThe class eoBooleanInit can be used in the STL apply function to easily generate random booleans with a specified bias
eoBoolFlipSimple boolean mutation - to be used in generic eoOp's
eoBranchMutation< FType, Node >EoBranchMutation --> replace a subtree with a randomly created subtree
eoBreed< EOT >Breeding: combination of selecting and transforming a population
eoCellularEasyEA< EOT >The abstract cellular easy algorithm
eoCheckPoint< EOT >EoCheckPoint is a container class
eoCMABreed< FitT >TODO, handle bounds
eoCMAInit< FitT >TODO, handle bounds
eoCollapseSubtreeMutation< FType, Node >EoCollapseSubtree --> replace a subtree with a randomly chosen terminal
eoCombinedContinue< EOT >Combined continuators - logical AND: Continues until one of the embedded continuators says halt!
eoCombinedInit< EOT >Combined INIT: a proportional recombination of eoInit objects
eoCommaReplacement< EOT >ES type of replacement strategy: ignore parents, truncate offspring
eoContinue< EOT >Termination condition for the genetic algorithm Takes the population as input, returns true for continue, false for termination
eoCountedDynUpdateAn eoUpdater to update an eoUpdatable object every given tic
eoCountedStateSaverEoUpdater that saves a state every given generations
CovSingle covariance between two variates
eoCtrlCContinue< EOT >Ctrl C handling: this eoContinue tells whether the user pressed Ctrl C
eoDetBitFlip< Chrom >EoDetBitFlip --> changes exactly k bits
eoDeterministicSaDReplacement< EOT >EoDeterministicSaDReplacement: replacement strategy that is just, in sequence saves best and kill worse from parents + saves best and kill worse from offspring + merge remaining (neither save nor killed) parents and offspring + reduce that merged population = returns reduced pop + best parents + best offspring
eoDeterministicSurviveAndDie< EOT >An instance (theonly one as of today, Dec
eoDetSelect< EOT >EoDetSelect selects many individuals determinisctically
eoDetTournamentSelect< EOT >EoDetTournamentSelect: a selection method that selects ONE individual by deterministic tournament -MS- 24/10/99
eoDetTournamentTruncate< EOT >Truncate class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g
eoDetTournamentTruncateSplit< EOT >ReduceSplit class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g
eoDetTournamentWorthSelect< EOT, WorthT >An instance of eoSelectPerf2Worth that does selection from the Worthes using a ..
eoDetUniformMutation< EOT >EoDetUniformMutation --> changes exactly k values of the std::vector by uniform choice with range epsilon
eoDistance< EOT >This is a generic class for distance functors: takes 2 things ane returns a double
eoDistribUpdater< EOT >Base class for Distribution Evolution Algorithms within EO: the update rule of distribution
eoDistribution< EOT >Abstract class for Distribution Evolution Algorithms within EO: the distribution itself
dMatrixA helper class for Sharing - to hold distances
eoDominanceMap< EoType >EoDominanceMap, utility class to calculate and maintain a map (std::vector<std::vector<bool> >) of pareto dominance statistics
eoDoubleExchangeDiscrete crossover == exchange of values
eoDoubleIntermediateIntermediate crossover == linear combination
eoDrawable< Object >EoDrawable is a template class that adds a drawing interface to an object.\ Requisites for template instantiation are that the object must admit a default ctor and a copy ctor
DummyTest program for the general operator - millenium version! uses dummy individuals
eoDynSGATransform< EOT >EoDynSGATransform: transforms a population using genetic operators
eoDynUpdaterA base class to actually update an eoUpdatable object
eoEasyEA< EOT >An easy-to-use evolutionary algorithm; you can use any chromosome, and any selection transformation, merging and evaluation algorithms; you can even change in runtime parameters of those sub-algorithms
eoEDA< EOT >EoEDA: Estimation of Distribution Algorithm within EO
eoEliteSequentialSelect< EOT >All Individuals in order
eoElitism< EOT >Straightforward elitism class, specify the number of individuals to copy into new geneneration or the rate w.r.t
EO< F >EO is a base class for evolvable objects, that is, the subjects of evolution
eoEPReduce< EOT >EP truncation method (some global stochastic tournament + sort) Softer selective pressure than pure truncate
eoEPReplacement< EOT >EP type of replacement strategy: first add parents to population, then truncate using EP tournament
eoEsChromInit< EOT >Random Es-chromosome initializer (therefore derived from eoInit)
eoEsFull< Fit >The most complex evolutionary strategy representation
eoEsGlobalXover< EOT >Gloabl crossover operator for ES genotypes
eoEsMutate< EOT >ES-style mutation in the large
eoEsMutationInitInitialize Mutation operator
eoEsSimple< Fit >Simple Evolution Strategy
eoEsStandardXover< EOT >Standard (i.e
eoEsStdev< Fit >Evolutionary Strategy with a standard deviation per parameter
eoEvalContinue< EOT >Continues until a number of evaluations has been made
eoEvalFunc< EOT >Evaluate: takes one EO and sets its "fitness" property returning this fitness also
eoEvalFuncCounter< EOT >Counts the number of evaluations actually performed, thus checks first if it has to evaluate.
eoEvalFuncPtr< EOT, FitT, FunctionArg >EOEvalFuncPtr: This class takes an existing function pointer and converts it into a evaluation function class
eoExpansionMutation< FType, Node >EoExpansionMutation --> replace a terminal with a randomly created subtree
eoExternalBinOp< F, External, ExternalEO >Crossover of external struct, ctor expects a function of the following signature:
eoExternalEO< Fit, External >Definition of an object that allows an external struct to be inserted in EO
eoExternalEvalFunc< F, External, ExternalEO >Evaluation of external struct, ctor expects a function of the following signature:
eoExternalInit< F, External, ExternalEO >Initialization of external struct, ctor expects a function of the following signature:
eoExternalMonOp< F, External, ExternalEO >Mutation of external struct, ctor expects a function of the following signature:
eoExternalQuadOp< F, External, ExternalEO >Crossover of external struct, ctor expects a function of the following signature:
eoF< R >Basic Function
eoFactory< EOClass >EO Factory
eoFDCFileSnapshot< EOT >Specific class for FDCStat monitoring: As I failed to have FDC stat as an eoStat, this is the trick to put the 2 eoParam<std::vector<double> > into a monitor This class does nothing else
eoFDCStat< EOT >The FDC computation - stores the values into eoValueParam<EOT,double> so they can be snapshot by some eoGnuplotSnapshot ..
eoFileMonitorPrints statistics to file
eoFileSnapshotPrints snapshots of fitnesses to a (new) file every N generations
eoFitContinue< EOT >Fitness continuation:
eoFitnessScalingSelect< EOT >EoFitnessScalingSelect: select an individual proportional to the linearly scaled fitness that is computed by the private eoLinearFitScaling object
eoFitnessStat< EOT, FitT >The fitnesses of a whole population, as a vector
eoFlOr1ptBinOp< EOT >The 1pt crossover (just in case someone wants it some day!)
eoFlOr1ptQuadOp< EOT >The 1pt crossover (just in case someone wants it some day!)
eoFlOrAllAtomBinOp< EOT >Bin Crossover using an Atom Crossover that is applied to a ALL components with given rate
eoFlOrAllAtomQuadOp< EOT >Quad Crossover using an Atom Crossover
eoFlOrAllMutation< EOT >Applies an atomic mutation to all the components with a given rate
eoFlOrKAtomBinOp< EOT >Bin Crossover using an Atom Crossover that is applied to a FIXED NB of components
eoFlOrKAtomQuadOp< EOT >Quad Crossover using an Atom Crossover that is applied to a FIXED NB of components
eoFlOrKMutation< EOT >Applies an atomic mutation to a fixed number of components (1 by default)
eoFlOrUniformBinOp< EOT >The uniform crossover - exchanges atoms uniformly !
eoFlOrUniformQuadOp< EOT >The uniform crossover - exchanges atoms uniformly !
eoFunctorBaseBase class for functors to get a nice hierarchy diagram
eoFunctorBase::binary_function_tagTag to identify a binary function in compile time function selection functor_category
eoFunctorBase::procedure_tagTag to identify a procedure in compile time function selection functor_category
eoFunctorBase::unary_function_tagTag to identify a unary function in compile time function selection functor_category
eoFunctorStoreEoFunctorStore is a class that stores functors that are allocated on the heap
eoG3Replacement< EOT >EoG3Replacement is an eoReplacement: - no strong elitism (is suppposed to be within a steady-state engine) - choose N (2) parents RANDOMLY - remove them from the parent population - merge offspring and the N removed parents - select best N of this merged population - put them back into parent population
eoGenContinue< EOT >Generational continuator: continues until a number of generations is reached
eoGeneDelChooser< EOT >A helper class for choosing which site to delete
eoGeneralBreeder< EOT >Base class for breeders using generalized operators
eoGeneralIntBoundsA class that encapsulate all possible eoIntBounds
eoGeneralRealBoundsA class that encapsulate all possible eoIntBounds
eoGenerationalReplacement< EOT >Generational replacement == swap populations
eoGenOp< EOT >The base class for General Operators Subclass this operator is you want to define an operator that falls outside of the eoMonOp, eoBinOp, eoQuadOp classification
eoGnuplotBase class for calls to gnuplot
eoGnuplot1DMonitorPlot eoStat
eoGnuplot1DSnapshotPlot stats through gnuplot
eoHammingDistance< EOT >This is a generic class for L1 distance computation: assumes the 2 things are std::vectors of something that is double-castable For bitstrings, this is the Hamming distance
eoHoistMutation< FType, Node >EoHoistMutation --> replace the individual with one of its subtree's
eoHowManyA helper class, to determine a number of individuals from another one Typically, is used in selection / replacement procedures, e.g
eoIncrementor< T >EoUpdater that simply increments a counter
eoIncrementorParam< T >EoUpdater that is an eoValueParam (and thus OWNS its counter) Mandatory for generation counter in make_checkpoint
eoInit< EOT >Base (name) class for Initialization of chromosomes, used in a population contructor
eoInitAdaptor< EOT >EoInitAdaptor changes the place in the hierarchy from eoInit to eoMonOp
eoInitFixedLength< EOT >Initializer for fixed length representations with a single type
eoInitGenerator< EOT >Turning an eoInit into a generator probably we should only use genrators - and suppress eoInit ??? MS - July 2001
eoInitVariableLength< EOT >Initializer for variable length representations with a single type
eoInitVirus< FitT >Initializer for binary chromosome with MGE
eoInitVirus1bit< FitT >Inits the virus with one bit to the left set to one
eoInnerExchangeQuadOp< EOT >Crossover using an AtomCrossover
eoIntAboveBoundAn eoIntBound bounded from above only
eoIntBelowBoundEoIntBound bounded from below only
eoIntBoundsDefines bound classes for real numbers
eoIntIntervalFully bounded eoIntBound == interval
eoIntNoBoundsA default class for unbounded variables
eoInvalidateBinOp< EOT >One of the invalidator operators
eoInvalidateMonOp< EOT >One of the invalidator operators
eoInvalidateQuadOp< EOT >One of the invalidator operators
eoLinearFitScaling< EOT >An instance of eoPerf2Worth COmputes the linearly scaled fitnesses with given selective pressure Pselect(Best) == pressure/sizePop Pselect(average) == 1.0/sizePop truncate negative values to 0 -
eoLinearRandomSplit< EOT >Random truncation - linear version
eoLinearTruncate< EOT >Truncate class that does not sort, but repeatidely kills the worse
eoLinearTruncateSplit< EOT >ReduceSplit class that does not sort, but repeatidely kills the worse
MemPoolPool allocator for the subtree and parse tree classes (homebrew and not compliant to ANSI allocator requirements) (c) copyright Maarten Keijzer 1999, 2000
gp_parse_tree::MemPoolPool allocator for the subtree and parse tree classes (homebrew and not compliant to ANSI allocator requirements) (c) copyright Maarten Keijzer 1999, 2000
eoMerge< Chrom >EoMerge: Base class for elitist replacement algorithms
eoMergeReduce< EOT >EoMergeReduce: abstract replacement strategy that is just an application of an embedded merge, followed by an embedded reduce
eoMGGReplacement< EOT >EoMGGReplacement is an eoReplacement: - choose N (2) parents RANDOMLY - remove them from the parent population - select best offspring, add to parents - merge (other?) offspring and the N removed parents - select best N-1 of this merged population (detTournament only at the moment) - put them back into parent population
MinimizingTraitsTest program for Pareto Fitness
eoMOFitnessStat< EOT, PartFitT >For multi-objective fitness, we need to translate a stat<vector<double> > into a vector<stat>, so each objective gets a seperate stat
eoMonCloneOp< EOT >Mon clone: one argument
eoMonGenOp< EOT >Wrapper for eoMonOp
eoMonitorThe abstract monitor class is a std::vector of parameter pointers
eoMonOp< EOType >EoMonOp is the monary operator: genetic operator that takes only one EO
eoNDPlusReplacement< EOT, WorthT >An elitist non-dominated sorted replacement scheme
eoNDSorting< EOT >Non dominated sorting, it *is a* std::vector of doubles, the integer part is the rank (to which front it belongs), the fractional part the niching penalty or distance penalty or whatever penalty you want to squeeze into the bits
eoNDSorting< EOT >::DummyEOUsed in fast nondominated sorting DummyEO is just a storage place for fitnesses and to store the original index
eoNDSorting_I< EOT >The original Non Dominated Sorting algorithm from Srinivas and Deb
eoNDSorting_II< EOT >Fast Elitist Non-Dominant Sorting Genetic Algorithm
negexp_generator< T >The class negexp_generator can be used in the STL generate function to easily generate negative exponential distributed floats and doubles
eoNegExpGenerator< T >The class negexp_generator can be used in the STL generate function to easily generate negative exponential distributed floats and doubles
eoNegExpInit< T >The class negexp_generator can be used in the STL generate function to easily generate negative exponential distributed floats and doubles
NodeSelectorBase class for selecting nodes
eoNoElitism< EOT >No elite
eoNoPerf2Worth< EOT >A dummy perf2worth, just in case you need it
normal_generator< T >The class normal_generator can be used in the STL generate function to easily generate gaussian distributed floats and doubles
eoNormalGenerator< T >The class normal_generator can be used in the STL generate function to easily generate gaussian distributed floats and doubles
eoNormalInit< T >The class normal_generator can be used in the STL generate function to easily generate gaussian distributed floats and doubles
eoNormalMutation< EOT >Simple normal mutation of a std::vector of real values
eoNormalVecMutation< EOT >Simple normal mutation of a std::vector of real values
eoNoSelect< EOT >EoNoSelect: returns all individual in order WITHOUT USING FITNESS!!! looping back to the beginning when exhasuted
eoNPtsBitXover< Chrom >EoNPtsBitXover --> n-point crossover
eoNthElementFitnessStat< EOT >The n_th element fitness in the population (see eoBestFitnessStat)
eoObjectEoObject used to be the base class for the whole hierarchy, but this has changed
eoOneFifthMutation< EOT >Dynamic version: just say it is updatable - and write the update() method! here the 1 fifth rule: count the proportion of successful mutations, and increase sigma if more than threshold (1/5 !)
eoOneMax< FitT >Always write a comment in this format before class definition if you want the class to be documented by Doxygen
eoOneMaxEvalFunc< EOT >Always write a comment in this format before class definition if you want the class to be documented by Doxygen
eoOneMaxInit< GenotypeT >Always write a comment in this format before class definition if you want the class to be documented by Doxygen
eoOneMaxMutation< GenotypeT >Always write a comment in this format before class definition if you want the class to be documented by Doxygen
eoOneMaxQuadCrossover< GenotypeT >Always write a comment in this format before class definition if you want the class to be documented by Doxygen
eoOp< EOType >Abstract data types for EO operators
eoOpContainer< EOT >EoOpContainer is a base class for the sequential and proportional selectors It takes care of wrapping the other operators, and deleting stuff that it has allocated
eoOpSelMason< eoClass >EO Mason, or builder, for operator selectors
eoParamEoParam: Base class for monitoring and parsing parameters
eoParameterLoaderParameter saving and loading
eoParamParamTypeAnother helper class for parsing parameters like Keyword(arg1, arg2, ...)
eoParetoFitness< FitnessTraits >EoParetoFitness class: std::vector of doubles with overloaded comparison operators
eoParetoFitnessTraitsEoFitnessTraits: a traits class to specify the number of objectives and which one are maximizing or not See test/t-eoParetoFitness for its use
eoParetoOneConstraintFitness< FitnessTraits >EoParetoOneConstraintFitness class: std::vector of doubles + constraint value
eoParetoRanking< EOT >Straightforward pareto ranking
eoParserEoParser: command line parser and configuration file reader This class is persistent, so it can be stored and reloaded to restore parameter settings
eoParseTree< FType, Node >Implementation of parse-tree for genetic programming
eoParseTreeDepthInit< FType, Node >EoParseTreeDepthInit : the initializer class for eoParseTree
eoPBILAdditive< EOT >Distribution Class for PBIL algorithm (Population-Based Incremental Learning, Baluja and Caruana 96)
eoPBILDistrib< EOT >Distribution Class for PBIL algorithm (Population-Based Incremental Learning, Baluja and Caruana 96)
eoPBILOrg< EOT >Distribution Class for PBIL algorithm (Population-Based Incremental Learning, Baluja and Caruana 95)
eoPerf2Worth< EOT, WorthT >Base class to transform raw fitnesses into fitness for selection
eoPerf2Worth< EOT, WorthT >::compare_worthHelper class used to sort indices into populations/worths
eoPerf2WorthCached< EOT, WorthT >Perf2Worth with fitness cache
eoPerf2WorthCached< EOT, WorthT >::compare_worthHelper class used to sort indices into populations/worths
eoPersistentAn persistent object that knows how to write (through functions inherited from eoPrintable#) and read itself
eoPlus< EOT >Very elitist class, copies entire population into next gen
eoPlusReplacement< EOT >ES type of replacement strategy: first add parents to population, then truncate
eoPointMutation< FType, Node >EoPointMutation --> replace a Node with a Node of the same arity
eoPop< EOT >A std::vector of EO object, to be used in all algorithms (selectors, operators, replacements, ...)
eoPop< EOT >::CmpHelper struct for comparing on pointers
eoPop< EOT >::RefHelper struct for getting a pointer
eoPopAlgo< EOT >For all "population transforming" algos ..
eoPopEvalFunc< EOT >EoPopEvalFunc: This abstract class is for GLOBAL evaluators of a population after variation
eoPopLoopEval< EOT >EoPopLoopEval: an instance of eoPopEvalFunc that simply applies a private eoEvalFunc to all offspring
eoPopStat< EOT >Thanks to MS/VC++, eoParam mechanism is unable to handle std::vectors of stats
eoPopulator< EOT >EoPopulator is a helper class for general operators eoGenOp It is an eoPop but also behaves like an eoPop::iterator as far as operator* and operator++ are concerned
eoPrintableBase class for objects that can print themselves (printOn#)
eoProcedureCounter< Procedure >Generic counter class that counts the number of times a procedure is used
eoPropCombinedBinOp< EOT >COmbined Binary genetic operator: operator() has two operands, only the first one can be modified
eoPropCombinedMonOp< EOT >EoMonOp is the monary operator: genetic operator that takes only one EO
eoPropCombinedQuadOp< EOT >Combined quad genetic operator: operator() has two operands, both can be modified
eoPropGAGenOp< EOT >*************************************************************************** eoPropGAGenOp (for Simple GA, but Proportional) choice between Crossover, mutation or cloining with respect to given relatve weights
eoProportionalOp< EOT >The proportional versions: easy!
eoProportionalSelect< EOT >EoProportionalSelect: select an individual proportional to her stored fitness value
eoQuad2BinOp< EOT >Turning an eoQuadOp into an eoBinOp: simply don't touch the second arg!
eoQuadCloneOp< EOT >Quad clone: two operands, both could be modified - but are not!
eoQuadDistance< EOT >This is a generic class for Euclidain distance (L2 norm) computation: assumes the 2 things are std::vectors of something that is double-castable
eoQuadGenOp< EOT >Wrapper for quadop: easy as pie
eoQuadOp< EOType >Quad genetic operator: subclasses eoOp, and defines basically the operator() with two operands, both can be modified
random_generator< T >The class random_generator can be used in the STL generate function to easily generate random ints either between [0, _max) if only one value (_max) is given to the ctor or in [_min,_max) if 2 values are given (_min, _max)
RandomNodeSelectorSelect nodes uniformly
eoRandomReduce< EOT >Random truncation
eoRandomSelect< EOT >EoRandomSelect: a selection method that selects ONE individual randomly
eoRandomSplit< EOT >Random truncation - batch version
eoRanking< EOT >An instance of eoPerfFromWorth COmputes the ranked fitness: fitnesses range in [m,M] with m=2-pressure/popSize and M=pressure/popSize
eoRankingSelect< EOT >EoRankingSelect: select an individual by roulette wheel on its rank is an eoRouletteWorthSelect, i.e
eoReal< FitT >EoReal: implementation of simple real-valued chromosome
eoRealAboveBoundAn eoRealBound bounded from above only
eoRealBaseVectorBoundsVector type for bounds (see eoRealBounds.h for scalar types) ------------ Class eoRealVectorBounds implements the std::vectorized version: it is basically a std::vector of eoRealBounds * and forwards all request to the elements of the std::vector
eoRealBelowBoundEoRealBound bounded from below only
eoRealBoundsDefines bound classes for real numbers
eoRealInitBounded< EOT >Simple initialization for any EOT that derives from std::vector<double> uniformly in some bounds
eoRealIntervalFully bounded eoRealBound == interval
eoRealNoBoundsA default class for unbounded variables
eoRealUxOverEoRealUxOver --> Uniform crossover, also termed intermediate crossover
eoRealVectorBoundsNow a derived class, for parser reading It holds some of the bounds (and destroy them when dying)
eoRealVectorNoBoundsDummy unbounded eoRealVectorBounds: usefull if you don't need bounds! everything is inlined
eoReduce< EOT >EoReduce: .reduce the new generation to the specified size At the moment, limited to truncation - with 2 different methods, one that sorts the whole population, and one that repeatidely kills the worst
eoReduceMerge< EOT >EoReduceMerge: Replacement strategies that start by reducing the parents, then merge with the offspring
eoReduceMergeReduce< EOT >EoReduceMergeReduce is an eoReplacement: - saves possible elite parents - reduces rest of parents - reduces offspring - merges reduced populations - reduces resulting merged pop if necessary
eoReduceSplit< EOT >EoReduceSplit: reduce the pop to the specified size AND eventually returns the eliminated guys
eoReplacement< EOT >
eoRndGenerator< T >By popular demand re-introducing a base class for a family of random number generators
eoRngRandom Number Generator
eoRouletteWorthSelect< EOT, WorthT >An instance of eoSelectPerf2Worth that does selection from the Worthes using a ..
eoScalarFitness< ScalarType, Compare >EoScalarFitness<ScalarType, Compare = less<ScalarType> >: Wraps a scalar fitness values such as a double or int, with the option of maximizing (using less<ScalarType>) or minimizing (using greater<ScalarType>)
eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits >Implements fitness as std::vector, storing all values that might occur during fitness assembly
eoScalarFitnessAssembledTraitsDefines properties of eoScalarFitnessAssembled
eoScalarFitnessStat< EOT, FitT >The fitnesses of a whole population, as a std::vector
eoSecondMomentStats< EOT >Average fitness + Std
eoSegmentCrossover< EOT >EoSegmentCrossover --> uniform choice in segment == arithmetical with same value along all coordinates
eoSelBinGenOp< EOT >Wrapper for eoBinOp with a selector
eoSelect< EOT >EoSelect selects a number of individuals from the first argument and puts it in the second
eoSelectFactory< EOT >EO Factory.An instance of the factory class to create selectors, that is, eoSelect objects
eoSelectFromWorth< EOT, WorthType >Selects one element from a population (is an eoSelectOne) but the selection is based on a std::vector of Worth that is different from the fitnesses (e.g
eoSelectivePopulator< EOT >SelectivePopulator an eoPoplator that uses an eoSelectOne to select guys
eoSelectMany< EOT >EoSelectMany selects many individuals using eoSelectOne as it's mechanism
eoSelectNumber< EOT >EoSelectNumber selects many individuals using eoSelectOne as it's mechanism
eoSelectOne< EOT, WorthT >EoSelectOne selects only one element from a whole population
eoSelectPerc< EOT >EoSelectPerc selects many individuals using eoSelectOne as it's mechanism
eoSelectTransform< EOT >Embedded select, followed by an embedded transform
eoSeqPopulator< EOT >SeqPopulator: an eoPopulator that sequentially goes through the population is supposed to be used after a batch select of a whole bunch or genitors
eoSequentialOp< EOT >Sequential selection: note the mark, rewind, unmark cycle here operators are repeatedly applied on the same individual(s) not all too elegant, but it sort of works..
eoSequentialSelect< EOT >All Individuals in order
eoSGA< EOT >The Simple Genetic Algorithm, following Holland and Goldberg
eoSGAGenOp< EOT >*************************************************************************** eoSGAGenOp (for Simple GA) mimicks the usual crossover with proba pCross + mutation with proba pMut inside an eoGeneralOp It does it exactly as class eoSGATransform, i.e
eoSGATransform< EOT >EoSGATransform: transforms a population using genetic operators
eoSharing< EOT >Sharing is a perf2worth class that implements Goldberg and Richardson's basic sharing see eoSharingSelect for how to use it and test/t-eoSharing.cpp for a sample use of both
eoSharingSelect< EOT >EoSharingSelect: select an individual by roulette wheel on its SHARED fitness
eoSimpleEDA< EOT >EoSimpleEDA: a very simple Estimation of Distribution Algorithm
eoSortedPopStat< EOT >Thanks to MS/VC++, eoParam mechanism is unable to handle std::vectors of stats
eoSortedStat< EOT, ParamType >The actual class that will be used as base for all statistics that need to be calculated over the sorted population It's an eoSortedStatBase AND an eoValueParam so it can be used in Monitors
eoSortedStatBase< EOT >Base class for statistics calculated over a sorted snapshot of the population
eoSSGADetTournamentReplacement< EOT >SSGA deterministic tournament replacement
eoSSGAStochTournamentReplacement< EOT >SSGA stochastic tournament replacement
eoSSGAWorseReplacement< EOT >SSGA replace worst
eoStat< EOT, T >The actual class that will be used as base for all statistics that need to be calculated over the (unsorted) population It is an eoStatBase AND an eoValueParam so it can be used in Monitors
eoStatBase< EOT >Base class for all statistics that need to be calculated over the (unsorted) population (I guess it is not really necessary? MS
eoStateEoState can be used to register derivants of eoPersistent
eoState::loading_errorLoading error thrown when nothing seems to work
eoStBranchMutation< FType, Node >EoStBranchMutation --> replace a strongly typed subtree with a randomly created strongly typed subtree
eoStdoutMonitorPrints statistics to stdout
eoSteadyFitContinue< EOT >A continuator: does a minimum number of generations, then stops whenever a given number of generations takes place without improvement
eoStHoistMutation< FType, Node >EoStHoistMutation --> replace the individual with one of its strongly typed subtree's
eoSTLBF< A1, A2, R >Generic set of classes that wrap an eoF, eoUF or eoBF so that they have the copy semantics the STL functions usually require (i.e
eoSTLF< R >Generic set of classes that wrap an eoF, eoUF or eoBF so that they have the copy semantics the STL functions usually require (i.e
eoSTLUF< A1, R >Generic set of classes that wrap an eoF, eoUF or eoBF so that they have the copy semantics the STL functions usually require (i.e
eoStochasticUniversalSelect< EOT >EoStochasticUniversalSelect: select an individual proportional to her stored fitness value, but in contrast with eoStochasticUniversalSelect, get rid of most finite sampling effects by doing all selections in one go, using a single random number
eoStochTournamentSelect< EOT >EoStochTournamentSelect: a selection method that selects ONE individual by binary stochastic tournament -MS- 24/10/99
eoStochTournamentTruncate< EOT >Truncate class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g
eoStochTournamentTruncateSplit< EOT >ReduceSplit class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g
eoStochTournamentWorthSelect< EOT, WorthT >An instance of eoSelectPerf2Worth that does selection from the Worthes using a ..
eoStParseTreeDepthInit< FType, Node >EoStParseTreeDepthInit : the initializer class for strongly typed tree-based genetic programming
eoStPointMutation< FType, Node >EoStPointMutation --> replace a Node with a Node of the same arity and type
eoString< fitnessT >Adaptor that turns an STL std::string into an EO
eoStSubtreeXOver< FType, Node >EoStSubtreeXOver --> subtree xover for strongly typed tree-based genetic programming
eoSubtreeXOver< FType, Node >EoSubtreeXOver --> subtree xover
eoSurviveAndDie< EOT >EoSurviveAndDie A pure abstract class, to store the howmany's
eoSymInit< EoType >Default initializer, Koza style
T_pickle_suite< T >Implements pickle support for eoPersistent derivatives
eoTimeCounterAn eoStat that simply gives the user time since first generation It has to be tempatized by EOT because it must be an eoStat
eoTimedDynUpdateAn eoUpdater to update an eoUpdatable object every given time interval
eoTimedMonitorHolds a collection of monitors and only fires them when a time limit has been reached
eoTimedStateSaverEoUpdater that saves a state every given time interval
eoTimeVaryingLoopEval< EOT >EoPopLoopEval: an instance of eoPopEvalFunc that simply applies a private eoEvalFunc to all offspring AND ALL PARENTS as the fitness is supposed here to vary
eoTransform< EOT >EoTransform transforms a population by applying genetic operators on it
eoTruncate< EOT >Truncation method using sort
eoTruncatedSelectMany< EOT >EoTruncatedSelectMany selects many individuals using eoSelectOne as it's mechanism
eoTruncatedSelectOne< EOT >EoTruncatedSelectOne selects one individual using eoSelectOne as it's mechanism
eoTruncateSplit< EOT >Deterministic truncation method using sort
eoTruncSelect< EOT >EoTruncSelect selects individuals after truncating the population using eoSelectOne as it's mechanism
eoUBitXover< Chrom >EoUBitXover --> classic Uniform crossover
eoUF< A1, R >Basic Unary Functor
UF_random_generator< T >Another class random_generator that can be used in the STL random_shuffle function (see eoPop::shuffle): its operator() takes an unsigned argument m and must return an unsigned uniformly distributed in [0,m}
eoUnaryFunctorCounter< UnaryFunctor >Generic counter class that counts the number of times a unary function is used
uniform_generator< T >The class uniform_generator can be used in the STL generate function to easily generate random floats and doubles either in [0, _max) if only 1 value (_max) is given (or none, as _max defaults to 1.0) or in [_min,_max) if 2 values are given (_min, _max)
eoUniformAtomExchange< Atom >Uniform crossover - well, not really, efficient for FixedLength
eoUniformGeneChooser< EOT >Uniform choice of gene to delete
eoUniformGenerator< T >The class eoUniform can be used in the STL generate function to easily generate random floats and doubles
eoUniformInit< T >The class eoUniformInit can be used in the STL apply function to easily randomize floats and doubles
eoUniformMutation< EOT >EoUniformMutation --> changes all values of the std::vector by uniform choice with range epsilon with probability p_change per variable
eoUpdatableEoUpdatable is a generic class for adding updatation to an existing class Just says it has an update() method
eoUpdaterEoUpdater is a generic procudere for updating whatever you want
eoValueParam< ValueType >EoValueParam<ValueType>: templatized derivation of eoParam
eoVariableParetoTraitsEoVariableParetoTraits : an eoParetoFitnessTraits whose characteristics can be set at run-time (nb objectives and min/max's) Why bother? For didactical purposes (and EASEA implementation :-)
eoVector< FitT, GeneType >Base class for fixed length chromosomes, just derives from EO and std::vector and redirects the smaller than operator to EO (fitness based comparison)
VirusBitFlip< FitT >VirusBitFlip --> changes 1 bit
VirusShiftMutation< FitT >Works for 1-bit virus; shifts the one to the right or left
eoVlAddMutation< EOT >Addition of a gene Is inserted at a random position - so can be applied to both order-dependent and order-independent
eoVlAtomExchangeQuadOp< EOT >Exchange Crossover using an AtomExchange
eoVlDelMutation< EOT >Deletion of a gene By default at a random position, but a "chooser" can be specified can of course be applied to both order-dependent and order-independent
eoVlUniformBinOp< EOT >Direct Uniform Exchange of genes for Variable Length, BINARY version
eoVlUniformQuadOp< EOT >Direct Uniform Exchange of genes (obsolete, already :-) stays there for historical reasons
eoWeakElitistReplacement< EOT >EoWeakElitistReplacement: a wrapper for other replacement procedures
+
Generated on Thu Oct 19 05:06:44 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/apply_8h-source.html b/trunk/paradiseo-eo/doc/html/apply_8h-source.html new file mode 100644 index 000000000..4c8e9bb28 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/apply_8h-source.html @@ -0,0 +1,56 @@ + + +EO: apply.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

apply.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoApply.h
+00005 // (c) Maarten Keijzer 2000
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              mak@dhi.dk
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _apply_h
+00027 #define _apply_h
+00028 
+00029 #include <eoFunctor.h>
+00030 #include <vector>
+00031 
+00035 template <class EOT>
+00036 void apply(eoUF<EOT&, void>& _proc, std::vector<EOT>& _pop)
+00037 {
+00038     for (unsigned i = 0; i < _pop.size(); ++i)
+00039     {
+00040         _proc(_pop[i]);
+00041     }
+00042 }
+00043 
+00044 #endif
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/breeders_8cpp-source.html b/trunk/paradiseo-eo/doc/html/breeders_8cpp-source.html new file mode 100644 index 000000000..4865516b9 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/breeders_8cpp-source.html @@ -0,0 +1,66 @@ + + +EO: breeders.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / pyeo
+

breeders.cpp

00001 /*
+00002     PyEO
+00003     
+00004     Copyright (C) 2003 Maarten Keijzer
+00005 
+00006     This program is free software; you can redistribute it and/or modify
+00007     it under the terms of the GNU General Public License as published by
+00008     the Free Software Foundation; either version 2 of the License, or
+00009     (at your option) any later version.
+00010 
+00011     This program is distributed in the hope that it will be useful,
+00012     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00013     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00014     GNU General Public License for more details.
+00015 
+00016     You should have received a copy of the GNU General Public License
+00017     along with this program; if not, write to the Free Software
+00018     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00019 */
+00020 
+00021 #include <eoBreed.h>
+00022 #include <eoGeneralBreeder.h>
+00023 #include <eoOneToOneBreeder.h>
+00024 
+00025 #include "PyEO.h"
+00026 #include "def_abstract_functor.h"
+00027 
+00028 using namespace boost::python;
+00029 
+00030 #define DEF3(x, i1, i2) class_<x<PyEO>, bases<eoBreed<PyEO > > >(#x, \
+00031         init<i1, i2 >()[with_custodian_and_ward<1,2,with_custodian_and_ward<1,3> >()])\
+00032         .def("__call__", &eoBreed<PyEO>::operator())
+00033 
+00034 void breeders()
+00035 {
+00036     def_abstract_functor<eoBreed<PyEO> >("eoBreed");
+00037 
+00038     DEF3(eoSelectTransform, eoSelect<PyEO>&, eoTransform<PyEO>&);
+00039 
+00040     DEF3(eoGeneralBreeder, eoSelectOne<PyEO>&, eoGenOp<PyEO>&)
+00041         .def( init<eoSelectOne<PyEO>&, eoGenOp<PyEO>&, double>()[WC2])
+00042         .def( init<eoSelectOne<PyEO>&, eoGenOp<PyEO>&, double, bool>()[WC2] )
+00043         .def( init<eoSelectOne<PyEO>&, eoGenOp<PyEO>&, eoHowMany>() );
+00044 
+00045 
+00046     DEF3(eoOneToOneBreeder, eoGenOp<PyEO>&, eoEvalFunc<PyEO>&)
+00047         .def( init<eoGenOp<PyEO>&, eoEvalFunc<PyEO>&, double>()[WC2] )
+00048         .def( init<eoGenOp<PyEO>&, eoEvalFunc<PyEO>&, double, eoHowMany>()[WC2] );
+00049 
+00050 }
+00051 
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/class_biased_node_selector-members.html b/trunk/paradiseo-eo/doc/html/class_biased_node_selector-members.html new file mode 100644 index 000000000..e5bbedd9b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/class_biased_node_selector-members.html @@ -0,0 +1,19 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

BiasedNodeSelector Member List

This is the complete list of members for BiasedNodeSelector, including all inherited members.

+ + + + + +
BiasedNodeSelector() (defined in BiasedNodeSelector)BiasedNodeSelector [inline]
BiasedNodeSelector(unsigned n) (defined in BiasedNodeSelector)BiasedNodeSelector [inline]
nRounds (defined in BiasedNodeSelector)BiasedNodeSelector
select_node(Sym sym) const (defined in BiasedNodeSelector)BiasedNodeSelector [virtual]
~NodeSelector() (defined in NodeSelector)NodeSelector [inline, virtual]

Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/class_biased_node_selector.html b/trunk/paradiseo-eo/doc/html/class_biased_node_selector.html new file mode 100644 index 000000000..931fc5884 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/class_biased_node_selector.html @@ -0,0 +1,44 @@ + + +EO: BiasedNodeSelector Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

BiasedNodeSelector Class Reference

A node selector that does a specified number of rounds ignoring terminals. +More... +

+#include <NodeSelector.h> +

+

Inheritance diagram for BiasedNodeSelector: +

+ +NodeSelector + +List of all members. + + + + + + + + + +

Public Member Functions

+ BiasedNodeSelector (unsigned n)
+NodeSelection select_node (Sym sym) const

Public Attributes

+unsigned nRounds
+

Detailed Description

+A node selector that does a specified number of rounds ignoring terminals. +

+ +

+Definition at line 55 of file NodeSelector.h.

The documentation for this class was generated from the following files: +
Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/class_biased_node_selector.png b/trunk/paradiseo-eo/doc/html/class_biased_node_selector.png new file mode 100644 index 0000000000000000000000000000000000000000..19141e01b492906c333ef5303ecc50168e8c34e7 GIT binary patch literal 446 zcmeAS@N?(olHy`uVBq!ia0vp^^*|iJ!VDx2Wo|zVq$C1-LR|m<{|{vT|9@cq{DcWW z78oBmaG?6o|0h5$V@Z%-FoVOh8)-mxh^LEVNX4ADQ+)G|DDbo<8fVXzKES!^n^WxB zzx@}U&lm8p_Ea`GwSx8Rj3agblHO=MOwQTc`rT-Y+5>5Ym*>}eoy>_Awqq#Z_n21A zG(pIvBFAr+>RKiSi93hAbmSQn+Ar$9o>&lh_gxK7!9?|r3RV&JH*$=oIt*#Hc8g1l z(;4p_2@(5j?T}YJK`iWgbFG7U>ze;otx3T*nCHX`e{g3wJpXHRskM-eY{CCM5(T^O z>$B}SAflGQ1VRtyGgjmTF4)MWet>bJ<&k^6(cf>dwVsTA&c$)tN+XCpLd3eE!|H>= zp9x+fh52%KO&rtp65FOq1hOlbPU?8B?O?k`O6;mo*;b3+ayL$fi(F+{xt4Lq + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

Cov Member List

This is the complete list of members for Cov, including all inherited members.

+ + + + + + + + + +
Cov() (defined in Cov)Cov [inline]
get_cov() const (defined in Cov)Cov [inline]
get_meana() const (defined in Cov)Cov [inline]
get_meanb() const (defined in Cov)Cov [inline]
meana (defined in Cov)Cov [private]
meanb (defined in Cov)Cov [private]
n (defined in Cov)Cov [private]
sumcov (defined in Cov)Cov [private]
update(double a, double b) (defined in Cov)Cov [inline]

Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/class_cov.html b/trunk/paradiseo-eo/doc/html/class_cov.html new file mode 100644 index 000000000..8f4786bec --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/class_cov.html @@ -0,0 +1,54 @@ + + +EO: Cov Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

Cov Class Reference

Single covariance between two variates. +More... +

+#include <stats.h> +

+List of all members. + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+void update (double a, double b)
+double get_meana () const
+double get_meanb () const
+double get_cov () const

Private Attributes

+double n
+double meana
+double meanb
+double sumcov
+

Detailed Description

+Single covariance between two variates. +

+ +

+Definition at line 58 of file stats.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/class_e_o-members.html b/trunk/paradiseo-eo/doc/html/class_e_o-members.html new file mode 100644 index 000000000..92757b7a8 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/class_e_o-members.html @@ -0,0 +1,49 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

EO< F > Member List

This is the complete list of members for EO< F >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
className() const EO< F > [inline, virtual]
EO()EO< F > [inline]
EO() (defined in EO< F >)EO< F > [inline]
Fitness typedef (defined in EO< F >)EO< F >
fitness() const EO< F > [inline]
fitness(const Fitness &_fitness)EO< F > [inline]
fitness(performance_type perf) (defined in EO< F >)EO< F > [inline]
fitness(void) const (defined in EO< F >)EO< F > [inline]
fitness_traits typedef (defined in EO< F >)EO< F >
invalid() const EO< F > [inline]
invalidate() (defined in EO< F >)EO< F > [inline]
invalidate(void) (defined in EO< F >)EO< F > [inline]
invalidate_worth(void) (defined in EO< F >)EO< F > [inline]
invalidFitness (defined in EO< F >)EO< F > [private]
operator<(const EO &_eo2) const EO< F > [inline]
operator<(const EO< Fitness, Traits > &other) const (defined in EO< F >)EO< F > [inline]
operator>(const EO &_eo2) const (defined in EO< F >)EO< F > [inline]
operator>(const EO< Fitness, Traits > &other) const (defined in EO< F >)EO< F > [inline]
performance(performance_type perf) (defined in EO< F >)EO< F > [inline]
performance(void) const (defined in EO< F >)EO< F > [inline]
performance_type typedef (defined in EO< F >)EO< F >
printOn(std::ostream &_os) const EO< F > [inline, virtual]
readFrom(std::istream &_is)EO< F > [inline, virtual]
rep_fitness (defined in EO< F >)EO< F > [private]
repFitness (defined in EO< F >)EO< F > [private]
storage_type typedef (defined in EO< F >)EO< F >
valid_performance (defined in EO< F >)EO< F > [private]
valid_worth (defined in EO< F >)EO< F > [private]
worth(worth_type worth) (defined in EO< F >)EO< F > [inline]
worth(void) const (defined in EO< F >)EO< F > [inline]
worth_type typedef (defined in EO< F >)EO< F >
~EO()EO< F > [inline, virtual]
~eoObject()eoObject [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]

Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/class_e_o.html b/trunk/paradiseo-eo/doc/html/class_e_o.html new file mode 100644 index 000000000..dc699a815 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/class_e_o.html @@ -0,0 +1,434 @@ + + +EO: EO< F > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

EO< F > Class Template Reference

EO is a base class for evolvable objects, that is, the subjects of evolution. +More... +

+#include <EO.h> +

+

Inheritance diagram for EO< F >: +

+ +eoObject +eoPersistent +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef F Fitness
+typedef Traits fitness_traits
+typedef Traits::storage_type storage_type
+typedef Traits::performance_type performance_type
+typedef Traits::worth_type worth_type

Public Member Functions

 EO ()
 Default constructor.
+virtual ~EO ()
 Virtual dtor.
+Fitness fitness () const
 Return fitness value.
+void invalidate ()
void fitness (const Fitness &_fitness)
 Set fitness.
bool invalid () const
 Return true If fitness value is invalid, false otherwise.
bool operator< (const EO &_eo2) const
 Returns true if.
+bool operator> (const EO &_eo2) const
+void fitness (performance_type perf)
+void performance (performance_type perf)
+performance_type performance (void) const
+void worth (worth_type worth)
+worth_type worth (void) const
+worth_type fitness (void) const
+void invalidate (void)
+void invalidate_worth (void)
+bool operator< (const EO< Fitness, Traits > &other) const
+bool operator> (const EO< Fitness, Traits > &other) const
virtual std::string className () const
 Return the class id.
virtual void readFrom (std::istream &_is)
 Read object.\ Calls base class, just in case that one had something to do.
virtual void printOn (std::ostream &_os) const
 Write object.

Private Attributes

+Fitness repFitness
+bool invalidFitness
+bool valid_performance
+bool valid_worth
+storage_type rep_fitness
+

Detailed Description

+

template<class F>
+ class EO< F >

+ +EO is a base class for evolvable objects, that is, the subjects of evolution. +

+EOs have only got a fitness, which at the same time needs to be only an object with the operation less than (<) defined. Fitness says how good is the object; evolution or change of these objects is left to the genetic operators. A fitness less than another means a worse fitness, in whatever the context; thus, fitness is always maximized; although it can be minimized with a proper definition of the < operator. The fitness object must have, besides an void ctor, a copy ctor. +

+ +

+Definition at line 44 of file EO.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + +
+template<class F>
EO< F >::EO (   )  [inline]
+
+ + + + + +
+   + + +

+Default constructor. +

+Fitness must have a ctor which takes 0 as a value; we can not use void ctors here since default types like float have no void initializer. VC++ allows it, but gcc does not +

+Definition at line 54 of file EO.h.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class F>
void EO< F >::fitness ( const Fitness &  _fitness  )  [inline]
+
+ + + + + +
+   + + +

+Set fitness. +

+At the same time, validates it.

Parameters:
+ + +
_fitness New fitness value.
+
+ +

+Definition at line 72 of file EO.h.

+

+ + + + +
+ + + + + + + + + + + +
+template<class F>
bool EO< F >::invalid (   )  const [inline]
+
+ + + + + +
+   + + +

+Return true If fitness value is invalid, false otherwise. +

+

Returns:
true If fitness is invalid.
+ +

+Definition at line 81 of file EO.h. +

+Referenced by EO< PyFitness >::fitness(), eoOneMaxEvalFunc< EOT >::operator()(), eoOneFifthMutation< EOT >::operator()(), eoEvalFuncPtr< EOT, FitT, FunctionArg >::operator()(), eoEvalFuncCounter< EOT >::operator()(), and EO< PyFitness >::printOn().

+

+ + + + +
+ + + + + + + + + + + + +
+template<class F>
bool EO< F >::operator< ( const EO< F > &  _eo2  )  const [inline]
+
+ + + + + +
+   + + +

+Returns true if. +

+

Returns:
true if the fitness is higher
+ +

+Definition at line 86 of file EO.h. +

+Referenced by eoVector< FitT, bool >::operator<().

+

+ + + + +
+ + + + + + + + + + + + +
+template<class F>
virtual std::string EO< F >::className ( void   )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Return the class id. +

+

Returns:
the class name as a std::string
+ +

+Implements eoObject. +

+Reimplemented in eoEsFull< Fit >, eoEsSimple< Fit >, eoEsStdev< Fit >, eoReal< FitT >, eoBit< FitT >, eoParseTree< FType, Node >, eoString< fitnessT >, and eoOneMax< FitT >. +

+Definition at line 95 of file EO.h.

+

+ + + + +
+ + + + + + + + + + + + +
+template<class F>
virtual void EO< F >::readFrom ( std::istream &  _is  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Read object.\ Calls base class, just in case that one had something to do. +

+The read and print methods should be compatible and have the same format. In principle, format is "plain": they just print a number

Parameters:
+ + +
_is a std::istream.
+
+
Exceptions:
+ + +
runtime_std::exception If a valid object can't be read.
+
+ +

+Implements eoPersistent. +

+Reimplemented in eoVector< FitT, GeneType >, eoEsFull< Fit >, eoEsSimple< Fit >, eoEsStdev< Fit >, eoBit< FitT >, eoParseTree< FType, Node >, eoExternalEO< Fit, External >, eoVector< Fit, double >, eoVector< FitT, double >, and eoVector< FitT, bool >. +

+Definition at line 105 of file EO.h. +

+Referenced by eoVector< FitT, bool >::readFrom(), eoPop< Dummy >::readFrom(), eoParseTree< FType, Node >::readFrom(), eoOneMax< FitT >::readFrom(), eoExternalEO< Fit, External >::readFrom(), and eoBit< FitT >::readFrom().

+

+ + + + +
+ + + + + + + + + + + + +
+template<class F>
virtual void EO< F >::printOn ( std::ostream &  _os  )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Write object. +

+Called printOn since it prints the object _on_ a stream.

Parameters:
+ + +
_os A std::ostream.
+
+ +

+Implements eoPrintable. +

+Reimplemented in eoVector< FitT, GeneType >, eoEsFull< Fit >, eoEsSimple< Fit >, eoEsStdev< Fit >, eoBit< FitT >, eoParseTree< FType, Node >, eoExternalEO< Fit, External >, eoString< fitnessT >, Dummy, Dummy, Dummy, Dummy, eoVector< Fit, double >, eoVector< FitT, double >, and eoVector< FitT, bool >. +

+Definition at line 129 of file EO.h. +

+Referenced by Dummy::printOn(), eoVector< FitT, bool >::printOn(), eoString< fitnessT >::printOn(), eoParseTree< FType, Node >::printOn(), eoOneMax< FitT >::printOn(), eoExternalEO< Fit, External >::printOn(), and eoBit< FitT >::printOn().

+

The documentation for this class was generated from the following files: +
Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/class_e_o.png b/trunk/paradiseo-eo/doc/html/class_e_o.png new file mode 100644 index 0000000000000000000000000000000000000000..b1cb6c6238942c3709ee9889ef7c94f531a6e23e GIT binary patch literal 615 zcmV-t0+{`YP)aQv5O^w&uUxO4{Q;vlXeghs|q0 z%6=jXVB8k1+?aaSkk*VvaHX2SBBC|mj$9w2?+cf3h;?T>kXW||{?PaNe@K;Auzqfd zH{trjeg*41;w-Zm`w-xGwRXjtx!S|GY@XYMt(@C=B{1tQ9&1-Z-=|DjW!tlTe$cnt zP*0r5j;{-`!#G}uz1T`nR#|10RaRMLzn0B?5&rdq^Ix0)GT+;Y&3?&O_B__7BF1tU zHDypKOEH)jB+po}7}5>9JY$O$G1z?O2Fsa7h_*0xAf&8}!TgmONR|1tF>vhcBk4o z1~bzk70jQkCLyeZyt%d0B*?i<*?5C#-SSGX`zwKVc@n}(2seEHDZ{j*&BNP?HEG9Z ze$^=3j_ve=zSUj@ZyyD3HGSBjDAdUgtU9q{Nn(~CSao8rwGxz7_LA&a)JkfoDoa^q zl~wi&**j#mLbmZZWlv+>ig>!sQy#Wp{pPtmY{cG!+=~V7hSj)I)=eg{5D%AbZMCpe zAQ^X*jnyV + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

MemPool Member List

This is the complete list of members for MemPool, including all inherited members.

+ + + + + + + + +
allocate() (defined in MemPool)MemPool [inline]
chunks (defined in MemPool)MemPool [private]
deallocate(void *b) (defined in MemPool)MemPool [inline]
esize (defined in MemPool)MemPool [private]
grow() (defined in MemPool)MemPool [inline, private]
head (defined in MemPool)MemPool [private]
MemPool(unsigned int sz) (defined in MemPool)MemPool [inline]
~MemPool() (defined in MemPool)MemPool [inline]

Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/class_mem_pool.html b/trunk/paradiseo-eo/doc/html/class_mem_pool.html new file mode 100644 index 000000000..683173dd4 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/class_mem_pool.html @@ -0,0 +1,55 @@ + + +EO: MemPool Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

MemPool Class Reference

Pool allocator for the subtree and parse tree classes (homebrew and not compliant to ANSI allocator requirements) (c) copyright Maarten Keijzer 1999, 2000. +More... +

+#include <node_pool.h> +

+List of all members. + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ MemPool (unsigned int sz)
+void * allocate ()
+void deallocate (void *b)

Private Member Functions

+void grow ()

Private Attributes

+Chunk * chunks
+const unsigned int esize
+Link * head
+

Detailed Description

+Pool allocator for the subtree and parse tree classes (homebrew and not compliant to ANSI allocator requirements) (c) copyright Maarten Keijzer 1999, 2000. +

+Permission to copy, use, modify, sell and distribute this software is granted provided this copyright notice appears in all copies. This software is provided "as is" without express or implied warranty, and with no claim as to its suitability for any purpose.

+Permission to modify the code and to distribute modified code is granted, provided the above notices are retained, and a notice that the code was modified is included with the above copyright notice. +

+ +

+Definition at line 21 of file node_pool.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/class_minimizing_traits-members.html b/trunk/paradiseo-eo/doc/html/class_minimizing_traits-members.html new file mode 100644 index 000000000..1e39b4859 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/class_minimizing_traits-members.html @@ -0,0 +1,17 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

MinimizingTraits Member List

This is the complete list of members for MinimizingTraits, including all inherited members.

+ + + +
maximizing(int) (defined in MinimizingTraits)MinimizingTraits [inline, static]
nObjectives() (defined in eoParetoFitnessTraits)eoParetoFitnessTraits [inline, static]
tol() (defined in eoParetoFitnessTraits)eoParetoFitnessTraits [inline, static]

Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/class_minimizing_traits.html b/trunk/paradiseo-eo/doc/html/class_minimizing_traits.html new file mode 100644 index 000000000..6d2396b09 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/class_minimizing_traits.html @@ -0,0 +1,35 @@ + + +EO: MinimizingTraits Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

MinimizingTraits Class Reference

test program for Pareto Fitness +More... +

+

Inheritance diagram for MinimizingTraits: +

+ +eoParetoFitnessTraits + +List of all members. + + + + +

Static Public Member Functions

+bool maximizing (int)
+

Detailed Description

+test program for Pareto Fitness +

+ +

+Definition at line 36 of file t-eoParetoFitness.cpp.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/class_minimizing_traits.png b/trunk/paradiseo-eo/doc/html/class_minimizing_traits.png new file mode 100644 index 0000000000000000000000000000000000000000..60c147544303f2222d1fad6559877bedafea5963 GIT binary patch literal 486 zcmV@P)RCt{2l}mDi zFbsy}P1gQ(1JfI{7wRhaKSK3#z#%4?z;tNG0)!&TpCx%R(AR#U&uOoG3`UnxfJKB= zL0nv#6$Le|cuvcRg$o9UzY)H(oBn+a07*qoM6N<$g6_E6X8-^I literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/class_node_selector-members.html b/trunk/paradiseo-eo/doc/html/class_node_selector-members.html new file mode 100644 index 000000000..37aa423c6 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/class_node_selector-members.html @@ -0,0 +1,16 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

NodeSelector Member List

This is the complete list of members for NodeSelector, including all inherited members.

+ + +
select_node(Sym sym) const =0 (defined in NodeSelector)NodeSelector [pure virtual]
~NodeSelector() (defined in NodeSelector)NodeSelector [inline, virtual]

Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/class_node_selector.html b/trunk/paradiseo-eo/doc/html/class_node_selector.html new file mode 100644 index 000000000..8cf6f50c0 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/class_node_selector.html @@ -0,0 +1,38 @@ + + +EO: NodeSelector Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

NodeSelector Class Reference

Base class for selecting nodes. +More... +

+#include <NodeSelector.h> +

+

Inheritance diagram for NodeSelector: +

+ +BiasedNodeSelector +RandomNodeSelector + +List of all members. + + + + +

Public Member Functions

+virtual NodeSelection select_node (Sym sym) const =0
+

Detailed Description

+Base class for selecting nodes. +

+ +

+Definition at line 24 of file NodeSelector.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/class_node_selector.png b/trunk/paradiseo-eo/doc/html/class_node_selector.png new file mode 100644 index 0000000000000000000000000000000000000000..7d42229567b0b37140806408b29c15df47bf3574 GIT binary patch literal 629 zcmV-*0*d{KP)OB^q&9AfW|81syYI*1G7CUj!>0l=oXFz2cik`zhqG{_xM>osqF;_< z(dUTXFX|jQK1au}{6)r6m$B4kEOosm%ay)KHuZK~sZCvp<@S9x!K@3hyxneRBV=8P z$5@Qz*DL^G3_2dur9^0oz|)kVvNKBr&<-lK$w^p(x>cN@ zbdZd779E}qTb&e37!f$)AKnXi8KwwLfqoID(Q?2st;Hov%4LU?o@`s4G)v?mqyfl* zBQ!1kQAV_2|6+ER8%_sXwoaVq;ox+GK4%u~vq9i(Wi^~+pDJX)Q~X9Ot^x#Z65 zAT?-(h6gMu0I*{=yfybMnRXf;u@oCnV_9=r>6bC;ryR1me#$E>pjg_Rihcp) zpU=@)bbqA(-2EeWf8|W033>53;+kzv7kuv;i?JBX%dl*IDQv6ln`B!*YrfqRWAxTH P00000NkvXXu0mjfRq!96 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/class_random_node_selector-members.html b/trunk/paradiseo-eo/doc/html/class_random_node_selector-members.html new file mode 100644 index 000000000..72e499eaa --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/class_random_node_selector-members.html @@ -0,0 +1,16 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

RandomNodeSelector Member List

This is the complete list of members for RandomNodeSelector, including all inherited members.

+ + +
select_node(Sym sym) const (defined in RandomNodeSelector)RandomNodeSelector [virtual]
~NodeSelector() (defined in NodeSelector)NodeSelector [inline, virtual]

Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/class_random_node_selector.html b/trunk/paradiseo-eo/doc/html/class_random_node_selector.html new file mode 100644 index 000000000..97dc363d4 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/class_random_node_selector.html @@ -0,0 +1,37 @@ + + +EO: RandomNodeSelector Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

RandomNodeSelector Class Reference

Select nodes uniformly. +More... +

+#include <NodeSelector.h> +

+

Inheritance diagram for RandomNodeSelector: +

+ +NodeSelector + +List of all members. + + + + +

Public Member Functions

+NodeSelection select_node (Sym sym) const
+

Detailed Description

+Select nodes uniformly. +

+ +

+Definition at line 49 of file NodeSelector.h.

The documentation for this class was generated from the following files: +
Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/class_random_node_selector.png b/trunk/paradiseo-eo/doc/html/class_random_node_selector.png new file mode 100644 index 0000000000000000000000000000000000000000..eb9f9a9a3ce3389252de9372d3eb210c26931e3a GIT binary patch literal 454 zcmeAS@N?(olHy`uVBq!ia0vp^Z9p8r!VDz!3}@s6O=n36RTJ666=m;PC858jv01>EaktG3V`6@4O=lJZ&G-u9=xD>~*YOxUT5G z@|W#~jI*@1oXijjjgU0{@p0x24^H{(s(bXqpXM6zNuHGZ&n~!8Rc~$Kkq%kq%3t>- zI14$C9u+%1k%LX-o6uG9$1@t|Y&ns%GRpepy|Z~XDHU^`KM>G8+*^3WL)zJ;xv;9R zv`Mho|8mfk^^!XUSL*b={$-f9rFi4-i)U1y?vyb;cOvCa`Z42uyv~(9&T)q#?DG#+ zta+^~v3=(06rW=d#Mu@z{lIj7ugM$J1)^?8bQNf@<|sZqciy!5Y>a=fgQu&X%Q~loCII&i$mak6 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/class_u_f__random__generator-members.html b/trunk/paradiseo-eo/doc/html/class_u_f__random__generator-members.html new file mode 100644 index 000000000..78c78cc11 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/class_u_f__random__generator-members.html @@ -0,0 +1,17 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

UF_random_generator< T > Member List

This is the complete list of members for UF_random_generator< T >, including all inherited members.

+ + + +
operator()(T _t) (defined in UF_random_generator< T >)UF_random_generator< T > [inline]
random (defined in UF_random_generator< T >)UF_random_generator< T > [private]
UF_random_generator(eoRng &_rng=rng) (defined in UF_random_generator< T >)UF_random_generator< T > [inline]

Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/class_u_f__random__generator.html b/trunk/paradiseo-eo/doc/html/class_u_f__random__generator.html new file mode 100644 index 000000000..28f520f0f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/class_u_f__random__generator.html @@ -0,0 +1,42 @@ + + +EO: UF_random_generator< T > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

UF_random_generator< T > Class Template Reference

Another class random_generator that can be used in the STL random_shuffle function (see eoPop::shuffle): its operator() takes an unsigned argument m and must return an unsigned uniformly distributed in [0,m}. +More... +

+#include <rnd_generators.h> +

+List of all members. + + + + + + + + + +

Public Member Functions

+ UF_random_generator (eoRng &_rng=rng)
+T operator() (T _t)

Private Attributes

+eoRng & random
+

Detailed Description

+

template<class T = uint32_t>
+ class UF_random_generator< T >

+ +Another class random_generator that can be used in the STL random_shuffle function (see eoPop::shuffle): its operator() takes an unsigned argument m and must return an unsigned uniformly distributed in [0,m}. +

+ +

+Definition at line 121 of file rnd_generators.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/class_virus_bit_flip-members.html b/trunk/paradiseo-eo/doc/html/class_virus_bit_flip-members.html new file mode 100644 index 000000000..486b38159 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/class_virus_bit_flip-members.html @@ -0,0 +1,28 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

VirusBitFlip< FitT > Member List

This is the complete list of members for VirusBitFlip< FitT >, including all inherited members.

+ + + + + + + + + + + + + + +
binary enum value (defined in eoOp< eoVirus< FitT > >)eoOp< eoVirus< FitT > >
className() const VirusBitFlip< FitT > [inline, virtual]
eoMonOp()eoMonOp< eoVirus< FitT > > [inline]
eoOp(OpType _type)eoOp< eoVirus< FitT > > [inline]
eoOp(const eoOp &_eop)eoOp< eoVirus< FitT > > [inline]
functor_category()eoUF< eoVirus< FitT > &, bool > [inline, static]
general enum value (defined in eoOp< eoVirus< FitT > >)eoOp< eoVirus< FitT > >
getType() const eoOp< eoVirus< FitT > > [inline]
operator()(eoVirus< FitT > &_chrom)VirusBitFlip< FitT > [inline, virtual]
quadratic enum value (defined in eoOp< eoVirus< FitT > >)eoOp< eoVirus< FitT > >
unary enum value (defined in eoOp< eoVirus< FitT > >)eoOp< eoVirus< FitT > >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< eoVirus< FitT > > [inline, virtual]
~eoUF()eoUF< eoVirus< FitT > &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:59 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/class_virus_bit_flip.html b/trunk/paradiseo-eo/doc/html/class_virus_bit_flip.html new file mode 100644 index 000000000..5f9407a7b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/class_virus_bit_flip.html @@ -0,0 +1,91 @@ + + +EO: VirusBitFlip< FitT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

VirusBitFlip< FitT > Class Template Reference

VirusBitFlip --> changes 1 bit. +More... +

+#include <VirusOp.h> +

+

Inheritance diagram for VirusBitFlip< FitT >: +

+ +eoMonOp< eoVirus< FitT > > +eoOp< eoVirus< FitT > > +eoUF< eoVirus< FitT > &, bool > +eoFunctorBase + +List of all members. + + + + + + + + +

Public Member Functions

+virtual std::string className () const
 The class name.
bool operator() (eoVirus< FitT > &_chrom)
 Change one bit.
+

Detailed Description

+

template<class FitT>
+ class VirusBitFlip< FitT >

+ +VirusBitFlip --> changes 1 bit. +

+ +

+Definition at line 40 of file VirusOp.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class FitT>
bool VirusBitFlip< FitT >::operator() ( eoVirus< FitT > &  _chrom  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Change one bit. +

+

Parameters:
+ + +
chrom The cromosome which one bit is going to be changed.
+
+ +

+Implements eoUF< eoVirus< FitT > &, bool >. +

+Definition at line 49 of file VirusOp.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:59 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/class_virus_bit_flip.png b/trunk/paradiseo-eo/doc/html/class_virus_bit_flip.png new file mode 100644 index 0000000000000000000000000000000000000000..6bfcd2b2bfcef9071cc86be77943e821bf5025ac GIT binary patch literal 1789 zcmZ{l2~?6<6oAPVm(*FzlS$U82wYNJa4*e}@DC*SY*Isq(q@#*B@>ez8#9$L^CuT@ z8?7cirlnRQxuozBfx*-+s`R#1D^+ui$M&1k?P zh=V+ITKK_q4>G_vsjP|`6^W>H1&T45_T^OxdV2f-y7Tz+wThfHgxx9gd@`e6lB;vx^~Csdn@BCjF`=}k-^qhyt5tmORf7j zhoa2ZdqOkJBA~W*G8Y(;v!ag#9i#O(>lN#P)P1xqy;85dZ$|fUo5)1|+06^ga*KzF zXf$aY!+rcX4Y%dz_12YsCbk8P@ylkCP@%eat__RvbvBaU!)7t?kkgeoyA2z4P1I(2 z6o;WmFd*Oy&<3QRG_&XaSbBo;v%w5^zx{Q2?oQlAO=_#RDqP+pfzJL z5keIjy%k?^hNU3APd~qsMCK$D=3y|;)W&3y<@rg|knZFjgtpwlIO5CIp5`gVf&~U6Q`$mh}Kb-$@qRP@lVI@2hgc^HiIZj&AUy6*iG!bV! z$7ueU_5=&4XA*xL?>O)bWt?Af&*0Xs*=_>3)HyTbr<-+9Q|xUqKuEkHki}+_&?i^| zYRM4l<_cGKknw4G_QBT?PPf*8j<^(^h9_$)ek(w<1rt5IeSdB6okScC zv~s*1#L`Z4@&B$l&gF>P81p?K)Ak9^6%^bjHy=)C7f}?^_Rj+I^$vWGadnBuRjpn5 zc9(9&VrU7P{m>k5WV#+A5G#7GG+B-+dZ*Hi!V|(FCcM+gNhCF(`GQkrfunhqy;9^Q zSN5+mtIYQ4FyT!4I`?BI`PnDyQ8puHr)va7&-k<3S|ECqeM<$7a;^y=QhhjKF_Dg) z`_htshUaay>6^t7*Ia@&HwTWgoryc|bOguU)1_E;Nevn-YB2 ztU~8SW2(TZt|Mp&9)igz&qOausyvwWdaUnH-e;`hi&RBPUyUSqE>c3H&8l?QTbaym|hb;~B8QEx}zI{{E zUBNqZC0Up(QC{O=^X&_*_cv|?91lS&GSXchNkcQzEsk4X)vv4Pl(KoqhIcg@zm>Sq$mZI_#?n7!h*){Tn#>Mhe=_dnyX`qir*(W zpwzGjaUR|puaSxjjpn=kyXZd~=ijw`ob#_1%h;>A%^bFOW@utKXH!Ppdxy*Ttr8bq z*+q{#7qB#haALS0lM5-noxyU42l;bX&9hp?B(YuBA^0?kRkX8VY49kW#x}b-p+xuF z<=O>(m2my;4mj=Ji;}Y(AD#5UrVQnQ5jIumf4K6_; zX*c|;x{&r&ix|)ojDiM=zn(VhnpDy1w;({49-TJ;eL;o*HyBYjhI0+W0wE` literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/class_virus_shift_mutation-members.html b/trunk/paradiseo-eo/doc/html/class_virus_shift_mutation-members.html new file mode 100644 index 000000000..c981c75c0 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/class_virus_shift_mutation-members.html @@ -0,0 +1,29 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

VirusShiftMutation< FitT > Member List

This is the complete list of members for VirusShiftMutation< FitT >, including all inherited members.

+ + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< eoVirus< FitT > >)eoOp< eoVirus< FitT > >
className() const VirusShiftMutation< FitT > [inline, virtual]
eoMonOp()eoMonOp< eoVirus< FitT > > [inline]
eoOp(OpType _type)eoOp< eoVirus< FitT > > [inline]
eoOp(const eoOp &_eop)eoOp< eoVirus< FitT > > [inline]
functor_category()eoUF< eoVirus< FitT > &, bool > [inline, static]
general enum value (defined in eoOp< eoVirus< FitT > >)eoOp< eoVirus< FitT > >
getType() const eoOp< eoVirus< FitT > > [inline]
operator()(eoVirus< FitT > &_chrom)VirusShiftMutation< FitT > [inline, virtual]
quadratic enum value (defined in eoOp< eoVirus< FitT > >)eoOp< eoVirus< FitT > >
unary enum value (defined in eoOp< eoVirus< FitT > >)eoOp< eoVirus< FitT > >
VirusShiftMutation()VirusShiftMutation< FitT > [inline]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< eoVirus< FitT > > [inline, virtual]
~eoUF()eoUF< eoVirus< FitT > &, bool > [inline, virtual]

Generated on Thu Oct 19 05:07:00 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/class_virus_shift_mutation.html b/trunk/paradiseo-eo/doc/html/class_virus_shift_mutation.html new file mode 100644 index 000000000..b29062bc7 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/class_virus_shift_mutation.html @@ -0,0 +1,95 @@ + + +EO: VirusShiftMutation< FitT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

VirusShiftMutation< FitT > Class Template Reference

Works for 1-bit virus; shifts the one to the right or left. +More... +

+#include <VirusOp.h> +

+

Inheritance diagram for VirusShiftMutation< FitT >: +

+ +eoMonOp< eoVirus< FitT > > +eoOp< eoVirus< FitT > > +eoUF< eoVirus< FitT > &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + +

Public Member Functions

+ VirusShiftMutation ()
 Ctor.
+virtual std::string className () const
 The class name.
bool operator() (eoVirus< FitT > &_chrom)
 Change one bit.
+

Detailed Description

+

template<class FitT>
+ class VirusShiftMutation< FitT >

+ +Works for 1-bit virus; shifts the one to the right or left. +

+ +

+Definition at line 86 of file VirusOp.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class FitT>
bool VirusShiftMutation< FitT >::operator() ( eoVirus< FitT > &  _chrom  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Change one bit. +

+

Parameters:
+ + +
chrom The cromosome which one bit is going to be changed.
+
+ +

+Implements eoUF< eoVirus< FitT > &, bool >. +

+Definition at line 99 of file VirusOp.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:07:00 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/class_virus_shift_mutation.png b/trunk/paradiseo-eo/doc/html/class_virus_shift_mutation.png new file mode 100644 index 0000000000000000000000000000000000000000..7b4563478bf7e829af627c241ae8cbd021016fbc GIT binary patch literal 1860 zcmah~3slls8Ye5wFq^T5 z{Y^jx(=rb|w1@ZrQ9`Z7S4tT^aYB>z1&VEnkSxvaoZYiCbM~C?-uvC}`|iEx`@Y}r z+#EjwX46KijSvWA6V}@+00J>8H0Z*0YYlUa_pS`XvcnG-_^n>AH>i5Ou)I9{CxiCO z5DJCKBK@RcyCyM!a13&IYVZ^UVmyrXau2*vHec35l{ZfgM>NJ4&7NvDZ&1ANrhpbIu2#f1TZw*odZ8i!&=s6pZ^; zpfYp-r#S)zLidH30{2~w7kAYNEl0v7VNiuGT`Vpb=*VY`pz!fUkv`KfC9jcpHqyub z*_WfyHB0FHyQ3(k(*7cl(GveRpd*aCC|Z%Eke9KEaNLT+&cDFGW1+Fl(23bfCy>x` zogYYv?=?w^2~iBOY~k>Y{w>$Ag(0yh<|}L%uZ_5&a^LBL%%^3z-iihkvlmCPyUn;_ zUTvLzDgr5cJpi!o?E!*;wz=(SKHXK~i_axG6yR>V?2A{9Uug;|jOm<%&))J%Kh;I_ z)2JEN<)voycc)#S4-<1SOYM`^U;|goJNFp~IOgqdCkhC+7wXP{uCK5|C>Q#6Fpq*X z?Vg=(qezPW5s=Ed_fF|wi3qlMuWTfAB6N$gR1n3_XR4t^oIQdnL9#6Vg^Y#Ix_F>A zQ#P5PDsD7uctEoiWk|u1S`m#b?bYB{7@RcsCkqQ2ms)X#hx!Y}SDIMTH6X?y>h*vI zem`7RHP)3)H8BdFH;3H7ZY>XjsOnEiXMpsBV)(0P3EI&?pL|-AElqdpO zGI=zRP01>M$+7T=5(9 zbU5H*6`CB)8APkTnu{|%5&RFqbKw`+6K0>`uVJ+6RU0S^zasB zQzP?=O9hK>xAZ}}S<<6W#p+e^A#dJ=#Mj97n|TLlCr3ZU@sO4&356}K%a^auxR1r4 zPRvw#rVW`eW#3yyO8#UXEXhPaySu5-N^vPyteiGW+Y7#4IOOr2jM>}`q*BV%b{&)C z>#7K~ + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

boolean_generator Member List

This is the complete list of members for boolean_generator, including all inherited members.

+ + + + +
bias (defined in boolean_generator)boolean_generator [private]
boolean_generator(float _bias=0.5, eoRng &_rng=rng) (defined in boolean_generator)boolean_generator [inline]
gen (defined in boolean_generator)boolean_generator [private]
operator()(void) (defined in boolean_generator)boolean_generator [inline]

Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classboolean__generator.html b/trunk/paradiseo-eo/doc/html/classboolean__generator.html new file mode 100644 index 000000000..44e2c2ad0 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classboolean__generator.html @@ -0,0 +1,42 @@ + + +EO: boolean_generator Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

boolean_generator Class Reference

The class boolean_generator can be used in the STL generate function to easily generate random booleans with a specified bias. +More... +

+#include <rnd_generators.h> +

+List of all members. + + + + + + + + + + + +

Public Member Functions

+ boolean_generator (float _bias=0.5, eoRng &_rng=rng)
+bool operator() (void)

Private Attributes

+float bias
+eoRng & gen
+

Detailed Description

+The class boolean_generator can be used in the STL generate function to easily generate random booleans with a specified bias. +

+ +

+Definition at line 70 of file rnd_generators.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classd_matrix-members.html b/trunk/paradiseo-eo/doc/html/classd_matrix-members.html new file mode 100644 index 000000000..56bed7a86 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classd_matrix-members.html @@ -0,0 +1,19 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

dMatrix Member List

This is the complete list of members for dMatrix, including all inherited members.

+ + + + + +
dMatrix(unsigned _s) (defined in dMatrix)dMatrix [inline]
operator()(unsigned _i, unsigned _j) const dMatrix [inline]
operator()(unsigned _i, unsigned _j)dMatrix [inline]
printOn(std::ostream &_os)dMatrix [inline]
rSize (defined in dMatrix)dMatrix [private]

Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classd_matrix.html b/trunk/paradiseo-eo/doc/html/classd_matrix.html new file mode 100644 index 000000000..b2c651a24 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classd_matrix.html @@ -0,0 +1,48 @@ + + +EO: dMatrix Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

dMatrix Class Reference

A helper class for Sharing - to hold distances. +More... +

+#include <eoSharing.h> +

+List of all members. + + + + + + + + + + + + + + + + +

Public Member Functions

+ dMatrix (unsigned _s)
+double operator() (unsigned _i, unsigned _j) const
 simple accessor
+double & operator() (unsigned _i, unsigned _j)
 reference - to set values
+void printOn (std::ostream &_os)
 just in case

Private Attributes

+unsigned rSize
+

Detailed Description

+A helper class for Sharing - to hold distances. +

+ +

+Definition at line 37 of file eoSharing.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo1_pt_bit_crossover.html b/trunk/paradiseo-eo/doc/html/classeo1_pt_bit_crossover.html new file mode 100644 index 000000000..6bb32543b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo1_pt_bit_crossover.html @@ -0,0 +1,29 @@ + + +EO: eo1PtBitCrossover Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eo1PtBitCrossover Class Reference
+ +[Bitstring] +

eo1PtBitXover --> classic 1-point crossover +More... +

+#include <ga/eoBitOp.h> +

+ + +
+

Detailed Description

+eo1PtBitXover --> classic 1-point crossover +

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:44 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_aged-members.html b/trunk/paradiseo-eo/doc/html/classeo_aged-members.html new file mode 100644 index 000000000..44b36cf0c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_aged-members.html @@ -0,0 +1,24 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoAged< Object > Member List

This is the complete list of members for eoAged< Object >, including all inherited members.

+ + + + + + + + + + +
age (defined in eoAged< Object >)eoAged< Object > [private]
Age() const eoAged< Object > [inline]
className() const eoAged< Object > [inline, virtual]
eoAged(const Object &_o)eoAged< Object > [inline]
eoAged(const eoAged &_a)eoAged< Object > [inline]
eoAged()eoAged< Object > [inline, private]
operator++()eoAged< Object > [inline]
printOn(ostream &_os) const eoAged< Object > [inline, virtual]
readFrom(istream &_is)eoAged< Object > [inline, virtual]
~eoAged()eoAged< Object > [inline, virtual]

Generated on Thu Oct 19 05:06:44 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_aged.html b/trunk/paradiseo-eo/doc/html/classeo_aged.html new file mode 100644 index 000000000..adf521dee --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_aged.html @@ -0,0 +1,233 @@ + + +EO: eoAged< Object > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoAged< Object > Class Template Reference

eoAge is a template class that adds an age to an object.\ Requisites for template instantiation are that the object must admit a default ctor and a copy ctor. +More... +

+#include <eoAged.h> +

+List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoAged (const Object &_o)
 Main ctor from an already built Object.
+ eoAged (const eoAged &_a)
 Copy constructor.
+virtual ~eoAged ()
 Virtual dtor. They are needed in virtual class hierarchies.
+unsigned long Age () const
 returns the age of the object
+const eoAged & operator++ ()
 Increments age.
Methods from eoObject
readFrom and printOn are directly inherited from eo1d

virtual std::string className () const
 Return the class id.
virtual void readFrom (istream &_is)
 Read object.
virtual void printOn (ostream &_os) const
 Write object.

Private Member Functions

 eoAged ()
 Default Constructor.

Private Attributes

+unsigned long age
+

Detailed Description

+

template<class Object>
+ class eoAged< Object >

+ +eoAge is a template class that adds an age to an object.\ Requisites for template instantiation are that the object must admit a default ctor and a copy ctor. +

+The Object must be an eoObject, thus, it must have its methods: className, printOn, readFrom.

See also:
eoObject
+ +

+ +

+Definition at line 47 of file eoAged.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + +
+template<class Object>
eoAged< Object >::eoAged (   )  [inline, private]
+
+ + + + + +
+   + + +

+Default Constructor. +

+\ It´s private so that it is not used anywhere; the right way of using this object is to create an Object and passing it to an aged by means of the copy ctor; that way it´s turned into an Aged object +

+Definition at line 103 of file eoAged.h.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + +
+template<class Object>
virtual std::string eoAged< Object >::className (   )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Return the class id. +

+This should be redefined in each class; but it's got code as an example of implementation. Only "leaf" classes can be non-virtual. +

+Definition at line 74 of file eoAged.h.

+

+ + + + +
+ + + + + + + + + + + + +
+template<class Object>
virtual void eoAged< Object >::readFrom ( istream &  _is  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Read object. +

+

Parameters:
+ + +
_is A istream.
+
+
Exceptions:
+ + +
runtime_exception If a valid object can't be read.
+
+ +

+Definition at line 81 of file eoAged.h.

+

+ + + + +
+ + + + + + + + + + + + +
+template<class Object>
virtual void eoAged< Object >::printOn ( ostream &  _os  )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Write object. +

+It's called printOn since it prints the object _on_ a stream.

Parameters:
+ + +
_os A ostream.
+
+ +

+Definition at line 91 of file eoAged.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:44 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_algo-members.html b/trunk/paradiseo-eo/doc/html/classeo_algo-members.html new file mode 100644 index 000000000..365d81547 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_algo-members.html @@ -0,0 +1,18 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoAlgo< EOT > Member List

This is the complete list of members for eoAlgo< EOT >, including all inherited members.

+ + + + +
functor_category()eoUF< eoPop< EOT > &, void > [inline, static]
operator()(eoPop< EOT > &)=0eoUF< eoPop< EOT > &, void > [pure virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< eoPop< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:44 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_algo.html b/trunk/paradiseo-eo/doc/html/classeo_algo.html new file mode 100644 index 000000000..79018973b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_algo.html @@ -0,0 +1,42 @@ + + +EO: eoAlgo< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoAlgo< EOT > Class Template Reference

This is a generic class for population-transforming algorithms. +More... +

+#include <eoAlgo.h> +

+

Inheritance diagram for eoAlgo< EOT >: +

+ +eoUF< eoPop< EOT > &, void > +eoFunctorBase +eoCellularEasyEA< EOT > +eoEasyEA< EOT > +eoSGA< EOT > + +List of all members. + +
+

Detailed Description

+

template<class EOT>
+ class eoAlgo< EOT >

+ +This is a generic class for population-transforming algorithms. +

+There is only one operator defined, which takes a population and does stuff to it. It needn't be a complete algorithm, can be also a step of an algorithm. This class just gives a common interface to linear population-transforming algorithms. +

+ +

+Definition at line 39 of file eoAlgo.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:44 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_algo.png b/trunk/paradiseo-eo/doc/html/classeo_algo.png new file mode 100644 index 0000000000000000000000000000000000000000..55ce8a00dfd778a5c605d66a9b1b54416957c90b GIT binary patch literal 2054 zcmb7Fdo;!khU@*YZ!Hxif$tlV(>pMAFY&|vUC)?EU&TcrVR4Ri~DXXBsnXRYLzLHl9DQ15TOP?wzGm$jk)~-hmN3(Aq~&d zhp^hWP8v#jB^MS-*Z`fV(aF}AWf(yI-9Gcm0u1NirwMZ!~Qqvb_T z5{BQalO{jYb`8I|6Be_%1Pm8PKlAKo7*VM9ExS9x1DwpE;j z5ah2o8^*{mE*eyMHmJFyEv(r3uZ`gqMck`=@B~;wjHo0ssY@B4K%BEh8wRVlE)NC( ztxYSA<?Xx8khe0HqrLV{Rh6zJ;)a~r_hle86_mADYcsS6BAJV*~!qA-;iQC7`h)zUR z##0BIwZWg946sD-P!7j=p1`HAT(Lb)j4)ern8@YQz1WOd%5WNFq<_puB?&wb9Bi-5 z=JH7ENT}t$&ow_034t*eE{)p&LRt|5Dx@f3yo1H^{y$)slsZ#ut+?y_J*Eesc=7Dk z9B6#O(tb!BRRRA;UBT3qB{`DbepxvS4eo&A<3Y_rghB=U&rrND8`YWS@g^+(SHGU#7gwR}7L-)rY)l4*Mbk0=B8A5M<0 z;VRi#1EeZa`o!F|=oY>HU6m7XBET{955U$Xh4jy!_|doXWq1e=_ftTME0h&fJkfTz zAfW%Q;0n-OXdh(PGR~Q_Q2C>#My*8{r1{PXy!8w-;CHJ)&U!dIWdI@Kc6KFe5(W0t3#y^D5nho@{{@_BhVKy(MaM&I&MUcj7!a zSXRl7%Af?`6WJHuT7Sh9OS$L94oQpJHign2jUAAcSke10t~P)sDVg#ITYpyI|I6lc zdexut!!?rnrKV=cuY_9IbvY+b+bI9bc*vTN3f@^uF)irUVXT=2jmBJBRSt;Oa+%Mx z%%u>eZz2TT&G&Xd?%Dk0D_1NqpB8SUGra7L`1Qqp#R$JD#4x{o-PYzMm`Ro~8?BYs z|Gd0GWL%LHQr;+%!>EOxOKeK?FN6R;;380Uc2qZ;vMjXesk`Y$6 zAP}qLd+BKb>T|y+E7=HRo^dzD^!Tjh#R|5#?&H^9l)2dg9_y*J&5L5ZjTN9kg5zaQ zmHUDJEjQZsOK4r|Y%n!-+`EzTUK%Z-fXGP`VLbA;BE+o?0HfIzUI9nP+5!s8D99># z94}|{jgk*&F!uda!Oe1MHghR-9P?%D`et~tv1Cu09cKTzBuhIEKg86`0%Hdy3k#Pk z(FEHYD1aUPY41!fH|fPaYDq^C>)1UnLIYVXu9UKw{y>!pmAq+VMk!s{1$gyh`CAM72yQv88gZov%h3<5`bq;eRVG|4u<}KF@Ws-TJjCTtU6=8jNYzSr zVtzB>yaWI&a-(*~RZ_&-h1}e~DP2F2O+`{sLFiD7XMeG4BtO9C0powKm=f{{ + +EO: eoArithmeticCrossover Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoArithmeticCrossover Class Reference

eoHypercubeCrossover --> uniform choice in hypercube == arithmetical with different values for each coordinate +More... +

+#include <Tutorial/eoRealOp.h> +

+ + +
+

Detailed Description

+eoHypercubeCrossover --> uniform choice in hypercube == arithmetical with different values for each coordinate +

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:44 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_assembled_fitness_average_stat-members.html b/trunk/paradiseo-eo/doc/html/classeo_assembled_fitness_average_stat-members.html new file mode 100644 index 000000000..47e394579 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_assembled_fitness_average_stat-members.html @@ -0,0 +1,41 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoAssembledFitnessAverageStat< EOT > Member List

This is the complete list of members for eoAssembledFitnessAverageStat< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + +
className(void) const (defined in eoStat< EOT, double >)eoStat< EOT, double > [inline, virtual]
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
eoAssembledFitnessAverageStat(unsigned _whichTerm=0, std::string _description="Average Fitness") (defined in eoAssembledFitnessAverageStat< EOT >)eoAssembledFitnessAverageStat< EOT > [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoStat(double_value, std::string _description) (defined in eoStat< EOT, double >)eoStat< EOT, double > [inline]
eoValueParam(void)eoValueParam< double > [inline]
eoValueParam(double_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< double > [inline]
Fitness typedef (defined in eoAssembledFitnessAverageStat< EOT >)eoAssembledFitnessAverageStat< EOT >
functor_category()eoUF< const eoPop< EOT > &, void > [inline, static]
getValue(void) const eoValueParam< double > [inline, virtual]
lastCall(const eoPop< EOT > &) (defined in eoStatBase< EOT >)eoStatBase< EOT > [inline, virtual]
longName() const eoParam [inline]
operator()(const eoPop< EOT > &_pop)eoAssembledFitnessAverageStat< EOT > [inline, virtual]
repValue (defined in eoValueParam< double >)eoValueParam< double > [protected]
required() const eoParam [inline]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< double > [inline, virtual]
shortName() const eoParam [inline]
value()eoValueParam< double > [inline]
value() const eoValueParam< double > [inline]
whichFitnessTerm (defined in eoAssembledFitnessAverageStat< EOT >)eoAssembledFitnessAverageStat< EOT > [private]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_assembled_fitness_average_stat.html b/trunk/paradiseo-eo/doc/html/classeo_assembled_fitness_average_stat.html new file mode 100644 index 000000000..08483e277 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_assembled_fitness_average_stat.html @@ -0,0 +1,59 @@ + + +EO: eoAssembledFitnessAverageStat< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoAssembledFitnessAverageStat< EOT > Class Template Reference

Average fitness values of a population, where the fitness is of type eoScalarAssembledFitness. +More... +

+#include <eoAssembledFitnessStat.h> +

+

Inheritance diagram for eoAssembledFitnessAverageStat< EOT >: +

+ +eoStat< EOT, double > +eoValueParam< double > +eoStatBase< EOT > +eoParam +eoUF< const eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + +

Public Types

+typedef EOT::Fitness Fitness

Public Member Functions

+ eoAssembledFitnessAverageStat (unsigned _whichTerm=0, std::string _description="Average Fitness")
+virtual void operator() (const eoPop< EOT > &_pop)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+unsigned whichFitnessTerm
+

Detailed Description

+

template<class EOT>
+ class eoAssembledFitnessAverageStat< EOT >

+ +Average fitness values of a population, where the fitness is of type eoScalarAssembledFitness. +

+Specify in the constructor, for which fitness term (index) the average should be evaluated. Only values of object where the failed boolean = false is set are counted. +

+ +

+Definition at line 46 of file eoAssembledFitnessStat.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_assembled_fitness_average_stat.png b/trunk/paradiseo-eo/doc/html/classeo_assembled_fitness_average_stat.png new file mode 100644 index 0000000000000000000000000000000000000000..8f9b32e964083ba7db1845437aea3ea0761c9b0b GIT binary patch literal 2829 zcmdT`X;f3!77k)72{MBShzJ!!u#!p{WS&6{gc*5Gpr|N3AfO}>VqzssGKm6F86pJ> zG6^UNg92WZu|QjePzfd%s31c~9-0IbNK<^cd_Ue=uRq_9eea&mS$FUIo$u^)AGC)8 zOdAG)KokxgboGNkHnF6-aI>uR*{w?Pk-oP3cm}vhBoe7Ak#th2p*N)3x^#ASCIXUa zsVQ^G5A6?ed^>gy0)dqsa&-#87cCYI##J9scK4d7s!`Dy{SJwVe4Ct*Z@0H&ZCBIo z-OA~tat?a-RzO{@{@SIQ$N5?nG4u%WiuX2BROL|bj}K=={P2RWU>yU_$!cXlx-a;= z5_9^D95qwxW|w|8O|3n%Z&8GgD==&szCDpXPwOJKAUW~Iev-V5kss7s9w@?5+?D7w*E8~&bPxZ%Fzph&<;GLa05}l#G5dgI6#v?40^eCoRo?*PQ7`WyVdq+L838JYi67MaELrEq=IqM zRsh7tBSWALHQe(nCGvv31SFGvFJ#gNGzh{U?OHue{SodNimA@~)@-)PSCP$HDRdlSU>0?_rf6C@TR=ly=&|NC0b5pwRt%hS!mKNK!0bTs$j%}Dj2e3CT z7K_T|mF%j{vF!R3w!SU?Ks2yTEdQM%>oD7@%hAqHwps9xRpvw zYXe?8f)_i%m5C?2Qk@m3O6In|-)FxxH*^zMyy7Me^Ezi(3E=v^?qFwiUH)|H=W z%d=wLCttzSP|u9b+n(t)qAoZNvdr|xO6+MC0m3lbUE+oiEvXV9Qc_&UQYH-UzD^$x zjEh9Na*5L^s$XNa7|AeYv^Ozj4nuHPv4n$S{}Z1~A zbB8FW_GO-4&$)!UBo*3i)63q^R>~=_-Z4v5N*=3aEOKe?!Tt+5`A||_4F*P)lA#bP z`gP1Ts$b`--TppCvM4CQWuffA%1?ztc3syS8bCEgn=o+-mufY#(kJvA?obNh+1(aD zv~alw{NCLm%GrakaB=MS#N@Woc7A(p AsCHsf!ftg*l2tABgQVN%p6qpdv1{0j2Lsdb#@(3_sms>vV9Nh5T=jOj`(sf99nx zjiXY)s&?w$)0fI-%$D zz>Fzm@hHa*My_EbXL}X@^8Wjb`GQuoLw>LGV*m?yQdE>`3ee(>oAL)e>SMeOY_~>7 z2MQ^+#!P{xHgg{%;=9+y*Dm(xEGh-!ozM4M{@ifl4gyN5SS^J)!06pu{>e#u$|i)h zy9(#mQ)aKF)eVj=a_fPR7*Zvmmclm0I+`g#NwlsqSPqa{%nj~(bfVwpQ}W2d-Tb?! z(gDjI8>k&lOM?`_Nz8wLNoq&c+Oo~GMz62I?#mg8Te#`~pI z>Co|*KvxuVyp$e7c~%DEP0$jXnN%x7f-0n~V}^3#~a2n=h8Xtpb#mIa3cN zq9#0Af zp3&wVru6YxjAqr-fqUFH@1H(fo~Y1xv*Q2p4Rs8hv)~_Cs23f>^8deMwq&m8u8qH_9>o4=*SsP>vD~QHj@)}>8;8WPVNY<9)u#QEtC_`+$v^t00MxqyA?-l^ac7UExn1A!Mf>O}xW$Y=|Z$}^@{q&hV zqtdA(j;GDRA<#k^Dz=~BmN&F-COF|5hK~A22bM^gq%kAkK{X6HUGWrysbke#Mn?k- x`D=7?2VbK4MQf$UZ&{T5s2wqx<_St<5iJf1C+Y{DN@rKdAvd&Zopb25KLK}eQLg|1 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_assembled_fitness_best_stat-members.html b/trunk/paradiseo-eo/doc/html/classeo_assembled_fitness_best_stat-members.html new file mode 100644 index 000000000..3dc81e430 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_assembled_fitness_best_stat-members.html @@ -0,0 +1,41 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoAssembledFitnessBestStat< EOT > Member List

This is the complete list of members for eoAssembledFitnessBestStat< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + +
className(void) const (defined in eoStat< EOT, double >)eoStat< EOT, double > [inline, virtual]
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
eoAssembledFitnessBestStat(unsigned _whichTerm=0, std::string _description="Best Fitness") (defined in eoAssembledFitnessBestStat< EOT >)eoAssembledFitnessBestStat< EOT > [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoStat(double_value, std::string _description) (defined in eoStat< EOT, double >)eoStat< EOT, double > [inline]
eoValueParam(void)eoValueParam< double > [inline]
eoValueParam(double_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< double > [inline]
Fitness typedef (defined in eoAssembledFitnessBestStat< EOT >)eoAssembledFitnessBestStat< EOT >
functor_category()eoUF< const eoPop< EOT > &, void > [inline, static]
getValue(void) const eoValueParam< double > [inline, virtual]
lastCall(const eoPop< EOT > &) (defined in eoStatBase< EOT >)eoStatBase< EOT > [inline, virtual]
longName() const eoParam [inline]
operator()(const eoPop< EOT > &_pop)eoAssembledFitnessBestStat< EOT > [inline, virtual]
repValue (defined in eoValueParam< double >)eoValueParam< double > [protected]
required() const eoParam [inline]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< double > [inline, virtual]
shortName() const eoParam [inline]
value()eoValueParam< double > [inline]
value() const eoValueParam< double > [inline]
whichFitnessTerm (defined in eoAssembledFitnessBestStat< EOT >)eoAssembledFitnessBestStat< EOT > [private]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_assembled_fitness_best_stat.html b/trunk/paradiseo-eo/doc/html/classeo_assembled_fitness_best_stat.html new file mode 100644 index 000000000..4e8fcb596 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_assembled_fitness_best_stat.html @@ -0,0 +1,59 @@ + + +EO: eoAssembledFitnessBestStat< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoAssembledFitnessBestStat< EOT > Class Template Reference

Fitness values of best individuum in a population, where the fitness is of type eoScalarAssembledFitness. +More... +

+#include <eoAssembledFitnessStat.h> +

+

Inheritance diagram for eoAssembledFitnessBestStat< EOT >: +

+ +eoStat< EOT, double > +eoValueParam< double > +eoStatBase< EOT > +eoParam +eoUF< const eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + +

Public Types

+typedef EOT::Fitness Fitness

Public Member Functions

+ eoAssembledFitnessBestStat (unsigned _whichTerm=0, std::string _description="Best Fitness")
+virtual void operator() (const eoPop< EOT > &_pop)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+unsigned whichFitnessTerm
+

Detailed Description

+

template<class EOT>
+ class eoAssembledFitnessBestStat< EOT >

+ +Fitness values of best individuum in a population, where the fitness is of type eoScalarAssembledFitness. +

+Specify in the constructor, for which fitness term (index) the value should be evaluated. +

+ +

+Definition at line 87 of file eoAssembledFitnessStat.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_assembled_fitness_best_stat.png b/trunk/paradiseo-eo/doc/html/classeo_assembled_fitness_best_stat.png new file mode 100644 index 0000000000000000000000000000000000000000..798d68236345ad47347fe8ce3e2cd25feee96130 GIT binary patch literal 2790 zcmdT`eLU0q7oX_HJS>rU-lfn~RthU55{*QKo;*joDW)vLm})aBhNh<_DO4yuT$$E2 zZ8!7KT18|geOH=dGd&p1?Dws1-R|$N-~IFV$LIS!=X^fr^ZI_zd7t+=c|jX|b)lwE z2n3>wS?9e80+}%Y$`cyu;In1UsUYxW9JD@otxBZ=MU|?#tSqV!l)kR!=H?8x>NTjU zrEJ=;8M6A#^IZ@Klz{Q}491_6oa61UK^x=*lvdXkIoATrLs!q3y$czyB`6S^{JpYe zW7MvGE#>?ZJGFBo-9rWKw9bYdPSaC%$B1E99<^Sq6D!8!i)TVv9bROEOYFRjz@JyJ zF|nG6{F}Yube}%0GRnw!CVE9jk;SrIsiIpFY^3xytH=j75Ova)kkM1MF~d!sW(no< zcy?m*N9N;~_3)o=tf-Mqwdpt2jy%Bwuii)Jn{E3=C>tU(cTAsykzn%Zh|rJsYVSoG zKQ3n36e??I~xgS1=!o@Fo!#)%;F}oB&Vrox?_#DS3rQO=dNOtj^a=iNl z-_vxv+l5Ur5fgoZ=`!?6CchW)VKAzR|8~f{LJxgfFDgKw1>w>#G7<5gXm2?xs=sEEOIc09|0Pw1MHmEQh|M6CFXaxQzB&OY-kyTRzC z_UBGlvl|ECH(&Lz0xlXw3f25_bwad?4j7nJ&lzYgy^!4+R5E*oOHuhd*(W8>0?7TY z@3DIS2@`w8FZUe%yUE^af1>r85UZ!@Sz`6Xp4{JYJ5n11pZx>At5SWKeVNL=r^TRAZbUI3^6UFrX>&5rB~6Ku=@EYX(=V2=8+HE1fY$4_G%c3 zryYp!#2ec#BOV%x**(s=SNP9l1Tv)q#vW^PGlkC+^3{8UxgN5rBH71v(@)rfFmhmd z>AP}W>vmTfO&_HzukF|L01vwHjC)ca_Q#R~(=fetGUWCb4W2p+2?D76R2}M?D{y!V z{c%a+5QY_8Zeb zPa)$u%&h5pJ&V}tP^sob>?Fiwd=?6V0R9+BCeDfjg^dy-8YGLaa5A2|;W*T;sv0Xz z{dJ_s%+I*l;(`Wt)^1JgtOa0t1!Fd2fw;Bb;gOe=S8Dh}(|)NJG=rhOT!W!bgGeE| zYEp`j_jvaI≫jz;KgqB3K+#!+J&K!DtivbKe4!t;FP_LI}uivXNboPBzAgAZec(JTrw=g;1AU{9TaH-Sb#dOQsA{NEk z(9(iJt?vvr=I%;wI--B)v}51-!<`t^)y~F0tlbjqP6~i)`8Qg+5DD|9>Tj`;gm$u- zfvvgEW`p|VKFA0e(}Z&S{psziRFU!7M9~q2UdAw#*oJPDJ$8EB5W3tJNBMJCMAmuq zS%F3(nG3%eZ#$WT-5ZJqsC2D`!iI4ix7(7^SN#5Ha?adUYk_ST3~$Ni@)h9#KX9yc zt|fi0U>_!rr_-sem2q@)CfRW0BPd_^j$M|Q(s%k@xPDR-ad3q*3t zKEhtM!=e4BL`*y`-zLc zVdQVK%x;pSyfbN`!fOA>8BVdYiq5Xf>QP8G58mYFwJJYB%u;ds)opRj!o>Z5YEWteTZt=@#i!3!|C;XKs1>(FdamWe?H`hTfIC`i&)RO1Px?MHsGrPdU(5? z1Qvq#8F@BBFELGc^`#M=_y7}t7r@gpdosPrtY$OGGT1-40sOrW3i1IKDu!DJkI>GX zHyi9i#!5vrn6t%^11!cLm%M|~PMu8i{yrr%M?qxDnHy!;fXxV_Xjq6;u#+Ylk8)9^bv?uGZhY!wdx3|!d$$p* zC0v)k1>Za2L}s2^BSw}$N9`9U8qDRE4^GurFlyFsp zPC{7{66M%?csrKa5jwGNVb~VDbGHqUhD3JDrfYNJ*_*$N8QVF_u%|@NYMF+pWS0Ni z^vH}`PYn(t!$%v0F2a@x-=hj_f91NLXTk6E{%{ojNZFKY;Yd~?F5h?SM;z-$gF`6< Nvvz~`b+4$y{{b9$GK&BJ literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_atom_exchange-members.html b/trunk/paradiseo-eo/doc/html/classeo_atom_exchange-members.html new file mode 100644 index 000000000..54bca79ee --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_atom_exchange-members.html @@ -0,0 +1,20 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoAtomExchange< Atom > Member List

This is the complete list of members for eoAtomExchange< Atom >, including all inherited members.

+ + + + + + +
className() const =0eoAtomExchange< Atom > [pure virtual]
functor_category()eoBF< unsigned, Atom &, bool > [inline, static]
operator()(unsigned, Atom &)=0eoBF< unsigned, Atom &, bool > [pure virtual]
randomize(unsigned int, unsigned int)eoAtomExchange< Atom > [inline, virtual]
~eoBF()eoBF< unsigned, Atom &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_atom_exchange.html b/trunk/paradiseo-eo/doc/html/classeo_atom_exchange.html new file mode 100644 index 000000000..6cd5b79f6 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_atom_exchange.html @@ -0,0 +1,47 @@ + + +EO: eoAtomExchange< Atom > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoAtomExchange< Atom > Class Template Reference

A helper class for choosing which genes to exchange. +More... +

+#include <eoVariableLengthCrossover.h> +

+

Inheritance diagram for eoAtomExchange< Atom >: +

+ +eoBF< unsigned, Atom &, bool > +eoFunctorBase +eoUniformAtomExchange< Atom > + +List of all members. + + + + + + + + +

Public Member Functions

+virtual void randomize (unsigned int, unsigned int)
 a function to initlialize - to be called before every crossover
+virtual std::string className () const =0
 the inherited className()
+

Detailed Description

+

template<class Atom>
+ class eoAtomExchange< Atom >

+ +A helper class for choosing which genes to exchange. +

+ +

+Definition at line 41 of file eoVariableLengthCrossover.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_atom_exchange.png b/trunk/paradiseo-eo/doc/html/classeo_atom_exchange.png new file mode 100644 index 0000000000000000000000000000000000000000..125fc68e72ced97f7d4af78b0c2ca322ed11034a GIT binary patch literal 1761 zcmZ{l2~d;Q7RNtg)L;etAWsmLl%RnK89>Aa)Mo+$ zQlu=3k)UjCSTrJ_A`=2pi4gY1fR9CJSp|j!C{144KJCowdo$J?rw5 zSv=isq5vU`T7B<&_Ets*?zpA-gGOc0idRIvTU6tBqP7H3-sXvP0af9UE`dIK<6Fx= zAq){DUMD@6ZV}8Tghxgf7R9)~(-J*1&WAftWZr}$m zi`B4WD1pJmY?HYl+^NzCH|ITX$VY2Dp?bezLBeA*2I5Wtq?zB;%xNDnn>-yNQo2_j zlJ*o=Wv;~<&#O;2B)KftA+n`x-4v|gho%D*XRh(p3UOO-w=ru6S`hJtFbG3PERX)A z_&$;mO1Xu|iRy>WKvJHutRLmjGY{bxY+i(e^>r`Zk)fFxkTmgoM3R(?h@yn0>v7U! zvMz*`tsB93p$QQ8ET|}Td$i!2((N2Po4D^6Z{(0oS^lL+#)^Tos zAxo0jD+7nhZPGdiZmyAAeF`vo$^@!$_sLMAVA%iFCA?!{9 z2~HphV?mzNYbUX2{n15VPN=S;PLm12-p(JjzL@+tlL=AauaDMTw0~}Z1VbX!Q7{tx zF2WgPLI43s1CVMcSiXGF_3ks)e$4R_s@8|(->OLP`s=KIC3RdmFbV9Nc%G&CvB6Ji zHL-=KL$T#S!#xk#HxK7p8OB54%>Bf#%8Pw0aKC)QlF;lrJ+BmP+#3;+-kAaGhl5N( z+U|-r8!~(f{&Hhy#Y7sS=UFOZKzy!vIj3pvW)0??&zRtvMVNb>W7|2#Va^i$7}%6W zdSMY>GH%;ot7FM_K1r(0Lg5b-(GMM*!8_Gq;{3B(1o&Ve>`&zXgYJKs@>d13o%QW+Bct7q z?SMj2mm?r?%$!nVPSI_(0NbpRMBr}XzSmoTYGGGIAFYBDe1!k@`%yMtN^4+ow9qq) zV6$t&?rRM)dpf%yW9XM(Z|Q`lja0?aCn}lTOTGYS(rusJEOv8nf5Un&ZSb|-IF&K( zRnWIcS|b96;pwbV#V{5pvEJzLS3k71Og!@@wal!;2)D_ot1t&;xh4XCdS37alT*EN z)5Wdt$#?2l9T9sLt{TB^^&&U7spqXeS%9IT(_iX#JyF!`%3cMvAmUrsklq;fIvGgD z>m8cob;)Tt8T#SBRRY+TMEX-}qJjqW&1s7=Am>)mfdOs$6yUsqDct_I_wyCDN^8UE zf%64U?|X3|vuD2=AptW2lJLwT)Bg+fKV$zF;g1Q`gby#u6|uQih-v?}Eg!rJ&`Dt& znCK3x#qjFxnOb`A8y&MZ=#0`FR{pzUh9&n!d^T6{5-whj>dUT*C+S9la{_679w9_EZz_64Kca zJf`tjQ6`|?rT3y{o!l{e7WJD`( + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoAverageStat< EOT > Member List

This is the complete list of members for eoAverageStat< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
className(void) const (defined in eoAverageStat< EOT >)eoAverageStat< EOT > [inline, virtual]
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
doit(const eoPop< EOT > &_pop, eoParetoFitness< T >) (defined in eoAverageStat< EOT >)eoAverageStat< EOT > [inline, private]
doit(const eoPop< EOT > &_pop, T) (defined in eoAverageStat< EOT >)eoAverageStat< EOT > [inline, private]
eoAverageStat(std::string _description="Average Fitness") (defined in eoAverageStat< EOT >)eoAverageStat< EOT > [inline]
eoAverageStat(double _value, std::string _desc) (defined in eoAverageStat< EOT >)eoAverageStat< EOT > [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoStat(EOT::Fitness_value, std::string _description) (defined in eoStat< EOT, EOT::Fitness >)eoStat< EOT, EOT::Fitness > [inline]
eoValueParam(void)eoValueParam< EOT::Fitness > [inline]
eoValueParam(EOT::Fitness_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< EOT::Fitness > [inline]
Fitness typedef (defined in eoAverageStat< EOT >)eoAverageStat< EOT >
functor_category()eoUF< const eoPop< EOT > &, void > [inline, static]
getValue(void) const eoValueParam< EOT::Fitness > [inline, virtual]
lastCall(const eoPop< EOT > &) (defined in eoStatBase< EOT >)eoStatBase< EOT > [inline, virtual]
longName() const eoParam [inline]
operator()(const eoPop< EOT > &_pop)eoAverageStat< EOT > [inline, virtual]
repValue (defined in eoValueParam< EOT::Fitness >)eoValueParam< EOT::Fitness > [protected]
required() const eoParam [inline]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< EOT::Fitness > [inline, virtual]
shortName() const eoParam [inline]
sumFitness(double _sum, const EOT &_eot) (defined in eoAverageStat< EOT >)eoAverageStat< EOT > [inline, static]
value()eoValueParam< EOT::Fitness > [inline]
value() const eoValueParam< EOT::Fitness > [inline]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_average_stat.html b/trunk/paradiseo-eo/doc/html/classeo_average_stat.html new file mode 100644 index 000000000..8ced7d89d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_average_stat.html @@ -0,0 +1,77 @@ + + +EO: eoAverageStat< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoAverageStat< EOT > Class Template Reference

Average fitness of a population. +More... +

+#include <eoStat.h> +

+

Inheritance diagram for eoAverageStat< EOT >: +

+ +eoStat< EOT, EOT::Fitness > +eoValueParam< EOT::Fitness > +eoStatBase< EOT > +eoParam +eoUF< const eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::Fitness Fitness

Public Member Functions

+ eoAverageStat (std::string _description="Average Fitness")
+ eoAverageStat (double _value, std::string _desc)
+virtual void operator() (const eoPop< EOT > &_pop)
 The pure virtual function that needs to be implemented by the subclass.
+virtual std::string className (void) const

Static Public Member Functions

+Fitness sumFitness (double _sum, const EOT &_eot)

Private Member Functions

+template<class T>
void doit (const eoPop< EOT > &_pop, eoParetoFitness< T >)
+template<class T>
void doit (const eoPop< EOT > &_pop, T)
+

Detailed Description

+

template<class EOT>
+ class eoAverageStat< EOT >

+ +Average fitness of a population. +

+Fitness can be:

    +
  • double
  • eoMinimizingFitness or eoMaximizingFitness
  • eoParetoFitness: The average of each objective is evaluated.
+

+( For eoScalarFitnessAssembled user eoAssembledFitnessStat classes.) +

+ +

+Definition at line 108 of file eoStat.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_average_stat.png b/trunk/paradiseo-eo/doc/html/classeo_average_stat.png new file mode 100644 index 0000000000000000000000000000000000000000..964429d0472faf67c15039f579dda812004da440 GIT binary patch literal 2744 zcmdT`dpy(YAD>hh=2B4;PMqV~Ax>+GT#MYcg)Ty)NV%??Ekw$O!g9%ojHc2}xsNf- z&~Zu5QLeRpt#k@&h;3;5P5tWB>vdkQ-|PJO`{Q}O&*yo6p4anyKhNj$em^NFgp(o| z3I>5diq3m>d4NDGSdy_|rL?4PS0$k&pY@*4*42!w|og zm{Mmv5S}30@xfyt5E$XS%gzf|FjdfUigQnuz`1_!fuhF4TZ=31JUv%@IOx$ev=|Ik zwtteL`4=~3AwR}kEoTgkUT+_cxn$M96F^Rt5wlK1lXIM<_pZ)Qo3qd&*Qp9cF>pSFM40+O%=OSqT;#d z3c) z&k_P`UG+3zU2Jn~($?S7wC8&vT%-8AmPgIh3lHLz`h*B7tr;D}l;!8>Yv48b7^V_M zBQ0tEMjc(nx*I1}TFVt*rc^GnCdsp1Elat7R-V4PgY6%^VxYtxC%D{Z>e~>~-n&Cq zHNuUng-?QwrfpN^iuWl2NY(Vplj+3OXJBtHp9b1Xx=>`F`q>TXq+UxPj)`Xc8hi43 z56_;8_DJ>ds9|}r)>=FHbufA;%GR8LU^C69ipa#>LA538t)z+L!VGzSdmSG6=V?I1 z5xj!;dRRQ=3iEg`6_7dFK0pA0#889~3=hkyo3+lutlZ|y*NSFgv1MQ+C6Ctw6%9TD z-Z9Q9_C^`%#lAnQLaHGI)3Sdr8VFj6HKY%SC3Jzj5V~# zfYY)&qDZQIV8qX5{)YFk$t`1NvpcUpJ;GJWn=dBT#mMrH;uB@QmVN zo^Y;BGl2L6m8N_yQpcg%{xx4eqZqnr=G87jNaB;2H5=}!=zMVh>i@q0=FHJ5Tk69l zO%V3NeW_8Yveg(FDzsUX9rCXxN}E5`2vzHfq0^@PNJ5y9Jc=?ZQ23U^?gF1x&N5c& z+z>Cf#;05EkBzL;S~$$?gO$JD+YufTrXQ{9l8*6FQxaYHfY;u$0j|V1F$>b_=X$!T zTQ77L%1y-NP|HqXVk?V7PDj#EL&ifdixxv?JmKpUh6F1ME!yOK*Q6_+qSqnod4qdl z`1zl0{Ckk&iwV3QWA}jVvX|&nj}45jAgQKp2;4!}vCPb}inx*rf9Eyn^15mXZ87nr z4|t8u6CW?-jrj@=T}oaUg%ydk;RC! z2QDSgM7ee*lL)$@aK^GD5}P_}InFh2y%Xzf7%W)(D+!hyKtTEcqM13L&`rKP1*G_y zT%z_Ppr(R=q`|C4Zm~(B-D=ZKL5j#28UC}0El0Hh;F@FB0ms`UzH8?(l6g4R@T4|< z=oZ@uCTwX6B>j<)V{@W#u&^*+!)R%vej<4>!wyfT42gjvM#^4*`8BU{Z!_vx2`C+S z_Ld8lwu)@XGZi)jB~6w7$nhL|^!~EKbJ+~Op1GGU{pW3l-z?)Feb20F}cHEX8rT4a#o0MxJrIDo5ODWpYmr z@8oUDwpi%fn$i_wh|UUpph#}Z@yqSt&u8+gS3jYSG2g6mAnMS$RmZj$8VB2}$P&|A z$<+ZysYg=^BTa^%OAnj9c%O#}*nB%Wy5o_2?|Y_)=Bq=Au-kDD(s%mY!q$!IQy z67aD|>sju>9JPB-YF4Eoxl@`zu}kl5tv0jlh?@bd$F)y+q|_`qrSJs0M_+C~IOUha zA`wQiXp5Q?;k~2J{v%qf5m!d}17)=Ql{KF-$MQQ;y)7ZNuARp1a*|ZV2fMl$wYbUm z*zNS!v$DDY&#kLlShEuF@q< zLS03=KQ7#{;@`n&RjCN$_*G;H84^BA@Rx&qEvj$I{P(oLS%hf{r?a&qHZ=-cKjm*) z^__rI7%B%!GiztAg(tbcSK224&(8%iIR0T8VSD3C8F%_k13&4a&2pE<-Mv5KRXH<5 zhR?4}4MVUD)&mnBo>ap{uVlerI+O9L<>BErxe(ifa!|I=gtEI|^qXtVv zD2eXX>!s3QOCx@r_vey~Vh_=-pLaIo?!Z`tT5jx0fKNzvcYZY(p?#Bq4a{WJ<_dnfbOG^&=tVc$0`Vo1j^ zZerl1mq1T^!{Q}cet(xV7O_;tZK8oqE#7g)gE0#nNTi7KNeyC+IU^j2olImQV!VLq zsz!{>Mo7UQmRgJ3xi5IJ1oE~rM(c@ow#UWL6ieSSrX5z<*R(_L{BTd^sTWi*8abOa zO3OAF)vhPpx`yyFfGPFMfEGE#v@o8i*(dJ#1{rCTCVb+AU;4kWc1HodOQNfmJ_ST=4 QpP3-%-H2Uf_Wl?D15@cHS^xk5 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_b_f-members.html b/trunk/paradiseo-eo/doc/html/classeo_b_f-members.html new file mode 100644 index 000000000..af6498a16 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_b_f-members.html @@ -0,0 +1,18 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBF< A1, A2, R > Member List

This is the complete list of members for eoBF< A1, A2, R >, including all inherited members.

+ + + + +
functor_category()eoBF< A1, A2, R > [inline, static]
operator()(A1, A2)=0eoBF< A1, A2, R > [pure virtual]
~eoBF()eoBF< A1, A2, R > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_b_f.html b/trunk/paradiseo-eo/doc/html/classeo_b_f.html new file mode 100644 index 000000000..96b8ba45a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_b_f.html @@ -0,0 +1,52 @@ + + +EO: eoBF< A1, A2, R > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBF< A1, A2, R > Class Template Reference

Basic Binary Functor. +More... +

+#include <eoFunctor.h> +

+

Inheritance diagram for eoBF< A1, A2, R >: +

+ +eoFunctorBase + +List of all members. + + + + + + + + + + + + +

Public Member Functions

+virtual ~eoBF ()
 virtual dtor here so there is no need to define it in derived classes
+virtual R operator() (A1, A2)=0
 The pure virtual function that needs to be implemented by the subclass.

Static Public Member Functions

+eoFunctorBase::binary_function_tag functor_category ()
 tag to identify a procedure in compile time function selection functor_category
+

Detailed Description

+

template<class A1, class A2, class R>
+ class eoBF< A1, A2, R >

+ +Basic Binary Functor. +

+Derive from this class when defining any binary function. First template argument is result_type, second is first_argument_type, third is second_argument_type. Argument and result types can be any type including void for result_type +

+ +

+Definition at line 145 of file eoFunctor.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_b_f.png b/trunk/paradiseo-eo/doc/html/classeo_b_f.png new file mode 100644 index 0000000000000000000000000000000000000000..5f2ad1c9a9af65e36161d700b672ae4137455cdc GIT binary patch literal 435 zcmV;k0ZjghP)cT}?Y zJ-n4s$x<)uaN??514WEP7&Cw|jTmteh-MFu42v?3q?x!ONOip>)5i`D(m~!yaZIyw zb~(aXVXL>eHXr*SV{Kb~Img8pv=$!CPU#Xm{A70HJfWyKL+ZTDPCzHl{~#v*w)o(W z`XXLeg5ShH);sZaecg!P>-@wgKJkf9{M~UF3KvFt^Ap!=Hj48(e2kD_h)Gi*gOc<>f2YlQUvs zFi6vh>QZ&rG@tr1QwC#8&erOCvtQwL_Ut@>tIiiZWIQczAKYnJf$!F?@rLNdf9I3= dfB4vs`U~3+ + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBestFitnessStat< EOT > Member List

This is the complete list of members for eoBestFitnessStat< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + +
className(void) const (defined in eoBestFitnessStat< EOT >)eoBestFitnessStat< EOT > [inline, virtual]
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
doit(const eoPop< EOT > &_pop, eoParetoFitness< T >) (defined in eoBestFitnessStat< EOT >)eoBestFitnessStat< EOT > [inline, private]
doit(const eoPop< EOT > &_pop, T) (defined in eoBestFitnessStat< EOT >)eoBestFitnessStat< EOT > [inline, private]
eoBestFitnessStat(std::string _description="Best ") (defined in eoBestFitnessStat< EOT >)eoBestFitnessStat< EOT > [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoStat(EOT::Fitness_value, std::string _description) (defined in eoStat< EOT, EOT::Fitness >)eoStat< EOT, EOT::Fitness > [inline]
eoValueParam(void)eoValueParam< EOT::Fitness > [inline]
eoValueParam(EOT::Fitness_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< EOT::Fitness > [inline]
Fitness typedef (defined in eoBestFitnessStat< EOT >)eoBestFitnessStat< EOT >
functor_category()eoUF< const eoPop< EOT > &, void > [inline, static]
getValue(void) const eoValueParam< EOT::Fitness > [inline, virtual]
lastCall(const eoPop< EOT > &) (defined in eoStatBase< EOT >)eoStatBase< EOT > [inline, virtual]
longName() const eoParam [inline]
operator()(const eoPop< EOT > &_pop)eoBestFitnessStat< EOT > [inline, virtual]
repValue (defined in eoValueParam< EOT::Fitness >)eoValueParam< EOT::Fitness > [protected]
required() const eoParam [inline]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< EOT::Fitness > [inline, virtual]
shortName() const eoParam [inline]
value()eoValueParam< EOT::Fitness > [inline]
value() const eoValueParam< EOT::Fitness > [inline]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_best_fitness_stat.html b/trunk/paradiseo-eo/doc/html/classeo_best_fitness_stat.html new file mode 100644 index 000000000..765de184d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_best_fitness_stat.html @@ -0,0 +1,70 @@ + + +EO: eoBestFitnessStat< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBestFitnessStat< EOT > Class Template Reference

Best fitness of a population. +More... +

+#include <eoStat.h> +

+

Inheritance diagram for eoBestFitnessStat< EOT >: +

+ +eoStat< EOT, EOT::Fitness > +eoValueParam< EOT::Fitness > +eoStatBase< EOT > +eoParam +eoUF< const eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::Fitness Fitness

Public Member Functions

+ eoBestFitnessStat (std::string _description="Best ")
+void operator() (const eoPop< EOT > &_pop)
 The pure virtual function that needs to be implemented by the subclass.
+virtual std::string className (void) const

Private Member Functions

+template<class T>
void doit (const eoPop< EOT > &_pop, eoParetoFitness< T >)
+template<class T>
void doit (const eoPop< EOT > &_pop, T)
+

Detailed Description

+

template<class EOT>
+ class eoBestFitnessStat< EOT >

+ +Best fitness of a population. +

+Fitness can be:

+

+( For eoScalarFitnessAssembled look at eoAssembledFitnessStat ) +

+ +

+Definition at line 316 of file eoStat.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_best_fitness_stat.png b/trunk/paradiseo-eo/doc/html/classeo_best_fitness_stat.png new file mode 100644 index 0000000000000000000000000000000000000000..fba90188034f51db5c992b2e28a457a5fc344b94 GIT binary patch literal 2762 zcmdT`dpMNq79UZV3}sv*mk1NNgcus4+;YE@HtDiU?n5!dj2TaRjL@#F+bD7gMT$ro zVen1Sj!Y8548BCCWQ@z~nHc6wozp&gp8cHj>_5*R@As{>err9?`rh~V{=SvvqaOsaZcJqJCB#L~4ta`?=(WYiBfv>06pBotu&t=*$ZsO++iGiT!vVtg zB3JB;pO-(xe(LQ>2n2e>)p1_{wqT~9J+ahk6WP-vV;d>>!d%R=UrNrw|7`zlzPxWYTY z>C=7frcK+IXG&}fSv407Y>0^@hB*ZO52 z+1^XPJHNECVzBnU^q9z8X=y=q6@9vp_c8;e1g4##!P#D%2o+PHWwO^9>|m*J=;O{4 zls|4Z(&R_Iu`6;4Y`bT@zpvaBq!Fz1H2j}npnf3 z;<;xhxW8C(;(CJqZ;}j|HkJSaPdM2JzD2tn3`lm*Zr{$SicEbEv?RoV6Z}xB(5jjD zu2J#ALtLsJ9!bAE*?9 ztS;5U89xvHK$o_0ER2z?U%IbmL5l5%h9L(CIEoqfsHh6bREfeNzbF(rJ(5~_Pxx(#Sv*rH=o(hiF+f(lgWYSS>{SY=JSez;z3LBS2 zTl}qn!Z=|>pww7mFlWMxC*S+x61PLqi!7pV2D}u=%GDFxKU*eVxDjJva62?2FK})K zDwk&RZv4i<`3m|Tiw3x@w5|)4r6foAr6xo3fJzXOXKZ>x;|<&2U3oA6Md9XY+!VDs z5siIV5|tF&v$&R9ejQPH5F$@@5H+f^>9oNjSg%htL&}LSni`x27X1io7=27AT|-2$s>U3 zUiJVdhH}<>@HeA(b|+xoI7v+3^e%_3Aeg)1aN=*F8w8V17A<)Zr1gITL(#2+X*o>M&G|B- zuI*5XHv4|tWFDcnrmi~{(pIgERtfJHe?o2#?(!cM2~dokK6l4bg9GOIz8Nsf=R6>n zt=hm%w}jDBW8qm2F|ZyQ_#hYbyYLoe1HZac~;jg*hCD#v?Xsv#KOKq5z!;JB~@WAp;NbOF4P*HZI3;pwrU9TKdR=wh(Fz1t?^2>Hi$uj zA2;pq+erw+1|hC};#||dr^P*fpVZoL4=ts68tfo#gq2Ei(>tEl)%!R#7@xu?#?DH~ z1*TeZcgU8Ufy0)`EhosWKNomlPi%dEoKq=Pr*wFQz70Lbh>(VCu;?*Q%IGqPzqOlF`o1c&~!`$AAbuTbwLQIO)(YqBj zYCehe<=mcaiD`A8i!MldmZfxDrYg*hnb|d3zN^?SQeLDEzTnd}wC$c%?pcu~86`SM zi=^m^NRnV;A~{S)*`pjS2eM=WrE>@M%mQ@RIz}Q?dR+F^rg2%HbyV@)5(_xy+zKxg^-&0+ba4Rix;rUBl==v;E7yhgWX@KOc)4~>5(HROtN=^U=wM%DTX{Y03?x7w8!Kz(To8v{HpM`qNyJ; z!k}?gH@jsq`s}{6p>n + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBestSelect< EOT > Member List

This is the complete list of members for eoBestSelect< EOT >, including all inherited members.

+ + + + + +
functor_category()eoUF< const eoPop< EOT > &, const EOT & > [inline, static]
operator()(const eoPop< EOT > &_pop)eoBestSelect< EOT > [inline, virtual]
setup(const eoPop< EOT > &_pop)eoSelectOne< EOT > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, const EOT & > [inline, virtual]

Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_best_select.html b/trunk/paradiseo-eo/doc/html/classeo_best_select.html new file mode 100644 index 000000000..6cae325ee --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_best_select.html @@ -0,0 +1,43 @@ + + +EO: eoBestSelect< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBestSelect< EOT > Class Template Reference

eoBestSelect: a selection method that always return the best (mainly for testing purposes) +More... +

+#include <eoRandomSelect.h> +

+

Inheritance diagram for eoBestSelect< EOT >: +

+ +eoSelectOne< EOT > +eoUF< const eoPop< EOT > &, const EOT & > +eoFunctorBase + +List of all members. + + + + + +

Public Member Functions

+virtual const EOT & operator() (const eoPop< EOT > &_pop)
 not a big deal!!!
+

Detailed Description

+

template<class EOT>
+ class eoBestSelect< EOT >

+ +eoBestSelect: a selection method that always return the best (mainly for testing purposes) +

+ +

+Definition at line 60 of file eoRandomSelect.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_best_select.png b/trunk/paradiseo-eo/doc/html/classeo_best_select.png new file mode 100644 index 0000000000000000000000000000000000000000..d60f6fe141a1b71daa088325844d49a5d96a545e GIT binary patch literal 1893 zcmah~Ygp1*9%i$ZXKc)wZEYPD&2~-GT}_Mfo?Xz?vIYtW3rt0uD61imi?UhIq-kg? zYfN65$+0PgzgplW2(r{t6l=i0t^)xkjZ4s zM$@2q`=<-YXcQz=)13%`ST05E-F28&G+xwBz2)~w*!Y32^$vW5beCdHy9X03UOto; zndwYEE#FbrnDWE<`1Axl(rYmOcCrckW|N<1@3Lt7kLx6h{gyDvZXV|2xvX@&kK;SI zA9y&W@CD=PaH9x=IkS|k{RmUo(LV1#l;Q9yQ0>mI$lc72wzOjfa>MRk36yK+l2N$A zchyVXa{)g3!LPpq_1_#H?K{vCv-3cRseD)JXvo@yde9~MayI_))DM1Nd}d$fzZa;n z&GmmuayuBhinyhd5|KU|Pa3*1?vfcYNqSDTw|_tLi$(`QTurBy3U=Lg|ZP<}1I3M)?-aQpB2x zCXzpbB?rtiC0tumfnS z08y{kUInQ=B(ZfVL8`%%D;KSSY})vd#GSJR0~8IM>J7}alB5OD`#nC>xFOK7;lzaQ zwP6%3xzY7p`w!`2z5y3-!+_&M17J7_l@pGwgwCk_H%Zaj^e)%5JyAHDGQ((rrc)O> z`DG@(ojWbMKTi+ld24E%_R%-w@U-cy2B%IPX`~>>J$o&zHp+@(ysKBS*Q}bItQGZJ zh@ZyEUC-{!q5}`bJ?i#2`SFbX)f2jl=h6r-*I*YGQQ!P(hfdEc6V&+@&^vyNoV=QF z{qxVeZ}N+8T2T|1jFalEG-%*G;a1cm`Dy7xsiLIO;g{1ZiKL;(4J(zTr1DF}>X$d~ z#3qTTi5~xl4iv-hKT$VyG)Kp(FX4SUJuMkcp@7}6t%W3R#iYL{`>&-PSFaU4#Gi$} zFQjRXwEm?|SA#pk{~qy%k1h4wN4(s?i@@@2UD(quWve1tmA6$kEDq?FzqK*p-q8sX zGJZn@qoP@Ic0=bZ+3Xn6ct1mRmE4H`(`^?8rkgQwJVNIk%!YH7gt9*Adj+isH z-M|8HdPHgb$>wG(g@k5?r<8$Ha#A$JEG>o;_3WQwO;A;yHH(AcM#@G|7>*FEcEsel z=!H38Z(1d|BZn|Uf&u-j4#tPdRlaOSj-_XGr(*2t5cEzstgfz}}`f1w{OW z^<#!+LxH#Pk;=BUb)$mQ@Ex%jG0W|l_&*92cn$?hND5^Bsb@`*V4#2@MO zhvI#RWC3=6mO^vQd9)&R$ZSDd(nu*R;|0>$mw#QziK4^WGKP(aU3@y?n&j9MZRN4B zhm!?Z_gfJvco;x&bz}7L?&fo{g(s)E=(f{eA?*|2QqFqS-2l5(_!ftMy;FL5B#hfK zKLzfjqI=3;B#b1!Rn=F|b#1d5TW4nZHx!YozDunR140i;6D_SzTNZQzW!s!}KBx^) zF)r#UoD0U>3e~CL4T$PvzA;@E_pFXG>oY+U?7b0JI)R;K{Pc>*qVJs{Qf|8WVpSdM zEE!+P0uGw3y&8!5u)#mnqhIoRr9Z + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBinCloneOp< EOT > Member List

This is the complete list of members for eoBinCloneOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const (defined in eoBinCloneOp< EOT >)eoBinCloneOp< EOT > [inline, virtual]
eoBinCloneOp()eoBinCloneOp< EOT > [inline]
eoBinOp()eoBinOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
functor_category()eoBF< EOT &, const EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
operator()(EOT &, const EOT &)eoBinCloneOp< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoBF()eoBF< EOT &, const EOT &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]

Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_bin_clone_op.html b/trunk/paradiseo-eo/doc/html/classeo_bin_clone_op.html new file mode 100644 index 000000000..fd768eb02 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_bin_clone_op.html @@ -0,0 +1,51 @@ + + +EO: eoBinCloneOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBinCloneOp< EOT > Class Template Reference

Binary clone: two operands, only the first could be modified. +More... +

+#include <eoCloneOps.h> +

+

Inheritance diagram for eoBinCloneOp< EOT >: +

+ +eoBinOp< EOT > +eoOp< EOT > +eoBF< EOT &, const EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoBinCloneOp ()
 Ctor.
+virtual std::string className () const
+virtual bool operator() (EOT &, const EOT &)
 The pure virtual function that needs to be implemented by the subclass.
+

Detailed Description

+

template<class EOT>
+ class eoBinCloneOp< EOT >

+ +Binary clone: two operands, only the first could be modified. +

+ +

+Definition at line 57 of file eoCloneOps.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_bin_clone_op.png b/trunk/paradiseo-eo/doc/html/classeo_bin_clone_op.png new file mode 100644 index 0000000000000000000000000000000000000000..80a5b788cd43736770626e414e9b80527209668d GIT binary patch literal 1931 zcmb7Fe>~Ic9-kkFP|8I(RDNu0&V)n53L(Gd$69t$4z3at7B%j=N^(No&L!*z#txRG zjv-t#jVzVS{B`di&+~kq_v`b#p3jf>^L}n%&;i?Y zzt#nTK-*A(zF{DcdY{VXYHFzF1=L^EREsGleN zwN*;2uI>5Fteq26tW|4jKeP5WHFf85D!pqa!{J>cDn>KJg* zY0G!_c$s^RwKcAdGNwwF+vE!imI~_QJ%)l%U>e4YQKrY9BUQzk!ep5+GY~|hIu0}f zX%9jGQ_w~apO)R)Y>U>Ql8<<~o3W#-;E}ypj(+jHDePkB(42v2a_lAR93Dwp;ebW7Y2IJ{_ua`5Uq-aB}Nc(iBBdgnwDgJb9RPx66 zk6knH&Tk`fvN*honV6uKo2g>feZ`A2LBCY=bb(Kbm#*?qjT^}9T){>l*J?6Z z+p(@`7gq=4l)e0rsEJ%#78%e%kSf7Ou^_x}Fjzt|=jSrZ=!5O1XUu!M z$j3>i3rlI@51Hr5uY?~m6Y*mv4iBOO!z0$p)De*DL~lk0rmiH%{?MgY?|h`g4Sf}M zbcaeu$>h40zaG#Wm5WY)xIN73q%G;}g5^PW^ZpX8t~^&#bo65XeDWPF3M!ict)p2; zSpc|Hz0p>vpGsoBdEG*2ek_Fp%{lauqwX>0VhCyC4h0Bh?{)_AvKMfK<9*`B&mX3G zo`o!h0Z&(+#uf!G{Wxol`#}<-eCu(RO`U74~%g`FSREZ|h&7M)5*~P+%`{ z&nS=1%~;52)uRq*%+04k@FHQN>rh?>;V#g>wnFyc1j_tMXCU2|dF={mqh19`kExHF z9Z@Mj7)4~?rkMp8s8ph8mCrwdNB9GvB|L)YNy*Q4$ox0c ze!~=)8MlidXMJ_~tj$$}wfuG8FMRx+*RRs^D<~BVE4aj-Dv>?Ut-%DmbJ2wZ6^KZNnCk*0*0=Z8roHUliCD2eO_2z}$Yl8KC=<(x zXZ(-q<)~l2cY-0w_+)}1m`4n44Nr;OhixI#Sr>!B?Tq*dW)!|P1V9tUj3M%ntPxo; zsU4N#3=oOMW8ygCqjHOJ1ZN9EI6$rwK4nrT!eKImoU_WW7LQ@1k*esFKWzE0EQS>p zUOn?co|;+guT=1BSCkq?Dx0ir^OUPZ-&M5lHw`Krw6jy07c*VVAiY0OD$*ny?|?x zlb6%WJftPN-tHv6FBRuv6fsP58b73-K&ij#M;_=;$uzAhEaJN=<<)V#pNpsPZ#?O7 z@g|a6-Dzngs;uVWPEsm-@n{PbpDeYZehvgz2LgReD zjuQ#8e~=b$Hi0=cw`rfL!8mA>(6%1fE>C;bpZ8OA90Ey;z7I`RQMOz%5A@4i(oQ)a zsl=I_s(dcYo8cC3tYRoz-Had_`hEcD_Zj9_7whQGp42P|!N9b!@-&dn8?aKFTwy#E Ure{8=`Z+-;KeTV7&&jL*1in+5%>V!Z literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_bin_gen_op-members.html b/trunk/paradiseo-eo/doc/html/classeo_bin_gen_op-members.html new file mode 100644 index 000000000..7da7d7fff --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_bin_gen_op-members.html @@ -0,0 +1,32 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBinGenOp< EOT > Member List

This is the complete list of members for eoBinGenOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + +
apply(eoPopulator< EOT > &_pop)eoBinGenOp< EOT > [inline, virtual]
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const (defined in eoBinGenOp< EOT >)eoBinGenOp< EOT > [inline, virtual]
eoBinGenOp(eoBinOp< EOT > &_op) (defined in eoBinGenOp< EOT >)eoBinGenOp< EOT > [inline]
eoGenOp()eoGenOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
functor_category()eoUF< eoPopulator< EOT > &, void > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
max_production(void)eoBinGenOp< EOT > [inline, virtual]
op (defined in eoBinGenOp< EOT >)eoBinGenOp< EOT > [private]
operator()(eoPopulator< EOT > &_pop)eoGenOp< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]
~eoUF()eoUF< eoPopulator< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_bin_gen_op.html b/trunk/paradiseo-eo/doc/html/classeo_bin_gen_op.html new file mode 100644 index 000000000..fd43752c4 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_bin_gen_op.html @@ -0,0 +1,58 @@ + + +EO: eoBinGenOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBinGenOp< EOT > Class Template Reference

Wrapper for binop: here we use select method of eoPopulator but we could also have an embedded selector to select the second parent. +More... +

+#include <eoGenOp.h> +

+

Inheritance diagram for eoBinGenOp< EOT >: +

+ +eoGenOp< EOT > +eoOp< EOT > +eoUF< eoPopulator< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + +

Public Member Functions

+ eoBinGenOp (eoBinOp< EOT > &_op)
+unsigned max_production (void)
 Max production is used to reserve space for all elements that are used by the operator, not setting it properly can result in a crash.
+void apply (eoPopulator< EOT > &_pop)
 do the work: get 2 individuals from the population, modifies only one (it's a eoBinOp)
+virtual std::string className () const

Private Attributes

+eoBinOp< EOT > & op
+

Detailed Description

+

template<class EOT>
+ class eoBinGenOp< EOT >

+ +Wrapper for binop: here we use select method of eoPopulator but we could also have an embedded selector to select the second parent. +

+ +

+Definition at line 107 of file eoGenOp.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_bin_gen_op.png b/trunk/paradiseo-eo/doc/html/classeo_bin_gen_op.png new file mode 100644 index 0000000000000000000000000000000000000000..989e54e6510fae697b9602f6ecae650884b319f4 GIT binary patch literal 1941 zcmZ`)c~p~05(g1vz;L+YXt+ca5Hz5}@dAQ?F@O-z49XxwKukm=+$1p^qP}qexgm-O zft5op1H(5EhAS|l5KzJ>a(v;IBSOB&#zD?tHZseuZ+!blcURS`uIjG(^{*4px;nrV z;0jVwQZOe+6jn-V+n_{l+b$!StsyL4vg|$U;(l5z7E462xUHbTH(eraj<&Y8=%?ao zi7Fk5b^Tt-c6R8Bl++F*CzPH0^*ljdPbSw=1&t}WHV_=tY)-x9waikf1f!qxJJ)_a z1e*9hD`ibvl}i_~(KdYn7Ki)1J(7IHzfxCSP?iy@EMmV3wNiE+8Q5cc4t{0pbI)OVp+z+)~WFbS_!1m z->wNd<9(L#$^?8i@Lc)lKM;7M1jy7se!sReSj{7X_ga#xfTX-w@9-ts3tR*lo8lCY0+@@%*0djp{7x-P$W-I_tBDxEzSrubBvWi3q^3 zJ!os7F2C7pGeSL!s?*6RpNv(sa;JGGRu3o+O}>tjUbqe1it)Kv?b|*`;j1+(c6SIr zG8SI4)Z}c{4Aj3dPXBL+O}LyjSLv49jLQ~Ly*0B3u!}{)adzhyss85oSAH4{^#~fU zVDLnjvx|kyHA~U(n&Q5FI5Ph{Ui6r#v9;+C(D{U({+pbRpZXn*1vbTl$zR4UnHa8# zb7pjMd`GZ{MoC9fvG407fa$vUAt!>^v21^mRX|vP?Wr`t8$0)0XhNo600Vbue238S z6ZHo6D2K3dVJzY>hXfirw`G72|v7un^R&5gU z8CmQ74^tqoW3MkRanpM9FUV(N;7GsqpP?DpXzrPYyDm&en&vD$$@F;R`Hmx(UG$=x z<_CaY9-WOKc%(oP_tC{aoHmReK`kM(t*bo3>xo4tfQ^QR86MKA9DNfREtocJfDZZV z_a~$!A9Lb1Mv%*7eiSxd(5>Oz@G*N^u@WA-Gq=j2rW);X752_^9(n>-9arjuRaBv| z%$a#-4e@sBgoS8`dpP=qG?*r^2fc6sx^ds028`Op3EQ?>xEcyFLUyxP|K+vMFf5?u z=23-^*X7SjK5k>iJRzox4%sXvHAvbyx!lyc+niA;L(pxg#kJi}Yq7Moqwji_x4G9hX&-XvZ4f*Cfnrz+;rT8rY~q6+XD|HdWVJd_%P)SUf2Ul#xFB8C)6&#&rt zcNma|--z4w-c9F*8+}N~Nh6i+x4gH3GJFKtrVGNE^@vF% zn>pVyiacMMvGH3_w^G8v41xKqe<>+Lb61yM$_ZjFAk)$dZ-AH6Km3mA$(qJcc5oFR(plu}Mv1OyH o+u*f|BL3o6O7p!*hfh+CBHQ|Fb + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBinOp< EOType > Member List

This is the complete list of members for eoBinOp< EOType >, including all inherited members.

+ + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< EOType >)eoOp< EOType >
className() const (defined in eoBinOp< EOType >)eoBinOp< EOType > [inline, virtual]
eoBinOp()eoBinOp< EOType > [inline]
eoOp(OpType _type)eoOp< EOType > [inline]
eoOp(const eoOp &_eop)eoOp< EOType > [inline]
functor_category()eoBF< EOType &, const EOType &, bool > [inline, static]
general enum value (defined in eoOp< EOType >)eoOp< EOType >
getType() const eoOp< EOType > [inline]
operator()(EOType &, const EOType &)=0eoBF< EOType &, const EOType &, bool > [pure virtual]
OpType enum name (defined in eoOp< EOType >)eoOp< EOType >
quadratic enum value (defined in eoOp< EOType >)eoOp< EOType >
unary enum value (defined in eoOp< EOType >)eoOp< EOType >
~eoBF()eoBF< EOType &, const EOType &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOType > [inline, virtual]

Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_bin_op.html b/trunk/paradiseo-eo/doc/html/classeo_bin_op.html new file mode 100644 index 000000000..b82afacea --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_bin_op.html @@ -0,0 +1,46 @@ + + +EO: eoBinOp< EOType > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBinOp< EOType > Class Template Reference

Binary genetic operator: subclasses eoOp, and defines basically the operator() with two operands, only the first one can be modified When defining your own, make sure that you return a boolean value indicating that you have changed the content. +More... +

+#include <eoOp.h> +

+

Inheritance diagram for eoBinOp< EOType >: +

+ +eoOp< EOType > +eoBF< EOType &, const EOType &, bool > +eoFunctorBase + +List of all members. + + + + + + + +

Public Member Functions

+ eoBinOp ()
 Ctor.
+virtual std::string className () const
+

Detailed Description

+

template<class EOType>
+ class eoBinOp< EOType >

+ +Binary genetic operator: subclasses eoOp, and defines basically the operator() with two operands, only the first one can be modified When defining your own, make sure that you return a boolean value indicating that you have changed the content. +

+ +

+Definition at line 117 of file eoOp.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_bin_op.png b/trunk/paradiseo-eo/doc/html/classeo_bin_op.png new file mode 100644 index 0000000000000000000000000000000000000000..104541ed2edb8c89933c89f788c53484fa8b810b GIT binary patch literal 1728 zcmaKtdr(tX9>=3psDy_~6_O%|Qfz@$Zm!_6;UxtTjXWA&5f*`j8&67-6&6ep$fFu$Ya|7MY*t5SXLe@)IOlxNZ@$0Z%x`|5 zIp_PJ06$|xydegIG4?;;^9=^02k7+0PxN&A7uPb2b%#X|Da2Q+)#{{H%P%X7xuR3= z7N5^&c4}vI*EOfU2_R#hzZzd}|dKk6>MDg0=i^)RZyX z7Phn^`;)koGZN=Yy|F@n{o|-BfYPeI6Wj_atO@W6L02O>{zU^C~)0RW^ z(1cq>^vGqef8qGoStt6Zo(bKdCXh)S zo<+aSlkjUW!*QcfIy?53d2|WVfVje4MUGLN_PtyuJ>OBg+|SS#jvZ&`6G5hn83iz| z5w4o2pE0;MsNS-1GeNVip4yAT_L3#SiZLg#N98bD4A3BG@^`DE+2=_{@5bs41=)br zS8yRI0QoKXkRQvDlN0q-F%kViR+YY%;+D8GXbmC1{{@AZZ#r(5-Eka3FTd~^9E!Olg52p~yI82JO<-_YTP)Yf?+NJiL5LQB$9pesj}zEu2(jm)pw8ECA&&R+iK%5ha| z9UD(j^XOe!=*w;Wg8<1xep4qw7~ z+Ufrie}+Zx9EV@yUy~x}{v{R}-xZYXd2Vk28UV>cFohde_lb;$bgGD`on0gICW3(d&+bONE0g;p)1ef3jX#9Iou5u7r)rU;X}%TgoQ<_EOyL z9F0Q7SGGK6DpcY0O9>^6UB zj + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBinaryFunctorCounter< BinaryFunctor > Member List

This is the complete list of members for eoBinaryFunctorCounter< BinaryFunctor >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
eoBinaryFunctorCounter(BinaryFunctor &_func, std::string _name="proc_counter") (defined in eoBinaryFunctorCounter< BinaryFunctor >)eoBinaryFunctorCounter< BinaryFunctor > [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoValueParam(void)eoValueParam< unsigned long > [inline]
eoValueParam(unsigned long_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< unsigned long > [inline]
func (defined in eoBinaryFunctorCounter< BinaryFunctor >)eoBinaryFunctorCounter< BinaryFunctor > [private]
getValue(void) const eoValueParam< unsigned long > [inline, virtual]
longName() const eoParam [inline]
operator()(typename BinaryFunctor::first_argument_type _arg1, typename BinaryFunctor::second_argument_type _arg2)eoBinaryFunctorCounter< BinaryFunctor > [inline]
repValue (defined in eoValueParam< unsigned long >)eoValueParam< unsigned long > [protected]
required() const eoParam [inline]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< unsigned long > [inline, virtual]
shortName() const eoParam [inline]
value()eoValueParam< unsigned long > [inline]
value() const eoValueParam< unsigned long > [inline]
~eoParam()eoParam [inline, virtual]

Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_binary_functor_counter.html b/trunk/paradiseo-eo/doc/html/classeo_binary_functor_counter.html new file mode 100644 index 000000000..a31810e8b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_binary_functor_counter.html @@ -0,0 +1,102 @@ + + +EO: eoBinaryFunctorCounter< BinaryFunctor > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBinaryFunctorCounter< BinaryFunctor > Class Template Reference

Generic counter class that counts the number of times a binary function is used. +More... +

+#include <eoCounter.h> +

+

Inheritance diagram for eoBinaryFunctorCounter< BinaryFunctor >: +

+ +eoValueParam< unsigned long > +eoParam + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoBinaryFunctorCounter (BinaryFunctor &_func, std::string _name="proc_counter")
BinaryFunctor::result_type operator() (typename BinaryFunctor::first_argument_type _arg1, typename BinaryFunctor::second_argument_type _arg2)
 Calls the embedded function and increments the counter.

Private Attributes

+BinaryFunctor & func
+

Detailed Description

+

template<class BinaryFunctor>
+ class eoBinaryFunctorCounter< BinaryFunctor >

+ +Generic counter class that counts the number of times a binary function is used. +

+Add a binary function through its ctor and use this class instead of it.

+It is derived from eoValueParam so you can add it to a monitor. +

+ +

+Definition at line 142 of file eoCounter.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class BinaryFunctor>
BinaryFunctor::result_type eoBinaryFunctorCounter< BinaryFunctor >::operator() ( typename BinaryFunctor::first_argument_type  _arg1,
typename BinaryFunctor::second_argument_type  _arg2
)  [inline]
+
+ + + + + +
+   + + +

+Calls the embedded function and increments the counter. +

+Note for MSVC users, if this code does not compile, you are quite likely trying to count a function that has a non-void return type. Don't look at us, look at the MSVC builders. Code like "return void;" is perfectly legal according to the ANSI standard, but the guys at Microsoft didn't get to implementing it yet.

+We had two choices: assuming (and compiling ) code that returns void or code that returns non-void. Given that in EO most functors return void, it was chosen to support void.

+But also please let me know if you have a compiler that defines _MSC_VER (lot's of windows compilers do), but is quite capable of compiling return void; type of code. We'll try to change the signature then.

+You happy GNU (and other compiler) users will not have a problem with this. +

+Definition at line 166 of file eoCounter.h. +

+References eoValueParam< unsigned long >::value().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_binary_functor_counter.png b/trunk/paradiseo-eo/doc/html/classeo_binary_functor_counter.png new file mode 100644 index 0000000000000000000000000000000000000000..b4eb1de0ab6a2882a8789c81eb6494249b1fdad9 GIT binary patch literal 839 zcmeAS@N?(olHy`uVBq!ia0y~yU}OZcJ6M>3q$rnj7Lbw%@CkAK|NlRb`Tzfc`STMd z09jys;J|_EL;s%uxr`-2e!&b5&u*kKFfiTqba4!+nDcgKY|&x^o`$#6Yq!-f|7Mwc zm;0;ccl$$8_5VB-96SoGr_M}tn6{Mv50`e#QF>4-@bYH2LYzlHOfipv;uPK;GZyR! zYg%#qDode}<671|OJq4;Mm3f5DH|{;|FC2Ey#LzyzVnyG>TC|qpDlPNZ~p#y3IF^| zm_X9V=!a9&&;1E!{)-;x=y{;&c;=4HWxgn;8wS(l-j$We^a(ske!EAQ<&xt;JHFB& zq3xob3{N|kY+da1S1zV0+;xspbOO^W7q>YU4h#IAPM9WCm10@`>x3EyqsM$rHJgap z&sPY03eUXCFZ5&{!E?JeYw^|2a^WRg#lOEg z^8MfG6qfy63IDGD`tv^m7(jpW?$Suhk;=< z?*Oxfz2Ee`x9`%f)<_-90=kYs4xHAFPyF7%$_(c(rlKF1FS+@ik#hvTicEJCzrR zgmKC#_@64PFydkH*) znsk+ud4AP?*b%W=vcypPmzDCbyLLAcQ*N+FahtXZ2)J{dX5Yqk?z7pm?~LmnO0Hwo z-FDZlEh|Ru`_$i;ZkT-Pd7%6LwXd>2$2!h~mnCA1dk%2SNceUASN(x&eW6`ESJ{B6 Op25@A&t;ucLK6TCHEC`D literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_bit-members.html b/trunk/paradiseo-eo/doc/html/classeo_bit-members.html new file mode 100644 index 000000000..047e13c96 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_bit-members.html @@ -0,0 +1,51 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBit< FitT > Member List

This is the complete list of members for eoBit< FitT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
AtomType typedef (defined in eoVector< FitT, bool >)eoVector< FitT, bool >
className() const eoBit< FitT > [inline, virtual]
ContainerType typedef (defined in eoVector< FitT, bool >)eoVector< FitT, bool >
EO()EO< FitT > [inline]
EO() (defined in EO< FitT >)EO< FitT > [inline]
eoBit(unsigned size=0, bool value=false)eoBit< FitT > [inline]
eoVector(unsigned size=0, boolvalue=bool())eoVector< FitT, bool > [inline]
eoVector(const eoVector< OtherFitnessType, bool > &_vec)eoVector< FitT, bool > [inline]
Fitness typedef (defined in EO< FitT >)EO< FitT >
fitness() const EO< FitT > [inline]
fitness(const Fitness &_fitness)EO< FitT > [inline]
fitness(performance_type perf) (defined in EO< FitT >)EO< FitT > [inline]
fitness(void) const (defined in EO< FitT >)EO< FitT > [inline]
fitness_traits typedef (defined in EO< FitT >)EO< FitT >
invalid() const EO< FitT > [inline]
invalidate() (defined in EO< FitT >)EO< FitT > [inline]
invalidate(void) (defined in EO< FitT >)EO< FitT > [inline]
invalidate_worth(void) (defined in EO< FitT >)EO< FitT > [inline]
operator<(const eoVector< FitT, bool > &_eo) const eoVector< FitT, bool > [inline]
EO< FitT >::operator<(const EO &_eo2) const EO< FitT > [inline]
operator<(const EO< Fitness, Traits > &other) const (defined in EO< FitT >)EO< FitT > [inline]
operator>(const EO &_eo2) const (defined in EO< FitT >)EO< FitT > [inline]
operator>(const EO< Fitness, Traits > &other) const (defined in EO< FitT >)EO< FitT > [inline]
performance(performance_type perf) (defined in EO< FitT >)EO< FitT > [inline]
performance(void) const (defined in EO< FitT >)EO< FitT > [inline]
performance_type typedef (defined in EO< FitT >)EO< FitT >
printOn(std::ostream &os) const eoBit< FitT > [inline, virtual]
readFrom(std::istream &is)eoBit< FitT > [inline, virtual]
storage_type typedef (defined in EO< FitT >)EO< FitT >
value(const std::vector< bool > &_v) (defined in eoVector< FitT, bool >)eoVector< FitT, bool > [inline]
worth(worth_type worth) (defined in EO< FitT >)EO< FitT > [inline]
worth(void) const (defined in EO< FitT >)EO< FitT > [inline]
worth_type typedef (defined in EO< FitT >)EO< FitT >
~EO()EO< FitT > [inline, virtual]
~eoObject()eoObject [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]

Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_bit.html b/trunk/paradiseo-eo/doc/html/classeo_bit.html new file mode 100644 index 000000000..b9e218bd6 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_bit.html @@ -0,0 +1,201 @@ + + +EO: eoBit< FitT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBit< FitT > Class Template Reference
+ +[Bitstring, Bitstring] +

Implementation of bitstring chromosome. +More... +

+#include <ga/eoBit.h> +

+

Inheritance diagram for eoBit< FitT >: +

+ +eoVector< FitT, bool > +EO< FitT > +eoObject +eoPersistent +eoPrintable + +List of all members. + + + + + + + + + + + + + + +

Public Member Functions

 eoBit (unsigned size=0, bool value=false)
 (Default) Constructor.
+virtual std::string className () const
 My class name.
virtual void printOn (std::ostream &os) const
 To print me on a stream.
virtual void readFrom (std::istream &is)
 To read me from a stream.
+

Detailed Description

+

template<class FitT>
+ class eoBit< FitT >

+ +Implementation of bitstring chromosome. +

+Based on STL's vector<bool> specialization. +

+ +

+Definition at line 56 of file eoBit.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class FitT>
eoBit< FitT >::eoBit ( unsigned  size = 0,
bool  value = false
)  [inline]
+
+ + + + + +
+   + + +

+(Default) Constructor. +

+

Parameters:
+ + +
size Size of the binary std::string.
+
+ +

+Definition at line 69 of file eoBit.h.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class FitT>
virtual void eoBit< FitT >::printOn ( std::ostream &  os  )  const [inline, virtual]
+
+ + + + + +
+   + + +

+To print me on a stream. +

+

Parameters:
+ + +
os The std::ostream.
+
+ +

+Reimplemented from eoVector< FitT, bool >. +

+Definition at line 82 of file eoBit.h. +

+References EO< F >::printOn().

+

+ + + + +
+ + + + + + + + + + + + +
+template<class FitT>
virtual void eoBit< FitT >::readFrom ( std::istream &  is  )  [inline, virtual]
+
+ + + + + +
+   + + +

+To read me from a stream. +

+

Parameters:
+ + +
is The std::istream.
+
+ +

+Reimplemented from eoVector< FitT, bool >. +

+Definition at line 94 of file eoBit.h. +

+References EO< F >::readFrom().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_bit.png b/trunk/paradiseo-eo/doc/html/classeo_bit.png new file mode 100644 index 0000000000000000000000000000000000000000..67d7e710591933b13a295bf99d0096433eee51ed GIT binary patch literal 1532 zcmZ`(X;6~~5Di5{aWEtGpj5=MB1eQ!z;G#1PLcbJ+^8UO2qjt}kid)-Qtm5(0%<5$ z5rU{3LWG1vD+GkdeHe&=d<2NVkZ^qvNu$#l+nM@f-+Q~i_U-I$ij#x2yquC81Okz_ zxoY78fk>exp|ej~Qn_Bl^OcaIlbxHTSS*%EvACn8Bp_R&K1WAKM_iYfD@mp9yEwQ) zF3(TghCpO;Z7i<1#gLY#`_aWZM`hkWT{OPwJXRL@mhOa_Y!L8K?We;z5W4At1Jg!L zzFyk@sApkkbVU}lQ-Cieowv!?F$Zkw~`#SMM%GGD3+Z%u9C<>iC^&05i1^;0LP_IJmAO9pVq zPYB{ygkDoQ$W3Zylqpjyjg_H535YN{)vHlOLiaw&=hMQT{eZ07Ps;QI$JrE_;Bt?> zIX*wMi?Kk2#V5IBLV<0kufc&{)zvXuGJp3f-TWc0ISJjXp@O5iAhnO_JHj>)%qGpa zdH|zYX{3w(KJ{U0a-IMmi7mlu$jDttMqHTiVoc~!;e~q6EA8t+38fRbMahVP^x-*|Iv3pp$v8znWqgCzl=&V#tMUmM#T+gX0MNzC#}MP6i16;*YB*T>Q& zlf7pPgm+TzrNR9O`N;KYq5igkzU33_tr)iNV@r@uadrUrD9&_vZnV-_rm6yC*JUEk zCl<&h#!l2Ao6wAFm%>L&{HU`ibzq3s<(GjLjjDJ1f1(Znyz?@!+qL!ATIorZ-hV-e zn>NOg-4j^lBft?j=WP^G+LVG*&`P$#6reyXl6tN6$Ui zg!fv%EM0{5$!^_9eiz6J-daRdbjxo29G+0l+5~mBFt}IY3^n{AaZ*WFwaC?OkX%&3 zy%CW0?0i@{ENMVs{E>Q5ciP(RFbtITEn~VKnXF;**K4q7(_3;F-5JK};+b;Qp>e@S z+zKF-x-3-3g^=PxjRs`j7{cd;>PXY(n9w5gSypZ_+o1WRBP_xE^Ad^usWYv|P0F@E z&R8)wa3f>;mx%nw@*^;mNUqXn$7h1#oY}4fY=0(-lIrk+$*75$ktt!${0mTjI?Gn+ zuv(4qAh_-&FqX%1(-F1bj2E{c?^EYTM2#LmH6tH?w`Z;__{Jp$#^!ZP{j6OR#=Y@6 z-Q&YjY~@8QwF2aPe;%&7fFUSjj>D!3^SN_v>tvfbtg6a**jnKsAZqfJjq`-}k$H~7 zOxhp`(Ivlgnu&{lue*-OIHi`fM literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_bit_bit_flip.html b/trunk/paradiseo-eo/doc/html/classeo_bit_bit_flip.html new file mode 100644 index 000000000..5f8d08d36 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_bit_bit_flip.html @@ -0,0 +1,29 @@ + + +EO: eoBitBitFlip Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBitBitFlip Class Reference
+ +[Bitstring] +

eoBitFlip --> changes 1 bit +More... +

+#include <ga/eoBitOp.h> +

+ + +
+

Detailed Description

+eoBitFlip --> changes 1 bit +

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_bit_gx_over-members.html b/trunk/paradiseo-eo/doc/html/classeo_bit_gx_over-members.html new file mode 100644 index 000000000..5a18bbadb --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_bit_gx_over-members.html @@ -0,0 +1,31 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBitGxOver< Chrom > Member List

This is the complete list of members for eoBitGxOver< Chrom >, including all inherited members.

+ + + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< Chrom >)eoOp< Chrom >
className() const eoBitGxOver< Chrom > [inline, virtual]
eoBitGxOver(const unsigned _gene_size, const unsigned _num_points=2)eoBitGxOver< Chrom > [inline]
eoOp(OpType _type)eoOp< Chrom > [inline]
eoOp(const eoOp &_eop)eoOp< Chrom > [inline]
eoQuadOp()eoQuadOp< Chrom > [inline]
functor_category()eoBF< Chrom &, Chrom &, bool > [inline, static]
gene_size (defined in eoBitGxOver< Chrom >)eoBitGxOver< Chrom > [private]
general enum value (defined in eoOp< Chrom >)eoOp< Chrom >
getType() const eoOp< Chrom > [inline]
num_points (defined in eoBitGxOver< Chrom >)eoBitGxOver< Chrom > [private]
operator()(Chrom &chrom1, Chrom &chrom2)eoBitGxOver< Chrom > [inline, virtual]
quadratic enum value (defined in eoOp< Chrom >)eoOp< Chrom >
unary enum value (defined in eoOp< Chrom >)eoOp< Chrom >
~eoBF()eoBF< Chrom &, Chrom &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< Chrom > [inline, virtual]

Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_bit_gx_over.html b/trunk/paradiseo-eo/doc/html/classeo_bit_gx_over.html new file mode 100644 index 000000000..cd1378a2a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_bit_gx_over.html @@ -0,0 +1,115 @@ + + +EO: eoBitGxOver< Chrom > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBitGxOver< Chrom > Class Template Reference
+ +[Bitstring] +

eoBitGxOver --> Npts crossover when bistd::string considered as a std::string of binary-encoded genes (exchanges genes) Is anybody still using it apart from historians ??? :-) +More... +

+#include <ga/eoBitOp.h> +

+

Inheritance diagram for eoBitGxOver< Chrom >: +

+ +eoQuadOp< Chrom > +eoOp< Chrom > +eoBF< Chrom &, Chrom &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoBitGxOver (const unsigned _gene_size, const unsigned _num_points=2)
 Constructor.
+virtual std::string className () const
 The class name.
bool operator() (Chrom &chrom1, Chrom &chrom2)
 Gene crossover for binary chromosomes.

Private Attributes

+unsigned gene_size
+unsigned num_points
+

Detailed Description

+

template<class Chrom>
+ class eoBitGxOver< Chrom >

+ +eoBitGxOver --> Npts crossover when bistd::string considered as a std::string of binary-encoded genes (exchanges genes) Is anybody still using it apart from historians ??? :-) +

+ +

+Definition at line 388 of file eoBitOp.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class Chrom>
bool eoBitGxOver< Chrom >::operator() ( Chrom &  chrom1,
Chrom &  chrom2
)  [inline, virtual]
+
+ + + + + +
+   + + +

+Gene crossover for binary chromosomes. +

+

Parameters:
+ + + +
chrom1 The first chromosome.
chrom2 The first chromosome.
+
+ +

+Implements eoBF< Chrom &, Chrom &, bool >. +

+Definition at line 409 of file eoBitOp.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_bit_gx_over.png b/trunk/paradiseo-eo/doc/html/classeo_bit_gx_over.png new file mode 100644 index 0000000000000000000000000000000000000000..f39cc793bc8299491675f4218b149c9300c710b1 GIT binary patch literal 1836 zcmb7FeK^x=7@ia-#W<%4DJ5xr9P08BOFMK@QSI76CYzs#iWQozEuSeLM~E=H%10fJ zCBv_->};~J(o!K&YsDy*k48#6tZi)Pr>@S`ALpFw^v8R@_xrr}`~30T&-J{SSj;X% z0}BHf3})!HdxsAUHm?@qg88}-N-}miL7N$Nub-z@tA(gmE4Y05U>?LiErCD~e@FWo zI_i*pFupMN;pc~8FugloJ3RboC2vbR@~crxc2;8c=X%*@OA}M@iYDyNN9IaZ#*7Kp zebWm*^){!*XB9HIX!F5dzWOBV_GRsw_h42xa$)`c`hJaMjWG|s1_n9`HWQ596%$F+@akx`neTG^_^-WK5H#mrNE<-yo( zHRIFu4<}LCz7;&21EHQoOh-hqCxO0g%^eJ&@4ZD`S#|t$qLqquD~Zs{8qi$-<#GuZ z&v88F=EhuPdSuu+Pc37(K{em|jR^2fJHb7G2pMt=zT%FFwu4Zzor4#) zg9Y-GMgvv4(?G(?cF=q5gIq@(n>;>IU`c<5mMR6YZf9D}D-;>ij%TYkc_kl3#G>7W zJtMVgo!_b7G)3}Laa)QCDrHU;MoUZD_B9wo{ zOr7`ueHm5Srz#u8sv}3UyP||QzPBa?MkN=-m^*~+KStX zI%{j$m@AG@)6iF**6euEt;zNdZ+FIrm%-a_%?wGMQNA;$i0TD>3R271vfc|P_0n+` zT)zJTAmTL6;uT$wRymLgG&K7g?as2E*S37+p$6TjcS-v9AwLkx3v$J&Gv$S=s~jMd z=lQno!4{I{Q+8qt4WN7Tw&hoBi?+JoBk5OV4jJV^#zsPZhC#kw`nKzZ)CShVqTVzY z%>J-_#$UDTzf-%FquLK;1|Hg7D!(rS2x@W557kU3E3z<@AfApqOoz>}rBf)=mUE)L z2`Q_BZkUNZ`R9d!J}HPFSTUmY_ZEQEZC&_UZr5D+I=MtYa;fxIm6))2L#M78SZsMw ze=nCYEIudX+R2>C;EUfSuk9{{AEo+&bD5&n*(bR1?u?m0m7I~JLDkgxQrLvfA5CWf zy}8k-@ypYrtr-|O!ORaOoyJ+mNXq|~ef8p7>C&Tx^8=#{MG;(G+9xMJC$$@=xSTL^ zj>_m=84^Hv&YZ<`(fO+WtpIrLUl` P4d&&E*-^Ls;F-Sw@@I%g literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_bit_inversion-members.html b/trunk/paradiseo-eo/doc/html/classeo_bit_inversion-members.html new file mode 100644 index 000000000..b72783b59 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_bit_inversion-members.html @@ -0,0 +1,28 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBitInversion< Chrom > Member List

This is the complete list of members for eoBitInversion< Chrom >, including all inherited members.

+ + + + + + + + + + + + + + +
binary enum value (defined in eoOp< Chrom >)eoOp< Chrom >
className() const eoBitInversion< Chrom > [inline, virtual]
eoMonOp()eoMonOp< Chrom > [inline]
eoOp(OpType _type)eoOp< Chrom > [inline]
eoOp(const eoOp &_eop)eoOp< Chrom > [inline]
functor_category()eoUF< Chrom &, bool > [inline, static]
general enum value (defined in eoOp< Chrom >)eoOp< Chrom >
getType() const eoOp< Chrom > [inline]
operator()(Chrom &chrom)eoBitInversion< Chrom > [inline, virtual]
quadratic enum value (defined in eoOp< Chrom >)eoOp< Chrom >
unary enum value (defined in eoOp< Chrom >)eoOp< Chrom >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< Chrom > [inline, virtual]
~eoUF()eoUF< Chrom &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_bit_inversion.html b/trunk/paradiseo-eo/doc/html/classeo_bit_inversion.html new file mode 100644 index 000000000..980581042 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_bit_inversion.html @@ -0,0 +1,94 @@ + + +EO: eoBitInversion< Chrom > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBitInversion< Chrom > Class Template Reference
+ +[Bitstring] +

eoBitInversion: inverts the bits of the chromosome between an interval +More... +

+#include <ga/eoBitOp.h> +

+

Inheritance diagram for eoBitInversion< Chrom >: +

+ +eoMonOp< Chrom > +eoOp< Chrom > +eoUF< Chrom &, bool > +eoFunctorBase + +List of all members. + + + + + + + + +

Public Member Functions

+virtual std::string className () const
 The class name.
bool operator() (Chrom &chrom)
 Inverts a range of bits in a binary chromosome.
+

Detailed Description

+

template<class Chrom>
+ class eoBitInversion< Chrom >

+ +eoBitInversion: inverts the bits of the chromosome between an interval +

+ +

+Definition at line 146 of file eoBitOp.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class Chrom>
bool eoBitInversion< Chrom >::operator() ( Chrom &  chrom  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Inverts a range of bits in a binary chromosome. +

+

Parameters:
+ + +
chrom The chromosome whos bits are going to be inverted (a range).
+
+ +

+Implements eoUF< Chrom &, bool >. +

+Definition at line 156 of file eoBitOp.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_bit_inversion.png b/trunk/paradiseo-eo/doc/html/classeo_bit_inversion.png new file mode 100644 index 0000000000000000000000000000000000000000..58f9c17447a186d9348df5cdfa56c059c76c9f4c GIT binary patch literal 1570 zcmZ`(3pA8z7#N=h!>$XV_1f-O8Xx_1q3A6bdC&C~C8^cArzCFT1w3Hl|MTN_kZ| zOyBkk0zcTrMj+HG$VAuekr}TuA13EIXh23AMY23xQO=3otiiZDh0f-Rc}(h#J7TnD zaJD?mO+OefbKOd_EX@qrH9HlcNnj>(St)U2UYW5qImK@-A^F)Tem3mIDf*ZEQRi?*+3<>g_0m@QLKXm!k$h&na= zdrs3o9_@ROZP*#t+xS};J z0xV+S_IVQBU+A?8?e>aiK4=Q7E#{BDqJn62`o$i#EGH3?Sx z^Ke;%m-yfs>$`N{d#^aAIypo1;CyTBb<89e>>Je(WKbn8R8>g1#*AVOhC&C;85Bl@ z$Ii~Z807EIlD(&=Gm8q*RPN+-ru^wK)AQ9U`LNYaBp;!zf}Q6^-AU@`&&+>P76^9?_{hRQ!SOZ=#WGrI$a16&KrZ~?0erVmG^0&JhbIyn z{)+dC!ho+z4@Xgad)MV&9xYvO`~w3U!#{ZX>@M}@jh6&^GTffvC;eN%s_mo^#jm8>OJZn8$%>6PtYfHOIZAW1h)hnk z#fmn$^qA4O>{tdaJ%uV&NAD;nv!*)amSA3qj7FS0=n#@banc3ocSkXG^=@iz%?S~V zq6l4piM-;IP-cUDA?B$8uP3*xp=0^do?ju)t52`EwQqU{M_bvZ#Sn$Qik!89f!WCM~%sFYh+nNo*Q1`#!?kUr+43GG$WNY@bZzyVNj7)U2DL$e^%BboQuFW#YglZ+Y#Q+X+mv&-O<_aKB*H)#wc@kI%Ud!B)-iEYn#;xj%;8-=gna0^^Ld z0w(uV3WedM7IPLaK|fa871*IG1{UT-nV`S%y|8l7AQFcM`lUR9Sq|!DKTj}{4Wmx4 z|Hhr)KK_ec|A(l^hy9W#M%XTiR~pfHT!L#;mHC zFd9&qHC1k3pk~H*>Kq^l-Z(veJZ>)~Y{@!8378UEkR5YjEAWt3j-qZB1qHUsZrpPv zY0$d%^+EoedvD*2NI+J+m6-{csKXIoE87riU|rzpnL*>)TMYv}gf+{JFk8)$r-S?@ z5{W*fEh`nH_WORkwAMNi2xRHuI+lf}NYO$ci5*LojTQiqHo#6O%CxI`N@Ts=Suv4b nG7ve@q`4^3*RNa7hRrLAHl(DL66hYvfsPh literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_bit_mutation-members.html b/trunk/paradiseo-eo/doc/html/classeo_bit_mutation-members.html new file mode 100644 index 000000000..bef558a2a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_bit_mutation-members.html @@ -0,0 +1,31 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBitMutation< Chrom > Member List

This is the complete list of members for eoBitMutation< Chrom >, including all inherited members.

+ + + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< Chrom >)eoOp< Chrom >
className() const eoBitMutation< Chrom > [inline, virtual]
eoBitMutation(const double &_rate=0.01, bool _normalize=false)eoBitMutation< Chrom > [inline]
eoMonOp()eoMonOp< Chrom > [inline]
eoOp(OpType _type)eoOp< Chrom > [inline]
eoOp(const eoOp &_eop)eoOp< Chrom > [inline]
functor_category()eoUF< Chrom &, bool > [inline, static]
general enum value (defined in eoOp< Chrom >)eoOp< Chrom >
getType() const eoOp< Chrom > [inline]
normalize (defined in eoBitMutation< Chrom >)eoBitMutation< Chrom > [private]
operator()(Chrom &chrom)eoBitMutation< Chrom > [inline, virtual]
quadratic enum value (defined in eoOp< Chrom >)eoOp< Chrom >
rate (defined in eoBitMutation< Chrom >)eoBitMutation< Chrom > [private]
unary enum value (defined in eoOp< Chrom >)eoOp< Chrom >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< Chrom > [inline, virtual]
~eoUF()eoUF< Chrom &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_bit_mutation.html b/trunk/paradiseo-eo/doc/html/classeo_bit_mutation.html new file mode 100644 index 000000000..a7067448c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_bit_mutation.html @@ -0,0 +1,155 @@ + + +EO: eoBitMutation< Chrom > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBitMutation< Chrom > Class Template Reference
+ +[Bitstring] +

eoBitMutation --> classical mutation +More... +

+#include <ga/eoBitOp.h> +

+

Inheritance diagram for eoBitMutation< Chrom >: +

+ +eoMonOp< Chrom > +eoOp< Chrom > +eoUF< Chrom &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + +

Public Member Functions

 eoBitMutation (const double &_rate=0.01, bool _normalize=false)
 (Default) Constructor.
+virtual std::string className () const
 The class name.
bool operator() (Chrom &chrom)
 Mutate a chromosome.

Private Attributes

+double rate
+bool normalize
+

Detailed Description

+

template<class Chrom>
+ class eoBitMutation< Chrom >

+ +eoBitMutation --> classical mutation +

+ +

+Definition at line 104 of file eoBitOp.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class Chrom>
eoBitMutation< Chrom >::eoBitMutation ( const double &  _rate = 0.01,
bool  _normalize = false
)  [inline]
+
+ + + + + +
+   + + +

+(Default) Constructor. +

+

Parameters:
+ + +
_rate Rate of mutation.
+
+ +

+Definition at line 111 of file eoBitOp.h.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class Chrom>
bool eoBitMutation< Chrom >::operator() ( Chrom &  chrom  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Mutate a chromosome. +

+

Parameters:
+ + +
chrom The chromosome to be mutated.
+
+ +

+Implements eoUF< Chrom &, bool >. +

+Definition at line 121 of file eoBitOp.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_bit_mutation.png b/trunk/paradiseo-eo/doc/html/classeo_bit_mutation.png new file mode 100644 index 0000000000000000000000000000000000000000..bc9f7c76763b02bb4867c438525bc7f1e674ad50 GIT binary patch literal 1576 zcmZ`(do+}37$4Ur<(N+vW0iaoxvfp?xHj~SOKy>jrCFttTw3H-X0S-#j5`xDi5X$1 z76}h`_K){@e$R8>_dVx%e!u4-A9AvhmQs>JAP~}a zwva0VAu1!pZQ^1=8=_V4T<8=JIk@2j0)Y?;1Z{g9 zhzBzC1I=UlVWpZ4{26a~EAOm}q1l&)@dXJ(^vdacF-j4VQUphmgTaPIzkw%D;f%qB z8|X^v%q`|Xv8hjE7Yj^EZV0M>6!bJ%G38u~qrnLG7x&w^W!qp`2oqb&&~3G(5m5A= z4x@CkUl{7sN9uI{K1bq;Yj{QK@`QzC{yvD*r+%k;sEp!j0$`}Kx?oCcgI(g}VTJjt z4W+nf4I@c#RLOeK4aHmZ(%ycuWQJvFjdCfeC}GCOhxuPG@aco1n<=O%Q!<#LRu^6X zPkWZ|K0wFxQ2kg$Ze1MXfhm=h7G<|4Tl?B`Qqv-3Sdk*Ccpu* z9arYj4E@O??{!0-z{XbP1cQL(Fa_t-3<1!?exmK0dRD&8t}k&)bqq-+?;a|Dt0m7; zE5#qw&QqS_fQxLoE9i$}ItR_@aG9u2<~GW+O&cvYhxjAwUBpu}OiexXnx`}_Zr;9u z)!JGcUN1s{iKL0>@F8?bWfCaskP`) zfsnmq#Pkax)SvXBPoHuIBJ}wl3AJf!U=rI=@`_PZHq4UiY+AgQs8D3zJ#}F%gDL^c zy^Y?qxu?#(&%ff&1gg8ZR_r*#cR!HOyN`t28;|@k0K?vLy8gA(k=_>g&9Y+IF2HlM z{LS|A#H6LZDweJ+Z9XCrpcCtzz<%1_UJ(Nv5!Hg8DnZ9>K^zsHp7!rnEHSg z?FH~G%>%{Tv42tZJp(yMa_7_ykU++uF*x1MtX2ks&U~bS;F8k2s9ZJIv2iSCCRE%v z)egdPyh6omF62FL{zG&ByhFmRiGPd$r;nRFmEdnZ)lUhda zzpKvWi$P{fD#7arAiX^{OynyE&$PfEn^}!zOsrTgk+6MDgYemTLf!ry2V%)NAeK9C zGNF@oR0g+8Z>7m3tmZn*QTN7wOQ4XM6Ulcy+RsmF&ju;4vAdApQ~V8?%MO6bhs)^| z%4_ymH2sSJgzpDHSBayq$oafS$r&uod1gLufr35bC`UIm>Uo@U4G(EGP!4c@Uw!eL z!KyKMtsG@mi3HY%t?}u&KqlI}5}7Q;MFab_!T$J%pR(r+izj~I$)6m?6S@6eU7w?B z4p+)jxE`Dps(}sF)+WE|T%oNzRN)84fo=3H3g@hV%mf9!@r3`;={H4e2=}|hD+8S3 zy^iKf=T#Og*=7=7d!W+_W!7jqx~!J1DnyQSeI)Yl?(ETF^c^YXZ!4T4=e;oxslAaq zqE8}o(+S1xm0BfRL5JhSn^fx*meKCbJR8E^-Lo~CV^pvMeVl<5Xr%SXO*!Fb;v7xR z#FtgMJ20gU@Xn{@GeaS5#v~+H8rhn+ltkToVweiH{1F4?$!*P7^a3!(<2VP$tF92b z(+D^o;|ZmNLPv9|VLz~2New8>QqvFMD7#1k7Si%20n|LhCN{K_KB;HAV|px@e_!^y dv9u6Qyx{yLYCFNp#YVW+5q3Byh-Gyw{$I1 + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBitNext< Chrom > Member List

This is the complete list of members for eoBitNext< Chrom >, including all inherited members.

+ + + + + + + + + + + + + + +
binary enum value (defined in eoOp< Chrom >)eoOp< Chrom >
className() const eoBitNext< Chrom > [inline, virtual]
eoMonOp()eoMonOp< Chrom > [inline]
eoOp(OpType _type)eoOp< Chrom > [inline]
eoOp(const eoOp &_eop)eoOp< Chrom > [inline]
functor_category()eoUF< Chrom &, bool > [inline, static]
general enum value (defined in eoOp< Chrom >)eoOp< Chrom >
getType() const eoOp< Chrom > [inline]
operator()(Chrom &chrom)eoBitNext< Chrom > [inline, virtual]
quadratic enum value (defined in eoOp< Chrom >)eoOp< Chrom >
unary enum value (defined in eoOp< Chrom >)eoOp< Chrom >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< Chrom > [inline, virtual]
~eoUF()eoUF< Chrom &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_bit_next.html b/trunk/paradiseo-eo/doc/html/classeo_bit_next.html new file mode 100644 index 000000000..56f32ce37 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_bit_next.html @@ -0,0 +1,94 @@ + + +EO: eoBitNext< Chrom > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBitNext< Chrom > Class Template Reference
+ +[Bitstring] +

eoBitNext --> next value when bitstring considered as binary value +More... +

+#include <ga/eoBitOp.h> +

+

Inheritance diagram for eoBitNext< Chrom >: +

+ +eoMonOp< Chrom > +eoOp< Chrom > +eoUF< Chrom &, bool > +eoFunctorBase + +List of all members. + + + + + + + + +

Public Member Functions

+virtual std::string className () const
 The class name.
bool operator() (Chrom &chrom)
 Change the bit std::string x to be x+1.
+

Detailed Description

+

template<class Chrom>
+ class eoBitNext< Chrom >

+ +eoBitNext --> next value when bitstring considered as binary value +

+ +

+Definition at line 174 of file eoBitOp.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class Chrom>
bool eoBitNext< Chrom >::operator() ( Chrom &  chrom  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Change the bit std::string x to be x+1. +

+

Parameters:
+ + +
chrom The chromosome to be added one.
+
+ +

+Implements eoUF< Chrom &, bool >. +

+Definition at line 184 of file eoBitOp.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_bit_next.png b/trunk/paradiseo-eo/doc/html/classeo_bit_next.png new file mode 100644 index 0000000000000000000000000000000000000000..718af96c2b079ff4ac335fb6e63a2238fe19fd2a GIT binary patch literal 1554 zcmZuxdoe_V)H9uK2BFDHZ4L zdJx&+knHQ^iSl-yvWJkR8k!qEBjneX}HuSj;K-}g8XTpvvX1FKDdCso@E~!^*D@q5vgu7WS z2LX1_XDdA>pD0>2c-QnZW9d`H{Be!tt~MpJ`izbH;VGeF#zDtfaDv>>3=dCUV8Z#& z4L7S;X0`0}Hd6%Zboj-Sc3?lwq$#H&s+A$He4>+6Vc>$_k6b2{55baJX^7b$WYGu= zE3SmP;?+604wjiB&M{wW@oir1^0~8sO9m!&KU0??7d}#R;2KD#eW1FtHsTx#VSUL9 zw(G?mxF+T#y1T>Gn%Rcqrg+lvvBpqN`D2XGH%mXz(Qyc~VG1p|jijGZ!vwj5XJ2Q) zd2)@N*Wjf6n8Ze+Njawt+l@pKsj=Z93fha@zB*CX)~FFDU~ncxN}kzy_o_Mu3uDAJ zcGeU;y57QZ_j=0XyBgc|R=flQwfsGWvIMIERLIeCYVx+?aGJm#cC2T-+pU4oFrQmj zJ3xksIM|xG_eXy8&?uv}_eQhh*Ney-VftvUzpOr#3@d}%0>7dm1PBeHBBc)%h0h0h zkG&BL-DuF(M1JM|b7-5$CWDN#He38^_c7mwTd6ljWmG`yy*V5K_BCr=B{i%d7JJY& z*!yiQyeoKig~57Ql$lrEm6zEa#F;nXDj>BeF@yES0cS>BFjI=rd-xT?7Qq4Ko zo^|24N_n9_N~1eNm1Y0TBQjSI*VIa{TN|*X{iLl}Ip3BM4CKvuH~`<<7+O%G)^dl# z;sL&HOxS>hQ9pXIr~u$=jn8E#dZrE97ziJ}PEG_lu~}8$*$1{cuk4=c6K-SaLIH_+k3k=abhxr2{i&W|SI1kOwM|`$}7x*fI zYd;P;0XmbM9)la$A$uUliCwLzX>5R|kWQ<9^X{up69V*}kQl8Exg?DjHqEl-JN@0^ zWvPL1D(X+ctNLi@arn0^qiVpRiOd5Oq8rYRedlo{h1hEZy=RV3n-*9}O7jIwhYihu z@wG?Rp=+_ARUsVksj^x>9sqVZ?dZ=P z_up>V|0R|RCBkr9iyk>|;hU^v{wXb$p5nTkq;j#@uk}gfMHiE+{&+A?b<53nl-g(F zhqAjgqHA^}-)h|{#iNT>=Tk~iz4@W``Q@9dw7xvG3q89vkqgz=_Wb6L-ei2?VR0<~ zPwd%EbU>zlgn7UDDgtCFjTG~WEb8GoDOq)ZjvhLp05A;|cAy&~jF~U(=uhrD$Oon! zK4H(4lhxzqZl8vK!`%7ytl*5vyf{RW}br-orK_jzfWz^`7Ln*K1U2T Ss+UMUa0rRu3f9{BU;YaLADaOH literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_bit_op_factory-members.html b/trunk/paradiseo-eo/doc/html/classeo_bit_op_factory-members.html new file mode 100644 index 000000000..f9798b924 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_bit_op_factory-members.html @@ -0,0 +1,21 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBitOpFactory< EOT > Member List

This is the complete list of members for eoBitOpFactory< EOT >, including all inherited members.

+ + + + + + + +
className() const eoFactory< EOT > [inline, virtual]
eoBitOpFactory()eoBitOpFactory< EOT > [inline]
eoFactory()eoFactory< EOT > [inline]
make(std::istream &_is)eoBitOpFactory< EOT > [inline, virtual]
~eoBitOpFactory()eoBitOpFactory< EOT > [inline, virtual]
~eoFactory()eoFactory< EOT > [inline, virtual]
~eoObject()eoObject [inline, virtual]

Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_bit_op_factory.html b/trunk/paradiseo-eo/doc/html/classeo_bit_op_factory.html new file mode 100644 index 000000000..01b9314cf --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_bit_op_factory.html @@ -0,0 +1,104 @@ + + +EO: eoBitOpFactory< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBitOpFactory< EOT > Class Template Reference

EO Factory. +More... +

+#include <eoBitOpFactory.h> +

+

Inheritance diagram for eoBitOpFactory< EOT >: +

+ +eoFactory< EOT > +eoObject + +List of all members. + + + + + + + + + + + + +

Public Member Functions

virtual eoOp< EOT > * make (std::istream &_is)
 Another factory method: creates an object from an std::istream, reading from it whatever is needed to create the object.
ctors and dtors
+ eoBitOpFactory ()
 constructor
+virtual ~eoBitOpFactory ()
 destructor
+

Detailed Description

+

template<class EOT>
+ class eoBitOpFactory< EOT >

+ +EO Factory. +

+An instance of the factory class to create operators that act on bitstring chromosomes. Only those chromosomes can instantiate the operators that are created here

See also:
eoSelect
+ +

+ +

+Definition at line 39 of file eoBitOpFactory.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
virtual eoOp<EOT>* eoBitOpFactory< EOT >::make ( std::istream &  _is  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Another factory method: creates an object from an std::istream, reading from it whatever is needed to create the object. +

+Usually, the format for the std::istream will be\ objectType parameter1 parameter2 ... parametern\ If there are problems, an std::exception is raised; it should be caught at the upper level, because it might be something for that level\ At the same time, it catches std::exceptions thrown at a lower level, which will indicate that whatever is in the stream is for this method to process

Parameters:
+ + +
_is an stream from where a single line will be read
+
+
Exceptions:
+ + +
runtime_std::exception if the object type is not known
+
+ +

+Implements eoFactory< EOT >. +

+Definition at line 63 of file eoBitOpFactory.h. +

+References eoFactory< EOClass >::make().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_bit_op_factory.png b/trunk/paradiseo-eo/doc/html/classeo_bit_op_factory.png new file mode 100644 index 0000000000000000000000000000000000000000..c8370ff73aad53ce8d3c8587a13d841fac879808 GIT binary patch literal 642 zcmV-|0)737P)LenkV1u|8dNdANe&&_s+s!Ip!kWzjaLzbq zg09L+(>ccF=Si%qs=sI^i#4?FBwnl&zi#x_x45|Hc<1F@z zb$m2lK}Wy8vW{*<$2EG>;(u7(Fb%M_i?EKeX1>#QmCHV}r?alVr(|8O*Hf}itD~@l zB`jeHOIRPqn)zGqtiM-3lLe5Dh|PhD$MDYyNeKpijn#LYD}Eep0-06fF`Dt-K93{&YB^jJ9~forT;#-rLbLWh+z5-CR# zvkE5owPtnw>cxv$IbMa1{diS6TAzy`9g8GD++UkI_RDrcVLxj-p|G2^%dMCCo_Igj z%y-(%ckRTd9cm*7{d>=kK#;f!T5{n0FzryNKhl-^=s$C-_zm^_LSAH#82fx-VSg+Bu zSjU_3Vpfh + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBitPrev< Chrom > Member List

This is the complete list of members for eoBitPrev< Chrom >, including all inherited members.

+ + + + + + + + + + + + + + +
binary enum value (defined in eoOp< Chrom >)eoOp< Chrom >
className() const eoBitPrev< Chrom > [inline, virtual]
eoMonOp()eoMonOp< Chrom > [inline]
eoOp(OpType _type)eoOp< Chrom > [inline]
eoOp(const eoOp &_eop)eoOp< Chrom > [inline]
functor_category()eoUF< Chrom &, bool > [inline, static]
general enum value (defined in eoOp< Chrom >)eoOp< Chrom >
getType() const eoOp< Chrom > [inline]
operator()(Chrom &chrom)eoBitPrev< Chrom > [inline, virtual]
quadratic enum value (defined in eoOp< Chrom >)eoOp< Chrom >
unary enum value (defined in eoOp< Chrom >)eoOp< Chrom >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< Chrom > [inline, virtual]
~eoUF()eoUF< Chrom &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_bit_prev.html b/trunk/paradiseo-eo/doc/html/classeo_bit_prev.html new file mode 100644 index 000000000..580869ff9 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_bit_prev.html @@ -0,0 +1,94 @@ + + +EO: eoBitPrev< Chrom > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBitPrev< Chrom > Class Template Reference
+ +[Bitstring] +

eoBitPrev --> previous value when bitstring treated as binary value +More... +

+#include <ga/eoBitOp.h> +

+

Inheritance diagram for eoBitPrev< Chrom >: +

+ +eoMonOp< Chrom > +eoOp< Chrom > +eoUF< Chrom &, bool > +eoFunctorBase + +List of all members. + + + + + + + + +

Public Member Functions

+virtual std::string className () const
 The class name.
bool operator() (Chrom &chrom)
 Change the bit std::string x to be x-1.
+

Detailed Description

+

template<class Chrom>
+ class eoBitPrev< Chrom >

+ +eoBitPrev --> previous value when bitstring treated as binary value +

+ +

+Definition at line 208 of file eoBitOp.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class Chrom>
bool eoBitPrev< Chrom >::operator() ( Chrom &  chrom  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Change the bit std::string x to be x-1. +

+

Parameters:
+ + +
chrom The chromosome to be substracted one.
+
+ +

+Implements eoUF< Chrom &, bool >. +

+Definition at line 218 of file eoBitOp.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_bit_prev.png b/trunk/paradiseo-eo/doc/html/classeo_bit_prev.png new file mode 100644 index 0000000000000000000000000000000000000000..1fd4eb0e2d0380d2aee98a758e14247500fdcfe4 GIT binary patch literal 1547 zcmZuxeKgZ+9N)xk>R>-jncP$TNZTEuQmIhu_lpskmqJNty_xhzUbefT#m~x2FDRCm zO;eVatmdt?#^oTrNJi;BQnbr)Vz;on?mas9bo=9ZzMt>+Jm2R$=kxh|pEO?|ccWPr zvrs6M5yb=YL!tCcbXcK3L$@FOP0*tY=DwQ)V69fGgIcX3KYtfrhyGa#g@U2fzSE`X zXg?o+)cXGJeJGScAqCnH5SRB!&~{e18VfI4Q`99|DS@?$#(O65fsCzFlbL?o>KFVn zA3wyfq&6*EILH?rnAdY*FGDjLW-7I(kSp6Zj)^_*hJ7ln7bk**WRUPC6qFzz>Q{IV z(jkxiHImfBt-p77Mm`bb1>jJ3WwoyxPa*b(2%pRk+%tq6m~Q%t!3X z?ylNy_BuOS&Prt1*c%D}t71d{Hq=WrvyqWJSpWKmjn8B)>W2=)f81st)3;uMX)Fn{v`Y#|W~ zxZ3G0X%=DFyv=F8b7sQOOv8Cog33|Tz1(@|fB8Y-fT$I{k zEnXIDGWJi@@xMh;&SlPWbBC|FZtF^O$c>1F&z^ywHaF~C;vc2-cRJi6n&zspF2I zSlHG@N_DlbxxpN=VkRNYQ!{w>*b(yy_j%LoC*B4-n18U6bow3fQa!0*KaSCbtFTC7 zv+lFER7d%X!MqzD$JXM2n&QEaoh@fUP!=6Z{jYpD^nE*Ux54|X`1ojxatgxhb$rKmy^i)?CM8bHv)`^P30tILGn>@V=N5$^Ls+O!@jk9Z?Kta++Xs% zH}qR}d`N;7VYr%TU~M6WTY%wK*J4JKfY#Em_+9C{8Vw8Ouimc z?_;^Vi<0_j#Oq9q;Qe*V>w&na=S;XY1|GlzaDuCj*s+CwqAnA0o})6O(t3h8+Kc;NngI=#nYs~& z4e9T!fCV{L4s?zsRUeQS3M`MMSxiWPE$N4D=Naz&aWWM%Spuz_t>-x(qD8z&_j98t Lun$y5-j)0}W3r*r literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_bool_flip-members.html b/trunk/paradiseo-eo/doc/html/classeo_bool_flip-members.html new file mode 100644 index 000000000..e93754b7d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_bool_flip-members.html @@ -0,0 +1,28 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBoolFlip Member List

This is the complete list of members for eoBoolFlip, including all inherited members.

+ + + + + + + + + + + + + + +
binary enum value (defined in eoOp< bool >)eoOp< bool >
className() const eoBoolFlip [inline, virtual]
eoMonOp()eoMonOp< bool > [inline]
eoOp(OpType _type)eoOp< bool > [inline]
eoOp(const eoOp &_eop)eoOp< bool > [inline]
functor_category()eoUF< bool &, bool > [inline, static]
general enum value (defined in eoOp< bool >)eoOp< bool >
getType() const eoOp< bool > [inline]
operator()(bool &_b)eoBoolFlip [inline, virtual]
quadratic enum value (defined in eoOp< bool >)eoOp< bool >
unary enum value (defined in eoOp< bool >)eoOp< bool >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< bool > [inline, virtual]
~eoUF()eoUF< bool &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_bool_flip.html b/trunk/paradiseo-eo/doc/html/classeo_bool_flip.html new file mode 100644 index 000000000..3ea9724db --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_bool_flip.html @@ -0,0 +1,45 @@ + + +EO: eoBoolFlip Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBoolFlip Class Reference

a simple boolean mutation - to be used in generic eoOp's +More... +

+#include <eoBoolFlip.h> +

+

Inheritance diagram for eoBoolFlip: +

+ +eoMonOp< bool > +eoOp< bool > +eoUF< bool &, bool > +eoFunctorBase + +List of all members. + + + + + + + + +

Public Member Functions

+bool operator() (bool &_b)
 simply flips the boolean argument
+virtual string className () const
 inherited className()
+

Detailed Description

+a simple boolean mutation - to be used in generic eoOp's +

+ +

+Definition at line 32 of file eoBoolFlip.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_bool_flip.png b/trunk/paradiseo-eo/doc/html/classeo_bool_flip.png new file mode 100644 index 0000000000000000000000000000000000000000..73b2d3449617d5710d8a3097055f3a3737bebdaf GIT binary patch literal 1346 zcmeAS@N?(olHy`uVBq!ia0y~yV0;f`A7EhylJ~W~tprjM0X`wF|Ns97GXMWSFn@l+ z1Rx8H4;(m9edzxaAeXTu$S;_|;n|He1_qWJo-U3d6?5LsJzMlxL!e>ttW|SZ#m{BL zCuBcwwfMPia(w+yL5Y(m0=1b~?#3@m;ynH8-=(G$nesnhS)ZN1zvoYO6OWF*@}1wW z&rcCo|96JFbFu{x#l#pLTO2FrRR`vv-H|YF?c0REKRT1+_1$w;;QrJ0SL;;ue16?}|1#xGul(Gz`)}S$*MDtb zvtGaS+3_QPzD!n~Y?1u&`hiaU;yXP|M{*|~`6PH`?k$;?ImsJ}A8lU0KBCk5^Xj8p zqeDLS?$~=}=FThEyYKTqG8R^RDO>o>r{lHnM4|1^ria)3(#f+weZKon*qzYoe=76V z?D!D8%jM`}%Y7p8c}M%tf3(!J+i!B{?@CL(KPvhL#}|jzCY|%|-w}HEY~it=4?}Ck zPA|=K{gW!~c6M6yLD#C#@7hU?p?`(S_VssfpQ!xCc9m>ltj^#287uyNOP|Abbm1xc z3w=M1P5=dJ=l;&*+A7IY<&6@lO$?6O{{r^1FgAt$`Tg;Q3Wva!M-}4cLiu(a0%*jZ zNBu%qw(VgHwQh`Baf|bc(^bC(VynuSwgzk!UeUU0u7hsKTb8VaS?U4Yc$73s%&b5C ze|wC8!vCkWvB&M7HbLCPd^B}cZ%$SA=3D18^*bsht-0T3%og^Rdz;hm!E#dJTzHpw z_veiK(j>k6i$sL$O=SvRa&IV^-0IhI{!NE>d0+33Uq>8kGBXo)^U6-|UN4n(rg!T1 zyD8r9Pd?+DAu))$3wk#q8@dcNZ1g?pwTi$@QOeMbp>){P6dP&6$r=D-Qjs z`WP-fvvapb-lyL=`;^z^F78tI&tXzKdjG6(NX@CRkDB|g1grDe?l9GQ=XC2&*ZIQ# zrRxljPdB|*Cx3p^s?%4!_F8V7%^Mo_HFOnwzxT6}U+UYF1Fc2uuVmg|Y@ykEYz{|>YrWnXsMHmY#{%Ol4Ve?+cMEY!A&0P>C=SMJ}Z*?x59+FwfN zW_*4hbw@AdW!HCIyIIWzUCMJGpAO1 + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBooleanGenerator Member List

This is the complete list of members for eoBooleanGenerator, including all inherited members.

+ + + + + + + + +
bias (defined in eoBooleanGenerator)eoBooleanGenerator [private]
eoBooleanGenerator(float _bias=0.5, eoRng &_rng=rng) (defined in eoBooleanGenerator)eoBooleanGenerator [inline]
functor_category()eoF< bool > [inline, static]
gen (defined in eoBooleanGenerator)eoBooleanGenerator [private]
operator()(void)eoBooleanGenerator [inline, virtual]
result_type typedefeoF< bool >
~eoF()eoF< bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_boolean_generator.html b/trunk/paradiseo-eo/doc/html/classeo_boolean_generator.html new file mode 100644 index 000000000..3dfe59929 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_boolean_generator.html @@ -0,0 +1,50 @@ + + +EO: eoBooleanGenerator Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBooleanGenerator Class Reference

The class eoBooleanGenerator can be used in the STL generate function to easily generate random booleans with a specified bias. +More... +

+#include <eoRndGenerators.h> +

+

Inheritance diagram for eoBooleanGenerator: +

+ +eoRndGenerator< bool > +eoF< bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + +

Public Member Functions

+ eoBooleanGenerator (float _bias=0.5, eoRng &_rng=rng)
+bool operator() (void)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+float bias
+eoRng & gen
+

Detailed Description

+The class eoBooleanGenerator can be used in the STL generate function to easily generate random booleans with a specified bias. +

+ +

+Definition at line 104 of file eoRndGenerators.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_boolean_generator.png b/trunk/paradiseo-eo/doc/html/classeo_boolean_generator.png new file mode 100644 index 0000000000000000000000000000000000000000..8dd83278732f07f180a30c926c274a9cbb6dd244 GIT binary patch literal 748 zcmV$ZABU#RKuo2^u4UO{O7kX*0-J}Ps(0Wm!*ks>zo#2ilb~C#EsGtH?;F{YjR2$je>?Gr!j5> zbUvqVh|!F8MAN+i&&l`6b047ndEA%wczoZMcITWL&1gn5n$e7Aw5jO64c_^^*Jv!Y zCsJ$C7dse@;9zxu*3{35CJL^iU#B&-eJH|L?xxfVKdD}(#VQ^3-1Qzwv!#I_hb3v~mQ8b0BAFr7D(j5KP5;P|0-2irCDEB-)^wj@6MyAVQyVpj*2|=b!IwZ-rwLED<>jy>7 z`_{y5jd81?s)Hegb`ZBVr;J9K0U-&a42A?no)J07shSwgXh$^N8&LOl{s7JTAs0mz zW;CN2&1gn5n$doc28!YrulNK;)1o7TR-K(iIYIc+y?z7190&S^Q30Lvz)ULMRPo#d1iPI5Y=y)Q;H e+7V6l2K*1jnlJ`LlB+%d0000 + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBooleanInit Member List

This is the complete list of members for eoBooleanInit, including all inherited members.

+ + + + + + + + +
bias (defined in eoBooleanInit)eoBooleanInit [private]
className(void) const eoInit< bool > [inline, virtual]
eoBooleanInit(float _bias=0.5, eoRng &_rng=rng) (defined in eoBooleanInit)eoBooleanInit [inline]
functor_category()eoUF< bool &, void > [inline, static]
gen (defined in eoBooleanInit)eoBooleanInit [private]
operator()(bool &_b)eoBooleanInit [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< bool &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_boolean_init.html b/trunk/paradiseo-eo/doc/html/classeo_boolean_init.html new file mode 100644 index 000000000..6816f8e6c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_boolean_init.html @@ -0,0 +1,50 @@ + + +EO: eoBooleanInit Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBooleanInit Class Reference

The class eoBooleanInit can be used in the STL apply function to easily generate random booleans with a specified bias. +More... +

+#include <eoUniformInit.h> +

+

Inheritance diagram for eoBooleanInit: +

+ +eoInit< bool > +eoUF< bool &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + +

Public Member Functions

+ eoBooleanInit (float _bias=0.5, eoRng &_rng=rng)
+void operator() (bool &_b)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+float bias
+eoRng & gen
+

Detailed Description

+The class eoBooleanInit can be used in the STL apply function to easily generate random booleans with a specified bias. +

+ +

+Definition at line 110 of file eoUniformInit.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_boolean_init.png b/trunk/paradiseo-eo/doc/html/classeo_boolean_init.png new file mode 100644 index 0000000000000000000000000000000000000000..198c8b10c2b9de570cf3ced6dddf0a3a4ac9b586 GIT binary patch literal 1185 zcmeAS@N?(olHy`uVBq!ia0y~yVC(|253n!;$rn#7=K?8-0G|-o|Ns93ng9PEm_I*Z z0+0p92M!#lKJ@r;B4q#hkZuPZ!-b;BkHX(&t*6S0hMJ>~0yITPAuR9ip1V50j#g5}c0iBCSQ-=yaj5;=YUs#SH-Tpw4g z5)@g$aMW957n@3dN{sA2KgW|XJwJ;tXTK3nuIn|t8|XB#TKn;;ntN3fls;GQOLsGD z*I72fitU%I{F?L4Q<@_e9@OD)UbsQ}&Ai&K!2iO(_NsrBIDWCxEh$RY^Sr0Mcn$Y# z&E*E`H)Jo?SZuH^JD&Nd!riWiO48il1M*x|7cXcptrnS=3$4nA*<3wAyQQ$*O3)y1-AA9{9X!_23}T=MK29XCpJ8>)ToNirA9 zjPtOUO%q}N)Fh_)=#|UHDdNeKB#wVlS{Ych;oK|HmswNJa(iyt;bwbczDD9_a|@Ah zd6BI1MZJqws>rMkyuWbjd-3x}_q$}TuM%&q?C%tlxpn1o>OJp|Q5s=ii~pH(a0UFa z>9TwGMCR)Ahv9n`ymDJ5osszDaokM@VddI@JMZUD)!kxniQQHHCNGy8NHS^3u0}N+ zj3@V;u4?wZeteg&rrY75`+^6`0Urc4esGA?uyENix!V3+^=IeV`DP-e_Rhfz7+5uS z1bSTN5xbo;`JDc4qt~aTuVm#*Fn4_k^isSUtSw>Ab$grH@`AV9H{R3@xbe^5+F)^q zY-{78IrDDRX@3?Ly|(23(Me4wtYySyTjyBqW^Rp*JWwId8Ysnm>SB`i>d)a`Q-gF8 z_UMXfSqFM=>^S??n9FUW#))o4Po8;|53{Ez1-&-yic#OPcDGJ;$i}X^cP-Yg7yIXK zSgs+W;lRihP}8}n+uG9o=;w8}0>3&Q+&KBcj$I3W?AV^6vTm)NhSkYDWY4k6H#YTS z`1z6N#pBBj=GG{&aRoFyQsuhdzAUUN+uwEJId8$LY<63Z`>E!yqaXVVR&$*Ed+OX$ zxkJ723s3bP;`jbL$67*0!zq8Qv{-d^xq(H1##LvXH1$_=Dh;o$xbS1OU&P{lj-W7f zVC?eK*tKJFafr?PRkES-BC#clzByiWSI?3cnVVt`4}I(oWMY;7xMWAzzsdF6%|xcI z=kF?NT;#GqBV5omC@X0Fn?KuXS=~goXWkY*dQQ|LAjXsZQJUtX5dNyVy{~r4ZriU~ zu)tv6D_!&7PnU(;?~gsap}18{YmtI6P5q~ literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_branch_mutation-members.html b/trunk/paradiseo-eo/doc/html/classeo_branch_mutation-members.html new file mode 100644 index 000000000..012eba756 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_branch_mutation-members.html @@ -0,0 +1,34 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBranchMutation< FType, Node > Member List

This is the complete list of members for eoBranchMutation< FType, Node >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
className() const eoBranchMutation< FType, Node > [inline, virtual]
eoBranchMutation(eoInit< EoType > &_init, unsigned _max_length)eoBranchMutation< FType, Node > [inline]
eoMonOp()eoMonOp< eoParseTree< FType, Node > > [inline]
eoOp(OpType _type)eoOp< eoParseTree< FType, Node > > [inline]
eoOp(const eoOp &_eop)eoOp< eoParseTree< FType, Node > > [inline]
EoType typedef (defined in eoBranchMutation< FType, Node >)eoBranchMutation< FType, Node >
functor_category()eoUF< eoParseTree< FType, Node > &, bool > [inline, static]
general enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
getType() const eoOp< eoParseTree< FType, Node > > [inline]
initializer (defined in eoBranchMutation< FType, Node >)eoBranchMutation< FType, Node > [private]
max_length (defined in eoBranchMutation< FType, Node >)eoBranchMutation< FType, Node > [private]
operator()(EoType &_eo1)eoBranchMutation< FType, Node > [inline]
eoMonOp< eoParseTree< FType, Node > >::operator()(eoParseTree< FType, Node > &)=0eoUF< eoParseTree< FType, Node > &, bool > [pure virtual]
quadratic enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
unary enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
~eoBranchMutation()eoBranchMutation< FType, Node > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< eoParseTree< FType, Node > > [inline, virtual]
~eoUF()eoUF< eoParseTree< FType, Node > &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_branch_mutation.html b/trunk/paradiseo-eo/doc/html/classeo_branch_mutation.html new file mode 100644 index 000000000..9928b53ec --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_branch_mutation.html @@ -0,0 +1,165 @@ + + +EO: eoBranchMutation< FType, Node > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBranchMutation< FType, Node > Class Template Reference
+ +[ParseTree] +

eoBranchMutation --> replace a subtree with a randomly created subtree +More... +

+#include <gp/eoParseTreeOp.h> +

+

Inheritance diagram for eoBranchMutation< FType, Node >: +

+ +eoMonOp< eoParseTree< FType, Node > > +eoOp< eoParseTree< FType, Node > > +eoUF< eoParseTree< FType, Node > &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef eoParseTree< FType,
+ Node > 		EoType

Public Member Functions

 eoBranchMutation (eoInit< EoType > &_init, unsigned _max_length)
 Constructor.
+virtual std::string className () const
 the class name
+virtual ~eoBranchMutation ()
 Dtor.
bool operator() (EoType &_eo1)
 Mutate an individual.

Private Attributes

+unsigned max_length
+eoInit< EoType > & initializer
+

Detailed Description

+

template<class FType, class Node>
+ class eoBranchMutation< FType, Node >

+ +eoBranchMutation --> replace a subtree with a randomly created subtree +

+ +

+Definition at line 87 of file eoParseTreeOp.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class FType, class Node>
eoBranchMutation< FType, Node >::eoBranchMutation ( eoInit< EoType > &  _init,
unsigned  _max_length
)  [inline]
+
+ + + + + +
+   + + +

+Constructor. +

+

Parameters:
+ + + +
_init An instantiation of eoGpDepthInitializer
_max_length the maximum size of an individual
+
+ +

+Definition at line 97 of file eoParseTreeOp.h.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class FType, class Node>
bool eoBranchMutation< FType, Node >::operator() ( EoType &  _eo1  )  [inline]
+
+ + + + + +
+   + + +

+Mutate an individual. +

+

Parameters:
+ + +
_eo1 The individual that is to be changed
+
+ +

+Definition at line 111 of file eoParseTreeOp.h. +

+References eoParseTree< FType, Node >::pruneTree(), and eoRng::random().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_branch_mutation.png b/trunk/paradiseo-eo/doc/html/classeo_branch_mutation.png new file mode 100644 index 0000000000000000000000000000000000000000..bf6ee4e93631039bde9f5b2d5c749913f1499e2e GIT binary patch literal 2308 zcmb7Gc~sL^77pTASt1N5hJY|)3(8UngMlV7P(Tn_qO4Ii;U_d6FYJb|s1p<-vm*VE#vQkST$MB^S?5v~Pshyo2Dcsp?dvon=zIVHpFD&SZeuz@Gbt={mNri?)`CWWBd61_c=aIOT z`s%(i()_3`k>onnL4nG@an@eqRy;~*sGgp+*uO1~MBi?y`Khvtn{o@rW?BNKwm=vY z0e{GP_2OOElz_)P&l7JZ)vKpL18A9=9ovpVRk~e zP&<9=Fpip;RwA@68Gqg}Jx%kkicLg?!n<%(CgDuuGgd>yc~#2T`cpGbVEFqUBuwNr zO{=0n>-<03=QE~Tjgv0-j5|Ed(dcQ+W0U22UeKoUnq0?Trn@%8Vb1}R{igZgPqjXa$+5+p{|?)#d=lU7|-~nvD$fiYCq>7Se`+e(iOU* zEIAf!1;!O>pkpWwY>5(lD5|}5T+2X7#cr|AEXeT~j?y06T}KZyd>ftOH%7xOJm*_SqBp4Rx5s|#rXvyPO*(Gxl>zEV8S|`dV9W|39qlU$cz*VrNl(1P^@0*kF zA8KOVJCKGD$ojgY`jc*Uy)^lHH0PThbkyAajnPW;eb=iHs&;3NDCIhPsVj6!6PRPo z)WU^w1{rYxuc_n*&_$a)C$pp$x3GUpG1>~=$?G|bQ6C2H24K1sRLZa(y#R|n76<6{ z0fQwhVh7(Ov3!9=D5G(I5e#AGshJ`?ePviQTG{=Br3laR(4?m1cwH(#DxwKCejFhW zD%-W&M{6;DeKHg=;Ygnje;Szo!7ekTeSG)=Vv(}cku#%_?w-ho;M8?I~!AL?tlae$hQJa zvna$JmvMjbcm#C))xN@gm62YMtX)$3ey;jR=`O?9YB!1@hOhU;CngY+&&uNKjUWy( z_yo%AzD&lM{20h1mB)u5PuhrIS?YiJlH~zDDe|gj zo0RdhHNP6IIqkMcqN0&E+*%~ASXR7ciO#>#mWzpwiC05W*L^2CP?eeHcAKcB~% z&3Ap9yI~?;NG4=Ugze0Y>0tGxm8ISYBvuQk%X2ycD0!kS+9t8yi_a-WcWmPF=)TO* zQi0tuT@*<#Q)Tr^To@*>AkEhqCrn^;4kfd1FT)Iq1a+Dy9SZa~k-6nl znH9X2#)5_Fk7#hTadLe;cN967lTaZsSk0Nm1B|Y5L@hZeRCC5ee=R0fxq-K#uE2nv zeS3P(j&I`22Wgkdn~F^OGb0t)pudPiJ%%n^jstA5K}CTn33RRphSikqTo5VfOO^6oh1&3x#7|$0lSsw1lc%6aP3j+~+1j**yY3{sL=(1?$%zbk@$D{hG zyH}O6lZv<`q}@GepH^MR$ClFh1Eaa%O01^R2fS`2bu3<@;7JTA(`f^6s8C=l)yK4d zc=XuetVIpiw7nx;2NgZpNp#6cQ(ZThNY&;2-=I7?)kh83MjvjP zrjnP6FmQu3RUrAn04=hOhG4^$>+)gv2N`7^TCMPTy7&PT8rH#$PkUbtr_8mKi7j1hknG{REED-xs&NdZR7jOLwi%n=u literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_breed-members.html b/trunk/paradiseo-eo/doc/html/classeo_breed-members.html new file mode 100644 index 000000000..95487681f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_breed-members.html @@ -0,0 +1,18 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBreed< EOT > Member List

This is the complete list of members for eoBreed< EOT >, including all inherited members.

+ + + + +
functor_category()eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
operator()(const eoPop< EOT > &, eoPop< EOT > &)=0eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [pure virtual]
~eoBF()eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_breed.html b/trunk/paradiseo-eo/doc/html/classeo_breed.html new file mode 100644 index 000000000..e6181a218 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_breed.html @@ -0,0 +1,43 @@ + + +EO: eoBreed< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoBreed< EOT > Class Template Reference

Breeding: combination of selecting and transforming a population. +More... +

+#include <eoBreed.h> +

+

Inheritance diagram for eoBreed< EOT >: +

+ +eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase +eoGeneralBreeder< EOT > +eoSelectTransform< EOT > + +List of all members. + +
+

Detailed Description

+

template<class EOT>
+ class eoBreed< EOT >

+ +Breeding: combination of selecting and transforming a population. +

+Breeding is thought of a combination of selecting and transforming a population. For efficiency reasons you might want to build your own eoBreed derived class rather than relying on a seperate select and transform function.

+

See also:
eoSelect, eoTransform, eoSelectTransform
+ +

+ +

+Definition at line 46 of file eoBreed.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_breed.png b/trunk/paradiseo-eo/doc/html/classeo_breed.png new file mode 100644 index 0000000000000000000000000000000000000000..44349666e854d49cb9a89da36ef1d30f2b06d546 GIT binary patch literal 3083 zcmc&$XH?V49t~)40a4Z{0t*YG)a8%TQ2{9eQVm@aib80i3A^-;in0M0SO^`F8cL{1 zSbC765Xu4prG!opfq(%ihVsImclNyx`(e*{d(QhXckawNQ+{*r{AS{yCVE^P{2U+< zh)e(8T{94f4aVfe)2Eo2J5XTFtazbD7COhr$4q*BOnmj~VIq_LQHVrh=$qq3W|QS7 zGZS-=2K9pr2*mkX|E{J*Q1*IG|I2a}NNkg$S(Ot{$3&lKAD7M7!ZjOThR{*FY@$F> zT)Xq&mVoFL=O%OL7c;_-wWqY&3+$cT*h8r<>=iUb7$hijUkkj)E1&z!szb z3jJQfQp|d83t}mfuavGK`IbFb1NW81ia+Z!o)j9F8o%AISQ}AjeBwq4xFshQMAHP! zZt4LZmLJ_l8I{2gN|%1&4;os~AB>p9?-npDtFU`76EdNOTnH;vu1Bw}W(ADuioNY& znxhz)V~JXw{fbz6jc$nF-f_>~m=2#|AS_2Z%3K!0jyD!4b~o!h*4HJJ$vf!~6$Mp# ztAkl&+U{H3aTf0sEr8xr!Sh3s4FmeRG)G0H+;tlSNYdkQv~lF*F`_ zVAN;D*D?WqN3;hPlJQle`Nat^-RqS%=d@>j=XSBolA41=(!RBL>_%28X5IB;9$k+; zJoZj`7uLOTt^BYB7G}qHT!^;witACwZmC$EK%1F9W+ty&G9r??Fj72&x5bD^py}?E0O6|@^f}v;aWSyj|GB0Cre7Ud5yX@LP#!;XQczj@KSG5$jSr1Qqs-ku zZG2(L=0LIpT_&?`%3#2=c2G`YQ?muis#m?y)ho{Ty>|Zs+Z`*>F|U%V1ytFu&+0K? znOQuHx)zq2Wfy|k^_pn8*0TM(*DXOl#XKH~UI@N#Hyleqvg@j~{WLMXwLapB3l`%4 zK6nNwZ6h(93f4f%2CsP}-q`~a&hEQVltFx5>ByD(+dlDJPiQ;ALSp8m>`!&36AU^c z;00`!)xNx|N<^#olfsBOULtTX@VPo_{moVEg@`>fh&umLZY~LoCxTT?QHE0w;N)sk z6wOw5kX;A|;nzC1LAB`J{YFYf!C>`@B?;1y$Maj1E8h7*eM+8M~&04sJhUO44MZsRi)0#Q20c|1||vPFU*3>(vx zQOFzre<~eTt|SpIIM+rDbU#D?{hfQ1C%=B3uE{CH$h}NOKYrmX-QkL)5zx3ovP(iX z+dJx01;+Fml#;)%bcfQKqW11Eqajk5m@7}d0G@BqsZ%>rUzKMW5c9}vn4cTBHwh5au*fUZrB(DbVOcgWDh|*Waf_ zdkv?u6C`t}8GDlJ8YU-6N9*BfE$GvK8Y4*HNUP-yPW1(s!KJFm!R5%yVQkSiiK5Xf zC1RVJe3`RCCFs^|(SB`s^opUwfGY0NMY6~RvIz6(VUj;Fr4MO}{Ia0yG45|VaI4I2 zL>zJUXR}aviSn3CxV&<}mbvnI%ko$!gc)h?n^=x$eWL{`y-M91cj)DckNddMbD4L& z3Tr5Ow$vF1E(p9FBp@E>l*v_) z(0;J^omxxen)5avUrheG7iKGMwDoH}tVx-c9BB8kph*U|pEOs4nvqqvM713#4KjSU zU-On=d%$@c+OyrQf!8$!oPxGR$jPT&)X8%#w{71z0XsynGXa?Rc(AY{xVgJ%Mhctr zy5fsu*V{tT8=woS+!ssO1-%Q>_~+q0e7uxr9lR3dXqoQbz*@A)3iq=Fn0j`CvlS|f zrv3&`MoY%Nse*qkBp{LvP4JjaewpLh#Yf96l!C!wYGs>UeIb5HyJ69SgtInuBdns2 zz7-eB=RV)$t?xlPULs%J4k=5{KeKocRK4tpRr`}#m zAwa%n;g1y(D33yXIOcqx-LW)$LG%{eNwTGnq9siYkwH@*4=!z#=zDtc<-=khH9YCc zO0AMcNo&C|KnDyc@*oisjTjRbq~|1J-AaLxKf0>>nj0Sl|BPhEN4$`)!4W)1MG6Ro ztLV2D8eQoX?}47&^k#oU+cHm?NGJ(Oky9Nz>5BI^JlpLghR)1)#(QUczluiOH|lOI zg2&Xt>d(qrF@rqG7Gem>1%j2z0cM_-d=SXJ0ol_0jP#YBsed;C z`N0J4z_(@BdJl@yfTEy(2ag)&FMqaecW!&J%#jThq1}kTZ~rPnkb= OkiL$|-Ab*8G5-Qi9>^vD literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_c_m_a_breed-members.html b/trunk/paradiseo-eo/doc/html/classeo_c_m_a_breed-members.html new file mode 100644 index 000000000..936f360fe --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_c_m_a_breed-members.html @@ -0,0 +1,23 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoCMABreed< FitT > Member List

This is the complete list of members for eoCMABreed< FitT >, including all inherited members.

+ + + + + + + + + +
eoCMABreed(eo::CMAState &state_, unsigned lambda_) (defined in eoCMABreed< FitT >)eoCMABreed< FitT > [inline]
EOT typedef (defined in eoCMABreed< FitT >)eoCMABreed< FitT > [private]
functor_category()eoBF< const eoPop< eoVector< FitT, double > > &, eoPop< eoVector< FitT, double > > &, void > [inline, static]
lambda (defined in eoCMABreed< FitT >)eoCMABreed< FitT > [private]
operator()(const eoPop< EOT > &parents, eoPop< EOT > &offspring) (defined in eoCMABreed< FitT >)eoCMABreed< FitT > [inline]
eoBreed< eoVector< FitT, double > >::operator()(const eoPop< eoVector< FitT, double > > &, eoPop< eoVector< FitT, double > > &)=0eoBF< const eoPop< eoVector< FitT, double > > &, eoPop< eoVector< FitT, double > > &, void > [pure virtual]
state (defined in eoCMABreed< FitT >)eoCMABreed< FitT > [private]
~eoBF()eoBF< const eoPop< eoVector< FitT, double > > &, eoPop< eoVector< FitT, double > > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_c_m_a_breed.html b/trunk/paradiseo-eo/doc/html/classeo_c_m_a_breed.html new file mode 100644 index 000000000..655357604 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_c_m_a_breed.html @@ -0,0 +1,56 @@ + + +EO: eoCMABreed< FitT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoCMABreed< FitT > Class Template Reference

TODO, handle bounds. +More... +

+#include <eoCMABreed.h> +

+

Inheritance diagram for eoCMABreed< FitT >: +

+ +eoBreed< eoVector< FitT, double > > +eoBF< const eoPop< eoVector< FitT, double > > &, eoPop< eoVector< FitT, double > > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + +

Public Member Functions

+ eoCMABreed (eo::CMAState &state_, unsigned lambda_)
+void operator() (const eoPop< EOT > &parents, eoPop< EOT > &offspring)

Private Types

+typedef eoVector< FitT, double > EOT

Private Attributes

+eo::CMAState & state
+unsigned lambda
+

Detailed Description

+

template<class FitT>
+ class eoCMABreed< FitT >

+ +TODO, handle bounds. +

+ +

+Definition at line 36 of file eoCMABreed.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_c_m_a_breed.png b/trunk/paradiseo-eo/doc/html/classeo_c_m_a_breed.png new file mode 100644 index 0000000000000000000000000000000000000000..0dace295836480601953ed096ebcd9b7c361ab3a GIT binary patch literal 2948 zcmb`Jdo+|=AIC?Gm~js&BgHAt=)&p3FvB!*&7}zuO{G#uGc&#Jh}B=Ev9a+=)9R?W zDM4{|a)Iq1?>z^DAvfAt5?n8*3DP@4r=F--kG%Cidm+{L_6)K=M2HL@Wmre7NEe8b zW0RA0cDb-|3T^HTF_9?X|XVdAl968OXDh*W%*Bzyhm}#}l@ZzC3SBfm^7A}n7r<{Y^*In<_NbQ&d0kNI zL*2-NWcN%}fSo{FIXf+O`rg6yBbi^VO}6al!gLq^tQdPh-f^e9lIx7Up1JSO6xwbf zQp>hu(vmVRiag+E7+X4XQ@sIc8jhPVb+pPvZ?f&sLtwmH;z1!$U5KtiKQ*}vGO-4p z&TLbCS!Y@*d@={?Y~GHzv3*^X>_{7;Wqtl$(vFoBL(QOKJ^jSWpj)T2MSG91wgN$8L>!Db%!ZukV{WBEhGVsLP~v0gX(0)4)IjKio>Y1yDB%_5gyq&XvGfxs2x*f zX%9R+#Ti8^|HSD6H0D3VsM7BZEg@P$vdoAI{fF;xI184{n>(tv3A+t_^C)5AEjkIjYNHgS^Abho`k16<`2yZ3yp)uWHK%C7PSaf?k(&f1r4BCR7< zO+Sjvd$s2clLmQ;PG5Uhl1@iY=h~E90f6j0FVYMA<4pYNrMG87uZ!YAoe2gK0J5@q z)SpDUaI4!gOL}>+pw4UqI_?L=evlsK^sDk8`*|stu}D5>>ck@&wg zV>ARNQVqypIifUT%~@#kzYe^w^GTmG%W%eA&KHH{?3EXhhdQp(^MqPdPzB<_AV>

k*PQ z9yjY){f>t6dw=1}x50<&7HA#BK$$4`AMg9HAyv^egHL{k9Mc1^Q|RjWCc)E)ES?do zM3s`HM+F;N6TvwJ!7(_4o%d5s@)btgGkZ1MG1pC(zOvSCsQL74XT;HZvt^V}>CpRL zcI z5}usapJ3PFaBJuBEALv$Ep6)_=qmu2)OwJvJ}MhjNvQ-|M&t8LB8Y~X7N6#*2bm_@ zF+On3wM9|4{aKzu0Fx(EZN7l(WE-046|gM_-akkCC{GFyKZ1PC3fvKHQ$;M(}114k`A4 z^CO;t1ILkXd_u}9I(xw4r|Oh&$J7y8SP!`1Q3Riu@F#GNA-U&&j;rJeIfKd%%j0*% zdRtcLW`u<`d&9IWvBTflq(2`08$icb7U4EHp%~mzN-$S>LL2>YSDpU>?C>nRPx&Ez zKYdSVb3-R|Rco^2wae$hu5ahQ4B|z8#%A?BW~wM^7Pxy$bQaXQXeM^x-U=u#6TqOv zHe3!s{6|mzZPi)(G#z@L;rV2X z%40efOo>_&p|9rCarmNw;JFbX+EwesjMNM>#-?1#$qNs6fe`fHOf$zTqPb61toST)r z$?(O*)NZg&E66qe14{~FjnLRci-J>9}{C+Lk3Bwt6i{QwjH|uQeM_ zNza`w)^=aLoRHZ + +EO: Member List + + + +

+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoCMAInit< FitT > Member List

This is the complete list of members for eoCMAInit< FitT >, including all inherited members.

+ + + + + + + + + +
className(void) const eoInit< eoVector< FitT, double > > [inline, virtual]
eoCMAInit(const eo::CMAState &state_) (defined in eoCMAInit< FitT >)eoCMAInit< FitT > [inline]
EOT typedef (defined in eoCMAInit< FitT >)eoCMAInit< FitT > [private]
functor_category()eoUF< eoVector< FitT, double > &, void > [inline, static]
operator()(EOT &v) (defined in eoCMAInit< FitT >)eoCMAInit< FitT > [inline]
eoInit< eoVector< FitT, double > >::operator()(eoVector< FitT, double > &)=0eoUF< eoVector< FitT, double > &, void > [pure virtual]
state (defined in eoCMAInit< FitT >)eoCMAInit< FitT > [private]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< eoVector< FitT, double > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_c_m_a_init.html b/trunk/paradiseo-eo/doc/html/classeo_c_m_a_init.html new file mode 100644 index 000000000..433fead02 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_c_m_a_init.html @@ -0,0 +1,53 @@ + + +EO: eoCMAInit< FitT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoCMAInit< FitT > Class Template Reference

TODO, handle bounds. +More... +

+#include <eoCMAInit.h> +

+

Inheritance diagram for eoCMAInit< FitT >: +

+ +eoInit< eoVector< FitT, double > > +eoUF< eoVector< FitT, double > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + +

Public Member Functions

+ eoCMAInit (const eo::CMAState &state_)
+void operator() (EOT &v)

Private Types

+typedef eoVector< FitT, double > EOT

Private Attributes

+const eo::CMAState & state
+

Detailed Description

+

template<class FitT>
+ class eoCMAInit< FitT >

+ +TODO, handle bounds. +

+ +

+Definition at line 37 of file eoCMAInit.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_c_m_a_init.png b/trunk/paradiseo-eo/doc/html/classeo_c_m_a_init.png new file mode 100644 index 0000000000000000000000000000000000000000..ef9a110eaeadefbf9aaabbde9f51d9fb28021824 GIT binary patch literal 1788 zcmb7_X;4#F7=|ynglY+3E2)9Rx)r1#n}ACq$fBYU5Jids6jTrpC`L&&C_+JOT|lvd z1fr;ghDwkn4KYSg3KRka5WU$`h%CxYf`B(5OB$(;o&Mg*@4V-mIWymU=R1GG zR>KA81pojTdT;X#008}yI$bw+j*j8mpUl&3pZWXj_R?y#I;qvx-MFzoTc>7MU0ogJ zvG%#{sCO)YunTbO7eoTU{43s`n|FUxpe*1qUam9t+8ngufK|?g!kN@P8lw}x;#Qol zoo@dmlLyBQRGbi3 z%JwqD8hJdAb|H*49h3V^I-N>jEw&er!K+{UNQ)B$eA6b(*OXm5teB;TK>4cJgj)*V z8!TAV(M>?_QI;j!t%6qPkiMu#50vgKt+445^cPpaAqWt`1gXT>E>BUATq8@b_K3CZ zXXYLEb{{;#5k(~ywkERbU$G*+zJh!?#2Doo$xsHKV>^juIL7m>953DCZkaG0+7+Uj z@Opj9lmH2LwKZU&*NQ!(`;DYnx})H1d(X48Ncf1+5citp6SWhx{DH@~Wv_(;)WqDj zgwi`=`~4W4Z>PHcjByp8Yq@i4CHO{S02fHXeD1w(o$sQeE#RxxkL?R_?V=Gi9OVDsoUVkZ%(M%pp1yFNfxpsUQB@4xGhJ^ zd1BImh&j8n*xYP#Tw_=Zx0{)DULg_R)1cdhJ4@(zJ58g4w!oHpog1N`-4*3@>SYGy zB=Y53qe7@lHE;TAz^wTXuP9_c^_Mn!JJ_^0mQ%F%4A^b zOm*h^V@lu`U8&!SViET;7#KICE^VVTkLuD#bY`~4-%EU>!i0)Dw9S4>0BJbep#Ol7 zHd(nS<$CKdIc`05s&qO<`f+up8^vH2P0SL=t79~JZ?_$y`B==NK8849Wt^SLnG+C)-(4N^T38E1L z7Zslj7LZ7ZHJP6XcQ~4QQXJMcQi;b<11^bN@XEpM`Hxl-PG=K@hmQ)f#Pu!nrV%WQ zMaZP^@`Z5k$;))SQ|t1}PzIwO@~tnq$55YxJsa5;iY??phTBR?_%u#a3`f|T*tXeP z)_%KoVN-zIMA=Yn5XHEFF68)&oZpQ=iBLiOFIr*ER#52V4HOh$VS z`l70Xj71(d@pIo{-5IXPbz`KUmRlL31cxg-u#cGx8$@k5n#KWHMB#c{QB;T?k7$}u+fF1%)C13MU6EPJ7^K1!-85X|g?oQsu}RlUNU6HD~k9 zEDD#PceJ)uKI&AaPCa9BR-srL;T@+0b`Abt9E@ewpxrXfjbeNk{byr+XtDpL zf~v^5(<49GMCDMFfW!Oot6Wwfp`8=YVAb$4^GbT3Q56u_P7*tcH>vuK8*r|@G;DMs z(G5-sppX^3=U4IfE4Z27UK}eGxTZs3s-!R%_6KLg|=P9A}Hn> zXXg9t*m(TAIWapdX3+z{F%J<$+l%1IaNnQy E2OZRs1^@s6 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_cellular_easy_e_a-members.html b/trunk/paradiseo-eo/doc/html/classeo_cellular_easy_e_a-members.html new file mode 100644 index 000000000..21c56e815 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_cellular_easy_e_a-members.html @@ -0,0 +1,29 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoCellularEasyEA< EOT > Member List

This is the complete list of members for eoCellularEasyEA< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + +
cont (defined in eoCellularEasyEA< EOT >)eoCellularEasyEA< EOT > [private]
cross (defined in eoCellularEasyEA< EOT >)eoCellularEasyEA< EOT > [private]
eoCellularEasyEA(eoContinue< EOT > &_cont, eoEvalFunc< EOT > &_eval, eoSelectOne< EOT > &_sel_neigh, eoBinOp< EOT > &_cross, eoMonOp< EOT > &_mut, eoSelectOne< EOT > &_sel_repl)eoCellularEasyEA< EOT > [inline]
eoCellularEasyEA(eoContinue< EOT > &_cont, eoEvalFunc< EOT > &_eval, eoSelectOne< EOT > &_sel_neigh, eoQuadOp< EOT > &_cross, eoMonOp< EOT > &_mut, eoSelectOne< EOT > &_sel_child, eoSelectOne< EOT > &_sel_repl) (defined in eoCellularEasyEA< EOT >)eoCellularEasyEA< EOT > [inline]
eval (defined in eoCellularEasyEA< EOT >)eoCellularEasyEA< EOT > [private]
functor_category()eoUF< eoPop< EOT > &, void > [inline, static]
mut (defined in eoCellularEasyEA< EOT >)eoCellularEasyEA< EOT > [private]
neighbours(const eoPop< EOT > &pop, int rank)=0 (defined in eoCellularEasyEA< EOT >)eoCellularEasyEA< EOT > [protected, pure virtual]
operator()(eoPop< EOT > &pop)eoCellularEasyEA< EOT > [inline, virtual]
popEval (defined in eoCellularEasyEA< EOT >)eoCellularEasyEA< EOT > [private]
sel_child (defined in eoCellularEasyEA< EOT >)eoCellularEasyEA< EOT > [private]
sel_neigh (defined in eoCellularEasyEA< EOT >)eoCellularEasyEA< EOT > [private]
sel_repl (defined in eoCellularEasyEA< EOT >)eoCellularEasyEA< EOT > [private]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< eoPop< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_cellular_easy_e_a.html b/trunk/paradiseo-eo/doc/html/classeo_cellular_easy_e_a.html new file mode 100644 index 000000000..01c3ce4cb --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_cellular_easy_e_a.html @@ -0,0 +1,79 @@ + + +EO: eoCellularEasyEA< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoCellularEasyEA< EOT > Class Template Reference

The abstract cellular easy algorithm. +More... +

+#include <eoCellularEasyEA.h> +

+

Inheritance diagram for eoCellularEasyEA< EOT >: +

+ +eoAlgo< EOT > +eoUF< eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoCellularEasyEA (eoContinue< EOT > &_cont, eoEvalFunc< EOT > &_eval, eoSelectOne< EOT > &_sel_neigh, eoBinOp< EOT > &_cross, eoMonOp< EOT > &_mut, eoSelectOne< EOT > &_sel_repl)
 Two constructors.
+ eoCellularEasyEA (eoContinue< EOT > &_cont, eoEvalFunc< EOT > &_eval, eoSelectOne< EOT > &_sel_neigh, eoQuadOp< EOT > &_cross, eoMonOp< EOT > &_mut, eoSelectOne< EOT > &_sel_child, eoSelectOne< EOT > &_sel_repl)
+void operator() (eoPop< EOT > &pop)
 For a given population.

Protected Member Functions

+virtual eoPop< EOT > neighbours (const eoPop< EOT > &pop, int rank)=0

Private Attributes

+eoContinue< EOT > & cont
+eoEvalFunc< EOT > & eval
+eoPopLoopEval< EOT > popEval
+eoSelectOne< EOT > & sel_neigh
+eoBF< EOT &, EOT &, bool > & cross
+eoMonOp< EOT > & mut
+eoSelectOne< EOT > & sel_child
+eoSelectOne< EOT > & sel_repl
+

Detailed Description

+

template<class EOT>
+ class eoCellularEasyEA< EOT >

+ +The abstract cellular easy algorithm. +

+ +

+Definition at line 38 of file eoCellularEasyEA.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:45 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_cellular_easy_e_a.png b/trunk/paradiseo-eo/doc/html/classeo_cellular_easy_e_a.png new file mode 100644 index 0000000000000000000000000000000000000000..f61a07dfa3f0f329d70b27f00c1630acf30069cd GIT binary patch literal 1565 zcmah}do!Jg)Z!C(Oy765WGpC}46kcIDEce>N1QmG6|rGlIsCRc|3F@Zo3-5?#2r7I%b zT=rn7W8Hxm4DOBt4RJr7IhECNv|zhpJi*Mv>wtMlOTFMZ-;n1qTXK9Uq}hBvVcN89 zjoe((?}uC!J##j`>_l*1N;jQi7VP%GNfpf=sb2{e*#k5xKr1J3n)2GSv+wrz!YL;! zD1Y5>=512ppP1ARuy`TX)Xup4Y>LWFFAgd-$RN?6x#$?`FQT@TX~7msz9C^So|@5a zaiBj@nDrv7vq)TAC)VJ~cLZ9Z0}uo z9HaG}$#zq;+=pwhs}pi(Y6Pr=B`{`iQHA3qcc6RXD@}CCEr19aC2O!uaOmld?LS> zw>BIQ%RLSPQQ}Tjl!{o#1Y{?{pIw4vpJU(4Tg9VP(xCk6_3_r~bmFCMr)Q&;(E?^!k|o5FqqR+RQNHWQPJ z*G(y?{)*T>cTc;-CM2neQ<=_Qp5sYs!cmx4oZWol#2?&oSP)EUn}IBbj*nIRczb(@+7( zOX5=lM9j1+l~vhEerlO4h3mDt=n`}F zWrj7j60os}v98mSGG3ewaM$Ubm`sx#S@J%cssJ0ULuE96!`FYMLnQEcGA^t_{i_UY z3K((Z8sF_+EE0NRp*tRqc=Ujn7MxjHRph70IraInEpu|`*n<0uM4`vlj!?Ow#Ox_O9%%eM$?rzWi&nPs{nbTZMhZqR&za>aoF3? zlhoK2MHae#@9C$TTqu5m=)BY2-(8_XG~R=%f>TC9Sh6)+?`0ZE)b#vM&K zRj8(-!Ms3%%k2p?X8c?3vhM$0&;PC6Cx`q|>=-&zYAPMR5iKLLsDG74wE{M$vRCU+ zwpRGdjMjr%S6|fM-P=#%FAy55vW!+gJg%A=>O_J}9Z=2mdWkuw?O z`M?$PX=PvJxAi63YFDpB@qYby7(%98AfW@~{#kxMf7t1x6l04xkt$2ibk JXg6(`=-)6?nj`=K literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_check_point-members.html b/trunk/paradiseo-eo/doc/html/classeo_check_point-members.html new file mode 100644 index 000000000..9b9ed6368 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_check_point-members.html @@ -0,0 +1,35 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoCheckPoint< EOT > Member List

This is the complete list of members for eoCheckPoint< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + +
add(eoContinue< EOT > &_cont) (defined in eoCheckPoint< EOT >)eoCheckPoint< EOT > [inline]
add(eoSortedStatBase< EOT > &_stat) (defined in eoCheckPoint< EOT >)eoCheckPoint< EOT > [inline]
add(eoStatBase< EOT > &_stat) (defined in eoCheckPoint< EOT >)eoCheckPoint< EOT > [inline]
add(eoMonitor &_mon) (defined in eoCheckPoint< EOT >)eoCheckPoint< EOT > [inline]
add(eoUpdater &_upd) (defined in eoCheckPoint< EOT >)eoCheckPoint< EOT > [inline]
allClassNames() const eoCheckPoint< EOT >
className(void) const (defined in eoCheckPoint< EOT >)eoCheckPoint< EOT > [inline, virtual]
continuators (defined in eoCheckPoint< EOT >)eoCheckPoint< EOT > [private]
eoCheckPoint(eoContinue< EOT > &_cont) (defined in eoCheckPoint< EOT >)eoCheckPoint< EOT > [inline]
functor_category()eoUF< const eoPop< EOT > &, bool > [inline, static]
monitors (defined in eoCheckPoint< EOT >)eoCheckPoint< EOT > [private]
operator()(const eoPop< EOT > &_pop)eoCheckPoint< EOT > [virtual]
printOn(std::ostream &__os) const eoContinue< EOT > [inline, virtual]
readFrom(std::istream &__is)eoContinue< EOT > [inline, virtual]
sorted (defined in eoCheckPoint< EOT >)eoCheckPoint< EOT > [private]
stats (defined in eoCheckPoint< EOT >)eoCheckPoint< EOT > [private]
updaters (defined in eoCheckPoint< EOT >)eoCheckPoint< EOT > [private]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_check_point.html b/trunk/paradiseo-eo/doc/html/classeo_check_point.html new file mode 100644 index 000000000..b9156e543 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_check_point.html @@ -0,0 +1,89 @@ + + +EO: eoCheckPoint< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoCheckPoint< EOT > Class Template Reference

eoCheckPoint is a container class. +More... +

+#include <eoCheckPoint.h> +

+

Inheritance diagram for eoCheckPoint< EOT >: +

+ +eoContinue< EOT > +eoUF< const eoPop< EOT > &, bool > +eoPersistent +eoFunctorBase +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoCheckPoint (eoContinue< EOT > &_cont)
+bool operator() (const eoPop< EOT > &_pop)
 The pure virtual function that needs to be implemented by the subclass.
+void add (eoContinue< EOT > &_cont)
+void add (eoSortedStatBase< EOT > &_stat)
+void add (eoStatBase< EOT > &_stat)
+void add (eoMonitor &_mon)
+void add (eoUpdater &_upd)
+virtual std::string className (void) const
+std::string allClassNames () const
 returns a string with all className() of data separated with "\n" (for debugging)

Private Attributes

+std::vector< eoContinue< EOT > * > continuators
+std::vector< eoSortedStatBase<
+ EOT > * > 		sorted
+std::vector< eoStatBase< EOT > * > stats
+std::vector< eoMonitor * > monitors
+std::vector< eoUpdater * > updaters
+

Detailed Description

+

template<class EOT>
+ class eoCheckPoint< EOT >

+ +eoCheckPoint is a container class. +

+It contains std::vectors of (pointers to) eoContinue (modif. MS July 16. 2002) eoStats, eoUpdater and eoMonitor it is an eoContinue, so its operator() will be called every generation - and will return the contained-combined-eoContinue result but before that it will call in turn every single {statistics, updaters, monitors} that it has been given, and after that, if stopping, all lastCall methods of the above. +

+ +

+Definition at line 46 of file eoCheckPoint.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_check_point.png b/trunk/paradiseo-eo/doc/html/classeo_check_point.png new file mode 100644 index 0000000000000000000000000000000000000000..bd9de6a7e15ecbcad09f10fa3e0a8c5501004f79 GIT binary patch literal 2262 zcma)8dsNd$7XBe(L|$4&5QLzyD5eB0k6?&AMNEkpc_fw)o-JyGfD1oaf(Sl95Gs_G zhhhjQn*J2=$fKb#5M1^2LKm|0>L{LEp0wEi8yQiny-S&@}xpTj{cjkQa%{`Ng z3-B{qVX*=L03*zvU4a0go2<24mg;JIkrDcsb}+|bgMBp`jn>p?TIlr1Lap_&wY0RP zwQ8Pgr#i`j0YQMLtS=S-md9asc?JLd(ip9yXvB4;Z(dnWC@kSX-onY;3($KZW5N;D z9cpNa9_+L7n(Ic-Cn=P-DPfx#lu?^C8wupP-A}@n`cBFt;(=mq2cb5#4 z6^SP+xh5>7j)Iyg2(RRxEeJw>*L3cnOQ|tWk6JBWQ{XUq$Y!ARQ>ivogV-P4Jp_QL3#beh4e0HtY#j?%9oUen~>|rISJ;5(vnCJK|6vsXj^|Ep^T>zx5S~JJYC$PO~e}SL9>n zZW}Su+t#;L#RSokRF_dP(Hyt}Ui{7v?8K*}UlTX~xC{>s?dagYq=^ z?~o0z0Q*k}&Zk=^^xw&{t95^}`Ggo@Acwp@Ar_y)7ZK-AJ1!#RKTiB%$Hq-0xHfmo ziR1o|zI8>$wNM;$Ei1@C!q!trmVo4ws5(ztXk~!?@7x0ZWa;}iEAaEecT<>%eO=k5 z)1~iuFY$5L#}k_io2+mud?gpkO0&dCjU>Y26jst?$bj4G7i+UPJM+sk`(|=;@-VQT zwp4lAYKFD{(8xsgmo7<&9zMJAM*Pto$AtD@7~@_SGY5Ma6fpG;9=Y#r0wIe6F7-G% zhGt*iYbo=$DDijuQPCMql`ezq=QlMexAoOt&5ST_y^V^jdZu7Q-7p4vYn{ zCD(-v?`?-;&B*5(c%wR|A46P6lbUAg_bkohvmI?8Q7bYA8N^{~{~4Rs8T}V>yqPiG ztkSNxZqUk~)YO#fLL~-dh$ADw)KeJ|!Ybh!MO@izT3wvCq*f4hvDWXg04GgMSqZkk z&`W=peYnHk@E8S@25MFQZN$_+^<5m0b!4!CPmn0ibu=T}Gz>JE6(|L~4*#WH z>7?zgPXE~WH#+k=uaRLH+b^{WCau?*RmFl)abbC@WZ;fg>>FhX47-{DK0vk_n#e6> zD>=hCFzl1!W3PKusGT_iA&$*W60Tz@W$D)!>)tY`N3$tQ2~j**CINN91U<#4zuAB5#iNwmY`V%^&Bt?Ja5EfMXWFq2Cv}-0?by7+AvUG03+2pBg~b9XD_| zUyIyCx<%K;K!C74DBziQw+>)dWDL|7CIc;5)w%#;lNFGtRdA-k|6B4*wL#6vb?%<3 z$}w5c8{P-`jrv>_GSk(eK{+=G_)I}p6bo+qB%urF3;S9}aZ|nyY!9woh~Rg&M8=mr zMDpey{>Sgs5hV`yn43UrCax5lR#K9}aiub`SYdtb8UPMV<_n@RC+ko#*4IBy!#IuZ z+VbNEhkFi9Z=;k&{gRc1B2Iyv#n3c!7*-=faIKtv4&a(cxh$S!>=yHnx!I_GA+&fk zJCpS*1-4Lhs+y?_l5bU$v}_80_5U?${sMb{vSi-9^Hw3(#P?E-?iV{S5Zuz=ylymS z{2Oum_RWMy*=kx(Ku5YjoZUP+A6pTEv|~$(<*xFPT6xdbN-muOimZI?Voy+~ z6=6YWnwU9r^Yt1{MHR)5+Dkir#BJ`X^Z3)Z@1GNC87>!+4mw7_LFNL(2vjFZXg{Df zw@-myG>3^X@f7$iN0|Zv)ybT4!(zpJ5N}+`!I_PhaV%r`ZY-tz0*dq#D&tUn6qh(8 z4YUd!vPP%2<-` m`-1hcj#W1|5hll#8k0Mr=X%F(Ow+ZW5CG#Fu#4**dFo$v$UHj$ literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_collapse_subtree_mutation-members.html b/trunk/paradiseo-eo/doc/html/classeo_collapse_subtree_mutation-members.html new file mode 100644 index 000000000..f401cf889 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_collapse_subtree_mutation-members.html @@ -0,0 +1,34 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoCollapseSubtreeMutation< FType, Node > Member List

This is the complete list of members for eoCollapseSubtreeMutation< FType, Node >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
className() const eoCollapseSubtreeMutation< FType, Node > [inline, virtual]
eoCollapseSubtreeMutation(eoInit< EoType > &_init, unsigned _max_length)eoCollapseSubtreeMutation< FType, Node > [inline]
eoMonOp()eoMonOp< eoParseTree< FType, Node > > [inline]
eoOp(OpType _type)eoOp< eoParseTree< FType, Node > > [inline]
eoOp(const eoOp &_eop)eoOp< eoParseTree< FType, Node > > [inline]
EoType typedef (defined in eoCollapseSubtreeMutation< FType, Node >)eoCollapseSubtreeMutation< FType, Node >
functor_category()eoUF< eoParseTree< FType, Node > &, bool > [inline, static]
general enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
getType() const eoOp< eoParseTree< FType, Node > > [inline]
initializer (defined in eoCollapseSubtreeMutation< FType, Node >)eoCollapseSubtreeMutation< FType, Node > [private]
max_length (defined in eoCollapseSubtreeMutation< FType, Node >)eoCollapseSubtreeMutation< FType, Node > [private]
operator()(EoType &_eo1)eoCollapseSubtreeMutation< FType, Node > [inline]
eoMonOp< eoParseTree< FType, Node > >::operator()(eoParseTree< FType, Node > &)=0eoUF< eoParseTree< FType, Node > &, bool > [pure virtual]
quadratic enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
unary enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
~eoCollapseSubtreeMutation()eoCollapseSubtreeMutation< FType, Node > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< eoParseTree< FType, Node > > [inline, virtual]
~eoUF()eoUF< eoParseTree< FType, Node > &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_collapse_subtree_mutation.html b/trunk/paradiseo-eo/doc/html/classeo_collapse_subtree_mutation.html new file mode 100644 index 000000000..f499defa5 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_collapse_subtree_mutation.html @@ -0,0 +1,165 @@ + + +EO: eoCollapseSubtreeMutation< FType, Node > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoCollapseSubtreeMutation< FType, Node > Class Template Reference
+ +[ParseTree] +

eoCollapseSubtree --> replace a subtree with a randomly chosen terminal +More... +

+#include <gp/eoParseTreeOp.h> +

+

Inheritance diagram for eoCollapseSubtreeMutation< FType, Node >: +

+ +eoMonOp< eoParseTree< FType, Node > > +eoOp< eoParseTree< FType, Node > > +eoUF< eoParseTree< FType, Node > &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef eoParseTree< FType,
+ Node > 		EoType

Public Member Functions

 eoCollapseSubtreeMutation (eoInit< EoType > &_init, unsigned _max_length)
 Constructor.
+virtual std::string className () const
 The class name.
+virtual ~eoCollapseSubtreeMutation ()
 Dtor.
bool operator() (EoType &_eo1)
 Mutate an individual.

Private Attributes

+unsigned max_length
+eoInit< EoType > & initializer
+

Detailed Description

+

template<class FType, class Node>
+ class eoCollapseSubtreeMutation< FType, Node >

+ +eoCollapseSubtree --> replace a subtree with a randomly chosen terminal +

+ +

+Definition at line 272 of file eoParseTreeOp.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class FType, class Node>
eoCollapseSubtreeMutation< FType, Node >::eoCollapseSubtreeMutation ( eoInit< EoType > &  _init,
unsigned  _max_length
)  [inline]
+
+ + + + + +
+   + + +

+Constructor. +

+

Parameters:
+ + + +
_init An instantiation of eoGpDepthInitializer
_max_length the maximum size of an individual
+
+ +

+Definition at line 282 of file eoParseTreeOp.h.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class FType, class Node>
bool eoCollapseSubtreeMutation< FType, Node >::operator() ( EoType &  _eo1  )  [inline]
+
+ + + + + +
+   + + +

+Mutate an individual. +

+

Parameters:
+ + +
_eo1 The individual that is to be changed
+
+ +

+Definition at line 295 of file eoParseTreeOp.h. +

+References eoParseTree< FType, Node >::pruneTree(), and eoRng::random().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_collapse_subtree_mutation.png b/trunk/paradiseo-eo/doc/html/classeo_collapse_subtree_mutation.png new file mode 100644 index 0000000000000000000000000000000000000000..31b71eabc6b026721dae57559bafc5855c864d9a GIT binary patch literal 2382 zcmbVOdo+|=A0A&FmFujO#t5g&5fW=^7#W93!Z9up=1hcM_i-l@M&&Zd7$q4)xvMZ3 zxlHcYcantM21)L@p9~G-GT(I8I^SxYwZ8SO^Zl`({p@G`p1ps2?dOjjYi6P^Dg+mT zKp>)q2A9ntkUb83-ne%UAH(AUhxrrC40BD7$K&xSkJp%yVV}rne~!k+#*k*-6n`lY zU~XaoxiG_WhCudD8D744?RNUo(@wt}P3V=Zd?kEqwA#lblxj{?`P*m7cD&;iCnE*+ z8Ji7{^#wV<6_oOMPF@GBKX_3!x4Gg`V=5m9GP^Ag4s27+pn&)x*LcviNCkNXKw6~) zq155ME;V89b+fApDd5bp5rPPj2xHfJKO_H66{EWFbUZx8#5uYIg*f_>R|althaUdM z2zZ^dxskZ})x(b^bMC0RswzI7f64L%*gEwPQzIs#eHJHFb!j zU)yV>+0=Y(_&G2C$7wwk;OOp1ohRVoGlbi#6-}A0xE08A;ZfwOLU(P`%DcWofTVq~(>JkT=FS}+DNFh!D8 z-qVs!+Er^fE4jrwA&Mn;qh~+6BuY$}NqR>www0=>J5D;_67ARNp|ZlGo}uc2Y%O&; zc-mkQZE`SBRv0V`R!;r&4tS5%Cg*K>p~<2Pp@K-V6TYoIhLWc@5Ov(-3#K zmj27^__XZx(Sep+sb%`_pj6PcdaKZ*w8M4pOLs#eIe&A12;BWFQM(iRjtqv^O%0IyN7O8?D;tgy96;f_Rl4SOIza0#St(s(cS*t z!hyo=2$%{fE6NCP9sdBsF_6)c#ZTy8Uz9KS*IB<(g)9{G%ON>0H-Zh-ItD?TAw9N@ zAa57StRRF0ehFsaK<;ccn@HLMz)5F|cGj{xhsYw=2-l_1D-vCGz?2kKX?Lz+T&xPY z)jYe{YXxR9l%JE*3xtd@{nmGvkDmg|T)8=5h%N?frq7hm(-P>$#!f-Av^Hv;g@T}T z$2ynUqPS~WZK!Y6TV-k)o~P{(!-IpXCh?xxsY*mfLfj5RJJx1yCw_B9@QvTeh;UUM zM~uFf9zoEqE9l)p*at-Z4kCB)epv}gYLgmEJ@(B_b_9kt%XjoRqq%ZlSju)4dP2tO z%fmAEqlD>0s8nKxk=LaIOBziaFAA>V-skKx2|y7pcXb+Sdr*wDli@Cf3v$f)$7ZErg6&|k4~CYl^kYv7SM1p z@YH7h?u*1h7D^ci>f1Tc9eE zlH-k$Asoa2mRSgR&YvOHD-SnZ)QlN#wy)Tu(Bi%?liV+sDN-nNS5pq#f3vZfCV&;< zW78=sPeQ2=9`fX0r9Op!uhq6f-#uFt2;uT0__lOd;0y4#&Hi`6aMX-2eRz|LA5TGM zUIbjbVQ^%$ASvs=Q>-4rjn_2lM8H3vH{QtGv8JVDA?|_QnFyq-h$vilvVv~bY-U!R zZwfTy0r?VafsJtn7%2f{EkB3(|8!x!aITl)b5nU>fRvm>BB+JIB~;)c5$;^1d^+qw z)EA}}t-62B4WqFH^rj+c-}O+0l9zhGci$g(XbQaMXut0+Asx0^(f3ot;akq%1wuCq zWz^qGX*9jx^H(BW8ZhK@&qrf23pboh0h!En09Zp21{$4l6K z?UQKWWmwXiwkv5;Ben~fJx?zHdg)VcbGozxxOh}$c>s9b_d2P=ez0NKsm6GLeJDYw%Vx$91FcjCqm|1xm(`N9|4{j4OYy0+Chx6>B z+Bl_{L^SB?h?hFwtYdLUDLfTykQd8Bj2F=5D>iJZY(Mk`gaDoH${V-X*c2|-Ss85- z|5PytG2Ti+bb+}}hAs=%;%P`})c)!OiJBB0P1%EBTOYI42OGg)PUcOVy2^a(iqTjA zI-6d6*}8Cw>=}P+JU&nc$_Z2c6kuB&@JdZGy_8%xHT{A?4W=?fL!@WuOORCOm;Eef zS$}XfxG0wW^DG@-Yjc{*v2~-dXn4J`Pp>PoO#`H@6A3W^?RE)b__j5X9#)y$K%A$< zC$cXMd!gM$mNQjkd_-xhHVTZ)Kn>&xC)<+2NIBHEwe#)bI$L%SodZ{XeBp*2s|P%R YE*w*`Csit)|M`I!>X}?FzGQ#@-xsWn;Q#;t literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_combined_continue-members.html b/trunk/paradiseo-eo/doc/html/classeo_combined_continue-members.html new file mode 100644 index 000000000..08c8d5bf1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_combined_continue-members.html @@ -0,0 +1,29 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoCombinedContinue< EOT > Member List

This is the complete list of members for eoCombinedContinue< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + +
add(eoContinue< EOT > &_cont) (defined in eoCombinedContinue< EOT >)eoCombinedContinue< EOT > [inline]
className(void) const (defined in eoCombinedContinue< EOT >)eoCombinedContinue< EOT > [inline, virtual]
continuators (defined in eoCombinedContinue< EOT >)eoCombinedContinue< EOT > [private]
eoCombinedContinue(eoContinue< EOT > &_cont)eoCombinedContinue< EOT > [inline]
eoCombinedContinue(eoContinue< EOT > &_cont1, eoContinue< EOT > &_cont2)eoCombinedContinue< EOT > [inline]
FitnessType typedefeoCombinedContinue< EOT >
functor_category()eoUF< const eoPop< EOT > &, bool > [inline, static]
operator()(const eoPop< EOT > &_pop)eoCombinedContinue< EOT > [inline, virtual]
printOn(std::ostream &__os) const eoContinue< EOT > [inline, virtual]
readFrom(std::istream &__is)eoContinue< EOT > [inline, virtual]
removeLast(void) (defined in eoCombinedContinue< EOT >)eoCombinedContinue< EOT > [inline]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_combined_continue.html b/trunk/paradiseo-eo/doc/html/classeo_combined_continue.html new file mode 100644 index 000000000..9235ca115 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_combined_continue.html @@ -0,0 +1,74 @@ + + +EO: eoCombinedContinue< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoCombinedContinue< EOT > Class Template Reference

Combined continuators - logical AND: Continues until one of the embedded continuators says halt! +More... +

+#include <eoCombinedContinue.h> +

+

Inheritance diagram for eoCombinedContinue< EOT >: +

+ +eoContinue< EOT > +eoUF< const eoPop< EOT > &, bool > +eoPersistent +eoFunctorBase +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::Fitness FitnessType
 Define Fitness.

Public Member Functions

+ eoCombinedContinue (eoContinue< EOT > &_cont)
 Ctor, make sure that at least on continuator is present.
+ eoCombinedContinue (eoContinue< EOT > &_cont1, eoContinue< EOT > &_cont2)
 Ctor - for historical reasons ... should disspear some day.
+void add (eoContinue< EOT > &_cont)
+void removeLast (void)
+virtual bool operator() (const eoPop< EOT > &_pop)
 Returns false when one of the embedded continuators say so (logical and).
+virtual std::string className (void) const

Private Attributes

+std::vector< eoContinue< EOT > * > continuators
+

Detailed Description

+

template<class EOT>
+ class eoCombinedContinue< EOT >

+ +Combined continuators - logical AND: Continues until one of the embedded continuators says halt! +

+20/11/00 MS: Changed the 2-continuator construct to a std::vector<eoContinue<EOT> > to be consistent with other Combined constructs and allow to easily handle more than 2 continuators

+02/2003 Ramón Casero Cañas - added the removeLast() method +

+ +

+Definition at line 42 of file eoCombinedContinue.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_combined_continue.png b/trunk/paradiseo-eo/doc/html/classeo_combined_continue.png new file mode 100644 index 0000000000000000000000000000000000000000..295ead493f8216ba17398cd4b98008a3794ffd9c GIT binary patch literal 2275 zcmbVOeK^$F9-kq1W)rfKR-4*h?~|pZj3#d-W%AM>Y#8GuB(GERi;QWc7a5dLLrl0O zd6^N(@%$QVz!q|SJVPlAq+3B|X+@8IA?{lB~$2sSFzMt>;ob!Cn_j{g` zigi7#wcKzy3aZnIjWk%iSDi*FgwZfP#6q(4s&q-vG{^_^zPGd&?^twy9g^c#Wb#-R%6M?#r`3a z`c)JLzN;oSr@c2?vabx@Ueg)2?!;GA$Ms5jx=za8Z)|di-GanLlC?f1(IkWAVK$E~ zttjJbB!f0ZOvD2z97?zV8V$ONt=?~63Y+eKU2R8#oPUiknBCqGf701AlxsPZjv6r< zWsFFE@{7NUURxgV_n3)6_)z~U+g_g=-M;HPA5}$fk@9SO0XfsdGQr0dpRmR1D9$Z7 z2%1=YpZBtVnDQ~;-EdtlJId&9rM$`Exxi&q=>B|I!OOIW@A#`u3DUdzJGs}p{cdfK zU%pS#mmlNWOwa(TH+1D?H8H?&?ol8UJ!1S*MZPqQxdV?Av41Ro!*(A}>~7gpwl?zl zn-hjZ5Qkzi?(o<>EP7D5`w-w!4>adRh;Cj^6R)vQ^bx2eMMnJwKY}svjNBa1J}yUe zIL!n@k>xkAwidz+%+2-@U7(%Sc*5-7njrjmvJI2hGFAE^Td1*)RYJ9ATra6~r<=`p zCL@E}YlKhRvcZ=}aGB(*XpzWMEs7_xnj-nus(CCeubVS>f(>c>AY9x@T|GnhV1S$(e-n_gED?jY3yNo#8>jtjU5#Y zEKPyD*DKEMuGB3~N0mqGZRgYgYdf3{R-{5;pUfQ;-kkoP6aj5k_SzmJa_;VM>kaH7 zZrHr8NCSg-@ZDROi6h!hGfNx$tHKGrU;PsFnt0(`q_9n7fI0j;8Eai&nyFq4ZunQ6 zeIMK>lbEzx#c<`GdhPFs76x&0|7XN7OS?DuGqUINHlL7FpSSsh2!3DwrvrRJERm*X z5*eSkdq!Bqq-`qb4nk0-0SVNAQy0*W?dU#5t|r*h)ek&0|Kyg9EoLqGvZ)kp8{4#h*EvLI2OQX;0WDkrX>dSnCw4k_8I8g}ZZda^t|mN6A?U4KYpY8z z3qO(YWFj$!BREs$OCQ9xhw?%eb^&oedzA*WLIMd%K~+{`ObZ~NzmElmBvTp&e(^dy zr6)4Ye(~bi!-Bqt{x6D;g?aHCEG$z&`CD8H`--Q=B4?#VKm1~8x$)KyI>HEQM&Q|B zgo2^^;Zt|(+;LWI#DCn+RiKTqgs%Z9Kh4~xBl~*V!H4mA=-?p6_+;yq*ey-*(4!iR%SV`M#ldSz|NfEACX79-W%3K-JO?(6u}$F}GZ<8d?}Q>&-fr z7z0{y+uXbh{Cf>{Yu+sR7Tg_lwKA9f9OvAs_URad=t{9F4J0@(RpXBkxcULhs-bQAjWx~{>XndCs~ zf6M__la|W{hvO|aSb>T0*4q0kqpB)lKuR0d+qrS*HvD0IjhbLx&ryNC z2YZ3U;KDmkjj%Kcj|ZLg@=5|n z=2O8S%moHIc=q%3ctwM(7L*SDyc`>6m9823!|A{ho)=jh8lv%FpHVxK-%^zpfzYbX zHa?Ww{fRDqD*UgtaipB9It1D*9r#0!Y}B2`C9$fY0{Tohr}a@AI{v+E<%1$&u=}v(-%!EE}Di6l>8cbzSmOOFq2_a%q%noXhAJbp6)r1 zp^xV42Nn5t+Z6f<1Q&_<#Hh?R%#$`hDE?5>XY1K33ULLp;CUP + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoCombinedInit< EOT > Member List

This is the complete list of members for eoCombinedInit< EOT >, including all inherited members.

+ + + + + + + + + + +
add(eoInit< EOT > &_init, double _rate, bool _verbose=false)eoCombinedInit< EOT > [inline]
className(void) const eoCombinedInit< EOT > [inline, virtual]
eoCombinedInit(eoInit< EOT > &_init, double _rate)eoCombinedInit< EOT > [inline]
functor_category()eoUF< EOT &, void > [inline, static]
initializers (defined in eoCombinedInit< EOT >)eoCombinedInit< EOT > [private]
operator()(EOT &_eo)eoCombinedInit< EOT > [inline, virtual]
printOn(std::ostream &_os)eoCombinedInit< EOT > [inline, virtual]
rates (defined in eoCombinedInit< EOT >)eoCombinedInit< EOT > [private]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< EOT &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_combined_init.html b/trunk/paradiseo-eo/doc/html/classeo_combined_init.html new file mode 100644 index 000000000..1fa97007a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_combined_init.html @@ -0,0 +1,106 @@ + + +EO: eoCombinedInit< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoCombinedInit< EOT > Class Template Reference

Combined INIT: a proportional recombination of eoInit objects. +More... +

+#include <eoCombinedInit.h> +

+

Inheritance diagram for eoCombinedInit< EOT >: +

+ +eoInit< EOT > +eoUF< EOT &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoCombinedInit (eoInit< EOT > &_init, double _rate)
 Ctor, make sure that at least one eoInit is present.
+void add (eoInit< EOT > &_init, double _rate, bool _verbose=false)
 The usual method to add objects to the combination note the _verbose parameter, that allows to print what's inside the combination with scaled rates.
+virtual void printOn (std::ostream &_os)
 outputs the operators and percentages
+virtual void operator() (EOT &_eo)
 Performs the init: chooses among all initializers using roulette wheel on the rates.
virtual std::string className (void) const
 className: Mandatory because of eoCombinedInit.

Private Attributes

+std::vector< eoInit< EOT > * > initializers
+std::vector< double > rates
+

Detailed Description

+

template<class EOT>
+ class eoCombinedInit< EOT >

+ +Combined INIT: a proportional recombination of eoInit objects. +

+ +

+Definition at line 35 of file eoCombinedInit.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
virtual std::string eoCombinedInit< EOT >::className ( void   )  const [inline, virtual]
+
+ + + + + +
+   + + +

+className: Mandatory because of eoCombinedInit. +

+SHould be pure virtual, but then we should go over the whole code to write the method for all derived classes ... MS 16/7/04 +

+Reimplemented from eoInit< EOT >. +

+Definition at line 81 of file eoCombinedInit.h. +

+Referenced by eoCombinedInit< EOT >::printOn().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_combined_init.png b/trunk/paradiseo-eo/doc/html/classeo_combined_init.png new file mode 100644 index 0000000000000000000000000000000000000000..0000f8273f752ba0aa40ef95c72ee0eebde06ffc GIT binary patch literal 1296 zcmeAS@N?(olHy`uVBq!ia0y~yVC(_153n!;$)~?OZviQZ0G|-o|Ns93ng9PEm_I*Z z0+0p92M!#lKJ@HLYjxn6Ukc;Z|C)uNJnW|sWddhNgbN^ojv{qkL#B)0FG zCE08!@i>!btDwvJlns6NkI!(uvaj=t%)|ipLgl+2zh}MM{>rvir}#||0mjYBum^Xf4b(l#L}%921XY*=s(Si5#m`G-uLNSn&BDq{JCGR z=bXE%(fm;SY7O_@t*w1Y6FNK8H%Tl$&6_%x%V18t($Ni>hQFs3tXnz7W6{Qg8{Rwi z8%$YVXcEM;dqqi1$|hEuLl-=?|8Sj54#*2!S)3QjIWZxlkNx6|Z-zeidVa6mcWlGN z8Q%?JOs+}TEe@C9Uo7~%t>kQBYv2UwVlm|i<(>)B7yV4#PX-j%*0rZm<(Pv|vO=ff zgd-9jNjxfsZoYq4{XKckQ(~%p+V8UxJqIN^B!a^GTR+8Qa<40SD0;JNP3iNOev)EL zZjYAhUfa6OM^|2|ZRU5LwmH)_CD)%4Kl!rBQl}@N^+oMcp0@Z9?~{u*rgXUp8g$Ib zzBFaO+r=9RH(a+qt&nC5l;JIUr*<*m-tJJ-KF(v)9@k!+G0D|6l4t%!ZJq@gcTV?a zET0ru)bOnB_R1@=N?JO6-+9xO;!Re|RNlqJ?Ku|W1E+aw8QPYlmDCYgLP^wpN1Wyl5$ z@5>VFieCBozDrMRIkmXd_Z@q}k6CvDWmR+~3Pm;S+*VktM2pQ_eRAq=Zf>r_vYSkI z{+1Dt*r#?~4#?!UP%v1gDcmc1jNK)9>k6RAkDVLegqWSzy}e4UJYGQJzId_$&=R&} zleUY;nCAsG+U047Dof;wY%puO=)ssxw2L47OpuYV-RQRj=;3TvX-1|NrVP<1+$tJ@!ifI&!Q1-p}$X;kKF4*;ns>UBmxttJRF+ z!wI)){ZD`W^`D{j;_RnJJ1pgXHU8@Rl3n~_>(Q;DCM#|ye0km4+L$Q&t$l~B1lMHg zLX&GU`G*4RZSNfY@cd2Vp|2+wMHTMRmb&X_vdhP0mk6_pRM|s`^)_rryH~{%V{JT`~97<9q*?BuX%6N*r?ld&82O`2*wmdRvj1 VGrISv7Xyng22WQ%mvv4FO#l)>RNnvq literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_comma_replacement-members.html b/trunk/paradiseo-eo/doc/html/classeo_comma_replacement-members.html new file mode 100644 index 000000000..6bceceab8 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_comma_replacement-members.html @@ -0,0 +1,22 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoCommaReplacement< EOT > Member List

This is the complete list of members for eoCommaReplacement< EOT >, including all inherited members.

+ + + + + + + + +
eoCommaReplacement() (defined in eoCommaReplacement< EOT >)eoCommaReplacement< EOT > [inline]
eoMergeReduce(eoMerge< EOT > &_merge, eoReduce< EOT > &_reduce) (defined in eoMergeReduce< EOT >)eoMergeReduce< EOT > [inline]
functor_category()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
no_elite (defined in eoCommaReplacement< EOT >)eoCommaReplacement< EOT > [private]
operator()(eoPop< EOT > &_parents, eoPop< EOT > &_offspring)eoMergeReduce< EOT > [inline, virtual]
truncate (defined in eoCommaReplacement< EOT >)eoCommaReplacement< EOT > [private]
~eoBF()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_comma_replacement.html b/trunk/paradiseo-eo/doc/html/classeo_comma_replacement.html new file mode 100644 index 000000000..04ad81033 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_comma_replacement.html @@ -0,0 +1,46 @@ + + +EO: eoCommaReplacement< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoCommaReplacement< EOT > Class Template Reference

ES type of replacement strategy: ignore parents, truncate offspring. +More... +

+#include <eoMergeReduce.h> +

+

Inheritance diagram for eoCommaReplacement< EOT >: +

+ +eoMergeReduce< EOT > +eoReplacement< EOT > +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + +

Private Attributes

+eoNoElitism< EOT > no_elite
+eoTruncate< EOT > truncate
+

Detailed Description

+

template<class EOT>
+ class eoCommaReplacement< EOT >

+ +ES type of replacement strategy: ignore parents, truncate offspring. +

+ +

+Definition at line 87 of file eoMergeReduce.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_comma_replacement.png b/trunk/paradiseo-eo/doc/html/classeo_comma_replacement.png new file mode 100644 index 0000000000000000000000000000000000000000..df6bfe5e10fddc6178b383931411d4ef9a432f59 GIT binary patch literal 2208 zcmb_eX;c%&7UrofAcjzpM+lk}6_KC<8g>L^OW83Ypt1>32~a@xNPx5)6j=hTK=HAK zeKC+|71c`OH52c+sgcs6E1f-_m>Abx<~HXmBRd!0sflm8d__n*VgkhJqbLi zeHnpU$Dx4PXsdC)*3a#%u9^o$y~~rRkkATL$d-?x65$TJjU8_bm%hj7d!q{mBTyrC zJEvbm=IcjU(dn8Oj7CC1e4otBvKMQVssW0|aL!cWcwWC+Ct@bO>f7i5=U#NPF;7N~ zjejqD4m#C^Kl>bBjX1>Qf8AO!nBk|uiU=6XTuK>pt;V}tZdTi9zQ6&lb_`tC49sHw z8hENvaL;Si=hlik`et&(2f*4iFZq03_agJeSw@jTUq$CmNO4(VLvZ;>lpOkLnq!zrk@}mJ@`Ilh3}D=AiMpQEt)q{FRTML4OJU$z@JM{iHmt#D(i9o{r^ zAJfWLQp&Y3G(lvK!MjjeQfUB~^-k?nZhV|o9cLWy5 z9RHU^aopAhkNYjP2(Lcm95zfA7*R4~Cq3FD<>*BT*zrK=eoG||dUj`|X%SZydCb=* zZ_~^WmkpFl$%X`tk-z)Ert3+SuH5l9@j|F8$}Ny?j_1!VKncccFQ42syHRWiy|pbV zn}B$QxMS2KkSqv>!&5)rdG`F!roM!N4=rk%_%Mrd=kT<}gR|yK z%+4p1YRmZU+zGUJPT8O-&*#b};u}(vFm2KIwVV2y=fMDDD49vS%AN&AA zo3TP9HSOShn8ghAmRn^sk!+_anYbRzgob_dfhlgOw_eYUdk?%|luD))4YmK`_qJ}0 z9KKtUK^z4Ox3zX-pwP%;dSl`7{DQgHXTWmfo)u~3fO|o-G4H0vCH?-_Q8kN>suf6W z>onFV*|1GkHRCSUairofe0N;w=gZ32?Yv@Zw_cq8U#QIvFkC$)l%{(alM+-JQxSLq zOuGoxo)v27J(GNSa6+4d{hyTBi|&7g{O_C|@h(fnQx2sCf8A7e8{_HA7se-#^|anL z3h!2_%|QBjO!YIK9%zQ9sQ1|>n4PBhx{+lL9brm_Lrnpwk(*j~#|wB_1wcZ?opku_ z$ruUECCop6>aDS^zY^ut;GmG8f66N$1v-BwOPk_Ef90SPa=S^y_t>W(QqWZd3 z#-8k;Pzr*bhC4PdvNrF0zXd_u)+A~d@SYDF-#l-{#4$A3~GQ?xJF6o1b zl+B@`30%#~HZ^eCwDfJ0TG3t<75cL5LXTesLR=Z)6P750?a@FIBXg8KfZSq|C+1G9@MmMw0}ak$o78f{owqu1b(4vcyVeYY z#?<8oUilJjqS2M5hlhb8wIX#Ob6xZEoQcXAySF3*qA*3yFMJaf;feOin?%bmOzF+g zdOFTJY%SQmjbJopec>@IxVRJXJhMT$dpB6$Q23<)&Dq4!7@p3t%IpbrD^7ml^=3@$ zQD7~dsi8%me?)G2v~A5;>Ei`pqB$^M_wp@n0o=A!X9i4oFbqNVPAE=pa0lD!(|qu9 zd~Q%05HCZAx@%*w*voML)C?%&@eS1AAh literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_continue-members.html b/trunk/paradiseo-eo/doc/html/classeo_continue-members.html new file mode 100644 index 000000000..3f70ab2b4 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_continue-members.html @@ -0,0 +1,23 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoContinue< EOT > Member List

This is the complete list of members for eoContinue< EOT >, including all inherited members.

+ + + + + + + + + +
className(void) const (defined in eoContinue< EOT >)eoContinue< EOT > [inline, virtual]
functor_category()eoUF< const eoPop< EOT > &, bool > [inline, static]
operator()(const eoPop< EOT > &)=0eoUF< const eoPop< EOT > &, bool > [pure virtual]
printOn(std::ostream &__os) const eoContinue< EOT > [inline, virtual]
readFrom(std::istream &__is)eoContinue< EOT > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_continue.html b/trunk/paradiseo-eo/doc/html/classeo_continue.html new file mode 100644 index 000000000..73df84cd7 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_continue.html @@ -0,0 +1,152 @@ + + +EO: eoContinue< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoContinue< EOT > Class Template Reference

Termination condition for the genetic algorithm Takes the population as input, returns true for continue, false for termination. +More... +

+#include <eoContinue.h> +

+

Inheritance diagram for eoContinue< EOT >: +

+ +eoUF< const eoPop< EOT > &, bool > +eoPersistent +eoFunctorBase +eoPrintable +eoCheckPoint< EOT > +eoCombinedContinue< EOT > +eoCtrlCContinue< EOT > +eoEvalContinue< EOT > +eoFitContinue< EOT > +eoGenContinue< EOT > +eoSteadyFitContinue< EOT > + +List of all members. + + + + + + + + + + +

Public Member Functions

+virtual std::string className (void) const
void readFrom (std::istream &__is)
 Read object.
void printOn (std::ostream &__os) const
 Write object.
+

Detailed Description

+

template<class EOT>
+ class eoContinue< EOT >

+ +Termination condition for the genetic algorithm Takes the population as input, returns true for continue, false for termination. +

+ +

+Definition at line 37 of file eoContinue.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
void eoContinue< EOT >::readFrom ( std::istream &  __is  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Read object. +

+

Parameters:
+ + +
_is A std::istream.
+
+
Exceptions:
+ + +
runtime_std::exception If a valid object can't be read.
+
+ +

+Implements eoPersistent. +

+Reimplemented in eoGenContinue< EOT >. +

+Definition at line 42 of file eoContinue.h.

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
void eoContinue< EOT >::printOn ( std::ostream &  __os  )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Write object. +

+It's called printOn since it prints the object on a stream.

Parameters:
+ + +
_os A std::ostream.
+
+ +

+Implements eoPrintable. +

+Reimplemented in eoGenContinue< EOT >. +

+Definition at line 47 of file eoContinue.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_continue.png b/trunk/paradiseo-eo/doc/html/classeo_continue.png new file mode 100644 index 0000000000000000000000000000000000000000..ceabfe0547c31d6bbf000454c5041f7dfdd0dc1c GIT binary patch literal 5497 zcmd^Dc~n!^z7C?*DudN4AXBVUYl(o$paw~=6hRrpS^+^Od03ee8N+yDMWBiSCxVI? zxl~X=f}jQna6lvo5mG@2Q#eHkVN4_eGAHjKzIE$*?Yp;ky>(yLdVid?e|tE4t@HbS z-}mjaFSxlnXs*;>i9jGU4?2GHEdrrlhd?ZGT&fO_Jek^Z4sP_^oWHYIsZ?;NQq_~m z{+HqC{Zn6GpZHug0(aG-zjZx|_Ng34$1yM_ClzsKQJ zTeGRM+Nz1X?G2}R8+O`wo5b>KpzShL`;xL=5Sk|EHL-CRO39t3;9!yLff-~t=C-eH zzd%@PH0--vE609A=j8R7!s*G5 zteSulHda!W&ZwEykv8Z1S$kD-h@E{D3-eC%Hh^)l<(Kg9lK7(7n}^m*G{+HJK*h{> zmdD-`EYs_DF&Y>!<&ACM7&Rll#oy+qnOrh`6Le=4IAro^t;~*^TnzI5{KUkJx38^K;U#W^KHCbUPx2??o{m#J zJhPyCP!eEVcQkPK8D5nT-7D$Ft&g7zEr(Xq!xl~pIw<1XH-W+-& zHfis~9)OaiD8#k$ejW*!re0z*)It2PDD=AYslc1gZ^b1@ELI8iKo%N|Fa{kYHz#o= z1@3@mDHzbne-b@Ut5o`0m4cnCiY9TEggWBA=E*W>4nI!qUFc`}T-@udEtK!cJ9F|! za34XrGU%lbeKJ_Oce~;%A$Mjo`fx(0WX~}@F4K=85sH=ggy6xAIfC05=FuGBIBQDY zdkr_JvXvgEyYfN?g=|Q`mrJr&L1H8N8!6Xq9sv8l0or=zL(P*!VuhB((oR)ZrVBS8 z6nFDoW&_|rbC_tZXDVZ42z0%U|MJ~Sd(@tN2%jTWWoyIkx}CDP>6QOV z%te-M8Yo!oO)W0zSu%x4|2KrtSP{r)>JPIMTM0dQlxM)SXdj>HpDtH^DG0402>Nvd zp&4+eO>Cs^^a97T^V?q2zfnUZ(jK=}b-7$^P8ZT4wtdZZFoQig(X$-)j!lAa-P`B) z3{n^_DGwhNqWi#Hh{i_$09DN#uJPU-?Q)2kM8+*gHm?%`ct)MuQ>d(Rhx8Mo*oQax zbn+y2^L70LO_3T}^&)ReWsBDSr{?(6p0i^&+)o5Xc+0k@2iWN6hkSd)x9o49fef~Z zk8W#w&ghZ!(+u1S`?fbOn=`*3l*JzEb$8tNAEPt5ezu~9Vg>e7ECbhDTSav)kzF^u zs|Fq&CXZ~$s%gc&+P9b2w{4vVp3A*V)nl2;u`94Ia8DC^BlcjL6WY}D-zC;|1AIDv za}3*co2!cz99p=<7tDB155|P8J7(&NdHsLkYZ zrBYctz>r(jru&$o8l!g*>P)%JVHw1c@3~HL<69HjwYkD553R=jc5;?crcwWtEED&F zqRXA5RZQo}`vg(LcqEL0GI_}1ir=u}8uaY4pZAF9eMiQU1rhwCQ*Dv`Tct^|1;9H; zeYmgUn9AL0FZmB7!{jLB*#rEGlE9bzme=x$|FJ40DFYTQ24&jsK#el>6(03k8&0U9 z&z@N}g?PU14-NEew)jLAcbn)pg>bU%RclZCb@>_2pqY^vYhUu#1_htFsUkpPIeHdi zN{)H&1zd6si?^fVn;N+0<^)cT1|dy3NntVrS||YxCuUf0X}@HHZ|8D;bf|fImnA;# z+R{i4h?7o6iLZJjCFxL~Lag@Jg3wnuu_9XmI0Kl9pOxj_Sy0YW24x3DtU2@pw7Psy zCKQ^S?_(@-WZU9gSG&RZ>ha!`$XF#5x=F z*h4Wt=nhc2gjlcJ)K^&}qAmW%!>EwO#*8X+%=A?#z^%Eb$y`P(I4Mc~%u}a-(z-CB ze~Vv$co&8kEHC`Nb}&GmmIy|u_ILpX@A`?r@~Fl+Yne+%#|q<8a8ArN^8}6qiNvSS ztcApgQ)HH(w5z0@Nn6I?pGnzlr=+oPGYNSrLpePg+6j2TVEL($ntW|AITB&CqOH&b z?3|sGT?YKN=`Q(Uq!!P?Tue<%gghY;yh{|KrX;t~#k{ zg!*w9Mus|uPv0G=N(QVb#c1v;ibn7?y@&b&*$NmO4wV=27mv_~G2YffUSSTu`T|X^ zybs+#8*Q;{BsaSB1@dC9vzp?4#=ydLoOxaagzZ}91R$3%PG%|E^UicQYCdL!XGT&A zu$7;yp75$YKXd9&&4#|`o|Xhjr|DMuk9p-sEFB(tjFjr1nwnPykw}q=UHjm6TPT{OX2WtqcTa^=1 zn0_&eWGz(2^es%0s4`#gQo*bZ;ZC=vFC!I3K8sJVBn)bzGRC5x zgmk6Nls+Rl@#w#|HdBv$1f>VRV+_le=eNuYK+~-6#W%(dz=8f>O4`;?3b?A z@$J@OerxQ;I<|g(-iHd1pe3k`+PBs^SMH4;v9`A9TdgM)RI+sr0^o8|(>zR+{tc<7 z^vC1-eb)x+rrSCW?H%k&78p1*31mykP|q0r@^!8rlIg-UjewBG%QRGpoSqD0%aPTV z%1LyC3drJo-~@SB7LJPzfs-4 zUGtX|@jaFc`u1m_>ViVlm+Q$?QIyAv@*7P^`(3?xtSdtj@%Xw}(`i^*Q^u*q$b=`D ztC03Z=%L!T)rS*3(n?}vne`TawI={FOU#X0(%00yGP&xvbFM-KV9II$_ zYk*LpxFQG4rO5628?v<=7k5ooxX}N0bYU0&c5HAOm_d40{lZ({Uqar817wR%pp=_7MZ&=$RZ)(S^smIQQ0Gq*2J#`YhaPAYGaz|h- zT=D(@;%*=lq15Brf&kJy@{nX;*^$mKBW9 z(tOqH`;(6$D17lnbgW|T!yf3J1fEf~#loWhN2(MG6hCudtuDN0urKm?S;Fb=)uYoR zcwN|(Z$S@-TyCS0;p`W*T&ws84cYQYc{?6w7M@l942aN`Qha+)yR9M z4vU17NfN&@Ve3=N>p&;Q8F56#=ci08mvY+?aT+NfjIp-cXy{vKXomh9cW0n zEP|Cu#45&-jvIr&#Ku=2Gp*^8$0wc;`J0a-GTN%Ff24Q=!S)}^EfTliaKd91(xwd^WMTAy)K;9~ItJeqM*IS_xm?xdBTSjKaRwOM;^X?7${&Vx6OaQk zA`|{&bDBZ_*rI)^?Q@iT^b7WswdPP#_MK)vjIFE!xOOMvzSe=p(~UD&+}42W02&{ivz z7P3+1xKS9eI$aXAKI>r2onu86kyY=y;cF%ZWt3^CrId#-nO|jY0O^K88qVDKYk;_C qlocv&rC3TusUKgaESRB$fb_qM-jyV@gzrfa2kl+IDc$dX?mq#(`TRNn literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_counted_dyn_update-members.html b/trunk/paradiseo-eo/doc/html/classeo_counted_dyn_update-members.html new file mode 100644 index 000000000..35a4a89ab --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_counted_dyn_update-members.html @@ -0,0 +1,25 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoCountedDynUpdate Member List

This is the complete list of members for eoCountedDynUpdate, including all inherited members.

+ + + + + + + + + + + +
className(void) const (defined in eoUpdater)eoUpdater [inline, virtual]
counter (defined in eoCountedDynUpdate)eoCountedDynUpdate [private]
eoCountedDynUpdate(eoUpdatable &_toUpdate, unsigned _interval) (defined in eoCountedDynUpdate)eoCountedDynUpdate [inline]
eoDynUpdater(eoUpdatable &_toUpdate) (defined in eoDynUpdater)eoDynUpdater [inline]
functor_category()eoF< void > [inline, static]
interval (defined in eoCountedDynUpdate)eoCountedDynUpdate [private]
lastCall() (defined in eoUpdater)eoUpdater [inline, virtual]
operator()(void)eoCountedDynUpdate [inline, virtual]
result_type typedefeoF< void >
~eoF()eoF< void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_counted_dyn_update.html b/trunk/paradiseo-eo/doc/html/classeo_counted_dyn_update.html new file mode 100644 index 000000000..ab4d17015 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_counted_dyn_update.html @@ -0,0 +1,51 @@ + + +EO: eoCountedDynUpdate Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoCountedDynUpdate Class Reference

An eoUpdater to update an eoUpdatable object every given tic. +More... +

+#include <eoUpdatable.h> +

+

Inheritance diagram for eoCountedDynUpdate: +

+ +eoDynUpdater +eoUpdater +eoF< void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + +

Public Member Functions

+ eoCountedDynUpdate (eoUpdatable &_toUpdate, unsigned _interval)
+void operator() (void)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+const unsigned interval
+unsigned counter
+

Detailed Description

+An eoUpdater to update an eoUpdatable object every given tic. +

+ +

+Definition at line 93 of file eoUpdatable.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_counted_dyn_update.png b/trunk/paradiseo-eo/doc/html/classeo_counted_dyn_update.png new file mode 100644 index 0000000000000000000000000000000000000000..658c2c5eb6fba65f26afefd49d43214eff373cbf GIT binary patch literal 830 zcmV-E1Ht@>P)|SV}`u;~)s`wRA&?d%>#bj){8oxm>!D>eR`M&&8zn8CzAcKen zz~U{Y=qY6V7E=_rZ5xQ|fdxja`$3?H3sBfHLN#u)kMNlbMg*v8{lQW+zQuK)+6X}D zc_fSpMLURVSM;Pp_;P?QXFc$no-D@*A8kFr2V)XCWox82CdKS5;M=;0pB+CYfY_Uz zi$#zZAXAo%Zu#jqxe59FeF*aN`8))9(Ci2zh#-OpBFIE!%0td`p4r}kRJn1?%1$D! z;5brbUxBkeU~w2J@<0cc0ZQC_Xc*y)Z>5IxajP_toEwMch%02Pw0e?qX&8B-Rodl1Qs8_EPj5J3bHL=Zt9hfI0MdCoK2YmmIR zi|KGTl9Dg9wEu`$Y#WavISoYXbH8HS_zJRwEHv%24kIZwP6$Q(Ui5fRmI?`%v-3T~ z=`k5b!tC%~cbXjx+s4Dl`pUZH|3QX|AT4Cdk}+lRx(AWGxS>oi1QA3KK?D)xambX1 zoaa2Vy#XmUiw6?h9i+&PE+Cw6ar%kjKdA?@;~I%cV?baiJMJK3*>R1y5zPn=X2;u} zED=fj#NF(8_j2q~BFEYB&g}4g;y0TIvg6M8C!1Qc93goguOqfuJ=>GvB1j9FvSdtI zyzW6HFK#Fk3_%1DL=Zs)c^m@Y7o*JgeHEmGXedP;Um%CIitSB0REUWuu8|^qgt$MY z!8hescOtl;t1BQxnGhpHYuDNs|2cP(5pF>ZeSqEqy>J~8!ZG(tpJ>l&{>yuaNl4L? zfcUDa5r8J*Ml>U)M(89uGxbF6^h8BOnHmX~qpHi{X-MNxjtQNck@lE`+2Q*n%?P#g zb-quuir0{5$CR@(Qgox1@2^25H@lALX7y}Oj*1{HWX6*554Pf<-K$G}Gynhq07*qo IM6N<$f?L{qMgRZ+ literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_counted_state_saver-members.html b/trunk/paradiseo-eo/doc/html/classeo_counted_state_saver-members.html new file mode 100644 index 000000000..b903f6355 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_counted_state_saver-members.html @@ -0,0 +1,30 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoCountedStateSaver Member List

This is the complete list of members for eoCountedStateSaver, including all inherited members.

+ + + + + + + + + + + + + + + + +
className(void) const (defined in eoCountedStateSaver)eoCountedStateSaver [inline, virtual]
counter (defined in eoCountedStateSaver)eoCountedStateSaver [private]
doItNow(void) (defined in eoCountedStateSaver)eoCountedStateSaver [private]
eoCountedStateSaver(unsigned _interval, const eoState &_state, std::string _prefix, bool _saveOnLastCall, std::string _extension="sav", unsigned _counter=0) (defined in eoCountedStateSaver)eoCountedStateSaver [inline]
eoCountedStateSaver(unsigned _interval, const eoState &_state, std::string _prefix="state", std::string _extension="sav", unsigned _counter=0) (defined in eoCountedStateSaver)eoCountedStateSaver [inline]
extension (defined in eoCountedStateSaver)eoCountedStateSaver [private]
functor_category()eoF< void > [inline, static]
interval (defined in eoCountedStateSaver)eoCountedStateSaver [private]
lastCall(void) (defined in eoCountedStateSaver)eoCountedStateSaver [virtual]
operator()(void)eoCountedStateSaver [virtual]
prefix (defined in eoCountedStateSaver)eoCountedStateSaver [private]
result_type typedefeoF< void >
saveOnLastCall (defined in eoCountedStateSaver)eoCountedStateSaver [private]
state (defined in eoCountedStateSaver)eoCountedStateSaver [private]
~eoF()eoF< void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_counted_state_saver.html b/trunk/paradiseo-eo/doc/html/classeo_counted_state_saver.html new file mode 100644 index 000000000..fec0a6983 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_counted_state_saver.html @@ -0,0 +1,75 @@ + + +EO: eoCountedStateSaver Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoCountedStateSaver Class Reference

an eoUpdater that saves a state every given generations +More... +

+#include <eoUpdater.h> +

+

Inheritance diagram for eoCountedStateSaver: +

+ +eoUpdater +eoF< void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoCountedStateSaver (unsigned _interval, const eoState &_state, std::string _prefix, bool _saveOnLastCall, std::string _extension="sav", unsigned _counter=0)
+ eoCountedStateSaver (unsigned _interval, const eoState &_state, std::string _prefix="state", std::string _extension="sav", unsigned _counter=0)
+virtual void lastCall (void)
+void operator() (void)
 The pure virtual function that needs to be implemented by the subclass.
+virtual std::string className (void) const

Private Member Functions

+void doItNow (void)

Private Attributes

+const eoState & state
+const unsigned interval
+unsigned counter
+bool saveOnLastCall
+const std::string prefix
+const std::string extension
+

Detailed Description

+an eoUpdater that saves a state every given generations +

+ +

+Definition at line 127 of file eoUpdater.h.

The documentation for this class was generated from the following files: +
Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_counted_state_saver.png b/trunk/paradiseo-eo/doc/html/classeo_counted_state_saver.png new file mode 100644 index 0000000000000000000000000000000000000000..91ba36fdddb2b65765a158724bcde08d1b2ceb40 GIT binary patch literal 698 zcmV;r0!96aP)~wY0000OP)t-s|Ns90 z00960z@MLBkN^MxkN^Mxkifved&2+Z00001bW%=J06^y0W&i*JP)S5VRCt{2*-?(; zAPfLd_?d6)8;}#MW-hc}z5fvw8{LUQP zml3H6MR$;tSIuOF@Z|tqPFwiROqSmfevRt_|56i~R9qu_HK|r-ft;Hnd3AD40C8`1 z-W-P90GV>j*d1T{DIY=}e=mZ3JsuZ9F0?v^7-EPah8QvtnevcxooBXtAgkWEbY%yT zUT_?#x-a2k4n!PAsy;A*b$}YT92!Qr<7-rDAGb;edG^MVj@Teur8g7pjU|1B49#R+ zliZpgtI1|{xG6ulI&Ta^Zh%a=WlXtweFm|$g2oa;QZ-3EE? z?V`SX8qwwpBkeyTR@=s-$g>T^n0vo!+xQ)1kuFsCS%(pAjTNCt-isce$+AM^a$fu& z;&4rd5m_DH>(* z1VQ*L7rdx+2=vCEQ$FQ!4xbq`iB1Oh8VQP|sFy4~a!({E0?MuHT(zMS$sSEQ;*jd(@8YcEGuhi9oP5`0-53e&>yib+zg4pcKa gI}Eu2GUJx<4{V;lae9q|P5=M^07*qoM6N<$g1(p~b^rhX literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_ctrl_c_continue-members.html b/trunk/paradiseo-eo/doc/html/classeo_ctrl_c_continue-members.html new file mode 100644 index 000000000..1edc9259c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_ctrl_c_continue-members.html @@ -0,0 +1,24 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoCtrlCContinue< EOT > Member List

This is the complete list of members for eoCtrlCContinue< EOT >, including all inherited members.

+ + + + + + + + + + +
className(void) const (defined in eoCtrlCContinue< EOT >)eoCtrlCContinue< EOT > [inline, virtual]
eoCtrlCContinue()eoCtrlCContinue< EOT > [inline]
functor_category()eoUF< const eoPop< EOT > &, bool > [inline, static]
operator()(const eoPop< EOT > &_vEO)eoCtrlCContinue< EOT > [inline, virtual]
printOn(std::ostream &__os) const eoContinue< EOT > [inline, virtual]
readFrom(std::istream &__is)eoContinue< EOT > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_ctrl_c_continue.html b/trunk/paradiseo-eo/doc/html/classeo_ctrl_c_continue.html new file mode 100644 index 000000000..f15be87db --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_ctrl_c_continue.html @@ -0,0 +1,52 @@ + + +EO: eoCtrlCContinue< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoCtrlCContinue< EOT > Class Template Reference

Ctrl C handling: this eoContinue tells whether the user pressed Ctrl C. +More... +

+#include <eoCtrlCContinue.h> +

+

Inheritance diagram for eoCtrlCContinue< EOT >: +

+ +eoContinue< EOT > +eoUF< const eoPop< EOT > &, bool > +eoPersistent +eoFunctorBase +eoPrintable + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoCtrlCContinue ()
 Ctor : installs the signal handler.
+virtual bool operator() (const eoPop< EOT > &_vEO)
 Returns false when Ctrl C has been typed in reached.
+virtual std::string className (void) const
+

Detailed Description

+

template<class EOT>
+ class eoCtrlCContinue< EOT >

+ +Ctrl C handling: this eoContinue tells whether the user pressed Ctrl C. +

+ +

+Definition at line 45 of file eoCtrlCContinue.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_ctrl_c_continue.png b/trunk/paradiseo-eo/doc/html/classeo_ctrl_c_continue.png new file mode 100644 index 0000000000000000000000000000000000000000..d65802c7c0b27ad481ce166ec53cb94a0fe0d362 GIT binary patch literal 2273 zcma)8c~Dc=9u6p2K^7H6LG;~$>nl5l*?O+i!a`Vqff1+ zr6u91d;%US#Jahf~SVCVOcMPkeWc8+_ z0S5|FlgCy7k68h#7=a3p{U%CWcHeW+vXH;XQi`W>gSy(5%d4vG0<&=K+xl2zAyer! zaRYnF#?lAe)mP$o{)@c|av!%3R#-b@M&hBKK=7y+VR5kHC_#U%cYO8g+q}pk=K-HBVhA`hV{&3%r>ty7E^m(7#^+odgFo0ODasp36rDr?s5U*NOI z!MdK356Q=-?bvRicy7PxW-zcRZuNMcwDH-&}>TNBR*W z>+G7#xa~XMP6h@J=3lsE?sqoS_u0)|iCGpkV9awtf4$Df-AOrU)_ASf6V$>1QeLIu zVM_N+gOJ~_fT?*!1A|8#Y$z{$2|Z{OG4Vg;3LrK*xvj|GpKpLy)&uFIvI^COLze9@ zOsZ#`zp57VJ~R6~Slyu0zh`GS;Ncgg-|X4(7!-7fhn?u5?AB5UGoG@?Ed~fx|Z0% z2C?7{9Kdg@`Pu1v0`;m!pHSiP6V#Hy<-_Oh9jFDQ1n&gZligPYK2W+eV}`4lkk0`% z3@rqur`Gm;JZHaXK*B$*VUk`4?CYdVL-uz@ZbxwICq@1%bp&_yv23XR@I6`9EK4dv zVgxpTP(6=nCp<}IDmAVR!%{-5tLi95ptv3~KAae_=Y`NLY6u!Sj!=*zGQqlm5@vrI zZKal@j65Pml{MfadSbyQ-HwpO|xJ{Ef|M6)8jcz;fIl~RefDL~zGJv^1RiT95g z#Bmt5)nQAy^#*JQ%#gN`IRrB(Z)6<*;D$5z{@{i)M-FVj|FY`!za`EoHne$B>IO6H z?I6Xbq`}w@1u*;?nr%h#rn(-(Jla+6uF9h;iFt~DnNBcEc1ZTD8kJF4XIA4K;~Hz4 zY0VFOsyI+z;sK&1Rm!je%rHyFROX)YgrhQy$sJFeY}>s;#_(*wl){bMdN)k*tjv&3ze_ zYD3ZBn96v1LBy;i(yG;g$3UTOE$>BIIPYkEg%jV}T6({IKj*DS9mTlyrUBk+rIf$Y zM%sEQ8az&zcGE##-g8?t)mCh1>H+AEj%c%3C^A}-`BCItsA&{|&u^D)=P-Hahbgu| z9MR9eE@0@YYFZjrc-)gi2Rl7a;8I=sTyWt)_?&h>G&|3Xa=h`}yU0_RRx5>Yk{4Rm zPClds1D7K=cvE3m3G;0RnFD@vUMD_9I{4Uk&v$}~Od_ykFdid>GQ*xeR$q?C3YEx7lwjg{@qYWI3#v51y*+9m|@pgtlJR@diCK3LG23od*O z?8{mnMSYcw{*&~cp5=7sWAtolEUFcGbLyu6<2OmT%`M_?6%5C+r@Sj86_j)Pw!P=C zZcprM+}}^urs9+DpCzeP&vwj$4^gOblx2aJf;etk35=SZrAb@=k1W#~s4$%B-5B;m zk~D8ZqS5*y8six=k9;rCtL=O^WEi@b+1nP|0|rQ`7Dmxt8rA4eMIx88e`}5z4O!l4 zQU?k)-KRG~)tKUsV7 zThM(=B=RNq7=X@I|0vo;3@v;14%wc+XsHO!nLlKzW}`VqYqV5mQRzEL!*nccYZoy@ z&n92yuvVlH_ZS%9BuFHLcn24~Kw6N~#bj0dic?RJeA0;i`+cmBmND6z_snNXPSDx8 zM6M-w{Qw9&elB6^XFyIR(pS7hl-T!I_|wwJXV<4eaRn+ouS@PGbK=Y7LcNe&vvTaC zCwyQCD?G%5y1ezng(CBqw)ZEy>n3Pg;% + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDetBitFlip< Chrom > Member List

This is the complete list of members for eoDetBitFlip< Chrom >, including all inherited members.

+ + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< Chrom >)eoOp< Chrom >
className() const eoDetBitFlip< Chrom > [inline, virtual]
eoDetBitFlip(const unsigned &_num_bit=1)eoDetBitFlip< Chrom > [inline]
eoMonOp()eoMonOp< Chrom > [inline]
eoOp(OpType _type)eoOp< Chrom > [inline]
eoOp(const eoOp &_eop)eoOp< Chrom > [inline]
functor_category()eoUF< Chrom &, bool > [inline, static]
general enum value (defined in eoOp< Chrom >)eoOp< Chrom >
getType() const eoOp< Chrom > [inline]
num_bit (defined in eoDetBitFlip< Chrom >)eoDetBitFlip< Chrom > [private]
operator()(Chrom &chrom)eoDetBitFlip< Chrom > [inline, virtual]
quadratic enum value (defined in eoOp< Chrom >)eoOp< Chrom >
unary enum value (defined in eoOp< Chrom >)eoOp< Chrom >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< Chrom > [inline, virtual]
~eoUF()eoUF< Chrom &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_det_bit_flip.html b/trunk/paradiseo-eo/doc/html/classeo_det_bit_flip.html new file mode 100644 index 000000000..96a68072a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_det_bit_flip.html @@ -0,0 +1,143 @@ + + +EO: eoDetBitFlip< Chrom > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDetBitFlip< Chrom > Class Template Reference
+ +[Bitstring] +

eoDetBitFlip --> changes exactly k bits +More... +

+#include <ga/eoBitOp.h> +

+

Inheritance diagram for eoDetBitFlip< Chrom >: +

+ +eoMonOp< Chrom > +eoOp< Chrom > +eoUF< Chrom &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + +

Public Member Functions

 eoDetBitFlip (const unsigned &_num_bit=1)
 (Default) Constructor.
+virtual std::string className () const
 The class name.
bool operator() (Chrom &chrom)
 Change num_bit bits.

Private Attributes

+unsigned num_bit
+

Detailed Description

+

template<class Chrom>
+ class eoDetBitFlip< Chrom >

+ +eoDetBitFlip --> changes exactly k bits +

+ +

+Definition at line 67 of file eoBitOp.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class Chrom>
eoDetBitFlip< Chrom >::eoDetBitFlip ( const unsigned &  _num_bit = 1  )  [inline]
+
+ + + + + +
+   + + +

+(Default) Constructor. +

+

Parameters:
+ + +
_num_bit The number of bits to change default is one - equivalent to eoOneBitFlip then
+
+ +

+Definition at line 75 of file eoBitOp.h.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class Chrom>
bool eoDetBitFlip< Chrom >::operator() ( Chrom &  chrom  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Change num_bit bits. +

+

Parameters:
+ + +
chrom The cromosome which one bit is going to be changed.
+
+ +

+Implements eoUF< Chrom &, bool >. +

+Definition at line 84 of file eoBitOp.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_det_bit_flip.png b/trunk/paradiseo-eo/doc/html/classeo_det_bit_flip.png new file mode 100644 index 0000000000000000000000000000000000000000..e40a72719e030ff22f7cc2a5b1c63d6d5cbab278 GIT binary patch literal 1571 zcmai!do#{6V2|B)tZdRW%l=DT!zX05{9f~bfipCy0BAz4H_z> zXfPDXWs=;AS+sK9+=q&^A*Mp9h+}rzj9+Cz%x}zH`kw~OcA`$XiQ`3Dq&3TqWh*iwVjH z=H!R>WMcd(4)`l~ztmoyyYzO%n6|Lsa6RA3&5AZqR5G zP)DFdRmw`-hH<>wt%7c4{85bl##GgTg4DCj!0HJbkTO;|=QyfghkPTalxfT2leATD8i}a~=ejSj$ z1{muF4<2&lJUSd~&(0JP!08t7)#&v89!-vw@g)VwoP%t?&W;7TI|0o3FhY>``4l^# zs1ggD#fBuOVp_9wc2?LJ1m3IH?ZDw}k;4ul^1L^VMS+W2b5Hi)-#ZYxPbLdWrYRWN zQmMv^A<4X;iJd{Q1$Rz&kNlud;TAk>X81Eap3A`Zu!NP>t^rk64Hz$p2 zZo0I@(2v|mdzIWYMlP=794X(m$-RggUi-Kc_F4?v1m`C-;g5$uufY)C-{fO9YGE}^ zO`_YwtF9uUa^y;;X4-y$OY1u6A)hAs5ej5MJGrVX4TfRwWI zmdBa^(d0OIa+@twr9p;N(3=wA@kK> zkicCHTyK#LpX-G&j?s~xUjk@v7a-P5vS;dNBx`@|7d!yo2EU}kyqZSMKvu%iZ{PpvzyLF2tm*u zIX@$HJ&K8-Gru~l=|yF)H^Ai5aWy8h<0bfTl|U?-@Q!ifI|)2ON? literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_det_select-members.html b/trunk/paradiseo-eo/doc/html/classeo_det_select-members.html new file mode 100644 index 000000000..2af3f5374 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_det_select-members.html @@ -0,0 +1,20 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDetSelect< EOT > Member List

This is the complete list of members for eoDetSelect< EOT >, including all inherited members.

+ + + + + + +
eoDetSelect(double _rate=1.0, bool _interpret_as_rate=true)eoDetSelect< EOT > [inline]
functor_category()eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
howMany (defined in eoDetSelect< EOT >)eoDetSelect< EOT > [private]
operator()(const eoPop< EOT > &_source, eoPop< EOT > &_dest)eoDetSelect< EOT > [inline, virtual]
~eoBF()eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_det_select.html b/trunk/paradiseo-eo/doc/html/classeo_det_select.html new file mode 100644 index 000000000..7f29ac8e6 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_det_select.html @@ -0,0 +1,101 @@ + + +EO: eoDetSelect< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDetSelect< EOT > Class Template Reference

eoDetSelect selects many individuals determinisctically +More... +

+#include <eoDetSelect.h> +

+

Inheritance diagram for eoDetSelect< EOT >: +

+ +eoSelect< EOT > +eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoDetSelect (double _rate=1.0, bool _interpret_as_rate=true)
 init
virtual void operator() (const eoPop< EOT > &_source, eoPop< EOT > &_dest)

Private Attributes

+eoHowMany howMany
+

Detailed Description

+

template<class EOT>
+ class eoDetSelect< EOT >

+ +eoDetSelect selects many individuals determinisctically +

+ +

+Definition at line 40 of file eoDetSelect.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
virtual void eoDetSelect< EOT >::operator() ( const eoPop< EOT > &  _source,
eoPop< EOT > &  _dest
)  [inline, virtual]
+
+ + + + + +
+   + + +

+

Parameters:
+ + + +
_source the source population
_dest the resulting population (size of this population is given by the HowMany data It empties the destination and adds the selection into it)
+
+ +

+Implements eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >. +

+Definition at line 53 of file eoDetSelect.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_det_select.png b/trunk/paradiseo-eo/doc/html/classeo_det_select.png new file mode 100644 index 0000000000000000000000000000000000000000..f1b1bf7c5776dba1f222cbd6efdbdf671d47a25e GIT binary patch literal 1889 zcmbVNc~sNK77hx6EDtSdMUb5!0m~-5n6!$7C?pV;9}*BDVMj;>vFsXoMNkt2g(Mac zLKS`}B1-}kXdL?j-TN=R59%ZJC$Z-k%s!Jw6j>6J=mho(S|TlM=q^4GPV5+y8{siaIk| zQPi~bE{rXk`Fh>GC@ddrI5{|i`<+-yiAqgQL^N=lC}|?J=E6SH3z`Z3*6Xdo)#+(P z(3o)XC1`}VTc+-r*tF4R!-Kvw_C~VmOW%S?VzywpzNeqKMF079?)Y%n&9PcL;^GqN z3nE)@db57`HLl+b)TOWe4n*SFpfWD1x&0E6N;Vo7N#5wG+uSO?_t(WlyBp->D6@6H!k~@i3u( z&BM|Yv?jsD3Qrl>G9|p&>Fi$M>+q`JoG#qs>TF?7!2Id~UTu1?@LiAyFmwO}PRDi( z6nUiorx+*ZY}xy&iE6@oj(O$Q2EHUc}W!d!B#I1$5x|4`u#fwxrO7b{kW{2M<2yT)M15 z7%|~FY|o*-y;74A02Bix42|TMLG>)#;mG8OkkU?0wQI(p$I<~_at->$P}b*jK=6f0 z_X2J*-2odfb!A1EDfL_29YQce1DZG~09?g-41Bz@K5K0R_q!U)nhE^4Jcws2UY+t= z>ne6IAY6$w5;5}=nfK#F%REW3ss5J{0^U%f$D7K!@phr-pCbjtHQvAEo`8jT2r?C4}Oae~ra`b==&K-t8YJRI*R z#>c3345+?*g_<&N$y%-_YHELmkdxftveUobzHP9tls=iMr@v~$=c|J7!ACjCaI727+L{4`hWu6zHA+Pm1cdBKfs9Iqe^v(>6Vdu`4*v>0sbU&9 z1mGH3Z9mzOu`XeFYzisZkJdO&X`O+t|8n@AIk(QHpYXn + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDetTournamentSelect< EOT > Member List

This is the complete list of members for eoDetTournamentSelect< EOT >, including all inherited members.

+ + + + + + + +
eoDetTournamentSelect(unsigned _tSize=2) (defined in eoDetTournamentSelect< EOT >)eoDetTournamentSelect< EOT > [inline]
functor_category()eoUF< const eoPop< EOT > &, const EOT & > [inline, static]
operator()(const eoPop< EOT > &_pop)eoDetTournamentSelect< EOT > [inline, virtual]
setup(const eoPop< EOT > &_pop)eoSelectOne< EOT > [inline, virtual]
tSize (defined in eoDetTournamentSelect< EOT >)eoDetTournamentSelect< EOT > [private]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, const EOT & > [inline, virtual]

Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_det_tournament_select.html b/trunk/paradiseo-eo/doc/html/classeo_det_tournament_select.html new file mode 100644 index 000000000..adca8786f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_det_tournament_select.html @@ -0,0 +1,50 @@ + + +EO: eoDetTournamentSelect< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDetTournamentSelect< EOT > Class Template Reference

eoDetTournamentSelect: a selection method that selects ONE individual by deterministic tournament -MS- 24/10/99 +More... +

+#include <eoDetTournamentSelect.h> +

+

Inheritance diagram for eoDetTournamentSelect< EOT >: +

+ +eoSelectOne< EOT > +eoUF< const eoPop< EOT > &, const EOT & > +eoFunctorBase + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoDetTournamentSelect (unsigned _tSize=2)
+virtual const EOT & operator() (const eoPop< EOT > &_pop)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+unsigned tSize
+

Detailed Description

+

template<class EOT>
+ class eoDetTournamentSelect< EOT >

+ +eoDetTournamentSelect: a selection method that selects ONE individual by deterministic tournament -MS- 24/10/99 +

+ +

+Definition at line 44 of file eoDetTournamentSelect.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_det_tournament_select.png b/trunk/paradiseo-eo/doc/html/classeo_det_tournament_select.png new file mode 100644 index 0000000000000000000000000000000000000000..0bde7c97a91c5219a3814d1c9a69b98199a552c6 GIT binary patch literal 1956 zcmai#c~sL^7RN!92(ncxr8p*fMv)SM0s`hAtca1$i#M9JEx~Jf4uj;@4ox)Iq%-jx$k># zq?@*;p{9z8iZ;UC#aBgTU6oRE)~hLJ+v-&t6dYMYBb13AFusuI;-*vot~{9VXXGq2X^b-^J`g zX^5)L6ZU(x9y$Q0Y((TeZcD3~>6wL@53PHjHu#REyOsqEc0$xxhwost7PC?Si=r{c zmdLDnujqr}Qcfu7I~1MacJ#@UuWIa!x{zPY8jpM%%};*aVH|v6D)H(*KMQ^&ke^sM zG(cE+*6a*!q9)1+tg3pQ$i?cS7)5xL#MY~;VniJ0uw>U1xu+9vE8n*nTan%|k2>8LCAi-n?X*x2(P}Gq(G3GHKID_QKHW^`ZR7hM zt2N+n^xKZ38rsc*;!3%5HV!#MX_zm|UX`Li=l+58J$>n+QwN7C#));?>kOngm{fHgb4m&*Dv6mPi+Y{^Z^8FnL2C)6z(`j#Q{!ZPc^ znbX1dJ>k<(ekpro86$HP$nV%{6!E&7n;(KYmC1W*>S%Sujs=wXDF04ESc+n8b;(d3Qk$R%*EvJa(Vmh*=?J^(P(IO@I)iN z0B0Rn&)`wTv>8%6y_V-nIi0wGhu#$9e}EYfqQrK4p~1DV4$MT+Ds~1!LdYue>R|4_ zpl*%#$T`M_A@s2}VnLuAU$?LDn|X*YG}Ee&a^m{jN^ zGm53&GPbHtO+jp1_m%g<_(H`%QbBu>d3?ZozCdF{#;j8#F3AE*{{ut^JbffV@{*Tv zR{D+Y1@l*x#;cXRZ#~o~=oR@q7fw`nph;@G&KGhi$>(sa)IGvltOHzoKbBr%<-~a# zC9mA~a|DBeHvG-L96&G0RsTJLAmX0tZ`Vt>vVh1x+`CKCi=SY5++~fuxDL2FsmT#E znB1zy3i+MV|2FapYeD$Ra~@A1|C8eqGreYg4Gv9vu$A!@bE_aWzO=?Eprd?{zV$Q1 zQRh@mW0`*<4aTJM4&++>)YN{GT#4B2mDPd{uRjTT6_+Dk%%cQn<{8=dtk3}6;<&^@ zFZP$5W}Ptb_OC#enz?O($37UGle4g6Uyv^cS=lx}3ZxAjNZ7&3zyQ{&{?KZloV@G( zM6P``ReQLFR=)X+w5L66D&Fj6ZdmFnwwb0=B9OF;Cq7DbDY}vj`gmT(hsU+=5OL8J?{_!rF&yGhd}*jAhIzEM+z$aJWQJ& zoU*(0gPb;odHQ(gnR&@>ou14=egiZEz|AjgBsB>O0MVzMU$g}==e|q6NpqF2TV`n~ z8^?1mC!>fCc&ho@9{76FhUa4a|68;_@cJ9iv85~@AzApRx{pKvjPLT~gJ<&tTg}=u z1I!nEfQf~j3FrL0@j;)Bq7F3*9vx2~&NtF;J>?sp(~l2m`5u6I_q29~n4(wjJ+=%C zGSjXV%A(Ac_kye&z{Do_SWk>e7|TTJ%&b@lNG|c9-pfwITzk6MYpKgLQd*_xLvU20 zz;pN?pzD-rv*0Y4y^!kVV*qa!nXvU&RL6N4<>GTgbp4eS@6V51?`OjNQLjk3x*{3d z`LD>v0N~oP>}yQ6Y=e;e<;Rx^?1S%MHdcyLQvfF+GfmllKV|uEasMBgi?J0oaPJnE zKO?C^9##Py>ZfooVgXlQ1$L&FA1Tp_X1zXQUwf3zrQTm&l41p7nqtvj;Bg-y)4OM7 z{caRL5S3YDH+7Zt6Q=1$lU2_i5i-78@X&ct&&{1sC#>p@aRmqHIy!>FAk5R#HU1b8 z(v-Bl>VrNVzof^`wKHWw-)w+QTCX*#P20xb=)y0;j5H$|mw06%?|KArw_1U+0tV0H zI`3(jwDMROYT~7m^oz + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDetTournamentTruncate< EOT > Member List

This is the complete list of members for eoDetTournamentTruncate< EOT >, including all inherited members.

+ + + + + + +
eoDetTournamentTruncate(unsigned _t_size) (defined in eoDetTournamentTruncate< EOT >)eoDetTournamentTruncate< EOT > [inline]
functor_category()eoBF< eoPop< EOT > &, unsigned, void > [inline, static]
operator()(eoPop< EOT > &_newgen, unsigned _newsize)eoDetTournamentTruncate< EOT > [inline, virtual]
t_size (defined in eoDetTournamentTruncate< EOT >)eoDetTournamentTruncate< EOT > [private]
~eoBF()eoBF< eoPop< EOT > &, unsigned, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_det_tournament_truncate.html b/trunk/paradiseo-eo/doc/html/classeo_det_tournament_truncate.html new file mode 100644 index 000000000..fa6b5b5bd --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_det_tournament_truncate.html @@ -0,0 +1,52 @@ + + +EO: eoDetTournamentTruncate< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDetTournamentTruncate< EOT > Class Template Reference

a truncate class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g. +More... +

+#include <eoReduce.h> +

+

Inheritance diagram for eoDetTournamentTruncate< EOT >: +

+ +eoReduce< EOT > +eoBF< eoPop< EOT > &, unsigned, void > +eoFunctorBase + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoDetTournamentTruncate (unsigned _t_size)
+void operator() (eoPop< EOT > &_newgen, unsigned _newsize)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+unsigned t_size
+

Detailed Description

+

template<class EOT>
+ class eoDetTournamentTruncate< EOT >

+ +a truncate class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g. +

+see eoSSGADetTournamentReplacement) +

+ +

+Definition at line 188 of file eoReduce.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_det_tournament_truncate.png b/trunk/paradiseo-eo/doc/html/classeo_det_tournament_truncate.png new file mode 100644 index 0000000000000000000000000000000000000000..7339cf88210e325b84d2a4de900a26d6cccd9b5b GIT binary patch literal 1948 zcmbVNc{rQd9**IDsU?^@lth%es$A4gQPR}XT1P||OG_DRXv9)9mdl4)szo|lf~cjV zmKjE4f<}`nEkmle(^#`mMW<*>Z7nh%Pw##1^W6Ds{y6XXz2`aSJ?HuT-g8c_hxg6C3iJ(v0ba3muIyJ{ zd@g1I9Qb}q*)VA!HZZxCeuBkL72xg>s80_@O1*2GMFOrszti!0Ys zrN24A75k=a*(O`5>*29aIzS!ArXrlV`qE{Lnltalcvpa(V70RmziT1~hidT=$^aSo z^x^M{R`ryK9Gy`75YqM43v_YVGvRkJ-WF!o?smxzM!n4xL0mSr#*Himkl$$Z-D|O& zuXI*dQ35|Hz{x?GgPba+G_LJDjXGwYFML$y{lo-J-N?o*P~F?on9-4~8>`fi1cr%> z6!j|huF2@=N3z+jvz(tqw8ANNDQf!U< zuk6;yVNQ|F&()EL&Mm4lU?u|2N<-lET=s!}|w29EjStTcE&k#ks`nGQm$YOlF2 zKpbwm)#j_d?SmGCKBgyfMyB7V8qR!ATv&0{t4XwM&voYuO9>wg-Y*l2D?CaqE{}E} zLg)FWY*hlQZ@x?OM6Wnb#8VFDKd@rCA-bo;`8~1%3m@JKVOAAZ0cC$@7fQ>W!b%=O4zFcA%L1X}uKMIlKNJ#$4|L*l) zk-_y<99?zW*dNj$e{t@feg6zziz9aKZ8r~Tq>XS_fV7CTc*Z_N^{~3sE(|my%3{P~ z&R-3|+a2%Jr3@(!IN>`w9KE|!Ln(0PaUWQq_kK6cKJ(m@-(jzn8MtI-l1S<7tUD|R5WuKCspK5B!l5_a+jx!7>s-!>9MhUEl?c`5ie zI|dGy>~~HuqaL0On&AUk1{E4yw$X2!NZzsAvsJMp>zjA_qSfBTKz4hl{oo$<;J?ud zjR8kL6rOCv>774avTHP#-l}u%weL(oYbjzxG`bC^w=Dc8{45Y9+qbG^s`^w@ZuO9&$pUaJ3=5OVs1D0l4|pU6`-TJ zdR+l;_~i?x3L0!De#uNBy*;8970s)Cra|0)=2I9*nE5thz-B~9#DdzUIVW}@MjE7J zhV^3L;Ng{Y8iOW-s7{_dbm|8?P~BfJa-=0TB}_hBS8^}ge-Q@Ys2K}G+=hO@e;f(f z^0Ck}C4^j8-Es)E5IlhC(0sm<2;z8Lp{KqOK9cTONih7$mU5x{K=SHRD1Q1Xpx^kr zNx0lG2Csd-7lQlQG@axh*&Zp5cjd@k>|2|o*QV8WM~rlx zD6;{2oj z3=(C3k*=VClGww{Dd&v6{QX5(P6vER!JXq*_*Kokbd4{?fW&SX)hk6N5YH?H_V9pQ zc$c>bts2%f7o7C03Uh01zI;t3ZqsgLUf)vAuwGC^e`Fdl#7yOyEu9g)wVJAoYwnUm zd@Q+3@a<}p?NC*%_-wg#T65?p_pz$A5I=8lsav|$k!)1d{&m#cQi}M>am>Qjk>;*& zAEJR-qG>TLYIr*~qtiTG*v>fhLIP~YYuT58a4EF_kDM?MQ2{;3V_&GDxu42?L}v6? zztk|A-irZLt$ub0p{2lbbV21KVoRN`oSZ7F1)8YzF7^f3=1m;>dG|rw*jx!Xmp??c zh*jfGx98U|-YyhR?GGDaT_W<9qfnZ=PTnvgkfQ#y5UID5o^Apn@iI8EdVHBCfWA_g NlY_hck0$~${s7XejD7$B literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_det_tournament_truncate_split-members.html b/trunk/paradiseo-eo/doc/html/classeo_det_tournament_truncate_split-members.html new file mode 100644 index 000000000..bcb992edc --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_det_tournament_truncate_split-members.html @@ -0,0 +1,22 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDetTournamentTruncateSplit< EOT > Member List

This is the complete list of members for eoDetTournamentTruncateSplit< EOT >, including all inherited members.

+ + + + + + + + +
eoDetTournamentTruncateSplit(unsigned _t_size, eoHowMany _howMany, bool _returnEliminated=false)eoDetTournamentTruncateSplit< EOT > [inline]
functor_category()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
howMany (defined in eoDetTournamentTruncateSplit< EOT >)eoDetTournamentTruncateSplit< EOT > [private]
operator()(eoPop< EOT > &_newgen, eoPop< EOT > &_eliminated)eoDetTournamentTruncateSplit< EOT > [inline, virtual]
returnEliminated (defined in eoDetTournamentTruncateSplit< EOT >)eoDetTournamentTruncateSplit< EOT > [private]
t_size (defined in eoDetTournamentTruncateSplit< EOT >)eoDetTournamentTruncateSplit< EOT > [private]
~eoBF()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_det_tournament_truncate_split.html b/trunk/paradiseo-eo/doc/html/classeo_det_tournament_truncate_split.html new file mode 100644 index 000000000..dda2da63c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_det_tournament_truncate_split.html @@ -0,0 +1,59 @@ + + +EO: eoDetTournamentTruncateSplit< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDetTournamentTruncateSplit< EOT > Class Template Reference

a ReduceSplit class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g. +More... +

+#include <eoReduceSplit.h> +

+

Inheritance diagram for eoDetTournamentTruncateSplit< EOT >: +

+ +eoReduceSplit< EOT > +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + +

Public Member Functions

+ eoDetTournamentTruncateSplit (unsigned _t_size, eoHowMany _howMany, bool _returnEliminated=false)
 Ctor: must provide amount of reduction, and whether or not you need to return the eliminated guys.
+void operator() (eoPop< EOT > &_newgen, eoPop< EOT > &_eliminated)
 Performs repeated inverse_deterministic_tournament on the pop.

Private Attributes

+unsigned t_size
+eoHowMany howMany
+bool returnEliminated
+

Detailed Description

+

template<class EOT>
+ class eoDetTournamentTruncateSplit< EOT >

+ +a ReduceSplit class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g. +

+see eoSSGADetTournamentReplacement) +

+ +

+Definition at line 205 of file eoReduceSplit.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_det_tournament_truncate_split.png b/trunk/paradiseo-eo/doc/html/classeo_det_tournament_truncate_split.png new file mode 100644 index 0000000000000000000000000000000000000000..f8b0557632b4684f58a904cda9b5c1332fb3e1ef GIT binary patch literal 1950 zcmbVNd05if8b)trWtdI%xZsjn*K%nSQOc!q>1w9tk`pSLPU?taxElh^xTOh}xh0r7 zE;ll>Qj~GQ9g{@O4P{KKA8O@*;b=ml49$IJ>OS|MdF~(QocDa^JLfs)J@4~=neMJ< z!P_;rgFqm#)4%LJKp@38a@?`$AM(B)22qy}>h3OH4l*=;*+9 z$@ucALac|YC+O7NWC#eP1a-1M?UhIoP&#ufV5;fm9<)CFN;>n!u%)Kv*_fvo z>>*d=J2c^*FmQizu^WckJ&H}|0oH~+a-QVUZc^G@!5E4KhkMUZ}&w43xSF$g2Rg8*gh>=T78atBQKS;-oH7D#EZ@J1l3E;2m#%#HXA-kqv ziz1f5-LGu#;u!Y%VD2(xj=$`5NH`*1&gw6U^MRtG1JDyt3VQncMr4Hud9DYyGj9l! zM0I0*?4_??O(9%0LIzFi291?8l}?plsezpt38MTKcl98gr6uaauDBmCv%guf)BxOl z0CwVDlyqvDVW=b-qVG=GE>TKA#tv8b|p+au}SS5 zwQ2~QSZbNRm#76udhlG;e6h zYCsGw!$6^=KmNOzO2z5gYa}qRZ_W(lN8wGYKPs}0($w5Z)VAyTc-%Ph^f3$nPv;8- z^mile3>U$Hyy(#?UhEX9q`Nv%ZoAZLhkCg53#45}dag`5t|34`V;Z3SQ zNO)GqRTf)@X@Q9q<$v8*u1`B4?7xGF1-9Y5seqmU8cq9E4!51*vFXbes}VYiSJ{M9 zO|UL$hz-GLBXY|>5o_ z`;+&dMil7SqUx4ZqGHPj8n&2{^HZ2ShzHDAi5LJk?wi-B`-;42ZlVC9mqo7^DZkb} z^O-|JtvZ;PB3X$W`sc0HH0J9Mtjs@6;D1Q|>WqjaYXyaqg0W~j;^*e%4$ z>DC||a0jsEGYq`ybne~kApdPOF+%?AFFkxF5xBV}8^93fE!;(ZOyHnmIQ1LIE_ zF6w1e-y}TI4VOuU=T{fwJn=zRh_#o7gFD~y%fSZR{U*EdWg-zXGN{oRI#q!iH(v^C zZ+7ihE~E+7l_t$#cYJNf)8{hLscaGb-$MRSR6Ei59=bIyJz4uk-(jZa!V3qkBdtWM z8?@SEBk0PzsDps(c~^lOJ%L5<0yo&<0R0Bk9ffE|{qwttC!hOk8E54qX2rfN-6%im z6n%Z$$zZ><))FN&aZO=kWYQ7PPY&>&xv-H4oWH|QthbmMgwODaP3+`&m`-#uiUOah z^se&t$&U|B_V?x + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDetTournamentWorthSelect< EOT, WorthT > Member List

This is the complete list of members for eoDetTournamentWorthSelect< EOT, WorthT >, including all inherited members.

+ + + + + + + + + + + + +
check_sync(unsigned index, const EOT &_eo) (defined in eoSelectFromWorth< EOT, WorthT >)eoSelectFromWorth< EOT, WorthT > [inline, protected]
eoDetTournamentWorthSelect(eoPerf2Worth< EOT, WorthT > &perf2Worth, unsigned _tSize) (defined in eoDetTournamentWorthSelect< EOT, WorthT >)eoDetTournamentWorthSelect< EOT, WorthT > [inline]
eoSelectFromWorth(eoPerf2Worth< EOT, WorthT > &_perf2Worth) (defined in eoSelectFromWorth< EOT, WorthT >)eoSelectFromWorth< EOT, WorthT > [inline]
fitness (defined in eoSelectFromWorth< EOT, WorthT >)eoSelectFromWorth< EOT, WorthT > [protected]
functor_category()eoUF< const eoPop< EOT > &, const EOT & > [inline, static]
operator()(const eoPop< EOT > &pop)eoDetTournamentWorthSelect< EOT, WorthT > [inline, virtual]
perf2Worth (defined in eoSelectFromWorth< EOT, WorthT >)eoSelectFromWorth< EOT, WorthT > [protected]
setup(const eoPop< EOT > &pop)eoSelectFromWorth< EOT, WorthT > [inline, virtual]
tSize (defined in eoDetTournamentWorthSelect< EOT, WorthT >)eoDetTournamentWorthSelect< EOT, WorthT > [private]
worthIterator typedef (defined in eoDetTournamentWorthSelect< EOT, WorthT >)eoDetTournamentWorthSelect< EOT, WorthT >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, const EOT & > [inline, virtual]

Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_det_tournament_worth_select.html b/trunk/paradiseo-eo/doc/html/classeo_det_tournament_worth_select.html new file mode 100644 index 000000000..7359eaed7 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_det_tournament_worth_select.html @@ -0,0 +1,58 @@ + + +EO: eoDetTournamentWorthSelect< EOT, WorthT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDetTournamentWorthSelect< EOT, WorthT > Class Template Reference

An instance of eoSelectPerf2Worth that does selection from the Worthes using a ... +More... +

+#include <eoSelectFromWorth.h> +

+

Inheritance diagram for eoDetTournamentWorthSelect< EOT, WorthT >: +

+ +eoSelectFromWorth< EOT, WorthT > +eoSelectOne< EOT > +eoUF< const eoPop< EOT > &, const EOT & > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + +

Public Types

+typedef std::vector< WorthT
+>::iterator 		worthIterator

Public Member Functions

+ eoDetTournamentWorthSelect (eoPerf2Worth< EOT, WorthT > &perf2Worth, unsigned _tSize)
+virtual const EOT & operator() (const eoPop< EOT > &pop)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+unsigned tSize
+

Detailed Description

+

template<class EOT, class WorthT = double>
+ class eoDetTournamentWorthSelect< EOT, WorthT >

+ +An instance of eoSelectPerf2Worth that does selection from the Worthes using a ... +

+determinisitic tournament, yes! +

+ +

+Definition at line 91 of file eoSelectFromWorth.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_det_tournament_worth_select.png b/trunk/paradiseo-eo/doc/html/classeo_det_tournament_worth_select.png new file mode 100644 index 0000000000000000000000000000000000000000..29c7e2709895d70fe0beabf33f9f6b784dadbfea GIT binary patch literal 2382 zcmb`JeLU0a8^>vW5osk#I+A{<--)A95XWuJG#Cn%=ylF{zWDhj2 zt(BP3-y~!W*k|xC9a!b8TxoEpam)J9YCUVsiqq5nfPb3nIBIOc?KSm{Dy4$}h!Vw; z9l*n&RYs2PpcZxYx`JYR)1Jq-b}>8D56x%Y(22A#y!8OL9iM*AXABybGMv8pKrStP zJ*xao^KnS z`0}K*`K)ztI1BRzG~op7DC^@xhv3|~AAxG3gHJ_y$ox*f%Y3a!WI;Tfb!j z7hC<1JE^96Dumq+U0p(dEhHPoaH~ihP~QY&jy|Of)UzmDP0!h6e%pMVHM~T^P>-~~kD5P79r1=xd90YY$uq^l@#D&F!=xdBSD zpk>WXM4{8rS6VP$NIGRgSa2WR!iYx~Ei#@tlenHzrM8gm6^DR&pd;i`e5UWUHS;%r zK{Jz+M2aFcYwxDu55~^IBO=8~cG?t37d*2i;HV#3tQfGI5)rY@v*n4z-s*`64XtDq z>Uu1R^Rp`D?VZ>N$?sYF#MmD~#}1!?4m%^;i$&6Z_0GL4-Y65L$5wCvmH(ItU)wU) zrGw7MdBG{$5Nzdc)7T{Qg56il z3v5(~`{W!Wm!u~g`s64s;sv@0Jg!p5$gO`ZRZ`@1!kpxDHT$m*0+(6}^tc?<+qGd^g*A?p1U#l)uSR`Q+ zR42j=0*hS2F_Yll?=xT5^72Fc^a1mPy`zGhynBxv-|D53cXd*6P*1gu5n`Coqnjkn z-m47oMkuyAk$DRd&7gV`j7sI2vDyYrDojrVU;r@;QaR#Z?Cv=UD~;xv6SmXu$T}_W zv90N>LE?ivdd=a2`>K=y*s(QcM1hy-G%dbg+4SNHTI268xLP{-W?Wn7_1XZ4_ z4(xfm32-Ab;R*c@e!7;R=&k8>3TXFclA4n;)jH|iXD0Ns4LEI>J0cEJgXwKE+L=S; zUf&BIDNv~qo(+L+oyC$TFeN$#Tlck|3;QrBa1)H|H@I#q1Q|x z=6q}SQwNak8ikJsvgk&G){`MHM-n-5+)$^Fx+`geIA;8|>FMW`7dSTLV6#vjk)L*+ zY!g#?*VVlt=dB3@;0%RvCJvnxVauAF?A>6xLc|N5K4?5gtJX2a@FJNWZJ1r!j^`hg zS+T7Xh$pmE82%L9J-bvB7%r!cw?W7}#li%uJ&O>6qJ{O8LG6*fy<;Ve_;_!$5; zPJS!&sP(_tD74BZH@o(1`W0NJ12?pO&Fktz*v5FCH+Rs@5K5mrwRakl+|5~Rsguh&0|SX*8YICR zrVqlIMRy6>)?WJ&+hz^}z%6Y3_O#eHKA#V&KZ%QIr&rAP3tQ+HT8)41X<*21wvQD) zb}4=5+JA;k!f$pE+48q0#VCdy?S?Vm>PrrnxtPrkuaML1`j@H0BiP4{J&~Zf)_?PN zri8ZK9b}XdeUEU*weDeim;qz3JMpObeMmr+sZ!`GUWFP?{_y(9{YGR=s6b79l4#s( z-*X$o)&0)D`p|W4n%OCx+y^0evPEb%>t@mv@3zwDwGT9IN#|%CHQ>O9IX`XDT+D3l z^zH*uML#*){0$yvdDEBgv^+*6x+KJ-|HRksyH>OSI7fD-_=!V z + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDetUniformMutation< EOT > Member List

This is the complete list of members for eoDetUniformMutation< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
bounds (defined in eoDetUniformMutation< EOT >)eoDetUniformMutation< EOT > [private]
className() const eoDetUniformMutation< EOT > [inline, virtual]
eoDetUniformMutation(const double &_epsilon, const unsigned &_no=1)eoDetUniformMutation< EOT > [inline]
eoDetUniformMutation(eoRealVectorBounds &_bounds, const double &_epsilon, const unsigned &_no=1)eoDetUniformMutation< EOT > [inline]
eoDetUniformMutation(eoRealVectorBounds &_bounds, const std::vector< double > &_epsilon, const unsigned &_no=1)eoDetUniformMutation< EOT > [inline]
eoMonOp()eoMonOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
epsilon (defined in eoDetUniformMutation< EOT >)eoDetUniformMutation< EOT > [private]
functor_category()eoUF< EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
homogeneous (defined in eoDetUniformMutation< EOT >)eoDetUniformMutation< EOT > [private]
no (defined in eoDetUniformMutation< EOT >)eoDetUniformMutation< EOT > [private]
operator()(EOT &_eo)eoDetUniformMutation< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]
~eoUF()eoUF< EOT &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_det_uniform_mutation.html b/trunk/paradiseo-eo/doc/html/classeo_det_uniform_mutation.html new file mode 100644 index 000000000..35b17a2a1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_det_uniform_mutation.html @@ -0,0 +1,287 @@ + + +EO: eoDetUniformMutation< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDetUniformMutation< EOT > Class Template Reference

eoDetUniformMutation --> changes exactly k values of the std::vector by uniform choice with range epsilon +More... +

+#include <Tutorial/eoRealOp.h> +

+

Inheritance diagram for eoDetUniformMutation< EOT >: +

+ +eoMonOp< EOT > +eoOp< EOT > +eoUF< EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

 eoDetUniformMutation (const double &_epsilon, const unsigned &_no=1)
 (Default) Constructor for homogeneous genotype it's there mostly for backward compatibility
 eoDetUniformMutation (eoRealVectorBounds &_bounds, const double &_epsilon, const unsigned &_no=1)
 Constructor with bounds.
 eoDetUniformMutation (eoRealVectorBounds &_bounds, const std::vector< double > &_epsilon, const unsigned &_no=1)
 Constructor with bounds and full std::vector of epsilon.
+virtual std::string className () const
 The class name.
bool operator() (EOT &_eo)
 Do it!

Private Attributes

+bool homogeneous
+eoRealVectorBounds & bounds
+std::vector< double > epsilon
+unsigned no
+

Detailed Description

+

template<class EOT>
+ class eoDetUniformMutation< EOT >

+ +eoDetUniformMutation --> changes exactly k values of the std::vector by uniform choice with range epsilon +

+ +

+Definition at line 144 of file eoRealOp.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
eoDetUniformMutation< EOT >::eoDetUniformMutation ( const double &  _epsilon,
const unsigned &  _no = 1
)  [inline]
+
+ + + + + +
+   + + +

+(Default) Constructor for homogeneous genotype it's there mostly for backward compatibility +

+

Parameters:
+ + + +
_epsilon the range for uniform nutation
number of coordinate to modify
+
+ +

+Definition at line 154 of file eoRealOp.h.

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
eoDetUniformMutation< EOT >::eoDetUniformMutation ( eoRealVectorBounds &  _bounds,
const double &  _epsilon,
const unsigned &  _no = 1
)  [inline]
+
+ + + + + +
+   + + +

+Constructor with bounds. +

+

Parameters:
+ + + + +
_bounds an eoRealVectorBounds that contains the bounds
_epsilon the range for uniform nutation (to be scaled if necessary)
number of coordinate to modify
+
+ +

+Definition at line 164 of file eoRealOp.h. +

+References eoRealBaseVectorBounds::isBounded(), and eoRealBaseVectorBounds::range().

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
eoDetUniformMutation< EOT >::eoDetUniformMutation ( eoRealVectorBounds &  _bounds,
const std::vector< double > &  _epsilon,
const unsigned &  _no = 1
)  [inline]
+
+ + + + + +
+   + + +

+Constructor with bounds and full std::vector of epsilon. +

+

Parameters:
+ + + + +
_bounds an eoRealVectorBounds that contains the bounds
_epsilon the VECTOR of ranges for uniform mutation
number of coordinate to modify
+
+ +

+Definition at line 181 of file eoRealOp.h. +

+References eoRealBaseVectorBounds::isBounded(), and eoRealBaseVectorBounds::range().

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
bool eoDetUniformMutation< EOT >::operator() ( EOT &  _eo  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Do it! +

+

Parameters:
+ + +
_eo The indi undergoing the mutation
+
+ +

+Implements eoUF< EOT &, bool >. +

+Definition at line 199 of file eoRealOp.h. +

+References eoRealBaseVectorBounds::isMaxBounded(), eoRealBaseVectorBounds::isMinBounded(), eoRealBaseVectorBounds::maximum(), eoRealBaseVectorBounds::minimum(), eoRng::random(), and eoRng::uniform().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_det_uniform_mutation.png b/trunk/paradiseo-eo/doc/html/classeo_det_uniform_mutation.png new file mode 100644 index 0000000000000000000000000000000000000000..871b7608643dbd35feb4a822650c4142a78efacf GIT binary patch literal 1515 zcmah}eKga17++na*j*{aW!^HHmr#f?$=GB=M!Vf^^Li0NqcpFHTOsn&;woE7$|OmV z*R2rKWs-1bNPcX%%ViBCc31b@bMEP%d(P+iem~DS-_JSE=X;*#$?$YXgSV+~1A#zb zR}9Jv1lqJ9myHI{*& zgpfkD)HxcElQWG$>#H}9hss*Gm8HcoBFUm3suZs^2asSPB$xvlxw(t)z1pwPrDF@7 zerE}4A^(1U`|PEQ56!(93*3gFYt_zHASl(% z4DHKXN_*4vX_Nhqwcu4wAe72l4~=`*^T|w;lA)pfQN}5f*I332c z4_meb(hv}c0tqh;Bgv|Y6PLfJ8M8)tA-Gq!&Lw@_};jD2?)`8s&rA>iFY7dUiw7oi~RWmB&_QaU^m!cvVCD*fS#gDOz?@9{s$dDj-~sx$bk@B7fh2XIIzrRHS`HiA7e zL3)K*iU-Is4I$`$_E;M8-;<6sFv)>4#m5KKfv5F5BM{B5*q&|3lB@vh0%d77Qy^JG; zzu$?phAkYsA+*aB4D|{P>zb$=?RND$cGGHf>Y8|B*&0m;mGqC%?3fdBuzL$TYwQPC zTD!|P7WQ+^YsWFkh6ITb>sm%ip#Rs7_cdHzdmle;dp`{BU)Ig2!RlWfzz|^w`YYw^ zSXP#?nMnbkV%P}8>S+}4lnV&=D$;krs*m8e>S2kLawV6dX1KB|vT~tqZmZ7>Q#XJV z|1B1mM9Qy0?iJnlw4B=kY%egt8s(%6RG{jQv2*~95^QXE4mVhHH>o5!+UiY}4XN-{ z=~9161LrqX{WQzNpwSZjy&uChyt#_?R%x_Yuh2?0Jk8GJO_d{QMmVyu_ltyfG??K7 zZeZ_`K5o4alo`OPJ+M?aERj}pi?ubcAZhLveO~P5MCa!Z6@ zw>$q2ZgzK9>k%x@bB+GPsyw8ZY z*OsLDgMusk5nWYIkA40ml;s@N8{cEJ>w)Jx?pdxp{`J*#Wt(=v&;wQAq;~ynYO?|` zY~BdAmu>;4f#ht9xbnj{4TeAnpd}_Q1g=IxjL}>W=}Y0)g=E#lu@-}Q>%>-AR2wh( zX+k%Sgog|Q{?Zw5$sZ?^*^qii#{X9 bY$XsaYnc(td`N_JGlN{6-BFJY`(6ASS3Lg> literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_deterministic_sa_d_replacement-members.html b/trunk/paradiseo-eo/doc/html/classeo_deterministic_sa_d_replacement-members.html new file mode 100644 index 000000000..c2becfa64 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_deterministic_sa_d_replacement-members.html @@ -0,0 +1,25 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDeterministicSaDReplacement< EOT > Member List

This is the complete list of members for eoDeterministicSaDReplacement< EOT >, including all inherited members.

+ + + + + + + + + + + +
eoDeterministicSaDReplacement(eoReduce< EOT > &_reduceGlobal, double _surviveParents, double _dieParents=0, double _surviveOffspring=0, double _dieOffspring=0, bool _interpret_as_rate=true)eoDeterministicSaDReplacement< EOT > [inline]
eoDeterministicSaDReplacement(double _surviveParents, double _dieParents=0, double _surviveOffspring=0, double _dieOffspring=0, bool _interpret_as_rate=true)eoDeterministicSaDReplacement< EOT > [inline]
functor_category()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
operator()(eoPop< EOT > &_parents, eoPop< EOT > &_offspring)eoDeterministicSaDReplacement< EOT > [inline, virtual]
plus (defined in eoDeterministicSaDReplacement< EOT >)eoDeterministicSaDReplacement< EOT > [private]
reduceGlobal (defined in eoDeterministicSaDReplacement< EOT >)eoDeterministicSaDReplacement< EOT > [private]
sAdOffspring (defined in eoDeterministicSaDReplacement< EOT >)eoDeterministicSaDReplacement< EOT > [private]
sAdParents (defined in eoDeterministicSaDReplacement< EOT >)eoDeterministicSaDReplacement< EOT > [private]
truncate (defined in eoDeterministicSaDReplacement< EOT >)eoDeterministicSaDReplacement< EOT > [private]
~eoBF()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_deterministic_sa_d_replacement.html b/trunk/paradiseo-eo/doc/html/classeo_deterministic_sa_d_replacement.html new file mode 100644 index 000000000..7facb49cf --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_deterministic_sa_d_replacement.html @@ -0,0 +1,71 @@ + + +EO: eoDeterministicSaDReplacement< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDeterministicSaDReplacement< EOT > Class Template Reference

eoDeterministicSaDReplacement: replacement strategy that is just, in sequence saves best and kill worse from parents + saves best and kill worse from offspring + merge remaining (neither save nor killed) parents and offspring + reduce that merged population = returns reduced pop + best parents + best offspring +More... +

+#include <eoSurviveAndDie.h> +

+

Inheritance diagram for eoDeterministicSaDReplacement< EOT >: +

+ +eoReplacement< EOT > +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoDeterministicSaDReplacement (eoReduce< EOT > &_reduceGlobal, double _surviveParents, double _dieParents=0, double _surviveOffspring=0, double _dieOffspring=0, bool _interpret_as_rate=true)
 Constructor with reduce.
+ eoDeterministicSaDReplacement (double _surviveParents, double _dieParents=0, double _surviveOffspring=0, double _dieOffspring=0, bool _interpret_as_rate=true)
 Constructor with default truncate used as reduce.
+void operator() (eoPop< EOT > &_parents, eoPop< EOT > &_offspring)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+eoReduce< EOT > & reduceGlobal
+eoDeterministicSurviveAndDie<
+ EOT > 		sAdParents
+eoDeterministicSurviveAndDie<
+ EOT > 		sAdOffspring
+eoPlus< EOT > plus
+eoTruncate< EOT > truncate
+

Detailed Description

+

template<class EOT>
+ class eoDeterministicSaDReplacement< EOT >

+ +eoDeterministicSaDReplacement: replacement strategy that is just, in sequence saves best and kill worse from parents + saves best and kill worse from offspring + merge remaining (neither save nor killed) parents and offspring + reduce that merged population = returns reduced pop + best parents + best offspring +

+An obvious use is as strong elitist strategy, i.e. preserving best parents, and reducing (either offspring or parents+offspring) +

+ +

+Definition at line 132 of file eoSurviveAndDie.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_deterministic_sa_d_replacement.png b/trunk/paradiseo-eo/doc/html/classeo_deterministic_sa_d_replacement.png new file mode 100644 index 0000000000000000000000000000000000000000..4fc2bd50f76048534d18d88a78bec96d22e30f70 GIT binary patch literal 1955 zcmb_dc~sL^8jUkfp`cLgh?oQ@c0sTZupy8Twg6=h3`w9Wf`}53C88+7K&)G$90HvJ z#hClF$D{Y9q5Ej$0Jow*2ziFPpw3B-GAG#V|`Xj<6p6JKc2FQcWU zh0>~dsom~K4aMR>?$gg>K_DHZpO*)o%#yRZ&y}Ly`7|hKsKy8~EEBfWQlfmT7muv{ z=+pe3yPq%QGWdIE+!MZyy{v3tI1ss|*5sq1^ZDp)2)4sbLe`)y-e+7ZNrA(2Xrex7 z;)HN7QM~$hdCq14?U_36Rf$wWFb3;$n(9ND?j*x4Tw`8;!AtInw^?FFd|2>51g7hI z^nqh55Zm0dFKUe;;KEPVQ(S!Q67H3iW+yPm5qU)^l)*>mjfNV}jvxW*=jP{ka#NUC zfpa!uZC$8JixtmQ-1lHoxAIx8R@a))uCBPl#*?>V8B4iL2PGYn_V3z}Q;!EMWI~Nx8Hid}Y7dOa)7=D-$NX&c;#CcTC98T6xDXx8TwE3JRvtYQ~0G?bvjTFMoscJSvhW*={RTF3uujT1RZUZEObpRw1#2s70GQ zd!4{wA5S1I4%)4**h1>=CvLBP3$cIoSWU6#?R&3nF!FOKj`p^d^A}RyzO&A8(A|vE z|N8RROTQT;|1*l`HVTtT$HpSR50^(p8F~C%*K0~4d}+*a?t=NZLBW=$C@$Z?W;7(T zqb7Rt(DJ+}z=oB2FZ!ETU)|0<9+ck=UW%ERk&daMt3@|M`{yk_jOiX6tXVt$p;^Z=!DGPk}fti`YRk80z24zTM_*kelKrV-TezwJ;a4otQC`o zpl(4mk8%u|Su8mUlivH<86BLnywg&5#XeHg`orJ>;rd91orhD-| zFug4e`?~#qTju{6=8dHP$Bewre(uvI_4oM2TCbTfh!|x|?VmewX4gzp@>-8gxvhiS zi(wJh;F8pYee4s##C2J*h^NQ6axx7wdE*YvYVnf84WY*z{cHUwCN&Q(%(I2tFP?;b zEFH1_@oE3H{^Rp06)~1I1&VO%u3E;Sq3)Fd55q2!d&nY1(T&``xgd2!eOrX0Zr&7`B2cHneZ2quWPB{{q|)+XT}nbkPF2Aw1etV>Ko4FKk6A zV{$SN(9_*|1f3R(iFooma4fL#vt;a#-;k&+I5l!^lk)cZ+ENw8jRcj^A8Q?=(b-cUU7=pZ!&(LZ7#tX(V8Hvyd6949QAFGa{B zp4ntSOo>y(GN0ZS74d#3Z?>1*vD)yC947;Z>vv=D3G7iz#?vE7VAWN9UP?AZa=nbS znQqdDEsSR_&vJnHws23t$P$sySe`Wq8h_AP^w6~z`@#tgCfzj(dX#-;Y}th7J>IBr zDVU;(%(>GCod(|}iFNYDYj6j%`$x7d4mM0VixsAwoTP~=X125AQhn;(j{xD9Wl+*g zWnU%R4EC=7moYekFr1nMSRp-EXl?yubY@_|sXFW2x%LB2-83vxh@fsj+5VnCsB5a8 zt>h_`T$GTE8c`&2T2W?>`>B^}TScdi5ytrDDNzh*E=OsdG*%7I<=4hD@m?}2i&D_6 xUWexhT^XgE;9s8tc+T{oXo0#5(?MZqcBpjlDEphxx3oVh$j=+=Rfjoo^(SnD(SQH| literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_deterministic_survive_and_die-members.html b/trunk/paradiseo-eo/doc/html/classeo_deterministic_survive_and_die-members.html new file mode 100644 index 000000000..2aad532a6 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_deterministic_survive_and_die-members.html @@ -0,0 +1,22 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDeterministicSurviveAndDie< EOT > Member List

This is the complete list of members for eoDeterministicSurviveAndDie< EOT >, including all inherited members.

+ + + + + + + + +
eoDeterministicSurviveAndDie(double _survive, double _die, bool _interpret_as_rate=true)eoDeterministicSurviveAndDie< EOT > [inline]
eoSurviveAndDie(double _survive, double _die, bool _interpret_as_rate=true) (defined in eoSurviveAndDie< EOT >)eoSurviveAndDie< EOT > [inline]
functor_category()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
howmanyDie (defined in eoSurviveAndDie< EOT >)eoSurviveAndDie< EOT > [protected]
howmanySurvive (defined in eoSurviveAndDie< EOT >)eoSurviveAndDie< EOT > [protected]
operator()(eoPop< EOT > &_pop, eoPop< EOT > &_luckyGuys)eoDeterministicSurviveAndDie< EOT > [inline, virtual]
~eoBF()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_deterministic_survive_and_die.html b/trunk/paradiseo-eo/doc/html/classeo_deterministic_survive_and_die.html new file mode 100644 index 000000000..8ad6e7c03 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_deterministic_survive_and_die.html @@ -0,0 +1,50 @@ + + +EO: eoDeterministicSurviveAndDie< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDeterministicSurviveAndDie< EOT > Class Template Reference

An instance (theonly one as of today, Dec. +More... +

+#include <eoSurviveAndDie.h> +

+

Inheritance diagram for eoDeterministicSurviveAndDie< EOT >: +

+ +eoSurviveAndDie< EOT > +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + +

Public Member Functions

+ eoDeterministicSurviveAndDie (double _survive, double _die, bool _interpret_as_rate=true)
 constructor
+void operator() (eoPop< EOT > &_pop, eoPop< EOT > &_luckyGuys)
 The pure virtual function that needs to be implemented by the subclass.
+

Detailed Description

+

template<class EOT>
+ class eoDeterministicSurviveAndDie< EOT >

+ +An instance (theonly one as of today, Dec. +

+20, 2000) of an eoSurviveAndDie, that does everything deterministically

+Used in eoDeterministicSaDReplacement. +

+ +

+Definition at line 73 of file eoSurviveAndDie.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_deterministic_survive_and_die.png b/trunk/paradiseo-eo/doc/html/classeo_deterministic_survive_and_die.png new file mode 100644 index 0000000000000000000000000000000000000000..cad24d0875dba2865afefc3698e3470fe6591816 GIT binary patch literal 1955 zcmb_dc~H~W7EZOojFiP`W7#T0wentS*^B~#BnnZ8t+T!F^;C;AY^!0?Y>DN88glOT1&Oit z=8Wn}3f#$#UpqEee7YL^!O&f96FGOb^gbJA_L;Znt5bEyiFc{;;}4uNReRXQE=$oM zCro&BIej|l1Ass7K%-wWBR4L1K?oi%sTN%K9ZU9x-3v5ZwqLEEFtYcsr>nypowz5XW1- zS;#_Ql+;`LU6wA(SiyRdGP~vJh!>PkRHASHQ`l@*6yTFotyu-gve;kB?JWP9g_YLm3aYnpl46v5$Fle)2|*LMgP%5h{$s52 zm_$p9^NEJ?U#3w=#k>Oxy{CiL(uO^Dx#xVp)3ij5K<^u!zu`n0s;P5bC}Q(PQzGC3 z(?N>(Hi?nHF7$D)SkW~kQ(5Hn*^HVZ$sGp!fk@-i2+Et>H(Gt#&Sd>?caJSA^t}H5 z)9x_Ej-MajC6Q$Hziu2j@59Bvp6(j_&Z7CU6eP?HC}1eA?jz(8@V;k2u5UfQe=V^A zkrbo22AeH%82dHmBUov(@^lFIo7H)P7uA>L_PvmW_e3=X}{UkGX$4IPo)3q z|I{i)#)(XQ!Mx(UKHGEe^u;10sOm|NNSiTI$2X}_Mk+H-2(kHp1R@8z?xkx#T;eTn zL0Q=P`+>247Mlmi`aEs_8f@!f^@pxp(eaz_JLzO=(ooEw6iK)(b-pZh$dn?NWAl6W zHTr#iFqrM0(3rWcO`sO;#AWcKs#GPVtcJZ}l7xLmscIk8A*a1}aE^1Q?%7a>3P_xd zqm2VHf9uHb*iW|Iv4|gWbOX$&Zf>{ri{te&|CJ26u$BT1SJxptYuk!ay1Q4C%=-b# zn~)JUv{gP2qwfcgO=L#kJNN7XreNslzKIiPx1KsFL-h~ilO`e>iZ|g75gup+X~-Zk zNdb(|S?FF+vv>DdynldYhU8gQSm(OwggTh08xJ=H<(Zq}SG_t}_a!H>qyo(i@p_cw zT;$zwIEJ@!OMS*Kdh-bF9RxLn{I}-ieD2|LuGPnliTd2d?T&CbGmjopmz02!OsAr47d + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDistance< EOT > Member List

This is the complete list of members for eoDistance< EOT >, including all inherited members.

+ + + + +
functor_category()eoBF< const EOT &, const EOT &, double > [inline, static]
operator()(const EOT &, const EOT &)=0eoBF< const EOT &, const EOT &, double > [pure virtual]
~eoBF()eoBF< const EOT &, const EOT &, double > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_distance.html b/trunk/paradiseo-eo/doc/html/classeo_distance.html new file mode 100644 index 000000000..c04e86abb --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_distance.html @@ -0,0 +1,39 @@ + + +EO: eoDistance< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDistance< EOT > Class Template Reference

This is a generic class for distance functors: takes 2 things ane returns a double. +More... +

+#include <eoDistance.h> +

+

Inheritance diagram for eoDistance< EOT >: +

+ +eoBF< const EOT &, const EOT &, double > +eoFunctorBase +eoHammingDistance< EOT > +eoQuadDistance< EOT > + +List of all members. + +
+

Detailed Description

+

template<class EOT>
+ class eoDistance< EOT >

+ +This is a generic class for distance functors: takes 2 things ane returns a double. +

+ +

+Definition at line 35 of file eoDistance.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_distance.png b/trunk/paradiseo-eo/doc/html/classeo_distance.png new file mode 100644 index 0000000000000000000000000000000000000000..646922e656f7a83ec7366afbf028e6a416e3b5ff GIT binary patch literal 2657 zcmc&$dpOezAD=^~i%P6=E0hkE7jMatv5j(@+vJjzOHXbau`*4WSw|sVXcQs$SVAhB zm9cbpIcr2@Yuih%@lz(hnK5VTbk2MJdEfK?^*+z<^7%Z!&*%62p6}=LeV$*Mhr8pN zRa&bc5Xc&olbt67qBtSP%}R>$>+zFcBIP#?4_9yd#l=NATwH7}Dmr>qj=rAF&CSH8 zi-U5i5bNpg1+f`^7Y2c>6r=2Hy-(i+3fiN`e_n47UH>pR3z}XoReS-c6qMQwZyFQ3 z=pbBOVqDv449&t*!AEeo6KN_;?CjK(l5B2dLBd20uZey4gXld;6{tQ+p;OB)1Mp z2W8kH#=|v<)6cmJYPwwxOi}qKqY`L%)IX`0*+*((+9!+sQ=|6Y5YHu73##dO{pRq) zA2`k*fx}Gm6w@(xy3D?Stx{SLz=2_X6Hl%}X9@ET&IHdOB7FsFNIz4<8y~LI-W~$` zL%IKA4>lR>Fr`zq&!g9dYvo50OW+nFgT`se(R@?08-(&UD?LmGi7Di|GSd!cjqhWw zJXl6x8D|d~18yX#eH4c~4L|mpMD*i%)m_bS7U!}VobB9#zS8#Zz}{iAg>}vk;IsM;ppzUUoL=KRDu0lxv6$El~x}h5nM+{ zA~$jDi)U53r*|a|{DO@G71-(`a&@4@Y&PQKFQRhTg%bg{bIQ;l$zbu zC7{3%Pwnuqo7L@2rJJ7~ls-2@Rnw?fWG_rZX5wq$uRZ$>OFOJL*n1;u=;*_#;!fGo zz>Prdu`0NmewLEkTqA{=(SqW5X5(plr*Kz!LWhr%_AKQvfa)v1bS%NA6#@`YN zoSc0)W5VUt`SL~{P=b2FGYksH?Q{uA5H;vEeXj=at-b^ro(K}&m6!9_Hsnu1IR=A4tIibO5JL6+7;!K$^js;dev|PKD z%fq|27>*;B0sXJwFVtDur6NyhXG)-aPHBXn@vF4Y2*W>5G<G@=?o`M_>pfN@;QH$GYk|H;?XC+xdObAR+tieO(Y}(i*uK z`nT7uIb*;Dv%2JZk33TPI+%^|`L!O3C5qkh9GB=CIaU5f&3}KoME`GMz_d@c2rM!r z8!ShWY)P$TgLGv?Hse(cR+cL)6fP*4V=5V{K#eM3{PkD@l0I&Y=S!2Yrl@{5f_VK< z95Zz&nJE0^fpwq9KiX1!ZLLwf*jfPSw3)v5%X>vf59PaY+BMGQ<(ISGHgm$7*z2u& zZzQx(#F1t2vaa-nt?X2P%LP~lrgw-ZSGK&b4AArq>Z_)=9S%G)`zpTXrSZd*=9=<= zv5yAU6D~Bo+ltVEAd+STT=Kv>ni^EFaED;UFKMK3_NtHVskQFT9##M>jZ+6Uaemb} zCn$UJ;P5jp|593He>h6H;@yx%ehnzqnzN$U9Sy=v`7k}bv(#&cKR>tEN*r)Nyx9QM zJ5jB)I`z36EIyqYcG)%qBQA)&8d3WBC+tXt-sHfCsLvDbJ7~g@g<^uZ5P#q_Y$Ns# zDo?uupUWis=O#S%>$zpsMoR`It(w6dOj=!|KaZcK{k}%)48tcBa9%dfbCBtL5=Z#% z>;+K)ZxJWARP0~SaJE;e`jN(RRl%ZFE4o{d7Qw6Ia|qeK5f+`;QvoxEgO|7OEiIdiuDn&eg(p2y~%_sm)iY6~OB{p<>t75IJS~H96fN&Y z=+5n~Q|lC{Nzl9gQk`!dlJGfSBG_c??8;c^7xHTA)aXb+zd-&!2tnDq+uhxFH0d{5 CI2oG& literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_distrib_updater-members.html b/trunk/paradiseo-eo/doc/html/classeo_distrib_updater-members.html new file mode 100644 index 000000000..e9728195e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_distrib_updater-members.html @@ -0,0 +1,18 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDistribUpdater< EOT > Member List

This is the complete list of members for eoDistribUpdater< EOT >, including all inherited members.

+ + + + +
functor_category()eoBF< eoDistribution< EOT > &, eoPop< EOT > &, void > [inline, static]
operator()(eoDistribution< EOT > &, eoPop< EOT > &)=0eoDistribUpdater< EOT > [pure virtual]
~eoBF()eoBF< eoDistribution< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_distrib_updater.html b/trunk/paradiseo-eo/doc/html/classeo_distrib_updater.html new file mode 100644 index 000000000..a77324e91 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_distrib_updater.html @@ -0,0 +1,46 @@ + + +EO: eoDistribUpdater< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDistribUpdater< EOT > Class Template Reference

Base class for Distribution Evolution Algorithms within EO: the update rule of distribution. +More... +

+#include <eoDistribUpdater.h> +

+

Inheritance diagram for eoDistribUpdater< EOT >: +

+ +eoBF< eoDistribution< EOT > &, eoPop< EOT > &, void > +eoFunctorBase +eoPBILAdditive< EOT > +eoPBILOrg< EOT > + +List of all members. + + + + + +

Public Member Functions

+virtual void operator() (eoDistribution< EOT > &, eoPop< EOT > &)=0
 The pure virtual function that needs to be implemented by the subclass.
+

Detailed Description

+

template<class EOT>
+ class eoDistribUpdater< EOT >

+ +Base class for Distribution Evolution Algorithms within EO: the update rule of distribution. +

+It takes one distribution and updates it according to one population +

+ +

+Definition at line 43 of file eoDistribUpdater.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_distrib_updater.png b/trunk/paradiseo-eo/doc/html/classeo_distrib_updater.png new file mode 100644 index 0000000000000000000000000000000000000000..9173e093ebe20474254dbaa622bef4955042cff8 GIT binary patch literal 2278 zcmaJ@dpOf=9~Y(f#VA5ePAQL5Bz~+YH93ZuiJZc+vPI4z9;e2$r$z`fHugHqwwl8t zQx5T@SDHL*h8!wPX{(2F3hiCb)pNZ)*Y)=Paewd6_qy-v^T+q|{e15m>+a?Nk^##| zNJxO398bX{B&5v6xO1zNIBMOu8WwN6-Cf{zB9TZ8MWW8~@}OH{^yljA?7Y?`nh~d4 zVqtEc5-0d0NC}C5Bs-lt2~Q{!64?>c2D`HmIP-U%J!osoLxjBkCHPU;O5p6WLb7Ji zMghtE@v`6Iabk^yv|7UI=|XaG2m6op*Kb|S{J+TEtw2TGJp=<8z@=ololu}&P}5U) z=vT91TjB9s*$Y6M39q%b2J+sLk*!z5yPdN0;%(-?p6)LaS-jH9X6&0FIVx+m)e%^d z#kLbiQ3ss?H1ew@TxaSu+i1pwBl2=wDHpvdjRB=F33ZJy}8M zOfXg}%D{|jN~W$O)xh%*R4D%EXXMI-C&ytC_bTn*S2xJsAKM*pXzOj9)E!@?!rQLn1Gu~29_h`eHAFEM$lWB=XP>2B z2eLi-Aa!Tl{X+1OGulqBChZYN(YJ**lffRnJ>w+DYF5r+I(?z({4#+BRv&0MI{SpA6w2QMUtaV&Pw$MK(TovD(^aRwf-HQJD?KDcML@!7MT&aMK} z&F!e@I+iOc1kv#Vtx{-o_1{BZ@T79Cbv}xUED!YT2aGkwFa#Yw;UJ*POK5M$qib$N zG4`AW5{LDMeG#qKU}iPVZgWeO8-@Is@|L5^-L=G^=?c%QSzXw`^Nw>*r!%ng_e#%1?@4p zn0kt;!A==@yJIpZ@tMblwUv}|qLr0YT$m&K`3f_}y?EumID%;Dvu)%?f9Pp6h3Ww^ zzH;$mg)!)$RIPOJeWsba>Yr@i5sRTO?BnF_i@dp&%Ie|q-GBA1JILtA(7HR9DMG-H z^)sH1Z9vvLl+I4`M!n9d{g=Jy0jkR_H-aT%UKZ*3(LlE2D-k|dj$MKpxdsYU!iw?) zN>oAQRl_z_7_;d`NyKZaBWj!n@J*JoRnGsOXA8|yGC^mTp;V)WW z@s&A_%Cmt8mGq+(;dHEWGnjC5IQ-7yY}SxMb@T!@%weLb)Z4va-bnruQsd3*_yNsN zgwO+OpjhgriDlW(`?*l|jb%da93jl=4TOh>vdz)E&6r+P zOd0OWu26~pqwm+j^&Q=h;YT@QSQeAsXfZLmr`F!;0QR0|MZB|O80CcU_WnV)^f7&> zDxzeQXTD>TWLz*d7I#(9J)G26*?es2sAb>e|b8~?C(cObKdpBC>L!=C-(A5+37gkXAD$jl@|^OW-lV~^`L zvQj>Q8(E&=G*HdzObFT zc5SOjW8u~m8Df)@FlggoJ@aAq`G5?KFYt#?t8y#;68p3l(Bre#Y+N?0no83Sbx{hG z{%L#Rhy!lu^5=Y?Bg{VfSxMYE|Fy$jT%X=l#o%f^MQfuNb(3)aHAyRKUh@GVdSIV1 zqvyo^!c{|#$23&4UJZ3qt*oiPB=V6wD>zKQlIY7htFsx*u=gXF z^r*$q4Xpen(;RQ$4u`XcV?h61aTEl=^w>*K9DQVvMk`?h#y^h+*VvnB*5Ji*MllNr z(F|;xeYOO4rq6Gg@N2|;ZQh1!W&}H- z>VmN;5O*AX}&;f>>2BbRO8ds+mm^e@Y~r?A%TV!Z literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_distribution-members.html b/trunk/paradiseo-eo/doc/html/classeo_distribution-members.html new file mode 100644 index 000000000..ace43bf55 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_distribution-members.html @@ -0,0 +1,25 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDistribution< EOT > Member List

This is the complete list of members for eoDistribution< EOT >, including all inherited members.

+ + + + + + + + + + + +
eoInit::className(void) const eoInit< EOT > [inline, virtual]
eoObject::className() const =0eoObject [pure virtual]
functor_category()eoUF< EOT &, void > [inline, static]
operator()(EOT &)=0eoDistribution< EOT > [pure virtual]
printOn(std::ostream &_os) const =0eoPrintable [pure virtual]
readFrom(std::istream &_is)=0eoPersistent [pure virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoObject()eoObject [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]
~eoUF()eoUF< EOT &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_distribution.html b/trunk/paradiseo-eo/doc/html/classeo_distribution.html new file mode 100644 index 000000000..f8f93da68 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_distribution.html @@ -0,0 +1,50 @@ + + +EO: eoDistribution< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDistribution< EOT > Class Template Reference

Abstract class for Distribution Evolution Algorithms within EO: the distribution itself. +More... +

+#include <eoDistribution.h> +

+

Inheritance diagram for eoDistribution< EOT >: +

+ +eoInit< EOT > +eoPersistent +eoObject +eoUF< EOT &, void > +eoPrintable +eoFunctorBase +eoPBILDistrib< EOT > + +List of all members. + + + + + +

Public Member Functions

+virtual void operator() (EOT &)=0
 The pure virtual function that needs to be implemented by the subclass.
+

Detailed Description

+

template<class EOT>
+ class eoDistribution< EOT >

+ +Abstract class for Distribution Evolution Algorithms within EO: the distribution itself. +

+It basically IS AN eoInit - operator()(EOT &) generates new indis

+The instances will probably be eoValueParam of some kind see eoPBILDistrib.h +

+ +

+Definition at line 45 of file eoDistribution.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_distribution.png b/trunk/paradiseo-eo/doc/html/classeo_distribution.png new file mode 100644 index 0000000000000000000000000000000000000000..29a1f5e6db0a53dbc2a791fa243c5de5210ec624 GIT binary patch literal 2254 zcmbVOdr*^C9*rW!Attn_6(Lm-T@h4dRbs$GLj@HG4|#?1DuO|TKm{S~mm*d~c11)5 z1Pl-nLwF`UjDYYFzydAu4kQprP*5N*Ba{#z#B5;K>0@^~yZgs?zu&#TGrzfW&YUy% z@2<|LVA}fH5C{Zz=Jd(45XkyQb-lPjL%puF8XKv9dah0$b}E%hU8+>gWb)T{)YaP8 z+}uoTRlQbk*IhpA><;;2Y8VHBYz#Sb67BJAt|ae8?GA403wJlDC|UZUy-Vj4 zy>x=;xT61}<$qR~UAowoP+f>Vt)ZFt$^=I zKb9RT^@}owA4-#n2joul25hVV8ShKyn!w`%%i;b=mT0Ak!nX*SY6=L<8turcqww$4 zKQ{u+iCF+EGonC_uR+p5%gCotQ0tp1;jN`l2@Z%vKaG;7ql6KuX-n;_ad-kxws)bVQGw_|h7u+l;ls8&o?|?OnFOfej-~cyW z+Tm4l*r4x}AbC{;N`Nr_^Fe45Q1C8k(J`ne`!#2Kx}R=L`<|U;at>#E&G$J+aP_+e zp>IUDj;Lg@ojSAET+KdR?GwWa0}f2xI#aw&TV`7jV7xYEP1w15fa#20J}~~bUQC<& z!{4^nH2)*s7EE4*DsP9|K!JPXt)CK>pey5=?-y!v=g7LWjlT{T3x;TA?ZbShK1xrY;WSE-I($s&NTVS+tgqa zMmkHG;thANakOHyYom>e$|udp4CS5bD?`6B{7>spMRrX4x1ng4XdmztY8t<1D#PcH znlBV3oQ;AttEt6j$v8HLfiFWXtO0LhP7I7$@D?*xo9 z_pLw~P4nV}B7zXP*B#NmaPAeZhB~sDc^;rz;Lw*2z*`m_WzK2aWXtOe!Fc9fQ0XUi ztR_SRTUZ09UpBUkXuw0Fm|gq{`-kr)Do0pi3WIO}?jzCMl3W>mhX%4b4gJP#uczeW z_L^^{BU-1hh}KR+ivnVEf9981xmw)N)yq482|aCOMrJG&>M9K?uDwnc9u)1-`@MUN zKx!k9n*X}m?8lvyN40nTX3Z3CW*Im2@%~jib!EFtiu>6pYV;;yTdSkNhaCN*is#4< zUWrc}&2L?X#0EdsC^j(q>ucex4inyd|=&R>RtH5$UlWNZqx4aU*2#Y zO}3Ub$tD94A99;7Xb8WO4zEK7Rr(Wgv5Xa! zf#Ee6)S^bmBs_(Ze>Czn?Ja@nLJ6Ln&I1V8y!X8DRDjpftsS{yuXkbWs`8UDFMtHg z8f-xPBwJR5?Gb>)=~`FfFJj(1M=++b3U>f*1$_A(c55;tQ0NbH0)k85;-q+5)<{DL z^Z4TEV-BfXww9Td3$$Th)b-e?NwWwfGx~yf{caj!fRHK*pdsR3)>!-|vpxjVE9h)i z>%S-}MN#|N9qNvA*b`a3I`;lg4*v_9|1*T2Qkd|~5;L(wb>AB80iq+{KYit_FHtx})lpe+p?@`7v^ko>iT8{nv*R4k z1F?T~0u9RNFGf}K`b0KQlpc{z6*6J!dNeo+gffsqnUyj!io@ZbAR<@JN^R+9&54TG zOM0?W$wcLXBltorkzwHQWi;2=NZO*6M)qNUT29pD}K{F(O> p)VC@6^q(+}TDDzr>*-h6bV}iz!+vpO_2UC_#?JX9&GzeS{{X|Yk(~el literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_dominance_map-members.html b/trunk/paradiseo-eo/doc/html/classeo_dominance_map-members.html new file mode 100644 index 000000000..3ac21f349 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_dominance_map-members.html @@ -0,0 +1,24 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDominanceMap< EoType > Member List

This is the complete list of members for eoDominanceMap< EoType >, including all inherited members.

+ + + + + + + + + + +
clear()eoDominanceMap< EoType > [inline]
fitness (defined in eoDominanceMap< EoType >)eoDominanceMap< EoType > [private]
functor_category()eoUF< const eoPop< EoType > &, void > [inline, static]
operator()(const eoPop< EoType > &_pop)eoDominanceMap< EoType > [inline, virtual]
remove(unsigned i)eoDominanceMap< EoType > [inline]
setup(const eoPop< EoType > &_pop)eoDominanceMap< EoType > [inline]
sum_dominants() const eoDominanceMap< EoType > [inline]
sum_dominators() const eoDominanceMap< EoType > [inline]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< const eoPop< EoType > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_dominance_map.html b/trunk/paradiseo-eo/doc/html/classeo_dominance_map.html new file mode 100644 index 000000000..d5712046e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_dominance_map.html @@ -0,0 +1,146 @@ + + +EO: eoDominanceMap< EoType > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDominanceMap< EoType > Class Template Reference

eoDominanceMap, utility class to calculate and maintain a map (std::vector<std::vector<bool> >) of pareto dominance statistics. +More... +

+#include <eoDominanceMap.h> +

+

Inheritance diagram for eoDominanceMap< EoType >: +

+ +eoUF< const eoPop< EoType > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+void clear ()
 Clears the map.
+void operator() (const eoPop< EoType > &_pop)
 Update or create the dominance map.
+void remove (unsigned i)
 Removes the domination info for a given individual, thus nothing dominates it and it dominates nothing.
void setup (const eoPop< EoType > &_pop)
 Create domination matrix from scratch.
std::vector< double > sum_dominators () const
 For all elements, returns the no.
+std::vector< double > sum_dominants () const
 For all elements, returns the number of elements that the element dominates Thus: higher is better It returns a std::vector<double> cuz that makes subsequent manipulation that much easier.

Private Attributes

+std::vector< typename EoType::Fitness > fitness
+

Detailed Description

+

template<class EoType>
+ class eoDominanceMap< EoType >

+ +eoDominanceMap, utility class to calculate and maintain a map (std::vector<std::vector<bool> >) of pareto dominance statistics. +

+It is set up such that

+if map[i][j] == true then i dominates j

+The dominance map can be used to perform pareto ranking (eoParetoRanking) or non dominated sorting. For the latter, the remove() member function might come in handy.

+

Todo:
make it an eoStat?
+ +

+ +

+Definition at line 47 of file eoDominanceMap.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EoType>
void eoDominanceMap< EoType >::setup ( const eoPop< EoType > &  _pop  )  [inline]
+
+ + + + + +
+   + + +

+Create domination matrix from scratch. +

+Complexity O(N^2) +

+Definition at line 81 of file eoDominanceMap.h. +

+Referenced by eoDominanceMap< EOT >::operator()().

+

+ + + + +
+ + + + + + + + + + + +
+template<class EoType>
std::vector<double> eoDominanceMap< EoType >::sum_dominators (   )  const [inline]
+
+ + + + + +
+   + + +

+For all elements, returns the no. +

+of elements that dominate the element Thus: lower is better (and 0 is the front). It returns a std::vector<double> cuz that makes subsequent manipulation that much easier +

+Definition at line 118 of file eoDominanceMap.h. +

+Referenced by eoParetoRanking< EOT >::calculate_worths().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:46 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_dominance_map.png b/trunk/paradiseo-eo/doc/html/classeo_dominance_map.png new file mode 100644 index 0000000000000000000000000000000000000000..61be94334ec52cdc7023fc77ea7de6b8290e0318 GIT binary patch literal 1575 zcmah}S5%W{7!II~fDuF)m5qqS8Y`9(R3u6eOeL%+lqmrtGyH-yCZs`S55WPpBKv?r zmLS6)3Q=T9m?BdGKM;mO2pBM|;7KFBus1zkeBbxH6xJ`FxYk`*8I!`N;)s2ot$edf4Wo8KOW)#0sUb;$BEb-Kc?A_F*Aw8rb-j>DEiKx z_P01}aFUl`QnScJzN~E$0Fu#DCF-PO)hNXUTnw#u0t%^{E0OXk2hvhD?2B4opjsE$ z1mNa7WWA1D_H?@rru@B467q4%U(C*zBzwP#Bf_7_%uXxCwqhnSfl*WX4^S+L?w^bzOO3Xf$0ia~C}nS~3#1}xJE%dnQp${xdpa^jlCV{yw+H-B?Drq$Uy zRg&nJYaC#!7jSYpn&Tb|hK;G7B5!;q%;G#tM)}XK0chSWLF8V@hDwiM94DgH z&zR*UaurW8`gU{3sJ5d-^fdKXWYg!6^u_$Ojl@-aaK(^~HuCx;RX8iMo)EAh|B;B| z;S@6X_Pot185-ua3mXI0a|%K$=hwm@>m8t{>jO0sKM*P&heE1R>RW0Xm^=-uEsf=` zN_0qz;5|QW<~9i&cCHm z=pFBSPw+aK7Cpqv7|qoFMmp*e@$j{(%&~^Rn?o(k*{i^bk+fZ_jK=?i)yZIyXt=Dk z-!s!g*zL~ad>!3xDO&S<6wm8yd4-_^{7&n-u3N#}Cg#Vg+Rr7WohFSD{SJ!@I`U_5%Fm)gDzG5}Sv&RPt7B z+G#kPf6c8aO$~ov&nG>gXnbdWDG`vm~oNMk>`Mfp!wW?(Xg-)(PwemW&nRK$c5z zawU=7+Q5c4v7wEDfMS5|OUIxR1SRcC)iy3;m$~y==vxO!<%TxiLSOWlO%QJCbIQo! z75uq&H<7QfAindJvh@R(myv8v3-pNh$?N@&(Lr|CPj>L?7;ri0E5&6Cyg5)9?~0sJ zuIUwad5g(>c&fU=cmdZuNH?|n{m=p~Zc+9dihNTtal^tCZ%!mv{6#g}OQW|W`}@@? z;ak?SwRf)xz{MBMq`pE&R*prda`VjEaVRqd5m*=nYNB5|5OdX3@Uf3%u4*Z|71`!L zJ!Cy4t3&`M7)d=BvD3DueR&~ktUD~jZn&A(E`~;MNlt_1y2Vn%0oU2@%5apAZ+=X| zV@r*Bv31?cdZMcyhppnXQTmu+A9{OT|FZ$@AkA@v2is-4*lTj6JBU<97pH{rcR5B) zepLc`(iaV$NC4rqqAUEBbI=d_3J`78mUWM*&dPNM+?oXl<|v7tAk^sncpn{rZF WvVK}^x~pPWhhfiJn?E)42>%CgAwhHi literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_double_exchange-members.html b/trunk/paradiseo-eo/doc/html/classeo_double_exchange-members.html new file mode 100644 index 000000000..4f581e641 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_double_exchange-members.html @@ -0,0 +1,29 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDoubleExchange Member List

This is the complete list of members for eoDoubleExchange, including all inherited members.

+ + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< double >)eoOp< double >
className() const eoDoubleExchange [inline, virtual]
eoBinOp()eoBinOp< double > [inline]
eoDoubleExchange()eoDoubleExchange [inline]
eoOp(OpType _type)eoOp< double > [inline]
eoOp(const eoOp &_eop)eoOp< double > [inline]
functor_category()eoBF< double &, const double &, bool > [inline, static]
general enum value (defined in eoOp< double >)eoOp< double >
getType() const eoOp< double > [inline]
operator()(double &r1, const double &r2)eoDoubleExchange [inline, virtual]
quadratic enum value (defined in eoOp< double >)eoOp< double >
unary enum value (defined in eoOp< double >)eoOp< double >
~eoBF()eoBF< double &, const double &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< double > [inline, virtual]

Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_double_exchange.html b/trunk/paradiseo-eo/doc/html/classeo_double_exchange.html new file mode 100644 index 000000000..0a1b2e7b3 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_double_exchange.html @@ -0,0 +1,49 @@ + + +EO: eoDoubleExchange Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDoubleExchange Class Reference

Discrete crossover == exchange of values. +More... +

+#include <eoRealAtomXover.h> +

+

Inheritance diagram for eoDoubleExchange: +

+ +eoBinOp< double > +eoOp< double > +eoBF< double &, const double &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + +

Public Member Functions

+ eoDoubleExchange ()
 (Default) Constructor.
+virtual std::string className () const
 The class name. Used to display statistics.
+bool operator() (double &r1, const double &r2)
 Exchanges or not the values.
+

Detailed Description

+Discrete crossover == exchange of values. +

+ +

+Definition at line 41 of file eoRealAtomXover.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_double_exchange.png b/trunk/paradiseo-eo/doc/html/classeo_double_exchange.png new file mode 100644 index 0000000000000000000000000000000000000000..a22becb420786347a3640a178ecd85ff29474abd GIT binary patch literal 1841 zcmaKtc~DbV6o+3#HlGm{`vNW_n-n20G9Vx(N?1c!EFct22p~#;u)7d74Je9j#|5!1 zi)=wzq?oWM3?zYIR8WDim|9R4*^x!9m;j-gKAmxCr|lp2+}}C(o-=pmeD~fTz4nmM zE7q?7002#Pb@BlK6-`7pEmuKo1K%PDnRL87e4Uj_B_fr|rhTTV92(6{uNbV?#-Z#F zRmaGuOmDAF3$DI@5BC9{DfGqK)@diXX#Gcy=A7R4NC2em20lhA68>hcH_3Jbbv zWD|a=dUH+0_yOA4KS}RK(|n|!JmydlS#mFsnK&)W@eU(`cSA9|zXC8l^O3f7f4VX{KQ;4Dk(#9mNQ8`tJo8Yd}!V9e>jm-l2#HNitR@EOn#WKPh z_CDP{PaRwvVB}FA<1-){N|iT*HSb)f%mQ#o?P;- z8#}B%R{$`jc7oJMGFlRgQu*A+Q+HtLyJq)Q8)&m}!qFX1#OZwu^~(F#5&^sAu->ch zq!&X@J-wN@9Pxm7mVwP1O?KKwb(q-nn=a~emA}hpa;I@`0jp7artm0)pz>e)KCu)5 z)+7(4kECg?S|V*#e;qu#86Or8F-Yk{HZVX0H9D6qyLA%CP_=rjBmnhXIEhN-Idw7vxjcGv8gZ zaGBSZ|MKf_{l>!#dlUbNy;Y_KK3Ms$)%DGR8Q)^0huE1CE8}fBs5@f4dmP&UZMl?o zY4>!VsQUEz)OUFes+nV!<4?57CmNE@l5u4+g??Un1>q5LN^4nk_ml1OAthhMRfgW? zf{hd1%vqLSDt=!Hs+>7h3XQJ^LJK>R8O!7e7vTl$*wXe<>|JK<%NK+DrRA}`k4yD= zUe~_52^q`OAv&^G|1O^ZS;QPWHxm%C_dP!1Kh_vQF1FOeGSNZog3E(T8mvm(b;fjx z>%?(gV}s{?eIUN#e+?n~QM`GhzwRt+5LIgS-^uK7CB&<-*bUTzgonuaVeSK5Y+Rnih_{*eO zAY;cl)tQ-$@WqJpzCnjXCYw zvHr2l7Zv{@ds_WY`Unmr{Tww5Sa6#C)TEEE{+m79z-=%VWC@g({Fwm^TMZU2@_Qb2 zIV5L8)>REPiX_pBIes}lXd82l#B)B_6HQyEC8sRbHDX(3sm*#aD<9HP6jzRv$)3sgWE4w#XmTo>Ykg9 zJ8ky+t|%+`hET7~m1(D;Hk}fbS25x(){VT-&oY`jJ~UNJOh_vV&#xp|Sa!dS)#@|k zzEg-aIF2>M*eGYR(!){x^W^yvK>> H5R&p2+5Ina literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_double_intermediate-members.html b/trunk/paradiseo-eo/doc/html/classeo_double_intermediate-members.html new file mode 100644 index 000000000..49877e12c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_double_intermediate-members.html @@ -0,0 +1,29 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDoubleIntermediate Member List

This is the complete list of members for eoDoubleIntermediate, including all inherited members.

+ + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< double >)eoOp< double >
className() const eoDoubleIntermediate [inline, virtual]
eoBinOp()eoBinOp< double > [inline]
eoDoubleIntermediate()eoDoubleIntermediate [inline]
eoOp(OpType _type)eoOp< double > [inline]
eoOp(const eoOp &_eop)eoOp< double > [inline]
functor_category()eoBF< double &, const double &, bool > [inline, static]
general enum value (defined in eoOp< double >)eoOp< double >
getType() const eoOp< double > [inline]
operator()(double &r1, const double &r2)eoDoubleIntermediate [inline, virtual]
quadratic enum value (defined in eoOp< double >)eoOp< double >
unary enum value (defined in eoOp< double >)eoOp< double >
~eoBF()eoBF< double &, const double &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< double > [inline, virtual]

Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_double_intermediate.html b/trunk/paradiseo-eo/doc/html/classeo_double_intermediate.html new file mode 100644 index 000000000..b467a2ba2 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_double_intermediate.html @@ -0,0 +1,49 @@ + + +EO: eoDoubleIntermediate Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDoubleIntermediate Class Reference

Intermediate crossover == linear combination. +More... +

+#include <eoRealAtomXover.h> +

+

Inheritance diagram for eoDoubleIntermediate: +

+ +eoBinOp< double > +eoOp< double > +eoBF< double &, const double &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + +

Public Member Functions

+ eoDoubleIntermediate ()
 (Default) Constructor.
+virtual std::string className () const
 The class name. Used to display statistics.
+bool operator() (double &r1, const double &r2)
 Linear combination of both parents.
+

Detailed Description

+Intermediate crossover == linear combination. +

+ +

+Definition at line 71 of file eoRealAtomXover.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_double_intermediate.png b/trunk/paradiseo-eo/doc/html/classeo_double_intermediate.png new file mode 100644 index 0000000000000000000000000000000000000000..2650f53b27817978f5f02414d1deb80a5a013402 GIT binary patch literal 1842 zcma)7c~p~E7XJc7#h|4&lZZe-h0>9bqQfbIAc29h3Y1X6uv4@UNLXWJDUFd&4?7eo zqCkQeBa18v0g5#Qri4u(tg<)(1;Y}8fPzTGOwgX=%sI}P`QzR9d-vVtyz_qd-c)y2 z`+a*4?F9f}pQD4V2LLFmDllI~Ss@=bpYT^~2i;vf?c{Q~0?OrlIz2E)f!;4ZpP$$! zpH&9c`^WFBM6Pde{{w;a9oM-N(~aXQKQWl`>FEYIZcBCDy=K zDJ|sX(A%lgya{g;!4!z20ph;hM!%52@kP4X^Yr9ZkQNZ7B$K22>>!0>NW} z9@>HOyaIC7_F~PU+n_6@xlrxz1)k)*8NaVg9M6fba(p7EG7c%@5Av#hAX*Y-8p<%- zU^KnqhUQ3l<#|}0B^zqF`?@#GNnY7LJiixrzY22AaQ;?O0dCk3T zXxEZq@F4DP^WT)i=pn`xVrC>s^k9M)EhWN?VHf8o&Aruep3ByS6Dw?yxnTk<6ZM&l zAs=t07=(Ti-WzRcBfjx4qbc~Fq|Il`&?V-cPvqCj?lYRERD`X^;XYab(nX3w_$OcA z7P1geR43bm65eo{B-w)Rq|KqFk*kZMFgiZ!kUM(*va7hQllJgP>TgH(dA+DX#|{2b z+UcG1xCmNTpzRm&EyDjqc+g;SU@HMzCv50JER{|0oZO6>;)O=%I(wn7vq%<5|EFp7 zgD48-j)X=>5F&y)$Uy>|f(#$6(bi_&1u{<+xz$RgNTin^gCW_&X_^s!GaC*hzno@K zbaqIM!-h%bkA#`0)7fgi1>FRQ@s|i#MZxEpvJPlz+?;F~|*N zzq_{c5 zqA!-p$$xpz7V1ahd!wGcRxt~#jk1ciLSGi7k}|KG=v2A6UK^?kwpdHH9+V_$V_sc>cuA!FY|N%n$~Mn<{OAH}Em2P+BJfE`$KBvF z8x{vJo5|U;)eh?f8D}ZiBPKVw%XO;Q%JOqjxEoAoH7qK!fdy4rLBnYuziS$=AP7sZ zgS(tEo;NoDK|_A>8Y{8L-XEA+>CNvW#pee|hLn_qU58P^RBK8KLiZ9%n}5LTTyYqL zwqtMoC)56oBK-4ct>T%u!ZQ20B46<=c=cntPq71!-O+;gSANvl<103B7rtlihjn0=d(S=U z2iw?SLov5DcE_QPu?w-68Oj9DD=tT^b9X$ z@>W8kTZ3`FTyy&$)MK~+z3L%$FHJkC<0hC%w}HVNmo7s@fXI=~i=Ia>2#3nW&`FNM~4h zQmFOUJ+TPe3LYGt(m+{VfBww;6ul4hxq#7Qo9c?DJvKZNc}u{(mV_<)q4i;I*RzCh%__DFz(iXy + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDrawable< Object > Member List

This is the complete list of members for eoDrawable< Object >, including all inherited members.

+ + + + +
draw(unsigned _x, unsigned _y)=0eoDrawable< Object > [pure virtual]
eoDrawable(const Object &_o)eoDrawable< Object > [inline]
eoDrawable(const eoDrawable &_d)eoDrawable< Object > [inline]
~eoDrawable()eoDrawable< Object > [inline, virtual]

Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_drawable.html b/trunk/paradiseo-eo/doc/html/classeo_drawable.html new file mode 100644 index 000000000..1b799733e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_drawable.html @@ -0,0 +1,99 @@ + + +EO: eoDrawable< Object > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDrawable< Object > Class Template Reference

eoDrawable is a template class that adds a drawing interface to an object.\ Requisites for template instantiation are that the object must admit a default ctor and a copy ctor. +More... +

+#include <eoDrawable.h> +

+List of all members. + + + + + + + + + + + + + + +

Public Member Functions

+ eoDrawable (const Object &_o)
 Main ctor from an already built Object.
+ eoDrawable (const eoDrawable &_d)
 Copy constructor.
+virtual ~eoDrawable ()
 Virtual dtor. They are needed in virtual class hierarchies.
virtual void draw (unsigned _x, unsigned _y)=0
 Draws the object.
+

Detailed Description

+

template<class Object>
+ class eoDrawable< Object >

+ +eoDrawable is a template class that adds a drawing interface to an object.\ Requisites for template instantiation are that the object must admit a default ctor and a copy ctor. +

+The Object must be an eoObject, thus, it must have its methods: className, eoDrawables can be drawn on any two-dimensional surface; it can be added to any object with above characteristics.

See also:
eoObject
+ +

+ +

+Definition at line 44 of file eoDrawable.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class Object>
virtual void eoDrawable< Object >::draw ( unsigned  _x,
unsigned  _y
)  [pure virtual]
+
+ + + + + +
+   + + +

+Draws the object. +

+It must be redefined in any subclass, it´s impossible to have a general drawing method

Parameters:
+ + +
_x,_y coorinates
+
+
+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_dyn_s_g_a_transform-members.html b/trunk/paradiseo-eo/doc/html/classeo_dyn_s_g_a_transform-members.html new file mode 100644 index 000000000..b8f051aa5 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_dyn_s_g_a_transform-members.html @@ -0,0 +1,28 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDynSGATransform< EOT > Member List

This is the complete list of members for eoDynSGATransform< EOT >, including all inherited members.

+ + + + + + + + + + + + + + +
cross (defined in eoDynSGATransform< EOT >)eoDynSGATransform< EOT > [private]
crossoverProba (defined in eoDynSGATransform< EOT >)eoDynSGATransform< EOT > [private]
crossoverProbaHolder (defined in eoDynSGATransform< EOT >)eoDynSGATransform< EOT > [private]
eoDynSGATransform(eoQuadOp< EOT > &_cross, double _cProba, eoMonOp< EOT > &_mutate, double _mProba)eoDynSGATransform< EOT > [inline]
eoDynSGATransform(eoQuadOp< EOT > &_cross, double *_cProbaRef, eoMonOp< EOT > &_mutate, double *_mProbaRef)eoDynSGATransform< EOT > [inline]
functor_category()eoUF< eoPop< EOT > &, void > [inline, static]
mutate (defined in eoDynSGATransform< EOT >)eoDynSGATransform< EOT > [private]
mutationProba (defined in eoDynSGATransform< EOT >)eoDynSGATransform< EOT > [private]
mutationProbaHolder (defined in eoDynSGATransform< EOT >)eoDynSGATransform< EOT > [private]
operator()(eoPop< EOT > &_pop)eoDynSGATransform< EOT > [inline, virtual]
PCrossHandle() (defined in eoDynSGATransform< EOT >)eoDynSGATransform< EOT > [inline]
PMutHandle() (defined in eoDynSGATransform< EOT >)eoDynSGATransform< EOT > [inline]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< eoPop< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_dyn_s_g_a_transform.html b/trunk/paradiseo-eo/doc/html/classeo_dyn_s_g_a_transform.html new file mode 100644 index 000000000..dfc9fbee7 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_dyn_s_g_a_transform.html @@ -0,0 +1,123 @@ + + +EO: eoDynSGATransform< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDynSGATransform< EOT > Class Template Reference

eoDynSGATransform: transforms a population using genetic operators. +More... +

+#include <eoSGATransform.h> +

+

Inheritance diagram for eoDynSGATransform< EOT >: +

+ +eoTransform< EOT > +eoUF< eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoDynSGATransform (eoQuadOp< EOT > &_cross, double _cProba, eoMonOp< EOT > &_mutate, double _mProba)
 Default constructor - receives values.
+ eoDynSGATransform (eoQuadOp< EOT > &_cross, double *_cProbaRef, eoMonOp< EOT > &_mutate, double *_mProbaRef)
 This constructor receives pointers.
void operator() (eoPop< EOT > &_pop)
 Transforms a population.
+double & PCrossHandle ()
+double & PMutHandle ()

Private Attributes

+eoInvalidateQuadOp< EOT > cross
+double crossoverProbaHolder
+double & crossoverProba
+eoInvalidateMonOp< EOT > mutate
+double mutationProbaHolder
+double & mutationProba
+

Detailed Description

+

template<class EOT>
+ class eoDynSGATransform< EOT >

+ +eoDynSGATransform: transforms a population using genetic operators. +

+It is the Dynamic version of the above eoSGATransform i.e. the operators probabilities can be passed as an eoValueParam, and hence can be modified from outside It is here mainly for tutorial reasons +

+ +

+Definition at line 98 of file eoSGATransform.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
void eoDynSGATransform< EOT >::operator() ( eoPop< EOT > &  _pop  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Transforms a population. +

+

Parameters:
+ + +
pop The population to be transformed.
+
+ +

+Implements eoUF< eoPop< EOT > &, void >. +

+Definition at line 125 of file eoSGATransform.h. +

+References eoRng::flip().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_dyn_s_g_a_transform.png b/trunk/paradiseo-eo/doc/html/classeo_dyn_s_g_a_transform.png new file mode 100644 index 0000000000000000000000000000000000000000..d6c7cbeca2da8e5e61d690672b5a30890b911743 GIT binary patch literal 1595 zcmZ`(dpOf;9AERpua?^H$Wl5xv#sQjV^1xqxom8)E{I%O#l(>jtvH!W%#>Jkq+*H4 zCFPb*a>;1Ol)HqQ4vUguv?EKDodd}&O&hvcU_x*gH_xpa|=lglT&zszOr z^%4XEp~bYLJ0TEA0Ok@v4W1KPe1C=)UB_K}87h?urYe;rD~p{Bvwwy}B8g~Fy@chW z5GQ+Q1ayOu%EtOi0TJ>xiZg@6XGP@Z+|IuCH(y()nZ#`8fB8@9LKaUb8n&m*AJ z($HbvSLeKS_kia-v9xT4Ip@`*IA(%#zvAy(VpudqPyQ4krg2)j66;=61$C#jds?$6 z#s+RrJ&|{aIyia3Z%c#0azS4hmUgse>%I4Pn(F$O$rL#{MdgjM&e+n}Nhojb81|(x zkQ-6$>aF?#dAM>j89$cTZ?-(>Y$dwQ0#wrIuaVurOrs=L_7MN>_ZQL_-3vH&+8CK8zDMp$w zb+b%Fn8uO@ZP2ys7W9U>22^VHWqn>B>ajc9`gSW?j73Rz19wbm$xVWr@#>F+^4Iku zAok#G+&*YmK`JZhy^%nQB#ge&sgLusffvP92u2xE>ltc zS?yD+?W^%<*E-8Wf>K!+anisu%f-Y2P!>j>tlD#fvXn02f_MbP2dMxKiCz?spd;}7 z8kBKjrbCM%^ddMDS1;z+WxcSu zL+9^$N8)35`q>qxZ`7XNp3?XpI%0?#k4*7qg%WCB9{@uR1OsQCocHH!66r5fU<9JM z;m7QbQ|u0wFx9ShzqY>bx@gSj$NWJMxn3+_9bnE6^Cn6@+!&!wfnU;pCBdwqv z8k!7TN_dPMo=GXXm%B!R~%Xau05DjjhieSYo8049eXypj7KAK|g1*!~m>E z%oS2iv6jh0^nqrStG51Bi%7pJvz)gWcq5dX9?UQh3<j$Y@Wt{>Yk*GuiZj*{ zlkU(KorO!kJIC{x;dBYn0v)3rXY>6|`QMt8_Fj^WQaB6EZp-29jy2kJE)u{8I-O{> zEixurTr=2`F09~8#m$cp{L*@oD33=fj9Gz^c6tNZ#txPzW`|C9U0B`W zbwSiFGON)gMEy%pahpcvLcvyJfvE_KjyGoB7`QS2>BmlTo&5;8WNg(6FlblY2b^Ox z_iEQe0aY)6LH^L{^4aukv6y|OJ_dTqt;G3R2>goe=-I9nSKAXM+UpG(*2St3{N^9} zlL7`veOQ`ajt?p9)5SK_aiHLXAPle6!Qr|f6Eu01U@eAd)G&L9<_^(^sTD8ka5KpL zxk=hIw^MxT+QF3>Cm6g^DdpAzN^#O)Drxx3-z?BzP}UlZtD5eOg}dv?6acLOXua>c eqUAe3st|+u@9f{SaOdHl9>HYT(@U+{g1-Pi<+2d~ literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_dyn_updater-members.html b/trunk/paradiseo-eo/doc/html/classeo_dyn_updater-members.html new file mode 100644 index 000000000..f1a86301a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_dyn_updater-members.html @@ -0,0 +1,23 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDynUpdater Member List

This is the complete list of members for eoDynUpdater, including all inherited members.

+ + + + + + + + + +
className(void) const (defined in eoUpdater)eoUpdater [inline, virtual]
eoDynUpdater(eoUpdatable &_toUpdate) (defined in eoDynUpdater)eoDynUpdater [inline]
functor_category()eoF< void > [inline, static]
lastCall() (defined in eoUpdater)eoUpdater [inline, virtual]
operator()()eoDynUpdater [inline, virtual]
result_type typedefeoF< void >
toUpdate (defined in eoDynUpdater)eoDynUpdater [private]
~eoF()eoF< void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_dyn_updater.html b/trunk/paradiseo-eo/doc/html/classeo_dyn_updater.html new file mode 100644 index 000000000..a49265de1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_dyn_updater.html @@ -0,0 +1,49 @@ + + +EO: eoDynUpdater Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoDynUpdater Class Reference

A base class to actually update an eoUpdatable object. +More... +

+#include <eoUpdatable.h> +

+

Inheritance diagram for eoDynUpdater: +

+ +eoUpdater +eoF< void > +eoFunctorBase +eoCountedDynUpdate +eoTimedDynUpdate + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoDynUpdater (eoUpdatable &_toUpdate)
+virtual void operator() ()
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+eoUpdatable & toUpdate
+

Detailed Description

+A base class to actually update an eoUpdatable object. +

+ +

+Definition at line 51 of file eoUpdatable.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_dyn_updater.png b/trunk/paradiseo-eo/doc/html/classeo_dyn_updater.png new file mode 100644 index 0000000000000000000000000000000000000000..fbe4e3a81fe448844ec08b8adb3ca8db6c9d332c GIT binary patch literal 1175 zcmeAS@N?(olHy`uVBq!ia0y~yV3Yu|f3PqE$)l5>bOI@f0G|-o|Ns93ng9PEm_I*Z z0+0p92M!#lKJ@d-nheT<9w?FiY`?dv-+0hvnpVh7kdUWC8%8i{TN=`h!c;Nl#KRGx3h4(+Z?7(KU zCS}VMt?Cs?uXT-Hw`*-%bv;*qilObIrIRl{^Y*-*B$czd%&6>aZt>n8;~7_#l;5uU z#+@5Iy*=x$`}I>EGpj3S8l>gCR*>Ahe@!}J>mtve`E8W9@^qt3!kHGo zOH0qJFr0jLS>&(USz`9H|IC=^)jP}gK8w+WMxKG}2?sr& zeg3&8TJfM)+jWLE9@Z2M1!qP{t`h+cZA?ZY6BahWgt{ggt+}U@^wmr%Md7mNvJ<)b zk-KK6Y?C^EI_2h$1xst2!w#ozvRNv4S~|z+f;sQ>Ldla;V?8GCyA`7`x#)J{cCWQ5 zak=Z>%$#wXZ?|qr+czJ}w3=1_=NW!BnjJIg|FWB3como>PdKEBhfUWCz4xta6W8(( zBW=mBl__CHd)N$cx(n!3h4p72=9-*vST^5hRcBb?$9G1ClFPTORS(tDzAdLa`O*}x z-*-~Nw$&~_BeQASM!AX|K0dkblD8japE~~iOw5Uv!!CdJAInWn+u<|AcU_y^IW^H! z+uBdB>5mXSaYy$uONv7Ae4f?bQ?>G|T_anAwPsG`Sq*Yp9J2&U2%!a<+o=>NY4ax7Y2=0y^YUvnT&CA%AuU1=aS|t?{4(m?D^xSiCdcLwvA;5M*?4Xyqx(vb=ldg z&We18|F;%Zbkt2$C{FBPAmF>UlQW8I<@Z&cDCv0ki-Fo}!jgwl)ykEM{1KMs0q)a@SFDR>3mAWH(>wk+U zYu;|XQl`6kipFo<)anVclA@`b?6Y>;RJ%X(n4mE^PkY}a!)CpsfgzP;ijR|3XI@iS znVz;N{h6xYo{K-SE6Z*g7vD6_b?iF)#Oa9hoPJ5$=Y_Y9pP8s|6c}bREq=URR(E%< z(x2G#+fQvSPn&!@FnPky1CkN>YjjQKH-2xDndrHEnXpl{Bj1S^XRkIJ?FKU5eEPpX n%eig6&(~iI{T?s%np@wIJn=)uk;GhJDZ=3C>gTe~DWM4f@2Vt$ literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_e_d_a-members.html b/trunk/paradiseo-eo/doc/html/classeo_e_d_a-members.html new file mode 100644 index 000000000..84db385fb --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_e_d_a-members.html @@ -0,0 +1,18 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEDA< EOT > Member List

This is the complete list of members for eoEDA< EOT >, including all inherited members.

+ + + + +
functor_category()eoUF< eoDistribution< EOT > &, void > [inline, static]
operator()(eoDistribution< EOT > &)=0eoUF< eoDistribution< EOT > &, void > [pure virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< eoDistribution< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_e_d_a.html b/trunk/paradiseo-eo/doc/html/classeo_e_d_a.html new file mode 100644 index 000000000..9f2f38559 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_e_d_a.html @@ -0,0 +1,41 @@ + + +EO: eoEDA< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEDA< EOT > Class Template Reference

eoEDA: Estimation of Distribution Algorithm within EO +More... +

+#include <eoEDA.h> +

+

Inheritance diagram for eoEDA< EOT >: +

+ +eoUF< eoDistribution< EOT > &, void > +eoFunctorBase +eoSimpleEDA< EOT > + +List of all members. + +
+

Detailed Description

+

template<class EOT>
+ class eoEDA< EOT >

+ +eoEDA: Estimation of Distribution Algorithm within EO +

+The abstract class for algorithms that evolve a probability distribution on the spaces of populations rather than a population

+It IS NOT an eoAlgo, as it evolves a distribution, not a population +

+ +

+Definition at line 41 of file eoEDA.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_e_d_a.png b/trunk/paradiseo-eo/doc/html/classeo_e_d_a.png new file mode 100644 index 0000000000000000000000000000000000000000..44c527af996de4b2dc06c1573477934e0dfd6503 GIT binary patch literal 1816 zcmbW2Z8Vf=7{{l)wAs+9>`n@2w+Msv5*rQjmWD=Ujc0c~Piz`RWX6n_k+(?NN{Swo zkllu5^gQ0u%!p*yC?T0{V|x;fhymsuBOtRIO`zQg*~`Gz)PuAs;pAkT3Q-%S>;wvYisMN zHlANqQNskx9E%r~SGIx`(zN>Z*q!5$mjMyX2Bp}Y zwwhU-)H}G)>EWMPTXlFlk-pv{DtV+MWZ(VTTTWk7jO&Cvf&3V-z(>3O2n8I=U+E$d z;J{m?ZmgZH&*{URx!&oGl$>KZ1WVS>gaScgoZWa;{veb+Em%6*1C+&*W=M9rXJh0} zpM2d3bmJ532?PtmOh_ld>mMC`Q1pm81Qz#ue3NKLuH#B{${E%J!5RfjUdFDXOuTM> zYo!8^59qrhBkkEE4@7m8RQuG|^Q-eyo^Ijfnp%gI>jv4)cVAOb<)XHTD+=lzS9+!g zuxmwz8x(6mJNn`^QCLz`d?is@3pqCu#%iJ0%87w=Mq(t86Scu9QY2C+28o5tjyU;q zld{Kg@g=$=kozIeL0ckx^MAqdjYkCNtMi2{AYO0X#h0250MTPhq#ts&k; z=hw$kc)J5J+aGTJyvPTCblAEvKf|e)v zSPN=wb5o~V0~Xi@BxWwkT($wx27v1*D@-rzDw;H2HNpxre8=dyx1;)vn1z=x_(;T+ zPx(vmU53rN?|R%mi`_R9QePODxENx%KVuiisS7{nUVismS}&Y-yT$!u6FYF1`cnxNTBOaoWi;Tp{|at7p9dU5@FR_|PSP_sf5BMne&k-6<>C6*O%$c3zeX3X%j}8C^iEp@jk{NQ4tp+Zj`nd;VD))pRUz`xn)a z&9i~ii7rF+&$@5owjz#c9)LAS!(<_bX&i$rgfgb}KV?)6jA~TtyP>-@Sk%X2{kKh~efe@0eKldDV4smiU&e zQ?yA1EwwtGVV@>+6`$+lpUWy7%BzxMe|+lzYF-5!1C=LR?l1H*DCtTXY`-$0Tl)kTR3-asm#9Q45`>io eM0Mm3EE@F>r}%EjK3=9;V;F*$pC{rTlKv-QJC)S{ literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_e_p_reduce-members.html b/trunk/paradiseo-eo/doc/html/classeo_e_p_reduce-members.html new file mode 100644 index 000000000..02e3bd417 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_e_p_reduce-members.html @@ -0,0 +1,22 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEPReduce< EOT > Member List

This is the complete list of members for eoEPReduce< EOT >, including all inherited members.

+ + + + + + + + +
eoEPReduce(unsigned _t_size) (defined in eoEPReduce< EOT >)eoEPReduce< EOT > [inline]
EPpair typedefeoEPReduce< EOT >
Fitness typedef (defined in eoEPReduce< EOT >)eoEPReduce< EOT >
functor_category()eoBF< eoPop< EOT > &, unsigned, void > [inline, static]
operator()(eoPop< EOT > &_newgen, unsigned _newsize)eoEPReduce< EOT > [inline, virtual]
t_size (defined in eoEPReduce< EOT >)eoEPReduce< EOT > [private]
~eoBF()eoBF< eoPop< EOT > &, unsigned, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_e_p_reduce.html b/trunk/paradiseo-eo/doc/html/classeo_e_p_reduce.html new file mode 100644 index 000000000..989785c95 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_e_p_reduce.html @@ -0,0 +1,59 @@ + + +EO: eoEPReduce< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEPReduce< EOT > Class Template Reference

EP truncation method (some global stochastic tournament + sort) Softer selective pressure than pure truncate. +More... +

+#include <eoReduce.h> +

+

Inheritance diagram for eoEPReduce< EOT >: +

+ +eoReduce< EOT > +eoBF< eoPop< EOT > &, unsigned, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::Fitness Fitness
+typedef std::pair< float,
+ typename eoPop< EOT >::iterator > 		EPpair
 helper struct for comparing on std::pairs

Public Member Functions

+ eoEPReduce (unsigned _t_size)
+void operator() (eoPop< EOT > &_newgen, unsigned _newsize)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+unsigned t_size
+

Detailed Description

+

template<class EOT>
+ class eoEPReduce< EOT >

+ +EP truncation method (some global stochastic tournament + sort) Softer selective pressure than pure truncate. +

+ +

+Definition at line 83 of file eoReduce.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_e_p_reduce.png b/trunk/paradiseo-eo/doc/html/classeo_e_p_reduce.png new file mode 100644 index 0000000000000000000000000000000000000000..18358d4e388bb0604e093b045ac407510f0f225a GIT binary patch literal 1860 zcmah~X;72b8s<{^Sz|uX79@mCXp6;3Ysw-qEE3snibN2tLO=polCV`6f?;VWd}O4c zEQ150K|)cna0!A40!kLj-atU07!V8%7zj`{6Ev7KdcAY++_~fZah~(M?>Y0#ocDRp zIY0Rmd_WiyrlX?+;{Wb>LPtk8OUrqBA80XR*pi~15dOzbdTBHoE!Ajv6&0jHEqgn7 zJYJeWBh`j~OFBUa)N!Amh|EAehEmI4jNzY@<;adbkYB<%^YZ!NqVHhV(O*bmU7M8{{)d9OtY>-ENi zUq*4&A}OKeA}(Bx?o9%mx%!K;y9N9{({=F)D1N6|XVr9A88_JKwhO0}+XR%iyL~Nt zSg_IhdRH~@RK82ZF1a#JiWdnZ0x#Q5QvIPQ16k)yqLWPSm4ikX93-#F2o;AL?@d%p zB9)OUH+za_tEgIzo5Q;eJW?0 ziFIbw_4Kxauou}FG^7TMaLf$SiO}a<-lHfsD(K!2zUMKS+Hu$%Q zg|^0X`Aeu9&OlePb!e$cNC5o=)LAHuDB5A{_yA3bL9aN4%S4|$VqEO$<;Z{3LmmzK zHfaslf3@RWgmU6yM{Jy|)!a5I7SSBqF8vZxOCG-Il_zJ-$Te5VYg5v0&s$FPzDHX| zXJw0l9iK1N_?&)8fd;HX_og&7jQE&_SkEljUI>M_AA&!N_QBpjzb(93?S8M{1itdy z4#sSUy+h7=Ld(8oeK0Hi2g`Q;;94aPvGUpb9D2Wh+Eq(RVMgXp0={Rc3l~V$grO6;F3qq|;VvDQg~3iI=jhiJ7%2 z+`AW;VfB?dVJ=kQ#qxchLa7p4q0}g7`_r3s2}8etqF*n ztYYHEp9x5<`nieb#}pA9Xjkr|2}L1ZIlIazOiLjC`=-2ObA|vhgB>&n2QJKia3o>I z1nC*xVrYoedyCl;Le~F1_WPUq&)Hs=V0lVrnq05uofld|LY}avJ1t)gY;P8=M>7x4 zcjwGL^9>QRRjE^dd{=T>wHi6?l;8)w@)L(j0Y6!#<+QMfm~N~*A9ev5;v(T3Tq;5~ zRjNL<7;b29DMhA7+JuQojrul=7V*5NwvT&8klU?-7-UoMQ4kwuC56KzdL{R^dSLa` z)#L%Nt%nM}!iONvfv@&Y`9chH!?`yPS;!7o#=%4KXF}7&v^77J;-58h{$DklWUyNK cYCxlVW}dPGWjC>3`{n82y$GJ1qol0A0J|-FuK)l5 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_e_p_replacement-members.html b/trunk/paradiseo-eo/doc/html/classeo_e_p_replacement-members.html new file mode 100644 index 000000000..9648be55c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_e_p_replacement-members.html @@ -0,0 +1,22 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEPReplacement< EOT > Member List

This is the complete list of members for eoEPReplacement< EOT >, including all inherited members.

+ + + + + + + + +
eoEPReplacement(int _tSize) (defined in eoEPReplacement< EOT >)eoEPReplacement< EOT > [inline]
eoMergeReduce(eoMerge< EOT > &_merge, eoReduce< EOT > &_reduce) (defined in eoMergeReduce< EOT >)eoMergeReduce< EOT > [inline]
functor_category()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
operator()(eoPop< EOT > &_parents, eoPop< EOT > &_offspring)eoMergeReduce< EOT > [inline, virtual]
plus (defined in eoEPReplacement< EOT >)eoEPReplacement< EOT > [private]
truncate (defined in eoEPReplacement< EOT >)eoEPReplacement< EOT > [private]
~eoBF()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_e_p_replacement.html b/trunk/paradiseo-eo/doc/html/classeo_e_p_replacement.html new file mode 100644 index 000000000..3a0a09d6e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_e_p_replacement.html @@ -0,0 +1,50 @@ + + +EO: eoEPReplacement< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEPReplacement< EOT > Class Template Reference

EP type of replacement strategy: first add parents to population, then truncate using EP tournament. +More... +

+#include <eoMergeReduce.h> +

+

Inheritance diagram for eoEPReplacement< EOT >: +

+ +eoMergeReduce< EOT > +eoReplacement< EOT > +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + +

Public Member Functions

+ eoEPReplacement (int _tSize)

Private Attributes

+eoPlus< EOT > plus
+eoEPReduce< EOT > truncate
+

Detailed Description

+

template<class EOT>
+ class eoEPReplacement< EOT >

+ +EP type of replacement strategy: first add parents to population, then truncate using EP tournament. +

+ +

+Definition at line 102 of file eoMergeReduce.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_e_p_replacement.png b/trunk/paradiseo-eo/doc/html/classeo_e_p_replacement.png new file mode 100644 index 0000000000000000000000000000000000000000..29ef2a771125fa3176785c5422a361e5c9b1ae48 GIT binary patch literal 2195 zcmbW3c~H|y7ROPUSq6zHpx}=q10Gy*8VDc+1Tx4Vhao5|kx`UGPJQ~+G)33kP zmwmk4V2XgEoSYoY{fH|@PHyvz%ofRSk@bP_+vBo9!{;a#EtN`Trd0Z*qT;E;Zi>fv`N}!XkB7?1DHyuD9>x;Ncx9}(yEbZomx?3(O78@u_5Nh@_RbQ2XjPJX#e(aFh-j6*ueoRtGZ|qW zbQcN|=cOta1%hjprVrRB!1+EHpI%2GfPCKuHs#h>RF}Y~JHr^x(M+nec)E5zZulQY z92mVgaN$@daw-QEQ+MVfSa1pv?nM&sLNSOggudBzkydY2O10>^FI zwi5{=fw@_E0D}1_-5c&LFltW<_C$+2^0?q%-wAnsxD$BeWCc2F{_7aEo}iG43X@0q zjKr}WNu$k1J~Oy6$ZHtNu3j*x_fik0YwFXOkBSyU4Wy`Ljo<`d^3DIc(bD z*cCD8)Q`TO_Uc@qsogS#QY%oqhl}T^m$%N<`Bp@DI}Koon=Px^s@D#V-2U5DS@7(7 z@EKXKtuODZXC;4T359Dpk|nMr^3(gpzBT)^;fE!f7nKX-<$91}Csc1TA@ z6EomcX$o3?V_nKUyyo;hp>1x?QGH%vK$NpbT#cz^#AMhPY3&d$t8n1U{p}B)E{(r+ zny6{k24g<)NE9^LRZYE72Mq3SS0&}Gd}Gb6`3m&NI*$E8faa;FxTJ!ni0pB=S3c+D zKC-81<13!gxM1iuef{+ar*ZicRNLvuy#G3+IK2d4HDuM4*k`bJm~k@wC2G#Q zLL+44KK&rmv0r2p)1JrPl~kXwFwi(Uchpdmid<}ko!41P8#G{~%$1b{*7j#yXYf2>-t~V${#_ts74tdy|8xcr`cS}{ zpWc?&;-EtoxYS{cn z^zp($Se~PNhty`)b4YY$3H9_xJqTj0jsBVGntZP0ut&CW#_gDk#uK?VK#$@6ssW>1L$UpM$ zt=C5>1nFkU=H{u&GLENLbpRlz_n`h~ssARae?YzKRc1+P9(FfTViv)n<8+EBFF z>1>8taq#6FnC1yxcz6h@+YT_hK^VUSZQnUddQ;+}Nn7a2qF*Ea@>Km zcz=|~PL_x&WxXi#v6Jr=OA>X%cwXrPlI1A@RwAT0}(oVwo!xjas5e$bGm7m zs&!YVt5!CymqvG+_M@`^xQD(@>$w#7C0skRxuE_G-0b`Ho%iv~zp*S}bbMRWKwLkX z2{8Eg7nyhQSE?bh0gXQL{5S;rw}<=Rh4@-1OI4$Kv9c0xV}Ie!pQE-R5YU10c0D1R z?e$WoND3Ruac-10VKw=lt~+5bp`*!H&5 z$yy-^@5`|Zv|JX=5f>cm10}j2_GHA{@^&M49STdfit(t{;P4AM{I!-;0yl#X3;8 zk)EKr{KdaS3AeQVaBnI|UHgZH0B@7pAy_>A?51>q@}KX2Ugv z;AFidVQ^UsFq7g2E1{3;<^}>hf@~cG0SdN@R%=@iF{`43RS<5nAB3Dc+RL@c`BcU~ E0c_PybN~PV literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_easy_e_a-members.html b/trunk/paradiseo-eo/doc/html/classeo_easy_e_a-members.html new file mode 100644 index 000000000..486c2fa05 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_easy_e_a-members.html @@ -0,0 +1,38 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEasyEA< EOT > Member List

This is the complete list of members for eoEasyEA< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + +
breed (defined in eoEasyEA< EOT >)eoEasyEA< EOT > [protected]
continuator (defined in eoEasyEA< EOT >)eoEasyEA< EOT > [protected]
dummyEval (defined in eoEasyEA< EOT >)eoEasyEA< EOT > [protected]
dummyMerge (defined in eoEasyEA< EOT >)eoEasyEA< EOT > [protected]
dummyReduce (defined in eoEasyEA< EOT >)eoEasyEA< EOT > [protected]
dummySelect (defined in eoEasyEA< EOT >)eoEasyEA< EOT > [protected]
dummyTransform (defined in eoEasyEA< EOT >)eoEasyEA< EOT > [protected]
eoDistEvalEasyEA<EOT> (defined in eoEasyEA< EOT >)eoEasyEA< EOT > [friend]
eoEasyEA(eoContinue< EOT > &_continuator, eoEvalFunc< EOT > &_eval, eoBreed< EOT > &_breed, eoReplacement< EOT > &_replace)eoEasyEA< EOT > [inline]
eoEasyEA(eoContinue< EOT > &_continuator, eoPopEvalFunc< EOT > &_eval, eoBreed< EOT > &_breed, eoReplacement< EOT > &_replace)eoEasyEA< EOT > [inline]
eoEasyEA(eoContinue< EOT > &_continuator, eoEvalFunc< EOT > &_eval, eoBreed< EOT > &_breed, eoMerge< EOT > &_merge, eoReduce< EOT > &_reduce)eoEasyEA< EOT > [inline]
eoEasyEA(eoContinue< EOT > &_continuator, eoEvalFunc< EOT > &_eval, eoSelect< EOT > &_select, eoTransform< EOT > &_transform, eoReplacement< EOT > &_replace)eoEasyEA< EOT > [inline]
eoEasyEA(eoContinue< EOT > &_continuator, eoEvalFunc< EOT > &_eval, eoSelect< EOT > &_select, eoTransform< EOT > &_transform, eoMerge< EOT > &_merge, eoReduce< EOT > &_reduce)eoEasyEA< EOT > [inline]
eoIslandsEasyEA<EOT> (defined in eoEasyEA< EOT >)eoEasyEA< EOT > [friend]
eval (defined in eoEasyEA< EOT >)eoEasyEA< EOT > [protected]
functor_category()eoUF< eoPop< EOT > &, void > [inline, static]
loopEval (defined in eoEasyEA< EOT >)eoEasyEA< EOT > [protected]
mergeReduce (defined in eoEasyEA< EOT >)eoEasyEA< EOT > [protected]
operator()(eoPop< EOT > &_pop)eoEasyEA< EOT > [inline, virtual]
popEval (defined in eoEasyEA< EOT >)eoEasyEA< EOT > [protected]
replace (defined in eoEasyEA< EOT >)eoEasyEA< EOT > [protected]
selectTransform (defined in eoEasyEA< EOT >)eoEasyEA< EOT > [protected]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< eoPop< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_easy_e_a.html b/trunk/paradiseo-eo/doc/html/classeo_easy_e_a.html new file mode 100644 index 000000000..82d90de72 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_easy_e_a.html @@ -0,0 +1,113 @@ + + +EO: eoEasyEA< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEasyEA< EOT > Class Template Reference

An easy-to-use evolutionary algorithm; you can use any chromosome, and any selection transformation, merging and evaluation algorithms; you can even change in runtime parameters of those sub-algorithms. +More... +

+#include <eoEasyEA.h> +

+

Inheritance diagram for eoEasyEA< EOT >: +

+ +eoAlgo< EOT > +eoUF< eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoEasyEA (eoContinue< EOT > &_continuator, eoEvalFunc< EOT > &_eval, eoBreed< EOT > &_breed, eoReplacement< EOT > &_replace)
 Ctor taking a breed and merge.
+ eoEasyEA (eoContinue< EOT > &_continuator, eoPopEvalFunc< EOT > &_eval, eoBreed< EOT > &_breed, eoReplacement< EOT > &_replace)
 NEW Ctor taking a breed and merge and an eoPopEval.
+ eoEasyEA (eoContinue< EOT > &_continuator, eoEvalFunc< EOT > &_eval, eoBreed< EOT > &_breed, eoMerge< EOT > &_merge, eoReduce< EOT > &_reduce)
 Ctor eoBreed, eoMerge and eoReduce.
+ eoEasyEA (eoContinue< EOT > &_continuator, eoEvalFunc< EOT > &_eval, eoSelect< EOT > &_select, eoTransform< EOT > &_transform, eoReplacement< EOT > &_replace)
 Ctor eoSelect, eoTransform, and eoReplacement.
+ eoEasyEA (eoContinue< EOT > &_continuator, eoEvalFunc< EOT > &_eval, eoSelect< EOT > &_select, eoTransform< EOT > &_transform, eoMerge< EOT > &_merge, eoReduce< EOT > &_reduce)
 Ctor eoSelect, eoTransform, eoMerge and eoReduce.
+virtual void operator() (eoPop< EOT > &_pop)
 Apply a few generation of evolution to the population.

Protected Attributes

+eoEasyEA::eoDummySelect dummySelect
+eoEasyEA::eoDummyTransform dummyTransform
+eoEasyEA::eoDummyEval dummyEval
+eoContinue< EOT > & continuator
+eoEvalFunc< EOT > & eval
+eoPopLoopEval< EOT > loopEval
+eoPopEvalFunc< EOT > & popEval
+eoSelectTransform< EOT > selectTransform
+eoBreed< EOT > & breed
+eoNoElitism< EOT > dummyMerge
+eoTruncate< EOT > dummyReduce
+eoMergeReduce< EOT > mergeReduce
+eoReplacement< EOT > & replace

Friends

+class eoIslandsEasyEA<EOT>
+class eoDistEvalEasyEA<EOT>
+

Detailed Description

+

template<class EOT>
+ class eoEasyEA< EOT >

+ +An easy-to-use evolutionary algorithm; you can use any chromosome, and any selection transformation, merging and evaluation algorithms; you can even change in runtime parameters of those sub-algorithms. +

+Change (MS, July 3. 2001): Replaced the eoEvalFunc by an eoPopEvalFunc: this immediately allows many useful constructs, such as co-evolution (e.g. game players), parisian approach (the solution to the problem is the whole population) or simple distribution of evaluations on a cluster. In case an eoEvalFunc is passed, it is embedded on an eoPopLoopEval This makes things a little uglier (required an additional "dummy" member

+Note: it looks ugly only because we wanted to authorize many different constructors. Please only look at the operator() and there shall be light +

+ +

+Definition at line 63 of file eoEasyEA.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_easy_e_a.png b/trunk/paradiseo-eo/doc/html/classeo_easy_e_a.png new file mode 100644 index 0000000000000000000000000000000000000000..530ecd395d01fffce8a04e3a6753995dc50f8b6e GIT binary patch literal 1508 zcmaKsdo+}39LLA>%9|nY%NnH4T;vu-i4>U`MsgeDHYkRrBuj3s9d~Aj+}YSTJ6T<5 z4=EHGa+$Hhj#$c|P=k*$sg}0#eNdwn*13e(*l&rcQP8u$4$8QYn#e%gX}_rRwwKa=8hek{8mW%y~D8 zJAybj7K}j1#@mxg9*oPPvc8LzdQe8nb*<37Vcs*X+^&ZxLG{Y*MDbL$ucaxSVj3#( znfwKJvUuaT@^rC=@cE7RhjPzfs}h!9tz-c1jv861U}h?qk2BtXuxi1_;CX(4hkcye z%@WX6zxWfis4l(HqM7a7C)$qfbr#&Ejh6gOE?h}SB%R$enA<*8+C=?!$p&oDNHQ6D zq+!^2iKbQI>3A0Ape9V$VZF!wL;2@N;PDl^Qftr54Sw0<55530sR(7Zrq? zR@;Czlih=v#L(J$Dr*VpFG$$H*<7h<(#+8*;EGimuZvAuBy6&Aca=d>2KHg9IXp+> zpY0+6opII`Q*bYY%8fP8$1eNLf{E(tLH6nSazU)p=(cS#RceeG&vY(<^oATzuV?voca|w-ZjYCREXmz_Tsg zixAnUR36A_f6vqoL4zytq#da9dVD1BowxCAd}-r0CLZnNX?UCl5R|%it6$ER{Vn@S z<=x?s27lPsaL^h*A$k;gZ6-fQUYhVVB4dT7fbSgHIUI+9edEu?Xb#G&jdaMt;VL51T z%sFic@=_unw^LtHeQ7L?Q7;XERjfWl_NjiI6V^L7acOBS1Q?H|WAXyn6KcG1)@GlX z!Xx0S_L_ZMXRRAW9&Vu2-)BO+9N7IeA+Dy;a*$Gyv{~UzS-+$>AAAf4j<8PNsuQ(05t&4bY+`c%6k)Qt-k7}D2hAhRD@ax5x$#q+T}TXS zZGe65o9$^R$P8UUugl{lLFP-Hobk+ge!GrkT0A~1FcJeCEp!4t4qe!>CY0@kE&EZ` z-i5f*piK_@&@5G6fASD-Q7-IOxfegq|LvgaRCs^#OSAbG0lN1h5Gm6Oi$4aHF}y}2 ua)lZ$O4a~*utkL&2?L59B(=p=Wig?vQ53-bjzy40GQ!@LLcVPs!2An?qIk6c literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_elite_sequential_select-members.html b/trunk/paradiseo-eo/doc/html/classeo_elite_sequential_select-members.html new file mode 100644 index 000000000..31ded276f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_elite_sequential_select-members.html @@ -0,0 +1,22 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEliteSequentialSelect< EOT > Member List

This is the complete list of members for eoEliteSequentialSelect< EOT >, including all inherited members.

+ + + + + + + + +
current (defined in eoEliteSequentialSelect< EOT >)eoEliteSequentialSelect< EOT > [private]
eoEliteSequentialSelect()eoEliteSequentialSelect< EOT > [inline]
eoPters (defined in eoEliteSequentialSelect< EOT >)eoEliteSequentialSelect< EOT > [private]
functor_category()eoUF< const eoPop< EOT > &, const EOT & > [inline, static]
operator()(const eoPop< EOT > &_pop)eoEliteSequentialSelect< EOT > [inline, virtual]
setup(const eoPop< EOT > &_pop)eoEliteSequentialSelect< EOT > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, const EOT & > [inline, virtual]

Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_elite_sequential_select.html b/trunk/paradiseo-eo/doc/html/classeo_elite_sequential_select.html new file mode 100644 index 000000000..c655322e0 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_elite_sequential_select.html @@ -0,0 +1,61 @@ + + +EO: eoEliteSequentialSelect< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEliteSequentialSelect< EOT > Class Template Reference

All Individuals in order. +More... +

+#include <eoSequentialSelect.h> +

+

Inheritance diagram for eoEliteSequentialSelect< EOT >: +

+ +eoSelectOne< EOT > +eoUF< const eoPop< EOT > &, const EOT & > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoEliteSequentialSelect ()
 Ctor: sets the current pter to numeric_limits<unsigned>::max() so init will take place first time not very elegant, maybe ...
+void setup (const eoPop< EOT > &_pop)
 virtual function to setup some population stats (for instance eoProportional can benefit greatly from this)
+virtual const EOT & operator() (const eoPop< EOT > &_pop)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+unsigned current
+std::vector< const EOT * > eoPters
+

Detailed Description

+

template<class EOT>
+ class eoEliteSequentialSelect< EOT >

+ +All Individuals in order. +

+The best individual first, then the others in sequence (random order). for G3 evolution engine, see Deb, Anad and Joshi, CEC 2002

+As eoSequentialSelect, it is an eoSelectOne to be used within the eoEaseyEA algo, but conceptually it should be a global eoSelect, as it selects a bunch of guys in one go (done in the setup function now) +

+ +

+Definition at line 97 of file eoSequentialSelect.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_elite_sequential_select.png b/trunk/paradiseo-eo/doc/html/classeo_elite_sequential_select.png new file mode 100644 index 0000000000000000000000000000000000000000..cb082ab544a9ecff61bb6f5041a5e7dc9b7cfd6b GIT binary patch literal 1976 zcmah~X;hO}8V(|2839L%0@46#SqusyOTi^jNf;`imL24afDkb#4rzvvNDxt?$f6?9 zLXcJv3L$)83|kU53$$QlCxB$wmk{=lumv-LS)86@Pk(&(d+vMRbI*I9_qoq~c+tf{ zSxHL?0)Z$y{>}bd2xLdG4A<_ImyK2>5=+@n6mOP_uaQHt`OUa-e3qs(Z$i;&J9nQrL?3?Tkb`)=QgDoK;N&$j*-o(u*s{NUWG@! zNw#;yArW_!4CM*bI)@8uptSeCnMLlzS)#MU z8YPyM#8=3*{b5f+j^P8|fK4MGuk>OcI)_3bg4TPnUh(^84FLyNrl>F{FS6-4C*-EX zJ+3kK8VBPijm8P<`2V_kj z44h9+oL<(n1T0j4Imd4Fg6#)0P_BYHfQdny!N8GbR`9$hk>BG>bS}7Lpr(1^A2`;^WsSi%sRWm=XFV_D5@usC19)%$J*%7a>{&M;!73b3MrS9X4F zxq~$ICt5<+TqVQx%T`n!RtooE>dEy6f95RaWv-(|UtuVBhH)(AwVA|&p|S#OT($`u z@7C&+#%VuzDM4bsXuyPBF9&dLg)Qw9&Dzst(b1sCS_2R`_%5+>x~EW_g!>hZA9q)~ zGcI?q`?}E&iJlz!Q+-2OEToYf+JxuS15AcrK6H4TYXjg`FN0yvYsO^IqNF^4N8|*2 z!@8c!0TgKsDH$zKKk#9T7e>B6y8^s##l0aC|=g(n7?-|FwFU2rzD^ zZPG`pUw7pj!>+P_b%@MrA@`0t+tF}{1kbg-AT?Zb{j0Ldi%3|vMKFl_(tyA|=MHmt z#PC{7uWJq!y)=JYFQ8Tq(OD{`Vw*v4qkMl?J%M|v&WL+6S~>QaehTwGS7Wlnx8?Lg zMz89kjn|rS!CX%!%Nn3|_$F|h*vFgI%G~{nw410~xAS|{{2{KCv&V7E|p|99zs zD*I0`XOcd3pN=@=h!yXE9-*-B7<{ZE&VZfw7p&Sm%-ZtWV+K?uaQI>df6GT!?LoNQM?1j_33KV(3lPGlRPLdv!@RRY_Iueg3vooa L*cX3& + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoElitism< EOT > Member List

This is the complete list of members for eoElitism< EOT >, including all inherited members.

+ + + + + + + +
combien (defined in eoElitism< EOT >)eoElitism< EOT > [private]
eoElitism(double _rate, bool _interpret_as_rate=true) (defined in eoElitism< EOT >)eoElitism< EOT > [inline]
functor_category()eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
operator()(const eoPop< EOT > &_pop, eoPop< EOT > &_offspring)eoElitism< EOT > [inline, virtual]
rate (defined in eoElitism< EOT >)eoElitism< EOT > [private]
~eoBF()eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_elitism.html b/trunk/paradiseo-eo/doc/html/classeo_elitism.html new file mode 100644 index 000000000..166ddbac8 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_elitism.html @@ -0,0 +1,56 @@ + + +EO: eoElitism< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoElitism< EOT > Class Template Reference

Straightforward elitism class, specify the number of individuals to copy into new geneneration or the rate w.r.t. +More... +

+#include <eoMerge.h> +

+

Inheritance diagram for eoElitism< EOT >: +

+ +eoMerge< EOT > +eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase +eoNoElitism< EOT > + +List of all members. + + + + + + + + + + + + +

Public Member Functions

+ eoElitism (double _rate, bool _interpret_as_rate=true)
+void operator() (const eoPop< EOT > &_pop, eoPop< EOT > &_offspring)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+double rate
+unsigned combien
+

Detailed Description

+

template<class EOT>
+ class eoElitism< EOT >

+ +Straightforward elitism class, specify the number of individuals to copy into new geneneration or the rate w.r.t. +

+pop size +

+ +

+Definition at line 55 of file eoMerge.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_elitism.png b/trunk/paradiseo-eo/doc/html/classeo_elitism.png new file mode 100644 index 0000000000000000000000000000000000000000..6d0b9f86c420464886de164766d64ec561bb07df GIT binary patch literal 2192 zcmai0cU;p+7LOF^!jYiZ5Gk6Uupo#)q)8}}A1)NvK5SA_+EJf-{L=ZuR&;%rigc8wg*xU8+KJMKgGxMD{@6CMXz3;p?F*a7`Bt#F0 z!eB57jD;x{2IEKa@P+_CuV;(D^5YG%Hs>#xak*R`R|$D~O8X!WDnH^@M9(no6}yuI+m zu?ty@oQFBisy1HZ38cA7)(iE+TOseo&4ql8j>{+kH)VRE2q7vA4Sa7SDt{c~-!U?I z-w_-LspwL0TTK}KnSuB~WNs+Rx0h)QX%Nku_p^>Is#1wzgDHeJKlP-gQA+YgsZV_d z-kJc@p7(C{Un8T2i~H}dHGaC2&LmdjShNPjD-&`Imdy3|7Wq!FV8je?QO{*$MkAO9 zSvu=}Vf}%zk^5(0G^lwyAp5MnS%wcSGzyyh;RjA&C(|6}bqw7n><^fBTsV}J_>g>9ER)}Ji`J@w zdpOoya=Jr0un0i}jWDsjK*6dhP$*!KgQQTB-2mHc@qq=A(Tnp&KxulIAmge%tk)+gj zNgh>B)Apqo${fL3i-kLj>Y8$Ac=Nl#z~M999<47*ai$GWxHPyc5(_IpoJ9&IZ@!%$ z*d2r(J{RxQ@f+WTj>L@!ENpWljIB4<`Jr=&l@Es^IzL3GMhO@~4lYoH@bTL` zQ>p*#vI8csOPXyxI+M*sJm3`W{VS~<22$YW34D0*J-AU>A`!0@7Go^|@d^J)*#<27 zC7RKXcbIxI?y8j-ljQi|gT?HO*ET^Jq@tI;3hhg?YBy-(-cwh{FN(S@%%|;n3eHwN zQEP8ky_F6*$jTLkXsG|V=4DtOIXo@w+ji$34ir9^#wOtbRFi9lw9wyx_&4#i#r(~) zzgCOT&-WQvxm$^L<*kc0PVcczqO1x6YT;U2Y%ri< zXlb27V;^-(9b3%N?=gIYC#_tbZ|u%6=Z@p-=0 zT4Dgc~*0rL8)dZq0a$?_$@wblVo3lkw5iC@4RaOZY>mpY};(NjIm`)UeNB zOay%HqBwo(kEO_teuF{dP71?1Kyp0-8{AbF=a{0bLwzznU@#^IKA%Ww2q8q#uUkEz zl3Nm_F4|0~S<&d8O`Pj9+lPn#9X|Og5^I=H2$_&y*m1bw-FtR83gWw~2H?ZB@4@RS zjWCj|; zIsx1P@hVVdn^d9GDs(b*^QS3Sy-;=)8qgDeH;|5{G%Kl8Bi10t{#?63`HWfUD!U!! zmIudO(JUTYSx!&t4im*+2{*-j2Wgqu3?5MKlY*+uF{cESOKk_mjlV9Q7`5IVWReN( zYmsE`;+3P5f@<=-(q#9V4-MS)`=`*K3F)ic`iori-@1>w>F+mLg7kOHdEMaYSqk6I z4E4OT{YbM$M?J7rl5~*RdhC#n+mUeZ`uJN?D|pV>7wpcpe~L+*8GZyOU4 z;hRuxr`jv(#R-B|AS-Ny_(CUbOE%6`An;l3NQ^d?BjExKI;XfWn3~1970gsYqjboC znj-^xzP?&zvP{dBj-vnikJQM%<)I!?s+REH(a*j;))Y;D>@^E%-JM2J?Zf=7JQ=sx zrytK-&LDE4>7f~8#eQry;^h4=sMaNB`02f + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEsChromInit< EOT > Member List

This is the complete list of members for eoEsChromInit< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + +
className(void) const eoInit< EOT > [inline, virtual]
create_self_adapt(eoReal< FitT > &)eoEsChromInit< EOT > [inline, private]
create_self_adapt(eoEsSimple< FitT > &result)eoEsChromInit< EOT > [inline, private]
create_self_adapt(eoEsStdev< FitT > &result)eoEsChromInit< EOT > [inline, private]
create_self_adapt(eoEsFull< FitT > &result)eoEsChromInit< EOT > [inline, private]
eoEsChromInit(eoRealVectorBounds &_bounds, double _sigma=0.3, bool _to_scale=false)eoEsChromInit< EOT > [inline]
eoEsChromInit(eoRealVectorBounds &_bounds, std::vector< double > _vecSigma)eoEsChromInit< EOT > [inline]
eoRealInitBounded(eoRealVectorBounds &_bounds)eoRealInitBounded< EOT > [inline]
FitT typedef (defined in eoEsChromInit< EOT >)eoEsChromInit< EOT >
functor_category()eoUF< EOT &, void > [inline, static]
operator()(EOT &_eo)eoEsChromInit< EOT > [inline, virtual]
size() (defined in eoRealInitBounded< EOT >)eoRealInitBounded< EOT > [inline, virtual]
theBounds()eoRealInitBounded< EOT > [inline, virtual]
uniqueSigmaeoEsChromInit< EOT > [private]
vecSigmaeoEsChromInit< EOT > [private]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< EOT &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_es_chrom_init.html b/trunk/paradiseo-eo/doc/html/classeo_es_chrom_init.html new file mode 100644 index 000000000..02ee7f916 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_es_chrom_init.html @@ -0,0 +1,360 @@ + + +EO: eoEsChromInit< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEsChromInit< EOT > Class Template Reference
+ +[EvolutionStrategies] +

Random Es-chromosome initializer (therefore derived from eoInit). +More... +

+#include <eoEsChromInit.h> +

+

Inheritance diagram for eoEsChromInit< EOT >: +

+ +eoRealInitBounded< EOT > +eoInit< EOT > +eoUF< EOT &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::Fitness FitT

Public Member Functions

 eoEsChromInit (eoRealVectorBounds &_bounds, double _sigma=0.3, bool _to_scale=false)
 Constructor.
 eoEsChromInit (eoRealVectorBounds &_bounds, std::vector< double > _vecSigma)
 Constructor.
+void operator() (EOT &_eo)
 simply passes the argument to the uniform method of the bounds

Private Member Functions

void create_self_adapt (eoReal< FitT > &)
 Create intializer.
void create_self_adapt (eoEsSimple< FitT > &result)
 Create intializer.
void create_self_adapt (eoEsStdev< FitT > &result)
 Create intializer.
void create_self_adapt (eoEsFull< FitT > &result)
 Create intializer.

Private Attributes

+double uniqueSigma
 Initial value in case of a unique sigma.
+std::vector< double > vecSigma
 Initial values in case of a vector of sigmas.
+

Detailed Description

+

template<class EOT>
+ class eoEsChromInit< EOT >

+ +Random Es-chromosome initializer (therefore derived from eoInit). +

+This class can initialize four types of real-valued genotypes thanks to tempate specialization of private method create:

+

    +
  • eoReal just an eoVector<double>
  • eoEsSimple + one self-adapting single sigma for all variables
  • eoEsStdev a whole std::vector of self-adapting sigmas
  • eoEsFull a full self-adapting correlation matrix
+

+

See also:
eoReal eoEsSimple eoEsStdev eoEsFull eoInit
+ +

+ +

+Definition at line 55 of file eoEsChromInit.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
eoEsChromInit< EOT >::eoEsChromInit ( eoRealVectorBounds &  _bounds,
double  _sigma = 0.3,
bool  _to_scale = false
)  [inline]
+
+ + + + + +
+   + + +

+Constructor. +

+

Parameters:
+ + + + +
_bounds bounds for uniform initialization
_sigma initial value for the stddev
_to_scale wether sigma should be multiplied by the range of each variable added December 2004 - MS (together with the whole comment :-)
+
+ +

+Definition at line 71 of file eoEsChromInit.h. +

+References eoRealBaseVectorBounds::range(), eoRealInitBounded< EOT >::theBounds(), eoEsChromInit< EOT >::uniqueSigma, and eoEsChromInit< EOT >::vecSigma.

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
eoEsChromInit< EOT >::eoEsChromInit ( eoRealVectorBounds &  _bounds,
std::vector< double >  _vecSigma
)  [inline]
+
+ + + + + +
+   + + +

+Constructor. +

+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

+Specify individual initial sigmas for each variable.

+

Parameters:
+ + + +
_bounds bounds for uniform initialization
_sigma initial value for the stddev
+
+ +

+Definition at line 109 of file eoEsChromInit.h. +

+References eoEsChromInit< EOT >::uniqueSigma, and eoEsChromInit< EOT >::vecSigma.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
void eoEsChromInit< EOT >::create_self_adapt ( eoReal< FitT > &   )  [inline, private]
+
+ + + + + +
+   + + +

+Create intializer. +

+No adaptive mutation at all +

+Definition at line 128 of file eoEsChromInit.h. +

+Referenced by eoEsChromInit< EOT >::operator()().

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
void eoEsChromInit< EOT >::create_self_adapt ( eoEsSimple< FitT > &  result  )  [inline, private]
+
+ + + + + +
+   + + +

+Create intializer. +

+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

+Adaptive mutation through a unique sigma +

+Definition at line 139 of file eoEsChromInit.h. +

+References eoEsSimple< Fit >::stdev.

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
void eoEsChromInit< EOT >::create_self_adapt ( eoEsStdev< FitT > &  result  )  [inline, private]
+
+ + + + + +
+   + + +

+Create intializer. +

+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

+Adaptive mutation through a std::vector of sigmas

+

Todo:
Should we scale sigmas to the corresponding object variable range?
+ +

+Definition at line 155 of file eoEsChromInit.h. +

+References eoEsStdev< Fit >::stdevs.

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
void eoEsChromInit< EOT >::create_self_adapt ( eoEsFull< FitT > &  result  )  [inline, private]
+
+ + + + + +
+   + + +

+Create intializer. +

+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

+Adaptive mutation through a whole correlation matrix +

+Definition at line 169 of file eoEsChromInit.h. +

+References eoEsFull< Fit >::correlations, eoEsFull< Fit >::stdevs, and eoRng::uniform().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_es_chrom_init.png b/trunk/paradiseo-eo/doc/html/classeo_es_chrom_init.png new file mode 100644 index 0000000000000000000000000000000000000000..34b23a48cd39f16ad356ff9802070a745b02692f GIT binary patch literal 1566 zcmZ`(dpOez82-(evdvSZ#&p8SQkydhe@i0i2{i)e zUPWZ3=&xVs+@nJ6#cg;!IU)DgRlM;>f~R227^*VeB;ig-@oX~Fd9}>*#suziqG`c_ zjUTCFz3rdSuHeT3-X31fxqPu(U`S z#cPANqnktKcE`9Mx>;D;>GR@jz0AS_v(tnKE}wD^GtH!2uNjdbP^_SI7!He`@fnj? zh%SZoD_?J4$p}9CLVSGPvG>_F7>bu|dwiWWi-S3U(@QgEO!8Sf2lX)x!Rwo14^^D8 z9lFW&HM<}|h>{TxM9*z^ak8j&4xxSQO6#7L4B}ox7q^wE5vlGIQyljvC{e5+T_VV& zOu38}C8qb9Rg6+*!*ejE93->0!;S9vWtTUU*PLVq{==&^w_ngpPdy$HaF0NcW-7%Aj?wNH!;^;V zRyfu+736siNwMRN_UL=%JCwT}AwbdoSlO@99&t^1T-Af9qAA-V3>2C!uN>)rf9C-sSW?EB)M~+ z85FAr+AqfBX`)CP2uoOM_Nfk^lhqCP=}TP{vco6gaE!1gjm1n_^Ok;v5M-z@*zD?` zFuBmk5W{ehMTC+1%JbJUv5c`99Y*eMSzMQa2TcMtA#wFf90Q9}mLjAP0aX?TFRipu zX7BAn$I6Lz8!^#dQJbShChi=E27Z9uk&&-=^~^+FH2I2*%~yvQ&Z0?$iIOFGBgx$wl|8$v%GdPx|DF`DZR-*o;D-aP|RqdAV6)c62-|xZapZTrpW@1rgWS; zU9Ha~p-OK-)9Um6FU`N%KVHVkmf1a!+rbgwsW=qwOZlgFiIJt`s$^iie*MLu855_s z3s2{@%Y}5SH)gB?nZHRTSlA59WzGZ&ch-E+A zJ*cYMC{>QHYB89X-kwj$^LAD|+jYsa8%nU7itx)1}M1tf&b`Eftl2W_yR+OLw`7 zJ;CKsO8Hr>sq9xM + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEsFull< Fit > Member List

This is the complete list of members for eoEsFull< Fit >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
AtomType typedef (defined in eoVector< Fit, double >)eoVector< Fit, double >
className(void) const eoEsFull< Fit > [inline, virtual]
ContainerType typedef (defined in eoVector< Fit, double >)eoVector< Fit, double >
correlations (defined in eoEsFull< Fit >)eoEsFull< Fit >
EO()EO< Fit > [inline]
EO() (defined in EO< Fit >)EO< Fit > [inline]
eoEsFull(void) (defined in eoEsFull< Fit >)eoEsFull< Fit > [inline]
eoVector(unsigned size=0, doublevalue=double())eoVector< Fit, double > [inline]
eoVector(const eoVector< OtherFitnessType, double > &_vec)eoVector< Fit, double > [inline]
Fitness typedef (defined in EO< Fit >)EO< Fit >
fitness() const EO< Fit > [inline]
fitness(const Fitness &_fitness)EO< Fit > [inline]
fitness(performance_type perf) (defined in EO< Fit >)EO< Fit > [inline]
fitness(void) const (defined in EO< Fit >)EO< Fit > [inline]
fitness_traits typedef (defined in EO< Fit >)EO< Fit >
invalid() const EO< Fit > [inline]
invalidate() (defined in EO< Fit >)EO< Fit > [inline]
invalidate(void) (defined in EO< Fit >)EO< Fit > [inline]
invalidate_worth(void) (defined in EO< Fit >)EO< Fit > [inline]
operator<(const eoVector< Fit, double > &_eo) const eoVector< Fit, double > [inline]
EO< Fit >::operator<(const EO &_eo2) const EO< Fit > [inline]
operator<(const EO< Fitness, Traits > &other) const (defined in EO< Fit >)EO< Fit > [inline]
operator>(const EO &_eo2) const (defined in EO< Fit >)EO< Fit > [inline]
operator>(const EO< Fitness, Traits > &other) const (defined in EO< Fit >)EO< Fit > [inline]
performance(performance_type perf) (defined in EO< Fit >)EO< Fit > [inline]
performance(void) const (defined in EO< Fit >)EO< Fit > [inline]
performance_type typedef (defined in EO< Fit >)EO< Fit >
printOn(std::ostream &os) const eoEsFull< Fit > [inline, virtual]
readFrom(std::istream &is)eoEsFull< Fit > [inline, virtual]
stdevs (defined in eoEsFull< Fit >)eoEsFull< Fit >
storage_type typedef (defined in EO< Fit >)EO< Fit >
Type typedef (defined in eoEsFull< Fit >)eoEsFull< Fit >
value(const std::vector< double > &_v) (defined in eoVector< Fit, double >)eoVector< Fit, double > [inline]
worth(worth_type worth) (defined in EO< Fit >)EO< Fit > [inline]
worth(void) const (defined in EO< Fit >)EO< Fit > [inline]
worth_type typedef (defined in EO< Fit >)EO< Fit >
~EO()EO< Fit > [inline, virtual]
~eoObject()eoObject [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]

Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_es_full.html b/trunk/paradiseo-eo/doc/html/classeo_es_full.html new file mode 100644 index 000000000..9f1defd07 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_es_full.html @@ -0,0 +1,108 @@ + + +EO: eoEsFull< Fit > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEsFull< Fit > Class Template Reference
+ +[EvolutionStrategies] +

The most complex evolutionary strategy representation. +More... +

+#include <eoEsFull.h> +

+

Inheritance diagram for eoEsFull< Fit >: +

+ +eoVector< Fit, double > +EO< Fit > +eoObject +eoPersistent +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef double Type

Public Member Functions

virtual std::string className (void) const
 Return the class id.
+void printOn (std::ostream &os) const
 printing...
+void readFrom (std::istream &is)
 reading...

Public Attributes

+std::vector< double > stdevs
+std::vector< double > correlations
+

Detailed Description

+

template<class Fit>
+ class eoEsFull< Fit >

+ +The most complex evolutionary strategy representation. +

+Co-evolving mutation rates and correlated mutations. +

+ +

+Definition at line 40 of file eoEsFull.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class Fit>
virtual std::string eoEsFull< Fit >::className ( void   )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Return the class id. +

+

Returns:
the class name as a std::string
+ +

+Reimplemented from EO< Fit >. +

+Definition at line 51 of file eoEsFull.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_es_full.png b/trunk/paradiseo-eo/doc/html/classeo_es_full.png new file mode 100644 index 0000000000000000000000000000000000000000..32a80230ab4527d776b6ce3db4bc4bbbd9aac41f GIT binary patch literal 1446 zcmZvcdsNbA7{|eI{=%{!X+v!m{4~@ktJ%U#O%YHR-oR^K5@#1n%~Q@xZXQ%h)V!4@ zg?SlX%FMhMm?GpV9hzDuc}q9-Xi8#ewxu$*v#qmp`r~<@&->SVp6~O0zo~964jYmB zNEi&Z(aDiSgTdg*D*k|2r#e@p`T44*>qhk;E0szWDwS7WT)jF6`k5$Fipc zww`>X2wN_c${gJ)=4H4$!Zq!yks*^nM(!F;4aJ6CF3xRwR^Cyx$Oog?E4cvW6}D%a zNcZ`v(ebvsp=}fHDF%j1h1QhNTzGjQ~K4y?{_QB_A4GtuX>N#815ln#+qUI!=){wWDG3BSv zILI5jv*d~k{aWLG0kCo83>ASu!R<)4APOXX7L6`rVvhW_eIOvi&q$dz;)?`=NAh0Z zf`~YXN@n?Y$CPtL%MEWjhe>XH#jTjC>Lt^ZpobOsGt#W$inV(@)ECD2gljjXLD#yN zXHn<4m0Rfs!$B>+-`BdrSt8eby(2u)TYHwITt9eI;X_GrjFmVjboiT`ueql$d}tj_ z*sTU6-``)@L6{>x4XcD3x)@y*o`;FYcFP>bTU=L0OcoD#-i&@^8#4b@(wGnQ7kJ~X4rn6w*=6?sC8$fmU%VZHO!t@W4WDRa4sDYFDbB#fG)B%Sgw?kSz2qv zWwBb~MA{;XsNAM0|idzJ3DWRUB)hTf&m)R$+e2nb9B zNYdoUwe-E@E3G;&k;~r2nizmfC~GO(VR<;IA&xHfJNlC*#vgk#buS%1d@PauxmL}@ zgq^(0blVx0Z=3V4hM(lr&}_-qS4iv#kXX?JTqLM^M-FX`5T!KOae z=Ji@^z0i{*HM*0l5q^l3bt=f^yHCk6Svzi@i#T;kg9sbz(}~b8}1>8~E#Ewo)vVDw8pe zA@P0cVD{Nr^qUo+??ew$026QNyZ%4pd>Z;cI{{nA&AfR$eYGIheitf&rLAqZ(!T75 zFo}rBisJaiZu_Mu(Oy?L`e@fSg4F$-W-08d*uo(m2S%-_$n>Q)H zOqsBG#I&z*id^PrgG7lLL7XkojRgH$ADbvrbqrPM(#=ecY+eF*sXEX$km + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEsGlobalXover< EOT > Member List

This is the complete list of members for eoEsGlobalXover< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + +
apply(eoPopulator< EOT > &_plop)eoEsGlobalXover< EOT > [inline, virtual]
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const eoEsGlobalXover< EOT > [inline, virtual]
cross_self_adapt(eoEsSimple< FitT > &_parent, const eoPop< eoEsSimple< FitT > > &_pop)eoEsGlobalXover< EOT > [inline, private]
cross_self_adapt(eoEsStdev< FitT > &_parent, const eoPop< eoEsStdev< FitT > > &_pop)eoEsGlobalXover< EOT > [inline, private]
cross_self_adapt(eoEsFull< FitT > &_parent, const eoPop< eoEsFull< FitT > > &_pop)eoEsGlobalXover< EOT > [inline, private]
crossMut (defined in eoEsGlobalXover< EOT >)eoEsGlobalXover< EOT > [private]
crossObj (defined in eoEsGlobalXover< EOT >)eoEsGlobalXover< EOT > [private]
eoEsGlobalXover(eoBinOp< double > &_crossObj, eoBinOp< double > &_crossMut)eoEsGlobalXover< EOT > [inline]
eoGenOp()eoGenOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
FitT typedef (defined in eoEsGlobalXover< EOT >)eoEsGlobalXover< EOT >
functor_category()eoUF< eoPopulator< EOT > &, void > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
max_production(void)eoEsGlobalXover< EOT > [inline, virtual]
operator()(eoPopulator< EOT > &_pop)eoGenOp< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
sel (defined in eoEsGlobalXover< EOT >)eoEsGlobalXover< EOT > [private]
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]
~eoUF()eoUF< eoPopulator< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_es_global_xover.html b/trunk/paradiseo-eo/doc/html/classeo_es_global_xover.html new file mode 100644 index 000000000..0fbbc1b89 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_es_global_xover.html @@ -0,0 +1,270 @@ + + +EO: eoEsGlobalXover< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEsGlobalXover< EOT > Class Template Reference

Gloabl crossover operator for ES genotypes. +More... +

+#include <eoEsGlobalXover.h> +

+

Inheritance diagram for eoEsGlobalXover< EOT >: +

+ +eoGenOp< EOT > +eoOp< EOT > +eoUF< eoPopulator< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::Fitness FitT

Public Member Functions

+ eoEsGlobalXover (eoBinOp< double > &_crossObj, eoBinOp< double > &_crossMut)
 (Default) Constructor.
+virtual std::string className () const
 The class name. Used to display statistics.
+unsigned max_production (void)
 The TOTAL number of offspring (here = nb of parents modified in place).
void apply (eoPopulator< EOT > &_plop)
 modifies one parents in the populator using 2 new parents for each component!

Private Member Functions

void cross_self_adapt (eoEsSimple< FitT > &_parent, const eoPop< eoEsSimple< FitT > > &_pop)
 Method for cross self-adaptation parameters.
void cross_self_adapt (eoEsStdev< FitT > &_parent, const eoPop< eoEsStdev< FitT > > &_pop)
 Method for cross self-adaptation parameters.
void cross_self_adapt (eoEsFull< FitT > &_parent, const eoPop< eoEsFull< FitT > > &_pop)
 Method for cross self-adaptation parameters.

Private Attributes

+eoRandomSelect< EOT > sel
+eoBinOp< double > & crossObj
+eoBinOp< double > & crossMut
+

Detailed Description

+

template<class EOT>
+ class eoEsGlobalXover< EOT >

+ +Gloabl crossover operator for ES genotypes. +

+Uses some Atom crossovers to handle both the object variables and the mutation strategy parameters +

+ +

+Definition at line 44 of file eoEsGlobalXover.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
void eoEsGlobalXover< EOT >::apply ( eoPopulator< EOT > &  _plop  )  [inline, virtual]
+
+ + + + + +
+   + + +

+modifies one parents in the populator using 2 new parents for each component! +

+

Parameters:
+ + +
_pop a POPULATOR (not a simple population)
+
+ +

+Implements eoGenOp< EOT >. +

+Definition at line 67 of file eoEsGlobalXover.h. +

+References eoEsGlobalXover< EOT >::cross_self_adapt(), EO< F >::invalidate(), and eoPopulator< EOT >::source().

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
void eoEsGlobalXover< EOT >::cross_self_adapt ( eoEsSimple< FitT > &  _parent,
const eoPop< eoEsSimple< FitT > > &  _pop
)  [inline, private]
+
+ + + + + +
+   + + +

+Method for cross self-adaptation parameters. +

+Specialization for eoEsSimple. +

+Definition at line 94 of file eoEsGlobalXover.h. +

+References eoEsSimple< Fit >::stdev. +

+Referenced by eoEsGlobalXover< EOT >::apply().

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
void eoEsGlobalXover< EOT >::cross_self_adapt ( eoEsStdev< FitT > &  _parent,
const eoPop< eoEsStdev< FitT > > &  _pop
)  [inline, private]
+
+ + + + + +
+   + + +

+Method for cross self-adaptation parameters. +

+Specialization for eoEsStdev. +

+Definition at line 106 of file eoEsGlobalXover.h. +

+References eoEsStdev< Fit >::stdevs.

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
void eoEsGlobalXover< EOT >::cross_self_adapt ( eoEsFull< FitT > &  _parent,
const eoPop< eoEsFull< FitT > > &  _pop
)  [inline, private]
+
+ + + + + +
+   + + +

+Method for cross self-adaptation parameters. +

+Specialization for eoEsFull. +

+Definition at line 121 of file eoEsGlobalXover.h. +

+References eoEsFull< Fit >::correlations, and eoEsFull< Fit >::stdevs.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_es_global_xover.png b/trunk/paradiseo-eo/doc/html/classeo_es_global_xover.png new file mode 100644 index 0000000000000000000000000000000000000000..be4c08688e8dc545fd0d4e04772e19dd7775b0fa GIT binary patch literal 1990 zcmah~c~sL^77oV3h$DzCfq^0-sBw@bYQqwCf&neNxUnf_fe_*_Ku{u!REo$Vfv_(T z5O5(uLJ3O<#-b9!RzQ{?oWOuA7D5D}36wx4^o-LwXU@zY@4fr(`QCl!zWaUerg*ra z_9<&AgFv8tF3w0V5NOwk+~)2E%V%q$7h1k(dVG7{NhXuYO__{Kqg~CETfYr1mrMRp zHY49EM0&Y-gY4!;u^^C=p9|9d{LSK}V*9KL^Zib)kw`iPUQ=db3X9OI#rN??bRSXg z?jB95lXjA1Bi`^~kXrzzy590}s~>)4(bi`@Kkct$c!tRfMOUd97G>t@0pHJ8bO7w2 z+V>Oz4h&8X8C=*z7ZKRnjnS};m)B!>Bva88{MU5)DR%Ze>Pe=5+Ycc_3<+JI{hWlO zF-AijNyiNR!@m!YwKQT@r-{<@1n%)Q;f8~Wz9J5xaaLksOpe^;r{X4l<7q62TwMsR zS~_mq5gbA-DG@%OXcp2~g5K;gVy?hx(hv|q;~^DDmYLNkbiAo2;9yLnR^S-eB7g^< z7!DJ@$u9@+W-&#K!nDI4xi>;MY>XQGU zDaaZ+9!q`wVs@PAs0S_V6_vRZMk@x|uLIk4wrlpyR2^mu z`49pl4m(F`>=srM^i%a3G??mWQb4_9mgF2zJ3^>Gj-dB4HNM%*#fvZTOG8P+>G_$W zi2h-p`g$VTbUN}1g^0wn>cm6DR}J6+t@Q_XE^NXtkQU0@@=D?igiWbi#h}O51kR%- zVgO?nG&4S>;S;6*VaAQd*#dWiOKtu^YK)LAqN7uF*C+HgMSAfC!ucVcP9a%}VfH04 z?|iB?o^P``mvlgPFhycS@bDxZY3o(F`rRU+(7Kne_%YTRk*FRxi9;#JU-6MC!ZyugXlcU!cZx}0(|8gO7EQt|zV<`D z3^(Y=`tFyqLg`O&;kmP(r_Q3sgA8ao)23}2b1PdX$f4nCuN_Fr4fjYS2^{2pY)sNt zl~)Olg$%vO{4mP{nDe)8ig#DXVTKz*HWLdDaBFj zUk`M|Ct5A*OlTl5wHAlSlX_InTn_A`s;2?_q%;}&skoV{d9mX3T}O1|3>}X!a7xe5 zOu1U-G?nUb3m@dr!?ngcwu6i@V9)hUL7;N-@X#G5#jj80YEMU;ofkYy&ZwIIBnniU zH_x{ruT4O3i2lC$xeABRc=3s%pF70|Z|+58_HE7nIq7!*4+d-yxIqq+VsjflB%`xe zk(=YV!0K4>WGz1u5>ztCqA*QANIjYSwJv6FUuW-8s|}oX)vJy0D9H}!Zyux@e9CPi zKYQ|8#16!r@8-QxMSv#>mENsG5z7RustYSUB>*jUfS*Fld;DbuAExyR*Hy^T>OcW^ z90j~J^=j!^nsu~(k^F$~tg4 z|INzlK#LB0z~{G zm1T>u`^D2k{ZY4C%AfRZccpTETziW~!Slq^+rBg)pA-`;xZ^96H3V-vivt6SRD#a| zJz^Ivi^sR-tfB0JlQDePW9&WdM0&^-nE`W4g-*r~MBBGr;b#b&T8Ar{wGg5sn%!`r zv}#B^aQB-=*wQs)L!hVB%K@-2e+IN!6~R+-vIhK=f$6akxnv}xRRj}yC!cqM4ZDmr z6E!?DJX+EW)khG#N!njZ4v-&Ujg9mQDhL)8DL5=v!^*$j-_tmhB#j914n43Vfah4- z!StrWC0pqjeDO@-QOMtA7rEUW)IvRwj*Rp#WduL1So|32 + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEsMutate< EOT > Member List

This is the complete list of members for eoEsMutate< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
boundseoEsMutate< EOT > [private]
className() const eoEsMutate< EOT > [inline, virtual]
eoEsMutate(eoEsMutationInit &_init, eoRealVectorBounds &_bounds)eoEsMutate< EOT > [inline]
eoMonOp()eoMonOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
FitT typedefeoEsMutate< EOT >
functor_category()eoUF< EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
init(eoEsSimple< FitT >, eoEsMutationInit &_init)eoEsMutate< EOT > [inline, private]
init(eoEsStdev< FitT >, eoEsMutationInit &_init)eoEsMutate< EOT > [inline, private]
init(eoEsFull< FitT >, eoEsMutationInit &_init)eoEsMutate< EOT > [inline, private]
operator()(eoEsSimple< FitT > &_eo)eoEsMutate< EOT > [inline, virtual]
operator()(eoEsStdev< FitT > &_eo)eoEsMutate< EOT > [inline, virtual]
operator()(eoEsFull< FitT > &_eo)eoEsMutate< EOT > [inline, virtual]
eoMonOp< EOT >::operator()(EOT &)=0eoUF< EOT &, bool > [pure virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
stdev_epseoEsMutate< EOT > [private, static]
TauBetaeoEsMutate< EOT > [private]
TauGlbeoEsMutate< EOT > [private]
TauLcleoEsMutate< EOT > [private]
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoEsMutate()eoEsMutate< EOT > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]
~eoUF()eoUF< EOT &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_es_mutate.html b/trunk/paradiseo-eo/doc/html/classeo_es_mutate.html new file mode 100644 index 000000000..9355a7029 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_es_mutate.html @@ -0,0 +1,465 @@ + + +EO: eoEsMutate< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEsMutate< EOT > Class Template Reference
+ +[EvolutionStrategies] +

ES-style mutation in the large. +More... +

+#include <eoEsMutate.h> +

+

Inheritance diagram for eoEsMutate< EOT >: +

+ +eoMonOp< EOT > +eoOp< EOT > +eoUF< EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::Fitness FitT
 Fitness-type.

Public Member Functions

 eoEsMutate (eoEsMutationInit &_init, eoRealVectorBounds &_bounds)
 Initialization.
+virtual ~eoEsMutate ()
 Virtual Destructor.
virtual std::string className () const
 Classname.
virtual bool operator() (eoEsSimple< FitT > &_eo)
 Mutate eoEsSimple.
virtual bool operator() (eoEsStdev< FitT > &_eo)
 Standard mutation in ES.
virtual bool operator() (eoEsFull< FitT > &_eo)
 Correlated mutations in ES.

Private Member Functions

+void init (eoEsSimple< FitT >, eoEsMutationInit &_init)
 Initialization of simple ES.
void init (eoEsStdev< FitT >, eoEsMutationInit &_init)
 Initialization of standard ES.
void init (eoEsFull< FitT >, eoEsMutationInit &_init)
 Initialization of full ES.

Private Attributes

+double TauLcl
 Local factor for mutation of std deviations.
+double TauGlb
 Global factor for mutation of std deviations.
+double TauBeta
 Factor for mutation of correlation parameters.
+eoRealVectorBounds & bounds
 Bounds of parameters.

Static Private Attributes

const double stdev_eps = 1.0e-40
 Minimum stdev.
+

Detailed Description

+

template<class EOT>
+ class eoEsMutate< EOT >

+ +ES-style mutation in the large. +

+Obviously, valid only for eoES*. It is currently valid for three types of ES chromosomes:

    +
  • eoEsSimple: Exactly one stdandard-deviation
  • eoEsStdev: As many standard deviations as object variables
  • eoEsFull: The whole guacemole: correlations, stdevs and object variables
+

+Each of these three variant has it's own operator() in eoEsMutate and intialization is also split into three cases (that share some commonalities) +

+ +

+Definition at line 60 of file eoEsMutate.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
eoEsMutate< EOT >::eoEsMutate ( eoEsMutationInit &  _init,
eoRealVectorBounds &  _bounds
)  [inline]
+
+ + + + + +
+   + + +

+Initialization. +

+

Parameters:
+ + + +
_init Proxy class for initializating the three parameters eoEsMutate needs
_bounds Bounds for the objective variables
+
+ +

+Definition at line 74 of file eoEsMutate.h. +

+References eoEsMutate< EOT >::bounds, and eoEsMutate< EOT >::init().

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
virtual std::string eoEsMutate< EOT >::className ( void   )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Classname. +

+Inherited from eoObject

See also:
eoObject
+
Returns:
Name of class.
+ +

+Reimplemented from eoMonOp< EOT >. +

+Definition at line 90 of file eoEsMutate.h.

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
virtual bool eoEsMutate< EOT >::operator() ( eoEsSimple< FitT > &  _eo  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Mutate eoEsSimple. +

+

Parameters:
+ + +
_eo Individual to mutate.
+
+ +

+Definition at line 97 of file eoEsMutate.h. +

+References eoEsMutate< EOT >::bounds, eoRealBaseVectorBounds::foldsInBounds(), eoRng::normal(), eoEsSimple< Fit >::stdev, and eoEsMutate< EOT >::TauLcl.

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
virtual bool eoEsMutate< EOT >::operator() ( eoEsStdev< FitT > &  _eo  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Standard mutation in ES. +

+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

+Standard mutation of object variables and standard deviations in ESs.

+If there are fewer different standard deviations available than the dimension of the objective function requires, the last standard deviation is responsible for ALL remaining object variables.

+

Parameters:
+ + +
_eo Individual to mutate.
+
+
See also:
Schwefel 1977: Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie, pp. 165 ff.
+ +

+Definition at line 128 of file eoEsMutate.h. +

+References eoEsMutate< EOT >::bounds, eoRealBaseVectorBounds::foldsInBounds(), eoRng::normal(), eoEsStdev< Fit >::stdevs, eoEsMutate< EOT >::TauGlb, and eoEsMutate< EOT >::TauLcl.

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
virtual bool eoEsMutate< EOT >::operator() ( eoEsFull< FitT > &  _eo  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Correlated mutations in ES. +

+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

+Mutation of object variables, standard deviations, and their correlations in ESs.

+

Parameters:
+ + +
_eo Individual to mutate.
+
+
See also:
    +
  • H.-P. Schwefel: Internal Report of KFA Juelich, KFA-STE-IB-3/80, p. 43, 1980.
  • G. Rudolph: Globale Optimierung mit parallelen Evolutionsstrategien, Diploma Thesis, University of Dortmund, 1990.
+
+ +

+Definition at line 159 of file eoEsMutate.h. +

+References eoEsMutate< EOT >::bounds, eoEsFull< Fit >::correlations, eoRealBaseVectorBounds::foldsInBounds(), eoRng::normal(), eoEsFull< Fit >::stdevs, eoEsMutate< EOT >::TauBeta, eoEsMutate< EOT >::TauGlb, and eoEsMutate< EOT >::TauLcl.

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
void eoEsMutate< EOT >::init ( eoEsStdev< FitT > ,
eoEsMutationInit &  _init
)  [inline, private]
+
+ + + + + +
+   + + +

+Initialization of standard ES. +

+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. +

+Definition at line 228 of file eoEsMutate.h. +

+References eoEsMutate< EOT >::bounds, eoEsMutationInit::TauGlb(), eoEsMutate< EOT >::TauGlb, eoEsMutationInit::TauLcl(), and eoEsMutate< EOT >::TauLcl.

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
void eoEsMutate< EOT >::init ( eoEsFull< FitT > ,
eoEsMutationInit &  _init
)  [inline, private]
+
+ + + + + +
+   + + +

+Initialization of full ES. +

+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. +

+Definition at line 244 of file eoEsMutate.h. +

+References eoEsMutate< EOT >::init(), eoEsMutationInit::TauBeta(), eoEsMutate< EOT >::TauBeta, eoEsMutate< EOT >::TauGlb, and eoEsMutate< EOT >::TauLcl.

+

Member Data Documentation

+

+ + + + +
+ + + + + + + +
+template<class EOT>
const double eoEsMutate< EOT >::stdev_eps = 1.0e-40 [static, private]
+
+ + + + + +
+   + + +

+Minimum stdev. +

+If you let the step-size go to 0, self-adaptation stops, therefore we give a lower bound. The actual value used is somewhat arbitrary and the is no theoretical reasoning known for it (Sep 2005).

+The code that we have in EO is a port from a C code that Thomas Bäck kindly donated to the community some years ago. It has been modified by Marc Schoenauer for inclusion in EvolC, than by Maarten Keijzer into EO. The exact value was adjusted based on practice.

+Removing this doesn't work well, but it was never tried to figure out what the best value would be. +

+Definition at line 284 of file eoEsMutate.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_es_mutate.png b/trunk/paradiseo-eo/doc/html/classeo_es_mutate.png new file mode 100644 index 0000000000000000000000000000000000000000..6e3d61c90f3f80a68fb6c129cf6ca55afc55e397 GIT binary patch literal 1453 zcmZWpdpOg37@tsCk6RMyxLY1ap*p$S#MThwLFO`6i{$cDwpv(G9A$3D^~iM(r3l-R zSX;wfVj?=p%x&F%$#sq&SsHeB&U60iJkR@mKcDyVJn#4OywCSb^}(Q(p*m0q1fuNj zhV+F%v}nS#H7dbbkF28$}4RfP7m00{*6 zXjfOn5>4?p(>#FzuNjZ=m}xgqae=Kerul6A_&5~COJh)cfVTLfxv*;I{o)K9z0Q6Y z&op82P3ESZR{=cwJ!wvX5E>uPRSe&7CS50#lO;tbpEUXGOMcMRcx_ z>4bZt+OWBi9BgWe>tU=DK(%=1?*v3< z@~GuJs-s)ZdL5~ueUIQ`X;XTU?FU$LmSWZo1XP=<84NC?si}$k>^kDQPUqNmsV9VG zqZ)dsyw&K#1Q-Tci9N4w9%lq{bTR{}8Uzrnluhe(L`SguHBrDf0VD=MR(c36^DUiU`R%g9Z#nOnuwa!gF8eyXEq$uUuBDB%HCXT6 z@g%PqwNvL{tY|!Mtyv6g|K3zHut@jL9X5kDF!g-+;~#pSD-*}S437Sc#uCqKze4Px z+vS*cURR#J69tw$@~Imj4eV6i0nnMv!kV66m1khsaq_&unP~pv>diGV@N;af%TbON zJhJ}f7M}&D-M}CU$l0o4i4u$NJ6SP7Eh=}ed>};~b=!`%N*%s?Yj_NZg6r>Z(@g<- zxu!ShUXNXaa!8h~G>4%!!KL9f(_R*pJFnx=N2WL-3|s3bQ#P&&7FcHT6>q*#1)}<7 zJggQk?AAR_L4&TW?@SZKq3@Y#|E}dm)zok*L-N)x;JlJ?@uvPjU>8rbe;^zk8h6S# z3^da4956{lK`rfsyU{=b3MhUP*tI(k?;-0(CYfc!veY(e{7p6%Gi(@2><99h>AV%{ zkG3#&RJvvuX#VhQk$Nx~BLlTCVvl;xkJtUb zfR#Boa3q}nNX}+7K$yf%=kV7@P(Vv7jb34_ajxU|iHQqMf2}h=Dzgc(5`DfNYeUWd zee2}tHYSO48AyTZm4G!u#XFoB`&ndF@F2cuSp)|f8F5xr*Z1KX@(3g{IFL`o@>lT;1BB!T4{5$uE>NACUE{rTr)K4ss$Xr|s>v>)_ zT>J@lnb{d9da>@1MLIb7IYLLrOGwVwo#1CKttTeY1Yv%XIU_K5(pxKUY~nuwY4~Dp*qcBLi%h{B_0o^eC1ONa4 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_es_mutation_init-members.html b/trunk/paradiseo-eo/doc/html/classeo_es_mutation_init-members.html new file mode 100644 index 000000000..5be0ab70e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_es_mutation_init-members.html @@ -0,0 +1,31 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEsMutationInit Member List

This is the complete list of members for eoEsMutationInit, including all inherited members.

+ + + + + + + + + + + + + + + + + +
eoEsMutationInit(eoParser &_parser, std::string _section="ES mutation parameters")eoEsMutationInit [inline]
parser (defined in eoEsMutationInit)eoEsMutationInit [private]
repSection (defined in eoEsMutationInit)eoEsMutationInit [private]
section(void) (defined in eoEsMutationInit)eoEsMutationInit [inline, protected, virtual]
TauBeta(void)eoEsMutationInit [inline]
TauBetaName(void) const (defined in eoEsMutationInit)eoEsMutationInit [inline, protected, virtual]
TauBetaParam (defined in eoEsMutationInit)eoEsMutationInit [private]
TauBetaShort(void) const (defined in eoEsMutationInit)eoEsMutationInit [inline, protected, virtual]
TauGlb(void)eoEsMutationInit [inline]
TauGlbName(void) const (defined in eoEsMutationInit)eoEsMutationInit [inline, protected, virtual]
TauGlbParam (defined in eoEsMutationInit)eoEsMutationInit [private]
TauGlbShort(void) const (defined in eoEsMutationInit)eoEsMutationInit [inline, protected, virtual]
TauLcl(void)eoEsMutationInit [inline]
TauLclName(void) const (defined in eoEsMutationInit)eoEsMutationInit [inline, protected, virtual]
TauLclParam (defined in eoEsMutationInit)eoEsMutationInit [private]
TauLclShort(void) const (defined in eoEsMutationInit)eoEsMutationInit [inline, protected, virtual]
~eoEsMutationInit()eoEsMutationInit [inline, virtual]

Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_es_mutation_init.html b/trunk/paradiseo-eo/doc/html/classeo_es_mutation_init.html new file mode 100644 index 000000000..947508c33 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_es_mutation_init.html @@ -0,0 +1,142 @@ + + +EO: eoEsMutationInit Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEsMutationInit Class Reference
+ +[EvolutionStrategies] +

Initialize Mutation operator. +More... +

+#include <eoEsMutationInit.h> +

+List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

 eoEsMutationInit (eoParser &_parser, std::string _section="ES mutation parameters")
 Constructor.
+virtual ~eoEsMutationInit ()
 Virtual destructor.
+double TauLcl (void)
 local
+double TauGlb (void)
 global tau
+double TauBeta (void)
 correlation's tau

Protected Member Functions

+virtual std::string section (void)
+virtual std::string TauLclName (void) const
+virtual char TauLclShort (void) const
+virtual std::string TauGlbName (void) const
+virtual char TauGlbShort (void) const
+virtual std::string TauBetaName (void) const
+virtual char TauBetaShort (void) const

Private Attributes

+eoParser & parser
+std::string repSection
+eoValueParam< double > * TauLclParam
+eoValueParam< double > * TauGlbParam
+eoValueParam< double > * TauBetaParam
+

Detailed Description

+Initialize Mutation operator. +

+Proxy class that is used for initializing the mutation operator. It provides an interface between eoEsMutate and the abstract parameterLoader. It also provides the names for the parameters in this class as virtual protected member functions.

+If you have more than a single ES in a project that need different names in the configuration files, you might consider overriding this class to change the names.

+

See also:
eoEsMutate
+ +

+ +

+Definition at line 47 of file eoEsMutationInit.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + +
eoEsMutationInit::eoEsMutationInit ( eoParser &  _parser,
std::string  _section = "ES mutation parameters"
)  [inline]
+
+ + + + + +
+   + + +

+Constructor. +

+

Parameters:
+ + + +
_parser Parser to read parameters from.
_section Parser section for -parameters.
+
+ +

+Definition at line 56 of file eoEsMutationInit.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_es_simple-members.html b/trunk/paradiseo-eo/doc/html/classeo_es_simple-members.html new file mode 100644 index 000000000..dcbe4b9cd --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_es_simple-members.html @@ -0,0 +1,53 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEsSimple< Fit > Member List

This is the complete list of members for eoEsSimple< Fit >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
AtomType typedef (defined in eoVector< Fit, double >)eoVector< Fit, double >
className() const eoEsSimple< Fit > [inline, virtual]
ContainerType typedef (defined in eoVector< Fit, double >)eoVector< Fit, double >
EO()EO< Fit > [inline]
EO() (defined in EO< Fit >)EO< Fit > [inline]
eoEsSimple() (defined in eoEsSimple< Fit >)eoEsSimple< Fit > [inline]
eoVector(unsigned size=0, doublevalue=double())eoVector< Fit, double > [inline]
eoVector(const eoVector< OtherFitnessType, double > &_vec)eoVector< Fit, double > [inline]
Fitness typedef (defined in EO< Fit >)EO< Fit >
fitness() const EO< Fit > [inline]
fitness(const Fitness &_fitness)EO< Fit > [inline]
fitness(performance_type perf) (defined in EO< Fit >)EO< Fit > [inline]
fitness(void) const (defined in EO< Fit >)EO< Fit > [inline]
fitness_traits typedef (defined in EO< Fit >)EO< Fit >
invalid() const EO< Fit > [inline]
invalidate() (defined in EO< Fit >)EO< Fit > [inline]
invalidate(void) (defined in EO< Fit >)EO< Fit > [inline]
invalidate_worth(void) (defined in EO< Fit >)EO< Fit > [inline]
operator<(const eoVector< Fit, double > &_eo) const eoVector< Fit, double > [inline]
EO< Fit >::operator<(const EO &_eo2) const EO< Fit > [inline]
operator<(const EO< Fitness, Traits > &other) const (defined in EO< Fit >)EO< Fit > [inline]
operator>(const EO &_eo2) const (defined in EO< Fit >)EO< Fit > [inline]
operator>(const EO< Fitness, Traits > &other) const (defined in EO< Fit >)EO< Fit > [inline]
performance(performance_type perf) (defined in EO< Fit >)EO< Fit > [inline]
performance(void) const (defined in EO< Fit >)EO< Fit > [inline]
performance_type typedef (defined in EO< Fit >)EO< Fit >
printOn(std::ostream &os) const eoEsSimple< Fit > [inline, virtual]
readFrom(std::istream &is)eoEsSimple< Fit > [inline, virtual]
stdev (defined in eoEsSimple< Fit >)eoEsSimple< Fit >
storage_type typedef (defined in EO< Fit >)EO< Fit >
Type typedef (defined in eoEsSimple< Fit >)eoEsSimple< Fit >
value(const std::vector< double > &_v) (defined in eoVector< Fit, double >)eoVector< Fit, double > [inline]
worth(worth_type worth) (defined in EO< Fit >)EO< Fit > [inline]
worth(void) const (defined in EO< Fit >)EO< Fit > [inline]
worth_type typedef (defined in EO< Fit >)EO< Fit >
~EO()EO< Fit > [inline, virtual]
~eoObject()eoObject [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]

Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_es_simple.html b/trunk/paradiseo-eo/doc/html/classeo_es_simple.html new file mode 100644 index 000000000..1445a08ca --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_es_simple.html @@ -0,0 +1,107 @@ + + +EO: eoEsSimple< Fit > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEsSimple< Fit > Class Template Reference
+ +[EvolutionStrategies] +

Simple Evolution Strategy. +More... +

+#include <eoEsSimple.h> +

+

Inheritance diagram for eoEsSimple< Fit >: +

+ +eoVector< Fit, double > +EO< Fit > +eoObject +eoPersistent +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + +

Public Types

+typedef double Type

Public Member Functions

virtual std::string className () const
 Return the class id.
+void printOn (std::ostream &os) const
 printing...
+void readFrom (std::istream &is)
 reading...

Public Attributes

+double stdev
+

Detailed Description

+

template<class Fit>
+ class eoEsSimple< Fit >

+ +Simple Evolution Strategy. +

+One of the more simple evolution strategies, sporting just a single stdeviation for the entire chromosome. For more advanced versions see also eoEsStdev eoEsFull

+

See also:
eoEsStdev eoEsFull
+ +

+ +

+Definition at line 42 of file eoEsSimple.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class Fit>
virtual std::string eoEsSimple< Fit >::className ( void   )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Return the class id. +

+

Returns:
the class name as a std::string
+ +

+Reimplemented from EO< Fit >. +

+Definition at line 50 of file eoEsSimple.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_es_simple.png b/trunk/paradiseo-eo/doc/html/classeo_es_simple.png new file mode 100644 index 0000000000000000000000000000000000000000..9c88aca3651e86852212debd82f91fbc501b0f31 GIT binary patch literal 1476 zcmaJ>do$lBnr!9@>oq{8hLFfuh2-; z5c24;gd`DbB(FqHNM5HrY8=BhW~V*<(I1`tJjD zPD~+M=oNtnJj#IS@k6 zQ-%4`H}O@BEC7gs;&RtYdiHKzH}fxi1nfSmCfU8@&7lFk@y$8xcR=*As96PP(NtaU zxrw+Rfk;fx8u#QC9GXXN@gl*(xrTxDw9_J!NH@EmyQ8 zsQaT;coYE39u9MQ%v5bjr>kV2x@qLL#XxQOd2IJ{EAr>@$S1eQ2%xBv_VuC$W0N@*DZMAB7v1Sa8A@g`G`% z=!|v#PK)0pIvrH6|9%ZBrcxgZfdZ;v2tSE@h9hqh?w3W2#)Pv{3v;!Z2Hv6R_-i!= z#p6!OXa|!!bzW#Mzs6h%Tdqx|*7?_OuKE_M2ofv31FC3N)iLXsIGn(vE}BBkyd+h5 zQYURHz5H70O$Y7TJ8zpz8~ed7WN(>3hX$p*adn)QVFu_wb9~Z0o0Oy6VA!Y?PF(dv z1#5cCSNu(?y%e)`0DjtQHY>Z2?d8xrOpY5;0b_fMMj3VLU*{#5XC4;W7wE0EDdbh` z!bY{#a4NUZTwbZuv{WBVZ}=5*PTLH3pFK7?(u6u2e|Q zi{Q + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEsStandardXover< EOT > Member List

This is the complete list of members for eoEsStandardXover< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const eoEsStandardXover< EOT > [inline, virtual]
cross_self_adapt(eoEsSimple< FitT > &_parent1, const eoEsSimple< FitT > &_parent2) (defined in eoEsStandardXover< EOT >)eoEsStandardXover< EOT > [inline, private]
cross_self_adapt(eoEsStdev< FitT > &_parent1, const eoEsStdev< FitT > &_parent2) (defined in eoEsStandardXover< EOT >)eoEsStandardXover< EOT > [inline, private]
cross_self_adapt(eoEsFull< FitT > &_parent1, const eoEsFull< FitT > &_parent2) (defined in eoEsStandardXover< EOT >)eoEsStandardXover< EOT > [inline, private]
crossMut (defined in eoEsStandardXover< EOT >)eoEsStandardXover< EOT > [private]
crossObj (defined in eoEsStandardXover< EOT >)eoEsStandardXover< EOT > [private]
eoBinOp()eoBinOp< EOT > [inline]
eoEsStandardXover(eoBinOp< double > &_crossObj, eoBinOp< double > &_crossMut)eoEsStandardXover< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
FitT typedef (defined in eoEsStandardXover< EOT >)eoEsStandardXover< EOT >
functor_category()eoBF< EOT &, const EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
operator()(EOT &_eo1, const EOT &_eo2)eoEsStandardXover< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
sel (defined in eoEsStandardXover< EOT >)eoEsStandardXover< EOT > [private]
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoBF()eoBF< EOT &, const EOT &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]

Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_es_standard_xover.html b/trunk/paradiseo-eo/doc/html/classeo_es_standard_xover.html new file mode 100644 index 000000000..5de7928ae --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_es_standard_xover.html @@ -0,0 +1,78 @@ + + +EO: eoEsStandardXover< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEsStandardXover< EOT > Class Template Reference

Standard (i.e. +More... +

+#include <eoEsStandardXover.h> +

+

Inheritance diagram for eoEsStandardXover< EOT >: +

+ +eoBinOp< EOT > +eoOp< EOT > +eoBF< EOT &, const EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::Fitness FitT

Public Member Functions

+ eoEsStandardXover (eoBinOp< double > &_crossObj, eoBinOp< double > &_crossMut)
 (Default) Constructor.
+virtual std::string className () const
 The class name. Used to display statistics.
+bool operator() (EOT &_eo1, const EOT &_eo2)
 modifies one parents in the populator using a second parent

Private Member Functions

+bool cross_self_adapt (eoEsSimple< FitT > &_parent1, const eoEsSimple< FitT > &_parent2)
+bool cross_self_adapt (eoEsStdev< FitT > &_parent1, const eoEsStdev< FitT > &_parent2)
+bool cross_self_adapt (eoEsFull< FitT > &_parent1, const eoEsFull< FitT > &_parent2)

Private Attributes

+eoRandomSelect< EOT > sel
+eoBinOp< double > & crossObj
+eoBinOp< double > & crossMut
+

Detailed Description

+

template<class EOT>
+ class eoEsStandardXover< EOT >

+ +Standard (i.e. +

+eoBinOp) crossover operator for ES genotypes. Uses some Atom crossovers to handle both the object variables and the mutation strategy parameters It is an eoBinOp and has to be wrapped into an eoGenOp before being used like the global version +

+ +

+Definition at line 46 of file eoEsStandardXover.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_es_standard_xover.png b/trunk/paradiseo-eo/doc/html/classeo_es_standard_xover.png new file mode 100644 index 0000000000000000000000000000000000000000..a3e0b9645ae51ce1cf70c5d3070c9cb8629a94ee GIT binary patch literal 1985 zcmbW2e^k;}AIC9TILpYKrCF(o%JOHFu1r$5n4sjG5>7)bMV&1zabg}yNu~193;}x$pb>+?y5P z?_+4N!vF*V8Dh{!13{p59Xj2%9<0l!F<13;g=qj5htg`bI;qvR-Mo2{p;LdRwzf9v zW35zI)%!lsKM3SC@gf=of&^oZdgIQQ&XfYos)Jil$G*>ejyC7qP8&g~p|zDrdu{4> zzE)mk@I(1=@&q=do8eBfQBk=qguTj|ovV%K-EFRf<~nP0BJ`POBZ{mRXT1<$MmGqy zzlWf@#TFB%>gq0&A|Z_y4?4?Ao-9-Lj>zL5r16N!c@wE@#JsrCF^3vgp#JtX8CDZM zRfkhNNA78={?>U96}b#Ce&#q6QU1_Wy=C4f#;=G}(w?DWLa2S6j}gx^(D`FduM+3 z99?;fl>F(PQ-wAn>=21(m69zjX*NNml+V`Y%N+RKQe`bE&2wiHNDdP@xItke>@cQ` zUwpy7AR8B+8AT?tA_Ji(0N2xG49|B@@3P-9arE}f|01gjo=eYAyzMaGyl=Q;;55T@ z5$L;y#D+ytMsa49cUOtO^`0mV3wT_ff*2r~Fq4a27RaY~DdZuXaJsTuB7`)lvugfm zmzs3OZDcOn>)aOkMW|q6hq!`S*(YS1~JWOqzzM;_!T5AN3r7TWy0lv zUm)r?kAQX8?HM$!|BR3p>hp)5<>D+MEz@wy=VeF@2$o3OXz>9C5U^>Di#17GAvk7N z)Efa<4)`EAXc{DL>vyN^chN1n=^r$?a$0MD7;SA?37&={DlrA~G5Trsxe=ph(W@SR z@~GPv&1ji=HL)x(2m!*3Hf+FOPZGLxUE-ftakrOQ;Fq$+>VZRde#- zma*OPE1FU}rl@D~?gfu9kLp}cEBr3E{w}KIkwG2XV}ZNZsiQ~i_>p^0Bb59Vc}mI4 zE46TbXcA08hSw>UwxXbifzt!XaxXui-|6ZN$hFg+Z&ha%#&R^V*#yO+zqt$U?R0l@ zd5Q5KPj~-Kcmz$S-9^uHGBhJ+VjT>Zc9o$wCnY&peC2Eie*mhmoh-(tR0T8r^!RMq z6+Rjtd#;L{(56BH6&a<^zxEjRQXzm0rzoC|tvrH$W1Q`EI(Bzg>m$Xv&sZV?S$V#~ zl*AN8G@(N*53@e~`oi|dEw(Yi)PftO7T0r&@WcTfQMW7LU0fi6GCB!#$GSjT0Pc2r8}R1JgL1F4i+E+CPub1go2 zKyd4Z?7h1Y?9uW!V<7m=lFIAAvF%8)0zoUlJ3SlT8GOK9Ld>7pzN1QQcH0jgC z{AWut^Gl@7=SCwxgy)*qx=8&8(&CP^hfh)NTYn830M9o%fbhPJ`?9BFJw4FO+uHaO z->45ADN&@b7L|R{?*=C*^4M621x4 zJk}7h_B>k_Qy>Ppd-7g|I5vV(-0*4evR>bc0|k zb{aYmOi$rC_JlPyHf3cR*Nl0D&?UUkiLJ3^ITE_*-wpVm&V1-7pHqVnzhG9OUDn%B Vz5O%4=>A&}2IYU0`}xWA{{ZU2vkU+L literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_es_stdev-members.html b/trunk/paradiseo-eo/doc/html/classeo_es_stdev-members.html new file mode 100644 index 000000000..789593e98 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_es_stdev-members.html @@ -0,0 +1,53 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEsStdev< Fit > Member List

This is the complete list of members for eoEsStdev< Fit >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
AtomType typedef (defined in eoVector< Fit, double >)eoVector< Fit, double >
className(void) const eoEsStdev< Fit > [inline, virtual]
ContainerType typedef (defined in eoVector< Fit, double >)eoVector< Fit, double >
EO()EO< Fit > [inline]
EO() (defined in EO< Fit >)EO< Fit > [inline]
eoEsStdev(void) (defined in eoEsStdev< Fit >)eoEsStdev< Fit > [inline]
eoVector(unsigned size=0, doublevalue=double())eoVector< Fit, double > [inline]
eoVector(const eoVector< OtherFitnessType, double > &_vec)eoVector< Fit, double > [inline]
Fitness typedef (defined in EO< Fit >)EO< Fit >
fitness() const EO< Fit > [inline]
fitness(const Fitness &_fitness)EO< Fit > [inline]
fitness(performance_type perf) (defined in EO< Fit >)EO< Fit > [inline]
fitness(void) const (defined in EO< Fit >)EO< Fit > [inline]
fitness_traits typedef (defined in EO< Fit >)EO< Fit >
invalid() const EO< Fit > [inline]
invalidate() (defined in EO< Fit >)EO< Fit > [inline]
invalidate(void) (defined in EO< Fit >)EO< Fit > [inline]
invalidate_worth(void) (defined in EO< Fit >)EO< Fit > [inline]
operator<(const eoVector< Fit, double > &_eo) const eoVector< Fit, double > [inline]
EO< Fit >::operator<(const EO &_eo2) const EO< Fit > [inline]
operator<(const EO< Fitness, Traits > &other) const (defined in EO< Fit >)EO< Fit > [inline]
operator>(const EO &_eo2) const (defined in EO< Fit >)EO< Fit > [inline]
operator>(const EO< Fitness, Traits > &other) const (defined in EO< Fit >)EO< Fit > [inline]
performance(performance_type perf) (defined in EO< Fit >)EO< Fit > [inline]
performance(void) const (defined in EO< Fit >)EO< Fit > [inline]
performance_type typedef (defined in EO< Fit >)EO< Fit >
printOn(std::ostream &os) const eoEsStdev< Fit > [inline, virtual]
readFrom(std::istream &is)eoEsStdev< Fit > [inline, virtual]
stdevs (defined in eoEsStdev< Fit >)eoEsStdev< Fit >
storage_type typedef (defined in EO< Fit >)EO< Fit >
Type typedef (defined in eoEsStdev< Fit >)eoEsStdev< Fit >
value(const std::vector< double > &_v) (defined in eoVector< Fit, double >)eoVector< Fit, double > [inline]
worth(worth_type worth) (defined in EO< Fit >)EO< Fit > [inline]
worth(void) const (defined in EO< Fit >)EO< Fit > [inline]
worth_type typedef (defined in EO< Fit >)EO< Fit >
~EO()EO< Fit > [inline, virtual]
~eoObject()eoObject [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]

Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_es_stdev.html b/trunk/paradiseo-eo/doc/html/classeo_es_stdev.html new file mode 100644 index 000000000..2a8b0394f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_es_stdev.html @@ -0,0 +1,105 @@ + + +EO: eoEsStdev< Fit > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEsStdev< Fit > Class Template Reference
+ +[EvolutionStrategies] +

Evolutionary Strategy with a standard deviation per parameter. +More... +

+#include <eoEsStdev.h> +

+

Inheritance diagram for eoEsStdev< Fit >: +

+ +eoVector< Fit, double > +EO< Fit > +eoObject +eoPersistent +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + +

Public Types

+typedef double Type

Public Member Functions

virtual std::string className (void) const
 Return the class id.
+void printOn (std::ostream &os) const
 printing...
+void readFrom (std::istream &is)
 reading...

Public Attributes

+std::vector< double > stdevs
+

Detailed Description

+

template<class Fit>
+ class eoEsStdev< Fit >

+ +Evolutionary Strategy with a standard deviation per parameter. +

+Evolutionary strategie style representation, supporting co-evolving standard deviations. +

+ +

+Definition at line 37 of file eoEsStdev.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class Fit>
virtual std::string eoEsStdev< Fit >::className ( void   )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Return the class id. +

+

Returns:
the class name as a std::string
+ +

+Reimplemented from EO< Fit >. +

+Definition at line 47 of file eoEsStdev.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_es_stdev.png b/trunk/paradiseo-eo/doc/html/classeo_es_stdev.png new file mode 100644 index 0000000000000000000000000000000000000000..ba7918b929a296fcf94fbdbbec2d2096a986c07d GIT binary patch literal 1473 zcmZvcdo!Cc5G+Q**)7I@Avt9|9hY3Jm*ccwK11O${}Gen53lz z*$xJS#|e2IAu44@Gv_Ydl+GQ zkOG5=Ia`v64mWcaa=GjxJup7btYMC2-A}pXp}j&Xul5PQ94)xFu!NSktNm#vru>OX zFr*dWHlkB!1yAt6ooS;YRxF3yM<}`ml3a0c-fc;xBHLtf#S*ldH~v#YY34)80|QZ# zVM3l#ZLsu1v3r_|@fj8Itn~e~EW)N0=2|L)fWU#V0F$7%W6i>S>y;X(y2JQG11aPF zxr+SH8|4ZRrvU~Xc&LQ}$p{1rP9zh+A7Yv&Z4{pzeLeEb;dFuOSMLryBiwnrAPLA~ zXdXa?xbj>_j`DslQw>EEr@D(~T-@jErHF>-o%<^l3v)MHQp_xDGvN<|i!ohHN3<2X z`!2$q?tUBjRD@LMYxVymJ@FQ2H*LKdWbnY*nA?J%69F=o2GXh{iXBKF7uo%IHG-`2 zR%-d3sb^8ipnOe0eItJ>mi)G1{c_oZ!OYnSd>DWI;FX(0#tr{c+`%8vXjay3bt)FrSpxZ*t$g$tp6X zACDVUp))2_%C*$6`;_&HPt(CE={5nS8>^ch)h^D@xFDMl{4(%9Bogaww&|rl$Xcme zVwK19m+I2oWsIOwOvmeat)6kM9z6qNd=@ty^Ch&+JvZ@t=cr(Jv@pXS4s@HpjSPb$ zJXcC;Ikn`^=4m=NkkoVM!r*jOH6L78uf&=&_D52niUmeoRk4}Kk)yUpa99Qa;6!MQ z80>e1+Gy%if52%=qUyUH2Y`U(yUoMKm%GYu5qp^VM0^v=^%RO!MRIQX7-+)pWe1=k zUy399#IN1{^*C(%Y{uqPv<~O$!ON0Sg%18Ijt1N1E32|qAnEvE1chSFz+ChAEeT9| zJe*i$evJK$r>|RM1HMLfmTjtpp*%;q=6p$#i+Z2AQv2kNx0W}B!tJL)ZW33HIvpy0 zZ_&&M-9Cx9=s3wrpWkx=f55M(=?ezb>CDc9dz$QC0mjl9XyXPXExzUClCBXGBXDW4 z-3=$sN!UqtWlrKhM*rpcKUj&9dm*RL2g0aj5gs_KJPWAa8%PqvW_ZsJtPL@_0fi*+ zAZc_|1{^iipy_WVpIy~$Iprg`%i*q_@*5e}mXLw(qfb*x8HTH0<3h5h4?j|OA_N)D zTAz=$`vnMW;0Y}Bj--xz1!f`v^d1m_z9cKA$h$*69eRwMW9A9LXhDsp2+oVr#6CJh z3-R{CO;-tc+p~DRt+oM3Xgi#^F(*_nxmBPNBmTJ5Z?Ccl6q^_mw7c!|!%%*U_{!Nw XMawHyQa&$*_ZDVpYC~p|JZOIb;YW<{ literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_eval_continue-members.html b/trunk/paradiseo-eo/doc/html/classeo_eval_continue-members.html new file mode 100644 index 000000000..3b7c040cd --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_eval_continue-members.html @@ -0,0 +1,27 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEvalContinue< EOT > Member List

This is the complete list of members for eoEvalContinue< EOT >, including all inherited members.

+ + + + + + + + + + + + + +
className(void) const (defined in eoEvalContinue< EOT >)eoEvalContinue< EOT > [inline, virtual]
eoEvalContinue(eoEvalFuncCounter< EOT > &_eval, unsigned long _totalEval)eoEvalContinue< EOT > [inline]
eval (defined in eoEvalContinue< EOT >)eoEvalContinue< EOT > [private]
functor_category()eoUF< const eoPop< EOT > &, bool > [inline, static]
operator()(const eoPop< EOT > &_vEO)eoEvalContinue< EOT > [inline, virtual]
printOn(std::ostream &__os) const eoContinue< EOT > [inline, virtual]
readFrom(std::istream &__is)eoContinue< EOT > [inline, virtual]
repTotalEvaluations (defined in eoEvalContinue< EOT >)eoEvalContinue< EOT > [private]
totalEvaluations()eoEvalContinue< EOT > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_eval_continue.html b/trunk/paradiseo-eo/doc/html/classeo_eval_continue.html new file mode 100644 index 000000000..0ff8c324f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_eval_continue.html @@ -0,0 +1,63 @@ + + +EO: eoEvalContinue< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEvalContinue< EOT > Class Template Reference

Continues until a number of evaluations has been made. +More... +

+#include <eoEvalContinue.h> +

+

Inheritance diagram for eoEvalContinue< EOT >: +

+ +eoContinue< EOT > +eoUF< const eoPop< EOT > &, bool > +eoPersistent +eoFunctorBase +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoEvalContinue (eoEvalFuncCounter< EOT > &_eval, unsigned long _totalEval)
 Ctor.
+virtual bool operator() (const eoPop< EOT > &_vEO)
 Returns false when a certain number of evaluations has been done.
+virtual unsigned long totalEvaluations ()
 Returns the number of generations to reach.
+virtual std::string className (void) const

Private Attributes

+eoEvalFuncCounter< EOT > & eval
+unsigned long repTotalEvaluations
+

Detailed Description

+

template<class EOT>
+ class eoEvalContinue< EOT >

+ +Continues until a number of evaluations has been made. +

+ +

+Definition at line 36 of file eoEvalContinue.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_eval_continue.png b/trunk/paradiseo-eo/doc/html/classeo_eval_continue.png new file mode 100644 index 0000000000000000000000000000000000000000..b470cc85bb88a6e6e62f04ac2339854f95c49b92 GIT binary patch literal 2269 zcmbVOdsI_L8o!7L5*{L!pcbg5h$|XVR}qi^0u?0CXeg|P6j*r(!9WaGM4lp=f?!oD z4@1QAOb8(!SfC~lS=gd23WeNwA($XbA>=|L@}z!{sh2ntUnR}^k_bw?g8gYl+4HVH3v3)S;uuoncRM`FDt{gw%BNC`@`pWqVBF86rGxB6B{}-X(wttp z6UmQ>SqC+0fjiwuC_JnWHBNy@)%Box2Ge(WVU-IZs(!g+v9`WJ(79nScViV}nDUf) zFQNZa$GE3nOhd6)?l3=~r6v+q+{j*MF{!paG|=w2@%%uIU7|%t@5sv+eS3!wfXDN) z*$pC5R1C3IJ=5CQYPY-9PL*8U{ruTN*yE6i-+v(u_xPK&__zuN7VJHT#uHYlGjyS(03 zv>1p^Yb>!9A7S204jNe}&P!4x>=oAynqkg*Y?~+2cdL{rx#4gQk#$8SM@6Otr^mN= z-mmVi+O&4=Btcpf5PeW~G%BUb*UTdaI}c*Umys3I^jy~l{+$tF0F^bjrSK+aZ)Dot z&)SQ&#DOoSDpbN_=5x1w4Yo9(1X5dID8aN z;y|&VLyegmS#XdNfrEIXDUlQy!p?QAIoZS?q=B#5P{Ye-$4If%4pWd3nD~`Yb&21P z=!37PlI&@o9KmU5pi)dt67U+5a&S_kR3^KI;fn@2LJDgZoVh>?Da^BfF#9XJ$GMJ2 zXnYj_0Xm;8EpM% zmQTU{dD6rZd1x}W2UqmV`D~N1>j%$~7A8j%tr-uVPLK0aq=G-ur`(w2wWEU1mpRFQ zLqU!Bpk|M9^3er77FjFKwRzRQB?Y{JcK3T0O!mEFJu|oU% zYY7>fzOcBn#z%MC;+!?}&Zt;C_hyEPdh=IxzMq46w!Y^ECDy4B90!Gl-z`nJQI8&k>9w`?-|)uQ7~J`Dm2}s+6BJ@+W60(LUey6H9`m`9f8ba$?LTvp|U1 z9Cqt3CbZIOE>BR2ij=|30Me&gFX70Du-IUZ$=GR^b{ucwi8anN2>jKd-5{|L6=}s8 z&b7wLiuX^7<`24L^ULwrz+kzc`mYkc+15Z9q(%GLbt;3i#sHQIpi9~AIrdC8{bKzr}C z1f6u_FD!s~jkGdQKDt1#w-fM8qgnuc!wC5CS_05^sX`mT{5O*fS7QZlYk@aR|6I6; zY9BKCKzs4fPP?s8)jBS(761hu_(H#y5Qf%We*G#)*<**)vqN90Da99L68rM!Evmy{ zgbr)4Gzf|i?Vvj*znbjoTIuQu49wt5lRQYboRb3=!vAIAs~;=gI1~GJ3ZIZFeK-Oa z;&Clxo=*L{fiI>O8Ytrp)@q_IcbJF0gh8tE4)*Ms0lkK|v5jSZM?YF43ghQDz2OH| zdhc@)I{i~VobIeCDx9R!j3xR%bM!x?@#7|KrF6%QeRDs2%Sp)C$4mgcKB(p{U!>mT z*<4@oQvXC#r}N2nOlJ}L^%|&g<_4dfw!nvIqwajXto4*OB8euze%!~wuew!Fq{_c0 z!6au9sZQjwkbf%zttS1T+9rXLz9t=$KR?S}LDF|ee-~|4&BMd{nkX!?+y<=U&73&{ z4i`?8bvqn{;Zbf~uLaa73M`j-oB~PmwA2cUWOwi$2lS);iFnwb%n^hm{3xz!Jy9CL zHR4hdzfn!J~^hEdTXp}m5s*H;oIb!O3FD0w^8#pX0X~Q`O lua7=t;jaAVQITA2)wDhLh|NV|x#lkd_;~qy)*TAX{2kBIP!<3H literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_eval_func-members.html b/trunk/paradiseo-eo/doc/html/classeo_eval_func-members.html new file mode 100644 index 000000000..d35d9142b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_eval_func-members.html @@ -0,0 +1,20 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEvalFunc< EOT > Member List

This is the complete list of members for eoEvalFunc< EOT >, including all inherited members.

+ + + + + + +
EOFitT typedef (defined in eoEvalFunc< EOT >)eoEvalFunc< EOT >
EOType typedef (defined in eoEvalFunc< EOT >)eoEvalFunc< EOT >
functor_category()eoUF< EOT &, void > [inline, static]
operator()(EOT &)=0eoUF< EOT &, void > [pure virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< EOT &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_eval_func.html b/trunk/paradiseo-eo/doc/html/classeo_eval_func.html new file mode 100644 index 000000000..37ae3493c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_eval_func.html @@ -0,0 +1,50 @@ + + +EO: eoEvalFunc< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEvalFunc< EOT > Class Template Reference

Evaluate: takes one EO and sets its "fitness" property returning this fitness also. +More... +

+#include <eoEvalFunc.h> +

+

Inheritance diagram for eoEvalFunc< EOT >: +

+ +eoUF< EOT &, void > +eoFunctorBase +eoEvalFuncCounter< EOT > +eoEvalFuncPtr< EOT, FitT, FunctionArg > +eoOneMaxEvalFunc< EOT > + +List of all members. + + + + + + +

Public Types

+typedef EOT EOType
+typedef EOT::Fitness EOFitT
+

Detailed Description

+

template<class EOT>
+ class eoEvalFunc< EOT >

+ +Evaluate: takes one EO and sets its "fitness" property returning this fitness also. +

+That is why EOT is passed by non-const reference: it must be altered within evaluate.\

+The requirements on the types with which this class is to be instantiated with are null, or else, they depend on the particular class it's going to be applied to; EO does not impose any requirement on it. If you subclass this abstract class, and use it to evaluate an EO, the requirements on this EO will depend on the evaluator. +

+ +

+Definition at line 41 of file eoEvalFunc.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_eval_func.png b/trunk/paradiseo-eo/doc/html/classeo_eval_func.png new file mode 100644 index 0000000000000000000000000000000000000000..2dc086d6b444d2c7ca525af2a8ae7bad130ba7f6 GIT binary patch literal 3367 zcmbtXXH*kw8V>4J5iB$T!JyKvi!x#XqzEV$4DE`DNK6n6MT&F+!Jr5ND&R$6qzZB) zQlx_dflz}Ix>7|TATrcFShyoIYml3tgnljjx{H*w}!=jg8uuFKwSe(T}6HwiZ{v z@eN7^e6E;U!1O2k9bhowY9m8~tJoAqYMWoC*4_)_Mr4tP4#F!tXY+eHEaW?+IZHA# zmk#LL9?Nf?SrMIyVC>(M3%CYm6FydN*N7-uJNuK;u*EHHe|R?MR>jx%@Ipi!{*xjx1+V z)$<_Dn}S%`e#p;vv6vFmJ4_tZTbZ6EfDM}EaMP8GTccQ_rKjfz-W9JVF)8S^%)9Jj z^)9*^*80omM&$tHe^Rtc#iy0Tgk2qRpyQO{I3m7DrF^l2&sHyEZ zH!`Agd^0hqsA@D zd?yqL{-i8!2ir5o#gnwQL`uQp%stK?+zLA^-iw5A^Rsn=VZVd_?EOc}pBP%L5%TaA zh4Hnf8L-7#1Pn5l{%+zH$XWt_DjnUO&eZ#|sa8B}Ll6#oJ*s#gjulMbhT1g!0E7k7 z7mJ<0@bJ)s0pqmU_}H)L5eF zjTQh-x`f|-enV*;Q(!Oq;aX24CChG1Q9p8O9iuJXT=@!gPIR19Tvvps*CDm`+9$h) zeB_Ca>S*`b+e{6*>Z;$vOUG~q9A-~j$NZ$(_65?FBcg=bMEvlDIMin_rdYdcb^ZE( z0)Lv=|4W5`74uEpWB&-zDv5Ote+_%rSCHWA~Z9UqZXMJ9{ z4J&AF7Y=5~2=DmHYd8-C*WlgXG2=X+p!KkV9cR?otq}93mSIU?Rbq5~NC@Xs&8bBZtT@x-P41v_O z1>Hv5?_eJ|e{kzV2z*}?v>WQO-P5o%frGjrFdz79Q}HC!Qg|fe4R-W~kmbQg!5yrT z=Y5n${hLnTzHb)p3YIVPe~o-l+4-TNXF}zhKH=!kKMJU`3ld)G-FwCD(p66` zc=&R5oHlnB+M#AHxi8>-Wl)&xo6?`cq}~Wc>A1#|u=#qOO+s?*6;zL@p@lQlP<}3@ z9hpE%dpKj_c2~2|mz{qV1$RIEh*93DX+>x&C-p2={B0x|DQU_eB@LXKC_hFn`~@|B zS3|e!;^>$JU;ooJj=P^{{7viV45Xw=nIvf;XV&j(CwaerPZRTT65ZF;@|V+=D)f$q zyo{db>lTsyi^a6bi?gj1dVQd$ozB3^o07ctmJy~`g~o+aXnmhTRrhE$9cLlVWZsor zBeA;<9bxj8+N3xAdyfNs6qf|QuYWR^F<5D_ zn>e6k&8)1vWEphrZF-S(P_mAK&m8%3Y2b2>I?c}PGqovf>nSI5<$$4VL-FcT2U)qB zt9`+_+*stGU=ORX%{@=jk(*IJDIlTEdIc8o43=*JhNXUNRkEmQ+u6BUE%tFYRlDoX zLK!AD+fKQ@zFhDqi|(iwRGg)ai;J3PQv_putXHUpnC!@hj)@qh*gW3~nKse~O?7 z8aLY2As!~Dnyjo|*zQ)my*}hoZl0q(y-DFZoLXO z^mHQ+U29;zX&DR+zFx)+FdatcM^-SsGIge6uev3fPNK9lSjW?JPfq(}kwbFG8c$E4 zmgB{SpPkG1@8jRV^;0p)0RxXT>Z9V~Ey|Q8i#V8A#l8cx0f$5|fW4TXdIY_`cN&wo zIXFYkO3NyUbi`*gETRQfdCNmwsg)IVfZk)HAqS-3tj+3=HWf}{_Ne$hzBOPQbOOaX zUK)9Q=7}f$@rz7|r4o4OK3WamYleW9mL@LxYmY$$r4BC#`K}5e=V$qYXqVk8sOapX zI-?I!BR+MMrMS0*oFkLJ@{1Ajm2V7!ww!BMup^Lygxk0xG6CvodCwnaWSEhQp7Xun zoe%g6YC|7e=JRIVaO;x+qf3S@fuhjM*TXMv(@hkPy~d^ZO#@S?xoKb}4qO5Y0<9HQ z&@@0U6Z|@j(Om{{cOZ@OmOwXc24KVXl5NiaEiWZUV-d`@mpvubT$CkRbSjz=`_x|k zWe2cc=(X5QxKDoITfWEF0iTGg@MN>H1L#GW%xgDHd!>bLZbId_Q0OzP@X;eS?dPmx#t#WycMP_$y0f z4yFs?uOwnaE6VnNOe@L=bEFkf$6pM-ME0qFD5Z`S!jsRu4`@CAB92r9r!{x2f30H1 zy6#|K%0*I={bK@&ol^?zVw~~!+q$i*9<)5sd?m^<(4wg;{a)H+aAoQ1F>+7eB4>iS z)W5V4;@qID*bwfOU9Bim@>MF4i$;Pj}$=w`3fx= zj`}Qf;@JXo*#>?j*lL%0^ + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEvalFuncCounter< EOT > Member List

This is the complete list of members for eoEvalFuncCounter< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + +
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
eoEvalFuncCounter(eoEvalFunc< EOT > &_func, std::string _name="Eval. ") (defined in eoEvalFuncCounter< EOT >)eoEvalFuncCounter< EOT > [inline]
EOFitT typedef (defined in eoEvalFunc< EOT >)eoEvalFunc< EOT >
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
EOType typedef (defined in eoEvalFunc< EOT >)eoEvalFunc< EOT >
eoValueParam(void)eoValueParam< unsigned long > [inline]
eoValueParam(unsigned long_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< unsigned long > [inline]
func (defined in eoEvalFuncCounter< EOT >)eoEvalFuncCounter< EOT > [private]
functor_category()eoUF< EOT &, void > [inline, static]
getValue(void) const eoValueParam< unsigned long > [inline, virtual]
longName() const eoParam [inline]
operator()(EOT &_eo)eoEvalFuncCounter< EOT > [inline, virtual]
repValue (defined in eoValueParam< unsigned long >)eoValueParam< unsigned long > [protected]
required() const eoParam [inline]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< unsigned long > [inline, virtual]
shortName() const eoParam [inline]
value()eoValueParam< unsigned long > [inline]
value() const eoValueParam< unsigned long > [inline]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]
~eoUF()eoUF< EOT &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_eval_func_counter.html b/trunk/paradiseo-eo/doc/html/classeo_eval_func_counter.html new file mode 100644 index 000000000..79efb6020 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_eval_func_counter.html @@ -0,0 +1,54 @@ + + +EO: eoEvalFuncCounter< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoEvalFuncCounter< EOT > Class Template Reference

Counts the number of evaluations actually performed, thus checks first if it has to evaluate.. +More... +

+#include <eoEvalFuncCounter.h> +

+

Inheritance diagram for eoEvalFuncCounter< EOT >: +

+ +eoEvalFunc< EOT > +eoValueParam< unsigned long > +eoUF< EOT &, void > +eoParam +eoFunctorBase + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoEvalFuncCounter (eoEvalFunc< EOT > &_func, std::string _name="Eval. ")
+virtual void operator() (EOT &_eo)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+eoEvalFunc< EOT > & func
+

Detailed Description

+

template<class EOT>
+ class eoEvalFuncCounter< EOT >

+ +Counts the number of evaluations actually performed, thus checks first if it has to evaluate.. +

+etc. +

+ +

+Definition at line 37 of file eoEvalFuncCounter.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:47 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_eval_func_counter.png b/trunk/paradiseo-eo/doc/html/classeo_eval_func_counter.png new file mode 100644 index 0000000000000000000000000000000000000000..6c871eb5e6f46cdd21681ec5cba296892dcc095b GIT binary patch literal 1917 zcma)*3pCaF7RUGhJRFW^x^xbCbs3WPlxD`9{0WKTR7WW4bgxIsYlYM4((TX15mFeB z4hFfR8XS>#Io?rT4Kaj6UUgy^jF8M}TI;TL*Sc%w{?^*R-*>Oy-fR8#-oMXvy2Bx9 zvJx2pqz~I#9S6XPB=8A%(T-`fGDHW3euQDYwY4RZTU-3>Z00SI`rY_^erV&?q{u~r zk2{B2QN?`qACDrzMpK*#3gPulG0WhB{YoCiVH-O&G z8g~43_tfb3G~da#nkLT46Y$jht;_wHwp9F6?kfjY1sfHvE|=kD#Ejgoh-mHveM$4V6(;RuISv1l>_L*w~^IXd*bbs#~9pHkSD z#e2j0N;WKIP+D%wRUxwM<0Iq_)?Dp=l7){sm~(?uE8i{r3heUr7cr7k}_2B6xWwb;My^58gp>QuwpBf zgb@;Ek&%nA;6F-iqQbS6;T`b7Ity8FXW|4r)myDFMt%Ml)K!We2aFd5n=dK&B-fmy z5nwH4>lN;B&Wt0UNi-7EDYExMc9a`q2h*D_Xy-ecOE$Obzam9aa*QJRhay~=+C?Lz z<)u6N7Y10FGN^LEf?avSoG<+IC*(}d*Hmmo>vPwqYBswkTGn$*@9ElmG75+BY!{{M zY|;(K(s>!dj0K~Vr0~XaL=_`gAgHIuy?C+~6vpeN9Lps@N@Bi=?st%5@{nN@B@eQ@ zT<25gbsnBsDw2m+3W8J+6hkEeE)%P?plT0aAK|+r{t_@x4z!0rXQuZt8e@^epLK>p z)dy=qb=~GT6vP4Hse$dC7>T_+Pq%19kxHYnX}x!L@-ynP6jTuP%}MTg%jsOxGQ)S` zsN<6IexLndT7_Qbc$#u6uOBhPQ_AAP_VnX0Bf><3 zlAYp`9~mMUce}J#(D0MP>rLB0Jx!dCysiU2>}eN;fFOF@l+GVa1Ql#;d`)K)PA=oxPTrk0py8Fn~=uVIXB$Fhm) zDXf3X&*Q_WEGI%>v!1|IgQ9y-mieHft6%%^_OOzo%NNs#Jg3j4tHTpTXej9)+bm<3 zPLA8@{`J#LY72%&RQYo!=KN*Rh@AiQn_-jMQAo#O9Z!!_73_dcb=A$Ylz`uJbpC8u z|1;TL8XAHm$2PI%Ikm)X(B^yu#IZ6Q{k2KtklxfU4TwPr`uG$tkc@7SI-Ax;OIYW< zvQt(2$JEdl6H}SQk*IgKoo{y46M38M8-X8sA*orqUbDZ-mO8J5%vS2hzy}|V0jsrl zl8 zNTI5XSdV7P&^f!L-jB1qz3Qp))pi?rdOAvCB}b8sy~(naP`*jH7PynqsA<-@hW!em zFnD`0X_oD#C(&hwv;A>ZDzdu$o2v)BeN72xyl<@iX!$b#xbY$RZ6fA-HihIzQWPzXTEDrM!4<7I9-TgD-UXVP^(xj+O4I|!mm}ss1=(pqzIb!J)c)PxvNj~$YbLNa(opr``NBHT{{L) zf@E-Pff@(PAQ~+fl%e03uoul5oSIjGS0i8eL;~wiL6cR|#CX=9zX#nQ;_QR^4e!Oj zxzCx~#D;{zWyg$K8a7h=l*5Y10{KV^&2v&kW$SbPZf?MMRzVkww)tp!QE^gS__1(in&da8=`_{VN zfaarsFU*8>y`3J}d+zP%Vk^Q*;1y2X40mdD#7mmg=k(=#qtLl*xM0+`}q->2)`O_!6hQTMq>VTM**K%W#AhXj^hj6q6UoKlcN9Qc|yW91}G zLKhBB2@Hdzk$|1JJ%HVeooSEe+Y0o6+w%?Fk`C`zrQe|CbRd~LlBO|mx1BC*EUqEz zcSob~NV{HOD@EXqRLKS=7Wo7!F+$Q61PA!mAI0*BzHI>;8`x48&b#8jik86aUBc9n dg?#h4Euw)tPbTW>dovKN!`2Q~#g@#7-vDjjLRSC) literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_expansion_mutation-members.html b/trunk/paradiseo-eo/doc/html/classeo_expansion_mutation-members.html new file mode 100644 index 000000000..d151db761 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_expansion_mutation-members.html @@ -0,0 +1,34 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoExpansionMutation< FType, Node > Member List

This is the complete list of members for eoExpansionMutation< FType, Node >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
className() const eoExpansionMutation< FType, Node > [inline, virtual]
eoExpansionMutation(eoInit< EoType > &_init, unsigned _max_length)eoExpansionMutation< FType, Node > [inline]
eoMonOp()eoMonOp< eoParseTree< FType, Node > > [inline]
eoOp(OpType _type)eoOp< eoParseTree< FType, Node > > [inline]
eoOp(const eoOp &_eop)eoOp< eoParseTree< FType, Node > > [inline]
EoType typedef (defined in eoExpansionMutation< FType, Node >)eoExpansionMutation< FType, Node >
functor_category()eoUF< eoParseTree< FType, Node > &, bool > [inline, static]
general enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
getType() const eoOp< eoParseTree< FType, Node > > [inline]
initializer (defined in eoExpansionMutation< FType, Node >)eoExpansionMutation< FType, Node > [private]
max_length (defined in eoExpansionMutation< FType, Node >)eoExpansionMutation< FType, Node > [private]
operator()(EoType &_eo1)eoExpansionMutation< FType, Node > [inline]
eoMonOp< eoParseTree< FType, Node > >::operator()(eoParseTree< FType, Node > &)=0eoUF< eoParseTree< FType, Node > &, bool > [pure virtual]
quadratic enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
unary enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
~eoExpansionMutation()eoExpansionMutation< FType, Node > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< eoParseTree< FType, Node > > [inline, virtual]
~eoUF()eoUF< eoParseTree< FType, Node > &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_expansion_mutation.html b/trunk/paradiseo-eo/doc/html/classeo_expansion_mutation.html new file mode 100644 index 000000000..274cea116 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_expansion_mutation.html @@ -0,0 +1,165 @@ + + +EO: eoExpansionMutation< FType, Node > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoExpansionMutation< FType, Node > Class Template Reference
+ +[ParseTree] +

eoExpansionMutation --> replace a terminal with a randomly created subtree +More... +

+#include <gp/eoParseTreeOp.h> +

+

Inheritance diagram for eoExpansionMutation< FType, Node >: +

+ +eoMonOp< eoParseTree< FType, Node > > +eoOp< eoParseTree< FType, Node > > +eoUF< eoParseTree< FType, Node > &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef eoParseTree< FType,
+ Node > 		EoType

Public Member Functions

 eoExpansionMutation (eoInit< EoType > &_init, unsigned _max_length)
 Constructor.
+virtual std::string className () const
 The class name.
+virtual ~eoExpansionMutation ()
 Dtor.
bool operator() (EoType &_eo1)
 Mutate an individual.

Private Attributes

+unsigned max_length
+eoInit< EoType > & initializer
+

Detailed Description

+

template<class FType, class Node>
+ class eoExpansionMutation< FType, Node >

+ +eoExpansionMutation --> replace a terminal with a randomly created subtree +

+ +

+Definition at line 204 of file eoParseTreeOp.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class FType, class Node>
eoExpansionMutation< FType, Node >::eoExpansionMutation ( eoInit< EoType > &  _init,
unsigned  _max_length
)  [inline]
+
+ + + + + +
+   + + +

+Constructor. +

+

Parameters:
+ + + +
_init An instantiation of eoGpDepthInitializer
_max_length the maximum size of an individual
+
+ +

+Definition at line 215 of file eoParseTreeOp.h.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class FType, class Node>
bool eoExpansionMutation< FType, Node >::operator() ( EoType &  _eo1  )  [inline]
+
+ + + + + +
+   + + +

+Mutate an individual. +

+

Parameters:
+ + +
_eo1 The individual that is to be changed
+
+ +

+Definition at line 228 of file eoParseTreeOp.h. +

+References eoParseTree< FType, Node >::pruneTree(), and eoRng::random().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_expansion_mutation.png b/trunk/paradiseo-eo/doc/html/classeo_expansion_mutation.png new file mode 100644 index 0000000000000000000000000000000000000000..113a12cd1868aa5ba4b5d41c4f5c411f99ae3ce7 GIT binary patch literal 2334 zcmbVOdoJgnRQN)P?=1*j7x4w8Ny)PFTV-*z;>wJIgXTN*z=Uwk*KWpusamK+`R$5gW z0)fcdowRm_K*R$?cI#Gg5hi33hC~zWj6K#yC=`lJp|G{M*gr>P{TQvSt+8#wPokw* zl(T~iL|*nNH6aEDDe*1GnZf$#95_#S=pGFR@?ah|R7sRrmV zT%tB}4-aeLACO;T@>$G6qtXT5vSBqwm8a`#6~Lv?B#c%%C?kzJ0iXtUsoq7ZUg)lb z!zt5QugvHzoTZ}2tf^84N#z(3Idyf|dwwGCSRQBL@Q5c@y)G@nT?v>G@s{apW?eo& z`Q4b2kpMQ_*c=~LYPa6n zzUH76J?Jk!bIWh>-gm?EnbovjH8MZ{;XHgU)jR?=#c)#1e@ZSVEe{8nGne%9T<6m$-EOUbkh7M?*vaZ| zqh)ZraO}gTzVB|$c9145#ij{3<-f{_Yy|9A z6WwnTPyzos(g2kr6zrq#bU(zT%4SWJ7{K+z%TV7+rt5ElC9{zfOdkmti->EN{xn2e zs^b@d?>Y~~v^GBxZ_#zH;D{S^|$X&S_dZCuK)v{JOfm%2Sv}3yAIN!(ICydzj z71SdjR4xoVTh8@J4IO`Tn@D-f&IWB&NSS=u{T0X-MSI|4DN^+=_^1~~(Ex@Jcr?^p zFpv|*g?xd?(6{*?*hF(Tbdq*!+eI;)vyJygQ>qlqcQTk4fWxV64YP4~mD#B#|0 zfpJ3r(!#oDyQ}v=s-EK|k86WNVmYU32#_*`f4+q+6-W|0Eui#mLcGv*#%aR>n#<~K zD@Qh74uKx@R<)9G?`AVxhrTzDR5K4kW~%$cP(0>J4CZL}8Y}L-O{9;6Q1DCkX~A;f zpx|;7`TJlr#{eG2Q=#W$_5ub$u?gvdE0K44jyzIQ;C3!8NuRUAnA;(ph>qGCUuKrG zzve_6Uo|pm;*qr75f9`VfSUA*QG8rj`g`1m!CAMb{m4i6t7hwxny?RvnH~Nv%#q6p zCi_fIyH9K3SC^Sz>fQxq1Fx?5jbwwaD3^&HxlSM=SMr)ZsR&&72(igNyD&eQYd?K5 z?a%ogU-;QJTL5F$6I0fWJ!h8Lv}<*@gH-~HIp9rD_S`Aftvicm44PAJn$onE74=48 zZWP06{j7SzVP?8UW8c=%wE#R{A}RR=fjk*(X-%OUtCO8FuMw`_Q>XvhZl!cxHR#$CUhSssFPVKMAtaQ0bt}ZWIzAX{E^D zezf67>N^185#Yl)ijbo{z-dBh>xylc+31UdE__z*E^ ztg>Rv(F{$|5%&13=nxOac4V;+nbzs;l9!j)3A!1XN>az)MUK&s<~yS~F0-MfNS|Dm zLl&}5>yzOVkDY6{fEuM{^4T}N_w4WY9@$5n zUc;*|vR=f@?o)(uKzw$svLNgJ6E~AeCs4mK^yT5zbHb4q^H@Y)rq z>wL_U>y3vH8=r=CMfaNrMw+d6J?y0|c(IxXv9ocoeqiaJ^l!hqa-#qM literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_external_bin_op-members.html b/trunk/paradiseo-eo/doc/html/classeo_external_bin_op-members.html new file mode 100644 index 000000000..c145b734f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_external_bin_op-members.html @@ -0,0 +1,30 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoExternalBinOp< F, External, ExternalEO > Member List

This is the complete list of members for eoExternalBinOp< F, External, ExternalEO >, including all inherited members.

+ + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< ExternalEO >)eoOp< ExternalEO >
binop (defined in eoExternalBinOp< F, External, ExternalEO >)eoExternalBinOp< F, External, ExternalEO > [private]
className() const (defined in eoBinOp< ExternalEO >)eoBinOp< ExternalEO > [inline, virtual]
eoBinOp()eoBinOp< ExternalEO > [inline]
eoExternalBinOp(bool(*_binop)(External &, const External &)) (defined in eoExternalBinOp< F, External, ExternalEO >)eoExternalBinOp< F, External, ExternalEO > [inline]
eoOp(OpType _type)eoOp< ExternalEO > [inline]
eoOp(const eoOp &_eop)eoOp< ExternalEO > [inline]
functor_category()eoBF< ExternalEO &, const ExternalEO &, bool > [inline, static]
general enum value (defined in eoOp< ExternalEO >)eoOp< ExternalEO >
getType() const eoOp< ExternalEO > [inline]
operator()(ExternalEO &eo1, const ExternalEO &eo2)eoExternalBinOp< F, External, ExternalEO > [inline, virtual]
quadratic enum value (defined in eoOp< ExternalEO >)eoOp< ExternalEO >
unary enum value (defined in eoOp< ExternalEO >)eoOp< ExternalEO >
~eoBF()eoBF< ExternalEO &, const ExternalEO &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< ExternalEO > [inline, virtual]

Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_external_bin_op.html b/trunk/paradiseo-eo/doc/html/classeo_external_bin_op.html new file mode 100644 index 000000000..0a33a228e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_external_bin_op.html @@ -0,0 +1,54 @@ + + +EO: eoExternalBinOp< F, External, ExternalEO > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoExternalBinOp< F, External, ExternalEO > Class Template Reference

Crossover of external struct, ctor expects a function of the following signature:. +More... +

+#include <eoExternalOpFunctions.h> +

+

Inheritance diagram for eoExternalBinOp< F, External, ExternalEO >: +

+ +eoBinOp< ExternalEO > +eoOp< ExternalEO > +eoBF< ExternalEO &, const ExternalEO &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoExternalBinOp (bool(*_binop)(External &, const External &))
+bool operator() (ExternalEO &eo1, const ExternalEO &eo2)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+bool(* binop )(External &, const External &)
+

Detailed Description

+

template<class F, class External, class ExternalEO = eoExternalEO<F, External>>
+ class eoExternalBinOp< F, External, ExternalEO >

+ +Crossover of external struct, ctor expects a function of the following signature:. +

+bool func(External&, const External&);

+Where External is the user defined struct or class The function should return true when it changed something, false otherwise +

+ +

+Definition at line 128 of file eoExternalOpFunctions.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_external_bin_op.png b/trunk/paradiseo-eo/doc/html/classeo_external_bin_op.png new file mode 100644 index 0000000000000000000000000000000000000000..6944ab177f6304af44102c21d312352b86510533 GIT binary patch literal 2194 zcmbVOeK-^B8lMa)IXQjMB&T-HF7akoTl6IhlaDQ9C>_>o)W|GE7MG8dXssxFea$zE ziRFEhVfi@6yEM{_Ar{q`Z<_To)^gVCT-WRTasD{xkLS7X=e~c>^W67!|L*I$)7&vm z+qQtV004k(&SxDw002#@T5knvs&~B0On_P#xx3*U*Vfk5>e^asVd158wf6gJZEcPH z$J&_ssBzr`;|Z{n4qgTTHk&y+AaOB_x%|$EDx2*o=zMc_@X@CqxvhO&TWk3RbbLZt zzn1RSJSx(AV$FlT-R~2sFsimQBdlJokmJLziE(>>OWRFOSQRQd!|NXk6M377w|V#N z2tfE50?MUl&;ZfKrkzuX?TK6-whpcA^ChIiyBD2GmVPwXe$F`g=%DLCEeVfL!u?`J zlc}Mkg3f(^5h~ow!u$i=AoZn{*16mzSr?}^A_wFJolQkVPgm{FFZuKJh*zNBc4e&q z9-~AuUlj?LUqreXb~5Tz`6Cycs;s;S-7qrgs*0jh8OF)>|=*&As3|*5KGdGCzic5TmauFXs!4YRj;v z7Sblulcu2g?t4JspWwDn;tT~wN%g#97+7GWK@(&f5br1QGI?TCAF=+c{P83A?%H@s zg2jhWYpQNRPR~4fd>2@0OSau z9Y{nO*p+TB!U6?mn}|Er<`3UIA@=hr%2Sy`y-47Hg>AgOMU<^HwXc^y)NkrbNIFGL zh+HdOx_qA}#)e9vaFiVwF4Y7PiVQ$@Yv6{`;BL^GWG$`A>g>1xP%~*WrG@|XV zHv;C4dWV(d9&Gj}#O+08ag9d`Ipp2s2u(7)@s+Q!+s)*eFv9pFL^QYIS+iE;nUt1o z@h_&u%;3ZUsH@dtJ?=w*e&ql839G|JLsvopbbrEbx$hX@h8_+bqzt%W#zI65qJu z$L%3XdGS$J`7^d?1#a@Fk3NEVGM!tX;OxIQCTftNU~6uOowZK|VT?EWae)6J(U*ctk8g zqThb$PMf&mtwvtTfdu({4Ljd>6xhqTwoW$J0^_-%2Y73Yg%<)im1jM3qSsY)c;V{+ zExP#Z$AEB0E0Y|3o9ZTtJL!d&C8Zp+_%3-TKAhKNbGHQVvj;@L2x2DDX>@uqOnafS zph9;1dtEeWFu`WpN+QpQ=$5V|Bn-Fd>}3abn6%n%QE_C!dJUR`I&f6xO<#={kM5}{ zv$N5D=%wJF`@1)Rf~>~$FPWbI)V>bl{l8+&_DcY?VR&viaUXb{i5n@lfuMhwCG-z? zXUD{Z+1(rIytj||BIT$LaxrHj&W>;^8Klw{4CJd*)LjbsGORaaQru+mR-Gy^7O{$M zspCock+wy!HYCj*^ObnCz& zipeIMEXEH2n(lgtT!iJu=v#I6wpn}*Cwy-*zL>VJD-oqDuC2`j7Gbr|e@gu$m;dO& z|JBScEBVy%K5+Cb{Y2uMOhcJg=78C_W1Pk~!i8dhx1-QJ{M!xP{Y$^QxTKwRnbn1z zBJ+1lFUG<(i`RETe#|+}XSppZ@0h_MF>Kg{ni_7(aeidjZq}V3DX4nMhT_!Tl3_?I zY4i+gWHh_0&iVBr!nLpB4w2L!|8%Jw zs#s$YS2Gt6G$$^C%DJh~A};D6 r^wU-|HkMCSY+82#;#y^gzv)n1;yK-?uY{-v2!OLA#-ZlSrCa|3V1gud literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_external_e_o-members.html b/trunk/paradiseo-eo/doc/html/classeo_external_e_o-members.html new file mode 100644 index 000000000..db5e28854 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_external_e_o-members.html @@ -0,0 +1,47 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoExternalEO< Fit, External > Member List

This is the complete list of members for eoExternalEO< Fit, External >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
className() const EO< Fit > [inline, virtual]
EO()EO< Fit > [inline]
EO() (defined in EO< Fit >)EO< Fit > [inline]
eoExternalEO(void) (defined in eoExternalEO< Fit, External >)eoExternalEO< Fit, External > [inline]
eoExternalEO(const External &ext)eoExternalEO< Fit, External > [inline]
eoExternalEO(std::istream &is, const External &ext) (defined in eoExternalEO< Fit, External >)eoExternalEO< Fit, External > [inline]
fitness() const EO< Fit > [inline]
fitness(const Fitness &_fitness)EO< Fit > [inline]
fitness(performance_type perf) (defined in EO< Fit >)EO< Fit > [inline]
fitness(void) const (defined in EO< Fit >)EO< Fit > [inline]
Fitness typedef (defined in EO< Fit >)EO< Fit >
fitness_traits typedef (defined in EO< Fit >)EO< Fit >
invalid() const EO< Fit > [inline]
invalidate() (defined in EO< Fit >)EO< Fit > [inline]
invalidate(void) (defined in EO< Fit >)EO< Fit > [inline]
invalidate_worth(void) (defined in EO< Fit >)EO< Fit > [inline]
operator<(const EO &_eo2) const EO< Fit > [inline]
operator<(const EO< Fitness, Traits > &other) const (defined in EO< Fit >)EO< Fit > [inline]
operator>(const EO &_eo2) const (defined in EO< Fit >)EO< Fit > [inline]
operator>(const EO< Fitness, Traits > &other) const (defined in EO< Fit >)EO< Fit > [inline]
performance(performance_type perf) (defined in EO< Fit >)EO< Fit > [inline]
performance(void) const (defined in EO< Fit >)EO< Fit > [inline]
performance_type typedef (defined in EO< Fit >)EO< Fit >
printOn(std::ostream &_os) const eoExternalEO< Fit, External > [inline, virtual]
readFrom(std::istream &_is)eoExternalEO< Fit, External > [inline, virtual]
storage_type typedef (defined in EO< Fit >)EO< Fit >
worth(worth_type worth) (defined in EO< Fit >)EO< Fit > [inline]
worth(void) const (defined in EO< Fit >)EO< Fit > [inline]
worth_type typedef (defined in EO< Fit >)EO< Fit >
~EO()EO< Fit > [inline, virtual]
~eoObject()eoObject [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]

Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_external_e_o.html b/trunk/paradiseo-eo/doc/html/classeo_external_e_o.html new file mode 100644 index 000000000..3a4be86c1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_external_e_o.html @@ -0,0 +1,102 @@ + + +EO: eoExternalEO< Fit, External > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoExternalEO< Fit, External > Class Template Reference

Definition of an object that allows an external struct to be inserted in EO. +More... +

+#include <eoExternalEO.h> +

+

Inheritance diagram for eoExternalEO< Fit, External >: +

+ +EO< Fit > +eoObject +eoPersistent +eoPrintable + +List of all members. + + + + + + + + + + + + + +

Public Member Functions

+ eoExternalEO (const External &ext)
 Init externalEo with the struct itself and set fitness to zero.
+ eoExternalEO (std::istream &is, const External &ext)
+virtual void readFrom (std::istream &_is)
 Read object, the external struct needs to have an operator>> defined.
virtual void printOn (std::ostream &_os) const
 Write object.
+

Detailed Description

+

template<class Fit, class External>
+ class eoExternalEO< Fit, External >

+ +Definition of an object that allows an external struct to be inserted in EO. +

+This struct or class can be of any form, the only thing this class does is attach a fitness value to it and makes it the appropriate type (derives it from EO). +

+ +

+Definition at line 39 of file eoExternalEO.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class Fit, class External>
virtual void eoExternalEO< Fit, External >::printOn ( std::ostream &  _os  )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Write object. +

+Called printOn since it prints the object _on_ a stream.

Parameters:
+ + +
_os A std::ostream.
+
+ +

+Reimplemented from EO< Fit >. +

+Definition at line 69 of file eoExternalEO.h. +

+References EO< F >::printOn().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_external_e_o.png b/trunk/paradiseo-eo/doc/html/classeo_external_e_o.png new file mode 100644 index 0000000000000000000000000000000000000000..fa87cb20be344cf476e501e32c196c3580a93ded GIT binary patch literal 1161 zcmeAS@N?(olHy`uVBq!ia0y~yV5|VL53n!;$v?5FmOx4(z$e7@|Ns9$=Kuc(=Fd-< z0AzvjfddDs5B+}vEaktG3V`_z`WZAJZuTvtiN(zvia!; zo`)?C)Xr!*j%eo zC|@ZA=2Ph!%jdPve>CNN@Q(fY_r>Gs`5&FH)ZEPtvw3Hh*m1W_^sw~34{hc( z{68kz|FRIjz*fL?i^1*Q{98if7mL?`CD#dqwd^_i+jIWwB+B?`Y7;w z&Lg3#&raR-c0nzf+~p>K(cMZnyWTWtppEKJ~KMZ*g+} zu=T6qQzq?=U)+`I7e}6UaY|*?q%fh7Yjrp2~-b<`}olV6H8YA!cUd$%v|;2XaEEk)*EC+w|b{8bSzCGOe%KUewc zpM&#ELTe&_=ER2oYuG1Wvn}k8hPMCivkOe`zxmuEpSnHq2r!B4dB}U8vF=5`o!`>! z{B!+MGit)`XUso)qT*wi+eu&=`3+1XYbD~e+pc##+?s@yc}e=-=~S`f+~*Q1)=KiM zH$6PJ!u@yiZJT+1yGvgm*sW);{Z6A^`Ss`gqxtH~kITkB-4|oJ{ruIV%a{6YUS`^N z{Ibn?JKG5#)&*UPeSW%Fc3r)cLYnL|w>`5r@NF`>dc?+6KyH_QMf``er_T4SE8aZ& zwZZ4N6*_tT$A3=yu=2$6FHOrrJ_kpC&O7&`L_2lbm+uc2E9yrcdfdHW_V=@=f>-8* z-@ABPucm6@lKq)am;2uIX}Le8_dlQg`spTD%b%aR9{I61{B+vU=XamYo>l(i-n!J{ z`m@vTs!ij5l(~K3rq0>t%I5p;x3xWAJ^dBu`V*;-OTPU)J^#Ayy}kRE#P9iZ;ghjM mTsGU`?6V5}?_VzNxA(d(m>0Aq^f<8GVDNPHb6Mw<&;$TaYC+8a literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_external_eval_func-members.html b/trunk/paradiseo-eo/doc/html/classeo_external_eval_func-members.html new file mode 100644 index 000000000..f34316446 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_external_eval_func-members.html @@ -0,0 +1,22 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoExternalEvalFunc< F, External, ExternalEO > Member List

This is the complete list of members for eoExternalEvalFunc< F, External, ExternalEO >, including all inherited members.

+ + + + + + + + +
eoExternalEvalFunc(F(*_eval)(const External &)) (defined in eoExternalEvalFunc< F, External, ExternalEO >)eoExternalEvalFunc< F, External, ExternalEO > [inline]
EOFitT typedef (defined in eoEvalFunc< ExternalEO >)eoEvalFunc< ExternalEO >
EOType typedef (defined in eoEvalFunc< ExternalEO >)eoEvalFunc< ExternalEO >
eval (defined in eoExternalEvalFunc< F, External, ExternalEO >)eoExternalEvalFunc< F, External, ExternalEO > [private]
functor_category()eoUF< ExternalEO &, void > [inline, static]
operator()(ExternalEO &eo)eoExternalEvalFunc< F, External, ExternalEO > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< ExternalEO &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_external_eval_func.html b/trunk/paradiseo-eo/doc/html/classeo_external_eval_func.html new file mode 100644 index 000000000..0e90a4aca --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_external_eval_func.html @@ -0,0 +1,53 @@ + + +EO: eoExternalEvalFunc< F, External, ExternalEO > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoExternalEvalFunc< F, External, ExternalEO > Class Template Reference

Evaluation of external struct, ctor expects a function of the following signature:. +More... +

+#include <eoExternalOpFunctions.h> +

+

Inheritance diagram for eoExternalEvalFunc< F, External, ExternalEO >: +

+ +eoEvalFunc< ExternalEO > +eoUF< ExternalEO &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoExternalEvalFunc (F(*_eval)(const External &))
+void operator() (ExternalEO &eo)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+F(* eval )(const External &)
+

Detailed Description

+

template<class F, class External, class ExternalEO = eoExternalEO<F, External>>
+ class eoExternalEvalFunc< F, External, ExternalEO >

+ +Evaluation of external struct, ctor expects a function of the following signature:. +

+Fit func(External&);

+Where External is the user defined struct or class and Fit the fitness type +

+ +

+Definition at line 73 of file eoExternalOpFunctions.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_external_eval_func.png b/trunk/paradiseo-eo/doc/html/classeo_external_eval_func.png new file mode 100644 index 0000000000000000000000000000000000000000..22e189886d8d15b3230dd3a9a041e80b7e35dee1 GIT binary patch literal 1880 zcmb7Fc~sKb9;fA$+2YHzMI~pnCeqRtFLI>XwQ|LCDC^-m>mt#+ZpAwnvC@&n`_+x!^L`?B; zWZ`tg18q(7I%`B7C0W`2rUj&gMhjCBYVZSBW+T7exiMqVIkYxg=6bVKDfM($g3FN$ zWx5*!VdL2@*|fo;4$a-hiGIhiq!Tk?9L-3`Z%$qM)-U!VGKXhcs%W2_^oTR&M+Q2L z9$e^EygDE)zqtj*B2Ep+R7r>9d;#3xl(5+Lb4~W(aVd z@VW8EVf|>W1qYxdK?iUHc$my{+;Qlp0s@(lmkP!aVEa`x)iS{M>ci*yR=LkcBf{&m zR~uk4EhH66zqeHiM8%}h!*G1fb zC#v>gbb%*Dm7ZyUcPgDM`kLOBEBN`LFgWOgkAZ&9FsexdFkn#_wd$n89rrm{cz%?qoMAuj{F?cWmI7hfs zs+}zCmp%@R?->9N@I(~}2Rb~dkHn{Zs-2ip^XA>(JrehLQnvppS^Xg7j(LsBagOBB zIqoUE5X<_LDMuc2PT@EApoN(Y(w$#YIFjqt=G*Y(CmibS1~U(#(-vKt!i4wdtc0Lr z#b+%MM~&OI&a&@I{rnqhYM|B0TJW7?#wC8sKkcfv*rGRUbZW3NYzhDl?pM`RA`GbfAQKR>UmR2yz<5Hk#w{BySyqo%piyZSG4X3LGnRbjff z3TQuF-num5PVIu=jZ%_ZQT41zlQ}YIjeh44VRR0Eq=vxB8ESQtkf{ z_3xobJR(4b;w07)P2(xTAGe5kt$?+C@2%`bX7yl6UIY5Wtp!m7_$pSD>hG0O7?WDm zZno5aqq%}+RJLTEbA5BAY$Ar+W|(abxxFQ75#B-%#Fz`7zubo1yC~XZZ{GNil=$F_ueISqeUvYodN8e`5@# zwpO8>$TFG=p%vplKJP>BI0FZ)@jTg|6O-~A@h6?ldU zo!$sF+?+_JRRx(QF|PQcpFS%hk9=@eogk`sKObd&qDy8&kM6p6iU*UtOPhmaiI)}2 zNH2a2OcaSL`+0))M%`+EusHl(WxJK>+l|ZZzD$_fYL>BmgYkk}xWQ_S2UU0mFbg(m zb@qzdhVTs^^yx{39q@iBv~7zq5U|#RFyE&r3Q^SlMcTI`xgq7Spqqt$gBJ7d7>1Ts z3onDauNZO?c#+P)@haTM#xh*PS1l&`Fo*g8Mktia2;GzWrXnBjsBzV?tSQIsad~9O zU8!1BM-yq1&25DVm=@a)aV70QL literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_external_init-members.html b/trunk/paradiseo-eo/doc/html/classeo_external_init-members.html new file mode 100644 index 000000000..a0935bdac --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_external_init-members.html @@ -0,0 +1,21 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoExternalInit< F, External, ExternalEO > Member List

This is the complete list of members for eoExternalInit< F, External, ExternalEO >, including all inherited members.

+ + + + + + + +
className(void) const eoInit< ExternalEO > [inline, virtual]
eoExternalInit(External(*_init)(void)) (defined in eoExternalInit< F, External, ExternalEO >)eoExternalInit< F, External, ExternalEO > [inline]
functor_category()eoUF< ExternalEO &, void > [inline, static]
init (defined in eoExternalInit< F, External, ExternalEO >)eoExternalInit< F, External, ExternalEO > [private]
operator()(ExternalEO &_eo)eoExternalInit< F, External, ExternalEO > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< ExternalEO &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_external_init.html b/trunk/paradiseo-eo/doc/html/classeo_external_init.html new file mode 100644 index 000000000..b4fe4cec3 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_external_init.html @@ -0,0 +1,53 @@ + + +EO: eoExternalInit< F, External, ExternalEO > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoExternalInit< F, External, ExternalEO > Class Template Reference

Initialization of external struct, ctor expects a function of the following signature:. +More... +

+#include <eoExternalOpFunctions.h> +

+

Inheritance diagram for eoExternalInit< F, External, ExternalEO >: +

+ +eoInit< ExternalEO > +eoUF< ExternalEO &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoExternalInit (External(*_init)(void))
+void operator() (ExternalEO &_eo)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+External(* init )(void)
+

Detailed Description

+

template<class F, class External, class ExternalEO = eoExternalEO<F, External>>
+ class eoExternalInit< F, External, ExternalEO >

+ +Initialization of external struct, ctor expects a function of the following signature:. +

+External func();

+Where External is the user defined struct or class +

+ +

+Definition at line 45 of file eoExternalOpFunctions.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_external_init.png b/trunk/paradiseo-eo/doc/html/classeo_external_init.png new file mode 100644 index 0000000000000000000000000000000000000000..b989ef2aa84407633424ad53878980c1b9714fa6 GIT binary patch literal 1527 zcmai!X;cze6vr{Lj*{Xyo>4)iY_zn}G|Oxf#f?l8D@!ZWOf7eF%R)e{abIv8cTz%B z%0?MeQ&54lvMF3}%W&61aid0(0+FH4e3*0QL+AY8yZ?LMy&rz(y>~O*-Ht7})32Q7D34@a3yCbu#fi%7hZCwJc#i^WRll)aOu3bAM0 z&H`+Cqt^fc#T;h`gvYIWE9Fn~$wzmjl4@%E(zE({8LW|2P>)eO@o%xe^OJ_;DiS{! zQDt*3SRYCT|8>&ySQ&p)(<5yQB2G5(ObF(*rIp;_Ksz{4DJ8S;G5UR0+y+$WuG@AH z3WS8Cz+pTRvIN{)BcMbYVH?Enhq{C+0!+oFL)+21`L}Uhs{InJHLaQ7ypRH96Dyq; z<$x};jbYfq`eSww5`IQN!=brDg1PFZhxj)a}<9!+#No_D}oBq6ae0tZV0qtB7HbZ)+;t*_o5Xm~We!%)V{91Bk?JN$R6#KaV z?l=^6W3DKP4Gv$9ir^a5llnflT}@0lg*xmvep))Ra8_diB-W4^tr0R*utqtnLCZ^6 z!QjkMvQ3k~uaM!jNBme2JX`Q31@4y?G6$Owo$C?pMmS~7m!Tw+cWvC)V0q?Kr!T*D z(_8{ZPxP)SsAY!YUTyRm34n=Fy!J@k|3r;zH#fjNRDi~G{2&LlBHEC5Me z$_qBr0)$SHLI^)Du@dXb1Xm<_RjQ`@cyp8SZPU-6>-L{YWXgVOr#AuV{5Vf*a&h4U zV5O#JysdC{_G{g^0w*i$m!0USsO=7>CaXyc@}5=~mx9d)@G4!kLeA3vd+l_~u| zwZMp6Rtct-WJ@&JQXIoc2n*O-hvo;3w6lK1lvyl=Xlo8qoqU#lxt7er!-^T?6Q=q-Caf4ew3C8>FqRal z;ljt}Xd~^8Ka9m*DIdEJLMd!X3&0*w)53Lp{iq*)4K*V6f@oqvH`Ju=GI-+R-vG{bG*6e`TKi{7ukaR!7lUl zeWg=o(u=$nP~3#JzYQ(dfOc{;6-N^^)SN1v>Zh6v6_zE|V2L5P@!|!Y;>ChLu_S5; zoCpLC#PrOw@zul^#Qm|WB1xpxbui~J-}hEWC@pj#u{hi3ypySc{O?7hAL1Klpm5G6 Z@LKwSYM@E+J^7RdI6JyI)Z1OT^ACbGB*Opz literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_external_mon_op-members.html b/trunk/paradiseo-eo/doc/html/classeo_external_mon_op-members.html new file mode 100644 index 000000000..9e8656f37 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_external_mon_op-members.html @@ -0,0 +1,30 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoExternalMonOp< F, External, ExternalEO > Member List

This is the complete list of members for eoExternalMonOp< F, External, ExternalEO >, including all inherited members.

+ + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< ExternalEO >)eoOp< ExternalEO >
className() const (defined in eoMonOp< ExternalEO >)eoMonOp< ExternalEO > [inline, virtual]
eoExternalMonOp(bool(*_mutate)(External &)) (defined in eoExternalMonOp< F, External, ExternalEO >)eoExternalMonOp< F, External, ExternalEO > [inline]
eoMonOp()eoMonOp< ExternalEO > [inline]
eoOp(OpType _type)eoOp< ExternalEO > [inline]
eoOp(const eoOp &_eop)eoOp< ExternalEO > [inline]
functor_category()eoUF< ExternalEO &, bool > [inline, static]
general enum value (defined in eoOp< ExternalEO >)eoOp< ExternalEO >
getType() const eoOp< ExternalEO > [inline]
mutate (defined in eoExternalMonOp< F, External, ExternalEO >)eoExternalMonOp< F, External, ExternalEO > [private]
operator()(ExternalEO &eo)eoExternalMonOp< F, External, ExternalEO > [inline, virtual]
quadratic enum value (defined in eoOp< ExternalEO >)eoOp< ExternalEO >
unary enum value (defined in eoOp< ExternalEO >)eoOp< ExternalEO >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< ExternalEO > [inline, virtual]
~eoUF()eoUF< ExternalEO &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_external_mon_op.html b/trunk/paradiseo-eo/doc/html/classeo_external_mon_op.html new file mode 100644 index 000000000..04aeffb6d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_external_mon_op.html @@ -0,0 +1,54 @@ + + +EO: eoExternalMonOp< F, External, ExternalEO > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoExternalMonOp< F, External, ExternalEO > Class Template Reference

Mutation of external struct, ctor expects a function of the following signature:. +More... +

+#include <eoExternalOpFunctions.h> +

+

Inheritance diagram for eoExternalMonOp< F, External, ExternalEO >: +

+ +eoMonOp< ExternalEO > +eoOp< ExternalEO > +eoUF< ExternalEO &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoExternalMonOp (bool(*_mutate)(External &))
+bool operator() (ExternalEO &eo)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+bool(* mutate )(External &)
+

Detailed Description

+

template<class F, class External, class ExternalEO = eoExternalEO<F, External>>
+ class eoExternalMonOp< F, External, ExternalEO >

+ +Mutation of external struct, ctor expects a function of the following signature:. +

+bool func(External&);

+Where External is the user defined struct or class. The function should return true when it changed something, false otherwise +

+ +

+Definition at line 102 of file eoExternalOpFunctions.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_external_mon_op.png b/trunk/paradiseo-eo/doc/html/classeo_external_mon_op.png new file mode 100644 index 0000000000000000000000000000000000000000..c9e8a076180b969e7a5a8d1f9dfb3b5c4a3cac72 GIT binary patch literal 2082 zcma)7X;jkb8pmvEDsvB)%8oYLRTFcpaLcjWGRblwR7NJ3)WRgi70k+O?pxYGgIlgC zCa9w++CR-KO-FJeGffyp+)ywBcjZ#|dYdz+5A)%DpXK*H?|II%CSG)~-Md?LHwXmU zYj@Vl2?W~qRLr+*mlWTM+)B2XC|`uRSc^m=F)I?a22{%=%-!gRg&ue5$>p}+;2 zqRvfsF9ie&p3;<6#vPhZ-)E#+bLMcYc0P=^&@8nWn zju_OFxgJT*1pey!UH`F(q{M8cOssYtxM;8+$vTMTE=L3+0gejNpeyiGZ3i1Xoekp( z-M9%tlUw_>YnS7CW?eBxW7ud)_`)?pM#Sa~(qO_*DCBGCYH^N}4W#g1>GJoY6CwJv z3Wjd(Cd?l9e%ee6P?XM%3Mx1;a*#Ul(GYN!9n*_WMr{(@iSw9I^XR_h_Vw>GdFL>w z15SRklw0$2xWse)g-{AmP?yX6moHg(4h(U-=gPJwc-cp_X`nH5W{H~V%*ZNmo(gsK z;oIozODlroSNoO>fl>1P<7U0O#Floa? zYnF!TPB;A31IW1p1Z{|PPWrT6F7ib$lmmAgU_L~INoT%|mUQIdi6N=AH0(uo1Z$1V zS8YFhGY^&TV-*rG@c;9dKmkc=H zaq0NpsuSw}01$dK8L84!df5Lx*%_sQPIFnVT>X_~iLJBPC80Jr-)*h!p>hO5vCzMW%ry!jCn-egyY z@l7)9(8QFL**tOJg;WzP0rX04*^x}y`k@|Tg+nf$2je$3biAt@@0lam7e043k4$5HsoKK1jzIv&-YEjMVSgG<+ zDiAc;vc?RZ{4+n(GdOr8?QMrm)B~A)J zG%PC7rGU;qn?qdgpx|2py;{1&Lp(LyQDhKP4h>XJE|qwq<)cg5F-W$%@|ln_D*dDB z#PT<+A#tUA!N7x!4+gh{|GrSYj6Un2Pf-DxF^<+N=@2u&hpfQ8$ipiD(+~7b< zzBw(H%urRJJ+(bcU)SI^3@N8Z2HhB3`tjBVVwj`qO1;BWojN5cAjgRM9K}trl|Byd z9m_C0xoQv7rcgYH7XtUyq(}gysL}owk_8pgP+KmZ&Htp~{ub@eBmJw{1$EsIdS~KC zc_59A5s4|#SFC1cF0nPY+bsUswF=7oN4cjPW$iNy|ISNQCE-<1`ZXVvQHYWqee-ZE zr`6LubTF-M(R@Fg&WDPT)4PtyU&t`*JQV)om~6NeP{2C0_xX#A03r@gpFQSu$RULt zdcn5aW4M~R=Op{r5*3-K*}G0gQcD|%=}8F7$^$l~gO5k4^|UL*!}-jz5i+rnryz*q zWQ-dzuK^wm-9i%-;z~x<;^Id|TBsX8%kd_b&YVFAQBq#oSCF!Du^p*K@8d>KQ~fJz z>WQq2@-XW~UYa{ZS}=fHLDGyuG&Iap!v%qPJ>0P#YXF~YdFoohQupuSZw=b+K9s+= zhJSB7E8ZfHTo32~O+{gmlk*d3%#iW&BaE#2yNK7l>bhBer}%houB40w1B+MI&SQ1S zuLm&FhnF@vmMEzk)+z#?`S`B{U2jXij9ReNmsPqI_k~g%CVJ&2Cs6K$NTREtP40!^ S>mcz$2iaLWSW(Vgj` literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_external_quad_op-members.html b/trunk/paradiseo-eo/doc/html/classeo_external_quad_op-members.html new file mode 100644 index 000000000..5411bb881 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_external_quad_op-members.html @@ -0,0 +1,30 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoExternalQuadOp< F, External, ExternalEO > Member List

This is the complete list of members for eoExternalQuadOp< F, External, ExternalEO >, including all inherited members.

+ + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< ExternalEO >)eoOp< ExternalEO >
className() const (defined in eoQuadOp< ExternalEO >)eoQuadOp< ExternalEO > [inline, virtual]
eoExternalQuadOp(bool(*_quadop)(External &, External &)) (defined in eoExternalQuadOp< F, External, ExternalEO >)eoExternalQuadOp< F, External, ExternalEO > [inline]
eoOp(OpType _type)eoOp< ExternalEO > [inline]
eoOp(const eoOp &_eop)eoOp< ExternalEO > [inline]
eoQuadOp()eoQuadOp< ExternalEO > [inline]
functor_category()eoBF< ExternalEO &, ExternalEO &, bool > [inline, static]
general enum value (defined in eoOp< ExternalEO >)eoOp< ExternalEO >
getType() const eoOp< ExternalEO > [inline]
operator()(ExternalEO &eo1, ExternalEO &eo2)eoExternalQuadOp< F, External, ExternalEO > [inline, virtual]
quadop (defined in eoExternalQuadOp< F, External, ExternalEO >)eoExternalQuadOp< F, External, ExternalEO > [private]
quadratic enum value (defined in eoOp< ExternalEO >)eoOp< ExternalEO >
unary enum value (defined in eoOp< ExternalEO >)eoOp< ExternalEO >
~eoBF()eoBF< ExternalEO &, ExternalEO &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< ExternalEO > [inline, virtual]

Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_external_quad_op.html b/trunk/paradiseo-eo/doc/html/classeo_external_quad_op.html new file mode 100644 index 000000000..0082ad133 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_external_quad_op.html @@ -0,0 +1,54 @@ + + +EO: eoExternalQuadOp< F, External, ExternalEO > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoExternalQuadOp< F, External, ExternalEO > Class Template Reference

Crossover of external struct, ctor expects a function of the following signature:. +More... +

+#include <eoExternalOpFunctions.h> +

+

Inheritance diagram for eoExternalQuadOp< F, External, ExternalEO >: +

+ +eoQuadOp< ExternalEO > +eoOp< ExternalEO > +eoBF< ExternalEO &, ExternalEO &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoExternalQuadOp (bool(*_quadop)(External &, External &))
+bool operator() (ExternalEO &eo1, ExternalEO &eo2)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+bool(* quadop )(External &, External &)
+

Detailed Description

+

template<class F, class External, class ExternalEO = eoExternalEO<F, External>>
+ class eoExternalQuadOp< F, External, ExternalEO >

+ +Crossover of external struct, ctor expects a function of the following signature:. +

+bool func(External&, External&);

+Where External is the user defined struct or class The function should return true when it changed something, false otherwise +

+ +

+Definition at line 154 of file eoExternalOpFunctions.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_external_quad_op.png b/trunk/paradiseo-eo/doc/html/classeo_external_quad_op.png new file mode 100644 index 0000000000000000000000000000000000000000..5e6a8b31e68f89640e1709d88be36f9e6c358b3a GIT binary patch literal 2291 zcmb7`dpy+J7Qn~hT&5EeH*dF&k`g6;%H!yGjpxXi$z!6riNQX1Gd+XEreD3+2&;4WXz4qE`?Y;K?eAoKyG&fg! z*==guAP|VGql2wG1R`lHmYby{#r^Il=7Zuv#mxm}x3#q;7Pq#VDU@?J#nPwN+}s@3 zvNb85N<_Q6A|XEtxPcIeOq!#u6)J{2PiE%vk8g)DDh4A>yh*Xw3zWfA^EAGwGw*z- zT!Pe3I_}H9uAT{siTBdusWx*_A-yL?N^}b^$sNJ2Z&Z<<>vjn%NKg#@8vv7_R{J9X zom(Yj$+oxdd2$su<=|nIygg&p^Z;1VE@V6vcAPw#cRy$FA)|h@skx1b(|wML zY{J!h03xxE-0Ji**E@ouqxs!N6$64u{xlpHcJDq7Wwf;1xt<2&B=z$(?+SS)b=;k5 zezg67P^*w_4UZYh6m}|&wM`t48hI6d;bMv5c6|S+K;vI)H-p+FjzrJ77mB^9C3~HY&)RuEo3dD55=b$QdDzcptOc zlkx^!LOOS+6OwByxFx=t>N5I`HWRfSvNjW%YE0wY9AgD|c5j`>qMUv>nP0kdU{Q`> zkK|H`l+X$~MJC+|)ogBD&{y#ROUNOzTIA;AdAzfd9^lwyvR+MmT_PBeO~xKRFPe&e zAbcY#4z$l^Nnki%I4Oqdr%+8d8eB+jxk0%2nSGgVY>+~e zA4;nuOgdnd;kLthl<{$z4L9M70fF%CAS{>gs6XV3jf#5VFA4$vVbLRhy&#w#k_xJv zk>}}+^G&XOqE{T1TiGru;yVuY+dl^TNu3S_g0_y8!?)WFtEg`^^ulu8%65FVE``HS zUGjD^I@}FG(zc2N}&CaRY3@?{oh;Z>;xv;JoaSN7+(N82R}o>oWvJpfm( zBfST@k{!RzYSvob{Ur^Rv!6a6gKeHE);JSO3PH7MHgvt3FHer(4D{iK20XcLt)a}_ z>rpzeAI=QK(<_NGvAx_9iVrCPE~d9AIETfmZe^_cT-$;JXnn3_;f=FG~i^g zCxS-qTN(?nZ;V~_3*tzo+W{|CbVp#5KutFAS*jU*a-C1sHq z5veXNr+)$DCr-i0_whC(lW(O8J3TiSEWdW^KD}>nw!SST?Yakp<#(ozSc){m~cu%1Z>Az;NF!u@IQAb}+LLmXI4@S)XLgdFzfP zK5llGh-q5np$=E-z>#M>l+mG?`roi9G{r0G2s0}gH* zhc1obB%X+<`Z}dpn+9y1p#5)pCC)0K#MhWo*V|H)z|fbj-#Cg+P-{A;Ui{~I_$TT4 zzttglHftDambLj7V)BM1_uAsCHw`#N2+NrD_YHecH2idP)3JmIDx1zzd~bt8$Nb%B zBXvFJJOL4c)kUnI_569|MY7!#`jDG;v~W}%Yv8~4)xtNC*M9n&`O%%E4a>lqEa^Et z1Xcqf^!s^y+Ih)T-r!KmyKCS_>VkWf*|Twx@3=6b9Pc_~3;#GE%16UHE2YzTd52?T zqj=>Nr?+cT8Cklak?$5JEyoS+fMIX4vo$Dl=ch_)I~WDO;Vdb%D?Bb427f}Hf0k#a zu%~)P-&HlEV3I@{=lzy^v|u25z^sK4z4!QCUQf4awX%T@eMFYilQj#S|6Wx|Z`7h> zlmHT;gw<`;iX;3MYukkiQQzkB@;#kE_x+H}s`rNPwPYGX~lRPD`j;cTCy_=f^ + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoF< R > Member List

This is the complete list of members for eoF< R >, including all inherited members.

+ + + + + +
functor_category()eoF< R > [inline, static]
operator()()=0eoF< R > [pure virtual]
result_type typedefeoF< R >
~eoF()eoF< R > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_f.html b/trunk/paradiseo-eo/doc/html/classeo_f.html new file mode 100644 index 000000000..ac1e63212 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_f.html @@ -0,0 +1,57 @@ + + +EO: eoF< R > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoF< R > Class Template Reference

Basic Function. +More... +

+#include <eoFunctor.h> +

+

Inheritance diagram for eoF< R >: +

+ +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + +

Public Types

+typedef R result_type
 the return type - probably useless ....

Public Member Functions

+virtual ~eoF ()
 virtual dtor here so there is no need to define it in derived classes
+virtual R operator() ()=0
 The pure virtual function that needs to be implemented by the subclass.

Static Public Member Functions

+eoFunctorBase::procedure_tag functor_category ()
 tag to identify a procedure in compile time function selection functor_category
+

Detailed Description

+

template<class R>
+ class eoF< R >

+ +Basic Function. +

+Derive from this class when defining any procedure. It defines a result_type that can be used to determine the return type Argument and result types can be any type including void for result_type +

+ +

+Definition at line 68 of file eoFunctor.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_f.png b/trunk/paradiseo-eo/doc/html/classeo_f.png new file mode 100644 index 0000000000000000000000000000000000000000..9c1e6dca0aece0ee8392de665d0f2fc843095651 GIT binary patch literal 355 zcmeAS@N?(olHy`uVBq!ia0vp^NkAOH!VDw@Ecea^QW60^A+G=b{|7Sv|35H)e!>JG z3ycpOI8c4){}UjWu_VYZn8D%MjWi(Vr>Bc!NX4ADQ_k`pR^VxUIH_1p+QB?S{FUbK z{(u|~QqlwCiZdA{Fe#_VfnOkcbyayrE9w<9L-w~Oo<(a>WjU3%UgZ0YZ3 z)(lj*Y3!(NH<{B;?2cE%G`qbvD_>s=+}6dQGN|&U#BC?%h$7X yp+&B + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFDCFileSnapshot< EOT > Member List

This is the complete list of members for eoFDCFileSnapshot< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + +
add(const eoParam &_param)eoFDCFileSnapshot< EOT > [inline, virtual]
baseFileName() (defined in eoFileSnapshot)eoFileSnapshot [inline, virtual]
className(void) const (defined in eoMonitor)eoMonitor [inline, virtual]
eoFDCFileSnapshot(eoFDCStat< EOT > &_FDCstat, std::string _dirname="tmpFDC", unsigned _frequency=1, std::string _filename="FDC", std::string _delim=" ")eoFDCFileSnapshot< EOT > [inline]
eoFileSnapshot(std::string _dirname, unsigned _frequency=1, std::string _filename="gen", std::string _delim=" ", unsigned _counter=0, bool _rmFiles=true) (defined in eoFileSnapshot)eoFileSnapshot [inline]
FDCstat (defined in eoFDCFileSnapshot< EOT >)eoFDCFileSnapshot< EOT > [private]
functor_category()eoF< eoMonitor & > [inline, static]
getCounter()eoFileSnapshot [inline]
getDirName() (defined in eoFileSnapshot)eoFileSnapshot [inline, virtual]
getFileName()eoFileSnapshot [inline]
hasChanged()eoFileSnapshot [inline, virtual]
iterator typedef (defined in eoMonitor)eoMonitor [protected]
lastCall() (defined in eoMonitor)eoMonitor [inline, virtual]
operator()(void)eoFileSnapshot [inline, virtual]
operator()(std::ostream &_os)eoFileSnapshot [inline]
result_type typedefeoF< eoMonitor & >
setCurrentFileName()eoFileSnapshot [inline]
vDouble typedef (defined in eoFileSnapshot)eoFileSnapshot
vDoubleParam typedef (defined in eoFileSnapshot)eoFileSnapshot
vec (defined in eoMonitor)eoMonitor [protected]
~eoF()eoF< eoMonitor & > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_f_d_c_file_snapshot.html b/trunk/paradiseo-eo/doc/html/classeo_f_d_c_file_snapshot.html new file mode 100644 index 000000000..fdb727744 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_f_d_c_file_snapshot.html @@ -0,0 +1,117 @@ + + +EO: eoFDCFileSnapshot< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFDCFileSnapshot< EOT > Class Template Reference

Specific class for FDCStat monitoring: As I failed to have FDC stat as an eoStat, this is the trick to put the 2 eoParam<std::vector<double> > into a monitor This class does nothing else. +More... +

+#include <eoFDCStat.h> +

+

Inheritance diagram for eoFDCFileSnapshot< EOT >: +

+ +eoFileSnapshot +eoMonitor +eoF< eoMonitor & > +eoFunctorBase + +List of all members. + + + + + + + + + + + +

Public Member Functions

 eoFDCFileSnapshot (eoFDCStat< EOT > &_FDCstat, std::string _dirname="tmpFDC", unsigned _frequency=1, std::string _filename="FDC", std::string _delim=" ")
 Ctor: in addition to the parameters of the ctor of an eoFileSnapshot we need here an eoFDCStat.
+virtual void add (const eoParam &_param)
 just to be sure the add method is not called further

Private Attributes

+eoFDCStat< EOT > & FDCstat
+

Detailed Description

+

template<class EOT>
+ class eoFDCFileSnapshot< EOT >

+ +Specific class for FDCStat monitoring: As I failed to have FDC stat as an eoStat, this is the trick to put the 2 eoParam<std::vector<double> > into a monitor This class does nothing else. +

+ +

+Definition at line 111 of file eoFDCStat.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
eoFDCFileSnapshot< EOT >::eoFDCFileSnapshot ( eoFDCStat< EOT > &  _FDCstat,
std::string  _dirname = "tmpFDC",
unsigned  _frequency = 1,
std::string  _filename = "FDC",
std::string  _delim = " "
)  [inline]
+
+ + + + + +
+   + + +

+Ctor: in addition to the parameters of the ctor of an eoFileSnapshot we need here an eoFDCStat. +

+The 2 std::vectors (distances to optimum and fitnesses) are added to the monitor so they can be processed later to a file - and eventually by gnuplot +

+Definition at line 119 of file eoFDCStat.h. +

+References eoFileSnapshot::add().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_f_d_c_file_snapshot.png b/trunk/paradiseo-eo/doc/html/classeo_f_d_c_file_snapshot.png new file mode 100644 index 0000000000000000000000000000000000000000..f5e87a580be851e57564825c2632ec33d380586d GIT binary patch literal 927 zcmV;Q17Q4#P)a_!s44RJaWt_v@wI1&cpuoG_ViO(snz&vLz#jewXi=+9JcOrkp zB`W`fa#Mce=y`5fTEx5IN**ZYVg0@K#Osf_a&)`jUsrxp=x)oskl&&nJn8Z{Tc`NSi>H%DE!37swaKQyvY}9@A-F{zy zd%$&DeZ~1g^x{JPa;J0+R}F;a)SBkXwaqPblGT84V<+@jq%_am&nJZ@`6qHk5n2dH@$(aKQx^TyVh^8+BiO zx8E1w_H%dDvuC+`>e*%P1NH1G_mO(`W!#N=cA0yuo;?xop?dZN_fS2%%zdPuUFKdj zaKU{Ichq%$)P2btaG{?K<=(Cyzy%jvaKQx^TyVuk-B;i3_XW5eTq2qu650wyylT#I z^%kK0RTUcXH|mJ!yE^(|LxQwH)Opz07ebqS4}Vnj0VU%exa*-SIPx zuW*UVc=ahlm8B?cI=#l_tZ}70EPE@9t(({Lu;jPo&LZV`ZdDIH?UZ%oay{fdooBd5 z_I0}Qy}3OG?r83)>-?zuk~iQ&KO4%uT|IycF1X-=3of|eiqROG?2wOUzB8r$N=sXz%Z=}Kdb&Hl#LT&lQ41y@c47FS#KOSIfGHs`mDmu9X^wBx1h zWheEDc}QHv)_I^g-f2G%`n_p*8n)fUyXDe058HY$88LHHey1wGMLjI}E$d;f-=!W5 zX@1GtR1fh*DcYre>pJVUZs#A)?KW^na|d1L{{h24m&68_V0Zuk002ovPDHLkV1ig# B(dhsH literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_f_d_c_stat-members.html b/trunk/paradiseo-eo/doc/html/classeo_f_d_c_stat-members.html new file mode 100644 index 000000000..6de541260 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_f_d_c_stat-members.html @@ -0,0 +1,47 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFDCStat< EOT > Member List

This is the complete list of members for eoFDCStat< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
boolOpt (defined in eoFDCStat< EOT >)eoFDCStat< EOT > [private]
className(void) const (defined in eoStat< EOT, double >)eoStat< EOT, double > [inline, virtual]
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
dist (defined in eoFDCStat< EOT >)eoFDCStat< EOT > [private]
distToBest (defined in eoFDCStat< EOT >)eoFDCStat< EOT > [private]
eoFDCStat(eoDistance< EOT > &_dist, std::string _description="FDC")eoFDCStat< EOT > [inline]
eoFDCStat(eoDistance< EOT > &_dist, EOT &_theBest, std::string _description="FDC")eoFDCStat< EOT > [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoStat(double_value, std::string _description) (defined in eoStat< EOT, double >)eoStat< EOT, double > [inline]
eoValueParam(void)eoValueParam< double > [inline]
eoValueParam(double_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< double > [inline]
fitnesses (defined in eoFDCStat< EOT >)eoFDCStat< EOT > [private]
functor_category()eoUF< const eoPop< EOT > &, void > [inline, static]
getValue(void) const eoValueParam< double > [inline, virtual]
lastCall(const eoPop< EOT > &) (defined in eoStatBase< EOT >)eoStatBase< EOT > [inline, virtual]
longName() const eoParam [inline]
operator()(const eoPop< EOT > &_pop)eoFDCStat< EOT > [inline, virtual]
repValue (defined in eoValueParam< double >)eoValueParam< double > [protected]
required() const eoParam [inline]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< double > [inline, virtual]
shortName() const eoParam [inline]
theBest (defined in eoFDCStat< EOT >)eoFDCStat< EOT > [private]
theDist()eoFDCStat< EOT > [inline]
theFit() (defined in eoFDCStat< EOT >)eoFDCStat< EOT > [inline]
value()eoValueParam< double > [inline]
value() const eoValueParam< double > [inline]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_f_d_c_stat.html b/trunk/paradiseo-eo/doc/html/classeo_f_d_c_stat.html new file mode 100644 index 000000000..6a55fa7ce --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_f_d_c_stat.html @@ -0,0 +1,81 @@ + + +EO: eoFDCStat< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFDCStat< EOT > Class Template Reference

The FDC computation - stores the values into eoValueParam<EOT,double> so they can be snapshot by some eoGnuplotSnapshot ... +More... +

+#include <eoFDCStat.h> +

+

Inheritance diagram for eoFDCStat< EOT >: +

+ +eoStat< EOT, double > +eoValueParam< double > +eoStatBase< EOT > +eoParam +eoUF< const eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoFDCStat (eoDistance< EOT > &_dist, std::string _description="FDC")
 Ctor without the optimum.
+ eoFDCStat (eoDistance< EOT > &_dist, EOT &_theBest, std::string _description="FDC")
 Ctor with the optimum.
+virtual void operator() (const eoPop< EOT > &_pop)
 Compute the FDC - either from best in pop, or from absolute best if it was passed in the constructor.
+const eoValueParam< std::vector<
+ double > > & 		theDist ()
 accessors to the private eoValueParam<std::vector<double> >
+const eoValueParam< std::vector<
+ double > > & 		theFit ()

Private Attributes

+eoDistance< EOT > & dist
+EOT theBest
+bool boolOpt
+eoValueParam< std::vector<
+ double > > 		distToBest
+eoValueParam< std::vector<
+ double > > 		fitnesses
+

Detailed Description

+

template<class EOT>
+ class eoFDCStat< EOT >

+ +The FDC computation - stores the values into eoValueParam<EOT,double> so they can be snapshot by some eoGnuplotSnapshot ... +

+ +

+Definition at line 39 of file eoFDCStat.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_f_d_c_stat.png b/trunk/paradiseo-eo/doc/html/classeo_f_d_c_stat.png new file mode 100644 index 0000000000000000000000000000000000000000..fbd9e18383b70953dc07d087bed97aae3c920412 GIT binary patch literal 2664 zcmd5;dpMNa8lTd3XADWMlWbcfNoHe;l1ps4PfBtbQgp%?m&~X+bTKYz*piXfwt}-a$NXVyp9ucO6MQJNleds(uojVzw%dl9!^iV;&RhXLR=Tm8 zshHCqh<*Cx?W%x%VCZ78bAceC%O+;^kOiVGV>q~Dvgzy)>kuLm#*$?~;k#cdhv10ZP%ugCm(w9EK(!lm|1B0#L) z|1PPA_}q1FcT|JIp$?n?yOk|WDR{IRzPPkJ;ZN(D9@+ncCdO#^N=UCAj+gc<+{Ys1 zdHDfJMYI!Ji;!f(B$_I)<4ck_q=d0h@>uC6-_F{1J~jKMzh}HBvGIvx(+e&&(D@>a z42m2C$Llcn!k+JeO=NyZ1>RFe41su`Z-2}Ev1~Leon2v1u+On zHR01x^j9e}YPoYrCtmN&PQx&{t{7ORRe8H48;OxK>!UR|<|I8VEHoLcPcC3@V}A$K zDPUoUj8xyY2Ijryzv5~gTXS>n%^~Z!{?J3Sb}za3w`+X&GClm_0yiW51OU~FJjeq9@BPhM{KrGGdH07^kJN)`C)BLbpM!uRh_l<4h`DQbW9(9MY zhmNh^PcPiUc>J}=w1@U*sCLOuOf&LNX>*qy*1;cNB)kYwQZ0e(EO-9Tjtaio9tHGn zOR-UTjLBv5rq>`g$WyFF%t!9O+EA`RnKm9lQ|~LS{aY;{HX+g;Mdw zJEk{v5$e^HkCnqaN_a7ZB$`S@w6j4hqr!`jI^{@I ztulHE>9opVU?o?#?7oHuDwL{U7N(+q>DzksXrWWw2g+4#^^Z+rMTjdQK!w#yvn2-= zE%OpeckZ~vgVh@3f zIWR^s`@Dkt2--n)p25kfB5*zjzEU3Jr`6VXa9}9pV>tdgsoEqtAkp<6CVpjwQ3o-^ zB^E)WH?z|FG2UMEqT$bC;|!SurSe?8=&wee4*zzbW56DVE9@E1%9v&eZX#!ql*nww zCDt>;Z#;`z!D~PI9+fz?Mv3*mbTJf7*N(Jjl7nKiZLR91C zfK;X%AYxU-?qPe;5E0v*?wS%`vU^=qL>_6NaMwC2{VEnRD(@x|MD&&#F^0&cx#`bG z{r|e%uB=wEy~h*JC%kB6E2wT1WKF_Qw~B(JSd8Fu3gdb}y6Kr){fpNzfu~m;O6_~9 zHS27&7+PAAx`%mmKwO*^IQvZf{=w@Z)4ej9O5;EvG(9!cdfvScj7W=%4%=*8A=#b9 z^)F)8hM4Q(OE(#pA$kS|3X+Q<4?-^*+plR|cf&<%jPy~8jnd9uq&=0~O>r88Ar4O6 zyod`6P6)nmx>!DZ51@9;@`N^@SqZ@KZ3J~CL&Ob=VpW9!$UGvWTn2pnqUonyY5CDg zP^Q^zDV%>RB9fJF((SohE%S|bMMpbIFO71i35mlinnz~rm29a5q~e)Qw^_6|{lnEU z8YIUy)iGI-9)U-?x>*4f!X!)9GA^aOgLCr4xprM$k}5@SB@a#y^N}l}K0epfk&qoy zqwPaq0I~(>Q?>M#>ZZs_*waUpCw>{U^;?-%ga`b^6FBJ;M}}-c=M0@jQ51vvaKp zEl*#UO2@akv+_|dR=jEFjRrLfqPo;SCFxt}khp`e*I7AtIM@&1<2=6_IJ$xfsUNl8 zhx(5HX~jl47vinZQ{^=zkA?q^0}9$1m(R&dSq^ciKqjUhlH12Qoy~O-RYoY!5-m}y>V=OGWshjyB>ty!s-j4p&0HEY z5=vU~UdwXQ_|5F)T>wgsib6A!IJCHX<+zWITo2sSN@rTmF8;RRxEd)Tq`Di$i#x_T z?jqF~+lnG^zzZ36;Z`w*{PD`WK>IcKJ%&S8JPDWOBRn~|y-SmDJ~=|!Ph-{>9fYX! zJE8nr0}AP)>d6|qRt?NMEQI{b@@5^N%Z!|)FZi|veeU*kiP=w{IKmcL?Uh=dw|)ip q`yN#mIA{L7PjAe@igAh#AKDrVXSi=iPl}#}AcrF^wq@4-SN{e$1^RRV literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_factory-members.html b/trunk/paradiseo-eo/doc/html/classeo_factory-members.html new file mode 100644 index 000000000..ed4aaff03 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_factory-members.html @@ -0,0 +1,19 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFactory< EOClass > Member List

This is the complete list of members for eoFactory< EOClass >, including all inherited members.

+ + + + + +
className() const eoFactory< EOClass > [inline, virtual]
eoFactory()eoFactory< EOClass > [inline]
make(std::istream &_is)=0eoFactory< EOClass > [pure virtual]
~eoFactory()eoFactory< EOClass > [inline, virtual]
~eoObject()eoObject [inline, virtual]

Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_factory.html b/trunk/paradiseo-eo/doc/html/classeo_factory.html new file mode 100644 index 000000000..90becd18f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_factory.html @@ -0,0 +1,95 @@ + + +EO: eoFactory< EOClass > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFactory< EOClass > Class Template Reference

EO Factory. +More... +

+#include <eoFactory.h> +

+

Inheritance diagram for eoFactory< EOClass >: +

+ +eoObject + +List of all members. + + + + + + + + + + + + + + + + +

Public Member Functions

virtual EOClass * make (std::istream &_is)=0
 Another factory methods: creates an object from an std::istream, reading from it whatever is needed to create the object.
ctors and dtors
+ eoFactory ()
 constructor
+virtual ~eoFactory ()
 destructor
eoObject methods
+virtual std::string className () const
 Return the class id.
+

Detailed Description

+

template<class EOClass>
+ class eoFactory< EOClass >

+ +EO Factory. +

+A factory is used to create other objects. In particular, it can be used so that objects of that kind can´t be created in any other way. It should be instantiated with anything that needs a factory, like selectors or whatever; but the instance class should be the parent class from which all the object that are going to be created descend. This class basically defines an interface, as usual. The base factory class for each hierarchy should be redefined every time a new object is added to the hierarchy, which is not too good, but in any case, some code would have to be modified +

+ +

+Definition at line 42 of file eoFactory.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOClass>
virtual EOClass* eoFactory< EOClass >::make ( std::istream &  _is  )  [pure virtual]
+
+ + + + + +
+   + + +

+Another factory methods: creates an object from an std::istream, reading from it whatever is needed to create the object. +

+Usually, the format for the std::istream will be\ objectType parameter1 parameter2 ... parametern\ +

+Implemented in eoOpSelMason< eoClass >, eoSelectFactory< EOT >, and eoBitOpFactory< EOT >. +

+Referenced by eoBitOpFactory< EOT >::make().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_factory.png b/trunk/paradiseo-eo/doc/html/classeo_factory.png new file mode 100644 index 0000000000000000000000000000000000000000..2cd04341959dc37804b27477bd1fd557f26e47a3 GIT binary patch literal 443 zcmeAS@N?(olHy`uVBq!ia0vp^{XiVR!VDxYsai(?DTx4|5ZC|z{{xx-{~wq?KVbrp z1;z&s9H>6@{|S)GSQ6wH%;50sMjDVE=;`7ZQZeW4RL7#j3OueC)v`OK9|)J+;x2vq zTV9caku_OJ!RJ+3fK0QajY_ReSbXst=i0pBoJO?Y?FN?oxbv)j1nl(jwE>BPMHjY>RX9Z*(@)8)1wAd`l6?hUPd^K+6L~+k^fs1Cn z41Jq1_3M82Ra2Kqf4L&Ig4N`0@s)(_V#~KTeS6>CnD@KR@B(XS^a9o>F#2VzFe`aQ zf!`JGE9^|`_P&? + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFileMonitor Member List

This is the complete list of members for eoFileMonitor, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
add(const eoParam &_param)eoMonitor [inline, virtual]
className(void) const (defined in eoMonitor)eoMonitor [inline, virtual]
delim (defined in eoFileMonitor)eoFileMonitor [private]
eoFileMonitor(std::string _filename, std::string _delim=" ", bool _keep=false, bool _header=false) (defined in eoFileMonitor)eoFileMonitor [inline]
filename (defined in eoFileMonitor)eoFileMonitor [private]
firstcall (defined in eoFileMonitor)eoFileMonitor [private]
functor_category()eoF< eoMonitor & > [inline, static]
getFileName() (defined in eoFileMonitor)eoFileMonitor [inline, virtual]
header (defined in eoFileMonitor)eoFileMonitor [private]
iterator typedef (defined in eoMonitor)eoMonitor [protected]
keep (defined in eoFileMonitor)eoFileMonitor [private]
lastCall() (defined in eoMonitor)eoMonitor [inline, virtual]
operator()(void)eoFileMonitor [virtual]
operator()(std::ostream &os) (defined in eoFileMonitor)eoFileMonitor [virtual]
printHeader(void) (defined in eoFileMonitor)eoFileMonitor
printHeader(std::ostream &os) (defined in eoFileMonitor)eoFileMonitor [virtual]
result_type typedefeoF< eoMonitor & >
vec (defined in eoMonitor)eoMonitor [protected]
~eoF()eoF< eoMonitor & > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_file_monitor.html b/trunk/paradiseo-eo/doc/html/classeo_file_monitor.html new file mode 100644 index 000000000..f4a7b556e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_file_monitor.html @@ -0,0 +1,76 @@ + + +EO: eoFileMonitor Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFileMonitor Class Reference

Prints statistics to file. +More... +

+#include <eoFileMonitor.h> +

+

Inheritance diagram for eoFileMonitor: +

+ +eoMonitor +eoF< eoMonitor & > +eoFunctorBase +eoGnuplot1DMonitor + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoFileMonitor (std::string _filename, std::string _delim=" ", bool _keep=false, bool _header=false)
+virtual eoMonitor & operator() (void)
 The pure virtual function that needs to be implemented by the subclass.
+virtual eoMonitor & operator() (std::ostream &os)
+void printHeader (void)
+virtual void printHeader (std::ostream &os)
+virtual std::string getFileName ()

Private Attributes

+std::string filename
+std::string delim
+bool keep
+bool header
+bool firstcall
+

Detailed Description

+Prints statistics to file. +

+Modified the default behavior, so that it erases existing files. Can be modified in the ctor.

+

Version:
MS 25/11/00
+ +

+ +

+Definition at line 44 of file eoFileMonitor.h.

The documentation for this class was generated from the following files: +
Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_file_monitor.png b/trunk/paradiseo-eo/doc/html/classeo_file_monitor.png new file mode 100644 index 0000000000000000000000000000000000000000..d9295a0acf13dadf6e81fbc7a6d293ac0cb9b7cf GIT binary patch literal 806 zcmV+>1KIqEP)x?$@AhF0RLO&11S_rG7Ymu-P zng=22uf6~?a*qE@^?F@}+c%4NC9@SK=f*_Xt^0>0rAwxWAI6XA+)y7U8oZ5XGoB z1S^YVvoVl}2n3=O1ErisUB`O_1t&y|!RA>|N?Mm-c@;w|4`rc_f$Kap*TN>vse~vz zwR`cs+FK36s|nDXzeIrE1OWsPKmY-R!k{<*142`6juTpHbAWK5HjfEMYV!%gN^K4h z`f771hOXLtU=|IvIY2m4n*)T0421V0KyUsM0eTYz5I_I{1P}_NlV&D!GDZ-31efB; z%)T_o-{3s&`0f)-8a&OeNV$E0Fgx$K!tQ~t76`uJN`{PgFs4H=IxrD@%~eCe*R@o{ z)F$YgwjxZKV0r{Mw1`1##ymtYK3l~srY8vNJVfF!VY?RLClq`-Y3dW6Fc990aQ@r= z$ZjWNgx>ry!WGs61Q0*~0R#}#j{c+lh5gM}5TrU!EAfNFHN$X|Fm>@hp}wLS3B&j2j4vaC(398*LGlIg;b%707*qoM6N<$f}MV0kpKVy literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_file_snapshot-members.html b/trunk/paradiseo-eo/doc/html/classeo_file_snapshot-members.html new file mode 100644 index 000000000..7a69d7ee2 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_file_snapshot-members.html @@ -0,0 +1,41 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFileSnapshot Member List

This is the complete list of members for eoFileSnapshot, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + +
add(const eoParam &_param)eoFileSnapshot [inline, virtual]
baseFileName() (defined in eoFileSnapshot)eoFileSnapshot [inline, virtual]
boolChanged (defined in eoFileSnapshot)eoFileSnapshot [private]
className(void) const (defined in eoMonitor)eoMonitor [inline, virtual]
counter (defined in eoFileSnapshot)eoFileSnapshot [private]
currentFileName (defined in eoFileSnapshot)eoFileSnapshot [private]
delim (defined in eoFileSnapshot)eoFileSnapshot [private]
dirname (defined in eoFileSnapshot)eoFileSnapshot [private]
eoFileSnapshot(std::string _dirname, unsigned _frequency=1, std::string _filename="gen", std::string _delim=" ", unsigned _counter=0, bool _rmFiles=true) (defined in eoFileSnapshot)eoFileSnapshot [inline]
filename (defined in eoFileSnapshot)eoFileSnapshot [private]
frequency (defined in eoFileSnapshot)eoFileSnapshot [private]
functor_category()eoF< eoMonitor & > [inline, static]
getCounter()eoFileSnapshot [inline]
getDirName() (defined in eoFileSnapshot)eoFileSnapshot [inline, virtual]
getFileName()eoFileSnapshot [inline]
hasChanged()eoFileSnapshot [inline, virtual]
iterator typedef (defined in eoMonitor)eoMonitor [protected]
lastCall() (defined in eoMonitor)eoMonitor [inline, virtual]
operator()(void)eoFileSnapshot [inline, virtual]
operator()(std::ostream &_os)eoFileSnapshot [inline]
result_type typedefeoF< eoMonitor & >
setCurrentFileName()eoFileSnapshot [inline]
vDouble typedef (defined in eoFileSnapshot)eoFileSnapshot
vDoubleParam typedef (defined in eoFileSnapshot)eoFileSnapshot
vec (defined in eoMonitor)eoMonitor [protected]
~eoF()eoF< eoMonitor & > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_file_snapshot.html b/trunk/paradiseo-eo/doc/html/classeo_file_snapshot.html new file mode 100644 index 000000000..bcb21e5c9 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_file_snapshot.html @@ -0,0 +1,110 @@ + + +EO: eoFileSnapshot Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFileSnapshot Class Reference

Prints snapshots of fitnesses to a (new) file every N generations. +More... +

+#include <eoFileSnapshot.h> +

+

Inheritance diagram for eoFileSnapshot: +

+ +eoMonitor +eoF< eoMonitor & > +eoFunctorBase +eoFDCFileSnapshot< EOT > +eoGnuplot1DSnapshot + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef std::vector< double > vDouble
+typedef eoValueParam< std::vector<
+ double > > 		vDoubleParam

Public Member Functions

+ eoFileSnapshot (std::string _dirname, unsigned _frequency=1, std::string _filename="gen", std::string _delim=" ", unsigned _counter=0, bool _rmFiles=true)
+virtual bool hasChanged ()
 accessor: has something changed (for gnuplot subclass)
+unsigned getCounter ()
 accessor to the counter: needed by the gnuplot subclass
+std::string getFileName ()
 accessor to the current filename: needed by the gnuplot subclass
+void setCurrentFileName ()
 sets the current filename depending on the counter
+eoMonitor & operator() (void)
 The operator(void): opens the std::ostream and calls the write method.
+eoMonitor & operator() (std::ostream &_os)
 The operator(): write on an std::ostream.
+virtual const std::string getDirName ()
+virtual const std::string baseFileName ()
+void add (const eoParam &_param)
 add checks whether it is a std::vector of doubles

Private Attributes

+std::string dirname
+unsigned frequency
+std::string filename
+std::string delim
+unsigned int counter
+std::string currentFileName
+bool boolChanged
+

Detailed Description

+Prints snapshots of fitnesses to a (new) file every N generations. +

+Assumes that the parameters that are passed to the monitor (method add in eoMonitor.h) are eoValueParam<std::vector<double> > of same size.

+A dir is created and one file per snapshot is created there - so you can later generate a movie!

+TODO: The counter is handled internally, but this should be changed so that you can pass e.g. an evalcounter (minor)

+I failed to templatize everything so that it can handle eoParam<std::vector<T> > for any type T, simply calling their getValue method ... +

+ +

+Definition at line 53 of file eoFileSnapshot.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_file_snapshot.png b/trunk/paradiseo-eo/doc/html/classeo_file_snapshot.png new file mode 100644 index 0000000000000000000000000000000000000000..d00cdfe85fc65d0d29788c37dff780fb584d988d GIT binary patch literal 1329 zcma)+ZB&v66vruXdCXWVEkv|-nx~FA<)t)M)0K+Z%(pTnWTNClsMH*ang*K`(-xH} z$}=^WC7#~s#M7H%ifyUIgPQNJv;;9y%j6uiQlGIt?sRtgaPR%y5C3!i|NG$P^c9ly91+8s3m}v=g>CR{`Km}D(k>TgzgVQ5X6cIqOPoDp0m=2QmfTD4-tcP zU6LLZwh#54vEQmjw}b@l+@DoGRS{V-wB8{|Un!tZqUuDJaz#x%gt$ARv8k+$p~=qL z`aUwTId*u}#oKPSZfCs~8mPxtR=gWibc7Q`&M+bxSOvc9_Pn!!d^21dm15z(W?S?r z1>g;YwW)jVR0J2K6yMhpV278XfIQ;%n@8fo+++-OJ`AYB`I9yZF?U$Roa@QuzVM`r zV=n94;MZ>K%r^L@3!g;qtEuxwt|u9tS!k5AC-ItjuyaI^T2?nQiqyB3ago^m^nA9HrfkM z+d_sfBLy}%x1W}g+4$NuyvG%ZVXV022a9VBJx}W%%GQvPXk3Rm{S3)K!)ey*qPag@C9X_jQwI&Yh%*jZCK!_Nw7dMFRG!W=3Oz=2N2tDHlhp~$jE7jpuCq!kVx$Os_$KUTODzNPUi?2UW*Bj@1pfeaQ& z)iqhS6AXtY#D@eW4BxNJY}*eGn1UEwrBnK08JpzV*?OH2vv&j39Jf^hdyKD_C7}W5 zUuaZj$rm5Rrvx}%;+1s4`_?y%#I4I=8dLXDL;Mv*2*1+baO*fCfz6%B?Gy^$YzUSD z4KG>-DsA&Qzt>_hi#T6!uy77z1S843pJ!9|dCnvpi{L2xByb=P5S+M$*#xG$Ne2Er zpvQNto^Z#V2GKQgM~I4agfG-;RAbS){CiyndP#Nb8L+Q6^%${! zy0=SVfi+W_sO&U-+Y~O{B_OHqap!ZQdGKJOyx-KN@GvSFmonM_JFm#N*(WRSjoRG& zetc-0NPN@cm!Pnm*us%`oSKM^%)1k=@_>8p%IH9uMSVHe5D-^-W{3{4^yx@Ehb}gOa zkum|^JsMGzZTjm1VO>TKmYvx;S@odvw`=bp`J>z|ZLcU+&G=&6s8~DeDL!8$z326w z=j7YA00y5uDzES_gA_h+#&GN?L?0Dbcb5`5q?$34a`WZ6`KaM(f76tAny4bHpq2V`7OxPobLD6{|H7 + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFitContinue< EOT > Member List

This is the complete list of members for eoFitContinue< EOT >, including all inherited members.

+ + + + + + + + + + + + +
className(void) const (defined in eoFitContinue< EOT >)eoFitContinue< EOT > [inline, virtual]
eoFitContinue(const FitnessType _maximum)eoFitContinue< EOT > [inline]
FitnessType typedefeoFitContinue< EOT >
functor_category()eoUF< const eoPop< EOT > &, bool > [inline, static]
maximum (defined in eoFitContinue< EOT >)eoFitContinue< EOT > [private]
operator()(const eoPop< EOT > &_pop)eoFitContinue< EOT > [inline, virtual]
printOn(std::ostream &__os) const eoContinue< EOT > [inline, virtual]
readFrom(std::istream &__is)eoContinue< EOT > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_fit_continue.html b/trunk/paradiseo-eo/doc/html/classeo_fit_continue.html new file mode 100644 index 000000000..48c9ea88d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_fit_continue.html @@ -0,0 +1,103 @@ + + +EO: eoFitContinue< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFitContinue< EOT > Class Template Reference

Fitness continuation:. +More... +

+#include <eoFitContinue.h> +

+

Inheritance diagram for eoFitContinue< EOT >: +

+ +eoContinue< EOT > +eoUF< const eoPop< EOT > &, bool > +eoPersistent +eoFunctorBase +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::Fitness FitnessType
 Define Fitness.

Public Member Functions

+ eoFitContinue (const FitnessType _maximum)
 Ctor.
virtual bool operator() (const eoPop< EOT > &_pop)
 Returns false when a fitness criterium is reached.
+virtual std::string className (void) const

Private Attributes

+FitnessType maximum
+

Detailed Description

+

template<class EOT>
+ class eoFitContinue< EOT >

+ +Fitness continuation:. +

+Continues until the maximum fitness level is reached. +

+ +

+Definition at line 36 of file eoFitContinue.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
virtual bool eoFitContinue< EOT >::operator() ( const eoPop< EOT > &  _pop  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Returns false when a fitness criterium is reached. +

+Assumes pop is not sorted! +

+Implements eoUF< const eoPop< EOT > &, bool >. +

+Definition at line 48 of file eoFitContinue.h. +

+References eoPop< EOT >::nth_element_fitness().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_fit_continue.png b/trunk/paradiseo-eo/doc/html/classeo_fit_continue.png new file mode 100644 index 0000000000000000000000000000000000000000..031393d7f91ce53a2a1fe2f4cec1248454b45667 GIT binary patch literal 2245 zcma)8eK^x=AD<+pmR=4jq;fc&!$!|SO)14Q!YnWAIkF-LrA#jSQ5Y&OPtM3u8fV5P zhoNn!v@ja+P!3kHnV06h$#28Olr?qs{5;ilo$Gnd({=v1fA{D9zI=Yy^}Roz>$&26uOJ@qxj#Nf2&YsSSMv@B^{Xwgu_YAgIwa6&DBPK zCJ*hn&u~3+6RR%DuF!gST!MbOX{81EL)_m4CbAz?xNbY&`8Ts~{NBIi?R|-DeSMV9 zDZ?7A1_x63h767l>%0yapxOuYJhe&)o9zCbcld^=Krv_QRH;xf_q5uFq)$D$h?;pE zh`x|r=rB_vOb0=w+1nRd$#=g^V(@l3QU$q__xO2t9hWYM^XjulUq_P#3&-|h3HXpR zpkiUZU;saxOpc12J?1%^xinOvbX1YITq)s4s~tS2TX{Lr>+B-Ze06)4^|NbU zOGN#C=FFrEmBu%}%X(r3Qlc)mpK*KfL?F~56X?mKH|B=#B45`c{7oXrPeWgUlmc%< zmo2CXHgbEBNQwuqDhQ%F0f)t{siG++*hDt+rL9!nv8}Bu=nj#ist3;`wBJ|*Qrwr? z;AKfICN0bme|pSf2|DCVRR?I5H-`Z_@p0t4!p2+ic(cID9}&b$3}O#RY?rWcMkfhO zp_!9@SoT>!l7+5+fJWLZ0`}fNRSYt@D1RVks)Q((!1Dw|r;9W4`x|BXSh~7lT+Qd9 zuM3dI!2?6(7qwZo%?oj`^NJ4hPTF;Ns2iE8*-srBTaA*wxgE@G3|6B`H_9RpHha#> zWk*}KkNRP5GA#su; z1nK%Lj;r(_B&5XmFZDz`7=SoTu);}JEJOBtr{NPK6Q9!q^%?pW1eC?;1m}ACIgA_n zFg$lX?nt**L=Gus+t;RyktGb;Stm7Olyt>pwYd42zB{JxDh^SI%+Y54ykiPx_rEQv zrP`uTnKkaZEa#78n;_n6A2SvZ@2ZcPW1rfg%&kvhcF!p zazi&oAEpN|un1haA z_6#XGr@;)jh-Yw2Sqa8C$vV-ayf{{j(tpr#^Q*8l+Cd5}rB8MJpVjW>JuRV=37gA` zJfz^f`ha~5vZtn^zB&@vA6t*GUY|2<=UrFjC6&z!*~Eg8VWOTCT%9yF5bAT1W^YXu zajCIS#RcL8jsdoWNWLr))CBu$HQJ_T0Zk(~pns)?8SjPP5|(kw>%+mQ+5r~ggb~-4 zz-pHXvUR^Ibdjp($0*O{#>RJTv>qxG=Kn*kd_Qh4)vM{ST)DB$dw1gl{zcV&m=}j5 zn+XKRULmSq3?`~$Rz0bteWO|w8xMGt3DYYY9Xc#s;56g1H3_9`E5IP`o8wf%spm#f z`S!!jBO~~@E^%alR8bXZ|5(`J1;LktRuMq|D?(51hI=*pxO`o*6d06rd8|Z`3HHr< z@9mN~d7nHT=jG7Zz;&$P?_04j+x1&>UoGCeQy!mMFeG7P@+~lywsC$@1D6aQb^KFgAmUq+M#X*A4b5zJ)HlO2veLjC-gkLC0Hk19ZJX&P8Rxhbr>np84c-p&CPN^gH zIMWOC8!l80PQQxV({^BSErUZ37q?zRdRUwgK2MvUxom)wV5`x?*@@y<`kbAjDAs6k zV$7bz+3~zpgT%${V1tD}d(`fao!dTDbn5-)@g&vs%`t8kpY!P4QG(;MN>tb{$OCoO zU}DSKgJa#`fYh1b*acdK=izI79M-I@>Fk16_nSiU^rZjpPIsibJKhnS!ns_fj~);v zm4upmE&v%#TZ6Ij`~_0{CdazOWj6$;Uf%JgYnY#rYs@YLW%gwaSQbNX4w$ + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFitnessScalingSelect< EOT > Member List

This is the complete list of members for eoFitnessScalingSelect< EOT >, including all inherited members.

+ + + + + + + + + + + + + +
check_sync(unsigned index, const EOT &_eo) (defined in eoSelectFromWorth< EOT, double >)eoSelectFromWorth< EOT, double > [inline, protected]
eoFitnessScalingSelect(double _p=2.0)eoFitnessScalingSelect< EOT > [inline]
eoRouletteWorthSelect(eoPerf2Worth< EOT, double > &_perf2Worth) (defined in eoRouletteWorthSelect< EOT, double >)eoRouletteWorthSelect< EOT, double > [inline]
eoSelectFromWorth(eoPerf2Worth< EOT, double > &_perf2Worth) (defined in eoSelectFromWorth< EOT, double >)eoSelectFromWorth< EOT, double > [inline]
fitness (defined in eoSelectFromWorth< EOT, double >)eoSelectFromWorth< EOT, double > [protected]
functor_category()eoUF< const eoPop< EOT > &, const EOT & > [inline, static]
operator()(const eoPop< EOT > &_pop)eoRouletteWorthSelect< EOT, double > [inline, virtual]
perf2Worth (defined in eoSelectFromWorth< EOT, double >)eoSelectFromWorth< EOT, double > [protected]
scaling (defined in eoFitnessScalingSelect< EOT >)eoFitnessScalingSelect< EOT > [private]
setup(const eoPop< EOT > &_pop)eoRouletteWorthSelect< EOT, double > [inline, virtual]
worthIterator typedef (defined in eoRouletteWorthSelect< EOT, double >)eoRouletteWorthSelect< EOT, double >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, const EOT & > [inline, virtual]

Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_fitness_scaling_select.html b/trunk/paradiseo-eo/doc/html/classeo_fitness_scaling_select.html new file mode 100644 index 000000000..8e30e2833 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_fitness_scaling_select.html @@ -0,0 +1,90 @@ + + +EO: eoFitnessScalingSelect< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFitnessScalingSelect< EOT > Class Template Reference

eoFitnessScalingSelect: select an individual proportional to the linearly scaled fitness that is computed by the private eoLinearFitScaling object +More... +

+#include <eoFitnessScalingSelect.h> +

+

Inheritance diagram for eoFitnessScalingSelect< EOT >: +

+ +eoRouletteWorthSelect< EOT, double > +eoSelectFromWorth< EOT, double > +eoSelectOne< EOT > +eoUF< const eoPop< EOT > &, const EOT & > +eoFunctorBase + +List of all members. + + + + + + + + +

Public Member Functions

 eoFitnessScalingSelect (double _p=2.0)
 Ctor:.

Private Attributes

+eoLinearFitScaling< EOT > scaling
+

Detailed Description

+

template<class EOT>
+ class eoFitnessScalingSelect< EOT >

+ +eoFitnessScalingSelect: select an individual proportional to the linearly scaled fitness that is computed by the private eoLinearFitScaling object +

+ +

+Definition at line 40 of file eoFitnessScalingSelect.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
eoFitnessScalingSelect< EOT >::eoFitnessScalingSelect ( double  _p = 2.0  )  [inline]
+
+ + + + + +
+   + + +

+Ctor:. +

+

Parameters:
+ + +
_p the selective pressure, should be in [1,2] (2 is the default)
+
+ +

+Definition at line 46 of file eoFitnessScalingSelect.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_fitness_scaling_select.png b/trunk/paradiseo-eo/doc/html/classeo_fitness_scaling_select.png new file mode 100644 index 0000000000000000000000000000000000000000..fc1791814e3f1d044046906212b90f0a87ac99a2 GIT binary patch literal 2694 zcmb_eX;c%*8ja#n1d$O$L`Co@Iz9wJL{tbMdjLVi5ZMBQvdg9hNCyNI*~B+6E+~ru z6&a05%WfbY7(^Htc1Rj!6(xkUF~$%UnZOG(I(pvt-uv@@banMtRky!$zgxE|{g{)j zg4`xK6bhw)v9mgkLM^AEP|NgI$Vel}*mrr-*T!RxC#)A27p2|B#dTOjQ{>X4nyH(`Uu$n{0^xS^btIi?N zC(lwmHRiWEL%NQp2Lt$(==1ha$@pBA&x0cgJ(!d}DF59AeuBu;0>mPXT}A%kvhAjT z!pxZdDq=x{vaGWI0llM`q&3BapXL@!(m$Bw_52bgKsz-a)VZcKlnpsOh~{HS?Gptl zkxu7~w=ryP-!lM}-hDj(+L97hL+%*7jHBCT_ZH$yY6!B zPVlOU!ql7ocoICK@xwS4N!-H2-gnDqgv2XQSCQ1;U21vE*oos90(Aqf)lemTY?Jsj zCgs;-ojCp-h?5iay}0rYc(`=@JFvVagn0meN`kkv^axg*tb*-$66A4HnYjSR~#6mcT+aC09Vg4VO|F{-{V zHh%<;4Hh9uwcPcaALE+_1_4-{2;CL|nyjSQm7a=&Imj~4Iu30zjlq2)a>5i*eW*-( z_wUXx&a=x$mPMBxp2*G7C?0t8u+|?+MvhW>>fYxe$oY-flfP_KXLwAFo%0~XSRao+}qj6 zlmC>84CGgcTQilBgxCL)-=`oj`4(xFbipt(|JCqTqC)A4GIa{p-qQQCez6OtuJHo5Nt9UGVZj<{l}NbgD?8i=$L; zy&14e`K()%*H7&_yhLa3c!X6;o#VaLI+@NN4t2XV{4+mJ{b<1E=3-H$koVi=;7P*Z zV;MF-StNFkCu|lIyjW7DjEX}}6WD+bFSK%N7j7a`jNL22^ODOLc4-9P(ybf+P>3#D z=3&JN=ocs}t5e2){ zp)Tx|k@C;onf1_stJ0vc;Or(lC3g|l`42_bs?N_k86j~uCDo_M zo;=H&tKB0$VDS!dX<^{<%9mD|F>^}bQLmKnD_4%F=@y5s2MIqZL#9Qot=&&H$S0`j z1pGD;bn7x46Z%UGQN4KDBYaP5u$R_pNPF6W@nH6GlwTCNU>P5ITJG|5cl5fnW%1S0_Va%GZzBIDReuKSaG4iJ zE;aw*Pv_1pwO}+GENx^CKJEf)e(Z?P0-9p+x@- zSl!Qg!Y~&j(j7K*^*F3SRAD{M1s%ZXL-V$!B_f`qO#!!RdXs=QftV483b4@@AT2fw zL6ku{Q>s-uv$Yz=c`L>`boGVl`|sNT3hU`gIa)bXpK_0GgE$E=dJun-N-Kg>^#puX zi=|`jGoM99AbDXHFd}ad%a6|NTVkAJ@MVJ2`Fv6qNd_l-^i4w9^vF#CyNyCBfK6H!Weann%fp-12gJ zF1D>hsU&ar`-b$`x^<=49SbIw$O-(w8C7zGJ=Zn!*QjlVp(>?>(^CKj(-T9a!D%Q?2dsn>UM()Cl0~g$KPdD6%@{f z$$>!yt;kvQcb4GsXg5ZGN$w_BIV~N9+%z5ImUT;@fJsDPP&eW_+|hOS-;DR~F5ugt zyb`!vpTBF(|HlFVy4~J5kG?B|rs%{1FEezaYSCXgq^LqE@**nnpSYG?yK5`-BSsz* z!xiVP-V~>r(&6Ggp`rX6O*deMz}h8H3>2tliPp%cj=YI>@Pub)-1toV7>#0xCv;+A zGEPG8rl=bkJJfKD?|KRaj}Hjg-p4mNG#6G0fgwrsAv!MG#w|a`h@$9^3#s5odgYfc znKz-jzZ|$~`XNrC%&KCoR|VR;r!5p%H^ou + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFitnessStat< EOT, FitT > Member List

This is the complete list of members for eoFitnessStat< EOT, FitT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + +
className(void) const (defined in eoSortedStat< EOT, std::vector< FitT > >)eoSortedStat< EOT, std::vector< FitT > > [inline, virtual]
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
eoFitnessStat(std::string _description="AllFitnesses") (defined in eoFitnessStat< EOT, FitT >)eoFitnessStat< EOT, FitT > [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoSortedStat(std::vector< FitT >_value, std::string _desc) (defined in eoSortedStat< EOT, std::vector< FitT > >)eoSortedStat< EOT, std::vector< FitT > > [inline]
eoValueParam(void)eoValueParam< std::vector< FitT > > [inline]
eoValueParam(std::vector< FitT >_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< std::vector< FitT > > [inline]
functor_category()eoUF< const std::vector< const EOT * > &, void > [inline, static]
getValue(void) const eoValueParam< std::vector< FitT > > [inline, virtual]
lastCall(const std::vector< const EOT * > &) (defined in eoSortedStatBase< EOT >)eoSortedStatBase< EOT > [inline, virtual]
longName() const eoParam [inline]
operator()(const std::vector< const EOT * > &_popPters)eoFitnessStat< EOT, FitT > [inline, virtual]
repValue (defined in eoValueParam< std::vector< FitT > >)eoValueParam< std::vector< FitT > > [protected]
required() const eoParam [inline]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< std::vector< FitT > > [inline, virtual]
shortName() const eoParam [inline]
value()eoValueParam< std::vector< FitT > > [inline]
value() const eoValueParam< std::vector< FitT > > [inline]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]
~eoUF()eoUF< const std::vector< const EOT * > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_fitness_stat.html b/trunk/paradiseo-eo/doc/html/classeo_fitness_stat.html new file mode 100644 index 000000000..7e6cf8d74 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_fitness_stat.html @@ -0,0 +1,49 @@ + + +EO: eoFitnessStat< EOT, FitT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFitnessStat< EOT, FitT > Class Template Reference

The fitnesses of a whole population, as a vector. +More... +

+#include <eoMOFitnessStat.h> +

+

Inheritance diagram for eoFitnessStat< EOT, FitT >: +

+ +eoSortedStat< EOT, std::vector< FitT > > +eoSortedStatBase< EOT > +eoValueParam< std::vector< FitT > > +eoUF< const std::vector< const EOT * > &, void > +eoParam +eoFunctorBase + +List of all members. + + + + + + + +

Public Member Functions

+ eoFitnessStat (std::string _description="AllFitnesses")
+virtual void operator() (const std::vector< const EOT * > &_popPters)
 The pure virtual function that needs to be implemented by the subclass.
+

Detailed Description

+

template<class EOT, class FitT = typename EOT::Fitness>
+ class eoFitnessStat< EOT, FitT >

+ +The fitnesses of a whole population, as a vector. +

+ +

+Definition at line 36 of file eoMOFitnessStat.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_fitness_stat.png b/trunk/paradiseo-eo/doc/html/classeo_fitness_stat.png new file mode 100644 index 0000000000000000000000000000000000000000..8a3e0a7662936b0bbe9d24665c26b1d9ae7885e6 GIT binary patch literal 2933 zcmb_eX;4#H7G@LeD4=Y@i-r~iL=apOb|WYx1Q3KopxIO+5RjH7AVg>t5mE86OORax zfv}2=0x^=v$cxRsFDeK`2q+3+6P0CRS5Hk>PxaLNm>>7vb57NFZq+^C`Odw4$_^_9 z17IQ|B2qXj3r7(V@pz%VA|Wo^Yl#;Ngon~8TY}}r#)i<`*x=;lolO#2zb_7l6WO@& zPUwn;I@;ky%q9nYL`1f3#aWmWBCT3i;Z@vg{pHQf`pN0EM`En`Y@@N zd0bbD`m~|(B7(%_!;p4|LvX?m+>f_Wwd|c zZc?5>5=xr;a7?z-!fD{N@$V){MgSB|d1cpxq&?S4CHu?|WP+u6EarB(CGQ>G8aath4NrS??i8T)gzZV= zTRp8zhE8tK8SV9$+c|E4UcsR@FMDg^Bd0`&@rt3SNPK>(ZxD-2ClZsMuG{i7Aqan( zsCxieS{=+(f@^j;hQ`Jq;62m2KBcji3G?zRYarNUi;8%JqDtg4x(AiqS2(s|xsoBp znOtN4w*>1R3o5ovtAkKqPoW!k*@lf8rhGKTpS*sa-kkIP6f3Ydr_}w&rsdu-+c39E zR^TpO>sLV^f7V3$zX$mJsmIEYK6Q@LU?vl~Q1KaMMw7e>#6g#YC-9(pcV|g71gkh! zxnjCIG{XPb<&+C56$eZ`SI{u z!yP>DNb3*JxrIwfQ7Gg6msG2rJqB1z272eSK@_Ep-fDEX^ae~9YXu>aqR^G*2 zgpL!fTH1ZVJul61G>iU%;83DEu%JM}YAtyBu@+ZELCb^`PEOeePo80^-I6IVF`Z!U zw~Oo6W$0wm7ixaLhJHJ>zs>=fZe$G+Vj55*N^ov`b+X%-PDLC5r)n5wF`Ad&SypdL zkm6!Y0Pk+2aHKb}cv>4}&_TdvGA<{m4e9zF%`n}d+4b$5g=@=2Qi+iPhWOoD@E<1j zPJ0kd5Et}U75FVE^fFosV7v2(W@<=%2|%H93n&$h*@Qe!Jb^B&UgEFk{!wBFP=z*- z2v>1)9(^ig#bQ11ORdoX^d_Y1XmL;MuyLE8Kr6pXGGjdBzcc4=2=$-gT8T6GVOW%( zd$b;Sf_Ng|K@{v9+)g5x@v=}ivujn0L#@gl-t>3e%0K_WiTP^^AJsfR)pWedxytjm zjR%PNkm->Mt0BQ-fZ9Y)g;*LPB^r-i(rH)r7&O9>p6qoG(6Pp=>CJ3UiIX^j7oVDL zu*`aC>OD25#n?2(JX#Xw@eAIv7)`=2^4BUak6)}N)+x&1;%c2H2(1z7S}gQc8otrS7^q57fknw;2fyBcdGmF3eKZF zFzK+gPGgVO`JKQjSvA?$^hzFvsu&^jlbY{rlJCd8fL4V|)O#Br>0w5tVC4oxu!k8? z$@CyE*yZQJjBtjrQSgn=e)e5;d-rNVYv18ecCA;Jq2iE9vmL5v^dDuX^S)21nmh42cU1zknXQY$}XhQ_!^d{JdHS4T0Id{F|0KRF9G$Ynf|P${GOlr9$=K}wmiRK7tslKOS>baXKhELuJ)$Q#jWM+O((LgfCTpUz16Wc75C#i!? zhyGr$M)|e&2^H{99S;VqHpBi0X%jM$m%jK_!6kocY3sC^=$}MT#-DY+J%*t^H^=)@ zO8>g&Kma1w=8Gt(far}llEZy8W*W^s3bv>=b*{*MMxs;Ni4Fz*nKCt~Ieoj*v6bzv zDrgn8;y7q$U9liJ6wxPvpp~EdG~YZ)i6*1O zpXtUG5?2cZ=82syW4X}gZi>6j=#HpM8A9_XY(vWHX;fC%4n~B)J@KjzExFa zMog3Kk|lc4IeVvL^&4?OI|{?Qa|0$1BS3@&* ziS7IU>cII~CM_)W7qxHw3K5y>{w&col=W5A$hCE#hz$gqT?M<(fCl+&%ybn5f7swK zY4qtF+hnSdf~eQCw~=dc$?(Y#EI)k9J~(y*g6WY8-^MLGis_C>YGm=wQEfb#x~Izh zmCDLFd=0|UJ+X*1!~dPOB!vokXDw=NFr2EK`J zyaO!;o#w(o1*DcScZ+oPOUD*r_|oyv>F+fGz(NfyZ&jNatg5cqy0+hq zB?p$79w)}0?y58Cv9gmM$6hDr!2sTO=>8RCcQOAd7q zrVorq7gw>$Sb?n?KdJeY2KuyMeyXaJ0JH-J_XRTLkxo-p4qwXzl8XcT*7_pEzg|fD hyO$DC2_me@ + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFlOr1ptBinOp< EOT > Member List

This is the complete list of members for eoFlOr1ptBinOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + +
AtomType typedef (defined in eoFlOr1ptBinOp< EOT >)eoFlOr1ptBinOp< EOT >
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const eoFlOr1ptBinOp< EOT > [inline, virtual]
eoBinOp()eoBinOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
eoVlUniformBinOp()eoFlOr1ptBinOp< EOT > [inline]
functor_category()eoBF< EOT &, const EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
operator()(EOT &_eo1, EOT &_eo2)eoFlOr1ptBinOp< EOT > [inline]
eoBinOp< EOT >::operator()(EOT &, const EOT &)=0eoBF< EOT &, const EOT &, bool > [pure virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoBF()eoBF< EOT &, const EOT &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]

Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_fl_or1pt_bin_op.html b/trunk/paradiseo-eo/doc/html/classeo_fl_or1pt_bin_op.html new file mode 100644 index 000000000..edaa91908 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_fl_or1pt_bin_op.html @@ -0,0 +1,56 @@ + + +EO: eoFlOr1ptBinOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFlOr1ptBinOp< EOT > Class Template Reference

The 1pt crossover (just in case someone wants it some day!). +More... +

+#include <eoFlOrBinOp.h> +

+

Inheritance diagram for eoFlOr1ptBinOp< EOT >: +

+ +eoBinOp< EOT > +eoOp< EOT > +eoBF< EOT &, const EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + +

Public Types

+typedef EOT::AtomType AtomType

Public Member Functions

+ eoVlUniformBinOp ()
 default ctor: no argument
+bool operator() (EOT &_eo1, EOT &_eo2)
 exchanges first and second parts of the vectors of Atoms
+virtual string className () const
 inherited className()
+

Detailed Description

+

template<class EOT>
+ class eoFlOr1ptBinOp< EOT >

+ +The 1pt crossover (just in case someone wants it some day!). +

+ +

+Definition at line 181 of file eoFlOrBinOp.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_fl_or1pt_bin_op.png b/trunk/paradiseo-eo/doc/html/classeo_fl_or1pt_bin_op.png new file mode 100644 index 0000000000000000000000000000000000000000..db82d7f37da91c92f5fac7c5658a6b4def9289b7 GIT binary patch literal 1954 zcmb7Fc~sL^77n|Dpd7@AA}|nEG0;%SplksG352!4u&G!=WKl4zVq`D1tU|(Kl!Dq5 zrz{~55Dfv$LBRX~!72tK5E%F=R6sPTgaDexT2DKte@y3(_ulvJz2`0WefN8Xem)-R zss~gd5QsV!;}!sc$a7_wqo^S3m$Bc;$%g%YxIna2DwRR0lv7_HSuR7rH4cYE>XU-9 zsa#5c&sPxVmy-ktMCG4YH&oz-+SS@e#-b&D}>t zU?`5svRl4tlITn|Kl1(f_9cPY%bQwJx6T-52#*ujn7-r~idP-(`Mn50Yc|JVQx5&Q46NHv9d4PYR=Pw#=m9|1dz z&LjahO{Qp0{@R$Vz(>j9QCLd*Q-Q zYU{Put2}EJO`MDd{-M>5v-KAkN^U0<;OgcjT;uTJBQ_Zq;CzR54|q;G*>&G_Q?jec zEVfRF>(w4cH(K=}s64QIJQL1x_l9GGv2J1a$MFcZb(@)KVuuNZkG9A5#UZFCb`7y> zYc}`=48U{QqFt?Ns6XtLUQonEwf5qxt+92w@k}AW#_f+_S>x+;1&w{FLA;guQv1#R ze{DoEl|)I!&@HDbJjIc_dU~tji}FifR%DM-VMqnCPR{2ytpj;txjl~J>Ku!RFqLwf zPK`NrXN1CR)bb8qL~ppq8)XB@`-t8G^;hA~Lm3cQa*mq5Liq>;W&;6s$pZfia<*Av z`=a8F$U5OF=amO}a<#c_sgN^~XAg07_W%E;_^{bF@AJq+Y1|>Do7eEMr(8Fl9V;r3 z%1-ooX9JY5G5z}T8gHshTV<24Sm%{CQ}kq1wD4{qKMs03scn5orJ38+%24sxYmhO+ zri+QtzJAks;`s0}CPV&+vACtFNd3v(WUt(H;~KGx?DSX(y#cGK(%=5?w$CDmS^3c7I4*<_gEg?=C2%{+L3)B6#e ze;e?H0r~RREKI1uaZ1#!d+={$6l!wt^1l7B*aLTv@sUVNA(hb+pf&rv2#ikCT%@mE zKVf!kH}}e-*CexTBH@Q(5g0-VT3R$ErJ*FKngvqUW?|yi&oldMVbDq4k->I3U>Bw$ zLK{PX{LY=+v8w6K`!hT1NnXy{Z;U-YN<{4J^mc!6RQU);i9RUU{Xe)uBW`sbALO|! z8ofr&Ykd}(&+E(d=C4p-UiVgM#PXgirczojOVx4rif~=E}iw zLgdWPmhqkPKt(1wwh6iVG*sMx_7+6%A}g?AjOVK6vr61|Nur({1VHjqhB095Yt27^ z<1Oa#FFGd>FcQ%5>|n+8!|HRPtjRMvhH43+E4X$!b+8E(v_R zV#vcIeNPggp@;AGI18i7(pQIbz=zI4FIif)6*T``CiFE0gG()-#oWt%ACq>8QYnYY za)QRv#~d{=FCkFJPip(u+ke#HziXA)d1_4X;DT>&RP0oxA@bZ!%qoX=9H8FtvoMOm z=eabLd~!^A*q)Lu(%IHKcU+n2ZcX-OKU?7>Y)4P9Oz*f#CMF%3OF>} zUi!W(Q)L5ZThjcMPa|cTbvNSsm4wlS(If25l-|)|ZUW<{+ynA&dmiP}LkLh} zT?xP7#Rj*_yEqL3h@FK5S%y(YT6;aC6-#k`W>uPBB2YI2-5+xm3j%aLIj#v5Tit6x ZshmRw)Xf5AX(;C%-mmFJnP~t3 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_fl_or1pt_quad_op-members.html b/trunk/paradiseo-eo/doc/html/classeo_fl_or1pt_quad_op-members.html new file mode 100644 index 000000000..264883cb9 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_fl_or1pt_quad_op-members.html @@ -0,0 +1,30 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFlOr1ptQuadOp< EOT > Member List

This is the complete list of members for eoFlOr1ptQuadOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + +
AtomType typedef (defined in eoFlOr1ptQuadOp< EOT >)eoFlOr1ptQuadOp< EOT >
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const eoFlOr1ptQuadOp< EOT > [inline, virtual]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
eoQuadOp()eoQuadOp< EOT > [inline]
eoVlUniformQuadOp()eoFlOr1ptQuadOp< EOT > [inline]
functor_category()eoBF< EOT &, EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
operator()(EOT &_eo1, EOT &_eo2)eoFlOr1ptQuadOp< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoBF()eoBF< EOT &, EOT &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]

Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_fl_or1pt_quad_op.html b/trunk/paradiseo-eo/doc/html/classeo_fl_or1pt_quad_op.html new file mode 100644 index 000000000..df29401d2 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_fl_or1pt_quad_op.html @@ -0,0 +1,56 @@ + + +EO: eoFlOr1ptQuadOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFlOr1ptQuadOp< EOT > Class Template Reference

The 1pt crossover (just in case someone wants it some day!). +More... +

+#include <eoFlOrQuadOp.h> +

+

Inheritance diagram for eoFlOr1ptQuadOp< EOT >: +

+ +eoQuadOp< EOT > +eoOp< EOT > +eoBF< EOT &, EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + +

Public Types

+typedef EOT::AtomType AtomType

Public Member Functions

+ eoVlUniformQuadOp ()
 default ctor: no argument
+bool operator() (EOT &_eo1, EOT &_eo2)
 exchanges first and second parts of the vectors of Atoms
+virtual string className () const
 inherited className()
+

Detailed Description

+

template<class EOT>
+ class eoFlOr1ptQuadOp< EOT >

+ +The 1pt crossover (just in case someone wants it some day!). +

+ +

+Definition at line 173 of file eoFlOrQuadOp.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_fl_or1pt_quad_op.png b/trunk/paradiseo-eo/doc/html/classeo_fl_or1pt_quad_op.png new file mode 100644 index 0000000000000000000000000000000000000000..45c9339a59f946322201a8453c78e63b0249ed11 GIT binary patch literal 1723 zcmbVNeKgZ+9AB?`)tgf{DW`jHC`GYZE0I_(3%z&=E2UOCgmbu-F9VGfY#_O@6;HLmAFNzqLf(UxvBU>D+Vgx#!+L?m6G@=lgj+&-2&!^L?Ht>A0us z>J`Q-5D3I-x1U^2A`lCydM;nQNRQkCi(!5F?)Wip?A+X(p3cq5v$N0L(zCBAm&+N? z=X&+a1raAbPazJ&Z6OH6(i3hjPTtXi{w&<>C;N>Og;fP-H`qO*>g3J!rga4qk7lNw zDYurLxY`pPU+Kk>Eb7PD!}kfdtMGM`BgIB>{L$p}`+JP&Q$Xf(ZiSl@fOMUYFDSHy z61%1X6L7BRSx4I~of!Z5X)2IrRAS&%7rnFk2ppOVKLkRg?L`m}KJgQn?LpPwK?vkS0WGZb4P&ay%ftnrd6vVE*FQYc_!z7P` zwz$W9@U^#3?i(LiGFgTZ1}8xRQ}r>UeXR^zC%=o3X(5^j25eC5-6#J2HA)c3JmR6^SiEu7o8Kd+vLH{_axRmcqD85{NXn>*jG{#MYhYF#4eL6 zlYxRhci0yY$g&pUS-cdqOE{AvtLb?MRuOaTlH&}!R>oum|aJ_fiLCfTAol@z5J-O*rDS6qaNU5+#u9+?iLYS)tt z6Kxl-0CO5l{t3sj<6P1ln3$4?1uQIX)0NZzlaQhwKQoz`*wVxqOl=M-)QzpyTr%|V z0!T4DXNAIqr+WY=_FkhBygYnhBV`sj#eN^r6Bl%E!~qmfp6u>8U`p3GUM|A1HAUy8 zX);Uwe(R3B+%6#(eTaRqs#-L?%GddQAwCFnLqh6>&0$KVmG+t08q+DBObZb?9BQWPpVQuFp|Fq8~*MDezl zJj7Sx>cjGrQ1_hbRMsd^xsg4g0++ikF|Fw_TN3o?0sHJIa3($x-*Vt55?X z{w3Idm+4%toqE?}rBH9ObT+#OpOL#Vi8fShte(LWy58;q$kEPY<5Hje=tfQj^4DS9 z^WN?tl*G)HHPaNLS(3e-X00S!pRa*wsLIoUHE?ITt_SY)I{@Yg6(#}SiuO9VJTA;! zaCX(1NbULvrDo-1+MyfR{d$90!?`vQAN9+sTKw$*uE8hI+UZ|~_|`3rO|PtL zuW!m2x#0W7{kF(21rtEuB0%CE(jTe`M3DyUbz=kmMfg@Lr@^q^b}?}0RSaD(GtruZ4kDCbjn z!HwTA8EminJLBQQ%*#5jMr?!0D&jIDo^uZ7e?mq9h;nE9Y8zHwdTFEh^Wq5FRmhQ2 z#Wr{Bv{mZX{t~}XC$2~#Jn@=h=}Cdk8q@E347UEr>M*8rCWmUi47Gv&;7&zGrL^S} zt+u&D7+Kvi(9An}^%CFgE~!J9-;D23y@W&GoHW~5|1Qfo98w`W146CZFL+U)n|_@F z&N^h8;Mu}8VF6N0@*(K68d>^Bb4NmFGKZ!O+5>a%iy-n+GS)>vk0F^Cp zHx+Wf0%rghB?(lBa%}$P5rqkGu76fmu^eGAr&#G)Bi4#C3B*HvlRm_Q( rflhBnKIR)P1atn@Xm?qcvCbez9J0aw{qHROPlIs7db$)HIrqySx%PAh literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_fl_or_all_atom_bin_op-members.html b/trunk/paradiseo-eo/doc/html/classeo_fl_or_all_atom_bin_op-members.html new file mode 100644 index 000000000..a3039ada7 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_fl_or_all_atom_bin_op-members.html @@ -0,0 +1,32 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFlOrAllAtomBinOp< EOT > Member List

This is the complete list of members for eoFlOrAllAtomBinOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + +
AtomType typedef (defined in eoFlOrAllAtomBinOp< EOT >)eoFlOrAllAtomBinOp< EOT >
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const eoFlOrAllAtomBinOp< EOT > [inline, virtual]
eoBinOp()eoBinOp< EOT > [inline]
eoFlOrAllAtomBinOp(eoBinOp< AtomType > &_op, float _rate=1.0)eoFlOrAllAtomBinOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
functor_category()eoBF< EOT &, const EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
op (defined in eoFlOrAllAtomBinOp< EOT >)eoFlOrAllAtomBinOp< EOT > [private]
operator()(EOT &_eo1, const EOT &_eo2)eoFlOrAllAtomBinOp< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
rate (defined in eoFlOrAllAtomBinOp< EOT >)eoFlOrAllAtomBinOp< EOT > [private]
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoBF()eoBF< EOT &, const EOT &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]

Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_fl_or_all_atom_bin_op.html b/trunk/paradiseo-eo/doc/html/classeo_fl_or_all_atom_bin_op.html new file mode 100644 index 000000000..44d4d4a7b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_fl_or_all_atom_bin_op.html @@ -0,0 +1,63 @@ + + +EO: eoFlOrAllAtomBinOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFlOrAllAtomBinOp< EOT > Class Template Reference

Bin Crossover using an Atom Crossover that is applied to a ALL components with given rate. +More... +

+#include <eoFlOrBinOp.h> +

+

Inheritance diagram for eoFlOrAllAtomBinOp< EOT >: +

+ +eoBinOp< EOT > +eoOp< EOT > +eoBF< EOT &, const EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::AtomType AtomType

Public Member Functions

+ eoFlOrAllAtomBinOp (eoBinOp< AtomType > &_op, float _rate=1.0)
 default ctor: requires an Atom BinOp
+bool operator() (EOT &_eo1, const EOT &_eo2)
 applies Atom crossover to ALL components with given rate
+virtual string className () const
 inherited className()

Private Attributes

+double rate
+eoBinOp< AtomType > & op
+

Detailed Description

+

template<class EOT>
+ class eoFlOrAllAtomBinOp< EOT >

+ +Bin Crossover using an Atom Crossover that is applied to a ALL components with given rate. +

+ +

+Definition at line 49 of file eoFlOrBinOp.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:48 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_fl_or_all_atom_bin_op.png b/trunk/paradiseo-eo/doc/html/classeo_fl_or_all_atom_bin_op.png new file mode 100644 index 0000000000000000000000000000000000000000..0038dd098d323fd2803ee0ad2dea06302ad34bb2 GIT binary patch literal 1962 zcmbVNc{tnI8jfYEmTEg_Oc_*#s9I_dN^KXBWQ=yu##*t(lJ0D3mbMMSQ_m6YVci!iFzUO@J_df3_2|)Sm zQrWKp0)ck<`FaI{K=OZ=#cV|d*}mX+QBHPf2Ov&(OQlj-D3!9Q)W~XC^l7o#?Cd_N zKz5Z&3q&0U9h)1E1%Z@~`FXjY$gE$gA12&z+~bWzoFBVb!L@RGd_?5gf*l>|b(=3y zTrKMhhRroD13UxIcaCN?U13=)-Tq!+Bl>j$Nw*Tn5y$N*BIam3@ZwN^Ajkz+gWx*? z!hqHjwJwXVxd)9FvI-|)G(k`J617%-ZqAXa9r!MuR|e1Vz?J4cz}BrY zbl1}OQNnO3(~vMo+-#m4e|n(#jAn8V>rHX6|78KJC_4tSE~26+=As>KtUH8}qt3Ct zm>65i%ldQ#(dOzuH1D9WJ#M>Ivf>BkU%_fzSViM;6z6Z-!~Gl6bVDN;cFt+;4C{>S zjAvKqGg0e#C?C$yqsgg9`R%ny`seBV_~)@y$@dX{m9rjQGixWEcA_AIz)aPAgg(TR z5%@FCgg1t1`xs2Bdp`8J@uVq**F)-8;8iMOSWhib=DMmE*E!-w29Uglmn7NI~o>*alQj8>rxx0-d zh$-JjE+xl|Tow{>J_a~N%ne*m?Dp-$0*p>= zQYs90mZlm^{BG=PMyJ)^(*D}C7F0}k=BW^7j5JzRL7tlH2*+&q4%_vX;4 zu$=1bl?@dfBHZ2W>kopBp9n2)bXXagn@vwh-3~SRqZFgyqJPiy7zb2I43(sUl&2*% z1)g`g>X9QM&IP+=c-}+)UO{L+*5|z(R4fY3KaYIp!>8qeNaY1!R}e|9;ByJ+S0ISO zRg4Ub%!@EDyUpCoDeq8lRES;z{lb=&v$5i;zf$`@pn5)a9Cb^7YKw-~RQ|z_yq35# z|3&5L8614eW%~ungtn<8p=Mz6IP`Q z%jJ!P_a@GPGxFU8LYEqsyRMeAqV$1h_^sgqKFb6@+#?A20t;VG4%X86F;TcrVd+74 z2Jj8A_<=#FZ?s%qEkcgg{({f_a9vV?xs+aI8gLwl2W!?T?ZP_0UHxW7W7#*nQ!9&D zEE>?baK8Z;*^<)#lo)8qlMQ)Hbq4W@e{{mrmG@o@8qHIjGx@Z@TG{Hkz?SGa zg{KGt*>;eLx8{WJ>O+Gp@F6`WFno2JQ>k#FsM`yezGTf(Z5@OI2VQkjTr{n-pwf+= z2a^cBK+b?@;B>XGUg@l1?DvZZ^^((Fdz$TFEWRfeIM;LLp`#;BCaLSH-Y4eg+=7VpB~uO0N2WzJ=wcbGoBzVJS_I}jnav!=O@Fwzwc4}K9ssVb%qn#4t-6)&L%ty!Zr8{Z&sOOxnU2XJP}#YLazqG z3X&`x##G}W;z@!#hk`*9y9{8=#8VwW_Lw!qnUg@f;|1uSV$z2OvdN}AKfMdrF;vdF zlUv|wHbH`5goO$0U?;aSHg1?;ZT)0#=1Acw+8aMS!(@_y*`R$N$aQ9}@XL;A%8Um(RCw zy>OMHtTG#^ID!a(DjkfEE%bnCyW41J4&C2bN4XlHK37b!6BYL!S*YGn6FuJic)7`a zVTIlZn{KbI<*EzGNxl2sm>>U5i1z#IUm0Dro=^>?k;j)hv + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFlOrAllAtomQuadOp< EOT > Member List

This is the complete list of members for eoFlOrAllAtomQuadOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + +
AtomType typedef (defined in eoFlOrAllAtomQuadOp< EOT >)eoFlOrAllAtomQuadOp< EOT >
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const eoFlOrAllAtomQuadOp< EOT > [inline, virtual]
eoFlOrAllAtomQuadOp(eoQuadOp< AtomType > &_op, double _rate=1)eoFlOrAllAtomQuadOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
eoQuadOp()eoQuadOp< EOT > [inline]
functor_category()eoBF< EOT &, EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
op (defined in eoFlOrAllAtomQuadOp< EOT >)eoFlOrAllAtomQuadOp< EOT > [private]
operator()(EOT &_eo1, EOT &_eo2)eoFlOrAllAtomQuadOp< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
rate (defined in eoFlOrAllAtomQuadOp< EOT >)eoFlOrAllAtomQuadOp< EOT > [private]
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoBF()eoBF< EOT &, EOT &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]

Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_fl_or_all_atom_quad_op.html b/trunk/paradiseo-eo/doc/html/classeo_fl_or_all_atom_quad_op.html new file mode 100644 index 000000000..44b696523 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_fl_or_all_atom_quad_op.html @@ -0,0 +1,63 @@ + + +EO: eoFlOrAllAtomQuadOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFlOrAllAtomQuadOp< EOT > Class Template Reference

Quad Crossover using an Atom Crossover. +More... +

+#include <eoFlOrQuadOp.h> +

+

Inheritance diagram for eoFlOrAllAtomQuadOp< EOT >: +

+ +eoQuadOp< EOT > +eoOp< EOT > +eoBF< EOT &, EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::AtomType AtomType

Public Member Functions

+ eoFlOrAllAtomQuadOp (eoQuadOp< AtomType > &_op, double _rate=1)
 default ctor: requires an Atom QuadOp
+bool operator() (EOT &_eo1, EOT &_eo2)
 applies Atom crossover to ALL components with given rate
+virtual string className () const
 inherited className()

Private Attributes

+double rate
+eoQuadOp< AtomType > & op
+

Detailed Description

+

template<class EOT>
+ class eoFlOrAllAtomQuadOp< EOT >

+ +Quad Crossover using an Atom Crossover. +

+ +

+Definition at line 46 of file eoFlOrQuadOp.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_fl_or_all_atom_quad_op.png b/trunk/paradiseo-eo/doc/html/classeo_fl_or_all_atom_quad_op.png new file mode 100644 index 0000000000000000000000000000000000000000..aba21efdf69cdff0b39229b5977b40f762270aa3 GIT binary patch literal 1756 zcmbVNe>Br;7+*IfbvH-R4=rw|bXCkSjBdHYK}wp9n_(h9W3ul|jNE?iDspeq@ZCaT z#~2lv<%+mbY%@QXALEK`HMx`WYsIeAx&3kP{ik!@=kt8t=XsxV-sgQj=e((&9xl+e z`fDK&2-MBh2?K$A6T8G4G*&KQ4%>KY$!+#LjCEG4)k{>ZZph0E{B?;fTSG$wwNX8` zv|T~Qcz8j6lsylHKvt97oE)%c7!%AkQYl*3xqygkcHPiilagQho`z~2+@U^uXOrvd zph~GsqsnJ}%f<|#s*L6jJJfaKjhwK1v3dk=c)r0Oj&=6O`iv|#K3AVvSY%^4pV9jPFCx~t`MMB1qQbaSI zt!X+cCCQqrt&PKoo9nCY8wH;;HDK6M+b1dq82960kbx<2ib13S)w04P3rS` zXA{@mrI`+c?M>7Cb4Q3aV#|2lPg6n7w!-bLZv5$vdPtsI9}bfabi*HMKupP{X2=h)Y#>THC`u?xYG}Q~x5%)P4MFmc+f{sMM zphto5Gr5jUU2y$HPr#8#S7YZz1wc`9{UsOf)HAnTYOD@`f!8b zh_*T1)GsgvnwX=yW>6b~2zX&=Rd(swM;-WS8+qwyF8ySZ3 zcZu2Cs|z_KW)9vfzL1yjL{F3vD%cfmqL#ot} zqmf8CbeEe5^Tp-Is(Ebif4@7nF0yzT9rEq+ks$1>>(F zD8MG^9NCW2oWi|Lxq>(^3q(8Si{NVo1z!o+=yDu}+=(+Q)Vq54bJHjq2?vah+4ORt zmVu}0Yj-8JICj0d_kdO?e~`(N1OprE*gW9^`2G`I zCZ3b9azS4@v&S0TYBRuLTK3cs{#qm6*|If@AvO$1=LyGM`MbsWzG96g?;eWeq%doD zjBo)XX!NUnN5%mZ@|9>}MENPOZ*V8_^=K}0o4nJSi;cGh%A1dal{@N4&JJNHar01a zj#pPg<>-bf==aM6OY;Rqql}8#%RJFl99-^eziZd1p9QxU zDJ%j?Q=Z)f-vXz`Z738>bQaU%!#FR2m|h`QpF literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_fl_or_all_mutation-members.html b/trunk/paradiseo-eo/doc/html/classeo_fl_or_all_mutation-members.html new file mode 100644 index 000000000..79051bc29 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_fl_or_all_mutation-members.html @@ -0,0 +1,32 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFlOrAllMutation< EOT > Member List

This is the complete list of members for eoFlOrAllMutation< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + +
atomMutation (defined in eoFlOrAllMutation< EOT >)eoFlOrAllMutation< EOT > [private]
AtomType typedef (defined in eoFlOrAllMutation< EOT >)eoFlOrAllMutation< EOT >
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const eoFlOrAllMutation< EOT > [inline, virtual]
eoFlOrAllMutation(eoMonOp< AtomType > &_atomMutation, double _rate=1.0)eoFlOrAllMutation< EOT > [inline]
eoMonOp()eoMonOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
functor_category()eoUF< EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
operator()(EOT &_eo)eoFlOrAllMutation< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
rate (defined in eoFlOrAllMutation< EOT >)eoFlOrAllMutation< EOT > [private]
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]
~eoUF()eoUF< EOT &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_fl_or_all_mutation.html b/trunk/paradiseo-eo/doc/html/classeo_fl_or_all_mutation.html new file mode 100644 index 000000000..e5d6f4cd3 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_fl_or_all_mutation.html @@ -0,0 +1,63 @@ + + +EO: eoFlOrAllMutation< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFlOrAllMutation< EOT > Class Template Reference

applies an atomic mutation to all the components with a given rate +More... +

+#include <eoFlOrMonOp.h> +

+

Inheritance diagram for eoFlOrAllMutation< EOT >: +

+ +eoMonOp< EOT > +eoOp< EOT > +eoUF< EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::AtomType AtomType

Public Member Functions

+ eoFlOrAllMutation (eoMonOp< AtomType > &_atomMutation, double _rate=1.0)
 default ctor: requires an Atom mutation and a rate
+bool operator() (EOT &_eo)
 applies the atom mutation to all components with given rate
+virtual std::string className () const
 inherited className()

Private Attributes

+eoMonOp< AtomType > & atomMutation
+double rate
+

Detailed Description

+

template<class EOT>
+ class eoFlOrAllMutation< EOT >

+ +applies an atomic mutation to all the components with a given rate +

+ +

+Definition at line 45 of file eoFlOrMonOp.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_fl_or_all_mutation.png b/trunk/paradiseo-eo/doc/html/classeo_fl_or_all_mutation.png new file mode 100644 index 0000000000000000000000000000000000000000..1156fb0db167de7af7717088f0002b4b029d7d1e GIT binary patch literal 1493 zcmZWpc`(}v6pqycEoxGghS-X;rJ+?<6BHp#*3r6(XdJsN(dxS6N>{oitkf~IRgrDg z(o#pItUE(hQb$Tkl{nh|NU5+AR3vJ%`)7CN9p8KNy+7W(Zyv?V1EZ`2RRV!P%5JXc zOCXTkx(qY-$;;xRJ4Pr=5U(G6ocH$jWN>efNvDSt$k2bzWHQrw_W)TbmvG6$8+2iD zG6DqJPjEv!_@tBzXv0OdCP!{P_ZY8>vaDO@G5z_xg4&hfg)RH9{XJ-FN4=S~HxRO` z<1xXX|m zvna!6^S89=GEXCPclw~y$+-!4J$z&RXN4e#zjTWmyvR6lV3y9Ed%tttSpcRp6S8h4<`YMG5jMD_GZy%9~f=6_aO6l5`UvlLqlbl7osT z`Me^=uD{B$Sutb9hH{z+5p=iHv|B2b3gutWLfA8?w^fS3hm)vl=v9bT+tP8Tnm?0Q z;@3i(PPCRZ82Dc=L z__6C*JaM{{-MEN|;?N`uWvI}KJ_ON-#^w{X`;*=qrv4_&TXH6UoN8*C8Ht~lCd81k zGzGmc%#dD{W7T;AoiK@{jm{70L+4LsQdCy?-1hl$O92Ce=*2W2g>CsGfqMvhA0*(P z$D)+8DCu{!1m1j~U7yC$#Bg=vs9x+>h%rP=^f4x`BLN>`(yG*>1k26or7Jq(e)+UkU9~Ul6(+&u%O<01lO8YNyXtk35DFAZ-hKmtR6%R$Z?cBA2Pg(Dfq! zfRI4LQR9m#>~$AwxT!I`r$k1`k^0HlI>Ml+y3m`f*s4?P$Ykl?We85xg0^^Ln5Pdy8sDbr03I9Q6S{vI%Bx4^8LyT373 z#n+b>f0{rMlO6`e1EAIW44~1#6PrMwmUrOlU_u7E^#Gg5ij`EOTNhbQF83sU7JW3? zgqFClsJJ3Wnh6(Pf(s=S7DY?VW=gi;PQ~82M@pt*n0Mo{!fCOscVo1Ism%uk%(wda zzoND`YysP&6V-C6<5sho-8r4(TOw!RX$!qUP_mRV0T0tAW~ z55xjP(zD4o&p6d9>GQo91YQ3D;7VrS^;h`Cn9r S0?K4R806;cfv$H9$@&LJ&;hgn literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_fl_or_k_atom_bin_op-members.html b/trunk/paradiseo-eo/doc/html/classeo_fl_or_k_atom_bin_op-members.html new file mode 100644 index 000000000..2c22a8478 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_fl_or_k_atom_bin_op-members.html @@ -0,0 +1,32 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFlOrKAtomBinOp< EOT > Member List

This is the complete list of members for eoFlOrKAtomBinOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + +
AtomType typedef (defined in eoFlOrKAtomBinOp< EOT >)eoFlOrKAtomBinOp< EOT >
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const eoFlOrKAtomBinOp< EOT > [inline, virtual]
eoBinOp()eoBinOp< EOT > [inline]
eoFlOrAtomBinOp(eoBinOp< AtomType > &_op, unsigned _k=1)eoFlOrKAtomBinOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
functor_category()eoBF< EOT &, const EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
k (defined in eoFlOrKAtomBinOp< EOT >)eoFlOrKAtomBinOp< EOT > [private]
op (defined in eoFlOrKAtomBinOp< EOT >)eoFlOrKAtomBinOp< EOT > [private]
operator()(EOT &_eo1, const EOT &_eo2)eoFlOrKAtomBinOp< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoBF()eoBF< EOT &, const EOT &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]

Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_fl_or_k_atom_bin_op.html b/trunk/paradiseo-eo/doc/html/classeo_fl_or_k_atom_bin_op.html new file mode 100644 index 000000000..a794d3c4e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_fl_or_k_atom_bin_op.html @@ -0,0 +1,63 @@ + + +EO: eoFlOrKAtomBinOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFlOrKAtomBinOp< EOT > Class Template Reference

Bin Crossover using an Atom Crossover that is applied to a FIXED NB of components. +More... +

+#include <eoFlOrBinOp.h> +

+

Inheritance diagram for eoFlOrKAtomBinOp< EOT >: +

+ +eoBinOp< EOT > +eoOp< EOT > +eoBF< EOT &, const EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::AtomType AtomType

Public Member Functions

+ eoFlOrAtomBinOp (eoBinOp< AtomType > &_op, unsigned _k=1)
 default ctor: requires an Atom BinOp and an unsigned
+bool operator() (EOT &_eo1, const EOT &_eo2)
 applies the Atom BinOp to some components
+virtual string className () const
 inherited className()

Private Attributes

+unsigned k
+eoBinOp< AtomType > & op
+

Detailed Description

+

template<class EOT>
+ class eoFlOrKAtomBinOp< EOT >

+ +Bin Crossover using an Atom Crossover that is applied to a FIXED NB of components. +

+ +

+Definition at line 92 of file eoFlOrBinOp.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_fl_or_k_atom_bin_op.png b/trunk/paradiseo-eo/doc/html/classeo_fl_or_k_atom_bin_op.png new file mode 100644 index 0000000000000000000000000000000000000000..698a474506df94148a87b8d6915c844b4a70c5a5 GIT binary patch literal 1972 zcmbVNc~H|y7EbWM0TFjN0&>YfLKp-zg2?D{4S^5{Mi^mOMNtAQM+l2t;YMWTP>vr_ zgoHy8ErkFA0YbP(ke}fw!~sIM)C86zFa!l+glu%2v1Zl-hNDcylC^%v4-5?N|KB?WgdzW-xa!Q9v7d5=gPiTomA~hwF&eBq!T&eYWbar;e zbxU~CEi}T-)g59pH|`IC$YP!BZGVcP321Df+~FV^ebO#C6G!i|K6+VluyVToyVn~AeU>R>uKpKGqOs)v^o;YoFeTl#A1f#AREbT10X4eXlta~O(dRVx zSes`D45sI5|@$;QxjoI70yFDA( zyt|+$@Q8@Gl*#{Y4CYsOBskn-aGHQqtdVNXJyRO}2tU=*BWVZNcxgO3r^+*bDWt^#?ZIdH84G3^;S zU}DurkB(2XKn(fltgOv$-2g(?HJF|;J1>96CR*er4dv;3rUFnr3iA13H}WrtuR^Y^ zZeu!4Xu-0zepOnXvSkE_wXa~`C@m?-@i!<^v`$N+C@ea1&&@!w4xJi0zlS2#A@E(& zqm=#0U-BL8s2T0~nVat4I|0>9c^UJt?)@Sb#--=m90X0SD!Iiu*_27r;>)oU}q*oM{ngYEOdSJ z8hd=FPL|7nOVh-JbXJF!&{rFyZC6?#6t%nwWNj&35p>J5{HP~AQi_1MnR7jR)F+sH z8?o7n1ru($8NKC=$%O3JxnIO#-5B0wBpAkoQ> z5o{M%GMBDjAX9C~Q6%Ms2xmR`Zxq-~`tt|EFFLNpCjbWeo8E@`tcbs#0OX-#1H5~= z;E$rQO_fl8;bAyzs30pP_p~w_Jt#9(Nc*-YT9;z(H7U?F_bM?hKDOHWM9Qt@7lGCw zBZ3|5@C@7doy-I#kwL%6aT?%3n~OsrBOJ{iaWaz$BY?3!DYc;@D$DC zB9D1TY$7ha16U4#EfpQ{hgE?YP5!XQ2r*fRVvRS1$Ejf32gKgu6L=vJDbkh7Lz1%Z zYZ1^_JDSO}aqv|c>q!}@a(<&efP9h|gJC6hK&nGY@&6l$Kjr%sfj>0(2{MtDgCda# z)A@0@PdTmbc&5WcB&GPQ847)G`R4sRLpi?ytt2-7>~%V?l{0t0=M(bulo0z5j8rZx&KbH zwC0k7N9@JKk*)2y3d#WPW1yj^Yt$=H53Vu4`HI%P*cgaYf;ZuEm%nF&8Pk|hZKu=C zgi8^=2v)x;Fg4R`iQN!4!&pT}j*Ig6<=BlPk3!9mp`GizT+l8YspiRllOlCzJF)I) zk`kizpSxJm;m7kyL~oR3UuF}tj)(9NR3NfAdxC`uyyfru^G9|M&Mfo?dgpJSCKq}? zAfp0cvDp|fS V3m<9*2Blvt#0l+cUv1}e?Z2QIvX=k= literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_fl_or_k_atom_quad_op-members.html b/trunk/paradiseo-eo/doc/html/classeo_fl_or_k_atom_quad_op-members.html new file mode 100644 index 000000000..598045353 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_fl_or_k_atom_quad_op-members.html @@ -0,0 +1,33 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFlOrKAtomQuadOp< EOT > Member List

This is the complete list of members for eoFlOrKAtomQuadOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
AtomType typedef (defined in eoFlOrKAtomQuadOp< EOT >)eoFlOrKAtomQuadOp< EOT >
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const eoFlOrKAtomQuadOp< EOT > [inline, virtual]
eoFlOrAtomQuadOp(eoQuadOp< AtomType > &_op, unsigned _k=1)eoFlOrKAtomQuadOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
eoQuadOp()eoQuadOp< EOT > [inline]
functor_category()eoBF< EOT &, EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
k (defined in eoFlOrKAtomQuadOp< EOT >)eoFlOrKAtomQuadOp< EOT > [private]
op (defined in eoFlOrKAtomQuadOp< EOT >)eoFlOrKAtomQuadOp< EOT > [private]
operator()(EOT &_eo1, const EOT &_eo2)eoFlOrKAtomQuadOp< EOT > [inline]
eoQuadOp< EOT >::operator()(EOT &, EOT &)=0eoBF< EOT &, EOT &, bool > [pure virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoBF()eoBF< EOT &, EOT &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]

Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_fl_or_k_atom_quad_op.html b/trunk/paradiseo-eo/doc/html/classeo_fl_or_k_atom_quad_op.html new file mode 100644 index 000000000..21fcd815c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_fl_or_k_atom_quad_op.html @@ -0,0 +1,63 @@ + + +EO: eoFlOrKAtomQuadOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFlOrKAtomQuadOp< EOT > Class Template Reference

Quad Crossover using an Atom Crossover that is applied to a FIXED NB of components. +More... +

+#include <eoFlOrQuadOp.h> +

+

Inheritance diagram for eoFlOrKAtomQuadOp< EOT >: +

+ +eoQuadOp< EOT > +eoOp< EOT > +eoBF< EOT &, EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::AtomType AtomType

Public Member Functions

+ eoFlOrAtomQuadOp (eoQuadOp< AtomType > &_op, unsigned _k=1)
 default ctor: requires an Atom QuadOp and an unsigned
+bool operator() (EOT &_eo1, const EOT &_eo2)
 applies the Atom QuadOp to some components
+virtual string className () const
 inherited className()

Private Attributes

+unsigned k
+eoQuadOp< AtomType > & op
+

Detailed Description

+

template<class EOT>
+ class eoFlOrKAtomQuadOp< EOT >

+ +Quad Crossover using an Atom Crossover that is applied to a FIXED NB of components. +

+ +

+Definition at line 84 of file eoFlOrQuadOp.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_fl_or_k_atom_quad_op.png b/trunk/paradiseo-eo/doc/html/classeo_fl_or_k_atom_quad_op.png new file mode 100644 index 0000000000000000000000000000000000000000..07da3a3902cfe640d2569249669d34118e88f18d GIT binary patch literal 1740 zcmaJ?4K&kh7+JEd!REVzI9lc|ivOM9%!XH-R*4Y+xx*$7as6j+1rJQAFOigUnR82nWg?@4+ zjwNhN9o1@z9XMWiIM-r+R@m^=Ho>^+m0ANf5lz?!Xd*C6fKM{LA4pnh5o_dB&L=qR zelhiMdwE~URLkDNI{J>X(o215)6eKa^*pj^f{~LqS%}7P4JZ|+k0tP0$!0mc<#{{= zRaz|#A=47CwPxB}5hR%xaoy+wDA|5TpPxJ&gosp!35F(_f1(KM^Aa~U&5(Ga+Bt*jy`aGcRdjW8O{=2a!?NMthP z@oJlO#MDkEawzf=krN$um-CRh1y2&wup6LY6S9Aufvn-<171`o3&cmylx2HBBD#4@!d+zhkE@L510`E(kY~pyMrRO zLSz7(nPm~c;ui!lb7=}{%IpQfGG&UoO_ElY4m_61SK?byr9iRXQ1T@Mpx9pA4=$*5 z5;ct!W-d*@SUk z4Bh0Tv}uKKz&j{i8KgTXZr3Nw#v6^P5mq+@oDvpP86V%T6}{Lr?Ky`Z>M7N(GC5xZ z&%sfA2k!hY2)jk1K+R4gpX9t*(WSu8jUb;0P*^+Av+aw@KTLMvAP~?K@2h5>c2&?r zbwGY+auC}U9@vnxiPJf=@47<=(`}RfS}HHI&^Y}r#xQGFn{RkMheQ!t)BHK-FAD~W zH^|I_*_Z8rBwn3ui0RI(HO-B<6WY^c`CiaK9r3Ehkz7o@(lkb&$oUYrjA!Xu0yfOW z8j%No25Xu_#U`yp)**abH+~Ll2KG?gp|4B}R>%D))#ElqZIKs1F{@0sBF zk$A*c@P6x@-%0C*Id-=i3Du@4CI_Zo&O`Nb{jtL*%h1VR+^CuPYWaP3v{%)rYZQde zSn++_i9{fHPGdNBB;~Rl?;bC7F7rB-(3TFsijQN5H_==Bz7d4`Y5%+FPLMQUK2RW>jB zitFFL?5kV;Q5An9vst2w(`o4+Th+sREChd5PV-TbD2r@8u2rA?diLIJ2ir*xOzfSF zZx1f7EwP!1$nLpNd0_=NEnioyvE=a1QSLA@ceAL0KJrU;C%N3#eq3f7!ZMErZfbCX z3=4d*1}uv%-Qa*DoCx+=ar3I9U5kMY8;&>vhPfAbR;1xND0wO5Ch!BJj+W8X;j%W} zEvCJW7Ueu~VIgjYc4Ln5`3~Y#5e0z{zx%UIKTrb2lTx3&<|# z#V{jekGVJYG(v=ZA1Goiw?^I}GW#HN7la3LSBqWC*Goc0J$^-o9r#xp1*-`VKGEK{ yL+Zz0r-MN(P_~RQt + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFlOrKMutation< EOT > Member List

This is the complete list of members for eoFlOrKMutation< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + +
atomMutation (defined in eoFlOrKMutation< EOT >)eoFlOrKMutation< EOT > [private]
AtomType typedef (defined in eoFlOrKMutation< EOT >)eoFlOrKMutation< EOT >
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const eoFlOrKMutation< EOT > [inline, virtual]
eoFlOrKMutation(eoMonOp< AtomType > &_atomMutation, unsigned _nb=1)eoFlOrKMutation< EOT > [inline]
eoMonOp()eoMonOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
functor_category()eoUF< EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
nb (defined in eoFlOrKMutation< EOT >)eoFlOrKMutation< EOT > [private]
operator()(EOT &_eo)eoFlOrKMutation< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]
~eoUF()eoUF< EOT &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_fl_or_k_mutation.html b/trunk/paradiseo-eo/doc/html/classeo_fl_or_k_mutation.html new file mode 100644 index 000000000..d337aba58 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_fl_or_k_mutation.html @@ -0,0 +1,63 @@ + + +EO: eoFlOrKMutation< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFlOrKMutation< EOT > Class Template Reference

Applies an atomic mutation to a fixed number of components (1 by default). +More... +

+#include <eoFlOrMonOp.h> +

+

Inheritance diagram for eoFlOrKMutation< EOT >: +

+ +eoMonOp< EOT > +eoOp< EOT > +eoUF< EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::AtomType AtomType

Public Member Functions

+ eoFlOrKMutation (eoMonOp< AtomType > &_atomMutation, unsigned _nb=1)
 default ctor: requires an Atom mutation
+bool operator() (EOT &_eo)
 applies the atom mutation to K randomly selected components
+virtual std::string className () const
 inherited className()

Private Attributes

+unsigned nb
+eoMonOp< AtomType > & atomMutation
+

Detailed Description

+

template<class EOT>
+ class eoFlOrKMutation< EOT >

+ +Applies an atomic mutation to a fixed number of components (1 by default). +

+ +

+Definition at line 82 of file eoFlOrMonOp.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_fl_or_k_mutation.png b/trunk/paradiseo-eo/doc/html/classeo_fl_or_k_mutation.png new file mode 100644 index 0000000000000000000000000000000000000000..7e10ffa11c0c1a1f76760cc3cde9386f3ac35471 GIT binary patch literal 1502 zcmai!e>@X-7{`aYobqEyIxHgXB6RXQhBo9!BR`VNj~vyZsSS}f&aPO6jYP;qB4eV< znyB4%wGmc1OvAc-+eEh7h^5-C`?G)U_4+)|^M0P!^SoZqKhHxBLHlWI8EHWv5N-dx zs89$*?Y)ZGt29(zw9ikb3Y$WL!hMuVr3#fwHjNffQPF?KX0vntR0371mL7@@gLsMf zM<9^Z>HaA1@T{8ot4~U&t=65JuWE^nPCY1)t2Z5q<!!)P_fTA z&)wZH;vM1h!7pp<-&hq++@}4DZ8F(I+#<1jyj>m69*;!dah8c)_EZLT(HOXRKw%|{<} z2w0DSNYE{x1nRc$6z4E)nG`w!rY595sZ6Sn{KSfq8q+Q~5mAh%X-kTQDh!M>M#TnV zKMlrFjA>GC1rDLR#5$?GYgxh_`lIHPmGM6ct8XK&8jLDtU5!tNl6 z%)%NjxrVFT_l!7eLZ_)abz^N4EYVqgrg$|A&k}XtgtM1FiTA&%-|QoDR+XWCF6KNs ztFYV!njJgn)A|>gD^LD9fvSzfL#M?p3ERLw=26#r`w96J9AJUA!bL&O1l!iCqszRo z@VKOZxE0j-K4I(f&p6M{KS&xl=8N%}(1c=bk!9p~=B#-{^5rE(%EA(`N^K74=#4}i ztsa^l#|VQZ!@TP;)1=AdTrzQw#P>i0X$wYyIpn@oXgu&z{)R1%mO0RZ=_5J?;4vG1 zhOw_DFiI*n>k{7Mk@(o7AN5xzQ1KZhiyf0wytKmk+2g;`baFhMGwQ;OJfQ+)k@TL) ztf}x}%&wIpP=Q-~Q2MEA#(AST9A^%fmE&?ZW28+(9aVvwZpzYj;J>$UEUoA(Zh24k z?EyZUciNQA7;NtWSr#T#u>m!*k@XwYygfkGhKem0t@kbLu`=*S(BBWHAJA4zV>DQoL9_Mt=ThMHPqk-9U>^ymPKGeafzxBx z8mx!wNZ7K~YJaZ*YbJ9RJCD2m@Ia@H(ONNN?7&LZd*r=wL$+|S9(Hc?>G2M!O;Z$< z@C1-nNszdXw~cnMH#Bd=Q(#FYQxa01$q=VKzz;x3au!BIEnD2@<9{!vV6_zQ0()T9 z#t1S?JHu#-pJ}_7v=tAI^hyuxt|^KucS1-%0IgxWgy_nl cnue4b&>b3g-)a`bsh%;!-v^Ci?1|6+7iI+Vz5oCK literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_fl_or_uniform_bin_op-members.html b/trunk/paradiseo-eo/doc/html/classeo_fl_or_uniform_bin_op-members.html new file mode 100644 index 000000000..19f21af4d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_fl_or_uniform_bin_op-members.html @@ -0,0 +1,31 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFlOrUniformBinOp< EOT > Member List

This is the complete list of members for eoFlOrUniformBinOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + +
AtomType typedef (defined in eoFlOrUniformBinOp< EOT >)eoFlOrUniformBinOp< EOT >
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const eoFlOrUniformBinOp< EOT > [inline, virtual]
eoBinOp()eoBinOp< EOT > [inline]
eoFlOrUniformBinOp(double _rate=0.5)eoFlOrUniformBinOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
functor_category()eoBF< EOT &, const EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
operator()(EOT &_eo1, const EOT &_eo2)eoFlOrUniformBinOp< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
rate (defined in eoFlOrUniformBinOp< EOT >)eoFlOrUniformBinOp< EOT > [private]
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoBF()eoBF< EOT &, const EOT &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]

Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_fl_or_uniform_bin_op.html b/trunk/paradiseo-eo/doc/html/classeo_fl_or_uniform_bin_op.html new file mode 100644 index 000000000..47fa5f6a6 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_fl_or_uniform_bin_op.html @@ -0,0 +1,60 @@ + + +EO: eoFlOrUniformBinOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFlOrUniformBinOp< EOT > Class Template Reference

The uniform crossover - exchanges atoms uniformly ! +More... +

+#include <eoFlOrBinOp.h> +

+

Inheritance diagram for eoFlOrUniformBinOp< EOT >: +

+ +eoBinOp< EOT > +eoOp< EOT > +eoBF< EOT &, const EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::AtomType AtomType

Public Member Functions

+ eoFlOrUniformBinOp (double _rate=0.5)
 default ctor: requires a rate - 0.5 by default
+bool operator() (EOT &_eo1, const EOT &_eo2)
 excahnges atoms at given rate
+virtual string className () const
 inherited className()

Private Attributes

+double rate
+

Detailed Description

+

template<class EOT>
+ class eoFlOrUniformBinOp< EOT >

+ +The uniform crossover - exchanges atoms uniformly ! +

+ +

+Definition at line 136 of file eoFlOrBinOp.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_fl_or_uniform_bin_op.png b/trunk/paradiseo-eo/doc/html/classeo_fl_or_uniform_bin_op.png new file mode 100644 index 0000000000000000000000000000000000000000..fafa92a812f4db4b1acba0c6b576378153b86649 GIT binary patch literal 1957 zcmbW2c{tnI8plIwJSghYqLxxg(5g_vq_i@vjN}Sqt1^~YB07lCbg{(Ns%zR5X`&&j zXq9`7ks7r{(P-z1{;X3fY7$e+&r*?zkuIoCZrpo&pU!=r`^U^5=bZ0(pYxpap7;5D z&$;5~>!q!^R}%t(Xyb970T77l6Q$qLVB|*#!YULBrBo>RRaH?8rTSOn z^ZB$#3Q##!ITzp?2*E5oCqp3WZg|hng3>Ca6}`-cPj_NZ_?#4$6;3#KtR^fJguJdi znVr*=WDG@UIA2H2RGzx!%U9W`4zA#Mwu|sv4Fw+dmHkUIc75$RM^I^iE@~%ZE8QX# zg4+XOs@d4{P<427mopM$ru5U^*A+h07xr(8y;V}>MoYt)E3l#WMzMV+lFI0*SU2fh ztmL|T&hsA{hcZ_5fOKr49x!(?JJiD^^_z>uF;mDK_nt5NVa3Mcy-abDV((nrH52gy z8}@+aywE|KbLNRn&+p80jau2&u0!tf(3y3IIkJyhGu3l;Ww0OUV@0)Kub_7x&YI*# z1A-~adml;L+GBE#uNNQ~x|J-*alzH8ca0w@6iVeet6ISK;UOLsm2sgd2hePK$`2`7 z*K`2E-JWjHk2NJE;@dvkf71sRCQAsIJ;V#BAg}F$TaV0^yAP1qTV;5}fEv8moJEMl z)ls9vd1VhB%u7}x`_q0(2Q2jsIZ2^E!#1MLIRx|d3_G~n0Nja3v*#p>tdO|}0ZY16 zAFyPdViv?9JeueC3k~Bq6+)2lOd7Cej6z#adg`4~1hH7-`SW*7yK7PC(1=xRK(I1^ zjqe&bLnlV8mnW4kl#J&G#_`yrjWdnKO`X%13ne5jAh4FTL{(FxS?8%~-)h`z=nOX8 zN0OKk7YYHl=cQJWriuV2CDW?C;4QK+AFR2uMdQMFMhrU$ObY_2Vwxd~c>DM0+{?1} zIKHjeTfONn(u}X3OH#?+9Mv1-DN2f_p_sKrp2Ftlv*NafY*mJxO62+u<$@1P{9X#) zj(0A3n>-~DkK`Wwu~cVT^HnXhLpAFqgp2v(p|ZeDeUZki8R^5ndRfV_2*H_qnd{^jn zfZ;Bi5^i>gqzt0`ICb$|7dSFO`a*Ph-@e4Ts^^4v%-A>^TV5^qfIaTT@S#tBTIB8ZokF2E-TJNrmBwj7b#8F}^ach0M`>x6lN00iIX&bA3}?p^6ncm>EFvS& zhADW!xf|bng>~}=9m;Np_32RWTG4vg^KhmJQ3_}ii}OJOKhB9aK%$l^fOhrBF^6NGkny7u)g|1`y47{PkHd`Sq5Enk{w ztO|=LJ7?D9UWJSvi@G<3?c0V4@k&0{-HF@4md>FbX7#=OZ9WT`gd1MH;P7>%Hf|4w z4hDXxy7Dntj|6HJ?X*X4vtiQ)t8lMvA}BA!TY}(Nh8^FmQE*Hb=ACPJ?EjEr5t>Vz zc|$q4Ir_Ol%`eDVlaIFkJyRc(wt=qoXu7rf_ZE8bZE2z&QR4&0$|LoFKrQ+OAt8CP zUz-Unfc3dR<-YNB@tG`fQu2#cuM{?nW|^EI1^c&4|c<$ z%y?!!!qpDlmiT20Rg`GV>;_xL!}jy$*%UhU`;o&i8W2%>!}M@^gWL)xV~K}hW6Lp- zN}H-B96o#cd@qW#UEG+b{S+jlYv@;QmX<}j2`*ciVy*%M`>*2|c9@qVDzMCZU?9IB zY}-n!J^?Bg8**`L>#=vATZF21t!n(+oFDo0PskC+jDL7PSU0*#uCpm&`8zvdZ&zHq z!?D$zCm9S8{B5jjPLr=5M{``s!G*}J8({@M=B<`&l9`stU-=c#=-CoDtgB*SJy;H#@U@ki%Y=2BOo>B(2XUc|8GdvkjRFWffgs(}G{%Z7z=xX_G_>0- zNL~hv93loaI}Q+jW`xW4uvfGM--f%lX8Hpy3I=F`#3nxh%}~5GZX}MoHEUlF0L!W< zv{z?m_3kFc?!nPtus(JE+lT`p5vS1zn3kzNQ>{n?P__A=Ya3&o0uA~Bn{v(_Ki|4n gi;%xO!~dpha(2%$=BWln`KLngSYJ=>@u*Ax1h6%cd;kCd literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_fl_or_uniform_quad_op-members.html b/trunk/paradiseo-eo/doc/html/classeo_fl_or_uniform_quad_op-members.html new file mode 100644 index 000000000..7ed4d9807 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_fl_or_uniform_quad_op-members.html @@ -0,0 +1,31 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFlOrUniformQuadOp< EOT > Member List

This is the complete list of members for eoFlOrUniformQuadOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + +
AtomType typedef (defined in eoFlOrUniformQuadOp< EOT >)eoFlOrUniformQuadOp< EOT >
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const eoFlOrUniformQuadOp< EOT > [inline, virtual]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
eoQuadOp()eoQuadOp< EOT > [inline]
eoVlUniformQuadOp(double _rate=0.5)eoFlOrUniformQuadOp< EOT > [inline]
functor_category()eoBF< EOT &, EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
operator()(EOT &_eo1, EOT &_eo2)eoFlOrUniformQuadOp< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
rate (defined in eoFlOrUniformQuadOp< EOT >)eoFlOrUniformQuadOp< EOT > [private]
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoBF()eoBF< EOT &, EOT &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]

Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_fl_or_uniform_quad_op.html b/trunk/paradiseo-eo/doc/html/classeo_fl_or_uniform_quad_op.html new file mode 100644 index 000000000..dfa3ab32b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_fl_or_uniform_quad_op.html @@ -0,0 +1,60 @@ + + +EO: eoFlOrUniformQuadOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFlOrUniformQuadOp< EOT > Class Template Reference

The uniform crossover - exchanges atoms uniformly ! +More... +

+#include <eoFlOrQuadOp.h> +

+

Inheritance diagram for eoFlOrUniformQuadOp< EOT >: +

+ +eoQuadOp< EOT > +eoOp< EOT > +eoBF< EOT &, EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::AtomType AtomType

Public Member Functions

+ eoVlUniformQuadOp (double _rate=0.5)
 default ctor: requires a rate - 0.5 by default
+bool operator() (EOT &_eo1, EOT &_eo2)
 excahnges atoms at given rate
+virtual string className () const
 inherited className()

Private Attributes

+double rate
+

Detailed Description

+

template<class EOT>
+ class eoFlOrUniformQuadOp< EOT >

+ +The uniform crossover - exchanges atoms uniformly ! +

+ +

+Definition at line 127 of file eoFlOrQuadOp.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_fl_or_uniform_quad_op.png b/trunk/paradiseo-eo/doc/html/classeo_fl_or_uniform_quad_op.png new file mode 100644 index 0000000000000000000000000000000000000000..03dec45900732add608bfad3e6d7feecd7b9fa3a GIT binary patch literal 1748 zcmbW2c~DbV6viW1L?}=}4I;|`l~|TQ*<*~Nf=Fc-s7rukfUpRG@PbhzMcWFph+BmK z4-rLCAz)dI4+}&vB9cTSBBX?b^&tl00s&Zv=NC<>loR|BSpo8E&o;iO*g{M#qS;xv7d6aqPplIBE>LL z*VGcF-FA9rERLgk@NC*6(Q`_m6)6^3Ao74q&UG=$5hYW6|pACbM zI(|b9jr1kHE+}_vLBZq@m>I~`5_>;hRWO+%hb#B&->MTq>D93L3TdJX$h`OtpQ;j1@V_G$5511Rl_&(G2GZN(!4&esM(EKO*q2!nqN{%MMTq!LJ?TgA z<+wBn2i&uuF{A}pO~wzH_d$=+mKY?zYAr0rrY^Vh9Qn2$Y+A}Ne=|APn>4FS$o-t8 zZfWQF8GMaxxQcOE1qdSKYH$ONVU(svnu2)zj^fCAnMzRhAlj||e~M@0@oAX1FI~!P z2TZD(Ll&fKpR^h};kW^vf0U9qvUe2{IsGJvhz`Krh977GaLtq)W77FcR<*~G-J?UM z3)kVuK>b5H9VZP#DZ|Gx1^7b6X_8QGEqkj5NP`8*hT8;XbL%R*&N{gKDy^V#Jz{mY z-JzVpbBcY^vY^NT6~N_TfS>WSSlurqX%GL_$B}| z#m@OsbagumqKo#?I<0GiHYt1(_~-BCp^Zi_wNES>j$U%K|MDTHIS!lz&Zll>@tFf! zU2UTwrh^{g#!qruY?q(QPU{jCKFv*jLKbLl+BO_^V6;`%^FXFdXm z{PS>&Q*qPMF6ylAzZ%C5HLl=(13JSxe0q2m&Xar2ca0ywsqbkTZ251&D>3!(4r+3=ahb)! zibwWOxmUxA$(TztnCsgpT&vo6JLPbRkg3|}lu}EZ&f$Z^Q+rFgi^VyRc-Bi=1gYc}|bvK?=VM8^Pb+_kh#}p>r}jT#-Dc zO%Cu{^g>(%VXHg%OyVxT2IV)%7YSzosmMV5sNR8BjIwUzMwZ}UTR1poj5 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_functor_base-members.html b/trunk/paradiseo-eo/doc/html/classeo_functor_base-members.html new file mode 100644 index 000000000..66852cce9 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_functor_base-members.html @@ -0,0 +1,15 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFunctorBase Member List

This is the complete list of members for eoFunctorBase, including all inherited members.

+ +
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_functor_base.html b/trunk/paradiseo-eo/doc/html/classeo_functor_base.html new file mode 100644 index 000000000..389309d61 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_functor_base.html @@ -0,0 +1,115 @@ + + +EO: eoFunctorBase Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFunctorBase Class Reference

Base class for functors to get a nice hierarchy diagram. +More... +

+#include <eoFunctor.h> +

+

Inheritance diagram for eoFunctorBase: +

+ +eoBF< A1, A2, R > +eoBF< Chrom &, Chrom &, bool > +eoBF< const Dummy &, const Dummy &, double > +eoBF< const eoPop< Chrom > &, eoPop< Chrom > &, void > +eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > +eoBF< const eoPop< eoVector< FitT, double > > &, eoPop< eoVector< FitT, double > > &, void > +eoBF< const EOT &, const EOT &, double > +eoBF< double &, const double &, bool > +eoBF< eoDistribution< EOT > &, eoPop< EOT > &, void > +eoBF< eoParseTree< FType, Node > &, eoParseTree< FType, Node > &, bool > +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoBF< eoPop< EOT > &, unsigned, void > +eoBF< eoPop< EoType > &, eoPop< EoType > &, void > +eoBF< eoPop< PyEO > &, unsigned, void > +eoBF< EOT &, const EOT &, bool > +eoBF< EOT &, EOT &, bool > +eoBF< EOType &, const EOType &, bool > +eoBF< EoType &, const EoType &, bool > +eoBF< EoType &, EoType &, bool > +eoBF< EOType &, EOType &, bool > +eoBF< eoVirus< FitT > &, const eoVirus< FitT > &, bool > +eoBF< ExternalEO &, const ExternalEO &, bool > +eoBF< ExternalEO &, ExternalEO &, bool > +eoBF< GenotypeT &, GenotypeT &, bool > +eoBF< PyEO &, const PyEO &, bool > +eoBF< PyEO &, PyEO &, bool > +eoBF< unsigned, Atom &, bool > +eoF< R > +eoF< bool > +eoF< eoMonitor & > +eoF< EOT > +eoF< int > +eoF< T > +eoF< void > +eoUF< A1, R > +eoUF< bool &, bool > +eoUF< bool &, void > +eoUF< Chrom &, bool > +eoUF< Chrom &, void > +eoUF< const eoPop< EOT > &, bool > +eoUF< const eoPop< EOT > &, const EOT & > +eoUF< const eoPop< EOT > &, void > +eoUF< const eoPop< EoType > &, void > +eoUF< const eoPop< PyEO > &, const PyEO & > +eoUF< const eoPop< PyEO > &, void > +eoUF< const std::vector< const EOT * > &, void > +eoUF< const std::vector< const EoType * > &, void > +eoUF< const std::vector< const PyEO * > &, void > +eoUF< eoDistribution< EOT > &, void > +eoUF< eoDouble &, bool > +eoUF< eoDouble &, void > +eoUF< eoParseTree< FitnessType, Node > &, void > +eoUF< eoParseTree< FType, Node > &, bool > +eoUF< eoParseTree< FType, Node > &, void > +eoUF< eoPop< EOT > &, void > +eoUF< eoPopulator< EOT > &, void > +eoUF< eoPopulator< PyEO > &, void > +eoUF< EOT &, bool > +eoUF< EOT &, unsigned int > +eoUF< EOT &, void > +eoUF< EoType &, bool > +eoUF< EOType &, bool > +eoUF< EoType &, void > +eoUF< eoVector< FitT, double > &, void > +eoUF< eoVirus< FitT > &, bool > +eoUF< eoVirus< FitT > &, void > +eoUF< ExternalEO &, bool > +eoUF< ExternalEO &, void > +eoUF< GenotypeT &, bool > +eoUF< GenotypeT &, void > +eoUF< int &, void > +eoUF< PyEO &, bool > +eoUF< T &, void > + +List of all members. + + + + + +

Public Member Functions

+virtual ~eoFunctorBase ()
 virtual dtor here so there is no need to define it in derived classes
+

Detailed Description

+Base class for functors to get a nice hierarchy diagram. +

+That's actually quite an understatement as it does quite a bit more than just that. By having all functors derive from the same base class, we can do some memory management that would otherwise be very hard.

+The memory management base class is called eoFunctorStore, and it supports a member add() to add a pointer to a functor. When the functorStore is destroyed, it will delete all those pointers. So beware: do not delete the functorStore before you are done with anything that might have been allocated.

+

See also:
eoFunctorStore
+ +

+ +

+Definition at line 46 of file eoFunctor.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_functor_base.png b/trunk/paradiseo-eo/doc/html/classeo_functor_base.png new file mode 100644 index 0000000000000000000000000000000000000000..b3ced603bacfddd7de555ee686d86cb4e14981d2 GIT binary patch literal 35207 zcmdpfcUaR|x9-fbP^2lKQeyxMA}|WlizX^Rx<(O|Hj01&LJPe*Ly3YwK#Edz2p}LJ z5JHDh1Ox;$G)XAZ5-9=cC6v2^e$Sn+oaf$q&biOI-alrKNsySm*Iwma?|Sp_vXKrq zr!ePFKmEk53td3{^wVzqPe1YT?cN2R=^xq+1OGdG+2Gp6?d@&w$L;Mu)6;(iKk?Jf ze}De@r{A0HG4Swbca+i9pU%-f+5Ys?k)L!goWJIsGCknnHm1^JJEiAPvSsln*Etx% z_{)=Kg9X@|{jQSU`->zO$v>ME9ItD^e@VO?k$0Yab$%0u^V{C!J+-Rk@s+!HnA!DO z`CZuTRkoocBDKb1{=tslUJ%+2ShowZSsbeLcxQ?|vn8^q{%Bikvt)a*&SPp-9&@(I z^mJX!PI(;gAyV9ezH_T%}`!r!G!#n*q_Ga79E7Cm+>DvkT{`Fz)39Idw zX06%VVwDOU&9=YeQyh}@;Nw_=hYWm^QxdsupLsKe2i|~8Hsi%uZ!7G9_iDg0@hpPhqqdu0K;n0SACPsna=BNF^Pgg+t$ z@g0x?KNYf@1M&NA`1#-QNB)nWexg9wUf6bVUKCe*sz}&VW|^__fdjs&7jhQ~iT!m^ zI79f{zpibiwXzm8M=IPNH|wd2L_$hP#q=;rdoTCa6z%ft@|JwT5vkm4W3$cR=zenI52L)oI6(l3-QAz_?~FQ zD&^n^MmpKzq;grM+Wq-qc}=)fayBwN!=e5l>Rs@qIxY5zpoo2e${VX&*GG*`^B=nf|IYdR<>`m2$dO2r@1@!2 zk9Cp4n>62&(Et+WUztxAJaf2oW-?3V#q4^P^WN39jgZ8kk299zYfHi9?9G?N$boW9 zBWSzIh~^g3apTJe(Nmb$U1MG}7A<=rcu zF-usD*3Bf%$}M%Rle{%;L9J?Snp-u20hc#!gyS9W!Yz0TW$P)U=RQ_TWa6ut6j793 ztLHtLQTqUe_e$DLzVxLlHkRl$zu+NlNMkYq@7M*e(D;)S)j4=fXcj@)lFx_E5{@-n zKvX0-Twpn+lDXth`O2pMSzJ!clXafE)CDqXs7^t;s7xPOcdjZSIYiI>nH_ z%#S(&FExzIBQZ|paY(02#bXJ7s**2H<|)xP8cfX8h-({aD2*mLc;?Z!@sE@JyA#N_ z%pMj>RxFp(78K}@Gu^vMTE|T>ySRgF)Xn|fJFNT{MS)upC&TRK=;NF0z@P9;bXa>g zo#_H@=_A}QIvr1h6a3^6#bDidPudS3@ZBE^){!#k<$uS$F97%6j`|N*e&-=A8=k-G z)9+Q{u|19&L-iHTY?Si)Y;EtC+jCq;5yfk+P}_?o$)P~+^3Jx=H@ANx8;e)*k&`z9 zAe)|1r)*l}ZLx{+sOWxMD9jBRd(4LE@#>2&mMMBREL}s1_wnM?*Jc>-3Uxeak@_?* zf`ih!trSLKQfcsV)<6L)WU;QWMofoF8%3#VNQ;Y*dzV&_gY3<;CU_>6P|cPM?+ZjD z^)j4V4=*1;ZXP#HOeegA|K5~vr6R}*_;K*hXfKsP-Qq~XBa$qp&6`gS;k_n2xaQFF zV~li7r7n@Hw}LFlA@G3qFQf8xb!G}{A3V)t?0;_63fsy>85ac2e?mepA!9$9C|WgL zQkJ=pvRIDfLf>2%zd%18ZJ7NfMY5(Xx{$J5I1#5`QSLomKuOq)H}#c0QE;f;8JB%@ zpit{`A*^aEB9El(J1aw7PW81!1kQhg0aMULR+f(%i!*nH+*LqBBTZXB!TY|#FzP>$ zuTg}LH$opF4W_lj#Jkc z?oxe`!U}$n1T2+QMAY`_iq7r>FH3?*QIukbVPmtZbHWtJg#!MZAY zKqgQuXD4DSNNuS7XELw91ebqK-)LM9l_@(>?HD(DF?p&jYNd|^C-AU**555?#4Wp~ z#w+*i+Ri<735ZsdJwr9D;&lDvh1XQ)Z2J2kg&f+~LtSj*ildYjV}85AuveRPnKjgI ztXS5rnHjJLhESl0PvE-ItX6e(=L)?0xVBcGGF+^VbGz+Vf-`cysj%cwtTsqH7jZrK zNkXINp@c|RcTaQv7V~!=D%O>7UFzsYhELp|KT2Gji|+h4)4Fil z6vYt#o;v!0vY6OZS7M-JRHDD|rFm&aE8z9i$??uZ+lJ6>X{+Sp1ntG31Y1wX!O-Wa zuf&_kVdKBlDh<9${?%+NC-@<$>rNnw(Fi>{_=q+&nVn%{=9s3lLz}XM%xSv6pZ__2 zvXZLLz8u+{Q#OoVk0-?e>^XsZCYD$4A0yD5)s2SQjlDV1%s+s~+a@^smq?6n&sKyI z3H4;*kRe$kG@Z_H-EOkWg^yFCWyo3tx05yTW35s7R;CZ()1*Q#{U9F>G?P4wXrX^L z(|t~w+LR+KwLaa+WQlErRN(6pP#tdUIWHl7Zs~NbSyKWNKR@Vno#5NMe$+AIGBdLQ z-;&J;@8UqKx_6}{!Vq^Z7EgifECNdypBI(hw8BOa`_m;WX4_-@RdsW%-njWh#cdU; z9$p(?7M1q*iV{eAEY%*fg~E2zNc&PT)>=dcaFMNfq;lATLS{s6CH9Wy_|k76hHlLb zm?XD)bj#nasJ7S7$&x>5Q7Y?kG(vi;mu=pJ+6x=9D6Q}vA-Z%gCvL6BGn_45E0@@U zi#v?BO|Oy|R^wjA#vpm*p3tdUaz?CQsQ`Ds`YZvqmM1tt2RYpKJ?d*?h{8v%IRx+H zBWniQQXk-*YS^2>I%g(z9Ypz#FPiRW?4VVT|71<`@87KVLI<3Q-3q?EsRqL2FUq~i zVzVWfe<*Zz9xhyi(C22*2dO7J&RVeLH!vNq%0!REl`rY`6qT>__0ROo`*%csVrA3_ zN=M+3G}f^5TC?KfJF9lBlcPuKQDLj49eR*L4DMQ!76~37IR*1rwdVZHhe~4?@=xQu zd506^P2dK(eNo23&w{j2oIG&fyqD|U0FKBV&utT!&+Bo~9+8V9oyqZ3HO`HfV7--_ z4>aR?*XvVzjHe7)DYg9RL-Y0+ilFrLcABT?!u$nY;FNirD?Bf@sFR*<&Ll(#O2?f` z!js)cN5jYTvEVHq)_l*{ajVSQv-}ARx0f6f^B=DBnj1o`=sydu0l7_=M|1&$Ic@V1qEO(22Tu4FPa!?reAh<=1kt;z~ zU%T}=7qgeYrWgau*lgz*0%7(FMAH~lD^JBc9^*tC?Ua`rAp~ytfZzUDu#Vc1BH1T; zBJhvcCl1zKywgx9x%6ldc^n%SVukw;6u1ArA^fGJdz%8EyJV&b>fUAoJTeel(>JF@ zRSM}k5B=lP5f*ohTDiW~9kMiaJD}EY+ogIz0XT;~{4$bSSpPNgYDq0`j**zAHiI8L z{Tx5}?wt}rW6@RYEQKrJC4781=C;_r3awh~ws+HfuLch9D9$^v`0r{1NKrEIKF3=*> zq4mi7;MUS@wd-f$dxC_>b6ZTj_(}8|yq4YK+&eFAR%KRuGv@m96d7f>?6B`ewf=NL zw1i}P48pISzs0xIxzQ!4J;ru^+9a83ff~snJKm18&}VgGz{Mm1?=%JZ>y5Xm`2sN?aO#kY)$Bh%Okg zEuha471|DQtL0n=;((_9a>sWBWn(P4dbJqW`8*%gXa`Z2P_0EwLcoDJp~+^CN|49Rzpw@w_w3g( zRn&$ThjeO*BD}jKm9{Q3CR6R!bG0KTp;MK-60N7}8ntK{3*11;1@I~e{$jXNV$b3JLPYA=0Kz$wvitFg`LT5-#q2ZzAGWZnk=?$E^`1U2Qemsq2 z;kZma)x0@S_WFLCg*tn4;{lX{c0k!2k(m%7o89)>3Mathwbb;Xz2wuICEFE4XlrBT zKx_*J^0;p;LMELKEH`4e(0(v=zoSz!xhC#-tP{0<-KW}W-8%0Nqj-Y_iG_ilqQ`T= ze6ZxL^{fXP-inUYQ3I;VB2}K@W`b;48EC7KBBWRBLyJf!d;O;FWZo1&J6(z%bWF1| z3#0bn`%$!zEd0o(xwvl9N>H=4@`>JT+`7h_ARalAg|| zJ}(QoYYl8eQr6~;$G{UUj)`b@+Yx=sqDREb-7apBeif`t^^?sf-wN4O=Ga=_!E?WbmD3Tw8PbhozGJuc3h z`MN5H1)Q453F!OS-W?!Hh8GyzieghQ3q+;aOJ}<U?VIO6}P~k+vejMk_OE5KgGRP>wR6DD0=TUR}4z(I4{E$WmU2$`Nl z3)m|O&ChIfNR>bn%@L<~(jfq@+u(6(f@ardzM3@nEX31ipj;Rg^00`A~-W zL#&i)D*!5f7gNgO4S4^DWvQ&GDW<5HsCmlfc15|pjK$eQ*ItLZ-;)7F$+!vCH{Cy5 z^y|1uvW$gmch*XjDXFYCrM+-XbYuJogK;){kl(%TcS%ICj}A0cL-t>8s;bbMUT>Ih zEgWaL91+AxdQ-<-Q0lL+AFf<|3(xO7mx`rF;<)A7P7e&2%%52E7XfuDZY=rXvnuek z%>y&+(CDu1nJfF?ka&#@33lAD%VO-nG@8;h!Wt(fc|Mz| zIqeVH{FHc0F-nabCDd2cV-Nk^-As*_nxZ+;lzhi?qVT>4NKgdSM)ehlEa1>p5t2h? zrAH&*^U$-`7j)u<-WSJ$1Wa(pje1!R+*rn*uztnMCY?Al_gE)BhT-v~?8SF{i$+ad z{t7TP8FI1l9crMZ*<|z5kme-c0T!r5XQ31f#a=5p?O=6{ZkXoD)D&!#V)$yVZ0aXb zrS-*O&rK7{{S>R9ip;?!dGS&fEa5u1+Cs8nOFtA_=NHGb19>)BfcjJo1Xfe1SZ9JS zmV5gnDfkBhtzP5F{$^f--kkd9*~d9*AL%bg8$>#SLY*Hz z&{4)s*DW=K)}GLkvgch<7}4ufEe4)-%!n?mqZz<0eud;Z%4HRbry2*Qr6$jUdx*r<-? zVt9fr`$*HPo&Uz~BvHlom;={ zs+x9*=^~%>>;j~egkOH#mke%w^AeAiRy{9liy^kn2Oy(g2x^DUm~%&PF>lBC_})#@ znCxXdzj8TI!x|mRoc~^la0lu3(KCmy1_lIKG>wl z>7%^b?_IXh-;O>S7LeFk`tjS9m%mN5)H~s)t{I_U7FLhl8mQ-m7fIAKWzeCeyEOOM zk{L$5Zj`*8s|J#Wy#;!X%}V&%;Bf7>B5VtKT2>ZSQIXoAcv=Q$D8%inN|oWlIdZ>yeq6 z#(K%bQ7+k_)v+A7GPtETASTC5TVo#gu={93aCCIPB%x>#-u*Lv*#5=cPsX9A6#5d+ z94^*+=3hN1JhCyP!Vg>lXDye(a*J!sA>guMdnky0;*~Dh{Wz_-ChQu;b?xT7E~NSFt_(Sem-Hh7)ZCvcX(JhQRH{Smn7vS$2(f|8+OBBAR@42gl+1jZ#TP(VBiCC+0 ztS|rS;E468z`5T3g!HLqd36A{l!XupYtNTTG-S_U781{P&Be||D~7uzf3Ec_ume85 z1l~|emmnx6Ec2miu{Y?*FvTOPy!D!4V@Y;_!k}grCM&h6^d4aAkYnOop6B@Ut|Rv@8{??|?{3(OHSW--&!XaTML*&RYO7pJrwXbe}(I8BGz zOw3NeyVQ5U6(uX9SQVY54`u}vbH4x+E1ecIF2TWFV)V21Q5m&e2T+HGj z7c|Hf8Rx45+Lc%Zc&uu)@~I!S{`PTzrU)dJ5ZR!F#-h;boU+aQs}vb` z_kvUBCuh>}5XJPB5CQW0CM?9@V<xcoaQ% zn>m#*?($O{*fu&qIv!vs6I1ARCy$&ft2BSRh&Ljzl6?~oSy$~heC;F}1ZwYT(?c+? zAdS$iN(VI~7SL5BVWDjcBmd1Wj}5I6XUmXg?~uJ^CwlfYBrc>}ZhxGNPgr=)sA_s8 zVK|Zs;xy;9Ot^0?e@jyLrJ~R-A1*pn;yshw#*oWwaX@%P=9vCkkg__KM~Zu>pc$4& zLUZ}pREZ}gaT{w~`VH?G7UJ&v@Z+nLjW%lmfLdIDCWz~6P0){+qxTd&f30ezy)Y47 z?_KMnnwRySXc#0qGm@k}e*B96>qM~i&G@7%(`^M>o}==TU)waJyR^k$!!3&*L(>~>?foId6dnxxl+7_ez0*N|hAT$wXI1%2qSA4jL!w_nYmxP! zIg!;gq0Nn%Bs&yljZ8rkxw5otg%oqune6TuVo_c@DruFmT*GeG+zHEr3cNy?d#o;+oRNB6ZcD?}`f|S}n zG|U|=$@0yL1hr}vWxlAAk~*it$M#-21yuEF>p09sNNJXRhjY|wAxyJWyQz2l`6>AU z@LIVicr6;V?W!a~&o~B{xsdsm-LErxhpCO~(+FSEckWRz^9VQJ01pO@gN427y_&AJ z^~r_pI$?rKQ|Fd?PWHLllwBUPfK(DP2$~ov&IOd7tIzzeka~(O;wnT9R(Q-y4ew3M zP`94EarKxO9Cihjw<5vCUw3Xp_%5BN17zgS;cJ#c1L_*lc*oUflGqP~Pj=u0Mpn<# zr|hN(r5+EG)gQgjEr}jbi`zV=pqhV~k0V(_J|PUUD8>I1ZQP01e>dm|!U^t`k5{}NNcIEAd;oQ#wa3?t1XXxcr`A?? z0z48qKd|SR*!CsRDA>xtuxZ25NN5Gn1i-rb6eEeKT#}FiYlCyljkzgkr@xc}AMSk0Y|J2ok^=bIhQj#ls=6`RO`NuF`(q=e2zii-6nH;fZP{CSDAmFS83XqkrIv^jOI3_Urx$Gh7`Af*-9Am4w#}B75t`t3N#L=K0 zvT=X4u2^E+NWY-K=r`V0FPxDAq8K!A+G8d~8A=2-DfNzg4>QQ;5K|as*d%`l9{*ea z#FeR=*SV#&eRkpojAd2Y`&f-pH%4Q*RhftM5D5_4C=Jhde+Ut1i5pYo>SKCZoU9*6 z7L?xXu2uA5pRoHLMFPKS4lV}_+7$Ga@5@O!#z1mXe_ggYL`LyoT2B*vlZd>{nT8d{ z*9kwTsq5%%o3{JbYU<=3|FF~?MTaWV3xoO@sdmbF8f-j|bO7}gmq)S* zIvXEtMGd`fkXK|LWwI#Lb8k+a zXrxKj1!0&0lre#5Sr9jdhnD-lcgnE z?^i7;i|?>tx3UI<%J`6=M~O1B8C#$Ga?L22icc7Q-uCs^>x7~-ZJk?Qo>=!>*)jG> z_GMBi=^!;2aGVVSyJ?<>jI8JiQ(DG{EZ4pWEX(i7lpH~U7P{C>hxmIF>OFA!n;Ftm z>-!n9fD$W7faOb!9Q|@1??_`u-}%uR=h2}8bX-9_wZ+cI(yFzo?KLACSE(4mP|2(j z>m+es8%)z*?{?lPGm_3vdqk%r!nfOZmFVwdYESYj21}MnGup7awUgl9`y3&h;g~;+ zGWY8_9X-g@m_FT=ybMfa`K7VIyyLsgxMg9o^-jL=5qHh5BVmA%aHd&>J8hHld2*T} zOYpr%wUsDD>P`_UO5lN?<4*q35emG?{9xp9B-%oH`z?Ot(Mq*M{E~yF5T}g`GuF0e z-974>sZ`x|)na`qE0;M!D6a>kwvMR8)!Xk%9*>zMl142-oKvgdHnn=!M!_y2V-@}nK1>u&b*qvboUrx$JvzNlNrGS|k2nL?je`#b>!P|?Oc{XT1d9EK=L`N-r26ZS0ygZe2xf=m@ixhLYENR9&9>+*4XwUQiye$OyNgDf6sb`W` zyx(CXM{is)ZR+cZ=H)MDtejeT7aRu@+5_0|ykWpH{0Coa@&2)7C|=tp8M5xe)TH9m zq#xoP)7W>oHdS7la{0R+muZk+Vd!q+R_PmSnt-B#`o?TUZs!{>^nkkbW(;{|(6hF1 z&zL&+B@3E2V{GS0SVEy})vlhTrkVFmiC1AvO;w$wrr;f{!NiFHFOZ#Ue9|y;>y-HW ztuJZjrES*zGE`h*L~QHDhQJOskaLyeH!gDZ?u*z=;{~TNrv$G6l zm4M%i#ce#Jje2G=QO<#&d!}&+CC2b(mmU-L*Oi)v@%2>nPw};Av?@jlS?C2EB`9-6 zKLUQH2v53QQXx=gj=RQ#8UI;}x2Kj1w0s9ow=01Pvx(I$thm40*Q+gOWZfZy;?5Du zGw+BYUtO&PUV$#Qi^S^B$`L;4fjIGSDK^TeEnGlP)DU_;D9PJf06f8f7{a&Udzy+I z+Rl%t&a>z%&w8~_I(=CYj$x}SEe?QubnjeDdQa^D+3)idEw;L#bJ(bB$dh~4++yFV zlJAPw*<%?VCKV~pRyuBLUrglR+_?oR(XG4yG3j!*U&nGWa=R@1YCkO~pEiGa)>({I zcR%>FGXz2PAS+cD zdCO|@+`CuIPi9Us>}WYq-;iGdbP%UIU4^f$VOV^tHMIz8jVir-E%;I7skY%MCUsD$ zg#?bajOFP42iN2Zt^{iG=H?mQw4QPDqq;CaGMe^{Iaj4spx2~3J?I8#0m^aTh{@i* zI&XcG0JKz6G9|Svn{XNCf)$Y=*LhrA2V8+h)XBN=3twiG0MoJt4zfFU+SM_eoPhi< zQ-OhVHPmu@W^dSHO;rUWNU?JhaP$;@Aw--#dc%n|gCKO6Jiw`7yHo)Z=^yOMmW2wW z=u3WzqRMM8;3|};pU0+}Gy$n?5G2R651uoE+w4q$AkEovr)W46;fuP&mFYO%Xo8FST6?$0*#xLUPWJ7SN;H`P&3$R}snPogXw>+WI{5 zDT$TzyYZWG-&R)j6Ujp#Wy$qf;xsFc4dh zNY&|&QOyTScZ-2bxEsEwx2{74ocVbOJNo1B%AcN)qEE8lRkkJc2!aoFLTbog@m^LB z=%_t~6Y!0Q10a0}uuG0gY3jO z^?my<&AvFAW|N3C(>tCn+4kY%BRFf@+g?ckI++gpggTg{+>cm~XQAc)JO%fU&;2*d zef5C3ul((QIW~BVqggdko03IpJ6#e9HiM(t%Krk?%RbQpTG*7YrK$LW{p9#g4Kq`v zRaF}0Kx~^7yuxGud|Q|(c@+TNw(gMCo^e6x<5+gI_xI*=QI+(;I9|+4Na-bHs-m-Q z9pWCEM*^b@b)Zi9y9DXSfgjrb#J^E{=UH|eZA)a@np5A+1%cafhS0gUjt5^|-p8Br zGswG;2sOh8??vuFQ*2f+AA0XZY@o#>_MD4QgHt%kLCJsfsn%*`TT?WdQ;-x>=BxuL zNh00kU@b;)*|P*iAN8Y(1S#NL50FjI`&@Kmat~UC3NXW0L@s|HH`=T^mL?hxXkwUE zIf6}p5$0P0o~5Q^ul=bIn&WMckwE0uf!Ml^#J1if^XSPT^hwp z+9QPny#W%ci*TE|M!jYvI#8PrW$1%z{t>QfdYzzgf$4rv#QfXtT2DLawGohJCnpXA zV$^;aay%H&rR8GWbwchcsu4O(%zVTi=82SPOzj3L*{X4j7EwzH~o zj^?32H7+n3&PPT+An?A%4J$yPTzz_kuyBJ~7&Vfu@D_a3g^;n@>zNw&syxr0XXOFs zSy$c-rDF*3f6p`y*JO;KJ*07h&G!W-L=MrReROC@lHhD^UYeh6u&eHmgFElh{|_GW z|DBn&moHa|f8zrDFK1DZ@g4a zw8>E@V*}Rr6hJfYkw%7wSAhRB*uQhRTO?x^o@2tkm)aR#U9rW|IHl_Zx$A^kmz}6$ z2BHebKS!1SclPXmy-y&vlns5h6QZ!D)Qr-8VFcJg!CqagOU z>nMOqd|$aD7!yd93eenX^-VHc>Y-%;0Nl4@P~|z8km`CaqFjciIei{ zL4qa)FAd)IPuW|}+4^R8Ge1Htw^K42-YxhLFULo|l4?h7Cq^P;R^Z&4wZI>OkX;xr zZQSRCY@tJvEcX}leJ1{y=cDWbXf61+@0m^`0qdvW!{jdt0rM6i1H2dHJU@_~hJ_N_ z@9dj8L7l%@lq@tsW%7b48f&DzwhZ|NrY^v(vdIi=;(h$chj-S{>%`w;nRs*THXKys zoAAujq`-Y>%}0A+r2S=JZXIi5R_%QF7j8V>u`!GoW$RTH>GRoh2hZQn5+k_(jTb;% z7DcSD|H87|bKkQjuh}Qw#hv1mg6jmeSE+&%j|8QQQY61s)k1I^Ijd)-rgxeEl(uMA zZeN9fg6>8A#sJ>f8Orzuk0}#$ce*A&5Ipustam1*FkP@}_#IV=Rw@`m#2)Ug9e5?u zTWdZrnh)&i)9z*@gyV=kN?7VFZ`+SL4?VQW!e|oXG4P=&hLtQ_D3ZImVoI9&{H3-T zWY8zaE`4(f5HE#@chw@6q)+X z?W}0Hh8ym3;-VsNLFm03d%BHknrY0YP!&V zxGZ&biL49pJ9b{CuGTe#D&DRVrI`CbT+<9|3?TWMLrxa9E&Y_ET|xfu^tTR`@LQIMl@>8>0z;1+jQ4f2 zhN`N*kDOF{6cQW?8Q;!e=RN=q=o(E_+M+ZSL17X6?DvyFcL!0;l?Uh~t_`lW06aK4 z)Ff|STFO4rQRBB(0TA1(IK{ghY5>K}K_&t56Hwp%Kvmr+ydfuWYJ;+`Dh7k|Q=yZO zl&zj0@bw+*3tu1C%BP%%wKIGWx{hN_x?{ zO9EK|Z^ri5E5j>jYcK%sgXWBF@4Bp1uj3*^k%4K!RKwfyHACW}(c>RzEg2(NZPhP8 z%w&)sr7@%{lI%{wo14dzAB|m$!d3yjk?NP)frrSCSs??w*?~y_5yb*20$W&+U|dOy z^4JL@oKoV<6(?||e*GRmvOWLoF&OM?63po-nMSr;5k0uPWZ_Lo)y~Wt7=zt3G1Isu2OxX9VpEdrO^xy$j^NNCa_7!X z+o;74J_7aEKD5>klt4v;1PXu4%j2p-=`qpS{pO;tX}wKK3!mhh>@%gad_>K+s^qrc zq=USu39)XQd+SrcmyWVE#Z014aqC0fL&#%wo9aQJ>?FdwUGWSfS&>l!qr9uDFS@oL zKT{s}yettut`m@d`8Dp$tzscReMl0G%-v7l&NdOX9=FMZmK%=ri5yDG|1XS zFi=rQrNnsY-F;}?l1E6cXBH{sT5T~3!uQ^bGN)Yw@<7KZ>G5|m@8!VGGFx&Hy<9>z zGi{s?1*R$kpxf%nmY#6gL>y`Um+OT6gI-Z%^6jkYNHA-Ea9-M7)%0XEB~|jQDMnSN zJtoY1ELT<~$d%Q!t70|&yRTd7P%KI_Gi(-KJn30~GOq?^tKE#vNx)2Z7dnb8Z~Zw; z1)Ml_gzv~63D9m>6N7Vu3X(rWQTYez>NFw4CGn|MDdwGy8Uq{cDOtei-I!V{8Eu!!@C$1Yy*aqC;EL`*$qv_wl~9w0S;bqGnmB9p(| zJ!DtuEQ9j(z8OTqC#kkX16Rw23_sch*n~$7AvpJC&w{)0&hM@Ojv$)7xI?n6o*ee~ zPC<((W=go#QOql?y`x|8lt%`cYrAXP$#7@-16V{uoUF`Lnby+Cj)4WOy`=Bg3sLM> zfOi++F_4XQO1W5X${8cK)ZI^=ATM(=#%A!Iuek{#-1@|*qMk8SugQ-RyOxaPWc<3U z(&ia?TX_jc6zv_#qPjr^@6WY25#8?P@vgYGj^F+Yv?geC_@0GSHDy2jY>?5;-xhC3 z)d7^!iC+w;=?HuJ@jP(H6yW0r=E2l7UY2mQP2Y0gd{u*V=_|7sf3)miY?>sDS`A3z z2H)es@!B;rg$b56(T-k+bRp2|$Z0$fiV5@cM|6ZMMy`MfQI;kLm<>IfP_K%*w?pc0 z%rM2gj?XYEISr$DvJ`1@F`9*XrkK+S^(M)A*#=-Ly7S4Gct)$Rk^GtNHfPWQD#48v zmT8yov<}ALnj1sfARV*)15bPV<7j6{@=CWA)ug=Xjk>2jnBn+WJEO-Bi??(l)OB9B8@$4%EL#%Y4T0rl9Y zES)U7lQLvD!T%n=_-9}gG58VP*4xFNpTflHYg5c-icfHaWdDNeNzDc&P9LWFq${w$Dh{;z?t*v*Qm-3Ki&6dBV>TL8$!;1tKsm+} z75+R;CSFI04z$-$m)m2pgtEt0rF-Z=uZa8{uT~ydzVVk~Y@&Gk{GOqVTm9ZDp{qQH;%j&%=!oKGPwJ!A*$V z$AFg#GD)6c9@l?EKmA3hg}b?1YWYQ&01nj{w4cnC#)(e0m@0E^u*q<4Br65GjB?u? zoRJ0wBZDJhsxkhwCK@XMs{_wt-`RK!q!Ed3daWupBKX8(*9u8#?%Wl$HDGe z!&Q3=AhZ}5|3QZoV~^(fBY7m8J{jM!nm>0p9p{A0zXgazPUmcP9x#b3YEz z=LK@!6_H<6DeV{}O6%@_RH(b4xA3`a<1J%gU}9#Zk7WQCpdt6UUijML2`k#q>k$)- z?7B;#ED6N!n|MYo$SR*;62l7AVg7oOV^m~yetSo|^|AV1*p%VfEIg9a@Z^$wM2S@T z;S;)$QZatgol@>Qx5>UjutD`x(5o7k4`+5>>7 z`bZE|9+2Lr4rEEuWBTB{nFCJm;Hf&UfL)x!ks~x%n{R}PjVK1NKuqYOiE)WUXk{x_ zK0>CXSRb;I(f7T~EuAlC2)(w-hnAcTybP#3om7wSpy7p~+5D&ODryCghhvp9vgOdt zp?sDsk8JB9mvMnW80e-{v9uG@!Bm*$G8q0QbA-{9qojZ`Bz zJ29v5JjR!u9qdR}8~GuNPO@N>J{VR9Tv_<2tAyVF0gn>4i?i)k6Fkey?W+#jV<4NupZ=d1>IOxHBOYs^qVoN zLi%3NBKg$q)BPLo>}yRy+ZdASdNG&3-wQ6=IuOnpemVPi*?I6-MH9~NI^l{qV5l0= zp*$KCj{wEWS{}$>9{WbcZIATRcZ})8n>~_Hq zAsq7Kv`sIGkkvXmDq0`<-DZydl0>sb8Kw*+?j<%fV_vUyBKs%cok$X*RikZ!?8A} z+=L8-Vf_Tu_8S#XR+Y1tFZ3GjV}k0twvb!B1}_YE*&!7wmAZ8MtFDv>iiG;{NV6=8 z#$$yzfi-67hrv)9iK_44^Vqz16?#6jh3d_O05@7LEr4b z4!;?pc~q{xcj41rQ)IY8iG>L2*3BgR?;SE^)TBz^d7Hib z9FB=a0c}RHu^A9&_w;zlkPp~H!)K%tw_@Fd>v#bSTr=nrHD*kQ=ERx7AAPZYQA9;n zVw0a_BYj+_R#g{(C87)yGncKATv;&+dCm0(;5@sI1ADqI9#;tLNmi_Cq|UQYlCe!I zZj?1Ija<;T?3;Nh&uavPXp@KbqwFGMc2uWWm9b011n5~0?I)l6fgluPTwGRv<>n>R zy~Od;86RC|e8oP{%oQ>jzkHazvtD%=(A*>mooNNwt(H^Gv}k(~As{=|Az8|f-Wwfy ztw|>=?`f>-rx#Y)+P<(6fxELkuFX^Fe^~7*vRW=20$p&%8EytDV$PnQwiYQc_;7UQ7@5&G3y}FXXas5@)M#t7BL8+_EfDr zUcFSU>%d+#4x-*aD}a39IU=3U8OeB*KsM408Xan#hzB*&jqf!Qu68>@KJStmFN0c+?5-9VP1K;u*)YOVWW~aps!HucvY})0D#&um5O- z_*q_Q!wOAB-stQq z=9HOPgf^?o5EKA;?7pjFj5oKVWNCZxOX)+dMmZ4~x*QW$K&Qfhicy(Y>LiI%CSC5r zo}l$1Ge|C~Z~&uW)E5O`y9yd^$E4^$%28g)V-!yCRswQ~!PV&ht= zmT{E9hyjWoAb$GkF_-KKLSU8EgHFBPj!xJ`ZfWDR#VN77Aj}>>i8+`f+?pb%_&%P= z^%PUPW!snVnlxurV00-eI=tiad#R8PPZ z`KcGzcwTCu@qBH&4640AmAEF`aN{<2P71kd_1=&;GihGnyP@nJnkpZn{7(fm2z{ig z!)(&NB(Al@`=m*kEEDf0A*WfH5Im zJ2&!=YWr55SDTH*3qCM~7XZjw%avXA?>6DZ6jk~kEgK7+oXpL47c?HNuotnOWa*hb ztF+Nj>H;#KSv<|X=X_JyzuB5982;1(4&c2gS>XSS)iAeR<|Y3wf9kq$sKTCK_dW}w zo$Lr=mmRtI_4b|Pn-TXXU&^OqG2x!+mF9b5!wH7}^<<>Er1x8$825P z!euu{inmrRpb?gxiF~)S*2TMt1=ZGyvz~)PW7bw++$pmR)@dm>Y|;NQ5k?Iq$O1*t zK)XfB4X-pioKv<^+0c!ijE#Gs9m4Rxw)HhI?+y%Q^fps$LHs4e?>#Rpjq5U(?7m8! z5k_<8)LhE#MKK+u>MUejBNh9P&rs%t9P3WYUKwmUHEBV0^XNS&)9Q6cKTv#PvLN5R z!GgLw%iq?|uRX`Cu_>FS6c`6z6NU;O^L`UOv4$q*{SN@d%Nn{mEcll(rry7NJH#N+ zkfj2R4RB~cW8?qo?5+O?FncTMeg@3mYJ=HZ|Mq`5d)wC3SgKx@u77oJ#5dbW*|7~c zgu4mh#56}KZ0p}GV;BCrWgM#7QVuc%DtT*fSqu(pLBK4lg@~$61Ich6UBzD;rWSb z1p{C7OwgAYfhull>vFQ!mU`oc-_<@XPW605ZCx)3eH+KPP29n_W?mH;7fY-kGx2 zmr8_`2m0y>4qpR+#Hgf(Ph=d@z942Y2jdk<4C}I#>~_f6JR9pQ7h8Twn8ELbS>qxN zJxMq*YkhF308>%v5D}lrkgn67q3D^;6{l8_ivD6CuK&Ln2o}DkqT9t#R-;FY%vYBU z6yVb5jUQcX0SI;<-bf*Oqv(N0^amcwt%UJOHV*U|UN8`QVFqchR4{rJseXZ6ma#q3 zPF+>nuDBV~3;xn?_(}88ex$e+)p7B4nKdREKd;&*7TB$m)oTeDm3GKm@()|iG1LMz zgPxMARQdzVV#v>CTvknBPqPC+7fqafLQEe>p9fnhC#cOYcjmNZYLdNhucwV!j8$;r zYpXGkg=01=X=LI_47y;BWh_gmJgMoc189mxcJ%{IJP}faR6)#EAAX+u)`P?yDZGk- z(s+8zvKPjwS$pcx3U(&iABJC`rjp%TyAT``m2bwqoeC&U92*>QqWIiWqY9JGog2 z+a$~V=@?SSRBYqSO+{|Q*U;Q6%+eZdV{Qt+_h;4b*YCQ{@49~foImuJx~?u4uf1RQ zug7y(Zxb0PCbh*}O=pdfe(;RBdKZ3DZo9Azm0qiaet_Oq(>2;~bh~5zJ;p?3P{eNR z0feek60)Mxal!RA9F#iI0Dbsm?fFzu`c#|lBgFHE+?fDnqA|WH*=36?`6}4-@~Jq($GB8FtOmv=FvgfI zf}t`z9Jq9P+Yl=@WdGIfw;gm5-s6L$Q@&_A$Pz3x$uJ+emYmTc0kHCzsXR@*WDt!t zK>~u?mx!|@m_U`Q{5o5fS#fD}SnzENkv!`&(%?S*wVX=d>7zx55Ly_gWf%1}=U;m%3mTA(Aw; z2PJK(8)((6PN3$0cuakFzu~e4(llj`7HTfNM#$7lBN=z}(>tAH%Bg>nqrBq)-7p-~ z?*NBzq;w$BAvmbo6*HGPrc%8);tF=e#%@xF?$(;tNp4ti+wLipREs6TUh z|HsmXi?uK~UAMu72ZOsY+E?K9jiB%Z@Wogq=nBjjcXrf)i~r- zc~16TrxdVf=n|&!B%PiolVK*a!b4NI?6ib%Z|?1x~A%74rN_=nA>&Zxwg?|K)aZu_B;9y`rSW?->T%%Ix}oK$Fm3*?VAA6n1HT!=}D3D6(Q;IgH5xN-;g;=8|` z?q_AG@uGZ^_JMVhzgTfy{f)2|;T!z^B*2r20k#CVJAf_uTQ$%SkOmrf)#i+LJ)nhz z_&>CedZ@gueKvE}sy@o0x4GR*vsp<0MKGrbMKBf;4WoTG4M}t;We> z+D0bLd+I&j<8oCw!Kh9D4uKIcA2yV8$JL{P;IZ_0fK^04+4d<9ECHp7)5IOF2XhP9 zAl*3!(-Ekq;6Lz zMm#h6MmwnZ8>B)7P^#kqJqr+5fS$$Q%KMxB4egY)1^eTLnB=`OfX)Y)!+Isgp2s}i!{ zj3qT5E^gaLV}|v8OC%K?P~g=cgR2^Fbw^AUP5g#`n9oR{<)_znn@P=y(kL0(&Vzt`=C#N&m zmX)Y|$pvGXi*i@$$v^6u`DXABj0N1Qn6@Gb^dK`F(F**{^%5@{uOgUU=T9~*i_qic zet9#xcH5yhlj?j4?XC&)VkW+0oO5I7xG}1WX`qg`WrQVeXi9%!!Bc_V@hE=8UD(wI zk+lXPvKEPGj51wWUl9LX&lUmHH@7Q~PnC{-7>AB8j$=ggW z+FkV8GwnnMctn1EejM4;qVK*3G#l>|7%{2w@%pIjE(gpKjPbL!UZ_U0ET|z^XX{D% zNlsnP>TK#F8slOnC_9)O=To2*fC*v{?O9zp(l>K7Hn^1pkEjtmB6Ppv5fxBZtN|9v zC6o2JU>JPpy&J>4Xdv&-uF*h`v^S@`^_N5=y-^pYWTOY1tWNb6w%kd)x5l@vaa8}G6{8$>V-5O-s5mSFj81ot&FP6;Sb(^I>v)O zYfS2=eGEwn7`AvnpsrXb-pT?0_<-tNyL?<7z_>W_v&X#gZ5Ob)#L9=re@_J8We43| zAPpV>2r7gQ??oLF)s*o(vL>M2$(nK$FzFHNaatQfR~lj|o=P2chRKs%yZoBDwd1*G zwiu72bhnhZrX+YBw_r?@%4d~eiSnD&#ZCB(3m1h>y&?`wl{w(h_e#TXH}m}%`&mPI z{`xNYwPF9+hWkMDcJ3-hG#bSB?MJx>U<4BDx9nAhokxw;Ph!60e2#HXl643>oqF5gcdA3bHqUAuXijRX3cNM}r7sPFYr1jE$L zbYVw~!1@4hu9^C(NCI=j1a7wNV7Ky5=~blpcwmVFdTd#28e0}(4(FJls(QK?3t9ub zW^4}ksJ!{m4Bh`g#{O!k?j(XL0?F3n>$(6#J*4I~!|Wlj0F=OVC~X@!L;T;S5*Um_ zvpVy-Q~GzVh(!i%17F*m3z}t9-FT1g0kR+w9OiBJjpA=qw8Vx!#&X&1QNOx)O}&(V zuQ<}0%cf>4a?LSldqyE!y?lCNs^rpEnX(ATK;q}$?VZ^vR`WDF5a2`hwYS|4NLmgt zoss-cxft8g@!Xc*rA^S#o`g1@F-uk6|G3NY&giFmf z0^d?s!Gm-b9X|XE*b-l#9QaYAu~>b8F4(|3`?WsUuf0D(+&R`%7ka{&X7 z2T^v6B}%=b7b05=v*#+-yscu)Hz;P}%P1{PAdpPjTAIAF>R47XFwq{BZXM}e<#W=c zjs^IeFOVH$mvvt`V9dfou8;0#l*wyXC1djLUi!yBR*Ibt9yo?jz1iPVS_I3JB#ZQ7 z%yZv>k;UcFpx`3zrX)`+vF~Z$?CqDOSubx;GmTu?{97=Nc@53=#AHj*p(p z`iGW+F>_3!eUJr-IO*D}h5M7xY~>v}V~4vu&NF0U`&mVc66zvS*CWydlzmn)Q|}cU z4MS?Yql)d5if=jZ>EG~QxtKpfY=O2Vm<<7K%fD4JRuxFbf;KoL8A}F|v28tnDH$7T z1J_fcq@Iavmj4{~Xm#igQrO!!Cqc?#wvB<`5IOT&lHu)sO=bpdanz&YNAwq940Gy2 zr3GS>r?zE!uwC3}lbSP13-VnjFy~Jbee@aa^+0Ng;Qd%w9C$#`=_YT;y`7U`2)1kW z!A=rEmg&x!UY9BtWqMdImPG|OSi&~jTWR+IacGq@_R*Dl9%fK^e-MSKrt5m>0G+qc z@i~wEx8zII%iGI798NTtRBNJ?Y&*X+8-F!4acc01EvpD7X41l;ny_%b9=%$?Zsw5Y z{ET-nQ6l89anB;tI9tAPqE~Av1Y=3wk(&Ia5qT1`xGjVHc_?kfxcbH(VjL~6vZJ;v zSlHAsa{l8k`xCJh9TO5evh*i~4U6bCA(qwJ)vIa>AeEyIb@&YIMKK6_&t4Cgwh#QX z@kwCzzPZI{s>9L`CW%=-8N%LIH(4$G@~xy5X?W9T*oTb>@7FXk*_)9gZ@ms%W7{!*Xs}XD`H@tL?kYg z+tDgxQs@jw%e!RrwQnsKNUOELNh#!%NpKuH{UEc=>a0Z1WJM{LaI2tl+Nk<6KlRfH ztVcWhgmYZ$0H{tIQButwy9$Np^n~RpPZomL=n4Dr#_|b;`eG8pSrlP5DhI$~yd)(lhI|MG<93vv!ZgSb`sCoaxW&|LZ1f0rig~tO! z5mm)<`0^RltXXZCSYrJB;;U!uW}ExQs#k9Hy~}=a_a@}?_QI<_`ZeZt7K>iWuT$5f z+(G+9NF5I09dpSH^g!?G*uKh8pV2jK-4}?N2C0B5gRGac8+f+w(ecL*8m5;y%&FCv z0Z}3CsHc?8K$Of9OWxp72zGRSSLqpaW00%`Ad#ogKMzYo<&OYJ5OnZ6O8EvC^>90p z;9S2xzI1*>t1#}^YN-I4uIQuOV*}L3NF<_!A`fNEMEa;s^d~dKrjY4&5 z&NONixm0Cq;>Ukt!QXp*T`vV%nh+DC=4%iLzboj)-(${MAmBo0gU~}Zu_;H0(GYa* zfTFutPBW)OWN~!BI=s(OXhGFBHwWgpV;~+lCGSJ4r+XE{{$-=2wmQ!I + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFunctorStore Member List

This is the complete list of members for eoFunctorStore, including all inherited members.

+ + + + + + +
eoFunctorStore()eoFunctorStore [inline]
eoFunctorStore(const eoFunctorStore &)eoFunctorStore [private]
operator=(const eoFunctorStore &)eoFunctorStore [private]
storeFunctor(Functor *r)eoFunctorStore [inline]
vec (defined in eoFunctorStore)eoFunctorStore [private]
~eoFunctorStore()eoFunctorStore [virtual]

Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_functor_store.html b/trunk/paradiseo-eo/doc/html/classeo_functor_store.html new file mode 100644 index 000000000..e29cb0d58 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_functor_store.html @@ -0,0 +1,62 @@ + + +EO: eoFunctorStore Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoFunctorStore Class Reference

eoFunctorStore is a class that stores functors that are allocated on the heap. +More... +

+#include <eoFunctorStore.h> +

+

Inheritance diagram for eoFunctorStore: +

+ +eoState + +List of all members. + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoFunctorStore ()
 Default Ctor.
+virtual ~eoFunctorStore ()
 clears the memory
+template<class Functor>
Functor & storeFunctor (Functor *r)
 Add an eoFunctorBase to the store.

Private Member Functions

+ eoFunctorStore (const eoFunctorStore &)
 no copying allowed
+eoFunctorStore operator= (const eoFunctorStore &)
 no copying allowed

Private Attributes

+std::vector< eoFunctorBase * > vec
+

Detailed Description

+eoFunctorStore is a class that stores functors that are allocated on the heap. +

+This class can be used in factories to store allocated memory for dynamically created functors. +

+ +

+Definition at line 39 of file eoFunctorStore.h.

The documentation for this class was generated from the following files: +
Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_functor_store.png b/trunk/paradiseo-eo/doc/html/classeo_functor_store.png new file mode 100644 index 0000000000000000000000000000000000000000..28e382d0f466569d2a233704f40d1d27ad93b159 GIT binary patch literal 376 zcmeAS@N?(olHy`uVBq!ia0vp^DL@>+!VDy3)z97mQW60^A+G=b{|7Sv|35H)e!>JG z3ycpOI8c4){}UjWu_VYZn8D%MjWi&e&(p;*q+-t7DQ9^PEAX_w^*%p?cY*X4Zr4>) z{<^QI_wc&Bz=6*r_v67LnR=UwPKGSLf(sHq7IO$a{S&m=HNxdycyadiw+ef#ZbfOx zPU16P(#!FZb55Fb$+>HjCM|LCe(~dCocH}@#xCW1FST{JImPt7@ZYd1M{s3M%wJEf z05=0?nK$!PIUm_QvXf=@a-VwH>-N5GOE&%Ew~`cMCkRguGF%q+)A&T{yT&u0uQ0xR ze8YjwXhLHRcai?l#b226HX5$0Z(#X!(fi?QL3w9WAq}_S2VHxXF}Eyd)@GS^*(q35 zsYm0gf=i~yIj18W%ay0D_#Mge$8GVRjWU+EB8q(Wbj TyPgIDgNeb@)z4*}Q$iB}KKYyX literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_g3_replacement-members.html b/trunk/paradiseo-eo/doc/html/classeo_g3_replacement-members.html new file mode 100644 index 000000000..0878fd936 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_g3_replacement-members.html @@ -0,0 +1,22 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoG3Replacement< EOT > Member List

This is the complete list of members for eoG3Replacement< EOT >, including all inherited members.

+ + + + + + + + +
eoG3Replacement(eoHowMany _howManyEliminatedParents=eoHowMany(2, false)) (defined in eoG3Replacement< EOT >)eoG3Replacement< EOT > [inline]
functor_category()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
operator()(eoPop< EOT > &_parents, eoPop< EOT > &_offspring)eoG3Replacement< EOT > [inline, virtual]
plus (defined in eoG3Replacement< EOT >)eoG3Replacement< EOT > [private]
reduce (defined in eoG3Replacement< EOT >)eoG3Replacement< EOT > [private]
split (defined in eoG3Replacement< EOT >)eoG3Replacement< EOT > [private]
~eoBF()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_g3_replacement.html b/trunk/paradiseo-eo/doc/html/classeo_g3_replacement.html new file mode 100644 index 000000000..a3e7e2ea1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_g3_replacement.html @@ -0,0 +1,56 @@ + + +EO: eoG3Replacement< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoG3Replacement< EOT > Class Template Reference

eoG3Replacement is an eoReplacement: - no strong elitism (is suppposed to be within a steady-state engine) - choose N (2) parents RANDOMLY - remove them from the parent population - merge offspring and the N removed parents - select best N of this merged population - put them back into parent population +More... +

+#include <eoG3Replacement.h> +

+

Inheritance diagram for eoG3Replacement< EOT >: +

+ +eoReplacement< EOT > +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + +

Public Member Functions

+ eoG3Replacement (eoHowMany _howManyEliminatedParents=eoHowMany(2, false))
+void operator() (eoPop< EOT > &_parents, eoPop< EOT > &_offspring)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+eoLinearTruncateSplit< EOT > split
+eoTruncateSplit< EOT > reduce
+eoPlus< EOT > plus
+

Detailed Description

+

template<class EOT>
+ class eoG3Replacement< EOT >

+ +eoG3Replacement is an eoReplacement: - no strong elitism (is suppposed to be within a steady-state engine) - choose N (2) parents RANDOMLY - remove them from the parent population - merge offspring and the N removed parents - select best N of this merged population - put them back into parent population +

+ +

+Definition at line 50 of file eoG3Replacement.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_g3_replacement.png b/trunk/paradiseo-eo/doc/html/classeo_g3_replacement.png new file mode 100644 index 0000000000000000000000000000000000000000..617d4301829a73b69e1f421ee91798274b2c7cf0 GIT binary patch literal 1875 zcmb7_c~H~W7RQ64C`iFFfF{&fsSisli%@n9i%6lE_<#^8OI#`%B4koPf`GgSM79LP zLPc2u$|3V{Q|wzYBgl4)g27R>Fbd7 zZgq5YBzCD^Kv#`ee{=xMZEh?A2HU>ibId)EQX(nozftU@e_Y}_QokE9dcg9!V4cdo z?fO+XYGa!QJg=sck*YvPx?D!&uaPl#D_xS6>H@LJVu5&b3DZj=wIVRRZs6&QCc5;y z6=Yj21o!6i<@~ZclKd1O#$Mzy@nv(PxsEP%KI~NOiSh^bQ}@KBPj9`bd;Nu;-9y{D zntRjx1UXdcVTFzba;7Wfu$}GKxY+KE{hdrNU+=x5=H{q_&fr?m(x_M9QdiUxO}X{0 zwYL?5J1gWDcN*bEahrwX%9z0M^26=X=4gCDXV^X@5J>Zizk^Lvfia zahbezHw9czZ`FO|D1vLrlG&pl?V%}2UoMt$8^>MknHM`V?4{I}u|57NV|=D;_v#j~ zPn2*2N#owno4lCPDz%2wZ^wWYRK108V?3E%F67ZBkC)(xzl=7Be+#N=75*J)5Vit0 z0Z$xxgk_8iatr}i7DuX(^G(vhoh59_vm*~z^gJC@znmKxi_-zo3i3D8D7%%!q(q@% zEYU@{{%0?RDJ9QF=aQIl0{_0C20AhrOhAgH(JeZNX&<7ef(i^Tw#dgb^+O&%-)&0RcT<5a3Q9o)R?C%TX1Rw=4us4m*npU# zu{Mu~eX*~nn5AB&K4oC6~C&A-) zyT6Yk5yW)T(2{u2RW|t zrKzv&ZKl_ASa*Kz#Bx|-MPw#?>ta(H+WKryslu%XEgm2gFiNd<5})+%xZ(;Z|l0&*=Wj?7u_)kK{jgT6STU@6M2_%ApbRuNvK+ z0v=>h@qSK4+q)IDAyi8)Lsoa361JAn`!wmpav7w-O^ne8h-PZcrgvQR z*a1za^{K9Zkq2KHB`j&U#sJv zFV3(G71wO*YZNG*&sq@07SStf&9^Wzy7Vusi7zErfL9gG#T4xe;%h7M#!b>U>}2P+ z@p0dwG*8F{!*V@>e^iT&?KDqk{4_K;7pK!-tyDNip9`G`wzw3UklZIqykhX2&SkV| zxZjWZBZ00{h#%l#O;(S0_nTy+3$+1N_uRg8QcJdQXt`cUz#om;oG6ga}>~%=C0%V&0>+iu74I`TqZ~38F*3b_K^YKC-V|koT{Ri#ywp{=K literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_gen_continue-members.html b/trunk/paradiseo-eo/doc/html/classeo_gen_continue-members.html new file mode 100644 index 000000000..889fd0262 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_gen_continue-members.html @@ -0,0 +1,48 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoGenContinue< EOT > Member List

This is the complete list of members for eoGenContinue< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
className(void) const (defined in eoGenContinue< EOT >)eoGenContinue< EOT > [inline, virtual]
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
eoGenContinue(unsigned long _totalGens)eoGenContinue< EOT > [inline]
eoGenContinue(unsigned long _totalGens, unsigned long &_currentGen)eoGenContinue< EOT > [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoValueParam(void)eoValueParam< unsigned > [inline]
eoValueParam(unsigned_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< unsigned > [inline]
functor_category()eoUF< const eoPop< EOT > &, bool > [inline, static]
getValue(void) const eoValueParam< unsigned > [inline, virtual]
longName() const eoParam [inline]
operator()(const eoPop< EOT > &_vEO)eoGenContinue< EOT > [inline, virtual]
printOn(std::ostream &__os) const eoGenContinue< EOT > [inline, virtual]
readFrom(std::istream &__is)eoGenContinue< EOT > [inline, virtual]
repTotalGenerations (defined in eoGenContinue< EOT >)eoGenContinue< EOT > [private]
repValue (defined in eoValueParam< unsigned >)eoValueParam< unsigned > [protected]
required() const eoParam [inline]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< unsigned > [inline, virtual]
shortName() const eoParam [inline]
thisGeneration (defined in eoGenContinue< EOT >)eoGenContinue< EOT > [private]
thisGenerationPlaceHolder (defined in eoGenContinue< EOT >)eoGenContinue< EOT > [private]
totalGenerations(unsigned long _tg)eoGenContinue< EOT > [inline, virtual]
totalGenerations()eoGenContinue< EOT > [inline, virtual]
value()eoValueParam< unsigned > [inline]
value() const eoValueParam< unsigned > [inline]
verbose (defined in eoGenContinue< EOT >)eoGenContinue< EOT >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_gen_continue.html b/trunk/paradiseo-eo/doc/html/classeo_gen_continue.html new file mode 100644 index 000000000..7eb3a6656 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_gen_continue.html @@ -0,0 +1,178 @@ + + +EO: eoGenContinue< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoGenContinue< EOT > Class Template Reference

Generational continuator: continues until a number of generations is reached. +More... +

+#include <eoGenContinue.h> +

+

Inheritance diagram for eoGenContinue< EOT >: +

+ +eoContinue< EOT > +eoValueParam< unsigned > +eoUF< const eoPop< EOT > &, bool > +eoPersistent +eoParam +eoFunctorBase +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoGenContinue (unsigned long _totalGens)
 Ctor for setting a.
+ eoGenContinue (unsigned long _totalGens, unsigned long &_currentGen)
 Ctor for enabling the save/load the no. of generations counted.
+virtual bool operator() (const eoPop< EOT > &_vEO)
 Returns false when a certain number of generations is reached.
+virtual void totalGenerations (unsigned long _tg)
 Sets the number of generations to reach and sets the current generation to 0 (the begin).
+virtual unsigned long totalGenerations ()
 Returns the number of generations to reach.
+virtual std::string className (void) const
void readFrom (std::istream &__is)
 Read object.
void printOn (std::ostream &__os) const
 Write object.

Public Attributes

+bool verbose

Private Attributes

+unsigned long repTotalGenerations
+unsigned long thisGenerationPlaceHolder
+unsigned long & thisGeneration
+

Detailed Description

+

template<class EOT>
+ class eoGenContinue< EOT >

+ +Generational continuator: continues until a number of generations is reached. +

+ +

+Definition at line 34 of file eoGenContinue.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
void eoGenContinue< EOT >::readFrom ( std::istream &  __is  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Read object. +

+

Parameters:
+ + +
_is A std::istream.
+
+
Exceptions:
+ + +
runtime_std::exception If a valid object can't be read.
+
+ +

+Reimplemented from eoContinue< EOT >. +

+Definition at line 83 of file eoGenContinue.h.

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
void eoGenContinue< EOT >::printOn ( std::ostream &  __os  )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Write object. +

+It's called printOn since it prints the object on a stream.

Parameters:
+ + +
_os A std::ostream.
+
+ +

+Reimplemented from eoContinue< EOT >. +

+Definition at line 88 of file eoGenContinue.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_gen_continue.png b/trunk/paradiseo-eo/doc/html/classeo_gen_continue.png new file mode 100644 index 0000000000000000000000000000000000000000..a5af96d74a51440651cc5ea67c1cf72284fa1369 GIT binary patch literal 2911 zcmb_eYc!kL8jf45rZ`hhO)gndStg52;QkScbE8q*1o0rqt+L|I=TWbcvQ#TaZ$7pVD zPH0^lR}7V6Jl)ZdgOmLs5Qv7*sYOcHPIA`u-xK zS0r|uIDhFITxh2wfgc#=DbLECGg8K{mOoqZpuGsne(&hw8`9ylb4{~c3~ImTcw^ZC zX1LOao|ciQ4TQHDbaP?Px}0VT?@vmz6+N|c9Zgm2zB!?}P}|~Rhp~vt+4#~}|7m}y z8$#aANl(}l$@66u##V{HbF8ah(UuMB*mxf^l0ERk2U8wZ=yKygjbvlPr^{g%e%oy? z^JzNSBd`OjQd=lL?;SIUG)#eEvY2m~kyhlvAsiE$n1l!k&B4b7MvF*>-wyemYe;z& zA-yoexOSaUYZ)jEuzUs%=+>dko*`)5VV)c9(S z9Z%i1GX?4Kl1tLVyg_{PE(jy&xSx7i+V5qMm0ELslCYO_?bz9ro*1lryj)a|B>hzT z0+WSoxhW$ICu@+p_HLhU63^*W(u_S1$n|qWEm5fg!)9@|O_EI+h$N^Gh zjfI z@6KN*EJoKyz4`7u7j0M|#Sr|{k)j>l#P?`Ja5EsGAfGO8r%{3?vdHa}#_DmlJuvXh zIv=@F07VPK-oj*FouHJy5{4hOPNet6QI~qcjB!INWlI|b6t6oMh@o(dK9#Ux298Jy z2*#Y`3?Dc2lvo9LmujKT54uL`cZ<7 zKk%+YfXJg~a`0iv$41zSp0YffQq?~%NgGJHVw5LGPpICQb9Qs47Am<|rT0rNgp%|L z_dCOyw}_=T-BC(+-P7piTYJMKlC50z@PABKmpeh;#;!LWxaS$Q?ZKS#t+Ge&WI|YI~8FySlngo>gja8LBam3 zuG&+{Cb-Dn2{aZTXq*u0=wt&fQwswHHlXqBS7#&M$O!29mC`cD=>dX2xkw-M={Py! z2i~V;*CDa@c&A-ib;Fe7@SY1apBFgLty^4mX%k3i8`LwUHuGaOKhz|^W18mJu>8-K z99+keiMI`=j(~18Rxw{#;Qf*Cbq0ZSV(J;>Yuj(pQ{u~N#|Y*~%UI0}s0qE2kHd(< z$en6?E3WxO3p!XSt+Z!%ag$jK(K%ficIx8^bk-O;9uFIQJYTje+X5WrG8#FN@7^S= zj{s66XgygPf7TUqc{GTZWhD{o9?9*58Zd+G!Lq=5&ga8^!+bZpZM@xta`lon%Iwl5 z^a3eVZ~z`ZOqu0Sx8`^A*n4zE4HIH(7wc@m$u<|rue2(fyGm269nA~+iM~9W6ilFh zhG-j14gpE|2+bJ@yRryzW(KYkzK3y-X_Kg*8s1k{$05@wwem%9>uy_GP^lkBb3$rC zlzTnqyVbM7D59P*Q`BIQdx%7wGL~Mbds0q(i_0{~7+B8m8D)DAW~atjPg*GH(O-&} zNbX$rkrB46drHS-p1b7rMw zko))RGqvt0WomV4?Jzp1vcu?(kuxl5ox)%68!-^g8!<_-3g77~f_Jb-$yyO_FBYqO zukdoUip%;g#h?Gr1TVL*-g}yRM?KL?ZvW(w^~yatN>vGUO!uNr_9mwh)sn-X+Z{6V zP<3C_;k_doQ`%)+2tdV zMcWDHudJv)FC`W%u$XVV#(RtDk71_}$)4b7zKq1!B@DHBZ#Wz~Lv=s?4N=99llD%C z6z*KCfPflRK6Q6rlt*X7Me}6%=1|~391A^-_B54Gr`~5Ww_vnq>S>f^X2@BrecnsH zOx7^#NIaIF2L&CzWMqOwIY!Rd(X>AUV z=HgiDCB2mR$z+qH)9Co;k8KMC6yj zp4i+%Ji7Y8a7~hhnZiXaZ0g%1_#pA#5h+u9&)Dsn^RB;CHVH6;l{mRIvs2XIwe2B) z2Wpz_YQI`@2^mp6g>?o0JL|D%0fNHTJ2@*D8+fZAFS7;tk0 zX0$l;90D>Kv-G%SeX{H9X0^BxCzhmN+HVLm( + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoGenOp< EOT > Member List

This is the complete list of members for eoGenOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + +
apply(eoPopulator< EOT > &_pop)=0eoGenOp< EOT > [protected, pure virtual]
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const =0 (defined in eoGenOp< EOT >)eoGenOp< EOT > [pure virtual]
eoGenOp()eoGenOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
functor_category()eoUF< eoPopulator< EOT > &, void > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
max_production(void)=0eoGenOp< EOT > [pure virtual]
operator()(eoPopulator< EOT > &_pop)eoGenOp< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]
~eoUF()eoUF< eoPopulator< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_gen_op.html b/trunk/paradiseo-eo/doc/html/classeo_gen_op.html new file mode 100644 index 000000000..86bd5cad1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_gen_op.html @@ -0,0 +1,70 @@ + + +EO: eoGenOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoGenOp< EOT > Class Template Reference

The base class for General Operators Subclass this operator is you want to define an operator that falls outside of the eoMonOp, eoBinOp, eoQuadOp classification. +More... +

+#include <eoGenOp.h> +

+

Inheritance diagram for eoGenOp< EOT >: +

+ +eoOp< EOT > +eoUF< eoPopulator< EOT > &, void > +eoFunctorBase +eoBinGenOp< EOT > +eoEsGlobalXover< EOT > +eoMonGenOp< EOT > +eoOpContainer< EOT > +eoPropGAGenOp< EOT > +eoQuadGenOp< EOT > +eoSelBinGenOp< EOT > +eoSGAGenOp< EOT > + +List of all members. + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoGenOp ()
 Ctor that honors its superclass.
+virtual unsigned max_production (void)=0
 Max production is used to reserve space for all elements that are used by the operator, not setting it properly can result in a crash.
+virtual std::string className () const =0
+void operator() (eoPopulator< EOT > &_pop)
 The pure virtual function that needs to be implemented by the subclass.

Protected Member Functions

+virtual void apply (eoPopulator< EOT > &_pop)=0
 the function that will do the work
+

Detailed Description

+

template<class EOT>
+ class eoGenOp< EOT >

+ +The base class for General Operators Subclass this operator is you want to define an operator that falls outside of the eoMonOp, eoBinOp, eoQuadOp classification. +

+The argument the operator will receive is an eoPopulator, which is a wrapper around the original population, is an instantiation of the next population and has often a selection function embedded in it to select new individuals.

+Note that the actual work is performed in the apply function. AND that the apply function is responsible for invalidating the object if necessary +

+ +

+Definition at line 57 of file eoGenOp.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_gen_op.png b/trunk/paradiseo-eo/doc/html/classeo_gen_op.png new file mode 100644 index 0000000000000000000000000000000000000000..dfb48ec3729be7a7c29e1d3354cea7122cf29e44 GIT binary patch literal 5143 zcmcgwdpy&7AE(ljR61132+bwRBsG^A63OOB@9c-bqOOdI@lw_wPYzk?zR4BJ) zG~}|5n6VIwelE!^2S3+pWMk&scTd`Oy3B}^448~7XN%Z-7 z`t&KOT0AIul|FmS*;VSmyVobBq!jZVY!14eOB=t<5AHJCVmmOJb8Wq&$?Eqjy?ZQg zwA}vrelMZV;o|+xw7bSF&wteI+Go#y*;?PyQu(qeLG92qQ%tlq(P`Vvpp-36GYfUd zS3;C0ke9F;ye&~nL+fR1z_t9U$C!^oH2oB*G+)hcRIMt><&`uy@=0$sw^LsTVMgZ2 z0plg?yw0J*IvzeR;>`0GDvx)Ne%WOmB3Clh_;H8uXiL*7U}CyXnKSdl6d%SDc=p{C zu?RjFnZHpgyY%0L8ad_~zkf}BIjrybr1o+pSZpyj8i^HNRy##;5Ktow&_c%A5be9tA5Lzob!lS0BaFu@6VUXZ#>fzSnN9AizAe~!d~ocFftkuY`PtFygiRx*cEnM& zvbc3aT+!ih&2lQvaU9v;jO=1o8IVflfzw)~U&hU1E3~vmApSA+q|iH&o9^};$}QN1 z2(0Sa!Wtl`IH!oFPPhvkiGfgV2~8k-HXAE;OBN?H`Oa}Q_qAP>&IdwI5Y6x{c8&{I z=X&%-@tTO&7G!)OU%MMI zoZh0w9FS#JpZ*afjQ}Ob1uu(ogKF*vGj0)4$nsluc8a$xj`#0VAh8PtJwY`IE6?m( z<8rAG%y~t+W!Lb_@hloC-41UZ2u*0*6L)`LCauRAs%@d-TbLU(i1_5!^;_jb{9)bu z0mDH3=&p~tV;ggf#$kUICe>2C;zab_U1uq5T#dI$_)Z zor2m*ewfOzg?8QCjZigi>ik76AhrD3<2Z2W1Vf*s;-N=^312j9r^EeD1{~!RV;i=6 z0{9Es^4T~96Fk>jJyNoSnrI~HaPaGM9UpyQ)BrSLaR&3v8aaA8#&Dum$X!U?uYylr6l$ED|cafZ^mLZ zRI50`07^z^-9@a{=Vd7oQ8w(v-T=l^g{5;oANFM^D*%h`&9<9#If%VVwj-92@y{aB zTD9!Ol{0cp?bDUvX%Q>dN8E1g`w%)iZ$^JMGB)us6i#XD=ouTsZpdbqcXR+MO;zQy zz7~9)zvZqnc6Rv;>arvu&#uf(w#R27tv0RMq7a+?Ez&JL| zTMd_pMm1*9a1D+7acDXY-5lSWqa>8_gr=SOMr=Y&dK^KVo<6aa&h)&Ri zganhM@ETJ|pUMVtz-X%=09`&zdr;&00~0MWZ3j1bh1-JMNeqy@1pLx zhIQqSq5QXPMo)?{{89fx)0&t{t{X+2L;=q@uD~U}*_}1n>SK&w1zbH+@LMhfr$^wt z%`;YQ*9HnA_EA;OonXJWs0<_u2icHsiGcz6sYT{RDJy(+7LydYaU zP9k~(5G)i?4?md$mQFu7*~Wv9_@+Llb>PBw3VD&WVb++0?*X_+xGP`;xDijHn%NG2 z&9fXmo7P>V<_U|}fi(eb`x1w-S+s3+l~LVu^O((O&Kj0@4U5tC5QHB13emDsu*kqC zu&fk&Zo`+`F5mkZj{T+sj*5OneZ7yLO9i45jI;TPQMn;!u|SouLd2T1A1Vg<*Vj1 z;r%&!a950Qv5#Sc`xW6?OjE*!?ewIN8OzMaofkaHd_3sq%)0lJNBV(>U`##|v3hPl zvfSJux#j)`@RV{!03p>bJa)>3%zf4Ni+-H>*{w#6+s`+hRMwqZJ7c=6J%2{knd_`d z?GJrL(tnWAWjubHTN?nMXT6Y9VG%HTgodP%c|JV0yQZ`1jsUuP?b3U?{TZ`^?B3J5 zW`=g7(JH#btj?ur*x;R=!$nP2)v4cqq*veNma;8dbh0NZL(1Rd!einY9&aAX2e2TdTvG9`oHhdrJ*E z>3@ZqZ(zaE2oa5eGQHyEv zvvhPh2mw+%&@P5v1=w;0NK(|IRVixS?=2c@AisjM4v9fy zEv?n}OnJ>t<^7AVCDv@vwo7%Xh2#7ihC>X;*f)Y@1)dMVRIDE2(ZjgX*1Oitu)e(W z9&Hl46`igM?29wM5R>3gtnsRO-l4OWXQ{N*&-EejHv7g5rg}*Q`GgF>ybKOY5GraQ zL%uqo&vr`Uzhn6^!^`CL--wi+$@Ss3|D`t0*KhkRSh*ctEAyar!Rz|lfQ9rrijmV> zH5N)MAl1Fa#a+P~vMYe^W3@@npg!GCEaGV7FrkWQlW_$ zJ^&d0?M_+ZJ0+{w=UcB2S+z5Yz6T5>*;NAkA7JPgh|kS)_x{cu(YU(gh&m*?QZt{l zmGc8&_*2spg&C#xW6%@Dw3H=TNgp$=ogZ4L`cYs~;3n{bCyD$$A%(7infxF!tc3RH zwcxX+kl2n;Sok&fW`T6%8D|F){}1i{)gN^bAM5B91+G^Y>hj3Wb*x^QuRlo!`&rFZ z=Q4)+S$*H?&bKu9jWqq!CDpZ4R_ExHFLWufTSge+D%!@kN>{jLED z#!=ucYMkPVg*;s1LZ^M%BNYMuTF?QaI^}nCBwR=DmZ8joDPzL8p6LHRP+eHZXN7FM zu`T3OCjTRS<)YOSl;aX^4N4Ty9jrsBo{Spr?wu#R+wOh0WQ7d6?1-&O7>c8*QdOAN zFd-4wYHjp0l-W6Pgl*noko*4bJ*+1#&rRS6Pf`Wi?OONw`T3x_?WH5no6dgDst(%; z8q^e@qzXSK-hjvo(rgACq3aJ-MRkAp?1$E|#8MJJln>4>Ys3G{52@&Novj_Fg^h3A zkc8|et@v8TRe+1(vxw6DyNrv(aGK~^*FdwQ;4~-V%pO*lE_}8NH-*~XWvs|1RPjU` zCcBvGq~Bn=RiWmipQbahlmybKuCELrN94z!iqN2p&t>!80EelfOsu~jPUjVOE-AO( zVsFQ!D)3C?^U|*JV}mVP?Y#eF{dQ%buyC&3s@VsV0`586U9HrMIObiqq(hF-T=4pg zj=;H-_ePrKu`T|r*8zdvGg^G_>aXAW{|LS!OmmcHyraNc5CTxNB_hn-T{rncBGk=6 zAqyLvB=g6Jicdq)EHxGV@aPg6&`NmWq>zCH$){@!A6kdgeII6<97VTv3^m=VX>506SmFQ{K$UE Qzj#s(w$3&MRzF4k9oD|qng9R* literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_gene_del_chooser-members.html b/trunk/paradiseo-eo/doc/html/classeo_gene_del_chooser-members.html new file mode 100644 index 000000000..80094fe2d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_gene_del_chooser-members.html @@ -0,0 +1,19 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoGeneDelChooser< EOT > Member List

This is the complete list of members for eoGeneDelChooser< EOT >, including all inherited members.

+ + + + + +
className() const =0 (defined in eoGeneDelChooser< EOT >)eoGeneDelChooser< EOT > [pure virtual]
functor_category()eoUF< EOT &, unsigned int > [inline, static]
operator()(EOT &)=0eoUF< EOT &, unsigned int > [pure virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< EOT &, unsigned int > [inline, virtual]

Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_gene_del_chooser.html b/trunk/paradiseo-eo/doc/html/classeo_gene_del_chooser.html new file mode 100644 index 000000000..c59d73eb0 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_gene_del_chooser.html @@ -0,0 +1,42 @@ + + +EO: eoGeneDelChooser< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoGeneDelChooser< EOT > Class Template Reference

A helper class for choosing which site to delete. +More... +

+#include <eoVariableLengthMutation.h> +

+

Inheritance diagram for eoGeneDelChooser< EOT >: +

+ +eoUF< EOT &, unsigned int > +eoFunctorBase +eoUniformGeneChooser< EOT > + +List of all members. + + + + +

Public Member Functions

+virtual std::string className () const =0
+

Detailed Description

+

template<class EOT>
+ class eoGeneDelChooser< EOT >

+ +A helper class for choosing which site to delete. +

+ +

+Definition at line 85 of file eoVariableLengthMutation.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_gene_del_chooser.png b/trunk/paradiseo-eo/doc/html/classeo_gene_del_chooser.png new file mode 100644 index 0000000000000000000000000000000000000000..dbeb511263157a39e7b82aaef1de6f18eb9b512e GIT binary patch literal 1546 zcmai!eK?Z~7{=GBXhLckk%UGchc+MUpjxS9zVguw6KTAQp;#zlr=*Calh~^msiO!v zi&2zph2x#ILYq;i$rf>_)ntnuo&Gu3`KRmp-OqDB|3CMg?c=>yN6SbH27~F~-FExI zU<;)4zHQOM`DuY0BF`^FAJ6@J)N1v-Rjb>W%!B#!?q9XFwWYSJ-_D;4j`?}}!*)o8 z01URc48MEl{^QpsN_a^XPTCzDpuf|&j+d5^$_Hg2VLEi=bDi~!*dF0xeAQhYm4U%d z?J9g1e)O2?NN!vx+LcXbFIQ@UpVQ9VK`&*YX^~i1RUqNEf(n+er;1}1PMId>WZsW` zC#V^%Qm&`9R{7P8i68ca_%_DcJ3I@|nJ_w;v^dYsS!J{X7@pfO%Z9VraP{ zB}-BGBAIIa=5$X3GDH;AHzw&#GTJqom!1RhFd&2IVU`Qy6 zeSu=}?jq~FdE@0wwp_tjh2y=bzZ0p8?O(>oC~*czBCy45dOKP6oSD(()%~>?$FZSR z@gNa1r>Ul57xii}v2~Ml*IWp9LT3rD&u7q*u5mLoTWm<41*y4yD+6-|QnSRP8puh$ zfI0l7!Rf-p_2gXfas3QSl{3_+&mR@0Tax=n`PCND@QEvoFngNS;pD9tdFnc-{bvZ5 z4GyzjA(V-~%kdYSuzRH!aT&T>r-a%dJ?*5n)RkEi;EJsDrdRs;jK?Q}v|i6uK6DLFWsk7fb5`U$I|p+{_VB%f z-emEX0Q-v^{zo@fV^)yBCaFmlsZkuvzJx1E!p06a<>pxTjl1l7I=*A6Ga`XX(bRv> z@oa%S4YODoh`(~T7#2XKl@d0{31MUd%gG`UD zQ^4w$%sMJ*s~_38bkrY!2F}MDQ|cz7ZKaicLn*w_YSSl!D~vRtlG1BFstU$MH%4X< zBXfqz{SY(>KcE2T;PDY_9Q~sT3~eu7yKV2j8Vq`h4wst!i1KdRuqhILAJrtGH?q^W z;>^r}71Cr62DR^v{z08>NTTxIYl(OUspmZI;FMAvR;3Afv?l6M?jIV(=r*Rou%>d! zxUtu0QB>j+l&>!ed(-c)!1l=$Yv8T9zY=wW5G;XL{+U?*{15ZA?v`=gtZdMX)&Nl- z=Mn+4h)=TTJrADAF$*Ky3_ALomUN#Ll`F?G^Hue&n%hj}?u8Z{jTTa9EO^^eG!tMK z#_c)Pp*rl)SVZE6RMndVQ|LAl1>vhBH+I_NRI$Xthj1TP=QZeE!kL{3j#sHr&}1R{ zkw^R2IJo@5I%pEvL20!*CZZ^F?xxOm4%LpLf%>of(Eu| zVaYIR!S!QSy)Z<;&a(4(e>5j&GYG{f-`iWzz)mZTH`*W&6FzQS^rXoo=j=~dn?n_r xag`>SLy#%^HR@ZQzLS0f!Kd=y4dT_y&`J9|!@sbm=8GGK-{ZZz*5%;oe*kwo1IYjY literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_general_breeder-members.html b/trunk/paradiseo-eo/doc/html/classeo_general_breeder-members.html new file mode 100644 index 000000000..fa316476d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_general_breeder-members.html @@ -0,0 +1,24 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoGeneralBreeder< EOT > Member List

This is the complete list of members for eoGeneralBreeder< EOT >, including all inherited members.

+ + + + + + + + + + +
className() const eoGeneralBreeder< EOT > [inline, virtual]
eoGeneralBreeder(eoSelectOne< EOT > &_select, eoGenOp< EOT > &_op, double _rate=1.0, bool _interpret_as_rate=true)eoGeneralBreeder< EOT > [inline]
eoGeneralBreeder(eoSelectOne< EOT > &_select, eoGenOp< EOT > &_op, eoHowMany _howMany)eoGeneralBreeder< EOT > [inline]
functor_category()eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
howMany (defined in eoGeneralBreeder< EOT >)eoGeneralBreeder< EOT > [private]
op (defined in eoGeneralBreeder< EOT >)eoGeneralBreeder< EOT > [private]
operator()(const eoPop< EOT > &_parents, eoPop< EOT > &_offspring)eoGeneralBreeder< EOT > [inline, virtual]
select (defined in eoGeneralBreeder< EOT >)eoGeneralBreeder< EOT > [private]
~eoBF()eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_general_breeder.html b/trunk/paradiseo-eo/doc/html/classeo_general_breeder.html new file mode 100644 index 000000000..57b7af85f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_general_breeder.html @@ -0,0 +1,240 @@ + + +EO: eoGeneralBreeder< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoGeneralBreeder< EOT > Class Template Reference

Base class for breeders using generalized operators. +More... +

+#include <eoGeneralBreeder.h> +

+

Inheritance diagram for eoGeneralBreeder< EOT >: +

+ +eoBreed< EOT > +eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

 eoGeneralBreeder (eoSelectOne< EOT > &_select, eoGenOp< EOT > &_op, double _rate=1.0, bool _interpret_as_rate=true)
 Ctor:.
 eoGeneralBreeder (eoSelectOne< EOT > &_select, eoGenOp< EOT > &_op, eoHowMany _howMany)
 Ctor:.
void operator() (const eoPop< EOT > &_parents, eoPop< EOT > &_offspring)
 The breeder: simply calls the genOp on a selective populator!
+virtual std::string className () const
 The class name.

Private Attributes

+eoSelectOne< EOT > & select
+eoGenOp< EOT > & op
+eoHowMany howMany
+

Detailed Description

+

template<class EOT>
+ class eoGeneralBreeder< EOT >

+ +Base class for breeders using generalized operators. +

+ +

+Definition at line 46 of file eoGeneralBreeder.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
eoGeneralBreeder< EOT >::eoGeneralBreeder ( eoSelectOne< EOT > &  _select,
eoGenOp< EOT > &  _op,
double  _rate = 1.0,
bool  _interpret_as_rate = true
)  [inline]
+
+ + + + + +
+   + + +

+Ctor:. +

+

Parameters:
+ + + + + +
_select a selectoOne, to be used for all selections
_op a general operator (will generally be an eoOpContainer)
_rate pour howMany, le nbre d'enfants a generer
_interpret_as_rate explanation
+
+ +

+Definition at line 56 of file eoGeneralBreeder.h.

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
eoGeneralBreeder< EOT >::eoGeneralBreeder ( eoSelectOne< EOT > &  _select,
eoGenOp< EOT > &  _op,
eoHowMany  _howMany
)  [inline]
+
+ + + + + +
+   + + +

+Ctor:. +

+

Parameters:
+ + + + +
_select a selectoOne, to be used for all selections
_op a general operator (will generally be an eoOpContainer)
_howMany an eoHowMany explanation
+
+ +

+Definition at line 69 of file eoGeneralBreeder.h.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
void eoGeneralBreeder< EOT >::operator() ( const eoPop< EOT > &  _parents,
eoPop< EOT > &  _offspring
)  [inline, virtual]
+
+ + + + + +
+   + + +

+The breeder: simply calls the genOp on a selective populator! +

+

Parameters:
+ + + +
_parents the initial population
_offspring the resulting population (content -if any- is lost)
+
+ +

+Implements eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >. +

+Definition at line 80 of file eoGeneralBreeder.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_general_breeder.png b/trunk/paradiseo-eo/doc/html/classeo_general_breeder.png new file mode 100644 index 0000000000000000000000000000000000000000..247e09bd9e25fa64a2894218a39c6ed2362f181f GIT binary patch literal 1921 zcmb7Fc~sL^8jUcWNDx6xictZ<0tuVSa>|;@5->jkh6LLRC$hvKpd3a-ma>fnQNl73 zQX`x|Sdyk9iw1$jKtQ$#s69X@5fii)!@h5sBm$Gs_RRFy`J;cl_wKuI`Of?9{m#qB z1^Mei4nja6kRIlgFCGNaMrd%?U$iy7u|?>8&2RvR4MFeh>}cT5P8X9IaZ7{Vx2~?P z^zNOvn(3}2d=LS2a`Htq2n065_HjO zGy|I;|*uC0RoA8v477{&+_q2%q8R1AdBGbilKr6)}`>x z2Q9A^4L;WL(Gcdk%e3nh@q(#mLiV{yo^9NkurARI+3^72qm&nxEIyklgZYwPpqG+`1&F+1-rxTl}uC_-`I^~8kr3<)fEoJ zwKX(i^JR|As`jsvs76{8c2*Qn;@Q`F4ne-f0`Jd%l9(&M}Ha7UJ+ zJ@>+lUBPO?Sts#r?px0?WEr$A11`vj*Vlr*2*@9B{mwjP&RQPX4kdYq^COClYQ}B= z+=80=iV#W*KKpwtGvM++NLzZ@R_N$~<$T&WHZ7Nd;;s*RGTD;rqM{C4YkJ}U7NdZc zIg#w;Do^<-icZ7a#$*GElOfSO5>oYN$AQTy(U zf%_61GR7vR+h}NI@&bN7uspke+sr4J&PCivM#3xyQ%1t<2CIpKU+Azw-pIedcf}K# zY-_v`m$zP*ry!TtckKy2HzB++oy)w1v@g;iHbmi`~ z|K9yJgwhZeQ#=Q=x|);%DNzuaBYs zvbz5QMb>bShKXxlnmv376VYl=gbJY&q2vV?ey?VS;o1_tDdT&r87HlR#Gh(jf3(bd zKu62*S#Pk)OQ&b_H)*kL?w?H|nvx0yzQHuf+C2r-H3nWPE-LnSXv>HX3Lky1_@(E; zS!mnhgPhk{D(hbkkvkQpZjjpIDw?*iC@CiMM{o!b-gaCL~c#8hwP$GQLY2LB`w8k!nf z;KMf;wWhwsv`lcSXvbcN9~2!ELvlALMree*kX5td0_>v1alrNH-58HXXAhsupoziPjgIU(*az;BVXrXKF20>8j0>&SoTK#D(%_Zi zGHSpZtgF1vlk6tbl$Vi$cE#Q$Q|U=gQ9+o5RF%pwtLBefd`r-IC`5;dKL_e81Z&LN zZOGG9iizzt-QDaX-9;uJ8U9bD=|jmVk$&Lu@w9phbr=E9t2*xlS3qkv^1Pqh0*7puy&V z18m=@?y!}g*}Pn}Cp%E}q(vNdJlc^^`Oq6#BEGq&v!RVEkZxE%g-WbCCM)LYO;hza zfE8bkVC(MZtT>tjvE>WS2^RG3GAfRw3~eh}PCQC(<|GYNQW-)XhxL<7rrl24Hq_F} zR%) + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoGeneralIntBounds Member List

This is the complete list of members for eoGeneralIntBounds, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + +
dup() const eoGeneralIntBounds [inline, virtual]
eoGeneralIntBounds(std::string _s="[-infinity,+infinity]")eoGeneralIntBounds [inline]
eoGeneralIntBounds(const eoGeneralIntBounds &_b)eoGeneralIntBounds [inline]
foldsInBounds(double &_x) const eoGeneralIntBounds [inline, virtual]
eoIntBounds::foldsInBounds(long int &i) const eoIntBounds [inline, virtual]
getBoundsFromString(std::string)eoGeneralIntBounds [private]
hasNoBoundAtAll(void) const eoGeneralIntBounds [inline, virtual]
isBounded(void) const eoGeneralIntBounds [inline, virtual]
isInBounds(double _x) const eoGeneralIntBounds [inline, virtual]
isMaxBounded(void) const eoGeneralIntBounds [inline, virtual]
isMinBounded(void) const eoGeneralIntBounds [inline, virtual]
maximum() const eoGeneralIntBounds [inline, virtual]
minimum() const eoGeneralIntBounds [inline, virtual]
operator=(const eoGeneralIntBounds &_b) (defined in eoGeneralIntBounds)eoGeneralIntBounds [inline]
printOn(std::ostream &_os) const eoGeneralIntBounds [inline, virtual]
random(eoRng &_rng=eo::rng) const eoGeneralIntBounds [inline, virtual]
range() const eoGeneralIntBounds [inline, virtual]
readFrom(std::istream &_is)eoGeneralIntBounds [inline, virtual]
repBound (defined in eoGeneralIntBounds)eoGeneralIntBounds [private]
theBounds() const eoGeneralIntBounds [inline]
truncate(double &_x) const eoGeneralIntBounds [inline, virtual]
eoIntBounds::truncate(long int &i) const eoIntBounds [inline, virtual]
uniform(eoRng &_rng=eo::rng) const eoGeneralIntBounds [inline, virtual]
~eoGeneralIntBounds()eoGeneralIntBounds [inline]
~eoIntBounds() (defined in eoIntBounds)eoIntBounds [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]

Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_general_int_bounds.html b/trunk/paradiseo-eo/doc/html/classeo_general_int_bounds.html new file mode 100644 index 000000000..660e93e12 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_general_int_bounds.html @@ -0,0 +1,126 @@ + + +EO: eoGeneralIntBounds Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoGeneralIntBounds Class Reference

A class that encapsulate all possible eoIntBounds. +More... +

+#include <eoIntBounds.h> +

+

Inheritance diagram for eoGeneralIntBounds: +

+ +eoIntBounds +eoPersistent +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoGeneralIntBounds (std::string _s="[-infinity,+infinity]")
 Ctor: from a string, chooses the type of bound.
+ eoGeneralIntBounds (const eoGeneralIntBounds &_b)
 Need a Cpy Ctor because we are allocating memory.
+eoGeneralIntBounds & operator= (const eoGeneralIntBounds &_b)
+ ~eoGeneralIntBounds ()
 Need a Dtor because we allocate an actual bound.
+virtual bool isBounded (void) const
 Self-Test: true if ***both*** a min and a max.
+virtual bool hasNoBoundAtAll (void) const
 Self-Test: true if no min ***and*** no max hence no further need to test/truncate/fold anything.
+virtual bool isMinBounded (void) const
 Self-Test: bounded from below???
+virtual bool isMaxBounded (void) const
 Self-Test: bounded from above???
+virtual bool isInBounds (double _x) const
 Test on a value: is it in bounds?
+virtual void foldsInBounds (double &_x) const
 Put value back into bounds - by folding back and forth.
+virtual void truncate (double &_x) const
 Put value back into bounds - by truncating to a boundary value.
+virtual long int minimum () const
 get minimum value ::exception if does not exist
+virtual long int maximum () const
 get maximum value ::exception if does not exist
+virtual long int range () const
 get range ::exception if unbounded
+virtual double uniform (eoRng &_rng=eo::rng) const
 random generator of uniform doubles in bounds ::exception if unbounded
+virtual long int random (eoRng &_rng=eo::rng) const
 random generator of uniform ints in bounds ::exception if unbounded
+virtual eoIntBounds * dup () const
 for memory managements - ugly
+const eoIntBounds & theBounds () const
 for efficiency, it's better to use the embedded boud directly
+virtual void printOn (std::ostream &_os) const
 don't forget the printOn method - again that of the embedded bound
+virtual void readFrom (std::istream &_is)
 no readFrom ??? Have to check that later

Private Member Functions

+eoIntBounds * getBoundsFromString (std::string)
 the constructor for eoGeneralIntBound - from a string

Private Attributes

+eoIntBounds * repBound
+

Detailed Description

+A class that encapsulate all possible eoIntBounds. +

+Mandatory in order to read through the parser +

+ +

+Definition at line 541 of file eoIntBounds.h.

The documentation for this class was generated from the following files: +
Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_general_int_bounds.png b/trunk/paradiseo-eo/doc/html/classeo_general_int_bounds.png new file mode 100644 index 0000000000000000000000000000000000000000..e081055b9ed88b47d47bd565a37887bd2d3780f5 GIT binary patch literal 654 zcmV;90&)F`P)TlxD703M$q zwhw=T_kx}017L8^dpzN#XGg$fY?NLQQJKQ~h#|=hXRqhDT7i zSox6V0>DK4xZ{0^-`hd`9Y0%t>3`)h?=ao}bEf>&`PJ|Dz`jNsp3L9=Udn&nZZG9u z-hbtlS6+GLKa^Mf_lEpNsIX@6tuy9#VsDlw*#*MWD+xFja=@YldIi$+RkE?zNvbDn zAJ|E#M?7#?{)w3KjTk)Q5lp+}jFi6|Il;$R`0Ppw&B|2$CI6=WF<<*HuO)x!KZ(I( z{-h~?bzb$~GkMj2$}6wD^2&cEulnx|`E+Fmo!XkYe`r47zvt2gHMyhHaPZ@Nrd z9^+aNm`2O4agHY)`WBeSeU5!&9eSC!JUA=II^0f!0htuvat^kv%chRE2@&2&-r`gJ zbzcc5JR}ZX0A2@9)k5W)_$KF9;+w*kbd2P1!1wvrlCyh{w{>va{u}DDl`^^iG?94V o{~x&Vyx#VI!IZx`zxe(B2QRRO*obref&c&j07*qoM6N<$f-a>_4*&oF literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_general_real_bounds-members.html b/trunk/paradiseo-eo/doc/html/classeo_general_real_bounds-members.html new file mode 100644 index 000000000..a5fc02529 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_general_real_bounds-members.html @@ -0,0 +1,38 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoGeneralRealBounds Member List

This is the complete list of members for eoGeneralRealBounds, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + +
dup() const eoGeneralRealBounds [inline, virtual]
eoGeneralRealBounds(std::string _s="[-infinity,+infinity]")eoGeneralRealBounds [inline]
eoGeneralRealBounds(const eoGeneralRealBounds &_b)eoGeneralRealBounds [inline]
foldsInBounds(double &_x) const eoGeneralRealBounds [inline, virtual]
getBoundsFromString(std::string)eoGeneralRealBounds [private]
hasNoBoundAtAll(void) const eoGeneralRealBounds [inline, virtual]
isBounded(void) const eoGeneralRealBounds [inline, virtual]
isInBounds(double _x) const eoGeneralRealBounds [inline, virtual]
isMaxBounded(void) const eoGeneralRealBounds [inline, virtual]
isMinBounded(void) const eoGeneralRealBounds [inline, virtual]
maximum() const eoGeneralRealBounds [inline, virtual]
minimum() const eoGeneralRealBounds [inline, virtual]
operator=(const eoGeneralRealBounds &_b) (defined in eoGeneralRealBounds)eoGeneralRealBounds [inline]
printOn(std::ostream &_os) const eoGeneralRealBounds [inline, virtual]
range() const eoGeneralRealBounds [inline, virtual]
readFrom(std::istream &_is)eoGeneralRealBounds [inline, virtual]
repBound (defined in eoGeneralRealBounds)eoGeneralRealBounds [private]
theBounds() const eoGeneralRealBounds [inline]
truncate(double &_x) const eoGeneralRealBounds [inline, virtual]
uniform(eoRng &_rng=eo::rng) const eoGeneralRealBounds [inline, virtual]
~eoGeneralRealBounds()eoGeneralRealBounds [inline]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]
~eoRealBounds() (defined in eoRealBounds)eoRealBounds [inline, virtual]

Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_general_real_bounds.html b/trunk/paradiseo-eo/doc/html/classeo_general_real_bounds.html new file mode 100644 index 000000000..2c398b8c1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_general_real_bounds.html @@ -0,0 +1,122 @@ + + +EO: eoGeneralRealBounds Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoGeneralRealBounds Class Reference

A class that encapsulate all possible eoIntBounds. +More... +

+#include <eoRealBounds.h> +

+

Inheritance diagram for eoGeneralRealBounds: +

+ +eoRealBounds +eoPersistent +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoGeneralRealBounds (std::string _s="[-infinity,+infinity]")
 Ctor: from a string, chooses the type of bound.
+ eoGeneralRealBounds (const eoGeneralRealBounds &_b)
 Need a Cpy Ctor because we are allocating memory.
+eoGeneralRealBounds & operator= (const eoGeneralRealBounds &_b)
+ ~eoGeneralRealBounds ()
 Need a Dtor because we allocate an actual bound.
+virtual bool isBounded (void) const
 Self-Test: true if ***both*** a min and a max.
+virtual bool hasNoBoundAtAll (void) const
 Self-Test: true if no min ***and*** no max hence no further need to test/truncate/fold anything.
+virtual bool isMinBounded (void) const
 Self-Test: bounded from below???
+virtual bool isMaxBounded (void) const
 Self-Test: bounded from above???
+virtual bool isInBounds (double _x) const
 Test on a value: is it in bounds?
+virtual void foldsInBounds (double &_x) const
 Put value back into bounds - by folding back and forth.
+virtual void truncate (double &_x) const
 Put value back into bounds - by truncating to a boundary value.
+virtual double minimum () const
 get minimum value ::exception if does not exist
+virtual double maximum () const
 get maximum value ::exception if does not exist
+virtual double range () const
 get range ::exception if unbounded
+virtual double uniform (eoRng &_rng=eo::rng) const
 random generator of uniform numbers in bounds ::exception if unbounded
+virtual eoRealBounds * dup () const
 for memory managements - ugly
+const eoRealBounds & theBounds () const
 for efficiency, it's better to use the embedded boud directly
+virtual void printOn (std::ostream &_os) const
 don't forget the printOn method - again that of the embedded bound
+virtual void readFrom (std::istream &_is)
 no readFrom ??? Have to check that later

Private Member Functions

+eoRealBounds * getBoundsFromString (std::string)
 the constructor for eoGeneralRealBound - from a string very similar to the eoRealVectorBounds::readFrom above but was written much later so the readFrom does not call this one as it should do

Private Attributes

+eoRealBounds * repBound
+

Detailed Description

+A class that encapsulate all possible eoIntBounds. +

+Mandatory in order to read through the parser +

+ +

+Definition at line 506 of file eoRealBounds.h.

The documentation for this class was generated from the following files: +
Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_general_real_bounds.png b/trunk/paradiseo-eo/doc/html/classeo_general_real_bounds.png new file mode 100644 index 0000000000000000000000000000000000000000..68df902c56e369f75352ac2ca37da7a97db311b0 GIT binary patch literal 729 zcmV;~0w(>5P)r006)Q0{{R3DQf0j0000OP)t-s|Ns90 z00960z@MLBkN^MxkN^Mxkifved&2+Z00001bW%=J06^y0W&i*JZ%IT!RCt{2nOTzK zAPk1lOFtuS0CR)x3(ZsRe}q92o3Rr^H4LU9qAV`sQM zPKn!Pcc>Jf#ysM%En!D-#g>EeIxZb$E-ocUl@dMilR26$O1TeZ%}H`zJ_gpji}Lt; z8Oq1waT&^`a-v?V%F4B!QOZs{&rwLaqEM(wQkW$% zvVg+_wRS+M;+I8YQj1wL;*kJ-K|wZwKO#k4Bd*UWaeG=Tq~wu+hbbWxO74m|&CEnx zibqXcMkzH%(kvcHj!0aOQ09wL?n7B~lB_w^-bGP8{RFcDq7{Akic*xK6s0KT*HCapF?NBqpp*xqvhsgHP7beXbM)h)l>1PYoFxAM5rf1WBqkN+00000 LNkvXXu0mjfTB}MI literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_generational_replacement-members.html b/trunk/paradiseo-eo/doc/html/classeo_generational_replacement-members.html new file mode 100644 index 000000000..3f3560268 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_generational_replacement-members.html @@ -0,0 +1,18 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoGenerationalReplacement< EOT > Member List

This is the complete list of members for eoGenerationalReplacement< EOT >, including all inherited members.

+ + + + +
functor_category()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
operator()(eoPop< EOT > &_parents, eoPop< EOT > &_offspring)eoGenerationalReplacement< EOT > [inline, virtual]
~eoBF()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_generational_replacement.html b/trunk/paradiseo-eo/doc/html/classeo_generational_replacement.html new file mode 100644 index 000000000..ba60b1121 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_generational_replacement.html @@ -0,0 +1,43 @@ + + +EO: eoGenerationalReplacement< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoGenerationalReplacement< EOT > Class Template Reference

generational replacement == swap populations +More... +

+#include <eoReplacement.h> +

+

Inheritance diagram for eoGenerationalReplacement< EOT >: +

+ +eoReplacement< EOT > +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + +

Public Member Functions

+void operator() (eoPop< EOT > &_parents, eoPop< EOT > &_offspring)
 swap
+

Detailed Description

+

template<class EOT>
+ class eoGenerationalReplacement< EOT >

+ +generational replacement == swap populations +

+ +

+Definition at line 84 of file eoReplacement.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_generational_replacement.png b/trunk/paradiseo-eo/doc/html/classeo_generational_replacement.png new file mode 100644 index 0000000000000000000000000000000000000000..d3597e6fdc7115936ec45c6e0ff6752e37299a14 GIT binary patch literal 1938 zcmb_dc~sL^7KRq3C4Svm*c1Bo8xR%$#zml}Hbgcq?y(6+~#kCJgoA!U^7ktpSV>?2SK#xyYDCll= zx1}@Q=xEzGmjO}C>n%;h+VW)O{<_OdoT8m}P`u@gLWZMkNkH9r za}G649&cvQs;2&4k~ZEPm+_>i4K=HQnrNU78tC1!ZvSo?@ExhXT+{yzHpdjPN6%@ybNEsHK;3C6;P zU5M7uDkmak3;l*P3}T5VR=(iuS~%itn8?mo!Q{$br<*!7%f<`crvmOB%CM|1TSr`v z_3yR!=p75vdyKwJE4U5&LtmL5VN1dCDgZ~k)AI8z3t6*?j~|cibZGg;#ud7UZAOc& zjoKazdhXJWzV-R%KtV8Vtlrtrf}`WM1)Ui0Dg2-EhlI?%oWhej?wq?%+K-rS9Qgpyz+1cD`jjJd(VR$RunYNP;_sAv= zXS7Dxn@%GEQxd23Z&CD6(7Gxr2U%QD31aKPXmC_&hG0aFL>W}L){Ak6Mi@ak9TUx+ zMH`hzSa%OUDNgT5)6+#5)$1@HDae|~sx2XZqI6~2&`f8*;yaB#J5{D|xbCooqM>A4 zN9~8i{MuGOVC#Q7`vaQV1EQm+A=I{jY%lA|$KXjdPGPGEkzcH22=BKtWni2=vC ziVaU3?YHJmWw|%vL)H7^7;9{0W(Jqhm5sshFdKaw%; l1)81$W)5t%c*X_Py7-AOSIACtZ_Nj)73de@+wK#8`rjW4!xR7j literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_gnuplot-members.html b/trunk/paradiseo-eo/doc/html/classeo_gnuplot-members.html new file mode 100644 index 000000000..7210441aa --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_gnuplot-members.html @@ -0,0 +1,23 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoGnuplot Member List

This is the complete list of members for eoGnuplot, including all inherited members.

+ + + + + + + + + +
className() const eoGnuplot [inline, virtual]
eoGnuplot(std::string _title, std::string _extra=std::string(""))eoGnuplot
firstTimeeoGnuplot [protected]
gnuplotCommand(const char *_command)eoGnuplot
gnuplotCommand(std::string _command)eoGnuplot [inline]
gpComeoGnuplot [protected]
initGnuPlot(std::string _title, std::string _extra)eoGnuplot [protected]
numWindoweoGnuplot [protected, static]
~eoGnuplot()eoGnuplot [virtual]

Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_gnuplot.html b/trunk/paradiseo-eo/doc/html/classeo_gnuplot.html new file mode 100644 index 000000000..3a5ddf81e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_gnuplot.html @@ -0,0 +1,242 @@ + + +EO: eoGnuplot Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoGnuplot Class Reference

Base class for calls to gnuplot. +More... +

+#include <eoGnuplot.h> +

+

Inheritance diagram for eoGnuplot: +

+ +eoGnuplot1DMonitor +eoGnuplot1DSnapshot + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

 eoGnuplot (std::string _title, std::string _extra=std::string(""))
 Open pipe to Gnuplot.
virtual ~eoGnuplot ()
 Destructor.
+virtual std::string className () const
 Class name.
+void gnuplotCommand (const char *_command)
 Send command to gnuplot.
void gnuplotCommand (std::string _command)
 Send command to gnuplot.

Protected Member Functions

void initGnuPlot (std::string _title, std::string _extra)
 Initialize gnuplot.

Protected Attributes

+bool firstTime
 The stats might be unknown in Ctor.
+PCom * gpCom
 Communication with gnuplot OK.

Static Protected Attributes

+unsigned numWindow = 0
 Internal counter for gnuplot windows.
+

Detailed Description

+Base class for calls to gnuplot. +

+This class is the abstract class that will be used by further gnuplot calls to plots what is already written by some eoMonitor into a file

+

Author:
Marc Schoenauer
+
Version:
0.0 (2001)
+ +

+ +

+Definition at line 38 of file eoGnuplot.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + +
eoGnuplot::eoGnuplot ( std::string  _title,
std::string  _extra = std::string("")
) 
+
+ + + + + +
+   + + +

+Open pipe to Gnuplot. +

+

Parameters:
+ + + +
_title Title for gnuplot window.
_extra Extra parameters to gnuplot (default <none>).
+
+ +

+Definition at line 37 of file eoGnuplot.cpp. +

+References initGnuPlot().

+

+ + + + +
+ + + + + + + + +
eoGnuplot::~eoGnuplot (   )  [virtual]
+
+ + + + + +
+   + + +

+Destructor. +

+Close the gnuplot windows if pipe was correctly opened +

+Definition at line 45 of file eoGnuplot.cpp. +

+References gpCom.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + +
void eoGnuplot::gnuplotCommand ( std::string  _command  )  [inline]
+
+ + + + + +
+   + + +

+Send command to gnuplot. +

+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. +

+Definition at line 66 of file eoGnuplot.h.

+

+ + + + +
+ + + + + + + + + + + + + + + + + + +
void eoGnuplot::initGnuPlot ( std::string  _title,
std::string  _extra
)  [protected]
+
+ + + + + +
+   + + +

+Initialize gnuplot. +

+

Parameters:
+ + + +
_title Title for gnuplot window.
_extra Extra parameters to gnuplot.
+
+ +

+Definition at line 70 of file eoGnuplot.cpp. +

+References gpCom, and numWindow. +

+Referenced by eoGnuplot().

+

The documentation for this class was generated from the following files: +
Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_gnuplot.png b/trunk/paradiseo-eo/doc/html/classeo_gnuplot.png new file mode 100644 index 0000000000000000000000000000000000000000..70095ac10c31768899d20b19000b20eeb7016359 GIT binary patch literal 678 zcmV;X0$KfuP)re&GhACADl4Fz8g-6s{*~G4uRWV8|cH@Gv?7aoIgecrw?+=P43$b z2U4reUO133xjwQ#j^apW1tNN~vcxR)R>aeeRuI}S>zZ9o| z(VOEKavV!D90DBQr4Nk#z>QwoJ07^e;o*Z&KZyHr9vn<@frE-L#Q{{N=t4O6SjC}f zSaAr{e->QD;gq2H5oC@wz!AZrgv0kSq!FSi4yTj}@hfqQ+5oCMGFA$54>#hcBQlQU z*O4(Rk|f96mvAuNjY9k_tyaN7?G~IgJrBimcC@mxiv|}ssj}jwSTIzUEM|J{Xpt0PT;Qb2idWi*Qdx3f%5z6Ii*jY< z5yn#)uk^3Ucq-Fs@3o-g{0`?9{gZ$6U&?VTHN>gEY}B>!#b$$k09{_|EYHC?#{d8T M07*qoM6N<$f|Zdvx&QzG literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_gnuplot1_d_monitor-members.html b/trunk/paradiseo-eo/doc/html/classeo_gnuplot1_d_monitor-members.html new file mode 100644 index 000000000..ffdea0fee --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_gnuplot1_d_monitor-members.html @@ -0,0 +1,40 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoGnuplot1DMonitor Member List

This is the complete list of members for eoGnuplot1DMonitor, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + +
add(const eoParam &_param)eoMonitor [inline, virtual]
className() const eoGnuplot1DMonitor [inline, virtual]
eoFileMonitor(std::string _filename, std::string _delim=" ", bool _keep=false, bool _header=false) (defined in eoFileMonitor)eoFileMonitor [inline]
eoGnuplot(std::string _title, std::string _extra=std::string(""))eoGnuplot
eoGnuplot1DMonitor(std::string _filename, bool _top=false)eoGnuplot1DMonitor [inline]
FirstPlot() (defined in eoGnuplot1DMonitor)eoGnuplot1DMonitor [virtual]
firstTimeeoGnuplot [protected]
functor_category()eoF< eoMonitor & > [inline, static]
getFileName() (defined in eoFileMonitor)eoFileMonitor [inline, virtual]
gnuplotCommand(const char *_command)eoGnuplot
gnuplotCommand(std::string _command)eoGnuplot [inline]
gpComeoGnuplot [protected]
initGnuPlot(std::string _title, std::string _extra)eoGnuplot [protected]
iterator typedef (defined in eoMonitor)eoMonitor [protected]
lastCall() (defined in eoMonitor)eoMonitor [inline, virtual]
numWindoweoGnuplot [protected, static]
operator()()eoGnuplot1DMonitor [virtual]
operator()(std::ostream &os) (defined in eoFileMonitor)eoFileMonitor [virtual]
printHeader(void) (defined in eoFileMonitor)eoFileMonitor
printHeader(std::ostream &os) (defined in eoFileMonitor)eoFileMonitor [virtual]
result_type typedefeoF< eoMonitor & >
vec (defined in eoMonitor)eoMonitor [protected]
~eoF()eoF< eoMonitor & > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoGnuplot()eoGnuplot [virtual]
~eoGnuplot1DMonitor()eoGnuplot1DMonitor [inline, virtual]

Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_gnuplot1_d_monitor.html b/trunk/paradiseo-eo/doc/html/classeo_gnuplot1_d_monitor.html new file mode 100644 index 000000000..2ded5a566 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_gnuplot1_d_monitor.html @@ -0,0 +1,63 @@ + + +EO: eoGnuplot1DMonitor Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoGnuplot1DMonitor Class Reference

Plot eoStat. +More... +

+#include <eoGnuplot1DMonitor.h> +

+

Inheritance diagram for eoGnuplot1DMonitor: +

+ +eoFileMonitor +eoGnuplot +eoMonitor +eoF< eoMonitor & > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoGnuplot1DMonitor (std::string _filename, bool _top=false)
 Constructor.
+virtual ~eoGnuplot1DMonitor ()
 Destructor.
+virtual eoMonitor & operator() ()
 The pure virtual function that needs to be implemented by the subclass.
+virtual void FirstPlot ()
+virtual std::string className () const
 Class name.
+

Detailed Description

+Plot eoStat. +

+

Author:
Marc Schoenauer
+
Version:
0.0 (2000)
+This class plots through gnuplot the eoStat given as argument

+eoGnuplot1DMonitor plots stats through gnuplot

+Assumes that the same file is appened every so and so, and replots it everytime +

+ +

+Definition at line 47 of file eoGnuplot1DMonitor.h.

The documentation for this class was generated from the following files: +
Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_gnuplot1_d_monitor.png b/trunk/paradiseo-eo/doc/html/classeo_gnuplot1_d_monitor.png new file mode 100644 index 0000000000000000000000000000000000000000..246d0671997645239020d5968e9a68eb5ef7cc7f GIT binary patch literal 1256 zcmeAS@N?(olHy`uVBq!ia0y~yVB`U^f3PqE$=BD8N&_j00G|-o|Ns93ng9PEm_I*Z z0+0p92M!#lKJ@t#5gh@i`M=RD`+nmMO@<9KXi&Fjd>GkZNp9iVbA5VVSb8f{sgJUY$ zc{j6O8*MwgGj()KX&=TV~C z7q;-b%i{f#XIxMYbZMJ={MeRKo7sk2r+hm$?cn4`zmMj&eURL1XqVnnn7rNj>z$1c zpS6GM3rx&W3GdpxaBF7whqUztqizS1zEe|D6> zC632s&9fd{=2$#Y@s{Ll2i}AQYz6_$5-S*at}w7=F)*7pG)f&HR=C;ftjQ-+Z{>Ka zQn&OclJE9id39{-znz*|J5%<5>iKQ{D%yCy?c7ORMoteka?|e#Nc=na<;1b3H<>+4 zSBbGa-jx`&YpIGf_omaH58r>{Nq#o@!vTrAQNN|1>&=v9l{|LjoE4ZmQ9-sGNi|tT#V=+4a8sugKe;b1!9yt-37}~R2D@XU(XRVyQ_bQ@V*VYD=t=h0vVkby28kjy_^vpk= z@q|rL{7R;p_zFhFUJ(cBM3W$f+?I#8~X>Gg}iQ#CKYynf(V zSMHX+=jaDx;mx0B=^uM0FU^GubFixHlCjP z>7=~Ol|LeP{|ZkycfoMp5@W06`4>;{I_XvXzxLcvzP-QUaR*b65$lD+rH9=lT)7s= zZ(p3hOwdi)d5f{x!9thxoXe7#R?24!kFE9K+A}q#Z~s-LmpvwPCoVI-RN^-4oCi?4 zPAu7gJ-9=$u6E(!61S7r#jVb8_PpJ&|I_sc+uM)sdS6-_T6xUCd~YI8+qA?e)A@T= zDI7L8-J5v-oxzW%Q@I}t9*I5q;q^aF=X+Z<4sW-%<>+}W5cap}wo-DG_k6B1r!9Gm z^>^M#j1fDwRp;=LXZrpUmo+VB3i=gt_Y{0k?CDXQ^KbV?L;G62 + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoGnuplot1DSnapshot Member List

This is the complete list of members for eoGnuplot1DSnapshot, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
add(const eoParam &_param)eoFileSnapshot [inline, virtual]
baseFileName() (defined in eoFileSnapshot)eoFileSnapshot [inline, virtual]
className() const eoGnuplot1DSnapshot [inline, virtual]
eoFileSnapshot(std::string _dirname, unsigned _frequency=1, std::string _filename="gen", std::string _delim=" ", unsigned _counter=0, bool _rmFiles=true) (defined in eoFileSnapshot)eoFileSnapshot [inline]
eoGnuplot(std::string _title, std::string _extra=std::string(""))eoGnuplot
eoGnuplot1DSnapshot(std::string _dirname, unsigned _frequency=1, std::string _filename="gen", std::string _delim=" ", unsigned _counter=0, bool _rmFiles=true) (defined in eoGnuplot1DSnapshot)eoGnuplot1DSnapshot [inline]
eoGnuplot1DSnapshot(std::string _dirname, eoRealVectorBounds &_bounds, unsigned _frequency=1, std::string _filename="gen", std::string _delim=" ", unsigned _counter=0, bool _rmFiles=true) (defined in eoGnuplot1DSnapshot)eoGnuplot1DSnapshot [inline]
eoGnuplot1DSnapshot(eoFileSnapshot &_fSnapshot) (defined in eoGnuplot1DSnapshot)eoGnuplot1DSnapshot [inline]
eoGnuplot1DSnapshot(eoFileSnapshot &_fSnapshot, eoRealVectorBounds &_bounds) (defined in eoGnuplot1DSnapshot)eoGnuplot1DSnapshot [inline]
firstTimeeoGnuplot [protected]
functor_category()eoF< eoMonitor & > [inline, static]
getCounter()eoFileSnapshot [inline]
getDirName() (defined in eoFileSnapshot)eoFileSnapshot [inline, virtual]
getFileName()eoFileSnapshot [inline]
gnuplotCommand(const char *_command)eoGnuplot
gnuplotCommand(std::string _command)eoGnuplot [inline]
gpComeoGnuplot [protected]
handleBounds(eoRealVectorBounds &_bounds) (defined in eoGnuplot1DSnapshot)eoGnuplot1DSnapshot [inline, virtual]
hasChanged()eoFileSnapshot [inline, virtual]
initGnuPlot(std::string _title, std::string _extra)eoGnuplot [protected]
iterator typedef (defined in eoMonitor)eoMonitor [protected]
lastCall() (defined in eoMonitor)eoMonitor [inline, virtual]
numWindoweoGnuplot [protected, static]
operator()()eoGnuplot1DSnapshot [virtual]
eoFileSnapshot::operator()(std::ostream &_os)eoFileSnapshot [inline]
pointSize (defined in eoGnuplot1DSnapshot)eoGnuplot1DSnapshot [protected]
result_type typedefeoF< eoMonitor & >
setCurrentFileName()eoFileSnapshot [inline]
setPointSize(unsigned _pointSize) (defined in eoGnuplot1DSnapshot)eoGnuplot1DSnapshot [inline]
vDouble typedef (defined in eoFileSnapshot)eoFileSnapshot
vDoubleParam typedef (defined in eoFileSnapshot)eoFileSnapshot
vec (defined in eoMonitor)eoMonitor [protected]
~eoF()eoF< eoMonitor & > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoGnuplot()eoGnuplot [virtual]
~eoGnuplot1DSnapshot() (defined in eoGnuplot1DSnapshot)eoGnuplot1DSnapshot [inline, virtual]

Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_gnuplot1_d_snapshot.html b/trunk/paradiseo-eo/doc/html/classeo_gnuplot1_d_snapshot.html new file mode 100644 index 000000000..c312ad090 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_gnuplot1_d_snapshot.html @@ -0,0 +1,73 @@ + + +EO: eoGnuplot1DSnapshot Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoGnuplot1DSnapshot Class Reference

Plot stats through gnuplot. +More... +

+#include <eoGnuplot1DSnapshot.h> +

+

Inheritance diagram for eoGnuplot1DSnapshot: +

+ +eoFileSnapshot +eoGnuplot +eoMonitor +eoF< eoMonitor & > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoGnuplot1DSnapshot (std::string _dirname, unsigned _frequency=1, std::string _filename="gen", std::string _delim=" ", unsigned _counter=0, bool _rmFiles=true)
+ eoGnuplot1DSnapshot (std::string _dirname, eoRealVectorBounds &_bounds, unsigned _frequency=1, std::string _filename="gen", std::string _delim=" ", unsigned _counter=0, bool _rmFiles=true)
+ eoGnuplot1DSnapshot (eoFileSnapshot &_fSnapshot)
+ eoGnuplot1DSnapshot (eoFileSnapshot &_fSnapshot, eoRealVectorBounds &_bounds)
+virtual eoMonitor & operator() ()
 The operator(void): opens the std::ostream and calls the write method.
+virtual std::string className () const
 Class name.
+virtual void handleBounds (eoRealVectorBounds &_bounds)
+void setPointSize (unsigned _pointSize)

Protected Attributes

+unsigned pointSize
+

Detailed Description

+Plot stats through gnuplot. +

+

Author:
Marc Schoenauer 2000
+
Version:
0.0
+This class plots through gnuplot the eoStat given as argument

+Assumes that the same file is re-written every so and so, and plots it from scratch everytime it's called +

+ +

+Definition at line 51 of file eoGnuplot1DSnapshot.h.

The documentation for this class was generated from the following files: +
Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_gnuplot1_d_snapshot.png b/trunk/paradiseo-eo/doc/html/classeo_gnuplot1_d_snapshot.png new file mode 100644 index 0000000000000000000000000000000000000000..947ca3ed212e9b4112f5fbf96b96e731ae0946f4 GIT binary patch literal 1353 zcmbtUX;4!K5RM2%C_+WlKtVcol;VL!Y9bFbavOxlktifWfuR_#qQFC;Aqb8GjgFxs z2GsD1#*Q&DhZqM9a!FIt3Hpd6fE)=bN{A8UsDwLx^;iEh^X=}p`{Uc$otr)zr)Ocw=v@sW_A5_UIpF zw>9pE99Y^Sk59@L_1Sn_$QP@o?2q22C>rD6SVfM(bDHr5em%?P;MM0`R%AZS6P9#S zs6(^%M)}j}<+tgAM;~CBaN{Uj8)euv$~x*W4(i)wQVInrKVIXwCGPk&KjiV3alLqF zAc!_*2m3&0QuFP^*&ncXt$rO&%3RC!fhBwIZfbz;sQbxVfsmVkeA*X~u#uInS<#KSp4xLl@kYm@!P(dV)s#bZ7|uh(F$yVN$qzi^ zSviq>{e=Y}zUXhN0bBKjo=7`W={jE9nEr_`PK}s=4;<^Y$VxI;c2-0!>#p}b-AA4T zX$^bmdhJmEp;x;4^?GEGyDcaE?RAjGG$IhdQ3mnWX)Nqk z330Y?U@)>ZGgx3cIV7I?qk^& zc~}$iW45UvYVa!O;U&6#N-MAGY-^czm{pWTM zu`;Y~cz#llu+9e(7@X!P<`-T2pm4H=pX(Pp)iH{#Z7!fIKJJW(-mVl~0h{FoY}ZpX zpvSSVwKa1o1w8~Dy8_%mX6Ahjq@nA$MdGrMxc!2$;y{?t5!WB9z{{Z0N + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoHammingDistance< EOT > Member List

This is the complete list of members for eoHammingDistance< EOT >, including all inherited members.

+ + + + +
functor_category()eoBF< const EOT &, const EOT &, double > [inline, static]
operator()(const EOT &_v1, const EOT &_v2)eoHammingDistance< EOT > [inline, virtual]
~eoBF()eoBF< const EOT &, const EOT &, double > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_hamming_distance.html b/trunk/paradiseo-eo/doc/html/classeo_hamming_distance.html new file mode 100644 index 000000000..3de8fd9fd --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_hamming_distance.html @@ -0,0 +1,43 @@ + + +EO: eoHammingDistance< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoHammingDistance< EOT > Class Template Reference

This is a generic class for L1 distance computation: assumes the 2 things are std::vectors of something that is double-castable For bitstrings, this is the Hamming distance. +More... +

+#include <eoDistance.h> +

+

Inheritance diagram for eoHammingDistance< EOT >: +

+ +eoDistance< EOT > +eoBF< const EOT &, const EOT &, double > +eoFunctorBase + +List of all members. + + + + + +

Public Member Functions

+double operator() (const EOT &_v1, const EOT &_v2)
 The pure virtual function that needs to be implemented by the subclass.
+

Detailed Description

+

template<class EOT>
+ class eoHammingDistance< EOT >

+ +This is a generic class for L1 distance computation: assumes the 2 things are std::vectors of something that is double-castable For bitstrings, this is the Hamming distance. +

+ +

+Definition at line 66 of file eoDistance.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_hamming_distance.png b/trunk/paradiseo-eo/doc/html/classeo_hamming_distance.png new file mode 100644 index 0000000000000000000000000000000000000000..35d7bde17b41556bcfc50aa54710728c2f18fa29 GIT binary patch literal 1963 zcmbW2dsNd$7RRI3Wl5KZ0*gffsn8YFii`Y^AdgU31xZB0!xC^UNC1-%2?-Aap@0H~ zC_+UfKOUx#h)@Vr9s&V^@@NeqND2W$kN`##gb1P{uWSz6bL?(+&*|wOGxMF9J9F;L z{oI*vypbogphi##1fu0}(#;0~*-BSy?nm3ywSUC~N!{%7_VRUCsZ?sIQgKU5&)-n1 z&BEn!DGyaM>h2bj4-y4&k&R#=5DmD88{9X(Xs(DyoVL<;uU1r=eEb=0VLb)?ZbP@M z&vsF1M_^}&DLPa8!CKtvr~4{!iD>;@OM{dhA=lgQVE+=cT}Vt=8tM?j%jd%QRwmMR!wS z)&{FPQWrdhg*7SW80^~GW@SVSBQD2Ry5B$`7CAF(Zc?DdmG{P1HNml-@@p<~iAOaP zyJOJylpMFRZS9CI2squO+{U?CGE;3ZL-;j@s^Jz#d7!`h8NVeJS zhXq3xgIiGR!aWkg7ztW^{{l)eFtr9X1*J^tVb5^zZPv}?S{0{D*UYM^W&JHw;^dsM zZrj_2y3T)yDUn;1+Ha4>f|0C@iR`p5wswx{J2`zjavs&giA1xl!KR1bpcx*_F=adL|Wb};OZVZZgfh1%;q2?cG(CqWOCjh&;1aYz4a?ulP zwQ;pMpTlzp))Z=_a{KR;jy@6ptapn+H0A$++GrO8~>+iEpTSm(`mIDd*&k7rs z265Ti*cJg87_m&B55L@>wvpwBBcttdZ4`&ta(H^{45_1V5fj)qNH@W>Sk2poE@j=W zo2Ji~aIq^-rSnQx2gKns62Y{1v>lIZTB1CrBu-aMg36%=KA~n#DQw`IYT!R*Aj~(( z@G2Nq&JPa=9Juj)8Y^pmX1#%2w650h&W?2a8cI!WFo9bH|D`?~4r|%bt6okh=QL*`n%A7d+HNHk2aEN;qamV$ zM}HvqmY^O1fbz$eVT8Ks(h|UDHdYd$~Ifs-T%1w!Cd|@LFqq`gE$_(LE36E=0=?8a9I7QUUTMM zfKL9M%P9ckl7Z|0jL+{MR7Y~{=)s*-pWVNTF(+K8k~fP-*2^Zy7Uco<+58_ix^8Vs z4nN4OQ&fD(AkRn3+};p=Ry5DxJLnH3lGaRlM%`PDL$Ih0nD{it#-Fa);1}YNGuyax zunML_KxIB;v2Wb0+TWZMvxC{~m3-#86fdhhQD-g+YIqJaoN5kuO#|$JvJPLf$S)6E z><7av%w>FsE?dWO!V1*G)zewZvrY2Tl>2EDUbBCD#JuacMk=K#m5Q6Pe|=Z)m6}xl zS8!L*-i0^8aD_w;TR9{WE=l#=`4Q)W~BZ)Oq?LEoQht@0%fJz}xw~ zoDrqZ1Ib(LtK9-B4;lXy^F+9Ohj+wuvA$^E*q$KVHFyTaB!g!?G8et8hc|id-1w=l z;>Ny63O%;ZI-Q*YIQE0@3`(x*9fOLkX$zfmTB^{{V}q6LIGmG>SO;gb7M0hg^;2}C zywz(;BGg?PC8^2QgXKgB1HJ0x{@*$P)fTHT(~F{_y)h2LS+dC!46XjCP&vx!LmmGy zyRNx0VR0nr89yIUYS;TI;auz@rjAwWNcdc|6dfr%33j|5W75S zQQ9v%32NWqOGlsnwNy$1oS`3{1JZ^2a!M;Xu}fz9CU7z^J(gRk{#hX&?nt*9*Ym0W E0zl)`LI3~& literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_hoist_mutation-members.html b/trunk/paradiseo-eo/doc/html/classeo_hoist_mutation-members.html new file mode 100644 index 000000000..f70a9c863 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_hoist_mutation-members.html @@ -0,0 +1,32 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoHoistMutation< FType, Node > Member List

This is the complete list of members for eoHoistMutation< FType, Node >, including all inherited members.

+ + + + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
className() const eoHoistMutation< FType, Node > [inline, virtual]
eoHoistMutation()eoHoistMutation< FType, Node > [inline]
eoMonOp()eoMonOp< eoParseTree< FType, Node > > [inline]
eoOp(OpType _type)eoOp< eoParseTree< FType, Node > > [inline]
eoOp(const eoOp &_eop)eoOp< eoParseTree< FType, Node > > [inline]
EoType typedef (defined in eoHoistMutation< FType, Node >)eoHoistMutation< FType, Node >
functor_category()eoUF< eoParseTree< FType, Node > &, bool > [inline, static]
general enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
getType() const eoOp< eoParseTree< FType, Node > > [inline]
operator()(EoType &_eo1)eoHoistMutation< FType, Node > [inline]
eoMonOp< eoParseTree< FType, Node > >::operator()(eoParseTree< FType, Node > &)=0eoUF< eoParseTree< FType, Node > &, bool > [pure virtual]
quadratic enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
unary enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoHoistMutation()eoHoistMutation< FType, Node > [inline, virtual]
~eoOp()eoOp< eoParseTree< FType, Node > > [inline, virtual]
~eoUF()eoUF< eoParseTree< FType, Node > &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_hoist_mutation.html b/trunk/paradiseo-eo/doc/html/classeo_hoist_mutation.html new file mode 100644 index 000000000..db3926f37 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_hoist_mutation.html @@ -0,0 +1,147 @@ + + +EO: eoHoistMutation< FType, Node > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoHoistMutation< FType, Node > Class Template Reference
+ +[ParseTree] +

eoHoistMutation --> replace the individual with one of its subtree's +More... +

+#include <gp/eoParseTreeOp.h> +

+

Inheritance diagram for eoHoistMutation< FType, Node >: +

+ +eoMonOp< eoParseTree< FType, Node > > +eoOp< eoParseTree< FType, Node > > +eoUF< eoParseTree< FType, Node > &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + +

Public Types

+typedef eoParseTree< FType,
+ Node > 		EoType

Public Member Functions

 eoHoistMutation ()
 Constructor.
+virtual std::string className () const
 The class name.
+virtual ~eoHoistMutation ()
 Dtor.
bool operator() (EoType &_eo1)
 Mutate an individual.
+

Detailed Description

+

template<class FType, class Node>
+ class eoHoistMutation< FType, Node >

+ +eoHoistMutation --> replace the individual with one of its subtree's +

+ +

+Definition at line 336 of file eoParseTreeOp.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + +
+template<class FType, class Node>
eoHoistMutation< FType, Node >::eoHoistMutation (   )  [inline]
+
+ + + + + +
+   + + +

+Constructor. +

+

Parameters:
+ + +
none 
+
+ +

+Definition at line 345 of file eoParseTreeOp.h.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class FType, class Node>
bool eoHoistMutation< FType, Node >::operator() ( EoType &  _eo1  )  [inline]
+
+ + + + + +
+   + + +

+Mutate an individual. +

+

Parameters:
+ + +
_eo1 The individual that is to be changed
+
+ +

+Definition at line 358 of file eoParseTreeOp.h. +

+References eoRng::random().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:49 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_hoist_mutation.png b/trunk/paradiseo-eo/doc/html/classeo_hoist_mutation.png new file mode 100644 index 0000000000000000000000000000000000000000..785816dfd0c17a3845d9dbf54c8db5ff4f12a5d1 GIT binary patch literal 2288 zcmbW3doSNTz{rUW|SC1E>pQ{2A#qXCJ`sb zWzvWym)B+H5HVzodlFvPPGQ`JIdjf>d)Ha-AMaY{{IQ???C*Nk+WWiLXRoyr9PG}? zN<*a~5Qr?&+R_mM5%&`L`mN$3B_;;Z9Gh8Fp#@5FEdGsu0~d1*H{9Caj~4oJh#f^cUQXdVn& z{Ei6#qGUL>g(`LwrMuB^b^#0_E+UMvKsm;0wz7G!yyj<18S(me1YLj9{jfMeci24%( zx!sS;UG-xoZ3Fv^(@;0Lu;kTgVlKJ8Ge5LuyK9*Xq)`-?HpP%S{ohKY>n4#Cycq?vaTo#;`b5E9)Kc-S% z8*CC1u)HzW&AUhMtGf{JxRR=WNMXcnwetvBU3Fb2&&<2_V*{K;xbI8T`OXm?gIZ7T zw`&}UEdI4H7=peVb5*=tQKV72#p)KjJV&_@?QNc;&L0jTav5XbnxUrOxUjAAbAkG&d2WC)9v zw1xX)Z9vRum#S+OJXTqUoEuY&#tv%D-SPO+b4vLxzGs?{x$Y!*o1Zxz2$s%1tJaMo zM#PV~)}5ZYv!^tTzF9jj@E-%I0d;*&`utmr8N@6*PNpWE&Pc(Su?o|5fg5Yc!~~s@ zgy)uSL&LDFm$v703)%eI0ZW5Rask;&>j4ovtGm|K7O1i*UqBk6PtO&oSYasfZvX&yfEM%8z8*J*@h~ zJAZTvxP5T0+t|J-h&1+U6FU%ux*nsROg~Chnu(>DewxIwT_~CY>CLL7<{+O3md5A` zYf)%vhiYq;o&^;d398lp` zto$rNY$T|xs->+Zl1bAgop-;7dm+eSukP$Xiw*E7cEr&i@nogwka=Vrjz$cKzcUSG z9%|YX0Z#vx?FlWGCUaEDJuxhd_OlHe?@5atDiX!&=4v8@B4{FtMLd02Z7Nb0|1X@i zP%CzlqBoSkUeZd`tJ1Q?n2mTy$h`b(9#4pZmhvIvfzA)o<(2O2|Z;QPI9O#zIdve za_a=E;2`MwM}6g*^WY$-q`)3*Sg3g>kRd$&BjB)-6X$Ih0ab|P@E-gbvjTO~iV9)( zzHH6=ei{jK?!QJN56Ti773D?UHRD9>>6zB8To7~VRNXTe`t&cse{7X}Wu>!&i-x0} zP40GgQq2Ez6QaE@_|RlGHquLR-x~Qk&);dh8t5CvA6;m1oGsZoqIMwdiExLnmED5-o4!(9xc%Abb6?3rRBv?XS zd{de5dQ;d1l}B8iQCfSL4m{esdEQNPBRr3Kxg+x_EVqsKQqRf?0B!Xr;!@1eQ&6&D z2A$yn&~ltCzy>79acX6RJZLO7%#f;ZufpZy)xx}_X9Y-3-Quaq`>f~+kk$wF>nGFw zuajbQalqMMQUICW30196sdySvri;tFrtY_4gw9rak~YJ$5rmZSRAH6aH318T-F%jT zC)8!B@e|z?+>-;!R>YP@7XIA@zD)~+Dii@%J@9oa4sZ>p<6O5TRk()eef*WXm4Ta# bm3{Fq>OUwRe+U(QPasGuJIm5Dp7(zTJZV+v literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_how_many-members.html b/trunk/paradiseo-eo/doc/html/classeo_how_many-members.html new file mode 100644 index 000000000..982e68f92 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_how_many-members.html @@ -0,0 +1,27 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoHowMany Member List

This is the complete list of members for eoHowMany, including all inherited members.

+ + + + + + + + + + + + + +
combien (defined in eoHowMany)eoHowMany [private]
eoHowMany(double _rate=0.0, bool _interpret_as_rate=true)eoHowMany [inline]
eoHowMany(int _combien)eoHowMany [inline]
eoHowMany(unsigned int _combien)eoHowMany [inline]
operator()(unsigned int _size)eoHowMany [inline]
operator-()eoHowMany [inline]
printOn(std::ostream &_os) const eoHowMany [inline, virtual]
rate (defined in eoHowMany)eoHowMany [private]
readFrom(std::istream &_is)eoHowMany [inline, virtual]
readFrom(std::string _value) (defined in eoHowMany)eoHowMany [inline]
~eoHowMany()eoHowMany [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]

Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_how_many.html b/trunk/paradiseo-eo/doc/html/classeo_how_many.html new file mode 100644 index 000000000..59b657bad --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_how_many.html @@ -0,0 +1,250 @@ + + +EO: eoHowMany Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoHowMany Class Reference

A helper class, to determine a number of individuals from another one Typically, is used in selection / replacement procedures, e.g. +More... +

+#include <eoHowMany.h> +

+

Inheritance diagram for eoHowMany: +

+ +eoPersistent +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

 eoHowMany (double _rate=0.0, bool _interpret_as_rate=true)
 Original Ctor from direct rate + bool.
+ eoHowMany (int _combien)
 Ctor from an int - both from int and unsigned int are needed to avoid ambiguity with the Ctor from a double.
+ eoHowMany (unsigned int _combien)
 Ctor from an unsigned int - both from int and unsigned int are needed to avoid ambiguity with the Ctor from a double.
+virtual ~eoHowMany ()
 Virtual dtor. They are needed in virtual class hierarchies.
unsigned int operator() (unsigned int _size)
 Does what it was designed for combien==0 : return rate*_size else combien>0 : return combien (regardless of _size) combien<0 : return _size-|combien|.
virtual void printOn (std::ostream &_os) const
 Write object.
virtual void readFrom (std::istream &_is)
 Read object.
+void readFrom (std::string _value)
+eoHowMany operator- ()
 The unary - operator: reverses the computation.

Private Attributes

+double rate
+int combien
+

Detailed Description

+A helper class, to determine a number of individuals from another one Typically, is used in selection / replacement procedures, e.g. +

+the number of offspring from the number of parents, or the number of survivors for an eoReduce functor, ...

+Such construct is very useful because in some cases you might not know the population size that will enter the replacement. For instance, you cannot simply have a pre-computed (double) rate of 1/popSize if you want to select or kill just 1 guy. Using an eoHowMany allows one to modify the population size without touching anything else.

+There are 4 possible way to compute the return value from the argument:

    +
  • an absolute POSITIVE integer --> return it (regardless of popsize)
  • a POSITIVE rate --> return rate*popSize
  • an absolute NEGATIVE integer --> return popsize-rate (if positive)
  • a NEGATIVE rate in [-1,0] --> store and use 1-|rate| (positive) Note that a negative rate should be have been necessary because a rate is relative, but it is there for consistency reasons - and because it is needed in eoG3Replacement
+

+It has 2 private members, a double and an integer to cover all cases

+Example use: in eoGeneralBreeder.h Example reading from parser: in do/make_algo_scalar.h line 141

+MS 10/04/2002: Added the possibility to have a negative number - when treated as a number: returns then (size - combien) Should not modify anything when a positive number is passed in the ctor

+MS 20/06/2002: Added the negative rate and the operator-() (for eoG3Repalcement)

+It is an eoPersistent because we need to be able to use eoParamValue<eoHowMany> +

+ +

+Definition at line 69 of file eoHowMany.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + +
eoHowMany::eoHowMany ( double  _rate = 0.0,
bool  _interpret_as_rate = true
)  [inline]
+
+ + + + + +
+   + + +

+Original Ctor from direct rate + bool. +

+

Parameters:
+ + + +
rate the rate, OR the integer to store, depending on 2nd arg.
_interpret_as_rate to tell whether the rate actually is a rate
+
+ +

+Definition at line 76 of file eoHowMany.h.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + +
unsigned int eoHowMany::operator() ( unsigned int  _size  )  [inline]
+
+ + + + + +
+   + + +

+Does what it was designed for combien==0 : return rate*_size else combien>0 : return combien (regardless of _size) combien<0 : return _size-|combien|. +

+

    +
  • * - * - * -
+ +

+Definition at line 114 of file eoHowMany.h.

+

+ + + + +
+ + + + + + + + + +
virtual void eoHowMany::printOn ( std::ostream &  _os  )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Write object. +

+It's called printOn since it prints the object on a stream.

Parameters:
+ + +
_os A std::ostream.
+
+ +

+Implements eoPrintable. +

+Definition at line 130 of file eoHowMany.h.

+

+ + + + +
+ + + + + + + + + +
virtual void eoHowMany::readFrom ( std::istream &  _is  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Read object. +

+

Parameters:
+ + +
_is A std::istream.
+
+
Exceptions:
+ + +
runtime_std::exception If a valid object can't be read.
+
+ +

+Implements eoPersistent. +

+Definition at line 140 of file eoHowMany.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_how_many.png b/trunk/paradiseo-eo/doc/html/classeo_how_many.png new file mode 100644 index 0000000000000000000000000000000000000000..9af20f58724511b89b18d49120cbbcbfea3c6726 GIT binary patch literal 480 zcmV<60U!Q}P)BL zAPk0KGi%HZ%n7RYLS5zlN2nh>9ENs?qDT`J5`i%v#$%Mx@4jZ+hx<&E?Y<~Lq#l#) z;uwue{D~q^$S5cxrU*16A0qo8T9iBlDM}Xblzlv4K5CD0uDT`4*F?cmZ4(pmZg=g)saC?NIMCnvawC!(7|*jCK_;Fv!o-8qVF;0W?gb-rUwyyB9kDasL41 Wz9#~M + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoIncrementor< T > Member List

This is the complete list of members for eoIncrementor< T >, including all inherited members.

+ + + + + + + + + + +
className(void) const (defined in eoIncrementor< T >)eoIncrementor< T > [inline, virtual]
counter (defined in eoIncrementor< T >)eoIncrementor< T > [private]
eoIncrementor(T &_counter, T _stepsize=1)eoIncrementor< T > [inline]
functor_category()eoF< void > [inline, static]
lastCall() (defined in eoUpdater)eoUpdater [inline, virtual]
operator()()eoIncrementor< T > [inline, virtual]
result_type typedefeoF< void >
stepsize (defined in eoIncrementor< T >)eoIncrementor< T > [private]
~eoF()eoF< void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_incrementor.html b/trunk/paradiseo-eo/doc/html/classeo_incrementor.html new file mode 100644 index 000000000..b20353f3a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_incrementor.html @@ -0,0 +1,57 @@ + + +EO: eoIncrementor< T > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoIncrementor< T > Class Template Reference

an eoUpdater that simply increments a counter +More... +

+#include <eoUpdater.h> +

+

Inheritance diagram for eoIncrementor< T >: +

+ +eoUpdater +eoF< void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + +

Public Member Functions

+ eoIncrementor (T &_counter, T _stepsize=1)
 Default Ctor - requires a reference to the thing to increment.
+virtual void operator() ()
 Simply increments.
+virtual std::string className (void) const

Private Attributes

+T & counter
+T stepsize
+

Detailed Description

+

template<class T>
+ class eoIncrementor< T >

+ +an eoUpdater that simply increments a counter +

+ +

+Definition at line 50 of file eoUpdater.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_incrementor.png b/trunk/paradiseo-eo/doc/html/classeo_incrementor.png new file mode 100644 index 0000000000000000000000000000000000000000..63bd4b3750b0cb9b452e4e82643d91820e0ba1fa GIT binary patch literal 624 zcmV-$0+0QPP)MV*>}RV184^ zv7DW~(;m(dHhYWb;-wBUt!=YUw{h(Y+7|Aeoyrs!_>Hrh&J$`Bdnk8a&rU!$I{$z< zep>wCA9crmdI8VGKQ6DtFPEPe;;-$zVWNI(wFnqi0`r zUZ&%nztbE)E$%w*Nx17c#~pXvamUY#yN-J|yxyQu9sUBZf`TQ8Ovzr$_3{9M;a$d@a|<+jHEucgDN+ zzj4=bPr_ZtIqtaQjyrx{91dAXM{0|Xm-&8_T}Zr38p=J-O z?4e{21KFG6<9_kmXTNq{8k9omc+4xUT06h@#XW3}pB6v%NBs*ty_d`GC9n_x0000< KMNUMnLSTZc@h*P= literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_incrementor_param-members.html b/trunk/paradiseo-eo/doc/html/classeo_incrementor_param-members.html new file mode 100644 index 000000000..841a4123f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_incrementor_param-members.html @@ -0,0 +1,41 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoIncrementorParam< T > Member List

This is the complete list of members for eoIncrementorParam< T >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + +
className(void) const (defined in eoIncrementorParam< T >)eoIncrementorParam< T > [inline, virtual]
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
eoIncrementorParam(std::string _name, T _stepsize=1)eoIncrementorParam< T > [inline]
eoIncrementorParam(std::string _name, T _countValue, T _stepsize)eoIncrementorParam< T > [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoValueParam(void)eoValueParam< T > [inline]
eoValueParam(T_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< T > [inline]
functor_category()eoF< void > [inline, static]
getValue(void) const eoValueParam< T > [inline, virtual]
lastCall() (defined in eoUpdater)eoUpdater [inline, virtual]
longName() const eoParam [inline]
operator()()eoIncrementorParam< T > [inline, virtual]
repValue (defined in eoValueParam< T >)eoValueParam< T > [protected]
required() const eoParam [inline]
result_type typedefeoF< void >
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< T > [inline, virtual]
shortName() const eoParam [inline]
stepsize (defined in eoIncrementorParam< T >)eoIncrementorParam< T > [private]
value()eoValueParam< T > [inline]
value() const eoValueParam< T > [inline]
~eoF()eoF< void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]

Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_incrementor_param.html b/trunk/paradiseo-eo/doc/html/classeo_incrementor_param.html new file mode 100644 index 000000000..251a8e7f7 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_incrementor_param.html @@ -0,0 +1,60 @@ + + +EO: eoIncrementorParam< T > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoIncrementorParam< T > Class Template Reference

an eoUpdater that is an eoValueParam (and thus OWNS its counter) Mandatory for generation counter in make_checkpoint +More... +

+#include <eoUpdater.h> +

+

Inheritance diagram for eoIncrementorParam< T >: +

+ +eoUpdater +eoValueParam< T > +eoF< void > +eoParam +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoIncrementorParam (std::string _name, T _stepsize=1)
 Default Ctor : a name and optionally an increment.
+ eoIncrementorParam (std::string _name, T _countValue, T _stepsize)
 Ctor with a name and non-zero initial value and mandatory stepSize to remove ambiguity.
+virtual void operator() ()
 Simply increments.
+virtual std::string className (void) const

Private Attributes

+T stepsize
+

Detailed Description

+

template<class T>
+ class eoIncrementorParam< T >

+ +an eoUpdater that is an eoValueParam (and thus OWNS its counter) Mandatory for generation counter in make_checkpoint +

+ +

+Definition at line 71 of file eoUpdater.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_incrementor_param.png b/trunk/paradiseo-eo/doc/html/classeo_incrementor_param.png new file mode 100644 index 0000000000000000000000000000000000000000..dd5c071d02582e7d03384d29e32d6188400266e9 GIT binary patch literal 1303 zcmeAS@N?(olHy`uVBq!ia0y~yVDtjA53n!;$qCWsHb6=uz$e7@|Ns9$=Kuc(=Fd-< z0FndY0|yRNANv0U$Yd-D@(X5gcy=R=fq`YMr;B4q#hkZu?v|}q5O90!yS~-D;WOLw zJp$pi|J^MN6cmrmzgRQ5Q#XG1nnl^Wn=f1`nYO+D!5x=R*PTBvk1ji%_j0e{vYSO) zuhva@y0~}s+IK$#c)i7c8+@Cgs{VS8ukNvBY1xxiWgU)dM5%3kVH6oPJ$lmih5OFT z&RZFNKQD8Iz52tP%+ou1*2dj5>e^EKGh^oZidUiE4R(wCx|AP%X~x#>%^vA7yEbK| zPy6+F)6B=`Ci&zPR`y-qQF83%`H$h3ba$t2e>2Vg+9#>T zPo$>Zzwa2`I59gSF8N!DcS6%P25raahN%m54|rV=OHj?=-XOGvHG=aN(;Ajs#xOFa zSEY;poFd96`tyhs-`i;x8QYIIZf{JB`AI&5Yc4X?pI~ zN!z!+dp_l9PRz51eKOM-PA|8d7q+qZPH?PHsQTQkHnacnb+VLs%WQ~#)Uf}CP+hQA z+3z!+3G$T+1sXCMjG`;AG&-+O)C^k5+#YxMlho$r(RD@vEL`ke4i6m!fhw3@mbMrLc zhy5qNN}Wya`Y~Vvg`b!mkysfY9yV8Db&ZaMGReMh_E3JCV z-RclMZR>~SQ9)1p4Ug+^x4Cs1Zhdm{X{`z0imTJOP0ljicG~{y(s`ZJqVdw-Pfufg zyf$}z#mmEKGIQRX?k%i*)b;xl&uZ%zCqG@;F-I+Z*P+WY<(EO$vpT1nzm!Z%oAr3h z+oIQdGd?_!sei$rXL4V0w<`B9=YO{>xZX^&c%Z+n<^GheyLQDwH{9hoWVqP99M%V} zEap9(9r7xMP|(+Tv*evTKmFcH{w2|mF6kD&oVKIHJ7$-v-d&;Tc{}GHOfWtb(NqcI zbawA}`it|_ydS?43d^mx+8-!-DJnj|jonH4J%q|vKlWnswfwdyH{&Pso$t*JdzT$pBC&YV%4vsxsGZ(&;`a78*WO8< z+96Z)|M}fzPF>69q{{p;_Ri|O|8`!E`0PvPclfx^uwIhk_3i1~mHNxi?K-Q|{_E?z zeKmU?J^m$Hzpdu+jy1(|j@?^(Cij+^%9Q67J0F>Be{2*T=HXfY{@_xW$2cNi-F^9w ZeWq^ra|dUBLtrV!;OXk;vd$@?2>{FVaOeO4 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_init-members.html b/trunk/paradiseo-eo/doc/html/classeo_init-members.html new file mode 100644 index 000000000..a4eb09aae --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_init-members.html @@ -0,0 +1,19 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoInit< EOT > Member List

This is the complete list of members for eoInit< EOT >, including all inherited members.

+ + + + + +
className(void) const eoInit< EOT > [inline, virtual]
functor_category()eoUF< EOT &, void > [inline, static]
operator()(EOT &)=0eoUF< EOT &, void > [pure virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< EOT &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_init.html b/trunk/paradiseo-eo/doc/html/classeo_init.html new file mode 100644 index 000000000..34990aa00 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_init.html @@ -0,0 +1,91 @@ + + +EO: eoInit< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoInit< EOT > Class Template Reference

Base (name) class for Initialization of chromosomes, used in a population contructor. +More... +

+#include <eoInit.h> +

+

Inheritance diagram for eoInit< EOT >: +

+ +eoUF< EOT &, void > +eoFunctorBase +eoCombinedInit< EOT > +eoDistribution< EOT > +eoInitFixedLength< EOT > +eoInitVariableLength< EOT > +eoRealInitBounded< EOT > +eoPBILDistrib< EOT > +eoEsChromInit< EOT > + +List of all members. + + + + + +

Public Member Functions

virtual std::string className (void) const
 className: Mandatory because of eoCombinedInit.
+

Detailed Description

+

template<class EOT>
+ class eoInit< EOT >

+ +Base (name) class for Initialization of chromosomes, used in a population contructor. +

+It is derived from eoMonOp, so it can be used inside the algorithm as well.

+

See also:
eoPop
+ +

+ +

+Definition at line 45 of file eoInit.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
virtual std::string eoInit< EOT >::className ( void   )  const [inline, virtual]
+
+ + + + + +
+   + + +

+className: Mandatory because of eoCombinedInit. +

+SHould be pure virtual, but then we should go over the whole code to write the method for all derived classes ... MS 16/7/04 +

+Reimplemented in eoCombinedInit< EOT >, eoPBILDistrib< EOT >, eoParseTreeDepthInit< FType, Node >, and eoStParseTreeDepthInit< FType, Node >. +

+Definition at line 52 of file eoInit.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_init.png b/trunk/paradiseo-eo/doc/html/classeo_init.png new file mode 100644 index 0000000000000000000000000000000000000000..a1983a680adda2c67c5345b231ec95dbc780b546 GIT binary patch literal 3130 zcmdUxc~DbX7KbA)EP^bGxFMUOh)r5hX`lmw&=2AW-LAqgSi!lHmcHy|#M zh^&eR6_qV92tot`5d{MxFF+&+A$bWQ2FW&|?Y3v8x~67oYW|q2^X@tC-QT^Z&iCrv z_bwkfd_YZQg9-!!QFA`%=mCK&Wy|CFWlQB_t8dCWwlk9UqZZp!EJxdalOk@nE*SJru6HjKQ^Fwl6i~bEP?cA zGj&d2lHDlL?W5$QhBE?XgaW&OAj7!iB2MWw6!jWiuLfv) z`x1SPUM3J5-5A|Pl3^bU2y1?*eP_r{1SsI6qA3>YiTEiEWzhuoq6Z_cPGYWoE~A1m z$>7LrOR=&qRkpSgWO1^-G1+O?+9t~4BH;=nw9|f3#3ex87!Mnrq=%%gkeR(P<^q4( zyj4V=LV)H6My9^LVw0f~p{Ro_)IR!bDs#KOE;2SBG%ZL<3ObW;{_H66=*LWbUz)aJ zfaWqF>mpuB0c^L2FFP+Bzh!!%1s(TF+kTYzom|5W+;rAS0|{NVxS!4!IYXq?a9nxS zxrWt{of-&*bIZpMLmupVuMAmx$!1B5LfkfpuRdoPWaWzzNbvc8Eow3FpRLi_7bhQ& z?u%Hw!9NFAw!o5x`D31PpmJ8Q@6G_8U`q)ef~9l@NWA>S-oS zAPugEvTU!Ws1ZmyE5TBYEBU7Fuh9*?q7t{uTFs^e(sDH5Hng7M;m+bAi|R@OtZr-b zxPiuU?W^MZyN%!C`7ZS%W)m9dAWe077IPqD-Wu9|7hyRXCV##3^tsQlW7MplE|A62 zt5NqSD@^x>@o;pB7*KD;E%Bw2w$`Qu)x(1|fJ2iZps4W2G2&^iB_m-Wnn{Sab|(h!61GMZy&zNWtse_g9t@ zFaRZ9$}A=WIDgg{(e*Wi^keKI>+<`P?D5{1IUM~VHYJRU3HWEEe+Bkdj_;!Ei~EnLj+V@?Sng1TwzIo1 zF7KnCT>Lbf60K`$s!S#ie4L)ThsRbH>y_42)iovFIFp=;$M#N7hj)GcpNZaAihDkg zC=$}yycBc#Tr5+X(pT{PvnIQ?#=%}|tCup@uu_xG7W4}5JQd%p7P z^cpC*qJ+`g>>_|WQYohl+H#0P$3OKQH`YwBJ~S;<(%HYTeQfZu!Bd+(=-p0xf)h1{?-u^p;W&pbUl=|RyUNW^XjYazF{8a} zXh$o+KP6H^0~wutl_*7Q8gd*HXUIm<)t*dY^7x4Fh0nCZ%S=x8>)-b2S!LIlKZdD` z+kFpNw6Jr{r~37fcFje; z*5mqJdeS>fre*Xidd1Q}q1);E7S#Uk@KR$pp6-P8{%PUITjpD!Ne4omZdh(r`sLKi zhu&uC14a}JOc>p2o)3NAY<2H!SeaMj4!(6>V_&U+^U%lm>SriEhXq8do*>?omD@ZW z4lXNC^W|;Mp*OdwGvWk$X-(Dk%D?9@60gq}>R#6g2MY8Za}3Bn%Jd`P%lAWVJ%sLg zaUv5|4&4@4Vv>KF?%q4xShxkmzv+N*jvl)N13&#hO=bRc@}yDB5r^t{a13%Ww&UBW zI?BO~0NMu6ctfj?h$${68dy1C=s!s#ZcF#& zb8?}#d1g-iga;X}tM-IFcoM=Ltl)k0$@fPLE(+ke&f~17WMHTa%>Bd3Xz%RD-*(w{N5^S&ia`D(LtS(%On1Q3uBBZ*RT@Z@~4#rz#AzldZ{3bDmjL+8v!~ zviFPkXfMF6;jVkaB~^R}4%*Fse8zu0u#Ml$y`mBi%q~jO5wz6_<10h5Z+q;gnv!>+ zbEo^i!SkP^L%$^HUbw6a{x+d5c(N9V)~tpvE;~cW;LI)vJ46(;Jp+b)FfJg(wk0LI z-_e6>iuldYP4(lF@QLq2!9In7UND0B2uH8*8&K;@w0*Kz-Mz_p_k+9EZqbbtf9^_+ z0oh$~6d<=E5j?OI4EaZZ3V-+D36d&l9QDVCcf=Qu1O>?yt0LM^{L~~L`Hw!t+3Bz& J-XZwH-vC}uarOWJ literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_init_adaptor-members.html b/trunk/paradiseo-eo/doc/html/classeo_init_adaptor-members.html new file mode 100644 index 000000000..11210f654 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_init_adaptor-members.html @@ -0,0 +1,30 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoInitAdaptor< EOT > Member List

This is the complete list of members for eoInitAdaptor< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const (defined in eoMonOp< EOT >)eoMonOp< EOT > [inline, virtual]
eoInitAdaptor(eoInit< EOT > &_init) (defined in eoInitAdaptor< EOT >)eoInitAdaptor< EOT > [inline]
eoMonOp()eoMonOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
functor_category()eoUF< EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
init (defined in eoInitAdaptor< EOT >)eoInitAdaptor< EOT > [private]
operator()(EOT &_eot)eoInitAdaptor< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]
~eoUF()eoUF< EOT &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_init_adaptor.html b/trunk/paradiseo-eo/doc/html/classeo_init_adaptor.html new file mode 100644 index 000000000..57064a8bb --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_init_adaptor.html @@ -0,0 +1,54 @@ + + +EO: eoInitAdaptor< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoInitAdaptor< EOT > Class Template Reference

eoInitAdaptor changes the place in the hierarchy from eoInit to eoMonOp. +More... +

+#include <eoInit.h> +

+

Inheritance diagram for eoInitAdaptor< EOT >: +

+ +eoMonOp< EOT > +eoOp< EOT > +eoUF< EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoInitAdaptor (eoInit< EOT > &_init)
+bool operator() (EOT &_eot)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+eoInit< EOT > & init
+

Detailed Description

+

template<class EOT>
+ class eoInitAdaptor< EOT >

+ +eoInitAdaptor changes the place in the hierarchy from eoInit to eoMonOp. +

+This is mainly a type conversion, nothing else

See also:
eoInit, eoMonOp
+ +

+ +

+Definition at line 157 of file eoInit.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_init_adaptor.png b/trunk/paradiseo-eo/doc/html/classeo_init_adaptor.png new file mode 100644 index 0000000000000000000000000000000000000000..fe9ad4845aa998a8569cefac958cacc9cff8054c GIT binary patch literal 1465 zcmah}eLT|%7@rh{=+aThOKR?L;e2!^Z)0o8Hg9=ZvN4J!mTh7pPFGs4g{50D?kb;! zW}M;XUB&rT3~`mWlAo8jS;px$o89Wq{<+WRd7kh0c|PC2p6By@7=c*Sb{!KP2n4d- z?N<--N!74B5Pck}QmNEbrRpp%k1kNN&)M18dEt=?RJR(mU~CA) zd-m072xLou9|C?ny;RJ3MyYnxyAtE}!bRGXIImj@o4XuwN@UB=J}b)=YK8p$_GmWu z=GNF{tH}G6F1)IQETzBw>L$j>lS|=*s1wRxjb&&%XgmcPFQtOtqAAEkKD-C7){a*y&AYa1Z4WTxS>n~UCP+D`_`y&tSe=ph4)%8x`4mdHXqPC z#dvT@0Qx2r-@z=zir@zUWkOnC->TyewqL=#(+%~6oVigG_`&j_DJ}3;SJ5;F?&H$- znBB7V*)}05(?yu8OZ2q4%QABeJPn$9w!rlM;Kt>rULk~JV@Y$?7O zCcNG>Zq?*OC@_!_&HJgQ8|Sg+PNJCN@ko?3rA%8G)yyc1QDd8?<^y|ZQwd$)$E;r* zPD;+@wN8t!#Im1}x2go+v#yN|_aDKQ~U{0eyGhdlS(q1AFqS4}rr5Qoc zj)I?0qHPBdb7w@%o8@g#0|JiFGppZrDbqe^2QMFzVVtKcInnx}pMM-AuwqBO@7e*c`Gf8G?eL`wJ(FEKvBVmWnj(k2(5v*OohvYzke$XF)UO8r z>N-qJKKZT!Jx4DX<8$WV$!Tfwy({CVqceM$!U+$NL$CPX#^~0)OZ4QV=wl{t3dejK z_$3b)evwQug-V3fw?S^%b;Dt?XO#)x(a9BM99ssOGnGNZVOC1 zllMjOxad3F0lQ!t@cy(bG{6qpQLGlQ6=7<1j5M-RH1!ieuCVWpPs?1%@M+SEHu~}y z>hsWL@~fvHT-vh=3)~YB-46}}6QkL~l|D_uK+Hp!8*V<#OvrO{1e+Ca&;Ayf0@e&6 zl)E;{t2y7&?8+3hPb0{h7pY;Q)V*ea=Sqo5tPAU%)|t@RZ`|H44!@k-UATVj`*p%d z!8-brIP%)T45Dgnx&4pI<_{a9e869#@R4J6xv!zs#+sC7_& z?#1yEuqRkT3)xBMnRnUdVxp?APX^TnCf5J{fTvIOD0|pZBC>or@O1nebUn8N(l>dR ze5ApWAATgW5DfKZX8yRPE2S*Yi2!$Cn2|P7{?Xb+vf8hmEsYa64EpaQSK00-pR9dJ z#A5*68?v(kQ|W7Weh=LoTpOAbip0=95`{IE$Pr_bKVrly3TMi?OHwvf?R445XIv)R oSFB~@(fBi}IV4-*?3ub@fV-{Y95d@2Q~z0r9} + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoInitFixedLength< EOT > Member List

This is the complete list of members for eoInitFixedLength< EOT >, including all inherited members.

+ + + + + + + + + +
AtomType typedef (defined in eoInitFixedLength< EOT >)eoInitFixedLength< EOT >
className(void) const eoInit< EOT > [inline, virtual]
combien (defined in eoInitFixedLength< EOT >)eoInitFixedLength< EOT > [private]
eoInitFixedLength(unsigned _combien, eoRndGenerator< AtomType > &_generator) (defined in eoInitFixedLength< EOT >)eoInitFixedLength< EOT > [inline]
functor_category()eoUF< EOT &, void > [inline, static]
generatoreoInitFixedLength< EOT > [private]
operator()(EOT &chrom)eoInitFixedLength< EOT > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< EOT &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_init_fixed_length.html b/trunk/paradiseo-eo/doc/html/classeo_init_fixed_length.html new file mode 100644 index 000000000..82fc90bb1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_init_fixed_length.html @@ -0,0 +1,58 @@ + + +EO: eoInitFixedLength< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoInitFixedLength< EOT > Class Template Reference

Initializer for fixed length representations with a single type. +More... +

+#include <eoInit.h> +

+

Inheritance diagram for eoInitFixedLength< EOT >: +

+ +eoInit< EOT > +eoUF< EOT &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::AtomType AtomType

Public Member Functions

+ eoInitFixedLength (unsigned _combien, eoRndGenerator< AtomType > &_generator)
+virtual void operator() (EOT &chrom)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+unsigned combien
+eoSTLF< AtomType > generator
 generic wrapper for eoFunctor (s), to make them have the function-pointer style copy semantics
+

Detailed Description

+

template<class EOT>
+ class eoInitFixedLength< EOT >

+ +Initializer for fixed length representations with a single type. +

+ +

+Definition at line 81 of file eoInit.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_init_fixed_length.png b/trunk/paradiseo-eo/doc/html/classeo_init_fixed_length.png new file mode 100644 index 0000000000000000000000000000000000000000..631b7275778a8dbf02c504d2d8ab3bde1ed2a743 GIT binary patch literal 1330 zcmai!e>Bs37{@o{$~LM?``o5`u^ZA4Tiw`^lEqkQ{g`m&>btF}v^GDgd$ST^7kxXc zu#TT)3aMnuqQqi0Dpne0eneP)c3XvTwYz)&y#I90>v^8{bI$v(_j%5fx{KzEF<)km zKp-$wKkq#V1QIrAnTfHX56x0Fh5>f@2l(jqdV|#KWmm317YypZlF4NJdi|hbMIPHj zqa(IxUxy*x`FF_lh6IXkOhJa^W;oOgWe~ zzVKXwWR=H>RxAt5vd}LZQ(fIaW?{~}lU4wsGz6R_f`OyxJTo!gI;2>|TD?wlrs=ay zyc#!y=%&tPzZXs>E`imd)*CyVP~8{bPca{$iI$Sz;tz{z)z z6PEj5F+$(K{2CcIS(c$Nc~mD&n;wW|;Ipe9NBuzeH}==K@3#*sX6q*Cy9Srip~Vkas0?PjF2%6|q@Tm|xCcR`hX>La4NM)s zEvsm&y-s1;&}$sVIJBL`y9Q3|F4!M%$ta8gJ>OPGo+3iL-6JvFz0@qoR*B+0QvwHW z(ZDVh@s^_qkA8RFros1^K-Y$g;yB&k$OhID$v88q!wfH{WZV!rkw%&LCjk-bI!2eW z*Jq|;7LN90UwW)^>hK)y-!SR{6cNy>&5zTO zWo>s+W%VVdqz=p3VmlT=p^^^|F4%dS+a6R?Ak^Z!vxS7*cwH24lhJ705sxj7U|Neu zlY(wL-uxb>k#mX8a*+IB!%qwdX7(7o1d4>);tN1w@HAa*Qy4Z;JY_{RUGaY?+vg+Z zn_H>iyl41a3xFR3E234PF!^IB8&y{R!JOk0*n2W=kH80sm%Lm$rjh1_Y>oioy}uLG zHKOHn^jbd)l=cuK$=RE?Y8?9FQz=@VEy@$`HV25-U)WFf<9QsyxL6Y%DnKsc8|PN1 zy4{=P?%hF8lnhn1;$kXFAnd=ndNtux{|4x6ZXuTRugi=hdnY&cSNCgVmzUqnI#lEw z*vUI}LFqI%kNXJNOtb<*E4~=Po5Mb+(}u^SA;%M=C>Mtojv5anMX1-S7gAj8T0w^V zTXShP&=nL}t==Mnu*BIbz8v)ieGm<)CFGS4K;R^X3i$xmoH-hnA`)O0u&g58_P zW~>HE+-#rI614pXP-hGHebm#}c5Xd}`g>IhWQ(MIa*AXXb-k~4?b=#}zxx(?4Z&|a z=T(YwT^1z=5z_!N1Pr*8VOHBWW4Smi2Q@YOIn(gq5L6$UcNrN<{0HHc BVxRy3 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_init_generator-members.html b/trunk/paradiseo-eo/doc/html/classeo_init_generator-members.html new file mode 100644 index 000000000..4102eb7d1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_init_generator-members.html @@ -0,0 +1,21 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoInitGenerator< EOT > Member List

This is the complete list of members for eoInitGenerator< EOT >, including all inherited members.

+ + + + + + + +
eoInitGenerator(eoInit< EOT > &_init)eoInitGenerator< EOT > [inline]
functor_category()eoF< EOT > [inline, static]
init (defined in eoInitGenerator< EOT >)eoInitGenerator< EOT > [private]
operator()()eoInitGenerator< EOT > [inline, virtual]
result_type typedefeoF< EOT >
~eoF()eoF< EOT > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_init_generator.html b/trunk/paradiseo-eo/doc/html/classeo_init_generator.html new file mode 100644 index 000000000..c309969ae --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_init_generator.html @@ -0,0 +1,50 @@ + + +EO: eoInitGenerator< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoInitGenerator< EOT > Class Template Reference

turning an eoInit into a generator probably we should only use genrators - and suppress eoInit ??? MS - July 2001 +More... +

+#include <eoInit.h> +

+

Inheritance diagram for eoInitGenerator< EOT >: +

+ +eoF< EOT > +eoFunctorBase + +List of all members. + + + + + + + + + + + +

Public Member Functions

+ eoInitGenerator (eoInit< EOT > &_init)
 Ctor from a plain eoInit.
+virtual EOT operator() ()
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+eoInit< EOT > & init
+

Detailed Description

+

template<class EOT>
+ class eoInitGenerator< EOT >

+ +turning an eoInit into a generator probably we should only use genrators - and suppress eoInit ??? MS - July 2001 +

+ +

+Definition at line 60 of file eoInit.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_init_generator.png b/trunk/paradiseo-eo/doc/html/classeo_init_generator.png new file mode 100644 index 0000000000000000000000000000000000000000..8c2b31787674131b78e4080dc642a4c1735c48e1 GIT binary patch literal 600 zcmV-e0;m0nP)3A-a&ORHD68E62t^WLFyPoOlkv3Df(Q+I`AD9@#(YmR^R-N}PeuJ61pvhi zbJU+l)hU>x*e)HSFsKRt?K#mSdWwLju=j-G1-#}JitH z6_k&)3en{VDy%M5)hO8@>BFimBUQ^jitFgx^6%FQqw6=QgS9F;h@LY-1f_#qD+D~) z!ONy7MHQ%thu0x{99#BY)W`FVsOR%>L)1Mxs3=7#N>PeZ)L%tSd{w*WyXZegVZK#B z`3|J-!SO}IE~@tUj$wSwFhH?}4GNe28;d?Fe=sw)MPYZ7yC{%*4yjeCs>|x50Fo-` zZ?MN2s9N#{p@%x5s#mL`gC}a$b}&6x=O2bkrYJ=fsELQy#3S|1D7|MmVe?3eQk0?; zr6@%y>ZQRnGj5i0tEfvTn*tVEzO81|uP}s_Bv+q=fu1SP*sO za@aT*MsVV;D3@p@%JPr1254|LYO{{R6gAm3*0m^TQ7)ov%$9u4ORjaPR;4P)D1aIj z!T^j4KhlSY5>mTC$f`_(%3@7qRI0Wp7;JDYPs%S)Ypse7uC-b_D7B|1^4v-XDPX08 mo9C*17^aw_6jh++9bP}Rh7@Zh($u;D0000 + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoInitVariableLength< EOT > Member List

This is the complete list of members for eoInitVariableLength< EOT >, including all inherited members.

+ + + + + + + + + + + +
atomInit() (defined in eoInitVariableLength< EOT >)eoInitVariableLength< EOT > [inline]
AtomType typedef (defined in eoInitVariableLength< EOT >)eoInitVariableLength< EOT >
className(void) const eoInit< EOT > [inline, virtual]
eoInitVariableLength(unsigned _minSize, unsigned _maxSize, eoInit< AtomType > &_init)eoInitVariableLength< EOT > [inline]
extent (defined in eoInitVariableLength< EOT >)eoInitVariableLength< EOT > [private]
functor_category()eoUF< EOT &, void > [inline, static]
init (defined in eoInitVariableLength< EOT >)eoInitVariableLength< EOT > [private]
offset (defined in eoInitVariableLength< EOT >)eoInitVariableLength< EOT > [private]
operator()(EOT &_chrom)eoInitVariableLength< EOT > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< EOT &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_init_variable_length.html b/trunk/paradiseo-eo/doc/html/classeo_init_variable_length.html new file mode 100644 index 000000000..b2d7ed87b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_init_variable_length.html @@ -0,0 +1,64 @@ + + +EO: eoInitVariableLength< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoInitVariableLength< EOT > Class Template Reference

Initializer for variable length representations with a single type. +More... +

+#include <eoInit.h> +

+

Inheritance diagram for eoInitVariableLength< EOT >: +

+ +eoInit< EOT > +eoUF< EOT &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::AtomType AtomType

Public Member Functions

+ eoInitVariableLength (unsigned _minSize, unsigned _maxSize, eoInit< AtomType > &_init)
 Ctor from an eoInit.
+virtual void operator() (EOT &_chrom)
 The pure virtual function that needs to be implemented by the subclass.
+eoInit< AtomType > & atomInit ()

Private Attributes

+unsigned offset
+unsigned extent
+eoInit< AtomType > & init
+

Detailed Description

+

template<class EOT>
+ class eoInitVariableLength< EOT >

+ +Initializer for variable length representations with a single type. +

+ +

+Definition at line 107 of file eoInit.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_init_variable_length.png b/trunk/paradiseo-eo/doc/html/classeo_init_variable_length.png new file mode 100644 index 0000000000000000000000000000000000000000..5a5c4e10e232085a003e347903ccf03dea3e42b9 GIT binary patch literal 1338 zcmah}Yfw@N6ut&gDwbvDHQCyfe3Y$F_V8_nS7}NO%_R~Qsif2ptSM{P6cw$muCCQ; zK1jha12>_vR!zajrPbBKfXvc#)zW;V)23}nEbZ*C{nN~M&i9>}^XHs1-?&)l9O{AGN?CY7rVp85 z0v+*cRAOwucKdl}2b_Z1AQm2A7i(igWnFF+afB?pjqJo#yNewQiR)^f2(@;!Xwti# zw)}+X=Qw!?l5eeiI=S%(o$%?BC9J|W@X*X1k>|Mc)0%8zQOJ$b#R@sp`lGsm zbCBU!;)XoWYOQ4}+=m~<|KxQ&b%niVA-hYpD1a!3@aAr?>NQ^)WC;$q+(i06zo7ZFS=9Tmv{gP*V@#22EL`(v7wGbX5l@Jwq8lG-EMqFj(rj%TLfTq=lD%-%-p z`A{!qVt(N~;RjbPoTsuzI$5IM%5~F)jIa?TqAgpCwtEH1C|zW(dep$s>}7?+yxCnTPBo|HZ064@UzUjf zn#>RrZW_(KPfyu)7>j%;0!uvyt2H$r;ovc0^74DHys|9_-qSVbeEZos9%Ja?fyO0i zOwHL^cf}aK-CF1eb3zPFOOc(DL+{q2nK*4t@^T(=*+k04YfQCR_qfa!xsLxoSk+NA z&ClG7g|koNo2}D{V7e_Ic_XEkiRlW<)sbo9haEP-!5y`Z(UOIe?e*Q^H%5hghVnsb zc~#})PMnE9mr4jQwF_U5i7Nkc1&WNdIkRHF2?z{qOX!R$V8s(&i2Aq@e4{)F)z~0r zfp2w^HA+k5>To@4ub8~p|I1!6@`gG8a?-r5Xc$|tG8r0;LG zy3bjy8zJWEbY{sgGX{%98#aW2z1PmDFOCh@(N6I=Q2wa#8`N;darIWUG34UZ4PI{h z8c3^z1-Fi!{ksP?3{LdU8QN4;rXFdsf+U_Daom@Hoq8nqsF0xu6#I@d+v;~G9?7q~ z7V*GG8p!ytPilW!kdB6K{C=u9X5X~wvX$VIuxyAwi%~taKOnXLCFO+krYoIE%Bz}@ z=}TzjX*>AEJPNRs@z-o>RXAzgJQQ& zMR%J>YBRTObjT_pCQL2jIpsqr*@Pg&sJ6wtb#Tk-sG+=hbyK@Gg_dA%8Npk@cT+62 zh?{jgL(7J8Is08@EH2PWHqgH&o{g0($bQ|( HqIv%SnFfAw literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_init_virus-members.html b/trunk/paradiseo-eo/doc/html/classeo_init_virus-members.html new file mode 100644 index 000000000..d53ca5987 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_init_virus-members.html @@ -0,0 +1,22 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoInitVirus< FitT > Member List

This is the complete list of members for eoInitVirus< FitT >, including all inherited members.

+ + + + + + + + +
className(void) const eoInit< eoVirus< FitT > > [inline, virtual]
combien (defined in eoInitVirus< FitT >)eoInitVirus< FitT > [private]
eoInitVirus(unsigned _combien, eoRndGenerator< bool > &_generator) (defined in eoInitVirus< FitT >)eoInitVirus< FitT > [inline]
functor_category()eoUF< eoVirus< FitT > &, void > [inline, static]
generatoreoInitVirus< FitT > [private]
operator()(eoVirus< FitT > &chrom)eoInitVirus< FitT > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< eoVirus< FitT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_init_virus.html b/trunk/paradiseo-eo/doc/html/classeo_init_virus.html new file mode 100644 index 000000000..354f18d1f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_init_virus.html @@ -0,0 +1,54 @@ + + +EO: eoInitVirus< FitT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoInitVirus< FitT > Class Template Reference

Initializer for binary chromosome with MGE. +More... +

+#include <eoInitVirus.h> +

+

Inheritance diagram for eoInitVirus< FitT >: +

+ +eoInit< eoVirus< FitT > > +eoUF< eoVirus< FitT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + +

Public Member Functions

+ eoInitVirus (unsigned _combien, eoRndGenerator< bool > &_generator)
+virtual void operator() (eoVirus< FitT > &chrom)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+unsigned combien
+eoSTLF< bool > generator
 generic wrapper for eoFunctor (s), to make them have the function-pointer style copy semantics
+

Detailed Description

+

template<class FitT>
+ class eoInitVirus< FitT >

+ +Initializer for binary chromosome with MGE. +

+ +

+Definition at line 41 of file eoInitVirus.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_init_virus.png b/trunk/paradiseo-eo/doc/html/classeo_init_virus.png new file mode 100644 index 0000000000000000000000000000000000000000..291fa6d448e99aa7d53a97d416c8005c47912f63 GIT binary patch literal 1528 zcmZ`(dsLDK6#q;GqrRb)%RXnOrG?L2pl(aE&0pTpDUM^N}yi2g7#ioOaqd_wl=rKkogVd+u>xf+vW85C8yx zc$~W*0IXQ8!D1b4jV&>;?A16UUvHv^TCLVVwOU+Rc_3ed-lw^QA;T}@Ek;X*Lc=qhehNH6UD`m$LxLtItqMk~Vwa<{?vm36TjjBtpvXQXbp9T; zDCIWJl#IRTf2tmd81|`ispeJ)jQ2fVkdiQkr{@j*y<9>%>{8#(g>_Kl!VI%w`og-( z6N2fd?HrSWWi0KuM{A+C`q4KIhP1ScJURW-GApjbenm+9$OU*EoY0njq}7#SM;)Iq zXiig?v7KkP|H0!XT(-zD;IXG_Qlo>3(7<=C^fPSq?nBcPl4|7RX;P)3(tkmAt_eXA zG@BhpxY%bj_n3Fk^m!cm7U~PMQ64$s{0jw`2bn~x1VX1Ze_kDX1zo;NNNjl`mF=Nm6vU^fb-zJu&3hoO9- z;#sb8oE*Dtbe%v#$L4w^A(XJKqjTSQ;1pDUX1Ou?1Rpo@B_;1~X59lwnrRZ1Lnrs4 z-2IWUjr9stU(3S|aFG{@49u8O1%YOLuRO)&LG$d&D`81mvvWjHy+h^(YNQ=ft$K@_ zv-cLPztq+SWrmS+#cY!UIaImLB28ZPYzxIP!=2C^Uk z1JD2&a7n8tMzy5JvmIeA)-32<((=`=`ndi+A;zN@8ZzoQLe^d6^IyQlYoF)8?_^;> zyTD3CQPi#7tNgEgTWFu?w{c`B@uYPmhDw5x zECQYmVln4Omu8#`Vd*JXEGI?T*l2weW@kXb92}V~-M-rEYCpH+(GDKF)MtX|Gc=JP zVbtN0uhA9z3z93b(ac@{9@4Un+XOD?E^aJSc3|rFfGk}O3o^HH(~;#L$kAColTQx* z|GRGOl;$|dSFCv*>MA;D!k$*;BpS(|Tg$_OPSpoxhq;K}1R1U0DV&&${E^~4f37Lr zX5N&9EkN5OHF>!-=cyeX*_~`_n{&)YNkP_GmS^tp&ey8BHOLf+YK#(Y)akZg_mINC zic1yp@mAyZ^=!WJ^D3ysPkZBfp?8 zORhZbVRzimD8@{`S!O`2(bziFUJ96}=tK4T|Aiua^XZZQyGL37`YE+mL=@5obLQ~! PM+fj81b4xn14sV>qH(WC literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_init_virus1bit-members.html b/trunk/paradiseo-eo/doc/html/classeo_init_virus1bit-members.html new file mode 100644 index 000000000..81885a453 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_init_virus1bit-members.html @@ -0,0 +1,22 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoInitVirus1bit< FitT > Member List

This is the complete list of members for eoInitVirus1bit< FitT >, including all inherited members.

+ + + + + + + + +
className(void) const eoInit< eoVirus< FitT > > [inline, virtual]
combien (defined in eoInitVirus1bit< FitT >)eoInitVirus1bit< FitT > [private]
eoInitVirus1bit(unsigned _combien, eoRndGenerator< bool > &_generator) (defined in eoInitVirus1bit< FitT >)eoInitVirus1bit< FitT > [inline]
functor_category()eoUF< eoVirus< FitT > &, void > [inline, static]
generatoreoInitVirus1bit< FitT > [private]
operator()(eoVirus< FitT > &chrom)eoInitVirus1bit< FitT > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< eoVirus< FitT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_init_virus1bit.html b/trunk/paradiseo-eo/doc/html/classeo_init_virus1bit.html new file mode 100644 index 000000000..5003907dd --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_init_virus1bit.html @@ -0,0 +1,54 @@ + + +EO: eoInitVirus1bit< FitT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoInitVirus1bit< FitT > Class Template Reference

Inits the virus with one bit to the left set to one. +More... +

+#include <eoInitVirus.h> +

+

Inheritance diagram for eoInitVirus1bit< FitT >: +

+ +eoInit< eoVirus< FitT > > +eoUF< eoVirus< FitT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + +

Public Member Functions

+ eoInitVirus1bit (unsigned _combien, eoRndGenerator< bool > &_generator)
+virtual void operator() (eoVirus< FitT > &chrom)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+unsigned combien
+eoSTLF< bool > generator
 generic wrapper for eoFunctor (s), to make them have the function-pointer style copy semantics
+

Detailed Description

+

template<class FitT>
+ class eoInitVirus1bit< FitT >

+ +Inits the virus with one bit to the left set to one. +

+ +

+Definition at line 66 of file eoInitVirus.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_init_virus1bit.png b/trunk/paradiseo-eo/doc/html/classeo_init_virus1bit.png new file mode 100644 index 0000000000000000000000000000000000000000..10d7c2aadbc910e0a96406ecfaeaf676acf405fa GIT binary patch literal 1541 zcmeAS@N?(olHy`uVBq!ia0y~yVB!I?53n!;$yu^$w}6yHfKQ0)|NsAi%>Vxn%%7hy z0muU50|yRNANv0U$Ym@E@(X5gcy=R=fq`|lr;B4q#hkZuPfvPeA>jJiljO0HQw@BWoOd#`t~+xV{iWc^hS z-*_)!%UZyeRWZ43O2q2)#6G_F*9DHh`dArbo3d85t4DKI)vhf^zAgB&>uKuwjEr{a zXBj)}zJ&6Yo`1|6oUMB?E_Qp*^>*9kic2CVtozyE$gjv_spQPZ?|iL+x!{bj)UhiU zOO7sD(*C$ZZ`pD0kRXHDJAq#JkMdoUjtjc=sUtZn=CZ(NUGt+KEqN>7WNvUhEMPL} zC`Vee9WVdcZa3$7Cnb8bE-*%!Je%KP#$!G&IWQnjXu4Ufmc-7rZJRXSl>U5MckT>v|;N43Lg6;WDw;$gzLpWOOY)$~bAp5NTDCfG9&6^WX|*o|F9ObolV*h39w=%JGRy#hu_S3_UEf*2H9|WBoIkB5m^{ zT9$jJNw1o##3Pa0#d243f^<{M^YX4KJ4ypxq@_*H1gezH+Bd(C?B-0!;`c~4C*XE%DMIZ0}Y z{(HWZ6^sGQ3)mcZ8>ARa8L}AuN$s;|%ID5M@IR=Id2aeejX!hEIoo zW;@qcatFZFKA6@vVYR>BY2(8wt(v|9PraM3u(!XqIxd|mRefQD(4KXBFM33u+!?fb zi#e~xmYr7?91NOdl5z9VBE=Wl>rAF7&5OCPS)aF9G)%Hv=U~vfh*MkE_)h2Q+jccT z>}b%X))QWV_vK7FBCbdChMkPODR4j<1FSef2@<)F#WI&Z5z-$6SZT+A?zkks2 z-_B>DD;R5>F5Y5y;GH?Y{l~G-rvsV~iEzTg1RA=C@WU;@x2Q4xGsB-t{IFPQ(3M(a z^yuWQGs&3|Ki8XVznUWF;Josr49n7Kr3J;l&;FU7DGk4LCDtxvvgAAc{@Bb7yO(Df zy|2E}$~H0TaIopj{U0`P^IqO!CM~z>q|Kq69T6h_S5w~Eo9kG&K09f(W2f3@yWJN) z{D!0>u)kz8AFzLU|3Kk?%xA4D3=s_+D-;hixj6801*^bZ1xzc%_y!aJ79DMIb3TeK z_)`DlC-3{biuw0HyleZ8%Fpc6ZE*%SN;)skU2?iFy1&|DBb%+&|5N^a%N3-lGc~r4?LF zr`+6-nE1xuIXwG-@9|ivk|#4PQUm|oI-FD%cuiL%U zu{hCKI*ONl7O!}>ll%PqPwr3KDwkidi8Lv>^hTt1Z}1oPJDPp9b%%FL-+OMpXZJ(= f%)Sqdf9nk&3w+gTe~DWM4f73aRc literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_inner_exchange_quad_op-members.html b/trunk/paradiseo-eo/doc/html/classeo_inner_exchange_quad_op-members.html new file mode 100644 index 000000000..8d2b87724 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_inner_exchange_quad_op-members.html @@ -0,0 +1,32 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoInnerExchangeQuadOp< EOT > Member List

This is the complete list of members for eoInnerExchangeQuadOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + +
AtomType typedef (defined in eoInnerExchangeQuadOp< EOT >)eoInnerExchangeQuadOp< EOT >
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const (defined in eoInnerExchangeQuadOp< EOT >)eoInnerExchangeQuadOp< EOT > [inline, virtual]
eoInnerExchangeQuadOp(eoQuadOp< AtomType > &_op, float _rate=0.5)eoInnerExchangeQuadOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
eoQuadOp()eoQuadOp< EOT > [inline]
functor_category()eoBF< EOT &, EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
op (defined in eoInnerExchangeQuadOp< EOT >)eoInnerExchangeQuadOp< EOT > [private]
operator()(EOT &_eo1, EOT &_eo2)eoInnerExchangeQuadOp< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
rate (defined in eoInnerExchangeQuadOp< EOT >)eoInnerExchangeQuadOp< EOT > [private]
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoBF()eoBF< EOT &, EOT &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]

Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_inner_exchange_quad_op.html b/trunk/paradiseo-eo/doc/html/classeo_inner_exchange_quad_op.html new file mode 100644 index 000000000..76ef09664 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_inner_exchange_quad_op.html @@ -0,0 +1,64 @@ + + +EO: eoInnerExchangeQuadOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoInnerExchangeQuadOp< EOT > Class Template Reference

Crossover using an AtomCrossover. +More... +

+#include <eoVariableLengthCrossover.h> +

+

Inheritance diagram for eoInnerExchangeQuadOp< EOT >: +

+ +eoQuadOp< EOT > +eoOp< EOT > +eoBF< EOT &, EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::AtomType AtomType

Public Member Functions

+ eoInnerExchangeQuadOp (eoQuadOp< AtomType > &_op, float _rate=0.5)
 default ctor: requires bounds on number of genes + a rate
+bool operator() (EOT &_eo1, EOT &_eo2)
 performs the Atom crossover
+virtual std::string className () const

Private Attributes

+float rate
+eoQuadOp< AtomType > & op
+

Detailed Description

+

template<class EOT>
+ class eoInnerExchangeQuadOp< EOT >

+ +Crossover using an AtomCrossover. +

+Probably irrelevant in Variable Length - see eoFlOrBinOp.h and eoFlOrQuadOp.h for the similar Fixed Length operators +

+ +

+Definition at line 172 of file eoVariableLengthCrossover.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_inner_exchange_quad_op.png b/trunk/paradiseo-eo/doc/html/classeo_inner_exchange_quad_op.png new file mode 100644 index 0000000000000000000000000000000000000000..8a9335734bd0aef0c0c3cd0fe9190755187d7136 GIT binary patch literal 1766 zcmaJ?dsLEV7^hr%rqiv>Ni)jLQd`SQ^Fu>zri(~T&07}%ujwRHXCJQ8)J~a}927{UV?c5#;gDp=taNb8o1}v-HFlTV9cJB&D>-BmA)$4gzug07=u=j_@<7M&n z&kWaP#L%EH*fwY=5e73p?zi11{3vy{qUXYhhb21XdTlq^el0~~RP(F=c!64%qmOjP z^4&@t`2=iM#){5{*S}h2ZcDluO!vsqmQJt&>Y0}K>n)P{Cd<3B2-EUv)H}HJ}#FVMMg@7wYo(87Gx`BMlfDhGFG@Kah?1kTZUWe-4)X0wXgyVFx|_-%s)Nx zgMxj{NFjJGEKW)3eJpd)t(vus=bbi56OSpoIfsJUJX#0)qn$4W+^A4Ehs{@YYvewc z4*b?ZBew!f>k4%zId*Yi%WvEwmHwm=;2R(J95!{Be&UlnKfi&8I zm}~^>?M4dqH`1NN5jw5Ri$!w}PrHh}BZg_bHus$T2PQLxWfv2h+w}@K7&}&;HzZYRDs{8=> zOQ1Y`=*YR1x|!pi`Ty+E^JAbO)1H zi1?gVM$Va;ig2f_ekxnJ6!<>O)SWrYRsF>|y8ANhc*9FSGw5XH&(6i*`wma%Y zIGg>bB~aDq(CvOC_@IbHI0q#ukZ;b~{A-iPtqXhS-5*8tBK$kyec`^~*U^sp>r)$( zEb?7H`fz0*Rtt6NgO#Gvj8G-ea_iOu`u*3q$nhT}YZ^RAZZWCJ zm@_xt?usip}KtOTj3c?ZvyE* zIioJJosy;oTKYo#;4fa;OdYE3?CZl_@};-*(NCiyT0Lm&XSRTYdnkHEWk>>MJ4oVv zwm9+DRq3|3*7G7NS|X$l#=i7OfS5thTy?3FaC%yXPIDYs^8g3mvBW{wNCvRM==h@Y zpfOv3#SSAVcqyq|mU>O?AEYjnbAq*!co|!i?nJ?sc!>kS + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoIntAboveBound Member List

This is the complete list of members for eoIntAboveBound, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + +
dup() const eoIntAboveBound [inline, virtual]
eoIntAboveBound(long int _max=0)eoIntAboveBound [inline]
foldsInBounds(double &_r) const eoIntAboveBound [inline, virtual]
eoIntBounds::foldsInBounds(long int &i) const eoIntBounds [inline, virtual]
hasNoBoundAtAll(void) const eoIntAboveBound [inline, virtual]
isBounded(void) const eoIntAboveBound [inline, virtual]
isInBounds(double _r) const eoIntAboveBound [inline, virtual]
isMaxBounded(void) const eoIntAboveBound [inline, virtual]
isMinBounded(void) const eoIntAboveBound [inline, virtual]
maximum() const eoIntAboveBound [inline, virtual]
minimum() const eoIntAboveBound [inline, virtual]
printOn(std::ostream &_os) const eoIntAboveBound [inline, virtual]
random(eoRng &_rng=eo::rng) const (defined in eoIntAboveBound)eoIntAboveBound [inline, virtual]
range() const eoIntAboveBound [inline, virtual]
readFrom(std::istream &_is)eoIntAboveBound [inline, virtual]
repMaximum (defined in eoIntAboveBound)eoIntAboveBound [private]
truncate(double &_r) const eoIntAboveBound [inline, virtual]
eoIntBounds::truncate(long int &i) const eoIntBounds [inline, virtual]
uniform(eoRng &_rng=eo::rng) const eoIntAboveBound [inline, virtual]
~eoIntAboveBound() (defined in eoIntAboveBound)eoIntAboveBound [inline, virtual]
~eoIntBounds() (defined in eoIntBounds)eoIntBounds [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]

Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_int_above_bound.html b/trunk/paradiseo-eo/doc/html/classeo_int_above_bound.html new file mode 100644 index 000000000..64caf91e4 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_int_above_bound.html @@ -0,0 +1,180 @@ + + +EO: eoIntAboveBound Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoIntAboveBound Class Reference

An eoIntBound bounded from above only. +More... +

+#include <eoIntBounds.h> +

+

Inheritance diagram for eoIntAboveBound: +

+ +eoIntBounds +eoPersistent +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoIntAboveBound (long int _max=0)
 Simple bounds = minimum.
+virtual long int maximum () const
 get maximum value ::exception if does not exist
+virtual long int minimum () const
 get minimum value ::exception if does not exist
+virtual long int range () const
 get range ::exception if unbounded
+virtual double uniform (eoRng &_rng=eo::rng) const
 random generator of uniform numbers in bounds uses same naming convention than eo::rng ::exception if unbounded
+virtual long int random (eoRng &_rng=eo::rng) const
+virtual bool isBounded (void) const
 Self-Test: true if ***both*** a min and a max.
+virtual bool hasNoBoundAtAll (void) const
 Self-Test: true if no min ***and*** no max hence no further need to test/truncate/fold anything.
+virtual bool isMinBounded (void) const
 Self-Test: bounded from below???
+virtual bool isMaxBounded (void) const
 Self-Test: bounded from above???
+virtual bool isInBounds (double _r) const
 Test on a value: is it in bounds?
+virtual void foldsInBounds (double &_r) const
 Put value back into bounds - by folding back and forth.
+virtual void truncate (double &_r) const
 Put value back into bounds - by truncating to a boundary value.
virtual void readFrom (std::istream &_is)
 Read object.
virtual void printOn (std::ostream &_os) const
 Write object.
+virtual eoIntBounds * dup () const
 for memory managements - ugly

Private Attributes

+long int repMaximum
+

Detailed Description

+An eoIntBound bounded from above only. +

+ +

+Definition at line 441 of file eoIntBounds.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + +
virtual void eoIntAboveBound::readFrom ( std::istream &  _is  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Read object. +

+

Parameters:
+ + +
_is A std::istream. but reading should not be done here, because of bound problems see eoIntVectorBounds
+
+ +

+Implements eoPersistent. +

+Definition at line 512 of file eoIntBounds.h.

+

+ + + + +
+ + + + + + + + + +
virtual void eoIntAboveBound::printOn ( std::ostream &  _os  )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Write object. +

+It's called printOn since it prints the object on a stream.

Parameters:
+ + +
_os A std::ostream.
+
+ +

+Implements eoPrintable. +

+Definition at line 521 of file eoIntBounds.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_int_above_bound.png b/trunk/paradiseo-eo/doc/html/classeo_int_above_bound.png new file mode 100644 index 0000000000000000000000000000000000000000..2c2d05944cf6563d6acb71448b4b521ee707e0c3 GIT binary patch literal 621 zcmV-z0+RiSP)m3J zZV#X@5s#d)1$WO_vYJ84D(+_Wgemx9;PT(&%x+WfAAleCtHJyIb}@K;RuxoGK?N0D z09AKf12#1@b$vaUfY^(SU65*EQW>!v4#ERjM*ztW5g}tR7yeR!OC|1OJ?`6jegpzX zl^<93z7iorFc8TtaNMe|J>!U5a$_1w(8@DCI}}tx6EMr|Dk8ARH&rvQA z&>zwr@c~dS70TVh5KQVKJ}M$fpQjPGDR^+JTXo`{Gv=(4#NhV`oK6}~vwFr9d@)dU z$C|0`P*6by6;yC&uxQ4uZN|PCXye1iZgGShHs;2lb3JIfePs~BQlLIimp~h5tTbU2 zIgDe6OQ7Y(Sp)RopNliGDP3~d2he5EG$24XlR*A}GFX<;t^t~eEy(9}Ic)K}xacWp zdr$_FmJ-pX<{_&z$)IGFUn$6Y1Wu=9&i(f%r{M2_tACF_c@|p3_=kWB00000NkvXX Hu0mjf2pbEJ literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_int_below_bound-members.html b/trunk/paradiseo-eo/doc/html/classeo_int_below_bound-members.html new file mode 100644 index 000000000..7f4b508bb --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_int_below_bound-members.html @@ -0,0 +1,37 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoIntBelowBound Member List

This is the complete list of members for eoIntBelowBound, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + +
dup() const eoIntBelowBound [inline, virtual]
eoIntBelowBound(long int _min=0)eoIntBelowBound [inline]
foldsInBounds(double &_r) const eoIntBelowBound [inline, virtual]
eoIntBounds::foldsInBounds(long int &i) const eoIntBounds [inline, virtual]
hasNoBoundAtAll(void) const eoIntBelowBound [inline, virtual]
isBounded(void) const eoIntBelowBound [inline, virtual]
isInBounds(double _r) const eoIntBelowBound [inline, virtual]
isMaxBounded(void) const eoIntBelowBound [inline, virtual]
isMinBounded(void) const eoIntBelowBound [inline, virtual]
maximum() const eoIntBelowBound [inline, virtual]
minimum() const eoIntBelowBound [inline, virtual]
printOn(std::ostream &_os) const eoIntBelowBound [inline, virtual]
random(eoRng &_rng=eo::rng) const (defined in eoIntBelowBound)eoIntBelowBound [inline, virtual]
range() const eoIntBelowBound [inline, virtual]
readFrom(std::istream &_is)eoIntBelowBound [inline, virtual]
repMinimum (defined in eoIntBelowBound)eoIntBelowBound [private]
truncate(double &_r) const eoIntBelowBound [inline, virtual]
eoIntBounds::truncate(long int &i) const eoIntBounds [inline, virtual]
uniform(eoRng &_rng=eo::rng) const eoIntBelowBound [inline, virtual]
~eoIntBelowBound() (defined in eoIntBelowBound)eoIntBelowBound [inline, virtual]
~eoIntBounds() (defined in eoIntBounds)eoIntBounds [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]

Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_int_below_bound.html b/trunk/paradiseo-eo/doc/html/classeo_int_below_bound.html new file mode 100644 index 000000000..1d8949936 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_int_below_bound.html @@ -0,0 +1,180 @@ + + +EO: eoIntBelowBound Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoIntBelowBound Class Reference

an eoIntBound bounded from below only +More... +

+#include <eoIntBounds.h> +

+

Inheritance diagram for eoIntBelowBound: +

+ +eoIntBounds +eoPersistent +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoIntBelowBound (long int _min=0)
 Simple bounds = minimum.
+virtual long int minimum () const
 get minimum value ::exception if does not exist
+virtual long int maximum () const
 get maximum value ::exception if does not exist
+virtual long int range () const
 get range ::exception if unbounded
+virtual double uniform (eoRng &_rng=eo::rng) const
 random generator of uniform numbers in bounds uses same naming convention than eo::rng ::exception if unbounded
+virtual long int random (eoRng &_rng=eo::rng) const
+virtual bool isBounded (void) const
 Self-Test: true if ***both*** a min and a max.
+virtual bool hasNoBoundAtAll (void) const
 Self-Test: true if no min ***and*** no max hence no further need to test/truncate/fold anything.
+virtual bool isMinBounded (void) const
 Self-Test: bounded from below???
+virtual bool isMaxBounded (void) const
 Self-Test: bounded from above???
+virtual bool isInBounds (double _r) const
 Test on a value: is it in bounds?
+virtual void foldsInBounds (double &_r) const
 Put value back into bounds - by folding back and forth.
+virtual void truncate (double &_r) const
 Put value back into bounds - by truncating to a boundary value.
virtual void readFrom (std::istream &_is)
 Read object.
virtual void printOn (std::ostream &_os) const
 Write object.
+virtual eoIntBounds * dup () const
 for memory managements - ugly

Private Attributes

+long int repMinimum
+

Detailed Description

+an eoIntBound bounded from below only +

+ +

+Definition at line 344 of file eoIntBounds.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + +
virtual void eoIntBelowBound::readFrom ( std::istream &  _is  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Read object. +

+

Parameters:
+ + +
_is A std::istream. but reading should not be done here, because of bound problems see eoIntVectorBounds
+
+ +

+Implements eoPersistent. +

+Definition at line 414 of file eoIntBounds.h.

+

+ + + + +
+ + + + + + + + + +
virtual void eoIntBelowBound::printOn ( std::ostream &  _os  )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Write object. +

+It's called printOn since it prints the object on a stream.

Parameters:
+ + +
_os A std::ostream.
+
+ +

+Implements eoPrintable. +

+Definition at line 423 of file eoIntBounds.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_int_below_bound.png b/trunk/paradiseo-eo/doc/html/classeo_int_below_bound.png new file mode 100644 index 0000000000000000000000000000000000000000..3127fea42b537b98fb797be376ff6707e3092170 GIT binary patch literal 613 zcmV-r0-F7aP)5jmiD>LJIt&jWiL=ZAvCE#e+WfUKvu90TaA z7allY*E^8klH1F#*0XS2Pu#2L2{Z0fxY6Iij@^2L&*#4G@8$0I+grJJ*V8!Tj5E%- z-k|A+7jsEIB!?T+PMZs>Gx08`fAHPa8q z8E2evSLRGVyqNRSEbptY|4C?bxSHAF@_9E(1(bW_Ui<*@^bAzJ`&cFyzm#0OK8Xi^wo-je- zVq|i(MQ&X7B9gcmNE6_J6F7buvZn(D&m4fBDYdDbT5rWkM{#aSlgN79{J@Eq9yR?% zezl$yc91=4;&=*hA)~wg{6@bo#{DNZ_&fLqk+fFSpT-Ju00000NkvXXu0mjfJ5waG literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_int_bounds-members.html b/trunk/paradiseo-eo/doc/html/classeo_int_bounds-members.html new file mode 100644 index 000000000..bbbeefb62 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_int_bounds-members.html @@ -0,0 +1,34 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoIntBounds Member List

This is the complete list of members for eoIntBounds, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
dup() const =0eoIntBounds [pure virtual]
foldsInBounds(double &) const =0eoIntBounds [pure virtual]
foldsInBounds(long int &i) const eoIntBounds [inline, virtual]
hasNoBoundAtAll(void) const =0eoIntBounds [pure virtual]
isBounded(void) const =0eoIntBounds [pure virtual]
isInBounds(double) const =0eoIntBounds [pure virtual]
isMaxBounded(void) const =0eoIntBounds [pure virtual]
isMinBounded(void) const =0eoIntBounds [pure virtual]
maximum() const =0eoIntBounds [pure virtual]
minimum() const =0eoIntBounds [pure virtual]
printOn(std::ostream &_os) const =0eoPrintable [pure virtual]
random(eoRng &_rng=eo::rng) const =0 (defined in eoIntBounds)eoIntBounds [pure virtual]
range() const =0eoIntBounds [pure virtual]
readFrom(std::istream &_is)=0eoPersistent [pure virtual]
truncate(double &) const =0eoIntBounds [pure virtual]
truncate(long int &i) const eoIntBounds [inline, virtual]
uniform(eoRng &_rng=eo::rng) const =0eoIntBounds [pure virtual]
~eoIntBounds() (defined in eoIntBounds)eoIntBounds [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]

Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_int_bounds.html b/trunk/paradiseo-eo/doc/html/classeo_int_bounds.html new file mode 100644 index 000000000..c225057d5 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_int_bounds.html @@ -0,0 +1,113 @@ + + +EO: eoIntBounds Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoIntBounds Class Reference
+ +[EvolutionStrategies] +

Defines bound classes for real numbers. +More... +

+#include <es/eoIntBounds.h> +

+

Inheritance diagram for eoIntBounds: +

+ +eoPersistent +eoPrintable +eoGeneralIntBounds +eoIntAboveBound +eoIntBelowBound +eoIntInterval +eoIntNoBounds + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+virtual bool isBounded (void) const =0
 Self-Test: true if ***both*** a min and a max.
+virtual bool hasNoBoundAtAll (void) const =0
 Self-Test: true if no min ***and*** no max hence no further need to test/truncate/fold anything.
+virtual bool isMinBounded (void) const =0
 Self-Test: bounded from below???
+virtual bool isMaxBounded (void) const =0
 Self-Test: bounded from above???
+virtual bool isInBounds (double) const =0
 Test on a value: is it in bounds?
+virtual void foldsInBounds (double &) const =0
 Put value back into bounds - by folding back and forth.
+virtual void foldsInBounds (long int &i) const
 foldsInBounds for ints: call the method for double and convert back
+virtual void truncate (double &) const =0
 Put value back into bounds - by truncating to a boundary value.
+virtual void truncate (long int &i) const
 truncate for ints: call the method for double and convert back
+virtual long int minimum () const =0
 get minimum value ::exception if does not exist
+virtual long int maximum () const =0
 get maximum value ::exception if does not exist
+virtual long int range () const =0
 get range ::exception if unbounded
+virtual double uniform (eoRng &_rng=eo::rng) const =0
 random generator of uniform numbers in bounds uses same naming convention than eo::rng ::exception if unbounded
+virtual long int random (eoRng &_rng=eo::rng) const =0
+virtual eoIntBounds * dup () const =0
 for memory managements - ugly
+

Detailed Description

+Defines bound classes for real numbers. +

+Scalar type: ------------ Basic class is eoIntBounds, a pure virtual.

+The following pure virtual methods are to be used in mutations:

    +
  • void foldsInBounds(long int &) that folds any value that falls out of the bounds back into the bounds, by bouncing on the limit (if any)
  • bool isInBounds(long int) that simply says whether or not the argument is in the bounds
  • void truncate(long int &) that set the argument to the bound value it it exceeds it
+

+So mutation can choose

    +
  • iterate trying until they fall in bounds,
  • only try once and "restd::pair" by using the foldsInBounds method
  • only try once and restd::pair using the truncate method (will create a huge bias toward the bound if the soluiton is not far from the bounds)
+

+There is also a uniform() method that generates a uniform value (if possible, i.e. if bounded) in the interval.

+Derived class are eoIntInterval that holds a minimum and maximum value, eoIntNoBounds the "unbounded bounds" (-infinity, +infinity) eoIntBelowBound the half-bounded interval [min, +infinity) eoIntAboveBound the half-bounded interval (-infinity, max]

+THis file also contains the declaration of *the* global object that is the unbounded bound +

+ +

+Definition at line 75 of file eoIntBounds.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_int_bounds.png b/trunk/paradiseo-eo/doc/html/classeo_int_bounds.png new file mode 100644 index 0000000000000000000000000000000000000000..4fd29da4baf2da6379387d87dba988383e270790 GIT binary patch literal 1589 zcmb7Edo7E|W%Ih`P z!(cFFR~M8Q47M^)j+<7mlJEWw=T+p#X3ql{N103}hca0c2nO7gqtC0UsVRvrdoRDP zi1YIBhW$7>5CVfKymCd^VG@WRNrz&XMjIUQpy-@X<=sbZ%1jxy;i+u9l7+U8zJ5*e z&X5G*{SNBM=+XU(syW{8nL!(*xQzH5TP=SnLYf#aYPJK9PHlwa0`t+vTR>gSND}1? z0iaAT_TRq+fDb-R>&JOmg56dWH7XroO#q?Uy;yfP@)XgJFk)9x)S z;k|jDs=Bzv{!1VH^i<%G{ht{< zhF>Z3EfP&{EN-PY3fulx=_;@n?mM8l(&tPM77PMut#_t)1{u(^M;ZDc_k^G6OLY}B z-%7h7gyvL5Fgy0R?n`xeJ2{O|<#4iEAC9AHNxoy>5#ZIaufxm?#Mb#-4OGbK_Ry^y zS2NtteFAjjqVc_w>pwv~tabHlmiZW&Z7ApOz3pobt}7PVn6#n5;(s?J^#XKJ?oCv^ zwlRNQDqG=1KH8L+_4r#N|9aieu6{j|g@1Xvj4fg| znC04ch?W(Xl2hbjzclmblrA+aI*-3a2FM52Z}(a_&VKwCJGn?DmY(rfB~~mdZR5Li zkpWfCI%HbuiJ}{-VYxekQZz$4Hs`0^HFtXWKd42rxrr1#bs=7w^*!=;r50IDaNDnD z_R7fM8=lPvH1zsSz1!AWb`lO%#TU?45vy@CC@T6?wPM#^9~C1PJjYF0qLdRE1CK{U zPtxBMM-MDo2Sre@2*QohdMd>eF)QilH8;GnBsX+>;Eq z!>zdPY(gwJEEvT{`CyYpeBxQVGs2nMmnxAFKd=iU6M-$2Wp+HB?M=FO=KF^i9Fpu+ zx`V7nGLQP?cFgj$3;JH{JtVT25HSo#goBlwJQS(o)AUK3vsH7)!ydC)P6yqr1U0Lt z+KOFhtQPEke6Ma}Mg6r{(1(<^+g92D^)|$+)wW*)wkI99N+}~^QY|#rFm0;4)?jvP zt;wxVqX~|Mz3#Q$b=K+u^I8x%{IJybsBMlrcyPy%0E#&$;m&OWea1HV*B)W8o+k*& z5Rtmbm*zoU*UQBVTyCw907YO*j3jl)vE^N019FVvJ{j_C4{#ipVXeU_sb(F)H12Th z7`=tA=9L__d7+BV6k>YuOkB+z6){^5ChGE{)gkYkE>5&_P1pbj4BVJB!^HAvmX9N| z1t{L_a+pb1x?qw7akw`4r`a>pPJW#nGb2d5V6d1pTmlv0qzYL7=aF@dP5VH1r}qDx kEarp++WAN^#CT~%wx6bzTWSDC{>Q^y9X(Lx_5qjw0L + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoIntInterval Member List

This is the complete list of members for eoIntInterval, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + +
dup() const eoIntInterval [inline, virtual]
eoIntInterval(long int _min=0, long int _max=1)eoIntInterval [inline]
foldsInBounds(double &_r) const eoIntInterval [inline, virtual]
eoIntBounds::foldsInBounds(long int &i) const eoIntBounds [inline, virtual]
hasNoBoundAtAll(void) const eoIntInterval [inline, virtual]
isBounded(void) const eoIntInterval [inline, virtual]
isInBounds(double _r) const eoIntInterval [inline, virtual]
isMaxBounded(void) const eoIntInterval [inline, virtual]
isMinBounded(void) const eoIntInterval [inline, virtual]
maximum() const eoIntInterval [inline, virtual]
minimum() const eoIntInterval [inline, virtual]
printOn(std::ostream &_os) const eoIntInterval [inline, virtual]
random(eoRng &_rng=eo::rng) const (defined in eoIntInterval)eoIntInterval [inline, virtual]
range() const eoIntInterval [inline, virtual]
readFrom(std::istream &_is)eoIntInterval [inline, virtual]
repMaximum (defined in eoIntInterval)eoIntInterval [private]
repMinimum (defined in eoIntInterval)eoIntInterval [private]
repRange (defined in eoIntInterval)eoIntInterval [private]
truncate(double &_r) const eoIntInterval [inline, virtual]
eoIntBounds::truncate(long int &i) const eoIntBounds [inline, virtual]
uniform(eoRng &_rng=eo::rng) const eoIntInterval [inline, virtual]
~eoIntBounds() (defined in eoIntBounds)eoIntBounds [inline, virtual]
~eoIntInterval() (defined in eoIntInterval)eoIntInterval [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]

Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_int_interval.html b/trunk/paradiseo-eo/doc/html/classeo_int_interval.html new file mode 100644 index 000000000..a53163c56 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_int_interval.html @@ -0,0 +1,186 @@ + + +EO: eoIntInterval Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoIntInterval Class Reference

fully bounded eoIntBound == interval +More... +

+#include <eoIntBounds.h> +

+

Inheritance diagram for eoIntInterval: +

+ +eoIntBounds +eoPersistent +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoIntInterval (long int _min=0, long int _max=1)
 Simple bounds = minimum and maximum (allowed).
+virtual long int minimum () const
 get minimum value ::exception if does not exist
+virtual long int maximum () const
 get maximum value ::exception if does not exist
+virtual long int range () const
 get range ::exception if unbounded
+virtual bool isBounded (void) const
 Self-Test: true if ***both*** a min and a max.
+virtual bool hasNoBoundAtAll (void) const
 Self-Test: true if no min ***and*** no max hence no further need to test/truncate/fold anything.
+virtual bool isMinBounded (void) const
 Self-Test: bounded from below???
+virtual bool isMaxBounded (void) const
 Self-Test: bounded from above???
+virtual double uniform (eoRng &_rng=eo::rng) const
 random generator of uniform numbers in bounds uses same naming convention than eo::rng ::exception if unbounded
+virtual long int random (eoRng &_rng=eo::rng) const
+virtual bool isInBounds (double _r) const
 Test on a value: is it in bounds?
+virtual void foldsInBounds (double &_r) const
 Put value back into bounds - by folding back and forth.
+virtual void truncate (double &_r) const
 Put value back into bounds - by truncating to a boundary value.
virtual void readFrom (std::istream &_is)
 Read object.
virtual void printOn (std::ostream &_os) const
 Write object.
+virtual eoIntBounds * dup () const
 for memory managements - ugly

Private Attributes

+long int repMinimum
+long int repMaximum
+long int repRange
+

Detailed Description

+fully bounded eoIntBound == interval +

+ +

+Definition at line 223 of file eoIntBounds.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + +
virtual void eoIntInterval::readFrom ( std::istream &  _is  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Read object. +

+

Parameters:
+ + +
_is A std::istream. but reading should not be done here, because of bound problems see eoIntVectorBounds
+
+ +

+Implements eoPersistent. +

+Definition at line 315 of file eoIntBounds.h.

+

+ + + + +
+ + + + + + + + + +
virtual void eoIntInterval::printOn ( std::ostream &  _os  )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Write object. +

+It's called printOn since it prints the object on a stream.

Parameters:
+ + +
_os A std::ostream.
+
+ +

+Implements eoPrintable. +

+Definition at line 324 of file eoIntBounds.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_int_interval.png b/trunk/paradiseo-eo/doc/html/classeo_int_interval.png new file mode 100644 index 0000000000000000000000000000000000000000..4304b80f822cedf40798f0bca73469848f8ac11f GIT binary patch literal 564 zcmV-40?Yl0P)I>0000OP)t-s|Ns90 z00960z@MLBkN^MxkN^Mxkifved&2+Z00001bW%=J06^y0W&i*I%1J~)RCt{2m|bqe zAPmRhWzX0*fD=sHh4z&DA7R)g-~gFuwn=Ga(o!(L`XeaOU%1c3_U=B?T6;<|0?-fY zF3!mU{6qp~he9G^jF@NHhGdJN$UG&6Nyxu>gk+;JEsP}Pi2`w89LbD`PetxFfP>F8 zkg@rk=6NK?JX`IRq}p+;{oy?_@|0YEif8R>YW)@Yw*5W1ZL8te$^WR`NF$AWQPT7h zwIY|wggR7{1F7Vaw2@SDiH4*YvQ}uKi8Kq7N-jk~QvDP$(viTf_!7m0O3Db?yUCz6Wfst&h=6|B|;@uqB`NJst7xuxQnvX z>!lMiokT~Kb)RReoum=SjEbg&54AtMM@F8Lrk5^~w|plXX{3?&Bw?`y7Z&3@Bk83J zV%N=IAoI=gKoI0%@IH88oA=qsD~0szDR>9e1LtW`f>3GT{Urv(%BMBTdP+r=n zoA`8vT#L@IB3tcL4ntBqlOBA3KiBuj$a8Y}DgFi^3&q>isB-cE0000 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_int_no_bounds-members.html b/trunk/paradiseo-eo/doc/html/classeo_int_no_bounds-members.html new file mode 100644 index 000000000..8f1adb20a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_int_no_bounds-members.html @@ -0,0 +1,35 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoIntNoBounds Member List

This is the complete list of members for eoIntNoBounds, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + +
dup() const eoIntNoBounds [inline, virtual]
foldsInBounds(double &) const eoIntNoBounds [inline, virtual]
eoIntBounds::foldsInBounds(long int &i) const eoIntBounds [inline, virtual]
hasNoBoundAtAll(void) const eoIntNoBounds [inline, virtual]
isBounded(void) const eoIntNoBounds [inline, virtual]
isInBounds(double) const eoIntNoBounds [inline, virtual]
isMaxBounded(void) const eoIntNoBounds [inline, virtual]
isMinBounded(void) const eoIntNoBounds [inline, virtual]
maximum() const eoIntNoBounds [inline, virtual]
minimum() const eoIntNoBounds [inline, virtual]
printOn(std::ostream &_os) const eoIntNoBounds [inline, virtual]
random(eoRng &_rng=eo::rng) const (defined in eoIntNoBounds)eoIntNoBounds [inline, virtual]
range() const eoIntNoBounds [inline, virtual]
readFrom(std::istream &_is)eoIntNoBounds [inline, virtual]
truncate(double &) const eoIntNoBounds [inline, virtual]
eoIntBounds::truncate(long int &i) const eoIntBounds [inline, virtual]
uniform(eoRng &_rng=eo::rng) const eoIntNoBounds [inline, virtual]
~eoIntBounds() (defined in eoIntBounds)eoIntBounds [inline, virtual]
~eoIntNoBounds() (defined in eoIntNoBounds)eoIntNoBounds [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]

Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_int_no_bounds.html b/trunk/paradiseo-eo/doc/html/classeo_int_no_bounds.html new file mode 100644 index 000000000..8ebd2b3fd --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_int_no_bounds.html @@ -0,0 +1,172 @@ + + +EO: eoIntNoBounds Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoIntNoBounds Class Reference

A default class for unbounded variables. +More... +

+#include <eoIntBounds.h> +

+

Inheritance diagram for eoIntNoBounds: +

+ +eoIntBounds +eoPersistent +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+virtual bool isBounded (void) const
 Self-Test: true if ***both*** a min and a max.
+virtual bool hasNoBoundAtAll (void) const
 Self-Test: true if no min ***and*** no max hence no further need to test/truncate/fold anything.
+virtual bool isMinBounded (void) const
 Self-Test: bounded from below???
+virtual bool isMaxBounded (void) const
 Self-Test: bounded from above???
+virtual void foldsInBounds (double &) const
 Put value back into bounds - by folding back and forth.
+virtual void truncate (double &) const
 Put value back into bounds - by truncating to a boundary value.
+virtual bool isInBounds (double) const
 Test on a value: is it in bounds?
+virtual long int minimum () const
 get minimum value ::exception if does not exist
+virtual long int maximum () const
 get maximum value ::exception if does not exist
+virtual long int range () const
 get range ::exception if unbounded
+virtual double uniform (eoRng &_rng=eo::rng) const
 random generator of uniform numbers in bounds uses same naming convention than eo::rng ::exception if unbounded
+virtual long int random (eoRng &_rng=eo::rng) const
virtual void readFrom (std::istream &_is)
 Read object.
virtual void printOn (std::ostream &_os) const
 Write object.
+virtual eoIntBounds * dup () const
 for memory managements - ugly
+

Detailed Description

+A default class for unbounded variables. +

+ +

+Definition at line 153 of file eoIntBounds.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + +
virtual void eoIntNoBounds::readFrom ( std::istream &  _is  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Read object. +

+

Parameters:
+ + +
_is A std::istream. but reading should not be done here, because of bound problems see eoIntVectorBounds
+
+ +

+Implements eoPersistent. +

+Definition at line 195 of file eoIntBounds.h.

+

+ + + + +
+ + + + + + + + + +
virtual void eoIntNoBounds::printOn ( std::ostream &  _os  )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Write object. +

+It's called printOn since it prints the object on a stream.

Parameters:
+ + +
_os A std::ostream.
+
+ +

+Implements eoPrintable. +

+Definition at line 204 of file eoIntBounds.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_int_no_bounds.png b/trunk/paradiseo-eo/doc/html/classeo_int_no_bounds.png new file mode 100644 index 0000000000000000000000000000000000000000..4b1eaf8d4e26b96ba32c7aa951d536f02b1721e1 GIT binary patch literal 598 zcmeAS@N?(olHy`uVBq!ia0vp^i9mdSg&9ab%MiE?q$C1-LR|m<{|{vT|9@cq{DcWW z78oBmaG?6o|0h5$V@Z%-FoVOh8)-oH8&4O^J4BYeov(Ob1mNlf0s-0ha&#-kQ%l6`w# zXY5_Y@}2AWUaM@kGpg(U|L%EXSo6u~(PPW`6?XEMJNLhsD(EJWcx1n_&-;6-U3YZN zZ5Hf%Dd?%aC)w#_?7U4)%5Sf^ykDfNz3@ril%*@{x+7!+CTu?^AGl|Q>hrFQqVN@y zrsiBy4Vt?9G{0((*rC5xSz)XC3aIE+N6sGk+&Aj33l7*KjG?~wiQ_$<}@EGyV7~QYWv)Ci-e|b zES?kC(3w*kgzQ|{x-5nvL zADeWJbM9+gnD&&>#4*s!@RV!%Q$NAHDWY$;DmjSmd@X9}Tqpm8@ng~CqVFYP+wbob gT(7S8|Mwq;sdpurw)BVR0}}y*r>mdKI;Vst0Plbh!T + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoInvalidateBinOp< EOT > Member List

This is the complete list of members for eoInvalidateBinOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const (defined in eoBinOp< EOT >)eoBinOp< EOT > [inline, virtual]
eoBinOp()eoBinOp< EOT > [inline]
eoInvalidateBinOp(eoBinOp< EOT > &_op) (defined in eoInvalidateBinOp< EOT >)eoInvalidateBinOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
functor_category()eoBF< EOT &, const EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
op (defined in eoInvalidateBinOp< EOT >)eoInvalidateBinOp< EOT > [private]
operator()(EOT &_eo, const EOT &_eo2)eoInvalidateBinOp< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoBF()eoBF< EOT &, const EOT &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]

Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_invalidate_bin_op.html b/trunk/paradiseo-eo/doc/html/classeo_invalidate_bin_op.html new file mode 100644 index 000000000..c8e1342ab --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_invalidate_bin_op.html @@ -0,0 +1,55 @@ + + +EO: eoInvalidateBinOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoInvalidateBinOp< EOT > Class Template Reference

One of the invalidator operators. +More... +

+#include <eoInvalidateOps.h> +

+

Inheritance diagram for eoInvalidateBinOp< EOT >: +

+ +eoBinOp< EOT > +eoOp< EOT > +eoBF< EOT &, const EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoInvalidateBinOp (eoBinOp< EOT > &_op)
+bool operator() (EOT &_eo, const EOT &_eo2)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+eoBinOp< EOT > & op
+

Detailed Description

+

template<class EOT>
+ class eoInvalidateBinOp< EOT >

+ +One of the invalidator operators. +

+Use this one as a 'hat' on an operator that is defined to work on a generic datatype. This functor will then check the return type of the operator and invalidate the fitness of the individual.

+This functor is used in algorithms that work with straight eoMonOp, eoBinOp or eoQuadOp operators, for instance eoSGA. Note that eoGenOp derived operators generally do invalidate the fitness of the objects they have changed.

+Return value means "Has_Changed" and not "Needs_To_Be_Invalidated" as successive invalidation are not really a problem +

+ +

+Definition at line 80 of file eoInvalidateOps.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_invalidate_bin_op.png b/trunk/paradiseo-eo/doc/html/classeo_invalidate_bin_op.png new file mode 100644 index 0000000000000000000000000000000000000000..321b97e5739021cb2c2dcb553a9672df4a2a43ea GIT binary patch literal 1955 zcmb7_dsLH07QjQ}@-XPiY0IO4ASMA%2pCwf$TI>0A<%$WWO*qBP>4Jd2n3Z-6t)&c z_>#ygDZ(nY3vrQGpaDcE4IdIBRte!<8{oJ}c*v5-Gn=~Ydd_a!bM}v!xpU{9nYs7= z?#y*Uu;0GDAMJ%eAo~LReL^9S_Xag`?;fb8mj!&Tr5TI~_%L6!TCEY)>fV}~v!xp8 zZR_prz0{|cYNlG5p~0shUJK)i5QvUTfDbk-hpk`>fd=OTCxh+{r4-*BD>dq1bscDs zw7iz->{xj@J0GV1qhfjLBW-BWSnYkZH8s|*@J;xBI^OLj;C)0;PS3@B3}$0)Ft=$o zCJ+Sl4iWMKk&SBu`<+wKhax_KPL)I;WVvnhs=XBhS6Wd|;*%~c_#JUax6+E7Z>@LP zvm;BS^BUueJi);-c6jTDWo`!*_KFfACr&?UbfMfewj;6+{)x%d5maaOZrc#4(z!y& zVUfn<7y$zHS5UfeH{Oh+bx+Wd754pRCSlMUby7!kT{_D7*5gT|&uA{1_I!126W~gE z_5rL2#Z;YRWPiVMhg|}&O!(1wb!$1v;u?42{PV<`t*fyCCG#iv{fd^%18iK$d|%Dz ztOdfmIrQr^Yl)cHvK|h!l^YKufi{X0D&sc(NU$UA2Ea%vtm+z+T5j}|lF;EyHyYl7 zhLGHbB@7L`E?m7sTnjZU;*`rBGg#p9!D__p3wH(>-(isgen%GKmudprpDYc+=1w+? z;&yzRMbewn3=XIwb$-6?dj@&mNn)MFyB$@BT!c5+SS{70kRA9>Yi<0}E(8T98vTIO zYXCucUHHg+>wwTMD(KUTkwogbuvdgYMQ9;6+mo-WXSxX1B2ndCYu6s%hH-`&JEvIm zXqFTIjpePG)r6Ufu7Vl&xW(=JK;w_5o!L1%W9M-mRfCTf@jwF>g#41#dANAj%&Sk8 z2fw2$p3rJEN!D4>vN7ou5nKxp;+hGA%MjeIo7m#q)y*=h80H1)zUkA+2eb$d5S+Hx zyM37Y8YOB-TuD(FFf_%%zaN_ zz-K*0E8z;8#NB$S$ouD$OD$=me4#R1h8KJR-66S&5R<9Ct5TUPOH$nKj8BMHFkxp9 zTicxnqeAkf3Cryx1JmyNX*K3xw`>h~6jR+zlF_3YxtHQxmjg#wwe`{w>S+x28)_=% zsojk&%Uf{4L3; zt>;%oXvv%E^4 zWJLYaO=Q>CwN7b)u|}X{VhV!fF@E9LXd#XK6*#0?W4QDEH+;)~L_fMBP;Dx%ph>uq z74lL0nSD5IOJ8!xFW@ls=Pn_{yR%Drvs-2PRx5!e8m97F(^B)|8!$NS^n`|onk@Yu zEm0_5+T>9UF2)&jgIV3TkIY+)ewD4ClzG95Ka#AszgE1A_uu;Sx8Wz=@#hB@p>4nM zb?nSS9m6Tj0JBMbTUQRZic28Rxq}xPcw_e{lLLlMGP`)DoEG@Hj$2BO&L`O)6T{9U zHl_hA2m{-ZJS>?cZcUz7K1je(f$u*}yDqhBB}KA|Rko*^8B?kV(1T%-m3LRFf@i}( zD)nKbrb-K(T++`|4U(HV)}of;(CYU2SozKFRBo8YSH)*sPFHp9gIohER zzHCA+r3@9l_9Uheg-j0eboF;qnUEV>RUJ{Sl-Q>BrM4J0cdmLK!_AmiQjVkRV>71R zN!$H2RcrmQ{o!0hrzG4T489*YmdVXmdaiX)6i%@#y$s&t%n#Ku=kDclw@)Hf$ z+|z;R$K%Z6=$}@ELZG?=%u_V8iRke-J|?6&oT zrc*Ph87(cvXBY}M+LzJSXbwq61AfZlwGfB7%S`=`EfCNH|MB=&LXk}0Z;53~)sWaK XqnA(naz&aS6%ybZ?DOEn*@Axop~#fw literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_invalidate_mon_op-members.html b/trunk/paradiseo-eo/doc/html/classeo_invalidate_mon_op-members.html new file mode 100644 index 000000000..127f0a864 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_invalidate_mon_op-members.html @@ -0,0 +1,30 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoInvalidateMonOp< EOT > Member List

This is the complete list of members for eoInvalidateMonOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const (defined in eoMonOp< EOT >)eoMonOp< EOT > [inline, virtual]
eoInvalidateMonOp(eoMonOp< EOT > &_op) (defined in eoInvalidateMonOp< EOT >)eoInvalidateMonOp< EOT > [inline]
eoMonOp()eoMonOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
functor_category()eoUF< EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
op (defined in eoInvalidateMonOp< EOT >)eoInvalidateMonOp< EOT > [private]
operator()(EOT &_eo)eoInvalidateMonOp< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]
~eoUF()eoUF< EOT &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_invalidate_mon_op.html b/trunk/paradiseo-eo/doc/html/classeo_invalidate_mon_op.html new file mode 100644 index 000000000..1fd854a4a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_invalidate_mon_op.html @@ -0,0 +1,55 @@ + + +EO: eoInvalidateMonOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoInvalidateMonOp< EOT > Class Template Reference

One of the invalidator operators. +More... +

+#include <eoInvalidateOps.h> +

+

Inheritance diagram for eoInvalidateMonOp< EOT >: +

+ +eoMonOp< EOT > +eoOp< EOT > +eoUF< EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoInvalidateMonOp (eoMonOp< EOT > &_op)
+bool operator() (EOT &_eo)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+eoMonOp< EOT > & op
+

Detailed Description

+

template<class EOT>
+ class eoInvalidateMonOp< EOT >

+ +One of the invalidator operators. +

+Use this one as a 'hat' on an operator that is defined to work on a generic datatype. This functor will then check the return type of the operator and invalidate the fitness of the individual.

+This functor is used in algorithms that work with straight eoMonOp, eoBinOp or eoQuadOp operators, for instance eoSGA. Note that eoGenOp derived operators generally do invalidate the fitness of the objects they have changed.

+Return value means "Has_Changed" and not "Needs_To_Be_Invalidated" as successive invalidation are not really a problem +

+ +

+Definition at line 46 of file eoInvalidateOps.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_invalidate_mon_op.png b/trunk/paradiseo-eo/doc/html/classeo_invalidate_mon_op.png new file mode 100644 index 0000000000000000000000000000000000000000..3d0b7591e36dd91aa473448d68d29425bf079f63 GIT binary patch literal 1498 zcmah}dpMH|7@tc-C`l4)E7_cgBt%NG6}hbFxWv#L)=W#^LCs`3$|c8Krcj)rgG#It z`j}fTvuIu1@^DJ^wUxQ#lQcWpS^e2R=Xrkb`~KeN`91IRyzldS-i#yOhqN^}Y9bH_ zZFe`E4+5byr{L|XDvB)fIs_}qh9jQG@N&6aLFMvx4ks)}!G1)0dpqNi98$DOu|D3u zi2b6MkqE?!74IDJ>kkpU~1(NtH-?0QqKJ`opmxYTJyF`=+~=GOgR4rP=+Jt~!9OL^mgKojf6D{fQir zt{`HStQgIC5B8bqaOr;y1$Iu{u}N=8{}kP;wqV2UT|nosjL)E2Hmi>s4@Ktt)s3O> z&ge9Qa$yRFb6$cTRijVYuBHNe#=OqfI}KhsjMJG2RmInifDaDltmbx1BtX|(*zc~m z9Jt3@F1)^SwGud)Xb&dOlUmXIQ5~Qm&F~Wv><^5bq_HK^)^u>UU39L=(zG?xnEfu^ zNf_$^AZOns2lEs0`^1@Gn=tMx-<00vnC1mg;~-iI13bTD)!t6WML?#quJrEB@!DaB z&&wajzbWq>Q|~_!Rh}?hAe^=fzb*p<#icKBtnsAG_!;s1ix}_fGm|E$si3+I(;?i1 zUaQnZ|Am~_+c9JSLx#P8`y5C9BsL|xvgrP~3_T(&&hHRBwMk(I>vXcYLaLk%pMUOwqTYCu++@}u@Rxm!E|tep=s z2`q|A7KyHIJ!??HZ=s%d2F;z>NpV_!b<1ncD+d30BL$;HvfN9{<03KX(r^=z2TZkQ zs@5Ux1obI|u3)gsS7QV$7@H-ELumH?OL~%Eau|=_G)|il+e7h*K@*l~ActynGp~mL z#fQF=Szce_FUE++lT4(yjxTe!I%B_OT@n-(3yPeMOg>HNTOM@q^VPxPzhy-{e)BgD zb{aZry6?GLfm5GKC0(;+3%;P3mKqK}Ai?Fk-p4$G@RY}IE($VVIJ zmeMUMg?LYI!p{h4Ykg~-?6D1go^3%=I02Z1M5D~XiUW4RAgfL|9qx?1hxs7cL{@{mnNdAVYnY*_&+gzdLjnoGiL1!+}^z#-QTBkV* zl}V$1#8S{uj_hz*P#na#Y?(lU;V$S_7xX?uvE~|wQ9?=h!d@mNU7rZA^|%YCThNP4 z0~~M##WAVjKmzIiu(SzYzg9Ak+#F?&k~bCdhUd7M0xDA8bd@};HtlUR)q~Wz-|)~i zmNcMI{n9uql*JNsW`!xw1~h&c6%^ctrDzxI+1y||+$yrG`YSWI zsydg4e^#p>Q*x@B7@d)|qxxXg$OWg=fiRa>@shdBfonWpC<|l1oiqL$!Z1OrIar+3 zk4(^pCd$WR3%R=-8rIZE{GhNy8j;O-?gbu285Z^g2VM69kn@ + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoInvalidateQuadOp< EOT > Member List

This is the complete list of members for eoInvalidateQuadOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const (defined in eoQuadOp< EOT >)eoQuadOp< EOT > [inline, virtual]
eoInvalidateQuadOp(eoQuadOp< EOT > &_op) (defined in eoInvalidateQuadOp< EOT >)eoInvalidateQuadOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
eoQuadOp()eoQuadOp< EOT > [inline]
functor_category()eoBF< EOT &, EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
op (defined in eoInvalidateQuadOp< EOT >)eoInvalidateQuadOp< EOT > [private]
operator()(EOT &_eo1, EOT &_eo2)eoInvalidateQuadOp< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoBF()eoBF< EOT &, EOT &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]

Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_invalidate_quad_op.html b/trunk/paradiseo-eo/doc/html/classeo_invalidate_quad_op.html new file mode 100644 index 000000000..97cabd006 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_invalidate_quad_op.html @@ -0,0 +1,55 @@ + + +EO: eoInvalidateQuadOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoInvalidateQuadOp< EOT > Class Template Reference

One of the invalidator operators. +More... +

+#include <eoInvalidateOps.h> +

+

Inheritance diagram for eoInvalidateQuadOp< EOT >: +

+ +eoQuadOp< EOT > +eoOp< EOT > +eoBF< EOT &, EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoInvalidateQuadOp (eoQuadOp< EOT > &_op)
+bool operator() (EOT &_eo1, EOT &_eo2)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+eoQuadOp< EOT > & op
+

Detailed Description

+

template<class EOT>
+ class eoInvalidateQuadOp< EOT >

+ +One of the invalidator operators. +

+Use this one as a 'hat' on an operator that is defined to work on a generic datatype. This functor will then check the return type of the operator and invalidate the fitness of the individual.

+This functor is used in algorithms that work with straight eoMonOp, eoBinOp or eoQuadOp operators, for instance eoSGA. Note that eoGenOp derived operators generally do invalidate the fitness of the objects they have changed.

+Return value means "Has_Changed" and not "Needs_To_Be_Invalidated" as successive invalidation are not really a problem +

+ +

+Definition at line 114 of file eoInvalidateOps.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_invalidate_quad_op.png b/trunk/paradiseo-eo/doc/html/classeo_invalidate_quad_op.png new file mode 100644 index 0000000000000000000000000000000000000000..caba3e89fdde409224ad2954d5153b51c753c912 GIT binary patch literal 1723 zcmbVNX;70_6pc%nA_j!2SWwU^vWUnM36UZqB0JcCpoW;JmEC0EQ-Xv=MZg6C6--G2 zvIT^YsF;PY#wFsCFCeL4Ac3+pDT@mNhCK~-9DlU^(ayYg&Uts<+#FU%pI@`Bi2g)wJ$_PoSGhrBX|kihuhyHb<>KPd=Yde54vw zFPEG~`UODt$lruQAR0e;?sEx@r@k$CSySb(I-TbC+KA$_?nLvRV5QbcmLfB8ek8= ze~xzAuO(zFiO$Y;dC^>**^J6pJyIgqW<&j2e2crEKdYWM$22NUNFLPy0Ndbfch!kBGB*+pn1Jynj+difS!*VF$B%K4Q1d5u?FzYFO$>Z5~Y;Q#^KCH z^1R2UU`^e#`d9+sMbm5KS&JlQ$C=R366TW-hfb_0|IF6(W0t2-_e~grZXq@0#=H<3 zd&6Fd6-@@6Bu4E{jkXJG`SeC`3rt&>Y2&0P-R;juRNz|d2}GPo7H1fGC7;*U(`72( zOQC!}tWS*6BSiy44*Fz_GMtH}qHHUk1{f**2SRK!I5B%rSFdIP&!q_gN84770d!+U zZifj#cWUhbmo<6^5lsYi^HtZ1i1E&DobPbZ*jPUhyW!tCP|X#Rt!6zkNET39<*= z&uy=sKAN;a6s8>=OF`V`HGc6VSU$xlUhZ5Xp@~U*0JG+D`GiT^`e&{0@q!`mBE&k; zDl=HdUf}Owo4BCsHZ%9Tb^AB#*KS7hkJ4<_grT7@$ zb;h==2J4Ck-eTkS%=$usQ!f@*XK{ppw)CA%;UC!^CErCzn!Lc<;u{)n!>pm#28-Vx zw?ftO7ltPqCZJAnU`WFg=g31|Hz!}v;zM*ys@LE9Q00{mXt8SbWRV8r?U?aLRAa?N zEZK@v#;z3!w^w$HrL6u-42#uvBMdwpWe5Mmt4kV7F3t)b6G|`Cp}VE0ib2L1QfD=n zhw4JLiHj-+YP8$QXmZZczl$+TAcl z?WZj)H6N^1Rq=K@Iu5#ArRgW8A0k%v5H+{ibAujJ*axHEZ5|@PmAv){?d=8fwlAa; z?Kc(W*f(+fmnty{Tjhu0XOAAVe6;9mE=IyeUR<=?x_o%TOEhKSWR~Q3}<^oIE9z3FrUf{fa$vRb%~Oj z;}pYAW6j_P^^+S5R|I!R++sO`p zOCmBAfq#Y<#4tZ6(gH@>ycrgb+{jsa{96_U-{?-`S~dvdSAec{(fGPUpgxw~`KhgVw* z3^H<%Ll5KnS?)g;xX^7#vXvFGGDnKfK0BkaYPZ|%)F@j{fq9q!kIC&u1``MlwOPiGZs@750S51gnQ3QZM1PrSq;- z2e^oK3U^p$4pvs4K{Ijp@W&M_U!Sw66Ik^pqYx&Hl+*=~>qBgT&ii269g1!_zZyix z0&Cd3GVV;ocnlR7vniT$kvNcqj5XH)vD83>**PHXg2mz3jWCVT9m-@J88tA=8S`nwDHU?JXE!8Q( + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoLinearFitScaling< EOT > Member List

This is the complete list of members for eoLinearFitScaling< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + +
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
eoLinearFitScaling(double _p=2.0) (defined in eoLinearFitScaling< EOT >)eoLinearFitScaling< EOT > [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoPerf2Worth(std::string _description="Worths")eoPerf2Worth< EOT > [inline]
eoValueParam(void)eoValueParam< std::vector< double > > [inline]
eoValueParam(std::vector< double >_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< std::vector< double > > [inline]
functor_category()eoUF< const eoPop< EOT > &, void > [inline, static]
getValue(void) const eoValueParam< std::vector< double > > [inline, virtual]
longName() const eoParam [inline]
operator()(const eoPop< EOT > &_pop)eoLinearFitScaling< EOT > [inline, virtual]
operator()(eoPop< EOT > &_pop) (defined in eoPerf2Worth< EOT >)eoPerf2Worth< EOT > [inline, virtual]
pressure (defined in eoLinearFitScaling< EOT >)eoLinearFitScaling< EOT > [private]
repValue (defined in eoValueParam< std::vector< double > >)eoValueParam< std::vector< double > > [protected]
required() const eoParam [inline]
resize(eoPop< EOT > &_pop, unsigned sz) (defined in eoPerf2Worth< EOT >)eoPerf2Worth< EOT > [inline, virtual]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< std::vector< double > > [inline, virtual]
shortName() const eoParam [inline]
sort_pop(eoPop< EOT > &_pop)eoPerf2Worth< EOT > [inline, virtual]
value()eoValueParam< std::vector< double > > [inline]
value() const eoValueParam< std::vector< double > > [inline]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_linear_fit_scaling.html b/trunk/paradiseo-eo/doc/html/classeo_linear_fit_scaling.html new file mode 100644 index 000000000..6775d151a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_linear_fit_scaling.html @@ -0,0 +1,54 @@ + + +EO: eoLinearFitScaling< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoLinearFitScaling< EOT > Class Template Reference

An instance of eoPerf2Worth COmputes the linearly scaled fitnesses with given selective pressure Pselect(Best) == pressure/sizePop Pselect(average) == 1.0/sizePop truncate negative values to 0 -. +More... +

+#include <eoLinearFitScaling.h> +

+

Inheritance diagram for eoLinearFitScaling< EOT >: +

+ +eoPerf2Worth< EOT > +eoUF< const eoPop< EOT > &, void > +eoValueParam< std::vector< double > > +eoFunctorBase +eoParam + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoLinearFitScaling (double _p=2.0)
+virtual void operator() (const eoPop< EOT > &_pop)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+double pressure
+

Detailed Description

+

template<class EOT>
+ class eoLinearFitScaling< EOT >

+ +An instance of eoPerf2Worth COmputes the linearly scaled fitnesses with given selective pressure Pselect(Best) == pressure/sizePop Pselect(average) == 1.0/sizePop truncate negative values to 0 -. +

+to be used within an eoSelectFromWorth object +

+ +

+Definition at line 43 of file eoLinearFitScaling.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_linear_fit_scaling.png b/trunk/paradiseo-eo/doc/html/classeo_linear_fit_scaling.png new file mode 100644 index 0000000000000000000000000000000000000000..3db707334468acfda1b6995f554c84c0e6e422cb GIT binary patch literal 2469 zcmcgudo4$#~Ta zsY4@=Mp9vf8ShCQfUqDy6fJx?z(^6wZ41r&t9LsKi|Ff{_MSWDjH=c zBdH<@fk0%A+uJxnAkZ)YZWe(G>PDHv;euud8tH7y=ko=S&u=a)#9tSnZ>71pIhx7; zAm|E(IiWBR%kcq!2t>l{xQ&%_ME-0+d*-yZqOAu|$r~{2-oe$d*RlvZX5Rm@Nn>8o z`sKCmG4auc%+L|>`dYVR_%<0YKKH7@wK`>OMN<2{m<_X$D;Ct8)rki?9Lk0tvuA~^ zaLQ<`FgphVlvv^(J zk}_M^vqAZy(QJK88M>m+r9HAdMDsj_bqaS1c$A?|?jlEOsnSCN#`cvtl~UgxY>2t{ zYFADs!^R%BuLKpKmy1w}&u0);OAA-ic$#B@9_|aosXf#+AH?{N5sz{@yGy4~RH8e; zvqYOjMehYxO>*t7ZN!7tS%WWbFsidv78joB0Ym*o35fEbRFpOnu|}zgOx0(nmJ$vu zqPRQAD3h$Mu^pZ>Q653*i$rhpLRtL7}(x#T2Iwwz_aFy}q3=!@iqa%{ z{qPZ_LI`w^ikg0r4W?7tStOyz1{b*O0MMGAXHD{jU?C5!QudeJ z;rbSYlKk%SE>@$?aFTo6xjy%&;l8*C{Eq3n%HxxTh|~MKRHt(}ws54D!)|l0hj1j( z6x+L8PfA%)q)`?w%ox=cFX*l#KTX{p=`@@b?LC}W=zW9?NAeqChuMANQ1BMKRN)p6gT8#*W%8@Q6jgF2; z80~bHsFk{BRVLrqlxoIQNz!{C9&aq}BJ$61ioeNTPppG}*vW(FK3Cf*_MLGOh{=9u z?g_+HzccoKPxF_}lY^yKXJrNT*V)d#%rxa%>hXp&%$WZAeaY$Yf_4oyasU=MTM-dpIM z=Ey|}`FL;JmF~I=wN2}0%XmV0e;Ed5X+Q5{kO&MI*I#`d=jO0r1PtrIM_s0UU$5&_ zEMdZ)@q=&=pePD-Q&P{}44goe6-kIqqkp&Q&TL#umsC=n6;gq6WWs z1n0eTqQP>ReN`5^2cA!m38Y^U(c$B*XGr>0^fw&OEwEdeHPRo|XF17m&kAC1&C~j< zXl_*wD=DJ}MIo{O6Tk1^UmRhqUx=+BJ%-9rn+gCIhi>G6R zcfHv@FbuX%M~tmR#L@Rc!7I<&y2!%7M@z1sC2s#WL$Guz$2P+~gd00ZrpuDSHI}%V z5#qJtmO8G_ikL9);PcuVvCDzjo70{S0f$6;v;E^4|1nlNpPDiUgsLN4}cPLB#&8g(r$8Nw$LHv)ejw+|mRDc4uscbD|eV8DvqMxjqu-8d!9! zZ=A8H{|d3%mF$600mHx05bs^{!?8z8vL!`(=wh^vo(&>>FG&pes8}gAtS{|Z=zh-3 z(d6eA!QpSKPh^C?j^@g-WiDhI)j3GIHozP&d6KrwWdJQBokk$jZF{HT{=Nd{8XOr- zsv3TH2uHPK%_*#}Avz3CiWE|f|NZS=A}=}B4UZWl)j=Pcv8}Cbk8zDMWWG5OnQQbPun6 z$+gTZUV{USBbKW`b>8MeSId=Kv=m1*58s~BpD+NU7+^SYJ@jc?bw~d+yU7=yMXZVhYbAYj4b$C_gse`y(X4bIi1h2 zqxQ$@bBg=bPIQXGDYP_Bt1r&D<+&SaUn?9L%YAe-9~Kn>FrU)l0E5+qUzhG}qPIwY zkw&c;muwy{rsXTJ&5L;QD0KhqGQULdv>v$-@~1<;0-nKK$?4clKJ@7O#Fg?2d%ECH O1vzeuvY}by6aE0N^P|lG literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_linear_random_split-members.html b/trunk/paradiseo-eo/doc/html/classeo_linear_random_split-members.html new file mode 100644 index 000000000..83d669b9e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_linear_random_split-members.html @@ -0,0 +1,21 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoLinearRandomSplit< EOT > Member List

This is the complete list of members for eoLinearRandomSplit< EOT >, including all inherited members.

+ + + + + + + +
eoLinearRandomSplit(eoHowMany _howMany, bool _returnEliminated=false)eoLinearRandomSplit< EOT > [inline]
functor_category()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
howMany (defined in eoLinearRandomSplit< EOT >)eoLinearRandomSplit< EOT > [private]
operator()(eoPop< EOT > &_newgen, eoPop< EOT > &_eliminated)eoLinearRandomSplit< EOT > [inline, virtual]
returnEliminated (defined in eoLinearRandomSplit< EOT >)eoLinearRandomSplit< EOT > [private]
~eoBF()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_linear_random_split.html b/trunk/paradiseo-eo/doc/html/classeo_linear_random_split.html new file mode 100644 index 000000000..5ca847201 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_linear_random_split.html @@ -0,0 +1,54 @@ + + +EO: eoLinearRandomSplit< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoLinearRandomSplit< EOT > Class Template Reference

random truncation - linear version +More... +

+#include <eoReduceSplit.h> +

+

Inheritance diagram for eoLinearRandomSplit< EOT >: +

+ +eoReduceSplit< EOT > +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + +

Public Member Functions

+ eoLinearRandomSplit (eoHowMany _howMany, bool _returnEliminated=false)
 Ctor: must provide amount of reduction, and whether or not you need to return the eliminated guys.
+void operator() (eoPop< EOT > &_newgen, eoPop< EOT > &_eliminated)
 do the job

Private Attributes

+eoHowMany howMany
+bool returnEliminated
+

Detailed Description

+

template<class EOT>
+ class eoLinearRandomSplit< EOT >

+ +random truncation - linear version +

+ +

+Definition at line 163 of file eoReduceSplit.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_linear_random_split.png b/trunk/paradiseo-eo/doc/html/classeo_linear_random_split.png new file mode 100644 index 0000000000000000000000000000000000000000..e2b4842c3729875d5e18dd2e6ff1186cb3a01838 GIT binary patch literal 1893 zcmb`Idr;F?7RMt}T@@${tC5JNN~Z{75gQ&2Oen9iM8F4$DPRPOv;h_{yb?$PA`;5u zXXv8B(g2DgLYhR&!zdwv1`>23kOqSCTn!*JBpR?ufRJoz|DZeD{bOhLk9+U;o;hdc z&gY!(+>%q_!InEAJ3%0jWyoIw&wxN?FHO4Je5+}1_1L%9bnHD9iV89sjV5U{cGuU( zR+!Yg)!p4q`q4ORx^Brl6CMHjZ2s9-Aken;kU&2ak*=f(KMxBV#YX@2i?W=8 z=D&k~aweVS8WzAG4$s0Z4Y2ChcT)Yw52w~=Lgw}?ihQePU!1C%RcncUhPT4v)yttU zE2>a3>;-`YXZ(OCIf)U{6K%dLA;JOOg&4v8d~_tP#YgocQfXF5@f>)%e}wlpGP-W| ziSR^gZpqIZ&BceyUq6YtxM2aFPJVE!`J7wmM5Q^S^qTlMDK9yq{0olw}Jr#5;~PH!XRkZU5`&Q6t_4O0y=Yp7Dd zdr+2qd|F|RpV>N>>_cuj*`gWcQ1FHMuTTR$9Aia;3cp@672jIAhfD;!PWA~a)&xE1 zLfSpgy%?UjQXk8uQ6@hZtpGz3+z5T&`$x&h-~e);;ex@DS(S5SEd)04;4z$5r${ zXF0SLCoT>&pnEn*Ys3zWqzjzv0AE6rp<_sX8vA8uDSP1{T~EmGSc1=| zkA0ghYxeD}Y??#$v?S(DoPTd1-yn|MK^fY$%h@~kd5g8tMXpKM!`E-rfyGSvq3F5Q zV{+GOFRnlD=}Mf?6$ISAg@?henpz%8lWG0>Im=VFX}#Q)GCo)e-(q(+%Pc)qVIHVo zOR6oXF1wp2Y1PaY^+*k==qw80FON)-4K?9q5@^u?_V%s_Q!=4@bLCi#TjPQ|-Rs zXw%p*8t*J@@s_l}X8H%=kBig^SI(Zf+2N;j{7^`I@v#SW1Zu_lnR3VDJJlxu!>jaU zN@0A>iBG9l>6qmEGVQwSFDvLcI2OHHY=?1XjfvVR&1B4yUAY8}x#5 zTD$~}vYSLHgtcth9MUPe-QBS2ZlFM+g#DjRWL?qRtP;CK?Vg;uM{BaArtv0Xea;c~ zCw`4xf}i(C#>Wd&C7s(y-1OGs>w~%Qm46HUbZMHvYZW z0lv-j!7HYwzZohudA&L&X3X9!2aB_}V$=T z2qGH!KI4Uc_^2{+$UjQdCwNFLNK>xg9$P^c#bNN)GNJC4I6XtIfC=98_o#t@CR+_jy`0j%x*s-NeK6^)A1;xGISZUUYt+ zpw>O=eLOd7Td#-f^+AM=uToOhAoCSs8eo&;W>n^IpHp!YYjdd^s zBz*ezE+HD8_gHXoCi)xmssKUuV&I?->Hxxc2ML1d0zE zU$9KF)AEkXHBX^m699n + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoLinearTruncate< EOT > Member List

This is the complete list of members for eoLinearTruncate< EOT >, including all inherited members.

+ + + + +
functor_category()eoBF< eoPop< EOT > &, unsigned, void > [inline, static]
operator()(eoPop< EOT > &_newgen, unsigned _newsize)eoLinearTruncate< EOT > [inline, private, virtual]
~eoBF()eoBF< eoPop< EOT > &, unsigned, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_linear_truncate.html b/trunk/paradiseo-eo/doc/html/classeo_linear_truncate.html new file mode 100644 index 000000000..bf6542f00 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_linear_truncate.html @@ -0,0 +1,45 @@ + + +EO: eoLinearTruncate< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoLinearTruncate< EOT > Class Template Reference

a truncate class that does not sort, but repeatidely kills the worse. +More... +

+#include <eoReduce.h> +

+

Inheritance diagram for eoLinearTruncate< EOT >: +

+ +eoReduce< EOT > +eoBF< eoPop< EOT > &, unsigned, void > +eoFunctorBase + +List of all members. + + + + + +

Private Member Functions

+void operator() (eoPop< EOT > &_newgen, unsigned _newsize)
 The pure virtual function that needs to be implemented by the subclass.
+

Detailed Description

+

template<class EOT>
+ class eoLinearTruncate< EOT >

+ +a truncate class that does not sort, but repeatidely kills the worse. +

+To be used in SSGA-like replacements (e.g. see eoSSGAWorseReplacement) +

+ +

+Definition at line 167 of file eoReduce.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_linear_truncate.png b/trunk/paradiseo-eo/doc/html/classeo_linear_truncate.png new file mode 100644 index 0000000000000000000000000000000000000000..7bc64fbb96543e0b654a0380ba397085c8c3e0c9 GIT binary patch literal 1886 zcmbtVc~H~W8jV^4#e`_32w~Hz7$HI=d62MJgG3r1j~x^U62lgjgeVbdlSs$NHn^bJ zM-VBAs8mDI^%dl4_Yt;DK?HXIAk&Yw{Xj}w zJCF7vufczTU6yJ_zC@c!1?Nv z4%NwHJ$zR326)f4mnI$1+Q7I9??^{zjCg882#=`*a~gHFIwyA{lU#`GRsNxYu5FEA>;xR|iYg@Bmn%3=fRM+A$+TCZo-Zm#j zGKSAET4mxrnZA!#*`|=p!AE))tn$2;!z7s7R?mNbAAEt>sC3{>wN_N#V!GBgNJ_ar z?Ho15F_RX+9O4hyxK-odHekER>zIM^-cLPZW})V@R#OX{!hRgoOb6~N!0W$< z>wd$0x_Gqdf@m15^_ZHt#cRo<1_UUFsKl8zm2c?;~IQ!|jZy!Idlb~2L- zo0B!8O*rX)E<4g|)?}v<&wr3^l4!&sBYzfXP$Lk9F)*^RMnw2cZ-~Qsu6F*;wJjjE_QjGMIFu137*@9M}trp6Qu%7T6b)dUIK0`3!6=)Lgcn9vTs zsJI5$N1eG2yN6iGa*YMk_HPVsJ0dk!hFr}%(Jry%bl-ureFni_;A!7^;59aui~o|- zj9d!2vyyCidY8&RhPGY_-}TB4!JgDV09z7tdd~C#814MJDv@Vz+Oy>>W9Gvo!Uz$n zdsV^bX*H*$Io%LZCW|Y=FHa%Aw*VU$wl0E3~6TbD*Xg__2T^&1JCV_%Y1PEXQ{0IpLv8KWC=5tn;_r&kMYvj*=qjpo$=nl z6hInEHNbI!{F)K_H;#w7i0V46=(E%ck_*71RO3*O-l%J~W~E0{gya5qO;+7U&OlRNqivnzXk455a$c+XzWP$& zpcOG&K}NDL=ysEvMx;_MrABi*5A*{@nGKS@ETVdJ_UkOxsgVC_!Et?XY_cFw4gsH4 zqz*rxfk1BwgLHMF=Re@zw**MT+IC658IpOkK!lIkt)s>DJDvzDozb}IX3Uoh1+b;Q z7w}c@cC&+`=C1iQ3YcbDW5RZtDu+6kn5@j|3v!ZfD3NCu-VBgi^K}3RwYpDzQ{BMzc BX#xNM literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_linear_truncate_split-members.html b/trunk/paradiseo-eo/doc/html/classeo_linear_truncate_split-members.html new file mode 100644 index 000000000..8ac2f161f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_linear_truncate_split-members.html @@ -0,0 +1,21 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoLinearTruncateSplit< EOT > Member List

This is the complete list of members for eoLinearTruncateSplit< EOT >, including all inherited members.

+ + + + + + + +
eoLinearTruncateSplit(eoHowMany _howMany, bool _returnEliminated=false)eoLinearTruncateSplit< EOT > [inline]
functor_category()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
howMany (defined in eoLinearTruncateSplit< EOT >)eoLinearTruncateSplit< EOT > [private]
operator()(eoPop< EOT > &_newgen, eoPop< EOT > &_eliminated)eoLinearTruncateSplit< EOT > [inline, virtual]
returnEliminated (defined in eoLinearTruncateSplit< EOT >)eoLinearTruncateSplit< EOT > [private]
~eoBF()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_linear_truncate_split.html b/trunk/paradiseo-eo/doc/html/classeo_linear_truncate_split.html new file mode 100644 index 000000000..96b1191b3 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_linear_truncate_split.html @@ -0,0 +1,56 @@ + + +EO: eoLinearTruncateSplit< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoLinearTruncateSplit< EOT > Class Template Reference

a ReduceSplit class that does not sort, but repeatidely kills the worse. +More... +

+#include <eoReduceSplit.h> +

+

Inheritance diagram for eoLinearTruncateSplit< EOT >: +

+ +eoReduceSplit< EOT > +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + +

Public Member Functions

+ eoLinearTruncateSplit (eoHowMany _howMany, bool _returnEliminated=false)
 Ctor: must provide amount of reduction, and whether or not you need to return the eliminated guys.
+void operator() (eoPop< EOT > &_newgen, eoPop< EOT > &_eliminated)
 do the job

Private Attributes

+eoHowMany howMany
+bool returnEliminated
+

Detailed Description

+

template<class EOT>
+ class eoLinearTruncateSplit< EOT >

+ +a ReduceSplit class that does not sort, but repeatidely kills the worse. +

+To be used in SSGA-like replacements (e.g. see eoSSGAWorseReplacement) +

+ +

+Definition at line 87 of file eoReduceSplit.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_linear_truncate_split.png b/trunk/paradiseo-eo/doc/html/classeo_linear_truncate_split.png new file mode 100644 index 0000000000000000000000000000000000000000..0aad43d3da1e625ef5b9d0847d121e82945228e9 GIT binary patch literal 1890 zcmb_ddsNbC8m66`E{;o6qY~JC%2Cglnk1k>le&&sW+s@XWLlP^gQAkCpiL&2DcUMy z<^9&=piq&TsGw=!YDuO+=ItnXD+KWdt_b@(%{Y7Z?3r`+kNxBO-uHXY^T&Ih=Xu}n zrkAIi(Prpo5C~-C{=JJg2=tdRAa7a!8E|tC!yrI_c%ATZ)$8>@s@Jy^7YAhn*{9Re z(vtX0{~ma*i}m(A13EhKHWUQIlk@9jgA`Omf;!c;KT z)tc3wZC}44cWxrVzfwOP5Z-*hRW$7~^wYdby+0n&w?AGB$7f@jR2TTWw`Hc367B67 zG+|Fc#Nco`SG=%wMohVFdkEbh4q5VLrrz(2H^u#63XwNnz$r?WnD4oBu0;_|_N=@I z!{8$>7bvHaS{J{xZjuH&pFxJ)sY_YUP2XR5DPUl*?yfvzK<%%#E=w>~Bwii_&xUjd z!3n)#QOX1Plr|fU6;~AQ(_eB@aKYWPIJY%$XYoXC1~#tDFDEgEdw(=m=E+^Wm!U?v z462VVn}Lfz6iKc;;B8*`uvn9r_&Odmy+w`sEKIl?W>Y1 zbbD*BosUiUy^%WKb@LqkMD-2+Wa=j7j^+qlTJq1t#JkTiI$gf05J&3>jYq%G7#{em zI9ohNxuY^XD!X#U%qX)Q5WKg1F=mS$Tf5K>vsG%xl+T~wuYJ**urB(YD_E zU~AsOE$abdPh~RouEZldx~KAdY(Il#Jp@3_0H_@R?Xaye-QD(oD9AqY?no3mx|Yy< zZQ#3q_xZ_~uMkkEoAZAbS=t{~FACBy=fWLZI1&MW?{#6%8V>#XY4}J*J#|amk;2%i z7h|X=7o8U^xWXSfEvFpt;iDBSqixjsc8WZ-EJ8xwB}41$gwhhFOYYxsSr*$_3Ky<- z@;>RuDHCCyiNE_#?>?_pW(T}od0_JsKhpb7!fSqsLzT|3OSLL_zZ2A5< zKGCDb{bknE2375Vx5hS$Ag2KcQ0)yv&G1+N6lyDi2D>PK3tUbjew=I1RJ5-nRODzgnPl8tuzO=u*Dn1CS4c@ft~%0v~-V9$yS^uxZch#_RMY`S(r?|8uqtI+SMfv zSxP)3J4oYwGu4px;n^>RT5~y0NKK%bDN)IC=R(sdj1v}GSwwsQ3!}3Z;cehenF70E zWBO$qU504s+lp!oZqLFOq;?4-YOjy+;@j=YB!#k0*hbt)!}L$P+3CFY3>vJIGA5C_ znDKf$f-`7n1`379HTNRF&$zMEWasq1d|hsrIi0I6Hm z1Y#{RSzjF|HF+2d9?1IfsU&UU7~b{yO2}K5Q;v$B9_QiEsqoT<8LKU`p7^@25EWSK tc}sgnk}=dxu=&%D`rU_XCRRiB8`!T;_KEmx0`MV%++96g*vEpd{|ku-$ru0t literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_m_g_g_replacement-members.html b/trunk/paradiseo-eo/doc/html/classeo_m_g_g_replacement-members.html new file mode 100644 index 000000000..744f7e9e2 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_m_g_g_replacement-members.html @@ -0,0 +1,22 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoMGGReplacement< EOT > Member List

This is the complete list of members for eoMGGReplacement< EOT >, including all inherited members.

+ + + + + + + + +
eoMGGReplacement(eoHowMany _howManyEliminatedParents=eoHowMany(2, false), unsigned _tSize=2) (defined in eoMGGReplacement< EOT >)eoMGGReplacement< EOT > [inline]
functor_category()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
operator()(eoPop< EOT > &_parents, eoPop< EOT > &_offspring)eoMGGReplacement< EOT > [inline, virtual]
plus (defined in eoMGGReplacement< EOT >)eoMGGReplacement< EOT > [private]
split (defined in eoMGGReplacement< EOT >)eoMGGReplacement< EOT > [private]
tSize (defined in eoMGGReplacement< EOT >)eoMGGReplacement< EOT > [private]
~eoBF()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_m_g_g_replacement.html b/trunk/paradiseo-eo/doc/html/classeo_m_g_g_replacement.html new file mode 100644 index 000000000..da60c1fd1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_m_g_g_replacement.html @@ -0,0 +1,56 @@ + + +EO: eoMGGReplacement< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoMGGReplacement< EOT > Class Template Reference

eoMGGReplacement is an eoReplacement: - choose N (2) parents RANDOMLY - remove them from the parent population - select best offspring, add to parents - merge (other?) offspring and the N removed parents - select best N-1 of this merged population (detTournament only at the moment) - put them back into parent population +More... +

+#include <eoMGGReplacement.h> +

+

Inheritance diagram for eoMGGReplacement< EOT >: +

+ +eoReplacement< EOT > +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + +

Public Member Functions

+ eoMGGReplacement (eoHowMany _howManyEliminatedParents=eoHowMany(2, false), unsigned _tSize=2)
+void operator() (eoPop< EOT > &_parents, eoPop< EOT > &_offspring)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+eoLinearTruncateSplit< EOT > split
+eoPlus< EOT > plus
+unsigned int tSize
+

Detailed Description

+

template<class EOT>
+ class eoMGGReplacement< EOT >

+ +eoMGGReplacement is an eoReplacement: - choose N (2) parents RANDOMLY - remove them from the parent population - select best offspring, add to parents - merge (other?) offspring and the N removed parents - select best N-1 of this merged population (detTournament only at the moment) - put them back into parent population +

+ +

+Definition at line 50 of file eoMGGReplacement.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_m_g_g_replacement.png b/trunk/paradiseo-eo/doc/html/classeo_m_g_g_replacement.png new file mode 100644 index 0000000000000000000000000000000000000000..18d5592856f144fb8083d23424b97df229947f37 GIT binary patch literal 1895 zcmb7_c~H~W7ROVx3WUWcq8NmLOA%RwvdGp1kVRa8DlsEl2oAeZgCQ(IsfwUBNU1O4 zKp;TN8Xy%2M8b~!MPh+yg(s1i&^Q1``u^=@ar6wEVU1um}h z4mXnJLm{l}T&SEm!DB@~Eu6f*k$&2`EG}|V&`y~rPabRX-0^i8G`-A8X1Kti_Qy`$ zJ0-Udh{(PyTybjcD6VVqiMX;BN$uHxo$ZAPt~dEs=0^`$dVRWJO$?O9OI&u!2{&1@ z-YS@3`eM*nk4c9We+60_s|&25Zg(;!FA*`NVQsGl*-CEIIlX%1uE?>Kn^{-!ZzWzs zh5&nlgCn>JmD>seh94?;0~`XqFkzS7ewQY&{a>?Vu*OBx^cIx$!L%y8jSEA;RPa!d zOv#uHo!X6Gnj5Qy&$cLdI@Gp|R~|i5!?PJmMPEa`91WEH_AWVF`I049OrK#?kig0w zj+|Tzqq)lNDVxJ*(MMl2G%1`?yyT$A%XwD-!{e-rz zx~MKeluJ>B*`EbB4M@g94)YmflCEqP*>n~H(iscfHc@okOWH8|PExnzh^OQ^T+|O{ z*Tsyvb)REs%{&phLo4N(u|C+qgAv9edE8X_%v^CVEmJfxVA+ByKjgHYdu!0<4c+TP z{Hhku4F(JRSn%PA=U3plWSd@+=*E3CLYd;oH2MykY-PcD9_;;ylOWZ56zRP9ZH<(b zI7g$^5Oq)5mn{4LN{n<#JLUPAdksZflLtKg^iWM_R^pxi>g;+<6UgUxDAIAb&B{|NqiDZR@xu|Ybg=Y2 z(Li**=B~lrGgG3)2O~0d8VZpC8iB5lL(fZBJ$u;xRc9;4xmv?xX(n z{4lbAdKD_Er>HcI00rM^H~r|1yDkVhLRL`N6DB8f+*l3oik_Y8Tyky}?ME>64U+8N zZt+NsZt4%`OW|`%^Z`O=)o+KKn!}>OWTWH0vDp*vH=EV0iZ{@y%TpOXs?weCJQVtC z$*Y?1L$Yk<2;<)^s0dJw0fkEnEWfBVDlpM7OZH0@s(-CuIYSVmoMGz&rB9moNE^{? z1Ii{8_q6zRG>MXs5vv=Ab*?*y(t+j3w!CQA>b%ZH?UN;Rxqd=*DG6i>wJk+l0HZCm z%++9B7`?4Qd%tir#o%g}y|Y0+gZjtt{|)i)itx{zUE0D2g?TxYYkw-6f$8WM+pjo^ zW6bqtYtO5O?5eF@dS8zNtvXpq6HI`UnYk}M1Ps5??~V7UlnsOqZX>pq3`|wLKg_!^ zI^7in%lY13&v9O4Ym4L`82f{(c5l0n77uugoV{~tcYYjlq?>E)XD1$X^ez~1-`&DCvL_n!?GGA12GFksQ{IJ$y z7nUJtzr`;+Z6|zyt0GuxMB$<_?u0XhNun<3n+Q`)i%v0xm zU}jY9 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_m_o_fitness_stat-members.html b/trunk/paradiseo-eo/doc/html/classeo_m_o_fitness_stat-members.html new file mode 100644 index 000000000..bbb00c0d9 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_m_o_fitness_stat-members.html @@ -0,0 +1,40 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoMOFitnessStat< EOT, PartFitT > Member List

This is the complete list of members for eoMOFitnessStat< EOT, PartFitT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + +
className(void) const (defined in eoSortedStat< EOT, std::vector< PartFitT > >)eoSortedStat< EOT, std::vector< PartFitT > > [inline, virtual]
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
eoMOFitnessStat(unsigned _objective, std::string _description="MO-Fitness")eoMOFitnessStat< EOT, PartFitT > [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoSortedStat(std::vector< PartFitT >_value, std::string _desc) (defined in eoSortedStat< EOT, std::vector< PartFitT > >)eoSortedStat< EOT, std::vector< PartFitT > > [inline]
eoValueParam(void)eoValueParam< std::vector< PartFitT > > [inline]
eoValueParam(std::vector< PartFitT >_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< std::vector< PartFitT > > [inline]
functor_category()eoUF< const std::vector< const EOT * > &, void > [inline, static]
getValue(void) const eoValueParam< std::vector< PartFitT > > [inline, virtual]
lastCall(const std::vector< const EOT * > &) (defined in eoSortedStatBase< EOT >)eoSortedStatBase< EOT > [inline, virtual]
longName() const eoParam [inline]
objective (defined in eoMOFitnessStat< EOT, PartFitT >)eoMOFitnessStat< EOT, PartFitT > [private]
operator()(const std::vector< const EOT * > &_popPters)eoMOFitnessStat< EOT, PartFitT > [inline, virtual]
repValue (defined in eoValueParam< std::vector< PartFitT > >)eoValueParam< std::vector< PartFitT > > [protected]
required() const eoParam [inline]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< std::vector< PartFitT > > [inline, virtual]
shortName() const eoParam [inline]
value()eoValueParam< std::vector< PartFitT > > [inline]
value() const eoValueParam< std::vector< PartFitT > > [inline]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]
~eoUF()eoUF< const std::vector< const EOT * > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_m_o_fitness_stat.html b/trunk/paradiseo-eo/doc/html/classeo_m_o_fitness_stat.html new file mode 100644 index 000000000..9b84e3fdc --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_m_o_fitness_stat.html @@ -0,0 +1,54 @@ + + +EO: eoMOFitnessStat< EOT, PartFitT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoMOFitnessStat< EOT, PartFitT > Class Template Reference

For multi-objective fitness, we need to translate a stat<vector<double> > into a vector<stat>, so each objective gets a seperate stat. +More... +

+#include <eoMOFitnessStat.h> +

+

Inheritance diagram for eoMOFitnessStat< EOT, PartFitT >: +

+ +eoSortedStat< EOT, std::vector< PartFitT > > +eoSortedStatBase< EOT > +eoValueParam< std::vector< PartFitT > > +eoUF< const std::vector< const EOT * > &, void > +eoParam +eoFunctorBase + +List of all members. + + + + + + + + + + + +

Public Member Functions

+ eoMOFitnessStat (unsigned _objective, std::string _description="MO-Fitness")
 Ctor: say what component you want.
+virtual void operator() (const std::vector< const EOT * > &_popPters)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+unsigned int objective
+

Detailed Description

+

template<class EOT, class PartFitT = double>
+ class eoMOFitnessStat< EOT, PartFitT >

+ +For multi-objective fitness, we need to translate a stat<vector<double> > into a vector<stat>, so each objective gets a seperate stat. +

+ +

+Definition at line 64 of file eoMOFitnessStat.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_m_o_fitness_stat.png b/trunk/paradiseo-eo/doc/html/classeo_m_o_fitness_stat.png new file mode 100644 index 0000000000000000000000000000000000000000..c64d47328e96d0a0300a56983dca49f80da4a136 GIT binary patch literal 2859 zcmai$do52oys5-*94eJ$5M~M;43js-n3y~wQyQ=FNOU}+BzpWjPF{(F#%mZU zP0{2P8H$+kUNorRh>=Gs423&c_uh5az31HX$KLz9zrXd}d#$}b`}5m39ZpzEiUDFU z7);XI>Npk#6S~chd0T||eGP&1fIlcW*x}4KHa7U-#zs?qzE>(g+H6ftO;ODo9R5@w z412-}hW5ka`h3@klzj7#a-^S8YQy_7;7DI*sg^!h(2d`QX5tb;R zEda6dmQgu7IoG^^gX(Qb((Go(WUckuZmosm3EzY4j$ZjB0+HHVdZQ*iLTph$u@<~$ zxD7M*p2DE1W} zNx+N8BXe51jQbvw#{%k%0#Oh{$IEbgWKSY%d^vm$v3eG7*Y@4s(uFg66jPftf}+d} zMeH)S2j=JUL&i$#$EsM*;pc_H%3{qE)CHDR<8b$@V&)Lrx(N-er94`kYnZz-=2d&K z!$L}w_h$T%cgnDURCN{hgPPqSG_bxEd`Hgf zv+Dg|l=D70w~I@peYz36?YEqbh)MAi*bncrEg&OV1&n@-*`v1kLH!&XvZG&-X@6_+ zPIV^fBj7=2B`hGSSg)j{CqFAFY43`}oYBvY*+uN!tqhR$6nPN0Vxa&>4u64W#w zuC_1jt` zDAvJ`jQ3|rN_bn{9pRxQiL9u0-1gf$CiZ;(bRT}#uK(HSKy53wWO~xVe@5Wmbhb!O z0WfJe)_At!|~Uc zFbJ|+GIbI4GuJJw&p<;_KQ3f6hl!6AI{rRb+ZW|2gtYlw8bU;fB5ev}ferysj@aq2 zI(uv6C0wbS<4hO$&QoW{X+uAwIE$CvL0tJ6XxW)A>?w>aAFt_J=dDzJ<3`9Z%i`U* zA~Qnj$(u!S7OyMAgq8%r-#4?s{+b@iA^skuV)!FzV){Fqqh2b^gU>TaO~wU|p&IPC z7&Q4`g+ayXb2TQS$M1+0I0`e%1c^8SWH}5t1p^PoS?olU|0jLniwjqpMrx~h5vKa= zYj+`F8(SBx7yCWjWz`^(D1lZ*%5MRLnOi|&^#?3^|HWNzF47j-0=BW$G^XhunVEr? zI%-zMOA|-h-pGlIzfdk+fcmYrOdz#pMk>>~s-ruGIlRuiyoZ}63%C_;6}jQf=j4lR2- zS@L_n87|I%xO z)5Ld3trck?p9^0ka*8f05qr9%xE1rHH@K*L%CjAob@?5UGCCVyc6b;w1LgzLpjFBu%N4ds-n_2WCyeCYQD{`@CsTdnWn!TA}TPq$72RMooE*Cn-64cy~3|Cnv zarvy9(Wg?p4WAa9_qsiy1h)$y>vDI&&E+z|Qg_*7*J>I?9ewjPDAz4E+|ajSYSU+^hU2KpX` z91@h7c4i*p;Nn%OhQ^wDBxo8kgBq@0%3wTlUZVx`yeX0|=+vY<Q@=gDc7XS>KIpIG3fFzVo#|HG;&k>t}==K3BeOe)dy2o`$>Fa?1`?NBULUX;IGI zQF5$y0t?r8bIYz2TQcmDPmvdnZN2($ikJuE_cj!lG;i;fVWSJ%g*rMA%sXXsGvEk$Pb+0#&tnettW$8UZV?$j&L zX{lzQ5`L{NJ|^`rTL4r%;}`APuIfoAo6x*PkUsc<+6Sp^SZ*>#!v{^cae>97r&>0I zwLRV}?J!;R-IEf)O^)CEnsslw*GxIA=pdW5Bw;V z2_ir2PyLsUo8U?>^*)CaeoFaKdOBasLM9pVi7-K8p8!_r&s67rRJE!(c$W4Je%M}CAC3xbG1Xkx z!?V?msd&P61hT|eV)m;iDN!-DK8HI!7psb-x3tMjh@&A<{D``XHc3gyQs^e*Q)>#< zW%=z|fYy(SC-nua*~TLaf<+-~O=6(pl7H9}4-EYE{oa?dT(hoxl=40l(6a0Hu5qIK ztSq2M9hmweTUD9HnmPis#2si#j%~(_})M;5I)*<{kLJ!kFxZfq# zokN~k$?r=dMkiLrAJQ1NLn-38{yhqljNeLf29usIXg>2P-^Y3ze6G+}f3Zk=S#H6M zThSPKnXO>Qe;n`vlC!n6>$d;}6ZeuKfe9(p}sD literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_merge-members.html b/trunk/paradiseo-eo/doc/html/classeo_merge-members.html new file mode 100644 index 000000000..9ddc7b71c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_merge-members.html @@ -0,0 +1,18 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoMerge< Chrom > Member List

This is the complete list of members for eoMerge< Chrom >, including all inherited members.

+ + + + +
functor_category()eoBF< const eoPop< Chrom > &, eoPop< Chrom > &, void > [inline, static]
operator()(const eoPop< Chrom > &, eoPop< Chrom > &)=0eoBF< const eoPop< Chrom > &, eoPop< Chrom > &, void > [pure virtual]
~eoBF()eoBF< const eoPop< Chrom > &, eoPop< Chrom > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_merge.html b/trunk/paradiseo-eo/doc/html/classeo_merge.html new file mode 100644 index 000000000..2b24dcdd1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_merge.html @@ -0,0 +1,40 @@ + + +EO: eoMerge< Chrom > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoMerge< Chrom > Class Template Reference

eoMerge: Base class for elitist replacement algorithms. +More... +

+#include <eoMerge.h> +

+

Inheritance diagram for eoMerge< Chrom >: +

+ +eoBF< const eoPop< Chrom > &, eoPop< Chrom > &, void > +eoFunctorBase + +List of all members. + +
+

Detailed Description

+

template<class Chrom>
+ class eoMerge< Chrom >

+ +eoMerge: Base class for elitist replacement algorithms. +

+Merges the old population (first argument), with the new generation

+Its signature is exactly that of the selection base eoSelect, but its purpose is to merge the two populations into one (the second argument). Note that the algorithms assume that the second argument denotes the next generation. +

+ +

+Definition at line 48 of file eoMerge.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:50 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_merge.png b/trunk/paradiseo-eo/doc/html/classeo_merge.png new file mode 100644 index 0000000000000000000000000000000000000000..2919bb577ae46bba42ed2792d3d914f64a3a9055 GIT binary patch literal 1598 zcmZ`(dpOit7@mltk&wGb$|cN5q81?`xok7;j3$@NP>)-Ln8B7rlV#*GHn&9XgZ!q@ zB4p(9+c6c5%eY_DP#QZc(acWmZqKv(tUu0s-tV06`_3Qldp?2#;;fjcf+z$65wo?i za)LkvJ^1|gPC-8I4sh4vZ*mSlx}4$hcznv^wco$*lg?+~R(pFp{yA@sAMS{7LO4Ur z7l!>I5TQX^tJ5yg`6~tINF~NlYu}78YN8&wh>lmRa$NX%IQ~2k#C2YhOIBTMUdj~q zyXzsVSZ=&h#nmOA$}TBmS8!P=ouERB-*xy&bJ9T-a9=w1HW@H3_HSTPU&rcdS)pnI zry6Jm%#dqo$liOwk~QK^;NoQJdD7vov{@JZI`Vvolzm?Cxc)s5S2b1i0zvb2eiDh@ z^{N`CqRtrFd$>;(B> zqf8ico}gF*U=C+BiAUi!i60+Tdidft8@O z#-MQYnb*sJXSM{ChS^XPMjdia&R=?qmT?>&q;8CUcA!kFRVS8H({R^HVu5@jitgE) z;hP>Uhentq{9v#$mIKM_RVMjv3%uCDUHoNq{*_+C`?L>gRN%=|ctdt|0Edq4y_yqP zTz|K;wJPpV-~i=C`g~aSsyF^@zQaRmEf%|sTEml~fDj#)^E%lSwcoCMHU-bf>by7H z6?Zlu0!$R27D^zm`?WS8$0+`kj=~lx_nCm3+`=>G*6K%!e(QQ}YE!6{m9~EYT~cNf za5G*m%ixy$c+)ShmIBn{d#0mK%>S`QqYnFSy$o8tm=>S#aanLR<#8LsFuo?s!<%~! z_+&A$WiUN?NlLqnDmtmgN=)P6o+HzwpV^XPzIkDH&#|2t`HK~`+zAiizAxIN-A!@t zOU*#~n@|-&zE!&EZ$7AqH+J)pA0{(P+O7470(BNWz)lUhr0a0Ye@yjPBLM)q1NHTI zO!*f3YNUUvbCB*4iEnRwzuKn4+|AgXr`rtOdTLxgqRDBa%7|d(zZWU>&2Zc=|J1rZ zf}3SZPoFeKdjo-P$E7ZA&c30wIk;VI5e{q|M!Vu9hv4qnNCM}{`i2Iofc);M9a?j) z4ToAYtc8vy3U-+5;>GF|CUr6nNEPm5$$})I{)5#-a8Vd_408Dad{>*Nw2_ieYVMVZ zHP-5hK~5NSkL8F~eQMUS*nqbtI7v~UIq4%mq8X17El6~E`KtJFMFe0MZ5QMb6VuK3 zp*K9q-_*YDt*u*Ko2nlLVZ!Ma$r*?+0XT&Epx`5cUsLXQZ5?fTkBaMI;|e}~w@X|M z9T!E<4R87~u94ehJ#Y%yBsyoY9c zv8{DOUDq4^nw2RXR$koWdzeIf+j_h?L$@V=wcw7{S85bvVj3m>ZyB;+tal$$u|;Uq z0YPuJ0pA4z)z9PvfaNQ&NEBQ02Hf5!!S_F^ZYSN}gJs)nyX3yv_(%lB(FYU_%5d5S zGfJ`RB~n8nRV34#bPh6o0Km`ST`d`#`AlH+a(F>E7_Jz3!BMA_`>3Uu**tjxRbZ=x zX~i|*X$6b@#$(nig_Ri(h_?vvi5%cF0{v)mSLTFOC5EI~{~3FILa zHV~ayO>iN>ID*s9$dusI3@{)Mmcl0?@CD2hDh)H~2qBAn)P+Vc>re{iU@Y8tcOF Z9=S0dYa^sJ$RG9)+cOBOS__|qKLO!U3BLdU literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_merge_reduce-members.html b/trunk/paradiseo-eo/doc/html/classeo_merge_reduce-members.html new file mode 100644 index 000000000..a93612f3c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_merge_reduce-members.html @@ -0,0 +1,21 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoMergeReduce< EOT > Member List

This is the complete list of members for eoMergeReduce< EOT >, including all inherited members.

+ + + + + + + +
eoMergeReduce(eoMerge< EOT > &_merge, eoReduce< EOT > &_reduce) (defined in eoMergeReduce< EOT >)eoMergeReduce< EOT > [inline]
functor_category()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
merge (defined in eoMergeReduce< EOT >)eoMergeReduce< EOT > [private]
operator()(eoPop< EOT > &_parents, eoPop< EOT > &_offspring)eoMergeReduce< EOT > [inline, virtual]
reduce (defined in eoMergeReduce< EOT >)eoMergeReduce< EOT > [private]
~eoBF()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_merge_reduce.html b/trunk/paradiseo-eo/doc/html/classeo_merge_reduce.html new file mode 100644 index 000000000..12e79aa26 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_merge_reduce.html @@ -0,0 +1,56 @@ + + +EO: eoMergeReduce< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoMergeReduce< EOT > Class Template Reference

eoMergeReduce: abstract replacement strategy that is just an application of an embedded merge, followed by an embedded reduce +More... +

+#include <eoMergeReduce.h> +

+

Inheritance diagram for eoMergeReduce< EOT >: +

+ +eoReplacement< EOT > +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase +eoCommaReplacement< EOT > +eoEPReplacement< EOT > +eoPlusReplacement< EOT > + +List of all members. + + + + + + + + + + + + +

Public Member Functions

+ eoMergeReduce (eoMerge< EOT > &_merge, eoReduce< EOT > &_reduce)
+void operator() (eoPop< EOT > &_parents, eoPop< EOT > &_offspring)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+eoMerge< EOT > & merge
+eoReduce< EOT > & reduce
+

Detailed Description

+

template<class EOT>
+ class eoMergeReduce< EOT >

+ +eoMergeReduce: abstract replacement strategy that is just an application of an embedded merge, followed by an embedded reduce +

+ +

+Definition at line 50 of file eoMergeReduce.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_merge_reduce.png b/trunk/paradiseo-eo/doc/html/classeo_merge_reduce.png new file mode 100644 index 0000000000000000000000000000000000000000..de6b0fbb408262b37cc0f142bf8809e5c95b98f2 GIT binary patch literal 3044 zcmd6pdpy)xAID|W%FMX5tz1?}Dr+*Xjma$uJ1K-UW8C_=q|lVhgxtm0HASeANX5u9 zVcc>Tel(bMNojH!Vq9m6HE9{Cd4}zIcAtNq*Z%Xop68Eq&i9=2J-^rM_kDlP`F?-4 zx3z{zC`gEih``W4oNy2k*^U+3YumpP_TR_Y1qcT@`%_Mq0)aqi3Iwh9@1MOXw6+x2rQc7<` zvm>V`o=(|Z!py6=7!_4v2=zX=P;&Rhl+dG-bh;6r>q**B8bb8#W7b}oi{w+Qevo8< z`=E?rZMd`?ITOJ45rOztS}qiH5bxu6yPMtG%eUNTfyJlMqgkr>;Hc4X5B=%qk5s0t6vlOZiJ5}cNgP=h?3m_t{!;d<*b>UF!x z1A=8O@`_l6A%)ga5Zb4D9SEujm}+cXqJK0AOKD^!4>oesK4vb~2p0L%uisViMhhgj zxw6Wr-)d5Dsen9s=Ry>WL`qhjNW|in)~`LgqYBsZI5&7&Fz4K!vG{V(^=*S|)Z3tb z_Z*TkmFH5MrHO8S@RmxjQ%3<%8yG3%#n?3M7Rm;0VhXR_MZ9|xjm1YaIJ9T9>n|M3 z8eh)j87|yOl_>_7RwHV;{xH=R9k_cQXlq5b#18s)butE`L?8Ppkqx^avjtbMJ%!+H z(#wIY!YG1y5dXSK&0;4dQN1t;KtEq|#139G49stou#x`}A1lt#t~8!ynUc%tKLN+7 z)EaS!HMt|O&tXS44ayjug}VYlnE}U8xL;lNa);?Y?(CCRV;c!PT&c0@Y_4xxodUU9{_wM@7-BIrByN|qX8#RoC(ZJoSBKYJY(Uh3DR<5 zPt(QY0o3NYoUAyM(X9>l18K+Jq$T8DpP@CSd!FBBLL9o`Ro4llD$Y0#?C^(D6+17J z6rF3k%lqxB6J$Y-mCo1{aj4WQoO~Y3Iz)6Gqcxm?*46=p0y%upKexYpV(Ta}Wl|RT z7{41ljQ`hxnCKBP)|F}d?T3%ORXM-S>uYm}w2?S2?zQ=VXoqBitjZPXYLSX-55#^_ z`j0LsxfR5x=kfR&677@(JLddD z)2YUz+XD%WWzNICy>um}9C@kZD4g)IVj*>J1Bq1g>R_R6u@O_P#AQ@A82 zyW0-Tn1i>3zM>2;OF_r4iv&N7vJ+yc z=Nqp+mlkC^p_cM14z2JnyD?wdotot;FkwaC`*$jq5nI$s>@MFYOx^kr_kda>1}03p z1H*=vm;eY-3>>v07x-Unqn&+&+=bTr_aI*T{7_P9-dW9B?F%ivjVVOifl^_Nv+WjN zoW=pzAB_G!x4(h*Z@38Qm(Og`mxw(r_gCg1?dG}PiR#yl^vp)PfY&Joi*n zNpD9qcF<}(Lcp5TrmGgVCj+j2n8BJl=)#M3+S%7Sm7#3kUs4ZzsMA!lK`Ob(0+U@{ zsbRe?=faXv3?G9I6v;%=1D5pA(EWBpZb5F@ItqfZa7J;y8M~)k)w}~ti2tJU7`1f$ z&0m(29fX3%?+RJy%`0;T;_(K-`d^^vd{xU)-?|d`A)8H){{bz(U7^%Z_GRa{!S+H>ry4o%Oj~(RMJ_CD_ym9K?7&_Aal{M7HZ1w^Y^2%R)zJ z6rKFULbJ6x4+Jv+egpVPY>_9kH2q$e@Lhv0{Ky$%q11_A+Y1G?iTO`MdJFmKSl*eF zJ!@6s3`>&|9k^Vo1f#|Ztmp1mM=3I+N>f6}3tjoP5TOnVbbF+Y|6{fy41gTJ;=G4y4_3ouVr&_!`wN zkK_zf^C$=DAAajzu}}R z!Y&n8@Q;6g~I#`=n|>%q`ss($v$@&$LEsYKTCEmkv(bu2#DZ2 zRI9-=_t=BFUHs=pEoJMt$~XDV*Mjvi)U>Igl|ViVC>C^DyD7M*1UDD^y~Jd`cZ z=dmA?^>ELN%7bt=q$?K0?hYnBV!i=?!&Q#??`O7{)BxEjOvXSlFD1Qj6v_yfFDXEy z7CCV!B^NS)BKR!K0@*F9+#sZ67CWaZr*@Sue7mG?)&E`g2GM8!S=1N37D2Jr1pAm~P*j>8u%zvK6TUy&5hH-rov_XGhWO^?0Mp#rr zWQH;5a2DG_1T?hap5UeZc{eT)3P%1YO)hSg9l!ilK(P~2l1-T}r_S$GA`S_p4vq=f VXFWr<3rlhlw59Edvg2nH{sF + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoMonCloneOp< EOT > Member List

This is the complete list of members for eoMonCloneOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const (defined in eoMonCloneOp< EOT >)eoMonCloneOp< EOT > [inline, virtual]
eoMonCloneOp()eoMonCloneOp< EOT > [inline]
eoMonOp()eoMonOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
functor_category()eoUF< EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
operator()(EOT &)eoMonCloneOp< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]
~eoUF()eoUF< EOT &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_mon_clone_op.html b/trunk/paradiseo-eo/doc/html/classeo_mon_clone_op.html new file mode 100644 index 000000000..b9c0ad270 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_mon_clone_op.html @@ -0,0 +1,51 @@ + + +EO: eoMonCloneOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoMonCloneOp< EOT > Class Template Reference

Mon clone: one argument. +More... +

+#include <eoCloneOps.h> +

+

Inheritance diagram for eoMonCloneOp< EOT >: +

+ +eoMonOp< EOT > +eoOp< EOT > +eoUF< EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoMonCloneOp ()
 Ctor.
+virtual std::string className () const
+virtual bool operator() (EOT &)
 The pure virtual function that needs to be implemented by the subclass.
+

Detailed Description

+

template<class EOT>
+ class eoMonCloneOp< EOT >

+ +Mon clone: one argument. +

+ +

+Definition at line 44 of file eoCloneOps.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_mon_clone_op.png b/trunk/paradiseo-eo/doc/html/classeo_mon_clone_op.png new file mode 100644 index 0000000000000000000000000000000000000000..e333bf32bfa386a0845c8ff02d5465cec49c829f GIT binary patch literal 1465 zcmah}doBE%}sUq^MqhD{!sSA-S)%rnA5k6(s` zOj|;po0#$@RDNHZ^2$7ZG_&7+{nS;|{>%1Sl=99Aeb`_G@fU?-7Cq*Nklq0#&^rR=A)w6w&uN&u-V6Yl2h4m!mj zy#@lwxj0~KE<_bA6!&J)kEo^8I}cUj%`4X?T5y7iO!~af%sM(wE*<(sAu+t!JzICr zcxsAycB!$CMwMT@nbW1j9_aMj*M9E4Vo%QvGe%kwhf>5D;9x;~?b`bFUBvI*dc3-`A_Kc$0T!4CpJm a{sTxk5YfC~~f@LBZP>Q^grxg%3s9IiGpE}m~&KZ`V)sH(eMtC?kQ!0O09g%=mD4eJyUDCAS(I%#E0V!`Y=~UO`E72lU zgAQMYMIc+S5?07fdbm1mAXruZvla0`-TdIBp~Xt<-=whnOH||4kFluYYz0EpIAsy72_tmKKW#8vyW}Rs?tCGInv8rSXyFGb{I>HGH2?X5SU@hL>3Lu12hQ zjY)#Etzy;!X>cY3{Bf#p!BSou?%2NW6&{NAV?st&`(0uHa%|AP^0wu`ROE-5)WFm& z0vJJ6M^Klt%Ef~SPqbWc_@sBcW6}34G=GPEoQ_<2yVB9kzVdcE>$~Y8(y;#hP)rGq z1U3$X2^$OVU8JZ}1w;Q;q#+r6nCEozgDqFvm1n;%xfa}TD^Js+{R$+V7$Upj0yU}| z({+nKz9fDR6l83{i7-PV%;nI*BtZGRXwYU6*PNLU;aF`hVm#NbFu*5PLw(r!LpHXj z%!&H~9@TL9B|Z-57?;I^2fWz4k{>%+POkptYYDYH6T>O(Oonv`r;Dqy>PV>7{cNfT zLj0UMtPB+ zNz5Baos2axU?M&{egYL$u<&eF9ti5Ih%`-3?0eGTBg7>gAfpyG$WA5v6{80WFPsRw z$*qF%$LyTY;+Puo)Xl|?2&;bDMFD&VJ*M*B!g^fX>0n%l@q#u zifGY~yLga81#u25O-oN9g82F$KO>_LRUX7p1eQV}^im&I%APYBP<2zEEYxo(fKL}x z`Bmp-%?=}@iDh0S0K|Xzvh#+MPX6q$7Q&2m(FzEo5LB}2PBbsj_DDf}F~AyyL!xlz)TRAk#Fx_fzQt@0s2Mi`C!YG}f-eg#-CsB=979YiV1W(H z|6$b{unri0CZjrJF%{2FYaH4humh^rY1Na)b4ltjlzi2#{f+vNrmNZFlT%REDOpB` z+Dqtd4V9-96Q8+eC4BYSS9S8IO_a+Xf9SDch|!$d;YabJPOe-jNX>hPJ0xW)lOdl3 z&v$uKy3TDdYq})l87?7-V;9Qr&Mb(uct02pn#4PLu~zfhvX#KKrskfAlV6+R_}Ho9 zY}Kb3E1P+Z9yBX^#{11S)4xV_s!7L~4Qw7hcm&OUv?O5eTNO`qM8u#&kjzh#<1mH` tW-3tf6(;l)xoA)u#^c#dfV)5 + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoMonGenOp< EOT > Member List

This is the complete list of members for eoMonGenOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + +
apply(eoPopulator< EOT > &_it)eoMonGenOp< EOT > [inline, virtual]
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const (defined in eoMonGenOp< EOT >)eoMonGenOp< EOT > [inline, virtual]
eoGenOp()eoGenOp< EOT > [inline]
eoMonGenOp(eoMonOp< EOT > &_op) (defined in eoMonGenOp< EOT >)eoMonGenOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
functor_category()eoUF< eoPopulator< EOT > &, void > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
max_production(void)eoMonGenOp< EOT > [inline, virtual]
op (defined in eoMonGenOp< EOT >)eoMonGenOp< EOT > [private]
operator()(eoPopulator< EOT > &_pop)eoGenOp< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]
~eoUF()eoUF< eoPopulator< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_mon_gen_op.html b/trunk/paradiseo-eo/doc/html/classeo_mon_gen_op.html new file mode 100644 index 000000000..866721fde --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_mon_gen_op.html @@ -0,0 +1,58 @@ + + +EO: eoMonGenOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoMonGenOp< EOT > Class Template Reference

Wrapper for eoMonOp. +More... +

+#include <eoGenOp.h> +

+

Inheritance diagram for eoMonGenOp< EOT >: +

+ +eoGenOp< EOT > +eoOp< EOT > +eoUF< eoPopulator< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + +

Public Member Functions

+ eoMonGenOp (eoMonOp< EOT > &_op)
+unsigned max_production (void)
 Max production is used to reserve space for all elements that are used by the operator, not setting it properly can result in a crash.
+void apply (eoPopulator< EOT > &_it)
 the function that will do the work
+virtual std::string className () const

Private Attributes

+eoMonOp< EOT > & op
+

Detailed Description

+

template<class EOT>
+ class eoMonGenOp< EOT >

+ +Wrapper for eoMonOp. +

+ +

+Definition at line 85 of file eoGenOp.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_mon_gen_op.png b/trunk/paradiseo-eo/doc/html/classeo_mon_gen_op.png new file mode 100644 index 0000000000000000000000000000000000000000..b49808873913e9125ab1e7d703bad0fb18935247 GIT binary patch literal 1957 zcma)7e>~Ic9v@1FLh6c3uCx+!{W|9!4#UJ4`H^3vViezTFwXUBeoU#uy-|j-P?R#Y z8>d#ohNV`Ww%KkvX!zFALVg`zSHfnNc9-+&b?yXcRRiaYKZEQSVsggDtm&+wR zQod2CYFVK{VK9%WkpviQ3(^mLFg&+mzClzq{>^r8bC;$eUlYdshcl%Y&El{m#_BpH zRL`Gv?T-F1xa?-S*=N6ryz;_6Q;Wm&i1%xU4VV_RbN*iq(_@P)PKhpc*IQVce1X@v zM%Y8uK^H-Gcr^S=}>;oP_GEuo*wc6l{S3PDvBh3W7 z(1FbCP98c3*_LIA^?8$H?E<3ys0n41Q#iD$@AUdCi89Xy`c8o~!`JaYfhPPv|8k?= z2Q$IK6_oc57+H|O^m|MF3#@g3&Z-A;dS#w0iGO(9!K+BEb*Nqf^#& zvgib5M9l}`FrJT&i>tCKiXQN-GM%;=DA6JnW8w?SEu#o#yTQltV8+XZd|HF3JY>|Z z@-ke(vf$KXq|q#`B8T=wrU9CGu`Rw*mI*SZ32g{uMG!O5Sy7WIJtDf2K@1_+8T}({ zVCX{I`DDQU;Y|}Qv9AE+y@+hpkJT+6@OY)}HDW+xA0fZlVG{{whm*@LH|w*l#J&x+ zzd+r_4r7y*2eD!SvMVf+QFuC!J7t=dV=a3SM08ScWx8Naj$8zM7s)=rTv)8_b>Ah_ z^aMRNpiZ(<%$zq&1_HOlu@%lNaoT`Vf7_B0s->&f$6X8{oy@7e2M>kiZv+0 zn%R(yBKDGOIZ1#X*4Uv9OJyp&0lg0BRQ`cleAFbxv@ftGb{c9jR-1xuR=3{7PdDJg z;pShi?M<5N1Mliqj%T;{gkE01pNwu4s@yBjNi+ z87upxh2Q_YsEuM1g)vMoX(lIFS{3<1fI?Fs-dj}D=}$PjM@#z+wVxNPUf)LU{6o*_ z{n~Z|Nk6X4Z2qJC2x!c?dlE9tv@$7qw2)J1ML0IBDfG#3%UAPvm+Dk8DIY1d<1^${ zuom2gXi*Ed(%W~g7o@o&ekIU`rWX*A?3r{Hau_yr62FRPzUyz(Gf_7;nY1ys`!OJvSuWb+PDAp$9Y-ceTInHXlXNI695DW%tFj zs}c%sC;zzKZ2RC^-<1~1hX1!qT1@QDuY{-6g{QQInvawv>c4pj_o!pfiVSCAszb><%geOEQL{+~PewM739%f>N6czS!eEW5#?Rtm@qq(_4-KB;E zvzEOtQ=D?Bu`KWOTyvUKHC=kDM-Le-shs5lL$|W3Rk$0J`((Ca&yzgIB`v l8vo^>|9%BA!nbgxhR!>WamR7iy6R7b`FRJSZ+jm9{+}Ge!cPDI literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_mon_op-members.html b/trunk/paradiseo-eo/doc/html/classeo_mon_op-members.html new file mode 100644 index 000000000..a71304574 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_mon_op-members.html @@ -0,0 +1,29 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoMonOp< EOType > Member List

This is the complete list of members for eoMonOp< EOType >, including all inherited members.

+ + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< EOType >)eoOp< EOType >
className() const (defined in eoMonOp< EOType >)eoMonOp< EOType > [inline, virtual]
eoMonOp()eoMonOp< EOType > [inline]
eoOp(OpType _type)eoOp< EOType > [inline]
eoOp(const eoOp &_eop)eoOp< EOType > [inline]
functor_category()eoUF< EOType &, bool > [inline, static]
general enum value (defined in eoOp< EOType >)eoOp< EOType >
getType() const eoOp< EOType > [inline]
operator()(EOType &)=0eoUF< EOType &, bool > [pure virtual]
OpType enum name (defined in eoOp< EOType >)eoOp< EOType >
quadratic enum value (defined in eoOp< EOType >)eoOp< EOType >
unary enum value (defined in eoOp< EOType >)eoOp< EOType >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOType > [inline, virtual]
~eoUF()eoUF< EOType &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_mon_op.html b/trunk/paradiseo-eo/doc/html/classeo_mon_op.html new file mode 100644 index 000000000..e5050b671 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_mon_op.html @@ -0,0 +1,48 @@ + + +EO: eoMonOp< EOType > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoMonOp< EOType > Class Template Reference

eoMonOp is the monary operator: genetic operator that takes only one EO. +More... +

+#include <eoOp.h> +

+

Inheritance diagram for eoMonOp< EOType >: +

+ +eoOp< EOType > +eoUF< EOType &, bool > +eoFunctorBase + +List of all members. + + + + + + + +

Public Member Functions

+ eoMonOp ()
 Ctor.
+virtual std::string className () const
+

Detailed Description

+

template<class EOType>
+ class eoMonOp< EOType >

+ +eoMonOp is the monary operator: genetic operator that takes only one EO. +

+When defining your own, make sure that you return a boolean value indicating that you have changed the content. +

+ +

+Definition at line 101 of file eoOp.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_mon_op.png b/trunk/paradiseo-eo/doc/html/classeo_mon_op.png new file mode 100644 index 0000000000000000000000000000000000000000..ce523fce33014a8456e54fc58d32d9e52e432f82 GIT binary patch literal 1345 zcmZvcdpOg39LJZYOgTFJR6A)z`syM_WXh#nww&e1Tnp)frR7*RW;E={qcTS{qq8lS z+`62TOLA#ttXW~XMw^K92vb?Im`dTSo}PNn^PE3EpU?aAem}ZR<{eH zyghsnj`E%`1Oh1|;GBG8vfpIi&nUE5hBtbK-sqM3UN@RSE^KCgn0@-`f#%ZGpEV=P z{zjW2w_vIQc@=%`k)DjP=3Yn@rAL??^>eE)aj=#?aRel1Ksvn&2$osWH;2Bu&Pi4T z>9Buy<}_^YVHf-}cj}o=r|=^zsj_8_{?mEDD$O; z&-492-XeV_A$9zEWcR^~4HkFjw6gXr&Tp^Uhcqqk_cd^fj%>rpFhR#O!Ah~)A|T41 z9`CsFWMXffij&AhZ%J~B1uh5w(!F;=&bzY42h{a)S}}}2__0%vG7dNo$E<-2iSVm~ zAl!EW?h%fEmWYXp#|9Tou$yq2AoPLQc?XL*9xXS8K=inl6-|P!Wipw(d}tD`)z3^Q zP~i0`?pXm~k%XJ@F7Rkb`s{gsyCW~+aU~YYgbb^#D!=4)E?PIUW=+yf2ae2aWDAtI z7E5L^laOM1s=reeYLDvJ)X0wLk44F-2VO`qtB6UNpQJfnANYk4dOGV2++6F&#VfE1 zVnL0V>WbX%C(CI+7R<1OmkexZ`;(@7cPnIl$Ke2*XL;6iAh&seO+e9v9vEf9O-XRm z@EP#gY{+HCPZmU_yW+r&GDdqf4M)Pdgbtv>M_H_E#9i`cIeBjC^fkdw>UO?rCouA{ zun4GO$Xj#orn-0V%%*ZiqPi_e@TvX zC`Ebat|ZDS$j$p6LiOW4vxGpJXuv3K*j1WS=kIu#l8hKFpk61>geav4B!ls0J^tj! zw**T#iXJ{DOaogTP@6)i=bvljDsG>hZX>;mcNk*`iPbE){30olVgf}BVL07$5&6}E z@E0_O7b!8s!z=}MY+>SA&8g^6weeqMUx9?=PK-ufP?m1_0`Ui;?_9rG-3?s(X`2uA z`K7$#YF_c%ACr5zmF@#sAtU5-FQ@XYmdLQB#NdLm-ODIme5y@N-={NlAVt|jkp=Cx zT_xsgwavSC?9I8^S$f=QysgN(-v;w^n}Q&-1qI5|g>ZzZTpIt3Ya4jof8Jo;0$hnczAKgRzK|Q|^8G4QL!dinHngh+ Wml+pC?`l*3I|Kpmfh%=BocJ$O$$6^) literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_monitor-members.html b/trunk/paradiseo-eo/doc/html/classeo_monitor-members.html new file mode 100644 index 000000000..d2f05f8ff --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_monitor-members.html @@ -0,0 +1,24 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoMonitor Member List

This is the complete list of members for eoMonitor, including all inherited members.

+ + + + + + + + + + +
add(const eoParam &_param)eoMonitor [inline, virtual]
className(void) const (defined in eoMonitor)eoMonitor [inline, virtual]
functor_category()eoF< eoMonitor & > [inline, static]
iterator typedef (defined in eoMonitor)eoMonitor [protected]
lastCall() (defined in eoMonitor)eoMonitor [inline, virtual]
operator()()=0eoF< eoMonitor & > [pure virtual]
result_type typedefeoF< eoMonitor & >
vec (defined in eoMonitor)eoMonitor [protected]
~eoF()eoF< eoMonitor & > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_monitor.html b/trunk/paradiseo-eo/doc/html/classeo_monitor.html new file mode 100644 index 000000000..914c6c78a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_monitor.html @@ -0,0 +1,99 @@ + + +EO: eoMonitor Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoMonitor Class Reference

The abstract monitor class is a std::vector of parameter pointers. +More... +

+#include <eoMonitor.h> +

+

Inheritance diagram for eoMonitor: +

+ +eoF< eoMonitor & > +eoFunctorBase +eoFileMonitor +eoFileSnapshot +eoStdoutMonitor +eoTimedMonitor +eoGnuplot1DMonitor +eoFDCFileSnapshot< EOT > +eoGnuplot1DSnapshot + +List of all members. + + + + + + + + + + + + + + + +

Public Member Functions

+virtual void lastCall ()
virtual void add (const eoParam &_param)
 Adds a parameter to the monitor.
+virtual std::string className (void) const

Protected Types

+typedef std::vector< const
+eoParam * >::iterator 		iterator

Protected Attributes

+std::vector< const eoParam * > vec
+

Detailed Description

+The abstract monitor class is a std::vector of parameter pointers. +

+Use either push_back a pointer or add a reference to a parameter. Derived classes will then implement the operator()(void) which will stream or pipe the current values of the parameters to wherever you want it streamed or piped to. +

+ +

+Definition at line 46 of file eoMonitor.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + +
virtual void eoMonitor::add ( const eoParam &  _param  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Adds a parameter to the monitor. +

+It is virtual so you can do some type checking in derived classes if you must. +

+Reimplemented in eoFDCFileSnapshot< EOT >, and eoFileSnapshot. +

+Definition at line 56 of file eoMonitor.h. +

+Referenced by eoFileSnapshot::add().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_monitor.png b/trunk/paradiseo-eo/doc/html/classeo_monitor.png new file mode 100644 index 0000000000000000000000000000000000000000..402810a9914f053982afe46b2952e7ab89f9eb02 GIT binary patch literal 2524 zcmbuBXH-*Z8pjcw6{RSmfR40PK}AJ$QCh;#l>u~6!~_zWB-CUSLy1Hz6vqizXiAF= zB`OIK2#FAbnjjd8G`XP|7zG5p1Tus>fRs$w+4XpKJ@aAr!@c+aywCHz=Q;oP_nvcq zI^p4>wr=Y>1qB7QV@Dl56%>>{%Jtl8CHea&=T#H(kIo6VQ%*9OOfF@z=M;+nExG#V z^Zfbqi#*w|JY03b)8nMVcOQB%3JPn_A9J)j6`Lo{Z;mdq*yNOcEOnn+U(mzl`(gCu z0=?kL+X>Gg=clV3jj}ATSTC|!oiB5rA!plUu zpYquj_Zy4E7{y^VdF&_SS}RRU+pP?q)zuB;E6$$_(cSp^!-hhFV~DN>(j^hl_+KT| z{Jc!dfM=3n@Wm9BAt-l~i@WkO=kFk1n7(|Z0IQ53v3RdGf4{!Dx0E@sN)tq=UGG>Y z_v!A=aaT_0?oh6G15iaYt&3{h`~fh1b!y6~-p)TDj|#C6tjRr`v7Mkpral(w$}P?Z z`Z0l|2SY{;CdIy$lW0|yzEEytDGAnn?q?Dzn-0D-ERdIs#=-n_W(fi*F<~N)pQ1=d z*G)&o$|Uc1$g|0R;hKbDuwu-aUKI`Gn#4@5JUD8R>+pYg^x0+8YZfUn`dYisTkrfh zy88z~+5OKcjozRo>2_&se^7>e_-sN|hXhRq7N`-Zw{W=AW1MzNr~BKM&PMv2BNCsh z7DvHc>!;R0Dwx=3H6=HvM-RxsYNRFX07uNO0{x{CC}q=y=px9ZB92%JsZ@q1wrPhf zDNf|@7xbU`Q!fO9aq@=62=%X>{#>Er?$L0wjX5l9!ZJ9z!S zlBSvqQi6nbrT2oN@g1z?1kE zqcE%0!}sj%(kG|zcwJ*#Q>VdsM^neU0sFKtx1*&=56X93k(mP zw@}vKS^on-(z2bHIWf^5KTx}=aNo;i=e?!d6?pxqgv0xCV@-Bk+xLj|Y7G zR8KtK?>Hb7opl|juqQF;4;eo5cI=H6)OaCL8K#Q4hDAh*jtu(4^cn}8_aYK(3P2#~ zI*??6LxCO2jKQ<0hD(~xbM0wiV-GizV2N;kExzt41B{|m{SbZ$dTh8gBYa*9OqUXI zB%4^RgS%5DFKUlc(Iv)=E7_@%z=Z8ugEgXNpi2754wPCxm1!K*yL`(wfOI%T$fF2b zeXU==>$*t3hHQPKq3%RM0Om9SD3OikQ{g`!wv&)jbKZ}mF-r^$l3S2Bu;rs%HoOyLlkn04Nb^nL~ zP!(Arqz4+>&8!`fd=D^ByC2pz6AEHk~nb0|=&> zm7b-An_DtcQr4$QhzC>J0-HJn(K?rh;$XS_>^87`P2&xOCRoWdi3J1H@ykiQr*rrm zGqb0DgR~fyMauChAt8rvqM?!}I8dQ}d+4&>0AnhL-@g$L?>mqZBcRTLB`8B5N)`21 zCmA1q$%uW#asx*va>)+4zWviTg;3lC*agaNNfP|RzRHZ!;8wW3u)?%Wrg(afG2ECA RlmCh-9CPw;EVuW+`Uhd2Bk}+M literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_n_d_plus_replacement-members.html b/trunk/paradiseo-eo/doc/html/classeo_n_d_plus_replacement-members.html new file mode 100644 index 000000000..131753b94 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_n_d_plus_replacement-members.html @@ -0,0 +1,23 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNDPlusReplacement< EOT, WorthT > Member List

This is the complete list of members for eoNDPlusReplacement< EOT, WorthT >, including all inherited members.

+ + + + + + + + + +
eoNDPlusReplacement(eoPerf2Worth< EOT, WorthT > &_perf2worth) (defined in eoNDPlusReplacement< EOT, WorthT >)eoNDPlusReplacement< EOT, WorthT > [inline]
eoNDPlusReplacement(eoPerf2Worth< EOT, WorthT > &_perf2worth) (defined in eoNDPlusReplacement< EOT, WorthT >)eoNDPlusReplacement< EOT, WorthT > [inline]
functor_category()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
operator()(eoPop< EOT > &_parents, eoPop< EOT > &_offspring)eoNDPlusReplacement< EOT, WorthT > [inline, virtual]
operator()(eoPop< EOT > &_parents, eoPop< EOT > &_offspring)eoNDPlusReplacement< EOT, WorthT > [inline, virtual]
perf2worth (defined in eoNDPlusReplacement< EOT, WorthT >)eoNDPlusReplacement< EOT, WorthT > [private]
perf2worth (defined in eoNDPlusReplacement< EOT, WorthT >)eoNDPlusReplacement< EOT, WorthT > [private]
~eoBF()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_n_d_plus_replacement.html b/trunk/paradiseo-eo/doc/html/classeo_n_d_plus_replacement.html new file mode 100644 index 000000000..1e0c8ca9d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_n_d_plus_replacement.html @@ -0,0 +1,63 @@ + + +EO: eoNDPlusReplacement< EOT, WorthT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNDPlusReplacement< EOT, WorthT > Class Template Reference

An elitist non-dominated sorted replacement scheme. +More... +

+

Inheritance diagram for eoNDPlusReplacement< EOT, WorthT >: +

+ +eoReplacement< EOT > +eoReplacement< EOT > +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoNDPlusReplacement (eoPerf2Worth< EOT, WorthT > &_perf2worth)
+void operator() (eoPop< EOT > &_parents, eoPop< EOT > &_offspring)
 The pure virtual function that needs to be implemented by the subclass.
+ eoNDPlusReplacement (eoPerf2Worth< EOT, WorthT > &_perf2worth)
+void operator() (eoPop< EOT > &_parents, eoPop< EOT > &_offspring)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+eoPerf2Worth< EOT, WorthT > & perf2worth
+eoPerf2Worth< EOT, WorthT > & perf2worth
+

Detailed Description

+

template<class EOT, class WorthT = double>
+ class eoNDPlusReplacement< EOT, WorthT >

+ +An elitist non-dominated sorted replacement scheme. +

+Trying out an elitist non-dominated sorted replacement scheme. +

+ +

+Definition at line 45 of file make_algo_pareto.h.

The documentation for this class was generated from the following files: +
Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_n_d_plus_replacement.png b/trunk/paradiseo-eo/doc/html/classeo_n_d_plus_replacement.png new file mode 100644 index 0000000000000000000000000000000000000000..af32229cc0b92c0be2dba9c55f91c7f56b25ebd6 GIT binary patch literal 2665 zcmc&$e>~Is8lOtn;ov&=B{5OF`k^1xDdrodPDzeynf%s5KS*q{9jr4m)kO+ZuAEpA zp(!gr$4De2u~nEcwisIsnKew<{nn}1%f0vXI=${c_mAiMeV*t0{yfj;^E~h8^ZF*a zA{;f<4b&kJh^EuwgKiLrDht#bR;>h|?68Su@U_ zgr~}3&{X-w4RI8*Ps9y^K)zEt9o+AZr%c>>fgQ7kI^1DwJvp4zQs|#6QTiXwZ`YU3 zms~~1yhzd!@z8aihz2z?MP1po)0>-tMN%fk1e1C9b@x&mw_L77MYjr`jYtS}^%Qb4tNOclcTFVJJ3LuFHX0!mW7kOFHT#&dJGa{mCgTnQPngLl#D;BS-g9 z1G?_rg$)}@obwNDL}$o0wQmVry3A}scer%@CQ0Yf(1L61bELSx|LxR}XFUk&Pc4jkKKw5s;x;MM%GuAwRx z!0GW5bX7Z-J8!m!KJ3dlapo~5e1UI(w$x4$I}DZZig|XJ9oEst^uz-Gxztw9SW;~n z5`~(y16tHg(z8J|OTBns2T#9S`W-1^pOKl(!hv>dPBo!|ExNq){k^cRuDKZ* zi1ii37H})FyPwT{@VuhI43`V1y6xK zJB6JInZ8N#HM63f7u+QEJ7$WmF)WP`m9?FddvoqbTgL0V;hWH6AVY6I2Gc zFF0|Jg*VPyaO@>8oQ4Z2s5y>TM-6kwC>sQcw3nsvPs)%ri{;6Q1BQ!N#-lyoqu#n% zZIxaC1o3k6kM&QVy)bQa+z8((X7jelyudGkfI!9gH`%&DY?4FEX`E2YpxO<~_Y!zc1Lv4H>oBVe`|d zdX(?{EZr;9RehOn#+Tux=bE}q5|-&7{r_*9IU6fI8$EKb`*ECC?Fa4Y0`oU%0Rslf z+Zq^_YrWzkLwC|35>CJ|6;4TG^@<06mm*ZX>8pk6k1(1{-9H2R4_nA>I`yPvU*6S# zfvhK8%I?ED1S_M)KaMTSmojVSd^!w@G(D=RGz_=0_mumbAw4ERs>Uf%^y0aKAZkS6 z#yyr3o-a-X^xl&s8j!)bs=`qZd&{LW$=Mz-k3BsYb?;xi_7o=>N4Os)=6zgx6H2x@ zRxl8*TOD%pZ&}4O;xNrlEvn_Io}&l#H1_?#3QrP|p(Cf;<>XvR=vl?X~{5+4Zce7Jb!(CJy@TDN5I3_0wD&S^{^ z7XxPv)`pff)q74qu!HAw?mI^+qmRi)7)6w{`crG>4fZf#yrZ5Qq5{`(b zQKyM9cyw`%)GIabckWt1qeG%XPDjI@FTMFonr@=%(7B-V`xT!`53bH-c+7LdZtcxX zDN6K6k7tu}M?RC|_)Q-g+4Kx7yMosf6;z`Ye1j^z#M%ySN=C~VdOLWsz}i}7Klbx3 zkVsW<*+YhClfT+w`()eP+Uta=-Aa(ky<;$3$2*kOsZSJGHi%1khrc$X{J{Mx9D6nX zF2^qj*+jRlA(-~#G{Z!a4}PepDxZfEXKm{Cl`=2O_8<2{4Dk{~PF^>>p>b1*_#4 zM`_YoFFv=b75Fxjlu*ty)vL7P>IX-vIHck5TK^v8f*i1KAxYg@dTV06`DOag*jKe0G6ZY0ovdp5 zwJ^LbTCay+v|+L$O*Yw#b-H9Ra4oRAFP_qbv%MxWY(JOH5ocnMi}-pJ$#%Y~^vJ6e ziOh+$68+jj+@gNQ<>hn0wk3;_xLv$uMy41o#Q@s3*-nTH^%U76U>?EB4aGS#E${g@!*j- + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNDSorting< EOT > Member List

This is the complete list of members for eoNDSorting< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
calculate_worths(const eoPop< EOT > &_pop)eoNDSorting< EOT > [inline, virtual]
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
eoNDSorting(bool nasty_flag_=false) (defined in eoNDSorting< EOT >)eoNDSorting< EOT > [inline]
eoNDSorting() (defined in eoNDSorting< EOT >)eoNDSorting< EOT > [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoPerf2Worth(std::string _description="Worths")eoPerf2Worth< EOT, double > [inline]
eoPerf2WorthCached(std::string _description="Worths") (defined in eoPerf2WorthCached< EOT, double >)eoPerf2WorthCached< EOT, double > [inline]
eoValueParam(void)eoValueParam< std::vector< double > > [inline]
eoValueParam(std::vector< double >_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< std::vector< double > > [inline]
functor_category()eoUF< const eoPop< EOT > &, void > [inline, static]
getValue(void) const eoValueParam< std::vector< double > > [inline, virtual]
longName() const eoParam [inline]
m_objectives(const eoPop< EOT > &_pop) (defined in eoNDSorting< EOT >)eoNDSorting< EOT > [inline, private]
nasty_declone_flag_that_only_is_implemented_for_two_objectives (defined in eoNDSorting< EOT >)eoNDSorting< EOT >
niche_penalty(const std::vector< unsigned > &current_front, const eoPop< EOT > &_pop)=0eoNDSorting< EOT > [pure virtual]
one_objective(const eoPop< EOT > &_pop) (defined in eoNDSorting< EOT >)eoNDSorting< EOT > [inline, private]
operator()(const eoPop< EOT > &_pop)eoPerf2WorthCached< EOT, double > [inline, virtual]
operator()(eoPop< EOT > &_pop) (defined in eoPerf2Worth< EOT, double >)eoPerf2Worth< EOT, double > [inline, virtual]
rank_to_worth() (defined in eoNDSorting< EOT >)eoNDSorting< EOT > [inline, private]
repValue (defined in eoValueParam< std::vector< double > >)eoValueParam< std::vector< double > > [protected]
required() const eoParam [inline]
resize(eoPop< EOT > &_pop, unsigned sz) (defined in eoPerf2WorthCached< EOT, double >)eoPerf2WorthCached< EOT, double > [inline, virtual]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< std::vector< double > > [inline, virtual]
shortName() const eoParam [inline]
sort_pop(eoPop< EOT > &_pop)eoPerf2WorthCached< EOT, double > [inline, virtual]
two_objectives(const eoPop< EOT > &_pop)eoNDSorting< EOT > [inline, private]
value()eoValueParam< std::vector< double > > [inline]
value() const eoValueParam< std::vector< double > > [inline]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_n_d_sorting.html b/trunk/paradiseo-eo/doc/html/classeo_n_d_sorting.html new file mode 100644 index 000000000..bba7df72c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_n_d_sorting.html @@ -0,0 +1,162 @@ + + +EO: eoNDSorting< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNDSorting< EOT > Class Template Reference

Non dominated sorting, it *is a* std::vector of doubles, the integer part is the rank (to which front it belongs), the fractional part the niching penalty or distance penalty or whatever penalty you want to squeeze into the bits. +More... +

+#include <eoNDSorting.h> +

+

Inheritance diagram for eoNDSorting< EOT >: +

+ +eoPerf2WorthCached< EOT, double > +eoPerf2Worth< EOT, double > +eoUF< const eoPop< EOT > &, void > +eoValueParam< std::vector< double > > +eoFunctorBase +eoParam +eoNDSorting_I< EOT > +eoNDSorting_II< EOT > + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoNDSorting (bool nasty_flag_=false)
virtual std::vector< double > niche_penalty (const std::vector< unsigned > &current_front, const eoPop< EOT > &_pop)=0
 Pure virtual function that calculates the 'distance' for each element in the current front Implement to create your own nondominated sorting algorithm.
+void calculate_worths (const eoPop< EOT > &_pop)
 The actual virtual function the derived classes should implement.

Public Attributes

+bool nasty_declone_flag_that_only_is_implemented_for_two_objectives

Private Member Functions

+void one_objective (const eoPop< EOT > &_pop)
void two_objectives (const eoPop< EOT > &_pop)
 Optimization for two objectives.
+void m_objectives (const eoPop< EOT > &_pop)
+void rank_to_worth ()
+

Detailed Description

+

template<class EOT>
+ class eoNDSorting< EOT >

+ +Non dominated sorting, it *is a* std::vector of doubles, the integer part is the rank (to which front it belongs), the fractional part the niching penalty or distance penalty or whatever penalty you want to squeeze into the bits. +

+ +

+Definition at line 42 of file eoNDSorting.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
virtual std::vector<double> eoNDSorting< EOT >::niche_penalty ( const std::vector< unsigned > &  current_front,
const eoPop< EOT > &  _pop
)  [pure virtual]
+
+ + + + + +
+   + + +

+Pure virtual function that calculates the 'distance' for each element in the current front Implement to create your own nondominated sorting algorithm. +

+The size of the returned std::vector should be equal to the size of the current_front. +

+Implemented in eoNDSorting_I< EOT >, and eoNDSorting_II< EOT >. +

+Referenced by eoNDSorting< EOT >::two_objectives().

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
void eoNDSorting< EOT >::two_objectives ( const eoPop< EOT > &  _pop  )  [inline, private]
+
+ + + + + +
+   + + +

+Optimization for two objectives. +

+Makes the algorithm run in complexity O(n log n) where n is the population size

+This is the same complexity as for a single objective or truncation selection or sorting.

+It will perform a sort on the two objectives seperately, and from the information on the ranks of the individuals on these two objectives, the non-dominated sorting rank is determined. There are then three nlogn operations in place: one sort per objective, plus a binary search procedure to combine the information about the ranks.

+After that it is a simple exercise to calculate the distance penalty +

+Definition at line 140 of file eoNDSorting.h. +

+References eoNDSorting< EOT >::niche_penalty(), and eoValueParam< std::vector< double > >::value(). +

+Referenced by eoNDSorting< EOT >::calculate_worths().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_n_d_sorting.png b/trunk/paradiseo-eo/doc/html/classeo_n_d_sorting.png new file mode 100644 index 0000000000000000000000000000000000000000..39015928a15e9735eec98c411e2b8e460409389d GIT binary patch literal 3469 zcmb_f2{e>zA0JCiaieZUSyG>+?WT#!PQ=YRGuE*UCR>(9SMw4=WxL%JH(blakZqU@ zi7?1kim6e|n8MhXykfGB8Ok?u>YTo{bH4AK|9hVQ{yxwD`Td{geQzS+=eCJRi9jHb zZ6?NsRuG5~4gwK?2@9=j-YfU=hdoGh8>6+gH9otx)<__@CGxp1Ph(?aSo7K_UlhPu z!L1=@#@~AJ!{kj2^=+=)o6dX{m`joPwU=S5bLZr&{XNO|ltNIqW1r`YrOR5j-gX1^ z^FsZ1=Sy%0Pq?kP9~UmC{u%M9cTdAF#V4E(O}3A&@&;b-TB|<7YRDKKGB|}Q8W+?@ z%OX)ibOr>dJcHgAP>B5yqFD8^!bVPX!93G6qCqcfw-(p7$UoDHGu!*g?44^tK6Ro( z9Cl2@g4Hzqi~4aQoW9fx6WjzO%ueY(mh3gyC+_MA5K?vN%e7L>XM%dGt=Q>QKREff z5CHQmZ)V4I3H_b-B~EA`!bUCSrR2HZ^Ltfge4>5GZ(KRf`slrxGAN z_3~mh6iC2LE?->0Fu6%A*6|=ec0yUDlX}TV?>=+%B{}iylPM!*?Y&ikX56M!KAzo=gS%Fh}wwGbaSIs_n`(A6uZnR=LF zRYuJ4PdSFXF|ZZlLvkvfpAZgnOE*$0&_otskE|9@Ub}RzTmejmC|gg==mvYK0N$09 z3XiBP^5Lsuu2bgAw%#DTy1VE;#b@#X_P3H+NixtSTj+=GY`OY0E{m3ia+!)|DC(H! zq7`~w=XA`2HPuEIITys|&0=B$6PU`Ja7SMLdBn$~$=VCBPg}cm3_f5Yj)kSo0xTS= z;TcZ9zC2E&dbs*$6JqV%+f1OtB?46*`tp=h$6OG*z_~eAv)6ns*ocOzs@zIvAnk$; za!Hm|o9K*dRRq856sc_TW+G`5=zDFQ{VTF(<@XFD@NAe=m_QHd zcM1d=Yo6J9R}6V0Psn4Hn+!)na(pi+CvM8|U0zj~+~T*rICfmnVSBO2hEMYTNr;Am zY_{+}MUN)puKm1Wd2wJ8qPUSa@ocAn>4s&0T%OQ+__{@GBYfQ=^RE-@Iz{J^toXBX zel9l&k>sZ#3xSkPKSVCHfXRm4FPFpSKAW%+w41d{PCNuom1f86lT#o->GivaBq->z znQkit93R^a#>>v)+@se#hI~amq5JKy`-eRghW(M}b^OKBcv66paGI5NI@L|~bO$+U zY#?5Vrvmh9sjm5UPsOkN>2JHo?a2uMF|P97I8!?DG)hvU=iQFJ#>#gxkf3LE(waSZ zj_vcxo&mqhPq`!pS9aE2iKH&_dC7S*HX!_MnWu`DVV{Eb4ZOC2o?I)(3g{xfw#+n@ z;N>Jpo{dBt-JHt=o6}XYU?cVMk@RM`%LAH%e9H5OrE23Uu=&Ad--lx-`56q4Q{4;D zPV7M{{qXK$td&C%#iK`<(B(4RX*a>vMV#5mNS`CuTd@+iICOXpKH}=XcPCL>ixTiJ zP3O^0(}R^@vZ+(1lnT(w9`NmnP7DN^Z6ZV?sc8pT4L54}6R*DvO(Ik_%H@!1elk$W z_1>%0r&Ww!x>BT!>u8@*#sV$F(dku`Hk9tgW?UNCiACS~f^Jel!C0vgV1+wPRQ5;U zs*sYwGd`rS^YD+3Y7a_*u3h@`mCBPCo;>oPWbJ7(@R^WQaVoWG*fG_E;2mf0G8MmE zsl3#bY^v4tuy^uKtC9F+`z6@O6vb2AI)?iDr*1>>uHF4KN7$k`_43~8dfSNWS?$}s z;(o_3XBA4YG3CVc${{>TTc8ea^@>WjrL_qFj5;!d!5;>vCsGB0#WO7GHHvTcO#T_P z4*LO|*L894GHig_bnZeeA8z@tPQ=1>jTicVvy=Y9HcQOPY9x{APc#~Z;)%ECQyj8u_k2Dpi=-M`JY@GJI?YD zJ1^%=z1b143Tj^pi8&9k(hQFaoiFk)Re)Y8*Qpk|YAL}po(G|XusM_n1g_z1BrC6uQ8#V zJpH$@F4j@o=lE~h{bGW$g(u3Si7nRq_>jbdPw;(>OxDZXa)Qd30G;v34y9J3uZ}4u z(gvnJCPR@ZL=nT*0t+L+y5!D%d0UqAR2Bm37Mp)()o~+pNN3BcSD+B5#{yBx?cApn z*)BvRP4I%PgDgTIz@jr5JFuQfyuamx1aay+niOY`88b(qUtyZ&R<^pn;3hXNOAz?< zRsFvJ{09pD&E?}f^7a9A!ky(rv9eJm*=+f2veP#TB1yA9{`N?x3I7M@(+iOq%|Axg zdOz=z=U2@sbFNsowbXuM^~8s1d}UfUx#{v4Os3XI55{5lpD-MlgDYL68GsFMeh>@=7C-m^4HBSkH)uejGIAK`=FdCF-+O}?Wkx=ek{5T=k9Fz; z8&gm^XG#Fo>n_1~Co5;|fT-wpDB+ZqRt)9{WaRJIJZ*15(G-2Se z#1Qpq%2^y(dSr68zSLBU!QHY%m;Lb*C_5MzoH18kJz}iK=)|tN=u#55=a3rI`UF{+DKI?UJLn zoZb>F6%=7=!i%3Up6&DEQD}>>i%hE(xfUM4G7C++#RS?-=>3@PmeB&xiN#4{s}&87 z^1FVYx^!KYW?0j^6`ILSYlhECxwR~l(+|e(JmR5Yo2e0TNTc7GWx~HAeKQ_dCFNw~ vwjDXOw^-vlfyV3WbGXODJb6U4=Ez-H0!41g + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNDSorting< EOT >::DummyEO Member List

This is the complete list of members for eoNDSorting< EOT >::DummyEO, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
className() const EO< EOT::Fitness > [inline, virtual]
EO()EO< EOT::Fitness > [inline]
EO() (defined in EO< EOT::Fitness >)EO< EOT::Fitness > [inline]
Fitness typedef (defined in EO< EOT::Fitness >)EO< EOT::Fitness >
fitness() const EO< EOT::Fitness > [inline]
fitness(const Fitness &_fitness)EO< EOT::Fitness > [inline]
fitness(performance_type perf) (defined in EO< EOT::Fitness >)EO< EOT::Fitness > [inline]
fitness(void) const (defined in EO< EOT::Fitness >)EO< EOT::Fitness > [inline]
fitness_traits typedef (defined in EO< EOT::Fitness >)EO< EOT::Fitness >
index (defined in eoNDSorting< EOT >::DummyEO)eoNDSorting< EOT >::DummyEO
invalid() const EO< EOT::Fitness > [inline]
invalidate() (defined in EO< EOT::Fitness >)EO< EOT::Fitness > [inline]
invalidate(void) (defined in EO< EOT::Fitness >)EO< EOT::Fitness > [inline]
invalidate_worth(void) (defined in EO< EOT::Fitness >)EO< EOT::Fitness > [inline]
operator<(const EO &_eo2) const EO< EOT::Fitness > [inline]
operator<(const EO< Fitness, Traits > &other) const (defined in EO< EOT::Fitness >)EO< EOT::Fitness > [inline]
operator>(const EO &_eo2) const (defined in EO< EOT::Fitness >)EO< EOT::Fitness > [inline]
operator>(const EO< Fitness, Traits > &other) const (defined in EO< EOT::Fitness >)EO< EOT::Fitness > [inline]
performance(performance_type perf) (defined in EO< EOT::Fitness >)EO< EOT::Fitness > [inline]
performance(void) const (defined in EO< EOT::Fitness >)EO< EOT::Fitness > [inline]
performance_type typedef (defined in EO< EOT::Fitness >)EO< EOT::Fitness >
printOn(std::ostream &_os) const EO< EOT::Fitness > [inline, virtual]
readFrom(std::istream &_is)EO< EOT::Fitness > [inline, virtual]
storage_type typedef (defined in EO< EOT::Fitness >)EO< EOT::Fitness >
worth(worth_type worth) (defined in EO< EOT::Fitness >)EO< EOT::Fitness > [inline]
worth(void) const (defined in EO< EOT::Fitness >)EO< EOT::Fitness > [inline]
worth_type typedef (defined in EO< EOT::Fitness >)EO< EOT::Fitness >
~EO()EO< EOT::Fitness > [inline, virtual]
~eoObject()eoObject [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]

Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_n_d_sorting_1_1_dummy_e_o.html b/trunk/paradiseo-eo/doc/html/classeo_n_d_sorting_1_1_dummy_e_o.html new file mode 100644 index 000000000..1b23a29bb --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_n_d_sorting_1_1_dummy_e_o.html @@ -0,0 +1,41 @@ + + +EO: eoNDSorting< EOT >::DummyEO Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNDSorting< EOT >::DummyEO Class Reference

used in fast nondominated sorting DummyEO is just a storage place for fitnesses and to store the original index +More... +

+

Inheritance diagram for eoNDSorting< EOT >::DummyEO: +

+ +EO< EOT::Fitness > +eoObject +eoPersistent +eoPrintable + +List of all members. + + + + +

Public Attributes

+unsigned index
+

Detailed Description

+

template<class EOT>
+ class eoNDSorting< EOT >::DummyEO

+ +used in fast nondominated sorting DummyEO is just a storage place for fitnesses and to store the original index +

+ +

+Definition at line 94 of file eoNDSorting.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_n_d_sorting_1_1_dummy_e_o.png b/trunk/paradiseo-eo/doc/html/classeo_n_d_sorting_1_1_dummy_e_o.png new file mode 100644 index 0000000000000000000000000000000000000000..ac59bfa61c8371a01cb41f4db02c070a611f0aed GIT binary patch literal 1169 zcmeAS@N?(olHy`uVBq!ia0y~yV4MbIA7Ehyl2^+jegi3q0G|-o|Ns93ng9PEm_I*Z z0+0p92M!#lKJ@R)#%nYfvg%khHSs$ix`2EM6zf9Z_2a3|glpaqj z(-D8ROs7ro-Pxp*sz+JGvfpN$$lYm_T`Rfvu}4y2Xqm{FN7qi||1$c2_*u%`&ZFPO z(~K5Ywtn5c(SjpQ!nnIPb=r$CowOv42%l4@ccpB!dH!_WU)A2^nMb$kR-Z0>6WqwE zlfcLwv2Wti<>_8mf9>4G#J);>+VT6VvkT@}CH<_lS-0*`;;YW3tM~DX&1CBKX>?t7 zKq)w3qUMGZA`vNEI!3HW!qyQ{wZ|?i`K>;GFX{-RcP!6_E60CEiMXqT?Ur6&9g$0d`z#h|o;l^d zA?0Dj395a`HT5SS->5icacuR<-j5c~&YoIb`0Y;rc8g1=C6wO(4z%5v^GeN?=cLY7 z!vjI`>^h|&YWdO4^QN6&x9ZBP%A{@!+l^a3-P+c1S%?V-c;+-tmO5HOEw(YvnRcC_u4mmj?B9Jqe^DB z?>n8n`}geHf9BV|&SFJw`Qv<|5eJw+E|HF`s#+GJd+_|PRab?*-9NK`KXU2vpMy{z z;z|y%RN`g8J$HSY&aW>VufA|hJ`kk5;Z5Ltom2Zew#eTOx+oL+^X{qIU<x^$4;de>9Ai3T+%2{4^l5|SK>diMI5D04Pm9*2 z%$#Mhv@qvf(6{MHGRada_-r@ESoWQLr!SJVLQ<CG(DY?-`!Z*AnLUG|0lq+Ht3mxtP< QfaM2+r>mdKI;Vst043Hj3;+NC literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_n_d_sorting___i-members.html b/trunk/paradiseo-eo/doc/html/classeo_n_d_sorting___i-members.html new file mode 100644 index 000000000..f8bd779b0 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_n_d_sorting___i-members.html @@ -0,0 +1,47 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNDSorting_I< EOT > Member List

This is the complete list of members for eoNDSorting_I< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
calculate_worths(const eoPop< EOT > &_pop)eoNDSorting< EOT > [inline, virtual]
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
eoNDSorting(bool nasty_flag_=false) (defined in eoNDSorting< EOT >)eoNDSorting< EOT > [inline]
eoNDSorting() (defined in eoNDSorting< EOT >)eoNDSorting< EOT > [inline]
eoNDSorting_I(double _nicheSize, bool nasty_flag_=false) (defined in eoNDSorting_I< EOT >)eoNDSorting_I< EOT > [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoPerf2Worth(std::string _description="Worths")eoPerf2Worth< EOT, double > [inline]
eoPerf2WorthCached(std::string _description="Worths") (defined in eoPerf2WorthCached< EOT, double >)eoPerf2WorthCached< EOT, double > [inline]
eoValueParam(void)eoValueParam< std::vector< double > > [inline]
eoValueParam(std::vector< double >_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< std::vector< double > > [inline]
functor_category()eoUF< const eoPop< EOT > &, void > [inline, static]
getValue(void) const eoValueParam< std::vector< double > > [inline, virtual]
longName() const eoParam [inline]
nasty_declone_flag_that_only_is_implemented_for_two_objectives (defined in eoNDSorting< EOT >)eoNDSorting< EOT >
niche_penalty(const std::vector< unsigned > &current_front, const eoPop< EOT > &_pop)eoNDSorting_I< EOT > [inline, virtual]
nicheSize (defined in eoNDSorting_I< EOT >)eoNDSorting_I< EOT > [private]
operator()(const eoPop< EOT > &_pop)eoPerf2WorthCached< EOT, double > [inline, virtual]
operator()(eoPop< EOT > &_pop) (defined in eoPerf2Worth< EOT, double >)eoPerf2Worth< EOT, double > [inline, virtual]
repValue (defined in eoValueParam< std::vector< double > >)eoValueParam< std::vector< double > > [protected]
required() const eoParam [inline]
resize(eoPop< EOT > &_pop, unsigned sz) (defined in eoPerf2WorthCached< EOT, double >)eoPerf2WorthCached< EOT, double > [inline, virtual]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< std::vector< double > > [inline, virtual]
shortName() const eoParam [inline]
sort_pop(eoPop< EOT > &_pop)eoPerf2WorthCached< EOT, double > [inline, virtual]
value()eoValueParam< std::vector< double > > [inline]
value() const eoValueParam< std::vector< double > > [inline]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_n_d_sorting___i.html b/trunk/paradiseo-eo/doc/html/classeo_n_d_sorting___i.html new file mode 100644 index 000000000..55df5b6c2 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_n_d_sorting___i.html @@ -0,0 +1,101 @@ + + +EO: eoNDSorting_I< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNDSorting_I< EOT > Class Template Reference

The original Non Dominated Sorting algorithm from Srinivas and Deb. +More... +

+#include <eoNDSorting.h> +

+

Inheritance diagram for eoNDSorting_I< EOT >: +

+ +eoNDSorting< EOT > +eoPerf2WorthCached< EOT, double > +eoPerf2Worth< EOT, double > +eoUF< const eoPop< EOT > &, void > +eoValueParam< std::vector< double > > +eoFunctorBase +eoParam + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoNDSorting_I (double _nicheSize, bool nasty_flag_=false)
std::vector< double > niche_penalty (const std::vector< unsigned > &current_front, const eoPop< EOT > &_pop)
 Pure virtual function that calculates the 'distance' for each element in the current front Implement to create your own nondominated sorting algorithm.

Private Attributes

+double nicheSize
+

Detailed Description

+

template<class EOT>
+ class eoNDSorting_I< EOT >

+ +The original Non Dominated Sorting algorithm from Srinivas and Deb. +

+ +

+Definition at line 380 of file eoNDSorting.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
std::vector<double> eoNDSorting_I< EOT >::niche_penalty ( const std::vector< unsigned > &  current_front,
const eoPop< EOT > &  _pop
)  [inline, virtual]
+
+ + + + + +
+   + + +

+Pure virtual function that calculates the 'distance' for each element in the current front Implement to create your own nondominated sorting algorithm. +

+The size of the returned std::vector should be equal to the size of the current_front. +

+Implements eoNDSorting< EOT >. +

+Definition at line 385 of file eoNDSorting.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_n_d_sorting___i.png b/trunk/paradiseo-eo/doc/html/classeo_n_d_sorting___i.png new file mode 100644 index 0000000000000000000000000000000000000000..29267c2db812398300170877ce47256f976f2a1f GIT binary patch literal 3211 zcmcIn2~bn#77hgj1q0dwS~k%N6*Q!>Nn{tLDocQn2sA8%Koy9jZ~;L?5%ehtKCvt> zY>LH@NW#7(C2SUD3s4fn;spd0xIjR{BF2yx9DT2y&YOAdn>X{_`Oo?8|Ihj7obQ}F z_a@reVf(f(x4~er?I*vrcZ0#CBVjNpq>S_?GmRLQEW6N-nB!uxSYnFBO$7yhcO=$_ zr>Utau0=d4ait>NoZVqIuLpu)Fh!k{_O_Uq-1)rjyG2J-ll%L2RM!l|Y!`j@xshQc zu6nJ5Zhay_Ugullb}Q`bbwRCj$R{*+H=Rs+G(GX_<@)oMBq*o?``nY#iECh%E(k;_`CFe- z&Ss|AQ6>7a?T?H;Uatdy zU&u^tPj#BQJZIuko`VvU(fDR`em)|8#3DX5y*>l%K2(!F!oM8GL|Top>vB*FRu;13 zSTp7mjUt5UAjh%ix)FW38OPZzG~T9)FJ>383r^qQaY3!xF$34BNErZIYTe+JUJRw) zJQ}e#wf?6D_5~Jt$~pV>w*ZT{Wz-%V=2}WWY#`9sd7roGVXf8MFmfH7U#|OlObJgj zZo3CNp5a;hb?9|5hdJU%W;f?H-v^gv?785ayX65b!ty*mFWzhBhgZ<0bY>XYdzs;| zxblp%?vqtgNpiWC;|RJoAi^r{r|`b8H1wT~O{neUXoi;>9S4Xr4+&AFOcfeHY>g>B zeIk3UY&NFNLf|Eb%}PZI*(bhydYX`Q&Sgp@cqfG91^$;D>XSpV8g8G~)=ibsX0?mt z`}2_VS}pQ|Z?yfd^8liI?TMcY^UYf{LMH}v?Z`(ne&hk(hK&ZEa}n)B7uJaj#knoF z80DnNg8RED#FXJ@7CL68nt))tnPTI+c@D&9&*JJiq+mzJU|XCQzQj1+5}mwoK8YShI0 zLFmQRI`a&tY}tf{%&V4OYR~C8m>crcx0VCrJHSp5L)mG30d)ZX=u zP{J-a(7M$ql*?>Tg)f~2;t#uD%ofJ}lxb`2ly)H~qzzK`|B)c+G>fWNQY@#uZ&+L* z21`L4AdUTymQ`29tM7jFnXxV2*QzR-qP|n7(`yTYL`t$+W`yRyE9-b@Y+dz>R6doR zUB%1Mapy57yze-MSj zhsTtvXYv?l_I}TJzJH(Nn&RBu6fpR^*%#Ud=Snl1=e)Ac7Eq3L(E-c%UTSTAZ4a-F zA?K=k+6Lt#veS{Rvy655{V<0o_YE5sI2^Pn|Lo_F#DW2^$+P0@T-gb2`(mKtsu`_k!*-{v+0<5ozJ3 ziG;C&YlYIvhZ5m7Rq`lU-`;7MeafF9niix*+$S25amG)SHWC+IZb1J?{)C@SfSAZ8 zw#7^k4fv|ENljmWF1tD(igGU^=%bL`TUi(!nQQ|DSCkNZEc~Zmgw{Cc`Ifo5`s13V zD8t>w47)xlUxOkA1+0O7sH#RGLz?V5m7?b;2(iv7=J-&_WuD8Hj=CynIFiS0ZzV2LdG?C*USN<6m^!F18|hge7^s<+&1Wzii)WM91TiwZX<7; z;h(o4qVQ2ybA0r=^z{dvR=<#h0&|xMr$B1mehjY19O7iGxZ^D^DOGxsX}?3S_DH8~ z?NdYhUa7yS+RE)Yb$M}e#afdRqUt=vJ&55U{&HgfVl6zLZPr4j@y-iL^nZg2u?`WG zsk!E5EUimnB;=vmSrU%6tw{!)9JSo(J z1ZCZ;@Ib{jm9EbHN)jb{0HZ2q;qxOdl@;1$r0WS-)%AnRv47=E&W@K zL{r?ma*`yrRTG$!XkEZ04~1`+rci?elGdGw(!!zA6#DwFJBnG8Qe1At2J-;(lolFq z`G`9FA^yv_>`kfv7Ks~+K5&NRWu1@7b!};1B5kTJ*t&=@0ezPEm+9k!!vu$7?+au7t=wpxLlnJ*2;j6jECA54I6iX*eXS55+o=s=SBJ*jH3%|a0`J8O#?>VACe5Aa4#t_6@k+6AgOYl*))suo?5CEN6}@bb z2<*L`jOLZ^cSOP-Bz?%aiGp6|1yxFjnxqB1KD|2ru_yjt#Mqj@mEz{$QPK2c%W4+t z{I)k&OPHw%sr705`s=<1lN%Fu^Xe_cUow|yzBc-UCH(Uq_%>a5<|!t#PM8HEB%1aD zYSiNK2wE22(0{Np1aDZ>H)}Eo{vvL0121AI5gjyFFpJoUaJh*~n1~K$sX_>DJPCpZ zOV}H4t|K-YsR_OFY#-^TA^4$L%4Q|1q5RgJRQ^tmd4K{ySgttY|C~|8h>bEnN8wi# zv)35(dekc8^MSaQ_lJo|=D6Cr&99BmEZc8NK4O)@K64W{6>im{NS{5@Vv#;E;$(i- zMbb#FP=0WK!$R)8LP@#YqRn3?+;x-8CSm;_2Ghm0H)3s{vleC1&Mc(l&jEJwxU)UY H&M)zwG4>|V literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_n_d_sorting___i_i-members.html b/trunk/paradiseo-eo/doc/html/classeo_n_d_sorting___i_i-members.html new file mode 100644 index 000000000..d4e1eab15 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_n_d_sorting___i_i-members.html @@ -0,0 +1,47 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNDSorting_II< EOT > Member List

This is the complete list of members for eoNDSorting_II< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
calculate_worths(const eoPop< EOT > &_pop)eoNDSorting< EOT > [inline, virtual]
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
double_index_pair typedef (defined in eoNDSorting_II< EOT >)eoNDSorting_II< EOT >
eoNDSorting(bool nasty_flag_=false) (defined in eoNDSorting< EOT >)eoNDSorting< EOT > [inline]
eoNDSorting() (defined in eoNDSorting< EOT >)eoNDSorting< EOT > [inline]
eoNDSorting_II(bool nasty_flag_=false) (defined in eoNDSorting_II< EOT >)eoNDSorting_II< EOT > [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoPerf2Worth(std::string _description="Worths")eoPerf2Worth< EOT, double > [inline]
eoPerf2WorthCached(std::string _description="Worths") (defined in eoPerf2WorthCached< EOT, double >)eoPerf2WorthCached< EOT, double > [inline]
eoValueParam(void)eoValueParam< std::vector< double > > [inline]
eoValueParam(std::vector< double >_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< std::vector< double > > [inline]
functor_category()eoUF< const eoPop< EOT > &, void > [inline, static]
getValue(void) const eoValueParam< std::vector< double > > [inline, virtual]
longName() const eoParam [inline]
nasty_declone_flag_that_only_is_implemented_for_two_objectives (defined in eoNDSorting< EOT >)eoNDSorting< EOT >
niche_penalty(const std::vector< unsigned > &_cf, const eoPop< EOT > &_pop)eoNDSorting_II< EOT > [inline, virtual]
operator()(const eoPop< EOT > &_pop)eoPerf2WorthCached< EOT, double > [inline, virtual]
operator()(eoPop< EOT > &_pop) (defined in eoPerf2Worth< EOT, double >)eoPerf2Worth< EOT, double > [inline, virtual]
repValue (defined in eoValueParam< std::vector< double > >)eoValueParam< std::vector< double > > [protected]
required() const eoParam [inline]
resize(eoPop< EOT > &_pop, unsigned sz) (defined in eoPerf2WorthCached< EOT, double >)eoPerf2WorthCached< EOT, double > [inline, virtual]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< std::vector< double > > [inline, virtual]
shortName() const eoParam [inline]
sort_pop(eoPop< EOT > &_pop)eoPerf2WorthCached< EOT, double > [inline, virtual]
value()eoValueParam< std::vector< double > > [inline]
value() const eoValueParam< std::vector< double > > [inline]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_n_d_sorting___i_i.html b/trunk/paradiseo-eo/doc/html/classeo_n_d_sorting___i_i.html new file mode 100644 index 000000000..7fe3f3816 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_n_d_sorting___i_i.html @@ -0,0 +1,59 @@ + + +EO: eoNDSorting_II< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNDSorting_II< EOT > Class Template Reference

Fast Elitist Non-Dominant Sorting Genetic Algorithm. +More... +

+#include <eoNDSorting.h> +

+

Inheritance diagram for eoNDSorting_II< EOT >: +

+ +eoNDSorting< EOT > +eoPerf2WorthCached< EOT, double > +eoPerf2Worth< EOT, double > +eoUF< const eoPop< EOT > &, void > +eoValueParam< std::vector< double > > +eoFunctorBase +eoParam + +List of all members. + + + + + + + + + + +

Public Types

+typedef std::pair< double,
+ unsigned > 		double_index_pair

Public Member Functions

+ eoNDSorting_II (bool nasty_flag_=false)
+std::vector< double > niche_penalty (const std::vector< unsigned > &_cf, const eoPop< EOT > &_pop)
 _cf points into the elements that consist of the current front
+

Detailed Description

+

template<class EOT>
+ class eoNDSorting_II< EOT >

+ +Fast Elitist Non-Dominant Sorting Genetic Algorithm. +

+Adapted from Deb, Agrawal, Pratab and Meyarivan: A Fast Elitist Non-Dominant Sorting Genetic Algorithm for MultiObjective Optimization: NSGA-II KanGAL Report No. 200001

+Note that this class does not do the sorting per se, but the sorting of it worth_std::vector will give the right order

+The crowding distance is calculated as the sum of the distances to the nearest neighbours. As we need to return the penalty value, we have to invert that and invert it again in the base class, but such is life, sigh +

+ +

+Definition at line 434 of file eoNDSorting.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_n_d_sorting___i_i.png b/trunk/paradiseo-eo/doc/html/classeo_n_d_sorting___i_i.png new file mode 100644 index 0000000000000000000000000000000000000000..fd66b23c2e5f071f66673ce6f7e1faeea6e84ee3 GIT binary patch literal 3221 zcmcIneK?bQAD>4>LN7vMbkfO_owTUQDiq5hluVwmu~YM!m&`pqjff!%op4OEkaHL^ z4$WpuL^yd_#BB{L64k~eF>l$KIxo-pA9Zk`rOz3yFb70{rlec@ALV7@9R!J z>1?N_vQ-5FfvDMkYkLX;QH+2<6yU2ASC}^@1M<_Bla6SVOeT{LWwM66Jf9o#(Wj%K zp@GyWdnLbAh&bi!3b7u0<_m$S!t8C2pfBc5(Asa7AvU8X96+e2Gf}PG z^2b>HZRGssy%#-&Bw;4Ev#GAT%9?nd)*fTff^Uf0g4oQ#pE8jV4VqunWJ#W+zr@)@ zdmWGV+ExmS7dhl}HqjZIOJT#UC1N{lcOB8I|Gt+0aa!`_daIhP2NyufIoe+7^4Rje zradE1=U?dQ`*?*@ING{?Eilp8uKo)F+`)UfPJr1N*uXd7PgKjn=jrn!_}gn+%Sb<8 z@TK=MqeI1cmZ_aj?**HEv$wO79grA7ROF^^zu_)@BNHwzn|`>_+Qh7?J#pNiNGALs zKB{On*g~A>AsP+T<|6CALraxswM2>aKGI8r>(S%dw(<-6KtXYqiF+we%3e(5pejgfyr0<8 zCV^xmcX1!Zz84CLU+xs&n!0u8^=J@A922|=Q1TKxo))qrPMLH2gl2rsh1Mw#?NqqI za6zltSPmaq$?+!(5QwL6Y`CE#2^qR5o-8x$D4v3j>N7C2M6ZQ?xE*sJoFsM>2|2*v ztLyN*>5aY@G3F9c&6YiMzcl#4fde(k8$`Twqkyolee$SQdhNN1iY0cWt1}KI>~eY< ziAr;4)vN`xZn#HU7sFgwYrw1qR^IV~6-%uug(dvvuFQI?Ny9)z`ud4-oK1n}&e8DA z;m-`ASMwELZHS27d_?J&uiii`RzbH7KhZ`WS(9iyJn}a+IC`zOcU)Q}xxitLZLO&4 zM*bYG7pHz>`{(eae8nG?k=E*;7uY4Au<23=moq8e}v~e?>CbwJC_LWrV7%HMjLDv*L~C!k_*A;LG7FA@uKG{V3rLK8ZSyI;IQ7S z0~7F(w{5Dj?#5;RVp(b?d}{+0pj;Z_M%3%-fzEB;vBxUNHU1hW3t%-oB6K>`_6=-jce*tyjB4S3$ zz7s_K2^mwQYSdBbF4o^qxM5TlRG8D&G{}cBRr>?Nqs#`v@2YP^1dMg|q$SlHYG9R^ zwXiPfwx@t7yoMKVc$2mi$y!9m?xY7zC(Swom>uWNv^U@h8C^-(><(80L{4T=Qq6$| z0;r=QMfQ9x@`#MOR<+i0^d&i9P)mXxAWlu;2WjOzC@tEwwsf^bheO8?WiUH;6wZ*8 zfRT+)!1>`b&xMcc7*ra(2W!6I(7yBfi5`4~u98AB(zZf;4Cq-)IP|@(#!ID0GhlcK zK@uif3^5s=SaHjyBRx!$tvHUKj|OJka>V2Ha`nx=K%EW-;4)i+e6-}jZ>#`ts=khg zl+~M@7tiOW!nyOxX7?G?ba-n0byahNy^Z(OtkAo+v?k4ateN#s_3XOdIaFptb{hPp z`bs+7EfXC)H>R1MG+DHH8UZBix1cj9(ix5^ow4P?$EDMBhF&R27wxVJ)@hc)UK^F! z#Bg?BF&HBqTv85Zp2RSt#`J8GrY>ZR8YqKcTV6#T>Aa!=k|5Z45>ppOIkg+@{%;Y} z(7cg%tV?Z)upt6+2i2u;RqKe-Hjh=%SpSXx4KWv;Uw?}d7m}Vb_t1O8@>}^+{eet6 zHAVedj*+l~ndYxG=ZH#xR`53@z4nwoTpBLeKaW)zW1?d&U=UWYI? z9ydN<4R8hM>|MyAApAbu!$4F*XPhEB67sbuYKk0idE$0}!vr%$g}PdaE&&iAs#zn> zk|elQ=2=FsJQEfx!j4g~+L|YntNC1fJ62lGk&p;zR(w?u1|6}j(8SXPS3Lv)q1FQB zYTb5>nvrvHy9vBUOg@8J&27IePsO5UJa^hf(qxfEZ5DR4OI4RkVM&v?)9XODzhI$> zwCm06T!JzZ(k*X1wvX4}zQ0^-1AvY8TzN|nefh?Ip%yARD_RU`-z@vrhJ<$$vYORe z0@w5$ihA2iSv;iPH{T?v0^FA&rKNFtmegK_1qm#%KRMEmZCeSQM6Vxh~4vPvG6(uo&7MP@p{aC zkN2^nHUYaYSlis6TbuU5qZsy2Yhd*Jb$I=*5Fc;u{*j;u7s(}iR>)jgNE_p(655^j zRy6x5|D3+>pN{%$t$eHd+48samVYBQ?2c2n&J3$s3M}9R4xgI`j{-9*I$Zm0>fZ0d z{J)4L%P#K($0IB|)Vp<$<=Ov4m8THi^b-xjh8i)?-xNqq@#=KRMPiwmvm0eo|A6B} z(I=t}Ob`T2pdaGi`*}jlOHYryX$!^H8uUN6(hyzj8GxxiG3qne|&M7(uQ;5MI4a=z_5zUBZ~V^1lJgGc9~74kmmw>L~cT#}*uK zg&1N=^k&oHBYfbjFuvtuSVx=Qc)Z-;?}eGs(=YuBIN@oo{8K`bMJ2!dG)bTUW;L<$ z{$ixnABXEUN063|{@y6a8Kdqi6=Bp~p;cO@{Y5?G3#`6!%a9ajsTx5-KT?DG@HCu5kQV3*~T3oZOAYyaR5mWpDpi0!2sBV5u0Z zgLZc=-~{a{pR{CA-CnDzwTHBPh)m3?>Gl&bvXB4Bem6PZzYyt4=NWUIMGSMkv?J`r z3$Ob~!WlaE2V#i4DvCK}?&iO|lQD3k%_Ri&#p7OsVuuw;5}X2^{$Y=$aWhFb=d<=fJoy^XyidT()m9F^D?-sh9yeBe(F9kip{i$t9edCH$peR;uN_WJG50 + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNPtsBitXover< Chrom > Member List

This is the complete list of members for eoNPtsBitXover< Chrom >, including all inherited members.

+ + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< Chrom >)eoOp< Chrom >
className() const eoNPtsBitXover< Chrom > [inline, virtual]
eoNPtsBitXover(const unsigned &_num_points=2)eoNPtsBitXover< Chrom > [inline]
eoOp(OpType _type)eoOp< Chrom > [inline]
eoOp(const eoOp &_eop)eoOp< Chrom > [inline]
eoQuadOp()eoQuadOp< Chrom > [inline]
functor_category()eoBF< Chrom &, Chrom &, bool > [inline, static]
general enum value (defined in eoOp< Chrom >)eoOp< Chrom >
getType() const eoOp< Chrom > [inline]
num_points (defined in eoNPtsBitXover< Chrom >)eoNPtsBitXover< Chrom > [private]
operator()(Chrom &chrom1, Chrom &chrom2)eoNPtsBitXover< Chrom > [inline, virtual]
quadratic enum value (defined in eoOp< Chrom >)eoOp< Chrom >
unary enum value (defined in eoOp< Chrom >)eoOp< Chrom >
~eoBF()eoBF< Chrom &, Chrom &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< Chrom > [inline, virtual]

Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_n_pts_bit_xover.html b/trunk/paradiseo-eo/doc/html/classeo_n_pts_bit_xover.html new file mode 100644 index 000000000..d206f2bd6 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_n_pts_bit_xover.html @@ -0,0 +1,112 @@ + + +EO: eoNPtsBitXover< Chrom > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNPtsBitXover< Chrom > Class Template Reference
+ +[Bitstring] +

eoNPtsBitXover --> n-point crossover +More... +

+#include <ga/eoBitOp.h> +

+

Inheritance diagram for eoNPtsBitXover< Chrom >: +

+ +eoQuadOp< Chrom > +eoOp< Chrom > +eoBF< Chrom &, Chrom &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + +

Public Member Functions

+ eoNPtsBitXover (const unsigned &_num_points=2)
 (Default) Constructor.
+virtual std::string className () const
 The class name.
bool operator() (Chrom &chrom1, Chrom &chrom2)
 n-point crossover for binary chromosomes.

Private Attributes

+unsigned num_points
+

Detailed Description

+

template<class Chrom>
+ class eoNPtsBitXover< Chrom >

+ +eoNPtsBitXover --> n-point crossover +

+ +

+Definition at line 319 of file eoBitOp.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class Chrom>
bool eoNPtsBitXover< Chrom >::operator() ( Chrom &  chrom1,
Chrom &  chrom2
)  [inline, virtual]
+
+ + + + + +
+   + + +

+n-point crossover for binary chromosomes. +

+

Parameters:
+ + + +
chrom1 The first chromosome.
chrom2 The first chromosome.
+
+ +

+Implements eoBF< Chrom &, Chrom &, bool >. +

+Definition at line 337 of file eoBitOp.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_n_pts_bit_xover.png b/trunk/paradiseo-eo/doc/html/classeo_n_pts_bit_xover.png new file mode 100644 index 0000000000000000000000000000000000000000..80797158374feb21d3602510e3bb2e2d4d3cbfe8 GIT binary patch literal 1864 zcmb7FYgm&<77hY}+E9g1!3DEkKx_(%$U=jNu~Kd#Ac3H0Kz3UoC^dn|RT5CNBK5Kw zbqfd;0TJ+15g{R8h~=Utupk&dR>`Fe1V~7Lgliy4KkZ}NKfBNN$DDa*<~{SwJLk-q z3!w-6kSo`%L?95z0RMdl5r}1VFy@*V!*=kzpF7;ygzm@t8Vm*)8Vuah(%367df&KQ zZq|>6A$Vw%dhkFvVvlU#YXoAsC}1BBpI)pi;Zw@7DBoaeM2Ejshgz2#J*U6&l zEKjd6A|^_vN!NSpn=?suv)I82sU}J=K07%8yyiK|>qN&$TQ47*VX_lS>sh}&oJdYrCIlS-*Bq<7>lz)@|JbO$KvMr5DXgzKB+>_{D7_PWC zcw(;1)oZF$=RFtO*tOc(rBgXwX}>iYz{w)w0iJm06mPyin?UnS*#huFfRn>6U#Qoq zhWejH+h&Wsn~<_|O9}24&;GN-;0TLa{!!dFRUJ2T|Md~_^!NP)u@;0jWbk*y6Z=N5 zL6XxuJdU1o4SvOhN<>U(-ZX=arPeQKCGNGxJiwSQed9rFopJ{Zf?mL-b_wye~TZdgB6 z+F9X{+Cu2mV!hB!_wRK#v}tmiIG@%jy3Lkev_8t}q~MdmDoyTUs!0f@!^T3HVH!cc zn)3=H%cd99O*BSw{L)K*su6{!&!hxYkIbeG&<^}9t6S1QV&%NFWm6EqPA&#H8EDMz z?crhOq6c%OV7HKtRv}DrVe&OQZD7khq%yI}yYqTe!uGs7cuh((+3$sU!NJRA&&&&Y z5je9|zcGL1|NoXO_AbbMo4@O`H2Rr1rm-E0Z!al}QX$ORDQ2EdH@vvGM}tNd1;Z96 zL;okmv598mxzRb$+dwuhr(@Z8nWs6`&KBSAcQXvI}$fH@uXNj=!ojyc`z0m%ae zUq#BFKg>c#v{hc+zqSOGy?HhtYU0R2ovqu6$6~KJmg9}~q^;S*(h9tS=wsPDEO=Sm z1%bMSn@iE)DgYCgAydpWjwq-ci}CSqu-7?q>(68Ues^_!Ex`O)5V!fPLLt|uiljL} z=Zw33VCzEC=jf(N>>0=P%|1ZitU7y7weN+;4LVx}|CVx=w+kKh(E?w2YI(R$*RQwI ziu#a1$hcpo+je#@SJ|-j!_C2&VK&XvJ*DhBj9LSS#guPf=5WJn&ohcy!i&qr;%+Nc z#d_SCHK>Z)Ma5X+hZNb#rIiylkZJ(g+wr0vfwH}Q{lJsfmt zBj4MYl=p{{^4}rV6i2%`7izBc>OH@VnD~MC(!2nBUx%&O^9~&Z!d+|e zU7Jxhy~vB?lGh4+t;5*)*YRG$-@wOGi&RNFpr5n-d9U{V-Xfnh=0U3c-vy4C zACo594~(P|X)Asg`s=R)Yql6=EIO;`n*o~9HvOe`&10w${`L?7z6bU_*c+So3u~jb A_y7O^ literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_neg_exp_generator-members.html b/trunk/paradiseo-eo/doc/html/classeo_neg_exp_generator-members.html new file mode 100644 index 000000000..ad58ede2c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_neg_exp_generator-members.html @@ -0,0 +1,22 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNegExpGenerator< T > Member List

This is the complete list of members for eoNegExpGenerator< T >, including all inherited members.

+ + + + + + + + +
eoNegExpGenerator(T _mean=1.0, eoRng &_rng=rng) (defined in eoNegExpGenerator< T >)eoNegExpGenerator< T > [inline]
functor_category()eoF< T > [inline, static]
mean (defined in eoNegExpGenerator< T >)eoNegExpGenerator< T > [private]
negexp (defined in eoNegExpGenerator< T >)eoNegExpGenerator< T > [private]
operator()(void)eoNegExpGenerator< T > [inline, virtual]
result_type typedefeoF< T >
~eoF()eoF< T > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_neg_exp_generator.html b/trunk/paradiseo-eo/doc/html/classeo_neg_exp_generator.html new file mode 100644 index 000000000..423914acc --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_neg_exp_generator.html @@ -0,0 +1,55 @@ + + +EO: eoNegExpGenerator< T > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNegExpGenerator< T > Class Template Reference

The class negexp_generator can be used in the STL generate function to easily generate negative exponential distributed floats and doubles. +More... +

+#include <eoRndGenerators.h> +

+

Inheritance diagram for eoNegExpGenerator< T >: +

+ +eoRndGenerator< T > +eoF< T > +eoFunctorBase + +List of all members. + + + + + + + + + + + + +

Public Member Functions

+ eoNegExpGenerator (T _mean=1.0, eoRng &_rng=rng)
+T operator() (void)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+T mean
+eoRng & negexp
+

Detailed Description

+

template<class T = double>
+ class eoNegExpGenerator< T >

+ +The class negexp_generator can be used in the STL generate function to easily generate negative exponential distributed floats and doubles. +

+The user can supply a mean. +

+ +

+Definition at line 137 of file eoRndGenerators.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_neg_exp_generator.png b/trunk/paradiseo-eo/doc/html/classeo_neg_exp_generator.png new file mode 100644 index 0000000000000000000000000000000000000000..30433413444b97b097955afa4dc7bace025428ec GIT binary patch literal 782 zcmV+p1M&QcP)O?%0XwFkSf=sdU0L8?IgxcDT155XK020l- z;y=_r&&x}MeG4A#7jVCQy!Pyy_IY$n!?+y!ub7&ayc7Nt@tuH|Wevxd{Rc6gi0_qV zJma0?X+JNYY#+}~d=u~Sb8Ftm<8f==?c-}a;~CF*#xtJr6nWb3lXriAHr}Gmc^DXd z;h*OX#aDRZJ6(e(@(7vTc1l+f;+Q?3?O-C2#7AVNTd5{1@4O&1G}(%gj6U zpNucME>WEetGJ|z6r~R4IKC>)c*Z-&(|%rRKhNL9v;50Npf1jM#xtJrjAuOK-I)iv z%>~tMc;l(@JpFUSNL4kgFX_9EoGf`^o+l8YU%lqJ&L)(z1s)G*L$%5wv!3P?ou_of4Di2n?G7r1x5+6zrs+JUdB^DW1?1RRG zx&lFErE5IbwE2V(sJw!!`-NtoYrJNzYu376JMVYXzPjJ)9H{XC>9PtDys`gkeBB)1 z?7tG|@|2&Kzde*GGw0Nh1ONa4 M07*qoM6N<$f|JaJqW}N^ literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_neg_exp_init-members.html b/trunk/paradiseo-eo/doc/html/classeo_neg_exp_init-members.html new file mode 100644 index 000000000..9782f237b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_neg_exp_init-members.html @@ -0,0 +1,22 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNegExpInit< T > Member List

This is the complete list of members for eoNegExpInit< T >, including all inherited members.

+ + + + + + + + +
className(void) const eoInit< T > [inline, virtual]
eoNegExpInit(T _mean=1.0, eoRng &_rng=rng) (defined in eoNegExpInit< T >)eoNegExpInit< T > [inline]
functor_category()eoUF< T &, void > [inline, static]
mean (defined in eoNegExpInit< T >)eoNegExpInit< T > [private]
negexp (defined in eoNegExpInit< T >)eoNegExpInit< T > [private]
operator()(T &_t)eoNegExpInit< T > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< T &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_neg_exp_init.html b/trunk/paradiseo-eo/doc/html/classeo_neg_exp_init.html new file mode 100644 index 000000000..ea1228f70 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_neg_exp_init.html @@ -0,0 +1,55 @@ + + +EO: eoNegExpInit< T > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNegExpInit< T > Class Template Reference

The class negexp_generator can be used in the STL generate function to easily generate negative exponential distributed floats and doubles. +More... +

+#include <eoUniformInit.h> +

+

Inheritance diagram for eoNegExpInit< T >: +

+ +eoInit< T > +eoUF< T &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + +

Public Member Functions

+ eoNegExpInit (T _mean=1.0, eoRng &_rng=rng)
+void operator() (T &_t)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+T mean
+eoRng & negexp
+

Detailed Description

+

template<class T = double>
+ class eoNegExpInit< T >

+ +The class negexp_generator can be used in the STL generate function to easily generate negative exponential distributed floats and doubles. +

+The user can supply a mean. +

+ +

+Definition at line 143 of file eoUniformInit.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_neg_exp_init.png b/trunk/paradiseo-eo/doc/html/classeo_neg_exp_init.png new file mode 100644 index 0000000000000000000000000000000000000000..cda6f6e94861299b7030409a099b3f55cdc365a9 GIT binary patch literal 1186 zcmeAS@N?(olHy`uVBq!ia0y~yV9Wrr53n!;$=jcwTm(`Q0X`wF|Ns97GXMWSFn@l+ z1Rx8H4;(m9edzxaAeXTu$S;_|;n|He1_l-jPZ!6KiaBrRS{FSw;AvZ`w)H@pX=&5k zyWBgA&Y!x@|3k!e?{zg7wI6dAYRqu5Q&yNW(a`hz`ksF!E96eC_-!pVvAIrkVp>Mq zzt{_04l2u)qV6|eGn%>o$s0=@KBMTQ@V(1Q-7kC&7F?UO^BYqM*AnsdCv+ok_&X%G zh(=_z@-rT5VoMGayLINxEar^P`|^jEF)k0f^}grxNv@0|H@qU+uRUW-o6vq?T8Rjw z)R~Z-j*{6HqS1!)9la+rpZHdE;hVskTQ!-#?{KTVm>~B{G+dHj3-`7a~*GgVVErUxpx=y+JlqxoSi4hWqkUn_>|{X zK)!p`o%U^uZ{3?)yd4cDqmmD z@mqDAqmNg2UDb{`Y>IxN{CB?U+2+J7ZSM<<7F9^AK9l*u`XEpG>f^U>t+-s2c=O_> zko!z)A6ws(%w4P8X4k!Y{rn%?!p_De%@=&{Iqg`mUb}n!tH2ZalP{bP>I;lN@6;FF z@~>)I7u%~y4JBWv?K=e}t*$Sg5Z`w0tHzV*3yW>Jex|;N>36ET-BKqOqWL0Q>sPU+ zYTGg)=ittTE00_VNy^YNG?^;#OLyuX)_5OP`!@+0ZD}ve7y3$bw3OLCO`ov-Wb`ww z2CN?uSjUc19LE`Z|Swl6+&jl_PeG z;<_obTJnmOjeyRd<;CNR#aB?_AX{MIh2(#F%nkI~eU7(LHcsKZbACLo+Unr%E1Yg+ zm)F8)Tjljo;D1om(+eA?`rc?;x@G=L1=p;GZ_bx2%N%NzOI}e%>I*9*TZ{!^K!s(vmtW(y`!Ik?tt7go5y*w+S-&y``^#7VyY8f62K0p2Y z=S$b^{*0G<-D7&*G{irmSd&R<_Fd(|i@yt=(w);(wYe&uyjUiD&eGtA*STr9(u&@?EpjWdRl_44$rjF6*2UngDKTEI0rF literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_no_elitism-members.html b/trunk/paradiseo-eo/doc/html/classeo_no_elitism-members.html new file mode 100644 index 000000000..2c6934f42 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_no_elitism-members.html @@ -0,0 +1,20 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNoElitism< EOT > Member List

This is the complete list of members for eoNoElitism< EOT >, including all inherited members.

+ + + + + + +
eoElitism(double _rate, bool _interpret_as_rate=true) (defined in eoElitism< EOT >)eoElitism< EOT > [inline]
eoNoElitism() (defined in eoNoElitism< EOT >)eoNoElitism< EOT > [inline]
functor_category()eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
operator()(const eoPop< EOT > &_pop, eoPop< EOT > &_offspring)eoElitism< EOT > [inline, virtual]
~eoBF()eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_no_elitism.html b/trunk/paradiseo-eo/doc/html/classeo_no_elitism.html new file mode 100644 index 000000000..0040996fa --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_no_elitism.html @@ -0,0 +1,39 @@ + + +EO: eoNoElitism< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNoElitism< EOT > Class Template Reference

No elite. +More... +

+#include <eoMerge.h> +

+

Inheritance diagram for eoNoElitism< EOT >: +

+ +eoElitism< EOT > +eoMerge< EOT > +eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + +
+

Detailed Description

+

template<class EOT>
+ class eoNoElitism< EOT >

+ +No elite. +

+ +

+Definition at line 107 of file eoMerge.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_no_elitism.png b/trunk/paradiseo-eo/doc/html/classeo_no_elitism.png new file mode 100644 index 0000000000000000000000000000000000000000..78116eeb8a18d4e91eeeafd8d598c2644c32f295 GIT binary patch literal 2195 zcma);eK=I<8^@sZ6xopnK4Ak%Mofc+Lvvu4@7h1kIp60#_kEq`e!idQxz1Ibqpghe z4rv$+CWEoF0%0%-v{)~0ln~#ATZS))AKP&b$E`&okywgE4K&*6bg^2y8X6j68bxE` z;f65K(FJyFqR$TolLRnU=EozcGt`c7x}ls+$DTlY{PqfSW+yI)Z*A88_|hk*Z$*RK{zE4XJj#;(5lWKw!#*Z~u)FYM=uPQa48t=) zbLg!4#bUw*=pIcdvP{ zPWpWber{JPZwS0urD)2`l&5HqCUJxo1rnzKBSS7YM!bxT%0)Nlh7}_Z&Rp?NJE75+ zM2s?K!oO$6JLP%VOP%VCZydJE@Y1bMFBJec;J?@+ys9VIvy`bQA2V0>%}}fpFbNmv z72gb9q4s3@fP(o&qN9@XMQm~Ixg;MIeU@2119=Z2q#Co}Y))%apSDJb5HSfqGo$QE z@ZJPXB>$v;?}K+w^rX6X2Hy=?Z{go_WU9o=mT8>kp?@bMC(@SKapM;^LQYA9t!T<- zF7?_YQ@Zd#3$ZzL23)qr51)z8n(GEyh?~mo1>Mf|@9ZFbm*^ z_DVKQW{O;Fdu^zp#dv7UbGc?oA}j%feO$gI)O^#@GRdbEC_o7M5Pu>W`F1aord4Iy+u2F?LlHes-ucvr2i@<@v^yJMc8Ih7EuEg0HDk zgy;&Od!}qY`P*LLUiTx15ueVy--C{%KY0tTv9@myS*A5Q{yqeG>0+cv$#6;-??iZa zSi{?XvYSnTp4?~e{mNLp<&Tv4|m@snc`|kq^e5 zc8bzx_3@~>!G2;K5ZN^*_Q?AP;qn_J>uq=*6h)uU)Y?K|^LxwJEaxBDo0gmuSS?_2 z>bK4%mJbiyP9s&|aafWzxiaKg34T9%JaW3`Inf;WVV%KmGDC%B=K0+k<1(|}Cab

|!_M@3#5>oB2OBea-E^6UMn7pMzRfZJzQTab8#b?oY@&_&4HqYEb zWg`;6a675%`7wp0tr!+zO!eI+=5%_fB6p|#c?UX|7E`4tPCXPc2PJWcjxYasj~hFX z#^wanEfFVHKORd`cs)!8>#xxvOX`5jl1K!ptV2yKJ;CBQgCd0*M(u{9*H)Wogjb2z zQq|$gW=W=6<5kta`~3&}|3$(o?gK1^ntHt^PVWZs7W`sX4*}bb2=L6O_HC!hwl9tr zdd|xhK)rVO#_vEtxh>c@`vb}Xh#|K}>}=lgw(LR8xulHtp)@egzAG$I=L*9v0~JUe zOMSrjpwfu;P1>!|1vpMOA@9WP1!Ayn`=CsH~bGFFjJ`os^JPRV?M4xkh;^s%?p z(E-;p{Uot?IzuU8E!LX1!=bJxvc%@3P#Dhw^E+_((tb(Oil-VAm z6sX6i+GYDq)q`3(3!KBKWp4HG_jeE0wVAFcqsKM!@uR+jIdgmKC_9xNQ@BbNn*DZy z!(?YHNo!P#Q(=ke(&3 zXNN|I98_+DIkZvZp>xj`^RI_T`ZY;4b9(@hgryozWI3cy5dT5IFxHM%#TKU%{tL3Q B*Tnz; literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_no_perf2_worth-members.html b/trunk/paradiseo-eo/doc/html/classeo_no_perf2_worth-members.html new file mode 100644 index 000000000..b4e2bbbed --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_no_perf2_worth-members.html @@ -0,0 +1,39 @@ + + +EO: Member List + + + +

+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNoPerf2Worth< EOT > Member List

This is the complete list of members for eoNoPerf2Worth< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + +
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoPerf2Worth(std::string _description="Worths")eoPerf2Worth< EOT, EOT::Fitness > [inline]
eoValueParam(void)eoValueParam< ValueType > [inline]
eoValueParam(ValueType _defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< ValueType > [inline]
functor_category()eoUF< const eoPop< EOT > &, void > [inline, static]
getValue(void) const eoValueParam< ValueType > [inline, virtual]
longName() const eoParam [inline]
operator()(const eoPop< EOT > &_pop)eoNoPerf2Worth< EOT > [inline, virtual]
operator()(eoPop< EOT > &_pop) (defined in eoPerf2Worth< EOT, EOT::Fitness >)eoPerf2Worth< EOT, EOT::Fitness > [inline, virtual]
repValue (defined in eoValueParam< ValueType >)eoValueParam< ValueType > [protected]
required() const eoParam [inline]
resize(eoPop< EOT > &_pop, unsigned sz) (defined in eoPerf2Worth< EOT, EOT::Fitness >)eoPerf2Worth< EOT, EOT::Fitness > [inline, virtual]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< ValueType > [inline, virtual]
shortName() const eoParam [inline]
sort_pop(eoPop< EOT > &_pop)eoPerf2Worth< EOT, EOT::Fitness > [inline, virtual]
value()eoValueParam< ValueType > [inline]
value() const eoValueParam< ValueType > [inline]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_no_perf2_worth.html b/trunk/paradiseo-eo/doc/html/classeo_no_perf2_worth.html new file mode 100644 index 000000000..785ae693c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_no_perf2_worth.html @@ -0,0 +1,45 @@ + + +EO: eoNoPerf2Worth< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNoPerf2Worth< EOT > Class Template Reference

A dummy perf2worth, just in case you need it. +More... +

+#include <eoPerf2Worth.h> +

+

Inheritance diagram for eoNoPerf2Worth< EOT >: +

+ +eoPerf2Worth< EOT, EOT::Fitness > +eoUF< const eoPop< EOT > &, void > +eoValueParam< ValueType > +eoFunctorBase +eoParam + +List of all members. + + + + + +

Public Member Functions

+void operator() (const eoPop< EOT > &_pop)
 The pure virtual function that needs to be implemented by the subclass.
+

Detailed Description

+

template<class EOT>
+ class eoNoPerf2Worth< EOT >

+ +A dummy perf2worth, just in case you need it. +

+ +

+Definition at line 230 of file eoPerf2Worth.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_no_perf2_worth.png b/trunk/paradiseo-eo/doc/html/classeo_no_perf2_worth.png new file mode 100644 index 0000000000000000000000000000000000000000..11d6a7cac9dfa2b027c062f7f2d036a420c7cd3d GIT binary patch literal 2505 zcmcgudo*vnDF_00p;^s2?V!f0sC57TU*20 z_>+RJP_VrX9Ar4nybS^!KwB6aAwu)!@jbs1b&s0Nmp;&68;q$bJ@xtXPN7z}-Wh)6 zQ}9*Ml8ZM_O*SImV)gdwLY&PzldRd?mefFvH(k|*&wLeUxF41fTfV;D4TOhXaZuEC zys9*vA%xX7L`lGq;&jF$7MM;!a`8z;K%L=Zx*az>OWq-bo2K;M^!r|^c6@KD6J;lR zdap;9JK$Q8CsS4GQu3w-5rC_lDWs%V;3Mh*E((lWsg0zzrQdC$$SQl8q(TkI^&4C} zodlY5_F?;Cr}L@(95t5^5GYv5np-zb%7c*&>wTyUbmmX&s&j9FFfDQ_P8m+aR{On(GRhdPwVgD zLFWnO)+`|&^g?+;Q38cQ^;a65orqd;%}i7;S)|o;gwIfIoKTu=^lnqlPv;I;)6x}`a&HI0n1^NAu0&E4CgL)fe}nKseoW_kBG9(D;vHft(u#>D82bk{hX zE#%6T3W@E*VoKoaV*`>0Oj75V6{?^ok~= zxwB;sR=N+<&QnbmD)d?3aA%9UNSDVA?bTF3$ow@f$O&qAAVU%sT_ikN9en@ruF~nw z2A$hglG|xQmb;2V{H~iXisY`FFUrZ?>HoHXzZ>4lJCs367uX(;*h-OHyzK;S-Mmln zkNU6hc=_?l2eI2*GvmvtmkD{ow)3ahR|flZomuQ1g$>;T&Qn8_0gR_nKssK!sYHO4 z^d*+)Yi)sJa}7GJ4Xs1Io4BPo;b-rm&9TY4@Wf{Gk_LT@wy&Ge^l;NaFXD3teclhw zhErL^nV5rW^?I)`#P=>E3P|2c8g;?J3;e8)v2pbUG#cNa<09PZ_W(R|!odQMXR$8l z8RPZUAhDXU7E8QLo$4XwRDu(8u3*UF%!N=QMOQf(W@b^C`$wquDsEKWr_Nz!0G#Kj zYuSiY3DzMvl%)RB(~e;3Tb;Nw#p8hsw$t8ql^^;v-LFuR)EPfmR)Ii0_lrK_?jPt) z#KfzKzbOr!_QVANuZ>wD-omnssj+hLBX9WthYCEPIhx%pw%P1aM(e!tWd>(WuHF5> zo_wOxxLFOwJzpCMN;uXa9`d5rNYtml-A^hKrL9tb55t>wgpi=UO$-zC#`6Qvu~tZ> z>e#9l7JLVL6G0BnszF;!cSs?NE%mJ-t%Eg+k=o$UsuN@$h51g6N4XWl?l(RMX@rl> zj^1;m368X|Gd4!2;^r5J(!Ac1XYEl_?9~z*B;h@?jAHo*oHq`q zs?5M~C%4PO#7c?#fy?{o4#L<|djVkMHkQ`H%7{WwZ|bhgjC{!~y_u8O;sYsNTqzOY z=c$1KUViS!XIhzZLiAPfxbv(%*#8KwS!iGkuAL^cWl$XqdLw4FA5{6jlKU-E>?_xM zQ%H}K)+eq=?}QYPT)siRbf~9WbW*Vh;jZ}lR((X{dUW-p#*Bw z^_EcWyyOv@>F%xt9;fMYmUgV?wb2niIWWYGIO0yq&xx3p4Dq?i77hqgaiJf65IX?3 zC+GN&^gWxiUhnFyBlx_ty|!(R%E}&*mo6@^4@=uNLK!@!ANpNeVKkiS+_6VydgpCO z&JF_QXjtp&*T$>!#KDlZcBmW9?g#&v8zp5^JiB5)==V-JKajgUC`V_&{RJrki8Jc{ zj8tIOQo!_$zA)blhAjA{=HW+HTFRvfJPO(@%ct(5Fb5mI7#hRQ&r##fx@_#JYqAv$ z_!M2?V05y$R2}-e=(1AM_V-g$*<*#I{F@AhO4t%e5L<$Kh&UblcO?)${#r#ZA zU2$ibmPzq-6KwPNQRhhpztM=5TWU9x`&N64@3GT|CKtSp@D=ZD`VOT7kg$Cx0N^K6 z{B}U30vA;@D^WE(t9_KY?~YVXfZ*{UV)lQrdnO1V6*5rKmoed_er$HG + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNoSelect< EOT > Member List

This is the complete list of members for eoNoSelect< EOT >, including all inherited members.

+ + + + + + + +
current (defined in eoNoSelect< EOT >)eoNoSelect< EOT > [private]
eoNoSelect()eoNoSelect< EOT > [inline]
functor_category()eoUF< const eoPop< EOT > &, const EOT & > [inline, static]
operator()(const eoPop< EOT > &_pop)eoNoSelect< EOT > [inline, virtual]
setup(const eoPop< EOT > &_pop)eoSelectOne< EOT > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, const EOT & > [inline, virtual]

Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_no_select.html b/trunk/paradiseo-eo/doc/html/classeo_no_select.html new file mode 100644 index 000000000..c0de71b7d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_no_select.html @@ -0,0 +1,51 @@ + + +EO: eoNoSelect< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNoSelect< EOT > Class Template Reference

eoNoSelect: returns all individual in order WITHOUT USING FITNESS!!! looping back to the beginning when exhasuted +More... +

+#include <eoRandomSelect.h> +

+

Inheritance diagram for eoNoSelect< EOT >: +

+ +eoSelectOne< EOT > +eoUF< const eoPop< EOT > &, const EOT & > +eoFunctorBase + +List of all members. + + + + + + + + + + + +

Public Member Functions

+ eoNoSelect ()
 Ctor.
+virtual const EOT & operator() (const eoPop< EOT > &_pop)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+unsigned current
+

Detailed Description

+

template<class EOT>
+ class eoNoSelect< EOT >

+ +eoNoSelect: returns all individual in order WITHOUT USING FITNESS!!! looping back to the beginning when exhasuted +

+ +

+Definition at line 78 of file eoRandomSelect.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_no_select.png b/trunk/paradiseo-eo/doc/html/classeo_no_select.png new file mode 100644 index 0000000000000000000000000000000000000000..3577012e8d4c25aa70c01e5b11bf9ba1b44f45eb GIT binary patch literal 1883 zcmb_dYgAKL77nCJ!EpjqTEr5H&U8QoLo)5goFSggb+kBDN~oOu9<)H~s5qzFBKzVFZK0*81=934y`%t97{f6S!{PQM2TtTg>aX=YIRVnZ7wQ`xu`=c zqq(`6{7^fh+v=SN3EB_Cj0qEAu+<8GAI}5C>+#}XPFn_7LMUscgMYsu6-r(Dv zrEIwga7oa0C+u8-wa1UbyZ;p5|JhBs+1vE_+hJB}BxSd!m3mZN)7_a2PIo-LQ#;i* zJ(L9f&tCP&EVX)amS=nC*L`@ zy1((8S+(9Q>&A0Ye)8k46rL7MUJb@1HKZq6IBg#Ur>B`^Gy3U?xTI1OZze14AKAkE zsvG%!lY)V+y_^1HcVn`)_hrAoK`wBPTRC34J<@G^?tAz2rT!k%B$?|5H(J7)4?K#) z{xWy|eUiQ>_q&ngG*3uy6E2dtmMer;9ES>_@T-`Hj>9O{uh^`{5K6VN-G=&Afe#a_ zvW0YDBNk%|5*imDq|TDcj{DK^Y?b@90EY7!dwzN#aLDrU=#=^{fv&a)naIfs!{>Og z*JZPoe(JOA$L(X`z>=`aj-il*ykVCmDj1>h?RILq;}j~6c=qzCr3THJi7@?POiw=g zt!@4l=obT*I^8py?|pK;kj+Tp28}k=<rvWsQgH!jaN?b7 zBx2-Q@7%Yg@m7a;hpAV{x-6h664oqwNH_Q;mKk)EKrd!HThgAO%gs>y$WMPn(! z9x$pST$dqR_g`!`pEDY|puJ?K&prK`vPNh8pK|?I4gYMMCAZitpot$TK2r#VxCdwl zkCofYt(8Ux-844fevL8Zx6S3O%Iw-}2nE~bT5#cofUIp%)zwa!c)MLsWpGBsu9ENz zpP!nj7huavViN)N*y-+Bk-v;U>In%F-}M>*YORJ**Se+bD8?2K0q6YQlE$&jm?9xU zAxhR%Mv3jqIkrGSZ)6VihTFyej9t1FdtTy8#Sg#*AfjEZt&h;bTAQoiF$w6J@{24T zkwu>OAGPyQ5O6^E^1@)t~?z#KMN^x zB;CCy?BvG_e&Pj+)Jj|6R(G(3wZz$z+&jOHZwJ0jdr+1ccuHc^OUfNQI6}t`62(OWpHbP!KpS8v4={h0I-#5so J+AHStzX1r-*Yf}X literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_normal_generator-members.html b/trunk/paradiseo-eo/doc/html/classeo_normal_generator-members.html new file mode 100644 index 000000000..c52610dd9 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_normal_generator-members.html @@ -0,0 +1,22 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNormalGenerator< T > Member List

This is the complete list of members for eoNormalGenerator< T >, including all inherited members.

+ + + + + + + + +
eoNormalGenerator(T _stdev=T(1.0), eoRng &_rng=rng) (defined in eoNormalGenerator< T >)eoNormalGenerator< T > [inline]
functor_category()eoF< T > [inline, static]
normal (defined in eoNormalGenerator< T >)eoNormalGenerator< T > [private]
operator()(void)eoNormalGenerator< T > [inline, virtual]
result_type typedefeoF< T >
stdev (defined in eoNormalGenerator< T >)eoNormalGenerator< T > [private]
~eoF()eoF< T > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_normal_generator.html b/trunk/paradiseo-eo/doc/html/classeo_normal_generator.html new file mode 100644 index 000000000..f5c8da146 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_normal_generator.html @@ -0,0 +1,55 @@ + + +EO: eoNormalGenerator< T > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNormalGenerator< T > Class Template Reference

The class normal_generator can be used in the STL generate function to easily generate gaussian distributed floats and doubles. +More... +

+#include <eoRndGenerators.h> +

+

Inheritance diagram for eoNormalGenerator< T >: +

+ +eoRndGenerator< T > +eoF< T > +eoFunctorBase + +List of all members. + + + + + + + + + + + + +

Public Member Functions

+ eoNormalGenerator (T _stdev=T(1.0), eoRng &_rng=rng)
+T operator() (void)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+T stdev
+eoRng & normal
+

Detailed Description

+

template<class T = double>
+ class eoNormalGenerator< T >

+ +The class normal_generator can be used in the STL generate function to easily generate gaussian distributed floats and doubles. +

+The user can supply a standard deviation which defaults to 1. +

+ +

+Definition at line 120 of file eoRndGenerators.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_normal_generator.png b/trunk/paradiseo-eo/doc/html/classeo_normal_generator.png new file mode 100644 index 0000000000000000000000000000000000000000..864c323f9ca4e7ac1695c9611e21287e5d306e82 GIT binary patch literal 756 zcmV>gv)K1UlLW7Woa>>e%Klz?a{|3yGeR-if&4O=wk1dR||6dGVN@g<>F9^-7~4h^6O zGp+aywP$I0LTB3@jaCY{(lJUu+qUh~=$cm1IPzODGu_ip`>l)V20STiIHv43i1Bnx zUl5}i?TDtk1D=zwljA-?yZyT??dx{CEbY=UHJZ_kW;CN2&1id~`!#sw?_Q&cw7du` z&fX8xmd(d$-5L6IT6ezB#5EY*Y1{ZcLvL zqZ#dprn>{`?#`c}Sw7@RoF>d@Ml+hxjAk^Wy^*H-HF)Lk-d{_rIgfwvJt=i{B1bf-XONN*AX--;lKMK4^+|uC0ohl; z5NoO+m0}iYF0&Ag26bwqac-rSo?uuCZJiG@~8Sbaz1A-T4zV%ZEIP(}Wq#Xht)d(TrxaH_|{; zTu@wrH`>cIPyd4i=V5-`Fv?>nSG2I8&AREGy*=0lw843wAM@RXES|K%^Xqe8C|&sq zftzcZr(5vl?(%q#JYQ(o7o>|`!A)F^&|sp;xH5rhz5t}lwNVT!wn3$V%ou2>rN{sf z4Ipq>%BTX9l|r@6EoidR&V1KiwPTyCl-<(Pnyc!I8g1=2iK&yAmX+qv=4a1+(v=mS mWBSuCL`#fjv?H484)`C0wiJ)P41B@>0000 + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNormalInit< T > Member List

This is the complete list of members for eoNormalInit< T >, including all inherited members.

+ + + + + + + + +
className(void) const eoInit< T > [inline, virtual]
eoNormalInit(T _stdev=T(1.0), eoRng &_rng=rng) (defined in eoNormalInit< T >)eoNormalInit< T > [inline]
functor_category()eoUF< T &, void > [inline, static]
normal (defined in eoNormalInit< T >)eoNormalInit< T > [private]
operator()(T &_t)eoNormalInit< T > [inline, virtual]
stdev (defined in eoNormalInit< T >)eoNormalInit< T > [private]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< T &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_normal_init.html b/trunk/paradiseo-eo/doc/html/classeo_normal_init.html new file mode 100644 index 000000000..cbedd28b5 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_normal_init.html @@ -0,0 +1,55 @@ + + +EO: eoNormalInit< T > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNormalInit< T > Class Template Reference

The class normal_generator can be used in the STL generate function to easily generate gaussian distributed floats and doubles. +More... +

+#include <eoUniformInit.h> +

+

Inheritance diagram for eoNormalInit< T >: +

+ +eoInit< T > +eoUF< T &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + +

Public Member Functions

+ eoNormalInit (T _stdev=T(1.0), eoRng &_rng=rng)
+void operator() (T &_t)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+T stdev
+eoRng & normal
+

Detailed Description

+

template<class T = double>
+ class eoNormalInit< T >

+ +The class normal_generator can be used in the STL generate function to easily generate gaussian distributed floats and doubles. +

+The user can supply a standard deviation which defaults to 1. +

+ +

+Definition at line 126 of file eoUniformInit.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_normal_init.png b/trunk/paradiseo-eo/doc/html/classeo_normal_init.png new file mode 100644 index 0000000000000000000000000000000000000000..927f230a2253c559f901a82a4c4f59e8afe5197a GIT binary patch literal 1154 zcmeAS@N?(olHy`uVBq!ia0y~yV9Wrr53n!;$=jcwTm(`Q0X`wF|Ns97GXMWSFn@l+ z1Rx8H4;(m9edzxaAeXTu$S;_|;n|He1_l-hPZ!6KiaBrRo-TW=z|(ekS#~#X_8*qw zv^b5`Zz7+5b&u)&SZj3R!mIrLW>KI0tL(k{7hksfcje-Gb}t86+q(YHCkyX~rbx_M zSTDAPZNkl!J{Qj~=sk5T-?W;qyIE`5j>z|!_XNNE30bxx=GL*WBB)`J#+s?b&B}~6v-tqjNfuno%jPhBj$^~pv3eUe^IC$Bt zO2{fA=sN1iBb|Qh%(i`Db6M@}Zl)^p%R84lUn=FSJ$E@x)XLTP#hJ@$#$Pl2 z)2}A8oNp71x81Yc@l^0t=JLJU+fT3Nx}f=L6_d(#b${m@oZkwzRn@HNwOT7SQC8Rc ztL_E0y^rQzyk?X1V)KsQzxwtY7@9bjbKHHZ+rs^8m(kBv^QK;VEA%TgJMqf()t3(0 zI@RyZN@f1KYRW{tg}?7~@Wj4~%#3Z*`?_X}p7Zpou&C(^y=}GE-d6vzdQp~ReDKxz z-nxb+Qzd43@%XB?EfaDM?p(O?$OZY8&vbuet@@e9?rd!0T+fkv+d*O5>z4*iMSeGp zt}|>oe$~)qvRE|ZgYU%PWu=Dh z)zxbPgq@W$r)AFNc^LV3z~j2im0?@d8aQgtjd^h z`W55G>j8baq5aCTW>MxGd#B!7w$Q(8q2#QE`)y06Zx_&8F?Y79_!ZR><@X2Ug8MIo zNHWgaTnXxdkfaPPEdBxsZ)Lvw)c332{e1};ZT~ti>^rJlcJ)A~{krR1U#^%G zE_?jg?Zu77%T47j#d~GTSZ&?pd40o_@5ZtbOITkNoUl61w<5o#&$jBH!Rw3G3-*~_ zPOhJ+_vT{z^5Cx@b{C%dzwq7q%l{SH(lS8kpZ}{*Vux6_7H@vmw5#Ra#-nS!U+6{O z0Wyn~jW9zU&Cx;D7pDGOeI`J3*QHlHzFV!FgV)xHf7wtG^y7fSp_k|W&)dZ1S$H?s?QKAmJOjL-EByDF=&;-x_R&4Ict!xYGFzmvo2g7D;d6 zxKQ`UgRxp-Q}^{1Cl`Kny|FQIopA=Ea7jX+`1*kR6J8$Y`f{Oc*<#x@v&|RW{#>#~ zu0Ozbk*!Np-i9iZJvn!;O3unEZCe&Kcj3yg_1t%l>9*|O67l)OzQtE(0SgQUPgg&e IbxsLQ07#`R3jhEB literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_normal_mutation-members.html b/trunk/paradiseo-eo/doc/html/classeo_normal_mutation-members.html new file mode 100644 index 000000000..134f42470 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_normal_mutation-members.html @@ -0,0 +1,34 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNormalMutation< EOT > Member List

This is the complete list of members for eoNormalMutation< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
bounds (defined in eoNormalMutation< EOT >)eoNormalMutation< EOT > [private]
className() const eoNormalMutation< EOT > [inline, virtual]
eoMonOp()eoMonOp< EOT > [inline]
eoNormalMutation(double &_sigma, const double &_p_change=1.0)eoNormalMutation< EOT > [inline]
eoNormalMutation(eoRealVectorBounds &_bounds, double _sigma, const double &_p_change=1.0)eoNormalMutation< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
functor_category()eoUF< EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
operator()(EOT &_eo)eoNormalMutation< EOT > [inline, virtual]
p_change (defined in eoNormalMutation< EOT >)eoNormalMutation< EOT > [private]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
sigma (defined in eoNormalMutation< EOT >)eoNormalMutation< EOT > [private]
Sigma()eoNormalMutation< EOT > [inline]
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]
~eoUF()eoUF< EOT &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_normal_mutation.html b/trunk/paradiseo-eo/doc/html/classeo_normal_mutation.html new file mode 100644 index 000000000..d930e71e9 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_normal_mutation.html @@ -0,0 +1,232 @@ + + +EO: eoNormalMutation< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNormalMutation< EOT > Class Template Reference

Simple normal mutation of a std::vector of real values. +More... +

+#include <eoNormalMutation.h> +

+

Inheritance diagram for eoNormalMutation< EOT >: +

+ +eoMonOp< EOT > +eoOp< EOT > +eoUF< EOT &, bool > +eoFunctorBase +eoOneFifthMutation< EOT > + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

 eoNormalMutation (double &_sigma, const double &_p_change=1.0)
 (Default) Constructor.
 eoNormalMutation (eoRealVectorBounds &_bounds, double _sigma, const double &_p_change=1.0)
 Constructor with bounds.
+virtual std::string className () const
 The class name.
bool operator() (EOT &_eo)
 Do it!
+double & Sigma ()
 Accessor to ref to sigma - for update and monitor.

Private Attributes

+double & sigma
+eoRealVectorBounds & bounds
+double p_change
+

Detailed Description

+

template<class EOT>
+ class eoNormalMutation< EOT >

+ +Simple normal mutation of a std::vector of real values. +

+The stDev is fixed - but it is passed ans stored as a reference, to enable dynamic mutations (see eoOenFithMutation below).

+As for the bounds, the values are here folded back into the bounds. The other possiblity would be to iterate until we fall inside the bounds - but this sometimes takes a long time!!! +

+ +

+Definition at line 116 of file eoNormalMutation.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
eoNormalMutation< EOT >::eoNormalMutation ( double &  _sigma,
const double &  _p_change = 1.0
)  [inline]
+
+ + + + + +
+   + + +

+(Default) Constructor. +

+The bounds are initialized with the global object that says: no bounds.

+

Parameters:
+ + + +
_sigma the range for uniform nutation
_p_change the probability to change a given coordinate
+
+ +

+Definition at line 127 of file eoNormalMutation.h.

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
eoNormalMutation< EOT >::eoNormalMutation ( eoRealVectorBounds &  _bounds,
double  _sigma,
const double &  _p_change = 1.0
)  [inline]
+
+ + + + + +
+   + + +

+Constructor with bounds. +

+

Parameters:
+ + + + +
_bounds an eoRealVectorBounds that contains the bounds
_sigma the range for uniform nutation
_p_change the probability to change a given coordinate
+
+ +

+Definition at line 136 of file eoNormalMutation.h.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
bool eoNormalMutation< EOT >::operator() ( EOT &  _eo  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Do it! +

+

Parameters:
+ + +
_eo The cromosome undergoing the mutation
+
+ +

+Implements eoUF< EOT &, bool >. +

+Reimplemented in eoOneFifthMutation< EOT >. +

+Definition at line 147 of file eoNormalMutation.h. +

+References eoRng::flip(), eoRealBaseVectorBounds::foldsInBounds(), and eoRng::normal(). +

+Referenced by eoOneFifthMutation< EOT >::operator()().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_normal_mutation.png b/trunk/paradiseo-eo/doc/html/classeo_normal_mutation.png new file mode 100644 index 0000000000000000000000000000000000000000..23f8f65c1ad811c4f8417ae68c089f1736a5f77f GIT binary patch literal 1811 zcmZ`)c{tnI8V>E$G80QNZMAldrIuT5nb^YA-j-TQmzZd6BPlTvdA5{bx@{_$m|%B~&PSD3lmLi9W5Ko}R2; z1*qJrq=yBEL%bFy5+IO0)IcBah>YqL@&Kv!D;-}m*9ZKE&JC}&^NN1DDKm}~wu;x< zgzA9F1N#H;HM(`NUIlnEsA#}9k`T?vkw=|R(6?ZoJH>5>2wuhWnOJqfx|+jksEQ%{8!5&(=RB)v>p{ zTv$P{_-zbfP}hFt@FYFNbQ80yt&2GG1 zVuLH#CQwkuA$g*AuGd!YUJ@7Mg9F7e(VV+@mCIE#LQFiS3LQSw0_VmiwhJN?|u9iwrMd9Tj|7$d!XPDXc|IlmH!(ag)m?*c2N7Ri7!v(kZr#Zr_uir z&^SR-ATeEan2Pl(D;8L6afma3ra1-GczqKYUJ)wZEpE9_D<)Y1cgG^)@38tob%4vDMC#a ziem<`Ow%Z?OIu^80I#fol#~r^s!>8nsW0F1Zn|TWn}$jsr_XlR8D#eAUVj~Kswj#k1MGi?tn=T$s>IBz=MduYZIXe)1ONtG1nXNj$jd7fcO z-n_N;HcsdS%nrjmVlLpylM}yr7&v$_dwahe&eS-_uB+Va7hM@WFLWDUvqFvVB<)p4p@S(nA15ZDB+?s@+MZv|L*)G$ue7tD5Y zYbRED5-UFQ$DRel&gX<&kKB`2U9g{5j?OiSxPH!$-sv@aRAvh;somMyn^V8e25g5l zZby;2VISG5xE*eeRBXGy@1nSh(6pl*8wJ~GY(H2G;#+FD8U7Y1v8~HJexRgZABAJ- zYJu^eiNljDeu8y7e&q9PT3Swic}8g#T)bmK`$~@zwoB{vjsscxb7)ev}(& zk?$^>^J!b)6d@1W6DLWc!^*1;NQcOLcgJD6H%?b9*tQ*}!^J@80*!WH)uJe6uxvJ* zFrvrdDHXGKCl*xe!UZAZG^s~!62|}~KK4t@nC>NUnlkC2aBO8)pM>*wwg0Q9Psgmn zuE)I}j{g}gE!oUPnqq%b%&QXXf4V-30a-=3}d+2ZMXgQC^i+tZR` zp!3fK!LtP!;2KW{4)XBVn~GmIAH0(piwDt#d+Eg^x zxKHrUrDIo1hXkf;9lM$2mCt3sTVfjw%M;}=1ThR)o3@+ySEW*fLf6gar|Zo#gBzDq zL02JlLb&O`*c!-euW2(BRJ~EOdkN8s7oUkEw-63M+mzzFqp-v+YFZ;pX)LNry>|{M+^+bI!}= zb|elTWA;E=M&QiTF83PRF;nq`FF#5{m>)0#3n)-XbGv{1O?|ZVQGNXZT=chR>MHv| zTBAKU@~q9zSkq31MicxBU!yzvE0g0~xG9OfH?pbE#toT*ag1}s)J2YC-n4$ac-ehJ zmM?@bo9Y&RPo8V9W8ZtbTB%3C$NobN8sV z?J(_~-!Pe;wofo9b=N=F3Yr7;(S5;Tx6a~MUXC;AkEdd;I$8phkWXVoOYCULlk3Z> cDXt2Y-Xn0z+>mHWIl&--zQI0?U&rMC1?+;ScK`qY literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_normal_vec_mutation-members.html b/trunk/paradiseo-eo/doc/html/classeo_normal_vec_mutation-members.html new file mode 100644 index 000000000..e7f111aad --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_normal_vec_mutation-members.html @@ -0,0 +1,33 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNormalVecMutation< EOT > Member List

This is the complete list of members for eoNormalVecMutation< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
bounds (defined in eoNormalVecMutation< EOT >)eoNormalVecMutation< EOT > [private]
className() const eoNormalVecMutation< EOT > [inline, virtual]
eoMonOp()eoMonOp< EOT > [inline]
eoNormalVecMutation(double _sigma, const double &_p_change=1.0)eoNormalVecMutation< EOT > [inline]
eoNormalVecMutation(eoRealVectorBounds &_bounds, double _sigma, const double &_p_change=1.0)eoNormalVecMutation< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
functor_category()eoUF< EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
operator()(EOT &_eo)eoNormalVecMutation< EOT > [inline, virtual]
p_change (defined in eoNormalVecMutation< EOT >)eoNormalVecMutation< EOT > [private]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
sigma (defined in eoNormalVecMutation< EOT >)eoNormalVecMutation< EOT > [private]
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]
~eoUF()eoUF< EOT &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_normal_vec_mutation.html b/trunk/paradiseo-eo/doc/html/classeo_normal_vec_mutation.html new file mode 100644 index 000000000..f1f616df8 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_normal_vec_mutation.html @@ -0,0 +1,225 @@ + + +EO: eoNormalVecMutation< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNormalVecMutation< EOT > Class Template Reference

Simple normal mutation of a std::vector of real values. +More... +

+#include <eoNormalMutation.h> +

+

Inheritance diagram for eoNormalVecMutation< EOT >: +

+ +eoMonOp< EOT > +eoOp< EOT > +eoUF< EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

 eoNormalVecMutation (double _sigma, const double &_p_change=1.0)
 (Default) Constructor.
 eoNormalVecMutation (eoRealVectorBounds &_bounds, double _sigma, const double &_p_change=1.0)
 Constructor with bounds.
+virtual std::string className () const
 The class name.
bool operator() (EOT &_eo)
 Do it!

Private Attributes

+std::vector< double > sigma
+eoRealVectorBounds & bounds
+double p_change
+

Detailed Description

+

template<class EOT>
+ class eoNormalVecMutation< EOT >

+ +Simple normal mutation of a std::vector of real values. +

+The stDev is fixed - but it is passed ans stored as a reference, to enable dynamic mutations (see eoOenFithMutation below).

+As for the bounds, the values are here folded back into the bounds. The other possiblity would be to iterate until we fall inside the bounds - but this sometimes takes a long time!!! +

+ +

+Definition at line 48 of file eoNormalMutation.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
eoNormalVecMutation< EOT >::eoNormalVecMutation ( double  _sigma,
const double &  _p_change = 1.0
)  [inline]
+
+ + + + + +
+   + + +

+(Default) Constructor. +

+The bounds are initialized with the global object that says: no bounds.

+

Parameters:
+ + + +
_sigma the range for uniform nutation
_p_change the probability to change a given coordinate
+
+ +

+Definition at line 58 of file eoNormalMutation.h.

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
eoNormalVecMutation< EOT >::eoNormalVecMutation ( eoRealVectorBounds &  _bounds,
double  _sigma,
const double &  _p_change = 1.0
)  [inline]
+
+ + + + + +
+   + + +

+Constructor with bounds. +

+

Parameters:
+ + + + +
_bounds an eoRealVectorBounds that contains the bounds
_sigma the range for uniform nutation
_p_change the probability to change a given coordinate
+
+for each component, the sigma is scaled to the range of the bound, if bounded +

+Definition at line 69 of file eoNormalMutation.h. +

+References eoRealBaseVectorBounds::isBounded(), and eoRealBaseVectorBounds::range().

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
bool eoNormalVecMutation< EOT >::operator() ( EOT &  _eo  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Do it! +

+

Parameters:
+ + +
_eo The cromosome undergoing the mutation
+
+ +

+Implements eoUF< EOT &, bool >. +

+Definition at line 86 of file eoNormalMutation.h. +

+References eoRng::flip(), eoRealBaseVectorBounds::foldsInBounds(), and eoRng::normal().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_normal_vec_mutation.png b/trunk/paradiseo-eo/doc/html/classeo_normal_vec_mutation.png new file mode 100644 index 0000000000000000000000000000000000000000..7db19c822ec600b793fc464d553284f968bda428 GIT binary patch literal 1512 zcmah}e>Bqz6yK~;@^k&5g+$9MiYc_Dp-HtNKPMI9q*TOrN@E+PlBD)5KSCyRc#kCc zF%w$7S%!xmS@~7!+xjsxeb;Cfdpo`V-uvU7^SSqa?m73|bMF1zb2AV6c|8Os9Mcqu_726_S1MgUdl5ys7c|8{yqUP zH}R`z7;G_pKi)m?Lb3F2ch39Gx>vougKDkLhPcSJDxG7~*9O7Je z!-Wb|6V`qA=O~fi?Y@}89>4T&L(2wRu1|xVvXTxkH(y=9+?dH zOm)}y#osMQvplK?&-lwyd;r4kTjxciL<4e}!>@?T)=wEDlm|6NAhgLW&Mj_@Ew*IM zhQI-r8{DjiM;Ju{64R#HLTm$=N=v;|4v2Ou5w=@zj0U)jlQ1L|XpSulHHez8@mZd&z4Tj(MA7`i|vOo00)sU;60QF}$6V7s3sC%i0OqHJ&~9;jf=bbk0TWV<)xW3?H? zXRNC-gQ`0~VlPN+C-}?+d<>aiIsM{Xl#yLR8DYU>`3@yzWjxa65s15m)K>fg(BI?p zi{r0GL9M8)3z;jJA76&>3B?7wY6X^I@Ax3aarIZE^)v7m5{1jAWOwN@Q61nn{=ac3 zSLKwZZeTh%uf>1y6{p~IDbdzX?i33(2oPp?eqH>Q_N7!t!uh4mX4Vftd12u|PclTIbm-Q%8f7B3_=OSp{}H^uzG z#~C=bo_$oEN;OF8l{)9Js$QxOK;(B%LJEFv#JFpo65qz!`TUgaM0uCG?gqMea9>!( z&MJWm>T`}U_h|$19;y6O&cL7X#1axQELVW^DQMlCjV`vQ1fd8!jzLv{<=^iMoNJd= zIiz|1M-7cWQi)9*VxNC5hrZH?xedzs1(QAAp^u8I??7>+gRB_v-EKQXa z%cg6RQ?)+nz`es{(ChlvsS)xEwdND zRn_`mH8ntK1N&|U-^*|{0VbYhKQ`r>$%XgRzkn=}e@<*g6Nt?#`Mwjpgg-4~2xU^`pNL~S?{4rmdB|I#} r9VL#RQh$zwf;H10gJj + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNthElementFitnessStat< EOT > Member List

This is the complete list of members for eoNthElementFitnessStat< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
className(void) const (defined in eoNthElementFitnessStat< EOT >)eoNthElementFitnessStat< EOT > [inline, virtual]
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
doit(const eoPop< EOT > &_pop, eoParetoFitness< T >) (defined in eoNthElementFitnessStat< EOT >)eoNthElementFitnessStat< EOT > [inline, private]
doit(const std::vector< const EOT * > &_pop, T) (defined in eoNthElementFitnessStat< EOT >)eoNthElementFitnessStat< EOT > [inline, private]
eoNthElementFitnessStat(unsigned _whichElement, std::string _description="nth element fitness") (defined in eoNthElementFitnessStat< EOT >)eoNthElementFitnessStat< EOT > [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoSortedStat(EOT::Fitness_value, std::string _desc) (defined in eoSortedStat< EOT, EOT::Fitness >)eoSortedStat< EOT, EOT::Fitness > [inline]
eoValueParam(void)eoValueParam< EOT::Fitness > [inline]
eoValueParam(EOT::Fitness_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< EOT::Fitness > [inline]
Fitness typedef (defined in eoNthElementFitnessStat< EOT >)eoNthElementFitnessStat< EOT >
functor_category()eoUF< const std::vector< const EOT * > &, void > [inline, static]
getValue(void) const eoValueParam< EOT::Fitness > [inline, virtual]
lastCall(const std::vector< const EOT * > &) (defined in eoSortedStatBase< EOT >)eoSortedStatBase< EOT > [inline, virtual]
longName() const eoParam [inline]
operator()(const std::vector< const EOT * > &_pop)eoNthElementFitnessStat< EOT > [inline, virtual]
repValue (defined in eoValueParam< EOT::Fitness >)eoValueParam< EOT::Fitness > [protected]
required() const eoParam [inline]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< EOT::Fitness > [inline, virtual]
shortName() const eoParam [inline]
value()eoValueParam< EOT::Fitness > [inline]
value() const eoValueParam< EOT::Fitness > [inline]
whichElement (defined in eoNthElementFitnessStat< EOT >)eoNthElementFitnessStat< EOT > [private]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]
~eoUF()eoUF< const std::vector< const EOT * > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_nth_element_fitness_stat.html b/trunk/paradiseo-eo/doc/html/classeo_nth_element_fitness_stat.html new file mode 100644 index 000000000..876c90bbf --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_nth_element_fitness_stat.html @@ -0,0 +1,69 @@ + + +EO: eoNthElementFitnessStat< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoNthElementFitnessStat< EOT > Class Template Reference

The n_th element fitness in the population (see eoBestFitnessStat). +More... +

+#include <eoStat.h> +

+

Inheritance diagram for eoNthElementFitnessStat< EOT >: +

+ +eoSortedStat< EOT, EOT::Fitness > +eoSortedStatBase< EOT > +eoValueParam< EOT::Fitness > +eoUF< const std::vector< const EOT * > &, void > +eoParam +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::Fitness Fitness

Public Member Functions

+ eoNthElementFitnessStat (unsigned _whichElement, std::string _description="nth element fitness")
+virtual void operator() (const std::vector< const EOT * > &_pop)
 The pure virtual function that needs to be implemented by the subclass.
+virtual std::string className (void) const

Private Member Functions

+template<class T>
void doit (const eoPop< EOT > &_pop, eoParetoFitness< T >)
+template<class T>
void doit (const std::vector< const EOT * > &_pop, T)

Private Attributes

+unsigned whichElement
+

Detailed Description

+

template<class EOT>
+ class eoNthElementFitnessStat< EOT >

+ +The n_th element fitness in the population (see eoBestFitnessStat). +

+ +

+Definition at line 211 of file eoStat.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_nth_element_fitness_stat.png b/trunk/paradiseo-eo/doc/html/classeo_nth_element_fitness_stat.png new file mode 100644 index 0000000000000000000000000000000000000000..2fe8471c12871f4fdf4a45aac122c01c7eb26aa3 GIT binary patch literal 2930 zcmai$dpwle8po$dr6eipok4|=%26|f2D#s3W`v!L_C(_rkx6dpYE!RCNSidnP#A=A z&!yxgmyB_Vu`@9;4E98>G3HGBoIm#IbN1eUthJtJeV*rC>$9Hk`n@a8(ZNzm5|D(! zU{cmrW*8Vu?5@aO5*HKo6@-gfqG7kA9nM@R6pBotuz^DHyf3o;XblYw5pRT}B6r5nI#wJUTp4-5SQ+_H48T%lfHo%( zx~eM|MwCL?Osvz zz>{yAwNMae=}q(8b&K$xaXv`699|^)jH3<$GDJGNjI! z(cjUi!)kfNCuP8km)Ds2W00Pwev|UV8)C4f!HRmdlZPFbOiw5px5V2=%0v*I2ClNt zZZ9Jurj5Le4qNh{cU7l*l~@GiHpM$10VZs}W>nfCNy?iaS&bmxImm!X5|1r zZit(EjPAD)^wXxRHh0rzN^?up;oo`Byz#1Ww0KOG_3p_tje9Hz<{ zYGVP4HEq%S)y;z@DfXT`6A~1r+V14F!5oM>e;80hd1Yz0|9UwqaI)Hrc6WNvuV<%E zC#pIWd(DUbqHmnQO@Zu@vqwmF$kMV%q{DzUs+0(?E`ap2v_0TpJ>3Q9bcHt;Kn%dg zt`G8gq2u6Ti`+$;V6~(UPT`dA?);2cnlA*q9D0ct{4Q$0#D@COoW^ct@Low}TcZj> zFGg1N2FNm0- zvA5mxq;~oil>7?1I=4!8mh49R#D4cK(5}F#+8d03SSZ+-Ac-^~=!sn5Sn^tEli-s) z;`w>?kJkyS$-g&r?6$e`X*c81m#=54H#RRR*erfJZA{w~J&7Pw*f#iRwRPapKSKIP zvbW|K1Z^eS?fFl}QBk%wRomH0Z3q##cbE#tC6G`5 zo48z<%;YR^V}6lYhm3~-<}h%7jD?J7HL8<1Lw!AQ=a17fHfsk38w*!1366Y>6Rd{h zL(FR)b?NnI>oo-i;l%Tzd$DCbxS6pD+@O)w)jw5rsx@Rh=!H$@%6?iA`n-Ao-JZ=m zf}mV1Pf>lMLPDS7e4r<)BzG^3_MZdi)H(b;vKf@CrERF_TEO~E6L9uz0qUE@nc7BG zv#0RSO~h-D+rk-yxX*jg-w=>7@o2O6e9H=r*HheEB#p1H8Wj$j~V zR?KIF-|Hg1Y2tImZSj`41TDyqfB@HyWxVRLdR;sp_QV1Ys)YXX9i~b2d=CO!Es3WO2r35C%?RxJ zc*xKoZ&vo3y=LHJ3@C3-aHnN+6?+P2nppjTeHOrNXE*Zs0QWoR%dqpET>Q?q5!axA zWLj6CJ~!@wqW@4`wFpmNJ}EzKq(y1b3;j#6FeE8IVMy0oXW`&m5q&hp8?d>!mj+foh+~ zP-e+q#v>TWaNSO{i-ENKkeL_F)h8O{s{$utdd z+M-`3&B>%lvm+3U@s-J0HBE=8Q)L$JHJ1waebSjXnG!A=%(`?QRJHF0H9IH5wR78trOOQg!BAEjFYslV}jt;-d6ZNHj6 z=$rlXHvLv9_6kNye`ndh&==JCg8j1QoPA`9&lCZS?;c)!yoJI;6!31VH%)w@nW)sD zhfdK(#Q6t^**pbwZCwi4qQbtIR*D<5QtMS#lqQa@RR>`+Ns_yAgS1Zg_S*I)c4Px@ zwUT&-R|1j#y$6dM;JAB>o=F3+yR~oaOdM_*3Rv$76T)Esp;Y?Y$!Il-1!i)cJb&thZMH1 z94l|(Wn%fq(Tw~RmZP7#Olr@T&1VoDDKl@UaCdJ|MvMt3soLv+|EcD8?07-hmC>oc zzm0Z`<=BXnsZySye!~X)oEBp$iL`-jK$yY)0j(Ppw*DR)>E9@(g^AmC{FQ3`K${C@ zlG1SF)=$E{3Mzlny4Mb%R$KV?bQ49oMC*>|6KuRyV4s+oe?AXM!NMW z<68(HKS>^X`x&$9zglETZ2wXO>9&TS&>T%n$C+k;L`+n-GSWND2oPR#BS-Ed%LB`+ zXLI&bwHx1C&x^L;zmGiSfO>)}(TTpEVbGiEg&uFuz8~v>x^*~VcGqw*Rv@V++{wN9 z;814_w3X|-T6x4ld!`&DpKkoo#H(gO-UHdj1#=jWH!^We$f!XwwsOW8!B>teo1`|fa1hf&}hK_BZZ3axXRgDrNkV2|tldu9vfOk$wt#RNw{9uvU1 znEr5tUWU(mnlsqU%pZ50H1tkdYa5s*&`Ji5m6#CjhyiX=&u`e?H1Kt)>0@6RDo|ER z)Cv2TGnO<${EZ_69GmJICm~Ne6nhiyxt9;;lA(ubM9jQIN(O1!Ey+4GR#e+!O+ZNx zoXeB4R0h|aIvV-$4~dc4fDEV$h;ImAi)6-NLg)tS5dAmX$5vKj2QDcr~O#$p}A zFpbNBQrtpmAOADHS=PO^=8=qrUbJR?;9G}zgC1S=e>h2M-O0S?&GL?HYR?DGmfS!` i-sH>%(d$BXZ6mnpM0x^yZolY(46` + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoObject Member List

This is the complete list of members for eoObject, including all inherited members.

+ + +
className() const =0eoObject [pure virtual]
~eoObject()eoObject [inline, virtual]

Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_object.html b/trunk/paradiseo-eo/doc/html/classeo_object.html new file mode 100644 index 000000000..fb030380f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_object.html @@ -0,0 +1,100 @@ + + +EO: eoObject Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoObject Class Reference

eoObject used to be the base class for the whole hierarchy, but this has changed. +More... +

+#include <eoObject.h> +

+

Inheritance diagram for eoObject: +

+ +EO< F > +EO< double > +EO< EOT::Fitness > +EO< Fit > +EO< Fitness > +EO< fitness_type > +EO< fitnessT > +EO< FitT > +EO< FType > +EO< phenotype > +EO< PyFitness > +eoDistribution< EOT > +eoFactory< EOClass > +eoFactory< eoOpSelector< eoClass > > +eoFactory< eoSelect< EOT > > +eoFactory< EOT > +eoParser +eoPop< EOT > +eoPop< Dummy > +eoPop< PyEO > +eoRng + +List of all members. + + + + + + + + +

Public Member Functions

+virtual ~eoObject ()
 Virtual dtor. They are needed in virtual class hierarchies.
virtual std::string className () const =0
 Return the class id.
+

Detailed Description

+eoObject used to be the base class for the whole hierarchy, but this has changed. +

+eoObject is used to define a name (className#) that is used when loading or saving the state.

+Previously, this object also defined a print and read interface, but it´s been moved to eoPrintable and eoPersistent.

+It is recommended that you only derive from eoObject in concrete classes. Some parts of EO do not implement this yet, but that will change in the future. eoObject, together with eoPersistent and eoPrintable provide a simple persistence framework that is only needed when the classes have state that changes at runtime.

+

See also:
eoPersistent eoPrintable, eoState
+ +

+ +

+Definition at line 55 of file eoObject.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + +
virtual std::string eoObject::className (   )  const [pure virtual]
+
+ + + + + +
+   + + +

+Return the class id. +

+This should be redefined in each class. Only "leaf" classes can be non-virtual.

+Maarten: removed the default implementation as this proved to be too error-prone: I found several classes that had a typo in className (like classname), which would print eoObject instead of their own. Having it pure will force the implementor to provide a name. +

+Implemented in EO< F >, eoFactory< EOClass >, eoOpSelMason< eoClass >, eoPop< EOT >, eoEsFull< Fit >, eoEsSimple< Fit >, eoEsStdev< Fit >, eoReal< FitT >, eoBit< FitT >, eoPBILDistrib< EOT >, eoParseTree< FType, Node >, eoString< fitnessT >, eoParser, eoRng, eoOneMax< FitT >, EO< double >, EO< EOT::Fitness >, EO< FitT >, EO< phenotype >, EO< fitnessT >, EO< Fit >, EO< FType >, EO< fitness_type >, EO< Fitness >, EO< PyFitness >, eoFactory< eoOpSelector< eoClass > >, eoFactory< EOT >, eoFactory< eoSelect< EOT > >, eoPop< PyEO >, and eoPop< Dummy >.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_object.png b/trunk/paradiseo-eo/doc/html/classeo_object.png new file mode 100644 index 0000000000000000000000000000000000000000..20bff00ed12db035d5c64f3b0faab6147ea53e6e GIT binary patch literal 5899 zcmc&&eK?d^|0mUKwb+V?jr~z;BNU=y*j}tsjFr64i%}%TOBl_L8I)d>OfQQkgQ+c4 zgPD6{EEA)`tYm~TcQXyUdFLMTc2A6%c}Dv@|Nj1YuIjqJ_x(NRT<1FXb$`F-d_JG^ z&GPZ~&|Yn{T0=ua`_RDyz8V^ukcP%`_Hr%tNL&2zGiqn(bHvYGrBbPzDpezcfxD(| zeS8`l8_7>q1M043lCSqsjUR`=2n~%5cMcuc>vyJ5S`-pHevq>Q_4hIbdf@9DJ2Q)Y zG_+qWUX1s$oBws&mEWX3b}5Cw&#|}h?M&@{s1&6cW${$^1KnKl!r6XvqL*94OVGRMco2aW4uH~y#Y-jSmJdLlfjz-RfJ*W{D-=Fs8to3ifZU*u}r7U z-DKO=$^&@y5ZJ5;o#%T%1=Q3g$NRJCQybYUzGbh_Q_ipmw|%0ZG*z?z_WKUR5^mKc zv_7~@=YO|C%2}11mH90<@q-241G=;cP=F7jL^PCiAwnCFqoikcNXj=8jcy2yxIuWQ ze3}B-K?CTiGu3ZPngyl=`@YnzvRY78JebC65ge8`zuICWeQd!Zh%vlaQ$a`sG->wF zy5_{D9MHC@awa|D7H-Y1PiOJ)DoaWTujl42v!zca^J5qM4?fz1rBXcSr)&bZ0^%KE z+}gW2pw!pkAVIuS%107B70sQ~SQ5}3zq5L@|0ie6#>!z5sf;y|7eLb|9u8$Ge+1y*?;VL=uEZ1e<$ocEI zNfWYA6&$N0yEiXb(}J1f<ky1oTpkKLWe+#gV=SK$TFz znutI(U|Maf34J6UFL5G~`^tuDk)t{lQL6J9j=NI1Ev?BG*t}s^2q2ke{6R z9p4vy{%Z8%led$-T3l1IWHs}6)MRj2b&QxPl)8K)#SKj3(~Q?TN)&z)!emI*`}CG}K*6ShFhKNwOTb#}UgDc17GK~rTZl95Z+_kuH^9Y+2SI3oO#TIM!#hJ<@mIvlY4E`$3b;-|c@dc08_B9}g z_RC^|MUp>;X!%juMJcHUK_dEE95Xld4Mz^jZ$uw0tS=s z!pp*v4P0(2;f$qRv#P`jg3k%)q%svKeb$HtAmBt`eZFoxa%Zqet^r~SHw1hxg;=R~uzP8&`#7&FGJL@sRg%zU(nrhZE}rZrD& zYAsZ;YFKGVh4#=Y59pTv26k%Q#0yD{e;oP9R%*ifB(_VwJh!33bhyNQiKU{i7A?Hl z^&l$1>8Q}rD-jBveutMa@-)r*2cKk^op14$gz6c_mX?-+?MtAQBTPO(y97I;#T+3^{ER;*8|XXuPY1tRnz_YOf?CYwwEY25Gt%z}*UGylrlp zh~0zR54k3dl@^I@y)G@(n}9_+;P$U#vMDhuMWbNh!h{=3+A0(iP32=^xKb-GUs)m> zU`z#5xU=ABvs>_L8YMC{S{uNYe2IhZ5wLklJD`K0(#i7<8 zI!?{5Z&zB~MmVwtxFr(nHHvuS@@pl?iPm8Px#osx+&TSk$g(=gWUD-_&3$R*AE8aM zhhrDj2jCLru{JRa$VbAR|5T~8MX%$0v9&jEU;Ls$NDh& zv3!1Qe91QHv9%BeV#bQc&A<;)*^&V}aD{9@c7_xm)d`@E*jVp|ThF6UL62UMlD7PU z({Ii(`IjD7pw)8Xto2{%pUfKHSlpi_C`K+HSV9D=E0X+urAJ5egLX(KHusO-n|bBn z=ISz>f=5~C#T8)XiP`y=pV&v5@{*y5Z{<5}`l;^&Jh!5*AMz^r>8v#%Ry?jU3uke? zNjk6id%o!S8_tu$T3=i~=6YZgw7m%br<*A|T zxOpHksC*VVue(egO+sWRAlTo z@9frG()X^l1j1_nIQ;)+tkwwmr#2R@soj7DaeFNKgY2QqhK7{#8>$jw-)NSAIhJNn?y$@ScN za`H2WjgfV!hR%{4Pcjpvn17c7w=nnjGsh#-yhLsLr(M`KeZBBASa+i9Og}MCVBAz3 zVOmj{v;JC-R)(l{OLsQm{(J(H3M!w>1n@(`;h}mw?U>*}&rVfabRu^vVsLAav|&dT z`Tbj?=h5vqF+L^`6eL={bjr1_H!3=AEPS<5+|HSGO80hqQ~3@ zK}F9VU3oCyyDhj=5+agBZ0SR_{c^KJ@rHw(xYt9EHbNX91my&|;9MU`+zYiH6=v`M zmRt2p*mK>D7?#*Y7F}(@kcY_;Wm6mbPNS5&Q?SGi;n`j!EXmBLQB-l|ZG7e4CBU3% zw7k4&<}-@L|8NLJ0iu$g`r0Sob)?ZPt~#_C0(iVz=c?$LONA6@K3cad{&5hrzlfdC z@?!Ci-Naz3)%hlB!}>f?Y-QF!+?yj`g>)RQD=M8S1{fomb2WLOq&<`UxXP_n5dknJ zGn4z{EYghV_A>uzd2Qcq1P3kZNO?Mh39P}0xZsIx(qZQ?>BD6lF(-gLy^pihjVjoX z7l$HGpV$Ywjv4cng)`6Cm$Mbt$ouc`X_HTFzK5NTeu*2>T`M&h5t}M^5Q9&logyW! zZxohxu!PBUZkV9v>XT2cdJ#}Iij~$)!v|!{``}FA?bojp76RmKdGd9z-7tQq?nBC3 zg{2F;eLA{ORC7!Dx=+TI&m{u9dIZseC?o_-pI8VOGfC!Aw>y?K$UANk$k_^#jQJiE zBT3w1W%bt@ym=^x5P@g+;oQc4|m5!Fheb2jw*L(epju<4I3k}Smmks>W;&)aDRY->1?}j$q;`=fnx6n@xyg`m?WHYut@ zh3vbz^*i{S4roK{?P2_h{!tg&i-<9HE{Qyv&#rQtOxGS)y28ge(hg^wsjy(qNVzzE zMiWr~Hv-GFhckGXNaBHH zLfoP{AMw(*U5o6Xy-kY8o{VxUT$$%cp0*;089Sd$oAEx3!?TCM-qZ(NOe!RNINr>s zO4Iy&aM0v;O9Z+J_yWn#0Ye1YT2^Y9Nx*Gs!BjsLMf}VBs5^AbD#p-o_Be9D3<#)T zTjDz^wp+utbB&xA73|~9uI;S^ZZe0k1^xx4oI-&&t$;YH_Rf~d2yyRJSKs|XJ~itf i&`@T9J(~S0#Iq1{BeSh~z3R%f#vym_1C{%5Xa5b}%;Wn2 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_one_fifth_mutation-members.html b/trunk/paradiseo-eo/doc/html/classeo_one_fifth_mutation-members.html new file mode 100644 index 000000000..851ae23b3 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_one_fifth_mutation-members.html @@ -0,0 +1,41 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoOneFifthMutation< EOT > Member List

This is the complete list of members for eoOneFifthMutation< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const eoOneFifthMutation< EOT > [inline, virtual]
eoMonOp()eoMonOp< EOT > [inline]
eoNormalMutation(double &_sigma, const double &_p_change=1.0)eoNormalMutation< EOT > [inline]
eoNormalMutation(eoRealVectorBounds &_bounds, double _sigma, const double &_p_change=1.0)eoNormalMutation< EOT > [inline]
eoOneFifthMutation(eoEvalFunc< EOT > &_eval, double &_sigmaInit, unsigned _windowSize=10, double _updateFactor=0.83, double _threshold=0.2)eoOneFifthMutation< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
eval (defined in eoOneFifthMutation< EOT >)eoOneFifthMutation< EOT > [private]
Fitness typedef (defined in eoOneFifthMutation< EOT >)eoOneFifthMutation< EOT >
functor_category()eoUF< EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
genIndex (defined in eoOneFifthMutation< EOT >)eoOneFifthMutation< EOT > [private]
getType() const eoOp< EOT > [inline]
nbMut (defined in eoOneFifthMutation< EOT >)eoOneFifthMutation< EOT > [private]
nbSuccess (defined in eoOneFifthMutation< EOT >)eoOneFifthMutation< EOT > [private]
operator()(EOT &_eo)eoOneFifthMutation< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
Sigma()eoNormalMutation< EOT > [inline]
threshold (defined in eoOneFifthMutation< EOT >)eoOneFifthMutation< EOT > [private]
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
update()eoOneFifthMutation< EOT > [inline, virtual]
updateFactor (defined in eoOneFifthMutation< EOT >)eoOneFifthMutation< EOT > [private]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]
~eoUF()eoUF< EOT &, bool > [inline, virtual]
~eoUpdatable()eoUpdatable [inline, virtual]

Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_one_fifth_mutation.html b/trunk/paradiseo-eo/doc/html/classeo_one_fifth_mutation.html new file mode 100644 index 000000000..c223ec005 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_one_fifth_mutation.html @@ -0,0 +1,198 @@ + + +EO: eoOneFifthMutation< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoOneFifthMutation< EOT > Class Template Reference

the dynamic version: just say it is updatable - and write the update() method! here the 1 fifth rule: count the proportion of successful mutations, and increase sigma if more than threshold (1/5 !) +More... +

+#include <eoNormalMutation.h> +

+

Inheritance diagram for eoOneFifthMutation< EOT >: +

+ +eoNormalMutation< EOT > +eoUpdatable +eoMonOp< EOT > +eoOp< EOT > +eoUF< EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::Fitness Fitness

Public Member Functions

 eoOneFifthMutation (eoEvalFunc< EOT > &_eval, double &_sigmaInit, unsigned _windowSize=10, double _updateFactor=0.83, double _threshold=0.2)
 (Default) Constructor.
+virtual std::string className () const
 The class name.
bool operator() (EOT &_eo)
 Do it! calls the standard mutation, then checks for success and updates stats.
+void update ()
 the method that will be called every generation if the object is added to the checkpoint

Private Attributes

+eoEvalFunc< EOT > & eval
+double threshold
+double updateFactor
+std::vector< unsigned > nbMut
+std::vector< unsigned > nbSuccess
+unsigned genIndex
+

Detailed Description

+

template<class EOT>
+ class eoOneFifthMutation< EOT >

+ +the dynamic version: just say it is updatable - and write the update() method! here the 1 fifth rule: count the proportion of successful mutations, and increase sigma if more than threshold (1/5 !) +

+ +

+Definition at line 177 of file eoNormalMutation.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
eoOneFifthMutation< EOT >::eoOneFifthMutation ( eoEvalFunc< EOT > &  _eval,
double &  _sigmaInit,
unsigned  _windowSize = 10,
double  _updateFactor = 0.83,
double  _threshold = 0.2
)  [inline]
+
+ + + + + +
+   + + +

+(Default) Constructor. +

+

Parameters:
+ + + + + + +
eval the evaluation function, needed to recompute the fitmess
_sigmaInit the initial value for uniform mutation
_windowSize the size of the window for statistics
_threshold the threshold (the 1/5 - 0.2)
_updateFactor multiplicative update factor for sigma
+
+ +

+Definition at line 195 of file eoNormalMutation.h.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
bool eoOneFifthMutation< EOT >::operator() ( EOT &  _eo  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Do it! calls the standard mutation, then checks for success and updates stats. +

+

Parameters:
+ + +
_eo The chromosome undergoing the mutation
+
+ +

+Reimplemented from eoNormalMutation< EOT >. +

+Definition at line 216 of file eoNormalMutation.h. +

+References EO< F >::fitness(), EO< F >::invalid(), EO< F >::invalidate(), and eoNormalMutation< EOT >::operator()().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_one_fifth_mutation.png b/trunk/paradiseo-eo/doc/html/classeo_one_fifth_mutation.png new file mode 100644 index 0000000000000000000000000000000000000000..5f4e8d6d2542cdbb173ce709c44153db71fd891e GIT binary patch literal 1934 zcmah~c{JPU8ctP9tC*HswVyDt)xMOpN-dE=EEg57tzv5xA*jiS&|0e~QtPBrRkc@9 zbt42(OF9!SMM;FJpIS0v#4-)VjX7ujnRCy%=REKCJm2}wd)`0Z=Y7A2uFi1rvvOxa zAdtBI54LU~(1}ff{wjP@a7qNz3KA9EI$?Me`}2>gPKhA#2#$2PZNbd zc=hQV_&N2OT~uy`sYT{eUU~H#Hfsl+(z>f5vVnJs-x>0fRgND35F-ErpXV!-1-Pb- ziw%QkluH;;P&ZaPRDCKpa=_F>B|tgbRckk1jE-z%U9D=;?=*VUoMQC~r_-13xTAWb zq*lmJTbw*+6fcplx5sRk85(NU-mMSJsTQkET3Q$&c^18X4=?E%50Y^!-;Oh@AHoZx@GbUn(N zdr5&zHp*}n-tD>C^`w^j_CYM>^M9U`=iA&zh@ zo4)$+?`WvsHBRYaijD-QS|1>>+)PMw1RzN;f)b4Q-Wak26=dY1xQ*L6dFHkroe_ML z&kWpsqw^YO_%acD-CnfTPS;cRHi}0MgO88S5o+Kg#X4Ix7FJ5`(rMdD`cnf7?5jh$ zg^_yfl3k)`8JZsbiA%99b=o90heHqAD|^eqz2>azjgj&*i=8;1M3ELBFSY@RssF%P zgy5(U%jK;*lPs_!_Z*J4JoSS7WXH?}wcoyI{&4-!IT=Nyh(=Vj7`)wI=AUX|3O{lkj%nAR$;Syh29^u4e<(YD!o3{oS%P}=pX^qXh7L5@DZ$vEgzAkXK{pgs-g zxZuE>QMBx;_>YcamWo=9`rm;LutdrAYO*nFBH4dh;VPN5kB-wCYr2Wag2L6M*yXAT z-Xg`mHOfS%xVw3?Vdb^R^B0lV2rE5qL`jC_zd^eZMKT4nGng=Kw4D zmZ#}urs9YnmDWBt22od7C?!_>U*IL6Bfs8f+8tJa;bl4xcs;tuW`YuWASL_QZkk^0 zqA5pnomD;IR+OLlMxV@7@ETiG!4!aH=;hXw562JfR@`EHBeK>rWSc= zo@Nf)wB|VGq~3lnZv#%S>)sLPOAoKJ%XS^>s#mH3TI!&$rZA=lQSMui8j~vO7;I%- z;pY&Uj?bD68-ihiV0$mf9glqQtY!C%S@zBiT|>d*ApOpN1AhE6xYI1i1T$Y5=n@rh z4-nKVmtT%KgOFkQp=D?VoF8jCE3!MlnT)wshFf@@1BwzSc}|K|ZIXV0)lj=_G~1Fs z{1$~#Ll=A_{x$XOJ>OmN43~%6_-he+jDHo(vu%k2n#6gllD8@i)Yt42As3*Jl%XwRA6RGefggGbJH79 zudahl$C@4i>`!dAjkQE&(M`1Eig>=HLFuWF_q=)F#jPl(xhJE3LswdorgOHUqgE1t z<3-%v6vIVPuodzF68CYUKsd6+W}Y(5C8aE2=TH&oHwRlNo+ryvPYvDvm!tuv-=_G= Z6JP7crI(bI1fM6!9_DQO%KFxW{{r=* + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoOneMax< FitT > Member List

This is the complete list of members for eoOneMax< FitT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
b (defined in eoOneMax< FitT >)eoOneMax< FitT > [private]
B() (defined in eoOneMax< FitT >)eoOneMax< FitT > [inline]
className() const eoOneMax< FitT > [inline, virtual]
EO()EO< FitT > [inline]
EO() (defined in EO< FitT >)EO< FitT > [inline]
eoOneMax()eoOneMax< FitT > [inline]
Fitness typedef (defined in EO< FitT >)EO< FitT >
fitness() const EO< FitT > [inline]
fitness(const Fitness &_fitness)EO< FitT > [inline]
fitness(performance_type perf) (defined in EO< FitT >)EO< FitT > [inline]
fitness(void) const (defined in EO< FitT >)EO< FitT > [inline]
fitness_traits typedef (defined in EO< FitT >)EO< FitT >
invalid() const EO< FitT > [inline]
invalidate() (defined in EO< FitT >)EO< FitT > [inline]
invalidate(void) (defined in EO< FitT >)EO< FitT > [inline]
invalidate_worth(void) (defined in EO< FitT >)EO< FitT > [inline]
operator<(const EO &_eo2) const EO< FitT > [inline]
operator<(const EO< Fitness, Traits > &other) const (defined in EO< FitT >)EO< FitT > [inline]
operator>(const EO &_eo2) const (defined in EO< FitT >)EO< FitT > [inline]
operator>(const EO< Fitness, Traits > &other) const (defined in EO< FitT >)EO< FitT > [inline]
performance(performance_type perf) (defined in EO< FitT >)EO< FitT > [inline]
performance(void) const (defined in EO< FitT >)EO< FitT > [inline]
performance_type typedef (defined in EO< FitT >)EO< FitT >
printOn(ostream &_os) const eoOneMax< FitT > [inline]
EO< FitT >::printOn(std::ostream &_os) const EO< FitT > [inline, virtual]
readFrom(istream &_is)eoOneMax< FitT > [inline]
EO< FitT >::readFrom(std::istream &_is)EO< FitT > [inline, virtual]
setB(vector< bool > &_b) (defined in eoOneMax< FitT >)eoOneMax< FitT > [inline]
storage_type typedef (defined in EO< FitT >)EO< FitT >
worth(worth_type worth) (defined in EO< FitT >)EO< FitT > [inline]
worth(void) const (defined in EO< FitT >)EO< FitT > [inline]
worth_type typedef (defined in EO< FitT >)EO< FitT >
~EO()EO< FitT > [inline, virtual]
~eoObject()eoObject [inline, virtual]
~eoOneMax() (defined in eoOneMax< FitT >)eoOneMax< FitT > [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]

Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_one_max.html b/trunk/paradiseo-eo/doc/html/classeo_one_max.html new file mode 100644 index 000000000..bc4b01f98 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_one_max.html @@ -0,0 +1,219 @@ + + +EO: eoOneMax< FitT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoOneMax< FitT > Class Template Reference

Always write a comment in this format before class definition if you want the class to be documented by Doxygen. +More... +

+#include <eoOneMax.h> +

+

Inheritance diagram for eoOneMax< FitT >: +

+ +EO< FitT > +eoObject +eoPersistent +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

 eoOneMax ()
 Ctor: you MUST provide a default ctor.
virtual string className () const
 Return the class id.
void printOn (ostream &_os) const
 printing...
void readFrom (istream &_is)
 reading...
+void setB (vector< bool > &_b)
+const vector< bool > & B ()

Private Attributes

+std::vector< bool > b
+

Detailed Description

+

template<class FitT>
+ class eoOneMax< FitT >

+ +Always write a comment in this format before class definition if you want the class to be documented by Doxygen. +

+Note that you MUST derive your structure from EO<fitT> but you MAY use some other already prepared class in the hierarchy like eoVector for instance, if you handle a vector of something....

+If you create a structure from scratch, the only thing you need to provide are a default constructor IO routines printOn and readFrom

+Note that operator<< and operator>> are defined at EO level using these routines +

+ +

+Definition at line 31 of file eoOneMax.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + +
+template<class FitT>
eoOneMax< FitT >::eoOneMax (   )  [inline]
+
+ + + + + +
+   + + +

+Ctor: you MUST provide a default ctor. +

+though such individuals will generally be processed by some eoInit object +

+Definition at line 37 of file eoOneMax.h.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class FitT>
virtual string eoOneMax< FitT >::className ( void   )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Return the class id. +

+

Returns:
the class name as a std::string
+ +

+Reimplemented from EO< FitT >. +

+Definition at line 49 of file eoOneMax.h.

+

+ + + + +
+ + + + + + + + + + + + +
+template<class FitT>
void eoOneMax< FitT >::printOn ( ostream &  _os  )  const [inline]
+
+ + + + + +
+   + + +

+printing... +

+HINTS in EO we systematically write the sizes of things before the things so readFrom is easier to code (see below) +

+Definition at line 52 of file eoOneMax.h. +

+References EO< F >::printOn().

+

+ + + + +
+ + + + + + + + + + + + +
+template<class FitT>
void eoOneMax< FitT >::readFrom ( istream &  _is  )  [inline]
+
+ + + + + +
+   + + +

+reading... +

+of course, your readFrom must be able to read what printOn writes!!!

+HINTS remember the eoOneMax object will come from the default ctor this is why having the sizes written out is useful +

+Definition at line 72 of file eoOneMax.h. +

+References EO< F >::readFrom().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_one_max.png b/trunk/paradiseo-eo/doc/html/classeo_one_max.png new file mode 100644 index 0000000000000000000000000000000000000000..43848a8ef1865b463d8c7bb3a74ad97cddf302bf GIT binary patch literal 859 zcmV-h1EltUAF5g*}ka(2M+vG@H0O;FSmQ) z@!uA|J+6vB9`}pl*Ufg|z<~n?4jede;J|?&f(yRe|997mHV3}vdMcve<3takA?6k0amsXDZ3+Ox8n2|s-CYy@+7Dvbr)cdWzH zwfq9YwD*Ioh`bv|{-h8)7kRw4ziAFWFSsq@TmjQ*(RQqPoc3(ZSKuLI`F);cyV;cO zd>E&lv)yIz3w+cj<`TZCy*WNz>WcV60}gyUe(Fc(#dceM_;tGru00i()@MYetuyi4 zLs*oPl(tUAFP!bbfdjt){tz|^{_@2Y92+=r;J|?c|690p^FY+3+a|z)3vfezM_p&9 zrqeY3$Dl&E`=jGlG~eqdThk@*tjy?7`_e*9oZ@MSd{PG~vF40ZI8FFOFBUmvr*X|k zdbw$*DPAM;fSt4E`TN}8YGwPT1{^r>55Z6U=)Bne^f#8pcIy8{or#M}UmuHKINN~( z2M!!KaNxj!0|)*VIPGt(7#EBH9Jpu%mGW1GTmB%ms%i5iKNN41r))P3@$plR!fh~$ z{IIQ3eC%<15H&v+;aNxG%Ko(0^?1w2wl8#sIpBo|uSK)KL#fn z;GA0SkQ~lyKZu<5gCcK6kvEKoX{RZEVB|d2e&o0W;lOJp*F0pqpJlI7comA&Fx#8s lv;BlifddC#6EFGE`4@UbQbOuEjMxAG002ovPDHLkV1kilsoDSl literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_one_max_eval_func-members.html b/trunk/paradiseo-eo/doc/html/classeo_one_max_eval_func-members.html new file mode 100644 index 000000000..497a13cce --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_one_max_eval_func-members.html @@ -0,0 +1,21 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoOneMaxEvalFunc< EOT > Member List

This is the complete list of members for eoOneMaxEvalFunc< EOT >, including all inherited members.

+ + + + + + + +
EOFitT typedef (defined in eoEvalFunc< EOT >)eoEvalFunc< EOT >
eoOneMaxEvalFunc()eoOneMaxEvalFunc< EOT > [inline]
EOType typedef (defined in eoEvalFunc< EOT >)eoEvalFunc< EOT >
functor_category()eoUF< EOT &, void > [inline, static]
operator()(EOT &_eo)eoOneMaxEvalFunc< EOT > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< EOT &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_one_max_eval_func.html b/trunk/paradiseo-eo/doc/html/classeo_one_max_eval_func.html new file mode 100644 index 000000000..fb5a7d848 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_one_max_eval_func.html @@ -0,0 +1,92 @@ + + +EO: eoOneMaxEvalFunc< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoOneMaxEvalFunc< EOT > Class Template Reference

Always write a comment in this format before class definition if you want the class to be documented by Doxygen. +More... +

+#include <eoOneMaxEvalFunc.h> +

+

Inheritance diagram for eoOneMaxEvalFunc< EOT >: +

+ +eoEvalFunc< EOT > +eoUF< EOT &, void > +eoFunctorBase + +List of all members. + + + + + + + + +

Public Member Functions

+ eoOneMaxEvalFunc ()
 Ctor - no requirement.
void operator() (EOT &_eo)
 Actually compute the fitness.
+

Detailed Description

+

template<class EOT>
+ class eoOneMaxEvalFunc< EOT >

+ +Always write a comment in this format before class definition if you want the class to be documented by Doxygen. +

+ +

+Definition at line 26 of file eoOneMaxEvalFunc.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
void eoOneMaxEvalFunc< EOT >::operator() ( EOT &  _eo  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Actually compute the fitness. +

+

Parameters:
+ + +
EOT & _eo the EO object to evaluate it should stay templatized to be usable with any fitness type
+
+ +

+Implements eoUF< EOT &, void >. +

+Definition at line 45 of file eoOneMaxEvalFunc.h. +

+References EO< F >::fitness(), and EO< F >::invalid().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_one_max_eval_func.png b/trunk/paradiseo-eo/doc/html/classeo_one_max_eval_func.png new file mode 100644 index 0000000000000000000000000000000000000000..4bc3cc9deeb2449f2f8c75afd6825c23c50ab3b3 GIT binary patch literal 1405 zcmai!dpOez7{|9Z_bqpR;*cytWlKFSr(ALmvu8&|^33dX&}Fj6(TM2hp2?-uDz_!q z%%$U&HvMKcQ9Q{d2@7#(sFhpkw6prNe|nzJ`+mRgpYP>)GYNPPwDLA(7z~E?@^mG_ zU~q=aLr8=y&wlY5lL5y zNp~F4HQ+tzYxb_6*vb}o?z!Xbx((ZHU14xui*Ik$cBXD1{2Y7jP-#Nzh#^AZ4HE$f z_4aLw#kYl}N_E^dP#k@8!U@EArizMTS7;Gq^FXvR-`^#lOl3}K63d@DsHd(#JWb_mbbtKEK#RuD0?mCx^ zmgg#P(x-O&a`PwzLhR$wvr2STz8O1H{Xq`=qVsHjYSlhd{s)8ibV^+I<=8S(Wn89n zF_T0_MqUSSWh#sd+`PFov~O^T|63s^t8v8?@TOuchYK+t!7?ov4rhxSn}}p;KtuO& zi`E7LVXD~%PFWD7D%_~`TGltV*?vz49Io{z-8EZB|Fd9scZof70u|=hW_Ntyl}cS_ zl{}qowBqN&Q)8554)h?3PfXO1ByjG5lBtpSv?(N`^`cmhv)n4wj0U439r$nRkBYN~ zmE6tD_X64)jO6wMC1f=Q|0gNAI|rhrBMcd*lZnTb&tGYsB zDsV3KHwNH;rf0|6qEiwf;K$uowaj63qU*&$tr6^=2e;VX@{SqIX{by#yP1Qc6 z?6AvpOkUaBnD^{afKeMhN2m9RaT<@-*PnNFhJKZBb}bxc#EVa!B{s5(qT5w>qCG8C zW64@U|Kei=Nez}&!$FJ*sNE1zbzOTsqB$TA$TD{kV9){F#_lL%_XmI1)wjxdf>+kQ z4R1ONsy|x4wtqQhu2S<%f2X{4B<7*>rj7?HqjF^2^Oyzoq53fkj()gkh~+dUEU@e% zv_)crt2>C__akFK&)rCsep;{+6~wmZ&6g!LYclZ40l)L+cM9Z^uOWX0GxWozqoQM) zq)#Nh7lBM3+z(1_MdX*CLXn2JD>>9C{dA%&lu#WS)h_SCzM#Oltk + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoOneMaxInit< GenotypeT > Member List

This is the complete list of members for eoOneMaxInit< GenotypeT >, including all inherited members.

+ + + + + + + +
className(void) const eoInit< GenotypeT > [inline, virtual]
eoOneMaxInit(unsigned _vecSize)eoOneMaxInit< GenotypeT > [inline]
functor_category()eoUF< GenotypeT &, void > [inline, static]
operator()(GenotypeT &_genotype)eoOneMaxInit< GenotypeT > [inline, virtual]
vecSize (defined in eoOneMaxInit< GenotypeT >)eoOneMaxInit< GenotypeT > [private]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< GenotypeT &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_one_max_init.html b/trunk/paradiseo-eo/doc/html/classeo_one_max_init.html new file mode 100644 index 000000000..3101ee24e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_one_max_init.html @@ -0,0 +1,98 @@ + + +EO: eoOneMaxInit< GenotypeT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoOneMaxInit< GenotypeT > Class Template Reference

Always write a comment in this format before class definition if you want the class to be documented by Doxygen. +More... +

+#include <eoOneMaxInit.h> +

+

Inheritance diagram for eoOneMaxInit< GenotypeT >: +

+ +eoInit< GenotypeT > +eoUF< GenotypeT &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + +

Public Member Functions

+ eoOneMaxInit (unsigned _vecSize)
 Ctor - no requirement.
void operator() (GenotypeT &_genotype)
 initialize a genotype

Private Attributes

+unsigned vecSize
+

Detailed Description

+

template<class GenotypeT>
+ class eoOneMaxInit< GenotypeT >

+ +Always write a comment in this format before class definition if you want the class to be documented by Doxygen. +

+There is NO ASSUMPTION on the class GenoypeT. In particular, it does not need to derive from EO (e.g. to initialize atoms of an eoVector you will need an eoInit<AtomType>) +

+ +

+Definition at line 26 of file eoOneMaxInit.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class GenotypeT>
void eoOneMaxInit< GenotypeT >::operator() ( GenotypeT &  _genotype  )  [inline, virtual]
+
+ + + + + +
+   + + +

+initialize a genotype +

+

Parameters:
+ + +
_genotype generally a genotype that has been default-constructed whatever it contains will be lost
+
+ +

+Implements eoUF< GenotypeT &, void >. +

+Definition at line 44 of file eoOneMaxInit.h. +

+References eoRng::flip().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_one_max_init.png b/trunk/paradiseo-eo/doc/html/classeo_one_max_init.png new file mode 100644 index 0000000000000000000000000000000000000000..183749fb47ee587d14710296f21fafcbe336534a GIT binary patch literal 1468 zcmah}dpy$%6kiyb7@v7fUM)QcJ>(fl%qx#g8$v=Mue#didDFaO)41wV-dFUqnMc)cvPqdq9cX!?U-~Ff0=X=iip7Z&9&mZTU&&fe~ILSjaARrJ(-o@F$ z3k2H55p$N5q}Y2}Qo_VR9p#2WibNtY6^U3C6+!u8_OG#6tmJOdf;ioU_wqOoIv)SZ-uo+TXz%UXxqo{Nb4>Ts)_KORsCKk2umuSjpA}yG|`} zIXvFTem{jO;{tpOFJ_z#y!P$x|2P?OtJ17U6FJsb(icCP>O!w!5L?3Zji@W{1e$i( zB`#U#;4$}_8Tb4AXz=Be!(RDw>d7~(6q+2$R@Eld2#RB$;kpj@ru+@9EgA*(Wy^np zsgG$KMH_4CPAa!Q#dB>&Qjrjwq|Gv!lPK4Y1x2Oy0Pn0x9BpituPJvL&QbJ?%;ELm zyMKk4lRR$e0Tg9y3`z*(=S5!iYBWX*C7%2}Mryg27g?Cs&0ta>t;9UaK088@|9Rh; zuo&BXOC+PdE%4bhM?$Qj37f4kmW)rz%nd}Ivcf}R$n(XS-oSRC`(}Rn`^Y*e!ypy%cG&Z<1Z72Omw(p zLF{pZ>JyPi04*C$8~V=nxz6ee@KU>4G461hU~@%aN$*%I@|;xS`J`IP>?m9ksm5na zq5VQQ6cXB&nk+6l3Y*rzOPcCmdY+0^K^*7`Egw>uVt>H;yffJq{eSp1rv!+?KZF29 z>qcLDf$#T_B#oWc8pUnr1xCX>;+@jhA2P89Vr;*`{YcX zA2)Z=5?412QDIW1=?jeNzKg6tiBXDyt?}P8~sY`?;1-KP3x%UkNsu zaMauWeQ7{tZ8NnnDCVHIy|h`BiO{VXX>qz)@L7}8`jSQLbrx{lq=z|yy-|S$7ovb9 zsA1#dHdD;~l^#C2bDv`<#xayL4hXHqmA~EcgYu&na#49EQWiUhGp?V)u#Y+QRn_Y2woUOjw1PF~k@A%grnM8r zO7P^T+uW-iUBa!DI3Eh`#Y3&xtWSsrWr8!x2)0K__H6h@mXtV&_dRkJ>|6O@HRRe` zvwcW#yVX|lGi~GU0(0>_DD=Fdr8^<-*7!8bSYa~wBWXT8g1s^YieLLIUPQm_SGByz zQf1utm4{Ezecq>|GqQ@&^Wo4zn*geIcHD^#bJGs30thw17NNpv*5Me08=4)j_9`t# gA1!XBXIG0ruhVyKtEeHn#IF|Qg7k1`I2)Aq56<1f0ssI2 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_one_max_mutation-members.html b/trunk/paradiseo-eo/doc/html/classeo_one_max_mutation-members.html new file mode 100644 index 000000000..fa2446f0c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_one_max_mutation-members.html @@ -0,0 +1,29 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoOneMaxMutation< GenotypeT > Member List

This is the complete list of members for eoOneMaxMutation< GenotypeT >, including all inherited members.

+ + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< GenotypeT >)eoOp< GenotypeT >
className() const eoOneMaxMutation< GenotypeT > [inline, virtual]
eoMonOp()eoMonOp< GenotypeT > [inline]
eoOneMaxMutation()eoOneMaxMutation< GenotypeT > [inline]
eoOp(OpType _type)eoOp< GenotypeT > [inline]
eoOp(const eoOp &_eop)eoOp< GenotypeT > [inline]
functor_category()eoUF< GenotypeT &, bool > [inline, static]
general enum value (defined in eoOp< GenotypeT >)eoOp< GenotypeT >
getType() const eoOp< GenotypeT > [inline]
operator()(GenotypeT &_genotype)eoOneMaxMutation< GenotypeT > [inline, virtual]
quadratic enum value (defined in eoOp< GenotypeT >)eoOp< GenotypeT >
unary enum value (defined in eoOp< GenotypeT >)eoOp< GenotypeT >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< GenotypeT > [inline, virtual]
~eoUF()eoUF< GenotypeT &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_one_max_mutation.html b/trunk/paradiseo-eo/doc/html/classeo_one_max_mutation.html new file mode 100644 index 000000000..97161cbf9 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_one_max_mutation.html @@ -0,0 +1,98 @@ + + +EO: eoOneMaxMutation< GenotypeT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoOneMaxMutation< GenotypeT > Class Template Reference

Always write a comment in this format before class definition if you want the class to be documented by Doxygen. +More... +

+#include <eoOneMaxMutation.h> +

+

Inheritance diagram for eoOneMaxMutation< GenotypeT >: +

+ +eoMonOp< GenotypeT > +eoOp< GenotypeT > +eoUF< GenotypeT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + +

Public Member Functions

+ eoOneMaxMutation ()
 Ctor - no requirement.
+string className () const
 The class name. Used to display statistics.
bool operator() (GenotypeT &_genotype)
 modifies the parent
+

Detailed Description

+

template<class GenotypeT>
+ class eoOneMaxMutation< GenotypeT >

+ +Always write a comment in this format before class definition if you want the class to be documented by Doxygen. +

+THere is NO ASSUMPTION on the class GenoypeT. In particular, it does not need to derive from EO +

+ +

+Definition at line 25 of file eoOneMaxMutation.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class GenotypeT>
bool eoOneMaxMutation< GenotypeT >::operator() ( GenotypeT &  _genotype  )  [inline, virtual]
+
+ + + + + +
+   + + +

+modifies the parent +

+

Parameters:
+ + +
_genotype The parent genotype (will be modified)
+
+

+Requirement if (_genotype has been modified) isModified = true; else isModified = false; +

+Implements eoUF< GenotypeT &, bool >. +

+Definition at line 47 of file eoOneMaxMutation.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_one_max_mutation.png b/trunk/paradiseo-eo/doc/html/classeo_one_max_mutation.png new file mode 100644 index 0000000000000000000000000000000000000000..420dadbfb41a9dd92366cb0a1b31be41e04d085a GIT binary patch literal 1801 zcmaJ?X;70_7mk1+d_t{3K-?_^14Xt35EKLvNbqG#*g}xakL3+gfoN$m#MX_)5ep%- zBtTe`Xe1O-AxR^M1RDi)2w_P9K{gXmgc1~Rl2YqTe{`9-=Q+=rd(PasXP$d*esG|l zp@F#p1OhQc`TK-IAX)+Iyj@3o9jD1|e>k(?6WHS#jb@!{H0?}g-1qD3qqVoUlRGq% z>){4sXdni1bb2re0?}one7vyP<*&=1WO7}Nk5{LMb-B?~Howyo2+sdf+r53|U3Ad* z_O9+`wOaGEn?9wG>dU(WhunbX3Qx_h!o~|a(*h$E9m5tl z4W(Wfu#?yo)EiGc#edh@3vg*>OlECM!O*|MpeFq08Scp2362aJr2Ee~f7M}oi60{P>I_-` zs=-jW`p5^ycV5zQnYtdP174_tZ2~W3x3PG`@i^blp08y1$9>19e+cYM^&>=O-3MYj zyecRMa6@hHDS)8$LDUjtq)`+(o(u$mm2Lid5i-Q-hQ1h5`nYo%ssL^;HqAy!BO_Q6 zHa>l@4UWs*kwHF`Oi$q5dUGX*$x47WuT6w0)DEnpC;To)BY?Bw(tzH&V^ePF`h^Nk z>Q15}?IRGt_25TA&_@w2DuJC|%z#QfT(Ubx#)tDf z)FV&s^sa35TQbJ9BTqNdo<7o&OrlKt+ulB!g@+65_s;T&heo6|FD}KC6fvzQTZ^n( zN<(6xgIBjUrYK9(CtVi8l&Q)wcf+4+P_;QTpQ~s8=LKx()ACDCbucQUykvI;zBy9f7;&xXd&z1nGs9ZwMu1slz$?6X9$*6&UZkl)=T={!Ieq0H!`t%W5rl zYTMKPFRcGM;a?cDUXghJvC2GoEg{a5qknzBQ|jWBThx^xsLexM-7#&d?U%+dYal^XlMY!^r1Lpv6T( zs<}4tM1Icx?Rb>b%xJH!_1og*{8MKv0m9rC$=E|=bgu^5^t=wyt5% zZ%KAcRmOA@NB`w1#w5WD*u?(TB32LV7&A8dm&<%==6~-lMA31F%H_bQ_u2;JoAuUy zdN7?2ftH%Z+vh3^+xnDI%~$314TqP_>3t~{b2ep8f*i^nEjZsGcdiqe zGk$9H#v#!qJzMIB7to8`R;P}9o@>lx0v+dBjD23`EuR*5@89J(xA2rPpQyG5-5dh^ zE-Rb5oSJUkkRbTWLW&~@`T~zlFH&iUGB%a46^mJpy_I4q@t@O$oZ?o5ABL>@~6=)PN3>>9~NIqr}&0Q72xoO jPqU#4miO5zM0wuSwr1nE_jpt5{}u#wJkW>d9e3e(K|E77 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_one_max_quad_crossover-members.html b/trunk/paradiseo-eo/doc/html/classeo_one_max_quad_crossover-members.html new file mode 100644 index 000000000..0b0e35ee9 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_one_max_quad_crossover-members.html @@ -0,0 +1,29 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoOneMaxQuadCrossover< GenotypeT > Member List

This is the complete list of members for eoOneMaxQuadCrossover< GenotypeT >, including all inherited members.

+ + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< GenotypeT >)eoOp< GenotypeT >
className() const eoOneMaxQuadCrossover< GenotypeT > [inline, virtual]
eoOneMaxQuadCrossover()eoOneMaxQuadCrossover< GenotypeT > [inline]
eoOp(OpType _type)eoOp< GenotypeT > [inline]
eoOp(const eoOp &_eop)eoOp< GenotypeT > [inline]
eoQuadOp()eoQuadOp< GenotypeT > [inline]
functor_category()eoBF< GenotypeT &, GenotypeT &, bool > [inline, static]
general enum value (defined in eoOp< GenotypeT >)eoOp< GenotypeT >
getType() const eoOp< GenotypeT > [inline]
operator()(GenotypeT &_genotype1, GenotypeT &_genotype2)eoOneMaxQuadCrossover< GenotypeT > [inline, virtual]
quadratic enum value (defined in eoOp< GenotypeT >)eoOp< GenotypeT >
unary enum value (defined in eoOp< GenotypeT >)eoOp< GenotypeT >
~eoBF()eoBF< GenotypeT &, GenotypeT &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< GenotypeT > [inline, virtual]

Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_one_max_quad_crossover.html b/trunk/paradiseo-eo/doc/html/classeo_one_max_quad_crossover.html new file mode 100644 index 000000000..36858a872 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_one_max_quad_crossover.html @@ -0,0 +1,108 @@ + + +EO: eoOneMaxQuadCrossover< GenotypeT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoOneMaxQuadCrossover< GenotypeT > Class Template Reference

Always write a comment in this format before class definition if you want the class to be documented by Doxygen. +More... +

+#include <eoOneMaxQuadCrossover.h> +

+

Inheritance diagram for eoOneMaxQuadCrossover< GenotypeT >: +

+ +eoQuadOp< GenotypeT > +eoOp< GenotypeT > +eoBF< GenotypeT &, GenotypeT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + +

Public Member Functions

+ eoOneMaxQuadCrossover ()
 Ctor - no requirement.
+string className () const
 The class name. Used to display statistics.
bool operator() (GenotypeT &_genotype1, GenotypeT &_genotype2)
 eoQuad crossover - modifies both parents
+

Detailed Description

+

template<class GenotypeT>
+ class eoOneMaxQuadCrossover< GenotypeT >

+ +Always write a comment in this format before class definition if you want the class to be documented by Doxygen. +

+THere is NO ASSUMPTION on the class GenoypeT. In particular, it does not need to derive from EO +

+ +

+Definition at line 26 of file eoOneMaxQuadCrossover.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class GenotypeT>
bool eoOneMaxQuadCrossover< GenotypeT >::operator() ( GenotypeT &  _genotype1,
GenotypeT &  _genotype2
)  [inline, virtual]
+
+ + + + + +
+   + + +

+eoQuad crossover - modifies both parents +

+

Parameters:
+ + + +
_genotype1 The first parent
_genotype2 The second parent
+
+

+Requirement if (at least one genotype has been modified) // no way to distinguish oneAtLeastIsModified = true; else oneAtLeastIsModified = false; +

+Implements eoBF< GenotypeT &, GenotypeT &, bool >. +

+Definition at line 49 of file eoOneMaxQuadCrossover.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_one_max_quad_crossover.png b/trunk/paradiseo-eo/doc/html/classeo_one_max_quad_crossover.png new file mode 100644 index 0000000000000000000000000000000000000000..a0b290a261d6f93b8197d4ac07f872b2ba13c963 GIT binary patch literal 2131 zcmai0c{r5q8h@oep)6<0*0HwC7n0@Z4AT(CcEvjwClx{}m1M>;woyp3jCDFAqB$Y* zDaw+`R3=M|5!o7(F~SgL@Fh!V_+FhW-*=YloIifgbwBrY-}iMt&;5IT*OTM~+U}H6 zkpci>n^P#O+ zhzp1Xj*a(U004IIUC0Z+Wxsa{fS=Qm&b2bxAAo9*R1R9V&t3R zuKvBAT)I_SIoHf43k!BmpUADap0!+Pb;Zsw0KdPsf`0B1x#ZkOv>HxJ7Lh5D*J@Qj zj(wP-M!3H)DDEFeURx&WezE8xm=9q-pNR%KZwU2FxxpWd^Bs!F^FE5F>F0+Un?TAw zg>jVHC2S?VR&}KiHHK84O^+p!eZEcE)slABMd*X`lu0Z@aqrM9$-nwD7vFUXQ79m=#QJ(I^E;iBX^OGkAX%)>_oA+#1{y=76(|yka=?rh;c; zAWQVGFk%a$F{2N{REr0F1|A^PG8Y%-QNm-F7E(eicL|?mY|>8@zQ;InV^x_#a1ehOzxX2L#qC+>&oJuf zaxRXldh8bfe{9Y(!k;Z_4GO9cL>dg;svTds2@6Y~-vc&8k9@FFTg`A_4}T`AO&=7Q zC4GX0v33N*tv`{C;Z@nSoK>6=+E8oq)4nS7Y)O&`)!Yg1suO@m7JO4Y!#K+f3 z)(+7Hg)k;DD=@k)H2b=}U|ZIuCAwn*xo;Ooa_Si7v!Glje8KG6n8=sH8IWUDjyZM0 z^U#uWflrruD)^y;(`)xI2eWj>C#wO1S9F_kCC=0gEVu!YNp>c%0vAjt{A^m zqp8vr_j-5yNs4;2ss%;LQup{aMGuQa>*clOVHr)^ZJLw^anj`)O%1O4u_xrtp3kWlxaO&dFrGq~H_lwe#pRCqL5E zVoJw&U}?#E9&M6KOq3d(U?Zon-!}3@5S2S9Xk%xpbHC=1Bvwo-@-db2A!Z38lz$F} zYuWU|Jm%Li{xLx%8tU}H-;?QpnDdB&&9wZh!0^i z=_4D{C~$^21;HbAL`EZhMCRk!S7U6~hkqd1@-y&>`c*KIGRlI6h4S5r`#0gn8O zoSYKgeUEbF)+Dj5e07}H{=)o|w%O$PloU8#ota>OtnMzCeJ5=7oVz_=G$2pZDpOYW zdcHHqGoYtGVDubUNu5JDwO#az>ha>QtW-@j_7^%2B^Xeu%W;2jkqhn>Dw1jn8}SEksYP>alc{l)OL;%y`7e|13hZv zf9(#NM#ZQE?#snA1n1vgq@;O%kQ^r~UU@`scN%-|mO60pH1a}Ci)>=b+Iu{ VDG-3LfkQt4z}^}}ms@(r{RRtP3EBVv literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_op-members.html b/trunk/paradiseo-eo/doc/html/classeo_op-members.html new file mode 100644 index 000000000..747611486 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_op-members.html @@ -0,0 +1,24 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoOp< EOType > Member List

This is the complete list of members for eoOp< EOType >, including all inherited members.

+ + + + + + + + + + +
binary enum value (defined in eoOp< EOType >)eoOp< EOType >
eoOp(OpType _type)eoOp< EOType > [inline]
eoOp(const eoOp &_eop)eoOp< EOType > [inline]
general enum value (defined in eoOp< EOType >)eoOp< EOType >
getType() const eoOp< EOType > [inline]
opTypeeoOp< EOType > [private]
OpType enum name (defined in eoOp< EOType >)eoOp< EOType >
quadratic enum value (defined in eoOp< EOType >)eoOp< EOType >
unary enum value (defined in eoOp< EOType >)eoOp< EOType >
~eoOp()eoOp< EOType > [inline, virtual]

Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_op.html b/trunk/paradiseo-eo/doc/html/classeo_op.html new file mode 100644 index 000000000..1e20dcc62 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_op.html @@ -0,0 +1,67 @@ + + +EO: eoOp< EOType > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoOp< EOType > Class Template Reference

Abstract data types for EO operators. +More... +

+#include <eoOp.h> +

+

Inheritance diagram for eoOp< EOType >: +

+ +eoBinOp< EOType > +eoMonOp< EOType > +eoQuadOp< EOType > + +List of all members. + + + + + + + + + + + + + + + + + + + +

[NOHEADER]

enum  OpType { unary = 0, +binary = 1, +quadratic = 2, +general = 3 + }
+ eoOp (OpType _type)
 Ctor.
+ eoOp (const eoOp &_eop)
 Copy Ctor.
+virtual ~eoOp ()
 Needed virtual destructor.
+OpType getType () const
 getType: number of operands it takes and individuals it produces
+OpType opType
 OpType is the type of the operator: how many operands it takes and how many it produces.
+

Detailed Description

+

template<class EOType>
+ class eoOp< EOType >

+ +Abstract data types for EO operators. +

+Genetic operators act on chromosomes, changing them. The type to use them on is problem specific. If your genotype is a std::vector<bool>, there are operators that work specifically on std::vector<bool>, but you might also find that generic operators working on std::vector<T> are what you need. +

+ +

+Definition at line 68 of file eoOp.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_op.png b/trunk/paradiseo-eo/doc/html/classeo_op.png new file mode 100644 index 0000000000000000000000000000000000000000..0e38ed6e9e3fb75fcacc9b486e4523693c078567 GIT binary patch literal 940 zcmeAS@N?(olHy`uVBq!ia0y~yU_1h32e2>$$Vxn%%7hy z0muU50|yRNANv0U$Ym@E@(X5gcy=R=fq~h{)5S5QV$Rzcv3+Y41X^cL|IPDe!4B&g zyA>ySR{i(h5%y78<6J{5%bRU#+uR-$*m-jq_p_&KEK4vwDm}^F?Zb(ZPU($ic}Et0 zoY@gsDdKhVse97PzYhyzxC2wnTVJcxE!@GeC}Pw06t6{zl17?;6lHgbI0YT|jbRaF zoWRGcZKHUSFEEK;W@=%afS_gvQ$k6i^g(_BkfD#bR&+BiM*l+bVT$l0x9 zC*-2&#NWf67TBgE7`I6*+12%k_j=d(z|8mfvfZ6H|*hk^pX9*ZG}_i zPC32Og&B7`wiYV$_45BvPxifWk?mKzZ0>^UKb3uD7i{eqKK|UYSocdGzr&w~qGIKJ zt}q4lSQ%X(=a}h;E6u*JCn?A2bJs@Bv)aehOx8<~BG4=NJ6!O-Xsw#qZzG+L(__wR znk`=~z0o(vFWfw7c7z&>m*j_VtDWno{bsxUV$r#&-;Q(coEu>#laZ4a70kbMQzW0j zV(qtq;k(zZT@YB7Dkd&az5V3dBby#hxbbCKZGTCh%Ng#A%?marZ1G;&mT@tiWsb;K zgP+3QF^$A|sA6Ffh(mo=I2uW)&zZ6}$ds_80zntz^yxQ(WH z@}%V~fxF%I&MAF!M@9T-SajUw+s4P{hj0c4yFZR9@7N+19B8h&Zswbf?EVu!vL7ki z>3qcF)jMmpm~P2MoE=x>1T%x?A9cAR{G>m&efdNKwGI>I2i(cqI;IwBCv9MT=z3Nl z^r0*3_qZS5nLl#aXc>FABR9$P|EblSMW#z{)K_ei W+w|)FwlZMWV(@hJb6Mw<&;$Ty#G@bp literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_op_container-members.html b/trunk/paradiseo-eo/doc/html/classeo_op_container-members.html new file mode 100644 index 000000000..98b735c07 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_op_container-members.html @@ -0,0 +1,37 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoOpContainer< EOT > Member List

This is the complete list of members for eoOpContainer< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + +
add(eoOp< EOT > &_op, double _rate)eoOpContainer< EOT > [inline]
apply(eoPopulator< EOT > &_pop)=0eoGenOp< EOT > [protected, pure virtual]
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const =0 (defined in eoOpContainer< EOT >)eoOpContainer< EOT > [pure virtual]
eoGenOp()eoGenOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
eoOpContainer()eoOpContainer< EOT > [inline]
functor_category()eoUF< eoPopulator< EOT > &, void > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
max_production(void)eoOpContainer< EOT > [inline, virtual]
max_to_produce (defined in eoOpContainer< EOT >)eoOpContainer< EOT > [private]
operator()(eoPopulator< EOT > &_pop)eoGenOp< EOT > [inline, virtual]
ops (defined in eoOpContainer< EOT >)eoOpContainer< EOT > [protected]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
rates (defined in eoOpContainer< EOT >)eoOpContainer< EOT > [protected]
store (defined in eoOpContainer< EOT >)eoOpContainer< EOT > [private]
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]
~eoOpContainer(void)eoOpContainer< EOT > [inline, virtual]
~eoUF()eoUF< eoPopulator< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_op_container.html b/trunk/paradiseo-eo/doc/html/classeo_op_container.html new file mode 100644 index 000000000..841297aed --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_op_container.html @@ -0,0 +1,122 @@ + + +EO: eoOpContainer< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoOpContainer< EOT > Class Template Reference

eoOpContainer is a base class for the sequential and proportional selectors It takes care of wrapping the other operators, and deleting stuff that it has allocated +More... +

+#include <eoOpContainer.h> +

+

Inheritance diagram for eoOpContainer< EOT >: +

+ +eoGenOp< EOT > +eoOp< EOT > +eoUF< eoPopulator< EOT > &, void > +eoFunctorBase +eoProportionalOp< EOT > +eoSequentialOp< EOT > + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoOpContainer ()
 Ctor: nothing much to do.
+virtual ~eoOpContainer (void)
 Dtor: delete all the GenOps created when wrapping simple ops.
+virtual unsigned max_production (void)
 for memory management (doesn't have to be very precise
void add (eoOp< EOT > &_op, double _rate)
 Add an operator to the container, also give it a rate.
+virtual std::string className () const =0

Protected Attributes

+std::vector< double > rates
+std::vector< eoGenOp< EOT > * > ops

Private Attributes

+eoFunctorStore store
+unsigned max_to_produce
+

Detailed Description

+

template<class EOT>
+ class eoOpContainer< EOT >

+ +eoOpContainer is a base class for the sequential and proportional selectors It takes care of wrapping the other operators, and deleting stuff that it has allocated +

+Warning: all operators are added together with a rate (double) However, the meaning of this rate will be different in the differnet instances of eoOpContainer: an ***absolute*** probability in the sequential version, and a ***relative*** weight in the proportional version +

+ +

+Definition at line 42 of file eoOpContainer.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
void eoOpContainer< EOT >::add ( eoOp< EOT > &  _op,
double  _rate
)  [inline]
+
+ + + + + +
+   + + +

+Add an operator to the container, also give it a rate. +

+(sidenote, it's much less hairy since I added the wrap_op is used) +

+Definition at line 63 of file eoOpContainer.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_op_container.png b/trunk/paradiseo-eo/doc/html/classeo_op_container.png new file mode 100644 index 0000000000000000000000000000000000000000..7956e5d64f641f665fbefc52d1314e9cfb9a043d GIT binary patch literal 2536 zcma)8dpK0<9v(?f7nd&Vkg|j3}0B(72mD+WUES&(k^2bN*QC`>pl+e&1T_ec#{vt+bP<<1$;6 zx4>X98Ak_OR~T%=TXDRwQBr*Fd;YdUJnTN{uN84lW7fPmYbw%+_*6aB#q7sCMQ{ zwx`B^SGhWkUNmmrBGc5s#<7xrBCXRDQGh%^SaDNO&UJrIEu8AgW@-|`ojB#1+A9CR zO5Vn)kz^`1fgWudE*$+OOYjEHWN>DeW8CMI>zFI`*N@*-K^_OBUFPpw18dxE{ktE==ust%z*uS+)B)|%*;>)Yi(QXS{8QWq>%7`i3!4iBDID6s6yv>dQ8VO2pn zeVm=3O^8)K#-x{B%2Kr2?HaG%bcKzI032e>^Hwi$^6kLZkJ|CBjD0qo&oN*y2jv0Z z@j6jw0N)2;5Uc?{aut zMIq|z(HOIRsS5=*(iHE^=G;8Ia7IqwrN5;$82@4IMQ4dB!!h+d_-1#no<3Q0l)AI zDU(0d^yttsOPBnu=-+brzM4F1llbNm`7MP{V3L-q1o30Re?RNb?9U~x zw;{%GP3dgG)~fcpzJif243QeVwad~xJ%dcjyt@9H;!@W%TygEr9g*_tv{M~|tOOTq z#N&c9a^;R9E5joiJ2O%aexd;}q)(^ec^$@HNXy>#kOaLs{&Fo;`P6Zjn38*5H4MqV zgYnSiU?@kuJ*oN4%2_+%*=O7y(~ri^xZB3eO>@0Cm7Q^p%;=gsoasr@Eqr$j87F^> zW$AGuADgYUEem5-7$>!jD#34d0vxgm;jO1KvUF_ya-p+ck3#MiC3Xm_u~WBxRds6G z;JxqI$4?65-zv>GxP8>3&eL5)1~z+j;T<+vqbQFEXQDB3THIWgQMwazT~W2U20;jx zCpM!K(_L=q1MqY)LU*8t9mOzE&((GXfqXDhmzNb6Bg1nq1=j|QR+>Y!DBA-#d(9h8 z=*HgzJHy*TQ=HR*L4^5#B+m=XX!fIK%ZZfje$QQ`Bm22~pA!&4))7a$AH00&0UzZB zP6qT*h@{1sZ~L=E8!x_B7*aIHb{|%Y=joCxCi0ADT&f&^z=hwn#a{5IROAX0g(^}p zmMhe4$@OH_CnZ~kE8J3-K?(MvCx`%om;0^Ql{htpwZwUJvhx&6tdh^6()ts@(K)2d zF#-UK{h9lj26}f?OI;g?nw*H8eQ5pjjGt5{R9sL5)X2*(loWo*y};aUkzmLsc1nqYtXAULccBs1e0t&F_dLS|cs=51Rs3o{iq}W2*D(4~m1hD7|U9FjRHTzA!^?NUFq$bv`8u-qd@X|dT> zRWsg7+kmEz7PKZzwN*Ap=lu7s`ah6aZVls$9Uf^&E8plSUi`#luSTs`MqeJ#IaEQz(w?3#(cs#dNew3x_vBW ztN$zNn!iY)fsOGu$=|_x=4pw#eLG!V~q9Z4mLuRjiCBXNbtZ*2@ENw z>-F%`A;E}2h;V-ahYdgn;gg^5H`biBr1k&L*kFm0|F2}&6I>ZQ;tZLWp!fHSEmzf^6V=5G7Dix!`c(@af zuYTI+WHn%g3w{hG-&=B+OIU+Gx%Vu35EJ|5EE@F1R`Vcbn5&uCAPo81fAxD$GJPcVlkyYlgd0mlNZ(SY?^N4{@JPVOlC@exR`xw&~C!T zlGyT)R08KInDwS04bB-JiIxVRUakhughW4V@dpl_i_Orn-|>t-!lk*3N#_`QG95Y~ zEjm?$zW-w(i73O2>kyu5;9qw(#5Jhd+Jhr)3t#Rf>6=i+$w5AFH%Dx5|9X-00JLmtAs8)&R0EVWk=L|?K z{AN + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoOpSelMason< eoClass > Member List

This is the complete list of members for eoOpSelMason< eoClass >, including all inherited members.

+ + + + + + + + + + + +
allocMap (defined in eoOpSelMason< eoClass >)eoOpSelMason< eoClass > [private]
className() const eoOpSelMason< eoClass > [inline, virtual]
eoFactory()eoFactory< eoOpSelector< eoClass > > [inline]
eoOpSelMason(eoOpFactory< eoClass > &_opFact)eoOpSelMason< eoClass > [inline]
make(std::istream &_is)eoOpSelMason< eoClass > [inline, virtual]
MEV typedef (defined in eoOpSelMason< eoClass >)eoOpSelMason< eoClass >
operatorFactory (defined in eoOpSelMason< eoClass >)eoOpSelMason< eoClass > [private]
vOpP typedef (defined in eoOpSelMason< eoClass >)eoOpSelMason< eoClass >
~eoFactory()eoFactory< eoOpSelector< eoClass > > [inline, virtual]
~eoObject()eoObject [inline, virtual]
~eoOpSelMason()eoOpSelMason< eoClass > [inline, virtual]

Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_op_sel_mason.html b/trunk/paradiseo-eo/doc/html/classeo_op_sel_mason.html new file mode 100644 index 000000000..01ce703a5 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_op_sel_mason.html @@ -0,0 +1,113 @@ + + +EO: eoOpSelMason< eoClass > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoOpSelMason< eoClass > Class Template Reference

EO Mason, or builder, for operator selectors. +More... +

+#include <eoOpSelMason.h> +

+

Inheritance diagram for eoOpSelMason< eoClass >: +

+ +eoFactory< eoOpSelector< eoClass > > +eoObject + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef std::vector< eoOp<
+ eoClass > * > 		vOpP
+typedef map< eoOpSelector<
+ eoClass > *, vOpP > 		MEV

Public Member Functions

virtual eoOpSelector< eoClass > * make (std::istream &_is)
 Factory methods: creates an object from an std::istream, reading from it whatever is needed to create the object.
ctors and dtors
+ eoOpSelMason (eoOpFactory< eoClass > &_opFact)
 constructor
+virtual ~eoOpSelMason ()
 destructor
eoObject methods
+virtual std::string className () const
 Return the class id.

Private Attributes

+map< eoOpSelector< eoClass > *,
+ std::vector< eoOp< eoClass > * > > 		allocMap
+eoOpFactory< eoClass > & operatorFactory
+

Detailed Description

+

template<class eoClass>
+ class eoOpSelMason< eoClass >

+ +EO Mason, or builder, for operator selectors. +

+A builder must allocate memory to the objects it builds, and then deallocate it when it gets out of scope +

+ +

+Definition at line 39 of file eoOpSelMason.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class eoClass>
virtual eoOpSelector<eoClass>* eoOpSelMason< eoClass >::make ( std::istream &  _is  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Factory methods: creates an object from an std::istream, reading from it whatever is needed to create the object. +

+The format is opSelClassName\ rate 1 operator1\ rate 2 operator2\ ...\ Stores all operators built in a database (#allocMap#), so that somebody can destroy them later. The Mason is in charge or destroying the operators, since the built object can´t do it itself. The objects built must be destroyed from outside, using the #destroy# method +

+Implements eoFactory< eoOpSelector< eoClass > >. +

+Definition at line 65 of file eoOpSelMason.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_op_sel_mason.png b/trunk/paradiseo-eo/doc/html/classeo_op_sel_mason.png new file mode 100644 index 0000000000000000000000000000000000000000..053f7057b425bca0311c42f0327bc691f54f323b GIT binary patch literal 793 zcmV+!1LpjRP)lgSy11SK-ieeJlA94GP>-UgVFx#J2lBYT_E zRb;lAbNkvjYi`SauDPAg&+Yj_o*nqXB%{Jo4l5 zJsf$&+%~e2jcjBi8`;Q4HnNe8{EOW8pZkd4NsN3C83D@o)6Flqs49BhuT~+%?Ju$& zIj!CH67`W@_sMbZQ@@b&+7M(Kxt01;jCIXbB_c{UcGW6Uz=blE9CCw?6*8u&_Jd6= zh{_a%fYhl(q`E~+P0a|kwy{*6p33YJqPQS~3@c?B{ev_olQnF2>^m_nl*?r5y9O;} zfJu{YD;c#i(x?bIX`!lAtAxBzrj_MD>kRz+j^|nyb)*3 znI?2h#8}AlIIk%0$GOjKN>r5GZgz{P@D`=q#xi88RzcZty>jFkw{m+&*0$r*g`y+m zRmdge^&iD6$R~=CMw$6>N(#|9zi3jw$t@;UHRQ6LpBA&_q8%FrOKE&TtGoy=az8gPY)*&SJ2u3q0j zZ;^ANbYyZgupu-%rI9YB_?w^l$=jjv_BwjgX4jE}OsZt@!rW%pdE4o6*k&Cbc;-S5 z+S$a}&EhP%{X(2Ix7lr;(^zv|mIFD + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPBILAdditive< EOT > Member List

This is the complete list of members for eoPBILAdditive< EOT >, including all inherited members.

+ + + + + + + + + + + + +
eoPBILAdditive(double _LRBest, unsigned _nbBest=1, double _tolerance=0.0, double _LRWorst=0.0, unsigned _nbWorst=0)eoPBILAdditive< EOT > [inline]
functor_category()eoBF< eoDistribution< EOT > &, eoPop< EOT > &, void > [inline, static]
LR (defined in eoPBILAdditive< EOT >)eoPBILAdditive< EOT > [private]
lrb (defined in eoPBILAdditive< EOT >)eoPBILAdditive< EOT > [private]
lrw (defined in eoPBILAdditive< EOT >)eoPBILAdditive< EOT > [private]
maxBound (defined in eoPBILAdditive< EOT >)eoPBILAdditive< EOT > [private]
minBound (defined in eoPBILAdditive< EOT >)eoPBILAdditive< EOT > [private]
nbBest (defined in eoPBILAdditive< EOT >)eoPBILAdditive< EOT > [private]
nbWorst (defined in eoPBILAdditive< EOT >)eoPBILAdditive< EOT > [private]
operator()(eoDistribution< EOT > &_distrib, eoPop< EOT > &_pop)eoPBILAdditive< EOT > [inline, virtual]
~eoBF()eoBF< eoDistribution< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_additive.html b/trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_additive.html new file mode 100644 index 000000000..0cb480027 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_additive.html @@ -0,0 +1,73 @@ + + +EO: eoPBILAdditive< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPBILAdditive< EOT > Class Template Reference

Distribution Class for PBIL algorithm (Population-Based Incremental Learning, Baluja and Caruana 96). +More... +

+#include <eoPBILAdditive.h> +

+

Inheritance diagram for eoPBILAdditive< EOT >: +

+ +eoDistribUpdater< EOT > +eoBF< eoDistribution< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoPBILAdditive (double _LRBest, unsigned _nbBest=1, double _tolerance=0.0, double _LRWorst=0.0, unsigned _nbWorst=0)
 Ctor with parameters using the default values is equivalent to using eoPBILOrg.
+virtual void operator() (eoDistribution< EOT > &_distrib, eoPop< EOT > &_pop)
 Update the distribution from the current population.

Private Attributes

+double maxBound
+double minBound
+double LR
+unsigned nbBest
+unsigned nbWorst
+double lrb
+double lrw
+

Detailed Description

+

template<class EOT>
+ class eoPBILAdditive< EOT >

+ +Distribution Class for PBIL algorithm (Population-Based Incremental Learning, Baluja and Caruana 96). +

+This class implements an extended update rule: in the original paper, the authors used

+p(i)(t+1) = (1-LR)*p(i)(t) + LR*best(i)

+here the same formula is applied, with some of the best individuals and for some of the worst individuals (with different learning rates) +

+ +

+Definition at line 46 of file eoPBILAdditive.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_additive.png b/trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_additive.png new file mode 100644 index 0000000000000000000000000000000000000000..86b11a3a7ec3ec38686bd0ef19d40b7d7a4049ae GIT binary patch literal 2076 zcmb7FX;f3!7LGE>EDfM9R%ofkL=l;;Kx8Om$`E7-1OgHUy}(6KKm@BIA`n=Df?$AD z3^N%BQ&1+E6%+^{B!of5J|Kmbp#?-4Bu%yNE#F%G@%rQJ^X;?t*?X;TfBT$NXD5uj z3_=D5gUQ={Z|w?$i5ZA+ySSLhepP>RRJ84PcEs5Tg+dV&3frkvzYG!jxZ2y>uXGA$ zMDDJOu1;>S?*wBY3?@};XKjIty}y{>7g>x}wpsjzk#EEsK>{5vtUoQduF|AnIb(Hj?$6=TkMm5+Ch?AQe75`#N8yXm1 z??*Z!JAJSSYB@Ah>wd%yz7!}6aaUM$S$@1+qwDWq9j}YL9SIC@l-Omb@zeZ5LHq^3 zGFvds*Ch+Yn$t3GeVDJvldGMwBCI#ZZkK=#OgbeH#I}y^zdYf{eH_U0axETCDPPQb z2#z5`u{lgTrmbpdbi}fY2)j%YBECk9b1yjsl$&29!b%WDx;-p&dt>weG%7#*{# z3vi@^jX#X{=414ybf0CWNs=kttM1+7(;Hi~d8ks3apP}dL`wdj)AiqeUN~-hZ+f9n zi$i6%IeDgCA5iNZ78S>d$@1DQfoc=?X+2X)$W9P-=S4X#)cg4r{(zg}5&Thu!CD(e zNGXV6mR+ORFIz(7T2o3ca^lI2-krXlQ_zXaBcSW^gWA)X~ zG#-BH?PkBbiFr@DoSl)hVhLrRQS}HUYL?zSF&_Jzt#c;4=2?}nn)J2Zj=@iBvaEoK zQ3*r5^E3&`K>#Q@!@9G8o*&ygOD6EBl^NEkg?=ydo9?uxC{YZ&$1yw@@(Dh4aILo@ zPoY*ONz+$2k~rc`z;b;qj#g9wR_I`_P+S@43DkNzq$;WK9EA-XWRI`UHM}RlZ|at= z7)2vRC3GH#qx4wT!Q;d(>1F5c8Zz{4-$n8T^qrwm??zG|CK#jFHda3qFhy3r55;vR zkmR8g;BYymGkZ%`@;{7!B;Vm0G_aH6YAosoQQBN%kEj{0_;ntm0D&{hHIY2Q#`K@QDk7`|*@x#_6=z;F3T`dgF z?A!!;J`EgLRUQhPzAH}YE)71>i%+8)Oy&+|K@Wb90*;~ztRPOe+~xSw=$?$es1gvB zBVamn((Wk_>F$C?Gyz?)%2Ozle#-7}8rW?wGiQ;`gnz-Ze?508(rT;m03)yF?rtj)vR?CbEU)x- zw8Pt4T@#+11UdWb`HP%=$-AomDSLkn z$>-NNYD)~npF{L=(CkJ4cLZMeK!NwS){k_qdS6_);yXRFu^iXC{HtT69&F>`QUxM} zL1yEkqP{3fX`W)^^-rdpBaE%EyZAPl3LD1N1%jPwcvmY<(K|LKI{9W3Rf<>PTx1n< zUGYj9&*W<6wZf~Z+#1Arec+vjA;9o@iE-8^gsN#^Mk%!JQ(xAP&alf;4lukXNN<%u zPFOAweq)gP@?{Iw6o;OhOZMoL=b4Q6;L?fzJ`6ps8H;BNPWDy;Za^1dx_;&_>PyZg zYKCGx?UzuNQNrc~<-(`$fV3eGTDjHRHS7Q1z9HrN3XV%?Pa-;F_KAzWa+sZslXaz~ GU&0@n>)Mb2 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_distrib-members.html b/trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_distrib-members.html new file mode 100644 index 000000000..4c22cffb0 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_distrib-members.html @@ -0,0 +1,45 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPBILDistrib< EOT > Member List

This is the complete list of members for eoPBILDistrib< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
className() const eoPBILDistrib< EOT > [inline, virtual]
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoPBILDistrib(unsigned _genomeSize)eoPBILDistrib< EOT > [inline]
eoValueParam(void)eoValueParam< std::vector< double > > [inline]
eoValueParam(std::vector< double >_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< std::vector< double > > [inline]
functor_category()eoUF< EOT &, void > [inline, static]
genomeSize (defined in eoPBILDistrib< EOT >)eoPBILDistrib< EOT > [private]
getValue(void) const eoValueParam< std::vector< double > > [inline, virtual]
longName() const eoParam [inline]
operator()(EOT &_eo)eoPBILDistrib< EOT > [inline, virtual]
printOn(std::ostream &os) const eoPBILDistrib< EOT > [inline, virtual]
readFrom(std::istream &is)eoPBILDistrib< EOT > [inline, virtual]
repValue (defined in eoValueParam< std::vector< double > >)eoValueParam< std::vector< double > > [protected]
required() const eoParam [inline]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< std::vector< double > > [inline, virtual]
shortName() const eoParam [inline]
Size()eoPBILDistrib< EOT > [inline]
size() (defined in eoPBILDistrib< EOT >)eoPBILDistrib< EOT > [inline]
value()eoValueParam< std::vector< double > > [inline]
value() const eoValueParam< std::vector< double > > [inline]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoObject()eoObject [inline, virtual]
~eoParam()eoParam [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]
~eoUF()eoUF< EOT &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_distrib.html b/trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_distrib.html new file mode 100644 index 000000000..24e8124d6 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_distrib.html @@ -0,0 +1,118 @@ + + +EO: eoPBILDistrib< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPBILDistrib< EOT > Class Template Reference

Distribution Class for PBIL algorithm (Population-Based Incremental Learning, Baluja and Caruana 96). +More... +

+#include <eoPBILDistrib.h> +

+

Inheritance diagram for eoPBILDistrib< EOT >: +

+ +eoDistribution< EOT > +eoValueParam< std::vector< double > > +eoInit< EOT > +eoPersistent +eoObject +eoParam +eoUF< EOT &, void > +eoPrintable +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoPBILDistrib (unsigned _genomeSize)
 Ctor with size of genomes, and update parameters.
+virtual void operator() (EOT &_eo)
 the randomizer of indis
+unsigned Size ()
 Accessor to the genome size.
+virtual void printOn (std::ostream &os) const
 printing...
+virtual void readFrom (std::istream &is)
 reading...
+unsigned int size ()
virtual std::string className () const
 className: Mandatory because of eoCombinedInit.

Private Attributes

+unsigned genomeSize
+

Detailed Description

+

template<class EOT>
+ class eoPBILDistrib< EOT >

+ +Distribution Class for PBIL algorithm (Population-Based Incremental Learning, Baluja and Caruana 96). +

+It encodes a univariate distribution on the space of bitstrings, i.e. one probability for each bit to be one

+It is an eoValueParam<std::vector<double> > : the std::vector<double> stores the probabilities that each bit is 1

+It is still pure virtual, as the update method needs to be specified +

+ +

+Definition at line 44 of file eoPBILDistrib.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
virtual std::string eoPBILDistrib< EOT >::className ( void   )  const [inline, virtual]
+
+ + + + + +
+   + + +

+className: Mandatory because of eoCombinedInit. +

+SHould be pure virtual, but then we should go over the whole code to write the method for all derived classes ... MS 16/7/04 +

+Reimplemented from eoInit< EOT >. +

+Definition at line 94 of file eoPBILDistrib.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_distrib.png b/trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_distrib.png new file mode 100644 index 0000000000000000000000000000000000000000..7c0667ec4115e7d018ba40061136e73969c92314 GIT binary patch literal 2975 zcmcguc~nzp7LO~NfvR9-5v7WV53sTdiW&qlfIx-%Sdt>p(4Yng1Zr5s3IU8D3P!>X zRTNrykw_sXNKjT2_8r+IEI}et4LgBMa5|l_(>Z5)=A8NCz3=|+yZ5{2efM|o{cbqg zTf=2lWMMEE9C^m_91OPcyhL8uxIywZEQ{=sEIS?ToUO!Su|yP$E3>mN+?GfmpUTS0 zuovP{30y}wXYT|%Io{&~gUJ~oEfLOFGNv*c19{9Hq+I4f?*}s8%jJ~?VIF7hHz<$I zCeD7xjX7eg%1dw)*qXp=ZU^Z_TVA zgjFNF3~{^CQ{Oq#0)T9E4+pRueJo{*M`g8wA1zocj;e7I< zY+yh1lH&e!b`r-};#c@}hk@glT7m}${8KxB1RT!s$%pfdTPcPf@7=S%A5(F-DoR5? ztu3$#)MP03Qy*%NF_NtB)KC@-jOi^(8aY6+d<}z+*F;6dvo{yt>(-8&(qF?m9vKjDS*}N6VCLI9@k^*G$mv-UYVxvV%0?I;!9is9gGaxF-B? zRTqWN2gY-Ohm8COVchUM7b)~j896?{J~?ZKHT>#^uPsWdW|3Sx*BgA>qqJJnj{0nW z#f-(7~ZXrTZgR(SCUTE|AsCT7d01f>cN!e&(DAPJHtx`U9ATWqu^rd3H}dXgOA zg2(|Z20JMp(U5d5u#p6PrpUB#oRCEfhaIn97mii$_f^m6kR+7zsQu_%-J`)`q&b0f zEj;{S7R}-8S4dp~sWQONcFp4x_fNp$f^)TRS(aMtWWHtE_1{B$V)LhG$|@gB>GO{!P0-p`&CsS)G&rvFBmuzx>cZM4bU770O=HkI^xZDSYLIN*wYI_J8#RcRO zu0hhhyTRH{qx#VV0Q@jLQ%gxn1V%D}8prb+&|AMqqbUkl;`g5 z&S-QwN z(uqD_ZLrKbPHC{tY1C*`Vh8Gj_fUqro@Pl7%5zN{|ma5{LPl6cwx5l_V{|r7yfve*wU}-;BlzbC~xl)Z@a`_#wRM5FM@52 zRfRsN9R+|!=;5n1zR9mM%%?fqc%cnO2c(Y0AapkWa2hQ*(m=@|srjq>7=iWYra0T0 z)gqAHIr+_7A)Qzx6b-Lqc-fsdXeg=*!e0FjF2&tI*Mr)@iRV zua5G*5|3$sdPK8bP$3PW@FXpfN^9uO@u~>yH#*RCsB;{^G3bR+yp1N08!y)0p+)fq z7F86x5!xr!MpApcW+wPe2Jt&=Q7N+#QU_5qC-Dc?(QXB)=isE?m_Zp${`) zjIu9FWqn-G5?u`;{b}DnK8a+QnLJ6-O$S0;%On)QrTk?eeBTSCJ$q-UFu32I1=Gz4 zSvNIYBG>Z5_wyF@|Et1mX8w-RGZU2k{oSOR7@*}p{!0`g6-lf&9X<3o;j<#{jjn0> zkHf}RF%7-XG3#g3^ml|VzME1fE=Lh$R${maRO)?2T&r^5)%=g9=3qr)dM+?j{4Ks$ zvHCL3=5%T8D@AVk%+{>!MMId#dvhd9mt>1cW0{UFt;77EB4B+NP8qtAeT}s)fO*@q~- zDSMeoVV+YqS^Q@DgbAuiLBe`Q(guIFDrgLq9ERe1DY#prNzS)H*dkqYanR}6K?eQ& z7+gh9inX~h!bdpEBv{>EJBb>j1FOnjx8LvoA=Jgnv+m&|kA%)}On(Dt=P#s`*vHXm z(R+M`6xuU=nI;c{9alRGKAx}FF2&}OS-1*$~w{Ih}`FUYalsf?oEqnBa$Zo_+LITS6UmUvfYSC-SB~Xk~#FJ fqtCp8KXPJzp57K*#BGz@reR1cdrQdT!u7uaec8;z literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_org-members.html b/trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_org-members.html new file mode 100644 index 000000000..0fef07f13 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_org-members.html @@ -0,0 +1,22 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPBILOrg< EOT > Member List

This is the complete list of members for eoPBILOrg< EOT >, including all inherited members.

+ + + + + + + + +
eoPBILOrg(double _LR, double _tolerance=0.0)eoPBILOrg< EOT > [inline]
functor_category()eoBF< eoDistribution< EOT > &, eoPop< EOT > &, void > [inline, static]
LR (defined in eoPBILOrg< EOT >)eoPBILOrg< EOT > [private]
maxBound (defined in eoPBILOrg< EOT >)eoPBILOrg< EOT > [private]
minBound (defined in eoPBILOrg< EOT >)eoPBILOrg< EOT > [private]
operator()(eoDistribution< EOT > &_distrib, eoPop< EOT > &_pop)eoPBILOrg< EOT > [inline, virtual]
~eoBF()eoBF< eoDistribution< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_org.html b/trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_org.html new file mode 100644 index 000000000..72bfb8f03 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_org.html @@ -0,0 +1,60 @@ + + +EO: eoPBILOrg< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPBILOrg< EOT > Class Template Reference

Distribution Class for PBIL algorithm (Population-Based Incremental Learning, Baluja and Caruana 95). +More... +

+#include <eoPBILOrg.h> +

+

Inheritance diagram for eoPBILOrg< EOT >: +

+ +eoDistribUpdater< EOT > +eoBF< eoDistribution< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + +

Public Member Functions

+ eoPBILOrg (double _LR, double _tolerance=0.0)
 Ctor with size of genomes, and update parameters.
+virtual void operator() (eoDistribution< EOT > &_distrib, eoPop< EOT > &_pop)
 Update the distribution from the current population.

Private Attributes

+double LR
+double maxBound
+double minBound
+

Detailed Description

+

template<class EOT>
+ class eoPBILOrg< EOT >

+ +Distribution Class for PBIL algorithm (Population-Based Incremental Learning, Baluja and Caruana 95). +

+This class implements the update rule from the original paper:

+p(i)(t+1) = (1-LR)*p(i)(t) + LR*best(i) +

+ +

+Definition at line 42 of file eoPBILOrg.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_org.png b/trunk/paradiseo-eo/doc/html/classeo_p_b_i_l_org.png new file mode 100644 index 0000000000000000000000000000000000000000..f6d22c3c01429925c83f452a7200086adc139830 GIT binary patch literal 2044 zcmbVNc{tnI8V<#@jN2)uR0p?1b+cBYC{-Dxt_E3bLAR*o=eAX?C~B!aQz>e>{D>eD z2_ibNt9>4AwV4`{AX;r|=|ZZt1f?>W_D-Lf``qXLasN2yyx)1g=X~co@B6%m=;4M? zRn}I9Kp?6vCmhib$QGy!cPng>&3|t`Dv&K&9w)I*QmIr1rP6K+qNfY&rV2D z%?PQzqa}SIjfCxUK#9~xU%NzIl6v=bHQ#8jP8&}MFwOuG#!J{_WqvmtR_~!|l+N7s zedbg?ktQ~;;yA)$LPqW~4@TE%HjM}56@WHlRZ;BQCRburpA8%%(l}(@qre(QuO_Iv z`)9PpvqlXjXsy2MX6)#TV`I8}qwnsEi!MG0Tv@ZWvM zPnx_)<2_`yI`3GN{zK*Rl z;V)?6#awHr^>ZV>7pb?oLd_QN@PQ!m+_KWc2(8%X0gVlZQ0djEi&F}&74+pWu7^;E z>AYUI{g@hTD9nL`St(>*X8+*gK_#=(Yqej0oX^UR{0W_<(>PV#@#qDRHsOxoVo4`M z2pfeig&rxb;HbSje|6l8=}3BnR{?knJl;dQ=k5N?@Y|YzFM_E(JClJLX4PDt^@u%g zWrmqVWS&B)Be;0%U7WH+ZGra1RRiWAp7Nz9}c)<4}~0 zx;ktVQ`KJwG*)iN19MNoE^B**4ra)#iKfS5lLIGZ;`FjS5Pt}}Mdc46eH71S?a!yS zZ9m$P`go;eCg6HWoSfpC?YjH`ItR>RbJ%4@rzydw9n2X@1?(S%5u7NTU9&d-`9icr zF^^VZmI#D@%Kog&Kb?%-;)(=14^GZ)Zp87f9`RQCqvT(5zFg$ryRoZRB&N>!lXG=O zTnZ|q?hlHAMsEiHYx7qccGiZnQdeB1izS#cO9O9W z*WARna2Hmf`4g!;qw}%QJ*b9lI{6#963R0UvZiUwEeOGSD+K(Vd;F0`P?Pm~fV8W0 zObtK0U3kH8sbXs7J3F_d)^v;O%z}qCv$`g=hV<#L0bb=`iUyg*{px^=E%JoU(;~ve zgLpS(4CbVKTTMaEL*M)G=smE3;GJHW(}wh9OP7ST;Gy$`J16E7ta}R$?A@(C!dcl( zkv-gRc`YVCQk~DI9xgYod9Pzx4CXDd<`-;5OLSa6#XOKlZf{Kj2ZQ6`m|^(jumd|2 zyqlY^0ftLoZmVkM4edduSa@CGY0oPFWr8VB#Q-IC!1B+L^XP zi22)Q=<(K+hG%dX+X1#NYiM;6`9;mYhi9w8`aVCYS&^BM%;j^p^}%5+W?v`DbzX>H)T}w{OcJI7I ziseuF?e=D1o2FmxGl^|kJiwkIgiVbT;&RE|9TBOBk`@zX%lo8srgrSoi~zbq-{rn9 z6}zZ2t$j7>iVvsES(Tlp`Nk4+#ng(4;tu3E%3N_3HQD*3J+fU;Nu`(Vu8xkc>`BiA z{f?E7nSSejq-b!UwH)N@vl#EGGnSrxsKpX}0f-{)521%4)yglkd_@^sxonuoIMZ{7 zeuK~bt>U8-{IcG8Q_V6k0E%6-nGYTOs49KzB$MT^n!BB9b=BU|7;UV(tL-wB@ulf^ deQu_Unlbfbo{Bm{B-vLDadC2Utb?CP`VI7h?_2-? literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_param-members.html b/trunk/paradiseo-eo/doc/html/classeo_param-members.html new file mode 100644 index 000000000..2ede388b2 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_param-members.html @@ -0,0 +1,31 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoParam Member List

This is the complete list of members for eoParam, including all inherited members.

+ + + + + + + + + + + + + + + + + +
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
getValue() const =0eoParam [pure virtual]
longName() const eoParam [inline]
repDefault (defined in eoParam)eoParam [private]
repDescription (defined in eoParam)eoParam [private]
repLongName (defined in eoParam)eoParam [private]
repRequired (defined in eoParam)eoParam [private]
repShortHand (defined in eoParam)eoParam [private]
required() const eoParam [inline]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)=0eoParam [pure virtual]
shortName() const eoParam [inline]
~eoParam()eoParam [inline, virtual]

Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_param.html b/trunk/paradiseo-eo/doc/html/classeo_param.html new file mode 100644 index 000000000..6e954a4a8 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_param.html @@ -0,0 +1,179 @@ + + +EO: eoParam Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoParam Class Reference

eoParam: Base class for monitoring and parsing parameters +More... +

+#include <eoParam.h> +

+

Inheritance diagram for eoParam: +

+ +eoValueParam< ValueType > +eoValueParam< double > +eoValueParam< EOT::Fitness > +eoValueParam< ParamType > +eoValueParam< std::pair< double, double > > +eoValueParam< std::string > +eoValueParam< std::vector< double > > +eoValueParam< std::vector< FitT > > +eoValueParam< std::vector< PartFitT > > +eoValueParam< std::vector< WorthT > > +eoValueParam< string > +eoValueParam< T > +eoValueParam< unsigned > +eoValueParam< unsigned long > + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoParam ()
 Empty constructor - called from outside any parser.
 eoParam (std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)
 Construct a Param.
+virtual ~eoParam ()
 Virtual destructor is needed.
+virtual std::string getValue () const =0
 Pure virtual function to get the value out.
+virtual void setValue (const std::string &_value)=0
 Pure virtual function to set the value.
+char shortName () const
 Returns the short name.
+const std::string & longName () const
 Returns the long name.
+const std::string & description () const
 Returns the description of the argument.
+const std::string & defValue () const
 Returns the default value of the argument.
+void defValue (const std::string &str)
 Sets the default value of the argument,.
+void setLongName (std::string _longName)
 ALlows to change the name (see the prefix in eoParser.h).
+bool required () const
 Returns if required or not.

Private Attributes

+std::string repLongName
+std::string repDefault
+std::string repDescription
+char repShortHand
+bool repRequired
+

Detailed Description

+eoParam: Base class for monitoring and parsing parameters +

+ +

+Definition at line 42 of file eoParam.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
eoParam::eoParam ( std::string  _longName,
std::string  _default,
std::string  _description,
char  _shortName = 0,
bool  _required = false
)  [inline]
+
+ + + + + +
+   + + +

+Construct a Param. +

+

Parameters:
+ + + + + + +
_longName Long name of the argument
_default The default value
_description Description of the parameter. What is useful for.
_shortName Short name of the argument (Optional)
_required If it is a necessary parameter or not
+
+ +

+Definition at line 60 of file eoParam.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_param.png b/trunk/paradiseo-eo/doc/html/classeo_param.png new file mode 100644 index 0000000000000000000000000000000000000000..2644687410c7f957433bdc3a5015c3035f6f7d6a GIT binary patch literal 5769 zcmdT|XH-+^)<(TDDxzK;5D`IV#KBOME{Y;Z2NNebCP)hc0R%#X(1k=ru>y{AD4_&} z5Tld}QcQ@VR1JMpLJa~Y2%#oY0s+1t*ZF?j`*&Q|A7?%Lyz4z{pY`tj?)^Ob))}ak z>?XxcQc_Z~HrD2FDXFy(DXDcS|5ztk+2~hmD*=Tw_JGCm^0LHSUVcR;yWNvmU!Pa6 zUR|nM{v>%_6AXtUq)zfWyriV$Rcy>nf$;RPjHbxJ=W^yB((-n9gv&PV-hT){%ReYZ zF3$gR>J+@4qQRO3t}yENBv{zIF_k4oswG8i`XxPQu1Q`^>@L$YKywI($Y5}S!<2c9kF#mipt$Tj^>=lNPE#qC}Md%})W=xcfPhts2Hf8*Wq%DA(#hA^Q^F zo>o8gnDz-H3gi?7L1+P|w4oIps*K8#@Q;EUnN3ST}e zk>x7`Sr}&go>930lNCbApD&`^=WXoE)xnu*f~{p)2SJZ9RF}37>Gw?$glUCDl_5mYlba^+G>TqH;zh&oaY}h#AVn<&P)X1K-(|C%NX(<-MI#Y_N1^(niv6*4jP*4 zB!}xU?4?~SjTHZ;@ch@1OJY`3$h#1nx|wk|XghsvV_|ve6rf=&Cj+Z>Zv;-TgQ!n3 znx6DmWLI3e2OwW?4ec>cu3QgCA)9H}oNd#Sw5}JQAw!20d<#XFX(fA4fZ)*5g$p^k zJ+KV3JpCa-wQgK>8{%9t*g(LP>Lt-y9#ZJ+NWy`n*YJ(|U{m;WM&OVj^epnW&QuF6 zs@HQom1WZEtyROYjDo0Bg#vXcaWC+PJi8pI$Lh1GM-hw;l)xR2Q*6L^j72)w|PLh7Qzhi0CVyT zZFE$dDvUbRXap*_=VjM~7Jhh*=)!3c z9t+S-GKEXF8I)xi)njD3Ze#A95RNMgy&%)W!Pi1CVF{wBu+5HGQ>)HGiH8;!6 z=aArFWhA{={X-q0v>hhkO6mGBNV5_ri1% zHS7=>V~c{af|8XoVlOEp`QDDZs{TA3FQON_a68#_jwTvO?jQ`+z`_6`v&Fgltt$9@ zioc_n}EAKwL9{r1j$Fpm3L=Apl!E{mqi48Hb0NgH~TD+tDmdPpYx8(}6yh(R8y z5;+}~4wR7^(h$dxkYi~L7b2Bd$Ia|u8oadDq@fWfyq#{dYH_G{lQT}M`Zl$=g5DGG zl+iyZign+?9 zU{|o*9k&%12RS+0M;O6n@Cz0^7_DTFNa>C%IRb}|DBZ51+v|vG_JUw>+024btQLFG zHnTOIHAYayj-sj#FMuzaxO!vGr+jA(Tf%Uz@v!OG#s+OQ&H5~HfoZ&H-^bLYVIDe? za}=EQ8y}y;8YdV5klsmrpftz3Y^9n@;NG$NmZh5PHjK_^9afu^)5-1sTEBnIcY!a8 zH>34ot5xp78#y<^i~KmM`zk*eqzK&G=)H;p7kEU$XXewbI&etg&J1Bfksb>!KALp} zF0yPhO1h87s%WWJ$54tZKKI-g1Fk1du53dv?YQSPBBOaf@mUQPLn6Y5pPW&yhmO{V zKWB$n!q8KCvxQOmPHX3Y#OCNn)=lU-%|$q^z?+OgZ{k4PXPsTaySP59-0uGOfk@e! zmn7^PQ-5K=_$E$_C(=fgqXo z-Xe|ic?~?3MICT-abKhU1d!Q)(8SJ4IGPAqjS%YOAvQM1myDuD9fB7cLtG@x5b1O# zqszDA_E>vWV1{ipcZ?DAfR)0x*Ju}g}g0v4^k86vy<2s$@g<1{Z znJ$OzAtrx%7T{z>Aw?V?d=5a!d23u*$_X#c+1}hR8weln@C;CG-ZpTb6|GTB6Wc$a zGpFA%f>iGKlSNcg<6CP?dI(oySVGo~p$NHeojH#2XSL(PHb44HD@hpesVh z&|^fH`AvDXsl-cnto=^8Epe2^J~{d{LUC29m={P1`B>~%_A5~=_h1z7hjip)!4A54 ziGF)HEsEM2mByN}X3)gu59!BuoU%R`pJKaghFAB8HdTmO`Ca`Av|xxHnw_WMr&TJ? z+~j%FfVcH$QaM~i@50ivXW)___swo27 zCXoU7n|s@sE^bm{&+%F6`a?!w^*GA)i4hwuf3e4-wR{rDvp1HDnXJ*`F2W-eO?G;J zjP{Z-!TGHK9WNe*8L!4nN%p&SSBWFj!Ydsp;lG92E$1~nc6ZmeplOFfTFOYL!WkVG zYk)GxrinHIr`wm10ECv2$OY$>4}ji|O)ykwJrsj`O79&MzjcV^>+YN>BlUT>bawg@ z9xSprNZ}==7=pq#!7O%8zcQPuDQ4!cz^CS^XC_lVt71*>yD`2MM=zw^(M|7G`_KNM z^(kna-{8N;4z-tQqtEs6muh3IZk)y}v^T;$^`aoh>>BBwJ4Y5Vg?A7dzba{fz2#m7 zVVGuOZXp$yd(;Qg(o3RWH|PtT?c6;PpU7(7E{uY8s>T~sp^EOl_vV~)51^$F`nnjY z1h{lY`|;+3dkfPO=;#$2BSVTe<=zZ=E=iQ|>^|FPzwVIGlR4yCe#& zIp|mRloF#J?x?6x7_u*Mc}3_^tub##4v>KnGFUki+Lu>7n`Wmx6} zyJAhT6LfzRxgG3AD_&%VU<&-o0mow^JS3zNPIg6Q;%3y*?IbH}%AS~@kmET$P%Q~f zK7uo)<-p;0h4Ok~BwT_i_ZBwRntRM2x)g`7aeB}fHLwS6gj=$DUA^phBob2C|G%Tt z&un}6bv~f3Lfrp+^^yqy{}UY%Kd+8MMgg-qacqKknnQ~c)59TNkmQStL-o@OT)3{t zC!x^9nanJJCAakNIRPHLemJ@^>RQ8>Inv4Ks8m8ql1pg(u}}!65?+>?p!9~TlfQF1 zFkXXNjO%!fNOdJ_L_pXRhO|%hs^B(jS}vZk6E+;FRy%~{t`~<0Qq02m?Akh z1C>$ZP2WiFT{6pR>~KlBtJx$lj) + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoParamParamType Member List

This is the complete list of members for eoParamParamType, including all inherited members.

+ + + + +
eoParamParamType(std::string _value) (defined in eoParamParamType)eoParamParamType [inline]
printOn(std::ostream &_os) const (defined in eoParamParamType)eoParamParamType [inline]
readFrom(std::istream &_is) (defined in eoParamParamType)eoParamParamType [inline]
readFrom(std::string &_value) (defined in eoParamParamType)eoParamParamType [inline]

Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_param_param_type.html b/trunk/paradiseo-eo/doc/html/classeo_param_param_type.html new file mode 100644 index 000000000..7db654f60 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_param_param_type.html @@ -0,0 +1,43 @@ + + +EO: eoParamParamType Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoParamParamType Class Reference

Another helper class for parsing parameters like Keyword(arg1, arg2, ...). +More... +

+#include <eoParam.h> +

+List of all members. + + + + + + + + + + +

Public Member Functions

+ eoParamParamType (std::string _value)
+std::ostream & printOn (std::ostream &_os) const
+std::istream & readFrom (std::istream &_is)
+void readFrom (std::string &_value)
+

Detailed Description

+Another helper class for parsing parameters like Keyword(arg1, arg2, ...). +

+It is basically a std::pair<std::string,std::vector<std::string> > first std::string is keyword the std::vector<std::string> contains all arguments (as std::strings) See make_algo.h +

+ +

+Definition at line 373 of file eoParam.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_parameter_loader-members.html b/trunk/paradiseo-eo/doc/html/classeo_parameter_loader-members.html new file mode 100644 index 000000000..8409265cb --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_parameter_loader-members.html @@ -0,0 +1,19 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoParameterLoader Member List

This is the complete list of members for eoParameterLoader, including all inherited members.

+ + + + + +
createParam(ValueType _defaultValue, std::string _longName, std::string _description, char _shortHand=0, std::string _section="", bool _required=false)eoParameterLoader [inline]
isItThere(eoParam &_param) const =0eoParameterLoader [pure virtual]
ownedParams (defined in eoParameterLoader)eoParameterLoader [private]
processParam(eoParam &param, std::string section="")=0eoParameterLoader [pure virtual]
~eoParameterLoader()eoParameterLoader [virtual]

Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_parameter_loader.html b/trunk/paradiseo-eo/doc/html/classeo_parameter_loader.html new file mode 100644 index 000000000..310899f98 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_parameter_loader.html @@ -0,0 +1,185 @@ + + +EO: eoParameterLoader Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoParameterLoader Class Reference

Parameter saving and loading. +More... +

+#include <eoParser.h> +

+

Inheritance diagram for eoParameterLoader: +

+ +eoParser + +List of all members. + + + + + + + + + + + + + + + + + + +

Public Member Functions

+virtual ~eoParameterLoader ()
 Need a virtual destructor.
virtual void processParam (eoParam &param, std::string section="")=0
 Register a parameter and set its value if it is known.
+virtual bool isItThere (eoParam &_param) const =0
 checks if _param has been actually entered
template<class ValueType>
eoValueParam< ValueType > & createParam (ValueType _defaultValue, std::string _longName, std::string _description, char _shortHand=0, std::string _section="", bool _required=false)
 Construct a Param and sets its value.

Private Attributes

+std::vector< eoParam * > ownedParams
+

Detailed Description

+Parameter saving and loading. +

+eoParameterLoader is an abstract class that can be used as a base for your own parameter loading and saving. The command line parser eoParser is derived from this class. +

+ +

+Definition at line 40 of file eoParser.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + +
virtual void eoParameterLoader::processParam ( eoParam &  param,
std::string  section = ""
)  [pure virtual]
+
+ + + + + +
+   + + +

+Register a parameter and set its value if it is known. +

+

Parameters:
+ + + +
param the parameter to process
section the section where this parameter belongs
+
+ +

+Implemented in eoParser.

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+template<class ValueType>
eoValueParam<ValueType>& eoParameterLoader::createParam ( ValueType  _defaultValue,
std::string  _longName,
std::string  _description,
char  _shortHand = 0,
std::string  _section = "",
bool  _required = false
)  [inline]
+
+ + + + + +
+   + + +

+Construct a Param and sets its value. +

+The loader will own the memory thus created

+

Parameters:
+ + + + + + + +
_defaultValue The default value
_longName Long name of the argument
_description Description of the parameter. What is useful for.
_shortName Short name of the argument (Optional)
_section Name of the section where the parameter belongs
_required If it is a necessary parameter or not
+
+ +

+Definition at line 70 of file eoParser.h. +

+Referenced by eoParser::getORcreateParam(), and eoParser::setORcreateParam().

+

The documentation for this class was generated from the following files: +
Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_parameter_loader.png b/trunk/paradiseo-eo/doc/html/classeo_parameter_loader.png new file mode 100644 index 0000000000000000000000000000000000000000..81523069ec378a8510f35811e8b314f520a44650 GIT binary patch literal 406 zcmV;H0crk;P)<)*D zgLi6WwlnL_=5z=V(0)*l4X>qE=H0<@Y#-|mo4lEKt((2W_vY_s?>8^0ZCoy0ux(xk zw9S)m9{$sxHt@g2CtuVDahowWi+`+H(4YY1n~y0d2;BB?ftm*TiL ztzTX;-*BIO4Bs{{X;$;94dUYw_{ZW0FY1H%1#ZCW;|SsTIRF3v07*qoM6N<$g1tbt AF8}}l literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_pareto_fitness-members.html b/trunk/paradiseo-eo/doc/html/classeo_pareto_fitness-members.html new file mode 100644 index 000000000..465ced122 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_pareto_fitness-members.html @@ -0,0 +1,26 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoParetoFitness< FitnessTraits > Member List

This is the complete list of members for eoParetoFitness< FitnessTraits >, including all inherited members.

+ + + + + + + + + + + + +
dominates(const eoParetoFitness< FitnessTraits > &_other) const eoParetoFitness< FitnessTraits > [inline]
eoParetoFitness(void) (defined in eoParetoFitness< FitnessTraits >)eoParetoFitness< FitnessTraits > [inline]
eoParetoFitness(std::vector< double > &_v) (defined in eoParetoFitness< FitnessTraits >)eoParetoFitness< FitnessTraits > [inline]
fitness_traits typedef (defined in eoParetoFitness< FitnessTraits >)eoParetoFitness< FitnessTraits >
maximizing(unsigned _i) (defined in eoParetoFitness< FitnessTraits >)eoParetoFitness< FitnessTraits > [inline, static]
operator!=(const eoParetoFitness< FitnessTraits > &_other) const (defined in eoParetoFitness< FitnessTraits >)eoParetoFitness< FitnessTraits > [inline]
operator<(const eoParetoFitness< FitnessTraits > &_other) const eoParetoFitness< FitnessTraits > [inline]
operator<=(const eoParetoFitness< FitnessTraits > &_other) const (defined in eoParetoFitness< FitnessTraits >)eoParetoFitness< FitnessTraits > [inline]
operator==(const eoParetoFitness< FitnessTraits > &_other) const (defined in eoParetoFitness< FitnessTraits >)eoParetoFitness< FitnessTraits > [inline]
operator>(const eoParetoFitness< FitnessTraits > &_other) const (defined in eoParetoFitness< FitnessTraits >)eoParetoFitness< FitnessTraits > [inline]
operator>=(const eoParetoFitness< FitnessTraits > &_other) const (defined in eoParetoFitness< FitnessTraits >)eoParetoFitness< FitnessTraits > [inline]
setUp(unsigned _n, std::vector< bool > &_b)eoParetoFitness< FitnessTraits > [inline, static]

Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_pareto_fitness.html b/trunk/paradiseo-eo/doc/html/classeo_pareto_fitness.html new file mode 100644 index 000000000..58e092b8b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_pareto_fitness.html @@ -0,0 +1,73 @@ + + +EO: eoParetoFitness< FitnessTraits > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoParetoFitness< FitnessTraits > Class Template Reference

eoParetoFitness class: std::vector of doubles with overloaded comparison operators. +More... +

+#include <eoParetoFitness.h> +

+List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef FitnessTraits fitness_traits

Public Member Functions

+ eoParetoFitness (std::vector< double > &_v)
+bool dominates (const eoParetoFitness< FitnessTraits > &_other) const
 Partial order based on Pareto-dominance.
+bool operator< (const eoParetoFitness< FitnessTraits > &_other) const
 compare *not* on dominance, but on the first, then the second, etc
+bool operator> (const eoParetoFitness< FitnessTraits > &_other) const
+bool operator<= (const eoParetoFitness< FitnessTraits > &_other) const
+bool operator>= (const eoParetoFitness< FitnessTraits > &_other) const
+bool operator== (const eoParetoFitness< FitnessTraits > &_other) const
+bool operator!= (const eoParetoFitness< FitnessTraits > &_other) const

Static Public Member Functions

+void setUp (unsigned _n, std::vector< bool > &_b)
 access to the traits characteristics (so you don't have to write a lot of typedef's around
+bool maximizing (unsigned _i)
+

Detailed Description

+

template<class FitnessTraits = eoParetoFitnessTraits>
+ class eoParetoFitness< FitnessTraits >

+ +eoParetoFitness class: std::vector of doubles with overloaded comparison operators. +

+Comparison is done on pareto dominance. The template argument FitnessTraits defaults to eoParetoFitnessTraits, which can be replaces at will by any other class that implements the static functions defined therein.

+Note that the comparison defines a partial order, so that !(a < b) && !(b <a) does not neccessarily imply that (a==b) The other way around does hold. +

+ +

+Definition at line 108 of file eoParetoFitness.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_pareto_fitness_traits-members.html b/trunk/paradiseo-eo/doc/html/classeo_pareto_fitness_traits-members.html new file mode 100644 index 000000000..7660ed278 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_pareto_fitness_traits-members.html @@ -0,0 +1,17 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoParetoFitnessTraits Member List

This is the complete list of members for eoParetoFitnessTraits, including all inherited members.

+ + + +
maximizing(int which) (defined in eoParetoFitnessTraits)eoParetoFitnessTraits [inline, static]
nObjectives() (defined in eoParetoFitnessTraits)eoParetoFitnessTraits [inline, static]
tol() (defined in eoParetoFitnessTraits)eoParetoFitnessTraits [inline, static]

Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_pareto_fitness_traits.html b/trunk/paradiseo-eo/doc/html/classeo_pareto_fitness_traits.html new file mode 100644 index 000000000..f6ce01790 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_pareto_fitness_traits.html @@ -0,0 +1,46 @@ + + +EO: eoParetoFitnessTraits Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoParetoFitnessTraits Class Reference

eoFitnessTraits: a traits class to specify the number of objectives and which one are maximizing or not See test/t-eoParetoFitness for its use. +More... +

+#include <eoParetoFitness.h> +

+

Inheritance diagram for eoParetoFitnessTraits: +

+ +eoVariableParetoTraits +MinimizingTraits + +List of all members. + + + + + + + + +

Static Public Member Functions

+unsigned nObjectives ()
+double tol ()
+bool maximizing (int which)
+

Detailed Description

+eoFitnessTraits: a traits class to specify the number of objectives and which one are maximizing or not See test/t-eoParetoFitness for its use. +

+If you define your own, make sure you make the functions static! +

+ +

+Definition at line 42 of file eoParetoFitness.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_pareto_fitness_traits.png b/trunk/paradiseo-eo/doc/html/classeo_pareto_fitness_traits.png new file mode 100644 index 0000000000000000000000000000000000000000..2ad2fe252fb8f122659b98c41f44bab16656226e GIT binary patch literal 1143 zcmeAS@N?(olHy`uVBq!ia0y~yUBX*E^1GIQE&% z`1zU7XI52*)%~5wawFza*vulSAn(GB2Y;;pryp}^vfk^+_9{r@l~wyjv>9FoSL zstQN_ldeX+O|NO+W)VC&qCYp^cHTaP)vL1l7O5ugTCKg2srj(#rbVYkz1KWey=#`h zbHuJDVDZA=+Fu_&*FTc=^rcJj*$YokrRs>~HLIG>wD_U$&HVM-iQjD(CmrR!I4jPF zUBSrm#LOQ)Ni(Kz(%#r);wKh$wo}Bxbe+(NB)%l^y!{VkVvJVXteVyr`f7(-SmvJC zGCn=^)mzg;*M&dZ^!n;f{!6M48D_;+%E$D2N~f5zXYSr}Pv%dFhIS<;ifNu&_uSMZ zPHyf2;nq!)j=#R|p8mmR;hG~KKmGdkLS&xWl&i7}vv=D}nTj3Fn=bnA_W2bbeU~Qn>)TwtCZ<Ng$uY6&dbM8kiTfw&M&^3Q%ZnKqrI(zPB{>W6``L}Yf?wZQ0tNo|Z{C?W@ z>3OG*J<{U2zA7^D*wfkfU0$zAWfg0@bhc#Mv{^a|YWx#LOFu>=$?AI^zqECE)%jDb zHpv@RQ@}zDqJI{_fmcGUe|> zt(Y^jZO^Ss{pq~ea%nb>7J_keZ`t5up}Z + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoParetoOneConstraintFitness< FitnessTraits > Member List

This is the complete list of members for eoParetoOneConstraintFitness< FitnessTraits >, including all inherited members.

+ + + + + + + + + + + + + + + + + + +
constraintValue (defined in eoParetoOneConstraintFitness< FitnessTraits >)eoParetoOneConstraintFitness< FitnessTraits > [private]
ConstraintValue() const (defined in eoParetoOneConstraintFitness< FitnessTraits >)eoParetoOneConstraintFitness< FitnessTraits > [inline]
ConstraintValue(double _c) (defined in eoParetoOneConstraintFitness< FitnessTraits >)eoParetoOneConstraintFitness< FitnessTraits > [inline]
dominates(const eoParetoOneConstraintFitness< FitnessTraits > &_other) const eoParetoOneConstraintFitness< FitnessTraits > [inline]
eoParetoOneConstraintFitness(void) (defined in eoParetoOneConstraintFitness< FitnessTraits >)eoParetoOneConstraintFitness< FitnessTraits > [inline]
eoParetoOneConstraintFitness(std::vector< double > &_v) (defined in eoParetoOneConstraintFitness< FitnessTraits >)eoParetoOneConstraintFitness< FitnessTraits > [inline]
eoParetoOneConstraintFitness(std::vector< double > &_v, double _c) (defined in eoParetoOneConstraintFitness< FitnessTraits >)eoParetoOneConstraintFitness< FitnessTraits > [inline]
feasible() const (defined in eoParetoOneConstraintFitness< FitnessTraits >)eoParetoOneConstraintFitness< FitnessTraits > [inline]
fitness_traits typedef (defined in eoParetoOneConstraintFitness< FitnessTraits >)eoParetoOneConstraintFitness< FitnessTraits >
maximizing(unsigned _i) (defined in eoParetoOneConstraintFitness< FitnessTraits >)eoParetoOneConstraintFitness< FitnessTraits > [inline, static]
operator!=(const eoParetoOneConstraintFitness< FitnessTraits > &_other) const (defined in eoParetoOneConstraintFitness< FitnessTraits >)eoParetoOneConstraintFitness< FitnessTraits > [inline]
operator<(const eoParetoOneConstraintFitness< FitnessTraits > &_other) const eoParetoOneConstraintFitness< FitnessTraits > [inline]
operator<=(const eoParetoOneConstraintFitness< FitnessTraits > &_other) const (defined in eoParetoOneConstraintFitness< FitnessTraits >)eoParetoOneConstraintFitness< FitnessTraits > [inline]
operator==(const eoParetoOneConstraintFitness< FitnessTraits > &_other) const (defined in eoParetoOneConstraintFitness< FitnessTraits >)eoParetoOneConstraintFitness< FitnessTraits > [inline]
operator>(const eoParetoOneConstraintFitness< FitnessTraits > &_other) const (defined in eoParetoOneConstraintFitness< FitnessTraits >)eoParetoOneConstraintFitness< FitnessTraits > [inline]
operator>=(const eoParetoOneConstraintFitness< FitnessTraits > &_other) const (defined in eoParetoOneConstraintFitness< FitnessTraits >)eoParetoOneConstraintFitness< FitnessTraits > [inline]
setUp(unsigned _n, std::vector< bool > &_b)eoParetoOneConstraintFitness< FitnessTraits > [inline, static]
violation() const (defined in eoParetoOneConstraintFitness< FitnessTraits >)eoParetoOneConstraintFitness< FitnessTraits > [inline]

Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_pareto_one_constraint_fitness.html b/trunk/paradiseo-eo/doc/html/classeo_pareto_one_constraint_fitness.html new file mode 100644 index 000000000..085dc360f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_pareto_one_constraint_fitness.html @@ -0,0 +1,95 @@ + + +EO: eoParetoOneConstraintFitness< FitnessTraits > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoParetoOneConstraintFitness< FitnessTraits > Class Template Reference

eoParetoOneConstraintFitness class: std::vector of doubles + constraint value +More... +

+#include <eoParetoConstraintFitness.h> +

+List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef FitnessTraits fitness_traits

Public Member Functions

+ eoParetoOneConstraintFitness (std::vector< double > &_v)
+ eoParetoOneConstraintFitness (std::vector< double > &_v, double _c)
+bool feasible () const
+double violation () const
+double ConstraintValue () const
+void ConstraintValue (double _c)
+bool dominates (const eoParetoOneConstraintFitness< FitnessTraits > &_other) const
 Partial order based on Pareto-dominance.
+bool operator< (const eoParetoOneConstraintFitness< FitnessTraits > &_other) const
 compare *not* on dominance, but on the first, then the second, etc
+bool operator> (const eoParetoOneConstraintFitness< FitnessTraits > &_other) const
+bool operator<= (const eoParetoOneConstraintFitness< FitnessTraits > &_other) const
+bool operator>= (const eoParetoOneConstraintFitness< FitnessTraits > &_other) const
+bool operator== (const eoParetoOneConstraintFitness< FitnessTraits > &_other) const
+bool operator!= (const eoParetoOneConstraintFitness< FitnessTraits > &_other) const

Static Public Member Functions

+void setUp (unsigned _n, std::vector< bool > &_b)
 access to the traits characteristics (so you don't have to write a lot of typedef's around
+bool maximizing (unsigned _i)

Private Attributes

+double constraintValue
+

Detailed Description

+

template<class FitnessTraits = eoParetoFitnessTraits>
+ class eoParetoOneConstraintFitness< FitnessTraits >

+ +eoParetoOneConstraintFitness class: std::vector of doubles + constraint value +

+Comparison (dominance) is done on pareto dominance for 2 feasible individuals, one feasible individual always wins over an infeasible on constraint violations for 2 infeasible individuals

+The template argument FitnessTraits defaults to eoParetoFitnessTraits, which can be replaces at will by any other class that implements the static functions defined therein.

+Note that the domninance defines a partial order, so that !dominates(a,b) && !domaintes(b,a) does not neccessarily imply that (a==b) The other way around does hold.

+However, be careful that the comparison operators do define a total order based on considering first objective, then in case of tie, second objective, etc

+NOTE: in a hurry, I did not want to make it derive from eoParetoFitness (used cut-and-paste instead!) : I know it might be a good idea, but I'm not sure I see why at the moment (any hint someone?) +

+ +

+Definition at line 61 of file eoParetoConstraintFitness.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_pareto_ranking-members.html b/trunk/paradiseo-eo/doc/html/classeo_pareto_ranking-members.html new file mode 100644 index 000000000..482e1483a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_pareto_ranking-members.html @@ -0,0 +1,43 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoParetoRanking< EOT > Member List

This is the complete list of members for eoParetoRanking< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
calculate_worths(const eoPop< EOT > &_pop)eoParetoRanking< EOT > [inline, virtual]
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
dominanceMap (defined in eoParetoRanking< EOT >)eoParetoRanking< EOT > [private]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoParetoRanking(eoDominanceMap< EOT > &_dominanceMap) (defined in eoParetoRanking< EOT >)eoParetoRanking< EOT > [inline]
eoPerf2Worth(std::string _description="Worths")eoPerf2Worth< EOT, double > [inline]
eoPerf2WorthCached(std::string _description="Worths") (defined in eoPerf2WorthCached< EOT, double >)eoPerf2WorthCached< EOT, double > [inline]
eoValueParam(void)eoValueParam< std::vector< double > > [inline]
eoValueParam(std::vector< double >_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< std::vector< double > > [inline]
functor_category()eoUF< const eoPop< EOT > &, void > [inline, static]
getValue(void) const eoValueParam< std::vector< double > > [inline, virtual]
longName() const eoParam [inline]
operator()(const eoPop< EOT > &_pop)eoPerf2WorthCached< EOT, double > [inline, virtual]
operator()(eoPop< EOT > &_pop) (defined in eoPerf2Worth< EOT, double >)eoPerf2Worth< EOT, double > [inline, virtual]
repValue (defined in eoValueParam< std::vector< double > >)eoValueParam< std::vector< double > > [protected]
required() const eoParam [inline]
resize(eoPop< EOT > &_pop, unsigned sz) (defined in eoPerf2WorthCached< EOT, double >)eoPerf2WorthCached< EOT, double > [inline, virtual]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< std::vector< double > > [inline, virtual]
shortName() const eoParam [inline]
sort_pop(eoPop< EOT > &_pop)eoPerf2WorthCached< EOT, double > [inline, virtual]
value()eoValueParam< std::vector< double > > [inline]
value() const eoValueParam< std::vector< double > > [inline]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_pareto_ranking.html b/trunk/paradiseo-eo/doc/html/classeo_pareto_ranking.html new file mode 100644 index 000000000..2e1717cfd --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_pareto_ranking.html @@ -0,0 +1,55 @@ + + +EO: eoParetoRanking< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoParetoRanking< EOT > Class Template Reference

Straightforward pareto ranking. +More... +

+#include <eoParetoRanking.h> +

+

Inheritance diagram for eoParetoRanking< EOT >: +

+ +eoPerf2WorthCached< EOT, double > +eoPerf2Worth< EOT, double > +eoUF< const eoPop< EOT > &, void > +eoValueParam< std::vector< double > > +eoFunctorBase +eoParam + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoParetoRanking (eoDominanceMap< EOT > &_dominanceMap)
+void calculate_worths (const eoPop< EOT > &_pop)
 The actual virtual function the derived classes should implement.

Private Attributes

+eoDominanceMap< EOT > & dominanceMap
+

Detailed Description

+

template<class EOT>
+ class eoParetoRanking< EOT >

+ +Straightforward pareto ranking. +

+Every individual gets a rank according to the number of elements it dominates. Note that without niching, this technique will usually not find the whole front of non-dominated solutions, but will quite likely converge on a single spot on the front. +

+ +

+Definition at line 40 of file eoParetoRanking.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_pareto_ranking.png b/trunk/paradiseo-eo/doc/html/classeo_pareto_ranking.png new file mode 100644 index 0000000000000000000000000000000000000000..dd3d0b5eaf5940d0e413d5a6587d6830959f0331 GIT binary patch literal 2853 zcmbtW2~<<(5)PuWNhn051s7Dn0;0TvEMYOCQNSbu2}F@Z5Jd|Z1i6MifCz{ph(w?e z!@ia%I|*empcYVMNuYp1k*&E2OW8N!g<4Ot)HSalxwTh7?D6qN$juxn6ublZnwhPeg+2m=m1QF z4Sp+!3IWs+1Wg+}yQe_qB(cMbaJJ7=raTveT<9NjbUj6;T6b%5p@!q9`6e#>SuapR z^7Kt?Rf)HTr>!Bn<8}@&sLRKJi@v1esfSM@Etdx#&5KL&*APA-xelS63j~n^2ByKv z4|DjelZS0%iEs7cwB82KM#*80S=4%8M*Yvbr-S+&9LB3>3nEwC&yJ}qersspaUs_v zrR_48sd$Xn)t_3>MR_Ki^CaVxzI$bW$x%Mt@rGZSNbl?j#$9Q2)^NV@+*9sMJtoBQ;da|;4 zm9x)uz(jv#|GNg*AcNZ?SuFHhbu5=3HofI zGR!J2NhsNs)>bpPTmwWb*)g)p*ZMA#8atDw_diSW@G)eUA3)7WhD0oVcVG9Tfc3P9 zx6jEYZl}w9t~Uy1m2Z-8y9e+%TrZPiHky`GKMhRg?qr9w9=1@bc=%>S23h9i^`Py4R>(C7~vHr<|{E=8r)chmejO_CoBb7?!{rkrytt5Ut z)+uIZ2}eK^pz*h|#no1q9$@0dGOVkeRAnuwQ!~dq zOI5;3!g4PkV*H!MqEpQ0H_Pp8@nO|Z7U@r6HZ0peh1sxZe%k(T3H;IV5_6v#PfO&x z!F%-q^t!IvuJ=ai49CAE6TWK+YYb=hQIkFN*76(9)4 zHe_WR{5B4)&m6N zd1a1xxxviPyy<86$Tdr>w$Fa4AeN557uDex zI8D3058e7q z2}b2hVvln%nmr)lptge&75&tBPW{jXaC4yq5{vH{ksC(=!D^R?tqpEv58GFWNw2Vz zhF?*0qYO+MT)CQx3vliM5FQv*Rw{L9L>N&Z+%aFp5DX2qR+~7|%-}PZO6_HYdcF>= z4eEmLY)_8O&x36FGhF82xdGm@S_VB$w~MG0lye!z?(!WFuvJxU4|E8Y(@CZ-kuWR$ zy>(Y=eL}X3iaQ-XqGIa|Jo*eNi4H9x{lc-*`@yj!|{t3QA>_nN3T)|?GbL* zxqDYNZVvZG$LXF+#9i~7iFp}D#>N<<2`*@8zV_%3MA5`myj4X%vjuDkV|9hHE~Zc5 z(iv%94hKH+D>nxvPx?;D_qm6$+?k_0kJorJo2SW}LHCh2Zx(i^j%Mm5jf-)(GLf3x zO~8MY=~LB4?2dR}af+PUF35FJpM=U-NkE(|;gI*DPJt*TKq1xfzK{k{uRsp{H%REa zs98J=o86zauWnI>{SL~pm-#HG@32aK4o&gzY;*Fs;}-S?hg)>+4#;0gRsdW(!n`q4 zOcn~cMKnb0fvyiy!LC=zD!{kl)EMbKiaSGDap&xlG~w^vFYAXqyNJBa4Hvhm5=~8~ zUn0Ci#>2d=$8%z&i?&FllT3=h%nwpTI@1%))v?E&)iHtqss3F8(PGGaK#k{sV4zU& zF7*~m?(3RvBvRrVuvAgeK?aK8K@($jS8OJ%=|;te$`G+nU>b^wuMW|-Z$vl#nU`3K z_r4)w-j!2wKoG_9ncD4Efgt=zEGd46ku0;2y`MR1Ryspm9~YsVI~k%g3iv;${TuB6 z6|xv?Nm2Ypl#`9=SdM@Ycyu1bXa)*;g%J|~%;WE#ry*}<*VCbgph)Wp>3 z-J-d31GxQMR(MblOU$Mm349LvsmqB7V6xaBwuUHNz3>9zm2U9+M(6%ol`EIu0~6{Hy2t6vL6M1PL2_+aPGJ?GFJ)-kZJJDEB|ggS9DQjBnto#pjBJ zp&nh(vBB#kAFLORVdCfIzhB6IrSgAihmbwsMa!yFNYiX_6!Wx1zT_W?m*Z$EUi0i* zG`}x7S>|Tg_f=63f-)f_x@JB7%-BkFCdWVQMP%L=DQn< zI}KmlBW6vSPb`n2m%1rGQONlw(FtzBS9Qo)7#ZBnFlLEIq&j*1Mm3X1t2|5SwSs{y zO9)zRx0#UQKx4-A)?mILm?9B0kMIHHgy=98fLnU~f>~zQtjV0@W0JKx_&sw;s;p@j zhl=eMkcc$Fjk+S + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoParseTree< FType, Node > Member List

This is the complete list of members for eoParseTree< FType, Node >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
className(void) const eoParseTree< FType, Node > [inline, virtual]
const_reference typedef (defined in eoParseTree< FType, Node >)eoParseTree< FType, Node >
EO()EO< FType > [inline]
EO() (defined in EO< FType >)EO< FType > [inline]
eoParseTree(void)eoParseTree< FType, Node > [inline]
eoParseTree(const parse_tree< Node > &tree)eoParseTree< FType, Node > [inline]
eoParseTree(std::istream &is)eoParseTree< FType, Node > [inline]
Fitness typedef (defined in EO< FType >)EO< FType >
fitness() const EO< FType > [inline]
fitness(const Fitness &_fitness)EO< FType > [inline]
fitness(performance_type perf) (defined in EO< FType >)EO< FType > [inline]
fitness(void) const (defined in EO< FType >)EO< FType > [inline]
fitness_traits typedef (defined in EO< FType >)EO< FType >
invalid() const EO< FType > [inline]
invalidate() (defined in EO< FType >)EO< FType > [inline]
invalidate(void) (defined in EO< FType >)EO< FType > [inline]
invalidate_worth(void) (defined in EO< FType >)EO< FType > [inline]
operator<(const EO &_eo2) const EO< FType > [inline]
operator<(const EO< Fitness, Traits > &other) const (defined in EO< FType >)EO< FType > [inline]
operator>(const EO &_eo2) const (defined in EO< FType >)EO< FType > [inline]
operator>(const EO< Fitness, Traits > &other) const (defined in EO< FType >)EO< FType > [inline]
performance(performance_type perf) (defined in EO< FType >)EO< FType > [inline]
performance(void) const (defined in EO< FType >)EO< FType > [inline]
performance_type typedef (defined in EO< FType >)EO< FType >
printOn(std::ostream &os) const eoParseTree< FType, Node > [inline, virtual]
pruneTree(unsigned _size)eoParseTree< FType, Node > [inline, virtual]
readFrom(std::istream &is)eoParseTree< FType, Node > [inline, virtual]
reference typedef (defined in eoParseTree< FType, Node >)eoParseTree< FType, Node >
storage_type typedef (defined in EO< FType >)EO< FType >
Subtree typedef (defined in eoParseTree< FType, Node >)eoParseTree< FType, Node >
worth(worth_type worth) (defined in EO< FType >)EO< FType > [inline]
worth(void) const (defined in EO< FType >)EO< FType > [inline]
worth_type typedef (defined in EO< FType >)EO< FType >
~EO()EO< FType > [inline, virtual]
~eoObject()eoObject [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]

Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_parse_tree.html b/trunk/paradiseo-eo/doc/html/classeo_parse_tree.html new file mode 100644 index 000000000..9cc99fdd2 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_parse_tree.html @@ -0,0 +1,298 @@ + + +EO: eoParseTree< FType, Node > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoParseTree< FType, Node > Class Template Reference
+ +[ParseTree] +

Implementation of parse-tree for genetic programming. +More... +

+#include <gp/eoParseTree.h> +

+

Inheritance diagram for eoParseTree< FType, Node >: +

+ +EO< FType > +eoObject +eoPersistent +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef parse_tree< Node
+>::subtree 		Subtree
+typedef Node reference
+typedef const reference const_reference

Public Member Functions

+ eoParseTree (void)
 Default Constructor.
 eoParseTree (const parse_tree< Node > &tree)
 Copy Constructor.
virtual void pruneTree (unsigned _size)
 To prune me to a certain size.
 eoParseTree (std::istream &is)
 To read me from a stream.
+std::string className (void) const
 My class name.
void printOn (std::ostream &os) const
 To print me on a stream.
void readFrom (std::istream &is)
 To read me from a stream.
+

Detailed Description

+

template<class FType, class Node>
+ class eoParseTree< FType, Node >

+ +Implementation of parse-tree for genetic programming. +

+ +

+Definition at line 54 of file eoParseTree.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class FType, class Node>
eoParseTree< FType, Node >::eoParseTree ( const parse_tree< Node > &  tree  )  [inline]
+
+ + + + + +
+   + + +

+Copy Constructor. +

+

Parameters:
+ + +
tree The tree to copy
+
+ +

+Definition at line 79 of file eoParseTree.h.

+

+ + + + +
+ + + + + + + + + + + + +
+template<class FType, class Node>
eoParseTree< FType, Node >::eoParseTree ( std::istream &  is  )  [inline]
+
+ + + + + +
+   + + +

+To read me from a stream. +

+

Parameters:
+ + +
is The std::istream
+
+ +

+Definition at line 102 of file eoParseTree.h. +

+References eoParseTree< FType, Node >::readFrom().

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class FType, class Node>
virtual void eoParseTree< FType, Node >::pruneTree ( unsigned  _size  )  [inline, virtual]
+
+ + + + + +
+   + + +

+To prune me to a certain size. +

+

Parameters:
+ + +
_size My maximum size
+
+ +

+Definition at line 86 of file eoParseTree.h. +

+Referenced by eoCollapseSubtreeMutation< FType, Node >::operator()(), eoExpansionMutation< FType, Node >::operator()(), eoBranchMutation< FType, Node >::operator()(), and eoSubtreeXOver< FType, Node >::operator()().

+

+ + + + +
+ + + + + + + + + + + + +
+template<class FType, class Node>
void eoParseTree< FType, Node >::printOn ( std::ostream &  os  )  const [inline, virtual]
+
+ + + + + +
+   + + +

+To print me on a stream. +

+

Parameters:
+ + +
os The std::ostream
+
+ +

+Reimplemented from EO< FType >. +

+Definition at line 114 of file eoParseTree.h. +

+References EO< F >::printOn().

+

+ + + + +
+ + + + + + + + + + + + +
+template<class FType, class Node>
void eoParseTree< FType, Node >::readFrom ( std::istream &  is  )  [inline, virtual]
+
+ + + + + +
+   + + +

+To read me from a stream. +

+

Parameters:
+ + +
is The std::istream
+
+ +

+Reimplemented from EO< FType >. +

+Definition at line 128 of file eoParseTree.h. +

+References EO< F >::readFrom(). +

+Referenced by eoParseTree< FType, Node >::eoParseTree().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_parse_tree.png b/trunk/paradiseo-eo/doc/html/classeo_parse_tree.png new file mode 100644 index 0000000000000000000000000000000000000000..89bb2d87bbadf54c49d90f4f6daf1d96ae3eebed GIT binary patch literal 1213 zcmeAS@N?(olHy`uVBq!ia0y~yV5|bN53n!;$sa4WvH&TG0G|-o|Ns93ng9PEm_I*Z z0+0p92M!#lKJ@{ZED*08&A z)m;JqoBxGQ6&N2s{&DH!j}2D!S7mM&J}_2v@p7A~_Uex!k7eC2+sRLtzi`#BGTUp+ z_V32GW4(*dzqt72SX-liRrcCqvp22DVttmEciIUYl>Msqhc{ZR@1WTo!#25RdwoAx zWWJI3b-*wA{)^Lw$yL|IOBa`)zVUuJ^WNK6`VHStH(mZJ@$AOrHI^$n;=U{r-}}P) zQvcu16I(0t7_{a|H=KNZR`)E1D`Wvb<` z-tOA^`-}Hip()-@7o%+o0zR6}zvTQ?I3)g=lSXzh`$LHm$!_DqU(1SeG^gtQ>G;^Q+>4Ty27Q@~$SE z;+SfFFZ=VaH|`I4Qe*I~*zne-*=_rGvM(?HX~`R%^0`jWc=_D#<}W@AO}_R!?QG%p zb(WdMGc60xb{?JS@mH(;#j=le_p-g)uF3mNthEG{#t%wSvHoA9+SBtbHJm@geWiG$H>Uh45R z{PQEW1xi)>I_BvwdfxrwCzQG0*q&p*&kxu2%YQ4Si|u{k`hUZ{nGrjaXU7(QNv@QA z`7lj$ZOPX(iP~V@=r3kh3+4WPh;gsleCfLU-`jgxzE#fuqV_)QZ%qBBg8uu*Z_M5$ z{WVWdbTRuMyDyb*KKB;qrlwv`o_~E#*}dH{$1M-+$-n-)X!0wI>iA;2r_rTF*4?4Z-&h zbmz$GtG;BGh+F;j%?khU(763lY0=ka*DR~cd$WAedFA=~s#^8YHkH~l*M@jdIa`Epj76rY-9oV(7lz|T&T-{}6V&-{`1q{}+?z6z~< saPM*T)z`uNZ$j(!U|xRtN_gUaK{v@QUAd9`z_NzH)78&qol`;+07@igdjJ3c literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_parse_tree_depth_init-members.html b/trunk/paradiseo-eo/doc/html/classeo_parse_tree_depth_init-members.html new file mode 100644 index 000000000..4b582a414 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_parse_tree_depth_init-members.html @@ -0,0 +1,28 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoParseTreeDepthInit< FType, Node > Member List

This is the complete list of members for eoParseTreeDepthInit< FType, Node >, including all inherited members.

+ + + + + + + + + + + + + + +
className() const eoParseTreeDepthInit< FType, Node > [inline, virtual]
current_depth (defined in eoParseTreeDepthInit< FType, Node >)eoParseTreeDepthInit< FType, Node > [private]
eoParseTreeDepthInit(unsigned _max_depth, const std::vector< Node > &_initializor, bool _grow=true, bool _ramped_half_and_half=false)eoParseTreeDepthInit< FType, Node > [inline]
EoType typedef (defined in eoParseTreeDepthInit< FType, Node >)eoParseTreeDepthInit< FType, Node >
functor_category()eoUF< eoParseTree< FType, Node > &, void > [inline, static]
generate(std::list< Node > &sequence, int the_max, int last_terminal=-1) (defined in eoParseTreeDepthInit< FType, Node >)eoParseTreeDepthInit< FType, Node > [inline, private]
grow (defined in eoParseTreeDepthInit< FType, Node >)eoParseTreeDepthInit< FType, Node > [private]
initializor (defined in eoParseTreeDepthInit< FType, Node >)eoParseTreeDepthInit< FType, Node > [private]
max_depth (defined in eoParseTreeDepthInit< FType, Node >)eoParseTreeDepthInit< FType, Node > [private]
operator()(EoType &_tree)eoParseTreeDepthInit< FType, Node > [inline]
eoInit< eoParseTree< FType, Node > >::operator()(eoParseTree< FType, Node > &)=0eoUF< eoParseTree< FType, Node > &, void > [pure virtual]
ramped_half_and_half (defined in eoParseTreeDepthInit< FType, Node >)eoParseTreeDepthInit< FType, Node > [private]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< eoParseTree< FType, Node > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_parse_tree_depth_init.html b/trunk/paradiseo-eo/doc/html/classeo_parse_tree_depth_init.html new file mode 100644 index 000000000..d653dad73 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_parse_tree_depth_init.html @@ -0,0 +1,184 @@ + + +EO: eoParseTreeDepthInit< FType, Node > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoParseTreeDepthInit< FType, Node > Class Template Reference
+ +[ParseTree] +

eoParseTreeDepthInit : the initializer class for eoParseTree +More... +

+#include <gp/eoParseTreeDepthInit.h> +

+

Inheritance diagram for eoParseTreeDepthInit< FType, Node >: +

+ +eoInit< eoParseTree< FType, Node > > +eoUF< eoParseTree< FType, Node > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef eoParseTree< FType,
+ Node > 		EoType

Public Member Functions

 eoParseTreeDepthInit (unsigned _max_depth, const std::vector< Node > &_initializor, bool _grow=true, bool _ramped_half_and_half=false)
 Constructor.
+virtual std::string className () const
 My class name.
void operator() (EoType &_tree)
 initialize a tree

Private Member Functions

+void generate (std::list< Node > &sequence, int the_max, int last_terminal=-1)

Private Attributes

+unsigned max_depth
+std::vector< Node > initializor
+bool grow
+bool ramped_half_and_half
+unsigned current_depth
+

Detailed Description

+

template<class FType, class Node>
+ class eoParseTreeDepthInit< FType, Node >

+ +eoParseTreeDepthInit : the initializer class for eoParseTree +

+ +

+Definition at line 48 of file eoParseTreeDepthInit.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+template<class FType, class Node>
eoParseTreeDepthInit< FType, Node >::eoParseTreeDepthInit ( unsigned  _max_depth,
const std::vector< Node > &  _initializor,
bool  _grow = true,
bool  _ramped_half_and_half = false
)  [inline]
+
+ + + + + +
+   + + +

+Constructor. +

+_max_depth The maximum depth of a tree

Parameters:
+ + + + +
_initializor A std::vector containing the possible nodes
_grow False results in a full tree, True result is a randomly grown tree
_ramped_half_and_half True results in Ramped Half and Half Initialization
+
+ +

+Definition at line 69 of file eoParseTreeDepthInit.h.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class FType, class Node>
void eoParseTreeDepthInit< FType, Node >::operator() ( EoType &  _tree  )  [inline]
+
+ + + + + +
+   + + +

+initialize a tree +

+

Parameters:
+ + +
_tree : the tree to be initialized
+
+ +

+Definition at line 96 of file eoParseTreeDepthInit.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_parse_tree_depth_init.png b/trunk/paradiseo-eo/doc/html/classeo_parse_tree_depth_init.png new file mode 100644 index 0000000000000000000000000000000000000000..920556d8e9c831355c0800bc56715cac74ef00b3 GIT binary patch literal 2060 zcmZ{leLRzUAIB$3b{fjVQ9`(Bu#r)L3tOA4r@47 zlC^oegzqb5jgS3_LRJC}bBOG&_CFC)SJ{fW)P^e@9D%oL&GQ8-?ZD*a#IJ=`Z?jJa&7Bb(JNK78WD5td3HV(UFiWWYaIn|d{ z3GAAT1NVowCAnOFb7qX2P=s2DH#AoVI1-d7&2^ma@zVFgO@XNwrDRF+1`yov$bLH+ zhsf7Y$T0)nbEUTx&lfg1w%Z#{?#eD=E-n_KOJIUdZw6}OndSlODrz7P>wiT8Wei#y zwMnA*n$PDW9^)&@Rn}f<*^*y<*u6JWytO5Pvhl%A9iVj#L(-h@xL^@M9ZfMhUKDVE zYTKnAcC8hwOMxEER1amFD=nfWb8`i;WqSjd?$8!AILU502 zm={H*M-VwU@`^;*xipM?mWF4*%xc80QG~bsDJ?Ydr;e;Q_6(AVW?0IqoSH~6Z;8iF znUeG;Pu$Pe=rtWYt*_TIW&GhCMj0NbzmZq<8J&|@tg?|^3ao|h?9SP)-y4>`;YA+P zqUn0GLM`{>$Dh(Sv7Lt#0^vXPU#VSLa^%yxjgfG%PQYkED_*qam-v9Rr*Nx**6Lj%^r1AF0PyTQ8delF@c)Sv!1 zrNOUqd@WmO$vRan_!Syj->qAJZOthM{cbJ5)kh#wjw2k1GpH2m#52SXLFJ@5TSWLRA~yQA;nxc^EQUGvbG zRvw1*__9z=)%znlG&CPs=9=0d9mSDM*wyyIT!ozZw$QXV|Gl@y5qSayovY4#>13#C znH!1d%NhNrBZhRfn0VZMtrpj8Uq5JeJZm3Nm?s!Z4dr1{5iw+MS|Ub%h`P97|3rbR z;-t|=V=~XbD$F;{K{FW{gfpUW!xUMiTjX^M9NAJh^$mlAaL!GYt+3+ID4AnPSz=Ai zYaI0P#-~#H+&uo6(iSHrqc|P4b`!@o-uLy$7qnFeNGKFZy1G-?T{JhBt_8e@?-q0`pox-%> z>EY4&Wiud^vQGzlP6e0Dp=1OA%b5-0B_A1++h>n{rV`1X%NOE`IbzmH{bTI8>XS(Y zuqGzkeeaV&967AYhS+8VN|(EMqMc&F45`Piuk7Dg-TB9zKMw^Gy2mTPCiUK+;V@=85pK>Zvnzd!Ol< z)P6!ujI2(xZFtN4s5@7Qr+YG!q)rZ;TGUqYsh*IWkphA3hfIwSGo`da>4xEO+s|OJTs`oFY`#%S8mh>$ldIIAWNd zaT(iyi-$Zbtq8nh57tn?Y0sa={Y{Yo4DDWJW1?f>Ht{wmgE_|Z#O-y;mGAEkUgtA*t kV!R8$ydXet8IbOO^eV#BNSFN{{B=Woy^&sxN20R+4Zb7{2mk;8 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_parser-members.html b/trunk/paradiseo-eo/doc/html/classeo_parser-members.html new file mode 100644 index 000000000..8df30a604 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_parser-members.html @@ -0,0 +1,51 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoParser Member List

This is the complete list of members for eoParser, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
className(void) const eoParser [inline, virtual]
createParam(ValueType _defaultValue, std::string _longName, std::string _description, char _shortHand=0, std::string _section="", bool _required=false)eoParameterLoader [inline]
doRegisterParam(eoParam &param) const (defined in eoParser)eoParser [private]
eoParser(unsigned _argc, char **_argv, std::string _programDescription="", std::string _lFileParamName="param-file", char _shortHand= 'p')eoParser
getORcreateParam(ValueType _defaultValue, std::string _longName, std::string _description, char _shortHand=0, std::string _section="", bool _required=false)eoParser [inline]
getParamWithLongName(const std::string &_name) const eoParser
getPrefix() (defined in eoParser)eoParser [inline]
getStopOnUnknownParam() (defined in eoParser)eoParser [inline]
getValue(eoParam &_param) const (defined in eoParser)eoParser [private]
isItThere(eoParam &_param) const eoParser [inline, virtual]
longNameMap (defined in eoParser)eoParser [private]
LongNameMapType typedef (defined in eoParser)eoParser [private]
messages (defined in eoParser)eoParser [mutable, private]
MultiMapType typedef (defined in eoParser)eoParser [private]
needHelp (defined in eoParser)eoParser [private]
params (defined in eoParser)eoParser [private]
prefix (defined in eoParser)eoParser [private]
printHelp(std::ostream &os)eoParser
printOn(std::ostream &os) const eoParser [virtual]
processParam(eoParam &param, std::string section="")eoParser [virtual]
programDescription (defined in eoParser)eoParser [private]
ProgramName() (defined in eoParser)eoParser [inline]
programName (defined in eoParser)eoParser [private]
readFrom(std::istream &is)eoParser [virtual]
resetPrefix() (defined in eoParser)eoParser [inline]
setORcreateParam(ValueType _defaultValue, std::string _longName, std::string _description, char _shortHand=0, std::string _section="", bool _required=false)eoParser [inline]
setPrefix(const std::string &_prefix)eoParser [inline]
setStopOnUnknownParam(bool _b)eoParser [inline]
shortNameMap (defined in eoParser)eoParser [private]
ShortNameMapType typedef (defined in eoParser)eoParser [private]
stopOnUnknownParam (defined in eoParser)eoParser [private]
updateParameters() const (defined in eoParser)eoParser [private]
userNeedsHelp(void)eoParser
~eoObject()eoObject [inline, virtual]
~eoParameterLoader()eoParameterLoader [virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]

Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_parser.html b/trunk/paradiseo-eo/doc/html/classeo_parser.html new file mode 100644 index 000000000..2a0c1105b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_parser.html @@ -0,0 +1,519 @@ + + +EO: eoParser Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoParser Class Reference

eoParser: command line parser and configuration file reader This class is persistent, so it can be stored and reloaded to restore parameter settings. +More... +

+#include <eoParser.h> +

+

Inheritance diagram for eoParser: +

+ +eoParameterLoader +eoObject +eoPersistent +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

 eoParser (unsigned _argc, char **_argv, std::string _programDescription="", std::string _lFileParamName="param-file", char _shortHand= 'p')
 Constructor a complete constructor that reads the command line an optionally reads a configuration file.
+void processParam (eoParam &param, std::string section="")
 Processes the parameter and puts it in the appropriate section for readability.
void readFrom (std::istream &is)
 Read object.
void printOn (std::ostream &os) const
 Write object.
+std::string className (void) const
 className for readibility
+bool userNeedsHelp (void)
 true if the user made an error or asked for help
+void printHelp (std::ostream &os)
 Prints an automatic help in the specified output using the information provided by parameters.
+std::string ProgramName ()
virtual bool isItThere (eoParam &_param) const
 Has param been entered by user?
eoParam * getParamWithLongName (const std::string &_name) const
 get a handle on a param from its longName
template<class ValueType>
eoValueParam< ValueType > & getORcreateParam (ValueType _defaultValue, std::string _longName, std::string _description, char _shortHand=0, std::string _section="", bool _required=false)
 Get or create parameter.
template<class ValueType>
eoValueParam< ValueType > & setORcreateParam (ValueType _defaultValue, std::string _longName, std::string _description, char _shortHand=0, std::string _section="", bool _required=false)
 Set parameter value or create parameter.
+void setStopOnUnknownParam (bool _b)
 accessors to the stopOnUnknownParam value
+bool getStopOnUnknownParam ()
+void setPrefix (const std::string &_prefix)
 Prefix handling.
+void resetPrefix ()
+std::string getPrefix ()

Private Types

+typedef std::multimap< std::string,
+ eoParam * > 		MultiMapType
+typedef std::map< char, std::string > ShortNameMapType
+typedef std::map< std::string,
+ std::string > 		LongNameMapType

Private Member Functions

+void doRegisterParam (eoParam &param) const
+std::pair< bool, std::string > getValue (eoParam &_param) const
+void updateParameters () const

Private Attributes

+MultiMapType params
+std::string programName
+std::string programDescription
+ShortNameMapType shortNameMap
+LongNameMapType longNameMap
+eoValueParam< bool > needHelp
+eoValueParam< bool > stopOnUnknownParam
+std::vector< std::string > messages
+std::string prefix
+

Detailed Description

+eoParser: command line parser and configuration file reader This class is persistent, so it can be stored and reloaded to restore parameter settings. +

+ +

+Definition at line 100 of file eoParser.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
eoParser::eoParser ( unsigned  _argc,
char **  _argv,
std::string  _programDescription = "",
std::string  _lFileParamName = "param-file",
char  _shortHand = 'p'
) 
+
+ + + + + +
+   + + +

+Constructor a complete constructor that reads the command line an optionally reads a configuration file. +

+myEo --param-file=param.rc will then load using the parameter file param.rc

+

Parameters:
+ + + + + + +
_argc command line arguments count
_argv command line parameters
_programDescription Description of the work the program does
_lFileParamName Name of the parameter specifying the configuration file (--param-file)
_shortHand Single charachter shorthand for specifying the configuration file
+
+
+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + +
void eoParser::readFrom ( std::istream &  is  )  [virtual]
+
+ + + + + +
+   + + +

+Read object. +

+

Parameters:
+ + +
_is A std::istream.
+
+
Exceptions:
+ + +
runtime_std::exception If a valid object can't be read.
+
+ +

+Implements eoPersistent.

+

+ + + + +
+ + + + + + + + + +
void eoParser::printOn ( std::ostream &  os  )  const [virtual]
+
+ + + + + +
+   + + +

+Write object. +

+It's called printOn since it prints the object on a stream.

Parameters:
+ + +
_os A std::ostream.
+
+ +

+Implements eoPrintable.

+

+ + + + +
+ + + + + + + + + +
virtual bool eoParser::isItThere ( eoParam &  _param  )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Has param been entered by user? +

+Checks if _param has been actually entered by the user +

+Implements eoParameterLoader. +

+Definition at line 148 of file eoParser.h. +

+Referenced by setORcreateParam().

+

+ + + + +
+ + + + + + + + + +
eoParam* eoParser::getParamWithLongName ( const std::string &  _name  )  const
+
+ + + + + +
+   + + +

+get a handle on a param from its longName +

+if not found, returns 0 (null pointer :-)

+Not very clean (requires hard-coding of the long name twice!) but very useful in many occasions... +

+Referenced by getORcreateParam().

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+template<class ValueType>
eoValueParam<ValueType>& eoParser::getORcreateParam ( ValueType  _defaultValue,
std::string  _longName,
std::string  _description,
char  _shortHand = 0,
std::string  _section = "",
bool  _required = false
)  [inline]
+
+ + + + + +
+   + + +

+Get or create parameter. +

+It seems finally that the easiest use of the above method is through the following, whose interface is similar to that of the widely-used createParam.

+For some (probably very stupid) reason, I failed to put it in the .cpp. Any hint??? +

+Definition at line 173 of file eoParser.h. +

+References eoParameterLoader::createParam(), and getParamWithLongName().

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+template<class ValueType>
eoValueParam<ValueType>& eoParser::setORcreateParam ( ValueType  _defaultValue,
std::string  _longName,
std::string  _description,
char  _shortHand = 0,
std::string  _section = "",
bool  _required = false
)  [inline]
+
+ + + + + +
+   + + +

+Set parameter value or create parameter. +

+This makes sure that the specified parameter has the given value. If the parameter does not exist yet, it is created.

+This requires that operator<< is defined for ValueType.

+

Parameters:
+ + + + + + + +
_defaultValue Default value.
_longName Long name of the argument.
_description Description of the parameter.
_shortName Short name of the argument (Optional)
_section Name of the section where the parameter belongs.
_required Is the parameter mandatory?
+
+
Returns:
Corresponding parameter.
+ +

+Definition at line 211 of file eoParser.h. +

+References eoParameterLoader::createParam(), isItThere(), and eoValueParam< ValueType >::setValue().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:52 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_parser.png b/trunk/paradiseo-eo/doc/html/classeo_parser.png new file mode 100644 index 0000000000000000000000000000000000000000..d4c9724607f3e31e47c3366263d47d46f6f032a0 GIT binary patch literal 1063 zcmeAS@N?(olHy`uVBq!ia0y~yVC(?0J6M>3B)?SRLLem(;1lBd|Nnm=^Z)+?^XDf_ z0J6aNz<~qRhyFhSav4j4{DK)Ap4~`eU|`EaktG3V_p?@5mp1YF*pUBhdBptgA? z_tjJ1?GHJKa;%yEG|X+u5(U|d$2daw=h&6)_*`b)^6#zCY`fR*i`(mNe2Kj4V$OJ_ z)tBY@rOEmAEthAWc%yFmux1XM@x#6R2aktuJimP3gL8>WlhkTVA3iG1`FUmft(S*Z z`Yf@1*c%@{$$o05N51jJ85*_c<{oir%=c-r5>CG@{9es(tNN>#CNn&iPqx4M^2^*^ zoC|h!<}t0vTQr;Dl~DZ6nh6^i1%%8P9O~n8m>TpFAAJ=vJ5(2Y=!mLWnR%fEr!<3N zBC~=@4ns=|Zv#}V(;+qoj~fgeWJrE`X!YQ}^dF&ydXtadA2@e$Y9Ca8p|-|lukG>x z_fw234K9D5sj%cuQ1Rg;xsq*1qW#Wo-@bqOwtGH3`r97Yryt60Tl30VxXz~Ts>@_2 z-?Iw@uZYAITlPyi?Xq{>cZoZ`O;`BJlL)S@&vr#+b$9;huIZcUDx#ZcAvS65jEtZa zD>&cbv2T z7X=#zewyfPaka{9=8C{mYfrB{@~_0~&BCKjTg^=`E(w^c$29%y>&<1N!j&s{qs;=f z(}Ztryy~(sqYZz*+_wFwb9&`n;m>NfL{^<%KIyvkoVlD;UOQ?seiT`) zopD0+ZS5k$QwetYKk`T5>!f=Yy?In%Zs+OB#{^T+&q zurOws&k)e`zm|K&k*+6~8_qwP{y_MRJ|jo*Cty4lt zcd1XQtC+=S+m`0zQZ>8t%R-e#tGCwEIp2l~r!sx&zPZr-!mW8H)K1Ntajzyu_-l#R y*>*kkx3l|fHgvvyrPlCD4Vn!!eubO;XEfV5$w9g4dnPbfGkCiCxvX + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPerf2Worth< EOT, WorthT > Member List

This is the complete list of members for eoPerf2Worth< EOT, WorthT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + +
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoPerf2Worth(std::string _description="Worths")eoPerf2Worth< EOT, WorthT > [inline]
eoValueParam(void)eoValueParam< std::vector< WorthT > > [inline]
eoValueParam(std::vector< WorthT >_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< std::vector< WorthT > > [inline]
functor_category()eoUF< const eoPop< EOT > &, void > [inline, static]
getValue(void) const eoValueParam< std::vector< WorthT > > [inline, virtual]
longName() const eoParam [inline]
operator()(eoPop< EOT > &_pop) (defined in eoPerf2Worth< EOT, WorthT >)eoPerf2Worth< EOT, WorthT > [inline, virtual]
eoUF< const eoPop< EOT > &, void >::operator()(const eoPop< EOT > &)=0eoUF< const eoPop< EOT > &, void > [pure virtual]
repValue (defined in eoValueParam< std::vector< WorthT > >)eoValueParam< std::vector< WorthT > > [protected]
required() const eoParam [inline]
resize(eoPop< EOT > &_pop, unsigned sz) (defined in eoPerf2Worth< EOT, WorthT >)eoPerf2Worth< EOT, WorthT > [inline, virtual]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< std::vector< WorthT > > [inline, virtual]
shortName() const eoParam [inline]
sort_pop(eoPop< EOT > &_pop)eoPerf2Worth< EOT, WorthT > [inline, virtual]
value()eoValueParam< std::vector< WorthT > > [inline]
value() const eoValueParam< std::vector< WorthT > > [inline]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_perf2_worth.html b/trunk/paradiseo-eo/doc/html/classeo_perf2_worth.html new file mode 100644 index 000000000..ff1707b7a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_perf2_worth.html @@ -0,0 +1,58 @@ + + +EO: eoPerf2Worth< EOT, WorthT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPerf2Worth< EOT, WorthT > Class Template Reference

Base class to transform raw fitnesses into fitness for selection. +More... +

+#include <eoPerf2Worth.h> +

+

Inheritance diagram for eoPerf2Worth< EOT, WorthT >: +

+ +eoUF< const eoPop< EOT > &, void > +eoValueParam< std::vector< WorthT > > +eoFunctorBase +eoParam +eoPerf2WorthCached< EOT, WorthT > + +List of all members. + + + + + + + + + + + + +

Public Member Functions

+ eoPerf2Worth (std::string _description="Worths")
 default constructor
+virtual void sort_pop (eoPop< EOT > &_pop)
 Sort population according to worth, will keep the worths and fitness_cache in sync with the population.
+virtual void resize (eoPop< EOT > &_pop, unsigned sz)
+virtual void operator() (eoPop< EOT > &_pop)
+

Detailed Description

+

template<class EOT, class WorthT = double>
+ class eoPerf2Worth< EOT, WorthT >

+ +Base class to transform raw fitnesses into fitness for selection. +

+

See also:
eoSelectFromWorth
+ +

+ +

+Definition at line 43 of file eoPerf2Worth.h.

The documentation for this class was generated from the following files: +
Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_perf2_worth.png b/trunk/paradiseo-eo/doc/html/classeo_perf2_worth.png new file mode 100644 index 0000000000000000000000000000000000000000..5279796debe0a828cee91ffc054bbe956a856294 GIT binary patch literal 2624 zcmcImdpMNa8XpOvnN&)(+1lk2ju}PC5V;*j<2uYJCW$edk#hOSH7Qie{n{kDU@%6x z=5wn&O?#3dW{7F1Cgjr~at(84?|sgB_CM!5oj=a={MK6UTF?8gwVw6iJle}ok%}|5!tPW-#kS-=bT1tjSi_v#Kp1av!VsWXeB>JC zh8c6$_=W3PhmN(QZU-4M9STrVYOmgRnrR9?7H9op?%#-IjZROvuIA#wV-7Ef325Sp zLgZc=MG`s{5AG~x?4VITyey}ZPY-$>$+#$w?p6-&kE=lt@&s>A^3UPd-0P;7n{fKx^(!A^!@2c+I!13x*vq#AUC4A)a7KpJxTx+J>TwP_ z>RRP@U0U;a$z0lCGH=|tnTpD7ZH%VrCi*8&2g?J`Vq;_6I56!y9?P$79Jv+9ZX!*ejC)t6b>7>i@I=-uEc!pgpq>l_J0OQQ)HZ;{}~YQC>*B#{~R76 zU#<5j5wAF78s{%Fmi_ZpETBa82K6 zxYA+gLtSp7MMT8LlTR9+$i(v=d**8K_LXOG`J>61ph834kwmG44z68OPVeZeQM>}v z$~vU(o$7P9E)MH#n^i9&0P3yiaaJKE#!U#gy(9iFeY@}~_P7Nd71G*C9i?SI;0^v_ zK9@VhLfx?6*Xh;h`Ito+azE^eKXsgHVeG5aHi0%PO+8@J+(jCNYIqtKw=&AQYuT!8 z@8bQM7Qp82a%u>m=vC}Y0H+=)#`Yt>Dw^L6HY8(GqN-6bf~i*M+ARG+xf6LUCoqVr zU=WDL&K_R%IuiYOfZuwOxXI&Vu+pB>asAWVRb2vHBDQjyEG@c2>@55*GHJ!~V%q8gf$4vVp{>Va|pC_r}nZ2@HK-e(huAX@YR4d8d0` zm!4%&COo`s*JSAhd1YC(uq%lm*WK_%#8224<|U^D+EsHZj%kYrRv&i@+A zk4nN!lo%JDO`7;=cs@*#oIl$*U(!k4-L&H>>e0lnW*ykFo6)N*gAwI#Js|^04IWm^~WVoen*^&?>4#3GA7?QRU~k*CPOqP+jBQ@q(0^zI?yK?Q;k)*s_9qo?3x z__u!p4z=Y*suDj(ecjSdF^XdVg_k_}cjlqRSoQ4#sPdWVIU5?K%$iR+IIrGN0j&u4q&xs0+4ZZ9ZuKA$d71~0bGRB z02>Eb{W6JkE~@mZm_urxBoG!kDxCT`lSw3ouTG8deBoFC-uw}9JZ&tlM!io0et#-cJa z*2S+On#!ApJkMGBR$T`7zop4*`KgJHu4fX!o;9f}r@KDA6te@HuIXmke~xcXH1+^$Yl}6YP&m$B3cTSO+y0;rh6~p38!ao27oD5|E literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_perf2_worth_1_1compare__worth-members.html b/trunk/paradiseo-eo/doc/html/classeo_perf2_worth_1_1compare__worth-members.html new file mode 100644 index 000000000..7088c6e8c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_perf2_worth_1_1compare__worth-members.html @@ -0,0 +1,17 @@ + + +EO: Member List + + + + +

eoPerf2Worth< EOT, WorthT >::compare_worth Member List

This is the complete list of members for eoPerf2Worth< EOT, WorthT >::compare_worth, including all inherited members.

+ + + +
compare_worth(const std::vector< WorthT > &_worths) (defined in eoPerf2Worth< EOT, WorthT >::compare_worth)eoPerf2Worth< EOT, WorthT >::compare_worth [inline]
operator()(unsigned a, unsigned b) const (defined in eoPerf2Worth< EOT, WorthT >::compare_worth)eoPerf2Worth< EOT, WorthT >::compare_worth [inline]
worths (defined in eoPerf2Worth< EOT, WorthT >::compare_worth)eoPerf2Worth< EOT, WorthT >::compare_worth [private]

Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_perf2_worth_1_1compare__worth.html b/trunk/paradiseo-eo/doc/html/classeo_perf2_worth_1_1compare__worth.html new file mode 100644 index 000000000..b17dc6d2d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_perf2_worth_1_1compare__worth.html @@ -0,0 +1,42 @@ + + +EO: eoPerf2Worth< EOT, WorthT >::compare_worth Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPerf2Worth< EOT, WorthT >::compare_worth Class Reference

helper class used to sort indices into populations/worths +More... +

+#include <eoPerf2Worth.h> +

+List of all members. + + + + + + + + + +

Public Member Functions

+ compare_worth (const std::vector< WorthT > &_worths)
+bool operator() (unsigned a, unsigned b) const

Private Attributes

+const std::vector< WorthT > & worths
+

Detailed Description

+

template<class EOT, class WorthT = double>
+ class eoPerf2Worth< EOT, WorthT >::compare_worth

+ +helper class used to sort indices into populations/worths +

+ +

+Definition at line 83 of file eoPerf2Worth.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_perf2_worth_cached-members.html b/trunk/paradiseo-eo/doc/html/classeo_perf2_worth_cached-members.html new file mode 100644 index 000000000..a8840d79b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_perf2_worth_cached-members.html @@ -0,0 +1,42 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPerf2WorthCached< EOT, WorthT > Member List

This is the complete list of members for eoPerf2WorthCached< EOT, WorthT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + +
calculate_worths(const eoPop< EOT > &_pop)=0eoPerf2WorthCached< EOT, WorthT > [pure virtual]
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoPerf2Worth(std::string _description="Worths")eoPerf2Worth< EOT, WorthT > [inline]
eoPerf2WorthCached(std::string _description="Worths") (defined in eoPerf2WorthCached< EOT, WorthT >)eoPerf2WorthCached< EOT, WorthT > [inline]
eoValueParam(void)eoValueParam< std::vector< WorthT > > [inline]
eoValueParam(std::vector< WorthT >_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< std::vector< WorthT > > [inline]
fitness_cache (defined in eoPerf2WorthCached< EOT, WorthT >)eoPerf2WorthCached< EOT, WorthT > [private]
functor_category()eoUF< const eoPop< EOT > &, void > [inline, static]
getValue(void) const eoValueParam< std::vector< WorthT > > [inline, virtual]
longName() const eoParam [inline]
operator()(const eoPop< EOT > &_pop)eoPerf2WorthCached< EOT, WorthT > [inline, virtual]
operator()(eoPop< EOT > &_pop) (defined in eoPerf2Worth< EOT, WorthT >)eoPerf2Worth< EOT, WorthT > [inline, virtual]
repValue (defined in eoValueParam< std::vector< WorthT > >)eoValueParam< std::vector< WorthT > > [protected]
required() const eoParam [inline]
resize(eoPop< EOT > &_pop, unsigned sz) (defined in eoPerf2WorthCached< EOT, WorthT >)eoPerf2WorthCached< EOT, WorthT > [inline, virtual]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< std::vector< WorthT > > [inline, virtual]
shortName() const eoParam [inline]
sort_pop(eoPop< EOT > &_pop)eoPerf2WorthCached< EOT, WorthT > [inline, virtual]
value()eoValueParam< std::vector< WorthT > > [inline]
value() const eoValueParam< std::vector< WorthT > > [inline]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_perf2_worth_cached.html b/trunk/paradiseo-eo/doc/html/classeo_perf2_worth_cached.html new file mode 100644 index 000000000..d288d0a8d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_perf2_worth_cached.html @@ -0,0 +1,101 @@ + + +EO: eoPerf2WorthCached< EOT, WorthT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPerf2WorthCached< EOT, WorthT > Class Template Reference

Perf2Worth with fitness cache. +More... +

+#include <eoPerf2Worth.h> +

+

Inheritance diagram for eoPerf2WorthCached< EOT, WorthT >: +

+ +eoPerf2Worth< EOT, WorthT > +eoUF< const eoPop< EOT > &, void > +eoValueParam< std::vector< WorthT > > +eoFunctorBase +eoParam + +List of all members. + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoPerf2WorthCached (std::string _description="Worths")
void operator() (const eoPop< EOT > &_pop)
 Implementation of the operator(), updating a cache of fitnesses.
+virtual void calculate_worths (const eoPop< EOT > &_pop)=0
 The actual virtual function the derived classes should implement.
+virtual void sort_pop (eoPop< EOT > &_pop)
 Sort population according to worth, will keep the worths and fitness_cache in sync with the population.
+virtual void resize (eoPop< EOT > &_pop, unsigned sz)

Private Attributes

+std::vector< typename EOT::Fitness > fitness_cache
+

Detailed Description

+

template<class EOT, class WorthT = typename EOT::Fitness>
+ class eoPerf2WorthCached< EOT, WorthT >

+ +Perf2Worth with fitness cache. +

+ +

+Definition at line 111 of file eoPerf2Worth.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT, class WorthT = typename EOT::Fitness>
void eoPerf2WorthCached< EOT, WorthT >::operator() ( const eoPop< EOT > &  _pop  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Implementation of the operator(), updating a cache of fitnesses. +

+Calls the virtual function calculate_worths when one of the fitnesses has changed. It is not virtual, but derived classes can remove the fitness caching trough the third template element +

+Implements eoUF< const eoPop< EOT > &, void >. +

+Definition at line 125 of file eoPerf2Worth.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_perf2_worth_cached.png b/trunk/paradiseo-eo/doc/html/classeo_perf2_worth_cached.png new file mode 100644 index 0000000000000000000000000000000000000000..faebd2b34aa809e22bcb350bef06375edafb23df GIT binary patch literal 2605 zcmcguc~H{Z9>>gZDXQ0EX=*MlMk-y(QZroe8ZKnGPzh+IQeGn!5S7wgySAs9CLy#K zpk65Ty8PVrm1$-rn3_tNoMu?#=M&(eR;x8ot!`qmLa%7hKU-5% z6TL`myuTyAdp@w3h5dUe{-Dan^UrRWoAx6aV>;|d-qM-AD%o~n#c-N zsUE*|M^be6Uw+@PZ%E4cxgsPXH9NqFq$XToxZ)Q>Hi&<+u1e1Io@4~`lJVy@ods~- zc-v*7TrKJb7rdSyR$r7mL6ttbiv1%8QY0p(REl_`G3tTHkE6FR?e;};lfi1ti0fvi z8cjaqSH=LA8WSIFl8#tYHupR!{t#8nXg|a&56BBT{kont^)9?n?`z4|`!Nv#JmJxk z#;iRi#IXvwPnOgtruPN~mm&*T7%MG&hega73f&9$^>-AryjYQ^N*|qQNMTj}bn4SXYvIq-``(-SDOQVj9b5=XAA!e(3hN=`XKTEKbb z!%TcoLi{9he%C$OKiV2qZdg0Gdg`TWERuZqRj8mk%TY3j&}kt!=W$PqGBz>_jz{g9 zMwuy*%wf*es$+1fJa*4@2&+UEQmhHXF-t`}&Dv*_jt>QlwDWs!Y8?Ixa5^;kS!*g#_5FZc_Se!DZMt8F0Vkx8)?R z=Oq}Jw2own3r!&jNO^ z`3vj5;WY9A%`3^;54&I<7AYGBJw=N#X0L8AO)<)BNHomK zD!%9 z`MMx=b~_c?4}7^rAPN2Zzogj|E->`3dJZ?3y97*IuDul4wxau<6nE>ONy;X^?@JKO z_?}SOU8yULkE5wJ-tBrg@-m2&8cM6g@oOlKWP<)}S)IioqxUQ<(2~0Qh5$1FIU;Q- zeNJGW(;pYLmGc@~GhJ!k)W|ir)h&eAraQ>l;F77z0qjnvVCPq;2dkcxNuCl19`5*E zAVouc*uUYNkeeE+DTVjY){1`WR%no+4I|VeAF4^6k8uL-9R#t z0^>ShG<7U7n6h>}HU9v!#NiVa-McDL{Ib4_g(YRN#|WC-5%1Ul^x=mIJF7QD@A|cN z@kVKc0%&FhQUt~=LPrjIm>^k{Bmcb3j>7!KzGdBrrH>jQ?P&>k%X7jVNk48ph#R|R zcKGwN*VoZ@5%Jc#!R*$-xb(GTsD@qKTVXw!Wkq%qB(H589u$|OEj{NT=+%_r zhi}Fu{wY8#TfUvmU&D1;#f3^3J*Z^BM$2r($>dae<-8904sFj#I8vF?Bn1eXot~)syQ3#2rHvmu~JO%AbF|F2*|V*ZVjW!*jgVp)h1 z+%g0a?J)S4d8Yu!UTB3ApM6wbxbUL%Yn^VIeYrpI`|82qXpnU99#Rau5i1-T5k0Wj zc_#{uf3f(cAGYfra6C(=Hv0_Iu5#*$W&Q#LtCGQYD8wel6PvZTbcPM}h6lLR2+>^6 zDDLxpa+BMS(|Fs%K{7Fi7oAXXsN0L;4x~0c!y$P6hvu0Ge`diw1Z^%pX$~o__`~fg z;7ilQi4z#70_H}v>Y}u4LX}@t%^Q&Dv`=5X?IFtgJGKL|2+Pi=I$*Y(-0^e%;TmYt z#on3^%R61d6Pa&9dUfb0ZFYgEC&`_));;hBcf3Oz7aFXx&=%#UDPRm8X~B=?G1p4h zT+t+0Q=?pLtV}=wpC9J*COi4{Zq2VK(L5%8uOo=7saj_a{r`Y6fqULuY`SFf3Iryx zHDR0oSleET#GK|rfYmPNVCw*@g19@jr9A?qv+?~gBSbM98rl95t*)nk4jF%oeN z7&7y#0-v|1;6HYKJE}~K*IT+NR2h=d(3;VqQozt6n>$@mG`X+M&>gs;?|d{SrlCAK zZP3%Lxs^xGLlB=A*Ywfxw@H6*e^)H;wH3SK9lWV`;G9P?cy5_gzJ*&(KWKP^kcX|J zfT + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPerf2WorthCached< EOT, WorthT >::compare_worth Member List

This is the complete list of members for eoPerf2WorthCached< EOT, WorthT >::compare_worth, including all inherited members.

+ + + +
compare_worth(const std::vector< WorthT > &_worths) (defined in eoPerf2WorthCached< EOT, WorthT >::compare_worth)eoPerf2WorthCached< EOT, WorthT >::compare_worth [inline]
operator()(unsigned a, unsigned b) const (defined in eoPerf2WorthCached< EOT, WorthT >::compare_worth)eoPerf2WorthCached< EOT, WorthT >::compare_worth [inline]
worths (defined in eoPerf2WorthCached< EOT, WorthT >::compare_worth)eoPerf2WorthCached< EOT, WorthT >::compare_worth [private]

Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_perf2_worth_cached_1_1compare__worth.html b/trunk/paradiseo-eo/doc/html/classeo_perf2_worth_cached_1_1compare__worth.html new file mode 100644 index 000000000..9002bf700 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_perf2_worth_cached_1_1compare__worth.html @@ -0,0 +1,42 @@ + + +EO: eoPerf2WorthCached< EOT, WorthT >::compare_worth Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPerf2WorthCached< EOT, WorthT >::compare_worth Class Reference

helper class used to sort indices into populations/worths +More... +

+#include <eoPerf2Worth.h> +

+List of all members. + + + + + + + + + +

Public Member Functions

+ compare_worth (const std::vector< WorthT > &_worths)
+bool operator() (unsigned a, unsigned b) const

Private Attributes

+const std::vector< WorthT > & worths
+

Detailed Description

+

template<class EOT, class WorthT = typename EOT::Fitness>
+ class eoPerf2WorthCached< EOT, WorthT >::compare_worth

+ +helper class used to sort indices into populations/worths +

+ +

+Definition at line 200 of file eoPerf2Worth.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_persistent-members.html b/trunk/paradiseo-eo/doc/html/classeo_persistent-members.html new file mode 100644 index 000000000..719985120 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_persistent-members.html @@ -0,0 +1,18 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPersistent Member List

This is the complete list of members for eoPersistent, including all inherited members.

+ + + + +
printOn(std::ostream &_os) const =0eoPrintable [pure virtual]
readFrom(std::istream &_is)=0eoPersistent [pure virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]

Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_persistent.html b/trunk/paradiseo-eo/doc/html/classeo_persistent.html new file mode 100644 index 000000000..ec2f085eb --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_persistent.html @@ -0,0 +1,108 @@ + + +EO: eoPersistent Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPersistent Class Reference

An persistent object that knows how to write (through functions inherited from eoPrintable#) and read itself. +More... +

+#include <eoPersistent.h> +

+

Inheritance diagram for eoPersistent: +

+ +eoPrintable +EO< F > +EO< double > +EO< EOT::Fitness > +EO< Fit > +EO< Fitness > +EO< fitness_type > +EO< fitnessT > +EO< FitT > +EO< FType > +EO< phenotype > +EO< PyFitness > +eoContinue< EOT > +eoDistribution< EOT > +eoHowMany +eoIntBounds +eoParser +eoPop< EOT > +eoPop< Dummy > +eoPop< PyEO > +eoRealBounds +eoRealVectorBounds +eoRng + +List of all members. + + + + + + + + +

Public Member Functions

+virtual ~eoPersistent ()
 Virtual dtor. They are needed in virtual class hierarchies.
virtual void readFrom (std::istream &_is)=0
 Read object.
+

Detailed Description

+An persistent object that knows how to write (through functions inherited from eoPrintable#) and read itself. +

+ +

+Definition at line 52 of file eoPersistent.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + +
virtual void eoPersistent::readFrom ( std::istream &  _is  )  [pure virtual]
+
+ + + + + +
+   + + +

+Read object. +

+

Parameters:
+ + +
_is A std::istream.
+
+
Exceptions:
+ + +
runtime_std::exception If a valid object can't be read.
+
+ +

+Implemented in EO< F >, eoContinue< EOT >, eoGenContinue< EOT >, eoPop< EOT >, eoVector< FitT, GeneType >, eoEsFull< Fit >, eoEsSimple< Fit >, eoEsStdev< Fit >, eoBit< FitT >, eoPBILDistrib< EOT >, eoParseTree< FType, Node >, eoExternalEO< Fit, External >, eoHowMany, eoIntNoBounds, eoIntInterval, eoIntBelowBound, eoIntAboveBound, eoGeneralIntBounds, eoParser, eoRealNoBounds, eoRealInterval, eoRealBelowBound, eoRealAboveBound, eoGeneralRealBounds, eoRealVectorBounds, eoRng, EO< double >, EO< EOT::Fitness >, EO< FitT >, EO< phenotype >, EO< fitnessT >, EO< Fit >, EO< FType >, EO< fitness_type >, EO< Fitness >, EO< PyFitness >, eoPop< PyEO >, eoPop< Dummy >, eoVector< Fit, double >, eoVector< FitT, double >, and eoVector< FitT, bool >. +

+Referenced by eoState::load().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_persistent.png b/trunk/paradiseo-eo/doc/html/classeo_persistent.png new file mode 100644 index 0000000000000000000000000000000000000000..b4ec9b5d56ce5a37e49e892cd69fcefd6a4fc92c GIT binary patch literal 4317 zcmbtYc~nz(+Qt!Fut-})77H0#F#>KC5f!+Zp;C(|QK6z$NfkAN2oy5}NbXH479Fja zwm48WZ;?%Q1d#$EF;Iz0;g&TCO9BQHA&`ZTeH(12^V#qF=A15n+~57(=iGbF^LyXt zeV_N-YX`&j+S$6;T3K1yg?zB*u$9#!H!CZfKU*(eK+bSIyccdx2lqz=TP&7^t;O;X zhClvdVfW+p@Zm#pyJd3WanauohlN}HMZ`U4W%W8CWY1qCQu1dDjuR(0tO@SNsN%j} z^wc>5dpD9gX}tP_`=xd33Rm5%`_x;^pSqq+C`oqzVsXK@atS6rJdPIPhrnZBl7o9n&dLv^Z=do^S}HQ=JKU(u-8T$M32 zjGw{uc44ocCyjQ9-QNtnGKenbq!C<)@jJEJ63F)cG{zr}GU1(Zm56X>dc06_R?b?A z0{N_AP`t~s-4uh|6Dh^aHoFH-N}U*i`L=7TbYDvl?ce0R<3+5!muX8-c7O}G{b!(m zh<%ck4#1AawWx*5=Ov!611F0_?^yEKF#kKTygCYyDtmYK;z6w<7MxS)Qf3wNgqFA| zrItr?#O#G>8|GqlE@QyjCS*ofdM?MjzjhCdr~&&g=fjJ_cSjw%cNv*KJ)Z-2u7Aqt z9}q{Yu2JjF{d~MDPBC$j{!B~K-gm_%eEK7|TzDorj-kwFk}3MPqEnlEQL!%GIGQjzjINw)niL*^gT74h zhRaFNeBxC3o9DSee5%)Hj7g<9)`&F}tH0bG$Ii|%XTsF5J-Isi5H_cDACT6iB=R-c9GIXyffQ&B7mdJ#6M$BNr z?EAnel9RDTtD&z<<%WJJ#Uz#xQ7U6gim`sPKI-mY4aKNtO-LYwj(C@fyU7VL-1__Q zjoJg2<$(q)(HtU_BywWFHXA@Q_paJ3Z+aIMErY3RmCZ!TsW?Wz?f+!>7bJhyK=(Lg8njRPxmBhWsTR2c5KLQoc=qAzPqLsA+lli}N)k;b{x@4+YA$d6wud(oGQYI?Ym z;&|+cDv^vr`PsmlTkz=!=95E`c{r}E6&b14wETy>CpV zBNy^b-=QJ0a#wnVu*>ebqLIgE1Y0}{s5?x&GHV7)t9R3mcCopJ_vSR{?&vP@ur9q( z7v}w6Wc!~(C9Ccc1E!pzuJs(Os}ZLQ17Op^i9|(8;sKn3{QuCBn!@74{S+8+Q1uam~~WY zU%&&frT}*|Pj>%L|5bxO@gzi|VmU>WXDU1>zqWe%V8_%p*(R_v&%}@wKwUqaV!01>!u(<4|+*iIyca!n;l2@R>24APFx>Tw)GGSb7y^)%1XF_4>*ZywYEBg zd&-taQhNvH#vmLM+QA~b6KTM#9$Ehqj`!+I*v4Rdu;KP+B<*(vL3C%hId#7-|Kk~x zyUvg)y7!zgYiu6|%N%}gPXEdBFM-@v{n1vpv)eI`mclYaz=4T=io6@_T$|JG7+F|5 zT@1>ay0`oyjWN)y`JERLbd)6EAPfL zsf^Y9Y#6ZvJ9pO984S8@^LC&yQIotF$Qx@7_0I8A?BbaMA7Df79x}`jsW4`bq7*qU zK@w;jqDE6Q8_qSg#acXP%=|d8?X{n(`U|5eM9H1|?Iq1ZAL3duPAK_L@pN9C6|U-1 z+>3@0E8tu;taK@;ISq0@;3dAS|9rE6^)wZb5&eEd#$q9iA?>#Y%Wf{pgZBu ztlJ@ov3b>F{+~38YJj1dz0L?$!4e0;reS3Vqn(~;n%bP|H<5{!MF+=^Uf<0xkeZ_e z_ z6F!+9Mx-VX%sHJL?$NF>o>UgsgOu#lU3lYW6u{3yo=9bC3heUxsONOQq<$P=_i3hp z%@{$)LZojowsa+7JTKLX8#X~WwN%|x_VHG2M?B9C9Oa|!CrkiP&7~4cWQ2^=+q0$W z%G=_seFE|Ic;*>}L_zYEQJT$d5qhZ~F!j9Swq%fW2e+SgS>jG+M0@21cDk$x+1%tUr4;NGks`)XbV*6TGv1NYbe<2c6_=(nUiwH`Z~ z@1NCb_%G0&WW8>f|66shhrF&F4_`(PF__j*ca4Q=D2%E< zKBw3h#1YFvbI8rm72mHC27swLZTFltkaVXzeu+d|!KLqi0D2Si1R!Jy1Rl-QbG$O!+2 zW~h(d%!Uof7kXM3IAqSusC6;n-Eaz{u#}%qytvGhY9IOxfT`ziYGi-dRd|_8hY2TZ zoZ$#~$&V+^dq_XXgO{WeVhwLCGpiDcibg1f1{^-*G9wA>z#!DA$uB0_e4h_|CCN5*`;QOXIVxcb6iBX79Vl*oO zf-fEAJz=UF5SONn3DpDtR6gD1b)d0JvQ5(UIRxGrSY4vuh{P4JHx0@u93Zb=xnP0a zg6#9!Rd7&tdL%G1xoNni$yN{l(Bzu-%XPEB3}N}oqB*of+POD9-8MNWVrJ--|8 z*_Y88PDX*GAK3V7pNPkXpa-)g47{M(T&qVVi(GV7!Sa6d1Z97saPMNiI@OPgo%L~K zA>G?BQzZHk6spCows9F{Bbmnb{+2SUbXk}o?E#tg*AEa?Cu=*F!j(`O;i{u?^@*0# zZ{x=BDEa|U`WD9(k*Z_FGg!1!Homi{S zJS|Zpcyt7U=PjqG6Q2tk9V)Vzwf-#GFkakW1!b9i-qK@tFmhE3;j|l3_`+0uHS>+* zldF1Cqd=2949{u%;OM*(Jc+WSAqR z&|U8I?s%_yn(&y9hgGqt=^@1~gs%a5&p1?k#r%8*l4Pzqbe9i^d4>Tp5g0Vk9`o7o zZQWbjv}?rp#GZR1g7ydw9x^!6Z!WZoDvaefo6fNxO@|DWEvK)Qg~otq;Rb7dHse^o zIN%a;L>8azcg>n2Q@#&r3_$v{#z_%&Ev2xyC5u)?(ToUH7a2y9skMTFdQUo97Giij zoea}z*PF!KFJb)(dN4le9y`NcOcVi`1FXH$RddNEU|~uz^!%o}L7oH0tWhiT9wy(# ze}7mVz34(X9A}LQ+@JRl8zXXh{mKwc$5&Xt4CwGPAm$M?6v_PLv8}iM z`!~RUz<>H=M4iJ_^(aVqlWt?0rmLd}VT2}6W8#}*MFc0DyBdCd>CpU_=~+Ta;J-WX z0234Ab{ydJZ29$tj#21+0PT%4A+1RG!};mLtrYV}BUoSD_JVL^F{v3@ZPD$Dq1l&} z^=GnYo!+=ovXye;2A>vtj;$9-psa6qVB@d)if$HOyj>9%n~a23bLK)q40WoIHK!ii z3LE+)E#v?FCt@_^Wcm&hnsU~JS1p&E zbcH*#bG_&`H+E!zWhbUM(823wZNeY!y}Qoh%>0qEItu{>Z`{5=Nd`gn2YmP;VUU?Hg6F1>3lusp+%(2)Fo_L-PJ8|3+bb!hpk4#JKI6O(3zJp?+M|l* dGYlp5-aYm=Pb^7C7yd<9g#?G~sR{Zx?O(ATY<2(u literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_plus-members.html b/trunk/paradiseo-eo/doc/html/classeo_plus-members.html new file mode 100644 index 000000000..a13a63b77 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_plus-members.html @@ -0,0 +1,18 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPlus< EOT > Member List

This is the complete list of members for eoPlus< EOT >, including all inherited members.

+ + + + +
functor_category()eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
operator()(const eoPop< EOT > &_pop, eoPop< EOT > &_offspring)eoPlus< EOT > [inline, virtual]
~eoBF()eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_plus.html b/trunk/paradiseo-eo/doc/html/classeo_plus.html new file mode 100644 index 000000000..1cddc4211 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_plus.html @@ -0,0 +1,43 @@ + + +EO: eoPlus< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPlus< EOT > Class Template Reference

Very elitist class, copies entire population into next gen. +More... +

+#include <eoMerge.h> +

+

Inheritance diagram for eoPlus< EOT >: +

+ +eoMerge< EOT > +eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + +

Public Member Functions

+void operator() (const eoPop< EOT > &_pop, eoPop< EOT > &_offspring)
 The pure virtual function that needs to be implemented by the subclass.
+

Detailed Description

+

template<class EOT>
+ class eoPlus< EOT >

+ +Very elitist class, copies entire population into next gen. +

+ +

+Definition at line 116 of file eoMerge.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_plus.png b/trunk/paradiseo-eo/doc/html/classeo_plus.png new file mode 100644 index 0000000000000000000000000000000000000000..8b2b27c4b5361760da270680d6c3c4c8632ed772 GIT binary patch literal 1836 zcma)-c~Fx_7{=pSNkzG|mP-*S`9K;4$`L5YokL>$0(b=vL=dnbM>wLWXf!1$Lf|VX z1_GKyC_$+hLVQWZ$R;$%Xt+tKL-k+yaZ(3Vh+p%`- zux`2_1;i6!Tb}hr!C*_o?n#FI}qF#}AHJVzG<}Za9a3rCdh;U12;W94F7dU0Up~KWE zavM!d`3d=Q12EKG`IUEYs%O|eZ=-w*QzFYLie%X-O#G;lyb&3j4d;_e%{LsHOF>uP zQVnkhX<&mkIJKW+KyIX3WgN23>IYkjg-e(dWaA)EKd+8o8dX-YE zj*TVzET2E0XN~0PIo+!yyL2g%wm0nW`J1J2eL<5TRq?Ua^)d z3kHL?`auzra{ZM(H#)ES$u}2p*7WYvK0(=mvju%ko*UhhN7^?yo{Kt}%96%DzJRAr z^U?gBIZ0Z_Sf#@=G|)MG;@?)3d8{Usio_=-M>^*i^lu-z)aKHU;W7TBS4>@*;)&yHp9%;edKokBQUrgucva z3j)b{_DXhjnz7m=4a1mdZC6T(#_H|rDKER$A$0judVNP+cCnl$Z^a*!Tg=tD(vgny z3i?1o3W*=@Dm#nho9H5FxIUg%}OZgl#$IQo(LZ|;r_-cztcJQUXe%h-`a~4nLVK?UR%EN3wl_HJ5Cv2$e{S8S8j z+b~V}EcR#VZh@qb_E1_@V#J+g2HcVD7BoI4x0rlS@d36?4*75-h2DV!{1@s#0C~T` zwU?2`&h2q@kH(r_=!m-G3n>sJYh|(b2sCs#u~9==VAHa_Ti*wh0Hyd5y3K6< rFo2YS7}v%B9;ViLn~AesG1K~=#tGP#H>Y3!g)mG2-oM6o|LMN~FCb7h literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_plus_replacement-members.html b/trunk/paradiseo-eo/doc/html/classeo_plus_replacement-members.html new file mode 100644 index 000000000..8942018e5 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_plus_replacement-members.html @@ -0,0 +1,22 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPlusReplacement< EOT > Member List

This is the complete list of members for eoPlusReplacement< EOT >, including all inherited members.

+ + + + + + + + +
eoMergeReduce(eoMerge< EOT > &_merge, eoReduce< EOT > &_reduce) (defined in eoMergeReduce< EOT >)eoMergeReduce< EOT > [inline]
eoPlusReplacement() (defined in eoPlusReplacement< EOT >)eoPlusReplacement< EOT > [inline]
functor_category()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
operator()(eoPop< EOT > &_parents, eoPop< EOT > &_offspring)eoMergeReduce< EOT > [inline, virtual]
plus (defined in eoPlusReplacement< EOT >)eoPlusReplacement< EOT > [private]
truncate (defined in eoPlusReplacement< EOT >)eoPlusReplacement< EOT > [private]
~eoBF()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_plus_replacement.html b/trunk/paradiseo-eo/doc/html/classeo_plus_replacement.html new file mode 100644 index 000000000..ece3eccdb --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_plus_replacement.html @@ -0,0 +1,46 @@ + + +EO: eoPlusReplacement< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPlusReplacement< EOT > Class Template Reference

ES type of replacement strategy: first add parents to population, then truncate. +More... +

+#include <eoMergeReduce.h> +

+

Inheritance diagram for eoPlusReplacement< EOT >: +

+ +eoMergeReduce< EOT > +eoReplacement< EOT > +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + +

Private Attributes

+eoPlus< EOT > plus
+eoTruncate< EOT > truncate
+

Detailed Description

+

template<class EOT>
+ class eoPlusReplacement< EOT >

+ +ES type of replacement strategy: first add parents to population, then truncate. +

+ +

+Definition at line 73 of file eoMergeReduce.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_plus_replacement.png b/trunk/paradiseo-eo/doc/html/classeo_plus_replacement.png new file mode 100644 index 0000000000000000000000000000000000000000..15cbff8d0ca50b21d26f38f0414303861206da8a GIT binary patch literal 2203 zcmb`Jc~sNK7RPa^AhPH|1cM}^7OaYZ1_)b_t%xkKK%lq;5J?DOiwZ;ui4_n;Qi`l) zOOS$MfK+yZ5GtCmugV&Dz)yKB5)6w81VUrq)7ta?=y~V#kD0l1=gygPKJ&eI=H7WH zTX|WKtdx|Lyxm!AXDO+zlM-9FeVe4e2+19k465fHTx~WtHznrgW+RpA^^?T8UO30qi?s$*|+Z!`~4$0V~)_(=%7|5 zMOxmq^(rUwhkUQj^mw(lW^HmqWXUhn*F~Et+yk>IT=5*D*?f#3fN5-_MCIY3&>!!z zd)@_bNqaGZW!Nxp)p4y|=;diuO+pTJpC@qTk5_`G-#H4-^JvQsiyo_o!VTbtbk2A6 z@KB}G0B%v`61+*CQ8}3B4bN9g)7pvdNUKQ42jWKD%1#FbR|bv7`HzN-7z5(%j$ZbMDyzhKIVUR<(WJ`XR-9Q9FD))r2@7PemwkSj6|$bP-LC-gS{ z?VM?gB70=hiGM`_7{Xfg9@hf z;f7#lJUz@zbTzfyfCsNWG?l=aL3>=Xyd<15T?X{V|pSFM?P% zpfx>Ac)T!?%6A14W9qO(WC@^E5YXQ%%+=2o;MEmJV)(!s;WuHouOk%RFbyOkZ9Bu% z^UUOYF#9@Wd5JT?5Xz<+Rjl6Q&6pI`xUJRH$1fafcv$Dh4N~a+R)dFRZw%GU5!%Dm zv6!4SE7O~*2<3JVICdV{Xu4sD@t)QXb~yTO+PD0<5VOBp=lX|4miZF9Hpb;@xhVv_ zF0Yh@X~x`yw+naD{(Iluu*?ZJk+IBvOvA0oGwn$T(uu+kTd!se@A}EdU+2t=f$(|d zIHQ?f1T%nRmoDB2^w+UywM!@U`kHhyZ@5Hkx#lqcRkLoT%0bR6)NQ$cz>%=9bj80; zv}^TA{p~gjz|Zf1JSG2=JiB2akge5Uo%h$DMEbJg$T-|cBV(A=aOe)Z=TjWKx8{Cu zZ`*+v$iifWmJ=uQzBWNFoT7W8zalaD&e6#ycWACvyjbVHv>qxJ8?z%fv?+)v_`Rdb zB|I0seWUl#1;oSYp*MB{KGAN@w6v&Uts`vy&vk>U&g4NDedTaL0J95PdSx&5g2IPy z(#sUpjTrr2C4mEol_d|2oYKeZO$on~c`i$X$L#2l+q|L(6J;mc<%Sh8eUEMY-cnPHp#=`ZxXL40Qu}ui4|5Sia=>C@bXULx;QPJ-2@+X1|XkQ%M!7hLC zT+2?{M>iWWy4a#!kdjFa!2%w4#vloZ9)~QeqovqO^xblM`*wz^S<3hQ+U74?YcUf` zlPA01Oooaz17-9AeD8+g*JaZ!5pw!i*1!2gfvbI<}?V8N; zCq^yeK<-b}53lrk-+1Dx3kDQ?*dtHq&8eP!gkw`4mpK5upFkZD_QG)M9Jc2Qe`vHQ z5fh>OflqZFqgPJRm1gSPlj~G?p)Cm=>D?sa!C`YI|4@a5aOF;JszASwqw-R zT#HpxQaR}PY{FS!2BCIHuozvoTdDf`N*7fF;!4 zEnl~0lDQh&+WM+PX7rOY0T0qNi~OBqRWd#`~(AnB%MGbmIcmYV(d8UMe^ z`}lNyCjG4Wa!yiVRh2v!r*mfepT*{SrdlV6&@R}hh`G~k*MSpCt#WBnj z+_3(wBP_@OTbIeNqxWj6vPQBZU{y`wWIu@gqe0Gwd#Jtnc1K~vBR-^idrv-J6Fd^7 zDIcRVI~L90l}2FP*uFV$AF?AMinn|a2*IQyL8s90;L)mi69ztMk-oqBR{n4?9oiT2 zQJB011HnP!DDp@v18u7OUK@l^M;Ff#i1+nLZ8#z}TVK4xMHC`EYXhN<=ByE_+`S=W zoYOG9CcX4rM5<=aHN}f6o9O5kta)dBtEVuaE06D!J8uLfwU?X4eu3gZM-gS9Ue2=l cDVw~_s<9wL`mFeb9zXX9jDYUy?7cVvQ0yZ`_I literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_point_mutation-members.html b/trunk/paradiseo-eo/doc/html/classeo_point_mutation-members.html new file mode 100644 index 000000000..f4298e51c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_point_mutation-members.html @@ -0,0 +1,33 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPointMutation< FType, Node > Member List

This is the complete list of members for eoPointMutation< FType, Node >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
className() const eoPointMutation< FType, Node > [inline, virtual]
eoMonOp()eoMonOp< eoParseTree< FType, Node > > [inline]
eoOp(OpType _type)eoOp< eoParseTree< FType, Node > > [inline]
eoOp(const eoOp &_eop)eoOp< eoParseTree< FType, Node > > [inline]
eoPointMutation(std::vector< Node > &_initializor)eoPointMutation< FType, Node > [inline]
EoType typedef (defined in eoPointMutation< FType, Node >)eoPointMutation< FType, Node >
functor_category()eoUF< eoParseTree< FType, Node > &, bool > [inline, static]
general enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
getType() const eoOp< eoParseTree< FType, Node > > [inline]
initializor (defined in eoPointMutation< FType, Node >)eoPointMutation< FType, Node > [private]
operator()(EoType &_eo1)eoPointMutation< FType, Node > [inline]
eoMonOp< eoParseTree< FType, Node > >::operator()(eoParseTree< FType, Node > &)=0eoUF< eoParseTree< FType, Node > &, bool > [pure virtual]
quadratic enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
unary enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< eoParseTree< FType, Node > > [inline, virtual]
~eoPointMutation()eoPointMutation< FType, Node > [inline, virtual]
~eoUF()eoUF< eoParseTree< FType, Node > &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_point_mutation.html b/trunk/paradiseo-eo/doc/html/classeo_point_mutation.html new file mode 100644 index 000000000..be706557d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_point_mutation.html @@ -0,0 +1,152 @@ + + +EO: eoPointMutation< FType, Node > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPointMutation< FType, Node > Class Template Reference
+ +[ParseTree] +

eoPointMutation --> replace a Node with a Node of the same arity +More... +

+#include <gp/eoParseTreeOp.h> +

+

Inheritance diagram for eoPointMutation< FType, Node >: +

+ +eoMonOp< eoParseTree< FType, Node > > +eoOp< eoParseTree< FType, Node > > +eoUF< eoParseTree< FType, Node > &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef eoParseTree< FType,
+ Node > 		EoType

Public Member Functions

 eoPointMutation (std::vector< Node > &_initializor)
 Constructor.
+virtual std::string className () const
 the class name
+virtual ~eoPointMutation ()
 Dtor.
bool operator() (EoType &_eo1)
 Mutate an individual.

Private Attributes

+std::vector< Node > & initializor
+

Detailed Description

+

template<class FType, class Node>
+ class eoPointMutation< FType, Node >

+ +eoPointMutation --> replace a Node with a Node of the same arity +

+ +

+Definition at line 147 of file eoParseTreeOp.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class FType, class Node>
eoPointMutation< FType, Node >::eoPointMutation ( std::vector< Node > &  _initializor  )  [inline]
+
+ + + + + +
+   + + +

+Constructor. +

+

Parameters:
+ + +
_initializor The std::vector of Nodes given to the eoGpDepthInitializer
+
+ +

+Definition at line 157 of file eoParseTreeOp.h.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class FType, class Node>
bool eoPointMutation< FType, Node >::operator() ( EoType &  _eo1  )  [inline]
+
+ + + + + +
+   + + +

+Mutate an individual. +

+

Parameters:
+ + +
_eo1 The individual that is to be changed
+
+ +

+Definition at line 171 of file eoParseTreeOp.h. +

+References eoRng::random().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_point_mutation.png b/trunk/paradiseo-eo/doc/html/classeo_point_mutation.png new file mode 100644 index 0000000000000000000000000000000000000000..c4067cf23439c29e9da84adfe7679de85e7b0d30 GIT binary patch literal 2290 zcmbVOdpy(YAD?mvk%*WxUQVUtx?@y^WH`yJQfi7#zU8)zB||IgddM!)G%D95X~cd> zMAFLFQA94=np;I0x$n5Njh%J=_`Q1l{`kFK=lt=!pZD{5-tXu7`QvkSALci0O{gXW z0@3!_?dcDJtURXVjjAh^NKGS)l%3H&^g%C$LZPGzMPq(`$TcPVyEQg8Qh17CHo{FOh$3-3MPk*c>2v0Z!|QCtJ3# zW87e}mu%lGy&GQa4)2R5?@b8?zLmla{jRnVY3#-Xc4r}RM;QdfB++!M1wtKIj-3Hs!WJExNmmp00JJP_wcT>Ecr!kaar4tI zw|;B~Vogi-ObV+H-Qd^{8!(MF0gBq$`mtsQ*aCi&0?%9E)f>!C_1-<_0~?kB_4*?{ zyzHwJEm(1usa=%sd?-HY+IAGR9uDkD3blR+G|WW-=2?I|i_!8Zx#b%x^WO1WcVjZ_ zj?s%H8{52p$6*xL!Os8SsI3p#h&vzyUd#Uijq^`~&xcsIrh)Bgy}2z0prOOa&oCnv z{6j!7(*hmjU2Xn?$r_$~mFsH?42^9Uw}I#!ONL8?b2MPRMHU1|xvRf}dI{9i0p%#|Ey2Fu12+w3pFm5ab!>>T&2%ep$Ih zK!(x4w0P^=17*MfwwC#Mj#$TJd_AL9#WbKay-zg~{6g^xY;Ls=syiG6Znv_%E?GRi zw|rSloYhPiJUK+43YavQqEMO&93~Z$GjqZL99-kF$ZC0q4lbRs*JgcX0~wh}T96EN z2`_Lr)$b=|Ru7(NwMc$CTeu&Jw4XoVO{IOlsMTdOsBw>5-C@LdhdmlW2d~2?@KH!@ zs;t}`FH-4NF(hg=`a_i1P)=42IDe&gMddmrp0AjSnb3`bXg&EU#8QbGA-+4XH8v1m zm4AVYQqTj5SK!OYkh^*u7^L)7l)C#?u1MwDo_`+NcV*tJFIOGjXDBaPI$R$9O$#0b zMQLS$9lTBw$Cwtdm@gsWq70(n)*JmE@_c^rsqr1;-zM(f4 zPbo=!?F74&lP5|szrk69$D9f&OAQke>YZMlw4QfN35bcOM@May*}XXO;61WAw6ZiP zW--}ilZ)@R(JfI@o!YUA?r>&Y+n+}UE^z%2aYMR-KvFheJ;Ul;9(VdZ#EW@+)@(Qh zJ-WN(k9OU$Zy2u?fb+ex)HF+E;dnUU?G|?DL@El`>;#fCEsc-T-pW3NdIy{O-({g) z{mHn_kC+)+lDu}Eozq{1*^0Dh7ip|@)Ool0m_YdG*K)X1I|Vq2$pA}Y zS{YUCUtKaf;eHb7qv$Spz5&?<965F9q)F&atGSl>%V2;A%2_qj$I|H)PLJqnS2>b>Qa4G# z?vKb92>v=~5gba;Qs%ISEbG*NAFUX8yz>6bDD{H$9-RUm4(zObhaw`-z@@r~{h}GIq)FrT^ z0RDd{;Salsoi)g|K~bqxH#t%f@HH|5{evSh+L~>@E|W9bl|3!WwzOhzJ=|3S|JaBv zlUagiRrW1KNf8!58~HwtKk)f@5#BE!yvzdK3U0YEG}J+Vb7?7>Lv%a`)z@hjo;{A{ ze2?#JO}o9a|GTe#!0Pq$#DbvjuGb4L>;B$Fo$)O2dthh8c$@zm!eTl%J@DnD5!vq&x#1nXqI}k(a%r>#g zT?)Ek)_O+2CO~*@d&IT$ z;`fKA`$TC1#Kybbw|SQX?Q+zLO(-PI@s~dDsp8Xbe`08aHw!0JG0rDUD+Ld*etW5wv;>Y!dmX~gXRMGg(=mdAAaG*U^1bJO0H|{ U*@nW2l?4jK#|z{6&?DsHUk9OFYXATM literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_pop-members.html b/trunk/paradiseo-eo/doc/html/classeo_pop-members.html new file mode 100644 index 000000000..056044138 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_pop-members.html @@ -0,0 +1,49 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPop< EOT > Member List

This is the complete list of members for eoPop< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
append(unsigned _newPopSize, eoInit< EOT > &_chromInit)eoPop< EOT > [inline]
best_element() const eoPop< EOT > [inline]
className() const eoPop< EOT > [inline, virtual]
eoPop()eoPop< EOT > [inline]
eoPop(unsigned _popSize, eoInit< EOT > &_chromInit)eoPop< EOT > [inline]
eoPop(std::istream &_is)eoPop< EOT > [inline]
eoPop(void) (defined in eoPop< EOT >)eoPop< EOT > [inline]
Fitness typedef (defined in eoPop< EOT >)eoPop< EOT >
fitness_traits typedef (defined in eoPop< EOT >)eoPop< EOT >
getPerf2Worth() (defined in eoPop< EOT >)eoPop< EOT > [inline]
invalidate() (defined in eoPop< EOT >)eoPop< EOT > [inline, virtual]
it_best_element()eoPop< EOT > [inline]
it_worse_element()eoPop< EOT > [inline]
nth_element(int nth)eoPop< EOT > [inline]
nth_element(int which, std::vector< const EOT * > &result) const eoPop< EOT > [inline]
nth_element_fitness(int which) const eoPop< EOT > [inline]
p2w (defined in eoPop< EOT >)eoPop< EOT > [private]
printOn(std::ostream &_os) const eoPop< EOT > [inline, virtual]
readFrom(std::istream &_is)eoPop< EOT > [inline, virtual]
scale() (defined in eoPop< EOT >)eoPop< EOT > [inline]
setPerf2Worth(eoPerf2Worth< EOT > &_p2w) (defined in eoPop< EOT >)eoPop< EOT > [inline]
setPerf2Worth(eoPerf2Worth< EOT > *_p2w) (defined in eoPop< EOT >)eoPop< EOT > [inline]
shuffle(void)eoPop< EOT > [inline]
shuffle(std::vector< const EOT * > &result) const eoPop< EOT > [inline]
sort(void)eoPop< EOT > [inline]
sort(std::vector< const EOT * > &result) const eoPop< EOT > [inline]
sort() (defined in eoPop< EOT >)eoPop< EOT > [inline]
sortedPrintOn(std::ostream &_os) const eoPop< EOT > [inline, virtual]
swap(eoPop< EOT > &other)eoPop< EOT > [inline]
swap(eoPop< EOT > &other) (defined in eoPop< EOT >)eoPop< EOT > [inline]
worse_element() const eoPop< EOT > [inline]
~eoObject()eoObject [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPop()eoPop< EOT > [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]

Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_pop.html b/trunk/paradiseo-eo/doc/html/classeo_pop.html new file mode 100644 index 000000000..736d585a3 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_pop.html @@ -0,0 +1,615 @@ + + +EO: eoPop< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPop< EOT > Class Template Reference

A std::vector of EO object, to be used in all algorithms (selectors, operators, replacements, ...). +More... +

+#include <eoPop.h> +

+

Inheritance diagram for eoPop< EOT >: +

+ +eoObject +eoPersistent +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::Fitness Fitness
+typedef EOT::fitness_traits fitness_traits

Public Member Functions

 eoPop ()
 Default ctor.
 eoPop (unsigned _popSize, eoInit< EOT > &_chromInit)
 Ctor for the initialization of chromosomes.
void append (unsigned _newPopSize, eoInit< EOT > &_chromInit)
 appstd::ends random guys at end of pop.
 eoPop (std::istream &_is)
 Ctor from an std::istream; reads the population from a stream, each element should be in different lines.
+virtual ~eoPop ()
 Empty Dtor.
void sort (void)
 sort the population.
+void sort (std::vector< const EOT * > &result) const
 creates a std::vector<EOT*> pointing to the individuals in descending order
void shuffle (void)
 shuffle the population.
+void shuffle (std::vector< const EOT * > &result) const
 creates a std::vector<EOT*> pointing to the individuals in random order
+eoPop< EOT >::iterator it_best_element ()
 returns an iterator to the best individual DOES NOT MOVE ANYBODY
+const EOT & best_element () const
 returns an iterator to the best individual DOES NOT MOVE ANYBODY
+const EOT & worse_element () const
 returns a const reference to the worse individual DOES NOT MOVE ANYBODY
+eoPop< EOT >::iterator it_worse_element ()
 returns an iterator to the worse individual DOES NOT MOVE ANYBODY
eoPop< EOT >::iterator nth_element (int nth)
 slightly faster algorithm than sort to find all individuals that are better than the nth individual.
+Fitness nth_element_fitness (int which) const
 returns the fitness of the nth element
+void nth_element (int which, std::vector< const EOT * > &result) const
 const nth_element function, returns pointers to sorted individuals up the the nth
+void swap (eoPop< EOT > &other)
 does STL swap with other pop
virtual void sortedPrintOn (std::ostream &_os) const
 Prints sorted pop but does NOT modify it!
virtual void printOn (std::ostream &_os) const
 Write object.
+virtual void invalidate ()
+void sort ()
+void scale ()
+void setPerf2Worth (eoPerf2Worth< EOT > &_p2w)
+void setPerf2Worth (eoPerf2Worth< EOT > *_p2w)
+eoPerf2Worth< EOT > * getPerf2Worth ()
+void swap (eoPop< EOT > &other)
Methods from eoObject
virtual void readFrom (std::istream &_is)
 Read object.
virtual std::string className () const
 Inherited from eoObject.

Private Attributes

+eoPerf2Worth< EOT > * p2w
+

Detailed Description

+

template<class EOT>
+ class eoPop< EOT >

+ +A std::vector of EO object, to be used in all algorithms (selectors, operators, replacements, ...). +

+We have no idea if a population can be some other thing that a std::vector, but if somebody thinks of it, this concrete implementation can be moved to "generic" and an abstract Population interface be provided.

+The template can be instantiated with anything that accepts a "size" and eoInit derived object. in the ctor. EOT must also have a copy ctor, since temporaries are created and then passed to the eoInit object +

+ +

+Definition at line 54 of file eoPop.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + +
+template<class EOT>
eoPop< EOT >::eoPop (   )  [inline]
+
+ + + + + +
+   + + +

+Default ctor. +

+Creates empty pop +

+Definition at line 68 of file eoPop.h.

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
eoPop< EOT >::eoPop ( unsigned  _popSize,
eoInit< EOT > &  _chromInit
)  [inline]
+
+ + + + + +
+   + + +

+Ctor for the initialization of chromosomes. +

+

Parameters:
+ + + +
_popSize total population size
_chromInit Initialization routine, produces EO's, needs to be an eoInit
+
+ +

+Definition at line 75 of file eoPop.h.

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
eoPop< EOT >::eoPop ( std::istream &  _is  )  [inline]
+
+ + + + + +
+   + + +

+Ctor from an std::istream; reads the population from a stream, each element should be in different lines. +

+

Parameters:
+ + +
_is the stream
+
+ +

+Definition at line 113 of file eoPop.h.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
void eoPop< EOT >::append ( unsigned  _newPopSize,
eoInit< EOT > &  _chromInit
)  [inline]
+
+ + + + + +
+   + + +

+appstd::ends random guys at end of pop. +

+Can be used to initialize it pop is empty

+

Parameters:
+ + + +
_popSize total population size
_chromInit Initialization routine, produces EO's, needs to be an eoInit
+
+ +

+Definition at line 91 of file eoPop.h. +

+Referenced by eoEasyEA< EOT >::operator()().

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
void eoPop< EOT >::sort ( void   )  [inline]
+
+ + + + + +
+   + + +

+sort the population. +

+Use this member to sort in order of descending Fitness, so the first individual is the best! +

+Definition at line 133 of file eoPop.h. +

+Referenced by eoTruncatedSelectMany< EOT >::operator()(), eoReduceMergeReduce< EOT >::operator()(), eoRanking< EOT >::operator()(), eoPBILAdditive< EOT >::operator()(), eoCheckPoint< EOT >::operator()(), eoSequentialSelect< EOT >::setup(), and eoPop< Dummy >::sortedPrintOn().

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
void eoPop< EOT >::shuffle ( void   )  [inline]
+
+ + + + + +
+   + + +

+shuffle the population. +

+Use this member to put the population in random order +

+Definition at line 152 of file eoPop.h. +

+Referenced by eoTruncatedSelectMany< EOT >::operator()(), eoRandomSplit< EOT >::operator()(), eoRandomReduce< EOT >::operator()(), eoEliteSequentialSelect< EOT >::setup(), and eoSequentialSelect< EOT >::setup().

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
eoPop<EOT>::iterator eoPop< EOT >::nth_element ( int  nth  )  [inline]
+
+ + + + + +
+   + + +

+slightly faster algorithm than sort to find all individuals that are better than the nth individual. +

+INDIVIDUALS ARE MOVED AROUND in the pop. +

+Definition at line 201 of file eoPop.h. +

+Referenced by eoDeterministicSurviveAndDie< EOT >::operator()(), eoTruncateSplit< EOT >::operator()(), eoReduceMergeReduce< EOT >::operator()(), eoTruncate< EOT >::operator()(), eoElitism< EOT >::operator()(), and eoTruncatedSelectOne< EOT >::setup().

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
virtual void eoPop< EOT >::sortedPrintOn ( std::ostream &  _os  )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Prints sorted pop but does NOT modify it! +

+

Parameters:
+ + +
_os A std::ostream.
+
+ +

+Definition at line 247 of file eoPop.h.

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
virtual void eoPop< EOT >::printOn ( std::ostream &  _os  )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Write object. +

+It's called printOn since it prints the object _on_ a stream.

Parameters:
+ + +
_os A std::ostream.
+
+ +

+Implements eoPrintable. +

+Definition at line 262 of file eoPop.h.

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
virtual void eoPop< EOT >::readFrom ( std::istream &  _is  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Read object. +

+The EOT class must have a ctor from a stream;

Parameters:
+ + +
_is A std::istream.
+
+ +

+Implements eoPersistent. +

+Definition at line 274 of file eoPop.h. +

+Referenced by eoPop< Dummy >::eoPop().

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
virtual std::string eoPop< EOT >::className ( void   )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Inherited from eoObject. +

+Returns the class name.

See also:
eoObject
+ +

+Implements eoObject. +

+Definition at line 289 of file eoPop.h. +

+Referenced by eoCheckPoint< EOT >::allClassNames().

+

The documentation for this class was generated from the following files: +
Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_pop.png b/trunk/paradiseo-eo/doc/html/classeo_pop.png new file mode 100644 index 0000000000000000000000000000000000000000..33cd382a65e9b7553274e56e945526d07a2a7575 GIT binary patch literal 688 zcmV;h0#E&kP)(+`?oL_Ce8@3_bjXE2cL%#$;7Fo);VsFieIfR4f|u znT2fZG@IFf6(-pv8QKholn|R)D_ZEZvbC{8(fHb|VPfOZ_a=9m-R?9R=Awm83yrjZ znHVlP<$r7r!k8uJ`F=VT^B$OkHc)H!^Th6NX63uiV=(tBakN+ + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPopAlgo< EOT > Member List

This is the complete list of members for eoPopAlgo< EOT >, including all inherited members.

+ + + + +
functor_category()eoUF< eoPop< EOT > &, void > [inline, static]
operator()(eoPop< EOT > &)=0eoUF< eoPop< EOT > &, void > [pure virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< eoPop< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_pop_algo.html b/trunk/paradiseo-eo/doc/html/classeo_pop_algo.html new file mode 100644 index 000000000..a4a119eab --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_pop_algo.html @@ -0,0 +1,37 @@ + + +EO: eoPopAlgo< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPopAlgo< EOT > Class Template Reference

For all "population transforming" algos ... +More... +

+#include <eoPopAlgo.h> +

+

Inheritance diagram for eoPopAlgo< EOT >: +

+ +eoUF< eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + +
+

Detailed Description

+

template<class EOT>
+ class eoPopAlgo< EOT >

+ +For all "population transforming" algos ... +

+ +

+Definition at line 13 of file eoPopAlgo.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_pop_algo.png b/trunk/paradiseo-eo/doc/html/classeo_pop_algo.png new file mode 100644 index 0000000000000000000000000000000000000000..1db396acf90e12172cbbc62fdb19255772fd3996 GIT binary patch literal 1257 zcmeAS@N?(olHy`uVBq!ia0y~yU}6EXJ6M>3WY)oV`ant|z$e7@|Ns9$=Kuc(=Fd-< z0AzvjfddDs5B+}vEaktG3V`^(`9oEc-oGhw2bV(QIY$L z$@VRG>eRjAd+K!K4~VNhHCoyDFU!b~E8+F#KePSZm)`e%s~-7!$I6TA7cQ-2N%l5& zU|<2F-vSZ5zI|Vwyp8WWuwsers-wX(wA(l7XQgE7+&y_WXHNchW=FYI^Y-kr`>N1X za_1T6(v1$ue_GY{J6)ar-f6+xH@A1bi#@RS+TMyC;^p_bnaZ22)2*3O+cQ)CjJFkh-i>==|M9Lx`@PD0Fb3#Dl zWSR8E7lJ$FFJ?bEz2knbOjF^zQ}Y!$v=#JPUTQtH*(1!j+o!|CrpYd&@hjhN!Iq7y zWg4e53P)@4*svV7c~+;*m?`$-L1^oN?+2s>Z)jZBIU)F?RpI9X`k)lNTMoxFHRF0N|+jJ!MxjiUZbYG=gm1#cXGi??_?qf^`->l!1Aa<7N z;58kOtq$#J@d`KAv!)3ieBvu05@iq;HQ^0Mo$L%39==S+P0BCsxn|kkde7mRgH-!G&)As9oFkec5fl+{=(Y?X^;>!iKGJ6jeR_EXO@BaAT zO3SA2=ePasuB|h9E64F-bK!rL%@@j~8W@T^95BGAmOJ;Plr3`BKL5bN28wrVpoE_# zKi7WAMXQ>P+n3G1@)O7~RA69IP*7O#oMTH!-jt`^p;!C9wekdAm@sG6Yp(<9u6)nk zH#}Lh=(B6z%bna;ZLd2$c(&EWz&bY5+lS5e2r#Y%yyKVfJoDmMwrZ&a=XAffT++?< z&H`Z$F&xE=Q$FiV**907u~?#_#OQe1huxR|$OEm$$3*`) zZxqDN{E)X`{u|$mJ zqx_vs`g5#IosR;OlRCI-*7a!Ri1h2OAB>opK>oDgXWG+Q zcj4U!e@%8?j;QH3<{oT#@b{OzqFt5)gQW^E97q8RsugzpsDJW@>-E3K_nH|Q1-8hs z2*mI?PUre@xc2G(+8fi^H=4xV|NZ@@7>nnX*l@)O)7$^tC_DXaTb4jxoh{StngW*t zbALRSKKcFeG>)7FW}DhwbbY5WzyIKyv`V04wb>vQAOn5h>PeV2RlDSy#_#(%ec VjVfLkL;%Yr22WQ%mvv4FO#p3*7IXjr literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_pop_eval_func-members.html b/trunk/paradiseo-eo/doc/html/classeo_pop_eval_func-members.html new file mode 100644 index 000000000..30448ffb5 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_pop_eval_func-members.html @@ -0,0 +1,18 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPopEvalFunc< EOT > Member List

This is the complete list of members for eoPopEvalFunc< EOT >, including all inherited members.

+ + + + +
functor_category()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
operator()(eoPop< EOT > &, eoPop< EOT > &)=0eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [pure virtual]
~eoBF()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_pop_eval_func.html b/trunk/paradiseo-eo/doc/html/classeo_pop_eval_func.html new file mode 100644 index 000000000..a12eacd21 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_pop_eval_func.html @@ -0,0 +1,45 @@ + + +EO: eoPopEvalFunc< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPopEvalFunc< EOT > Class Template Reference

eoPopEvalFunc: This abstract class is for GLOBAL evaluators of a population after variation. +More... +

+#include <eoPopEvalFunc.h> +

+

Inheritance diagram for eoPopEvalFunc< EOT >: +

+ +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase +eoPopLoopEval< EOT > +eoTimeVaryingLoopEval< EOT > + +List of all members. + +
+

Detailed Description

+

template<class EOT>
+ class eoPopEvalFunc< EOT >

+ +eoPopEvalFunc: This abstract class is for GLOBAL evaluators of a population after variation. +

+It takes 2 populations (typically the parents and the offspring) and is suppposed to evaluate them alltogether

+Basic use: apply an embedded eoEvalFunc to the offspring

+Time-varying fitness: apply the embedded eoEvalFunc to both offspring and parents

+Advanced uses: Co-evolution or "parisian" approach, or ...

+Basic parallelization (synchronous standard evolution engine): call the slaves and wait for the results +

+ +

+Definition at line 49 of file eoPopEvalFunc.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_pop_eval_func.png b/trunk/paradiseo-eo/doc/html/classeo_pop_eval_func.png new file mode 100644 index 0000000000000000000000000000000000000000..9aa5518f9be7705b066c36b2deb3f0466b0b9e22 GIT binary patch literal 2111 zcmbtVdsGrw8b@u`@&TUHmM-`xn-MJ^>qz)mA0?%tq?QpWLX6}qT@4kXvBIXrAqAZn zr%cpw)X`LYhTtC(C zy*=qS<+N(5mT<;50B~&fWf%aU`5bxT_*p7viPI4?=B$%U)R`Ok&>0?S^PZS=P+cQV zYEh;1`Ek0tcC`56seaqG`Uizxz>g`#SqDW+Qj5kf`Yak1anNZf*u(^S@r<~yloT`U zV1J2|lgpI*kVpglTtS}Sl$MyCFW~2)2VqBzK~IGhU=Ny|E6O1vm*HBb6BjP_sY{IE zEmr27H@Fbs%bz#|tK!LijdTp*Eco6!otC-&bAi&sGgA2EJKK!VW}C;M^&U~g85aC-S7;(^x%el?M=;}Z z@9xBAe(g{o1ca%wRXR2>yS(*^idntuO|B@(nuvZngA{B4>XG)6q&!lEM1aRU<4NvK ziZH@>mfK;8q@g`6L89Pn zWZ^Gz;sUkiT#d%iW*bP0>Z+82pBtNVhorP*OY~9E#>Y)| zti3-A8&8YJ|DA5psm*vjSpU{ML*vFFzw4F2Q$9#ckWlyscTRH}E&0)k#cquQ_IApKMu(#X5}4(iwbg$Vda&3o=tlG+eEMZ%04Q{XT9e=q|fv zo&`I+68q0wyE85(O_F?9JiWh20oAThV)0@?#;bbdr>-;MbABmM@Hx15Qv%pn! z?{G*^?fP8m**P(Pzh|)I+;L9Jv?bEdue8jplv0>wlC(*XO!o%1j zlzZIOtUK^B`1ZErHra?$eml6rDdb9Ze5e`o_Oi{{u2pr7wAhJz!2EJnOD(>_3H7S< z4!ox+ii^g-Nx_*zus4T1c>dxlasl&FfiT1H`P8?<;!oLCi8%mrcl*FDh8@IBPjO36 zC2xo#wo{e-FxTa`>xar6eA{u>dgjRd}jPe|P zG1rk|Jo#);QL`H^^@T7T-61f)ibHqz*hIDrct?rT%4)kMqx@M}gE>r}?2Jd&k=RKt ziz*2YI&D9_afKV#8?`SuR9e8xC`X89cs^fNb&vs}eK*e^5uKWsO@Y|z{dD#7W}3JS53wxwQLt;R^Ugu}4gEJvhuZ4Q>@b|d@lMv>bSSBg)UuTl6da}_fWc?@Nu7MFJB3nr0z`5cUxGd{m6ujGnFP?Qa&W%tra$b prl0C<0K{#XsO}lJRssc1)1(orUtk&qUaD#jK%VqHQRz + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPopLoopEval< EOT > Member List

This is the complete list of members for eoPopLoopEval< EOT >, including all inherited members.

+ + + + + + +
eoPopLoopEval(eoEvalFunc< EOT > &_eval)eoPopLoopEval< EOT > [inline]
eval (defined in eoPopLoopEval< EOT >)eoPopLoopEval< EOT > [private]
functor_category()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
operator()(eoPop< EOT > &_parents, eoPop< EOT > &_offspring)eoPopLoopEval< EOT > [inline, virtual]
~eoBF()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_pop_loop_eval.html b/trunk/paradiseo-eo/doc/html/classeo_pop_loop_eval.html new file mode 100644 index 000000000..d341cd3c4 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_pop_loop_eval.html @@ -0,0 +1,51 @@ + + +EO: eoPopLoopEval< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPopLoopEval< EOT > Class Template Reference

eoPopLoopEval: an instance of eoPopEvalFunc that simply applies a private eoEvalFunc to all offspring +More... +

+#include <eoPopEvalFunc.h> +

+

Inheritance diagram for eoPopLoopEval< EOT >: +

+ +eoPopEvalFunc< EOT > +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + +

Public Member Functions

+ eoPopLoopEval (eoEvalFunc< EOT > &_eval)
 Ctor: set value of embedded eoEvalFunc.
+void operator() (eoPop< EOT > &_parents, eoPop< EOT > &_offspring)
 Do the job: simple loop over the offspring.

Private Attributes

+eoEvalFunc< EOT > & eval
+

Detailed Description

+

template<class EOT>
+ class eoPopLoopEval< EOT >

+ +eoPopLoopEval: an instance of eoPopEvalFunc that simply applies a private eoEvalFunc to all offspring +

+ +

+Definition at line 60 of file eoPopEvalFunc.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_pop_loop_eval.png b/trunk/paradiseo-eo/doc/html/classeo_pop_loop_eval.png new file mode 100644 index 0000000000000000000000000000000000000000..faac7d57669ec3e2911487bd108d33e98902db4c GIT binary patch literal 1843 zcmb7_dr;F?7RTcQEeJ$}E@@(0(Y93FN?>E;jUtfcVGM*vV+nx@0s%onkN^qp6lfsd6RyxLnB~%1H<_TdFgaIy{pqTbGZ?h^xpbv zZf?%Jt9!0LZlDHY@sL9=o}Pq2w*2Dbc{qs1o@UD~51_YuVa9E03=$i*%x~g7XWl4r z4P9Ov@!7b`{=X%UygnZS=gyHgP^SEUG8CiM)QfwUDF4IHspV7;?X0xD-LN=rr!i1o zmW)DOd=UXIgs@$E{iqIe&|-VAjsXQ1h|y(@s-L&*6B_0%$TT?RRkiONG5zvZgzdx0 zPp^sm(gI+^mnEYMMwUb5+OkH4U8j0?i(q$Ud0zZi1NE0V$t%HAEnbgC?zWEPtr%oI zG^>`Las-sJgxsW^7+vRYYIra@R+bcYq0ch#8z+rF1X_`u-Q1+0VioasewflOy*2I3Nir zpmVI3S~S~N8USoN;;d(RKuV&^tyxDRp!yKA&DXV~;ncl!;g3 z!r@S2Td;V)vYJva9UP4J*Ex#-CU&Hv?c3;|mCzL0QhK|f-Qgcn&KyXlFZVahs9FQk zy7?;H@cc0;9&oowi>KrHGEQLqb#zt~Fu@3GmzCLT@3;*i-SP?MKvyVZwf5!xe%_v2 z%=DKJt`b|;GM8y*LVB_-l) zQ;k2HlRFX3i;%C<1_%ZZBw9|L*>bTp8ijpzlW3(SNT&z>shwLKcB!qe^{ki8M@qTK z+Ds3rQKYRWoNMn(j-1}|Ex`v*enZ3T4Uz2m?wSw34 zOY%`l>A{y7rei0oSf(t3;#^?@&n-$G)Md0v1^H&!+m6VdV}1|hA&6*k)f8+|9f}}j zXYB~EIqq8db;51)Y2SH3QC;o_BYDSuYH-bz>~3Wz-Ii8sSE0R;A|Khq@27I(!rB7p z*G#c-`^PPuDB=8;XUGK7q?#D%M8q#KKM1v{Ne(t(U4n71X|J??@7{Ex2+u_%eXc`- zeL>XsgST8K^A$^EqVoHjM4_syM#Wvx+Nrt)jT5R`BjPQzTqVWD}lcppmyMj%BAaW?dBWBhPzh@SM)_Q9U ztzP4C56L?(ZCTa2O>DnE?*X2sO?dt;hd=Ay#rvI?@FsXv^Bn`V%Cq<#zrMUqPD9_o z@lTjAA6DFpJ`9sQhU4cqhN4SNx@8szy)C5%k?6jmy%t3%LGTaTESTn#$VcQHmPt|1 zmywUj^jKqdh3Y5RUE@}(i+AU;?>&h{!)5tj_qIOKTkz$1aj5w^E|13+Q&6HTr(7oN{>QTVWu z3qtq|7w79Y@+DGANO3QrjeB#@_?O6>zC)=_;?2G3?3jX0GzxY!pxXg(hXUoJlBlw` z7-eOQWsg{&>(y_NS4?fwPJ^~pTg$om&%hJR|SXvpww zS?@!LVmJ$agHO!8GCUfE3yVkjKSqT;(=0C}sm;~n41z@d^Z+oh;|?#PJA7!ZGWU7D z!ZsKtu^j$nZxKqFa9oJxii5QFo`smHlCN%Y5W_u${ihV_ajyjXk4k5YMxA$93<%Q! zSpli9K^|H_NmP7sTilr8$H8Q=FwyT~JuCOD{8xE#b|}^9B#M^ywV5*T6p_o1p;p PKODrz3+pNHi1_CJfnTV6 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_pop_stat-members.html b/trunk/paradiseo-eo/doc/html/classeo_pop_stat-members.html new file mode 100644 index 000000000..1a7445eb5 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_pop_stat-members.html @@ -0,0 +1,40 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPopStat< EOT > Member List

This is the complete list of members for eoPopStat< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + +
className(void) const (defined in eoStat< EOT, std::string >)eoStat< EOT, std::string > [inline, virtual]
combien (defined in eoPopStat< EOT >)eoPopStat< EOT > [private]
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoPopStat(unsigned _howMany=0, std::string _desc="")eoPopStat< EOT > [inline]
eoStat(std::string_value, std::string _description) (defined in eoStat< EOT, std::string >)eoStat< EOT, std::string > [inline]
eoValueParam(void)eoValueParam< std::string > [inline]
eoValueParam(std::string_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< std::string > [inline]
functor_category()eoUF< const eoPop< EOT > &, void > [inline, static]
getValue(void) const eoValueParam< std::string > [inline, virtual]
lastCall(const eoPop< EOT > &) (defined in eoStatBase< EOT >)eoStatBase< EOT > [inline, virtual]
longName() const eoParam [inline]
operator()(const eoPop< EOT > &_pop)eoPopStat< EOT > [inline, virtual]
repValue (defined in eoValueParam< std::string >)eoValueParam< std::string > [protected]
required() const eoParam [inline]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< std::string > [inline, virtual]
shortName() const eoParam [inline]
value()eoValueParam< std::string > [inline]
value() const eoValueParam< std::string > [inline]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_pop_stat.html b/trunk/paradiseo-eo/doc/html/classeo_pop_stat.html new file mode 100644 index 000000000..d89a30e7a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_pop_stat.html @@ -0,0 +1,143 @@ + + +EO: eoPopStat< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPopStat< EOT > Class Template Reference

Thanks to MS/VC++, eoParam mechanism is unable to handle std::vectors of stats. +More... +

+#include <eoPopStat.h> +

+

Inheritance diagram for eoPopStat< EOT >: +

+ +eoStat< EOT, std::string > +eoValueParam< std::string > +eoStatBase< EOT > +eoParam +eoUF< const eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + +

Public Member Functions

 eoPopStat (unsigned _howMany=0, std::string _desc="")
 default Ctor, void std::string by default, as it appears on the description line once at beginning of evolution.
void operator() (const eoPop< EOT > &_pop)
 Fills the value() of the eoParam with the dump of the population.

Private Attributes

+unsigned combien
+

Detailed Description

+

template<class EOT>
+ class eoPopStat< EOT >

+ +Thanks to MS/VC++, eoParam mechanism is unable to handle std::vectors of stats. +

+This snippet is a workaround: This class will "print" a whole population into a std::string - that you can later send to any stream This is the plain version - see eoPopString for the Sorted version

+Note: this Stat should probably be used only within eoStdOutMonitor, and not inside an eoFileMonitor, as the eoState construct will work much better there. +

+ +

+Definition at line 51 of file eoPopStat.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
eoPopStat< EOT >::eoPopStat ( unsigned  _howMany = 0,
std::string  _desc = ""
)  [inline]
+
+ + + + + +
+   + + +

+default Ctor, void std::string by default, as it appears on the description line once at beginning of evolution. +

+and is meaningless there. _howMany defaults to 0, that is, the whole population +

+Definition at line 61 of file eoPopStat.h.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
void eoPopStat< EOT >::operator() ( const eoPop< EOT > &  _pop  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Fills the value() of the eoParam with the dump of the population. +

+Adds a
+ before so it does not get mixed up with the rest of the stats that are written by the monitor it is probably used from. +

+Implements eoUF< const eoPop< EOT > &, void >. +

+Definition at line 68 of file eoPopStat.h. +

+References eoValueParam< std::string >::value().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_pop_stat.png b/trunk/paradiseo-eo/doc/html/classeo_pop_stat.png new file mode 100644 index 0000000000000000000000000000000000000000..c29e56451ab3d3d98e8f2f0d2d75b2a442e28384 GIT binary patch literal 2651 zcmd5;c{G&kA0KivF-SKwt}z!EcOsLmk-d;cktWH$BMid80E5aaU4(zc2mBrB8aGRuu8?m~BF zKrhyJ8|PpzB-Cl7dhEe=aG6E$m^>4?kD!CwYLTsQ&B=i2O8SngXrk>NW zy|Sl2Oz4Nb*sq-lKahHTWp7A@v6t?&{17RX5w76k?ooyFC;im5G!d&7tv5WbV#G3$ zW8{2DWCzu7`S)nu$jcY|`1__bYvt5al?@y9DvA&=i6LFoj|*;^eA;rQ^s1xf5n5)_ zm@|MEqZf&ha;sT=>msyyf0wns3$FWW-Z?bj0IkXs=&_Hm`Yd!TLHn#mp)^(hnh#NB zR2^l7M$KXdFtKPiI+eg_C!zntakOp<8QX?GiMqMlyXPKqUzd_JKIN1sd3u`Gz4#__ z+%Nqb?GNED^9&xyrk_z@cj z&aFkRNx|d@=Vy;7K%a)U{on`vvtg)Eu`{iNh^+f5cm3)E)lgn}^)evqb!L7v&mrY;=Th|Q()mXP?6#L(Mo0>2u^`w8D6@<4T7uAj zwE6atC4qJwDVud_LW(>8K%#vVPPn{9%TCFG@l%)WHJ%_#NXjA3SEwt}3w}q8?C#z# zY4y#QQg1e?fek=!a-V;z@CXl7H`Bc``Q(2H3^pIpCcW+Kfs}7^5xXr;(EUyS=>UWU zIkWBGESUbls_&j=iwz{iRK#fgGKr)Xn(N6b%E3389GA778{Q+;(=kWL!ee(=rc3)hCl@>{Nv>F_=MIm=Wf z!|>AKeZu(OI)smf_lCeaZZ~br>0MR^VZh_aUQuZb5b9ZH;jzIOpNs@LZ(h39ax_Ri zs`60X$|qU*9zs~S!YDPnB0%`F>pdldHx$`u+Wu4UwhTw#+nOwmUt24mY()tqzU0DqJmmO`$16 zylyRb>i7BCnnwz>)F4w{O|w=4+e>FvSok~P_={8GBspqfwm`ptFXYm1*TErcinxs= z%f;Abd6yr#_ZV}tQ1)Y64L0qo=k&K+B`|-xt?&%gR=6At=?iXc^?w`|@Qy$oXJ%RB&=T*{-4k~r0;{2^tY?Q2 z411E)+3rL({ic)_5c11obv4*&Kk6~x?DgbN#hR3ez(r`-=?Jrg1CL%?uRbgF49o@4 z@E20}CWv(hnW9{0onqk#42Howo8k`h>M<*E1esoHZ)Z2*)O;m!L|^=k@}v~AT{}vg zRB8jE>aX8c(0DIem|<_D|u8B!{KytyCrfG2b|j#v|C z*|ht)U&DAw_Hv=$4$fsJ))6Rf&d4PH*(th6J*JsEcj!Fa{}_-lhg&nw<7igG#Q=)4sK^k9^kCMYlcpv)iySP)QhOidgP41T9p-#Kbv z6cnaj$=l+#V9`aPt%a8VF8n@O$uwZnl8r@7_<}^(e5)@a_2szz!jCP>$oCSQktyvB zoak&fl0}Af?A+wgUpewMnXr}AE~gf4PQ0R_@?Q98%G84^=UEaK4Q0QAjtas<^#kY> zsl)FMiWF3t>;`h!lympo)QAr^Y)O$oc*lerWujxnOmZQ%C%nVsi9OqYy$~uPyOiGI zOPQGc96(uZA0xP^U6>-7c!LkO{Kdq(6bZU5)}yTedUB6)n5$ZvMPl zh9MHJv=am$zP#)SZdilt-rT@QQ&N=sX}L7<`y*&;gMY;1^R49XFqyPle|%@NuNZ@2 zLEv9yf3riS3`*)cz14XwG2`-ai90jJ%mj9R@kv5OI37j$T~ zQr2FxU@96KjST4|hwj9?R97Z(Ts2VDa2cR&xPs8sI9d-c5Y2)Y{J9{z0SvN_@*aMs zwPUL`W2_{q!8K_(xH`Gf{UpuUB@}hZX5G5>DnfDtCb^;i8MGH_TUf$S2_o?Y*uSF# V6kK~|z?&chYhhzvb=c#|e*xN=$u0l@ literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_populator-members.html b/trunk/paradiseo-eo/doc/html/classeo_populator-members.html new file mode 100644 index 000000000..49429c3c7 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_populator-members.html @@ -0,0 +1,31 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPopulator< EOT > Member List

This is the complete list of members for eoPopulator< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + +
current (defined in eoPopulator< EOT >)eoPopulator< EOT > [protected]
dest (defined in eoPopulator< EOT >)eoPopulator< EOT > [protected]
eoPopulator(const eoPop< EOT > &_src, eoPop< EOT > &_dest) (defined in eoPopulator< EOT >)eoPopulator< EOT > [inline]
exhausted(void)eoPopulator< EOT > [inline]
get_next() (defined in eoPopulator< EOT >)eoPopulator< EOT > [inline, private]
insert(const EOT &_eo)eoPopulator< EOT > [inline]
offspring(void)eoPopulator< EOT > [inline]
operator *(void)eoPopulator< EOT > [inline]
operator++()eoPopulator< EOT > [inline]
position_type typedef (defined in eoPopulator< EOT >)eoPopulator< EOT >
reserve(int how_many)eoPopulator< EOT > [inline]
seekp(position_type pos)eoPopulator< EOT > [inline]
select()=0eoPopulator< EOT > [pure virtual]
source(void)eoPopulator< EOT > [inline]
src (defined in eoPopulator< EOT >)eoPopulator< EOT > [protected]
tellp()eoPopulator< EOT > [inline]
~eoPopulator()eoPopulator< EOT > [inline, virtual]

Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_populator.html b/trunk/paradiseo-eo/doc/html/classeo_populator.html new file mode 100644 index 000000000..79c57e8dc --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_populator.html @@ -0,0 +1,213 @@ + + +EO: eoPopulator< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPopulator< EOT > Class Template Reference

eoPopulator is a helper class for general operators eoGenOp It is an eoPop but also behaves like an eoPop::iterator as far as operator* and operator++ are concerned +More... +

+#include <eoPopulator.h> +

+

Inheritance diagram for eoPopulator< EOT >: +

+ +eoSelectivePopulator< EOT > +eoSeqPopulator< EOT > + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef unsigned position_type

Public Member Functions

+ eoPopulator (const eoPop< EOT > &_src, eoPop< EOT > &_dest)
+virtual ~eoPopulator ()
 Virtual Constructor.
EOT & operator * (void)
 a populator behaves like an iterator.
+eoPopulator & operator++ ()
 only prefix increment defined Does not add a new element when at the end, use operator* for that If not on the end, increment the pointer to the next individual
+void insert (const EOT &_eo)
 mandatory for operators that generate more offspring than parents if such a thing exists ?
+void reserve (int how_many)
 just to make memory mangement more efficient
const eoPop< EOT > & source (void)
 can be useful for operators with embedded selectors e.g.
eoPop< EOT > & offspring (void)
 Get the offspring population.
+position_type tellp ()
 this is a direct access container: tell position
+void seekp (position_type pos)
 this is a direct access container: go to position
+bool exhausted (void)
 no more individuals
+virtual const EOT & select ()=0
 the pure virtual selection method - will be instanciated in eoSeqPopulator and eoSelectivePopulator

Protected Attributes

+eoPop< EOT > & dest
+eoPop< EOT >::iterator current
+const eoPop< EOT > & src

Private Member Functions

+void get_next ()
+

Detailed Description

+

template<class EOT>
+ class eoPopulator< EOT >

+ +eoPopulator is a helper class for general operators eoGenOp It is an eoPop but also behaves like an eoPop::iterator as far as operator* and operator++ are concerned +

+See eoGenOp and eoOpContainer +

+ +

+Definition at line 39 of file eoPopulator.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
EOT& eoPopulator< EOT >::operator * ( void   )  [inline]
+
+ + + + + +
+   + + +

+a populator behaves like an iterator. +

+Hence the operator* it returns the current individual -- eventually getting a new one through the operator++ if at the end +

+Definition at line 58 of file eoPopulator.h.

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
const eoPop<EOT>& eoPopulator< EOT >::source ( void   )  [inline]
+
+ + + + + +
+   + + +

+can be useful for operators with embedded selectors e.g. +

+your brain and my beauty -type +

+Definition at line 105 of file eoPopulator.h. +

+Referenced by eoSelBinGenOp< EOT >::apply(), and eoEsGlobalXover< EOT >::apply().

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
eoPop<EOT>& eoPopulator< EOT >::offspring ( void   )  [inline]
+
+ + + + + +
+   + + +

+Get the offspring population. +

+Can be useful when you want to do some online niching kind of thing +

+Definition at line 110 of file eoPopulator.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_populator.png b/trunk/paradiseo-eo/doc/html/classeo_populator.png new file mode 100644 index 0000000000000000000000000000000000000000..fb8b5a6227581c64ff5e82f24f3df7517837e9e1 GIT binary patch literal 848 zcmV-W1F!svP)*Ga1v)}zFV^hBd*mMAr*4W?<3WLVn` zBTr8t=qnNk`gj5WU3+bn1Gt4o)KKIvQ!jxoc23YWpV4d$ME){02{uNWZWsvdb&?DefgPraT^m@D*poG>a(m`zi|Sd%7<_X~6V zLKEi8@(cRQ32uyj$;i_a2>OZyg8n4IeP3n_>1{Q@>$)-e<5*4bvhIui_IRvDcvUw> zzw=`%=qn`XDqs$0Ywb_9W=167-(l$6jU(Y5Zlz an0^C!MTyI? literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_printable-members.html b/trunk/paradiseo-eo/doc/html/classeo_printable-members.html new file mode 100644 index 000000000..a2cbaaca5 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_printable-members.html @@ -0,0 +1,16 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPrintable Member List

This is the complete list of members for eoPrintable, including all inherited members.

+ + +
printOn(std::ostream &_os) const =0eoPrintable [pure virtual]
~eoPrintable()eoPrintable [inline, virtual]

Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_printable.html b/trunk/paradiseo-eo/doc/html/classeo_printable.html new file mode 100644 index 000000000..c09e6cc08 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_printable.html @@ -0,0 +1,105 @@ + + +EO: eoPrintable Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPrintable Class Reference

Base class for objects that can print themselves (printOn#). +More... +

+#include <eoPrintable.h> +

+

Inheritance diagram for eoPrintable: +

+ +eoPersistent +EO< F > +EO< double > +EO< EOT::Fitness > +EO< Fit > +EO< Fitness > +EO< fitness_type > +EO< fitnessT > +EO< FitT > +EO< FType > +EO< phenotype > +EO< PyFitness > +eoContinue< EOT > +eoDistribution< EOT > +eoHowMany +eoIntBounds +eoParser +eoPop< EOT > +eoPop< Dummy > +eoPop< PyEO > +eoRealBounds +eoRealVectorBounds +eoRng + +List of all members. + + + + + + + + +

Public Member Functions

+virtual ~eoPrintable ()
 Virtual dtor. They are needed in virtual class hierarchies.
virtual void printOn (std::ostream &_os) const =0
 Write object.
+

Detailed Description

+Base class for objects that can print themselves (printOn#). +

+Besides, this file defines the standard output for all the objects; if the objects define printOn there's no need to define #operator <<#.\ This functionality was separated from eoObject, since it makes no sense to print some objects (for instance, a eoFactory# or a random number generator. +

+ +

+Definition at line 43 of file eoPrintable.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + +
virtual void eoPrintable::printOn ( std::ostream &  _os  )  const [pure virtual]
+
+ + + + + +
+   + + +

+Write object. +

+It's called printOn since it prints the object on a stream.

Parameters:
+ + +
_os A std::ostream.
+
+ +

+Implemented in EO< F >, eoContinue< EOT >, eoGenContinue< EOT >, eoPop< EOT >, eoVector< FitT, GeneType >, eoEsFull< Fit >, eoEsSimple< Fit >, eoEsStdev< Fit >, eoBit< FitT >, eoPBILDistrib< EOT >, eoParseTree< FType, Node >, eoExternalEO< Fit, External >, eoString< fitnessT >, eoHowMany, eoIntNoBounds, eoIntInterval, eoIntBelowBound, eoIntAboveBound, eoGeneralIntBounds, eoParser, eoRealNoBounds, eoRealInterval, eoRealBelowBound, eoRealAboveBound, eoGeneralRealBounds, eoRealVectorBounds, eoRng, Dummy, Dummy, Dummy, Dummy, EO< double >, EO< EOT::Fitness >, EO< FitT >, EO< phenotype >, EO< fitnessT >, EO< Fit >, EO< FType >, EO< fitness_type >, EO< Fitness >, EO< PyFitness >, eoPop< PyEO >, eoPop< Dummy >, eoVector< Fit, double >, eoVector< FitT, double >, and eoVector< FitT, bool >. +

+Referenced by eoRealVectorBounds::printOn(), eoGeneralRealBounds::printOn(), eoGeneralIntBounds::printOn(), and eoState::save().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_printable.png b/trunk/paradiseo-eo/doc/html/classeo_printable.png new file mode 100644 index 0000000000000000000000000000000000000000..09f1bad40e61191b5ac8da57514363fdd3164aff GIT binary patch literal 4327 zcmbtYdsGwG_Qq;`-~+FK1yNGGwumT*h=`PlFKW?BsK7-OPhDMIMm;_-Ih=B0S8%A+#-Yx`R#x+&pskz2Qg4jijLf}LX&>lLHE`}Y zZba&$nx(4oZ3uPdyere*Yjp8m5R_NSZY_xn(}nthSL<>Rfk42NC^Vy*Zh>GT-`z|YG1T;GV-|o> z^qz?m>Bp*#%eiSz@I8DQQ=-0=PtYmTvZv9>CCD~#?DjmNz& z?fkKe(*B&nvmZard{Kn26u8TYV^D|6-q}Ooevz3+5~(!PvA)wb0D3&&Tm3X&!#*_y zAu+vjQzF%6ZyGNltor4Uzj^$hBMjXG?mviwIvB666G7#$%)8Q$q}I1T0NO8+HyfiX zJNd5Dm_uOCi1a*_9gfceJb>`cb47wxq^xHQ(4t?Aw*zI+onVnF<_CO02HSpf7$8q2 zfJ(k>2_aT}^KWm0`#byo7R$ns=&|%`74jskFYz|L;OdK-a{#@rZ4GuF$n3Fy?xa-3 zez-mr9?4*Ik8ZYyyy2?4PMaO(#Nw>W#G?b!p^=FY!zWGk$^%uiff=`^kJ(DTMr|_; z!FLZ@Y8Nwev~I&cIg$%3-V>w5F1_nzrf@$)rCEr5(k$qdHSjL!9gHRu+Y8Q+eb6!F zf4}a(`l@{X$tyv(<}RFSc7%yyMi>eNB;8U%!Qse-5O?fzUru@op<}C!&9-p6NC71R z1rD7}JTYtv+aJKl;yf-dri+Z23)UDj+Fm@c=ki_#9w!$=y+Ekvcx=m!Zm(J4aRfG$ zPhckT&4a0rI7YQ@GuN0+GO30#tiuI)PR-J08F}`R=hW>ocqdisbuxZ+ZS4#I8TZoa zub9l=r^V@e{CPjFlN^2jcQf_>-FwG_ZRSQfg7vWuL}aD^g(uW?h4aac=rOQ-1?Iqu zR63d}8yQ(o2R{WkZw#=tPb^$yo%y-BYIzuB)^D*lb@HI`71;BQ_>(rGSEgt6T9tn3 zuc6&CuDdW)HkgQ->bpUP{eL$8?c(1CQ9i@4o8zppWfG;QN#BLgHr((~_tsOYyHI0q z7lk~7Sm`EQ(z9>-zMeIlY-H~YLdQIMOtX6Y{W0*evDT(*f!x*Ug6|QyW?rWD+YN^F znjRt4`&4ovNqO{(e9;wKCQOSb_F2ct*TE_!32x^uiL zCG)_s+IH*T0r=bAw}wKc`{{=4NlfXbP%>Y5Ep17(g4M@4OG@Q^l8P#Fg4UDIiD`bz zFJ5@YR?p%ebxEdgQYSc}+szc)m3aqsAXB~X?qTDdKCT^yrrq$>RI&?|I1Mf8G#B;f z1^z5&BOj-FHY)gx{dm_Kv$!?Tu(L_%>UiGumNRgGF+aY^)ral|+g^l#WmMh~=SV=; z<~hk;dr$tGk=}OrEzU|SrdPS5s_(v~eJO;Ozao4dP)1s)2?EUV27y1ss-G;;x0w-6I7{BuFxq zDF(W_)dxy+uNalaj3N{FC#}gLa;4AC1f9+xb=SaR)rKxJw^dJZCWl6^N}+IgY(HXN z{{Sm+eY!q15^&}4L`LZE?}nQ-1#tgqgbiLULe2G+{( zWN#hlV`!nw@{k)>4h}wX4IBsJ;bmcb*Xvbz;12=zPX+GQVwmR{qZrgW3O}p;!r0i* z@7rvPb!M;QIF?FF4&vF;SfFZ-D#NKvIv|Y=`niOzi$965z;|QcywXmcv|4b)FLXXU-uR%_R%n@^}XAqk@U(ZgXWm zvM8Bh7>HBp9d5S~HQNXg63XJH*ADV|UbQ##LLYYv!j*gKb;oO-0;+RMF6VIqsN@D+ z2<|DOprN;+Ts^%0D`&5};jk@E;J)7;B8!MZ5_{eC3HfyGqYl5=86m(LF{pJ zw=DLJqQz>Y(SNummnU=Q5kQ63@rHj*pRDhNy{&!(F!mh_ehpRat}I5%ZA~@n9+FzG zE&Q3N&)nz($GM`rRn7~CB>K@EXG@Ih^PJDdTg^$da33PUcMB)ygX0N<(hB?HTprV( zk9JdJ?WItz#oO6HT34H|fs?>XBGvUaqPasdbJe(?vh1~bkCHDqPyfT&`LtWJ0aRAC zGp=z{G;W8`2tU#iSUnnW=AY_gJzF>@>5qHcyT!~1+Lu4IhLjib;9* zN*Ez#=cT=VfAPE)CLI6f6`Gk*Q+vac%C+nd=aF1e6zzAQLmCbuh{&-d=GO@df@Sd5 z1G6sMrek-}Wl73!jAu-HcqA2HR`oxAK5$42`8Kqjef}@K54#!5tRCJ&)}4Y0O*{K! zYZI+!($310(50!c^%?VmCxU_|z$*c+s0ZXFlH-r9-3@nUX3mtncU+_mBBskyxhxB~ zkZ&A({hT5x^4Ad9Jw9r`i%gdZ*kw+s-hK8efiUAw!{_ruK^!Es4jZ|(8ZeLT1@^p% zn(!-`!WC04X(4{3a9IVX zeV4ofJop0m3i|%h>cd&8J;OE(!8SdK<<4z1afyhhZLl{60kV; z@47^|S`gb#t%pnTQlKF{LLggR3o5gjv^Ol=Mo%DRotMi0yvSpWHcK*$c3P@Jnv-?5 zOu=Q678W;EPb!u@`V2C>@*1x}cHf{oX1vImZ}JD=!BDe+%ELj4D}j7#ayG(8u90vH rYm2G-=fs*e{tSXUz-~#g*a$@e)?(Uwdnf-&SOo + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoProcedureCounter< Procedure > Member List

This is the complete list of members for eoProcedureCounter< Procedure >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoProcedureCounter(Procedure &_proc, std::string _name="proc_counter") (defined in eoProcedureCounter< Procedure >)eoProcedureCounter< Procedure > [inline]
eoValueParam(void)eoValueParam< unsigned long > [inline]
eoValueParam(unsigned long_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< unsigned long > [inline]
getValue(void) const eoValueParam< unsigned long > [inline, virtual]
longName() const eoParam [inline]
operator()(void)eoProcedureCounter< Procedure > [inline]
proc (defined in eoProcedureCounter< Procedure >)eoProcedureCounter< Procedure > [private]
repValue (defined in eoValueParam< unsigned long >)eoValueParam< unsigned long > [protected]
required() const eoParam [inline]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< unsigned long > [inline, virtual]
shortName() const eoParam [inline]
value()eoValueParam< unsigned long > [inline]
value() const eoValueParam< unsigned long > [inline]
~eoParam()eoParam [inline, virtual]

Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_procedure_counter.html b/trunk/paradiseo-eo/doc/html/classeo_procedure_counter.html new file mode 100644 index 000000000..677abb3cd --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_procedure_counter.html @@ -0,0 +1,93 @@ + + +EO: eoProcedureCounter< Procedure > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoProcedureCounter< Procedure > Class Template Reference

Generic counter class that counts the number of times a procedure is used. +More... +

+#include <eoCounter.h> +

+

Inheritance diagram for eoProcedureCounter< Procedure >: +

+ +eoValueParam< unsigned long > +eoParam + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoProcedureCounter (Procedure &_proc, std::string _name="proc_counter")
Procedure::result_type operator() (void)
 Calls the embedded function and increments the counter.

Private Attributes

+Procedure & proc
+

Detailed Description

+

template<class Procedure>
+ class eoProcedureCounter< Procedure >

+ +Generic counter class that counts the number of times a procedure is used. +

+Add a procedure through its ctor and use this class instead of it.

+It is derived from eoValueParam so you can add it to a monitor. +

+ +

+Definition at line 41 of file eoCounter.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class Procedure>
Procedure::result_type eoProcedureCounter< Procedure >::operator() ( void   )  [inline]
+
+ + + + + +
+   + + +

+Calls the embedded function and increments the counter. +

+Note for MSVC users, if this code does not compile, you are quite likely trying to count a function that has a non-void return type. Don't look at us, look at the MSVC builders. Code like "return void;" is perfectly legal according to the ANSI standard, but the guys at Microsoft didn't get to implementing it yet.

+We had two choices: assuming (and compiling ) code that returns void or code that returns non-void. Given that in EO most functors return void, it was chosen to support void.

+But also please let me know if you have a compiler that defines _MSC_VER (lot's of windows compilers do), but is quite capable of compiling return void; type of code. We'll try to change the signature then.

+You happy GNU (and other compiler) users will not have a problem with this.. +

+Definition at line 64 of file eoCounter.h. +

+References eoValueParam< unsigned long >::value().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_procedure_counter.png b/trunk/paradiseo-eo/doc/html/classeo_procedure_counter.png new file mode 100644 index 0000000000000000000000000000000000000000..41bd430a8460109a212a506c784b0b259469c29c GIT binary patch literal 786 zcmV+t1MU2YP)P#GLJ<+Z=CwcJbD7p0b_N&$ zOoS~9PJjVsw-m-*;xi&00;7E7*%`)Nk~0wA?&kwAi5cJU8R?Eqy$6;l>RH}V*-jQ5 z1zVN^qk0?%qj|8Fjof8uJ|71Ab#s`*P79m*D)&(Pcx>1Uz%GB^6!vksyeaIBv(aG= zbC|;%<}imj%wea4P5m?YzW=Emb^wgDV!G6tHo#ByMBLo%jrb9U%N@1!n_*ff<-)Ai zOHs@B3==uBwAD?yfJ<2^W?2k611gLMvV^X~tO8sPD+iOnWI_=j4<|GjYK@q(63kk4 zQt?-XneW4v4yG|{QnJByE#+D+%P8q-4W?Cl-l^Qj`n>=}r<*G<8;a$-MVs1Y*uW~S z^K7ZGwv8p=ZF5(iX|=txzRk0;30PoM_GtyPn3>vQRve@ewiC0GjXXO6kt7zNZKEU# zOY27^!n%!;jrQrO%SKgPPyOGt-Jjy~VYCNZE1u%n?h|dLIL}kxVGqKlzRFE~N&Wv} zUe|v)*c)e~!yM)?hdIn)4s)2pP6vZ|Ers+{m%nWedu><*SgT{-hqR;Nl-{iQiW38D zYY_+2xT9I?zK7*?MNn8uxo3g^Q4B;Tv&l6JAzQFPN(~lc9hNV7OqC5V86T3sKzk;T zyCPF_)&XBslcz1PHY{KCPS0jE!Z>EBOx&1FHY`NtIt|Ax+B~6S>JjRal4eFXo%Zth z29ui=OddbVl2|ktKnJs|V?*;SY+-GQ&1mIWsGg0mW*AH2be`3iRalEztQ$E5GS)?; z6|BV!Dz1xJ%SKu2kc~O5OcsX}jhc;Jp2sj|ql^xlY@F2`=CISkX1>b(1ATMnqr?H* QHvj+t07*qoM6N<$f+q%MlmGw# literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_prop_combined_bin_op-members.html b/trunk/paradiseo-eo/doc/html/classeo_prop_combined_bin_op-members.html new file mode 100644 index 000000000..477b98e1f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_prop_combined_bin_op-members.html @@ -0,0 +1,32 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPropCombinedBinOp< EOT > Member List

This is the complete list of members for eoPropCombinedBinOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + +
add(eoBinOp< EOT > &_op, const double _rate, bool _verbose=false) (defined in eoPropCombinedBinOp< EOT >)eoPropCombinedBinOp< EOT > [inline, virtual]
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const (defined in eoPropCombinedBinOp< EOT >)eoPropCombinedBinOp< EOT > [inline, virtual]
eoBinOp()eoBinOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
eoPropCombinedBinOp(eoBinOp< EOT > &_first, const double _rate)eoPropCombinedBinOp< EOT > [inline]
functor_category()eoBF< EOT &, const EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
operator()(EOT &_indi1, const EOT &_indi2)eoPropCombinedBinOp< EOT > [inline, virtual]
ops (defined in eoPropCombinedBinOp< EOT >)eoPropCombinedBinOp< EOT > [private]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
rates (defined in eoPropCombinedBinOp< EOT >)eoPropCombinedBinOp< EOT > [private]
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoBF()eoBF< EOT &, const EOT &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]

Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_prop_combined_bin_op.html b/trunk/paradiseo-eo/doc/html/classeo_prop_combined_bin_op.html new file mode 100644 index 000000000..39b6f01ad --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_prop_combined_bin_op.html @@ -0,0 +1,61 @@ + + +EO: eoPropCombinedBinOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPropCombinedBinOp< EOT > Class Template Reference

COmbined Binary genetic operator: operator() has two operands, only the first one can be modified. +More... +

+#include <eoProportionalCombinedOp.h> +

+

Inheritance diagram for eoPropCombinedBinOp< EOT >: +

+ +eoBinOp< EOT > +eoOp< EOT > +eoBF< EOT &, const EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoPropCombinedBinOp (eoBinOp< EOT > &_first, const double _rate)
 Ctor.
+virtual std::string className () const
+virtual void add (eoBinOp< EOT > &_op, const double _rate, bool _verbose=false)
+virtual void operator() (EOT &_indi1, const EOT &_indi2)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+std::vector< eoBinOp< EOT > * > ops
+std::vector< double > rates
+

Detailed Description

+

template<class EOT>
+ class eoPropCombinedBinOp< EOT >

+ +COmbined Binary genetic operator: operator() has two operands, only the first one can be modified. +

+ +

+Definition at line 109 of file eoProportionalCombinedOp.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_prop_combined_bin_op.png b/trunk/paradiseo-eo/doc/html/classeo_prop_combined_bin_op.png new file mode 100644 index 0000000000000000000000000000000000000000..a17fd1fa7fcbe96d6b2624726dbe39f598eb7000 GIT binary patch literal 1993 zcmb7Fdox{z?3}ZI+A3@cF0nPLB1(iyrhALHSQBf#Ijo!D` z*4CtUl|ns*vVEw&5W?K}4G2UlgzSFq^4Ef8K`-#a>Bt2yw!0|T;cCY|p{oyBQ{iH* zIw&T>$;a-}obs=)EJUJ^(DF2^+@z(ZzanN_@%wda?28B@zIop{vyIZ68TO50TNBhF z*lKe62(e(A&ldr2ZYhrf{jb~Pe-ScddV9R`d&!Lh%o8!vi;|Rl+up1iqJfk-n#^Y6 zfsHFBFBj$YNtiMHsZ7#n#CFF{eVuO~`&f9&&c@KxpDhy5ZD}mv;cN~)zPGlGd0fDd zDkheAm6aCG4k(k2C0*Q^E|KKwQ=W$%qQJnd@MBQon&I4I<33cHca}fi@I50UegqRB z>uhV$iMJLlj&-r~Dx;>Sde^&PATzz*P&hQ6e1K}^7!Rkf^-o>;237`yzd9VDvrPm! zm6sRg6a-$z{3Vz1F$R#i*RF}_*tdXJ=K`tlg+hVr0c9i$aLlt-GD%yX`5X@6)N+HPcgA|;k(D=p?@K2;N0mlAlr z$6TeW_<+dd?xpq$+dRsY@Nc5A)6!z7(L9*P%{OgQK4>e^=Js(ro?D&uyWVf}wtLjM zxyOhbaT*zT)=5>4;qQ2?=ohxw9|E=!ilSHxu>T(8kl8aR=>`NqJ5gE6K`7?V3Q+^` zlQ0f~^;JUNLNI4mUFx2g%`2sGuowt1JvjEVnwm_JDzzY>@sDj?>J5;8Y2v?ObyL;T z&XI{njM7o4AhkRW5)pdSq!s<`RjscM{r?n!s`QSsY(U1SB26x|hXEzYx<7dA3ac7&J;x3m`HLRez>XIP}TB2)J@FE%R`G4gXk6#0pLFdSUi zoDu&pK6+)U8%b=4LMU#LYxakb*(Jasce7a?Z1`Kh~QkRAwt`4wQRvzIlQt)~^c1J$Evp zvNX#H&d6aH;>7T<@3`DD7YdbHMfA&lED;F$Z0xYtWq5p_&E(mHf}kIoHj^dV`2(6g z%3ZyBhpmZdww-sWpz^$nt4xxWXL=dmJX`kjPGQUUgXy}Uej#EGltMurQtllbr|-jq z7g;xMs^YzOCUaoM8qJDs^@7K;Ccx8fg&F%^&Js2!{EE7g1M^K!?An8F7P5Yu^-7CZ3tV2>(UCLfo*QQu7k&hv z4L!d3Y0A6X;6&{Rc77obt_+IrwvDbn)k~MIa%p!@G#Ndg9~H~Gz4povTxr>vNof#Fav8T{qGI`(!?{h-yAJ@A zGy_bBGv3(?<^VoyNF}#!TJPkj+bA`W;h0u9ZEuOz7YZ8h9SRN zD1l1NkZ8|$586!XHN-YLdSar|)V3*DGU}B5sh|6~)Tw?Jo5Wu))ZVvxZ-#{bnIPDv kCk>}HyyXi)&tOzY?RLYAL-QRO>VFqPzCd*spAWtNPbSTs-T(jq literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_prop_combined_mon_op-members.html b/trunk/paradiseo-eo/doc/html/classeo_prop_combined_mon_op-members.html new file mode 100644 index 000000000..110995afd --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_prop_combined_mon_op-members.html @@ -0,0 +1,33 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPropCombinedMonOp< EOT > Member List

This is the complete list of members for eoPropCombinedMonOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
add(eoMonOp< EOT > &_op, const double _rate, bool _verbose=false) (defined in eoPropCombinedMonOp< EOT >)eoPropCombinedMonOp< EOT > [inline, virtual]
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const (defined in eoPropCombinedMonOp< EOT >)eoPropCombinedMonOp< EOT > [inline, virtual]
eoMonOp()eoMonOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
eoPropCombinedMonOp(eoMonOp< EOT > &_first, const double _rate)eoPropCombinedMonOp< EOT > [inline]
functor_category()eoUF< EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
operator()(EOT &_indi)eoPropCombinedMonOp< EOT > [inline, virtual]
ops (defined in eoPropCombinedMonOp< EOT >)eoPropCombinedMonOp< EOT > [protected]
printOn(std::ostream &_os) (defined in eoPropCombinedMonOp< EOT >)eoPropCombinedMonOp< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
rates (defined in eoPropCombinedMonOp< EOT >)eoPropCombinedMonOp< EOT > [protected]
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]
~eoUF()eoUF< EOT &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_prop_combined_mon_op.html b/trunk/paradiseo-eo/doc/html/classeo_prop_combined_mon_op.html new file mode 100644 index 000000000..54c4b299a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_prop_combined_mon_op.html @@ -0,0 +1,66 @@ + + +EO: eoPropCombinedMonOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPropCombinedMonOp< EOT > Class Template Reference

eoMonOp is the monary operator: genetic operator that takes only one EO +More... +

+#include <eoProportionalCombinedOp.h> +

+

Inheritance diagram for eoPropCombinedMonOp< EOT >: +

+ +eoMonOp< EOT > +eoOp< EOT > +eoUF< EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoPropCombinedMonOp (eoMonOp< EOT > &_first, const double _rate)
 Ctor from a "true" operator.
+virtual std::string className () const
+virtual void add (eoMonOp< EOT > &_op, const double _rate, bool _verbose=false)
+virtual void printOn (std::ostream &_os)
+virtual bool operator() (EOT &_indi)
 The pure virtual function that needs to be implemented by the subclass.

Protected Attributes

+std::vector< eoMonOp< EOT > * > ops
+std::vector< double > rates
+

Detailed Description

+

template<class EOT>
+ class eoPropCombinedMonOp< EOT >

+ +eoMonOp is the monary operator: genetic operator that takes only one EO +

+now accepts generic operators +

+ +

+Definition at line 58 of file eoProportionalCombinedOp.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_prop_combined_mon_op.png b/trunk/paradiseo-eo/doc/html/classeo_prop_combined_mon_op.png new file mode 100644 index 0000000000000000000000000000000000000000..992e2532063dd36599be111b7b13bf62601c8c74 GIT binary patch literal 1628 zcmb7_c~H`67{>u2e@ZDNYNP3bl^rH(Zh6!Y8l-HZmg0S2rFoV~X|5Rx86d4`hj~lb zX{%OVTiCy{_VqM74X;Yd=u{I>AD0EplI#H4zq{B?n&ZL z=+R*BE8JskQ)6Z=jYIA%{SO+Bgw(mhjzV#~47u4++F%p0H#p|FT(1R_;kTRuv$0s- zw#V3o88Qb=e0>%75^=dvMOGzwX_+EEFQ!SGx)kgjVIYrs*jROKm~IbULsQ1wLf}6qz%uv!$*?x1G(`(L;+&dCFworcFNr8nI!c(s6)!9;2HK)?j znY3xm%dxml65zV4L=xXHc8g!X32-gDxmI6|a=`Rv#{FWM+qR{+vbiX2o2^@R=mLDv z31|+g26Z46<&n8R*US5hfErARvyLhDNT{d@F_2(bxP|VZD!0&vUOMy zz!9YqCQe2 zN_h>dnd*pn5ZZK9BM=Uxs;K~fSCfxGtIK(?yHY~q+H+M_%j(}WeF;d8*Ob34?AK<{ zi&sxo$j@N<>u2*p()NO(z|NkZ=DABOU%kZS9h9zLaF~J_y%%}XLcph&jW*TIeG+)E zMdJgQKbI`*Q_J+)^V+#W?r`#sSf(QiO6sgd2qb&sHtl|gIU7qu&6o>zK>T~}_o#yR z+H*AmZi*;K`7#!wt*DkyTn6r(egu2z@G9y{lMH9O;8O*m;0!4vmN?%Bi}6K9pMBJh z01`&u02k1!1cMkxXkqsBm#Sg#WkpEAHXceu;Zvg2r2g7I;Y5$^gHvyv6af|(GA!Uf h$eETQha_bA3OLjtwBB>)d$!^$0Fj7}gkoDN<1b#^)rtTB literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_prop_combined_quad_op-members.html b/trunk/paradiseo-eo/doc/html/classeo_prop_combined_quad_op-members.html new file mode 100644 index 000000000..3b2c48a97 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_prop_combined_quad_op-members.html @@ -0,0 +1,33 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPropCombinedQuadOp< EOT > Member List

This is the complete list of members for eoPropCombinedQuadOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
add(eoQuadOp< EOT > &_op, const double _rate, bool _verbose=false) (defined in eoPropCombinedQuadOp< EOT >)eoPropCombinedQuadOp< EOT > [inline, virtual]
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const (defined in eoPropCombinedQuadOp< EOT >)eoPropCombinedQuadOp< EOT > [inline, virtual]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
eoPropCombinedQuadOp(eoQuadOp< EOT > &_first, const double _rate)eoPropCombinedQuadOp< EOT > [inline]
eoQuadOp()eoQuadOp< EOT > [inline]
functor_category()eoBF< EOT &, EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
operator()(EOT &_indi1, EOT &_indi2)eoPropCombinedQuadOp< EOT > [inline, virtual]
ops (defined in eoPropCombinedQuadOp< EOT >)eoPropCombinedQuadOp< EOT > [private]
printOn(std::ostream &_os) (defined in eoPropCombinedQuadOp< EOT >)eoPropCombinedQuadOp< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
rates (defined in eoPropCombinedQuadOp< EOT >)eoPropCombinedQuadOp< EOT > [private]
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoBF()eoBF< EOT &, EOT &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]

Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_prop_combined_quad_op.html b/trunk/paradiseo-eo/doc/html/classeo_prop_combined_quad_op.html new file mode 100644 index 000000000..2b0d59e9e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_prop_combined_quad_op.html @@ -0,0 +1,66 @@ + + +EO: eoPropCombinedQuadOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPropCombinedQuadOp< EOT > Class Template Reference

Combined quad genetic operator: operator() has two operands, both can be modified. +More... +

+#include <eoProportionalCombinedOp.h> +

+

Inheritance diagram for eoPropCombinedQuadOp< EOT >: +

+ +eoQuadOp< EOT > +eoOp< EOT > +eoBF< EOT &, EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoPropCombinedQuadOp (eoQuadOp< EOT > &_first, const double _rate)
 Ctor from a true operator.
+virtual std::string className () const
+virtual void add (eoQuadOp< EOT > &_op, const double _rate, bool _verbose=false)
+virtual void printOn (std::ostream &_os)
+virtual bool operator() (EOT &_indi1, EOT &_indi2)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+std::vector< eoQuadOp< EOT > * > ops
+std::vector< double > rates
+

Detailed Description

+

template<class EOT>
+ class eoPropCombinedQuadOp< EOT >

+ +Combined quad genetic operator: operator() has two operands, both can be modified. +

+generic operators are now allowed: there are imbedded into the corresponding "true" operator +

+ +

+Definition at line 163 of file eoProportionalCombinedOp.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_prop_combined_quad_op.png b/trunk/paradiseo-eo/doc/html/classeo_prop_combined_quad_op.png new file mode 100644 index 0000000000000000000000000000000000000000..c12f759a47db041e3fdd4ab4fab1d45a32948a56 GIT binary patch literal 1767 zcma)73sBQ%5|34+0l}+40j1Z6a!P>|3#b7kwm^BLgc2n9xvnT zHTL2vmCDlZ?GtP2x?^b6LC67cFc$*ZNQ;mD;7~DVj;kuX66PM0Sd`NJ6*Q}iUf;Z0 z8PdbKK)268w^R(0WwcEX{XMq1KH7e1N%^E656iJy{JSW1?aAoYFMon5MCf8*uOHzY z`0FuAz>Qbs*^;^j2hcK{e+Lo#O~49cE|<`{S*i|XsH9ZBoCwzBSDQMl<_-?-jBYG! zYOZZ~(73G!`ve=&ewMOqb1A+JzluIHhM$@wyYC)w3{FnXgmFkglj<co9 zpCf}O(Wowhqp$!VN{fS@yE!t{W#v+7*Q3E zZ}dj+W#yJvTPg#Mb@QFi)F)F4_D%+`z+S$|1$a4WR|k_ooi_XS`SeIda2hnkabf9s z+EL3Ef@{V04Ne+(S}`8B*i5Ggc5d?Uhl)c4EC8Rp?kAe82-me zf?Lw-CJr!h5?+e4SlOzO^FINvc`lX(^eYT_rbpB5?&*(~wfh#7c;+a(JuW!k;%9oc z0a#4ajRxIqD6)ChHs`2D9-036>27A@kDG+uDOAsuT#K|;^*2~cQq=Ku^BaLw75+{a zBJVKrqNGPs%-QU#_GwuVC9nXu)^FdD4~3W*wpvH93^5?Q=AD`Nu^%wcYdiP_f*u#GPW@vc$ zM7^QGv#esUr1^5Gv;Q7xO2tkU=BA9f)|7zPYHWi_AfWY|8%k<)SW*=5ir(D zQAKI+I}ILa&$A`zV)}eG#lHG7+5e{f=UI(F6Pi$kvD|ki-hE&H+wgF79B+!=kgYL| zHj#!d3*qlC@n43@!KOIMMC=6eA7URL?!Q~Etrng@FwY8)m?puS zhIGy|>ZGWr?6x_p+3@%tMywIs$|8|?voAXOsm!VS0T-t_$A_D}*iq- + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPropGAGenOp< EOT > Member List

This is the complete list of members for eoPropGAGenOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + +
apply(eoPopulator< EOT > &_pop)eoPropGAGenOp< EOT > [inline, virtual]
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const (defined in eoPropGAGenOp< EOT >)eoPropGAGenOp< EOT > [inline, virtual]
cross (defined in eoPropGAGenOp< EOT >)eoPropGAGenOp< EOT > [private]
eoGenOp()eoGenOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
eoPropGAGenOp(double _wClone, eoQuadOp< EOT > &_cross, double _wCross, eoMonOp< EOT > &_mut, double _wMut)eoPropGAGenOp< EOT > [inline]
functor_category()eoUF< eoPopulator< EOT > &, void > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
max_production(void)eoPropGAGenOp< EOT > [inline, virtual]
monClone (defined in eoPropGAGenOp< EOT >)eoPropGAGenOp< EOT > [private]
mut (defined in eoPropGAGenOp< EOT >)eoPropGAGenOp< EOT > [private]
operator()(eoPopulator< EOT > &_pop)eoGenOp< EOT > [inline, virtual]
propOp (defined in eoPropGAGenOp< EOT >)eoPropGAGenOp< EOT > [private]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
wClone (defined in eoPropGAGenOp< EOT >)eoPropGAGenOp< EOT > [private]
wCross (defined in eoPropGAGenOp< EOT >)eoPropGAGenOp< EOT > [private]
wMut (defined in eoPropGAGenOp< EOT >)eoPropGAGenOp< EOT > [private]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]
~eoUF()eoUF< eoPopulator< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_prop_g_a_gen_op.html b/trunk/paradiseo-eo/doc/html/classeo_prop_g_a_gen_op.html new file mode 100644 index 000000000..201cc971d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_prop_g_a_gen_op.html @@ -0,0 +1,77 @@ + + +EO: eoPropGAGenOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoPropGAGenOp< EOT > Class Template Reference

*************************************************************************** eoPropGAGenOp (for Simple GA, but Proportional) choice between Crossover, mutation or cloining with respect to given relatve weights +More... +

+#include <eoPropGAGenOp.h> +

+

Inheritance diagram for eoPropGAGenOp< EOT >: +

+ +eoGenOp< EOT > +eoOp< EOT > +eoUF< eoPopulator< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoPropGAGenOp (double _wClone, eoQuadOp< EOT > &_cross, double _wCross, eoMonOp< EOT > &_mut, double _wMut)
 Ctor from * weight of clone * crossover (with weight) * mutation (with weight).
+virtual void apply (eoPopulator< EOT > &_pop)
 do the job: delegate to op
+virtual unsigned max_production (void)
 inherited from eoGenOp
+virtual std::string className () const

Private Attributes

+double wClone
+eoQuadOp< EOT > & cross
+double wCross
+eoMonOp< EOT > & mut
+double wMut
+eoProportionalOp< EOT > propOp
+eoMonCloneOp< EOT > monClone
+

Detailed Description

+

template<class EOT>
+ class eoPropGAGenOp< EOT >

+ +*************************************************************************** eoPropGAGenOp (for Simple GA, but Proportional) choice between Crossover, mutation or cloining with respect to given relatve weights +

+ +

+Definition at line 42 of file eoPropGAGenOp.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_prop_g_a_gen_op.png b/trunk/paradiseo-eo/doc/html/classeo_prop_g_a_gen_op.png new file mode 100644 index 0000000000000000000000000000000000000000..9ca3846d539f601725894d5281311a1e0645f582 GIT binary patch literal 1981 zcmaJ?c~sL^77kEFk!_$36ogC(9#JF+0tUh^VbidLZIB(4q7XvMlE@M&B2-}_ge^*g zC{Pe-0DoW*BZQ@fup|f`mY)>R1X&~z5hO@(nA9HIo=#`}c<fD$%JTSqo zDRPuQ2jf)gEbPp;Qp_SZe}oTO|Fh1|B=bXzQdseIK`8It(!^s8b_!a|(Ih9Gyn?p*3Xe*~}9%F)XA12LSNWW1SHj^T}6T)Y}Sk1&3 zuaKcL)ahI*6XDFZrSAt%x{#^>){9C_2Xp1k7hX82NkvNpab?%0_5sm5G9u-C-AH(@ z_)B{!wqC8cLxh;wT7)t`%sIs)`w7J>Ie0crAN4P8V6PSpn?Eb+K`*#H4QqpO_JLJQ z0(q)Vo##3g9>0YjRm_Uow7S;TCgL2*Lo^lYt+{!^#23DH&gC_fbbDYhuZA+V4`o~3NW_OO(mxu4M|{yC6pwAW_PC) zfj(|0qo1%qwWFCt9m|!mWpVjQMCG>xxbz*}qygv~@z^*TGs~e*(||g9MF32rm+bkB znMe$zgc>6BT%9d75}61|tfgQu%SUH1BytZ6zy9|I>OB|T25QJ%*R8;(+~)c*cRKBr z2+*OvNnE^DA3Im^bA8K%LznIIB|QSkSi<%qBBfmtRggq_KZtc`B6wqGg{H;iqrX=f zXWuKI`&m6Hb;ucoZa2R_j6xJYsW9Xp%cnj*U=BqPQbv`Q$#<*At)WL@Qp zM|`X_I-TTiFAOm|BQj$Uo%A%q9-@>5#K0<#P_X*4f3Odhq%t6_P z`LwZ#7qivuLSJ<(v?K4*YzZa%lN?=$L9Ln^@#+ShzTAIb%TU9`v1zGl)xkRsCuXpk zba=qqFc#=LpN`h1iu1}cUKf?Gc04Iqi2>uXTLOl#1*c2`S%|^_&`!e+x9;ImSCPcz7+WKzn zVU8%>EU{Ho53O`yXdC8R0DT*JpiuKw@j%A@96Z$!$!86Xy4N+F4(7BwZzPVn4R(eG z8l=NnvDk<_3xk$`Ie>-2MtFkL>t2n6L=Fr|{~pdB0)s8(hd{qWL5Fb#*2o4|XKZrt zD6^vFtlq81%l?!a8!370O5o~RH=Gb#An>6)nAACTY#c;c8r;^aRV{CHO)Pu)>Xc~b zvv%SB876Tc95}hb3^PjaH;$i!M!OSnn^5213JZlx7x(S*wBN?$dWIH+cWGp6E%^)5 z*5%7Ge#GZbPug$fx0k5=^jyMXD_b!d6mYP1nUD@brMo>q_eM9<$i4q92K%6m5r$+O z@$4$u{)E2DA7u1N9s|4o1h#dZn#{_0O*^jqhYKlop+hcTmAow8G(t9e6UQNqcud>O zwE{rFdw{?7d~>!UpE8I^ZfX-&i@K747FF-9smJhdo;AMCMA{Fiib|$Ez@lMN>ge8v zUnt(xi0&EBs`D`1%qKDu*s$vcu0)KvrA4(X=5hI8sjELjS9i7DJjV3dsxJ{6WNE%# z183jn-@Hp5BW9H7-C5fU1Zo~1n1SFDE&*9@9I7sU?5n@N*%Y_A_8es+OYM~oemGPa zC)^YS@xS^1AM1Z+f?i>qPd+6e zESyWbK4Ou{`C3A+VqJBJ8Sug*I=Z8UCTZZqgPD$!c+B?A53nO4+oskg*b^a`y*M|p z{F1j53tD)giMsT1kJ{Zh9+-+vxQ7OhpabTCfR@W8w!9~bINL<3tJP$!XlaQ`Lw%jj&^%st+tSHnSIl)<{-uF#|p0ZgB N@j!XGG&)CK`Va0U($xR} literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_proportional_op-members.html b/trunk/paradiseo-eo/doc/html/classeo_proportional_op-members.html new file mode 100644 index 000000000..f1ae05670 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_proportional_op-members.html @@ -0,0 +1,35 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoProportionalOp< EOT > Member List

This is the complete list of members for eoProportionalOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + +
add(eoOp< EOT > &_op, double _rate)eoOpContainer< EOT > [inline]
apply(eoPopulator< EOT > &_pop)eoProportionalOp< EOT > [inline, virtual]
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const (defined in eoProportionalOp< EOT >)eoProportionalOp< EOT > [inline, virtual]
eoGenOp()eoGenOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
eoOpContainer()eoOpContainer< EOT > [inline]
functor_category()eoUF< eoPopulator< EOT > &, void > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
max_production(void)eoOpContainer< EOT > [inline, virtual]
operator()(eoPopulator< EOT > &_pop)eoGenOp< EOT > [inline, virtual]
ops (defined in eoOpContainer< EOT >)eoOpContainer< EOT > [protected]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
rates (defined in eoOpContainer< EOT >)eoOpContainer< EOT > [protected]
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]
~eoOpContainer(void)eoOpContainer< EOT > [inline, virtual]
~eoUF()eoUF< eoPopulator< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_proportional_op.html b/trunk/paradiseo-eo/doc/html/classeo_proportional_op.html new file mode 100644 index 000000000..7a41a0bb9 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_proportional_op.html @@ -0,0 +1,48 @@ + + +EO: eoProportionalOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoProportionalOp< EOT > Class Template Reference

The proportional versions: easy! +More... +

+#include <eoOpContainer.h> +

+

Inheritance diagram for eoProportionalOp< EOT >: +

+ +eoOpContainer< EOT > +eoGenOp< EOT > +eoOp< EOT > +eoUF< eoPopulator< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + +

Public Member Functions

+void apply (eoPopulator< EOT > &_pop)
 the function that will do the work
+virtual std::string className () const
+

Detailed Description

+

template<class EOT>
+ class eoProportionalOp< EOT >

+ +The proportional versions: easy! +

+ +

+Definition at line 135 of file eoOpContainer.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_proportional_op.png b/trunk/paradiseo-eo/doc/html/classeo_proportional_op.png new file mode 100644 index 0000000000000000000000000000000000000000..2c031180d909eddb0b3bbeada0d3437f5bb6df66 GIT binary patch literal 2267 zcma)8dpK0<8Xt7SX4>5_$YxAwtL)CnNP|h4k&Vfa5pqd0IW+bVMof+9f+y29B`SuP zZX{`qOPVNbOoN$ZGnPRqmt-Mf#3W}`r>D-d&w0-IW3BbB_x*kE_r34;`+m=t;zn}R z(m-h-5C|=&-45;ugsKd--!D>w-|h9XYw$WF`4QP}fm zeOAn=;B;U8er}Riu)JuQuffb#-m0;t0ke-EZfba6AQM=ZMw)W%SH{y^dpuXBYn=iT z+_1~VOY-fRjMSF3U9nTqfNS}4&WMK#`|UOcpxzKx%!i6>1*~@;%vJ+UNzAonO_hzJ z%|$(z+ExoF)EM?P^PB_w?RaZI4~H2db*2q}xLdUK#TgcNR6&)nLH^1YLE(VaxsQLk zW)dC$KDuYZn&`~Wg{Vmr62e01__{rzLQ~<{Y8{}5{B9#Lg}%k6(@cK9raV}8utrt3^E+lVk62k=0z2}d{nRQ%R6vSmQM;tAKbJ9Cqq zEjtZl80J3^qFLvlktai zL#SOBLrt5{Ml-!Rx(iIv)xyyJi`};bviO9`y1J$N8I-X{B&OGV?TiL!g`A}UMqU-` z0meiVHCL0SmPh~T^IjWlP(oQczfxV-_g0kDCIHBnub{<6Z(|jz{)=g9vvW4A#hP~2 z691apSLp^u0do?_`2fN|m4@zHykgn6G@mK66Wn2@4?8cj1H2lCK=&#B#DYlv)%$hE ze}jH@I^;nDhL6Q;<0hw9VbhIo$3Y{J*;_#BPpAnHH`xCxE7?S7(WR~zvOH)%KW*M{ zc1)bXwunaZ3m0;ER^TFYXUo~V+O*a`8CB&AyIp0y4FJ&hu2-nH2d@c+!x6^cb1l<*O z$r9SQGiC&6(_G?sW9>$v>Y0uc5&p)wMUJW5S?{9Mq9UIQP`Hm>@DR7ENihQqh|`dR zek!a-iBH?io3q@b*MjUarm>Qen!O1({VMY2>O?A+sOYSQC%2C!d)&=W3v)>~9Mtke z4bv`eY1-#2@-LpFgLNe**Y+B{qDrNl1?g?#%FOFsb8nfia=~exgvF~EYrpmzgNoHS&;)YGL$~>;% zsA3pw^E&%uIaMbx8jNSw$x?w%Nq-paFw~$ZH)_64|49S?d_J!vq-Tp8_WYNiMOr$i ze-c`}@vj^ZDaCfe>0VSYu2rgR;P3oQpufVtrMg}ug6?qZfsbka3W9g%@F3gTTr)v3A45_QV=eI^j zFoy@QJj(kc{c@Cbl97Hc+33!0`k}H0u&guKSum^#b%jYvHrxTV;`G zJKsTw0K>JRLgJ0PodYr%Sb*{l`;_n?`=m`_iXM$|0tOJwyq)ca5$JS3dr%0k z{ll(R-}R#J&JTEG?=>~J@{)Fg<>H1KN+c{e>K18VWanG4-wpczoGeWaxgOl^?;NR6 z)rh(?7#_vTDQ-77SKQWCcBQU0I_?1_a@zya9$Bb%uyRzPl#! zeJI;hzUQu=B&<+k7K(z5h{q0*cqObX|hVEkT=2o{OU z*>j7kFLA;hwQ($On>;X%xL$kOF@nB8%yLt1lWfFg6>c5r$@M53u$E8k) W)q%Gr$pP?91mQ#=ITY^ literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_proportional_select-members.html b/trunk/paradiseo-eo/doc/html/classeo_proportional_select-members.html new file mode 100644 index 000000000..a904d2053 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_proportional_select-members.html @@ -0,0 +1,22 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoProportionalSelect< EOT > Member List

This is the complete list of members for eoProportionalSelect< EOT >, including all inherited members.

+ + + + + + + + +
cumulative (defined in eoProportionalSelect< EOT >)eoProportionalSelect< EOT > [private]
eoProportionalSelect(const eoPop< EOT > &pop=eoPop< EOT >())eoProportionalSelect< EOT > [inline]
FitVec typedef (defined in eoProportionalSelect< EOT >)eoProportionalSelect< EOT > [private]
functor_category()eoUF< const eoPop< EOT > &, const EOT & > [inline, static]
operator()(const eoPop< EOT > &_pop)eoProportionalSelect< EOT > [inline, virtual]
setup(const eoPop< EOT > &_pop)eoProportionalSelect< EOT > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, const EOT & > [inline, virtual]

Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_proportional_select.html b/trunk/paradiseo-eo/doc/html/classeo_proportional_select.html new file mode 100644 index 000000000..63c61bbe6 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_proportional_select.html @@ -0,0 +1,62 @@ + + +EO: eoProportionalSelect< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoProportionalSelect< EOT > Class Template Reference

eoProportionalSelect: select an individual proportional to her stored fitness value +More... +

+#include <eoProportionalSelect.h> +

+

Inheritance diagram for eoProportionalSelect< EOT >: +

+ +eoSelectOne< EOT > +eoUF< const eoPop< EOT > &, const EOT & > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoProportionalSelect (const eoPop< EOT > &pop=eoPop< EOT >())
 Sanity check.
+void setup (const eoPop< EOT > &_pop)
 virtual function to setup some population stats (for instance eoProportional can benefit greatly from this)
+const EOT & operator() (const eoPop< EOT > &_pop)
 do the selection,

Private Types

+typedef std::vector< typename
+EOT::Fitness > 		FitVec

Private Attributes

+FitVec cumulative
+

Detailed Description

+

template<class EOT>
+ class eoProportionalSelect< EOT >

+ +eoProportionalSelect: select an individual proportional to her stored fitness value +

+Changed the algorithm to make use of a cumulative array of fitness scores, This changes the algorithm from O(n) per call to O(log n) per call. (MK) +

+ +

+Definition at line 45 of file eoProportionalSelect.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_proportional_select.png b/trunk/paradiseo-eo/doc/html/classeo_proportional_select.png new file mode 100644 index 0000000000000000000000000000000000000000..80ea38b3b141e4a53b7b3e0fcc055f684363fafe GIT binary patch literal 1933 zcmb_dX;70{77av6PiPF|2n1Q$ZpVcH0%8ny6B=w#C>E6h~eWd+-S(KX=Dk@^O8Pc;c- z)BKoUKnDwZXy_5kFV7^^;Us$|SCEd!Uf!Zyv7sT7kj;ltF0fkg`70);lrY)wLuE+r z8#N*NpK}IFsK(*86c7K%`t=`0FWFt#R6~J?e9+&Y!}CsWTfJKQPN3x6Gu9%3G`=DwZ^2e?_%qgD;`;C>4v7( zg|bT*hDiyx1t#1qS+2UjhwR%5(+RQ=EmG^Zwd4W?LbN}17VU%|K0wp5>*~v#x3z3# zwhT!6qS{C#i=_OWz*ZBuIJBjB&sxq6W{t`k>EN?YwgtPC5+<8ioe6>Oj~#v{R;59K(IA(K{o_pd^$`msS8Z>)!k)n2kkKIcPM*J(UH@RVe`*W%lVk*`s8^2#Zn z9NldTiEjm)M&mBtAx!GJ-$-2K(xvZG{O(X^GmedM{-MnTT;tTGghbP2dJ@5^&s2lf zW;w!qzqavXe*DWjCyXvmodS65%-C~E&c?T^?R z`O~gXnOi+xGHd_ut_%?ks<)=dI0hLps|8eSP5ECBg zvyuz|;O1uxX-s`xyRA0ByRuw|g<|W7W61d7`(_shBKh>b_QhRzwS8EyMGTXQBQ!WY<|`HLUboqB$+0sHShxA%?D z4ZOJUj*RNi3B8zLK8Yq5iskN;GYWh=2|ma2T_q%E8v-T+`+@k1wt7^@zTpuw#MK&7 z{jvbMz5E zX^EZiB!a_Y)6M@<;*TWzLmhtyu5*HSDU5AZ_WN}0S`O%C*ZqF3q1$}QWC`vETR#Zk z*0tXR>b$~xx7u{2Py#Z#oi_(=9M^YeFs-QOrpNjvJDjTWy%=qD?y`4SW%t9NFhctD z_1@nEuJ6dSYEO@?isSqNXtQ*mtF zhxJIHH?AP_Km@(n_v^cQA6T{IF6@*lgIFrE>kei)KBi);%kPmh5V8%h=tDF89SO-8 zz$fvits_2Z8`~G-^gldSVjFbd=L^QtjsFv8moT#C*AECKO*HjWo&ne-z0XzL0y%WX zhS%dDv43M6xLz&a72j|c7A2KRS%knzb`f)++7%#=Fw<=%260tK1mba4MYDHAIqH!l zn7d;~a}LcbN_U*Bcr;6n7GGr02`yQz8lxtwCkwZ*T@?4SLlb9XIZ-oUFqWs--6=`BoY_V@U#AN~gSMaUkdtbR%jY5s`M^2E_(l`_ uV>>7m$uAxM+#SZ)giWDb^KVQg;?{+e?ndo4U#b31h>MelBlGzA>;D2elj!CE literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_quad2_bin_op-members.html b/trunk/paradiseo-eo/doc/html/classeo_quad2_bin_op-members.html new file mode 100644 index 000000000..4ebdf32c0 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_quad2_bin_op-members.html @@ -0,0 +1,30 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoQuad2BinOp< EOT > Member List

This is the complete list of members for eoQuad2BinOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const (defined in eoBinOp< EOT >)eoBinOp< EOT > [inline, virtual]
eoBinOp()eoBinOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
eoQuad2BinOp(eoQuadOp< EOT > &_quadOp)eoQuad2BinOp< EOT > [inline]
functor_category()eoBF< EOT &, const EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
operator()(EOT &_eo1, const EOT &_eo2)eoQuad2BinOp< EOT > [inline, virtual]
quadOp (defined in eoQuad2BinOp< EOT >)eoQuad2BinOp< EOT > [private]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoBF()eoBF< EOT &, const EOT &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]

Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_quad2_bin_op.html b/trunk/paradiseo-eo/doc/html/classeo_quad2_bin_op.html new file mode 100644 index 000000000..6e12c7b76 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_quad2_bin_op.html @@ -0,0 +1,93 @@ + + +EO: eoQuad2BinOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoQuad2BinOp< EOT > Class Template Reference

Turning an eoQuadOp into an eoBinOp: simply don't touch the second arg! +More... +

+#include <eoOp.h> +

+

Inheritance diagram for eoQuad2BinOp< EOT >: +

+ +eoBinOp< EOT > +eoOp< EOT > +eoBF< EOT &, const EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + +

Public Member Functions

 eoQuad2BinOp (eoQuadOp< EOT > &_quadOp)
 Ctor.
+bool operator() (EOT &_eo1, const EOT &_eo2)
 Operator() simply calls embedded quadOp operator() with dummy second arg.

Private Attributes

+eoQuadOp< EOT > & quadOp
+

Detailed Description

+

template<class EOT>
+ class eoQuad2BinOp< EOT >

+ +Turning an eoQuadOp into an eoBinOp: simply don't touch the second arg! +

+ +

+Definition at line 143 of file eoOp.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
eoQuad2BinOp< EOT >::eoQuad2BinOp ( eoQuadOp< EOT > &  _quadOp  )  [inline]
+
+ + + + + +
+   + + +

+Ctor. +

+

Parameters:
+ + +
_quadOp the eoQuadOp to be transformed
+
+ +

+Definition at line 149 of file eoOp.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_quad2_bin_op.png b/trunk/paradiseo-eo/doc/html/classeo_quad2_bin_op.png new file mode 100644 index 0000000000000000000000000000000000000000..e578cf5fc75a0a558fb4460591e9053dc579f460 GIT binary patch literal 1949 zcmb7_c~p~E8pb~sp%NTR8N#B%VG99cC{RU|MH#jP2q7Ry2@SMiPr~pi``QJpWf77< z1_+51fmW6b35H@2QYh*dLlLOWSwt0}%RES_yF^Uu0)R>07|puH@7);l;tN}%%tz>!eTj%mr@<8ziNWw$qZ?f$w-WJksf|RM zN4C_JFbh`lUS1|I6J!^vS@X7urOO2C@hG=9cakk^6Q418OT${7N(ux>(`Ea95(yi#m6?UP)|tSc8~la_ zfK@vMDMax~*L8IMut!`J@{m|Z53ByqJ^8~*#7}F^1Hs|{zjTGU^F#6%nW>w+VShI^ zqC?0t-a2#QtBP*RU$*hKZw`$sVXx2_JGAQOXA>`Ti=IV8!_CNpnQ2|I>jrxcFm76OC4&pWilr*!8+Pk zsIze8g{|-Q%YDGPm;920Tx$w=vWjEfd_F7jYf%}w?EEDNPv9r$N~_dYGa4{0a-_l#Vk-M=VJbLNb2UfmRZfx#Vn2!5$!waD6?o~bQP3^ zU~F!2mkc>kppo}oj`iO^_X4>`bd6y@-6eC8!+GzwKtqjAR}i;mm!maLTD(T7tqVCC z#+aISl|jq%J%gds_9FaC$M7`g&>mTJbFy|d*J87>iRjXOJzCeMdk*ZBwJ&W5Nsp)z z0bu^X_moZprsich)ZqF$&u{4A9`0Dl5qV}VdMe{SC4s661mZSjG7F(WEg2wDj;>`R z^_55)z}r;4UHA4q;q@#`1Zmb41^OiAXmQ{9oyflc^%m3L#hr>_qld*C0pooW-z>yy z8SVXZ&B0Q~_J7aOqrmARI~H6EDkE7o*yMRS zyG@56gq5s-f*ZMT`g*x07H8(|OS>Vx*AhDV0-3F7=i03$IXIgW#9c=P0%D>Ufv=vso3xyuDQN#WPV zez!k7Q<%6i3z#?u%Pn8@9(gTyV>EK<(}Tg(=0RsItcO_FSy7h%%Y-+j_8-ptMclHx zYPeVz)>-tGN02|#B4FsYmBtL&${@tOhVA2S+K6N_zKtR46t z3U4+gkT;7RRLuQ8fF7+!eVAx}cyz)bLn@Qma}P;&3y+w_*Q2gk#{HfbUQrFY z2cpkC%U)ulDEebl4b5e!e#TiXbOEi(HpOGb6%_aynS0W=!_EngI*cJ8N}K}q2^1-m zk35G#nUqaVC7>CmkTASS(ue3DEk~)<0fRG7;e?|ss6EiuF0J3$gx~7jg|MJUh7uUH zV|(J|`B{_mA6sb``5b icwGJKOk8Db8R-SX8))_)exvwH0gOA&t;IF`vtI!ZI)dK- literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_quad_clone_op-members.html b/trunk/paradiseo-eo/doc/html/classeo_quad_clone_op-members.html new file mode 100644 index 000000000..b3258caa2 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_quad_clone_op-members.html @@ -0,0 +1,29 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoQuadCloneOp< EOT > Member List

This is the complete list of members for eoQuadCloneOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const (defined in eoQuadCloneOp< EOT >)eoQuadCloneOp< EOT > [inline, virtual]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
eoQuadCloneOp()eoQuadCloneOp< EOT > [inline]
eoQuadOp()eoQuadOp< EOT > [inline]
functor_category()eoBF< EOT &, EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
operator()(EOT &, EOT &)eoQuadCloneOp< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoBF()eoBF< EOT &, EOT &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]

Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_quad_clone_op.html b/trunk/paradiseo-eo/doc/html/classeo_quad_clone_op.html new file mode 100644 index 000000000..259d71502 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_quad_clone_op.html @@ -0,0 +1,51 @@ + + +EO: eoQuadCloneOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoQuadCloneOp< EOT > Class Template Reference

Quad clone: two operands, both could be modified - but are not! +More... +

+#include <eoCloneOps.h> +

+

Inheritance diagram for eoQuadCloneOp< EOT >: +

+ +eoQuadOp< EOT > +eoOp< EOT > +eoBF< EOT &, EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoQuadCloneOp ()
 Ctor.
+virtual std::string className () const
+virtual bool operator() (EOT &, EOT &)
 The pure virtual function that needs to be implemented by the subclass.
+

Detailed Description

+

template<class EOT>
+ class eoQuadCloneOp< EOT >

+ +Quad clone: two operands, both could be modified - but are not! +

+ +

+Definition at line 69 of file eoCloneOps.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:53 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_quad_clone_op.png b/trunk/paradiseo-eo/doc/html/classeo_quad_clone_op.png new file mode 100644 index 0000000000000000000000000000000000000000..635b8fda70fa229d8350b067ab2f16fc3c5b4e2b GIT binary patch literal 1699 zcmbW2X;ji_6voLG%fzN_G{vYq&XnbLgm5PvmuRs@QOkW9mqc;&?;4YiR+?iT8<$W) z93v|=aMHk#T*Bp;f>0`AX}BbeySadd#87i)`Y>naL+8BjbARvsa6i1yJ@;mvcX0-* zX{&)iATa8rgDVK65~JjnO&gV3Ty=O+8MMxyK|3lG3MDEOEoEf^x0LkhwzRb1ScD#>~HRjEQrg{CeDvu$Gop41HN8@p~r=ZoK(c zb>wJA76oUZeRJkeud2;~@GxJako7gsUz(#`RIfg=_9 znU^CCO$Oe~%h%cH+F=*Tj??5uh7>yYzqM|R&UlGdc+@g?lNrYg(#uPbC zvL81!#0$bD#p(z4Og2o0y9{!AgmHAZZC|vs=>@Tt{9;%g8D%2g-^S-#hR-(PggxL8 za%`oIZ4OlOVY6VE=vwIzZNvuXdrb$nn0@aVWJJW6h}o9ATVb~)6hS`!)oV5}HBZh4 z$L850OvO&swPd)z9lf{?z(In#MXaRKWlEs1TEZr})d!a`Z4hEC6MVFt?ej~5f( z%TZs+Cc`h`XMjm-%?5u2+|z_>SnM`_Bv%Gq@~O?B$Jl#gG)u*Kw3T~Le=BdVp`?)9 zyzmbx5^L}JEvp;g#OTPzOxg;mCoEBVo8#?~QsNV(>FbT;z6!f>J+XbBhmAy*GZNOf z{(c=UtgdNYW2gCI&BSK)ntz!BlXgLx;RPeku!gwRUEvxN1AUODO(h%G*5nlPpSHnN zTlcD57o88+__t(mk#|m(HA9>%(^`Y>?lwR6g#c?1C?M-n9Tt8ew@=|ApVndZLbORD z-U2K${nEWuRxLjZIQc7uN_sIi(2*NOdi{JC40h& z?g2>-bP2=XJIA`oB++n9&xXdU!iVEc;j@YjG%r3oe(wF$W&l;h<^?gksAGQM=4{5p zAJZDAm#tU8dI=n#r)|iH3u^f}T@{iGJM_^S7n0m7*bEgzBS+7(!KC*XzoMljqMt@@ zJLxf>Y6hI1lE9=7%!BIGp0k~%Ur+Jb;D$WgdPr#JxH~QsYd1{2GDqi$`5E09zHG=) zmy#XW;U3W_C%h+e+d}YM;Q5#&wFf|H>29RZQv0nn`3BOIxkvO41RCn^U3e>NZ%|0^-6z z0&BG0#68pa8CtjLXXs${g=?+&6Tso-TAJ%8GPyUkpkGwgiVvvL@K3L_{At^NCJy*S zw<#UhQZ;hbQ|FZPAZq_3=qQ&};|g7^(dM4SfY1H&27&K4dodAmuF4cYFu_woPc-%+ zau+o;apgc<@?icFL8qoWcc4G9{0%B_Fn@|YjD;HDVpD)%`A%J@>C7$?Q8+~Y&>8$V z<<1NWEP8sdd9RqUSo^IQp~>e57I?WQMDiRPsw+m zWVAlx5L$jVekUx`^_?T^IuFu$j+1(%VQb0NQMELC;4m!n3&oYjP!7LB+ZB85N1dOm zh!OYEizAlDItJG7*2!~x&1MhQXmWcAm|Ea5zhvg_k~|0bAbC8Ci=pm&pEvKHvpdwP zcSXBTpgWmTXzdGZTO>L$i{1ZLld_!re z_@%AXVK|v%p=x)_j4TrQ5QHA%y&>dy-;YUsk5l=}HJ8emXJkYA2+xqR?R0JB_gOU4 zzajU}az%_Eq9_1qJ7(JCln(QO#%oWUSjc4%FoIMRpTC+y7183i-`HGI_tE; + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoQuadDistance< EOT > Member List

This is the complete list of members for eoQuadDistance< EOT >, including all inherited members.

+ + + + +
functor_category()eoBF< const EOT &, const EOT &, double > [inline, static]
operator()(const EOT &_v1, const EOT &_v2)eoQuadDistance< EOT > [inline, virtual]
~eoBF()eoBF< const EOT &, const EOT &, double > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_quad_distance.html b/trunk/paradiseo-eo/doc/html/classeo_quad_distance.html new file mode 100644 index 000000000..aa29776d6 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_quad_distance.html @@ -0,0 +1,43 @@ + + +EO: eoQuadDistance< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoQuadDistance< EOT > Class Template Reference

This is a generic class for Euclidain distance (L2 norm) computation: assumes the 2 things are std::vectors of something that is double-castable. +More... +

+#include <eoDistance.h> +

+

Inheritance diagram for eoQuadDistance< EOT >: +

+ +eoDistance< EOT > +eoBF< const EOT &, const EOT &, double > +eoFunctorBase + +List of all members. + + + + + +

Public Member Functions

+double operator() (const EOT &_v1, const EOT &_v2)
 The pure virtual function that needs to be implemented by the subclass.
+

Detailed Description

+

template<class EOT>
+ class eoQuadDistance< EOT >

+ +This is a generic class for Euclidain distance (L2 norm) computation: assumes the 2 things are std::vectors of something that is double-castable. +

+ +

+Definition at line 44 of file eoDistance.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_quad_distance.png b/trunk/paradiseo-eo/doc/html/classeo_quad_distance.png new file mode 100644 index 0000000000000000000000000000000000000000..caf93c646fd8d6a7583e7da26fa2cae61becb98b GIT binary patch literal 1941 zcmb`IX;hO}8por-A`Uvt0Hs(c!mxGYiWFdzEi-ur+4=iYOk`#isM zZ%F{gYv+#LJ76%_P9JagKp1Rmty=eKz}0g|qmZaxz6kIS_E4!*YN=B7(P-aQsMW{O z*VjiLP`y@%TZn;}Aef8zMH~#KY2)Mmb#OLCPVq^fL+N-7HEw5U;o3e^ZZ#Gd42+QJ z#Ek*%)Cz6C$U>hDY%Dknv!dy0*_%t=sNkt-#qiX%l=b&N&*7V8jCcsWr=#Q?aOtV# zU(3*4wcnHzg*IEhKVHe1_H1RY2FPnk7Y+D`FI$vE>PDe}KQVjkT)@hebZp}gtET0h zcqmo}^hrRg zuOP7gH4ZuV)8Ori3b)SVcR71+1qb|%9?NKR#9KB|(vJ21eEx1a*5ZbO2RVMhAP(x? zNWuq=<$IHwRDpMtJ|Lz(vkK>Hyn^Z-ki=y-(nf!b<_a$@(cU^ALc|o0kOgVvqJ^up z!Ogn4XZDh~SlcJWN(QCi{yokS?%@2yo|LDt`m{R+VyE?k~I+Qywz#g?1ydJO^Zh5;%#jJWlsK0h%6?kO5?8j({q)RwRL4 zwocWBc!IceODpI=7^y^O3;6B!SY$P|c;dDJI8jRvd=?H?HPBQ(Yrp5M%>0FbykCiL-zqz z2>ELWGdl%vOIZ^+37}6nMJnS{vf^_WWY}pwRoZz3m!T*eE0}o@glzB-v`!Lhj_lWv zw@MxK$HS3BHL|#{p7V_~=FRiM(Nq?tE(Ky+U%$vFJ$^zAbrO{gmOStGeb`gl5W%Hg z>qJbfuAk{{;ADA;WST2=K;*XnuJmR2^xKUk0{l^XiG(Vmo-P6|Jy;Y`ySMT*mfq!@ z!vuJp0qRrrUDYi8&mR4s=F&K@M);?BUIXx{f9ihcj6*7J2CH4^)h)w#moFUzWShDt zCaD!)y;%k_iZn!|flO~-r;3=wvuz6kHxSv#UYq~m%(N@r>F{t8$|o{=Yd9|wEtf+| z4md%0tD9b#bwWs|5-l>dCjBG*k+1HpA^%eW5-DCx_iDGmN_n=Go<~`^bX z<_E|gmF!TGYqa3O*Wuhjh5De6x6~@H8)7(^I*my2n|pr;A9e5@SlhKos3d0TJocmh~lAG z4n-htyFY|*=9}Qhut&vjIsnb;*c)BFuV#B*$fJmWz%9yzr&}21FWENy6XL13^qIwM z1%6#_%F|X2&Sj4^_uz2(WM=OL&VIWW%Qq@@3-@rRI1b3(7DWdjXXLmYo{wkm1#VlA z{bN8^jhdO7O*FOPo?*uL=fj7&cR8b|{g;uLX5)PB3g0C%vP9E U9}*0z|4^8Z2gaT5`rX-I0FtQ7D*ylh literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_quad_gen_op-members.html b/trunk/paradiseo-eo/doc/html/classeo_quad_gen_op-members.html new file mode 100644 index 000000000..20eeebb46 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_quad_gen_op-members.html @@ -0,0 +1,32 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoQuadGenOp< EOT > Member List

This is the complete list of members for eoQuadGenOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + +
apply(eoPopulator< EOT > &_pop)eoQuadGenOp< EOT > [inline, virtual]
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const (defined in eoQuadGenOp< EOT >)eoQuadGenOp< EOT > [inline, virtual]
eoGenOp()eoGenOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
eoQuadGenOp(eoQuadOp< EOT > &_op) (defined in eoQuadGenOp< EOT >)eoQuadGenOp< EOT > [inline]
functor_category()eoUF< eoPopulator< EOT > &, void > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
max_production(void)eoQuadGenOp< EOT > [inline, virtual]
op (defined in eoQuadGenOp< EOT >)eoQuadGenOp< EOT > [private]
operator()(eoPopulator< EOT > &_pop)eoGenOp< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]
~eoUF()eoUF< eoPopulator< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_quad_gen_op.html b/trunk/paradiseo-eo/doc/html/classeo_quad_gen_op.html new file mode 100644 index 000000000..44f74a78b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_quad_gen_op.html @@ -0,0 +1,58 @@ + + +EO: eoQuadGenOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoQuadGenOp< EOT > Class Template Reference

Wrapper for quadop: easy as pie. +More... +

+#include <eoGenOp.h> +

+

Inheritance diagram for eoQuadGenOp< EOT >: +

+ +eoGenOp< EOT > +eoOp< EOT > +eoUF< eoPopulator< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + +

Public Member Functions

+ eoQuadGenOp (eoQuadOp< EOT > &_op)
+unsigned max_production (void)
 Max production is used to reserve space for all elements that are used by the operator, not setting it properly can result in a crash.
+void apply (eoPopulator< EOT > &_pop)
 the function that will do the work
+virtual std::string className () const

Private Attributes

+eoQuadOp< EOT > & op
+

Detailed Description

+

template<class EOT>
+ class eoQuadGenOp< EOT >

+ +Wrapper for quadop: easy as pie. +

+ +

+Definition at line 157 of file eoGenOp.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_quad_gen_op.png b/trunk/paradiseo-eo/doc/html/classeo_quad_gen_op.png new file mode 100644 index 0000000000000000000000000000000000000000..5380ae6cbfd74fa1b490941e47f4938574c02622 GIT binary patch literal 1961 zcma)-dsLH07QnHxLO~L-9*ZDGnh;Qn5xYcUc+0aGpghalEs0qnf-De0-U0?#0t7J; z1yVo^&qO{RB7p!aWy8a`2oll=)Dno259Fain;?yza<<#Ed(QqbGxwf*XYS0M-`vUb z@^I17($`W`Q`2#Cb@WzK`$VXc`_y-;dTY=duNw5c&iXoSZEdN#B~ht6;=Mh5)a(|f&a0_u*t$8|`zDqzmD`v6Y`MoNHr}zBh7J>_X6BV?w>0zw zgrt92i*WC#>dWPje(5c&F8H!Q$^W_pa-HR4mbS^#>P6P%$5{wj;WfxKg~giyoELh} z@Gb|DovA_YE>V^_nj1C#LV>?c;xgr|o63Hlt|6q}<+uvv;0$fLf8C|NICQ4{!bG%m zk{0?c*PMkqzr@;Si7r0<8HNHMo0 z6S&?2kMlE?b8-1}WEqI3tj;)XbuS?wM=G4iu+$hl*X3P}o-xq#e9T!icoFiquR6yP zg@e@Ov{)rr_o_Ex56HUyL5ZQnu1v_Xv*d=ak@)5_ zE+2vsQ+da^z4Eb3NG>DZ(8$I3jmQBi09xH zfBr5+|H!NzbeJ4NSmmUIlU)%=M41&oRX-1S*p1USU(#FGeh=hc$0H|nq#xlb4LD%q9g#!fXfIV zW|c7%txecjMLJxnlMQ4}lurNhbI#u0yVrzfpw~BKV_p#I9K~Jsr*7@xU2CZqdamk( z&o&3F95*%ir|>@SD}}$Fn&0;%L`s(WM@}^Vz0@{53y)=soo)1L7&RRZ`(3DQyQ#r{ zPRap-!`s5vih@f9M;2u(F)|c>UoJS=X!;f>vfOt58V_~C8qFDG>j_OIi7q@YklM>g zfY$hJ+1`!@KAl88l|T*sT>@<*?ej>%ZIadq(%^=JEssffrNj1bDXE|bHId^EHv?_Ogu`^+FoIro*pa zYppN%R=9LDO-AEq^J$X+BQ0gQ&7qj|gs&_95d5`gr0Se_gU<+*q`9Ni-Dx+>N4^c_ z&#=4N!PsYcU_01Av)+GUpvj*$atKYcrUR7uif1VC(IOJ&RIl=+3LMQ7L{vox?g(}s zY|^Lk^?*CgSR&%!w=5O4~IhjGQMF-j~uu*nc>jT`uE5ISL|8ax-R`8 z5xo%=tNcuo8Su8H-A7K}3BZyy2{B2vRAuPCA@=SqxYqV9`liSGE%*Rxhod1Q$Z$;_DPC%ERj6pk_jgbRd+YEc5iz9&bnG7ciZ8!0fyVZFU8Y%_{H`I4 zpaJoNuX}=P#}ee;RIo!8wMt;Z55kR_Dt4GEj8qK&E{&>3x8i-x78-VEr%HSw1K;#} zp$k!I^9MBu@aG1I?Fzh|c9qlrk(S?{^9RqgY(ZUhd*Q~D_At9l_ETRM;memnxPgY#kGr80IUrsGTEvMD&w$J%c#zBp|i+E`!69v}asqPhXtJD9M>-pb8ZT&DV0)!dvs9N7-%uKo&S Cfyki% literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_quad_op-members.html b/trunk/paradiseo-eo/doc/html/classeo_quad_op-members.html new file mode 100644 index 000000000..199dca412 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_quad_op-members.html @@ -0,0 +1,29 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoQuadOp< EOType > Member List

This is the complete list of members for eoQuadOp< EOType >, including all inherited members.

+ + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< EOType >)eoOp< EOType >
className() const (defined in eoQuadOp< EOType >)eoQuadOp< EOType > [inline, virtual]
eoOp(OpType _type)eoOp< EOType > [inline]
eoOp(const eoOp &_eop)eoOp< EOType > [inline]
eoQuadOp()eoQuadOp< EOType > [inline]
functor_category()eoBF< EOType &, EOType &, bool > [inline, static]
general enum value (defined in eoOp< EOType >)eoOp< EOType >
getType() const eoOp< EOType > [inline]
operator()(EOType &, EOType &)=0eoBF< EOType &, EOType &, bool > [pure virtual]
OpType enum name (defined in eoOp< EOType >)eoOp< EOType >
quadratic enum value (defined in eoOp< EOType >)eoOp< EOType >
unary enum value (defined in eoOp< EOType >)eoOp< EOType >
~eoBF()eoBF< EOType &, EOType &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOType > [inline, virtual]

Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_quad_op.html b/trunk/paradiseo-eo/doc/html/classeo_quad_op.html new file mode 100644 index 000000000..c42eb9a96 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_quad_op.html @@ -0,0 +1,48 @@ + + +EO: eoQuadOp< EOType > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoQuadOp< EOType > Class Template Reference

Quad genetic operator: subclasses eoOp, and defines basically the operator() with two operands, both can be modified. +More... +

+#include <eoOp.h> +

+

Inheritance diagram for eoQuadOp< EOType >: +

+ +eoOp< EOType > +eoBF< EOType &, EOType &, bool > +eoFunctorBase + +List of all members. + + + + + + + +

Public Member Functions

+ eoQuadOp ()
 Ctor.
+virtual std::string className () const
+

Detailed Description

+

template<class EOType>
+ class eoQuadOp< EOType >

+ +Quad genetic operator: subclasses eoOp, and defines basically the operator() with two operands, both can be modified. +

+When defining your own, make sure that you return a boolean value indicating that you have changed the content. +

+ +

+Definition at line 132 of file eoOp.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_quad_op.png b/trunk/paradiseo-eo/doc/html/classeo_quad_op.png new file mode 100644 index 0000000000000000000000000000000000000000..8ad11704fa22043059e6a81690d69c6a76fd222e GIT binary patch literal 1759 zcmaKtdpy&77{@1$UWM*Lj!3#tDMcOaY;s8yKdg(&aoHwX+t0$xWt5bf5n;N`rO>35 z7W=K!vN^^IO)4?_h1@SSlG9RRXLSy*{yF{ee7~RP`+Z)|>-+jX@7MDrc>=q1<}RCy zKp=EnU7Roo#4MRg(>2sp>pBCkSE^0l({0~QrBbPqN@ZnUUcd#F`fin#m9#2lkIGe} zV1T`d9evUu1VS^y)yaNeRJJ@vLM`}hfwN>avG9EJCi12+hq5}qb$-I<9yf zy^MR1j1_4r1`IO&LneJcQrC;CWPZdLOuM3d>S(WXv)Z=bqv7H7jy@fj$Tf(>w^&$< zHTE8>EjVWMN3zs2OO}XU=yxTU(OQ6k+z%)uH3SVcwO@aR4{Q1hWWTH)%`Q^P0j40(afqelyC&8=tAS-dnHn zDl`fKKICNk?OCpkS{0G@(nuQfE{dTv1mWH{i$>@0iP;sq_rhp+Vx%mtEnGHLvahzY zw_*wnqy8;;_0}~wR^~;BcJjvcs>e-(EbU>R|&o^8Y?W7N3mMbZ1Z=a z{-ogBKixOP1eSyH{U;nLOi^g4xoC5lKx-;{$gORXHk z;4)b*FQ=yl`!a!_C?_x`E)xQC|01#&^oxhxb*$azmG`}aAD_FSt{0wRex{_Gzr=7` zSVw9R+3uVqe9_f$HfG|kZ4w4f)PFYrwhL0iE3O*Lc1owdv3141p^Q(JOiXcmhVM90`LJiK3zU6KS|1Z~}QjnAJ5?? zLWuTMGhDnRzJqy6#n*pW*u0+R!lqOGeO|)KX;w744CYv|e@@c>frox**%IkMHb1Fm z$1`2{1N1+mOyE?i%$PdUzFlyI6N&i6aRebS_yNk#`Ep$ICbXu_QV$DZ&2d`T3W%p& zqvhPsmw8LOhSxZgXqw*KhGC29wmWI(LMdTl?6tU*&NMyr107MaAYPivI^XVJE;pY4 z9O4`14^}~Q4aLEwCQx@!qTFn9q4+e=ayMDF8om^f45nf5ANr9=GFj^8dfD>HrK7RY zUOXvVk|19Znc=JIH+JH5D9Qy~?EluxG0G_pNlD2k7unVx^Z7!RwDg$~XNShLWd~9s zLj*bfX4V~mu4Q-z<5TG>4{e=D#RkYf6gSXplPWz?!@1tsEU5X`5N7`7!%Ohfq=P86 deS7M-ddf8d)0)+lrkX|w*PVdVU59{#e*nTHd+Y!J literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_random_reduce-members.html b/trunk/paradiseo-eo/doc/html/classeo_random_reduce-members.html new file mode 100644 index 000000000..d8697a4e0 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_random_reduce-members.html @@ -0,0 +1,18 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRandomReduce< EOT > Member List

This is the complete list of members for eoRandomReduce< EOT >, including all inherited members.

+ + + + +
functor_category()eoBF< eoPop< EOT > &, unsigned, void > [inline, static]
operator()(eoPop< EOT > &_newgen, unsigned _newsize)eoRandomReduce< EOT > [inline, private, virtual]
~eoBF()eoBF< eoPop< EOT > &, unsigned, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_random_reduce.html b/trunk/paradiseo-eo/doc/html/classeo_random_reduce.html new file mode 100644 index 000000000..1cd4dd49b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_random_reduce.html @@ -0,0 +1,43 @@ + + +EO: eoRandomReduce< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRandomReduce< EOT > Class Template Reference

random truncation +More... +

+#include <eoReduce.h> +

+

Inheritance diagram for eoRandomReduce< EOT >: +

+ +eoReduce< EOT > +eoBF< eoPop< EOT > &, unsigned, void > +eoFunctorBase + +List of all members. + + + + + +

Private Member Functions

+void operator() (eoPop< EOT > &_newgen, unsigned _newsize)
 The pure virtual function that needs to be implemented by the subclass.
+

Detailed Description

+

template<class EOT>
+ class eoRandomReduce< EOT >

+ +random truncation +

+ +

+Definition at line 64 of file eoReduce.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_random_reduce.png b/trunk/paradiseo-eo/doc/html/classeo_random_reduce.png new file mode 100644 index 0000000000000000000000000000000000000000..a369dc369411bb38d2ee61550bfb5c53b71178a2 GIT binary patch literal 1898 zcma)7c{tnI8qUQey(SU2RT6P0HA>YaTDweD1+}zxMJ%nYNG(xoEupvlq11$;3%Ar( z6;;G&EK$T#Eu!>l)g;mCSVs_h(+ciy`rO_-_jzWXXZ|?v`QG!K^PO|P?>*niaImvP zNGnQ1AP|JLmAMlHB5@V8*;0}q`n|-G!4BnMbLQmk?k;HV?y`%EeQto(=f-BU6T5b& zK>C+xCp%||$;?V5?#f~0-6-5 znVPXTJJGK{;E?w1q5C(NF6LzKA_uz<$P7+)?6AfDh}g+1XtHby)R8Qk3U!P96enwvEl>7yyUQPg9}1r)!;F82i={(S|j zwn1p}uDHw;7ULA7H68kp09>G=%=Xrxm25Nxr86033f_+JmAMJzqVF(yt zfi_^Fd>csmsbpNm^L`l)!4hLmLCs{cbO2{+4p9F#rPSZx{Omb{^cf!(^3>&~A~gRJ z)=SGUx^G7AZE`y@Z7_@r%kx-}Uy=RL?bwr7F)QzzBV-}fn50J6n^{(FnTy8isr)8+ zo=a#$*&5WgP3i2Fb*5qRi*#ljCnQ2-gj(%KZpN!Ua4{<4nZv>_4ta>bej+yLJ4NSU z>`BQ77p_|-i3_0{yuKal`az8UtQiZpIxlrdPn3ofp<_R`Yt0uzky41V;RDjYLjN*- zJ1MY0hstZw2^Q{K%6@qKiuS`zsYXZUA%`hJ>n2>EAd*8GAMft06m8c8+xun$_A3)3 zI!Z~`zf7}ueUGgVl72dO-xx?t&@PD*JdmiD2iyB#KoW3f@vosEDft0(9|n?}pnC@G zw|o892^EWV;k`Vv1}>|-_8;YbmhbNYg}iLP*ullEhKC&wU#{FNmQg4r$|;(E1_F~f zqG|GCYZ#ZX$LdnRk1eJIw1&bP^?^6p9Kh|3ZZU7dV*t{^W%R~YTR)?0D3X-g^NDv| zq5$XNbBD1`j+@FEqj2sysYV*@vBGGpnnBx*75e%$&48ngK6}3HF;Wk^ridMaf11X) z)?+osFFWU9aylGBp4Dxj2u;NIo|WnG3}jMrLKE@m@7CpOecla=~pO~I+jpl@QOhf87oZtwrDnE~> z;L-NodOM*SvU2Rn%hy34a~Sw<&Q6a)XU)Li1^QQbVhUAG{BroxS)k*q|B2%;e00aO z;W-+<#6fgKyhAIRw~VV=wVDA3yx%>eFruhr*|b|yU}^ci-2ADr=``p^g?x4KcRpXT z2BxlO;#E>$d_@@puecDSX4?J zc(i51H6?xu{8|UV)=mvz3Ry!3!;HM{Nc-}tZ3v=*E`cI^Jm`Ev6B9I2P3%&cBofbsWQgl?o+(MqiS(!=JkQAH@{xFe)_1>Bk1o`wwXadR&l@7r zQV@C+w#v->$hK~i0o?^nu-{q>U6)K8F-mzoldYe8qk$WjSk+nlXzH|L^p?+jA4_-3 zYj47sCC&Lkb_GEsnfgYX{yN?=Ax9I=t@zFfFg3g~;397C3PG>OZ`kPIwaAx$R9erB z^IdKv81i6wwnr4#OY^Uf80WwGd20!9$5Z(Fv%&QSb0PJ$xOluwF)Z9WGsNWog9^sD j@+j$pfP>gH5GhQz22c6!$I`%$5n_GP&b-#t=jy)!=eBmi literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_random_select-members.html b/trunk/paradiseo-eo/doc/html/classeo_random_select-members.html new file mode 100644 index 000000000..c6268baf2 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_random_select-members.html @@ -0,0 +1,19 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRandomSelect< EOT > Member List

This is the complete list of members for eoRandomSelect< EOT >, including all inherited members.

+ + + + + +
functor_category()eoUF< const eoPop< EOT > &, const EOT & > [inline, static]
operator()(const eoPop< EOT > &_pop)eoRandomSelect< EOT > [inline, virtual]
setup(const eoPop< EOT > &_pop)eoSelectOne< EOT > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, const EOT & > [inline, virtual]

Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_random_select.html b/trunk/paradiseo-eo/doc/html/classeo_random_select.html new file mode 100644 index 000000000..c2e7f9df7 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_random_select.html @@ -0,0 +1,43 @@ + + +EO: eoRandomSelect< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRandomSelect< EOT > Class Template Reference

eoRandomSelect: a selection method that selects ONE individual randomly +More... +

+#include <eoRandomSelect.h> +

+

Inheritance diagram for eoRandomSelect< EOT >: +

+ +eoSelectOne< EOT > +eoUF< const eoPop< EOT > &, const EOT & > +eoFunctorBase + +List of all members. + + + + + +

Public Member Functions

+virtual const EOT & operator() (const eoPop< EOT > &_pop)
 not a big deal!!!
+

Detailed Description

+

template<class EOT>
+ class eoRandomSelect< EOT >

+ +eoRandomSelect: a selection method that selects ONE individual randomly +

+ +

+Definition at line 44 of file eoRandomSelect.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_random_select.png b/trunk/paradiseo-eo/doc/html/classeo_random_select.png new file mode 100644 index 0000000000000000000000000000000000000000..5b1d2b5b9d9c3d540fbf1a76432a4a92a9bce988 GIT binary patch literal 1915 zcmbtVX;hQf7L8IHMKQQQE7mgjP>Ki`AfO;2Py_O0QY=FtVG>daLJ^rhBnT))2nG9? zr!q(oBYXlvBqjzZLWxXPk`H8(074UG2!t?6UevmLYqkI0k9+UFd!2jMxo7Wn?=2?> z8wL3T@-P@o!S>AQ^Dx-f8X0c>LQXcDJlHUnE&HA9E?}insSHY`&A zOsjNKw%u~|yn{0g^Liiv27~XhJ#Bd*s_<=LcSQLKMeFV(q&92P^N_wpt9nlHUeIEu z@`mPvbo-U0%y%Pb4L5c7CwlTz19*De!ygy->ke=JY`UVveCZBXVp)~A?pjKTCm;)_ zxGILqh@XZ5&P;I!!M--6(nkN$0E&7tfPy!UFeYo!XVH}*M&#>LM1#;fzK>ood9rBJ zpkDL#@4&21v*{pKW2Hl_4ggH<^|bti3_@C6GI|eXk$C4 z3n#-x`ps~TuXldgRzHZ>d2Icx;?#)(e&_hi!L7&}{uh4PeG&Z6-4Vc^l^v=j>`@L!qq&^f=2SKjuBMujP!9Gnb4>QNmR&r?f<9;9`T-!1xMuoS754E;EP zVj)GFXY>n-eI`&-Tf*+S`u+Rqa}o!9BEASlG#;v-KY+gly^77w(X%-VqEXbAvR!^b zDqvO2a{kz%$FCs+g0pvlGgD8H5_OrGbjtgh>fJdKF{;~T7O=nVvV4n>m~L>jo2;7a z3ss3t2U$@KqJ6o}{P1gUP(dTTb6(YuGHp2?vS;=j3JYdZ-zS+}J*v;_c^r*l6e)rJ zWcyMf4%C`Sb47i^< z#8vaMNUQ5@+H=j)8e2+i1Of!l4Tt99z~UC2nY`-aJfOd8S-8F~&}LpQ9u(wN**p&t z5AQey1ki|7Rr7kTp>z62zBfqR)nEQs1`l&X@yFv!T`s+L=AXjxn@0U@Tt}E64Kv>EoWsZ0{Totn=L%XqO3^usSqhwl zBf)f+8zH+K$8}2XOfx**y((gkRuzul8}W$=N$Hal>SFwchuX*iG;j}8&zue#j2p$*$ep$P`t)l2qWuGptdc$+y_8Q zyPqNDOEd_{P)VD^JHZGW^bTuAyO@Z2J9wBxO zP^byw4BdnR*{p^Sbb=E{*!zTAa%Qc6Ay&9%d8LXmK;$TrP4!?K`roW$p4lE%XskFQPTk)t%pgD{p)>@_5Csd z++10^RI^XK^OeNlxQsz<%geL`6`!nFxNG$3Y#*h+CqGN^Pn!LskpDxnT`37;i5)Wg zeUjZ`F`q;1j5CX9syJ0qlM$YgE@EUOZg&(U;4Wh+<=2uSs;4y&l;rfSUoscv0{S1; z0%9@ebhP%8Zu9laGY79U8QD#Vf6!Yw29|5HYQEN z*o6aVJ#rmw@ZoqfXf{9WuoUAjyj%DzFBK^&}6m24RM@})*O}o7AS)& zWo}3EyM^&oE8aPDn^3y@??!zX&03ofRyN`K^{!~ZiuFGQmtOI(DA%CSs)Sg`~7%j!#3_ z=7kDZuW&@9TJlhodB#rkQ&Ja5W524CaO6R(1pPR-X1&?PS`by$iF;H}m6X8~ytPiG>$@;g}}2f+1@tqrc?$>G1UGN^$wZT;?v wF7r+M8PXGV_ literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_random_split-members.html b/trunk/paradiseo-eo/doc/html/classeo_random_split-members.html new file mode 100644 index 000000000..44611f494 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_random_split-members.html @@ -0,0 +1,21 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRandomSplit< EOT > Member List

This is the complete list of members for eoRandomSplit< EOT >, including all inherited members.

+ + + + + + + +
eoRandomSplit(eoHowMany _howMany, bool _returnEliminated=false)eoRandomSplit< EOT > [inline]
functor_category()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
howMany (defined in eoRandomSplit< EOT >)eoRandomSplit< EOT > [private]
operator()(eoPop< EOT > &_newgen, eoPop< EOT > &_eliminated)eoRandomSplit< EOT > [inline, virtual]
returnEliminated (defined in eoRandomSplit< EOT >)eoRandomSplit< EOT > [private]
~eoBF()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_random_split.html b/trunk/paradiseo-eo/doc/html/classeo_random_split.html new file mode 100644 index 000000000..bedcbd39f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_random_split.html @@ -0,0 +1,54 @@ + + +EO: eoRandomSplit< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRandomSplit< EOT > Class Template Reference

random truncation - batch version +More... +

+#include <eoReduceSplit.h> +

+

Inheritance diagram for eoRandomSplit< EOT >: +

+ +eoReduceSplit< EOT > +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + +

Public Member Functions

+ eoRandomSplit (eoHowMany _howMany, bool _returnEliminated=false)
 Ctor: must provide amount of reduction, and whether or not you need to return the eliminated guys.
+void operator() (eoPop< EOT > &_newgen, eoPop< EOT > &_eliminated)
 do the job

Private Attributes

+eoHowMany howMany
+bool returnEliminated
+

Detailed Description

+

template<class EOT>
+ class eoRandomSplit< EOT >

+ +random truncation - batch version +

+ +

+Definition at line 124 of file eoReduceSplit.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_random_split.png b/trunk/paradiseo-eo/doc/html/classeo_random_split.png new file mode 100644 index 0000000000000000000000000000000000000000..018ba32a79a6433a012214093faa1ed283bdb83b GIT binary patch literal 1851 zcmb7_dr*_d8pfk`I2DE9p(?o`we^Uhf>08{fI$&TX)!oTKm&Q$)I$vSR0E`AL;^xUE{O*f6C>dkO(hLlf#3&(L;~cbm(wz5I-ThsyZh`r`|j-g z_I-B0I)D$cvxVD2AP~FIkAn_EAS*|$y5p@?)?Ty|;ba}04unMnTPzl@;* zP|Y^hnHCj}TjccK)ft#~jOn)kkwYJr%l*zT1-B&G0?lvP!fKbUna=mYJ=l1>lIn>r zVM-Np->Vmak!b21n_RhgMRWW?aroTswPqSSueNvGqwa}^=ODDJPQ7>XlW9WcH?D{s z4`2Q3hLOLi(o^D^+hy>Mp$mJMwW&RxN#Xyjb32H=FTUNF^uZ9U$)!7lpuCfxj_#%*-M3*l)RBUjQ+6sQ;5T&R5(ldgv#$=& zDgNo}qb6I#qTV3{jV9c@n9+cMayvqcT)zdAaxZu4_^SkCaodXhbT9f%rZ%cZYZmFt z8QKa7f2x=d=lSSWrUoL%uO_iyWx9g7W~4ep%>ZaLfQ2CC-qrZ5Y^Cf4DWvbTbH(nk zPfu>Bx7BNuGErNhzU?qV5holqizDZ=8S6EKtYD}@{1jOY1gZtw&7#i-yf}ACZi(=V zo3Hu1^KB#d&y38u#V#2%Wo)^z_51RhRh)WT@X?3KniC+a-7=P!_5uH1WG3!`Y0Xx9 zVX1IB>oT}zk2XFYX$MqQP|?aNLz=^f4GXi~2(PJD6T_?Cu{4h8`mXF2eoyz5Pz5V! zj(@dr{|Hs_q+Jp={!Voa+E7$GDL(b8He+RK*!Ww=FRNDHTb{+FaKA(g4og~LPk{c+IW%5!-TbZaLD4DA?wq#Cw=EikZz1?5!q|H_z!)=PbU znnZR#4RdwgDiW`DAG$t&iJ(0l`2!yz1X3RNpZzL_cq~VMq9U=M?xK|}-IflN^MWoF zMzXFu3G_jN$64?DjKAC<<*Xxyo*lMn*G6W6OX-?8|1%r7J(vHmeMXUa*^ z1U3R5fr_q?F(wJ*=Xt10Y(@D^0w#W;@z8O>DY?lns$a|lRe#`nSOYZWI0SaHf%bK{ z%@?dDe=RGt8vU~7=m2tMCMh0iKUMa7J^Tsg-e8Ms$lU|PH9M=vLey##HVIWUH=c5pnvE%AWZCqP0FH8PhDH{emqRX1n;=gR z=3XeGr28M6?kCp5=30)v7dOVX?P?f(w+;aJadl(T0Sfc^MN99I5^c|Dx0fyitjFX8 zy&(a73KJVJp=?WsJ%EL@PPX)}(9tls4d>U*z@fCho6;uf5$#H?8F!7{(l84q3OjKg zu}x91{+m&XI7uAbaaV(xswX^?Wr{Sn<#cDbaIZGr6mVoYpYZT3hpfQ2t^RpFyBm$R zXDW?yxi9kBE-Tc(LiC&C{(>-_jVFD5G9l?7FRczd_w#G~>wfyA*1=u=qLjDOQL1J~ zKePElo3srGm`T{~)JW)upbT>%ekS&w}a7G#O@rq6!T7J(#}M{{ly z+H*B;$TevaKByru_S}B~W3ILM literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_ranking-members.html b/trunk/paradiseo-eo/doc/html/classeo_ranking-members.html new file mode 100644 index 000000000..295444d80 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_ranking-members.html @@ -0,0 +1,43 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRanking< EOT > Member List

This is the complete list of members for eoRanking< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoPerf2Worth(std::string _description="Worths")eoPerf2Worth< EOT > [inline]
eoRanking(double _p=2.0, double _e=1.0) (defined in eoRanking< EOT >)eoRanking< EOT > [inline]
eoValueParam(void)eoValueParam< std::vector< double > > [inline]
eoValueParam(std::vector< double >_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< std::vector< double > > [inline]
exponent (defined in eoRanking< EOT >)eoRanking< EOT > [private]
functor_category()eoUF< const eoPop< EOT > &, void > [inline, static]
getValue(void) const eoValueParam< std::vector< double > > [inline, virtual]
longName() const eoParam [inline]
lookfor(const EOT *_eo, const eoPop< EOT > &_pop) (defined in eoRanking< EOT >)eoRanking< EOT > [inline]
operator()(const eoPop< EOT > &_pop)eoRanking< EOT > [inline, virtual]
operator()(eoPop< EOT > &_pop) (defined in eoPerf2Worth< EOT >)eoPerf2Worth< EOT > [inline, virtual]
pressure (defined in eoRanking< EOT >)eoRanking< EOT > [private]
repValue (defined in eoValueParam< std::vector< double > >)eoValueParam< std::vector< double > > [protected]
required() const eoParam [inline]
resize(eoPop< EOT > &_pop, unsigned sz) (defined in eoPerf2Worth< EOT >)eoPerf2Worth< EOT > [inline, virtual]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< std::vector< double > > [inline, virtual]
shortName() const eoParam [inline]
sort_pop(eoPop< EOT > &_pop)eoPerf2Worth< EOT > [inline, virtual]
value()eoValueParam< std::vector< double > > [inline]
value() const eoValueParam< std::vector< double > > [inline]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_ranking.html b/trunk/paradiseo-eo/doc/html/classeo_ranking.html new file mode 100644 index 000000000..39c215a59 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_ranking.html @@ -0,0 +1,60 @@ + + +EO: eoRanking< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRanking< EOT > Class Template Reference

An instance of eoPerfFromWorth COmputes the ranked fitness: fitnesses range in [m,M] with m=2-pressure/popSize and M=pressure/popSize. +More... +

+#include <eoRanking.h> +

+

Inheritance diagram for eoRanking< EOT >: +

+ +eoPerf2Worth< EOT > +eoUF< const eoPop< EOT > &, void > +eoValueParam< std::vector< double > > +eoFunctorBase +eoParam + +List of all members. + + + + + + + + + + + + + + +

Public Member Functions

+ eoRanking (double _p=2.0, double _e=1.0)
+int lookfor (const EOT *_eo, const eoPop< EOT > &_pop)
+virtual void operator() (const eoPop< EOT > &_pop)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+double pressure
+double exponent
+

Detailed Description

+

template<class EOT>
+ class eoRanking< EOT >

+ +An instance of eoPerfFromWorth COmputes the ranked fitness: fitnesses range in [m,M] with m=2-pressure/popSize and M=pressure/popSize. +

+in between, the progression depstd::ends on exponent (linear if 1). +

+ +

+Definition at line 38 of file eoRanking.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_ranking.png b/trunk/paradiseo-eo/doc/html/classeo_ranking.png new file mode 100644 index 0000000000000000000000000000000000000000..6bb2a82179cc839047584308c8df56e26100ec07 GIT binary patch literal 2415 zcmcguc~Fx{77w7yp$LdBf)imxK@LMkK*qqboGU0`hH!`wE+G(=aDH zheE=UL<9uFAt0b5L2*d9g98Z47l?p_OF}k`Gqr#0PSw`_u~o0Te_g+Rue;xS{i<&u z9Zt*2sK`Jd5LsIrD@O=KB3y*qc1Vc&R#}q>(Qp81=VUDu3Pn&TY%47Ez9mAxwYIi4 zVu$d9Xet)&=zxNl%?x265b2$^R_0Du3+72ZVN=@stmnasbXmoWpM-5xo+{!I({Smt z*Wx~lR~hf7qyp%~yT@$8f~(WpV3N34y>5GTSh92%T3@UF?}E~`piAXM&ztRu3=exW zOrDi31{^g*OCw!nSlJ7qVE1j;<$RgaF!v%?(5jXrOV>6Y*>`wY)5<7@`_Ljd@t5`I z<*I7;=E`svrXQXzvc6!PM1+0E!Q9PwITz8b9~PM zw6G{w>!onu;`Ii0FMF66ALCm-3@`f;Spsv~tUwHUPU5Q&-)~mqQeM4>OA;%-Qn?tg zwrL(L(MGLwYn^A=j+P9tbIHzVniJ`AC}$Ut=CZon`tSx~5ZnvQEMwt!DWjF_F6V)s zJ~FGOk&eQlG{A^YTq_s!F%qkHg8}OwOj5M;Qp$i!3i~E9BmKNyR>4$!w6TY07w!JBq0)43hxE2(|Ohfa0O z*-z(aPa+9Nbm&~qmQ9%7V$Rutt?VqK(X_k^YZh~-Rp;q*MxA95EwPyaRYBii7#7iX zGz&aL*#p^5BrT+?_%e+|Os#WiVs!4`Q+I-K0oJut| z+cUZ6)&jqmq$XjJ9nxr~lBhlLHNQb!*POB!reu?Vw3a7a|L)&aEXKsberJ*zBtEEp zGbR%%`O5qovrl9<;Txm%O?{hj{C!6e^Y}j-UW&F(ZF1SRJ+(HuCj{OJ{q@Hpn%jRR zyzrP%A=SGh*4RsRmH&9|D)xDU(8|as76^HdSkGJS@Wre9P?X z#>mX9PZZ{kFG{FY-{T3%tXyd<3ZNnBncf;S`vFLwaaqr;@$qo#FQ2nls@TdOvs?o7 zI^X2#ZtAXaFDvI%*7r-Wd8cA40dmJE?wC34hiw`VqZGc+mFpWo70DWIQc(^H(?(a==84_2nXs7O(kgHZd_p@n7Rf!)vIktH+ z^jFS3Uk8+HgN7t)Ki;!aM*_UrKKhm{4osVIux98VkOXa{>l@9=sjYB#aZ@G%u_hH% zV}`Erz-Jb78pizAjl}`#5?|0bSl0N7=}&|J^YK1swpaX_T>C*UGsK`1-CigWDha8R zCqR(9{#URT86w2`$`GOrIwgg13uFnPSNsoIDnl4j@2ib9&%{J@2mU3dMlIo?(6#wI z9Ri+QqA_Al7}__sAj!{vei9|df?8BFu#G!w%151$A7vf~->z7#L0ED^?^Wd6n^Qlo z^DoWO%i8Q>VfVo>{25CQX53kGEWMwHqug^WHrrTl%g$xQUIM0hMYIB6z^5^3oU4xt z(ge%=4`7U#z67MJLu4g4fiW)U7*%i6Ucx>K_JNtd3R-D}d2atef8v%XXlyVnuf`@~ zjfhRUY5o2(AC?jA&uK5DzL+iG{=}gnu~+qynoMKVI-wAjsNR?zRW*qeYfRjFjbOp{S<)*krn$RAfm`PKH{0m?)aQGa`I8wD59$ck4W8F5m zF^W@iLi}b#lW|Zr!zegUr&xajiOP9@V1X5yaNo K!HQ<#9sf_K+o=Em literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_ranking_select-members.html b/trunk/paradiseo-eo/doc/html/classeo_ranking_select-members.html new file mode 100644 index 000000000..c9a558a41 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_ranking_select-members.html @@ -0,0 +1,27 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRankingSelect< EOT > Member List

This is the complete list of members for eoRankingSelect< EOT >, including all inherited members.

+ + + + + + + + + + + + + +
check_sync(unsigned index, const EOT &_eo) (defined in eoSelectFromWorth< EOT, double >)eoSelectFromWorth< EOT, double > [inline, protected]
eoRankingSelect(double _p=2.0, double _e=1.0)eoRankingSelect< EOT > [inline]
eoRouletteWorthSelect(eoPerf2Worth< EOT, double > &_perf2Worth) (defined in eoRouletteWorthSelect< EOT, double >)eoRouletteWorthSelect< EOT, double > [inline]
eoSelectFromWorth(eoPerf2Worth< EOT, double > &_perf2Worth) (defined in eoSelectFromWorth< EOT, double >)eoSelectFromWorth< EOT, double > [inline]
fitness (defined in eoSelectFromWorth< EOT, double >)eoSelectFromWorth< EOT, double > [protected]
functor_category()eoUF< const eoPop< EOT > &, const EOT & > [inline, static]
operator()(const eoPop< EOT > &_pop)eoRouletteWorthSelect< EOT, double > [inline, virtual]
perf2Worth (defined in eoSelectFromWorth< EOT, double >)eoSelectFromWorth< EOT, double > [protected]
ranking (defined in eoRankingSelect< EOT >)eoRankingSelect< EOT > [private]
setup(const eoPop< EOT > &_pop)eoRouletteWorthSelect< EOT, double > [inline, virtual]
worthIterator typedef (defined in eoRouletteWorthSelect< EOT, double >)eoRouletteWorthSelect< EOT, double >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, const EOT & > [inline, virtual]

Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_ranking_select.html b/trunk/paradiseo-eo/doc/html/classeo_ranking_select.html new file mode 100644 index 000000000..8f2684510 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_ranking_select.html @@ -0,0 +1,102 @@ + + +EO: eoRankingSelect< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRankingSelect< EOT > Class Template Reference

eoRankingSelect: select an individual by roulette wheel on its rank is an eoRouletteWorthSelect, i.e. +More... +

+#include <eoRankingSelect.h> +

+

Inheritance diagram for eoRankingSelect< EOT >: +

+ +eoRouletteWorthSelect< EOT, double > +eoSelectFromWorth< EOT, double > +eoSelectOne< EOT > +eoUF< const eoPop< EOT > &, const EOT & > +eoFunctorBase + +List of all members. + + + + + + + + +

Public Member Functions

 eoRankingSelect (double _p=2.0, double _e=1.0)
 Ctor:.

Private Attributes

+eoRanking< EOT > ranking
+

Detailed Description

+

template<class EOT>
+ class eoRankingSelect< EOT >

+ +eoRankingSelect: select an individual by roulette wheel on its rank is an eoRouletteWorthSelect, i.e. +

+a selector using a std::vector of worthes rather than the raw fitness (see eoSelectFromWorth.h) uses an internal eoRanking object which is an eoPerf2Worth<EOT, double> +

+ +

+Definition at line 41 of file eoRankingSelect.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
eoRankingSelect< EOT >::eoRankingSelect ( double  _p = 2.0,
double  _e = 1.0
)  [inline]
+
+ + + + + +
+   + + +

+Ctor:. +

+

Parameters:
+ + + +
_p the selective pressure, should be in [1,2] (2 is the default)
_e exponent (1 == linear)
+
+ +

+Definition at line 48 of file eoRankingSelect.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_ranking_select.png b/trunk/paradiseo-eo/doc/html/classeo_ranking_select.png new file mode 100644 index 0000000000000000000000000000000000000000..2f6d50956ac252076827569ee1039f28d49dc72c GIT binary patch literal 2661 zcmbuBdpK148po%m+!A3^MB4TiUEFF@p`i=9prU4^tkJlKJ!fO4_AsPSQ7R>gA<@lX zxlM&xGrC9ylV*(N7MfhjxW&w1(45h(_TJ}t&hzZ^oIloYz3Y8{>wSLfv%c%Qeish7 zIxSVwQ9>XPOZV*F<%U2kEJ7d_m@h)gGI57TGGwO}2b>Q%NTpI)D3w-cXM10fMPH8U z>gvd6(q7r+f(SQPcZ7X^t3LvvIJ0Nh_Cu#KhcmaI$+cSMkkMG+)n2Ssu{|uO!2dN1 zR!zx|Th{8soo#w1b$NMdLEU)Su?Ie{rIP!ajD;K}Y>aB?7)IFM-Qk^wQ4l7^0v1i{ z6LRS!HB2Yr_t76A`K-uPT$O(Iws$!9JnJ=_{hQ~!o;h|^P2W6zKThQyGdC|QaYSXJ zk}enr9-~g`?}tpCQCk9rX()noVXa?GhnYJV<8DMgfjT)!2D!E(bx88@^0nfCb~WP6 z2g{I}aFucE1fykZSiau6*A{*pfO4HXxIeQdLY$3ib0@c`y)Sp(E3_9|-)g5}LM=r$ z;+*~AHU@OZ^s}2lbt`h^r{myTLN}#i2^eanj-HGhB$f+x_U00A z_?{Q`Me+LEf}<};Di}8=4jVnvk^XH-4_qf`0Ew> z*EYbVjKO9R4L&QNhL9Q~1HdFnJH8q2G>2i_Hgiw7pK#3f*@d7@0Mn5J99EHpnUk^FHH@BF>{~E;$>a8DQ_Na z;@I!Z4IS9K>}!!7*r6TtwP2GQ8ju%DbnIa7Mh;(mM7b*Wy&=(2=lc!!u}hEgL%agG z>=!4N{JEIh80D{WmHT^A!fS<7J8}v^__1uw-=^7)>);f9ZP3(LiJpt`HBqMeDN9-Q z8q9P}HR8*23W~-O4^^&eQLkuwSOPYrQe=^4;F8GBZ!K!0)>ED|&mQ!2ngGZb*$?RL z>@lD78Wy$qEjCvml6#dnzi@}?xuiPX!4_;c)sWd5F8sAi+x>C=keak+uS!_y9;kkUSFpmqGf{ZQEWlR%!$2$3FJVkyv~^(BpwjY`~=v@Gy!UBUY&5ezgi7j@i|q-P~K zZCTY5MMh)aI+FF!^GZ1d=^UZZ&`A={0(l{?0!QZUW2SA)*E3^Omu0T(r?r4%#tQ6H})Y3v3^&jQ`>&|M80cu$h0DoQ7~e%&xNi%j~Hv%%#_* zF~p&Xtnur9J6c>(EP<{*ZW0sgNicW`pk4%PrsYi5)ZA81<5>EGekmFdD(4mJO|jOJ z80`)I^#g%7<6(%_Q$|;DBT?`hSV10!zQdX`KLYMiE#`TFr4eOg>oz*!O$61b5`8|Q zc&gy~NWV*$EjHdn@WBgI!|8Yv5v&cG)BMb-Zt8EaHCw`a0P z=HuUxJ*NU>r60zKc0XUb9=p&re2<(y|=IR&fyHU4}HgseQc!rAcuw?2U+}UhK zd=s2lvzv{>p({rX*M=X@#!%N<`P|B4a~x;AkC@*(KqqRrJ#xcmf21jda^f~5MJV3j zdl_x*HOyRrEO$$(XHnrbH%e21;^n;nFL;?vBrnRS{*_{Yv$ELfr+PPXA)O6242c$( zq)q5F=Ka2WbK~_JY$w3MvZ!Ccp?a}D8;ipLN}aLB+ZNz`KZ)_VPEdcuZ@F;LA0&{; zd`lRvA+3fn(?UtUU;$q7776Q|u3QG6;vc#&V3<~jE%SV{3KhNWU%L1LG~6WEd2>>X z{8P0uDowZGGCM|edYQu%KV5@MQ zf4~K9)!MOV7fvzNN-X!yM$ea8+DuX14LSQQ3~J+>3l6_%xvK4n5w7D~LDm6V@f~VM zo%{p6SXBQ2%@Le#dOuJ|Z~2-N7}x|SpX78>Ka@rQP9b{fIRp!^Ua~I9x_FpS#)!7t zDR2YQ1hFefsikH78WgYjrkin4&;f^#BSucXvZjJhL+qwI@csGmy94|I$#a4vu7%CQ zA3e}VFwp`mDx}>Uu0#+y_4iR$^-DztzETMbl9|kepF~3N_<=1<|1{m ztLiX8&76v;Ojqg1W87uxL8u_}Ho+aZSUa!%bzR{iB!!}GdvdT`SedI8l?Wfga{Dpj z71uR^=S20bsk|@-!%RF580D-fxkiJ7Hf@IO-bRVf_mVG0t7+wjn ybsyZ>`I$MODprc0-LjyNY&rpZPa?Mqy$A literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_real-members.html b/trunk/paradiseo-eo/doc/html/classeo_real-members.html new file mode 100644 index 000000000..49ea84d66 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_real-members.html @@ -0,0 +1,51 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoReal< FitT > Member List

This is the complete list of members for eoReal< FitT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
AtomType typedef (defined in eoVector< FitT, double >)eoVector< FitT, double >
className() const eoReal< FitT > [inline, virtual]
ContainerType typedef (defined in eoVector< FitT, double >)eoVector< FitT, double >
EO()EO< FitT > [inline]
EO() (defined in EO< FitT >)EO< FitT > [inline]
eoReal(unsigned size=0, double value=0.0)eoReal< FitT > [inline]
eoVector(unsigned size=0, doublevalue=double())eoVector< FitT, double > [inline]
eoVector(const eoVector< OtherFitnessType, double > &_vec)eoVector< FitT, double > [inline]
Fitness typedef (defined in EO< FitT >)EO< FitT >
fitness() const EO< FitT > [inline]
fitness(const Fitness &_fitness)EO< FitT > [inline]
fitness(performance_type perf) (defined in EO< FitT >)EO< FitT > [inline]
fitness(void) const (defined in EO< FitT >)EO< FitT > [inline]
fitness_traits typedef (defined in EO< FitT >)EO< FitT >
invalid() const EO< FitT > [inline]
invalidate() (defined in EO< FitT >)EO< FitT > [inline]
invalidate(void) (defined in EO< FitT >)EO< FitT > [inline]
invalidate_worth(void) (defined in EO< FitT >)EO< FitT > [inline]
operator<(const eoVector< FitT, double > &_eo) const eoVector< FitT, double > [inline]
EO< FitT >::operator<(const EO &_eo2) const EO< FitT > [inline]
operator<(const EO< Fitness, Traits > &other) const (defined in EO< FitT >)EO< FitT > [inline]
operator>(const EO &_eo2) const (defined in EO< FitT >)EO< FitT > [inline]
operator>(const EO< Fitness, Traits > &other) const (defined in EO< FitT >)EO< FitT > [inline]
performance(performance_type perf) (defined in EO< FitT >)EO< FitT > [inline]
performance(void) const (defined in EO< FitT >)EO< FitT > [inline]
performance_type typedef (defined in EO< FitT >)EO< FitT >
printOn(std::ostream &os) const eoVector< FitT, double > [inline, virtual]
readFrom(std::istream &is)eoVector< FitT, double > [inline, virtual]
storage_type typedef (defined in EO< FitT >)EO< FitT >
value(const std::vector< double > &_v) (defined in eoVector< FitT, double >)eoVector< FitT, double > [inline]
worth(worth_type worth) (defined in EO< FitT >)EO< FitT > [inline]
worth(void) const (defined in EO< FitT >)EO< FitT > [inline]
worth_type typedef (defined in EO< FitT >)EO< FitT >
~EO()EO< FitT > [inline, virtual]
~eoObject()eoObject [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]

Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_real.html b/trunk/paradiseo-eo/doc/html/classeo_real.html new file mode 100644 index 000000000..557162280 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_real.html @@ -0,0 +1,101 @@ + + +EO: eoReal< FitT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoReal< FitT > Class Template Reference

eoReal: implementation of simple real-valued chromosome. +More... +

+#include <eoReal.h> +

+

Inheritance diagram for eoReal< FitT >: +

+ +eoVector< FitT, double > +EO< FitT > +eoObject +eoPersistent +eoPrintable + +List of all members. + + + + + + + + +

Public Member Functions

 eoReal (unsigned size=0, double value=0.0)
 (Default) Constructor.
+virtual std::string className () const
 My class name.
+

Detailed Description

+

template<class FitT>
+ class eoReal< FitT >

+ +eoReal: implementation of simple real-valued chromosome. +

+based on eoVector class +

+ +

+Definition at line 37 of file eoReal.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class FitT>
eoReal< FitT >::eoReal ( unsigned  size = 0,
double  value = 0.0
)  [inline]
+
+ + + + + +
+   + + +

+(Default) Constructor. +

+

Parameters:
+ + +
size Size of the std::vector
+
+ +

+Definition at line 45 of file eoReal.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_real.png b/trunk/paradiseo-eo/doc/html/classeo_real.png new file mode 100644 index 0000000000000000000000000000000000000000..f28d1de401ca0f4674b942f6578ba7e135ee84c0 GIT binary patch literal 1617 zcmb_cdo+}382=1qS8H`)N4afVbUF3OwJ8}ANyFscZN5P=nM90nH=@{xD3&i0x{OjT zk;=>@gHU0Xu_QCDW5#vJZ8A-oopR3pvuFS5>^Z;Zd4JFI`{#Mj`#!%UN35-~(gq~} z0F>r3*61SO3p(el!ZIl(;Y*Dcv37`!MLf-V zZrMHTP@716dNMtoGv!h9;j<#ul8IdGkP{z;{<48sgF`7ZDyGtUtxnx-nw*AiFXubS zPrLS*z1YxGd_Gv<2p;e}zXsRx0k!YR%T|kz=QZ0K%8(i+bwZ!CQNu&8BHrK{O}$h3 zhI>zg0eP_6*^nR=D76YNpqwMkNN$)9p+(x`cfe&N8Bq!=*Lf)dzfA(Dm!*>mDAq8k zTFDHNVnoX&3LjypKbQflmvzf{EgOZDj^LvCd1VK&Hql*;;AK;bLtEX!k@QYmR>Ldr+TjV%Wz26!X^LAG*m;89 zIopl^gWJa$AG?p8S})N163>F%i*YQU(k)o<_8-WCy}}ohlFJHy zbL^{0!bL-@g9y6^2~Q;qt`Dpx^USl#;5v}Vxl-d%L1|eE)JZ-v618K}`}Q$fL9_CN z5(C#~4dp#9w+~oZ+V3M>z8$dA9c~3bIt|DdARw#j2gr6BRhBSgt79zY(U^G#CJuo+ z;V_+zV^xYe`8-`(Df85RE< z&&)QqMJ8ny8@w!k(oAnD#N^|g2e?6@vPvUwIxMd3 z@AD4W+q2XfF$4PJxJLy1>q?Ay1VJ?%6yO$l*Ae#OSB+)*RyE!D;1G||jpHcsgem$vQ3*x}ib1lSQdnr^zQmGA23 z0ikzcDg~a#Uc*#ic{g2NxFjbWZI9x=kx?g9Qk86oeD`BLZ zyjWC6ozR0TbKtoOVY=GccLV7Gs+^tgFwd*;_6ZX{+@`vFuP$Zq&{_Vqpk|xa%^|cv zXPnc7A9y3KxlD?1_KevIZ+VbRmti%kOu|L<1+sT>};^srB + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRealAboveBound Member List

This is the complete list of members for eoRealAboveBound, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
dup() const eoRealAboveBound [inline, virtual]
eoRealAboveBound(double _max=0)eoRealAboveBound [inline]
foldsInBounds(double &_r) const eoRealAboveBound [inline, virtual]
hasNoBoundAtAll(void) const eoRealAboveBound [inline, virtual]
isBounded(void) const eoRealAboveBound [inline, virtual]
isInBounds(double _r) const eoRealAboveBound [inline, virtual]
isMaxBounded(void) const eoRealAboveBound [inline, virtual]
isMinBounded(void) const eoRealAboveBound [inline, virtual]
maximum() const eoRealAboveBound [inline, virtual]
minimum() const eoRealAboveBound [inline, virtual]
printOn(std::ostream &_os) const eoRealAboveBound [inline, virtual]
range() const eoRealAboveBound [inline, virtual]
readFrom(std::istream &_is)eoRealAboveBound [inline, virtual]
repMaximum (defined in eoRealAboveBound)eoRealAboveBound [private]
truncate(double &_r) const eoRealAboveBound [inline, virtual]
uniform(eoRng &_rng=eo::rng) const eoRealAboveBound [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]
~eoRealAboveBound() (defined in eoRealAboveBound)eoRealAboveBound [inline, virtual]
~eoRealBounds() (defined in eoRealBounds)eoRealBounds [inline, virtual]

Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_real_above_bound.html b/trunk/paradiseo-eo/doc/html/classeo_real_above_bound.html new file mode 100644 index 000000000..c0c57f8d7 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_real_above_bound.html @@ -0,0 +1,177 @@ + + +EO: eoRealAboveBound Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRealAboveBound Class Reference

An eoRealBound bounded from above only. +More... +

+#include <eoRealBounds.h> +

+

Inheritance diagram for eoRealAboveBound: +

+ +eoRealBounds +eoPersistent +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoRealAboveBound (double _max=0)
 Simple bounds = minimum.
+virtual double maximum () const
 get maximum value ::exception if does not exist
+virtual double minimum () const
 get minimum value ::exception if does not exist
+virtual double range () const
 get range ::exception if unbounded
+virtual double uniform (eoRng &_rng=eo::rng) const
 random generator of uniform numbers in bounds ::exception if unbounded
+virtual bool isBounded (void) const
 Self-Test: true if ***both*** a min and a max.
+virtual bool hasNoBoundAtAll (void) const
 Self-Test: true if no min ***and*** no max hence no further need to test/truncate/fold anything.
+virtual bool isMinBounded (void) const
 Self-Test: bounded from below???
+virtual bool isMaxBounded (void) const
 Self-Test: bounded from above???
+virtual bool isInBounds (double _r) const
 Test on a value: is it in bounds?
+virtual void foldsInBounds (double &_r) const
 Put value back into bounds - by folding back and forth.
+virtual void truncate (double &_r) const
 Put value back into bounds - by truncating to a boundary value.
virtual void readFrom (std::istream &_is)
 Read object.
virtual void printOn (std::ostream &_os) const
 Write object.
+virtual eoRealBounds * dup () const
 for memory managements - ugly

Private Attributes

+double repMaximum
+

Detailed Description

+An eoRealBound bounded from above only. +

+ +

+Definition at line 409 of file eoRealBounds.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + +
virtual void eoRealAboveBound::readFrom ( std::istream &  _is  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Read object. +

+

Parameters:
+ + +
_is A std::istream. but reading should not be done here, because of bound problems see eoRealVectorBounds
+
+ +

+Implements eoPersistent. +

+Definition at line 477 of file eoRealBounds.h.

+

+ + + + +
+ + + + + + + + + +
virtual void eoRealAboveBound::printOn ( std::ostream &  _os  )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Write object. +

+It's called printOn since it prints the object on a stream.

Parameters:
+ + +
_os A std::ostream.
+
+ +

+Implements eoPrintable. +

+Definition at line 486 of file eoRealBounds.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_real_above_bound.png b/trunk/paradiseo-eo/doc/html/classeo_real_above_bound.png new file mode 100644 index 0000000000000000000000000000000000000000..0ce98c6c76160449801f0b3d4f022229eecd276c GIT binary patch literal 647 zcmV;20(kw2P)JJD|HwLj9Uwih#_E{#Wke003$r+5Xd;hF?vXA@B|Y?4|P=r_STf&L1OVX1mY;M2D0Tn<002ovPDHLkV1m47DcAr2 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_real_base_vector_bounds-members.html b/trunk/paradiseo-eo/doc/html/classeo_real_base_vector_bounds-members.html new file mode 100644 index 000000000..f0a127860 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_real_base_vector_bounds-members.html @@ -0,0 +1,37 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRealBaseVectorBounds Member List

This is the complete list of members for eoRealBaseVectorBounds, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + +
averageRange()eoRealBaseVectorBounds [inline, virtual]
eoRealBaseVectorBounds()eoRealBaseVectorBounds [inline]
eoRealBaseVectorBounds(unsigned _dim, eoRealBounds &_bounds)eoRealBaseVectorBounds [inline]
eoRealBaseVectorBounds(eoRealBounds &_xbounds, eoRealBounds &_ybounds)eoRealBaseVectorBounds [inline]
foldsInBounds(unsigned _i, double &_r)eoRealBaseVectorBounds [inline, virtual]
foldsInBounds(std::vector< double > &_v)eoRealBaseVectorBounds [inline, virtual]
hasNoBoundAtAll(unsigned _i)eoRealBaseVectorBounds [inline, virtual]
hasNoBoundAtAll(void)eoRealBaseVectorBounds [inline, virtual]
isBounded(unsigned _i)eoRealBaseVectorBounds [inline, virtual]
isBounded(void)eoRealBaseVectorBounds [inline, virtual]
isInBounds(unsigned _i, double _r)eoRealBaseVectorBounds [inline, virtual]
isInBounds(std::vector< double > _v)eoRealBaseVectorBounds [inline, virtual]
isMaxBounded(unsigned _i) (defined in eoRealBaseVectorBounds)eoRealBaseVectorBounds [inline, virtual]
isMinBounded(unsigned _i) (defined in eoRealBaseVectorBounds)eoRealBaseVectorBounds [inline, virtual]
maximum(unsigned _i) (defined in eoRealBaseVectorBounds)eoRealBaseVectorBounds [inline, virtual]
minimum(unsigned _i)eoRealBaseVectorBounds [inline, virtual]
printOn(std::ostream &_os) const eoRealBaseVectorBounds [inline, virtual]
range(unsigned _i) (defined in eoRealBaseVectorBounds)eoRealBaseVectorBounds [inline, virtual]
truncate(unsigned _i, double &_r)eoRealBaseVectorBounds [inline, virtual]
truncate(std::vector< double > &_v)eoRealBaseVectorBounds [inline, virtual]
uniform(unsigned _i, eoRng &_rng=eo::rng)eoRealBaseVectorBounds [inline, virtual]
uniform(std::vector< double > &_v, eoRng &_rng=eo::rng)eoRealBaseVectorBounds [inline]
~eoRealBaseVectorBounds() (defined in eoRealBaseVectorBounds)eoRealBaseVectorBounds [inline, virtual]

Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_real_base_vector_bounds.html b/trunk/paradiseo-eo/doc/html/classeo_real_base_vector_bounds.html new file mode 100644 index 000000000..be1ed03c4 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_real_base_vector_bounds.html @@ -0,0 +1,162 @@ + + +EO: eoRealBaseVectorBounds Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRealBaseVectorBounds Class Reference

Vector type for bounds (see eoRealBounds.h for scalar types) ------------ Class eoRealVectorBounds implements the std::vectorized version: it is basically a std::vector of eoRealBounds * and forwards all request to the elements of the std::vector. +More... +

+#include <eoRealVectorBounds.h> +

+

Inheritance diagram for eoRealBaseVectorBounds: +

+ +eoRealVectorBounds +eoRealVectorNoBounds + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoRealBaseVectorBounds ()
 Default Ctor.
+ eoRealBaseVectorBounds (unsigned _dim, eoRealBounds &_bounds)
 Ctor: same bounds for everybody, given as an eoRealBounds.
+ eoRealBaseVectorBounds (eoRealBounds &_xbounds, eoRealBounds &_ybounds)
 Ctor, particular case of dim-2.
+virtual bool isBounded (unsigned _i)
 test: is i_th component bounded
+virtual bool isBounded (void)
 test: bounded iff all are bounded
+virtual bool hasNoBoundAtAll (unsigned _i)
 Self-test: true iff i_th component has no bounds at all.
+virtual bool hasNoBoundAtAll (void)
 Self-test: true iff all components have no bound at all.
+virtual bool isMinBounded (unsigned _i)
+virtual bool isMaxBounded (unsigned _i)
+virtual void foldsInBounds (unsigned _i, double &_r)
 Folds a real value back into the bounds - i_th component.
+virtual void foldsInBounds (std::vector< double > &_v)
 Folds all variables of a std::vector of real values into the bounds.
+virtual void truncate (unsigned _i, double &_r)
 Truncates a real value to the bounds - i_th component.
+virtual void truncate (std::vector< double > &_v)
 truncates all variables of a std::vector of real values to the bounds
+virtual bool isInBounds (unsigned _i, double _r)
 test: is i_th component within the bounds?
+virtual bool isInBounds (std::vector< double > _v)
 test: are ALL components within the bounds?
+virtual double minimum (unsigned _i)
 Accessors: will raise an std::exception if these do not exist.
+virtual double maximum (unsigned _i)
+virtual double range (unsigned _i)
+virtual double averageRange ()
 Computes the average range An std::exception will be raised if one of the component is unbounded.
+virtual double uniform (unsigned _i, eoRng &_rng=eo::rng)
 Generates a random number in i_th range An std::exception will be raised if one of the component is unbounded.
+void uniform (std::vector< double > &_v, eoRng &_rng=eo::rng)
 fills a std::vector with uniformly chosen variables in bounds An std::exception will be raised if one of the component is unbounded
virtual void printOn (std::ostream &_os) const
 Write object.
+

Detailed Description

+Vector type for bounds (see eoRealBounds.h for scalar types) ------------ Class eoRealVectorBounds implements the std::vectorized version: it is basically a std::vector of eoRealBounds * and forwards all request to the elements of the std::vector. +

+This file also contains the global variables and eoDummyVectorNoBounds that are used as defaults in ctors (i.e. when no bounds are given, it is assumed unbounded values)

+THe 2 main classes defined here are

+eoRealBaseVectorBounds, base class that handles all useful functions eoRealVectorBounds which derives from the preceding *and* eoPersistent and also has a mechanism for memory handling of the pointers it has to allocate +

+ +

+Definition at line 58 of file eoRealVectorBounds.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + +
virtual void eoRealBaseVectorBounds::printOn ( std::ostream &  _os  )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Write object. +

+It's called printOn since it prints the object on a stream.

Parameters:
+ + +
_os A std::ostream.
+
+ +

+Reimplemented in eoRealVectorBounds. +

+Definition at line 214 of file eoRealVectorBounds.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_real_base_vector_bounds.png b/trunk/paradiseo-eo/doc/html/classeo_real_base_vector_bounds.png new file mode 100644 index 0000000000000000000000000000000000000000..0af33c0da8bfb8b17eb3c3f9c691f6fcf2f422f4 GIT binary patch literal 648 zcmV;30(bq1P)Ha{nWY_z*2SVJrk{rzt2G7ERKhL=l0DKf&5jQb|ik0M`OD zfSHN`{vB|9tJs?kaG!7hw#70Cu$z?Mj06&;poE~1yA(~JNTH-=ln!KP zDg-pMn32&#Gr8zz@-IVN~Vah|+0SGo_x64`1uo>EAUR<-J%bLLLQQkO6@E{8Qk_xC6uk;sLNNeE|V>lP-M#Y`2O?K#gH@Kr`?@kW(rW z(9C}E1JX*oLyZAVe0vB4S-$Rp5+o#G2ioKS0c=|Y1>P*G-+(xhB-<^yZY7(E>VE*N zCnb+(DCxr)4nVNU0p4`^qKm6vy3A*Ik@oVD`Xw(J0Sw?%z{$_!?08@Qq5ogN&}|kF z7xMxbzyJm?fB_8PO9ChVkqq7D_W;i{o9^`k(uIZHwK*5Z1A|lgLbp+a8k4JfYmAaT(j8&Z?qe?%l9=K)VQzRyxdPO ifWH*@tU%*^M*jg>B_z+Dl+p_T0000 + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRealBelowBound Member List

This is the complete list of members for eoRealBelowBound, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
dup() const eoRealBelowBound [inline, virtual]
eoRealBelowBound(double _min=0)eoRealBelowBound [inline]
foldsInBounds(double &_r) const eoRealBelowBound [inline, virtual]
hasNoBoundAtAll(void) const eoRealBelowBound [inline, virtual]
isBounded(void) const eoRealBelowBound [inline, virtual]
isInBounds(double _r) const eoRealBelowBound [inline, virtual]
isMaxBounded(void) const eoRealBelowBound [inline, virtual]
isMinBounded(void) const eoRealBelowBound [inline, virtual]
maximum() const eoRealBelowBound [inline, virtual]
minimum() const eoRealBelowBound [inline, virtual]
printOn(std::ostream &_os) const eoRealBelowBound [inline, virtual]
range() const eoRealBelowBound [inline, virtual]
readFrom(std::istream &_is)eoRealBelowBound [inline, virtual]
repMinimum (defined in eoRealBelowBound)eoRealBelowBound [private]
truncate(double &_r) const eoRealBelowBound [inline, virtual]
uniform(eoRng &_rng=eo::rng) const eoRealBelowBound [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]
~eoRealBelowBound() (defined in eoRealBelowBound)eoRealBelowBound [inline, virtual]
~eoRealBounds() (defined in eoRealBounds)eoRealBounds [inline, virtual]

Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_real_below_bound.html b/trunk/paradiseo-eo/doc/html/classeo_real_below_bound.html new file mode 100644 index 000000000..09e134568 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_real_below_bound.html @@ -0,0 +1,177 @@ + + +EO: eoRealBelowBound Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRealBelowBound Class Reference

an eoRealBound bounded from below only +More... +

+#include <eoRealBounds.h> +

+

Inheritance diagram for eoRealBelowBound: +

+ +eoRealBounds +eoPersistent +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoRealBelowBound (double _min=0)
 Simple bounds = minimum.
+virtual double minimum () const
 get minimum value ::exception if does not exist
+virtual double maximum () const
 get maximum value ::exception if does not exist
+virtual double range () const
 get range ::exception if unbounded
+virtual double uniform (eoRng &_rng=eo::rng) const
 random generator of uniform numbers in bounds ::exception if unbounded
+virtual bool isBounded (void) const
 Self-Test: true if ***both*** a min and a max.
+virtual bool hasNoBoundAtAll (void) const
 Self-Test: true if no min ***and*** no max hence no further need to test/truncate/fold anything.
+virtual bool isMinBounded (void) const
 Self-Test: bounded from below???
+virtual bool isMaxBounded (void) const
 Self-Test: bounded from above???
+virtual bool isInBounds (double _r) const
 Test on a value: is it in bounds?
+virtual void foldsInBounds (double &_r) const
 Put value back into bounds - by folding back and forth.
+virtual void truncate (double &_r) const
 Put value back into bounds - by truncating to a boundary value.
virtual void readFrom (std::istream &_is)
 Read object.
virtual void printOn (std::ostream &_os) const
 Write object.
+virtual eoRealBounds * dup () const
 for memory managements - ugly

Private Attributes

+double repMinimum
+

Detailed Description

+an eoRealBound bounded from below only +

+ +

+Definition at line 315 of file eoRealBounds.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + +
virtual void eoRealBelowBound::readFrom ( std::istream &  _is  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Read object. +

+

Parameters:
+ + +
_is A std::istream. but reading should not be done here, because of bound problems see eoRealVectorBounds
+
+ +

+Implements eoPersistent. +

+Definition at line 382 of file eoRealBounds.h.

+

+ + + + +
+ + + + + + + + + +
virtual void eoRealBelowBound::printOn ( std::ostream &  _os  )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Write object. +

+It's called printOn since it prints the object on a stream.

Parameters:
+ + +
_os A std::ostream.
+
+ +

+Implements eoPrintable. +

+Definition at line 391 of file eoRealBounds.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_real_below_bound.png b/trunk/paradiseo-eo/doc/html/classeo_real_below_bound.png new file mode 100644 index 0000000000000000000000000000000000000000..3eb977351e9da505c60ba3342621202caff39042 GIT binary patch literal 637 zcmV-@0)qXCP)e$6LgdY3J9YF?dKZ^6AAKO?4xKF=?Em1IA|yI>!Kp zXZscH>eD$n%$F4yqIhH2$Ksg!FzE=Trw2))uk}?RIpo+3q*L1XyV~#Ojev&wupdlU^Kdi`5 z%AHNR$}!#{WzHK8X$x>oMi1Deaw`;AFX=q<+SQC zrIl7%X{9ets~)=mEyURRa%ZT=oK#=ft>2+LF$RftERcd4^ALr?Q@Rsl>0-&%8z1Z? z*)uwcF`qBBQ0&%TR5f&#T#m&Uv}fm6o0WC`BV(pLB_ z9kyM7>FmY&Ak7V-}B2YHTG(e8T z9Uz?zAZT%RN3+A38<}}p8f=f=uRDEG0P?Wa^M%XIJ&&tWfSMhr{onhzDSbcs)Hm`k XzKxS)l@b-c00000NkvXXu0mjfOcE>m literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_real_bounds-members.html b/trunk/paradiseo-eo/doc/html/classeo_real_bounds-members.html new file mode 100644 index 000000000..fb91df6a5 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_real_bounds-members.html @@ -0,0 +1,31 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRealBounds Member List

This is the complete list of members for eoRealBounds, including all inherited members.

+ + + + + + + + + + + + + + + + + +
dup() const =0eoRealBounds [pure virtual]
foldsInBounds(double &) const =0eoRealBounds [pure virtual]
hasNoBoundAtAll(void) const =0eoRealBounds [pure virtual]
isBounded(void) const =0eoRealBounds [pure virtual]
isInBounds(double) const =0eoRealBounds [pure virtual]
isMaxBounded(void) const =0eoRealBounds [pure virtual]
isMinBounded(void) const =0eoRealBounds [pure virtual]
maximum() const =0eoRealBounds [pure virtual]
minimum() const =0eoRealBounds [pure virtual]
printOn(std::ostream &_os) const =0eoPrintable [pure virtual]
range() const =0eoRealBounds [pure virtual]
readFrom(std::istream &_is)=0eoPersistent [pure virtual]
truncate(double &) const =0eoRealBounds [pure virtual]
uniform(eoRng &_rng=eo::rng) const =0eoRealBounds [pure virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]
~eoRealBounds() (defined in eoRealBounds)eoRealBounds [inline, virtual]

Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_real_bounds.html b/trunk/paradiseo-eo/doc/html/classeo_real_bounds.html new file mode 100644 index 000000000..4d95095e3 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_real_bounds.html @@ -0,0 +1,102 @@ + + +EO: eoRealBounds Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRealBounds Class Reference
+ +[EvolutionStrategies] +

Defines bound classes for real numbers. +More... +

+#include <es/eoRealBounds.h> +

+

Inheritance diagram for eoRealBounds: +

+ +eoPersistent +eoPrintable +eoGeneralRealBounds +eoRealAboveBound +eoRealBelowBound +eoRealInterval +eoRealNoBounds + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+virtual bool isBounded (void) const =0
 Self-Test: true if ***both*** a min and a max.
+virtual bool hasNoBoundAtAll (void) const =0
 Self-Test: true if no min ***and*** no max hence no further need to test/truncate/fold anything.
+virtual bool isMinBounded (void) const =0
 Self-Test: bounded from below???
+virtual bool isMaxBounded (void) const =0
 Self-Test: bounded from above???
+virtual bool isInBounds (double) const =0
 Test on a value: is it in bounds?
+virtual void foldsInBounds (double &) const =0
 Put value back into bounds - by folding back and forth.
+virtual void truncate (double &) const =0
 Put value back into bounds - by truncating to a boundary value.
+virtual double minimum () const =0
 get minimum value ::exception if does not exist
+virtual double maximum () const =0
 get maximum value ::exception if does not exist
+virtual double range () const =0
 get range ::exception if unbounded
+virtual double uniform (eoRng &_rng=eo::rng) const =0
 random generator of uniform numbers in bounds ::exception if unbounded
+virtual eoRealBounds * dup () const =0
 for memory managements - ugly
+

Detailed Description

+Defines bound classes for real numbers. +

+Scalar type: ------------ Basic class is eoRealBounds, a pure virtual.

+The following pure virtual methods are to be used in mutations:

    +
  • void foldsInBounds(double &) that folds any value that falls out of the bounds back into the bounds, by bouncing on the limit (if any)
  • bool isInBounds(double) that simply says whether or not the argument is in the bounds
  • void truncate(double &) that set the argument to the bound value it it exceeds it
+

+So mutation can choose

    +
  • iterate trying until they fall in bounds,
  • only try once and "restd::pair" by using the foldsInBounds method
  • only try once and restd::pair using the truncate method (will create a huge bias toward the bound if the soluiton is not far from the bounds)
+

+There is also a uniform() method that generates a uniform value (if possible, i.e. if bounded) in the interval.

+Derived class are eoRealInterval that holds a minimum and maximum value, eoRealNoBounds the "unbounded bounds" (-infinity, +infinity) eoRealBelowBound the half-bounded interval [min, +infinity) eoRealAboveBound the half-bounded interval (-infinity, max]

+THis file also contains the declaration of *the* global object that is the unbounded bound +

+ +

+Definition at line 75 of file eoRealBounds.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_real_bounds.png b/trunk/paradiseo-eo/doc/html/classeo_real_bounds.png new file mode 100644 index 0000000000000000000000000000000000000000..a711a877a40fa3d9320f6c5849f20ff732ba3401 GIT binary patch literal 1641 zcmbuAdo+}39LL9o7Kue`+}5cu*(Gw1w2{(l-AAO!tuYGo5;9}Zu$669%9+Hv4pNiF zxb3`yac`q5a_4o4FirL)rY1EsJGFK8a`v1(o&DqaJm2R$=RD{8{hr@BPpZ4Cqr9xT zEDD8^2M#!RqEMfWigl~xIx+7kjr5B*w7av{K9NWymLgFrogSDjR_|A9YimNgXhwXL zIO*w%MeUgz4nd)$M1X^xS6m*FkBh!$h2H-pi+bsob*1F=(wvtMu!5GekECQIl=Pr^ zxy{^Q>$x{eF$R)M!Oh7D*E`=?+{Fc(Hc~n$+tDb z)brI~t}b4fa*}AHtPZ(A`7skY#;Tb+RkN}$ogivo$J-o`FQ`R~3Dd+QUj~egJ+5Ah z?SSwt`4w<~YDp;Z+kKs+o;*Y02$Y+-6JNDvH4Y(`5D3CrRi`qVs0oBzsxVYg0EECr z>!WsE*`+|&y&8y(pxu0-C^(3;2+ouU)Y@1`?)cc-zM0*0gRLu-4gJLU}sUUGo*!iq8J-` z)B1|^%#Qp=WO0-75 zgC0*?l@1i@TZ6CxccC) z-BPnlYI4FuZ1$o%LlU+}7rDwn*H2`5eYF2)kWWy^P>_GyyJ47GlTu@=2Cr`XFcRWM z8=y!&zQb@A%YZ%7a9iN<2I9`Ljbm|@V-XwA9U9q)tc27cCTbuf)mSa3QAW8eUtCM9 z(HBUwBOJTj;|Ej?X~>Py3JhZ)07 zVNRY`jt+HZpMK^!KbVpRvN@EYktj;JEzECbJ+y( zFWYr%V}sdzg^L`1PoBI60gl?@+)+`U*6BNlg+S7M=>A2}n-iB@R~*h6B+Sn=(g6>W zVn4ZGZUaV1Z@N52H++(0M2I`w1p(T-E5G~tR6J|D&0RUrcfJOxi9K@F((nC4-$XI} zyfJ;UeLHLGnG`o0x8X33vRR#z_4ltGrmf-gXn5hq2DdU7+$bqTf7@(!shu9&v651g zH&8pi;7!f(V+=f`RU^DY(EQ-Qw&O!2jYByeub0k&m7dZJf-0b0-_kwZJID9$$_R;= zrVj{xnaKxjvGyDs&Y|&0p9y&qDqW;no13ygygGcQaB7XD{B$lPgQ*fTL}DAj^~L;6 zwV`nHC^Xx|Z?-6=gm#h`m?eJHd<2t)tnGkV+i{q1Vnb}5(ddFyrYr__jHmhgZiNxQ zLIjv&#z!rYg`j1N=2JHRpsCjQo7-Vn|9I$?5aBU2UZhYH7Jz7q!b_Mn6yQ_KV>4{R zSFn*cdD%MKkJAAnb;5!dq!Xa)SOEOi5Al~*7JeFI*Ch_QM)He}DRJ*nueS&FR3B6F zX@JdgiHsBu#L@420Oh#2Et_#y$4DI|wF5E8e?XXIn3U|L0FYm6o5qygUB7#kFa8%$ Nz&=+8rhVY)-vR5{P9y*T literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_real_init_bounded-members.html b/trunk/paradiseo-eo/doc/html/classeo_real_init_bounded-members.html new file mode 100644 index 000000000..6b68c2f89 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_real_init_bounded-members.html @@ -0,0 +1,23 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRealInitBounded< EOT > Member List

This is the complete list of members for eoRealInitBounded< EOT >, including all inherited members.

+ + + + + + + + + +
bounds (defined in eoRealInitBounded< EOT >)eoRealInitBounded< EOT > [private]
className(void) const eoInit< EOT > [inline, virtual]
eoRealInitBounded(eoRealVectorBounds &_bounds)eoRealInitBounded< EOT > [inline]
functor_category()eoUF< EOT &, void > [inline, static]
operator()(EOT &_eo)eoRealInitBounded< EOT > [inline, virtual]
size() (defined in eoRealInitBounded< EOT >)eoRealInitBounded< EOT > [inline, virtual]
theBounds()eoRealInitBounded< EOT > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< EOT &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_real_init_bounded.html b/trunk/paradiseo-eo/doc/html/classeo_real_init_bounded.html new file mode 100644 index 000000000..89863a159 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_real_init_bounded.html @@ -0,0 +1,59 @@ + + +EO: eoRealInitBounded< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRealInitBounded< EOT > Class Template Reference

Simple initialization for any EOT that derives from std::vector<double> uniformly in some bounds. +More... +

+#include <eoRealInitBounded.h> +

+

Inheritance diagram for eoRealInitBounded< EOT >: +

+ +eoInit< EOT > +eoUF< EOT &, void > +eoFunctorBase +eoEsChromInit< EOT > + +List of all members. + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoRealInitBounded (eoRealVectorBounds &_bounds)
 Ctor - from eoRealVectorBounds.
+virtual void operator() (EOT &_eo)
 simply passes the argument to the uniform method of the bounds
+virtual eoRealVectorBounds & theBounds ()
 accessor to the bounds
+virtual unsigned size ()

Private Attributes

+eoRealVectorBounds & bounds
+

Detailed Description

+

template<class EOT>
+ class eoRealInitBounded< EOT >

+ +Simple initialization for any EOT that derives from std::vector<double> uniformly in some bounds. +

+ +

+Definition at line 40 of file eoRealInitBounded.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_real_init_bounded.png b/trunk/paradiseo-eo/doc/html/classeo_real_init_bounded.png new file mode 100644 index 0000000000000000000000000000000000000000..843511a9a13bb8edf94d59258f850000755cfda2 GIT binary patch literal 1589 zcmbtUYdF&j9G=VBkv1}&`9D)R%aTi%O`1li#%yxQTvBxWnaceVA(zBlc4}ioav7a+ z+$LQdI$<$Z6e4MI>8uMOBf?yAoSoID^E~In`EWk`p7;H|pWff~=VOkxa8;Bl1OkCm z$ktQ{M1d*iE6Pe=mHuv&9Drl?t~N56OipDo!S(APTh6|PKp=>3la0w!g(#|{3*^xF z;28+yyDp0LVb@shOtDi=>8?%f_4fmN@mjqPyg^A~_0qzaNsQC#myISr8dChuJXc#g zxX+oMG^yh-n)?y`hwQ4fY2Q>;ZKJHb(U%#2>X`rn#agm_pebX;nPpQFU?D&FO^4L- zX5X%M^C6b>-lw^>b8Q;T`UbPSsr4IWK-K95Bu718SP~I0aE68O!C@~#>D7VGJa+A4 zyA!aOOXlN{c7Iqw$XemEh$y}MnX+8_8v#ok1e3tV0KcuHn}94Ij}g{A1!BOSd*B$q zHB9Q#atliuiDcHtw1-z8GaGp`G}Gh))s5n2PrO38qIO_-K$!;t@7v*2>Ya zhFf25y+HopOU$vfq!uKnnO_ZB>!UrQn$8_#7LGN)qtO%m33szOQ=W@&n{l7)GX0Yz z50Jva(XbwyxTrQa;4!3Es=gke0t5dn0$2y%8i;CEm`;;trKnI*(4?baW!1R}TAk(j zK^4`yQu!0{>f$w0jc|dbIm_F3w0@>qRJ$ZMy9- z$(Z^Pb0D=nU8kyh>vqbn%w@PY2|eTCbi|e?G+WZqd5_Cnm$71*G({-(k^(bK;6JM1 zRF!HOYUHL1oW-0d`2~-4d_uAyvcNjTdjT8s?{d+Uf5@24rJSsQldI2RfB@27flC;F zN$0*^ZetYKj&NU_3RDOUox4nS0|Cg&1ZI8=nTsswdMfHQ&(nvsJQ*LeoY<7Caqip& z&acZcGrf7q1|4RIMgYp!CI@p=4}RTT;(^Pqq?uiP7Ytyz0IaMJuH zI>!CL5S%0r)tj$ ziCylwjb!?W6kquq&<;_r-P=M~41LGPg%cVa+h<{RR?|5B`1Kqd!}B2xHi6L6CZ=c| zw-|A#n}>e5orHusoAjgwrQoKgcQ!Shy_{Havs>ER7Jh%lQIzH=RiS~)xDMnfHO!Aj zqaQ93A+(>8&j$oglX#ZCut#gtgMM^Bb86aJdMani;!YBEzkuxu$70-+U=$HI?f-Sl z+3ZxOPCE+cGUG%l@@39*?QW8onvdO>Z@%iXcA)`N`G2p5Nt1wp2-R8diXSJFoU@h}J4(b#q zsW6aQ4a??JW};o5?GX<~c%^BS3mnYc)Pzp_Mv1FuW)~l418a#JXYEc0!fyErvs?+x z9r$dHoqcdBr&DaI|Jrnmnu7splK59MI^@?cp + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRealInterval Member List

This is the complete list of members for eoRealInterval, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + +
dup() const eoRealInterval [inline, virtual]
eoRealInterval(double _min=0, double _max=1)eoRealInterval [inline]
foldsInBounds(double &_r) const eoRealInterval [inline, virtual]
hasNoBoundAtAll(void) const eoRealInterval [inline, virtual]
isBounded(void) const eoRealInterval [inline, virtual]
isInBounds(double _r) const eoRealInterval [inline, virtual]
isMaxBounded(void) const eoRealInterval [inline, virtual]
isMinBounded(void) const eoRealInterval [inline, virtual]
maximum() const eoRealInterval [inline, virtual]
minimum() const eoRealInterval [inline, virtual]
printOn(std::ostream &_os) const eoRealInterval [inline, virtual]
range() const eoRealInterval [inline, virtual]
readFrom(std::istream &_is)eoRealInterval [inline, virtual]
repMaximum (defined in eoRealInterval)eoRealInterval [private]
repMinimum (defined in eoRealInterval)eoRealInterval [private]
repRange (defined in eoRealInterval)eoRealInterval [private]
truncate(double &_r) const eoRealInterval [inline, virtual]
uniform(eoRng &_rng=eo::rng) const eoRealInterval [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]
~eoRealBounds() (defined in eoRealBounds)eoRealBounds [inline, virtual]
~eoRealInterval() (defined in eoRealInterval)eoRealInterval [inline, virtual]

Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_real_interval.html b/trunk/paradiseo-eo/doc/html/classeo_real_interval.html new file mode 100644 index 000000000..e869df873 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_real_interval.html @@ -0,0 +1,183 @@ + + +EO: eoRealInterval Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRealInterval Class Reference

fully bounded eoRealBound == interval +More... +

+#include <eoRealBounds.h> +

+

Inheritance diagram for eoRealInterval: +

+ +eoRealBounds +eoPersistent +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoRealInterval (double _min=0, double _max=1)
 Simple bounds = minimum and maximum (allowed).
+virtual double minimum () const
 get minimum value ::exception if does not exist
+virtual double maximum () const
 get maximum value ::exception if does not exist
+virtual double range () const
 get range ::exception if unbounded
+virtual bool isBounded (void) const
 Self-Test: true if ***both*** a min and a max.
+virtual bool hasNoBoundAtAll (void) const
 Self-Test: true if no min ***and*** no max hence no further need to test/truncate/fold anything.
+virtual bool isMinBounded (void) const
 Self-Test: bounded from below???
+virtual bool isMaxBounded (void) const
 Self-Test: bounded from above???
+virtual double uniform (eoRng &_rng=eo::rng) const
 random generator of uniform numbers in bounds ::exception if unbounded
+virtual bool isInBounds (double _r) const
 Test on a value: is it in bounds?
+virtual void foldsInBounds (double &_r) const
 Put value back into bounds - by folding back and forth.
+virtual void truncate (double &_r) const
 Put value back into bounds - by truncating to a boundary value.
virtual void readFrom (std::istream &_is)
 Read object.
virtual void printOn (std::ostream &_os) const
 Write object.
+virtual eoRealBounds * dup () const
 for memory managements - ugly

Private Attributes

+double repMinimum
+double repMaximum
+double repRange
+

Detailed Description

+fully bounded eoRealBound == interval +

+ +

+Definition at line 199 of file eoRealBounds.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + +
virtual void eoRealInterval::readFrom ( std::istream &  _is  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Read object. +

+

Parameters:
+ + +
_is A std::istream. but reading should not be done here, because of bound problems see eoRealVectorBounds
+
+ +

+Implements eoPersistent. +

+Definition at line 286 of file eoRealBounds.h.

+

+ + + + +
+ + + + + + + + + +
virtual void eoRealInterval::printOn ( std::ostream &  _os  )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Write object. +

+It's called printOn since it prints the object on a stream.

Parameters:
+ + +
_os A std::ostream.
+
+ +

+Implements eoPrintable. +

+Definition at line 295 of file eoRealBounds.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_real_interval.png b/trunk/paradiseo-eo/doc/html/classeo_real_interval.png new file mode 100644 index 0000000000000000000000000000000000000000..09271cfa47b492fc66930b8dbd804bc46fe98179 GIT binary patch literal 596 zcmV-a0;~OrP)PbXFRCt{2m|t$g zAPmOgWzX0*fD=sHh5D5HA7L09aQ@JgDUqhmZkHJIi~G%+s!zD@srYnXX(rx{j{tN- zeTmO_!OnTW+?;ttj1luH*N|!vc6=@pS$N3zoFUaHr;QO$`jOEh1xI`axxeCT4d9@E z+VQdXf1-cQkM#HXG@j;zqxrlT#$V0PexD5DG1|C>|5)zjm*sIQfA@ThH{N*T@8`{b zPVizsWkDCzi#@OGC&!3a_LEX_SJ_u}6Dp3c^2&Zj22*>Bi96(>v@I`ops09PfD8}o(~!DqxqkP@mKTaKPk+A8gIPu#-H)# zKVRjQ`P4^%wX)~6+r-te=Z4>yPY^z`St24#ci@E2WA(s%O@sF#C$#iFuX&$&U-|{&TN-@1 z&|WWYcz}{RS5fABvGN%VvPsWC=YeGgF1G%z>v2^N_jke{=~?UVdUz6HJRdJ8&!_OE i__zOm{s%w#eewgK9|C&K)qi^c0000 + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRealNoBounds Member List

This is the complete list of members for eoRealNoBounds, including all inherited members.

+ + + + + + + + + + + + + + + + + + +
dup() const eoRealNoBounds [inline, virtual]
foldsInBounds(double &) const eoRealNoBounds [inline, virtual]
hasNoBoundAtAll(void) const eoRealNoBounds [inline, virtual]
isBounded(void) const eoRealNoBounds [inline, virtual]
isInBounds(double) const eoRealNoBounds [inline, virtual]
isMaxBounded(void) const eoRealNoBounds [inline, virtual]
isMinBounded(void) const eoRealNoBounds [inline, virtual]
maximum() const eoRealNoBounds [inline, virtual]
minimum() const eoRealNoBounds [inline, virtual]
printOn(std::ostream &_os) const eoRealNoBounds [inline, virtual]
range() const eoRealNoBounds [inline, virtual]
readFrom(std::istream &_is)eoRealNoBounds [inline, virtual]
truncate(double &) const eoRealNoBounds [inline, virtual]
uniform(eoRng &_rng=eo::rng) const eoRealNoBounds [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]
~eoRealBounds() (defined in eoRealBounds)eoRealBounds [inline, virtual]
~eoRealNoBounds() (defined in eoRealNoBounds)eoRealNoBounds [inline, virtual]

Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_real_no_bounds.html b/trunk/paradiseo-eo/doc/html/classeo_real_no_bounds.html new file mode 100644 index 000000000..bb89eced2 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_real_no_bounds.html @@ -0,0 +1,169 @@ + + +EO: eoRealNoBounds Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRealNoBounds Class Reference

A default class for unbounded variables. +More... +

+#include <eoRealBounds.h> +

+

Inheritance diagram for eoRealNoBounds: +

+ +eoRealBounds +eoPersistent +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+virtual bool isBounded (void) const
 Self-Test: true if ***both*** a min and a max.
+virtual bool hasNoBoundAtAll (void) const
 Self-Test: true if no min ***and*** no max hence no further need to test/truncate/fold anything.
+virtual bool isMinBounded (void) const
 Self-Test: bounded from below???
+virtual bool isMaxBounded (void) const
 Self-Test: bounded from above???
+virtual void foldsInBounds (double &) const
 Put value back into bounds - by folding back and forth.
+virtual void truncate (double &) const
 Put value back into bounds - by truncating to a boundary value.
+virtual bool isInBounds (double) const
 Test on a value: is it in bounds?
+virtual double minimum () const
 get minimum value ::exception if does not exist
+virtual double maximum () const
 get maximum value ::exception if does not exist
+virtual double range () const
 get range ::exception if unbounded
+virtual double uniform (eoRng &_rng=eo::rng) const
 random generator of uniform numbers in bounds ::exception if unbounded
virtual void readFrom (std::istream &_is)
 Read object.
virtual void printOn (std::ostream &_os) const
 Write object.
+virtual eoRealBounds * dup () const
 for memory managements - ugly
+

Detailed Description

+A default class for unbounded variables. +

+ +

+Definition at line 133 of file eoRealBounds.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + +
virtual void eoRealNoBounds::readFrom ( std::istream &  _is  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Read object. +

+

Parameters:
+ + +
_is A std::istream. but reading should not be done here, because of bound problems see eoRealVectorBounds
+
+ +

+Implements eoPersistent. +

+Definition at line 171 of file eoRealBounds.h.

+

+ + + + +
+ + + + + + + + + +
virtual void eoRealNoBounds::printOn ( std::ostream &  _os  )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Write object. +

+It's called printOn since it prints the object on a stream.

Parameters:
+ + +
_os A std::ostream.
+
+ +

+Implements eoPrintable. +

+Definition at line 180 of file eoRealBounds.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_real_no_bounds.png b/trunk/paradiseo-eo/doc/html/classeo_real_no_bounds.png new file mode 100644 index 0000000000000000000000000000000000000000..8389195d2773a044f42a8c4d196dc51f5130da30 GIT binary patch literal 633 zcmV-<0*3vGP)2l!-~^raLRsbhM<_x(WQ=j_Hfd%oB{3lUflxdie%pMXvQP6B&e#<>4?qRV zgMWm}r$5dC#>tpNMDH=Sq7TXEVUvrUL?jMk8EZ&Bs#C`vN9#jIQi!<6MS$lMT=4-+ z<_jy%xA`7e-;&!~U(09ZD4)2O&jY61yKrakgA=>WI{%*gxWAUW-)}GFUY$?nlv7SQ z?)xlRm5< zP;S@UU4)w$Bh4hq5LL&pJ+n{fVG! + +EO: eoRealUxOver Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRealUxOver Class Reference

eoRealUxOver --> Uniform crossover, also termed intermediate crossover +More... +

+#include <Tutorial/eoRealOp.h> +

+ + +
+

Detailed Description

+eoRealUxOver --> Uniform crossover, also termed intermediate crossover +

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_real_vector_bounds-members.html b/trunk/paradiseo-eo/doc/html/classeo_real_vector_bounds-members.html new file mode 100644 index 000000000..547e60afd --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_real_vector_bounds-members.html @@ -0,0 +1,53 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRealVectorBounds Member List

This is the complete list of members for eoRealVectorBounds, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
adjust_size(unsigned _dim)eoRealVectorBounds
averageRange()eoRealBaseVectorBounds [inline, virtual]
eoRealBaseVectorBounds()eoRealBaseVectorBounds [inline]
eoRealBaseVectorBounds(unsigned _dim, eoRealBounds &_bounds)eoRealBaseVectorBounds [inline]
eoRealBaseVectorBounds(eoRealBounds &_xbounds, eoRealBounds &_ybounds)eoRealBaseVectorBounds [inline]
eoRealVectorBounds()eoRealVectorBounds [inline]
eoRealVectorBounds(unsigned _dim, eoRealBounds &_bounds)eoRealVectorBounds [inline]
eoRealVectorBounds(eoRealBounds &_xbounds, eoRealBounds &_ybounds)eoRealVectorBounds [inline]
eoRealVectorBounds(unsigned _dim, double _min, double _max)eoRealVectorBounds [inline]
eoRealVectorBounds(std::vector< double > _min, std::vector< double > _max)eoRealVectorBounds [inline]
eoRealVectorBounds(std::string _s)eoRealVectorBounds [inline]
eoRealVectorBounds(const eoRealVectorBounds &)eoRealVectorBounds
factor (defined in eoRealVectorBounds)eoRealVectorBounds [private]
foldsInBounds(unsigned _i, double &_r)eoRealBaseVectorBounds [inline, virtual]
foldsInBounds(std::vector< double > &_v)eoRealBaseVectorBounds [inline, virtual]
hasNoBoundAtAll(unsigned _i)eoRealBaseVectorBounds [inline, virtual]
hasNoBoundAtAll(void)eoRealBaseVectorBounds [inline, virtual]
isBounded(unsigned _i)eoRealBaseVectorBounds [inline, virtual]
isBounded(void)eoRealBaseVectorBounds [inline, virtual]
isInBounds(unsigned _i, double _r)eoRealBaseVectorBounds [inline, virtual]
isInBounds(std::vector< double > _v)eoRealBaseVectorBounds [inline, virtual]
isMaxBounded(unsigned _i) (defined in eoRealBaseVectorBounds)eoRealBaseVectorBounds [inline, virtual]
isMinBounded(unsigned _i) (defined in eoRealBaseVectorBounds)eoRealBaseVectorBounds [inline, virtual]
maximum(unsigned _i) (defined in eoRealBaseVectorBounds)eoRealBaseVectorBounds [inline, virtual]
minimum(unsigned _i)eoRealBaseVectorBounds [inline, virtual]
operator=(const eoRealVectorBounds &) (defined in eoRealVectorBounds)eoRealVectorBounds [private]
ownedBounds (defined in eoRealVectorBounds)eoRealVectorBounds [private]
printOn(std::ostream &_os) const eoRealVectorBounds [inline, virtual]
range(unsigned _i) (defined in eoRealBaseVectorBounds)eoRealBaseVectorBounds [inline, virtual]
readFrom(std::istream &_is)eoRealVectorBounds [virtual]
readFrom(std::string _s)eoRealVectorBounds [virtual]
truncate(unsigned _i, double &_r)eoRealBaseVectorBounds [inline, virtual]
truncate(std::vector< double > &_v)eoRealBaseVectorBounds [inline, virtual]
uniform(unsigned _i, eoRng &_rng=eo::rng)eoRealBaseVectorBounds [inline, virtual]
uniform(std::vector< double > &_v, eoRng &_rng=eo::rng)eoRealBaseVectorBounds [inline]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]
~eoRealBaseVectorBounds() (defined in eoRealBaseVectorBounds)eoRealBaseVectorBounds [inline, virtual]
~eoRealVectorBounds()eoRealVectorBounds [inline, virtual]

Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_real_vector_bounds.html b/trunk/paradiseo-eo/doc/html/classeo_real_vector_bounds.html new file mode 100644 index 000000000..0116fdef2 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_real_vector_bounds.html @@ -0,0 +1,175 @@ + + +EO: eoRealVectorBounds Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRealVectorBounds Class Reference

Now a derived class, for parser reading It holds some of the bounds (and destroy them when dying). +More... +

+#include <eoRealVectorBounds.h> +

+

Inheritance diagram for eoRealVectorBounds: +

+ +eoRealBaseVectorBounds +eoPersistent +eoPrintable +eoRealVectorNoBounds + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoRealVectorBounds ()
 Default Ctor will call base class default ctor.
+ eoRealVectorBounds (unsigned _dim, eoRealBounds &_bounds)
 Ctor: same bounds for everybody, given as an eoRealBounds.
+ eoRealVectorBounds (eoRealBounds &_xbounds, eoRealBounds &_ybounds)
 Ctor, particular case of dim-2.
+ eoRealVectorBounds (unsigned _dim, double _min, double _max)
 Simple bounds = minimum and maximum (allowed).
+ eoRealVectorBounds (std::vector< double > _min, std::vector< double > _max)
 Ctor: different bounds for different variables, std::vectors of double.
+ eoRealVectorBounds (std::string _s)
 Ctor from a std::string and don't worry, the readFrom(std::string) starts by setting everything to 0!
+virtual ~eoRealVectorBounds ()
 Dtor: destroy all ownedBounds - BUG ???
virtual void readFrom (std::istream &_is)
 Read object from a stream only calls the readFrom(std::string) - for param reading.
virtual void readFrom (std::string _s)
 Read object from a std::string.
+virtual void printOn (std::ostream &_os) const
 overload printOn method to save space
+void adjust_size (unsigned _dim)
 Eventually increases the size by duplicating last bound.
+ eoRealVectorBounds (const eoRealVectorBounds &)
 need to rewrite copy ctor and assignement operator because of ownedBounds

Private Member Functions

+eoRealVectorBounds & operator= (const eoRealVectorBounds &)

Private Attributes

+std::vector< unsigned int > factor
+std::vector< eoRealBounds * > ownedBounds
+

Detailed Description

+Now a derived class, for parser reading It holds some of the bounds (and destroy them when dying). +

+ +

+Definition at line 228 of file eoRealVectorBounds.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + +
void eoRealVectorBounds::readFrom ( std::istream &  _is  )  [virtual]
+
+ + + + + +
+   + + +

+Read object from a stream only calls the readFrom(std::string) - for param reading. +

+

Parameters:
+ + +
_is A std::istream.
+
+ +

+Implements eoPersistent. +

+Definition at line 65 of file eoRealBounds.cpp. +

+Referenced by eoRealVectorBounds().

+

+ + + + +
+ + + + + + + + + +
void eoRealVectorBounds::readFrom ( std::string  _s  )  [virtual]
+
+ + + + + +
+   + + +

+Read object from a std::string. +

+

Parameters:
+ + +
_is A std::istream.
+
+ +

+Definition at line 73 of file eoRealBounds.cpp. +

+References adjust_size().

+

The documentation for this class was generated from the following files: +
Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_real_vector_bounds.png b/trunk/paradiseo-eo/doc/html/classeo_real_vector_bounds.png new file mode 100644 index 0000000000000000000000000000000000000000..229b0d335171875fbd5e70684ff3c774999b2396 GIT binary patch literal 1196 zcmeAS@N?(olHy`uVBq!ia0y~yVDtd853n!;$tmleGXg1z0G|-o|Ns93ng9PEm_I*Z z0+0p92M!#lKJ@~|o&uJ;1 z)BaRWGQM-kY2%V`_N0}p414acCUX$*K^M z#mGSo?n2&)_V53Esa;gx@r(WY;>Q}Dx1Y0nD;=B^v1O8GjJk;VLAF(FC!gGyk!#Y# z=52P}@Mrn`*ZbysZd-fxm8`7i)|a1HJva9XGI*LjwA#7i()&-TYran1==Cc?PX4N} zbc+D%{S%^BCO&y)WtVqg|5_IIw=G>PC)Hw>bKX9|n)_<;kz*%rDYOQhkcj^1Q&c=x zL~IKepVhP}g$X{q4IlHPy^k$Z405}=VW!L@=E*+SIj?i&uik4j@ytR?E0L`smAn2< zI2xclHA>X;>aC>{Ehnu>bPP1{E&pOS$z+*dbENO~lZ-}MTdR~Z`-JnY`&$zETgz2vU!zE@YY-o3k`kn?(jOZ=_7FQeV& zz1y+7w&kv{r^}DyN@6;ltlmiy645>sWnSq*FVo%S3_8>Q!Kvc6!K9Ubznm+qVuOw)MqQh<@lv+eMAg#| zT|6~Uf2a(UWD8yL*)?cO*~YIcFYmqbQqOhbIs1t*9LsjcP7YicIk|UbO14&(L42(Va zIL{qS<2q?+#^;>`Oh~X0z{Xsw@ + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRealVectorNoBounds Member List

This is the complete list of members for eoRealVectorNoBounds, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
adjust_size(unsigned _dim)eoRealVectorBounds
averageRange()eoRealVectorNoBounds [inline, virtual]
eoRealBaseVectorBounds()eoRealBaseVectorBounds [inline]
eoRealBaseVectorBounds(unsigned _dim, eoRealBounds &_bounds)eoRealBaseVectorBounds [inline]
eoRealBaseVectorBounds(eoRealBounds &_xbounds, eoRealBounds &_ybounds)eoRealBaseVectorBounds [inline]
eoRealVectorBounds()eoRealVectorBounds [inline]
eoRealVectorBounds(unsigned _dim, eoRealBounds &_bounds)eoRealVectorBounds [inline]
eoRealVectorBounds(eoRealBounds &_xbounds, eoRealBounds &_ybounds)eoRealVectorBounds [inline]
eoRealVectorBounds(unsigned _dim, double _min, double _max)eoRealVectorBounds [inline]
eoRealVectorBounds(std::vector< double > _min, std::vector< double > _max)eoRealVectorBounds [inline]
eoRealVectorBounds(std::string _s)eoRealVectorBounds [inline]
eoRealVectorBounds(const eoRealVectorBounds &)eoRealVectorBounds
eoRealVectorNoBounds(unsigned _dim)eoRealVectorNoBounds [inline]
foldsInBounds(unsigned, double &)eoRealVectorNoBounds [inline, virtual]
foldsInBounds(std::vector< double > &)eoRealVectorNoBounds [inline, virtual]
hasNoBoundAtAll(unsigned)eoRealVectorNoBounds [inline, virtual]
hasNoBoundAtAll(void)eoRealVectorNoBounds [inline, virtual]
isBounded(unsigned)eoRealVectorNoBounds [inline, virtual]
isBounded(void)eoRealVectorNoBounds [inline, virtual]
isInBounds(unsigned, double)eoRealVectorNoBounds [inline, virtual]
isInBounds(std::vector< double >)eoRealVectorNoBounds [inline, virtual]
isMaxBounded(unsigned) (defined in eoRealVectorNoBounds)eoRealVectorNoBounds [inline, virtual]
isMinBounded(unsigned) (defined in eoRealVectorNoBounds)eoRealVectorNoBounds [inline, virtual]
maximum(unsigned) (defined in eoRealVectorNoBounds)eoRealVectorNoBounds [inline, virtual]
minimum(unsigned)eoRealVectorNoBounds [inline, virtual]
printOn(std::ostream &_os) const eoRealVectorBounds [inline, virtual]
range(unsigned) (defined in eoRealVectorNoBounds)eoRealVectorNoBounds [inline, virtual]
readFrom(std::istream &_is)eoRealVectorBounds [virtual]
readFrom(std::string _s)eoRealVectorBounds [virtual]
truncate(unsigned, double &)eoRealVectorNoBounds [inline, virtual]
truncate(std::vector< double > &)eoRealVectorNoBounds [inline, virtual]
uniform(unsigned, eoRng &_rng=eo::rng)eoRealVectorNoBounds [inline, virtual]
uniform(std::vector< double > &, eoRng &_rng=eo::rng)eoRealVectorNoBounds [inline]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]
~eoRealBaseVectorBounds() (defined in eoRealBaseVectorBounds)eoRealBaseVectorBounds [inline, virtual]
~eoRealVectorBounds()eoRealVectorBounds [inline, virtual]
~eoRealVectorNoBounds() (defined in eoRealVectorNoBounds)eoRealVectorNoBounds [inline, virtual]

Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_real_vector_no_bounds.html b/trunk/paradiseo-eo/doc/html/classeo_real_vector_no_bounds.html new file mode 100644 index 000000000..217a19558 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_real_vector_no_bounds.html @@ -0,0 +1,111 @@ + + +EO: eoRealVectorNoBounds Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRealVectorNoBounds Class Reference

the dummy unbounded eoRealVectorBounds: usefull if you don't need bounds! everything is inlined. +More... +

+#include <eoRealVectorBounds.h> +

+

Inheritance diagram for eoRealVectorNoBounds: +

+ +eoRealVectorBounds +eoRealBaseVectorBounds +eoPersistent +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoRealVectorNoBounds (unsigned _dim)
 Ctor: nothing to do, but beware of dimension: call base class ctor.
+virtual bool isBounded (unsigned)
 test: is i_th component bounded
+virtual bool isBounded (void)
 test: bounded iff all are bounded
+virtual bool hasNoBoundAtAll (unsigned)
 Self-test: true iff i_th component has no bounds at all.
+virtual bool hasNoBoundAtAll (void)
 Self-test: true iff all components have no bound at all.
+virtual bool isMinBounded (unsigned)
+virtual bool isMaxBounded (unsigned)
+virtual void foldsInBounds (unsigned, double &)
 Folds a real value back into the bounds - i_th component.
+virtual void foldsInBounds (std::vector< double > &)
 Folds all variables of a std::vector of real values into the bounds.
+virtual void truncate (unsigned, double &)
 Truncates a real value to the bounds - i_th component.
+virtual void truncate (std::vector< double > &)
 truncates all variables of a std::vector of real values to the bounds
+virtual bool isInBounds (unsigned, double)
 test: is i_th component within the bounds?
+virtual bool isInBounds (std::vector< double >)
 test: are ALL components within the bounds?
+virtual double minimum (unsigned)
 Accessors: will raise an std::exception if these do not exist.
+virtual double maximum (unsigned)
+virtual double range (unsigned)
+virtual double averageRange ()
 Computes the average range An std::exception will be raised if one of the component is unbounded.
+virtual double uniform (unsigned, eoRng &_rng=eo::rng)
 Generates a random number in i_th range An std::exception will be raised if one of the component is unbounded.
+void uniform (std::vector< double > &, eoRng &_rng=eo::rng)
 fills a std::vector with uniformly chosen variables in bounds An std::exception will be raised if one of the component is unbounded
+

Detailed Description

+the dummy unbounded eoRealVectorBounds: usefull if you don't need bounds! everything is inlined. +

+Warning: we do need this class, and not only a std::vector<eoRealNoBounds *> +

+ +

+Definition at line 352 of file eoRealVectorBounds.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_real_vector_no_bounds.png b/trunk/paradiseo-eo/doc/html/classeo_real_vector_no_bounds.png new file mode 100644 index 0000000000000000000000000000000000000000..e57b3bc7e80eae6bc836804dc3cbf417f3e1c8ba GIT binary patch literal 1144 zcmeAS@N?(olHy`uVBq!ia0y~yVDtd853n!;$tmleGXg1z0G|-o|Ns93ng9PEm_I*Z z0+0p92M!#lKJ@?beE%S7a`j2?wI{djUY&B|?z5oXzwHG;Z#8!I@Z zXNXPGyg4IT>fj>P-LH3i+Wx-w{&|((*V4Xsu}^w-;VJi|cQXVXJj)8_2ATZK|7kUs zSN*c4>?Rw4;SPwQVQJE{kmjhZ_tKywpnIw+u1Cg z76xy7H1o+rD@(C0-0X9`Uzr%JV@)`8`rD+HnLejxh|Sg%l%JEb&u>pyP2}sRohhBq zZbWRkHRUCr^Rz{7YTH*$TDJYPaOSmC|Q+K+XvTEqV02i=XuoKylb}BGycSG>wT~9XuW-RMysW0~jm&2X=LX(t@ zWS>l&Evj<=J#&-Wm5H-eRjz|#tJNb&aZ*T!ifFdSJ$47(pNDQI?*7CLzkiXq$|3i5HSc%LE;n9W&^gKOs8myuG3m+T3v6~)CXt)?g&r<; z-mD_e()r=y!c66#rXDT*e1_{hYf3t@%cFlgm1Im)VFj85MD~6~o&8%pp761WdjAQZ zA*#~eQoJJ4si?PC8SFANmq6VM7CorFGBeOwrL$V}WOteQvhayMceboMTHtn7eQV(w zt9Os0bJ0pVYVLulP9WW6^A` zNn0c2K6-AsJw@wzwzMqY$J-{JbKBBydoP=O(`;7e)|GdE2kw5y=2^AdsKznmxMS$f zeV)H|9rlxWrR>hJzNja~iv^1E~E zw0>&MU3GX{pLN!`lK8E=4fl3EaosI_d9_E}79gi@;*;MVzxj_Ik9l8lcYz|Xm|*a9 L^>bP0l+XkKC_@dt literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_reduce-members.html b/trunk/paradiseo-eo/doc/html/classeo_reduce-members.html new file mode 100644 index 000000000..cc2085fb8 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_reduce-members.html @@ -0,0 +1,18 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoReduce< EOT > Member List

This is the complete list of members for eoReduce< EOT >, including all inherited members.

+ + + + +
functor_category()eoBF< eoPop< EOT > &, unsigned, void > [inline, static]
operator()(eoPop< EOT > &, unsigned)=0eoBF< eoPop< EOT > &, unsigned, void > [pure virtual]
~eoBF()eoBF< eoPop< EOT > &, unsigned, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_reduce.html b/trunk/paradiseo-eo/doc/html/classeo_reduce.html new file mode 100644 index 000000000..b39d0aba5 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_reduce.html @@ -0,0 +1,46 @@ + + +EO: eoReduce< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoReduce< EOT > Class Template Reference

eoReduce: .reduce the new generation to the specified size At the moment, limited to truncation - with 2 different methods, one that sorts the whole population, and one that repeatidely kills the worst. +More... +

+#include <eoReduce.h> +

+

Inheritance diagram for eoReduce< EOT >: +

+ +eoBF< eoPop< EOT > &, unsigned, void > +eoFunctorBase +eoDetTournamentTruncate< EOT > +eoEPReduce< EOT > +eoLinearTruncate< EOT > +eoRandomReduce< EOT > +eoStochTournamentTruncate< EOT > +eoStochTournamentTruncateSplit< EOT > +eoTruncate< EOT > + +List of all members. + +
+

Detailed Description

+

template<class EOT>
+ class eoReduce< EOT >

+ +eoReduce: .reduce the new generation to the specified size At the moment, limited to truncation - with 2 different methods, one that sorts the whole population, and one that repeatidely kills the worst. +

+Ideally, we should be able to choose at run-time!!! +

+ +

+Definition at line 45 of file eoReduce.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_reduce.png b/trunk/paradiseo-eo/doc/html/classeo_reduce.png new file mode 100644 index 0000000000000000000000000000000000000000..7738793759d6cafccded324aa1b5c7c262eae636 GIT binary patch literal 3666 zcmeHKdpK0<8ed``g$5gCYK*8T$)#~wLI^vAG=BThIIce&73jE8fob z*jAApA^-qvwX`t90>I`$*ro~z!lOMdH4lEt+F74A=kxin$>&pZbKO#4>&ru>QX^>m z5!e+7!rGn!jK_LBV4w+0Gn3O{CidGjfS75S_zDM-Iwy#|J`}qN5s5u-kc;>#rM|@E9*KuHe9I zB28fF0p9jLK8CxGoVpL?W+XDcM?|>i7ELc6p3-*#yD~f$E@D&-*Ba~c@O}dWoaSt% zwcmgPYt~V-YIGBWzZ4a!+m*B5V4%Z@PO}54gmF<%9=yUA-5u3iiAU2_Jc5%5^HJ4Q z!#SOZMs5L#zxYWSfp3hbO?v2bQE27N(x%1ZHQ#VAOp6rMk9M`#f%)o0g5Nvs*IZU; zSYWOA@!9-Z=FdU5I`NzX93sYvu$Fx4&NJF1`tPOTv+`a|jxU%)bv(VTL_t)*3%qk{ zrHv|zF;L0V?Nd)O(or5eYzk%YQd+oO+!`V+z^L(2RjtoW-s>rXXeX2~a(?9ro>qR^ z;GszID!*;H-xRu$KGn?;-H&psXA>{BRYpWYHv&QKI|E{%DDhh-4=kt~y{aUgeBhy_ zo~-WfOx4*FOlwcD*$r4A~r_n5r=3vGfxv zxd+L-Ab*2R->Z`~c4{g)G)Jy9D5TB%w5g09(V;VC?$mS8=QO30eNZqJvu$DpOf?jz z)-ZTsIS)_!H1_-?*dR6@aSj|_Xhyc}V!2&?(Xm^gafuI#zf5w7x7PjVN=yO=K?$jZ=5` z|H450>f8Q{_WmqOUSNr6ubdwaM1C=$2XEq&9{*e1nI zJ;NQ{=^;1nY?zN?>Z)VnfTjI|iMWkeEcK(au^CV+U8cKTLXxWX%_sUFp}ul@eI-1) z_oC3CZ+r*^Ssq<^OxV~#8WGcK2LfuQ5I_+l3JxAJ+Lo+o!*NG%SKF4stLkcZa4{%i ztgoNqTz`a*QCU9&+Bgc*dugPpGFIOuW}2{Hr#MmY{ZKg`XXNRrW#$fyiR zcL|A`Yf`M)KIs{|U`m{Vd#u9u zJqd>F(}5%DF!F)47BS`b)H02wMvdcVQCMVs(-Z8c9<44|@7*haFHIkQO@- zWpNUu&R)sKCuWT{=Ff8%x<4oBlQ7v3YNOe00RG^UibuKU6B*nQ@gg*$5TT7A z3a+aOdxG-A3Z2ckShl1GD9@&yj}_cCphxa#{vrc%gTUPF8I{iQfmilL%X+91tbpvC z<;8zP)}Pp`HdR7tN0!*B6Mnys`J#pZE4k0`ITE<&pc#n|gV|XaOs#`kwq>n$SX_qd+l&Hpd?Un*ufHom4? z${&q7tT<-eh>FW-XpZjFUAnc?L@~$oi*GcGE{&1gGj!FgEiW$4|LdIEAtZw`n-pI~ zD66@a-T!I!In!|}{=y5)?w-2X<40cHi8?ddVz8p9)2j9SMD0_D5f0{t5az|c&-%}cv>x~80_D@9{5DancY@}9EjI5BI`%@fi(zw2%q9T)rxSxcF8 zurfHA80sOEHTS*gmRHLEKsqDEGHTl->K)7z_bH&&t-(-z!g`2`pW z1A~jhS#|0YlgRc~onK6f@VEi*r0A`TGma38!*VPLFrv8B@X?NCTy9ddSJi7n4FlI@ zD;>wgP%ok8_ofiVoJ&`_arln1X`^OeP+V`5_!a&^v10k>&@6^e%Iv1zR9v;_svke{ zQ10VIx0uJFp_KhN8-*TX*6??Y{gAWjw9Yqd>%TV;rHE?>4 zu&Ufl#t~#dSa}v|` z^PJ*qFzV0cgw={~OP+UH4H{X^x!U5!I!NwnbLG(Jnl9i9?HS?12q9e2E17nct^~$Y zjND#rcZ_{04)oX=;^X5WS|C5m zVx>%+KT^w|Aw0*oX7kHHDc6MG~(b`QO~T@T!peWiQLk-GWYc>_hYli-d7S-5c= zYuqbx%v5r>MI$>d!&Fjoz~G#~Uv=2L-4fN+lJ61aNpX4-nxsvNJR|k`y)DVj`_17W PK)}-6)~w{H+qHiHV>HBr literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_reduce_merge-members.html b/trunk/paradiseo-eo/doc/html/classeo_reduce_merge-members.html new file mode 100644 index 000000000..f21491725 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_reduce_merge-members.html @@ -0,0 +1,21 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoReduceMerge< EOT > Member List

This is the complete list of members for eoReduceMerge< EOT >, including all inherited members.

+ + + + + + + +
eoReduceMerge(eoReduce< EOT > &_reduce, eoMerge< EOT > &_merge) (defined in eoReduceMerge< EOT >)eoReduceMerge< EOT > [inline]
functor_category()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
merge (defined in eoReduceMerge< EOT >)eoReduceMerge< EOT > [private]
operator()(eoPop< EOT > &_parents, eoPop< EOT > &_offspring)eoReduceMerge< EOT > [inline, virtual]
reduce (defined in eoReduceMerge< EOT >)eoReduceMerge< EOT > [private]
~eoBF()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_reduce_merge.html b/trunk/paradiseo-eo/doc/html/classeo_reduce_merge.html new file mode 100644 index 000000000..8780e4e89 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_reduce_merge.html @@ -0,0 +1,59 @@ + + +EO: eoReduceMerge< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoReduceMerge< EOT > Class Template Reference

eoReduceMerge: Replacement strategies that start by reducing the parents, then merge with the offspring +More... +

+#include <eoReduceMerge.h> +

+

Inheritance diagram for eoReduceMerge< EOT >: +

+ +eoReplacement< EOT > +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase +eoSSGADetTournamentReplacement< EOT > +eoSSGAStochTournamentReplacement< EOT > +eoSSGAWorseReplacement< EOT > + +List of all members. + + + + + + + + + + + + +

Public Member Functions

+ eoReduceMerge (eoReduce< EOT > &_reduce, eoMerge< EOT > &_merge)
+void operator() (eoPop< EOT > &_parents, eoPop< EOT > &_offspring)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+eoReduce< EOT > & reduce
+eoMerge< EOT > & merge
+

Detailed Description

+

template<class EOT>
+ class eoReduceMerge< EOT >

+ +eoReduceMerge: Replacement strategies that start by reducing the parents, then merge with the offspring +

+This is the way to do SSGA: the offspring gets inserted in the population even if it is worse than anybody else.

+: eoReduceMerge, eoSSGAWorseReplacement, eoSSGADetTournamentReplacement, eoSSGAStochTournamentReplacement +

+ +

+Definition at line 53 of file eoReduceMerge.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_reduce_merge.png b/trunk/paradiseo-eo/doc/html/classeo_reduce_merge.png new file mode 100644 index 0000000000000000000000000000000000000000..5d7cf339332530c03dbe2712c052f1cc9e7b39e2 GIT binary patch literal 3232 zcmc&%cT^Mk77i#_f(U{EDYBqE+JFQ?DAJ?|5(H^Nq$tG!B$P;zj!TD#plbpI5rZH_ zA&aAc5h)@;2*F4Z=}J?I3NEaG!MvdBo_+6}ciuVgk9~j4%y-Y7JM;V9?|%2rWSp?E z*tJt)CkzJLb|(BBs^3Txx}d- ze?otmPs1?HdVn3;;}7KftAA@W4s2#96KTDGCOv(^TAd)- zbazR~JJB|x1&CLf8cgW`=-OEcwDyRGQLkHh^Hn8dUG)YaZTj~|ZC#CnzOw@{f;_Iw zG3QRP?WF=t4PhybS2)C^wmUn-Q0wDRp_et1urzADD&ADx0eC8udBpX)Z`6EIMF(0p zQhR)vH=?hOP#T=)5cb8bek2^i``ox0RDvYfj*bHZKB)^ioxp&O+c9tlSSi6uR%o>P zoOD_5Xfl7(=nVIzm3gaHkN{r5)tr=qHPQBo)kev{K0|1NjL*z!Qy{4?Jg@HQrspWiQ8w8(VN#*E@QRC-8Jd3RWD; z3n4K(HG=#}t#rT@L^{dj)FQk|U!s@om;u(G((^AUQi+*cye?xA))1w|%=VHJ9xd7q z(1#{LQ_mh@33Wr(1)~j1hbt(_&fQ;7)Q8XCYOQ5;#CmvtkPom>;P|Ns zP)eJ_i9OEBCQvNd0(_|EQ5ugig@S!%RrXS_hRiKcgOrP&)pBko3n)r$vP?FHV#WWx zA~>Q`t$t|6&+H@ccNR5arHa+~wjSaqc|X2UMN+kBn^v_8&E{)t97TS)*o9^9D= zHrmU0CC*KbQO*9ZM+b%urGTRME{N(Af8Z-fZhpgIVFTcLRax?Twlj5xC*j|y?&iOdwHv=q7)&8^tu4PG6uV*%nX!F>g_nLtH_l~)ksTI1Xa>#ijmB{8vN zCO8-ZXC`{8+!F}bzIK429{jsfob-Xti?!6gC%`4ZDAlTuirg3(l{WtR*i!Ti7 z*~v5+621>B-gX53Q?$_E2M#BF4USqj-lUv!T--nPUwI$XA{3kiN~W%Z1p9+F{QqAu^w76V~K30pZR)DEn_ib79WoqtD6eRu0!HTy;iBwMwx!vC2$fTJFP&fLUWYNFu& zTxlQtYrSu>ww|rW&5OjKV*Y_rCMtPLwkHFe=0A&stK$$4kCX~yYqIWwIv-iw- zmTnat=*OjdBLWxDlAXWp56u8~bd;^(6q|hC;4Br=npzBsJ^c{^+X|+wA+`)Y%qQyO z%Nhs>K6V= zp7Ho;D5MkIQm&k!P%&wwX&6a~u&#$|d$rosAL4{|z4q!x@~;6)VGRA=s(MPxMZ4d7 zC2Ykiy2;EvP73BiE7bgHJp7en;7AA7t>>CxiOJtvGN8jE`%Q+oLDs7c=gbxe$NpAYG-mf_j#u06xv>0Y5sJ?~UGgB9M0D+-+} zkK;FRhT)h3>{VAcK^c5IVz1DOJBWR7F+2H}h1aQ(2hVlN1m(pj&|34bKK>DmP$*d< zuQ+NU&RTw?!L-QS=`3JaHD@X}B(J^M6d6T^-5$Gt8NfgbqF5^zhBrPpV2l`( zp5IkT3v?Qt_eiL9jo$Di+b*bs6`(2TkI>d+DD+@A?$mr7>K%sboJY5|a;` z!Zv2vA0OHG3FjwulxX~+nC8M^tR<_65S48kPd0XXK$JNH%#PPdDiEcww&>)zmgK1i z#tUFp)+mdPD<8S7vZZk0HT%Zdw}Y(s2F3ZqhHQy2+m&sY;K&{t1$*iymKTMAqc9hn zEZL~aQWav=x6dhMSA3QVsoL?c1;36@& + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoReduceMergeReduce< EOT > Member List

This is the complete list of members for eoReduceMergeReduce< EOT >, including all inherited members.

+ + + + + + + + + + + + +
eoReduceMergeReduce(eoHowMany _howManyElite, bool _strongElitism, eoHowMany _howManyReducedParents, eoReduce< EOT > &_reduceParents, eoHowMany _howManyReducedOffspring, eoReduce< EOT > &_reduceOffspring, eoReduce< EOT > &_reduceFinal) (defined in eoReduceMergeReduce< EOT >)eoReduceMergeReduce< EOT > [inline]
functor_category()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
howManyElite (defined in eoReduceMergeReduce< EOT >)eoReduceMergeReduce< EOT > [private]
howManyReducedOffspring (defined in eoReduceMergeReduce< EOT >)eoReduceMergeReduce< EOT > [private]
howManyReducedParents (defined in eoReduceMergeReduce< EOT >)eoReduceMergeReduce< EOT > [private]
operator()(eoPop< EOT > &_parents, eoPop< EOT > &_offspring)eoReduceMergeReduce< EOT > [inline, virtual]
reduceFinal (defined in eoReduceMergeReduce< EOT >)eoReduceMergeReduce< EOT > [private]
reduceOffspring (defined in eoReduceMergeReduce< EOT >)eoReduceMergeReduce< EOT > [private]
reduceParents (defined in eoReduceMergeReduce< EOT >)eoReduceMergeReduce< EOT > [private]
strongElitism (defined in eoReduceMergeReduce< EOT >)eoReduceMergeReduce< EOT > [private]
~eoBF()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_reduce_merge_reduce.html b/trunk/paradiseo-eo/doc/html/classeo_reduce_merge_reduce.html new file mode 100644 index 000000000..cede0028a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_reduce_merge_reduce.html @@ -0,0 +1,68 @@ + + +EO: eoReduceMergeReduce< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoReduceMergeReduce< EOT > Class Template Reference

eoReduceMergeReduce is an eoReplacement: - saves possible elite parents - reduces rest of parents - reduces offspring - merges reduced populations - reduces resulting merged pop if necessary +More... +

+#include <eoReduceMergeReduce.h> +

+

Inheritance diagram for eoReduceMergeReduce< EOT >: +

+ +eoReplacement< EOT > +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoReduceMergeReduce (eoHowMany _howManyElite, bool _strongElitism, eoHowMany _howManyReducedParents, eoReduce< EOT > &_reduceParents, eoHowMany _howManyReducedOffspring, eoReduce< EOT > &_reduceOffspring, eoReduce< EOT > &_reduceFinal)
+void operator() (eoPop< EOT > &_parents, eoPop< EOT > &_offspring)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+eoHowMany howManyElite
+bool strongElitism
+eoHowMany howManyReducedParents
+eoHowMany howManyReducedOffspring
+eoReduce< EOT > & reduceParents
+eoReduce< EOT > & reduceOffspring
+eoReduce< EOT > & reduceFinal
+

Detailed Description

+

template<class EOT>
+ class eoReduceMergeReduce< EOT >

+ +eoReduceMergeReduce is an eoReplacement: - saves possible elite parents - reduces rest of parents - reduces offspring - merges reduced populations - reduces resulting merged pop if necessary +

+ +

+Definition at line 49 of file eoReduceMergeReduce.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_reduce_merge_reduce.png b/trunk/paradiseo-eo/doc/html/classeo_reduce_merge_reduce.png new file mode 100644 index 0000000000000000000000000000000000000000..b8be9154acb6b02ede12bcda76cf615bb7b65ab3 GIT binary patch literal 1886 zcmb`Ic~sL^7RO^X5Fw=jkzf#}Qi#+n zG9oGjA_}xIV3afv6HJgufZ5_5{#lyJw@>~L|}8P&&DssV9r1sVS( zXEJzk-bb?Q5PH%n75pq21N0r9y>t~FdULmWIo%gbaoyLHE;U+|TWK`=Pn8hi4)iQp z>u)akg|x2ffytXix79`IPp?=)rX1(GI0}!G{WT_be4{yCvBWOf|NOqi^3)up6+T}X z5ExGp*VpOumM=E$#gaJnS+XH&8g}dUXCa@)z<|!-s-{!X-KaC_hnL2&f(a(^U@fB~ zqeI~LbI;$XPK&R^3qetgkzXp^3({WaGEue}A~#e|z~>*Uv!iI!(kAednucsr#eUv1 zW=6!XA4+s{Qz9dm;=04I8VK_zGJN`A=`YB5ZbzYrbNVsGS(_>P)&g^Zlz3dTcN_#L zMpFI(p(a0|ca7ecXvq#>#}S#Q5#;w{5Uxvz|G1di<-v@Oy|3bSKaDC)Vq4Qf*(r1w zjdFLO5(n!E9*U!hlDVi0$m=wUZ(m9M4~=>uirPOUcaBmorA2hx_QK>84Q&bBJ2h`A zblf>hUT!8Sv`Y&0j^0xfb7+pkjJ#DWi*{zdP`SkRh8I-bMKHKv-la%TGjKN@&YD zr(&a?JO&&B;juN4s-Sf*XQG=uM#)7t{M%a_qcZi;metoE>iad(MHZnJdkTgY;lR-w zByv`2-iVaS0)c%zfzzjVY@yw;Ea+TtZ*Y03{^(C9=&9P1_I&eQ(idTW-w{Aww^8Es z{6%lWysPj>Ej#l#=9bER3i(%=z7F^4hip_0g7Y#56EAFWxOc)1#Wyu&!-mYD2}Ko; zL)r-V@%i9lB<|QE#WD!mLgX8NvfCb2KAvHUTbZ-sF<*6)+znfhEbniQHTFS6gQiof z(3;%J;8=jg0(#rD5dk?ooR7`c^M7D&IZ~+XRkK~g5W%vr?#!h`44DlLXD1Qwx>C6`4EX>W{64gc85KI@U-+o zp3z`RG0`P;#Oq%@@eZ!be0g5D%K3cPaM_`PE(T_n|m8TX$v*!E0~a0pqQD|}H? zS4xYvo=bzHs-w<}jOra}v3~)tub=)=XyUgepnd*~@r8`%&hF+baj*QI>#v?I&WHwpiwI8NX+W0#)Z;xwHROSeK5LIRG7@Qui;3__F(pgZKU4UT zL011W!ZlTz$0#iyDpk5ogsF}1_cO<`dZ~bvi(jk=F0f&k*d#Zv#3&s`Hy(&i6%H;d zDg-*+69Hm-^H-BNxj?d1+O}N0T!1-(KS#Q}zw=yP z91nXL@18U5|X74u~<`j708ivLx=J%o*kjY(*SyYF&*y^!9;TBRTv+Hqo^M_e{)cW#{2s+}8_PXa0e(|5V2*x!4 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_reduce_split-members.html b/trunk/paradiseo-eo/doc/html/classeo_reduce_split-members.html new file mode 100644 index 000000000..5508f3d30 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_reduce_split-members.html @@ -0,0 +1,18 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoReduceSplit< EOT > Member List

This is the complete list of members for eoReduceSplit< EOT >, including all inherited members.

+ + + + +
functor_category()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
operator()(eoPop< EOT > &, eoPop< EOT > &)=0eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [pure virtual]
~eoBF()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_reduce_split.html b/trunk/paradiseo-eo/doc/html/classeo_reduce_split.html new file mode 100644 index 000000000..4ca4f5ef9 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_reduce_split.html @@ -0,0 +1,42 @@ + + +EO: eoReduceSplit< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoReduceSplit< EOT > Class Template Reference

eoReduceSplit: reduce the pop to the specified size AND eventually returns the eliminated guys +More... +

+#include <eoReduceSplit.h> +

+

Inheritance diagram for eoReduceSplit< EOT >: +

+ +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase +eoDetTournamentTruncateSplit< EOT > +eoLinearRandomSplit< EOT > +eoLinearTruncateSplit< EOT > +eoRandomSplit< EOT > +eoTruncateSplit< EOT > + +List of all members. + +
+

Detailed Description

+

template<class EOT>
+ class eoReduceSplit< EOT >

+ +eoReduceSplit: reduce the pop to the specified size AND eventually returns the eliminated guys +

+ +

+Definition at line 42 of file eoReduceSplit.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_reduce_split.png b/trunk/paradiseo-eo/doc/html/classeo_reduce_split.png new file mode 100644 index 0000000000000000000000000000000000000000..daa60cfaf8fa8f08a1d71d1620e737f2c9583a08 GIT binary patch literal 3224 zcmc&%X;@Qd7LK**6b0KtqymAqTF^^@r#37G2~xdAia>%PAROcY(X*XZ1^|E8Ci_6~~N^b^t3 zhZpzU8?YYK;$1_uKKg5ZiEE$go~YfwVl4iw-KxzwiwiAKv(`p3h*h^=mUpYInXOB` zm$r~*gFXisQKj;`rCV+lKvsoN-#JG91qRs^NZtkm2E1@(pnVd50>@g~926{3EYowP zE&Arc##ohOoOJxeOpJ>EB4qqZPfFG|K7?cO$H2}h(sH={U;;Z79NSYI__THXV9CnR zPDMDY|45=NC=t*To(7&&=GU!7^7>sb&umhju&CSxE*IVqeP)iNHGN3`g3=$~&<@lq zcoxE+=i(Y9Jc`IBdh))5N%KI%^XRf;0^yQDs2vV0pzQ;9+2wM}OJ~+A7E0y{WevS< ziilvsnD>#k+&QtmFS@ZiD=00rQhRv*;FmYrd)Rv7 z=?z{rG#=2yG7pwexFOQ}ZeZ2)HncCAn1nYqCh>3AH~(Z-nNbkN@2`iWt7A}p07GQJ z4exKg4PeT`og_5v?!;7Q_n06;`u!5;w!q48%y!y1x;_SP!nt}=P~V;}jNakY^J#9F^7=Rd@jG)=L%5h-{(UE6&@n$=>A7hDee6pfth4h+mzhF)}b18K9M?FS6a>;lS%X) zy>>;7jL_!!_-Do8Klf?}y5b#~QW*GR9FQ>>X&g)1q` zYV}R#HQ(QN6v$L@@sPYFa+Sr{D%={9^@5X~6Xr(1?auFROHTIcVIQo0$K7vU%8{vg z#%3sg-q2{{JEoeKzP5^=S2C;~tw22co`yhdC!-KMnf_}KKWzHnw-#1Z==^SD9@VVQ z`;}9&vzd2P-$@_2D#+v=dBR81DkF7*#i1iDi;kWyPiB7*K1quN82tGtu>97iyt#Ugm0({3l}IqVF8UwD+&KoHUB6*fW6YGiW9{GXh9E7l zDp7*#u-RZP&9k|TY^OWtEZAA3Rzg$UuhGFv)D)WnD9J+1mA6_7gg@fpaMyVdPFZ(` zF_QLzGTY(-Kj|N&Mk|h*@E4oBF#K2BI;!jx?<2OAZh6tw)N}{)-iav!VW{r>pY7_O zphMur3YY?->oi1GCJix!CK@G0yek^(iNIv${UkJYxmdH#xLH=btWcwRO5t{B8T5p# zjT^@PmcLk|TgRsNFRvP#c8_Z?yh$li<&t^ zqrMOvn6|>zwjh4EAmu`>XH@1h@$t6vl`-Q*5ZmRxBeGr77fdiFbyen8pDp+?^x4M> zlPWNyT%P~B%_#7Ls~(gRQxbY$y?PQb5mS#^37j$Cg45Up9%R8Xl(8g$Nwl#iNy3T) z4}d4_nZgaibsM_Hi*@oLrmYle0Wt<8!qkLB>arLdMaftyX7qeKK_!3BbjLJ5Gv9AB zz?gRfPqO#G(orQ@X_v)#?++qUyYkBpyHHxZKYcre8=IRd3=x072Gc;J{#fxBL=z4? zDYbkH|5tN+X>@IpA^DI4s@mWhJn^%4Femc;*E}>-ATVUqPVb79a+oYGzk$@>!Q?j} zOtd%PTg#6Wh_~PyOZe1y3&L(+fw(`oeFehD%d430SpGi~dUjsCJTKMvwl z$>pYGXTP)Q)>0RB$H;10GP53(73oJdN656x-Ps1p+&IpWrLqYl%7Gb%L~qepuOy)5TQROLg%n-;#38Ow%5{H&o>1HTfg(=qYw;xX== z5Obkd>s_ulwLtr7sXq#@Vfn>L6H5CfF%mkztlN<-82_=(5HQI;tA7R#i*vx48hFz>Qo;ZVhzZq*0AFao0%sT_M_s9#P z>59=*e~Bt7qU$@){rcFaRGjEd+2Dsb&B(WZd|FN+XKW~Dobz^pKk>+o^tK4FZS^!A zKQFw_D1%P}3Wm!ojW1*fV%c1cLw8ziY|jq!>%^KFb~baS)9;$=Jqq8Spab@N;bf~( zF|c6^MX$5gzRp?(JlR2#gcU$C^t`E;b-+uDG$NV@iRvNoAu#tYpmtiHWM8XnkvQ-;|vEy5yc#f}NbK+|I&e!yA{dKmf}?t)j%n&Yi9Ty?>f4gjn8G?<=pH*R9Ws zg(h@S6X-c73Gc8!J7=TmSeIuOa17r&jst1xk)km#S7W6YRoXs4!%2&sZKr9pnyFTi zKxKJ2b-S;CAWa*S)1MYM6Zi^dw9|0%zKCFnz@*7sTC~;0NmHFj6~79(eoCH?hD+@n z78tP$*&IJ&mpO^WSUy;CVV|yXbyZ8UWzM0GIG3+7v>zaq1c@1d`3CeWfKWj4EhybO y=ijF9?0+0n^^A7(l-MZjDdvoU#Ky>MIo;@(%(Ek2a{~U2K)8cmyDPs5IrUF;`baqd literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_replacement-members.html b/trunk/paradiseo-eo/doc/html/classeo_replacement-members.html new file mode 100644 index 000000000..8a9abd876 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_replacement-members.html @@ -0,0 +1,18 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoReplacement< EOT > Member List

This is the complete list of members for eoReplacement< EOT >, including all inherited members.

+ + + + +
functor_category()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
operator()(eoPop< EOT > &, eoPop< EOT > &)=0eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [pure virtual]
~eoBF()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_replacement.html b/trunk/paradiseo-eo/doc/html/classeo_replacement.html new file mode 100644 index 000000000..5c68ee652 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_replacement.html @@ -0,0 +1,49 @@ + + +EO: eoReplacement< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoReplacement< EOT > Class Template Reference

#include <eoReplacement.h> +

+

Inheritance diagram for eoReplacement< EOT >: +

+ +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase +eoDeterministicSaDReplacement< EOT > +eoG3Replacement< EOT > +eoGenerationalReplacement< EOT > +eoMergeReduce< EOT > +eoMGGReplacement< EOT > +eoNDPlusReplacement< EOT, WorthT > +eoNDPlusReplacement< EOT, WorthT > +eoReduceMerge< EOT > +eoReduceMergeReduce< EOT > +eoWeakElitistReplacement< EOT > + +List of all members. + +
+

Detailed Description

+

template<class EOT>
+ class eoReplacement< EOT >

+ +NOTE: 2 eoPop as arguments the resulting population should be in the first argument (replace parents by offspring)! The second argument can contain any rubbish

+--- The eoMergeReduce, combination of eoMerge and eoReduce, can be found in file eoMergeReduce.h

+The eoReduceMergeReduce that reduces the parents and the offspring, merges the 2 reduced populations, and eventually reduces that final population, can be found in eoReduceMergeReduce.h

+LOG --- Removed the const before first argument: though it makes too many classes with the same interface, it allows to minimize the number of actual copies by choosing the right destination I also removed the enforced "swap" in the eoEasyAlgo and hence the generational replacement gets a class of its own that only does the swap (instead of the eoNoReplacement that did nothing, relying on the algo to swap popualtions). MS 12/12/2000

+

See also:
eoMerge, eoReduce, eoMergeReduce, eoReduceMerge
+eoReplacement, base (pure abstract) class eoGenerationalReplacement, as it says ... eoWeakElitistReplacement a wrapper to add elitism +

+ +

+Definition at line 77 of file eoReplacement.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_replacement.png b/trunk/paradiseo-eo/doc/html/classeo_replacement.png new file mode 100644 index 0000000000000000000000000000000000000000..31920ddcbf3a1bb89fe7affe5923276b137d554c GIT binary patch literal 5255 zcmd5=d011|wnr_XB2Fk$2C3KSRR${v5`mMpXk`wff&?@wVq^>w83IXAp+y8lK|mBd z4*^q@p~xgMB#4kQ$WbF>APgY}WC$ccCLr%bUwi4ht@qvgeee6;ANkH+YwvS*_FC)r zTfcK+og9y-uGUr!drcq|V2N$n$|}`AN4{nMpe%QB6f#Lv6_gEs@XF_~ro; zjx?G$DEN{%B=~BeWH~TRSntRYn3C>St5`k3@FU+k5XpUWuQ>$J;a=??Q246N(!?WR zT^g>F`ZMX66wOGmNP!}7XD_Nkacx6wTw_L`8|ER7%o?qDR3tSq#3ZViMM=m;Qy{oSsqX0z#Q zGcla@ojj;IF;iNLqv|M7EDaEq7I(efpZKMjCqVa~ddsSX>5a@<%1>2dXLAUUBARm7 zTn+}k>XmreB1-CQskRMtv z-I6_xH=?QnK2>GW`>6?ZXy8S-fN92RWQ8>WIJIV@%2ok$a7+C+#};bAyi`n**Kn&! zq-vaL{_HI2t$3pGE;nY6gRD(O?>M=xydb4#S{%<2l&kR^-_5tGw795yyX#$pR;NN+ z<^z_VwF(Yk^ zC7qPrqzYLICpQs&uA&U4@)UtG8bw|7ZaIh^IHvMPXYW<&TrIC6Hgb;TAHylC!L{O+ zgG<()m5i$-#?U=dDL%v7PP9$vjX0{S#^twLK8hO!AAfK& zIyv1()2#keeQ`wH(U#N%5a4U<9wco?k3f+J6jIr?u5UW!Eq`fk#AzA zqabKTf?uX1D!nKazY&&0BZ4_TJ3EpPfw_l7zAcfSI5>rsNUuVhy@dpPu<@6qxxF|X zUn&{~00v$**LfraF^j;qHc%Si#LT_Pe`;~4LaoMTVB#0V1ZW&R#CX`pbvUnXTHD%~ zVF$38P-2dNQ0>3v1}YA*Am}t>r2^>~Su;E=jRYh)k%crg9jdDMh-{9iQppa&A?*Z5 z?oIyC?)@WQnk=5Up&v}X$Q0O%;1I%fcug?9v}ikhU&IAkmdPio*BVTHtw_*;r`No< zTDs^n<^Gu<$CZ&5XZwx$P;-QrrHimTa|01QfOnsATLI&tSDn~FqcpStnS$wVR1cA` za?~qO+?3FQ%s1M$reAvt&lNAqXlemSEZGUfU_kn7DnF_SBubv%C>t;qm5REtBN2(H zDyEoO#k?Pw9jgAl?7RM9fziUyw&1Sy7|PE1DH9-vE3%A2VeSm!w<4wEWx2~tEQRap zlzEa)z*Lll*!zGaIUDO#+o%XWV4Pd*=IVJG0tT9-knETFdlO3EIQRt?Q&Ud}>dzO5 z?tH;od!Ml=z6PUWeq6BY!c;d;yg0~;*CICVE1y9j3-2W~vJBbM5j1d->fz_W zNSF6?lIua24`HK&EG)TO)pOj86=Id<*tjch?SkOV?ghLOF1{kGq>*{le|ofl&Fy1O zixBDkLGu~)Edr(};%#ozxFBpypj|H08sb4Q;)1;b=4(#gFYCO*UQvWEv^vwx|gAaRGDum9vii&dstPXVKw&{aq&T#(y0lIx^z-<0z zVy)GEXy5hi9ak_WzKS648wN%21Y0m5(CHyM8o9YZ=naC(h(+6kD*M!w5|@|6!ubU_ zS{mmsU{ef|%dSD8cTK1|ctzJ%bRE}RpFqBtsUNfC=w`Z915v&l-k)N#9Av(jy=OAD zimvb{2F%O-5he=XbmD8Y=Dp$tB8keqp0l zPVoR^=mf}knX)NwW0Xrk%^T$d$0?IwxwU5QTS0oB zm%V;gGDxyW4Y(!uxRM+@!z@`Y3c>t?JTr+|ZR->*(YS0ku8YOZhJnV1fX{k3uRjQNlRxj#RYeDPJO^4}qw zk=Xwcv+!|#%k*IQD@{?f=aqlf6aVF~PI3$2!cyRup)7Bafk3aD3G36Fm zz~@f~P8IIAG*XW$QZC!i`RH;1D@QK#)00mIrGM~v-ouT)5^&w!8*;DXJ}H&xA09mB z=(tCZ7vwMUFeIZb$QM|v0gTr^@KiC^2kdP}(PwP9&ol?*!9EWdCaVBkmq77xIe(d01)`?e9m z0l=YcBzdgP&rv@1e|8%0{_FwzuYkCu4*y)3{ACgXkvP>!ZkgHO!ko@*j2}!EO9At+ z54*=nTe2tqYv)|znUwBUjwa6TQG14O;lOoNTnPB}<9f=$JaSUqbTTw^ur)6&4i%>a zGDcFI4y8PO$4bc3Bb9x4&B5ySju>ys6?xoM0)vx{obKqP4auW|3+-jPQ#=+sPPZd?=K_# zzg&4uO7IOt7AXpuxQ{#zbJcG&u1&}4f1Bac`8@0LM0{7utt8;B(Kf?@_#zs&rFxJ- z*JN1r+TQNctm2OdGJ7&arC|-+^|?j{n=!Tt2k3=6zy&(1@^zXHol87DW8Xm9Q0y^l4Oo~;@5?#5o_n#QgarXJ63bGUBfZRzH$Pmg?JGy?@_ zVriqEsLQAf$L9za2W46ZkvX6nSl-yu+O}A5>IUu_^@GTn3;9+NNsh2cmWnd&e}G#BiP)wHs{cRX8*Om7 zNWbnXF^T$A;mDNDVsnr-ZMRrYCFm>p1Z{(SLVLLAx*Y#anC{dSq8*W5-`yM#DE^8e zY;b@V{Z=%E{RG(6x1 z1rvyc@NAYDu~3cosGW_!OuLo8(HSJobOY~)80Q|Lxbw%)FP@n~5H*r$cgLqs-&q0l zKWxXYave3#x-YRG)gwFU2tt$ExYOk)Mq){mAl2DxrEB_dzWrNQ=Xu*vknoJehf$oN zmaVgxx{!ddd6fIsr@$C4UGXt7WFv>0q?fRnikYzsbiTO3u# zrS7dbv`GbqwqW!pjhrSs5IJIe`Nj(;XSWBb?mKR9UIK}CsLuSv=lfRY%~Tmm$De0K zhRkwOub)E{Ln+kAxoNznM~5nVLNJX#84&v)ur_GTkjLNkX~8+X(1Mz&pGNg|k#FI0 z5P3WSe`+nP9)^rzVRHwdpAFtQ5JP&zW?9%+lcH`MVPVmCeY1&q`{C&udb2IFP{7Z*2X|kEc?u`eZmv(GXe_%$S}WtM zBWgTurib$p$LI}_3MFcAlHLp$N8i$O>MwP;31(>{DTK8JVW9xD9)%(edlg$4 + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRndGenerator< T > Member List

This is the complete list of members for eoRndGenerator< T >, including all inherited members.

+ + + + + + +
AtomType typedef (defined in eoRndGenerator< T >)eoRndGenerator< T > [private]
functor_category()eoF< T > [inline, static]
operator()()=0eoF< T > [pure virtual]
result_type typedefeoF< T >
~eoF()eoF< T > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_rnd_generator.html b/trunk/paradiseo-eo/doc/html/classeo_rnd_generator.html new file mode 100644 index 000000000..1e1432aee --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_rnd_generator.html @@ -0,0 +1,47 @@ + + +EO: eoRndGenerator< T > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRndGenerator< T > Class Template Reference

By popular demand re-introducing a base class for a family of random number generators. +More... +

+#include <eoRndGenerators.h> +

+

Inheritance diagram for eoRndGenerator< T >: +

+ +eoF< T > +eoFunctorBase +eoNegExpGenerator< T > +eoNormalGenerator< T > +eoUniformGenerator< T > + +List of all members. + + + + +

Private Types

+typedef T AtomType
+

Detailed Description

+

template<class T>
+ class eoRndGenerator< T >

+ +By popular demand re-introducing a base class for a family of random number generators. +

+Derived members of this class are useful to initialize fixed/variable length genotypes that have an 'atomic' type in an indepent way (thus without employing any knowledge about the problem domain).

+See derived classes eoUniformGenerator, eoBooleanGenerator, eoNormalGenerator and eoNegExpGenerator +

+ +

+Definition at line 47 of file eoRndGenerators.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_rnd_generator.png b/trunk/paradiseo-eo/doc/html/classeo_rnd_generator.png new file mode 100644 index 0000000000000000000000000000000000000000..41706d7c98816847705ef5fac2a6902221ab14e6 GIT binary patch literal 1363 zcmbW1YgCd47{}kzbR*4KIxW%ZaoVbNGm}zbc{@rc(C|`fWXn>@^$KbM14*-Hc|j&V#csK`UchgoL9o!Xs1R~qU6>VnXG9zv&MgHZ$ zFGe~x=IP-TL1q+db1d zCT6UuF0ECyt`PcBB)PTAM8-AANKPX7bNhq?k&e((fzE8pLg^`bMzT@A3SyJmTRtve zfMx~?Am`G-JpMXLP*l?o%c$axUAV_Og+lSx%7GmLKF}7DrmlXDr$l+wc}?x#da7+B z$*%FZx|wOljEKm2l6n|k&=N_$d8H*Xer>7G*nC%wjhv{+x_Y}cCf%X~Kg{-Fto>;A zk3HS+GlCR)La|gIDAuXnK!t|^^-kdfMjjp4rF%VEaX)DbKCqG-J>|JsAV00ztr&9o z9F=3jv7^Y`on%Idsih% z>q)UwE@~I+cu%fxN?eH|;ch@c8$sd9@|vr3#mZS(Y5YmLtzJgmEZ(>i^ZVXmlq1is zPO@kTw6B|Xw+6*={jhB;JJ^W{rUszcLWHtduw-`b2n%nVw0*Fe_lKw#NeaH%VDyl@ ztIcKubTTOZMLzBN>`1@r6oK!7{~9)Cw<;~0E)!!M7q+^o$vhI|q+pQOFW7$!LmGDQ zX(41+#EAear>gEJC49Qd%%eDY^NIiXHr;DEWRo8`8JgbM9qP+Odb=oJbp0Qp^l6n4 zs7szme6;`F^eiIPg|fd_Ce&y-ta1{hiqz2?3cdh1?>bC=yn_j(hf;avkS1ijCQ|L4 zdT-x1gxd7y2iuf1V#_3HTzgpDvm5bnW_qDfoZ<@kmr4ozF-!HMRbO&y=aoOtT$ zi8^D&oqy`%+!Os|H1e)h?5s81I);>Z0MF^EYKePE$(Mjfng_ePtgdv%qpjf~$Y5re z_hkPK6Rso!z*miKTCK8g(lT&i%G^tDN~Yk5+q3TP{nfQm5z^)+OMF(I`_KY23TBb6 zSd4HmZ;W;l2p1PsiY8I`!Dc~R6@ zh8mdHrmO}v0~NMzWKdVf9KtRJ&@zqGa_RQN4`=M#Mz>j?UJ9r2mW?FuvGW7W_N(VH zbHBZhdzSy9aH5ZK^q0R-4yg6e*^=+IR5;{a+H;xT;Juxn#_vO14Ck8#YN_81&pM{4 z3nxI71+X6GTzUDK7b<+|=0y(5y|kc3S}$Ot#8ULQG$HcnCURQ&>vKcFI~E$3az3;o sU6cg*0(F0HeWt2UgO|dRtwt9u=7NqNzvP+QXZU~sIsofm<9qDFzXDmr(EtDd literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_rng-members.html b/trunk/paradiseo-eo/doc/html/classeo_rng-members.html new file mode 100644 index 000000000..800499c9d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_rng-members.html @@ -0,0 +1,48 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRng Member List

This is the complete list of members for eoRng, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
cached (defined in eoRng)eoRng [private]
cacheValue (defined in eoRng)eoRng [private]
choice(const std::vector< TYPE > &vec) const eoRng [inline]
choice(std::vector< TYPE > &vec)eoRng [inline]
className(void) const eoRng [inline, virtual]
eoRng(uint32_t s)eoRng [inline]
eoRng(const eoRng &)eoRng [private]
flip(float bias=0.5)eoRng [inline]
initialize(uint32_t seed) (defined in eoRng)eoRng [inline, private]
KeoRng [private]
left (defined in eoRng)eoRng [private]
M (defined in eoRng)eoRng [private]
N (defined in eoRng)eoRng [private]
negexp(double mean)eoRng [inline]
next (defined in eoRng)eoRng [private]
normal(void)eoRng [inline]
normal(double stdev)eoRng [inline]
normal(double mean, double stdev)eoRng [inline]
oldReseed(uint32_t s)eoRng [inline]
operator=(const eoRng &)eoRng [private]
printOn(std::ostream &_os) const eoRng [inline, virtual]
rand()eoRng [inline]
rand_max(void) const eoRng [inline]
random(uint32_t m)eoRng [inline]
readFrom(std::istream &_is)eoRng [inline, virtual]
reseed(uint32_t s)eoRng [inline]
restart(void) (defined in eoRng)eoRng [inline, private]
roulette_wheel(const std::vector< TYPE > &vec, TYPE total=0)eoRng [inline]
stateeoRng [private]
uniform(double m=1.0)eoRng [inline]
~eoObject()eoObject [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]
~eoRng(void) (defined in eoRng)eoRng [inline]

Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_rng.html b/trunk/paradiseo-eo/doc/html/classeo_rng.html new file mode 100644 index 000000000..bba11cf3e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_rng.html @@ -0,0 +1,581 @@ + + +EO: eoRng Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRng Class Reference

Random Number Generator. +More... +

+#include <utils/eoRNG.h> +

+

Inheritance diagram for eoRng: +

+ +eoObject +eoPersistent +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

 eoRng (uint32_t s)
 Constructor.
void reseed (uint32_t s)
 Re-initializes the Random Number Generator.
void oldReseed (uint32_t s)
 Re-initializes the Random Number Generator.
+double uniform (double m=1.0)
 uniform(m = 1.0) returns a random double in the range [0, m)
+uint32_t random (uint32_t m)
 random() returns a random integer in the range [0, m)
+bool flip (float bias=0.5)
 flip() tosses a biased coin such that flip(x/100.0) will returns true x% of the time
+double normal (void)
 normal() zero mean gaussian deviate with standard deviation of 1
+double normal (double stdev)
 normal(stdev) zero mean gaussian deviate with user defined standard deviation
+double normal (double mean, double stdev)
 normal(mean, stdev) user defined mean gaussian deviate with user defined standard deviation
+double negexp (double mean)
 Generates random numbers using a negative exponential distribution.
+uint32_t rand ()
 rand() returns a random number in the range [0, rand_max)
+uint32_t rand_max (void) const
 rand_max() the maximum returned by rand()
template<typename TYPE>
int roulette_wheel (const std::vector< TYPE > &vec, TYPE total=0)
 roulette_wheel(vec, total = 0) does a roulette wheel selection on the input std::vector vec.
template<typename TYPE>
const TYPE & choice (const std::vector< TYPE > &vec) const
 Randomly select element from vector.
template<typename TYPE>
TYPE & choice (std::vector< TYPE > &vec)
 Randomly select element from vector.
void printOn (std::ostream &_os) const
 Write object.
void readFrom (std::istream &_is)
 Read object.
std::string className (void) const
 Return the class id.

Private Member Functions

+uint32_t restart (void)
+void initialize (uint32_t seed)
 eoRng (const eoRng &)
 Copy constructor.
eoRng & operator= (const eoRng &)
 Assignmant operator.

Private Attributes

+uint32_t * state
 Array for the state.
+uint32_t * next
+int left
+bool cached
+float cacheValue
+const int N
+const int M
+const uint32_t K
 Magic constant.
+

Detailed Description

+Random Number Generator. +

+eoRng is a persistent class that uses the ``Mersenne Twister'' random number generator MT19937 for generating random numbers. The various member functions implement useful functions for evolutionary algorithms. Included are: rand(), random(), flip() and normal().

+EO provides a global random number generator rng that is seeded by the current UNIX time at program start. Moreover some global convenience functions are provided that use the global random number generator: random, normal.

+

Warning:
If you want to repeatedly generated the same sequence of pseudo-random numbers, you should always reseed the generator at the beginning of your code.
+

Documentation in original file

+

+This is the ``Mersenne Twister'' random number generator MT19937, which generates pseudorandom integers uniformly distributed in 0..(2^32 - 1) starting from any odd seed in 0..(2^32 - 1). This version is a recode by Shawn Cokus (Cokus@math.washington.edu) on March 8, 1998 of a version by Takuji Nishimura (who had suggestions from Topher Cooper and Marc Rieffel in July-August 1997).

+Effectiveness of the recoding (on Goedel2.math.washington.edu, a DEC Alpha running OSF/1) using GCC -O3 as a compiler: before recoding: 51.6 sec. to generate 300 million random numbers; after recoding: 24.0 sec. for the same (i.e., 46.5% of original time), so speed is now about 12.5 million random number generations per second on this machine.

+According to the URL <http://www.math.keio.ac.jp/~matumoto/emt.html> (and paraphrasing a bit in places), the Mersenne Twister is ``designed with consideration of the flaws of various existing generators,'' has a period of 2^19937 - 1, gives a sequence that is 623-dimensionally equidistributed, and ``has passed many std::stringent tests, including the die-hard test of G. Marsaglia and the load test of P. Hellekalek and S. Wegenkittl.'' It is efficient in memory usage (typically using 2506 to 5012 bytes of static data, depending on data type sizes, and the code is quite short as well). It generates random numbers in batches of 624 at a time, so the caching and pipelining of modern systems is exploited. It is also divide- and mod-free.

+The code as Shawn received it included the following notice: Copyright (C) 1997 Makoto Matsumoto and Takuji Nishimura. When you use this, send an e-mail to <matumoto@math.keio.ac.jp> with an appropriate reference to your work. It would be nice to Cc: <Cokus@math.washington.edu> and <eodev-main@lists.sourceforge.net> when you write.

+

Portability

+

+Note for people porting EO to other platforms: please make sure that the type uint32_t in the file eoRng.h is exactly 32 bits long. It may in principle be longer, but not shorter. If it is longer, file compatibility between EO on different platforms may be broken. +

+ +

+Definition at line 103 of file eoRNG.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + +
eoRng::eoRng ( uint32_t  s  )  [inline]
+
+ + + + + +
+   + + +

+Constructor. +

+

Parameters:
+ + +
s Random seed; if you want another seed, use reseed.
+
+
See also:
reseed for details on usage of the seeding value.
+ +

+Definition at line 113 of file eoRNG.h. +

+References K, and state.

+

+ + + + +
+ + + + + + + + + +
eoRng::eoRng ( const eoRng &   )  [private]
+
+ + + + + +
+   + + +

+Copy constructor. +

+Private copy ctor and assignment operator to make sure that nobody accidentally copies the random number generator. If you want similar RNG's, make two RNG's and initialize them with the same seed.

+As it cannot be called, we do not provide an implementation.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + +
void eoRng::reseed ( uint32_t  s  )  [inline]
+
+ + + + + +
+   + + +

+Re-initializes the Random Number Generator. +

+WARNING: Jeroen Eggermont <jeggermo@liacs.nl> noticed that initialize does not differentiate between odd and even numbers, therefore the argument to reseed is now doubled before being passed on.

+Manually divide the seed by 2 if you want to re-run old runs

+

Version:
MS. 5 Oct. 2001
+ +

+Definition at line 135 of file eoRNG.h.

+

+ + + + +
+ + + + + + + + + +
void eoRng::oldReseed ( uint32_t  s  )  [inline]
+
+ + + + + +
+   + + +

+Re-initializes the Random Number Generator. +

+This is the traditional seeding procedure. This version is deprecated and only provided for compatibility with old code. In new projects you should use reseed.

+

See also:
reseed for details on usage of the seeding value.
+
Version:
old version (deprecated)
+ +

+Definition at line 150 of file eoRNG.h.

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<typename TYPE>
int eoRng::roulette_wheel ( const std::vector< TYPE > &  vec,
TYPE  total = 0
)  [inline]
+
+ + + + + +
+   + + +

+roulette_wheel(vec, total = 0) does a roulette wheel selection on the input std::vector vec. +

+If the total is not supplied, it is calculated. It returns an integer denoting the selected argument. +

+Definition at line 225 of file eoRNG.h. +

+References uniform(). +

+Referenced by eoPropCombinedQuadOp< EOT >::operator()(), eoPropCombinedBinOp< EOT >::operator()(), eoPropCombinedMonOp< EOT >::operator()(), and eoCombinedInit< EOT >::operator()().

+

+ + + + +
+ + + + + + + + + + + + +
+template<typename TYPE>
const TYPE& eoRng::choice ( const std::vector< TYPE > &  vec  )  const [inline]
+
+ + + + + +
+   + + +

+Randomly select element from vector. +

+

Returns:
Uniformly chosen element from the vector.
+ +

+Definition at line 247 of file eoRNG.h. +

+References random().

+

+ + + + +
+ + + + + + + + + + + + +
+template<typename TYPE>
TYPE& eoRng::choice ( std::vector< TYPE > &  vec  )  [inline]
+
+ + + + + +
+   + + +

+Randomly select element from vector. +

+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

+Provide a version returning a non-const element reference.

+

Returns:
Uniformly chosen element from the vector.
+
Warning:
Changing the return value does alter the vector.
+ +

+Definition at line 262 of file eoRNG.h. +

+References random().

+

+ + + + +
+ + + + + + + + + +
void eoRng::printOn ( std::ostream &  _os  )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Write object. +

+It's called printOn since it prints the object on a stream.

Parameters:
+ + +
_os A std::ostream.
+
+ +

+Implements eoPrintable. +

+Definition at line 266 of file eoRNG.h. +

+References state.

+

+ + + + +
+ + + + + + + + + +
void eoRng::readFrom ( std::istream &  _is  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Read object. +

+

Parameters:
+ + +
_is A std::istream.
+
+
Exceptions:
+ + +
runtime_std::exception If a valid object can't be read.
+
+ +

+Implements eoPersistent. +

+Definition at line 277 of file eoRNG.h. +

+References state.

+

+ + + + +
+ + + + + + + + + +
std::string eoRng::className ( void   )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Return the class id. +

+This should be redefined in each class. Only "leaf" classes can be non-virtual.

+Maarten: removed the default implementation as this proved to be too error-prone: I found several classes that had a typo in className (like classname), which would print eoObject instead of their own. Having it pure will force the implementor to provide a name. +

+Implements eoObject. +

+Definition at line 293 of file eoRNG.h.

+

+ + + + +
+ + + + + + + + + +
eoRng& eoRng::operator= ( const eoRng &   )  [private]
+
+ + + + + +
+   + + +

+Assignmant operator. +

+

See also:
Copy constructor eoRng(const eoRng&).
+
+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_rng.png b/trunk/paradiseo-eo/doc/html/classeo_rng.png new file mode 100644 index 0000000000000000000000000000000000000000..82f1796e29d73529927fe72697d3fd4ab1cf112f GIT binary patch literal 633 zcmV-<0*3vGP)^ous3?0$RgQ>?FrZvMNP^iXZ5z!i;Gx8xipP#}ZER7~0W2pu1)cM>Ga^w|Qms`dg zKY!n@z!HyfHehk~A;9ry?Gx6l(H_2KYi=WKWp39>2w0jt)>cB_Ri;?Qw#W8)p{MLt zk9Z+=x}OMpo2C2bdn>Uu;|qdyB(3j3K?u2nZO23!%JH@I}l>5l)>E0467ci80MS-8x$BJ zZOxL*1}kJR=CMX21e-l<5Q`E?5Hi^E@jYcA0UOk<`MP%`utEl7^qd3~S7fv{j@Ir( zyUJi@Ipu)Em8T^5O32HtU6LSk8)N4i%yk^=&1HGQzRB2gz>u<9!J|2JGxU&LR;*(!8XdRtOWYBs)RrPvK6*jZX?^Q;kSL%D7F>0@`e5YzGttf TTcEgm00000NkvXXu0mjfDwiC% literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_roulette_worth_select-members.html b/trunk/paradiseo-eo/doc/html/classeo_roulette_worth_select-members.html new file mode 100644 index 000000000..0ff16a419 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_roulette_worth_select-members.html @@ -0,0 +1,26 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRouletteWorthSelect< EOT, WorthT > Member List

This is the complete list of members for eoRouletteWorthSelect< EOT, WorthT >, including all inherited members.

+ + + + + + + + + + + + +
check_sync(unsigned index, const EOT &_eo) (defined in eoSelectFromWorth< EOT, WorthT >)eoSelectFromWorth< EOT, WorthT > [inline, protected]
eoRouletteWorthSelect(eoPerf2Worth< EOT, WorthT > &_perf2Worth) (defined in eoRouletteWorthSelect< EOT, WorthT >)eoRouletteWorthSelect< EOT, WorthT > [inline]
eoSelectFromWorth(eoPerf2Worth< EOT, WorthT > &_perf2Worth) (defined in eoSelectFromWorth< EOT, WorthT >)eoSelectFromWorth< EOT, WorthT > [inline]
fitness (defined in eoSelectFromWorth< EOT, WorthT >)eoSelectFromWorth< EOT, WorthT > [protected]
functor_category()eoUF< const eoPop< EOT > &, const EOT & > [inline, static]
operator()(const eoPop< EOT > &_pop)eoRouletteWorthSelect< EOT, WorthT > [inline, virtual]
perf2Worth (defined in eoSelectFromWorth< EOT, WorthT >)eoSelectFromWorth< EOT, WorthT > [protected]
setup(const eoPop< EOT > &_pop)eoRouletteWorthSelect< EOT, WorthT > [inline, virtual]
total (defined in eoRouletteWorthSelect< EOT, WorthT >)eoRouletteWorthSelect< EOT, WorthT > [private]
worthIterator typedef (defined in eoRouletteWorthSelect< EOT, WorthT >)eoRouletteWorthSelect< EOT, WorthT >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, const EOT & > [inline, virtual]

Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_roulette_worth_select.html b/trunk/paradiseo-eo/doc/html/classeo_roulette_worth_select.html new file mode 100644 index 000000000..21e1aca26 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_roulette_worth_select.html @@ -0,0 +1,62 @@ + + +EO: eoRouletteWorthSelect< EOT, WorthT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoRouletteWorthSelect< EOT, WorthT > Class Template Reference

An instance of eoSelectPerf2Worth that does selection from the Worthes using a ... +More... +

+#include <eoSelectFromWorth.h> +

+

Inheritance diagram for eoRouletteWorthSelect< EOT, WorthT >: +

+ +eoSelectFromWorth< EOT, WorthT > +eoSelectOne< EOT > +eoUF< const eoPop< EOT > &, const EOT & > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + +

Public Types

+typedef std::vector< WorthT
+>::iterator 		worthIterator

Public Member Functions

+ eoRouletteWorthSelect (eoPerf2Worth< EOT, WorthT > &_perf2Worth)
+virtual void setup (const eoPop< EOT > &_pop)
 virtual function to setup some population stats (for instance eoProportional can benefit greatly from this)
+virtual const EOT & operator() (const eoPop< EOT > &_pop)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+double total
+

Detailed Description

+

template<class EOT, class WorthT = double>
+ class eoRouletteWorthSelect< EOT, WorthT >

+ +An instance of eoSelectPerf2Worth that does selection from the Worthes using a ... +

+roulette wheel selection, yes! +

+ +

+Definition at line 167 of file eoSelectFromWorth.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_roulette_worth_select.png b/trunk/paradiseo-eo/doc/html/classeo_roulette_worth_select.png new file mode 100644 index 0000000000000000000000000000000000000000..d1ea0bb12f073a065c19313c44b9060e5dc9a347 GIT binary patch literal 2338 zcmb7GdpK0<8lRd9?JeYzT&A2;ZMmdEZ1+f1Zn;fEmP?6@OR`6du(LywI0>;`k`Oay z?MWhLj3lBV#4LB)ZOAeq#u&{sdv@);bIy6rexCEkx4w71@AJLuTkr4p{=P5C!Olv2 ztHM?U0wI3F`j{gEv5_RSS2rPr&(ZA272zcBVB>5l5D0{(K+sT7;FTt{K97cmhNwot zr0{ja4~}+D2s38i1q4F0=ESk1&Jnq+TykcSzNDq?;X}pO&&=(b`_y?nU7E|;QMN}# z%;qg>q`Pr`W#@pLb*7eOp~*_mM1gCB{zF+*Y--R#7RSJ7(CYzObou5r;83S}LM6pb zD&1JOjD5FD`6IA5%E%@vL_bQ^ktMy8*}fpd**MsX-R@ltr4L}EXC6{ZFH=}=b*{%6yt+S}HTG!;Rw{L+pbZ7`p_*YoVV{l=q9#+n zZ-pmEe*ETce}hih#+{jr6U>${$zuJVm%V75cgU{9Vl^?tJJ9}ek0@~}Gqm)1%Fbas zQ4nDIKR|~{R0I>TDfaCJ$AiaQ@_|X6O`y|=L5-e%O*CFyVqlK5%}IYiuS6Lyjs{*N zB~5>~qR^;Lq$C*aF2&2X$`YV7PY<{iNSv1Ry#VyOEYDI+C)`t`!oUN%3D2DqUZu5Q zXYwf}PC6P~-Bd`j@A6Fu;~@uTpbJErrmlUc4^M#3PZdLw7bADEXQL+z)dwTJx=Btf zoWj#_+>KH*yCf)dlrTDAN{j6UEQs3-0rcY9t-}QwkfbolsIkXXHZ*+!bz`_A2{NK3 zbXHYC=}Uw_ylq7?^bguLMXoN+hO6r?VG}wtgHr>%t5BkT)49By3X$Wdqr;L(B0992 zhe}Bz`P}v&)LUnb&sf-lIrV8?1`Zy(n2U?CApg zj}X|!+G-%Vi?0y9yX1r7zW3HZkaOLN0{&U8QZt$<8qDHTo7=P&jom7B*2>*oSa~%T z;8+{h8gWRX3D|e{4kl7O((9j!L#+gVv6@vzQR@)wc>9!Z4KGJXv-%#`z1jW?&9LP5 zD7KFyCBfRAa=TD&v|K4`Pnad@mw{deP|<%AEp7k&WZ)8zZccT8Bb1BiwMyt4P#eJ` z*rpf?)s|=q*1H8!c>za0z%^}PKfWQM?lirUjQ*ErCEHBj@CqFqV}$Gl9Wv#_OeAFB zYvi*MO>8U~)!B20{h`F8pe81T>jG$s=5W^JL;{+E4tS?pfb+W^i%@-5ZNP}HFcj*7 z=-8{#_Xw7J#47b$Auxs6aW*MOLCKiK*vIDg(UO!9@4pA^FMh2@@!y>>p!{Z$l`je_Fd;lR7qO;}fa@*;i+dpf`Kd_4K868iW4JV<;0fD=n|YiA%y zs+o`apP(M8ou|G|jNp$J{uf^@umJdJb?qQJd2Pc&)J|bq7nM8?8*RKIb7wY5J z{p#0Z|36MH)klVhGFsOm`m;Ef{RE9f->T+x)VWH)Wl=-AE$dccP4iF;QRBHSm89;Q z9Uv%yTo#D~uz$LMbf_XzESa=}}ka z&V>YtC9=8XdJM1Lu6u)T%QHTV8S27L&Bj9!XINGC7R%&90~M>>;Wk*wD({iZ;t>PR z(91lN-W5`M{f_AA?Snj(cd~1|xgKTH4(#+q*_Gqn7Q;W(+Q;ISLPASWrwHM2+}m!r zya?F*5#6Cot(~kH!!e~|c^R6|(DUsn + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSGA< EOT > Member List

This is the complete list of members for eoSGA< EOT >, including all inherited members.

+ + + + + + + + + + + + +
cont (defined in eoSGA< EOT >)eoSGA< EOT > [private]
cross (defined in eoSGA< EOT >)eoSGA< EOT > [private]
crossoverRate (defined in eoSGA< EOT >)eoSGA< EOT > [private]
eoSGA(eoSelectOne< EOT > &_select, eoQuadOp< EOT > &_cross, float _crate, eoMonOp< EOT > &_mutate, float _mrate, eoEvalFunc< EOT > &_eval, eoContinue< EOT > &_cont) (defined in eoSGA< EOT >)eoSGA< EOT > [inline]
eval (defined in eoSGA< EOT >)eoSGA< EOT > [private]
functor_category()eoUF< eoPop< EOT > &, void > [inline, static]
mutateeoSGA< EOT > [private]
mutationRate (defined in eoSGA< EOT >)eoSGA< EOT > [private]
operator()(eoPop< EOT > &_pop)eoSGA< EOT > [inline, virtual]
select (defined in eoSGA< EOT >)eoSGA< EOT > [private]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< eoPop< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_s_g_a.html b/trunk/paradiseo-eo/doc/html/classeo_s_g_a.html new file mode 100644 index 000000000..405d3776a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_s_g_a.html @@ -0,0 +1,71 @@ + + +EO: eoSGA< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSGA< EOT > Class Template Reference

The Simple Genetic Algorithm, following Holland and Goldberg. +More... +

+#include <eoSGA.h> +

+

Inheritance diagram for eoSGA< EOT >: +

+ +eoAlgo< EOT > +eoUF< eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoSGA (eoSelectOne< EOT > &_select, eoQuadOp< EOT > &_cross, float _crate, eoMonOp< EOT > &_mutate, float _mrate, eoEvalFunc< EOT > &_eval, eoContinue< EOT > &_cont)
+void operator() (eoPop< EOT > &_pop)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+eoContinue< EOT > & cont
+eoInvalidateMonOp< EOT > mutate
 eoInvalidateMonOp invalidates the embedded operator
+float mutationRate
+eoInvalidateQuadOp< EOT > cross
+float crossoverRate
+eoSelectPerc< EOT > select
+eoEvalFunc< EOT > & eval
+

Detailed Description

+

template<class EOT>
+ class eoSGA< EOT >

+ +The Simple Genetic Algorithm, following Holland and Goldberg. +

+Needs a selector (class eoSelectOne) a crossover (eoQuad, i.e. a 2->2 operator) and a mutation with their respective rates, of course an evaluation function (eoEvalFunc) and a continuator (eoContinue) which gives the stopping criterion. Performs full generational replacement. +

+ +

+Definition at line 49 of file eoSGA.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_s_g_a.png b/trunk/paradiseo-eo/doc/html/classeo_s_g_a.png new file mode 100644 index 0000000000000000000000000000000000000000..17314ab839047dc085dc933a7887bcedec5ac7ef GIT binary patch literal 1478 zcmeAS@N?(olHy`uVBq!ia0y~yU}6EX53n!;$<9-0dO%7dz$e7@|Ns9$=Kuc(=Fd-< z0AzvjfddDs5B+}vg>EaktG3V{w)01XfiLhSqUApS{G&QO2 zKMquI z|4R3-qH@5t?X$&t=NMiafCVPRL`U{ae z?|39|&+PhJHuFGvwH(Z~X-W4=Wx19Rt^Z=bdO@jEo>sSN<9o)#p4 zqq2-{o#$95ma(w>JjXJZ-;EE>?c`z!zBaYMFtpQfrr@y}w~p(qH+vME78aVYr?r$H znf#h5H1(f)Sk8whryea~d6u!cd-rq!o9dI6oZC$5-ixWL|5)wF1d6hG4f%^6C)CLO zWjy|P@yCDm((mQZa@y^?_3r+$>*<&8PG*Sj{mx%4c55D+&<2?%76nER2B8KRwITe( z+r@?lA7<3@`3tBhFmgIDO<+)AK&HMc{J8kdS!(U<{KxK>{a^jbxmzO*QE8)oq3o&K z&YF!;TNnRzV%xnyv2x|Qa3;IRCk1s)OH-~|?LT2y`}WYQdD((HK1T_i@!Y;ewT$iV z@yUB!1g7u1k!ldGG$Ty+=(G-_m3I#vn{b}v5Jv}dVjRO$BW~~e=lm61EI!N-QL^Ky z-2Ns19qYc2o0L8GM|@~DgNAT5N6A;uYQ;mpST{a>mn^O};p$oO=T|MF?HAP< zHWmEV^-s7y)8}>Y-`bn6TIXz6<}gqE9RJWPr%p7;aYLd(%q#_)kGW;uKc2;Hxc4B5 z%;Mke-{pXTm{BXBvO~jBU9Lg=@pbt8C)R1-)-#EVr=89$K-2Gw(L{A%_pfPR}`? zMNK%v@qI08qT7e-to;rTl;Xti)Vb}rf6p11mDciuT)Ou=Fee=3z31|u|3=Xpc`<#1 Rr@%s&!PC{xWt~$(69572eO&+m literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_s_g_a_gen_op-members.html b/trunk/paradiseo-eo/doc/html/classeo_s_g_a_gen_op-members.html new file mode 100644 index 000000000..9de2b0b86 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_s_g_a_gen_op-members.html @@ -0,0 +1,38 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSGAGenOp< EOT > Member List

This is the complete list of members for eoSGAGenOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + +
apply(eoPopulator< EOT > &_pop)eoSGAGenOp< EOT > [inline, virtual]
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const (defined in eoSGAGenOp< EOT >)eoSGAGenOp< EOT > [inline, virtual]
cross (defined in eoSGAGenOp< EOT >)eoSGAGenOp< EOT > [private]
eoGenOp()eoGenOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
eoSGAGenOp(eoQuadOp< EOT > &_cross, double _pCross, eoMonOp< EOT > &_mut, double _pMut)eoSGAGenOp< EOT > [inline]
functor_category()eoUF< eoPopulator< EOT > &, void > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
max_production(void)eoSGAGenOp< EOT > [inline, virtual]
mut (defined in eoSGAGenOp< EOT >)eoSGAGenOp< EOT > [private]
op (defined in eoSGAGenOp< EOT >)eoSGAGenOp< EOT > [private]
operator()(eoPopulator< EOT > &_pop)eoGenOp< EOT > [inline, virtual]
pCross (defined in eoSGAGenOp< EOT >)eoSGAGenOp< EOT > [private]
pMut (defined in eoSGAGenOp< EOT >)eoSGAGenOp< EOT > [private]
propOp (defined in eoSGAGenOp< EOT >)eoSGAGenOp< EOT > [private]
quadClone (defined in eoSGAGenOp< EOT >)eoSGAGenOp< EOT > [private]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]
~eoUF()eoUF< eoPopulator< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_s_g_a_gen_op.html b/trunk/paradiseo-eo/doc/html/classeo_s_g_a_gen_op.html new file mode 100644 index 000000000..7c30b1d45 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_s_g_a_gen_op.html @@ -0,0 +1,79 @@ + + +EO: eoSGAGenOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSGAGenOp< EOT > Class Template Reference

*************************************************************************** eoSGAGenOp (for Simple GA) mimicks the usual crossover with proba pCross + mutation with proba pMut inside an eoGeneralOp It does it exactly as class eoSGATransform, i.e. +More... +

+#include <eoSGAGenOp.h> +

+

Inheritance diagram for eoSGAGenOp< EOT >: +

+ +eoGenOp< EOT > +eoOp< EOT > +eoUF< eoPopulator< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoSGAGenOp (eoQuadOp< EOT > &_cross, double _pCross, eoMonOp< EOT > &_mut, double _pMut)
 Ctor from crossover (with proba) and mutation (with proba) Builds the sequential op that first applies a proportional choice between the crossover and nothing (cloning), then the mutation.
+virtual void apply (eoPopulator< EOT > &_pop)
 do the job: delegate to op
+virtual unsigned max_production (void)
 inherited from eoGenOp
+virtual std::string className () const

Private Attributes

+eoQuadOp< EOT > & cross
+double pCross
+eoMonOp< EOT > & mut
+double pMut
+eoProportionalOp< EOT > propOp
+eoQuadCloneOp< EOT > quadClone
+eoSequentialOp< EOT > op
+

Detailed Description

+

template<class EOT>
+ class eoSGAGenOp< EOT >

+ +*************************************************************************** eoSGAGenOp (for Simple GA) mimicks the usual crossover with proba pCross + mutation with proba pMut inside an eoGeneralOp It does it exactly as class eoSGATransform, i.e. +

+only accepts quadratic crossover and unary mutation It was introduced for didactic reasons, but seems to be popular :-) +

+ +

+Definition at line 44 of file eoSGAGenOp.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_s_g_a_gen_op.png b/trunk/paradiseo-eo/doc/html/classeo_s_g_a_gen_op.png new file mode 100644 index 0000000000000000000000000000000000000000..4a88aa92529e794cf335c88cc1f3ae38cad1334c GIT binary patch literal 1968 zcma)-c~p~062K!!aHA2%V}St9V4g0>tq&N;5IF-uxfN6};Yj2PxDZJgAutFis~mbyrut`gQd`9PF&% zFa!(&fxxlW7ETa|gitKk?UfYI#-I~HyvRG8zhJq$yDJuVckA-YRzj=^vBzt@EUxu|Of#=OXMu*SSR9tI)Cg<=@ z=_V4s>dkqG>D{S{E?tlHQmuBwOAKet$Za3k<Luv3>cC>@O zEFbD+N?FM6j9l%W*&^^rJVh>}Dq`BRrtM_a-^t1Z@442o(GA>5LdNS&zn=2xcl4{5 zc)ASrYk{rvHwx90bV_A>EJgBy+QY#1dM8ik^ugFM9N~`ULk?afyEj%|=_5QQw`Oii z@FsD*K zUYmeog(}ym#QEy?!@bTBQca~kEQTT$$^cvIBf&To)KqdBre=23(*ln@%+6`AEdet* z4Ks6WUO>hHA2!NXh@Fs4Z^UQMU0VPe7f(GM(!DrM*UY-(dBQD^g>o0ooVf?ak+4Xu zLi#fN1_NAld9cH;B(_+*_eyDtaqqHDQJ#L*72j>VQmKNrO4H=ZB!Qo3K*+$t%>s9R zlH<@2-PlqTdX7?=06rlxVstCy*l-IsWuhloP?fVoR9AQMwoj8HJbBFBp^ zAcJvCPP>2OY`aQK5tB|0Dd-s9fspSos8z$IgS$q+(0j=d6k%j=Qag3~WsNbNcJK9h z5$kh>%>WZsMQdBY3jfmKc!1GjO&t6bzpPOx*xxrAvLZ1oMU>olrBr+CD1OAMeDtb= zep31Ma34{i4uoj}Sg%9>@&%R8j`k5HACtcO%uhm|@NKZ+mAf>Jox})@Kal!*-EHY|#)GeX|29!*8oxi$OhldFsk?2~ zYJ|&cZtiZ(o_sV)EY=!%fmb3{3lqKpUir37cNQy*?B8CGd{C=bb*afrRMF%0qD1m? zx-qqGY5T}=Tof)KGR$1G5?fvHqYi1a$1E@i{(x0`h9J)27t7yH#%Wd+L4_0 z;S3utvD02&xq8wAII6>ip8o^`bia2>IB&Idn$7Y*#~%0d>*zp+XMD^fwxi6^nN%q- zREouL%{D0d@B=&aMdXPsmjorv@c9-wJ9TK=sYH-P`{nZG!l3HAW?V9sl1;@G(s3>i z*$HcL;3_lu0S$fKLgYm0ZAHuZHEO!h+vi>BG%e!VCseh@fMPPq*x+*HLk`D(ZzgBj zuB99c~<{>=h4N`Z96Rho|pF}%4a04;*2u<7ne zxH<$M`ZWX*Wnh8ZLSS&k;jM_E9}xeGsV^a@D()kmmC*K-UarP>===#fFg0fls$sMe zSUFxmBIbdmd)$G-AfEEKM0I<9$L474)^JNRQLUzOV9AlYoDG&Xqz-QNov`cg9SUl( z0{C`7t-9NCoRL3G4%%4zrLbBXZ-uq`u~jE`x4JI35y!qh5wmL8)b(KmRibl(-*P*P6rv)&6W?`DCol`yr2rHJG8V4i9-zx-b LX=hPp=5gykEeqKv literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_s_g_a_transform-members.html b/trunk/paradiseo-eo/doc/html/classeo_s_g_a_transform-members.html new file mode 100644 index 000000000..08b65c38b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_s_g_a_transform-members.html @@ -0,0 +1,23 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSGATransform< EOT > Member List

This is the complete list of members for eoSGATransform< EOT >, including all inherited members.

+ + + + + + + + + +
cross (defined in eoSGATransform< EOT >)eoSGATransform< EOT > [private]
crossoverProba (defined in eoSGATransform< EOT >)eoSGATransform< EOT > [private]
eoSGATransform(eoQuadOp< EOT > &_cross, double _cProba, eoMonOp< EOT > &_mutate, double _mProba)eoSGATransform< EOT > [inline]
functor_category()eoUF< eoPop< EOT > &, void > [inline, static]
mutate (defined in eoSGATransform< EOT >)eoSGATransform< EOT > [private]
mutationProba (defined in eoSGATransform< EOT >)eoSGATransform< EOT > [private]
operator()(eoPop< EOT > &_pop)eoSGATransform< EOT > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< eoPop< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_s_g_a_transform.html b/trunk/paradiseo-eo/doc/html/classeo_s_g_a_transform.html new file mode 100644 index 000000000..2d15fc9f7 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_s_g_a_transform.html @@ -0,0 +1,107 @@ + + +EO: eoSGATransform< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSGATransform< EOT > Class Template Reference

eoSGATransform: transforms a population using genetic operators. +More... +

+#include <eoSGATransform.h> +

+

Inheritance diagram for eoSGATransform< EOT >: +

+ +eoTransform< EOT > +eoUF< eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoSGATransform (eoQuadOp< EOT > &_cross, double _cProba, eoMonOp< EOT > &_mutate, double _mProba)
 Default constructor.
void operator() (eoPop< EOT > &_pop)
 Transforms a population.

Private Attributes

+eoInvalidateQuadOp< EOT > cross
+double crossoverProba
+eoInvalidateMonOp< EOT > mutate
+double mutationProba
+

Detailed Description

+

template<class EOT>
+ class eoSGATransform< EOT >

+ +eoSGATransform: transforms a population using genetic operators. +

+It does it exactly as class eoSGA, i.e. only accepts quadratic crossover and unary mutation It is here mainly for tutorial reasons +

+ +

+Definition at line 45 of file eoSGATransform.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
void eoSGATransform< EOT >::operator() ( eoPop< EOT > &  _pop  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Transforms a population. +

+

Parameters:
+ + +
pop The population to be transformed.
+
+ +

+Implements eoUF< eoPop< EOT > &, void >. +

+Definition at line 62 of file eoSGATransform.h. +

+References eoRng::flip().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_s_g_a_transform.png b/trunk/paradiseo-eo/doc/html/classeo_s_g_a_transform.png new file mode 100644 index 0000000000000000000000000000000000000000..4fef288ca8072e585678b899903c1c6ba9359e2c GIT binary patch literal 1546 zcma)6do05sCPebyWE<dd(!Nkk#NJO{T;<=K6+;JW0l zrcKLTyK&vAuFrVoh~1Hpj`-nSz**OUD&y!^Nx;(?pLwdMlu@QCcS1eNY)uc@!x&v< zV3RccG^(BRT%Gc)@XEgr&H#-a{oTSrlcqwc#yO71iOT4jkz)NvD}c*-!@+ZC{+LhL z^YT$k!EAG?4Ki;@QNr48$CsALg4hR`Al%%`@)znkH0L&MsrAJhI`Zlt?Mu~w19(bu zX#UPDhAb=BHr>b+(w;!nl#G%wwcb+zQ}MX3Lz)!2N2_U)!9hILTI`uYvCNYgAggJA z7No=~1@u*p7V6VT0_>HG5pCJLwDwzOQT?CalaBi@Vn>2Y)WW5GG9lqUM6c{Khv1te zfja$MGTw&oiRVt&XmR%pAow-TIg<$4B3G7R-K&0QpnmD8i+kMyC)F~GQbtn)62Qe%%&)`V}^+*P~W)nPBM9G{@>i+MJ=-g?$9_COpL`;)$gzZ^Vt4o%z}9}!@9 z%(C8H&)UK54tWYZbsU~e?Y zv4xyosOP}66STFBZ!6b*a_@^1SyemJhVQrX4_SeGZae6D=d+pV4L*Vc{zrRZ|Ay#w*!A8_ocw7B3Jz?#yKHL$JVsVIz-a(v({Rk?X7#&NLKJPt#^LoabeB + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSSGADetTournamentReplacement< EOT > Member List

This is the complete list of members for eoSSGADetTournamentReplacement< EOT >, including all inherited members.

+ + + + + + + + +
eoReduceMerge(eoReduce< EOT > &_reduce, eoMerge< EOT > &_merge) (defined in eoReduceMerge< EOT >)eoReduceMerge< EOT > [inline]
eoSSGADetTournamentReplacement(unsigned _t_size) (defined in eoSSGADetTournamentReplacement< EOT >)eoSSGADetTournamentReplacement< EOT > [inline]
functor_category()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
operator()(eoPop< EOT > &_parents, eoPop< EOT > &_offspring)eoReduceMerge< EOT > [inline, virtual]
plus (defined in eoSSGADetTournamentReplacement< EOT >)eoSSGADetTournamentReplacement< EOT > [private]
truncate (defined in eoSSGADetTournamentReplacement< EOT >)eoSSGADetTournamentReplacement< EOT > [private]
~eoBF()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_s_s_g_a_det_tournament_replacement.html b/trunk/paradiseo-eo/doc/html/classeo_s_s_g_a_det_tournament_replacement.html new file mode 100644 index 000000000..d8f972762 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_s_s_g_a_det_tournament_replacement.html @@ -0,0 +1,52 @@ + + +EO: eoSSGADetTournamentReplacement< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSSGADetTournamentReplacement< EOT > Class Template Reference

SSGA deterministic tournament replacement. +More... +

+#include <eoReduceMerge.h> +

+

Inheritance diagram for eoSSGADetTournamentReplacement< EOT >: +

+ +eoReduceMerge< EOT > +eoReplacement< EOT > +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + +

Public Member Functions

+ eoSSGADetTournamentReplacement (unsigned _t_size)

Private Attributes

+eoDetTournamentTruncate< EOT > truncate
+eoPlus< EOT > plus
+

Detailed Description

+

template<class EOT>
+ class eoSSGADetTournamentReplacement< EOT >

+ +SSGA deterministic tournament replacement. +

+Is an eoReduceMerge. +

+ +

+Definition at line 91 of file eoReduceMerge.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_s_s_g_a_det_tournament_replacement.png b/trunk/paradiseo-eo/doc/html/classeo_s_s_g_a_det_tournament_replacement.png new file mode 100644 index 0000000000000000000000000000000000000000..e25eea7efc82daee4fdaef5ec40a662390a5d69c GIT binary patch literal 2304 zcmcJRdsGrw9>-~Fj+Uj?j72DzwYh3#zVU(4LvyS|aze!@HD8=m3?E5ibT&)M;b9uN z<)CG$qlk~05HLkch13$$eCDIXM`}J$3__BnI*z;N?Afz_?EZ1@{odd2+~2w9cR#=1 zxi^srk4+mu8vp>nCeNSTd;oy&hBaETZmniMZJg7iS%AnBr`*+QwMMGdb-B4g=^FKQ z)Ya7ypQ%SQ+coh%h@Sxm$9lp60PQ=TZih}0ew}7M&0sm`yL;tNvNs!c?S!WvBi-oy zfc_-kRkU0GutfTUVsed~Clvl3+9GnDCYcv3C}wZN_D+lm~b_ zJ6fvnl~GiGvVn(O2I~WV+Ib{2*=F{^kbs57Hp6gaM&Cx+Sn(ALVmh&49wjx^a}YSN z#!uETtA1ff_el*~#pU&<_l08v%H9{o`#de~yhF1o^@_^=sZ#io)5QdzWP)d$Bm2EB z#Lf^V_PxKHv0o$`a_>>Q zgQ`1h&cWA?p2N&crsQ3=#tmX-OH0xUfr-%I*9UNee_Z}hRQ)})dV3&$;ikz5naN6m z<{b#a@E!H$8wukJyzO8bbXj(^W~_(zXwKYdaT!e1Ip*3eG2JYBWznT%E32TIP@(}W^;aJJt$9d4mC`ig35%?BRKyuQHC4)?#6qM~vzJQR@M6j?;|EeTfpq zok_UX>^!0czjUu~YstMFV-~6|c`2s#MO);ce|pjT7T+cXhmy_ZD@8-%YHO%%eiTD; zPB>&$L3ICQA!?-L0ze)|Bv`D`ChEhx5RN#-O!6YaJ2_pN>Aj2=_8FRml+^q!_KO(q z_L~O(7}w6ujem0|6Zd&4vZUs^529)@6Za;zi%sW1k*)s3wPBS1wMb@WRa8EKrw4MN z7hJwxbOp~gN6_l+|1=Wr)Sl1n4QzmOIMZ*-`mP9k)=?j>crop~=%Gg)2X18NAOf8K z=+WKx>eS`u#U|4RgaiqHE5iAW)vJW#lyOs?7T-;B>zU#G_JWO72sab#qW)FusZuQJ zeM~43Jn&4>e|V1>a^n6)@RrYtW~TQ>6Zi*AC;t{ErYaKTCosr8rbTYcicO~&d9eJa zs-}PbylgRn$U>2X;=KbNxKwq>wTPqXm)z8N= zYt37H^Mz%`lClLwdDHWgohB29#9#5KJqgkKKJ~a@;yxTxOhcl}iggV@s5|WT`kM2M zM8ZRzumXE*Z?Tcx^5E^?QBGJ@CM&jIOo(31-q>qlWUltfhP%`&`Z*@oG_^h_PJ7kn z`1ioT@u=@Eoy8jI);ekS|1QD*y^*jrr-Gh(g>h9AeoZE^iN+1t6nNN(iRNXo5dy%9Ks?6?sumW&4kkzx+hAr4Iz+j z=^Ra%X^Bn=IO-gY`~24(n;z@V5(ps@7LFXZ!0lD2-ah?u7}h=AwmnfE1@~45^D4<6 ziLmO2(i7ZzeMt&%TMbF}mPVG_37RC%Gl`B73_H4U`uMu_6-eV;2G&7T(cgJ|Ca$G#|iLsTAg|nd0U>5~_|*NVCx% zI0wJ&Qe7|F)ZFFV7SE1mcFh~*-H+w#Ss6}r;TsyYwso%`bcS*KF)0FLsTXna7Hb50 zaE8nZMeIuRQqn?H`SUHH#4Te0S(DpMyu>C1;~BcdIG|*3rX5B4Yvf&|fdPd(Rni_sfmTSpR + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSSGAStochTournamentReplacement< EOT > Member List

This is the complete list of members for eoSSGAStochTournamentReplacement< EOT >, including all inherited members.

+ + + + + + + + +
eoReduceMerge(eoReduce< EOT > &_reduce, eoMerge< EOT > &_merge) (defined in eoReduceMerge< EOT >)eoReduceMerge< EOT > [inline]
eoSSGAStochTournamentReplacement(double _t_rate) (defined in eoSSGAStochTournamentReplacement< EOT >)eoSSGAStochTournamentReplacement< EOT > [inline]
functor_category()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
operator()(eoPop< EOT > &_parents, eoPop< EOT > &_offspring)eoReduceMerge< EOT > [inline, virtual]
plus (defined in eoSSGAStochTournamentReplacement< EOT >)eoSSGAStochTournamentReplacement< EOT > [private]
truncate (defined in eoSSGAStochTournamentReplacement< EOT >)eoSSGAStochTournamentReplacement< EOT > [private]
~eoBF()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_s_s_g_a_stoch_tournament_replacement.html b/trunk/paradiseo-eo/doc/html/classeo_s_s_g_a_stoch_tournament_replacement.html new file mode 100644 index 000000000..e7f3b31e3 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_s_s_g_a_stoch_tournament_replacement.html @@ -0,0 +1,53 @@ + + +EO: eoSSGAStochTournamentReplacement< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSSGAStochTournamentReplacement< EOT > Class Template Reference

SSGA stochastic tournament replacement. +More... +

+#include <eoReduceMerge.h> +

+

Inheritance diagram for eoSSGAStochTournamentReplacement< EOT >: +

+ +eoReduceMerge< EOT > +eoReplacement< EOT > +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + +

Public Member Functions

+ eoSSGAStochTournamentReplacement (double _t_rate)

Private Attributes

+eoStochTournamentTruncate<
+ EOT > 		truncate
+eoPlus< EOT > plus
+

Detailed Description

+

template<class EOT>
+ class eoSSGAStochTournamentReplacement< EOT >

+ +SSGA stochastic tournament replacement. +

+Is an eoReduceMerge. It much cleaner to insert directly the offspring in the parent population, but it is NOT equivalent in case of more than 1 offspring as already replaced could be removed , which is not possible in the eoReduceMerge So what the heck ! +

+ +

+Definition at line 108 of file eoReduceMerge.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_s_s_g_a_stoch_tournament_replacement.png b/trunk/paradiseo-eo/doc/html/classeo_s_s_g_a_stoch_tournament_replacement.png new file mode 100644 index 0000000000000000000000000000000000000000..7c2e28dda91af00adec13c7f12c9149279149a27 GIT binary patch literal 2306 zcmb_eYgAI{8s?NMJ(X#v%nK>2sg4efDI=MtX_}X#G#;B99$ znO0tg%&Z9U9;gdUR+t{t=|V~(jO{SBtkfjbltZoQTd8|vU=@S9k6G}+P;aePtAko?M`h*Fb2{|- z>FDT4@6^7~{r)Kh6&M29H#&%eKnzO#ygWjwWs~K-r>dMb`UH@}xaS@3+;8uAB3V=4 zQ&Ai(oGpULNP0BFuP)zO`&>Fnq9tdf=gZSRGW@Mpk^HT+v(_(Q@$Kmq=gy1o{o-U{ z;kzGWh`8xXa^9ou_z&*2XHW95N$ z$?Buu*NSdAD19txM+RgLk3ZD>z|tpc$OtE5@E*#zMzi)_Dfv(n0U3>x4o)V>W1mK4 zl5WX!(~PnJ66I!UzPg*|#_yv$z$^NAi|c)Q!TGXYY|x19;D}TsDGyq^#rJKn5eg>B5SK} zAl!DpX~@q@-L-JS7EhGZPLoFloD=0SE4KCql@-~|h{h`D^12Bb*#Y#Kqazf;-3iI< z@>d&Di1Pa%G=0?Esh6F@NJ0KnjUT#&5J&4b3!33gQ&gQAQkpB4_WHuM30U-tsh9Ar z)?v&8Mp%i&n_aemou;DLHgWeS)~g66SG$UXyQFYO_F(RtcG8i}S)TU>;Pq|=VO_~l z>uVX33L2py-(V znS?~1%@IHRV$d&JUmir$rGf@wE+amEsDt~AAwcPU?(Q=s@)0jidHqs`@u9ut7hg$^ z?`hf=BHhWJkKuN(q5aKCC|OQk3+DJ9N`2kQFa`{CT)HH#@fgap(c?_)x5o{ea8@q@ z2f0-kvm)E3Gb`#hhqmm$2CL-H9;Gnr-sKHdhBqKxk&N-*m`+r0e0Y(9$iQRXq)1w}po|(|?Ag zup~{ZY%#@|V)v`47PvkDjq$8{g$;AV0Duf)DZ%` zlLJ^=z84_ensLwMSYf;BOxODlc#s_1s)?M`&x%?E4KlR+?0T|)o-(7 z79z3*hi{wu=U6d&D4h{z$_wZOVx)m{w~;c`ow2g)_)tM&{*+ zSa3VP7+TaAF3UE8n!M2i9&29e9Jo~S-Lk$!Z0ntRTw_n&u{oGwWC&y)`>+>@T*s^| z`<){H)4KnK>AHqH=qnQXd+2I^nFAE)N?^uW>q&)Ug>{%N5foZ9ybdo`6|D1UBfGX& zO{M9xqBNUgT9hn@gq-S7lsJdE@HydKawqEGR@8Xql4X)%Q|enP6$>^dFze?qNGq6} z4~|#@FIz1mK=p(7Gw%~~i0M2^m&nDUKgDG&Lg4}ia$&w?&HGcl652s1mOJ8HffCYb;>+hy52 zmxztB4jHg?xz_@w&WCjiRu&daQBdGA?y~m37Wluxit6?F>l_YoWx%B2Mvt!w9&%KS zwRXs@JY8R3zLJ^L39!iucLoaGZfv4HTIsJ8r1!-`2LzLxddgM%bKlV!>I5>a;cj~D z@S-}sssyPhr6!MTPEhdD9{32{Qd3{ME=pVIKMe6Ian~}0a`{s(rk7+l9$mw~MVjpN zY9T$#y6MpO+5?NdON@ZMSC6rV`Ao0Jt(Bv7<)dQqKb+O*60!2cr5#YCo+0B0>W<3= z-D0TG1}g`Cr)}YZkF9giUpKybUoO_ft4ffy-e}emP9)DTaC{4_F_i(*f%!30dLE^< z6wKl__8ic0tUM74d7{vTilyZ%eeEm6%|dNye;n=66{rwh*yUwRD8|LK2LQWwfB^(r zaTlH$ViiOvZc~w>Q3q$KuL`eb9%fTLMsEV>Y9a?;DJW_7hZ2fY&Zc(<7b%;<=h)G? s;)ix#;F#&Pf17C-_l%9|Fvx&-N7uTY>rc6_yRbm~yaT;zJ&&IGCwd`~C;$Ke literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_s_s_g_a_worse_replacement-members.html b/trunk/paradiseo-eo/doc/html/classeo_s_s_g_a_worse_replacement-members.html new file mode 100644 index 000000000..641ca86f8 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_s_s_g_a_worse_replacement-members.html @@ -0,0 +1,22 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSSGAWorseReplacement< EOT > Member List

This is the complete list of members for eoSSGAWorseReplacement< EOT >, including all inherited members.

+ + + + + + + + +
eoReduceMerge(eoReduce< EOT > &_reduce, eoMerge< EOT > &_merge) (defined in eoReduceMerge< EOT >)eoReduceMerge< EOT > [inline]
eoSSGAWorseReplacement() (defined in eoSSGAWorseReplacement< EOT >)eoSSGAWorseReplacement< EOT > [inline]
functor_category()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
operator()(eoPop< EOT > &_parents, eoPop< EOT > &_offspring)eoReduceMerge< EOT > [inline, virtual]
plus (defined in eoSSGAWorseReplacement< EOT >)eoSSGAWorseReplacement< EOT > [private]
truncate (defined in eoSSGAWorseReplacement< EOT >)eoSSGAWorseReplacement< EOT > [private]
~eoBF()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_s_s_g_a_worse_replacement.html b/trunk/paradiseo-eo/doc/html/classeo_s_s_g_a_worse_replacement.html new file mode 100644 index 000000000..1b1472467 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_s_s_g_a_worse_replacement.html @@ -0,0 +1,48 @@ + + +EO: eoSSGAWorseReplacement< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSSGAWorseReplacement< EOT > Class Template Reference

SSGA replace worst. +More... +

+#include <eoReduceMerge.h> +

+

Inheritance diagram for eoSSGAWorseReplacement< EOT >: +

+ +eoReduceMerge< EOT > +eoReplacement< EOT > +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + +

Private Attributes

+eoLinearTruncate< EOT > truncate
+eoPlus< EOT > plus
+

Detailed Description

+

template<class EOT>
+ class eoSSGAWorseReplacement< EOT >

+ +SSGA replace worst. +

+Is an eoReduceMerge. +

+ +

+Definition at line 77 of file eoReduceMerge.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_s_s_g_a_worse_replacement.png b/trunk/paradiseo-eo/doc/html/classeo_s_s_g_a_worse_replacement.png new file mode 100644 index 0000000000000000000000000000000000000000..124eb363fce65fd4a7d2f58e3917d07337f10189 GIT binary patch literal 2248 zcmb`JX;4#X7KYOevS|QIkwqX1)2JW>ArJy_X$a5=9hIdSkg(Vdh-@86AOiwZLZC$m zin2&pMTM|Bf)Yd)J7XeiWKEC&hRY(PS<(R$2q6=lDP^ksGgb5B-tWDq&R2E6=bZQ4 zd*eLX8LXnC0s?`+E}%th z-3_NVcezyQ`Mx`svVmqqiVYBd^7|ZJ2H@Gr&@S2`vo4^Ne|;-BOO3hPV#r2I$Jqh6 zd|9`zi@r{=iGP$=g%rTG4S~iaHQEP^V|mN3oKzxPUO^H`P!W`^on3F7b}WfNTGixL zy;VJlx^&HTE3L=SjZov5K8K^5&!-rNeCKN0Lmh0XvmDc6P37ho89Y#S4a*$=Cbn0* zmX5at&yCmKiPlmO_pbp~#<=s9Q;+{r`QzDnGZK?|E7LK~t1(0n9MVTypl5|FS!v~W zJNAYiiXgRCE}aP~L)y)8hp&)$!U)nyVsjvkOqlN1Ogj%z?bnGwy?9A| z{5Sm>J7AE7)zf3bx7VE7=GasdZVUk?iu=P+R+CtY)UympMvBB!IcuF=Nykd8a~10bQ_Z-kM*k)*G+taEWvDG?c+$(Id0+LyNy} zrel(r4Vme>$sx<5BBP7>mcbLX9ML_5J_|bw>FyPY7YQ##NR;C+gt;h+@wi=qNjFgw zxZkS@K?qkUz<|G_i^)&UcgJhkw)Ls;Q~s}h(jX6{!0X|PK^56YC04w;)(sJ_amC@Z)Js2tN z%L`xD1!q;1V`2XteDS(r)cb=sKQ25{Q8cp2@UAZVoKlz#i+T&Eyil8dRC(uWv5#AN z-sLLW;L!r1$`%fIcmQ3^HXn#}&18h^9B1Qq^+noCpFyXyZ40M{sH=4%l)kP*K=**xjLpSjt7Fa3 zb%9U49p=JDy0)f4Klb*n6m@@?*il?^r+Mv017-cZYwlK^l`=_F#UJ& zjaPxvQlNn+qEcQD)YEbmpL)(!`}9k)776S?_B2^hLc_E6#*TK?JES`0;v0tv4Q<`} zvAFW%O$v2nuj_OnnDTL%Le%_IlG(fiomu3Ib)veL-WxvRZ5cI1B@^;h}t2;N-HNQ7-s_V1`r44W|gk5w{S(e-DWaePl~)G<6|L%G>n zAOA+2!hdQt#5LM4gw>~p@0n@cXS`6TllFLFWM)%=cv^mN!dhY!cJ0WZ)rq_9nt4m% z8k?6W7mjMj>l#lfn^-12c*1#0Rlk}GX{Vf!fQl}S-;D0#%XP1W`6;zD4ewTK^Eh0D zomze)B#e9J#?K02`ZNfBkGVedTKi1k9sjO4Um&iP`?RwzfzWKz4JF*WV-=JeqU92eZ$1{EXZ`)%%YM?zx9$Us}B|g`OXkjy)o8l{BQyZ6c+^t=n;SZkavN zw(`ZJ{8bWtNY%b#)wDaJ!y%ND`q0ze46MfF5eUwJPk!x%+P##uHmSUyT-}hJ{v?|) zxb$n-_A{*j)e_Ffy{;3gby#ulnqUo*7MVbZWzg(&pg6ldh*P!zx*_{xQVAW7_j@H# z&9Ba3@jYzyCkI5a4bySog)~gJr%oX03Asa`f=Q~)caEO{rVPW7zyy6{K-yWRw9~VN zt_PzN52G}^t+$;BM0FWZ+H!)d9rv`Zl$T>|kTLha9C`=s{~^dXD5e@D%4WfP*(6i> z&v#8$gO)qk!<;%xF|mJZ@d@jFFP8G@?N3i8a$ZyQC&}b(i@3xtk@3tq`UJ2% zUn(}u9LF`$Xr>nR+3$~Fv)pHZL;l=R031LX?nrmw@`HP + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSTLBF< A1, A2, R > Member List

This is the complete list of members for eoSTLBF< A1, A2, R >, including all inherited members.

+ + + +
eoSTLBF(eoUF< A1, R > &_f) (defined in eoSTLBF< A1, A2, R >)eoSTLBF< A1, A2, R > [inline]
f (defined in eoSTLBF< A1, A2, R >)eoSTLBF< A1, A2, R > [private]
operator()(A1 a1, A2 a2) (defined in eoSTLBF< A1, A2, R >)eoSTLBF< A1, A2, R > [inline]

Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_s_t_l_b_f.html b/trunk/paradiseo-eo/doc/html/classeo_s_t_l_b_f.html new file mode 100644 index 000000000..37744a334 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_s_t_l_b_f.html @@ -0,0 +1,45 @@ + + +EO: eoSTLBF< A1, A2, R > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSTLBF< A1, A2, R > Class Template Reference

Generic set of classes that wrap an eoF, eoUF or eoBF so that they have the copy semantics the STL functions usually require (i.e. +More... +

+#include <eoSTLFunctor.h> +

+List of all members. + + + + + + + + + +

Public Member Functions

+ eoSTLBF (eoUF< A1, R > &_f)
+R operator() (A1 a1, A2 a2)

Private Attributes

+eoBF< A1, A2, R > & f
+

Detailed Description

+

template<class A1, class A2, class R>
+ class eoSTLBF< A1, A2, R >

+ +Generic set of classes that wrap an eoF, eoUF or eoBF so that they have the copy semantics the STL functions usually require (i.e. +

+they can be passed by value, rather than the EO standard pass by reference).

+The family consists of eoSTLF, eoSTLUF, eoSTLBF that modify eoF, eoUF and eoBF respectively +

+ +

+Definition at line 101 of file eoSTLFunctor.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_s_t_l_f-members.html b/trunk/paradiseo-eo/doc/html/classeo_s_t_l_f-members.html new file mode 100644 index 000000000..6dbc55ddf --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_s_t_l_f-members.html @@ -0,0 +1,18 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSTLF< R > Member List

This is the complete list of members for eoSTLF< R >, including all inherited members.

+ + + + +
eoSTLF(eoF< R > &_f) (defined in eoSTLF< R >)eoSTLF< R > [inline]
f (defined in eoSTLF< R >)eoSTLF< R > [private]
operator()(void) (defined in eoSTLF< R >)eoSTLF< R > [inline]
result_type typedef (defined in eoSTLF< R >)eoSTLF< R >

Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_s_t_l_f.html b/trunk/paradiseo-eo/doc/html/classeo_s_t_l_f.html new file mode 100644 index 000000000..93438486d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_s_t_l_f.html @@ -0,0 +1,49 @@ + + +EO: eoSTLF< R > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSTLF< R > Class Template Reference

Generic set of classes that wrap an eoF, eoUF or eoBF so that they have the copy semantics the STL functions usually require (i.e. +More... +

+#include <eoSTLFunctor.h> +

+List of all members. + + + + + + + + + + + + +

Public Types

+typedef R result_type

Public Member Functions

+ eoSTLF (eoF< R > &_f)
+R operator() (void)

Private Attributes

+eoF< R > & f
+

Detailed Description

+

template<class R>
+ class eoSTLF< R >

+ +Generic set of classes that wrap an eoF, eoUF or eoBF so that they have the copy semantics the STL functions usually require (i.e. +

+they can be passed by value, rather than the EO standard pass by reference).

+The family consists of eoSTLF, eoSTLUF, eoSTLBF that modify eoF, eoUF and eoBF respectively +

+ +

+Definition at line 41 of file eoSTLFunctor.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_s_t_l_u_f-members.html b/trunk/paradiseo-eo/doc/html/classeo_s_t_l_u_f-members.html new file mode 100644 index 000000000..7971d6c45 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_s_t_l_u_f-members.html @@ -0,0 +1,17 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSTLUF< A1, R > Member List

This is the complete list of members for eoSTLUF< A1, R >, including all inherited members.

+ + + +
eoSTLUF(eoUF< A1, R > &_f) (defined in eoSTLUF< A1, R >)eoSTLUF< A1, R > [inline]
f (defined in eoSTLUF< A1, R >)eoSTLUF< A1, R > [private]
operator()(A1 a) (defined in eoSTLUF< A1, R >)eoSTLUF< A1, R > [inline]

Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_s_t_l_u_f.html b/trunk/paradiseo-eo/doc/html/classeo_s_t_l_u_f.html new file mode 100644 index 000000000..12764e349 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_s_t_l_u_f.html @@ -0,0 +1,45 @@ + + +EO: eoSTLUF< A1, R > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSTLUF< A1, R > Class Template Reference

Generic set of classes that wrap an eoF, eoUF or eoBF so that they have the copy semantics the STL functions usually require (i.e. +More... +

+#include <eoSTLFunctor.h> +

+List of all members. + + + + + + + + + +

Public Member Functions

+ eoSTLUF (eoUF< A1, R > &_f)
+R operator() (A1 a)

Private Attributes

+eoUF< A1, R > & f
+

Detailed Description

+

template<class A1, class R>
+ class eoSTLUF< A1, R >

+ +Generic set of classes that wrap an eoF, eoUF or eoBF so that they have the copy semantics the STL functions usually require (i.e. +

+they can be passed by value, rather than the EO standard pass by reference).

+The family consists of eoSTLF, eoSTLUF, eoSTLBF that modify eoF, eoUF and eoBF respectively +

+ +

+Definition at line 78 of file eoSTLFunctor.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_scalar_fitness-members.html b/trunk/paradiseo-eo/doc/html/classeo_scalar_fitness-members.html new file mode 100644 index 000000000..8e45aa97e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_scalar_fitness-members.html @@ -0,0 +1,25 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoScalarFitness< ScalarType, Compare > Member List

This is the complete list of members for eoScalarFitness< ScalarType, Compare >, including all inherited members.

+ + + + + + + + + + + +
eoScalarFitness() (defined in eoScalarFitness< ScalarType, Compare >)eoScalarFitness< ScalarType, Compare > [inline]
eoScalarFitness(const eoScalarFitness &other) (defined in eoScalarFitness< ScalarType, Compare >)eoScalarFitness< ScalarType, Compare > [inline]
eoScalarFitness(const ScalarType &v) (defined in eoScalarFitness< ScalarType, Compare >)eoScalarFitness< ScalarType, Compare > [inline]
operator ScalarType(void) const (defined in eoScalarFitness< ScalarType, Compare >)eoScalarFitness< ScalarType, Compare > [inline]
operator<(const eoScalarFitness &other) const eoScalarFitness< ScalarType, Compare > [inline]
operator<=(const eoScalarFitness< ScalarType, Compare > &y) const (defined in eoScalarFitness< ScalarType, Compare >)eoScalarFitness< ScalarType, Compare > [inline]
operator=(const eoScalarFitness &other) (defined in eoScalarFitness< ScalarType, Compare >)eoScalarFitness< ScalarType, Compare > [inline]
operator=(const ScalarType &v) (defined in eoScalarFitness< ScalarType, Compare >)eoScalarFitness< ScalarType, Compare > [inline]
operator>(const eoScalarFitness< ScalarType, Compare > &y) const (defined in eoScalarFitness< ScalarType, Compare >)eoScalarFitness< ScalarType, Compare > [inline]
operator>=(const eoScalarFitness< ScalarType, Compare > &y) const (defined in eoScalarFitness< ScalarType, Compare >)eoScalarFitness< ScalarType, Compare > [inline]
value (defined in eoScalarFitness< ScalarType, Compare >)eoScalarFitness< ScalarType, Compare > [private]

Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_scalar_fitness.html b/trunk/paradiseo-eo/doc/html/classeo_scalar_fitness.html new file mode 100644 index 000000000..1c619309b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_scalar_fitness.html @@ -0,0 +1,67 @@ + + +EO: eoScalarFitness< ScalarType, Compare > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoScalarFitness< ScalarType, Compare > Class Template Reference

eoScalarFitness<ScalarType, Compare = less<ScalarType> >: Wraps a scalar fitness values such as a double or int, with the option of maximizing (using less<ScalarType>) or minimizing (using greater<ScalarType>) +More... +

+#include <eoScalarFitness.h> +

+List of all members. + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoScalarFitness (const eoScalarFitness &other)
+ eoScalarFitness (const ScalarType &v)
+eoScalarFitness & operator= (const eoScalarFitness &other)
+eoScalarFitness & operator= (const ScalarType &v)
+ operator ScalarType (void) const
+bool operator< (const eoScalarFitness &other) const
 Comparison, using less by default.
+bool operator> (const eoScalarFitness< ScalarType, Compare > &y) const
+bool operator<= (const eoScalarFitness< ScalarType, Compare > &y) const
+bool operator>= (const eoScalarFitness< ScalarType, Compare > &y) const

Private Attributes

+ScalarType value
+

Detailed Description

+

template<class ScalarType, class Compare>
+ class eoScalarFitness< ScalarType, Compare >

+ +eoScalarFitness<ScalarType, Compare = less<ScalarType> >: Wraps a scalar fitness values such as a double or int, with the option of maximizing (using less<ScalarType>) or minimizing (using greater<ScalarType>) +

+It overrides operator<() to use the Compare template argument

+Suitable constructors and assignments and casts are defined to work with this quantity as if it were a ScalarType. +

+ +

+Definition at line 43 of file eoScalarFitness.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_scalar_fitness_assembled-members.html b/trunk/paradiseo-eo/doc/html/classeo_scalar_fitness_assembled-members.html new file mode 100644 index 000000000..31f109c18 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_scalar_fitness_assembled-members.html @@ -0,0 +1,37 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > Member List

This is the complete list of members for eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + +
baseVector typedef (defined in eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits >)eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits >
eoScalarFitnessAssembled() (defined in eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits >)eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > [inline]
eoScalarFitnessAssembled(size_type _n, const ScalarType &_val, const std::string &_descr="Unnamed variable") (defined in eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits >)eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > [inline]
eoScalarFitnessAssembled(const eoScalarFitnessAssembled &other) (defined in eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits >)eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > [inline]
eoScalarFitnessAssembled(const ScalarType &v) (defined in eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits >)eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > [inline]
failedeoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits >
feasibleeoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits >
getDescription(size_type _idx)eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > [inline]
getDescriptionVector()eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > [inline]
msgeoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits >
operator ScalarType(void) const (defined in eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits >)eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > [inline]
operator<(const eoScalarFitnessAssembled &other) const (defined in eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits >)eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > [inline]
operator<=(const eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > &y) const (defined in eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits >)eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > [inline]
operator=(const eoScalarFitnessAssembled &other) (defined in eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits >)eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > [inline]
operator=(const ScalarType &v) (defined in eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits >)eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > [inline]
operator>(const eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > &y) const (defined in eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits >)eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > [inline]
operator>=(const eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > &y) const (defined in eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits >)eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > [inline]
printAll(std::ostream &os) const eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > [inline]
push_back(const ScalarType &_val)eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > [inline]
push_back(const ScalarType &_val, const std::string &_descr)eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > [inline]
resize(size_type _n, const ScalarType &_val=ScalarType(), const std::string &_descr="Unnamed variable")eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > [inline]
setDescription(size_type _idx, std::string _descr)eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > [inline]
size_type typedef (defined in eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits >)eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits >

Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_scalar_fitness_assembled.html b/trunk/paradiseo-eo/doc/html/classeo_scalar_fitness_assembled.html new file mode 100644 index 000000000..b906771d7 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_scalar_fitness_assembled.html @@ -0,0 +1,145 @@ + + +EO: eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > Class Template Reference

Implements fitness as std::vector, storing all values that might occur during fitness assembly. +More... +

+#include <eoScalarFitnessAssembled.h> +

+List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef std::vector< ScalarType > baseVector
+typedef baseVector::size_type size_type

Public Member Functions

+ eoScalarFitnessAssembled (size_type _n, const ScalarType &_val, const std::string &_descr="Unnamed variable")
+ eoScalarFitnessAssembled (const eoScalarFitnessAssembled &other)
+eoScalarFitnessAssembled & operator= (const eoScalarFitnessAssembled &other)
+ eoScalarFitnessAssembled (const ScalarType &v)
+eoScalarFitnessAssembled & operator= (const ScalarType &v)
+void push_back (const ScalarType &_val)
 Overload push_back().
+void push_back (const ScalarType &_val, const std::string &_descr)
 Overload push_back().
+void resize (size_type _n, const ScalarType &_val=ScalarType(), const std::string &_descr="Unnamed variable")
 Overload resize().
+void setDescription (size_type _idx, std::string _descr)
 Set description.
+std::string getDescription (size_type _idx)
 Get description.
+std::vector< std::string > getDescriptionVector ()
 Get vector with descriptions.
+ operator ScalarType (void) const
+void printAll (std::ostream &os) const
 Print term values and descriptions.
+bool operator< (const eoScalarFitnessAssembled &other) const
+bool operator> (const eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > &y) const
+bool operator<= (const eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > &y) const
+bool operator>= (const eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > &y) const

Public Attributes

+bool feasible
 Can be specified anywhere in fitness evaluation as an indicator if the individual is in some feasible range.
+bool failed
 Can be specified anywhere in fitness evaluation as an indicator if the evaluation of the individual failed.
std::string msg
 Can be specified anywhere in fitness evaluation.
+

Detailed Description

+

template<class ScalarType, class Compare, class FitnessTraits>
+ class eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits >

+ +Implements fitness as std::vector, storing all values that might occur during fitness assembly. +

+Properties:

    +
  • Wraps a scalar fitness values such as a double or int, with the option of maximizing (using less<ScalarType>) or minimizing (using greater<ScalarType>).
  • Stores all kinda different values met during fitness assembly, to be defined in eoEvalFunc.
  • It overrides operator<() to use the Compare template argument.
  • Suitable constructors and assignments and casts are defined to work with this quantity as if it were a ScalarType.
  • Global fitness value is stored as first element in the vector
+ +

+ +

+Definition at line 88 of file eoScalarFitnessAssembled.h.

Member Data Documentation

+

+ + + + +
+ + + + + + + +
+template<class ScalarType, class Compare, class FitnessTraits>
std::string eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits >::msg
+
+ + + + + +
+   + + +

+Can be specified anywhere in fitness evaluation. +

+Typically used to store some sort of error messages, if evaluation of individual failed. +

+Definition at line 195 of file eoScalarFitnessAssembled.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_scalar_fitness_assembled_traits-members.html b/trunk/paradiseo-eo/doc/html/classeo_scalar_fitness_assembled_traits-members.html new file mode 100644 index 000000000..b599db77a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_scalar_fitness_assembled_traits-members.html @@ -0,0 +1,21 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoScalarFitnessAssembledTraits Member List

This is the complete list of members for eoScalarFitnessAssembledTraits, including all inherited members.

+ + + + + + + +
getDescription(size_type _idx) (defined in eoScalarFitnessAssembledTraits)eoScalarFitnessAssembledTraits [inline, static]
getDescriptionVector() (defined in eoScalarFitnessAssembledTraits)eoScalarFitnessAssembledTraits [inline, static]
resize(size_type _n, const std::string &_descr) (defined in eoScalarFitnessAssembledTraits)eoScalarFitnessAssembledTraits [inline, static]
setDescription(size_type _idx, std::string _descr) (defined in eoScalarFitnessAssembledTraits)eoScalarFitnessAssembledTraits [inline, static]
size() (defined in eoScalarFitnessAssembledTraits)eoScalarFitnessAssembledTraits [inline, static]
size_type typedef (defined in eoScalarFitnessAssembledTraits)eoScalarFitnessAssembledTraits
TermDescriptions (defined in eoScalarFitnessAssembledTraits)eoScalarFitnessAssembledTraits [private, static]

Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_scalar_fitness_assembled_traits.html b/trunk/paradiseo-eo/doc/html/classeo_scalar_fitness_assembled_traits.html new file mode 100644 index 000000000..05ca72134 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_scalar_fitness_assembled_traits.html @@ -0,0 +1,57 @@ + + +EO: eoScalarFitnessAssembledTraits Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoScalarFitnessAssembledTraits Class Reference

Defines properties of eoScalarFitnessAssembled. +More... +

+#include <eoScalarFitnessAssembled.h> +

+List of all members. + + + + + + + + + + + + + + + + + + +

Public Types

+typedef std::vector< std::string
+>::size_type 		size_type

Static Public Member Functions

+void setDescription (size_type _idx, std::string _descr)
+std::string getDescription (size_type _idx)
+void resize (size_type _n, const std::string &_descr)
+size_type size ()
+std::vector< std::string > getDescriptionVector ()

Static Private Attributes

+std::vector< std::string > TermDescriptions
+

Detailed Description

+Defines properties of eoScalarFitnessAssembled. +

+Properties that are hold in this traits class:

    +
  • std::vector<std::string> to hold descriptions of the different fitness terms
+ +

+ +

+Definition at line 43 of file eoScalarFitnessAssembled.h.

The documentation for this class was generated from the following files: +
Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_scalar_fitness_stat-members.html b/trunk/paradiseo-eo/doc/html/classeo_scalar_fitness_stat-members.html new file mode 100644 index 000000000..8bbdce503 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_scalar_fitness_stat-members.html @@ -0,0 +1,40 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoScalarFitnessStat< EOT, FitT > Member List

This is the complete list of members for eoScalarFitnessStat< EOT, FitT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + +
className(void) const (defined in eoSortedStat< EOT, std::vector< double > >)eoSortedStat< EOT, std::vector< double > > [inline, virtual]
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoScalarFitnessStat(std::string _description="FitnessES", eoRealVectorBounds &_bounds=eoDummyVectorNoBounds) (defined in eoScalarFitnessStat< EOT, FitT >)eoScalarFitnessStat< EOT, FitT > [inline]
eoSortedStat(std::vector< double >_value, std::string _desc) (defined in eoSortedStat< EOT, std::vector< double > >)eoSortedStat< EOT, std::vector< double > > [inline]
eoValueParam(void)eoValueParam< std::vector< double > > [inline]
eoValueParam(std::vector< double >_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< std::vector< double > > [inline]
functor_category()eoUF< const std::vector< const EOT * > &, void > [inline, static]
getValue(void) const eoValueParam< std::vector< double > > [inline, virtual]
lastCall(const std::vector< const EOT * > &) (defined in eoSortedStatBase< EOT >)eoSortedStatBase< EOT > [inline, virtual]
longName() const eoParam [inline]
operator()(const std::vector< const EOT * > &_popPters)eoScalarFitnessStat< EOT, FitT > [inline, virtual]
range (defined in eoScalarFitnessStat< EOT, FitT >)eoScalarFitnessStat< EOT, FitT > [private]
repValue (defined in eoValueParam< std::vector< double > >)eoValueParam< std::vector< double > > [protected]
required() const eoParam [inline]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< std::vector< double > > [inline, virtual]
shortName() const eoParam [inline]
value()eoValueParam< std::vector< double > > [inline]
value() const eoValueParam< std::vector< double > > [inline]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]
~eoUF()eoUF< const std::vector< const EOT * > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_scalar_fitness_stat.html b/trunk/paradiseo-eo/doc/html/classeo_scalar_fitness_stat.html new file mode 100644 index 000000000..46e39b612 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_scalar_fitness_stat.html @@ -0,0 +1,53 @@ + + +EO: eoScalarFitnessStat< EOT, FitT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoScalarFitnessStat< EOT, FitT > Class Template Reference

The fitnesses of a whole population, as a std::vector. +More... +

+#include <eoScalarFitnessStat.h> +

+

Inheritance diagram for eoScalarFitnessStat< EOT, FitT >: +

+ +eoSortedStat< EOT, std::vector< double > > +eoSortedStatBase< EOT > +eoValueParam< std::vector< double > > +eoUF< const std::vector< const EOT * > &, void > +eoParam +eoFunctorBase + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoScalarFitnessStat (std::string _description="FitnessES", eoRealVectorBounds &_bounds=eoDummyVectorNoBounds)
+virtual void operator() (const std::vector< const EOT * > &_popPters)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+eoRealBounds & range
+

Detailed Description

+

template<class EOT, class FitT = typename EOT::Fitness>
+ class eoScalarFitnessStat< EOT, FitT >

+ +The fitnesses of a whole population, as a std::vector. +

+ +

+Definition at line 37 of file eoScalarFitnessStat.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_scalar_fitness_stat.png b/trunk/paradiseo-eo/doc/html/classeo_scalar_fitness_stat.png new file mode 100644 index 0000000000000000000000000000000000000000..e00c3cf0e96297a42f9b925bdd30253370cf3676 GIT binary patch literal 2972 zcma)8c|6ox8=sOCMY82*a5EHHx?{#tmKGX@NnvEkmQgd7s|+zrNSiD_p=+5M$vO?f z;D#`^+c1XAWNDNN<5E-%C0X*$?f!E=_kHhu?;qzp&w0-IoO3?s`~5!8Nj&Lbvt1I9 zgg_wM(YDr35Qtc^$Y0tdChF^OAq66{>m&wyY<+!QaOiM;QvwY8PpzCIxu zZU}dBaE2V7)D|;*Od^BH_o#$Jccey% zIpPkPynGA8y?(#K^<7wW3Y=^|;2RCoS8gXrlF4z3Yd`9hOs$pBbcr)}(FWs@`uoU> zuWTHXS-f?`x0lsl7L1}JYxH;o)l3p&k2TC9d^VAT!5zxDoQS-k?sRZ@9mh9O4)Gke zS2g&Ff=5$=<6z0! zyJRr-G0#5k)DXe%D(Aq6M5k*z)W!Q`K{_mmXG)>(02zHnVh!c92ypkKL*9kOw&Zen z%H74|&bed|YSxFWC~!Q-z?C?bXBLL;izrPz=EGGodL#?J3x*~GxPSt< ziVAIzZ_3Cj(tW?ca5Sj9L*JvQ)2%i4Qbpx9rL?AP$a9=f0o z#V#Oc&mGf1htLwc-s6ZtogOSX3HJH~!bSF1gv&H`Wg-Umnm)f>^AT+`zI1ASGzQnQ zkKR#Om&?s@9x|;{TlXk7T)Rpn^yma#8i-aGLr#vm3b<}Egr0a5p?A5q=Wr;ah(Ppy&+_w}`W5Hyq#C%oVgq$8d)wpq` zRetZ(@Afi_disOpdl4l=e$lNG?cOk0(Q0`g{;wuyQS?_KEfUr#lJ_0OxeqoHup5x2 z5Wocj?z@aqI9&K&Vf?)72btQCy#tLAT8|d`@`0eZrb~#pglLoH1JML|kt%dIg38=2 zpaQ*s_jNE#y=baR*!gPb;}fR_J~u-3UruMA->&2!6FJkfQ${hu!a?w|Cf$Faf64bv z2pFCv(4Wc>NST;;;d*rl*on6=p?MFu?+SVHw0_g zh3w%NtZ3zMdP6U>>gN$>VGLvQ=QfpvxzsXv#Zd$Opp2s)AoaF|Tg!uACKkG$MW0mC z(Sa@TGf_#XkH?Fhy(;AGBm=fcb9d#nWn}v^o1@ML5A_qanH1UQ>EdN>ayXT8Thrw3 zdSh5DB=FTtwdt8{Th$_oih7F5Xu`ZCzL1K?pGDmIMJq{MmHc^Y{XguzLnOTbQ2ranum(n9~Ci{Al}3CeURVDiPd!40or{ zKMkmTC}i_Z%UP(v>y5Q)!~A+A`xPd0wsU{d*$d^S#?!p6+fN$`(JH4)D)SoxN)BG5 zlop$guTh7t-dt$m(qD+!dB*R&U$Be$a$MV^$MZU zp8$(zZ6jP`B|*y=i*MF``UByx2doal=RWYfh?(vpI=t`%nZr~?5hH=6!0P5#g*dYWkCF>l}IeIgr3VHv1}2gUBO+W$2oNxCE;laM3^pO7tGi}8%#?_6{LivZ%qYg-t-*RdV|_qyr>i1oz|TE(S)xHU_JL5? z9GA-qHX8kkrljFJ+&%m){oht)3|x`+@_1tTQ@0Yy5%wHjP6_sJAb0QI+3lt6b?QfH zcWb?7ZvEsZ>v6xuSUBE$d>F7iCzeMGMQ{8eN|&HO>~7m#mb#yl(pbMtDhc)JTrNP- zVe2)+z%=vY?z2`qY|7~U%aiZYL!$14-(-g+Z{q~M-EW?GYtWVr4X!p`ZKVUjn82~k z?)jJQGvFZ0ORX*l>I9;)T9q!s>*8;^U*l*^q+OiO8M}BZkH+iTIBO7C^j>wfXS)r~ zR(BGwV1F*P$@!H)cnoyv+!3;8(muaPe(VXVc*xeJU{}y@wnN%%TOw$fNahKq0#c%M z6+x?vX4nU;mbeWSPgMf15-4>LXZSeW|P1On!sbuy2X-LE69DGrt~;1v2j zxUuv|*-O*vhsbj{!4EDXF^q)-Bkfoyia4=b+N=v>6z)2NXH@+h)^Qf$67_~Oj>*(? z^D&~(Z*->GW!GNFAJ6iMBN|)mZzvj5F3+L_y3C!1{(&tFd1@1Y_!Ae8sHIX*&c4Xx zOV3}RvL8l>TS^hIM+)sLVewYd$Uw+eC>8=9Y?Zh9`=oWHa@M$EFr@yCRav^U;lE99 z&!%mBkD$ubZ6%cdln&>vuyPbS*fMy3@QeYxiCE@tNQPzwZUCfK-38UtqygJ94Vkaf zoEdp5ocO(fqU-6o!H?5EY3M1veUH&~4-0bZLpd7Dt^2OZ*e zqZ7tgScLi3@0VF?c`{5zhQdVmS_9(JFjHFh8IV|7>0j!=s0_3XF*n8fUAVqFIwGlW zW&+2hH;7(UB4_-;Kh=wW()wSjOJ5P9*RhdpnO+egZrtw;p19wP3aDi5<$4#^x(eh7 zm5wjUgj;K$YkwGA+Vsez+tB5`Ut)vjtib?f=C^5+ig}X3+;!IZ3r8Xwx;tP&t5W3HM{8L7#4JZj3@T74j{(X;aPz@TU4jfiXOuIlF(I-cr% z5&AsG;`Tl_d%$W*c&<_`B{cey6zZ%d0lw1uRPLqyu?ZbZ65`Fd+A@vXRdtby{0gCl zY`B(wY`q-qeXsr4P0d+D`4RwhM}`Qufa1o4PjbqMO+O~QBWZM;^)8GI)6!`hy_A&r zB?=0jHb07s*XNP)FDIX|) ri$HNRkaw62KKnoKIwz5;ye`&DH8pQsaEK9or6K5J4%QV%eXslnqa=Nq literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_second_moment_stats-members.html b/trunk/paradiseo-eo/doc/html/classeo_second_moment_stats-members.html new file mode 100644 index 000000000..12497ef93 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_second_moment_stats-members.html @@ -0,0 +1,42 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSecondMomentStats< EOT > Member List

This is the complete list of members for eoSecondMomentStats< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + +
className(void) const (defined in eoSecondMomentStats< EOT >)eoSecondMomentStats< EOT > [inline, virtual]
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoSecondMomentStats(std::string _description="Average & Stdev") (defined in eoSecondMomentStats< EOT >)eoSecondMomentStats< EOT > [inline]
eoStat(std::pair< double, double >_value, std::string _description) (defined in eoStat< EOT, std::pair< double, double > >)eoStat< EOT, std::pair< double, double > > [inline]
eoValueParam(void)eoValueParam< std::pair< double, double > > [inline]
eoValueParam(std::pair< double, double >_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< std::pair< double, double > > [inline]
fitness_type typedef (defined in eoSecondMomentStats< EOT >)eoSecondMomentStats< EOT >
functor_category()eoUF< const eoPop< EOT > &, void > [inline, static]
getValue(void) const eoValueParam< std::pair< double, double > > [inline, virtual]
lastCall(const eoPop< EOT > &) (defined in eoStatBase< EOT >)eoStatBase< EOT > [inline, virtual]
longName() const eoParam [inline]
operator()(const eoPop< EOT > &_pop)eoSecondMomentStats< EOT > [inline, virtual]
repValue (defined in eoValueParam< std::pair< double, double > >)eoValueParam< std::pair< double, double > > [protected]
required() const eoParam [inline]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< std::pair< double, double > > [inline, virtual]
shortName() const eoParam [inline]
SquarePair typedef (defined in eoSecondMomentStats< EOT >)eoSecondMomentStats< EOT >
sumOfSquares(SquarePair _sq, const EOT &_eo) (defined in eoSecondMomentStats< EOT >)eoSecondMomentStats< EOT > [inline, static]
value()eoValueParam< std::pair< double, double > > [inline]
value() const eoValueParam< std::pair< double, double > > [inline]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_second_moment_stats.html b/trunk/paradiseo-eo/doc/html/classeo_second_moment_stats.html new file mode 100644 index 000000000..30f968662 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_second_moment_stats.html @@ -0,0 +1,66 @@ + + +EO: eoSecondMomentStats< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSecondMomentStats< EOT > Class Template Reference

Average fitness + Std. +More... +

+#include <eoStat.h> +

+

Inheritance diagram for eoSecondMomentStats< EOT >: +

+ +eoStat< EOT, std::pair< double, double > > +eoValueParam< std::pair< double, double > > +eoStatBase< EOT > +eoParam +eoUF< const eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::Fitness fitness_type
+typedef std::pair< double,
+ double > 		SquarePair

Public Member Functions

+ eoSecondMomentStats (std::string _description="Average & Stdev")
+virtual void operator() (const eoPop< EOT > &_pop)
 The pure virtual function that needs to be implemented by the subclass.
+virtual std::string className (void) const

Static Public Member Functions

+SquarePair sumOfSquares (SquarePair _sq, const EOT &_eo)
+

Detailed Description

+

template<class EOT>
+ class eoSecondMomentStats< EOT >

+ +Average fitness + Std. +

+dev. of a population, fitness needs to be scalar. +

+ +

+Definition at line 168 of file eoStat.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_second_moment_stats.png b/trunk/paradiseo-eo/doc/html/classeo_second_moment_stats.png new file mode 100644 index 0000000000000000000000000000000000000000..8d7a266e6177ac89d02a6c230438dbc943cda0c1 GIT binary patch literal 2808 zcmdT`X;f3!7LFpCfl*K_5O@$JiVSK6R06Rw71V%XD9R|HE(AhCQ9{8)B>^l7g2g~d z9v~v1Oa&`JhQMWr3~CiYlt2=Y5Dmh0N}>?bv@ZMft@Tz{f4(34p8f58?vFj3Z|`$H zI1f#@AshmMXnKC@iibd!^HsWhg_`QyyPDynI@bB@^K(-wl`2)K>?ke{zo^pwl#Y&$ z6hQe*1(zk_alVkzi z*`8Us`!r*I4hzNRS9S=89djNG0^)_hJ_qm_?*?^;Xd zx;41-aI`yJ59K0{8obCuPL5Cj#@1$qp>}q|`i1jPkZc>rS;pf@LU&D%cHmXm{dp~t z#K$Cs93QzL8AVRr*-mI2b9~y!tCD68Gx@*3Ow-=%VLNrQj&wtlF3*@j z9i$>!m_>^n4>|Fbq!1)^N~ononRRT)EGKJh=33hHuib4~j9rtxY_*xIETZx}9c{z> zRp5})XCj+<{wo}*8RL+{ZHP?$rMX+QzxBOKTdv|q7^x+n~*OA%fy1*py$w*Ep=j5(&L zD{R`>#G5Aqqw*sbb0#cE(chCByb3jc2x$^ns?QL=*1(3ATa^{#Cz-Rsv>NH!T8qV2 zoq$a{E;jo2Zw@P`oglY+c}^6T*Whm_)N7e$S@Wk;$0vpcLoH1&4P0a@`!vgeJ|AIsB{9Np$JU25j{n8P zj%H#|S;UJI>7HxC4v@t^=%UBE^W0glAC2M?S9@iHhr=*(HHz)x?*5;~twJLDw~KwQ zUA9S0$angBL{?3Tn-;u1>f(Pg&aLuUZhAzS!oH={2$7y%ucpoHg4DveD|bHTp+m^x z%AZfAojayU*n0%XvoJ=xTP;UC zUb5jB5bCRk;`ZrR08NIjkB-fNiL`|wgis!Jxwi+J^!Q990WfHNz8>S8m$Dse?;vcf z^R+&%b0BnU`9AV>j)O)a_>jF$`07VeY6dUFUCzX9TF`Y~HLzgliUnqZ*^Z}DV#Z+x z7+?y)+AV)&?Cd83n+v)w`NN$^NG4%P9N+mE~+Nyt!?gb88X4!M~qb zhX;0Hg31L}b}bjEcPz`*tf@n-^_Vt$dq26I4U{9@oCfE(H!6iCf40)coLe#rt^v*1 zGxZ*XjfYi5HS9o^pj4u&tC(BSjU8U|S97F##^Uuqp@9Fo3ni|qRQ1EI<-BFbRj%y+ z8+T=g;-Jha!NqRRv#_L0jnDfLN#|-Y>V;P?5x>K3^CQgPhEzl;zajN502g2nVhTgX zN}ZmSNI`usA(}eSiJUr+6o2dG5_SDHoj215hv^O1QBu^Hy4gt)u@87$gR0OQys z1BPf@Y#()_XS_ddt8|GN7PR{BD_nfqj>1&wWt|`g=>`lIA(Rt09|p;pP+Lb>WZ9uD zI|cdd@6z~9`P3soMeKJ0SB^HsqV_{ulZM+*@<&Jo-kbPaCyvqXACTLZ z(@LVBoMvL59JzK^aq!I25MAZyVH)lJyfD8(E3gH%O8=; z{*gP^_8g=sAA8n&4wB?T*ZWB4pWfhKbNmbQqB)0+wdYKk63p7(_b3=H!(g`Nz-Q6k@Dw0sFX31r!H-VG0UH+*9WBme_8oySwcIUl-O;QZSw zBrng5ztE0Hr}8(DADN7*ZkzT0GMpPG!;EP)h27IJo2+Ch1jk)#)T687P4bc$e$ z>;|@#1#Z@;NV*YRi@jM1exJNwqHS&2S~|G-%NRuS1|KI>8yFy7btY3av&4LDRk+db z7e8c4kQ=T5RSz8Y|3UYkB2ld`UxfXit>$mdayJwAwce`qBokMSmVRFG)SiO==#jyR zdyye;F(kP!nrLuG2U}+^p?_d8G`)_FQYl? zLg~^Q-CIR7L)qeYEs8wMS;c%6V0~=034!g*3Tk~%bXj=bUh?9dXsS7`DQ#jr<#sN? z87}M@F!!LBIkXo3kOLHJb2=%F&f_Ghy;g!_Mg?k-CvT(I&0m(A$h(UQL2jhcz|yzI zgVL7|+HCfv(qg@K+EL<#rlz4~rdPN?SML3s9TOxQOS%M#eIgsB#a~kxw-h462Uh7u1ONa4 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_segment_crossover-members.html b/trunk/paradiseo-eo/doc/html/classeo_segment_crossover-members.html new file mode 100644 index 000000000..acf7b27e8 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_segment_crossover-members.html @@ -0,0 +1,33 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSegmentCrossover< EOT > Member List

This is the complete list of members for eoSegmentCrossover< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
alpha (defined in eoSegmentCrossover< EOT >)eoSegmentCrossover< EOT > [protected]
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
bounds (defined in eoSegmentCrossover< EOT >)eoSegmentCrossover< EOT > [protected]
className() const eoSegmentCrossover< EOT > [inline, virtual]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
eoQuadOp()eoQuadOp< EOT > [inline]
eoSegmentCrossover(const double &_alpha=0.0)eoSegmentCrossover< EOT > [inline]
eoSegmentCrossover(eoRealVectorBounds &_bounds, const double &_alpha=0.0)eoSegmentCrossover< EOT > [inline]
functor_category()eoBF< EOT &, EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
operator()(EOT &_eo1, EOT &_eo2)eoSegmentCrossover< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
range (defined in eoSegmentCrossover< EOT >)eoSegmentCrossover< EOT > [protected]
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoBF()eoBF< EOT &, EOT &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]

Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_segment_crossover.html b/trunk/paradiseo-eo/doc/html/classeo_segment_crossover.html new file mode 100644 index 000000000..7667382f9 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_segment_crossover.html @@ -0,0 +1,213 @@ + + +EO: eoSegmentCrossover< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSegmentCrossover< EOT > Class Template Reference

eoSegmentCrossover --> uniform choice in segment == arithmetical with same value along all coordinates +More... +

+#include <Tutorial/eoRealOp.h> +

+

Inheritance diagram for eoSegmentCrossover< EOT >: +

+ +eoQuadOp< EOT > +eoOp< EOT > +eoBF< EOT &, EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

 eoSegmentCrossover (const double &_alpha=0.0)
 (Default) Constructor.
 eoSegmentCrossover (eoRealVectorBounds &_bounds, const double &_alpha=0.0)
 Constructor with bounds.
+virtual std::string className () const
 The class name.
bool operator() (EOT &_eo1, EOT &_eo2)
 segment crossover - modifies both parents

Protected Attributes

+eoRealVectorBounds & bounds
+double alpha
+double range
+

Detailed Description

+

template<class EOT>
+ class eoSegmentCrossover< EOT >

+ +eoSegmentCrossover --> uniform choice in segment == arithmetical with same value along all coordinates +

+ +

+Definition at line 247 of file eoRealOp.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
eoSegmentCrossover< EOT >::eoSegmentCrossover ( const double &  _alpha = 0.0  )  [inline]
+
+ + + + + +
+   + + +

+(Default) Constructor. +

+The bounds are initialized with the global object that says: no bounds.

+

Parameters:
+ + +
_alphaMin the amount of exploration OUTSIDE the parents as in BLX-alpha notation (Eshelman and Schaffer) 0 == contractive application Must be positive
+
+ +

+Definition at line 259 of file eoRealOp.h.

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
eoSegmentCrossover< EOT >::eoSegmentCrossover ( eoRealVectorBounds &  _bounds,
const double &  _alpha = 0.0
)  [inline]
+
+ + + + + +
+   + + +

+Constructor with bounds. +

+

Parameters:
+ + + +
_bounds an eoRealVectorBounds that contains the bounds
_alphaMin the amount of exploration OUTSIDE the parents as in BLX-alpha notation (Eshelman and Schaffer) 0 == contractive application Must be positive
+
+ +

+Definition at line 270 of file eoRealOp.h.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
bool eoSegmentCrossover< EOT >::operator() ( EOT &  _eo1,
EOT &  _eo2
)  [inline, virtual]
+
+ + + + + +
+   + + +

+segment crossover - modifies both parents +

+

Parameters:
+ + + +
_eo1 The first parent
_eo2 The first parent
+
+ +

+Implements eoBF< EOT &, EOT &, bool >. +

+Definition at line 282 of file eoRealOp.h. +

+References eoRealBaseVectorBounds::isMaxBounded(), eoRealBaseVectorBounds::isMinBounded(), eoRealBaseVectorBounds::maximum(), eoRealBaseVectorBounds::minimum(), and eoRng::uniform().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_segment_crossover.png b/trunk/paradiseo-eo/doc/html/classeo_segment_crossover.png new file mode 100644 index 0000000000000000000000000000000000000000..1771d0221e76bf2817552b3a484f0c63a455c9a4 GIT binary patch literal 1752 zcmbW23pCVO9LGlwh17OzMGc)E`Xp0nrNdw<{iz31L@?)`o4y{Y@K zF4~%_H4zAe_TD{C`w@tF;VRvJq_KF&&|QYDqjCKf9&OQq&&Q&SVQ zMfpF;5+ZROfj@Arj>oMEBqre+N{L2V-CKET53;0ZCIueMIw(jYa zW_`<#j^1|9e*z^S@l?qTc=wE9QtH?ljm#dfx2_em+2pS8aZ1mi%L?jCB``{I9`}E` zVxp^SP+T^tZTQRV%R~X#P0nuyEtw^JJr65sE~>t<7qq;;&Yjw< zP2E*>n4Wf_tARLGbS9Ijvp#Q3C=VAqnZW8Kqp>uhoJRqAu3HyhsBJi%ly{l7%nX>^ z$l7{s#OXBgsCe3!K#@_@(Z|K<6UDSLk$jeS5=R;GiVYH1Dgv2&jO}q!tIpO3Vvs}< z=m3qPi6tJ723J2o_v0PJa@dwAT9FQz07p1)?c-$dXc1?pF;T)WtqTogfwr z%>&nsZc{kmCCJ)Gg)jx)zEIeV{8IGkf@{gh*xKMxY`{FBm)zI<8cGdLiH%FJ1sfL> zY&fTvs44V1i#D}%SqPUmAy*WX%maJ^GgM~BRKlSb9L(A@KBAl5ptaBZe+uhu{Q*m7 zXSB!NK4!{l4k+c?`CBqp*fkepEFXN~&BNB7|mR|(Cn;J)M!Cwvz zGS*vFRn@>9#~dNv3Og&eZj0;ieE$rD!cr3+XSs4;8N1p>tvfh~o>OUzAH<(mN}WR_L^b-N?3BU)TpHL9we-o<0v0)j#^r9WEMZ=jB1zp@?1~wou#6C_f;LgEX%P%P|kA26 z-ke}z_0y58k@h0|ko3-M%00#aXVJR$d`GAelJh=?`Ol0!-DZNHE=2<$6wJIYcFfH3 zajNVO9W;|&R^NEEH)o{~y^Cm;4$LhCvT$USb)`^hDykU{^5l>v=}#^#5~ygGqF-mQ zzM}cL_pX(U*;3x(f|AbH&Q?iH$n2UtrFZ0VOBeO63%(-#o16O&Gxw^9oJcF;ze zr4zo~m$?ZeE%5n0&QwSJwZ47@t*=l61Dup`hf?={o!AS!eZX?zXUed_1l zDcoAjeH={`#ETnn*c_!p01V5uS|b~6cf*uT;tU|1=~lsKqj9JELqA{rt!xN&S_BP- z+@o-ZZn{#_{7D|=d^W@+xrjSEVImHg>}LYEL0&cF+lL=x7gHybxfbtxZV1qI({Q*2 z1BcTa{VWX$kjSBKS3pp7qh^%XA40r!(enqJ78&#q?$O71x5}6@g2kg+$U-q&kuGB@ mOy(YtxdSPq0HXMikC@V!<1v@C2XLxy2(i~0>%`d^nD{$+41Xj5 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_sel_bin_gen_op-members.html b/trunk/paradiseo-eo/doc/html/classeo_sel_bin_gen_op-members.html new file mode 100644 index 000000000..1ba0229c5 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_sel_bin_gen_op-members.html @@ -0,0 +1,33 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSelBinGenOp< EOT > Member List

This is the complete list of members for eoSelBinGenOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
apply(eoPopulator< EOT > &_pop)eoSelBinGenOp< EOT > [inline, virtual]
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const (defined in eoSelBinGenOp< EOT >)eoSelBinGenOp< EOT > [inline, virtual]
eoGenOp()eoGenOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
eoSelBinGenOp(eoBinOp< EOT > &_op, eoSelectOne< EOT > &_sel) (defined in eoSelBinGenOp< EOT >)eoSelBinGenOp< EOT > [inline]
functor_category()eoUF< eoPopulator< EOT > &, void > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
max_production(void)eoSelBinGenOp< EOT > [inline, virtual]
op (defined in eoSelBinGenOp< EOT >)eoSelBinGenOp< EOT > [private]
operator()(eoPopulator< EOT > &_pop)eoGenOp< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
sel (defined in eoSelBinGenOp< EOT >)eoSelBinGenOp< EOT > [private]
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]
~eoUF()eoUF< eoPopulator< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_sel_bin_gen_op.html b/trunk/paradiseo-eo/doc/html/classeo_sel_bin_gen_op.html new file mode 100644 index 000000000..2f03a4ea6 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_sel_bin_gen_op.html @@ -0,0 +1,61 @@ + + +EO: eoSelBinGenOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSelBinGenOp< EOT > Class Template Reference

wrapper for eoBinOp with a selector +More... +

+#include <eoGenOp.h> +

+

Inheritance diagram for eoSelBinGenOp< EOT >: +

+ +eoGenOp< EOT > +eoOp< EOT > +eoUF< eoPopulator< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoSelBinGenOp (eoBinOp< EOT > &_op, eoSelectOne< EOT > &_sel)
+unsigned max_production (void)
 Max production is used to reserve space for all elements that are used by the operator, not setting it properly can result in a crash.
+void apply (eoPopulator< EOT > &_pop)
 the function that will do the work
+virtual std::string className () const

Private Attributes

+eoBinOp< EOT > & op
+eoSelectOne< EOT > & sel
+

Detailed Description

+

template<class EOT>
+ class eoSelBinGenOp< EOT >

+ +wrapper for eoBinOp with a selector +

+ +

+Definition at line 133 of file eoGenOp.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_sel_bin_gen_op.png b/trunk/paradiseo-eo/doc/html/classeo_sel_bin_gen_op.png new file mode 100644 index 0000000000000000000000000000000000000000..d3f0f94e407b6e7d47680f071c987a5b070b0a48 GIT binary patch literal 1979 zcmb7_e>~Is9>*7_R-~d+J8@iT9L^0LiZx>gF(kwMs%G+IyTp)+gGHxAsEye|GO8u% zp!#CM{5Uvm=2tjqT;xZVY<`qxZP?xEaoy9sk9+^Pe|$cl_xtsDzdw)9=kb2NKc94W zw4<7erV0oIQge2)$ACaeLkhe3D`mxOEyUmz%Qx;Pyd30mxx$pon~RD9vJ}?m(cIij zYLQPX+)WoTXit#M%&WhFKwuANdt0x#0#U)QIrlAhrM~HeH?V*}@&~1rzsu|@5_)(; zO%JkdltQ5|iZliCnW{e107;oi2mEA-r*YC+hzgFDH|f{)adzl8jiwk^QI`f??HX{! z-C`GSOOS1>!6a~I^r#fc&yJ{BlYZU)(>&)6@v7tw_K8-wqZr(?Vy0WaIzVPd!fPnP zmSF}w!Zh3=Rtq&expnRRIUoE^_0e?ReClQND))!i*AcfwH5a>+_zjTP!RMY1txWu0 z%s`R$v93#mv|{85F)$T3$GrSXOaoVo^y*z3A;6k{!q=t;uxe-gvW=4}RbdPr*QPpc zQ-AK>>X^9^WJ;*TusEzggofO@y|pHq-9UgLJ=)?^gn2(=G|zI9Wz@yv`B}!P09X>?H$O!=92JJd>-vJH1Vh2CjWb)kAb+AE<95T^pB5zV%=YBaZ@yG6{1LHFM@Kd*K`5NM5B3Bc@kY zhS>)_cXJ-`>F$0^z428^tJ5QtUH4vre>v(BeAjX1MAhwqx#Y1RbF-Y#VDs}X15V>% zn)@uOHPb&}7&srOhW`%jBi>{-4G|-jg7d&u4XvWcH|s;~ks&&gFrNZ!GI`T zNLnQTnJNFQu^rzgjE9s?rfA^$uM8QNxqHOwH&XnYRfd?5MH53U?#jovdyFJfWWwf! zt3dRn#1TYgRPrYG%{){K%xV9huqZY%)Y?i=zDHDucnLd_GS`a{1}{ZT2Y;3}p!&DC z4Kc`F+zTnsU7gCsF9A}^RnjuVOy#PO>Fcq02Z;U*qayDncRnN5?!KB`8%%{iPF=W1 z6s?#o1Rj}_3tlLw>@Pmv7!E`5E1#rFDJvhwaMu>E2&4?6nj+Jp+7+v~X7z7Ob zmGtiCsX9}8KS_M~rwMKT)b1I|L))fVjB0hMc|hJE4)eOAeFu54s+Qr(cUUpHJmk<@ zD@-iKEw9d zW|Ol0;^mAFsS37YPnKi3jS#3~N1=4-Q-6jn-~=TR$EnuHd&tsGUk~nHXJCrmVMM-I z$DJ?qenE+gouFn|2a|fNy||b@>bfvpM+~t7T5D(DcN8$Zq0I%> zG3Re##CZyg^z2c&`Vk{=#NejWZ1jNB52=x*8sF4&Pm)(b2*GlIlP+?40Sx7nW5B2mLA~PAU1Q(`y{})pmNB9FEk}CU}Hdl}YZ~Y<~aEl$&diwTd z%@`#UP?q6C)L!$xif6rN*UA0} zdg>W#KyX2hzi~DwV@)xI%`|{hap~9*7hRbx0?DITY4LMCST0xm?Zqc7pokD(O^@nG zVw-?h&=AUTT`cNp7%T$D)_`)dTwSlsk5j3p%<>Jh;z6E*6AH3sG3;F|HR}+ zf9y3VnxOGx6Euqh=bx4WclzNJiDP~xtUS0sdadU+U|_-UpEBPe*Nfc3zpphWs9l<0 zOP*YquF4uEy6Drb+mX)naya%Fn;NGBMX>dBLj=@@E(^jhwfhlq=(F~))X*F|)=iFa zANRWvI-|^iQ&KCupt5!Va4ROF#Ivt z>zfw$&}Unip61!_h(6HWx7?y+f?RJy**-&=I$f=8aF&1CHHOG2EFbXV{1+$g`_|0W ZouWnC(um)+XB0mz$k_pHUtt$;^&c3l;bi~- literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_select-members.html b/trunk/paradiseo-eo/doc/html/classeo_select-members.html new file mode 100644 index 000000000..1b2a25f05 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_select-members.html @@ -0,0 +1,18 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSelect< EOT > Member List

This is the complete list of members for eoSelect< EOT >, including all inherited members.

+ + + + +
functor_category()eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
operator()(const eoPop< EOT > &, eoPop< EOT > &)=0eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [pure virtual]
~eoBF()eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_select.html b/trunk/paradiseo-eo/doc/html/classeo_select.html new file mode 100644 index 000000000..d3df40cce --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_select.html @@ -0,0 +1,45 @@ + + +EO: eoSelect< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSelect< EOT > Class Template Reference

eoSelect selects a number of individuals from the first argument and puts it in the second. +More... +

+#include <eoSelect.h> +

+

Inheritance diagram for eoSelect< EOT >: +

+ +eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase +eoDetSelect< EOT > +eoSelectMany< EOT > +eoSelectNumber< EOT > +eoSelectPerc< EOT > +eoTruncatedSelectMany< EOT > +eoTruncSelect< EOT > + +List of all members. + +
+

Detailed Description

+

template<class EOT>
+ class eoSelect< EOT >

+ +eoSelect selects a number of individuals from the first argument and puts it in the second. +

+To emphasize that it should not try to enlarge the population, the second argument is an eoPopRange, a simple struct that holds a begin and end iterator to the population +

+ +

+Definition at line 40 of file eoSelect.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_select.png b/trunk/paradiseo-eo/doc/html/classeo_select.png new file mode 100644 index 0000000000000000000000000000000000000000..0596c627f507913e81a1f126fa2382ae1ded0100 GIT binary patch literal 3829 zcmds4c~DbXmw(9D(9*JKw++bV8XB=#5<%7=w#ec$sA%IBgb+X$!35b1B-l1$L$l}u zN!Vhy0-{I|Q6Uh5D1<ic7As-|kH-tv1@=iGbl z@BHq$=lymR$ij}3jrNjD{f^oX&+?O&GKl4SlVdDEduax2h(o5Rv>(S?qx6@y{E)@b> zC#Aeg5n^2$1@+CdJ$4h zns{Cw&c&lbMpiDx+~tRAxL#N?V-)dL5{G}tI#E{jnDS{VwVLd2&|}k>&5!X?sXx-2 zx=4&suu6+TwWE$ul1>)39WN}_8V$G<&d2$ZUKOGQwY3Y{7Lz!{a!O4snYx3|`aW1^ zsj8pd?@b72BiT9#m!HL3esT_4hDe{t8SwfcM+B5%CbY*B3%z5*wRs|RaHPiAcIYQu zDY!^8n%r>Pw*$0AIA@#=1Q~LT#?J4mauVNQtI#EpoVUCc?5H4g)1{(fUN` zea;ox9g?uyM4fhu{OzBZUcGi>*pi1M&Pt5*G3ygT=Huc!+MIedZ}r1jpQo@?% zm?(w&c35URpn{(es-}k!`%+;^{0>HH(KZz7(FP5X`gV_99DW6D9X#mY0w+j$7IzTl zSO9Q>?UG{?&xkdq5|lZW08kA3??(;0Y##3`D~+-Ox^BP**JmBkzy)>M24H3@q;kgy zj|6J2tvP0Mfxonn`ar)c?B&>o{|}>h<%w5b>;hnR$0_kT0HEbsz`OGF{|bDcD*xoJ zE|zTs!sIp&X7fHSe+}6D_b@m^pz-en3X|2FmRs;6uVF-Q(Wa&U)1jm5SsCleiMPFVr!Pr5|4M5@c>YX)p)YC_53 zUU~DaN~}iT5hnUs-oOiK5WM6E7f}hbr~7`SMWp2}JczupzCR^bkwW>O#+ zLhCH3v$kFI$3mSwCk*@`KLECO?)i27*;f@w7Z?G09pLc#FSaD1Xf9ZSbH;StbQmrT z2is$q`Bg-Z9mDR6XM&JIJa8r{8l5oMWtufW8y(Zq`1Wq!J&=rN%sRTl>b)PQZ2Ts$ z-Lbo;Q;+OViXLf+C#kzJ`SL|A4Hu*NSwG3uWecEie+iotXK8+TV00#sG_wu%n`MH- z0?}jEB24~?_))vMcYY+8joq^&Ti5+FVQ?5O4j$|*VAkiqXrh7Q=K6 zoL_0TUILe5y_!L80AN?I+B}UzN1_+p&p0#U82W+e2b9i!x(=|@P$$@A6pBRJvtwV$ zt}f9x0e*~NDwa1e;Pj8rUwc~;6u8?A(dR^%)l2T3Rs}-&*q`zp=!}kqKNAM<^CeR& zU(q(~PfBcGa>)hk5A!gDrosRMSu*?=-(2G~v0OLc4&=0iN}n+;zy62sv} z1yqi0Dkk64u@#$JW7LuvhE{PKkqL3=x?1Tk3Ovwf_r5VbT?t9+;}6TQ_m-hL={i7i z^k1*jaaTa8$OVjY4M0fQPTm)q>h+B7jkp7Hvx>_qKr+uu7f$xD zONluE>|CoM!Ueup9st}}%m0o4Ns&l45w3mkbl@AquW5rjEmqgKy2;ht4jGh8_mo*5fx$t3ED#cF|}N$TrOn2dc}-E{U$~`@~J>TkUmi)mDLPJ?Ng)@ z!{`A8ewSO0*9lZu$QTJa-Nel~-EeQM8hJu@*xz zUzY2)d(X0nyXgS~e!MbeRgzL$eB>>dS?0SjU`Ur%DAQ|om!vbJ)2$28n+r}lx3s3woNA-uu<=oyD?`J*AAIG~oqzrGiHH}sOko^h*15AK$QDORhm zL`~u6iC0ooH98hTZRHzJ?UQq=Uh8Cq+@LVOM=2yK8IOL;Z**42!$_Xc3hGFKa^OeFfsMQfm9EO~bpgnR`h4M%jR0?KfOYTGf2h@Efiu z{)#3xF(321kXyu67uph^GAyV?uKjT*d7^sty`{QZk`7eHZ!MXhGZv-f1mK!-ZoFjj z+|$;3=B;_Y-_?ux$IANR@rbO_X-}sLE6NG-`HIc$-EgbsT3l%j4&7P~(byKj>$DRL zUQbw|DvK%;YK<1KXlNg6wwGh46|~pzO~C`&v>E1gJkM>x)fLcB zhLL-fWW;iV=8iyFc!OQ_r^87%L^Fdabpk>Wm*pMtoD{FqiB}Fskv3A^X)~?|WJG(w zNg_J2RvPY+@+(sU3?oqj_cQlN3)jZ^zF-U3NZJ3##SV}8`{5J6wcZ=+r8N`=TB0YX zf`}Dli2L`KI8Ji7LL|nR-|a6B&^Kj}wmM@PZ%6A&w&98K!_uJYx}iB+h`}=PPc>Sq zDLRG7B7jdMDQt8P_0Hd!(?=c=;Q4#*m>UlwAPzy_H0!x87$_8x)N?e>w{kh>P~I63 zhXrCFONPtj?o0^oafUyN@B2hJ;Uu`WM`jawk&{sR$P?Rr^mD=UNcy?KxPYG>mjt3B zF!BOAVIY0XE6wGY@wr z!9!+hsp_ZuB*8sz&<)`|`dKvAnEp_nq&wgz@4)#@F(1ow=eEHmVWcHHa;In6+1gm9 z9VXLYJZa3hV%adF*eeM@O5}mB!~=_@U|)Y{juZGs+XY%);SQ0M<=+aF{Z2J)=v+bg8Pi z$<5ew5gd=ktW`meB2YsAoj++FAA>M)1QF2LT>@(VWMOsdefw;$XkE?sY}YqG1m&SK zLO0O{w<7C~wOb@@;qOG&x#Ed;bFfQ$OFi+#Yi*)KX7wLKL8win29JL{R?Md&R>>{O y + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSelectFactory< EOT > Member List

This is the complete list of members for eoSelectFactory< EOT >, including all inherited members.

+ + + + + + + + + +
className() const eoFactory< eoSelect< EOT > > [inline, virtual]
eoFactory()eoFactory< eoSelect< EOT > > [inline]
eoSelectFactory()eoSelectFactory< EOT > [inline]
make(std::istream &_is)eoSelectFactory< EOT > [inline, virtual]
printOn(std::ostream &_os) const (defined in eoSelectFactory< EOT >)eoSelectFactory< EOT > [inline]
readFrom(std::istream &_is) (defined in eoSelectFactory< EOT >)eoSelectFactory< EOT > [inline]
~eoFactory()eoFactory< eoSelect< EOT > > [inline, virtual]
~eoObject()eoObject [inline, virtual]
~eoSelectFactory()eoSelectFactory< EOT > [inline, virtual]

Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_select_factory.html b/trunk/paradiseo-eo/doc/html/classeo_select_factory.html new file mode 100644 index 000000000..74e17cb62 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_select_factory.html @@ -0,0 +1,99 @@ + + +EO: eoSelectFactory< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSelectFactory< EOT > Class Template Reference

EO Factory.An instance of the factory class to create selectors, that is, eoSelect objects. +More... +

+#include <eoSelectFactory.h> +

+

Inheritance diagram for eoSelectFactory< EOT >: +

+ +eoFactory< eoSelect< EOT > > +eoObject + +List of all members. + + + + + + + + + + + + + + + + + +

Public Member Functions

virtual eoSelect< EOT > * make (std::istream &_is)
 Another factory methods: creates an object from an std::istream, reading from it whatever is needed to create the object.
ctors and dtors
+ eoSelectFactory ()
 constructor
+virtual ~eoSelectFactory ()
 destructor
eoObject methods
+void printOn (std::ostream &_os) const
+void readFrom (std::istream &_is)
+

Detailed Description

+

template<class EOT>
+ class eoSelectFactory< EOT >

+ +EO Factory.An instance of the factory class to create selectors, that is, eoSelect objects. +

+

See also:
eoSelect
+ +

+ +

+Definition at line 39 of file eoSelectFactory.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
virtual eoSelect<EOT>* eoSelectFactory< EOT >::make ( std::istream &  _is  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Another factory methods: creates an object from an std::istream, reading from it whatever is needed to create the object. +

+Usually, the format for the std::istream will be\ objectType parameter1 parameter2 ... parametern\ +

+Implements eoFactory< eoSelect< EOT > >. +

+Definition at line 56 of file eoSelectFactory.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_select_factory.png b/trunk/paradiseo-eo/doc/html/classeo_select_factory.png new file mode 100644 index 0000000000000000000000000000000000000000..6530891592c4dad242b578013e50c65813c827ec GIT binary patch literal 730 zcmV<00ww*4P)C zAPmRhWuFN*fW5))h5FR{A7Oz6v?s+^ZB?q z;QCd>00uCC0SsUO0~l~y!1O;L*Z+^kfCB&nu&amygi}2Ze82k|paJUuyVfksQ0y9@ z)4f{iLBOJmCPmaMTw3eoP!6e;Q*EP&w+hH4xYP_m!qLLg@7tNM>0OL&0k}-i002X2 zn?yj0xd1HKQaMH44wBBPZAn1DqKn!%lENDrOGErbLo+I;qzg7nln9hT(nU>~fiX5_ z5Qjwh)aDt~fI5SXJwQOd2c{I4i#^DysNRFJM08L@LltF3LDFfc_f|QL&%suiZrc$B zbJcbLhZM|r03RoCvtLsNYyhUewoHHVIvap>)Bgutzls>Z00uCC0SsUO18xg|$tKi< zEHje~I4MAa!kc7D0;uHC40iXt2P}j301CrofZU@A5j~n)EkJ^MFjVMsO-a`hf@_#) zxO4%Pik_0bst2I_WZg$mldcs8k*QNaIJ#2 + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSelectFromWorth< EOT, WorthType > Member List

This is the complete list of members for eoSelectFromWorth< EOT, WorthType >, including all inherited members.

+ + + + + + + + + +
check_sync(unsigned index, const EOT &_eo) (defined in eoSelectFromWorth< EOT, WorthType >)eoSelectFromWorth< EOT, WorthType > [inline, protected]
eoSelectFromWorth(eoPerf2Worth< EOT, WorthType > &_perf2Worth) (defined in eoSelectFromWorth< EOT, WorthType >)eoSelectFromWorth< EOT, WorthType > [inline]
fitness (defined in eoSelectFromWorth< EOT, WorthType >)eoSelectFromWorth< EOT, WorthType > [protected]
functor_category()eoUF< const eoPop< EOT > &, const EOT & > [inline, static]
operator()(const eoPop< EOT > &)=0eoUF< const eoPop< EOT > &, const EOT & > [pure virtual]
perf2Worth (defined in eoSelectFromWorth< EOT, WorthType >)eoSelectFromWorth< EOT, WorthType > [protected]
setup(const eoPop< EOT > &pop)eoSelectFromWorth< EOT, WorthType > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, const EOT & > [inline, virtual]

Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_select_from_worth.html b/trunk/paradiseo-eo/doc/html/classeo_select_from_worth.html new file mode 100644 index 000000000..25336a23f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_select_from_worth.html @@ -0,0 +1,62 @@ + + +EO: eoSelectFromWorth< EOT, WorthType > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSelectFromWorth< EOT, WorthType > Class Template Reference

selects one element from a population (is an eoSelectOne) but the selection is based on a std::vector of Worth that is different from the fitnesses (e.g. +More... +

+#include <eoSelectFromWorth.h> +

+

Inheritance diagram for eoSelectFromWorth< EOT, WorthType >: +

+ +eoSelectOne< EOT > +eoUF< const eoPop< EOT > &, const EOT & > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + +

Public Member Functions

+ eoSelectFromWorth (eoPerf2Worth< EOT, WorthType > &_perf2Worth)
+virtual void setup (const eoPop< EOT > &pop)
 virtual function to setup some population stats (for instance eoProportional can benefit greatly from this)

Protected Member Functions

+void check_sync (unsigned index, const EOT &_eo)

Protected Attributes

+eoPerf2Worth< EOT, WorthType > & perf2Worth
+std::vector< typename EOT::Fitness > fitness
+

Detailed Description

+

template<class EOT, class WorthType = double>
+ class eoSelectFromWorth< EOT, WorthType >

+ +selects one element from a population (is an eoSelectOne) but the selection is based on a std::vector of Worth that is different from the fitnesses (e.g. +

+EO fitness is what Koza terms "raw fitness", Worth is what the selection is based upon).

+see class eoPerf2Worth: an eoStat that transforms fitnesses into Worthes

+Note: Worthes will not always be doubles - see some multi-objective techniques where it is a std::pair of doubles ...

+It has to have a < operator it you want to call an existing selector (see selector.h) - but of course you can write the whole thing ... +

+ +

+Definition at line 51 of file eoSelectFromWorth.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_select_from_worth.png b/trunk/paradiseo-eo/doc/html/classeo_select_from_worth.png new file mode 100644 index 0000000000000000000000000000000000000000..700e35419c4d1e2cf6ce4144254c546e0d1fd4a1 GIT binary patch literal 2016 zcma)-c~p~E8peZAsSFGbts{bfQ)DxMMOliH0c4Z1w4)FZ$QKp`Ap{(2kbJ2T&|zA3 zWK#$RWhaCWCll5L5<#edf+9qAXk`6B$RRJ7Mul+_wj>%ic02H4jeMt+k}`iXOA@tSD9ttLyb928d_t%qhTe-mLsh zU#F|%Aj-DA=N@mo1*8k%OIg@&x+&OH2`AdAh}R4zPk;{4Q`=3Zzq;owv6)#UDoaQc z%c|kTqKn_D`*KkQn+ z9*f%2o_3E5drjOtH%`(KVo%00v_?p=sVK*C31kuK*W%6=sI+PsOR`sr4io z@s= z(E%g+qef)6!AMY^a@PyOIH)5njbB;OSnh0DFWgsQvt$hzB zm21b8yWrC8QN35Z$bxt1R9)5YWen4LphxfEF`DyZOES-(jeApX-d3)WaC{);XjuSV z`An1v=rVXOla4iO?_qzGNP=Po&go4Z2Fs!WSXyb91Xz4q>1X$=+mEK7z(aai`zJ&9 z-y$~Hs;c4?u9u@>!~pW9-Zr&X{*)-K2FkhluO@wf>30Y7rjV}ORc@I4P5SxfWUQ!W zma*Kfli6HuS6-JTF~rUi%=AK~tw{l6DVnQ71HfkX*cI%Szj5hTLsn?$f`Jiu&EaoI zw^XLTpx|*&bb7O;=d5HRXbl4xnXv2B(LIr)zCVC|%LVaXvy2LpJVOulJilzF7+tJ9 z`H9p3FhWxEYFg6`W7B!}#ee2Yh>$PwVViN|{64M~-An`=*V_K^{}}&W_7%CZ zE-|b2FV@}V$7k91`wj6;mO}|u?i5J(@8k&&!O0&gIb4wfg2|9b}WBhUpB?@4Y2JLdC ziGa2VyK8$iGS|=u!>b-SZ=P}BdDIGln{@JSEwFMJX;>(g49jdADD86A=+pzjlWq8s%2subvJbSpQDgzfO-?M{91q} qyKQ4x44V80^LcuhcBKW$j + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSelectMany< EOT > Member List

This is the complete list of members for eoSelectMany< EOT >, including all inherited members.

+ + + + + + + + +
eoSelectMany(eoSelectOne< EOT > &_select, double _rate, bool _interpret_as_rate=true)eoSelectMany< EOT > [inline]
eoSelectMany(eoSelectOne< EOT > &_select, eoHowMany _howMany) (defined in eoSelectMany< EOT >)eoSelectMany< EOT > [inline]
functor_category()eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
howMany (defined in eoSelectMany< EOT >)eoSelectMany< EOT > [private]
operator()(const eoPop< EOT > &_source, eoPop< EOT > &_dest)eoSelectMany< EOT > [inline, virtual]
select (defined in eoSelectMany< EOT >)eoSelectMany< EOT > [private]
~eoBF()eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_select_many.html b/trunk/paradiseo-eo/doc/html/classeo_select_many.html new file mode 100644 index 000000000..28b3acc0b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_select_many.html @@ -0,0 +1,115 @@ + + +EO: eoSelectMany< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSelectMany< EOT > Class Template Reference

eoSelectMany selects many individuals using eoSelectOne as it's mechanism. +More... +

+#include <eoSelectMany.h> +

+

Inheritance diagram for eoSelectMany< EOT >: +

+ +eoSelect< EOT > +eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + +

Public Member Functions

+ eoSelectMany (eoSelectOne< EOT > &_select, double _rate, bool _interpret_as_rate=true)
 init
+ eoSelectMany (eoSelectOne< EOT > &_select, eoHowMany _howMany)
virtual void operator() (const eoPop< EOT > &_source, eoPop< EOT > &_dest)
 The implementation repeatidly selects an individual.

Private Attributes

+eoSelectOne< EOT > & select
+eoHowMany howMany
+

Detailed Description

+

template<class EOT>
+ class eoSelectMany< EOT >

+ +eoSelectMany selects many individuals using eoSelectOne as it's mechanism. +

+Therefore eoSelectMany needs an eoSelectOne in its ctor

+It will use an eoHowMnay to determine the number of guys to select, and push them to the back of the destination population. +

+ +

+Definition at line 45 of file eoSelectMany.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
virtual void eoSelectMany< EOT >::operator() ( const eoPop< EOT > &  _source,
eoPop< EOT > &  _dest
)  [inline, virtual]
+
+ + + + + +
+   + + +

+The implementation repeatidly selects an individual. +

+

Parameters:
+ + + +
_source the source population
_dest the resulting population (size of this population is the number of times eoSelectOne is called. It empties the destination and adds the selection into it)
+
+ +

+Implements eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >. +

+Definition at line 63 of file eoSelectMany.h. +

+References eoSelectOne< EOT, WorthT >::setup().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_select_many.png b/trunk/paradiseo-eo/doc/html/classeo_select_many.png new file mode 100644 index 0000000000000000000000000000000000000000..e727ac75bd3361395dacba465d783b0041bca621 GIT binary patch literal 1909 zcmaJ?dsvcJ7>8PqCV3;4r6SIW`Dw}1nnpKW&Q!n)eOMNOwA5LVnwPwlqs%6nnwL*a zOhpB|cp+QnEX7Njm!?h}v%<@x&C4pVOicu2tgUDLQTyY(=Xaj-zUMvX_g+pi*~?8= z$5;mjgXt37T|gLYrL_h(f3{L1(OBv&&9t8E;j>q*R%@VI-CSIJBtwJVjppX&Gp*`B zG)s6S=tY5jGx_*?7)%R6aM|M%b5&Z{6JCKgaP6^Ta&(z735U1hp#2M#$|a*(scbq>kp z6Ea!f@!8CbA5!?)zjQ?KV+3Bp+kTBNdMfMg>I>-Xu|ns>y0P8j?s#0V{k(T}sntU} zcf)A>VqQzmj|0_nSCYZDd0z(2%`>GaQ6vvc&%ZypF>}P|h4_ctPpRv1i*g)7a7Z_t z_4wu>GPWF*`P=2Zqs$cB_)=&j!OX)FJlmOo%K3iaVYq#c1yXPGL5ujfzQb=eHB3?E zf|JH1QvS1|RLCR6i!oj{*!;yK9#?v46uT_<4wc|uAs{ah7 zw{~`-mK3(__;RYsbBVIQw-!8+2Oi;`#Wu84fm)J$V+raT>s1Cscp?bP5AjtyTsJta zYMWlw&^Z3BU%Nug;2J9KRD$B z7^}F>ep^u{_ueOtsa*BW#|OI~g~CT-7R86{tV z%SP%9vs@eV{mUEeXzVfczp1t{Q5?|Nw4dmX+rXQ)JbIDSi+`kNY=@^8yn4C@WmSr~ z`}|HoC{cw4l^oHbfO}taZ$Q|-8vWeEXwjJwPSDuyL7M>da1D4LmF8^p;X zrQ9pD4;-r0>vHV2MUUHr-OL$$Q!$8=982cKmOab$xF!(Gn6#O)*0micFcU#-164o1 zuA32hy}o#7RFagQUA4f4&_aWeLYpb7bPq7)@5>XLy{mK$d+&&Jr-RkY!Q?NVXU(oy z^xyS&=qD3kiQuc43ZOq^Gg-%iHVyx1U_KGzPv}B3;qwdysK|l`>K>C2QEXbJ4Vj^0Q(I<=DUS zgS)=Ls(H~c;>-ir{$@RTggH;FG;{eE`}B@^n! z9t!33RVZOZxYC@s{XvA54&NLkY)d7^Q9de}tPMV?Mg%#cci_IOaJ`(M`6FS3y + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSelectNumber< EOT > Member List

This is the complete list of members for eoSelectNumber< EOT >, including all inherited members.

+ + + + + + + +
eoSelectNumber(eoSelectOne< EOT > &_select, unsigned _nb_to_select=1)eoSelectNumber< EOT > [inline]
functor_category()eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
nb_to_select (defined in eoSelectNumber< EOT >)eoSelectNumber< EOT > [private]
operator()(const eoPop< EOT > &_source, eoPop< EOT > &_dest)eoSelectNumber< EOT > [inline, virtual]
select (defined in eoSelectNumber< EOT >)eoSelectNumber< EOT > [private]
~eoBF()eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_select_number.html b/trunk/paradiseo-eo/doc/html/classeo_select_number.html new file mode 100644 index 000000000..818b17768 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_select_number.html @@ -0,0 +1,112 @@ + + +EO: eoSelectNumber< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSelectNumber< EOT > Class Template Reference

eoSelectNumber selects many individuals using eoSelectOne as it's mechanism. +More... +

+#include <eoSelectNumber.h> +

+

Inheritance diagram for eoSelectNumber< EOT >: +

+ +eoSelect< EOT > +eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + +

Public Member Functions

+ eoSelectNumber (eoSelectOne< EOT > &_select, unsigned _nb_to_select=1)
 init
virtual void operator() (const eoPop< EOT > &_source, eoPop< EOT > &_dest)
 The implementation repeatidly selects an individual.

Private Attributes

+eoSelectOne< EOT > & select
+unsigned nb_to_select
+

Detailed Description

+

template<class EOT>
+ class eoSelectNumber< EOT >

+ +eoSelectNumber selects many individuals using eoSelectOne as it's mechanism. +

+Therefore eoSelectNumber needs an eoSelectOne in its ctor

+It will select a fixed number of individuals and pushes them to the back of the destination population. +

+ +

+Definition at line 42 of file eoSelectNumber.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
virtual void eoSelectNumber< EOT >::operator() ( const eoPop< EOT > &  _source,
eoPop< EOT > &  _dest
)  [inline, virtual]
+
+ + + + + +
+   + + +

+The implementation repeatidly selects an individual. +

+

Parameters:
+ + + +
_source the source population
_dest the resulting population (size of this population is the number of times eoSelectOne is called. It empties the destination and adds the selection into it)
+
+ +

+Implements eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >. +

+Definition at line 55 of file eoSelectNumber.h. +

+References eoSelectOne< EOT, WorthT >::setup().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_select_number.png b/trunk/paradiseo-eo/doc/html/classeo_select_number.png new file mode 100644 index 0000000000000000000000000000000000000000..7048b0b158e8226bb163ef378207fac952322823 GIT binary patch literal 1917 zcmb7FeOS`h9!JY`Zl;OMv`n2@{7PljRR)MJ1SX)M_(G%1@}=F%X$lUfqAknRR7ihj z8I0_KsC=!ahEw6{&}C}NG|H~Ee1GTajZ{(@xo6MXb9bLT`{SJRIp61;@ArJq=kq-$ zJAks!#Ms&x0)dzieepC1WDQ)0lpu)L$kU?`h#{1S_YO|tPYeE4a0P8fIM-Qz%&q*@hcwl4K@cW z?kv``*kXoow#A)D@?;->PQ73IRxn7$-SNLLaLLzG_8J+#>1GXriiW~Gq%-cs_T)Np zMgN*?>AtDU}Z1BpW?n)QcNMHd55sPZj9oixW_3w+Bq(^u4-!G zfPZcn_(?3&2$69j@B6Unlx@Tf%5d!f`W9`85+ev7;Y%Zrn2qnf>)A(5u8s3EY+j&? z=oLOvQy+B`;ah;Pbsj1j;}0-|aIsRf4|*Bo-GM8}kB>y6O2`|suar1l@Q{tTHu$Qf zH~w=WB=Spu`Qk1{%o{j|h;LCQ+XsA80fPL!Kyr->E!JF=^#fCVYRVKJWYila%t`nv z0q7zvW1<@n3fX$~_N6?FMzRJ&b7QwVkGu{Q(W@3eY4mXSpBlYJ0;tlUITRtTq!gT6 zLPb+^et0sxaGWyE9sw;b9X%Ig z()@&;dq_UIGwsK+1&-SA##%9CPW^U*8o+&6Rp#mK2shw9L^#;Qr&>vy;RYKhuiuFY z)HnJ~SMNb#c;*5p(M=2Z^>ah7zKdb@d$>P^!;*u`7(&rPV&ayvi1Ffu4zE?MuKG-X zD|(&5QV5)yw( zl8^U^==-jIW`^C^yLhqDUhOYBgAzaPV112a0%XA;&k2bcQZ{5-j$uL>^&hjk~e!Z7_JZko@d+L>Q?(ePdHQCOQ}8Jh^$&HC&`TC&^wu z7z_-XsK68^scw%X_sTQ-1N#ibdrKTC1OsdwRx*YoZ>`!SxEPhTz^G_yRik%!#Fsw_ zJc4((am`gVY0wH}ds>_=n&LC<4Pa6o8Zi?7`MwNV*JvfFXUltRfcja^06iUf!@O41 z07Spgws3UT+L0c!l12 z9Cy@}8RF|Ao-y+Q3`Gg$1!STcr6`t#&49N;;lmJTw0nN3H7n`zmE!K!$ya69VIIfpHN!(-4(h{tN;pyXVJGYH|Z?cA7Ft7rM zOenQ2%9c>Lqhwa~sD4S)SuJyL%=%|{!YOw9uAb=YO)1ce>@CW>Yil)yb z7Qu{PZ@c$9kHKqf(m{@5BZu;8;)L!0r1^icUp0d#WLCj>mc+$1@|z8or5ehIy1x=a MBv9~`xWlJ^0XSM+yZ`_I literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_select_one-members.html b/trunk/paradiseo-eo/doc/html/classeo_select_one-members.html new file mode 100644 index 000000000..9c85aa078 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_select_one-members.html @@ -0,0 +1,19 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSelectOne< EOT, WorthT > Member List

This is the complete list of members for eoSelectOne< EOT, WorthT >, including all inherited members.

+ + + + + +
functor_category()eoUF< const eoPop< EOT > &, const EOT & > [inline, static]
operator()(const eoPop< EOT > &)=0eoUF< const eoPop< EOT > &, const EOT & > [pure virtual]
setup(const eoPop< EOT > &_pop)eoSelectOne< EOT, WorthT > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, const EOT & > [inline, virtual]

Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_select_one.html b/trunk/paradiseo-eo/doc/html/classeo_select_one.html new file mode 100644 index 000000000..0fb1c7c9a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_select_one.html @@ -0,0 +1,46 @@ + + +EO: eoSelectOne< EOT, WorthT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSelectOne< EOT, WorthT > Class Template Reference

eoSelectOne selects only one element from a whole population. +More... +

+#include <eoSelectOne.h> +

+

Inheritance diagram for eoSelectOne< EOT, WorthT >: +

+ +eoUF< const eoPop< EOT > &, const EOT & > +eoFunctorBase + +List of all members. + + + + + +

Public Member Functions

+virtual void setup (const eoPop< EOT > &_pop)
 virtual function to setup some population stats (for instance eoProportional can benefit greatly from this)
+

Detailed Description

+

template<class EOT, class WorthT = typename EOT::Fitness>
+ class eoSelectOne< EOT, WorthT >

+ +eoSelectOne selects only one element from a whole population. +

+Most selection techniques are simply repeated applications of eoSelectOne.

+

See also:
eoSelectMany, eoSelectRandom, eoDetTournament, eoStochTournament, eoProportional
+ +

+ +

+Definition at line 45 of file eoSelectOne.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_select_one.png b/trunk/paradiseo-eo/doc/html/classeo_select_one.png new file mode 100644 index 0000000000000000000000000000000000000000..b10356c8d355f9cde598c31b4de47b9dc02a7d77 GIT binary patch literal 1632 zcmah~X;4#F7<~}KrUD8mqik9kkVO<4gv1KAh@nWtNWj7Hj36k4O&}0>EO9~5f=~mZ zL8QtmC{JypEQvu-fyiRfB-9NBl9VkhX#xQxjdpCEPM06|-gD2K`R1GNoVoXmFK*Xz zoi#cD04(>ydf)*-y-tO*mmpO8^QMHYs>9fKx8F{sQmKMUWpimMDPM&?uIA=us6{!X zx~e7Mar*#wQC}DUAmv^jJN&4Z$4hpcFGDYLZ>$j0pwLUc7cG_mQOzqgR0*RTyQZ>v)bM5M?nx-eLyDBX@a`b+iH=NsH zMY#(K2nI}CRK|SK#>tat?dPe(5-})t$<1d!RvZEBE-k&~5(d{7juMAZ@3cujbZX$& zBlR!zE|JPjJS@9c61t%(lWbQzFYO6ykY4>dMd%;T*+?oKa1N(-IkxR!sYiRJoZWBZ zkX7m#J!n*E=ZKUuMtW&h#R5X2Mdc=!@`xBmK^>R_xSQ6Y6*`p z)i}+N0wlAe6XXD@z5kUIA-48qzF@3OH>j@%afVUJ6d1|}Q0*>fh63C+^Zc#xm-Kwi z+P`W~B}Ir4jv4ko*F7&KU^!JLBS+aCpEIs9(y3QQT(3I9Lz3q{#gO9`K{ zHBtS^s?XYZ3sPcXbbWy7t6JT^(|REpb&;9}GQgNWyH?4mBBLTp+WSyu4fC4w(iowv zVSQbsufx%mNrJP@EvZ^Wwah$Og6!m;>AAzgoW4limuU$5a6IL1;9c?*x&WsUu^7qJ zm4YE4Iz&j&nG#$?+_vLvX+JlBI{V^gKy>D4+_L0Q-NdzS{k1n1){Bj^DmKH7%s^<@ zAAvKV4XK5rCh?9R5|?=AfmJdxP#uR0+RX=xg!NbrkpK-gDDHs$y%`-ag%wANdBm7u zJSw0Hu?JY^SgZQOTsK*Z7~Ax(hZCXPR*^)ppG&n#FO3rh}6R6$EW6OIJy`G<<*cNV!OT~dPA~*AWFex=uPqz4;Q%i7PVwLp`qvVrS4AV z#xE7L&V$7YpyEOe!8teT@S=^v=!%b4CzSRbg8XnCcPMWV?1!gyW@=hF!vynBfl!V1 zmPjUnVZHc!)f_1o`wkTo+vGAbtD9BPR#IsS@thZ{u8Z~Dcu9|7A0yX zzO}Gj#Asnq3QNKtTMZM^yDaYzrpZp`)B&E + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSelectPerc< EOT > Member List

This is the complete list of members for eoSelectPerc< EOT >, including all inherited members.

+ + + + + + + +
eoSelectPerc(eoSelectOne< EOT > &_select, float _rate=1.0)eoSelectPerc< EOT > [inline]
functor_category()eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
operator()(const eoPop< EOT > &_source, eoPop< EOT > &_dest)eoSelectPerc< EOT > [inline, virtual]
rate (defined in eoSelectPerc< EOT >)eoSelectPerc< EOT > [private]
select (defined in eoSelectPerc< EOT >)eoSelectPerc< EOT > [private]
~eoBF()eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_select_perc.html b/trunk/paradiseo-eo/doc/html/classeo_select_perc.html new file mode 100644 index 000000000..00db100d3 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_select_perc.html @@ -0,0 +1,112 @@ + + +EO: eoSelectPerc< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSelectPerc< EOT > Class Template Reference

eoSelectPerc selects many individuals using eoSelectOne as it's mechanism. +More... +

+#include <eoSelectPerc.h> +

+

Inheritance diagram for eoSelectPerc< EOT >: +

+ +eoSelect< EOT > +eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + +

Public Member Functions

+ eoSelectPerc (eoSelectOne< EOT > &_select, float _rate=1.0)
 init
virtual void operator() (const eoPop< EOT > &_source, eoPop< EOT > &_dest)
 The implementation selects a percentage.

Private Attributes

+eoSelectOne< EOT > & select
+float rate
+

Detailed Description

+

template<class EOT>
+ class eoSelectPerc< EOT >

+ +eoSelectPerc selects many individuals using eoSelectOne as it's mechanism. +

+Therefore eoSelectPerc needs an eoSelectOne in its ctor

+It will select floor(rate*pop.size()) individuals and pushes them to the back of the destination population. +

+ +

+Definition at line 42 of file eoSelectPerc.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
virtual void eoSelectPerc< EOT >::operator() ( const eoPop< EOT > &  _source,
eoPop< EOT > &  _dest
)  [inline, virtual]
+
+ + + + + +
+   + + +

+The implementation selects a percentage. +

+

Parameters:
+ + + +
_source the source population
_dest the resulting population (size of this population is the number of times eoSelectOne is called. It empties the destination and adds the selection into it)
+
+ +

+Implements eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >. +

+Definition at line 55 of file eoSelectPerc.h. +

+References eoSelectOne< EOT, WorthT >::setup().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_select_perc.png b/trunk/paradiseo-eo/doc/html/classeo_select_perc.png new file mode 100644 index 0000000000000000000000000000000000000000..157184b3a1c71aebf1e72580a05b029cf9dbe332 GIT binary patch literal 1899 zcmbVNeK?!v8jq<%Ih2Xjp(u*HShUqO)ftWYh@?nglyQh^O?@0ieYU|`9}y$NUencx zkA%7ino{wxL}|1&y|jW%M=~l$QB*039LdSnYnxrycK$ejJkRrc?(4qq>w13A@4jy` z-rGY{-9Q}%gK2tVTtOI28KJ;^dz2Nskws9O;?T#R@pF^Qg(&f z)-Rt^T$PeQZ(rD{fB*0q45q5&>5BGC`*ykVNlM)bZTDrb3FPtSnZ4V?z4%sUq=(eJsgOk`0w9|r}$ox2>-@G+6UaZFXBAggC3gRqf7q@4SbGQKM1|| z=quXa%|bSrIQob5)712igO}<1qdtvEr4nKbv@#C(Z3e8$KHKa}QELsw%v6Twbk2M-Hk5%B zMlVt=xfS|72)C&PZLMsZBDdkv|}Fv#s2BWq7LNFnOcq2g0%yV_Acj zdswbFjt(^xLPW1; zXnP2(;?$4PFt#BrtrHNNSx?K0N`AC?)|a@15Mi3C=euIC_oN0E4>FN^ds^G-G5qhs zwnV9?5{h1Xkm;#pX=P8ITPorF_L~~A^tSY>i5~R?$itieYmL%=YsE*HQ8_5k-KkUM z+KtLP+?P8K#OMt%a0#d=N#Tyy_Gy1g$D6?N(XeWwMemcK^k$sIss?@vp`wjd$^l{D zAS1I-w{`BZ!#Cb@3SGm6a#!ymiiB&s$4bVUuk!Y}x|AP0($Q{U! zuTfQm?#i+YO2o$=tlq7Y_?(Y+47&bTUb_Nnpw+}pA^f9R{$xUI0o{4lUYQPa`Bkqi z@bXUlqNL!iV|PX2pwrr#_H*RIR9;JS5^bDCZQSyrB}uz9NaG8~6WPnwDv2nlOsicz zc`>m3sMt0=7YckSv)`_8hd4B|G|>Df%s z#bR1XZR(O)#MsoU3de`FO174@roU;$`dl;4b8R0lzyTc8=N%onBUpD!%UEx3Gl}uX zrVo_7x#YEA9W%uG)QFkkhd)X4pT#Tmz~IBDFOlcc>v&%e`w*I@`7D74*NQUkWIdcu z3f6qlv&z<5%WW6_NTOsjqVd>VyPQr?6xd_{B|4^f1&vq#{=EvGV?7L6{+FgU;TWuACGd3Q!fbb+N2 zWilSD^$%Dn^;o(1u}lYgbMt0I8^pYLFt)rGfd;O@qgFSP&pb9_8pr9np{|1|kHF+@ zo^51{`eS-~Wj`W<1X27G0l>LIywUkRCMr4?OnFKhc%jcklLr3TOFJIwL->$^AJW2& z&J-5~%k8uVN}t~}7sa$w+2Ll==eJ6i*{u3kyv!{T)t5OPFf2Ym^<_!7ZHTphrsd+h z9K$iSU@#QMDO6Rk(GO=So@9LHx`rD4V1KUhyW-ic;y-ZyYjyok2MIDf`^TR(Un0<7 z$P1^T+`DV^7m7;a5bjqm&9GMBMUEry + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSelectTransform< EOT > Member List

This is the complete list of members for eoSelectTransform< EOT >, including all inherited members.

+ + + + + + + +
eoSelectTransform(eoSelect< EOT > &_select, eoTransform< EOT > &_transform) (defined in eoSelectTransform< EOT >)eoSelectTransform< EOT > [inline]
functor_category()eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
operator()(const eoPop< EOT > &_parents, eoPop< EOT > &_offspring)eoSelectTransform< EOT > [inline, virtual]
select (defined in eoSelectTransform< EOT >)eoSelectTransform< EOT > [private]
transform (defined in eoSelectTransform< EOT >)eoSelectTransform< EOT > [private]
~eoBF()eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_select_transform.html b/trunk/paradiseo-eo/doc/html/classeo_select_transform.html new file mode 100644 index 000000000..e1061a8d9 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_select_transform.html @@ -0,0 +1,55 @@ + + +EO: eoSelectTransform< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSelectTransform< EOT > Class Template Reference

Embedded select, followed by an embedded transform. +More... +

+#include <eoBreed.h> +

+

Inheritance diagram for eoSelectTransform< EOT >: +

+ +eoBreed< EOT > +eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + +

Public Member Functions

+ eoSelectTransform (eoSelect< EOT > &_select, eoTransform< EOT > &_transform)
+void operator() (const eoPop< EOT > &_parents, eoPop< EOT > &_offspring)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+eoSelect< EOT > & select
+eoTransform< EOT > & transform
+

Detailed Description

+

template<class EOT>
+ class eoSelectTransform< EOT >

+ +Embedded select, followed by an embedded transform. +

+Special breeder that is just an application of an embedded select, followed by an embedded transform +

+ +

+Definition at line 57 of file eoBreed.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_select_transform.png b/trunk/paradiseo-eo/doc/html/classeo_select_transform.png new file mode 100644 index 0000000000000000000000000000000000000000..ac6101030b2206ecdecddddeb391a8e3092fd9ec GIT binary patch literal 1924 zcmbVNdo-Kb7Efm=O~xofr?fGs@}W_ENQ2PQlEjTf1Vck~dOfS{6s>5d+$je2YK$&)$KDogh- zu9y%2GmT*_gyO;|&QQGB>`4GhdM>T3RdsrP#!--|b4HcBTbnA`ecf79m$)g73adaK zMzi*1COnBQA##}xWETHn+0zxjJ1>)GR`m_|v(ZyglhEPtg8&TAv!%=3bOyK@+V_CL05cGu?&|M1# z8=Z~3;q2x%F}a2%nd$S%H3_U=nf0J#1fZ=1zEei5v|iBWhT?@~pQp77aU=bm_RnKx z?F*+#IU%6A1r?hEdww9VRl&e#mY_LNEFmJ36Em+Hnf|Cx8vxBkD zZOBMSiQn#4GHsf%icor9&0{GIfN!qFo37IJI z@VVUie0}eC`ZDK4ooq>0k5uGgAoG`D-`DZ8>Sx z{?yyf{HXniS(prOU^UnjSUEl}W5X>F;2L=AAKs@qX zr#6kl{RH<_YvjG3eqg37n|!AM!4?;kvx$`a*8ISKrV=S|)LBzcr)l}#xC~#oIsNq} zwU(?kxBgpJ8{m}dN9xEZrQdbq{D9m4&uc?~wTOLh6?3dezBGF%fXC054<266Y(2?1 zYo2Hixb`J42sKIaJXtPhYM(AiIO7o*;3SA~`FU93U6t^l4UsV-bd2i~+i1pNz#^X} z`1zGabohMGA{=OZw1!#z1{?l#ZaN(~W#-8=neyYfyMI>xy{wg(^~SOi>6R5$L5`&V zT`PCn&3Y2^{N}3$k5f5Lj5`=esSlhWy*aQi1oepC&zd=;F~IrwR~&aJd;Zob!yob_ zpEaU+53F*LoyWHUmA^zhe}y&D33JfXsi@hkpxH)RmE1YWYX_04y_btD!gCzKm>c)_hQCY8&Dh0)ZWJcZO z*xe~F9(hOIW!iN;a;tIg^Dc!G55rGB>y~gcwpj~$JD)o*p<%~jbctBg4jazOfA>9> zkhGkbYIDN7-{3{b!ux07I^u(^#DBdUqJA4UBF@+p-Ns+T>BcmQAq`2xtX;HF`5)B=wp4=5W4uS2DIZ^_yN>r(iIF54Lu_u zLo|t4^8r_^9bjb%RnQ4F&gs7WdO@BqPxJ}5FU4Oar*!0iwE@gi}m=>z;r-5-kv!=K)HoU#XsP5KTq^xI6x>xx?$*UXg- z%REj%VfAvLBeiAenL)=UFGB#+2fdbxZefd?7PwpB_e)v%pcaQh{5&tVV4v5sonJ5Q zg7oa6=s;?ZQP}>=xQKMBzFBQ@`(lRBg%Euo-*)hlg{Y;t=NilRW(+@@I=P(KP&%#yRuG<3!$HJ-0|LA(egX4 Q`pbk7j` + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSelectivePopulator< EOT > Member List

This is the complete list of members for eoSelectivePopulator< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + +
current (defined in eoPopulator< EOT >)eoPopulator< EOT > [protected]
dest (defined in eoPopulator< EOT >)eoPopulator< EOT > [protected]
eoPopulator(const eoPop< EOT > &_src, eoPop< EOT > &_dest) (defined in eoPopulator< EOT >)eoPopulator< EOT > [inline]
eoSelectivePopulator(const eoPop< EOT > &_pop, eoPop< EOT > &_dest, eoSelectOne< EOT > &_sel) (defined in eoSelectivePopulator< EOT >)eoSelectivePopulator< EOT > [inline]
exhausted(void)eoPopulator< EOT > [inline]
insert(const EOT &_eo)eoPopulator< EOT > [inline]
offspring(void)eoPopulator< EOT > [inline]
operator *(void)eoPopulator< EOT > [inline]
operator++()eoPopulator< EOT > [inline]
position_type typedef (defined in eoPopulator< EOT >)eoPopulator< EOT >
reserve(int how_many)eoPopulator< EOT > [inline]
seekp(position_type pos)eoPopulator< EOT > [inline]
sel (defined in eoSelectivePopulator< EOT >)eoSelectivePopulator< EOT > [private]
select()eoSelectivePopulator< EOT > [inline, virtual]
source(void)eoPopulator< EOT > [inline]
src (defined in eoPopulator< EOT >)eoPopulator< EOT > [protected]
tellp()eoPopulator< EOT > [inline]
~eoPopulator()eoPopulator< EOT > [inline, virtual]

Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_selective_populator.html b/trunk/paradiseo-eo/doc/html/classeo_selective_populator.html new file mode 100644 index 000000000..cbf1e31a8 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_selective_populator.html @@ -0,0 +1,50 @@ + + +EO: eoSelectivePopulator< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSelectivePopulator< EOT > Class Template Reference

SelectivePopulator an eoPoplator that uses an eoSelectOne to select guys. +More... +

+#include <eoPopulator.h> +

+

Inheritance diagram for eoSelectivePopulator< EOT >: +

+ +eoPopulator< EOT > + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoSelectivePopulator (const eoPop< EOT > &_pop, eoPop< EOT > &_dest, eoSelectOne< EOT > &_sel)
+const EOT & select ()
 the select method actually selects one guy from the src pop

Private Attributes

+eoSelectOne< EOT > & sel
+

Detailed Description

+

template<class EOT>
+ class eoSelectivePopulator< EOT >

+ +SelectivePopulator an eoPoplator that uses an eoSelectOne to select guys. +

+Supposedly, it is passed the initial population. +

+ +

+Definition at line 184 of file eoPopulator.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_selective_populator.png b/trunk/paradiseo-eo/doc/html/classeo_selective_populator.png new file mode 100644 index 0000000000000000000000000000000000000000..0801be8740aab3f2ce61ce059129312ef8b4115d GIT binary patch literal 539 zcmV+$0_6RPP)b8ji%<8po)we*B5W^W zZK!mdK8&;8F)4x|g2q zdtDy0Md~r}QrJMN-nQ=^K41qZ`fk}GnJr^YI{2vXb;R~v-y8O>zKh;#(OX(}(cAcB zm)_MUYx2n|@W}$7RPEsJBOYvH{8{XZKg<3_O!n36GyfqD#qHSgS7CqL-;;g6-`II>tVEI*dm!NV@)DF_3i4D=b^AUZ>?s@fZ@k6Qw{|NnyXb9vV)RbFP=6br5M#A*P+S0?Fnp3dnEl;*aBm#@hW`iqSWNcS d>=XYXegHK)QME}n-kJaa002ovPDHLkV1ilm1f2i? literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_seq_populator-members.html b/trunk/paradiseo-eo/doc/html/classeo_seq_populator-members.html new file mode 100644 index 000000000..d54beceea --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_seq_populator-members.html @@ -0,0 +1,31 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSeqPopulator< EOT > Member List

This is the complete list of members for eoSeqPopulator< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + +
current (defined in eoSeqPopulator< EOT >)eoSeqPopulator< EOT > [private]
dest (defined in eoPopulator< EOT >)eoPopulator< EOT > [protected]
eoPopulator(const eoPop< EOT > &_src, eoPop< EOT > &_dest) (defined in eoPopulator< EOT >)eoPopulator< EOT > [inline]
eoSeqPopulator(const eoPop< EOT > &_pop, eoPop< EOT > &_dest) (defined in eoSeqPopulator< EOT >)eoSeqPopulator< EOT > [inline]
exhausted(void)eoPopulator< EOT > [inline]
insert(const EOT &_eo)eoPopulator< EOT > [inline]
offspring(void)eoPopulator< EOT > [inline]
operator *(void)eoPopulator< EOT > [inline]
operator++()eoPopulator< EOT > [inline]
position_type typedef (defined in eoPopulator< EOT >)eoPopulator< EOT >
reserve(int how_many)eoPopulator< EOT > [inline]
seekp(position_type pos)eoPopulator< EOT > [inline]
select(void)eoSeqPopulator< EOT > [inline, virtual]
source(void)eoPopulator< EOT > [inline]
src (defined in eoPopulator< EOT >)eoPopulator< EOT > [protected]
tellp()eoPopulator< EOT > [inline]
~eoPopulator()eoPopulator< EOT > [inline, virtual]

Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_seq_populator.html b/trunk/paradiseo-eo/doc/html/classeo_seq_populator.html new file mode 100644 index 000000000..a797fcbec --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_seq_populator.html @@ -0,0 +1,48 @@ + + +EO: eoSeqPopulator< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSeqPopulator< EOT > Class Template Reference

SeqPopulator: an eoPopulator that sequentially goes through the population is supposed to be used after a batch select of a whole bunch or genitors. +More... +

+#include <eoPopulator.h> +

+

Inheritance diagram for eoSeqPopulator< EOT >: +

+ +eoPopulator< EOT > + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoSeqPopulator (const eoPop< EOT > &_pop, eoPop< EOT > &_dest)
+const EOT & select (void)
 the select method simply returns next individual in the src pop

Private Attributes

+unsigned current
+

Detailed Description

+

template<class EOT>
+ class eoSeqPopulator< EOT >

+ +SeqPopulator: an eoPopulator that sequentially goes through the population is supposed to be used after a batch select of a whole bunch or genitors. +

+ +

+Definition at line 152 of file eoPopulator.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_seq_populator.png b/trunk/paradiseo-eo/doc/html/classeo_seq_populator.png new file mode 100644 index 0000000000000000000000000000000000000000..78d7dd216ed5808009a69f3c74b5199e8db537fb GIT binary patch literal 505 zcmVX72sD~xP?b^f0)D_ejBP3AYo3|UFv~s`>ot}~tUsL& zm4lu}v2dOlm=?TUtm`bQgeqv9@=&>A^tV_J)hzPPAJ7~fut5Fm^Q!6a>DF$84NA-X`%!j5GyOU{=BB$LT35R^$>u5qEV;zqnG zNx8PLEM}IV`ZuD+l}@G*dKT>C+Ou%?Mq#CV8O@h%StVap9ZSAa9b + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSequentialOp< EOT > Member List

This is the complete list of members for eoSequentialOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + +
add(eoOp< EOT > &_op, double _rate)eoOpContainer< EOT > [inline]
apply(eoPopulator< EOT > &_pop)eoSequentialOp< EOT > [inline, virtual]
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const (defined in eoSequentialOp< EOT >)eoSequentialOp< EOT > [inline, virtual]
eoGenOp()eoGenOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
eoOpContainer()eoOpContainer< EOT > [inline]
functor_category()eoUF< eoPopulator< EOT > &, void > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
max_production(void)eoOpContainer< EOT > [inline, virtual]
operator()(eoPopulator< EOT > &_pop)eoGenOp< EOT > [inline, virtual]
ops (defined in eoOpContainer< EOT >)eoOpContainer< EOT > [protected]
position_type typedef (defined in eoSequentialOp< EOT >)eoSequentialOp< EOT >
production (defined in eoSequentialOp< EOT >)eoSequentialOp< EOT > [private]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
rates (defined in eoOpContainer< EOT >)eoOpContainer< EOT > [protected]
to_apply (defined in eoSequentialOp< EOT >)eoSequentialOp< EOT > [private]
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]
~eoOpContainer(void)eoOpContainer< EOT > [inline, virtual]
~eoUF()eoUF< eoPopulator< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_sequential_op.html b/trunk/paradiseo-eo/doc/html/classeo_sequential_op.html new file mode 100644 index 000000000..cbad0b7a9 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_sequential_op.html @@ -0,0 +1,59 @@ + + +EO: eoSequentialOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSequentialOp< EOT > Class Template Reference

Sequential selection: note the mark, rewind, unmark cycle here operators are repeatedly applied on the same individual(s) not all too elegant, but it sort of works... +More... +

+#include <eoOpContainer.h> +

+

Inheritance diagram for eoSequentialOp< EOT >: +

+ +eoOpContainer< EOT > +eoGenOp< EOT > +eoOp< EOT > +eoUF< eoPopulator< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + +

Public Types

+typedef unsigned position_type

Public Member Functions

+void apply (eoPopulator< EOT > &_pop)
 the function that will do the work
+virtual std::string className () const

Private Attributes

+std::vector< size_t > to_apply
+std::vector< size_t > production
+

Detailed Description

+

template<class EOT>
+ class eoSequentialOp< EOT >

+ +Sequential selection: note the mark, rewind, unmark cycle here operators are repeatedly applied on the same individual(s) not all too elegant, but it sort of works... +

+ +

+Definition at line 88 of file eoOpContainer.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_sequential_op.png b/trunk/paradiseo-eo/doc/html/classeo_sequential_op.png new file mode 100644 index 0000000000000000000000000000000000000000..90d2708dad6af25ffd273ef246f36b95818e400f GIT binary patch literal 2283 zcma);d0bNI8pkzLvs`a=HI%Fv%Pci3ZCuFQ(9B%REtg7&Ym$~GsU+I1(Mm;0%F@tK zM@y6HkXVqkn5ejq5uVT-_eKxyA#O3$)V(vG?q@#tk8{rRKJW6J=lOi!-}_$ibaz%; z30o;AC#SaG#nD?%Zka%4OO`9h-uzlYvFxMc>2}CTDwWDisq{rb!O<+4_2qf-;sxQA zbU@aWKkM!8Be!p;^Mst-iVOQ4?GDA=7Ts=+F0#@@9XxpWt&8s49j2#8-)r-X2)@Ln zv_R1{gY%+u7%rhYH;yT(eNqm4BS4+#2rVwj(lziYfirG}h4Qd@n0lda~ngcMB4Q z$B4MMX}SC?q=ZaMNQqxK8;Ca5Lc+*M6Y2dkh{j~y^-fG-w&en*)jc`wW$k;L1&2Kj z>#5Da^Vh?A#?3?^8_reMUTWmzJ-Z7BppEnI>+zY_ux764wB803$Q6-@yIAd#@@}pE z>o^3HKE0z((-@T+fMely5-t!Wx!lxDLY9maJ~s3-<>xP?=48z}%{T1?8c zR=+}SITdWlzKh!2Pc=bsV3U?Y{{@_RA5T6MR=>3^HP|dcjqhUA?rk2O!LPS*fd$}y zhN(;+rw02WxX9>UkN`!c^Y$#Xj^)u2fC-v zG&|9RqIL!9!Zu^T082#6E;HrO3#EX}OC}I@m=4}Xyx_db- zAur4C;PmuE=Sk3kV{&@SFo<52fBXT;f7i1AN>9Mv2j%_KxUKW;lB9uCGM2s{@)u{J zrx?_(5G?lJD4qo7!z8niDf&Elr?%&{kpu(3Ozo`O< zQP#6A(R}o2_~}sU9(1YpcKD!ORYcgT$}U)&hi<9P6JwCmp1ZrMV=H?ke=w4}fkmk{ zz5W<8tgT9FN_aT7QYTP>8-E?r)H6fB9yp7$MOh%tZrC++wz9Z8PKCd2YiBEycZ+H$v}A1(7GwlHylkl z%-tS#%7DNgVPHIb5P$&C$bjy-B2H9Z^%g(50^PfT9NP7CyU-{TmxKcrt+3ks6+5uQ z?(~uy)M&g{hNNC6t+>J(n`*W1svs!iwbeo_|MH>9(U)eBYv%FLjLtS#TlNT41~cQp zOH|9~C|Bm-hz}%P{&(X(8}?=Gt_K~ z`SEfqL;ImqualMXq>L5jvkF{BcjtR?+Ea>}WA7~6c8x`awGt0C^`%p!at$D#&#z84 z{+@*RP!L=7KH>~>_0qE_8>4TrzOnQdP`)~Q6ikmPPjNz9JpV)>lpQQqx^Fd8DV+3T zVhf-``JnD%dN(N(Kx*(z=6`)6Y)|20%veH^#85bW6Dq99?t0f|;Qo%^9a-lL=2HP@ zpQ?eF;C!?_1FnxDtfx>}Q^xH$Be3Uje-ZSeh>SDMc$5=camHRnFOw*S7qTHKaVz{R`Shm$ZZCv@Mzn$<-DNr{3MP8QC zOsqH|%uu&Z`FS+yB0!#4uJZrX;Il-3U(B!0@eA5D3cUiG_@n=?l@!dqu%i*U{(!`PoIAHD&(DMM8!RFT_aM2{HH^)U}R`S3}1 zLxLh^JO#Kgq2cwP<4Bfk&dx=fII_A-v|jnf$U2mdG|SU)KiJqU`@35FA#;C+lL8GQ zd`LHHc{>@%VrYBPBFs~ZMkmfz44pm;&!_YCNc5VH%G{dv*f^GN%#RxIkn+F}Ce`fU za#$q~N?^BokcW7}45;cSZt5aeM-XS=A0 z0;kGqX*kEWl|ED#E$EHCw*8;?j#Z7;MpmiLPei(O45Dr; zfn&s|bNl%ibPqNU7~EBzQ~hCvo%k*W$Y_uqN?`Z5y1E-Av^6JGnd3?T`NZcN + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSequentialSelect< EOT > Member List

This is the complete list of members for eoSequentialSelect< EOT >, including all inherited members.

+ + + + + + + + + +
current (defined in eoSequentialSelect< EOT >)eoSequentialSelect< EOT > [private]
eoPters (defined in eoSequentialSelect< EOT >)eoSequentialSelect< EOT > [private]
eoSequentialSelect(bool _ordered=true)eoSequentialSelect< EOT > [inline]
functor_category()eoUF< const eoPop< EOT > &, const EOT & > [inline, static]
operator()(const eoPop< EOT > &_pop)eoSequentialSelect< EOT > [inline, virtual]
ordered (defined in eoSequentialSelect< EOT >)eoSequentialSelect< EOT > [private]
setup(const eoPop< EOT > &_pop)eoSequentialSelect< EOT > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, const EOT & > [inline, virtual]

Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_sequential_select.html b/trunk/paradiseo-eo/doc/html/classeo_sequential_select.html new file mode 100644 index 000000000..ebbf79b91 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_sequential_select.html @@ -0,0 +1,64 @@ + + +EO: eoSequentialSelect< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSequentialSelect< EOT > Class Template Reference

All Individuals in order. +More... +

+#include <eoSequentialSelect.h> +

+

Inheritance diagram for eoSequentialSelect< EOT >: +

+ +eoSelectOne< EOT > +eoUF< const eoPop< EOT > &, const EOT & > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoSequentialSelect (bool _ordered=true)
 Ctor: sets the current pter to numeric_limits<unsigned>::max() so init will take place first time not very elegant, maybe ...
+void setup (const eoPop< EOT > &_pop)
 virtual function to setup some population stats (for instance eoProportional can benefit greatly from this)
+virtual const EOT & operator() (const eoPop< EOT > &_pop)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+bool ordered
+unsigned current
+std::vector< const EOT * > eoPters
+

Detailed Description

+

template<class EOT>
+ class eoSequentialSelect< EOT >

+ +All Individuals in order. +

+Looping back to the beginning when exhausted, can be from best to worse, or in random order.

+It is the eoSelectOne equivalent of eoDetSelect - though eoDetSelect always returns individuals from best to worst +

+ +

+Definition at line 52 of file eoSequentialSelect.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:55 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_sequential_select.png b/trunk/paradiseo-eo/doc/html/classeo_sequential_select.png new file mode 100644 index 0000000000000000000000000000000000000000..c09ab43871c2f046bcbfc4fd6983450315e6751b GIT binary patch literal 1954 zcmb_dX;_n28V#aCU4Tv>1xkYgBN4)|FG4`50%}=QAf!YSlpm3jXWcP{V?tT!+7K#$nx2h^Gw5`B z%2NeLxmAhx^Yw?g@kYZS5Vb=m+`kP-suWbxO70%g^7OH`GCXZ2-JK8|akoDwN&c;A zv6icJ)HZndLPqP!lt#CQZACjJO%GxeLDPF<1KZ>i6YOdZqrhHgZqF84NDXS2ICt6% z=x(PF#*3N$o(0a*_jNzIIy+5A4YxB6&#sHv$Fv>3<1gS|cxtParK`b=kk3dwysQOI zW=ThXa29u1CeN0ULCKvgv3|*nAlSG%Ze;~Z<(ECcKb~DYZV{T%l8M~0T7-0(woZ?yO`a1XcjZ&wN zv?K}Pi%FBEaaSo({~0I@#sQ9ja#f%r35w*kiHI|Jt{vV&D0<0nt59p1a9l#qg5PwU z7f3kk?-OVx%rU-U*D7fp?NqXkCaZ0SqG=j8QKJoNB8DTZE0BL>D(A^>9!%BS!5EO# zp|69{umWV(E+tGWKutVwR(YT{q^^vY@>MWhC6vqVLGg2KSqDcX^*oe=h5Bm+O)_^e z6E^l!JC}>H5;97=5;U51m){zAHKe#0oDD9OZe`N`2$KZ`pR>4vwR#KR zPUvw1l*PJ{+UFomcdg?gG&+qor6JDUAYOWdGxK6gUqvCQzt~@E^-H5@!SzPA`8u5_(1-C8CzKPH^6Zy z3`nE&w3_sCbK5=i)ragFXxC#bun5{#y(S)Q?=_JprWXfTgWR^u%7VNud(k2u7xGjD z((6mB2fGpwGU_`H80DfRVjW*@kfJ}~TfiWK2d45hDU?%zd%rNzG-ImDFT2$6!5)H} zpBDpOo}U&kuahxYXSB*z2-&cx=K}Nd)iiyD-A*GJbNgST+?saDHP`u~~rrw;x}unYCm)puFF|KoS?GVxXTdUC{CkrqFeEM5IU-|tb%+pQ#{)K!QE}<0}7v8vrn&l0hdF6b``@@YS z0X4NGAaSSZ#eA?%ymv;D4BQm`6NA)&_bizzTTz7v-sqFNk^}1{Zf3dM=g~o$4W^+` z?$OS4#AYFG+@O&sd0zlj^P*0>Leec%m9m^8!FGvvT)|f<)%q(m;|q8Vm#DvLM*>y! zLR-{Hw#R0xOy2@u2;yW_f2w&!wWMKf&Q<6)O*9%I(gJQp>+PiK*jGD z#)*$6jD<{+j6EM2@K`k7`O#CR4*Z@QT?d{ql2OSCkJ?QlePq;pP`l?zE6DLQJZWF? zu$YtEF?rAMz?ab?Ixghh1g;|HV}D+>{e^n>h_SJ{<2m5O5PSw78;?jSUVmTbd@7kW z05AxdGO974Mii%bp_fhfU$o0x7?IF@K-G?PE`cpfeK$7r>8V%@!ggtHz8IhN-yZ)* a1|;pNM=)BLIja0nAtyY1-6==TUHvx;7x?@D literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_sharing-members.html b/trunk/paradiseo-eo/doc/html/classeo_sharing-members.html new file mode 100644 index 000000000..f4beed20e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_sharing-members.html @@ -0,0 +1,42 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSharing< EOT > Member List

This is the complete list of members for eoSharing< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + +
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
dist (defined in eoSharing< EOT >)eoSharing< EOT > [private]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoPerf2Worth(std::string _description="Worths")eoPerf2Worth< EOT > [inline]
eoSharing(double _nicheSize, eoDistance< EOT > &_dist) (defined in eoSharing< EOT >)eoSharing< EOT > [inline]
eoValueParam(void)eoValueParam< std::vector< double > > [inline]
eoValueParam(std::vector< double >_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< std::vector< double > > [inline]
functor_category()eoUF< const eoPop< EOT > &, void > [inline, static]
getValue(void) const eoValueParam< std::vector< double > > [inline, virtual]
longName() const eoParam [inline]
nicheSize (defined in eoSharing< EOT >)eoSharing< EOT > [private]
operator()(const eoPop< EOT > &_pop)eoSharing< EOT > [inline, virtual]
operator()(eoPop< EOT > &_pop) (defined in eoPerf2Worth< EOT >)eoPerf2Worth< EOT > [inline, virtual]
repValue (defined in eoValueParam< std::vector< double > >)eoValueParam< std::vector< double > > [protected]
required() const eoParam [inline]
resize(eoPop< EOT > &_pop, unsigned sz) (defined in eoPerf2Worth< EOT >)eoPerf2Worth< EOT > [inline, virtual]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< std::vector< double > > [inline, virtual]
shortName() const eoParam [inline]
sort_pop(eoPop< EOT > &_pop)eoPerf2Worth< EOT > [inline, virtual]
value()eoValueParam< std::vector< double > > [inline]
value() const eoValueParam< std::vector< double > > [inline]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_sharing.html b/trunk/paradiseo-eo/doc/html/classeo_sharing.html new file mode 100644 index 000000000..8f809d8f8 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_sharing.html @@ -0,0 +1,55 @@ + + +EO: eoSharing< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSharing< EOT > Class Template Reference

Sharing is a perf2worth class that implements Goldberg and Richardson's basic sharing see eoSharingSelect for how to use it and test/t-eoSharing.cpp for a sample use of both. +More... +

+#include <eoSharing.h> +

+

Inheritance diagram for eoSharing< EOT >: +

+ +eoPerf2Worth< EOT > +eoUF< const eoPop< EOT > &, void > +eoValueParam< std::vector< double > > +eoFunctorBase +eoParam + +List of all members. + + + + + + + + + + + + +

Public Member Functions

+ eoSharing (double _nicheSize, eoDistance< EOT > &_dist)
+void operator() (const eoPop< EOT > &_pop)
 Computes shared fitnesses.

Private Attributes

+double nicheSize
+eoDistance< EOT > & dist
+

Detailed Description

+

template<class EOT>
+ class eoSharing< EOT >

+ +Sharing is a perf2worth class that implements Goldberg and Richardson's basic sharing see eoSharingSelect for how to use it and test/t-eoSharing.cpp for a sample use of both. +

+ +

+Definition at line 79 of file eoSharing.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_sharing.png b/trunk/paradiseo-eo/doc/html/classeo_sharing.png new file mode 100644 index 0000000000000000000000000000000000000000..285bfed57c18ecee423fc590e1e369708369c2a7 GIT binary patch literal 2420 zcmcgudom?^<`=Kkizez4vFY&)%Q!ey#7?$ta{9 zSb4892m}J#pSN)Zf#kzvyj4M7RyTvsgv*-0pq$)orBbPkN~NuZg+D%$v451-*4CJI z=?7U?F3c6_2C|%a>kk5LRkpV|>mHduOX|v+(%EU-MIEBNz?B#av^pJr`YkPp_Bh^R z@|b03>WebHkpT2$XEbm7u#$)|E^J9zDBrHmPMkEz$*+m;a9kM9?4M`s%-9Mre`aB{ z$y9kk&~4Vp(na_;r{hJDEqt7nM5BY{J>b1 z3v^IaA?|LskF>+)THUJ)YQiI2ct>8Ilz39RB1ob>x9H|}JzP9+V>i+&0}dOi|2loh zd3RMN7oW(bmUDmSK>Q1dmPo#-R5diN59XJ9{a6al(>yuKlQSGE=Mo-J`x!^csKR)V zhM`>N(NPD|8hC~r`1S(!=n3yruIgE?Q|7>Pdy)i3DMB7^Jg2LsLyDt#`S>Qo7mR2X zZB==bb&G6~^^IDy#x~kX@1$3=!5&1gBrUHhRJ`h_tpUr1`Dy{homsxQD#*XODUMyx z<#cs=({suiNxk@vWga-aZRG*iQ`3iZK}fjKHF${xo$&KWgj!>SBNKXngm_Hi{!uv~ z%=WMg+D!329!u#NRa;VVJi^ZwSmv-$^LYYHTypvgLE`)h3tSS*&KDJn-x(bi&>NR| zwzd_bRJZ5kjQVrIR1-sLJ%$NKPZ4zm9(Cf0IK&BnHh5LQnQ#oyace+Vr=(oZEOrk3 zI9rco+U8UZ7gwv<0=U@{gFqqC%3B?x8jR(#^S@WIH5WVU(>!Gz_kNrH)g!}f(}qx3 zL(81RNUQx~W?KVx#`syB(wJH-<6s2BDTZwtFpuEay=O1Y3EPXq)87>Bf5+Bvp2$8p ziHbP9Z%$ayv`X^>dSKoy(^EeQnS1Z1|E7UsW&QSIO=@F8(wQLnNtO!ixmE4$_Hq~?HwCR=K(S3$cEV? z>k&DJ4MjVNA)l$ep+GjKuPYiG5!aQ||K9jJX8WYU6Pfq;sb;3UhH8l7DF|7(`@e!Y z>GDXtUiLz7&rnAk;5V*8#RM8+x+CP|(H9zKicSbS(k(fw2fCqqp0Q`%U8S#WD@`t_AguUi+18C# zaNo%k6{Rk&-wma=Xh^GS5Lg2~O`lZv-TpJRwik}Uj_pQv=Z;Ivcmba>2x zaE{-EUE5eeS1YC(ER;O-PnvIJm}I{?^kESfyX~U-xqA|U4ZR-{m#@02dGetHjmI=E zZ^3;l%|zfQ4sP?PEP4ET_3hBU&^_dv^Z>oD z#Sj{BJpt1I z;2so}SEod0OLiSC{Z+g-n6%n){(WwjcA&6C)FpxjdRM+3hL0(#9TY395Gtc!ItY&O zEbiMf5V*~a;csJsDM<=c_UZM4eoLBWs&aVBjaEe8o3++ou-ALtUM?Huk#p)Mw#`Lq zd@(K09pGN+v&7cKN@K-!fd=qf@Ag|_TZ;1f*GK#(jBzp!X@Eo2=RaDG$XV+B zq6wl~{jX&02Zq$tIH~areDbc;^286&PM`zQedIcOb z2)OZy!U{32Q)M=}R%-cWH-Q9@VlVy){vA&)aGV^fS61^lXsHx#%@5&H9EnAPQ{SUu zk}6Le(Lx;$lpB{9i-UbG>WK^+@1K#N&9CK#s@P0+}0oalaYzFPd<={sPFfn5ui89A&Q{X*!l6#g%B>F zvSn5vO9<+d5RjKF`4sK?|B-mDN#C1K?d(RF@?|3o`7j09YW@kw3>NbcBQqqLm6o$OQ+bHrtNS*|-dir*t<>r3D8YY0_)|;X-x|&Px>sY8Sfx?+ z{NOcauSM<4VZPyL_vAB|njRkC=NV6Sz8Ne--0l`mM$BPuJrGhI)2F#^#A3$#ay>7z z%wCdf3vtzi>>B1>R6WX2&CfX|{bF$Acr&0q~9rRh5bg0_xc{wCm0w69J#<=56o_G}#vkWN(YKp;`TS=kM3*tT_Mx literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_sharing_select-members.html b/trunk/paradiseo-eo/doc/html/classeo_sharing_select-members.html new file mode 100644 index 000000000..8bf587332 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_sharing_select-members.html @@ -0,0 +1,27 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSharingSelect< EOT > Member List

This is the complete list of members for eoSharingSelect< EOT >, including all inherited members.

+ + + + + + + + + + + + + +
check_sync(unsigned index, const EOT &_eo) (defined in eoSelectFromWorth< EOT, double >)eoSelectFromWorth< EOT, double > [inline, protected]
eoRouletteWorthSelect(eoPerf2Worth< EOT, double > &_perf2Worth) (defined in eoRouletteWorthSelect< EOT, double >)eoRouletteWorthSelect< EOT, double > [inline]
eoSelectFromWorth(eoPerf2Worth< EOT, double > &_perf2Worth) (defined in eoSelectFromWorth< EOT, double >)eoSelectFromWorth< EOT, double > [inline]
eoSharingSelect(double _sigma, eoDistance< EOT > &_dist)eoSharingSelect< EOT > [inline]
fitness (defined in eoSelectFromWorth< EOT, double >)eoSelectFromWorth< EOT, double > [protected]
functor_category()eoUF< const eoPop< EOT > &, const EOT & > [inline, static]
operator()(const eoPop< EOT > &_pop)eoRouletteWorthSelect< EOT, double > [inline, virtual]
perf2Worth (defined in eoSelectFromWorth< EOT, double >)eoSelectFromWorth< EOT, double > [protected]
setup(const eoPop< EOT > &_pop)eoRouletteWorthSelect< EOT, double > [inline, virtual]
sharing (defined in eoSharingSelect< EOT >)eoSharingSelect< EOT > [private]
worthIterator typedef (defined in eoRouletteWorthSelect< EOT, double >)eoRouletteWorthSelect< EOT, double >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, const EOT & > [inline, virtual]

Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_sharing_select.html b/trunk/paradiseo-eo/doc/html/classeo_sharing_select.html new file mode 100644 index 000000000..f6e777bcf --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_sharing_select.html @@ -0,0 +1,101 @@ + + +EO: eoSharingSelect< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSharingSelect< EOT > Class Template Reference

eoSharingSelect: select an individual by roulette wheel on its SHARED fitness. +More... +

+#include <eoSharingSelect.h> +

+

Inheritance diagram for eoSharingSelect< EOT >: +

+ +eoRouletteWorthSelect< EOT, double > +eoSelectFromWorth< EOT, double > +eoSelectOne< EOT > +eoUF< const eoPop< EOT > &, const EOT & > +eoFunctorBase + +List of all members. + + + + + + + + +

Public Member Functions

 eoSharingSelect (double _sigma, eoDistance< EOT > &_dist)
 Ctor:.

Private Attributes

+eoSharing< EOT > sharing
+

Detailed Description

+

template<class EOT>
+ class eoSharingSelect< EOT >

+ +eoSharingSelect: select an individual by roulette wheel on its SHARED fitness. +

+It is an eoRouletteWorthSelect, i.e. a selector using a std::vector of worthes rather than the raw fitness (see eoSelectFromWorth.h) It uses an internal eoSharing object which is an eoPerf2Worth<EOT, double> +

+ +

+Definition at line 43 of file eoSharingSelect.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
eoSharingSelect< EOT >::eoSharingSelect ( double  _sigma,
eoDistance< EOT > &  _dist
)  [inline]
+
+ + + + + +
+   + + +

+Ctor:. +

+

Parameters:
+ + +
_s the sigma_share
+
+ +

+Definition at line 49 of file eoSharingSelect.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_sharing_select.png b/trunk/paradiseo-eo/doc/html/classeo_sharing_select.png new file mode 100644 index 0000000000000000000000000000000000000000..e6584aebe5f7760e202a3c62ed5576fea174e239 GIT binary patch literal 2660 zcmb_eXH-+!7LI~CfJ_`IDvFUON>gcqfKnzjA;KUCk#>V6fCSJHBP5}T$P+{aq#BB% z)IhF)fIvbUL(51Hp(8>-i6l~j5`;{2=BaPJwceVw-urRS-DmI9_P4+DtrKl$Ybhx% zCk}x?B&|-G*+U>3$q>i}4N(!HC(@Ba6#jPFojPMK5D0{(K+uq#?GZ1uzI+W04TL7a zl(4(un!T+9#AJHF69N(ATbccQCMaVrgI<%PCw&WRe<4w9vg>l!8r-l*e?O|e4LuVh z`wx1Dn0(-job1(N^0 z(G~=Ft4*op8NfF68Ydj-tXkK)J8{pr?M-cdZwLpQo^PQKdaiW0S00kA9Ml7^)8zx= znS(|fj-QqlS$ro`pjpx3GYA|!o#9n(JTMpXJo-&uE^_;IGqAkCj~WHgaWman4kH~u zfVR_5XrwY?^Z3qT)j(dpcGdf$y|z;)HiH3U2181ELm}&iC-|OKff>JblQlW-xfAV} zpmS5a1mHqYWHY8fWY!L}X2npMb|^n~Bhb>KtfdW(B?n>0U<-Zd%N#~Z^A#<1(?ZQ` z@DX824wa+HU~J4p3&xh%d^l{qCR;`u>2LTcwWO}H)tzg=Q_{wh50`-0++?nYpOiQ z+)Y1!sJ~3*%X{p9sqZ=#n#7^T%~xfP9-SG%p0wfu&@?g^F>JyG!c>=HZUCBHYMb#i zjq#54k9h6OkdC{rc1#s3^LP0f@2^5bJ8W$|WO>`z!|d*5 zZF_{};#vu3x-rN5hs zoXpWy1$(>&4@S&l=XbjZd1=vC37D!A>5tsCEU#e5T*pMzl)hZ1ocpX(GIjs)PlV?S za^m5A8{X!cCY_qp>AR8abL9ZoZrRZ0u;YF;Q@VwP9^gOdWOf;{c)5!$pG}QY*V0h} z_WbK$N$tb9Ot>scswFq4I_Jlo1MjZC!3q>Wp*oDem4SYPercNb?jCq7 zpt1l4sZYHjMEjalYu~OV@rfM*B{fm}rbf1`kT%~J=PQ@~wv+WC=Jb2Q`|pZAp$#e+ zA=ZaWqYtkrpyB~ zD;Acn=t+O!oz}!2b9wI$C?ykYj%{Zh)e&Ds}${tg7Hgatuo36DUNQe7GEnRIC)lD&>QA;g{)&Xz`(MsuGMN*r|dEPll z*qw>Y>KBK?#+AWS!@5$%{DD|B-p6XU=KYI}x8dlfOTO(X#>0X5mvAB+o?=#W7QrDq zX-?7hzS;OJI1w?)h&+;5#zH-nyb8`TVr&4@y89QW2KLJyToFq^*VQ=zy=wO<{@V!p zU`K3rpufYZTRkhklf>nSD=zqC`XG!3bdY3s;c{Hr48O`n-Y>v0uVnWwk}bgI^P4cm zAPv8-AIY2J=@f5?RrHQpwN5Hj!C|)?N!B}DeQ`~WQFJ8=L_zno>?Sc}@gd@iW1;)L ziI@-={33q2g-O(R?SqDo(;I}Iw8h99fP%)1m@%ei`a)J3|VzdEs<$esXIG0(W=NS!Jmm?WH2m z;WtQ>Bx$Ps#B!E{`F-0k{^p#J4 zgjE3*j;jUCyl#ba949N{1`M=J+4jJlcg50N>8oG{eFP_8ioF=sPot#p9A&T`qimm$ zwG*Gm(0Sn!)P+H3&Ur4T2%&N&^pc&qZ<|$IYgbJYb8;~AkvXXTrTy+M3e)>f75IW9 z+@nKk^Z!QzsH11pGY-$%M3rxOny@-35+wCaR0ig-)$sfogNr3AYXo1Xx)zSaYE_VX z)=ZZXlc0BQ4tsmmD2PH165xu?rC;aZ#<>2Ax?67!@1eY9g)8jIjapJR?Wwy-Cs5Um zZAZ%VTc=;?a_bm-x5d>A-}JxBl&^S&p^POBQ>u@fGUPbJe(G0MNGri1sCPW7fw})i z7hIqt-d%TY!-su67(aHy@OhBSz{+u|6a!kvKaiXG#G@z-m;p-OYV2VfR*?IczJ?9_ znuz+IRUWBCByhf_c*_W1#}zul@`Lq*ZqSUdvPAV|gD%W#6PduNdc&|%r1Cc!brG2X g#*|Qzu0;VfP4#}1LN=vL_#}i_ncJF?;T{ox0C44BegFUf literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_simple_e_d_a-members.html b/trunk/paradiseo-eo/doc/html/classeo_simple_e_d_a-members.html new file mode 100644 index 000000000..d01f2c371 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_simple_e_d_a-members.html @@ -0,0 +1,23 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSimpleEDA< EOT > Member List

This is the complete list of members for eoSimpleEDA< EOT >, including all inherited members.

+ + + + + + + + + +
continuator (defined in eoSimpleEDA< EOT >)eoSimpleEDA< EOT > [private]
eoSimpleEDA(eoDistribUpdater< EOT > &_update, eoEvalFunc< EOT > &_eval, unsigned _popSize, eoContinue< EOT > &_continuator)eoSimpleEDA< EOT > [inline]
eval (defined in eoSimpleEDA< EOT >)eoSimpleEDA< EOT > [private]
functor_category()eoUF< eoDistribution< EOT > &, void > [inline, static]
operator()(eoDistribution< EOT > &_distrib)eoSimpleEDA< EOT > [inline, virtual]
popSize (defined in eoSimpleEDA< EOT >)eoSimpleEDA< EOT > [private]
update (defined in eoSimpleEDA< EOT >)eoSimpleEDA< EOT > [private]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< eoDistribution< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_simple_e_d_a.html b/trunk/paradiseo-eo/doc/html/classeo_simple_e_d_a.html new file mode 100644 index 000000000..37926e41c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_simple_e_d_a.html @@ -0,0 +1,119 @@ + + +EO: eoSimpleEDA< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSimpleEDA< EOT > Class Template Reference

eoSimpleEDA: a very simple Estimation of Distribution Algorithm +More... +

+#include <eoSimpleEDA.h> +

+

Inheritance diagram for eoSimpleEDA< EOT >: +

+ +eoEDA< EOT > +eoUF< eoDistribution< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + +

Public Member Functions

 eoSimpleEDA (eoDistribUpdater< EOT > &_update, eoEvalFunc< EOT > &_eval, unsigned _popSize, eoContinue< EOT > &_continuator)
 Ctor from an eoDistribUpdater ...
+virtual void operator() (eoDistribution< EOT > &_distrib)
 The algorithm: generate pop from distrib, evaluate pop, update distrib.

Private Attributes

+eoDistribUpdater< EOT > & update
+eoEvalFunc< EOT > & eval
+unsigned popSize
+eoContinue< EOT > & continuator
+

Detailed Description

+

template<class EOT>
+ class eoSimpleEDA< EOT >

+ +eoSimpleEDA: a very simple Estimation of Distribution Algorithm +

+The algorithm that evolves a probability distribution on the spaces of populations with the loop generate a population from the current distribution evaluate that population update the distribution +

+ +

+Definition at line 46 of file eoSimpleEDA.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
eoSimpleEDA< EOT >::eoSimpleEDA ( eoDistribUpdater< EOT > &  _update,
eoEvalFunc< EOT > &  _eval,
unsigned  _popSize,
eoContinue< EOT > &  _continuator
)  [inline]
+
+ + + + + +
+   + + +

+Ctor from an eoDistribUpdater ... +

+plus an eoEval and eoContinue of course +

+Definition at line 53 of file eoSimpleEDA.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_simple_e_d_a.png b/trunk/paradiseo-eo/doc/html/classeo_simple_e_d_a.png new file mode 100644 index 0000000000000000000000000000000000000000..d3cec9c2d418ed4a927d88ee4c8c8f17cdc3f104 GIT binary patch literal 1780 zcmb`IYfzGT6vinlHY#h}^^%!oyVfXax@n=dT9#wrbrF0EAy8A(s3fD*G}_25&9yYI zh_}2=z51$o11!9hvJ#}Jm|CVn3SqTonRy`=-4D%dvtOG1@c;dv^X1GuXPz@B-rLi4 z4Z;usgTdCI4<5k6U`u^9x@nn~hBinmKh0<0?T&L%tJNB*RyXD4QEq6|;%jPZI^Uvx zsVSG7!Fu|@_Kx)h!(b~C&}<*%Cr*m8k2hr=P%)BNuH=k=NU-dg9J&QBKI3afItmB6OG{E&L4$D4cvwJ4VUoC( zI+ein1;Tnmd|x*zg@W$Q&6459#AES0I;AF@u0n6QF5t;*79_8@7*XXFaH`mIzUos1 z*TK@auAt*_UL)c7RE=8a_yev{##`2dU~w8h{>T7%)CJhrdF(Fo$paI|)dW@^t8@!h zigB*5l~s8`mbLbkWx3awf)Z(`JRBfc;qI z)u4mEk_}-|S8PUMr5!@(ZzXp=+^;UkT5*)lnVb?&A=boC>5kf z(MstP_o>gximBHX z?m5A{JotN{$eV)wd}-!L?~SDao#ObZ3&Z}tq0ikTCbA&C9BaEqX1i*mzS*X`BLC<% z5g5w^O{l--aLwcVD=Nn5R&A@9=?2#R*T8mbRH7ZVm)Lq@&ZN6p-XL@+s0OVfG5&oz z<#5(;bCE^Q)}WXP#|)@z_)%cx>xNwgM}q_tA-t4K#L*G+V44-aUQoldZ_CfLhq`q2 zAnEl0vvDRdE;pTn8SzHQ44#LZwzpAND{W)`*dxh`2aC(ro(`Jqa7=180%T%5;?_Tr z;RH=*ac31Ao)Z~=*hm^<+XD$>@a4??gq^3p@0}I_q3s)r9)~3(WGV>-`}1lKc|Llh z)c%lZcfyXmGA3=ED?qN+<|mI@^ctQirt|~R?lwm${J~cs(YniT!7DC&mpOn>)gjHSbi6}I+DGgK zIEdQ0lVeKkLj^5E8unI6rRfSNqha=By1!}J7#Oy3&$F1c-sVV#uFWXjYKTm)Pa2y8 zZ$ivfFM7;)_Vafg_5!H+!S!D@R^HT6SJzj4UcKaf`V|UJR1~W@Q82WN=K;u>a_Mhr CW`$e; literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_sorted_pop_stat-members.html b/trunk/paradiseo-eo/doc/html/classeo_sorted_pop_stat-members.html new file mode 100644 index 000000000..e7cd88646 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_sorted_pop_stat-members.html @@ -0,0 +1,40 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSortedPopStat< EOT > Member List

This is the complete list of members for eoSortedPopStat< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + +
className(void) const (defined in eoSortedStat< EOT, std::string >)eoSortedStat< EOT, std::string > [inline, virtual]
combien (defined in eoSortedPopStat< EOT >)eoSortedPopStat< EOT > [private]
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoSortedPopStat(unsigned _howMany=0, std::string _desc="")eoSortedPopStat< EOT > [inline]
eoSortedStat(std::string_value, std::string _desc) (defined in eoSortedStat< EOT, std::string >)eoSortedStat< EOT, std::string > [inline]
eoValueParam(void)eoValueParam< std::string > [inline]
eoValueParam(std::string_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< std::string > [inline]
functor_category()eoUF< const std::vector< const EOT * > &, void > [inline, static]
getValue(void) const eoValueParam< std::string > [inline, virtual]
lastCall(const std::vector< const EOT * > &) (defined in eoSortedStatBase< EOT >)eoSortedStatBase< EOT > [inline, virtual]
longName() const eoParam [inline]
operator()(const std::vector< const EOT * > &_pop)eoSortedPopStat< EOT > [inline, virtual]
repValue (defined in eoValueParam< std::string >)eoValueParam< std::string > [protected]
required() const eoParam [inline]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< std::string > [inline, virtual]
shortName() const eoParam [inline]
value()eoValueParam< std::string > [inline]
value() const eoValueParam< std::string > [inline]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]
~eoUF()eoUF< const std::vector< const EOT * > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_sorted_pop_stat.html b/trunk/paradiseo-eo/doc/html/classeo_sorted_pop_stat.html new file mode 100644 index 000000000..8d7a4b637 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_sorted_pop_stat.html @@ -0,0 +1,143 @@ + + +EO: eoSortedPopStat< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSortedPopStat< EOT > Class Template Reference

Thanks to MS/VC++, eoParam mechanism is unable to handle std::vectors of stats. +More... +

+#include <eoPopStat.h> +

+

Inheritance diagram for eoSortedPopStat< EOT >: +

+ +eoSortedStat< EOT, std::string > +eoSortedStatBase< EOT > +eoValueParam< std::string > +eoUF< const std::vector< const EOT * > &, void > +eoParam +eoFunctorBase + +List of all members. + + + + + + + + + + + +

Public Member Functions

 eoSortedPopStat (unsigned _howMany=0, std::string _desc="")
 default Ctor, void std::string by default, as it appears on the description line once at beginning of evolution.
void operator() (const std::vector< const EOT * > &_pop)
 Fills the value() of the eoParam with the dump of the population.

Private Attributes

+unsigned combien
+

Detailed Description

+

template<class EOT>
+ class eoSortedPopStat< EOT >

+ +Thanks to MS/VC++, eoParam mechanism is unable to handle std::vectors of stats. +

+This snippet is a workaround: This class will "print" a whole population into a std::string - that you can later send to any stream This is the Sorted version - see eoPopString for the plain version

+Note: this Stat should probably be used only within eoStdOutMonitor, and not inside an eoFileMonitor, as the eoState construct will work much better there. +

+ +

+Definition at line 96 of file eoPopStat.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
eoSortedPopStat< EOT >::eoSortedPopStat ( unsigned  _howMany = 0,
std::string  _desc = ""
)  [inline]
+
+ + + + + +
+   + + +

+default Ctor, void std::string by default, as it appears on the description line once at beginning of evolution. +

+and is meaningless there _howMany defaults to 0, that is, the whole population +

+Definition at line 107 of file eoPopStat.h.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
void eoSortedPopStat< EOT >::operator() ( const std::vector< const EOT * > &  _pop  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Fills the value() of the eoParam with the dump of the population. +

+Adds a
+ before so it does not get mixed up with the rest of the stats that are written by the monitor it is probably used from. +

+Implements eoUF< const std::vector< const EOT * > &, void >. +

+Definition at line 116 of file eoPopStat.h. +

+References eoValueParam< std::string >::value().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_sorted_pop_stat.png b/trunk/paradiseo-eo/doc/html/classeo_sorted_pop_stat.png new file mode 100644 index 0000000000000000000000000000000000000000..081333190acd5b3e8c1bcb773db1d0e227a81746 GIT binary patch literal 2913 zcmaKucT`i^7RCc8D9zEqfH#zZ0Mf^3VrWt#9Sj%<9dr?d5EKYShYm7;3KtATdM^SZ zktW50hzSZJU}y@07k3n;G$dK={9y8tB{nlDnMOld_ zZ?vwijS+q)F;Z{tX39@DUUu(1U{bqZ4hD8!u-ry}=Jm=AVRC_c`}Tp$QS?K^U+I?v zOUSO^g(l}Q@21dwy-r}V^k{yZsAq5-d$G1T0j;#DONiU(Ja(k*Y<|A3rqqql)_(g1 ze=;>x=Qr3m>E$;Tm^?241`ftFNhU9CPHwy%DO~ps3=nyRm_@zP&8v?{u8nAFbS0=u z=hkzbWgfdS+F?w8s3BO?F|*t-{8DQ+>PX@z_kAUb;u4$qPu=%2qmy%@S16$q7XC-K zt#BImR;6#40aDw#%*fJ`+2Of&J#_{pK@FV=C~086d{kad0PKj_V^NCOOnG!*X9q5x zBY34oyo@X3{!7`}?hBKWUf0AwqYjqzdVpfltUJoEhg2@)=1t&N6woCR>$tTl|36&IH zyi`VwJvY97U@ij|ljyk!oLTZ~iR*mNHp?vO66iwuyUT&8S+>Q9q^v-hRahK`aBZ34 z-5}ycMa2a(d>RHENK+%hw^@q7g~Q(zkT)8CBj(!j4ZbX%Kva{K;J|uIKdan@I7aXZ zt0pCeo&afM>Zf|ZAH841JuS+GO|RtJR%IF9@ZZ0=Jwv}(ws7$tYL(o86ACCf;S-;} z@KCT+AN4AzDDr}@y?nO1HSi1+X zBW}&!D2UPZ(@qIpX%^N_{iou^qadDzDEjv=ae;DQhJ-430P~f*Fe^UftuZHbp)gUU zrO8K6qR;-ng-zCuUq;*b3=;VZ&+hH3;3nE|A*&z&9s(*w86DOu`CHm}tzhUJaVxiP zWe8;Fwp|_^`MNkQwLa0ef^9QC0CIDF>~vu*1SqPNK7-UOIQ7LaSQr+miko}qbW}7mF1P*bU9bq%kM0iGlM4lZ@t3E)sAqN>0i2AmNwJ*w4A@Eg@?psJSr(y zzAi{eOCR4lu0mfUD=z8}o9IkiO>~Tu;##{sil^FTm+LIsAC60C5fiftDuL^blP!-! zB=G*#^vqc2kRf+1MVN+Y=slgv#({N(u8_VT6y@OTv7?{}sGZ$an7yL7s$anDOdtT#+ypdOG*;vwY_=p$G7%jvaIwZUKSh&>L zSFSNx2{LDrgl3IS0m1zm2av&@-D{{o^j(|Id$>jsUn;?n6TLm~_CU+UcOVrU}%x$#LMR7Kj>s` zne2KICO*9w8c13Y%sC3B7TLl*FO?^LOzGMVVu96tCL;~&`-=okFEM&=BMx)jY(1P7 zn@jRD8Dgb*jM0{uvGmsHMqG(I)w1&0Ip~C6HwK*XYNMNTUIEE4Re_d}B;*d^5)!?I!Z>7>*aO1z2B3W)`}`G`*|mhFwY)k3kW zQd8S@F9XI!9M937;(CPas%@sj3Ek-=G2yT*uy1UbhOWcFu~5C$u9!{uEMp{XsNjPh zQ@&x4SVV@sB?S%^$Y2Qii~5bwKWXjCDoEW7^S}xHA;2o0X~MA~KQ)fY6T9-mp$%7fjiOk!#b~t z&Dy-atyZt#rJ}-bex5J?#osMO?Kk7QV2+L{!bJdteY|dDy4R=lJ&&gn+GaVX{%Q^i zRPzwdNLzK*h39Uag*p+Pi;M^gQ`msKvRjEl`87B zYzC6vQfpt?HKvgBrZE$SE_CByL<8mt;*OVav9g4_-$^2mkRt8X_Q@OKRBWqY_2em{d1rAUnKw9Rg$MjttCMjc@*zO-Y|vIVQ3fr*r zR2pC3x!a$HKk%??tUuJTl-d$oXbC_yo z*t@^8E!^r}X`MC3xt|shkW{-dL%V4dIR(g&$BW@>R@)Oo0Qz=~b&Yi2%p~O`waG6) z5~s1pH=_6A>s0}1FEvYmn$Dw)tofKnPml(el4gy@ANm=j_EI6nf4x;(!=^*c%FF;NZn%t;c|kIjD_xb@zG6L5Fav zbn_XzNwuw-3@>Tvmoc`j5_PDIYr3{RnX^j{Zd;X8Z+&}dWVo-H`+HmdV-x16)?d9@ yT%U#&w;I`yuZwBhj$x3kAT!S1K{lfa?Gu+Mnzdf1QLCK$FvQdlYfytZfAx1!YGq6S literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_sorted_stat-members.html b/trunk/paradiseo-eo/doc/html/classeo_sorted_stat-members.html new file mode 100644 index 000000000..fd69963b3 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_sorted_stat-members.html @@ -0,0 +1,38 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSortedStat< EOT, ParamType > Member List

This is the complete list of members for eoSortedStat< EOT, ParamType >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + +
className(void) const (defined in eoSortedStat< EOT, ParamType >)eoSortedStat< EOT, ParamType > [inline, virtual]
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoSortedStat(ParamType _value, std::string _desc) (defined in eoSortedStat< EOT, ParamType >)eoSortedStat< EOT, ParamType > [inline]
eoValueParam(void)eoValueParam< ParamType > [inline]
eoValueParam(ParamType_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< ParamType > [inline]
functor_category()eoUF< const std::vector< const EOT * > &, void > [inline, static]
getValue(void) const eoValueParam< ParamType > [inline, virtual]
lastCall(const std::vector< const EOT * > &) (defined in eoSortedStatBase< EOT >)eoSortedStatBase< EOT > [inline, virtual]
longName() const eoParam [inline]
operator()(const std::vector< const EOT * > &)=0eoUF< const std::vector< const EOT * > &, void > [pure virtual]
repValue (defined in eoValueParam< ParamType >)eoValueParam< ParamType > [protected]
required() const eoParam [inline]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< ParamType > [inline, virtual]
shortName() const eoParam [inline]
value()eoValueParam< ParamType > [inline]
value() const eoValueParam< ParamType > [inline]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]
~eoUF()eoUF< const std::vector< const EOT * > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_sorted_stat.html b/trunk/paradiseo-eo/doc/html/classeo_sorted_stat.html new file mode 100644 index 000000000..caf02eda1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_sorted_stat.html @@ -0,0 +1,47 @@ + + +EO: eoSortedStat< EOT, ParamType > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSortedStat< EOT, ParamType > Class Template Reference

The actual class that will be used as base for all statistics that need to be calculated over the sorted population It's an eoSortedStatBase AND an eoValueParam so it can be used in Monitors. +More... +

+#include <eoStat.h> +

+

Inheritance diagram for eoSortedStat< EOT, ParamType >: +

+ +eoSortedStatBase< EOT > +eoValueParam< ParamType > +eoUF< const std::vector< const EOT * > &, void > +eoParam +eoFunctorBase + +List of all members. + + + + + + +

Public Member Functions

+ eoSortedStat (ParamType _value, std::string _desc)
+virtual std::string className (void) const
+

Detailed Description

+

template<class EOT, class ParamType>
+ class eoSortedStat< EOT, ParamType >

+ +The actual class that will be used as base for all statistics that need to be calculated over the sorted population It's an eoSortedStatBase AND an eoValueParam so it can be used in Monitors. +

+ +

+Definition at line 89 of file eoStat.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_sorted_stat.png b/trunk/paradiseo-eo/doc/html/classeo_sorted_stat.png new file mode 100644 index 0000000000000000000000000000000000000000..2cfa5b87abc8bf48cbd177dbef3028cb1bcb04bf GIT binary patch literal 2581 zcma);XH-+!8is@DpdhFy!W@`k1Pe$}@B|DvNHZ}3qCgPPAjlC&=vA4aV?oLx#)2R) zlt5_GVF2j}2Z2yS31uh-M35GhBIt0l=H6efnOXP8-ru{wUDn$Bd)B*llwdSpH|!MT_qK%h_WU4q*_d=;dwZKNx3?QoQtTe`)nBclp&_7YdzwEK z@HHcvqjcYL98st}d3ZxTl7G@-a(79d!u|-zWWZWPdg$z_)98=-*2%R>wjpinh+Ulx}Y&?G?kor@O&%4o(0baLTy4rx3_M?!kk)L45ZEsJ!0Ni6GMq!0vDatrB zkTq=e;dP7IR&CZwP5)Wnwl&Vrn09tc_0*L3DbmI^;>$MC1nTLszv*Z%M;#lWu>7j5 z=HnuQn~Y$pcHN3va4NkE@OP1V#I2sGD%KwwddE~qvhQ+9a!)R;Yqqj=%^#8y+ua%% zmR+3q+--%f=61`5QbY|bBdTDR;oPYh?yQr~E$0yMnHl^*c zLAOo&UwEyYMnHd+&8q}dc1@i4W!Y|WhkHFZcE34p7x^Q0j1OIP8t zL>wIavKJrndqHpWch7t(_r)&XRm`nPHI&BHy8SZWY{m>g93&(0M-a+IM1n-DkEN)7euR8a6jH5zm zUs-@ofNx*8BweM|Ur{t(&yWFp2GKe$wH+uJv*9cQbO^whp55?FC?Z24r+q3^au=$f z^gq7dC&6jGG$%}s378XJ5CqNy2OAC9$=0v;p(_vdWQR{^jdEuz`YI;$bQxkxnMy_b zjJ>@7iWFAWvw{YlRJGabFL!K(B1!)}z~}#&{G9)!Z*grl^ns}Wn2Q1|Q1Ho6tb{H@ zIMsAlPxcN9>Dx5V_|KDHh4M%Dtg6~XE`IUJM*2do*Co^&)GB?|{*`hl^#CBU1OA?W z!Ci{!y`KksQZizZu8btQnmy)NB<1xb59f;O3E)t0}d#TiyjorEpc*3%oED?M+;>`GCdvoW$T` z0QXE^7}?Q{={3hg!T4BlTykE{b!fsVc^(2kbS&C1i|GZmA^GwqgR3-G*QCVh8_f3ZR*$G(JeALC%=f;2+?B(?OJ8Fart$e4 ziAc!JJp1Nr(%_v3AM1N^My7qZ?akxOoF$Pi($+)x==9MX8wfM*q7fMF;{`7V5$_<; zE`j?fcad;i=sQp!(o0nn1k#FsYIRor8W8fo63gWBPCI|~*i%>{<$$7n&iR?ED zsiuPGpQ!bC)qV;ql<%~=K}TKg zGxW>&3OT0lLkp`voXtca|FprP;>VZ35BhU$j|$(fTE!*O9{ZB7aBDbalo%Je>Vb^I zAHDl!!8S{@PEH%)bF0hr^-Iw2z{;m6lh>tF$|~xz>b_QZXT1pVB=t#aZf&b7Oy(Aa zm(W|56-O^B+)e`voNCOvqMfv_Zv7%O#6EjM;9-qKnJ{K%@}WiRtOH_04m!uKEX3TR zJ^?<`IE4&tCypd1Wab+dkgQuI8+W?4z~>CbAMRABcXm zRvRD_IWlI<`b}T)WYaYoVKM3U(NigcAaPvd3V$aw9%T)s++4n>ZGmq*;B+`My;u^) zXSI8@WaO3mjMF2$Tle6`#w#Wz&?EP-IKfs1(!z;nk-BB21D3dowQ)Cv+I-tM8-@&K zvFY2Oq>@)_>gJ+9&{wUMm1o90hm9?CG!G}{tbtG0B%UTX`!8gJ*bxFI>tioyu0m+^ z@X{fy?1sOe0pD6D{Lc4+8L+_7;a6!2tHJV{dOk<`>enlhFE95!<%oUoOlqt3-Bqv) z%uVgf9HKWI5dzSmJH_~h^zU>vc6%g`8EKBC806E%)c?u2zG2R(FMeL(kDHbmiZ)@L z{g&K=*@dR_dAvRSLkg<{8$0J+o@_b??pQ?=g3vl)ov^r56g-Az)|LmC&WN9p*wE){ zX4`okU@zsJ0t-sYO`i|Pjg?Prt4vIZ%o@1U`gA-6V5OP~g(J=H{Od9IMnA1MhBr~8 ze{4VYbz6fi)y1oD8}&3D1*e|l1~&G+S;SKHSteSPQtGQ$cvjgjAEg_!s($WOm^D5D zx+wv3a++Gpqv$^$b6)fYa8u$I{Anty1&#M*rF~#zWml7Fzi7wsxq`ao1AwK!Eq6Nn zd5r|DCt1xiPZ?}B(!oOU0D4NpIYx4iQ0*dr4QD?rqg#qxu`i=HsC!TALkB|)p@XO1 z=z+n_gGBU@6oME+GSae6xtBnD*DvDNoN}jp7!#kwC`>>{j_8ojBF*?P;-`o6Lqv=# z(t9WDnVZLA-JeJfd94480Si2R8Rxc3n8Tl^dn)y-u+%hOz~8>>CXiVNr0530X14Gp eRQ+T;?>y@8Iwn?kb)El*L*XwF4GZ+`!v6!KocNjm literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_sorted_stat_base-members.html b/trunk/paradiseo-eo/doc/html/classeo_sorted_stat_base-members.html new file mode 100644 index 000000000..483899020 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_sorted_stat_base-members.html @@ -0,0 +1,20 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSortedStatBase< EOT > Member List

This is the complete list of members for eoSortedStatBase< EOT >, including all inherited members.

+ + + + + + +
className(void) const (defined in eoSortedStatBase< EOT >)eoSortedStatBase< EOT > [inline, virtual]
functor_category()eoUF< const std::vector< const EOT * > &, void > [inline, static]
lastCall(const std::vector< const EOT * > &) (defined in eoSortedStatBase< EOT >)eoSortedStatBase< EOT > [inline, virtual]
operator()(const std::vector< const EOT * > &)=0eoUF< const std::vector< const EOT * > &, void > [pure virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< const std::vector< const EOT * > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_sorted_stat_base.html b/trunk/paradiseo-eo/doc/html/classeo_sorted_stat_base.html new file mode 100644 index 000000000..103c40427 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_sorted_stat_base.html @@ -0,0 +1,55 @@ + + +EO: eoSortedStatBase< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSortedStatBase< EOT > Class Template Reference

Base class for statistics calculated over a sorted snapshot of the population. +More... +

+#include <eoStat.h> +

+

Inheritance diagram for eoSortedStatBase< EOT >: +

+ +eoUF< const std::vector< const EOT * > &, void > +eoFunctorBase +eoSortedStat< EOT, ParamType > +eoSortedStat< EOT, EOT::Fitness > +eoSortedStat< EOT, std::string > +eoSortedStat< EOT, std::vector< double > > +eoSortedStat< EOT, std::vector< FitT > > +eoSortedStat< EOT, std::vector< PartFitT > > +eoNthElementFitnessStat< EOT > +eoSortedPopStat< EOT > +eoScalarFitnessStat< EOT, FitT > +eoFitnessStat< EOT, FitT > +eoMOFitnessStat< EOT, PartFitT > + +List of all members. + + + + + + +

Public Member Functions

+virtual void lastCall (const std::vector< const EOT * > &)
+virtual std::string className (void) const
+

Detailed Description

+

template<class EOT>
+ class eoSortedStatBase< EOT >

+ +Base class for statistics calculated over a sorted snapshot of the population. +

+ +

+Definition at line 76 of file eoStat.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_sorted_stat_base.png b/trunk/paradiseo-eo/doc/html/classeo_sorted_stat_base.png new file mode 100644 index 0000000000000000000000000000000000000000..6caaa3739fa2f3b18802473c9cb77ee687262836 GIT binary patch literal 5299 zcmd^DXH-*Nmkvl55knDaM#&2T0^&<~>Bg3XDn(ErsDKEeDJAqG5fu~&p%VcK9TY@B zN@&tSKoJlKgc_QV(4-m4B!14frhHS@{Ft?7&5xV2@3}i?pX~kY=Q%eKHw>Z2xP-X? z0KhRg?5YU>z=5ILJ1j@&pL*PJyYxZmhQ8Ug!^1uULPluT@)d%`GmzXnp9;mpGm2o%YUP(`lig93~Wb0xo<8rk(RhoN@OA zw8#QshCcmA!(0ReA1{-hVqKWA4U8s0JhTNqW#lP*@OZV}ygSY7)6}?s&O0?EO*_Hr zmb*>8zjcBh2k@_pM%-BMyUEtbVpZ2EH%z?TuHo506&CpLl4w%zye+MNv;H=Xe zi0xc@$Jok4$i+jI>jYp9qV$_QY>zD%Cxt%3L~2ajW5KKWA%nF zB&Hb_f!6kMeHOxZq3Qh+DOC1|44posRIfU2>~KicNw9?$)(bjc%Y}^>sSE&Ts6JD< z7F`wA-vi2oGDGJ_Ji(Ik-(P@6?4rqmf5JSRPJoNlu%8*15O-@RxjbD0{)|xLY)XbL zEN1r}_XMxT`K}{GvVv^7|BxK3Sn~v5PZ6UMUl~1ejGNaCJZhA4kQmWbCY7;UY~Z*$ zRos);;Oxm26j7x;Rslb8Vuko5v!`H3wA0^_?+$3wUAx-(h)!g4;QLLln-`y!Xg|G- zX^d6V#dK3tg9p4WU=cY$C4wLnyPs5%EQ)S@X`@CG}Cc~y6~ zkNGIO0&y3KF=82FNMdC$36?p|N z+yJ#=10*qi2seZo(DQdAPyp&{*{&|@HaMHswt3;(?mq_2< zQ4dvE{VfYI@I3{-q?ghk8rE!CI79i1(JkA;@@TMN?>^g~K4#WjRrEH4v~PBm^eZxr zty>q9&{iGy@OIM+XJx*=IJG@%GwvA1a*4|VGHv;Oi=zI)^(KGsHL8Zv-mX=6p85*; z${##tw$+iNHmvZ4*cL?tVd8n{`X7-XCf-I8$XG_@ei=E8$BsuUJg-RL49rWP6(N4U zCpKOSXnOT|Js0*ud9@+EHj}eeJXkfYNb!g+1MRtRPPwrKQE*#JnhB<5ycGzJOLhAJ zTbF%$%r50y5$K=4(I=5&eg*eQ9KH~+^Xx3l#BGcktN*JDcBE5qkjpVFmjI)4uv|Li zrP;11g8G)!fOV-7(o`b98qi-|x+7VFiMP$d$5k??YcAbwc8BdWm8gGE9L4jmKpiEo z4fUAOF74XKMG#Z~Uww0oK8)`Q=`zt#;ZbXX3G8F74yA)h%|;p~&Onvge^7rNC=;OM zXb9*iAoUCk@H*wVh9wi=`7=6V%!7jhUnT+oUm5dal2%NwPto!E%j{5SDrsrYBXfiT7yUMv)l(P}ySna$q7qZt5okoZpo{9B)wXwBTyw_DZ zh`{|&15$|q(W8DnCh4}J%@QTIyZ-B>LT$?8^Moc>JDd~O`HzT-ABeI7YUTGHpa0D# z+RKit0FXEx8sBDZ5xhzvzP(HJ&=G$SZ zB!Oir7v$?PB+B9)L6!xsnm>a0NG;|ClU_Ucuo4LGwO}v5K7!}5=Sa?2v?hpc8!|CrTo zy;oSkiB%sgV(!l;sKb!uMivm09yAJ<)04xlmEvv3{VDfNy}}8whLe%91Nu9Z;#R^Z z8>PxaFy4C#Qk0*(tWRiFD;hJ++Slt{oXwas{W3e-r#(FntxQmyBEKYHMF&FM?*?F$994tgcE0c*@7xJebwUL?SB4bv2=vMcmvq-vZPhfJme}h? zDKt3ORH&Qz@qJc(mDq_(e&}`Qc9Y8SwPX?j8KXQ`09k*fKE=apsP!td-X&kxmA~N( ztX!{PR}U&SwYZ$)d_(fhma{uMe5{@FTAvH+i>aDGyKrG82lXCvo}g^M3}}7S+w4S7 zzh!wqkj#>qan%TTWFw6vd1vek9;+k6alB~X*+#hyB+sEIWuF+wL(4Z4@6EliPxaHZ z-ySELPB`c)@6r4ZqDV%CeBldT2mY4I15wkJ>=7E)d%8*YxTj?8!Mrurp=Md>G{IdkrQlRc>tMY|9Jvpaa=9V1_KnRBf0&D| zCtFclva;NVwnX5~#3(OLEIZcT6tkSIHIQ7@j)t$_!YB!`H&y>MNg($Yw=?I@x!xlUZ?L*~Xi*UnJ{QWf0u1;x37!=xhk#_O&1P zF)q4TceH(uQ{=(_lA|1^bQ)#>AE6?CWEzNZG=i2J|@%d_~fW~XZfp-eEwh>Qekwu%pd$Y zpRcVYu6iMs|Cl!&$yacL(k;fe+Tr)T91;^zQm~qy*nvWME^`Q8qc_&fDQ0F$dT3iS zaoj1|o+Q+Kx0YjE>A{5rAMLN2&GF==`|0;;k|m7kuFJVW{YqCROEV4Z(vl-n!XGAk z*vzWK($%5B`48Alq!{&q?^m(qK*7v*@_p$zbjv=~dnot1_wBpbvaX@{ zVjovzIjvLm{xr=ry<}{yI4Z<%R@Sj*V@e05n6&6MFA*dtQ3(wZwruATq2u|!wtxBP zvhR?C6s5H7{QNpc45`BD4WG7n^Rc3bLz3b_PWi~Joqe5=pWZ#n+vek$?GFwMpOErK zp>iw8i8HY8!vi%k!~ImPiWR$Uo=v|VD#WARbH4`i9%`^C0NyTN8sfy(6>X)XRtkbn z61EK~nTOvbd$(Mm%MI5T1|+JRn~$KGm#LAr2&FZA1Ixv966V0V-6$i3kq~EKHIN=E z7s@9bw8*ARkfl?4ShmRDoPt-jPj9WX)gRtF4BkoAvTQ-oNexeV%6edH%HTH>ir{mz zqTkApO_amXk17y>2JP#z`9}zZvjc7s92KbyPJBw+`-!=IP21l51brK31lF^INCriU z)I+{|#WUpL@6*3!r2uvGYT+P5N&Z0`-U4%m=rmG`VHH*&leZs!D-E*pQnn>SpBT{x z-5$d#h`&Xtki;B|toZ*DXr+B31U1c&u9%^^(Z0jcrN+a%+sEF~!i*tbx+db3f&)m0 z(TSxgA@2xM_+LdV7)hh2^Y1!!8RLciH)5u94)&7vZDR#4t-M%NQ9ocEFC+G0U~$)a zk}JU~zqF>n0k?-=GyWX5PW0>hq`F(p6<#>(sF9!?KtJ1jc0eOO29A87k&r%jDvm0n zaI1X9K55H=*$+c|yyv7?BMc$9Ah+@m67z45fi2z-2^AsHtIbcrhvm!K1kp+7TPs#yBs@dZlzne$)wY zMKdl60wnPu@#*<~M3;v$`Ktt?TN4}9O}*z8;p|H^_na>45{i2{9W7bxW` z%|l7w;*@4M-g=cci0f64(k2=D^v82?<=4yDxGqJ#u?T zF4$sJtd3fQx@UzUcNGn3VJYwP_7cle{R7H-_nyO%LWHl^o(n&XzCql-^!X(N!LcNP-<2UsUi7>MA@Mcz`f$^h^N2e=X9HWnDj}Ws_ znUy3XtO33EKqI>SaPQ+-DMZ*fN(Zh&KT?Ke%kEj>{?iuy_vg*CsxTBSWYed4NnFlW jgLV+~WS`#Vd#6iupa~Z+@3rawFaqG$46hbnz8m&W;`s2b literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_st_branch_mutation-members.html b/trunk/paradiseo-eo/doc/html/classeo_st_branch_mutation-members.html new file mode 100644 index 000000000..b55f79191 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_st_branch_mutation-members.html @@ -0,0 +1,34 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoStBranchMutation< FType, Node > Member List

This is the complete list of members for eoStBranchMutation< FType, Node >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
className() const eoStBranchMutation< FType, Node > [inline, virtual]
eoMonOp()eoMonOp< eoParseTree< FType, Node > > [inline]
eoOp(OpType _type)eoOp< eoParseTree< FType, Node > > [inline]
eoOp(const eoOp &_eop)eoOp< eoParseTree< FType, Node > > [inline]
eoStBranchMutation(eoInit< EoType > &_init, unsigned _max_length)eoStBranchMutation< FType, Node > [inline]
EoType typedef (defined in eoStBranchMutation< FType, Node >)eoStBranchMutation< FType, Node >
functor_category()eoUF< eoParseTree< FType, Node > &, bool > [inline, static]
general enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
getType() const eoOp< eoParseTree< FType, Node > > [inline]
initializer (defined in eoStBranchMutation< FType, Node >)eoStBranchMutation< FType, Node > [private]
max_length (defined in eoStBranchMutation< FType, Node >)eoStBranchMutation< FType, Node > [private]
operator()(EoType &_eo1)eoStBranchMutation< FType, Node > [inline]
eoMonOp< eoParseTree< FType, Node > >::operator()(eoParseTree< FType, Node > &)=0eoUF< eoParseTree< FType, Node > &, bool > [pure virtual]
quadratic enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
unary enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< eoParseTree< FType, Node > > [inline, virtual]
~eoStBranchMutation()eoStBranchMutation< FType, Node > [inline, virtual]
~eoUF()eoUF< eoParseTree< FType, Node > &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_st_branch_mutation.html b/trunk/paradiseo-eo/doc/html/classeo_st_branch_mutation.html new file mode 100644 index 000000000..1b0b18af8 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_st_branch_mutation.html @@ -0,0 +1,165 @@ + + +EO: eoStBranchMutation< FType, Node > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoStBranchMutation< FType, Node > Class Template Reference
+ +[StParseTree] +

eoStBranchMutation --> replace a strongly typed subtree with a randomly created strongly typed subtree +More... +

+#include <gp/eoStParseTreeOp.h> +

+

Inheritance diagram for eoStBranchMutation< FType, Node >: +

+ +eoMonOp< eoParseTree< FType, Node > > +eoOp< eoParseTree< FType, Node > > +eoUF< eoParseTree< FType, Node > &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef eoParseTree< FType,
+ Node > 		EoType

Public Member Functions

 eoStBranchMutation (eoInit< EoType > &_init, unsigned _max_length)
 Constructor.
+virtual std::string className () const
 the class name
+virtual ~eoStBranchMutation ()
 Dtor.
bool operator() (EoType &_eo1)
 Mutate an individual.

Private Attributes

+unsigned max_length
+eoInit< EoType > & initializer
+

Detailed Description

+

template<class FType, class Node>
+ class eoStBranchMutation< FType, Node >

+ +eoStBranchMutation --> replace a strongly typed subtree with a randomly created strongly typed subtree +

+ +

+Definition at line 130 of file eoStParseTreeOp.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class FType, class Node>
eoStBranchMutation< FType, Node >::eoStBranchMutation ( eoInit< EoType > &  _init,
unsigned  _max_length
)  [inline]
+
+ + + + + +
+   + + +

+Constructor. +

+

Parameters:
+ + + +
_init An instantiation of eoGpDepthInitializer
_max_length the maximum size of an individual
+
+ +

+Definition at line 140 of file eoStParseTreeOp.h.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class FType, class Node>
bool eoStBranchMutation< FType, Node >::operator() ( EoType &  _eo1  )  [inline]
+
+ + + + + +
+   + + +

+Mutate an individual. +

+

Parameters:
+ + +
_eo1 The individual that is to be changed
+
+ +

+Definition at line 154 of file eoStParseTreeOp.h. +

+References eoRng::random().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_st_branch_mutation.png b/trunk/paradiseo-eo/doc/html/classeo_st_branch_mutation.png new file mode 100644 index 0000000000000000000000000000000000000000..765b91eb8906649c81972c2e81c96f51a40c1f19 GIT binary patch literal 2330 zcmbVOdo0YD>!|h?*^2jhFA<9rq#v_!`NcefbC(js<>J()L9Wqmh5yz>S z8k5&}3?f76b&SV&%s9ql(j+7!in-&Qwa&WhtaaBt_x`az`@6r7{r&Fm{_M5(O&6z= z+Z8nwK_Jj})G0ex5J=WnD!0kWN-^zL{IGNayP)0eB@&5Llt|i2N_=vq(r=@!tu47- zGAUik#JW1UfsRdc13{pzRVcgT?ukXS#XXS|=6|y{l2j*}WMSZ-0dyOkfY& z0`L<+#N`Aa4~E1gbU&saVF@XW0E5VjT|6W9DF1MMiWkReQDwaoTli@q$)KqWJi>=u z5=DW7X(;)zq0Yz$nNKS_9J{eYF1ydh{jje_Pdq}|dm+VQ;*2(Xv z({3h?z4hH^!N80;s`@sC#Az*O)X;=F)l^;L&o}`6W~qf;l!K%QMNf1>lua7z!_(aLg>az?|_SZwfM%<^=ny4CFAd~2j~;G~$M8}epW1K;B%=1u!FM!#z3hnS>0;xD>|?N7 zBujgo!q&uPA{_HP`^HG)ViR#W<)^hkPB)h~kEenD{&@pN<;;q@XP zTZ+6kbxjYulXiG3Ax9g@RnDB3x4gKQ%ZMs#6{^x73uTeB--)w1lY z{i{z&9XV2Di+G70Z^5(jVg=B3Z(u$-I4!Bu=mk$aFqwRej<7^QQbnM6o zE`7`({eUTpLPJ_q(SRcbrtyGL_YO?dtw}?Dw8|WB_octq*g^^K?R$tq6`1*Ykkf#-9pO0RgClrR1M3#2mZ9#e|H$ZKCRCfURezr z&w!U62ZG;$HQ+b45Gnsz#2~F}B)@)wr`5PELGi&-?uG=TOJVR}rR^HXYwUN4;RXf9 zYWdU|4tbtSKA>N4(1TM68*jtVz8zrWWn9)mSK&}CutRN}+m!!Lshwpi}y!UH}uYdov*j^HsY-K`Y%12DP9{nuK7n{hf*@u&EduZfokJC~PttA~PB=qS?GY)Wd z9|KP#uM@f`dBh7(8Sl+$z!0~>xK1o8>#wv8Mkj{8B9n#8>^R?DuHYD1Xa!#l`YI{O zQ?AKR)SGc_(pWXw+SC?kUxcZ%Xza#WFqXJv2^e_C&KOhR>N**~$NhRiofm+WM?F+` z-|*_}xTm0LPnc1LSJ#Il4IWDLu2p7s!*<_MQ2-Fh5&js}$Xsy<9N@7mjX&+|P)Z*6 zUTFG0kgP3oXqXGUFTGQffvJyWI!l;C%Y%MK3D$*E?;<1 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_st_hoist_mutation-members.html b/trunk/paradiseo-eo/doc/html/classeo_st_hoist_mutation-members.html new file mode 100644 index 000000000..9439c3146 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_st_hoist_mutation-members.html @@ -0,0 +1,34 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoStHoistMutation< FType, Node > Member List

This is the complete list of members for eoStHoistMutation< FType, Node >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
className() const eoStHoistMutation< FType, Node > [inline, virtual]
eoMonOp()eoMonOp< eoParseTree< FType, Node > > [inline]
eoOp(OpType _type)eoOp< eoParseTree< FType, Node > > [inline]
eoOp(const eoOp &_eop)eoOp< eoParseTree< FType, Node > > [inline]
eoStHoistMutation(eoInit< EoType > &_init, unsigned _max_length)eoStHoistMutation< FType, Node > [inline]
EoType typedef (defined in eoStHoistMutation< FType, Node >)eoStHoistMutation< FType, Node >
functor_category()eoUF< eoParseTree< FType, Node > &, bool > [inline, static]
general enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
getType() const eoOp< eoParseTree< FType, Node > > [inline]
initializer (defined in eoStHoistMutation< FType, Node >)eoStHoistMutation< FType, Node > [private]
max_length (defined in eoStHoistMutation< FType, Node >)eoStHoistMutation< FType, Node > [private]
operator()(EoType &_eo1)eoStHoistMutation< FType, Node > [inline]
eoMonOp< eoParseTree< FType, Node > >::operator()(eoParseTree< FType, Node > &)=0eoUF< eoParseTree< FType, Node > &, bool > [pure virtual]
quadratic enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
unary enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< eoParseTree< FType, Node > > [inline, virtual]
~eoStHoistMutation()eoStHoistMutation< FType, Node > [inline, virtual]
~eoUF()eoUF< eoParseTree< FType, Node > &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_st_hoist_mutation.html b/trunk/paradiseo-eo/doc/html/classeo_st_hoist_mutation.html new file mode 100644 index 000000000..b02c788a6 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_st_hoist_mutation.html @@ -0,0 +1,165 @@ + + +EO: eoStHoistMutation< FType, Node > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoStHoistMutation< FType, Node > Class Template Reference
+ +[StParseTree] +

eoStHoistMutation --> replace the individual with one of its strongly typed subtree's +More... +

+#include <gp/eoStParseTreeOp.h> +

+

Inheritance diagram for eoStHoistMutation< FType, Node >: +

+ +eoMonOp< eoParseTree< FType, Node > > +eoOp< eoParseTree< FType, Node > > +eoUF< eoParseTree< FType, Node > &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef eoParseTree< FType,
+ Node > 		EoType

Public Member Functions

 eoStHoistMutation (eoInit< EoType > &_init, unsigned _max_length)
 Constructor.
+virtual std::string className () const
 the class name
+virtual ~eoStHoistMutation ()
 Dtor.
bool operator() (EoType &_eo1)
 Mutate an individual.

Private Attributes

+unsigned max_length
+eoInit< EoType > & initializer
+

Detailed Description

+

template<class FType, class Node>
+ class eoStHoistMutation< FType, Node >

+ +eoStHoistMutation --> replace the individual with one of its strongly typed subtree's +

+ +

+Definition at line 258 of file eoStParseTreeOp.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class FType, class Node>
eoStHoistMutation< FType, Node >::eoStHoistMutation ( eoInit< EoType > &  _init,
unsigned  _max_length
)  [inline]
+
+ + + + + +
+   + + +

+Constructor. +

+

Parameters:
+ + + +
_init An instantiation of eoStDepthInit
_max_length the maximum size of an individual
+
+ +

+Definition at line 268 of file eoStParseTreeOp.h.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class FType, class Node>
bool eoStHoistMutation< FType, Node >::operator() ( EoType &  _eo1  )  [inline]
+
+ + + + + +
+   + + +

+Mutate an individual. +

+

Parameters:
+ + +
_eo1 The individual that is to be changed
+
+ +

+Definition at line 282 of file eoStParseTreeOp.h. +

+References eoRng::random().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_st_hoist_mutation.png b/trunk/paradiseo-eo/doc/html/classeo_st_hoist_mutation.png new file mode 100644 index 0000000000000000000000000000000000000000..6358218460c7178c2a003f0c1ab28068ff387ed4 GIT binary patch literal 2321 zcmbVOc~Fx{9u0`HzyJywLl9YN1_e3flYmG#gb2bC4rPP@k)Yp*2nYmCxIqL&F)unsCW69C78wK)?`mAY2iGNRY&EWaIubTf0?THS6C)EsBBVTMjnx;=wN>6AKm0~xq`~&EmUgQ&kFYM*3#0F z(kh=+43#b(_wk1uo*oH@K>kMaJmT_W;yqDGPkg1_R(J2QCso_@xmNqFY{ag?XZkwn z&iTPQty@%$O+>LDk&+^CdnPii%CI4SMZ~@0EPt?Aqg`WdvP{k%+vqmA%0Q|k+(85v z3V#T|qq-XO?~?TL+Kg&KFC_JOfn6AWGo|4qDapZ>l7{8@h;=qzr`%omJcl8=0W8N| z@pFrO$=z3o0Q=yT26M^L0)amjU-Qn-l%;f_MXQb)ddR-7Z0MG`jSQS1+|3 zVa)j`l%JG z7?_!DDJCh=_Yn}MCJsE;R3qN|Az^ERWfF;8DJVOrZ;h`&ER_jgk{M<5Y2+Sp6gW<- z4^v%=K(mLJIx%oi;&5tAFpGUaJ?7)#A5^b*eQz6g1k;_Hgt~0Q?j)FN)d&YhI_5^6 zM@0v{VD;ig3FdG!E+abm#f>Cz%D!m0L1b_HbWX3|K45;w+3!zdug~u|V_@ADCkn;u z394#6dIcOurYt3)Ah32dT>oq;J)WNUVbp9(30|H+p}$^P$@BdCVCZLwU819{6BFAa zLG#{HeX3fzdm(Yg9H1ZR>5HP!^i`ekO&ex z9}wXpk(wE+)kcOqr9mZVj7H0GhytCei7F>9<%}vn+pfS%ls;e4)<}p(&E_yu1*(O4 z9m3RFK)jUx0!pRru1K65S4D)B>r@&*9=AuT9^S{`DgFG9KVS08Suy07r~-WG+Qaq0 z>a$-p04yA(af{vG`YZ4#E%?bh zPUfP89<+bq_q zOKsD)o)x=Ik^6;lG--#!1~y*TD}uH;eUURLQ&ZVnXaMUP$i52Coh^74H6L`F3%fhh z2-wm*1e}A@?z|a7sfVz*B5C~{OIX~ej@%7iIAq4s1TxzDMsG0ee6x3~B^h`LO`z9O zJHu}(gfBeGJIdGXiG-_j$t$IE7~To*aouaBD|s6Wh#88Bx^QIdY7go?)>CJuOOnS4 zALg1LDNtz=hT;ou7pxP5aIm3Q%A;?kjuf#`X_pF%VM^V|s(fh^ux+AluK|lOo{K{C zb4QGgie~lwb3dtYF#d|tn;x}As+RSt1~6gI z;zA%r$_iY(cH*v~IUjoISBN=(&wpzvLt158l?Iob0+5&N6%myEc>(eMS4DW6Hfk18 z@cuFY5%HZS9F@iXKeWmyiVJO zb7;F=p!g+UgYn*I(7Z_pZ-EOv`jI(bwr%ms{#o5|clzV8A?^uyqYD}R~Vlq;S( z-s5CldlAG31uFlsqoBH&?k}ifJZX?uc8qW9rbmKB0u@GossZPt*Q%odvuIYkf!^rzp zue$V-i_RKkwX>w0H~nVy9RL*GnlXGw3k=!0{mRWic){-Yy2QqQ*z}P9fe7>?t7+@e zRf$Lb12QAT7J9|6mNj>WG^P$lHCqNdf?4crYc_w{Nb5>Gi7;WIN$=ghr#o4+06jWu zA##z$<=+cG-KT3Gfwnuyj>#V<1BW`1_r> + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoStParseTreeDepthInit< FType, Node > Member List

This is the complete list of members for eoStParseTreeDepthInit< FType, Node >, including all inherited members.

+ + + + + + + + + + + + + +
className() const eoStParseTreeDepthInit< FType, Node > [inline, virtual]
eoStParseTreeDepthInit(unsigned _max_depth, const std::vector< Node > &_node, const int &_return_type, bool _grow=true)eoStParseTreeDepthInit< FType, Node > [inline]
EoType typedef (defined in eoStParseTreeDepthInit< FType, Node >)eoStParseTreeDepthInit< FType, Node >
functor_category()eoUF< eoParseTree< FType, Node > &, void > [inline, static]
generate(std::list< Node > &sequence, int the_max, int request_type) (defined in eoStParseTreeDepthInit< FType, Node >)eoStParseTreeDepthInit< FType, Node > [inline, private]
grow (defined in eoStParseTreeDepthInit< FType, Node >)eoStParseTreeDepthInit< FType, Node > [private]
max_depth (defined in eoStParseTreeDepthInit< FType, Node >)eoStParseTreeDepthInit< FType, Node > [private]
node (defined in eoStParseTreeDepthInit< FType, Node >)eoStParseTreeDepthInit< FType, Node > [private]
operator()(EoType &_tree)eoStParseTreeDepthInit< FType, Node > [inline]
eoInit< eoParseTree< FType, Node > >::operator()(eoParseTree< FType, Node > &)=0eoUF< eoParseTree< FType, Node > &, void > [pure virtual]
return_type (defined in eoStParseTreeDepthInit< FType, Node >)eoStParseTreeDepthInit< FType, Node > [private]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< eoParseTree< FType, Node > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_st_parse_tree_depth_init.html b/trunk/paradiseo-eo/doc/html/classeo_st_parse_tree_depth_init.html new file mode 100644 index 000000000..f98166813 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_st_parse_tree_depth_init.html @@ -0,0 +1,181 @@ + + +EO: eoStParseTreeDepthInit< FType, Node > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoStParseTreeDepthInit< FType, Node > Class Template Reference
+ +[StParseTree] +

eoStParseTreeDepthInit : the initializer class for strongly typed tree-based genetic programming +More... +

+#include <gp/eoStParseTreeDepthInit.h> +

+

Inheritance diagram for eoStParseTreeDepthInit< FType, Node >: +

+ +eoInit< eoParseTree< FType, Node > > +eoUF< eoParseTree< FType, Node > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef eoParseTree< FType,
+ Node > 		EoType

Public Member Functions

 eoStParseTreeDepthInit (unsigned _max_depth, const std::vector< Node > &_node, const int &_return_type, bool _grow=true)
 Constructor.
+virtual std::string className () const
 My class name.
void operator() (EoType &_tree)
 initialize a tree

Private Member Functions

+bool generate (std::list< Node > &sequence, int the_max, int request_type)

Private Attributes

+unsigned max_depth
+map< int, map< int, std::vector<
+ Node > > > 		node
+int return_type
+bool grow
+

Detailed Description

+

template<class FType, class Node>
+ class eoStParseTreeDepthInit< FType, Node >

+ +eoStParseTreeDepthInit : the initializer class for strongly typed tree-based genetic programming +

+ +

+Definition at line 61 of file eoStParseTreeDepthInit.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+template<class FType, class Node>
eoStParseTreeDepthInit< FType, Node >::eoStParseTreeDepthInit ( unsigned  _max_depth,
const std::vector< Node > &  _node,
const int &  _return_type,
bool  _grow = true
)  [inline]
+
+ + + + + +
+   + + +

+Constructor. +

+_max_depth The maximum depth of a tree

Parameters:
+ + + +
_initializor A std::vector containing the possible nodes
_grow False results in a full tree, True result is a randomly grown tree
+
+ +

+Definition at line 73 of file eoStParseTreeDepthInit.h.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class FType, class Node>
void eoStParseTreeDepthInit< FType, Node >::operator() ( EoType &  _tree  )  [inline]
+
+ + + + + +
+   + + +

+initialize a tree +

+

Parameters:
+ + +
_tree : the tree to be initialized
+
+ +

+Definition at line 125 of file eoStParseTreeDepthInit.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_st_parse_tree_depth_init.png b/trunk/paradiseo-eo/doc/html/classeo_st_parse_tree_depth_init.png new file mode 100644 index 0000000000000000000000000000000000000000..adb49bb2e78eba2d2bc3d8f35a6786c27ab53165 GIT binary patch literal 2083 zcmZ`)dtB028>gJvET)^6xo}#omgOZi(xsLwqtX=bI4sjZf0}|;BF_7prmVEv(nRoX zs2Qn=poLCK%^P^h!~hk`YYM29ctK^nect6h?`Qktob#OLcAoP*-}9VnF7T6J)orRE z5D094>bM&Sw6RJ-v%XML%&I$cToj9ri=zijE|)7vxtx`k=XYB{eHttlE9SX;RI%NF zbA!8seja}ffIuow?2jMy_%&Oc-SIowN)zTp*@ter`ZzXWm|Jgq-?i(zrG=uFJL+nJ zot&FH>%6|PY^_pH9Z7P-=LzJTi{Yg}?P_G$)r30UT+e0=PGUY%6PlU`xMl;~p{=yT zIo^cul!k@_539tN_%nqs`qs*xO;tKsbBg4KXQCGRLWkZ!X{VE{=u_B!;V6Zd+_5L_ zMN9jlbfcq;Gj)xZbDC%sE2J_W2mjEUMZe{(Rt^J~N9klEh0hiawTb-YX;Ob|kW;Vb z@zP77Iq8E4>62gYxlfANPdS&WyK2EQ2U)ZhUK_wpTp$TfE};6uKH6FUC8qC3trZcz zt6nSQ9VKW_crOvb%w<6j)AXUbiLg(ETd!R)fhT@VF*nr)dZevIh z59-}r;9)LnWy3Gn>V;{J7}DM-PifK+=k#c&X*(dblYOby1ABpt-#I0~?&9=O)rwBT z@9W3?xL=J(&U9e5&uoaAzGafsy68Z;7;&=oB}{vCDw|l}U@;v&JG*Ml<5Qca7oTIU z^Kf6j&=I3uexg90wsYX_(an4jx>Kn)77f{8MxH<#lN;MbyeNd2g&}^(H z?%8y~cO;i!)IZFbcfpZ`%A-6CHeY3bH)FEWVm1n47$@Nm7wm$ht?6kw8`FYkvX5E(7LwE=;j`xNz~4lRD!?8NOf?pN_|}~NVWzwxamKtN&Qit5CSC^k`0u5M z2Mc%9e>>z`%enei{Sg_KEUHln9TNF&;S~M_9mg7eUPNXuzvQj@R^S)SV(Ay{X7oK5 zx4Oq{Y+hL@JDg+(g$||^PXz@%_4O^5YToSb#z9DBMU;0WzQ#`}4-Q|s>?rw0hZ0dzyt$0j3m zlVsF_CEXR%3#Y-gsEFjfi0=tbgb>nT$N;f+rW!+WOkq|?weTM+p%2HapjJ2X zkL}GTZYmu6W&8wTM4W#1Njj1;`U+iiorDgk*m0b^C@ni?P;wrZ#;Mk4x3j`mSwY+y zQ7KkPb&Fz`c^0`(z|ZZA0lNuXB)_F;(i&rpR{~A}BXO?E1yN61O`1<&WdIrkyVLPP z=ka@L6E&>o1E-@zh%-h2%~{to{klZE(b9-qEgCY{iRX7GFo$Q;RUBK#rrF&Ks>lrt z_-=dHasYZW%1dnM3mI78ZaNneq}D&u#@~Kjy6`-t0^Er@C;P+L+Y1qM0|@lF@L-wr z{PGp3^|V#Rb9xfs`Z@F3uy7zG;kA!r2(V+8toz^kB=FRgIf;u)eekv_Mm|!fE~(%z zq^+C%Qx*TQw4azfNJCaylCb#X-w?1Hu**p6+i##099chJ1@t#8$Hj}wEzfpfjGE0} z6FeN0JekvX+2b$N|x{2SXY2i*Q)B~;xB)4DYDls9h}!C4Hnel`?mz)I}XvA>j+bHUuYmhN*HXe z2DCRev|Uj!D$6ugNy^X4+!PtvG~@R#xc&DV|F5fmP8j#)1H@#=L#tC>ibwgGtKF>3 z!Altff`d(EW?`+8fgJa4it#(a%)o%m|KTaVGDq6!T62gV-?tn5y2Q1Jx2p7@>!5%a z9yvF~s6#S)BWk**?8@_)i-9o#`eM5Y##4Ae%dFBzpMD`KT-b5DUOsozFe~Cm452e> zI`mS>7Kp^rQ}nWf*1k&AkIkeYh1+(`&o%q#bn8#{VfckCsx`WeHiTXL`YkSip>||K zML&0qK8TeV0Zb9>*_vUDmw8B-)i;hu0G}j*=TXmAP`mX4kijQESS)^WFhdAlL8CjzQ + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoStPointMutation< FType, Node > Member List

This is the complete list of members for eoStPointMutation< FType, Node >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
className() const eoStPointMutation< FType, Node > [inline, virtual]
eoMonOp()eoMonOp< eoParseTree< FType, Node > > [inline]
eoOp(OpType _type)eoOp< eoParseTree< FType, Node > > [inline]
eoOp(const eoOp &_eop)eoOp< eoParseTree< FType, Node > > [inline]
eoStPointMutation(std::vector< Node > &_node)eoStPointMutation< FType, Node > [inline]
EoType typedef (defined in eoStPointMutation< FType, Node >)eoStPointMutation< FType, Node >
functor_category()eoUF< eoParseTree< FType, Node > &, bool > [inline, static]
general enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
getType() const eoOp< eoParseTree< FType, Node > > [inline]
node (defined in eoStPointMutation< FType, Node >)eoStPointMutation< FType, Node > [private]
operator()(EoType &_eo1)eoStPointMutation< FType, Node > [inline]
eoMonOp< eoParseTree< FType, Node > >::operator()(eoParseTree< FType, Node > &)=0eoUF< eoParseTree< FType, Node > &, bool > [pure virtual]
quadratic enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
unary enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< eoParseTree< FType, Node > > [inline, virtual]
~eoStPointMutation()eoStPointMutation< FType, Node > [inline, virtual]
~eoUF()eoUF< eoParseTree< FType, Node > &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_st_point_mutation.html b/trunk/paradiseo-eo/doc/html/classeo_st_point_mutation.html new file mode 100644 index 000000000..9abb9335c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_st_point_mutation.html @@ -0,0 +1,153 @@ + + +EO: eoStPointMutation< FType, Node > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoStPointMutation< FType, Node > Class Template Reference
+ +[StParseTree] +

eoStPointMutation --> replace a Node with a Node of the same arity and type +More... +

+#include <gp/eoStParseTreeOp.h> +

+

Inheritance diagram for eoStPointMutation< FType, Node >: +

+ +eoMonOp< eoParseTree< FType, Node > > +eoOp< eoParseTree< FType, Node > > +eoUF< eoParseTree< FType, Node > &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef eoParseTree< FType,
+ Node > 		EoType

Public Member Functions

 eoStPointMutation (std::vector< Node > &_node)
 Constructor.
+virtual std::string className () const
 the class name
+virtual ~eoStPointMutation ()
 Dtor.
bool operator() (EoType &_eo1)
 Mutate an individual.

Private Attributes

+map< int, map< int, std::vector<
+ Node > > > 		node
+

Detailed Description

+

template<class FType, class Node>
+ class eoStPointMutation< FType, Node >

+ +eoStPointMutation --> replace a Node with a Node of the same arity and type +

+ +

+Definition at line 195 of file eoStParseTreeOp.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class FType, class Node>
eoStPointMutation< FType, Node >::eoStPointMutation ( std::vector< Node > &  _node  )  [inline]
+
+ + + + + +
+   + + +

+Constructor. +

+

Parameters:
+ + +
_initializor The std::vector of Nodes given to the eoGpDepthInitializer
+
+ +

+Definition at line 205 of file eoStParseTreeOp.h.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class FType, class Node>
bool eoStPointMutation< FType, Node >::operator() ( EoType &  _eo1  )  [inline]
+
+ + + + + +
+   + + +

+Mutate an individual. +

+

Parameters:
+ + +
_eo1 The individual that is to be changed
+
+ +

+Definition at line 234 of file eoStParseTreeOp.h. +

+References eoRng::random().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_st_point_mutation.png b/trunk/paradiseo-eo/doc/html/classeo_st_point_mutation.png new file mode 100644 index 0000000000000000000000000000000000000000..0c9fd91c35c949f1db34711152a3fccb4f776301 GIT binary patch literal 2315 zcmbVOX;72N7LB4XqM!~gF#*I;5F|>v;YFF9}6pdiPnBwDY0f}X`YSgx(D$?4i!1B>OEDretDLqkJk z)7r3nxh}+xU=KMlD!dGVe3xf^>ZC(huH;^0P|2}vmbP`prQ6{GBo=v8igWdT^SU0J z=K6h;qLQ|*#5D9xeh^83Fy+~#SU@36hWq&KNtS%!^fhPk=u#o?s03{wit6tTxrOCD(NAJaCQ{uJ z#N5H*0(MvDlR@ulY_>XUnNjom#HR`h0(%t9*PG^o{laWK5>p)&Gkv(c(U{nnHK

<)wD7v5%!H*;sSrj=LbL5AK)BKz2_B|!-@&OK$?1Ece1SzAoB%TDu2 z<62&iMP;Ov=3O+r``|C1L9B@@nP#tLt>N_mk(A~G+kDFwBh_m);Vjo9o^%Oq z>chksuZXPx*n~a&pi3R}ZqwnKNb}CYOp)`Br|X-88WVjOlN=6pU9nTL( z#6;0=@?GoeK1QgQXRt-=3E7pQV3tq)A85n*kY{5!^}-^xx=eOe>PKWjk+Uw`H{K;F z@kOMa-Z_uwSCbO__^1}quXLzg_43rv0VObr9A5`gaBbj4k6_ZA6Hi!J_+)K+X+d^f zFhVis^<4ayp?xBk7uHti_*YvTqYBJ}YX$hnBO1`YQ%1(Bfpv#e`O8{Cg$qWzxbO!p zx7}q*OWO7(UHfKCV+^$RW=;_MFZN}8G93!@G-rDGVXF$0L>BC zp)f^fhWN&#r+dY7Cbzp#w$kMqDj&t#NizdSXNrZGSF)X0e^c;7=nrl0-$+S6S)r_l zahUX1=-+d!f3Ve&h}k7Lck$DOTwYhPukzrT*-EF`9DZ(nzV1JOtNSop!vnRga}7N7 z2|12#Pq*2AzgS3Vw!KW4@AIa6IY^cLY=#!h+7rT#s0qQsYl~aky96Z5o8tQ+LNI=> zYUc?zATySf?~m8us^J0KJQVC9`&kE+sa=UZK+}8`;8oGP?yXmqLI=-R>1;x`>WO<> zOMOxQ_Up6vY9$yfiE|iYvyQ~E{cG&r5{(lYa{tjwX^>F48E4slN%r>v5(}x^#@AN- zMVaUaCjoK?6o!shWaj;6O2Vy@*BamXtO^L-Ia5|&9=j58!1_N=fE0iooA*S*66}xAB@W+rD%AG`S z*U*wr{H%au;OKt9^{c-4p_ubWM_C~eXd0`^mnFkre^nn{dxK+tOFDI0o%<-472|&?y+$q0<&If!3{Y zbB&o5Y5j;O2ikQXqD1{rHERRroGE}92sv+Ne(%cBT`}*Wro?8)z#gGV5tTt5MfsQJ z@~&uz*^~Bcr`g9m{73(M+-vFUL^uge+i}S*SkmEG&KRpNSNg5n+9*};NzLaT6 z&^oes_7Q9wQIiSA4k85}Gf1?~)IHCCwenk67e76Bk|{M + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoStSubtreeXOver< FType, Node > Member List

This is the complete list of members for eoStSubtreeXOver< FType, Node >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
className() const eoStSubtreeXOver< FType, Node > [inline, virtual]
eoOp(OpType _type)eoOp< eoParseTree< FType, Node > > [inline]
eoOp(const eoOp &_eop)eoOp< eoParseTree< FType, Node > > [inline]
eoQuadOp()eoQuadOp< eoParseTree< FType, Node > > [inline]
eoStSubtreeXOver(unsigned _max_length)eoStSubtreeXOver< FType, Node > [inline]
EoType typedef (defined in eoStSubtreeXOver< FType, Node >)eoStSubtreeXOver< FType, Node >
functor_category()eoBF< eoParseTree< FType, Node > &, eoParseTree< FType, Node > &, bool > [inline, static]
general enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
getType() const eoOp< eoParseTree< FType, Node > > [inline]
max_length (defined in eoStSubtreeXOver< FType, Node >)eoStSubtreeXOver< FType, Node > [private]
operator()(EoType &_eo1, EoType &_eo2)eoStSubtreeXOver< FType, Node > [inline]
eoQuadOp< eoParseTree< FType, Node > >::operator()(eoParseTree< FType, Node > &, eoParseTree< FType, Node > &)=0eoBF< eoParseTree< FType, Node > &, eoParseTree< FType, Node > &, bool > [pure virtual]
quadratic enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
unary enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
~eoBF()eoBF< eoParseTree< FType, Node > &, eoParseTree< FType, Node > &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< eoParseTree< FType, Node > > [inline, virtual]
~eoStSubtreeXOver()eoStSubtreeXOver< FType, Node > [inline, virtual]

Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_st_subtree_x_over.html b/trunk/paradiseo-eo/doc/html/classeo_st_subtree_x_over.html new file mode 100644 index 000000000..fb63b30e4 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_st_subtree_x_over.html @@ -0,0 +1,109 @@ + + +EO: eoStSubtreeXOver< FType, Node > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoStSubtreeXOver< FType, Node > Class Template Reference
+ +[StParseTree] +

eoStSubtreeXOver --> subtree xover for strongly typed tree-based genetic programming +More... +

+#include <gp/eoStParseTreeOp.h> +

+

Inheritance diagram for eoStSubtreeXOver< FType, Node >: +

+ +eoQuadOp< eoParseTree< FType, Node > > +eoOp< eoParseTree< FType, Node > > +eoBF< eoParseTree< FType, Node > &, eoParseTree< FType, Node > &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef eoParseTree< FType,
+ Node > 		EoType

Public Member Functions

 eoStSubtreeXOver (unsigned _max_length)
 Constructor.
+virtual std::string className () const
 the ckassname
+virtual ~eoStSubtreeXOver ()
 Dtor.
+bool operator() (EoType &_eo1, EoType &_eo2)
 Perform crossover on two individuals param _eo1 The first parent individual param _eo2 The second parent individual.

Private Attributes

+unsigned max_length
+

Detailed Description

+

template<class FType, class Node>
+ class eoStSubtreeXOver< FType, Node >

+ +eoStSubtreeXOver --> subtree xover for strongly typed tree-based genetic programming +

+ +

+Definition at line 56 of file eoStParseTreeOp.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class FType, class Node>
eoStSubtreeXOver< FType, Node >::eoStSubtreeXOver ( unsigned  _max_length  )  [inline]
+
+ + + + + +
+   + + +

+Constructor. +

+

Parameters:
+ + +
_max_length the maximum size of an individual
+
+ +

+Definition at line 64 of file eoStParseTreeOp.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_st_subtree_x_over.png b/trunk/paradiseo-eo/doc/html/classeo_st_subtree_x_over.png new file mode 100644 index 0000000000000000000000000000000000000000..aa1d8fbee9721931ee739d62e3da801146642b4e GIT binary patch literal 3208 zcmbVPXH*l&7LFjxTIfYZKtK@)1fC_*iAq8UNC^p{gHla`ur7uwpt3+nSgI811TZ0# z2!a^8Vr&R1B#VHED};ogpbG({zN~xRd1uetA8+@^eDmG;F>~*n`^~+R=IjWU+O4u1 z002lKY@sdyfP}M%_wE!Ip{%rPxoFz&d=3rU-rg3`?d{(3^7C0D_HFd`_QpNjo)(!q zuDCd&0H@B6HCF;AjKy$;$D5%deZ$Qb{lU;~NI*hd5;Q0X4Bx+5vXjrnqqF4*Z4n`Pz z2_}Ln%gEz3Y}UiVyZI#xs!F*uY=pgUb#;D1zC$EQ;#u3zWrkd@F>379HU-y=Cfn9% z=dgD+FS)~Q6wJtJs(1CJw@Y0#ml2RG_)KJ@FN}aa@!7$)rhTrw+>1}M`h2K>W{O!b}e>-o12H(NZ8aKh%2V)5f2yp@HRG|w>u9qzILP|zTkSK9Mt zki;Xa_|zZA=>VlR4W%|e`OoQngiVyVNBW@$qY=^#{ENHayYC;;8&irpLg1#iE4I$w z^wK|E*G#jW-Ty(h4OcZqqJ7cD?$S=pNq;Uj_j)M1Xhfm7eHLH24_vxc1M?YyknP%j zCBZnp=t1xCawsP~7KPL#f`2z4O5>Rij_O+nR>Kro9$93ixU+Qp$ z0HpB^Xzr>?y;lS{L8^#grBREU=K*VTdMmzsV z>yH;-ThFI#1!uHhY75Swe_PID0%vGaL7X15E%4yV4Ol-f{KeV#v#trjxbv< zkFMKlVP-|fa1zZug}E&6ZtkP#I|8@xItkM@x~Fhb+HG@5J~zrR%xu>vW34on?7FS{ zb~8{=!ROsv@m}cETc29wVf(0(_eaEtxSTjjSn46b=1uMO#nEht(%1Q6X^6E+SpOGI z!+UqdD9ZC`v5bR>KQ$%}27JY{PRMeOtUBpgil)C%P=GDFF41~aQ87DY+ol<7cyCyB z!Ogf=l}JRq0$GaCD#33;46mVe^i125hL&>7_UiriU5`&g&)o={Jp&EBQDZHmY4qdu#xRO+X%cX&4OD@&kjJ|wMXc)evEUdqyg!CcgK%kFyW-5V&5|UcUoJHL} zZN06f^Tf862buk-=tp&0^VQym9fh<2p{8MuMi1Pm5F&Bcph8{;gLEH-7oYrMFo1_R^GyP#KO-K&ZoJ*p zxwV!?vw#bS*mP&ZfB}j?;;GQQ0Oq5QwC3*We<3*!jgNkF_9DX`YI$5(t^~HJSI&dk zRsM3`L?u`?N*!iwsof}1y|{YR*6Hb*M)jLh{v`o|-y{E$_jTT7ij`GKIo4`?&jM6g z{q<^JFjxOG7QhIaww6?yZMhQ@54u88FI;;`5`g7e4iEPQgU5EtW(&*HCa!TO$~b4dKT(`OVOc%;B6? z-JhM;T@%Na6ni?a`ef!a*lNv3e832wZb6izTHWp#zKq4v96iy}TSzr?L3}jx7Mg=U z)!&g2E+@Nff+dY!8KK@;Sge!|=ii0g0xmEUl#6>h1>rw^!gq-yA&HIKUyu|0*D8mRA(;!Rx&ZW^E}@uCrO>?d5xBGohCuV?f)+= zd_q$37Jh1-t(%`fs*Nlx;8>KT58+pxmi%@gr54?h@eR(j?xzV2Okt{oHEyY3yA&4&p12GGk3O3!SSfNv5Tk!r3473+~!^KC5l5 zJSWphvMYORN`HBvRUUk4ZNsI4glBFZljZzNMxMjHscW5hn2y(PXnAgj2l;wr-+VoA zzppGmT|gcSBq(#9U3s5<`z*T80$9~(MqdX?Egx{z$66`jwX0kZx^uck?ZK@h81$_H zt*Y+bGHPr6EjcDxi3+qt!y9o2r+PG0PwITa*w^d3z3brxd!-0eCo;J`tCn8C zIf1E%VrX$0#moH*diGc7_M$uBrKxnpm*r$OqsnmooToEE+Vc_0jk~q0Rk^RLAHCwd3`i! zm`S7)cx^Ul9oI=HIu@v=nP1|s4+XzSqjV!NrNONc3H`-pbM?=k4V%DABWxO=Tm-an zGcu!A7Ni;hJd2WBqE z9ODGCjq{^`l;5%-c?9;xW7gu$OcPhQW){*feKBRrj*Xb1#qf>l652zq*O>yf$71;- zv!EFo<9SS7LhK=eV|cz}gs4LaY!(b%7 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_stat-members.html b/trunk/paradiseo-eo/doc/html/classeo_stat-members.html new file mode 100644 index 000000000..a0dc8bd64 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_stat-members.html @@ -0,0 +1,38 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoStat< EOT, T > Member List

This is the complete list of members for eoStat< EOT, T >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + +
className(void) const (defined in eoStat< EOT, T >)eoStat< EOT, T > [inline, virtual]
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoStat(T _value, std::string _description) (defined in eoStat< EOT, T >)eoStat< EOT, T > [inline]
eoValueParam(void)eoValueParam< T > [inline]
eoValueParam(T_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< T > [inline]
functor_category()eoUF< const eoPop< EOT > &, void > [inline, static]
getValue(void) const eoValueParam< T > [inline, virtual]
lastCall(const eoPop< EOT > &) (defined in eoStatBase< EOT >)eoStatBase< EOT > [inline, virtual]
longName() const eoParam [inline]
operator()(const eoPop< EOT > &)=0eoUF< const eoPop< EOT > &, void > [pure virtual]
repValue (defined in eoValueParam< T >)eoValueParam< T > [protected]
required() const eoParam [inline]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< T > [inline, virtual]
shortName() const eoParam [inline]
value()eoValueParam< T > [inline]
value() const eoValueParam< T > [inline]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_stat.html b/trunk/paradiseo-eo/doc/html/classeo_stat.html new file mode 100644 index 000000000..ee490ddca --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_stat.html @@ -0,0 +1,47 @@ + + +EO: eoStat< EOT, T > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoStat< EOT, T > Class Template Reference

The actual class that will be used as base for all statistics that need to be calculated over the (unsorted) population It is an eoStatBase AND an eoValueParam so it can be used in Monitors. +More... +

+#include <eoStat.h> +

+

Inheritance diagram for eoStat< EOT, T >: +

+ +eoValueParam< T > +eoStatBase< EOT > +eoParam +eoUF< const eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + +

Public Member Functions

+ eoStat (T _value, std::string _description)
+virtual std::string className (void) const
+

Detailed Description

+

template<class EOT, class T>
+ class eoStat< EOT, T >

+ +The actual class that will be used as base for all statistics that need to be calculated over the (unsorted) population It is an eoStatBase AND an eoValueParam so it can be used in Monitors. +

+ +

+Definition at line 58 of file eoStat.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_stat.png b/trunk/paradiseo-eo/doc/html/classeo_stat.png new file mode 100644 index 0000000000000000000000000000000000000000..9e97ea3ecaea0591a7a50cf4c3510f3b117ad737 GIT binary patch literal 2309 zcmd5;eK^x=AD>6sk};vYG)_vG=qRF*$}lf^c@{Zj6rGjS=G}VCbl4_IlF$>`@hnL- zPI4HALqJ0_kDl9-|PFmuj{_PpZosa znSMT4xT?M?1OkD3xVzvWkiQ8PymghbVzzQvcS*76`W^6hU0z;R(B)3@Z5$ zRh~uF?A@}fU^>B>+2wso@4at_=i!prc`;izb*b=S%PxL*=Sx=cRNY?Iwniy;n?E^X z1;=1U7bfoC!Rxb4DetNue_k3h^GYnTE>aeq&X6ZE1$3JRZo0=c=}f;>cH%;Wk;n_= za3;pCj^xT`dqp1G09yq8)Vo?KgOnoXk_ zjVqR zWZ59(WGBENI5&X z2Fd~qR&dbYem+jqfGY3U;`!mCdh4bg{+nESypP>-rmRCNrFZ(#5xebjOCL#><}xq- zf>rp>6&H2-l_BQlx2%MIb$ts|-4shS#^^Y|7Pv4_v`$W@S^z9JPD}4L!dSF*C83MN zQc0`*xbwUCvv>Btg#@PeDpjs7RStnWL+kZv>e03^5QuBjOul}&(XYj#6wH6mPJ~%UPLXJq8kYB_Q46~<3KM1m#Qbvr4)KbUlJhC(&yIX7$ejT39zkLpZ^p_*(iX_o4l8rBlVK9gbp)1M(b}l0pi~pAc~;x=U1)n%49G^bOS9eGg@P^0Xc+GA2M`8 zcwUmScyLp6fAM;!_GYs3Fg7N#A^u+-s}7LgKaOA(^+L=iwd~c1@e?qdP+_ZRd^Y6zPOm&qq5ac*?SV60SIauUh8vC%8|#4%Ge-;a3UdO= zCOc48&#!5`(N17Ys4R)tQmaD`t#9KKfG%2H6_^Zi^-IJ!sykeRd*zqSR|hzH_nm$k z8N(K??zBuYue_O18xt<#YOCM*^1dzK#d|7GUnl&xJ+1U9YD@IADWbL$Zld-FrSLJw zI?%bL|9OsnXXK~-X&Rcl0xM-N!bYDeRWejb7yd7#UMk9c2n}{WO?(S6SUJWQB6|?| zDG}hzof{A-Iq2HyAGh0xDn4GzU2h2OLzXnZ3hSv3B@#lLhzU;$yE2;er+7;XexOi# zxA4WxX{U)@Suq>Nnd4$VnK&{PMZqA50Yd>!sc}()=g~y^-qRs;QgpcdAGKANNJd*n z;D>P~wv~Wg{f{Z1wqL6|MQ`~4B+yB_gK#^*3dT;ZHXC&Ck>CUc$<0#DB=Z=flHy4# ydO6RbJ5X|v&K%Q;T#@$*X$kwOQrLXwBG<1y)j7u literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_stat_base-members.html b/trunk/paradiseo-eo/doc/html/classeo_stat_base-members.html new file mode 100644 index 000000000..698a9945b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_stat_base-members.html @@ -0,0 +1,20 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoStatBase< EOT > Member List

This is the complete list of members for eoStatBase< EOT >, including all inherited members.

+ + + + + + +
className(void) const (defined in eoStatBase< EOT >)eoStatBase< EOT > [inline, virtual]
functor_category()eoUF< const eoPop< EOT > &, void > [inline, static]
lastCall(const eoPop< EOT > &) (defined in eoStatBase< EOT >)eoStatBase< EOT > [inline, virtual]
operator()(const eoPop< EOT > &)=0eoUF< const eoPop< EOT > &, void > [pure virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_stat_base.html b/trunk/paradiseo-eo/doc/html/classeo_stat_base.html new file mode 100644 index 000000000..ed875ebaf --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_stat_base.html @@ -0,0 +1,58 @@ + + +EO: eoStatBase< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoStatBase< EOT > Class Template Reference

Base class for all statistics that need to be calculated over the (unsorted) population (I guess it is not really necessary? MS. +More... +

+#include <eoStat.h> +

+

Inheritance diagram for eoStatBase< EOT >: +

+ +eoUF< const eoPop< EOT > &, void > +eoFunctorBase +eoStat< EOT, T > +eoStat< EOT, double > +eoStat< EOT, EOT::Fitness > +eoStat< EOT, std::pair< double, double > > +eoStat< EOT, std::string > +eoAssembledFitnessAverageStat< EOT > +eoAssembledFitnessBestStat< EOT > +eoFDCStat< EOT > +eoAverageStat< EOT > +eoBestFitnessStat< EOT > +eoSecondMomentStats< EOT > +eoPopStat< EOT > + +List of all members. + + + + + + +

Public Member Functions

+virtual void lastCall (const eoPop< EOT > &)
+virtual std::string className (void) const
+

Detailed Description

+

template<class EOT>
+ class eoStatBase< EOT >

+ +Base class for all statistics that need to be calculated over the (unsorted) population (I guess it is not really necessary? MS. +

+Depstd::ends, there might be reasons to have a stat that is not an eoValueParam, but maybe I'm just kidding myself, MK) +

+ +

+Definition at line 45 of file eoStat.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_stat_base.png b/trunk/paradiseo-eo/doc/html/classeo_stat_base.png new file mode 100644 index 0000000000000000000000000000000000000000..eb83eaf4d9b92be7bd4ee16a48e600ae4a008d6c GIT binary patch literal 7078 zcmeHMX;f3mwmyg$ue1T%7EltR*X{-d1874)5)g3gmO)Vl8N=AfAOr}rpfS*`D5yXH zWl{ujNCFXLh(JIICQO1dkHP^lVGeUh-a+o|*Y~Y;*X`Ty{d({H$U3J|yLMIWy}xf) z?enX->4~jdc5MLwVC$)qN6!MlW&{98WNnm${+Z5Pv4$QB=BLjc6N|;rt5{r>ndy`O zy?yyrRaJ#oi-)16MBrId3*g8|hdTf$Vox14JQs3*yoYt?q0Y;qL8{I+9NP1vreLdZ zdT#6UMbo1h1t&sRDsOMBO*u`npuQsa=auc(tbO9Pr&y|lN2{D-uQpXy2rKuzrwwo~ z@m_5dZWFhz+~KnF)DtC{Fb-?eKYPTEat-B;?&IQGyV{dTv!2Dm&}HYREPko1oMMb@ zjDdcWC;mcsdsQkS8Z%2G_^oJ|dJU}>cSqX7N7!>qH+&|Fu?H|X&??in_(DD!n&zGd zhvjD3Og;xMWnM1pv6kyVbDdVzAc8!;f{(tm(R&~ z28GT4z}){Tu;U}aj-pHj2Y#@;R!-1h?tZo396sfnp#sa_B=A>*;jQ^Is9riTLLoC% zxhIj-s*6g`EJfs?hPq~_`gL)X@0UlLW(E9G#7rKO5cbzhA2p6)zOswWPRF3e=a8BZ zlz|FtPra%!8U}W;=*335Cuip@mb8*c!c&)(D5gs%^_!%tn22i{uhdXIHQ$kz_`55G z5mxY)G{M&#iN2ac-~i!ulRNANA;DCx+ONov`ZufP?ac$&5IA1 zCAN~w?~)T<*2OoDHihb*oQozzFHF7XXNfBiIR@pU=zVCeVaCq;m8!5{1}T42L|-!L zpq_OyDZwgvjP(Gap;x82G*(19c;-_wI564{Z+r?mUC>j7VcOyPlQiUMb*6(}O0Ui4 zM`OGO+e^y=~q&S-hLFSZQI1!YX*03lbg!GqMbug!0$$sVrT4PHo%*}+oK1+ z@e4u6V}CdNZ)2wHltR(Q60xH*b-y3Fx;l6}hz2a~w1EKw9Z}3W0Y`p-Rs#SpjTR0NYR|!B?76MSI z*bgh1T$Ziwvgq~pFMZ?o227&#NLYP)ZqT}hOzN}c4eq86i0u_wcZAGV}!dLJ{;pn3^dy7{!+v0 zw&xnAeWE1c7q^uYobr-dw;N}dsKP)sJk}<~VMl9PlEpTTgwtp_A%QCSnn|z(M!?}-zAUyOeyCH!PmqbZG3RMk7NA{{T$&FRAl{xn%_9^^PBC# zaxIiCm&IEuFR#Kq8)%TzhZf)^4B&^DOW$o!`JD^bfb+X1ebwXrq|E{>8g=*Y7*!UD z=%zr`Um&D?95Qa(1}q-Y1vKvbz599SAr6?be)Ymh7_cVy8*Gu|uld^4O^8h?$_}p@w{cknhgbGcJ8mkf$`? z?ED5i!JiL4XN&tlPU&|>pd2l~Qmvtzx6NUO9`US_hsKwEjC~f4^rsfv=JXDC68x5K zd~8^}?gkdY=HnkBe)drJk)9m^2mECYSO#L!iOm^h2$PqvjuHY95qZc#w>9GS8;Pv_QS&xS)+<^?Tn8uoFK`>6%I7!=;IBzMzN0PcnLZGGD^ z4S^-*v|>wC>{z}axy8fh^BpSl<+P-hgYuaghGr6n8t96_wI}U}JZ(^WTpM0AF1h;a zi_n6f-o<3uj-z2?<1&+lP145x`;9%HBl!CGj`MKs*iymSPNMZmu3IZI+b*oxqC5QO z;s;!dU#SAi%yRFJkAoB55A&RrHW-^F`rq#B?3GCF50)Rry)#jaEl5u&SJvNk5hLll zawO_|AJYpD$YB3!!$f!?La?+qPhh6MV0RD6e-1NCBE{mJ4aOf{?mE%UGgKrAPe6Nm z_vpsfc2mXJo`=1i$IX)bn}e4QVJO_`t8W`5w26-WCaYG5@%kCQ92UmdM}L4wAw_yx zRO~xm=}(_jhk177G~K~pO>{r1J1eg&t;b_k5a?R<1XL2w!}iM@vADpfLUa8Uqx4X z&HMZfGI5dia0jejhr$Teb(B(B!*>dhi98Rl9mk{#i{4rIW7G0pDo`(lU5>Ulm>*@g z$umd=@L+IOZ#zMI?LAOB|Lo4Vn1UhcUUJdP>IZXF~t- z;Ro6%?;A&K!#&MX2&D@%L%2yb>_qm`^|7Qdy!X;X zx{Wm&VH%k$(~Z?rE@ce5$K&w|23^_5L2VRHV>0M(1Cn;}cTqNLU<6MquR=f@mfso&4t3Hs$b zE?$V^W!Mx>#M5jR>hJWM$9}g?sqS@$t9IGIe!lul@(1H}rd^{~skOZPvlKKvH-oT~ zgADUj4ZEmH!GQ-8^-!q7Tg{t)YYJK{1@A4<;T$)WsDC786Ns`Q{YMVDBAsqR`VIeq z$(uJq)5fe%+XhK(|Np`Nvj)>rTxm~Dn;hR7_QcXfY@3g)%!dC2{kfJawEDXh1>a;V zJ=M$YInz)Jf5kh;(4^pwJ!Y%Gx{+b+`R*?0@ayLBXW+$p0;)wrt=&8%{Se_D{K-Bq z?Pe)|pAqi3ZijDVdyto^vqPNy<^n~ONpd_}J|-pe`p^*fI^In|&VdQ3El4K`snR!O zXDoUJI>Skx`0|Dm4li4p3T%H;n5-UeSRfHJ6ybX8`eO6gM`<^oPnMPN=k5`jn}{D? zu;gpRg{Vux<0XXE5M5K<5?=M#D*N7EbaIlT+?Ct1ay65 zr2M9k>2wQq4T|Q`~AlJ$fIEA$5V``g9Q=)?BxQ3^`rroIN?*}7Oh<;%` z@jUf%!7i#|E1$D)S~ta+=u(mH;%@u6=4?Z)Z?HW=A6e^Iz>PQBr4Jfj_{=6-YhNFt z2{^o%8d3#QBMNbV=p*k~x@M`HBw?;}K+`qm!9-Z(*h}Gvd~El~_89hwz88AAZ>;CL zz<9L$RjzXhHIp2U?mq-NakRk>U3aByg!h7pZk^bkTm8d>mYpMlpL@=?6PnFP`{VOd zP{^IhlQ%N_RZjx}#Y zscV+p^IDl*zc-OI4(;Oe0=`8%W8+spwG(8kb?9Y0eYJZdjB9rLmkaTAML7Eh*FzD# zCPLo@pB2!lk6g2KHUk!$UrzY01dF~T^gUQnpoG<*`SFgv_|4kgT!Kw7FTPJ!%ndOc z4$no@i)Zv53{14+Q%}Gh;QAMrCrz5(97HLoBi~Fj9@N8^kLfC?FAnP(VJ5h|*L#{I z%55Gw^1CRFaEA^H$FyL4+>lCU*;5`3#cl-)ts3CVJT<16iiopqte!Ii!+nX(>Ks<1 z=4>5{d*z~baaf@&dzVJ?l@DGpMr%ERBRk3%_AT|wo2?RsB`wn1;m)BH#?$>n?>~pV zzBxL=P+gd#A>))m1_~@}?0s9U))TOFIdD7+MMLrthvLoQ#kQ{)3G=ISjn(vkWau^9t)Hi^0csbw0BSdiJT{`)4*=)h3dT;3<>nEKZ74|Q=jepH} z;Rvsoe{U_iGo%iPzCG7#`XdD4SKioT9M;WS1iBRHr2fI1?>3a*9U+Ge?jdMIPCovc z!?J|@YIiH|!k@zZM02^RmSRAs#kH_F0^R;mRC!t27pCDHe*K@x1sM3S&glR%ZJp<% zt?qtF3Bc6F_47O6V6vVRs-C|6k|=->t@X43(7ykYq5jt>$xXYt$~)b#aNKNg5yHAy zKowfdzItb&qYt^KnPjJ>s26CKZ38(r8&-NzoA@cihylqN%MjN3ab$OhlVX*I*ZRY^ zG(g-^p*Y;zbv;GiMc#;CdtzvIPuz`yO10ow%j&6N`a!#wVbi;<8fuFvq)^PWpwHQC43yvF~Z3^0p>7RCp&mb$8L@uzWDjh^-=OsOS1}x^_>- zG(Ab-8rF&5a7on3GMxxMyW)l?HrQUlGRW;AHm9|fqP#rlM#-zTJ~A^oQ3vkMX|yKR z{D{H5(@K=-#jy;F~hZ>41K&@Piwl~jfV9K zZVeUjCd$W3so4mpn-{g`>4;%5)osr$7yWdA&D+)t-W_2+h#z7P(2pq%Q_%u=Z!4_wOmAH7YtlfK!JPg&;(;W5HxYNtqN)WSA zPQEtKG9-EY)nhVgaMQdE}jp*AC-f@#%KF7>hd!aYOiXAwqcnHRumMjI|V4=WJ7`A<9 zF?CW)(Iw&1zZPPMMp=}L6)(%4g}c8kGZ-NK_ls|Tu+s7;#4c*f-Opd@iynfGB&M0v z`(728fi*PU4U#B1rV9|EP%~|l8ju5lj$;s@Y~-VDq0**2gdkUY!1oM1+8z>ar9RZU z);bz$ZC#;ujVZ$7;Gu38pvs2&1BjPZVR_Rbj!b^xe4qu~)D4UrgnD+Yod@FEW~cB` zKgKRB%|?`A5lUdvDE821xAAjuQy-*OQOHq*kEgM>(8VqbS67{h{O9B;4^8y?FI8EfhN<7vor6Ra0U25PF zWT40sJnr9Y^=}#WUkcX?9M3qOnSCX}R{pbv-9HgD|877-X8OX^n-G~0L^J!6qAsq7 z8B|JdJ_tdM0K7P@rT7p59Du@51$KlB+027uxOs3!Z$2`3$z>54Tcl~wNiIB?1J&fK zRH5jBYKAG7gO}ok;g;~_>CTB?bN9ij(2%pJgl01L{qAH!Gn+6h^VArTp~yAFSZ?G< zOkMcWEgSoFb8j*Ut^TNJumTadVyXbCTpM`^+&#S02o0-|FsPSBN98QB{KlR1^*XGe z%HZErC)^Ue;b)z@+RQdrI$$bC`~ZCgpmR@{h`3@DwEQJVeyR z5;j(U>|*g7H?+f}-Lc^wgCpUvnsl;GpN&H0T6kn>MyPK4tq}TO>Y`ASJZF$o;o6JR c$q>tI_*6eLl?=~?KB@tyj+q{%8aZA457BgB=l}o! literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_state-members.html b/trunk/paradiseo-eo/doc/html/classeo_state-members.html new file mode 100644 index 000000000..3ad11077f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_state-members.html @@ -0,0 +1,33 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoState Member List

This is the complete list of members for eoState, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
createObjectName(eoObject *obj) (defined in eoState)eoState [private]
creationOrder (defined in eoState)eoState [private]
eoFunctorStore()eoFunctorStore [inline]
eoState(void) (defined in eoState)eoState [inline]
eoState(const eoState &) (defined in eoState)eoState [private]
getCommentString(void) const (defined in eoState)eoState [inline]
load(const std::string &_filename)eoState
load(std::istream &is)eoState
objectMap (defined in eoState)eoState [private]
ObjectMap typedef (defined in eoState)eoState [private]
operator=(const eoState &) (defined in eoState)eoState [private]
ownedObjects (defined in eoState)eoState [private]
registerObject(eoPersistent &registrant)eoState
save(const std::string &_filename) const eoState
save(std::ostream &os) const eoState
storeFunctor(Functor *r)eoFunctorStore [inline]
takeOwnership(const T &persistent)eoState [inline]
~eoFunctorStore()eoFunctorStore [virtual]
~eoState(void) (defined in eoState)eoState

Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_state.html b/trunk/paradiseo-eo/doc/html/classeo_state.html new file mode 100644 index 000000000..54275d9fc --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_state.html @@ -0,0 +1,276 @@ + + +EO: eoState Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoState Class Reference

eoState can be used to register derivants of eoPersistent. +More... +

+#include <eoState.h> +

+

Inheritance diagram for eoState: +

+ +eoFunctorStore + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+void registerObject (eoPersistent &registrant)
 Object registration function, note that it does not take ownership!
template<class T>
T & takeOwnership (const T &persistent)
 Copies the object (MUST be derived from eoPersistent) and returns a reference to the owned object.
+std::string getCommentString (void) const
void load (const std::string &_filename)
 Reads the file specified.
void load (std::istream &is)
 Reads the file specified.
void save (const std::string &_filename) const
 Saves the state in file specified.
void save (std::ostream &os) const
 Saves the state in file specified.

Private Types

+typedef std::map< std::string,
+ eoPersistent * > 		ObjectMap

Private Member Functions

+std::string createObjectName (eoObject *obj)
+ eoState (const eoState &)
+eoState & operator= (const eoState &)

Private Attributes

+ObjectMap objectMap
+std::vector< ObjectMap::iterator > creationOrder
+std::vector< eoPersistent * > ownedObjects
+

Detailed Description

+eoState can be used to register derivants of eoPersistent. +

+It will then in turn implement the persistence framework through members load and save, that will call readFrom and printOn for the registrated objects.

+It is derived from eoFunctorStore, so that it also serves as a place where all those nifty eo functors can be stored. This is useful in the case you want to use one of the make_* functions. These functions generally take as their last argument an eoFunctorStore (or a state) which is used to hold all dynamically generated data. Note however, that unlike with eoPersistent derived classes, eoFunctorBase derived classes are not saved or loaded. To govern the creation of functors, command-line parameters (which can be stored) are needed. +

+ +

+Definition at line 54 of file eoState.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class T>
T& eoState::takeOwnership ( const T &  persistent  )  [inline]
+
+ + + + + +
+   + + +

+Copies the object (MUST be derived from eoPersistent) and returns a reference to the owned object. +

+Note: it does not register the object, this must be done afterwards! +

+Definition at line 73 of file eoState.h.

+

+ + + + +
+ + + + + + + + + +
void eoState::load ( const std::string &  _filename  ) 
+
+ + + + + +
+   + + +

+Reads the file specified. +

+

Parameters:
+ + +
_filename the name of the file to load from
+
+ +

+Definition at line 74 of file eoState.cpp.

+

+ + + + +
+ + + + + + + + + +
void eoState::load ( std::istream &  is  ) 
+
+ + + + + +
+   + + +

+Reads the file specified. +

+

Parameters:
+ + +
is the stream to load from
+
+ +

+Definition at line 87 of file eoState.cpp. +

+References eoPersistent::readFrom().

+

+ + + + +
+ + + + + + + + + +
void eoState::save ( const std::string &  _filename  )  const
+
+ + + + + +
+   + + +

+Saves the state in file specified. +

+

Parameters:
+ + +
_filename the name of the file to save into
+
+ +

+Definition at line 148 of file eoState.cpp. +

+Referenced by eoTimedStateSaver::operator()().

+

+ + + + +
+ + + + + + + + + +
void eoState::save ( std::ostream &  os  )  const
+
+ + + + + +
+   + + +

+Saves the state in file specified. +

+

Parameters:
+ + +
os the stream to save into
+
+ +

+Definition at line 161 of file eoState.cpp. +

+References eoPrintable::printOn().

+

The documentation for this class was generated from the following files: +
Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_state.png b/trunk/paradiseo-eo/doc/html/classeo_state.png new file mode 100644 index 0000000000000000000000000000000000000000..4cd2cefb18ef4d536893cbd4bf85f73fa2c1721e GIT binary patch literal 373 zcmeAS@N?(olHy`uVBq!ia0vp^DL@>+!VDy3)z97mQW60^A+G=b{|7Sv|35H)e!>JG z3ycpOI8c4){}UjWu_VYZn8D%MjWi&e+tbA{q+-t7DY1Nq6nKt5Jeqz>S|opg_^r$D z>REmtRGY2Llk5?)Yl)_={l5UQJ9}^5(KWmE)m@P3z?v;b7$$a|C^L=OT+#61RZ6yC zJ;$VnElWC+q+CPtJI-z1s=~r~Qbv(~txn~{dkVW=Pc?Hf5o)qzny~tfU}w&*Z|WgzC2!-_B!9fQ(M;My{7J9-%8cNhUo4*(eRp_P`KsZ| z%Nq`CMiUxqxS7sAb6UOYKl2gi4X3hqwzMoQV)}R>d?}ZVV?elL#kS{bo^N4$<)?Uv zrJRq^WAYLu`}Xwk;KE(=T@~J#oRU60@z$}R<4@w2L_Tym{>p5Ep2zRSUl + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoStdoutMonitor Member List

This is the complete list of members for eoStdoutMonitor, including all inherited members.

+ + + + + + + + + + + + + + +
add(const eoParam &_param)eoMonitor [inline, virtual]
className(void) const (defined in eoStdoutMonitor)eoStdoutMonitor [inline, virtual]
delim (defined in eoStdoutMonitor)eoStdoutMonitor [private]
eoStdoutMonitor(bool _verbose=true, std::string _delim="\t") (defined in eoStdoutMonitor)eoStdoutMonitor [inline]
firsttime (defined in eoStdoutMonitor)eoStdoutMonitor [private]
functor_category()eoF< eoMonitor & > [inline, static]
iterator typedef (defined in eoMonitor)eoMonitor [protected]
lastCall() (defined in eoMonitor)eoMonitor [inline, virtual]
operator()(void)eoStdoutMonitor [virtual]
result_type typedefeoF< eoMonitor & >
vec (defined in eoMonitor)eoMonitor [protected]
verbose (defined in eoStdoutMonitor)eoStdoutMonitor [private]
~eoF()eoF< eoMonitor & > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_stdout_monitor.html b/trunk/paradiseo-eo/doc/html/classeo_stdout_monitor.html new file mode 100644 index 000000000..9d63dbaff --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_stdout_monitor.html @@ -0,0 +1,56 @@ + + +EO: eoStdoutMonitor Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoStdoutMonitor Class Reference

Prints statistics to stdout. +More... +

+#include <eoStdoutMonitor.h> +

+

Inheritance diagram for eoStdoutMonitor: +

+ +eoMonitor +eoF< eoMonitor & > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoStdoutMonitor (bool _verbose=true, std::string _delim="\t")
+eoMonitor & operator() (void)
 The pure virtual function that needs to be implemented by the subclass.
+virtual std::string className (void) const

Private Attributes

+bool verbose
+std::string delim
+bool firsttime
+

Detailed Description

+Prints statistics to stdout. +

+ +

+Definition at line 38 of file eoStdoutMonitor.h.

The documentation for this class was generated from the following files: +
Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_stdout_monitor.png b/trunk/paradiseo-eo/doc/html/classeo_stdout_monitor.png new file mode 100644 index 0000000000000000000000000000000000000000..80fdfb64754e6cd62158072a7ab9782d6d8948cb GIT binary patch literal 644 zcmV-~0(xYLck`6ULDFwodec&=$=K$J*Nn%@szK(*jM{i zoA7MG`ppLk)^D0%f(a&=U_vph-~0zcx7(Z-dfn!PaL{cY3rF4N9YWJ>P6*>}b1H{n zw|T=`bh^z6;i%i35N;YKyq948=7R+5H%&0X1QSd!p%`#-_{E>h(S)u5usHcfhm%>o z8Vh{4uLa2W0_$n)qRh(5h zT?q^1TU)_z!tPr*E}<@cBRIFr3A%J=1Xl>D4oA)ST%9`af6N1RE46QpOcFWfgw ecrW4fzx^-Wjkp1Eq@s2J0000 + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSteadyFitContinue< EOT > Member List

This is the complete list of members for eoSteadyFitContinue< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + +
bestSoFar (defined in eoSteadyFitContinue< EOT >)eoSteadyFitContinue< EOT > [private]
className(void) const (defined in eoSteadyFitContinue< EOT >)eoSteadyFitContinue< EOT > [inline, virtual]
eoSteadyFitContinue(unsigned long _minGens, unsigned long _steadyGens)eoSteadyFitContinue< EOT > [inline]
eoSteadyFitContinue(unsigned long _minGens, unsigned long _steadyGen, unsigned long &_currentGen)eoSteadyFitContinue< EOT > [inline]
Fitness typedef (defined in eoSteadyFitContinue< EOT >)eoSteadyFitContinue< EOT >
functor_category()eoUF< const eoPop< EOT > &, bool > [inline, static]
lastImprovement (defined in eoSteadyFitContinue< EOT >)eoSteadyFitContinue< EOT > [private]
minGenerations()eoSteadyFitContinue< EOT > [inline, virtual]
operator()(const eoPop< EOT > &_vEO)eoSteadyFitContinue< EOT > [inline, virtual]
printOn(std::ostream &__os) const eoContinue< EOT > [inline, virtual]
readFrom(std::istream &__is)eoContinue< EOT > [inline, virtual]
repMinGenerations (defined in eoSteadyFitContinue< EOT >)eoSteadyFitContinue< EOT > [private]
repSteadyGenerations (defined in eoSteadyFitContinue< EOT >)eoSteadyFitContinue< EOT > [private]
reset()eoSteadyFitContinue< EOT > [inline, virtual]
steadyGenerations() (defined in eoSteadyFitContinue< EOT >)eoSteadyFitContinue< EOT > [inline, virtual]
steadyState (defined in eoSteadyFitContinue< EOT >)eoSteadyFitContinue< EOT > [private]
thisGeneration (defined in eoSteadyFitContinue< EOT >)eoSteadyFitContinue< EOT > [private]
thisGenerationPlaceHolder (defined in eoSteadyFitContinue< EOT >)eoSteadyFitContinue< EOT > [private]
totalGenerations(unsigned long _mg, unsigned long _sg)eoSteadyFitContinue< EOT > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_steady_fit_continue.html b/trunk/paradiseo-eo/doc/html/classeo_steady_fit_continue.html new file mode 100644 index 000000000..474cf16d2 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_steady_fit_continue.html @@ -0,0 +1,144 @@ + + +EO: eoSteadyFitContinue< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSteadyFitContinue< EOT > Class Template Reference

A continuator: does a minimum number of generations, then stops whenever a given number of generations takes place without improvement. +More... +

+#include <eoSteadyFitContinue.h> +

+

Inheritance diagram for eoSteadyFitContinue< EOT >: +

+ +eoContinue< EOT > +eoUF< const eoPop< EOT > &, bool > +eoPersistent +eoFunctorBase +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::Fitness Fitness

Public Member Functions

+ eoSteadyFitContinue (unsigned long _minGens, unsigned long _steadyGens)
 Ctor for setting a.
+ eoSteadyFitContinue (unsigned long _minGens, unsigned long _steadyGen, unsigned long &_currentGen)
 Ctor for enabling the save/load the no. of generations counted.
+virtual bool operator() (const eoPop< EOT > &_vEO)
 Returns false when a certain number of generations is reached withtout improvement.
virtual void totalGenerations (unsigned long _mg, unsigned long _sg)
 Sets the parameters (minimum nb of gen.
+virtual void reset ()
 Resets the state after it's been reached.
+virtual unsigned long minGenerations ()
 accessors
+virtual unsigned long steadyGenerations ()
+virtual std::string className (void) const

Private Attributes

+unsigned long repMinGenerations
+unsigned long repSteadyGenerations
+bool steadyState
+unsigned long thisGenerationPlaceHolder
+unsigned long & thisGeneration
+unsigned int lastImprovement
+Fitness bestSoFar
+

Detailed Description

+

template<class EOT>
+ class eoSteadyFitContinue< EOT >

+ +A continuator: does a minimum number of generations, then stops whenever a given number of generations takes place without improvement. +

+ +

+Definition at line 35 of file eoSteadyFitContinue.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
virtual void eoSteadyFitContinue< EOT >::totalGenerations ( unsigned long  _mg,
unsigned long  _sg
)  [inline, virtual]
+
+ + + + + +
+   + + +

+Sets the parameters (minimum nb of gen. +

++ steady nb of gen.) and sets the current generation to 0 (the begin) +

+Definition at line 84 of file eoSteadyFitContinue.h. +

+References eoSteadyFitContinue< EOT >::reset().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_steady_fit_continue.png b/trunk/paradiseo-eo/doc/html/classeo_steady_fit_continue.png new file mode 100644 index 0000000000000000000000000000000000000000..9165aef3937c05596f73078f115b7c628146e6a7 GIT binary patch literal 2327 zcmbVOdo+~m8XqR7&={Rc8jQ5dt|mh%GRk$t$Yn}V!$?|KE;G{jNJ4jKABD6-X)?Mn z<1(YexQt6S?Wqh#d?|Ikv z6VbyNp@GtX!C(l23;qZU29H+S4J+WvXFXznjB?T?x*c^=C=^Olp=ij>4MEu8b8 zUN~JBaYBdT8qq*dqXENap)r7m%K6|iCjIdor=yJJ0!fi1O{z2&TmWg z%za7)mW8pR80t-FKg6a%i&}|>2N_JNZqoeI`YP1!)p>Y#TaH0XRRo{Hx|m#AHgI0n z^~#6Mz*4hER=;{flC*mkh+XK@Y9n1YN6j;{OxfWffrqC9ShRZnvwI+5Q5?1VCI=YG z8{N;+fm&K?Q1eXc%kI=?{0^Y6v6YQ1S`sDxEq>un=k+r$Oh6}jC&K(ex1oOIYYwZ7 zg?IR)=ctA8dQ_SZxbdVcXACP4991D;TKe5`>26JDjMLpKNud_;a? zlYV2K<1so-{t$OMutd;|DH)bS+1#o5JAS#|d>U<~EdW^DiAu`q`}*e~axsYzA91ni;^ zr6f=She!>5!V){OCb3%;0H~Hm@%JBe7$v*IBWKc*0H3p+hAsJ^JEb zGqi|T9>c*+QkdGwfe!T@n~rKGYmV44b?ToHaE+*|VMAvw>96WqL0HMO|BsNZTMQU~ z`GUB*;Or1z$bMGxqP`&8jHIx=Uy-jnenPH(+3^#i{(a&B=c|toJyCM^q?t-#){Y%2 zb8rY$1;Q@jxOQ|B!^4DFpu_ai1X*hTwk(fXc1iLn9n8JS@ti;JYEfHm+i~)>Ne@Xf zRG(gJK$Lqk*apmaJ!1E2uQP2=)nQDH?MciVgpyksIZ`9o3ea8 zCew?|Q-;VGeY|95hD{D>DppMlT%{+t_zN5Qhsv_!^u356U4!$xKFG_5!X8!lk!u^H z^NjTtaA@KgZ9pJM`N8HzO4@CF>A4)GP+6YCX?@WcKhGR(ysj-{(QmwQNVZ~6HSb={ zX;w;>W!k|=*^qGKL=hD=IItm-X?ho@cYWF4Jx697LV^Vu?@|r7fQ`TxnHvg>%peUzv3x6oZYE6_YZ^4bscnq<-?Z=|q%hA3n zHZAg)-`9{n6*|?5-yW<_EnP%h!j)V|NSfkWY2nWH>e$i!+uaX;r~F@4F?#6S*{gL% zQq^UB7aVL*sXf?+3@unydNi!z+G98jyTt%@Mk&sVnuL`wzyIp;3@POpXS!r1Z?^fU z*_f;KjpWXNt>(tyb?p*iF$~CQB4#0KPwJ_Z;>uJ(iqI1ba{OgpA=v|`b5G$1Lf@o8 zEgHni1Ga~=5M}!OiP=Y{!eLX}dnZ&Ni!n7IbYg-axpH?sgBqXs5Sw!(prkF^*&Jgh znOiItkqtrK_@mFDu4RkaXrlw&M9k~@%y$EwpG4j;rUeE5kTq*o^f_cuvhKTWa%=f_ z|DU4c79IXP@ogl!cDYm8Q~~W+WrY8q>;G@E{)c@2i%X*6yMRxr#dfG<-hTq$rut1c zi$Qwp);^iO_gz7ppVZjJ6niiPswUu+18kge@o?G|VB8 zYn^$?S+xFjv3l!sy`eVY4l9t`ncsFN?szr=RYu%^_6r8;-(J&+Vgtf{d$P6X-#fA{ z6b5)?5;B@el|)Ol4)t!4-n+H2$}i|7#cFW3kz6g?e}wu^IF?wObmfUC&V2}3Mi?n# zJQ#Q?t0snIQplnvylcHgSWXQJ_PWg~5cYTwvq=3IrPt~@^Xe=rJVqgR(4?No; H;PO8KKDK2g literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_select-members.html b/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_select-members.html new file mode 100644 index 000000000..1c6d21526 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_select-members.html @@ -0,0 +1,21 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoStochTournamentSelect< EOT > Member List

This is the complete list of members for eoStochTournamentSelect< EOT >, including all inherited members.

+ + + + + + + +
eoStochTournamentSelect(double _Trate=1.0) (defined in eoStochTournamentSelect< EOT >)eoStochTournamentSelect< EOT > [inline]
functor_category()eoUF< const eoPop< EOT > &, const EOT & > [inline, static]
operator()(const eoPop< EOT > &pop)eoStochTournamentSelect< EOT > [inline, virtual]
setup(const eoPop< EOT > &_pop)eoSelectOne< EOT > [inline, virtual]
Trate (defined in eoStochTournamentSelect< EOT >)eoStochTournamentSelect< EOT > [private]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, const EOT & > [inline, virtual]

Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_select.html b/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_select.html new file mode 100644 index 000000000..e55cdc862 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_select.html @@ -0,0 +1,50 @@ + + +EO: eoStochTournamentSelect< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoStochTournamentSelect< EOT > Class Template Reference

eoStochTournamentSelect: a selection method that selects ONE individual by binary stochastic tournament -MS- 24/10/99 +More... +

+#include <eoStochTournamentSelect.h> +

+

Inheritance diagram for eoStochTournamentSelect< EOT >: +

+ +eoSelectOne< EOT > +eoUF< const eoPop< EOT > &, const EOT & > +eoFunctorBase + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoStochTournamentSelect (double _Trate=1.0)
+virtual const EOT & operator() (const eoPop< EOT > &pop)
 Perform the stochastic tournament.

Private Attributes

+double Trate
+

Detailed Description

+

template<class EOT>
+ class eoStochTournamentSelect< EOT >

+ +eoStochTournamentSelect: a selection method that selects ONE individual by binary stochastic tournament -MS- 24/10/99 +

+ +

+Definition at line 42 of file eoStochTournamentSelect.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_select.png b/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_select.png new file mode 100644 index 0000000000000000000000000000000000000000..6fddab7277772d100442f69997d1f24ca71ed03f GIT binary patch literal 1975 zcmah~dpy)xA0Dv{VR_#!e8_mEU2c^U*jM!*g2J>QF=S51jZt>>Y zxcxAV%b1@Tibx{2-$aI%ks3oTmw^uGD;!G+yt`svi%wEY3K&xvSE>7JECt^`C6e@eIIkL$?(e||Lc({ z34qeqvpZ=*#^G!I-0?uB=m)Aj%ha}H7rTmbb?J`oACNy30LMzEiqe&<@yO8iiRThw;?A$(Q|YVqxu| zOI?JtMu@xE>zge&r5WN@c>)&blf{GA zg>QQ`{g}mOijG2+qf|Gj_`ObrR=B|bZigPTRChrI8l9#Nb9>7Q+xBNXk-n!pZcOY3 z7VP`GR_V#`HqNVUU^-(LfCca<>6^$qFx`mhts4Rr+v=|0ho=hUMym3V#|5U9Q0fT4 z3|{(YEapdI=(I6+$$~|$fQsD&sL+u|{H_aJR{+DTWVX$$>V3oH1}{Vr(ON*~`>dmN z9^vMPSn=n<2I3N<9UO5acc}%D^#>&j>y+#)3!F#ID3KY0P)7LD=wLh`4E z_;8>|&yw>^nM*%qXd9OzY#>qnoObMg6GE`I#Yad}qi&-3{=)A==1C=i$658m{>yY+ zZ=tfEOD$n(XwniVAcMGsa4=HuZuPux%DhivbVg^ugIdjSfrDU>@b)X>p&_?S%?82f zXqgMS`ZcF62w%>imqK{-;!YsUL54jaCG^GY$xMN7A%kn0(P8qqP0w-}nR?JOUcGbt z1iTNxEH?n7X5?q!MP@OZOCio0Q#$6dc3oLAEyP7+2cFZ&cAtm_8kY!QWTO&T0ZFM= z&p_UBr2NWpqCqA<@Z27;AJ8$!QTZ~j&b?+JMaIa zt})j9OQ?z5t|^WMA5!bFpY!2Y4Y*9;XFpW#5Xz1%?=ujqVe&<0jwPtrw31h@IJI30 zbpO5gFZB9L5kCiSkLn(8o^8hekD_^D4m{fQXzKdQGpL&KG~q6F9&xX_*Kl?Wj!#hr z=QRKYoTO1g?jlzoq5( zpB6X6RO~9mnkLjy|55nwgwI`ymHRVogJCU4Kt;FL zGLlft7*Y0b9sW5vzv=KNZe3m8wG8Cv7B-MJA*o<4JN?r`dAJqe_e?w_yoiXnQHf6| zb?W6D#57LJYV0Jhm@JugXhR>U0cvPxG;pQL=K@p!lPLBn18;z2dTC`g$K=2%3y1X7 z%f2FAR&*nUSdA~5_=HLYeKEae`4b!)6Lm%nMKoKxvA9+Wb_Yq6+ucF RA>v;aVQ1}VRe97i<|o@h_OSo} literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_truncate-members.html b/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_truncate-members.html new file mode 100644 index 000000000..03126d7d0 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_truncate-members.html @@ -0,0 +1,20 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoStochTournamentTruncate< EOT > Member List

This is the complete list of members for eoStochTournamentTruncate< EOT >, including all inherited members.

+ + + + + + +
eoStochTournamentTruncate(double _t_rate) (defined in eoStochTournamentTruncate< EOT >)eoStochTournamentTruncate< EOT > [inline]
functor_category()eoBF< eoPop< EOT > &, unsigned, void > [inline, static]
operator()(eoPop< EOT > &_newgen, unsigned _newsize)eoStochTournamentTruncate< EOT > [inline, virtual]
t_rate (defined in eoStochTournamentTruncate< EOT >)eoStochTournamentTruncate< EOT > [private]
~eoBF()eoBF< eoPop< EOT > &, unsigned, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_truncate.html b/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_truncate.html new file mode 100644 index 000000000..9cf45cb2b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_truncate.html @@ -0,0 +1,52 @@ + + +EO: eoStochTournamentTruncate< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoStochTournamentTruncate< EOT > Class Template Reference

a truncate class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g. +More... +

+#include <eoReduce.h> +

+

Inheritance diagram for eoStochTournamentTruncate< EOT >: +

+ +eoReduce< EOT > +eoBF< eoPop< EOT > &, unsigned, void > +eoFunctorBase + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoStochTournamentTruncate (double _t_rate)
+void operator() (eoPop< EOT > &_newgen, unsigned _newsize)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+double t_rate
+

Detailed Description

+

template<class EOT>
+ class eoStochTournamentTruncate< EOT >

+ +a truncate class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g. +

+see eoSSGAStochTournamentReplacement) +

+ +

+Definition at line 236 of file eoReduce.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_truncate.png b/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_truncate.png new file mode 100644 index 0000000000000000000000000000000000000000..eee05294ebe02b19385529f19cf24e106fd0eedd GIT binary patch literal 1960 zcmb7Fc{JN;7fu;Jqm^MQN~N~ZQk1Hsl2U0y)KWs)=rWdxGPcH2%Zx2LI5u0XTof2@u&_eIMJ0 zsLn|!?%s8h^~ zmzIu;=gg>gj$CH02qq5N9_yezt1i|Fs%i!FW&6JY`j5(Y(&h;3d?1pNKI!{h`*3EV zrSxW0fN~>Fc0kp-FF6NBtz)wlF>ZjL605N+dhBTDkC5=A=IhqBs_+-J#e`5w1rw=k z28^7R!@RoSk}vQNNv9OU{NGuX9jRdV?ukv~x98};gpuP{lU?65^*M{q5>mwIfMYFv!9r&}N=C?Pxwz6M+LGwgtc48HtMjoddvRgD;(`kpB6 z{2zK*Bn2N54jpI=BBMP2^QHQtFie>pywdZt2Q!{{ad=t1 ztA~cW!sO!-{>$Cl9__zKHWp3hFcit`cK*}WGzK-qYH$ka=N$sYc$Cwmnj=a5>}5t(gV8$S`qhzdZoi6Ofn2JJAb!1Twcw*`f?zYfYdWl25=QBoywH>u zgijx(J<4{@)*=~a=EE)+$4@pO<22+iO<1fWl~@Lzoo4jAh$tUpk&LGZTk`}zm7!98 zY-i>`Ve4iNur%%S;MAMN6TBK0^r(a%q%p&@FRf{$=Zlm38R z9-b6pp>RUolK;Nsxl&2tx6TC3ffy;*)>bz*A^V2&`|*BQUR)ZFSGoidB3B{KD9eXK z#U-DXMdD}W-bi9-nSquGBnf$jqw7^&lMwULr7wgM;$nO6b{k4UW+dsk5^`K!l79WK zd;O85Z+R6*SKl=Kj;^T}8>9lwc9GoRj$(6ZCyq8n^&Xb-nFqXT! z7U!zwt~QsopbeRTB>J;xbQ=PTYZvR)Vi*RK+kMU9^6N8zw_LK8)y<5jXG-4B-9kTz zduSl^C|VEE57Svds1e0psS#_v zliY7eUQT7Kp^$VTW3Nh+&4E|($kcP4x<+9-0&$t!Te9}t3!_Tn2Ze0+Jtzg=24n@k zx?E7yoe_{V$~OvsZ_$h!@Z0=3v_xZMyb%10M{@Z@Z@YtLP!&e>-#f!3uxQs`9?*ol zwxieJtVxuK=1RsogQNAh%Of!Y3IB3oiS$;=Vk!mjqT0LszbgGxi85%m&|_(@g?T4){G~4U#Jvo8=B0 z99mHc>c%fFlvb{l*L;fMsu0MYf!Xg?I9p`JT`)K)FLE3sfsPd`4OsY?ClqyBkKW3Q?ul^oX! z!aM;r4_ziplyv4Kx&W=Xg{rShzi-5RTo*`~b+pZv7jpY@;8*Z7e(YpcY_-F0w6=0H0&@-)Dn8|8fdj_jTcuf_BM`= z9CMdlY+DkNxljvyKvm=QcV3*ldW8SLK49dS-hKz+j)>?dI;wB-OtouN%k`V@qc=}x z9TvWx0g^(2q$n@W4~p$_?v;YH_N&kjooni3k90;?9h%2DD9BE>hZ`#tZ2prh7wdxzyA2cg6wUum + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoStochTournamentTruncateSplit< EOT > Member List

This is the complete list of members for eoStochTournamentTruncateSplit< EOT >, including all inherited members.

+ + + + + + + + + +
eoStochTournamentTruncateSplit(double _t_rate, eoHowMany _howMany, bool _returnEliminated=false)eoStochTournamentTruncateSplit< EOT > [inline]
functor_category()eoBF< eoPop< EOT > &, unsigned, void > [inline, static]
howMany (defined in eoStochTournamentTruncateSplit< EOT >)eoStochTournamentTruncateSplit< EOT > [private]
operator()(eoPop< EOT > &_newgen, eoPop< EOT > &_eliminated)eoStochTournamentTruncateSplit< EOT > [inline]
eoReduce::operator()(eoPop< EOT > &, unsigned)=0eoBF< eoPop< EOT > &, unsigned, void > [pure virtual]
returnEliminated (defined in eoStochTournamentTruncateSplit< EOT >)eoStochTournamentTruncateSplit< EOT > [private]
t_rate (defined in eoStochTournamentTruncateSplit< EOT >)eoStochTournamentTruncateSplit< EOT > [private]
~eoBF()eoBF< eoPop< EOT > &, unsigned, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_truncate_split.html b/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_truncate_split.html new file mode 100644 index 000000000..5614d453d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_truncate_split.html @@ -0,0 +1,59 @@ + + +EO: eoStochTournamentTruncateSplit< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoStochTournamentTruncateSplit< EOT > Class Template Reference

a ReduceSplit class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g. +More... +

+#include <eoReduceSplit.h> +

+

Inheritance diagram for eoStochTournamentTruncateSplit< EOT >: +

+ +eoReduce< EOT > +eoBF< eoPop< EOT > &, unsigned, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + +

Public Member Functions

+ eoStochTournamentTruncateSplit (double _t_rate, eoHowMany _howMany, bool _returnEliminated=false)
 Ctor: must provide amount of reduction, and whether or not you need to return the eliminated guys.
+void operator() (eoPop< EOT > &_newgen, eoPop< EOT > &_eliminated)
 Performs repeated inverse_stochastic_tournament on the pop.

Private Attributes

+double t_rate
+eoHowMany howMany
+bool returnEliminated
+

Detailed Description

+

template<class EOT>
+ class eoStochTournamentTruncateSplit< EOT >

+ +a ReduceSplit class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g. +

+see eoSSGAStochTournamentReplacement) +

+ +

+Definition at line 256 of file eoReduceSplit.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_truncate_split.png b/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_truncate_split.png new file mode 100644 index 0000000000000000000000000000000000000000..210ef71f4e2f0048c3382ec8d38fdc8f407c730f GIT binary patch literal 1999 zcmb7FXH=707Udxm6cg|%B@mtgacI&BWh4ZHRB2J*p_E562$~Rjc_iTQ4G;uHABZ3z z0xFD<HOdB7#&y3xp;J2n-TL2sOsc_gJpw%pcd9A9vrq*S+i9b?)8g+*F*SHB3xS zOh`xwW@}?{K}bkA5#+5R2SD^2Kn8*n9B1!hDG&%iDiE|57W&)<+5Tv4ZH;>+mbth0ZLn1B8S`@wOINmzaD`eqUILv80tlr0WP3c5Ohr-(bVs9nZWmisUQ(BpsY! zFS27Yl}c3XnVmm3s+Pjr*&aqiXNS>WWgUA-*D4Dgdu;#(6xAG1MNz}9V+(HmVXapa zwbXjnFJw5JGg|F*zvJfIlS@?BvlT6ynL5!mR$_Celq`n@A)sDO*5gCNNAFBo&&&r~ zQ4&Lw+6eoh9J7*yb#7@1(hs-H9=bDf$-5w{An50Upw-j<{ZW;a5a6`U?;FHnMb>tc z=>bYYuvEi&QCH;Ix5@YQb80f24;E_zC8_u+7CLlg?$iz4)GXi4LBC$O39u8z0&A)gInUXe6j%za0PpC1sk8OPSbr2r0y7&6w2Ij3l zPsS0}Fe>v9tEqOAG5OG=U0DvF9fSjvMY+BMLcpKu-obQ>)tv7CFQtM;7!$V`t;IrM)TcOGeuILP+yESR8)AP##G{4|-$v=A! zJ6&w~>q?q6g=YX;9_osJ%w9}t?$M%*tP`%M$&neNU!aX-@1;lwKqV1!KJZA=pMWP1 ze??dKN?|x?cqI4wo06+e57VET{+;5&IV8EeS8fV;Ibzx~otPo(YVirQacB12yfb>2 z3%ycU{B2v-`4=jc8KBU6x+Ss&3Y-<|K`RCn-DTs)*w(BEXJlRDgn6J)1;hIwL4gOu zul)B}--ApqTC<|KZDcUUha#+`oW&0yO9Hh++wvw#?>c)h4}W>eFKx5@mKd0w7O_9; z@a>+{D4Lw`pjR%T9Ou~3%`)g--&NX}88he`HLP>hI}s;Y`89W zoS6))$dV{hO*vxW0U>G%dvsWhAO7fdClA{hxMYV5Gf&fBnY>a+%^}N8X=qLx^c##Zgg^ z_F~=q7-~todUmKEj8xijj0zqlr_VYW|_;`JRh6Js2&f)y~c1Y@lT@Fp7L%_bKE|A z&UZXNM_S9S-;w&QY`Hq#jxCiDygmTA=hZ;}(EjQik{FUoE`2gdfqj+y)-S-OaZl$W z??B%PH=P(AvovX}z#&9TLOzw-Z|VfqyW!pD*l{*u1m zr1l{Zo=;=aD_kUNEPy8a-2%I#rnN?J)-%{!mhiheaa5Q$5WAVnUEiFcg?rPEnxO(O zxfI&ksoHoGe0|sY?vmqx@Xg#u=_#}eiiFs^e}har$9Mxpd+GL{qPDJUZ&bOrlhj^T zFceSOW_I{!#68#PgnPn0KLLJCV0Gs3W)fYsY78z9ddk0((32V6FO>fQE#Jy5(fgL= zK5IUhwPV`=XwhHoutnG-`v?y>`eWPvcoj4?o2oxFGO{7;02bkQ``0%xtQKEItzH?7 z3N7msC&IhL2a`vuy*Axq`)LS5pIRxuTVs0RLO!g(HR}DQ*N43oTdk+ z^EwLX#1X;x$hPizd~i}iGNxGRSrA{rA<)Q_D{=B=`?aajn$1o;Oipxmx@rRcY+_6X!Y3V@M%=o`ygzF2md-Q?c93LpT257v~pp z4?;LLMHSA<7Sh0knD#ZC;544e8_0r*A>GW;x`8HamjMyLaprd^lKM+JmPDV@Wxs}# z2?)aR&w;2V|B#@y0A2VmkL)50*>vavto$#{{aurq)Y$+ literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_worth_select-members.html b/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_worth_select-members.html new file mode 100644 index 000000000..efb3b5c76 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_worth_select-members.html @@ -0,0 +1,26 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoStochTournamentWorthSelect< EOT, WorthT > Member List

This is the complete list of members for eoStochTournamentWorthSelect< EOT, WorthT >, including all inherited members.

+ + + + + + + + + + + + +
check_sync(unsigned index, const EOT &_eo) (defined in eoSelectFromWorth< EOT, WorthT >)eoSelectFromWorth< EOT, WorthT > [inline, protected]
eoSelectFromWorth(eoPerf2Worth< EOT, WorthT > &_perf2Worth) (defined in eoSelectFromWorth< EOT, WorthT >)eoSelectFromWorth< EOT, WorthT > [inline]
eoStochTournamentWorthSelect(eoPerf2Worth< EOT, WorthT > &_perf2Worth, double _tRate) (defined in eoStochTournamentWorthSelect< EOT, WorthT >)eoStochTournamentWorthSelect< EOT, WorthT > [inline]
fitness (defined in eoSelectFromWorth< EOT, WorthT >)eoSelectFromWorth< EOT, WorthT > [protected]
functor_category()eoUF< const eoPop< EOT > &, const EOT & > [inline, static]
operator()(const eoPop< EOT > &_pop)eoStochTournamentWorthSelect< EOT, WorthT > [inline, virtual]
perf2Worth (defined in eoSelectFromWorth< EOT, WorthT >)eoSelectFromWorth< EOT, WorthT > [protected]
setup(const eoPop< EOT > &pop)eoSelectFromWorth< EOT, WorthT > [inline, virtual]
tRate (defined in eoStochTournamentWorthSelect< EOT, WorthT >)eoStochTournamentWorthSelect< EOT, WorthT > [private]
worthIterator typedef (defined in eoStochTournamentWorthSelect< EOT, WorthT >)eoStochTournamentWorthSelect< EOT, WorthT >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, const EOT & > [inline, virtual]

Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_worth_select.html b/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_worth_select.html new file mode 100644 index 000000000..9d4478727 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_worth_select.html @@ -0,0 +1,58 @@ + + +EO: eoStochTournamentWorthSelect< EOT, WorthT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoStochTournamentWorthSelect< EOT, WorthT > Class Template Reference

An instance of eoSelectPerf2Worth that does selection from the Worthes using a ... +More... +

+#include <eoSelectFromWorth.h> +

+

Inheritance diagram for eoStochTournamentWorthSelect< EOT, WorthT >: +

+ +eoSelectFromWorth< EOT, WorthT > +eoSelectOne< EOT > +eoUF< const eoPop< EOT > &, const EOT & > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + +

Public Types

+typedef std::vector< WorthT
+>::iterator 		worthIterator

Public Member Functions

+ eoStochTournamentWorthSelect (eoPerf2Worth< EOT, WorthT > &_perf2Worth, double _tRate)
+virtual const EOT & operator() (const eoPop< EOT > &_pop)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+double tRate
+

Detailed Description

+

template<class EOT, class WorthT = double>
+ class eoStochTournamentWorthSelect< EOT, WorthT >

+ +An instance of eoSelectPerf2Worth that does selection from the Worthes using a ... +

+stochastic tournament, yes! +

+ +

+Definition at line 128 of file eoSelectFromWorth.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_worth_select.png b/trunk/paradiseo-eo/doc/html/classeo_stoch_tournament_worth_select.png new file mode 100644 index 0000000000000000000000000000000000000000..d48975b8cc9aef7811c7aa9a7bebe8ceee14b89e GIT binary patch literal 2398 zcmb7GcT^ME7mfyWMVhV(0s(Q6t^(4eC;}>25Ge)&1h5bw5>yO?U_j7S>C&a!LQu+} z7y=U*q{|xy`(f7B`hXK5o0AQuJv5d+bV*Ow!BTrpBFMw%;j5_S#TX}N%iDQD zRs7<^^Hroqf03jHvRgrdc_+U^%>5>>6TSne2PIUAKU)B@W1HdN8A2-bA$zwW z2}gQ0mKX?>5cVCzsJWTpOL|7%>+BZ~mdP7t^+B<5yCii4S=q5p;ygWoeLT;VKi4&C z%%$svTx?}wNnj}B8B8CL!EsYp;Kh*SjK z14^f!gw%rX3IoY!rk*Sqlvj7LFDf1L9&~ogfQI=v3NG|0pldMhxxK#fek_uc3yvJs z*IuB;A|)>HHUeez?Px7PL#pELS{9FrB)mQ)3Hm)sCB4K>pS)Sp+Xhd*lH&(-l*$0t z-BR7kAkXRF_35jVUow8Vd*mH$*PcAI;e_fEexnfz|Yv>$k7&>FFWAcj;t(j;sT{!cV%#Nt) zke1i>$ZvX2gt*thj2WTBLavSl=W&U(ETFPbAyEclIH4lu&-YvC+_^q-M9^=tB>&-n z;aS|mT%rCXzB!y@_S(CZB6+%l4$0hL^T_5FY_z~>g%0DGGmz7&|Mty=-VEPIIo;)ZI&6N=5aiwa=Gaev1aOuqUPl?OP?fJ*X-_0tw_R%u zvEdJzuAD34|0jduNbZ%0o<$37gyEP%Y|rhLj!eSPMQKGcS% zx}bH@wFdy+h5z9QT1pdhqtmgbZLMiq%Ad}qq6?Q%MQdlr-E?cli}zPNvpkJfd1O|Kl8R+>uN8YB*{f`K9t6&r z%su56enJL6-{#ZLb~Lm92^YL>$#`~gSsBx=b+c_Y`qp>2Q8SAZ34qc_--EBPc~D%) zk^32u$KnnE(qU8K&n)jDr5OQU|5T$h|79`^kQJ?2oA8%1hmANhG2P*&l9gn$bMDG) z+kGu;hkY;0jYO&A(XwsR%ILz&Tj`vunkj>1dgDiG(Xch3wuyTAxl7FE@U6wIr<%!L zr_gz?Me{!4uaKcnbw~EbWr>|`i{?uM4*ReQWc>`YB8CYqr5`mKG5Rv>HuOsi#uiWW zoK7R`JQARbR^rh$PmIO9aM6fgLG`Z3iNvLFRPh#egv%yoR5wGhK=YhA^A>?WaQ|ED z{N?Opo2{_ufp3k(aDAr)t4WU#I!oXDxQ6(1t;q?Y`ie}t{;t9Q1*5<1kvgDtsBW_E z?DrHm4}&<(^TkXr(Z^FNO*bAOoz0log`|@)*j7$L>W+#6$e*n3!5QGvHFBLp5%u%3 z=`%zJ4Xn5_)s}mI{>PZ}#xgIwrnCbZ^eyk+x|ql27CEqF-{!AJyAE3@Wd+Az;tVZq z+|Nop95%R`v%X{;@2H`r+UV)8>jNUo)Edf0bR_mxbkuDGJYv9XDEY`~HFQEW20`GX zK7V4wH>Ey10vwH^=%Hy1>-b|^fgxLR(Qd}XmNt{=#fSxNsY9A(VD*@Zl`E_F2*g6in!q!r^@N#C_<1@N0JM)lGV`&J08U_UHuH(YqHdFH5z&x%Fh zb9LIae(0wO$A3|ie_<*Xsys!Y6$HGk30*C9Ig}?-y$<{{M1hbqSws7HXCdq=an+)0 zFcYyjKdg#qIq)_}L4BfZ13R8}-Bn<~=znLoZ#br-hsZe}I7BTY8DR@d6x#|k#>;F5 zQ{KGb&Lmg#Rb4?n4*8mqcovuQHCJkr`BSS&H?wW-;uL>9r{R3TA{BZtWB@iM$2ugn zpg*=piS}jgoO@Onyy%+nnTqk-U`0|?QBB4*vGX6c`XsO4^^qDlV(_a5I4*Crs9wa~ zqp424LaYAL^NO6bj0!0>ZHe`JS{#bEW0a&^0Q<8E$1{V#AbN*&bU_ZGkB5r!@5547 z*L>+2C3GHlPU6nyOnmmY#|!}=3$a@cSm4wUlQ95ph`N7 + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoStochasticUniversalSelect< EOT > Member List

This is the complete list of members for eoStochasticUniversalSelect< EOT >, including all inherited members.

+ + + + + + + + +
eoStochasticUniversalSelect(const eoPop< EOT > &pop=eoPop< EOT >())eoStochasticUniversalSelect< EOT > [inline]
functor_category()eoUF< const eoPop< EOT > &, const EOT & > [inline, static]
IndexVec typedef (defined in eoStochasticUniversalSelect< EOT >)eoStochasticUniversalSelect< EOT > [private]
indices (defined in eoStochasticUniversalSelect< EOT >)eoStochasticUniversalSelect< EOT > [private]
operator()(const eoPop< EOT > &_pop)eoStochasticUniversalSelect< EOT > [inline, virtual]
setup(const eoPop< EOT > &_pop)eoStochasticUniversalSelect< EOT > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, const EOT & > [inline, virtual]

Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_stochastic_universal_select.html b/trunk/paradiseo-eo/doc/html/classeo_stochastic_universal_select.html new file mode 100644 index 000000000..10605485a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_stochastic_universal_select.html @@ -0,0 +1,59 @@ + + +EO: eoStochasticUniversalSelect< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoStochasticUniversalSelect< EOT > Class Template Reference

eoStochasticUniversalSelect: select an individual proportional to her stored fitness value, but in contrast with eoStochasticUniversalSelect, get rid of most finite sampling effects by doing all selections in one go, using a single random number. +More... +

+#include <eoStochasticUniversalSelect.h> +

+

Inheritance diagram for eoStochasticUniversalSelect< EOT >: +

+ +eoSelectOne< EOT > +eoUF< const eoPop< EOT > &, const EOT & > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoStochasticUniversalSelect (const eoPop< EOT > &pop=eoPop< EOT >())
 Sanity check.
+void setup (const eoPop< EOT > &_pop)
 virtual function to setup some population stats (for instance eoProportional can benefit greatly from this)
+const EOT & operator() (const eoPop< EOT > &_pop)
 do the selection,

Private Types

+typedef std::vector< unsigned > IndexVec

Private Attributes

+IndexVec indices
+

Detailed Description

+

template<class EOT>
+ class eoStochasticUniversalSelect< EOT >

+ +eoStochasticUniversalSelect: select an individual proportional to her stored fitness value, but in contrast with eoStochasticUniversalSelect, get rid of most finite sampling effects by doing all selections in one go, using a single random number. +

+ +

+Definition at line 44 of file eoStochasticUniversalSelect.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:56 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_stochastic_universal_select.png b/trunk/paradiseo-eo/doc/html/classeo_stochastic_universal_select.png new file mode 100644 index 0000000000000000000000000000000000000000..7a1be51ae71711d45ed27d9ef1e1108da5d7fd3a GIT binary patch literal 2011 zcmb7FdpMNa8XqZ&WZGf7WJakI!p?O{xg@sQqJ$xuZ(I&)PuNE$GlPj!sWTx(iP?C*G4M69ZZUx2vwn`22$*&6PGYiCx5rOc z3(B&RQKUECG;ts`n%BZ;52d$P9N382pi>XOvpQ6CNiLIqGWxfmx=wcgvG+rRQ`h5D zuK>H#V^RlVhfy|!se07ZLb!I%^-bodCB(X^Slo-~jMv0dtD>FN#wrEmWPp!7Fuol; zw>J@Ka4nIHU1xr;?7p$k75Q>+E<9Ez(U3PwDmFT@zX}@Yeam40oprOwR?Auo9wB2N zJnqdKFHsFX&APi1qhC8?RBI50x(U^v)#Yv26i5g77p>bk{JhlE6!H~-uLDk`R7%mzi41#l3^58so0*@qYc6iIUP8^k7@q~6;Ko?6=vX@RA&^Eso1 zfn8t-o59U=Wt&dYNW-KQvV$Y4WQyQJ>cYOIxZS|cdw@?|v>KxF6hp-}k(|eT5B8>c zjrN_>Hn#KH=(efR<{H5B-X>M{+ZS-Cd87_#2w;FQn4paP z#qgm*XV$b??MM%WYdX$Gbss>wRKVOaK=s*@RZO4$Od-ED-@Bj;Z_?b+p!bVZ(qGgp z=U%0APLPFf;XvD@tXa!OGrG-ht&NZ}4;J;fj}42CUH-rZ1xkwps5w5~hsM)e2VM=W zryl&#`FU6kHB|eZg>Y2bL{Y#$5S(3kWH}aE(@d38VYQ|N`oL258Say_D?=OBP(wvw z3_1Jzu*K8Q{!h`LQ~29ks4Qfc(X$nnAN324%6|#Rty<1KWD+^r_K7c*Ki2SCU7i#4 ztIx*IH2qZASLfi~_YGC(xOmQp>bHPj1Ox+Dy|xe*&CjEe=U-_DX&UKdtaEGS`)w{T zYjP?{xCw|N;EORcl)F)_zTxxl<2jj@h6=(Au^(rioCY+GGW(y8h%{Zp&a(Z27pz(w z9=*g+gf}>;jPp}guo7|Kl5e(tz3%8J)0m zwU}hcWszmy4n8$))(|C{4W}3j{6M1*cd~PTLcW2Vbzq@xPr?ahcqW{{ z$Sm}+)LnYE)HlN%@<-N5meh9r{7~04P;dwopl8-oTHa*?(_iTDTKysh1XmZ9EI|!e zeoSJ%N4A4mmz{SIL{g{mRgS;RAS5~(K zRTs`57|)zZYjEsOkIR5qaaV0e)q4lA4@sG-(+!4MH}1Hil|$zIaKW%2HmVR(RAWV* zsMOfKYJM`i%q%OZlx>%*Y}YB;Q4GNke%j~OsB}_5TS0<;c7&X2%WOL@z`4K2pNJy4 zzqvxnzZaK@jnQ!%(FUC-Oj<=`(3{L_GDuecgOrZH1|w!ghvrt%KFk)1o?6RyR=JRT zt}NZmHb5Hlm7HI%Hr6F#+BeyCF`ZWs3!IG~xJ7(-!g`AOfi4P{Y;>n*04&?V6ejKo?`vq%gc<#f%L0+xeszF z;a!2lcRTk_%}r`s;ECbHM%yWonBB^y-Q77{wfRoW5)*f)_DmR5gWH3qV{i}y2wbQu zzzM52hCe+fsRV=uVf6u4ONBO1@cFA~dGh7~Mn9=S?7KYqV^}QzusMDrtIcm_xagLqe2DSSEXs3MU+m*V$XzkqR90K~=z_wsJ+P(l-J5()f4d h@CN}@h+dV-RZjfmZmK06k^RJoBhKzl<&FV={}-S12zLMg literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_string-members.html b/trunk/paradiseo-eo/doc/html/classeo_string-members.html new file mode 100644 index 000000000..0417f9346 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_string-members.html @@ -0,0 +1,48 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoString< fitnessT > Member List

This is the complete list of members for eoString< fitnessT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
AtomType typedef (defined in eoString< fitnessT >)eoString< fitnessT >
className() const eoString< fitnessT > [inline, virtual]
ContainerType typedef (defined in eoString< fitnessT >)eoString< fitnessT >
EO()EO< fitnessT > [inline]
EO() (defined in EO< fitnessT >)EO< fitnessT > [inline]
eoString(const std::string &_str="")eoString< fitnessT > [inline]
fitness() const EO< fitnessT > [inline]
fitness(const Fitness &_fitness)EO< fitnessT > [inline]
fitness(performance_type perf) (defined in EO< fitnessT >)EO< fitnessT > [inline]
fitness(void) const (defined in EO< fitnessT >)EO< fitnessT > [inline]
Fitness typedef (defined in EO< fitnessT >)EO< fitnessT >
fitness_traits typedef (defined in EO< fitnessT >)EO< fitnessT >
invalid() const EO< fitnessT > [inline]
invalidate() (defined in EO< fitnessT >)EO< fitnessT > [inline]
invalidate(void) (defined in EO< fitnessT >)EO< fitnessT > [inline]
invalidate_worth(void) (defined in EO< fitnessT >)EO< fitnessT > [inline]
operator<(const EO &_eo2) const EO< fitnessT > [inline]
operator<(const EO< Fitness, Traits > &other) const (defined in EO< fitnessT >)EO< fitnessT > [inline]
operator>(const EO &_eo2) const (defined in EO< fitnessT >)EO< fitnessT > [inline]
operator>(const EO< Fitness, Traits > &other) const (defined in EO< fitnessT >)EO< fitnessT > [inline]
performance(performance_type perf) (defined in EO< fitnessT >)EO< fitnessT > [inline]
performance(void) const (defined in EO< fitnessT >)EO< fitnessT > [inline]
performance_type typedef (defined in EO< fitnessT >)EO< fitnessT >
printOn(std::ostream &os) const eoString< fitnessT > [inline, virtual]
readFrom(std::istream &_is)EO< fitnessT > [inline, virtual]
storage_type typedef (defined in EO< fitnessT >)EO< fitnessT >
Type typedef (defined in eoString< fitnessT >)eoString< fitnessT >
worth(worth_type worth) (defined in EO< fitnessT >)EO< fitnessT > [inline]
worth(void) const (defined in EO< fitnessT >)EO< fitnessT > [inline]
worth_type typedef (defined in EO< fitnessT >)EO< fitnessT >
~EO()EO< fitnessT > [inline, virtual]
~eoObject()eoObject [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]

Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_string.html b/trunk/paradiseo-eo/doc/html/classeo_string.html new file mode 100644 index 000000000..3df25962f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_string.html @@ -0,0 +1,104 @@ + + +EO: eoString< fitnessT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoString< fitnessT > Class Template Reference

Adaptor that turns an STL std::string into an EO. +More... +

+#include <eoString.h> +

+

Inheritance diagram for eoString< fitnessT >: +

+ +EO< fitnessT > +eoObject +eoPersistent +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef char Type
+typedef char AtomType
+typedef std::string ContainerType

Public Member Functions

+ eoString (const std::string &_str="")
 ctor
+virtual void printOn (std::ostream &os) const
 printing...
Methods from eoObject
readFrom and printOn are directly inherited from eo1d

virtual std::string className () const
 Inherited from eoObject.
+

Detailed Description

+

template<class fitnessT>
+ class eoString< fitnessT >

+ +Adaptor that turns an STL std::string into an EO. +

+ +

+Definition at line 42 of file eoString.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class fitnessT>
virtual std::string eoString< fitnessT >::className ( void   )  const [inline, virtual]
+
+ + + + + +
+   + + +

+Inherited from eoObject. +

+

See also:
eoObject
+ +

+Reimplemented from EO< fitnessT >. +

+Definition at line 74 of file eoString.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_string.png b/trunk/paradiseo-eo/doc/html/classeo_string.png new file mode 100644 index 0000000000000000000000000000000000000000..a82209d818498713f244999b98ecf94bc3bf6710 GIT binary patch literal 971 zcmeAS@N?(olHy`uVBq!ia0y~yU}OWb53n!;Ns+r3gn*PpfKQ0)|NsAi%>Vxn%%7hy z0muU50|yRNANv0U$Ym@E@(X5gcy=R=fq^;E)5S5QV$R#yvC|eS2(&(3I$yJlVRQ34 z-m}5q_O~$Vas4YXQ5Nv~zW3xtQRT0ZB65>&`vtSs-VNq$d3pKnMR}tM3&oo|K6<}C z)%x;Gg1|3Zp0FArpOg*Ptd#3cZ;zC|mC}8&?O^+-iw7TESIKGH_Tl)mCtngczA}gj zw=1sup7i0M;O$hl*|*ksEVtPq+Z_36L+InG8wOw2w5P_Uu-UV1d%dT^H${P2vd-u* z$M!6P84VB`Q3C^;4I z_(Zed+08y#3#8)Hnd{$$@#kuOn7^wBBW?zn!b10 zwp*Ic-=668A3dY+@ylcGy)zHJu}MDhEyYU3EGGTK!C;kwB^w#8xwhr_>s3~~o1Xvq zfmmCm@JfwubBt$9aVlOfH*KTFtA|R?v&47UJ*j*cH%~kw_88M=r5SUd^F%LE|6LWk z+C9NSqxl`r`F?d~$t>fZg8ceLQuimm`)0`G%p3n9PoCM}$_Li>K<;4yQ%^Rd35`6? z#x`0j4pq(xFzYYSLxhM6+l%W4CjVL=PjdU=UuHDn;f#aF)IV&}RgaE$UGnpC_({#J zN1v&s{8oP`R;@L6>&AyKjhW}G@7rzE;eBlC+`oFs&qdbmStRzAfvu4H@T19RTe3US zDh0MD2}tBs>Tq?GC2u^-%yy#Wlrxt~p0$|l>xDb)jwEi_{QqWV+@Jmv4s1q$QrZOH zz4iZ+y)S)kMuWPtdxFHnlP3fv+E#cXyAmZLUma5T9@6S~-zsWiBag0R&D7Pk`@LS5 zc55wj&Skql-|j{5d*!u#D~~ALnjiDVe@jr-rGGZ6rSHo#E^a(pueC4QK;!?Vf2xI7 zpF1tv(ed%nyeo?iDJ{`5@(^zGe6-3bf|Vs_$+RiVPaIbn{gAr+VowT#QyPcrZYl1S zv)V;6&u%zx$eSdbR|8bF8@D2i$Jk`^3m6?fjN)C)78&qol`;+0Qh#fP5=M^ literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_subtree_x_over-members.html b/trunk/paradiseo-eo/doc/html/classeo_subtree_x_over-members.html new file mode 100644 index 000000000..8fb1bae9e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_subtree_x_over-members.html @@ -0,0 +1,33 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSubtreeXOver< FType, Node > Member List

This is the complete list of members for eoSubtreeXOver< FType, Node >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
className() const eoSubtreeXOver< FType, Node > [inline, virtual]
eoOp(OpType _type)eoOp< eoParseTree< FType, Node > > [inline]
eoOp(const eoOp &_eop)eoOp< eoParseTree< FType, Node > > [inline]
eoQuadOp()eoQuadOp< eoParseTree< FType, Node > > [inline]
eoSubtreeXOver(unsigned _max_length)eoSubtreeXOver< FType, Node > [inline]
EoType typedef (defined in eoSubtreeXOver< FType, Node >)eoSubtreeXOver< FType, Node >
functor_category()eoBF< eoParseTree< FType, Node > &, eoParseTree< FType, Node > &, bool > [inline, static]
general enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
getType() const eoOp< eoParseTree< FType, Node > > [inline]
max_length (defined in eoSubtreeXOver< FType, Node >)eoSubtreeXOver< FType, Node > [private]
operator()(EoType &_eo1, EoType &_eo2)eoSubtreeXOver< FType, Node > [inline]
eoQuadOp< eoParseTree< FType, Node > >::operator()(eoParseTree< FType, Node > &, eoParseTree< FType, Node > &)=0eoBF< eoParseTree< FType, Node > &, eoParseTree< FType, Node > &, bool > [pure virtual]
quadratic enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
unary enum value (defined in eoOp< eoParseTree< FType, Node > >)eoOp< eoParseTree< FType, Node > >
~eoBF()eoBF< eoParseTree< FType, Node > &, eoParseTree< FType, Node > &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< eoParseTree< FType, Node > > [inline, virtual]
~eoSubtreeXOver()eoSubtreeXOver< FType, Node > [inline, virtual]

Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_subtree_x_over.html b/trunk/paradiseo-eo/doc/html/classeo_subtree_x_over.html new file mode 100644 index 000000000..c6b6ee0e6 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_subtree_x_over.html @@ -0,0 +1,109 @@ + + +EO: eoSubtreeXOver< FType, Node > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSubtreeXOver< FType, Node > Class Template Reference
+ +[ParseTree] +

eoSubtreeXOver --> subtree xover +More... +

+#include <gp/eoParseTreeOp.h> +

+

Inheritance diagram for eoSubtreeXOver< FType, Node >: +

+ +eoQuadOp< eoParseTree< FType, Node > > +eoOp< eoParseTree< FType, Node > > +eoBF< eoParseTree< FType, Node > &, eoParseTree< FType, Node > &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef eoParseTree< FType,
+ Node > 		EoType

Public Member Functions

 eoSubtreeXOver (unsigned _max_length)
 Constructor.
+virtual std::string className () const
 the ckassname
+virtual ~eoSubtreeXOver ()
 Dtor.
+bool operator() (EoType &_eo1, EoType &_eo2)
 Perform crossover on two individuals param _eo1 The first parent individual param _eo2 The second parent individual.

Private Attributes

+unsigned max_length
+

Detailed Description

+

template<class FType, class Node>
+ class eoSubtreeXOver< FType, Node >

+ +eoSubtreeXOver --> subtree xover +

+ +

+Definition at line 42 of file eoParseTreeOp.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class FType, class Node>
eoSubtreeXOver< FType, Node >::eoSubtreeXOver ( unsigned  _max_length  )  [inline]
+
+ + + + + +
+   + + +

+Constructor. +

+

Parameters:
+ + +
_max_length the maximum size of an individual
+
+ +

+Definition at line 50 of file eoParseTreeOp.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_subtree_x_over.png b/trunk/paradiseo-eo/doc/html/classeo_subtree_x_over.png new file mode 100644 index 0000000000000000000000000000000000000000..521b5cc24a534e7495085d8fe70390f790d79f1e GIT binary patch literal 3181 zcmbVPdpOg58(-w{=2*@N$(bBp)v8rXX|v*S__0~!Q0ZjoG)u+|6~ZHOD$HVGHt}Fn zlcEF5DaD*7r<@*RIg@GjuAcY3uHL`i=Y9V8-rvuCU*GG#zSsA@KcD;h-gR+8$jfNT zfIuMm6USk$Adr-c7}sr-6x+=TD6)9daQPJp7l}k-C=%6?$)}UW=*Oz7s|$NA8Wp=6 zf?b{5Ku5-VE`UICk|$tCkvDVrr04j)Y9+hY25?ji_`$yY6L(x$7Yn)v>%6Y&tM-+f zDC86C$*?3{B`xz|z51@cY}Iu|nY1m^GU|OEbG51_wI=$_@+N)tH{6eKBw+j~s!hW|=3g%VErUQuQYJX5hwOC!aSeCa%P$jC)jbIxHX;3h&vo1a##BDe zwqSm#aA~gRE8(m))=CUlLXut^V7Q;|s~5XD*fbj*tdAb;vvbb;nz3B0HOPmh`!i`2e#EXWKB0DkKbWc)Z$lHTXlXcEm}4@Djt0EBa^cFZ$PnSeT9+Osu;$KX*S-O@ z^nk{Xi(i8%>`PaT_|#U@m;M_f!c(+0&+i0CZ&66Iq6sWZU!_*v@_s=5wr%LlkjIvA zr0L^)SC*rbnO}sCV5zC=g{5X0jy+2L#5)IgnRacE^VkEXY*Dd5g@=`eSyg zp~3*x1b5wlwoKipiW0b$y9-`mN;K*7V&pE|^Z0T}Ruuz=n=Da6 z($^WRu#Icde>|%`5$XRSC2B_`_4Ge<%`_z9WMV-1(SOCousewr zT`KR6w~1LiWOZLXVu!wVtz}iEM5}A$f2#yC^#~`I=z|QI)n3VyZ4i1Fi-kd2kn%)% z6^5MnR!#Sksao@nwB&5R4Hdp~_pa$9gmW2>$`W+u%MvsNquZrd&VM_ze=kW2aI?69 zTOg2@QF81vAqeE4n)u}F^%^TFaZ5DH&NXdeL{FL*&*Zpb!FLDm(K$ZhiiPNzU)oFyL02Ir3V_f z?>ZaJj?dyoE2p&cLeqwiH`zcnK3fFMj?Am*%+V4L-VJCd)>8Gw&EgrAE3j6yp`$tK zNpvo~d7xc&KFLdz1y8pPMnY|qWz(&FW7j*{GZw}dmBMj?TZs>b4gsuHaSrC*S?#v= znkvbHq_D)C!;R05CufTc+-$a_Pf&emo>F7Gy3A=lkzTb}4-QiajLiMLC49(<6I*0) zd$}6M(RUMh0DcV^z~gZm#xaI+rs3KMaHGTRv*!`bdsm_vw@Valn}YNkAcX_UU|&_= zhclL7AGxh&nr;NY)($0mTHC%r_m>jnUuHe+4hOrWI5}i@ciS5CqKZW&RG)*6|B;f<|DH+ZUoZ!@c-?T{>|(3ih% z=t^zR=ss!niNcFy%$GbNQ|ue)jqW;cvKrl+ZbEyTQgPqg8I~|hF1o;85QwxeteiUlT(!=Y($2(EmeN{HijbV z2l)nQ#|c)k!nS+!-cD*u+qVBM6vv@KzTt*PI5w1k6k}`!b$xnnc+Nj;6Tp@fnHKze z^YTx28m)dM;N(l95+7`AZNHUxa#VZpS?_TAl8{tNoF)URgwje7I{ig>hm>qoQde2F~RH^Ae zd|{~vpQ(zvQ27VodnZ;wc;2&7`Gn6t{sdJI14gtSBko2x=67K^Of5|;M|~uZzP@KP z%qKNA7%@Z9DG_(BF@K&$g#MU27hja~h#v1n=P)A6$!^mbR_?-ke_0qfF$f?;2%MAV zQM$AWlX^S$BS_eLo_7U%otJ8lnJKQic_3P^Xyu}^ zJ(0y0cuw~SCyxvxolDA!U9aF3g{eKuqPQYXDGCp~sMlJ$1HpBY2h2(144!dgQ`m<2 z!@ReKOa(K{JbF+!d8>uHuq>(Gxv + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSurviveAndDie< EOT > Member List

This is the complete list of members for eoSurviveAndDie< EOT >, including all inherited members.

+ + + + + + + +
eoSurviveAndDie(double _survive, double _die, bool _interpret_as_rate=true) (defined in eoSurviveAndDie< EOT >)eoSurviveAndDie< EOT > [inline]
functor_category()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
howmanyDie (defined in eoSurviveAndDie< EOT >)eoSurviveAndDie< EOT > [protected]
howmanySurvive (defined in eoSurviveAndDie< EOT >)eoSurviveAndDie< EOT > [protected]
operator()(eoPop< EOT > &, eoPop< EOT > &)=0eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [pure virtual]
~eoBF()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_survive_and_die.html b/trunk/paradiseo-eo/doc/html/classeo_survive_and_die.html new file mode 100644 index 000000000..f8531daa8 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_survive_and_die.html @@ -0,0 +1,49 @@ + + +EO: eoSurviveAndDie< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSurviveAndDie< EOT > Class Template Reference

eoSurviveAndDie A pure abstract class, to store the howmany's +More... +

+#include <eoSurviveAndDie.h> +

+

Inheritance diagram for eoSurviveAndDie< EOT >: +

+ +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase +eoDeterministicSurviveAndDie< EOT > + +List of all members. + + + + + + + + + +

Public Member Functions

+ eoSurviveAndDie (double _survive, double _die, bool _interpret_as_rate=true)

Protected Attributes

+eoHowMany howmanySurvive
+eoHowMany howmanyDie
+

Detailed Description

+

template<class EOT>
+ class eoSurviveAndDie< EOT >

+ +eoSurviveAndDie A pure abstract class, to store the howmany's +

+ +

+Definition at line 53 of file eoSurviveAndDie.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_survive_and_die.png b/trunk/paradiseo-eo/doc/html/classeo_survive_and_die.png new file mode 100644 index 0000000000000000000000000000000000000000..2d945e1a40361b4f6e72dad2d5e3bca54958fdcb GIT binary patch literal 1979 zcmb_dX;hQf7LDRi8N}B?FoCiJB#*cX6oMg?p#=dMip?MJSLoQ#nbCddkBs)io93!?!Op`_m zr2Ey+LgbR+Lvl-!sL;0Uc!>#oLI5@GUz;*zqPeEbZL6vhgV;Pqbx9e}``iW!b#n$2 zGEbzM4?HaksmU3OvNQqWFNF6K3b)L`si zAF~9LUZ7a^efd+N$qA$Jni=Q^u|bdP*u}7lpH7tC#pR|IXa1``;!IL}_`bnA_F1|e zOGrl7vtum^uMZpX=n3fMza|lL0=VF_KZ! zl=iB296|Wz;nu@l zj`vA$cG0-uq-(J#u#NyV?u4f5rf( zA;j8maY!Vo02m+XnB-r10FLmhY)X~}bsTRuN_H>b2{pf0r2;gWB9VPL(Yy0?so77s z7xfpkz7xQV{Q47d|0&tyOq2wdWE~!$ATD_t_(3=VxYgAicGRfO^uN zUpmdR@Xhq};vD{91w)+r)NCsldT~!2yyng$Oz~63QcGeGk3YDEKX(8eJ{;ga@d(a@lZMBKs;yge^tYFH-q3j_myEY90FnJG8e|%58SipVu z<7I$c**+jC?og%qEmz(tEQ!uhnhjm7HjBFYTxH(rh(#g~E^Mq+R(xKi1HION9RB+o z@Q%Pgo&S4Aew}}OU79Ktos$|5F29T3k`&%JUl*m1M@;bo9S=uOp zcc6uEcWN@0_0XCS0ipy%eh?tff)YK;yKJi#vYOX5pus~h?fUN>ismEDC_=bZs#@Y! zN=RU1z=bcsjtWAjFh|;5$2m(G2;=(0_>F zd2lL5k<0T`z7afNo^RlBMs`1TjhCZFnK!@AzRJe2b*E-c)c(i?&n`H`3>)rzQxVw0tY;lUd{3~+A`X>MY literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_sym_init-members.html b/trunk/paradiseo-eo/doc/html/classeo_sym_init-members.html new file mode 100644 index 000000000..cf2d5c99e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_sym_init-members.html @@ -0,0 +1,26 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSymInit< EoType > Member List

This is the complete list of members for eoSymInit< EoType >, including all inherited members.

+ + + + + + + + + + + + +
builder (defined in eoSymInit< EoType >)eoSymInit< EoType > [private]
className(void) const eoInit< EoType > [inline, virtual]
eoSymInit(TreeBuilder &_builder)eoSymInit< EoType > [inline]
eoSymInit(TreeBuilder &_builder, double &_grow_prob, unsigned &_max_depth)eoSymInit< EoType > [inline]
functor_category()eoUF< EoType &, void > [inline, static]
grow_prob (defined in eoSymInit< EoType >)eoSymInit< EoType > [private]
max_depth (defined in eoSymInit< EoType >)eoSymInit< EoType > [private]
operator()(EoType &tree)eoSymInit< EoType > [inline, virtual]
own_grow_prob (defined in eoSymInit< EoType >)eoSymInit< EoType > [private]
own_max_depth (defined in eoSymInit< EoType >)eoSymInit< EoType > [private]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< EoType &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_sym_init.html b/trunk/paradiseo-eo/doc/html/classeo_sym_init.html new file mode 100644 index 000000000..e7bd509d8 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_sym_init.html @@ -0,0 +1,67 @@ + + +EO: eoSymInit< EoType > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoSymInit< EoType > Class Template Reference

Default initializer, Koza style. +More... +

+#include <eoSymInit.h> +

+

Inheritance diagram for eoSymInit< EoType >: +

+ +eoInit< EoType > +eoUF< EoType &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoSymInit (TreeBuilder &_builder)
 By default build ramped half and half with max depth 6.
+ eoSymInit (TreeBuilder &_builder, double &_grow_prob, unsigned &_max_depth)
 Control the grow_prob and max_depth externally.
+void operator() (EoType &tree)
 build the tree

Private Attributes

+TreeBuilder & builder
+double own_grow_prob
+unsigned own_max_depth
+double & grow_prob
+unsigned & max_depth
+

Detailed Description

+

template<class EoType>
+ class eoSymInit< EoType >

+ +Default initializer, Koza style. +

+ +

+Definition at line 26 of file eoSymInit.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_sym_init.png b/trunk/paradiseo-eo/doc/html/classeo_sym_init.png new file mode 100644 index 0000000000000000000000000000000000000000..a0dcd81157486525602f6e0e67b038adc3c78ac7 GIT binary patch literal 1378 zcmah}eKeB`7~gnVG{kH)uA#4U?$DM@t}MAx%r~1!K1uC&^HL- zIw6lnAb=&$J-dTX7AOj3mq&j@|E}<i?%wXbTTCoHis(jo$ z$WK>E`!}R)sOCBBCrrH|w4}Y;p4!)dnM=^%Fr2$7pLgcoo}wc(lVTxqH{Q4J=KE-H zNa5JDYS_9$gY;*U<_0`0NimirST27ffm5 zNQ3%Q@vWjvvbNVjSr#SfEkn8b48T=T>vjvNjh7-A$~9!7Tc`Etf@rBAah8>Gc=^u= zCor8z1Ul`|b6W*Ly)@|lAK@tH3uk05E+f-m%O)g-g#5yW;s`B&KkKOos9Wfu1WCd7 zX+fc1?@4^A5l3_} z5ZATv$>Ft-kxQa6OS=VK`k0~>Iz{#fedhYPPs4 zvh-a8ZwOCwbUeD+@hh6*64*_TNS&3Y^2hw^%C`|XA*2MCEz8*3NBsui&Z&RHlX zFV`u0bF?NbSFBbeN6*!p(%>72S{h?bZkLXQD33ddZHTs*Z)UsU2d#*JC?2omvEPAX zYJafrR)xH^5WI}ntIZ-0WcUaJ7|Ku8N40V0ES6AQG7WDg9{Q)ZupvJOl~_Ny_=4TI t6T;|^>a?*-Ud`*6)-3}wR#?@Nfearv= literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_time_counter-members.html b/trunk/paradiseo-eo/doc/html/classeo_time_counter-members.html new file mode 100644 index 000000000..65bd58b6a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_time_counter-members.html @@ -0,0 +1,40 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoTimeCounter Member List

This is the complete list of members for eoTimeCounter, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + +
className(void) const (defined in eoUpdater)eoUpdater [inline, virtual]
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoTimeCounter() (defined in eoTimeCounter)eoTimeCounter [inline]
eoValueParam(void)eoValueParam< double > [inline]
eoValueParam(double_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< double > [inline]
functor_category()eoF< void > [inline, static]
getValue(void) const eoValueParam< double > [inline, virtual]
lastCall() (defined in eoUpdater)eoUpdater [inline, virtual]
longName() const eoParam [inline]
operator()()eoTimeCounter [inline, virtual]
repValue (defined in eoValueParam< double >)eoValueParam< double > [protected]
required() const eoParam [inline]
result_type typedefeoF< void >
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< double > [inline, virtual]
shortName() const eoParam [inline]
utime (defined in eoTimeCounter)eoTimeCounter [private]
value()eoValueParam< double > [inline]
value() const eoValueParam< double > [inline]
~eoF()eoF< void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoParam()eoParam [inline, virtual]

Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_time_counter.html b/trunk/paradiseo-eo/doc/html/classeo_time_counter.html new file mode 100644 index 000000000..14b3cd1ab --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_time_counter.html @@ -0,0 +1,46 @@ + + +EO: eoTimeCounter Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoTimeCounter Class Reference

An eoStat that simply gives the user time since first generation It has to be tempatized by EOT because it must be an eoStat. +More... +

+#include <eoTimeCounter.h> +

+

Inheritance diagram for eoTimeCounter: +

+ +eoUpdater +eoValueParam< double > +eoF< void > +eoParam +eoFunctorBase + +List of all members. + + + + + + + + +

Public Member Functions

+virtual void operator() ()
 simply stores the time spent in process in its value()

Private Attributes

+clock_t utime
+

Detailed Description

+An eoStat that simply gives the user time since first generation It has to be tempatized by EOT because it must be an eoStat. +

+ +

+Definition at line 38 of file eoTimeCounter.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_time_counter.png b/trunk/paradiseo-eo/doc/html/classeo_time_counter.png new file mode 100644 index 0000000000000000000000000000000000000000..ac711b4346524543ed27e087d73bb8693dfca370 GIT binary patch literal 1173 zcmeAS@N?(olHy`uVBq!ia0y~yU~~bp53n!;$-YVK{Xj}0z$e7@|Ns9$=Kuc(=Fd-< z0AzvjfddDs5B+}vEaktG3V`^+`c&mJZ+BJZ}TTftL$~S z8h2v`@|a+Da{_MJESt2~e1Q+od>#4zr~1%LBMzwq*l@3kMVlInXF**l7c28xD${Mp67!&8@q<$NrM2ls@U{Y!W~ zYTUwflvzZ6Lrlm-)(K(@7&95As6z?Zl(+Uf?61ha_Cw)k_tq!+p(zfcmI@+gZDJB? z9XZ;sm}8~0Yu;uBkPRmqQl2F9$mbP8KjLmvfSi?pxYrA)c%&zFDzd^nT=A$77cBweu_| zbsgi0<$2Dr_0R#$qdKdFQ`5Sh?|w0Pk@WvLp>xh2l_*Y{(=D&97glm3CH7*X@rrNu z=QZcK)-x6@=#p8X#BLut@q62*Q@&Y>1rM(6nUMdi>Ojo;#PBtOO^JRjHVzw|IG+7J z`uluc!z1Qt-CCO%&U}>$ec~u;8Q{tnGLbp-3DB>o%r4PN`*m05@UgEt(Wte~*lzBz zUi-2c+P4(nPTH4$kMBj#)aQWI0Ir(GDROK$a z@EEp|3y1ffPrBdr<5u4ziK~+QWr;^-C>?#6F-O?2>+z!*^I1zCiO$qswme31QFq<4 zjNq81E4uA8)5LGBUlMP&YX*=1xuc)B-?ppk?CpGI9o2G_GqmLG0@ zRw8j>4j(rtD4^ker)xczfwtJ;yR*4~p^qd1V!pd16}C#_-j1lLi&jf57|jb-kuYY+Kdyt8=jJ1^~RwTFGgZEh`l9d*Z1{m<^~+w1Dx_utj)-|J*5}OmYYlmI0 zesE0Oiw)9u^9mQLYg?J^#u22%h4 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_time_varying_loop_eval-members.html b/trunk/paradiseo-eo/doc/html/classeo_time_varying_loop_eval-members.html new file mode 100644 index 000000000..fcca79eac --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_time_varying_loop_eval-members.html @@ -0,0 +1,20 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoTimeVaryingLoopEval< EOT > Member List

This is the complete list of members for eoTimeVaryingLoopEval< EOT >, including all inherited members.

+ + + + + + +
eoTimeVaryingLoopEval(eoEvalFunc< EOT > &_eval)eoTimeVaryingLoopEval< EOT > [inline]
eval (defined in eoTimeVaryingLoopEval< EOT >)eoTimeVaryingLoopEval< EOT > [private]
functor_category()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
operator()(eoPop< EOT > &_parents, eoPop< EOT > &_offspring)eoTimeVaryingLoopEval< EOT > [inline, virtual]
~eoBF()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_time_varying_loop_eval.html b/trunk/paradiseo-eo/doc/html/classeo_time_varying_loop_eval.html new file mode 100644 index 000000000..6be63a7e2 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_time_varying_loop_eval.html @@ -0,0 +1,51 @@ + + +EO: eoTimeVaryingLoopEval< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoTimeVaryingLoopEval< EOT > Class Template Reference

eoPopLoopEval: an instance of eoPopEvalFunc that simply applies a private eoEvalFunc to all offspring AND ALL PARENTS as the fitness is supposed here to vary +More... +

+#include <eoPopEvalFunc.h> +

+

Inheritance diagram for eoTimeVaryingLoopEval< EOT >: +

+ +eoPopEvalFunc< EOT > +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + +

Public Member Functions

+ eoTimeVaryingLoopEval (eoEvalFunc< EOT > &_eval)
 Ctor: set value of embedded eoEvalFunc.
+void operator() (eoPop< EOT > &_parents, eoPop< EOT > &_offspring)
 Do the job: simple loop over the offspring.

Private Attributes

+eoEvalFunc< EOT > & eval
+

Detailed Description

+

template<class EOT>
+ class eoTimeVaryingLoopEval< EOT >

+ +eoPopLoopEval: an instance of eoPopEvalFunc that simply applies a private eoEvalFunc to all offspring AND ALL PARENTS as the fitness is supposed here to vary +

+ +

+Definition at line 84 of file eoPopEvalFunc.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_time_varying_loop_eval.png b/trunk/paradiseo-eo/doc/html/classeo_time_varying_loop_eval.png new file mode 100644 index 0000000000000000000000000000000000000000..7ee09de51fd2e21fb66d5f2ff356fcac05eda5f8 GIT binary patch literal 1928 zcmbtVYg7{08fBg~m9JYAsp++Htjt%EqBiKLXqt-G5uL;VH6> zkW74EANXj*0(E>O32B*+Qfx#SMI06v`7#$6wOq@CH0#vtti3i1zuX*3#bsL^y47f1f6jeZ|p zU0vjE&5SnvASpQTD}ej#7zO~)G4=KOGK6$@;qH^%a)<%U+@(yIts7_WW@o?R89u@U zcDf~J90?hDKxzCG4=0R$eOuH!_u32bW$e1bVs7_zZj$Ed{u$f2lyKX}9+F6`i7vIg z6bH667Sg9*<%_%p4w_u&lO3<{1+)u5UF+-X{r3#AzVmhSXW8jg!fVk$ovTgC7j+_U zDQ^Dk5&jR4EF+jvH+~3T9n5VgxSbN*Q+uR>O*vaM?vh8vy+10&dOyP65DbAhdtTpl z7^BLQ?mXp{IC}RRMl78&mY?j}#aY!P>VH8*2T0j!(rboC29u z8ry3=?Vjb5kHP!iOmLwsy-*O4<#4IEyZS1+n0++?IGJ$}O0ir_iQ2I?)q}`8XqaGU z6VKFn`%Lvp&NVF>aOy}dN8#f|`AZfi0h^TePs~S?BKA*1kVW^8;lnt`A6W!~8!GwE zOd}$qC#KE6p>EBDTF4Ua-E^f>+x#Lc-rk%eq0IKJE1&FQjehG#F_y}ts&{N0QX*hC zl=w(&I_brfEEBW?QLQpZa;#z}YDFrBv#Ag_r!RP_QqPkfs!qaSFFK1ylxsmb<=uyPQe}A`$W4@Ja5ZNhUQz%!*gDFA9J9R~zjf zTW{?l9QB|E$hy6DkqopGrwyC~Z7_89?Y*)}V2M;04hX9lDJ$z2Obd_&!JNM3D88AU za{2oW#BF_tv=9E!8cf5?g^P9mA;?!SNr&f)%r;RWa=?60{YTY4_w`D?7o+PBSI?G} zqQUVzn5SkVxZbl``tKCs8TKEP-iXUTleZuHD+N`nP3`?Qjd>?hC((85nm71EgAgMl zA5RJPzl)?CbiLwr^#Jhdd<~aQiz&Dk#>~@Oni){tUmYtrk(*nKMU7+9g5msxNV$ zxi);|%&O$3D;ngHO2Um`ef-+zpwGEW^(rqYB&*{VoAns?z$H#XdRHwAYgtT!NzE`3 z*$@HD5tOM?IrT#}mwck#N@3>J9vXgl0_i|>{KG3UnQDNL0u7nL3a9$6 ziH_q(j>|T^38&-j;+6e6@25KCJ6z>4LUWJuzE;HL4k1cvX!^?I99B1+Q~NR1&9U+l z;xnUkS?%A}9VWN&)zYjSb@B+o#Yz$~i91TQ-~8SEXfRlBc3pU?&>gkkD2r!hxec!c zfNB4i^#7@ZwrJb!`etZ}6Fj)3RX>Yge&c#{LL9`@#p2SQ2z7mM;T=mZTUq@bs)9S% zItWi}XP_25aAzgK+z$5+=hCErdT;T|#5k%Hv%nX4@O+KZvxnB~Oj4~*jGu`&qlTY< z8R~!ev{8C#ljtSaK$3PeLhZ#ENO#&@a{eCDJ^0kQK?v1Nk6JzjZ`$@mT?JG1cT$#tmOkDhS?kZ;Z3->Jke@G? z{W%)9T&_IS&OPKAchPo`qgS$X%l<749J~D`UAOmb77vQf=`3~QogULCLo*8xz~Q8$ z%yi8JD-pt#EYDYc$Tfl=Pz0dDeN&xwx2FyfH(Q*1JjHTPHLBo?9cp?3k(>iE%UG>y zq2lTriMbnrUpEd3f2HVeMipAOnu9oplQBfQ&6wDhN?hFN_@bkNXXE(P5#CB`yE@x@ zY*gy{Oewo1=93IK2b{v%qY~*|C9N@{6Qe81Q7l^ONGw8nOv + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoTimedDynUpdate Member List

This is the complete list of members for eoTimedDynUpdate, including all inherited members.

+ + + + + + + + + + + + +
className(void) const (defined in eoUpdater)eoUpdater [inline, virtual]
eoDynUpdater(eoUpdatable &_toUpdate) (defined in eoDynUpdater)eoDynUpdater [inline]
eoTimedDynUpdate(eoUpdatable &_toUpdate, time_t _interval) (defined in eoTimedDynUpdate)eoTimedDynUpdate [inline]
first_time (defined in eoTimedDynUpdate)eoTimedDynUpdate [private]
functor_category()eoF< void > [inline, static]
interval (defined in eoTimedDynUpdate)eoTimedDynUpdate [private]
last_time (defined in eoTimedDynUpdate)eoTimedDynUpdate [private]
lastCall() (defined in eoUpdater)eoUpdater [inline, virtual]
operator()(void)eoTimedDynUpdate [inline, virtual]
result_type typedefeoF< void >
~eoF()eoF< void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_timed_dyn_update.html b/trunk/paradiseo-eo/doc/html/classeo_timed_dyn_update.html new file mode 100644 index 000000000..2bbff6743 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_timed_dyn_update.html @@ -0,0 +1,54 @@ + + +EO: eoTimedDynUpdate Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoTimedDynUpdate Class Reference

An eoUpdater to update an eoUpdatable object every given time interval. +More... +

+#include <eoUpdatable.h> +

+

Inheritance diagram for eoTimedDynUpdate: +

+ +eoDynUpdater +eoUpdater +eoF< void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + +

Public Member Functions

+ eoTimedDynUpdate (eoUpdatable &_toUpdate, time_t _interval)
+void operator() (void)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+const time_t interval
+time_t last_time
+const time_t first_time
+

Detailed Description

+An eoUpdater to update an eoUpdatable object every given time interval. +

+ +

+Definition at line 67 of file eoUpdatable.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_timed_dyn_update.png b/trunk/paradiseo-eo/doc/html/classeo_timed_dyn_update.png new file mode 100644 index 0000000000000000000000000000000000000000..eb2daa08b1d9356e7dc34142ccdbb33d9b8ba156 GIT binary patch literal 762 zcmV5HM6hJW@+9NI|(FTLZuLqPn+#;)@rGfIN zg#vBjzMa<|&@O=IF6mIYuL4D5%9R@ z517#JN1yve9^3C^{txMYx7X3P+waThSN2?Jp@kM&=(nLok6nWHgTeYIY?6k*OVp|Vr)U9ZSjiUHCc>9w4AQ+CU@3kA+Dmwxto0l5xBVT zrssaR-19q4==Y;Vk3F3hJtnl!LJKYQ#c9!Fm!b2K7Us*}(^(!kJ>iGQkIANVmL^_` zkRD;jWcSb}X`y`BG^Mj7%QSiqz!IG$8SZ76bZmBJ-wSl?xj)9sJ;!uRHl@o=jP0`Y z)IOIMJ@#~3^q9~>3oW$J7pFy!U4Z6~)=hL(k7j?4@1aQ&Sd35W`6m`9s*KZF!Nhkn zRb?Z3uF47;V5hOxRXtT!=C+x}hVH4de&vSK169`RIep&YRBfWl2Ku`lHFiX^FUAA3 z=?+)vHTzsz^w`sB(PKgjEws==Uz~;$rZ;_}GNGyanysZa-_(4Q0(HJrxmB^Sa#M;; z9nvm`f)JtzayQ@y?%uBgamvlO>Oi}BDvM}}2${6fggFW_4gSqfsc=!j-J|IhbEe#p zj$t(oP|~hlJFRQlM|&ja-s;?2qBmXBvGQ$PIYiG+_xD}&oMuAL>GM`wDtGU><~<*p s>Wq@j>3#kIT6KrZxkvW7^r>Iu{}xqe;DieaKmY&$07*qoM6N<$f=d;4CjbBd literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_timed_monitor-members.html b/trunk/paradiseo-eo/doc/html/classeo_timed_monitor-members.html new file mode 100644 index 000000000..406552d1a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_timed_monitor-members.html @@ -0,0 +1,29 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoTimedMonitor Member List

This is the complete list of members for eoTimedMonitor, including all inherited members.

+ + + + + + + + + + + + + + + +
add(eoMonitor &mon) (defined in eoTimedMonitor)eoTimedMonitor [inline]
eoMonitor::add(const eoParam &_param)eoMonitor [inline, virtual]
className(void) const (defined in eoTimedMonitor)eoTimedMonitor [inline, virtual]
eoTimedMonitor(int seconds_) (defined in eoTimedMonitor)eoTimedMonitor [inline]
functor_category()eoF< eoMonitor & > [inline, static]
iterator typedef (defined in eoMonitor)eoMonitor [protected]
last_tick (defined in eoTimedMonitor)eoTimedMonitor [private]
lastCall() (defined in eoMonitor)eoMonitor [inline, virtual]
monitors (defined in eoTimedMonitor)eoTimedMonitor [private]
operator()(void)eoTimedMonitor [inline, virtual]
result_type typedefeoF< eoMonitor & >
seconds (defined in eoTimedMonitor)eoTimedMonitor [private]
vec (defined in eoMonitor)eoMonitor [protected]
~eoF()eoF< eoMonitor & > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_timed_monitor.html b/trunk/paradiseo-eo/doc/html/classeo_timed_monitor.html new file mode 100644 index 000000000..fc8c1608d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_timed_monitor.html @@ -0,0 +1,59 @@ + + +EO: eoTimedMonitor Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoTimedMonitor Class Reference

Holds a collection of monitors and only fires them when a time limit has been reached. +More... +

+#include <eoTimedMonitor.h> +

+

Inheritance diagram for eoTimedMonitor: +

+ +eoMonitor +eoF< eoMonitor & > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoTimedMonitor (int seconds_)
+eoMonitor & operator() (void)
 The pure virtual function that needs to be implemented by the subclass.
+void add (eoMonitor &mon)
+virtual std::string className (void) const

Private Attributes

+clock_t last_tick
+int seconds
+std::vector< eoMonitor * > monitors
+

Detailed Description

+Holds a collection of monitors and only fires them when a time limit has been reached. +

+ +

+Definition at line 40 of file eoTimedMonitor.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_timed_monitor.png b/trunk/paradiseo-eo/doc/html/classeo_timed_monitor.png new file mode 100644 index 0000000000000000000000000000000000000000..8e1ad8fecb9e7ad5f522ab9e1ba57c5d92992369 GIT binary patch literal 645 zcmV;00($+4P)JyfBNmB`<_^UN{6@+_Sd1>3qmdA8H#(M>p(#J zdvVt=;k|_O|Mo}Y=dj|>g^$bgh0EpV>B1}Qg$X8@V1fxI=&-!`iUMsTC51ICHqnNv zx<=UYQV6}vwH5`9FLgn zO`A8o#UO1?2uEpiLbz#|@Lq!D%?AmVH%&0X1QSd!p&D><_{E>>(S(uUczs=6At$am zJM5vI@s7`7eZZdJxQ@4%XWZiDVSM6z68NIyBM)B6yzdHLdUR0$xm6_R9e+E$=;d5* zfqoCQ5R2oDMOcd9`vU($TLB>6=>4SNWu2NHmYapnTR8oi6q>z|%Cr|M$X+B7mXUDZ fFyXy~)BpCraiX`3C?yN`00000NkvXXu0mjfq|PTt literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_timed_state_saver-members.html b/trunk/paradiseo-eo/doc/html/classeo_timed_state_saver-members.html new file mode 100644 index 000000000..57345bb04 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_timed_state_saver-members.html @@ -0,0 +1,28 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoTimedStateSaver Member List

This is the complete list of members for eoTimedStateSaver, including all inherited members.

+ + + + + + + + + + + + + + +
className(void) const (defined in eoTimedStateSaver)eoTimedStateSaver [inline, virtual]
eoTimedStateSaver(time_t _interval, const eoState &_state, std::string _prefix="state", std::string _extension="sav") (defined in eoTimedStateSaver)eoTimedStateSaver [inline]
extension (defined in eoTimedStateSaver)eoTimedStateSaver [private]
first_time (defined in eoTimedStateSaver)eoTimedStateSaver [private]
functor_category()eoF< void > [inline, static]
interval (defined in eoTimedStateSaver)eoTimedStateSaver [private]
last_time (defined in eoTimedStateSaver)eoTimedStateSaver [private]
lastCall() (defined in eoUpdater)eoUpdater [inline, virtual]
operator()(void)eoTimedStateSaver [virtual]
prefix (defined in eoTimedStateSaver)eoTimedStateSaver [private]
result_type typedefeoF< void >
state (defined in eoTimedStateSaver)eoTimedStateSaver [private]
~eoF()eoF< void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_timed_state_saver.html b/trunk/paradiseo-eo/doc/html/classeo_timed_state_saver.html new file mode 100644 index 000000000..ecaaf95b8 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_timed_state_saver.html @@ -0,0 +1,65 @@ + + +EO: eoTimedStateSaver Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoTimedStateSaver Class Reference

an eoUpdater that saves a state every given time interval +More... +

+#include <eoUpdater.h> +

+

Inheritance diagram for eoTimedStateSaver: +

+ +eoUpdater +eoF< void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoTimedStateSaver (time_t _interval, const eoState &_state, std::string _prefix="state", std::string _extension="sav")
+void operator() (void)
 The pure virtual function that needs to be implemented by the subclass.
+virtual std::string className (void) const

Private Attributes

+const eoState & state
+const time_t interval
+time_t last_time
+const time_t first_time
+const std::string prefix
+const std::string extension
+

Detailed Description

+an eoUpdater that saves a state every given time interval +

+ +

+Definition at line 104 of file eoUpdater.h.

The documentation for this class was generated from the following files: +
Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_timed_state_saver.png b/trunk/paradiseo-eo/doc/html/classeo_timed_state_saver.png new file mode 100644 index 0000000000000000000000000000000000000000..b5f7f43bde244078e61a0af6edab760f53177a3f GIT binary patch literal 648 zcmV;30(bq1P)V;tTKR+a zomdhuKr3&OO@&IZrzojSnq5dt9gS&@Pw1N`t96J;(-VBwTRd5*o6zgMXXh>^aPZtS z&1pHT`GaBf`DpWFFQ?6q8Ev%DMjL%_+WgpIXt~ltdAy$%dyxGEEm2>SZPH>*$cnHZ zQP*UT(6M(K>^@IABcfN_r4|-ec?Yk|Xx4fdmWMAm~RS!%D z&rp5=Ci4mcKe#ZjJP(yCL!~|U2!#%e1@Cep74Rk_rMwk`yGQe1DI$Qk<;~sbAT&Tv zXZg6E3u%)oL`O<#x-L}jI**shUDc53P?cPn96H(y?Oi{4r#Y7v&1p`OJ3y(R|Dph> i-cN_o=c9N1BL4xbuakf|?7h_h0000 + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoTransform< EOT > Member List

This is the complete list of members for eoTransform< EOT >, including all inherited members.

+ + + + +
functor_category()eoUF< eoPop< EOT > &, void > [inline, static]
operator()(eoPop< EOT > &)=0eoUF< eoPop< EOT > &, void > [pure virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< eoPop< EOT > &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_transform.html b/trunk/paradiseo-eo/doc/html/classeo_transform.html new file mode 100644 index 000000000..1d1691c26 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_transform.html @@ -0,0 +1,39 @@ + + +EO: eoTransform< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoTransform< EOT > Class Template Reference

eoTransform transforms a population by applying genetic operators on it. +More... +

+#include <eoTransform.h> +

+

Inheritance diagram for eoTransform< EOT >: +

+ +eoUF< eoPop< EOT > &, void > +eoFunctorBase +eoDynSGATransform< EOT > +eoSGATransform< EOT > + +List of all members. + +
+

Detailed Description

+

template<class EOT>
+ class eoTransform< EOT >

+ +eoTransform transforms a population by applying genetic operators on it. +

+ +

+Definition at line 38 of file eoTransform.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_transform.png b/trunk/paradiseo-eo/doc/html/classeo_transform.png new file mode 100644 index 0000000000000000000000000000000000000000..721e07d0182773a14f0deccbadc57eecb320da77 GIT binary patch literal 2201 zcmb7GXH=7E77hf0;ui=k<&(f50xrQqFeuG&lwKnc7|VjGVvx2nmVjkof*(kUkz_{@ z1O*+WsIU|xDkUKlMG2@7sR=^Fp^2abg=8|bf7~CQvwO~S-}kxixzBmqJ?GwwL3nSZ zwuv?j21EM#c!a=U@O3KQtN~Yz5B7~wRTCH#5bCK^DpgdeY%VGyu~qCZYi@2n!&i>0 zT(uJ+cmiyXOdJV=t+Dg<*c-|ym?`LHy|F>HnPtCxYmhdPwWRr@tKG|9pL1`=`-$Z+ zH1mzv_tD)GKNFLBgJi`1ZcPSPbh7*R{yBm*^*Z6?xq&o0(LF`L>Q-u%AWt1Z>QEUB z+CpON16Umf2XTjpmr^onKR)&B=tGR%Z}F#;S;xhIzsW`n1iPZWDx#k5P9w|Y=p)mT zXl7__jY;DjMI-2D;G_?1djwQlgW_oocNe%=Mzqj8Jg-(Tlx)5_uHuFeh4l8?1XR?Pk&KoWT{-!~k1e@Cy8nh^Fho4Hta;!lDJD zyGSAaVn}*Grr_Z{6)h{BoFQFwy~W$fw!bvXWlZVcw;vNRri}V5X1HzHG9JN1=6Y*o z2s?@i4rjE=RgUF}HxJ0m!LgqIuyuG06PN+@No&q)LiwJ_QUo;I@_rAJ#LJW_4Y4qH zBP0C{p(r^ewMmuj?7i;16L&yBISMg4DITTbq7eEwa_vN{6!S?)5bMbwVF zz|jO;QmqeNNZ$KRs6;9;Uar%N+K0kUqOiCB2R!mJX}qmoCLb`;09-Tx+yCIiI%dI% zup)V1LBFlFsd-nZ(aEqo3fXdTGrKl}+$m=89OoH4-&ju)uf#~e01m!;*4g39Ve&sN zM-urc-8!zNR|+`-3B3zy91kqdp08}A6_I^vF5|)oUR&0+x2w7L+9I5Px#xf{rCn9Tvc}!2500BKaJ%&(f;TV3uu<9Nlz=80gn!!S!*bMuLZQRNJGFt1%(P52`aD zZKj8ymc1WDAsy>Z$4=(g-4J7h&Ygyt@IENEp^lJKQyg95-x*cPEkZ}ST4#8hX6m`# z3QU^BBneuCGbM0r<)jTT$jU`PH%qWFf5Tcyn?8lE0l$Jdds&CyF8phS_+h^VNpxLT z(>vX*`MSq};;{b;{aW^a^TQ?Uu9ep)&u(p4k&GCw{Yp=-u-x{sUX~DHlYorxXF1LH zjx;^4cO7fE`YbSFxnJg$V)3rga+`&=d{$Nz-4X6)8g8{WW^H{jMsZpb8g7_Nk2W?v zrw3T&u_w$EgT1d*ghyd(Yx*o7D^WB2X4b#5ZoZh>=+MC1$?d61fn%+PPp3LLQhBXi z6E1>1R6>pKyWOfU8PG=#r&^@79l@A1I3qj+r)CPcA+kecupgq7rq+?uKFx65WZUt6 z|0ei>l$OPzF7P$XNS*Yt$uU^46525N(1Eg`BYd$?+-iJcXjJHmqvjz9lk zlO@%cW^gpBt;HF^yj|=%#X3ORxMX0~?TbDeX^a)Oy`g&Ag^hpzaxpJ=qM|T=T%%ez zFeHlrR!Vzz|Gd%@812tP9^!RxL=37uIllyHoHO6Z!ObGQ}? z($h76>X8rTn0I)i!db;T9M>PV>UX4|yiF&PBS5QdH!X22w^`N!Y&O4Dt+TR|KuyFA zfo=MTgUGW53<`^QJmhUzV;17-f`3zcQIx{3QXe{S%v^P;Dpm@eFB!X;`-NlJ-g?1y zbkl^5O-dytArZs@9&c8=E2;un;{}2K(Kt*`B_+FM6Hqv2dc?eC&wTf;Hnl16^Z8au zxHij4`^x?}-0&uUNB12Wfjw9*N59Dvu#dfh6+Id=6_9XHz{?+ukXkMh9cULOPan>V z_a>JIXA!8?!Hk$#8~cE0_i93MIi(u0gC(JfYw4 zIXT1abYbz#v(5SAbH<5jrSu*|ZuepnMCPFP)0*@kOQuu@3XBUs{=PnBE=4L)%oERi zuc`#Un}bQJ(*5!WY&yDdh1S7I5^B*3Uv1vKVWASOfEVAprz^&9xvc6VV7{JskGpQ9 GU;Y3Km+OuI literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_trunc_select-members.html b/trunk/paradiseo-eo/doc/html/classeo_trunc_select-members.html new file mode 100644 index 000000000..0f821eac5 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_trunc_select-members.html @@ -0,0 +1,21 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoTruncSelect< EOT > Member List

This is the complete list of members for eoTruncSelect< EOT >, including all inherited members.

+ + + + + + + +
eoTruncSelect(eoSelectOne< EOT > &_select, eoHowMany _howMany)eoTruncSelect< EOT > [inline]
functor_category()eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
howMany (defined in eoTruncSelect< EOT >)eoTruncSelect< EOT > [private]
operator()(const eoPop< EOT > &_source, eoPop< EOT > &_dest)eoTruncSelect< EOT > [inline, virtual]
select (defined in eoTruncSelect< EOT >)eoTruncSelect< EOT > [private]
~eoBF()eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_trunc_select.html b/trunk/paradiseo-eo/doc/html/classeo_trunc_select.html new file mode 100644 index 000000000..83d84bc6a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_trunc_select.html @@ -0,0 +1,111 @@ + + +EO: eoTruncSelect< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoTruncSelect< EOT > Class Template Reference

eoTruncSelect selects individuals after truncating the population using eoSelectOne as it's mechanism. +More... +

+#include <eoTruncSelect.h> +

+

Inheritance diagram for eoTruncSelect< EOT >: +

+ +eoSelect< EOT > +eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + +

Public Member Functions

+ eoTruncSelect (eoSelectOne< EOT > &_select, eoHowMany _howMany)
 Ctor: from an eoSelect (and an eoMany to tell how many are kept for selectino.
virtual void operator() (const eoPop< EOT > &_source, eoPop< EOT > &_dest)
 The implementation repeatidly selects an individual.

Private Attributes

+eoSelectOne< EOT > & select
+eoHowMany howMany
+

Detailed Description

+

template<class EOT>
+ class eoTruncSelect< EOT >

+ +eoTruncSelect selects individuals after truncating the population using eoSelectOne as it's mechanism. +

+Therefore eoSelectMany needs an eoSelectOne in its ctor It will use an eoHowMnay to determine the number of guys to keep, +

+ +

+Definition at line 43 of file eoTruncSelect.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
virtual void eoTruncSelect< EOT >::operator() ( const eoPop< EOT > &  _source,
eoPop< EOT > &  _dest
)  [inline, virtual]
+
+ + + + + +
+   + + +

+The implementation repeatidly selects an individual. +

+

Parameters:
+ + + +
_source the source population
_dest the resulting population (size of this population is the number of times eoSelectOne is called. It empties the destination and adds the selection into it)
+
+ +

+Implements eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >. +

+Definition at line 56 of file eoTruncSelect.h. +

+References eoSelectOne< EOT, WorthT >::setup().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_trunc_select.png b/trunk/paradiseo-eo/doc/html/classeo_trunc_select.png new file mode 100644 index 0000000000000000000000000000000000000000..25f6be7e12b3786576f74ba9b759d4a50b99e295 GIT binary patch literal 1891 zcmbW2Yc!kL8plI#nlq&?nO=w!&M~|wHKRq9Dxwmk=^K@fgA}a}Z7HD`Br|ADGDn9r zQ>}3sn%AAQR$W3k1dXPmgG!Z-R)aJyDREC-CT8ZW<(xJ1Wj^e^|NB{cueG25{ylrs z@VHZZ;0NI_7;F#5-4%qvwwWk(%l2)`9%9X>oW=)2V6dGl7}t~DaXHhuPZ{@Z_o9VGBHYo6k-r@ap_CA7E_J-O zVSvtR*NA7TIl0Zn!H3nnYvn)g(!Ab1P1Rj(5LySN3{g{dCo`XH{|EHuB=8j;j$*2I z-e%1kUcEk0)O(40&ln>ece^?Syrk5TDZAZk&A=RO>A05-Z3qMT$M@Xx9l1T(dYe_D zG2}fM&aQN^7z-@Xs2boznOh=VrX$yu;Cx9~r6Vy0AZtiFJfsq8Wj%w_f>;Wm56!)J zelgRKES3mIWzQl%%FGD&gzk5Jm_thgkZm37Q=<_f)XQlz6EvM+E4Mh^VM5I-iM-~q zEEMF@3ev&$>BYdl#@@IAk?b=Jy?#-Vez^oYyX#@}aF-QX!bA1m2%^^NE`*Wp;!T)m70MD0Y&TnJ&UEj z-8hSm&r4quZt}s^TK0*N2-X*tQhoQA^Gx7zv?;HADN!?km|tT(Dq&= zZ2WpowJ|zK8bvu$9Bog=mfa0WyMjFO_yiKlDMid5kHtOlA*G}aJTnShK#c2z4(+RG zUWJ=HpMh>(#*~BjTjLjH>Hr)R7{n;B(66rw4aN`a}%fWyRofeai6=3UcQ^`F!p4s zwu6!-H3;VXJ62m{C%@Q$LP83uaKc&-{LfZx*`Nj`W|dP3-ZT=C|IqXfrTx;*Eyr^K zEFub~Bxc?6cj2EN{Ls!%DrsbqCx_&PpVizHdp1QFLJr;j1MKT{nR78jAY-VR`_8rU zn$S@M%{zJo7#Mxrkk$IS3+M~bJ6?@f)0vi=ROq6%*~=0;{B zt@Exm93AP`G*NdwQPHnpG#M;-u~O}z{?147PGrC%PrTRM#(s2(>to4FsPgGL))3s$ zp!4_q=Y;uif7VCYKP26joU{I_!|8ci*}*A7O-`<#;1*&M1XtT;&Mq3TzO`ilL!9+-;|39{Wa|j?(ZA!FiSzH+9 zfW}^>yBw7A_K!Q78x7W|LMR?he>3ZN5B>Oz>E%;+L2%HWR#3qB`ayuaa66=ThSk(3zRR$`;PC1bdX*}qmjO-8H-6sj zhhTV=+NYior~t_FQ4plyW~C8Xd0;;r()$sUmS%7vMg0d(9Of!lzd6jefVu4stIa^S zZk?p3FsiXi5WFZkk=Wt7m_WwXD&FQqd9L+mQ8&xYN=#0~jZ93kXZ|?*s`YTZ(G^U* z%Ic^3o3In!s5%32hj&<@n8|9!Un)!IFB|n=tH&C@*(2M8-px0db%35J+8=r|h;_s* zyI_B4dS-~puVHMH=!(e6%Ql=|7xpSf<|jmJLwY~y@R#t_nT+o55fm82T(*DBuMf>$ z8MA2aT9b0Pv&Lhx+FNcLjRb)v!dL9@u8A7ED{9VC`19IIg7#6_*e7-A%p&Y@077MH zX#{ci0kX@Jm7l{(mxmlH+gTsLh9H))1h= Y4)t-&&j!X1D1Ss4290yAaz3B@3*rrA2><{9 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_truncate-members.html b/trunk/paradiseo-eo/doc/html/classeo_truncate-members.html new file mode 100644 index 000000000..4b7ce0107 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_truncate-members.html @@ -0,0 +1,18 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoTruncate< EOT > Member List

This is the complete list of members for eoTruncate< EOT >, including all inherited members.

+ + + + +
functor_category()eoBF< eoPop< EOT > &, unsigned, void > [inline, static]
operator()(eoPop< EOT > &_newgen, unsigned _newsize)eoTruncate< EOT > [inline, private, virtual]
~eoBF()eoBF< eoPop< EOT > &, unsigned, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_truncate.html b/trunk/paradiseo-eo/doc/html/classeo_truncate.html new file mode 100644 index 000000000..4c54b06cd --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_truncate.html @@ -0,0 +1,43 @@ + + +EO: eoTruncate< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoTruncate< EOT > Class Template Reference

truncation method using sort +More... +

+#include <eoReduce.h> +

+

Inheritance diagram for eoTruncate< EOT >: +

+ +eoReduce< EOT > +eoBF< eoPop< EOT > &, unsigned, void > +eoFunctorBase + +List of all members. + + + + + +

Private Member Functions

+void operator() (eoPop< EOT > &_newgen, unsigned _newsize)
 The pure virtual function that needs to be implemented by the subclass.
+

Detailed Description

+

template<class EOT>
+ class eoTruncate< EOT >

+ +truncation method using sort +

+ +

+Definition at line 49 of file eoReduce.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_truncate.png b/trunk/paradiseo-eo/doc/html/classeo_truncate.png new file mode 100644 index 0000000000000000000000000000000000000000..812f1ba99e9ffff7c0a59737aa973fdcbfbac87f GIT binary patch literal 1843 zcmb7FdobJC9*^yA(i>7)EKQK8+oH2+MN2)`HkP(-Bi>q!v(Ku0 zt5+C|j}&i=K5?kZug*P4@$E+ur>FJuqD7KudZ4Y1c}`05Nvm!i@ALR{0?&g1hdRDA z?f!SI{d~wjObjW2LWiLg?Jh1QD3Rr}4_lALUD5%WHucvj(03b%`Vm`Wb5$yrW~F?^ zGJ7`hF_hWgY4Q{$d+Sie>$HNJ(|RtRMhFkYY7Hc%MQ&eU7Og)F*?wXazpQw~kvof1 zl(r;N?_YRs2|y+W-A3L zY?L*;&d8__x`ZCx=h!#K5w+Dt;AbQac)Op@*zese8H``}>Fx>@h~87V$l37xfeD5` z0}((t8%L6^%MG;oSXgJeyoV#l8rueN zaZH+{_6g$&=~~s;E(_iTZ8FxM0dY$$Ydl#i>SZOaOHm}}M{~Zzm=26N_C+s?Vy8s< zFKNisTRGROKf9XZx1@2?yAf8Ks}@J9UqfE2h1ZE;OuMsM^r@qcoE*j+N2#MK|Cl0D zeeQpQTq(o)KOeG``!XPfEU0%hlKFq2bx^_{OKS|ASs6>3lz1+EZhUyBsvV%82P%WF z2LHkh97f()7DvRf=uiA=mc4J?4=pyhzkI$`0N%^fpx2YL?*-%wCiphB4#`J>WBgmt zIZlhOb49t4iw+gl(75{&%J4kx?$>TH(0$Y1FSRH7$T$$`ni=Ue2Dfo8Lv1{@eH=FB zCsfUv+M1^E#Db}6D>@bEC?tI>k{}n}YQ-26;|7}-g+KE5Id!w%cbg&H@`6{UHLS~Y z?_sBzp)mc^X9^C)MNrm)tt@Woz7#%|WOQVqjWRCjXE{CW0hxpn;BwpFJXnW&L1_V~ zoFQK^HVRlIKQQ>g9XFk1mwC3^>=6C$FI4=X8sOaX#?zBW=GkJ#_$2SyR&NYUjn=^e@-u%|fZMqZJ}kntp)d0&sf9+~z;a7gw7&zq*CmGMdxD zvCwG!=4&AErh_)FodNZ3UDmJYrP_ITcWa|>7%LyfJ`Uj)6TpgRo*S0(2lhug1sA~2iTIE0w~9NIXsuyNgrcDymRy`WjN3jXO+oAl zbiZv43m@e%3A2(8Ns_VNVgi0Nt9j4ivrAoq45HA0H2{ofE&jQxLi|~!X20nfd?G${ zD_aQ;n!x%0;tZPX-a)Oeb^cJyd*}U2@}{Nr$hSx3Rrlr)W9rxVdv-bv2nvdP5_EA- zlL9vCvqFts{Q0Z3jdPf*O%M5mlHk`r3#hL;zeq1iEZS8UE|+t_Y~KcJc8Ipz#abI1 z2SX3t)e>NPw>|(o{3xqXD*AQ;z8}ohn;hmKOQ1nKB15-s`jUQH`DzWcBS7lJzkm^zvkpahvMvQPR7t!`&2O|8S>;9?8-&)6hQj(Sgiz4M1 ST4bt!IEcF&$+gCXeC@y5GiB5O literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_truncate_split-members.html b/trunk/paradiseo-eo/doc/html/classeo_truncate_split-members.html new file mode 100644 index 000000000..eaa415030 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_truncate_split-members.html @@ -0,0 +1,21 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoTruncateSplit< EOT > Member List

This is the complete list of members for eoTruncateSplit< EOT >, including all inherited members.

+ + + + + + + +
eoTruncateSplit(eoHowMany _howMany, bool _returnEliminated=false)eoTruncateSplit< EOT > [inline]
functor_category()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
howMany (defined in eoTruncateSplit< EOT >)eoTruncateSplit< EOT > [private]
operator()(eoPop< EOT > &_newgen, eoPop< EOT > &_eliminated)eoTruncateSplit< EOT > [inline, virtual]
returnEliminated (defined in eoTruncateSplit< EOT >)eoTruncateSplit< EOT > [private]
~eoBF()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_truncate_split.html b/trunk/paradiseo-eo/doc/html/classeo_truncate_split.html new file mode 100644 index 000000000..13b8c679d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_truncate_split.html @@ -0,0 +1,54 @@ + + +EO: eoTruncateSplit< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoTruncateSplit< EOT > Class Template Reference

deterministic truncation method using sort +More... +

+#include <eoReduceSplit.h> +

+

Inheritance diagram for eoTruncateSplit< EOT >: +

+ +eoReduceSplit< EOT > +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + +

Public Member Functions

+ eoTruncateSplit (eoHowMany _howMany, bool _returnEliminated=false)
 Ctor: must provide amount of reduction, and whether or not you need to return the eliminated guys.
+void operator() (eoPop< EOT > &_newgen, eoPop< EOT > &_eliminated)
 do the jonb

Private Attributes

+eoHowMany howMany
+bool returnEliminated
+

Detailed Description

+

template<class EOT>
+ class eoTruncateSplit< EOT >

+ +deterministic truncation method using sort +

+ +

+Definition at line 47 of file eoReduceSplit.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_truncate_split.png b/trunk/paradiseo-eo/doc/html/classeo_truncate_split.png new file mode 100644 index 0000000000000000000000000000000000000000..49ca7c95961023bedb7f8c1f4c13d80cfa19a8cc GIT binary patch literal 1855 zcmb7FYgCfi8pfu}WLZ|nQqb(OoEddSG|@bnQW`^6qN9?Px6(4aq!AJ}pq5i!QqUYr zM?prd97Uz&Exe>A`7vYZs7NZPgrAoQMMRFKfpVDEnz3{KwC2a&``yoa-o5sI-e<2j z)f0o((}n6nAP_ybHcHoX^92Si z$nO&&?jFQ7zOMKTt^m8SsG7!4o&Ke3Lhje=(DzN)3N-3h(~(%@aOOSWdA9=;igpEY z82hN`_CZT0bfay{Z<$7>GV&kqIUaPYv+ZtJE**aaTFnOEV6%_kn2DS z?J0Y+lIL6?!^TXu3sbg`4aB_K-hLUD;;S$iMuXQ0nfAJP_5u0t69K%M5#mDzQMy$z zhIht338!0$ST~pY69_w9#7ZEsjTTsE@dEjh6PM3QP%j^hru#Xd>N=Dc0I@Yb_73I# zBsX0Q`A}$_u^zS9C|}6@Arn98;o+ZBKR4PR9RB4VZXf0dt(0*yMI2OXt54wfMd#Il zk4qEceiE7=uMd+RbQj_K``l$~$8v=mf3>dNks0z))@E-RzUIKGe@XzSnsbFS zE6M6gMl1L;9)X}G0X=`&^22Ql{})8X3sx?+q#z?A99!8!Wb?knRlajC2PS^_l%P+t zWyIvZ8vUZ?Vu{rIw4UhfEoM{`qRnmBhA-ZSr7qRy->JfK3F)f$B4|)z{PyoG&N)2{ z{<>jD#R(;KsJs|$$VB7J)`i3R;$4E%*+cC>=6mjQEF&X3lppsPZ-7>mUb%XlV4mE4 zPZ_TFx*;l|l*!iRzrEXme8us)L1npHZ%kEO;G4$e&XsH}za}Ms>&8t(DTb#5P!&Jq zhYxdr3;8VYuZ}jH=U~}(#L9?y71j)=?!cNATyC;o6^{@B)*?UOJK6=nZ!`5> zv|oHNq#cJdekEsNtWWtSL9E7N||U2fVlIbbsF zvoP6X0J!%qiXtByU2n+We_`UjF1K=YPdQcL${3dbIblhXw1n}md5U2CXzpC`;sYqM zNL>o>5v~lRtoK>W?pH?WCRsy=&bWu2bNTxH6L!02=u=QJ^fGl*x?B}|TH4UftA3`d z;@lh#yyU42L?tgJg`FCEGR>>^t*0qNTdou;4j=-xo|;Xl>i)=wNGHY7*&Qx_KC?t# zSctc#Hzy|nlG(1*Px$q3VOERtky?L(X*E(>Q+R~q5kE(rZL2KhMeq^T6_&9GXWK7@ z4VP9d$5E;kT5wa1;yL+7XS{H>%1M&%%;&(*B;2aIBFo7+VKZN~b*Al#s>*JpY}~J2 z42SNrijnQho__hvv(pl2(=pg`yRs;cp;)+C$Ad+O3TU{d@AeL@R~2SV+QlDPvZaa~ zLw<{$s!8$#EscDYPtOqz>gO&)qw|Us16VbK;0<;P9U{~vn|uRM>jWoF-vOk!!y?v` z3{7?b?=R8!-bcL>N130UTlt$wv{iW(R699J6W@1a0Cq5Rsto@}d^d Z=r9*f7NtPWm}$Em#0`ZxR_Ss+@xPmZyfpv- literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_truncated_select_many-members.html b/trunk/paradiseo-eo/doc/html/classeo_truncated_select_many-members.html new file mode 100644 index 000000000..35069f8cc --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_truncated_select_many-members.html @@ -0,0 +1,23 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoTruncatedSelectMany< EOT > Member List

This is the complete list of members for eoTruncatedSelectMany< EOT >, including all inherited members.

+ + + + + + + + + +
eoTruncatedSelectMany(eoSelectOne< EOT > &_select, double _rateGenitors, double _rateFertile, bool _interpret_as_rateG=true, bool _interpret_as_rateF=true)eoTruncatedSelectMany< EOT > [inline]
eoTruncatedSelectMany(eoSelectOne< EOT > &_select, eoHowMany _howManyGenitors, eoHowMany _howManyFertile) (defined in eoTruncatedSelectMany< EOT >)eoTruncatedSelectMany< EOT > [inline]
functor_category()eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
howManyFertile (defined in eoTruncatedSelectMany< EOT >)eoTruncatedSelectMany< EOT > [private]
howManyGenitors (defined in eoTruncatedSelectMany< EOT >)eoTruncatedSelectMany< EOT > [private]
operator()(const eoPop< EOT > &_source, eoPop< EOT > &_dest)eoTruncatedSelectMany< EOT > [inline, virtual]
select (defined in eoTruncatedSelectMany< EOT >)eoTruncatedSelectMany< EOT > [private]
~eoBF()eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_truncated_select_many.html b/trunk/paradiseo-eo/doc/html/classeo_truncated_select_many.html new file mode 100644 index 000000000..247fbe3c9 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_truncated_select_many.html @@ -0,0 +1,121 @@ + + +EO: eoTruncatedSelectMany< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoTruncatedSelectMany< EOT > Class Template Reference

eoTruncatedSelectMany selects many individuals using eoSelectOne as it's mechanism. +More... +

+#include <eoTruncatedSelectMany.h> +

+

Inheritance diagram for eoTruncatedSelectMany< EOT >: +

+ +eoSelect< EOT > +eoBF< const eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoTruncatedSelectMany (eoSelectOne< EOT > &_select, double _rateGenitors, double _rateFertile, bool _interpret_as_rateG=true, bool _interpret_as_rateF=true)
 Ctor.
+ eoTruncatedSelectMany (eoSelectOne< EOT > &_select, eoHowMany _howManyGenitors, eoHowMany _howManyFertile)
virtual void operator() (const eoPop< EOT > &_source, eoPop< EOT > &_dest)
 The implementation repeatidly selects an individual.

Private Attributes

+eoSelectOne< EOT > & select
+eoHowMany howManyGenitors
+eoHowMany howManyFertile
+

Detailed Description

+

template<class EOT>
+ class eoTruncatedSelectMany< EOT >

+ +eoTruncatedSelectMany selects many individuals using eoSelectOne as it's mechanism. +

+Therefore eoSelectMany needs an eoSelectOne in its ctor

+It will use an eoHowMnay to determine the number of guys to select, and push them to the back of the destination population.

+And it will only perform selection from the top guys in the population.

+It is NOT a special case of eoSelectMany because it needs to SORT the population to discard the worst guys before doing the selection

+However, the same result can be obtained by embedding an eoTruncatedSelectOne into an eoSelectMany ... +

+ +

+Definition at line 53 of file eoTruncatedSelectMany.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
virtual void eoTruncatedSelectMany< EOT >::operator() ( const eoPop< EOT > &  _source,
eoPop< EOT > &  _dest
)  [inline, virtual]
+
+ + + + + +
+   + + +

+The implementation repeatidly selects an individual. +

+

Parameters:
+ + + +
_source the source population
_dest the resulting population (size of this population is the number of times eoSelectOne is called. It empties the destination and adds the selection into it)
+
+ +

+Implements eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >. +

+Definition at line 77 of file eoTruncatedSelectMany.h. +

+References eoSelectOne< EOT, WorthT >::setup(), eoPop< EOT >::shuffle(), and eoPop< EOT >::sort().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_truncated_select_many.png b/trunk/paradiseo-eo/doc/html/classeo_truncated_select_many.png new file mode 100644 index 0000000000000000000000000000000000000000..af27f8039a1726655f78398d9e45bb8f9006f0fa GIT binary patch literal 1960 zcmah~dpMNa8Xv0TvLDy2L{r$3`9@5+&5jcG#LP4pA98D4iU>Qo#Uw;YM%(qncAYN9 zY-wf`YBLOnu#KY{3}qXIuqU?+B5Ite{q&r3p3~XqkM*wKTF>*oYrX6Dd*78#bhKBH z*OZ6BUlTUKt>;xEnRXHhuE#bvHzja$vz1Eq%a)+eqqVg)zHRfh zWGNL5I=aBDr=FjI!DOs(7#r8P(z&wU+!70AyWTT{*A+tJQU;n)5P#Nlaoy%kfwD9_ zYkvt!6bnvD>AX0hwLF1jM{TqyCJJ_Fy2w1*>_jR9QQHYniVO{A3tT43Yol_FclIBn zlMo3V8HZA!MBxC3y3b->iOG^mSNsXb)aXYkeGHqmLCp2z4>4Ys&2(o}ggLQ^!*eqQ zIt7vF0ev&Y5XZB8oR`z@)5qb{^}|i9aj-zec&C1#hd8FQVE?vH;Si4 z%i({#6PNBwzbd2?Es7@Ns?_HBI3&BemR%%Z7>@D3(P_%ddTZ6>$(Y@UWK@a+!P4~m zOW=(o@Ynt|G;y85kuxc3r#EKygxR}MEEj1#?W!j64*PO^C<1vrm*z;T%%2q+N`ru`sRH-$4y92c(sE0K9;%`69dlx`?J>WCjaYxuU#p< z-ocqm+wIBGu^K;-#wTosnZl84MhvJwb%yWp$mD^4ZHgA8jOl3 z2kVb(oGfU?4TDegCl!yry7+-{3hF=w+P*jXa#_vRajB9&Tig$eos z=RutI+^YBo`!m(Lh{?+`ZSh1s7GDL*)nb3g$dr)xncF`pd6OHt5_?77xe!9Pq9&vy zZQy|VR&6My%iSUULTECmJZ7u(m-NVMe~q;N+Wi1kC(XHBZ%j0OOda}kjHKIqb`(hi z#nI1$+U3$u{Mg{IhnzdN1|TM_ta|*AfxXrqMr7y9;1g`$sIbAQ+t5>KHT`ymHK32F zvJm(~Chn<^L9U}e6lsg?3ONPn9HmDH!-sOf0eM>KO(D+rlFS!4Nn2yd{5A&cT|^OH`Wb4V7{8Y zdlLE=Yhok4axl(rg&Ksva_4ThB>Q^j>W+RHJQuchHAc7r7JX>BEH&#l|R=&qg2u<(SQE z61=4H{@-q(Oc>36nyZg{{3npZV9u$Gf;)pPHCjgvY4-wFI?2yA*!B8TgCRv$`)`GZ z^WKZPhVx7SC?XGg*7(kGU>ESnul)!q`+VM_GP4Tuex@H)L~bhxa5az4SbuZ@!rGloEc)-HA4y)wNK!MTl7Y9#&aEYkc3;oO?c%W~a z(FCRFH{TVg4no1J9cCS(<@w`}ycm$7rGX&94D4FqoXoL|`n~>b<5-k@tgnIlO6A)b z5HD4(xkH91|EdR+*Updrp{fG?Rok%6wn>f4gN{ZvH@hhpb=;DCt1#R#M-0=}FXf;3 CYlKVy literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_truncated_select_one-members.html b/trunk/paradiseo-eo/doc/html/classeo_truncated_select_one-members.html new file mode 100644 index 000000000..0b5027f2b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_truncated_select_one-members.html @@ -0,0 +1,25 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoTruncatedSelectOne< EOT > Member List

This is the complete list of members for eoTruncatedSelectOne< EOT >, including all inherited members.

+ + + + + + + + + + + +
actualPop (defined in eoTruncatedSelectOne< EOT >)eoTruncatedSelectOne< EOT > [private]
eoTruncatedSelectOne(eoSelectOne< EOT > &_select, double _rateFertile, bool _interpret_as_rateF=true)eoTruncatedSelectOne< EOT > [inline]
eoTruncatedSelectOne(eoSelectOne< EOT > &_select, eoHowMany _howManyFertile)eoTruncatedSelectOne< EOT > [inline]
functor_category()eoUF< const eoPop< EOT > &, const EOT & > [inline, static]
howManyFertile (defined in eoTruncatedSelectOne< EOT >)eoTruncatedSelectOne< EOT > [private]
operator()(const eoPop< EOT > &_pop)eoTruncatedSelectOne< EOT > [inline, virtual]
select (defined in eoTruncatedSelectOne< EOT >)eoTruncatedSelectOne< EOT > [private]
setup(const eoPop< EOT > &_source)eoTruncatedSelectOne< EOT > [inline, virtual]
tmpPop (defined in eoTruncatedSelectOne< EOT >)eoTruncatedSelectOne< EOT > [private]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< const eoPop< EOT > &, const EOT & > [inline, virtual]

Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_truncated_select_one.html b/trunk/paradiseo-eo/doc/html/classeo_truncated_select_one.html new file mode 100644 index 000000000..439812046 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_truncated_select_one.html @@ -0,0 +1,115 @@ + + +EO: eoTruncatedSelectOne< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoTruncatedSelectOne< EOT > Class Template Reference

eoTruncatedSelectOne selects one individual using eoSelectOne as it's mechanism. +More... +

+#include <eoTruncatedSelectOne.h> +

+

Inheritance diagram for eoTruncatedSelectOne< EOT >: +

+ +eoSelectOne< EOT > +eoUF< const eoPop< EOT > &, const EOT & > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoTruncatedSelectOne (eoSelectOne< EOT > &_select, double _rateFertile, bool _interpret_as_rateF=true)
 Ctor from rate and bool.
+ eoTruncatedSelectOne (eoSelectOne< EOT > &_select, eoHowMany _howManyFertile)
 Ctor with eoHowMany.
+void setup (const eoPop< EOT > &_source)
 setup procedures: fills the temporary population with the fertile guys
const EOT & operator() (const eoPop< EOT > &_pop)
 The implementation selects an individual from the fertile pop.

Private Attributes

+eoSelectOne< EOT > & select
+eoHowMany howManyFertile
+eoPop< EOT > tmpPop
+eoPop< EOT > & actualPop
+

Detailed Description

+

template<class EOT>
+ class eoTruncatedSelectOne< EOT >

+ +eoTruncatedSelectOne selects one individual using eoSelectOne as it's mechanism. +

+Therefore eoTruncatedSelectOne needs an eoSelectOne in its ctor

+It will perform selection only from the top guys in the population. +

+ +

+Definition at line 45 of file eoTruncatedSelectOne.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
const EOT& eoTruncatedSelectOne< EOT >::operator() ( const eoPop< EOT > &  _pop  )  [inline, virtual]
+
+ + + + + +
+   + + +

+The implementation selects an individual from the fertile pop. +

+

Parameters:
+ + + +
_source the source population
_dest the selected guy
+
+ +

+Implements eoUF< const eoPop< EOT > &, const EOT & >. +

+Definition at line 98 of file eoTruncatedSelectOne.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_truncated_select_one.png b/trunk/paradiseo-eo/doc/html/classeo_truncated_select_one.png new file mode 100644 index 0000000000000000000000000000000000000000..70b8dd0e3f56c9445e38af5170c978686364996c GIT binary patch literal 1965 zcma)7e>~Ic9-p&b4Ow$5r%a-*bPCCJk&Yjc%8)3`=I*~3l(W+r2;`emC2rUNRrXe8a!ci~!^6$%xI&>&LWQD%MkAyt(RyoWXrMGI zJ}9RuKb~ic4{Ij=&`C^!6CZs4pf(>Pdze{mZ}8Nm z@$N3xO5(xKLkpGgxP(vGZ>LV4#(kM@+^Y}N$Zc0gz)4p9D&a9&bulRpFnep1Sisr5 z2gm9k>ppe@F|d4~E5d$|(%4nhGX22W-hL6Src+B=&dK*|ge>q4Eo>5I<;;+^z(C-8+FOn>_qtAz30WVqja zZal~Ry;{Q2Y`ELmGx{+X^3DxCjQ@_;o8g{%5;W5c^flZ|)~DpTNxB(JIlR2pLq)ZD znm|F@Gjni@<;}%I2|oQ2DzbJHcqL^I9pJi?h!2I=#N1YyWn5jv%keOii)5#$@KMH5_bbe8bx z@Eze0@Qt+rz*_@EqPc}NVIQOUVk}Q=2!MtQY-#a4TZ*ikh>RYSv44V<^qb9NC(!Ug ze~D~FexMErC(g55z|Zc~H@e|eW;Zk)9tzN#v@FFcF{IR2U>BK?@#In%N*tGgFBEUa zA^vv!SV{F&ZM|@@w-CA%)UI5BjjC4dsyQfxR#D&JI<=$U`HS39`Aob?y$eROMnMq| z4MPy++TpF8=*zP#eyoJk7SxvIju{;ktGr+3RKn&y%Bmf~9g|v6Zonh7M(5bfT~M#N zcVa;GxqiXpIdeaIbNHuh$#Q)#e?(i}*3EZ=h6Sz3KF2I=d)UAa`P}x`k@Hp5j~i6% zD`e)K*J!<~*%yB0gR7`P$lp$2(y}-HvYi?v4lepnczZ08JQ{)v7VRs$>hLv>Up2as z+;sGRNz?Y{r86)*9$fw<;q|})Df0D}7Al5W>?0_e^C{t5B)r~8a!B{D_HjC&oTaMe zv52)|=yB48I+^B)O+nSR-G%oIy9kVOToW-1Hg#s%uj|MFMK@q7ITKCPsBhkJt5$v@ z7*;O)ryz`b5%kC^xRYrukj#Ann9@78ynLgSXVcxqOR2ifv+py}ry%!XC1`r#IZMC- zF>@|HQhMO&hFn{cIfh~~R&y^o4KI%B`dA3ywe2T_M*xem>VQE?O28G)#V1-|LHB5X zhUi{M*gs&20+KI9m(7im%8pTi>6)($VOuI^t}Du6bng;+n??_Wx3F@KO;;RbAz@3Q%?=ug>b6WR|7NmPr8 zY=5gd##HJFxUOjS4{sA-(J!Mi5%cT=S@~-nO^({Q;!;mecV_OSY_m6Wr%87}6aIuz zg~f-CLz_Tw{5oHH#6`lg@!e0qe0I0k`#Y&q{v|tj3^|qwdw`$4_fc_~rG$>2#;BkLGQnGUp505a zV)NH>{dQ$ewC$QmeAC)bV0vx1wLz(2-w8D+*O8F7Ph(O2`m%|}{}uQjEE~D@*7o*q zWd@Sotx;*?Gio+!U$d~8VD;9SRWG^T?M-_#R&M?M5-m0Y#-@zX+wEwF#^3d!jJL9~bl=Bv zzJ$|h?FFYzfA-Sd5;=|w?YxNzPI^}vdwXA--(y=H5|$EUv;FEdq2(qxEQ$B%sT8{_ z;8?m-lJTg_|Jm%c_qk!>oWKcVw(X~KJVgtIt&Se?RPrp7<$R@c(wi&7EF-A5(Wjs~ zpq?JsYV$T@Css<7Vkd+}0lurLjIyqL58DLYt1Tslz%G(b==*l)RA!gUo+(MhyVZp literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_u_bit_xover-members.html b/trunk/paradiseo-eo/doc/html/classeo_u_bit_xover-members.html new file mode 100644 index 000000000..fac10346f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_u_bit_xover-members.html @@ -0,0 +1,30 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoUBitXover< Chrom > Member List

This is the complete list of members for eoUBitXover< Chrom >, including all inherited members.

+ + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< Chrom >)eoOp< Chrom >
className() const eoUBitXover< Chrom > [inline, virtual]
eoOp(OpType _type)eoOp< Chrom > [inline]
eoOp(const eoOp &_eop)eoOp< Chrom > [inline]
eoQuadOp()eoQuadOp< Chrom > [inline]
eoUBitXover(const float &_preference=0.5)eoUBitXover< Chrom > [inline]
functor_category()eoBF< Chrom &, Chrom &, bool > [inline, static]
general enum value (defined in eoOp< Chrom >)eoOp< Chrom >
getType() const eoOp< Chrom > [inline]
operator()(Chrom &chrom1, Chrom &chrom2)eoUBitXover< Chrom > [inline, virtual]
preference (defined in eoUBitXover< Chrom >)eoUBitXover< Chrom > [private]
quadratic enum value (defined in eoOp< Chrom >)eoOp< Chrom >
unary enum value (defined in eoOp< Chrom >)eoOp< Chrom >
~eoBF()eoBF< Chrom &, Chrom &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< Chrom > [inline, virtual]

Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_u_bit_xover.html b/trunk/paradiseo-eo/doc/html/classeo_u_bit_xover.html new file mode 100644 index 000000000..fe7fe465f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_u_bit_xover.html @@ -0,0 +1,112 @@ + + +EO: eoUBitXover< Chrom > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoUBitXover< Chrom > Class Template Reference
+ +[Bitstring] +

eoUBitXover --> classic Uniform crossover +More... +

+#include <ga/eoBitOp.h> +

+

Inheritance diagram for eoUBitXover< Chrom >: +

+ +eoQuadOp< Chrom > +eoOp< Chrom > +eoBF< Chrom &, Chrom &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + +

Public Member Functions

+ eoUBitXover (const float &_preference=0.5)
 (Default) Constructor.
+virtual std::string className () const
 The class name.
bool operator() (Chrom &chrom1, Chrom &chrom2)
 Uniform crossover for binary chromosomes.

Private Attributes

+float preference
+

Detailed Description

+

template<class Chrom>
+ class eoUBitXover< Chrom >

+ +eoUBitXover --> classic Uniform crossover +

+ +

+Definition at line 274 of file eoBitOp.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class Chrom>
bool eoUBitXover< Chrom >::operator() ( Chrom &  chrom1,
Chrom &  chrom2
)  [inline, virtual]
+
+ + + + + +
+   + + +

+Uniform crossover for binary chromosomes. +

+

Parameters:
+ + + +
chrom1 The first chromosome.
chrom2 The first chromosome. ::runtime_error if sizes don't match
+
+ +

+Implements eoBF< Chrom &, Chrom &, bool >. +

+Definition at line 292 of file eoBitOp.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_u_bit_xover.png b/trunk/paradiseo-eo/doc/html/classeo_u_bit_xover.png new file mode 100644 index 0000000000000000000000000000000000000000..64e9912ddecaa2864efe23ee0b9c6abe339785ec GIT binary patch literal 1836 zcmbVNX;hL~7)Hq@6Wg;Kn=-8&&B~0%Yy@*h%MF!s0n<5_xn;pbfJ;<5nx#!{nWp2Y zj55l}7DPZXGf&~J_+^rq8!00g?wB%Po$*X(e#|-3kNe)|-uv9;yw7vqo9yA{1k=*f zf-NE zLk+b_W2#2i7&^8`>6w>5PCGCnY%dS2f=Q4l9P?#DeCN*=J6m z@lpcqvJ{RmNW;*gj^N^nFiC=3!jo6eCIc5ZsOZ-OM%eCCaIr|9MAF4xJ5{f0SUR#GAHDMw;7kD97RNCec?W9=_wY=K7?)~OV2%E+p zaYbgEX45vrIQKdRnVmt3LOxp#uj(bMF?_ma>?#K`p~MoEzeP&)#j@%Kb@F6nsX8S_ z!&o!LE3L2|jBU&jw}S@8F4k0aLt_^>P9zepKSV9+HavHbT6EZ^z24R%gR~0f_!Ut| zb27icPEQ)qx!|?$a>CtU7Bp`YfBQi3DJf)c<3$b2@3M~ZP!EMFZYlpsSv7Y6>QwAd zCPqp{*tw5}W?G!5>MQ1RV}zdGXdfm>295WMjS1fa%=MKCk$aw>MTr_xvp29>st4tdEcTxr;ACxR8i?27+Mmi%?3OiBJ^J3 zJ5crh!8qbA3BA9sz`VfWP;8YWVih3sZe*6hkU zTiYK`uI(2~c&*E&c4Ktxohi7ZmN{RMYl<~P#pSpMg~l_QdZ}Qf@XLmF zuUG^M@~9&^?HfQIxb5-tiyFq@HZxF1t*m1_i0{iHvy;VP>Zi%T>#LPDDQ%bo?~k&>6P6*O4EsXemq z1;LXsM&WUlT<3U1;gS#g(@8Znj{L)<7DEQ+aX`s#2fLNbCdgQgR1v=rd=wA2xmX2@ znpYsuDD$H{)Ag279bYiN8k*u=RIQnbqj;f;>WZ4+^_bZ=?8v1%Y#ArfXJfu>*{D&# zRUoBxQA1~9?yjva2Hf68o!RBc;ErDd+PfF&mG`YNvZqq=T#gjhls&E2uL%6`=1L6n z^(K-P&0$3B)lYaomKpv2wk5j;cw9Rw*h#+S*F|Z`p4ZafNJcSSB3m$XzLyKGab@xV zcWm0v++qOX-uhC4Pu4it44g&y;ig7<-1lmjMD + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoUF< A1, R > Member List

This is the complete list of members for eoUF< A1, R >, including all inherited members.

+ + + + +
functor_category()eoUF< A1, R > [inline, static]
operator()(A1)=0eoUF< A1, R > [pure virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< A1, R > [inline, virtual]

Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_u_f.html b/trunk/paradiseo-eo/doc/html/classeo_u_f.html new file mode 100644 index 000000000..f1bcfcaf7 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_u_f.html @@ -0,0 +1,53 @@ + + +EO: eoUF< A1, R > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoUF< A1, R > Class Template Reference

Basic Unary Functor. +More... +

+#include <eoFunctor.h> +

+

Inheritance diagram for eoUF< A1, R >: +

+ +eoFunctorBase +eoPerf2Worth< Dummy > + +List of all members. + + + + + + + + + + + + +

Public Member Functions

+virtual ~eoUF ()
 virtual dtor here so there is no need to define it in derived classes
+virtual R operator() (A1)=0
 The pure virtual function that needs to be implemented by the subclass.

Static Public Member Functions

+eoFunctorBase::unary_function_tag functor_category ()
 tag to identify a procedure in compile time function selection functor_category
+

Detailed Description

+

template<class A1, class R>
+ class eoUF< A1, R >

+ +Basic Unary Functor. +

+Derive from this class when defining any unary function. First template argument is the first_argument_type, second result_type. Argument and result types can be any type including void for result_type +

+ +

+Definition at line 108 of file eoFunctor.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_u_f.png b/trunk/paradiseo-eo/doc/html/classeo_u_f.png new file mode 100644 index 0000000000000000000000000000000000000000..774c2e201169f0a1d5d2393d0a57321b53e5d064 GIT binary patch literal 644 zcmV-~0(}c=35>ZU84}+N9^{llMPDVfY$WM0UlL#=*w8Bm2uNXl?3Wea##n>eEgf!o7ks z0LTt8S5I>FA?7OH&h2upD+9zCcSG+2H`V z9Jsi4zBCW~!x;M=&d9-%1QM2d9*N*M1g>aUugq;m*2Z-Z4 z`^*qdxIu362jked49@!-?)tMZce!2{<`&;s;e-=TIN^j7?hFSr$ELQK7a`m$IPIR) zey{ROmFBYQF^(O&$4S|gZlBZS+*ul0oI1m4ciV`H9OQ`=ryJMxfCGqH#l^L2crDHu ztUF-DR-bh1HM>*Q#X>CV{n`z7*IK& + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoUnaryFunctorCounter< UnaryFunctor > Member List

This is the complete list of members for eoUnaryFunctorCounter< UnaryFunctor >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoUnaryFunctorCounter(UnaryFunctor &_func, std::string _name="uf_counter") (defined in eoUnaryFunctorCounter< UnaryFunctor >)eoUnaryFunctorCounter< UnaryFunctor > [inline]
eoValueParam(void)eoValueParam< unsigned long > [inline]
eoValueParam(unsigned long_defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< unsigned long > [inline]
func (defined in eoUnaryFunctorCounter< UnaryFunctor >)eoUnaryFunctorCounter< UnaryFunctor > [private]
getValue(void) const eoValueParam< unsigned long > [inline, virtual]
longName() const eoParam [inline]
operator()(typename UnaryFunctor::first_argument_type _arg1)eoUnaryFunctorCounter< UnaryFunctor > [inline]
repValue (defined in eoValueParam< unsigned long >)eoValueParam< unsigned long > [protected]
required() const eoParam [inline]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< unsigned long > [inline, virtual]
shortName() const eoParam [inline]
value()eoValueParam< unsigned long > [inline]
value() const eoValueParam< unsigned long > [inline]
~eoParam()eoParam [inline, virtual]

Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_unary_functor_counter.html b/trunk/paradiseo-eo/doc/html/classeo_unary_functor_counter.html new file mode 100644 index 000000000..99258b485 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_unary_functor_counter.html @@ -0,0 +1,96 @@ + + +EO: eoUnaryFunctorCounter< UnaryFunctor > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoUnaryFunctorCounter< UnaryFunctor > Class Template Reference

Generic counter class that counts the number of times a unary function is used. +More... +

+#include <eoCounter.h> +

+

Inheritance diagram for eoUnaryFunctorCounter< UnaryFunctor >: +

+ +eoValueParam< unsigned long > +eoParam + +List of all members. + + + + + + + + + + +

Public Member Functions

+ eoUnaryFunctorCounter (UnaryFunctor &_func, std::string _name="uf_counter")
UnaryFunctor::result_type operator() (typename UnaryFunctor::first_argument_type _arg1)
 Calls the embedded function and increments the counter.

Private Attributes

+UnaryFunctor & func
+

Detailed Description

+

template<class UnaryFunctor>
+ class eoUnaryFunctorCounter< UnaryFunctor >

+ +Generic counter class that counts the number of times a unary function is used. +

+Add a unary function through its ctor and use this class instead of it.

+It is derived from eoValueParam so you can add it to a monitor.

+Example: suppose you have an eoEvalFunc called myeval, to count the number of evaluations, just define:

+eoUnaryFunctorCounter<void, EoType> evalCounter(myeval);

+and use evalCounter now instead of myeval. +

+ +

+Definition at line 95 of file eoCounter.h.

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class UnaryFunctor>
UnaryFunctor::result_type eoUnaryFunctorCounter< UnaryFunctor >::operator() ( typename UnaryFunctor::first_argument_type  _arg1  )  [inline]
+
+ + + + + +
+   + + +

+Calls the embedded function and increments the counter. +

+Note for MSVC users, if this code does not compile, you are quite likely trying to count a function that has a non-void return type. Don't look at us, look at the MSVC builders. Code like "return void;" is perfectly legal according to the ANSI standard, but the guys at Microsoft didn't get to implementing it yet.

+We had two choices: assuming (and compiling ) code that returns void or code that returns non-void. Given that in EO most functors return void, it was chosen to support void.

+But also please let me know if you have a compiler that defines _MSC_VER (lot's of windows compilers do), but is quite capable of compiling return void; type of code. We'll try to change the signature then.

+You happy GNU (and other compiler) users will not have a problem with this. +

+Definition at line 118 of file eoCounter.h. +

+References eoValueParam< unsigned long >::value().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_unary_functor_counter.png b/trunk/paradiseo-eo/doc/html/classeo_unary_functor_counter.png new file mode 100644 index 0000000000000000000000000000000000000000..d92e9af37f559c8efaa03750fe970d8edadb9345 GIT binary patch literal 841 zcmV-P1GfB$P){004*t0{{R3)9Qfw0000OP)t-s|Ns90 z00960z@MLBkN^MxkN^Mxkifved&2+Z00001bW%=J06^y0W&i*J-$_J4RCt{2nOSnP zFbsh0mp)s*fqa5ad!hd+_dmjKEne6{N*LS@GBd=ngg$G5rpSGd9G~th4IG9y{DFZ0 zL-8raA$W+{b-~jV=^P_ogvWej9^q+yB+$Zj z_>>AB>v1I>N8(%M)0DQ6&llp)8-_Q$;fLS{|ImJKe7t%6-^M@w-5CGzc-$C2y7UZh zc*7gs@P;?M;SFzi!yA4v2ESgo_q!d#|2{lQ*CN&a6u{p5`ndSE`-cB@d`v&!i7P4Ai2C)zYPZ!e4#@3g3?bMV*+cwB}M({!;gBTSb zrI&+Q2&yeI?(m5~)qjFd9bR(ZR#DB>-IdSsk)|uF{1v=(=_tN=9&5)ivP@FKcr_MF zFSEha!UDhKuX&#;z6HOOQcKCqd+DWh+DE-Fp^F8NCAu@b=3d2``w|44;$O~vseIxg zAaW5y)ZlXo(rRs3W30jF%Gb7bSNS4X9Vb8aHXjXF;BkwxDLB{r&FAu#;J5zCG5ihi zgMVlb{x{=Kdpa@kK?IoV$6XeLb z?__G!_4sNrRC~VJ8vj9m}5@mDziEcjOp!`~S{_J{U=5AbA0 TQaTq#00000NkvXXu0mjfk + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoUniformAtomExchange< Atom > Member List

This is the complete list of members for eoUniformAtomExchange< Atom >, including all inherited members.

+ + + + + + + + + +
className() const eoUniformAtomExchange< Atom > [inline, virtual]
eoUniformAtomExchange(double _rate=0.5) (defined in eoUniformAtomExchange< Atom >)eoUniformAtomExchange< Atom > [inline]
functor_category()eoBF< unsigned, Atom &, bool > [inline, static]
mask (defined in eoUniformAtomExchange< Atom >)eoUniformAtomExchange< Atom > [private]
operator()(unsigned _i, Atom &)eoUniformAtomExchange< Atom > [inline, virtual]
randomize(unsigned _size1, unsigned _size2)eoUniformAtomExchange< Atom > [inline, virtual]
rate (defined in eoUniformAtomExchange< Atom >)eoUniformAtomExchange< Atom > [private]
~eoBF()eoBF< unsigned, Atom &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_uniform_atom_exchange.html b/trunk/paradiseo-eo/doc/html/classeo_uniform_atom_exchange.html new file mode 100644 index 000000000..2ef38aa7b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_uniform_atom_exchange.html @@ -0,0 +1,61 @@ + + +EO: eoUniformAtomExchange< Atom > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoUniformAtomExchange< Atom > Class Template Reference

Uniform crossover - well, not really, efficient for FixedLength. +More... +

+#include <eoVariableLengthCrossover.h> +

+

Inheritance diagram for eoUniformAtomExchange< Atom >: +

+ +eoAtomExchange< Atom > +eoBF< unsigned, Atom &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoUniformAtomExchange (double _rate=0.5)
+void randomize (unsigned _size1, unsigned _size2)
 randomize: fill the mask: the exchange will be simulated first to see if sizes are OK, so it must be repeatable : the mask has to be a private data, cannot be computed on the fly
+bool operator() (unsigned _i, Atom &)
 the operator() simply returns the mask booleans in turn
+virtual std::string className () const
 inherited className()

Private Attributes

+double rate
+std::vector< bool > mask
+

Detailed Description

+

template<class Atom>
+ class eoUniformAtomExchange< Atom >

+ +Uniform crossover - well, not really, efficient for FixedLength. +

+ +

+Definition at line 52 of file eoVariableLengthCrossover.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_uniform_atom_exchange.png b/trunk/paradiseo-eo/doc/html/classeo_uniform_atom_exchange.png new file mode 100644 index 0000000000000000000000000000000000000000..bb36e485203e77e17775b02cabf5ebbcf6a66030 GIT binary patch literal 1751 zcmZ`)4OEg@8vewx&&Y;P`&+fqKFUzapGg}m6(dkvlTb8WlgivoElVR~%uF+MKQJZD z2|^oS98*KZpLA@+9U^l!wZa-SkCmq7WZ4*lipVHS(`nDyGdt(ppXWa3z4yH5dERqh z4viXUwbXVg0036Ig2-V2fWnxtVv)INt>gvDP1_pU?r@6HXf#2iQ6Ul?yktVZPlZB} zp)|fU9nDUKQR#sH*pqkwut?rT-Vy#)*}H4q#pMJHC6<0P%&u<)?G%45VQ>49S3?fI zb^9#_4*G0x{H1#NVAZ0cbWHIbN=sW-v^Mg{>k6-DL-aT~5*QcH6@y$c;+C(1T?WG& zro~7vyXhjWv46B{Qd8Pos~^v1CLNg26(J|-clS0=w9z}duHLBJw`9Iklc>}0gL{Hh zBjf~ac}I)DVzA~KXy}^O2eAd1`*(KkMrkKTzfLWzZ4&ffrxTi-3VM$VvPO44`d6HF zEbEKyv+Q!PjW=ny3i9W_%K;nQnzK|bUdL`Q;;>wdU3G>#5le0@P;GnQ$|}8d`Mi~J zPnb+obUH1w!vUT6knrFRx|l~nUQ*>?57aVEhp^UG&OL{>E|e7R2wwyFm3qu5*L5-G zqd;uMYqX7lEQo1>H0zZN+e2;zC%<^+MtTWdh*^D}Sz1Ge;)ig`wHrD0hFWgD)9FHF zycyJ0v8X~cw8m-_4ZT9%uMT-L4GKq=V~VW4j>EzttUF<<3Aw=R5Q3c8ht8}o1A7{7 zy^gSfoOtC-a!bfS3njfZmv&-nvb1a53TpTauTDp0 zt*rpNXv_N-5u--Q%!9_cv1(-t%f7k%n<%#LQMh|1I)~X15hpK0+RaHx&c{dP@VUQy zw5=bG&Jtz`d0O7D%vtcji=jR<8hLn+0ke#l6&>ggdE|_(i(2p`I;?<(|89vx(H4n8 ze<&LUC;%5&VTMBqbWe_m+Yz^v;vMSGKT>~)`9P%DLA58mG&*5fHuGubDb%N@#4gG{ z&wGFMt%@Fev?sS@TeEDEwGK+6Gi=V_BDl0U3;3pVEZsUbSacJ=ETRthx31TPlM?Zr zt$_?xSr(tk{VAQoJ}GllS}_N!&i3**Tjn1wU%Jt+%-krD@(RUH6WE>lyfzb-O}#7C$$%gN#cE zZ$O3NOO91fY~Q)zO1dOL`kGi9d6Kb@EoCsL#q=5tKFL3`i((wV#=#^0hb!^SV6Sto zO^&2PcSYm5?EHnt+ifB-9=S45T>-9@`ib6bTiiBYT7X22&#foj($`~(?n7vZFTy^G zWG9*Oh%E%AdH98J+~NXhz<{xWEk&N(?t~w<<*QbhEicJ=9^7Gu%YjX!&hgvnN`0lC zV8nf|H-8w4L)AZpXzYKyD$IsaWt+@C73?P={#(I+N+^=aK}YlYEc~?u;SxajW3LaO z@+llM%N|Sh{0#8qm8S#ZRX?hxXR0UXB*&;3Q;A)&_$~7LQ!xC^wy8|lk@-;Wf&n#~ zyef6-(DRsO)DA}{o7Bx0BrML=&4!~*YSwf9vkvOay)?@u-G&p(#85tAw`yx3Uy|wF z>To%PILrT~|8)2DzPK$J*8Nf&`%Tl6s#&M(0J*itdPv{>ypq`JO>%e7bDdD#v0r{= zZZNNc^O);Cpr$;<*RZ)p9;ya=u*nS4{u$) z;Qb8SVCX{WXJ}}^z5$b3;f<08xM|L$NCT{2M4I(Lu^)b(;rPdA)wtht9O9L?P#2;B vk>(xY3>U~CCf=$=x)=Y6J|;^Jm@FX{-6dF9zQ?aKbs=CEg-Wg?9nAR;|34MP literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_uniform_gene_chooser-members.html b/trunk/paradiseo-eo/doc/html/classeo_uniform_gene_chooser-members.html new file mode 100644 index 000000000..c2513914b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_uniform_gene_chooser-members.html @@ -0,0 +1,20 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoUniformGeneChooser< EOT > Member List

This is the complete list of members for eoUniformGeneChooser< EOT >, including all inherited members.

+ + + + + + +
className() const (defined in eoUniformGeneChooser< EOT >)eoUniformGeneChooser< EOT > [inline, virtual]
eoUniformGeneChooser() (defined in eoUniformGeneChooser< EOT >)eoUniformGeneChooser< EOT > [inline]
functor_category()eoUF< EOT &, unsigned int > [inline, static]
operator()(EOT &_eo)eoUniformGeneChooser< EOT > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< EOT &, unsigned int > [inline, virtual]

Generated on Thu Oct 19 05:06:58 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_uniform_gene_chooser.html b/trunk/paradiseo-eo/doc/html/classeo_uniform_gene_chooser.html new file mode 100644 index 000000000..697edb0fc --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_uniform_gene_chooser.html @@ -0,0 +1,46 @@ + + +EO: eoUniformGeneChooser< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoUniformGeneChooser< EOT > Class Template Reference

Uniform choice of gene to delete. +More... +

+#include <eoVariableLengthMutation.h> +

+

Inheritance diagram for eoUniformGeneChooser< EOT >: +

+ +eoGeneDelChooser< EOT > +eoUF< EOT &, unsigned int > +eoFunctorBase + +List of all members. + + + + + + + +

Public Member Functions

+unsigned operator() (EOT &_eo)
 The pure virtual function that needs to be implemented by the subclass.
+virtual std::string className () const
+

Detailed Description

+

template<class EOT>
+ class eoUniformGeneChooser< EOT >

+ +Uniform choice of gene to delete. +

+ +

+Definition at line 94 of file eoVariableLengthMutation.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:58 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_uniform_gene_chooser.png b/trunk/paradiseo-eo/doc/html/classeo_uniform_gene_chooser.png new file mode 100644 index 0000000000000000000000000000000000000000..49aa28bceef42bbf302a0f7496919643ed71210b GIT binary patch literal 1536 zcmah}c~sH~5T--(AUiiT%Cd4R4a$qOY{|5gFfuhYu^<(^z%o2QUG4BlL%WsVO3<~f zrG`e{;%#`Kv@Z`(GfVy9ib@K)c_d4{{bS$$(|g~{d^3N{yl>vTNp;0Kt<>451A#zR zqMaSxAdn@Xn%68}ruN%W@BP)mz}3a$s7j?$Q_Bcm??vwxXRW0^)cH%CsI?FIEQkMNIWU~AH z;BiWJ47r%x8F#O&->R&WO!*M_au*JU(L|09sZ4o@C+T@7abToPy{iRL4+i!23Gy2Bi$$zs z(Sy(*hH|&c;(7z6~|5;|F*Z+l_ztjoqR`MwXx%4hxpLxu!IaWisElwN-E@7iGYu>)5C)OMmL ziMWUsu0_cXJ;Dbb;COJUn1IE(>UXIJ*|@C=E|-gtj?=?Zh1;l1i&mSG|C%$%%@}Qn z!ya-%@7>LV{vV2@4h3q4-=S!Oew*S6RyS_K%aVPgl0pk<#?}=46fzsmqf|k7yNgS; zbbA-Q>j+3Q2g`$T#Do+{UQr<3Yftz^?=0fy@q|$sv?t}z&HlM948Y9VKsadwXDY-Q zZ<0rC{O&uw?Ab^T47uI$+|=^A5~XAlB1#`i>*%wyg_5bp8=WUJ2K#q=?D)I^X(b*7}M<8hLfE z5n1-V-p5Kw&yN?WJZ+&RL^qEqDP|}2D z4W?O`KexeQpa#Z?%5Nr-<@PrPEKJ^|vi0yOmY21qX!ZStzJ2%xk?-b`(irkVwnnb$ zIw6mcKj}L(p4&ie=?y<-c3f=L{gd^ulovb|HNj$wx?6e^@GW`5f3e{5{q$PnpCuew z3utt0Lwj*)=nT6m0Ek)j$waN;(W}iNgVwYx6W^ z@TTl0mnH+z?;P03ZRX_hEf!AlyY|~mnSU5)ULM>YVp$xju3s3+7YHSU5TIEh5xKY7 z6>vD|6eV#9kp6 + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoUniformGenerator< T > Member List

This is the complete list of members for eoUniformGenerator< T >, including all inherited members.

+ + + + + + + + + + + +
eoUniformGenerator(T _max=T(1.0), eoRng &_rng=rng) (defined in eoUniformGenerator< T >)eoUniformGenerator< T > [inline]
eoUniformGenerator(T _min, T _max, eoRng &_rng=rng) (defined in eoUniformGenerator< T >)eoUniformGenerator< T > [inline]
functor_category()eoF< T > [inline, static]
minim (defined in eoUniformGenerator< T >)eoUniformGenerator< T > [private]
operator()(void)eoUniformGenerator< T > [inline, virtual]
operator()(void)eoUniformGenerator< T > [inline, virtual]
range (defined in eoUniformGenerator< T >)eoUniformGenerator< T > [private]
result_type typedefeoF< T >
uniform (defined in eoUniformGenerator< T >)eoUniformGenerator< T > [private]
~eoF()eoF< T > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:58 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_uniform_generator.html b/trunk/paradiseo-eo/doc/html/classeo_uniform_generator.html new file mode 100644 index 000000000..9964155b4 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_uniform_generator.html @@ -0,0 +1,68 @@ + + +EO: eoUniformGenerator< T > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoUniformGenerator< T > Class Template Reference

The class eoUniform can be used in the STL generate function to easily generate random floats and doubles. +More... +

+#include <eoRndGenerators.h> +

+

Inheritance diagram for eoUniformGenerator< T >: +

+ +eoRndGenerator< T > +eoF< T > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoUniformGenerator (T _max=T(1.0), eoRng &_rng=rng)
+ eoUniformGenerator (T _min, T _max, eoRng &_rng=rng)
+T operator() (void)
 Generates the number, uses a static_cast to get the right behaviour for ints and unsigneds.
+template<>
bool operator() (void)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+T minim
+T range
+eoRng & uniform
+

Detailed Description

+

template<class T = double>
+ class eoUniformGenerator< T >

+ +The class eoUniform can be used in the STL generate function to easily generate random floats and doubles. +

+It can also be used for ints and unsigneds by virtue of the static_cast in the generator function.

+Also present is a specialization for boolean, that will ignore the minima and maxima that are possibly set and will return an unbiased flip of a coin. For a biased flip, use the eoBoolean

+either in [0, _max) if only 1 value (_max) is given (or none, as _max defaults to 1.0) or in [_min,_max) if 2 values are given (_min, _max) +

+ +

+Definition at line 66 of file eoRndGenerators.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:58 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_uniform_generator.png b/trunk/paradiseo-eo/doc/html/classeo_uniform_generator.png new file mode 100644 index 0000000000000000000000000000000000000000..8fc992a5f81bfbfb07a2e318dc59f5bfb3e7946b GIT binary patch literal 761 zcmV==B^0000OP)t-s|Ns90 z00960z@MLBkN^MxkN^Mxkifved&2+Z00001bW%=J06^y0W&i*Jk4Z#9RCt{2noEx4 zFbF{H&8!VKz$X}WU#M4g|09eI{^e6nQbnsG4J<57;TH@gIk9lxs`A%;MNKi@ukiq2 zm{GIhi@fDJYF661&UuvLN>L!MMk34>z-&g$Ja%B8Q@jjGt11skEcpq*@yV3-BAxJn zW2|W5VaZ>z#?!pCWQ=dgll|sMX;H6fd~wd>+~RIsj`BxE#TD;L{)YMz^0H(hsW0b` zfUeZ{9WkEquJN?b%aihR*6}mEKaYF!9*>_}^X^_>;~CF*#xtJrjHk)dexJPi`?K*@ zLhZ^04lZ9#@^;l%c>F1@$7?qS%x*lI?fDE3px{b;GvJg5P~(I8gd^ZQzS#Dw5}$JZ zwCnqd7|(duc-rTs_Idspp54E^DattG8P9meGoJB`cW0jV`{doxrU(fs3my`9OH{^zXNaC409#EA%Btc z*HhM;UmEW)e`9?!9Hq~NB%RXyk_@#E=CHmxVm#wr<7uCl+UNOacy|BtrYPf#XFTH> z&v?c&-ko`%D!~QSZ5U6F=bcP~gV6=RZ6qumAoL%$ysWsb^(k-k7hd9f;FaDdOPXd& zlKQ;-zXI{|X-v+d?(@9kh0IH1@N7wH0MEQUg<|Kis7^A&JRf#>uJc6Au{HTx5LhCX)2dH rIH@`tpr}v&FM47;<6Yw^pO^mtjVnf!QZq=&00000NkvXXu0mjf?f`v; literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_uniform_init-members.html b/trunk/paradiseo-eo/doc/html/classeo_uniform_init-members.html new file mode 100644 index 000000000..c0fe5699b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_uniform_init-members.html @@ -0,0 +1,26 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoUniformInit< T > Member List

This is the complete list of members for eoUniformInit< T >, including all inherited members.

+ + + + + + + + + + + + +
className(void) const eoInit< T > [inline, virtual]
eoUniformInit(T _max=T(1.0), eoRng &_rng=rng)eoUniformInit< T > [inline]
eoUniformInit(eoRealBounds &_bound, eoRng &_rng=rng)eoUniformInit< T > [inline]
eoUniformInit(T _min, T _max, eoRng &_rng=rng)eoUniformInit< T > [inline]
functor_category()eoUF< T &, void > [inline, static]
minim (defined in eoUniformInit< T >)eoUniformInit< T > [private]
operator()(T &_t)eoUniformInit< T > [inline, virtual]
operator()(bool &_b) (defined in eoUniformInit< T >)eoUniformInit< T > [inline]
range (defined in eoUniformInit< T >)eoUniformInit< T > [private]
uniform (defined in eoUniformInit< T >)eoUniformInit< T > [private]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoUF()eoUF< T &, void > [inline, virtual]

Generated on Thu Oct 19 05:06:58 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_uniform_init.html b/trunk/paradiseo-eo/doc/html/classeo_uniform_init.html new file mode 100644 index 000000000..27423b329 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_uniform_init.html @@ -0,0 +1,73 @@ + + +EO: eoUniformInit< T > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoUniformInit< T > Class Template Reference

The class eoUniformInit can be used in the STL apply function to easily randomize floats and doubles. +More... +

+#include <eoUniformInit.h> +

+

Inheritance diagram for eoUniformInit< T >: +

+ +eoInit< T > +eoUF< T &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoUniformInit (T _max=T(1.0), eoRng &_rng=rng)
 Ctor with only a max bound.
+ eoUniformInit (eoRealBounds &_bound, eoRng &_rng=rng)
 Ctor with an eoRealBound.
+ eoUniformInit (T _min, T _max, eoRng &_rng=rng)
 Ctor with explicit min and max.
+void operator() (T &_t)
 Generates the number, uses a static_cast to get the right behaviour for ints and unsigneds.
+template<>
void operator() (bool &_b)

Private Attributes

+T minim
+T range
+eoRng & uniform
+

Detailed Description

+

template<class T = double>
+ class eoUniformInit< T >

+ +The class eoUniformInit can be used in the STL apply function to easily randomize floats and doubles. +

+It can also be used for ints and unsigneds by virtue of the static_cast

+Also present is a specialization for boolean, that will ignore the minima and maxima that are possibly set and will return an unbiased flip of a coin. For a biased flip, use the eoBoolean

+either in [0, _max) if only 1 value (_max) is given (or none, as _max defaults to 1.0) or in [_min,_max) if 2 values are given (_min, _max) +

+ +

+Definition at line 62 of file eoUniformInit.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:58 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_uniform_init.png b/trunk/paradiseo-eo/doc/html/classeo_uniform_init.png new file mode 100644 index 0000000000000000000000000000000000000000..b3c048f94b97010f098de659515a39de2bda1217 GIT binary patch literal 1146 zcmeAS@N?(olHy`uVBq!ia0y~yV9Wrr53n!;$=jcwTm(`Q0X`wF|Ns97GXMWSFn@l+ z1Rx8H4;(m9edzxaAeXTu$S;_|;n|He1_l-ZPZ!6KiaBrR?k&4*z|*=^b@PE%3#X$67borg&Q!u>vbN4W@3dAO zQ&f1w#MZE1swZ4Z4zx^dHPhbxoFVGf`t_&HCdPSX?%x!5KJb!bY_#X?3zI7+?mXd~ z;ceB$;G4Gcj_b^f9is2E_BBj9#ysoo(*Tlzjg|SnY+rHRxDcGi5@=M;*VE^BXR?GaFvwXSl3klx^ z!v6l9EB&jjUdkz3n#mU4JzP1f#p0^%mzCw;Hk3}4vvSJ~U-07Fi_A~z2V>5a_4j{W z=6^ag#r<_yE%z6Z|HrHsm;auz@cg59uhsuGb6#l36WDdqokRRfY3k=tTdt?MLcb!l zHeS2FIpC4l!u|7>u3Gq2CuE}9!rL|-4d=dUOcB4ZQ?B(BlhyUb0dWq`t3*!SR{OGf zftO=^@J0LSK};so8P2LY6mwpPfimltOzMBoz4FOy*#^FKOLg zJjd2-#mt4KnL(MNybmMpt}RkdW2|bPwf9nTR{xeuN^^Ge{QBqhz9LFx*}Bu0_f=~M zy?*DIcrBo(w6tGYmMd-A+u=TA)k5L>G3&)% zRAxLnbL4pMg+w=h&DzfUnrn+*Se#OOb0Em-d`ZGYsRe&kXUbSF*e7Up=Ecs_Np9~O zeqHnGe;aDG*3?$`34deto%= + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoUniformMutation< EOT > Member List

This is the complete list of members for eoUniformMutation< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + +
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
bounds (defined in eoUniformMutation< EOT >)eoUniformMutation< EOT > [private]
className() const eoUniformMutation< EOT > [inline, virtual]
eoMonOp()eoMonOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
eoUniformMutation(const double &_epsilon, const double &_p_change=1.0)eoUniformMutation< EOT > [inline]
eoUniformMutation(eoRealVectorBounds &_bounds, const double &_epsilon, const double &_p_change=1.0)eoUniformMutation< EOT > [inline]
eoUniformMutation(eoRealVectorBounds &_bounds, const std::vector< double > &_epsilon, const std::vector< double > &_p_change)eoUniformMutation< EOT > [inline]
epsilon (defined in eoUniformMutation< EOT >)eoUniformMutation< EOT > [private]
functor_category()eoUF< EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
homogeneous (defined in eoUniformMutation< EOT >)eoUniformMutation< EOT > [private]
operator()(EOT &_eo)eoUniformMutation< EOT > [inline, virtual]
p_change (defined in eoUniformMutation< EOT >)eoUniformMutation< EOT > [private]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]
~eoUF()eoUF< EOT &, bool > [inline, virtual]

Generated on Thu Oct 19 05:06:58 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_uniform_mutation.html b/trunk/paradiseo-eo/doc/html/classeo_uniform_mutation.html new file mode 100644 index 000000000..86affa289 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_uniform_mutation.html @@ -0,0 +1,285 @@ + + +EO: eoUniformMutation< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoUniformMutation< EOT > Class Template Reference

eoUniformMutation --> changes all values of the std::vector by uniform choice with range epsilon with probability p_change per variable +More... +

+#include <Tutorial/eoRealOp.h> +

+

Inheritance diagram for eoUniformMutation< EOT >: +

+ +eoMonOp< EOT > +eoOp< EOT > +eoUF< EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

 eoUniformMutation (const double &_epsilon, const double &_p_change=1.0)
 Constructor without bounds == unbounded variables :-) not very clean, but who's doing unbounded optimization anyway? and it's there mostly for backward compatibility.
 eoUniformMutation (eoRealVectorBounds &_bounds, const double &_epsilon, const double &_p_change=1.0)
 Constructor with bounds.
 eoUniformMutation (eoRealVectorBounds &_bounds, const std::vector< double > &_epsilon, const std::vector< double > &_p_change)
 Constructor with bounds.
+virtual std::string className () const
 The class name.
bool operator() (EOT &_eo)
 Do it!

Private Attributes

+bool homogeneous
+eoRealVectorBounds & bounds
+std::vector< double > epsilon
+std::vector< double > p_change
+

Detailed Description

+

template<class EOT>
+ class eoUniformMutation< EOT >

+ +eoUniformMutation --> changes all values of the std::vector by uniform choice with range epsilon with probability p_change per variable +

+ +

+Definition at line 45 of file eoRealOp.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
eoUniformMutation< EOT >::eoUniformMutation ( const double &  _epsilon,
const double &  _p_change = 1.0
)  [inline]
+
+ + + + + +
+   + + +

+Constructor without bounds == unbounded variables :-) not very clean, but who's doing unbounded optimization anyway? and it's there mostly for backward compatibility. +

+

Parameters:
+ + + +
_epsilon the range for uniform nutation
_p_change the probability to change a given coordinate
+
+ +

+Definition at line 56 of file eoRealOp.h.

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
eoUniformMutation< EOT >::eoUniformMutation ( eoRealVectorBounds &  _bounds,
const double &  _epsilon,
const double &  _p_change = 1.0
)  [inline]
+
+ + + + + +
+   + + +

+Constructor with bounds. +

+

Parameters:
+ + + + +
_bounds an eoRealVectorBounds that contains the bounds
_epsilon the range for uniform mutation - a double to be scaled
_p_change the one probability to change all coordinates
+
+ +

+Definition at line 66 of file eoRealOp.h. +

+References eoRealBaseVectorBounds::isBounded(), and eoRealBaseVectorBounds::range().

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
eoUniformMutation< EOT >::eoUniformMutation ( eoRealVectorBounds &  _bounds,
const std::vector< double > &  _epsilon,
const std::vector< double > &  _p_change
)  [inline]
+
+ + + + + +
+   + + +

+Constructor with bounds. +

+

Parameters:
+ + + + +
_bounds an eoRealVectorBounds that contains the bounds
_epsilon the VECTOR of ranges for uniform mutation
_p_change the VECTOR of probabilities for each coordinates
+
+ +

+Definition at line 83 of file eoRealOp.h.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
bool eoUniformMutation< EOT >::operator() ( EOT &  _eo  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Do it! +

+

Parameters:
+ + +
_eo The indi undergoing the mutation
+
+ +

+Implements eoUF< EOT &, bool >. +

+Definition at line 96 of file eoRealOp.h. +

+References eoRng::flip(), eoRealBaseVectorBounds::isMaxBounded(), eoRealBaseVectorBounds::isMinBounded(), eoRealBaseVectorBounds::maximum(), eoRealBaseVectorBounds::minimum(), and eoRng::uniform().

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:58 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_uniform_mutation.png b/trunk/paradiseo-eo/doc/html/classeo_uniform_mutation.png new file mode 100644 index 0000000000000000000000000000000000000000..9018a19e13bc9c1796391b3f53590f9faf86b75b GIT binary patch literal 1486 zcmZWpdovvb@+<&^~d>^0h_j|tQe81;&zF&$19*5Ybz6}P0AKP^c`2@z*($XnJDgbR)EsP`tRM)ILI|p6Fm5DD(GRVzu8ydIgwhZm7oJxq7PP*;m$c@y240QHJx18odrHBCPbcFV+- ze@i^{k>o_m@ZMO>ygV+eTtt<>Lq?F6_PphKUBzH&N3b-a_8i=@?03$R9PkT&^mU*7 zQ`L3_S5ZYEaRE-@re@Y$tFQ1oAc+YcIF}*!aW?&WtcFmRZ?-R-NtW@Z8hHmk5#B=x zvi30+*;5Cb#*W&Fich!k6}sL$`YPn+NwSX%D^#p;3ID_f2%ow}yc%b9`#o~)Bqr9X zT+|_f1s%G_GP~C3wEpC^&e@F233mf0BoO@-sRo#~vyR1FH_xv{a1X_z8ueo1eD1|# zLU*Jn0=#ejfUIg=q*cN*%|&mbXLYF1#EYF%W$)j(rYrJc^lRf51s>)cbmMKvgjWLk zaYhw^JqrlQUx!7*Co6~NdW1U`G(y0)!Dz-g5fin{EPC>0|rqCi*vJ zO#4tG!y^t`r+A_eM)|--e`}y235oN6ZzaF7K=Ly#u(Mc7vVr*e=i+;cw8Yf?7EWfu zP%4<71*S))W=$8gm9K(B&qxjWgb~Zsb&O|#c!4`~z~vSgrG>>$CXKE(PziR zu66uj7o)D7tR}9*lcm&tXBRc6TCW=2{xX(K*sz56*#MEfgQ+1y8OyQ_UG1X;yu2(N zj7#y>7e4!u0;RoH{NqeCIW-sXvSq^?fmr@ZDq5el^7qX+)}|Ol_vj#$PiM zDQZB`n*h2zd*gGsmM|nV-vZO_C)W@$oh2C9Sbxx;a7R(pJUlzbmwTQ!ufjHSg5H6p zoAYM<*vdg`a-j>P2ewn7o9+PG3qTVOE{%N{B~NM;Vd7~>sL@Ci;D`*TPrguQc<0&B zN8!Aa_X$b4Huw{@QXVkj7u5re-Nm^_MFBNJD^kmF97uIc8F{5V$RRi+!CR2%0-c|Q zNhHpzRil2BjN^9wxUpbhW!hrWG3Q!|(6C3tO+Tn8q2EPQ4R9j|usTXi09R5j;XVYg z^zQq2(})JrvPLzT=3-F{e%UrqsI6MD%QyaHX-CN!V0cQf`SN=U@uKH@X9SzM^Nll( zoHw4UgFb9;OTS=Cpr>Vl3Q4q$F09Mo0^`BuPSoLY8NDamwrNdcs~2iW6#fmXZa22F%1r zHV)2$OD5CW_EvtrB##Z!^|tQNZNmHcP?IT9MaY3dxeivx&1U}Hz8#$|7fQXmD52J+ zDH)fb7YNzDmuB8~sco-~wB4dN*+oP(sZS?Vc&)MUi||eRa5k>@+6mOO-Tt`iFeTh@_95_GkLh1^o#tx6j6>M04P+ zN^V|(RTjMi?Ru>W2 Gn12D75Bu8y literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_updatable-members.html b/trunk/paradiseo-eo/doc/html/classeo_updatable-members.html new file mode 100644 index 000000000..f9b2dacc3 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_updatable-members.html @@ -0,0 +1,16 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoUpdatable Member List

This is the complete list of members for eoUpdatable, including all inherited members.

+ + +
update()=0 (defined in eoUpdatable)eoUpdatable [pure virtual]
~eoUpdatable()eoUpdatable [inline, virtual]

Generated on Thu Oct 19 05:06:58 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_updatable.html b/trunk/paradiseo-eo/doc/html/classeo_updatable.html new file mode 100644 index 000000000..5e59972b6 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_updatable.html @@ -0,0 +1,41 @@ + + +EO: eoUpdatable Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoUpdatable Class Reference

eoUpdatable is a generic class for adding updatation to an existing class Just says it has an update() method +More... +

+#include <eoUpdatable.h> +

+

Inheritance diagram for eoUpdatable: +

+ +eoOneFifthMutation< EOT > + +List of all members. + + + + + + + +

Public Member Functions

+virtual ~eoUpdatable ()
 Virtual destructor.
+virtual void update ()=0
+

Detailed Description

+eoUpdatable is a generic class for adding updatation to an existing class Just says it has an update() method +

+ +

+Definition at line 36 of file eoUpdatable.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:58 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_updatable.png b/trunk/paradiseo-eo/doc/html/classeo_updatable.png new file mode 100644 index 0000000000000000000000000000000000000000..d13f1ad81f55180ba24badce3d42d76142ff1a10 GIT binary patch literal 494 zcmeAS@N?(olHy`uVBq!ia0vp^Yk)X_g&9be`8Rh0DTx4|5ZC|z{{xx-{~wq?KVbrp z1;z&s9H>6@{|S)GSQ6wH%;50sMjDXa;_2cTQZeW4^xV9|1{`f~?SJR)V7$k>jXQMK zl;84+4Ika_nq=Lo3^WU#D#YZ^S-E-zU)v1syoR5hwnEZ7PGm)Izgf<3t+`l0L|Wy` zq{aj1syz?8y=I#hy;rP)UC8NF$7KHb>mOC-oS2gEj#bB@|Ld%cTb|EXFvoL;G~o59ytL>T;u4 zGcifM42u3sfBRhcyK2vs+9QnL>^AOiRy`oa6r_?Ou6*mZOsw*c_meC#8$)%DU2>cj zz!o0d{8sI7NZ;F;El)K$MOs}{)tKr&ZcOs*+c_yX%Hc+W;pAwY>rW2`{L=Mnl=-Zl zHPQ0)^6VEIHuP8@usfkX%Tf@4;JAdD9qDZ{6^f zexHz;dP|P`u22Z)Stl(s)(gq6^Q2X;+?^#9vYo5VNcYNm7DnbpnhQG&Uw;cru+I~= i-q^g+TJDAQ8|flj<5z;6UFU(3!{F)a=d#Wzp$PyLw$=*( literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_updater-members.html b/trunk/paradiseo-eo/doc/html/classeo_updater-members.html new file mode 100644 index 000000000..4a81da4c9 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_updater-members.html @@ -0,0 +1,21 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoUpdater Member List

This is the complete list of members for eoUpdater, including all inherited members.

+ + + + + + + +
className(void) const (defined in eoUpdater)eoUpdater [inline, virtual]
functor_category()eoF< void > [inline, static]
lastCall() (defined in eoUpdater)eoUpdater [inline, virtual]
operator()()=0eoF< void > [pure virtual]
result_type typedefeoF< void >
~eoF()eoF< void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:06:58 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_updater.html b/trunk/paradiseo-eo/doc/html/classeo_updater.html new file mode 100644 index 000000000..421b309d9 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_updater.html @@ -0,0 +1,51 @@ + + +EO: eoUpdater Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoUpdater Class Reference

eoUpdater is a generic procudere for updating whatever you want. +More... +

+#include <eoUpdater.h> +

+

Inheritance diagram for eoUpdater: +

+ +eoF< void > +eoFunctorBase +eoCountedStateSaver +eoDynUpdater +eoIncrementor< T > +eoIncrementorParam< T > +eoTimeCounter +eoTimedStateSaver +eoCountedDynUpdate +eoTimedDynUpdate + +List of all members. + + + + + + +

Public Member Functions

+virtual void lastCall ()
+virtual std::string className (void) const
+

Detailed Description

+eoUpdater is a generic procudere for updating whatever you want. +

+Yet again an empty name +

+ +

+Definition at line 39 of file eoUpdater.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:58 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_updater.png b/trunk/paradiseo-eo/doc/html/classeo_updater.png new file mode 100644 index 0000000000000000000000000000000000000000..8573d9cce323ce15d1f8c477527895402a211ac9 GIT binary patch literal 2379 zcmb_eYgp3B8mHXsVy;=MblKEu?V{xki;jB4Yo;dND>cM24K>k3^ZSjdStg6}Sb;8eCsZ^?aCV(ByA zn%XW>zi1XQkSiJ6!gTPC?E$jeQK(-@B$B=D@>EZC|IXbRNs}#n#X-J}k>%|Tyb=en z{5PKQuJZ|}x@s+zo9R^1Sk5Ju4b~k5y)9ZZ@rDlwwPe?`Ll2C(kzu?7!$wVBpL=`L zAS=wwlv^AJ?|z_}7#1-%pg2gULU$)?9|f1KVuoHQUS)Hu&$3q$5cN#zW|{MC_A^AHk^;NycHqO<>uFy|t>E_;VC!~8&-(J& zYUVwafBw{u!v;?q=hhRUmde#NWhn8B|Y7pA)^s#49a`z?Zc9$w}pgE*~^IL-o`iC zO}(w(vT&rJ+&efq^qO?MXvOkhAp-BwJ027GX=@K7w;5S#ZK%vuP5l3Hmlm6%ORSx? z6Qpz(kZrfZ0};!AA5o;k_k9VVeSjdjpj9JkdFe7ru^1>&#mM``U`vDsK20hS2qJ}4 zbj);y?5tk7oGA;yz@)mOVi{47*Vl1_uxlRRZD-Q}^cA+bvJNKgn=iYort%2`C6*9W zCh~A3T)HPtZVKmAOPxSAe@<^K1HPz=n=jFz3{6>i(0{=voLLVbWGcFaWZ<}O{j}b5 zzNi-b4|_BBLWzYGz10)IRwwWUS%RsEyJy0?Kw35jpMH=7m4(PDO`+&rcei8NA=b>E z9Qly9@};@QRf%yRCGVE(2~AhhjStX>LdhD*bMg%CTc6UlK;!64q3`0wQDm*Hq=B^V zBr_#won}Uk30}xMUw|!O6bT=p%77sD`46m@XPA6-uw?-Ypa%*8e$4cRT%*wh$@vtZAgkLzmr~W5i^9*ssrYE?S2P=<`brgh#IuG;0M|#T= z3KA;fZM7%(z`=@v7bD@gVqw{-Mky%<=1{}6+U>cBUU#VLfZ*&x$RxSG^|meCw1gmV ztw=F|ZsBq0GYLT0QTUToOv^)YK0$Pj6LmD{k;EciAWT1p!R0pgHjXW(Elha;zH?nC zYL!rcol85mUu2c&S(a3*;Q>(g)6jCsybo4=S5EBJgkEu`%S{4fPiW&2z%jN`#veZK zUf-XOIG1J*gqPUn$8dkoJ1Qq`o*xe-*2>5CAM-y#ywLJO`QmBSR_L*k*pYZD_(X4z z7lqmewh+dd6G!IKIuXJEW4w(`d(-G4xPD5(vnJbH17@4>*vbelJe;B}-I0vrN`wZ3 z6m#@U@+EHG8-=#Vh$2L5PvVXS#OT@zH}M|(i`=yQmUvGxc(FPjOHM8{{XihpX`v~w zxk8D;f2d#4R|Q)9arn%=M*8&NP}27S36*!*&5SoAU;w?(T?d#Cug!Ch6kBXQU>ccK&(jg#Lzm{`X#4K7mHjWRjB>B}`s z3klS0W7M>A@YUF}mz|i>H>G%Ffv_9(&xQV!u})tKQ}k`~`lQLMlcn|!V5fsijgJmA z88&A!TZF5*Q)Jo45B_(sPo?o-e3!|5_cKNt* z{%TrU*ft@=;>WOfwdV$(##2rogJ0Qr?!O9;d)n$B=sePJ>K)C+2=SQy?wdcK@~>~{ z=LGm4Qe|Y4<+9syYsTmj@nH7cM2VCk;kW8(7+zkHi~iPOAr^f_nmp90~+@9&wYX@lV zJmeYqs$bDbr+G3n?#TS6_UEKT!Wo0#rH7JzrEUWX{oSr^OmQ6$`n2)%j|X53fA31# zg1?|xR<}LTQfVfm3MR~}O9*%~{a?xpGYQT5;P{Q+&nCa`oo5oGS}=jwpuPf!Db* zE^;3j{b_I&Hb3v_(~|oDzw47Vh(dqI%8VX}Fc5aLJW-+zhMEd34MS5NHk7kU_49$a MIwPH`973-B3vPGK`v3p{ literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_value_param-members.html b/trunk/paradiseo-eo/doc/html/classeo_value_param-members.html new file mode 100644 index 000000000..9bf22fa39 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_value_param-members.html @@ -0,0 +1,31 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoValueParam< ValueType > Member List

This is the complete list of members for eoValueParam< ValueType >, including all inherited members.

+ + + + + + + + + + + + + + + + + +
defValue() const eoParam [inline]
defValue(const std::string &str)eoParam [inline]
description() const eoParam [inline]
eoParam()eoParam [inline]
eoParam(std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)eoParam [inline]
eoValueParam(void)eoValueParam< ValueType > [inline]
eoValueParam(ValueType _defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)eoValueParam< ValueType > [inline]
getValue(void) const eoValueParam< ValueType > [inline, virtual]
longName() const eoParam [inline]
repValue (defined in eoValueParam< ValueType >)eoValueParam< ValueType > [protected]
required() const eoParam [inline]
setLongName(std::string _longName)eoParam [inline]
setValue(const std::string &_value)eoValueParam< ValueType > [inline, virtual]
shortName() const eoParam [inline]
value()eoValueParam< ValueType > [inline]
value() const eoValueParam< ValueType > [inline]
~eoParam()eoParam [inline, virtual]

Generated on Thu Oct 19 05:06:58 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_value_param.html b/trunk/paradiseo-eo/doc/html/classeo_value_param.html new file mode 100644 index 000000000..aa65a2d52 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_value_param.html @@ -0,0 +1,216 @@ + + +EO: eoValueParam< ValueType > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoValueParam< ValueType > Class Template Reference

eoValueParam<ValueType>: templatized derivation of eoParam. +More... +

+#include <eoParam.h> +

+

Inheritance diagram for eoValueParam< ValueType >: +

+ +eoParam +eoPerf2Worth< EOT, EOT::Fitness > +eoNoPerf2Worth< EOT > + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ eoValueParam (void)
 Construct a Param.
 eoValueParam (ValueType _defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)
 Construct a Param.
ValueType & value ()
 Parameter value.
const ValueType & value () const
 Parameter value.
+std::string getValue (void) const
 Pure virtual function to get the value out.
+void setValue (const std::string &_value)
 Pure virtual function to set the value.

Protected Attributes

+ValueType repValue
+

Detailed Description

+

template<class ValueType>
+ class eoValueParam< ValueType >

+ +eoValueParam<ValueType>: templatized derivation of eoParam. +

+Can be used to contain any scalar value type. It makes use of std::strstream to get and set values. This should be changed to std::stringstream when that class is available in g++.

+Note also that there is a template specialization for std::pair<double, double> and for std::vector<double>. These stream their contents delimited with whitespace. +

+ +

+Definition at line 136 of file eoParam.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+template<class ValueType>
eoValueParam< ValueType >::eoValueParam ( ValueType  _defaultValue,
std::string  _longName,
std::string  _description = "No description",
char  _shortHand = 0,
bool  _required = false
)  [inline]
+
+ + + + + +
+   + + +

+Construct a Param. +

+

Parameters:
+ + + + + + +
_defaultValue The default value
_longName Long name of the argument
_description Description of the parameter. What is useful for.
_shortName Short name of the argument (Optional)
_required If it is a necessary parameter or not
+
+ +

+Definition at line 151 of file eoParam.h.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + +
+template<class ValueType>
ValueType& eoValueParam< ValueType >::value (   )  [inline]
+
+ + + + + +
+   + + +

+Parameter value. +

+

Returns:
parameter value
+ +

+Definition at line 166 of file eoParam.h. +

+Referenced by eoNoPerf2Worth< EOT >::operator()(), eoFileSnapshot::operator()(), eoFDCStat< EOT >::operator()(), and eoParser::setStopOnUnknownParam().

+

+ + + + +
+ + + + + + + + + + + +
+template<class ValueType>
const ValueType& eoValueParam< ValueType >::value (   )  const [inline]
+
+ + + + + +
+   + + +

+Parameter value. +

+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

+

Returns:
parameter value
+ +

+Definition at line 175 of file eoParam.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:58 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_value_param.png b/trunk/paradiseo-eo/doc/html/classeo_value_param.png new file mode 100644 index 0000000000000000000000000000000000000000..e09bc1d6c28f579d7ff78deba04ae20999614d16 GIT binary patch literal 911 zcmV;A191F_P)~xFjKB6>DLtGul7)SdGNbgxF&x41bQ4&*3W`D8RiH zE;x56E=GR{&iUk;;Ak_@+WW8*E~F)$pK!Dpc+Fo>;{(`@3DkQd%zUDos38Jmopn)C5&m~k%e zC4*;i!xYC|GSOP0W%C72_ZGYvF8$1i6v}@P+0k;coGSR?sF+MMHs1!e^R#YDCqoa+A!b$1* zHZGR4=L+u{j#i$&LS5lU*}KU^15FgsRlIA!<-=j-U2UR41vmEHW@b);x$L|9i3W0hx(5Zp3SaIC zz0DMGrx;VkYgR8avtL>!<-7pbI{)Z>exiXp8?NsOu2V1{p(YqdI4$ntnF$2``5y!@UZ>U_ygUE^002ovPDHLkV1kJcujv2) literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_variable_pareto_traits-members.html b/trunk/paradiseo-eo/doc/html/classeo_variable_pareto_traits-members.html new file mode 100644 index 000000000..ca915f979 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_variable_pareto_traits-members.html @@ -0,0 +1,21 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoVariableParetoTraits Member List

This is the complete list of members for eoVariableParetoTraits, including all inherited members.

+ + + + + + + +
bObj (defined in eoVariableParetoTraits)eoVariableParetoTraits [private, static]
maximizing(unsigned _i) (defined in eoVariableParetoTraits)eoVariableParetoTraits [inline, static]
maximizing(int which) (defined in eoParetoFitnessTraits)eoParetoFitnessTraits [inline, static]
nObj (defined in eoVariableParetoTraits)eoVariableParetoTraits [private, static]
nObjectives()eoVariableParetoTraits [inline, static]
setUp(unsigned _n, std::vector< bool > &_b)eoVariableParetoTraits [inline, static]
tol() (defined in eoParetoFitnessTraits)eoParetoFitnessTraits [inline, static]

Generated on Thu Oct 19 05:06:58 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_variable_pareto_traits.html b/trunk/paradiseo-eo/doc/html/classeo_variable_pareto_traits.html new file mode 100644 index 000000000..5eb872f6a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_variable_pareto_traits.html @@ -0,0 +1,52 @@ + + +EO: eoVariableParetoTraits Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoVariableParetoTraits Class Reference

eoVariableParetoTraits : an eoParetoFitnessTraits whose characteristics can be set at run-time (nb objectives and min/max's) Why bother? For didactical purposes (and EASEA implementation :-) +More... +

+#include <eoParetoFitness.h> +

+

Inheritance diagram for eoVariableParetoTraits: +

+ +eoParetoFitnessTraits + +List of all members. + + + + + + + + + + + + + + + +

Static Public Member Functions

+void setUp (unsigned _n, std::vector< bool > &_b)
 setting the static stuff
+unsigned nObjectives ()
 the accessors
+bool maximizing (unsigned _i)

Static Private Attributes

+unsigned nObj
+std::vector< bool > bObj
+

Detailed Description

+eoVariableParetoTraits : an eoParetoFitnessTraits whose characteristics can be set at run-time (nb objectives and min/max's) Why bother? For didactical purposes (and EASEA implementation :-) +

+ +

+Definition at line 56 of file eoParetoFitness.h.

The documentation for this class was generated from the following files: +
Generated on Thu Oct 19 05:06:58 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_variable_pareto_traits.png b/trunk/paradiseo-eo/doc/html/classeo_variable_pareto_traits.png new file mode 100644 index 0000000000000000000000000000000000000000..36440512b7b790b0c990d530142d3b268caf1f56 GIT binary patch literal 523 zcmV+m0`&cfP)1&Rq&uxZ%EY2S|73gLp z4jiI7?5PM@HO-l`wT0l2#|NX+C^#TK#yB#p?0L>Z5fX@C8vRL-WW9=}=TuEm@+TQq z_2xE>VT%x1(l9-FX$OuLUj5OXfax2RtQzOX)ddI6*P9gzFy!Nhbak;r)*CG@5-6=zw?CMo)Nu} zbN{{+=XSqeigUSsEzaUB&f+Z2;#`h{IhM+ll=I>|&B^*xEADijxf{C`i(uUU3nzAD zkC!2u`asV?;UgsE?@}aGz{?rN5lLpxa~{gBBI7Lc;ADO64}Vk=(pM2@^Q>N-?1HTo zM;tgQ-i{ClJJFuTQLWBfKKfZ};ym`8{5Zgbup-fOGW4LXuGBc5SKjl{<;W)WoDdxA zYOAOFX`FoK?DrG>vKoyEZra{2kq8e`Mf6Lwa$2ivf-TOwawh%n`~dQP{MVds>z4ok N002ovPDHLkV1mIo{xJXm literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_vector-members.html b/trunk/paradiseo-eo/doc/html/classeo_vector-members.html new file mode 100644 index 000000000..244a76f04 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_vector-members.html @@ -0,0 +1,50 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoVector< FitT, GeneType > Member List

This is the complete list of members for eoVector< FitT, GeneType >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
AtomType typedef (defined in eoVector< FitT, GeneType >)eoVector< FitT, GeneType >
className() const EO< FitT > [inline, virtual]
ContainerType typedef (defined in eoVector< FitT, GeneType >)eoVector< FitT, GeneType >
EO()EO< FitT > [inline]
EO() (defined in EO< FitT >)EO< FitT > [inline]
eoVector(unsigned size=0, GeneType value=GeneType())eoVector< FitT, GeneType > [inline]
eoVector(const eoVector< OtherFitnessType, GeneType > &_vec)eoVector< FitT, GeneType > [inline]
Fitness typedef (defined in EO< FitT >)EO< FitT >
fitness() const EO< FitT > [inline]
fitness(const Fitness &_fitness)EO< FitT > [inline]
fitness(performance_type perf) (defined in EO< FitT >)EO< FitT > [inline]
fitness(void) const (defined in EO< FitT >)EO< FitT > [inline]
fitness_traits typedef (defined in EO< FitT >)EO< FitT >
invalid() const EO< FitT > [inline]
invalidate() (defined in EO< FitT >)EO< FitT > [inline]
invalidate(void) (defined in EO< FitT >)EO< FitT > [inline]
invalidate_worth(void) (defined in EO< FitT >)EO< FitT > [inline]
operator<(const eoVector< FitT, GeneType > &_eo) const eoVector< FitT, GeneType > [inline]
EO< FitT >::operator<(const EO &_eo2) const EO< FitT > [inline]
operator<(const EO< Fitness, Traits > &other) const (defined in EO< FitT >)EO< FitT > [inline]
operator>(const EO &_eo2) const (defined in EO< FitT >)EO< FitT > [inline]
operator>(const EO< Fitness, Traits > &other) const (defined in EO< FitT >)EO< FitT > [inline]
performance(performance_type perf) (defined in EO< FitT >)EO< FitT > [inline]
performance(void) const (defined in EO< FitT >)EO< FitT > [inline]
performance_type typedef (defined in EO< FitT >)EO< FitT >
printOn(std::ostream &os) const eoVector< FitT, GeneType > [inline, virtual]
readFrom(std::istream &is)eoVector< FitT, GeneType > [inline, virtual]
storage_type typedef (defined in EO< FitT >)EO< FitT >
value(const std::vector< GeneType > &_v) (defined in eoVector< FitT, GeneType >)eoVector< FitT, GeneType > [inline]
worth(worth_type worth) (defined in EO< FitT >)EO< FitT > [inline]
worth(void) const (defined in EO< FitT >)EO< FitT > [inline]
worth_type typedef (defined in EO< FitT >)EO< FitT >
~EO()EO< FitT > [inline, virtual]
~eoObject()eoObject [inline, virtual]
~eoPersistent()eoPersistent [inline, virtual]
~eoPrintable()eoPrintable [inline, virtual]

Generated on Thu Oct 19 05:06:59 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_vector.html b/trunk/paradiseo-eo/doc/html/classeo_vector.html new file mode 100644 index 000000000..114d50c79 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_vector.html @@ -0,0 +1,124 @@ + + +EO: eoVector< FitT, GeneType > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoVector< FitT, GeneType > Class Template Reference

Base class for fixed length chromosomes, just derives from EO and std::vector and redirects the smaller than operator to EO (fitness based comparison). +More... +

+#include <eoVector.h> +

+

Inheritance diagram for eoVector< FitT, GeneType >: +

+ +EO< FitT > +eoObject +eoPersistent +eoPrintable + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef GeneType AtomType
+typedef std::vector< GeneType > ContainerType

Public Member Functions

 eoVector (unsigned size=0, GeneType value=GeneType())
 default constructor
+template<class OtherFitnessType>
 eoVector (const eoVector< OtherFitnessType, GeneType > &_vec)
 copy ctor abstracting from the FitT
+void value (const std::vector< GeneType > &_v)
+bool operator< (const eoVector< FitT, GeneType > &_eo) const
 to avoid conflicts between EO::operator< and std::vector<GeneType>::operator<
+virtual void printOn (std::ostream &os) const
 printing...
+virtual void readFrom (std::istream &is)
 reading...
+

Detailed Description

+

template<class FitT, class GeneType>
+ class eoVector< FitT, GeneType >

+ +Base class for fixed length chromosomes, just derives from EO and std::vector and redirects the smaller than operator to EO (fitness based comparison). +

+GeneType must have the following methods: void ctor (needed for the std::vector<>), copy ctor, +

+ +

+Definition at line 46 of file eoVector.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class FitT, class GeneType>
eoVector< FitT, GeneType >::eoVector ( unsigned  size = 0,
GeneType  value = GeneType()
)  [inline]
+
+ + + + + +
+   + + +

+default constructor +

+

Parameters:
+ + + +
size Length of vector (default is 0)
value Initial value of all elements (default is default value of type GeneType)
+
+ +

+Definition at line 65 of file eoVector.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:58 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_vector.png b/trunk/paradiseo-eo/doc/html/classeo_vector.png new file mode 100644 index 0000000000000000000000000000000000000000..0336f46b02deeaa858e97270346c5937c3f082ed GIT binary patch literal 1167 zcmeAS@N?(olHy`uVBq!ia0y~yV9Wxt53n!;$@^?3Z-A6UfKQ0)|NsAi%>Vxn%%7hy z0muU50|yRNANv0U$Ym@E@(X5gcy=R=fq_NU)5S5QV$Rz;fql0X1lSUyr+$;%!T64K z)i)=br~lj|5)LF-zdrJqhxzIs?cAovKKlfmuD;Q@>@u_7MbXv2UVPFYv8^jyeHUzt zYUd9Azv=I4;WCk}W_61kb9**k`!Ufz?U3PW>(J_`4{lq(P5(EG^Z22!1b?%l|?&+BMOPfVEg@50>?zG&dRfpx0e%*7IRuZ|xs6c&&Swtcoc@Cxta9gHiW@?DSF7CfQ?_uZ+J zOXPbdi>m)sW{E5e%;)O<74T<&*zF5vH%`&p_I=j%IPv>ixMuG9;2C}Tc9w8;x|iKj zv)^9x1E=@Ryig=Awdzsh<-Ao-c}rhxaB`uY3aHm#e!$LUpRZSdS}JU7;_wmnjp z!{4|%we^UtirM$O0q;LCMT@?Bc>mZO#jES56^HIn{@QwIk)4S6*JT@4@E<+-@3a5E zjYoGEPCvI#V$-9PR?Y6oX6q-4$_M-2+T#{hn z(?t=m*Kl68Z<;V)fUT<>nh#2MaG;**1Iq{nz2KTV0MWwELg8e%+O_+(V~||0Yc}Sf8CC zz`VlD^>5SNgE7nf)}4*npHRNQuXt~0x$X4@GP$wgzfD){zK=*diC-to*NO48pZ_QZ zm}uhuMOEuMui7uCT<8B_#w*ABy_jy?73*?W4@vk^f7LaUz%5yeb}h1VyHe^>>$5cM z>Bep6kLGhuo^?2H^6^r}y^>)^IX?GAEp^V?8z`H1uRYH8_sLJvZ)DgW2K~POa7K{p zf2XLQ{KVdF7=|3`SYr) zVQa7cdJ|SE7kYk5*xJ&n9~-Pnma=`ByfdsIZcj(n);^)#M`Qd~Tk*f%S+{K7CGRQ6 zvSdwXzy9;++~u;^)z4qwn!h<((eZ9g>~dR{Fz-9gX*ZlNSuO~BeQgD^&^)m>iWl!y z@$Z} + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoVlAddMutation< EOT > Member List

This is the complete list of members for eoVlAddMutation< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + +
atomInit (defined in eoVlAddMutation< EOT >)eoVlAddMutation< EOT > [private]
AtomType typedef (defined in eoVlAddMutation< EOT >)eoVlAddMutation< EOT >
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const eoVlAddMutation< EOT > [inline, virtual]
eoMonOp()eoMonOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
eoVlAddMutation(unsigned _nMax, eoInit< AtomType > &_atomInit)eoVlAddMutation< EOT > [inline]
functor_category()eoUF< EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
nMax (defined in eoVlAddMutation< EOT >)eoVlAddMutation< EOT > [private]
operator()(EOT &_eo)eoVlAddMutation< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]
~eoUF()eoUF< EOT &, bool > [inline, virtual]

Generated on Thu Oct 19 05:07:00 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_vl_add_mutation.html b/trunk/paradiseo-eo/doc/html/classeo_vl_add_mutation.html new file mode 100644 index 000000000..35941b291 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_vl_add_mutation.html @@ -0,0 +1,114 @@ + + +EO: eoVlAddMutation< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoVlAddMutation< EOT > Class Template Reference

Addition of a gene Is inserted at a random position - so can be applied to both order-dependent and order-independent. +More... +

+#include <eoVariableLengthMutation.h> +

+

Inheritance diagram for eoVlAddMutation< EOT >: +

+ +eoMonOp< EOT > +eoOp< EOT > +eoUF< EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::AtomType AtomType

Public Member Functions

 eoVlAddMutation (unsigned _nMax, eoInit< AtomType > &_atomInit)
 default ctor
+bool operator() (EOT &_eo)
 operator: actually adds an Atom
+virtual std::string className () const
 inherited className

Private Attributes

+unsigned nMax
+eoInit< AtomType > & atomInit
+

Detailed Description

+

template<class EOT>
+ class eoVlAddMutation< EOT >

+ +Addition of a gene Is inserted at a random position - so can be applied to both order-dependent and order-independent. +

+ +

+Definition at line 48 of file eoVariableLengthMutation.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
eoVlAddMutation< EOT >::eoVlAddMutation ( unsigned  _nMax,
eoInit< AtomType > &  _atomInit
)  [inline]
+
+ + + + + +
+   + + +

+default ctor +

+

Parameters:
+ + + +
nMax max number of atoms
_atomInit an Atom initializer
+
+ +

+Definition at line 59 of file eoVariableLengthMutation.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:07:00 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_vl_add_mutation.png b/trunk/paradiseo-eo/doc/html/classeo_vl_add_mutation.png new file mode 100644 index 0000000000000000000000000000000000000000..410767495bcfadff56514a8d1114cdfcdbc47e0f GIT binary patch literal 1489 zcmah}c{J2}6dy^H5Gu07Bcrm!$uteJHJ&9~mXHS7CdxLpWUGkg4Z>g$<~>U)*`CKV z5`)V8PMB&MQ`T30v*3+AjBVcZ`mcZ9IiLHzpL@RNo_o&y+m>vMA(~-J-&m?P#+kbc!wx?$!cmJAqbYyss-tc-zzS9&ELG@T|#B8b=rR_j_CGNy_+huF~ zk#gf&jA<+@9yi?7U3%}5dh5o`h0&%Y-|b&@mP$PxhCm@gLDAbK;rskuELq?$Wvibcyw7p*Fw=UXa|=(WvPt7P{upXtfu^nia`Qc99Y3Kpx_L6#>2} z4I?bgrURM2g|yJJfs5(;YvmuuvAzKLcFSdFz;;=xP44rAFI3AW=@3J%E9r!9Vw$D2 zGqR#ai^#5ZZMAzjj{x+@^Ss86BS+cDU=8sS;_mYi{bcnFzvnxPLAIn5X5E{G;7a#}y>k6WBF7(%yfOYdVN!Y3P&X%Tmnt)h+ zb9WQa69<%*1EtA?@_$equkC})(JykWpS{BB^8ylV>OkZBag!L z%H{&gVY&fYP7alxfwDT$0ZW}qI4`U`p2P5ZWnV6VH@CmGWyFS^q&tQk#M9+}2HImT z6e0-K42CKrXPnt&wM^62{K+5sJ^}kQ_`9Mijk)|8ZMk>81yez3#F0DKM-G=%{Zf;J zP(8LgNK*l~-zYkPj7EQ;P2g#yXL@ez_>{Y*HOKGwBtjZ+bZmk+*u^@;kCM?I!H?=n zoORemE>F(CS3S9>MJtUywFaDjdsrr(ni8py?u`8mFCnP3@)pz$VLIzuu#F_ler2!6 znQOhA0FT78#!MzYYvpt}bHkrL>Q|+fw^`g0*PJ0qypDST`lKI8PMuujmzfT7)~qA5 zP?+m~%bUTWi!Q}e$%jXqRE1*A4XtRuA?HwT=18@SqiCn@^VZwc%cT>}k%IkQmCR*F zIZ6|rpBd(^?$r#S{)1Pq1m3e&13<%46CGWOq;)l* zb=p58($CLOO5M)GY5TYa6pew_InA+mste@CFKcDx#T1rshgHaf#s;AAwmR&60|G+` zt(v$eh;A!HlGp%Ve!NUmyt%suHpT>_u@Qs$k`Hlh=Z_M&!|LP(ez>6UdphlSYxmR4 zu@m3_)lL{sV}V)Ww8-I^+QNcXV9>mA|4h;j{eVsf2z%sTBq@%32A&yepuSKgHUT~>WFBwb2#haRcK5<(MVsMxdbu$QqoU*- zUI;ZXFRP2xGM@GkMN`h@>9rH}p^ + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoVlAtomExchangeQuadOp< EOT > Member List

This is the complete list of members for eoVlAtomExchangeQuadOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
atomExchange (defined in eoVlAtomExchangeQuadOp< EOT >)eoVlAtomExchangeQuadOp< EOT > [private]
AtomType typedef (defined in eoVlAtomExchangeQuadOp< EOT >)eoVlAtomExchangeQuadOp< EOT >
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const eoVlAtomExchangeQuadOp< EOT > [inline, virtual]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
eoQuadOp()eoQuadOp< EOT > [inline]
eoVlAtomExchangeQuadOp(unsigned _Min, unsigned _Max, eoAtomExchange< AtomType > &_atomExchange)eoVlAtomExchangeQuadOp< EOT > [inline]
functor_category()eoBF< EOT &, EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
Max (defined in eoVlAtomExchangeQuadOp< EOT >)eoVlAtomExchangeQuadOp< EOT > [private]
Min (defined in eoVlAtomExchangeQuadOp< EOT >)eoVlAtomExchangeQuadOp< EOT > [private]
operator()(EOT &_eo1, EOT &_eo2)eoVlAtomExchangeQuadOp< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoBF()eoBF< EOT &, EOT &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]

Generated on Thu Oct 19 05:07:00 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_vl_atom_exchange_quad_op.html b/trunk/paradiseo-eo/doc/html/classeo_vl_atom_exchange_quad_op.html new file mode 100644 index 000000000..154a54a2e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_vl_atom_exchange_quad_op.html @@ -0,0 +1,66 @@ + + +EO: eoVlAtomExchangeQuadOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoVlAtomExchangeQuadOp< EOT > Class Template Reference

Exchange Crossover using an AtomExchange. +More... +

+#include <eoVariableLengthCrossover.h> +

+

Inheritance diagram for eoVlAtomExchangeQuadOp< EOT >: +

+ +eoQuadOp< EOT > +eoOp< EOT > +eoBF< EOT &, EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::AtomType AtomType

Public Member Functions

+ eoVlAtomExchangeQuadOp (unsigned _Min, unsigned _Max, eoAtomExchange< AtomType > &_atomExchange)
 default ctor: requires bounds on number of genes + a rate
+bool operator() (EOT &_eo1, EOT &_eo2)
 The pure virtual function that needs to be implemented by the subclass.
+virtual std::string className () const
 the inherited className

Private Attributes

+unsigned Min
+unsigned Max
+eoAtomExchange< AtomType > & atomExchange
+

Detailed Description

+

template<class EOT>
+ class eoVlAtomExchangeQuadOp< EOT >

+ +Exchange Crossover using an AtomExchange. +

+ +

+Definition at line 89 of file eoVariableLengthCrossover.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:07:00 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_vl_atom_exchange_quad_op.png b/trunk/paradiseo-eo/doc/html/classeo_vl_atom_exchange_quad_op.png new file mode 100644 index 0000000000000000000000000000000000000000..fc6f08d91cccb5e8554b33802495268313fbef9b GIT binary patch literal 1792 zcmbVNdr;C@6sFv*P1muqvJ`WgMr~^&l|a$d%``()QhZdJuS^#e8vJ2Cb89!(w9>Nj z5vYsgvouSRh%re+lYkVwPBW_9TXEX90Car`;-^5K@xzbE2>ovGBlmq2I(3vD%VCY{r zUUju%Ex6cuB-EnByFq<+Iwp?Mx{=PdQ-g8JZW3Y1o(#y7gIovNe3I>h0k?|dkW7cEDK?&%}l=6~UqeLod zvo#(t02-KH;*i-5(d8(o=1y2M0XEm~A+{5jap8ck^b|p%X+o*f2W)XS_*tqxZ3K+L zxQ1uBAS^R3A>&8SY&jG>mZjbW_l?%A;Z?Ty0yYHcLVR|)zzIWB+49+^XMpd0ur z10wSD`F^KRTWvhQ2WvRcwZ-(MfR4;f)wb)aXJ%F^OSXN#3A~+UFvb0=uTuH)mL)K=Mq3lP&8Kf0bCl$KxiOK`(Zo9{+}=IvMZS)| zf%#2n3}jMqV*H;21zw~pC1U^NYphi6s*u1fG0#H6gM#g1$(977)A`!5gS+5NnxY$- zJp3zAsdz(8q_C@7lHh`!m@8xDPr(e!hI<)Qj1^N0P%)yK;u>9H5{w_Hn3wEgc9;Yl zD-WskHaT(d+J@)@tE+TD7Q)GqSBk{kOfm9Hs|!olH$w*3jc}ivBGrX+*_8C~NgL1Y z=3q@_JM<2@m|mC}1@JAzw$-tF>`U)2lad$p@25P8iu4WF#^PX*kQ$*(<0$ZoL<^?{oiO$(q*^NW!iQCqK687*g<0CE4ujvl? z7YpS1{FZt1$7PHNq1l`MQHS7f696M!qao(2E#{7ma9-`0MX zuf7W+nl_28yM7Y2)v(+hw}QWFA#TCdBX|iAZL??pfA#*=Lw<|IKM%ELt(0Vkp*ssV ze7-7JtPpzPWoX7wbWEE_as0?}C5*CD>MX!oH%Z+pa5y___uJ^p$;^unPu$i(N}ER96jg*kP22P+bI@SYO*L~`I<-nu&1Rq?#fLOU_qZL` zylodOR2XNLH;!#TO&qB(=<^3sJ6-Itg27`>`;us>sfe8V0WfMyf=VD9f)jw8d-7tq zGCRt3dg@GBF+hJ7-Eip=O6GBTXe$n&wKk;5ZzvqWsI!US!>7)4R1eqLT?9%J?&%8% zM7*Ma0E4z@!%AkonuyPH94OvL!ep{OowUKe_&gwz=)-4q?K}sNh)FGXX3z5k)%I*b zxQVLmei=p9_cl!-0_2&wof^>}&GEh*=zQ5@CeF!%aTvJsxmmnP0peZli0j3_<0krO SXJEST3WE0Vb#HKs`28Q_)0x}= literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_vl_del_mutation-members.html b/trunk/paradiseo-eo/doc/html/classeo_vl_del_mutation-members.html new file mode 100644 index 000000000..b7fd7a06e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_vl_del_mutation-members.html @@ -0,0 +1,34 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoVlDelMutation< EOT > Member List

This is the complete list of members for eoVlDelMutation< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
AtomType typedef (defined in eoVlDelMutation< EOT >)eoVlDelMutation< EOT >
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
chooser (defined in eoVlDelMutation< EOT >)eoVlDelMutation< EOT > [private]
className() const (defined in eoVlDelMutation< EOT >)eoVlDelMutation< EOT > [inline, virtual]
eoMonOp()eoMonOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
eoVlDelMutation(unsigned _nMin, eoGeneDelChooser< EOT > &_chooser)eoVlDelMutation< EOT > [inline]
eoVlDelMutation(unsigned _nMin)eoVlDelMutation< EOT > [inline]
functor_category()eoUF< EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
nMin (defined in eoVlDelMutation< EOT >)eoVlDelMutation< EOT > [private]
operator()(EOT &_eo)eoVlDelMutation< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
uChooser (defined in eoVlDelMutation< EOT >)eoVlDelMutation< EOT > [private]
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]
~eoUF()eoUF< EOT &, bool > [inline, virtual]

Generated on Thu Oct 19 05:07:01 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_vl_del_mutation.html b/trunk/paradiseo-eo/doc/html/classeo_vl_del_mutation.html new file mode 100644 index 000000000..28e5acdac --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_vl_del_mutation.html @@ -0,0 +1,203 @@ + + +EO: eoVlDelMutation< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoVlDelMutation< EOT > Class Template Reference

Deletion of a gene By default at a random position, but a "chooser" can be specified can of course be applied to both order-dependent and order-independent. +More... +

+#include <eoVariableLengthMutation.h> +

+

Inheritance diagram for eoVlDelMutation< EOT >: +

+ +eoMonOp< EOT > +eoOp< EOT > +eoUF< EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::AtomType AtomType

Public Member Functions

 eoVlDelMutation (unsigned _nMin, eoGeneDelChooser< EOT > &_chooser)
 ctor with an external gene chooser
 eoVlDelMutation (unsigned _nMin)
 ctor with uniform gene chooser - the default
bool operator() (EOT &_eo)
 Do the job (delete one gene).
+virtual std::string className () const

Private Attributes

+unsigned nMin
+eoUniformGeneChooser< EOT > uChooser
+eoGeneDelChooser< EOT > & chooser
+

Detailed Description

+

template<class EOT>
+ class eoVlDelMutation< EOT >

+ +Deletion of a gene By default at a random position, but a "chooser" can be specified can of course be applied to both order-dependent and order-independent. +

+ +

+Definition at line 110 of file eoVariableLengthMutation.h.

Constructor & Destructor Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + +
+template<class EOT>
eoVlDelMutation< EOT >::eoVlDelMutation ( unsigned  _nMin,
eoGeneDelChooser< EOT > &  _chooser
)  [inline]
+
+ + + + + +
+   + + +

+ctor with an external gene chooser +

+

Parameters:
+ + + +
nMin min number of atoms to leave in the individual
_geneChooser an eoGeneCHooser to choose which one to delete
+
+ +

+Definition at line 121 of file eoVariableLengthMutation.h.

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
eoVlDelMutation< EOT >::eoVlDelMutation ( unsigned  _nMin  )  [inline]
+
+ + + + + +
+   + + +

+ctor with uniform gene chooser - the default +

+

Parameters:
+ + +
nMin min number of atoms to leave in the individual
+
+ +

+Definition at line 128 of file eoVariableLengthMutation.h.

+

Member Function Documentation

+

+ + + + +
+ + + + + + + + + + + + +
+template<class EOT>
bool eoVlDelMutation< EOT >::operator() ( EOT &  _eo  )  [inline, virtual]
+
+ + + + + +
+   + + +

+Do the job (delete one gene). +

+

Parameters:
+ + +
_eo the EO to mutate
+
+ +

+Implements eoUF< EOT &, bool >. +

+Definition at line 134 of file eoVariableLengthMutation.h.

+

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:07:01 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_vl_del_mutation.png b/trunk/paradiseo-eo/doc/html/classeo_vl_del_mutation.png new file mode 100644 index 0000000000000000000000000000000000000000..bfb801afbf8a55f9c54cc285dd73ace644718edc GIT binary patch literal 1489 zcmai!doJ{eNB$v#K<9?l#yC|2*Mq1lki{y1bGc**Ha<8M- z7@^1_Q;T{r!Y?%DWy>@h-qoM|^Pcm0p6C0V=RAKsmt0SGM27&gh zOLWgZDT!ZjbL2_FAD*th4!gU%61ltEQ&SUKBvHStr>6(sw+l$pJxSi~J|NqL&ru+d zbhI7%kK2wIQXf9q3tjnKyt8`1sGvV5 zve>=uEmy5MB+W#j**0op{R=f@lfISj516!;Qy3K#25V3jbTCeS=K3DQzGX}xS86nG z@y4In8C;W4x?+%gr;mC&e#VI>z1&e~3c1fVp(*PQl3HbLd3M|TM^84`S*SR*d}?FL z@tn0f1+@fsR%C$&FlCt$h=NvwD@+S7+oNSO2*548dI9)5CsZv9oqT7Gw5blPAwN0? z@{Y%mD&06lrZbvBZ0}r+x?ZkI$^{>>lFObN!Ll{%3~D~i$^d1(CG!<_XU)3oYfh^S zNz=X&%xIYkgl_FOmt-N_A;ljB7Z&x^J4Ar_G|Cz!0-%W6kX61Y7IQ(l)r4I+wROJx z2-SL~$m1&kI)Yu^33G$OnPKE9>IlHMQo(d4sdn{9q6ngRHwI2)4`UC^C85(Y^RMP2 zhWEvcZne|c(QzqfQutuk%45ZohVOef2!R$9Run}r_#iD-t?m_nOc_@@q%x)~91F+5 zqA{=;T|LobY*VWI=NIe&ZT~qWSqxV*;_;7#>i9=8(xAG^94|mTkZXXLReS^B%+#J7 z(t|M@pWGsyg5!eo9hzR}GWaq2;kxcO7+SifsTzC@l3b}qKk)ta@0=rv%+q(gY?!Y$fiMwbk^gLb|rrDnC~MJeS|AoM&sG z7vej+RBso@m_drIg;r1dvmh8PZupumTqMIUiFgKq>Xb#jvrfz3sRpxT%p1OStuw8vs^V@jRB;mMb7H$pWd7V2J)~-{Qoafp9!jre-FE&<*q83yBB0Z7ygfLf_(m z4)iUiT9&pwfrA29Qy$vDnej3Mu`85G_J%lfsvtpOfi>H*_*}`=d0r2Le>6)Z2W`*e zUtptN7K?qGcTgoYs=NJtfa?h0+U>c@%v#?5i13e)JL{$D)fF)y>}_fBN` zpwh#O@?F{vWC}Vvf=3VMHJFwe^#OjD^}}v38b1W|?Jq?=(C&{m>&Cfxl9cteVfA{y zlMoV;sA*f$K;Njl_3OwiX`P!|B;Td+6Nq6m$K0Ffcg2$pQuZxFD&7k0%A+YH80Xv% zLzK($q}XaJ+GsNZ0}{Cfz9PCoQA^`sTHCXL(?H@)v{H#e$c(__XS?XOv8Xv_u*zFf z7Z%s%RhQGP;Wz_0jwsnaJ*2z9XEA`tOw$N=Akzm9H5qHW1V_vH%e~jtqs*35s{fbn z9D3I9mg$#!9RqJX)Jv(BsU79?v31t7l*pDrttik4mNUHho;L# z%Rf>WM0Mf$w^KV8FNrPNt&EpQ%cf@wfvV}JKul14y1X=N0^zQCFo*>}vaf0t&0|~3 zh|zN(^^U`vowx%SoR4AE8na%pkM{u*LhE#&#u) zu8eM)Q$?tbWgLsv)w|B>2bv3N3}6Y#;v_h(alSs!NSH$4h;6uudmm5jJ@NBlgPa}Q Kku7IKGyeku`~au` literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_vl_uniform_bin_op-members.html b/trunk/paradiseo-eo/doc/html/classeo_vl_uniform_bin_op-members.html new file mode 100644 index 000000000..be2066392 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_vl_uniform_bin_op-members.html @@ -0,0 +1,33 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoVlUniformBinOp< EOT > Member List

This is the complete list of members for eoVlUniformBinOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
AtomType typedef (defined in eoVlUniformBinOp< EOT >)eoVlUniformBinOp< EOT >
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const (defined in eoBinOp< EOT >)eoBinOp< EOT > [inline, virtual]
eoBinOp()eoBinOp< EOT > [inline]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
eoVlUniformBinOp(unsigned _Min, unsigned _Max, double _rate=0.5) (defined in eoVlUniformBinOp< EOT >)eoVlUniformBinOp< EOT > [inline]
functor_category()eoBF< EOT &, const EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
Max (defined in eoVlUniformBinOp< EOT >)eoVlUniformBinOp< EOT > [private]
Min (defined in eoVlUniformBinOp< EOT >)eoVlUniformBinOp< EOT > [private]
operator()(EOT &_eo1, const EOT &_eo2)eoVlUniformBinOp< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
rate (defined in eoVlUniformBinOp< EOT >)eoVlUniformBinOp< EOT > [private]
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoBF()eoBF< EOT &, const EOT &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]

Generated on Thu Oct 19 05:07:01 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_vl_uniform_bin_op.html b/trunk/paradiseo-eo/doc/html/classeo_vl_uniform_bin_op.html new file mode 100644 index 000000000..078102212 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_vl_uniform_bin_op.html @@ -0,0 +1,63 @@ + + +EO: eoVlUniformBinOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoVlUniformBinOp< EOT > Class Template Reference

Direct Uniform Exchange of genes for Variable Length, BINARY version. +More... +

+#include <eoVariableLengthCrossover.h> +

+

Inheritance diagram for eoVlUniformBinOp< EOT >: +

+ +eoBinOp< EOT > +eoOp< EOT > +eoBF< EOT &, const EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::AtomType AtomType

Public Member Functions

+ eoVlUniformBinOp (unsigned _Min, unsigned _Max, double _rate=0.5)
+bool operator() (EOT &_eo1, const EOT &_eo2)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+unsigned Min
+unsigned Max
+double rate
+

Detailed Description

+

template<class EOT>
+ class eoVlUniformBinOp< EOT >

+ +Direct Uniform Exchange of genes for Variable Length, BINARY version. +

+A very primitive version, that does no verification at all!!! NEEDS to be improved - but no time now :-((( Especially, if both guys have maximal size, it will take some time to generate even 1 offspring that is not oversized!!! Also, we should first check for identical atoms, and copy them to the offspring, and only after that exchange the other ones (Radcliffe's RRR). +

+ +

+Definition at line 280 of file eoVariableLengthCrossover.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:07:01 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_vl_uniform_bin_op.png b/trunk/paradiseo-eo/doc/html/classeo_vl_uniform_bin_op.png new file mode 100644 index 0000000000000000000000000000000000000000..686d2ac65f4e11a99e608f544e24adb3ec14083d GIT binary patch literal 1951 zcmb7_c~sL^7RN(Dv4|kfw1A?(k%UM~6eKL7KtLp6Uj)Mvi4YKm7&Ntk$RdXUilr?6 z5;kGNrsE(aNJ0vfC8!AeK+tMgLfDK!Y9T;EAqGM-sU1)2IsP+$y!YpB!s=^nktaq)a zrzhp1Qly%yT@CaNg1Ee%h=o8jk(kq{v&og>%Ha~W{ob7UCk`wh+t5c-JxQ^o+~Ac^ z>Xuvjrv|6vQ-cn#ylP=)_*4Ibcx8tz9YQI-_{Q0maRz(|?=QW6!YUa|veKq2sBl9F zRK1!28HKibzFDgG^(rhP_Nh4)gvJyOM{V1Gc0Wn>;8aP-SGKyRDNN9e$=58R;xu z475(U!i0*Am3CnffoXarAk{|)GmU^62hhBL;C(m8{E!Y6xH2rA*4hcX$jM6vvPMNj z%8y4@$PvPe`rWWEn7ZXSY%pvrFsVuSJf#fRo8_}6!qSTUX5t^t4Q7L{!IyU|I-3S> z;ZlpZeyQ2IuqM21>%@ez-mKzR)bhde&d3}<29vHh&_w_6w}yD`bO9l7!=5WZLZoJq zq^nfJ=pmN^@!FhJOI0ndz8EjSkF4LNXc%Vz&QI4pCaTkK|7%?Zf=22q^>Q~mEA(!~9?IE{Cg{=|fr zeQ9*`;4xC8n|hrlSRc{rd$mS4&=h|Jz%82CwKdz6?A+El0Hoo>gZ(dp)Ca%p!P3^e z3#bhj0WY<2`cjS^CM5nchur)~dQ0>ZYUB<4P*c9t8e}43*aZvGrtNz#PkS$Gl}{Bb zQ)e$AX&n({Npigb0qBToM~9j?(xPkI5Lr~8kr}Zm(!u%s$*9TX5E_S{UEm%{@zLSz zw)11e>R*}JZ0BbWE~pK?lJB#eEZg811fMPEoXU3+dYB)aMwKyNi) z_am6RD=BRuq}dIZNI@>XciTPn@CO{duQ?w&S$~4Jfo6nZ zTR5@gp%4f5WDy>-A z(Nd%!fz_gN!a3U4^vX%3WmtPxLOIYS>KqM+wdY$3KA#t!8lo>jlW+m#0TFkkkgi~e zC@}so;`Q%IdmrXO8Ae3;P}W58l;*hk4FtV&|_+LT(P@KOwtLj9T8^prsUHi+c z{dLYf8_>umAIm%ggVX=1XJd`3G5W6h=BHZo`13~mHa^pE<-peMb{qcC{yPexB%r(X zN;iIG>Dt!>xYA7}EAJl0@5L`I`H`|st8O~;CerpG^Hd6lml#d59kk@-+xXs&BqojD zHsi^wasWFIO2^bKFB&Gq>5kY3cQzU+fRdWi2-lIQ%Lr-*!Cy)TX$0l7aZxzE(&Br| z$5dEim{XHT@`Ba0t2G#`i7*Fi@F(ecmO~50OEz8R4g_hS^>I0PtqNS`EdbNMsMwCx zZv+>!_}QgI^M@#Q1@1`#JN(ozLU^*AllRDDjF`yY3FT=)^;MtNN21oq_x6Wt9*!eq kx;m8oa8B*XUURwgN{PYW!kTlRs(w=l#@+Wc%N3vbUs5%tn*aa+ literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_vl_uniform_quad_op-members.html b/trunk/paradiseo-eo/doc/html/classeo_vl_uniform_quad_op-members.html new file mode 100644 index 000000000..96788d54f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_vl_uniform_quad_op-members.html @@ -0,0 +1,33 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoVlUniformQuadOp< EOT > Member List

This is the complete list of members for eoVlUniformQuadOp< EOT >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
AtomType typedef (defined in eoVlUniformQuadOp< EOT >)eoVlUniformQuadOp< EOT >
binary enum value (defined in eoOp< EOT >)eoOp< EOT >
className() const (defined in eoQuadOp< EOT >)eoQuadOp< EOT > [inline, virtual]
eoOp(OpType _type)eoOp< EOT > [inline]
eoOp(const eoOp &_eop)eoOp< EOT > [inline]
eoQuadOp()eoQuadOp< EOT > [inline]
eoVlUniformQuadOp(unsigned _Min, unsigned _Max, double _rate=0.5) (defined in eoVlUniformQuadOp< EOT >)eoVlUniformQuadOp< EOT > [inline]
functor_category()eoBF< EOT &, EOT &, bool > [inline, static]
general enum value (defined in eoOp< EOT >)eoOp< EOT >
getType() const eoOp< EOT > [inline]
Max (defined in eoVlUniformQuadOp< EOT >)eoVlUniformQuadOp< EOT > [private]
Min (defined in eoVlUniformQuadOp< EOT >)eoVlUniformQuadOp< EOT > [private]
operator()(EOT &_eo1, EOT &_eo2)eoVlUniformQuadOp< EOT > [inline, virtual]
quadratic enum value (defined in eoOp< EOT >)eoOp< EOT >
rate (defined in eoVlUniformQuadOp< EOT >)eoVlUniformQuadOp< EOT > [private]
unary enum value (defined in eoOp< EOT >)eoOp< EOT >
~eoBF()eoBF< EOT &, EOT &, bool > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]
~eoOp()eoOp< EOT > [inline, virtual]

Generated on Thu Oct 19 05:07:01 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_vl_uniform_quad_op.html b/trunk/paradiseo-eo/doc/html/classeo_vl_uniform_quad_op.html new file mode 100644 index 000000000..bdfab9694 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_vl_uniform_quad_op.html @@ -0,0 +1,63 @@ + + +EO: eoVlUniformQuadOp< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoVlUniformQuadOp< EOT > Class Template Reference

Direct Uniform Exchange of genes (obsolete, already :-) stays there for historical reasons. +More... +

+#include <eoVariableLengthCrossover.h> +

+

Inheritance diagram for eoVlUniformQuadOp< EOT >: +

+ +eoQuadOp< EOT > +eoOp< EOT > +eoBF< EOT &, EOT &, bool > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + + + + + +

Public Types

+typedef EOT::AtomType AtomType

Public Member Functions

+ eoVlUniformQuadOp (unsigned _Min, unsigned _Max, double _rate=0.5)
+bool operator() (EOT &_eo1, EOT &_eo2)
 The pure virtual function that needs to be implemented by the subclass.

Private Attributes

+unsigned Min
+unsigned Max
+double rate
+

Detailed Description

+

template<class EOT>
+ class eoVlUniformQuadOp< EOT >

+ +Direct Uniform Exchange of genes (obsolete, already :-) stays there for historical reasons. +

+A very primitive version, that does no verification at all!!! NEEDS to be improved - but no time now :-((( Especially, if both guys have maximal size, it will take a lot of time to generate 2 offspring that both are not oversized!!! Also, we should first check for identical atoms, and copy them to the offspring, and only after that exchange the other ones (Radcliffe's RRR). +

+ +

+Definition at line 219 of file eoVariableLengthCrossover.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:07:01 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_vl_uniform_quad_op.png b/trunk/paradiseo-eo/doc/html/classeo_vl_uniform_quad_op.png new file mode 100644 index 0000000000000000000000000000000000000000..e071baad2d617d9c2133f4fa53b1d11658afec5c GIT binary patch literal 1719 zcmbW2X;70_6o#X?3&B=E2T-cix=tuU2%#)0n~)~RZq33b5D1I$BVb99N>v0|EEXYO z0tjI-!GH@A6AU0@WrT!P)&MOai4fMX7$JscsMB_))BbSgp69&x%$+-D&U7 z+|pE#$M$LQ%lJ)}g^X7Z_r^YT$HRh^?|oD2BA1<9+VxUvlswmA(O~giB*;`RUMnce z?s$c_aojGXaK#U-&9Won;#L}2?W(6*Q9-t`M~BdLNV~RaiM%F0bzCtmn9f7ijAeW;W;~J-v8XtM>(2}FCaxd0x<{s3 z6K`zdV}2Lq+WHc> zg;@Qj__1@=wrMjf;$es$f7Dq64A?C8K>J!TI?+*+yR>MvDNMv@c%!p`5MIgum${YQ|a?G@%A-OkRUZAqd?zv))>TFC2TcMmXpFUe(Ob7luDHk zqjm%M)3D~1Q@|nfN|W=_J688y z$TD6SynRe@e4WE4P!$8y(J>McMI_SG)AU}70 zltFOoY`jyY+e72QDO8Z|YxvOnTA-d_F_?mtIN@FBSU0ooxnub>tUH%Puc@fwai-;r zDT_EXRTd70-RaLr^rX*cKb?@1VYC5ND;eg(3@YL%eA9t|ii?#}2@hU-cUdvO_Ts;7 z#)E`w2Lh@`{NUV>&}3yt`1r<|ebxEwp8SSXQDoO_V5Ba6<@EBPD4`+-v`3X8t3IX$ z4f;-1FUC@^yL4jVKrXv;*Q_yB_vVG=&xz16-&l^$@WO#M!!(xK`Hu&3{Mi`4r2i~z zsYC>-El<-h@i5jD6}A~}`yY5kViYDNdv*`kwZ!=oq1Pm5)<8hya6*fkb8J{Iaka2y znBUSHrKEJxxuI(^%4Q3`cJkGG5xQrrQ8uyiV8~_o(ZMcS4Z*Hztt`uY+lKv9i)5KX z!Q#&5{MY_1268N!adhpXh5@T3kMgD#PXCaO3H9P-AhY<6^0=toP$by=+Z^-nj%PjX zKVz$k`CCAHmSR76iU@sECaKfGZxB7daQ#FfQU|pEM6mjC%wl4Ro8XqyF|)ts)085D zFZqeD0ud%h23Z}{DN9FgA7(6r=oNbw1DD8+>61dNY&vTw)7iQWa0Qwy_M5z*kw9{g zX20Twm^_EDc-{Y#(mlUB5z$2>C1v;FWcmdw`ZM=Jj!U7DNl0qv1`><6xEGtuYmR7% z#zexlX*$1GKNxP6h{OJ-1Q|C{9ZIMcJt^d}U*q0Z-W=kWPX8i-R$%p;)rpmIOU)82l1V86951J literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/classeo_weak_elitist_replacement-members.html b/trunk/paradiseo-eo/doc/html/classeo_weak_elitist_replacement-members.html new file mode 100644 index 000000000..c40ed2f9d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_weak_elitist_replacement-members.html @@ -0,0 +1,21 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoWeakElitistReplacement< EOT > Member List

This is the complete list of members for eoWeakElitistReplacement< EOT >, including all inherited members.

+ + + + + + + +
eoWeakElitistReplacement(eoReplacement< EOT > &_replace) (defined in eoWeakElitistReplacement< EOT >)eoWeakElitistReplacement< EOT > [inline]
Fitness typedef (defined in eoWeakElitistReplacement< EOT >)eoWeakElitistReplacement< EOT >
functor_category()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, static]
operator()(eoPop< EOT > &_pop, eoPop< EOT > &_offspring)eoWeakElitistReplacement< EOT > [inline, virtual]
replace (defined in eoWeakElitistReplacement< EOT >)eoWeakElitistReplacement< EOT > [private]
~eoBF()eoBF< eoPop< EOT > &, eoPop< EOT > &, void > [inline, virtual]
~eoFunctorBase()eoFunctorBase [inline, virtual]

Generated on Thu Oct 19 05:07:01 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_weak_elitist_replacement.html b/trunk/paradiseo-eo/doc/html/classeo_weak_elitist_replacement.html new file mode 100644 index 000000000..026091526 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classeo_weak_elitist_replacement.html @@ -0,0 +1,56 @@ + + +EO: eoWeakElitistReplacement< EOT > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

eoWeakElitistReplacement< EOT > Class Template Reference

eoWeakElitistReplacement: a wrapper for other replacement procedures. +More... +

+#include <eoReplacement.h> +

+

Inheritance diagram for eoWeakElitistReplacement< EOT >: +

+ +eoReplacement< EOT > +eoBF< eoPop< EOT > &, eoPop< EOT > &, void > +eoFunctorBase + +List of all members. + + + + + + + + + + + + + +

Public Types

+typedef EOT::Fitness Fitness

Public Member Functions

+ eoWeakElitistReplacement (eoReplacement< EOT > &_replace)
+void operator() (eoPop< EOT > &_pop, eoPop< EOT > &_offspring)
 do replacement

Private Attributes

+eoReplacement< EOT > & replace
+

Detailed Description

+

template<class EOT>
+ class eoWeakElitistReplacement< EOT >

+ +eoWeakElitistReplacement: a wrapper for other replacement procedures. +

+Copies in the new pop the best individual from the old pop, AFTER normal replacement, if the best of the new pop is worse than the best of the old pop. Removes the worse individual from the new pop. This could be changed by adding a selector there... +

+ +

+Definition at line 102 of file eoReplacement.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:07:01 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classeo_weak_elitist_replacement.png b/trunk/paradiseo-eo/doc/html/classeo_weak_elitist_replacement.png new file mode 100644 index 0000000000000000000000000000000000000000..08ad8e9fd243e1f48132d3a61adac815cc3ccd38 GIT binary patch literal 1935 zcmbtVeN@s}8m62wtte}n5JhZVb;leX8$uF=3SG-dGZn4O&u!HVOB@v`k+Mm%z+68v zkBXV2v!KapfSMy{B$Q2w-^Pbb{zOYhCrkwuWvQLBcFvytW6%C^@B6;@y!W1apZ9s* zo8#~2z10+I3Ic()9zEh200ONaHTdnH85!n>NDGL;K>UvddFl0fgR9rKS5!pi8N839 zy}kYNWBr&RT$dc+7YI5yJ{$uA8QUK9JQS2xHeL2SzY4Y8%lDWk+stAxIwLZAJe$Mv z*qcF}`)nO69^DZ_Z~3v-<&LczrK~78rFmAZv?ZhZZOJ=l%I~b8ha)hikWw3 zX#%%3?Bm;0AFIqSq_I1}^r>Ad&E%)6OHYQdisz`}u6vE8n(w67J~t}w?fOpN83fn~G#jX>7~ zIUi0VHRQ^AUZ(?r2hqCv|l{SHF%0_##ql+qD^b zw$6&WkCBuvZ4MQYUbzVZyMhzw6(s-}Hl*grAk+w$GX%a|cS9t0O-YyH#|T4aT|!hy zOb_dqRgV;RS?!ybx41TLzv9zjLq39w?9tkr-ET0^rqXMi6E`jwk*Ubv+-m0QZKmr2 zDK`qlWLD$=sx5)Neq2^@U^5Q;{z>NJ+;E-)je3W;j0nN%Rv7l6i9#ad}BS5@#q6U{#h%*FAON8s$aB8(WJ%*=1gn3Q9UQ4LW=Ge@ze# zrMPevD_3FU7NO>3!(M}T@t z!N|fP`FwJ3BDrKh{BcZR@d$H0JdJC*-j?#g6warPmwrLJDnJCxb?8q}bmt z}0b2>7pfzmT>Q;uQ5#$AJhI+|7CCvF-YzaA7l1YZ)k@HsJV^6y6(BCaX@YBcGv;(ATix#9VE zQ_8ho*F(EkXO?_>wFSwQIZ?YWM=kP$na+2t3TFat<6!8h1R9*_*o3SPYI=Iy*rP7u z%DrLDXlRn|%Isxm2&*)7vbyh05Hr%9ho*Uqq~g8mbqrD9KK85|W1EXO+g;owDgm4= z^vqoLjME3*{UcZ4LuU6@N5Pg|#F)Pc8{re-s?QmOptKzbKcL(2SS|L{rzlh~wANaa zJs+B;LL-r&AgM|m4oK9#%rU_G|3P^RF?o~2<-+b6WcUf8TZ+|#`jQaY3qP5=yjV~% zZNu-$U-fELB^nDtFL`85CCRl(K<;!>rxLP_o!3fMD1B+JPWG}mIb(Pk)6y0E8q5e%39RL z4$oiETz$V@O^kl%Hu8hph~2BVc~-}r5Bd|HlNbQ|Pl6mG8)>e&NFLGJsI<5Z)#vV` z)qX{$q7? + +EO: Alphabetical List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

EO Class Index

1 | A | B | C | D | E | F | G | H | I | L | M | N | O | P | Q | R | S | T | U | V | W

+ +
  1  
+		eoGeneDelChooser   eoQuadOp   
eo1PtBitCrossover   eoGeneralBreeder   
  R  
+
  A  
+		eoGeneralIntBounds   random_generator   
eoAged   eoGeneralRealBounds   RandomNodeSelector   
eoAlgo   eoGenerationalReplacement   eoRandomReduce   
eoArithmeticCrossover   eoGenOp   eoRandomSelect   
eoAssembledFitnessAverageStat   eoGnuplot   eoRandomSplit   
eoAssembledFitnessBestStat   eoGnuplot1DMonitor   eoRanking   
eoAtomExchange   eoGnuplot1DSnapshot   eoRankingSelect   
eoAverageStat   
  H  
+		eoReal   
  B  
+		eoHammingDistance   eoRealAboveBound   
eoBestFitnessStat   eoHoistMutation   eoRealBaseVectorBounds   
eoBestSelect   eoHowMany   eoRealBelowBound   
eoBF   
  I  
+		eoRealBounds   
BiasedNodeSelector   eoIncrementor   eoRealInitBounded   
eoBinaryFunctorCounter   eoIncrementorParam   eoRealInterval   
eoBinCloneOp   eoInit   eoRealNoBounds   
eoBinGenOp   eoInitAdaptor   eoRealUxOver   
eoBinOp   eoInitFixedLength   eoRealVectorBounds   
eoBit   eoInitGenerator   eoRealVectorNoBounds   
eoBitBitFlip   eoInitVariableLength   eoReduce   
eoBitGxOver   eoInitVirus   eoReduceMerge   
eoBitInversion   eoInitVirus1bit   eoReduceMergeReduce   
eoBitMutation   eoInnerExchangeQuadOp   eoReduceSplit   
eoBitNext   eoIntAboveBound   eoReplacement   
eoBitOpFactory   eoIntBelowBound   eoRndGenerator   
eoBitPrev   eoIntBounds   eoRng   
boolean_generator   eoIntInterval   eoRouletteWorthSelect   
eoBooleanGenerator   eoIntNoBounds   
  S  
+
eoBooleanInit   eoInvalidateBinOp   eoScalarFitness   
eoBoolFlip   eoInvalidateMonOp   eoScalarFitnessAssembled   
eoBranchMutation   eoInvalidateQuadOp   eoScalarFitnessAssembledTraits   
eoBreed   
  L  
+		eoScalarFitnessStat   
  C  
+		eoLinearFitScaling   eoSecondMomentStats   
eoCellularEasyEA   eoLinearRandomSplit   eoSegmentCrossover   
eoCheckPoint   eoLinearTruncate   eoSelBinGenOp   
eoCMABreed   eoLinearTruncateSplit   eoSelect   
eoCMAInit   
  M  
+		eoSelectFactory   
eoCollapseSubtreeMutation   MemPool   eoSelectFromWorth   
eoCombinedContinue   MemPool (gp_parse_tree)   eoSelectivePopulator   
eoCombinedInit   eoMerge   eoSelectMany   
eoCommaReplacement   eoMergeReduce   eoSelectNumber   
eoContinue   eoMGGReplacement   eoSelectOne   
eoCountedDynUpdate   MinimizingTraits   eoSelectPerc   
eoCountedStateSaver   eoMOFitnessStat   eoSelectTransform   
Cov   eoMonCloneOp   eoSeqPopulator   
eoCtrlCContinue   eoMonGenOp   eoSequentialOp   
  D  
+		eoMonitor   eoSequentialSelect   
eoDetBitFlip   eoMonOp   eoSGA   
eoDeterministicSaDReplacement   
  N  
+		eoSGAGenOp   
eoDeterministicSurviveAndDie   eoNDPlusReplacement   eoSGATransform   
eoDetSelect   eoNDSorting   eoSharing   
eoDetTournamentSelect   eoNDSorting::DummyEO   eoSharingSelect   
eoDetTournamentTruncate   eoNDSorting_I   eoSimpleEDA   
eoDetTournamentTruncateSplit   eoNDSorting_II   eoSortedPopStat   
eoDetTournamentWorthSelect   negexp_generator   eoSortedStat   
eoDetUniformMutation   eoNegExpGenerator   eoSortedStatBase   
eoDistance   eoNegExpInit   eoSSGADetTournamentReplacement   
eoDistribUpdater   NodeSelector   eoSSGAStochTournamentReplacement   
eoDistribution   eoNoElitism   eoSSGAWorseReplacement   
dMatrix   eoNoPerf2Worth   eoStat   
eoDominanceMap   normal_generator   eoStatBase   
eoDoubleExchange   eoNormalGenerator   eoState   
eoDoubleIntermediate   eoNormalInit   eoState::loading_error   
eoDrawable   eoNormalMutation   eoStBranchMutation   
Dummy   eoNormalVecMutation   eoStdoutMonitor   
eoDynSGATransform   eoNoSelect   eoSteadyFitContinue   
eoDynUpdater   eoNPtsBitXover   eoStHoistMutation   
  E  
+		eoNthElementFitnessStat   eoSTLBF   
eoEasyEA   
  O  
+		eoSTLF   
eoEDA   eoObject   eoSTLUF   
eoEliteSequentialSelect   eoOneFifthMutation   eoStochasticUniversalSelect   
eoElitism   eoOneMax   eoStochTournamentSelect   
EO   eoOneMaxEvalFunc   eoStochTournamentTruncate   
eoEPReduce   eoOneMaxInit   eoStochTournamentTruncateSplit   
eoEPReplacement   eoOneMaxMutation   eoStochTournamentWorthSelect   
eoEsChromInit   eoOneMaxQuadCrossover   eoStParseTreeDepthInit   
eoEsFull   eoOp   eoStPointMutation   
eoEsGlobalXover   eoOpContainer   eoString   
eoEsMutate   eoOpSelMason   eoStSubtreeXOver   
eoEsMutationInit   
  P  
+		eoSubtreeXOver   
eoEsSimple   eoParam   eoSurviveAndDie   
eoEsStandardXover   eoParameterLoader   eoSymInit   
eoEsStdev   eoParamParamType   
  T  
+
eoEvalContinue   eoParetoFitness   T_pickle_suite   
eoEvalFunc   eoParetoFitnessTraits   eoTimeCounter   
eoEvalFuncCounter   eoParetoOneConstraintFitness   eoTimedDynUpdate   
eoEvalFuncPtr   eoParetoRanking   eoTimedMonitor   
eoExpansionMutation   eoParser   eoTimedStateSaver   
eoExternalBinOp   eoParseTree   eoTimeVaryingLoopEval   
eoExternalEO   eoParseTreeDepthInit   eoTransform   
eoExternalEvalFunc   eoPBILAdditive   eoTruncate   
eoExternalInit   eoPBILDistrib   eoTruncatedSelectMany   
eoExternalMonOp   eoPBILOrg   eoTruncatedSelectOne   
eoExternalQuadOp   eoPerf2Worth   eoTruncateSplit   
  F  
+		eoPerf2Worth::compare_worth   eoTruncSelect   
eoF   eoPerf2WorthCached   
  U  
+
eoFactory   eoPerf2WorthCached::compare_worth   eoUBitXover   
eoFDCFileSnapshot   eoPersistent   eoUF   
eoFDCStat   eoPlus   UF_random_generator   
eoFileMonitor   eoPlusReplacement   eoUnaryFunctorCounter   
eoFileSnapshot   eoPointMutation   uniform_generator   
eoFitContinue   eoPop   eoUniformAtomExchange   
eoFitnessScalingSelect   eoPop::Cmp   eoUniformGeneChooser   
eoFitnessStat   eoPop::Ref   eoUniformGenerator   
eoFlOr1ptBinOp   eoPopAlgo   eoUniformInit   
eoFlOr1ptQuadOp   eoPopEvalFunc   eoUniformMutation   
eoFlOrAllAtomBinOp   eoPopLoopEval   eoUpdatable   
eoFlOrAllAtomQuadOp   eoPopStat   eoUpdater   
eoFlOrAllMutation   eoPopulator   
  V  
+
eoFlOrKAtomBinOp   eoPrintable   eoValueParam   
eoFlOrKAtomQuadOp   eoProcedureCounter   eoVariableParetoTraits   
eoFlOrKMutation   eoPropCombinedBinOp   eoVector   
eoFlOrUniformBinOp   eoPropCombinedMonOp   VirusBitFlip   
eoFlOrUniformQuadOp   eoPropCombinedQuadOp   VirusShiftMutation   
eoFunctorBase   eoPropGAGenOp   eoVlAddMutation   
eoFunctorBase::binary_function_tag   eoProportionalOp   eoVlAtomExchangeQuadOp   
eoFunctorBase::procedure_tag   eoProportionalSelect   eoVlDelMutation   
eoFunctorBase::unary_function_tag   
  Q  
+		eoVlUniformBinOp   
eoFunctorStore   eoQuad2BinOp   eoVlUniformQuadOp   
  G  
+		eoQuadCloneOp   
  W  
+
eoG3Replacement   eoQuadDistance   eoWeakElitistReplacement   
eoGenContinue   eoQuadGenOp   

1 | A | B | C | D | E | F | G | H | I | L | M | N | O | P | Q | R | S | T | U | V | W

+

Generated on Thu Oct 19 05:06:44 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classgp__parse__tree_1_1_mem_pool-members.html b/trunk/paradiseo-eo/doc/html/classgp__parse__tree_1_1_mem_pool-members.html new file mode 100644 index 000000000..20f0ed297 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classgp__parse__tree_1_1_mem_pool-members.html @@ -0,0 +1,22 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

gp_parse_tree::MemPool Member List

This is the complete list of members for gp_parse_tree::MemPool, including all inherited members.

+ + + + + + + + +
allocate() (defined in gp_parse_tree::MemPool)gp_parse_tree::MemPool [inline]
chunks (defined in gp_parse_tree::MemPool)gp_parse_tree::MemPool [private]
deallocate(void *b) (defined in gp_parse_tree::MemPool)gp_parse_tree::MemPool [inline]
esize (defined in gp_parse_tree::MemPool)gp_parse_tree::MemPool [private]
grow() (defined in gp_parse_tree::MemPool)gp_parse_tree::MemPool [inline, private]
head (defined in gp_parse_tree::MemPool)gp_parse_tree::MemPool [private]
MemPool(unsigned int sz) (defined in gp_parse_tree::MemPool)gp_parse_tree::MemPool [inline]
~MemPool() (defined in gp_parse_tree::MemPool)gp_parse_tree::MemPool [inline]

Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classgp__parse__tree_1_1_mem_pool.html b/trunk/paradiseo-eo/doc/html/classgp__parse__tree_1_1_mem_pool.html new file mode 100644 index 000000000..bb250a554 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classgp__parse__tree_1_1_mem_pool.html @@ -0,0 +1,55 @@ + + +EO: gp_parse_tree::MemPool Class Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

gp_parse_tree::MemPool Class Reference

Pool allocator for the subtree and parse tree classes (homebrew and not compliant to ANSI allocator requirements) (c) copyright Maarten Keijzer 1999, 2000. +More... +

+#include <parse_tree.h> +

+List of all members. + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ MemPool (unsigned int sz)
+void * allocate ()
+void deallocate (void *b)

Private Member Functions

+void grow ()

Private Attributes

+Chunk * chunks
+const unsigned int esize
+Link * head
+

Detailed Description

+Pool allocator for the subtree and parse tree classes (homebrew and not compliant to ANSI allocator requirements) (c) copyright Maarten Keijzer 1999, 2000. +

+Permission to copy, use, modify, sell and distribute this software is granted provided this copyright notice appears in all copies. This software is provided "as is" without express or implied warranty, and with no claim as to its suitability for any purpose.

+Permission to modify the code and to distribute modified code is granted, provided the above notices are retained, and a notice that the code was modified is included with the above copyright notice. +

+ +

+Definition at line 185 of file parse_tree.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classnegexp__generator-members.html b/trunk/paradiseo-eo/doc/html/classnegexp__generator-members.html new file mode 100644 index 000000000..e2906b37d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classnegexp__generator-members.html @@ -0,0 +1,18 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

negexp_generator< T > Member List

This is the complete list of members for negexp_generator< T >, including all inherited members.

+ + + + +
mean (defined in negexp_generator< T >)negexp_generator< T > [private]
negexp (defined in negexp_generator< T >)negexp_generator< T > [private]
negexp_generator(T _mean=1.0, eoRng &_rng=rng) (defined in negexp_generator< T >)negexp_generator< T > [inline]
operator()(void) (defined in negexp_generator< T >)negexp_generator< T > [inline]

Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classnegexp__generator.html b/trunk/paradiseo-eo/doc/html/classnegexp__generator.html new file mode 100644 index 000000000..002690b36 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classnegexp__generator.html @@ -0,0 +1,47 @@ + + +EO: negexp_generator< T > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

negexp_generator< T > Class Template Reference

The class negexp_generator can be used in the STL generate function to easily generate negative exponential distributed floats and doubles. +More... +

+#include <rnd_generators.h> +

+List of all members. + + + + + + + + + + + +

Public Member Functions

+ negexp_generator (T _mean=1.0, eoRng &_rng=rng)
+T operator() (void)

Private Attributes

+T mean
+eoRng & negexp
+

Detailed Description

+

template<class T = double>
+ class negexp_generator< T >

+ +The class negexp_generator can be used in the STL generate function to easily generate negative exponential distributed floats and doubles. +

+The user can supply a mean. +

+ +

+Definition at line 156 of file rnd_generators.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classnormal__generator-members.html b/trunk/paradiseo-eo/doc/html/classnormal__generator-members.html new file mode 100644 index 000000000..11db17556 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classnormal__generator-members.html @@ -0,0 +1,18 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

normal_generator< T > Member List

This is the complete list of members for normal_generator< T >, including all inherited members.

+ + + + +
normal (defined in normal_generator< T >)normal_generator< T > [private]
normal_generator(T _stdev=T(1.0), eoRng &_rng=rng) (defined in normal_generator< T >)normal_generator< T > [inline]
operator()(void) (defined in normal_generator< T >)normal_generator< T > [inline]
stdev (defined in normal_generator< T >)normal_generator< T > [private]

Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classnormal__generator.html b/trunk/paradiseo-eo/doc/html/classnormal__generator.html new file mode 100644 index 000000000..fa6464ea1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classnormal__generator.html @@ -0,0 +1,47 @@ + + +EO: normal_generator< T > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

normal_generator< T > Class Template Reference

The class normal_generator can be used in the STL generate function to easily generate gaussian distributed floats and doubles. +More... +

+#include <rnd_generators.h> +

+List of all members. + + + + + + + + + + + +

Public Member Functions

+ normal_generator (T _stdev=T(1.0), eoRng &_rng=rng)
+T operator() (void)

Private Attributes

+T stdev
+eoRng & normal
+

Detailed Description

+

template<class T = double>
+ class normal_generator< T >

+ +The class normal_generator can be used in the STL generate function to easily generate gaussian distributed floats and doubles. +

+The user can supply a standard deviation which defaults to 1. +

+ +

+Definition at line 139 of file rnd_generators.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:51 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classrandom__generator-members.html b/trunk/paradiseo-eo/doc/html/classrandom__generator-members.html new file mode 100644 index 000000000..303d22a58 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classrandom__generator-members.html @@ -0,0 +1,21 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

random_generator< T > Member List

This is the complete list of members for random_generator< T >, including all inherited members.

+ + + + + + + +
minim (defined in random_generator< T >)random_generator< T > [private]
operator()(void) (defined in random_generator< T >)random_generator< T > [inline]
operator()(void) (defined in random_generator< T >)random_generator< T > [inline]
random (defined in random_generator< T >)random_generator< T > [private]
random_generator(T _max, eoRng &_rng=rng) (defined in random_generator< T >)random_generator< T > [inline]
random_generator(T _min, T _max, eoRng &_rng=rng) (defined in random_generator< T >)random_generator< T > [inline]
range (defined in random_generator< T >)random_generator< T > [private]

Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classrandom__generator.html b/trunk/paradiseo-eo/doc/html/classrandom__generator.html new file mode 100644 index 000000000..d08cdedc0 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classrandom__generator.html @@ -0,0 +1,55 @@ + + +EO: random_generator< T > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

random_generator< T > Class Template Reference

The class random_generator can be used in the STL generate function to easily generate random ints either between [0, _max) if only one value (_max) is given to the ctor or in [_min,_max) if 2 values are given (_min, _max). +More... +

+#include <rnd_generators.h> +

+List of all members. + + + + + + + + + + + + + + + + + + +

Public Member Functions

+ random_generator (T _max, eoRng &_rng=rng)
+ random_generator (T _min, T _max, eoRng &_rng=rng)
+T operator() (void)
+template<>
bool operator() (void)

Private Attributes

+T minim
+T range
+eoRng & random
+

Detailed Description

+

template<class T = uint32_t>
+ class random_generator< T >

+ +The class random_generator can be used in the STL generate function to easily generate random ints either between [0, _max) if only one value (_max) is given to the ctor or in [_min,_max) if 2 values are given (_min, _max). +

+ +

+Definition at line 87 of file rnd_generators.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:54 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classuniform__generator-members.html b/trunk/paradiseo-eo/doc/html/classuniform__generator-members.html new file mode 100644 index 000000000..d340a2996 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classuniform__generator-members.html @@ -0,0 +1,20 @@ + + +EO: Member List + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

uniform_generator< T > Member List

This is the complete list of members for uniform_generator< T >, including all inherited members.

+ + + + + + +
minim (defined in uniform_generator< T >)uniform_generator< T > [private]
operator()(void) (defined in uniform_generator< T >)uniform_generator< T > [inline]
range (defined in uniform_generator< T >)uniform_generator< T > [private]
uniform (defined in uniform_generator< T >)uniform_generator< T > [private]
uniform_generator(T _max=T(1.0), eoRng &_rng=rng) (defined in uniform_generator< T >)uniform_generator< T > [inline]
uniform_generator(T _min, T _max, eoRng &_rng=rng) (defined in uniform_generator< T >)uniform_generator< T > [inline]

Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/classuniform__generator.html b/trunk/paradiseo-eo/doc/html/classuniform__generator.html new file mode 100644 index 000000000..448c71ce1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/classuniform__generator.html @@ -0,0 +1,51 @@ + + +EO: uniform_generator< T > Class Template Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

uniform_generator< T > Class Template Reference

The class uniform_generator can be used in the STL generate function to easily generate random floats and doubles either in [0, _max) if only 1 value (_max) is given (or none, as _max defaults to 1.0) or in [_min,_max) if 2 values are given (_min, _max). +More... +

+#include <rnd_generators.h> +

+List of all members. + + + + + + + + + + + + + + + +

Public Member Functions

+ uniform_generator (T _max=T(1.0), eoRng &_rng=rng)
+ uniform_generator (T _min, T _max, eoRng &_rng=rng)
+T operator() (void)

Private Attributes

+T minim
+T range
+eoRng & uniform
+

Detailed Description

+

template<class T = double>
+ class uniform_generator< T >

+ +The class uniform_generator can be used in the STL generate function to easily generate random floats and doubles either in [0, _max) if only 1 value (_max) is given (or none, as _max defaults to 1.0) or in [_min,_max) if 2 values are given (_min, _max). +

+ +

+Definition at line 44 of file rnd_generators.h.

The documentation for this class was generated from the following file: +
Generated on Thu Oct 19 05:06:57 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/compatibility_8h-source.html b/trunk/paradiseo-eo/doc/html/compatibility_8h-source.html new file mode 100644 index 000000000..39e8c969f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/compatibility_8h-source.html @@ -0,0 +1,97 @@ + + +EO: compatibility.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

compatibility.h

00001 /* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003   -----------------------------------------------------------------------------
+00004   compatibility.h
+00005       File to store some compiler specific stuff in. Currently handles, or 
+00006       least tries to handle the min() max() problems when using MSVC
+00007 
+00008 
+00009  (c) Maarten Keijzer (mak@dhi.dk) and GeNeura Team, 1999, 2000
+00010  
+00011     This library is free software; you can redistribute it and/or
+00012     modify it under the terms of the GNU Lesser General Public
+00013     License as published by the Free Software Foundation; either
+00014     version 2 of the License, or (at your option) any later version.
+00015 
+00016     This library is distributed in the hope that it will be useful,
+00017     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00018     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00019     Lesser General Public License for more details.
+00020 
+00021     You should have received a copy of the GNU Lesser General Public
+00022     License along with this library; if not, write to the Free Software
+00023     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00024 
+00025     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00026  */
+00027 
+00028 #ifndef COMPAT_H
+00029 #define COMPAT_H
+00030 
+00031 #include <string>
+00032 #include <iostream>
+00033 
+00034 #ifdef __GNUC__
+00035 #if __GNUC__ < 3
+00036         // check for stdlibc++v3 which does have ios_base
+00037         #ifndef _CPP_BITS_IOSBASE_H 
+00038         typedef ios ios_base; // not currently defined in GCC
+00039         #endif
+00040 #endif
+00041 #endif
+00042 
+00043 #if defined(_MSC_VER) && (_MSC_VER < 1300)
+00044 /* 
+00045 Maarten: added this code here because Mirkosoft has the
+00046 nasty habit of #define min and max in stdlib.h (and windows.h)
+00047 I'm trying to undo this horrible macro magic (microsoft yet macrohard)
+00048 here. Sure hope it works
+00049 Olivier: this has been removed in .NET :) One step more standard...
+00050 */
+00051 #pragma warning(disable:4786)
+00052 
+00053 #include <stdlib.h>
+00054 
+00055 #ifdef min
+00056 #undef min
+00057 #undef max // as they come in std::pairs
+00058 #endif
+00059 
+00060 // add min and max to std...
+00061 namespace std
+00062 {
+00063     template <class T> const T& min(const T& a, const T& b)
+00064     {
+00065         if(a < b)
+00066             return a;
+00067         // else
+00068         return b;
+00069     }
+00070     
+00071     template <class T> const T& max(const T& a, const T& b)
+00072     {
+00073         if(a > b)
+00074             return a;
+00075         // else
+00076         return b;
+00077     }
+00078 }
+00079 
+00080 #endif
+00081         // _MSC_VER
+00082 #endif 
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/continuators_8cpp-source.html b/trunk/paradiseo-eo/doc/html/continuators_8cpp-source.html new file mode 100644 index 000000000..70fe8b990 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/continuators_8cpp-source.html @@ -0,0 +1,105 @@ + + +EO: continuators.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / pyeo
+

continuators.cpp

00001 /*
+00002     PyEO
+00003     
+00004     Copyright (C) 2003 Maarten Keijzer
+00005 
+00006     This program is free software; you can redistribute it and/or modify
+00007     it under the terms of the GNU General Public License as published by
+00008     the Free Software Foundation; either version 2 of the License, or
+00009     (at your option) any later version.
+00010 
+00011     This program is distributed in the hope that it will be useful,
+00012     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00013     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00014     GNU General Public License for more details.
+00015 
+00016     You should have received a copy of the GNU General Public License
+00017     along with this program; if not, write to the Free Software
+00018     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00019 */
+00020 
+00021 #include <eoGenContinue.h>
+00022 #include <eoCombinedContinue.h>
+00023 #include <eoEvalContinue.h>
+00024 #include <eoFitContinue.h>
+00025 #include <eoSteadyFitContinue.h>
+00026 #include <utils/eoCheckPoint.h>
+00027 #include <utils/eoStat.h>
+00028 
+00029 #include "PyEO.h"
+00030 #include "def_abstract_functor.h"
+00031 
+00032 using namespace boost::python;
+00033 
+00034 #define DEF(x) class_<x<PyEO>, bases<eoContinue<PyEO > > >(#x).def("__call__", &eoContinue<PyEO>::operator())
+00035 #define DEF2(x, i1) class_<x<PyEO>, bases<eoContinue<PyEO > > >(#x, init<i1>() ).def("__call__", &eoContinue<PyEO>::operator())
+00036 #define DEF3(x, i1, i2) class_<x<PyEO>, bases<eoContinue<PyEO > > >(#x, init<i1, i2 >() ).def("__call__", &eoContinue<PyEO>::operator())
+00037 
+00038 void add_checkpoint();
+00039 
+00040 void continuators()
+00041 {
+00042     /* Counters, wrappers etc */
+00043     
+00044     class_<eoEvalFuncCounter<PyEO>, bases<eoEvalFunc<PyEO> > >("eoEvalFuncCounter",
+00045             init< eoEvalFunc<PyEO>&, std::string>())
+00046         .def("__call__", &eoEvalFuncCounter<PyEO>::operator())
+00047         ;
+00048     /* Continuators */
+00049     def_abstract_functor<eoContinue<PyEO> >("eoContinue"); 
+00050         
+00051     class_<eoGenContinue<PyEO>, bases<eoContinue<PyEO> >, boost::noncopyable >("eoGenContinue", init<unsigned long>() )
+00052         .def("__call__", &eoGenContinue<PyEO>::operator())
+00053         ;
+00054   
+00055     class_<eoCombinedContinue<PyEO>, bases<eoContinue<PyEO> > >("eoCombinedContinue", init<eoContinue<PyEO>&>()[WC1])
+00056         .def( init<eoContinue<PyEO>&, eoContinue<PyEO>& >()[WC2] )
+00057         .def("add", &eoCombinedContinue<PyEO>::add, WC1)
+00058         .def("__call__", &eoCombinedContinue<PyEO>::operator())
+00059         ;
+00060    
+00061     class_<eoEvalContinue<PyEO>, bases<eoContinue<PyEO> > >("eoEvalContinue", 
+00062             init<eoEvalFuncCounter<PyEO>&, unsigned long>()[WC1])
+00063         .def("__call__", &eoEvalContinue<PyEO>::operator())
+00064         ;
+00065 
+00066     DEF2(eoFitContinue, object); // object is the fitness type
+00067 
+00068     DEF3(eoSteadyFitContinue, unsigned long, unsigned long);
+00069 
+00070     add_checkpoint();
+00071 }
+00072 
+00073 void addContinue(eoCheckPoint<PyEO>& c, eoContinue<PyEO>& cc) { c.add(cc); }
+00074 void addMonitor(eoCheckPoint<PyEO>& c, eoMonitor& m) { c.add(m);}
+00075 void addStat(eoCheckPoint<PyEO>& c, eoStatBase<PyEO>& s) { c.add(s);}
+00076 void addSortedStat(eoCheckPoint<PyEO>& c, eoSortedStatBase<PyEO>& s) { c.add(s);}
+00077 
+00078 void add_checkpoint()
+00079 {
+00080     class_<eoCheckPoint<PyEO>, bases< eoContinue<PyEO> > >("eoCheckPoint",
+00081             
+00082             init<eoContinue<PyEO>&> ()[with_custodian_and_ward<1,2>()]
+00083             ) 
+00084         .def("add", addContinue, with_custodian_and_ward<1,2>() )
+00085         .def("add", addMonitor, with_custodian_and_ward<1,2>() )
+00086         .def("add", addStat, with_custodian_and_ward<1,2>())
+00087         .def("add", addSortedStat, with_custodian_and_ward<1,2>()) 
+00088         .def("__call__", &eoCheckPoint<PyEO>::operator())
+00089         ;
+00090 }
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/contrib_2mathsym_2_r_e_a_d_m_e-source.html b/trunk/paradiseo-eo/doc/html/contrib_2mathsym_2_r_e_a_d_m_e-source.html new file mode 100644 index 000000000..cb3a82970 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/contrib_2mathsym_2_r_e_a_d_m_e-source.html @@ -0,0 +1,213 @@ + + +EO: README Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym
+

contrib/mathsym/README

00001 
+00002 This is not yet another gp system (nyagp). For one, it is not general.
+00003 It does one thing, find mathematical functions, and tries to do that well.
+00004 
+00005 So, if you're trying to steer ants on various New Mexico trails, or build your
+00006 own tiny block world, you're in the wrong place. However, if you're interested
+00007 in finding mathematical functions either through direct application on data or
+00008 running it through a simulator, you might find what you're looking for here.
+00009 
+00010 === Representation (sym/ + gen/) ========
+00011 
+00012 Mathsym has a few interesting characteristics. First and foremost is the
+00013 basic representation. It uses trees, but these trees are stored in a 
+00014 reference counted hashtable. This means that every distinct subtree that is alive
+00015 is stored once and only once. 
+00016 The reference counting mechanism takes care of memory management. 
+00017 
+00018 The idea of using a hashtable (for offline analysis) comes from Walter Tackett, in his
+00019 1994 dissertation. The current system is just a real-time implementation of this
+00020 idea, adding the reference counting for ease of use.
+00021 
+00022 The hashtable brings overhead. It's still pretty fast, but a string based representation
+00023 would run circles around it. However, by virtue of it storing every subtree only once, it
+00024 is fairly tight on memory. This helps tremendously when confronted with excessively growing populations, bloat.
+00025 The hashtable implementation can not stop bloat, but does make it more manageable. In a typical
+00026 GP run, the number of distinct subtrees is only 10-20% of the total number of subtrees.
+00027 
+00028 Other advantages of the hashtable are in the ability to examine the run more thoroughly. It is easy
+00029 to check how many subtrees are present in the system, and for each subtree you can check the reference
+00030 count. 
+00031 
+00032 The basic tree is called a Sym. A Sym is simply a tree, and has children, accessible through args().
+00033 A Sym simply contains an iterator (== decorated pointer) to an entry in the hashtable. 
+00034 Every time you create a Sym, it is either looked up in the hashtable or added to the hashtable.
+00035 A Sym has several members: size, depth, args, etc. One interesting member is the refcount().
+00036 This returns the reference count of the Sym in the hashtable, and thus returns the number
+00037 of distinct contexts in which the Sym is used.
+00038 
+00039 Another nice thing of these hashtable Syms is that a check for equality reduces to a pointer comparison.
+00040 
+00041 The Sym nodes are identified by a simple token, of type token_t (usually an unsigned int). It
+00042 is completely generic and could conceivably be adapted to steer ants. The rest of the library
+00043 is however targeted at mathematical functions purely. 
+00044 
+00045 sym/Sym.h is the file to look into for the functionality provided by Sym. The sym/ directory
+00046 is where the source files are stored that are relevant for the generic Sym functionality. The
+00047 'gen/' directory contains some generic functionality to build and traverse trees, independent of 
+00048 the function and terminal set.
+00049 
+00050 The file sym/README.cpp documents the use of the sym library for general GP use.
+00051 
+00052 === Function Set (fun/) ===
+00053 
+00054 The standard GP function set of binary functions: addition, multiplication, subtraction and
+00055 division is NOT supported. 
+00056 
+00057 What is however supported are the functions of:
+00058 
+00059 summation: arbitrary arity, arity zero meaning 0.0. Arity 2 is standard addition
+00060 product:   arbitrary arity, arity zero meaning 1.0. Arity 2 is standard multiplication
+00061 inversion:  1.0 / x. Only arity 1
+00062 unary minus: -x. Only arity 1
+00063 
+00064 Plus a whole bunch of other functions (see "fun/FunDef.h")
+00065 
+00066 The reason for this is the observation (actually from a friend of mine, thanks Luuk),
+00067 that this set of functions is complete and slightly more orthogonal than a binary set.
+00068 
+00069 The directory 'fun' contains the functionality for the function and terminal set, together
+00070 with ERC's etc. fun/FunDef.cpp contains the definition of the functionality. Stuff can be
+00071 added here, but best to contact me if you miss particular functions.
+00072 
+00073 With the sym and the function set in place, some fairly nice overloading is possible. A quick tour:
+00074 
+00075 To create a variable that reads the first value from the inputs, do:
+00076 
+00077 Sym var = SymVar(0);
+00078 
+00079 To create a constant of value 0.4432, do
+00080 
+00081 Sym cnst = SymConst(0.4432);
+00082 
+00083 The constants are also stored uniquely so that:
+00084 
+00085 Sym cnst2 = SymConst(0.4432)
+00086 
+00087 will lead to:
+00088 
+00089 cnst == cnst2
+00090 
+00091 to be true (this happens without value compare, they point to the same element in the hashtable)
+00092 
+00093 To add two values, do
+00094 
+00095 Sym sym = var + const;
+00096 
+00097 This will create a tree with tree nodes. All other operations work identically.
+00098 
+00099 === Evaluation (eval/) ===
+00100 
+00101 The second important thing is evaluation. Although Syms can be evaluated through an interpreter,
+00102 this is not the fastest way to go about with it. The standard way of evaluating a Sym is to 
+00103 first *compile* it to a function, and then run it in your favourite environment. Compilation
+00104 is done through the use of the excellent tinycc compiler, which is blazingly fast and produces
+00105 pretty good functions.
+00106 
+00107 Compilation comes in several flavours: compile a single function and retrieve a pointer to a function
+00108 of signature:
+00109 
+00110 double func(const double* x);
+00111 
+00112 where x is the input array. Another option is to compile a bunch of functions in one go, and retrieve an array
+00113 of such function pointers. The Syms are simply printed and compiled. An example: 
+00114 
+00115 double func(const double* x) { return x*x + x * 1./x; }
+00116 
+00117 The batch version proceeds significantly more quickly than calling compile every time. The function pointers
+00118 can be given to a simulation for extremely quick evaluation.
+00119 
+00120 A third option is to compile a complete population in one go, and return a single pointer of signature
+00121 
+00122 void func(const double* x, double* y);
+00123 
+00124 Where 'y' is the (preallocated) output array. This allows to evaluate a complete population in one function
+00125 call, storing the results in 'y'. It uses the hashtable to store every calculation only once. An example
+00126 for the two function x*x + x*1./x and x + sin(x*x) is:
+00127 
+00128 void func(const double* x, double* y) {
+00129     double a0 = x;
+00130     double a1 = a0 * a0;
+00131     double a2 = 1.0;
+00132     double a3 = a2 / a0;
+00133     double a4 = a2 * a3;
+00134     y[0] = a4;
+00135     double a5 = sin(a1);
+00136     double a6 = a0 + a5;
+00137     y[1] = a6;
+00138 }
+00139 
+00140 This is the fastest way to evaluate even humongous populations quickly. You might be surprised at
+00141 the amount of code re-use in a GP population.
+00142 
+00143 The three compilation functions can be found in eval/sym_compile.h
+00144 
+00145 A limiting factor in tinycc is that the struct TCCState that is used to hold the compilation context,
+00146 is not really self-contained. This unfortunately means that with every call to 'compile' ALL previous
+00147 pointers that have been produced become unsafe for use. I'm still looking at ways to circumvent this.
+00148 
+00149 To work with mathsym, a few small changes in tccelf.c were necessary, check README.TCC for details.
+00150 
+00151 === Interval Arithmetic (eval/) ===
+00152 
+00153 GP is pretty good at finding mathematical expressions that are numerically unsound. Take for instance
+00154 the function '1 / x'. This is well defined only when x is strictly positive, but will lead to problems
+00155 when x equals 0. The standard answer is to define some pseudo-arithmetical function called 'protected
+00156 division' that will return some value (usually 1) when a division by zero occurs. This leads to a number
+00157 of protected functions (sqrt, log, tan, etc.) which all need to be protected. Interpreting results from
+00158 GP using such functions is in general hard.
+00159 
+00160 Interval arithmetic (through another excellent library boost/numeric/interval) is used to calculate
+00161 if particular functions can conceivably produce problems. This completely annihilates the use for Koza-style
+00162 protected operators and is a more safe and sound method. For interval arithmetic to function, the bounds
+00163 on the input variables need to be known. As for every function we can calculate a guarenteed, 
+00164 though not necessarily tight, output interval given the input intervals, we can check arbitrary functions
+00165 for possible problems. If, for example for division, the input interval contains 0, we know that a division
+00166 by zero is theoretically possible. It's then best to throw away the entire function.
+00167 
+00168 Interval Arithmetic is accessible through the class IntervalBoundsCheck (eval/BoundsCheck.h)
+00169 
+00170 === More generic support (gen/) ===
+00171 
+00172 The gen subdirectory contains some general utility classes for defining function sets and for 
+00173 creating trees. The idea is that these functions are generic and only append on the sym/ part
+00174 of the library. Unfortunately, the language table currently needs an ERC function, a default
+00175 implementation is hidden inside fun/FunDef.cpp. Will fix at some point.
+00176 
+00177 gen/LanguageTable.cpp -> defines the functions/terminals that can be used
+00178 gen/TreeBuilder.cpp   -> can create trees based on a LanguageTable
+00179 
+00180 === Data and Errors (regression/)  ===
+00181 
+00182 The above classes are generic and apply for any type of problem where a mathematical function can be 
+00183 used to steer some process, run a simulation, whatever. First check the intervals, then compile the 
+00184 Sym(s) to a (set of) function pointer(s), and use the pointers in some way to evaluate for fitness. 
+00185 One particular type of problem for which support is built in is 'symbolic regression'. This type of
+00186 problem involves finding an mathematical input/output relationship based on some data.
+00187 
+00188 To enable this, regression/ introduces the class Dataset to contain the data and ErrorMeasure to calculate
+00189 error. Currently supported: mean squared error, mean absolute error and mean squared error scaled (proportional
+00190 to correlation squared). They use some helper classes such as Scaling and TargetInfo.
+00191 
+00192 === EO interface (eo_interface/) ===
+00193 
+00194 Contains the classes to make it all work with EO. Check the root application 'symreg' for ways to use this
+00195 
+00196 
+00197 
+00198 
+
Generated on Thu Oct 19 05:06:42 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/def__abstract__functor_8h-source.html b/trunk/paradiseo-eo/doc/html/def__abstract__functor_8h-source.html new file mode 100644 index 000000000..489608e34 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/def__abstract__functor_8h-source.html @@ -0,0 +1,154 @@ + + +EO: def_abstract_functor.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / pyeo
+

def_abstract_functor.h

00001 /*
+00002     PyEO
+00003     
+00004     Copyright (C) 2003 Maarten Keijzer
+00005 
+00006     This program is free software; you can redistribute it and/or modify
+00007     it under the terms of the GNU General Public License as published by
+00008     the Free Software Foundation; either version 2 of the License, or
+00009     (at your option) any later version.
+00010 
+00011     This program is distributed in the hope that it will be useful,
+00012     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00013     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00014     GNU General Public License for more details.
+00015 
+00016     You should have received a copy of the GNU General Public License
+00017     along with this program; if not, write to the Free Software
+00018     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00019 */
+00020 
+00021 #ifndef MAKE_ABSTRACT_FUNCTOR_H
+00022 #define MAKE_ABSTRACT_FUNCTOR_H
+00023 
+00024 #include <eoFunctor.h>
+00025 
+00026 // DEFINES for call 
+00027 #define WC1 boost::python::with_custodian_and_ward<1,2>()
+00028 #define WC2 boost::python::with_custodian_and_ward<1,2, with_custodian_and_ward<1,3> >()
+00029 
+00030 namespace eoutils {
+00031 
+00032 using namespace boost::python;
+00033     
+00034 template <class Proc>
+00035 class ProcWrapper : public Proc
+00036 {
+00037     public:
+00038     PyObject* self;
+00039     ProcWrapper(PyObject* s) : self(s) {}
+00040 
+00041     typename Proc::result_type operator()(void)
+00042     {
+00043         return boost::python::call_method<typename Proc::result_type>(self, "__call__");
+00044     }
+00045 };
+00046 
+00047 template <class Proc>
+00048 void make_abstract_functor(std::string name, typename eoFunctorBase::procedure_tag)
+00049 {
+00050     typedef ProcWrapper<Proc> Wrapper;
+00051     boost::python::class_<Proc, Wrapper,boost::noncopyable>(name.c_str(), boost::python::init<>() )
+00052         .def("__call__", &Wrapper::operator());
+00053 }
+00054 
+00055 template <class Proc>
+00056 void make_abstract_functor_ref(std::string name, typename eoFunctorBase::procedure_tag)
+00057 {
+00058     typedef ProcWrapper<Proc> Wrapper;
+00059     boost::python::class_<Proc, Wrapper,boost::noncopyable>(name.c_str(), boost::python::init<>() )
+00060         .def("__call__", &Wrapper::operator(), boost::python::return_internal_reference<>());
+00061 }
+00062 
+00063 template <class Unary>
+00064 class UnaryWrapper : public Unary
+00065 {
+00066     public:
+00067     PyObject* self;
+00068     UnaryWrapper(PyObject* s) : self(s) {}
+00069 
+00070     typename Unary::result_type operator()(typename Unary::argument_type a) 
+00071     { 
+00072         return boost::python::call_method<typename Unary::result_type>(self, "__call__", boost::ref(a) ); 
+00073     }
+00074 };
+00075 
+00076 template <class Unary>
+00077 void make_abstract_functor(std::string name, typename eoFunctorBase::unary_function_tag)
+00078 {
+00079     typedef UnaryWrapper<Unary> Wrapper;
+00080 
+00081     boost::python::class_<Unary, Wrapper, boost::noncopyable>(name.c_str(), boost::python::init<>() )
+00082         .def("__call__", &Wrapper::operator())
+00083         ;
+00084 }
+00085 
+00086 template <class Unary>
+00087 void make_abstract_functor_ref(std::string name, typename eoFunctorBase::unary_function_tag)
+00088 {
+00089     typedef UnaryWrapper<Unary> Wrapper;
+00090 
+00091     boost::python::class_<Unary, Wrapper, boost::noncopyable>(name.c_str(), boost::python::init<>() )
+00092         .def("__call__", &Wrapper::operator(), boost::python::return_internal_reference<>() )
+00093         ;
+00094 }
+00095 
+00096 template <class Binary>
+00097 class BinaryWrapper : public Binary
+00098 {
+00099     public:
+00100     PyObject* self;
+00101     BinaryWrapper(PyObject* s) : self(s) {}
+00102     typename Binary::result_type operator()(typename Binary::first_argument_type a1, typename Binary::second_argument_type a2)
+00103     {
+00104         return boost::python::call_method<
+00105             typename Binary::result_type>(self, "__call__", boost::ref(a1), boost::ref(a2) );
+00106     }
+00107 };
+00108 
+00109 template <class Binary>
+00110 void make_abstract_functor(std::string name, typename eoFunctorBase::binary_function_tag)
+00111 {
+00112     typedef BinaryWrapper<Binary> Wrapper;
+00113     boost::python::class_<Binary, Wrapper, boost::noncopyable>(name.c_str(), boost::python::init<>() )
+00114         .def("__call__", &Wrapper::operator());
+00115 }
+00116 
+00117 template <class Binary>
+00118 void make_abstract_functor_ref(std::string name, typename eoFunctorBase::binary_function_tag)
+00119 {
+00120     typedef BinaryWrapper<Binary> Wrapper;
+00121     boost::python::class_<Binary, Wrapper, boost::noncopyable>(name.c_str(), boost::python::init<>() )
+00122         .def("__call__", &Wrapper::operator(), boost::python::return_internal_reference<>() );
+00123 }
+00124 
+00125 }// namespace eoutils
+00126 
+00127 template <class Functor>
+00128 void def_abstract_functor(std::string name)
+00129 {
+00130     eoutils::make_abstract_functor<Functor>(name, Functor::functor_category());
+00131 }
+00132 
+00133 template <class Functor>
+00134 void def_abstract_functor_ref(std::string name)
+00135 {
+00136     eoutils::make_abstract_functor_ref<Functor>(name, Functor::functor_category());
+00137 }
+00138 
+00139 #endif
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000000.html b/trunk/paradiseo-eo/doc/html/dir_000000.html new file mode 100644 index 000000000..440840777 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000000.html @@ -0,0 +1,242 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/src/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

src Directory Reference

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Directories

directory do
directory es
directory ga
directory gp
directory other
directory pyeo
directory utils

Files

file  apply.h
file  EO.h
file  eoAlgo.h
file  eoBreed.h
file  eoCellularEasyEA.h
file  eoCloneOps.h
file  eoCombinedContinue.h
file  eoCombinedInit.h
file  eoContinue.h
file  eoCounter.h
file  eoCtrlCContinue.cpp
file  eoCtrlCContinue.h
file  eoDetSelect.h
file  eoDetTournamentSelect.h
file  eoDistribUpdater.h
file  eoDistribution.h
file  eoDominanceMap.h
file  eoEasyEA.h
file  eoEDA.h
file  eoEvalContinue.h
file  eoEvalFunc.h
file  eoEvalFuncCounter.h
file  eoEvalFuncPtr.h
file  eoFactory.h
file  eoFitContinue.h
file  eoFitnessScalingSelect.h
file  eoFlOrBinOp.h
file  eoFlOrMonOp.h
file  eoFlOrQuadOp.h
file  eoFunctor.h
file  eoFunctorStore.cpp
file  eoFunctorStore.h
file  eoG3Replacement.h
file  eoGenContinue.h
file  eoGeneralBreeder.h
file  eoGenOp.h
file  eoInit.h
file  eoInvalidateOps.h
file  eoLinearFitScaling.h
file  eoMerge.h
file  eoMergeReduce.h
file  eoMGGReplacement.h
file  eoNDSorting.h
file  eoObject.h
file  eoOneToOneBreeder.h
file  eoOp.h
file  eoOpContainer.h
file  eoOpSelMason.h
file  eoParetoConstraintFitness.h
file  eoParetoFitness.cpp
file  eoParetoFitness.h
file  eoParetoRanking.h
file  eoPerf2Worth.h
file  eoPeriodicContinue.h
file  eoPersistent.cpp
file  eoPersistent.h
file  eoPop.h
file  eoPopAlgo.h
file  eoPopEvalFunc.h
file  eoPopulator.h
file  eoPrintable.cpp
file  eoPrintable.h
file  eoPropGAGenOp.h
file  eoProportionalCombinedOp.h
file  eoProportionalSelect.h
file  eoRandomSelect.h
file  eoRanking.h
file  eoRankingSelect.h
file  eoReduce.h
file  eoReduceMerge.h
file  eoReduceMergeReduce.h
file  eoReduceSplit.h
file  eoReplacement.h
file  eoScalarFitness.h
file  eoScalarFitnessAssembled.cpp
file  eoScalarFitnessAssembled.h
file  eoSelect.h
file  eoSelectFactory.h
file  eoSelectFromWorth.h
file  eoSelectMany.h
file  eoSelectNumber.h
file  eoSelectOne.h
file  eoSelectPerc.h
file  eoSequentialSelect.h
file  eoSGA.h
file  eoSGAGenOp.h
file  eoSGATransform.h
file  eoSharing.h
file  eoSharingSelect.h
file  eoSimpleEDA.h
file  eoSteadyFitContinue.h
file  eoSTLFunctor.h
file  eoStochasticUniversalSelect.h
file  eoStochTournamentSelect.h
file  eoSurviveAndDie.h
file  eoTransform.h
file  eoTruncatedSelectMany.h
file  eoTruncatedSelectOne.h
file  eoTruncSelect.h
file  eoVariableLengthCrossover.h
file  eoVariableLengthMutation.h
file  eoVector.h
file  es.h
file  ga.h
+
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000001.html b/trunk/paradiseo-eo/doc/html/dir_000001.html new file mode 100644 index 000000000..acf9f0ec9 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000001.html @@ -0,0 +1,63 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / pyeo
+

pyeo Directory Reference

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Files

file  abstract1.cpp
file  algos.cpp
file  breeders.cpp
file  continuators.cpp
file  def_abstract_functor.h
file  geneticOps.cpp
file  mergers.cpp
file  monitors.cpp
file  src/pyeo/NEWS
file  perf2worth.cpp
file  pickle.h
file  PyEO.cpp
file  PyEO.h
file  random_numbers.cpp
file  src/pyeo/README
file  reduce.cpp
file  replacement.cpp
file  selectOne.cpp
file  selectors.cpp
file  statistics.cpp
file  valueParam.cpp
file  valueParam.h
+
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000002.html b/trunk/paradiseo-eo/doc/html/dir_000002.html new file mode 100644 index 000000000..7e402eb3a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000002.html @@ -0,0 +1,115 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/test/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+test
+

test Directory Reference

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Files

file  test/binary_value.h
file  fitness_traits.cpp
file  test/real_value.h
file  RoyalRoad.h
file  t-eo.cpp
file  t-eoAtomOps.cpp
file  t-eoBaseFunctions.cpp
file  t-eobin.cpp
file  t-eobreeder.cpp
file  t-eoCheckpointing.cpp
file  t-eoCMAES.cpp
file  t-eoEasyEA.cpp
file  t-eoESAll.cpp
file  t-eoESFull.cpp
file  t-eoESOps.cpp
file  t-eoExternalEO.cpp
file  t-eofitness.cpp
file  t-eoFitnessAssembled.cpp
file  t-eoFitnessAssembledEA.cpp
file  t-eoFunctor.cpp
file  t-eoGA.cpp
file  t-eogeneration.cpp
file  t-eoGenOp.cpp
file  t-eoGOpSel.cpp
file  t-eoinclusion.cpp
file  t-eoinsertion.cpp
file  t-eolottery.cpp
file  t-eoNonUniform.cpp
file  t-eoPareto.cpp
file  t-eoParetoFitness.cpp
file  t-eoPBIL.cpp
file  t-eoproblem.cpp
file  t-eoRandom.cpp
file  t-eoReal.cpp
file  t-eoReplacement.cpp
file  t-eoRoulette.cpp
file  t-eoSelect.cpp
file  t-eoSharing.cpp
file  t-eoSSGA.cpp
file  t-eoStateAndParser.cpp
file  t-eoSymreg.cpp
file  t-eoUniform.cpp
file  t-eoVector.cpp
file  t-eoVirus.cpp
file  t-MGE-control.cpp
file  t-MGE.cpp
file  t-MGE1bit.cpp
file  t-selectOne.cpp
+
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000003.html b/trunk/paradiseo-eo/doc/html/dir_000003.html new file mode 100644 index 000000000..9402d037a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000003.html @@ -0,0 +1,34 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial
+

tutorial Directory Reference

+ + + + + + + + + + + + + + + + + +

Directories

directory Lesson1
directory Lesson2
directory Lesson3
directory Lesson4
directory Lesson5
directory Templates

Files

file  tutorial/README
+
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000004.html b/trunk/paradiseo-eo/doc/html/dir_000004.html new file mode 100644 index 000000000..b61aef1a4 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000004.html @@ -0,0 +1,29 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson2/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Lesson2
+

Lesson2 Directory Reference

+ + + + + + + + + + + + +

Files

file  tutorial/Lesson2/binary_value.h
file  exercise2.3.cpp
file  FirstBitEA.cpp
file  FirstRealEA.cpp
file  tutorial/Lesson2/real_value.h
+
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000005.html b/trunk/paradiseo-eo/doc/html/dir_000005.html new file mode 100644 index 000000000..84bc8f512 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000005.html @@ -0,0 +1,29 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson3/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Lesson3
+

Lesson3 Directory Reference

+ + + + + + + + + + + + +

Files

file  tutorial/Lesson3/binary_value.h
file  exercise3.1.cpp
file  tutorial/Lesson3/real_value.h
file  SecondBitEA.cpp
file  SecondRealEA.cpp
+
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000006.html b/trunk/paradiseo-eo/doc/html/dir_000006.html new file mode 100644 index 000000000..0e32ce6d5 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000006.html @@ -0,0 +1,29 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson4/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Lesson4
+

Lesson4 Directory Reference

+ + + + + + + + + + + + +

Files

file  tutorial/Lesson4/binary_value.h
file  BitEA.cpp
file  ESEA.cpp
file  tutorial/Lesson4/real_value.h
file  RealEA.cpp
+
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000007.html b/trunk/paradiseo-eo/doc/html/dir_000007.html new file mode 100644 index 000000000..f28275eb6 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000007.html @@ -0,0 +1,28 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib
+

contrib Directory Reference

+ + + + + + + + + + + +

Directories

directory mathsym
directory MGE

Files

file  eoAged.h
file  eoDrawable.h
+
Generated on Thu Oct 19 05:07:01 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000008.html b/trunk/paradiseo-eo/doc/html/dir_000008.html new file mode 100644 index 000000000..9fa8cc8dd --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000008.html @@ -0,0 +1,40 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym
+

mathsym Directory Reference

+ + + + + + + + + + + + + + + + + + + + + + + +

Directories

directory eo_interface
directory eval
directory fun
directory gen
directory regression
directory sym
directory test

Files

file  contrib/mathsym/README
file  shared_ptr.h
file  symreg.cpp
+
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000009.html b/trunk/paradiseo-eo/doc/html/dir_000009.html new file mode 100644 index 000000000..78d2d1f39 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000009.html @@ -0,0 +1,35 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eval/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / eval
+

eval Directory Reference

+ + + + + + + + + + + + + + + + + + +

Files

file  BoundsCheck.cpp
file  BoundsCheck.h
file  Interval.h
file  MultiFuncs.cpp
file  MultiFunction.cpp
file  MultiFunction.h
file  sym_compile.cpp
file  sym_compile.h
+
Generated on Thu Oct 19 05:07:01 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000010.html b/trunk/paradiseo-eo/doc/html/dir_000010.html new file mode 100644 index 000000000..25949a9b1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000010.html @@ -0,0 +1,105 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

es Directory Reference

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Files

file  CMAParams.cpp
file  CMAParams.h
file  CMAState.cpp
file  CMAState.h
file  eig.cpp
file  eig.h
file  eoCMABreed.h
file  eoCMAInit.h
file  eoEsChromInit.h
file  eoEsFull.h
file  eoEsGlobalXover.h
file  eoEsMutate.h
file  eoEsMutationInit.h
file  eoEsSimple.h
file  eoEsStandardXover.h
file  eoEsStdev.h
file  eoNormalMutation.h
file  eoReal.h
file  eoRealAtomXover.h
file  eoRealInitBounded.h
file  eoRealOp.h
file  eoSBXcross.h
file  make_algo_scalar_es.cpp
file  make_algo_scalar_real.cpp
file  make_checkpoint_es.cpp
file  make_checkpoint_real.cpp
file  make_continue_es.cpp
file  make_continue_real.cpp
file  make_es.h
file  make_genotype_es.cpp
file  make_genotype_real.cpp
file  make_genotype_real.h
file  es/make_op.h
file  make_op_es.cpp
file  make_op_es.h
file  make_op_real.cpp
file  make_op_real.h
file  make_pop_es.cpp
file  make_pop_real.cpp
file  make_real.h
file  make_run_es.cpp
file  make_run_real.cpp
file  matrices.h
+
Generated on Thu Oct 19 05:07:01 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000011.html b/trunk/paradiseo-eo/doc/html/dir_000011.html new file mode 100644 index 000000000..1f18c4f7c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000011.html @@ -0,0 +1,115 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

utils Directory Reference

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Files

file  compatibility.h
file  eoAssembledFitnessStat.h
file  eoCheckPoint.h
file  eoData.cpp
file  eoData.h
file  eoDistance.h
file  eoFDCStat.h
file  eoFileMonitor.cpp
file  eoFileMonitor.h
file  eoFileSnapshot.h
file  eoGnuplot.cpp
file  eoGnuplot.h
file  eoGnuplot1DMonitor.cpp
file  eoGnuplot1DMonitor.h
file  eoGnuplot1DSnapshot.cpp
file  eoGnuplot1DSnapshot.h
file  eoHowMany.h
file  eoIntBounds.cpp
file  eoIntBounds.h
file  eoMOFitnessStat.h
file  eoMonitor.h
file  eoParam.h
file  eoParser.cpp
file  eoParser.h
file  eoPopStat.h
file  eoRealBounds.cpp
file  eoRealBounds.h
file  eoRealVectorBounds.h
file  eoRndGenerators.h
file  eoRNG.cpp
file  eoRNG.h
file  eoScalarFitnessStat.h
file  eoStat.h
file  eoState.cpp
file  eoState.h
file  eoStdoutMonitor.cpp
file  eoStdoutMonitor.h
file  eoTimeCounter.h
file  eoTimedMonitor.h
file  eoUniformInit.h
file  eoUpdatable.h
file  eoUpdater.cpp
file  eoUpdater.h
file  make_help.cpp
file  pipecom.cpp
file  pipecom.h
file  rnd_generators.h
file  selectors.h
+
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000012.html b/trunk/paradiseo-eo/doc/html/dir_000012.html new file mode 100644 index 000000000..7e4a334ca --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000012.html @@ -0,0 +1,37 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / regression
+

regression Directory Reference

+ + + + + + + + + + + + + + + + + + + + +

Files

file  Dataset.cpp
file  Dataset.h
file  ErrorMeasure.cpp
file  ErrorMeasure.h
file  Scaling.cpp
file  Scaling.h
file  stats.h
file  TargetInfo.cpp
file  TargetInfo.h
+
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000013.html b/trunk/paradiseo-eo/doc/html/dir_000013.html new file mode 100644 index 000000000..a78f0df28 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000013.html @@ -0,0 +1,57 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / ga
+

ga Directory Reference

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Files

file  eoBit.h
file  eoBitOp.h
file  eoBitOpFactory.h
file  eoBoolFlip.h
file  eoPBILAdditive.h
file  eoPBILDistrib.h
file  eoPBILOrg.h
file  make_algo_scalar_ga.cpp
file  make_checkpoint_ga.cpp
file  make_continue_ga.cpp
file  make_ga.h
file  make_genotype_ga.cpp
file  make_genotype_ga.h
file  ga/make_op.h
file  make_op_ga.cpp
file  make_PBILdistrib.h
file  make_PBILupdate.h
file  make_pop_ga.cpp
file  make_run_ga.cpp
+
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000014.html b/trunk/paradiseo-eo/doc/html/dir_000014.html new file mode 100644 index 000000000..821c8a82b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000014.html @@ -0,0 +1,25 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/src/other/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / other
+

other Directory Reference

+ + + + + + + + +

Files

file  eoExternalEO.h
file  eoExternalOpFunctions.h
file  eoString.h
+
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000015.html b/trunk/paradiseo-eo/doc/html/dir_000015.html new file mode 100644 index 000000000..95cc38b9a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000015.html @@ -0,0 +1,25 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/MGE/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / MGE
+

MGE Directory Reference

+ + + + + + + + +

Files

file  eoInitVirus.h
file  eoVirus.h
file  VirusOp.h
+
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000016.html b/trunk/paradiseo-eo/doc/html/dir_000016.html new file mode 100644 index 000000000..07b093b13 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000016.html @@ -0,0 +1,39 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson5/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Lesson5
+

Lesson5 Directory Reference

+ + + + + + + + + + + + + + + + + + + + + + +

Files

file  eoOneMax.h
file  eoOneMaxEvalFunc.h
file  eoOneMaxInit.h
file  eoOneMaxMutation.h
file  eoOneMaxQuadCrossover.h
file  make_genotype_OneMax.h
file  make_OneMax.cpp
file  make_op_OneMax.h
file  OneMaxEA.cpp
file  OneMaxLibEA.cpp
+
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000017.html b/trunk/paradiseo-eo/doc/html/dir_000017.html new file mode 100644 index 000000000..707c1d774 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000017.html @@ -0,0 +1,33 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / gp
+

gp Directory Reference

+ + + + + + + + + + + + + + + + +

Files

file  eoParseTree.h
file  eoParseTreeDepthInit.h
file  eoParseTreeOp.h
file  eoStParseTreeDepthInit.h
file  eoStParseTreeOp.h
file  node_pool.h
file  parse_tree.h
+
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000018.html b/trunk/paradiseo-eo/doc/html/dir_000018.html new file mode 100644 index 000000000..4bf8f4daa --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000018.html @@ -0,0 +1,37 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eo_interface/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / eo_interface
+

eo_interface Directory Reference

+ + + + + + + + + + + + + + + + + + + + +

Files

file  eoSym.h
file  eoSymCrossover.cpp
file  eoSymCrossover.h
file  eoSymEval.h
file  eoSymInit.h
file  eoSymLambdaMutate.cpp
file  eoSymLambdaMutate.h
file  eoSymMutate.cpp
file  eoSymMutate.h
+
Generated on Thu Oct 19 05:07:01 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000019.html b/trunk/paradiseo-eo/doc/html/dir_000019.html new file mode 100644 index 000000000..560526f2c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000019.html @@ -0,0 +1,25 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson1/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Lesson1
+

Lesson1 Directory Reference

+ + + + + + + + +

Files

file  exercise1.3.cpp
file  FirstBitGA.cpp
file  FirstRealGA.cpp
+
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000020.html b/trunk/paradiseo-eo/doc/html/dir_000020.html new file mode 100644 index 000000000..e2e562df1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000020.html @@ -0,0 +1,25 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/app/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+app
+

app Directory Reference

+ + + + + + + + +

Directories

directory gprop
directory gpsymreg
directory mastermind
+
Generated on Thu Oct 19 05:07:01 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000021.html b/trunk/paradiseo-eo/doc/html/dir_000021.html new file mode 100644 index 000000000..c754d33d0 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000021.html @@ -0,0 +1,27 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/app/gpsymreg/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+app / gpsymreg
+

gpsymreg Directory Reference

+ + + + + + + + + + +

Files

file  fitness.h
file  main.cpp
file  node.h
file  parameters.h
+
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000022.html b/trunk/paradiseo-eo/doc/html/dir_000022.html new file mode 100644 index 000000000..f2dfbec85 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000022.html @@ -0,0 +1,31 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/fun/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / fun
+

fun Directory Reference

+ + + + + + + + + + + + + + +

Files

file  FunDef.cpp
file  FunDef.h
file  sym_operations.cpp
file  SymOps.cpp
file  SymOps.h
file  util.cpp
+
Generated on Thu Oct 19 05:07:01 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000023.html b/trunk/paradiseo-eo/doc/html/dir_000023.html new file mode 100644 index 000000000..10bac4347 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000023.html @@ -0,0 +1,33 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/app/gprop/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+app / gprop
+

gprop Directory Reference

+ + + + + + + + + + + + + + + + +

Files

file  gprop.cpp
file  gprop.h
file  l2.h
file  mlp.h
file  mse.h
file  qp.h
file  vecop.h
+
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000024.html b/trunk/paradiseo-eo/doc/html/dir_000024.html new file mode 100644 index 000000000..f7d635a17 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000024.html @@ -0,0 +1,31 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/gen/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / gen
+

gen Directory Reference

+ + + + + + + + + + + + + + +

Files

file  LanguageTable.cpp
file  LanguageTable.h
file  NodeSelector.cpp
file  NodeSelector.h
file  TreeBuilder.cpp
file  TreeBuilder.h
+
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000025.html b/trunk/paradiseo-eo/doc/html/dir_000025.html new file mode 100644 index 000000000..0d992552f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000025.html @@ -0,0 +1,43 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/src/do/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / do
+

do Directory Reference

+ + + + + + + + + + + + + + + + + + + + + + + + + + +

Files

file  make_algo_easea.h
file  make_algo_pareto.h
file  make_algo_scalar.h
file  make_checkpoint.h
file  make_checkpoint_assembled.h
file  make_checkpoint_FDC.h
file  make_checkpoint_pareto.h
file  make_continue.h
file  make_continue_pareto.h
file  make_general_replacement.h
file  make_pop.h
file  make_run.h
+
Generated on Thu Oct 19 05:07:01 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000026.html b/trunk/paradiseo-eo/doc/html/dir_000026.html new file mode 100644 index 000000000..d1eb4fdf4 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000026.html @@ -0,0 +1,33 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Templates/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Templates
+

Templates Directory Reference

+ + + + + + + + + + + + + + + + +

Files

file  make_genotype_MyStruct.h
file  make_MyStruct.cpp
file  make_op_MyStruct.h
file  MyStructEA.cpp
file  MyStructLibEA.cpp
file  MyStructSEA.cpp
file  tutorial/Templates/README
+
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000027.html b/trunk/paradiseo-eo/doc/html/dir_000027.html new file mode 100644 index 000000000..813dcbd99 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000027.html @@ -0,0 +1,23 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/app/mastermind/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+app / mastermind
+

mastermind Directory Reference

+ + + + + + +

Files

file  mastermind.cpp
file  mastermind.h
+
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000028.html b/trunk/paradiseo-eo/doc/html/dir_000028.html new file mode 100644 index 000000000..e280b1fbc --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000028.html @@ -0,0 +1,31 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/sym/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / sym
+

sym Directory Reference

+ + + + + + + + + + + + + + +

Files

file  README.cpp
file  Sym.cpp
file  Sym.h
file  SymImpl.cpp
file  SymImpl.h
file  token.h
+
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/dir_000029.html b/trunk/paradiseo-eo/doc/html/dir_000029.html new file mode 100644 index 000000000..f9d169416 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/dir_000029.html @@ -0,0 +1,31 @@ + + +EO: /users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/test/ Directory Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / test
+

test Directory Reference

+ + + + + + + + + + + + + + +

Files

file  test_compile.cpp
file  test_diff.cpp
file  test_lambda.cpp
file  test_mf.cpp
file  test_simplify.cpp
file  testeo.cpp
+
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/doxygen.css b/trunk/paradiseo-eo/doc/html/doxygen.css new file mode 100644 index 000000000..1d4d63117 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/doxygen.css @@ -0,0 +1,271 @@ +BODY,H1,H2,H3,H4,H5,H6,P,CENTER,TD,TH,UL,DL,DIV { + font-family: Geneva, Arial, Helvetica, sans-serif; +} +H1 { + text-align: center; +} +CAPTION { font-weight: bold } +DIV.qindex { + width: 100%; + background-color: #eeeeff; + border: 1px solid #b0b0b0; + text-align: center; + margin: 2px; + padding: 2px; + line-height: 140%; +} +DIV.nav { + width: 100%; + background-color: #eeeeff; + border: 1px solid #b0b0b0; + text-align: center; + margin: 2px; + padding: 2px; + line-height: 140%; +} +A.qindex { + text-decoration: none; + font-weight: bold; + color: #1A419D; +} +A.qindex:visited { + text-decoration: none; + font-weight: bold; + color: #1A419D +} +A.qindex:hover { + text-decoration: none; + background-color: #ddddff; +} +A.qindexHL { + text-decoration: none; + font-weight: bold; + background-color: #6666cc; + color: #ffffff; + border: 1px double #9295C2; +} +A.qindexHL:hover { + text-decoration: none; + background-color: #6666cc; + color: #ffffff; +} +A.qindexHL:visited { text-decoration: none; background-color: #6666cc; color: #ffffff } +A.el { text-decoration: none; font-weight: bold } +A.elRef { font-weight: bold } +A.code:link { text-decoration: none; font-weight: normal; color: #0000FF} +A.code:visited { text-decoration: none; font-weight: normal; color: #0000FF} +A.codeRef:link { font-weight: normal; color: #0000FF} +A.codeRef:visited { font-weight: normal; color: #0000FF} +A:hover { text-decoration: none; background-color: #f2f2ff } +DL.el { margin-left: -1cm } +.fragment { + font-family: monospace +} +PRE.fragment { + border: 1px solid #CCCCCC; + background-color: #f5f5f5; + margin-top: 4px; + margin-bottom: 4px; + margin-left: 2px; + margin-right: 8px; + padding-left: 6px; + padding-right: 6px; + padding-top: 4px; + padding-bottom: 4px; +} +DIV.ah { background-color: black; font-weight: bold; color: #ffffff; margin-bottom: 3px; margin-top: 3px } +TD.md { background-color: #F4F4FB; font-weight: bold; } +TD.mdname1 { background-color: #F4F4FB; font-weight: bold; color: #602020; } +TD.mdname { background-color: #F4F4FB; font-weight: bold; color: #602020; width: 600px; } +DIV.groupHeader { + margin-left: 16px; + margin-top: 12px; + margin-bottom: 6px; + font-weight: bold; +} +DIV.groupText { margin-left: 16px; font-style: italic; font-size: 14px } +BODY { + background: white; + color: black; + margin-right: 20px; + margin-left: 20px; +} +TD.indexkey { + background-color: #eeeeff; + font-weight: bold; + padding-right : 10px; + padding-top : 2px; + padding-left : 10px; + padding-bottom : 2px; + margin-left : 0px; + margin-right : 0px; + margin-top : 2px; + margin-bottom : 2px; + border: 1px solid #CCCCCC; +} +TD.indexvalue { + background-color: #eeeeff; + font-style: italic; + padding-right : 10px; + padding-top : 2px; + padding-left : 10px; + padding-bottom : 2px; + margin-left : 0px; + margin-right : 0px; + margin-top : 2px; + margin-bottom : 2px; + border: 1px solid #CCCCCC; +} +TR.memlist { + background-color: #f0f0f0; +} +P.formulaDsp { text-align: center; } +IMG.formulaDsp { } +IMG.formulaInl { vertical-align: middle; } +SPAN.keyword { color: #008000 } +SPAN.keywordtype { color: #604020 } +SPAN.keywordflow { color: #e08000 } +SPAN.comment { color: #800000 } +SPAN.preprocessor { color: #806020 } +SPAN.stringliteral { color: #002080 } +SPAN.charliteral { color: #008080 } +.mdTable { + border: 1px solid #868686; + background-color: #F4F4FB; +} +.mdRow { + padding: 8px 10px; +} +.mdescLeft { + padding: 0px 8px 4px 8px; + font-size: 12px; + font-style: italic; + background-color: #FAFAFA; + border-top: 1px none #E0E0E0; + border-right: 1px none #E0E0E0; + border-bottom: 1px none #E0E0E0; + border-left: 1px none #E0E0E0; + margin: 0px; +} +.mdescRight { + padding: 0px 8px 4px 8px; + font-size: 12px; + font-style: italic; + background-color: #FAFAFA; + border-top: 1px none #E0E0E0; + border-right: 1px none #E0E0E0; + border-bottom: 1px none #E0E0E0; + border-left: 1px none #E0E0E0; + margin: 0px; +} +.memItemLeft { + padding: 1px 0px 0px 8px; + margin: 4px; + border-top-width: 1px; + border-right-width: 1px; + border-bottom-width: 1px; + border-left-width: 1px; + border-top-color: #E0E0E0; + border-right-color: #E0E0E0; + border-bottom-color: #E0E0E0; + border-left-color: #E0E0E0; + border-top-style: solid; + border-right-style: none; + border-bottom-style: none; + border-left-style: none; + background-color: #FAFAFA; + font-size: 12px; +} +.memItemRight { + padding: 1px 8px 0px 8px; + margin: 4px; + border-top-width: 1px; + border-right-width: 1px; + border-bottom-width: 1px; + border-left-width: 1px; + border-top-color: #E0E0E0; + border-right-color: #E0E0E0; + border-bottom-color: #E0E0E0; + border-left-color: #E0E0E0; + border-top-style: solid; + border-right-style: none; + border-bottom-style: none; + border-left-style: none; + background-color: #FAFAFA; + font-size: 13px; +} +.memTemplItemLeft { + padding: 1px 0px 0px 8px; + margin: 4px; + border-top-width: 1px; + border-right-width: 1px; + border-bottom-width: 1px; + border-left-width: 1px; + border-top-color: #E0E0E0; + border-right-color: #E0E0E0; + border-bottom-color: #E0E0E0; + border-left-color: #E0E0E0; + border-top-style: none; + border-right-style: none; + border-bottom-style: none; + border-left-style: none; + background-color: #FAFAFA; + font-size: 12px; +} +.memTemplItemRight { + padding: 1px 8px 0px 8px; + margin: 4px; + border-top-width: 1px; + border-right-width: 1px; + border-bottom-width: 1px; + border-left-width: 1px; + border-top-color: #E0E0E0; + border-right-color: #E0E0E0; + border-bottom-color: #E0E0E0; + border-left-color: #E0E0E0; + border-top-style: none; + border-right-style: none; + border-bottom-style: none; + border-left-style: none; + background-color: #FAFAFA; + font-size: 13px; +} +.memTemplParams { + padding: 1px 0px 0px 8px; + margin: 4px; + border-top-width: 1px; + border-right-width: 1px; + border-bottom-width: 1px; + border-left-width: 1px; + border-top-color: #E0E0E0; + border-right-color: #E0E0E0; + border-bottom-color: #E0E0E0; + border-left-color: #E0E0E0; + border-top-style: solid; + border-right-style: none; + border-bottom-style: none; + border-left-style: none; + color: #606060; + background-color: #FAFAFA; + font-size: 12px; +} +.search { color: #003399; + font-weight: bold; +} +FORM.search { + margin-bottom: 0px; + margin-top: 0px; +} +INPUT.search { font-size: 75%; + color: #000080; + font-weight: normal; + background-color: #eeeeff; +} +TD.tiny { font-size: 75%; +} +a { + color: #252E78; +} +a:visited { + color: #3D2185; +} diff --git a/trunk/paradiseo-eo/doc/html/doxygen.png b/trunk/paradiseo-eo/doc/html/doxygen.png new file mode 100644 index 0000000000000000000000000000000000000000..f0a274bbaffdd67f6d784c894d9cf28729db0e14 GIT binary patch literal 1281 zcmaJ>ZA?>F7(Vx-ms?uoS`b@hdRtpo6o^%HU>M$hfGrBvQnk$LE?p^P!kn&ikhyq! zX~V@&tPF5Qt@V?oTL96Bi%aRiwbe1)9DWQI#?)=HxS7QSw`J`5fAJ*eJbB;uNuKA& zdERDo*{Y<(If(#(B$Lr#;nB(8Y#ia=ZCeW?JfPLuQY`=@cW$k}Rivq|vbxGrRq1Tl9;+(gNt?}UtVKM2`T5t1jLzuL@0UIs`S#vlhl4)^ zLgSYrPj@$+`|j?eSbXTmiHGkWxV8V}BzNR?pl9k_s4pDu9vd5a_UzZEPk)}Ad{AV_ zzddrjrh4=Imr`E06;LY{)YYt?o}L~H@7C}F^WB!Ra=v`Q0bj{>5&$66CWF>mf6vjP z2N>RRY6ZYa=K`76>+|_)Xdwko+7wv}7cN|btOhWb(*{sta~6b?S8Omrxw}!4`NhGr zZVpNqpu1@BE`QGWNTpEpcJVW5izu~2B^GlM?1(OPg)zwW;QcP@Ltcclm>XbJL9C|j z=9!2?ua=uIlf0%AndzHsRC}IyTL$EhAee(fdKB`?27KeS^2M8M_7b~PiCFO&r5LC7 z7gl1*a<8;SjNaw#h=843_AV9iZbWQOAp5YOC^&_F*9K0> zB|6%IDb?aM#3viTxkLU4aXg&@+CkNTOnQ1iMP*^?b|^lJy$4C)Zk4isV!|RZ*XhXh zw8q3$=*0LeGC!XI_Wc?dkT~3+*Gu%%yIqP+Wr3H$=&ROMQU6q}Ag^P~>c5vAEO;a- z_dK-3PPeKar%)6$j~vI2#*-YH!1h6HYVtwCX5_wM`iF#UKz&&@9Oo5w3%XGYrX zW>dY~)SG-((Yim%`InwgTvyRC?e=Wh^8KCao!R6Eg&TpVWUY1sN~4G}V?nFnEGo-; zHZ_$eW9-GnC%^WS9b z@p;-$oH#MtC0v>Q$HX%4^JdFdO$0cbv-W)Q TtK}Eh@>>I#ipmV1>S*>q-hkC} literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/eig_8cpp-source.html b/trunk/paradiseo-eo/doc/html/eig_8cpp-source.html new file mode 100644 index 000000000..e25a8d871 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eig_8cpp-source.html @@ -0,0 +1,274 @@ + + +EO: eig.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

eig.cpp

00001 
+00002 /*
+00003  * C++ification of Nikolaus Hansen's original C-source code for the
+00004  * CMA-ES. These are the eigenvector calculations
+00005  *
+00006  * C++-ificiation performed by Maarten Keijzer (C) 2005. Licensed under
+00007  * the LGPL. Original copyright of Nikolaus Hansen can be found below
+00008  *
+00009  * This algorithm is held almost completely intact. Some other datatypes are used,
+00010  * but hardly any code has changed
+00011  * 
+00012  */
+00013 
+00014 /* --------------------------------------------------------- */
+00015 /* --------------------------------------------------------- */
+00016 /* --- File: cmaes.c  -------- Author: Nikolaus Hansen   --- */
+00017 /* --------------------------------------------------------- */
+00018 /*
+00019  *      CMA-ES for non-linear function minimization.
+00020  *
+00021  *           Copyright (C) 1996, 2003  Nikolaus Hansen.
+00022  *           e-mail: hansen@bionik.tu-berlin.de
+00023  *
+00024  *           This library is free software; you can redistribute it and/or
+00025  *           modify it under the terms of the GNU Lesser General Public
+00026  *           License as published by the Free Software Foundation; either
+00027  *           version 2.1 of the License, or (at your option) any later
+00028  *           version (see http://www.gnu.org/copyleft/lesser.html).
+00029  *
+00030  *           This library is distributed in the hope that it will be useful,
+00031  *           but WITHOUT ANY WARRANTY; without even the implied warranty of
+00032  *           MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00033  *           Lesser General Public License for more details.
+00034  * 
+00035  *                                                             */
+00036 /* --- Changes : ---
+00037  *   03/03/21: argument const double *rgFunVal of
+00038  *   cmaes_ReestimateDistribution() was treated incorrectly.
+00039  *   03/03/29: restart via cmaes_resume_distribution() implemented.
+00040  *   03/03/30: Always max std dev / largest axis is printed first.
+00041  *   03/08/30: Damping is adjusted for large mueff.
+00042  *   03/10/30: Damping is adjusted for large mueff always.
+00043  *   04/04/22: Cumulation time and damping for step size adjusted.
+00044  *   No iniphase but conditional update of pc.
+00045  *   Version 2.23.
+00046  *                               */
+00047 #include "eig.h"
+00048 
+00049 using namespace std;
+00050 
+00051 /* ========================================================= */
+00052 /* 
+00053    Householder Transformation einer symmetrischen Matrix
+00054    auf tridiagonale Form.
+00055    -> n             : Dimension
+00056    -> ma            : symmetrische nxn-Matrix
+00057    <- ma            : Transformationsmatrix (ist orthogonal): 
+00058                       Tridiag.-Matrix == <-ma * ->ma * (<-ma)^t
+00059    <- diag          : Diagonale der resultierenden Tridiagonalmatrix
+00060    <- neben[0..n-1] : Nebendiagonale (==1..n-1) der res. Tridiagonalmatrix
+00061 
+00062    */
+00063 static void 
+00064 Householder( int N, square_matrix& ma, valarray<double>& diag, double* neben)
+00065 {
+00066   double epsilon; 
+00067   int i, j, k;
+00068   double h, sum, tmp, tmp2;
+00069 
+00070   for (i = N-1; i > 0; --i)
+00071   {
+00072     h = 0.0;
+00073     if (i == 1)
+00074       neben[i] = ma[i][i-1];
+00075     else
+00076     {
+00077       for (k = i-1, epsilon = 0.0; k >= 0; --k)
+00078         epsilon += fabs(ma[i][k]);
+00079 
+00080       if (epsilon == 0.0)
+00081         neben[i] = ma[i][i-1];
+00082       else
+00083       {
+00084         for(k = i-1, sum = 0.0; k >= 0; --k)
+00085         { /* i-te Zeile von i-1 bis links normieren */
+00086           ma[i][k] /= epsilon;
+00087           sum += ma[i][k]*ma[i][k];
+00088         } 
+00089         tmp = (ma[i][i-1] > 0) ? -sqrt(sum) : sqrt(sum);
+00090         neben[i] = epsilon*tmp;
+00091         h = sum - ma[i][i-1]*tmp;
+00092         ma[i][i-1] -= tmp;
+00093         for (j = 0, sum = 0.0; j < i; ++j)
+00094         {
+00095           ma[j][i] = ma[i][j]/h;
+00096           tmp = 0.0;
+00097           for (k = j; k >= 0; --k)
+00098             tmp += ma[j][k]*ma[i][k];
+00099           for (k = j+1; k < i; ++k)
+00100             tmp += ma[k][j]*ma[i][k];
+00101           neben[j] = tmp/h;
+00102           sum += neben[j] * ma[i][j];
+00103         } /* for j */
+00104         sum /= 2.*h;
+00105         for (j = 0; j < i; ++j)
+00106         {
+00107           neben[j] -= ma[i][j]*sum;
+00108           tmp = ma[i][j];
+00109           tmp2 = neben[j];
+00110           for (k = j; k >= 0; --k)
+00111             ma[j][k] -= (tmp*neben[k] + tmp2*ma[i][k]);
+00112         } /* for j */
+00113       } /* else epsilon */
+00114     } /* else i == 1 */
+00115     diag[i] = h;
+00116   } /* for i */
+00117 
+00118   diag[0] = 0.0;
+00119   neben[0] = 0.0;
+00120   
+00121   for (i = 0; i < N; ++i)
+00122   {
+00123     if(diag[i] != 0.0)
+00124       for (j = 0; j < i; ++j)
+00125       {
+00126         for (k = i-1, tmp = 0.0; k >= 0; --k)
+00127           tmp += ma[i][k] * ma[k][j];
+00128         for (k = i-1; k >= 0; --k)
+00129           ma[k][j] -= tmp*ma[k][i];
+00130       } /* for j   */
+00131     diag[i] = ma[i][i];
+00132     ma[i][i] = 1.0;
+00133     for (k = i-1; k >= 0; --k)
+00134       ma[k][i] = ma[i][k] = 0.0;
+00135   } /* for i */
+00136 }
+00137 
+00138 /*
+00139   QL-Algorithmus mit implizitem Shift, zur Berechnung von Eigenwerten
+00140   und -vektoren einer symmetrischen Tridiagonalmatrix. 
+00141   -> n     : Dimension. 
+00142   -> diag        : Diagonale der Tridiagonalmatrix. 
+00143   -> neben[0..n-1] : Nebendiagonale (==0..n-2), n-1. Eintrag beliebig
+00144   -> mq    : Matrix output von Householder() 
+00145   -> maxIt : maximale Zahl der Iterationen 
+00146   <- diag  : Eigenwerte
+00147   <- neben : Garbage
+00148   <- mq    : k-te Spalte ist normalisierter Eigenvektor zu diag[k]
+00149 
+00150   */
+00151 
+00152 static int 
+00153 QLalgo( int N, valarray<double>& diag, square_matrix& mq, 
+00154         int maxIter, double* neben)
+00155 {
+00156   int i, j, k, kp1, l;
+00157   double tmp, diff, cneben, c1, c2, p;
+00158   int iter;
+00159 
+00160   neben[N-1] = 0.0;
+00161   for (i = 0, iter = 0; i < N && iter < maxIter; ++i)
+00162     do /* while j != i */
+00163     {
+00164       for (j = i; j < N-1; ++j)
+00165       {
+00166         tmp = fabs(diag[j]) + fabs(diag[j+1]);
+00167         if (fabs(neben[j]) + tmp == tmp)
+00168           break;
+00169       }
+00170       if (j != i)
+00171       {
+00172         if (++iter > maxIter) return maxIter-1;
+00173         diff = (diag[i+1]-diag[i])/neben[i]/2.0;
+00174         if (diff >= 0)
+00175           diff = diag[j] - diag[i] + 
+00176             neben[i] / (diff + sqrt(diff * diff + 1.0));
+00177         else
+00178           diff = diag[j] - diag[i] + 
+00179             neben[i] / (diff - sqrt(diff * diff + 1.0));
+00180         c2 = c1 = 1.0;
+00181         p = 0.0;
+00182         for (k = j-1; k >= i; --k)
+00183         {
+00184           kp1 = k + 1;
+00185           tmp = c2 * neben[k];
+00186           cneben = c1 * neben[k];
+00187           if (fabs(tmp) >= fabs(diff))
+00188           {
+00189             c1 = diff / tmp;
+00190             c2 = 1. / sqrt(c1*c1 + 1.0);
+00191             neben[kp1] = tmp / c2;
+00192             c1 *= c2;
+00193           }
+00194           else
+00195           {
+00196             c2 = tmp / diff;
+00197             c1 = 1. / sqrt(c2*c2 + 1.0);
+00198             neben[kp1] = diff / c1;
+00199             c2 *= c1;
+00200           } /* else */
+00201           tmp = (diag[k] - diag[kp1] + p) * c2 + 2.0 * c1 * cneben;
+00202           diag[kp1] += tmp * c2 - p;
+00203           p = tmp * c2;
+00204           diff = tmp * c1 - cneben;
+00205           for (l = N-1; l >= 0; --l) /* TF-Matrix Q */
+00206           { 
+00207             tmp = mq[l][kp1];
+00208             mq[l][kp1] = c2 * mq[l][k] + c1 * tmp;
+00209             mq[l][k] = c1 * mq[l][k] - c2 * tmp;
+00210           } /* for l */
+00211         } /* for k */
+00212         diag[i] -= p;
+00213         neben[i] = diff;
+00214         neben[j] = 0.0;
+00215       } /* if */
+00216     } while (j != i);
+00217   return iter;
+00218 } /* QLalgo() */
+00219 
+00220 /* ========================================================= */
+00221 /* 
+00222    Calculating eigenvalues and vectors. 
+00223    Input: 
+00224      N: dimension.
+00225      C: lower_triangular NxN-matrix.
+00226      niter: number of maximal iterations for QL-Algorithm. 
+00227      rgtmp: N+1-dimensional vector for temporal use. 
+00228    Output: 
+00229      diag: N eigenvalues.
+00230      Q: Columns are normalized eigenvectors.
+00231      return: number of iterations in QL-Algorithm.
+00232  */
+00233 
+00234 namespace eo {
+00235 int 
+00236 eig( int N,  const lower_triangular_matrix& C, valarray<double>& diag, square_matrix& Q, 
+00237        int niter)
+00238 {
+00239   int ret;
+00240   int i, j;
+00241 
+00242   if (niter == 0) niter = 30*N;
+00243 
+00244   for (i=0; i < N; ++i)
+00245   {
+00246       vector<double>::const_iterator row = C[i];
+00247       for (j = 0; j <= i; ++j)
+00248           Q[i][j] = Q[j][i] = row[j];
+00249   }
+00250   
+00251   double* rgtmp = new double[N+1];
+00252   Householder( N, Q, diag, rgtmp);
+00253   ret = QLalgo( N, diag, Q, niter, rgtmp+1);
+00254   delete [] rgtmp;
+00255   
+00256   return ret;
+00257 }  
+00258 
+00259 } // namespace eo
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eig_8h-source.html b/trunk/paradiseo-eo/doc/html/eig_8h-source.html new file mode 100644 index 000000000..d2d8d84fe --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eig_8h-source.html @@ -0,0 +1,40 @@ + + +EO: eig.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

eig.h

00001 #ifndef EIG_H__
+00002 #define EIG_H__
+00003 
+00004 #include <matrices.h>
+00005 #include <valarray>
+00006 
+00007 namespace eo {
+00008 /* ========================================================= */
+00009 /* 
+00010    Calculating eigenvalues and vectors. 
+00011    Input: 
+00012      N: dimension.
+00013      C: lower_triangular NxN-matrix.
+00014      niter: number of maximal iterations for QL-Algorithm. 
+00015    Output: 
+00016      diag: N eigenvalues.
+00017      Q: Columns are normalized eigenvectors.
+00018      return: number of iterations in QL-Algorithm.
+00019  */
+00020 extern int eig( int N,  const lower_triangular_matrix& C, std::valarray<double>& diag, square_matrix& Q, 
+00021        int niter = 0);
+00022 
+00023 } // namespace eo
+00024 
+00025 #endif
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_aged_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_aged_8h-source.html new file mode 100644 index 000000000..ec1fbf532 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_aged_8h-source.html @@ -0,0 +1,91 @@ + + +EO: eoAged.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib
+

eoAged.h

00001 // eoAged.h
+00002 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00003 
+00004 //-----------------------------------------------------------------------------
+00005 // eoAge.h
+00006 // (c) GeNeura Team, 1998
+00007 /* 
+00008     This library is free software; you can redistribute it and/or
+00009     modify it under the terms of the GNU Lesser General Public
+00010     License as published by the Free Software Foundation; either
+00011     version 2 of the License, or (at your option) any later version.
+00012 
+00013     This library is distributed in the hope that it will be useful,
+00014     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00015     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00016     Lesser General Public License for more details.
+00017 
+00018     You should have received a copy of the GNU Lesser General Public
+00019     License along with this library; if not, write to the Free Software
+00020     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00021 
+00022     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef EOAGED_H
+00027 #define EOAGED_H
+00028 
+00029 //-----------------------------------------------------------------------------
+00030 
+00031 #include <iostream>  // istream, ostream
+00032 #include <std::string> // para std::string
+00033 
+00034 using namespace std;
+00035 
+00036 //-----------------------------------------------------------------------------
+00037 // eoAge
+00038 //-----------------------------------------------------------------------------
+00039 
+00046 template <class Object>
+00047 class eoAged: public Object
+00048 {
+00049  public:
+00051         eoAged( const Object& _o): Object( _o ), age(0) {};
+00052 
+00054   eoAged( const eoAged& _a): Object( _a ), age( _a.age ) {};
+00055 
+00057   virtual ~eoAged() {};
+00058   
+00059 
+00061   unsigned long Age() const {return age;}
+00062 
+00064   const eoAged& operator ++ () { age++; return *this;}
+00065 
+00074   virtual std::string className() const { return std::string("eoAged")+Object::className(); };
+00075 
+00081   virtual void readFrom(istream& _is) {
+00082           Object::readFrom( _is );
+00083           _is >> age;
+00084   }
+00085 
+00086   
+00091   virtual void printOn(ostream& _os) const{
+00092           Object::printOn( _os );
+00093           _os << age;
+00094   }
+00096   
+00097  private:
+00098 
+00103          eoAged(): Object(), age(0) {};
+00104 
+00105          unsigned long age;
+00106 };
+00107 
+00108 #endif EOAGE_H
+00109 
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_algo_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_algo_8h-source.html new file mode 100644 index 000000000..8b266f650 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_algo_8h-source.html @@ -0,0 +1,51 @@ + + +EO: eoAlgo.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoAlgo.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoAlgo.h
+00005 // (c) GeNeura Team, 1998
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022  */
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef _EOALGO_H
+00026 #define _EOALGO_H
+00027 
+00028 #include <eoPop.h>                   // for population
+00029 #include <eoFunctor.h>
+00030 
+00038 template< class EOT >
+00039 class eoAlgo : public eoUF<eoPop<EOT>&, void>
+00040 {};
+00041 
+00042 
+00043 #endif
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_assembled_fitness_stat_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_assembled_fitness_stat_8h-source.html new file mode 100644 index 000000000..ef08f2d9d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_assembled_fitness_stat_8h-source.html @@ -0,0 +1,116 @@ + + +EO: eoAssembledFitnessStat.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoAssembledFitnessStat.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoAssembledFitnessStat.h
+00005 // Marc Wintermantel & Oliver Koenig
+00006 // IMES-ST@ETHZ.CH
+00007 // April 2003
+00008 
+00009 //-----------------------------------------------------------------------------
+00010 // eoStat.h
+00011 // (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000
+00012 /*
+00013     This library is free software; you can redistribute it and/or
+00014     modify it under the terms of the GNU Lesser General Public
+00015     License as published by the Free Software Foundation; either
+00016     version 2 of the License, or (at your option) any later version.
+00017 
+00018     This library is distributed in the hope that it will be useful,
+00019     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00020     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00021     Lesser General Public License for more details.
+00022 
+00023     You should have received a copy of the GNU Lesser General Public
+00024     License along with this library; if not, write to the Free Software
+00025     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00026 
+00027     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00028              Marc.Schoenauer@polytechnique.fr
+00029              mkeijzer@dhi.dk
+00030  */
+00031 //-----------------------------------------------------------------------------
+00032 
+00033 #ifndef _eoAssembledFitnessStat_h
+00034 #define _eoAssembledFitnessStat_h
+00035 
+00036 #include <utils/eoStat.h>
+00037 #include <eoScalarFitnessAssembled.h>
+00038 
+00045 template <class EOT>
+00046 class eoAssembledFitnessAverageStat : public eoStat<EOT, double>
+00047 {
+00048 public :
+00049 
+00050     using eoStat<EOT, double>::value;
+00051 
+00052     typedef typename EOT::Fitness Fitness;
+00053 
+00054 
+00055     eoAssembledFitnessAverageStat(unsigned _whichTerm=0, std::string _description = "Average Fitness")
+00056         : eoStat<EOT, double>(Fitness(), _description), whichFitnessTerm(_whichTerm)
+00057         {}
+00058 
+00059 
+00060     virtual void operator()(const eoPop<EOT>& _pop) {
+00061         if( whichFitnessTerm >= _pop[0].fitness().size() )
+00062             throw std::logic_error("Fitness term requested out of range");
+00063 
+00064     double result =0.0;
+00065     unsigned count = 0;
+00066     for (typename eoPop<EOT>::const_iterator it = _pop.begin(); it != _pop.end(); ++it){
+00067       if ( it->fitness().failed == false ){
+00068         result+= it->fitness()[whichFitnessTerm];
+00069         ++count;
+00070       }
+00071     }
+00072 
+00073     value() = result / (double) count;
+00074   }
+00075 
+00076 private:
+00077   // Store an index of the fitness term to be evaluated in eoScalarFitnessAssembled
+00078   unsigned whichFitnessTerm;
+00079 };
+00080 
+00086 template <class EOT>
+00087 class eoAssembledFitnessBestStat : public eoStat<EOT, double>
+00088 {
+00089 public:
+00090 
+00091     using eoStat<EOT, double>::value;
+00092 
+00093     typedef typename EOT::Fitness Fitness;
+00094 
+00095     eoAssembledFitnessBestStat(unsigned _whichTerm=0, std::string _description = "Best Fitness")
+00096         : eoStat<EOT, double>(Fitness(), _description), whichFitnessTerm(_whichTerm)
+00097         {}
+00098 
+00099     virtual void operator()(const eoPop<EOT>& _pop) {
+00100         if( whichFitnessTerm >= _pop[0].fitness().size() )
+00101             throw std::logic_error("Fitness term requested out of range");
+00102 
+00103         value() = _pop.best_element().fitness()[whichFitnessTerm];
+00104     }
+00105 
+00106 private:
+00107 
+00108     // Store an index of the fitness term to be evaluated in eoScalarFitnessAssembled
+00109     unsigned whichFitnessTerm;
+00110 };
+00111 
+00112 #endif
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_bit_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_bit_8h-source.html new file mode 100644 index 000000000..0b7083d9f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_bit_8h-source.html @@ -0,0 +1,108 @@ + + +EO: eoBit.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / ga
+

eoBit.h

00001 /*
+00002    eoBit.h
+00003    (c) GeNeura Team 1998, Marc Schoenauer 2000
+00004 
+00005     This library is free software; you can redistribute it and/or
+00006     modify it under the terms of the GNU Lesser General Public
+00007     License as published by the Free Software Foundation; either
+00008     version 2 of the License, or (at your option) any later version.
+00009 
+00010     This library is distributed in the hope that it will be useful,
+00011     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00012     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00013     Lesser General Public License for more details.
+00014 
+00015     You should have received a copy of the GNU Lesser General Public
+00016     License along with this library; if not, write to the Free Software
+00017     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00018 
+00019     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00020              Marc.Schoenauer@polytechnique.fr
+00021 */
+00022 
+00023 /* MS, Nov. 23, 2000
+00024    Added the calls to base class I/O routines that print the fitness
+00025    Left printing/reading of the size of the bitstring,
+00026        for backward compatibility, and as it is a general practice in EO
+00027 
+00028    MS, Feb. 7, 2001
+00029    replaced all ...Bin... names with ...Bit... names - for bitstring
+00030    as it was ambiguous with bin...ary things
+00031 */
+00032 
+00033 #ifndef eoBit_h
+00034 #define eoBit_h
+00035 
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 #include <iostream>    // std::ostream, std::istream
+00039 #include <functional>  // bind2nd
+00040 #include <string>      // std::string
+00041 
+00042 #include "eoVector.h"
+00043 
+00056 template <class FitT> class eoBit: public eoVector<FitT, bool>
+00057 {
+00058 public:
+00059 
+00060     using eoVector< FitT, bool >::begin;
+00061     using eoVector< FitT, bool >::end;
+00062     using eoVector< FitT, bool >::resize;
+00063     using eoVector< FitT, bool >::size;
+00064 
+00069   eoBit(unsigned size = 0, bool value = false):
+00070     eoVector<FitT, bool>(size, value) {}
+00071 
+00073   virtual std::string className() const
+00074     {
+00075       return "eoBit";
+00076     }
+00077 
+00082   virtual void printOn(std::ostream& os) const
+00083     {
+00084       EO<FitT>::printOn(os);
+00085       os << ' ';
+00086       os << size() << ' ';
+00087       std::copy(begin(), end(), std::ostream_iterator<bool>(os));
+00088     }
+00089 
+00094   virtual void readFrom(std::istream& is)
+00095     {
+00096       EO<FitT>::readFrom(is);
+00097       unsigned s;
+00098       is >> s;
+00099       std::string bits;
+00100       is >> bits;
+00101       if (is)
+00102         {
+00103           resize(bits.size());
+00104           std::transform(bits.begin(), bits.end(), begin(),
+00105                     std::bind2nd(std::equal_to<char>(), '1'));
+00106         }
+00107     }
+00108 };
+00109 
+00110 //-----------------------------------------------------------------------------
+00111 
+00112 #endif //eoBit_h
+00113 
+00114 
+00115 // Local Variables:
+00116 // mode: C++
+00117 // c-file-style: "Stroustrup"
+00118 // End:
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_bit_op_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_bit_op_8h-source.html new file mode 100644 index 000000000..ab498bc61 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_bit_op_8h-source.html @@ -0,0 +1,343 @@ + + +EO: eoBitOp.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / ga
+

eoBitOp.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoBitOp.h
+00005 // (c) GeNeura Team, 2000 - EEAAX 2000 - Maarten Keijzer 2000
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mak@dhi.dk
+00024  CVS Info: $Date: 2003/06/06 10:29:13 $ $Header: /cvsroot/eodev/eo/src/ga/eoBitOp.h,v 1.17 2003/06/06 10:29:13 maartenkeijzer Exp $ $Author: maartenkeijzer $
+00025  */
+00026 //-----------------------------------------------------------------------------
+00027 
+00028 #ifndef eoBitOp_h
+00029 #define eoBitOp_h
+00030 
+00031 //-----------------------------------------------------------------------------
+00032 
+00033 #include <algorithm>    // swap_ranges
+00034 #include <utils/eoRNG.h>
+00035 #include <eoInit.h>       // eoMonOp
+00036 #include <ga/eoBit.h>
+00037 
+00038 
+00044 template<class Chrom> class eoOneBitFlip: public eoMonOp<Chrom>
+00045 {
+00046  public:
+00048   virtual std::string className() const { return "eoOneBitFlip"; }
+00049 
+00054   bool operator()(Chrom& chrom)
+00055     {
+00056       unsigned i = eo::rng.random(chrom.size());
+00057       chrom[i] = (chrom[i]) ? false : true;
+00058       return true;
+00059     }
+00060 };
+00061 
+00067 template<class Chrom> class eoDetBitFlip: public eoMonOp<Chrom>
+00068 {
+00069  public:
+00075   eoDetBitFlip(const unsigned& _num_bit = 1): num_bit(_num_bit) {}
+00076 
+00078   virtual std::string className() const { return "eoDetBitFlip"; }
+00079 
+00084   bool operator()(Chrom& chrom)
+00085     {
+00086       // does not check for duplicate: if someone volunteers ....
+00087       for (unsigned k=0; k<num_bit; k++)
+00088         {
+00089           unsigned i = eo::rng.random(chrom.size());
+00090           chrom[i] = (chrom[i]) ? false : true;
+00091         }
+00092       return true;
+00093     }
+00094  private:
+00095   unsigned num_bit;
+00096 };
+00097 
+00098 
+00104 template<class Chrom> class eoBitMutation: public eoMonOp<Chrom>
+00105 {
+00106  public:
+00111   eoBitMutation(const double& _rate = 0.01, bool _normalize=false): 
+00112     rate(_rate), normalize(_normalize) {}
+00113 
+00115   virtual std::string className() const { return "eoBitMutation"; }
+00116 
+00121   bool operator()(Chrom& chrom)
+00122     {
+00123       double actualRate = (normalize ? rate/chrom.size() : rate);
+00124       bool changed_something = false;
+00125       for (unsigned i = 0; i < chrom.size(); i++)
+00126             if (eo::rng.flip(actualRate))
+00127         {
+00128                 chrom[i] = !chrom[i];
+00129             changed_something = true;
+00130         }
+00131 
+00132         return changed_something;
+00133     }
+00134 
+00135  private:
+00136   double rate;
+00137   bool normalize;                  // divide rate by chromSize
+00138 };
+00139 
+00140 
+00146 template<class Chrom> class eoBitInversion: public eoMonOp<Chrom>
+00147 {
+00148  public:
+00150   virtual std::string className() const { return "eoBitInversion"; }
+00151 
+00156   bool operator()(Chrom& chrom)
+00157     {
+00158 
+00159       unsigned u1 = eo::rng.random(chrom.size() + 1) , u2;
+00160       do u2 = eo::rng.random(chrom.size() + 1); while (u1 == u2);
+00161       unsigned r1 = std::min(u1, u2), r2 = std::max(u1, u2);
+00162 
+00163       std::reverse(chrom.begin() + r1, chrom.begin() + r2);
+00164       return true;
+00165     }
+00166 };
+00167 
+00168 
+00174 template<class Chrom> class eoBitNext: public eoMonOp<Chrom>
+00175 {
+00176  public:
+00178   virtual std::string className() const { return "eoBitNext"; }
+00179 
+00184   bool operator()(Chrom& chrom)
+00185     {
+00186       for (int i = chrom.size() - 1; i >= 0; i--)
+00187         if (chrom[i])
+00188           {
+00189             chrom[i] = 0;
+00190             continue;
+00191           }
+00192         else
+00193           {
+00194             chrom[i] = 1;
+00195             break;
+00196           }
+00197 
+00198     return true;
+00199     }
+00200 };
+00201 
+00202 
+00208 template<class Chrom> class eoBitPrev: public eoMonOp<Chrom>
+00209 {
+00210  public:
+00212   virtual std::string className() const { return "eoBitPrev"; }
+00213 
+00218   bool operator()(Chrom& chrom)
+00219     {
+00220       for (int i = chrom.size() - 1; i >= 0; i--)
+00221         if (chrom[i])
+00222           {
+00223             chrom[i] = 0;
+00224             break;
+00225           }
+00226         else
+00227           {
+00228             chrom[i] = 1;
+00229             continue;
+00230           }
+00231 
+00232     return true;
+00233     }
+00234 };
+00235 
+00236 
+00242 template<class Chrom> class eo1PtBitXover: public eoQuadOp<Chrom>
+00243 {
+00244  public:
+00246   virtual std::string className() const { return "eo1PtBitXover"; }
+00247 
+00253   bool operator()(Chrom& chrom1, Chrom& chrom2)
+00254     {
+00255       unsigned site = eo::rng.random(std::min(chrom1.size(), chrom2.size()));
+00256 
+00257       if (!std::equal(chrom1.begin(), chrom1.begin()+site, chrom2.begin()))
+00258       {
+00259 
+00260         std::swap_ranges(chrom1.begin(), chrom1.begin() + site, chrom2.begin());
+00261 
+00262         return true;
+00263       }
+00264       return false;
+00265   }
+00266 };
+00267 
+00268 
+00274 template<class Chrom> class eoUBitXover: public eoQuadOp<Chrom>
+00275 {
+00276  public:
+00278   eoUBitXover(const float& _preference = 0.5): preference(_preference)
+00279     {
+00280       if ( (_preference <= 0.0) || (_preference >= 1.0) )
+00281         std::runtime_error("UxOver --> invalid preference");
+00282     }
+00284   virtual std::string className() const { return "eoUBitXover"; }
+00285 
+00292   bool operator()(Chrom& chrom1, Chrom& chrom2)
+00293     {
+00294       if ( chrom1.size() != chrom2.size())
+00295             std::runtime_error("UxOver --> chromosomes sizes don't match" );
+00296       bool changed = false;
+00297       for (unsigned int i=0; i<chrom1.size(); i++)
+00298         {
+00299           if (chrom1[i] != chrom2[i] && eo::rng.flip(preference))
+00300             {
+00301               bool tmp = chrom1[i];
+00302               chrom1[i]=chrom2[i];
+00303               chrom2[i] = tmp;
+00304               changed = true;
+00305             }
+00306         }
+00307     return changed;
+00308   }
+00309     private:
+00310       float preference;
+00311 };
+00312 
+00313 
+00319 template<class Chrom> class eoNPtsBitXover: public eoQuadOp<Chrom>
+00320 {
+00321  public:
+00323   eoNPtsBitXover(const unsigned& _num_points = 2): num_points(_num_points)
+00324     {
+00325       if (num_points < 1)
+00326         std::runtime_error("NxOver --> invalid number of points");
+00327     }
+00328 
+00330   virtual std::string className() const { return "eoNPtsBitXover"; }
+00331 
+00337   bool operator()(Chrom& chrom1, Chrom& chrom2)
+00338     {
+00339       unsigned max_size = std::min(chrom1.size(), chrom2.size());
+00340       unsigned max_points = std::min(max_size - 1, num_points);
+00341 
+00342       std::vector<bool> points(max_size, false);
+00343 
+00344       // select ranges of bits to swap
+00345       do {
+00346         unsigned bit = eo::rng.random(max_size) + 1;
+00347         if (points[bit])
+00348           continue;
+00349         else
+00350           {
+00351             points[bit] = true;
+00352             max_points--;
+00353           }
+00354       } while (max_points);
+00355 
+00356 
+00357       // swap bits between chromosomes
+00358       bool change = false;
+00359       for (unsigned bit = 1; bit < points.size(); bit++)
+00360         {
+00361           if (points[bit])
+00362             change = !change;
+00363 
+00364           if (change)
+00365           {
+00366                 typename Chrom::AtomType tmp= chrom1[bit];
+00367                 chrom1[bit] = chrom2[bit];
+00368                 chrom2[bit] = tmp;
+00369           }
+00370         }
+00371 
+00372     return true;
+00373     }
+00374 
+00375  private:
+00376   unsigned num_points;
+00377 };
+00378 
+00379 
+00380 
+00388 template<class Chrom> class eoBitGxOver: public eoQuadOp<Chrom>
+00389 {
+00390  public:
+00392   eoBitGxOver(const unsigned _gene_size, const unsigned _num_points = 2):
+00393     gene_size(_gene_size), num_points(_num_points)
+00394     {
+00395       if (gene_size < 1)
+00396         std::runtime_error("GxOver --> invalid gene size");
+00397       if (num_points < 1)
+00398         std::runtime_error("GxOver --> invalid number of points");
+00399     }
+00400 
+00402   virtual std::string className() const { return "eoBitGxOver"; }
+00403 
+00409   bool operator()(Chrom& chrom1, Chrom& chrom2)
+00410     {
+00411       unsigned max_genes = std::min(chrom1.size(), chrom2.size()) / gene_size;
+00412       unsigned cut_genes = std::min(max_genes, num_points);
+00413 
+00414       std::vector<bool> points(max_genes, false);
+00415       
+00416       // selects genes to swap
+00417       do {
+00418         unsigned bit = eo::rng.random(max_genes); 
+00419         if (points[bit])
+00420           continue;
+00421         else
+00422           {
+00423             points[bit] = true;
+00424             cut_genes--;
+00425           }
+00426       } while (cut_genes);
+00427       
+00428       // swaps genes
+00429       for (unsigned i = 0; i < points.size(); i++)
+00430         if (points[i])
+00431           std::swap_ranges(chrom1.begin() + i * gene_size, 
+00432                       chrom1.begin() + i * gene_size + gene_size, 
+00433                       chrom2.begin() + i * gene_size);
+00434 
+00435     return true;
+00436   }
+00437 
+00438  private:
+00439   unsigned gene_size;
+00440   unsigned num_points;
+00441 };
+00442 
+00443 
+00444 
+00445 //-----------------------------------------------------------------------------
+00447 #endif
+00448 
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_bit_op_factory_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_bit_op_factory_8h-source.html new file mode 100644 index 000000000..db3761437 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_bit_op_factory_8h-source.html @@ -0,0 +1,167 @@ + + +EO: eoBitOpFactory.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / ga
+

eoBitOpFactory.h

00001 // eoBitOpFactory.h
+00002 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00003 
+00004 //-----------------------------------------------------------------------------
+00005 // eoOpFactory.h
+00006 // (c) GeNeura Team, 1998
+00007 /* 
+00008     This library is free software; you can redistribute it and/or
+00009     modify it under the terms of the GNU Lesser General Public
+00010     License as published by the Free Software Foundation; either
+00011     version 2 of the License, or (at your option) any later version.
+00012 
+00013     This library is distributed in the hope that it will be useful,
+00014     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00015     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00016     Lesser General Public License for more details.
+00017 
+00018     You should have received a copy of the GNU Lesser General Public
+00019     License along with this library; if not, write to the Free Software
+00020     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00021 
+00022     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _EOBITOPFACTORY_H
+00027 #define _EOBITOPFACTORY_H
+00028 
+00029 #include <eoFactory.h>
+00030 #include <ga/eoBitOp.h>
+00031 
+00032 //-----------------------------------------------------------------------------
+00033 
+00038 template< class EOT>
+00039 class eoBitOpFactory: public eoFactory<EOT>  
+00040 {
+00041         
+00042 public:
+00043         
+00045         //{@
+00047         eoBitOpFactory( ) {};
+00048         
+00050         virtual ~eoBitOpFactory() {};
+00052 
+00063         virtual eoOp<EOT>* make(std::istream& _is) 
+00064     {
+00065                 eoOp<EOT> * opPtr = NULL;
+00066                 try {
+00067                         opPtr = eoFactory<EOT>::make( _is );
+00068                 } catch ( const std::string& objectTypeStr ) {
+00069                         if ( objectTypeStr == "eoBinBitFlip" ) {
+00070                                 opPtr = new eoOneBitFlip<EOT>( );
+00071                         } 
+00072                         // handles old operator names as well as new ones
+00073                         if ( objectTypeStr == "eoOneBitFlip" ) {
+00074                                 opPtr = new eoOneBitFlip<EOT>( );
+00075                         } 
+00076 
+00077                         // Standard BitFilp Mutation
+00078                         if ( objectTypeStr == "eoBinMutation" ) {
+00079                                 float rate;
+00080                                 _is >> rate;
+00081                                 opPtr = new eoBitMutation<EOT>( rate );
+00082                         } 
+00083                         if ( objectTypeStr == "eoBitMutation" ) {
+00084                                 float rate;
+00085                                 _is >> rate;
+00086                                 opPtr = new eoBitMutation<EOT>( rate );
+00087                         } 
+00088 
+00089                         // Bit inversion
+00090                         if ( objectTypeStr == "eoBinInversion" ) {
+00091                                 opPtr = new eoBitInversion<EOT>( );
+00092                         }
+00093                         if ( objectTypeStr == "eoBitInversion" ) {
+00094                                 opPtr = new eoBitInversion<EOT>( );
+00095                         }
+00096 
+00097                         // Next binary value
+00098                         if ( objectTypeStr == "eoBinNext" ) {
+00099                                 opPtr = new eoBitNext<EOT>( );
+00100                         }
+00101                         if ( objectTypeStr == "eoBitNext" ) {
+00102                                 opPtr = new eoBitNext<EOT>( );
+00103                         }
+00104 
+00105                         // Previous binary value
+00106                         if ( objectTypeStr == "eoBinPrev" ) {
+00107                                 opPtr = new eoBitPrev<EOT>( );
+00108                         }
+00109                         if ( objectTypeStr == "eoBitPrev" ) {
+00110                                 opPtr = new eoBitPrev<EOT>( );
+00111                         }
+00112 
+00113                         // 1 point Xover
+00114                         if ( objectTypeStr == "eoBinCrossover" ) {
+00115                                 opPtr = new eo1PtBitXover<EOT>( );
+00116                         }
+00117                         if ( objectTypeStr == "eo1PtBitXover" ) {
+00118                                 opPtr = new eo1PtBitXover<EOT>( );
+00119                         }
+00120 
+00121                         // Npts Xover
+00122                         if ( objectTypeStr == "eoBinNxOver" ) {
+00123                                 unsigned nPoints;
+00124                                 _is >> nPoints;
+00125                                 opPtr = new eoNPtsBitXover<EOT>( nPoints );
+00126                         }
+00127                         if ( objectTypeStr == "eoNPtsBitXover" ) {
+00128                                 unsigned nPoints;
+00129                                 _is >> nPoints;
+00130                                 opPtr = new eoNPtsBitXover<EOT>( nPoints );
+00131                         }
+00132 
+00133                         // Gene Xover (obsolete)
+00134                         if ( objectTypeStr == "eoBinGxOver" ) {
+00135                                 unsigned geneSize, nPoints;
+00136                                 _is >> geneSize >> nPoints;
+00137                                 opPtr = new eoBitGxOver<EOT>( geneSize, nPoints );
+00138                         }
+00139                         if ( objectTypeStr == "eoBitGxOver" ) {
+00140                                 unsigned geneSize, nPoints;
+00141                                 _is >> geneSize >> nPoints;
+00142                                 opPtr = new eoBitGxOver<EOT>( geneSize, nPoints );
+00143                         }
+00144 
+00145                         // Uniform Xover
+00146                         if ( objectTypeStr == "eoBinUxOver" ) {
+00147                                 float rate;
+00148                                 _is >> rate;
+00149                                 opPtr = new eoUBitXover<EOT>( rate );
+00150                         }
+00151                         if ( objectTypeStr == "eoUBitXover" ) {
+00152                                 float rate;
+00153                                 _is >> rate;
+00154                                 opPtr = new eoUBitXover<EOT>( rate );
+00155                         }
+00156 
+00157                         // nothing read!
+00158                         if ( !opPtr ) { // to be caught by the upper level
+00159                                 throw objectTypeStr;
+00160                         }
+00161                 }
+00162                 return opPtr;
+00163         };
+00164 
+00165 
+00166 };
+00167 
+00168 
+00169 #endif
+00170 
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_bool_flip_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_bool_flip_8h-source.html new file mode 100644 index 000000000..11e986cdc --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_bool_flip_8h-source.html @@ -0,0 +1,57 @@ + + +EO: eoBoolFlip.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / ga
+

eoBoolFlip.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoBoolFlip.h
+00005 // (c) Marc Schoenauer, 2003
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: Marc.Schoenauer@inria.fr
+00022  */
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef _eoBoolFlip_h
+00026 #define _eoBoolFlip_h
+00027 
+00028 #include <eoOp.h>
+00029 
+00032 class eoBoolFlip : public eoMonOp<bool> {
+00033 public: 
+00035   bool operator()(bool & _b)
+00036   {
+00037     _b = !_b;
+00038     return true;
+00039   }
+00040 
+00042   virtual string className() const {return "boolFlip";}
+00043 
+00044 };
+00045 
+00046 #endif
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_breed_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_breed_8h-source.html new file mode 100644 index 000000000..a41ef3a9b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_breed_8h-source.html @@ -0,0 +1,55 @@ + + +EO: eoBreed.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoBreed.h

00001 
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef _eoBreed_h
+00026 #define _eoBreed_h
+00027 
+00028 
+00029 //-----------------------------------------------------------------------------
+00030 #include <eoPop.h>
+00031 #include <eoFunctor.h>
+00032 #include <eoSelect.h>
+00033 #include <eoTransform.h>
+00034 //-----------------------------------------------------------------------------
+00035 
+00045 template<class EOT>
+00046 class eoBreed : public eoBF<const eoPop<EOT>&, eoPop<EOT>&, void>
+00047 {};
+00048 
+00049 
+00050 
+00056 template <class EOT>
+00057 class eoSelectTransform : public eoBreed<EOT>
+00058 {
+00059     public:
+00060         eoSelectTransform(eoSelect<EOT>& _select, eoTransform<EOT>& _transform) :
+00061         select(_select), transform(_transform)
+00062         {}
+00063 
+00064         void operator()(const eoPop<EOT>& _parents, eoPop<EOT>& _offspring)
+00065         {
+00066             select(_parents, _offspring);
+00067             transform(_offspring);
+00068         }
+00069 
+00070     private :
+00071         eoSelect<EOT>& select;
+00072         eoTransform<EOT>& transform;
+00073 };
+00074 
+00075 #endif
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_c_m_a_breed_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_c_m_a_breed_8h-source.html new file mode 100644 index 000000000..2efcc76ea --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_c_m_a_breed_8h-source.html @@ -0,0 +1,91 @@ + + +EO: eoCMABreed.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

eoCMABreed.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; fill-column: 80; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoCMABreed
+00005 // (c) Maarten Keijzer 2005
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021  */
+00022 //-----------------------------------------------------------------------------
+00023 
+00024 
+00025 #ifndef _EOCMABREED_H
+00026 #define _EOCMABREED_H
+00027 
+00028 #include <eoBreed.h>
+00029 #include <eoVector.h>
+00030 #include <es/CMAState.h>
+00031 
+00032 #include <algorithm>
+00033 
+00035 template <class FitT>
+00036 class eoCMABreed : public eoBreed< eoVector<FitT, double> > {
+00037     
+00038     eo::CMAState& state;
+00039     unsigned lambda;
+00040     
+00041     typedef eoVector<FitT, double> EOT;
+00042     
+00043     public:
+00044     eoCMABreed(eo::CMAState& state_, unsigned lambda_) : state(state_), lambda(lambda_) {}
+00045     
+00046     void operator()(const eoPop<EOT>& parents, eoPop<EOT>& offspring) {
+00047         
+00048         // two temporary arrays of pointers to store the sorted population
+00049         std::vector<const EOT*> sorted(parents.size());
+00050         std::vector<const std::vector<double>* > mu(parents.size());
+00051         
+00052         parents.sort(sorted);
+00053         for (unsigned i = 0; i < sorted.size(); ++i) {
+00054             mu[i] = static_cast< const std::vector<double>* >( sorted[i] );
+00055         }
+00056         
+00057         // learn
+00058         
+00059         state.reestimate(mu, sorted[0]->fitness(), sorted.back()->fitness());
+00060         
+00061         if (!state.updateEigenSystem(10)) {
+00062             std::cerr << "No good eigensystem found" << std::endl;
+00063         }
+00064         
+00065         // generate
+00066         offspring.resize(lambda);
+00067 
+00068         for (unsigned i = 0; i < lambda; ++i) {
+00069             state.sample( static_cast< std::vector<double>& >( offspring[i] ));
+00070             offspring[i].invalidate();
+00071         }
+00072         
+00073     }
+00074 };
+00075 
+00076 
+00077 #endif
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_c_m_a_init_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_c_m_a_init_8h-source.html new file mode 100644 index 000000000..52af136b8 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_c_m_a_init_8h-source.html @@ -0,0 +1,68 @@ + + +EO: eoCMAInit.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

eoCMAInit.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; fill-column: 80; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoCMAInit 
+00005 // (c) Maarten Keijzer 2005
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              marc.schoenauer@polytechnique.fr
+00023                        http://eeaax.cmap.polytchnique.fr/
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 
+00028 #ifndef _EOCMAINIT_H
+00029 #define _EOCMAINIT_H
+00030 
+00031 #include <eoInit.h>
+00032 #include <eoVector.h>
+00033 #include <es/CMAState.h>
+00034 
+00036 template <class FitT>
+00037 class eoCMAInit : public eoInit< eoVector<FitT, double> > {
+00038     
+00039     const eo::CMAState& state;
+00040 
+00041     typedef eoVector<FitT, double> EOT;
+00042     
+00043     public:
+00044     eoCMAInit(const eo::CMAState& state_) : state(state_) {}
+00045 
+00046     
+00047     void operator()(EOT& v) {
+00048         state.sample(static_cast<std::vector<double>& >(v));
+00049         v.invalidate();
+00050     }
+00051 };
+00052 
+00053 
+00054 #endif
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_cellular_easy_e_a_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_cellular_easy_e_a_8h-source.html new file mode 100644 index 000000000..cb49cfa20 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_cellular_easy_e_a_8h-source.html @@ -0,0 +1,164 @@ + + +EO: eoCellularEasyEA.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoCellularEasyEA.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 // "eoCellularEasyEA.h"
+00004 
+00005 // (c) OPAC Team, LIFL, 2002
+00006 
+00007 /* This library is free software; you can redistribute it and/or
+00008    modify it under the terms of the GNU Lesser General Public
+00009    License as published by the Free Software Foundation; either
+00010    version 2 of the License, or (at your option) any later version.
+00011    
+00012    This library is distributed in the hope that it will be useful,
+00013    but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015    Lesser General Public License for more details.
+00016    
+00017    You should have received a copy of the GNU Lesser General Public
+00018    License along with this library; if not, write to the Free Software
+00019    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA
+00020    
+00021    Contact: cahon@lifl.fr
+00022 */
+00023 
+00024 #ifndef eoCellularEasyEA_h
+00025 #define eoCellularEasyEA_h
+00026 
+00027 #include <eoContinue.h>
+00028 #include <eoEvalFunc.h>
+00029 #include <eoSelectOne.h>
+00030 #include <eoPopEvalFunc.h>
+00031 #include <eoAlgo.h>
+00032 #include <eoOp.h>
+00033 
+00038 template <class EOT> class eoCellularEasyEA : public eoAlgo <EOT> {
+00039   
+00040 public :
+00041   
+00046   eoCellularEasyEA (eoContinue <EOT> & _cont, // Stop. criterion
+00047                     eoEvalFunc <EOT> & _eval, // Evaluation function
+00048                     eoSelectOne <EOT> & _sel_neigh, // To choose a partner
+00049                     eoBinOp <EOT> & _cross, // Cross-over operator
+00050                     eoMonOp <EOT> & _mut, // Mutation operator
+00051                     eoSelectOne <EOT> & _sel_repl /* Which to keep between the new
+00052                                                      child and the old individual ? */
+00053                     ) :
+00054     cont (_cont),
+00055     eval (_eval),
+00056     popEval (_eval),
+00057     sel_neigh (_sel_neigh),
+00058     cross (_cross),
+00059     mut (_mut),
+00060     sel_child (eoSelectFirstOne ()),
+00061     sel_repl (_sel_repl) {
+00062     
+00063   }
+00064   
+00065   eoCellularEasyEA (eoContinue <EOT> & _cont,
+00066                     eoEvalFunc <EOT> & _eval,
+00067                     eoSelectOne <EOT> & _sel_neigh,
+00068                     eoQuadOp <EOT> & _cross,
+00069                     eoMonOp <EOT> & _mut,
+00070                     eoSelectOne <EOT> & _sel_child, /* To choose one from
+00071                                                        the both children */
+00072                     eoSelectOne <EOT> & _sel_repl
+00073                     ) :
+00074     cont (_cont),
+00075     eval (_eval),
+00076     popEval (_eval),
+00077     sel_neigh (_sel_neigh),
+00078     cross (_cross),
+00079     mut (_mut),
+00080     sel_child (_sel_child),
+00081     sel_repl (_sel_repl) {
+00082     
+00083   }
+00084 
+00089   void operator () (eoPop <EOT> & pop) {
+00090     
+00091     do {
+00092       
+00093       for (unsigned i = 0 ; i < pop.size () ; i ++) {
+00094         
+00095         // Who are neighbouring to the current individual ?
+00096         eoPop <EOT> neigh = neighbours (pop, i) ;
+00097         
+00098         // To select a partner
+00099         EOT part, old_sol = pop [i] ;
+00100         part = sel_neigh (neigh) ;
+00101 
+00102         // To perform cross-over
+00103         cross (pop [i], part) ;
+00104 
+00105         // To perform mutation
+00106         mut (pop [i]) ;
+00107         mut (part) ;
+00108         
+00109         pop [i].invalidate () ;
+00110         part.invalidate () ;
+00111         eval (pop [i]) ;
+00112         eval (part) ;
+00113 
+00114         // To choose one of the two children ...
+00115         eoPop <EOT> pop_loc ;
+00116         pop_loc.push_back (pop [i]) ;
+00117         pop_loc.push_back (part) ;
+00118 
+00119         pop [i] = sel_child (pop_loc) ;
+00120 
+00121         // To choose only one between the new made child and the old individual
+00122         pop_loc.clear () ;
+00123         pop_loc.push_back (pop [i]) ;
+00124         
+00125         pop_loc.push_back (old_sol) ;
+00126         
+00127         pop [i] = sel_repl (pop_loc) ;  
+00128       }
+00129       
+00130     } while (cont (pop)) ;
+00131   }
+00132 
+00133 protected :
+00134   
+00135   virtual eoPop <EOT> neighbours (const eoPop <EOT> & pop, int rank) = 0 ;
+00136 
+00137 private :
+00138   
+00139   eoContinue <EOT> & cont ;
+00140   eoEvalFunc <EOT> & eval ;
+00141   eoPopLoopEval <EOT> popEval ;
+00142   eoSelectOne <EOT> & sel_neigh ;
+00143   eoBF <EOT &, EOT &, bool> & cross ;
+00144   eoMonOp <EOT> & mut ;
+00145   eoSelectOne <EOT> & sel_child ;
+00146   eoSelectOne <EOT> & sel_repl ;
+00147   
+00148   class eoSelectFirstOne : public eoSelectOne <EOT> {
+00149     
+00150   public :
+00151     
+00152     const EOT & operator () (const eoPop <EOT> & pop) {
+00153       
+00154       return pop [0] ; 
+00155     }
+00156     
+00157   } ; 
+00158   
+00159 } ;
+00160 
+00161 #endif
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_check_point_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_check_point_8h-source.html new file mode 100644 index 000000000..65117fe47 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_check_point_8h-source.html @@ -0,0 +1,165 @@ + + +EO: eoCheckPoint.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoCheckPoint.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoCheckPoint.h
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2000
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoCheckPoint_h
+00028 #define _eoCheckPoint_h
+00029 
+00030 #include <eoContinue.h>
+00031 #include <utils/eoUpdater.h>
+00032 #include <utils/eoMonitor.h>
+00033 #include <utils/eoStat.h>
+00034 
+00045 template <class EOT>
+00046 class eoCheckPoint : public eoContinue<EOT>
+00047 {
+00048 public :
+00049 
+00050     eoCheckPoint(eoContinue<EOT>& _cont) 
+00051   {
+00052     continuators.push_back(&_cont);
+00053   }
+00054 
+00055     bool operator()(const eoPop<EOT>& _pop);
+00056 
+00057     void add(eoContinue<EOT>& _cont) { continuators.push_back(&_cont); }
+00058     void add(eoSortedStatBase<EOT>& _stat) { sorted.push_back(&_stat); }
+00059     void add(eoStatBase<EOT>& _stat) { stats.push_back(&_stat); }
+00060     void add(eoMonitor& _mon)        { monitors.push_back(&_mon); }
+00061     void add(eoUpdater& _upd)        { updaters.push_back(&_upd); }
+00062 
+00063     virtual std::string className(void) const { return "eoCheckPoint"; }
+00064     std::string allClassNames() const ;
+00065 
+00066 private :
+00067 
+00068   std::vector<eoContinue<EOT>*>    continuators;
+00069     std::vector<eoSortedStatBase<EOT>*>    sorted;
+00070     std::vector<eoStatBase<EOT>*>    stats;
+00071     std::vector<eoMonitor*> monitors;
+00072     std::vector<eoUpdater*> updaters;
+00073 };
+00074 
+00075 template <class EOT>
+00076 bool eoCheckPoint<EOT>::operator()(const eoPop<EOT>& _pop)
+00077 {
+00078     unsigned i;
+00079 
+00080     std::vector<const EOT*> sorted_pop;
+00081     if (!sorted.empty())
+00082     {
+00083       _pop.sort(sorted_pop);
+00084 
+00085       for (i = 0; i < sorted.size(); ++i)
+00086       {
+00087         (*sorted[i])(sorted_pop);
+00088       }
+00089     }
+00090 
+00091     for (i = 0; i < stats.size(); ++i)
+00092         (*stats[i])(_pop);
+00093 
+00094     for (i = 0; i < updaters.size(); ++i)
+00095         (*updaters[i])();
+00096 
+00097     for (i = 0; i < monitors.size(); ++i)
+00098         (*monitors[i])();
+00099 
+00100     bool bContinue = true;
+00101     for (i = 0; i < continuators.size(); ++i)
+00102       if ( !(*continuators[i])(_pop) ) 
+00103         bContinue = false;
+00104 
+00105     if (! bContinue)       // we're going to stop: lastCall, gentlemen
+00106       {
+00107         if (!sorted.empty())
+00108           {
+00109             for (i = 0; i < sorted.size(); ++i)
+00110               {
+00111                 sorted[i]->lastCall(sorted_pop);
+00112               }
+00113           }
+00114         for (i = 0; i < stats.size(); ++i)
+00115           stats[i]->lastCall(_pop);
+00116 
+00117         for (i = 0; i < updaters.size(); ++i)
+00118           updaters[i]->lastCall();
+00119 
+00120         for (i = 0; i < monitors.size(); ++i)
+00121           monitors[i]->lastCall();
+00122       }
+00123     return bContinue;
+00124 }
+00125 
+00129 template <class EOT>
+00130 std::string eoCheckPoint<EOT>::allClassNames() const
+00131 {
+00132     unsigned i;
+00133     std::string s = "\n" + className() + "\n";
+00134 
+00135     s += "Sorted Stats\n";
+00136     for (i = 0; i < sorted.size(); ++i)
+00137         s += sorted[i]->className() + "\n";
+00138     s += "\n";
+00139 
+00140     s += "Stats\n";
+00141     for (i = 0; i < stats.size(); ++i)
+00142         s += stats[i]->className() + "\n";
+00143     s += "\n";
+00144 
+00145     s += "Updaters\n";
+00146     for (i = 0; i < updaters.size(); ++i)
+00147         s += updaters[i]->className() + "\n";
+00148     s += "\n";
+00149 
+00150     s += "Monitors\n";
+00151     for (i = 0; i < monitors.size(); ++i)
+00152         s += monitors[i]->className() + "\n";
+00153     s += "\n";
+00154 
+00155     s += "Continuators\n";
+00156     for (i = 0; i < continuators.size(); ++i)
+00157         s += continuators[i]->className() + "\n";
+00158     s += "\n";
+00159 
+00160     return s;
+00161 }
+00162 
+00163 #endif
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_clone_ops_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_clone_ops_8h-source.html new file mode 100644 index 000000000..51497828c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_clone_ops_8h-source.html @@ -0,0 +1,74 @@ + + +EO: eoCloneOps.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoCloneOps.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 //-----------------------------------------------------------------------------
+00003 // eoCloneOps.h
+00004 // (c) GeNeura Team, 1998
+00005 /* 
+00006     This library is free software; you can redistribute it and/or
+00007     modify it under the terms of the GNU Lesser General Public
+00008     License as published by the Free Software Foundation; either
+00009     version 2 of the License, or (at your option) any later version.
+00010 
+00011     This library is distributed in the hope that it will be useful,
+00012     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00013     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00014     Lesser General Public License for more details.
+00015 
+00016     You should have received a copy of the GNU Lesser General Public
+00017     License along with this library; if not, write to the Free Software
+00018     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00019 
+00020     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00021     CVS Info: $Date: 2003/02/27 19:26:09 $ $Header: /cvsroot/eodev/eo/src/eoCloneOps.h,v 1.2 2003/02/27 19:26:09 okoenig Exp $ $Author: okoenig $ 
+00022  */
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef _eoCloneOps_H
+00026 #define _eoCloneOps_H
+00027 
+00028 #include <eoOp.h>
+00029 
+00043 template <class EOT>
+00044 class eoMonCloneOp: public eoMonOp<EOT>
+00045 {
+00046 public:
+00048   eoMonCloneOp() : eoMonOp<EOT>() {}
+00049   virtual std::string className() const {return "eoMonCloneOp";}
+00050   virtual bool operator()(EOT&){return false;}
+00051 };
+00052 
+00053 
+00056 template<class EOT>
+00057 class eoBinCloneOp: public eoBinOp<EOT>
+00058 {
+00059 public:
+00061   eoBinCloneOp() : eoBinOp<EOT>() {}
+00062   virtual std::string className() const {return "eoBinCloneOp";}
+00063   virtual bool operator()(EOT&, const EOT&){return false;}
+00064 };
+00065 
+00068 template<class EOT>
+00069 class eoQuadCloneOp: public eoQuadOp<EOT>
+00070 {
+00071 public:
+00073   eoQuadCloneOp():eoQuadOp<EOT>() {}
+00074   virtual std::string className() const {return "eoQuadCloneOp";}
+00075 virtual bool operator()(EOT& , EOT& ) {return false;}
+00076 };
+00077 
+00078 #endif
+00079 
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_combined_continue_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_combined_continue_8h-source.html new file mode 100644 index 000000000..d8fa0aec6 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_combined_continue_8h-source.html @@ -0,0 +1,89 @@ + + +EO: eoCombinedContinue.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoCombinedContinue.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoCombinedContinue.h
+00005 // (c) Maarten Keijzer, GeNeura Team, 1999, 2000
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022  */
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef _eoCombinedContinue_h
+00026 #define _eoCombinedContinue_h
+00027 
+00028 #include <eoContinue.h>
+00029 
+00041 template< class EOT>
+00042 class eoCombinedContinue: public eoContinue<EOT> {
+00043 public:
+00044 
+00046   typedef typename EOT::Fitness FitnessType;
+00047 
+00049   eoCombinedContinue( eoContinue<EOT>& _cont)
+00050     : eoContinue<EOT> ()
+00051   {
+00052     continuators.push_back(&_cont);
+00053   }
+00054 
+00056   eoCombinedContinue( eoContinue<EOT>& _cont1, eoContinue<EOT>& _cont2)
+00057     : eoContinue<EOT> ()
+00058   {
+00059     continuators.push_back(&_cont1);
+00060     continuators.push_back(&_cont2);
+00061   }
+00062 
+00063   void add(eoContinue<EOT> & _cont)
+00064   {
+00065     continuators.push_back(&_cont);
+00066   }
+00067 
+00069   void removeLast(void)
+00070   {
+00071     continuators.pop_back();
+00072   }
+00074 
+00075 
+00078   virtual bool operator() ( const eoPop<EOT>& _pop )
+00079   {
+00080     for (unsigned i = 0; i < continuators.size(); ++i)
+00081       if ( !(*continuators[i])(_pop) ) return false;
+00082     return true;
+00083   }
+00084 
+00085   virtual std::string className(void) const { return "eoCombinedContinue"; }
+00086 
+00087 private:
+00088   std::vector<eoContinue<EOT>*>    continuators;
+00089 };
+00090 
+00091 #endif
+00092 
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_combined_init_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_combined_init_8h-source.html new file mode 100644 index 000000000..ab99a7a97 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_combined_init_8h-source.html @@ -0,0 +1,91 @@ + + +EO: eoCombinedInit.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoCombinedInit.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoCombinedInit.h
+00005 // (c) Maarten Keijzer, GeNeura Team, Marc Schoenauer 2004
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: Marc.Schoenauer@inria.fr
+00022  */
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef _eoCombinedInit_h
+00026 #define _eoCombinedInit_h
+00027 
+00028 #include <eoInit.h>
+00029 
+00034 template< class EOT>
+00035 class eoCombinedInit: public eoInit<EOT> {
+00036 public:
+00037 
+00039   eoCombinedInit( eoInit<EOT>& _init, double _rate)
+00040     : eoInit<EOT> ()
+00041   {
+00042     initializers.push_back(&_init);
+00043     rates.push_back(_rate);
+00044   }
+00045 
+00050   void add(eoInit<EOT> & _init, double _rate, bool _verbose=false)
+00051   {
+00052     initializers.push_back(&_init);
+00053     rates.push_back(_rate);
+00054     // compute the relative rates in percent - to warn the user!
+00055     if (_verbose)
+00056       printOn(std::cout);
+00057   }
+00058 
+00060   virtual void printOn(std::ostream & _os)
+00061   {
+00062     double total = 0;
+00063     unsigned i;
+00064     for (i=0; i<initializers.size(); i++)
+00065       total += rates[i];
+00066     _os << "In " << className() << "\n" ;
+00067     for (i=0; i<initializers.size(); i++)
+00068       _os << initializers[i]->className() << " with rate " << 100*rates[i]/total << " %\n";
+00069   }
+00070 
+00074   virtual void operator() ( EOT & _eo )
+00075   {
+00076     unsigned what = rng.roulette_wheel(rates); // choose one op
+00077     (*initializers[what])(_eo);            // apply it
+00078     return;
+00079   }
+00080 
+00081   virtual std::string className(void) const { return "eoCombinedInit"; }
+00082 
+00083 private:
+00084 std::vector<eoInit<EOT>*> initializers;
+00085 std::vector<double> rates;
+00086 };
+00087 
+00088 #endif
+00089 
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_continue_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_continue_8h-source.html new file mode 100644 index 000000000..7dcab71b6 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_continue_8h-source.html @@ -0,0 +1,65 @@ + + +EO: eoContinue.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoContinue.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoContinue.h
+00005 // (c) Maarten Keijzer, Geneura Team, 1999, 2000
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022  */
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef _eoContinue_h
+00026 #define _eoContinue_h
+00027 
+00028 #include <eoFunctor.h>
+00029 #include <eoPop.h>
+00030 #include <eoPersistent.h>
+00031 
+00036 template< class EOT>
+00037 class eoContinue : public eoUF<const eoPop<EOT>&, bool>, public eoPersistent 
+00038 {
+00039 public:
+00040   virtual std::string className(void) const { return "eoContinue"; }
+00041 
+00042   void readFrom (std :: istream & __is) {
+00043     
+00044     /* It should be implemented by subclasses ! */
+00045   }
+00046   
+00047   void printOn (std :: ostream & __os) const {
+00048     
+00049     /* It should be implemented by subclasses ! */
+00050   }
+00051 };
+00052 
+00053 #endif
+00054 
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_counter_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_counter_8h-source.html new file mode 100644 index 000000000..81e3ce5a1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_counter_8h-source.html @@ -0,0 +1,142 @@ + + +EO: eoCounter.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoCounter.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoCounter.h
+00005 // (c) Maarten Keijzer 2000
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              mak@dhi.dk
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _eoCounter_h
+00027 #define _eoCounter_h
+00028 
+00029 #include <eoFunctor.h>
+00030 #include <eoFunctorStore.h>
+00031 #include <utils/eoParam.h>
+00032 
+00040 template <class Procedure>
+00041 class eoProcedureCounter : public Procedure, public eoValueParam<unsigned long>
+00042 {
+00043     public:
+00044 
+00045         eoProcedureCounter(Procedure& _proc, std::string _name = "proc_counter") 
+00046             : eoValueParam<unsigned long>(0, _name), proc(_proc) {}
+00047 
+00064         typename Procedure::result_type operator()(void)
+00065         {
+00066             value()++;
+00067 #ifdef _MSC_VER
+00068             proc();
+00069 #else
+00070             return proc();
+00071 #endif
+00072         }
+00073 
+00074     private :
+00075 
+00076         Procedure& proc;
+00077 };
+00078 
+00094 template <class UnaryFunctor>
+00095 class eoUnaryFunctorCounter : public UnaryFunctor, public eoValueParam<unsigned long>
+00096 {
+00097     public:
+00098         eoUnaryFunctorCounter(UnaryFunctor& _func, std::string _name = "uf_counter") 
+00099             : eoValueParam<unsigned long>(0, _name), func(_func) {}
+00100         
+00117         typename UnaryFunctor::result_type operator()
+00118             (typename UnaryFunctor::first_argument_type _arg1)
+00119         {
+00120             value()++;
+00121 #ifdef _MSC_VER
+00122             func(_arg1);
+00123 #else
+00124             return func(_arg1);
+00125 #endif
+00126         }
+00127 
+00128     private :
+00129 
+00130         UnaryFunctor& func;
+00131 };
+00132 
+00141 template <class BinaryFunctor>
+00142 class eoBinaryFunctorCounter : public BinaryFunctor, public eoValueParam<unsigned long>
+00143 {
+00144     public:
+00145         eoBinaryFunctorCounter(BinaryFunctor& _func, std::string _name = "proc_counter") 
+00146             : eoValueParam<unsigned long>(0, _name), func(_func) {}
+00147 
+00165         typename BinaryFunctor::result_type operator()
+00166             (typename BinaryFunctor::first_argument_type _arg1, 
+00167              typename BinaryFunctor::second_argument_type _arg2)
+00168         {
+00169             value()++;
+00170 #ifdef _MSC_VER
+00171             func(_arg1, _arg2);
+00172 #else
+00173             return func(_arg1, _arg2);
+00174 #endif
+00175   }
+00176 
+00177     private :
+00178 
+00179         BinaryFunctor& func;
+00180 };
+00181 
+00195 template <class Procedure>
+00196 eoProcedureCounter<Procedure>& make_counter(eoFunctorBase::procedure_tag, Procedure& _proc, eoFunctorStore& store, std::string _name = "proc_counter")
+00197 {
+00198     eoProcedureCounter<Procedure>* result = new eoProcedureCounter<Procedure>(_proc, _name);
+00199     store.storeFunctor(result);
+00200     return *result;
+00201 }
+00202 
+00203 template <class UnaryFunctor>
+00204 eoUnaryFunctorCounter<UnaryFunctor>& make_counter(eoFunctorBase::unary_function_tag, UnaryFunctor& _proc, eoFunctorStore& store, std::string _name = "uf_counter")
+00205 {
+00206     eoUnaryFunctorCounter<UnaryFunctor>* result = new eoUnaryFunctorCounter<UnaryFunctor>(_proc, _name);
+00207     store.storeFunctor(result);
+00208     return *result;
+00209 }
+00210 
+00211 template <class BinaryFunctor>
+00212 eoBinaryFunctorCounter<BinaryFunctor>& make_counter(eoFunctorBase::binary_function_tag, BinaryFunctor& _proc, eoFunctorStore& store, std::string _name = "uf_counter")
+00213 {
+00214     eoBinaryFunctorCounter<BinaryFunctor>* result = new eoBinaryFunctorCounter<BinaryFunctor>(_proc, _name);
+00215     store.storeFunctor(result);
+00216     return *result;
+00217 }
+00218 
+00219 #endif
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_ctrl_c_continue_8cpp-source.html b/trunk/paradiseo-eo/doc/html/eo_ctrl_c_continue_8cpp-source.html new file mode 100644 index 000000000..581d2cfa6 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_ctrl_c_continue_8cpp-source.html @@ -0,0 +1,65 @@ + + +EO: eoCtrlCContinue.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoCtrlCContinue.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002  
+00003 //-----------------------------------------------------------------------------
+00004 // eoCtrlCContinue.cpp
+00005 // (c) EEAAX 1996 - GeNeura Team, 1998 - Maarten Keijzer 2000 
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011  
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016  
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020  
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mak@dhi.dk
+00024 */
+00025 //-----------------------------------------------------------------------------
+00026 #ifdef _MSC_VER
+00027 // to avoid long name warnings
+00028 #pragma warning(disable:4786)
+00029 #endif 
+00030 
+00031 #include <signal.h>
+00032 #include <iostream>
+00033 
+00034 // --- Global variables - but don't know what else to do - MS ---
+00035 bool     arret_demande = false;
+00036 bool     existCtrlCContinue = false;
+00037 
+00038 //
+00039 // The signal handler - installed in the eoCtrlCContinue Ctor
+00040 //
+00041 void signal_handler( int sig )
+00042 // ---------------------------
+00043 {
+00044     // --- On veut la paix, jusqu'a la fin ---
+00045     signal( SIGINT, SIG_IGN );
+00046     signal( SIGQUIT, SIG_IGN );
+00047     std::cerr << "Ctrl C entered ... closing down" << std::endl ;
+00048     arret_demande = true;
+00049 }
+00050 
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_ctrl_c_continue_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_ctrl_c_continue_8h-source.html new file mode 100644 index 000000000..469965e33 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_ctrl_c_continue_8h-source.html @@ -0,0 +1,85 @@ + + +EO: eoCtrlCContinue.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoCtrlCContinue.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002  
+00003 //-----------------------------------------------------------------------------
+00004 // eoCtrlCContinue.h
+00005 // (c) EEAAX 1996 - GeNeura Team, 1998 - Maarten Keijzer 2000 
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011  
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016  
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020  
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mak@dhi.dk
+00024 */
+00025 //-----------------------------------------------------------------------------
+00026 // the same thing can probably be done in MS environement, but I hoave no way
+00027 // to test it so at the moment it is commented out when in MSVC
+00028 #ifndef _MSC_VER
+00029 
+00030 #ifndef eoCtrlCContinue_h
+00031 #define eoCtrlCContinue_h
+00032 
+00033 #include <signal.h>
+00034 #include <eoContinue.h>
+00035 
+00036 extern bool arret_demande, existCtrlCContinue;
+00037 
+00038 extern void signal_handler( int sig );
+00039 
+00040 
+00044 template< class EOT>
+00045 class eoCtrlCContinue: public eoContinue<EOT>
+00046 {
+00047 public:
+00048  
+00050   eoCtrlCContinue()
+00051   {
+00052     // First checks that no other eoCtrlCContinue does exist
+00053     if (existCtrlCContinue)
+00054       throw std::runtime_error("A signal handler for Ctrl C is already defined!\n");
+00055     signal( SIGINT, signal_handler );
+00056     signal( SIGQUIT, signal_handler );
+00057     existCtrlCContinue = true;
+00058   }
+00059  
+00062   virtual bool operator() ( const eoPop<EOT>& _vEO ) 
+00063   {
+00064     if (arret_demande)
+00065       return false;
+00066     return true;
+00067   }
+00068 
+00069   virtual std::string className(void) const { return "eoCtrlCContinue"; }
+00070 };
+00071 
+00072 
+00073 #endif
+00074 
+00075 #endif
+00076  // of MSVC comment-out
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_data_8cpp-source.html b/trunk/paradiseo-eo/doc/html/eo_data_8cpp-source.html new file mode 100644 index 000000000..32bf604c8 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_data_8cpp-source.html @@ -0,0 +1,26 @@ + + +EO: eoData.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoData.cpp

00001 // Copyright (C) 2005 Jochen Küpper <jochen@fhi-berlin.mpg.de>
+00002 
+00003 
+00004 #include "eoData.h"
+00005 
+00006 
+00007 
+00008 // Local Variables:
+00009 // c-file-style: "Stroustrup"
+00010 // fill-column: 80
+00011 // End:
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_data_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_data_8h-source.html new file mode 100644 index 000000000..288996984 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_data_8h-source.html @@ -0,0 +1,45 @@ + + +EO: eoData.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoData.h

00001 
+00024 #ifndef EODATA_H
+00025 #define EODATA_H
+00026 
+00027 #ifndef _MSC_VER
+00028 #include <math.h>
+00029 #define _isnan isnan
+00030 #endif
+00031 
+00032 
+00033 //-----------------------------------------------------------------------------
+00034 // some defines to make things easier to get at first sight
+00035 
+00036 // tuning the amount of output using a boolean argument:
+00037 // true should always mean more output
+00038 #define eo_verbose true
+00039 #define eo_no_verbose false
+00040 // to be used in selection / replacement procedures to indicate whether
+00041 // the argument (rate, a double) shoudl be treated as a rate (number=rate*popSize)
+00042 // or as an absolute integer (number=rate regardless of popsize).
+00043 // the default value shoudl ALWAYS be true (eo_as_a_rate).
+00044 //
+00045 // this construct is mandatory because in some cases you might not know the
+00046 // population size that will enter the replacement for instance - so you
+00047 // cannot simply have a pre-computed (double) rate of 1/popSize
+00048 #define eo_is_a_rate true
+00049 #define eo_is_an_integer false
+00050 
+00051 #endif
+00052 
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_det_select_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_det_select_8h-source.html new file mode 100644 index 000000000..f17c7fd49 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_det_select_8h-source.html @@ -0,0 +1,66 @@ + + +EO: eoDetSelect.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoDetSelect.h

00001 
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoDetSelect_h
+00028 #define _eoDetSelect_h
+00029 
+00030 
+00031 //-----------------------------------------------------------------------------
+00032 #include <eoSelect.h>
+00033 #include <utils/eoHowMany.h>
+00034 #include <math.h>
+00035 //-----------------------------------------------------------------------------
+00036 
+00039 template<class EOT>
+00040 class eoDetSelect : public eoSelect<EOT>
+00041 {
+00042  public:
+00044      eoDetSelect(double _rate = 1.0, bool _interpret_as_rate = true)
+00045          : howMany(_rate, _interpret_as_rate)  {}
+00046 
+00053   virtual void operator()(const eoPop<EOT>& _source, eoPop<EOT>& _dest)
+00054   {
+00055     unsigned int pSize = _source.size();
+00056     size_t target = howMany(pSize);
+00057 
+00058     _dest.resize(target);
+00059 
+00060     unsigned remain = target % pSize;
+00061     unsigned entireCopy = target / pSize;
+00062     typename eoPop<EOT>::iterator it = _dest.begin();
+00063     
+00064     if (target >= pSize)
+00065       {
+00066         for (unsigned i=0; i<entireCopy; i++)
+00067           {
+00068               std::copy(_source.begin(), _source.end(), it);
+00069             it += pSize;
+00070           }
+00071       }
+00072     // the last ones
+00073     if (remain) 
+00074       {
+00075           std::copy(_source.begin(), _source.begin()+remain, it);
+00076       }
+00077   }
+00078   
+00079 private :
+00080   eoHowMany howMany;
+00081 };
+00082 
+00083 #endif
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_det_tournament_select_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_det_tournament_select_8h-source.html new file mode 100644 index 000000000..e54b9316d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_det_tournament_select_8h-source.html @@ -0,0 +1,85 @@ + + +EO: eoDetTournamentSelect.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoDetTournamentSelect.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoDetTournament.h
+00005 // (c) GeNeura Team, 1998 - EEAAX 1999
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef eoDetTournament_h
+00027 #define eoDetTournament_h
+00028 
+00029 //-----------------------------------------------------------------------------
+00030 
+00031 #include <functional>  // 
+00032 #include <numeric>     // accumulate
+00033 
+00034 #include <eoFunctor.h>
+00035 #include <eoPop.h>
+00036 #include <utils/selectors.h>
+00037 
+00038 //-----------------------------------------------------------------------------
+00042 //-----------------------------------------------------------------------------
+00043 
+00044 template <class EOT> class eoDetTournamentSelect: public eoSelectOne<EOT>
+00045 {
+00046  public:
+00047   /* (Default) Constructor - 
+00048      @param _tSize tournament size
+00049   */
+00050   eoDetTournamentSelect(unsigned _tSize = 2 ):eoSelectOne<EOT>(), tSize(_tSize) {
+00051     // consistency check
+00052     if (tSize < 2) {
+00053       std::cout << "Warning, Tournament size should be >= 2\nAdjusted to 2\n";
+00054       tSize = 2;
+00055     }
+00056   }
+00057   
+00058   /* Perform deterministic tournament calling the appropriate fn 
+00059      see selectors.h
+00060   */
+00061   virtual const EOT& operator()(const eoPop<EOT>& _pop) 
+00062   {
+00063       return deterministic_tournament(_pop, tSize);
+00064   }
+00065   
+00066  private:
+00067   unsigned tSize;
+00068 };
+00069 
+00070 //-----------------------------------------------------------------------------
+00071 
+00072 #endif
+00073 
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_distance_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_distance_8h-source.html new file mode 100644 index 000000000..348276261 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_distance_8h-source.html @@ -0,0 +1,99 @@ + + +EO: eoDistance.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoDistance.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoDistance.h
+00005 // (c) GeNeura Team, 1998, Marc Schoenauer 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _eoDistance_H
+00027 #define _eoDistance_H
+00028 
+00029 #include <eoFunctor.h>
+00034 template< class EOT >
+00035 class eoDistance : public eoBF<const EOT &, const EOT &, double>
+00036 {};
+00037 
+00038 
+00043 template< class EOT >
+00044 class eoQuadDistance : public eoDistance<EOT>
+00045 {
+00046 public:
+00047   double operator()(const EOT & _v1, const EOT & _v2)
+00048   {
+00049      double sum=0.0;
+00050     for (unsigned i=0; i<_v1.size(); i++)
+00051       {
+00052         double r = static_cast<double> (_v1[i]) - static_cast<double> (_v2[i]);
+00053         sum += r*r;
+00054       }
+00055     return sqrt(sum);
+00056   }
+00057 };
+00058 
+00065 template< class EOT >
+00066 class eoHammingDistance : public eoDistance<EOT>
+00067 {
+00068 public:
+00069   double operator()(const EOT & _v1, const EOT & _v2)
+00070   {
+00071      double sum=0.0;
+00072     for (unsigned i=0; i<_v1.size(); i++)
+00073       {
+00074         double r = static_cast<double> (_v1[i]) - static_cast<double> (_v2[i]);
+00075         sum += fabs(r);
+00076       }
+00077     return sum;
+00078   }
+00079 };
+00080 
+00081 /* this distance measures the difference in fitness 
+00082  * I am not sure it can be of any use, though ... 
+00083  * except for some testing
+00084  */
+00085 template< class EOT >
+00086 class eoFitnessDistance : public eoDistance<EOT>
+00087 {
+00088 public:
+00089   double operator()(const EOT & _v1, const EOT & _v2)
+00090   {
+00091     double d = _v1.fitness() - _v2.fitness();
+00092     return sqrt(d*d);
+00093   }
+00094 };
+00095 
+00096 
+00097         
+00098 #endif
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_distrib_updater_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_distrib_updater_8h-source.html new file mode 100644 index 000000000..0a3831038 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_distrib_updater_8h-source.html @@ -0,0 +1,57 @@ + + +EO: eoDistribUpdater.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoDistribUpdater.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoDistribUpdater.h
+00005 // (c) Marc Schoenauer, Maarten Keijzer, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: Marc.Schoenauer@polytechnique.fr
+00022              mkeijzer@dhi.dk
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _eoDistribUpdater_H
+00027 #define _eoDistribUpdater_H
+00028 
+00029 #include <algorithm>
+00030 
+00031 #include <eoDistribution.h>
+00032 #include <eoPop.h>
+00033 
+00042 template <class EOT>
+00043 class eoDistribUpdater :  
+00044   public eoBF<eoDistribution<EOT> &, eoPop<EOT> &, void>
+00045 {
+00046 public:
+00047   virtual void operator()(eoDistribution<EOT> &, eoPop<EOT> &)=0;
+00048 };
+00049 
+00050 #endif
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_distribution_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_distribution_8h-source.html new file mode 100644 index 000000000..75147ecf1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_distribution_8h-source.html @@ -0,0 +1,57 @@ + + +EO: eoDistribution.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoDistribution.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoDistribution.h
+00005 // (c) Marc Schoenauer, Maarten Keijzer, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: Marc.Schoenauer@polytechnique.fr
+00022              mkeijzer@dhi.dk
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _eoDistribution_H
+00027 #define _eoDistribution_H
+00028 
+00029 #include <algorithm>
+00030 
+00031 #include <eoInit.h>
+00032 #include <eoPop.h>
+00033 
+00044 template <class EOT>
+00045 class eoDistribution :  public eoInit<EOT>, 
+00046                         public eoPersistent, public eoObject
+00047 {
+00048 public:
+00049   virtual void operator()(EOT &) = 0; // DO NOT FORGET TO INVALIDATE the EOT
+00050 };
+00051 
+00052 #endif
+
Generated on Thu Oct 19 05:06:34 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_dominance_map_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_dominance_map_8h-source.html new file mode 100644 index 000000000..2074e17cf --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_dominance_map_8h-source.html @@ -0,0 +1,119 @@ + + +EO: eoDominanceMap.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoDominanceMap.h

00001 
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef eoDominanceMap_h
+00028 #define eoDominanceMap_h
+00029 
+00030 #include <eoFunctor.h>
+00031 #include <eoPop.h>
+00032 
+00046 template <class EoType>
+00047 class eoDominanceMap : public eoUF<const eoPop<EoType>&, void>, public std::vector<std::vector<bool> >
+00048 {
+00049 public:
+00050 
+00052     void clear() {
+00053         std::vector<std::vector<bool> >::clear();
+00054         fitness.clear();
+00055     }
+00056 
+00060   void operator()(const eoPop<EoType>& _pop)
+00061   {
+00062     setup(_pop);
+00063     return;
+00064   }
+00065 
+00069   void remove(unsigned i)
+00070   {
+00071     for (unsigned j = 0; j < size(); ++j)
+00072     {
+00073       operator[](i)[j] = false; // clear row
+00074       operator[](j)[i] = false; // clear col
+00075     }
+00076   }
+00077 
+00081   void setup(const eoPop<EoType>& _pop)
+00082   {
+00083     fitness.resize(_pop.size());
+00084     resize(_pop.size());
+00085 
+00086     for (unsigned i = 0; i < _pop.size(); ++i)
+00087     {
+00088       fitness[i] = _pop[i].fitness();
+00089       operator[](i).resize(_pop.size(), false);
+00090 
+00091       for (unsigned j = 0; j < i; ++j)
+00092       {
+00093         if (_pop[i].fitness().dominates(_pop[j].fitness()))
+00094         {
+00095           operator[](i)[j] = true;
+00096           operator[](j)[i] = false;
+00097         }
+00098         else if (_pop[j].fitness().dominates(_pop[i].fitness()))
+00099         {
+00100           operator[](i)[j] = false;
+00101           operator[](j)[i] = true;
+00102         }
+00103         else
+00104         {
+00105           operator[](i)[j] = false;
+00106           operator[](j)[i] = false;
+00107         }
+00108       }
+00109     }
+00110   }
+00111 
+00118   std::vector<double> sum_dominators() const
+00119   {
+00120     std::vector<double> result(size(), 0.0);
+00121 
+00122     for (unsigned i = 0; i < size(); ++i)
+00123     {
+00124       for (unsigned j = 0; j < size(); ++j)
+00125       {
+00126         if (operator[](i)[j]) // i dominates j
+00127           result[j]++;
+00128       }
+00129     }
+00130 
+00131     return result;
+00132   }
+00133 
+00140   std::vector<double> sum_dominants() const
+00141   {
+00142     std::vector<double> result(size(), 0.0);
+00143 
+00144     for (unsigned i = 0; i < size(); ++i)
+00145     {
+00146       for (unsigned j = 0; j < size(); ++j)
+00147       {
+00148         if (operator[](i)[j]) // i dominates j
+00149           result[i]++;
+00150       }
+00151     }
+00152 
+00153     return result;
+00154   }
+00155 
+00156   private :
+00157 
+00158 
+00159   std::vector<typename EoType::Fitness> fitness;
+00160 };
+00161 
+00162 #endif
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_drawable_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_drawable_8h-source.html new file mode 100644 index 000000000..83b24cd2f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_drawable_8h-source.html @@ -0,0 +1,66 @@ + + +EO: eoDrawable.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib
+

eoDrawable.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoDrawable.h
+00005 // (c) GeNeura Team, 1999
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022  */
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef EODRAWABLE_H
+00026 #define EODRAWABLE_H
+00027 
+00028 //-----------------------------------------------------------------------------
+00029 
+00030 using namespace std;
+00031 
+00032 //-----------------------------------------------------------------------------
+00033 // eoDrawable
+00034 //-----------------------------------------------------------------------------
+00035 
+00043 template <class Object>
+00044 class eoDrawable
+00045 {
+00046  public:
+00048         eoDrawable( const Object& _o): Object( _o ){};
+00049 
+00051         eoDrawable( const eoDrawable& _d): Object( _d ){};
+00052 
+00054   virtual ~eoDrawable() {};
+00055   
+00056 
+00060   virtual void draw( unsigned _x, unsigned _y) = 0;
+00061         
+00062 };
+00063 
+00064 #endif EODRAWABLE_H
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_e_d_a_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_e_d_a_8h-source.html new file mode 100644 index 000000000..87ce98b25 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_e_d_a_8h-source.html @@ -0,0 +1,53 @@ + + +EO: eoEDA.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoEDA.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoEDA.h
+00005 // (c) Marc Schoenauer, Maarten Keijzer, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: Marc.Schoenauer@polytechnique.fr
+00022              mkeijzer@dhi.dk
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _eoEDA_h
+00027 #define _eoEDA_h
+00028 
+00029 //-----------------------------------------------------------------------------
+00030 
+00031 #include <eoDistribution.h>
+00032 
+00041 template<class EOT> class eoEDA: public eoUF<eoDistribution<EOT>&, void>
+00042 {
+00043 };
+00044 
+00045 #endif
+00046 
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_easy_e_a_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_easy_e_a_8h-source.html new file mode 100644 index 000000000..370084ec9 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_easy_e_a_8h-source.html @@ -0,0 +1,236 @@ + + +EO: eoEasyEA.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoEasyEA.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoEasyEA.h
+00005 // (c) GeNeura Team, 1998
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022  */
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef _eoEasyEA_h
+00026 #define _eoEasyEA_h
+00027 
+00028 //-----------------------------------------------------------------------------
+00029 
+00030 #include <apply.h>
+00031 #include <eoAlgo.h>
+00032 #include <eoPopAlgo.h>
+00033 #include <eoPopEvalFunc.h>
+00034 #include <eoContinue.h>
+00035 #include <eoSelect.h>
+00036 #include <eoTransform.h>
+00037 #include <eoBreed.h>
+00038 #include <eoMergeReduce.h>
+00039 #include <eoReplacement.h>
+00040 
+00041 
+00042 
+00043 template <class EOT> class eoIslandsEasyEA ;
+00044 
+00045 template <class EOT> class eoDistEvalEasyEA ;
+00046 
+00063 template<class EOT> class eoEasyEA: public eoAlgo<EOT> {
+00064 public:
+00065 
+00067      eoEasyEA(
+00068          eoContinue<EOT>& _continuator,
+00069          eoEvalFunc<EOT>& _eval,
+00070          eoBreed<EOT>& _breed,
+00071          eoReplacement<EOT>& _replace
+00072      ) : continuator(_continuator),
+00073          eval (_eval),
+00074          loopEval(_eval),
+00075          popEval(loopEval),
+00076          selectTransform(dummySelect, dummyTransform),
+00077          breed(_breed),
+00078          mergeReduce(dummyMerge, dummyReduce),
+00079          replace(_replace)
+00080          {}
+00081 
+00082   /*
+00083   eoEasyEA(eoContinue <EOT> & _continuator,
+00084            eoPopEvalFunc <EOT> & _pop_eval,
+00085            eoBreed <EOT> & _breed,
+00086            eoReplacement <EOT> & _replace
+00087            ) :
+00088     continuator (_continuator),
+00089     eval (dummyEval),
+00090     loopEval(dummyEval),
+00091     popEval (_pop_eval),
+00092     selectTransform (dummySelect, dummyTransform),
+00093     breed (_breed),
+00094     mergeReduce (dummyMerge, dummyReduce),
+00095     replace (_replace) {
+00096 
+00097   }
+00098   */
+00099 
+00101      eoEasyEA(
+00102          eoContinue<EOT>& _continuator,
+00103          eoPopEvalFunc<EOT>& _eval,
+00104          eoBreed<EOT>& _breed,
+00105          eoReplacement<EOT>& _replace
+00106      ) : continuator(_continuator),
+00107          eval (dummyEval),
+00108          loopEval(dummyEval),
+00109          popEval(_eval),
+00110          selectTransform(dummySelect, dummyTransform),
+00111          breed(_breed),
+00112          mergeReduce(dummyMerge, dummyReduce),
+00113          replace(_replace)
+00114          {}
+00115 
+00117     eoEasyEA(
+00118          eoContinue<EOT>& _continuator,
+00119          eoEvalFunc<EOT>& _eval,
+00120          eoBreed<EOT>& _breed,
+00121          eoMerge<EOT>& _merge,
+00122          eoReduce<EOT>& _reduce
+00123      ) : continuator(_continuator),
+00124          eval (_eval),
+00125          loopEval(_eval),
+00126          popEval(loopEval),
+00127          selectTransform(dummySelect, dummyTransform),
+00128          breed(_breed),
+00129          mergeReduce(_merge, _reduce),
+00130          replace(mergeReduce)
+00131          {}
+00132 
+00134     eoEasyEA(
+00135          eoContinue<EOT>& _continuator,
+00136          eoEvalFunc<EOT>& _eval,
+00137          eoSelect<EOT>& _select,
+00138          eoTransform<EOT>& _transform,
+00139          eoReplacement<EOT>& _replace
+00140      ) : continuator(_continuator),
+00141          eval (_eval),
+00142          loopEval(_eval),
+00143          popEval(loopEval),
+00144          selectTransform(_select, _transform),
+00145          breed(selectTransform),
+00146          mergeReduce(dummyMerge, dummyReduce),
+00147          replace(_replace)
+00148          {}
+00149 
+00151      eoEasyEA(
+00152          eoContinue<EOT>& _continuator,
+00153          eoEvalFunc<EOT>& _eval,
+00154          eoSelect<EOT>& _select,
+00155          eoTransform<EOT>& _transform,
+00156          eoMerge<EOT>&     _merge,
+00157          eoReduce<EOT>&    _reduce
+00158      ) : continuator(_continuator),
+00159          eval (_eval),
+00160          loopEval(_eval),
+00161          popEval(loopEval),
+00162          selectTransform(_select, _transform),
+00163          breed(selectTransform),
+00164          mergeReduce(_merge, _reduce),
+00165          replace(mergeReduce)
+00166          {}
+00167 
+00168 
+00169 
+00170 
+00172   virtual void operator()(eoPop<EOT>& _pop)
+00173   {
+00174     eoPop<EOT> offspring, empty_pop;
+00175     popEval(empty_pop, _pop); // A first eval of pop.
+00176     do
+00177     {
+00178       try
+00179       {
+00180          unsigned pSize = _pop.size();
+00181          offspring.clear(); // new offspring
+00182 
+00183          breed(_pop, offspring);
+00184 
+00185          popEval(_pop, offspring); // eval of parents + offspring if necessary
+00186 
+00187          replace(_pop, offspring); // after replace, the new pop. is in _pop
+00188 
+00189          if (pSize > _pop.size())
+00190              throw std::runtime_error("Population shrinking!");
+00191          else if (pSize < _pop.size())
+00192              throw std::runtime_error("Population growing!");
+00193 
+00194       }
+00195       catch (std::exception& e)
+00196       {
+00197             std::string s = e.what();
+00198             s.append( " in eoEasyEA");
+00199             throw std::runtime_error( s );
+00200       }
+00201     } while ( continuator( _pop ) );
+00202   }
+00203 
+00204 protected :
+00205 
+00206   // If selectTransform needs not be used, dummySelect and dummyTransform are used
+00207   // to instantiate it.
+00208   class eoDummySelect : public eoSelect<EOT>
+00209      { public : void operator()(const eoPop<EOT>&, eoPop<EOT>&) {} } dummySelect;
+00210 
+00211      class eoDummyTransform : public eoTransform<EOT>
+00212      { public : void operator()(eoPop<EOT>&) {} } dummyTransform;
+00213 
+00214   class eoDummyEval : public eoEvalFunc<EOT>
+00215   {public: void operator()(EOT &) {} } dummyEval;
+00216 
+00217   eoContinue<EOT>&          continuator;
+00218 
+00219   eoEvalFunc <EOT> &        eval ;
+00220   eoPopLoopEval<EOT>        loopEval;
+00221 
+00222   eoPopEvalFunc<EOT>&       popEval;
+00223 
+00224   eoSelectTransform<EOT>    selectTransform;
+00225   eoBreed<EOT>&             breed;
+00226 
+00227   // If mergeReduce needs not be used, dummyMerge and dummyReduce are used
+00228   // to instantiate it.
+00229   eoNoElitism<EOT>          dummyMerge;
+00230   eoTruncate<EOT>           dummyReduce;
+00231 
+00232   eoMergeReduce<EOT>        mergeReduce;
+00233   eoReplacement<EOT>&       replace;
+00234 
+00235   // Friend classes
+00236   friend class eoIslandsEasyEA <EOT> ;
+00237   friend class eoDistEvalEasyEA <EOT> ;
+00238 };
+00239 
+00240 //-----------------------------------------------------------------------------
+00241 
+00242 #endif
+00243 
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_es_chrom_init_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_es_chrom_init_8h-source.html new file mode 100644 index 000000000..43f0d38a6 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_es_chrom_init_8h-source.html @@ -0,0 +1,160 @@ + + +EO: eoEsChromInit.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

eoEsChromInit.h

00001 //
+00002 /* (c) Maarten Keijzer 2000, GeNeura Team, 1998 - EEAAX 1999
+00003 
+00004 This library is free software; you can redistribute it and/or modify it under
+00005 the terms of the GNU Lesser General Public License as published by the Free
+00006 Software Foundation; either version 2 of the License, or (at your option) any
+00007 later version.
+00008 
+00009 This library is distributed in the hope that it will be useful, but WITHOUT ANY
+00010 WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+00011 PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
+00012 
+00013 You should have received a copy of the GNU Lesser General Public License along
+00014 with this library; if not, write to the Free Software Foundation, Inc., 59
+00015 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+00016 
+00017 Contact: http://eodev.sourceforge.net
+00018          todos@geneura.ugr.es, http://geneura.ugr.es
+00019          Marc.Schoenauer@polytechnique.fr
+00020          mak@dhi.dk
+00021  */
+00022 
+00023 
+00024 #ifndef _eoEsChromInit_H
+00025 #define _eoEsChromInit_H
+00026 
+00027 #include <cmath>
+00028 #include <vector>
+00029 
+00030 #include <es/eoRealInitBounded.h>
+00031 #include <es/eoEsSimple.h>
+00032 #include <es/eoEsStdev.h>
+00033 #include <es/eoEsFull.h>
+00034 
+00035 #ifndef M_PI
+00036 #define M_PI 3.1415926535897932384626433832795
+00037 #endif
+00038 
+00054 template <class EOT>
+00055 class eoEsChromInit : public eoRealInitBounded<EOT>
+00056 {
+00057 public:
+00058 
+00059     using eoRealInitBounded<EOT>::size;
+00060     using eoRealInitBounded<EOT>::theBounds;
+00061 
+00062     typedef typename EOT::Fitness FitT;
+00063 
+00071     eoEsChromInit(eoRealVectorBounds& _bounds, double _sigma = 0.3, bool _to_scale=false)
+00072         : eoRealInitBounded<EOT>(_bounds)
+00073         {
+00074             // a bit of pre-computations, to save time later (even if some are useless)
+00075             //
+00076             // first, in the case of one unique sigma
+00077             // sigma is scaled by the average range (if that means anything!)
+00078             if (_to_scale)
+00079             {
+00080                 double scaleUnique = 0;
+00081                 for (unsigned i=0; i<size(); i++)
+00082                     scaleUnique += theBounds().range(i);
+00083                 scaleUnique /= size();
+00084                 uniqueSigma = _sigma * scaleUnique;
+00085             }
+00086             else
+00087                 uniqueSigma = _sigma;
+00088             // now the case of a vector of sigmas first allocate space according
+00089             // to the size of the bounds (see eoRealInitBounded)
+00090             vecSigma.resize(size());
+00091             // each sigma is scaled by the range of the corresponding variable
+00092             for(unsigned i=0; i<size(); i++)
+00093                 if(_to_scale)
+00094                     vecSigma[i] = _sigma * theBounds().range(i);
+00095                 else
+00096                     vecSigma[i] = _sigma;
+00097         }
+00098 
+00099 
+00109     eoEsChromInit(eoRealVectorBounds& _bounds, std::vector<double> _vecSigma)
+00110         : eoRealInitBounded<EOT>(_bounds), uniqueSigma(_vecSigma[0]), vecSigma(_vecSigma)
+00111         {}
+00112 
+00113 
+00114     void operator()(EOT& _eo)
+00115         {
+00116             eoRealInitBounded<EOT>::operator()(_eo);
+00117             create_self_adapt(_eo);
+00118             _eo.invalidate();
+00119         }
+00120 
+00121 
+00122 private:
+00123 
+00128     void create_self_adapt(eoReal<FitT>&)
+00129         {}
+00130 
+00131 
+00132 
+00139     void create_self_adapt(eoEsSimple<FitT>& result)
+00140         {
+00141             // pre-computed in the Ctor
+00142             result.stdev = uniqueSigma;
+00143         }
+00144 
+00145 
+00146 
+00155     void create_self_adapt(eoEsStdev<FitT>& result)
+00156         {
+00157             // pre-computed in the constructor
+00158             result.stdevs = vecSigma;
+00159         }
+00160 
+00161 
+00162 
+00169     void create_self_adapt(eoEsFull<FitT>& result)
+00170         {
+00171             // first the stdevs (pre-computed in the Ctor)
+00172             result.stdevs = vecSigma;
+00173             unsigned int theSize = size();
+00174             // nb of rotation angles: N*(N-1)/2 (in general!)
+00175             result.correlations.resize(theSize*(theSize - 1) / 2);
+00176             for (unsigned i=0; i<result.correlations.size(); ++i)
+00177             {
+00178                 // uniform in [-PI, PI)
+00179                 result.correlations[i] = rng.uniform(2 * M_PI) - M_PI;
+00180             }
+00181         }
+00182 
+00183 
+00184 
+00186     double uniqueSigma;
+00187 
+00189     std::vector<double> vecSigma;
+00190 };
+00191 
+00192 #endif
+00193 
+00194 
+00195 
+00196 // Local Variables:
+00197 // coding: iso-8859-1
+00198 // mode:C++
+00199 // c-file-style: "Stroustrup"
+00200 // comment-column: 35
+00201 // fill-column: 80
+00202 // End:
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_es_full_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_es_full_8h-source.html new file mode 100644 index 000000000..2a3983c15 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_es_full_8h-source.html @@ -0,0 +1,93 @@ + + +EO: eoEsFull.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

eoEsFull.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoEsFull.h
+00005 // (c) GeNeura Team, 2000 - EEAAX 1999 - Maarten Keijzer 2000
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mak@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoEsFull_h
+00028 #define _eoEsFull_h
+00029 
+00030 #include <eoVector.h>
+00031 
+00039 template <class Fit>
+00040 class eoEsFull : public eoVector<Fit, double>
+00041 {
+00042 public:
+00043 
+00044     using eoVector<Fit, double>::size;
+00045 
+00046 
+00047     typedef double Type;
+00048 
+00049     eoEsFull(void) : eoVector<Fit, double>() {}
+00050 
+00051     virtual std::string className(void) const { return "eoEsFull"; }
+00052 
+00053     void printOn(std::ostream& os) const
+00054     {
+00055         eoVector<Fit,double>::printOn(os);
+00056         os << ' ';
+00057         std::copy(stdevs.begin(), stdevs.end(), std::ostream_iterator<double>(os, " "));
+00058         os << ' ';
+00059         std::copy(correlations.begin(), correlations.end(), std::ostream_iterator<double>(os, " "));
+00060         os << ' ';
+00061     }
+00062 
+00063     void readFrom(std::istream& is)
+00064     {
+00065         eoVector<Fit,double>::readFrom(is);
+00066 
+00067         stdevs.resize(size());
+00068 
+00069         unsigned i;
+00070         for (i = 0; i < size(); ++i)
+00071             is >> stdevs[i];
+00072 
+00073         correlations.resize(size()*(size() - 1) / 2);
+00074 
+00075         for (i = 0; i < correlations.size(); ++i)
+00076             is >> correlations[i];
+00077     }
+00078 
+00079     std::vector<double> stdevs;
+00080     std::vector<double> correlations;
+00081 };
+00082 
+00083 
+00084 
+00085 #endif
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_es_global_xover_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_es_global_xover_8h-source.html new file mode 100644 index 000000000..323070771 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_es_global_xover_8h-source.html @@ -0,0 +1,116 @@ + + +EO: eoEsGlobalXover.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

eoEsGlobalXover.h

00001 
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 
+00026 #ifndef _eoEsGlobalXover_H
+00027 #define _eoEsGlobalXover_H
+00028 
+00029 #include <utils/eoRNG.h>
+00030 
+00031 #include <es/eoEsSimple.h>
+00032 #include <es/eoEsStdev.h>
+00033 #include <es/eoEsFull.h>
+00034 
+00035 #include <eoGenOp.h>
+00036 // needs a selector - here random
+00037 #include <eoRandomSelect.h>
+00038 
+00043 template<class EOT>
+00044 class eoEsGlobalXover: public eoGenOp<EOT>
+00045 {
+00046 public:
+00047   typedef typename EOT::Fitness FitT;
+00048 
+00052   eoEsGlobalXover(eoBinOp<double> & _crossObj, eoBinOp<double> & _crossMut) :
+00053     crossObj(_crossObj), crossMut(_crossMut) {}
+00054 
+00056   virtual std::string className() const { return "eoEsGlobalXover"; }
+00057 
+00059   unsigned max_production(void) { return 1; }
+00060 
+00067   void apply(eoPopulator<EOT>& _plop)
+00068   {
+00069     // First, select as many parents as you will have offspring
+00070     EOT& parent = *_plop; // select the first parent
+00071 
+00072     // first, the object variables
+00073     for (unsigned i=0; i<parent.size(); i++)
+00074       {
+00075         // get extra parents - use private selector
+00076         // _plop.source() is the eoPop<EOT> used by _plop to get parents
+00077         const EOT& realParent1 = sel(_plop.source());
+00078         const EOT& realParent2 = sel(_plop.source());
+00079         parent[i] = realParent1[i];
+00080         crossObj(parent[i], realParent2[i]); // apply eoBinOp
+00081       }
+00082     // then the self-adaptation parameters
+00083     cross_self_adapt(parent, _plop.source());
+00084     // dont' forget to invalidate
+00085     parent.invalidate();
+00086   }
+00087 
+00088 private:
+00089 
+00094   void cross_self_adapt(eoEsSimple<FitT> & _parent, const eoPop<eoEsSimple<FitT> >& _pop)
+00095   {
+00096     const EOT& realParent1 = sel(_pop);
+00097     const EOT& realParent2 = sel(_pop);
+00098     _parent.stdev = realParent1.stdev;
+00099     crossMut(_parent.stdev, realParent2.stdev); // apply eoBinOp
+00100   }
+00101 
+00106   void cross_self_adapt(eoEsStdev<FitT> & _parent, const eoPop<eoEsStdev<FitT> >& _pop)
+00107   {
+00108     for (unsigned i=0; i<_parent.size(); i++)
+00109       {
+00110         const EOT& realParent1 = sel(_pop);
+00111         const EOT& realParent2 = sel(_pop);
+00112         _parent.stdevs[i] = realParent1.stdevs[i];
+00113         crossMut(_parent.stdevs[i], realParent2.stdevs[i]); // apply eoBinOp
+00114       }
+00115   }
+00116 
+00121   void cross_self_adapt(eoEsFull<FitT> & _parent, const eoPop<eoEsFull<FitT> >& _pop)
+00122   {
+00123     unsigned i;
+00124     // the StDev
+00125     for (i=0; i<_parent.size(); i++)
+00126       {
+00127         const EOT& realParent1 = sel(_pop);
+00128         const EOT& realParent2 = sel(_pop);
+00129         _parent.stdevs[i] = realParent1.stdevs[i];
+00130         crossMut(_parent.stdevs[i], realParent2.stdevs[i]); // apply eoBinOp
+00131       }
+00132     // the roataion angles
+00133     for (i=0; i<_parent.correlations.size(); i++)
+00134       {
+00135         const EOT& realParent1 = sel(_pop);
+00136         const EOT& realParent2 = sel(_pop);
+00137         _parent.correlations[i] = realParent1.correlations[i];
+00138         crossMut(_parent.correlations[i], realParent2.correlations[i]); // apply eoBinOp
+00139       }
+00140 
+00141   }
+00142 
+00143   // the data
+00144   eoRandomSelect<EOT> sel;
+00145   eoBinOp<double> & crossObj;
+00146   eoBinOp<double> & crossMut;
+00147 };
+00148 
+00149 #endif
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_es_mutate_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_es_mutate_8h-source.html new file mode 100644 index 000000000..99cd2882c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_es_mutate_8h-source.html @@ -0,0 +1,213 @@ + + +EO: eoEsMutate.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

eoEsMutate.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; fill-column: 80; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoESMute.h : ES mutation
+00005 // (c) Maarten Keijzer 2000 & GeNeura Team, 1998 for the EO part
+00006 //     Th. Baeck 1994 and EEAAX 1999 for the ES part
+00007 /*
+00008     This library is free software; you can redistribute it and/or
+00009     modify it under the terms of the GNU Lesser General Public
+00010     License as published by the Free Software Foundation; either
+00011     version 2 of the License, or (at your option) any later version.
+00012 
+00013     This library is distributed in the hope that it will be useful,
+00014     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00015     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00016     Lesser General Public License for more details.
+00017 
+00018     You should have received a copy of the GNU Lesser General Public
+00019     License along with this library; if not, write to the Free Software
+00020     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00021 
+00022     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00023              marc.schoenauer@polytechnique.fr
+00024                        http://eeaax.cmap.polytchnique.fr/
+00025  */
+00026 //-----------------------------------------------------------------------------
+00027 
+00028 
+00029 #ifndef _EOESMUTATE_H
+00030 #define _EOESMUTATE_H
+00031 
+00032 #include <cmath>
+00033 #include <eoInit.h>
+00034 #include <eoOp.h>
+00035 #include <es/eoEsMutationInit.h>
+00036 #include <es/eoEsSimple.h>
+00037 #include <es/eoEsStdev.h>
+00038 #include <es/eoEsFull.h>
+00039 #include <utils/eoRealBounds.h>
+00040 #include <utils/eoRNG.h>
+00041 
+00042 #ifndef M_PI
+00043 #define M_PI 3.1415926535897932384626433832795
+00044 #endif
+00045 
+00059 template <class EOT>
+00060 class eoEsMutate : public eoMonOp< EOT >
+00061 {
+00062 public:
+00063 
+00065     typedef typename EOT::Fitness FitT;
+00066 
+00067 
+00074     eoEsMutate(eoEsMutationInit& _init, eoRealVectorBounds& _bounds) : bounds(_bounds)
+00075     {
+00076         init(EOT(), _init); // initialize on actual type used
+00077     }
+00078 
+00079 
+00081     virtual ~eoEsMutate() {};
+00082 
+00083 
+00090     virtual std::string className() const {return "eoESMutate";};
+00091 
+00092 
+00097     virtual bool operator()( eoEsSimple<FitT>& _eo)
+00098         {
+00099             _eo.stdev *= exp(TauLcl * rng.normal());
+00100             if (_eo.stdev < stdev_eps)
+00101                 _eo.stdev = stdev_eps;
+00102             // now apply to all
+00103             for (unsigned i = 0; i < _eo.size(); ++i)
+00104             {
+00105                 _eo[i] += _eo.stdev * rng.normal();
+00106             }
+00107             bounds.foldsInBounds(_eo);
+00108             return true;
+00109         }
+00110 
+00111 
+00128     virtual bool operator()( eoEsStdev<FitT>& _eo )
+00129         {
+00130             double global = TauGlb * rng.normal();
+00131             for (unsigned i = 0; i < _eo.size(); i++)
+00132             {
+00133                 double stdev = _eo.stdevs[i];
+00134                 stdev *= exp( global + TauLcl * rng.normal() );
+00135                 if (stdev < stdev_eps)
+00136                     stdev = stdev_eps;
+00137                 _eo.stdevs[i] = stdev;
+00138                 _eo[i] += stdev * rng.normal();
+00139             }
+00140             bounds.foldsInBounds(_eo);
+00141             return true;
+00142         }
+00143 
+00144 
+00159     virtual bool operator()( eoEsFull<FitT> & _eo )
+00160     // Code originally from Thomas Bäck
+00161         {
+00162             // First: mutate standard deviations (as for eoEsStdev<FitT>).
+00163             double global = TauGlb * rng.normal();
+00164             unsigned i;
+00165             for (i = 0; i < _eo.size(); i++)
+00166             {
+00167                 double stdev = _eo.stdevs[i];
+00168                 stdev *= exp( global + TauLcl*rng.normal() );
+00169                 if (stdev < stdev_eps)
+00170                     stdev = stdev_eps;
+00171                 _eo.stdevs[i] = stdev;
+00172             }
+00173             // Mutate rotation angles.
+00174             for (i = 0; i < _eo.correlations.size(); i++)
+00175             {
+00176                 _eo.correlations[i] += TauBeta * rng.normal();
+00177                 if ( fabs(_eo.correlations[i]) > M_PI )
+00178                 {
+00179                     _eo.correlations[i] -= M_PI * (int) (_eo.correlations[i]/M_PI) ;
+00180                 }
+00181             }
+00182             // Perform correlated mutations.
+00183             unsigned k, n1, n2;
+00184             double d1,d2, S, C;
+00185             std::vector<double> VarStp(_eo.size());
+00186             for (i = 0; i < _eo.size(); i++)
+00187                 VarStp[i] = _eo.stdevs[i] * rng.normal();
+00188             unsigned nq = _eo.correlations.size() - 1;
+00189             for (k = 0; k < _eo.size()-1; k++)
+00190             {
+00191                 n1 = _eo.size() - k - 1;
+00192                 n2 = _eo.size() - 1;
+00193                 for (i = 0; i < k; i++)
+00194                 {
+00195                     d1 = VarStp[n1];
+00196                     d2 = VarStp[n2];
+00197                     S  = sin( _eo.correlations[nq] );
+00198                     C  = cos( _eo.correlations[nq] );
+00199                     VarStp[n2] = d1 * S + d2 * C;
+00200                     VarStp[n1] = d1 * C - d2 * S;
+00201                     n2--;
+00202                     nq--;
+00203                 }
+00204             }
+00205             for (i = 0; i < _eo.size(); i++)
+00206                 _eo[i] += VarStp[i];
+00207             bounds.foldsInBounds(_eo);
+00208             return true;
+00209         }
+00210 
+00211 
+00212   private :
+00213 
+00215     void init(eoEsSimple<FitT>, eoEsMutationInit& _init)
+00216     {
+00217         unsigned size = bounds.size();
+00218         TauLcl = _init.TauLcl();
+00219         TauLcl /= sqrt(2*(double) size);
+00220         std::cout << "Init<eoEsSimple>: tau local " << TauLcl << std::endl;
+00221     }
+00222 
+00223 
+00228     void init(eoEsStdev<FitT>, eoEsMutationInit& _init)
+00229     {
+00230         unsigned size = bounds.size();
+00231         TauLcl = _init.TauLcl();
+00232         TauGlb = _init.TauGlb();
+00233         // renormalization
+00234         TauLcl /= sqrt( 2.0 * sqrt(double(size)) );
+00235         TauGlb /= sqrt( 2.0 * double(size) );
+00236         std::cout << "Init<eoStDev>: tau local " << TauLcl << " et global " << TauGlb << std::endl;
+00237     }
+00238 
+00239 
+00244     void init(eoEsFull<FitT>, eoEsMutationInit& _init)
+00245     {
+00246         init(eoEsStdev<FitT>(), _init);
+00247         TauBeta = _init.TauBeta();
+00248         std::cout << "Init<eoEsFull>: tau local " << TauLcl << " et global " << TauGlb << std::endl;
+00249     }
+00250 
+00251 
+00253     double TauLcl;
+00254 
+00256     double TauGlb;
+00257 
+00259     double TauBeta;
+00260 
+00262     eoRealVectorBounds& bounds;
+00263 
+00278     static const double stdev_eps;
+00279 };
+00280 
+00281 
+00282 // Minimum value of stdevs, see declaration for details.
+00283 template <class EOT>
+00284 const double eoEsMutate<EOT>::stdev_eps = 1.0e-40;
+00285 
+00286 #endif
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_es_mutation_init_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_es_mutation_init_8h-source.html new file mode 100644 index 000000000..ff2f1f04c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_es_mutation_init_8h-source.html @@ -0,0 +1,112 @@ + + +EO: eoEsMutationInit.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

eoEsMutationInit.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; fill-column: 80 -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoEsMutationInit.h
+00005 // (c) GeNeura Team, 1998 - EEAAX 1999 - Maarten Keijzer 2000
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mak@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoEsMutationInit_h
+00028 #define _eoEsMutationInit_h
+00029 
+00030 #include <utils/eoParser.h>
+00031 
+00047 class eoEsMutationInit
+00048 {
+00049 public :
+00050 
+00056     eoEsMutationInit(eoParser& _parser,
+00057                      std::string _section="ES mutation parameters" ) :
+00058         parser(_parser), repSection(_section),
+00059         TauLclParam(0), TauGlbParam(0), TauBetaParam(0) {}
+00060 
+00062     virtual ~eoEsMutationInit() {}
+00063 
+00065     double TauLcl(void)
+00066     {
+00067         if (TauLclParam == 0)
+00068         {
+00069             TauLclParam = &parser.getORcreateParam(1.0, TauLclName(),
+00070                                                    "Local Tau (before normalization)",
+00071                                                    TauLclShort(), section());
+00072         }
+00073         return TauLclParam->value();
+00074     }
+00075 
+00077     double TauGlb(void)
+00078     {
+00079         if (TauGlbParam == 0)
+00080         {
+00081             TauGlbParam = &parser.getORcreateParam(1.0, TauGlbName(),
+00082                                                    "Global Tau (before normalization)",
+00083                                                    TauGlbShort(), section());
+00084         }
+00085         return TauGlbParam->value();
+00086     }
+00087 
+00089     double TauBeta(void)
+00090     {
+00091         if (TauBetaParam == 0)
+00092         {
+00093             TauBetaParam = &parser.getORcreateParam(0.0873, TauBetaName(),
+00094                                                     "Beta", TauBetaShort(), section());
+00095         }
+00096         return TauBetaParam->value();
+00097     }
+00098 
+00099   protected :
+00100 
+00101     virtual std::string section(void)                { return repSection; }
+00102 
+00103     virtual std::string TauLclName(void) const       { return "TauLoc"; }
+00104     virtual char   TauLclShort(void) const           { return 'l'; }
+00105 
+00106     virtual std::string TauGlbName(void) const       { return "TauGlob"; }
+00107     virtual char   TauGlbShort(void) const           { return 'g'; }
+00108 
+00109     virtual std::string TauBetaName(void) const      { return "Beta"; }
+00110     virtual char   TauBetaShort(void) const          { return 'b'; }
+00111 
+00112 private:
+00113 
+00114     eoParser& parser;
+00115     std::string repSection;
+00116     eoValueParam<double>* TauLclParam;
+00117     eoValueParam<double>* TauGlbParam;
+00118     eoValueParam<double>* TauBetaParam;
+00119 };
+00120 
+00121 #endif
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_es_simple_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_es_simple_8h-source.html new file mode 100644 index 000000000..1b6367e0b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_es_simple_8h-source.html @@ -0,0 +1,82 @@ + + +EO: eoEsSimple.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

eoEsSimple.h

00001 /* (c) GeNeura Team, 2000 - EEAAX 1999, Maarten Keijzer 2000
+00002 
+00003 This library is free software; you can redistribute it and/or modify it under
+00004 the terms of the GNU Lesser General Public License as published by the Free
+00005 Software Foundation; either version 2 of the License, or (at your option) any
+00006 later version.
+00007 
+00008 This library is distributed in the hope that it will be useful, but WITHOUT ANY
+00009 WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+00010 PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
+00011 
+00012 You should have received a copy of the GNU Lesser General Public License along
+00013 with this library; if not, write to the Free Software Foundation, Inc., 59
+00014 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+00015 
+00016 Contact: http://eodev.sourceforge.net
+00017          todos@geneura.ugr.es, http://geneura.ugr.es
+00018          Marc.Schoenauer@polytechnique.fr
+00019          mak@dhi.dk
+00020  */
+00021 
+00022 
+00023 #ifndef _eoEsSimple_h
+00024 #define _eoEsSimple_h
+00025 
+00026 #include <EO.h>
+00027 #include <vector>
+00028 
+00029 #include <eoVector.h>
+00030 
+00041 template <class Fit>
+00042 class eoEsSimple : public eoVector<Fit, double>
+00043 {
+00044 public :
+00045 
+00046     typedef double Type;
+00047 
+00048     eoEsSimple() : eoVector<Fit, double>() {}
+00049 
+00050     virtual std::string className() const { return "eoEsSimple"; }
+00051 
+00052     void printOn(std::ostream& os) const
+00053     {
+00054         eoVector<Fit,double>::printOn(os);
+00055         os << ' ' << stdev << ' ';
+00056     }
+00057 
+00058     void readFrom(std::istream& is)
+00059     {
+00060         eoVector<Fit,double>::readFrom(is);
+00061         is >> stdev;
+00062     }
+00063 
+00064     double stdev;
+00065 };
+00066 
+00067 #endif
+00068 
+00069 
+00070 
+00071 // Local Variables:
+00072 // coding: iso-8859-1
+00073 // mode:C++
+00074 // c-file-style: "Stroustrup"
+00075 // comment-column: 35
+00076 // fill-column: 80
+00077 // End:
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_es_standard_xover_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_es_standard_xover_8h-source.html new file mode 100644 index 000000000..bcf7866fd --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_es_standard_xover_8h-source.html @@ -0,0 +1,100 @@ + + +EO: eoEsStandardXover.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

eoEsStandardXover.h

00001 
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 
+00026 #ifndef _eoEsLocalXover_H
+00027 #define _eoEsLocalXover_H
+00028 
+00029 #include <utils/eoRNG.h>
+00030 
+00031 #include <es/eoEsSimple.h>
+00032 #include <es/eoEsStdev.h>
+00033 #include <es/eoEsFull.h>
+00034 
+00035 #include <eoGenOp.h>
+00036 // needs a selector - here random
+00037 #include <eoRandomSelect.h>
+00038 
+00045 template<class EOT> 
+00046 class eoEsStandardXover: public eoBinOp<EOT>
+00047 {
+00048 public:
+00049   typedef typename EOT::Fitness FitT;
+00050 
+00054   eoEsStandardXover(eoBinOp<double> & _crossObj, eoBinOp<double> & _crossMut) :
+00055     crossObj(_crossObj), crossMut(_crossMut) {}
+00056 
+00058   virtual std::string className() const { return "eoEsStandardXover"; }
+00059 
+00064   bool operator()(EOT& _eo1, const EOT& _eo2)
+00065     {
+00066       bool bLoc=false;
+00067     // first, the object variables
+00068     for (unsigned i=0; i<_eo1.size(); i++)
+00069       {
+00070         bLoc |= crossObj(_eo1[i], _eo2[i]); // apply eoBinOp
+00071       }
+00072     // then the self-adaptation parameters
+00073     bLoc |= cross_self_adapt(_eo1, _eo2);
+00074     return bLoc;
+00075   }
+00076   
+00077 private:
+00078 
+00079   // the method to cross slef-adaptation parameters: need to specialize
+00080 
+00081   bool cross_self_adapt(eoEsSimple<FitT> & _parent1, const eoEsSimple<FitT> & _parent2)
+00082   {
+00083     return crossMut(_parent1.stdev, _parent2.stdev); // apply eoBinOp
+00084   }
+00085 
+00086   bool cross_self_adapt(eoEsStdev<FitT> & _parent1, const eoEsStdev<FitT> & _parent2)
+00087   {
+00088     bool bLoc=false;
+00089     for (unsigned i=0; i<_parent1.size(); i++)
+00090       {
+00091         bLoc |= crossMut(_parent1.stdevs[i], _parent2.stdevs[i]); // apply eoBinOp
+00092       }
+00093     return bLoc;
+00094   }
+00095 
+00096   bool cross_self_adapt(eoEsFull<FitT> & _parent1, const eoEsFull<FitT> & _parent2)
+00097   {
+00098     bool bLoc=false;
+00099     unsigned i;
+00100     // the StDev
+00101     for (i=0; i<_parent1.size(); i++)
+00102       {
+00103         bLoc |= crossMut(_parent1.stdevs[i], _parent2.stdevs[i]); // apply eoBinOp
+00104       }
+00105     // the roataion angles
+00106     for (i=0; i<_parent1.correlations.size(); i++)
+00107       {
+00108         bLoc |= crossMut(_parent1.correlations[i], _parent2.correlations[i]); // apply eoBinOp
+00109       }
+00110     return bLoc;
+00111 
+00112   }
+00113 
+00114   // the data
+00115   eoRandomSelect<EOT> sel;
+00116   eoBinOp<double> & crossObj;
+00117   eoBinOp<double> & crossMut;
+00118 };
+00119 
+00120 #endif
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_es_stdev_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_es_stdev_8h-source.html new file mode 100644 index 000000000..f80eb3043 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_es_stdev_8h-source.html @@ -0,0 +1,88 @@ + + +EO: eoEsStdev.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

eoEsStdev.h

00001 /* (c) GeNeura Team, 2000 - EEAAX 1999 - Maarten Keijzer 2000
+00002 
+00003 This library is free software; you can redistribute it and/or modify it under
+00004 the terms of the GNU Lesser General Public License as published by the Free
+00005 Software Foundation; either version 2 of the License, or (at your option) any
+00006 later version.
+00007 
+00008 This library is distributed in the hope that it will be useful, but WITHOUT ANY
+00009 WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+00010 PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
+00011 
+00012 You should have received a copy of the GNU Lesser General Public License along
+00013 with this library; if not, write to the Free Software Foundation, Inc., 59
+00014 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+00015 
+00016 Contact: http://eodev.sourceforge.net
+00017          todos@geneura.ugr.es, http://geneura.ugr.es
+00018          Marc.Schoenauer@polytechnique.fr
+00019          mak@dhi.dk
+00020  */
+00021 
+00022 
+00023 #ifndef _eoEsStdev_h
+00024 #define _eoEsStdev_h
+00025 
+00026 #include <eoVector.h>
+00027 
+00028 
+00036 template <class Fit>
+00037 class eoEsStdev : public eoVector<Fit, double>
+00038 {
+00039 public:
+00040 
+00041     using eoVector<Fit, double>::size;
+00042 
+00043     typedef double Type;
+00044 
+00045     eoEsStdev(void) : eoVector<Fit, double>() {}
+00046 
+00047     virtual std::string className(void) const { return "eoEsStdev"; }
+00048 
+00049     void printOn(std::ostream& os) const
+00050     {
+00051         eoVector<Fit,double>::printOn(os);
+00052         os << ' ';
+00053         std::copy(stdevs.begin(), stdevs.end(), std::ostream_iterator<double>(os, " "));
+00054         os << ' ';
+00055     }
+00056 
+00057     void readFrom(std::istream& is)
+00058     {
+00059         eoVector<Fit,double>::readFrom(is);
+00060         stdevs.resize(size());
+00061         unsigned i;
+00062         for (i = 0; i < size(); ++i)
+00063             is >> stdevs[i];
+00064     }
+00065 
+00066 
+00067     std::vector<double> stdevs;
+00068 };
+00069 
+00070 #endif
+00071 
+00072 
+00073 
+00074 // Local Variables:
+00075 // coding: iso-8859-1
+00076 // mode:C++
+00077 // c-file-style: "Stroustrup"
+00078 // comment-column: 35
+00079 // fill-column: 80
+00080 // End:
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_eval_continue_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_eval_continue_8h-source.html new file mode 100644 index 000000000..3679f477d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_eval_continue_8h-source.html @@ -0,0 +1,76 @@ + + +EO: eoEvalContinue.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoEvalContinue.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoEvalContinue.h
+00005 // (c) GeNeura Team, 1999, Marc Schoenauer 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _eoEvalContinue_h
+00027 #define _eoEvalContinue_h
+00028 
+00029 #include <eoContinue.h>
+00030 #include <eoEvalFuncCounter.h>
+00031 
+00035 template< class EOT>
+00036 class eoEvalContinue: public eoContinue<EOT>
+00037 {
+00038 public:
+00040   eoEvalContinue( eoEvalFuncCounter<EOT> & _eval, unsigned long _totalEval)
+00041           : eval(_eval), repTotalEvaluations( _totalEval ) {
+00042     std::cout << "Ctor de eoEvalFuncCounter avec total = " << repTotalEvaluations << std::endl;
+00043 };
+00044   
+00047   virtual bool operator() ( const eoPop<EOT>& _vEO ) {
+00048     if (eval.value() >= repTotalEvaluations) 
+00049       {
+00050         std::cout << "STOP in eoEvalContinue: Reached maximum number of evaluations [" << repTotalEvaluations << "]\n";
+00051         return false;
+00052       }
+00053     return true;
+00054   }
+00055   
+00057   virtual unsigned long totalEvaluations( ) 
+00058   {  
+00059     return repTotalEvaluations; 
+00060   };
+00061   
+00062   virtual std::string className(void) const { return "eoEvalContinue"; }
+00063 private:
+00064   eoEvalFuncCounter<EOT> & eval;
+00065   unsigned long repTotalEvaluations;
+00066 };
+00067 
+00068 #endif
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_eval_func_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_eval_func_8h-source.html new file mode 100644 index 000000000..6f6b2e028 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_eval_func_8h-source.html @@ -0,0 +1,53 @@ + + +EO: eoEvalFunc.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoEvalFunc.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoEvalFunc.h
+00005 // (c) GeNeura Team, 1998
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022  */
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef eoEvalFunc_H
+00026 #define eoEvalFunc_H
+00027 
+00028 #include <eoFunctor.h>
+00029 
+00041 template<class EOT> class eoEvalFunc : public eoUF<EOT&, void>
+00042 {
+00043     public :
+00044         typedef EOT EOType;
+00045 
+00046         typedef typename EOT::Fitness EOFitT;
+00047 };
+00048 
+00049 #endif
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_eval_func_counter_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_eval_func_counter_8h-source.html new file mode 100644 index 000000000..8b7412cc1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_eval_func_counter_8h-source.html @@ -0,0 +1,67 @@ + + +EO: eoEvalFuncCounter.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoEvalFuncCounter.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoEvalFuncCounter.h
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2000
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef eoEvalFuncCounter_H
+00028 #define eoEvalFuncCounter_H
+00029 
+00030 #include <eoEvalFunc.h>
+00031 #include <utils/eoParam.h>
+00032 
+00037 template<class EOT> class eoEvalFuncCounter : public eoEvalFunc<EOT>, public eoValueParam<unsigned long>
+00038 {
+00039     public :
+00040         eoEvalFuncCounter(eoEvalFunc<EOT>& _func, std::string _name = "Eval. ") 
+00041             : eoValueParam<unsigned long>(0, _name), func(_func) {}
+00042 
+00043         virtual void operator()(EOT& _eo)
+00044         {
+00045             if (_eo.invalid())
+00046             {
+00047                 value()++;
+00048                 func(_eo);
+00049             }
+00050         }
+00051 
+00052     private :
+00053         eoEvalFunc<EOT>& func;
+00054 };
+00055 
+00056 #endif
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_eval_func_ptr_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_eval_func_ptr_8h-source.html new file mode 100644 index 000000000..4fe1aab70 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_eval_func_ptr_8h-source.html @@ -0,0 +1,45 @@ + + +EO: eoEvalFuncPtr.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoEvalFuncPtr.h

00001 
+00026 //-----------------------------------------------------------------------------
+00027 
+00028 #ifndef EOEVALFUNCPTR_H
+00029 #define EOEVALFUNCPTR_H
+00030 
+00031 #include <eoEvalFunc.h>
+00032 
+00038 #ifdef _MSC_VER
+00039 template< class EOT, class FitT = EOT::Fitness, class FunctionArg = const EOT& >
+00040 #else
+00041 template< class EOT, class FitT = typename EOT::Fitness, class FunctionArg = const EOT& >
+00042 #endif
+00043 struct eoEvalFuncPtr: public eoEvalFunc<EOT> {
+00044 
+00051   eoEvalFuncPtr( FitT (* _eval)( FunctionArg ) )
+00052     : eoEvalFunc<EOT>(), evalFunc( _eval ) {};
+00053   
+00055   virtual void operator() ( EOT & _eo ) 
+00056   {
+00057     if (_eo.invalid())
+00058         _eo.fitness((*evalFunc)( _eo ));
+00059   };
+00060     
+00061   private:
+00062     FitT (* evalFunc )( FunctionArg );
+00063 };
+00064 
+00065 #endif
+00066 
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_external_e_o_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_external_e_o_8h-source.html new file mode 100644 index 000000000..456210ec2 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_external_e_o_8h-source.html @@ -0,0 +1,91 @@ + + +EO: eoExternalEO.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / other
+

eoExternalEO.h

00001 /* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003   -----------------------------------------------------------------------------
+00004   eoExternalEO.h
+00005         Definition of an object that allows an external struct to be inserted in EO
+00006 
+00007  (c) Maarten Keijzer (mkeijzer@mad.scientist.com) and GeNeura Team, 1999, 2000
+00008 
+00009     This library is free software; you can redistribute it and/or
+00010     modify it under the terms of the GNU Lesser General Public
+00011     License as published by the Free Software Foundation; either
+00012     version 2 of the License, or (at your option) any later version.
+00013 
+00014     This library is distributed in the hope that it will be useful,
+00015     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00016     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00017     Lesser General Public License for more details.
+00018 
+00019     You should have received a copy of the GNU Lesser General Public
+00020     License along with this library; if not, write to the Free Software
+00021     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00022 
+00023     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00024  */
+00025 
+00026 #ifndef eoExternalEO_h
+00027 #define eoExternalEO_h
+00028 
+00029 #include <EO.h> // EO
+00030 
+00038 template <class Fit, class External>
+00039 class eoExternalEO : public EO<Fit>, virtual public External
+00040 {
+00041 public :
+00042 
+00043     eoExternalEO(void)
+00044         : EO<Fit>(), External()
+00045         {}
+00046 
+00048     eoExternalEO(const External& ext)
+00049         : EO<Fit>(), External(ext)
+00050         {}
+00051 
+00052     eoExternalEO(std::istream& is, const External& ext)
+00053         : EO<Fit>(), External(ext)
+00054         { readFrom(is); }
+00055 
+00059   virtual void readFrom(std::istream& _is)
+00060   {
+00061       EO<Fit>::readFrom(_is);
+00062     _is >> static_cast<External&>(*this);
+00063   }
+00064 
+00069   virtual void printOn(std::ostream& _os) const
+00070   {
+00071       EO<Fit>::printOn(_os);
+00072       _os << static_cast<const External&>(*this);
+00073   }
+00074 
+00075 };
+00076 
+00078 template <class F, class External>
+00079 std::ostream& operator<<(std::ostream& os, const eoExternalEO<F, External>& eo)
+00080 {
+00081     eo.printOn(os);
+00082     return os;
+00083 }
+00084 
+00086 template <class F, class External>
+00087 std::istream& operator>>(std::istream& is, eoExternalEO<F, External>& eo)
+00088 {
+00089     eo.readFrom(is);
+00090     return is;
+00091 }
+00092 
+00093 #endif
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_external_op_functions_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_external_op_functions_8h-source.html new file mode 100644 index 000000000..b64dd6d3b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_external_op_functions_8h-source.html @@ -0,0 +1,140 @@ + + +EO: eoExternalOpFunctions.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / other
+

eoExternalOpFunctions.h

00001 /* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003   -----------------------------------------------------------------------------
+00004   eoExternalOpFunc.h
+00005         Defines eoExternalInitOpFunc, eoExternalMonOpFunc, eoExternalBinOpFunc, eoExternalQuadOpFunc
+00006         that are used to wrap a function pointer to externally defined initialization
+00007         and 'genetic' operators
+00008 
+00009  (c) Maarten Keijzer (mkeijzer@mad.scientist.com) and GeNeura Team, 1999, 2000
+00010 
+00011     This library is free software; you can redistribute it and/or
+00012     modify it under the terms of the GNU Lesser General Public
+00013     License as published by the Free Software Foundation; either
+00014     version 2 of the License, or (at your option) any later version.
+00015 
+00016     This library is distributed in the hope that it will be useful,
+00017     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00018     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00019     Lesser General Public License for more details.
+00020 
+00021     You should have received a copy of the GNU Lesser General Public
+00022     License along with this library; if not, write to the Free Software
+00023     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00024 
+00025     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00026  */
+00027 
+00028 #ifndef eoExternalOpFunc_h
+00029 #define eoExternalOpFunc_h
+00030 
+00031 #include <other/eoExternalEO.h>
+00032 #include <eoOp.h>
+00033 #include <eoInit.h>
+00034 #include <eoEvalFunc.h>
+00035 
+00044 template <class F, class External, class ExternalEO = eoExternalEO<F, External> >
+00045 class eoExternalInit : public eoInit<ExternalEO>
+00046 {
+00047 
+00048 public :
+00049 
+00050     eoExternalInit(External (*_init)(void)) : init(_init) {}
+00051 
+00052 
+00053     void operator()(ExternalEO& _eo)
+00054     {
+00055         _eo.External::operator=( (*init)() );
+00056         _eo.invalidate();
+00057     }
+00058 
+00059 private :
+00060 
+00061     External (*init)(void);
+00062 };
+00063 
+00072 template <class F, class External, class ExternalEO = eoExternalEO<F, External> >
+00073 class eoExternalEvalFunc : public eoEvalFunc<ExternalEO>
+00074 {
+00075     public :
+00076 
+00077     eoExternalEvalFunc(F (*_eval)(const External&)) : eval(_eval) {}
+00078 
+00079     void operator()(ExternalEO& eo)
+00080     {
+00081         if (eo.invalid())
+00082             eo.fitness( (*eval)(eo) );
+00083     }
+00084 
+00085     private :
+00086 
+00087     F (*eval)(const External&);
+00088 };
+00089 
+00101 template <class F, class External, class ExternalEO = eoExternalEO<F, External> >
+00102 class eoExternalMonOp : public eoMonOp<ExternalEO>
+00103 {
+00104     public :
+00105 
+00106     eoExternalMonOp(bool (*_mutate)(External&)) : mutate(_mutate) {}
+00107 
+00108     bool operator()(ExternalEO& eo)
+00109     {
+00110         return (*mutate)(eo);
+00111     }
+00112 
+00113     private :
+00114 
+00115     bool (*mutate)(External&);
+00116 };
+00117 
+00127 template <class F, class External, class ExternalEO = eoExternalEO<F, External> >
+00128 class eoExternalBinOp : public eoBinOp<ExternalEO>
+00129 {
+00130     public :
+00131 
+00132     eoExternalBinOp(bool (*_binop)(External&, const External&)) : binop(_binop) {}
+00133 
+00134     bool operator()(ExternalEO& eo1, const ExternalEO& eo2)
+00135     {
+00136         return (*binop)(eo1, eo2);
+00137     }
+00138 
+00139     private :
+00140 
+00141     bool (*binop)(External&, const External&);
+00142 };
+00143 
+00153 template <class F, class External, class ExternalEO = eoExternalEO<F, External> >
+00154 class eoExternalQuadOp : public eoQuadOp<ExternalEO>
+00155 {
+00156     public :
+00157 
+00158     eoExternalQuadOp(bool (*_quadop)(External&, External&)) : quadop(_quadop) {}
+00159 
+00160     bool operator()(ExternalEO& eo1, ExternalEO& eo2)
+00161     {
+00162         return (*quadop)(eo1, eo2);
+00163     }
+00164 
+00165     private :
+00166 
+00167     bool (*quadop)(External&, External&);
+00168 };
+00169 
+00170 #endif
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_f_d_c_stat_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_f_d_c_stat_8h-source.html new file mode 100644 index 000000000..56a1a7a17 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_f_d_c_stat_8h-source.html @@ -0,0 +1,130 @@ + + +EO: eoFDCStat.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoFDCStat.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoFDCStat.h
+00005 // (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000, 2001
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoFDCStat_h
+00028 #define _eoFDCStat_h
+00029 
+00030 #include <utils/eoStat.h>
+00031 #include <utils/eoDistance.h>
+00032 #include <utils/eoFileSnapshot.h>
+00033 
+00038 template <class EOT>
+00039 class eoFDCStat : public eoStat<EOT, double>
+00040 {
+00041 public:
+00042 
+00043     using eoStat<EOT, double>::value;
+00044 
+00046   eoFDCStat(eoDistance<EOT> & _dist, std::string _description = "FDC") :
+00047       eoStat<EOT,double>(0, _description), dist(_dist), boolOpt(false) {}
+00048 
+00051   eoFDCStat(eoDistance<EOT> & _dist, EOT & _theBest,
+00052             std::string _description = "FDC") :
+00053     eoStat<EOT,double>(0, _description), dist(_dist),
+00054     theBest(_theBest), boolOpt(true) {}
+00055 
+00059     virtual void operator()(const eoPop<EOT>& _pop)
+00060     {
+00061       unsigned i;
+00062       if (!boolOpt)                // take the local best
+00063         theBest = _pop.best_element();
+00064       unsigned int pSize = _pop.size();
+00065       distToBest.value().resize(pSize);
+00066       fitnesses.value().resize(pSize);
+00067       double sumFit = 0.0, sumDist = 0.0;
+00068       for (i=0; i<pSize; i++)
+00069         {
+00070           sumDist += (distToBest.value()[i] = dist(_pop[i], theBest));
+00071           sumFit += (fitnesses.value()[i] = _pop[i].fitness());
+00072         }
+00073       // now the FDC coefficient
+00074       double avgDist = sumDist/pSize;
+00075       double avgFit = sumFit/pSize;
+00076       sumDist = sumFit = 0.0;
+00077       double num = 0.0;
+00078       for (i=0; i<pSize; i++)
+00079         {
+00080           double devDist = distToBest.value()[i] - avgDist ;
+00081           double devFit = fitnesses.value()[i] - avgFit ;
+00082           sumDist += devDist*devDist;
+00083           sumFit += devFit * devFit;
+00084           num += devDist * devFit ;
+00085         }
+00086       value() = num/(sqrt(sumDist)*sqrt(sumFit));
+00087     }
+00088 
+00091   const eoValueParam<std::vector<double> > & theDist()
+00092   { return distToBest; }
+00093   const eoValueParam<std::vector<double> > & theFit()
+00094   { return fitnesses; }
+00095 
+00096 
+00097 private:
+00098   eoDistance<EOT> & dist;
+00099   EOT theBest;
+00100   bool boolOpt;                    // whether the best is known or not
+00101   eoValueParam<std::vector<double> > distToBest;
+00102   eoValueParam<std::vector<double> > fitnesses;
+00103 };
+00104 
+00110 template <class EOT>
+00111 class eoFDCFileSnapshot : public eoFileSnapshot // is an eoMonitor
+00112 {
+00113 public:
+00119   eoFDCFileSnapshot(eoFDCStat<EOT> & _FDCstat,
+00120                     std::string _dirname = "tmpFDC", unsigned _frequency = 1,
+00121                     std::string _filename = "FDC", std::string _delim = " "):
+00122     eoFileSnapshot(_dirname, _frequency, _filename, _delim),
+00123     FDCstat(_FDCstat)
+00124   {
+00125     eoFileSnapshot::add(FDCstat.theDist());
+00126     eoFileSnapshot::add(FDCstat.theFit());
+00127   }
+00128 
+00131   virtual void add(const eoParam& _param)
+00132     { throw std::runtime_error("eoFDCFileSnapshot::add(). Trying to add stats to an eoFDCFileSnapshot"); }
+00133 
+00134 private:
+00135   eoFDCStat<EOT> & FDCstat;
+00136 };
+00137 
+00138 #endif
+00139 
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_factory_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_factory_8h-source.html new file mode 100644 index 000000000..7ae6c5410 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_factory_8h-source.html @@ -0,0 +1,68 @@ + + +EO: eoFactory.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoFactory.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoFactory.h
+00005 // (c) GeNeura Team, 1998
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022  */
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef _EOFACTORY_H
+00026 #define _EOFACTORY_H
+00027 
+00028 //-----------------------------------------------------------------------------
+00029 #include <eoObject.h>
+00030 
+00031 //-----------------------------------------------------------------------------
+00032 
+00041 template<class EOClass>
+00042 class eoFactory: public eoObject {
+00043         
+00044 public:
+00045         
+00047         //{@
+00049         eoFactory( ) {}
+00050         
+00052         virtual ~eoFactory() {}
+00054 
+00059         virtual EOClass* make(std::istream& _is) = 0;
+00060 
+00062 
+00063 
+00064         virtual std::string className() const { return "eoFactory"; }
+00065 
+00068         
+00069 };
+00070 
+00071 
+00072 #endif
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_file_monitor_8cpp-source.html b/trunk/paradiseo-eo/doc/html/eo_file_monitor_8cpp-source.html new file mode 100644 index 000000000..3ac314ddc --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_file_monitor_8cpp-source.html @@ -0,0 +1,92 @@ + + +EO: eoFileMonitor.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoFileMonitor.cpp

00001 #ifdef _MSC_VER
+00002 // to avoid long name warnings
+00003 #pragma warning(disable:4786)
+00004 #endif 
+00005 
+00006 #include <iostream>
+00007 #include <fstream>
+00008 #include <stdexcept>
+00009 
+00010 #include <utils/eoFileMonitor.h>
+00011 #include <utils/compatibility.h>
+00012 #include <utils/eoParam.h>
+00013 
+00014 using namespace std;
+00015 
+00016 void eoFileMonitor::printHeader(std::ostream& os)
+00017 {
+00018     iterator it = vec.begin();
+00019 
+00020     os << (*it)->longName();
+00021 
+00022     ++it;
+00023 
+00024     for (; it != vec.end(); ++it)
+00025     {
+00026         os << delim.c_str() << (*it)->longName();
+00027     }
+00028     os << '\n';
+00029 }
+00030 
+00031 void eoFileMonitor::printHeader()
+00032 {
+00033     // create file
+00034     ofstream os(filename.c_str()); 
+00035 
+00036     if (!os)
+00037     {
+00038         string str = "eoFileMonitor: Could not open " + filename;
+00039         throw runtime_error(str);
+00040     }
+00041     
+00042     printHeader(os);
+00043 }
+00044 
+00045 eoMonitor& eoFileMonitor::operator()(void)
+00046 {
+00047     ofstream os(filename.c_str(), ios_base::app);
+00048 
+00049     if (!os)
+00050     {
+00051         string str = "eoFileMonitor: Could not append to " + filename;
+00052         throw runtime_error(str);
+00053     }
+00054 
+00055     if (firstcall && !keep && header ){
+00056       printHeader();
+00057       firstcall = false;
+00058     }
+00059     
+00060     return operator()(os);
+00061 }
+00062 
+00063 eoMonitor& eoFileMonitor::operator()(std::ostream& os)
+00064 {
+00065     iterator it = vec.begin();
+00066 
+00067     os << (*it)->getValue();
+00068     
+00069     for(++it; it != vec.end(); ++it)
+00070     {
+00071         os << delim.c_str() << (*it)->getValue();
+00072     }
+00073 
+00074     os << '\n';
+00075     return *this;
+00076 }
+00077 
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_file_monitor_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_file_monitor_8h-source.html new file mode 100644 index 000000000..064e8d88e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_file_monitor_8h-source.html @@ -0,0 +1,86 @@ + + +EO: eoFileMonitor.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoFileMonitor.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoFileMonitor.h
+00005 // (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef EO_eoFileMonitor_h
+00028 #define EO_eoFileMonitor_h
+00029 
+00030 #include <string>
+00031 #include <fstream>
+00032 #include <stdexcept>
+00033 
+00034 #include "utils/eoMonitor.h"
+00035 #include "eoObject.h"
+00036 
+00044 class eoFileMonitor : public eoMonitor
+00045 {
+00046 public :
+00047 
+00048   eoFileMonitor(std::string _filename, std::string _delim = " ", bool _keep = false, bool _header=false)
+00049     : filename(_filename), delim(_delim), keep(_keep), header(_header), firstcall(true)
+00050   {
+00051     if (! _keep) {
+00052       std::ofstream os(filename.c_str());
+00053       if (!os){
+00054         std::string str = "eoFileMonitor: Could not open " + filename;
+00055         throw std::runtime_error(str);
+00056       }
+00057     }
+00058   }
+00059 
+00060   virtual eoMonitor& operator()(void);
+00061 
+00062   virtual eoMonitor& operator()(std::ostream& os);
+00063 
+00064   void printHeader(void);
+00065   virtual void printHeader(std::ostream& os);
+00066 
+00067   virtual std::string getFileName() { return filename;}
+00068 
+00069 private :
+00070   std::string filename;
+00071   std::string delim;
+00072   bool keep;                       // should we append or create a new file
+00073   bool header;                     // printing header at begin of file?
+00074   bool firstcall;
+00075 
+00076 };
+00077 
+00078 #endif
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_file_snapshot_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_file_snapshot_8h-source.html new file mode 100644 index 000000000..c50737910 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_file_snapshot_8h-source.html @@ -0,0 +1,176 @@ + + +EO: eoFileSnapshot.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoFileSnapshot.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoFileSnapshot.h
+00005 // (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2001
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoFileSnapshot_h
+00028 #define _eoFileSnapshot_h
+00029 
+00030 #include <string>
+00031 #include <fstream>
+00032 #include <utils/eoParam.h>
+00033 #include <utils/eoMonitor.h>
+00034 #include <eoObject.h>
+00035 
+00036 
+00053 class eoFileSnapshot : public eoMonitor
+00054 {
+00055 public :
+00056   typedef std::vector<double> vDouble;
+00057   typedef eoValueParam<std::vector<double> > vDoubleParam;
+00058 
+00059   eoFileSnapshot(std::string _dirname, unsigned _frequency = 1, std::string _filename = "gen",
+00060               std::string _delim = " ", unsigned _counter = 0, bool _rmFiles = true):
+00061     dirname(_dirname), frequency(_frequency),
+00062     filename(_filename), delim(_delim), counter(_counter), boolChanged(true)
+00063   {
+00064     std::string s = "test -d " + dirname;
+00065 
+00066     int res = system(s.c_str());
+00067     // test for (unlikely) errors
+00068     if ( (res==-1) || (res==127) )
+00069       throw std::runtime_error("Problem executing test of dir in eoFileSnapshot");
+00070     // now make sure there is a dir without any genXXX file in it
+00071     if (res)                    // no dir present
+00072       {
+00073         s = std::string("mkdir ")+dirname;
+00074       }
+00075     else if (!res && _rmFiles)
+00076       {
+00077         s = std::string("/bin/rm ")+dirname+ "/" + filename + "*";
+00078       }
+00079     else
+00080       s = " ";
+00081 
+00082     system(s.c_str());
+00083     // all done
+00084   }
+00085 
+00088   virtual bool hasChanged() {return boolChanged;}
+00089 
+00092   unsigned getCounter() {return counter;}
+00093 
+00096   std::string getFileName() {return currentFileName;}
+00097 
+00100   void setCurrentFileName()
+00101   {
+00102       std::ostringstream oscount;
+00103       oscount << counter;
+00104       currentFileName = dirname + "/" + filename + oscount.str();
+00105   }
+00106 
+00109   eoMonitor& operator()(void)
+00110   {
+00111     if (counter % frequency)
+00112       {
+00113         boolChanged = false;  // subclass with gnuplot will do nothing
+00114         counter++;
+00115         return (*this);
+00116       }
+00117     counter++;
+00118     boolChanged = true;
+00119     setCurrentFileName();
+00120     std::ofstream os(currentFileName.c_str());
+00121 
+00122     if (!os)
+00123       {
+00124         std::string str = "eoFileSnapshot: Could not open " + currentFileName;
+00125         throw std::runtime_error(str);
+00126       }
+00127 
+00128     return operator()(os);
+00129   }
+00130 
+00133   eoMonitor& operator()(std::ostream& _os)
+00134   {
+00135     const eoValueParam<std::vector<double> >  * ptParam =
+00136       static_cast<const eoValueParam<std::vector<double> >* >(vec[0]);
+00137 
+00138     const std::vector<double>  v = ptParam->value();
+00139     if (vec.size() == 1)           // only one std::vector: -> add number in front
+00140       {
+00141         for (unsigned k=0; k<v.size(); k++)
+00142           _os << k << " " << v[k] << "\n" ;
+00143       }
+00144     else                           // need to get all other std::vectors
+00145       {
+00146         std::vector<std::vector<double> > vv(vec.size());
+00147         vv[0]=v;
+00148         for (unsigned i=1; i<vec.size(); i++)
+00149           {
+00150             ptParam = static_cast<const eoValueParam<std::vector<double> >* >(vec[1]);
+00151             vv[i] = ptParam->value();
+00152             if (vv[i].size() != v.size())
+00153               throw std::runtime_error("Dimension error in eoSnapshotMonitor");
+00154           }
+00155         for (unsigned k=0; k<v.size(); k++)
+00156           {
+00157           for (unsigned i=0; i<vec.size(); i++)
+00158             _os << vv[i][k] << " " ;
+00159           _os << "\n";
+00160           }
+00161       }
+00162     return *this;
+00163    }
+00164 
+00165   virtual const std::string getDirName()           // for eoGnuPlot
+00166   { return dirname;}
+00167   virtual const std::string baseFileName()         // the title for eoGnuPlot
+00168   { return filename;}
+00169 
+00171   void add(const eoParam& _param)
+00172   {
+00173     if (!dynamic_cast<const eoValueParam<std::vector<double> >*>(&_param))
+00174     {
+00175       throw std::logic_error(std::string("eoFileSnapshot: I can only monitor std::vectors of doubles, sorry. The offending parameter name = ") + _param.longName());
+00176     }
+00177     eoMonitor::add(_param);
+00178   }
+00179 
+00180 private :
+00181   std::string dirname;
+00182   unsigned frequency;
+00183   std::string filename;
+00184   std::string delim;
+00185   unsigned int counter;
+00186   std::string currentFileName;
+00187   bool boolChanged;
+00188 };
+00189 
+00190 #endif
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_fit_continue_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_fit_continue_8h-source.html new file mode 100644 index 000000000..e6042bb5a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_fit_continue_8h-source.html @@ -0,0 +1,72 @@ + + +EO: eoFitContinue.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoFitContinue.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoFitContinue.h
+00005 // (c) Maarten Keijzer, GeNeura Team, 1999, 2000
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022  */
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef _eoFitContinue_h
+00026 #define _eoFitContinue_h
+00027 
+00028 #include <eoContinue.h>
+00029 
+00035 template< class EOT>
+00036 class eoFitContinue: public eoContinue<EOT> {
+00037 public:
+00038 
+00040     typedef typename EOT::Fitness FitnessType;
+00041 
+00043     eoFitContinue( const FitnessType _maximum)
+00044                 : eoContinue<EOT> (), maximum( _maximum ) {};
+00045 
+00048         virtual bool operator() ( const eoPop<EOT>& _pop ) 
+00049     {
+00050     FitnessType bestCurrentFitness = _pop.nth_element_fitness(0);
+00051     if (bestCurrentFitness >= maximum) 
+00052       {
+00053         std::cout << "STOP in eoFitContinue: Best fitness has reached " << 
+00054           bestCurrentFitness << "\n";
+00055         return false;
+00056       }
+00057     return true;
+00058     }
+00059 
+00060   virtual std::string className(void) const { return "eoFitContinue"; }
+00061 private:
+00062         FitnessType maximum;
+00063 };
+00064 
+00065 #endif
+00066 
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_fitness_scaling_select_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_fitness_scaling_select_8h-source.html new file mode 100644 index 000000000..9baaa3cd1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_fitness_scaling_select_8h-source.html @@ -0,0 +1,62 @@ + + +EO: eoFitnessScalingSelect.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoFitnessScalingSelect.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoFitnessScalingSelect.h
+00005 // (c) GeNeura Team, 1998, Maarten Keijzer 2000, Marc Schoenauer 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mak@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef eoFitnessScalingSelect_h
+00028 #define eoFitnessScalingSelect_h
+00029 
+00030 //-----------------------------------------------------------------------------
+00031 
+00032 #include <eoSelectFromWorth.h>
+00033 #include <eoLinearFitScaling.h>
+00034 
+00039 template <class EOT> 
+00040 class eoFitnessScalingSelect:  public eoRouletteWorthSelect<EOT, double> 
+00041 {
+00042 public:
+00046   eoFitnessScalingSelect(double _p = 2.0): 
+00047     eoRouletteWorthSelect<EOT, double>(scaling), scaling(_p) {}
+00048 
+00049 private :
+00050   eoLinearFitScaling<EOT> scaling;         // derived from eoPerf2Worth
+00051 };
+00052 
+00053 #endif 
+00054 
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_fl_or_bin_op_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_fl_or_bin_op_8h-source.html new file mode 100644 index 000000000..843179415 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_fl_or_bin_op_8h-source.html @@ -0,0 +1,199 @@ + + +EO: eoFlOrBinOp.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoFlOrBinOp.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoFlOrBinOp.h
+00005 // (c) Marc Schoenauer - Maarten Keijzer 2000-2003
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: Marc.Schoenauer@inria.fr
+00022              mkeijzer@cs.vu.nl
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _eoFlOrBinOp_h
+00027 #define _eoFlOrBinOp_h
+00028 
+00029 #include <eoFunctor.h>
+00030 #include <eoOp.h>
+00031 
+00042 
+00043 //                eoFlOrAllAtomBinOp
+00045 
+00048 template <class EOT>
+00049 class eoFlOrAllAtomBinOp : public eoBinOp<EOT>
+00050 {
+00051 public :
+00052 
+00053   typedef typename EOT::AtomType AtomType;
+00054 
+00056   eoFlOrAllAtomBinOp( eoBinOp<AtomType>& _op, float _rate = 1.0):
+00057     op(_op), rate( _rate ) {}
+00058 
+00060   bool operator()(EOT & _eo1, const EOT & _eo2)
+00061   {
+00062     if (_eo1.size() != _eo2.size())
+00063       {
+00064         string s = "Operand size don't match in " + className();
+00065         throw runtime_error(s);
+00066       }
+00067     bool changed = false;
+00068     for ( unsigned i = 0; i < _eo1.size(); i++ ) {
+00069       if ( rng.flip( rate ) ) {
+00070         bool changedHere = op( _eo1[i], _eo2[i] );
+00071         changed |= changedHere;
+00072       }
+00073     }
+00074     return changed;
+00075   }
+00076 
+00078   virtual string className() const { return "eoFlOrAllAtomBinOp"; }
+00079 
+00080 private:
+00081   double rate;
+00082   eoBinOp<AtomType> & op;
+00083 };
+00084 
+00086 //                 eoFlOrKAtomBinOp
+00088 
+00091 template <class EOT>
+00092 class eoFlOrKAtomBinOp : public eoBinOp<EOT>
+00093 {
+00094 public :
+00095 
+00096   typedef typename EOT::AtomType AtomType;
+00097 
+00099   eoFlOrAtomBinOp( eoBinOp<AtomType>& _op, unsigned _k = 1):
+00100     op(_op), k( _k ) {}
+00101 
+00103   bool operator()(EOT & _eo1, const EOT & _eo2)
+00104   {
+00105     if (_eo1.size() != _eo2.size())
+00106       {
+00107         string s = "Operand size don't match in " + className();
+00108         throw runtime_error(s);
+00109       }
+00110 
+00111     bool changed = false;
+00112     for ( unsigned i = 0; i < k; i++ ) // TODO: check that we don't do twice the same
+00113       {
+00114         unsigned where = eo::rng.random(_eo1.size());
+00115         bool changedHere = op( _eo1[where], _eo2[where] );
+00116         changed |= changedHere;
+00117       }
+00118     return changed;
+00119   }
+00120 
+00122   virtual string className() const { return "eoFlOrKAtomBinOp"; }
+00123 
+00124 private:
+00125   unsigned k;
+00126   eoBinOp<AtomType> & op;
+00127 };
+00128 
+00129 
+00131 //                        eoFlOrUniformBinOp
+00133 
+00135 template <class EOT>
+00136 class eoFlOrUniformBinOp : public eoBinOp<EOT>
+00137 {
+00138 public :
+00139 
+00140   typedef typename EOT::AtomType AtomType;
+00141 
+00143   eoFlOrUniformBinOp(double _rate=0.5) : eoBinOp<EOT>(_size),
+00144     rate(_rate) {}
+00145 
+00147   bool operator()(EOT & _eo1, const EOT & _eo2)
+00148   {
+00149     unsigned i;
+00150     Atom tmp;
+00151     if (_eo1.size() != _eo2.size())
+00152       {
+00153         string s = "Operand size don't match in " + className();
+00154         throw runtime_error(s);
+00155   }
+00156     bool hasChanged = false;
+00157     for (unsigned i=0; i<_eo1.size(); i++)
+00158       {
+00159         if ( (_eo1[i]!=_eo2[i]) && (eo::rng.filp(rate)) )
+00160         {
+00161           _eo1[i] = _eo2[i];
+00162           hasChanged = true;
+00163         }
+00164       }
+00165     return hasChanged;
+00166   }
+00167 
+00169   virtual string className() const { return "eoFlOrUniformBinOp"; }
+00170 
+00171 private:
+00172   double rate;
+00173 };
+00174 
+00176 //                        eoFlOr1ptBinOp
+00178 
+00180 template <class EOT>
+00181 class eoFlOr1ptBinOp : public eoBinOp<EOT>
+00182 {
+00183 public :
+00184 
+00185   typedef typename EOT::AtomType AtomType;
+00186 
+00188   eoVlUniformBinOp() {}
+00189 
+00191   bool operator()(EOT & _eo1, EOT & _eo2)
+00192   {
+00193     unsigned i;
+00194     Atom tmp;
+00195     if (_eo1.size() != _eo2.size())
+00196       {
+00197         string s = "Operand size don't match in " + className();
+00198         throw runtime_error(s);
+00199   }
+00200     bool hasChanged = false;
+00201     unsigned where = eo::rng.random(_eo1.size()-1);
+00202     for (unsigned i=where+1; i<_eo1.size(); i++)
+00203       {
+00204         if ( (_eo1[i]!=_eo2[i]) )
+00205         {
+00206           _eo1[i] = _eo2[i];
+00207           hasChanged = true;
+00208         }
+00209       }
+00210     return hasChanged;
+00211   }
+00212 
+00214   virtual string className() const { return "eoFlOr1ptBinOp"; }
+00215 
+00216 };
+00217 
+00218 
+00219 #endif
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_fl_or_mon_op_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_fl_or_mon_op_8h-source.html new file mode 100644 index 000000000..c639709ca --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_fl_or_mon_op_8h-source.html @@ -0,0 +1,113 @@ + + +EO: eoFlOrMonOp.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoFlOrMonOp.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoFlOrMonOp.h
+00005 // (c) Marc Schoenauer - Maarten Keijzer 2000-2003
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: Marc.Schoenauer@polytechnique.fr
+00022              mkeijzer@cs.vu.nl
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _eoFlOrMonOp_h
+00027 #define _eoFlOrMonOp_h
+00028 
+00029 #include <eoFunctor.h>
+00030 #include <eoOp.h>
+00031 #include <eoInit.h>
+00032 
+00044 template <class EOT>
+00045 class eoFlOrAllMutation : public eoMonOp<EOT>
+00046 {
+00047 public :
+00048 
+00049   typedef typename EOT::AtomType AtomType;
+00050 
+00052   eoFlOrAllMutation(eoMonOp<AtomType> & _atomMutation, double _rate=1.0) :
+00053     atomMutation(_atomMutation), rate(_rate) {}
+00054 
+00056   bool operator()(EOT & _eo)
+00057   {
+00058     bool modified=false;
+00059     for (unsigned i=0; i<_eo.size(); i++)
+00060       if (eo::rng.flip(rate))
+00061         if (atomMutation(_eo[i]))
+00062           modified = true;
+00063 
+00064     return modified;
+00065   }
+00066 
+00068   virtual std::string className() const 
+00069   { 
+00070     return "eoFlOrAllMutation(" + atomMutation.className() + ")";
+00071   }
+00072 
+00073 private:
+00074   eoMonOp<AtomType> & atomMutation; // the atom mutation
+00075   double rate;                     // the mutation rate PER ATOM
+00076 };
+00077 
+00081 template <class EOT>
+00082 class eoFlOrKMutation : public eoMonOp<EOT>
+00083 {
+00084 public :
+00085 
+00086   typedef typename EOT::AtomType AtomType;
+00087 
+00089   eoFlOrKMutation(eoMonOp<AtomType> & _atomMutation, unsigned _nb=1) :
+00090     nb(_nb), atomMutation(_atomMutation) {}
+00091 
+00092 
+00094   bool operator()(EOT & _eo)
+00095   {
+00096     bool modified=false;
+00097     for (unsigned k=0; k<nb; k++)
+00098       {
+00099         unsigned i = rng.random(_eo.size()); // we don't test for duplicates...
+00100         if (atomMutation(_eo[i]))
+00101           modified = true;
+00102       }
+00103     return modified;
+00104   }
+00105 
+00107   virtual std::string className() const
+00108   { 
+00109     return "eoFlOrKMutation(" + atomMutation.className() + ")";
+00110   }
+00111 
+00112 private:
+00113   unsigned nb;                     // the number of atoms to mutate
+00114   eoMonOp<AtomType> & atomMutation; // the atom mutation
+00115 };
+00116 
+00117 
+00118 #endif
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_fl_or_quad_op_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_fl_or_quad_op_8h-source.html new file mode 100644 index 000000000..646eaf547 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_fl_or_quad_op_8h-source.html @@ -0,0 +1,198 @@ + + +EO: eoFlOrQuadOp.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoFlOrQuadOp.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoFlOrQuadOp.h
+00005 // (c) Marc Schoenauer - Maarten Keijzer 2000-2003
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: Marc.Schoenauer@polytechnique.fr
+00022              mkeijzer@cs.vu.nl
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _eoFlOrQuadOp_h
+00027 #define _eoFlOrQuadOp_h
+00028 
+00029 #include <eoFunctor.h>
+00030 #include <eoOp.h>
+00031 
+00039 
+00040 //                        eoFlOrAllAtomQuadOp
+00042 
+00045 template <class EOT>
+00046 class eoFlOrAllAtomQuadOp : public eoQuadOp<EOT>
+00047 {
+00048 public :
+00049 
+00050   typedef typename EOT::AtomType AtomType;
+00051 
+00053   eoFlOrAllAtomQuadOp( eoQuadOp<AtomType>& _op, double _rate = 1):
+00054     op(_op), rate( _rate ) {}
+00055 
+00057   bool operator()(EOT & _eo1, EOT & _eo2)
+00058   {
+00059     bool changed = false;
+00060     for ( unsigned i = 0; i < _eo1.size(); i++ ) {
+00061       if ( rng.flip( rate ) ) {
+00062         bool changedHere = op( _eo1[i], _eo2[i] );
+00063         changed |= changedHere;
+00064       }
+00065     }
+00066     return changed;
+00067   }
+00068 
+00070   virtual string className() const { return "eoFlOrAllAtomQuadOp"; }
+00071 
+00072 private:
+00073   double rate;
+00074   eoQuadOp<AtomType> & op;
+00075 };
+00076 
+00078 //                        eoFlOrKAtomQuadOp
+00080 
+00083 template <class EOT>
+00084 class eoFlOrKAtomQuadOp : public eoQuadOp<EOT>
+00085 {
+00086 public :
+00087 
+00088   typedef typename EOT::AtomType AtomType;
+00089 
+00091   eoFlOrAtomQuadOp( eoQuadOp<AtomType>& _op, unsigned _k = 1):
+00092     op(_op), k( _k ) {}
+00093 
+00095   bool operator()(EOT & _eo1, const EOT & _eo2)
+00096   {
+00097     if (_eo1.size() != _eo2.size())
+00098       {
+00099         string s = "Operand size don't match in " + className();
+00100         throw runtime_error(s);
+00101       }
+00102 
+00103     bool changed = false;
+00104     for ( unsigned i = 0; i < k; i++ ) // TODO: check that we don't do twice the same
+00105       {
+00106         unsigned where = eo::rng.random(_eo1.size());
+00107         bool changedHere = op( _eo1[where], _eo2[where] );
+00108         changed |= changedHere;
+00109       }
+00110     return changed;
+00111   }
+00112 
+00114   virtual string className() const { return "eoFlOrKAtomQuadOp"; }
+00115 
+00116 private:
+00117   unsigned k;
+00118   eoQuadOp<AtomType> & op;
+00119 };
+00120 
+00121 
+00123 //                        eoFlOrUniformQuadOp
+00125 
+00126 template <class EOT>
+00127 class eoFlOrUniformQuadOp : public eoQuadOp<EOT>
+00128 {
+00129 public :
+00130 
+00131   typedef typename EOT::AtomType AtomType;
+00132 
+00134   eoVlUniformQuadOp(double _rate=0.5) : eoQuadOp<EOT>(_size),
+00135     rate(_rate) {}
+00136 
+00138   bool operator()(EOT & _eo1, EOT & _eo2)
+00139   {
+00140     unsigned i;
+00141     Atom tmp;
+00142     if (_eo1.size() != _eo2.size())
+00143       {
+00144         string s = "Operand size don't match in " + className();
+00145         throw runtime_error(s);
+00146   }
+00147     bool hasChanged = false;
+00148     for (unsigned i=0; i<_eo1.size(); i++)
+00149       {
+00150         if ( (_eo1[i]!=_eo2[i]) && (eo::rng.filp(rate)) )
+00151         {
+00152           tmp = _eo1[i];
+00153           _eo1[i] = _eo2[i];
+00154           _eo2[i] = tmp;
+00155           hasChanged = true;
+00156         }
+00157       }
+00158     return hasChanged;
+00159   }
+00160 
+00162   virtual string className() const { return "eoFlOrUniformQuadOp"; }
+00163 
+00164 private:
+00165   double rate;
+00166 };
+00167 
+00169 //                        eoFlOr1ptQuadOp
+00171 
+00172 template <class EOT>
+00173 class eoFlOr1ptQuadOp : public eoQuadOp<EOT>
+00174 {
+00175 public :
+00176 
+00177   typedef typename EOT::AtomType AtomType;
+00178 
+00180   eoVlUniformQuadOp() {}
+00181 
+00183   bool operator()(EOT & _eo1, EOT & _eo2)
+00184   {
+00185     unsigned i;
+00186     Atom tmp;
+00187     if (_eo1.size() != _eo2.size())
+00188       {
+00189         string s = "Operand size don't match in " + className();
+00190         throw runtime_error(s);
+00191   }
+00192     bool hasChanged = false;
+00193     unsigned where = eo::rng.random(_eo1.size()-1);
+00194     for (unsigned i=where+1; i<_eo1.size(); i++)
+00195       {
+00196         if ( (_eo1[i]!=_eo2[i]) )
+00197         {
+00198           tmp = _eo1[i];
+00199           _eo1[i] = _eo2[i];
+00200           _eo2[i] = tmp;
+00201           hasChanged = true;
+00202         }
+00203       }
+00204     return hasChanged;
+00205   }
+00206 
+00208   virtual string className() const { return "eoFlOr1ptQuadOp"; }
+00209 
+00210 };
+00211 
+00212 
+00213 #endif
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_functor_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_functor_8h-source.html new file mode 100644 index 000000000..48a37dcd7 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_functor_8h-source.html @@ -0,0 +1,127 @@ + + +EO: eoFunctor.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoFunctor.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoFunctor.h
+00005 // (c) Maarten Keijzer 2000
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              mak@dhi.dk
+00023     CVS Info: $Date: 2004/12/01 09:22:48 $ $Header: /cvsroot/eodev/eo/src/eoFunctor.h,v 1.7 2004/12/01 09:22:48 evomarc Exp $ $Author: evomarc $ 
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoFunctor_h
+00028 #define _eoFunctor_h
+00029 
+00030 #include <functional>
+00031 
+00046 class eoFunctorBase
+00047 {
+00048 public :
+00050     virtual ~eoFunctorBase() {}
+00051 
+00053     struct procedure_tag {};
+00055     struct unary_function_tag {};
+00057     struct binary_function_tag {};
+00058 };
+00059 
+00067 template <class R>
+00068 class eoF : public eoFunctorBase
+00069 {
+00070 public :
+00071 
+00073     virtual ~eoF() {}
+00074 
+00076     typedef R result_type;
+00077 
+00079     virtual R operator()() = 0;
+00080 
+00082     static eoFunctorBase::procedure_tag functor_category()
+00083     {
+00084         return eoFunctorBase::procedure_tag();
+00085     }
+00086 };
+00087 
+00094 template<class R>
+00095 eoFunctorBase::procedure_tag functor_category(const eoF<R>&)
+00096 {
+00097     return eoFunctorBase::procedure_tag();
+00098 }
+00099 
+00107 template <class A1, class R>
+00108 class eoUF : public eoFunctorBase, public std::unary_function<A1, R>
+00109 {
+00110 public :
+00111 
+00113     virtual ~eoUF() {}
+00114 
+00116     virtual R operator()(A1) = 0;
+00117 
+00119     static eoFunctorBase::unary_function_tag functor_category()
+00120     {
+00121         return eoFunctorBase::unary_function_tag();
+00122     }
+00123 };
+00124 
+00130 template<class R, class A1>
+00131 eoFunctorBase::unary_function_tag functor_category(const eoUF<A1, R>&)
+00132 {
+00133     return eoFunctorBase::unary_function_tag();
+00134 }
+00135 
+00136 
+00144 template <class A1, class A2, class R>
+00145 class eoBF : public eoFunctorBase, public std::binary_function<A1, A2, R>
+00146 {
+00147 public :
+00149     virtual ~eoBF() {}
+00150     
+00151     //typedef R result_type;
+00152     //typedef A1 first_argument_type;
+00153     //typedef A2 second_argument_type;
+00154 
+00156     virtual R operator()(A1, A2) = 0;
+00157 
+00159     static eoFunctorBase::binary_function_tag functor_category()
+00160     {
+00161         return eoFunctorBase::binary_function_tag();
+00162     }
+00163 };
+00164 
+00170 template<class R, class A1, class A2>
+00171 eoFunctorBase::binary_function_tag functor_category(const eoBF<A1, A2, R>&)
+00172 {
+00173     return eoFunctorBase::binary_function_tag();
+00174 }
+00175 
+00176 
+00177 #endif
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_functor_store_8cpp-source.html b/trunk/paradiseo-eo/doc/html/eo_functor_store_8cpp-source.html new file mode 100644 index 000000000..d05ea35eb --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_functor_store_8cpp-source.html @@ -0,0 +1,30 @@ + + +EO: eoFunctorStore.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoFunctorStore.cpp

00001 #ifdef _MSC_VER
+00002 // to avoid long name warnings
+00003 #pragma warning(disable:4786)
+00004 #endif
+00005 
+00006 #include <eoFunctorStore.h>
+00007 #include <eoFunctor.h>
+00008 
+00009 
+00011 eoFunctorStore::~eoFunctorStore()
+00012 {
+00013     for(size_t i = 0; i < vec.size(); ++i) {
+00014         delete vec[i];
+00015     }
+00016 }
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_functor_store_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_functor_store_8h-source.html new file mode 100644 index 000000000..508aac673 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_functor_store_8h-source.html @@ -0,0 +1,76 @@ + + +EO: eoFunctorStore.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoFunctorStore.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoFunctorStore.h
+00005 // (c) Maarten Keijzer 2000, GeNeura Team, 2000
+00006 /*
+00007   This library is free software; you can redistribute it and/or
+00008   modify it under the terms of the GNU Lesser General Public
+00009   License as published by the Free Software Foundation; either
+00010   version 2 of the License, or (at your option) any later version.
+00011 
+00012   This library is distributed in the hope that it will be useful,
+00013   but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015   Lesser General Public License for more details.
+00016 
+00017   You should have received a copy of the GNU Lesser General Public
+00018   License along with this library; if not, write to the Free Software
+00019   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021   Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022   Marc.Schoenauer@polytechnique.fr
+00023   mak@dhi.dk
+00024 */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoFunctorStore_h
+00028 #define _eoFunctorStore_h
+00029 
+00030 #include <vector>
+00031 
+00032 class eoFunctorBase;
+00033 
+00039 class eoFunctorStore
+00040 {
+00041 public:
+00042 
+00044     eoFunctorStore() {}
+00045 
+00046     // virtual destructor so we don't need to define it in derived classes
+00047     virtual ~eoFunctorStore();
+00048 
+00050     template <class Functor>
+00051     Functor& storeFunctor(Functor* r)
+00052         {
+00053             // If the compiler complains about the following line,
+00054             // check if you really are giving it a pointer to an
+00055             // eoFunctorBase derived object
+00056             vec.push_back(r);
+00057             return *r;
+00058         }
+00059 
+00060 private :
+00061 
+00063     eoFunctorStore(const eoFunctorStore&);
+00064 
+00066     eoFunctorStore operator=(const eoFunctorStore&);
+00067     std::vector<eoFunctorBase*> vec;
+00068 };
+00069 
+00070 #endif
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_g3_replacement_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_g3_replacement_8h-source.html new file mode 100644 index 000000000..475826a4a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_g3_replacement_8h-source.html @@ -0,0 +1,69 @@ + + +EO: eoG3Replacement.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoG3Replacement.h

00001 
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _eoG3Replacement_h
+00027 #define _eoG3Replacement_h
+00028 
+00029 
+00030 //-----------------------------------------------------------------------------
+00031 #include <eoPop.h>
+00032 #include <eoFunctor.h>
+00033 #include <eoMerge.h>
+00034 #include <eoReduce.h>
+00035 #include <utils/eoHowMany.h>
+00036 #include <eoReduceSplit.h>
+00037 //-----------------------------------------------------------------------------
+00038 
+00049 template <class EOT>
+00050 class eoG3Replacement : public eoReplacement<EOT>
+00051 {
+00052 public:
+00053   eoG3Replacement(eoHowMany _howManyEliminatedParents = eoHowMany(2, false)) :
+00054     // split truncates the parents and returns eliminated parents
+00055     split(_howManyEliminatedParents, true), 
+00056     // reduce truncates the offpsring and does not return eliminated guys
+00057     reduce(-_howManyEliminatedParents, false) 
+00058   {}
+00059     
+00060     void operator()(eoPop<EOT> & _parents, eoPop<EOT> & _offspring)
+00061     {
+00062       eoPop<EOT> temp;
+00063       split(_parents, temp);
+00064       unsigned toKeep = temp.size(); // how many to keep from merged populations
+00065       // merge temp into offspring
+00066       plus(temp, _offspring);      // add temp to _offspring (a little inconsistent!)
+00067       
+00068       // reduce merged
+00069       reduce(_offspring, temp);    // temp dummy arg. will not be modified
+00070       // minimla check:
+00071       if (_offspring.size() != toKeep)
+00072         {
+00073           std::cerr << "Les tailles " << _offspring.size() << " " << toKeep << std::endl;
+00074         throw std::runtime_error("eoG3Replacement: wrong number of remaining offspring");
+00075         }
+00076       // and put back into _parents
+00077       plus(_offspring, _parents);      
+00078     }
+00079 
+00080 private:
+00081   eoLinearTruncateSplit<EOT> split; // few parents to truncate -> linear 
+00082   eoTruncateSplit<EOT> reduce;     // supposedly many offspring to truncate
+00083   eoPlus<EOT> plus;
+00084 };
+00085 
+00086 #endif
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_gen_continue_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_gen_continue_8h-source.html new file mode 100644 index 000000000..c30bb617d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_gen_continue_8h-source.html @@ -0,0 +1,108 @@ + + +EO: eoGenContinue.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoGenContinue.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoGenContinue.h
+00005 // (c) GeNeura Team, 1999
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022  */
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef _eoGenContinue_h
+00026 #define _eoGenContinue_h
+00027 
+00028 #include <eoContinue.h>
+00029 #include <utils/eoParam.h>
+00033 template< class EOT>
+00034 class eoGenContinue: public eoContinue<EOT>, public eoValueParam<unsigned>
+00035 {
+00036 public:
+00037 
+00039   eoGenContinue( unsigned long _totalGens)
+00040           : eoValueParam<unsigned>(0, "Generations", "Generations"),
+00041             repTotalGenerations( _totalGens ), 
+00042             thisGenerationPlaceHolder(0),
+00043             thisGeneration(thisGenerationPlaceHolder), verbose(true) {};
+00044   
+00046   eoGenContinue( unsigned long _totalGens, unsigned long& _currentGen)
+00047           : eoValueParam<unsigned>(0, "Generations", "Generations"),
+00048             repTotalGenerations( _totalGens ), 
+00049             thisGenerationPlaceHolder(0),
+00050             thisGeneration(_currentGen), verbose(true){};
+00051   
+00054   virtual bool operator() ( const eoPop<EOT>& _vEO ) {
+00055     thisGeneration++;
+00056     value() = thisGeneration;
+00057     //    std::cout << " [" << thisGeneration << "] ";
+00058     if (thisGeneration >= repTotalGenerations) 
+00059       {
+00060           if (verbose)
+00061             std::cout << "STOP in eoGenContinue: Reached maximum number of generations [" << thisGeneration << "/" << repTotalGenerations << "]\n";
+00062         return false;
+00063       }
+00064     return true;
+00065   }
+00066   
+00069   virtual void totalGenerations( unsigned long _tg ) { 
+00070           repTotalGenerations = _tg; 
+00071           thisGeneration = 0;
+00072         };
+00073   
+00075   virtual unsigned long totalGenerations( ) 
+00076   {  
+00077     return repTotalGenerations; 
+00078   };
+00079     
+00080   
+00081   virtual std::string className(void) const { return "eoGenContinue"; }
+00082 
+00083   void readFrom (std :: istream & __is) {
+00084     
+00085     __is >> thisGeneration; /* Loading the number of generations counted */
+00086   }
+00087   
+00088   void printOn (std :: ostream & __os) const {
+00089     
+00090     __os << thisGeneration << std :: endl; /* Saving the number of generations counted */   
+00091   }
+00092 
+00093 private:
+00094   unsigned long repTotalGenerations;
+00095   unsigned long thisGenerationPlaceHolder;
+00096   unsigned long& thisGeneration;
+00097   
+00098 public:
+00099   bool verbose; // allows to turn off annoying message to cout
+00100 };
+00101 
+00102 #endif
+00103 
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_gen_op_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_gen_op_8h-source.html new file mode 100644 index 000000000..269b45d6f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_gen_op_8h-source.html @@ -0,0 +1,177 @@ + + +EO: eoGenOp.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoGenOp.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoGenOp.h
+00005 // (c) Maarten Keijzer and Marc Schoenauer, 2001
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: mak@dhi.dk
+00022              Marc.Schoenauer@polytechnique.fr
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _eoGenOp_H
+00027 #define _eoGenOp_H
+00028 
+00029 #include <eoOp.h>
+00030 #include <eoPopulator.h>
+00031 #include <eoFunctorStore.h>
+00032 #include <assert.h>
+00033 
+00044 
+00056 template <class EOT>
+00057 class eoGenOp : public eoOp<EOT>, public eoUF<eoPopulator<EOT> &, void>
+00058 {
+00059   public :
+00061   eoGenOp(): eoOp<EOT>( eoOp<EOT>::general ) {}
+00062 
+00066   virtual unsigned max_production(void) = 0;
+00067 
+00068   virtual std::string className() const = 0;
+00069     void operator()(eoPopulator<EOT>& _pop)
+00070     {
+00071     _pop.reserve(max_production());
+00072       apply(_pop);
+00073     }
+00074 
+00075 
+00076   protected :
+00079     virtual void apply(eoPopulator<EOT>& _pop) = 0;
+00080 };
+00081 
+00082 
+00084 template <class EOT>
+00085 class eoMonGenOp : public eoGenOp<EOT>
+00086 {
+00087    public:
+00088     eoMonGenOp(eoMonOp<EOT>& _op) : op(_op) {}
+00089 
+00090     unsigned max_production(void) { return 1; }
+00091 
+00092     void apply(eoPopulator<EOT>& _it)
+00093     {
+00094       if (op(*_it))
+00095         (*_it).invalidate();  // look how simple
+00096 
+00097     }
+00098   virtual std::string className() const {return op.className();}
+00099    private :
+00100     eoMonOp<EOT>& op;
+00101 };
+00102 
+00106 template <class EOT>
+00107 class eoBinGenOp : public eoGenOp<EOT>
+00108 {
+00109    public:
+00110     eoBinGenOp(eoBinOp<EOT>& _op) : op(_op) {}
+00111 
+00112     unsigned max_production(void) { return 1; } 
+00113 
+00117     void apply(eoPopulator<EOT>& _pop)
+00118     {
+00119       EOT& a = *_pop;
+00120       const EOT& b = _pop.select();
+00121 
+00122       if (op(a, b))
+00123         a.invalidate();
+00124     }
+00125   virtual std::string className() const {return op.className();}
+00126 
+00127    private :
+00128     eoBinOp<EOT>& op;
+00129 };
+00130 
+00132 template <class EOT>
+00133 class eoSelBinGenOp : public eoGenOp<EOT>
+00134 {
+00135    public:
+00136     eoSelBinGenOp(eoBinOp<EOT>& _op, eoSelectOne<EOT>& _sel) :
+00137       op(_op), sel(_sel) {}
+00138 
+00139     unsigned max_production(void) { return 1; }
+00140 
+00141     void apply(eoPopulator<EOT>& _pop)
+00142     { // _pop.source() gets the original population, an eoVecOp can make use of this as well
+00143       if (op(*_pop, sel(_pop.source())))
+00144         (*_pop).invalidate();
+00145     }
+00146   virtual std::string className() const {return op.className();}
+00147 
+00148    private :
+00149     eoBinOp<EOT>& op;
+00150     eoSelectOne<EOT>& sel;
+00151 };
+00152 
+00153 
+00156 template <class EOT>
+00157 class eoQuadGenOp : public eoGenOp<EOT>
+00158 {
+00159    public:
+00160     eoQuadGenOp(eoQuadOp<EOT>& _op) : op(_op) {}
+00161 
+00162     unsigned max_production(void) { return 2; }
+00163 
+00164     void apply(eoPopulator<EOT>& _pop)
+00165     {
+00166       EOT& a = *_pop;
+00167       EOT& b = *++_pop; 
+00168       
+00169       
+00170       if(op(a, b))
+00171       {
+00172         a.invalidate();
+00173         b.invalidate();
+00174       }
+00175 
+00176    }
+00177   virtual std::string className() const {return op.className();}
+00178 
+00179    private :
+00180     eoQuadOp<EOT>& op;
+00181 };
+00182 
+00207     template <class EOT>
+00208     eoGenOp<EOT>& wrap_op(eoOp<EOT>& _op, eoFunctorStore& _store)
+00209     {
+00210       switch(_op.getType())
+00211       {
+00212         case eoOp<EOT>::unary     : return _store.storeFunctor(new eoMonGenOp<EOT>(static_cast<eoMonOp<EOT>&>(_op)));
+00213         case eoOp<EOT>::binary    : return _store.storeFunctor(new eoBinGenOp<EOT>(static_cast<eoBinOp<EOT>&>(_op)));
+00214         case eoOp<EOT>::quadratic : return _store.storeFunctor(new eoQuadGenOp<EOT>(static_cast<eoQuadOp<EOT>&>(_op)));
+00215         case eoOp<EOT>::general   : return static_cast<eoGenOp<EOT>&>(_op);
+00216       }
+00217 
+00218       assert(false);
+00219       return static_cast<eoGenOp<EOT>&>(_op);
+00220     }
+00221 
+00222 #endif
+00223 
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_general_breeder_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_general_breeder_8h-source.html new file mode 100644 index 000000000..33d2a3e5d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_general_breeder_8h-source.html @@ -0,0 +1,99 @@ + + +EO: eoGeneralBreeder.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoGeneralBreeder.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoGeneralBreeder.h 
+00005 // (c) Maarten Keijzer and Marc Schoenauer, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: mkeijzer@dhi.dk
+00022              Marc.Schoenauer@polytechnique.fr
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef eoGeneralBreeder_h
+00027 #define eoGeneralBreeder_h
+00028 
+00029 //-----------------------------------------------------------------------------
+00030 
+00031 /*****************************************************************************
+00032  * eoGeneralBreeder: transforms a population using the generalOp construct.
+00033  *****************************************************************************/
+00034 
+00035 #include <eoOp.h>
+00036 #include <eoGenOp.h>
+00037 #include <eoPopulator.h>
+00038 #include <eoSelectOne.h>
+00039 #include <eoBreed.h>
+00040 #include <utils/eoHowMany.h>
+00041 
+00045 template<class EOT>
+00046 class eoGeneralBreeder: public eoBreed<EOT>
+00047 {
+00048  public:
+00056   eoGeneralBreeder(
+00057           eoSelectOne<EOT>& _select,
+00058           eoGenOp<EOT>& _op,
+00059                 double  _rate=1.0,
+00060           bool _interpret_as_rate = true) :
+00061       select( _select ), op(_op),  howMany(_rate, _interpret_as_rate) {}
+00062 
+00069   eoGeneralBreeder(
+00070           eoSelectOne<EOT>& _select,
+00071           eoGenOp<EOT>& _op,
+00072           eoHowMany _howMany ) :
+00073       select( _select ), op(_op),  howMany(_howMany) {}
+00074 
+00080   void operator()(const eoPop<EOT>& _parents, eoPop<EOT>& _offspring)
+00081     {
+00082       unsigned target = howMany(_parents.size());
+00083 
+00084       _offspring.clear();
+00085       eoSelectivePopulator<EOT> it(_parents, _offspring, select);
+00086 
+00087       while (_offspring.size() < target)
+00088             {
+00089               op(it);
+00090               ++it;
+00091             }
+00092 
+00093       _offspring.resize(target);   // you might have generated a few more
+00094     }
+00095 
+00097   virtual std::string className() const { return "eoGeneralBreeder"; }
+00098 
+00099  private:
+00100   eoSelectOne<EOT>& select;
+00101   eoGenOp<EOT>& op;
+00102   eoHowMany howMany;
+00103 };
+00104 
+00105 #endif
+00106 
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_gnuplot1_d_monitor_8cpp-source.html b/trunk/paradiseo-eo/doc/html/eo_gnuplot1_d_monitor_8cpp-source.html new file mode 100644 index 000000000..d58d7076d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_gnuplot1_d_monitor_8cpp-source.html @@ -0,0 +1,100 @@ + + +EO: eoGnuplot1DMonitor.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoGnuplot1DMonitor.cpp

00001 //-----------------------------------------------------------------------------
+00002 // eoGnuplot1DMonitor.h
+00003 // (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000
+00004 /*
+00005    This library is free software; you can redistribute it and/or
+00006    modify it under the terms of the GNU Lesser General Public
+00007    License as published by the Free Software Foundation; either
+00008    version 2 of the License, or (at your option) any later version.
+00009 
+00010    This library is distributed in the hope that it will be useful,
+00011    but WITHOUT ANY WARRANTY; without even the implied warranty of
+00012    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00013    Lesser General Public License for more details.
+00014 
+00015    You should have received a copy of the GNU Lesser General Public
+00016    License along with this library; if not, write to the Free Software
+00017    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00018 
+00019    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00020              Marc.Schoenauer@polytechnique.fr
+00021              mkeijzer@dhi.dk
+00022  */
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 
+00026 #ifdef HAVE_CONFIG_H
+00027 #include <config.h>
+00028 #endif
+00029 
+00030 #include <sstream>
+00031 
+00032 #include "utils/eoGnuplot1DMonitor.h"
+00033 #include "utils/eoParam.h"
+00034 
+00035 
+00036 eoMonitor& eoGnuplot1DMonitor::operator() (void)
+00037 {
+00038     // update file using the eoFileMonitor
+00039     eoFileMonitor::operator()();
+00040 #ifdef HAVE_GNUPLOT
+00041     // sends plot order to gnuplot
+00042     // assumes successive plots will have same nb of columns!!!
+00043     if (firstTime)
+00044     {
+00045         FirstPlot();
+00046         firstTime = false;
+00047     }
+00048     else
+00049     {
+00050         if( gpCom ) {
+00051             PipeComSend( gpCom, "replot\n" );
+00052         }
+00053     }
+00054 #endif
+00055     return *this;
+00056 }
+00057 
+00058 
+00059 
+00060 void eoGnuplot1DMonitor::FirstPlot()
+00061 {
+00062     if (this->vec.size() < 2)
+00063     {
+00064         throw std::runtime_error("Must have some stats to plot!\n");
+00065     }
+00066 #ifdef HAVE_GNUPLOT
+00067     std::ostringstream os;
+00068     os << "plot";
+00069     for (unsigned i=1; i<this->vec.size(); i++) {
+00070         os << " '" << getFileName().c_str() <<
+00071             "' using 1:" << i+1 << " title '" << (this->vec[i])->longName() << "' with lines" ;
+00072         if (i<this->vec.size()-1)
+00073             os << ", ";
+00074     }
+00075     os << '\n';
+00076     PipeComSend( gpCom, os.str().c_str());
+00077 #endif
+00078 }
+00079 
+00080 
+00081 
+00082 // Local Variables:
+00083 // c-file-style: "Stroustrup"
+00084 // fill-column: 80
+00085 // End:
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_gnuplot1_d_monitor_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_gnuplot1_d_monitor_8h-source.html new file mode 100644 index 000000000..123368749 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_gnuplot1_d_monitor_8h-source.html @@ -0,0 +1,83 @@ + + +EO: eoGnuplot1DMonitor.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoGnuplot1DMonitor.h

00001 //-----------------------------------------------------------------------------
+00002 // eoGnuplot1DMonitor.h
+00003 // (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000
+00004 /*
+00005    This library is free software; you can redistribute it and/or
+00006    modify it under the terms of the GNU Lesser General Public
+00007    License as published by the Free Software Foundation; either
+00008    version 2 of the License, or (at your option) any later version.
+00009 
+00010    This library is distributed in the hope that it will be useful,
+00011    but WITHOUT ANY WARRANTY; without even the implied warranty of
+00012    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00013    Lesser General Public License for more details.
+00014 
+00015    You should have received a copy of the GNU Lesser General Public
+00016    License along with this library; if not, write to the Free Software
+00017    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00018 
+00019    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00020              Marc.Schoenauer@polytechnique.fr
+00021              mkeijzer@dhi.dk
+00022  */
+00023 //-----------------------------------------------------------------------------
+00024 #ifndef EO_eoGnuplot1DMonitor_H
+00025 #define EO_eoGnuplot1DMonitor_H
+00026 
+00027 #include <fstream>
+00028 #include <string>
+00029 
+00030 #include "eoObject.h"
+00031 #include "utils/eoFileMonitor.h"
+00032 #include "utils/eoGnuplot.h"
+00033 #include "utils/pipecom.h"
+00034 
+00047 class eoGnuplot1DMonitor : public eoFileMonitor, public eoGnuplot
+00048 {
+00049 public:
+00050 
+00051   // this "using" directive generates a compiler internal error in GCC 4.0.0 ...
+00052   // it's been removed, and the only call to vec was replaced by this->vec in eoGnuplot1DMonitor.cpp
+00053   //    using eoMonitor::vec;
+00054 
+00056     eoGnuplot1DMonitor(std::string _filename, bool _top=false) :
+00057         eoFileMonitor(_filename, " "),
+00058         eoGnuplot(_filename,(_top?"":"set key bottom"))
+00059         {}
+00060 
+00062     virtual ~eoGnuplot1DMonitor(){}
+00063 
+00064     virtual eoMonitor& operator()();
+00065 
+00066     virtual void FirstPlot();
+00067 
+00069     virtual std::string className() const
+00070         { return "eoGnuplot1DMonitor"; }
+00071 };
+00072 
+00073 
+00074 #endif // EO_eoGnuplot1DMonitor_H
+00075 
+00076 
+00077 
+00078 // Local Variables:
+00079 // c-file-style: "Stroustrup"
+00080 // comment-column: 35
+00081 // fill-column: 80
+00082 // mode: C++
+00083 // End:
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_gnuplot1_d_snapshot_8cpp-source.html b/trunk/paradiseo-eo/doc/html/eo_gnuplot1_d_snapshot_8cpp-source.html new file mode 100644 index 000000000..b6eea2583 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_gnuplot1_d_snapshot_8cpp-source.html @@ -0,0 +1,47 @@ + + +EO: eoGnuplot1DSnapshot.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoGnuplot1DSnapshot.cpp

00001 #ifdef HAVE_CONFIG_H
+00002 #include <config.h>
+00003 #endif
+00004 
+00005 #include "eoGnuplot1DSnapshot.h"
+00006 
+00007 
+00008 
+00009 eoMonitor& eoGnuplot1DSnapshot::operator()()
+00010 {
+00011     // update file using the eoFileMonitor method
+00012     eoFileSnapshot::operator()();
+00013 
+00014 #ifdef HAVE_GNUPLOT
+00015     // sends plot order to gnuplot
+00016     std::ostringstream os;
+00017     os << "set title 'Gen. " << getCounter() << "'; plot '"
+00018         // mk: had to use getFilename().c_str(),
+00019         // because it seems the string(stream) lib is screwed in gcc3.2
+00020        << getFileName().c_str() << "' notitle with points ps " << pointSize
+00021        << std::endl;
+00022     PipeComSend(gpCom, os.str().c_str());
+00023 #endif
+00024     return *this;
+00025 }
+00026 
+00027 
+00028 
+00029 // Local Variables:
+00030 // c-file-style: "Stroustrup"
+00031 // fill-column: 80
+00032 // End:
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_gnuplot1_d_snapshot_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_gnuplot1_d_snapshot_8h-source.html new file mode 100644 index 000000000..9ae9c3451 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_gnuplot1_d_snapshot_8h-source.html @@ -0,0 +1,123 @@ + + +EO: eoGnuplot1DSnapshot.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoGnuplot1DSnapshot.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoGnuplot1DSnapshot.h
+00005 // (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000
+00006 /*
+00007    This library is free software; you can redistribute it and/or
+00008    modify it under the terms of the GNU Lesser General Public
+00009    License as published by the Free Software Foundation; either
+00010    version 2 of the License, or (at your option) any later version.
+00011 
+00012    This library is distributed in the hope that it will be useful,
+00013    but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015    Lesser General Public License for more details.
+00016 
+00017    You should have received a copy of the GNU Lesser General Public
+00018    License along with this library; if not, write to the Free Software
+00019    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@inria.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 
+00028 #ifndef EO_eoGnuplot1DSnapshot_H
+00029 #define EO_eoGnuplot1DSnapshot_H
+00030 
+00031 #include <fstream>
+00032 #include <sstream>
+00033 #include <string>
+00034 
+00035 #include <eoObject.h>
+00036 #include "eoRealVectorBounds.h"
+00037 #include <utils/pipecom.h>
+00038 #include <utils/eoFileSnapshot.h>
+00039 #include <utils/eoGnuplot.h>
+00040 
+00051 class eoGnuplot1DSnapshot: public eoFileSnapshot, public eoGnuplot
+00052 {
+00053  public:
+00054     // Ctor
+00055   eoGnuplot1DSnapshot(std::string _dirname, unsigned _frequency = 1,
+00056                       std::string _filename = "gen", std::string _delim = " ",
+00057                       unsigned _counter = 0, bool _rmFiles = true) :
+00058       eoFileSnapshot(_dirname, _frequency, _filename, _delim, _counter, _rmFiles),
+00059       eoGnuplot(_filename,"set data style points"),
+00060       pointSize(5)
+00061   {}
+00062 
+00063     // Ctor
+00064   eoGnuplot1DSnapshot(std::string _dirname,  eoRealVectorBounds & _bounds,
+00065                        unsigned _frequency = 1, std::string _filename = "gen",
+00066                        std::string _delim = " ", unsigned _counter = 0, bool _rmFiles = true ) :
+00067       eoFileSnapshot(_dirname, _frequency, _filename, _delim, _counter, _rmFiles),
+00068       eoGnuplot(_filename,"set data style points"),
+00069       pointSize(5)
+00070   {
+00071     handleBounds(_bounds);
+00072   }
+00073     // Ctor
+00074   eoGnuplot1DSnapshot(eoFileSnapshot & _fSnapshot) :
+00075       eoFileSnapshot(_fSnapshot),
+00076       eoGnuplot(_fSnapshot.baseFileName(),"set data style points"),
+00077       pointSize(5)
+00078   {}
+00079 
+00080     // Ctor with range
+00081   eoGnuplot1DSnapshot(eoFileSnapshot & _fSnapshot, eoRealVectorBounds & _bounds) :
+00082       eoFileSnapshot(_fSnapshot),
+00083       eoGnuplot(_fSnapshot.baseFileName(),"set data style points"),
+00084       pointSize(5)
+00085   {
+00086     handleBounds(_bounds);
+00087   }
+00088 
+00089   // Dtor
+00090   virtual ~eoGnuplot1DSnapshot(){}
+00091 
+00092   virtual eoMonitor& operator()();
+00093 
+00095   virtual std::string className() const { return "eoGnuplot1DSnapshot"; }
+00096 
+00097   virtual void handleBounds(eoRealVectorBounds & _bounds)
+00098   {
+00099       std::ostringstream os;
+00100       os << "set autoscale\nset yrange [" ;
+00101       if (_bounds.isMinBounded(0))
+00102           os << _bounds.minimum(0);
+00103       os << ":" ;
+00104       if (_bounds.isMaxBounded(0))
+00105           os << _bounds.maximum(0);
+00106       os << "]\n";
+00107       gnuplotCommand(os.str());
+00108   }
+00109 
+00110   void setPointSize(unsigned  _pointSize)
+00111   { pointSize = _pointSize; }
+00112 
+00113 protected:
+00114 
+00115     unsigned pointSize;
+00116 };
+00117 
+00118 
+00119 #endif
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_gnuplot_8cpp-source.html b/trunk/paradiseo-eo/doc/html/eo_gnuplot_8cpp-source.html new file mode 100644 index 000000000..dbb604121 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_gnuplot_8cpp-source.html @@ -0,0 +1,113 @@ + + +EO: eoGnuplot.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoGnuplot.cpp

00001 //-----------------------------------------------------------------------------
+00002 // (c) Marc Schoenauer, 2001
+00003 // Copyright (C) 2005 Jochen Küpper
+00004 /*
+00005    This library is free software; you can redistribute it and/or modify it under
+00006    the terms of the GNU Lesser General Public License as published by the Free
+00007    Software Foundation; either version 2 of the License, or (at your option) any
+00008    later version.
+00009 
+00010    This library is distributed in the hope that it will be useful, but WITHOUT
+00011    ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
+00012    FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more
+00013    details.
+00014 
+00015    You should have received a copy of the GNU Lesser General Public License
+00016    along with this library; if not, write to the Free Software Foundation, Inc.,
+00017    59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+00018 
+00019    Contact: Marc.Schoenauer@polytechnique.fr
+00020  */
+00021 //-----------------------------------------------------------------------------
+00022 
+00023 #ifdef HAVE_CONFIG_H
+00024 #include <config.h>
+00025 #endif
+00026 
+00027 #include <sstream>
+00028 #include <stdexcept>
+00029 
+00030 #include "eoGnuplot.h"
+00031 
+00032 
+00033 unsigned eoGnuplot::numWindow=0;
+00034 
+00035 
+00036 
+00037 eoGnuplot::eoGnuplot(std::string _title, std::string _extra)
+00038     : firstTime(true)
+00039 {
+00040     initGnuPlot(_title, _extra);
+00041 }
+00042 
+00043 
+00044 
+00045 eoGnuplot::~eoGnuplot()
+00046 {
+00047 #ifdef HAVE_GNUPLOT
+00048     if( gpCom ) {
+00049         PipeComSend( gpCom, "quit\n" );
+00050         PipeComClose( gpCom );
+00051         gpCom =NULL;
+00052     }
+00053 #endif
+00054 }
+00055 
+00056 
+00057 
+00058 void eoGnuplot::gnuplotCommand(const char *_command)
+00059 {
+00060 #ifdef HAVE_GNUPLOT
+00061     if(gpCom) {
+00062         PipeComSend( gpCom, _command );
+00063         PipeComSend( gpCom, "\n" );
+00064     }
+00065 #endif
+00066 }
+00067 
+00068 
+00069 
+00070 void eoGnuplot::initGnuPlot(std::string _title, std::string _extra)
+00071 {
+00072 #ifdef HAVE_GNUPLOT
+00073     std::ostringstream os;
+00074     os << "250x150-0+" << 170 * numWindow++;
+00075     char *args[6];
+00076     args[0] = strdup( GNUPLOT_PROGRAM );
+00077     args[1] = strdup( "-geometry" );
+00078     args[2] = strdup( os.str().c_str());
+00079     args[3] = strdup( "-title" );
+00080     args[4] = strdup( _title.c_str() );
+00081     args[5] = 0;
+00082     gpCom = PipeComOpenArgv( GNUPLOT_PROGRAM, args );
+00083     if(! gpCom )
+00084         throw std::runtime_error("Cannot spawn gnuplot\n");
+00085     else {
+00086         PipeComSend( gpCom, "set grid\n" );
+00087         PipeComSend( gpCom, _extra.c_str() );
+00088         PipeComSend( gpCom, "\n" );
+00089     }
+00090 #endif
+00091 }
+00092 
+00093 
+00094 
+00095 // Local Variables:
+00096 // c-file-style: "Stroustrup"
+00097 // fill-column: 80
+00098 // End:
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_gnuplot_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_gnuplot_8h-source.html new file mode 100644 index 000000000..830333a9b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_gnuplot_8h-source.html @@ -0,0 +1,83 @@ + + +EO: eoGnuplot.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoGnuplot.h

00001 //-----------------------------------------------------------------------------
+00002 // eoGnuplot1DMonitor.h
+00003 // (c) Marc Schoenauer, 2001
+00004 /*
+00005    This library is free software; you can redistribute it and/or
+00006    modify it under the terms of the GNU Lesser General Public
+00007    License as published by the Free Software Foundation; either
+00008    version 2 of the License, or (at your option) any later version.
+00009 
+00010    This library is distributed in the hope that it will be useful,
+00011    but WITHOUT ANY WARRANTY; without even the implied warranty of
+00012    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00013    Lesser General Public License for more details.
+00014 
+00015    You should have received a copy of the GNU Lesser General Public
+00016    License along with this library; if not, write to the Free Software
+00017    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00018 
+00019    Contact: Marc.Schoenauer@polytechnique.fr
+00020  */
+00021 //-----------------------------------------------------------------------------
+00022 #ifndef EO_eoGnuplot_H
+00023 #define EO_eoGnuplot_H
+00024 
+00025 #include <string>
+00026 
+00027 #include "pipecom.h"
+00028 
+00029 
+00038 class eoGnuplot
+00039 {
+00040 public:
+00041 
+00047     eoGnuplot(std::string _title, std::string _extra = std::string(""));
+00048 
+00053     virtual ~eoGnuplot();
+00054 
+00056     virtual std::string className() const
+00057         { return "eoGnuplot"; }
+00058 
+00060     void gnuplotCommand(const char * _command);
+00061 
+00066     void gnuplotCommand(std::string _command)
+00067         { gnuplotCommand(_command.c_str()); }
+00068 
+00069 
+00070 protected:
+00071 
+00077     void initGnuPlot(std::string _title, std::string _extra);
+00078 
+00080     bool firstTime;
+00081 
+00083     PCom *gpCom;
+00084 
+00086     static unsigned numWindow;
+00087 };
+00088 
+00089 
+00090 #endif // EO_eoGnuplot_H
+00091 
+00092 
+00093 
+00094 // Local Variables:
+00095 // c-file-style: "Stroustrup"
+00096 // comment-column: 35
+00097 // fill-column: 80
+00098 // mode: C++
+00099 // End:
+
Generated on Thu Oct 19 05:06:35 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_how_many_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_how_many_8h-source.html new file mode 100644 index 000000000..2a7170a5a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_how_many_8h-source.html @@ -0,0 +1,153 @@ + + +EO: eoHowMany.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoHowMany.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoHowMany_h.h
+00005 //   Base class for choosing a number of guys to apply something from a popsize
+00006 // (c) Marc Schoenauer, 2000
+00007 /*
+00008    This library is free software; you can redistribute it and/or
+00009    modify it under the terms of the GNU Lesser General Public
+00010    License as published by the Free Software Foundation; either
+00011    version 2 of the License, or (at your option) any later version.
+00012 
+00013    This library is distributed in the hope that it will be useful,
+00014    but WITHOUT ANY WARRANTY; without even the implied warranty of
+00015    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00016    Lesser General Public License for more details.
+00017 
+00018    You should have received a copy of the GNU Lesser General Public
+00019    License along with this library; if not, write to the Free Software
+00020    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00021 
+00022    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef eoHowMany_h
+00027 #define eoHowMany_h
+00028 
+00067 #include <sstream>
+00068 
+00069 class eoHowMany : public eoPersistent
+00070 {
+00071 public:
+00076   eoHowMany(double  _rate = 0.0, bool _interpret_as_rate = true):
+00077     rate(_rate), combien(0)
+00078   {
+00079     if (_interpret_as_rate)
+00080       {
+00081         if (_rate<0)
+00082           {
+00083             rate = 1.0+_rate;
+00084             if (rate < 0)          // was < -1
+00085               throw std::logic_error("rate<-1 in eoHowMany!");
+00086           }
+00087       }
+00088     else
+00089       {
+00090         rate = 0.0;                // just in case, but shoud be unused
+00091         combien = int(_rate);      // negative values are allowed here
+00092         if (combien != _rate)
+00093           std::cerr << "Warning: Number was rounded in eoHowMany";
+00094       }
+00095   }
+00096 
+00099   eoHowMany(int _combien) : rate(0.0), combien(_combien) {}
+00100 
+00103   eoHowMany(unsigned int _combien) : rate(0.0), combien(_combien) {}
+00104 
+00106   virtual ~eoHowMany() {}
+00107 
+00114   unsigned int operator()(unsigned int _size)
+00115   {
+00116     if (combien == 0)
+00117       {
+00118         return (unsigned int) (rate * _size);
+00119       }
+00120     if (combien < 0)
+00121       {
+00122         unsigned int combloc = -combien;
+00123         if (_size<combloc)
+00124           throw std::runtime_error("Negative result in eoHowMany");
+00125         return _size-combloc;
+00126       }
+00127     return unsigned(combien);
+00128   }
+00129 
+00130   virtual void printOn(std::ostream& _os) const
+00131   {
+00132     if (combien == 0)
+00133       _os << 100*rate << "% ";
+00134     else
+00135       _os << combien << " ";
+00136     return;
+00137 
+00138   }
+00139 
+00140   virtual void readFrom(std::istream& _is)
+00141    {
+00142     std::string value;
+00143     _is >> value;
+00144     readFrom(value);
+00145     return;
+00146   }
+00147 
+00148   void readFrom(std::string _value)
+00149   {
+00150     // check for %
+00151     bool interpret_as_rate = false;   // == no %
+00152     size_t pos =  _value.find('%');
+00153     if (pos < _value.size())  //  found a %
+00154       {
+00155         interpret_as_rate = true;
+00156         _value.resize(pos);        // get rid of %
+00157       }
+00158 
+00159     std::istringstream is(_value);
+00160     is >> rate;
+00161     // now store
+00162     if (interpret_as_rate)
+00163       {
+00164         combien = 0;
+00165         rate /= 100.0;
+00166       }
+00167     else
+00168       combien = int(rate);         // and rate will not be used
+00169 
+00170     // minimal check
+00171     if ( rate < 0.0 )
+00172       throw std::runtime_error("Negative rate read in eoHowMany::readFrom");
+00173   }
+00174 
+00176   eoHowMany operator-()
+00177   {
+00178     if (!combien)                  // only rate is used
+00179       rate = 1.0-rate;
+00180     else
+00181       combien = -combien;
+00182     return (*this);
+00183   }
+00184 
+00185 private :
+00186   double rate;
+00187   int combien;
+00188 };
+00189 
+00190 
+00191 
+00192 #endif
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_init_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_init_8h-source.html new file mode 100644 index 000000000..9e6ca7c36 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_init_8h-source.html @@ -0,0 +1,156 @@ + + +EO: eoInit.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoInit.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoInit.h
+00005 // (c) Maarten Keijzer 2000, GeNeura Team, 2000
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mak@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoInit_H
+00028 #define _eoInit_H
+00029 
+00030 #include <algorithm>
+00031 
+00032 #include <eoOp.h>
+00033 #include <eoSTLFunctor.h>
+00034 #include <utils/eoRndGenerators.h>
+00035 
+00044 template <class EOT>
+00045 class eoInit : public eoUF<EOT&, void>
+00046 {
+00047 public:
+00048 
+00052   virtual std::string className(void) const { return "eoInit"; }
+00053 };
+00054 
+00059 template <class EOT>
+00060 class eoInitGenerator :  public eoF<EOT>
+00061 {
+00062 public:
+00063 
+00065   eoInitGenerator(eoInit<EOT> & _init):init(_init) {}
+00066 
+00067   virtual EOT operator()()
+00068     {
+00069       EOT p;
+00070       init(p);
+00071       return (p);
+00072     }
+00073 private:
+00074   eoInit<EOT> & init;
+00075 };
+00076 
+00080 template <class EOT>
+00081 class eoInitFixedLength: public eoInit<EOT>
+00082 {
+00083     public:
+00084 
+00085     typedef typename EOT::AtomType AtomType;
+00086 
+00087         eoInitFixedLength(unsigned _combien, eoRndGenerator<AtomType>& _generator)
+00088             : combien(_combien), generator(_generator) {}
+00089 
+00090         virtual void operator()(EOT& chrom)
+00091         {
+00092             chrom.resize(combien);
+00093             std::generate(chrom.begin(), chrom.end(), generator);
+00094             chrom.invalidate();
+00095         }
+00096 
+00097     private :
+00098         unsigned combien;
+00100         eoSTLF<AtomType> generator;
+00101 };
+00102 
+00106 template <class EOT>
+00107 class eoInitVariableLength: public eoInit<EOT>
+00108 {
+00109 public:
+00110 typedef typename EOT::AtomType AtomType; 
+00111 
+00112 //   /** Ctor from a generator */
+00113 //   eoInitVariableLength(unsigned _minSize, unsigned _maxSize, eoF<typename EOT::AtomType> & _generator = Gen())
+00114 //     : offset(_minSize), extent(_maxSize - _minSize), 
+00115 //                       repGenerator( eoInitGenerator<typename EOT::AtomType>(*(new eoInit<EOT>)) ), 
+00116 //                       generator(_generator)
+00117 //   {
+00118 //     if (_minSize >= _maxSize)
+00119 //       throw std::logic_error("eoInitVariableLength: minSize larger or equal to maxSize");
+00120 //   }
+00121 
+00123   eoInitVariableLength(unsigned _minSize, unsigned _maxSize, eoInit<AtomType> & _init)
+00124     : offset(_minSize), extent(_maxSize - _minSize), init(_init)
+00125   {
+00126     if (_minSize >= _maxSize)
+00127       throw std::logic_error("eoInitVariableLength: minSize larger or equal to maxSize");
+00128   }
+00129 
+00130 
+00131   virtual void operator()(EOT& _chrom)
+00132   {
+00133     _chrom.resize(offset + rng.random(extent));
+00134     typename std::vector<AtomType>::iterator it;
+00135     for (it=_chrom.begin(); it<_chrom.end(); it++)
+00136       init(*it);
+00137     _chrom.invalidate();
+00138   }
+00139 
+00140   // accessor to the atom initializer (needed by operator constructs sometimes)
+00141   eoInit<AtomType> & atomInit() {return init;}
+00142 
+00143 private :
+00144   unsigned offset;
+00145   unsigned extent;
+00146   eoInit<AtomType> & init;
+00147 };
+00148 
+00156 template <class EOT>
+00157 class eoInitAdaptor : public eoMonOp<EOT>
+00158 {
+00159     public :
+00160         eoInitAdaptor(eoInit<EOT>& _init) : init(_init) {}
+00161 
+00162         bool operator()(EOT& _eot)
+00163         {
+00164             init(_eot);
+00165             return true;
+00166         }
+00167     private :
+00168 
+00169         eoInit<EOT>& init;
+00170 };
+00171 
+00172 #endif
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_init_virus_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_init_virus_8h-source.html new file mode 100644 index 000000000..5da837a73 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_init_virus_8h-source.html @@ -0,0 +1,95 @@ + + +EO: eoInitVirus.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / MGE
+

eoInitVirus.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoInit.h
+00005 // (c) Maarten Keijzer 2000, GeNeura Team, 2000
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mak@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoInitVirus_H
+00028 #define _eoInitVirus_H
+00029 
+00030 #include <algorithm>
+00031 
+00032 #include <eoOp.h>
+00033 #include <eoSTLFunctor.h>
+00034 #include <utils/eoRndGenerators.h>
+00035 #include <eoInit.h>
+00036 
+00040 template <class FitT>
+00041 class eoInitVirus: public eoInit< eoVirus<FitT> > {
+00042 public:
+00043 
+00044   eoInitVirus(unsigned _combien, eoRndGenerator<bool>& _generator )
+00045         : combien(_combien), generator(_generator) {}
+00046   
+00047   virtual void operator()( eoVirus<FitT>& chrom)
+00048   {
+00049         chrom.resize(combien);
+00050         chrom.virResize(combien);
+00051         std::generate(chrom.begin(), chrom.end(), generator);
+00052         for ( unsigned i = 0; i < combien; i ++ ) {
+00053           chrom.virusBitSet(i, generator() );
+00054         }
+00055         chrom.invalidate();
+00056   }
+00057   
+00058 private :
+00059   unsigned combien;
+00061   eoSTLF<bool> generator;
+00062 };
+00063 
+00065 template <class FitT>
+00066 class eoInitVirus1bit: public eoInit< eoVirus<FitT> > {
+00067 public:
+00068 
+00069   eoInitVirus1bit(unsigned _combien, eoRndGenerator<bool>& _generator )
+00070         : combien(_combien), generator(_generator) {}
+00071   
+00072   virtual void operator()( eoVirus<FitT>& chrom)
+00073   {
+00074         chrom.resize(combien);
+00075         chrom.virResize(combien);
+00076         std::generate(chrom.begin(), chrom.end(), generator);
+00077         chrom.virusBitSet(0, true );
+00078         chrom.invalidate();
+00079   }
+00080   
+00081 private :
+00082   unsigned combien;
+00084   eoSTLF<bool> generator;
+00085 };
+00086 #endif
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_int_bounds_8cpp-source.html b/trunk/paradiseo-eo/doc/html/eo_int_bounds_8cpp-source.html new file mode 100644 index 000000000..453555ea7 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_int_bounds_8cpp-source.html @@ -0,0 +1,110 @@ + + +EO: eoIntBounds.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoIntBounds.cpp

00001 #ifdef _MSC_VER
+00002 // to avoid long name warnings
+00003 #pragma warning(disable:4786)
+00004 #endif
+00005 
+00006 #ifdef HAVE_CONFIG_H
+00007 #include <config.h>
+00008 #endif
+00009 
+00010 #include <ctime>
+00011 #include <sstream>
+00012 
+00013 #include "eoIntBounds.h"
+00014 
+00015 
+00016 // the global dummy bounds
+00017 // (used for unbounded variables when bounds are required)
+00018 eoIntNoBounds eoDummyIntNoBounds;
+00019 
+00021 extern bool remove_leading(std::string & _s, const std::string _delim);
+00022 extern double read_double(std::string _s);
+00023 extern long int read_int(std::string _s);
+00024 
+00025 
+00028 eoIntBounds* eoGeneralIntBounds::getBoundsFromString(std::string _value)
+00029 {
+00030   // now read
+00031   std::string delim(",; ");
+00032   std::string beginOrClose("[(])");
+00033   if (!remove_leading(_value, delim)) // only delimiters were left
+00034     throw std::runtime_error("Syntax error in eoGeneralIntBounds Ctor");
+00035 
+00036   // look for opening char
+00037   size_t posDeb = _value.find_first_of(beginOrClose);   // allow ]a,b]
+00038   if (posDeb >= _value.size())  // nothing left to read
+00039     throw std::runtime_error("Syntax error in eoGeneralIntBounds Ctor");
+00040 
+00041   // ending char: next {}() after posDeb
+00042   size_t posFin = _value.find_first_of(beginOrClose,posDeb+1);
+00043   if (posFin >= _value.size())  // not found
+00044     throw std::runtime_error("Syntax error in eoGeneralIntBounds Ctor");
+00045 
+00046   // the bounds
+00047   std::string sBounds = _value.substr(posDeb+1, posFin-posDeb-1);
+00048   // and remove from original string
+00049   _value = _value.substr(posFin+1);
+00050 
+00051   remove_leading(sBounds, delim);
+00052   size_t posDelim = sBounds.find_first_of(delim);
+00053   if (posDelim >= sBounds.size())
+00054     throw std::runtime_error("Syntax error in eoGeneralIntBounds Ctor");
+00055 
+00056       bool minBounded=false, maxBounded=false;
+00057       long int minBound=0, maxBound=0;
+00058 
+00059       // min bound
+00060       std::string sMinBounds = sBounds.substr(0,posDelim);
+00061 
+00062       if ( (sMinBounds != std::string("-inf")) &&
+00063            (sMinBounds != std::string("-infinity"))
+00064            )
+00065         {
+00066           minBounded = true;
+00067           minBound = read_int(sMinBounds);
+00068         }
+00069 
+00070       // max bound
+00071       size_t posEndDelim = sBounds.find_first_not_of(delim,posDelim);
+00072 
+00073       std::string sMaxBounds = sBounds.substr(posEndDelim);
+00074 
+00075       if ( (sMaxBounds != std::string("+inf")) &&
+00076            (sMaxBounds != std::string("+infinity"))
+00077            )
+00078         {
+00079           maxBounded = true;
+00080           maxBound = read_int(sMaxBounds);
+00081         }
+00082 
+00083       // now create the embedded eoIntBounds object
+00084       eoIntBounds * locBound;
+00085       if (minBounded && maxBounded)
+00086         {
+00087           if (maxBound <= minBound)
+00088             throw std::runtime_error("Syntax error in eoGeneralIntBounds Ctor");
+00089           locBound = new eoIntInterval(minBound, maxBound);
+00090         }
+00091       else if (!minBounded && !maxBounded)      // no bound at all
+00092         locBound = new eoIntNoBounds;
+00093       else if (!minBounded && maxBounded)
+00094         locBound = new eoIntAboveBound(maxBound);
+00095       else if (minBounded && !maxBounded)
+00096         locBound = new eoIntBelowBound(minBound);
+00097       return locBound;
+00098 }
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_int_bounds_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_int_bounds_8h-source.html new file mode 100644 index 000000000..436021da1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_int_bounds_8h-source.html @@ -0,0 +1,525 @@ + + +EO: eoIntBounds.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoIntBounds.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoIntBounds.h
+00005 // (c) Marc Schoenauer 2001, Maarten Keijzer 2000, GeNeura Team, 1998
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mak@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoIntBounds_h
+00028 #define _eoIntBounds_h
+00029 
+00030 #include <stdexcept>               // std::exceptions!
+00031 #include <utils/eoRNG.h>
+00032 
+00075 class eoIntBounds : public eoPersistent
+00076 { 
+00077 public:
+00078   virtual ~eoIntBounds(){}
+00079 
+00082   virtual bool isBounded(void) const  = 0;
+00083 
+00087   virtual bool hasNoBoundAtAll(void) const  = 0;
+00088 
+00091   virtual bool isMinBounded(void) const = 0;
+00092 
+00095   virtual bool isMaxBounded(void) const = 0;
+00096 
+00099   virtual bool isInBounds(double)  const = 0;
+00100 
+00103   virtual void foldsInBounds(double &)  const = 0;
+00104 
+00107   virtual void foldsInBounds(long int & i)  const
+00108   {
+00109     double r = double(i);
+00110     foldsInBounds(r);
+00111     i = (long int)(r);
+00112   }
+00113 
+00116   virtual void truncate(double &)  const = 0;
+00117 
+00120   virtual void truncate(long int & i)  const 
+00121   {
+00122     double r = double(i);
+00123     truncate(r);
+00124     i = (long int)(r);
+00125   }
+00126 
+00130   virtual long int minimum()  const = 0 ;
+00134   virtual long int maximum()  const = 0 ;
+00138   virtual long int range()  const = 0;
+00139 
+00144   virtual double uniform(eoRng & _rng = eo::rng)  const = 0;
+00145   virtual long int random(eoRng & _rng = eo::rng)  const = 0;
+00146 
+00148   virtual eoIntBounds * dup()  const = 0;
+00149 };
+00150 
+00153 class eoIntNoBounds : public eoIntBounds
+00154 {
+00155 public:
+00156   virtual ~eoIntNoBounds(){}
+00157 
+00158   virtual bool isBounded(void)  const {return false;}
+00159   virtual bool hasNoBoundAtAll(void) const  {return true;}
+00160   virtual bool isMinBounded(void)  const {return false;}
+00161   virtual bool isMaxBounded(void)  const {return false;}
+00162   virtual void foldsInBounds(double &)  const {return;}
+00163   virtual void truncate(double &)  const {return;}
+00164   virtual bool isInBounds(double)  const {return true;}
+00165 
+00166   virtual long int minimum() const
+00167   {
+00168     throw std::logic_error("Trying to get minimum of unbounded eoIntBounds");
+00169   }
+00170   virtual long int maximum() const 
+00171   {
+00172     throw std::logic_error("Trying to get maximum of unbounded eoIntBounds");
+00173   }
+00174   virtual long int range() const 
+00175   {
+00176     throw std::logic_error("Trying to get range of unbounded eoIntBounds");
+00177   }
+00178 
+00179   virtual double uniform(eoRng & _rng = eo::rng) const 
+00180   {
+00181     throw std::logic_error("Trying to generate uniform values in unbounded eoIntBounds");
+00182   }
+00183   virtual long int random(eoRng & _rng = eo::rng) const 
+00184   {
+00185     throw std::logic_error("Trying to generate uniform values in unbounded eoIntBounds");
+00186   }
+00187 
+00188   // methods from eoPersistent
+00195   virtual void readFrom(std::istream& _is) 
+00196   {
+00197     throw std::runtime_error("Should not use eoIntBounds::readFrom");
+00198   }
+00199 
+00204   virtual void printOn(std::ostream& _os) const
+00205   {
+00206     _os << "[-inf,+inf]";
+00207   }
+00208 
+00210   virtual eoIntBounds * dup() const 
+00211   {
+00212     return new eoIntNoBounds(*this);
+00213   }
+00214 
+00215 };
+00216 
+00217 // one object for all - see eoIntBounds.cpp
+00218 extern eoIntNoBounds eoDummyIntNoBounds;
+00219 
+00223 class eoIntInterval : public eoIntBounds
+00224 {
+00225 public :
+00226   virtual ~eoIntInterval(){}
+00227   
+00231   eoIntInterval(long int _min=0, long int _max=1) : 
+00232     repMinimum(_min), repMaximum(_max), repRange(_max-_min) 
+00233   {
+00234     if (repRange<=0)
+00235       throw std::logic_error("Void range in eoIntBounds");
+00236   }
+00237 
+00238   // accessors  
+00239   virtual long int minimum() const { return repMinimum; }
+00240   virtual long int maximum() const { return repMaximum; }
+00241   virtual long int range()  const { return repRange; }
+00242 
+00243   // description
+00244   virtual bool isBounded(void)  const {return true;}
+00245   virtual bool hasNoBoundAtAll(void)  const {return false;}
+00246   virtual bool isMinBounded(void)  const {return true;}
+00247   virtual bool isMaxBounded(void)  const {return true;}
+00248 
+00249   virtual double uniform(eoRng & _rng = eo::rng) const 
+00250   {
+00251     return repMinimum + _rng.uniform(repRange);
+00252   }  
+00253 
+00254   virtual long int random(eoRng & _rng = eo::rng) const 
+00255   {
+00256     return repMinimum + _rng.random(repRange);
+00257   }  
+00258 
+00259   // says if a given double is within the bounds
+00260   virtual bool isInBounds(double _r) const 
+00261   {
+00262     if (_r < repMinimum)
+00263       return false;
+00264     if (_r > repMaximum)
+00265       return false;
+00266     return true;
+00267   }
+00268 
+00269   // folds a value into bounds
+00270   virtual void foldsInBounds(double &  _r) const 
+00271   {
+00272     long iloc;
+00273     double dlargloc = 2 * range() ;
+00274 
+00275     if (fabs(_r) > 1.0E9)               // iloc too large!
+00276       {
+00277         _r = uniform();
+00278         return;
+00279       }
+00280 
+00281     if ( (_r > maximum()) )
+00282       {
+00283         iloc = (long) ( (_r-minimum()) / dlargloc ) ;
+00284         _r -= dlargloc * iloc ;
+00285         if ( _r > maximum() )
+00286           _r = 2*maximum() - _r ;
+00287       }
+00288     
+00289     if (_r < minimum()) 
+00290       {
+00291         iloc = (long) ( (maximum()-_r) / dlargloc ) ;
+00292         _r += dlargloc * iloc ;
+00293         if (_r < minimum())
+00294           _r = 2*minimum() - _r ;
+00295       }
+00296   }    
+00297 
+00298   // truncates to the bounds
+00299   virtual void truncate(double & _r) const 
+00300   {
+00301     if (_r < repMinimum)
+00302       _r = repMinimum;
+00303     else if (_r > repMaximum)
+00304       _r = repMaximum;
+00305     return;
+00306   }
+00307 
+00308   // methods from eoPersistent
+00315   virtual void readFrom(std::istream& _is) 
+00316   {
+00317     throw std::runtime_error("Should not use eoIntInterval::readFrom");
+00318   }
+00319 
+00324   virtual void printOn(std::ostream& _os) const
+00325   {
+00326     _os << "[" << repMinimum << "," << repMaximum << "]";
+00327   }
+00328 
+00330   virtual eoIntBounds * dup() const 
+00331   {
+00332     return new eoIntInterval(*this);
+00333   }
+00334 
+00335 private :
+00336   long int repMinimum;
+00337   long int repMaximum;
+00338   long int repRange;                       // to minimize operations ???
+00339 };
+00340 
+00344 class eoIntBelowBound : public eoIntBounds
+00345 {
+00346 public :
+00347   virtual ~eoIntBelowBound(){}  
+00351   eoIntBelowBound(long int _min=0) : 
+00352     repMinimum(_min)
+00353   {}
+00354 
+00355   // accessors  
+00356   virtual long int minimum() const { return repMinimum; }
+00357 
+00358   virtual long int maximum() const 
+00359   {
+00360     throw std::logic_error("Trying to get maximum of eoIntBelowBound");
+00361   }
+00362   virtual long int range() const 
+00363   {
+00364     throw std::logic_error("Trying to get range of eoIntBelowBound");
+00365   }
+00366 
+00367   virtual double uniform(eoRng & _rng = eo::rng) const 
+00368   {
+00369     throw std::logic_error("Trying to generate uniform values in eoIntBelowBound");
+00370   }
+00371   virtual long int random(eoRng & _rng = eo::rng) const 
+00372   {
+00373     throw std::logic_error("Trying to generate uniform values in eoIntBelowBound");
+00374   }
+00375 
+00376   // description
+00377   virtual bool isBounded(void)  const {return false;}
+00378   virtual bool hasNoBoundAtAll(void)  const {return false;}
+00379   virtual bool isMinBounded(void)  const {return true;}
+00380   virtual bool isMaxBounded(void) const  {return false;}
+00381 
+00382   // says if a given double is within the bounds
+00383   virtual bool isInBounds(double _r) const 
+00384   {
+00385     if (_r < repMinimum)
+00386       return false;
+00387     return true;
+00388   }
+00389 
+00390   // folds a value into bounds
+00391   virtual void foldsInBounds(double &  _r) const 
+00392   {
+00393     // easy as a pie: symmetry w.r.t. minimum
+00394     if (_r < repMinimum)           // nothing to do otherwise
+00395       _r = 2*repMinimum - _r;
+00396     return ;
+00397   }    
+00398 
+00399   // truncates to the bounds
+00400   virtual void truncate(double & _r) const 
+00401   {
+00402     if (_r < repMinimum)
+00403       _r = repMinimum;
+00404     return;
+00405   }
+00406 
+00407   // methods from eoPersistent
+00414   virtual void readFrom(std::istream& _is) 
+00415   {
+00416     throw std::runtime_error("Should not use eoIntBelowBound::readFrom");
+00417   }
+00418 
+00423   virtual void printOn(std::ostream& _os) const
+00424   {
+00425     _os << "[" << repMinimum << ",+inf]";
+00426   }
+00427 
+00429   virtual eoIntBounds * dup() const 
+00430   {
+00431     return new eoIntBelowBound(*this);
+00432   }
+00433 
+00434 private :
+00435   long int repMinimum;
+00436 };
+00437 
+00441 class eoIntAboveBound : public eoIntBounds
+00442 {
+00443 public :
+00444   virtual ~eoIntAboveBound(){}
+00445   
+00449   eoIntAboveBound(long int _max=0) : 
+00450     repMaximum(_max)
+00451   {}
+00452 
+00453   // accessors  
+00454   virtual long int maximum() const  { return repMaximum; }
+00455 
+00456   virtual long int minimum() const 
+00457   {
+00458     throw std::logic_error("Trying to get minimum of eoIntAboveBound");
+00459   }
+00460   virtual long int range() const 
+00461   {
+00462     throw std::logic_error("Trying to get range of eoIntAboveBound");
+00463   }
+00464 
+00465   virtual double uniform(eoRng & _rng = eo::rng) const 
+00466   {
+00467     throw std::logic_error("Trying to generate uniform values in eoIntAboveBound");
+00468   }
+00469   virtual long int random(eoRng & _rng = eo::rng) const 
+00470   {
+00471     throw std::logic_error("Trying to generate uniform values in eoIntAboveBound");
+00472   }
+00473 
+00474   // description
+00475   virtual bool isBounded(void)  const {return false;}
+00476   virtual bool hasNoBoundAtAll(void)  const {return false;}
+00477   virtual bool isMinBounded(void)  const {return false;}
+00478   virtual bool isMaxBounded(void)  const {return true;}
+00479 
+00480   // says if a given double is within the bounds
+00481   virtual bool isInBounds(double _r) const 
+00482   {
+00483     if (_r > repMaximum)
+00484       return false;
+00485     return true;
+00486   }
+00487 
+00488   // folds a value into bounds
+00489   virtual void foldsInBounds(double &  _r) const 
+00490   {
+00491     // easy as a pie: symmetry w.r.t. maximum
+00492     if (_r > repMaximum)           // nothing to do otherwise
+00493       _r = 2*repMaximum - _r;
+00494     return ;
+00495   }    
+00496 
+00497   // truncates to the bounds
+00498   virtual void truncate(double & _r) const 
+00499   {
+00500     if (_r > repMaximum)
+00501       _r = repMaximum;
+00502     return;
+00503   }
+00504 
+00505   // methods from eoPersistent
+00512   virtual void readFrom(std::istream& _is) 
+00513   {
+00514     throw std::runtime_error("Should not use eoIntAboveBound::readFrom");
+00515   }
+00516 
+00521   virtual void printOn(std::ostream& _os) const
+00522   {
+00523     _os << "[-inf," << repMaximum << "]";
+00524   }
+00525 
+00527   virtual eoIntBounds * dup() const 
+00528   {
+00529     return new eoIntAboveBound(*this);
+00530   }
+00531 
+00532 private :
+00533   long int repMaximum;
+00534 };
+00535 
+00537 
+00541 class eoGeneralIntBounds : public eoIntBounds
+00542 {
+00543 public:
+00545   eoGeneralIntBounds(std::string _s = "[-infinity,+infinity]")
+00546   {
+00547     repBound = getBoundsFromString(_s);
+00548   }
+00549 
+00551   eoGeneralIntBounds(const eoGeneralIntBounds & _b) : eoIntBounds(_b)
+00552   {
+00553     // replicate the embedded bound (I'm pretty sure there is another
+00554     // way to do that !!!
+00555 
+00556     bool minBounded = _b.isMinBounded();
+00557     bool maxBounded = _b.isMaxBounded();
+00558     long int minimum, maximum;
+00559     const eoIntBounds & bb = _b.theBounds();
+00560     if (minBounded) minimum = bb.minimum();
+00561     if (maxBounded) maximum = bb.maximum();
+00562 
+00563       if (minBounded && maxBounded)
+00564         repBound = new eoIntInterval(minimum, maximum);
+00565       else if (!minBounded && !maxBounded)      // no bound at all
+00566         repBound = new eoIntNoBounds;
+00567       else if (!minBounded && maxBounded)
+00568         repBound = new eoIntAboveBound(maximum);
+00569       else if (minBounded && !maxBounded)
+00570         repBound = new eoIntBelowBound(minimum);
+00571   }
+00572 
+00573   eoGeneralIntBounds& operator=(const eoGeneralIntBounds& _b)
+00574   {
+00575     // replicate the embedded bound (I'm pretty sure there is another
+00576     // way to do that !!!
+00577 
+00578     bool minBounded = _b.isMinBounded();
+00579     bool maxBounded = _b.isMaxBounded();
+00580     long int minimum, maximum;
+00581     const eoIntBounds & bb = _b.theBounds();
+00582     if (minBounded) minimum = bb.minimum();
+00583     if (maxBounded) maximum = bb.maximum();
+00584 
+00585     // first delete the embedded bounds if necessary
+00586     if (repBound)
+00587       delete repBound;
+00588     // now reallocate
+00589       if (minBounded && maxBounded)
+00590         repBound = new eoIntInterval(minimum, maximum);
+00591       else if (!minBounded && !maxBounded)      // no bound at all
+00592         repBound = new eoIntNoBounds;
+00593       else if (!minBounded && maxBounded)
+00594         repBound = new eoIntAboveBound(maximum);
+00595       else if (minBounded && !maxBounded)
+00596         repBound = new eoIntBelowBound(minimum);
+00597       return (*this);
+00598   }
+00599 
+00600 
+00602   ~eoGeneralIntBounds()
+00603   {
+00604     delete repBound;
+00605   }
+00606 
+00608 
+00610   virtual bool isBounded(void)  const {return repBound->isBounded();}
+00611 
+00615   virtual bool hasNoBoundAtAll(void)  const {return repBound->hasNoBoundAtAll();}
+00616 
+00619   virtual bool isMinBounded(void)  const {return repBound->isMinBounded();}
+00620 
+00623   virtual bool isMaxBounded(void) const {return repBound->isMaxBounded();}
+00624 
+00627   virtual bool isInBounds(double _x)  const {return repBound->isInBounds(_x);}
+00628 
+00631   virtual void foldsInBounds(double & _x) const {return repBound->foldsInBounds(_x);}
+00632 
+00635   virtual void truncate(double & _x)  const {return repBound->truncate(_x);}
+00636 
+00640   virtual long int minimum()  const {return repBound->minimum();}
+00644   virtual long int maximum() const {return repBound->maximum();}
+00648   virtual long int range()  const {return repBound->range();}
+00649 
+00653   virtual double uniform(eoRng & _rng = eo::rng)  const {return repBound->uniform();}
+00654 
+00658   virtual long int random(eoRng & _rng = eo::rng)  const {return repBound->random();}
+00659 
+00661   virtual eoIntBounds * dup() const  {return repBound->dup();}
+00662 
+00664   const eoIntBounds & theBounds()  const { return *repBound;} 
+00665 
+00669   virtual void printOn(std::ostream& _os) const
+00670   {
+00671     repBound->printOn(_os);
+00672   }
+00673 
+00675   virtual void readFrom(std::istream& _is) 
+00676   {
+00677     std::string s;
+00678     _is >> s;
+00679     if (repBound)
+00680       delete repBound;
+00681     repBound = getBoundsFromString(s);
+00682   }
+00683 
+00684 private:
+00685   // reading from a string
+00686   eoIntBounds * getBoundsFromString(std::string);
+00687 
+00688   eoIntBounds * repBound;
+00689 };
+00690 
+00691 
+00692 #endif
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_invalidate_ops_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_invalidate_ops_8h-source.html new file mode 100644 index 000000000..4917fdd18 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_invalidate_ops_8h-source.html @@ -0,0 +1,110 @@ + + +EO: eoInvalidateOps.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoInvalidateOps.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoInvalidateOps.h
+00005 // (c) Maarten Keijzer 2001
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mak@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoInvalidateOps_h
+00028 #define _eoInvalidateOps_h
+00029 
+00030 #include <eoOp.h>
+00031 
+00045 template <class EOT>
+00046 class eoInvalidateMonOp : public eoMonOp<EOT>
+00047 {
+00048   public:
+00049     eoInvalidateMonOp(eoMonOp<EOT>& _op) : op(_op) {}
+00050 
+00051     bool operator()(EOT& _eo)
+00052     {
+00053       if (op(_eo))
+00054       {
+00055         _eo.invalidate();
+00056         return true;
+00057       }
+00058 
+00059       return false; 
+00060     }
+00061 
+00062   private:
+00063     eoMonOp<EOT>& op;
+00064 };
+00065 
+00079 template <class EOT>
+00080 class eoInvalidateBinOp : public eoBinOp<EOT>
+00081 {
+00082   public:
+00083     eoInvalidateBinOp(eoBinOp<EOT>& _op) : op(_op) {}
+00084 
+00085     bool operator()(EOT& _eo, const EOT& _eo2)
+00086     {
+00087       if (op(_eo, _eo2))
+00088       {
+00089         _eo.invalidate();
+00090         return true;
+00091       }
+00092 
+00093       return false;
+00094     }
+00095 
+00096   private:
+00097     eoBinOp<EOT>& op;
+00098 };
+00099 
+00113 template <class EOT>
+00114 class eoInvalidateQuadOp : public eoQuadOp<EOT>
+00115 {
+00116   public:
+00117     eoInvalidateQuadOp(eoQuadOp<EOT>& _op) : op(_op) {}
+00118 
+00119     bool operator()(EOT& _eo1, EOT& _eo2)
+00120     {
+00121       if (op(_eo1, _eo2))
+00122       {
+00123         _eo1.invalidate();
+00124         _eo2.invalidate();
+00125         return true;
+00126       }
+00127       return false;
+00128     }
+00129 
+00130   private:
+00131     eoQuadOp<EOT>& op;
+00132 };
+00133 
+00134 #endif
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_linear_fit_scaling_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_linear_fit_scaling_8h-source.html new file mode 100644 index 000000000..691be354f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_linear_fit_scaling_8h-source.html @@ -0,0 +1,75 @@ + + +EO: eoLinearFitScaling.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoLinearFitScaling.h

00001 
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef eoLinearFitScaling_h
+00028 #define eoLinearFitScaling_h
+00029 
+00030 #include <eoSelectFromWorth.h>
+00031 #include <eoPerf2Worth.h>
+00032 
+00042 template <class EOT>
+00043 class eoLinearFitScaling : public eoPerf2Worth<EOT> // false: do not cache fitness
+00044 {
+00045 public:
+00046 
+00047     using eoPerf2Worth<EOT>::value;
+00048 
+00049     /* Ctor:
+00050        @param _p selective pressure (in (1,2])
+00051        @param _e exponent (1 == linear)
+00052     */
+00053     eoLinearFitScaling(double _p=2.0)
+00054         : pressure(_p) {}
+00055 
+00056     /* COmputes the ranked fitness: fitnesses range in [m,M]
+00057        with m=2-pressure/popSize and M=pressure/popSize.
+00058        in between, the progression depends on exponent (linear if 1).
+00059     */
+00060     virtual void operator()(const eoPop<EOT>& _pop) {
+00061         unsigned pSize =_pop.size();
+00062         // value() refers to the vector of worthes (we're in an eoParamvalue)
+00063         value().resize(pSize);
+00064 
+00065         // best and worse fitnesses
+00066         double bestFitness = static_cast<double> (_pop.best_element().fitness());
+00067         //    double worstFitness = static_cast<double> (_pop.worse_element().fitness());
+00068 
+00069         // average fitness
+00070         double sum=0.0;
+00071         unsigned i;
+00072         for (i=0; i<pSize; i++)
+00073             sum += static_cast<double>(_pop[i].fitness());
+00074         double averageFitness = sum/pSize;
+00075 
+00076         // the coefficients for linear scaling
+00077         double denom = pSize*(bestFitness - averageFitness);
+00078         double alpha = (pressure-1)/denom;
+00079         double beta = (bestFitness - pressure*averageFitness)/denom;
+00080 
+00081         for (i=0; i<pSize; i++) { // truncate to 0
+00082             value()[i] = std::max(alpha*_pop[i].fitness()+beta, 0.0);
+00083         }
+00084     }
+00085 
+00086 private:
+00087     double pressure;    // selective pressure
+00088 };
+00089 
+00090 
+00091 
+00092 #endif
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_m_g_g_replacement_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_m_g_g_replacement_8h-source.html new file mode 100644 index 000000000..a56b68847 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_m_g_g_replacement_8h-source.html @@ -0,0 +1,86 @@ + + +EO: eoMGGReplacement.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoMGGReplacement.h

00001 
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _eoMGGReplacement_h
+00027 #define _eoMGGReplacement_h
+00028 
+00029 
+00030 //-----------------------------------------------------------------------------
+00031 #include <eoPop.h>
+00032 #include <eoFunctor.h>
+00033 #include <eoMerge.h>
+00034 #include <eoReduce.h>
+00035 #include <utils/eoHowMany.h>
+00036 #include <eoReduceSplit.h>
+00037 //-----------------------------------------------------------------------------
+00038 
+00049 template <class EOT>
+00050 class eoMGGReplacement : public eoReplacement<EOT>
+00051 {
+00052 public:
+00053   eoMGGReplacement(eoHowMany _howManyEliminatedParents = eoHowMany(2, false),
+00054                    unsigned _tSize=2) :
+00055     // split truncates the parents and returns eliminated parents
+00056     split(_howManyEliminatedParents, true), 
+00057     tSize(_tSize)
+00058   {
+00059     if (tSize < 2)
+00060       { 
+00061         std::cout << "Warning, Size for eoDetTournamentTruncateSplit adjusted to 2\n";
+00062         tSize = 2;
+00063       }
+00064   }
+00065     
+00066     void operator()(eoPop<EOT> & _parents, eoPop<EOT> & _offspring)
+00067     {
+00068       eoPop<EOT> temp;
+00069       split(_parents, temp);
+00070       unsigned toKeep = temp.size(); // how many to keep from merged populations
+00071       // minimal check
+00072       if (toKeep < 2)
+00073         throw std::runtime_error("Not enough parents killed in eoMGGReplacement");
+00074 
+00075       // select best offspring
+00076       typename eoPop<EOT>::iterator it = _offspring.it_best_element();
+00077       // add to parents
+00078       _parents.push_back(*it);
+00079       // remove from offspring
+00080       _offspring.erase(it);
+00081 
+00082       // merge temp into offspring
+00083       plus(temp, _offspring);
+00084       
+00085       // repeatedly add selected offspring to parents
+00086       for (unsigned i=0; i<toKeep-1; i++)
+00087         {
+00088           // select
+00089           it = deterministic_tournament(_offspring.begin(), _offspring.end(), tSize);
+00090           // add to parents
+00091           _parents.push_back(*it);
+00092           // remove from offspring
+00093           _offspring.erase(it);
+00094         }
+00095     }
+00096 
+00097 private:
+00098   eoLinearTruncateSplit<EOT> split; // few parents to truncate -> linear 
+00099   eoPlus<EOT> plus;
+00100   unsigned int tSize;
+00101 };
+00102 
+00103 #endif
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_m_o_fitness_stat_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_m_o_fitness_stat_8h-source.html new file mode 100644 index 000000000..b1161a2cf --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_m_o_fitness_stat_8h-source.html @@ -0,0 +1,98 @@ + + +EO: eoMOFitnessStat.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoMOFitnessStat.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoFitnessStat.h
+00005 // (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000, 2001
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoFitnessStat_h
+00028 #define _eoFitnessStat_h
+00029 
+00030 #include <utils/eoStat.h>
+00031 
+00035 template <class EOT, class FitT = typename EOT::Fitness>
+00036 class eoFitnessStat : public eoSortedStat<EOT, std::vector<FitT> >
+00037 {
+00038 public :
+00039 
+00040     using eoSortedStat<EOT, std::vector<FitT> >::value;
+00041 
+00042     eoFitnessStat(std::string _description = "AllFitnesses") :
+00043       eoSortedStat<EOT,std::vector<FitT> >(std::vector<FitT>(0), _description) {}
+00044 
+00045     virtual void operator()(const std::vector<const EOT*>& _popPters)
+00046     {
+00047       value().resize(_popPters.size());
+00048       for (unsigned i=0; i<_popPters.size(); i++)
+00049         value()[i] = _popPters[i]->fitness();
+00050     }
+00051 };
+00052 
+00053 
+00057 #ifdef _MSC_VER
+00058 // The follownig is needed to avoid some bug in Visual Studio 6.0
+00059 typedef double PartFitDefault;
+00060 template <class EOT, class PartFitT = PartFitDefault>
+00061 class eoMOFitnessStat : public eoSortedStat<EOT, std::vector<PartFitT> >
+00062 #else
+00063 template <class EOT, class PartFitT = double>
+00064 class eoMOFitnessStat : public eoSortedStat<EOT, std::vector<PartFitT> >
+00065 #endif
+00066 
+00067 {
+00068 public:
+00069 
+00070     using eoSortedStat<EOT, std::vector<PartFitT> >::value;
+00071 
+00074   eoMOFitnessStat(unsigned _objective, std::string _description = "MO-Fitness") :
+00075     eoSortedStat<EOT,  std::vector<PartFitT> >(std::vector<PartFitT>(0), _description),
+00076     objective(_objective) {}
+00077 
+00078     virtual void operator()(const std::vector<const EOT*>& _popPters)
+00079     {
+00080       value().resize(_popPters.size());
+00081 
+00082       for (unsigned i=0; i<_popPters.size(); i++)
+00083       {
+00084         value()[i] = _popPters[i]->fitness()[objective];
+00085       }
+00086     }
+00087 private:
+00088   unsigned int objective;                  // The objective we're storing
+00089 
+00090 };
+00091 #endif
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_merge_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_merge_8h-source.html new file mode 100644 index 000000000..8d92a24d7 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_merge_8h-source.html @@ -0,0 +1,128 @@ + + +EO: eoMerge.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoMerge.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoMerge.h
+00005 //   Base class for elitist-merging classes
+00006 // (c) GeNeura Team, 1998
+00007 /* 
+00008    This library is free software; you can redistribute it and/or
+00009    modify it under the terms of the GNU Lesser General Public
+00010    License as published by the Free Software Foundation; either
+00011    version 2 of the License, or (at your option) any later version.
+00012 
+00013    This library is distributed in the hope that it will be useful,
+00014    but WITHOUT ANY WARRANTY; without even the implied warranty of
+00015    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00016    Lesser General Public License for more details.
+00017 
+00018    You should have received a copy of the GNU Lesser General Public
+00019    License along with this library; if not, write to the Free Software
+00020    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00021 
+00022    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef eoMerge_h
+00027 #define eoMerge_h
+00028 
+00029 //-----------------------------------------------------------------------------
+00030 
+00031 #include <stdexcept>
+00032 
+00033 // EO includes
+00034 #include <eoPop.h>     // eoPop
+00035 #include <eoFunctor.h>  // eoMerge
+00036 
+00048 template<class Chrom> class eoMerge: public eoBF<const eoPop<Chrom>&, eoPop<Chrom>&, void>
+00049 {};
+00050 
+00055 template <class EOT> class eoElitism : public eoMerge<EOT>
+00056 {
+00057 public :
+00058   eoElitism(double  _rate, bool _interpret_as_rate = true):
+00059     rate(0), combien(0)
+00060   {
+00061     if (_interpret_as_rate)
+00062       {
+00063         if ( (_rate<0) || (_rate>1) )
+00064           throw std::logic_error("eoElitism: rate shoud be in [0,1]");
+00065         rate = _rate;
+00066       }
+00067     else
+00068       {
+00069         if (_rate<0)
+00070           throw std::logic_error("Negative number of offspring in eoElitism!");
+00071         combien = (unsigned int)_rate;
+00072         if (combien != _rate)
+00073           std::cout << "Warning: Number of guys to merge in eoElitism was rounded";
+00074       }
+00075   }
+00076   
+00077   void operator()(const eoPop<EOT>& _pop, eoPop<EOT>& _offspring)
+00078   {
+00079     if ((combien == 0) && (rate == 0.0))
+00080       return;
+00081     unsigned combienLocal;
+00082     if (combien == 0)      // rate is specified
+00083       combienLocal = (unsigned int) (rate * _pop.size());
+00084     else
+00085       combienLocal = combien;
+00086     
+00087     if (combienLocal > _pop.size())
+00088       throw std::logic_error("Elite larger than population");
+00089     
+00090     std::vector<const EOT*> result;
+00091     _pop.nth_element(combienLocal, result);
+00092     
+00093     for (size_t i = 0; i < result.size(); ++i)
+00094       {
+00095         _offspring.push_back(*result[i]);
+00096       }
+00097   }
+00098   
+00099 private :
+00100   double rate;
+00101   unsigned combien;
+00102 };
+00103 
+00107 template <class EOT> class eoNoElitism : public eoElitism<EOT>
+00108 {
+00109     public :
+00110         eoNoElitism() : eoElitism<EOT>(0) {}
+00111 };
+00112 
+00116 template <class EOT> class eoPlus : public eoMerge<EOT>
+00117 {
+00118     public :
+00119         void operator()(const eoPop<EOT>& _pop, eoPop<EOT>& _offspring)
+00120         {
+00121             _offspring.reserve(_offspring.size() + _pop.size());
+00122 
+00123             for (size_t i = 0; i < _pop.size(); ++i)
+00124             {
+00125                 _offspring.push_back(_pop[i]);
+00126             }
+00127         }
+00128 
+00129     private :
+00130 };
+00131 
+00132 //-----------------------------------------------------------------------------
+00133 
+00134 #endif 
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_merge_reduce_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_merge_reduce_8h-source.html new file mode 100644 index 000000000..21cb3c803 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_merge_reduce_8h-source.html @@ -0,0 +1,87 @@ + + +EO: eoMergeReduce.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoMergeReduce.h

00001 
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef _eoMergeReduce_h
+00026 #define _eoMergeReduce_h
+00027 
+00028 
+00029 //-----------------------------------------------------------------------------
+00030 #include <eoPop.h>
+00031 #include <eoFunctor.h>
+00032 #include <eoMerge.h>
+00033 #include <eoReduce.h>
+00034 #include <eoReplacement.h>
+00035 #include <utils/eoHowMany.h>
+00036 //-----------------------------------------------------------------------------
+00049 template <class EOT>
+00050 class eoMergeReduce : public eoReplacement<EOT>
+00051 {
+00052     public:
+00053         eoMergeReduce(eoMerge<EOT>& _merge, eoReduce<EOT>& _reduce) :
+00054         merge(_merge), reduce(_reduce)
+00055         {}
+00056 
+00057         void operator()(eoPop<EOT>& _parents, eoPop<EOT>& _offspring)
+00058         {
+00059             merge(_parents, _offspring); // parents untouched, result in offspring
+00060             reduce(_offspring, _parents.size());
+00061             _parents.swap(_offspring);
+00062         }
+00063 
+00064     private :
+00065         eoMerge<EOT>& merge;
+00066         eoReduce<EOT>& reduce;
+00067 };
+00068 
+00072 template <class EOT>
+00073 class eoPlusReplacement : public eoMergeReduce<EOT>
+00074 {
+00075     public :
+00076         eoPlusReplacement() : eoMergeReduce<EOT>(plus, truncate) {}
+00077 
+00078     private :
+00079         eoPlus<EOT> plus;
+00080         eoTruncate<EOT> truncate;
+00081 };
+00082 
+00086 template <class EOT>
+00087 class eoCommaReplacement : public eoMergeReduce<EOT>
+00088 {
+00089     public :
+00090         eoCommaReplacement() : eoMergeReduce<EOT>(no_elite, truncate) {}
+00091 
+00092     private :
+00093         eoNoElitism<EOT> no_elite;
+00094         eoTruncate<EOT> truncate;
+00095 };
+00096 
+00101 template <class EOT>
+00102 class eoEPReplacement : public eoMergeReduce<EOT>
+00103 {
+00104 public :
+00105   eoEPReplacement(int _tSize) : eoMergeReduce<EOT>(plus, truncate), truncate(_tSize)
+00106     //  {truncate.setSize(_tSize);}
+00107   {}
+00108 private :
+00109   eoPlus<EOT> plus;
+00110   eoEPReduce<EOT> truncate;
+00111 };
+00112 
+00113 
+00114 
+00115 #endif
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_monitor_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_monitor_8h-source.html new file mode 100644 index 000000000..a90b1be98 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_monitor_8h-source.html @@ -0,0 +1,69 @@ + + +EO: eoMonitor.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoMonitor.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoMonitor.h
+00005 // (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mak@dhi.dk
+00024 CVS Info: $Date: 2004/06/15 07:09:57 $ $Header: /cvsroot/eodev/eo/src/utils/eoMonitor.h,v 1.11 2004/06/15 07:09:57 evomarc Exp $ $Author: evomarc $ 
+00025 
+00026  */
+00027 //-----------------------------------------------------------------------------
+00028 
+00029 #ifndef _eoMonitor_h
+00030 #define _eoMonitor_h
+00031 
+00032 
+00033 #include <vector>
+00034 
+00035 #include <eoFunctor.h>
+00036 
+00037 class eoParam;
+00038 
+00046 class eoMonitor : public eoF<eoMonitor&>
+00047 {
+00048 public :
+00049 
+00050   virtual void lastCall() {}
+00051 
+00056   virtual void add(const eoParam& _param) { vec.push_back(&_param); }
+00057 
+00058   virtual std::string className(void) const { return "eoMonitor"; }
+00059 
+00060 protected :
+00061     typedef std::vector<const eoParam*>::iterator iterator;
+00062     std::vector<const eoParam*> vec;
+00063 };
+00064 
+00065 #endif
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_n_d_sorting_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_n_d_sorting_8h-source.html new file mode 100644 index 000000000..1eb008e3b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_n_d_sorting_8h-source.html @@ -0,0 +1,439 @@ + + +EO: eoNDSorting.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoNDSorting.h

00001 
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef eoNDSorting_h
+00028 #define eoNDSorting_h
+00029 
+00030 #include <EO.h>
+00031 #include <algorithm>
+00032 #include <eoPop.h>
+00033 #include <eoPerf2Worth.h>
+00034 #include <cassert>
+00035 
+00041 template <class EOT>
+00042 class eoNDSorting : public eoPerf2WorthCached<EOT, double>
+00043 {
+00044   public :
+00045 
+00046     using eoPerf2WorthCached<EOT, double>::value;
+00047       eoNDSorting(bool nasty_flag_ = false)
+00048           : nasty_declone_flag_that_only_is_implemented_for_two_objectives(nasty_flag_)
+00049         {}
+00050 
+00051 
+00052     eoNDSorting()
+00053         : nasty_declone_flag_that_only_is_implemented_for_two_objectives(false)
+00054         {}
+00055 
+00060     virtual std::vector<double> niche_penalty(const std::vector<unsigned>& current_front, const eoPop<EOT>& _pop) = 0;
+00061 
+00062     void calculate_worths(const eoPop<EOT>& _pop)
+00063     {
+00064         // resize the worths beforehand
+00065         value().resize(_pop.size());
+00066 
+00067         typedef typename EOT::Fitness::fitness_traits traits;
+00068 
+00069         switch (traits::nObjectives())
+00070         {
+00071             case 1:
+00072                 {
+00073                     one_objective(_pop);
+00074                     return;
+00075                 }
+00076             case 2:
+00077                 {
+00078                     two_objectives(_pop);
+00079                     return;
+00080                 }
+00081             default :
+00082                 {
+00083                     m_objectives(_pop);
+00084                 }
+00085         }
+00086     }
+00087 
+00088 private :
+00089 
+00094     class DummyEO : public EO<typename EOT::Fitness>
+00095     {
+00096       public: unsigned index;
+00097     };
+00098 
+00099     void one_objective(const eoPop<EOT>& _pop)
+00100     {
+00101         unsigned i;
+00102         std::vector<DummyEO> tmp_pop;
+00103         tmp_pop.resize(_pop.size());
+00104 
+00105         // copy pop to dummy population (only need the fitnesses)
+00106         for (i = 0; i < _pop.size(); ++i)
+00107         {
+00108           tmp_pop[i].fitness(_pop[i].fitness());
+00109           tmp_pop[i].index = i;
+00110         }
+00111 
+00112         std::sort(tmp_pop.begin(), tmp_pop.end(), std::greater<DummyEO>());
+00113 
+00114         for (i = 0; i < _pop.size(); ++i)
+00115         {
+00116           value()[tmp_pop[i].index] = _pop.size() - i; // set rank
+00117         }
+00118 
+00119         // no point in calculcating niche penalty, as every distinct fitness value has a distinct rank
+00120     }
+00121 
+00140     void two_objectives(const eoPop<EOT>& _pop)
+00141     {
+00142                 unsigned i;
+00143         typedef typename EOT::Fitness::fitness_traits traits;
+00144         assert(traits::nObjectives() == 2);
+00145 
+00146         std::vector<unsigned> sort1(_pop.size()); // index into population sorted on first objective
+00147 
+00148         for (i = 0; i < _pop.size(); ++i)
+00149         {
+00150             sort1[i] = i;
+00151         }
+00152 
+00153         std::sort(sort1.begin(), sort1.end(), Sorter(_pop));
+00154 
+00155         // Ok, now the meat of the algorithm
+00156 
+00157         unsigned last_front = 0;
+00158 
+00159         double max1 = -1e+20;
+00160         for (i = 0; i < _pop.size(); ++i)
+00161         {
+00162             max1 = std::max(max1, _pop[i].fitness()[1]);
+00163         }
+00164 
+00165         max1 = max1 + 1.0; // add a bit to it so that it is a real upperbound
+00166 
+00167         unsigned prev_front = 0;
+00168         std::vector<double> d;
+00169         d.resize(_pop.size(), max1); // initialize with the value max1 everywhere
+00170 
+00171         std::vector<std::vector<unsigned> > fronts(_pop.size()); // to store indices into the front
+00172 
+00173         for (i = 0; i < _pop.size(); ++i)
+00174         {
+00175             unsigned index = sort1[i];
+00176 
+00177             // check for clones and delete them
+00178             if (0 && i > 0)
+00179             {
+00180                 unsigned prev = sort1[i-1];
+00181                 if ( _pop[index].fitness() == _pop[prev].fitness())
+00182                 { // it's a clone, give it the worst rank!
+00183 
+00184                     if (nasty_declone_flag_that_only_is_implemented_for_two_objectives)
+00185                         //declone
+00186                         fronts.back().push_back(index);
+00187                     else // assign it the rank of the previous
+00188                         fronts[prev_front].push_back(index);
+00189                     continue;
+00190                 }
+00191             }
+00192 
+00193             double value2 = _pop[index].fitness()[1];
+00194 
+00195             if (traits::maximizing(1))
+00196                 value2 = max1 - value2;
+00197 
+00198             // perform binary search using std::upper_bound, a log n operation for each member
+00199             std::vector<double>::iterator it =
+00200                 std::upper_bound(d.begin(), d.begin() + last_front, value2);
+00201 
+00202             unsigned front = unsigned(it - d.begin());
+00203             if (front == last_front) ++last_front;
+00204 
+00205             assert(it != d.end());
+00206 
+00207             *it = value2; //update d
+00208             fronts[front].push_back(index); // add it to the front
+00209 
+00210             prev_front = front;
+00211         }
+00212 
+00213         // ok, and finally the niche penalty
+00214 
+00215         for (i = 0; i < fronts.size(); ++i)
+00216         {
+00217             if (fronts[i].size() == 0) continue;
+00218 
+00219             // Now we have the indices to the current front in current_front, do the niching
+00220             std::vector<double> niche_count = niche_penalty(fronts[i], _pop);
+00221 
+00222             // Check whether the derived class was nice
+00223             if (niche_count.size() != fronts[i].size())
+00224             {
+00225               throw std::logic_error("eoNDSorting: niche and front should have the same size");
+00226             }
+00227 
+00228             double max_niche = *std::max_element(niche_count.begin(), niche_count.end());
+00229 
+00230             for (unsigned j = 0; j < fronts[i].size(); ++j)
+00231             {
+00232               value()[fronts[i][j]] = i + niche_count[j] / (max_niche + 1.); // divide by max_niche + 1 to ensure that this front does not overlap with the next
+00233             }
+00234 
+00235         }
+00236 
+00237         // invert ranks to obtain a 'bigger is better' score
+00238         rank_to_worth();
+00239     }
+00240 
+00241     class Sorter
+00242     {
+00243         public:
+00244             Sorter(const eoPop<EOT>& _pop) : pop(_pop) {}
+00245 
+00246             bool operator()(unsigned i, unsigned j) const
+00247             {
+00248                 typedef typename EOT::Fitness::fitness_traits traits;
+00249 
+00250                 double diff = pop[i].fitness()[0] - pop[j].fitness()[0];
+00251 
+00252                 if (fabs(diff) < traits::tol())
+00253                 {
+00254                     diff = pop[i].fitness()[1] - pop[j].fitness()[1];
+00255 
+00256                     if (fabs(diff) < traits::tol())
+00257                         return false;
+00258 
+00259                     if (traits::maximizing(1))
+00260                         return diff > 0.;
+00261                     return diff < 0.;
+00262                 }
+00263 
+00264                 if (traits::maximizing(0))
+00265                     return diff > 0.;
+00266                 return diff < 0.;
+00267             }
+00268 
+00269             const eoPop<EOT>& pop;
+00270     };
+00271 
+00272     void m_objectives(const eoPop<EOT>& _pop)
+00273     {
+00274       unsigned i;
+00275 
+00276       typedef typename EOT::Fitness::fitness_traits traits;
+00277 
+00278       std::vector<std::vector<unsigned> > S(_pop.size()); // which individuals does guy i dominate
+00279       std::vector<unsigned> n(_pop.size(), 0); // how many individuals dominate guy i
+00280 
+00281       unsigned j;
+00282       for (i = 0; i < _pop.size(); ++i)
+00283       {
+00284         for (j = 0; j < _pop.size(); ++j)
+00285         {
+00286           if (_pop[i].fitness().dominates(_pop[j].fitness()))
+00287           { // i dominates j
+00288             S[i].push_back(j); // add j to i's domination std::list
+00289 
+00290             //n[j]++; // as i dominates j
+00291           }
+00292           else if (_pop[j].fitness().dominates(_pop[i].fitness()))
+00293           { // j dominates i, increment count for i, add i to the domination std::list of j
+00294             n[i]++;
+00295 
+00296             //S[j].push_back(i);
+00297           }
+00298         }
+00299       }
+00300 
+00301       std::vector<unsigned> current_front;
+00302       current_front.reserve(_pop.size());
+00303 
+00304       // get the first front out
+00305       for (i = 0; i < _pop.size(); ++i)
+00306       {
+00307         if (n[i] == 0)
+00308         {
+00309           current_front.push_back(i);
+00310         }
+00311       }
+00312 
+00313       std::vector<unsigned> next_front;
+00314       next_front.reserve(_pop.size());
+00315 
+00316       unsigned front_index = 0; // which front are we processing
+00317       while (!current_front.empty())
+00318       {
+00319         // Now we have the indices to the current front in current_front, do the niching
+00320         std::vector<double> niche_count = niche_penalty(current_front, _pop);
+00321 
+00322         // Check whether the derived class was nice
+00323         if (niche_count.size() != current_front.size())
+00324         {
+00325           throw std::logic_error("eoNDSorting: niche and front should have the same size");
+00326         }
+00327 
+00328         double max_niche = *std::max_element(niche_count.begin(), niche_count.end());
+00329 
+00330         for (i = 0; i < current_front.size(); ++i)
+00331         {
+00332           value()[current_front[i]] = front_index + niche_count[i] / (max_niche + 1.); // divide by max_niche + 1 to ensure that this front does not overlap with the next
+00333         }
+00334 
+00335         // Calculate which individuals are in the next front;
+00336 
+00337         for (i = 0; i < current_front.size(); ++i)
+00338         {
+00339           for (j = 0; j < S[current_front[i]].size(); ++j)
+00340           {
+00341             unsigned dominated_individual = S[current_front[i]][j];
+00342             n[dominated_individual]--; // As we remove individual i -- being part of the current front -- it no longer dominates j
+00343 
+00344             if (n[dominated_individual] == 0) // it should be in the current front
+00345             {
+00346               next_front.push_back(dominated_individual);
+00347             }
+00348           }
+00349         }
+00350 
+00351         front_index++; // go to the next front
+00352         swap(current_front, next_front); // make the next front current
+00353         next_front.clear(); // clear it for the next iteration
+00354       }
+00355 
+00356       rank_to_worth();
+00357     }
+00358 
+00359     void rank_to_worth()
+00360     {
+00361       // now all that's left to do is to transform lower rank into higher worth
+00362       double max_fitness = *std::max_element(value().begin(), value().end());
+00363 
+00364       // but make sure it's an integer upper bound, so that all ranks inside the highest integer are the front
+00365       max_fitness = ceil(max_fitness);
+00366 
+00367       for (unsigned i = 0; i < value().size(); ++i)
+00368       {
+00369         value()[i] = max_fitness - value()[i];
+00370       }
+00371 
+00372     }
+00373     public : bool nasty_declone_flag_that_only_is_implemented_for_two_objectives;
+00374 };
+00375 
+00379 template <class EOT>
+00380 class eoNDSorting_I : public eoNDSorting<EOT>
+00381 {
+00382 public :
+00383   eoNDSorting_I(double _nicheSize, bool nasty_flag_ = false) : eoNDSorting<EOT>(nasty_flag_), nicheSize(_nicheSize) {}
+00384 
+00385   std::vector<double> niche_penalty(const std::vector<unsigned>& current_front, const eoPop<EOT>& _pop)
+00386   {
+00387         std::vector<double> niche_count(current_front.size(), 0.);
+00388 
+00389         for (unsigned i = 0; i < current_front.size(); ++i)
+00390         { // calculate whether the other points lie within the nice
+00391           for (unsigned j = 0; j < current_front.size(); ++j)
+00392           {
+00393             if (i == j)
+00394               continue;
+00395 
+00396             double dist = 0.0;
+00397 
+00398             for (unsigned k = 0; k < _pop[current_front[j]].fitness().size(); ++k)
+00399             {
+00400               double d = _pop[current_front[i]].fitness()[k] - _pop[current_front[j]].fitness()[k];
+00401               dist += d*d;
+00402             }
+00403 
+00404             if (dist < nicheSize)
+00405             {
+00406               niche_count[i] += 1.0 - pow(dist / nicheSize,2.);
+00407             }
+00408           }
+00409         }
+00410 
+00411         return niche_count;
+00412   }
+00413 
+00414   private :
+00415 
+00416   double nicheSize;
+00417 };
+00418 
+00433 template <class EOT>
+00434 class eoNDSorting_II : public eoNDSorting<EOT>
+00435 {
+00436   public:
+00437 
+00438     eoNDSorting_II(bool nasty_flag_ = false) : eoNDSorting<EOT>(nasty_flag_) {}
+00439 
+00440   typedef std::pair<double, unsigned> double_index_pair;
+00441 
+00442   class compare_nodes
+00443   {
+00444   public :
+00445     bool operator()(const double_index_pair& a, const double_index_pair& b) const
+00446     {
+00447       return a.first < b.first;
+00448     }
+00449   };
+00450 
+00452   std::vector<double> niche_penalty(const std::vector<unsigned>& _cf, const eoPop<EOT>& _pop)
+00453   {
+00454     typedef typename EOT::Fitness::fitness_traits traits;
+00455     unsigned i;
+00456     std::vector<double> niche_count(_cf.size(), 0.);
+00457 
+00458 
+00459     unsigned nObjectives = traits::nObjectives(); //_pop[_cf[0]].fitness().size();
+00460 
+00461     for (unsigned o = 0; o < nObjectives; ++o)
+00462     {
+00463 
+00464       std::vector<std::pair<double, unsigned> > performance(_cf.size());
+00465       for (i =0; i < _cf.size(); ++i)
+00466       {
+00467         performance[i].first = _pop[_cf[i]].fitness()[o];
+00468         performance[i].second = i;
+00469       }
+00470 
+00471       std::sort(performance.begin(), performance.end(), compare_nodes()); // a lambda operator would've been nice here
+00472 
+00473       std::vector<double> nc(niche_count.size(), 0.0);
+00474 
+00475       for (i = 1; i < _cf.size()-1; ++i)
+00476       { // and yet another level of indirection
+00477         nc[performance[i].second] = performance[i+1].first - performance[i-1].first;
+00478       }
+00479 
+00480       double max_dist = *std::max_element(nc.begin(), nc.end());
+00481 
+00482       // set boundary at max_dist + 1 (so it will get chosen over all the others
+00483       nc[performance[0].second] = max_dist + 1;
+00484       nc[performance.back().second] = max_dist + 1;
+00485 
+00486       for (i = 0; i < nc.size(); ++i)
+00487       {
+00488         niche_count[i] = (max_dist + 1 - nc[i]);
+00489       }
+00490     }
+00491 
+00492     return niche_count;
+00493   }
+00494 };
+00495 
+00496 #endif
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_normal_mutation_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_normal_mutation_8h-source.html new file mode 100644 index 000000000..6dabf4371 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_normal_mutation_8h-source.html @@ -0,0 +1,208 @@ + + +EO: eoNormalMutation.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

eoNormalMutation.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoNormalMutation.h
+00005 // (c) EEAAX 2001 - Maarten Keijzer 2000
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: Marc.Schoenauer@polytechnique.fr
+00022              mak@dhi.dk
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef eoNormalMutation_h
+00027 #define eoNormalMutation_h
+00028 
+00029 //-----------------------------------------------------------------------------
+00030 
+00031 #include <algorithm>    // swap_ranges
+00032 #include <utils/eoRNG.h>
+00033 #include <utils/eoUpdatable.h>
+00034 #include <eoEvalFunc.h>
+00035 #include <es/eoReal.h>
+00036 #include <utils/eoRealBounds.h>
+00037 //-----------------------------------------------------------------------------
+00038 
+00048 template<class EOT> class eoNormalVecMutation: public eoMonOp<EOT>
+00049 {
+00050  public:
+00058   eoNormalVecMutation(double _sigma, const double& _p_change = 1.0):
+00059     sigma(_sigma), bounds(eoDummyVectorNoBounds), p_change(_p_change) {}
+00060 
+00069   eoNormalVecMutation(eoRealVectorBounds & _bounds,
+00070                     double _sigma, const double& _p_change = 1.0):
+00071     sigma(_bounds.size(), _sigma), bounds(_bounds), p_change(_p_change)
+00072   {
+00073     // scale to the range - if any
+00074     for (unsigned i=0; i<bounds.size(); i++)
+00075       if (bounds.isBounded(i))
+00076           sigma[i] *= _sigma*bounds.range(i);
+00077   }
+00078 
+00080   virtual std::string className() const { return "eoNormalVecMutation"; }
+00081 
+00086   bool operator()(EOT& _eo)
+00087     {
+00088       bool hasChanged=false;
+00089       for (unsigned lieu=0; lieu<_eo.size(); lieu++)
+00090         {
+00091           if (rng.flip(p_change))
+00092             {
+00093               _eo[lieu] += sigma[lieu]*rng.normal();
+00094               bounds.foldsInBounds(lieu, _eo[lieu]);
+00095               hasChanged = true;
+00096             }
+00097         }
+00098       return hasChanged;
+00099     }
+00100 
+00101 private:
+00102   std::vector<double> sigma;
+00103   eoRealVectorBounds & bounds;
+00104   double p_change;
+00105 };
+00106 
+00116 template<class EOT> class eoNormalMutation
+00117     : public eoMonOp<EOT>
+00118 {
+00119 public:
+00127   eoNormalMutation(double & _sigma, const double& _p_change = 1.0):
+00128     sigma(_sigma), bounds(eoDummyVectorNoBounds), p_change(_p_change) {}
+00129 
+00136   eoNormalMutation(eoRealVectorBounds & _bounds,
+00137                     double _sigma, const double& _p_change = 1.0):
+00138     sigma(_sigma), bounds(_bounds), p_change(_p_change) {}
+00139 
+00141   virtual std::string className() const { return "eoNormalMutation"; }
+00142 
+00147   bool operator()(EOT& _eo)
+00148     {
+00149       bool hasChanged=false;
+00150       for (unsigned lieu=0; lieu<_eo.size(); lieu++)
+00151         {
+00152           if (rng.flip(p_change))
+00153             {
+00154               _eo[lieu] += sigma*rng.normal();
+00155               bounds.foldsInBounds(lieu, _eo[lieu]);
+00156               hasChanged = true;
+00157             }
+00158         }
+00159       return hasChanged;
+00160     }
+00161 
+00163   double & Sigma() {return sigma;}
+00164 
+00165 private:
+00166   double & sigma;
+00167   eoRealVectorBounds & bounds;
+00168   double p_change;
+00169 };
+00170 
+00177 template<class EOT> class eoOneFifthMutation :
+00178   public eoNormalMutation<EOT>, public eoUpdatable
+00179 {
+00180 public:
+00181 
+00182     using eoNormalMutation< EOT >::Sigma;
+00183 
+00184     typedef typename EOT::Fitness Fitness;
+00185 
+00195   eoOneFifthMutation(eoEvalFunc<EOT> & _eval, double & _sigmaInit,
+00196                      unsigned _windowSize = 10, double _updateFactor=0.83,
+00197                      double _threshold=0.2):
+00198     eoNormalMutation<EOT>(_sigmaInit), eval(_eval),
+00199     threshold(_threshold), updateFactor(_updateFactor),
+00200     nbMut(_windowSize, 0), nbSuccess(_windowSize, 0), genIndex(0)
+00201   {
+00202     // minimal check
+00203     if (updateFactor>=1)
+00204       throw std::runtime_error("Update factor must be < 1 in eoOneFifthMutation");
+00205   }
+00206 
+00208   virtual std::string className() const { return "eoOneFifthMutation"; }
+00209 
+00216   bool operator()(EOT & _eo)
+00217     {
+00218       if (_eo.invalid())           // due to some crossover???
+00219         eval(_eo);
+00220       Fitness oldFitness = _eo.fitness(); // save old fitness
+00221 
+00222       // call standard operator - then count the successes
+00223       if (eoNormalMutation<EOT>::operator()(_eo)) // _eo has been modified
+00224         {
+00225           _eo.invalidate();        // don't forget!!!
+00226           nbMut[genIndex]++;
+00227           eval(_eo);               // compute fitness of offspring
+00228 
+00229           if (_eo.fitness() > oldFitness)
+00230             nbSuccess[genIndex]++;          // update counter
+00231         }
+00232       return false;                // because eval has reset the validity flag
+00233     }
+00234 
+00238   void update()
+00239   {
+00240     unsigned totalMut = 0;
+00241     unsigned totalSuccess = 0;
+00242     // compute the average stats over the time window
+00243     for ( unsigned i=0; i<nbMut.size(); i++)
+00244       {
+00245         totalMut += nbMut[i];
+00246         totalSuccess += nbSuccess[i];
+00247       }
+00248 
+00249     // update sigma accordingly
+00250     double prop = double(totalSuccess) / totalMut;
+00251     if (prop > threshold) {
+00252       Sigma() /= updateFactor;     // increase sigma
+00253     }
+00254     else
+00255       {
+00256         Sigma() *= updateFactor;           // decrease sigma
+00257       }
+00258     genIndex = (genIndex+1) % nbMut.size() ;
+00259     nbMut[genIndex] = nbSuccess[genIndex] = 0;
+00260 
+00261   }
+00262 
+00263 private:
+00264   eoEvalFunc<EOT> & eval;
+00265   double threshold;                // 1/5 !
+00266   double updateFactor ;            // the multiplicative factor
+00267   std::vector<unsigned> nbMut;     // total number of mutations per gen
+00268   std::vector<unsigned> nbSuccess;         // number of successful mutations per gen
+00269   unsigned genIndex ;              // current index in std::vectors (circular)
+00270 };
+00271 
+00272 
+00273 //-----------------------------------------------------------------------------
+00275 #endif
+00276 
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_object_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_object_8h-source.html new file mode 100644 index 000000000..254ae16ac --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_object_8h-source.html @@ -0,0 +1,64 @@ + + +EO: eoObject.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoObject.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoObject.h
+00005 // (c) GeNeura Team, 1998
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022  */
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef EOOBJECT_H
+00026 #define EOOBJECT_H
+00027 
+00028 //-----------------------------------------------------------------------------
+00029 
+00030 #include <utils/eoData.h>       // For limits definition
+00031 #include <iostream>             // std::istream, std::ostream
+00032 #include <string>               // std::string
+00033 
+00034 #include <utils/compatibility.h>
+00035 
+00036 //-----------------------------------------------------------------------------
+00037 // eoObject
+00038 //-----------------------------------------------------------------------------
+00055 class eoObject
+00056 {
+00057  public:
+00059   virtual ~eoObject() {}
+00060   
+00070   virtual std::string className() const = 0; 
+00071 
+00072 };
+00073 
+00074 #endif
+00075 
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_one_max_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_one_max_8h-source.html new file mode 100644 index 000000000..f1e391774 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_one_max_8h-source.html @@ -0,0 +1,90 @@ + + +EO: eoOneMax.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Lesson5
+

eoOneMax.h

00001 
+00006 /*
+00007 Template for creating a new representation in EO
+00008 ================================================
+00009 */
+00010 
+00011 #ifndef _eoOneMax_h
+00012 #define _eoOneMax_h
+00013 
+00030 template< class FitT>
+00031 class eoOneMax: public EO<FitT> {
+00032 public:
+00037   eoOneMax() 
+00038   { 
+00039     // START Code of default Ctor of an eoOneMax object
+00040     // END   Code of default Ctor of an eoOneMax object
+00041   }
+00042 
+00043   virtual ~eoOneMax()
+00044   {
+00045     // START Code of Destructor of an eoEASEAGenome object
+00046     // END   Code of Destructor of an eoEASEAGenome object
+00047   }
+00048 
+00049   virtual string className() const { return "eoOneMax"; }
+00050 
+00052     void printOn(ostream& _os) const
+00053     {
+00054       // First write the fitness
+00055       EO<FitT>::printOn(_os);
+00056       _os << ' ';
+00057     // START Code of default output 
+00058 
+00063       _os << b.size() << ' ' ;
+00064       for (unsigned i=0; i<b.size(); i++)
+00065         _os << b[i] << ' ' ;
+00066     // END   Code of default output
+00067     }
+00068 
+00072   void readFrom(istream& _is)
+00073   {
+00074     // of course you should read the fitness first!
+00075     EO<FitT>::readFrom(_is);
+00076     // START Code of input
+00077 
+00082     unsigned s;
+00083     _is >> s;
+00084     b.resize(s);
+00085     for (unsigned i=0; i<s; i++)
+00086       {
+00087         bool bTmp;
+00088         _is >> bTmp;
+00089         b[i] = bTmp;
+00090       }                 
+00091     // END   Code of input
+00092   }
+00093 
+00094   // accessing and setting values
+00095   void setB(vector<bool> & _b)
+00096   {
+00097     b=_b;
+00098   }
+00099   const vector<bool> & B()
+00100   {
+00101     return b;
+00102   }
+00103 
+00104 private:                           // put all data here
+00105     // START Private data of an eoOneMax object
+00106   std::vector<bool> b;
+00107     // END   Private data of an eoOneMax object
+00108 };
+00109 
+00110 #endif
+00111 
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_one_max_eval_func_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_one_max_eval_func_8h-source.html new file mode 100644 index 000000000..f03bad558 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_one_max_eval_func_8h-source.html @@ -0,0 +1,68 @@ + + +EO: eoOneMaxEvalFunc.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Lesson5
+

eoOneMaxEvalFunc.h

00001 
+00006 /*
+00007 Template for evaluator in EO, a functor that computes the fitness of an EO
+00008 ==========================================================================
+00009 */
+00010  
+00011 #ifndef _eoOneMaxEvalFunc_h
+00012 #define _eoOneMaxEvalFunc_h
+00013 
+00014 // include whatever general include you need
+00015 #include <stdexcept>
+00016 #include <fstream>
+00017 
+00018 // include the base definition of eoEvalFunc
+00019 #include "eoEvalFunc.h"
+00020 
+00025 template <class EOT>
+00026 class eoOneMaxEvalFunc : public eoEvalFunc<EOT>
+00027 {
+00028 public:
+00030 // START eventually add or modify the anyVariable argument
+00031   eoOneMaxEvalFunc()
+00032   //  eoOneMaxEvalFunc( varType  _anyVariable) : anyVariable(_anyVariable) 
+00033 // END eventually add or modify the anyVariable argument
+00034   {
+00035     // START Code of Ctor of an eoOneMaxEvalFunc object
+00036     // END   Code of Ctor of an eoOneMaxEvalFunc object
+00037   }
+00038 
+00045   void operator()(EOT & _eo)
+00046   {
+00047     // test for invalid to avoid recomputing fitness of unmodified individuals
+00048     if (_eo.invalid())
+00049       {
+00050         double fit;                // to hold fitness value
+00051     // START Code of computation of fitness of the eoOneMax object
+00052         const vector<bool> & b = _eo.B();
+00053         fit = 0;
+00054         for (unsigned i=0; i<b.size(); i++)
+00055           fit += (b[i]?0:1);
+00056     // END   Code of computation of fitness of the eoOneMax object
+00057         _eo.fitness(fit);
+00058       }
+00059   }
+00060 
+00061 private:
+00062 // START Private data of an eoOneMaxEvalFunc object
+00063   //  varType anyVariable;                 // for example ...
+00064 // END   Private data of an eoOneMaxEvalFunc object
+00065 };
+00066 
+00067 
+00068 #endif
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_one_max_init_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_one_max_init_8h-source.html new file mode 100644 index 000000000..23913e12f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_one_max_init_8h-source.html @@ -0,0 +1,60 @@ + + +EO: eoOneMaxInit.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Lesson5
+

eoOneMaxInit.h

00001 
+00006 /*
+00007 Template for EO objects initialization in EO
+00008 ============================================
+00009 */
+00010 
+00011 #ifndef _eoOneMaxInit_h
+00012 #define _eoOneMaxInit_h
+00013 
+00014 // include the base definition of eoInit
+00015 #include <eoInit.h>
+00016 
+00025 template <class GenotypeT>
+00026 class eoOneMaxInit: public eoInit<GenotypeT> {
+00027 public:
+00029 // START eventually add or modify the anyVariable argument
+00030 //  eoOneMaxInit()
+00031     eoOneMaxInit( unsigned  _vecSize) : vecSize(_vecSize) 
+00032 // END eventually add or modify the anyVariable argument
+00033   {
+00034     // START Code of Ctor of an eoOneMaxInit object
+00035     // END   Code of Ctor of an eoOneMaxInit object
+00036   }
+00037 
+00038 
+00044   void operator()(GenotypeT & _genotype)
+00045   {
+00046     // START Code of random initialization of an eoOneMax object
+00047     vector<bool> b(vecSize);
+00048     for (unsigned i=0; i<vecSize; i++)
+00049       b[i]=rng.flip();
+00050     _genotype.setB(b);
+00051     // END   Code of random initialization of an eoOneMax object
+00052     _genotype.invalidate();        // IMPORTANT in case the _genotype is old
+00053   }
+00054 
+00055 private:
+00056 // START Private data of an eoOneMaxInit object
+00057   unsigned vecSize;     // size of all bitstrings that this eoInit randomize
+00058   //  varType anyVariable;                 // for example ...
+00059 // END   Private data of an eoOneMaxInit object
+00060 };
+00061 
+00062 #endif
+00063 
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_one_max_mutation_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_one_max_mutation_8h-source.html new file mode 100644 index 000000000..49f35bb07 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_one_max_mutation_8h-source.html @@ -0,0 +1,58 @@ + + +EO: eoOneMaxMutation.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Lesson5
+

eoOneMaxMutation.h

00001 
+00006 /*
+00007 Template for simple mutation operators
+00008 ======================================
+00009 */
+00010 
+00011 #ifndef eoOneMaxMutation_H
+00012 #define eoOneMaxMutation_H
+00013 
+00014 
+00015 #include <eoOp.h>
+00016 
+00024 template<class GenotypeT>
+00025 class eoOneMaxMutation: public eoMonOp<GenotypeT>
+00026 {
+00027 public:
+00031     // START eventually add or modify the anyVariable argument
+00032     eoOneMaxMutation()
+00033     //  eoOneMaxMutation( varType  _anyVariable) : anyVariable(_anyVariable)
+00034     // END eventually add or modify the anyVariable argument
+00035         {
+00036             // START Code of Ctor of an eoOneMaxEvalFunc object
+00037             // END   Code of Ctor of an eoOneMaxEvalFunc object
+00038         }
+00039 
+00041     string className() const { return "eoOneMaxMutation"; }
+00042 
+00047     bool operator()(GenotypeT & _genotype)
+00048         {
+00049             bool isModified(true);
+00050             // START code for mutation of the _genotype object
+00051 
+00058             return isModified;
+00059             // END code for mutation of the _genotype object
+00060         }
+00061 
+00062 private:
+00063 // START Private data of an eoOneMaxMutation object
+00064     //  varType anyVariable;               // for example ...
+00065 // END   Private data of an eoOneMaxMutation object
+00066 };
+00067 
+00068 #endif
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_one_max_quad_crossover_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_one_max_quad_crossover_8h-source.html new file mode 100644 index 000000000..f1ff78ce4 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_one_max_quad_crossover_8h-source.html @@ -0,0 +1,59 @@ + + +EO: eoOneMaxQuadCrossover.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Lesson5
+

eoOneMaxQuadCrossover.h

00001 
+00006 /*
+00007 Template for simple quadratic crossover operators
+00008 =================================================
+00009 
+00010 Quadratic crossover operators modify the both genotypes
+00011 */
+00012 
+00013 #ifndef eoOneMaxQuadCrossover_H
+00014 #define eoOneMaxQuadCrossover_H
+00015 
+00016 #include <eoOp.h>
+00017 
+00025 template<class GenotypeT>
+00026 class eoOneMaxQuadCrossover: public eoQuadOp<GenotypeT>
+00027 {
+00028 public:
+00032 // START eventually add or modify the anyVariable argument
+00033     eoOneMaxQuadCrossover()
+00034     //  eoOneMaxQuadCrossover( varType  _anyVariable) : anyVariable(_anyVariable)
+00035     // END eventually add or modify the anyVariable argument
+00036         {
+00037             // START Code of Ctor of an eoOneMaxEvalFunc object
+00038             // END   Code of Ctor of an eoOneMaxEvalFunc object
+00039         }
+00040 
+00042     string className() const { return "eoOneMaxQuadCrossover"; }
+00043 
+00049     bool operator()(GenotypeT& _genotype1, GenotypeT & _genotype2)
+00050         {
+00051             bool oneAtLeastIsModified(true);
+00052             // START code for crossover of _genotype1 and _genotype2 objects
+00053 
+00060             return oneAtLeastIsModified;
+00061             // END code for crossover of _genotype1 and _genotype2 objects
+00062         }
+00063 
+00064 private:
+00065 // START Private data of an eoOneMaxQuadCrossover object
+00066     //  varType anyVariable;               // for example ...
+00067 // END   Private data of an eoOneMaxQuadCrossover object
+00068 };
+00069 
+00070 #endif
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_one_to_one_breeder_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_one_to_one_breeder_8h-source.html new file mode 100644 index 000000000..f642e6903 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_one_to_one_breeder_8h-source.html @@ -0,0 +1,123 @@ + + +EO: eoOneToOneBreeder.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoOneToOneBreeder.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoOneToOneBreeder.h 
+00005 // (c) Maarten Keijzer and Marc Schoenauer, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: mkeijzer@dhi.dk
+00022              Marc.Schoenauer@polytechnique.fr
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef eoOneToOneBreeder_h
+00027 #define eoOneToOneBreeder_h
+00028 
+00029 //-----------------------------------------------------------------------------
+00030 
+00031 #include <eoOp.h>
+00032 #include <eoGenOp.h>
+00033 #include <eoPopulator.h>
+00034 #include <eoSelectOne.h>
+00035 #include <eoSequentialSelect.h>
+00036 #include <eoBreed.h>
+00037 #include <eoEvalFunc.h>
+00038 #include <eoPopulator.h>
+00039 #include <utils/eoHowMany.h>
+00040 
+00041 /*****************************************************************************
+00042  * eoOneToOneBreeder: transforms a population using 
+00043  *   - an operator that MODIFIES only one parent from the populator
+00044  *     (though it can use any number aside) and thus generates ONE offspring)
+00045  *   - a local replacement between the parent and its offspring
+00046  *
+00047  * Typically, Differential Evolution (Storn and Price 94) and Deb et al's 
+00048  *   G3 can be built on this
+00049  ****************************************************************************
+00050  */
+00051 template<class EOT>
+00052 class eoOneToOneBreeder: public eoBreed<EOT>
+00053 {
+00054  public:
+00062   eoOneToOneBreeder(
+00063           eoGenOp<EOT>& _op,
+00064           eoEvalFunc<EOT> & _eval, 
+00065           double _pReplace = 1.0,
+00066           eoHowMany _howMany = eoHowMany(1.0) ) :
+00067       op(_op), eval(_eval), select( false ), 
+00068       pReplace(_pReplace), howMany(_howMany) {}
+00069 
+00070 
+00078   void operator()(const eoPop<EOT>& _parents, eoPop<EOT>& _offspring)
+00079     {
+00080       unsigned target = howMany(_parents.size());
+00081       
+00082       _offspring.clear();
+00083       eoSelectivePopulator<EOT> popit(_parents, _offspring, select);
+00084       
+00085       for (unsigned iParent=0; iParent<target; iParent++)
+00086         {
+00087           unsigned pos = popit.tellp(); // remember current position
+00088           EOT theParent = *popit;  // remember the parent itself
+00089 
+00090           // now apply operator - will modify the parent
+00091           op(popit);
+00092 
+00093           // replacement
+00094           EOT & leOffspring = *popit;
+00095 
+00096           // check: only one offspring?
+00097           unsigned posEnd = popit.tellp();
+00098           if (posEnd != pos)
+00099             throw std::runtime_error("Operator can only generate a SINGLE offspring in eoOneToOneBreeder");
+00100 
+00101           // do the tournament between parent and offspring
+00102           eval(leOffspring);  // first need to evaluate the offspring
+00103           if (theParent > leOffspring) // old parent better than offspring
+00104             if (rng.uniform() < pReplace) // if probability
+00105               leOffspring = theParent; // replace
+00106           // finally, go to next guy to handle
+00107           ++popit;
+00108         }
+00109     }
+00110 
+00112   virtual std::string className() const { return "eoOneToOneBreeder"; }
+00113 
+00114  private:
+00115   eoGenOp<EOT>& op;
+00116   eoEvalFunc<EOT> & eval;
+00117   eoSequentialSelect<EOT> select;
+00118   double pReplace;
+00119   eoHowMany howMany;
+00120 };
+00121 
+00122 #endif
+00123 
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_op_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_op_8h-source.html new file mode 100644 index 000000000..8cef98616 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_op_8h-source.html @@ -0,0 +1,118 @@ + + +EO: eoOp.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoOp.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 //-----------------------------------------------------------------------------
+00003 // eoOp.h
+00004 // (c) GeNeura Team, 1998
+00005 /* 
+00006     This library is free software; you can redistribute it and/or
+00007     modify it under the terms of the GNU Lesser General Public
+00008     License as published by the Free Software Foundation; either
+00009     version 2 of the License, or (at your option) any later version.
+00010 
+00011     This library is distributed in the hope that it will be useful,
+00012     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00013     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00014     Lesser General Public License for more details.
+00015 
+00016     You should have received a copy of the GNU Lesser General Public
+00017     License along with this library; if not, write to the Free Software
+00018     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00019 
+00020     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00021     CVS Info: $Date: 2004/08/10 17:19:46 $ $Header: /cvsroot/eodev/eo/src/eoOp.h,v 1.29 2004/08/10 17:19:46 jmerelo Exp $ $Author: jmerelo $ 
+00022  */
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef _eoOp_H
+00026 #define _eoOp_H
+00027 
+00028 #include <eoObject.h>
+00029 #include <eoPrintable.h>
+00030 #include <eoFunctor.h>
+00031 #include <utils/eoRNG.h>
+00058 
+00067 template<class EOType>
+00068 class eoOp
+00069 {
+00070 public:
+00072   enum OpType { unary = 0, binary = 1, quadratic = 2, general = 3};
+00074 
+00076   eoOp(OpType _type)
+00077     :opType( _type ) {};
+00078 
+00080   eoOp( const eoOp& _eop )
+00081     :opType( _eop.opType ) {};
+00082 
+00084   virtual ~eoOp(){};
+00085 
+00087   OpType getType() const {return opType;};
+00088 
+00089 private:
+00090 
+00092   OpType opType;
+00093 };
+00094 
+00100 template <class EOType>
+00101 class eoMonOp: public eoOp<EOType>, public eoUF<EOType&, bool>
+00102 {
+00103 public:
+00105   eoMonOp()
+00106     : eoOp<EOType>( eoOp<EOType>::unary ) {};
+00107   virtual std::string className() const {return "eoMonOp";};
+00108 };
+00109 
+00110 
+00116 template<class EOType>
+00117 class eoBinOp: public eoOp<EOType>, public eoBF<EOType&, const EOType&, bool>
+00118 {
+00119 public:
+00121   eoBinOp()
+00122       :eoOp<EOType>( eoOp<EOType>::binary ) {};
+00123   virtual std::string className() const {return "eoBinOp";};
+00124 };
+00125 
+00131 template<class EOType>
+00132 class eoQuadOp: public eoOp<EOType>, public eoBF<EOType&, EOType&, bool> {
+00133 public:
+00135   eoQuadOp()
+00136     :eoOp<EOType>( eoOp<EOType>::quadratic ) {};
+00137   virtual std::string className() const {return "eoQuadOp";};
+00138 };
+00139 
+00142 template <class EOT>
+00143 class eoQuad2BinOp: public eoBinOp<EOT>
+00144 {
+00145 public:
+00149   eoQuad2BinOp(eoQuadOp<EOT> & _quadOp) : quadOp(_quadOp) {}
+00150 
+00153   bool operator()(EOT & _eo1, const EOT & _eo2)
+00154   {
+00155     EOT eoTmp = _eo2;              // a copy that can be modified
+00156     // if the embedded eoQuadOp is not symmetrical,
+00157     // the result might be biased - hence the flip ...
+00158     if (eo::rng.flip(0.5))
+00159       return quadOp(_eo1, eoTmp);          // both are modified - that's all
+00160     else
+00161       return quadOp(eoTmp, _eo1);          // both are modified - that's all
+00162   }
+00163 
+00164 private:
+00165   eoQuadOp<EOT> & quadOp;
+00166 };
+00167 
+00168 #endif
+00169 
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_op_container_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_op_container_8h-source.html new file mode 100644 index 000000000..e610e2e38 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_op_container_8h-source.html @@ -0,0 +1,149 @@ + + +EO: eoOpContainer.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoOpContainer.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoOpContainer.h
+00005 // (c) Maarten Keijzer and Marc Schoenauer, 2001
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: mkeijzer@dhi.dk
+00022              Marc.Schoenauer@polytechnique.fr
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _eoOpContainer_H
+00027 #define _eoOpContainer_H
+00028 
+00029 #include <eoGenOp.h>
+00030 
+00041 template <class EOT>
+00042 class eoOpContainer : public eoGenOp<EOT>
+00043 {
+00044   public :
+00046   eoOpContainer() : max_to_produce(0) {}
+00047 
+00050   virtual ~eoOpContainer(void) {}
+00051 
+00053   virtual unsigned max_production(void)
+00054   {
+00055     return max_to_produce;
+00056   }
+00057 
+00063   void add(eoOp<EOT>& _op, double _rate)
+00064   {
+00065     ops.push_back(&wrap_op<EOT>(_op, store));
+00066     rates.push_back(_rate);
+00067     max_to_produce = std::max(max_to_produce,ops.back()->max_production());
+00068   }
+00069 
+00070   virtual std::string className() const = 0;
+00071 
+00072   protected :
+00073 
+00074   std::vector<double> rates;
+00075   std::vector<eoGenOp<EOT>*> ops;
+00076 
+00077   private :
+00078   eoFunctorStore store;
+00079   unsigned max_to_produce;
+00080 };
+00081 
+00087 template <class EOT>
+00088 class eoSequentialOp : public eoOpContainer<EOT>
+00089 {
+00090 public:
+00091 
+00092     using eoOpContainer<EOT>::ops;
+00093     using eoOpContainer<EOT>::rates;
+00094 
+00095     typedef unsigned position_type;
+00096 
+00097 
+00098     void apply(eoPopulator<EOT>& _pop) {
+00099         position_type pos = _pop.tellp();
+00100         for (size_t i = 0; i < rates.size(); ++i) {
+00101             _pop.seekp(pos);
+00102             do {
+00103                 if (eo::rng.flip(rates[i])) {
+00104                     //            try
+00105                     //            {
+00106                     // apply it to all the guys in the todo std::list
+00107                     (*ops[i])(_pop);
+00108                     //            }
+00109                     // check for out of individuals and do nothing with that...
+00110                     //            catch(eoPopulator<EOT>::OutOfIndividuals&)
+00111                     //        {
+00112                     //          std::cout << "Warning: not enough individuals to handle\n";
+00113                     //          return ;
+00114                     //        }
+00115                 }
+00116 
+00117                 if (!_pop.exhausted())
+00118                     ++_pop;
+00119             }
+00120             while (!_pop.exhausted());
+00121         }
+00122     }
+00123     virtual std::string className() const {return "SequentialOp";}
+00124 
+00125 private:
+00126 
+00127     std::vector<size_t> to_apply;
+00128     std::vector<size_t> production;
+00129 };
+00130 
+00131 
+00132 
+00134 template <class EOT>
+00135 class eoProportionalOp : public eoOpContainer<EOT>
+00136 {
+00137 public:
+00138 
+00139     using eoOpContainer< EOT >::ops;
+00140     using eoOpContainer< EOT >::rates;
+00141 
+00142     void apply(eoPopulator<EOT>& _pop)
+00143     {
+00144       unsigned i = eo::rng.roulette_wheel(rates);
+00145 
+00146       try
+00147       {
+00148         (*ops[i])(_pop);
+00149         ++_pop;
+00150       }
+00151       catch( typename eoPopulator<EOT>::OutOfIndividuals&)
+00152       {}
+00153     }
+00154   virtual std::string className() const {return "ProportionalOp";}
+00155 };
+00156 
+00157 
+00158 #endif
+00159 
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_op_sel_mason_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_op_sel_mason_8h-source.html new file mode 100644 index 000000000..5c0686f8c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_op_sel_mason_8h-source.html @@ -0,0 +1,105 @@ + + +EO: eoOpSelMason.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoOpSelMason.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoOpSelMason.h
+00005 // (c) GeNeura Team, 1999
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022  */
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef _EOOPSELMASON_H
+00026 #define _EOOPSELMASON_H
+00027 
+00028 //-----------------------------------------------------------------------------
+00029 #include <eoProportionalOpSel.h>
+00030 #include <eoOpFactory.h>        // for eoFactory and eoOpFactory
+00031 
+00032 #include <map>
+00033 
+00034 //-----------------------------------------------------------------------------
+00035 
+00038 template<class eoClass>
+00039 class eoOpSelMason: public eoFactory<eoOpSelector<eoClass> > {
+00040         
+00041 public:
+00042         typedef std::vector<eoOp<eoClass>* > vOpP;
+00043         typedef map<eoOpSelector<eoClass>*, vOpP > MEV;
+00044 
+00046         //{@
+00048         eoOpSelMason( eoOpFactory<eoClass>& _opFact): operatorFactory( _opFact ) {};
+00049         
+00051         virtual ~eoOpSelMason() {};
+00053 
+00065         virtual eoOpSelector<eoClass>* make(std::istream& _is) {
+00066 
+00067                 std::string opSelName;
+00068                 _is >> opSelName;
+00069                 eoOpSelector<eoClass>* opSelectorP;
+00070                 // Build the operator selector
+00071                 if ( opSelName == "eoProportionalOpSel" ) {
+00072                         opSelectorP = new eoProportionalOpSel<eoClass>();
+00073                 }
+00074 
+00075                 // Temp std::vector for storing pointers
+00076                 vOpP tmpPVec;
+00077                 // read operator rate and name
+00078                 while ( _is ) {
+00079                         float rate;
+00080                         _is >> rate;
+00081                         if ( _is ) {
+00082                                 eoOp<eoClass>* op = operatorFactory.make( _is );        // This reads the rest of the line
+00083                                 // Add the operators to the selector, don´t pay attention to the IDs
+00084                                 opSelectorP->addOp( *op, rate );
+00085                                 // Keep it in the store, to destroy later
+00086                                 tmpPVec.push_back( op );
+00087                         } // if
+00088                 } // while
+00089 
+00090                 // Put it in the map
+00091                 allocMap.insert( MEV::value_type( opSelectorP, tmpPVec ) );
+00092                 
+00093                 return opSelectorP;
+00094         };
+00095 
+00097 
+00098 
+00099         virtual std::string className() const { return "eoOpSelMason"; }
+00100 
+00102         
+00103 private:
+00104         map<eoOpSelector<eoClass>*,std::vector<eoOp<eoClass>* > > allocMap;
+00105         eoOpFactory<eoClass>& operatorFactory;
+00106 };
+00107 
+00108 
+00109 #endif
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_p_b_i_l_additive_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_p_b_i_l_additive_8h-source.html new file mode 100644 index 000000000..0f1462f67 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_p_b_i_l_additive_8h-source.html @@ -0,0 +1,118 @@ + + +EO: eoPBILAdditive.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / ga
+

eoPBILAdditive.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoPBILAdditive.h
+00005 // (c) Marc Schoenauer, Maarten Keijzer, 2001
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: Marc.Schoenauer@polytechnique.fr
+00022              mkeijzer@dhi.dk
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _eoPBILAdditive_H
+00027 #define _eoPBILAdditive_H
+00028 
+00029 #include <eoDistribUpdater.h>
+00030 #include <ga/eoPBILDistrib.h>
+00031 
+00045 template <class EOT>
+00046 class eoPBILAdditive :  public eoDistribUpdater<EOT>
+00047 {
+00048 public:
+00052   eoPBILAdditive(double _LRBest, unsigned _nbBest = 1,
+00053                 double _tolerance=0.0,
+00054                 double _LRWorst = 0.0, unsigned _nbWorst = 0 ) :
+00055     maxBound(1.0-_tolerance), minBound(_tolerance),
+00056     LR(0.0), nbBest(_nbBest), nbWorst(_nbWorst)
+00057   {
+00058     if (nbBest+nbWorst == 0)
+00059       throw std::runtime_error("Must update either from best or from worst in eoPBILAdditive");
+00060 
+00061     if (_nbBest)
+00062       {
+00063         lrb = _LRBest/_nbBest;
+00064         LR += _LRBest;
+00065       }
+00066     else
+00067       lrb=0.0;                     // just in case
+00068     if (_nbWorst)
+00069       {
+00070         lrw = _LRWorst/_nbWorst;
+00071         LR += _LRWorst;
+00072       }
+00073     else
+00074       lrw=0.0;                     // just in case
+00075   }
+00076 
+00078   virtual void operator()(eoDistribution<EOT> & _distrib, eoPop<EOT>& _pop)
+00079   {
+00080     eoPBILDistrib<EOT>& distrib = dynamic_cast<eoPBILDistrib<EOT>&>(_distrib);
+00081 
+00082     std::vector<double> & p = distrib.value();
+00083 
+00084     unsigned i, popSize=_pop.size();
+00085     std::vector<const EOT*> result;
+00086     _pop.sort(result);    // is it necessary to sort the whole population?
+00087                          // but I'm soooooooo lazy !!!
+00088 
+00089     for (unsigned g=0; g<distrib.size(); g++)
+00090       {
+00091         p[g] *= (1-LR);            // relaxation
+00092         if (nbBest)                // update from some of the best
+00093           for (i=0; i<nbBest; i++)
+00094             {
+00095               const EOT & best = (*result[i]);
+00096               if ( best[g] )       // if 1, increase proba
+00097                 p[g] +=  lrb;
+00098             }
+00099         if (nbWorst)
+00100           for (i=popSize-1; i>=popSize-nbWorst; i--)
+00101             {
+00102               const EOT & best = (*result[i]);
+00103               if ( !best[g] )      // if 0, increase proba
+00104                 p[g] +=  lrw;
+00105             }
+00106         // stay in [0,1] (possibly strictly due to tolerance)
+00107         p[g] = std::min(maxBound, p[g]);
+00108         p[g] = std::max(minBound, p[g]);
+00109       }
+00110   }
+00111 
+00112 private:
+00113   double maxBound, minBound;    // proba stay away from 0 and 1 by at least tolerance
+00114   double LR;           // learning rate
+00115   unsigned nbBest;     // number of Best individuals used for update
+00116   unsigned nbWorst;    // number of Worse individuals used for update
+00117   double lrb, lrw;     // "local" learning rates (see operator())
+00118 };
+00119 
+00120 #endif
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_p_b_i_l_distrib_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_p_b_i_l_distrib_8h-source.html new file mode 100644 index 000000000..2f909fa9e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_p_b_i_l_distrib_8h-source.html @@ -0,0 +1,97 @@ + + +EO: eoPBILDistrib.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / ga
+

eoPBILDistrib.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoPBILDistrib.h
+00005 // (c) Marc Schoenauer, 2001
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: Marc.Schoenauer@inria.fr
+00022  */
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef _eoPBILDistrib_H
+00026 #define _eoPBILDistrib_H
+00027 
+00028 #include <eoDistribution.h>
+00029 
+00043 template <class EOT>
+00044 class eoPBILDistrib :  public eoDistribution<EOT>, 
+00045                        public eoValueParam<std::vector<double> >
+00046 {
+00047 public:
+00049   eoPBILDistrib(unsigned _genomeSize) :
+00050     eoDistribution<EOT>(), 
+00051     eoValueParam<std::vector<double> >(std::vector<double>(_genomeSize, 0.5), "Distribution"),
+00052     genomeSize(_genomeSize)
+00053   {}
+00054 
+00056   virtual void operator()(EOT & _eo)
+00057   {
+00058     _eo.resize(genomeSize);        // just in case
+00059     for (unsigned i=0; i<genomeSize; i++)
+00060       _eo[i] = eo::rng.flip(value()[i]);
+00061     _eo.invalidate();              // DO NOT FORGET!!!
+00062   }
+00063 
+00065   unsigned Size() {return genomeSize;}
+00066 
+00068   virtual void printOn(std::ostream& os) const
+00069   {
+00070     os << value().size() << ' ';
+00071     for (unsigned i=0; i<value().size(); i++)
+00072       os << value()[i] << ' ';
+00073   } 
+00074   
+00076   virtual void readFrom(std::istream& is)
+00077   {
+00078     unsigned sz;
+00079     is >> sz;
+00080     
+00081     value().resize(sz);
+00082     unsigned i;
+00083     
+00084     for (i = 0; i < sz; ++i)
+00085       {
+00086         double atom;
+00087         is >> atom;
+00088         value()[i] = atom;
+00089       }
+00090   }
+00091 
+00092   unsigned int size() {return genomeSize;}
+00093 
+00094   virtual std::string className() const {return "eoPBILDistrib";};
+00095 
+00096 private:
+00097   unsigned genomeSize; // size of indis
+00098 };
+00099 
+00100 #endif
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_p_b_i_l_org_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_p_b_i_l_org_8h-source.html new file mode 100644 index 000000000..7823ff899 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_p_b_i_l_org_8h-source.html @@ -0,0 +1,82 @@ + + +EO: eoPBILOrg.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / ga
+

eoPBILOrg.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoPBILOrg.h
+00005 // (c) Marc Schoenauer, Maarten Keijzer, 2001
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: Marc.Schoenauer@polytechnique.fr
+00022              mkeijzer@dhi.dk
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _eoPBILOrg_H
+00027 #define _eoPBILOrg_H
+00028 
+00029 #include <eoDistribUpdater.h>
+00030 #include <ga/eoPBILDistrib.h>
+00031 
+00041 template <class EOT>
+00042 class eoPBILOrg :  public eoDistribUpdater<EOT>
+00043 {
+00044 public:
+00046   eoPBILOrg(double _LR, double _tolerance=0.0 ) :
+00047     LR(_LR), maxBound(1.0-_tolerance), minBound(_tolerance)
+00048   {}
+00049 
+00050 
+00052   virtual void operator()(eoDistribution<EOT> & _distrib, eoPop<EOT>& _pop)
+00053   {
+00054     const EOT & best = _pop.best_element();
+00055     eoPBILDistrib<EOT>& distrib = dynamic_cast<eoPBILDistrib<EOT>&>(_distrib);
+00056 
+00057     std::vector<double> & p = distrib.value();
+00058 
+00059     for (unsigned g=0; g<distrib.size(); g++)
+00060       {
+00061         //      double & r = value()[g];
+00062         p[g] *= (1-LR);
+00063         if ( best[g] )
+00064           p[g] +=  LR;
+00065         // else nothing
+00066 
+00067         // stay away from 0 and 1
+00068         p[g] = std::min(maxBound, p[g]);
+00069         p[g] = std::max(minBound, p[g]);
+00070       }
+00071   }
+00072 
+00073 private:
+00074   double LR;    // learning rate for best guys
+00075   double maxBound, minBound;    // proba stay away from 0 and 1 by at least tolerance
+00076 };
+00077 
+00078 #endif
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_param_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_param_8h-source.html new file mode 100644 index 000000000..c37b7b0f5 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_param_8h-source.html @@ -0,0 +1,365 @@ + + +EO: eoParam.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoParam.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoParam.h
+00005 // (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000
+00006 /*
+00007   This library is free software; you can redistribute it and/or
+00008   modify it under the terms of the GNU Lesser General Public
+00009   License as published by the Free Software Foundation; either
+00010   version 2 of the License, or (at your option) any later version.
+00011 
+00012   This library is distributed in the hope that it will be useful,
+00013   but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015   Lesser General Public License for more details.
+00016 
+00017   You should have received a copy of the GNU Lesser General Public
+00018   License along with this library; if not, write to the Free Software
+00019   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021   Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022   Marc.Schoenauer@polytechnique.fr
+00023   mkeijzer@dhi.dk
+00024 */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef eoParam_h
+00028 #define eoParam_h
+00029 
+00030 #include <cmath>
+00031 #include <iterator>
+00032 #include <stdexcept>
+00033 #include <sstream>
+00034 #include <string>
+00035 #include <vector>
+00036 #include <eoScalarFitness.h>
+00037 
+00038 
+00042 class eoParam
+00043 {
+00044 public:
+00045 
+00047     eoParam ()
+00048         : repLongName(""), repDefault(""), repDescription(""),
+00049           repShortHand(0), repRequired(false)
+00050         {}
+00051 
+00060     eoParam (std::string _longName, std::string _default,
+00061              std::string _description, char _shortName = 0, bool _required = false)
+00062         : repLongName(_longName), repDefault(_default),
+00063           repDescription(_description ),
+00064           repShortHand(_shortName), repRequired( _required)
+00065         {}
+00066 
+00070     virtual ~eoParam () {};
+00071 
+00075     virtual std::string getValue () const = 0;
+00076 
+00080     virtual void setValue(const std::string& _value)   = 0 ;
+00081 
+00085     char shortName() const { return repShortHand; };
+00086 
+00090     const std::string& longName() const { return repLongName; };
+00091 
+00095     const std::string& description() const { return repDescription; };
+00096 
+00100     const std::string& defValue() const { return repDefault; };
+00101 
+00105     void defValue( const std::string& str ) { repDefault = str; };
+00106 
+00110     void setLongName(std::string _longName) { repLongName = _longName;}
+00111 
+00115     bool required() const { return repRequired; };
+00116 
+00117 private:
+00118     std::string repLongName;
+00119     std::string repDefault;
+00120     std::string repDescription;
+00121     char repShortHand;
+00122     bool repRequired;
+00123 };
+00124 
+00125 
+00126 
+00135 template <class ValueType>
+00136 class eoValueParam : public eoParam
+00137 {
+00138 public :
+00139 
+00141     eoValueParam(void) : eoParam() {}
+00142 
+00151     eoValueParam(ValueType _defaultValue,
+00152                  std::string _longName,
+00153                  std::string _description = "No description",
+00154                  char _shortHand = 0,
+00155                  bool _required = false)
+00156         : eoParam(_longName, "", _description, _shortHand, _required),
+00157           repValue(_defaultValue)
+00158         {
+00159             eoParam::defValue(getValue());
+00160         }
+00161 
+00166     ValueType& value()
+00167         { return repValue; }
+00168 
+00175     const ValueType& value() const
+00176         { return repValue; }
+00177 
+00178 
+00179     std::string getValue(void) const
+00180         {
+00181             std::ostringstream os;
+00182             os << repValue;
+00183             return os.str();
+00184         }
+00185 
+00186 
+00187     void setValue(const std::string& _value)
+00188         {
+00189             std::istringstream is(_value);
+00190             is >> repValue;
+00191         }
+00192 
+00193 protected:
+00194 
+00195     ValueType repValue;
+00196 };
+00197 
+00198 /*
+00199   Specialization for std::string
+00200 */
+00201 template <>
+00202 inline std::string eoValueParam<std::string>::getValue() const
+00203 {
+00204     return repValue;
+00205 }
+00206 
+00207 
+00208 template <>
+00209 inline void eoValueParam<bool>::setValue(const std::string& _value)
+00210 {
+00211     if (_value.empty())
+00212     {
+00213         repValue = true;
+00214         return;
+00215     }
+00216     std::istringstream is(_value);
+00217     is >> repValue;
+00218 }
+00219 
+00220 
+00222 template <>
+00223 inline std::string eoValueParam<std::pair<double, double> >::getValue(void) const
+00224 {
+00225     // use own buffer as MSVC's buffer leaks!
+00226     std::ostringstream os;
+00227     os << repValue.first << ' ' << repValue.second;
+00228     return os.str();
+00229 }
+00230 
+00232 template <>
+00233 inline void eoValueParam<std::pair<double, double> >::setValue(const std::string& _value)
+00234 {
+00235     std::istringstream is(_value);
+00236     is >> repValue.first;
+00237     is >> repValue.second;
+00238 }
+00239 
+00240 // The std::vector<std::vector<double> >
+00243 template <>
+00244 inline std::string eoValueParam<std::vector<std::vector<double> > >::getValue(void) const
+00245 {
+00246     std::ostringstream os;
+00247     os << repValue.size() << ' ';
+00248     for (unsigned i = 0; i < repValue.size(); ++i)
+00249     {
+00250         os << repValue[i].size() << ' ';
+00251         std::copy(repValue[i].begin(), repValue[i].end(), std::ostream_iterator<double>(os, " "));
+00252     }
+00253     return os.str();
+00254 }
+00255 
+00257 template <>
+00258 inline void eoValueParam<std::vector<std::vector<double> > >::setValue(const std::string& _value)
+00259 {
+00260     std::istringstream is(_value);
+00261     unsigned i,j,sz;
+00262     is >> sz;
+00263     repValue.resize(sz);
+00264 
+00265     for (i = 0; i < repValue.size(); ++i)
+00266     {
+00267         unsigned sz2;
+00268         is >> sz2;
+00269         repValue[i].resize(sz2);
+00270         for (j = 0; j < sz2; ++j)
+00271         {
+00272             is >> repValue[i][j];
+00273         }
+00274     }
+00275 }
+00276 
+00277 // The std::vector<double>
+00280 template <>
+00281 inline std::string eoValueParam<std::vector<double> >::getValue(void) const
+00282 {
+00283     std::ostringstream os;
+00284     os << repValue.size() << ' ';
+00285     std::copy(repValue.begin(), repValue.end(), std::ostream_iterator<double>(os, " "));
+00286     return os.str();
+00287 }
+00288 
+00290 template <>
+00291 inline void eoValueParam<std::vector<double> >::setValue(const std::string& _value)
+00292 {
+00293     std::istringstream is(_value);
+00294     unsigned sz;
+00295     is >> sz;
+00296     repValue.resize(sz);
+00297     std::copy(std::istream_iterator<double>(is), std::istream_iterator<double>(), repValue.begin());
+00298 }
+00299 
+00300 // The std::vector<eoMinimizingFitness>
+00303 template <>
+00304 inline std::string eoValueParam<std::vector<eoMinimizingFitness> >::getValue(void) const
+00305 {
+00306     std::ostringstream os;
+00307     os << repValue.size() << ' ';
+00308     std::copy(repValue.begin(), repValue.end(), std::ostream_iterator<eoMinimizingFitness>(os, " "));
+00309     return os.str();
+00310 }
+00311 
+00313 // NOTE: g++ doesn support it either!!!
+00314 template <>
+00315 inline void eoValueParam<std::vector<eoMinimizingFitness> >::setValue(const std::string& _value)
+00316 {
+00317     std::istringstream is(_value);
+00318     unsigned sz;
+00319     is >> sz;
+00320     repValue.resize(sz);
+00321     std::copy(std::istream_iterator<eoMinimizingFitness>(is), std::istream_iterator<eoMinimizingFitness>(), repValue.begin());
+00322 }
+00323 
+00324 // The std::vector<const EOT*>
+00326 template <>
+00327 inline std::string eoValueParam<std::vector<void*> >::getValue(void) const
+00328 {
+00329     throw std::runtime_error("I cannot getValue for a std::vector<EOT*>");
+00330     return std::string("");
+00331 }
+00332 
+00333 template <>
+00334 inline void eoValueParam<std::vector<void*> >::setValue(const std::string&)
+00335 {
+00336     throw std::runtime_error("I cannot setValue for a std::vector<EOT*>");
+00337     return;
+00338 }
+00339 
+00340 /*template <class ContainerType>
+00341   class eoContainerParam : public eoParam
+00342   {
+00343   public :
+00344   eoContainerParam (ContainerType& value, std::string _shortName, std::string _longName,
+00345   std::string _default,
+00346   std::string _description,
+00347   bool _required,
+00348   bool _change )
+00349   : value(_value), eoParam(_shortName, _longName, _description, _default, _required, _change)
+00350   {}
+00351 
+00352 
+00353   //  void setValue(const std::string & _value)
+00354   // {
+00355   //     std::istd::stringstream is(_value);
+00356   //    copy(std::istream_iterator<Container::value_type>(is), std::istream_iterator<Container::value_type>(), back_inserter(value));
+00357   // }
+00358 
+00359   private :
+00360   ContainerType& value;
+00361   };*/
+00362 
+00373 class eoParamParamType : public std::pair<std::string,std::vector<std::string> >
+00374 {
+00375 public:
+00376     eoParamParamType(std::string _value)
+00377         {
+00378             readFrom(_value);
+00379         }
+00380 
+00381     std::ostream & printOn(std::ostream & _os) const
+00382         {
+00383             _os << first;
+00384             unsigned narg = second.size();
+00385             if (!narg)
+00386                 return _os;
+00387 
+00388             // Here, we do have args
+00389             _os << "(";
+00390             if (narg == 1)         // 1 arg only
+00391             {
+00392                 _os << second[0] << ")" ;
+00393                 return _os;
+00394             }
+00395             // and here more than 1 arg
+00396             for (unsigned i=0; i<narg-1; i++)
+00397                 _os << second[i] << "," ;
+00398             _os << second[narg-1] << ")";
+00399             return _os;
+00400         }
+00401 
+00402     std::istream & readFrom(std::istream & _is)
+00403         {
+00404             std::string value;
+00405             _is >> value;
+00406             readFrom(value);
+00407             return _is;
+00408         }
+00409 
+00410     void readFrom(std::string &  _value)
+00411         {
+00412             second.resize(0);              // just in case
+00413             size_t pos = _value.find('(');
+00414             if (pos >= _value.size())      // no arguments
+00415             {
+00416                 first = _value;
+00417                 return;
+00418             }
+00419             // so here we do have arguments
+00420             std::string t = _value.substr(pos+1);// the arguments
+00421             _value.resize(pos);
+00422             first = _value;    // done for the keyword (NOTE: may be empty std::string!)
+00423 
+00424             // now all arguments
+00425             std::string delim(" (),");
+00426             while ( (pos=t.find_first_not_of(delim)) < t.size())
+00427             {
+00428                 size_t posEnd = t.find_first_of(delim, pos);
+00429                 std::string u = t.substr(pos,posEnd);//(t, pos);
+00430                 /*u.resize(posEnd - pos);*/
+00431                 second.push_back(u);
+00432                 t = t.substr(posEnd+1);
+00433             }
+00434         }
+00435 };
+00436 
+00437 // at the moment, the following are defined in eoParser.cpp
+00438 std::ostream & operator<<(std::ostream & _os, const eoParamParamType & _rate);
+00439 std::istream & operator>>(std::istream & _is,  eoParamParamType & _rate);
+00440 
+00441 #endif
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_pareto_constraint_fitness_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_pareto_constraint_fitness_8h-source.html new file mode 100644 index 000000000..49b524ebe --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_pareto_constraint_fitness_8h-source.html @@ -0,0 +1,215 @@ + + +EO: eoParetoConstraintFitness.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoParetoConstraintFitness.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoParetoConstraintFitness.h
+00005 // (c) Maarten Keijzer and Marc Schoenauer, 2001
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: mkeijzer@cs.vu.nl
+00022              Marc.Schoenauer@inria.fr
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _eoParetoConstraintFitness_h
+00027 #define _eoParetoConstraintFitness_h
+00028 
+00029 #include <math.h>
+00030 #include <vector>
+00031 #include <stdexcept>
+00032 #include <iostream>
+00033 
+00034 #include <eoParetoFitness.h>
+00035 
+00060 template <class FitnessTraits = eoParetoFitnessTraits>
+00061 class eoParetoOneConstraintFitness : public std::vector<double>
+00062 {
+00063 private: 
+00064   // this class implements only 1 inequality constraint 
+00065   //               (must ponder a bit for generality without huge overload)
+00066   double constraintValue;          // inequality cstr - must be negative
+00067 
+00068 public :
+00069   typedef FitnessTraits fitness_traits;
+00070 
+00071   eoParetoOneConstraintFitness(void) : std::vector<double>(FitnessTraits::nObjectives(),0.0)  {}
+00072 
+00073   // Ctr from a std::vector<double> (size nObjectives+1)
+00074   eoParetoOneConstraintFitness(std::vector<double> & _v) : 
+00075     std::vector<double>(_v) 
+00076   {
+00077 #ifndef NDEBUG
+00078     if (_v.size() != fitness_traits::nObjectives()+1)
+00079       throw std::runtime_error("Size error in Ctor of eoParetoOneConstraintFitness from std::vector");
+00080 #endif
+00081     constraintValue = _v[fitness_traits::nObjectives()];
+00082     resize(fitness_traits::nObjectives());
+00083   }
+00084   
+00085   // Ctr from a std::vector<double> and a value
+00086   eoParetoOneConstraintFitness(std::vector<double> & _v, double _c) : 
+00087     std::vector<double>(_v), constraintValue(_c) 
+00088   {
+00089 #ifndef NDEBUG
+00090     if (_v.size() != fitness_traits::nObjectives())
+00091       throw std::runtime_error("Size error in Ctor of eoParetoOneConstraintFitness from std::vector and value");
+00092 #endif
+00093   }
+00094   
+00095 
+00099   static void setUp(unsigned _n, std::vector<bool> & _b) {FitnessTraits::setUp(_n, _b);}
+00100   static bool maximizing(unsigned _i) { return FitnessTraits::maximizing(_i);}
+00101 
+00102   bool feasible() const { return constraintValue<=0;} 
+00103   double violation() const { return (feasible()?0.0:constraintValue);}
+00104   double ConstraintValue() const {return constraintValue;}
+00105   void ConstraintValue(double _c) {constraintValue=_c;}
+00106 
+00108   //bool operator<(const eoParetoFitness<FitnessTraits>& _other) const
+00109   bool dominates(const eoParetoOneConstraintFitness<FitnessTraits>& _other) const
+00110   {
+00111     bool dom = false;
+00112 
+00113     double tol = FitnessTraits::tol();
+00114     const std::vector<double>& performance = *this;
+00115     const std::vector<double>& otherperformance = _other;
+00116 
+00117     if (feasible() && _other.feasible())
+00118     // here both are feasible: do the "standard" domination
+00119       for (unsigned i = 0; i < FitnessTraits::nObjectives(); ++i)
+00120         {
+00121           bool maxim = FitnessTraits::maximizing(i);
+00122           double aval = maxim? performance[i] : -performance[i];
+00123           double bval = maxim? otherperformance[i] : -otherperformance[i];
+00124           
+00125           if (fabs(aval - bval) > tol)
+00126             {
+00127               if (aval < bval)
+00128                 {
+00129                   return false; // cannot dominate
+00130                 }
+00131               // else aval < bval
+00132               dom = true; // for the moment: goto next objective
+00133             }
+00134           //else they're equal in this objective, goto next
+00135         }
+00136     else
+00137       {                    // one at least is not feasible
+00138         if (feasible())
+00139           return true;             // feasible wins
+00140         else if (_other.feasible())
+00141           return false;            // feasible wins
+00142         return (violation()<_other.violation()); // smallest violation wins
+00143       }
+00144 
+00145     return dom;
+00146   }
+00147 
+00149   bool operator<(const eoParetoOneConstraintFitness<FitnessTraits>& _other) const
+00150   {
+00151     double tol = FitnessTraits::tol();
+00152     const std::vector<double>& performance = *this;
+00153     const std::vector<double>& otherperformance = _other;
+00154     for (unsigned i = 0; i < FitnessTraits::nObjectives(); ++i)
+00155     {
+00156       bool maxim = FitnessTraits::maximizing(i);
+00157       double aval = maxim? performance[i] : -performance[i];
+00158       double bval = maxim? otherperformance[i] : -otherperformance[i];
+00159 
+00160       if (fabs(aval-bval) > tol)
+00161       {
+00162         if (aval < bval)
+00163           return true;
+00164 
+00165         return false;
+00166       }
+00167     }
+00168 
+00169     return false;
+00170   }
+00171 
+00172   bool operator>(const eoParetoOneConstraintFitness<FitnessTraits>& _other) const
+00173   {
+00174     return _other < *this;
+00175   }
+00176 
+00177   bool operator<=(const eoParetoOneConstraintFitness<FitnessTraits>& _other) const
+00178   {
+00179     return operator==(_other) || operator<(_other);
+00180   }
+00181 
+00182   bool operator>=(const eoParetoOneConstraintFitness<FitnessTraits>& _other) const
+00183   {
+00184     return _other <= *this;
+00185   }
+00186 
+00187   bool operator==(const eoParetoOneConstraintFitness<FitnessTraits>& _other) const
+00188   { // check if they're all within tolerance
+00189     for (unsigned i = 0; i < size(); ++i)
+00190     {
+00191       if (fabs(operator[](i) - _other[i]) > FitnessTraits::tol())
+00192       {
+00193         return false;
+00194       }
+00195     }
+00196     return true;
+00197   }
+00198 
+00199   bool operator!=(const eoParetoOneConstraintFitness<FitnessTraits>& _other) const
+00200   { return ! operator==(_other); }
+00201 
+00202 };
+00203 
+00204 template <class FitnessTraits>
+00205 std::ostream& operator<<(std::ostream& os, const eoParetoOneConstraintFitness<FitnessTraits>& fitness)
+00206 {
+00207   for (unsigned i = 0; i < fitness.size(); ++i)
+00208   {
+00209     os << fitness[i] << ' ';
+00210   }
+00211   os << fitness.ConstraintValue() << " " ;
+00212   return os;
+00213 }
+00214 
+00215 template <class FitnessTraits>
+00216 std::istream& operator>>(std::istream& is, eoParetoOneConstraintFitness<FitnessTraits>& fitness)
+00217 {
+00218   fitness = eoParetoOneConstraintFitness<FitnessTraits>();
+00219   for (unsigned i = 0; i < fitness.size(); ++i)
+00220   {
+00221     is >> fitness[i];
+00222   }
+00223   double r;
+00224   is >> r;
+00225   fitness.ConstraintValue(r);
+00226   return is;
+00227 }
+00228 
+00229 #endif
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_pareto_fitness_8cpp-source.html b/trunk/paradiseo-eo/doc/html/eo_pareto_fitness_8cpp-source.html new file mode 100644 index 000000000..aa194a2d3 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_pareto_fitness_8cpp-source.html @@ -0,0 +1,53 @@ + + +EO: eoParetoFitness.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoParetoFitness.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002  
+00003 //-----------------------------------------------------------------------------
+00004 // eoPareto.cpp
+00005 // (c) EEAAX,1996-GeNeura Team,1998-Maarten Keijzer,2000-Marc Schoenauer 2002
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011  
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016  
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020  
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@inria.fr
+00023              mak@dhi.dk
+00024 */
+00025 //-----------------------------------------------------------------------------
+00026 #ifdef _MSC_VER
+00027 // to avoid long name warnings
+00028 #pragma warning(disable:4786)
+00029 #endif 
+00030 
+00031 #include "eoParetoFitness.h"
+00032 
+00033 
+00034 // need to allocate the static variables of class eoVariableParetoTraits
+00035 unsigned eoVariableParetoTraits::nObj;
+00036 std::vector<bool> eoVariableParetoTraits::bObj;
+00037 
+00038 
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_pareto_fitness_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_pareto_fitness_8h-source.html new file mode 100644 index 000000000..e2a562ad2 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_pareto_fitness_8h-source.html @@ -0,0 +1,221 @@ + + +EO: eoParetoFitness.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoParetoFitness.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoParetoFitness.h
+00005 // (c) Maarten Keijzer and Marc Schoenauer, 2001
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: mak@dhi.dk
+00022              Marc.Schoenauer@inria.fr
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _eoParetoFitness_h
+00027 #define _eoParetoFitness_h
+00028 
+00029 #include <math.h>
+00030 #include <vector>
+00031 #include <stdexcept>
+00032 #include <iostream>
+00033 
+00034 
+00042 class eoParetoFitnessTraits
+00043 {
+00044   public :
+00045 
+00046   static unsigned nObjectives()          { return 2; }
+00047   static double tol()               { return 1e-6; }
+00048   static bool maximizing(int which) { return true; } // by default: all are maximizing
+00049 };
+00050 
+00056 class eoVariableParetoTraits : public eoParetoFitnessTraits
+00057 {
+00058 public :
+00060   static void setUp(unsigned _n, std::vector<bool> & _b)
+00061   {
+00062     // possible problems
+00063     if ( nObj && (nObj != _n) )    // was already set to a different value
+00064       {
+00065         std::cout << "WARNING\n";
+00066         std::cout << "WARNING : you are changing the number of objectives\n";
+00067         std::cout << "WARNING : Make sure all existing objects are destroyed\n";
+00068         std::cout << "WARNING\n";
+00069       }
+00070     nObj=_n; 
+00071     bObj=_b;
+00072     if (nObj != bObj.size())
+00073       throw std::runtime_error("Number of objectives and min/max size don't match in VariableParetoTraits::setup");
+00074   }
+00075 
+00077   static unsigned nObjectives()
+00078   { 
+00079 #ifndef NDEBUG
+00080     if (!nObj)
+00081       throw std::runtime_error("Number of objectives not assigned in VariableParetoTraits");
+00082 #endif
+00083     return nObj; 
+00084   }
+00085   static bool maximizing(unsigned _i) 
+00086   {
+00087 #ifndef NDEBUG
+00088     if (_i >= bObj.size())
+00089       throw std::runtime_error("Wrong index in VariableParetoTraits");
+00090 #endif
+00091     return bObj[_i]; 
+00092   }
+00093 private:
+00094   static unsigned nObj;
+00095   static std::vector<bool> bObj;
+00096 };
+00097 
+00107 template <class FitnessTraits = eoParetoFitnessTraits>
+00108 class eoParetoFitness : public std::vector<double>
+00109 {
+00110 public :
+00111 
+00112   typedef FitnessTraits fitness_traits;
+00113 
+00114   eoParetoFitness(void) : std::vector<double>(FitnessTraits::nObjectives(),0.0) {}
+00115 
+00116   // Ctr from a std::vector<double>
+00117   eoParetoFitness(std::vector<double> & _v) : std::vector<double>(_v) {}
+00118   
+00119 
+00123   static void setUp(unsigned _n, std::vector<bool> & _b) {FitnessTraits::setUp(_n, _b);}
+00124   static bool maximizing(unsigned _i) { return FitnessTraits::maximizing(_i);}
+00125 
+00127   //bool operator<(const eoParetoFitness<FitnessTraits>& _other) const
+00128   bool dominates(const eoParetoFitness<FitnessTraits>& _other) const
+00129   {
+00130     bool dom = false;
+00131 
+00132     double tol = FitnessTraits::tol();
+00133     const std::vector<double>& performance = *this;
+00134     const std::vector<double>& otherperformance = _other;
+00135 
+00136     for (unsigned i = 0; i < FitnessTraits::nObjectives(); ++i)
+00137     {
+00138       bool maxim = FitnessTraits::maximizing(i);
+00139       double aval = maxim? performance[i] : -performance[i];
+00140       double bval = maxim? otherperformance[i] : -otherperformance[i];
+00141 
+00142       if (fabs(aval - bval) > tol)
+00143       {
+00144         if (aval < bval)
+00145         {
+00146           return false; // cannot dominate
+00147         }
+00148         // else aval < bval
+00149         dom = true; // for the moment: goto next objective
+00150       }
+00151       //else they're equal in this objective, goto next
+00152     }
+00153 
+00154     return dom;
+00155   }
+00156 
+00158   bool operator<(const eoParetoFitness<FitnessTraits>& _other) const
+00159   {
+00160     double tol = FitnessTraits::tol();
+00161     const std::vector<double>& performance = *this;
+00162     const std::vector<double>& otherperformance = _other;
+00163     for (unsigned i = 0; i < FitnessTraits::nObjectives(); ++i)
+00164     {
+00165       bool maxim = FitnessTraits::maximizing(i);
+00166       double aval = maxim? performance[i] : -performance[i];
+00167       double bval = maxim? otherperformance[i] : -otherperformance[i];
+00168 
+00169       if (fabs(aval-bval) > tol)
+00170       {
+00171         if (aval < bval)
+00172           return true;
+00173 
+00174         return false;
+00175       }
+00176     }
+00177 
+00178     return false;
+00179   }
+00180 
+00181   bool operator>(const eoParetoFitness<FitnessTraits>& _other) const
+00182   {
+00183     return _other < *this;
+00184   }
+00185 
+00186   bool operator<=(const eoParetoFitness<FitnessTraits>& _other) const
+00187   {
+00188     return operator==(_other) || operator<(_other);
+00189   }
+00190 
+00191   bool operator>=(const eoParetoFitness<FitnessTraits>& _other) const
+00192   {
+00193     return _other <= *this;
+00194   }
+00195 
+00196   bool operator==(const eoParetoFitness<FitnessTraits>& _other) const
+00197   { // check if they're all within tolerance
+00198     for (unsigned i = 0; i < size(); ++i)
+00199     {
+00200       if (fabs(operator[](i) - _other[i]) > FitnessTraits::tol())
+00201       {
+00202         return false;
+00203       }
+00204     }
+00205     return true;
+00206   }
+00207 
+00208   bool operator!=(const eoParetoFitness<FitnessTraits>& _other) const
+00209   { return ! operator==(_other); }
+00210 
+00211 };
+00212 
+00213 template <class FitnessTraits>
+00214 std::ostream& operator<<(std::ostream& os, const eoParetoFitness<FitnessTraits>& fitness)
+00215 {
+00216   for (unsigned i = 0; i < fitness.size(); ++i)
+00217   {
+00218     os << fitness[i] << ' ';
+00219   }
+00220   return os;
+00221 }
+00222 
+00223 template <class FitnessTraits>
+00224 std::istream& operator>>(std::istream& is, eoParetoFitness<FitnessTraits>& fitness)
+00225 {
+00226   fitness = eoParetoFitness<FitnessTraits>();
+00227   for (unsigned i = 0; i < fitness.size(); ++i)
+00228   {
+00229     is >> fitness[i];
+00230   }
+00231   return is;
+00232 }
+00233 
+00234 #endif
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_pareto_ranking_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_pareto_ranking_8h-source.html new file mode 100644 index 000000000..62409230f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_pareto_ranking_8h-source.html @@ -0,0 +1,57 @@ + + +EO: eoParetoRanking.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoParetoRanking.h

00001 
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef eoParetoRanking_h
+00028 #define eoParetoRanking_h
+00029 
+00030 #include <eoPerf2Worth.h>
+00031 #include <eoDominanceMap.h>
+00032 
+00039 template <class EOT>
+00040 class eoParetoRanking : public eoPerf2WorthCached<EOT, double>
+00041 {
+00042 public:
+00043 
+00044     using eoPerf2WorthCached<EOT, double>::value;
+00045 
+00046     eoParetoRanking(eoDominanceMap<EOT>& _dominanceMap)
+00047         : eoPerf2WorthCached<EOT, double>(), dominanceMap(_dominanceMap)
+00048         {}
+00049 
+00050     void calculate_worths(const eoPop<EOT>& _pop)
+00051     {
+00052       dominanceMap(_pop);
+00053       value() = dominanceMap.sum_dominators(); // get rank: 0 means part of current front
+00054 
+00055       // calculate maximum
+00056       double maxim = *std::max_element(value().begin(), value().end());
+00057 
+00058       // higher is better, so invert the value
+00059       for (unsigned i = 0; i < value().size(); ++i)
+00060       {
+00061         value()[i] = maxim - value()[i];
+00062       }
+00063 
+00064     }
+00065 
+00066   private :
+00067 
+00068   eoDominanceMap<EOT>& dominanceMap;
+00069 };
+00070 
+00071 #endif
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_parse_tree_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_parse_tree_8h-source.html new file mode 100644 index 000000000..0d00277a5 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_parse_tree_8h-source.html @@ -0,0 +1,166 @@ + + +EO: eoParseTree.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / gp
+

eoParseTree.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoParseTree.h : eoParseTree class (for Tree-based Genetic Programming)
+00005 // (c) Maarten Keijzer 2000
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              mak@dhi.dk
+00023 
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef eoParseTree_h
+00028 #define eoParseTree_h
+00029 
+00030 #include <iterator>
+00031 #include <list>
+00032 
+00033 #include <EO.h>
+00034 #include <eoInit.h>
+00035 #include <eoOp.h>
+00036 #include <gp/parse_tree.h>
+00037 
+00038 using namespace gp_parse_tree;
+00039 
+00053 template <class FType, class Node>
+00054 class eoParseTree : public EO<FType>, public parse_tree<Node>
+00055 {
+00056 public:
+00057 
+00058     using parse_tree<Node>::back;
+00059     using parse_tree<Node>::ebegin;
+00060     using parse_tree<Node>::eend;
+00061     using parse_tree<Node>::size;
+00062 
+00063 
+00064     typedef typename parse_tree<Node>::subtree Subtree;
+00065 
+00066     /* For Compatibility with the intel C++ compiler for Linux 5.x */
+00067     typedef Node reference;
+00068     typedef const reference const_reference;
+00069 
+00073     eoParseTree(void)  {}
+00074 
+00079     eoParseTree(const parse_tree<Node>& tree)  : parse_tree<Node>(tree) {}
+00080 
+00081 //    eoParseTree(const eoParseTree<FType, Node>& tree) :  parse_tree<Node>(tree) {}
+00086     virtual void pruneTree(unsigned _size)
+00087     {
+00088         if (_size < 1)
+00089             return;
+00090 
+00091         while (size() > _size)
+00092         {
+00093             back() = operator[](size()-2);
+00094         }
+00095     }
+00096 
+00102     eoParseTree(std::istream& is) : EO<FType>(), parse_tree<Node>()
+00103     {
+00104         readFrom(is);
+00105     }
+00106 
+00108     std::string className(void) const { return "eoParseTree"; }
+00109 
+00114     void printOn(std::ostream& os) const
+00115     {
+00116         EO<FType>::printOn(os);
+00117         os << ' ';
+00118 
+00119         os << size() << ' ';
+00120 
+00121         std::copy(ebegin(), eend(), std::ostream_iterator<Node>(os, " "));
+00122     }
+00123 
+00128     void readFrom(std::istream& is)
+00129     {
+00130 
+00131 
+00132         EO<FType>::readFrom(is);
+00133 
+00134         unsigned sz;
+00135         is >> sz;
+00136 
+00137 
+00138         std::vector<Node> v(sz);
+00139 
+00140         unsigned i;
+00141 
+00142         for (i = 0; i < sz; ++i)
+00143         {
+00144             Node node;
+00145             is >> node;
+00146             v[i] = node;
+00147         }
+00148         parse_tree<Node> tmp(v.begin(), v.end());
+00149         swap(tmp);
+00150 
+00151         /*
+00152          * old code which caused problems for paradisEO
+00153          *
+00154          * this can be removed once it has proved itself
+00155         EO<FType>::readFrom(is);
+00156 
+00157         // even older code
+00158         FType fit;
+00159         is >> fit;
+00160 
+00161         fitness(fit);
+00162 
+00163 
+00164         std::copy(std::istream_iterator<Node>(is), std::istream_iterator<Node>(), back_inserter(*this));
+00165         */
+00166     }
+00167 };
+00168 
+00169 // friend function to print eoParseTree
+00170 template <class FType, class Node>
+00171 std::ostream& operator<<(std::ostream& os, const eoParseTree<FType, Node>& eot)
+00172 {
+00173     eot.printOn(os);
+00174     return os;
+00175 }
+00176 
+00177 // friend function to read eoParseTree
+00178 template <class FType, class Node>
+00179 std::istream& operator>>(std::istream& is, eoParseTree<FType, Node>& eot)
+00180 {
+00181     eot.readFrom(is);
+00182     return is;
+00183 }
+00184 
+00185 // for backward compatibility
+00186 #include <gp/eoParseTreeOp.h>
+00187 #include <gp/eoParseTreeDepthInit.h>
+00188 
+00189 #endif
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_parse_tree_depth_init_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_parse_tree_depth_init_8h-source.html new file mode 100644 index 000000000..6641ad642 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_parse_tree_depth_init_8h-source.html @@ -0,0 +1,208 @@ + + +EO: eoParseTreeDepthInit.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / gp
+

eoParseTreeDepthInit.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002  
+00003 //-----------------------------------------------------------------------------
+00004 // eoParseTreeDepthInit.h : initializor for eoParseTree class
+00005 // (c) Maarten Keijzer 2000  Jeroen Eggermont 2002
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011  
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016  
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020  
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              mak@dhi.dk 
+00023              jeggermo@liacs.nl
+00024             
+00025  */
+00026 //-----------------------------------------------------------------------------
+00027 
+00028 #ifndef eoParseTreeDepthInit_h
+00029 #define eoParseTreeDepthInit_h
+00030 
+00031 #include <EO.h>
+00032 #include <gp/eoParseTree.h>
+00033 #include <eoInit.h>
+00034 #include <eoOp.h>
+00035 #include <eoPop.h>
+00036 
+00037 using namespace gp_parse_tree;
+00038 
+00044 // eoGpDepthInitializer is defined for backward compatibility
+00045 #define eoGpDepthInitializer eoParseTreeDepthInit
+00046 
+00047 template <class FType, class Node>
+00048 class eoParseTreeDepthInit : public eoInit< eoParseTree<FType, Node> >
+00049 {
+00050     protected:
+00051         // a binary predicate for sorting
+00052         // hopefully this will work with M$VC++ 6.0
+00053         struct lt_arity:public std::binary_function<Node,Node,bool>
+00054         {
+00055                 bool operator()(const Node &_node1, const Node &_node2) { return (_node1.arity() < _node2.arity());};
+00056         };
+00057 
+00058     public :
+00059 
+00060     typedef eoParseTree<FType, Node> EoType;
+00061     
+00069         eoParseTreeDepthInit(
+00070         unsigned _max_depth,
+00071         const std::vector<Node>& _initializor,
+00072         bool _grow = true,
+00073         bool _ramped_half_and_half = false)
+00074             :
+00075             eoInit<EoType>(),
+00076                         max_depth(_max_depth),
+00077                         initializor(_initializor),
+00078                         grow(_grow),
+00079                         ramped_half_and_half(_ramped_half_and_half),
+00080                         current_depth(_max_depth)
+00081     {
+00082       if(initializor.empty())
+00083       {
+00084         throw std::logic_error("eoParseTreeDepthInit: uhm, wouldn't you rather give a non-empty set of Nodes?");
+00085       }
+00086       // lets sort the initializor std::vector according to  arity (so we can be sure the terminals are in front)
+00087       // we use stable_sort so that if element i was in front of element j and they have the same arity i remains in front of j
+00088       stable_sort(initializor.begin(), initializor.end(), lt_arity());
+00089     }
+00091         virtual std::string className() const { return "eoParseTreeDepthInit"; };
+00092 
+00096     void operator()(EoType& _tree)
+00097         {
+00098         std::list<Node> sequence;
+00099         generate(sequence, current_depth);
+00100 
+00101         parse_tree<Node> tmp(sequence.begin(), sequence.end());
+00102         _tree.swap(tmp);
+00103         
+00104         if(ramped_half_and_half)
+00105         {
+00106                 if(grow)
+00107                 {
+00108                         if (current_depth > 2)
+00109                                 current_depth--;
+00110                         else
+00111                                 current_depth = max_depth;      
+00112                 }
+00113                 // change the grow method from 'grow' to 'full' or from 'full' to 'grow'
+00114                 grow = !grow;
+00115         };
+00116         
+00117         }
+00118    private :
+00119     void generate(std::list<Node>& sequence, int the_max, int last_terminal = -1)
+00120     {
+00121             if (last_terminal == -1)
+00122             { // check where the last terminal in the sequence resides
+00123             typename std::vector<Node>::iterator it;
+00124                     for (it = initializor.begin(); it != initializor.end(); ++it)
+00125                     {
+00126                             if (it->arity() > 0)
+00127                                     break;
+00128                     }
+00129                 
+00130                     last_terminal = it - initializor.begin();
+00131             }
+00132 
+00133             if (the_max == 1)
+00134             { // generate terminals only
+00135                     typename std::vector<Node>::iterator it = initializor.begin() + rng.random(last_terminal);
+00136                     it->randomize();
+00137                     sequence.push_front(*it);
+00138                     return;
+00139             }
+00140         
+00141             typename std::vector<Node>::iterator what_it;
+00142 
+00143             if (grow)
+00144             {
+00145                     what_it = initializor.begin() + rng.random(initializor.size());
+00146             }
+00147             else // full
+00148             {
+00149                     what_it = initializor.begin() + last_terminal + rng.random(initializor.size() - last_terminal);
+00150             }
+00151 
+00152         what_it->randomize();
+00153 
+00154             sequence.push_front(*what_it);
+00155 
+00156             for (int i = 0; i < what_it->arity(); ++i)
+00157                     generate(sequence, the_max - 1, last_terminal);
+00158     }
+00159 
+00160 
+00161 
+00162         unsigned max_depth; 
+00163         std::vector<Node> initializor;
+00164         bool grow;
+00165         bool ramped_half_and_half;
+00166         unsigned current_depth;
+00167 };
+00168 
+00178 template <class FType, class Node>
+00179 void  eoInitRampedHalfAndHalf(eoPop< eoParseTree<FType,Node> > &pop, unsigned int population_size, unsigned int init_max_depth, std::vector<Node> &initializor)
+00180 {
+00181         typedef eoParseTree<FType,Node> EoType;
+00182         typedef eoPop< EoType > Pop;
+00183         
+00184         unsigned int M = init_max_depth - 1;
+00185         unsigned int part_pop_size = population_size / (2*M);
+00186         unsigned int m=0;
+00187 
+00188         std::cerr << "EO WARNING: Ramped Half and Half Initialization is now supported by eoParseTreeDepthInit." << std::endl;
+00189         std::cerr << "            This function is now obsolete and might be removed in the future so you should"<< std::endl;
+00190         std::cerr << "            update your code to use: " << std::endl << std::endl;
+00191         std::cerr << "            eoParseTreeDepthInit( _max_depth, _initializer, bool _grow, bool _ramped_half_and_half)" << std::endl << std::endl;
+00192         
+00193         pop.clear();
+00194         
+00195         // initialize with Depth's (D) -> 2
+00196         for(m=init_max_depth; m >= 2; m--)
+00197         {
+00198                 eoParseTreeDepthInit<FType, Node> grow_initializer(m, initializor, true);
+00199                 Pop grow(part_pop_size, grow_initializer);
+00200                 pop.insert(pop.begin(), grow.begin(), grow.end());
+00201                 
+00202                 eoParseTreeDepthInit<FType, Node> full_initializer(m, initializor, false);
+00203                 Pop full(part_pop_size, full_initializer);
+00204                 pop.insert(pop.begin(), full.begin(), full.end());
+00205         }       
+00206         
+00207         bool g = true;
+00208         while (pop.size() < population_size)
+00209         {
+00210                 eoParseTreeDepthInit<FType, Node> initializer(init_max_depth, initializor, g);
+00211                 Pop p(1, initializer);
+00212                 pop.insert(pop.begin(), p.begin(), p.end());
+00213                 g= !g;
+00214         }
+00215 }
+00216 
+00217 
+00218 #endif
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_parse_tree_op_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_parse_tree_op_8h-source.html new file mode 100644 index 000000000..3d494cc5c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_parse_tree_op_8h-source.html @@ -0,0 +1,303 @@ + + +EO: eoParseTreeOp.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / gp
+

eoParseTreeOp.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002  
+00003 //-----------------------------------------------------------------------------
+00004 // eoParseTreeOp.h : crossover and mutation operator for  the eoParseTree class
+00005 // (c) Maarten Keijzer 2000  for eoSubtreeXOver, eoBranchMutation
+00006 // (c) Jeroen Eggermont 2001 for other mutation operators
+00007 
+00008 /*
+00009     This library is free software; you can redistribute it and/or
+00010     modify it under the terms of the GNU Lesser General Public
+00011     License as published by the Free Software Foundation; either
+00012     version 2 of the License, or (at your option) any later version.
+00013  
+00014     This library is distributed in the hope that it will be useful,
+00015     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00016     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00017     Lesser General Public License for more details.
+00018  
+00019     You should have received a copy of the GNU Lesser General Public
+00020     License along with this library; if not, write to the Free Software
+00021     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00022  
+00023     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00024              mak@dhi.dk 
+00025              jeggermo@liacs.nl
+00026  */
+00027 //-----------------------------------------------------------------------------
+00028 
+00029 #ifndef eoParseTreeOp_h
+00030 #define eoParseTreeOp_h
+00031 
+00032 #include <EO.h>
+00033 #include <eoOp.h>
+00034 
+00035 #include <gp/eoParseTree.h>
+00036 
+00041 template<class FType, class Node>
+00042 class eoSubtreeXOver: public eoQuadOp< eoParseTree<FType, Node> > {
+00043 public:
+00044 
+00045   typedef eoParseTree<FType,Node> EoType;
+00050   eoSubtreeXOver( unsigned _max_length)
+00051     : eoQuadOp<EoType>(), max_length(_max_length) {};
+00052 
+00054   virtual std::string className() const { return "eoSubtreeXOver"; };
+00055 
+00057   virtual ~eoSubtreeXOver () {};
+00058 
+00064   bool operator()(EoType & _eo1, EoType & _eo2 )
+00065   {
+00066           int i = rng.random(_eo1.size());
+00067           int j = rng.random(_eo2.size());
+00068 
+00069           typename parse_tree<Node>::subtree tmp = _eo1[i];
+00070           _eo1[i] = _eo2[j]; // insert subtree
+00071           _eo2[j] = tmp;
+00072 
+00073           _eo1.pruneTree(max_length);
+00074           _eo2.pruneTree(max_length);
+00075           
+00076     return true;
+00077   }
+00078  private:
+00079   unsigned max_length;
+00080 };
+00081 
+00086 template<class FType, class Node>
+00087 class eoBranchMutation: public eoMonOp< eoParseTree<FType, Node> >
+00088 {
+00089 public:
+00090 
+00091   typedef eoParseTree<FType,Node> EoType;
+00097   eoBranchMutation(eoInit<EoType>& _init, unsigned _max_length)
+00098     : eoMonOp<EoType>(), max_length(_max_length), initializer(_init)
+00099   {};
+00100   
+00102   virtual std::string className() const { return "eoBranchMutation"; };
+00103 
+00105   virtual ~eoBranchMutation() {};
+00106   
+00111   bool operator()(EoType& _eo1 )
+00112   {
+00113           int i = rng.random(_eo1.size());
+00114 
+00115       EoType eo2;
+00116       initializer(eo2);
+00117 
+00118           int j = rng.random(eo2.size());
+00119 
+00120           _eo1[i] = eo2[j]; // insert subtree
+00121 
+00122           _eo1.pruneTree(max_length);
+00123 
+00124     return true;
+00125   }
+00126 
+00127 private :
+00128 
+00129   unsigned max_length;
+00130   eoInit<EoType>& initializer;
+00131 };
+00132 
+00133 // Additional Mutation operators from 
+00134 // TITLE:"Genetic Programming~An Introduction"
+00135 // AUTHORS: Banzhaf, Nordin, Keller, Francone
+00136 // ISBN: 3-920993-58-6
+00137 // ISBN: 1-55860-510-X
+00138 //
+00139 // For the eoParseTree class
+00140 
+00146 template<class FType, class Node>
+00147 class eoPointMutation: public eoMonOp< eoParseTree<FType, Node> >
+00148 {
+00149 public:
+00150 
+00151   typedef eoParseTree<FType,Node> EoType;
+00152 
+00157   eoPointMutation( std::vector<Node>& _initializor)
+00158     : eoMonOp<EoType>(), initializor(_initializor)
+00159   {};
+00160   
+00162   virtual std::string className() const { return "eoPointMutation"; };
+00163 
+00165   virtual ~eoPointMutation() {};
+00166 
+00171   bool operator()(EoType& _eo1 )
+00172   {
+00173         // select a random node i that is to be mutated
+00174         int i = rng.random(_eo1.size());
+00175         // request the arity of the node that is to be replaced
+00176         int arity = _eo1[i].arity();
+00177         
+00178         int j=0;
+00179         
+00180         do
+00181         {
+00182                 j = rng.random(initializor.size());
+00183                 
+00184         }while ((initializor[j].arity() != arity));
+00185         
+00186         _eo1[i] = initializor[j];
+00187         
+00188         
+00189         
+00190         return true;
+00191   }
+00192 
+00193 private :
+00194         std::vector<Node>& initializor;
+00195 
+00196 };
+00197 
+00203 template<class FType, class Node>
+00204 class eoExpansionMutation: public eoMonOp< eoParseTree<FType, Node> >
+00205 {
+00206 public:
+00207 
+00208   typedef eoParseTree<FType, Node> EoType;
+00209   
+00215   eoExpansionMutation(eoInit<EoType>& _init, unsigned _max_length)
+00216     : eoMonOp<EoType>(), max_length(_max_length), initializer(_init)
+00217   {};
+00218   
+00220   virtual std::string className() const { return "eoExpansionMutation"; };
+00221 
+00223   virtual ~eoExpansionMutation() {};
+00228   bool operator()(EoType& _eo1 )
+00229   {
+00230           int i = rng.random(_eo1.size());
+00231           // look for a terminal
+00232           while (_eo1[i].arity() != 0)
+00233           {
+00234                 i= rng.random(_eo1.size());
+00235           };
+00236           
+00237           // create a new tree to
+00238           EoType eo2;
+00239           // make sure we get a tree with more than just a terminal
+00240           do
+00241           {
+00242                 initializer(eo2);
+00243           }while(eo2.size() == 1);      
+00244           
+00245           int j = rng.random(eo2.size());
+00246           // make sure we select a subtree (and not a terminal)
+00247           while((eo2[j].arity() == 0))
+00248           {
+00249                 j = rng.random(eo2.size());
+00250           };
+00251           
+00252 
+00253           _eo1[i] = eo2[j]; // insert subtree
+00254 
+00255           _eo1.pruneTree(max_length);
+00256           
+00257     return true;
+00258   }
+00259 
+00260 private :
+00261 
+00262   unsigned max_length;
+00263   eoInit<EoType>& initializer;
+00264 };
+00265 
+00271 template<class FType, class Node>
+00272 class eoCollapseSubtreeMutation: public eoMonOp< eoParseTree<FType, Node> >
+00273 {
+00274 public:
+00275 
+00276   typedef eoParseTree<FType,Node> EoType;
+00282   eoCollapseSubtreeMutation(eoInit<EoType>& _init, unsigned _max_length)
+00283     : eoMonOp<EoType>(), max_length(_max_length), initializer(_init)
+00284   {};
+00285 
+00287   virtual std::string className() const { return "eoCollapseSubtreeMutation"; };
+00288 
+00290   virtual ~eoCollapseSubtreeMutation() {};
+00295   bool operator()(EoType& _eo1 )
+00296   {
+00297           int i = rng.random(_eo1.size());
+00298           // look for a subtree
+00299           while ((_eo1[i].arity() == 0) && (_eo1.size() > 1))
+00300           {
+00301                 i= rng.random(_eo1.size());
+00302           };
+00303         
+00304           // create a new tree to
+00305           EoType eo2;
+00306           initializer(eo2);
+00307           
+00308           int j = rng.random(eo2.size());
+00309           // make sure we select a subtree (and not a terminal)
+00310           while(eo2[j].arity() != 0)
+00311           {
+00312                 j = rng.random(eo2.size());
+00313           };
+00314 
+00315           _eo1[i] = eo2[j]; // insert subtree
+00316           
+00317           // we don't have to prune because the subtree is always smaller
+00318           _eo1.pruneTree(max_length);
+00319         
+00320     return true;
+00321   }
+00322 
+00323 private :
+00324 
+00325   unsigned max_length;
+00326   eoInit<EoType>& initializer;
+00327 };
+00328 
+00329 
+00335 template<class FType, class Node>
+00336 class eoHoistMutation: public eoMonOp< eoParseTree<FType, Node> >
+00337 {
+00338 public:
+00339 
+00340   typedef eoParseTree<FType,Node> EoType;
+00345   eoHoistMutation()
+00346     : eoMonOp<EoType>()
+00347   {};
+00348   
+00350   virtual std::string className() const { return "eoHoistMutation"; };
+00351 
+00353   virtual ~eoHoistMutation() {};
+00358   bool operator()(EoType& _eo1 )
+00359   {
+00360         
+00361           
+00362           // select a hoist point
+00363           int i = rng.random(_eo1.size());
+00364           // and create a new tree
+00365           EoType eo2(_eo1[i]);
+00366           
+00367           // we don't have to prune because the new tree is always smaller
+00368           //_eo1.pruneTree(max_length);
+00369           
+00370           _eo1 = eo2;
+00371 
+00372     return true;
+00373   }
+00374 
+00375 private :
+00376 
+00377 };
+00378 
+00379 
+00380 #endif
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_parser_8cpp-source.html b/trunk/paradiseo-eo/doc/html/eo_parser_8cpp-source.html new file mode 100644 index 000000000..fc9b9e447 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_parser_8cpp-source.html @@ -0,0 +1,427 @@ + + +EO: eoParser.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoParser.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoParser.cpp
+00005 // (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@inria.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifdef _MSC_VER
+00028 #pragma warning(disable:4786)
+00029 #endif
+00030 
+00031 #include <stdexcept>
+00032 #include <algorithm>
+00033 #include <fstream>
+00034 #include <iomanip>
+00035 
+00036 #include <utils/compatibility.h>
+00037 
+00038 #include <utils/eoParser.h>
+00039 
+00040 using namespace std;
+00041 
+00042 void eoWarning(std::string str)
+00043 {
+00044     cout << str << '\n';
+00045 }
+00046 
+00047 std::ostream& printSectionHeader(std::ostream& os, std::string section)
+00048 {
+00049     if (section == "")
+00050         section = "General";
+00051 
+00052     os << '\n' << setw(10) << "######    " << setw(20) << section << setw(10) << "    ######\n";
+00053     return os;
+00054 }
+00055 
+00056 eoParameterLoader::~eoParameterLoader()
+00057 {
+00058     for (unsigned i = 0; i < ownedParams.size(); ++i)
+00059     {
+00060         delete ownedParams[i];
+00061     }
+00062 }
+00063 
+00064 
+00065 eoParser::eoParser ( unsigned _argc, char **_argv , string _programDescription,
+00066                      string _lFileParamName, char _shortHand) :
+00067     programName(_argv[0]),
+00068     programDescription( _programDescription),
+00069     needHelp(false, "help", "Prints this message", 'h'),
+00070     stopOnUnknownParam(true, "stopOnUnknownParam", "Stop if unkown param entered", '\0')
+00071 {
+00072     // need to process the param file first
+00073     // if we want command-line to have highest priority
+00074     unsigned i;
+00075     for (i = 1; i < _argc; ++i)
+00076     {
+00077         if(_argv[i][0] == '@')
+00078         { // read response file
+00079             char *pts = _argv[i]+1; // yes a char*, sorry :-)
+00080             ifstream ifs (pts);
+00081             ifs.peek(); // check if it exists
+00082             if (!ifs)
+00083             {
+00084                 string msg = string("Could not open response file: ") + pts;
+00085                 throw runtime_error(msg);
+00086             }
+00087             // read  - will be overwritten by command-line
+00088             readFrom(ifs);
+00089             break; // stop reading command line args for '@'
+00090         }
+00091     }
+00092     // now read arguments on command-line
+00093     stringstream stream;
+00094     for (i = 1; i < _argc; ++i)
+00095     {
+00096         stream << _argv[i] << '\n';
+00097     }
+00098     readFrom(stream);
+00099     processParam(needHelp);
+00100     processParam(stopOnUnknownParam);
+00101 }
+00102 
+00103 
+00104 
+00105 eoParam * eoParser::getParamWithLongName(const std::string& _name) const
+00106 {
+00107     typedef std::multimap<std::string, eoParam*> MultiMapType;
+00108     typedef MultiMapType::const_iterator iter;
+00109     std::string search(prefix+_name);
+00110     for(iter p = params.begin(); p != params.end(); ++p)
+00111         if(p->second->longName() == search)
+00112             return p->second;
+00113     return 0;
+00114 }
+00115 
+00116 
+00117 
+00118 void eoParser::processParam(eoParam& param, std::string section)
+00119 {
+00120     // this param enters the parser: add the prefix to the long name
+00121     if (prefix != "")
+00122     {
+00123         param.setLongName(prefix+param.longName());
+00124         section = prefix + section;  // and to section
+00125     }
+00126     doRegisterParam(param); // plainly register it
+00127     params.insert(make_pair(section, &param));
+00128 }
+00129 
+00130 void eoParser::doRegisterParam(eoParam& param) const
+00131 {
+00132     if (param.required() && !isItThere(param))
+00133     {
+00134         string msg = "Required parameter: " + param.longName() + " missing";
+00135         messages.push_back(msg);
+00136     }
+00137     pair<bool, string> value = getValue(param);
+00138     if (value.first)
+00139     {
+00140         param.setValue(value.second);
+00141     }
+00142 }
+00143 
+00144 pair<bool, string> eoParser::getValue(eoParam& _param) const
+00145 {
+00146     pair<bool, string> result(false, "");
+00147 
+00148     if (_param.shortName() != 0)
+00149     {
+00150         map<char, string>::const_iterator it = shortNameMap.find(_param.shortName());
+00151         if (it != shortNameMap.end())
+00152         {
+00153             result.second = it->second;
+00154             result.first = true;
+00155             return result;
+00156         }
+00157     }
+00158     map<string, string>::const_iterator it = longNameMap.find(_param.longName());
+00159     if (it != longNameMap.end())
+00160     {
+00161         result.second = it->second;
+00162         result.first = true;
+00163         return result;
+00164     }
+00165     // else (TODO: check environment, just long names)
+00166     return result;
+00167 }
+00168 
+00169 void eoParser::updateParameters() const
+00170 {
+00171  typedef MultiMapType::const_iterator It;
+00172 
+00173   for (It p = params.begin(); p != params.end(); ++p)
+00174   {
+00175         doRegisterParam(*p->second);
+00176   }
+00177 }
+00178 
+00179 void eoParser::readFrom(istream& is)
+00180 {
+00181     string str;
+00182     // we must avoid processing \section{xxx} if xxx is NOT "Parser"
+00183     bool processing = true;
+00184     while (is >> str)
+00185     {
+00186         if (str.find(string("\\section{"))==0) // found section begin
+00187             processing = (str.find(string("Parser"))<str.size());
+00188 
+00189         if (processing)         // right \section (or no \section at all)
+00190         {
+00191             if (str[0] == '#')
+00192             { // skip the rest of the line
+00193                 string tempStr;
+00194                 getline(is, tempStr);
+00195             }
+00196             if (str[0] == '-')
+00197             {
+00198                 if (str.size() < 2)
+00199                 {
+00200                     eoWarning("Missing parameter");
+00201                     needHelp.value() = true;
+00202                     return;
+00203                 }
+00204 
+00205                 if (str[1] == '-') // two consecutive dashes
+00206                 {
+00207                     string::iterator equalLocation = find(str.begin() + 2, str.end(), '=');
+00208                     string value;
+00209 
+00210                     if (equalLocation == str.end())
+00211                     { // TODO: it should be the next string
+00212                         value = "";
+00213                     }
+00214                     else
+00215                     {
+00216                         value = string(equalLocation + 1, str.end());
+00217                     }
+00218 
+00219                     string name(str.begin() + 2, equalLocation);
+00220                     longNameMap[name] = value;
+00221 
+00222                 }
+00223                 else // it should be a char
+00224                 {
+00225                     string value = "1"; // flags do not need a special
+00226 
+00227                     if (str.size() >= 2)
+00228                     {
+00229                         if (str[2] == '=')
+00230                         {
+00231                             if (str.size() >= 3)
+00232                                 value = string(str.begin() + 3, str.end());
+00233                         }
+00234                         else
+00235                         {
+00236                             value = string(str.begin() + 2, str.end());
+00237                         }
+00238                     }
+00239 
+00240                     shortNameMap[str[1]] = value;
+00241                 }
+00242             }
+00243         }
+00244     }
+00245 
+00246     updateParameters();
+00247 }
+00248 
+00249 void eoParser::printOn(ostream& os) const
+00250 {
+00251     typedef MultiMapType::const_iterator It;
+00252 
+00253     It p = params.begin();
+00254 
+00255     std::string section = p->first;
+00256 
+00257     printSectionHeader(os, section);
+00258     //print every param with its value
+00259     for (; p != params.end(); ++p)
+00260       {
+00261         std::string newSection = p->first;
+00262 
+00263         if (newSection != section)
+00264         {
+00265             section = newSection;
+00266             printSectionHeader(os, section);
+00267         }
+00268 
+00269         eoParam* param = p->second;
+00270 
+00271         if (!isItThere(*param))  // comment out the ones not set by the user
+00272           os << "# ";
+00273 
+00274         string str = "--" + param->longName() + "=" + param->getValue();
+00275 
+00276         os.setf(ios_base::left, ios_base::adjustfield);
+00277         os << setw(40) << str;
+00278 
+00279         os << setw(0) << " # ";
+00280         if (param->shortName())
+00281             os << '-' << param->shortName() << " : ";
+00282         os << param->description();
+00283 
+00284         if (param->required())
+00285         {
+00286             os << " REQUIRED ";
+00287         }
+00288 
+00289         os  << '\n';
+00290     }
+00291 }
+00292 
+00293 void eoParser::printHelp(ostream& os)
+00294 {
+00295     if (needHelp.value() == false && !messages.empty())
+00296     {
+00297         std::copy(messages.begin(), messages.end(), ostream_iterator<string>(os, "\n"));
+00298         messages.clear();
+00299         return;
+00300     }
+00301 
+00302     // print program name and description
+00303     os << this->programName <<": "<< programDescription << "\n\n";
+00304 
+00305     // print the usage when calling the program from the command line
+00306     os << "Usage: "<< programName<<" [Options]\n";
+00307     // only short usage!
+00308     os << "Options of the form \"-f[=Value]\" or \"--Name[=value]\"" << endl;
+00309 
+00310     os << "Where:"<<endl;
+00311 
+00312     typedef MultiMapType::const_iterator It;
+00313 
+00314     It p = params.begin();
+00315 
+00316     std::string section = p->first;
+00317 
+00318     printSectionHeader(os, section);
+00319 
+00320     //print every param with its value
+00321     for (; p != params.end(); ++p)
+00322     {
+00323         std::string newSection = p->first;
+00324 
+00325         if (newSection != section)
+00326         {
+00327             section = newSection;
+00328             printSectionHeader(os, section);
+00329         }
+00330 
+00331         if (p->second->shortName())
+00332                 os << "-" << p->second->shortName() << ", ";
+00333 
+00334         os << "--" <<p->second->longName() <<":\t"
+00335              << p->second->description() ;
+00336 
+00337           os << "\n" << setw(20) << ( (p->second->required())?"Required":"Optional" );
+00338       os <<". By default: "<<p->second->defValue() << '\n';
+00339     } // for p
+00340 
+00341     os << "\n@param_file \t defines a file where the parameters are stored\n";
+00342     os << '\n';
+00343 
+00344 }
+00345 
+00346 bool eoParser::userNeedsHelp(void)
+00347 {
+00348   /*
+00349      check whether there are long or short names entered
+00350      without a corresponding parameter
+00351   */
+00352   // first, check if we want to check that !
+00353   if (stopOnUnknownParam.value())
+00354     {
+00355       for (LongNameMapType::const_iterator lIt = longNameMap.begin(); lIt != longNameMap.end(); ++lIt)
+00356         {
+00357           string entry = lIt->first;
+00358 
+00359           MultiMapType::const_iterator it;
+00360 
+00361           for (it = params.begin(); it != params.end(); ++it)
+00362             {
+00363               if (entry == it->second->longName())
+00364                 {
+00365                   break;
+00366                 }
+00367             }
+00368 
+00369           if (it == params.end())
+00370             {
+00371               string msg = "Unknown parameter: --" + entry + " entered, type -h or --help to see available parameters";
+00372               messages.push_back(msg);
+00373             }
+00374         }
+00375 
+00376       for (ShortNameMapType::const_iterator sIt = shortNameMap.begin(); sIt != shortNameMap.end(); ++sIt)
+00377         {
+00378           char entry = sIt->first;
+00379 
+00380           MultiMapType::const_iterator it;
+00381 
+00382           for (it = params.begin(); it != params.end(); ++it)
+00383             {
+00384               if (entry == it->second->shortName())
+00385                 {
+00386                   break;
+00387                 }
+00388             }
+00389 
+00390           if (it == params.end())
+00391             {
+00392               string entryString(1, entry);
+00393               string msg = "Unknown parameter: -" + entryString + " entered, type -h or --help to see available parameters";
+00394               messages.push_back(msg);
+00395             }
+00396         }
+00397     }
+00398   return needHelp.value() || !messages.empty();
+00399 }
+00400 
+00402 ostream & operator<<(ostream & _os, const eoParamParamType & _rate)
+00403 {
+00404   _rate.printOn(_os);
+00405   return _os;
+00406 }
+00407 
+00408 istream & operator>>(istream & _is,  eoParamParamType & _rate)
+00409 {
+00410   _rate.readFrom(_is);
+00411   return _is;
+00412 }
+00413 
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_parser_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_parser_8h-source.html new file mode 100644 index 000000000..0bcebd120 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_parser_8h-source.html @@ -0,0 +1,210 @@ + + +EO: eoParser.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoParser.h

00001 /* (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000
+00002 
+00003 This library is free software; you can redistribute it and/or modify it under
+00004 the terms of the GNU Lesser General Public License as published by the Free
+00005 Software Foundation; either version 2 of the License, or (at your option) any
+00006 later version.
+00007 
+00008 This library is distributed in the hope that it will be useful, but WITHOUT ANY
+00009 WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+00010 PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
+00011 
+00012 You should have received a copy of the GNU Lesser General Public License along
+00013 with this library; if not, write to the Free Software Foundation, Inc., 59
+00014 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+00015 
+00016 Contact: http://eodev.sourceforge.net
+00017          todos@geneura.ugr.es, http://geneura.ugr.es
+00018          Marc.Schoenauer@polytechnique.fr
+00019          mkeijzer@dhi.dk
+00020 */
+00021 
+00022 
+00023 #ifndef EO_PARSER_H
+00024 #define EO_PARSER_H
+00025 
+00026 #include <map>
+00027 #include <sstream>
+00028 #include <string>
+00029 
+00030 #include "eoParam.h"
+00031 #include "eoObject.h"
+00032 #include "eoPersistent.h"
+00033 
+00040 class eoParameterLoader
+00041 {
+00042 public :
+00043 
+00045     virtual ~eoParameterLoader();
+00046 
+00052     virtual void processParam(eoParam& param, std::string section = "") = 0;
+00053 
+00057     virtual bool isItThere(eoParam& _param) const = 0;
+00058 
+00069     template <class ValueType>
+00070     eoValueParam<ValueType>& createParam(ValueType _defaultValue,
+00071                                          std::string _longName,
+00072                                          std::string _description,
+00073                                          char _shortHand = 0,
+00074                                          std::string _section = "",
+00075                                          bool _required = false)
+00076         {
+00077             eoValueParam<ValueType>* p = new eoValueParam<ValueType>(_defaultValue,
+00078                                                                      _longName,
+00079                                                                      _description,
+00080                                                                      _shortHand,
+00081                                                                      _required);
+00082             ownedParams.push_back(p);
+00083             processParam(*p, _section);
+00084             return *p;
+00085         }
+00086 
+00087 
+00088 private :
+00089 
+00090     std::vector<eoParam*> ownedParams;
+00091 };
+00092 
+00093 
+00094 
+00100 class eoParser : public eoParameterLoader, public eoObject, public eoPersistent
+00101 {
+00102 
+00103 public:
+00104 
+00119   eoParser ( unsigned _argc, char **_argv , std::string _programDescription = "",
+00120            std::string _lFileParamName = "param-file", char _shortHand = 'p');
+00121 
+00125   void processParam(eoParam& param, std::string section = "");
+00126 
+00127   void readFrom(std::istream& is);
+00128 
+00129   void printOn(std::ostream& os) const;
+00130 
+00132   std::string className(void) const { return "Parser"; }
+00133 
+00135   bool userNeedsHelp(void);
+00140   void printHelp(std::ostream& os);
+00141 
+00142   std::string ProgramName() { return programName; }
+00143 
+00148     virtual bool isItThere(eoParam& _param) const
+00149         { return getValue(_param).first; }
+00150 
+00159     eoParam * getParamWithLongName(const std::string& _name) const;
+00160 
+00161 
+00162 
+00172     template <class ValueType>
+00173     eoValueParam<ValueType>& getORcreateParam(ValueType _defaultValue,
+00174                                               std::string _longName,
+00175                                               std::string _description,
+00176                                               char _shortHand = 0,
+00177                                               std::string _section = "",
+00178                                               bool _required = false)
+00179         {
+00180             eoParam* ptParam = getParamWithLongName(_longName);
+00181             if (ptParam) {
+00182                 // found
+00183                 eoValueParam<ValueType>* ptTypedParam =
+00184                     dynamic_cast<eoValueParam<ValueType>*>(ptParam);
+00185                 return *ptTypedParam;
+00186             }
+00187             // not found -> create it
+00188             return createParam (_defaultValue, _longName, _description,
+00189                                 _shortHand, _section, _required);
+00190         }
+00191 
+00192 
+00193 
+00210     template <class ValueType>
+00211     eoValueParam<ValueType>& setORcreateParam(ValueType _defaultValue,
+00212                                               std::string _longName,
+00213                                               std::string _description,
+00214                                               char _shortHand = 0,
+00215                                               std::string _section = "",
+00216                                               bool _required = false)
+00217         {
+00218             eoValueParam<ValueType>& param = createParam(_defaultValue, _longName, _description,
+00219                                                          _shortHand, _section, _required);
+00220             std::ostringstream os;
+00221             os << _defaultValue;
+00222             if(isItThere(param)) {
+00223                 param.setValue(os.str());
+00224             } else {
+00225                 longNameMap[_longName] = os.str();
+00226                 shortNameMap[_shortHand] = os.str();
+00227             }
+00228             return param;
+00229         }
+00230 
+00231 
+00232 
+00234     void setStopOnUnknownParam(bool _b) {stopOnUnknownParam.value()=_b;}
+00235     bool getStopOnUnknownParam() {return stopOnUnknownParam.value();}
+00236 
+00238     void setPrefix(const std:: string & _prefix) {prefix = _prefix;}
+00239 
+00240   void resetPrefix() {prefix = "";}
+00241 
+00242   std::string getPrefix() {return prefix;}
+00243 
+00244 private:
+00245 
+00246   void doRegisterParam(eoParam& param) const;
+00247 
+00248   std::pair<bool, std::string> getValue(eoParam& _param) const;
+00249 
+00250   void updateParameters() const;
+00251 
+00252   typedef std::multimap<std::string, eoParam*> MultiMapType;
+00253 
+00254   // used to store all parameters that are processed
+00255   MultiMapType params;
+00256 
+00257   std::string programName;
+00258   std::string programDescription;
+00259 
+00260   typedef std::map<char, std::string> ShortNameMapType;
+00261   ShortNameMapType shortNameMap;
+00262 
+00263   typedef std::map<std::string, std::string> LongNameMapType;
+00264   LongNameMapType longNameMap;
+00265 
+00266   eoValueParam<bool>   needHelp;
+00267   eoValueParam<bool>   stopOnUnknownParam;
+00268 
+00269   mutable std::vector<std::string> messages;
+00270 
+00271   std::string prefix;   // used for all created params - in processParam
+00272 
+00273 };
+00274 
+00275 
+00276 
+00277 #endif //  EO_PARSER_H
+00278 
+00279 
+00280 
+00281 // Local Variables:
+00282 // coding: iso-8859-1
+00283 // mode:C++
+00284 // c-file-style: "Stroustrup"
+00285 // comment-column: 35
+00286 // fill-column: 80
+00287 // End:
+
Generated on Thu Oct 19 05:06:36 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_perf2_worth_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_perf2_worth_8h-source.html new file mode 100644 index 000000000..918551f2d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_perf2_worth_8h-source.html @@ -0,0 +1,216 @@ + + +EO: eoPerf2Worth.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoPerf2Worth.h

00001 
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef eoPerf2Worth_h
+00028 #define eoPerf2Worth_h
+00029 
+00030 #include <utils/eoParam.h>
+00031 #include <eoPop.h>
+00032 #include <eoFunctor.h>
+00033 
+00034 #include <algorithm>
+00035 #include <vector>
+00036 #include <string>
+00037 
+00042 template <class EOT, class WorthT = double>
+00043 class eoPerf2Worth : public eoUF<const eoPop<EOT>&, void>, public eoValueParam<std::vector<WorthT> >
+00044 {
+00045 public:
+00046 
+00047     using eoValueParam<std::vector<WorthT> >::value;
+00048 
+00050     eoPerf2Worth(std::string _description = "Worths")
+00051         : eoValueParam<std::vector<WorthT> >(std::vector<WorthT>(0), _description)
+00052         {}
+00053 
+00056   virtual void sort_pop(eoPop<EOT>& _pop)
+00057   { // start with a std::vector of indices
+00058       std::vector<unsigned> indices(_pop.size());
+00059 
+00060     unsigned i;
+00061     for (i = 0; i < _pop.size();++i)
+00062     { // could use generate, but who cares
+00063       indices[i] = i;
+00064     }
+00065 
+00066     std::sort(indices.begin(), indices.end(), compare_worth(value()));
+00067 
+00068     eoPop<EOT>      tmp_pop;
+00069     tmp_pop.resize(_pop.size());
+00070     std::vector<WorthT>  tmp_worths(value().size());
+00071 
+00072     for (i = 0; i < _pop.size(); ++i)
+00073     {
+00074       tmp_pop[i] = _pop[indices[i]];
+00075       tmp_worths[i] = value()[indices[i]];
+00076     }
+00077 
+00078     std::swap(_pop, tmp_pop);
+00079     std::swap(value(), tmp_worths);
+00080   }
+00081 
+00083     class compare_worth
+00084     {
+00085     public:
+00086 
+00087         compare_worth(const std::vector<WorthT>& _worths) : worths(_worths) {}
+00088 
+00089         bool operator()(unsigned a, unsigned b) const {
+00090             return worths[b] < worths[a]; // sort in descending (!) order
+00091         }
+00092 
+00093     private:
+00094 
+00095         const std::vector<WorthT>& worths;
+00096     };
+00097 
+00098 
+00099 
+00100     virtual void resize(eoPop<EOT>& _pop, unsigned sz) {
+00101         _pop.resize(sz);
+00102         value().resize(sz);
+00103     };
+00104 
+00105 };
+00106 
+00110 template <class EOT, class WorthT = typename EOT::Fitness>
+00111 class eoPerf2WorthCached : public eoPerf2Worth<EOT, WorthT>
+00112 {
+00113 public:
+00114 
+00115     using eoPerf2Worth<EOT, WorthT>::value;
+00116 
+00117     eoPerf2WorthCached(std::string _description = "Worths") : eoPerf2Worth<EOT, WorthT>(_description) {}
+00118 
+00119 
+00125   void operator()(const eoPop<EOT>& _pop)
+00126   {
+00127     unsigned i;
+00128       if (fitness_cache.size() == _pop.size())
+00129       {
+00130         bool in_sync = true;
+00131         for (i = 0; i < _pop.size(); ++i)
+00132         {
+00133           if (fitness_cache[i] != _pop[i].fitness())
+00134           {
+00135             in_sync = false;
+00136             fitness_cache[i] = _pop[i].fitness();
+00137           }
+00138         }
+00139 
+00140         if (in_sync)
+00141         { // worths are up to date
+00142           return;
+00143         }
+00144       }
+00145       else // just cache the fitness
+00146       {
+00147         fitness_cache.resize(_pop.size());
+00148         for (i = 0; i < _pop.size(); ++i)
+00149         {
+00150           fitness_cache[i] = _pop[i].fitness();
+00151         }
+00152       }
+00153 
+00154     // call derived implementation of perf2worth mapping
+00155     calculate_worths(_pop);
+00156   }
+00157 
+00159   virtual void calculate_worths(const eoPop<EOT>& _pop) = 0;
+00160 
+00164   virtual void sort_pop(eoPop<EOT>& _pop)
+00165   { // start with a std::vector of indices
+00166       std::vector<unsigned> indices(_pop.size());
+00167 
+00168     unsigned i;
+00169     for (i = 0; i < _pop.size();++i)
+00170     { // could use generate, but who cares
+00171       indices[i] = i;
+00172     }
+00173 
+00174     std::sort(indices.begin(), indices.end(), compare_worth(value()));
+00175 
+00176     eoPop<EOT>      tmp_pop;
+00177     tmp_pop.resize(_pop.size());
+00178     std::vector<WorthT>  tmp_worths(value().size());
+00179 
+00180 #ifdef _MSC_VER
+00181     std::vector<EOT::Fitness> tmp_cache(_pop.size());
+00182 #else
+00183     std::vector<typename EOT::Fitness> tmp_cache(_pop.size());
+00184 #endif
+00185     for (i = 0; i < _pop.size(); ++i)
+00186     {
+00187       tmp_pop[i] = _pop[indices[i]];
+00188       tmp_worths[i] = value()[indices[i]];
+00189 
+00190       tmp_cache[i] = fitness_cache[indices[i]];
+00191     }
+00192 
+00193     std::swap(_pop, tmp_pop);
+00194     std::swap(value(), tmp_worths);
+00195     std::swap(fitness_cache, tmp_cache);
+00196   }
+00197 
+00200   class compare_worth
+00201   {
+00202   public :
+00203     compare_worth(const std::vector<WorthT>& _worths) : worths(_worths) {}
+00204 
+00205     bool operator()(unsigned a, unsigned b) const
+00206     {
+00207       return worths[b] < worths[a]; // sort in descending (!) order
+00208     }
+00209 
+00210   private :
+00211 
+00212     const std::vector<WorthT>& worths;
+00213   };
+00214 
+00215   virtual void resize(eoPop<EOT>& _pop, unsigned sz)
+00216   {
+00217     _pop.resize(sz);
+00218     value().resize(sz);
+00219     fitness_cache.resize(sz);
+00220   }
+00221 
+00222   private :
+00223   std::vector <typename EOT::Fitness> fitness_cache;
+00224 };
+00225 
+00226 
+00227 
+00229 template <class EOT>
+00230 class eoNoPerf2Worth : public eoPerf2Worth<EOT, typename EOT::Fitness>
+00231 {
+00232 public:
+00233 
+00234     using eoValueParam< EOT >::value;
+00235 
+00236     // default behaviour, just copy fitnesses
+00237     void operator()(const eoPop<EOT>& _pop) {
+00238         unsigned i;
+00239         value().resize(_pop.size());
+00240         for (i = 0; i < _pop.size(); ++i)
+00241             value()[i]=_pop[i];
+00242     }
+00243 };
+00244 
+00245 
+00246 
+00247 #endif
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_periodic_continue_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_periodic_continue_8h-source.html new file mode 100644 index 000000000..dd382ea17 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_periodic_continue_8h-source.html @@ -0,0 +1,75 @@ + + +EO: eoPeriodicContinue.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoPeriodicContinue.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 // "eoFreqContinue.h"
+00004 
+00005 // (c) OPAC Team, LIFL, Feb. 2006
+00006 
+00007 /* This library is free software; you can redistribute it and/or
+00008    modify it under the terms of the GNU Lesser General Public
+00009    License as published by the Free Software Foundation; either
+00010    version 2 of the License, or (at your option) any later version.
+00011    
+00012    This library is distributed in the hope that it will be useful,
+00013    but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015    Lesser General Public License for more details.
+00016    
+00017    You should have received a copy of the GNU Lesser General Public
+00018    License along with this library; if not, write to the Free Software
+00019    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA
+00020    
+00021    Contact: cahon@lifl.fr  
+00022 */
+00023 
+00024 #ifndef __eoPeriodicContinue_h
+00025 #define __eoPeriodicContinue_h
+00026 
+00027 #include <eoContinue.h>
+00028 #include <eoPop.h>
+00029 
+00030 template <class EOT> class eoPeriodicContinue: public eoContinue <EOT> {
+00031 
+00032 public:
+00033   
+00035   eoPeriodicContinue (unsigned __period, unsigned __init_counter = 0);
+00036 
+00039   bool operator () (const eoPop <EOT> & pop);
+00040     
+00041 private:
+00042 
+00043   unsigned period;
+00044   
+00045   unsigned counter;
+00046 
+00047 };
+00048 
+00049 template <class EOT> 
+00050 eoPeriodicContinue <EOT> :: eoPeriodicContinue (unsigned __period, unsigned __init_counter
+00051                                                 ) : period (__period),
+00052                                                     counter (__init_counter) {
+00053 
+00054 }
+00055 
+00056 template <class EOT> 
+00057 bool eoPeriodicContinue <EOT> :: operator () (const eoPop <EOT> & __pop) {
+00058     
+00059   return ((++ counter) % period) != 0 ;
+00060 }
+00061 
+00062 #endif
+00063 
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_persistent_8cpp-source.html b/trunk/paradiseo-eo/doc/html/eo_persistent_8cpp-source.html new file mode 100644 index 000000000..1711659f8 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_persistent_8cpp-source.html @@ -0,0 +1,30 @@ + + +EO: eoPersistent.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoPersistent.cpp

00001 #ifdef _MSC_VER
+00002 // to avoid long name warnings
+00003 #pragma warning(disable:4786)
+00004 #endif 
+00005 
+00006 #include <eoPersistent.h>
+00007 
+00008 //Implementation of these objects
+00009 
+00010 //-----------------------------------------------------------------------------
+00011 
+00012 std::istream & operator >> ( std::istream& _is, eoPersistent& _o ) {
+00013   _o.readFrom(_is);
+00014   return _is;
+00015 };
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_persistent_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_persistent_8h-source.html new file mode 100644 index 000000000..c3c5a3583 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_persistent_8h-source.html @@ -0,0 +1,74 @@ + + +EO: eoPersistent.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoPersistent.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 
+00004 
+00005 //-----------------------------------------------------------------------------
+00006 
+00007 // eoPersistent.h
+00008 // (c) GeNeura Team, 1999
+00009 /* 
+00010     This library is free software; you can redistribute it and/or
+00011     modify it under the terms of the GNU Lesser General Public
+00012     License as published by the Free Software Foundation; either
+00013     version 2 of the License, or (at your option) any later version.
+00014 
+00015     This library is distributed in the hope that it will be useful,
+00016     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00017     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00018     Lesser General Public License for more details.
+00019 
+00020     You should have received a copy of the GNU Lesser General Public
+00021     License along with this library; if not, write to the Free Software
+00022     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00023 
+00024     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00025  */
+00026 //-----------------------------------------------------------------------------
+00027 
+00028 #ifndef EOPERSISTENT_H
+00029 #define EOPERSISTENT_H
+00030 
+00032 
+00033 
+00034 const unsigned MAXLINELENGTH=1024;
+00036 
+00037 //-----------------------------------------------------------------------------
+00038 
+00039 #include <iostream>  // std::istream, std::ostream
+00040 #include <string>    // para std::string
+00041 
+00042 //-----------------------------------------------------------------------------
+00043 #include "eoPrintable.h"
+00044 
+00045 //-----------------------------------------------------------------------------
+00046 // eoPersistent
+00047 //-----------------------------------------------------------------------------
+00052 class eoPersistent: public eoPrintable
+00053 {
+00054  public:
+00056   virtual ~eoPersistent() {}
+00057   
+00063   virtual void readFrom(std::istream& _is) = 0;
+00064   
+00065 };
+00066 
+00067 //-----------------------------------------------------------------------------
+00069 std::istream & operator >> ( std::istream& _is, eoPersistent& _o );
+00070 
+00071 #endif
+00072 
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_pop_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_pop_8h-source.html new file mode 100644 index 000000000..740bcf282 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_pop_8h-source.html @@ -0,0 +1,243 @@ + + +EO: eoPop.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoPop.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoPop.h 
+00005 // (c) GeNeura Team, 1998
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022  */
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef _EOPOP_H
+00026 #define _EOPOP_H
+00027 
+00028 #include <algorithm>
+00029 #include <iostream>
+00030 #include <iterator> // needed for GCC 3.2
+00031 #include <vector>
+00032 
+00033 // EO includes
+00034 #include <eoOp.h> // for eoInit
+00035 #include <eoPersistent.h>
+00036 #include <eoInit.h>
+00037 #include <utils/rnd_generators.h>  // for shuffle method
+00038 
+00053 template<class EOT>
+00054 class eoPop: public std::vector<EOT>, public eoObject, public eoPersistent 
+00055 {
+00056 
+00057  public:
+00058      
+00059      using std::vector<EOT>::size;
+00060      using std::vector<EOT>::resize;
+00061      using std::vector<EOT>::operator[];
+00062      using std::vector<EOT>::begin;
+00063      using std::vector<EOT>::end;
+00064      
+00065      typedef typename EOT::Fitness Fitness;
+00068         eoPop()   : std::vector<EOT>(), eoObject(), eoPersistent() {};
+00069         
+00075     eoPop( unsigned _popSize, eoInit<EOT>& _chromInit )
+00076       :std::vector<EOT>() 
+00077     {
+00078         resize(_popSize);
+00079           for ( unsigned i = 0; i < _popSize; i++ )
+00080       {
+00081                 _chromInit(operator[](i));
+00082           }
+00083         };
+00084 
+00091     void append( unsigned _newPopSize, eoInit<EOT>& _chromInit )
+00092     {
+00093       unsigned oldSize = size();
+00094       if (_newPopSize < oldSize)
+00095         {
+00096           throw std::runtime_error("New size smaller than old size in pop.append");
+00097           return;
+00098         }
+00099       if (_newPopSize == oldSize)
+00100         return;
+00101       resize(_newPopSize);         // adjust the size
+00102       for ( unsigned i = oldSize; i < _newPopSize; i++ )
+00103         {
+00104           _chromInit(operator[](i));
+00105         }
+00106     };
+00107   
+00108   
+00113   eoPop( std::istream& _is ) :std::vector<EOT>() {
+00114     readFrom( _is );
+00115   }
+00116   
+00118         virtual ~eoPop() {};
+00119 
+00120 
+00122       struct Ref { const EOT* operator()(const EOT& eot) { return &eot;}};
+00124       struct Cmp {
+00125           bool operator()(const EOT* a, const EOT* b) const
+00126             { return b->operator<(*a); }
+00127       };
+00128 
+00133   void sort(void)
+00134   {
+00135       std::sort(begin(), end(), std::greater<EOT>());
+00136   }
+00137 
+00139   void sort(std::vector<const EOT*>& result) const
+00140   {
+00141       result.resize(size());
+00142 
+00143       std::transform(begin(), end(), result.begin(), Ref());
+00144 
+00145       std::sort(result.begin(), result.end(), Cmp());
+00146   }
+00147 
+00152   void shuffle(void)
+00153   {
+00154     UF_random_generator<unsigned int> gen;
+00155       std::random_shuffle(begin(), end(), gen);
+00156   }
+00157 
+00159   void shuffle(std::vector<const EOT*>& result) const
+00160   {
+00161       result.resize(size());
+00162 
+00163       std::transform(begin(), end(), result.begin(), Ref());
+00164 
+00165       UF_random_generator<unsigned int> gen;
+00166       std::random_shuffle(result.begin(), result.end(), gen);
+00167   }
+00168 
+00170   typename eoPop<EOT>::iterator it_best_element() 
+00171   {
+00172     typename eoPop<EOT>::iterator it = std::max_element(begin(), end());
+00173     return it;
+00174   }
+00175 
+00177   const EOT & best_element() const
+00178   {
+00179     typename eoPop<EOT>::const_iterator it = std::max_element(begin(), end());
+00180     return (*it);
+00181   }
+00182 
+00184   const EOT & worse_element() const
+00185   {
+00186     typename eoPop<EOT>::const_iterator it = std::min_element(begin(), end());
+00187     return (*it);
+00188   }
+00189 
+00191   typename eoPop<EOT>::iterator it_worse_element()
+00192   {
+00193     typename eoPop<EOT>::iterator it = std::min_element(begin(), end());
+00194     return it;
+00195   }
+00196 
+00201   typename eoPop<EOT>::iterator nth_element(int nth)
+00202   {
+00203       typename eoPop<EOT>::iterator it = begin() + nth;
+00204       std::nth_element(begin(), it, end(), std::greater<EOT>());
+00205       return it;
+00206   }
+00207 
+00208   struct GetFitness { Fitness operator()(const EOT& _eo) const { return _eo.fitness(); } };
+00209   
+00211   Fitness nth_element_fitness(int which) const
+00212   { // probably not the fastest way to do this, but what the heck
+00213       
+00214       std::vector<Fitness> fitness(size());
+00215       std::transform(begin(), end(), fitness.begin(), GetFitness());
+00216 
+00217       typename std::vector<Fitness>::iterator it = fitness.begin() + which;
+00218       std::nth_element(fitness.begin(), it, fitness.end(), std::greater<Fitness>());
+00219       return *it;
+00220   }
+00221 
+00225   void nth_element(int which, std::vector<const EOT*>& result) const
+00226   {
+00227 
+00228       result.resize(size());
+00229       std::transform(begin(), end(), result.begin(), Ref());
+00230   
+00231       typename std::vector<const EOT*>::iterator it  = result.begin() + which;
+00232 
+00233       std::nth_element(result.begin(), it, result.end(), Cmp());
+00234   }
+00235 
+00237   void swap(eoPop<EOT>& other)
+00238   {
+00239       std::swap(static_cast<std::vector<EOT>& >(*this), static_cast<std::vector<EOT>& >(other));
+00240   }
+00241   
+00247   virtual void sortedPrintOn(std::ostream& _os) const 
+00248   {
+00249     std::vector<const EOT*> result;
+00250     sort(result);
+00251     _os << size() << '\n';
+00252     for (unsigned i = 0; i < size(); ++i)
+00253       {
+00254         _os << *result[i] << std::endl;
+00255       }
+00256   }
+00257 
+00262   virtual void printOn(std::ostream& _os) const 
+00263   {
+00264         _os << size() << '\n';
+00265         std::copy( begin(), end(), std::ostream_iterator<EOT>( _os, "\n") );
+00266   }
+00267 
+00274   virtual void readFrom(std::istream& _is) 
+00275   {
+00276     size_t sz;
+00277     _is >> sz;
+00278 
+00279     resize(sz);
+00280 
+00281     for (size_t i = 0; i < sz; ++i) {  
+00282         operator[](i).readFrom( _is );
+00283     }
+00284   }
+00285 
+00289   virtual std::string className() const {return "eoPop";};
+00291 
+00292   virtual void invalidate()
+00293   {
+00294     for (unsigned i=0; i<size(); i++)
+00295       this->operator[](i).invalidate();
+00296   }
+00297 
+00298 
+00299  protected:
+00300 
+00301 };
+00302 
+00303 #endif
+00304 
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_pop_algo_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_pop_algo_8h-source.html new file mode 100644 index 000000000..60f27631c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_pop_algo_8h-source.html @@ -0,0 +1,28 @@ + + +EO: eoPopAlgo.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoPopAlgo.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 #ifndef eoPopAlgo_h
+00004 #define eoPopAlgo_h
+00005 
+00006 #include <eoPop.h>
+00007 #include <eoFunctor.h>
+00008 
+00013 template <class EOT> class eoPopAlgo : public eoUF <eoPop <EOT> &, void> {
+00014     
+00015 } ;
+00016         
+00017 #endif
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_pop_eval_func_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_pop_eval_func_8h-source.html new file mode 100644 index 000000000..8d7b61e30 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_pop_eval_func_8h-source.html @@ -0,0 +1,63 @@ + + +EO: eoPopEvalFunc.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoPopEvalFunc.h

00001 
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef eoPopEvalFunc_H
+00028 #define eoPopEvalFunc_H
+00029 
+00030 #include <eoEvalFunc.h>
+00031 #include <apply.h>
+00032 
+00048 template<class EOT>
+00049 class eoPopEvalFunc : public eoBF<eoPop<EOT> & , eoPop<EOT> &, void> 
+00050 {};
+00051 
+00053 //           eoPopLoopEval
+00055 
+00059 template<class EOT>
+00060 class eoPopLoopEval : public eoPopEvalFunc<EOT> {
+00061 public:
+00063   eoPopLoopEval(eoEvalFunc<EOT> & _eval) : eval(_eval) {}
+00064 
+00066   void operator()(eoPop<EOT> & _parents, eoPop<EOT> & _offspring)
+00067   {
+00068     apply<EOT>(eval, _offspring);
+00069   }
+00070 
+00071 private:
+00072   eoEvalFunc<EOT> & eval;
+00073 };
+00074 
+00076 //           eoTimeVaryingLoopEval
+00078 
+00083 template<class EOT>
+00084 class eoTimeVaryingLoopEval : public eoPopEvalFunc<EOT> {
+00085 public:
+00087   eoTimeVaryingLoopEval(eoEvalFunc<EOT> & _eval) : eval(_eval) {}
+00088 
+00090   void operator()(eoPop<EOT> & _parents, eoPop<EOT> & _offspring)
+00091   {
+00092     apply<EOT>(eval, _parents);
+00093     apply<EOT>(eval, _offspring);
+00094   }
+00095 
+00096 private:
+00097   eoEvalFunc<EOT> & eval;
+00098 };
+00099 
+00100 #endif
+00101 
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_pop_stat_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_pop_stat_8h-source.html new file mode 100644 index 000000000..c18e2e720 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_pop_stat_8h-source.html @@ -0,0 +1,104 @@ + + +EO: eoPopStat.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoPopStat.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoPopStat.h
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00035 #ifndef _eoPopStat_h
+00036 #define _eoPopStat_h
+00037 
+00038 #include <utils/eoStat.h>
+00039 
+00040 
+00050 template <class EOT>
+00051 class eoPopStat : public eoStat<EOT, std::string>
+00052 {
+00053 public:
+00054 
+00055     using eoStat<EOT, std::string>::value;
+00056 
+00061    eoPopStat(unsigned _howMany = 0, std::string _desc ="")
+00062          : eoStat<EOT, std::string>("", _desc), combien( _howMany) {}
+00063 
+00068 void operator()(const eoPop<EOT>& _pop)
+00069 {
+00070   value() = "\n# ====== pop dump =====\n";
+00071   unsigned howmany=combien?combien:_pop.size();
+00072   for (unsigned i = 0; i < howmany; ++i)
+00073   {
+00074       std::ostringstream os;
+00075       os << _pop[i] << std::endl;
+00076 
+00077       // paranoid:
+00078       value() += os.str();
+00079   }
+00080 }
+00081 
+00082 private:
+00083   unsigned combien;
+00084 };
+00085 
+00095 template <class EOT>
+00096 class eoSortedPopStat : public eoSortedStat<EOT, std::string>
+00097 {
+00098 public:
+00099 
+00100     using eoSortedStat<EOT, std::string>::value;
+00101 
+00107     eoSortedPopStat(unsigned _howMany = 0, std::string _desc ="")
+00108         : eoSortedStat<EOT, std::string>("", _desc) , combien( _howMany)
+00109         {}
+00110 
+00116     void operator()(const std::vector<const EOT*>& _pop)
+00117         {
+00118     value() = "";                  // empty
+00119     unsigned howMany=combien?combien:_pop.size();
+00120     for (unsigned i = 0; i < howMany; ++i)
+00121       {
+00122         std::ostringstream os;
+00123         os << *_pop[i] << std::endl;
+00124 
+00125         // paranoid:
+00126         value() += os.str();
+00127       }
+00128   }
+00129 private:
+00130   unsigned combien;
+00131 };
+00132 
+00133 #endif
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_populator_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_populator_8h-source.html new file mode 100644 index 000000000..25211c481 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_populator_8h-source.html @@ -0,0 +1,182 @@ + + +EO: eoPopulator.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoPopulator.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoPopulator.h
+00005 // (c) Maarten Keijzer and Marc Schoenauer, 2001
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: mkeijzer@dhi.dk
+00022              Marc.Schoenauer@polytechnique.fr
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _eoPopulator_H
+00027 #define _eoPopulator_H
+00028 
+00029 #include <eoPop.h>
+00030 #include <eoSelectOne.h>
+00031 
+00038 template <class EOT>
+00039 class eoPopulator
+00040 {
+00041 public :
+00042 
+00043   eoPopulator(const eoPop<EOT>& _src, eoPop<EOT>& _dest) : dest(_dest), current(dest.end()), src(_src)
+00044   {
+00045     dest.reserve(src.size()); // we don't know this, but wth.
+00046     current = dest.end();
+00047   }
+00048 
+00050     virtual ~eoPopulator() {};
+00051 
+00052   struct OutOfIndividuals {};
+00053 
+00058   EOT& operator*(void)
+00059   {
+00060     if (current == dest.end())
+00061       get_next(); // get a new individual
+00062 
+00063     return *current;
+00064   }
+00065 
+00070   eoPopulator& operator++()
+00071   {
+00072     if (current == dest.end())
+00073       { // keep the pointer there
+00074         return *this;
+00075       }
+00076     // else
+00077     ++current;
+00078     return *this;
+00079   }
+00080 
+00084   void insert(const EOT& _eo)
+00085   { /* not really efficient, but its nice to have */
+00086     current = dest.insert(current, _eo);
+00087   }
+00088 
+00091   void reserve(int how_many)
+00092   {
+00093     size_t sz = current - dest.begin();
+00094     if (dest.capacity() < dest.size() + how_many)
+00095     {
+00096       dest.reserve(dest.size() + how_many);
+00097     }
+00098 
+00099     current = dest.begin() + sz;
+00100   }
+00101 
+00105   const eoPop<EOT>& source(void) { return src; }
+00106 
+00110   eoPop<EOT>& offspring(void)    { return dest; }
+00111 
+00112   typedef unsigned position_type;
+00113 
+00115   position_type tellp()         { return current - dest.begin(); }
+00117   void seekp(position_type pos) { current = dest.begin() + pos; }
+00119   bool exhausted(void)          { return current == dest.end(); }
+00120 
+00124   virtual const EOT& select() = 0;
+00125 
+00126 protected:
+00127     eoPop<EOT>& dest;
+00128     typename eoPop<EOT>::iterator current;
+00129     const eoPop<EOT>& src;
+00130 
+00131 private:
+00132 
+00133   void get_next() {
+00134     if(current == dest.end())
+00135       { // get new individual from derived class select()
+00136         dest.push_back(select());
+00137         current = dest.end();
+00138         --current;
+00139         return;
+00140       }
+00141     // else
+00142     ++current;
+00143     return;
+00144   }
+00145 
+00146 };
+00147 
+00148 
+00153 template <class EOT>
+00154 class eoSeqPopulator : public eoPopulator<EOT>
+00155 {
+00156 public:
+00157 
+00158     using eoPopulator< EOT >::src;
+00159 
+00160     eoSeqPopulator(const eoPop<EOT>& _pop, eoPop<EOT>& _dest) :
+00161         eoPopulator<EOT>(_pop, _dest), current(0) {}
+00162 
+00164     const EOT& select(void) {
+00165         if(current >= eoPopulator< EOT >::src.size()) {
+00166             throw OutOfIndividuals();
+00167         }
+00168 
+00169         const EOT& res = src[current++];
+00170         return res;
+00171     }
+00172 
+00173 
+00174 private:
+00175 
+00176     struct OutOfIndividuals {};
+00177 
+00178     unsigned current;
+00179 };
+00180 
+00181 
+00185 template <class EOT>
+00186 class eoSelectivePopulator : public eoPopulator<EOT>
+00187 {
+00188 public :
+00189 
+00190     using eoPopulator< EOT >::src;
+00191 
+00192     eoSelectivePopulator(const eoPop<EOT>& _pop, eoPop<EOT>& _dest, eoSelectOne<EOT>& _sel)
+00193         : eoPopulator<EOT>(_pop, _dest), sel(_sel)
+00194         { sel.setup(_pop); };
+00195 
+00197     const EOT& select() {
+00198         return sel(src);
+00199     }
+00200 
+00201 
+00202 private:
+00203 
+00204     eoSelectOne<EOT>& sel;
+00205 };
+00206 
+00207 #endif
+00208 
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_printable_8cpp-source.html b/trunk/paradiseo-eo/doc/html/eo_printable_8cpp-source.html new file mode 100644 index 000000000..3e1f49511 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_printable_8cpp-source.html @@ -0,0 +1,37 @@ + + +EO: eoPrintable.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoPrintable.cpp

00001 #ifdef _MSC_VER
+00002 // to avoid long name warnings
+00003 #pragma warning(disable:4786)
+00004 #endif 
+00005 
+00006 //-----------------------------------------------------------------------------
+00007 // eoPrintable.cpp
+00008 //-----------------------------------------------------------------------------
+00009 
+00010 #include <eoPrintable.h>
+00011 
+00012 //-----------------------------------------------------------------------------
+00013 //Implementation of these objects
+00014 //-----------------------------------------------------------------------------
+00015 
+00016 std::ostream & operator << ( std::ostream& _os, const eoPrintable& _o ) {
+00017         _o.printOn(_os);
+00018         return _os;
+00019 };
+00020 
+00021 //-----------------------------------------------------------------------------
+00022 
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_printable_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_printable_8h-source.html new file mode 100644 index 000000000..21619ad5f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_printable_8h-source.html @@ -0,0 +1,63 @@ + + +EO: eoPrintable.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoPrintable.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoPrintable.h
+00005 // (c) GeNeura Team, 1998
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022  */
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef EOPRINTABLE_H
+00026 #define EOPRINTABLE_H
+00027 
+00028 //-----------------------------------------------------------------------------
+00029 
+00030 #include <iostream>  // std::istream, std::ostream
+00031 #include <string> // para std::string
+00032 
+00033 //-----------------------------------------------------------------------------
+00034 // eoPrintable
+00035 //-----------------------------------------------------------------------------
+00043 class eoPrintable
+00044 {
+00045  public:
+00047   virtual ~eoPrintable() {}
+00048   
+00053   virtual void printOn(std::ostream& _os) const = 0;
+00054 };
+00055 
+00056 //-----------------------------------------------------------------------------
+00058 std::ostream & operator << ( std::ostream& _os, const eoPrintable& _o );
+00059 
+00060 #endif
+00061 
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_prop_g_a_gen_op_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_prop_g_a_gen_op_8h-source.html new file mode 100644 index 000000000..01cbc2756 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_prop_g_a_gen_op_8h-source.html @@ -0,0 +1,88 @@ + + +EO: eoPropGAGenOp.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoPropGAGenOp.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoPropGAGenOp.h
+00005 // (c) Marc.Schoenauer 2005
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@inria.fr
+00023              mak@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoPropGAGenOp_h
+00028 #define _eoPropGAGenOp_h
+00029 
+00030 #include "eoGenOp.h"
+00031 #include "eoInvalidateOps.h"
+00033 // class eoSGAGenOp
+00035 
+00041 template<class EOT> 
+00042 class eoPropGAGenOp : public eoGenOp<EOT>
+00043 {
+00044  public:
+00045     
+00051   eoPropGAGenOp(double _wClone, eoQuadOp<EOT>& _cross, double _wCross, 
+00052                  eoMonOp<EOT>& _mut, double _wMut)
+00053     : wClone(_wClone),
+00054       cross(_cross),
+00055       wCross(_wCross),
+00056       mut(_mut), 
+00057       wMut(_wMut) 
+00058   {
+00059     propOp.add(cross, wCross); // the crossover - with weight wCross
+00060     propOp.add(mut, wMut); // mutation with weight wMut
+00061     propOp.add(monClone, wClone);
+00062   }
+00063   
+00065   virtual void apply(eoPopulator<EOT>& _pop)
+00066   {
+00067     propOp.apply(_pop);
+00068   }
+00069 
+00071   virtual unsigned max_production(void) {return 2;}
+00072 
+00073   virtual std::string className() const {return "eoPropGAGenOp";}
+00074 
+00075 
+00076  private:
+00077   double wClone;
+00078   eoQuadOp<EOT> &cross;   // eoInvalidateXXX take the boolean output
+00079   double wCross;
+00080   eoMonOp<EOT> & mut;      // of the XXX op and invalidate the EOT
+00081   double wMut;
+00082   eoProportionalOp<EOT> propOp;
+00083   eoMonCloneOp<EOT> monClone;
+00084 };
+00085 
+00086 
+00087 #endif
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_proportional_combined_op_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_proportional_combined_op_8h-source.html new file mode 100644 index 000000000..8b4e4a318 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_proportional_combined_op_8h-source.html @@ -0,0 +1,183 @@ + + +EO: eoProportionalCombinedOp.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoProportionalCombinedOp.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 //-----------------------------------------------------------------------------
+00003 // eoCombinedOp.h
+00004 // (c) GeNeura Team, 1998, Marc Schoenauer, 2000
+00005 /* 
+00006     This library is free software; you can redistribute it and/or
+00007     modify it under the terms of the GNU Lesser General Public
+00008     License as published by the Free Software Foundation; either
+00009     version 2 of the License, or (at your option) any later version.
+00010 
+00011     This library is distributed in the hope that it will be useful,
+00012     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00013     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00014     Lesser General Public License for more details.
+00015 
+00016     You should have received a copy of the GNU Lesser General Public
+00017     License along with this library; if not, write to the Free Software
+00018     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00019 
+00020     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00021  */
+00022 //-----------------------------------------------------------------------------
+00023 
+00024 #ifndef _eoCombinedOp_H
+00025 #define _eoCombinedOp_H
+00026 
+00027 #include <eoObject.h>
+00028 #include <eoPrintable.h>
+00029 #include <eoFunctor.h>
+00030 #include <eoOp.h>
+00031 #include <utils/eoRNG.h>
+00048 
+00049 
+00050 
+00051 
+00057 template <class EOT>
+00058 class eoPropCombinedMonOp: public eoMonOp<EOT>
+00059 {
+00060 public:
+00062   eoPropCombinedMonOp(eoMonOp<EOT> & _first, const double _rate)
+00063   {
+00064     ops.push_back(&_first);
+00065     rates.push_back(_rate);
+00066   }
+00067 
+00068   virtual std::string className() const { return "eoPropCombinedMonOp"; }
+00069 
+00070   virtual void add(eoMonOp<EOT> & _op, const double _rate, bool _verbose=false)
+00071   {
+00072     ops.push_back(&_op);
+00073     rates.push_back(_rate);
+00074     // compute the relative rates in percent - to warn the user!
+00075     if (_verbose)
+00076       printOn(std::cout);
+00077   }
+00078 
+00079   // outputs the operators and percentages
+00080   virtual void printOn(std::ostream & _os)
+00081   {
+00082     double total = 0;
+00083     unsigned i;
+00084     for (i=0; i<ops.size(); i++)
+00085       total += rates[i];
+00086     _os << "In " << className() << "\n" ;
+00087     for (i=0; i<ops.size(); i++)
+00088       _os << ops[i]->className() << " with rate " << 100*rates[i]/total << " %\n";
+00089   }
+00090 
+00091   virtual bool operator()(EOT & _indi)
+00092   {
+00093     unsigned what = rng.roulette_wheel(rates); // choose one op
+00094     return (*ops[what])(_indi);            // apply it
+00095   }
+00096 protected:
+00097 std::vector<eoMonOp<EOT>*> ops;
+00098 std::vector<double> rates;
+00099 };
+00100 
+00104 
+00108 template <class EOT>
+00109 class eoPropCombinedBinOp: public eoBinOp<EOT>
+00110 {
+00111 public:
+00113   eoPropCombinedBinOp(eoBinOp<EOT> & _first, const double _rate)
+00114   {
+00115     ops.push_back(&_first);
+00116     rates.push_back(_rate);
+00117   }
+00118 
+00119 virtual std::string className() const { return "eoPropCombinedBinOp"; }
+00120 
+00121 virtual void add(eoBinOp<EOT> & _op, const double _rate, bool _verbose=false)
+00122   {
+00123     ops.push_back(&_op);
+00124     rates.push_back(_rate);
+00125     // compute the relative rates in percent - to warn the user!
+00126     if (_verbose)
+00127       {
+00128         double total = 0;
+00129         unsigned i;
+00130         for (i=0; i<ops.size(); i++)
+00131           total += rates[i];
+00132         std::cout << "In " << className() << "\n" ;
+00133         for (i=0; i<ops.size(); i++)
+00134           std::cout << ops[i]->className() << " with rate " << 100*rates[i]/total << " %\n";
+00135       }
+00136   }
+00137 
+00138   virtual void operator()(EOT & _indi1, const EOT & _indi2)
+00139   {
+00140     unsigned what = rng.roulette_wheel(rates); // choose one op index
+00141     return (*ops[what])(_indi1, _indi2);                   // apply it
+00142   }
+00143 private:
+00144 std::vector<eoBinOp<EOT>*> ops;
+00145 std::vector<double> rates;
+00146 };
+00147 
+00148 
+00152 
+00162 template <class EOT>
+00163 class eoPropCombinedQuadOp: public eoQuadOp<EOT>
+00164 {
+00165 public:
+00167   eoPropCombinedQuadOp(eoQuadOp<EOT> & _first, const double _rate)
+00168   {
+00169     ops.push_back(&_first);
+00170     rates.push_back(_rate);
+00171   }
+00172 
+00173 virtual std::string className() const { return "eoPropCombinedQuadOp"; }
+00174 
+00175   // addition of a true operator
+00176 virtual void add(eoQuadOp<EOT> & _op, const double _rate, bool _verbose=false)
+00177   {
+00178     ops.push_back(&_op);
+00179     rates.push_back(_rate);
+00180     // compute the relative rates in percent - to warn the user!
+00181     if (_verbose)
+00182       printOn(std::cout);
+00183   }
+00184 
+00185   // outputs the operators and percentages
+00186   virtual void printOn(std::ostream & _os)
+00187   {
+00188     double total = 0;
+00189     unsigned i;
+00190     for (i=0; i<ops.size(); i++)
+00191       total += rates[i];
+00192     _os << "In " << className() << "\n" ;
+00193     for (i=0; i<ops.size(); i++)
+00194       _os << ops[i]->className() << " with rate " << 100*rates[i]/total << " %\n";
+00195   }
+00196 
+00197   virtual bool operator()(EOT & _indi1, EOT & _indi2)
+00198   {
+00199     unsigned what = rng.roulette_wheel(rates); // choose one op index
+00200     return (*ops[what])(_indi1, _indi2);                   // apply it
+00201   }
+00202 private:
+00203 std::vector<eoQuadOp<EOT>*> ops;
+00204 std::vector<double> rates;
+00205 };
+00206 
+00207 
+00208 // for General Ops, it's another story - see eoOpCOntainer
+00209 #endif
+00210 
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_proportional_select_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_proportional_select_8h-source.html new file mode 100644 index 000000000..bcccf867a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_proportional_select_8h-source.html @@ -0,0 +1,91 @@ + + +EO: eoProportionalSelect.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoProportionalSelect.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoProportionalSelect.h
+00005 // (c) GeNeura Team, 1998 - EEAAX 1999, Maarten Keijzer 2000
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mak@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef eoProportionalSelect_h
+00028 #define eoProportionalSelect_h
+00029 
+00030 //-----------------------------------------------------------------------------
+00031 
+00032 #include <utils/eoRNG.h>
+00033 #include <utils/selectors.h>
+00034 #include <eoSelectOne.h>
+00035 #include <eoPop.h>
+00036 //-----------------------------------------------------------------------------
+00043 //-----------------------------------------------------------------------------
+00044 
+00045 template <class EOT> class eoProportionalSelect: public eoSelectOne<EOT> 
+00046 {
+00047 public:
+00049   eoProportionalSelect(const eoPop<EOT>& pop = eoPop<EOT>()) 
+00050   {
+00051     if (minimizing_fitness<EOT>())
+00052       throw std::logic_error("eoProportionalSelect: minimizing fitness");
+00053   }
+00054 
+00055   void setup(const eoPop<EOT>& _pop)
+00056   {
+00057       if (_pop.size() == 0) return;
+00058       
+00059       cumulative.resize(_pop.size());
+00060       cumulative[0] = _pop[0].fitness();
+00061 
+00062       for (unsigned i = 1; i < _pop.size(); ++i) 
+00063       {
+00064           cumulative[i] = _pop[i].fitness() + cumulative[i-1];
+00065       }
+00066   }
+00067     
+00070   const EOT& operator()(const eoPop<EOT>& _pop) 
+00071   {
+00072       if (cumulative.size() == 0) setup(_pop);
+00073       
+00074       double fortune = rng.uniform() * cumulative.back(); 
+00075       typename FitVec::iterator result = std::upper_bound(cumulative.begin(), cumulative.end(), fortune);
+00076       return _pop[result - cumulative.begin()];
+00077   }
+00078 
+00079 private :
+00080 
+00081   typedef std::vector<typename EOT::Fitness> FitVec;
+00082   FitVec cumulative;
+00083 };
+00084 
+00085 #endif
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_r_n_g_8cpp-source.html b/trunk/paradiseo-eo/doc/html/eo_r_n_g_8cpp-source.html new file mode 100644 index 000000000..459a42767 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_r_n_g_8cpp-source.html @@ -0,0 +1,28 @@ + + +EO: eoRNG.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoRNG.cpp

00001 #ifdef _MSC_VER
+00002 // to avoid long name warnings
+00003 #pragma warning(disable:4786)
+00004 #endif
+00005 
+00006 #include <ctime>
+00007 #include "eoRNG.h"
+00008 
+00009 namespace eo
+00010 {
+00012     eoRng rng(time(0));
+00013 }
+00014 
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_r_n_g_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_r_n_g_8h-source.html new file mode 100644 index 000000000..05d75e012 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_r_n_g_8h-source.html @@ -0,0 +1,355 @@ + + +EO: eoRNG.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoRNG.h

00001 
+00024 #ifndef EO_RANDOM_NUMBER_GENERATOR
+00025 #define EO_RANDOM_NUMBER_GENERATOR
+00026 
+00027 // uint32_t is an unsigned integer type capable of holding 32 bits.
+00028 //
+00029 // In the applicatione here exactly 32 but should typically be fastest, but 64
+00030 // might be better on an Alpha with GCC at -O3 optimization so try your options
+00031 // and see what's best for you.
+00032 //
+00033 // The C99-standard defines uint32_t to be declared in stdint.h, but some
+00034 // systmes don't have that and implement it in inttypes.h.
+00035 #if (! defined __sun)
+00036 #include <stdint.h>
+00037 #else
+00038 #include <inttypes.h>
+00039 #endif
+00040 
+00041 #include <vector>
+00042 #include "eoPersistent.h"
+00043 #include "eoObject.h"
+00044 
+00103 class eoRng : public eoObject, public eoPersistent
+00104 {
+00105 public :
+00106 
+00113     eoRng(uint32_t s)
+00114         : state(0), next(0), left(-1), cached(false), N(624), M(397), K(0x9908B0DFU)
+00115         {
+00116             state = new uint32_t[N+1];
+00117             initialize(2*s);
+00118         }
+00119 
+00120     ~eoRng(void)
+00121         {
+00122             delete [] state;
+00123         }
+00124 
+00135     void reseed(uint32_t s)
+00136         {
+00137             initialize(2*s);
+00138         }
+00139 
+00150     void oldReseed(uint32_t s)
+00151         {
+00152             initialize(s);
+00153         }
+00154 
+00158     double uniform(double m = 1.0)
+00159         { // random number between [0, m]
+00160             return m * double(rand()) / double(1.0 + rand_max());
+00161         }
+00162 
+00166     uint32_t random(uint32_t m)
+00167         {
+00168             return uint32_t(uniform() * double(m));
+00169         }
+00170 
+00175     bool flip(float bias=0.5)
+00176         {
+00177             return uniform() < bias;
+00178         }
+00179 
+00183     double normal(void);        // gaussian mutation, stdev 1
+00184 
+00188     double normal(double stdev)
+00189         {
+00190             return stdev * normal();
+00191         }
+00192 
+00196     double normal(double mean, double stdev)
+00197         {
+00198             return mean + normal(stdev);
+00199         }
+00200 
+00204     double negexp(double mean)
+00205         {
+00206             return ( -mean*log((double)rand() / rand_max()));
+00207         }
+00208 
+00212     uint32_t rand();
+00213 
+00217     uint32_t rand_max(void) const { return uint32_t(0xffffffff); }
+00218 
+00224     template <typename TYPE>
+00225     int roulette_wheel(const std::vector<TYPE>& vec, TYPE total = 0)
+00226         {
+00227             if (total == 0)
+00228             { // count
+00229                 for (unsigned    i = 0; i < vec.size(); ++i)
+00230                     total += vec[i];
+00231             }
+00232             double fortune = uniform() * total;
+00233             int i = 0;
+00234             while (fortune > 0)
+00235             {
+00236                 fortune -= vec[i++];
+00237             }
+00238             return --i;
+00239         }
+00240 
+00241 
+00246     template <typename TYPE>
+00247     const TYPE& choice(const std::vector<TYPE>& vec) const
+00248         { return vec[random(vec.size())]; }
+00249 
+00250 
+00261     template <typename TYPE>
+00262     TYPE& choice(std::vector<TYPE>& vec)
+00263         { return vec[random(vec.size())]; }
+00264 
+00266     void printOn(std::ostream& _os) const
+00267         {
+00268             for (int i = 0; i < N; ++i)
+00269             {
+00270                 _os << state[i] << ' ';
+00271             }
+00272             _os << int(next - state) << ' ';
+00273             _os << left << ' ' << cached << ' ' << cacheValue;
+00274         }
+00275 
+00277     void readFrom(std::istream& _is)
+00278         {
+00279             for (int i = 0; i < N; ++i)
+00280             {
+00281                 _is >> state[i];
+00282             }
+00283 
+00284             int n;
+00285             _is >> n;
+00286             next = state + n;
+00287 
+00288             _is >> left;
+00289             _is >> cached;
+00290             _is >> cacheValue;
+00291         }
+00292 
+00293     std::string className(void) const { return "Mersenne-Twister"; }
+00294 
+00295 private:
+00296 
+00297     uint32_t restart(void);
+00298 
+00299 
+00300     /* @brief Initialize state
+00301 
+00302     We initialize state[0..(N-1)] via the generator
+00303 
+00304     <tt>x_new = (69069 * x_old) mod 2^32</tt>
+00305 
+00306     from Line 15 of Table 1, p. 106, Sec. 3.3.4 of Knuth's _The Art of Computer
+00307     Programming_, Volume 2, 3rd ed.
+00308 
+00309     Notes (SJC): I do not know what the initial state requirements of the
+00310     Mersenne Twister are, but it seems this seeding generator could be better.
+00311     It achieves the maximum period for its modulus (2^30) iff x_initial is odd
+00312     (p. 20-21, Sec. 3.2.1.2, Knuth); if x_initial can be even, you have
+00313     sequences like 0, 0, 0, ...; 2^31, 2^31, 2^31, ...; 2^30, 2^30, 2^30, ...;
+00314     2^29, 2^29 + 2^31, 2^29, 2^29 + 2^31, ..., etc. so I force seed to be odd
+00315     below.
+00316 
+00317     Even if x_initial is odd, if x_initial is 1 mod 4 then
+00318 
+00319     the          lowest bit of x is always 1,
+00320     the  next-to-lowest bit of x is always 0,
+00321     the 2nd-from-lowest bit of x alternates      ... 0 1 0 1 0 1 0 1 ... ,
+00322     the 3rd-from-lowest bit of x 4-cycles        ... 0 1 1 0 0 1 1 0 ... ,
+00323     the 4th-from-lowest bit of x has the 8-cycle ... 0 0 0 1 1 1 1 0 ... ,
+00324     ...
+00325 
+00326     and if x_initial is 3 mod 4 then
+00327 
+00328     the          lowest bit of x is always 1,
+00329     the  next-to-lowest bit of x is always 1,
+00330     the 2nd-from-lowest bit of x alternates      ... 0 1 0 1 0 1 0 1 ... ,
+00331     the 3rd-from-lowest bit of x 4-cycles        ... 0 0 1 1 0 0 1 1 ... ,
+00332     the 4th-from-lowest bit of x has the 8-cycle ... 0 0 1 1 1 1 0 0 ... ,
+00333     ...
+00334 
+00335     The generator's potency (min. s>=0 with (69069-1)^s = 0 mod 2^32) is 16,
+00336     which seems to be alright by p. 25, Sec. 3.2.1.3 of Knuth. It also does well
+00337     in the dimension 2..5 spectral tests, but it could be better in dimension 6
+00338     (Line 15, Table 1, p. 106, Sec. 3.3.4, Knuth).
+00339 
+00340     Note that the random number user does not see the values generated here
+00341     directly since restart() will always munge them first, so maybe none of all
+00342     of this matters. In fact, the seed values made here could even be
+00343     extra-special desirable if the Mersenne Twister theory says so-- that's why
+00344     the only change I made is to restrict to odd seeds.
+00345     */
+00346     void initialize(uint32_t seed);
+00347 
+00349     uint32_t* state;
+00350 
+00351     uint32_t* next;
+00352 
+00353     int left;
+00354 
+00355     // for normal distribution
+00356     bool cached;
+00357 
+00358     float cacheValue;
+00359 
+00360     const int N;
+00361 
+00362     const int M;
+00363 
+00365     const uint32_t K;
+00366 
+00367 
+00376     eoRng(const eoRng&);
+00377 
+00382     eoRng& operator=(const eoRng&);
+00383 };
+00384 
+00385 
+00386 
+00387 namespace eo
+00388 {
+00390     extern eoRng rng;
+00391 }
+00392 using eo::rng;
+00393 
+00394 
+00395 
+00396 
+00397 
+00398 // Implementation of some eoRng members.... Don't mind the mess, it does work.
+00399 
+00400 
+00401 #define hiBit(u)       ((u) & 0x80000000U)   // mask all but highest   bit of u
+00402 #define loBit(u)       ((u) & 0x00000001U)   // mask all but lowest    bit of u
+00403 #define loBits(u)      ((u) & 0x7FFFFFFFU)   // mask     the highest   bit of u
+00404 #define mixBits(u, v)  (hiBit(u)|loBits(v))  // move hi bit of u to hi bit of v
+00405 
+00406 inline void eoRng::initialize(uint32_t seed)
+00407 {
+00408     left = -1;
+00409 
+00410     register uint32_t x = (seed | 1U) & 0xFFFFFFFFU, *s = state;
+00411     register int    j;
+00412 
+00413     for(left=0, *s++=x, j=N; --j;
+00414         *s++ = (x*=69069U) & 0xFFFFFFFFU);
+00415 }
+00416 
+00417 
+00418 
+00419 inline uint32_t eoRng::restart(void)
+00420 {
+00421     register uint32_t *p0=state, *p2=state+2, *pM=state+M, s0, s1;
+00422     register int    j;
+00423 
+00424     left=N-1, next=state+1;
+00425 
+00426     for(s0=state[0], s1=state[1], j=N-M+1; --j; s0=s1, s1=*p2++)
+00427         *p0++ = *pM++ ^ (mixBits(s0, s1) >> 1) ^ (loBit(s1) ? K : 0U);
+00428 
+00429     for(pM=state, j=M; --j; s0=s1, s1=*p2++)
+00430         *p0++ = *pM++ ^ (mixBits(s0, s1) >> 1) ^ (loBit(s1) ? K : 0U);
+00431 
+00432     s1=state[0], *p0 = *pM ^ (mixBits(s0, s1) >> 1) ^ (loBit(s1) ? K : 0U);
+00433     s1 ^= (s1 >> 11);
+00434     s1 ^= (s1 <<  7) & 0x9D2C5680U;
+00435     s1 ^= (s1 << 15) & 0xEFC60000U;
+00436     return(s1 ^ (s1 >> 18));
+00437 }
+00438 
+00439 
+00440 
+00441 inline uint32_t eoRng::rand(void)
+00442 {
+00443 
+00444     uint32_t y;
+00445 
+00446     if(--left < 0)
+00447         return(restart());
+00448 
+00449     y  = *next++;
+00450     y ^= (y >> 11);
+00451     y ^= (y <<  7) & 0x9D2C5680U;
+00452     y ^= (y << 15) & 0xEFC60000U;
+00453     return(y ^ (y >> 18));
+00454 }
+00455 
+00456 
+00457 
+00458 inline double eoRng::normal(void)
+00459 {
+00460     if (cached)
+00461     {
+00462         cached = false;
+00463         return cacheValue;
+00464     }
+00465 
+00466     float rSquare, factor, var1, var2;
+00467 
+00468     do
+00469     {
+00470         var1 = 2.0 * uniform() - 1.0;
+00471         var2 = 2.0 * uniform() - 1.0;
+00472 
+00473         rSquare = var1 * var1 + var2 * var2;
+00474     }
+00475     while (rSquare >= 1.0 || rSquare == 0.0);
+00476 
+00477     factor = sqrt(-2.0 * log(rSquare) / rSquare);
+00478 
+00479     cacheValue = var1 * factor;
+00480     cached = true;
+00481 
+00482     return (var2 * factor);
+00483 }
+00484 
+00485 
+00486 
+00487 namespace eo {
+00488     // a few convenience functions for generating numbers
+00489 
+00503     template <typename T>
+00504     inline T random(const T& max) {
+00505         return static_cast<T>(rng.uniform() * max); }
+00506 
+00516     template <typename T>
+00517     inline T random(const T& min, const T& max) {
+00518         return static_cast<T>(rng.uniform() * (max-min)) + min; }
+00519 
+00521     inline double normal() { return rng.normal(); }
+00522 }
+00523 
+00524 
+00525 #endif
+00526 
+00527 
+00528 // Local Variables:
+00529 // coding: iso-8859-1
+00530 // mode: C++
+00531 // c-file-style: "Stroustrup"
+00532 // fill-column: 80
+00533 // End:
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_random_select_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_random_select_8h-source.html new file mode 100644 index 000000000..8a3c53875 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_random_select_8h-source.html @@ -0,0 +1,96 @@ + + +EO: eoRandomSelect.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoRandomSelect.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoRandomSelect.h
+00005 // (c) GeNeura Team, 1998 - EEAAX 1999, Maarten Keijzer 2000
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mak@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef eoRandomSelect_h
+00028 #define eoRandomSelect_h
+00029 
+00030 //-----------------------------------------------------------------------------
+00037 #include <utils/eoRNG.h>
+00038 #include <eoSelectOne.h>
+00039 
+00040 //-----------------------------------------------------------------------------
+00042 //-----------------------------------------------------------------------------
+00043 
+00044 template <class EOT> class eoRandomSelect: public eoSelectOne<EOT>
+00045 {
+00046  public:
+00047 
+00049   virtual const EOT& operator()(const eoPop<EOT>& _pop)
+00050   {
+00051     return _pop[eo::rng.random(_pop.size())] ;
+00052   }
+00053 };
+00054 
+00055 //-----------------------------------------------------------------------------
+00058 //-----------------------------------------------------------------------------
+00059 
+00060 template <class EOT> class eoBestSelect: public eoSelectOne<EOT>
+00061 {
+00062  public:
+00063 
+00065   virtual const EOT& operator()(const eoPop<EOT>& _pop)
+00066   {
+00067     return _pop.best_element() ;
+00068   }
+00069 };
+00070 
+00071 //-----------------------------------------------------------------------------
+00076 //-----------------------------------------------------------------------------
+00077 
+00078 template <class EOT> class eoNoSelect: public eoSelectOne<EOT>
+00079 {
+00080  public:
+00083   eoNoSelect(): current(0) {}
+00084 
+00085   virtual const EOT& operator()(const eoPop<EOT>& _pop)
+00086   {
+00087     if (current >= _pop.size())
+00088       current=0;
+00089 
+00090     current++;
+00091     return _pop[current-1] ;
+00092   }
+00093 private:
+00094   unsigned current;
+00095 };
+00096 
+00097 #endif
+00098 
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_ranking_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_ranking_8h-source.html new file mode 100644 index 000000000..a0e15c571 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_ranking_8h-source.html @@ -0,0 +1,97 @@ + + +EO: eoRanking.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoRanking.h

00001 
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef eoRanking_h
+00028 #define eoRanking_h
+00029 
+00030 #include <eoPerf2Worth.h>
+00031 
+00037 template <class EOT>
+00038 class eoRanking : public eoPerf2Worth<EOT> // false: do not cache fitness
+00039 {
+00040 public:
+00041 
+00042     using eoPerf2Worth<EOT>::value;
+00043 
+00044   /* Ctor:
+00045    @param _p selective pressure (in (1,2]
+00046    @param _e exponent (1 == linear)
+00047   */
+00048   eoRanking(double _p=2.0, double _e=1.0):
+00049     pressure(_p), exponent(_e) {}
+00050 
+00051   /* helper function: finds index in _pop of _eo, an EOT * */
+00052   int lookfor(const EOT *_eo, const eoPop<EOT>& _pop)
+00053     {
+00054       typename eoPop<EOT>::const_iterator it;
+00055       for (it=_pop.begin(); it<_pop.end(); it++)
+00056         {
+00057           if (_eo == &(*it))
+00058             return it-_pop.begin();
+00059         }
+00060       throw std::runtime_error("Not found in eoLinearRanking");
+00061     }
+00062 
+00063   /* COmputes the ranked fitness: fitnesses range in [m,M]
+00064      with m=2-pressure/popSize and M=pressure/popSize.
+00065      in between, the progression depstd::ends on exponent (linear if 1).
+00066    */
+00067   virtual void operator()(const eoPop<EOT>& _pop)
+00068     {
+00069       std::vector<const EOT *> rank;
+00070       _pop.sort(rank);
+00071       unsigned pSize =_pop.size();
+00072       unsigned int pSizeMinusOne = pSize-1;
+00073 
+00074       if (pSize <= 1)
+00075         throw std::runtime_error("Cannot do ranking with population of size <= 1");
+00076 
+00077       // value() refers to the std::vector of worthes (we're in an eoParamvalue)
+00078       value().resize(pSize);
+00079 
+00080       double beta = (2-pressure)/pSize;
+00081       if (exponent == 1.0)         // no need for exponetial then
+00082         {
+00083           double alpha = (2*pressure-2)/(pSize*pSizeMinusOne);
+00084           for (unsigned i=0; i<pSize; i++)
+00085             {
+00086               int which = lookfor(rank[i], _pop);
+00087               value()[which] = alpha*(pSize-i)+beta; // worst -> 1/[P(P-1)/2]
+00088             }
+00089         }
+00090       else                                 // exponent != 1
+00091         {
+00092           double gamma = (2*pressure-2)/pSize;
+00093           for (unsigned i=0; i<pSize; i++)
+00094             {
+00095               int which = lookfor(rank[i], _pop);
+00096               // value in in [0,1]
+00097               double tmp = ((double)(pSize-i))/pSize;
+00098               // to the exponent, and back to [m,M]
+00099               value()[which] = gamma*pow(tmp, exponent)+beta;
+00100             }
+00101         }
+00102     }
+00103  private:
+00104   double pressure;      // selective pressure
+00105   double exponent;
+00106 };
+00107 
+00108 
+00109 
+00110 #endif
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_ranking_select_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_ranking_select_8h-source.html new file mode 100644 index 000000000..4b28c85fb --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_ranking_select_8h-source.html @@ -0,0 +1,60 @@ + + +EO: eoRankingSelect.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoRankingSelect.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoRankingSelect.h
+00005 // (c) GeNeura Team, 1998, Maarten Keijzer 2000, Marc Schoenauer 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: Marc.Schoenauer@polytechnique.fr
+00022              mak@dhi.dk
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef eoRankingSelect_h
+00027 #define eoRankingSelect_h
+00028 
+00029 //-----------------------------------------------------------------------------
+00030 
+00031 #include <eoSelectFromWorth.h>
+00032 #include <eoRanking.h>
+00033 
+00040 template <class EOT> 
+00041 class eoRankingSelect: public eoRouletteWorthSelect<EOT, double> 
+00042 {
+00043 public:
+00048   eoRankingSelect(double _p = 2.0, double _e=1.0): 
+00049     eoRouletteWorthSelect<EOT, double>(ranking), ranking(_p, _e) {}
+00050 
+00051 private :
+00052   eoRanking<EOT> ranking;          // derived from eoPerf2Worth
+00053 };
+00054 
+00055 #endif
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_real_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_real_8h-source.html new file mode 100644 index 000000000..7751e7692 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_real_8h-source.html @@ -0,0 +1,65 @@ + + +EO: eoReal.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

eoReal.h

00001 /*
+00002    eoReal.h
+00003 // (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000
+00004 
+00005     This library is free software; you can redistribute it and/or
+00006     modify it under the terms of the GNU Lesser General Public
+00007     License as published by the Free Software Foundation; either
+00008     version 2 of the License, or (at your option) any later version.
+00009 
+00010     This library is distributed in the hope that it will be useful,
+00011     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00012     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00013     Lesser General Public License for more details.
+00014 
+00015     You should have received a copy of the GNU Lesser General Public
+00016     License along with this library; if not, write to the Free Software
+00017     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00018 
+00019     Contact: Marc.Schoenauer@polytechnique.fr
+00020              todos@geneura.ugr.es, http://geneura.ugr.es 
+00021              mkeijzer@dhi.dk
+00022 */
+00023 
+00024 #ifndef eoReal_h
+00025 #define eoReal_h
+00026 
+00027 //-----------------------------------------------------------------------------
+00028 
+00029 #include <iostream>    // std::ostream, std::istream
+00030 #include <string>      // std::string
+00031 
+00032 #include <eoVector.h>
+00033 
+00037 template <class FitT> class eoReal: public eoVector<FitT, double>
+00038 {
+00039  public:
+00040 
+00045   eoReal(unsigned size = 0, double value = 0.0):
+00046     eoVector<FitT, double>(size, value) {}
+00047 
+00049   virtual std::string className() const
+00050     {
+00051       return "eoReal";
+00052     }
+00053 
+00054 };
+00055 
+00056 //-----------------------------------------------------------------------------
+00057 
+00058 #endif
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_real_atom_xover_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_real_atom_xover_8h-source.html new file mode 100644 index 000000000..8ea085a12 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_real_atom_xover_8h-source.html @@ -0,0 +1,62 @@ + + +EO: eoRealAtomXover.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

eoRealAtomXover.h

00001 
+00023 //-----------------------------------------------------------------------------
+00024 
+00031 #ifndef _eoRealAtomXover_H
+00032 #define _eoRealAtomXover_H
+00033 
+00034 #include <utils/eoRNG.h>
+00035 
+00036 #include <eoOp.h>
+00037 
+00041 class eoDoubleExchange: public eoBinOp<double>
+00042 {
+00043 public:
+00047   eoDoubleExchange() {}
+00048 
+00050   virtual std::string className() const { return "eoDoubleExchange"; }
+00051 
+00055   bool operator()(double& r1, const double& r2) 
+00056   {
+00057     if (eo::rng.flip())
+00058       if (r1 != r2)        // if r1 == r2 you must return false
+00059         {
+00060           r1 = r2;
+00061           return true;
+00062         }
+00063     return false;
+00064   }
+00065   
+00066 };
+00067 
+00071 class eoDoubleIntermediate: public eoBinOp<double>
+00072 {
+00073 public:
+00077   eoDoubleIntermediate() {}
+00078 
+00080   virtual std::string className() const { return "eoDoubleIntermediate"; }
+00081 
+00085   bool operator()(double& r1, const double& r2) 
+00086   {
+00087     double alpha = eo::rng.uniform();
+00088     r1 = alpha * r2 + (1-alpha) * r1;
+00089     return true;
+00090   }
+00091   
+00092 };
+00093 
+00094 #endif
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_real_bounds_8cpp-source.html b/trunk/paradiseo-eo/doc/html/eo_real_bounds_8cpp-source.html new file mode 100644 index 000000000..dfbc65d39 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_real_bounds_8cpp-source.html @@ -0,0 +1,267 @@ + + +EO: eoRealBounds.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoRealBounds.cpp

00001 #ifdef _MSC_VER
+00002 // to avoid long name warnings
+00003 #pragma warning(disable:4786)
+00004 #endif
+00005 
+00006 #ifdef HAVE_CONFIG_H
+00007 #include <config.h>
+00008 #endif
+00009 
+00010 #include <ctime>
+00011 #include <sstream>
+00012 
+00013 #include "eoRealBounds.h"
+00014 #include "eoRealVectorBounds.h"
+00015 
+00016 
+00017 // the global dummy bounds
+00018 // (used for unbounded variables when bounds are required)
+00019 eoRealNoBounds eoDummyRealNoBounds;
+00020 eoRealVectorNoBounds eoDummyVectorNoBounds(0);
+00021 
+00023 
+00024 // removes leading delimiters - return false if nothing else left
+00025 bool remove_leading(std::string & _s, const std::string _delim)
+00026 {
+00027   size_t posDebToken = _s.find_first_not_of(_delim);
+00028   if (posDebToken >= _s.size())
+00029     return false;
+00030   _s = _s.substr(posDebToken);
+00031   return true;
+00032 }
+00033 
+00034 double read_double(std::string _s)
+00035 {
+00036     std::istringstream is(_s);
+00037   double r;
+00038   is >> r;
+00039   return r;
+00040 }
+00041 
+00042 long int read_int(std::string _s)
+00043 {
+00044     std::istringstream is(_s);
+00045   long int i;
+00046   is >> i;
+00047   return i;
+00048 }
+00049 
+00050 // need to rewrite copy ctor and assignement operator because of ownedBounds
+00051 eoRealVectorBounds::eoRealVectorBounds(const eoRealVectorBounds & _b):
+00052   eoRealBaseVectorBounds(_b)
+00053 {
+00054   factor = _b.factor;
+00055   ownedBounds = _b.ownedBounds;
+00056   // duplicate all pointers!
+00057   if (ownedBounds.size()>0)
+00058     for (unsigned i=0; i<ownedBounds.size(); i++)
+00059       ownedBounds[i] = ownedBounds[i]->dup();
+00060 }
+00061 
+00062 
+00063 // the readFrom method of eoRealVectorNoBounds:
+00064 // only calls the readFrom(string) - for param reading
+00065 void eoRealVectorBounds::readFrom(std::istream& _is)
+00066 {
+00067   std::string value;
+00068   _is >> value;
+00069   readFrom(value);
+00070   return;
+00071 }
+00072 
+00073 void eoRealVectorBounds::readFrom(std::string _value)
+00074 {
+00075   // keep track of old size - to adjust in the end
+00076   unsigned oldSize = size();
+00077   // clean-up before filling in
+00078   if (ownedBounds.size()>0)
+00079     for (unsigned i = 0; i < ownedBounds.size(); ++i)
+00080       {
+00081         delete ownedBounds[i];
+00082       }
+00083   ownedBounds.resize(0);
+00084   factor.resize(0);
+00085   resize(0);
+00086 
+00087   // now read
+00088   std::string delim(",; ");
+00089   while (_value.size()>0)
+00090     {
+00091       if (!remove_leading(_value, delim)) // only delimiters were left
+00092         break;
+00093       // look for opening char
+00094       size_t posDeb = _value.find_first_of("[(");
+00095       if (posDeb >= _value.size())      // nothing left to read (though probably a syntax error there)
+00096         {
+00097           break;
+00098         }
+00099       // ending char
+00100       std::string closeChar = (_value[posDeb] == '(' ? std::string(")") : std::string("]") );
+00101 
+00102       size_t posFin = _value.find_first_of(std::string(closeChar));
+00103       if (posFin >= _value.size())
+00104         throw std::runtime_error("Syntax error when reading bounds");
+00105 
+00106   // y a-t-il un nbre devant
+00107       unsigned count = 1;
+00108       if (posDeb > 0)                   // something before opening
+00109         {
+00110           std::string sCount = _value.substr(0, posDeb);
+00111           count = read_int(sCount);
+00112           if (count <= 0)
+00113             throw std::runtime_error("Syntax error when reading bounds");
+00114         }
+00115 
+00116       // the bounds
+00117       std::string sBounds = _value.substr(posDeb+1, posFin-posDeb-1);
+00118       // and remove from original string
+00119       _value = _value.substr(posFin+1);
+00120 
+00121       remove_leading(sBounds, delim);
+00122       size_t posDelim = sBounds.find_first_of(delim);
+00123       if (posDelim >= sBounds.size())
+00124         throw std::runtime_error("Syntax error when reading bounds");
+00125 
+00126       bool minBounded=false, maxBounded=false;
+00127       double minBound=0, maxBound=0;
+00128 
+00129       // min bound
+00130       std::string sMinBounds = sBounds.substr(0,posDelim);
+00131       if (sMinBounds != std::string("-inf"))
+00132         {
+00133           minBounded = true;
+00134           minBound = read_double(sMinBounds);
+00135         }
+00136 
+00137       // max bound
+00138       size_t posEndDelim = sBounds.find_first_not_of(delim,posDelim);
+00139 
+00140       std::string sMaxBounds = sBounds.substr(posEndDelim);
+00141       if (sMaxBounds != std::string("+inf"))
+00142         {
+00143           maxBounded = true;
+00144           maxBound = read_double(sMaxBounds);
+00145         }
+00146 
+00147       // now create the eoRealBounds objects
+00148       eoRealBounds *ptBounds;
+00149       if (minBounded && maxBounded)
+00150         ptBounds = new eoRealInterval(minBound, maxBound);
+00151       else if (!minBounded && !maxBounded)      // no bound at all
+00152         ptBounds = new eoRealNoBounds;
+00153       else if (!minBounded && maxBounded)
+00154         ptBounds = new eoRealAboveBound(maxBound);
+00155       else if (minBounded && !maxBounded)
+00156         ptBounds = new eoRealBelowBound(minBound);
+00157       // store it for memory management
+00158       ownedBounds.push_back(ptBounds);
+00159       // push the count
+00160       factor.push_back(count);
+00161       // and add count of it to the actual bounds
+00162       for (unsigned i=0; i<count; i++)
+00163         push_back(ptBounds);
+00164     }
+00165   // now adjust the size to the initial value
+00166   adjust_size(oldSize);
+00167 }
+00168 
+00170 void eoRealVectorBounds::adjust_size(unsigned _dim)
+00171 {
+00172   if ( size() < _dim )
+00173     {
+00174       // duplicate last bound
+00175       unsigned missing = _dim-size();
+00176       eoRealBounds * ptBounds = back();
+00177       for (unsigned i=0; i<missing; i++)
+00178         push_back(ptBounds);
+00179       // update last factor (warning: can be > 1 already!)
+00180       factor[factor.size()-1] += missing;
+00181     }
+00182 }
+00183 
+00189 eoRealBounds* eoGeneralRealBounds::getBoundsFromString(std::string _value)
+00190 {
+00191   // now read
+00192   std::string delim(",; ");
+00193   std::string beginOrClose("[(])");
+00194   if (!remove_leading(_value, delim)) // only delimiters were left
+00195     throw std::runtime_error("Syntax error in eoGeneralRealBounds Ctor");
+00196 
+00197   // look for opening char
+00198   size_t posDeb = _value.find_first_of(beginOrClose);   // allow ]a,b]
+00199   if (posDeb >= _value.size())  // nothing left to read
+00200     throw std::runtime_error("Syntax error in eoGeneralRealBounds Ctor");
+00201 
+00202   // ending char: next {}() after posDeb
+00203   size_t posFin = _value.find_first_of(beginOrClose,posDeb+1);
+00204   if (posFin >= _value.size())  // not found
+00205     throw std::runtime_error("Syntax error in eoGeneralRealBounds Ctor");
+00206 
+00207   // the bounds
+00208   std::string sBounds = _value.substr(posDeb+1, posFin-posDeb-1);
+00209   // and remove from original string
+00210   _value = _value.substr(posFin+1);
+00211 
+00212   remove_leading(sBounds, delim);
+00213   size_t posDelim = sBounds.find_first_of(delim);
+00214   if (posDelim >= sBounds.size())
+00215     throw std::runtime_error("Syntax error in eoGeneralRealBounds Ctor");
+00216 
+00217       bool minBounded=false, maxBounded=false;
+00218       double minBound=0, maxBound=0;
+00219 
+00220       // min bound
+00221       std::string sMinBounds = sBounds.substr(0,posDelim);
+00222 
+00223       if ( (sMinBounds != std::string("-inf")) &&
+00224            (sMinBounds != std::string("-infinity"))
+00225            )
+00226         {
+00227           minBounded = true;
+00228           minBound = read_double(sMinBounds);
+00229         }
+00230 
+00231       // max bound
+00232       size_t posEndDelim = sBounds.find_first_not_of(delim,posDelim);
+00233 
+00234       std::string sMaxBounds = sBounds.substr(posEndDelim);
+00235 
+00236       if ( (sMaxBounds != std::string("+inf")) &&
+00237            (sMaxBounds != std::string("+infinity"))
+00238            )
+00239         {
+00240           maxBounded = true;
+00241           maxBound = read_double(sMaxBounds);
+00242         }
+00243 
+00244       // now create the embedded eoRealBounds object
+00245       eoRealBounds * locBound;
+00246       if (minBounded && maxBounded)
+00247         {
+00248           if (maxBound <= minBound)
+00249             throw std::runtime_error("Syntax error in eoGeneralRealBounds Ctor");
+00250           locBound = new eoRealInterval(minBound, maxBound);
+00251         }
+00252       else if (!minBounded && !maxBounded)      // no bound at all
+00253         locBound = new eoRealNoBounds;
+00254       else if (!minBounded && maxBounded)
+00255         locBound = new eoRealAboveBound(maxBound);
+00256       else if (minBounded && !maxBounded)
+00257         locBound = new eoRealBelowBound(minBound);
+00258       return locBound;
+00259 }
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_real_bounds_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_real_bounds_8h-source.html new file mode 100644 index 000000000..2fb18710f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_real_bounds_8h-source.html @@ -0,0 +1,493 @@ + + +EO: eoRealBounds.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoRealBounds.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoRealBounds.h
+00005 // (c) Marc Schoenauer 2001, Maarten Keijzer 2000, GeNeura Team, 1998
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mak@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoRealBounds_h
+00028 #define _eoRealBounds_h
+00029 
+00030 #include <stdexcept>               // std::exceptions!
+00031 #include <utils/eoRNG.h>
+00032 
+00075 class eoRealBounds : public eoPersistent
+00076 { 
+00077 public:
+00078   virtual ~eoRealBounds(){}
+00079 
+00082   virtual bool isBounded(void) const  = 0;
+00083 
+00087   virtual bool hasNoBoundAtAll(void) const  = 0;
+00088 
+00091   virtual bool isMinBounded(void) const = 0;
+00092 
+00095   virtual bool isMaxBounded(void) const = 0;
+00096 
+00099   virtual bool isInBounds(double)  const = 0;
+00100 
+00103   virtual void foldsInBounds(double &)  const = 0;
+00104 
+00107   virtual void truncate(double &)  const = 0;
+00108 
+00112   virtual double minimum()  const = 0 ;
+00116   virtual double maximum()  const = 0 ;
+00120   virtual double range()  const = 0;
+00121 
+00125   virtual double uniform(eoRng & _rng = eo::rng)  const = 0;
+00126 
+00128   virtual eoRealBounds * dup()  const = 0;
+00129 };
+00130 
+00133 class eoRealNoBounds : public eoRealBounds
+00134 {
+00135 public:
+00136   virtual ~eoRealNoBounds(){}
+00137 
+00138   virtual bool isBounded(void)  const {return false;}
+00139   virtual bool hasNoBoundAtAll(void) const  {return true;}
+00140   virtual bool isMinBounded(void)  const {return false;}
+00141   virtual bool isMaxBounded(void)  const {return false;}
+00142   virtual void foldsInBounds(double &)  const {return;}
+00143   virtual void truncate(double &)  const {return;}
+00144   virtual bool isInBounds(double)  const {return true;}
+00145 
+00146   virtual double minimum() const
+00147   {
+00148     throw std::logic_error("Trying to get minimum of unbounded eoRealBounds");
+00149   }
+00150   virtual double maximum() const 
+00151   {
+00152     throw std::logic_error("Trying to get maximum of unbounded eoRealBounds");
+00153   }
+00154   virtual double range() const 
+00155   {
+00156     throw std::logic_error("Trying to get range of unbounded eoRealBounds");
+00157   }
+00158 
+00159   virtual double uniform(eoRng & _rng = eo::rng) const 
+00160   {
+00161     throw std::logic_error("Trying to generate uniform values in unbounded eoRealBounds");
+00162   }
+00163 
+00164   // methods from eoPersistent
+00171   virtual void readFrom(std::istream& _is) 
+00172   {
+00173     throw std::runtime_error("Should not use eoRealBounds::readFrom");
+00174   }
+00175 
+00180   virtual void printOn(std::ostream& _os) const
+00181   {
+00182     _os << "[-inf,+inf]";
+00183   }
+00184 
+00186   virtual eoRealBounds * dup() const 
+00187   {
+00188     return new eoRealNoBounds(*this);
+00189   }
+00190 
+00191 };
+00192 
+00193 // one object for all - see eoRealBounds.cpp
+00194 extern eoRealNoBounds eoDummyRealNoBounds;
+00195 
+00199 class eoRealInterval : public eoRealBounds
+00200 {
+00201 public :
+00202   virtual ~eoRealInterval(){}
+00203   
+00207   eoRealInterval(double _min=0, double _max=1) : 
+00208     repMinimum(_min), repMaximum(_max), repRange(_max-_min) 
+00209   {
+00210     if (repRange<=0)
+00211       throw std::logic_error("Void range in eoRealBounds");
+00212   }
+00213 
+00214   // accessors  
+00215   virtual double minimum() const { return repMinimum; }
+00216   virtual double maximum() const { return repMaximum; }
+00217   virtual double range()  const { return repRange; }
+00218 
+00219   // description
+00220   virtual bool isBounded(void)  const {return true;}
+00221   virtual bool hasNoBoundAtAll(void)  const {return false;}
+00222   virtual bool isMinBounded(void)  const {return true;}
+00223   virtual bool isMaxBounded(void)  const {return true;}
+00224 
+00225   virtual double uniform(eoRng & _rng = eo::rng) const 
+00226   {
+00227     return repMinimum + _rng.uniform(repRange);
+00228   }  
+00229 
+00230   // says if a given double is within the bounds
+00231   virtual bool isInBounds(double _r) const 
+00232   {
+00233     if (_r < repMinimum)
+00234       return false;
+00235     if (_r > repMaximum)
+00236       return false;
+00237     return true;
+00238   }
+00239 
+00240   // folds a value into bounds
+00241   virtual void foldsInBounds(double &  _r) const 
+00242   {
+00243     long iloc;
+00244     double dlargloc = 2 * range() ;
+00245 
+00246     if (fabs(_r) > 1.0E9)               // iloc too large!
+00247       {
+00248         _r = uniform();
+00249         return;
+00250       }
+00251 
+00252     if ( (_r > maximum()) )
+00253       {
+00254         iloc = (long) ( (_r-minimum()) / dlargloc ) ;
+00255         _r -= dlargloc * iloc ;
+00256         if ( _r > maximum() )
+00257           _r = 2*maximum() - _r ;
+00258       }
+00259     
+00260     if (_r < minimum()) 
+00261       {
+00262         iloc = (long) ( (maximum()-_r) / dlargloc ) ;
+00263         _r += dlargloc * iloc ;
+00264         if (_r < minimum())
+00265           _r = 2*minimum() - _r ;
+00266       }
+00267   }    
+00268 
+00269   // truncates to the bounds
+00270   virtual void truncate(double & _r) const 
+00271   {
+00272     if (_r < repMinimum)
+00273       _r = repMinimum;
+00274     else if (_r > repMaximum)
+00275       _r = repMaximum;
+00276     return;
+00277   }
+00278 
+00279   // methods from eoPersistent
+00286   virtual void readFrom(std::istream& _is) 
+00287   {
+00288     throw std::runtime_error("Should not use eoRealInterval::readFrom");
+00289   }
+00290 
+00295   virtual void printOn(std::ostream& _os) const
+00296   {
+00297     _os << "[" << repMinimum << "," << repMaximum << "]";
+00298   }
+00299 
+00301   virtual eoRealBounds * dup() const 
+00302   {
+00303     return new eoRealInterval(*this);
+00304   }
+00305 
+00306 private :
+00307   double repMinimum;
+00308   double repMaximum;
+00309   double repRange;                         // to minimize operations ???
+00310 };
+00311 
+00315 class eoRealBelowBound : public eoRealBounds
+00316 {
+00317 public :
+00318   virtual ~eoRealBelowBound(){}  
+00322   eoRealBelowBound(double _min=0) : 
+00323     repMinimum(_min)
+00324   {}
+00325 
+00326   // accessors  
+00327   virtual double minimum() const { return repMinimum; }
+00328 
+00329   virtual double maximum() const 
+00330   {
+00331     throw std::logic_error("Trying to get maximum of eoRealBelowBound");
+00332   }
+00333   virtual double range() const 
+00334   {
+00335     throw std::logic_error("Trying to get range of eoRealBelowBound");
+00336   }
+00337 
+00338   // random generators
+00339   virtual double uniform(eoRng & _rng = eo::rng) const 
+00340   {
+00341     throw std::logic_error("Trying to generate uniform values in eoRealBelowBound");
+00342   }
+00343 
+00344   // description
+00345   virtual bool isBounded(void)  const {return false;}
+00346   virtual bool hasNoBoundAtAll(void)  const {return false;}
+00347   virtual bool isMinBounded(void)  const {return true;}
+00348   virtual bool isMaxBounded(void) const  {return false;}
+00349 
+00350   // says if a given double is within the bounds
+00351   virtual bool isInBounds(double _r) const 
+00352   {
+00353     if (_r < repMinimum)
+00354       return false;
+00355     return true;
+00356   }
+00357 
+00358   // folds a value into bounds
+00359   virtual void foldsInBounds(double &  _r) const 
+00360   {
+00361     // easy as a pie: symmetry w.r.t. minimum
+00362     if (_r < repMinimum)           // nothing to do otherwise
+00363       _r = 2*repMinimum - _r;
+00364     return ;
+00365   }    
+00366 
+00367   // truncates to the bounds
+00368   virtual void truncate(double & _r) const 
+00369   {
+00370     if (_r < repMinimum)
+00371       _r = repMinimum;
+00372     return;
+00373   }
+00374 
+00375   // methods from eoPersistent
+00382   virtual void readFrom(std::istream& _is) 
+00383   {
+00384     throw std::runtime_error("Should not use eoRealBelowBound::readFrom");
+00385   }
+00386 
+00391   virtual void printOn(std::ostream& _os) const
+00392   {
+00393     _os << "[" << repMinimum << ",+inf]";
+00394   }
+00395 
+00397   virtual eoRealBounds * dup() const 
+00398   {
+00399     return new eoRealBelowBound(*this);
+00400   }
+00401 
+00402 private :
+00403   double repMinimum;
+00404 };
+00405 
+00409 class eoRealAboveBound : public eoRealBounds
+00410 {
+00411 public :
+00412   virtual ~eoRealAboveBound(){}
+00413   
+00417   eoRealAboveBound(double _max=0) : 
+00418     repMaximum(_max)
+00419   {}
+00420 
+00421   // accessors  
+00422   virtual double maximum() const  { return repMaximum; }
+00423 
+00424   virtual double minimum() const 
+00425   {
+00426     throw std::logic_error("Trying to get minimum of eoRealAboveBound");
+00427   }
+00428   virtual double range() const 
+00429   {
+00430     throw std::logic_error("Trying to get range of eoRealAboveBound");
+00431   }
+00432 
+00433   // random generators
+00434   virtual double uniform(eoRng & _rng = eo::rng) const 
+00435   {
+00436     throw std::logic_error("Trying to generate uniform values in eoRealAboveBound");
+00437   }
+00438 
+00439   // description
+00440   virtual bool isBounded(void)  const {return false;}
+00441   virtual bool hasNoBoundAtAll(void)  const {return false;}
+00442   virtual bool isMinBounded(void)  const {return false;}
+00443   virtual bool isMaxBounded(void)  const {return true;}
+00444 
+00445   // says if a given double is within the bounds
+00446   virtual bool isInBounds(double _r) const 
+00447   {
+00448     if (_r > repMaximum)
+00449       return false;
+00450     return true;
+00451   }
+00452 
+00453   // folds a value into bounds
+00454   virtual void foldsInBounds(double &  _r) const 
+00455   {
+00456     // easy as a pie: symmetry w.r.t. maximum
+00457     if (_r > repMaximum)           // nothing to do otherwise
+00458       _r = 2*repMaximum - _r;
+00459     return ;
+00460   }    
+00461 
+00462   // truncates to the bounds
+00463   virtual void truncate(double & _r) const 
+00464   {
+00465     if (_r > repMaximum)
+00466       _r = repMaximum;
+00467     return;
+00468   }
+00469 
+00470   // methods from eoPersistent
+00477   virtual void readFrom(std::istream& _is) 
+00478   {
+00479     throw std::runtime_error("Should not use eoRealAboveBound::readFrom");
+00480   }
+00481 
+00486   virtual void printOn(std::ostream& _os) const
+00487   {
+00488     _os << "[-inf," << repMaximum << "]";
+00489   }
+00490 
+00492   virtual eoRealBounds * dup() const 
+00493   {
+00494     return new eoRealAboveBound(*this);
+00495   }
+00496 
+00497 private :
+00498   double repMaximum;
+00499 };
+00500 
+00502 
+00506 class eoGeneralRealBounds : public eoRealBounds
+00507 {
+00508 public:
+00510   eoGeneralRealBounds(std::string _s = "[-infinity,+infinity]")
+00511   {
+00512     repBound = getBoundsFromString(_s);
+00513   }
+00514 
+00516   eoGeneralRealBounds(const eoGeneralRealBounds & _b):eoRealBounds(_b)
+00517   {
+00518     // replicate the embedded bound (I'm pretty sure there is another
+00519     // way to do that !!!
+00520 
+00521     bool minBounded = _b.isMinBounded();
+00522     bool maxBounded = _b.isMaxBounded();
+00523     double minimum, maximum;
+00524     const eoRealBounds & bb = _b.theBounds();
+00525     if (minBounded) minimum = bb.minimum();
+00526     if (maxBounded) maximum = bb.maximum();
+00527 
+00528       if (minBounded && maxBounded)
+00529         repBound = new eoRealInterval(minimum, maximum);
+00530       else if (!minBounded && !maxBounded)      // no bound at all
+00531         repBound = new eoRealNoBounds;
+00532       else if (!minBounded && maxBounded)
+00533         repBound = new eoRealAboveBound(maximum);
+00534       else if (minBounded && !maxBounded)
+00535         repBound = new eoRealBelowBound(minimum);
+00536   }
+00537 
+00538   eoGeneralRealBounds& operator=(const eoGeneralRealBounds& _b)
+00539   {
+00540     // replicate the embedded bound (I'm pretty sure there is another
+00541     // way to do that !!!
+00542 
+00543     bool minBounded = _b.isMinBounded();
+00544     bool maxBounded = _b.isMaxBounded();
+00545     double minimum, maximum;
+00546     const eoRealBounds & bb = _b.theBounds();
+00547     if (minBounded) minimum = bb.minimum();
+00548     if (maxBounded) maximum = bb.maximum();
+00549 
+00550     // first delete the embedded bounds if necessary
+00551     if (repBound)
+00552       delete repBound;
+00553     // now reallocate
+00554       if (minBounded && maxBounded)
+00555         repBound = new eoRealInterval(minimum, maximum);
+00556       else if (!minBounded && !maxBounded)      // no bound at all
+00557         repBound = new eoRealNoBounds;
+00558       else if (!minBounded && maxBounded)
+00559         repBound = new eoRealAboveBound(maximum);
+00560       else if (minBounded && !maxBounded)
+00561         repBound = new eoRealBelowBound(minimum);
+00562       return (*this);
+00563   }
+00564 
+00565 
+00567   ~eoGeneralRealBounds()
+00568   {
+00569     delete repBound;
+00570   }
+00571 
+00573 
+00575   virtual bool isBounded(void)  const {return repBound->isBounded();}
+00576 
+00580   virtual bool hasNoBoundAtAll(void)  const {return repBound->hasNoBoundAtAll();}
+00581 
+00584   virtual bool isMinBounded(void)  const {return repBound->isMinBounded();}
+00585 
+00588   virtual bool isMaxBounded(void) const {return repBound->isMaxBounded();}
+00589 
+00592   virtual bool isInBounds(double _x)  const {return repBound->isInBounds(_x);}
+00593 
+00596   virtual void foldsInBounds(double & _x) const {return repBound->foldsInBounds(_x);}
+00597 
+00600   virtual void truncate(double & _x)  const {return repBound->truncate(_x);}
+00601 
+00605   virtual double minimum()  const {return repBound->minimum();}
+00609   virtual double maximum() const {return repBound->maximum();}
+00613   virtual double range()  const {return repBound->range();}
+00614 
+00618   virtual double uniform(eoRng & _rng = eo::rng)  const {return repBound->uniform();}
+00619 
+00621   virtual eoRealBounds * dup() const  {return repBound->dup();}
+00622 
+00624   const eoRealBounds & theBounds()  const { return *repBound;} 
+00625 
+00629   virtual void printOn(std::ostream& _os) const
+00630   {
+00631     repBound->printOn(_os);
+00632   }
+00633 
+00635   virtual void readFrom(std::istream& _is) 
+00636   {
+00637     std::string s;
+00638     _is >> s;
+00639     if (repBound)
+00640       delete repBound;
+00641     repBound = getBoundsFromString(s);
+00642   }
+00643 
+00644 private:
+00645   // reading from a string
+00646   eoRealBounds * getBoundsFromString(std::string);
+00647 
+00648   eoRealBounds * repBound;
+00649 };
+00650 
+00651 
+00652 #endif
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_real_init_bounded_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_real_init_bounded_8h-source.html new file mode 100644 index 000000000..42470ac3c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_real_init_bounded_8h-source.html @@ -0,0 +1,76 @@ + + +EO: eoRealInitBounded.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

eoRealInitBounded.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoRealInitBounded.h
+00005 // (c) EEAAX 2000 - Maarten Keijzer 2000
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: Marc.Schoenauer@polytechnique.fr
+00022              mak@dhi.dk
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef eoRealInitBounded_h
+00027 #define eoRealInitBounded_h
+00028 
+00029 //-----------------------------------------------------------------------------
+00030 
+00031 #include <utils/eoRNG.h>
+00032 #include <eoInit.h>
+00033 #include <es/eoReal.h>
+00034 #include <utils/eoRealVectorBounds.h>
+00035 
+00039 template <class EOT>
+00040 class eoRealInitBounded : public eoInit<EOT>
+00041 {
+00042  public:
+00044   eoRealInitBounded(eoRealVectorBounds & _bounds):bounds(_bounds) 
+00045   {
+00046         if (!bounds.isBounded())
+00047       throw std::runtime_error("Needs bounded bounds to initialize a std::vector<double>");
+00048   }
+00049 
+00051   virtual void operator()(EOT & _eo)
+00052     {
+00053       bounds.uniform(_eo);  // resizes, and fills uniformly in bounds
+00054       _eo.invalidate();            // was MISSING!!!!
+00055     }
+00056 
+00058   virtual eoRealVectorBounds & theBounds() {return bounds;}
+00059   virtual unsigned size(){return bounds.size();}
+00060 
+00061  private:
+00062   eoRealVectorBounds & bounds;
+00063 };
+00064 
+00065 //-----------------------------------------------------------------------------
+00067 #endif 
+00068 
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_real_op_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_real_op_8h-source.html new file mode 100644 index 000000000..e9241c06f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_real_op_8h-source.html @@ -0,0 +1,382 @@ + + +EO: eoRealOp.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

eoRealOp.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoRealOp.h
+00005 // (c) Maarten Keijzer 2000 - Marc Schoenauer 2001
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: Marc.Schoenauer@polytechnique.fr
+00022              mak@dhi.dk
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef eoRealOp_h
+00027 #define eoRealOp_h
+00028 
+00029 //-----------------------------------------------------------------------------
+00030 
+00031 #include <algorithm>    // swap_ranges
+00032 #include <utils/eoRNG.h>
+00033 #include <es/eoReal.h>
+00034 #include <utils/eoRealVectorBounds.h>
+00035 
+00036 //-----------------------------------------------------------------------------
+00037 
+00045 template<class EOT> class eoUniformMutation: public eoMonOp<EOT>
+00046 {
+00047  public:
+00056   eoUniformMutation(const double& _epsilon, const double& _p_change = 1.0):
+00057     homogeneous(true), bounds(eoDummyVectorNoBounds), epsilon(1, _epsilon),
+00058     p_change(1, _p_change) {}
+00059 
+00066   eoUniformMutation(eoRealVectorBounds & _bounds,
+00067                     const double& _epsilon, const double& _p_change = 1.0):
+00068     homogeneous(false), bounds(_bounds), epsilon(_bounds.size(), _epsilon),
+00069     p_change(_bounds.size(), _p_change)
+00070   {
+00071     // scale to the range - if any
+00072     for (unsigned i=0; i<bounds.size(); i++)
+00073       if (bounds.isBounded(i))
+00074           epsilon[i] *= _epsilon*bounds.range(i);
+00075   }
+00076 
+00083   eoUniformMutation(eoRealVectorBounds & _bounds,
+00084                     const std::vector<double>& _epsilon,
+00085                     const std::vector<double>& _p_change):
+00086     homogeneous(false), bounds(_bounds), epsilon(_epsilon),
+00087     p_change(_p_change) {}
+00088 
+00090   virtual std::string className() const { return "eoUniformMutation"; }
+00091 
+00096   bool operator()(EOT& _eo)
+00097     {
+00098       bool hasChanged=false;
+00099       if (homogeneous)             // implies no bounds object
+00100         for (unsigned lieu=0; lieu<_eo.size(); lieu++)
+00101           {
+00102             if (rng.flip(p_change[0]))
+00103               {
+00104                 _eo[lieu] += 2*epsilon[0]*rng.uniform()-epsilon[0];
+00105                 hasChanged = true;
+00106               }
+00107           }
+00108       else
+00109         {
+00110           // sanity check ?
+00111           if (_eo.size() != bounds.size())
+00112             throw std::runtime_error("Invalid size of indi in eoUniformMutation");
+00113 
+00114           for (unsigned lieu=0; lieu<_eo.size(); lieu++)
+00115             if (rng.flip(p_change[lieu]))
+00116               {
+00117                 // check the bounds
+00118                 double emin = _eo[lieu]-epsilon[lieu];
+00119                 double emax = _eo[lieu]+epsilon[lieu];
+00120                 if (bounds.isMinBounded(lieu))
+00121                   emin = std::max(bounds.minimum(lieu), emin);
+00122                 if (bounds.isMaxBounded(lieu))
+00123                   emax = std::min(bounds.maximum(lieu), emax);
+00124                 _eo[lieu] = emin + (emax-emin)*rng.uniform();
+00125                 hasChanged = true;
+00126               }
+00127         }
+00128       return hasChanged;
+00129     }
+00130 
+00131 private:
+00132   bool homogeneous;   // == no bounds passed in the ctor
+00133   eoRealVectorBounds & bounds;
+00134   std::vector<double> epsilon;     // the ranges for mutation
+00135   std::vector<double> p_change;    // the proba that each variable is modified
+00136 };
+00137 
+00144 template<class EOT> class eoDetUniformMutation: public eoMonOp<EOT>
+00145 {
+00146  public:
+00154   eoDetUniformMutation(const double& _epsilon, const unsigned& _no = 1):
+00155     homogeneous(true), bounds(eoDummyVectorNoBounds),
+00156     epsilon(1, _epsilon), no(_no) {}
+00157 
+00164   eoDetUniformMutation(eoRealVectorBounds & _bounds,
+00165                        const double& _epsilon, const unsigned& _no = 1):
+00166     homogeneous(false), bounds(_bounds),
+00167     epsilon(_bounds.size(), _epsilon), no(_no)
+00168   {
+00169     // scale to the range - if any
+00170     for (unsigned i=0; i<bounds.size(); i++)
+00171       if (bounds.isBounded(i))
+00172           epsilon[i] *= _epsilon*bounds.range(i);
+00173   }
+00174 
+00181   eoDetUniformMutation(eoRealVectorBounds & _bounds,
+00182                        const std::vector<double>& _epsilon,
+00183                        const unsigned& _no = 1):
+00184     homogeneous(false), bounds(_bounds), epsilon(_epsilon), no(_no)
+00185   {
+00186     // scale to the range - if any
+00187     for (unsigned i=0; i<bounds.size(); i++)
+00188       if (bounds.isBounded(i))
+00189           epsilon[i] *= _epsilon[i]*bounds.range(i);
+00190   }
+00191 
+00193   virtual std::string className() const { return "eoDetUniformMutation"; }
+00194 
+00199   bool operator()(EOT& _eo)
+00200     {
+00201       if (homogeneous)
+00202         for (unsigned i=0; i<no; i++)
+00203           {
+00204             unsigned lieu = rng.random(_eo.size());
+00205             // actually, we should test that we don't re-modify same variable!
+00206             _eo[lieu] = 2*epsilon[0]*rng.uniform()-epsilon[0];
+00207           }
+00208       else
+00209         {
+00210           // sanity check ?
+00211           if (_eo.size() != bounds.size())
+00212             throw std::runtime_error("Invalid size of indi in eoDetUniformMutation");
+00213           for (unsigned i=0; i<no; i++)
+00214             {
+00215               unsigned lieu = rng.random(_eo.size());
+00216               // actually, we should test that we don't re-modify same variable!
+00217 
+00218               // check the bounds
+00219               double emin = _eo[lieu]-epsilon[lieu];
+00220               double emax = _eo[lieu]+epsilon[lieu];
+00221               if (bounds.isMinBounded(lieu))
+00222                 emin = std::max(bounds.minimum(lieu), emin);
+00223               if (bounds.isMaxBounded(lieu))
+00224                 emax = std::min(bounds.maximum(lieu), emax);
+00225               _eo[lieu] = emin + (emax-emin)*rng.uniform();
+00226             }
+00227         }
+00228       return true;
+00229     }
+00230 
+00231 private:
+00232   bool homogeneous;   //  == no bounds passed in the ctor
+00233   eoRealVectorBounds & bounds;
+00234   std::vector<double> epsilon;     // the ranges of mutation
+00235   unsigned no;
+00236 };
+00237 
+00238 
+00239 // two arithmetical crossovers
+00240 
+00247 template<class EOT> class eoSegmentCrossover: public eoQuadOp<EOT>
+00248 {
+00249  public:
+00259   eoSegmentCrossover(const double& _alpha = 0.0) :
+00260     bounds(eoDummyVectorNoBounds), alpha(_alpha), range(1+2*_alpha) {}
+00261 
+00270   eoSegmentCrossover(eoRealVectorBounds & _bounds,
+00271                      const double& _alpha = 0.0) :
+00272     bounds(_bounds), alpha(_alpha), range(1+2*_alpha) {}
+00273 
+00275   virtual std::string className() const { return "eoSegmentCrossover"; }
+00276 
+00282   bool operator()(EOT& _eo1, EOT& _eo2)
+00283     {
+00284       unsigned i;
+00285       double r1, r2, fact;
+00286       double alphaMin = -alpha;
+00287       double alphaMax = 1+alpha;
+00288       if (alpha == 0.0)            // no check to perform
+00289         fact = -alpha + rng.uniform(range); // in [-alpha,1+alpha)
+00290       else                         // look for the bounds for fact
+00291         {
+00292           for (i=0; i<_eo1.size(); i++)
+00293             {
+00294               r1=_eo1[i];
+00295               r2=_eo2[i];
+00296               if (r1 != r2) {      // otherwise you'll get NAN's
+00297                 double rmin = std::min(r1, r2);
+00298                 double rmax = std::max(r1, r2);
+00299                 double length = rmax - rmin;
+00300                 if (bounds.isMinBounded(i))
+00301                   {
+00302                     alphaMin = std::max(alphaMin, (bounds.minimum(i)-rmin)/length);
+00303                     alphaMax = std::min(alphaMax, (rmax-bounds.minimum(i))/length);
+00304                   }
+00305                 if (bounds.isMaxBounded(i))
+00306                   {
+00307                     alphaMax = std::min(alphaMax, (bounds.maximum(i)-rmin)/length);
+00308                     alphaMin = std::max(alphaMin, (rmax-bounds.maximum(i))/length);
+00309                   }
+00310               }
+00311             }
+00312           fact = alphaMin + (alphaMax-alphaMin)*rng.uniform();
+00313         }
+00314 
+00315       for (i=0; i<_eo1.size(); i++)
+00316         {
+00317           r1=_eo1[i];
+00318           r2=_eo2[i];
+00319           _eo1[i] = fact * r1 + (1-fact) * r2;
+00320           _eo2[i] = (1-fact) * r1 + fact * r2;
+00321         }
+00322       return true;         // shoudl test if fact was 0 or 1 :-)))
+00323     }
+00324 
+00325 protected:
+00326   eoRealVectorBounds & bounds;
+00327   double alpha;
+00328   double range;                    // == 1+2*alpha
+00329 };
+00330 
+00337 template<class EOT> class eoHypercubeCrossover: public eoQuadOp<EOT>
+00338 {
+00339  public:
+00349   eoHypercubeCrossover(const double& _alpha = 0.0):
+00350     bounds(eoDummyVectorNoBounds), alpha(_alpha), range(1+2*_alpha)
+00351   {
+00352     if (_alpha < 0)
+00353       throw std::runtime_error("BLX coefficient should be positive");
+00354   }
+00355 
+00364   eoHypercubeCrossover(eoRealVectorBounds & _bounds,
+00365                         const double& _alpha = 0.0):
+00366     bounds(_bounds), alpha(_alpha), range(1+2*_alpha)
+00367   {
+00368     if (_alpha < 0)
+00369       throw std::runtime_error("BLX coefficient should be positive");
+00370   }
+00371 
+00373   virtual std::string className() const { return "eoHypercubeCrossover"; }
+00374 
+00380   bool operator()(EOT& _eo1, EOT& _eo2)
+00381     {
+00382       bool hasChanged = false;
+00383       unsigned i;
+00384       double r1, r2, fact;
+00385       if (alpha == 0.0)            // no check to perform
+00386           for (i=0; i<_eo1.size(); i++)
+00387             {
+00388               r1=_eo1[i];
+00389               r2=_eo2[i];
+00390               if (r1 != r2) {      // otherwise do nothing
+00391                 fact = rng.uniform(range);       // in [0,1)
+00392                 _eo1[i] = fact * r1 + (1-fact) * r2;
+00393                 _eo2[i] = (1-fact) * r1 + fact * r2;
+00394                 hasChanged = true; // forget (im)possible alpha=0
+00395               }
+00396             }
+00397       else         // check the bounds
+00398         // do not try to get a bound on the linear factor, but rather
+00399         // on the object variables themselves
+00400         for (i=0; i<_eo1.size(); i++)
+00401           {
+00402             r1=_eo1[i];
+00403             r2=_eo2[i];
+00404             if (r1 != r2) {        // otherwise do nothing
+00405               double rmin = std::min(r1, r2);
+00406               double rmax = std::max(r1, r2);
+00407 
+00408               // compute min and max for object variables
+00409               double objMin = -alpha * rmax + (1+alpha) * rmin;
+00410               double objMax = -alpha * rmin + (1+alpha) * rmax;
+00411 
+00412               // first find the limits on the alpha's
+00413               if (bounds.isMinBounded(i))
+00414                 {
+00415                   objMin = std::max(objMin, bounds.minimum(i));
+00416                 }
+00417               if (bounds.isMaxBounded(i))
+00418                 {
+00419                   objMax = std::min(objMax, bounds.maximum(i));
+00420                 }
+00421               // then draw variables
+00422               double median = (objMin+objMax)/2.0; // uniform within bounds
+00423               // double median = (rmin+rmax)/2.0;  // Bounce on bounds
+00424               double valMin = objMin + (median-objMin)*rng.uniform();
+00425               double valMax = median + (objMax-median)*rng.uniform();
+00426               // don't always put large value in _eo1 - or what?
+00427               if (rng.flip(0.5))
+00428                 {
+00429                   _eo1[i] = valMin;
+00430                   _eo2[i] = valMax;
+00431                 }
+00432               else
+00433                 {
+00434                   _eo1[i] = valMax;
+00435                   _eo2[i] = valMin;
+00436                 }
+00437               // seomthing has changed
+00438               hasChanged = true; // forget (im)possible alpha=0
+00439             }
+00440           }
+00441 
+00442     return hasChanged;
+00443    }
+00444 
+00445 protected:
+00446   eoRealVectorBounds & bounds;
+00447   double alpha;
+00448   double range;                    // == 1+2*alphaMin
+00449 };
+00450 
+00451 
+00457 template<class EOT> class eoRealUXover: public eoQuadOp<EOT>
+00458 {
+00459  public:
+00464   eoRealUXover(const float& _preference = 0.5): preference(_preference)
+00465     {
+00466       if ( (_preference <= 0.0) || (_preference >= 1.0) )
+00467         std::runtime_error("UxOver --> invalid preference");
+00468     }
+00469 
+00471   virtual std::string className() const { return "eoRealUXover"; }
+00472 
+00479   bool operator()(EOT& _eo1, EOT& _eo2)
+00480     {
+00481       if ( _eo1.size() != _eo2.size())
+00482             std::runtime_error("UxOver --> chromosomes sizes don't match" );
+00483       bool changed = false;
+00484       for (unsigned int i=0; i<_eo1.size(); i++)
+00485         {
+00486           if (rng.flip(preference))
+00487             if (_eo1[i] != _eo2[i])
+00488               {
+00489                 double tmp = _eo1[i];
+00490               _eo1[i]=_eo2[i];
+00491               _eo2[i] = tmp;
+00492               changed = true;
+00493             }
+00494         }
+00495       return changed;
+00496     }
+00497     private:
+00498       float preference;
+00499 };
+00500 
+00501 
+00502 //-----------------------------------------------------------------------------
+00504 #endif
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_real_vector_bounds_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_real_vector_bounds_8h-source.html new file mode 100644 index 000000000..199f3c3cd --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_real_vector_bounds_8h-source.html @@ -0,0 +1,334 @@ + + +EO: eoRealVectorBounds.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoRealVectorBounds.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoRealVectorBounds.h
+00005 // (c) Marc Schoenauer 2001, Maarten Keijzer 2000, GeNeura Team, 1998
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mak@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoRealVectorBounds_h
+00028 #define _eoRealVectorBounds_h
+00029 
+00030 #include <stdexcept>               // std::exceptions!
+00031 #include <utils/eoRNG.h>
+00032 #include <utils/eoRealBounds.h>
+00033 
+00058 class eoRealBaseVectorBounds : public std::vector<eoRealBounds *>
+00059 { 
+00060 public:
+00061   // virtual desctructor (to avoid warning?)
+00062   virtual ~eoRealBaseVectorBounds(){}
+00063 
+00066   eoRealBaseVectorBounds() : std::vector<eoRealBounds *>(0) {}
+00067 
+00070   eoRealBaseVectorBounds(unsigned _dim, eoRealBounds & _bounds) : 
+00071     std::vector<eoRealBounds *>(_dim, &_bounds)
+00072   {}
+00073   
+00076   eoRealBaseVectorBounds(eoRealBounds & _xbounds, eoRealBounds & _ybounds) : 
+00077     std::vector<eoRealBounds *>(0)
+00078   {
+00079         push_back( &_xbounds);
+00080         push_back( &_ybounds);
+00081   }
+00082   
+00085   virtual bool isBounded(unsigned _i) 
+00086   { 
+00087     return (*this)[_i]->isBounded();
+00088   }
+00089  
+00092   virtual bool isBounded(void) 
+00093   {
+00094     for (unsigned i=0; i<size(); i++)
+00095       if (! (*this)[i]->isBounded())
+00096         return false;
+00097     return true;
+00098   }
+00099 
+00102   virtual bool hasNoBoundAtAll(unsigned _i) 
+00103   { 
+00104     return (*this)[_i]->hasNoBoundAtAll();
+00105   }
+00106  
+00109   virtual bool hasNoBoundAtAll(void) 
+00110   {
+00111     for (unsigned i=0; i<size(); i++)
+00112       if (! (*this)[i]->hasNoBoundAtAll())
+00113         return false;
+00114     return true;
+00115   }
+00116 
+00117   virtual bool isMinBounded(unsigned _i) 
+00118   { return (*this)[_i]->isMinBounded();} ;
+00119 
+00120   virtual bool isMaxBounded(unsigned _i) 
+00121   { return (*this)[_i]->isMaxBounded();} ;
+00122 
+00125   virtual void foldsInBounds(unsigned _i, double & _r)
+00126   {
+00127     (*this)[_i]->foldsInBounds(_r);
+00128   }
+00129 
+00132   virtual void foldsInBounds(std::vector<double> & _v)
+00133   {
+00134    for (unsigned i=0; i<size(); i++)
+00135      {
+00136        (*this)[i]->foldsInBounds(_v[i]);
+00137      }    
+00138   }
+00139 
+00142   virtual void truncate(unsigned _i, double & _r)
+00143   {
+00144     (*this)[_i]->truncate(_r);
+00145   }
+00146 
+00149   virtual void truncate(std::vector<double> & _v)
+00150   {
+00151    for (unsigned i=0; i<size(); i++)
+00152      {
+00153        (*this)[i]->truncate(_v[i]);
+00154      }    
+00155   }
+00156 
+00159   virtual bool isInBounds(unsigned _i, double _r)
+00160   { return (*this)[_i]->isInBounds(_r); }
+00161 
+00164   virtual bool isInBounds(std::vector<double> _v)
+00165   {
+00166     for (unsigned i=0; i<size(); i++)
+00167       if (! isInBounds(i, _v[i]))
+00168         return false;
+00169     return true;
+00170   }
+00171 
+00174   virtual double minimum(unsigned _i) {return (*this)[_i]->minimum();}
+00175   virtual double maximum(unsigned _i) {return (*this)[_i]->maximum();}
+00176   virtual double range(unsigned _i) {return (*this)[_i]->range();}
+00177 
+00181   virtual double averageRange() 
+00182   {
+00183     double r=0.0;
+00184     for (unsigned i=0; i<size(); i++)
+00185       r += range(i);
+00186     return r/size();
+00187   }
+00188 
+00192   virtual double uniform(unsigned _i, eoRng & _rng = eo::rng)
+00193   { 
+00194     double r= (*this)[_i]->uniform();
+00195     return r;
+00196   }
+00197 
+00201   void uniform(std::vector<double> & _v, eoRng & _rng = eo::rng)
+00202   {
+00203     _v.resize(size());
+00204     for (unsigned i=0; i<size(); i++)
+00205       {
+00206       _v[i] = uniform(i, _rng);
+00207       }
+00208   }  
+00209 
+00214   virtual void printOn(std::ostream& _os) const
+00215   {
+00216     for (unsigned i=0; i<size(); i++)
+00217       {
+00218         operator[](i)->printOn(_os);
+00219         _os << ";";
+00220       }
+00221   }
+00222 };
+00223 
+00225 
+00228 class eoRealVectorBounds : public eoRealBaseVectorBounds, public eoPersistent
+00229 {
+00230 public:
+00233   eoRealVectorBounds():eoRealBaseVectorBounds() {}
+00234 
+00237   eoRealVectorBounds(unsigned _dim, eoRealBounds & _bounds) : 
+00238     eoRealBaseVectorBounds(_dim, _bounds), factor(1,_dim), ownedBounds(0)
+00239   {}
+00240   
+00243   eoRealVectorBounds(eoRealBounds & _xbounds, eoRealBounds & _ybounds) : 
+00244     eoRealBaseVectorBounds(_xbounds, _ybounds), factor(2,1), ownedBounds(0)
+00245   {}
+00246   
+00249   eoRealVectorBounds(unsigned _dim, double _min, double _max) : 
+00250     eoRealBaseVectorBounds(), factor(1, _dim), ownedBounds(0)
+00251   {
+00252     if (_max-_min<=0)
+00253       throw std::logic_error("Void range in eoRealVectorBounds");
+00254     eoRealBounds *ptBounds = new eoRealInterval(_min, _max);
+00255     // handle memory once
+00256     ownedBounds.push_back(ptBounds);
+00257     // same bound for everyone
+00258     for (unsigned int i=0; i<_dim; i++)
+00259       push_back(ptBounds);
+00260   }
+00261 
+00264   eoRealVectorBounds(std::vector<double> _min, std::vector<double> _max) : 
+00265     factor(_min.size(), 1), ownedBounds(0)
+00266   {
+00267     if (_max.size() != _min.size())
+00268       throw std::logic_error("Dimensions don't match in eoRealVectorBounds");
+00269     // the bounds
+00270     eoRealBounds *ptBounds;
+00271     for (unsigned i=0; i<_min.size(); i++)
+00272       {
+00273         ptBounds = new eoRealInterval(_min[i], _max[i]);
+00274         ownedBounds.push_back(ptBounds);
+00275         push_back(ptBounds);
+00276       }
+00277   }
+00278 
+00282   eoRealVectorBounds(std::string _s) : eoRealBaseVectorBounds()
+00283   {
+00284     readFrom(_s);
+00285   }
+00286 
+00288   virtual ~eoRealVectorBounds()
+00289   {
+00290 //     std::cout << "Dtor, avec size = " << ownedBounds.size() << std::endl;
+00291 //     for (unsigned i = 0; i < ownedBounds.size(); ++i)
+00292 //     {
+00293 //         delete ownedBounds[i];
+00294 //     }
+00295 }
+00296 
+00297 
+00298   // methods from eoPersistent
+00304   virtual void readFrom(std::istream& _is) ;
+00305 
+00310   virtual void readFrom(std::string _s) ;
+00311 
+00313   virtual void printOn(std::ostream& _os) const
+00314   {
+00315     if (factor[0]>1)
+00316       _os << factor[0] ;
+00317     operator[](0)->printOn(_os);
+00318 
+00319     // other bounds
+00320     unsigned int index=factor[0];
+00321     if (factor.size()>1)
+00322       for (unsigned i=1; i<factor.size(); i++)
+00323         {
+00324           _os << ";";
+00325           if (factor[i] > 1)
+00326             _os << factor[i];
+00327           operator[](index)->printOn(_os);
+00328           index += factor[i];
+00329         }
+00330   }
+00331 
+00333   void adjust_size(unsigned _dim);
+00334 
+00337   eoRealVectorBounds(const eoRealVectorBounds &);
+00338 
+00339 private:// WARNING: there is no reason for both std::vector below 
+00340         //to be synchronized in any manner
+00341   std::vector<unsigned int> factor;        // std::list of nb of "grouped" bounds
+00342   std::vector<eoRealBounds *> ownedBounds; 
+00343 // keep this one private
+00344   eoRealVectorBounds& operator=(const eoRealVectorBounds&);
+00345   };
+00346 
+00348 
+00352 class eoRealVectorNoBounds: public eoRealVectorBounds
+00353 { 
+00354 public:
+00355   // virtual desctructor (to avoid warning?)
+00356   virtual ~eoRealVectorNoBounds(){}
+00357 
+00361   eoRealVectorNoBounds(unsigned _dim) : 
+00362     eoRealVectorBounds( (_dim?_dim:1), eoDummyRealNoBounds)
+00363   {}
+00364 
+00365   
+00366   virtual bool isBounded(unsigned)  {return false;}
+00367   virtual bool isBounded(void)   {return false;}
+00368 
+00369   virtual bool hasNoBoundAtAll(unsigned)  {return true;}
+00370   virtual bool hasNoBoundAtAll(void)  {return true;}
+00371 
+00372   virtual bool isMinBounded(unsigned)   {return false;}
+00373   virtual bool isMaxBounded(unsigned)   {return false;}
+00374 
+00375   virtual void foldsInBounds(unsigned, double &) {return;}
+00376   virtual void foldsInBounds(std::vector<double> &) {return;}
+00377 
+00378   virtual void truncate(unsigned, double &) {return;}
+00379   virtual void truncate(std::vector<double> &) {return;}
+00380 
+00381   virtual bool isInBounds(unsigned, double) {return true;}
+00382   virtual bool isInBounds(std::vector<double>) {return true;}
+00383 
+00384   // accessors  
+00385   virtual double minimum(unsigned)
+00386   {
+00387     throw std::logic_error("Trying to get minimum of eoRealVectorNoBounds");
+00388   }
+00389   virtual double maximum(unsigned)
+00390   {
+00391     throw std::logic_error("Trying to get maximum of eoRealVectorNoBounds");
+00392   }
+00393   virtual double range(unsigned)
+00394   {
+00395     throw std::logic_error("Trying to get range of eoRealVectorNoBounds");
+00396   }
+00397 
+00398   virtual double averageRange() 
+00399   {
+00400     throw std::logic_error("Trying to get average range of eoRealVectorNoBounds");
+00401   }
+00402 
+00403   // random generators
+00404   virtual double uniform(unsigned, eoRng & _rng = eo::rng)
+00405   {
+00406     throw std::logic_error("No uniform distribution on eoRealVectorNoBounds");
+00407   }
+00408 
+00409   // fills a std::vector with uniformly chosen variables in bounds
+00410   void uniform(std::vector<double> &, eoRng & _rng = eo::rng)
+00411   {
+00412     throw std::logic_error("No uniform distribution on eoRealVectorNoBounds");
+00413   }
+00414 
+00415 };
+00416 
+00417 
+00418 
+00419 // one object for all - see eoRealBounds.cpp
+00420 extern eoRealVectorNoBounds eoDummyVectorNoBounds;
+00421 #endif
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_reduce_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_reduce_8h-source.html new file mode 100644 index 000000000..b37019779 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_reduce_8h-source.html @@ -0,0 +1,280 @@ + + +EO: eoReduce.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoReduce.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoReduce.h
+00005 //   Base class for population-merging classes
+00006 // (c) GeNeura Team, 1998
+00007 /* 
+00008    This library is free software; you can redistribute it and/or
+00009    modify it under the terms of the GNU Lesser General Public
+00010    License as published by the Free Software Foundation; either
+00011    version 2 of the License, or (at your option) any later version.
+00012 
+00013    This library is distributed in the hope that it will be useful,
+00014    but WITHOUT ANY WARRANTY; without even the implied warranty of
+00015    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00016    Lesser General Public License for more details.
+00017 
+00018    You should have received a copy of the GNU Lesser General Public
+00019    License along with this library; if not, write to the Free Software
+00020    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00021 
+00022    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef eoReduce_h
+00027 #define eoReduce_h
+00028 
+00029 //-----------------------------------------------------------------------------
+00030 
+00031 #include <iostream>
+00032 
+00033 // EO includes
+00034 #include <eoPop.h>     // eoPop
+00035 #include <eoFunctor.h>  // eoReduce
+00036 #include <utils/selectors.h>
+00037 
+00045 template<class EOT> class eoReduce: public eoBF<eoPop<EOT>&, unsigned, void>
+00046 {};
+00047 
+00049 template <class EOT> class eoTruncate : public eoReduce<EOT>
+00050 {
+00051     void operator()(eoPop<EOT>& _newgen, unsigned _newsize)
+00052     {
+00053         if (_newgen.size() == _newsize)
+00054             return;
+00055         if (_newgen.size() < _newsize)
+00056           throw std::logic_error("eoTruncate: Cannot truncate to a larger size!\n");
+00057 
+00058         _newgen.nth_element(_newsize);
+00059         _newgen.resize(_newsize);
+00060     }
+00061 };
+00062 
+00064 template <class EOT> class eoRandomReduce : public eoReduce<EOT>
+00065 {
+00066     void operator()(eoPop<EOT>& _newgen, unsigned _newsize)
+00067     {
+00068         if (_newgen.size() == _newsize)
+00069             return;
+00070         if (_newgen.size() < _newsize)
+00071           throw std::logic_error("eoRandomReduce: Cannot truncate to a larger size!\n");
+00072 
+00073         // shuffle the population, then trucate
+00074         _newgen.shuffle();
+00075         _newgen.resize(_newsize);
+00076     }
+00077 };
+00078 
+00083 template <class EOT> class eoEPReduce : public eoReduce<EOT>
+00084 {
+00085 public:
+00086 typedef typename EOT::Fitness Fitness; 
+00087 
+00088   eoEPReduce(unsigned _t_size  ):
+00089     t_size(_t_size)
+00090   {
+00091     if (t_size < 2)
+00092       { 
+00093         std::cout << "Warning: EP tournament size should be >= 2. Adjusted" << std::endl;
+00094         t_size = 2;
+00095       }
+00096   }
+00097 
+00099   // compares the scores
+00100   // uses the fitness if scores are equals ????
+00101   typedef std::pair<float, typename eoPop<EOT>::iterator>  EPpair;
+00102   struct Cmp {
+00103     bool operator()(const EPpair a, const EPpair b) const
+00104     { 
+00105       if (b.first == a.first)
+00106         return  (*b.second < *a.second);
+00107       return b.first < a.first; 
+00108     }
+00109   };
+00110   
+00111   
+00112   void operator()(eoPop<EOT>& _newgen, unsigned _newsize)
+00113   {
+00114     unsigned int presentSize = _newgen.size();
+00115     
+00116     if (presentSize == _newsize)
+00117             return;
+00118         if (presentSize < _newsize)
+00119           throw std::logic_error("eoTruncate: Cannot truncate to a larger size!\n");
+00120         std::vector<EPpair> scores(presentSize);
+00121         for (unsigned i=0; i<presentSize; i++)
+00122           {
+00123             scores[i].second = _newgen.begin()+i;
+00124             Fitness fit = _newgen[i].fitness();
+00125             for (unsigned itourn = 0; itourn < t_size; ++itourn)
+00126               {
+00127                 const EOT & competitor = _newgen[rng.random(presentSize)];
+00128                 if (fit > competitor.fitness())
+00129                   scores[i].first += 1;
+00130                 else if (fit == competitor.fitness())
+00131                   scores[i].first += 0.5;
+00132               }
+00133           }
+00134 
+00135         // now we have the scores
+00136         typename std::vector<EPpair>::iterator it = scores.begin() + _newsize;
+00137         std::nth_element(scores.begin(), it, scores.end(), Cmp());
+00138         // sort(scores.begin(), scores.end(), Cmp());
+00139         unsigned j;
+00140 //      std::cout << "Les scores apres tri\n";
+00141 //      for (j=0; j<scores.size(); j++)
+00142 //        {
+00143 //          std::cout << scores[j].first << " " << *scores[j].second << std::endl;
+00144 //        }
+00145         eoPop<EOT> tmPop;
+00146         for (j=0; j<_newsize; j++)
+00147           {
+00148             tmPop.push_back(*scores[j].second);
+00149           }
+00150         _newgen.swap(tmPop);
+00151         // erase does not work, but I'm sure there is a way in STL to mark
+00152         // and later delete all inside a std::vector ??????
+00153         // this would avoid all copies here
+00154 
+00155 //      it = scores.begin() + _newsize;
+00156 //      while (it < scores.end())
+00157 //        _newgen.erase(it->second);
+00158     }
+00159 private:
+00160   unsigned t_size;
+00161 };
+00162 
+00166 template <class EOT> 
+00167 class eoLinearTruncate : public eoReduce<EOT>
+00168 {
+00169   void operator()(eoPop<EOT>& _newgen, unsigned _newsize)
+00170   {
+00171     unsigned oldSize = _newgen.size();
+00172     if (oldSize == _newsize)
+00173       return;
+00174     if (oldSize < _newsize)
+00175       throw std::logic_error("eoLinearTruncate: Cannot truncate to a larger size!\n");
+00176     for (unsigned i=0; i<oldSize - _newsize; i++)
+00177       {
+00178         typename eoPop<EOT>::iterator it = _newgen.it_worse_element();
+00179         _newgen.erase(it);          
+00180       }
+00181   }
+00182 };
+00183 
+00187 template <class EOT> 
+00188 class eoDetTournamentTruncate : public eoReduce<EOT>
+00189 {
+00190 public:
+00191   eoDetTournamentTruncate(unsigned _t_size):
+00192     t_size(_t_size)
+00193   {
+00194     if (t_size < 2)
+00195       { 
+00196         std::cout << "Warning, Size for eoDetTournamentTruncate adjusted to 2\n";
+00197         t_size = 2;
+00198       }
+00199   }
+00200 
+00201   void operator()(eoPop<EOT>& _newgen, unsigned _newsize)
+00202   {
+00203     unsigned oldSize = _newgen.size();
+00204     if (_newsize == 0)
+00205       {
+00206         _newgen.resize(0);
+00207         return;
+00208       }
+00209     if (oldSize == _newsize)
+00210       return;
+00211     if (oldSize < _newsize)
+00212       throw std::logic_error("eoDetTournamentTruncate: Cannot truncate to a larger size!\n");
+00213 
+00214     // Now OK to erase some losers
+00215     for (unsigned i=0; i<oldSize - _newsize; i++)
+00216       {
+00217         //OLDCODE EOT & eo = inverse_deterministic_tournament<EOT>(_newgen, t_size);
+00218         //OLDCODE _newgen.erase(&eo);
+00219         
+00220         // Jeroen Eggermont stdc++v3  patch
+00221         // in the new code from stdc++v3 an iterator from a container<T> is no longer an pointer to T
+00222         // Because eo already contained a fuction using eoPop<EOT>::iterator's we will use the following
+00223         
+00224         _newgen.erase( inverse_deterministic_tournament(_newgen.begin(), _newgen.end(), t_size) );
+00225         
+00226       }
+00227   }
+00228 private:
+00229   unsigned t_size;
+00230 };
+00231 
+00235 template <class EOT> 
+00236 class eoStochTournamentTruncate : public eoReduce<EOT>
+00237 {
+00238 public:
+00239   eoStochTournamentTruncate(double _t_rate):
+00240     t_rate(_t_rate)
+00241   {
+00242     if (t_rate <= 0.5)
+00243       { 
+00244         std::cout << "Warning, Rate for eoStochTournamentTruncate adjusted to 0.51\n";
+00245         t_rate = 0.51;
+00246       }
+00247     if (t_rate > 1)
+00248       {
+00249         std::cout << "Warning, Rate for eoStochTournamentTruncate adjusted to 1\n";
+00250         t_rate = 1;
+00251       }
+00252   }
+00253 
+00254   void operator()(eoPop<EOT>& _newgen, unsigned _newsize)
+00255   {
+00256     unsigned oldSize = _newgen.size();
+00257     if (_newsize == 0)
+00258       {
+00259         _newgen.resize(0);
+00260         return;
+00261       }
+00262     if (oldSize == _newsize)
+00263       return;
+00264     if (oldSize < _newsize)
+00265       throw std::logic_error("eoStochTournamentTruncate: Cannot truncate to a larger size!\n");
+00266     // Now OK to erase some losers
+00267     for (unsigned i=0; i<oldSize - _newsize; i++)
+00268       {
+00269         //OLDCODE EOT & eo = inverse_stochastic_tournament<EOT>(_newgen, t_rate);
+00270         //OLDCODE _newgen.erase(&eo);
+00271         
+00272         // Jeroen Eggermont stdc++v3  patch
+00273         // in the new code from stdc++v3 an iterator from a container<T> is no longer an pointer to T
+00274         // Because eo already contained a fuction using eoPop<EOT>::iterator's we will use the following
+00275         
+00276         _newgen.erase( inverse_stochastic_tournament(_newgen.begin(), _newgen.end(), t_rate) );
+00277         
+00278         
+00279       }
+00280   }
+00281 
+00282 private:
+00283   double t_rate;
+00284 };
+00285 
+00286 //-----------------------------------------------------------------------------
+00287 
+00288 #endif
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_reduce_merge_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_reduce_merge_8h-source.html new file mode 100644 index 000000000..da9f0cd7b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_reduce_merge_8h-source.html @@ -0,0 +1,89 @@ + + +EO: eoReduceMerge.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoReduceMerge.h

00001 
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoReduceMerge_h
+00028 #define _eoReduceMerge_h
+00029 
+00030 
+00031 //-----------------------------------------------------------------------------
+00032 #include <eoPop.h>
+00033 #include <eoFunctor.h>
+00034 #include <eoMerge.h>
+00035 #include <eoReduce.h>
+00036 #include <eoReplacement.h>
+00037 #include <utils/eoHowMany.h>
+00038 //-----------------------------------------------------------------------------
+00039 
+00040 
+00052 template <class EOT>
+00053 class eoReduceMerge : public eoReplacement<EOT>
+00054 {
+00055     public:
+00056         eoReduceMerge(eoReduce<EOT>& _reduce, eoMerge<EOT>& _merge) :
+00057         reduce(_reduce), merge(_merge)
+00058         {}
+00059 
+00060         void operator()(eoPop<EOT>& _parents, eoPop<EOT>& _offspring)
+00061         {
+00062           if (_parents.size() < _offspring.size())
+00063             throw std::logic_error("eoReduceMerge: More offspring than parents!\n");
+00064           reduce(_parents, _parents.size() - _offspring.size()); 
+00065           merge(_offspring, _parents);
+00066         }
+00067 
+00068     private :
+00069         eoReduce<EOT>& reduce;
+00070         eoMerge<EOT>& merge;
+00071 };
+00072 
+00076 template <class EOT> 
+00077 class eoSSGAWorseReplacement : public eoReduceMerge<EOT>
+00078 {
+00079     public :
+00080         eoSSGAWorseReplacement() : eoReduceMerge<EOT>(truncate, plus) {}
+00081 
+00082     private :
+00083         eoLinearTruncate<EOT> truncate;
+00084         eoPlus<EOT> plus;
+00085 };
+00086 
+00090 template <class EOT> 
+00091 class eoSSGADetTournamentReplacement : public eoReduceMerge<EOT>
+00092 {
+00093     public :
+00094         eoSSGADetTournamentReplacement(unsigned _t_size) : 
+00095           eoReduceMerge<EOT>(truncate, plus), truncate(_t_size) {}
+00096 
+00097     private :
+00098         eoDetTournamentTruncate<EOT> truncate;
+00099         eoPlus<EOT> plus;
+00100 };
+00101 
+00107 template <class EOT> 
+00108 class eoSSGAStochTournamentReplacement : public eoReduceMerge<EOT>
+00109 {
+00110     public :
+00111         eoSSGAStochTournamentReplacement(double _t_rate) : 
+00112           eoReduceMerge<EOT>(truncate, plus), truncate(_t_rate) {}
+00113 
+00114     private :
+00115         eoStochTournamentTruncate<EOT> truncate;
+00116         eoPlus<EOT> plus;
+00117 };
+00118 
+00119 #endif
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_reduce_merge_reduce_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_reduce_merge_reduce_8h-source.html new file mode 100644 index 000000000..7cf06ea9c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_reduce_merge_reduce_8h-source.html @@ -0,0 +1,126 @@ + + +EO: eoReduceMergeReduce.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoReduceMergeReduce.h

00001 
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _eoReduceMergeReduce_h
+00027 #define _eoReduceMergeReduce_h
+00028 
+00029 
+00030 //-----------------------------------------------------------------------------
+00031 #include <eoPop.h>
+00032 #include <eoFunctor.h>
+00033 #include <eoMerge.h>
+00034 #include <eoReduce.h>
+00035 #include <utils/eoHowMany.h>
+00036 //-----------------------------------------------------------------------------
+00037 
+00048 template <class EOT>
+00049 class eoReduceMergeReduce : public eoReplacement<EOT>
+00050 {
+00051 public:
+00052   eoReduceMergeReduce(eoHowMany _howManyElite, 
+00053                       bool _strongElitism, 
+00054                       eoHowMany _howManyReducedParents,
+00055                       eoReduce<EOT> & _reduceParents,
+00056                       eoHowMany _howManyReducedOffspring, 
+00057                       eoReduce<EOT> & _reduceOffspring,
+00058                       eoReduce<EOT> & _reduceFinal) :
+00059     howManyElite(_howManyElite),
+00060     strongElitism(_strongElitism),
+00061     howManyReducedParents(_howManyReducedParents),
+00062     howManyReducedOffspring (_howManyReducedOffspring),
+00063     reduceParents(_reduceParents),
+00064     reduceOffspring(_reduceOffspring),
+00065     reduceFinal(_reduceFinal)
+00066   {}
+00067     
+00068     void operator()(eoPop<EOT> & _parents, eoPop<EOT> & _offspring)
+00069     {
+00070       eoPop<EOT> temp;
+00071       unsigned int finalPopSize = _parents.size();
+00072       unsigned int offSize = _offspring.size();
+00073 
+00074       unsigned int elite = howManyElite(finalPopSize);
+00075       if (elite)                   // some parents MUST be saved somewhere
+00076         {
+00077           temp.resize(elite);
+00078           _parents.nth_element(elite);
+00079           std::copy(_parents.begin(), _parents.begin()+elite, temp.begin());
+00080           _parents.erase(_parents.begin(), _parents.begin()+elite);
+00081         }
+00082 
+00083       // the reduce steps. First the parents
+00084       unsigned reducedParentSize = howManyReducedParents(_parents.size());
+00085       if (!reducedParentSize)
+00086         _parents.clear();
+00087       else if (reducedParentSize != _parents.size())
+00088         reduceParents(_parents, reducedParentSize);
+00089 
+00090       // then the offspring
+00091       unsigned reducedOffspringSize = howManyReducedOffspring(offSize);
+00092       if (!reducedOffspringSize)
+00093         throw std::runtime_error("No offspring left after reduction!");
+00094       if (reducedOffspringSize != offSize) // need reduction
+00095         reduceOffspring(_offspring, reducedOffspringSize);
+00096 
+00097       // now merge reduced populations
+00098       _parents.resize(reducedParentSize + _offspring.size());
+00099       std::copy(_offspring.begin(), _offspring.end(), 
+00100                 _parents.begin()+reducedParentSize); 
+00101 
+00102       // reduce the resulting population
+00103       // size depstd::ends on elitism
+00104       if (elite && strongElitism)
+00105         {
+00106           if (_parents.size() != finalPopSize-elite)
+00107             reduceFinal(_parents, finalPopSize-elite);
+00108           // and put back the elite
+00109           unsigned oldPSize = _parents.size();
+00110           _parents.resize(_parents.size()+elite);
+00111           std::copy(temp.begin(), temp.end(), _parents.begin()+oldPSize);
+00112         }
+00113       else      
+00114         {                   // only reduce final pop to right size
+00115           if (_parents.size() != finalPopSize)
+00116             reduceFinal(_parents, finalPopSize);
+00117           if (elite)       // then treat weak elitism
+00118             {
+00119               unsigned toSave = 0;
+00120               _parents.sort();
+00121               EOT & eoLimit = _parents[elite-1];
+00122               unsigned index=0;
+00123               while ( (temp[index++] > eoLimit) && (index < temp.size()) )
+00124                 toSave++;
+00125               if (toSave)
+00126                 for (unsigned i=0; i<toSave; i++)
+00127                   _parents[finalPopSize-1-i] = temp[i];
+00128             }
+00129         }
+00130     }
+00131 
+00132 private:
+00133   eoHowMany howManyElite;          // if 0, no elitism at all
+00134   bool strongElitism;              // if false -> weak estd::listism
+00135   eoHowMany howManyReducedParents; // if 0, no parent in final replacement
+00136   eoHowMany howManyReducedOffspring; // if 0, std::runtime_error
+00137   // the reducers
+00138   eoReduce<EOT> & reduceParents;
+00139   eoReduce<EOT> & reduceOffspring;
+00140   eoReduce<EOT> & reduceFinal;
+00141 };
+00142 
+00143 #endif
+
Generated on Thu Oct 19 05:06:37 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_reduce_split_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_reduce_split_8h-source.html new file mode 100644 index 000000000..c71c4cd54 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_reduce_split_8h-source.html @@ -0,0 +1,298 @@ + + +EO: eoReduceSplit.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoReduceSplit.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoReduceSplit.h
+00005 //   Base class for population-reducing classes - retaining the poor losers
+00006 // (c) GeNeura Team, 1998, Marc Schoenauer, 2002
+00007 /* 
+00008    This library is free software; you can redistribute it and/or
+00009    modify it under the terms of the GNU Lesser General Public
+00010    License as published by the Free Software Foundation; either
+00011    version 2 of the License, or (at your option) any later version.
+00012 
+00013    This library is distributed in the hope that it will be useful,
+00014    but WITHOUT ANY WARRANTY; without even the implied warranty of
+00015    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00016    Lesser General Public License for more details.
+00017 
+00018    You should have received a copy of the GNU Lesser General Public
+00019    License along with this library; if not, write to the Free Software
+00020    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00021 
+00022    Contact: Marc.Schoenauer@inria.fr
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef eoReduceSplit_h
+00027 #define eoReduceSplit_h
+00028 
+00029 //-----------------------------------------------------------------------------
+00030 
+00031 #include <iostream>
+00032 
+00033 // EO includes
+00034 #include <eoPop.h>     // eoPop
+00035 #include <eoFunctor.h>  // eoReduce
+00036 #include <utils/selectors.h>
+00037 
+00042 template<class EOT> class eoReduceSplit: public eoBF<eoPop<EOT>&, eoPop<EOT> &, void >
+00043 {};
+00044 
+00046 template <class EOT> 
+00047 class eoTruncateSplit : public eoReduceSplit<EOT>
+00048 {
+00049 public:
+00053   eoTruncateSplit(eoHowMany _howMany, bool _returnEliminated = false):
+00054     howMany(_howMany), returnEliminated(_returnEliminated) {}
+00055     
+00057   void operator()(eoPop<EOT>& _newgen, eoPop<EOT> & _eliminated)
+00058   {
+00059     unsigned popSize = _newgen.size();
+00060     unsigned eliminated = howMany(popSize);
+00061     if (!eliminated)   // nothing to do
+00062       return ;
+00063     unsigned newsize = popSize - eliminated;
+00064     if (newsize < 0)
+00065       throw std::logic_error("eoTruncateSplit: Cannot truncate to a larger size!\n");
+00066     
+00067     _newgen.nth_element(newsize);
+00068 
+00069     // save poor losers if necessary
+00070     if (returnEliminated)
+00071       for (unsigned i=0; i<eliminated; i++)
+00072         _eliminated.push_back(_newgen[newsize+i]);
+00073     // truncate
+00074     _newgen.resize(newsize);
+00075     return ;
+00076   }
+00077 
+00078 private:
+00079   eoHowMany howMany;
+00080   bool returnEliminated;
+00081 };
+00082 
+00086 template <class EOT> 
+00087 class eoLinearTruncateSplit : public eoReduceSplit<EOT>
+00088 {
+00089 public:
+00093   eoLinearTruncateSplit(eoHowMany _howMany, bool _returnEliminated = false):
+00094     howMany(_howMany), returnEliminated(_returnEliminated) {}
+00095     
+00097   void operator()(eoPop<EOT>& _newgen, eoPop<EOT> & _eliminated)
+00098   {
+00099     unsigned popSize = _newgen.size();
+00100     unsigned eliminated = howMany(popSize);
+00101     if (!eliminated)   // nothing to do
+00102       return ;
+00103     unsigned newsize = popSize - eliminated;
+00104     if (newsize < 0)
+00105       throw std::logic_error("eoLinearTruncateSplit: Cannot truncate to a larger size!\n");
+00106 
+00107     _eliminated.reserve(_eliminated.size()+eliminated); //in case not empty?
+00108     for (unsigned i=0; i<eliminated; i++)
+00109       {
+00110         typename eoPop<EOT>::iterator it = _newgen.it_worse_element();
+00111         if (returnEliminated)
+00112           _eliminated.push_back(*it);
+00113         _newgen.erase(it);          
+00114       }
+00115   }
+00116 
+00117 private:
+00118   eoHowMany howMany;
+00119   bool returnEliminated;
+00120 };
+00121 
+00123 template <class EOT> 
+00124 class eoRandomSplit : public eoReduceSplit<EOT>
+00125 {
+00126 public:
+00130   eoRandomSplit(eoHowMany _howMany, bool _returnEliminated = false):
+00131     howMany(_howMany), returnEliminated(_returnEliminated) {}
+00132     
+00134   void operator()(eoPop<EOT>& _newgen, eoPop<EOT> & _eliminated)
+00135   {
+00136     unsigned popSize = _newgen.size();
+00137     unsigned eliminated = howMany(popSize);
+00138     if (!eliminated)   // nothing to do
+00139       return ;
+00140     unsigned newsize = popSize - eliminated;
+00141     if (newsize < 0)
+00142       throw std::logic_error("eoRandomSplit: Cannot truncate to a larger size!\n");
+00143 
+00144     _newgen.shuffle();
+00145 
+00146     // save poor losers if necessary
+00147     if (returnEliminated)
+00148       for (unsigned i=0; i<eliminated; i++)
+00149         _eliminated.push_back(_newgen[newsize+i]);
+00150     // truncate
+00151     _newgen.resize(newsize);
+00152     return ;
+00153   }
+00154 
+00155 private:
+00156   eoHowMany howMany;
+00157   bool returnEliminated;
+00158 };
+00159 
+00160 
+00162 template <class EOT> 
+00163 class eoLinearRandomSplit : public eoReduceSplit<EOT>
+00164 {
+00165 public:
+00169   eoLinearRandomSplit(eoHowMany _howMany, bool _returnEliminated = false):
+00170     howMany(_howMany), returnEliminated(_returnEliminated) {}
+00171     
+00173   void operator()(eoPop<EOT>& _newgen, eoPop<EOT> & _eliminated)
+00174   {
+00175     unsigned popSize = _newgen.size();
+00176     unsigned eliminated = howMany(popSize);
+00177     if (!eliminated)   // nothing to do
+00178       return ;
+00179     unsigned newsize = popSize - eliminated;
+00180     if (newsize < 0)
+00181       throw std::logic_error("eoLinearRandomSplit: Cannot truncate to a larger size!\n");
+00182 
+00183     _eliminated.reserve(_eliminated.size()+eliminated); //in case not empty?
+00184     for (unsigned i=0; i<eliminated; i++)
+00185       {
+00186         unsigned loser=random(_newgen.size());
+00187         typename eoPop<EOT>::iterator it = _newgen.begin()+loser;
+00188         if (returnEliminated)
+00189           _eliminated.push_back(*it);
+00190         _newgen.erase(it);          
+00191       }
+00192     return ;
+00193   }
+00194 
+00195 private:
+00196   eoHowMany howMany;
+00197   bool returnEliminated;
+00198 };
+00199 
+00200 
+00204 template <class EOT> 
+00205 class eoDetTournamentTruncateSplit : public eoReduceSplit<EOT>
+00206 {
+00207 public:
+00211   eoDetTournamentTruncateSplit(unsigned _t_size, eoHowMany _howMany, 
+00212                       bool _returnEliminated = false):
+00213     t_size(_t_size), howMany(_howMany), 
+00214     returnEliminated(_returnEliminated) 
+00215   {
+00216     if (t_size < 2)
+00217       { 
+00218         std::cout << "Warning, Size for eoDetTournamentTruncateSplit adjusted to 2\n";
+00219         t_size = 2;
+00220       }
+00221   }
+00222 
+00224   void operator()(eoPop<EOT>& _newgen, eoPop<EOT> & _eliminated)
+00225   // BUG???  void operator()(eoPop<EOT>& _newgen, unsigned _newsize)
+00226   {
+00227     unsigned popSize = _newgen.size();
+00228     unsigned eliminated = howMany(popSize);
+00229     if (!eliminated)   // nothing to do
+00230       return ;
+00231     unsigned newsize = popSize - eliminated;
+00232     if (newsize < 0)
+00233       throw std::logic_error("eoDetTournamentTruncateSplit: Cannot truncate to a larger size!\n");
+00234 
+00235 
+00236     _eliminated.reserve(_eliminated.size()+eliminated); //in case not empty?
+00237     for (unsigned i=0; i<eliminated; i++)
+00238       {
+00239         typename eoPop<EOT>::iterator it = inverse_deterministic_tournament(_newgen.begin(), _newgen.end(), t_size);
+00240         if (returnEliminated)
+00241           _eliminated.push_back(*it);
+00242         _newgen.erase(it);
+00243       }
+00244   }
+00245 
+00246 private:
+00247   unsigned t_size;
+00248   eoHowMany howMany;
+00249   bool returnEliminated;
+00250 };
+00251 
+00255 template <class EOT> 
+00256 class eoStochTournamentTruncateSplit : public eoReduce<EOT>
+00257 {
+00258 public:
+00262   eoStochTournamentTruncateSplit(double _t_rate, eoHowMany _howMany, 
+00263                       bool _returnEliminated = false):
+00264     t_rate(_t_rate), howMany(_howMany), 
+00265     returnEliminated(_returnEliminated) 
+00266   {
+00267     if (t_rate <= 0.5)
+00268       { 
+00269         std::cout << "Warning, Rate for eoStochTournamentTruncateSplit adjusted to 0.51\n";
+00270         t_rate = 0.51;
+00271       }
+00272     if (t_rate > 1)
+00273       {
+00274         std::cout << "Warning, Rate for eoStochTournamentTruncateSplit adjusted to 1\n";
+00275         t_rate = 1;
+00276       }
+00277   }
+00278 
+00280   void operator()(eoPop<EOT>& _newgen, eoPop<EOT> & _eliminated)
+00281   //BUG???  void operator()(eoPop<EOT>& _newgen, unsigned _newsize)
+00282   {
+00283     /* old version
+00284     if (!_eliminated.size())       // nothing to do
+00285       return;
+00286     unsigned oldSize = _newgen.size();
+00287     unsigned newSize = oldSize - _eliminated.size();
+00288     unsigned eliminated = howMany(popSize);
+00289     if (newSize < 0)
+00290       throw std::logic_error("eoStochTournamentTruncateSplit: Cannot truncate to a larger size!\n");
+00291 
+00292 end of old version    */
+00293 
+00294     unsigned popSize = _newgen.size();
+00295     unsigned eliminated = howMany(popSize);
+00296     if (!eliminated)   // nothing to do
+00297       return ;
+00298     unsigned newsize = popSize - eliminated;
+00299     if (newsize < 0)
+00300       throw std::logic_error("eoDetTournamentTruncateSplit: Cannot truncate to a larger size!\n");
+00301 
+00302 
+00303 
+00304     _eliminated.reserve(_eliminated.size()+eliminated); //in case not empty?
+00305     for (unsigned i=0; i<_eliminated.size(); i++)
+00306       {
+00307         typename eoPop<EOT>::iterator it = inverse_stochastic_tournament(_newgen.begin(), _newgen.end(), t_rate);
+00308         if (returnEliminated)
+00309           _eliminated.push_back(*it);
+00310         _newgen.erase(it);
+00311       }
+00312   }
+00313 
+00314 
+00315 private:
+00316   double t_rate;
+00317   eoHowMany howMany;
+00318   bool returnEliminated;
+00319 };
+00320 
+00321 //-----------------------------------------------------------------------------
+00322 
+00323 #endif
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_replacement_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_replacement_8h-source.html new file mode 100644 index 000000000..d6c8510b0 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_replacement_8h-source.html @@ -0,0 +1,71 @@ + + +EO: eoReplacement.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoReplacement.h

00001 
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoReplacement_h
+00028 #define _eoReplacement_h
+00029 
+00030 
+00031 //-----------------------------------------------------------------------------
+00032 #include <eoPop.h>
+00033 #include <eoFunctor.h>
+00034 #include <eoMerge.h>
+00035 #include <eoReduce.h>
+00036 #include <utils/eoHowMany.h>
+00037 //-----------------------------------------------------------------------------
+00038 
+00074 
+00076 template<class EOT>
+00077 class eoReplacement : public eoBF<eoPop<EOT>&, eoPop<EOT>&, void>
+00078 {};
+00079 
+00083 template <class EOT>
+00084 class eoGenerationalReplacement : public eoReplacement<EOT>
+00085 {
+00086     public :
+00088   void operator()(eoPop<EOT>& _parents, eoPop<EOT>& _offspring)
+00089   {
+00090     _parents.swap(_offspring);
+00091   }
+00092 };
+00093 
+00101 template <class EOT>
+00102 class eoWeakElitistReplacement : public eoReplacement<EOT>
+00103 {
+00104 public :
+00105   typedef typename EOT::Fitness Fitness;
+00106 
+00107   // Ctor, takes an eoReplacement
+00108   eoWeakElitistReplacement(eoReplacement<EOT> & _replace) :
+00109     replace(_replace) {}
+00110 
+00112   void operator()(eoPop<EOT>& _pop, eoPop<EOT>& _offspring)
+00113   {
+00114     const EOT & oldChamp = _pop.best_element();
+00115     replace(_pop, _offspring);     // "normal" replacement, parents are the new
+00116     if (_pop.best_element() < oldChamp) // need to do something
+00117       {
+00118         typename eoPop<EOT>::iterator itPoorGuy = _pop.it_worse_element();
+00119         (*itPoorGuy) = oldChamp;
+00120       }
+00121   }
+00122 private:
+00123   eoReplacement<EOT> & replace;
+00124 };
+00125 
+00127 
+00128 #endif
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_rnd_generators_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_rnd_generators_8h-source.html new file mode 100644 index 000000000..144d79972 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_rnd_generators_8h-source.html @@ -0,0 +1,123 @@ + + +EO: eoRndGenerators.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoRndGenerators.h

00001 /* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003   -----------------------------------------------------------------------------
+00004   eoRndGenerators.h
+00005 
+00006   mimics the rnd_generator.h by putting the generators in the EO-hierarchy
+00007 
+00008  (c) Maarten Keijzer (mak@dhi.dk) and GeNeura Team, 1999, 2000
+00009 
+00010     This library is free software; you can redistribute it and/or
+00011     modify it under the terms of the GNU Lesser General Public
+00012     License as published by the Free Software Foundation; either
+00013     version 2 of the License, or (at your option) any later version.
+00014 
+00015     This library is distributed in the hope that it will be useful,
+00016     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00017     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00018     Lesser General Public License for more details.
+00019 
+00020     You should have received a copy of the GNU Lesser General Public
+00021     License along with this library; if not, write to the Free Software
+00022     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00023 
+00024     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00025  */
+00026 
+00027 //-----------------------------------------------------------------------------
+00028 
+00029 #ifndef eoRndGenerators_h
+00030 #define eoRndGenerators_h
+00031 
+00032 #include "eoRNG.h"
+00033 #include <eoFunctor.h>
+00034 #include <stdexcept>
+00035 
+00036 using eo::rng;
+00037 
+00046 template <class T>
+00047 class eoRndGenerator : public eoF<T>
+00048 {
+00049   typedef T AtomType;
+00050 };
+00051 
+00066 template <class T = double> class eoUniformGenerator : public eoRndGenerator<T>
+00067 {
+00068   // added new ctor with 2 params, and modified the data to minim and range
+00069   // (was maxim only). MS 3/11/2000
+00070   public :
+00071     eoUniformGenerator(T _max = T(1.0), eoRng& _rng = rng) :
+00072       minim(T(0.0)), range(_max), uniform(_rng) {}
+00073     eoUniformGenerator(T _min, T _max, eoRng& _rng = rng) :
+00074       minim(_min), range(_max-_min), uniform(_rng)
+00075   {
+00076     if (_min>_max)
+00077       throw std::logic_error("Min is greater than Max in uniform_generator");
+00078   }
+00079 
+00084   T operator()(void) { return minim+static_cast<T>(uniform.uniform(range)); }
+00085 
+00086 private :
+00087   T minim;
+00088   T range;
+00089   eoRng& uniform;
+00090 };
+00091 
+00092 
+00094 template <>
+00095 inline bool eoUniformGenerator<bool>::operator()(void)
+00096 {
+00097     return uniform.flip(0.5);
+00098 }
+00099 
+00104 class eoBooleanGenerator : public eoRndGenerator<bool>
+00105 {
+00106   public :
+00107   eoBooleanGenerator(float _bias = 0.5, eoRng& _rng = rng) : bias(_bias), gen(_rng) {}
+00108 
+00109   bool operator()(void) { return gen.flip(bias); }
+00110   private :
+00111   float bias;
+00112   eoRng& gen;
+00113 };
+00114 
+00120 template <class T = double> class eoNormalGenerator : public eoRndGenerator<T>
+00121 {
+00122   public :
+00123     eoNormalGenerator(T _stdev = T(1.0), eoRng& _rng = rng) : stdev(_stdev), normal(_rng) {}
+00124 
+00125   T operator()(void) { return (T) normal.normal(stdev); }
+00126 
+00127   private :
+00128     T stdev;
+00129   eoRng& normal;
+00130 };
+00131 
+00137 template <class T = double> class eoNegExpGenerator : public eoRndGenerator<T>
+00138 {
+00139   public :
+00140     eoNegExpGenerator(T _mean = 1.0, eoRng& _rng = rng) : mean(_mean), negexp(_rng) {}
+00141 
+00142   T operator()(void) { return (T) negexp.negexp(mean); }
+00143 
+00144   private :
+00145     T mean;
+00146   eoRng& negexp;
+00147 };
+00148 
+00149 #endif
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_s_b_xcross_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_s_b_xcross_8h-source.html new file mode 100644 index 000000000..92ec5facc --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_s_b_xcross_8h-source.html @@ -0,0 +1,127 @@ + + +EO: eoSBXcross.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

eoSBXcross.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoSBXcross.h
+00005 // (c) Maarten Keijzer 2000 - Marc Schoenauer 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: Marc.Schoenauer@polytechnique.fr
+00022              mak@dhi.dk
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #include <algorithm>    // swap_ranges
+00027 #include <utils/eoParser.h>
+00028 #include <utils/eoRNG.h>
+00029 #include <es/eoReal.h>
+00030 #include <utils/eoRealBounds.h>
+00031 #include <utils/eoRealVectorBounds.h>
+00032 
+00033 
+00034 
+00035 template<class EOT> class eoSBXCrossover: public eoQuadOp<EOT>
+00036 {
+00037  public:
+00038   /****
+00039    * (Default) Constructor.
+00040    * The bounds are initialized with the global object that says: no bounds.
+00041    *
+00042    * 
+00043    */
+00044     eoSBXCrossover(const double& _eta = 1.0) :
+00045     bounds(eoDummyVectorNoBounds), eta(_eta), range(1) {}
+00046 
+00047 
+00049 
+00061      eoSBXCrossover(eoRealVectorBounds & _bounds, 
+00062                      const double& _eta = 1.0) : 
+00063      bounds(_bounds), eta(_eta), range(1) {}
+00064 
+00066 
+00068 
+00075      eoSBXCrossover(eoParser & _parser) : 
+00076     // First, decide whether the objective variables are bounded
+00077     // Warning, must be the same keywords than other possible objectBounds elsewhere
+00078        bounds (_parser.getORcreateParam(eoDummyVectorNoBounds, "objectBounds", "Bounds for variables", 'B', "Variation Operators").value()) ,
+00079     // then get eta value
+00080        eta (_parser.getORcreateParam(1.0, "eta", "SBX eta parameter", '\0', "Variation Operators").value()) ,
+00081        range(1) {}
+00082     
+00083 
+00085   virtual std::string className() const { return "eoSBXCrossover"; }
+00086 
+00087   /*****************************************
+00088    * SBX crossover - modifies both parents *
+00089    * @param _eo1 The first parent          *
+00090    * @param _eo2 The first parent          *    
+00091    *****************************************/
+00092   bool operator()(EOT& _eo1, EOT& _eo2)
+00093     {
+00094       unsigned i;
+00095       double r1, r2, beta;
+00096 
+00097         for (i=0; i<_eo1.size(); i++)
+00098           {
+00099       double u = rng.uniform(range) ;
+00100 
+00101       if ( u <= 0.5 ) 
+00102         beta = exp( (1/(eta+1))*log(2*u));
+00103       else
+00104         beta = exp((1/(eta+1))*log(1/(2*(1-u))));
+00105 
+00106 
+00107             
+00108               r1=_eo1[i];
+00109               r2=_eo2[i];   
+00110               _eo1[i] =0.5*((1+beta)*r1+(1-beta)*r2);
+00111               _eo2[i] =0.5*((1-beta)*r1+(1+beta)*r2);
+00112 
+00113         
+00114               if(!(bounds.isInBounds(i,_eo1[i])))
+00115                 bounds.foldsInBounds(i,_eo1[i]);
+00116               if(!(bounds.isInBounds(i,_eo2[i])))
+00117                 bounds.foldsInBounds(i,_eo2[i]);
+00118 
+00119 
+00120 
+00121            }
+00122         return true;
+00123         }
+00124                            
+00125     
+00126 
+00127 protected:
+00128   eoRealVectorBounds & bounds;
+00129   double eta;
+00130   double range;                    // == 1
+00131 };
+00132 
+00133 
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_s_g_a_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_s_g_a_8h-source.html new file mode 100644 index 000000000..ee5b96c07 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_s_g_a_8h-source.html @@ -0,0 +1,125 @@ + + +EO: eoSGA.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoSGA.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoSGA.h
+00005 // (c) GeNeura Team, 2000 - EEAAX 1999 - Maarten Keijzer 2000
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mak@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoSGA_h
+00028 #define _eoSGA_h
+00029 
+00030 #include <eoInvalidateOps.h>
+00031 #include <eoContinue.h>
+00032 #include <eoPop.h>
+00033 #include <eoSelectOne.h>
+00034 #include <eoSelectPerc.h>
+00035 #include <eoEvalFunc.h>
+00036 #include <eoAlgo.h>
+00037 #include <apply.h>
+00038 
+00048 template <class EOT>
+00049 class eoSGA : public eoAlgo<EOT>
+00050 {
+00051 public :
+00052 
+00053   // added this second ctor as I didn't like the ordering of the parameters
+00054   // in the one above. Any objection :-) MS
+00055   eoSGA(
+00056         eoSelectOne<EOT>& _select,
+00057         eoQuadOp<EOT>& _cross, float _crate,
+00058         eoMonOp<EOT>& _mutate, float _mrate,
+00059         eoEvalFunc<EOT>& _eval,
+00060         eoContinue<EOT>& _cont)
+00061     : cont(_cont),
+00062           mutate(_mutate),
+00063           mutationRate(_mrate),
+00064           cross(_cross),
+00065           crossoverRate(_crate),
+00066           select(_select),
+00067           eval(_eval) {}
+00068 
+00069   void operator()(eoPop<EOT>& _pop)
+00070   {
+00071     eoPop<EOT> offspring;
+00072 
+00073     do
+00074       {
+00075         select(_pop, offspring);
+00076 
+00077         unsigned i;
+00078 
+00079         for (i=0; i<_pop.size()/2; i++)
+00080           {
+00081             if ( rng.flip(crossoverRate) )
+00082             {
+00083                     // this crossover generates 2 offspring from two parents
+00084                     if (cross(offspring[2*i], offspring[2*i+1]))
+00085         {
+00086           offspring[2*i].invalidate();
+00087           offspring[2*i+1].invalidate();
+00088         }
+00089       }
+00090           }
+00091 
+00092         for (i=0; i < _pop.size(); i++)
+00093           {
+00094             if (rng.flip(mutationRate) )
+00095             {
+00096                      if (mutate(offspring[i]))
+00097           offspring[i].invalidate();
+00098             }
+00099           }
+00100 
+00101         _pop.swap(offspring);
+00102         apply<EOT>(eval, _pop);
+00103 
+00104       } while (cont(_pop));
+00105   }
+00106 
+00107 private :
+00108 
+00109   eoContinue<EOT>& cont;
+00111   eoInvalidateMonOp<EOT> mutate;
+00112   float mutationRate;
+00113   // eoInvalidateQuadOp invalidates the embedded operator
+00114   eoInvalidateQuadOp<EOT> cross;
+00115   float crossoverRate;
+00116   eoSelectPerc<EOT> select;
+00117   eoEvalFunc<EOT>& eval;
+00118 };
+00119 
+00120 #endif
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_s_g_a_gen_op_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_s_g_a_gen_op_8h-source.html new file mode 100644 index 000000000..9dcd54a9f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_s_g_a_gen_op_8h-source.html @@ -0,0 +1,91 @@ + + +EO: eoSGAGenOp.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoSGAGenOp.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoSGAGenOp.h
+00005 // (c) Marc.Schoenauer 2002
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@inria.fr
+00023              mak@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoSGAGenOp_h
+00028 #define _eoSGAGenOp_h
+00029 
+00030 #include "eoGenOp.h"
+00031 #include "eoInvalidateOps.h"
+00033 // class eoSGAGenOp
+00035 
+00043 template<class EOT> 
+00044 class eoSGAGenOp : public eoGenOp<EOT>
+00045 {
+00046  public:
+00047     
+00052   eoSGAGenOp(eoQuadOp<EOT>& _cross, double _pCross, 
+00053                  eoMonOp<EOT>& _mut, double _pMut)
+00054     : cross(_cross),
+00055       pCross(_pCross),
+00056       mut(_mut), 
+00057       pMut(_pMut) 
+00058   {
+00059     // the crossover - with probability pCross
+00060     propOp.add(cross, pCross); // crossover, with proba pcross
+00061     propOp.add(quadClone, 1-pCross); // nothing, with proba 1-pcross
+00062     
+00063     // now the sequential
+00064     op.add(propOp, 1.0);         // always do combined crossover
+00065     op.add(mut, pMut);     // then mutation, with proba pmut
+00066   }
+00067   
+00069   virtual void apply(eoPopulator<EOT>& _pop)
+00070   {
+00071     op.apply(_pop);
+00072   }
+00073 
+00075   virtual unsigned max_production(void) {return 2;}
+00076 
+00077   virtual std::string className() const {return "eoSGAGenOp";}
+00078 
+00079 
+00080  private:
+00081   eoQuadOp<EOT> &cross;   // eoInvalidateXXX take the boolean output
+00082   double pCross;
+00083   eoMonOp<EOT> & mut;      // of the XXX op and invalidate the EOT
+00084   double pMut;
+00085   eoProportionalOp<EOT> propOp;
+00086   eoQuadCloneOp<EOT> quadClone;
+00087   eoSequentialOp<EOT> op;
+00088 };
+00089 
+00090 
+00091 #endif
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_s_g_a_transform_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_s_g_a_transform_8h-source.html new file mode 100644 index 000000000..c1506d2f1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_s_g_a_transform_8h-source.html @@ -0,0 +1,155 @@ + + +EO: eoSGATransform.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoSGATransform.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoSGA.h
+00005 // (c) Marc.Schoenauer 2000 - Maarten Keijzer 2000
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mak@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoSGATransform_h
+00028 #define _eoSGATransform_h
+00029 
+00030 #include <eoInvalidateOps.h>
+00031 #include <eoPop.h>
+00032 
+00034 // class eoSGATransform
+00036 #include <vector>          // std::vector
+00037 #include <utils/eoRNG.h>
+00038 #include <eoTransform.h>
+00039 
+00045 template<class EOT> class eoSGATransform : public eoTransform<EOT>
+00046 {
+00047  public:
+00048     
+00050   eoSGATransform(eoQuadOp<EOT>& _cross, double _cProba, 
+00051                  eoMonOp<EOT>& _mutate, double _mProba)
+00052     : cross(_cross),
+00053       crossoverProba(_cProba),
+00054       mutate(_mutate), 
+00055       mutationProba(_mProba) {}
+00056 
+00057 
+00062   void operator()(eoPop<EOT>& _pop) 
+00063   {
+00064     unsigned i;
+00065                 
+00066     for (i=0; i<_pop.size()/2; i++) 
+00067       {
+00068         if ( rng.flip(crossoverProba) ) 
+00069           {
+00070             // this crossover generates 2 offspring from two parents
+00071             cross(_pop[2*i], _pop[2*i+1]);
+00072           }
+00073       }
+00074 
+00075     for (i=0; i < _pop.size(); i++) 
+00076       {
+00077         if (rng.flip(mutationProba) ) 
+00078           {
+00079             mutate(_pop[i]);
+00080           }
+00081                   
+00082       }
+00083   };
+00084     
+00085  private:
+00086   eoInvalidateQuadOp<EOT> cross;
+00087   double crossoverProba;
+00088   eoInvalidateMonOp<EOT> mutate;
+00089   double mutationProba;
+00090 };
+00091 
+00098 template<class EOT> class eoDynSGATransform : public eoTransform<EOT>
+00099 {
+00100  public:
+00101     
+00103   eoDynSGATransform(eoQuadOp<EOT>& _cross, double _cProba, 
+00104                  eoMonOp<EOT>& _mutate, double _mProba)
+00105     : cross(_cross),
+00106       crossoverProbaHolder(_cProba), crossoverProba(crossoverProbaHolder),
+00107       mutate(_mutate), 
+00108       mutationProbaHolder(_mProba), mutationProba(mutationProbaHolder) {}
+00109 
+00111   //  these will usually be some eoValueParam<double>.value()
+00112   //  hence the ...Holder data will bever be used in this case
+00113   eoDynSGATransform(eoQuadOp<EOT>& _cross, double* _cProbaRef, 
+00114                  eoMonOp<EOT>& _mutate, double* _mProbaRef)
+00115     : cross(_cross),
+00116       crossoverProbaHolder(0), crossoverProba(*_cProbaRef),
+00117       mutate(_mutate), 
+00118       mutationProbaHolder(0), mutationProba(*_mProbaRef) {}
+00119 
+00120 
+00125   void operator()(eoPop<EOT>& _pop) 
+00126   {
+00127     unsigned i;
+00128                 
+00129     for (i=0; i<_pop.size()/2; i++) 
+00130       {
+00131         if ( rng.flip(crossoverProba) ) 
+00132           {
+00133             // this crossover generates 2 offspring from two parents
+00134             cross(_pop[2*i], _pop[2*i+1]);
+00135           }
+00136       }
+00137 
+00138     for (i=0; i < _pop.size(); i++) 
+00139       {
+00140         if (rng.flip(mutationProba) ) 
+00141           {
+00142             mutate(_pop[i]);
+00143           }
+00144                   
+00145       }
+00146   };
+00147   // accessors - mainly for EASEA
+00148   double & PCrossHandle() { return crossoverProba;}    
+00149   double & PMutHandle() { return mutationProba;}
+00150 
+00151 private:
+00152   // difference with eoSGATransform: the operator probabilities 
+00153   // they can be passed by reference or by value.
+00154   // hence we need here to use a reference, and to eventually store a value
+00155   eoInvalidateQuadOp<EOT> cross;
+00156   double crossoverProbaHolder;  // the value, used only if ctor gets a value
+00157   double& crossoverProba;       // the reference, to be used in operator()
+00158   eoInvalidateMonOp<EOT> mutate;
+00159   double mutationProbaHolder;   // the value, used only if ctor gets a value
+00160   double& mutationProba;        // the reference, to be used in operator()
+00161 };
+00162 
+00163 
+00164 #endif
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_s_t_l_functor_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_s_t_l_functor_8h-source.html new file mode 100644 index 000000000..54cddd761 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_s_t_l_functor_8h-source.html @@ -0,0 +1,107 @@ + + +EO: eoSTLFunctor.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoSTLFunctor.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoSTLFunctor.h
+00005 // (c) Maarten Keijzer 2001
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mak@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoSTLFunctor_H
+00028 #define _eoSTLFunctor_H
+00029 
+00030 #include "eoFunctor.h"
+00031 
+00040 template <class R>
+00041 class eoSTLF
+00042 {
+00043   public:
+00044 
+00045     typedef R result_type;
+00046 
+00047     eoSTLF(eoF<R>& _f) : f(_f) {}
+00048 
+00049     R operator()(void)
+00050     {
+00051       return f();
+00052     }
+00053 
+00054   private :
+00055 
+00056   eoF<R>& f;
+00057 };
+00058 
+00059 #ifdef _MSVC
+00062 template <>
+00063 void eoSTLF<void>::operator()(void)
+00064 {
+00065   f();
+00066 }
+00067 #endif
+00068 
+00077 template <class A1, class R>
+00078 class eoSTLUF : public std::unary_function<A1, R>
+00079 {
+00080   public:
+00081     eoSTLUF(eoUF<A1,R>& _f) : f(_f) {}
+00082 
+00083     R operator()(A1 a)
+00084     {
+00085       return f(a);
+00086     }
+00087 
+00088   private:
+00089     eoUF<A1, R>& f;
+00090 };
+00091 
+00100 template <class A1, class A2, class R>
+00101 class eoSTLBF : public std::binary_function<A1, A2, R>
+00102 {
+00103   public:
+00104     eoSTLBF(eoUF<A1,R>& _f) : f(_f) {}
+00105 
+00106     R operator()(A1 a1, A2 a2)
+00107     {
+00108       return f(a1, a2);
+00109     }
+00110 
+00111   private:
+00112 
+00113     eoBF<A1, A2, R>& f;
+00114 };
+00115 
+00116 // TODO: put automated wrappers here...
+00117 
+00118 #endif
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_scalar_fitness_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_scalar_fitness_8h-source.html new file mode 100644 index 000000000..29314e1be --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_scalar_fitness_8h-source.html @@ -0,0 +1,97 @@ + + +EO: eoScalarFitness.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoScalarFitness.h

00001 /* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003   -----------------------------------------------------------------------------
+00004   eoScalarFitness.h
+00005 
+00006  (c) Maarten Keijzer (mkeijzer@mad.scientist.com) and GeNeura Team, 1999, 2000
+00007 
+00008     This library is free software; you can redistribute it and/or
+00009     modify it under the terms of the GNU Lesser General Public
+00010     License as published by the Free Software Foundation; either
+00011     version 2 of the License, or (at your option) any later version.
+00012 
+00013     This library is distributed in the hope that it will be useful,
+00014     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00015     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00016     Lesser General Public License for more details.
+00017 
+00018     You should have received a copy of the GNU Lesser General Public
+00019     License along with this library; if not, write to the Free Software
+00020     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00021 
+00022     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00023  */
+00024 
+00025 
+00026 #ifndef eoScalarFitness_h
+00027 #define eoScalarFitness_h
+00028 
+00029 #include <functional>
+00030 #include <iostream>
+00031 
+00042 template <class ScalarType, class Compare >
+00043 class eoScalarFitness
+00044 {
+00045     public :
+00046 
+00047     eoScalarFitness() : value() {}
+00048     eoScalarFitness(const eoScalarFitness& other) : value(other.value) {}
+00049     eoScalarFitness(const ScalarType& v) : value(v) {}
+00050 
+00051     eoScalarFitness& operator=(const eoScalarFitness& other)
+00052     { value = other.value; return *this; }
+00053     eoScalarFitness& operator=(const ScalarType& v)
+00054     { value = v; return *this; }
+00055 
+00056     operator ScalarType(void) const { return value; }
+00057 
+00059     bool operator<(const eoScalarFitness& other) const
+00060     { return Compare()(value, other.value); }
+00061 
+00062     // implementation of the other operators
+00063     bool operator>( const eoScalarFitness<ScalarType, Compare>& y ) const  { return y < *this; }
+00064     // implementation of the other operators
+00065     bool operator<=( const eoScalarFitness<ScalarType, Compare>& y ) const { return !(*this > y); }
+00066     // implementation of the other operators
+00067     bool operator>=(const eoScalarFitness<ScalarType, Compare>& y ) const { return !(*this < y); }
+00068 
+00069 
+00070     private :
+00071         ScalarType value;
+00072 };
+00073 
+00080 typedef eoScalarFitness<double, std::less<double> >    eoMaximizingFitness;
+00081 typedef eoScalarFitness<double, std::greater<double> > eoMinimizingFitness;
+00082 
+00083 template <class F, class Cmp>
+00084 std::ostream& operator<<(std::ostream& os, const eoScalarFitness<F, Cmp>& f)
+00085 {
+00086     os << (F) f;
+00087     return os;
+00088 }
+00089 
+00090 template <class F, class Cmp>
+00091 std::istream& operator>>(std::istream& is, eoScalarFitness<F, Cmp>& f)
+00092 {
+00093     F value;
+00094     is >> value;
+00095     f = value;
+00096     return is;
+00097 }
+00098 
+00099 #endif
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_scalar_fitness_assembled_8cpp-source.html b/trunk/paradiseo-eo/doc/html/eo_scalar_fitness_assembled_8cpp-source.html new file mode 100644 index 000000000..307e0da0f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_scalar_fitness_assembled_8cpp-source.html @@ -0,0 +1,56 @@ + + +EO: eoScalarFitnessAssembled.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoScalarFitnessAssembled.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002  
+00003 //-----------------------------------------------------------------------------
+00004 // eoScalarFitnessAssembled.cpp
+00005 // Marc Wintermantel & Oliver Koenig
+00006 // IMES-ST@ETHZ.CH
+00007 // March 2003
+00008 
+00009 /*
+00010     This library is free software; you can redistribute it and/or
+00011     modify it under the terms of the GNU Lesser General Public
+00012     License as published by the Free Software Foundation; either
+00013     version 2 of the License, or (at your option) any later version.
+00014  
+00015     This library is distributed in the hope that it will be useful,
+00016     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00017     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00018     Lesser General Public License for more details.
+00019  
+00020     You should have received a copy of the GNU Lesser General Public
+00021     License along with this library; if not, write to the Free Software
+00022     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00023  
+00024     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00025              Marc.Schoenauer@inria.fr
+00026              mak@dhi.dk
+00027 */
+00028 //-----------------------------------------------------------------------------
+00029 #ifdef _MSC_VER
+00030 // to avoid long name warnings
+00031 #pragma warning(disable:4786)
+00032 #endif 
+00033 
+00034 #include "eoScalarFitnessAssembled.h"
+00035 
+00036 
+00037 // need to allocate the static variables of class eoScalarFitnessAssembledTraits
+00038 std::vector<std::string> eoScalarFitnessAssembledTraits::TermDescriptions;
+00039 
+00040 
+00041 
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_scalar_fitness_assembled_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_scalar_fitness_assembled_8h-source.html new file mode 100644 index 000000000..fbfbc8b8b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_scalar_fitness_assembled_8h-source.html @@ -0,0 +1,248 @@ + + +EO: eoScalarFitnessAssembled.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoScalarFitnessAssembled.h

00001  /* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- */
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoScalarFitnessAssembled.h
+00005 // Marc Wintermantel & Oliver Koenig
+00006 // IMES-ST@ETHZ.CH
+00007 // March 2003
+00008 
+00009 /*
+00010     This library is free software; you can redistribute it and/or
+00011     modify it under the terms of the GNU Lesser General Public
+00012     License as published by the Free Software Foundation; either
+00013     version 2 of the License, or (at your option) any later version.
+00014 
+00015     This library is distributed in the hope that it will be useful,
+00016     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00017     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00018     Lesser General Public License for more details.
+00019 
+00020     You should have received a copy of the GNU Lesser General Public
+00021     License along with this library; if not, write to the Free Software
+00022     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00023 
+00024     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00025              Marc.Schoenauer@inria.fr
+00026              mak@dhi.dk
+00027 */
+00028 //-----------------------------------------------------------------------------
+00029 
+00030 #ifndef eoScalarFitnessAssembled_h
+00031 #define eoScalarFitnessAssembled_h
+00032 
+00033 #include <functional>
+00034 #include <iostream>
+00035 #include <stdexcept>
+00036 #include <vector>
+00037 #include <string>
+00038 
+00040 
+00043 class eoScalarFitnessAssembledTraits{
+00044 
+00045 public:
+00046 
+00047   typedef std::vector<std::string>::size_type size_type;
+00048 
+00049   static void setDescription( size_type _idx, std::string _descr ) {
+00050     if ( _idx < TermDescriptions.size() )
+00051       TermDescriptions[_idx] = _descr;
+00052     else{
+00053       TermDescriptions.resize(_idx, "Unnamed variable" );
+00054       TermDescriptions[_idx] = _descr;
+00055     }
+00056   }
+00057 
+00058   static std::string getDescription( size_type _idx) {
+00059     if ( _idx < TermDescriptions.size() )
+00060       return TermDescriptions[_idx ];
+00061     else
+00062       return "Unnamed Variable";
+00063   }
+00064 
+00065   static void resize( size_type _n, const std::string& _descr) {
+00066     TermDescriptions.resize(_n, _descr);
+00067   }
+00068 
+00069   static size_type size() { return TermDescriptions.size(); }
+00070 
+00071   static std::vector<std::string> getDescriptionVector() { return TermDescriptions; }
+00072 
+00073 private:
+00074   static std::vector<std::string> TermDescriptions;
+00075 };
+00076 
+00078 
+00087 template <class ScalarType, class Compare, class FitnessTraits >
+00088 class eoScalarFitnessAssembled : public std::vector<ScalarType> {
+00089 
+00090 public:
+00091 
+00092     using std::vector< ScalarType >::empty;
+00093     using std::vector< ScalarType >::front;
+00094     using std::vector< ScalarType >::size;
+00095 
+00096 
+00097   typedef typename std::vector<ScalarType> baseVector;
+00098   typedef typename baseVector::size_type size_type;
+00099 
+00100   // Basic constructors and assignments
+00101   eoScalarFitnessAssembled()
+00102     : baseVector( FitnessTraits::size() ),
+00103       feasible(true), failed(false), msg("")
+00104   {}
+00105 
+00106   eoScalarFitnessAssembled( size_type _n,
+00107                             const ScalarType& _val,
+00108                             const std::string& _descr="Unnamed variable" )
+00109     : baseVector(_n, _val),
+00110       feasible(true), failed(false), msg("")
+00111   {
+00112     if ( _n > FitnessTraits::size() )
+00113     FitnessTraits::resize(_n, _descr);
+00114   }
+00115 
+00116   eoScalarFitnessAssembled( const eoScalarFitnessAssembled& other)
+00117     : baseVector( other ),
+00118       feasible(other.feasible),
+00119       failed(other.failed),
+00120       msg(other.msg)
+00121   {}
+00122 
+00123   eoScalarFitnessAssembled& operator=( const eoScalarFitnessAssembled& other) {
+00124     baseVector::operator=( other );
+00125     feasible = other.feasible;
+00126     failed = other.failed;
+00127     msg = other.msg;
+00128     return *this;
+00129   }
+00130 
+00131   // Constructors and assignments to work with scalar type
+00132   eoScalarFitnessAssembled( const ScalarType& v )
+00133     : baseVector( 1, v ),
+00134       feasible(true), failed(false), msg("")
+00135   {}
+00136 
+00137   eoScalarFitnessAssembled& operator=( const ScalarType& v ) {
+00138 
+00139       if( empty() )
+00140           push_back( v );
+00141       else
+00142           front() = v;
+00143       return *this;
+00144   }
+00145 
+00147   void push_back(const ScalarType& _val ){
+00148     baseVector::push_back( _val );
+00149     if ( size() > FitnessTraits::size() )
+00150       FitnessTraits::setDescription( size()-1, "Unnamed variable");
+00151   }
+00152 
+00154   void push_back(const ScalarType& _val, const std::string& _descr ){
+00155     baseVector::push_back( _val );
+00156     FitnessTraits::setDescription( size()-1, _descr );
+00157   }
+00158 
+00160   void resize( size_type _n, const ScalarType& _val = ScalarType(), const std::string& _descr = "Unnamed variable" ){
+00161     baseVector::resize(_n, _val);
+00162     FitnessTraits::resize(_n, _descr);
+00163   }
+00164 
+00166   void setDescription( size_type _idx, std::string _descr ) {
+00167     FitnessTraits::setDescription( _idx, _descr );
+00168   }
+00169 
+00171   std::string getDescription( size_type _idx ){ return FitnessTraits::getDescription( _idx ); }
+00172 
+00174   std::vector<std::string> getDescriptionVector() { return FitnessTraits::getDescriptionVector(); }
+00175 
+00177 
+00181   bool feasible;
+00182 
+00184 
+00188   bool failed;
+00189 
+00191 
+00195   std::string msg;
+00196 
+00197 
+00198   // Scalar type access
+00199   operator ScalarType(void) const {
+00200     if ( empty() )
+00201       return 0.0;
+00202     else
+00203       return front();
+00204   }
+00205 
+00207   void printAll(std::ostream& os) const {
+00208     for (size_type i=0; i < size(); ++i )
+00209       os << FitnessTraits::getDescription(i) << " = " << operator[](i) << " ";
+00210   }
+00211 
+00212   // Comparison, using less by default
+00213   bool operator<(const eoScalarFitnessAssembled& other) const{
+00214     if ( empty() || other.empty() )
+00215       return false;
+00216     else
+00217       return Compare()( front() , other.front() );
+00218   }
+00219 
+00220   // implementation of the other operators
+00221   bool operator>( const eoScalarFitnessAssembled<ScalarType, Compare, FitnessTraits>& y ) const  { return y < *this; }
+00222 
+00223   // implementation of the other operators
+00224   bool operator<=( const eoScalarFitnessAssembled<ScalarType, Compare, FitnessTraits>& y ) const { return !(*this > y); }
+00225 
+00226   // implementation of the other operators
+00227   bool operator>=(const eoScalarFitnessAssembled<ScalarType, Compare, FitnessTraits>& y ) const { return !(*this < y); }
+00228 
+00229 };
+00230 
+00237 typedef eoScalarFitnessAssembled<double, std::less<double>, eoScalarFitnessAssembledTraits >    eoAssembledMaximizingFitness;
+00238 typedef eoScalarFitnessAssembled<double, std::greater<double>, eoScalarFitnessAssembledTraits > eoAssembledMinimizingFitness;
+00239 
+00240 template <class F, class Cmp, class FitnessTraits>
+00241 std::ostream& operator<<(std::ostream& os, const eoScalarFitnessAssembled<F, Cmp, FitnessTraits>& f)
+00242 {
+00243   for (unsigned i=0; i < f.size(); ++i)
+00244     os << f[i] << " ";
+00245 
+00246   os << f.feasible << " ";
+00247   os << f.failed << " ";
+00248 
+00249   return os;
+00250 }
+00251 
+00252 template <class F, class Cmp, class FitnessTraits>
+00253 std::istream& operator>>(std::istream& is, eoScalarFitnessAssembled<F, Cmp, FitnessTraits>& f)
+00254 {
+00255   for (unsigned i=0; i < f.size(); ++i){
+00256     F value;
+00257     is >> value;
+00258     f[i] = value;
+00259   }
+00260 
+00261   is >> f.feasible;
+00262   is >> f.failed;
+00263 
+00264   return is;
+00265 }
+00266 
+00267 #endif
+00268 
+00269 
+00270 
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_scalar_fitness_stat_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_scalar_fitness_stat_8h-source.html new file mode 100644 index 000000000..c19022c48 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_scalar_fitness_stat_8h-source.html @@ -0,0 +1,75 @@ + + +EO: eoScalarFitnessStat.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoScalarFitnessStat.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoScalarFitnessStat.h
+00005 // (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000, 2001
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoScalarFitnessStat_h
+00028 #define _eoScalarFitnessStat_h
+00029 
+00030 #include <utils/eoRealVectorBounds.h>
+00031 #include <utils/eoStat.h>
+00032 
+00036 template <class EOT, class FitT = typename EOT::Fitness>
+00037 class eoScalarFitnessStat : public eoSortedStat<EOT, std::vector<double> >
+00038 {
+00039 public:
+00040 
+00041     using eoSortedStat<EOT, std::vector<double> >::value;
+00042 
+00043     eoScalarFitnessStat(std::string _description = "FitnessES",
+00044                         eoRealVectorBounds & _bounds = eoDummyVectorNoBounds)
+00045         : eoSortedStat<EOT,  std::vector<double> >(std::vector<double>(0), _description),
+00046           range(*_bounds[0])
+00047         {}
+00048 
+00049   virtual void operator()(const std::vector<const EOT*>& _popPters)
+00050     {
+00051       value().resize(_popPters.size());
+00052       for (unsigned i=0; i<_popPters.size(); i++)
+00053         {
+00054           value()[i] = _popPters[i]->fitness();
+00055           range.truncate(value()[i]);
+00056         }
+00057     }
+00058 
+00059 private :
+00060   eoRealBounds & range;
+00061 };
+00062 
+00063 #endif
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_select_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_select_8h-source.html new file mode 100644 index 000000000..97083ff64 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_select_8h-source.html @@ -0,0 +1,31 @@ + + +EO: eoSelect.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoSelect.h

00001 
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef _eoSelect_h
+00026 #define _eoSelect_h
+00027 
+00028 
+00029 //-----------------------------------------------------------------------------
+00030 #include <eoPop.h>
+00031 //-----------------------------------------------------------------------------
+00032 
+00039 template<class EOT>
+00040 class eoSelect : public eoBF<const eoPop<EOT>&, eoPop<EOT>&, void>
+00041 {};
+00042 
+00043 #endif
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_select_factory_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_select_factory_8h-source.html new file mode 100644 index 000000000..cd08f05a8 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_select_factory_8h-source.html @@ -0,0 +1,90 @@ + + +EO: eoSelectFactory.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoSelectFactory.h

00001 // eoSelectFactory.h
+00002 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00003 
+00004 //-----------------------------------------------------------------------------
+00005 // EOFactory.h
+00006 // (c) GeNeura Team, 1998
+00007 /* 
+00008     This library is free software; you can redistribute it and/or
+00009     modify it under the terms of the GNU Lesser General Public
+00010     License as published by the Free Software Foundation; either
+00011     version 2 of the License, or (at your option) any later version.
+00012 
+00013     This library is distributed in the hope that it will be useful,
+00014     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00015     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00016     Lesser General Public License for more details.
+00017 
+00018     You should have received a copy of the GNU Lesser General Public
+00019     License along with this library; if not, write to the Free Software
+00020     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00021 
+00022     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _EOSELECTFACTORY_H
+00027 #define _EOSELECTFACTORY_H
+00028 
+00029 #include <eoFactory.h>
+00030 #include <eoRandomSelect.h>
+00031 #include <eoTournament.h>
+00032 
+00033 //-----------------------------------------------------------------------------
+00034 
+00038 template< class EOT>
+00039 class eoSelectFactory: public eoFactory<eoSelect< EOT> > {
+00040         
+00041 public:
+00042         
+00044         //{@
+00046         eoSelectFactory( ) {}
+00047         
+00049         virtual ~eoSelectFactory() {}
+00051 
+00056         virtual eoSelect<EOT>* make(std::istream& _is) {
+00057                 eoSelect<EOT> * selectPtr;
+00058                 std::string objectTypeStr;
+00059                 _is >> objectTypeStr;
+00060                 // All selectors have a rate, the proportion of the original population
+00061                 float rate;
+00062                 _is >> rate;
+00063                 if  ( objectTypeStr == "eoTournament") {
+00064                         // another parameter is necessary
+00065                         unsigned tSize;
+00066                         _is >> tSize;
+00067                         selectPtr = new eoTournament<EOT>( rate, tSize );
+00068                 } else  {
+00069                         if ( objectTypeStr == "eoRandomSelect" ) {
+00070                                 selectPtr = new eoRandomSelect<EOT>( rate );
+00071                         } else {
+00072                                                 throw std::runtime_error( "Incorrect selector type" );
+00073                         }
+00074                 }
+00075                 return selectPtr;
+00076         }
+00077 
+00079 
+00080         void printOn( std::ostream& _os ) const {};
+00081         void readFrom( std::istream& _is ){};
+00082 
+00085         
+00086 };
+00087 
+00088 
+00089 #endif
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_select_from_worth_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_select_from_worth_8h-source.html new file mode 100644 index 000000000..57fdf3516 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_select_from_worth_8h-source.html @@ -0,0 +1,194 @@ + + +EO: eoSelectFromWorth.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoSelectFromWorth.h

00001 
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _eoSelectFromWorth_h
+00027 #define _eoSelectFromWorth_h
+00028 
+00029 #include <iostream>
+00030 //-----------------------------------------------------------------------------
+00031 #include <eoSelectOne.h>
+00032 #include <eoPerf2Worth.h>
+00033 #include <utils/selectors.h>
+00034 //-----------------------------------------------------------------------------
+00035 
+00050 template <class EOT, class WorthType = double>
+00051 class eoSelectFromWorth : public eoSelectOne<EOT>
+00052 {
+00053 public:
+00054 
+00055     /* Default ctor from an eoPerf2Worth object */
+00056     eoSelectFromWorth(eoPerf2Worth<EOT, WorthType>& _perf2Worth)
+00057         : perf2Worth(_perf2Worth)
+00058         {}
+00059 
+00060     /* setup the worthes */
+00061     virtual void setup(const eoPop<EOT>& pop) {
+00062         perf2Worth(pop);
+00063 #ifndef NDEBUG
+00064         fitness.resize(pop.size());
+00065         for (unsigned i = 0; i < pop.size(); ++i) {
+00066             fitness[i] = pop[i].fitness();
+00067         }
+00068 #endif
+00069     }
+00070 
+00071 
+00072 protected:
+00073 
+00074     eoPerf2Worth<EOT, WorthType>& perf2Worth;
+00075 
+00076 #ifndef NDEBUG
+00077     std::vector<typename EOT::Fitness> fitness;
+00078     void check_sync(unsigned index, const EOT& _eo) {
+00079         if (fitness[index] != _eo.fitness()) {
+00080             throw std::runtime_error("eoSelectFromWorth: fitnesses are not in sync");
+00081         }
+00082     }
+00083 #endif
+00084 };
+00085 
+00086 
+00090 template <class EOT, class WorthT = double>
+00091 class eoDetTournamentWorthSelect : public eoSelectFromWorth<EOT, WorthT>
+00092 {
+00093 public:
+00094 
+00095     using eoSelectFromWorth<EOT, WorthT>::perf2Worth;
+00096 
+00097     typedef typename std::vector<WorthT>::iterator worthIterator;
+00098 
+00099     /* Default ctor from an eoPerf2Worth object +  tournament size */
+00100     eoDetTournamentWorthSelect(eoPerf2Worth<EOT, WorthT>& perf2Worth,
+00101                                unsigned _tSize)
+00102         : eoSelectFromWorth<EOT, WorthT>(perf2Worth), tSize(_tSize) {}
+00103 
+00104     /* Perform deterministic tournament on worthes by calling the
+00105        appropriate fn see selectors.h */
+00106     virtual const EOT& operator()(const eoPop<EOT>& pop) {
+00107         worthIterator it = deterministic_tournament(perf2Worth.value().begin(),
+00108                                                     perf2Worth.value().end(),
+00109                                                     tSize);
+00110         unsigned index = it - perf2Worth.value().begin();
+00111 #ifndef NDEBUG
+00112         // check whether the stuff is still in sync
+00113         check_sync(index, pop[index]);
+00114 #endif
+00115         return pop[index];
+00116     }
+00117 
+00118 
+00119 private:
+00120 
+00121     unsigned tSize;
+00122 };
+00123 
+00127 template <class EOT, class WorthT = double>
+00128 class eoStochTournamentWorthSelect : public eoSelectFromWorth<EOT, WorthT>
+00129 {
+00130 public:
+00131 
+00132     using eoSelectFromWorth<EOT, WorthT>::perf2Worth;
+00133 
+00134     typedef typename std::vector<WorthT>::iterator worthIterator;
+00135 
+00136     /* Default ctor from an eoPerf2Worth object +  tournament rate */
+00137     eoStochTournamentWorthSelect(eoPerf2Worth<EOT, WorthT> &_perf2Worth, double _tRate)
+00138         : eoSelectFromWorth<EOT, WorthT>(_perf2Worth), tRate(_tRate)
+00139         {}
+00140 
+00141   /* Perform stochastic tournament on worthes
+00142      by calling the appropriate fn in selectors.h
+00143   */
+00144   virtual const EOT& operator()(const eoPop<EOT>& _pop) {
+00145       worthIterator it = stochastic_tournament(perf2Worth.value().begin(),
+00146                                                perf2Worth.value().end(),
+00147                                                tRate);
+00148 
+00149     unsigned index = it - perf2Worth.value().begin();
+00150 
+00151 #ifndef NDEBUG
+00152   // check whether the stuff is still in sync
+00153   check_sync(index, _pop[index]);
+00154 #endif
+00155 
+00156     return _pop[index];
+00157   }
+00158 
+00159 private:
+00160   double tRate;
+00161 };
+00162 
+00166 template <class EOT, class WorthT = double>
+00167 class eoRouletteWorthSelect : public eoSelectFromWorth<EOT, WorthT>
+00168 {
+00169 public:
+00170 
+00171     using eoSelectFromWorth<EOT, WorthT>::perf2Worth;
+00172 
+00173     typedef typename std::vector<WorthT>::iterator worthIterator;
+00174 
+00175 
+00176     /* Default ctor from an eoPerf2Worth object */
+00177     eoRouletteWorthSelect(eoPerf2Worth<EOT, WorthT> &_perf2Worth)
+00178         : eoSelectFromWorth<EOT, WorthT>(_perf2Worth)
+00179         {}
+00180 
+00181   /* We have to override the default behavior to compute the total
+00182    * only once!
+00183    */
+00184   virtual void setup(const eoPop<EOT>& _pop)
+00185   {
+00186     eoSelectFromWorth<EOT, WorthT>::setup(_pop);
+00187     total = 0.0;
+00188     for (worthIterator it = perf2Worth.value().begin();
+00189          it<perf2Worth.value().end(); ++it)
+00190       total += (*it);
+00191   }
+00192 
+00193   /* Perform roulette wheel on worthes
+00194      by calling the appropriate fn
+00195      see selectors.h
+00196   */
+00197   virtual const EOT& operator()(const eoPop<EOT>& _pop) {
+00198  //     cout << "On affiche les worths\n";
+00199  //     for (unsigned i=0;
+00200  //      i<perf2Worth.value().size();
+00201  //      i++)
+00202  //       cout << perf2Worth.value().operator[](i) << "\n";
+00203  //     cout << endl;
+00204       worthIterator it = roulette_wheel(perf2Worth.value().begin(),
+00205                                         perf2Worth.value().end(),
+00206                                         total);
+00207 
+00208    unsigned index = it - perf2Worth.value().begin();
+00209 
+00210 #ifndef NDEBUG
+00211   // check whether the stuff is still in sync
+00212   check_sync(index, _pop[index]);
+00213 #endif
+00214 
+00215     return _pop[index];
+00216     return _pop[it - perf2Worth.value().begin()];
+00217   }
+00218 
+00219 private:
+00220   double total;
+00221 };
+00222 
+00223 #endif
+00224 
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_select_many_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_select_many_8h-source.html new file mode 100644 index 000000000..2e99379ce --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_select_many_8h-source.html @@ -0,0 +1,59 @@ + + +EO: eoSelectMany.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoSelectMany.h

00001 
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoSelectMany_h
+00028 #define _eoSelectMany_h
+00029 
+00030 
+00031 //-----------------------------------------------------------------------------
+00032 #include <eoSelect.h>
+00033 #include <eoSelectOne.h>
+00034 #include <utils/eoHowMany.h>
+00035 #include <math.h>
+00036 //-----------------------------------------------------------------------------
+00037 
+00044 template<class EOT>
+00045 class eoSelectMany : public eoSelect<EOT>
+00046 {
+00047  public:
+00049      eoSelectMany(eoSelectOne<EOT>& _select, 
+00050                     double  _rate, bool _interpret_as_rate = true) 
+00051          : select(_select), howMany(_rate, _interpret_as_rate) {}
+00052 
+00053      // Ctor with eoHowMany
+00054      eoSelectMany(eoSelectOne<EOT>& _select, eoHowMany _howMany) 
+00055          : select(_select), howMany(_howMany) {}
+00056 
+00063   virtual void operator()(const eoPop<EOT>& _source, eoPop<EOT>& _dest)
+00064   {
+00065     unsigned target = howMany(_source.size());
+00066     
+00067     _dest.resize(target);
+00068     
+00069     select.setup(_source);
+00070     
+00071     for (size_t i = 0; i < _dest.size(); ++i)
+00072       _dest[i] = select(_source);
+00073   }
+00074   
+00075 private :
+00076   eoSelectOne<EOT>& select;
+00077   eoHowMany howMany;
+00078 };
+00079 
+00080 #endif
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_select_number_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_select_number_8h-source.html new file mode 100644 index 000000000..2b86050ff --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_select_number_8h-source.html @@ -0,0 +1,53 @@ + + +EO: eoSelectNumber.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoSelectNumber.h

00001 
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef _eoSelectNumber_h
+00026 #define _eoSelectNumber_h
+00027 
+00028 
+00029 //-----------------------------------------------------------------------------
+00030 #include <eoSelect.h>
+00031 #include <eoSelectOne.h>
+00032 #include <math.h>
+00033 //-----------------------------------------------------------------------------
+00034 
+00041 template<class EOT>
+00042 class eoSelectNumber : public eoSelect<EOT>
+00043 {
+00044  public:
+00046      eoSelectNumber(eoSelectOne<EOT>& _select, unsigned _nb_to_select = 1) 
+00047          : select(_select), nb_to_select(_nb_to_select) {}
+00048 
+00055   virtual void operator()(const eoPop<EOT>& _source, eoPop<EOT>& _dest)
+00056   {
+00057     size_t target = static_cast<size_t>(nb_to_select);
+00058     
+00059     _dest.resize(target);
+00060     
+00061     select.setup(_source);
+00062     
+00063     for (size_t i = 0; i < _dest.size(); ++i)
+00064       _dest[i] = select(_source);
+00065   }
+00066   
+00067 private :
+00068   eoSelectOne<EOT>& select;
+00069   unsigned nb_to_select;
+00070 };
+00071 
+00072 #endif
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_select_one_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_select_one_8h-source.html new file mode 100644 index 000000000..ae290748c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_select_one_8h-source.html @@ -0,0 +1,41 @@ + + +EO: eoSelectOne.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoSelectOne.h

00001 
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef _eoSelectOne_h
+00026 #define _eoSelectOne_h
+00027 
+00028 
+00029 //-----------------------------------------------------------------------------
+00030 #include <eoPop.h>
+00031 #include <eoFunctor.h>
+00032 //-----------------------------------------------------------------------------
+00033 
+00040 #ifdef _MSC_VER
+00041 template<class EOT, class WorthT = EOT::Fitness>
+00042 #else
+00043 template<class EOT, class WorthT = typename EOT::Fitness>
+00044 #endif
+00045 class eoSelectOne : public eoUF<const eoPop<EOT>&, const EOT&>
+00046 {
+00047     public :
+00049       virtual void setup(const eoPop<EOT>& _pop)
+00050       {}
+00051 };
+00052 
+00053 
+00054 #endif
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_select_perc_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_select_perc_8h-source.html new file mode 100644 index 000000000..5a26bc2b1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_select_perc_8h-source.html @@ -0,0 +1,53 @@ + + +EO: eoSelectPerc.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoSelectPerc.h

00001 
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef _eoSelectPerc_h
+00026 #define _eoSelectPerc_h
+00027 
+00028 
+00029 //-----------------------------------------------------------------------------
+00030 #include <eoSelect.h>
+00031 #include <eoSelectOne.h>
+00032 #include <math.h>
+00033 //-----------------------------------------------------------------------------
+00034 
+00041 template<class EOT>
+00042 class eoSelectPerc : public eoSelect<EOT>
+00043 {
+00044  public:
+00046      eoSelectPerc(eoSelectOne<EOT>& _select, float _rate = 1.0) 
+00047          : select(_select), rate(_rate) {}
+00048 
+00055   virtual void operator()(const eoPop<EOT>& _source, eoPop<EOT>& _dest)
+00056   {
+00057     size_t target = static_cast<size_t>(floor(rate * _source.size()));
+00058     
+00059     _dest.resize(target);
+00060     
+00061     select.setup(_source);
+00062     
+00063     for (size_t i = 0; i < _dest.size(); ++i)
+00064       _dest[i] = select(_source);
+00065   }
+00066   
+00067 private :
+00068   eoSelectOne<EOT>& select;
+00069   float rate;
+00070 };
+00071 
+00072 #endif
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_sequential_select_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_sequential_select_8h-source.html new file mode 100644 index 000000000..f3fb7aa6a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_sequential_select_8h-source.html @@ -0,0 +1,128 @@ + + +EO: eoSequentialSelect.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoSequentialSelect.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoSequential.h
+00005 // (c) GeNeura Team, 1998 - Maarten Keijzer 2000, Marc Schoenauer, 2002
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mak@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef eoSequential_h
+00028 #define eoSequential_h
+00029 
+00030 #include <limits>
+00031 
+00032 #include "utils/eoData.h"
+00033 #include "utils/eoRNG.h"
+00034 #include "eoSelectOne.h"
+00035 
+00052 template <class EOT> class eoSequentialSelect: public eoSelectOne<EOT>
+00053 {
+00054  public:
+00058   eoSequentialSelect(bool _ordered = true)
+00059         : ordered(_ordered), current(std::numeric_limits<unsigned>::max()) {}
+00060 
+00061   void setup(const eoPop<EOT>& _pop)
+00062   {
+00063     eoPters.resize(_pop.size());
+00064     if (ordered)    // probably we could have a marker to avoid re-sorting
+00065             _pop.sort(eoPters);
+00066     else
+00067       _pop.shuffle(eoPters);
+00068     current=0;
+00069   }
+00070 
+00071   virtual const EOT& operator()(const eoPop<EOT>& _pop)
+00072   {
+00073     if (current >= _pop.size())
+00074       setup(_pop);
+00075 
+00076     unsigned eoN = current;
+00077     current++;
+00078     return *eoPters[eoN] ;
+00079   }
+00080 private:
+00081   bool ordered;
+00082   unsigned current;
+00083   std::vector<const EOT*> eoPters;
+00084 };
+00085 
+00086 
+00087 
+00097 template <class EOT> class eoEliteSequentialSelect: public eoSelectOne<EOT>
+00098 {
+00099  public:
+00100 
+00104   eoEliteSequentialSelect(): current(std::numeric_limits<unsigned>::max()) {}
+00105 
+00106   void setup(const eoPop<EOT>& _pop)
+00107   {
+00108     eoPters.resize(_pop.size());
+00109     _pop.shuffle(eoPters);
+00110     // now get the best
+00111     unsigned int ibest = 0;
+00112     const EOT * best = eoPters[0];
+00113     if (_pop.size() == 1)
+00114       throw std::runtime_error("Trying eoEliteSequentialSelect with only one individual!");
+00115     for (unsigned i=1; i<_pop.size(); i++)
+00116       if (*eoPters[i]>*best)
+00117         {
+00118           ibest = i;
+00119           best = eoPters[ibest];
+00120         }
+00121     // and put it upfront
+00122     const EOT *ptmp = eoPters[0];
+00123     eoPters[0]=best;
+00124     eoPters[ibest] = ptmp;
+00125     // exit after setting current
+00126     current=0;
+00127   }
+00128 
+00129   virtual const EOT& operator()(const eoPop<EOT>& _pop)
+00130   {
+00131     if (current >= _pop.size())
+00132       setup(_pop);
+00133 
+00134     unsigned eoN = current;
+00135     current++;
+00136     return *eoPters[eoN] ;
+00137   }
+00138 private:
+00139   unsigned current;
+00140   std::vector<const EOT*> eoPters;
+00141 };
+00142 
+00143 
+00144 #endif
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_sharing_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_sharing_8h-source.html new file mode 100644 index 000000000..5626c76e5 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_sharing_8h-source.html @@ -0,0 +1,115 @@ + + +EO: eoSharing.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoSharing.h

00001 
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef eoSharing_h
+00027 #define eoSharing_h
+00028 
+00029 #include <eoPerf2Worth.h>
+00030 #include <utils/eoDistance.h>
+00031 
+00037   class dMatrix : public std::vector<double>
+00038   {
+00039   public:
+00040     // Ctor : sets size
+00041     dMatrix(unsigned _s) : std::vector<double>(_s*_s), rSize(_s) {}
+00042 
+00044     double operator()(unsigned _i, unsigned _j) const
+00045     {
+00046       return this->operator[](_i*rSize + _j);
+00047     }
+00048 
+00050     double & operator()(unsigned _i, unsigned _j)
+00051     {
+00052       return this->operator[](_i*rSize + _j);
+00053     }
+00054 
+00056     void printOn(std::ostream & _os)
+00057     {
+00058       unsigned index=0;
+00059       for (unsigned i=0; i<rSize; i++)
+00060         {
+00061           for (unsigned j=0; j<rSize; j++)
+00062             _os << this->operator[](index++) << " " ;
+00063           _os << std::endl;
+00064         }
+00065       _os << std::endl;
+00066     }
+00067 
+00068     private:
+00069       unsigned rSize;              // row size (== number of columns!)
+00070   };
+00071 
+00072 
+00078 template <class EOT>
+00079 class eoSharing : public eoPerf2Worth<EOT>
+00080 {
+00081 public:
+00082 
+00083     using eoPerf2Worth<EOT>::value;
+00084 
+00085 
+00086   /* Ctor requires a distance - cannot have a default distance! */
+00087   eoSharing(double _nicheSize, eoDistance<EOT> & _dist) : eoPerf2Worth<EOT>("Sharing"),
+00088                                              nicheSize(_nicheSize),
+00089                                              dist(_dist)
+00090   {}
+00091 
+00094     void operator()(const eoPop<EOT>& _pop)
+00095     {
+00096       unsigned i, j,
+00097         pSize=_pop.size();
+00098       if (pSize <= 1)
+00099         throw std::runtime_error("Apptempt to do sharing with population of size 1");
+00100       value().resize(pSize);
+00101       std::vector<double> sim(pSize);      // to hold the similarities
+00102       dMatrix distMatrix(pSize*(pSize-1)/2); // to hold the distances
+00103 
+00104       // compute the similarities (wrong name for distMatrix, I know)
+00105       distMatrix(0,0)=1;
+00106       for (i=1; i<pSize; i++)
+00107         {
+00108           distMatrix(i,i)=1;
+00109           for (j=0; j<i; j++)
+00110             {
+00111               double d =  dist(_pop[i], _pop[j]);
+00112               distMatrix(i,j) =
+00113                 distMatrix(j,i) = ( d>nicheSize ? 0 : 1-(d/nicheSize) );
+00114             }
+00115         }
+00116 
+00117       for (i=0; i<pSize; i++)
+00118         {
+00119           double sum=0.0;
+00120           for (j=0; j<pSize; j++)
+00121             sum += distMatrix(i,j);
+00122           sim[i] = sum;
+00123         }
+00124 
+00125       // now set the worthes values
+00126       for (i = 0; i < _pop.size(); ++i)
+00127         value()[i]=_pop[i].fitness()/sim[i];
+00128     }
+00129     // private data of class eoSharing
+00130 private:
+00131   double nicheSize;
+00132   eoDistance<EOT> & dist;            // specific distance
+00133 };
+00134 
+00135 
+00136 
+00137 #endif
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_sharing_select_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_sharing_select_8h-source.html new file mode 100644 index 000000000..d264dc4b9 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_sharing_select_8h-source.html @@ -0,0 +1,60 @@ + + +EO: eoSharingSelect.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoSharingSelect.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoSharingSelect.h
+00005 // (c) GeNeura Team, 1998, Maarten Keijzer 2000, Marc Schoenauer 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: Marc.Schoenauer@polytechnique.fr
+00022              mak@dhi.dk
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef eoSharingSelect_h
+00027 #define eoSharingSelect_h
+00028 
+00029 //-----------------------------------------------------------------------------
+00030 
+00031 #include <eoSelectFromWorth.h>
+00032 #include <eoSharing.h>
+00033 
+00042 template <class EOT> 
+00043 class eoSharingSelect: public eoRouletteWorthSelect<EOT, double> 
+00044 {
+00045 public:
+00049   eoSharingSelect(double _sigma, eoDistance<EOT> & _dist): 
+00050     eoRouletteWorthSelect<EOT, double>(sharing), sharing(_sigma, _dist) {}
+00051 
+00052 private :
+00053   eoSharing<EOT> sharing;          // derived from eoPerf2Worth
+00054 };
+00055 
+00056 #endif
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_simple_e_d_a_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_simple_e_d_a_8h-source.html new file mode 100644 index 000000000..2b589599f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_simple_e_d_a_8h-source.html @@ -0,0 +1,103 @@ + + +EO: eoSimpleEDA.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoSimpleEDA.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoSimpleEDA.h
+00005 // (c) Marc Schoenauer, Maarten Keijzer, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: Marc.Schoenauer@polytechnique.fr
+00022              mkeijzer@dhi.dk
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _eoSimpleEDA_h
+00027 #define _eoSimpleEDA_h
+00028 
+00029 //-----------------------------------------------------------------------------
+00030 
+00031 #include <apply.h>
+00032 #include <eoEDA.h>
+00033 #include <eoContinue.h>
+00034 #include <eoDistribUpdater.h>
+00035 #include <eoEvalFunc.h>
+00036 
+00046 template<class EOT> class eoSimpleEDA: public eoEDA<EOT>
+00047 {
+00048  public:
+00049 
+00053   eoSimpleEDA(eoDistribUpdater<EOT>& _update,
+00054            eoEvalFunc<EOT>& _eval,
+00055            unsigned _popSize, 
+00056            eoContinue<EOT>& _continuator
+00057            ) : 
+00058     update(_update),
+00059     eval(_eval),
+00060     popSize(_popSize),
+00061     continuator(_continuator)
+00062   {}
+00063 
+00069   virtual void operator()(eoDistribution<EOT>& _distrib)
+00070   {
+00071     eoPop<EOT> pop(popSize, _distrib);
+00072     do
+00073     {
+00074       try
+00075       {
+00076         apply<EOT>(_distrib, pop); // re-init. of _pop from distrib
+00077 
+00078         apply<EOT>(eval, pop);     // eval of current population
+00079 
+00080         update(_distrib, pop);     // updates distrib from _pop
+00081         
+00082       }
+00083       catch (std::exception& e)
+00084       {
+00085             std::string s = e.what();
+00086             s.append( " in eoSimpleEDA");
+00087             throw std::runtime_error( s );
+00088       }
+00089     } while ( continuator( pop ) );
+00090   }
+00091 
+00092  private:
+00093   eoDistribUpdater<EOT> & update;
+00094 
+00095   eoEvalFunc<EOT>&          eval;
+00096   
+00097   unsigned                  popSize;
+00098 
+00099   eoContinue<EOT>&          continuator;
+00100 };
+00101 
+00102 //-----------------------------------------------------------------------------
+00103 
+00104 #endif
+00105 
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_st_parse_tree_depth_init_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_st_parse_tree_depth_init_8h-source.html new file mode 100644 index 000000000..d2e87f58d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_st_parse_tree_depth_init_8h-source.html @@ -0,0 +1,178 @@ + + +EO: eoStParseTreeDepthInit.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / gp
+

eoStParseTreeDepthInit.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002  
+00003 //-----------------------------------------------------------------------------
+00004 // eoStParseTreeDepthInit.h : initializor strongly type GP
+00005 // (c) Jeroen Eggermont 2001
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011  
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016  
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020  
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              jeggermo@liacs.nl
+00023             
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef eoStParseTreeDepthInit_h
+00028 #define eoStParseTreeDepthInit_h
+00029 
+00030 #include <EO.h>
+00031 #include <gp/eoParseTree.h>
+00032 #include <eoInit.h>
+00033 #include <eoOp.h>
+00034 
+00035 
+00036 using namespace gp_parse_tree;
+00037 
+00038 #define TERMINAL 0
+00039 
+00040 #define NONTERMINAL 4
+00041 #define ALL 5
+00042 
+00060 template <class FType, class Node>
+00061 class eoStParseTreeDepthInit : public eoInit< eoParseTree<FType, Node> >
+00062 {
+00063     public :
+00064 
+00065     typedef eoParseTree<FType, Node> EoType;
+00066     
+00073         eoStParseTreeDepthInit(
+00074         unsigned _max_depth,
+00075                 const std::vector<Node>& _node,
+00076                 const int& _return_type,
+00077         bool _grow = true)
+00078             :
+00079             eoInit<EoType>(),
+00080                         max_depth(_max_depth),
+00081                         return_type(_return_type),
+00082                         grow(_grow)
+00083     {
+00084       if(_node.empty())
+00085       {
+00086         throw std::logic_error("eoStParseTreeDepthInit: uhm, wouldn't you rather give a non-empty set of Nodes?");
+00087       }
+00088       
+00089       
+00090       unsigned int i=0;
+00091       int arity=0;
+00092       int type=0;
+00093       std::vector<Node> node_std::vector;
+00094       for(i=0; i < _node.size(); i++)
+00095       {
+00096         arity = _node[i].arity();
+00097         type = _node[i].type();
+00098         if(arity==0)
+00099         {
+00100                 node_std::vector = node[type][TERMINAL];
+00101                 node_std::vector.push_back(_node[i]);
+00102                 node[type][TERMINAL]= node_std::vector;
+00103         }       
+00104         else    
+00105         //if (arity != 0) // non-terminal
+00106         {
+00107                 node_std::vector = node[type][NONTERMINAL];
+00108                 node_std::vector.push_back(_node[i]);
+00109                 node[type][NONTERMINAL] = node_std::vector;
+00110         }
+00111         node_std::vector = node[type][ALL];
+00112         node_std::vector.push_back(_node[i]);
+00113         node[type][ALL] = node_std::vector;
+00114                 
+00115       }
+00116       
+00117 
+00118     }
+00120         virtual std::string className() const { return "eoStParseTreeDepthInit"; };
+00121 
+00125     void operator()(EoType& _tree)
+00126         {
+00127                 std::list<Node> sequence;
+00128                 bool good_tree = false;
+00129                 do 
+00130                 {
+00131                         sequence.clear();
+00132                         good_tree = generate(sequence, max_depth, return_type);
+00133                 }while (!good_tree);    
+00134 
+00135                 parse_tree<Node> tmp(sequence.begin(), sequence.end());
+00136                 _tree.swap(tmp);
+00137         }
+00138    private :
+00139     bool generate(std::list<Node>& sequence, int the_max, int request_type)
+00140     {
+00141             
+00142             int selected=0;
+00143             bool ok = true;
+00144             
+00145             if (the_max == 1)
+00146             { // generate terminals only
+00147                 if( node[request_type][TERMINAL].empty() ) // no possible terminal node of this type
+00148                         return false; // we have an invalid tree
+00149                 else
+00150                 {       
+00151                         selected = rng.random((node[request_type][TERMINAL]).size());
+00152                         sequence.push_front(node[request_type][TERMINAL][selected]);
+00153                         return true;
+00154                 }       
+00155               
+00156             }
+00157             
+00158             int arity=0;
+00159             if (grow)
+00160             {
+00161                 selected = rng.random((node[request_type][ALL]).size());
+00162                 arity = node[request_type][ALL][selected].arity();
+00163                 sequence.push_front(node[request_type][ALL][selected]);
+00164                 for (int i = 0; i < arity; ++i)
+00165                     ok &= generate(sequence, the_max - 1, node[request_type][ALL][selected].type(i));
+00166             }
+00167             else // full
+00168             {
+00169                  selected = rng.random((node[request_type][NONTERMINAL]).size());
+00170                  arity = node[request_type][NONTERMINAL][selected].arity();
+00171                  sequence.push_front(node[request_type][NONTERMINAL][selected]);
+00172                  for (int i = 0; i < arity; ++i)
+00173                      ok &=generate(sequence, the_max - 1, node[request_type][NONTERMINAL][selected].type(i));
+00174             }
+00175             
+00176             return ok;
+00177             
+00178     }
+00179 
+00180 
+00181 
+00182      
+00183         unsigned max_depth; 
+00184         map < int, map < int, std::vector<Node> > > node;
+00185 
+00186         int return_type;
+00187         bool grow;
+00188 };
+00189 
+00190 #endif
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_st_parse_tree_op_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_st_parse_tree_op_8h-source.html new file mode 100644 index 000000000..d6e4858b3 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_st_parse_tree_op_8h-source.html @@ -0,0 +1,271 @@ + + +EO: eoStParseTreeOp.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / gp
+

eoStParseTreeOp.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002  
+00003 //-----------------------------------------------------------------------------
+00004 // eoStParseTreeOp.h : crossover and mutation operators for  the strongly typed GP
+00005 // (c) Jeroen Eggermont 2001 for other mutation operators
+00006 
+00007 /*
+00008     This library is free software; you can redistribute it and/or
+00009     modify it under the terms of the GNU Lesser General Public
+00010     License as published by the Free Software Foundation; either
+00011     version 2 of the License, or (at your option) any later version.
+00012  
+00013     This library is distributed in the hope that it will be useful,
+00014     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00015     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00016     Lesser General Public License for more details.
+00017  
+00018     You should have received a copy of the GNU Lesser General Public
+00019     License along with this library; if not, write to the Free Software
+00020     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00021  
+00022     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00023              mak@dhi.dk 
+00024              jeggermo@liacs.nl
+00025  */
+00026 //-----------------------------------------------------------------------------
+00027 
+00028 #ifndef eoStParseTreeOp_h
+00029 #define eoStParseTreeOp_h
+00030 
+00031 #include <EO.h>
+00032 #include <eoOp.h>
+00033 #include <map.h>
+00034 #include <iostream>
+00035 
+00036 #include <gp/eoParseTree.h>
+00037 
+00038 // a help function
+00039 template <class EOT>
+00040 void get_possible_nodes(const EOT &_eo, std::vector<int> &possible_nodes, const int type)
+00041 {
+00042         int n=0;
+00043         possible_nodes.clear();
+00044         // collect the possible crossover points in _eo (nodes with the same type)
+00045         for(n=0; n < _eo.size(); n++)
+00046                 if (type == _eo[n]->type())
+00047                         possible_nodes.push_back(n);
+00048 }       
+00049 
+00050 
+00055 template<class FType, class Node>
+00056 class eoStSubtreeXOver: public eoQuadOp< eoParseTree<FType, Node> > {
+00057 public:
+00058 
+00059   typedef eoParseTree<FType,Node> EoType;
+00064   eoStSubtreeXOver( unsigned _max_length)
+00065     : eoQuadOp<EoType>(), max_length(_max_length) {};
+00066 
+00068   virtual std::string className() const { return "eoStSubtreeXOver"; };
+00069 
+00071   virtual ~eoStSubtreeXOver () {};
+00072 
+00078   bool operator()(EoType & _eo1, EoType & _eo2 )
+00079   {
+00080           int i = 0;
+00081           std::vector<int> nodes;
+00082           int n = 0;
+00083           int type = 0;
+00084           int j = 0;
+00085           set<int> test;
+00086           do
+00087           {
+00088                 do // select a random node in _eo1 as crossover point, and check if we didn't try it already
+00089                 {
+00090                         i = rng.random(_eo1.size());
+00091                 }while(test.count(i) > 0);
+00092                 
+00093                 test.insert(i);
+00094                 
+00095                 type = _eo1[i]->type();
+00096                 
+00097                 get_possible_nodes<EoType>(_eo2, nodes, type);
+00098                 
+00099          }while(nodes.empty() && (test.size() < _eo1.size()));  
+00100          
+00101          if (nodes.empty()) // we failed to select a crossover point but tried all points (test.size() == _eo1.size()).
+00102                 return true;  // should this be false ??
+00103 
+00104          // we did find at least one possible crossover point in _eo2
+00105                 
+00106          n = rng.random(nodes.size());
+00107          j = nodes[n];
+00108            
+00109          parse_tree<Node>::subtree tmp = _eo1[i];
+00110          _eo1[i] = _eo2[j]; // insert subtree
+00111          _eo2[j] = tmp;
+00112 
+00113          // we can't prune anymore
+00114          /*     
+00115          _eo1.pruneTree(max_length);
+00116          _eo2.pruneTree(max_length);
+00117          */
+00118          
+00119          return true;
+00120   }
+00121  private:
+00122   unsigned max_length;
+00123 };
+00124 
+00129 template<class FType, class Node>
+00130 class eoStBranchMutation: public eoMonOp< eoParseTree<FType, Node> >
+00131 {
+00132 public:
+00133 
+00134   typedef eoParseTree<FType,Node> EoType;
+00140   eoStBranchMutation(eoInit<EoType>& _init, unsigned _max_length)
+00141     : eoMonOp<EoType>(), max_length(_max_length), initializer(_init)
+00142   {};
+00143   
+00145   virtual std::string className() const { return "eoStBranchMutation"; };
+00146 
+00148   virtual ~eoStBranchMutation() {};
+00149   
+00154   bool operator()(EoType& _eo1 )
+00155   {
+00156           int i = rng.random(_eo1.size());
+00157           std::vector<int> nodes;
+00158           int type = _eo1[i]->type();
+00159           int j=0;
+00160           int n=0;
+00161 
+00162           EoType eo2;
+00163           
+00164           do
+00165           {
+00166                 initializer(eo2);
+00167                 get_possible_nodes(eo2, nodes, type);
+00168           }while (nodes.empty());       
+00169 
+00170           n = rng.random(nodes.size());
+00171           j = nodes[n];
+00172           
+00173           _eo1[i] = eo2[j]; // insert subtree
+00174           
+00175           // no more pruning
+00176           /*
+00177           _eo1.pruneTree(max_length);
+00178           */
+00179 
+00180     return true;
+00181   }
+00182 
+00183 private :
+00184 
+00185   unsigned max_length;
+00186   eoInit<EoType>& initializer;
+00187 };
+00188 
+00189 
+00194 template<class FType, class Node>
+00195 class eoStPointMutation: public eoMonOp< eoParseTree<FType, Node> >
+00196 {
+00197 public:
+00198 
+00199   typedef eoParseTree<FType,Node> EoType;
+00200 
+00205   eoStPointMutation( std::vector<Node>& _node)
+00206     : eoMonOp<EoType>()
+00207   {
+00208         unsigned int i=0;
+00209         int arity=0;
+00210         int type=0;
+00211         std::vector<Node> node_std::vector;
+00212         for(i=0; i < _node.size(); i++)
+00213         {
+00214                 arity = _node[i].arity();
+00215                 type = _node[i].type();
+00216                 
+00217                         node_std::vector = node[type][arity];
+00218                         node_std::vector.push_back(_node[i]);
+00219                         node[type][arity]= node_std::vector;
+00220                 
+00221         };
+00222   };
+00223   
+00225   virtual std::string className() const { return "eoStPointMutation"; };
+00226 
+00228   virtual ~eoStPointMutation() {};
+00229 
+00234   bool operator()(EoType& _eo1 )
+00235   {
+00236         // select a random node i that is to be mutated
+00237         int i = rng.random(_eo1.size());
+00238         int arity = _eo1[i].arity();
+00239         int type = _eo1[i]->type();
+00240         int j = rng.random(node[type][arity].size());
+00241 
+00242         
+00243         _eo1[i] = node[type][arity][j];
+00244         return true;
+00245   }
+00246 
+00247 private :
+00248         
+00249         map < int, map < int, std::vector<Node> > > node;
+00250 };
+00251 
+00252  
+00257 template<class FType, class Node>
+00258 class eoStHoistMutation: public eoMonOp< eoParseTree<FType, Node> >
+00259 {
+00260 public:
+00261 
+00262   typedef eoParseTree<FType,Node> EoType;
+00268   eoStHoistMutation(eoInit<EoType>& _init, unsigned _max_length)
+00269     : eoMonOp<EoType>(), max_length(_max_length), initializer(_init)
+00270   {};
+00271   
+00273   virtual std::string className() const { return "eoStHoistMutation"; };
+00274 
+00276   virtual ~eoStHoistMutation() {};
+00277   
+00282   bool operator()(EoType& _eo1 )
+00283   {
+00284 
+00285           std::vector<int> nodes;
+00286           // get the type of the current tree
+00287           int type = _eo1[ _eo1.size() - 1 ]->type();
+00288 
+00289         
+00290           
+00291           do
+00292           {
+00293                 initializer(eo2);
+00294                 get_possible_nodes(eo2, nodes, type);
+00295           }while (nodes.empty());       
+00296           
+00297           // select a subtree-node to replace the current tree
+00298           int n = rng.random(nodes.size());
+00299           int i = nodes[n];
+00300           
+00301           EoType eo2(_eo1[i]);
+00302           
+00303           _eo1 = eo2;
+00304 
+00305           return true;
+00306   }
+00307 
+00308 private :
+00309 
+00310   unsigned max_length;
+00311   eoInit<EoType>& initializer;
+00312 };
+00313 
+00314 
+00315 #endif
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_stat_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_stat_8h-source.html new file mode 100644 index 000000000..02b49325e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_stat_8h-source.html @@ -0,0 +1,414 @@ + + +EO: eoStat.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoStat.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoStat.h
+00005 // (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoStat_h
+00028 #define _eoStat_h
+00029 
+00030 #include <numeric> // accumulate
+00031 
+00032 #include <eoFunctor.h>
+00033 #include <utils/eoParam.h>
+00034 #include <eoPop.h>
+00035 #include <eoParetoFitness.h>
+00036 
+00044 template <class EOT>
+00045 class eoStatBase : public eoUF<const eoPop<EOT>&, void>
+00046 {
+00047 public:
+00048   virtual void lastCall(const eoPop<EOT>&) {}
+00049   virtual std::string className(void) const { return "eoStatBase"; }
+00050 };
+00051 
+00057 template <class EOT, class T>
+00058 class eoStat : public eoValueParam<T>, public eoStatBase<EOT>
+00059 {
+00060 public:
+00061 
+00062     eoStat(T _value, std::string _description)
+00063         : eoValueParam<T>(_value, _description)
+00064         {}
+00065 
+00066     virtual std::string className(void) const
+00067         { return "eoStat"; }
+00068 };
+00069 
+00070 
+00071 
+00075 template <class EOT>
+00076 class eoSortedStatBase : public eoUF<const std::vector<const EOT*>&, void>
+00077 {
+00078 public:
+00079   virtual void lastCall(const std::vector<const EOT*>&) {}
+00080   virtual std::string className(void) const { return "eoSortedStatBase"; }
+00081 };
+00082 
+00088 template <class EOT, class ParamType>
+00089 class eoSortedStat : public eoSortedStatBase<EOT>, public eoValueParam<ParamType>
+00090 {
+00091 public :
+00092   eoSortedStat(ParamType _value, std::string _desc) : eoValueParam<ParamType>(_value, _desc) {}
+00093   virtual std::string className(void) const { return "eoSortedStat"; }
+00094 };
+00095 
+00105 #ifdef _MSC_VER
+00106 template <class EOT> class eoAverageStat : public eoStat<EOT, EOT::Fitness>
+00107 #else
+00108 template <class EOT> class eoAverageStat : public eoStat<EOT, typename EOT::Fitness>
+00109 #endif
+00110 {
+00111 public :
+00112 
+00113     using eoStat<EOT, typename EOT::Fitness>::value;
+00114 
+00115     typedef typename EOT::Fitness Fitness;
+00116 
+00117     eoAverageStat(std::string _description = "Average Fitness")
+00118       : eoStat<EOT, Fitness>(Fitness(), _description) {}
+00119 
+00120     static Fitness sumFitness(double _sum, const EOT& _eot){
+00121         _sum += _eot.fitness();
+00122         return _sum;
+00123     }
+00124 
+00125     eoAverageStat(double _value, std::string _desc) : eoStat<EOT, double>(_value, _desc) {}
+00126 
+00127     virtual void operator()(const eoPop<EOT>& _pop){
+00128       doit(_pop, Fitness()); // specializations for scalar and std::vector
+00129     }
+00130 
+00131   virtual std::string className(void) const { return "eoAverageStat"; }
+00132 
+00133 private :
+00134 
+00135     // Specialization for pareto fitness
+00136     template <class T>
+00137     void doit(const eoPop<EOT>& _pop, eoParetoFitness<T>)
+00138     {
+00139       value().clear();
+00140       value().resize(_pop[0].fitness().size(), 0.0);
+00141 
+00142       for (unsigned o = 0; o < value().size(); ++o)
+00143       {
+00144         for (unsigned i = 0; i < _pop.size(); ++i)
+00145         {
+00146           value()[o] += _pop[i].fitness()[o];
+00147         }
+00148 
+00149         value()[o] /= _pop.size();
+00150       }
+00151     }
+00152 
+00153     // Default behavior
+00154     template <class T>
+00155     void doit(const eoPop<EOT>& _pop, T)
+00156     {
+00157         Fitness v = std::accumulate(_pop.begin(), _pop.end(), Fitness(0.0), eoAverageStat::sumFitness);
+00158 
+00159         value() = v / _pop.size();
+00160     }
+00161 
+00162 };
+00163 
+00167 template <class EOT>
+00168 class eoSecondMomentStats : public eoStat<EOT, std::pair<double, double> >
+00169 {
+00170 public :
+00171 
+00172     using eoStat<EOT, std::pair<double, double> >::value;
+00173 
+00174     typedef typename EOT::Fitness fitness_type;
+00175 
+00176     typedef std::pair<double, double> SquarePair;
+00177 
+00178     eoSecondMomentStats(std::string _description = "Average & Stdev")
+00179         : eoStat<EOT, SquarePair>(std::make_pair(0.0,0.0), _description)
+00180         {}
+00181 
+00182     static SquarePair sumOfSquares(SquarePair _sq, const EOT& _eo)
+00183     {
+00184         double fitness = _eo.fitness();
+00185 
+00186         _sq.first += fitness;
+00187         _sq.second += fitness * fitness;
+00188         return _sq;
+00189     }
+00190 
+00191     virtual void operator()(const eoPop<EOT>& _pop)
+00192     {
+00193         SquarePair result = std::accumulate(_pop.begin(), _pop.end(), std::make_pair(0.0, 0.0), eoSecondMomentStats::sumOfSquares);
+00194 
+00195         double n = _pop.size();
+00196         value().first = result.first / n; // average
+00197         value().second = sqrt( (result.second - n * value().first * value().first) / (n - 1.0)); // stdev
+00198     }
+00199 
+00200   virtual std::string className(void) const { return "eoSecondMomentStats"; }
+00201 };
+00202 
+00206 #ifdef _MSC_VER
+00207 template <class EOT>
+00208 class eoNthElementFitnessStat : public eoSortedStat<EOT, EOT::Fitness >
+00209 #else
+00210 template <class EOT>
+00211 class eoNthElementFitnessStat : public eoSortedStat<EOT, typename EOT::Fitness >
+00212 #endif
+00213 {
+00214 public :
+00215     using eoSortedStat<EOT, typename EOT::Fitness >::value;
+00216 
+00217     typedef typename EOT::Fitness Fitness;
+00218 
+00219     eoNthElementFitnessStat(unsigned _whichElement, std::string _description = "nth element fitness")
+00220       : eoSortedStat<EOT, Fitness>(Fitness(), _description), whichElement(_whichElement) {}
+00221 
+00222     virtual void operator()(const std::vector<const EOT*>& _pop)
+00223     {
+00224         if (whichElement > _pop.size())
+00225             throw std::logic_error("fitness requested of element outside of pop");
+00226 
+00227         doit(_pop, Fitness());
+00228     }
+00229 
+00230   virtual std::string className(void) const { return "eoNthElementFitnessStat"; }
+00231 private :
+00232 
+00233     struct CmpFitness
+00234     {
+00235       CmpFitness(unsigned _whichElement, bool _maxim) : whichElement(_whichElement), maxim(_maxim) {}
+00236 
+00237       bool operator()(const EOT* a, const EOT* b)
+00238       {
+00239         if (maxim)
+00240           return a->fitness()[whichElement] > b->fitness()[whichElement];
+00241 
+00242         return a->fitness()[whichElement] < b->fitness()[whichElement];
+00243       }
+00244 
+00245       unsigned whichElement;
+00246       bool maxim;
+00247     };
+00248 
+00249     // Specialization for eoParetoFitness
+00250     template <class T>
+00251     void doit(const eoPop<EOT>& _pop, eoParetoFitness<T>)
+00252     {
+00253       typedef typename EOT::Fitness::fitness_traits traits;
+00254 
+00255       value().resize(traits::nObjectives());
+00256 
+00257       // copy of pointers, what the heck
+00258       std::vector<const EOT*> tmp_pop = _pop;
+00259 
+00260       for (unsigned o = 0; o < value().size(); ++o)
+00261       {
+00262         typename std::vector<const EOT*>::iterator nth = tmp_pop.begin() + whichElement;
+00263         std::nth_element(tmp_pop.begin(), nth, tmp_pop.end(), CmpFitness(o, traits::maximizing(o)));
+00264         value()[o] = (*nth)->fitness()[o];
+00265       }
+00266     }
+00267 
+00268     // for everything else
+00269     template <class T>
+00270     void doit(const std::vector<const EOT*>& _pop, T)
+00271     {
+00272       value() = _pop[whichElement]->fitness();
+00273     }
+00274 
+00275     unsigned whichElement;
+00276 };
+00277 
+00278 /* Actually, you shouldn't need to sort the population to get the best fitness
+00279    MS - 17/11/00
+00280 
+00281    But then again, if another stat needs sorted fitness anyway, getting the best
+00282    out would be very fast.
+00283    MK - 09/01/03
+00284 
+00285 template <class EOT>
+00286 class eoBestFitnessStat : public eoStat<EOT, typename EOT::Fitness >
+00287 {
+00288 public :
+00289     typedef typename EOT::Fitness Fitness;
+00290 
+00291     eoBestFitnessStat(std::string _description = "Best Fitness") :
+00292       eoStat<EOT, Fitness>(Fitness(), _description) {}
+00293 
+00294     virtual void operator()(const eoPop<EOT>& _pop)
+00295     {
+00296         value() = _pop.nth_element_fitness(0);
+00297     }
+00298 
+00299 };
+00300 */
+00301 
+00311 #ifdef _MSC_VER
+00312 template <class EOT>
+00313 class eoBestFitnessStat : public eoStat<EOT, EOT::Fitness>
+00314 #else
+00315 template <class EOT>
+00316 class eoBestFitnessStat : public eoStat<EOT, typename EOT::Fitness>
+00317 #endif
+00318 {
+00319 public:
+00320 
+00321     using eoStat<EOT, typename EOT::Fitness>::value;
+00322 
+00323     typedef typename EOT::Fitness Fitness;
+00324 
+00325     eoBestFitnessStat(std::string _description = "Best ")
+00326         : eoStat<EOT, Fitness>(Fitness(), _description)
+00327         {}
+00328 
+00329     void operator()(const eoPop<EOT>& _pop) {
+00330         doit(_pop, Fitness() ); // specializations for scalar and std::vector
+00331     }
+00332 
+00333     virtual std::string className(void) const { return "eoBestFitnessStat"; }
+00334 
+00335 
+00336 private :
+00337 
+00338     struct CmpFitness
+00339     {
+00340       CmpFitness(unsigned _which, bool _maxim) : which(_which), maxim(_maxim) {}
+00341 
+00342       bool operator()(const EOT& a, const EOT& b)
+00343       {
+00344         if (maxim)
+00345           return a.fitness()[which] < b.fitness()[which];
+00346 
+00347         return a.fitness()[which] > b.fitness()[which];
+00348       }
+00349 
+00350       unsigned which;
+00351       bool maxim;
+00352     };
+00353 
+00354     // Specialization for pareto fitness
+00355     template <class T>
+00356     void doit(const eoPop<EOT>& _pop, eoParetoFitness<T>)
+00357     {
+00358       typedef typename EOT::Fitness::fitness_traits traits;
+00359       value().resize(traits::nObjectives());
+00360 
+00361       for (unsigned o = 0; o < traits::nObjectives(); ++o)
+00362       {
+00363         typename eoPop<EOT>::const_iterator it = std::max_element(_pop.begin(), _pop.end(), CmpFitness(o, traits::maximizing(o)));
+00364         value()[o] = it->fitness()[o];
+00365       }
+00366     }
+00367 
+00368     // default
+00369     template<class T>
+00370     void doit(const eoPop<EOT>& _pop, T)
+00371     { // find the largest elements
+00372       value() = _pop.best_element().fitness();
+00373     }
+00374 
+00375 };
+00376 
+00377 template <class EOT>
+00378 class eoDistanceStat : public eoStat<EOT, double>
+00379 {
+00380 public:
+00381 
+00382     using eoDistanceStat< EOT >::value;
+00383 
+00384     eoDistanceStat(std::string _name = "distance")
+00385         : eoStat<EOT, double>(0.0, _name)
+00386         {}
+00387 
+00388     template <class T>
+00389     double distance(T a, T b)
+00390     {
+00391         T res = a-b;
+00392         return res < 0? -res : res;
+00393     }
+00394 
+00395     double distance(bool a, bool b)
+00396     {
+00397         return (a==b)? 0 : 1;
+00398     }
+00399 
+00400     void operator()(const eoPop<EOT>& _pop)
+00401     {
+00402         double& v = value();
+00403         v = 0.0;
+00404 
+00405         for (unsigned i = 0; i < _pop.size(); ++i)
+00406         {
+00407             for (unsigned j = 0; j < _pop.size(); ++j)
+00408             {
+00409                 for (unsigned k = 0; k < _pop[i].size(); ++k)
+00410                 {
+00411                     v += distance(_pop[i][k], _pop[j][k]);
+00412                 }
+00413             }
+00414         }
+00415 
+00416         double sz = _pop.size();
+00417         v /= sz * sz * _pop[0].size();
+00418     }
+00419   virtual std::string className(void) const { return "eoDistanceStat"; }
+00420 
+00421 };
+00422 
+00423 
+00424 
+00425 /*
+00426 template <class EOT>
+00427 class eoStdevStat : public eoStat<EOT, double >
+00428 {
+00429 public :
+00430     typedef typename eoSecondMomentStats<EOT>::SquarePair SquarePair;
+00431 
+00432     eoStdevStat(std::string _description = "Stdev") : eoStat<EOT, double>(0.0, _description) {}
+00433 
+00434     virtual void operator()(const eoPop<EOT>& _pop)
+00435     {
+00436         SquarePair result = std::accumulate(pop.begin(), pop.end(), std::make_pair(0.0, 0.0), eoSecondMomentStats::sumOfSquares);
+00437 
+00438         double n = pop.size();
+00439         value() = sqrt( (result.second - (result.first / n)) / (n - 1.0)); // stdev
+00440     }
+00441 };
+00442 */
+00443 #endif
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_state_8cpp-source.html b/trunk/paradiseo-eo/doc/html/eo_state_8cpp-source.html new file mode 100644 index 000000000..855bdaa2a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_state_8cpp-source.html @@ -0,0 +1,210 @@ + + +EO: eoState.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoState.cpp

00001 #ifdef _MSC_VER
+00002 #pragma warning(disable:4786)
+00003 #endif
+00004 
+00005 #ifdef HAVE_CONFIG_H
+00006 #include <config.h>
+00007 #endif
+00008 
+00009 #include <algorithm>
+00010 #include <fstream>
+00011 #include <sstream>
+00012 
+00013 #include "eoState.h"
+00014 #include "eoObject.h"
+00015 #include "eoPersistent.h"
+00016 
+00017 using namespace std;
+00018 
+00019 
+00020 
+00021 void removeComment(string& str, string comment)
+00022 {
+00023     string::size_type pos = str.find(comment);
+00024 
+00025     if (pos != string::npos)
+00026     {
+00027         str.erase(pos, str.size());
+00028     }
+00029 }
+00030 
+00031 bool is_section(const string& str, string& name)
+00032 {
+00033     string::size_type pos = str.find("\\section{");
+00034 
+00035     if (pos == string::npos)
+00036         return false;
+00037     //else
+00038 
+00039     string::size_type end = str.find("}");
+00040 
+00041     if (end == string::npos)
+00042         return false;
+00043     // else
+00044 
+00045     name = str.substr(pos + 9, end-9);
+00046 
+00047     return true;
+00048 }
+00049 
+00050 eoState::~eoState(void)
+00051 {
+00052     for (unsigned i = 0; i < ownedObjects.size(); ++i)
+00053     {
+00054         delete ownedObjects[i];
+00055     }
+00056 }
+00057 
+00058 void eoState::registerObject(eoPersistent& registrant)
+00059 {
+00060     string name = createObjectName(dynamic_cast<eoObject*>(&registrant));
+00061 
+00062     pair<ObjectMap::iterator,bool> res = objectMap.insert(make_pair(name, &registrant));
+00063 
+00064     if (res.second == true)
+00065     {
+00066         creationOrder.push_back(res.first);
+00067     }
+00068     else
+00069     {
+00070         throw logic_error("Interval error: object already present in the state");
+00071     }
+00072 }
+00073 
+00074 void eoState::load(const string& _filename)
+00075 {
+00076     ifstream is (_filename.c_str());
+00077 
+00078     if (!is)
+00079     {
+00080         string str = "Could not open file " + _filename;
+00081         throw runtime_error(str);
+00082     }
+00083 
+00084     load(is);
+00085 }
+00086 
+00087 void eoState::load(std::istream& is)
+00088 {
+00089     string str;
+00090     string name;
+00091 
+00092     getline(is, str);
+00093 
+00094     if (is.fail())
+00095     {
+00096         string str = "Error while reading stream";
+00097         throw runtime_error(str);
+00098     }
+00099 
+00100     while(! is.eof())
+00101     { // parse section header
+00102         if (is_section(str, name))
+00103         {
+00104             string fullString;
+00105             ObjectMap::iterator it = objectMap.find(name);
+00106 
+00107             if (it == objectMap.end())
+00108             { // ignore
+00109                 while (getline(is, str))
+00110                 {
+00111                     if (is_section(str, name))
+00112                         break;
+00113                 }
+00114             }
+00115             else
+00116             {
+00117 
+00118                 eoPersistent* object = it->second;
+00119 
+00120                 // now we have the object, get lines, remove comments etc.
+00121 
+00122                 string fullstring;
+00123 
+00124                 while (getline(is, str))
+00125                 {
+00126                   if (is.eof())
+00127                     throw runtime_error("No section in load file");
+00128                   if (is_section(str, name))
+00129                     break;
+00130 
+00131                     removeComment(str, getCommentString());
+00132                     fullstring += str + "\n";
+00133                 }
+00134                 istringstream the_stream(fullstring);
+00135                 object->readFrom(the_stream);
+00136             }
+00137         }
+00138         else // if (is_section(str, name)) - what if file empty
+00139           {
+00140             getline(is, str);   // try next line!
+00141             //      if (is.eof())
+00142             //        throw runtime_error("No section in load file");
+00143           }
+00144     }
+00145 
+00146 }
+00147 
+00148 void eoState::save(const string& filename) const
+00149 { // saves in order of insertion
+00150     ofstream os(filename.c_str());
+00151 
+00152     if (!os)
+00153     {
+00154         string msg = "Could not open file: " + filename + " for writing!";
+00155         throw runtime_error(msg);
+00156     }
+00157 
+00158     save(os);
+00159 }
+00160 
+00161 void eoState::save(std::ostream& os) const
+00162 { // saves in order of insertion
+00163     for (vector<ObjectMap::iterator>::const_iterator it = creationOrder.begin(); it != creationOrder.end(); ++it)
+00164     {
+00165         os << "\\section{" << (*it)->first << "}\n";
+00166         (*it)->second->printOn(os);
+00167         os << '\n';
+00168     }
+00169 }
+00170 
+00171 string eoState::createObjectName(eoObject* obj)
+00172 {
+00173     if (obj == 0)
+00174     {
+00175         ostringstream os;
+00176         os << objectMap.size();
+00177         return os.str();
+00178     }
+00179     // else
+00180 
+00181     string name = obj->className();
+00182     ObjectMap::const_iterator it = objectMap.find(name);
+00183 
+00184     unsigned count = 1;
+00185     while (it != objectMap.end())
+00186     {
+00187         ostringstream os;
+00188         os << obj->className().c_str() << count++;
+00189         name = os.str();
+00190         it = objectMap.find(name);
+00191     }
+00192 
+00193     return name;
+00194 }
+00195 
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_state_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_state_8h-source.html new file mode 100644 index 000000000..a1d2586a9 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_state_8h-source.html @@ -0,0 +1,105 @@ + + +EO: eoState.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoState.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoState.h
+00005 // (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef eoState_h
+00028 #define eoState_h
+00029 
+00030 #include <stdexcept>
+00031 #include <string>
+00032 #include <map>
+00033 #include <vector>
+00034 
+00035 #include <eoFunctorStore.h>
+00036 
+00037 class eoObject;
+00038 class eoPersistent;
+00039 
+00054 class eoState : public eoFunctorStore
+00055 {
+00056 public :
+00057 
+00058     eoState(void) {}
+00059 
+00060     ~eoState(void);
+00061 
+00065     void registerObject(eoPersistent& registrant);
+00066 
+00072     template <class T>
+00073     T&   takeOwnership(const T& persistent)
+00074     {
+00075         // If the compiler budges here, T is not a subclass of eoPersistent
+00076         ownedObjects.push_back(new T(persistent));
+00077         return static_cast<T&>(*ownedObjects.back());
+00078     }
+00079 
+00083     struct loading_error : public std::runtime_error
+00084     {
+00085         loading_error(std::string huh = "Error while loading") : std::runtime_error(huh) {}
+00086     };
+00087 
+00088     std::string getCommentString(void) const { return "#"; }
+00089 
+00095     void load(const std::string& _filename);
+00096 
+00102     void load(std::istream& is);
+00103 
+00109     void save(const std::string& _filename) const;
+00110 
+00116     void save(std::ostream& os) const;
+00117 
+00118 private :
+00119     std::string createObjectName(eoObject* obj);
+00120 
+00121     // first is Persistent, second is the raw data associated with it.
+00122     typedef std::map<std::string, eoPersistent*> ObjectMap;
+00123 
+00124     ObjectMap objectMap;
+00125 
+00126     std::vector<ObjectMap::iterator> creationOrder;
+00127     std::vector<eoPersistent*> ownedObjects;
+00128 
+00129     // private copy and assignment as eoState is supposed to be unique
+00130     eoState(const eoState&);
+00131     eoState& operator=(const eoState&);
+00132 
+00133 };
+00134 
+00135 #endif
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_stdout_monitor_8cpp-source.html b/trunk/paradiseo-eo/doc/html/eo_stdout_monitor_8cpp-source.html new file mode 100644 index 000000000..174b7aeaf --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_stdout_monitor_8cpp-source.html @@ -0,0 +1,70 @@ + + +EO: eoStdoutMonitor.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoStdoutMonitor.cpp

00001 #ifdef _MSC_VER
+00002 // to avoid long name warnings
+00003 #pragma warning(disable:4786)
+00004 #endif 
+00005 
+00006 #include <iostream>
+00007 #include <fstream>
+00008 #include <stdexcept>
+00009 
+00010 #include <utils/eoStdoutMonitor.h>
+00011 #include <utils/compatibility.h>
+00012 #include <utils/eoParam.h>
+00013 
+00014 using namespace std;
+00015 
+00016 eoMonitor& eoStdoutMonitor::operator()(void)
+00017 {
+00018     if (!cout)
+00019     {
+00020         string str = "eoStdoutMonitor: Could not write to cout";
+00021         throw runtime_error(str);
+00022     }
+00023     if (firsttime)
+00024     {
+00025       if (verbose)
+00026         cout << "First Generation" << endl;
+00027       else
+00028         {
+00029           for(iterator it = vec.begin(); it != vec.end(); ++it)
+00030             {
+00031               cout << (*it)->longName() << delim;
+00032             }
+00033           cout << endl;
+00034         }
+00035         firsttime = false;
+00036     }
+00037     // ok, now the real saving. write out
+00038     if (verbose)
+00039       {
+00040       for(iterator it = vec.begin(); it != vec.end(); ++it)
+00041         {
+00042           cout << (*it)->longName() << ": " << (*it)->getValue() << '\n';
+00043         }
+00044       cout << "\n****** End of Generation ******\n" << endl;
+00045       }
+00046     else                        // a one-liner
+00047       {
+00048         for(iterator it = vec.begin(); it != vec.end(); ++it)
+00049           {
+00050             cout << (*it)->getValue() << delim;
+00051           }
+00052         cout << endl;
+00053       }
+00054     return *this;
+00055 }
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_stdout_monitor_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_stdout_monitor_8h-source.html new file mode 100644 index 000000000..0f9218b90 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_stdout_monitor_8h-source.html @@ -0,0 +1,64 @@ + + +EO: eoStdoutMonitor.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoStdoutMonitor.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoStdoutMonitor.h
+00005 // (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoStdoutMonitor_h
+00028 #define _eoStdoutMonitor_h
+00029 
+00030 #include <string>
+00031 
+00032 #include <utils/eoMonitor.h>
+00033 #include <eoObject.h>
+00034 
+00038 class eoStdoutMonitor : public eoMonitor
+00039 {
+00040 public :
+00041     eoStdoutMonitor(bool _verbose=true, std::string _delim = "\t") : 
+00042       verbose(_verbose), delim(_delim), firsttime(true) {}
+00043     eoMonitor& operator()(void);
+00044 
+00045   virtual std::string className(void) const { return "eoStdoutMonitor"; }
+00046 private :
+00047   bool verbose;
+00048   std::string delim;
+00049   bool firsttime;
+00050 };
+00051 
+00052 #endif
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_steady_fit_continue_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_steady_fit_continue_8h-source.html new file mode 100644 index 000000000..04994046a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_steady_fit_continue_8h-source.html @@ -0,0 +1,117 @@ + + +EO: eoSteadyFitContinue.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoSteadyFitContinue.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoSteadyFitContinue.h
+00005 // (c) GeNeura Team, 1999, Marc Schoenauer, 2000
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022  */
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef _eoSteadyFitContinue_h
+00026 #define _eoSteadyFitContinue_h
+00027 
+00028 #include <eoContinue.h>
+00029 
+00034 template< class EOT>
+00035 class eoSteadyFitContinue: public eoContinue<EOT>
+00036 {
+00037 public:
+00038   typedef typename EOT::Fitness Fitness;
+00039 
+00041   eoSteadyFitContinue( unsigned long _minGens, unsigned long _steadyGens)
+00042     : repMinGenerations( _minGens ), repSteadyGenerations( _steadyGens),
+00043       steadyState(false), thisGenerationPlaceHolder(0),
+00044       thisGeneration(thisGenerationPlaceHolder){};
+00045         
+00047   eoSteadyFitContinue( unsigned long _minGens, unsigned long _steadyGen,
+00048                  unsigned long& _currentGen)
+00049     : repMinGenerations( _minGens ), repSteadyGenerations( _steadyGen),
+00050       steadyState(_currentGen>_minGens), thisGenerationPlaceHolder(0),
+00051       thisGeneration(_currentGen){};
+00052 
+00055   virtual bool operator() ( const eoPop<EOT>& _vEO ) {
+00056     thisGeneration++;
+00057     //    std::cout << " [" << thisGeneration << "] ";
+00058     Fitness bestCurrentFitness = _vEO.nth_element_fitness(0);
+00059 
+00060     if (steadyState) {     // already after MinGenenerations
+00061       if (bestCurrentFitness > bestSoFar) {
+00062         bestSoFar = bestCurrentFitness;
+00063         lastImprovement = thisGeneration;
+00064       } else {
+00065         if (thisGeneration - lastImprovement > repSteadyGenerations) {
+00066           std::cout << "STOP in eoSteadyFitContinue: Done " << repSteadyGenerations 
+00067                << " generations without improvement\n";
+00068           return false;
+00069         }
+00070       } 
+00071     } else {               // not yet in steady state
+00072       if (thisGeneration > repMinGenerations) { // go to steady state
+00073         steadyState = true;
+00074         bestSoFar = bestCurrentFitness;
+00075         lastImprovement = thisGeneration;
+00076         std::cout << "eoSteadyFitContinue: Done the minimum number of generations\n";
+00077       }
+00078     }
+00079     return true;
+00080   }
+00081 
+00084   virtual void totalGenerations( unsigned long _mg, unsigned long _sg ) { 
+00085     repMinGenerations = _mg; 
+00086     repSteadyGenerations = _sg;
+00087     reset();
+00088   };
+00089 
+00091   virtual void reset () {
+00092     steadyState=false;
+00093     thisGeneration = 0;
+00094   }
+00095 
+00097   virtual unsigned long minGenerations( ) 
+00098   {  return repMinGenerations;  };
+00099   virtual unsigned long steadyGenerations( ) 
+00100   {  return repSteadyGenerations;       };
+00101     
+00102   virtual std::string className(void) const { return "eoSteadyFitContinue"; }
+00103 private:
+00104   unsigned long repMinGenerations;
+00105   unsigned long  repSteadyGenerations;
+00106   bool steadyState;
+00107   unsigned long thisGenerationPlaceHolder;
+00108   unsigned long& thisGeneration;
+00109   unsigned int lastImprovement;
+00110   Fitness bestSoFar;
+00111 };
+00112 
+00113 #endif
+00114 
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_stoch_tournament_select_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_stoch_tournament_select_8h-source.html new file mode 100644 index 000000000..654a41189 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_stoch_tournament_select_8h-source.html @@ -0,0 +1,83 @@ + + +EO: eoStochTournamentSelect.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoStochTournamentSelect.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoStochTournamentSelect.h
+00005 // (c) GeNeura Team, 1998 - EEAAX 1999
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef eoStochTournamentSelect_h
+00027 #define eoStochTournamentSelect_h
+00028 
+00029 //-----------------------------------------------------------------------------
+00030 
+00031 #include <functional>
+00032 #include <numeric>           // accumulate
+00033 #include <eoSelectOne.h>     // eoSelectOne
+00034 #include <utils/selectors.h> // stochastic_tournament
+00035 
+00036 //-----------------------------------------------------------------------------
+00040 //-----------------------------------------------------------------------------
+00041 
+00042 template <class EOT> class eoStochTournamentSelect: public eoSelectOne<EOT>
+00043 {
+00044  public:
+00045 
+00047   eoStochTournamentSelect(double _Trate = 1.0 ) : eoSelectOne<EOT>(), Trate(_Trate) 
+00048   {
+00049     // consistency checks
+00050     if (Trate < 0.5) {
+00051       std::cerr << "Warning, Tournament rate should be > 0.5\nAdjusted to 0.55\n";
+00052       Trate = 0.55;
+00053     }
+00054     if (Trate > 1) {
+00055       std::cerr << "Warning, Tournament rate should be < 1\nAdjusted to 1\n";
+00056       Trate = 1;
+00057     }
+00058   }
+00059   
+00061   virtual const EOT& operator()(const eoPop<EOT>& pop) 
+00062   {
+00063       return stochastic_tournament(pop, Trate);
+00064   }
+00065   
+00066 private:
+00067   double Trate;
+00068 };
+00069 
+00070 //-----------------------------------------------------------------------------
+00071 
+00072 #endif
+00073 
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_stochastic_universal_select_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_stochastic_universal_select_8h-source.html new file mode 100644 index 000000000..56528e80d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_stochastic_universal_select_8h-source.html @@ -0,0 +1,117 @@ + + +EO: eoStochasticUniversalSelect.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoStochasticUniversalSelect.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoStochasticUniversalSelect.h
+00005 // (c) Maarten Keijzer 2003
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@cs.vu.nl
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef eoStochasticUniversalSelect_h
+00028 #define eoStochasticUniversalSelect_h
+00029 
+00030 //-----------------------------------------------------------------------------
+00031 
+00032 #include <utils/eoRNG.h>
+00033 #include <eoSelectOne.h>
+00034 #include <utils/selectors.h>
+00035 #include <eoPop.h>
+00036 
+00037 //-----------------------------------------------------------------------------
+00042 //-----------------------------------------------------------------------------
+00043 
+00044 template <class EOT> class eoStochasticUniversalSelect: public eoSelectOne<EOT>
+00045 {
+00046 public:
+00048   eoStochasticUniversalSelect(const eoPop<EOT>& pop = eoPop<EOT>())
+00049   {
+00050     if (minimizing_fitness<EOT>())
+00051       throw std::logic_error("eoStochasticUniversalSelect: minimizing fitness");
+00052   }
+00053 
+00054   void setup(const eoPop<EOT>& _pop)
+00055   {
+00056       if (_pop.size() == 0) return;
+00057 
+00058       std::vector<typename EOT::Fitness> cumulative(_pop.size());
+00059 
+00060       cumulative[0] = _pop[0].fitness();
+00061       for (unsigned i = 1; i < _pop.size(); ++i)
+00062       {
+00063           cumulative[i] = _pop[i].fitness() + cumulative[i-1];
+00064       }
+00065 
+00066       indices.reserve(_pop.size());
+00067       indices.resize(0);
+00068 
+00069       double fortune = rng.uniform() * cumulative.back();
+00070       double step = cumulative.back() / double(_pop.size());
+00071 
+00072       unsigned i = std::upper_bound(cumulative.begin(), cumulative.end(), fortune) - cumulative.begin();
+00073 
+00074       while (indices.size() < _pop.size()) {
+00075 
+00076           while (cumulative[i] < fortune) {i++;} // linear search is good enough as we average one step each time
+00077 
+00078           indices.push_back(i);
+00079           fortune += step;
+00080           if (fortune >= cumulative.back()) { // start at the beginning
+00081               fortune -= cumulative.back();
+00082               i = 0;
+00083           }
+00084       }
+00085       // shuffle
+00086       for (int i = indices.size() - 1; i > 0; --i) {
+00087           int j = rng.random(i+1);
+00088           std::swap(indices[i], indices[j]);
+00089       }
+00090   }
+00091 
+00094   const EOT& operator()(const eoPop<EOT>& _pop)
+00095   {
+00096       if (indices.empty()) setup(_pop);
+00097 
+00098       unsigned index = indices.back();
+00099       indices.pop_back();
+00100       return _pop[index];
+00101   }
+00102 
+00103 private :
+00104 
+00105   typedef std::vector<unsigned> IndexVec;
+00106   IndexVec indices;
+00107 };
+00108 
+00109 #endif
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_string_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_string_8h-source.html new file mode 100644 index 000000000..b03b9478b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_string_8h-source.html @@ -0,0 +1,85 @@ + + +EO: eoString.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / other
+

eoString.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoString.h
+00005 // (c) GeNeura Team, 1998
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022  */
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef _eoString_H
+00026 #define _eoString_H
+00027 
+00028 // STL libraries
+00029 #include <iostream>
+00030 #include <string>
+00031 #include <stdexcept>
+00032 
+00033 
+00034 #include <EO.h>
+00035 
+00036 //-----------------------------------------------------------------------------
+00037 // eoString
+00038 //-----------------------------------------------------------------------------
+00039 
+00041 template <class fitnessT >
+00042 class eoString: public EO<fitnessT>, public std::string
+00043 {
+00044 public:
+00045 
+00046     typedef char Type;
+00047     typedef char AtomType;
+00048     typedef std::string   ContainerType;
+00049 
+00050 
+00052 
+00053 
+00054   eoString( const std::string& _str ="" )
+00055     : std::string( _str ) {};
+00056 
+00058   virtual void printOn(std::ostream& os) const
+00059   {
+00060     EO<fitnessT>::printOn(os);
+00061     os << ' ';
+00062 
+00063     os << size() << ' ' << substr() << std::endl;
+00064 
+00065   }
+00066 
+00074   virtual std::string className() const {return "eoString";};
+00076 
+00077 
+00078 };
+00079 
+00080 #endif
+00081 
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_survive_and_die_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_survive_and_die_8h-source.html new file mode 100644 index 000000000..45c92656e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_survive_and_die_8h-source.html @@ -0,0 +1,150 @@ + + +EO: eoSurviveAndDie.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoSurviveAndDie.h

00001 
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoSurviveAndDie_h
+00028 #define _eoSurviveAndDie_h
+00029 
+00030 
+00031 //-----------------------------------------------------------------------------
+00032 #include <eoPop.h>
+00033 #include <eoFunctor.h>
+00034 #include <eoMerge.h>
+00035 #include <eoReduce.h>
+00036 #include <utils/eoHowMany.h>
+00037 //-----------------------------------------------------------------------------
+00038 
+00052 template <class EOT>
+00053 class eoSurviveAndDie : public eoBF<eoPop<EOT> &, eoPop<EOT> &, void>
+00054 {
+00055 public:
+00056     eoSurviveAndDie(double _survive, double _die, bool _interpret_as_rate = true):
+00057         howmanySurvive(_survive, _interpret_as_rate),
+00058         howmanyDie(_die, _interpret_as_rate)
+00059     {}
+00060 
+00061 protected:
+00062     eoHowMany howmanySurvive;
+00063     eoHowMany howmanyDie;
+00064 
+00065 };
+00066 
+00072 template <class EOT>
+00073 class eoDeterministicSurviveAndDie : public eoSurviveAndDie<EOT>
+00074 {
+00075 public:
+00076 
+00077     using eoSurviveAndDie< EOT >::howmanyDie;
+00078     using eoSurviveAndDie< EOT >::howmanySurvive;
+00079 
+00081     eoDeterministicSurviveAndDie(double _survive, double _die, bool _interpret_as_rate = true)
+00082         : eoSurviveAndDie< EOT >(_survive, _die, _interpret_as_rate)
+00083     {}
+00084 
+00085 
+00086     void operator()(eoPop<EOT> & _pop, eoPop<EOT> & _luckyGuys)
+00087     {
+00088         unsigned pSize = _pop.size();
+00089         unsigned nbSurvive = howmanySurvive(pSize);
+00090         // first, save the best into _luckyGuys
+00091         if (nbSurvive)
+00092             {
+00093                 _pop.nth_element(nbSurvive);
+00094                 // copy best
+00095                 _luckyGuys.resize(nbSurvive);
+00096                 std::copy(_pop.begin(), _pop.begin()+nbSurvive, _luckyGuys.begin());
+00097                 // erase them from pop
+00098                 _pop.erase(_pop.begin(), _pop.begin()+nbSurvive);
+00099             }
+00100         unsigned nbRemaining = _pop.size();
+00101 
+00102         // carefull, we can have a rate of 1 if we want to kill all remaining
+00103         unsigned nbDie = std::min(howmanyDie(pSize), pSize-nbSurvive);
+00104         if (nbDie > nbRemaining)
+00105             throw std::logic_error("eoDeterministicSurviveAndDie: Too many to kill!\n");
+00106 
+00107         if (!nbDie)
+00108           {
+00109             return;
+00110           }
+00111         // else
+00112         // kill the worse nbDie
+00113         _pop.nth_element(nbRemaining-nbDie);
+00114         _pop.resize(nbRemaining-nbDie);
+00115     }
+00116 
+00117 };
+00118 
+00131 template <class EOT>
+00132 class eoDeterministicSaDReplacement : public eoReplacement<EOT>
+00133 {
+00134 public:
+00136   eoDeterministicSaDReplacement(eoReduce<EOT>& _reduceGlobal,
+00137                  double _surviveParents, double _dieParents=0,
+00138                  double _surviveOffspring=0, double _dieOffspring=0,
+00139                  bool _interpret_as_rate = true ) :
+00140         reduceGlobal(_reduceGlobal),
+00141         sAdParents(_surviveParents, _dieParents, _interpret_as_rate),
+00142         sAdOffspring(_surviveOffspring, _dieOffspring, _interpret_as_rate)
+00143     {}
+00144 
+00146     eoDeterministicSaDReplacement(
+00147                  double _surviveParents, double _dieParents=0,
+00148                  double _surviveOffspring=0, double _dieOffspring=0,
+00149                  bool _interpret_as_rate = true ) :
+00150         reduceGlobal(truncate),
+00151         sAdParents(_surviveParents, _dieParents, _interpret_as_rate),
+00152         sAdOffspring(_surviveOffspring, _dieOffspring, _interpret_as_rate)
+00153     {}
+00154 
+00155     void operator()(eoPop<EOT>& _parents, eoPop<EOT>& _offspring)
+00156     {
+00157         unsigned pSize = _parents.size(); // target number of individuals
+00158 
+00159         eoPop<EOT> luckyParents;       // to hold the absolute survivors
+00160         sAdParents(_parents, luckyParents);
+00161 
+00162         eoPop<EOT> luckyOffspring;       // to hold the absolute survivors
+00163         sAdOffspring(_offspring, luckyOffspring);
+00164 
+00165         unsigned survivorSize = luckyOffspring.size() + luckyParents.size();
+00166         if (survivorSize > pSize)
+00167             throw std::logic_error("eoGeneralReplacement: More survivors than parents!\n");
+00168 
+00169         plus(_parents, _offspring); // all that remain in _offspring
+00170 
+00171         reduceGlobal(_offspring, pSize - survivorSize);
+00172         plus(luckyParents, _offspring);
+00173         plus(luckyOffspring, _offspring);
+00174 
+00175         _parents.swap(_offspring);
+00176 
+00177     }
+00178 
+00179 private :
+00180   eoReduce<EOT>& reduceGlobal;
+00181   eoDeterministicSurviveAndDie<EOT> sAdParents;
+00182   eoDeterministicSurviveAndDie<EOT> sAdOffspring;
+00183   // plus helper (could be replaced by operator+= ???)
+00184   eoPlus<EOT> plus;
+00185   // the default reduce: deterministic truncation
+00186   eoTruncate<EOT> truncate;
+00187 };
+00188 
+00189 
+00190 
+00191 #endif
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_sym_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_sym_8h-source.html new file mode 100644 index 000000000..17e348419 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_sym_8h-source.html @@ -0,0 +1,80 @@ + + +EO: eoSym.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / eo_interface
+

eoSym.h

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #ifndef EOSYM_H_
+00019 #define EOSYM_H_
+00020 
+00021 #include <EO.h>
+00022 #include <Sym.h>
+00023 #include <FunDef.h>
+00024 
+00025 
+00026 template <class Fitness>
+00027 class EoSym : public EO<Fitness>, public Sym {
+00028 
+00029     public:
+00030         
+00031         void set(const Sym& sym) {
+00032             EO<Fitness>::invalidate();
+00033             static_cast<Sym*>(this)->operator=(sym);
+00034         }
+00035 
+00036         Sym& get()      { return static_cast<Sym&>(*this); };
+00037         Sym get() const { return static_cast<Sym&>(*this); };
+00038         
+00039         virtual void printOn(std::ostream& os) const;
+00040         virtual void readFrom(std::istream& is);
+00041 };
+00042 
+00043 
+00044 template <class Fitness>
+00045 void EoSym<Fitness>::printOn(std::ostream& os) const {
+00046     EO<Fitness>::printOn(os);
+00047     os << ' ';
+00048     write_raw(os, *this);
+00049 }
+00050 
+00051 template <class Fitness>
+00052 void EoSym<Fitness>::readFrom(std::istream& is) {
+00053     EO<Fitness>::readFrom(is);
+00054     read_raw(is, *this); 
+00055 }
+00056 
+00057 template <class Fitness>
+00058 inline std::ostream& operator<<(std::ostream& os, const EoSym<Fitness>& f) { f.printOn(os); return os; }
+00059 template <class Fitness>
+00060 inline std::istream& operator>>(std::istream& is, EoSym<Fitness>& f) { f.readFrom(is); return is; }
+00061 
+00062 
+00063 #endif
+00064 
+00065 
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_sym_crossover_8cpp-source.html b/trunk/paradiseo-eo/doc/html/eo_sym_crossover_8cpp-source.html new file mode 100644 index 000000000..3b7a6dc89 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_sym_crossover_8cpp-source.html @@ -0,0 +1,93 @@ + + +EO: eoSymCrossover.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / eo_interface
+

eoSymCrossover.cpp

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 
+00019 #include <Sym.h>
+00020 #include <NodeSelector.h>
+00021 
+00022 #include <eoSymCrossover.h>
+00023 #include <utils/eoRNG.h>
+00024 
+00025 bool subtree_quad(Sym& a, Sym& b, NodeSelector& select) {
+00026     NodeSelector::NodeSelection sel_a = select.select_node(a);
+00027     NodeSelector::NodeSelection sel_b = select.select_node(b);
+00028 
+00029     Sym aprime = insert_subtree(a, sel_a.idx(), sel_b.subtree() );
+00030     Sym bprime = insert_subtree(b, sel_b.idx(), sel_a.subtree() );
+00031 
+00032     a = aprime;
+00033     b = bprime;
+00034     return true;
+00035 }
+00036 
+00037 bool subtree_bin(Sym& a, const Sym& b, NodeSelector& select) {
+00038     NodeSelector::NodeSelection sel_a = select.select_node(a);
+00039     NodeSelector::NodeSelection sel_b = select.select_node(b);
+00040 
+00041     a = insert_subtree(a, sel_a.idx(), sel_b.subtree());
+00042 
+00043     return true;
+00044 }
+00045 
+00046 Sym homologous_binimpl(Sym a, Sym b) {
+00047     
+00048     if(a == b) { return a; } // no point 
+00049     
+00050     bool use_a = rng.random(2);
+00051 
+00052     token_t head = (use_a? a : b).token();
+00053     SymVec args = use_a?a.args() : b.args();
+00054 
+00055     const SymVec& a_args = a.args();
+00056     const SymVec& b_args = b.args();
+00057     unsigned mn = std::min(a_args.size(), b_args.size());
+00058     
+00059     bool changed = !use_a;
+00060     
+00061     for (unsigned i = 0; i < mn; ++i) {
+00062         args[i] = homologous_binimpl(a_args[i], b_args[i]);
+00063         if (args[i] != a_args[i]) {
+00064             changed = true;
+00065         }
+00066     }
+00067     
+00068     return changed? Sym(head, args) : a;
+00069 }
+00070 
+00071 bool homologous_bin(Sym& a, const Sym& b) {
+00072     if (a==b) return false;
+00073     Sym org = a;
+00074     a = homologous_binimpl(a,b);
+00075     return org != a;
+00076 }
+00077 
+00078 
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_sym_crossover_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_sym_crossover_8h-source.html new file mode 100644 index 000000000..8e0c789cf --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_sym_crossover_8h-source.html @@ -0,0 +1,76 @@ + + +EO: eoSymCrossover.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / eo_interface
+

eoSymCrossover.h

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #ifndef EOSYMCROSSOVER_H
+00019 #define EOSYMCROSSOVER_H
+00020 
+00021 class NodeSelector;
+00022 class Sym;
+00023 
+00024 #include <eoOp.h>
+00025     
+00026 extern bool subtree_quad(Sym& a, Sym& b, NodeSelector& select);
+00027 template <class EoType>
+00028 class eoQuadSubtreeCrossover : public eoQuadOp<EoType> {
+00029     NodeSelector& node_selector;
+00030     
+00031     public:
+00032     eoQuadSubtreeCrossover(NodeSelector& _node_selector) : node_selector(_node_selector) {}
+00033     
+00034     bool operator()(EoType& a, EoType& b) { return subtree_quad(a,b, node_selector); }
+00035 };
+00036 
+00037 
+00038 extern bool subtree_bin(Sym& a, const Sym& b, NodeSelector& select);
+00039 template <class EoType>
+00040 class eoBinSubtreeCrossover : public eoBinOp<EoType> {
+00041     NodeSelector& node_selector;
+00042 
+00043     public :
+00044 
+00045     eoBinSubtreeCrossover(NodeSelector& _node_selector) : node_selector(_node_selector) {}
+00046 
+00047     bool operator()(EoType& a, const EoType& b) { return subtree_bin(a, b, node_selector); }
+00048 };
+00049 
+00053 extern bool homologous_bin(Sym& a, const Sym& b);
+00054 template <class EoType>
+00055 class eoBinHomologousCrossover : public eoBinOp<EoType> {
+00056     public:
+00057         bool operator()(EoType& a, const EoType& b) {
+00058             return homologous_bin(a,b);
+00059         }
+00060 };
+00061 
+00062 
+00063 #endif
+00064 
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_sym_eval_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_sym_eval_8h-source.html new file mode 100644 index 000000000..96081007d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_sym_eval_8h-source.html @@ -0,0 +1,103 @@ + + +EO: eoSymEval.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / eo_interface
+

eoSymEval.h

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #ifndef SYMEVAL_H
+00019 #define SYMEVAL_H
+00020 
+00021 #include <Sym.h>
+00022 #include <FunDef.h>
+00023 #include <ErrorMeasure.h>
+00024 #include <BoundsCheck.h>
+00025 
+00026 #include <eoPopEvalFunc.h>
+00027 
+00028 template <class EoType>
+00029 class eoSymPopEval : public eoPopEvalFunc<EoType> {
+00030 
+00031     BoundsCheck&  check;
+00032     ErrorMeasure& measure;
+00033     unsigned size_cap; 
+00034     
+00035     public:
+00036 
+00037     eoSymPopEval(BoundsCheck& _check, ErrorMeasure& _measure, unsigned _size_cap) :
+00038         check(_check), measure(_measure), size_cap(_size_cap) {}
+00039 
+00048     void operator()(eoPop<EoType>& p1, eoPop<EoType>& p2) {
+00049         
+00050         std::vector<unsigned> unevaluated;
+00051         std::vector<Sym> tmppop;
+00052         
+00053         for (unsigned i = 0; i < p1.size(); ++i) {
+00054             if (p1[i].invalid()) {
+00055 
+00056                 if (expand_all(p1[i]).size() < size_cap && check.in_bounds(p1[i])) {
+00057                     unevaluated.push_back(i);
+00058                     tmppop.push_back( static_cast<Sym>(p1[i]) );
+00059                 } else {
+00060                     p1[i].fitness( measure.worst_performance() );
+00061                 }
+00062             }
+00063         }
+00064 
+00065         for (unsigned i = 0; i < p2.size(); ++i) {
+00066             if (p2[i].invalid()) {
+00067                 
+00068                 if (expand_all(p2[i]).size() < size_cap && check.in_bounds(p2[i])) {
+00069                     
+00070                     unevaluated.push_back(p1.size() + i);
+00071                     tmppop.push_back( static_cast<Sym>(p2[i]) );
+00072 
+00073                 } else {
+00074                     p2[i].fitness( measure.worst_performance() ); // pretty bad error
+00075                 }
+00076             }
+00077         }
+00078 
+00079         std::vector<ErrorMeasure::result> result = measure.calc_error(tmppop);
+00080 
+00081         for (unsigned i = 0; i < result.size(); ++i) {
+00082             unsigned idx = unevaluated[i];
+00083 
+00084             if (idx < p1.size()) {
+00085                 p1[idx].fitness(result[i].error);
+00086             } else {
+00087                 idx -= p1.size();
+00088                 p2[idx].fitness(result[i].error);
+00089             }
+00090         }
+00091     }
+00092 
+00093 };
+00094 
+00095 
+00096 #endif
+
Generated on Thu Oct 19 05:06:38 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_sym_init_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_sym_init_8h-source.html new file mode 100644 index 000000000..86ba1190d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_sym_init_8h-source.html @@ -0,0 +1,75 @@ + + +EO: eoSymInit.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / eo_interface
+

eoSymInit.h

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #ifndef EOSYMINIT_H
+00019 #define EOSYMINIT_H
+00020 
+00021 #include <eoInit.h>
+00022 #include <TreeBuilder.h>
+00023 
+00025 template <class EoType>
+00026 class eoSymInit : public eoInit<EoType> {
+00027     
+00028     TreeBuilder& builder;
+00029     
+00030     double      own_grow_prob;
+00031     unsigned    own_max_depth;
+00032     
+00033     
+00034     double& grow_prob;
+00035     unsigned& max_depth;
+00036 
+00037     public:
+00038         
+00040         eoSymInit(TreeBuilder& _builder) 
+00041         :   builder(_builder), 
+00042             own_grow_prob(0.5), 
+00043             own_max_depth(6),
+00044             grow_prob(own_grow_prob), 
+00045             max_depth(own_max_depth) 
+00046         {}
+00047 
+00049         eoSymInit(TreeBuilder& _builder, double& _grow_prob, unsigned& _max_depth) 
+00050         :   builder(_builder), 
+00051             grow_prob(_grow_prob), 
+00052             max_depth(_max_depth) 
+00053         {}
+00054    
+00056         void operator()(EoType& tree) {
+00057             int depth_to_use = rng.random(max_depth-2) + 2; // two levels minimum
+00058             builder.build_tree(tree, depth_to_use, rng.flip(grow_prob));
+00059         }
+00060     
+00061 };
+00062 
+00063 #endif
+00064 
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_sym_lambda_mutate_8cpp-source.html b/trunk/paradiseo-eo/doc/html/eo_sym_lambda_mutate_8cpp-source.html new file mode 100644 index 000000000..0977a25c7 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_sym_lambda_mutate_8cpp-source.html @@ -0,0 +1,44 @@ + + +EO: eoSymLambdaMutate.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / eo_interface
+

eoSymLambdaMutate.cpp

00001 #include <eoSymLambdaMutate.h>
+00002 #include "FunDef.h"
+00003 #include "NodeSelector.h"
+00004 
+00005 Sym compress(Sym sym, NodeSelector& sel) {
+00006     
+00007     return ::compress(sym);
+00008     
+00009     NodeSelector::NodeSelection s = sel.select_node(sym);
+00010     
+00011     Sym f = SymLambda( s.subtree());
+00012     
+00013     if (f == s.subtree()) { return sym; }
+00014     
+00015     return insert_subtree(sym, s.idx(), f);
+00016 }
+00017 
+00018 extern Sym expand(Sym sym, NodeSelector& sel) {
+00019 
+00020     return ::expand_all(sym);
+00021     
+00022     NodeSelector::NodeSelection s = sel.select_node(sym);
+00023     
+00024     Sym f = SymUnlambda( s.subtree());
+00025     
+00026     if (f == s.subtree()) { return sym; }
+00027     
+00028     return insert_subtree(sym, s.idx(), f);
+00029 }
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_sym_lambda_mutate_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_sym_lambda_mutate_8h-source.html new file mode 100644 index 000000000..cfabdefb2 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_sym_lambda_mutate_8h-source.html @@ -0,0 +1,62 @@ + + +EO: eoSymLambdaMutate.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / eo_interface
+

eoSymLambdaMutate.h

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #ifndef SYMLAMBDAMUTATE_H
+00019 #define SYMLAMBDAMUTATE_H
+00020 
+00021 #include <eoOp.h>
+00022 
+00023 class NodeSelector;
+00024 class Sym;
+00025 extern Sym compress(Sym, NodeSelector&);
+00026 extern Sym expand(Sym, NodeSelector&);
+00027 
+00028 
+00029 template <class EoType>
+00030 class eoSymLambdaMutate : public eoMonOp<EoType> {
+00031     NodeSelector& selector;
+00032     public :
+00033         eoSymLambdaMutate(NodeSelector& s) : selector(s) {}
+00034         
+00035         bool operator()(EoType& tomutate) {
+00036             if (rng.flip()) {
+00037                 tomutate.set( expand(tomutate, selector));
+00038             } else {
+00039                 tomutate.set( compress(tomutate, selector));
+00040             }
+00041             return true; 
+00042         }
+00043     
+00044 };
+00045 
+00046 
+00047 #endif
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_sym_mutate_8cpp-source.html b/trunk/paradiseo-eo/doc/html/eo_sym_mutate_8cpp-source.html new file mode 100644 index 000000000..ad3a16802 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_sym_mutate_8cpp-source.html @@ -0,0 +1,88 @@ + + +EO: eoSymMutate.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / eo_interface
+

eoSymMutate.cpp

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #include <eoSymMutate.h>
+00019 #include <FunDef.h>
+00020 #include <utils/eoRNG.h>
+00021 
+00022 using namespace std;
+00023 
+00024 std::pair<Sym, bool> do_mutate(Sym sym, double p, const LanguageTable& table) {
+00025     
+00026     bool changed = false;
+00027     SymVec args = sym.args();
+00028     if (rng.flip(p)) {
+00029         token_t new_token = table.get_random_function(sym.token(), args.size());
+00030         if (new_token != sym.token()) {
+00031             changed = true;
+00032             sym = Sym(new_token, args);
+00033         }
+00034     }
+00035 
+00036     for (unsigned i = 0; i < args.size(); ++i) {
+00037         std::pair<Sym,bool> r = do_mutate(args[i], p, table);   
+00038         changed |= r.second;
+00039         if (r.second) 
+00040             args[i] = r.first;
+00041     }
+00042 
+00043     if (changed)
+00044         return std::make_pair(Sym(sym.token(), args), true);
+00045     // else
+00046     return std::make_pair(sym, false);
+00047 }
+00048         
+00049         
+00050 // these two can (should?) move to an impl file
+00051 bool mutate(Sym& sym, double p, const LanguageTable& table) {
+00052     std::pair<Sym, bool> r = do_mutate(sym, p, table);
+00053     sym = r.first;
+00054     return r.second;
+00055 }
+00056 
+00057 
+00058 bool mutate_constants(Sym& sym, double stdev) {
+00059     vector<double> values = get_constants(sym);
+00060 
+00061     if (values.empty()) {
+00062         return false;
+00063     }
+00064     
+00065     for (unsigned i = 0; i < values.size(); ++i) {
+00066         values[i] += rng.normal() * stdev;
+00067     }
+00068     
+00069     sym = set_constants(sym, values);
+00070 
+00071     return true;
+00072 }
+00073 
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_sym_mutate_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_sym_mutate_8h-source.html new file mode 100644 index 000000000..865ac79b3 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_sym_mutate_8h-source.html @@ -0,0 +1,119 @@ + + +EO: eoSymMutate.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / mathsym / eo_interface
+

eoSymMutate.h

00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #ifndef SYMMUTATE_H
+00019 #define SYMMUTATE_H
+00020 
+00021 #include <TreeBuilder.h>
+00022 #include <NodeSelector.h>
+00023 
+00024 #include <eoSym.h>
+00025 #include <eoOp.h>
+00026 
+00027 template <class EoType>
+00028 class eoSymSubtreeMutate : public eoMonOp<EoType> {
+00029     
+00030         TreeBuilder& subtree_builder;
+00031         NodeSelector& node_selector;
+00032     public :
+00033         
+00034         eoSymSubtreeMutate(TreeBuilder& _subtree_builder, NodeSelector& _node_selector)
+00035         : subtree_builder(_subtree_builder), node_selector(_node_selector) {}
+00036         
+00037         
+00038         bool operator()(EoType& tomutate) {
+00039             unsigned xover_point = node_selector.select_node(tomutate).idx();
+00040             // create subtree
+00041             Sym newtree = subtree_builder.build_tree(6, true); // TODO, parameterize
+00042             static_cast<Sym&>(tomutate) = insert_subtree(tomutate, xover_point, newtree);
+00043             return true;
+00044         }
+00045     
+00046 };
+00047 
+00055 extern bool mutate(Sym& sym, double p, const LanguageTable& table);
+00056 
+00057 template <class EoType>
+00058 class eoSymNodeMutate : public eoMonOp<EoType> {
+00059     
+00060         LanguageTable& table;
+00061         double own_mutation_rate;
+00062         bool   own_is_rate_absolute;
+00063         
+00064 
+00065     public:
+00066         
+00067         double& mutation_rate;
+00068         bool& is_rate_absolute;
+00069             
+00070         eoSymNodeMutate(LanguageTable& _table)
+00071         :   table(_table),
+00072             own_mutation_rate(1.0),
+00073             own_is_rate_absolute(false), // this means a probability of node mutation of 1/sym.size()
+00074             mutation_rate(own_mutation_rate),
+00075             is_rate_absolute(own_is_rate_absolute)
+00076         {}
+00077 
+00078         eoSymNodeMutate(LanguageTable& _table, double& _mutation_rate, bool& _is_rate_absolute) 
+00079         :   table(_table),
+00080             mutation_rate(_mutation_rate),
+00081             is_rate_absolute(_is_rate_absolute) 
+00082         {}
+00083 
+00084         
+00085         bool operator()(EoType& _eo) {
+00086             double p = mutation_rate;
+00087             if (!is_rate_absolute) p /= _eo.size();
+00088 
+00089             return mutate(_eo, p, table);
+00090         }
+00091         
+00092 };
+00093 
+00097 extern bool mutate_constants(Sym& sym, double stdev);
+00098 template <class EoType>
+00099 class eoSymConstantMutate : public eoMonOp<EoType> {
+00100     
+00101     double& stdev;
+00102 
+00103     
+00104     public :
+00105     eoSymConstantMutate(double& _stdev) : stdev(_stdev) {}
+00106 
+00107     bool operator()(EoType& _eo) {
+00108         return mutate_constants(_eo, stdev);
+00109     }
+00110     
+00111     
+00112 };
+00113 
+00114 #endif
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_time_counter_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_time_counter_8h-source.html new file mode 100644 index 000000000..680b3f3ff --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_time_counter_8h-source.html @@ -0,0 +1,75 @@ + + +EO: eoTimeCounter.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoTimeCounter.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoTimeCounter.h
+00005 // (c) Marc Schoenauer, Maarten Keijzer, and GeNeura Team, 2002
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@inria.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoTimeCounter_h
+00028 #define _eoTimeCounter_h
+00029 
+00030 #include <time.h>
+00031 #include <utils/eoStat.h>
+00032 
+00033 
+00038 class eoTimeCounter : public eoUpdater, public eoValueParam<double>
+00039 {
+00040 public:
+00041   eoTimeCounter() : eoValueParam<double>(0.0, "Time") // : firstTime(true)  
+00042   {}
+00043 
+00045   virtual void operator()()
+00046   {
+00047     // ask for system time
+00048     utime = clock();
+00049 //     if (firstTime)   /* first generation */
+00050 //       {
+00051 //      firstTime=false;
+00052 //      firstUtime = tmsStruct.tms_utime;
+00053 //       }
+00054     // store elapsed user time
+00055 //     value(tmsStruct.tms_utime - firstUtime);
+00056     value()=double(utime)/CLOCKS_PER_SEC;
+00057   }
+00058   
+00059 private:
+00060 //   bool firstTime;
+00061 //   clock_t firstUtime;
+00062   clock_t utime;
+00063 };
+00064 
+00065 #endif
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_timed_monitor_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_timed_monitor_8h-source.html new file mode 100644 index 000000000..d26fbfdbb --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_timed_monitor_8h-source.html @@ -0,0 +1,87 @@ + + +EO: eoTimedMonitor.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoTimedMonitor.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoTimedMonitor.h
+00005 // (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2005
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoTimedMonitor_h
+00028 #define _eoTimedMonitor_h
+00029 
+00030 #include <string>
+00031 
+00032 #include <utils/eoMonitor.h>
+00033 #include <eoObject.h>
+00034 #include <time.h>
+00035 
+00040 class eoTimedMonitor : public eoMonitor
+00041 {
+00042 public :
+00043     eoTimedMonitor(int seconds_) : seconds(seconds_), last_tick(0) {}
+00044     
+00045     eoMonitor& operator()(void) {
+00046         bool monitor = false;
+00047         if (last_tick == 0) {
+00048             monitor = true;
+00049             last_tick = clock();
+00050         }
+00051 
+00052         clock_t tick = clock();
+00053 
+00054         if ( (tick-last_tick) >= seconds * CLOCKS_PER_SEC) {
+00055             monitor = true;
+00056         }
+00057 
+00058         if (monitor) {
+00059             for (unsigned i = 0; i < monitors.size(); ++i) {
+00060                 (*monitors[i])();
+00061             }
+00062             last_tick = clock();
+00063         }
+00064         return *this;
+00065     }
+00066 
+00067     void add(eoMonitor& mon) { monitors.push_back(&mon); }
+00068     
+00069   virtual std::string className(void) const { return "eoTimedMonitor"; }
+00070 private :
+00071   clock_t last_tick;
+00072   int seconds;
+00073   std::vector<eoMonitor*> monitors;
+00074 };
+00075 
+00076 #endif
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_transform_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_transform_8h-source.html new file mode 100644 index 000000000..4144e215b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_transform_8h-source.html @@ -0,0 +1,31 @@ + + +EO: eoTransform.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoTransform.h

00001 
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 #ifndef _eoTransform_h
+00026 #define _eoTransform_h
+00027 
+00028 
+00029 //-----------------------------------------------------------------------------
+00030 #include <eoPop.h>
+00031 //-----------------------------------------------------------------------------
+00032 
+00037 template<class EOT>
+00038 class eoTransform : public eoUF<eoPop<EOT>&, void>
+00039 {};
+00040 
+00041 #endif
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_trunc_select_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_trunc_select_8h-source.html new file mode 100644 index 000000000..d0a9080a3 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_trunc_select_8h-source.html @@ -0,0 +1,53 @@ + + +EO: eoTruncSelect.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoTruncSelect.h

00001 
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoTruncSelect_h
+00028 #define _eoTruncSelect_h
+00029 
+00030 
+00031 //-----------------------------------------------------------------------------
+00032 #include <eoSelect.h>
+00033 #include <utils/eoHowMany.h>
+00034 #include <math.h>
+00035 //-----------------------------------------------------------------------------
+00036 
+00042 template<class EOT>
+00043 class eoTruncSelect : public eoSelect<EOT>
+00044 {
+00045  public:
+00047   eoTruncSelect(eoSelectOne<EOT>& _select, eoHowMany _howMany) 
+00048     : select(_select), howMany(_howMany) {}
+00049   
+00056   virtual void operator()(const eoPop<EOT>& _source, eoPop<EOT>& _dest)
+00057   {
+00058     unsigned target = howMany(_source.size());
+00059     
+00060     _dest.resize(target);
+00061     
+00062     select.setup(_source);
+00063     
+00064     for (size_t i = 0; i < _dest.size(); ++i)
+00065       _dest[i] = select(_source);
+00066   }
+00067   
+00068 private :
+00069   eoSelectOne<EOT>& select;
+00070   eoHowMany howMany;
+00071 };
+00072 
+00073 #endif
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_truncated_select_many_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_truncated_select_many_8h-source.html new file mode 100644 index 000000000..2d9a84826 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_truncated_select_many_8h-source.html @@ -0,0 +1,88 @@ + + +EO: eoTruncatedSelectMany.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoTruncatedSelectMany.h

00001 
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoTruncatedSelectMany_h
+00028 #define _eoTruncatedSelectMany_h
+00029 
+00030 
+00031 //-----------------------------------------------------------------------------
+00032 #include <eoSelect.h>
+00033 #include <eoSelectOne.h>
+00034 #include <utils/eoHowMany.h>
+00035 #include <math.h>
+00036 //-----------------------------------------------------------------------------
+00037 
+00052 template<class EOT>
+00053 class eoTruncatedSelectMany : public eoSelect<EOT>
+00054 {
+00055  public:
+00057      eoTruncatedSelectMany(eoSelectOne<EOT>& _select, 
+00058                   double  _rateGenitors, double  _rateFertile, 
+00059                   bool _interpret_as_rateG = true, 
+00060                   bool _interpret_as_rateF = true)
+00061          : select(_select), 
+00062            howManyGenitors(_rateGenitors, _interpret_as_rateG),
+00063            howManyFertile(_rateFertile, _interpret_as_rateF) {}
+00064 
+00065      // Ctor with eoHowManys
+00066      eoTruncatedSelectMany(eoSelectOne<EOT>& _select, 
+00067                   eoHowMany _howManyGenitors, eoHowMany _howManyFertile) 
+00068          : select(_select), howManyGenitors(_howManyGenitors),
+00069            howManyFertile(_howManyFertile) {}
+00070 
+00077   virtual void operator()(const eoPop<EOT>& _source, eoPop<EOT>& _dest)
+00078   {
+00079     unsigned target = howManyGenitors(_source.size());
+00080 
+00081     _dest.resize(target);
+00082 
+00083     unsigned nbFertile = howManyFertile(_source.size());
+00084 
+00085     //revert to standard selection (see eoSelectMany) if no truncation
+00086     if (nbFertile == _source.size())
+00087       {
+00088         select.setup(_source);
+00089         
+00090         for (size_t i = 0; i < _dest.size(); ++i)
+00091           _dest[i] = select(_source);
+00092       }
+00093     else
+00094       {
+00095     // at the moment, brute force (rush rush, no good)
+00096     // what we would need otherwise is a std::vector<EOT &> class
+00097     // and selectors that act on such a thing
+00098         eoPop<EOT> tmpPop = _source; // hum hum, could be a pain in the ass
+00099 
+00100         tmpPop.sort();             // maybe we could only do partial sort?
+00101         tmpPop.resize(nbFertile);  // only the best guys here now
+00102         tmpPop.shuffle();          // as some selectors are order-sensitive
+00103 
+00104         select.setup(tmpPop);
+00105         
+00106         for (size_t i = 0; i < _dest.size(); ++i)
+00107           _dest[i] = select(tmpPop);
+00108       }
+00109   }
+00110   
+00111 private :
+00112   eoSelectOne<EOT>& select;        // selector for one guy
+00113   eoHowMany howManyGenitors;       // number of guys to select
+00114   eoHowMany howManyFertile;        // number of fertile guys
+00115 };
+00116 
+00117 #endif
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_truncated_select_one_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_truncated_select_one_8h-source.html new file mode 100644 index 000000000..0f563edeb --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_truncated_select_one_8h-source.html @@ -0,0 +1,88 @@ + + +EO: eoTruncatedSelectOne.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoTruncatedSelectOne.h

00001 
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoTruncatedSelectOne_h
+00028 #define _eoTruncatedSelectOne_h
+00029 
+00030 
+00031 //-----------------------------------------------------------------------------
+00032 #include <eoSelect.h>
+00033 #include <eoSelectOne.h>
+00034 #include <utils/eoHowMany.h>
+00035 #include <math.h>
+00036 //-----------------------------------------------------------------------------
+00037 
+00044 template<class EOT>
+00045 class eoTruncatedSelectOne : public eoSelectOne<EOT>
+00046 {
+00047 public:
+00049   eoTruncatedSelectOne(eoSelectOne<EOT>& _select, 
+00050                        double  _rateFertile, 
+00051                        bool _interpret_as_rateF = true)
+00052     : select(_select), 
+00053       howManyFertile(_rateFertile, _interpret_as_rateF),
+00054       tmpPop(), actualPop(tmpPop)
+00055   {}
+00056 
+00058   eoTruncatedSelectOne(eoSelectOne<EOT>& _select, 
+00059                         eoHowMany _howManyFertile) 
+00060     : select(_select), howManyFertile(_howManyFertile),
+00061     tmpPop(), actualPop(tmpPop)
+00062   {}
+00063 
+00064 
+00066   void setup(const eoPop<EOT>& _source)
+00067   {
+00068     unsigned fertile = howManyFertile(_source.size());
+00069     if (fertile == _source.size())  // noting to do, all are fertile
+00070       {
+00071         actualPop = _source;
+00072       }
+00073     else
+00074       {
+00075         // copy only best ferile to actualPop
+00076         tmpPop.resize(fertile);
+00077         std::vector<const EOT *> result;
+00078         _source.nth_element(fertile, result);
+00079         for (unsigned i=0; i<fertile; i++)
+00080           tmpPop[i] = *result[i];
+00081 
+00082         // and just in case
+00083         actualPop = tmpPop;
+00084       }
+00085 
+00086     // AND DON'T FORGET to call the embedded select setup method on actualPop
+00087     select.setup(actualPop);
+00088 
+00089     return;
+00090   }
+00091   
+00098   const EOT& operator()(const eoPop<EOT>& _pop) 
+00099   {
+00100     return select(actualPop);
+00101   }
+00102 
+00103 
+00104 private :
+00105   eoSelectOne<EOT>& select;        // selector for one guy
+00106   eoHowMany howManyFertile;        // number of fertile guys
+00107   eoPop<EOT> tmpPop;               // intermediate population - fertile guys
+00108   eoPop<EOT> & actualPop;          // to avoid copies when 100% fertility
+00109 };
+00110 
+00111 #endif
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_uniform_init_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_uniform_init_8h-source.html new file mode 100644 index 000000000..6f32f2548 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_uniform_init_8h-source.html @@ -0,0 +1,123 @@ + + +EO: eoUniformInit.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoUniformInit.h

00001 /* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003   -----------------------------------------------------------------------------
+00004   eoUniformInit.h
+00005 
+00006  (c) Maarten Keijzer, GeNeura Team, Marc Schoenauer, 1999 - 2002
+00007 
+00008     This library is free software; you can redistribute it and/or
+00009     modify it under the terms of the GNU Lesser General Public
+00010     License as published by the Free Software Foundation; either
+00011     version 2 of the License, or (at your option) any later version.
+00012 
+00013     This library is distributed in the hope that it will be useful,
+00014     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00015     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00016     Lesser General Public License for more details.
+00017 
+00018     You should have received a copy of the GNU Lesser General Public
+00019     License along with this library; if not, write to the Free Software
+00020     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00021 
+00022     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00023              Marc.Schoenauer@inria.fr
+00024  */
+00025 
+00026 //-----------------------------------------------------------------------------
+00039 #ifndef eoUniformInit_h
+00040 #define eoUniformInit_h
+00041 
+00042 #include "eoRNG.h"
+00043 #include "eoInit.h"
+00044 #include "eoRealBounds.h"
+00045 #include <stdexcept>
+00046 
+00047 using eo::rng;
+00048 
+00062 template <class T = double> class eoUniformInit : public eoInit<T>
+00063 {
+00064   public :
+00066   eoUniformInit(T _max = T(1.0), eoRng& _rng = rng) :
+00067     minim(T(0.0)), range(_max), uniform(_rng) 
+00068   {}
+00069   
+00071   eoUniformInit(eoRealBounds & _bound, eoRng& _rng = rng) :
+00072     minim(_bound.minimum()), range(_bound.range()), uniform(_rng)
+00073   {}
+00074   
+00076   eoUniformInit(T _min, T _max, eoRng& _rng = rng) :
+00077     minim(_min), range(_max-_min), uniform(_rng)
+00078   {
+00079     if (_min>_max)
+00080       throw std::logic_error("Min is greater than Max in uniform_generator");
+00081   }
+00082   
+00087   void operator()(T & _t) 
+00088   { 
+00089     _t = minim+static_cast<T>(uniform.uniform(range)); 
+00090   }
+00091 
+00092 private :
+00093   T minim;
+00094   T range;
+00095   eoRng& uniform;
+00096 };
+00097 
+00098 
+00100 template <>
+00101 inline void eoUniformInit<bool>::operator()(bool & _b)
+00102 {
+00103     _b = uniform.flip(0.5);
+00104 }
+00105 
+00110 class eoBooleanInit : public eoInit<bool>
+00111 {
+00112   public :
+00113   eoBooleanInit(float _bias = 0.5, eoRng& _rng = rng) : bias(_bias), gen(_rng) {}
+00114 
+00115   void operator()(bool & _b) { _b = gen.flip(bias); }
+00116   private :
+00117   float bias;
+00118   eoRng& gen;
+00119 };
+00120 
+00126 template <class T = double> class eoNormalInit : public eoInit<T>
+00127 {
+00128   public :
+00129     eoNormalInit(T _stdev = T(1.0), eoRng& _rng = rng) : stdev(_stdev), normal(_rng) {}
+00130 
+00131   void operator()(T & _t) { _t = (T) normal.normal(stdev); }
+00132 
+00133   private :
+00134     T stdev;
+00135   eoRng& normal;
+00136 };
+00137 
+00143 template <class T = double> class eoNegExpInit : public eoInit<T>
+00144 {
+00145   public :
+00146     eoNegExpInit(T _mean = 1.0, eoRng& _rng = rng) : mean(_mean), negexp(_rng) {}
+00147 
+00148   void operator()(T & _t) { _t = (T) negexp.negexp(mean); }
+00149 
+00150   private :
+00151     T mean;
+00152   eoRng& negexp;
+00153 };
+00154 
+00155 #endif
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_updatable_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_updatable_8h-source.html new file mode 100644 index 000000000..18fc35fdb --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_updatable_8h-source.html @@ -0,0 +1,112 @@ + + +EO: eoUpdatable.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoUpdatable.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoUpdatable.h
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2000
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoUpdatable_h
+00028 #define _eoUpdatable_h
+00029 
+00030 #include <utils/eoUpdater.h>
+00031 
+00036 class eoUpdatable
+00037 {
+00038 public:
+00039 
+00041     virtual ~eoUpdatable() {};
+00042 
+00043     virtual void update() = 0;
+00044 };
+00045 
+00046 
+00047 
+00051 class eoDynUpdater : public eoUpdater
+00052 {public :
+00053     eoDynUpdater(eoUpdatable & _toUpdate) : toUpdate(_toUpdate) {};
+00054 
+00055     virtual void operator()()
+00056     {
+00057         toUpdate.update();
+00058     }
+00059 
+00060 private:
+00061     eoUpdatable& toUpdate;
+00062 };
+00063 
+00067 class eoTimedDynUpdate : public eoDynUpdater
+00068 {
+00069 public :
+00070     eoTimedDynUpdate(eoUpdatable & _toUpdate, time_t _interval) :
+00071     eoDynUpdater(_toUpdate),
+00072         interval(_interval), last_time(time(0)), first_time(time(0)) {}
+00073 
+00074     void operator()(void)
+00075       {
+00076         time_t now = time(0);
+00077 
+00078         if (now >= last_time + interval)
+00079           {
+00080             last_time = now;
+00081             eoDynUpdater::operator() ();
+00082           }
+00083       }
+00084 private :
+00085     const time_t interval;
+00086     time_t last_time;
+00087     const time_t first_time;
+00088 };
+00089 
+00093 class eoCountedDynUpdate : public eoDynUpdater
+00094 {
+00095 public :
+00096     eoCountedDynUpdate(eoUpdatable & _toUpdate, unsigned _interval)
+00097         : eoDynUpdater(_toUpdate), interval(_interval), counter(0) {}
+00098 
+00099     void operator()(void)
+00100       {
+00101         if (++counter % interval == 0)
+00102           {
+00103             eoDynUpdater::operator() ();
+00104           }
+00105       }
+00106 private :
+00107     const unsigned interval;
+00108     unsigned counter;
+00109 };
+00110 
+00111 #endif
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_updater_8cpp-source.html b/trunk/paradiseo-eo/doc/html/eo_updater_8cpp-source.html new file mode 100644 index 000000000..c8427e2e1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_updater_8cpp-source.html @@ -0,0 +1,63 @@ + + +EO: eoUpdater.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoUpdater.cpp

00001 #ifdef _MSC_VER
+00002 #pragma warning(disable:4786)
+00003 #endif
+00004 
+00005 #ifdef HAVE_CONFIG_H
+00006 #include <config.h>
+00007 #endif
+00008 
+00009 #include <sstream>
+00010 
+00011 #include <utils/eoState.h>
+00012 #include <utils/eoUpdater.h>
+00013 
+00014 using namespace std;
+00015 
+00016 void eoTimedStateSaver::operator()(void)
+00017 {
+00018     time_t now = time(0);
+00019 
+00020     if (now >= last_time + interval)
+00021     {
+00022         last_time = now;
+00023         ostringstream os;
+00024         os << prefix << (now - first_time) << '.' << extension;
+00025         state.save(os.str());
+00026     }
+00027 }
+00028 
+00029 void eoCountedStateSaver::doItNow(void)
+00030 {
+00031         ostringstream os;
+00032         os << prefix << counter << '.' << extension;
+00033         state.save(os.str());
+00034 }
+00035 
+00036 void eoCountedStateSaver::operator()(void)
+00037 {
+00038     if (++counter % interval == 0)
+00039       doItNow();
+00040 }
+00041 
+00042 void eoCountedStateSaver::lastCall(void)
+00043 {
+00044     if (saveOnLastCall)
+00045       doItNow();
+00046 }
+00047 
+00048 
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_updater_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_updater_8h-source.html new file mode 100644 index 000000000..b5408e823 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_updater_8h-source.html @@ -0,0 +1,149 @@ + + +EO: eoUpdater.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

eoUpdater.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoUpdater.h
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2000
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _eoUpdater_h
+00028 #define _eoUpdater_h
+00029 
+00030 #include <string>
+00031 #include <eoFunctor.h>
+00032 #include <utils/eoState.h>
+00033 #include <utils/eoParam.h>
+00034 
+00039 class eoUpdater : public eoF<void>
+00040 {
+00041 public:
+00042   virtual void lastCall() {}
+00043   virtual std::string className(void) const { return "eoUpdater"; }
+00044 };
+00045 
+00049 template <class T>
+00050 class eoIncrementor : public eoUpdater
+00051 {public :
+00053     eoIncrementor(T& _counter, T _stepsize = 1) : counter(_counter), stepsize(_stepsize) {}
+00054 
+00056     virtual void operator()()
+00057     {
+00058         counter += stepsize;
+00059     }
+00060 
+00061   virtual std::string className(void) const { return "eoIncrementor"; }
+00062 private:
+00063     T& counter;
+00064     T stepsize;
+00065 };
+00066 
+00070 template <class T>
+00071 class eoIncrementorParam : public eoUpdater, public eoValueParam<T>
+00072 {
+00073 public:
+00074 
+00075     using eoValueParam<T>::value;
+00076 
+00078   eoIncrementorParam( std::string _name, T _stepsize = 1) :
+00079     eoValueParam<T>(T(0), _name), stepsize(_stepsize) {}
+00080 
+00084   eoIncrementorParam( std::string _name, T _countValue, T _stepsize) :
+00085     eoValueParam<T>(_countValue, _name), stepsize(_stepsize) {}
+00086 
+00088   virtual void operator()()
+00089   {
+00090       value() += stepsize;
+00091   }
+00092 
+00093   virtual std::string className(void) const { return "eoIncrementorParam"; }
+00094 
+00095 private:
+00096   T stepsize;
+00097 };
+00098 
+00099 #include <time.h>
+00100 
+00104 class eoTimedStateSaver : public eoUpdater
+00105 {
+00106 public :
+00107     eoTimedStateSaver(time_t _interval, const eoState& _state, std::string _prefix = "state", std::string _extension = "sav") : state(_state),
+00108         interval(_interval), last_time(time(0)), first_time(time(0)),
+00109     prefix(_prefix), extension(_extension) {}
+00110 
+00111     void operator()(void);
+00112 
+00113   virtual std::string className(void) const { return "eoTimedStateSaver"; }
+00114 private :
+00115     const eoState& state;
+00116 
+00117     const time_t interval;
+00118     time_t last_time;
+00119     const time_t first_time;
+00120     const std::string prefix;
+00121     const std::string extension;
+00122 };
+00123 
+00127 class eoCountedStateSaver : public eoUpdater
+00128 {
+00129 public :
+00130     eoCountedStateSaver(unsigned _interval, const eoState& _state, std::string _prefix, bool _saveOnLastCall, std::string _extension = "sav", unsigned _counter = 0)
+00131       : state(_state), interval(_interval), counter(_counter),
+00132       saveOnLastCall(_saveOnLastCall),
+00133       prefix(_prefix), extension(_extension) {}
+00134 
+00135     eoCountedStateSaver(unsigned _interval, const eoState& _state, std::string _prefix = "state", std::string _extension = "sav", unsigned _counter = 0)
+00136       : state(_state), interval(_interval), counter(_counter),
+00137         saveOnLastCall(true),
+00138         prefix(_prefix), extension(_extension) {}
+00139 
+00140     virtual void lastCall(void);
+00141     void operator()(void);
+00142 
+00143   virtual std::string className(void) const { return "eoCountedStateSaver"; }
+00144 private :
+00145     void doItNow(void);
+00146 
+00147     const eoState& state;
+00148     const unsigned interval;
+00149     unsigned counter;
+00150     bool saveOnLastCall;
+00151 
+00152     const std::string prefix;
+00153     const std::string extension;
+00154 };
+00155 
+00156 
+00157 #endif
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_variable_length_crossover_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_variable_length_crossover_8h-source.html new file mode 100644 index 000000000..e6e607e37 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_variable_length_crossover_8h-source.html @@ -0,0 +1,316 @@ + + +EO: eoVariableLengthCrossover.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoVariableLengthCrossover.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoVariableLengthCrossover.h
+00005 // (c) GeNeura Team, 2000 - EEAAX 1999 - Maarten Keijzer 2000
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: Marc.Schoenauer@polytechnique.fr
+00022              mkeijzer@cs.vu.nl
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _eoVariableLengthCrossover_h
+00027 #define _eoVariableLengthCrossover_h
+00028 
+00029 #include <eoFunctor.h>
+00030 #include <eoOp.h>
+00031 
+00040 template <class Atom>
+00041 class eoAtomExchange : public eoBF<unsigned, Atom &, bool>
+00042 {
+00043 public:
+00045   virtual void randomize(unsigned int, unsigned int){}
+00047   virtual std::string className() const=0;
+00048 };
+00049 
+00051 template <class Atom>
+00052 class eoUniformAtomExchange: public eoAtomExchange<Atom>
+00053 {
+00054 public:
+00055     eoUniformAtomExchange(double _rate=0.5):rate(_rate){}
+00056 
+00061   void randomize(unsigned _size1, unsigned _size2)
+00062   {
+00063     mask.resize(_size1 + _size2);
+00064     for (unsigned i=0; i<_size1+_size2; i++)
+00065         mask[i]=eo::rng.flip(rate);
+00066   }
+00067 
+00069     bool operator()(unsigned _i, Atom & )
+00070     {
+00071       return mask[_i];
+00072     }
+00073 
+00075   virtual std::string className() const {return "eoUniformAtomExchange";}
+00076 
+00077 private:
+00078   double rate;
+00079   std::vector<bool> mask;
+00080 };
+00081 
+00085 
+00088 template <class EOT>
+00089 class eoVlAtomExchangeQuadOp : public eoQuadOp<EOT>
+00090 {
+00091 public :
+00092 
+00093   typedef typename EOT::AtomType AtomType;
+00094 
+00096   eoVlAtomExchangeQuadOp(unsigned _Min, unsigned _Max,
+00097                          eoAtomExchange<AtomType>& _atomExchange):
+00098     Min(_Min), Max(_Max), atomExchange(_atomExchange) {}
+00099 
+00100   bool operator()(EOT & _eo1, EOT & _eo2)
+00101   {
+00102     EOT tmp1, tmp2;                // empty individuals
+00103     unsigned index=0;
+00104     // main loop: until sizes are OK, do only simulated exchange
+00105     unsigned i, i1, i2;
+00106     do {
+00107       // "initialize the AtomExchange
+00108       atomExchange.randomize(_eo1.size(), _eo2.size());
+00109       // simulate crossover
+00110       i1=i2=0;
+00111       for (i=0; i<_eo1.size(); i++)
+00112         {
+00113           if (atomExchange(i, _eo1[i]))
+00114             i1++;
+00115           else
+00116             i2++;
+00117         }
+00118       for (i=0; i<_eo2.size(); i++)
+00119         {
+00120           if (atomExchange(i, _eo2[i]))
+00121             i2++;
+00122           else
+00123             i1++;
+00124         }
+00125       index++;
+00126     } while ( ( (i1<Min) || (i2<Min) ||
+00127                 (i1>Max) || (i2>Max) )
+00128               && (index<10000) );
+00129     if (index >= 10000)
+00130       {
+00131         std::cout << "Warning: impossible to generate individual of the right size in 10000 trials\n";
+00132         return false;
+00133       }
+00134   // here we know we have the right sizes: do the actual exchange
+00135       for (i=0; i<_eo1.size(); i++)
+00136         {
+00137           if (atomExchange(i, _eo1[i]))
+00138             tmp1.push_back(_eo1[i]);
+00139           else
+00140             tmp2.push_back(_eo1[i]);
+00141         }
+00142       for (i=0; i<_eo2.size(); i++)
+00143         {
+00144           if (atomExchange(i, _eo2[i]))
+00145             tmp2.push_back(_eo2[i]);
+00146           else
+00147             tmp1.push_back(_eo2[i]);
+00148         }
+00149       // and put everything back in place
+00150     _eo1.swap(tmp1);
+00151     _eo2.swap(tmp2);
+00152     return true;         // should we test that? Yes, but no time now
+00153   }
+00154 
+00156   virtual std::string className() const
+00157   {
+00158       std::ostringstream os;
+00159       os << "eoVlAtomExchangeQuadOp(" << atomExchange.className() << ")";
+00160       return os.str();
+00161   }
+00162 
+00163 private:
+00164   unsigned Min, Max;
+00165   eoAtomExchange<AtomType> & atomExchange;
+00166 };
+00167 
+00171 template <class EOT>
+00172 class eoInnerExchangeQuadOp : public eoQuadOp<EOT>
+00173 {
+00174 public :
+00175 
+00176   typedef typename EOT::AtomType AtomType;
+00177 
+00179   eoInnerExchangeQuadOp( eoQuadOp<AtomType>& _op, float _rate = 0.5):
+00180     op(_op), rate( _rate ) {}
+00181 
+00183   bool operator()(EOT & _eo1, EOT & _eo2)
+00184   {
+00185     unsigned size1 = _eo1.size(), size2 = _eo2.size(), minsize = ( size1 > size2)?size2:size1;
+00186     bool changed = false;
+00187     for ( unsigned i = 0; i < minsize; i ++ ) {
+00188       if ( rng.flip( rate ) ) {
+00189         bool changedHere = op( _eo1[i], _eo2[i] );
+00190         changed |= changedHere;
+00191       }
+00192     }
+00193     return changed;      // should we test that? Yes, but no time now
+00194   }
+00195 
+00196   virtual std::string className() const
+00197   {
+00198     return "eoInnerExchangeQuadOp(" + op.className() + ")";
+00199   }
+00200 
+00201 private:
+00202   float rate;
+00203   eoQuadOp<AtomType> & op;
+00204 };
+00205 
+00206 
+00207 
+00208 
+00218 template <class EOT>
+00219 class eoVlUniformQuadOp : public eoQuadOp<EOT>
+00220 {
+00221 public :
+00222 
+00223   typedef typename EOT::AtomType AtomType;
+00224 
+00225   // default ctor: requires bounds on number of genes + a rate
+00226   eoVlUniformQuadOp(unsigned _Min, unsigned _Max, double _rate=0.5) :
+00227     Min(_Min), Max(_Max), rate(_rate) {}
+00228 
+00229   bool operator()(EOT & _eo1, EOT & _eo2)
+00230   {
+00231     unsigned i;
+00232     EOT tmp1, tmp2;
+00233     unsigned index=0;
+00234     do {
+00235       for (i=0; i<_eo1.size(); i++)
+00236         {
+00237           if (eo::rng.flip(rate))
+00238             tmp1.push_back(_eo1[i]);
+00239           else
+00240             tmp2.push_back(_eo1[i]);
+00241           // here we should look for _eo1[i] inside _eo2 and erase it if found!
+00242         }
+00243       for (i=0; i<_eo2.size(); i++)
+00244         {
+00245           if (eo::rng.flip(rate))
+00246             tmp1.push_back(_eo2[i]);
+00247           else
+00248             tmp2.push_back(_eo2[i]);
+00249         }
+00250       index++;
+00251     } while ( ( (tmp1.size()<Min) || (tmp2.size()<Min) ||
+00252               (tmp1.size()>Max) || (tmp2.size()>Max) )
+00253               && (index<10000) );
+00254     if (index >= 10000)
+00255       {
+00256         std::cout << "Warning: impossible to generate individual of the right size in 10000 trials\n";
+00257         return false;
+00258       }
+00259 
+00260     _eo1.swap(tmp1);
+00261     _eo2.swap(tmp2);
+00262     return true;                   // should we test that?
+00263   }
+00264 private:
+00265   unsigned Min, Max;
+00266   double rate;
+00267 };
+00268 
+00269 
+00279 template <class EOT>
+00280 class eoVlUniformBinOp : public eoBinOp<EOT>
+00281 {
+00282 public :
+00283 
+00284   typedef typename EOT::AtomType AtomType;
+00285 
+00286   // default ctor: requires bounds on number of genes + a rate
+00287   eoVlUniformBinOp(unsigned _Min, unsigned _Max, double _rate=0.5) :
+00288     Min(_Min), Max(_Max), rate(_rate) {}
+00289 
+00290   bool operator()(EOT & _eo1, const EOT & _eo2)
+00291   {
+00292     unsigned i;
+00293     EOT tmp1;
+00294     bool tmpIsOne=true, tmpIsTwo=true;
+00295     unsigned index=0;
+00296     do {
+00297       for (i=0; i<_eo1.size(); i++)
+00298         {
+00299           if (eo::rng.flip(rate))
+00300             {
+00301               tmp1.push_back(_eo1[i]);
+00302               tmpIsTwo = false;
+00303             }
+00304           else
+00305             tmpIsOne=false;
+00306         // we should look for _eo1[i] inside _eo2 and erase it there if found!
+00307         }
+00308       for (i=0; i<_eo2.size(); i++)
+00309         {
+00310           if (! eo::rng.flip(rate))
+00311             {
+00312               tmp1.push_back(_eo2[i]);
+00313               tmpIsOne = false;
+00314             }
+00315           else
+00316             tmpIsTwo = false;
+00317         }
+00318       index++;
+00319     } while ( ( (tmp1.size()<Min) || (tmp1.size()>Max) )
+00320               && (index<10000) );
+00321     // this while condition is not optimal, as it may take some time
+00322     if (index >= 10000)
+00323       {
+00324         std::cout << "Warning: impossible to generate individual of the right size in 10000 trials\n";
+00325         return false;
+00326       }
+00327 
+00328     _eo1.swap(tmp1);
+00329     if (tmpIsTwo)
+00330       {
+00331         //      _eo1.fitness(_eo2.fitness());     NO FITNESS EXISTS HERE!
+00332         return false;
+00333       }
+00334     if (tmpIsOne)                  // already has the right fitness
+00335       {                            // WRONG: NO FITNESS EXISTS HERE!
+00336         return false;
+00337       }
+00338     return true;                   // there were some modifications...
+00339   }
+00340 
+00341 private:
+00342   unsigned Min, Max;
+00343   double rate;
+00344 };
+00345 
+00346 
+00347 
+00348 #endif
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_variable_length_mutation_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_variable_length_mutation_8h-source.html new file mode 100644 index 000000000..2bcc9675b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_variable_length_mutation_8h-source.html @@ -0,0 +1,134 @@ + + +EO: eoVariableLengthMutation.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoVariableLengthMutation.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoVariableLengthMutation.h
+00005 // (c) Marc Schoenauer 1999 - Maarten Keijzer 2000
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: Marc.Schoenauer@polytechnique.fr
+00022              mkeijzer@cs.vu.nl
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _eoVariableLengthMutation_h
+00027 #define _eoVariableLengthMutation_h
+00028 
+00029 #include <eoFunctor.h>
+00030 #include <eoOp.h>
+00031 #include <eoInit.h>
+00032 
+00047 template <class EOT>
+00048 class eoVlAddMutation : public eoMonOp<EOT>
+00049 {
+00050 public :
+00051 
+00052   typedef typename EOT::AtomType AtomType;
+00053 
+00059   eoVlAddMutation(unsigned _nMax, eoInit<AtomType> & _atomInit) :
+00060     nMax(_nMax), atomInit(_atomInit) {}
+00061 
+00063   bool operator()(EOT & _eo)
+00064   {
+00065     if (_eo.size() >= nMax)
+00066       return false;                // unmodifed
+00067     AtomType atom;
+00068     atomInit(atom);
+00069     unsigned pos = rng.random(_eo.size()+1);
+00070     _eo.insert(_eo.begin()+pos, atom);
+00071     return true;
+00072   }
+00073 
+00075   virtual std::string className() const { return "eoVlAddMutation"; }
+00076 
+00077 private:
+00078   unsigned nMax;
+00079   eoInit<AtomType> & atomInit;
+00080 };
+00081 
+00082 
+00084 template <class EOT>
+00085 class eoGeneDelChooser : public eoUF<EOT &, unsigned int>
+00086 {
+00087 public:
+00088   virtual std::string className() const =0;
+00089 
+00090 };
+00091 
+00093 template <class EOT>
+00094 class eoUniformGeneChooser: public eoGeneDelChooser<EOT>
+00095 {
+00096 public:
+00097     eoUniformGeneChooser(){}
+00098     unsigned operator()(EOT & _eo)
+00099     {
+00100         return eo::rng.random(_eo.size());
+00101     }
+00102   virtual std::string className() const { return "eoUniformGeneChooser"; }
+00103 };
+00104 
+00109 template <class EOT>
+00110 class eoVlDelMutation : public eoMonOp<EOT>
+00111 {
+00112 public :
+00113 
+00114   typedef typename EOT::AtomType AtomType;
+00115 
+00121   eoVlDelMutation(unsigned _nMin, eoGeneDelChooser<EOT> & _chooser) :
+00122     nMin(_nMin), uChooser(), chooser(_chooser) {}
+00123 
+00128   eoVlDelMutation(unsigned _nMin) :
+00129     nMin(_nMin), uChooser(), chooser(uChooser) {}
+00130 
+00134   bool operator()(EOT & _eo)
+00135   {
+00136     if (_eo.size() <= nMin)
+00137       return false;                // unmodifed
+00138     unsigned pos = chooser(_eo);
+00139     _eo.erase(_eo.begin()+pos);
+00140     return true;
+00141   }
+00142 
+00143   virtual std::string className() const
+00144   {
+00145     std::ostringstream os;
+00146     os << "eoVlDelMutation("<<chooser.className() << ")";
+00147     return os.str();
+00148   }
+00149 
+00150 private:
+00151     unsigned nMin;
+00152     eoUniformGeneChooser<EOT> uChooser;
+00153     eoGeneDelChooser<EOT> & chooser;
+00154 };
+00155 
+00156 
+00157 
+00158 #endif
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_vector_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_vector_8h-source.html new file mode 100644 index 000000000..50968e394 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_vector_8h-source.html @@ -0,0 +1,135 @@ + + +EO: eoVector.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

eoVector.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoVector.h
+00005 // (c) GeNeura Team, 2000 - EEAAX 1999 - Maarten Keijzer 2000
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mak@dhi.dk
+00024 
+00025     CVS Info: $Date: 2005/10/06 17:22:40 $ $Header: /cvsroot/eodev/eo/src/eoVector.h,v 1.17 2005/10/06 17:22:40 kuepper Exp $ $Author: kuepper $
+00026 
+00027  */
+00028 //-----------------------------------------------------------------------------
+00029 
+00030 #ifndef _eoVector_h
+00031 #define _eoVector_h
+00032 
+00033 #include <vector>
+00034 #include <iterator>
+00035 #include <EO.h>
+00036 
+00045 template <class FitT, class GeneType>
+00046 class eoVector : public EO<FitT>, public std::vector<GeneType>
+00047 {
+00048 public:
+00049 
+00050     using EO<FitT>::invalidate;
+00051     using std::vector<GeneType>::operator[];
+00052     using std::vector<GeneType>::begin;
+00053     using std::vector<GeneType>::end;
+00054     using std::vector<GeneType>::resize;
+00055     using std::vector<GeneType>::size;
+00056 
+00057     typedef GeneType                AtomType;
+00058     typedef std::vector<GeneType>   ContainerType;
+00059 
+00065     eoVector(unsigned size = 0, GeneType value = GeneType())
+00066         : EO<FitT>(), std::vector<GeneType>(size, value)
+00067         {}
+00068 
+00070     template <class OtherFitnessType>
+00071     eoVector(const eoVector<OtherFitnessType, GeneType>& _vec) : std::vector<GeneType>(_vec)
+00072     {}
+00073 
+00074   // we can't have a Ctor from a std::vector, it would create ambiguity
+00075   //  with the copy Ctor
+00076   void value(const std::vector<GeneType>& _v)
+00077   {
+00078     if (_v.size() != size())       // safety check
+00079       {
+00080         if (size())                // NOT an initial empty std::vector
+00081           std::cout << "Warning: Changing size in eoVector assignation"<<std::endl;
+00082         resize(_v.size());
+00083       }
+00084 
+00085     std::copy(_v.begin(), _v.end(), begin());
+00086     invalidate();
+00087   }
+00088 
+00090     bool operator<(const eoVector<FitT, GeneType>& _eo) const
+00091     {
+00092         return EO<FitT>::operator<(_eo);
+00093     }
+00094 
+00096     virtual void printOn(std::ostream& os) const
+00097     {
+00098         EO<FitT>::printOn(os);
+00099         os << ' ';
+00100 
+00101         os << size() << ' ';
+00102 
+00103         std::copy(begin(), end(), std::ostream_iterator<AtomType>(os, " "));
+00104     }
+00105 
+00107     virtual void readFrom(std::istream& is)
+00108     {
+00109         EO<FitT>::readFrom(is);
+00110 
+00111         unsigned sz;
+00112         is >> sz;
+00113 
+00114         resize(sz);
+00115         unsigned i;
+00116 
+00117         for (i = 0; i < sz; ++i)
+00118         {
+00119             AtomType atom;
+00120             is >> atom;
+00121             operator[](i) = atom;
+00122         }
+00123     }
+00124 };
+00125 
+00127 template <class FitT, class GeneType>
+00128 bool operator<(const eoVector<FitT, GeneType>& _eo1, const eoVector<FitT, GeneType>& _eo2)
+00129 {
+00130     return _eo1.operator<(_eo2);
+00131 }
+00132 template <class FitT, class GeneType>
+00133 bool operator>(const eoVector<FitT, GeneType>& _eo1, const eoVector<FitT, GeneType>& _eo2)
+00134 {
+00135     return _eo1.operator>(_eo2);
+00136 }
+00137 
+00138 #endif
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/eo_virus_8h-source.html b/trunk/paradiseo-eo/doc/html/eo_virus_8h-source.html new file mode 100644 index 000000000..9cbdb62f2 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/eo_virus_8h-source.html @@ -0,0 +1,116 @@ + + +EO: eoVirus.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+contrib / MGE
+

eoVirus.h

00001 /* eoVirus.h
+00002 
+00003 (c) GeNeura Team 2001, Marc Schoenauer 2000
+00004 
+00005 This library is free software; you can redistribute it and/or modify
+00006 it under the terms of the GNU Lesser General Public License as
+00007 published by the Free Software Foundation; either version 2 of the
+00008 License, or (at your option) any later version.
+00009 
+00010 This library is distributed in the hope that it will be useful, but
+00011 WITHOUT ANY WARRANTY; without even the implied warranty of
+00012 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+00013 Lesser General Public License for more details.
+00014 
+00015 You should have received a copy of the GNU Lesser General Public
+00016 License along with this library; if not, write to the Free Software
+00017 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
+00018 USA
+00019 
+00020 Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00021          Marc.Schoenauer@polytechnique.fr
+00022 */
+00023 
+00024 
+00025 #ifndef eoVirus_h
+00026 #define eoVirus_h
+00027 
+00028 #include <iostream>
+00029 #include <functional>
+00030 #include <string>
+00031 #include <vector>
+00032 
+00033 #include "ga/eoBit.h"
+00034 
+00048 template <class FitT>
+00049 class eoVirus : public eoBit<FitT>
+00050 {
+00051 public:
+00052 
+00053     using eoBit<FitT>::begin;
+00054     using eoBit<FitT>::end;
+00055     using eoBit<FitT>::size;
+00056 
+00057 
+00062     eoVirus(unsigned _size = 0, bool _value = false, bool _virValue = false):
+00063         eoBit<FitT>(_size, _value), virus( _size, _virValue) {}
+00064 
+00066     virtual std::string className() const {
+00067         return "eoVirus";
+00068     }
+00069 
+00071     void virResize( unsigned _i ) {
+00072         virus.resize(_i );
+00073     }
+00074 
+00076     bool virusBit( unsigned _i ) const {
+00077         return virus[_i];
+00078     }
+00079 
+00081     void virusBitSet( unsigned _i, bool _bit ) {
+00082         virus[_i ] = _bit;
+00083     }
+00084 
+00089     virtual void printOn(std::ostream& os) const {
+00090         EO<FitT>::printOn(os);
+00091         os << ' ';
+00092         os << size() << ' ';
+00093         std::copy(begin(), end(), std::ostream_iterator<bool>(os));
+00094         std::cout << std::endl;
+00095         std::copy(virus.begin(), virus.end(), std::ostream_iterator<bool>(os));
+00096     }
+00097 
+00102     virtual void readFrom(std::istream& is){
+00103         eoBit<FitT>::readFrom(is);
+00104         unsigned s;
+00105         is >> s;
+00106         std::string bits;
+00107         is >> bits;
+00108         if (is) {
+00109             virus.resize(bits.size());
+00110             std::transform(bits.begin(), bits.end(), virus.begin(),
+00111                            std::bind2nd(std::equal_to<char>(), '1'));
+00112         }
+00113     }
+00114 
+00115 
+00116 private:
+00117 
+00118     std::vector<bool> virus;
+00119 };
+00120 
+00121 //-----------------------------------------------------------------------------
+00122 
+00123 #endif //eoBit_h
+00124 
+00125 
+00126 // Local Variables:
+00127 // coding: iso-8859-1
+00128 // mode: C++
+00129 // c-file-style: "Stroustrup"
+00130 // End:
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/es_2make__op_8h-source.html b/trunk/paradiseo-eo/doc/html/es_2make__op_8h-source.html new file mode 100644 index 000000000..39cbcd3e0 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/es_2make__op_8h-source.html @@ -0,0 +1,303 @@ + + +EO: make_op.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

es/make_op.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_op.h - the real-valued version
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _make_op_h
+00028 #define _make_op_h
+00029 
+00030 // the operators
+00031 #include <eoOp.h>
+00032 #include <eoGenOp.h>
+00033 #include <eoCloneOps.h>
+00034 #include <eoOpContainer.h>
+00035 // combinations of simple eoOps (eoMonOp and eoQuadOp)
+00036 #include <eoProportionalCombinedOp.h>
+00037 
+00038 // the specialized Real stuff
+00039 #include <es/eoReal.h>
+00040 #include <es/eoRealInitBounded.h>
+00041 #include <es/eoRealOp.h>
+00042 #include <es/eoNormalMutation.h>
+00043   // also need the parser and param includes
+00044 #include <utils/eoParser.h>
+00045 #include <utils/eoState.h>
+00046 
+00047 
+00048 /*
+00049  * This function builds the operators that will be applied to the eoReal
+00050  *
+00051  * It uses a parser (to get user parameters) and a state (to store the memory)
+00052  * the last argument is an individual, needed for 2 reasons
+00053  *     it disambiguates the call after instanciations
+00054  *     some operator might need some private information about the indis
+00055  *
+00056  * This is why the template is the complete EOT even though only the fitness
+00057  * is actually templatized here: the following only applies to bitstrings
+00058  *
+00059  * Note : the last parameter is an eoInit: if some operator needs some info
+00060  *        about the gneotypes, the init has it all (e.g. bounds, ...)
+00061  *        Simply do
+00062  *        EOT myEO;
+00063  *        _init(myEO);
+00064  *        and myEO is then an ACTUAL object
+00065 */
+00066 template <class EOT>
+00067 eoGenOp<EOT> & do_make_op(eoParameterLoader& _parser, eoState& _state, eoInit<EOT>& _init)
+00068 {
+00069   // First, decide whether the objective variables are bounded
+00070   eoValueParam<eoParamParamType>& boundsParam
+00071       = _parser.getORcreateParam(eoParamParamType("(0,1)"), "objectBounds",
+00072                                  "Bounds for variables (unbounded if absent)",
+00073                                  'B', "Genetic Operators");
+00074 
+00075   // get initisalizer size == std::vector size
+00076   //  eoRealInitBounded<EOT> * realInit = (eoRealInitBounded<EOT>*)(&_init);
+00077   //  unsigned vecSize = realInit->theBounds().size();
+00078 
+00079   // get std::vector size: safer???
+00080   EOT eoTmp;
+00081   _init(eoTmp);
+00082   unsigned vecSize = eoTmp.size();
+00083 
+00084   // the bounds pointer
+00085   eoRealVectorBounds * ptBounds;
+00086   if (_parser.isItThere(boundsParam))   // otherwise, no bounds
+00087     {
+00091       eoParamParamType & ppBounds = boundsParam.value(); // std::pair<std::string,std::vector<std::string> >
+00092       // transform into a std::vector<double>
+00093       std::vector<double> v;
+00094       std::vector<std::string>::iterator it;
+00095       for (it=ppBounds.second.begin(); it<ppBounds.second.end(); it++)
+00096         {
+00097           istrstream is(it->c_str());
+00098           double r;
+00099           is >> r;
+00100           v.push_back(r);
+00101         }
+00102       // now create the eoRealVectorBounds object
+00103       if (v.size() == 2) // a min and a max for all variables
+00104         ptBounds = new eoRealVectorBounds(vecSize, v[0], v[1]);
+00105       else                                 // no time now
+00106         throw std::runtime_error("Sorry, only unique bounds for all variables implemented at the moment. Come back later");
+00107       // we need to give ownership of this pointer to somebody
+00109     }
+00110   else                     // no param for bounds was given
+00111     ptBounds = new eoRealVectorNoBounds(vecSize); // DON'T USE eoDummyVectorNoBounds
+00112                                    // as it does not have any dimension
+00113 
+00114   // this is a temporary version(!),
+00115   // while Maarten codes the full tree-structured general operator input
+00116   // BTW we must leave that simple version available somehow, as it is the one
+00117   // that 90% people use!
+00118   eoValueParam<std::string>& operatorParam
+00119       =  _parser.getORcreateParam(std::string("SGA"), "operator",
+00120                                   "Description of the operator (SGA only now)",
+00121                                   'o', "Genetic Operators");
+00122 
+00123   if (operatorParam.value() != std::string("SGA"))
+00124     throw std::runtime_error("Sorry, only SGA-like operator available right now\n");
+00125 
+00126     // now we read Pcross and Pmut,
+00127     // the relative weights for all crossovers -> proportional choice
+00128     // the relative weights for all mutations -> proportional choice
+00129     // and create the eoGenOp that is exactly
+00130     // crossover with pcross + mutation with pmut
+00131 
+00132   eoValueParam<double>& pCrossParam
+00133       = _parser.getORcreateParam(0.6, "pCross", "Probability of Crossover",
+00134                                  'C', "Genetic Operators" );
+00135   // minimum check
+00136   if ( (pCrossParam.value() < 0) || (pCrossParam.value() > 1) )
+00137     throw std::runtime_error("Invalid pCross");
+00138 
+00139   eoValueParam<double>& pMutParam
+00140       = _parser.getORcreateParam(0.1, "pMut", "Probability of Mutation",
+00141                                  'M', "Genetic Operators" );
+00142   // minimum check
+00143   if ( (pMutParam.value() < 0) || (pMutParam.value() > 1) )
+00144     throw std::runtime_error("Invalid pMut");
+00145 
+00146     // the crossovers
+00148     // the parameters
+00149   eoValueParam<double>& segmentRateParam
+00150       = _parser.getORcreateParam(double(1.0), "segmentRate",
+00151                                  "Relative rate for segment crossover",
+00152                                  's', "Genetic Operators" );
+00153   // minimum check
+00154   if ( (segmentRateParam.value() < 0) )
+00155     throw std::runtime_error("Invalid segmentRate");
+00156 
+00157   eoValueParam<double>& arithmeticRateParam
+00158       = _parser.getORcreateParam(double(2.0), "arithmeticRate",
+00159                                  "Relative rate for arithmetic crossover",
+00160                                  'A', "Genetic Operators" );
+00161   // minimum check
+00162   if ( (arithmeticRateParam.value() < 0) )
+00163     throw std::runtime_error("Invalid arithmeticRate");
+00164 
+00165     // minimum check
+00166   bool bCross = true;
+00167   if (segmentRateParam.value()+arithmeticRateParam.value()==0)
+00168     {
+00169       std::cerr << "Warning: no crossover" << std::endl;
+00170       bCross = false;
+00171     }
+00172 
+00173   // Create the CombinedQuadOp
+00174   eoPropCombinedQuadOp<EOT> *ptCombinedQuadOp = NULL;
+00175   eoQuadOp<EOT> *ptQuad = NULL;
+00176 
+00177   if (bCross)
+00178     {
+00179       // segment crossover for bitstring - pass it the bounds
+00180       ptQuad = new eoSegmentCrossover<EOT>(*ptBounds);
+00181       _state.storeFunctor(ptQuad);
+00182       ptCombinedQuadOp = new eoPropCombinedQuadOp<EOT>(*ptQuad, segmentRateParam.value());
+00183 
+00184         // arithmetic crossover
+00185       ptQuad = new eoArithmeticCrossover<EOT>(*ptBounds);
+00186       _state.storeFunctor(ptQuad);
+00187       ptCombinedQuadOp->add(*ptQuad, arithmeticRateParam.value());
+00188 
+00189       // don't forget to store the CombinedQuadOp
+00190       _state.storeFunctor(ptCombinedQuadOp);
+00191     }
+00192 
+00193   // the mutations
+00195   // the parameters
+00196   eoValueParam<double> & epsilonParam
+00197       = _parser.getORcreateParam(0.01, "epsilon", "Half-size of interval for Uniform Mutation",
+00198                                  'e', "Genetic Operators" );
+00199   // minimum check
+00200   if ( (epsilonParam.value() < 0) )
+00201     throw std::runtime_error("Invalid epsilon");
+00202 
+00203   eoValueParam<double> & uniformMutRateParam
+00204       = _parser.getORcreateParam(1.0, "uniformMutRate",
+00205                                  "Relative rate for uniform mutation", 'u', "Genetic Operators" );
+00206   // minimum check
+00207   if ( (uniformMutRateParam.value() < 0) )
+00208     throw std::runtime_error("Invalid uniformMutRate");
+00209 
+00210   eoValueParam<double> & detMutRateParam
+00211       = _parser.getORcreateParam(1.0, "detMutRate",
+00212                                  "Relative rate for deterministic uniform mutation",
+00213                                  'd', "Genetic Operators" );
+00214   // minimum check
+00215   if ( (detMutRateParam.value() < 0) )
+00216     throw std::runtime_error("Invalid detMutRate");
+00217 
+00218   eoValueParam<double> & normalMutRateParam
+00219       = _parser.getORcreateParam(1.0, "normalMutRate",
+00220                                  "Relative rate for Gaussian mutation",
+00221                                  'd', "Genetic Operators" );
+00222   // minimum check
+00223   if ( (normalMutRateParam.value() < 0) )
+00224     throw std::runtime_error("Invalid normalMutRate");
+00225   // and the sigma
+00226   eoValueParam<double> & sigmaParam
+00227       = _parser.getORcreateParam(1.0, "sigma",
+00228                                  "Sigma (fixed) for Gaussian mutation",
+00229                                  'S', "Genetic Operators" );
+00230   // minimum check
+00231   if ( (sigmaParam.value() < 0) )
+00232     throw std::runtime_error("Invalid sigma");
+00233 
+00234     // minimum check
+00235   bool bMut = true;
+00236   if (uniformMutRateParam.value()+detMutRateParam.value()+normalMutRateParam.value()==0)
+00237     {
+00238       std::cerr << "Warning: no mutation" << std::endl;
+00239       bMut = false;
+00240     }
+00241   if (!bCross && !bMut)
+00242     throw std::runtime_error("No operator called in SGA operator definition!!!");
+00243 
+00244     // Create the CombinedMonOp
+00245   eoPropCombinedMonOp<EOT> *ptCombinedMonOp = NULL;
+00246   eoMonOp<EOT> *ptMon = NULL;
+00247 
+00248   if (bMut)
+00249     {
+00250       // uniform mutation on all components:
+00251       // offspring(i) uniformly chosen in [parent(i)-epsilon, parent(i)+epsilon]
+00252       ptMon = new eoUniformMutation<EOT>(*ptBounds, epsilonParam.value());
+00253       _state.storeFunctor(ptMon);
+00254       // create the CombinedMonOp
+00255       ptCombinedMonOp = new eoPropCombinedMonOp<EOT>(*ptMon, uniformMutRateParam.value());
+00256 
+00257         // mutate exactly 1 component (uniformly) per individual
+00258       ptMon = new eoDetUniformMutation<EOT>(*ptBounds, epsilonParam.value());
+00259       _state.storeFunctor(ptMon);
+00260       ptCombinedMonOp->add(*ptMon, detMutRateParam.value());
+00261 
+00262       // mutate all component using Gaussian mutation
+00263       ptMon = new eoNormalMutation<EOT>(*ptBounds, sigmaParam.value());
+00264       _state.storeFunctor(ptMon);
+00265       ptCombinedMonOp->add(*ptMon, normalMutRateParam.value());
+00266       _state.storeFunctor(ptCombinedMonOp);
+00267     }
+00268 
+00269   // now build the eoGenOp:
+00270   // to simulate SGA (crossover with proba pCross + mutation with proba pMut
+00271   // we must construct
+00272   //     a sequential combination of
+00273   //          with proba 1, a proportional combination of
+00274   //                        a QuadCopy and our crossover
+00275   //          with proba pMut, our mutation
+00276 
+00277   // the crossover - with probability pCross
+00278   eoProportionalOp<EOT> * cross = new eoProportionalOp<EOT> ;
+00279   _state.storeFunctor(cross);
+00280   ptQuad = new eoQuadCloneOp<EOT>;
+00281   _state.storeFunctor(ptQuad);
+00282   cross->add(*ptCombinedQuadOp, pCrossParam.value()); // user crossover
+00283   cross->add(*ptQuad, 1-pCrossParam.value()); // clone operator
+00284 
+00285   // now the sequential
+00286   eoSequentialOp<EOT> *op = new eoSequentialOp<EOT>;
+00287   _state.storeFunctor(op);
+00288   op->add(*cross, 1.0);  // always crossover (but clone with prob 1-pCross
+00289   op->add(*ptCombinedMonOp, pMutParam.value());
+00290 
+00291   // that's it!
+00292   return *op;
+00293 }
+00294 #endif
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/es_8h-source.html b/trunk/paradiseo-eo/doc/html/es_8h-source.html new file mode 100644 index 000000000..86a64c4fb --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/es_8h-source.html @@ -0,0 +1,78 @@ + + +EO: es.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

es.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // es.h
+00005 // (c) GeNeura Team 1998 - Maarten Keijzer 2000 - Marc Schoenauer 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: Marc.Schoenauer@polytechnique.fr
+00022              mak@dhi.dk
+00023              todos@geneura.ugr.es, http://geneura.ugr.es
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifdef _MSC_VER
+00028 // to avoid long name warnings
+00029 #pragma warning(disable:4786)
+00030 #endif 
+00031 
+00032 #ifndef _es_h
+00033 #define _es_h
+00034 
+00035 // contains the include specific to real representations, i.e. in src/es dir
+00036 //-----------------------------------------------------------------------------
+00037  
+00038 // the genotypes - from plain std::vector<double> to full correlated mutation
+00039 #include <es/eoReal.h>
+00040 #include <es/eoEsSimple.h>
+00041 #include <es/eoEsStdev.h>
+00042 #include <es/eoEsFull.h>
+00043 
+00044 // the initialization
+00045 #include <es/eoEsChromInit.h>
+00046 
+00047 // general operators
+00048 #include <es/eoRealOp.h>
+00049 #include <es/eoNormalMutation.h>
+00050 #include <es/eoRealAtomXover.h> // for generic operators
+00051 
+00052 // SBX crossover (following Deb)
+00053 #include <es/eoSBXcross.h>
+00054 
+00055 // ES specific operators
+00056 #include <es/eoEsGlobalXover.h> // Global ES Xover
+00057 #include <es/eoEsStandardXover.h> // 2-parents ES Xover
+00058 
+00059 // the ES-mutations
+00060 #include <es/eoEsMutationInit.h>
+00061 #include <es/eoEsMutate.h>
+00062 
+00063 #endif
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/exercise1_83_8cpp-source.html b/trunk/paradiseo-eo/doc/html/exercise1_83_8cpp-source.html new file mode 100644 index 000000000..10ad2bd06 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/exercise1_83_8cpp-source.html @@ -0,0 +1,159 @@ + + +EO: exercise1.3.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Lesson1
+

exercise1.3.cpp

00001 #ifdef HAVE_CONFIG_H
+00002 #include <config.h>
+00003 #endif
+00004 
+00005 //-----------------------------------------------------------------------------
+00006 // FirstBitGA.cpp
+00007 //-----------------------------------------------------------------------------
+00008 //*
+00009 // An instance of a VERY simple Bitstring Genetic Algorithm
+00010 //
+00011 //-----------------------------------------------------------------------------
+00012 // standard includes
+00013 #include <iostream>
+00014 #include <stdexcept>
+00015 
+00016 // the general include for eo
+00017 #include <eo>
+00018 
+00019 //-----------------------------------------------------------------------------
+00020 // Include the corresponding file
+00021 #include <ga.h>          // bitstring representation & operators
+00022 // define your individuals
+00023 typedef eoBit<double> Indi;     // A bitstring with fitness double
+00024 
+00025 using namespace std;
+00026 
+00027 //-----------------------------------------------------------------------------
+00032 double binary_value(const Indi & _indi)
+00033 {
+00034   double sum = 0;
+00035   for (unsigned i = 0; i < _indi.size(); i++)
+00036     sum += _indi[i];
+00037   return sum;
+00038 }
+00039 
+00040 //-----------------------------------------------------------------------------
+00041 
+00042 void main_function(int argc, char **argv)
+00043 {
+00044   const unsigned int SEED = 42; // seed for random number generator
+00045   const unsigned int VEC_SIZE = 8; // Number of bits in genotypes
+00046   const unsigned int POP_SIZE = 20; // Size of population
+00047   const unsigned int MAX_GEN = 500; // Maximum number of generation before STOP
+00048   const float CROSS_RATE = 0.8; // Crossover rate
+00049   const double P_MUT_PER_BIT = 0.01;    // probability of bit-flip mutation
+00050   const float MUT_RATE = 1.0;   // mutation rate
+00051 
+00053   //  Random seed
+00055   //reproducible random seed: if you don't change SEED above,
+00056   // you'll aways get the same result, NOT a random run
+00057   rng.reseed(SEED);
+00058 
+00060   // Fitness function
+00062   // Evaluation: from a plain C++ fn to an EvalFunc Object
+00063   eoEvalFuncPtr<Indi> eval(  binary_value );
+00064 
+00066   // Initilisation of population
+00068 
+00069   // declare the population
+00070   eoPop<Indi> pop;
+00071   // fill it!
+00072   for (unsigned int igeno=0; igeno<POP_SIZE; igeno++)
+00073     {
+00074       Indi v;           // void individual, to be filled
+00075       for (unsigned ivar=0; ivar<VEC_SIZE; ivar++)
+00076         {
+00077           bool r = rng.flip(); // new value, random in {0,1}
+00078           v.push_back(r);       // append that random value to v
+00079         }
+00080       eval(v);                  // evaluate it
+00081       pop.push_back(v);         // and put it in the population
+00082     }
+00083 
+00084   // sort pop before printing it!
+00085   pop.sort();
+00086   // Print (sorted) intial population (raw printout)
+00087   cout << "Initial Population" << endl;
+00088   cout << pop;
+00089 
+00091   // selection and replacement
+00093 
+00094   // solution solution solution: uncomment one of the following,
+00095   //                             comment out the eoDetTournament lines
+00096 
+00097   // The well-known roulette
+00098   // eoProportionalSelect<Indi> select;
+00099 
+00100   // could also use stochastic binary tournament selection
+00101   //
+00102   //  const double RATE = 0.75;
+00103   //  eoStochTournamentSelect<Indi> select(RATE);     // RATE in ]0.5,1]
+00104   // The robust tournament selection
+00105   const unsigned int T_SIZE = 3; // size for tournament selection
+00106   eoDetTournamentSelect<Indi> select(T_SIZE);       // T_SIZE in [2,POP_SIZE]
+00107 
+00108   // and of course the random selection
+00109   // eoRandomSelect<Indi> select;
+00110 
+00111   // The simple GA evolution engine uses generational replacement
+00112   // so no replacement procedure is needed
+00113 
+00115   // termination condition
+00117   // stop after MAX_GEN generations
+00118   eoGenContinue<Indi> continuator(MAX_GEN);
+00119 
+00120 
+00122   // The variation operators
+00124   // standard bit-flip mutation for bitstring
+00125   eoBitMutation<Indi>  mutation(P_MUT_PER_BIT);
+00126   // 1-point mutation for bitstring
+00127   eo1PtBitXover<Indi> xover;
+00128 
+00130   // the algorithm
+00132   // standard Generational GA requires as parameters
+00133   // selection, evaluation, crossover and mutation, stopping criterion
+00134 
+00135 
+00136   eoSGA<Indi> gga(select, xover, CROSS_RATE, mutation, MUT_RATE,
+00137                    eval, continuator);
+00138 
+00139   // Apply algo to pop - that's it!
+00140   gga(pop);
+00141 
+00142   // Print (sorted) intial population
+00143   pop.sort();
+00144   cout << "FINAL Population\n" << pop << endl;
+00145 }
+00146 
+00147 // A main that catches the exceptions
+00148 
+00149 int main(int argc, char **argv)
+00150 {
+00151 
+00152     try
+00153     {
+00154         main_function(argc, argv);
+00155     }
+00156     catch(exception& e)
+00157     {
+00158         cout << "Exception: " << e.what() << '\n';
+00159     }
+00160 
+00161     return 1;
+00162 }
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/exercise2_83_8cpp-source.html b/trunk/paradiseo-eo/doc/html/exercise2_83_8cpp-source.html new file mode 100644 index 000000000..a78228a4a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/exercise2_83_8cpp-source.html @@ -0,0 +1,198 @@ + + +EO: exercise2.3.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Lesson2
+

exercise2.3.cpp

00001 //-----------------------------------------------------------------------------
+00002 // FirstBitEA.cpp
+00003 //-----------------------------------------------------------------------------
+00004 //*
+00005 // Still an instance of a VERY simple Bitstring Genetic Algorithm
+00006 // (see FirstBitGA.cpp) but now with  Breeder - and Combined Ops
+00007 //
+00008 //-----------------------------------------------------------------------------
+00009 #ifdef HAVE_CONFIG_H
+00010 #include <config.h>
+00011 #endif
+00012 
+00013 // standard includes
+00014 #include <stdexcept>  // runtime_error
+00015 #include <iostream>   // cout
+00016 
+00017 // the general include for eo
+00018 #include <eo>
+00019 
+00020 // REPRESENTATION
+00021 //-----------------------------------------------------------------------------
+00022 // Include the corresponding file
+00023 #include <ga.h>          // bitstring representation & operators
+00024 // define your individuals
+00025 typedef eoBit<double> Indi;     // A bitstring with fitness double
+00026 
+00027 // EVAL
+00028 //-----------------------------------------------------------------------------
+00029 // a simple fitness function that computes the number of ones of a bitstring
+00030 // Now in a separate file, and declared as binary_value(const vector<bool> &)
+00031 
+00032 #include "binary_value.h"
+00033 
+00034 // GENERAL
+00035 //-----------------------------------------------------------------------------
+00036 
+00037 using namespace std;
+00038 
+00039 void main_function(int argc, char **argv)
+00040 {
+00041 // PARAMETRES
+00042   const unsigned int SEED = 42; // seed for random number generator
+00043   const unsigned int T_SIZE = 3; // size for tournament selection
+00044   const unsigned int VEC_SIZE = 20; // Number of bits in genotypes
+00045   const unsigned int POP_SIZE = 20; // Size of population
+00046 
+00047   const unsigned int MAX_GEN = 500; // Maximum number of generation before STOP
+00048   const unsigned int MIN_GEN = 10;  // Minimum number of generation before ...
+00049   const unsigned int STEADY_GEN = 50; // stop after STEADY_GEN gen. without improvelent
+00050 
+00051   const double P_CROSS = 0.8;   // Crossover probability
+00052   const double P_MUT = 1.0;     // mutation probability
+00053 
+00054   const double P_MUT_PER_BIT = 0.01;    // internal probability for bit-flip mutation
+00055   // some parameters for chosing among different operators
+00056   const double onePointRate = 0.5;     // rate for 1-pt Xover
+00057   const double twoPointsRate = 0.5;     // rate for 2-pt Xover
+00058   const double URate = 0.5;            // rate for Uniform Xover
+00059   const double bitFlipRate = 0.5;      // rate for bit-flip mutation
+00060   const double oneBitRate = 0.5;       // rate for one-bit mutation
+00061 
+00062 // GENERAL
+00064   //  Random seed
+00066   //reproducible random seed: if you don't change SEED above,
+00067   // you'll aways get the same result, NOT a random run
+00068   rng.reseed(SEED);
+00069 
+00070 // EVAL
+00072   // Fitness function
+00074   // Evaluation: from a plain C++ fn to an EvalFunc Object
+00075   // you need to give the full description of the function
+00076   eoEvalFuncPtr<Indi, double, const vector<bool>& > eval(  binary_value );
+00077 
+00078 // INIT
+00080   // Initilisation of population
+00082 
+00083   // based on boolean_generator class (see utils/rnd_generator.h)
+00084   eoUniformGenerator<bool> uGen;
+00085   eoInitFixedLength<Indi> random(VEC_SIZE, uGen);
+00086   // Initialization of the population
+00087   eoPop<Indi> pop(POP_SIZE, random);
+00088 
+00089   // and evaluate it in one loop
+00090   apply<Indi>(eval, pop);       // STL syntax
+00091 
+00092 // OUTPUT
+00093   // sort pop before printing it!
+00094   pop.sort();
+00095   // Print (sorted) intial population (raw printout)
+00096   cout << "Initial Population" << endl;
+00097   cout << pop;
+00098 
+00099 // ENGINE
+00101   // selection and replacement
+00103 // SELECT
+00104   // The robust tournament selection
+00105   eoDetTournamentSelect<Indi> selectOne(T_SIZE);       // T_SIZE in [2,POP_SIZE]
+00106   // solution solution solution solution solution solution solution
+00107   // modify the nb offspring / rate in the constructor. 2 ways:
+00108   // second arg treated as integer
+00109   eoSelectMany<Indi> select(selectOne,2, eo_is_an_integer);
+00110   // second arg treated as a rate (default behavior)
+00111   //  eoSelectMany<Indi> select(selectOne,0.1);
+00112 
+00113 // REPLACE
+00114   // solution solution solution solution solution solution solution
+00115   // eoCommaReplacement keeps the best among offspring
+00116   // eoPlusReplacement keeps the best among parents + offspring
+00117   //  eoCommaReplacement<Indi> replace;
+00118   eoPlusReplacement<Indi> replace;
+00119 
+00120 // OPERATORS
+00122   // The variation operators
+00124 // CROSSOVER
+00125   // 1-point crossover for bitstring
+00126   eo1PtBitXover<Indi> xover1;
+00127   // uniform crossover for bitstring
+00128   eoUBitXover<Indi> xoverU;
+00129   // 2-pots xover
+00130   eoNPtsBitXover<Indi> xover2(2);
+00131   // Combine them with relative rates
+00132   eoPropCombinedQuadOp<Indi> xover(xover1, onePointRate);
+00133   xover.add(xoverU, URate);
+00134   xover.add(xover2, twoPointsRate, true);
+00135 
+00136 // MUTATION
+00137   // standard bit-flip mutation for bitstring
+00138   eoBitMutation<Indi>  mutationBitFlip(P_MUT_PER_BIT);
+00139   // mutate exactly 1 bit per individual
+00140   eoDetBitFlip<Indi> mutationOneBit;
+00141   // Combine them with relative rates
+00142   eoPropCombinedMonOp<Indi> mutation(mutationBitFlip, bitFlipRate);
+00143   mutation.add(mutationOneBit, oneBitRate, true);
+00144 
+00145   // The operators are  encapsulated into an eoTRansform object
+00146   eoSGATransform<Indi> transform(xover, P_CROSS, mutation, P_MUT);
+00147 
+00148 // STOP
+00149 // CHECKPOINT
+00151   // termination conditions: use more than one
+00153   // stop after MAX_GEN generations
+00154   eoGenContinue<Indi> genCont(MAX_GEN);
+00155   // do MIN_GEN gen., then stop after STEADY_GEN gen. without improvement
+00156   eoSteadyFitContinue<Indi> steadyCont(MIN_GEN, STEADY_GEN);
+00157   // stop when fitness reaches a target (here VEC_SIZE)
+00158   eoFitContinue<Indi> fitCont(VEC_SIZE);
+00159   // do stop when one of the above says so
+00160   eoCombinedContinue<Indi> continuator(genCont);
+00161   continuator.add(steadyCont);
+00162   continuator.add(fitCont);
+00163 
+00164 // GENERATION
+00166   // the algorithm
+00168 
+00169   // Easy EA requires
+00170   // selection, transformation, eval, replacement, and stopping criterion
+00171   eoEasyEA<Indi> gga(continuator, eval, select, transform, replace);
+00172 
+00173   // Apply algo to pop - that's it!
+00174   gga(pop);
+00175 
+00176 // OUTPUT
+00177   // Print (sorted) intial population
+00178   pop.sort();
+00179   cout << "FINAL Population\n" << pop << endl;
+00180 // GENERAL
+00181 }
+00182 
+00183 // A main that catches the exceptions
+00184 
+00185 int main(int argc, char **argv)
+00186 {
+00187     try
+00188     {
+00189         main_function(argc, argv);
+00190     }
+00191     catch(exception& e)
+00192     {
+00193         cout << "Exception: " << e.what() << '\n';
+00194     }
+00195 
+00196     return 1;
+00197 }
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/exercise3_81_8cpp-source.html b/trunk/paradiseo-eo/doc/html/exercise3_81_8cpp-source.html new file mode 100644 index 000000000..4c4afb905 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/exercise3_81_8cpp-source.html @@ -0,0 +1,407 @@ + + +EO: exercise3.1.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Lesson3
+

exercise3.1.cpp

00001 //-----------------------------------------------------------------------------
+00002 // SecondBitGA.cpp
+00003 //-----------------------------------------------------------------------------
+00004 //*
+00005 // Same code than FirstBitEA as far as Evolutionary Computation is concerned
+00006 // but now you learn to enter the parameters in a more flexible way
+00007 // and to twidle the output to your preferences!
+00008 //-----------------------------------------------------------------------------
+00009 #ifdef HAVE_CONFIG_H
+00010 #include <config.h>
+00011 #endif
+00012 
+00013 // standard includes
+00014 #include <fstream>
+00015 #include <iostream>   // cout
+00016 #include <stdexcept>  // runtime_error
+00017 
+00018 // the general include for eo
+00019 #include <eo>
+00020 
+00021 // EVAL
+00022 #include "binary_value.h"
+00023 
+00024 // REPRESENTATION
+00025 //-----------------------------------------------------------------------------
+00026 // Include the corresponding file
+00027 #include <ga.h>          // bitstring representation & operators
+00028 // define your genotype and fitness types
+00029 typedef eoBit<eoMinimizingFitness> Indi;
+00030 
+00031 using namespace std;
+00032 
+00033 // the main_function: nothing changed(!), except variable initialization
+00034 void main_function(int argc, char **argv)
+00035 {
+00036 // PARAMETRES
+00037 //-----------------------------------------------------------------------------
+00038 // instead of having all values of useful parameters as constants, read them:
+00039 // either on the command line (--option=value or -o=value)
+00040 //     or in a parameter file (same syntax, order independent,
+00041 //                             # = usual comment character
+00042 //     or in the environment (TODO)
+00043 
+00044   // First define a parser from the command-line arguments
+00045     eoParser parser(argc, argv);
+00046 
+00047     // For each parameter, define Parameter, read it through the parser,
+00048     // and assign the value to the variable
+00049 
+00050     eoValueParam<uint32_t> seedParam(time(0), "seed", "Random number seed", 'S');
+00051     parser.processParam( seedParam );
+00052     unsigned seed = seedParam.value();
+00053 
+00054    // description of genotype
+00055     eoValueParam<unsigned int> vecSizeParam(100, "vecSize", "Genotype size",'V');
+00056     parser.processParam( vecSizeParam, "Representation" );
+00057     unsigned vecSize = vecSizeParam.value();
+00058 
+00059    // parameters for evolution engine
+00060     eoValueParam<unsigned int> popSizeParam(100, "popSize", "Population size",'P');
+00061     parser.processParam( popSizeParam, "Evolution engine" );
+00062     unsigned popSize = popSizeParam.value();
+00063 
+00064     eoValueParam<unsigned int> tSizeParam(10, "tSize", "Tournament size",'T');
+00065     parser.processParam( tSizeParam, "Evolution Engine" );
+00066     unsigned tSize = tSizeParam.value();
+00067 
+00068    // init and stop
+00069     eoValueParam<string> loadNameParam("", "Load","A save file to restart from",'L');
+00070     parser.processParam( loadNameParam, "Persistence" );
+00071     string loadName = loadNameParam.value();
+00072 
+00073     eoValueParam<unsigned int> maxGenParam(500, "maxGen", "Maximum number of generations",'G');
+00074     parser.processParam( maxGenParam, "Stopping criterion" );
+00075     unsigned maxGen = maxGenParam.value();
+00076 
+00077     eoValueParam<unsigned int> minGenParam(500, "minGen", "Minimum number of generations",'g');
+00078     parser.processParam( minGenParam, "Stopping criterion" );
+00079     unsigned minGen = minGenParam.value();
+00080 
+00081     eoValueParam<unsigned int> steadyGenParam(100, "steadyGen", "Number of generations with no improvement",'s');
+00082     parser.processParam( steadyGenParam, "Stopping criterion" );
+00083     unsigned steadyGen = steadyGenParam.value();
+00084 
+00085    // operators probabilities at the algorithm level
+00086     eoValueParam<double> pCrossParam(0.6, "pCross", "Probability of Crossover", 'C');
+00087     parser.processParam( pCrossParam, "Genetic Operators" );
+00088     double pCross = pCrossParam.value();
+00089 
+00090     eoValueParam<double> pMutParam(0.1, "pMut", "Probability of Mutation", 'M');
+00091     parser.processParam( pMutParam, "Genetic Operators" );
+00092     double pMut = pMutParam.value();
+00093 
+00094    // relative rates for crossovers
+00095     eoValueParam<double> onePointRateParam(1, "onePointRate", "Relative rate for one point crossover", '1');
+00096     parser.processParam( onePointRateParam, "Genetic Operators" );
+00097     double onePointRate = onePointRateParam.value();
+00098 
+00099     eoValueParam<double> twoPointsRateParam(1, "twoPointRate", "Relative rate for two point crossover", '2');
+00100     parser.processParam( twoPointsRateParam, "Genetic Operators" );
+00101     double twoPointsRate = twoPointsRateParam.value();
+00102 
+00103     eoValueParam<double> uRateParam(2, "uRate", "Relative rate for uniform crossover", 'U');
+00104     parser.processParam( uRateParam, "Genetic Operators" );
+00105     double URate =  uRateParam.value();
+00106 
+00107    // relative rates and private parameters for mutations;
+00108     eoValueParam<double> pMutPerBitParam(0.01, "pMutPerBit", "Probability of flipping 1 bit in bit-flip mutation", 'b');
+00109     parser.processParam( pMutPerBitParam, "Genetic Operators" );
+00110     double pMutPerBit = pMutPerBitParam.value();
+00111 
+00112     eoValueParam<double> bitFlipRateParam(0.01, "bitFlipRate", "Relative rate for bit-flip mutation", 'B');
+00113     parser.processParam( bitFlipRateParam, "Genetic Operators" );
+00114     double bitFlipRate =  bitFlipRateParam.value();
+00115 
+00116     eoValueParam<double> oneBitRateParam(0.01, "oneBitRate", "Relative rate for deterministic bit-flip mutation", 'D');
+00117     parser.processParam( oneBitRateParam, "Genetic Operators" );
+00118     double oneBitRate = oneBitRateParam.value();
+00119 
+00120     // the name of the "status" file where all actual parameter values will be saved
+00121     string str_status = parser.ProgramName() + ".status"; // default value
+00122     eoValueParam<string> statusParam(str_status.c_str(), "status","Status file",'S');
+00123     parser.processParam( statusParam, "Persistence" );
+00124 
+00125    // do the following AFTER ALL PARAMETERS HAVE BEEN PROCESSED
+00126    // i.e. in case you need parameters somewhere else, postpone these
+00127     if (parser.userNeedsHelp())
+00128       {
+00129         parser.printHelp(cout);
+00130         exit(1);
+00131       }
+00132     if (statusParam.value() != "")
+00133       {
+00134         ofstream os(statusParam.value().c_str());
+00135         os << parser;           // and you can use that file as parameter file
+00136       }
+00137 
+00138 // EVAL
+00140   // Fitness function
+00142   // Evaluation: from a plain C++ fn to an EvalFunc Object ...
+00143   eoEvalFuncPtr<Indi, double, const vector<bool>& > plainEval( binary_value );
+00144   // ... to an object that counts the nb of actual evaluations
+00145   eoEvalFuncCounter<Indi> eval(plainEval);
+00146 
+00147 // INIT
+00149   // Initilisation of population
+00151   // Either load or initialize
+00152   // create an empty pop
+00153   eoPop<Indi> pop;
+00154   // create a state for reading
+00155   eoState inState;              // a state for loading - WITHOUT the parser
+00156   // register the rng and the pop in the state, so they can be loaded,
+00157   // and the present run will be the exact conitnuation of the saved run
+00158   // eventually with different parameters
+00159   inState.registerObject(rng);
+00160   inState.registerObject(pop);
+00161 
+00162   if (loadName != "")
+00163     {
+00164       inState.load(loadName); //  load the pop and the rng
+00165       // the fitness is read in the file:
+00166       // do only evaluate the pop if the fitness has changed
+00167     }
+00168   else
+00169     {
+00170       rng.reseed(seed);
+00171       // a Indi random initializer
+00172       // based on boolean_generator class (see utils/rnd_generator.h)
+00173       eoUniformGenerator<bool> uGen;
+00174       eoInitFixedLength<Indi> random(vecSize, uGen);
+00175 
+00176       // Init pop from the randomizer: need to use the append function
+00177       pop.append(popSize, random);
+00178       // and evaluate pop (STL syntax)
+00179       apply<Indi>(eval, pop);
+00180     } // end of initializatio of the population
+00181 
+00182 // OUTPUT
+00183   // sort pop for pretty printout
+00184   //   pop.sort();
+00185   // Print (sorted) intial population (raw printout)
+00186   cout << "Initial Population" << endl << pop ;
+00187   cout << "and best is " << pop.best_element() << "\n\n";
+00188   cout << "and worse is " << pop.worse_element() << "\n\n";
+00189 // ENGINE
+00191   // selection and replacement
+00193 // SELECT
+00194   // The robust tournament selection
+00195   eoDetTournamentSelect<Indi> selectOne(tSize);       // tSize in [2,POPSIZE]
+00196   // is now encapsulated in a eoSelectPerc (entage)
+00197   eoSelectPerc<Indi> select(selectOne);// by default rate==1
+00198 
+00199 // REPLACE
+00200   // And we now have the full slection/replacement - though with
+00201   // generational replacement at the moment :-)
+00202   eoGenerationalReplacement<Indi> replace;
+00203   // want to add (weak) elitism? easy!
+00204   // rename the eoGenerationalReplacement replace_main,
+00205   // then encapsulate it in the elitist replacement
+00206   //  eoWeakElitistReplacement<Indi> replace(replace_main);
+00207 
+00208 // OPERATORS
+00210   // The variation operators
+00212 // CROSSOVER
+00213   // 1-point crossover for bitstring
+00214   eo1PtBitXover<Indi> xover1;
+00215   // uniform crossover for bitstring
+00216   eoUBitXover<Indi> xoverU;
+00217   // 2-pots xover
+00218   eoNPtsBitXover<Indi> xover2(2);
+00219   // Combine them with relative rates
+00220   eoPropCombinedQuadOp<Indi> xover(xover1, onePointRate);
+00221   xover.add(xoverU, URate);
+00222   xover.add(xover2, twoPointsRate, true);
+00223 
+00224 // MUTATION
+00225   // standard bit-flip mutation for bitstring
+00226   eoBitMutation<Indi>  mutationBitFlip(pMutPerBit);
+00227   // mutate exactly 1 bit per individual
+00228   eoDetBitFlip<Indi> mutationOneBit;
+00229   // Combine them with relative rates
+00230   eoPropCombinedMonOp<Indi> mutation(mutationBitFlip, bitFlipRate);
+00231   mutation.add(mutationOneBit, oneBitRate, true);
+00232 
+00233   // The operators are  encapsulated into an eoTRansform object
+00234   eoSGATransform<Indi> transform(xover, pCross, mutation, pMut);
+00235 
+00236 // STOP
+00238   // termination condition see FirstBitEA.cpp
+00240   eoGenContinue<Indi> genCont(maxGen);
+00241   eoSteadyFitContinue<Indi> steadyCont(minGen, steadyGen);
+00242   // eoFitContinue<Indi> fitCont(vecSize);   // remove if minimizing :-)
+00243   eoCombinedContinue<Indi> continuator(genCont);
+00244   continuator.add(steadyCont);
+00245   //  continuator.add(fitCont);
+00246   // Ctrl C signal handling: don't know if that works in MSC ...
+00247 #ifndef _MSC_VER
+00248   eoCtrlCContinue<Indi> ctrlC;
+00249   continuator.add(ctrlC);
+00250 #endif
+00251 
+00252 // CHECKPOINT
+00253   // but now you want to make many different things every generation
+00254   // (e.g. statistics, plots, ...).
+00255   // the class eoCheckPoint is dedicated to just that:
+00256 
+00257   // Declare a checkpoint (from a continuator: an eoCheckPoint
+00258   // IS AN eoContinue and will be called in the loop of all algorithms)
+00259   eoCheckPoint<Indi> checkpoint(continuator);
+00260 
+00261     // Create a counter parameter
+00262     eoValueParam<unsigned> generationCounter(0, "Gen.");
+00263 
+00264     // Create an incrementor (sub-class of eoUpdater). Note that the
+00265     // parameter's value is passed by reference,
+00266     // so every time the incrementer is updated (every generation),
+00267     // the data in generationCounter will change.
+00268     eoIncrementor<unsigned> increment(generationCounter.value());
+00269 
+00270     // Add it to the checkpoint,
+00271     // so the counter is updated (here, incremented) every generation
+00272     checkpoint.add(increment);
+00273 
+00274     // now some statistics on the population:
+00275     // Best fitness in population
+00276     eoBestFitnessStat<Indi> bestStat;
+00277     eoAverageStat<Indi> averageStat;
+00278     // Second moment stats: average and stdev
+00279     eoSecondMomentStats<Indi> SecondStat;
+00280     // the Fitness Distance Correlation
+00281     // need first an object to compute the distances
+00282     eoQuadDistance<Indi> dist;  // Hamming distance
+00283     eoFDCStat<Indi> fdcStat(dist);
+00284 
+00285     // Add them to the checkpoint to get them called at the appropriate time
+00286     checkpoint.add(bestStat);
+00287     checkpoint.add(averageStat);
+00288     checkpoint.add(SecondStat);
+00289     checkpoint.add(fdcStat);
+00290 
+00291     // The Stdout monitor will print parameters to the screen ...
+00292     eoStdoutMonitor monitor(false);
+00293 
+00294     // when called by the checkpoint (i.e. at every generation)
+00295     checkpoint.add(monitor);
+00296 
+00297     // the monitor will output a series of parameters: add them
+00298     monitor.add(generationCounter);
+00299     monitor.add(eval);          // because now eval is an eoEvalFuncCounter!
+00300     monitor.add(bestStat);
+00301     monitor.add(SecondStat);
+00302     monitor.add(fdcStat);
+00303 
+00304     // test de eoPopStat and/or eoSortedPopStat.
+00305     // Dumps the whole pop every 10 gen.
+00306     //    eoSortedPopStat<Indi> popStat(10, "Dump of whole population");
+00307 //     eoPopStat<Indi> popStat(10, "Dump of whole population");
+00308 //     checkpoint.add(popStat);
+00309 //     monitor.add(popStat);
+00310 
+00311     // A file monitor: will print parameters to ... a File, yes, you got it!
+00312     eoFileMonitor fileMonitor("stats.xg", " ");
+00313 
+00314     // the checkpoint mechanism can handle monitors
+00315     checkpoint.add(fileMonitor);
+00316 
+00317     // the fileMonitor can monitor parameters, too, but you must tell it!
+00318     fileMonitor.add(generationCounter);
+00319     fileMonitor.add(bestStat);
+00320     fileMonitor.add(SecondStat);
+00321 
+00322 #ifndef _MSC_VER
+00323     // and an eoGnuplot1DMonitor will 1-print to a file, and 2- plot on screen
+00324     eoGnuplot1DMonitor gnuMonitor("best_average.xg",minimizing_fitness<Indi>());
+00325     // the checkpoint mechanism can handle multiple monitors
+00326     checkpoint.add(gnuMonitor);
+00327     // the gnuMonitor can monitor parameters, too, but you must tell it!
+00328     gnuMonitor.add(eval);
+00329     gnuMonitor.add(bestStat);
+00330     gnuMonitor.add(averageStat);
+00331 
+00332     // send a scaling command to gnuplot
+00333     gnuMonitor.gnuplotCommand("set yrange [0:500]");
+00334 
+00335     // a specific plot monitor for FDC
+00336     // first into a file (it adds everything ti itself
+00337     eoFDCFileSnapshot<Indi> fdcFileSnapshot(fdcStat);
+00338     // then to a Gnuplot monitor
+00339     eoGnuplot1DSnapshot fdcGnuplot(fdcFileSnapshot);
+00340     // and of coruse add them to the checkPoint
+00341     checkpoint.add(fdcFileSnapshot);
+00342     checkpoint.add(fdcGnuplot);
+00343 
+00344     // want to see how the fitness is spread?
+00345     eoScalarFitnessStat<Indi> fitStat;
+00346     checkpoint.add(fitStat);
+00347     // a gnuplot-based monitor for snapshots: needs a dir name
+00348     // where to store the files
+00349     eoGnuplot1DSnapshot fitSnapshot("Fitnesses");
+00350     // add any stat that is a vector<double> to it
+00351     fitSnapshot.add(fitStat);
+00352     // and of course add it to the checkpoint
+00353     checkpoint.add(fitSnapshot);
+00354 #endif
+00355     // Last type of item the eoCheckpoint can handle: state savers:
+00356     eoState outState;
+00357     // Register the algorithm into the state (so it has something to save!!)
+00358     outState.registerObject(rng);
+00359     outState.registerObject(pop);
+00360 
+00361     // and feed the state to state savers
+00362     // save state every 100th  generation
+00363     eoCountedStateSaver stateSaver1(100, outState, "generation");
+00364     // save state every 1 seconds
+00365     eoTimedStateSaver   stateSaver2(1, outState, "time");
+00366 
+00367     // Don't forget to add the two savers to the checkpoint
+00368     checkpoint.add(stateSaver1);
+00369     checkpoint.add(stateSaver2);
+00370     // and that's it for the (control and) output
+00371 
+00372 // GENERATION
+00374   // the algorithm
+00376 
+00377   // Easy EA requires
+00378   // selection, transformation, eval, replacement, and stopping criterion
+00379   eoEasyEA<Indi> gga(checkpoint, eval, select, transform, replace);
+00380 
+00381   // Apply algo to pop - that's it!
+00382   gga(pop);
+00383 
+00384 // OUTPUT
+00385   // Print (sorted) intial population
+00386   pop.sort();
+00387   cout << "FINAL Population\n" << pop << endl;
+00388 // GENERAL
+00389 }
+00390 
+00391 // A main that catches the exceptions
+00392 int main(int argc, char **argv)
+00393 {
+00394     try
+00395     {
+00396         main_function(argc, argv);
+00397     }
+00398     catch(exception& e)
+00399     {
+00400         cout << "Exception: " << e.what() << '\n';
+00401     }
+00402 
+00403     return 1;
+00404 }
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/files.html b/trunk/paradiseo-eo/doc/html/files.html new file mode 100644 index 000000000..91331fef2 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/files.html @@ -0,0 +1,431 @@ + + +EO: File Index + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

EO File List

Here is a list of all documented files with brief descriptions: + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
abstract1.cpp [code]
algos.cpp [code]
apply.h [code]
test/binary_value.h [code]
tutorial/Lesson2/binary_value.h [code]
tutorial/Lesson3/binary_value.h [code]
tutorial/Lesson4/binary_value.h [code]
BitEA.cpp [code]
BoundsCheck.cpp [code]
BoundsCheck.h [code]
breeders.cpp [code]
CMAParams.cpp [code]
CMAParams.h [code]
CMAState.cpp [code]
CMAState.h [code]
compatibility.h [code]
continuators.cpp [code]
Dataset.cpp [code]
Dataset.h [code]
def_abstract_functor.h [code]
eig.cpp [code]
eig.h [code]
EO.h [code]
eoAged.h [code]
eoAlgo.h [code]
eoAssembledFitnessStat.h [code]
eoBit.h [code]
eoBitOp.h [code]
eoBitOpFactory.h [code]
eoBoolFlip.h [code]
eoBreed.h [code]
eoCellularEasyEA.h [code]
eoCheckPoint.h [code]
eoCloneOps.h [code]
eoCMABreed.h [code]
eoCMAInit.h [code]
eoCombinedContinue.h [code]
eoCombinedInit.h [code]
eoContinue.h [code]
eoCounter.h [code]
eoCtrlCContinue.cpp [code]
eoCtrlCContinue.h [code]
eoData.cpp [code]
eoData.h [code]
eoDetSelect.h [code]
eoDetTournamentSelect.h [code]
eoDistance.h [code]
eoDistribUpdater.h [code]
eoDistribution.h [code]
eoDominanceMap.h [code]
eoDrawable.h [code]
eoEasyEA.h [code]
eoEDA.h [code]
eoEsChromInit.h [code]
eoEsFull.h [code]
eoEsGlobalXover.h [code]
eoEsMutate.h [code]
eoEsMutationInit.h [code]
eoEsSimple.h [code]
eoEsStandardXover.h [code]
eoEsStdev.h [code]
eoEvalContinue.h [code]
eoEvalFunc.h [code]
eoEvalFuncCounter.h [code]
eoEvalFuncPtr.h [code]
eoExternalEO.h [code]
eoExternalOpFunctions.h [code]
eoFactory.h [code]
eoFDCStat.h [code]
eoFileMonitor.cpp [code]
eoFileMonitor.h [code]
eoFileSnapshot.h [code]
eoFitContinue.h [code]
eoFitnessScalingSelect.h [code]
eoFlOrBinOp.h [code]
eoFlOrMonOp.h [code]
eoFlOrQuadOp.h [code]
eoFunctor.h [code]
eoFunctorStore.cpp [code]
eoFunctorStore.h [code]
eoG3Replacement.h [code]
eoGenContinue.h [code]
eoGeneralBreeder.h [code]
eoGenOp.h [code]
eoGnuplot.cpp [code]
eoGnuplot.h [code]
eoGnuplot1DMonitor.cpp [code]
eoGnuplot1DMonitor.h [code]
eoGnuplot1DSnapshot.cpp [code]
eoGnuplot1DSnapshot.h [code]
eoHowMany.h [code]
eoInit.h [code]
eoInitVirus.h [code]
eoIntBounds.cpp [code]
eoIntBounds.h [code]
eoInvalidateOps.h [code]
eoLinearFitScaling.h [code]
eoMerge.h [code]
eoMergeReduce.h [code]
eoMGGReplacement.h [code]
eoMOFitnessStat.h [code]
eoMonitor.h [code]
eoNDSorting.h [code]
eoNormalMutation.h [code]
eoObject.h [code]
eoOneMax.h [code]
eoOneMaxEvalFunc.h [code]
eoOneMaxInit.h [code]
eoOneMaxMutation.h [code]
eoOneMaxQuadCrossover.h [code]
eoOneToOneBreeder.h [code]
eoOp.h [code]
eoOpContainer.h [code]
eoOpSelMason.h [code]
eoParam.h [code]
eoParetoConstraintFitness.h [code]
eoParetoFitness.cpp [code]
eoParetoFitness.h [code]
eoParetoRanking.h [code]
eoParser.cpp [code]
eoParser.h [code]
eoParseTree.h [code]
eoParseTreeDepthInit.h [code]
eoParseTreeOp.h [code]
eoPBILAdditive.h [code]
eoPBILDistrib.h [code]
eoPBILOrg.h [code]
eoPerf2Worth.h [code]
eoPeriodicContinue.h [code]
eoPersistent.cpp [code]
eoPersistent.h [code]
eoPop.h [code]
eoPopAlgo.h [code]
eoPopEvalFunc.h [code]
eoPopStat.h [code]
eoPopulator.h [code]
eoPrintable.cpp [code]
eoPrintable.h [code]
eoPropGAGenOp.h [code]
eoProportionalCombinedOp.h [code]
eoProportionalSelect.h [code]
eoRandomSelect.h [code]
eoRanking.h [code]
eoRankingSelect.h [code]
eoReal.h [code]
eoRealAtomXover.h [code]
eoRealBounds.cpp [code]
eoRealBounds.h [code]
eoRealInitBounded.h [code]
eoRealOp.h [code]
eoRealVectorBounds.h [code]
eoReduce.h [code]
eoReduceMerge.h [code]
eoReduceMergeReduce.h [code]
eoReduceSplit.h [code]
eoReplacement.h [code]
eoRndGenerators.h [code]
eoRNG.cpp [code]
eoRNG.h [code]
eoSBXcross.h [code]
eoScalarFitness.h [code]
eoScalarFitnessAssembled.cpp [code]
eoScalarFitnessAssembled.h [code]
eoScalarFitnessStat.h [code]
eoSelect.h [code]
eoSelectFactory.h [code]
eoSelectFromWorth.h [code]
eoSelectMany.h [code]
eoSelectNumber.h [code]
eoSelectOne.h [code]
eoSelectPerc.h [code]
eoSequentialSelect.h [code]
eoSGA.h [code]
eoSGAGenOp.h [code]
eoSGATransform.h [code]
eoSharing.h [code]
eoSharingSelect.h [code]
eoSimpleEDA.h [code]
eoStat.h [code]
eoState.cpp [code]
eoState.h [code]
eoStdoutMonitor.cpp [code]
eoStdoutMonitor.h [code]
eoSteadyFitContinue.h [code]
eoSTLFunctor.h [code]
eoStochasticUniversalSelect.h [code]
eoStochTournamentSelect.h [code]
eoStParseTreeDepthInit.h [code]
eoStParseTreeOp.h [code]
eoString.h [code]
eoSurviveAndDie.h [code]
eoSym.h [code]
eoSymCrossover.cpp [code]
eoSymCrossover.h [code]
eoSymEval.h [code]
eoSymInit.h [code]
eoSymLambdaMutate.cpp [code]
eoSymLambdaMutate.h [code]
eoSymMutate.cpp [code]
eoSymMutate.h [code]
eoTimeCounter.h [code]
eoTimedMonitor.h [code]
eoTransform.h [code]
eoTruncatedSelectMany.h [code]
eoTruncatedSelectOne.h [code]
eoTruncSelect.h [code]
eoUniformInit.h [code]
eoUpdatable.h [code]
eoUpdater.cpp [code]
eoUpdater.h [code]
eoVariableLengthCrossover.h [code]
eoVariableLengthMutation.h [code]
eoVector.h [code]
eoVirus.h [code]
ErrorMeasure.cpp [code]
ErrorMeasure.h [code]
es.h [code]
ESEA.cpp [code]
exercise1.3.cpp [code]
exercise2.3.cpp [code]
exercise3.1.cpp [code]
FirstBitEA.cpp [code]
FirstBitGA.cpp [code]
FirstRealEA.cpp [code]
FirstRealGA.cpp [code]
fitness.h [code]
fitness_traits.cpp [code]
FunDef.cpp [code]
FunDef.h [code]
ga.h [code]
geneticOps.cpp [code]
gprop.cpp [code]
gprop.h [code]
index.h [code]
Interval.h [code]
l2.h [code]
LanguageTable.cpp [code]
LanguageTable.h [code]
main.cpp [code]
make_algo_easea.h [code]
make_algo_pareto.h [code]
make_algo_scalar.h [code]
make_algo_scalar_es.cpp [code]
make_algo_scalar_ga.cpp [code]
make_algo_scalar_real.cpp [code]
make_checkpoint.h [code]
make_checkpoint_assembled.h [code]
make_checkpoint_es.cpp [code]
make_checkpoint_FDC.h [code]
make_checkpoint_ga.cpp [code]
make_checkpoint_pareto.h [code]
make_checkpoint_real.cpp [code]
make_continue.h [code]
make_continue_es.cpp [code]
make_continue_ga.cpp [code]
make_continue_pareto.h [code]
make_continue_real.cpp [code]
make_es.h [code]
make_ga.h [code]
make_general_replacement.h [code]
make_genotype_es.cpp [code]
make_genotype_ga.cpp [code]
make_genotype_ga.h [code]
make_genotype_MyStruct.h [code]
make_genotype_OneMax.h [code]
make_genotype_real.cpp [code]
make_genotype_real.h [code]
make_help.cpp [code]
make_MyStruct.cpp [code]
make_OneMax.cpp [code]
es/make_op.h [code]
ga/make_op.h [code]
make_op_es.cpp [code]
make_op_es.h [code]
make_op_ga.cpp [code]
make_op_MyStruct.h [code]
make_op_OneMax.h [code]
make_op_real.cpp [code]
make_op_real.h [code]
make_PBILdistrib.h [code]
make_PBILupdate.h [code]
make_pop.h [code]
make_pop_es.cpp [code]
make_pop_ga.cpp [code]
make_pop_real.cpp [code]
make_real.h [code]
make_run.h [code]
make_run_es.cpp [code]
make_run_ga.cpp [code]
make_run_real.cpp [code]
mastermind.cpp [code]
mastermind.h [code]
matrices.h [code]
mergers.cpp [code]
mlp.h [code]
monitors.cpp [code]
mse.h [code]
MultiFuncs.cpp [code]
MultiFunction.cpp [code]
MultiFunction.h [code]
MyStructEA.cpp [code]
MyStructLibEA.cpp [code]
MyStructSEA.cpp [code]
NEWS [code]
src/pyeo/NEWS [code]
node.h [code]
node_pool.h [code]
NodeSelector.cpp [code]
NodeSelector.h [code]
OneMaxEA.cpp [code]
OneMaxLibEA.cpp [code]
parameters.h [code]
parse_tree.h [code]
perf2worth.cpp [code]
pickle.h [code]
pipecom.cpp [code]
pipecom.h [code]
PyEO.cpp [code]
PyEO.h [code]
qp.h [code]
random_numbers.cpp [code]
contrib/mathsym/README [code]
README [code]
src/pyeo/README [code]
tutorial/README [code]
tutorial/Templates/README [code]
README.cpp [code]
test/real_value.h [code]
tutorial/Lesson2/real_value.h [code]
tutorial/Lesson3/real_value.h [code]
tutorial/Lesson4/real_value.h [code]
RealEA.cpp [code]
reduce.cpp [code]
replacement.cpp [code]
rnd_generators.h [code]
RoyalRoad.h [code]
Scaling.cpp [code]
Scaling.h [code]
SecondBitEA.cpp [code]
SecondRealEA.cpp [code]
selectOne.cpp [code]
selectors.cpp [code]
selectors.h [code]
shared_ptr.h [code]
statistics.cpp [code]
stats.h [code]
Sym.cpp [code]
Sym.h [code]
sym_compile.cpp [code]
sym_compile.h [code]
sym_operations.cpp [code]
SymImpl.cpp [code]
SymImpl.h [code]
SymOps.cpp [code]
SymOps.h [code]
symreg.cpp [code]
t-eo.cpp [code]
t-eoAtomOps.cpp [code]
t-eoBaseFunctions.cpp [code]
t-eobin.cpp [code]
t-eobreeder.cpp [code]
t-eoCheckpointing.cpp [code]
t-eoCMAES.cpp [code]
t-eoEasyEA.cpp [code]
t-eoESAll.cpp [code]
t-eoESFull.cpp [code]
t-eoESOps.cpp [code]
t-eoExternalEO.cpp [code]
t-eofitness.cpp [code]
t-eoFitnessAssembled.cpp [code]
t-eoFitnessAssembledEA.cpp [code]
t-eoFunctor.cpp [code]
t-eoGA.cpp [code]
t-eogeneration.cpp [code]
t-eoGenOp.cpp [code]
t-eoGOpSel.cpp [code]
t-eoinclusion.cpp [code]
t-eoinsertion.cpp [code]
t-eolottery.cpp [code]
t-eoNonUniform.cpp [code]
t-eoPareto.cpp [code]
t-eoParetoFitness.cpp [code]
t-eoPBIL.cpp [code]
t-eoproblem.cpp [code]
t-eoRandom.cpp [code]
t-eoReal.cpp [code]
t-eoReplacement.cpp [code]
t-eoRoulette.cpp [code]
t-eoSelect.cpp [code]
t-eoSharing.cpp [code]
t-eoSSGA.cpp [code]
t-eoStateAndParser.cpp [code]
t-eoSymreg.cpp [code]
t-eoUniform.cpp [code]
t-eoVector.cpp [code]
t-eoVirus.cpp [code]
t-MGE-control.cpp [code]
t-MGE.cpp [code]
t-MGE1bit.cpp [code]
t-selectOne.cpp [code]
TargetInfo.cpp [code]
TargetInfo.h [code]
test_compile.cpp [code]
test_diff.cpp [code]
test_lambda.cpp [code]
test_mf.cpp [code]
test_simplify.cpp [code]
testeo.cpp [code]
token.h [code]
TreeBuilder.cpp [code]
TreeBuilder.h [code]
util.cpp [code]
valueParam.cpp [code]
valueParam.h [code]
vecop.h [code]
VirusOp.h [code]
+
Generated on Thu Oct 19 05:06:33 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/fitness_8h-source.html b/trunk/paradiseo-eo/doc/html/fitness_8h-source.html new file mode 100644 index 000000000..bb939be95 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/fitness_8h-source.html @@ -0,0 +1,243 @@ + + +EO: fitness.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+app / gpsymreg
+

fitness.h

00001 /*
+00002     This library is free software; you can redistribute it and/or modify
+00003     it under the terms of the GNU General Public License as published by
+00004     the Free Software Foundation; either version 2 of the License, or
+00005     (at your option) any later version.
+00006 
+00007     This library is distributed in the hope that it will be useful,
+00008     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00009     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00010     Lesser General Public License for more details.
+00011 
+00012     You should have received a copy of the GNU General Public License
+00013     along with this library; if not, write to the Free Software
+00014     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00015 
+00016     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00017              jeggermo@liacs.nl
+00018 */
+00019 
+00020 #ifndef _FITNESS_FUNCTION_H
+00021 #define _FITNESS_FUNCTION_H
+00022 
+00023 #include <gp/eoParseTree.h>
+00024 #include <eo>
+00025 
+00026 #include <cmath>
+00027 #include "parameters.h"
+00028 #include "node.h"
+00029 
+00030 using namespace gp_parse_tree;
+00031 using namespace std;
+00032 
+00033 
+00034 
+00035 // the first fitness is the normal goal fitness
+00036 // the second fitness is the tree size (we prefer smaller trees)
+00037 // lets use names to define the different fitnesses
+00038 #define NORMAL 0      // Stepwise Adaptation of Weights Fitness
+00039 #define SMALLESTSIZE 1  // The size of the tree, we want to minimize this one -- statistics will tell us the smallest tree size
+00040 
+00041 
+00042 // Look: overloading the maximization without overhead (thing can be inlined)
+00043 class MinimizingFitnessTraits : public eoParetoFitnessTraits
+00044 {
+00045   public :
+00046   static bool maximizing(int which) { return false;} // we want to minimize both fitnesses
+00047   static unsigned nObjectives()          { return 2;} // the number of fitnesses }
+00048 };
+00049 
+00050 // Lets define our MultiObjective FitnessType
+00051 typedef eoParetoFitness<MinimizingFitnessTraits> FitnessType;
+00052 
+00053 
+00054 // John Koza's sextic polynomial (our example problem)
+00055 
+00056 double sextic_polynomial(double x)
+00057 {
+00058         double result=0;
+00059         result = pow(x,6) - (2*pow(x,4)) + pow(x,2);
+00060         return result;
+00061 };
+00062 
+00063 // we use the following functions for the basic math functions
+00064 
+00065 double _plus(double arg1, double arg2)
+00066 {
+00067         return arg1 + arg2;
+00068 }
+00069 
+00070 double _minus(double arg1, double arg2)
+00071 {
+00072         return arg1 - arg2;
+00073 }
+00074 
+00075 double _multiplies(double arg1, double arg2)
+00076 {
+00077         return arg1 * arg2;
+00078 }
+00079 
+00080 // the function for a protected divide looks a little bit different
+00081 double _divides(double arg1, double arg2)
+00082 {
+00083         if (arg2 ==0)
+00084                 return 0;
+00085         else
+00086                 return arg1 / arg2;
+00087 }
+00088 
+00089 double _negate(double arg1)
+00090 {
+00091         return -arg1;
+00092 }
+00093 
+00094 
+00095 
+00096 // now let's define our tree nodes
+00097 
+00098 void init(vector<Node> &initSequence)
+00099 {
+00100 
+00101                 // we have only one variable (X)
+00102                 Operation varX( (unsigned int) 0, string("X") );
+00103 
+00104 
+00105                 // the main binary operators
+00106                 Operation OpPLUS ( _plus, string("+"));
+00107                 Operation OpMINUS( _minus,string("-"));
+00108                 Operation OpMULTIPLIES(_multiplies,string("*"));
+00109                 // We can use a protected divide function.
+00110                 Operation OpDIVIDE( _divides, string("/") );
+00111 
+00112 
+00113                 // Now the functions as binary functions
+00114                 Operation PLUS( string("plus"), _plus);
+00115                 Operation MINUS( string("minus"), _minus);
+00116                 Operation MULTIPLIES( string("multiply"), _multiplies);
+00117                 Operation DIVIDE( string("divide"), _divides);
+00118 
+00119 
+00120                 // and some unary  functions
+00121                 Operation NEGATE( _negate,string("-"));
+00122                 Operation SIN ( sin, string("sin"));
+00123                 Operation COS ( cos, string("cos"));
+00124 
+00125                 // Now we are ready to add the possible nodes to our initSequence (which is used by the eoDepthInitializer)
+00126 
+00127                 // so lets start with our variable
+00128                 initSequence.push_back(varX);
+00129 
+00130                 // followed by the constants 2, 4, 6
+00131                 for(unsigned int i=2; i <= 6; i+=2)
+00132                 {
+00133                         char text[255];
+00134                         sprintf(text, "%i", i);
+00135                         Operation op(i*1.0, text);
+00136                         initSequence.push_back( op );
+00137                         // and we add the variable again (so we have get lots of variables);
+00138                         initSequence.push_back( varX );
+00139                 }
+00140 
+00141                 // next we add the unary functions
+00142 
+00143                 initSequence.push_back( NEGATE );
+00144                 initSequence.push_back( SIN );
+00145                 initSequence.push_back( COS );
+00146 
+00147                 // and the binary functions
+00148                 initSequence.push_back( PLUS);
+00149                 initSequence.push_back( MINUS );
+00150                 initSequence.push_back( MULTIPLIES );
+00151                 initSequence.push_back( DIVIDE );
+00152 
+00153                 // and the binary operators
+00154                 initSequence.push_back( OpPLUS);
+00155                 initSequence.push_back( OpMINUS );
+00156 
+00157                 initSequence.push_back( OpMULTIPLIES );
+00158                 initSequence.push_back( OpDIVIDE );
+00159 
+00160 
+00161 };
+00162 
+00163 
+00164 
+00165 class RegFitness: public eoEvalFunc< eoParseTree<FitnessType, Node> >
+00166 {
+00167         public:
+00168 
+00169                 typedef eoParseTree<FitnessType, Node> EoType;
+00170 
+00171                 void operator()(EoType &_eo)
+00172                 {
+00173 
+00174                                 vector< double > input(1); // the input variable(s)
+00175                                 double output(0.);
+00176                                 double target;
+00177                                 FitnessType fitness;
+00178 
+00179 
+00180                                 float x=0;
+00181                                 double fit=0;
+00182                                 for(x=-1; x <= 1; x+=0.1)
+00183                                 {
+00184                                         input[0] = x;
+00185                                         target = sextic_polynomial(x);
+00186                                         _eo.apply(output,input);
+00187 
+00188                                         fit += pow(target - output, 2);
+00189                                 }
+00190 
+00191                                 fitness[NORMAL] = fit;
+00192 
+00193                                 fitness[SMALLESTSIZE] =  _eo.size() / (1.0*parameter.MaxSize);
+00194                                 _eo.fitness(fitness);
+00195 
+00196                                 if (fitness[NORMAL] < best[NORMAL])
+00197                                 {
+00198                                         best[NORMAL] = fitness[NORMAL];
+00199                                         tree="";
+00200                                         _eo.apply(tree);
+00201                                 }
+00202 
+00203                 }
+00204 
+00205 
+00206 
+00207                 RegFitness(eoValueParam<unsigned> &_generationCounter, vector< Node > &initSequence, Parameters &_parameter) : eoEvalFunc<EoType>(), generationCounter(_generationCounter), parameter(_parameter)
+00208                 {
+00209                         init(initSequence);
+00210                         best[NORMAL] = 1000;
+00211                         tree= "not found";
+00212                 };
+00213 
+00214                 ~RegFitness()
+00215                 {
+00216                         cerr << "Best Fitness= " << best[NORMAL] << endl;
+00217                         cerr << tree << endl;
+00218                 };
+00219 
+00220         private:
+00221                 eoValueParam<unsigned> &generationCounter; // so we know the current generation
+00222                 Parameters &parameter; // the parameters
+00223                 FitnessType best;       // the best found fitness
+00224                 string tree;
+00225 };
+00226 
+00227 #endif
+00228 
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/fitness__traits_8cpp-source.html b/trunk/paradiseo-eo/doc/html/fitness__traits_8cpp-source.html new file mode 100644 index 000000000..4d68f293e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/fitness__traits_8cpp-source.html @@ -0,0 +1,448 @@ + + +EO: fitness_traits.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+test
+

fitness_traits.cpp

00001 #include <map> // for pair
+00002 #include <iostream>
+00003 #include <stdexcept>
+00004 #include <vector>
+00005 #include <algorithm>
+00006 #include <math.h> // for exp
+00007 
+00008 using namespace std;
+00009 
+00010 /* fitness_traits.h */
+00011 
+00012 // default traits: defaults to a double that needs to be maximized
+00013 template <class T = double>
+00014 struct fitness_traits
+00015 {
+00016   // Needs mapping can be used to figure out whether you need to do fitness scaling (or not)
+00017   const static bool needs_mapping               = false;
+00018 
+00019   // storage_type: what to store next to the genotype
+00020   typedef T storage_type;
+00021 
+00022   // performance_type: what the eoEvalFunc calculates
+00023   typedef T performance_type;
+00024 
+00025   // worth_type: what the scaling function does
+00026   typedef T worth_type;
+00027 
+00028   // access_performance: how to get from what is stored to a mutable performance
+00029   static performance_type& access_performance(storage_type& a) { return a; }
+00030 
+00031   // access_worth: how to get from what is stored to a mutable worth
+00032   static worth_type&       access_worth(storage_type& a)       { return a; }
+00033 
+00034   // get_performance: from storage_type to a performance figure
+00035   static performance_type  get_performance(storage_type a) { return a; }
+00036 
+00037   // get_worth: from storage_type to a worth figure
+00038   static worth_type        get_worth(storage_type a)       { return a; }
+00039 
+00040   // get the fitness out of the individual
+00041   template <class EOT>
+00042   static worth_type    get_fitness(const EOT& _eo)       { return _eo.performance(); }
+00043 
+00044   // compare the two individuals
+00045   template <class EOT>
+00046   static bool is_better(const EOT& _eo1, const EOT& _eo2)
+00047   {
+00048     return _eo1.performance() > _eo2.performance();
+00049   }
+00050 };
+00051 
+00052 struct minimization {};
+00053 struct maximization {};
+00054 
+00055 struct fitness_traits<minimization> : public fitness_traits<double>
+00056 {
+00057   // for minimization, invert the is_better
+00058   template <class EOT>
+00059   static bool is_better(const EOT& _eo1, const EOT& _eo2)
+00060   {
+00061     return _eo1.performance() < _eo2.performance();
+00062   }
+00063 };
+00064 
+00065 // for maximization, just take the default behaviour
+00066 struct fitness_traits<maximization> : public fitness_traits<double> {};
+00067 
+00068 // forward declaration
+00069 //template <class EOT> class eoPop;
+00070 //template <class Fitness, class Traits> class EO;
+00071 
+00072 // unfortunately, partial template specialization is not approved by Microsoft (though ANSI says it's ok)
+00073 // Probably need some macro-magic to make this work (MicroSoft == MacroHard)
+00074 // A pair class: first == performance, second == worth, redefine all types, data and functions
+00075 template <class Performance, class Worth>
+00076 struct fitness_traits< pair<Performance, Worth> >
+00077 {
+00078   typedef pair<Performance, Worth> storage_type;
+00079   typedef Performance performance_type;
+00080   typedef Worth       worth_type;
+00081 
+00082   const static bool needs_mapping = true;
+00083 
+00084   static performance_type& access_performance(storage_type& a)     { return a.first; }
+00085   static worth_type&       access_worth(storage_type& a)           { return a.second; }
+00086 
+00087   static performance_type get_performance(const storage_type& a)     { return a.first; }
+00088   static worth_type       get_worth(const storage_type& a)           { return a.second; }
+00089 
+00090   // This function calls _eo.worth() which in turn checks the fitness flag and calls get_worth above
+00091   // The compiler should be able to inline all these calls and come up with a very compact solution
+00092   template <class EOT>
+00093   static worth_type    get_fitness(const EOT& _eo) { return _eo.worth(); }
+00094 
+00095   template <class EOT>
+00096   static bool is_better(const EOT& _eo1, const EOT& _eo2)
+00097   {
+00098     return _eo1.worth() > _eo2.worth();
+00099   }
+00100 };
+00101 
+00102 /* end fitness_traits.h */
+00103 
+00104 /* EO.h 
+00105 
+00106 The Fitness template argument is there for backward compatibility reasons
+00107 
+00108 */
+00109 
+00110 template <class Fitness, class Traits = fitness_traits<Fitness> >
+00111 class EO
+00112 {
+00113 public :
+00114 
+00115   typedef Traits                            fitness_traits;
+00116   typedef typename Traits::storage_type     storage_type;
+00117   typedef typename Traits::performance_type performance_type;
+00118   typedef typename Traits::worth_type       worth_type;
+00119 
+00120   EO() : valid_performance(false), valid_worth(false), rep_fitness() {}
+00121 
+00122   // for backwards compatibility
+00123   void fitness(performance_type perf)
+00124   {
+00125     performance(perf);
+00126   }
+00127 
+00128   void performance(performance_type perf)
+00129   {
+00130     valid_performance = true;
+00131     Traits::access_performance(rep_fitness) = perf;
+00132   }
+00133 
+00134   performance_type performance(void) const
+00135   {
+00136     if(!valid_performance) throw runtime_error("no performance");
+00137     return Traits::get_performance(rep_fitness);
+00138   }
+00139 
+00140   void worth(worth_type worth)
+00141   {
+00142     valid_worth = true;
+00143     Traits::access_worth(rep_fitness) = worth;
+00144   }
+00145 
+00146   worth_type worth(void) const
+00147   {
+00148     if(!valid_worth)  throw runtime_error("no worth");
+00149     if(!Traits::needs_mapping)  throw runtime_error("no mapping");
+00150     return Traits::get_worth(rep_fitness);
+00151   }
+00152 
+00153   worth_type fitness(void) const
+00154   {
+00155     return Traits::get_fitness(*this);
+00156   }
+00157 
+00158   void invalidate(void)
+00159   {
+00160     valid_performance = false;
+00161     valid_worth = false;
+00162   }
+00163 
+00164   void invalidate_worth(void)
+00165   {
+00166     valid_worth = false;
+00167   }
+00168 
+00169   bool operator<(const EO<Fitness, Traits>& other) const
+00170   {
+00171     return !Traits::is_better(other, *this);
+00172   }
+00173 
+00174   bool operator>(const EO<Fitness, Traits>& other) const
+00175   {
+00176     return Traits::is_better(other, *this);
+00177   }
+00178 
+00179   private :
+00180 
+00181   bool valid_performance;
+00182   bool valid_worth;
+00183   storage_type rep_fitness;
+00184 };
+00185 
+00186 /* end EO.h */
+00187 
+00188 /* eoPerf2Worth.h */
+00189 
+00190 // get the name known
+00191 template <class EOT> class eoPop;
+00192 
+00193 template <class EOT>
+00194 void exponential_scaling(eoPop<EOT>& _pop)
+00195 {
+00196     for (unsigned i = 0; i < _pop.size(); ++i)
+00197     { // change minimimization into maximization
+00198       _pop[i].worth(exp(-_pop[i].performance()));
+00199     }
+00200 }
+00201 
+00202 template <class EOT>
+00203 class eoPerf2Worth /* : public eoUF<eoPop<EOT>&, void> */
+00204 {
+00205 public :
+00206   virtual void operator()(eoPop<EOT>& _pop)
+00207   {
+00208     return exponential_scaling(_pop);
+00209   }
+00210 };
+00211 
+00212 /* end eoPerf2Worth.h */
+00213 
+00214 
+00215 /* eoPop.h */
+00216 
+00217 template <class EOT>
+00218 class eoPop : public vector<EOT>
+00219 {
+00220 public :
+00221 
+00222   typedef typename EOT::fitness_traits fitness_traits;
+00223 
+00224   eoPop(void) : p2w(0) {}
+00225 
+00226   void sort()
+00227   {
+00228     scale(); // get the worths up to date
+00229 
+00230     std::sort(begin(), end(), greater<EOT>());
+00231   }
+00232 
+00233   void scale()
+00234   {
+00235     if (p2w)
+00236     {
+00237       if (!fitness_traits::needs_mapping)
+00238       {
+00239         throw runtime_error("eoPop: no scaling needed, yet a scaling function is defined");
+00240       }
+00241 
+00242       (*p2w)(*this);
+00243     }
+00244     else if (fitness_traits::needs_mapping)
+00245     {
+00246       throw runtime_error("eoPop: no scaling function attached to the population, while one was certainly called for");
+00247     }
+00248   }
+00249 
+00250   void setPerf2Worth(eoPerf2Worth<EOT>& _p2w)
+00251   {
+00252     p2w = &_p2w;
+00253   }
+00254 
+00255   void setPerf2Worth(eoPerf2Worth<EOT>* _p2w)
+00256   {
+00257     p2w = _p2w;
+00258   }
+00259 
+00260   eoPerf2Worth<EOT>* getPerf2Worth() { return p2w; }
+00261 
+00262   void swap(eoPop<EOT>& other)
+00263   {
+00264     vector<EOT>::swap(other);
+00265     eoPerf2Worth<EOT>* tmp = p2w;
+00266     p2w = other.p2w;
+00267     other.p2w = tmp;
+00268   }
+00269 
+00270 private :
+00271 
+00272   // a pointer as it can be emtpy
+00273   eoPerf2Worth<EOT>* p2w;
+00274 };
+00275 
+00276 // need this one to be able to swap the members as well...
+00277 template <class EOT>
+00278 void swap(eoPop<EOT>& _p1, eoPop<EOT>& _p2)
+00279 {
+00280   _p1.swap(_p2);
+00281 }
+00282 
+00283 /* end eoPop.h */
+00284 
+00285 /* main and test */
+00286 
+00287 template <class EOT>
+00288 void algo(eoPop<EOT>& _pop)
+00289 {
+00290   eoPop<EOT> offspring;                          // how to get the scaling info into this guy??
+00291   offspring.setPerf2Worth(_pop.getPerf2Worth()); // like this!
+00292 
+00293   std::copy(_pop.begin(), _pop.end(), back_inserter(offspring));
+00294 
+00295   offspring.sort(); // should call scale
+00296 
+00297   swap(_pop, offspring);
+00298 }
+00299 
+00300 void minimization_test()
+00301 {
+00302   typedef EO<minimization> eo_type;
+00303 
+00304   eo_type eo1;
+00305   eo_type eo2;
+00306 
+00307   eo1.performance(1.0);
+00308   eo2.performance(2.0);
+00309 
+00310   std::cout << "With minimizing fitness" << std::endl;
+00311   std::cout << eo1.fitness() << " < " << eo2.fitness() << " returns " << (eo1 < eo2) << std::endl;
+00312   std::cout << eo2.fitness() << " < " << eo1.fitness() << " returns " << (eo2 < eo1) << std::endl;
+00313 }
+00314 
+00315 void the_main()
+00316 {
+00317   typedef EO<double> simple_eo;
+00318   typedef EO<pair<double, double> > scaled_eo;
+00319 
+00320   simple_eo eo1;
+00321   simple_eo eo3;
+00322 
+00323 /* First test some simple comparisons */
+00324 
+00325   eo1.fitness(10); // could also use performance()
+00326   eo3.fitness(5);
+00327 
+00328   std::cout << eo1.fitness() << std::endl;
+00329   std::cout << eo3.fitness() << std::endl;
+00330 
+00331   std::cout << "eo1 < eo3 = " << (eo1 < eo3) << std::endl;
+00332 
+00333 
+00334   scaled_eo eo2;
+00335   scaled_eo eo4;
+00336   eo2.performance(10);
+00337   eo4.performance(8);
+00338 
+00339 /* Now test if the worth gets accessed and if the flag protects it */
+00340 
+00341   try
+00342   {
+00343     std::cout << eo2.fitness() << std::endl;
+00344     std::cout << "did not throw" << std::endl;
+00345     assert(false); // should throw
+00346   }
+00347   catch(std::exception& e)
+00348   {
+00349     std::cout << "Fitness threw exception, as it should" << std::endl;
+00350     std::cout << e.what() << std::endl;
+00351   }
+00352 
+00353 /* Set the worth and all is well (this is normally done by some perf2worth functor */
+00354 
+00355   eo2.worth(3);
+00356   eo4.worth(5);
+00357 
+00358   std::cout << "with maximization " << std::endl;
+00359   std::cout << eo2.fitness() << std::endl;
+00360   std::cout << eo4.fitness() << std::endl;
+00361   std::cout << eo2.fitness() << " < " << eo4.fitness() << " returns " << (eo2 < eo4) << std::endl;
+00362 
+00363 /* Test the minimization of fitness */
+00364   minimization_test();
+00365 
+00366 
+00367 /* Populations */
+00368 
+00369 // test pop without scaling, should have no overhead save for a single empty pointer in pop
+00370   eoPop<simple_eo> pop0;
+00371   pop0.resize(1);
+00372   pop0[0].fitness(1);
+00373 
+00374   algo(pop0);
+00375 
+00376   std::cout << pop0[0].fitness() << std::endl;
+00377 
+00378   assert(pop0[0].fitness() == 1);
+00379 
+00380 /* test pop with scaling */
+00381 
+00382   eoPerf2Worth<scaled_eo> perf2worth;
+00383   eoPop<scaled_eo> pop1;
+00384 
+00385   pop1.resize(1);
+00386 
+00387   pop1[0].fitness(1.0); // emulate evaluation
+00388 
+00389     // at this point getting the fitness should throw
+00390   try
+00391   {
+00392     std::cout << pop1[0].fitness() << std::endl;
+00393     std::cout << "did not throw" << std::endl;
+00394     assert(false); // should throw
+00395   }
+00396   catch(std::exception& e)
+00397   {
+00398     std::cout << "Fitness threw exception, as it should" << std::endl;
+00399     std::cout << e.what() << std::endl;
+00400   }
+00401 
+00402   // at this point trying to scale should throw
+00403   try
+00404   {
+00405     algo(pop1); // should complain that it cannot scale
+00406     assert(false); // so it would never get here
+00407   }
+00408   catch(std::exception& e)
+00409   { // but rather ends here
+00410     std::cout << e.what() << std::endl;
+00411   }
+00412 
+00413   // ok, now set the scaling
+00414   pop1.setPerf2Worth(perf2worth);
+00415 
+00416   algo(pop1);
+00417 
+00418   std::cout << "the fitness has been transformed from " << pop1[0].performance() << " to exp(-1) = " << pop1[0].fitness() << std::endl;
+00419 }
+00420 
+00421 int main()
+00422 {
+00423   try
+00424   {
+00425     the_main();
+00426   }
+00427   catch(std::exception& e)
+00428   {
+00429     std::cout << e.what() << std::endl;
+00430   }
+00431 }
+00432 
+00433 
+
Generated on Thu Oct 19 05:06:39 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/ftv2blank.png b/trunk/paradiseo-eo/doc/html/ftv2blank.png new file mode 100644 index 0000000000000000000000000000000000000000..493c3c0b615ade5b22027bde773faf2c0e076d66 GIT binary patch literal 174 zcmeAS@N?(olHy`uVBq!ia0vp^0zfRr2qYM%T@!Q%(o7{me!&ckj8p!u14)&*MwA5S zr6z#mEsk^N1FBF3sc_EE%}vcKVF=AhO-xa6_jFST&P^;T z2~I3aEm8;rVk12R#UIz>f`J-DJY5_^DsClP9B62eH+WF*G=YJMp~A-KbWwke5Kx}M M)78&qol`;+0EL(^EC2ui literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/ftv2doc.png b/trunk/paradiseo-eo/doc/html/ftv2doc.png new file mode 100644 index 0000000000000000000000000000000000000000..f72999f92172cca6edaa2538286b3e369bec9f49 GIT binary patch literal 255 zcmeAS@N?(olHy`uVBq!ia0vp^5yjnX4egh%q=bp-`Pe zR7&bp17l3gfhmh7Fm(iZ2eAfco|q!h5)>qKG?UBh!IC9QGMbJAHf6IEiufk_g|d7~ qkWqJ4k(|I-Aeo-5U~n{Fnc?dN!3Uwu?t6hQVDNPHb6Mw<&;$TLIZ`G7 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/ftv2folderclosed.png b/trunk/paradiseo-eo/doc/html/ftv2folderclosed.png new file mode 100644 index 0000000000000000000000000000000000000000..d6d063440cbf13c4128dacd96661b6fce58abf26 GIT binary patch literal 259 zcmeAS@N?(olHy`uVBq!ia0vp^55uo^`BphW;jCHO69?}tw{JfcdnZ<*@N=4I z?xF5Qc|QYEmKAIZ;JRGVHe=bn*tx1_|J^^vyg*oVM#A1kZlFULJYD@<);T3K0RTgB BWg7qh literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/ftv2folderopen.png b/trunk/paradiseo-eo/doc/html/ftv2folderopen.png new file mode 100644 index 0000000000000000000000000000000000000000..bbe2c913cf493ee37ad8e3a5132382138d93ac92 GIT binary patch literal 261 zcmeAS@N?(olHy`uVBq!ia0vp^5u(C zYP)Mg%H-DB+{J~>rPn_#pYTax?r*V6ubqGX{lvROQ{?n5_cbm+cQAOm`njxgN@xNA D92;js literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/ftv2lastnode.png b/trunk/paradiseo-eo/doc/html/ftv2lastnode.png new file mode 100644 index 0000000000000000000000000000000000000000..e7b9ba90cb0cf71c8ce662956bfee7d64cf60fa6 GIT binary patch literal 233 zcmeAS@N?(olHy`uVBq!ia0vp^0zfRr!py+H=+kU?6UZ?L@CkAK|NlRbNhD}!Xpp$P zU;Pg)ksC(lf|p%(p+w2Gk+!>EaktaVt4N i!r*{E4>QXNV>t$uAA#a^n)TVt_DW*G8-srQl%FeIsRSdYm zeDdtWec}u&7@8h5rqv#p7g*pRdwwmugmlS-+cHV~j}#7`Nwj9m+AU)JGGo`8z_}`K z?s#Xsy%Z;1_jl5Y+?Gum8WyK6`MBvup0SAOKJ)mWcHyteJ?WLL>>-)=?&<$H&t5oH Vd!azZ1yDdSc)I$ztaD0e0sw}(dc*(# literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/ftv2mlastnode.png b/trunk/paradiseo-eo/doc/html/ftv2mlastnode.png new file mode 100644 index 0000000000000000000000000000000000000000..09ceb6adb01054ce799ad20c0e818ab9272f2df2 GIT binary patch literal 160 zcmeAS@N?(olHy`uVBq!ia0vp^0zfRr#LU3Jc=+&fg$isFPOjJ*AaIJQGm()YSDb0rfjgNefXW#>UHx3vIVCg! E0ORy6RsaA1 literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/ftv2mnode.png b/trunk/paradiseo-eo/doc/html/ftv2mnode.png new file mode 100644 index 0000000000000000000000000000000000000000..3254c05112199fbc80aad313611c58a5b388792d GIT binary patch literal 194 zcmeAS@N?(olHy`uVBq!ia0vp^0zfRr!py+H=+kU?6Ub2s@Ck7}aNq!ti3c<^Gz9OH zn+a6GSQ6wH%;50sMjDVKR^l2_5}cn_Ql40p%8;I!W>k=uu3)5RqGz-?&YcgaLd(;| zF{I*Fa>4?=2W(CyOv{5p*uLi}G<-ambjQcb>&~4!CzK3KXWY6d$*{eWU47N}X+XCz OFnGH9xvXPg)ksC(lf|p%(p+w2Gk+y>EaktaVt4N l!r*{E4>Lv;t literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/ftv2plastnode.png b/trunk/paradiseo-eo/doc/html/ftv2plastnode.png new file mode 100644 index 0000000000000000000000000000000000000000..0b07e00913d8069ebbb51bd7fd6d70d8bba88f75 GIT binary patch literal 165 zcmeAS@N?(olHy`uVBq!ia0vp^0zfRr#LU3Jc=+&MJ literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/ftv2pnode.png b/trunk/paradiseo-eo/doc/html/ftv2pnode.png new file mode 100644 index 0000000000000000000000000000000000000000..2001b797ba2b98a4127f1d3efca64aef08bf6d51 GIT binary patch literal 200 zcmeAS@N?(olHy`uVBq!ia0vp^0zfRr!py+H=+kU?6Ub2s@Ck7}aNq!ti3c<^Gz9OH zn+a6GSQ6wH%;50sMjDVKR^l2_5}cn_Ql40p%8;I!W>k=uu3)5RqGz-?&Ycga!obtT zF{I*Fa>4?=2W(Dkd1@Anj~<0|oqBMOmqox%*rjK-r)THv+0v0L%h-agt(X~hWwYzA SIxU|Ma*U^|pUXO@geCywmoZiV literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/ftv2vertline.png b/trunk/paradiseo-eo/doc/html/ftv2vertline.png new file mode 100644 index 0000000000000000000000000000000000000000..b330f3a33c0085c183ff39fc56b1b274160c1da0 GIT binary patch literal 229 zcmeAS@N?(olHy`uVBq!ia0vp^0zfRr!py+H=+kU?6UZ?L@CkAK|NlRbNhD}!Xpp$P zU;Pg)ksC(lf|p%(p+w2Gqgt>EaktaVt4N e!r*{^G#i7W2*a|cHZQDzQVgE1elF{r5}E+)J2fZ( literal 0 HcmV?d00001 diff --git a/trunk/paradiseo-eo/doc/html/functions.html b/trunk/paradiseo-eo/doc/html/functions.html new file mode 100644 index 000000000..bb45fcf73 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/functions.html @@ -0,0 +1,403 @@ + + +EO: Class Members + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
All | Functions | Variables | Typedefs
+
a | b | c | d | e | f | g | h | i | k | l | m | n | o | p | r | s | t | u | v | w | ~
+ +

+ +

+Here is a list of all documented class members with links to the class documentation for each member:

- a -

+

- b -

+

- c -

+

- d -

+

- e -

+

- f -

+

- g -

+

- h -

+

- i -

+

- k -

+

- l -

+

- m -

+

- n -

+

- o -

+

- p -

+

- r -

+

- s -

+

- t -

+

- u -

+

- v -

+

- w -

+

- ~ -

+
Generated on Thu Oct 19 05:06:44 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/functions_func.html b/trunk/paradiseo-eo/doc/html/functions_func.html new file mode 100644 index 000000000..e9ff8972a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/functions_func.html @@ -0,0 +1,382 @@ + + +EO: Class Members - Functions + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
All | Functions | Variables | Typedefs
+
a | b | c | d | e | f | g | h | i | l | m | n | o | p | r | s | t | u | v | w | ~
+ +

+ +

+

- a -

+

- b -

+

- c -

+

- d -

+

- e -

+

- f -

+

- g -

+

- h -

+

- i -

+

- l -

+

- m -

+

- n -

+

- o -

+

- p -

+

- r -

+

- s -

+

- t -

+

- u -

+

- v -

+

- w -

+

- ~ -

+
Generated on Thu Oct 19 05:06:44 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/functions_type.html b/trunk/paradiseo-eo/doc/html/functions_type.html new file mode 100644 index 000000000..5a96bff46 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/functions_type.html @@ -0,0 +1,22 @@ + + +EO: Class Members - Typedefs + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
All | Functions | Variables | Typedefs
+ +

+

+
Generated on Thu Oct 19 05:06:44 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/functions_vars.html b/trunk/paradiseo-eo/doc/html/functions_vars.html new file mode 100644 index 000000000..ee48d715f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/functions_vars.html @@ -0,0 +1,36 @@ + + +EO: Class Members - Variables + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
All | Functions | Variables | Typedefs
+ +

+

+
Generated on Thu Oct 19 05:06:44 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/ga_2make__op_8h-source.html b/trunk/paradiseo-eo/doc/html/ga_2make__op_8h-source.html new file mode 100644 index 000000000..bb4639dba --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/ga_2make__op_8h-source.html @@ -0,0 +1,223 @@ + + +EO: make_op.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / ga
+

ga/make_op.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_op.h
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _make_op_h
+00028 #define _make_op_h
+00029 
+00030 // the operators
+00031 #include <eoOp.h>
+00032 #include <eoGenOp.h>
+00033 #include <eoCloneOps.h>
+00034 #include <eoOpContainer.h>
+00035 // combinations of simple eoOps (eoMonOp and eoQuadOp)
+00036 #include <eoProportionalCombinedOp.h>
+00037 
+00038 // the specialized GA stuff
+00039 #include <ga/eoBit.h>
+00040 #include <ga/eoBitOp.h>
+00041   // also need the parser and param includes
+00042 #include <utils/eoParser.h>
+00043 #include <utils/eoState.h>
+00044 
+00045 
+00047 // canonical (crossover + mutation) only at the moment //
+00048 
+00049 /*
+00050  * This function builds the operators that will be applied to the bitstrings
+00051  *
+00052  * It uses a parser (to get user parameters) and a state (to store the memory)
+00053  * the last argument is an individual, needed for 2 reasons
+00054  *     it disambiguates the call after instanciations
+00055  *     some operator might need some private information about the indis
+00056  *
+00057  * This is why the template is the complete EOT even though only the fitness
+00058  * is actually templatized here: the following only applies to bitstrings
+00059  *
+00060  * Note : the last parameter is an eoInit: if some operator needs some info 
+00061  *        about the gneotypes, the init has it all (e.g. bounds, ...)
+00062  *        Simply do 
+00063  *        EOT myEO;
+00064  *        _init(myEO);
+00065  *        and myEO is then an ACTUAL object
+00066 */
+00067 
+00068 template <class EOT>
+00069 eoGenOp<EOT> & do_make_op(eoParser& _parser, eoState& _state, eoInit<EOT>& _init)
+00070 {
+00071   // this is a temporary version, while Maarten codes the full tree-structured
+00072   // general operator input
+00073   // BTW we must leave that simple version available somehow, as it is the one
+00074   // that 90% people use!
+00075     eoValueParam<std::string>& operatorParam =  _parser.createParam(std::string("SGA"), "operator", "Description of the operator (SGA only now)", 'o', "Variation Operators");
+00076 
+00077     if (operatorParam.value() != std::string("SGA"))
+00078         throw std::runtime_error("Only SGA-like operator available right now\n");
+00079 
+00080     // now we read Pcross and Pmut, 
+00081     // the relative weights for all crossovers -> proportional choice
+00082     // the relative weights for all mutations -> proportional choice
+00083     // and create the eoGenOp that is exactly 
+00084     // crossover with pcross + mutation with pmut
+00085 
+00086     eoValueParam<double>& pCrossParam = _parser.createParam(0.6, "pCross", "Probability of Crossover", 'C', "Variation Operators" );
+00087     // minimum check
+00088     if ( (pCrossParam.value() < 0) || (pCrossParam.value() > 1) )
+00089       throw std::runtime_error("Invalid pCross");
+00090 
+00091     eoValueParam<double>& pMutParam = _parser.createParam(0.1, "pMut", "Probability of Mutation", 'M', "Variation Operators" );
+00092     // minimum check
+00093     if ( (pMutParam.value() < 0) || (pMutParam.value() > 1) )
+00094       throw std::runtime_error("Invalid pMut");
+00095 
+00096     // the crossovers
+00098     // the parameters
+00099     eoValueParam<double>& onePointRateParam = _parser.createParam(double(1.0), "onePointRate", "Relative rate for one point crossover", '1', "Variation Operators" );
+00100     // minimum check
+00101     if ( (onePointRateParam.value() < 0) )
+00102       throw std::runtime_error("Invalid onePointRate");
+00103 
+00104     eoValueParam<double>& twoPointsRateParam = _parser.createParam(double(1.0), "twoPointRate", "Relative rate for two point crossover", '2', "Variation Operators" );
+00105     // minimum check
+00106     if ( (twoPointsRateParam.value() < 0) )
+00107       throw std::runtime_error("Invalid twoPointsRate");
+00108 
+00109     eoValueParam<double>& uRateParam = _parser.createParam(double(2.0), "uRate", "Relative rate for uniform crossover", 'U', "Variation Operators" );
+00110     // minimum check
+00111     if ( (uRateParam.value() < 0) )
+00112       throw std::runtime_error("Invalid uRate");
+00113 
+00114     // minimum check
+00115     bool bCross = true;
+00116     if (onePointRateParam.value()+twoPointsRateParam.value()+uRateParam.value()==0)
+00117       {
+00118         std::cerr << "Warning: no crossover" << std::endl;
+00119         bCross = false;
+00120       }
+00121     
+00122     // Create the CombinedQuadOp
+00123     eoPropCombinedQuadOp<EOT> *ptCombinedQuadOp = NULL;
+00124     eoQuadOp<EOT> *ptQuad = NULL;
+00125     // 1-point crossover for bitstring
+00126     ptQuad = new eo1PtBitXover<EOT>;
+00127     _state.storeFunctor(ptQuad);
+00128     ptCombinedQuadOp = new eoPropCombinedQuadOp<EOT>(*ptQuad, onePointRateParam.value());
+00129     
+00130     // uniform crossover for bitstring
+00131     ptQuad = new eoUBitXover<EOT>;
+00132     _state.storeFunctor(ptQuad);
+00133     ptCombinedQuadOp->add(*ptQuad, uRateParam.value());
+00134     
+00135     // 2-points xover
+00136     ptQuad = new eoNPtsBitXover<EOT>;
+00137     _state.storeFunctor(ptQuad);
+00138     ptCombinedQuadOp->add(*ptQuad, twoPointsRateParam.value());
+00139 
+00140     // don't forget to store the CombinedQuadOp
+00141     _state.storeFunctor(ptCombinedQuadOp);
+00142 
+00143     // the mutations
+00145     // the parameters
+00146     eoValueParam<double> & pMutPerBitParam = _parser.createParam(0.01, "pMutPerBit", "Probability of flipping 1 bit in bit-flip mutation", 'b', "Variation Operators" );
+00147     // minimum check
+00148     if ( (pMutPerBitParam.value() < 0) || (pMutPerBitParam.value() > 0.5) )
+00149       throw std::runtime_error("Invalid pMutPerBit");
+00150 
+00151     eoValueParam<double> & bitFlipRateParam = _parser.createParam(0.01, "bitFlipRate", "Relative rate for bit-flip mutation", 's', "Variation Operators" );
+00152     // minimum check
+00153     if ( (bitFlipRateParam.value() < 0) )
+00154       throw std::runtime_error("Invalid bitFlipRate");
+00155       
+00156     eoValueParam<double> & oneBitRateParam = _parser.createParam(0.01, "oneBitRate", "Relative rate for deterministic bit-flip mutation", 'd', "Variation Operators" );
+00157     // minimum check
+00158     if ( (oneBitRateParam.value() < 0) )
+00159       throw std::runtime_error("Invalid oneBitRate");
+00160 
+00161     // minimum check
+00162     bool bMut = true;
+00163     if (bitFlipRateParam.value()+oneBitRateParam.value()==0)
+00164       {
+00165         std::cerr << "Warning: no mutation" << std::endl;
+00166         bMut = false;
+00167       }
+00168     
+00169     // Create the CombinedMonOp
+00170     eoPropCombinedMonOp<EOT> *ptCombinedMonOp = NULL;
+00171     eoMonOp<EOT> *ptMon = NULL;
+00172 
+00173   // standard bit-flip mutation for bitstring
+00174   ptMon = new eoBitMutation<EOT>(pMutPerBitParam.value());
+00175   _state.storeFunctor(ptMon);
+00176   // create the CombinedMonOp
+00177   ptCombinedMonOp = new eoPropCombinedMonOp<EOT>(*ptMon, bitFlipRateParam.value());
+00178 
+00179   // mutate exactly 1 bit per individual
+00180   ptMon = new eoDetBitFlip<EOT>; 
+00181   _state.storeFunctor(ptMon);
+00182   ptCombinedMonOp->add(*ptMon, oneBitRateParam.value());
+00183 
+00184   _state.storeFunctor(ptCombinedMonOp);
+00185 
+00186   // now build the eoGenOp:
+00187   // to simulate SGA (crossover with proba pCross + mutation with proba pMut
+00188   // we must construct
+00189   //     a sequential combination of
+00190   //          with proba 1, a proportional combination of 
+00191   //                        a QuadCopy and our crossover
+00192   //          with proba pMut, our mutation
+00193 
+00194   // the crossover - with probability pCross
+00195   eoProportionalOp<EOT> * cross = new eoProportionalOp<EOT> ;
+00196   _state.storeFunctor(cross);
+00197   ptQuad = new eoQuadCloneOp<EOT>;
+00198   _state.storeFunctor(ptQuad);
+00199   cross->add(*ptCombinedQuadOp, pCrossParam.value()); // user crossover
+00200   cross->add(*ptQuad, 1-pCrossParam.value()); // clone operator
+00201 
+00202   // now the sequential
+00203   eoSequentialOp<EOT> *op = new eoSequentialOp<EOT>;
+00204   _state.storeFunctor(op);
+00205   op->add(*cross, 1.0);  // always crossover (but clone with prob 1-pCross
+00206   op->add(*ptCombinedMonOp, pMutParam.value());
+00207 
+00208   // that's it!
+00209   return *op;
+00210 }
+00211 #endif
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/ga_8h-source.html b/trunk/paradiseo-eo/doc/html/ga_8h-source.html new file mode 100644 index 000000000..4b411c790 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/ga_8h-source.html @@ -0,0 +1,57 @@ + + +EO: ga.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src
+

ga.h

00001 //-----------------------------------------------------------------------------
+00002 // ga.h
+00003 // (c) GeNeura Team 1998 - 2000, Marc Schoenauer 2001
+00004 /* 
+00005     This library is free software; you can redistribute it and/or
+00006     modify it under the terms of the GNU Lesser General Public
+00007     License as published by the Free Software Foundation; either
+00008     version 2 of the License, or (at your option) any later version.
+00009 
+00010     This library is distributed in the hope that it will be useful,
+00011     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00012     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00013     Lesser General Public License for more details.
+00014 
+00015     You should have received a copy of the GNU Lesser General Public
+00016     License along with this library; if not, write to the Free Software
+00017     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00018 
+00019     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00020              Marc.Schoenauer@polytechnique.fr
+00021  */
+00022 //-----------------------------------------------------------------------------
+00023 
+00024 #ifdef _MSC_VER
+00025 // to avoid long name warnings
+00026 #pragma warning(disable:4786)
+00027 #endif 
+00028 
+00029 #ifndef _ga_h
+00030 #define _ga_h
+00031 
+00032 // all bitstring-specific files
+00033 #include <ga/eoBit.h>
+00034 
+00035 // the operators
+00036 #include <ga/eoBitOp.h>
+00037 
+00038 // #include <ga/eoBitOpFactory.h> to be corrected - thanks someone!
+00039 
+00040 //-----------------------------------------------------------------------------
+00041 
+00042 #endif
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/genetic_ops_8cpp-source.html b/trunk/paradiseo-eo/doc/html/genetic_ops_8cpp-source.html new file mode 100644 index 000000000..684efe0ed --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/genetic_ops_8cpp-source.html @@ -0,0 +1,173 @@ + + +EO: geneticOps.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / pyeo
+

geneticOps.cpp

00001 /*
+00002     PyEO
+00003     
+00004     Copyright (C) 2003 Maarten Keijzer
+00005 
+00006     This program is free software; you can redistribute it and/or modify
+00007     it under the terms of the GNU General Public License as published by
+00008     the Free Software Foundation; either version 2 of the License, or
+00009     (at your option) any later version.
+00010 
+00011     This program is distributed in the hope that it will be useful,
+00012     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00013     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00014     GNU General Public License for more details.
+00015 
+00016     You should have received a copy of the GNU General Public License
+00017     along with this program; if not, write to the Free Software
+00018     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00019 */
+00020 
+00021 #include <eoGenOp.h>
+00022 #include <eoOp.h>
+00023 #include <eoCloneOps.h>
+00024 #include <eoPopulator.h>
+00025 #include <eoOpContainer.h>
+00026 
+00027 #include "PyEO.h"
+00028 #include "def_abstract_functor.h"
+00029 
+00030 using namespace boost::python;
+00031 
+00032 class GenOpWrapper : public eoGenOp<PyEO>
+00033 {
+00034     public:
+00035 
+00036     PyObject* self;
+00037     GenOpWrapper(PyObject* p) : self(p) {}
+00038     unsigned max_production(void)
+00039     {
+00040         return call_method<unsigned>(self,"max_production");
+00041     }
+00042     std::string className() const
+00043     {
+00044         return "GenOpDerivative"; // never saw the use of className anyway
+00045     }
+00046     
+00047     void apply(eoPopulator<PyEO>& populator )
+00048     {
+00049         boost::python::call_method<void>(self,"apply", boost::ref( populator ) );
+00050     }
+00051 };
+00052 
+00053 class PopulatorWrapper : public eoPopulator<PyEO>
+00054 {
+00055 public:
+00056     PyObject* self;
+00057     PopulatorWrapper(PyObject* p, const eoPop<PyEO>& src, eoPop<PyEO>& dest) 
+00058         : eoPopulator<PyEO>(src, dest), self(p) 
+00059         {
+00060             //throw std::runtime_error("abstract base class");
+00061         }
+00062     
+00063     const PyEO& select()
+00064     {
+00065         return call_method<const PyEO&>(self,"select");
+00066     }
+00067 };
+00068 
+00069 class MonOpWrapper : public eoMonOp<PyEO>
+00070 {
+00071 public:
+00072     PyObject* self;
+00073     MonOpWrapper(PyObject* p) : self(p) {}
+00074     bool operator()(PyEO& _eo)
+00075     { return boost::python::call_method<bool>(self, "__call__", boost::ref( _eo )); }
+00076 };
+00077 class BinOpWrapper : public eoBinOp<PyEO>
+00078 {
+00079 public:
+00080     PyObject* self;
+00081     BinOpWrapper(PyObject* p) : self(p) {}
+00082     bool operator()(PyEO& _eo, const PyEO& _eo2)
+00083     { return boost::python::call_method<bool>(self, "__call__", boost::ref( _eo ), boost::ref(_eo2)); }
+00084 };
+00085 class QuadOpWrapper : public eoQuadOp<PyEO>
+00086 {
+00087 public:
+00088     PyObject* self;
+00089     QuadOpWrapper(PyObject* p) : self(p) {}
+00090     bool operator()(PyEO& _eo, PyEO& _eo2)
+00091     { return boost::python::call_method<bool>(self, "__call__", boost::ref( _eo ), boost::ref(_eo2)); }
+00092 };
+00093 
+00094 void geneticOps()
+00095 {
+00096     class_<eoPopulator<PyEO>, PopulatorWrapper, boost::noncopyable>
+00097         ("eoPopulator", init<const eoPop<PyEO>&, eoPop<PyEO>&>() )
+00098         .def("select", &PopulatorWrapper::select,  return_internal_reference<>() )
+00099         .def("get", &eoPopulator<PyEO>::operator*, return_internal_reference<>() )
+00100         .def("next", &eoPopulator<PyEO>::operator++, return_internal_reference<>() )
+00101         .def("insert", &eoPopulator<PyEO>::insert)
+00102         .def("reserve", &eoPopulator<PyEO>::reserve)
+00103         .def("source", &eoPopulator<PyEO>::source, return_internal_reference<>() )
+00104         .def("offspring", &eoPopulator<PyEO>::offspring, return_internal_reference<>() )
+00105         .def("tellp", &eoPopulator<PyEO>::tellp)
+00106         .def("seekp", &eoPopulator<PyEO>::seekp)
+00107         .def("exhausted", &eoPopulator<PyEO>::exhausted)
+00108         ;
+00109 
+00110     class_<eoSeqPopulator<PyEO>, bases<eoPopulator<PyEO> > >
+00111         ("eoSeqPopulator", init<const eoPop<PyEO>&, eoPop<PyEO>&>() )
+00112         .def("select", &eoSeqPopulator<PyEO>::select, return_internal_reference<>() )
+00113         ;
+00114     
+00115     class_<eoSelectivePopulator<PyEO>, bases<eoPopulator<PyEO> > >
+00116         ("eoSelectivePopulator", init<const eoPop<PyEO>&, eoPop<PyEO>&, eoSelectOne<PyEO>& >() )
+00117         .def("select", &eoSeqPopulator<PyEO>::select, return_internal_reference<>() )
+00118         ;
+00119     enum_<eoOp<PyEO>::OpType>("OpType")
+00120         .value("unary", eoOp<PyEO>::unary)
+00121         .value("binary", eoOp<PyEO>::binary)
+00122         .value("quadratic", eoOp<PyEO>::quadratic)
+00123         .value("general", eoOp<PyEO>::general)
+00124         ;
+00125    
+00126     class_<eoOp<PyEO> >("eoOp", init<eoOp<PyEO>::OpType>())
+00127         .def("getType", &eoOp<PyEO>::getType);
+00128     
+00129     class_<eoMonOp<PyEO>, MonOpWrapper, bases<eoOp<PyEO> >, boost::noncopyable>("eoMonOp", init<>())
+00130         .def("__call__", &MonOpWrapper::operator(), "an example docstring");
+00131     class_<eoBinOp<PyEO>, BinOpWrapper, bases<eoOp<PyEO> >, boost::noncopyable>("eoBinOp", init<>())
+00132         .def("__call__", &BinOpWrapper::operator());
+00133     class_<eoQuadOp<PyEO>, QuadOpWrapper, bases<eoOp<PyEO> >, boost::noncopyable>("eoQuadOp", init<>())
+00134         .def("__call__", &QuadOpWrapper::operator());
+00135     
+00136     class_<eoGenOp<PyEO>, GenOpWrapper, bases<eoOp<PyEO> >, boost::noncopyable>("eoGenOp", init<>())
+00137         .def("max_production", &GenOpWrapper::max_production)
+00138         .def("className", &GenOpWrapper::className)
+00139         .def("apply", &GenOpWrapper::apply)
+00140         .def("__call__", &eoGenOp<PyEO>::operator())
+00141         ;
+00142     
+00143     class_<eoSequentialOp<PyEO>, bases<eoGenOp<PyEO> >, boost::noncopyable>("eoSequentialOp", init<>())
+00144         .def("add", &eoSequentialOp<PyEO>::add, WC1)
+00145         .def("apply", &eoSequentialOp<PyEO>::apply)
+00146         ;
+00147    
+00148     class_<eoProportionalOp<PyEO>, bases<eoGenOp<PyEO> >, boost::noncopyable>("eoProportionalOp", init<>())
+00149         .def("add", &eoProportionalOp<PyEO>::add, WC1)
+00150         .def("apply", &eoProportionalOp<PyEO>::apply)
+00151         ;
+00152     
+00153     /* Cloning */
+00154     class_<eoMonCloneOp<PyEO>, bases<eoMonOp<PyEO> > >("eoMonCloneOp").def("__call__", &eoMonCloneOp<PyEO>::operator());
+00155     class_<eoBinCloneOp<PyEO>, bases<eoBinOp<PyEO> > >("eoBinCloneOp").def("__call__", &eoBinCloneOp<PyEO>::operator());
+00156     class_<eoQuadCloneOp<PyEO>, bases<eoQuadOp<PyEO> > >("eoQuadCloneOp").def("__call__", &eoQuadCloneOp<PyEO>::operator());
+00157 
+00158 }
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/gprop_8cpp-source.html b/trunk/paradiseo-eo/doc/html/gprop_8cpp-source.html new file mode 100644 index 000000000..766ff7cac --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/gprop_8cpp-source.html @@ -0,0 +1,185 @@ + + +EO: gprop.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+app / gprop
+

gprop.cpp

00001 //-----------------------------------------------------------------------------
+00002 // gprop
+00003 //-----------------------------------------------------------------------------
+00004 using namespace std;
+00005 
+00006 #include <stdlib.h>                // EXIT_SUCCESS EXIT_FAILURE
+00007 #include <stdexcept>               // exception 
+00008 #include <iostream>                // cerr cout
+00009 #include <fstream>                 // ifstream
+00010 #include <string>                  // string
+00011 #include <eo>                      // all usefull eo stuff
+00012 #include "gprop.h"                 // Chrom eoChromInit eoChromMutation eoChromXover eoChromEvaluator
+00013 
+00014 //-----------------------------------------------------------------------------
+00015 // global variables
+00016 //-----------------------------------------------------------------------------
+00017 
+00018 unsigned in, out, hidden;
+00019 mlp::set train, validate, test;
+00020 
+00021 //-----------------------------------------------------------------------------
+00022 // parameters
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 eoValueParam<unsigned> pop_size(10, "pop_size", "population size", 'p');
+00026 eoValueParam<unsigned> generations(10, "generations", "number of generation", 'g');
+00027 eoValueParam<double> mut_rate(0.25, "mut_rate", "mutation rate", 'm');
+00028 eoValueParam<double> xover_rate(0.25, "xover_rate", "default crossover rate", 'x');
+00029 eoValueParam<string> file("", "file", "common start of patterns filenames *.trn *.val and *.tst", 'f');
+00030 eoValueParam<unsigned> hiddenp(0, "hidden", "number of neurons in hidden layer", 'd');
+00031 
+00032 //-----------------------------------------------------------------------------
+00033 // auxiliar functions
+00034 //-----------------------------------------------------------------------------
+00035 
+00036 void arg(int argc, char** argv);
+00037 void load_file(mlp::set& s, const string& s);
+00038 void ga();
+00039 
+00040 //-----------------------------------------------------------------------------
+00041 // main
+00042 //-----------------------------------------------------------------------------
+00043 
+00044 int main(int argc, char** argv)
+00045 {
+00046   try
+00047     {
+00048       arg(argc, argv);
+00049       ga();
+00050     }
+00051   catch (exception& e)
+00052     {
+00053       cerr << argv[0] << ": " << e.what() << endl;
+00054       exit(EXIT_FAILURE);
+00055     }
+00056 
+00057   return 0;
+00058 }
+00059 
+00060 //-----------------------------------------------------------------------------
+00061 // implementation
+00062 //-----------------------------------------------------------------------------
+00063 
+00064 void arg(int argc, char** argv)
+00065 {
+00066   eoParser parser(argc, argv);
+00067   
+00068   parser.processParam(pop_size,    "genetic operators");
+00069   parser.processParam(generations, "genetic operators");
+00070   parser.processParam(mut_rate,    "genetic operators");
+00071   parser.processParam(xover_rate,  "genetic operators");
+00072   parser.processParam(file,        "files");
+00073   parser.processParam(hiddenp,     "genetic operators");
+00074 
+00075   if (parser.userNeedsHelp())
+00076     {
+00077       parser.printHelp(cout);
+00078       exit(EXIT_SUCCESS);
+00079     }
+00080 
+00081   load_file(train, "trn");
+00082   load_file(validate, "val");
+00083   load_file(test, "tst");
+00084     
+00085   phenotype::trn_max = train.size();
+00086   phenotype::val_max = validate.size();
+00087   phenotype::tst_max = test.size();
+00088 
+00089   in = train.front().input.size();
+00090   out = train.front().output.size();
+00091   gprop_use_datasets(&train, &validate, &test);
+00092   hidden = hiddenp.value();
+00093 }
+00094 
+00095 //-----------------------------------------------------------------------------
+00096 
+00097 void load_file(mlp::set& set, const string& ext)
+00098 {
+00099   string filename = file.value(); filename += "." + ext;
+00100 
+00101   ifstream ifs(filename.c_str());
+00102   if (!ifs)
+00103     {
+00104       cerr << "can't open file \"" << filename << "\"" << endl;
+00105       exit(EXIT_FAILURE);
+00106     } 
+00107   
+00108   ifs >> set;
+00109 
+00110   if (set.size() == 0)
+00111     {
+00112       cerr << filename << " data file is empty!";
+00113       exit(EXIT_FAILURE);
+00114     }
+00115 }
+00116 
+00117 //-----------------------------------------------------------------------------
+00118 
+00119 void ga()
+00120 {
+00121   // create population
+00122   eoInitChrom init;
+00123   eoPop<Chrom> pop(pop_size.value(), init);
+00124   
+00125   // evaluate population
+00126   eoEvalFuncPtr<Chrom> evaluator(eoChromEvaluator);
+00127   apply<Chrom>(evaluator, pop);
+00128   
+00129   // selector
+00130   eoStochTournamentSelect<Chrom> select;
+00131 
+00132   // genetic operators
+00133   eoChromMutation mutation;
+00134   eoChromXover xover;
+00135   
+00136   // stop condition
+00137   eoGenContinue<Chrom> continuator1(generations.value());
+00138   phenotype p; p.val_ok = validate.size() - 1; p.mse_error = 0;
+00139   eoFitContinue<Chrom> continuator2(p);
+00140   eoCombinedContinue<Chrom> continuator(continuator1, continuator2);
+00141 
+00142   // checkpoint
+00143   eoCheckPoint<Chrom> checkpoint(continuator);
+00144   
+00145   // monitor
+00146   eoStdoutMonitor monitor;
+00147   checkpoint.add(monitor);
+00148   
+00149   // statistics
+00150   eoBestFitnessStat<Chrom> stats;
+00151   checkpoint.add(stats);
+00152   monitor.add(stats);
+00153   
+00154   // genetic algorithm
+00155   eoSGA<Chrom> sga(select,
+00156                    xover, xover_rate.value(), 
+00157                    mutation, mut_rate.value(), 
+00158                    evaluator, 
+00159                    checkpoint);
+00160  
+00161   sga(pop);
+00162 
+00163   cout << "best: " << *max_element(pop.begin(), pop.end()) << endl;
+00164 }
+00165 
+00166 //-----------------------------------------------------------------------------
+00167 
+00168 // Local Variables: 
+00169 // mode:C++
+00170 // End:
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/gprop_8h-source.html b/trunk/paradiseo-eo/doc/html/gprop_8h-source.html new file mode 100644 index 000000000..0f2acc800 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/gprop_8h-source.html @@ -0,0 +1,254 @@ + + +EO: gprop.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+app / gprop
+

gprop.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // gprop.h
+00005 // (c) GeNeura Team 1998
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022  */
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 
+00026 #ifndef gprop_h
+00027 #define gprop_h
+00028 
+00029 //-----------------------------------------------------------------------------
+00030 
+00031 #include <iostream>               // istream ostream
+00032 #include <iomanip>                // setprecision
+00033 #include <string>                 // string
+00034 #include <EO.h>                   // EO
+00035 #include <eoOp.h>                 // eoMonOp eoQuadraticOp
+00036 #include <eoInit.h>               // eoInit
+00037 #include <utils/rnd_generators.h> // normal_generator
+00038 #include "mlp.h"                  // mlp::net mlp::set
+00039 #include "qp.h"                   // qp::set
+00040 #include "mse.h"                  // mse::error
+00041 
+00042 //-----------------------------------------------------------------------------
+00043 // phenotype
+00044 //-----------------------------------------------------------------------------
+00045 
+00046 struct phenotype
+00047 {
+00048   int trn_ok, val_ok, tst_ok;
+00049   double mse_error;
+00050 
+00051   static int trn_max, val_max, tst_max;
+00052 
+00053   friend bool operator<(const phenotype& a, const phenotype& b)
+00054   {
+00055     return a.val_ok < b.val_ok || !(b.val_ok < a.val_ok) && b.mse_error < a.mse_error;
+00056   }
+00057 
+00058   friend bool operator==(const phenotype& a, const phenotype& b)
+00059   {
+00060     return a.val_ok == b.val_ok && b.mse_error == a.mse_error;
+00061   }
+00062 
+00063   friend bool operator>=(const phenotype& a, const phenotype& b)
+00064   {
+00065     return !(a < b);
+00066   }
+00067 
+00068   friend bool operator>(const phenotype& a, const phenotype& b)
+00069   {
+00070     return (!(a == b)) && (!(a < b));
+00071   }
+00072   
+00073   
+00074   
+00075   friend ostream& operator<<(ostream& os, const phenotype& p)
+00076   {
+00077     return os << p.trn_ok << "/" << p.trn_max << " "
+00078               << p.val_ok << "/" << p.val_max << " "
+00079               << p.tst_ok << "/" << p.tst_max << " "
+00080               << p.mse_error;
+00081   }
+00082   
+00083   friend istream& operator>>(istream& is, phenotype& p)
+00084   {
+00085     return is; // complete me
+00086   }
+00087 };
+00088 
+00089 
+00090 int phenotype::trn_max = 0, phenotype::val_max = 0, phenotype::tst_max = 0;
+00091 
+00092 //-----------------------------------------------------------------------------
+00093 // genotype
+00094 //-----------------------------------------------------------------------------
+00095 #ifndef GPROP_GENOTYPE
+00096 #define GPROP_GENOTYPE mlp::net
+00097 #endif
+00098 
+00099 typedef GPROP_GENOTYPE genotype;
+00100 
+00101 //-----------------------------------------------------------------------------
+00102 // Chrom
+00103 //-----------------------------------------------------------------------------
+00104 
+00105 extern unsigned in, out, hidden;
+00106 
+00107 class Chrom: public EO<phenotype>, public genotype
+00108 {
+00109 public:
+00110   Chrom(): genotype(in, out, vector<unsigned>(hidden < 1 ? 0 : 1, hidden)) {}
+00111 
+00112   string className() const { return "Chrom"; }
+00113 
+00114   void printOn (ostream& os) const 
+00115   { 
+00116     os << setprecision(3) << static_cast<genotype>(*this) << "  \t" 
+00117        << fitness(); 
+00118     // os << fitness();
+00119   }
+00120   
+00121   void readFrom (istream& is) 
+00122   {
+00123     invalidate(); // complete me
+00124   }
+00125 };
+00126 
+00127 //-----------------------------------------------------------------------------
+00128 // eoChromInit
+00129 //-----------------------------------------------------------------------------
+00130 
+00131 class eoInitChrom: public eoInit<Chrom>
+00132 {
+00133 public:
+00134   void operator()(Chrom& chrom)
+00135   {
+00136     chrom.reset();
+00137     chrom.invalidate();
+00138   }
+00139 };
+00140 
+00141 //-----------------------------------------------------------------------------
+00142 // global variables
+00143 //-----------------------------------------------------------------------------
+00144 
+00145 mlp::set *trn_set = 0, *val_set = 0, *tst_set = 0;
+00146 
+00147 void gprop_use_datasets(mlp::set *trn, mlp::set *val, mlp::set *tst) {
+00148    trn_set = trn;
+00149    val_set = val;
+00150    tst_set = tst;
+00151 }
+00152 
+00153 void ensure_datasets_initialized() {
+00154     if (!trn_set) {
+00155         cerr << "trn_set is not initialized.  Must call gprop_use_datasets before training\n";
+00156         cerr.flush();
+00157         abort();
+00158     }
+00159 }
+00160 
+00161 //-----------------------------------------------------------------------------
+00162 // eoChromMutation
+00163 //-----------------------------------------------------------------------------
+00164 
+00165 class eoChromMutation: public eoMonOp<Chrom>
+00166 {
+00167 public:
+00168   bool operator()(Chrom& chrom)
+00169   {
+00170     mse::net tmp(chrom);
+00171     tmp.train(*trn_set, 10, 0, 0.001);
+00172     return true;
+00173   }
+00174 };
+00175 
+00176 //-----------------------------------------------------------------------------
+00177 // eoChromXover
+00178 //-----------------------------------------------------------------------------
+00179 
+00180 class eoChromXover: public eoQuadOp<Chrom>
+00181 {
+00182 public:
+00183   bool operator()(Chrom& chrom1, Chrom& chrom2)
+00184   {
+00185     chrom1.normalize();
+00186     chrom2.desaturate();
+00187 
+00188     mse::net tmp1(chrom1), tmp2(chrom2);
+00189     ensure_datasets_initialized();
+00190     tmp1.train(*trn_set, 100, 0, 0.001);
+00191     tmp2.train(*trn_set, 100, 0, 0.001);
+00192 
+00193     return true;
+00194   }
+00195 };
+00196 
+00197 //-----------------------------------------------------------------------------
+00198 // eoChromEvaluator
+00199 //-----------------------------------------------------------------------------
+00200 
+00201 int correct(const mlp::net& net, const mlp::set& set)
+00202 {
+00203   int sum = 0;
+00204   
+00205   for (mlp::set::const_iterator s = set.begin(); s != set.end(); ++s)
+00206     {
+00207       unsigned partial = 0;
+00208       
+00209       for (unsigned i = 0; i < s->output.size(); ++i)
+00210         if (s->output[i] < 0.5 && net(s->input)[i] < 0.5 ||
+00211             s->output[i] > 0.5 && net(s->input)[i] > 0.5)
+00212           ++partial;
+00213       
+00214       if (partial == s->output.size())
+00215         ++sum;
+00216     }
+00217 
+00218   return sum;
+00219 }
+00220 
+00221 phenotype eoChromEvaluator(const Chrom& chrom)
+00222 {
+00223   phenotype p;
+00224   ensure_datasets_initialized();
+00225   p.trn_ok = correct(chrom, *trn_set);
+00226   p.val_ok = correct(chrom, *val_set);
+00227   p.tst_ok = correct(chrom, *tst_set);
+00228   p.mse_error = mse::error(chrom, *val_set);
+00229 
+00230   return p;
+00231 };
+00232 
+00233 //-----------------------------------------------------------------------------
+00234 
+00235 #endif // gprop_h
+00236 
+00237 // Local Variables: 
+00238 // mode:C++ 
+00239 // End:
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/group___evolution_strategies.html b/trunk/paradiseo-eo/doc/html/group___evolution_strategies.html new file mode 100644 index 000000000..7bcebee78 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/group___evolution_strategies.html @@ -0,0 +1,41 @@ + + +EO: EvolutionStrategies + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

EvolutionStrategies

+ + + + + + + + + + + + + + + + + + + + + + + + + + +

Classes

class  eoEsChromInit< EOT >
 Random Es-chromosome initializer (therefore derived from eoInit). More...
class  eoEsFull< Fit >
 The most complex evolutionary strategy representation. More...
class  eoEsMutate< EOT >
 ES-style mutation in the large. More...
class  eoEsMutationInit
 Initialize Mutation operator. More...
class  eoEsSimple< Fit >
 Simple Evolution Strategy. More...
class  eoEsStdev< Fit >
 Evolutionary Strategy with a standard deviation per parameter. More...
class  eoIntBounds
 Defines bound classes for real numbers. More...
class  eoRealBounds
 Defines bound classes for real numbers. More...
+
Generated on Thu Oct 19 05:07:01 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/group___operators.html b/trunk/paradiseo-eo/doc/html/group___operators.html new file mode 100644 index 000000000..98c26319f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/group___operators.html @@ -0,0 +1,17 @@ + + +EO: Operators + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

Operators

Genetic Operators are used for various purposes. +More... + +
+
Generated on Thu Oct 19 05:07:01 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/group___parse_tree.html b/trunk/paradiseo-eo/doc/html/group___parse_tree.html new file mode 100644 index 000000000..0039db3ec --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/group___parse_tree.html @@ -0,0 +1,116 @@ + + +EO: ParseTree + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

ParseTree

Various functions for tree-based Genetic Programming. +More... + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Classes

class  eoParseTree< FType, Node >
 Implementation of parse-tree for genetic programming. More...
class  eoParseTreeDepthInit< FType, Node >
 eoParseTreeDepthInit : the initializer class for eoParseTree More...
class  eoSubtreeXOver< FType, Node >
 eoSubtreeXOver --> subtree xover More...
class  eoBranchMutation< FType, Node >
 eoBranchMutation --> replace a subtree with a randomly created subtree More...
class  eoPointMutation< FType, Node >
 eoPointMutation --> replace a Node with a Node of the same arity More...
class  eoExpansionMutation< FType, Node >
 eoExpansionMutation --> replace a terminal with a randomly created subtree More...
class  eoCollapseSubtreeMutation< FType, Node >
 eoCollapseSubtree --> replace a subtree with a randomly chosen terminal More...
class  eoHoistMutation< FType, Node >
 eoHoistMutation --> replace the individual with one of its subtree's More...

Functions

template<class FType, class Node>
void eoInitRampedHalfAndHalf (eoPop< eoParseTree< FType, Node > > &pop, unsigned int population_size, unsigned int init_max_depth, std::vector< Node > &initializor)
 A template function for ramped half and half initialization of an eoParseTree population.
+

Detailed Description

+Various functions for tree-based Genetic Programming. +

+

Function Documentation

+

+ + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+template<class FType, class Node>
void eoInitRampedHalfAndHalf ( eoPop< eoParseTree< FType, Node > > &  pop,
unsigned int  population_size,
unsigned int  init_max_depth,
std::vector< Node > &  initializor
) 
+
+ + + + + +
+   + + +

+A template function for ramped half and half initialization of an eoParseTree population. +

+

Parameters:
+ + + + + +
pop the population to be created
population_size the size of the population to be created
init_max_depth the initial maximum tree depth
initializor A std::vector containing the possible nodes
+
+ +

+Definition at line 179 of file eoParseTreeDepthInit.h.

+

Generated on Thu Oct 19 05:07:01 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/group___prop_combined_operators.html b/trunk/paradiseo-eo/doc/html/group___prop_combined_operators.html new file mode 100644 index 000000000..8d4731173 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/group___prop_combined_operators.html @@ -0,0 +1,17 @@ + + +EO: PropCombinedOperators + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

PropCombinedOperators

Combination of same-type Genetic Operators - Proportional choice. +More... + +
+
Generated on Thu Oct 19 05:07:01 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/group___st_parse_tree.html b/trunk/paradiseo-eo/doc/html/group___st_parse_tree.html new file mode 100644 index 000000000..57a088521 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/group___st_parse_tree.html @@ -0,0 +1,40 @@ + + +EO: StParseTree + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

StParseTree

Various functions for strongly typed tree-based Genetic Programming. +More... + + + + + + + + + + + + + + + + + +

Classes

class  eoStParseTreeDepthInit< FType, Node >
 eoStParseTreeDepthInit : the initializer class for strongly typed tree-based genetic programming More...
class  eoStSubtreeXOver< FType, Node >
 eoStSubtreeXOver --> subtree xover for strongly typed tree-based genetic programming More...
class  eoStBranchMutation< FType, Node >
 eoStBranchMutation --> replace a strongly typed subtree with a randomly created strongly typed subtree More...
class  eoStPointMutation< FType, Node >
 eoStPointMutation --> replace a Node with a Node of the same arity and type More...
class  eoStHoistMutation< FType, Node >
 eoStHoistMutation --> replace the individual with one of its strongly typed subtree's More...
+

Detailed Description

+Various functions for strongly typed tree-based Genetic Programming. +

+The StParseTree functions use the same eoParseTree class for the individual but now each node class must have two additional functions.

    +
  • int type(void) which returns the return type of the node
    • +
  • int type(int child) which returns the required type for child 0, 1 or 2
    • +
+Pruning strongly typed trees is not possible at the moment.
Generated on Thu Oct 19 05:07:01 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/group__bitstring.html b/trunk/paradiseo-eo/doc/html/group__bitstring.html new file mode 100644 index 000000000..f3a24abee --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/group__bitstring.html @@ -0,0 +1,57 @@ + + +EO: Bitstring + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

Bitstring

Various functions for a bitstring representation. +More... + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Classes

class  eoBit< FitT >
 Implementation of bitstring chromosome. More...
class  eoBit< FitT >
 Implementation of bitstring chromosome. More...
class  eoBitBitFlip
 eoBitFlip --> changes 1 bit More...
class  eoDetBitFlip< Chrom >
 eoDetBitFlip --> changes exactly k bits More...
class  eoBitMutation< Chrom >
 eoBitMutation --> classical mutation More...
class  eoBitInversion< Chrom >
 eoBitInversion: inverts the bits of the chromosome between an interval More...
class  eoBitNext< Chrom >
 eoBitNext --> next value when bitstring considered as binary value More...
class  eoBitPrev< Chrom >
 eoBitPrev --> previous value when bitstring treated as binary value More...
class  eo1PtBitCrossover
 eo1PtBitXover --> classic 1-point crossover More...
class  eoUBitXover< Chrom >
 eoUBitXover --> classic Uniform crossover More...
class  eoNPtsBitXover< Chrom >
 eoNPtsBitXover --> n-point crossover More...
class  eoBitGxOver< Chrom >
 eoBitGxOver --> Npts crossover when bistd::string considered as a std::string of binary-encoded genes (exchanges genes) Is anybody still using it apart from historians ??? :-) More...
+

Detailed Description

+Various functions for a bitstring representation. +

+

Generated on Thu Oct 19 05:07:01 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/group__selectors.html b/trunk/paradiseo-eo/doc/html/group__selectors.html new file mode 100644 index 000000000..914dd8a42 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/group__selectors.html @@ -0,0 +1,16 @@ + + +EO: Selectors + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

Selectors

+ +
+
Generated on Thu Oct 19 05:07:01 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/hierarchy.html b/trunk/paradiseo-eo/doc/html/hierarchy.html new file mode 100644 index 000000000..7ecdf3e8d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/hierarchy.html @@ -0,0 +1,1323 @@ + + +EO: Hierarchical Index + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

EO Class Hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically: +
Generated on Thu Oct 19 05:06:44 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/index.html b/trunk/paradiseo-eo/doc/html/index.html new file mode 100644 index 000000000..916b351e2 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/index.html @@ -0,0 +1,8 @@ + + +EO + + + + + diff --git a/trunk/paradiseo-eo/doc/html/index_8h-source.html b/trunk/paradiseo-eo/doc/html/index_8h-source.html new file mode 100644 index 000000000..051a5f323 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/index_8h-source.html @@ -0,0 +1,20 @@ + + +EO: index.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

index.h

00001 
+00062 // Local Variables:
+00063 // coding: iso-8859-1
+00064 // mode: C++
+00065 // c-file-style: "Stroustrup"
+00066 // fill-column: 80
+00067 // End:
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/installdox b/trunk/paradiseo-eo/doc/html/installdox new file mode 100755 index 000000000..9b89fe025 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/installdox @@ -0,0 +1,117 @@ +#!/usr/bin/perl + +%subst = ( ); +$quiet = 0; + +if (open(F,"search.cfg")) +{ + $_= ; s/[ \t\n]*$//g ; $subst{"_doc"} = $_; + $_= ; s/[ \t\n]*$//g ; $subst{"_cgi"} = $_; +} + +while ( @ARGV ) { + $_ = shift @ARGV; + if ( s/^-// ) { + if ( /^l(.*)/ ) { + $v = ($1 eq "") ? shift @ARGV : $1; + ($v =~ /\/$/) || ($v .= "/"); + $_ = $v; + if ( /(.+)\@(.+)/ ) { + if ( exists $subst{$1} ) { + $subst{$1} = $2; + } else { + print STDERR "Unknown tag file $1 given with option -l\n"; + &usage(); + } + } else { + print STDERR "Argument $_ is invalid for option -l\n"; + &usage(); + } + } + elsif ( /^q/ ) { + $quiet = 1; + } + elsif ( /^\?|^h/ ) { + &usage(); + } + else { + print STDERR "Illegal option -$_\n"; + &usage(); + } + } + else { + push (@files, $_ ); + } +} + +foreach $sub (keys %subst) +{ + if ( $subst{$sub} eq "" ) + { + print STDERR "No substitute given for tag file `$sub'\n"; + &usage(); + } + elsif ( ! $quiet && $sub ne "_doc" && $sub ne "_cgi" ) + { + print "Substituting $subst{$sub} for each occurence of tag file $sub\n"; + } +} + +if ( ! @files ) { + if (opendir(D,".")) { + foreach $file ( readdir(D) ) { + $match = ".html"; + next if ( $file =~ /^\.\.?$/ ); + ($file =~ /$match/) && (push @files, $file); + ($file =~ "tree.js") && (push @files, $file); + } + closedir(D); + } +} + +if ( ! @files ) { + print STDERR "Warning: No input files given and none found!\n"; +} + +foreach $f (@files) +{ + if ( ! $quiet ) { + print "Editing: $f...\n"; + } + $oldf = $f; + $f .= ".bak"; + unless (rename $oldf,$f) { + print STDERR "Error: cannot rename file $oldf\n"; + exit 1; + } + if (open(F,"<$f")) { + unless (open(G,">$oldf")) { + print STDERR "Error: opening file $oldf for writing\n"; + exit 1; + } + if ($oldf ne "tree.js") { + while () { + s/doxygen\=\"([^ \"\:\t\>\<]*)\:([^ \"\t\>\<]*)\" (href|src)=\"\2/doxygen\=\"$1:$subst{$1}\" \3=\"$subst{$1}/g; + print G "$_"; + } + } + else { + while () { + s/\"([^ \"\:\t\>\<]*)\:([^ \"\t\>\<]*)\", \"\2/\"$1:$subst{$1}\" ,\"$subst{$1}/g; + print G "$_"; + } + } + } + else { + print STDERR "Warning file $f does not exist\n"; + } + unlink $f; +} + +sub usage { + print STDERR "Usage: installdox [options] [html-file [html-file ...]]\n"; + print STDERR "Options:\n"; + print STDERR " -l tagfile\@linkName tag file + URL or directory \n"; + print STDERR " -q Quiet mode\n\n"; + exit 1; +} diff --git a/trunk/paradiseo-eo/doc/html/l2_8h-source.html b/trunk/paradiseo-eo/doc/html/l2_8h-source.html new file mode 100644 index 000000000..0e193466f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/l2_8h-source.html @@ -0,0 +1,155 @@ + + +EO: l2.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+app / gprop
+

l2.h

00001 //-----------------------------------------------------------------------------
+00002 // l2.h
+00003 //-----------------------------------------------------------------------------
+00004 
+00005 #ifndef l2_h
+00006 #define l2_h
+00007 
+00008 //-----------------------------------------------------------------------------
+00009 
+00010 #include <math.h>  // log
+00011 #include <qp.h>    // neuron layer net set
+00012 
+00013 //-----------------------------------------------------------------------------
+00014 
+00015 namespace l2
+00016 {
+00017   //---------------------------------------------------------------------------
+00018   // useful typedefs
+00019   //---------------------------------------------------------------------------
+00020 
+00021   using qp::real;
+00022   using qp::vector;
+00023   using qp::max_real;
+00024   using qp::min_real;
+00025   using qp::set;
+00026   using qp::neuron;
+00027   using qp::layer;
+00028 
+00029   //---------------------------------------------------------------------------
+00030   // error
+00031   //---------------------------------------------------------------------------
+00032   
+00033   real error(const mlp::net& net, const set& ts)
+00034   {
+00035     real error_ = 0.0;
+00036 
+00037     for (set::const_iterator s = ts.begin(); s != ts.end(); ++s)
+00038       {
+00039         vector out = net(s->input);
+00040         
+00041         for (unsigned i = 0; i < out.size(); ++i)
+00042           {
+00043             real target = s->output[i];
+00044             real value = out[i];
+00045             error_ -= target * log(value + min_real) + 
+00046               (1.0 - target) * log(1.0 - value + min_real);
+00047           }
+00048       }
+00049 
+00050     return error_;
+00051   }
+00052 
+00053   //-------------------------------------------------------------------------
+00054   // l2
+00055   //-------------------------------------------------------------------------
+00056   
+00057   class net: public qp::net
+00058   {
+00059   public:
+00060     net(mlp::net& n): qp::net(n) {}
+00061     
+00062     real error(const set& ts)
+00063     {
+00064       real error_ = 0;
+00065       
+00066       for (set::const_iterator s = ts.begin(); s != ts.end(); ++s)
+00067         {
+00068           forward(s->input);
+00069           error_ -= backward(s->input, s->output);
+00070         }
+00071       
+00072       return error_;
+00073     }
+00074     
+00075   private:
+00076     real backward(const vector& input, const vector& output)
+00077     {
+00078       reverse_iterator current_layer = rbegin();
+00079       reverse_iterator backward_layer = current_layer + 1;
+00080       real error_ = 0;
+00081 
+00082       // output layer
+00083       for (unsigned j = 0; j < current_layer->size(); ++j)
+00084         {
+00085           neuron& n = (*current_layer)[j];
+00086           real out = output[j];
+00087           n.ndelta += n.delta = (out - n.out) / 
+00088             (n.out * (1.0 - n.out) + min_real) * n.out * (1.0 - n.out);
+00089 
+00090           if (size() == 1)                                        // monolayer
+00091             n.dxo += n.delta * input;
+00092           else                                                    // multilayer
+00093             for (unsigned k = 0; k < n.dxo.size(); ++k)
+00094               n.dxo[k] += n.delta * (*backward_layer)[k].out;
+00095           
+00096           error_ += out * log(n.out + min_real) + 
+00097             (1.0 - out) * log(1.0 - n.out + min_real);
+00098         }
+00099       
+00100       // hidden layers
+00101       while (++current_layer != rend())
+00102         {
+00103           reverse_iterator forward_layer  = current_layer - 1;
+00104           reverse_iterator backward_layer = current_layer + 1;
+00105           
+00106           for (unsigned j = 0; j < current_layer->size(); ++j)
+00107             {
+00108               neuron& n = (*current_layer)[j];
+00109               real sum = 0; 
+00110               for (unsigned k = 0; k < forward_layer->size(); ++k)
+00111                 {
+00112                   neuron& nf = (*forward_layer)[k];
+00113                   sum += nf.delta * (nf.n->weight[j] + nf.dweight1[j]);
+00114                 }
+00115               n.delta = n.out * (1.0 - n.out) * sum;
+00116               n.ndelta += n.delta;
+00117               
+00118               if (backward_layer == rend())               // first hidden layer
+00119                 n.dxo += n.delta * input;
+00120               else                                     // rest of hidden layers
+00121                 for (unsigned k = 0; k < n.dxo.size(); ++k)
+00122                   n.dxo[k] += n.delta * (*backward_layer)[k].out;
+00123             }
+00124         }
+00125     
+00126       return error_;
+00127     }
+00128   };
+00129   
+00130   //---------------------------------------------------------------------------
+00131   
+00132 } // namespace l2
+00133 
+00134 //-----------------------------------------------------------------------------
+00135 
+00136 #endif // l2_h
+00137 
+00138 // Local Variables: 
+00139 // mode:C++ 
+00140 // End:
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/main.html b/trunk/paradiseo-eo/doc/html/main.html new file mode 100644 index 000000000..51e74df11 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/main.html @@ -0,0 +1,23 @@ + + +EO: Welcome to Evolving Objects + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

Welcome to Evolving Objects

+

+

0.9.4-cvs

+Introduction

+EO is a templates-based, ANSI-C++ compliant evolutionary computation library. It contains classes for almost any kind of evolutionary computation you might come up to - at least for the ones we could think of. It is component-based, so that if you don't find the class you need in it, it is very easy to subclass existing abstract or concrete classes.

+Tutorial

+The best place to learn about the features and approaches of EO is to look at the tutorial.

+Installation

+The installation procedure of the package is detailed in the README file in the top-directory of the source-tree.

+Overall Design

+For an introduction to the design of EO you can look at the slides from a talk at EA 2001 or the corresponding article in Lecture Notes In Computer Science 2310, Selected Papers from the 5th European Conference on Artificial Evolution.
Generated on Thu Oct 19 05:06:33 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/main_8cpp-source.html b/trunk/paradiseo-eo/doc/html/main_8cpp-source.html new file mode 100644 index 000000000..70bddfab9 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/main_8cpp-source.html @@ -0,0 +1,187 @@ + + +EO: main.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+app / gpsymreg
+

main.cpp

00001 /*
+00002     This program is free software; you can redistribute it and/or modify
+00003     it under the terms of the GNU General Public License as published by
+00004     the Free Software Foundation; either version 2 of the License, or
+00005     (at your option) any later version.
+00006 
+00007     This library is distributed in the hope that it will be useful,
+00008     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00009     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00010     Lesser General Public License for more details.
+00011 
+00012     You should have received a copy of the GNU General Public License
+00013     along with this library; if not, write to the Free Software
+00014     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00015 
+00016     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00017              jeggermo@liacs.nl
+00018 */
+00019 
+00020 #ifdef _MSC_VER
+00021 #pragma warning(disable:4786)
+00022 #endif
+00023 
+00024 #ifdef HAVE_CONFIG_H
+00025 #include <config.h>
+00026 #endif
+00027 
+00028 #include <iostream>
+00029 #include "gp/eoParseTree.h"
+00030 #include "eo"
+00031 
+00032 using namespace gp_parse_tree;
+00033 using namespace std;
+00034 
+00035 //-----------------------------------------------------------------------------
+00036 
+00037 #include "node.h"
+00038 #include "parameters.h"
+00039 #include "fitness.h"
+00040 
+00041 
+00042 // TYPE DECLARATIONS FOR GP
+00043 
+00044 
+00045 typedef eoParseTree<FitnessType, Node > EoType;
+00046 typedef eoPop<EoType> Pop;
+00047 
+00048 //-----------------------------------------------------------------------------
+00049 
+00050 int main(int argc, char *argv[])
+00051 {
+00052 
+00053         // the vector containing the possible nodes
+00054         vector<Node> initSequence;
+00055 
+00056         // initialise parameters
+00057         Parameters parameter(argc, argv);
+00058 
+00059         // set the randomseed
+00060         rng.reseed(parameter.randomseed);
+00061 
+00062          // Create a generation counter
+00063         eoValueParam<unsigned> generationCounter(0, "Gen.");
+00064 
+00065         // Create an incrementor (sub-class of eoUpdater). Note that the
+00066         // parameter's value is passed by reference,
+00067         // so every time the incrementer is updated (every generation),
+00068         // the data in generationCounter will change.
+00069         eoIncrementor<unsigned> increment(generationCounter.value());
+00070 
+00071 
+00072         // create an instantiation of the fitness/evaluation function
+00073         // it initializes the initSequence vector
+00074         // the parameters are passed on as well
+00075         RegFitness eval(generationCounter, initSequence, parameter);
+00076 
+00077         // Depth Initializor, set for Ramped Half and Half Initialization
+00078         eoParseTreeDepthInit<FitnessType, Node> initializer(parameter.InitMaxDepth, initSequence, true, true);
+00079 
+00080         // create the initial population
+00081         Pop pop(parameter.population_size, initializer);
+00082 
+00083         // and evaluate the individuals
+00084         apply<EoType>(eval, pop);
+00085 
+00086         generationCounter.value()++; // set the generationCounter to 1
+00087 
+00088 
+00089         // define X-OVER
+00090 
+00091         eoSubtreeXOver<FitnessType, Node>   xover(parameter.MaxSize);
+00092 
+00093         // define MUTATION
+00094       eoBranchMutation<FitnessType, Node> mutation(initializer, parameter.MaxSize);
+00095 //      eoExpansionMutation<FitnessType, Node> mutation(initializer, parameter.MaxSize);
+00096 //      eoCollapseSubtreeMutation<FitnessType, Node> mutation(initializer, parameter.MaxSize);
+00097 //      eoPointMutation<FitnessType, Node> mutation(initSequence);
+00098 //      eoHoistMutation<FitnessType, Node> mutation;
+00099 
+00100         // The operators are  encapsulated into an eoTRansform object,
+00101         // that performs sequentially crossover and mutation
+00102         eoSGATransform<EoType> transform(xover, parameter.xover_rate, mutation, parameter.mutation_rate);
+00103 
+00104         // The robust tournament selection
+00105         // in our case 5-tournament selection
+00106         eoDetTournamentSelect<EoType> selectOne(parameter.tournamentsize);
+00107         // is now encapsulated in a eoSelectMany
+00108         eoSelectMany<EoType> select(selectOne, parameter.offspring_size, eo_is_an_integer);
+00109 
+00110         // and the generational replacement
+00111         //eoGenerationalReplacement<EoType> replace;
+00112         // or the SteadtState replacment
+00113         //eoSSGAWorseReplacement<EoType> replace;
+00114         // or comma selection
+00115         eoCommaReplacement<EoType> replace;
+00116 
+00117         // Terminators
+00118         eoGenContinue<EoType> term(parameter.nGenerations);
+00119 
+00120         eoCheckPoint<EoType> checkPoint(term);
+00121 
+00122         // STATISTICS
+00123         eoAverageStat<EoType>     avg;
+00124         eoBestFitnessStat<EoType> best;
+00125 
+00126 
+00127         // Add it to the checkpoint,
+00128         // so the counter is updated (here, incremented) every generation
+00129         checkPoint.add(increment);
+00130         checkPoint.add(avg);
+00131         checkPoint.add(best);
+00132 
+00133 #ifdef HAVE_GNUPLOT
+00134         eoGnuplot1DMonitor gnuplotmonitor("gnuplotBestStats");
+00135         gnuplotmonitor.add(generationCounter);
+00136         gnuplotmonitor.add(best);
+00137         // we need to add a empty string variable if we want to seed the second fitness value
+00138         eoValueParam<string> dummy1("", "Smallest Tree Size");
+00139         gnuplotmonitor.add(dummy1);
+00140 
+00141         eoGnuplot1DMonitor gnuplotAvgmonitor("gnuplotAvgStats");
+00142         gnuplotAvgmonitor.add(generationCounter);
+00143         gnuplotAvgmonitor.add(avg);
+00144         // we need to add a empty string variable if we want to seed the second fitness value
+00145         eoValueParam<string> dummy2("", "Average Tree Size");
+00146         gnuplotAvgmonitor.add(dummy2);
+00147 
+00148         checkPoint.add(gnuplotmonitor);
+00149         checkPoint.add(gnuplotAvgmonitor);
+00150 #endif
+00151         // GP Generation
+00152         eoEasyEA<EoType> gp(checkPoint, eval, select, transform, replace);
+00153 
+00154         cout << "Initialization done" << endl;
+00155 
+00156 
+00157         try
+00158         {
+00159                 gp(pop);
+00160         }
+00161         catch (exception& e)
+00162         {
+00163             cout << "exception: " << e.what() << endl;;
+00164             exit(EXIT_FAILURE);
+00165         }
+00166 
+00167         return 1;
+00168 
+00169 };
+00170 
+00171 
+00172 
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make___my_struct_8cpp-source.html b/trunk/paradiseo-eo/doc/html/make___my_struct_8cpp-source.html new file mode 100644 index 000000000..b0b85aa5c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make___my_struct_8cpp-source.html @@ -0,0 +1,137 @@ + + +EO: make_MyStruct.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Templates
+

make_MyStruct.cpp

00001 
+00006 /*
+00007 Template for creating a new representation in EO
+00008 ================================================
+00009 
+00010 This is the template file that allows separate compilation of
+00011 everything that is representation independant (evolution engine and
+00012 general output) for an Evolutionary Algorithm with scalar fitness.
+00013 
+00014 It includes of course the definition of the genotype (eoMyStruct.h) and
+00015 is written like the make_xxx.cpp files in dirs src/ga (for bitstrings)
+00016 and src/es (for real vectors).
+00017 
+00018 */
+00019 
+00020 // Miscilaneous include and declaration 
+00021 #include <iostream>
+00022 using namespace std;
+00023 
+00024 // eo general include
+00025 #include "eo"
+00026 // the real bounds (not yet in general eo include)
+00027 #include "utils/eoRealVectorBounds.h"
+00028 
+00029 // include here whatever specific files for your representation
+00030 // Basically, this should include at least the following
+00031 
+00035 #include "eoMyStruct.h"
+00036 
+00037 // create an initializer: this is NOT representation-independent
+00038 // and will be done in the main file
+00039 // However, should you decide to freeze that part, you could use the
+00040 // following (and remove it from the main file, of course!!!)
+00041 //------------------------------------------------------------------
+00042 // #include "make_genotype_MyStruct.h"
+00043 // eoInit<eoMyStruct<double>> & make_genotype(eoParser& _parser, eoState&_state, eoMyStruct<double> _eo)
+00044 // {
+00045 //   return do_make_genotype(_parser, _state, _eo);
+00046 // } 
+00047 
+00048 // eoInit<eoMyStruct<eoMinimizingFitness>> & make_genotype(eoParser& _parser, eoState&_state, eoMyStruct<eoMinimizingFitness> _eo)
+00049 // {
+00050 //   return do_make_genotype(_parser, _state, _eo);
+00051 // } 
+00052 
+00053 // same thing for the variation operaotrs
+00054 //---------------------------------------
+00055 // #include "make_op_MyStruct.h"
+00056 // eoGenOp<eoMyStruct<double>>&  make_op(eoParser& _parser, eoState& _state, eoInit<eoMyStruct<double>>& _init)
+00057 // {
+00058 //   return do_make_op(_parser, _state, _init);
+00059 // }
+00060 
+00061 // eoGenOp<eoMyStruct<eoMinimizingFitness>>&  make_op(eoParser& _parser, eoState& _state, eoInit<eoMyStruct<eoMinimizingFitness>>& _init)
+00062 // {
+00063 //   return do_make_op(_parser, _state, _init);
+00064 // }
+00065 
+00066 // The following modules use ***representation independent*** routines
+00067 
+00068 // how to initialize the population 
+00069 // it IS representation independent if an eoInit is given
+00070 #include <do/make_pop.h>
+00071 eoPop<eoMyStruct<double> >&  make_pop(eoParser& _parser, eoState& _state, eoInit<eoMyStruct<double> > & _init)
+00072 {
+00073   return do_make_pop(_parser, _state, _init);
+00074 }
+00075 
+00076 eoPop<eoMyStruct<eoMinimizingFitness> >&  make_pop(eoParser& _parser, eoState& _state, eoInit<eoMyStruct<eoMinimizingFitness> > & _init)
+00077 {
+00078   return do_make_pop(_parser, _state, _init);
+00079 }
+00080 
+00081 // the stopping criterion
+00082 #include <do/make_continue.h>
+00083 eoContinue<eoMyStruct<double> >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoMyStruct<double> > & _eval)
+00084 {
+00085   return do_make_continue(_parser, _state, _eval);
+00086 }
+00087 
+00088 eoContinue<eoMyStruct<eoMinimizingFitness> >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoMyStruct<eoMinimizingFitness> > & _eval)
+00089 {
+00090   return do_make_continue(_parser, _state, _eval);
+00091 }
+00092 
+00093 // outputs (stats, population dumps, ...)
+00094 #include <do/make_checkpoint.h>
+00095 eoCheckPoint<eoMyStruct<double> >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoMyStruct<double> >& _eval, eoContinue<eoMyStruct<double> >& _continue) 
+00096 {
+00097   return do_make_checkpoint(_parser, _state, _eval, _continue);
+00098 }
+00099 
+00100 eoCheckPoint<eoMyStruct<eoMinimizingFitness> >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoMyStruct<eoMinimizingFitness> >& _eval, eoContinue<eoMyStruct<eoMinimizingFitness> >& _continue) 
+00101 {
+00102   return do_make_checkpoint(_parser, _state, _eval, _continue);
+00103 }
+00104 
+00105 // evolution engine (selection and replacement)
+00106 #include <do/make_algo_scalar.h>
+00107 eoAlgo<eoMyStruct<double> >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<eoMyStruct<double> >& _eval, eoContinue<eoMyStruct<double> >& _continue, eoGenOp<eoMyStruct<double> >& _op)
+00108 {
+00109   return do_make_algo_scalar(_parser, _state, _eval, _continue, _op);
+00110 }
+00111 
+00112 eoAlgo<eoMyStruct<eoMinimizingFitness> >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<eoMyStruct<eoMinimizingFitness> >& _eval, eoContinue<eoMyStruct<eoMinimizingFitness> >& _continue, eoGenOp<eoMyStruct<eoMinimizingFitness> >& _op)
+00113 {
+00114   return do_make_algo_scalar(_parser, _state, _eval, _continue, _op);
+00115 }
+00116 
+00117 // simple call to the algo. stays there for consistency reasons 
+00118 // no template for that one
+00119 #include <do/make_run.h>
+00120 void run_ea(eoAlgo<eoMyStruct<double> >& _ga, eoPop<eoMyStruct<double> >& _pop)
+00121 {
+00122   do_run(_ga, _pop);
+00123 }
+00124 
+00125 void run_ea(eoAlgo<eoMyStruct<eoMinimizingFitness> >& _ga, eoPop<eoMyStruct<eoMinimizingFitness> >& _pop)
+00126 {
+00127   do_run(_ga, _pop);
+00128 }
+00129 
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make___one_max_8cpp-source.html b/trunk/paradiseo-eo/doc/html/make___one_max_8cpp-source.html new file mode 100644 index 000000000..dad3eb866 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make___one_max_8cpp-source.html @@ -0,0 +1,137 @@ + + +EO: make_OneMax.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Lesson5
+

make_OneMax.cpp

00001 
+00006 /*
+00007 Template for creating a new representation in EO
+00008 ================================================
+00009 
+00010 This is the template file that llows separate compilation of
+00011 everything that is representation independant (evolution engine and
+00012 general output) for an Evolutionary Algorithm with scalar fitness.
+00013 
+00014 It includes of course the definition of the genotype (eoOneMax.h) and
+00015 is written like the make_xxx.cpp files in dirs src/ga (for bitstrings)
+00016 and src/es (for real vectors).
+00017 
+00018 */
+00019 
+00020 // Miscilaneous include and declaration 
+00021 #include <iostream>
+00022 using namespace std;
+00023 
+00024 // eo general include
+00025 #include "eo"
+00026 // the real bounds (not yet in general eo include)
+00027 #include "utils/eoRealVectorBounds.h"
+00028 
+00029 // include here whatever specific files for your representation
+00030 // Basically, this should include at least the following
+00031 
+00035 #include "eoOneMax.h"
+00036 
+00037 // create an initializer: this is NOT representation-independent
+00038 // and will be done in the main file
+00039 // However, should you decide to freeze that part, you could use the
+00040 // following (and remove it from the main file, of course!!!)
+00041 //------------------------------------------------------------------
+00042 // #include "make_genotype_OneMax.h"
+00043 // eoInit<eoOneMax<double>> & make_genotype(eoParser& _parser, eoState&_state, eoOneMax<double> _eo)
+00044 // {
+00045 //   return do_make_genotype(_parser, _state, _eo);
+00046 // } 
+00047 
+00048 // eoInit<eoOneMax<eoMinimizingFitness>> & make_genotype(eoParser& _parser, eoState&_state, eoOneMax<eoMinimizingFitness> _eo)
+00049 // {
+00050 //   return do_make_genotype(_parser, _state, _eo);
+00051 // } 
+00052 
+00053 // same thing for the variation operaotrs
+00054 //---------------------------------------
+00055 // #include "make_op_OneMax.h"
+00056 // eoGenOp<eoOneMax<double>>&  make_op(eoParser& _parser, eoState& _state, eoInit<eoOneMax<double>>& _init)
+00057 // {
+00058 //   return do_make_op(_parser, _state, _init);
+00059 // }
+00060 
+00061 // eoGenOp<eoOneMax<eoMinimizingFitness>>&  make_op(eoParser& _parser, eoState& _state, eoInit<eoOneMax<eoMinimizingFitness>>& _init)
+00062 // {
+00063 //   return do_make_op(_parser, _state, _init);
+00064 // }
+00065 
+00066 // The following modules use ***representation independent*** routines
+00067 
+00068 // how to initialize the population 
+00069 // it IS representation independent if an eoInit is given
+00070 #include <do/make_pop.h>
+00071 eoPop<eoOneMax<double> >&  make_pop(eoParser& _parser, eoState& _state, eoInit<eoOneMax<double> > & _init)
+00072 {
+00073   return do_make_pop(_parser, _state, _init);
+00074 }
+00075 
+00076 eoPop<eoOneMax<eoMinimizingFitness> >&  make_pop(eoParser& _parser, eoState& _state, eoInit<eoOneMax<eoMinimizingFitness> > & _init)
+00077 {
+00078   return do_make_pop(_parser, _state, _init);
+00079 }
+00080 
+00081 // the stopping criterion
+00082 #include <do/make_continue.h>
+00083 eoContinue<eoOneMax<double> >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoOneMax<double> > & _eval)
+00084 {
+00085   return do_make_continue(_parser, _state, _eval);
+00086 }
+00087 
+00088 eoContinue<eoOneMax<eoMinimizingFitness> >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoOneMax<eoMinimizingFitness> > & _eval)
+00089 {
+00090   return do_make_continue(_parser, _state, _eval);
+00091 }
+00092 
+00093 // outputs (stats, population dumps, ...)
+00094 #include <do/make_checkpoint.h>
+00095 eoCheckPoint<eoOneMax<double> >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoOneMax<double> >& _eval, eoContinue<eoOneMax<double> >& _continue) 
+00096 {
+00097   return do_make_checkpoint(_parser, _state, _eval, _continue);
+00098 }
+00099 
+00100 eoCheckPoint<eoOneMax<eoMinimizingFitness> >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoOneMax<eoMinimizingFitness> >& _eval, eoContinue<eoOneMax<eoMinimizingFitness> >& _continue) 
+00101 {
+00102   return do_make_checkpoint(_parser, _state, _eval, _continue);
+00103 }
+00104 
+00105 // evolution engine (selection and replacement)
+00106 #include <do/make_algo_scalar.h>
+00107 eoAlgo<eoOneMax<double> >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<eoOneMax<double> >& _eval, eoContinue<eoOneMax<double> >& _continue, eoGenOp<eoOneMax<double> >& _op)
+00108 {
+00109   return do_make_algo_scalar(_parser, _state, _eval, _continue, _op);
+00110 }
+00111 
+00112 eoAlgo<eoOneMax<eoMinimizingFitness> >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<eoOneMax<eoMinimizingFitness> >& _eval, eoContinue<eoOneMax<eoMinimizingFitness> >& _continue, eoGenOp<eoOneMax<eoMinimizingFitness> >& _op)
+00113 {
+00114   return do_make_algo_scalar(_parser, _state, _eval, _continue, _op);
+00115 }
+00116 
+00117 // simple call to the algo. stays there for consistency reasons 
+00118 // no template for that one
+00119 #include <do/make_run.h>
+00120 void run_ea(eoAlgo<eoOneMax<double> >& _ga, eoPop<eoOneMax<double> >& _pop)
+00121 {
+00122   do_run(_ga, _pop);
+00123 }
+00124 
+00125 void run_ea(eoAlgo<eoOneMax<eoMinimizingFitness> >& _ga, eoPop<eoOneMax<eoMinimizingFitness> >& _pop)
+00126 {
+00127   do_run(_ga, _pop);
+00128 }
+00129 
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make___p_b_i_ldistrib_8h-source.html b/trunk/paradiseo-eo/doc/html/make___p_b_i_ldistrib_8h-source.html new file mode 100644 index 000000000..28ee7ea2e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make___p_b_i_ldistrib_8h-source.html @@ -0,0 +1,105 @@ + + +EO: make_PBILdistrib.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / ga
+

make_PBILdistrib.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_PBILdistrib.h
+00005 // (c) Marc Schoenauer, Maarten Keijzer, 2001
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: Marc.Schoenauer@polytechnique.fr
+00022              mkeijzer@dhi.dk
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _make_PBILdistrib_h
+00027 #define _make_PBILdistrib_h
+00028 
+00029 #include <ctime>                   // for time(0) for random seeding
+00030 #include <ga/eoPBILOrg.h>
+00031 #include <utils/eoRNG.h>
+00032 #include <utils/eoParser.h>
+00033 #include <utils/eoState.h>
+00034 
+00035 
+00037 
+00048 template <class EOT>
+00049 eoPBILDistrib<EOT> &  do_make_PBILdistrib(eoParser & _parser, eoState& _state, EOT)
+00050 {
+00051   // First the random seed
+00052     eoValueParam<uint32_t>& seedParam = _parser.createParam(uint32_t(0), "seed", "Random number seed", 'S');
+00053     if (seedParam.value() == 0)
+00054         seedParam.value() = time(0);
+00055 
+00056     // chromosome size:
+00057     unsigned theSize;
+00058     // but it might have been already read in the definition fo the performance
+00059     eoParam* ptParam = _parser.getParamWithLongName(std::string("chromSize"));
+00060 
+00061     if (!ptParam)                          // not already defined: read it here
+00062       {
+00063         theSize = _parser.createParam(unsigned(10), "chromSize", "The length of the bitstrings", 'n',"Problem").value();
+00064       }
+00065     else                                   // it was read before, get its value
+00066       {
+00067         eoValueParam<unsigned>* ptChromSize = dynamic_cast<eoValueParam<unsigned>*>(ptParam);
+00068         theSize = ptChromSize->value();
+00069       }
+00070 
+00071     eoPBILDistrib<EOT> * ptDistrib = new eoPBILDistrib<EOT>(theSize);
+00072     _state.storeFunctor(ptDistrib);
+00073 
+00074     // now the initialization: read a previously saved distribution, or random
+00075   eoValueParam<std::string>& loadNameParam = _parser.createParam(std::string(""), "Load","A save file to restart from",'L', "Persistence" );
+00076   if (loadNameParam.value() != "") // something to load
+00077     {
+00078       // create another state for reading
+00079       eoState inState;          // a state for loading - WITHOUT the parser
+00080       // register the rng and the distribution in the state,
+00081       // so they can be loaded,
+00082       // and the present run will be the exact continuation of the saved run
+00083       // eventually with different parameters
+00084       inState.registerObject(*ptDistrib);
+00085       inState.registerObject(rng);
+00086       inState.load(loadNameParam.value()); //  load the distrib and the rng
+00087     }
+00088   else                          // nothing loaded from a file
+00089     {
+00090       rng.reseed(seedParam.value());
+00091     }
+00092 
+00093   // for future stateSave, register the algorithm into the state
+00094    _state.registerObject(_parser);
+00095    _state.registerObject(*ptDistrib);
+00096    _state.registerObject(rng);
+00097 
+00098   return *ptDistrib;
+00099 }
+00100 
+00101 #endif
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make___p_b_i_lupdate_8h-source.html b/trunk/paradiseo-eo/doc/html/make___p_b_i_lupdate_8h-source.html new file mode 100644 index 000000000..7e4fd3527 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make___p_b_i_lupdate_8h-source.html @@ -0,0 +1,83 @@ + + +EO: make_PBILupdate.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / ga
+

make_PBILupdate.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_PBILupdate.h
+00005 // (c) Marc Schoenauer, Maarten Keijzer, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: Marc.Schoenauer@polytechnique.fr
+00022              mkeijzer@dhi.dk
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #ifndef _make_PBILupdate_h
+00027 #define _make_PBILupdate_h
+00028 
+00029 #include <ga/eoPBILOrg.h>
+00030 #include <utils/eoRNG.h>
+00031 #include <utils/eoParser.h>
+00032 #include <utils/eoState.h>
+00033 
+00034 
+00036 
+00047 template <class EOT>
+00048 eoDistribUpdater<EOT> &  do_make_PBILupdate(eoParser & _parser, eoState& _state, EOT)
+00049 {
+00050   // ast the moment, a single update rule is available 
+00051   // but at some point we'll have to choose among different rules
+00052 
+00053     std::string UType = _parser.createParam(std::string("PBIL"), "updateRule", "Type of update rule (only PBIL additive at the moment)", 'U', "Algorithm").value();
+00054 
+00055   unsigned nbBest = _parser.createParam(unsigned(1), "nbBest", "Number of good guys to update from", 'B', "Algorithm").value();
+00056     double LRBest = _parser.createParam(0.1, "LRBest", "Learning Rate (from best guys)", 'L', "Algorithm").value();
+00057   unsigned nbWorst = _parser.createParam(unsigned(0), "nbWorst", "Number of bad guys to update from", 'W', "Algorithm").value();
+00058     double LRWorst = _parser.createParam(0.01, "LRWorst", "Learning Rate (from best guys)", 'L', "Algorithm").value();
+00059     double tolerance = _parser.createParam(0.0, "tolerance", "Keeping away from 0 and 1", 't', "Algorithm").value();
+00060 
+00061     // a pointer to choose among several possible types
+00062   eoDistribUpdater<EOT> * ptUpdate; 
+00063 
+00064   if (UType == std::string("PBIL"))
+00065     {
+00066     if ( (nbWorst == 0) && (nbBest == 1) )
+00067       ptUpdate = new eoPBILOrg<EOT>(LRBest, tolerance);
+00068     else
+00069       ptUpdate = new eoPBILAdditive<EOT>(LRBest, nbBest, tolerance, LRWorst, nbWorst);
+00070     }
+00071   else
+00072     throw std::runtime_error("Only PBIL additive update rule available at the moment");
+00073 
+00074   // done: don't forget to store the allocated pointers
+00075   _state.storeFunctor(ptUpdate); 
+00076   return *ptUpdate;
+00077 }
+00078 
+00079 #endif
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__algo__easea_8h-source.html b/trunk/paradiseo-eo/doc/html/make__algo__easea_8h-source.html new file mode 100644 index 000000000..3d2e2c4a2 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__algo__easea_8h-source.html @@ -0,0 +1,349 @@ + + +EO: make_algo_easea.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / do
+

make_algo_easea.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_algo_easea.h
+00005 // (c) Marc Schoenauer and Pierre Collet, 2002
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: Pierre.Collet@polytechnique.fr
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _make_algo_easea_h
+00028 #define _make_algo_easea_h
+00029 
+00030 #include <utils/eoData.h>     // for eo_is_a_rate
+00031 // everything tha's needed for the algorithms - SCALAR fitness
+00032 
+00033 // Selection
+00034 // the eoSelectOne's
+00035 #include <eoRandomSelect.h>
+00036 #include <eoSequentialSelect.h>
+00037 #include <eoDetTournamentSelect.h>
+00038 #include <eoProportionalSelect.h>
+00039 #include <eoFitnessScalingSelect.h>
+00040 #include <eoRankingSelect.h>
+00041 #include <eoStochTournamentSelect.h>
+00042 // #include <eoSelect.h>    included in all others
+00043 
+00044 // Breeders
+00045 #include <eoGeneralBreeder.h>
+00046 
+00047 // Replacement
+00048 #include "make_general_replacement.h"
+00049 #include "eoMGGReplacement.h"
+00050 #include "eoG3Replacement.h"
+00051 
+00052 
+00053 // Algorithm (only this one needed)
+00054 #include <eoEasyEA.h>
+00055 
+00056   // also need the parser and param includes
+00057 #include <utils/eoParser.h>
+00058 #include <utils/eoState.h>
+00059 
+00060 
+00061 /*
+00062  * This function builds the algorithm (i.e. selection and replacement)
+00063  *      from existing continue (or checkpoint) and operators
+00064  *
+00065  * It uses a parser (to get user parameters) and a state (to store the memory)
+00066  * the last argument is an individual, needed for 2 reasons
+00067  *     it disambiguates the call after instanciations
+00068  *     some operator might need some private information about the indis
+00069  *
+00070  * This is why the template is the complete EOT even though only the fitness
+00071  * is actually templatized here
+00072 */
+00073 
+00074 template <class EOT>
+00075 eoAlgo<EOT> & do_make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<EOT>& _eval, eoContinue<EOT>& _continue, eoGenOp<EOT>& _op)
+00076 {
+00077   // the selection
+00078   eoValueParam<eoParamParamType>& selectionParam = _parser.createParam(eoParamParamType("DetTour(2)"), "selection", "Selection: Roulette, Ranking(p,e), DetTour(T), StochTour(t), Sequential(ordered/unordered) or EliteSequentialSelect", 'S', "Evolution Engine");
+00079 
+00080   eoParamParamType & ppSelect = selectionParam.value(); // std::pair<std::string,std::vector<std::string> >
+00081 
+00082   eoSelectOne<EOT>* select ;
+00083   if (ppSelect.first == std::string("DetTour")) 
+00084   {
+00085     unsigned detSize;
+00086 
+00087     if (!ppSelect.second.size())   // no parameter added
+00088       {
+00089         std::cerr << "WARNING, no parameter passed to DetTour, using 2" << std::endl;
+00090         detSize = 2;
+00091         // put back 2 in parameter for consistency (and status file)
+00092         ppSelect.second.push_back(std::string("2"));
+00093       }
+00094     else          // parameter passed by user as DetTour(T)
+00095       detSize = atoi(ppSelect.second[0].c_str());
+00096     select = new eoDetTournamentSelect<EOT>(detSize);
+00097   }
+00098   else if (ppSelect.first == std::string("StochTour"))
+00099     {
+00100       double p;
+00101       if (!ppSelect.second.size())   // no parameter added
+00102         {
+00103           std::cerr << "WARNING, no parameter passed to StochTour, using 1" << std::endl;
+00104           p = 1;
+00105           // put back p in parameter for consistency (and status file)
+00106           ppSelect.second.push_back(std::string("1"));
+00107         }
+00108       else        // parameter passed by user as DetTour(T)
+00109         p = atof(ppSelect.second[0].c_str());
+00110       
+00111       select = new eoStochTournamentSelect<EOT>(p);
+00112     }
+00113   else if (ppSelect.first == std::string("Ranking"))
+00114     {
+00115       double p,e;
+00116       if (ppSelect.second.size()==2)   // 2 parameters: pressure and exponent
+00117         {
+00118           p = atof(ppSelect.second[0].c_str());
+00119           e = atof(ppSelect.second[1].c_str());
+00120         }
+00121       else if (ppSelect.second.size()==1)   // 1 parameter: pressure 
+00122         {
+00123           std::cerr << "WARNING, no exponent to Ranking, using 1" << std::endl;
+00124           e = 1;
+00125           ppSelect.second.push_back(std::string("1"));
+00126           p = atof(ppSelect.second[0].c_str());
+00127         }
+00128       else // no parameters ... or garbage
+00129         {
+00130           std::cerr << "WARNING, no parameter to Ranking, using (2,1)" << std::endl;
+00131           p=2;
+00132           e=1;
+00133           // put back in parameter for consistency (and status file)
+00134           ppSelect.second.resize(2); // just in case
+00135           ppSelect.second[0] = (std::string("2"));
+00136           ppSelect.second[1] = (std::string("1"));
+00137         }
+00138       // check for authorized values
+00139       // pressure in (0,1]
+00140       if ( (p<=1) || (p>2) )
+00141         {
+00142           std::cerr << "WARNING, selective pressure must be in (1,2] in Ranking, using 2\n";
+00143           p=2;
+00144           ppSelect.second[0] = (std::string("2"));
+00145         }
+00146       // exponent >0
+00147       if (e<=0)
+00148         {
+00149           std::cerr << "WARNING, exponent must be positive in Ranking, using 1\n";
+00150           e=1;
+00151           ppSelect.second[1] = (std::string("1"));
+00152         }
+00153       // now we're OK
+00154       eoPerf2Worth<EOT> & p2w = _state.storeFunctor( new eoRanking<EOT>(p,e) );
+00155       select = new eoRouletteWorthSelect<EOT>(p2w);
+00156     }
+00157   else if (ppSelect.first == std::string("Sequential")) // one after the other
+00158     {
+00159       bool b;
+00160       if (ppSelect.second.size() == 0)   // no argument -> default = ordered
+00161         {
+00162           b=true;
+00163           // put back in parameter for consistency (and status file)
+00164           ppSelect.second.push_back(std::string("ordered"));
+00165         }
+00166       else
+00167         b = !(ppSelect.second[0] == std::string("unordered"));
+00168       select = new eoSequentialSelect<EOT>(b);
+00169     }
+00170   else if (ppSelect.first == std::string("EliteSequential")) // Best first, one after the other in random order afterwards
+00171     {
+00172       select = new eoEliteSequentialSelect<EOT>;
+00173     }
+00174   else if (ppSelect.first == std::string("Roulette")) // no argument (yet)
+00175     {
+00176       select = new eoProportionalSelect<EOT>;
+00177     }
+00178   else if (ppSelect.first == std::string("Random")) // no argument
+00179     {
+00180       select = new eoRandomSelect<EOT>;
+00181     }
+00182   else
+00183     {
+00184       std::string stmp = std::string("Invalid selection: ") + ppSelect.first;
+00185       throw std::runtime_error(stmp.c_str());
+00186     }
+00187 
+00188   _state.storeFunctor(select);
+00189 
+00190   // the number of offspring 
+00191     eoValueParam<eoHowMany>& offspringRateParam =  _parser.createParam(eoHowMany(1.0), "nbOffspring", "Nb of offspring (percentage or absolute)", 'O', "Evolution Engine");
+00192 
+00194   // the replacement
+00196 
+00225   eoParamParamType & replacementParam = _parser.createParam(eoParamParamType("General"), "replacement", "Type of replacement: General, or Generational, ESComma, ESPlus, SSGA(T), EP(T), G3, MGG(T)", '\0', "Evolution Engine").value();
+00226   // the pointer
+00227   eoReplacement<EOT> * ptReplace;
+00228 
+00229   // first, separate G3 and MGG
+00230   // maybe one day we have a common class - but is it really necessary???
+00231   if (replacementParam.first == std::string("G3"))
+00232     {
+00233     // reduce the parents: by default, survive parents = -2 === 2 parents die
+00234     eoHowMany surviveParents =  _parser.createParam(eoHowMany(-2,false), "surviveParents", "Nb of surviving parents (percentage or absolute)", '\0', "Evolution Engine / Replacement").value();
+00235     // at the moment, this is the only argument
+00236     ptReplace = new eoG3Replacement<EOT>(-surviveParents);    // must receive nb of eliminated parets!
+00237     _state.storeFunctor(ptReplace);
+00238     }
+00239   else  if (replacementParam.first == std::string("MGG"))
+00240     {
+00241       float t;
+00242       unsigned tSize;
+00243     // reduce the parents: by default, survive parents = -2 === 2 parents die
+00244     eoHowMany surviveParents =  _parser.createParam(eoHowMany(-2,false), "surviveParents", "Nb of surviving parents (percentage or absolute)", '\0', "Evolution Engine / Replacement").value();
+00245     // the tournament size
+00246     if (!replacementParam.second.size())   // no parameter added
+00247       {
+00248         std::cerr << "WARNING, no parameter passed to MGG replacement, using 2" << std::endl;
+00249         tSize = 2;
+00250         // put back 2 in parameter for consistency (and status file)
+00251         replacementParam.second.push_back(std::string("2"));
+00252       }
+00253     else
+00254       {
+00255         t = atof(replacementParam.second[0].c_str());
+00256         if (t>=2)
+00257           {                        // build the appropriate deafult value
+00258             tSize = unsigned(t);
+00259           }
+00260         else
+00261           {
+00262             throw std::runtime_error("Sorry, only deterministic tournament available at the moment");
+00263           }
+00264       }
+00265     ptReplace = new eoMGGReplacement<EOT>(-surviveParents, tSize);    
+00266     _state.storeFunctor(ptReplace);
+00267     }
+00268   else {   // until the end of what was the only loop/switch
+00269     
+00270   // the default deafult values
+00271   eoHowMany elite (0.0);
+00272   bool strongElitism (false);
+00273   eoHowMany surviveParents (0.0);
+00274   eoParamParamType reduceParentType ("Deterministic");
+00275   eoHowMany surviveOffspring (1.0);
+00276   eoParamParamType reduceOffspringType ("Deterministic");
+00277   eoParamParamType reduceFinalType ("Deterministic");
+00278 
+00279   // depending on the value entered by the user, change some of the above
+00280   double t;
+00281 
+00282   // ---------- General
+00283   if (replacementParam.first == std::string("General"))
+00284   {
+00285     ;                              // defaults OK
+00286   }
+00287   // ---------- ESComma
+00288   else if (replacementParam.first == std::string("ESComma"))
+00289   {
+00290     ;                              // OK too
+00291   }
+00292   // ---------- ESPlus
+00293   else if (replacementParam.first == std::string("ESPlus"))
+00294   {
+00295     surviveParents = eoHowMany(1.0);
+00296   }
+00297   // ---------- Generational
+00298   else if (replacementParam.first == std::string("Generational"))
+00299   {
+00300     ;                        // OK too (we should check nb of offspring)
+00301   }
+00302   // ---------- EP
+00303   else if (replacementParam.first == std::string("EP"))
+00304   {
+00305     if (!replacementParam.second.size())   // no parameter added
+00306       {
+00307         std::cerr << "WARNING, no parameter passed to EP replacement, using 6" << std::endl;
+00308         // put back 6 in parameter for consistency (and status file)
+00309         replacementParam.second.push_back(std::string("6"));
+00310       }
+00311     // by coincidence, the syntax for the EP reducer is the same than here:
+00312     reduceFinalType = replacementParam;
+00313     surviveParents = eoHowMany(1.0);
+00314   }
+00315   // ---------- SSGA
+00316   else if (replacementParam.first == std::string("SSGA"))
+00317   {
+00318     if (!replacementParam.second.size())   // no parameter added
+00319       {
+00320         std::cerr << "WARNING, no parameter passed to SSGA replacement, using 2" << std::endl;
+00321         // put back 2 in parameter for consistency (and status file)
+00322         replacementParam.second.push_back(std::string("2"));
+00323         reduceParentType = eoParamParamType(std::string("DetTour(2)"));
+00324       }
+00325     else
+00326       {
+00327         t = atof(replacementParam.second[0].c_str());
+00328         if (t>=2)
+00329           {                        // build the appropriate deafult value
+00330             reduceParentType = eoParamParamType(std::string("DetTour(") + replacementParam.second[0].c_str() + ")");
+00331           }
+00332         else   // check for [0.5,1] will be made in make_general_replacement
+00333           {                        // build the appropriate deafult value
+00334             reduceParentType = eoParamParamType(std::string("StochTour(") + replacementParam.second[0].c_str() + ")");
+00335           }
+00336       }
+00337     // 
+00338     surviveParents = eoHowMany(-1);
+00339     surviveOffspring = eoHowMany(1);
+00340   }
+00341   else                 // no replacement recognized
+00342     {
+00343       throw std::runtime_error("Invalid replacement type " + replacementParam.first);
+00344     }
+00345 
+00346   ptReplace = & make_general_replacement<EOT>(
+00347      _parser, _state, elite, strongElitism, surviveParents, reduceParentType, surviveOffspring, reduceOffspringType, reduceFinalType);
+00348 
+00349   } // end of the ugly construct due to G3 and MGG - totaly heterogeneous at the moment
+00350 
+00351 
+00353   // the general breeder
+00355   eoGeneralBreeder<EOT> *breed = 
+00356     new eoGeneralBreeder<EOT>(*select, _op, offspringRateParam.value());
+00357   _state.storeFunctor(breed);
+00358 
+00360   // now the eoEasyEA
+00362   eoAlgo<EOT> *algo = new eoEasyEA<EOT>(_continue, _eval, *breed, *ptReplace);
+00363   _state.storeFunctor(algo);
+00364   // that's it!
+00365   return *algo;
+00366 }
+00367 
+00368 #endif
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__algo__pareto_8h-source.html b/trunk/paradiseo-eo/doc/html/make__algo__pareto_8h-source.html new file mode 100644 index 000000000..67904eca8 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__algo__pareto_8h-source.html @@ -0,0 +1,218 @@ + + +EO: make_algo_pareto.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / do
+

make_algo_pareto.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_algo_pareto.h
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2002
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@inria.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _make_algo_pareto_h
+00028 #define _make_algo_pareto_h
+00029 
+00030 #include "utils/eoData.h"     // for eo_is_a_rate
+00031 // everything tha's needed for the algorithms - SCALAR fitness
+00032 
+00033 // Selection
+00034 // the eoSelectOne's
+00035 #include "eoSelectFromWorth.h"
+00036 #include "eoNDSorting.h"
+00037 
+00038 // Breeders
+00039 #include "eoGeneralBreeder.h"
+00040 
+00041 // Replacement - at the moment limited to eoNDPlusReplacement, locally defined
+00042 #include "eoReplacement.h"
+00043 
+00044 template <class EOT, class WorthT = double>
+00045 class eoNDPlusReplacement : public eoReplacement<EOT>
+00046 {
+00047 public:
+00048   eoNDPlusReplacement(eoPerf2Worth<EOT, WorthT>& _perf2worth) : perf2worth(_perf2worth) {}
+00049 
+00050   struct WorthPair : public std::pair<WorthT, const EOT*>
+00051   {
+00052     bool operator<(const WorthPair& other) const { return other.first < this->first; }
+00053   };
+00054 
+00055   void operator()(eoPop<EOT>& _parents, eoPop<EOT>& _offspring)
+00056   {
+00057     unsigned sz = _parents.size();
+00058     _parents.reserve(_parents.size() + _offspring.size());
+00059     copy(_offspring.begin(), _offspring.end(), back_inserter(_parents));
+00060 
+00061     // calculate worths
+00062     perf2worth(_parents);
+00063     perf2worth.sort_pop(_parents);
+00064     perf2worth.resize(_parents, sz);
+00065 
+00066     _offspring.clear();
+00067   }
+00068 
+00069 private :
+00070   eoPerf2Worth<EOT, WorthT>& perf2worth;
+00071 };
+00072 
+00073 
+00074 // Algorithm (only this one needed)
+00075 #include "eoEasyEA.h"
+00076 
+00077   // also need the parser and param includes
+00078 #include "utils/eoParser.h"
+00079 #include "utils/eoState.h"
+00080 
+00081 
+00082 /*
+00083  * This function builds the algorithm (i.e. selection and replacement)
+00084  *      from existing continue (or checkpoint) and operators
+00085  *
+00086  * It uses a parser (to get user parameters) and a state (to store the memory)
+00087  * the last argument is an individual, needed for 2 reasons
+00088  *     it disambiguates the call after instanciations
+00089  *     some operator might need some private information about the indis
+00090  *
+00091  * This is why the template is the complete EOT even though only the fitness
+00092  * is actually templatized here
+00093 */
+00094 
+00095 template <class EOT>
+00096 eoAlgo<EOT> & do_make_algo_pareto(eoParser& _parser, eoState& _state, eoEvalFunc<EOT>& _eval, eoContinue<EOT>& _continue, eoGenOp<EOT>& _op)
+00097 {
+00098   // the selection
+00099   std::string & selStr = _parser.createParam(std::string("NSGA-II"), "selCrit", "Pareto Selection Criterion: NSGA, NSGA-II, ParetoRanking", 'S', "Evolution Engine").value();
+00100   double nicheSize = _parser.createParam(1.0, "nicheSize", "Size of niche for NSGA-I", '\0', "Evolution Engine").value();
+00101   eoPerf2Worth<EOT, double> *p2w;
+00102   if ( (selStr == std::string("NSGA")) || (selStr == std::string("NSGA-I") ) )
+00103     p2w = new eoNDSorting_I<EOT>(nicheSize);
+00104   else   if (selStr == std::string("NSGA-II"))
+00105     p2w = new eoNDSorting_II<EOT>();
+00106   else   if (selStr == std::string("ParetoRanking"))
+00107     {
+00108       eoDominanceMap<EOT>&  dominance = _state.storeFunctor(new eoDominanceMap<EOT>);
+00109     p2w = new eoParetoRanking<EOT>(dominance);
+00110     }
+00111 
+00112   _state.storeFunctor(p2w);
+00113 
+00114   // now the selector (from p2w) - cut-and-pasted from make_algo_scalar!
+00115   // only all classes are now ...FromWorth ...
+00116   // only the ranking is not re-implemented (yet?)
+00117   eoValueParam<eoParamParamType>& selectionParam = _parser.createParam(eoParamParamType("DetTour(2)"), "selection", "Selection: Roulette, DetTour(T), StochTour(t) or Random", 'S', "Evolution Engine");
+00118 
+00119   eoParamParamType & ppSelect = selectionParam.value(); // std::pair<std::string,std::vector<std::string> >
+00120 
+00121   eoSelectOne<EOT>* select ;
+00122   if (ppSelect.first == std::string("DetTour")) 
+00123   {
+00124     unsigned detSize;
+00125 
+00126     if (!ppSelect.second.size())   // no parameter added
+00127       {
+00128         std::cerr << "WARNING, no parameter passed to DetTour, using 2" << std::endl;
+00129         detSize = 2;
+00130         // put back 2 in parameter for consistency (and status file)
+00131         ppSelect.second.push_back(std::string("2"));
+00132       }
+00133     else          // parameter passed by user as DetTour(T)
+00134       detSize = atoi(ppSelect.second[0].c_str());
+00135     select = new eoDetTournamentWorthSelect<EOT>(*p2w, detSize);
+00136   }
+00137   else if (ppSelect.first == std::string("StochTour"))
+00138     {
+00139       double p;
+00140       if (!ppSelect.second.size())   // no parameter added
+00141         {
+00142           std::cerr << "WARNING, no parameter passed to StochTour, using 1" << std::endl;
+00143           p = 1;
+00144           // put back p in parameter for consistency (and status file)
+00145           ppSelect.second.push_back(std::string("1"));
+00146         }
+00147       else        // parameter passed by user as DetTour(T)
+00148         p = atof(ppSelect.second[0].c_str());
+00149       
+00150       select = new eoStochTournamentWorthSelect<EOT>(*p2w, p);
+00151     }
+00152 //   else if (ppSelect.first == std::string("Sequential")) // one after the other
+00153 //     {
+00154 //       bool b;
+00155 //       if (ppSelect.second.size() == 0)   // no argument -> default = ordered
+00156 //      {
+00157 //        b=true;
+00158 //        // put back in parameter for consistency (and status file)
+00159 //        ppSelect.second.push_back(std::string("ordered"));
+00160 //      }
+00161 //       else
+00162 //      b = !(ppSelect.second[0] == std::string("unordered"));
+00163 //       select = new eoSequentialWorthSelect<EOT>(b);
+00164 //     }
+00165   else if (ppSelect.first == std::string("Roulette")) // no argument (yet)
+00166     {
+00167       select = new eoRouletteWorthSelect<EOT>(*p2w);
+00168     }
+00169   else if (ppSelect.first == std::string("Random")) // no argument, no perf2Worth
+00170     {
+00171       select = new eoRandomSelect<EOT>;
+00172     }
+00173   else
+00174     {
+00175       std::string stmp = std::string("Invalid selection: ") + ppSelect.first;
+00176       throw std::runtime_error(stmp.c_str());
+00177     }
+00178 
+00179   _state.storeFunctor(select);
+00180 
+00181 
+00182   // the number of offspring 
+00183     eoValueParam<eoHowMany>& offspringRateParam =  _parser.createParam(eoHowMany(1.0), "nbOffspring", "Nb of offspring (percentage or absolute)", 'O', "Evolution Engine");
+00184 
+00185   // the replacement
+00186     // actually limited to eoNDPlusReplacement
+00187   eoReplacement<EOT> & replace = _state.storeFunctor(
+00188            new eoNDPlusReplacement<EOT, double>(*p2w)
+00189            );
+00190 
+00191   // the general breeder
+00192   eoGeneralBreeder<EOT> *breed = 
+00193     new eoGeneralBreeder<EOT>(*select, _op, offspringRateParam.value());
+00194   _state.storeFunctor(breed);
+00195 
+00196   // now the eoEasyEA
+00197   eoAlgo<EOT> *algo = new eoEasyEA<EOT>(_continue, _eval, *breed, replace);
+00198   _state.storeFunctor(algo);
+00199   // that's it!
+00200   return *algo;
+00201 }
+00202 
+00203 #endif
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__algo__scalar_8h-source.html b/trunk/paradiseo-eo/doc/html/make__algo__scalar_8h-source.html new file mode 100644 index 000000000..6b5b1adee --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__algo__scalar_8h-source.html @@ -0,0 +1,326 @@ + + +EO: make_algo_scalar.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / do
+

make_algo_scalar.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_algo_scalar.h
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _make_algo_scalar_h
+00028 #define _make_algo_scalar_h
+00029 
+00030 #include <utils/eoData.h>     // for eo_is_a_rate
+00031 // everything tha's needed for the algorithms - SCALAR fitness
+00032 
+00033 // Selection
+00034 // the eoSelectOne's
+00035 #include <eoRandomSelect.h>
+00036 #include <eoSequentialSelect.h>
+00037 #include <eoDetTournamentSelect.h>
+00038 #include <eoProportionalSelect.h>
+00039 #include <eoFitnessScalingSelect.h>
+00040 #include <eoRankingSelect.h>
+00041 #include <eoStochTournamentSelect.h>
+00042 #include <eoSharingSelect.h>
+00043 #include <utils/eoDistance.h>
+00044 
+00045 // Breeders
+00046 #include <eoGeneralBreeder.h>
+00047 
+00048 // Replacement
+00049 // #include <eoReplacement.h>
+00050 #include <eoMergeReduce.h>
+00051 #include <eoReduceMerge.h>
+00052 #include <eoSurviveAndDie.h>
+00053 
+00054 // distance
+00055 #include <utils/eoDistance.h>
+00056 
+00057 // Algorithm (only this one needed)
+00058 #include <eoEasyEA.h>
+00059 
+00060   // also need the parser and param includes
+00061 #include <utils/eoParser.h>
+00062 #include <utils/eoState.h>
+00063 
+00064 
+00065 /*
+00066  * This function builds the algorithm (i.e. selection and replacement)
+00067  *      from existing continue (or checkpoint) and operators
+00068  *
+00069  * It uses a parser (to get user parameters) and a state (to store the memory)
+00070  * the last argument is an individual, needed for 2 reasons
+00071  *     it disambiguates the call after instanciations
+00072  *     some operator might need some private information about the indis
+00073  *
+00074  * This is why the template is the complete EOT even though only the fitness
+00075  * is actually templatized here
+00076 */
+00077 
+00078 
+00079 template <class EOT>
+00080 eoAlgo<EOT> & do_make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<EOT>& _eval, eoContinue<EOT>& _continue, eoGenOp<EOT>& _op, eoDistance<EOT> * _dist = NULL)
+00081 {
+00082   // the selection : help and comment depend on whether or not a distance is passed
+00083   std::string comment;
+00084   if (_dist == NULL)
+00085     comment = "Selection: DetTour(T), StochTour(t), Roulette, Ranking(p,e) or Sequential(ordered/unordered)";
+00086       else
+00087         comment = "Selection: DetTour(T), StochTour(t), Roulette, Ranking(p,e), Sharing(sigma_share) or Sequential(ordered/unordered)";
+00088 
+00089   eoValueParam<eoParamParamType>& selectionParam = _parser.createParam(eoParamParamType("DetTour(2)"), "selection", comment, 'S', "Evolution Engine");
+00090 
+00091   eoParamParamType & ppSelect = selectionParam.value(); // std::pair<std::string,std::vector<std::string> >
+00092 
+00093   eoSelectOne<EOT>* select ;
+00094   if (ppSelect.first == std::string("DetTour")) 
+00095   {
+00096     unsigned detSize;
+00097 
+00098     if (!ppSelect.second.size())   // no parameter added
+00099       {
+00100         std::cerr << "WARNING, no parameter passed to DetTour, using 2" << std::endl;
+00101         detSize = 2;
+00102         // put back 2 in parameter for consistency (and status file)
+00103         ppSelect.second.push_back(std::string("2"));
+00104       }
+00105     else          // parameter passed by user as DetTour(T)
+00106       detSize = atoi(ppSelect.second[0].c_str());
+00107     select = new eoDetTournamentSelect<EOT>(detSize);
+00108   }
+00109   else if (ppSelect.first == std::string("Sharing")) 
+00110   {
+00111     double nicheSize;
+00112 
+00113     if (!ppSelect.second.size())   // no parameter added
+00114       {
+00115         std::cerr << "WARNING, no parameter passed to Sharing, using 0.5" << std::endl;
+00116         nicheSize = 0.5;
+00117         // put back 2 in parameter for consistency (and status file)
+00118         ppSelect.second.push_back(std::string("0.5"));
+00119       }
+00120     else          // parameter passed by user as DetTour(T)
+00121       nicheSize = atof(ppSelect.second[0].c_str());
+00122     if (_dist == NULL)             // no distance
+00123           throw std::runtime_error("You didn't specify a distance when calling make_algo_scalar and using sharing");
+00124     select = new eoSharingSelect<EOT>(nicheSize, *_dist);
+00125   }
+00126   else if (ppSelect.first == std::string("StochTour"))
+00127     {
+00128       double p;
+00129       if (!ppSelect.second.size())   // no parameter added
+00130         {
+00131           std::cerr << "WARNING, no parameter passed to StochTour, using 1" << std::endl;
+00132           p = 1;
+00133           // put back p in parameter for consistency (and status file)
+00134           ppSelect.second.push_back(std::string("1"));
+00135         }
+00136       else        // parameter passed by user as DetTour(T)
+00137         p = atof(ppSelect.second[0].c_str());
+00138       
+00139       select = new eoStochTournamentSelect<EOT>(p);
+00140     }
+00141   else if (ppSelect.first == std::string("Ranking"))
+00142     {
+00143       double p,e;
+00144       if (ppSelect.second.size()==2)   // 2 parameters: pressure and exponent
+00145         {
+00146           p = atof(ppSelect.second[0].c_str());
+00147           e = atof(ppSelect.second[1].c_str());
+00148         }
+00149       else if (ppSelect.second.size()==1)   // 1 parameter: pressure 
+00150         {
+00151           std::cerr << "WARNING, no exponent to Ranking, using 1" << std::endl;
+00152           e = 1;
+00153           ppSelect.second.push_back(std::string("1"));
+00154           p = atof(ppSelect.second[0].c_str());
+00155         }
+00156       else // no parameters ... or garbage
+00157         {
+00158           std::cerr << "WARNING, no parameter to Ranking, using (2,1)" << std::endl;
+00159           p=2;
+00160           e=1;
+00161           // put back in parameter for consistency (and status file)
+00162           ppSelect.second.resize(2); // just in case
+00163           ppSelect.second[0] = (std::string("2"));
+00164           ppSelect.second[1] = (std::string("1"));
+00165         }
+00166       // check for authorized values
+00167       // pressure in (0,1]
+00168       if ( (p<=1) || (p>2) )
+00169         {
+00170           std::cerr << "WARNING, selective pressure must be in (0,1] in Ranking, using 2\n";
+00171           p=2;
+00172           ppSelect.second[0] = (std::string("2"));
+00173         }
+00174       // exponent >0
+00175       if (e<=0)
+00176         {
+00177           std::cerr << "WARNING, exponent must be positive in Ranking, using 1\n";
+00178           e=1;
+00179           ppSelect.second[1] = (std::string("1"));
+00180         }
+00181       // now we're OK
+00182       eoPerf2Worth<EOT> & p2w = _state.storeFunctor( new eoRanking<EOT>(p,e) );
+00183       select = new eoRouletteWorthSelect<EOT>(p2w);
+00184     }
+00185   else if (ppSelect.first == std::string("Sequential")) // one after the other
+00186     {
+00187       bool b;
+00188       if (ppSelect.second.size() == 0)   // no argument -> default = ordered
+00189         {
+00190           b=true;
+00191           // put back in parameter for consistency (and status file)
+00192           ppSelect.second.push_back(std::string("ordered"));
+00193         }
+00194       else
+00195         b = !(ppSelect.second[0] == std::string("unordered"));
+00196       select = new eoSequentialSelect<EOT>(b);
+00197     }
+00198   else if (ppSelect.first == std::string("Roulette")) // no argument (yet)
+00199     {
+00200       select = new eoProportionalSelect<EOT>;
+00201     }
+00202   else if (ppSelect.first == std::string("Random")) // no argument
+00203     {
+00204       select = new eoRandomSelect<EOT>;
+00205     }
+00206   else
+00207     {
+00208       std::string stmp = std::string("Invalid selection: ") + ppSelect.first;
+00209       throw std::runtime_error(stmp.c_str());
+00210     }
+00211 
+00212   _state.storeFunctor(select);
+00213 
+00214   // the number of offspring 
+00215     eoValueParam<eoHowMany>& offspringRateParam =  _parser.createParam(eoHowMany(1.0), "nbOffspring", "Nb of offspring (percentage or absolute)", 'O', "Evolution Engine");
+00216 
+00217   // the replacement
+00218   eoValueParam<eoParamParamType>& replacementParam = _parser.createParam(eoParamParamType("Comma"), "replacement", "Replacement: Comma, Plus or EPTour(T), SSGAWorst, SSGADet(T), SSGAStoch(t)", 'R', "Evolution Engine");
+00219 
+00220   eoParamParamType & ppReplace = replacementParam.value(); // std::pair<std::string,std::vector<std::string> >
+00221 
+00222   eoReplacement<EOT>* replace ;
+00223   if (ppReplace.first == std::string("Comma")) // Comma == generational
+00224   {
+00225     replace = new eoCommaReplacement<EOT>;
+00226   }
+00227   else if (ppReplace.first == std::string("Plus"))
+00228     {
+00229       replace = new eoPlusReplacement<EOT>;
+00230     }
+00231   else if (ppReplace.first == std::string("EPTour"))
+00232     {
+00233       unsigned detSize;
+00234       
+00235       if (!ppReplace.second.size())   // no parameter added
+00236         {
+00237           std::cerr << "WARNING, no parameter passed to EPTour, using 6" << std::endl;
+00238           detSize = 6;
+00239           // put back in parameter for consistency (and status file)
+00240           ppReplace.second.push_back(std::string("6"));
+00241         }
+00242       else        // parameter passed by user as EPTour(T)
+00243         detSize = atoi(ppSelect.second[0].c_str());
+00244 
+00245       replace = new eoEPReplacement<EOT>(detSize);
+00246     }
+00247   else if (ppReplace.first == std::string("SSGAWorst"))
+00248     {
+00249       replace = new eoSSGAWorseReplacement<EOT>;
+00250     }
+00251   else if (ppReplace.first == std::string("SSGADet"))
+00252     {
+00253       unsigned detSize;
+00254       
+00255       if (!ppReplace.second.size())   // no parameter added
+00256         {
+00257           std::cerr << "WARNING, no parameter passed to SSGADet, using 2" << std::endl;
+00258           detSize = 2;
+00259           // put back in parameter for consistency (and status file)
+00260           ppReplace.second.push_back(std::string("2"));
+00261         }
+00262       else        // parameter passed by user as SSGADet(T)
+00263         detSize = atoi(ppSelect.second[0].c_str());
+00264       
+00265       replace = new eoSSGADetTournamentReplacement<EOT>(detSize);
+00266     }
+00267   else if (ppReplace.first == std::string("SSGAStoch"))
+00268     {
+00269       double p;
+00270       if (!ppReplace.second.size())   // no parameter added
+00271         {
+00272           std::cerr << "WARNING, no parameter passed to SSGAStoch, using 1" << std::endl;
+00273           p = 1;
+00274           // put back in parameter for consistency (and status file)
+00275           ppReplace.second.push_back(std::string("1"));
+00276         }
+00277       else        // parameter passed by user as SSGADet(T)
+00278         p = atof(ppSelect.second[0].c_str());
+00279       
+00280       replace = new eoSSGAStochTournamentReplacement<EOT>(p);
+00281     }
+00282   else
+00283     {
+00284       std::string stmp = std::string("Invalid replacement: ") + ppReplace.first;
+00285       throw std::runtime_error(stmp.c_str());
+00286     }
+00287 
+00288   _state.storeFunctor(replace);
+00289 
+00290   // adding weak elitism
+00291   eoValueParam<bool>& weakElitismParam =  _parser.createParam(false, "weakElitism", "Old best parent replaces new worst offspring *if necessary*", 'w', "Evolution Engine");
+00292   if (weakElitismParam.value())
+00293     {
+00294       eoReplacement<EOT> *replaceTmp = replace;
+00295       replace = new eoWeakElitistReplacement<EOT>(*replaceTmp);
+00296       _state.storeFunctor(replace);
+00297     }      
+00298 
+00299   // the general breeder
+00300   eoGeneralBreeder<EOT> *breed = 
+00301     new eoGeneralBreeder<EOT>(*select, _op, offspringRateParam.value());
+00302   _state.storeFunctor(breed);
+00303 
+00304   // now the eoEasyEA
+00305   eoAlgo<EOT> *algo = new eoEasyEA<EOT>(_continue, _eval, *breed, *replace);
+00306   _state.storeFunctor(algo);
+00307   // that's it!
+00308   return *algo;
+00309 }
+00310 
+00311 #endif
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__algo__scalar__es_8cpp-source.html b/trunk/paradiseo-eo/doc/html/make__algo__scalar__es_8cpp-source.html new file mode 100644 index 000000000..f78562ae0 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__algo__scalar__es_8cpp-source.html @@ -0,0 +1,85 @@ + + +EO: make_algo_scalar_es.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

make_algo_scalar_es.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_algo_scalar_es.cpp
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifdef _MSC_VER
+00028 // to avoid long name warnings
+00029 #pragma warning(disable:4786)
+00030 #endif 
+00031 
+00043 // The templatized code
+00044 #include <do/make_algo_scalar.h>
+00045 // the instanciating EOType(s)
+00046 #include <es/eoEsSimple.h>         // one Sigma per individual
+00047 #include <es/eoEsStdev.h>          // one sigmal per object variable
+00048 #include <es/eoEsFull.h>           // full correlation matrix per indi
+00049 
+00051 
+00052 // Algo
+00054 eoAlgo<eoEsSimple<double> >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<eoEsSimple<double> >& _eval, eoContinue<eoEsSimple<double> >& _continue, eoGenOp<eoEsSimple<double> >& _op, eoDistance<eoEsSimple<double> >* _dist)
+00055 {
+00056     return do_make_algo_scalar(_parser, _state, _eval, _continue, _op);
+00057 }
+00058 
+00059 eoAlgo<eoEsSimple<eoMinimizingFitness> >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<eoEsSimple<eoMinimizingFitness> >& _eval, eoContinue<eoEsSimple<eoMinimizingFitness> >& _continue, eoGenOp<eoEsSimple<eoMinimizingFitness> >& _op, eoDistance<eoEsSimple<eoMinimizingFitness> >* _dist)
+00060 {
+00061   return do_make_algo_scalar(_parser, _state, _eval, _continue, _op);
+00062 }
+00063 
+00065 eoAlgo<eoEsStdev<double> >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<eoEsStdev<double> >& _eval, eoContinue<eoEsStdev<double> >& _continue, eoGenOp<eoEsStdev<double> >& _op, eoDistance<eoEsStdev<double> >* _dist)
+00066 {
+00067   return do_make_algo_scalar(_parser, _state, _eval, _continue, _op);
+00068 }
+00069 
+00070 eoAlgo<eoEsStdev<eoMinimizingFitness> >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<eoEsStdev<eoMinimizingFitness> >& _eval, eoContinue<eoEsStdev<eoMinimizingFitness> >& _continue, eoGenOp<eoEsStdev<eoMinimizingFitness> >& _op, eoDistance<eoEsStdev<eoMinimizingFitness> >* _dist)
+00071 {
+00072   return do_make_algo_scalar(_parser, _state, _eval, _continue, _op);
+00073 }
+00074 
+00076 eoAlgo<eoEsFull<double> >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<eoEsFull<double> >& _eval, eoContinue<eoEsFull<double> >& _continue, eoGenOp<eoEsFull<double> >& _op, eoDistance<eoEsFull<double> >* _dist)
+00077 {
+00078   return do_make_algo_scalar(_parser, _state, _eval, _continue, _op);
+00079 }
+00080 
+00081 eoAlgo<eoEsFull<eoMinimizingFitness> >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<eoEsFull<eoMinimizingFitness> >& _eval, eoContinue<eoEsFull<eoMinimizingFitness> >& _continue, eoGenOp<eoEsFull<eoMinimizingFitness> >& _op, eoDistance<eoEsFull<eoMinimizingFitness> >* _dist)
+00082 {
+00083   return do_make_algo_scalar(_parser, _state, _eval, _continue, _op);
+00084 }
+00085 
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__algo__scalar__ga_8cpp-source.html b/trunk/paradiseo-eo/doc/html/make__algo__scalar__ga_8cpp-source.html new file mode 100644 index 000000000..200c2fb33 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__algo__scalar__ga_8cpp-source.html @@ -0,0 +1,63 @@ + + +EO: make_algo_scalar_ga.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / ga
+

make_algo_scalar_ga.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_algo_scalar_ga.cpp
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifdef _MSC_VER
+00028 // to avoid long name warnings
+00029 #pragma warning(disable:4786)
+00030 #endif 
+00031 
+00046 // The templatized code
+00047 #include <do/make_algo_scalar.h>
+00048 // the instanciating EOType
+00049 #include <ga/eoBit.h>
+00050 
+00052 
+00053 // Algo
+00055 eoAlgo<eoBit<double> >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<eoBit<double> >& _eval, eoContinue<eoBit<double> >& _continue, eoGenOp<eoBit<double> >& _op, eoDistance<eoBit<double> >* _dist)
+00056 {
+00057   return do_make_algo_scalar(_parser, _state, _eval, _continue, _op, _dist);
+00058 }
+00059 
+00060 eoAlgo<eoBit<eoMinimizingFitness> >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<eoBit<eoMinimizingFitness> >& _eval, eoContinue<eoBit<eoMinimizingFitness> >& _continue, eoGenOp<eoBit<eoMinimizingFitness> >& _op, eoDistance<eoBit<eoMinimizingFitness> >* _dist)
+00061 {
+00062   return do_make_algo_scalar(_parser, _state, _eval, _continue, _op, _dist);
+00063 }
+00064 
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__algo__scalar__real_8cpp-source.html b/trunk/paradiseo-eo/doc/html/make__algo__scalar__real_8cpp-source.html new file mode 100644 index 000000000..e68be03c6 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__algo__scalar__real_8cpp-source.html @@ -0,0 +1,63 @@ + + +EO: make_algo_scalar_real.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

make_algo_scalar_real.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_algo_scalar_real.cpp
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifdef _MSC_VER
+00028 // to avoid long name warnings
+00029 #pragma warning(disable:4786)
+00030 #endif 
+00031 
+00043 // The templatized code
+00044 #include <do/make_algo_scalar.h>
+00045 // the instanciating EOType
+00046 #include <es/eoReal.h>
+00047 
+00049 
+00050 // Algo
+00052 eoAlgo<eoReal<double> >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<eoReal<double> >& _eval, eoContinue<eoReal<double> >& _continue, eoGenOp<eoReal<double> >& _op, eoDistance<eoReal<double> >* _dist)
+00053 {
+00054   return do_make_algo_scalar(_parser, _state, _eval, _continue, _op, _dist);
+00055 }
+00056 
+00057 eoAlgo<eoReal<eoMinimizingFitness> >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<eoReal<eoMinimizingFitness> >& _eval, eoContinue<eoReal<eoMinimizingFitness> >& _continue, eoGenOp<eoReal<eoMinimizingFitness> >& _op, eoDistance<eoReal<eoMinimizingFitness> >* _dist)
+00058 {
+00059   return do_make_algo_scalar(_parser, _state, _eval, _continue, _op, _dist);
+00060 }
+00061 
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__checkpoint_8h-source.html b/trunk/paradiseo-eo/doc/html/make__checkpoint_8h-source.html new file mode 100644 index 000000000..e2dc20ac5 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__checkpoint_8h-source.html @@ -0,0 +1,288 @@ + + +EO: make_checkpoint.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / do
+

make_checkpoint.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_checkpoint.h
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2000
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _make_checkpoint_h
+00028 #define _make_checkpoint_h
+00029 
+00030 #include <eoScalarFitness.h>
+00031 #include <utils/selectors.h> // for minimizing_fitness()
+00032 #include <EO.h>
+00033 #include <eoEvalFuncCounter.h>
+00034 #include <utils/checkpointing>
+00035 
+00036 // at the moment, in utils/make_help.cpp
+00037 // this should become some eoUtils.cpp with corresponding eoUtils.h
+00038 bool testDirRes(std::string _dirName, bool _erase);
+00040 
+00041 
+00042 template <class EOT>
+00043 eoCheckPoint<EOT>& do_make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<EOT>& _eval, eoContinue<EOT>& _continue)
+00044 {
+00045   // first, create a checkpoint from the eoContinue
+00046   eoCheckPoint<EOT> *checkpoint = new eoCheckPoint<EOT>(_continue);
+00047   _state.storeFunctor(checkpoint);
+00048 
+00050   // Counters
+00052   // is nb Eval to be used as counter?
+00053   eoValueParam<bool>& useEvalParam = _parser.createParam(true, "useEval", "Use nb of eval. as counter (vs nb of gen.)", '\0', "Output");
+00054   eoValueParam<bool>& useTimeParam = _parser.createParam(true, "useTime", "Display time (s) every generation", '\0', "Output");
+00055 
+00056   // if we want the time, we need an eoTimeCounter
+00057   eoTimeCounter * tCounter = NULL;
+00058 
+00059   // Create anyway a generation-counter
+00060   // Recent change (03/2002): it is now an eoIncrementorParam, both
+00061   // a parameter AND updater so you can store it into the eoState
+00062   eoIncrementorParam<unsigned> *generationCounter = new eoIncrementorParam<unsigned>("Gen.");
+00063   // store it in the state
+00064   _state.storeFunctor(generationCounter);
+00065   // And add it to the checkpoint,
+00066   checkpoint->add(*generationCounter);
+00067 
+00068     // dir for DISK output
+00069     eoValueParam<std::string>& dirNameParam =  _parser.createParam(std::string("Res"), "resDir", "Directory to store DISK outputs", '\0', "Output - Disk");
+00070     // shoudl we empty it if exists
+00071     eoValueParam<bool>& eraseParam = _parser.createParam(true, "eraseDir", "erase files in dirName if any", '\0', "Output - Disk");
+00072     bool dirOK = false;            // not tested yet
+00073 
+00075     // now some statistics on the population:
+00077 
+00087     // Best fitness in population
+00088     //---------------------------
+00089     eoValueParam<bool>& printBestParam = _parser.createParam(true, "printBestStat", "Print Best/avg/stdev every gen.", '\0', "Output");
+00090     eoValueParam<bool>& plotBestParam = _parser.createParam(false, "plotBestStat", "Plot Best/avg Stat", '\0', "Output - Graphical");
+00091     eoValueParam<bool>& fileBestParam = _parser.createParam(false, "fileBestStat", "Output bes/avg/std to file", '\0', "Output - Disk");
+00092 
+00093     eoBestFitnessStat<EOT> *bestStat = NULL;
+00094     if ( printBestParam.value() || plotBestParam.value() || fileBestParam.value() )
+00095       // we need the bestStat for at least one of the 3 above
+00096       {
+00097         bestStat = new eoBestFitnessStat<EOT>;
+00098         // store it
+00099         _state.storeFunctor(bestStat);
+00100         // add it to the checkpoint
+00101         checkpoint->add(*bestStat);
+00102       }
+00103 
+00104     // Average fitness alone
+00105     //----------------------
+00106     eoAverageStat<EOT> *averageStat = NULL; // do we need averageStat?
+00107     if ( plotBestParam.value() ) // we need it for gnuplot output
+00108       {
+00109         averageStat = new eoAverageStat<EOT>;
+00110         // store it
+00111         _state.storeFunctor(averageStat);
+00112         // add it to the checkpoint
+00113         checkpoint->add(*averageStat);
+00114       }
+00115 
+00116     // Second moment stats: average and stdev
+00117     //---------------------------------------
+00118     eoSecondMomentStats<EOT> *secondStat = NULL;
+00119     if ( printBestParam.value() ) // we need it for sreen output
+00120       {
+00121         secondStat = new eoSecondMomentStats<EOT>;
+00122         // store it
+00123         _state.storeFunctor(secondStat);
+00124         // add it to the checkpoint
+00125         checkpoint->add(*secondStat);
+00126       }
+00127 
+00128 
+00129     // Dump of the whole population
+00130     //-----------------------------
+00131     eoSortedPopStat<EOT> *popStat = NULL;
+00132     eoValueParam<bool>& printPopParam = _parser.createParam(false, "printPop", "Print sorted pop. every gen.", '\0', "Output");
+00133     if ( printPopParam.value() ) // we do want pop dump
+00134       {
+00135           popStat = new eoSortedPopStat<EOT>;
+00136         // store it
+00137         _state.storeFunctor(popStat);
+00138         // add it to the checkpoint
+00139         checkpoint->add(*popStat);
+00140       }
+00141 
+00142 
+00143     // do we wnat some histogram of fitnesses snpashots?
+00144     eoValueParam<bool> plotHistogramParam = _parser.createParam(false, "plotHisto", "Plot histogram of fitnesses", '\0', "Output - Graphical");
+00145 
+00147     // The monitors
+00149     // do we want an eoStdoutMonitor?
+00150     bool needStdoutMonitor = printBestParam.value()
+00151         || printPopParam.value() ;
+00152 
+00153     // The Stdout monitor will print parameters to the screen ...
+00154     if ( needStdoutMonitor )
+00155       {
+00156         eoStdoutMonitor *monitor = new eoStdoutMonitor(false);
+00157         _state.storeFunctor(monitor);
+00158 
+00159         // when called by the checkpoint (i.e. at every generation)
+00160         checkpoint->add(*monitor);
+00161 
+00162         // the monitor will output a series of parameters: add them
+00163         monitor->add(*generationCounter);
+00164         if (useEvalParam.value()) // we want nb of evaluations
+00165               monitor->add(_eval);
+00166         if (useTimeParam.value()) // we want time
+00167           {
+00168             tCounter = new eoTimeCounter;
+00169             _state.storeFunctor(tCounter);
+00170             checkpoint->add(*tCounter);
+00171             monitor->add(*tCounter);
+00172           }
+00173         if (printBestParam.value())
+00174             {
+00175                 monitor->add(*bestStat);
+00176                 monitor->add(*secondStat);
+00177             }
+00178         if ( printPopParam.value())
+00179           monitor->add(*popStat);
+00180       }
+00181 
+00182     // first handle the dir test - if we need at least one file
+00183     if ( ( fileBestParam.value() || plotBestParam.value() ||
+00184            plotHistogramParam.value() )
+00185          && !dirOK )               // just in case we add something before
+00186       dirOK = testDirRes(dirNameParam.value(), eraseParam.value()); // TRUE
+00187 
+00188     if (fileBestParam.value())    // A file monitor for best & secondMoment
+00189       {
+00190 #ifdef _MSVC
+00191         std::string stmp = dirNameParam.value() + "\best.xg";
+00192 #else
+00193         std::string stmp = dirNameParam.value() + "/best.xg";
+00194 #endif
+00195         eoFileMonitor *fileMonitor = new eoFileMonitor(stmp);
+00196         // save and give to checkpoint
+00197         _state.storeFunctor(fileMonitor);
+00198         checkpoint->add(*fileMonitor);
+00199         // and feed with some statistics
+00200         fileMonitor->add(*generationCounter);
+00201         fileMonitor->add(_eval);
+00202         if (tCounter)              // we want the time as well
+00203           {
+00204             //      std::cout << "On met timecounter\n";
+00205             fileMonitor->add(*tCounter);
+00206           }
+00207         fileMonitor->add(*bestStat);
+00208         fileMonitor->add(*secondStat);
+00209       }
+00210 
+00211     if (plotBestParam.value())    // an eoGnuplot1DMonitor for best & average
+00212       {
+00213         std::string stmp = dirNameParam.value() + "/gnu_best.xg";
+00214         eoGnuplot1DMonitor *gnuMonitor = new eoGnuplot1DMonitor(stmp,minimizing_fitness<EOT>());
+00215         // save and give to checkpoint
+00216         _state.storeFunctor(gnuMonitor);
+00217         checkpoint->add(*gnuMonitor);
+00218         // and feed with some statistics
+00219         if (useEvalParam.value())  // do we want eval as X coordinate
+00220           gnuMonitor->add(_eval);
+00221         else if (tCounter)         // or time?
+00222           gnuMonitor->add(*tCounter);
+00223         else                       // default: generation
+00224           gnuMonitor->add(*generationCounter);
+00225         gnuMonitor->add(*bestStat);
+00226         gnuMonitor->add(*averageStat);
+00227       }
+00228 
+00229     // historgram?
+00230     if (plotHistogramParam.value()) // want to see how the fitness is spread?
+00231       {
+00232         eoScalarFitnessStat<EOT> *fitStat = new eoScalarFitnessStat<EOT>;
+00233         _state.storeFunctor(fitStat);
+00234         checkpoint->add(*fitStat);
+00235         // a gnuplot-based monitor for snapshots: needs a dir name
+00236         eoGnuplot1DSnapshot *fitSnapshot = new eoGnuplot1DSnapshot(dirNameParam.value());
+00237         _state.storeFunctor(fitSnapshot);
+00238         // add any stat that is a std::vector<double> to it
+00239         fitSnapshot->add(*fitStat);
+00240         // and of course add it to the checkpoint
+00241         checkpoint->add(*fitSnapshot);
+00242       }
+00243 
+00245     // State savers
+00247 
+00248     // feed the state to state savers
+00249     // save state every N  generation
+00250     eoValueParam<unsigned>& saveFrequencyParam = _parser.createParam(unsigned(0), "saveFrequency", "Save every F generation (0 = only final state, absent = never)", '\0', "Persistence" );
+00251 
+00252     if (_parser.isItThere(saveFrequencyParam))
+00253     {
+00254       // first make sure dirName is OK
+00255       if (! dirOK )
+00256         dirOK = testDirRes(dirNameParam.value(), eraseParam.value()); // TRUE
+00257 
+00258       unsigned freq = (saveFrequencyParam.value()>0 ? saveFrequencyParam.value() : UINT_MAX );
+00259 #ifdef _MSVC
+00260       std::string stmp = dirNameParam.value() + "\generations";
+00261 #else
+00262       std::string stmp = dirNameParam.value() + "/generations";
+00263 #endif
+00264       eoCountedStateSaver *stateSaver1 = new eoCountedStateSaver(freq, _state, stmp);
+00265       _state.storeFunctor(stateSaver1);
+00266     checkpoint->add(*stateSaver1);
+00267     }
+00268 
+00269     // save state every T seconds
+00270     eoValueParam<unsigned>& saveTimeIntervalParam = _parser.createParam(unsigned(0), "saveTimeInterval", "Save every T seconds (0 or absent = never)", '\0',"Persistence" );
+00271     if (_parser.isItThere(saveTimeIntervalParam) && saveTimeIntervalParam.value()>0)
+00272     {
+00273       // first make sure dirName is OK
+00274       if (! dirOK )
+00275         dirOK = testDirRes(dirNameParam.value(), eraseParam.value()); // TRUE
+00276 
+00277 #ifdef _MSVC
+00278       std::string stmp = dirNameParam.value() + "\time";
+00279 #else
+00280       std::string stmp = dirNameParam.value() + "/time";
+00281 #endif
+00282       eoTimedStateSaver *stateSaver2 = new eoTimedStateSaver(saveTimeIntervalParam.value(), _state, stmp);
+00283       _state.storeFunctor(stateSaver2);
+00284       checkpoint->add(*stateSaver2);
+00285     }
+00286 
+00287     // and that's it for the (control and) output
+00288     return *checkpoint;
+00289 }
+00290 
+00291 #endif
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__checkpoint___f_d_c_8h-source.html b/trunk/paradiseo-eo/doc/html/make__checkpoint___f_d_c_8h-source.html new file mode 100644 index 000000000..ba64be802 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__checkpoint___f_d_c_8h-source.html @@ -0,0 +1,292 @@ + + +EO: make_checkpoint_FDC.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / do
+

make_checkpoint_FDC.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_checkpoint.h
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2000
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _make_checkpoint_h
+00028 #define _make_checkpoint_h
+00029 
+00030 #include <eoScalarFitness.h>
+00031 #include <utils/selectors.h> // for minimizing_fitness()
+00032 #include <EO.h>
+00033 #include <eoEvalFuncCounter.h>
+00034 #include <utils/checkpointing>
+00035 
+00036 // at the moment, in utils/make_help.cpp
+00037 // this should become some eoUtils.cpp with corresponding eoUtils.h
+00038 bool testDirRes(std::string _dirName, bool _erase);
+00040 
+00041 
+00042 template <class EOT>
+00043 eoCheckPoint<EOT>& do_make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<EOT>& _eval, eoContinue<EOT>& _continue)
+00044 {
+00045   // first, create a checkpoint from the eoContinue
+00046   eoCheckPoint<EOT> *checkpoint = new eoCheckPoint<EOT>(_continue);
+00047   _state.storeFunctor(checkpoint);
+00048 
+00050   // Counters
+00052   // is nb Eval to be used as counter?
+00053   eoValueParam<bool>& useEvalParam = _parser.createParam(true, "useEval", "Use nb of eval. as counter (vs nb of gen.)", '\0', "Output");
+00054 
+00055     // Create anyway a generation-counter parameter
+00056     eoValueParam<unsigned> *generationCounter = new eoValueParam<unsigned>(0, "Gen.");
+00057     // Create an incrementor (sub-class of eoUpdater).
+00058     eoIncrementor<unsigned>* increment = new eoIncrementor<unsigned>(generationCounter->value());
+00059     // Add it to the checkpoint, 
+00060     checkpoint->add(*increment);
+00061     // and store it in the state
+00062     _state.storeFunctor(increment);
+00063 
+00064     // dir for DISK output
+00065     eoValueParam<std::string>& dirNameParam =  _parser.createParam(std::string("Res"), "resDir", "Directory to store DISK outputs", '\0', "Output - Disk");
+00066     // shoudl we empty it if exists
+00067     eoValueParam<bool>& eraseParam = _parser.createParam(false, "eraseDir", "erase files in dirName if any", '\0', "Output - Disk");
+00068     bool dirOK = false;            // not tested yet
+00069 
+00071     // now some statistics on the population:
+00073 
+00086     // Best fitness in population
+00087     //---------------------------
+00088     eoValueParam<bool>& printBestParam = _parser.createParam(true, "printBestStat", "Print Best/avg/stdev every gen.", '\0', "Output");
+00089     eoValueParam<bool>& plotBestParam = _parser.createParam(false, "plotBestStat", "Plot Best/avg Stat", '\0', "Output - Graphical");
+00090     eoValueParam<bool>& fileBestParam = _parser.createParam(false, "fileBestStat", "Output bes/avg/std to file", '\0', "Output - Disk");
+00091 
+00092     eoBestFitnessStat<EOT> *bestStat = NULL;
+00093     if ( printBestParam.value() || plotBestParam.value() || fileBestParam.value() ) 
+00094       // we need the bestStat for at least one of the 3 above
+00095       {
+00096         bestStat = new eoBestFitnessStat<EOT>;
+00097         // store it
+00098         _state.storeFunctor(bestStat);
+00099         // add it to the checkpoint
+00100         checkpoint->add(*bestStat);
+00101       }
+00102 
+00103     // Average fitness alone
+00104     //----------------------
+00105     eoAverageStat<EOT> *averageStat = NULL; // do we need averageStat?
+00106     if ( plotBestParam.value() ) // we need it for gnuplot output
+00107       {
+00108         averageStat = new eoAverageStat<EOT>;
+00109         // store it
+00110         _state.storeFunctor(averageStat);
+00111         // add it to the checkpoint
+00112         checkpoint->add(*averageStat);
+00113       }
+00114 
+00115     // Second moment stats: average and stdev
+00116     //---------------------------------------
+00117     eoSecondMomentStats<EOT> *secondStat = NULL;
+00118     if ( printBestParam.value() ) // we need it for sreen output
+00119       {
+00120         secondStat = new eoSecondMomentStats<EOT>;
+00121         // store it
+00122         _state.storeFunctor(secondStat);
+00123         // add it to the checkpoint
+00124         checkpoint->add(*secondStat);
+00125       }
+00126 
+00127 
+00128     // Dump of the whole population
+00129     //-----------------------------
+00130     eoSortedPopStat<EOT> *popStat = NULL;
+00131     eoValueParam<bool>& printPopParam = _parser.createParam(false, "printPop", "Print sorted pop. every gen.", '\0', "Output");
+00132     if ( printPopParam.value() ) // we do want pop dump
+00133       {
+00134           popStat = new eoSortedPopStat<EOT>("Dump of whole population");
+00135         // store it
+00136         _state.storeFunctor(popStat);
+00137         // add it to the checkpoint
+00138         checkpoint->add(*popStat);
+00139       }
+00140 
+00141 
+00142     // the Fitness Distance Correlation
+00143     //---------------------------------
+00144     eoValueParam<bool>& printFDCParam = _parser.createParam(true, "printFDC", "Print FDC coeff. every gen.", '\0', "Output");
+00145     eoValueParam<bool>& plotFDCParam = _parser.createParam(false, "plotFDCStat", "Plot FDC scatter plot", '\0', "Output - Graphical");
+00146 
+00147     eoFDCStat<EOT> *fdcStat = NULL;
+00148     if ( printFDCParam.value() || plotFDCParam.value() ) // we need FDCStat
+00149       {
+00150         // need first an object to compute the distances - here Hamming dist.
+00151         eoQuadDistance<EOT> *dist = new eoQuadDistance<EOT>;
+00152         _state.storeFunctor(dist);
+00153         fdcStat = new eoFDCStat<EOT>(*dist);
+00154         // storeFunctor it
+00155         _state.storeFunctor(fdcStat);
+00156         // add it to the checkpoint
+00157         checkpoint->add(*fdcStat);
+00158       }
+00159 
+00160     // do we wnat some histogram of fitnesses snpashots?
+00161     eoValueParam<bool> plotHistogramParam = _parser.createParam(false, "plotHisto", "Plot histogram of fitnesses", '\0', "Output - Graphical");
+00162 
+00164     // The monitors
+00166     // do we want an eoStdoutMonitor?
+00167     bool needStdoutMonitor = printBestParam.value() || printFDCParam.value() 
+00168         || printPopParam.value() ;
+00169 
+00170     // The Stdout monitor will print parameters to the screen ...  
+00171     if ( needStdoutMonitor ) 
+00172       {
+00173         eoStdoutMonitor *monitor = new eoStdoutMonitor(false);
+00174         _state.storeFunctor(monitor);
+00175 
+00176         // when called by the checkpoint (i.e. at every generation)
+00177         checkpoint->add(*monitor);
+00178 
+00179         // the monitor will output a series of parameters: add them
+00180         monitor->add(*generationCounter);
+00181         if (useEvalParam.value()) // we want nb of evaluations
+00182               monitor->add(_eval);
+00183         if (printBestParam.value())
+00184             {
+00185                 monitor->add(*bestStat);
+00186                 monitor->add(*secondStat);
+00187             }
+00188         if (printFDCParam.value())
+00189           monitor->add(*fdcStat);
+00190         if ( printPopParam.value())
+00191           monitor->add(*popStat);
+00192       }
+00193 
+00194     // first handle the dir test - if we need at least one file
+00195     if ( ( fileBestParam.value() || plotBestParam.value() || 
+00196            plotFDCParam.value() || plotHistogramParam.value() )
+00197          && !dirOK )               // just in case we add something before
+00198       dirOK = testDirRes(dirNameParam.value(), eraseParam.value()); // TRUE
+00199 
+00200     if (fileBestParam.value())    // A file monitor for best & secondMoment
+00201       {
+00202         std::string stmp = dirNameParam.value() + "/best.xg";
+00203         eoFileMonitor *fileMonitor = new eoFileMonitor(stmp);
+00204         // save and give to checkpoint
+00205         _state.storeFunctor(fileMonitor);
+00206         checkpoint->add(*fileMonitor);
+00207         // and feed with some statistics
+00208         fileMonitor->add(*generationCounter);
+00209         fileMonitor->add(_eval);
+00210         fileMonitor->add(*bestStat); 
+00211         fileMonitor->add(*secondStat);
+00212       }
+00213 
+00214     if (plotBestParam.value())    // an eoGnuplot1DMonitor for best & average
+00215       {
+00216         std::string stmp = dirNameParam.value() + "_gnu_best.xg";
+00217         eoGnuplot1DMonitor *gnuMonitor = new eoGnuplot1DMonitor(stmp,minimizing_fitness<EOT>());
+00218         // save and give to checkpoint
+00219         _state.storeFunctor(gnuMonitor);
+00220         checkpoint->add(*gnuMonitor);
+00221         // and feed with some statistics
+00222         if (useEvalParam.value())
+00223           gnuMonitor->add(_eval);
+00224         else
+00225           gnuMonitor->add(*generationCounter);
+00226         gnuMonitor->add(*bestStat);
+00227         gnuMonitor->add(*averageStat);
+00228       }
+00229 
+00230     if (plotFDCParam.value())    // a specific plot monitor for FDC
+00231       {
+00232         // first into a file (it adds everything ti itself
+00233         eoFDCFileSnapshot<EOT> *fdcFileSnapshot = new eoFDCFileSnapshot<EOT>(*fdcStat, dirNameParam.value());
+00234         _state.storeFunctor(fdcFileSnapshot);
+00235         // then to a Gnuplot monitor
+00236         eoGnuplot1DSnapshot *fdcGnuplot = new eoGnuplot1DSnapshot(*fdcFileSnapshot);
+00237         _state.storeFunctor(fdcGnuplot);
+00238         
+00239         // and of course add them to the checkPoint
+00240         checkpoint->add(*fdcFileSnapshot);
+00241         checkpoint->add(*fdcGnuplot);
+00242       }
+00243 
+00244     // historgram?
+00245     if (plotHistogramParam.value()) // want to see how the fitness is spread?
+00246       {
+00247         eoScalarFitnessStat<EOT> *fitStat = new eoScalarFitnessStat<EOT>;
+00248         _state.storeFunctor(fitStat);
+00249         checkpoint->add(*fitStat);
+00250         // a gnuplot-based monitor for snapshots: needs a dir name
+00251         eoGnuplot1DSnapshot *fitSnapshot = new eoGnuplot1DSnapshot(dirNameParam.value());
+00252         _state.storeFunctor(fitSnapshot);
+00253         // add any stat that is a std::vector<double> to it
+00254         fitSnapshot->add(*fitStat);
+00255         // and of course add it to the checkpoint
+00256         checkpoint->add(*fitSnapshot);
+00257       }
+00258 
+00260     // State savers
+00262 
+00263     // feed the state to state savers
+00264     // save state every N  generation
+00265     eoValueParam<unsigned>& saveFrequencyParam = _parser.createParam(unsigned(0), "saveFrequency", "Save every F generation (0 = only final state, absent = never)", '\0', "Persistence" );
+00266 
+00267     if (_parser.isItThere(saveFrequencyParam))
+00268     {
+00269       // first make sure dirName is OK
+00270       if (! dirOK )
+00271         dirOK = testDirRes(dirNameParam.value(), eraseParam.value()); // TRUE
+00272 
+00273       unsigned freq = (saveFrequencyParam.value()>0 ? saveFrequencyParam.value() : UINT_MAX );
+00274       std::string stmp = dirNameParam.value() + "/generations";
+00275       eoCountedStateSaver *stateSaver1 = new eoCountedStateSaver(freq, _state, stmp); 
+00276       _state.storeFunctor(stateSaver1);
+00277     checkpoint->add(*stateSaver1);
+00278     }
+00279 
+00280     // save state every T seconds 
+00281     eoValueParam<unsigned>& saveTimeIntervalParam = _parser.createParam(unsigned(0), "saveTimeInterval", "Save every T seconds (0 or absent = never)", '\0',"Persistence" );
+00282     if (_parser.isItThere(saveTimeIntervalParam) && saveTimeIntervalParam.value()>0)
+00283     {
+00284       // first make sure dirName is OK
+00285       if (! dirOK )
+00286         dirOK = testDirRes(dirNameParam.value(), eraseParam.value()); // TRUE
+00287 
+00288       std::string stmp = dirNameParam.value() + "/time";
+00289       eoTimedStateSaver *stateSaver2 = new eoTimedStateSaver(saveTimeIntervalParam.value(), _state, stmp); 
+00290       _state.storeFunctor(stateSaver2);
+00291       checkpoint->add(*stateSaver2);
+00292     }
+00293 
+00294     // and that's it for the (control and) output
+00295     return *checkpoint;
+00296 }
+00297 
+00298 #endif
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__checkpoint__assembled_8h-source.html b/trunk/paradiseo-eo/doc/html/make__checkpoint__assembled_8h-source.html new file mode 100644 index 000000000..3004070ff --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__checkpoint__assembled_8h-source.html @@ -0,0 +1,215 @@ + + +EO: make_checkpoint_assembled.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / do
+

make_checkpoint_assembled.h

00001  /* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- */
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_checkpoint_assembled.h
+00005 // Marc Wintermantel & Oliver Koenig
+00006 // IMES-ST@ETHZ.CH
+00007 // March 2003
+00008 
+00009 /*
+00010     This library is free software; you can redistribute it and/or
+00011     modify it under the terms of the GNU Lesser General Public
+00012     License as published by the Free Software Foundation; either
+00013     version 2 of the License, or (at your option) any later version.
+00014 
+00015     This library is distributed in the hope that it will be useful,
+00016     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00017     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00018     Lesser General Public License for more details.
+00019 
+00020     You should have received a copy of the GNU Lesser General Public
+00021     License along with this library; if not, write to the Free Software
+00022     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00023 
+00024     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00025              Marc.Schoenauer@inria.fr
+00026              mak@dhi.dk
+00027 */
+00028 //-----------------------------------------------------------------------------
+00029 
+00030 #ifndef _make_checkpoint_assembled_h
+00031 #define _make_checkpoint_assembled_h
+00032 
+00033 #include <vector>
+00034 #include <string>
+00035 
+00036 #include <eoScalarFitnessAssembled.h>
+00037 #include <utils/selectors.h>
+00038 #include <EO.h>
+00039 #include <eoEvalFuncCounter.h>
+00040 #include <utils/checkpointing>
+00041 
+00042 // at the moment, in utils/make_help.cpp
+00043 // this should become some eoUtils.cpp with corresponding eoUtils.h
+00044 bool testDirRes(std::string _dirName, bool _erase);
+00046 
+00048 template <class EOT>
+00049 eoCheckPoint<EOT>& do_make_checkpoint_assembled(eoParser& _parser, eoState& _state, eoEvalFuncCounter<EOT>& _eval, eoContinue<EOT>& _continue)
+00050 {
+00051 
+00052     // SOME PARSER PARAMETERS
+00053     // ----------------------
+00054     std::string dirName = _parser.getORcreateParam(std::string("Res"), "resDir",
+00055                                                    "Directory to store DISK outputs",
+00056                                                    '\0', "Output").value();
+00057     bool erase = _parser.getORcreateParam(true, "eraseDir",
+00058                                           "Erase files in dirName if any",
+00059                                           '\0', "Output").value();
+00060     bool gnuplots = _parser.getORcreateParam(true, "plots",
+00061                                              "Plot stuff using GnuPlot",
+00062                                              '\0', "Output").value();
+00063     bool printFile = _parser.getORcreateParam(true, "printFile",
+00064                                               "Print statistics file",
+00065                                               '\0', "Output").value();
+00066 
+00067   eoValueParam<unsigned>& saveFrequencyParam
+00068       = _parser.getORcreateParam(unsigned(0), "saveFrequency",
+00069                                  "Save every F generation (0 = only final state, absent = never)",
+00070                                  '\0', "Persistence" );
+00071 
+00072   testDirRes(dirName, erase); // TRUE
+00073 
+00074   // CREATE CHECKPOINT FROM eoContinue
+00075   // ---------------------------------
+00076   eoCheckPoint<EOT> *checkpoint = new eoCheckPoint<EOT>(_continue);
+00077   _state.storeFunctor(checkpoint);
+00078 
+00079   // GENERATIONS
+00080   // -----------
+00081   eoIncrementorParam<unsigned> *generationCounter = new eoIncrementorParam<unsigned>("Gen.");
+00082   _state.storeFunctor(generationCounter);
+00083   checkpoint->add(*generationCounter);
+00084 
+00085   // TIME
+00086   // ----
+00087   eoTimeCounter * tCounter = NULL;
+00088   tCounter = new eoTimeCounter;
+00089   _state.storeFunctor(tCounter);
+00090   checkpoint->add(*tCounter);
+00091 
+00092   // ACCESS DESCRIPTIONS OF TERMS OF FITNESS CLASS
+00093   // ---------------------------------------------
+00094   // define a temporary fitness instance
+00095   typedef typename EOT::Fitness Fit;
+00096   Fit fit;
+00097   std::vector<std::string> fitness_descriptions = fit.getDescriptionVector();
+00098   unsigned nTerms = fitness_descriptions.size();
+00099 
+00100   // STAT VALUES OF A POPULATION
+00101   // ---------------------------
+00102 
+00103   // average vals
+00104   std::vector<eoAssembledFitnessAverageStat<EOT>* > avgvals( nTerms );
+00105   for (unsigned i=0; i < nTerms; ++i){
+00106     std::string descr = "Avg. of " + fitness_descriptions[i];
+00107     avgvals[i] = new eoAssembledFitnessAverageStat<EOT>(i, descr);
+00108     _state.storeFunctor( avgvals[i] );
+00109     checkpoint->add( *avgvals[i] );
+00110   }
+00111 
+00112   // best vals
+00113   std::vector<eoAssembledFitnessBestStat<EOT>* > bestvals( nTerms );
+00114   for (unsigned j=0; j < nTerms; ++j){
+00115     std::string descr = fitness_descriptions[j] + " of best ind.";
+00116     bestvals[j] = new eoAssembledFitnessBestStat<EOT>(j, descr);
+00117     _state.storeFunctor( bestvals[j] );
+00118     checkpoint->add( *bestvals[j] );
+00119   }
+00120 
+00121   // STDOUT
+00122   // ------
+00123   eoStdoutMonitor *monitor = new eoStdoutMonitor(false);
+00124   _state.storeFunctor(monitor);
+00125   checkpoint->add(*monitor);
+00126   monitor->add(*generationCounter);
+00127   monitor->add(_eval);
+00128   monitor->add(*tCounter);
+00129 
+00130   // Add best fitness
+00131   monitor->add( *bestvals[0] );
+00132 
+00133   // Add all average vals
+00134   for (unsigned l=0; l < nTerms; ++l)
+00135     monitor->add( *avgvals[l] );
+00136 
+00137   // GNUPLOT
+00138   // -------
+00139   if (gnuplots ){
+00140     std::string stmp;
+00141 
+00142     // Histogramm of the different fitness vals
+00143     eoScalarFitnessStat<EOT> *fitStat = new eoScalarFitnessStat<EOT>;
+00144     _state.storeFunctor(fitStat);
+00145     checkpoint->add(*fitStat);
+00146     // a gnuplot-based monitor for snapshots: needs a dir name
+00147     eoGnuplot1DSnapshot *fitSnapshot = new eoGnuplot1DSnapshot(dirName);
+00148     _state.storeFunctor(fitSnapshot);
+00149     // add any stat that is a vector<double> to it
+00150     fitSnapshot->add(*fitStat);
+00151     // and of course add it to the checkpoint
+00152     checkpoint->add(*fitSnapshot);
+00153 
+00154     std::vector<eoGnuplot1DMonitor*> gnumonitors(nTerms, NULL );
+00155     for (unsigned k=0; k < nTerms; ++k){
+00156       stmp = dirName + "/gnuplot_" + fitness_descriptions[k] + ".xg";
+00157       gnumonitors[k] = new eoGnuplot1DMonitor(stmp,true);
+00158       _state.storeFunctor(gnumonitors[k]);
+00159       checkpoint->add(*gnumonitors[k]);
+00160       gnumonitors[k]->add(*generationCounter);
+00161       gnumonitors[k]->add(*bestvals[k]);
+00162       gnumonitors[k]->add(*avgvals[k]);
+00163     }
+00164 
+00165   }
+00166 
+00167   // WRITE STUFF TO FILE
+00168   // -------------------
+00169   if( printFile ){
+00170     std::string stmp2 = dirName + "/eoStatistics.sav";
+00171     eoFileMonitor *fileMonitor = new eoFileMonitor(stmp2);
+00172     _state.storeFunctor(fileMonitor);
+00173     checkpoint->add(*fileMonitor);
+00174     fileMonitor->add(*generationCounter);
+00175     fileMonitor->add(_eval);
+00176     fileMonitor->add(*tCounter);
+00177 
+00178     for (unsigned i=0; i < nTerms; ++i){
+00179       fileMonitor->add(*bestvals[i]);
+00180       fileMonitor->add(*avgvals[i]);
+00181     }
+00182 
+00183   }
+00184 
+00185   // STATE SAVER
+00186   // -----------
+00187   // feed the state to state savers
+00188 
+00189   if (_parser.isItThere(saveFrequencyParam)) {
+00190 
+00191     unsigned freq = (saveFrequencyParam.value() > 0 ? saveFrequencyParam.value() : UINT_MAX );
+00192     std::string stmp = dirName + "/generations";
+00193     eoCountedStateSaver *stateSaver1 = new eoCountedStateSaver(freq, _state, stmp);
+00194     _state.storeFunctor(stateSaver1);
+00195     checkpoint->add(*stateSaver1);
+00196   }
+00197 
+00198   // and that's it for the (control and) output
+00199   return *checkpoint;
+00200 }
+00201 
+00202 #endif
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__checkpoint__es_8cpp-source.html b/trunk/paradiseo-eo/doc/html/make__checkpoint__es_8cpp-source.html new file mode 100644 index 000000000..ed4a382fb --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__checkpoint__es_8cpp-source.html @@ -0,0 +1,83 @@ + + +EO: make_checkpoint_es.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

make_checkpoint_es.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_checkpoint_es.cpp
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifdef _MSC_VER
+00028 // to avoid long name warnings
+00029 #pragma warning(disable:4786)
+00030 #endif 
+00031 
+00043 // The templatized code
+00044 #include <do/make_checkpoint.h>
+00045 // the instanciating EOType(s)
+00046 #include <es/eoEsSimple.h>         // one Sigma per individual
+00047 #include <es/eoEsStdev.h>          // one sigmal per object variable
+00048 #include <es/eoEsFull.h>           // full correlation matrix per indi
+00049 
+00051 
+00052 // checkpoint
+00054 eoCheckPoint<eoEsSimple<double> >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoEsSimple<double> >& _eval, eoContinue<eoEsSimple<double> >& _continue)
+00055 {
+00056   return do_make_checkpoint(_parser, _state, _eval, _continue);
+00057 }
+00058 eoCheckPoint<eoEsSimple<eoMinimizingFitness> >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoEsSimple<eoMinimizingFitness> >& _eval, eoContinue<eoEsSimple<eoMinimizingFitness> >& _continue) 
+00059 {
+00060   return do_make_checkpoint(_parser, _state, _eval, _continue);
+00061 }
+00062 
+00064 eoCheckPoint<eoEsStdev<double> >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoEsStdev<double> >& _eval, eoContinue<eoEsStdev<double> >& _continue)
+00065 {
+00066   return do_make_checkpoint(_parser, _state, _eval, _continue);
+00067 }
+00068 eoCheckPoint<eoEsStdev<eoMinimizingFitness> >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoEsStdev<eoMinimizingFitness> >& _eval, eoContinue<eoEsStdev<eoMinimizingFitness> >& _continue) 
+00069 {
+00070   return do_make_checkpoint(_parser, _state, _eval, _continue);
+00071 }
+00072 
+00074 eoCheckPoint<eoEsFull<double> >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoEsFull<double> >& _eval, eoContinue<eoEsFull<double> >& _continue)
+00075 {
+00076   return do_make_checkpoint(_parser, _state, _eval, _continue);
+00077 }
+00078 eoCheckPoint<eoEsFull<eoMinimizingFitness> >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoEsFull<eoMinimizingFitness> >& _eval, eoContinue<eoEsFull<eoMinimizingFitness> >& _continue) 
+00079 {
+00080   return do_make_checkpoint(_parser, _state, _eval, _continue);
+00081 }
+00082 
+00083 
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__checkpoint__ga_8cpp-source.html b/trunk/paradiseo-eo/doc/html/make__checkpoint__ga_8cpp-source.html new file mode 100644 index 000000000..29ed7963e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__checkpoint__ga_8cpp-source.html @@ -0,0 +1,63 @@ + + +EO: make_checkpoint_ga.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / ga
+

make_checkpoint_ga.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_checkpoint_ga.cpp
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifdef _MSC_VER
+00028 // to avoid long name warnings
+00029 #pragma warning(disable:4786)
+00030 #endif 
+00031 
+00046 // The templatized code
+00047 #include <do/make_checkpoint.h>
+00048 // the instanciating EOType
+00049 #include <ga/eoBit.h>
+00050 
+00052 
+00053 // checkpoint
+00055 eoCheckPoint<eoBit<double> >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoBit<double> >& _eval, eoContinue<eoBit<double> >& _continue)
+00056 {
+00057   return do_make_checkpoint(_parser, _state, _eval, _continue);
+00058 }
+00059 eoCheckPoint<eoBit<eoMinimizingFitness> >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoBit<eoMinimizingFitness> >& _eval, eoContinue<eoBit<eoMinimizingFitness> >& _continue) 
+00060 {
+00061   return do_make_checkpoint(_parser, _state, _eval, _continue);
+00062 }
+00063 
+00064 
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__checkpoint__pareto_8h-source.html b/trunk/paradiseo-eo/doc/html/make__checkpoint__pareto_8h-source.html new file mode 100644 index 000000000..63dbc5a43 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__checkpoint__pareto_8h-source.html @@ -0,0 +1,245 @@ + + +EO: make_checkpoint_pareto.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / do
+

make_checkpoint_pareto.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_checkpoint_pareto.h
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2000
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@inria.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _make_checkpoint_pareto_h
+00028 #define _make_checkpoint_pareto_h
+00029 
+00030 #include <stdlib.h>
+00031 #include <sstream>
+00032 
+00033 #include "EO.h"
+00034 #include "eoParetoFitness.h"
+00035 #include "eoEvalFuncCounter.h"
+00036 #include "utils/checkpointing"
+00037 #include "utils/selectors.h"
+00038 
+00039 // at the moment, in utils/make_help.cpp
+00040 // this should become some eoUtils.cpp with corresponding eoUtils.h
+00041 bool testDirRes(std::string _dirName, bool _erase);
+00043 
+00046 template <class EOT>
+00047 eoCheckPoint<EOT>& do_make_checkpoint_pareto(eoParser& _parser, eoState& _state,
+00048                                              eoEvalFuncCounter<EOT>& _eval, eoContinue<EOT>& _continue)
+00049 {
+00050     // first, create a checkpoint from the eoContinue - and store in _state
+00051     eoCheckPoint<EOT> & checkpoint = _state.storeFunctor(new eoCheckPoint<EOT>(_continue));
+00052 
+00054     typedef typename EOT::Fitness Fit;
+00055     Fit fit;
+00056     unsigned nObj = fit.size();
+00057 
+00059     // Counters
+00061     // is nb Eval to be used as counter?
+00062     bool useEval = _parser.getORcreateParam(true, "useEval",
+00063                                             "Use nb of eval. as counter (vs nb of gen.)",
+00064                                             '\0', "Output").value();
+00065 
+00066     // Create anyway a generation-counter parameter WARNING: not stored anywhere!!!
+00067     eoValueParam<unsigned> *generationCounter = new eoValueParam<unsigned>(0, "Gen.");
+00068     // Create an incrementor (sub-class of eoUpdater).
+00069     eoIncrementor<unsigned> & increment =
+00070       _state.storeFunctor(new eoIncrementor<unsigned>(generationCounter->value()) );
+00071     // Add it to the checkpoint,
+00072     checkpoint.add(increment);
+00073 
+00074     // dir for DISK output
+00075     std::string & dirName =  _parser.getORcreateParam(std::string("Res"), "resDir",
+00076                                                       "Directory to store DISK outputs",
+00077                                                       '\0', "Output - Disk").value();
+00078     // shoudl we empty it if exists
+00079     eoValueParam<bool>& eraseParam = _parser.getORcreateParam(true, "eraseDir",
+00080                                                               "erase files in dirName if any",
+00081                                                               '\0', "Output - Disk");
+00082     bool dirOK = false;            // not tested yet
+00083 
+00085     // now some statistics on the population:
+00087 
+00093     eoValueParam<eoParamParamType>& fPlotParam
+00094         = _parser.getORcreateParam(eoParamParamType("1(0,1)"), "frontFileFrequency",
+00095       "File save frequency in objective spaces (std::pairs of comma-separated objectives " \
+00096       "in 1 single parentheses std::pair)",
+00097                                    '\0', "Output - Disk");
+00098 
+00099     bool boolGnuplot = _parser.getORcreateParam(false, "plotFront",
+00100                                                 "Objective plots (requires corresponding files " \
+00101                                                 "- see frontFileFrequency",
+00102                                                 '\0', "Output - Graphical").value();
+00103 
+00104     eoParamParamType & fPlot = fPlotParam.value(); // std::pair<std::string,std::vector<std::string> >
+00105     unsigned frequency = atoi(fPlot.first.c_str());
+00106     if (frequency)                 // something to plot
+00107     {
+00108       unsigned nbPlot = fPlot.second.size();
+00109       if ( nbPlot % 2 )            // odd!
+00110         throw std::runtime_error("Odd number of front description in make_checkpoint_pareto");
+00111 
+00112       // only create the necessary stats
+00113       std::vector<bool> bStat(nObj, false); // track of who's already there
+00114       std::vector<eoMOFitnessStat<EOT>* > theStats(nObj);
+00115 
+00116       // first create the stats
+00117       for (unsigned i=0; i<nbPlot; i+=2)
+00118         {
+00119           unsigned obj1 = atoi(fPlot.second[i].c_str());
+00120           unsigned obj2 = atoi(fPlot.second[i+1].c_str());
+00121           eoMOFitnessStat<EOT>* fStat;
+00122           if (!bStat[obj1]) {              // not already there: create it
+00123               std::ostringstream os;
+00124               os << "Obj. " << obj1 << std::ends;
+00125               fStat = new eoMOFitnessStat<EOT>(obj1, os.str().c_str());
+00126               _state.storeFunctor(fStat);
+00127               bStat[obj1]=true;
+00128               theStats[obj1]=fStat;
+00129               checkpoint.add(*fStat);
+00130           }
+00131           if (!bStat[obj2]) {              // not already there: create it
+00132               std::ostringstream os;
+00133               os << "Obj. " << obj2 << std::ends;
+00134               fStat = new eoMOFitnessStat<EOT>(obj2, os.str().c_str());
+00135               _state.storeFunctor(fStat);
+00136               bStat[obj2]=true;
+00137               theStats[obj2]=fStat;
+00138               checkpoint.add(*fStat);
+00139           }
+00140 
+00141           // then the fileSnapshots
+00142           std::ostringstream os;
+00143           os << "Front." << obj1 << "." << obj2 << "." << std::ends;
+00144           eoFileSnapshot& snapshot = _state.storeFunctor(
+00145               new eoFileSnapshot(dirName, frequency, os.str().c_str()));
+00146           checkpoint.add(snapshot);
+00147 
+00148           snapshot.add(*theStats[obj1]);
+00149           snapshot.add(*theStats[obj2]);
+00150 
+00151           // and create the gnuplotter from the fileSnapshot
+00152           if(boolGnuplot)
+00153             {
+00154               eoGnuplot1DSnapshot & plotSnapshot = _state.storeFunctor(new
+00155                     eoGnuplot1DSnapshot(snapshot));
+00156               plotSnapshot.setPointSize(3);
+00157               checkpoint.add(plotSnapshot);
+00158             }
+00159         }
+00160     }
+00161     // Dump of the whole population
+00162     //-----------------------------
+00163     bool printPop = _parser.getORcreateParam(false, "printPop",
+00164                                              "Print sorted pop. every gen.",
+00165                                              '\0', "Output").value();
+00166     eoSortedPopStat<EOT> * popStat;
+00167     if ( printPop ) // we do want pop dump
+00168       {
+00169         std::cout << "On cree printpop\n";
+00170         popStat = & _state.storeFunctor(new eoSortedPopStat<EOT>);
+00171         // add it to the checkpoint
+00172         checkpoint.add(*popStat);
+00173       }
+00174 
+00176     // The monitors
+00178     // do we want an eoStdoutMonitor?
+00179     bool needStdoutMonitor = printPop ; // only this one at the moment
+00180 
+00181     // The Stdout monitor will print parameters to the screen ...
+00182     if ( needStdoutMonitor )
+00183       {
+00184         eoStdoutMonitor & monitor = _state.storeFunctor(new eoStdoutMonitor(false));
+00185 
+00186         // when called by the checkpoint (i.e. at every generation)
+00187         checkpoint.add(monitor);
+00188 
+00189         // the monitor will output a series of parameters: add them
+00190         monitor.add(*generationCounter);
+00191         if (useEval) // we want nb of evaluations
+00192           monitor.add(_eval);
+00193         if ( printPop)
+00194           monitor.add(*popStat);
+00195       }
+00196 
+00197 
+00199     // State savers
+00201 
+00202     // feed the state to state savers
+00203     // save state every N  generation
+00204     eoValueParam<unsigned>& saveFrequencyParam = _parser.createParam(unsigned(0), "saveFrequency", "Save every F generation (0 = only final state, absent = never)", '\0', "Persistence" );
+00205 
+00206     if (_parser.isItThere(saveFrequencyParam))
+00207     {
+00208       // first make sure dirName is OK
+00209       if (! dirOK )
+00210         dirOK = testDirRes(dirName, eraseParam.value()); // TRUE
+00211 
+00212       unsigned freq = (saveFrequencyParam.value()>0 ? saveFrequencyParam.value() : UINT_MAX );
+00213 #ifdef _MSVC
+00214       std::string stmp = dirName + "\generations";
+00215 #else
+00216       std::string stmp = dirName + "/generations";
+00217 #endif
+00218       eoCountedStateSaver *stateSaver1 = new eoCountedStateSaver(freq, _state, stmp);
+00219       _state.storeFunctor(stateSaver1);
+00220     checkpoint.add(*stateSaver1);
+00221     }
+00222 
+00223     // save state every T seconds
+00224     eoValueParam<unsigned>& saveTimeIntervalParam
+00225         = _parser.getORcreateParam(unsigned(0), "saveTimeInterval",
+00226                                    "Save every T seconds (0 or absent = never)", '\0',"Persistence" );
+00227     if (_parser.isItThere(saveTimeIntervalParam) && saveTimeIntervalParam.value()>0)
+00228     {
+00229       // first make sure dirName is OK
+00230       if (! dirOK )
+00231         dirOK = testDirRes(dirName, eraseParam.value()); // TRUE
+00232 
+00233 #ifdef _MSVC
+00234       std::string stmp = dirName + "\time";
+00235 #else
+00236       std::string stmp = dirName + "/time";
+00237 #endif
+00238       eoTimedStateSaver *stateSaver2 = new eoTimedStateSaver(saveTimeIntervalParam.value(), _state, stmp);
+00239       _state.storeFunctor(stateSaver2);
+00240       checkpoint.add(*stateSaver2);
+00241     }
+00242 
+00243     // and that's it for the (control and) output
+00244     return checkpoint;
+00245 }
+00246 
+00247 #endif
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__checkpoint__real_8cpp-source.html b/trunk/paradiseo-eo/doc/html/make__checkpoint__real_8cpp-source.html new file mode 100644 index 000000000..def6f3c96 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__checkpoint__real_8cpp-source.html @@ -0,0 +1,63 @@ + + +EO: make_checkpoint_real.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

make_checkpoint_real.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_checkpoint_real.cpp
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifdef _MSC_VER
+00028 // to avoid long name warnings
+00029 #pragma warning(disable:4786)
+00030 #endif 
+00031 
+00043 // The templatized code
+00044 #include <do/make_checkpoint.h>
+00045 // the instanciating EOType
+00046 #include <es/eoReal.h>
+00047 
+00049 
+00050 // checkpoint
+00052 eoCheckPoint<eoReal<double> >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoReal<double> >& _eval, eoContinue<eoReal<double> >& _continue)
+00053 {
+00054   return do_make_checkpoint(_parser, _state, _eval, _continue);
+00055 }
+00056 eoCheckPoint<eoReal<eoMinimizingFitness> >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoReal<eoMinimizingFitness> >& _eval, eoContinue<eoReal<eoMinimizingFitness> >& _continue) 
+00057 {
+00058   return do_make_checkpoint(_parser, _state, _eval, _continue);
+00059 }
+00060 
+00061 
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__continue_8h-source.html b/trunk/paradiseo-eo/doc/html/make__continue_8h-source.html new file mode 100644 index 000000000..5473c2ec1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__continue_8h-source.html @@ -0,0 +1,173 @@ + + +EO: make_continue.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / do
+

make_continue.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_continue.h
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2000
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _make_continue_h
+00028 #define _make_continue_h
+00029 
+00030 /*
+00031 Contains the templatized version of parser-based choice of stopping criterion
+00032 It can then be instantiated, and compiled on its own for a given EOType
+00033 (see e.g. in dir ga, ga.cpp)
+00034 */
+00035 
+00036 // Continuators - all include eoContinue.h
+00037 #include <eoCombinedContinue.h>
+00038 #include <eoGenContinue.h>
+00039 #include <eoSteadyFitContinue.h>
+00040 #include <eoEvalContinue.h>
+00041 #include <eoFitContinue.h>
+00042 #ifndef _MSC_VER
+00043 #include <eoCtrlCContinue.h>  // CtrlC handling (using 2 global variables!)
+00044 #endif
+00045 
+00046   // also need the parser and param includes
+00047 #include <utils/eoParser.h>
+00048 #include <utils/eoState.h>
+00049 
+00050 
+00052 template <class Indi>
+00053 eoCombinedContinue<Indi> * make_combinedContinue(eoCombinedContinue<Indi> *_combined, eoContinue<Indi> *_cont)
+00054 {
+00055   if (_combined)                   // already exists
+00056     _combined->add(*_cont);
+00057   else
+00058     _combined = new eoCombinedContinue<Indi>(*_cont);
+00059   return _combined;
+00060 }
+00061 
+00062 template <class Indi>
+00063 eoContinue<Indi> & do_make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<Indi> & _eval)
+00064 {
+00066   // the combined continue - to be filled
+00067   eoCombinedContinue<Indi> *continuator = NULL;
+00068 
+00069   // for each possible criterion, check if wanted, otherwise do nothing
+00070 
+00071   // First the eoGenContinue - need a default value so you can run blind
+00072   // but we also need to be able to avoid it <--> 0
+00073   eoValueParam<unsigned>& maxGenParam = _parser.getORcreateParam(unsigned(100), "maxGen", "Maximum number of generations () = none)",'G',"Stopping criterion");
+00074 
+00075     if (maxGenParam.value()) // positive: -> define and store
+00076       {
+00077         eoGenContinue<Indi> *genCont = new eoGenContinue<Indi>(maxGenParam.value());
+00078         _state.storeFunctor(genCont);
+00079         // and "add" to combined
+00080         continuator = make_combinedContinue<Indi>(continuator, genCont);
+00081       }
+00082 
+00083   // the steadyGen continue - only if user imput
+00084   eoValueParam<unsigned>& steadyGenParam = _parser.createParam(unsigned(100), "steadyGen", "Number of generations with no improvement",'s', "Stopping criterion");
+00085   eoValueParam<unsigned>& minGenParam = _parser.createParam(unsigned(0), "minGen", "Minimum number of generations",'g', "Stopping criterion");
+00086     if (_parser.isItThere(steadyGenParam))
+00087       {
+00088         eoSteadyFitContinue<Indi> *steadyCont = new eoSteadyFitContinue<Indi>
+00089           (minGenParam.value(), steadyGenParam.value());
+00090         // store
+00091         _state.storeFunctor(steadyCont);
+00092         // add to combinedContinue
+00093         continuator = make_combinedContinue<Indi>(continuator, steadyCont);
+00094       }
+00095 
+00096   // Same thing with Eval - but here default value is 0
+00097   eoValueParam<unsigned long>& maxEvalParam
+00098       = _parser.getORcreateParam((unsigned long)0, "maxEval",
+00099                                  "Maximum number of evaluations (0 = none)",
+00100                                  'E', "Stopping criterion");
+00101 
+00102     if (maxEvalParam.value()) // positive: -> define and store
+00103       {
+00104         eoEvalContinue<Indi> *evalCont = new eoEvalContinue<Indi>(_eval, maxEvalParam.value());
+00105         _state.storeFunctor(evalCont);
+00106         // and "add" to combined
+00107         continuator = make_combinedContinue<Indi>(continuator, evalCont);
+00108       }
+00109     /*
+00110   // the steadyEval continue - only if user imput
+00111   eoValueParam<unsigned>& steadyGenParam = _parser.createParam(unsigned(100), "steadyGen", "Number of generations with no improvement",'s', "Stopping criterion");
+00112   eoValueParam<unsigned>& minGenParam = _parser.createParam(unsigned(0), "minGen", "Minimum number of generations",'g', "Stopping criterion");
+00113     if (_parser.isItThere(steadyGenParam))
+00114       {
+00115         eoSteadyGenContinue<Indi> *steadyCont = new eoSteadyFitContinue<Indi>
+00116           (minGenParam.value(), steadyGenParam.value());
+00117         // store
+00118         _state.storeFunctor(steadyCont);
+00119         // add to combinedContinue
+00120         continuator = make_combinedContinue<Indi>(continuator, steadyCont);
+00121       }
+00122     */
+00123     // the target fitness
+00124     eoFitContinue<Indi> *fitCont;
+00125     eoValueParam<double>& targetFitnessParam = _parser.createParam(double(0.0), "targetFitness", "Stop when fitness reaches",'T', "Stopping criterion");
+00126     if (_parser.isItThere(targetFitnessParam))
+00127       {
+00128         fitCont = new eoFitContinue<Indi>
+00129           (targetFitnessParam.value());
+00130         // store
+00131         _state.storeFunctor(fitCont);
+00132         // add to combinedContinue
+00133         continuator = make_combinedContinue<Indi>(continuator, fitCont);
+00134       }
+00135 
+00136 #ifndef _MSC_VER
+00137     // the CtrlC interception (Linux only I'm afraid)
+00138     eoCtrlCContinue<Indi> *ctrlCCont;
+00139     eoValueParam<bool>& ctrlCParam = _parser.createParam(false, "CtrlC", "Terminate current generation upon Ctrl C",'C', "Stopping criterion");
+00140     if (ctrlCParam.value())
+00141       {
+00142         ctrlCCont = new eoCtrlCContinue<Indi>;
+00143         // store
+00144         _state.storeFunctor(ctrlCCont);
+00145         // add to combinedContinue
+00146         continuator = make_combinedContinue<Indi>(continuator, ctrlCCont);
+00147       }
+00148 #endif
+00149 
+00150     // now check that there is at least one!
+00151     if (!continuator)
+00152       throw std::runtime_error("You MUST provide a stopping criterion");
+00153   // OK, it's there: store in the eoState
+00154   _state.storeFunctor(continuator);
+00155 
+00156   // and return
+00157     return *continuator;
+00158 }
+00159 
+00160 #endif
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__continue__es_8cpp-source.html b/trunk/paradiseo-eo/doc/html/make__continue__es_8cpp-source.html new file mode 100644 index 000000000..3a56adfae --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__continue__es_8cpp-source.html @@ -0,0 +1,83 @@ + + +EO: make_continue_es.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

make_continue_es.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_continue_es.cpp
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifdef _MSC_VER
+00028 // to avoid long name warnings
+00029 #pragma warning(disable:4786)
+00030 #endif 
+00031 
+00043 // The templatized code
+00044 #include <do/make_continue.h>
+00045 // the instanciating EOType(s)
+00046 #include <es/eoEsSimple.h>         // one Sigma per individual
+00047 #include <es/eoEsStdev.h>          // one sigmal per object variable
+00048 #include <es/eoEsFull.h>           // full correlation matrix per indi
+00049 
+00051 
+00052 // continue
+00054 eoContinue<eoEsSimple<double> >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoEsSimple<double> > & _eval)
+00055 {
+00056   return do_make_continue(_parser, _state, _eval);
+00057 }
+00058 eoContinue<eoEsSimple<eoMinimizingFitness> >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoEsSimple<eoMinimizingFitness> > & _eval)
+00059 {
+00060   return do_make_continue(_parser, _state, _eval);
+00061 }
+00062 
+00064 eoContinue<eoEsStdev<double> >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoEsStdev<double> > & _eval)
+00065 {
+00066   return do_make_continue(_parser, _state, _eval);
+00067 }
+00068 eoContinue<eoEsStdev<eoMinimizingFitness> >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoEsStdev<eoMinimizingFitness> > & _eval)
+00069 {
+00070   return do_make_continue(_parser, _state, _eval);
+00071 }
+00072 
+00074 eoContinue<eoEsFull<double> >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoEsFull<double> > & _eval)
+00075 {
+00076   return do_make_continue(_parser, _state, _eval);
+00077 }
+00078 eoContinue<eoEsFull<eoMinimizingFitness> >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoEsFull<eoMinimizingFitness> > & _eval)
+00079 {
+00080   return do_make_continue(_parser, _state, _eval);
+00081 }
+00082 
+00083 
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__continue__ga_8cpp-source.html b/trunk/paradiseo-eo/doc/html/make__continue__ga_8cpp-source.html new file mode 100644 index 000000000..7d5ab0e55 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__continue__ga_8cpp-source.html @@ -0,0 +1,63 @@ + + +EO: make_continue_ga.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / ga
+

make_continue_ga.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_continue_ga.cpp
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifdef _MSC_VER
+00028 // to avoid long name warnings
+00029 #pragma warning(disable:4786)
+00030 #endif 
+00031 
+00046 // The templatized code
+00047 #include <do/make_continue.h>
+00048 // the instanciating EOType
+00049 #include <ga/eoBit.h>
+00050 
+00052 
+00053 // continue
+00055 eoContinue<eoBit<double> >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoBit<double> > & _eval)
+00056 {
+00057   return do_make_continue(_parser, _state, _eval);
+00058 }
+00059 eoContinue<eoBit<eoMinimizingFitness> >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoBit<eoMinimizingFitness> > & _eval)
+00060 {
+00061   return do_make_continue(_parser, _state, _eval);
+00062 }
+00063 
+00064 
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__continue__pareto_8h-source.html b/trunk/paradiseo-eo/doc/html/make__continue__pareto_8h-source.html new file mode 100644 index 000000000..9ac8d427b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__continue__pareto_8h-source.html @@ -0,0 +1,120 @@ + + +EO: make_continue_pareto.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / do
+

make_continue_pareto.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_continue_pareto.h
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2000
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@inria.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _make_continue_pareto_h
+00028 #define _make_continue_pareto_h
+00029 
+00030 /*
+00031 Contains the templatized version of parser-based choice of stopping criterion
+00032 for Pareto optimization (e.g. no "... without improvement" criterion
+00033 It can then be instantiated, and compiled on its own for a given EOType
+00034 (see e.g. in dir ga, ga.cpp)
+00035 */
+00036 
+00037 // Continuators - all include eoContinue.h
+00038 #include <eoCombinedContinue.h>
+00039 #include <eoGenContinue.h>
+00040 #include <eoEvalContinue.h>
+00041 #include <eoFitContinue.h>
+00042 #ifndef _MSC_VER
+00043 #include <eoCtrlCContinue.h>  // CtrlC handling (using 2 global variables!)
+00044 #endif
+00045 
+00046   // also need the parser and param includes
+00047 #include <utils/eoParser.h>
+00048 #include <utils/eoState.h>
+00049 
+00050 
+00052 template <class Indi>
+00053 eoCombinedContinue<Indi> * make_combinedContinue(eoCombinedContinue<Indi> *_combined, eoContinue<Indi> *_cont)
+00054 {
+00055   if (_combined)                   // already exists
+00056     _combined->add(*_cont);
+00057   else
+00058     _combined = new eoCombinedContinue<Indi>(*_cont);
+00059   return _combined;
+00060 }
+00061 
+00063 template <class Indi>
+00064 eoContinue<Indi> & do_make_continue_pareto(eoParser& _parser, eoState& _state, eoEvalFuncCounter<Indi> & _eval)
+00065 {
+00067   // the combined continue - to be filled
+00068   eoCombinedContinue<Indi> *continuator = NULL;
+00069 
+00070   // for each possible criterion, check if wanted, otherwise do nothing
+00071 
+00072   // First the eoGenContinue - need a default value so you can run blind
+00073   // but we also need to be able to avoid it <--> 0
+00074   eoValueParam<unsigned>& maxGenParam = _parser.createParam(unsigned(100), "maxGen", "Maximum number of generations () = none)",'G',"Stopping criterion");
+00075 
+00076     if (maxGenParam.value()) // positive: -> define and store
+00077       {
+00078         eoGenContinue<Indi> *genCont = new eoGenContinue<Indi>(maxGenParam.value());
+00079         _state.storeFunctor(genCont);
+00080         // and "add" to combined
+00081         continuator = make_combinedContinue<Indi>(continuator, genCont);
+00082       }
+00083 
+00084 #ifndef _MSC_VER
+00085     // the CtrlC interception (Linux only I'm afraid)
+00086     eoCtrlCContinue<Indi> *ctrlCCont;
+00087     eoValueParam<bool>& ctrlCParam = _parser.createParam(true, "CtrlC", "Terminate current generation upon Ctrl C",'C', "Stopping criterion");
+00088     if (_parser.isItThere(ctrlCParam))
+00089       {
+00090         ctrlCCont = new eoCtrlCContinue<Indi>;
+00091         // store
+00092         _state.storeFunctor(ctrlCCont);
+00093         // add to combinedContinue
+00094         continuator = make_combinedContinue<Indi>(continuator, ctrlCCont);
+00095       }
+00096 #endif
+00097 
+00098     // now check that there is at least one!
+00099     if (!continuator)
+00100       throw std::runtime_error("You MUST provide a stopping criterion");
+00101   // OK, it's there: store in the eoState
+00102   _state.storeFunctor(continuator);
+00103 
+00104   // and return
+00105     return *continuator;
+00106 }
+00107 
+00108 #endif
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__continue__real_8cpp-source.html b/trunk/paradiseo-eo/doc/html/make__continue__real_8cpp-source.html new file mode 100644 index 000000000..2246049b9 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__continue__real_8cpp-source.html @@ -0,0 +1,63 @@ + + +EO: make_continue_real.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

make_continue_real.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_continue_real.cpp
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifdef _MSC_VER
+00028 // to avoid long name warnings
+00029 #pragma warning(disable:4786)
+00030 #endif 
+00031 
+00043 // The templatized code
+00044 #include <do/make_continue.h>
+00045 // the instanciating EOType
+00046 #include <es/eoReal.h>
+00047 
+00049 
+00050 // continue
+00052 eoContinue<eoReal<double> >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoReal<double> > & _eval)
+00053 {
+00054   return do_make_continue(_parser, _state, _eval);
+00055 }
+00056 eoContinue<eoReal<eoMinimizingFitness> >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoReal<eoMinimizingFitness> > & _eval)
+00057 {
+00058   return do_make_continue(_parser, _state, _eval);
+00059 }
+00060 
+00061 
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__es_8h-source.html b/trunk/paradiseo-eo/doc/html/make__es_8h-source.html new file mode 100644 index 000000000..70e3a09dd --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__es_8h-source.html @@ -0,0 +1,142 @@ + + +EO: make_es.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

make_es.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // es.h
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00044 #ifndef es_h
+00045 #define es_h
+00046 
+00047 #include <eoAlgo.h>
+00048 #include <eoScalarFitness.h>
+00049 #include <utils/eoParser.h>
+00050 #include <eoEvalFuncPtr.h>
+00051 #include <eoEvalFuncCounter.h>
+00052 #include <utils/eoCheckPoint.h>
+00053 #include <eoGenOp.h>
+00054 #include <eoPop.h>
+00055 #include <utils/eoDistance.h>
+00056 
+00057 #include <es/eoEsSimple.h>         // one Sigma per individual
+00058 #include <es/eoEsStdev.h>          // one sigmal per object variable
+00059 #include <es/eoEsFull.h>           // full correlation matrix per indi
+00060 
+00061 // include all similar declaration for eoReal - i.e. real-valued genotyes
+00062 // without self-adaptation
+00063 #include <es/make_real.h>
+00064 
+00065 //Representation dependent - rewrite everything anew for each representation
+00067 // the genotypes 
+00068 eoRealInitBounded<eoEsSimple<double> > & make_genotype(eoParser& _parser, eoState& _state, eoEsSimple<double> _eo);
+00069 eoRealInitBounded<eoEsSimple<eoMinimizingFitness> > & make_genotype(eoParser& _parser, eoState& _state, eoEsSimple<eoMinimizingFitness> _eo);
+00070 
+00071 eoRealInitBounded<eoEsStdev<double> > & make_genotype(eoParser& _parser, eoState& _state, eoEsStdev<double> _eo);
+00072 eoRealInitBounded<eoEsStdev<eoMinimizingFitness> > & make_genotype(eoParser& _parser, eoState& _state, eoEsStdev<eoMinimizingFitness> _eo);
+00073 
+00074 eoRealInitBounded<eoEsFull<double> > & make_genotype(eoParser& _parser, eoState& _state, eoEsFull<double> _eo);
+00075 eoRealInitBounded<eoEsFull<eoMinimizingFitness> > & make_genotype(eoParser& _parser, eoState& _state, eoEsFull<eoMinimizingFitness> _eo);
+00076 
+00077 
+00078 
+00079 // the operators
+00080 eoGenOp<eoEsSimple<double> >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded<eoEsSimple<double> >& _init);
+00081 eoGenOp<eoEsSimple<eoMinimizingFitness> >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded<eoEsSimple<eoMinimizingFitness> >& _init);
+00082 eoGenOp<eoEsStdev<double> >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded<eoEsStdev<double> >& _init);
+00083 eoGenOp<eoEsStdev<eoMinimizingFitness> >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded<eoEsStdev<eoMinimizingFitness> >& _init);
+00084 eoGenOp<eoEsFull<double> >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded<eoEsFull<double> >& _init);
+00085 eoGenOp<eoEsFull<eoMinimizingFitness> >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded<eoEsFull<eoMinimizingFitness> >& _init);
+00086 
+00087 //Representation INdependent
+00089 // you don't need to modify that part even if you use your own representation
+00090 
+00091 // init pop
+00092 eoPop<eoEsSimple<double> >&  make_pop(eoParser& _parser, eoState& _state, eoInit<eoEsSimple<double> >&);
+00093 eoPop<eoEsSimple<eoMinimizingFitness> >&  make_pop(eoParser& _parser, eoState& _state, eoInit<eoEsSimple<eoMinimizingFitness> >&);
+00094 
+00095 eoPop<eoEsStdev<double> >&  make_pop(eoParser& _parser, eoState& _state, eoInit<eoEsStdev<double> >&);
+00096 eoPop<eoEsStdev<eoMinimizingFitness> >&  make_pop(eoParser& _parser, eoState& _state, eoInit<eoEsStdev<eoMinimizingFitness> >&);
+00097 
+00098 eoPop<eoEsFull<double> >&  make_pop(eoParser& _parser, eoState& _state, eoInit<eoEsFull<double> >&);
+00099 eoPop<eoEsFull<eoMinimizingFitness> >&  make_pop(eoParser& _parser, eoState& _state, eoInit<eoEsFull<eoMinimizingFitness> >&);
+00100 
+00101 // the continue's
+00102 eoContinue<eoEsSimple<double> >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoEsSimple<double> > & _eval);
+00103 eoContinue<eoEsSimple<eoMinimizingFitness> >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoEsSimple<eoMinimizingFitness> > & _eval);
+00104 
+00105 eoContinue<eoEsStdev<double> >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoEsStdev<double> > & _eval);
+00106 eoContinue<eoEsStdev<eoMinimizingFitness> >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoEsStdev<eoMinimizingFitness> > & _eval);
+00107 
+00108 eoContinue<eoEsFull<double> >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoEsFull<double> > & _eval);
+00109 eoContinue<eoEsFull<eoMinimizingFitness> >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoEsFull<eoMinimizingFitness> > & _eval);
+00110 
+00111 // the checkpoint
+00112 eoCheckPoint<eoEsSimple<double> >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoEsSimple<double> >& _eval, eoContinue<eoEsSimple<double> >& _continue);
+00113 eoCheckPoint<eoEsSimple<eoMinimizingFitness> >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoEsSimple<eoMinimizingFitness> >& _eval, eoContinue<eoEsSimple<eoMinimizingFitness> >& _continue);
+00114 
+00115 eoCheckPoint<eoEsStdev<double> >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoEsStdev<double> >& _eval, eoContinue<eoEsStdev<double> >& _continue);
+00116 eoCheckPoint<eoEsStdev<eoMinimizingFitness> >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoEsStdev<eoMinimizingFitness> >& _eval, eoContinue<eoEsStdev<eoMinimizingFitness> >& _continue);
+00117 
+00118 eoCheckPoint<eoEsFull<double> >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoEsFull<double> >& _eval, eoContinue<eoEsFull<double> >& _continue);
+00119 eoCheckPoint<eoEsFull<eoMinimizingFitness> >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoEsFull<eoMinimizingFitness> >& _eval, eoContinue<eoEsFull<eoMinimizingFitness> >& _continue);
+00120 
+00121 
+00122 // the algo
+00123 eoAlgo<eoEsSimple<double> >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<eoEsSimple<double> >& _eval, eoContinue<eoEsSimple<double> >& _ccontinue, eoGenOp<eoEsSimple<double> >& _op, eoDistance<eoEsSimple<double> >* _dist = NULL);
+00124 eoAlgo<eoEsSimple<eoMinimizingFitness> >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<eoEsSimple<eoMinimizingFitness> >& _eval, eoContinue<eoEsSimple<eoMinimizingFitness> >& _ccontinue, eoGenOp<eoEsSimple<eoMinimizingFitness> >& _op, eoDistance<eoEsSimple<eoMinimizingFitness> >* _dist = NULL);
+00125 
+00126 eoAlgo<eoEsStdev<double> >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<eoEsStdev<double> >& _eval, eoContinue<eoEsStdev<double> >& _ccontinue, eoGenOp<eoEsStdev<double> >& _op, eoDistance<eoEsStdev<double> >* _dist = NULL);
+00127 eoAlgo<eoEsStdev<eoMinimizingFitness> >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<eoEsStdev<eoMinimizingFitness> >& _eval, eoContinue<eoEsStdev<eoMinimizingFitness> >& _ccontinue, eoGenOp<eoEsStdev<eoMinimizingFitness> >& _op, eoDistance<eoEsStdev<eoMinimizingFitness> >* _dist = NULL);
+00128 
+00129 eoAlgo<eoEsFull<double> >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<eoEsFull<double> >& _eval, eoContinue<eoEsFull<double> >& _ccontinue, eoGenOp<eoEsFull<double> >& _op, eoDistance<eoEsFull<double> >* _dist = NULL);
+00130 eoAlgo<eoEsFull<eoMinimizingFitness> >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<eoEsFull<eoMinimizingFitness> >& _eval, eoContinue<eoEsFull<eoMinimizingFitness> >& _ccontinue, eoGenOp<eoEsFull<eoMinimizingFitness> >& _op, eoDistance<eoEsFull<eoMinimizingFitness> >* _dist = NULL);
+00131 
+00132 // run
+00133 void run_ea(eoAlgo<eoEsSimple<double> >& _ga, eoPop<eoEsSimple<double> >& _pop);
+00134 void run_ea(eoAlgo<eoEsSimple<eoMinimizingFitness> >& _ga, eoPop<eoEsSimple<eoMinimizingFitness> >& _pop);
+00135 
+00136 void run_ea(eoAlgo<eoEsStdev<double> >& _ga, eoPop<eoEsStdev<double> >& _pop);
+00137 void run_ea(eoAlgo<eoEsStdev<eoMinimizingFitness> >& _ga, eoPop<eoEsStdev<eoMinimizingFitness> >& _pop);
+00138 
+00139 void run_ea(eoAlgo<eoEsFull<double> >& _ga, eoPop<eoEsFull<double> >& _pop);
+00140 void run_ea(eoAlgo<eoEsFull<eoMinimizingFitness> >& _ga, eoPop<eoEsFull<eoMinimizingFitness> >& _pop);
+00141 
+00142 // end of parameter input (+ .status + help)
+00143 // that one is not templatized, but is here for completeness
+00144 void make_help(eoParser & _parser);
+00145 
+00146 #endif
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__ga_8h-source.html b/trunk/paradiseo-eo/doc/html/make__ga_8h-source.html new file mode 100644 index 000000000..58b5cc5d1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__ga_8h-source.html @@ -0,0 +1,96 @@ + + +EO: make_ga.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / ga
+

make_ga.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // ga.h
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00038 #ifndef ga_h
+00039 #define ga_h
+00040 
+00041 #include <eoAlgo.h>
+00042 #include <eoScalarFitness.h>
+00043 #include <utils/eoParser.h>
+00044 #include <eoEvalFuncCounter.h>
+00045 #include <utils/eoCheckPoint.h>
+00046 #include <eoGenOp.h>
+00047 #include <eoPop.h>
+00048 #include <utils/eoDistance.h>
+00049 
+00050 #include <ga/eoBit.h>
+00051 
+00052 //Representation dependent - rewrite everything anew for each representation
+00054 
+00055 // the genotypes 
+00056 eoInit<eoBit<double> > & make_genotype(eoParser& _parser, eoState& _state, eoBit<double> _eo);
+00057   eoInit<eoBit<eoMinimizingFitness> > & make_genotype(eoParser& _parser, eoState& _state, eoBit<eoMinimizingFitness> _eo);
+00058 
+00059 // the operators
+00060 eoGenOp<eoBit<double> >&  make_op(eoParser& _parser, eoState& _state, eoInit<eoBit<double> >& _init);
+00061 eoGenOp<eoBit<eoMinimizingFitness> >&  make_op(eoParser& _parser, eoState& _state, eoInit<eoBit<eoMinimizingFitness> >& _init);
+00062 
+00063 //Representation INdependent
+00065 // if you use your own representation, simply change the types of templates
+00066 
+00067 // init pop
+00068 eoPop<eoBit<double> >&  make_pop(eoParser& _parser, eoState& _state, eoInit<eoBit<double> >&);
+00069 eoPop<eoBit<eoMinimizingFitness> >&  make_pop(eoParser& _parser, eoState& _state, eoInit<eoBit<eoMinimizingFitness> >&);
+00070 
+00071 // the continue's
+00072 eoContinue<eoBit<double> >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoBit<double> > & _eval);
+00073 eoContinue<eoBit<eoMinimizingFitness> >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoBit<eoMinimizingFitness> > & _eval);
+00074 
+00075 // the checkpoint
+00076 eoCheckPoint<eoBit<double> >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoBit<double> >& _eval, eoContinue<eoBit<double> >& _continue);
+00077 eoCheckPoint<eoBit<eoMinimizingFitness> >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoBit<eoMinimizingFitness> >& _eval, eoContinue<eoBit<eoMinimizingFitness> >& _continue);
+00078 
+00079 
+00080 // the algo
+00081 eoAlgo<eoBit<double> >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<eoBit<double> >& _eval, eoContinue<eoBit<double> >& _ccontinue, eoGenOp<eoBit<double> >& _op, eoDistance<eoBit<double> >* _dist = NULL);
+00082 
+00083 eoAlgo<eoBit<eoMinimizingFitness> >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<eoBit<eoMinimizingFitness> >& _eval, eoContinue<eoBit<eoMinimizingFitness> >& _ccontinue, eoGenOp<eoBit<eoMinimizingFitness> >& _op, eoDistance<eoBit<eoMinimizingFitness> >* _dist = NULL);
+00084 
+00085 // run
+00086 void run_ea(eoAlgo<eoBit<double> >& _ga, eoPop<eoBit<double> >& _pop);
+00087 void run_ea(eoAlgo<eoBit<eoMinimizingFitness> >& _ga, eoPop<eoBit<eoMinimizingFitness> >& _pop);
+00088 
+00089 // end of parameter input (+ .status + help)
+00090 // that one is not templatized
+00091 // Because of that, the source is in src/utils dir
+00092 void make_help(eoParser & _parser);
+00093 
+00094 #endif
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__general__replacement_8h-source.html b/trunk/paradiseo-eo/doc/html/make__general__replacement_8h-source.html new file mode 100644 index 000000000..c87a46138 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__general__replacement_8h-source.html @@ -0,0 +1,175 @@ + + +EO: make_general_replacement.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / do
+

make_general_replacement.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_general_replacement.h
+00005 // (c) Marc Schoenauer and Pierre Collet, 2002
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _make_general_replacement_h
+00028 #define _make_general_replacement_h
+00029 
+00030 #include <utils/eoData.h>     // for eo_is_a_rate
+00031 
+00032 // Replacement
+00033 #include <eoReduceMergeReduce.h>
+00034 
+00035 // also need the parser and param includes
+00036 #include <utils/eoParser.h>
+00037 #include <utils/eoState.h>
+00038 
+00039 
+00043 template <class EOT>
+00044 eoReduce<EOT> & decode_reduce(eoParamParamType & _ppReduce, eoState & _state)
+00045 {
+00046   unsigned int detSize;
+00047   eoReduce<EOT> * ptReduce;
+00048 
+00049   // ---------- Deterministic
+00050   if ( (_ppReduce.first == std::string("Deterministic")) || 
+00051        (_ppReduce.first == std::string("Sequential")) 
+00052        )
+00053   {
+00054     ptReduce = new eoTruncate<EOT>;
+00055   }
+00056   // ---------- EP
+00057   else if (_ppReduce.first == std::string("EP"))
+00058   {
+00059     if (!_ppReduce.second.size())   // no parameter added
+00060     {
+00061       std::cerr << "WARNING, no parameter passed to EP, using 6" << std::endl;
+00062       detSize = 6;
+00063       // put back 6 in parameter for consistency (and status file)
+00064       _ppReduce.second.push_back(std::string("6"));
+00065     }
+00066     else          // parameter passed by user as EP(T)
+00067       detSize = atoi(_ppReduce.second[0].c_str());
+00068     ptReduce = new eoEPReduce<EOT>(detSize);
+00069   }
+00070   // ---------- DetTour
+00071   else if (_ppReduce.first == std::string("DetTour"))
+00072   {
+00073     if (!_ppReduce.second.size())   // no parameter added
+00074       {
+00075         std::cerr << "WARNING, no parameter passed to DetTour, using 2" << std::endl;
+00076         detSize = 2;
+00077         // put back 2 in parameter for consistency (and status file)
+00078         _ppReduce.second.push_back(std::string("2"));
+00079       }
+00080     else          // parameter passed by user as DetTour(T)
+00081       detSize = atoi(_ppReduce.second[0].c_str());
+00082     ptReduce = new eoDetTournamentTruncate<EOT>(detSize);
+00083   }
+00084   else if (_ppReduce.first == std::string("StochTour"))
+00085     {
+00086       double p;
+00087       if (!_ppReduce.second.size())   // no parameter added
+00088         {
+00089           std::cerr << "WARNING, no parameter passed to StochTour, using 1" << std::endl;
+00090           p = 1;
+00091           // put back p in parameter for consistency (and status file)
+00092           _ppReduce.second.push_back(std::string("1"));
+00093         }
+00094       else        // parameter passed by user as DetTour(T)
+00095         {
+00096           p = atof(_ppReduce.second[0].c_str());
+00097           if ( (p<=0.5) || (p>1) )
+00098             throw std::runtime_error("Stochastic tournament size should be in [0.5,1]");
+00099         }
+00100       
+00101       ptReduce = new eoStochTournamentTruncate<EOT>(p);
+00102     }
+00103   else if ( (_ppReduce.first == std::string("Uniform")) || 
+00104             (_ppReduce.first == std::string("Random"))
+00105             )
+00106     {
+00107       ptReduce = new eoRandomReduce<EOT>;
+00108     }
+00109   else // no known reduction entered
+00110     {
+00111       throw std::runtime_error("Unknown reducer: " + _ppReduce.first);
+00112     }
+00113   // all done, stores and return a reference
+00114   _state.storeFunctor(ptReduce);
+00115   return (*ptReduce);
+00116 }
+00117 
+00134 template <class EOT>
+00135 eoReplacement<EOT> & make_general_replacement(
+00136     eoParser& _parser, eoState& _state, 
+00137     eoHowMany _elite = eoHowMany(0), 
+00138     bool _strongElitism = false,
+00139     eoHowMany _surviveParents = eoHowMany(0.0),
+00140     eoParamParamType & _reduceParentType = eoParamParamType("Deterministic"),
+00141     eoHowMany _surviveOffspring = eoHowMany(1.0),
+00142     eoParamParamType & _reduceOffspringType = eoParamParamType("Deterministic"),
+00143     eoParamParamType & _reduceFinalType  = eoParamParamType("Deterministic")
+00144         )
+00145 {
+00147   // the replacement
+00149 
+00150   // Elitism
+00151     eoHowMany elite =  _parser.createParam(_elite, "elite", "Nb of elite parents (percentage or absolute)", '\0', "Evolution Engine / Replacement").value();
+00152 
+00153     bool strongElitism = _parser.createParam(_strongElitism,"eliteType", "Strong (true) or weak (false) elitism (set elite to 0 for none)", '\0', "Evolution Engine / Replacement").value();
+00154 
+00155   // reduce the parents
+00156     eoHowMany surviveParents =  _parser.createParam(_surviveParents, "surviveParents", "Nb of surviving parents (percentage or absolute)", '\0', "Evolution Engine / Replacement").value();
+00157   
+00158   eoParamParamType & reduceParentType = _parser.createParam(_reduceParentType, "reduceParents", "Parents reducer: Deterministic, EP(T), DetTour(T), StochTour(t), Uniform", '\0', "Evolution Engine / Replacement").value();
+00159 
+00160   eoReduce<EOT> & reduceParent = decode_reduce<EOT>(reduceParentType, _state);
+00161 
+00162   // reduce the offspring
+00163     eoHowMany surviveOffspring =  _parser.createParam(_surviveOffspring, "surviveOffspring", "Nb of surviving offspring (percentage or absolute)", '\0', "Evolution Engine / Replacement").value();
+00164   
+00165   eoParamParamType & reduceOffspringType = _parser.createParam(_reduceOffspringType, "reduceOffspring", "Offspring reducer: Deterministic, EP(T), DetTour(T), StochTour(t), Uniform", '\0', "Evolution Engine / Replacement").value();
+00166 
+00167   eoReduce<EOT> & reduceOffspring = decode_reduce<EOT>(reduceOffspringType, _state);
+00168 
+00169   eoParamParamType & reduceFinalType = _parser.createParam(_reduceFinalType, "reduceFinal", "Final reducer: Deterministic, EP(T), DetTour(T), StochTour(t), Uniform", '\0', "Evolution Engine / Replacement").value();
+00170 
+00171   eoReduce<EOT> & reduceFinal = decode_reduce<EOT>(reduceFinalType, _state);
+00172 
+00173   // now the replacement itself
+00174   eoReduceMergeReduce<EOT> *ptReplace = new eoReduceMergeReduce<EOT>(elite, strongElitism, surviveParents, reduceParent, surviveOffspring, reduceOffspring, reduceFinal);
+00175   _state.storeFunctor(ptReplace);
+00176 
+00177   // that's it!
+00178   return *ptReplace;
+00179 }
+00180 
+00181 #endif
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__genotype___my_struct_8h-source.html b/trunk/paradiseo-eo/doc/html/make__genotype___my_struct_8h-source.html new file mode 100644 index 000000000..938997ac7 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__genotype___my_struct_8h-source.html @@ -0,0 +1,88 @@ + + +EO: make_genotype_MyStruct.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Templates
+

make_genotype_MyStruct.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_genotype.h
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _make_genotype_h
+00028 #define _make_genotype_h
+00029 
+00030 #include <eoMyStruct.h>
+00031 #include <eoMyStructInit.h>
+00032   // also need the parser and param includes
+00033 #include <utils/eoParser.h>
+00034 #include <utils/eoState.h>
+00035 
+00036 
+00037 /*
+00038  * This fuction does the create an eoInit<eoMyStruct>
+00039  *
+00040  * It could be here tempatized only on the fitness, as it can be used 
+00041  * to evolve structures with any fitness.
+00042  * However, for consistency reasons, it was finally chosen, as in 
+00043  * the rest of EO, to templatize by the full EOT, as this eventually 
+00044  * allows to choose the type of genotype at run time (see in es dir)
+00045  *
+00046  * It returns an eoInit<EOT> that can later be used to initialize 
+00047  * the population (see make_pop.h).
+00048  *
+00049  * It uses a parser (to get user parameters) and a state (to store the memory)
+00050  * the last argument is to disambiguate the call upon different instanciations.
+00051  *
+00052  * WARNING: that last argument will generally be the result of calling 
+00053  *          the default ctor of EOT, resulting in most cases in an EOT 
+00054  *          that is ***not properly initialized***
+00055 */
+00056 
+00057 template <class EOT>
+00058 eoInit<EOT> & do_make_genotype(eoParser& _parser, eoState& _state, EOT)
+00059 {
+00060   // read any useful parameter here from the parser 
+00061   // the param itself will belong to the parser (as far as memory is concerned)
+00062 
+00063   //    paramType & param = _parser.createParam(deafultValue, "Keyword", "Comment to appear in help and status", 'c',"Section of status file").value();
+00064 
+00065   // Then built the initializer - a pointer, stored in the eoState
+00066   eoInit<EOT>* init = new eoMyStructInit<EOT> /* ( param ) */ ;
+00067   // store in state
+00068   _state.storeFunctor(init);
+00069   // and return a reference
+00070   return *init;
+00071 }
+00072 
+00073 #endif
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__genotype___one_max_8h-source.html b/trunk/paradiseo-eo/doc/html/make__genotype___one_max_8h-source.html new file mode 100644 index 000000000..8dff01d1c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__genotype___one_max_8h-source.html @@ -0,0 +1,90 @@ + + +EO: make_genotype_OneMax.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Lesson5
+

make_genotype_OneMax.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_genotype.h
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _make_genotype_h
+00028 #define _make_genotype_h
+00029 
+00030 #include <eoOneMax.h>
+00031 #include <eoOneMaxInit.h>
+00032   // also need the parser and param includes
+00033 #include <utils/eoParser.h>
+00034 #include <utils/eoState.h>
+00035 
+00036 
+00037 /*
+00038  * This fuction does the create an eoInit<eoOneMax>
+00039  *
+00040  * It could be here tempatized only on the fitness, as it can be used 
+00041  * to evolve structures with any fitness.
+00042  * However, for consistency reasons, it was finally chosen, as in 
+00043  * the rest of EO, to templatize by the full EOT, as this eventually 
+00044  * allows to choose the type of genotype at run time (see in es dir)
+00045  *
+00046  * It returns an eoInit<EOT> that can later be used to initialize 
+00047  * the population (see make_pop.h).
+00048  *
+00049  * It uses a parser (to get user parameters) and a state (to store the memory)
+00050  * the last argument is to disambiguate the call upon different instanciations.
+00051  *
+00052  * WARNING: that last argument will generally be the result of calling 
+00053  *          the default ctor of EOT, resulting in most cases in an EOT 
+00054  *          that is ***not properly initialized***
+00055 */
+00056 
+00057 template <class EOT>
+00058 eoInit<EOT> & do_make_genotype(eoParameterLoader& _parser, eoState& _state, EOT)
+00059 {
+00060   // read any useful parameter here from the parser 
+00061   // the param itself will belong to the parser (as far as memory is concerned)
+00062 
+00063   //    paramType & param = _parser.createParam(deafultValue, "Keyword", "Comment to appear in help and status", 'c',"Section of status file").value();
+00064 
+00065   unsigned vecSize = _parser.createParam(unsigned(8), "VecSize", "Size of the bitstrings", 'v',"Representation").value();
+00066 
+00067   // Then built the initializer - a pointer, stored in the eoState
+00068   eoInit<EOT>* init = new eoOneMaxInit<EOT>(vecSize);
+00069   // store in state
+00070   _state.storeFunctor(init);
+00071   // and return a reference
+00072   return *init;
+00073 }
+00074 
+00075 #endif
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__genotype__es_8cpp-source.html b/trunk/paradiseo-eo/doc/html/make__genotype__es_8cpp-source.html new file mode 100644 index 000000000..41cea88fd --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__genotype__es_8cpp-source.html @@ -0,0 +1,108 @@ + + +EO: make_genotype_es.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

make_genotype_es.cpp

00001 /* (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00002 
+00003 This library is free software; you can redistribute it and/or modify it under
+00004 the terms of the GNU Lesser General Public License as published by the Free
+00005 Software Foundation; either version 2 of the License, or (at your option) any
+00006 later version.
+00007 
+00008 This library is distributed in the hope that it will be useful, but WITHOUT ANY
+00009 WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+00010 PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
+00011 
+00012 You should have received a copy of the GNU Lesser General Public License along
+00013 with this library; if not, write to the Free Software Foundation, Inc., 59
+00014 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+00015 
+00016 Contact: http://eodev.sourceforge.net
+00017          todos@geneura.ugr.es, http://geneura.ugr.es
+00018          Marc.Schoenauer@polytechnique.fr
+00019          mkeijzer@dhi.dk
+00020 */
+00021 
+00022 
+00023 #ifdef _MSC_VER
+00024 // to avoid long name warnings
+00025 #pragma warning(disable:4786)
+00026 #endif
+00027 
+00028 
+00056 // the templatized code (same for real and es here)
+00057 #include <es/make_genotype_real.h>
+00058 
+00059 
+00061 eoRealInitBounded<eoEsSimple<double> >& make_genotype(eoParser& _parser,
+00062                                                       eoState& _state,
+00063                                                       eoEsSimple<double> _eo)
+00064 {
+00065     return do_make_genotype(_parser, _state, _eo);
+00066 }
+00067 
+00068 
+00069 
+00070 eoRealInitBounded<eoEsSimple<eoMinimizingFitness> >& make_genotype(eoParser& _parser,
+00071                                                                    eoState& _state,
+00072                                                                    eoEsSimple<eoMinimizingFitness> _eo)
+00073 {
+00074     return do_make_genotype(_parser, _state, _eo);
+00075 }
+00076 
+00077 
+00078 
+00079 eoRealInitBounded<eoEsStdev<double> >& make_genotype(eoParser& _parser,
+00080                                                      eoState& _state,
+00081                                                      eoEsStdev<double> _eo)
+00082 {
+00083     return do_make_genotype(_parser, _state, _eo);
+00084 }
+00085 
+00086 
+00087 
+00088 eoRealInitBounded<eoEsStdev<eoMinimizingFitness> >& make_genotype(eoParser& _parser,
+00089                                                                   eoState& _state,
+00090                                                                   eoEsStdev<eoMinimizingFitness> _eo)
+00091 {
+00092     return do_make_genotype(_parser, _state, _eo);
+00093 }
+00094 
+00095 
+00096 
+00097 eoRealInitBounded<eoEsFull<double> > & make_genotype(eoParser& _parser,
+00098                                                      eoState& _state,
+00099                                                      eoEsFull<double> _eo)
+00100 {
+00101     return do_make_genotype(_parser, _state, _eo);
+00102 }
+00103 
+00104 
+00105 
+00106 eoRealInitBounded<eoEsFull<eoMinimizingFitness> >& make_genotype(eoParser& _parser,
+00107                                                                  eoState& _state,
+00108                                                                  eoEsFull<eoMinimizingFitness> _eo)
+00109 {
+00110     return do_make_genotype(_parser, _state, _eo);
+00111 }
+00112 
+00113 
+00114 
+00115 
+00116 // Local Variables:
+00117 // coding: iso-8859-1
+00118 // c-file-style: "Stroustrup"
+00119 // comment-column: 35
+00120 // fill-column: 80
+00121 // End:
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__genotype__ga_8cpp-source.html b/trunk/paradiseo-eo/doc/html/make__genotype__ga_8cpp-source.html new file mode 100644 index 000000000..c0274b5c0 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__genotype__ga_8cpp-source.html @@ -0,0 +1,58 @@ + + +EO: make_genotype_ga.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / ga
+

make_genotype_ga.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_genotype_ga.cpp
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifdef _MSC_VER
+00028 // to avoid long name warnings
+00029 #pragma warning(disable:4786)
+00030 #endif 
+00031 
+00043 // the templatized code
+00044 #include <ga/make_genotype_ga.h>
+00045 
+00047 
+00048 eoInit<eoBit<double> > & make_genotype(eoParser& _parser, eoState& _state, eoBit<double> _eo)
+00049 {
+00050   return do_make_genotype(_parser, _state, _eo);
+00051 }
+00052 eoInit<eoBit<eoMinimizingFitness> > & make_genotype(eoParser& _parser, eoState& _state, eoBit<eoMinimizingFitness> _eo)
+00053 {
+00054   return do_make_genotype(_parser, _state, _eo);
+00055 }
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__genotype__ga_8h-source.html b/trunk/paradiseo-eo/doc/html/make__genotype__ga_8h-source.html new file mode 100644 index 000000000..e6f7a9d37 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__genotype__ga_8h-source.html @@ -0,0 +1,91 @@ + + +EO: make_genotype_ga.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / ga
+

make_genotype_ga.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_genotype.h
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _make_genotype_h
+00028 #define _make_genotype_h
+00029 
+00030 #include <ga/eoBit.h>
+00031 #include <eoInit.h>
+00032   // also need the parser and param includes
+00033 #include <utils/eoParser.h>
+00034 #include <utils/eoState.h>
+00035 
+00036 
+00038 /*
+00039  * This fuction does the initialization of what's needed for a particular 
+00040  * genotype (here, bitstrings).
+00041  * It could be here tempatied only on the fitness, as it can be used to evolve 
+00042  * bitstrings with any fitness.
+00043  * However, for consistency reasons, it was finally chosen, as in 
+00044  * the rest of EO, to templatize by the full EOT, as this eventually 
+00045  * allows to choose the type of genotype at run time (see in es dir)
+00046  *
+00047  * It is instanciated in ga/ga.cpp - and incorporated in the ga/libga.a
+00048  *
+00049  * It returns an eoInit<eoBit<FitT> > tha can later be used to initialize 
+00050  * the population (see make_pop.h).
+00051  *
+00052  * It uses a parser (to get user parameters) and a state (to store the memory)
+00053  * the last argument is to disambiguate the call upon different instanciations.
+00054  *
+00055  * WARNING: that last argument will generally be the result of calling 
+00056  *          the default ctor of EOT, resulting in most cases in an EOT 
+00057  *          that is ***not properly initialized***
+00058 */
+00059 
+00060 template <class EOT>
+00061 eoInit<EOT> & do_make_genotype(eoParser& _parser, eoState& _state, EOT)
+00062 {
+00063   // for bitstring, only thing needed is the size
+00064   // but it might have been already read in the definition fo the performance
+00065   unsigned theSize = _parser.getORcreateParam(unsigned(10), "chromSize", "The length of the bitstrings", 'n',"Problem").value();
+00066 
+00067   // Then we can built a bitstring random initializer
+00068   // based on boolean_generator class (see utils/rnd_generator.h)
+00069   eoBooleanGenerator * gen = new eoBooleanGenerator;
+00070   _state.storeFunctor(gen);
+00071   eoInitFixedLength<EOT>* init = new eoInitFixedLength<EOT>(theSize, *gen);
+00072   // store in state
+00073   _state.storeFunctor(init);
+00074   return *init;
+00075 }
+00076 
+00077 #endif
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__genotype__real_8cpp-source.html b/trunk/paradiseo-eo/doc/html/make__genotype__real_8cpp-source.html new file mode 100644 index 000000000..92b9fdcd4 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__genotype__real_8cpp-source.html @@ -0,0 +1,64 @@ + + +EO: make_genotype_real.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

make_genotype_real.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_genotype_real.cpp
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifdef _MSC_VER
+00028 // to avoid long name warnings
+00029 #pragma warning(disable:4786)
+00030 #endif
+00031 
+00055 // the templatized code
+00056 #include <es/make_genotype_real.h>
+00057 
+00059 eoRealInitBounded<eoReal<double> > & make_genotype(eoParser& _parser,
+00060                                                    eoState& _state,
+00061                                                    eoReal<double> _eo)
+00062 {
+00063     return do_make_genotype(_parser, _state, _eo);
+00064 }
+00065 
+00066 
+00067 
+00068 eoRealInitBounded<eoReal<eoMinimizingFitness> > & make_genotype(eoParser& _parser,
+00069                                                                 eoState& _state,
+00070                                                                 eoReal<eoMinimizingFitness> _eo)
+00071 {
+00072     return do_make_genotype(_parser, _state, _eo);
+00073 }
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__genotype__real_8h-source.html b/trunk/paradiseo-eo/doc/html/make__genotype__real_8h-source.html new file mode 100644 index 000000000..320b54bd8 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__genotype__real_8h-source.html @@ -0,0 +1,107 @@ + + +EO: make_genotype_real.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

make_genotype_real.h

00001 //-----------------------------------------------------------------------------
+00024 #ifndef EO_make_genotype_h
+00025 #define EO_make_genotype_h
+00026 
+00027 #include <iostream>
+00028 #include <sstream>
+00029 #include <vector>
+00030 
+00031 #include "es/eoReal.h"
+00032 #include "es/eoEsChromInit.h"
+00033 #include "utils/eoParser.h"
+00034 #include "utils/eoRealVectorBounds.h"
+00035 #include "utils/eoState.h"
+00036 
+00037 
+00060 template <class EOT>
+00061 eoEsChromInit<EOT> & do_make_genotype(eoParser& _parser, eoState& _state, EOT)
+00062 {
+00063     // the fitness type
+00064     typedef typename EOT::Fitness FitT;
+00065     eoEsChromInit<EOT> *init;
+00066 
+00067     // for eoReal, only thing needed is the size - but might have been created elswhere ...
+00068     eoValueParam<unsigned>& vecSize
+00069         = _parser.getORcreateParam(unsigned(10), "vecSize",
+00070                                    "The number of variables ",
+00071                                    'n',"Genotype Initialization");
+00072     // to build an eoReal Initializer, we need bounds: [-1,1] by default
+00073     eoValueParam<eoRealVectorBounds>& boundsParam
+00074         = _parser.getORcreateParam(eoRealVectorBounds(vecSize.value(), -1, 1),
+00075                                    "initBounds",
+00076                                    "Bounds for initialization (MUST be bounded)",
+00077                                    'B', "Genotype Initialization");
+00078     // now some initial value for sigmas - even if useless?
+00079     // should be used in Normal mutation
+00080     eoValueParam<std::string>& sigmaParam
+00081         = _parser.getORcreateParam(std::string("0.3"), "sigmaInit",
+00082                                    "Initial value for Sigmas (with a '%' -> scaled by the range of each variable)",
+00083                                    's',"Genotype Initialization");
+00084     // check if there is a vecSigmaInit
+00085     eoParam *vecSigmaParam = _parser.getParamWithLongName("vecSigmaInit");
+00086     if(vecSigmaParam) {
+00087         eoValueParam<std::vector<double> >& vecSigmaParam
+00088             = _parser.getORcreateParam(std::vector<double>(vecSize.value(), 0.3),
+00089                                        "vecSigmaInit", "Initial value for Sigma(s)",
+00090                                        'V',"Genotype Initialization");
+00091         init = new eoEsChromInit<EOT>(boundsParam.value(), vecSigmaParam.value());
+00092     } else {
+00093         // now some initial value for sigmas - even if useless?
+00094         // should be used in Normal mutation
+00095         eoValueParam<std::string>& sigmaParam
+00096             = _parser.getORcreateParam(std::string("0.3"), "sigmaInit",
+00097                                        "Initial value for Sigmas "
+00098                                        "(with '%' scaled by the range of each variable)",
+00099                                        's',"Genotype Initialization");
+00100         // check for %
+00101         bool to_scale = false;
+00102         size_t pos =  sigmaParam.value().find('%');
+00103         if(pos < sigmaParam.value().size())
+00104         {
+00105             //  found a % - use scaling and get rid of '%'
+00106             to_scale = true;
+00107             sigmaParam.value().resize(pos);
+00108         }
+00109         std::istringstream is(sigmaParam.value());
+00110         double sigma;
+00111         is >> sigma;
+00112         // minimum check
+00113         if(sigma < 0)
+00114             throw std::runtime_error("Negative sigma in make_genotype");
+00115         init = new eoEsChromInit<EOT>(boundsParam.value(), sigma, to_scale);
+00116         // define parameter
+00117         _parser.getORcreateParam(std::vector<double>(vecSize.value(), 0.3),
+00118                                  "vecSigmaInit", "Initial value for Sigma(s)",
+00119                                  'V',"Genotype Initialization");
+00120     }
+00121     // store in state
+00122     _state.storeFunctor(init);
+00123     return *init;
+00124 }
+00125 
+00126 #endif // EO_make_genotype_h
+00127 
+00128 
+00129 
+00130 // Local Variables:
+00131 // coding: iso-8859-1
+00132 // mode:C++
+00133 // c-file-style: "Stroustrup"
+00134 // comment-column: 35
+00135 // fill-column: 80
+00136 // End:
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__help_8cpp-source.html b/trunk/paradiseo-eo/doc/html/make__help_8cpp-source.html new file mode 100644 index 000000000..2c24c4de4 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__help_8cpp-source.html @@ -0,0 +1,107 @@ + + +EO: make_help.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

make_help.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_help.h
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 #ifdef _MSC_VER
+00027 // to avoid long name warnings
+00028 #pragma warning(disable:4786)
+00029 #endif 
+00030 
+00031 #include <utils/eoParser.h>
+00032 #include <fstream>
+00033 #include <stdexcept>
+00034 
+00035 using namespace std;
+00036 
+00047 void make_help(eoParser & _parser)
+00048 {
+00049     // name of the "status" file where all actual parameter values will be saved
+00050     string str_status = _parser.ProgramName() + ".status"; // default value
+00051     eoValueParam<string>& statusParam = _parser.createParam(str_status, "status","Status file",'\0', "Persistence" );
+00052 
+00053     // dump status file BEFORE help, so the user gets a chance to use it:
+00054     // it's probably the case where she/he needs it most!!!
+00055     // Only help parameter will not be in status file - but who cares???
+00056     if (statusParam.value() != "")
+00057       {
+00058         ofstream os(statusParam.value().c_str());
+00059         os << _parser;          // and you can use that file as parameter file
+00060       }
+00061    // do the following AFTER ALL PARAMETERS HAVE BEEN PROCESSED
+00062    // i.e. in case you need parameters somewhere else, postpone these
+00063     if (_parser.userNeedsHelp())
+00064       {
+00065         _parser.printHelp(cout);
+00066         cout << "You can use an edited copy of file " << statusParam.value() 
+00067              << " as parameter file" << endl;
+00068         exit(1);
+00069       }
+00070 }
+00071 
+00079 bool testDirRes(std::string _dirName, bool _erase=true)
+00080 {
+00081   string s = "test -d " + _dirName;
+00082   int res = system(s.c_str());
+00083   // test for (unlikely) errors
+00084   if ( (res==-1) || (res==127) )
+00085     {
+00086       s = "Problem executing test of dir " + _dirName;
+00087       throw runtime_error(s);
+00088     }
+00089   // now make sure there is a dir without any file in it - or quit
+00090   if (res)                    // no dir present
+00091     {
+00092       s = string("mkdir ")+ _dirName;
+00093       system(s.c_str());
+00094       return true;
+00095     }
+00096   //  else
+00097   if (_erase)                      // OK to erase
+00098     {
+00099       s = string("/bin/rm ")+ _dirName + "/*";
+00100       system(s.c_str());
+00101       return true;
+00102     }
+00103   //else
+00104   // WARNING: bug if dir exists and is empty; this says it is not!
+00105   // shoudl use scandir instead - no time now :-(((    MS Aug. 01
+00106   s = "Dir " + _dirName + " is not empty";
+00107   throw runtime_error(s);
+00108   return true;
+00109 }
+
Generated on Thu Oct 19 05:06:40 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__op___my_struct_8h-source.html b/trunk/paradiseo-eo/doc/html/make__op___my_struct_8h-source.html new file mode 100644 index 000000000..151d29fa5 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__op___my_struct_8h-source.html @@ -0,0 +1,211 @@ + + +EO: make_op_MyStruct.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Templates
+

make_op_MyStruct.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_op_MyStruct.h
+00005 // (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _make_op_MyStruct_h
+00028 #define _make_op_MyStruct_h
+00029 
+00030 // the operators
+00031 #include <eoOp.h>
+00032 #include <eoGenOp.h>
+00033 #include <eoCloneOps.h>
+00034 #include <eoOpContainer.h>
+00035 // combinations of simple eoOps (eoMonOp and eoQuadOp)
+00036 #include <eoProportionalCombinedOp.h>
+00037 
+00041 #include "eoMyStructMutation.h"
+00042 
+00048 // #include "eoMyStructBinOp.h"
+00049 // OR
+00050 #include "eoMyStructQuadCrossover.h"
+00051 
+00052   // also need the parser and state includes
+00053 #include <utils/eoParser.h>
+00054 #include <utils/eoState.h>
+00055 
+00056 
+00058 // canonical (crossover + mutation) only at the moment //
+00059 
+00060 /*
+00061  * This function builds the operators that will be applied to the eoMyStruct
+00062  *
+00063  * It uses a parser (to get user parameters), a state (to store the memory)
+00064  *    the last parameter is an eoInit: if some operator needs some info 
+00065  *    about the genotypes, the init has it all (e.g. bounds, ...)
+00066  *    Simply do 
+00067  *        EOT myEO;
+00068  *        _init(myEO);
+00069  *    and myEO is then an ACTUAL object
+00070  *
+00071  * As usual, the template is the complete EOT even though only the fitness
+00072  * is actually templatized here: the following only applies to eoMyStruct
+00073 */
+00074 
+00075 template <class EOT>
+00076 eoGenOp<EOT> & do_make_op(eoParameterLoader& _parser, eoState& _state, eoInit<EOT>& _init)
+00077 {
+00078   // this is a temporary version, while Maarten codes the full tree-structured
+00079   // general operator input
+00080   // BTW we must leave that simple version available somehow, as it is the one
+00081   // that 90% people use!
+00082 
+00083 
+00085     // Variation operators
+00087     // read crossover and mutations, combine each in a proportional Op
+00088     // and create the eoGenOp that calls crossover at rate pCross 
+00089     // then mutation with rate pMut
+00090 
+00091     // the crossovers
+00093 
+00094     // here we can have eoQuadOp (2->2) only - no time for the eoBinOp case
+00095 
+00096     // you can have more than one - combined in a proportional way
+00097     
+00098     // first, define the crossover objects and read their rates from the parser
+00099     
+00100     // A first crossover   
+00101     eoQuadOp<Indi> *cross = new eoMyStructQuadCrossover<Indi> /* (varType  _anyVariable) */;
+00102     // store in the state
+00103     _state.storeFunctor(cross);
+00104 
+00105   // read its relative rate in the combination
+00106     double cross1Rate = _parser.createParam(1.0, "cross1Rate", "Relative rate for crossover 1", '1', "Variation Operators").value();
+00107 
+00108   // and create the combined operator with this one
+00109   eoPropCombinedQuadOp<Indi> *propXover = 
+00110     new eoPropCombinedQuadOp<Indi>(*cross, cross1Rate);
+00111   // and of course stor it in the state
+00112     _state.storeFunctor(propXover);
+00113 
+00114 
+00115     // Optional: A second(and third, and ...)  crossover   
+00116     //   of course you must create the corresponding classes
+00117     // and all ***MUST*** derive from eoQuadOp<Indi>
+00118 
+00119   /* Uncomment if necessary - and replicate as many time as you need
+00120       cross = new eoMyStructSecondCrossover<Indi>(varType  _anyVariable); 
+00121       _state.storeFunctor(cross);
+00122       double cross2Rate = _parser.createParam(1.0, "cross2Rate", "Relative rate for crossover 2", '2', "Variation Operators").value(); 
+00123       propXover.add(*cross, cross2Rate); 
+00124   */
+00125   // if you want some gentle output, the last one shoudl be like
+00126   //  propXover.add(*cross, crossXXXRate, true);
+00127 
+00128 
+00129   // the mutation: same story
+00131   // you can have more than one - combined in a proportional way
+00132 
+00133   // for each mutation, 
+00134   // - define the mutator object
+00135   // - read its rate from the parser
+00136   // - add it to the proportional combination
+00137 
+00138   // a first mutation  
+00139   eoMonOp<Indi> *mut = new eoMyStructMutation<Indi>/* (varType  _anyVariable) */;
+00140   _state.storeFunctor(mut);
+00141   // its relative rate in the combination
+00142   double mut1Rate = _parser.createParam(1.0, "mut1Rate", "Relative rate for mutation 1", '1', "Variation Operators").value();
+00143   // and the creation of the combined operator with this one
+00144   eoPropCombinedMonOp<Indi> *propMutation = new eoPropCombinedMonOp<Indi>(*mut, mut1Rate);
+00145   _state.storeFunctor(propMutation);
+00146 
+00147     // Optional: A second(and third, and ...)  mutation with their rates
+00148     //   of course you must create the corresponding classes
+00149     // and all ***MUST*** derive from eoMonOp<Indi>
+00150 
+00151   /* Uncomment if necessary - and replicate as many time as you need
+00152       mut = new eoMyStructSecondMutation<Indi>(varType  _anyVariable);
+00153       _state.storeFunctor(mut);
+00154       double mut2Rate = _parser.createParam(1.0, "mut2Rate", "Relative rate for mutation 2", '2', "Variation Operators").value(); 
+00155        propMutation.add(*mut, mut2Rate); 
+00156   */
+00157   // if you want some gentle output, the last one shoudl be like
+00158   //  propMutation.add(*mut, mutXXXRate, true);
+00159 
+00160   // end of crossover and mutation definitions
+00162 
+00163 // END Modify definitions of objects by eventually add parameters
+00164 //*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
+00165 
+00166 // from now on, you do not need to modify anything
+00167 // though you CAN add things to the checkpointing (see tutorial)
+00168 
+00169   // now build the eoGenOp:
+00170   // to simulate SGA (crossover with proba pCross + mutation with proba pMut
+00171   // we must construct
+00172   //     a sequential combination of
+00173   //          with proba 1, a proportional combination of 
+00174   //                        a QuadCopy and our crossover
+00175   //          with proba pMut, our mutation
+00176 
+00177   // but of course you're free to use any smart combination you could think of
+00178   // especially, if you have to use eoBinOp rather than eoQuad Op youùll have
+00179   // to modify that part
+00180 
+00181   // First read the individual level parameters
+00182     eoValueParam<double>& pCrossParam = _parser.createParam(0.6, "pCross", "Probability of Crossover", 'C', "Variation Operators" );
+00183     // minimum check
+00184     if ( (pCrossParam.value() < 0) || (pCrossParam.value() > 1) )
+00185       throw runtime_error("Invalid pCross");
+00186 
+00187     eoValueParam<double>& pMutParam = _parser.createParam(0.1, "pMut", "Probability of Mutation", 'M', "Variation Operators" );
+00188     // minimum check
+00189     if ( (pMutParam.value() < 0) || (pMutParam.value() > 1) )
+00190       throw runtime_error("Invalid pMut");
+00191 
+00192 
+00193   // the crossover - with probability pCross
+00194   eoProportionalOp<Indi> * propOp = new eoProportionalOp<Indi> ;
+00195   _state.storeFunctor(propOp);
+00196   eoQuadOp<Indi> *ptQuad = new eoQuadCloneOp<Indi>;
+00197   _state.storeFunctor(ptQuad);
+00198   propOp->add(*propXover, pCrossParam.value()); // crossover, with proba pcross
+00199   propOp->add(*ptQuad, 1-pCrossParam.value()); // nothing, with proba 1-pcross
+00200 
+00201   // now the sequential
+00202   eoSequentialOp<Indi> *op = new eoSequentialOp<Indi>;
+00203   _state.storeFunctor(op);
+00204   op->add(*propOp, 1.0);         // always do combined crossover
+00205   op->add(*propMutation, pMutParam.value()); // then mutation, with proba pmut
+00206 
+00207   // that's it - return a reference
+00208   return *op;
+00209 }
+00210 #endif
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__op___one_max_8h-source.html b/trunk/paradiseo-eo/doc/html/make__op___one_max_8h-source.html new file mode 100644 index 000000000..ea9902eee --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__op___one_max_8h-source.html @@ -0,0 +1,211 @@ + + +EO: make_op_OneMax.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+tutorial / Lesson5
+

make_op_OneMax.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_op_OneMax.h
+00005 // (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _make_op_OneMax_h
+00028 #define _make_op_OneMax_h
+00029 
+00030 // the operators
+00031 #include <eoOp.h>
+00032 #include <eoGenOp.h>
+00033 #include <eoCloneOps.h>
+00034 #include <eoOpContainer.h>
+00035 // combinations of simple eoOps (eoMonOp and eoQuadOp)
+00036 #include <eoProportionalCombinedOp.h>
+00037 
+00041 #include "eoOneMaxMutation.h"
+00042 
+00048 // #include "eoOneMaxBinOp.h"
+00049 // OR
+00050 #include "eoOneMaxQuadCrossover.h"
+00051 
+00052   // also need the parser and state includes
+00053 #include <utils/eoParser.h>
+00054 #include <utils/eoState.h>
+00055 
+00056 
+00058 // canonical (crossover + mutation) only at the moment //
+00059 
+00060 /*
+00061  * This function builds the operators that will be applied to the eoOneMax
+00062  *
+00063  * It uses a parser (to get user parameters), a state (to store the memory)
+00064  *    the last parameter is an eoInit: if some operator needs some info 
+00065  *    about the genotypes, the init has it all (e.g. bounds, ...)
+00066  *    Simply do 
+00067  *        EOT myEO;
+00068  *        _init(myEO);
+00069  *    and myEO is then an ACTUAL object
+00070  *
+00071  * As usual, the template is the complete EOT even though only the fitness
+00072  * is actually templatized here: the following only applies to eoOneMax
+00073 */
+00074 
+00075 template <class EOT>
+00076 eoGenOp<EOT> & do_make_op(eoParameterLoader& _parser, eoState& _state, eoInit<EOT>& _init)
+00077 {
+00078   // this is a temporary version, while Maarten codes the full tree-structured
+00079   // general operator input
+00080   // BTW we must leave that simple version available somehow, as it is the one
+00081   // that 90% people use!
+00082 
+00083 
+00085     // Variation operators
+00087     // read crossover and mutations, combine each in a proportional Op
+00088     // and create the eoGenOp that calls crossover at rate pCross 
+00089     // then mutation with rate pMut
+00090 
+00091     // the crossovers
+00093 
+00094     // here we can have eoQuadOp (2->2) only - no time for the eoBinOp case
+00095 
+00096     // you can have more than one - combined in a proportional way
+00097     
+00098     // first, define the crossover objects and read their rates from the parser
+00099     
+00100     // A first crossover   
+00101     eoQuadOp<Indi> *cross = new eoOneMaxQuadCrossover<Indi> /* (varType  _anyVariable) */;
+00102     // store in the state
+00103     _state.storeFunctor(cross);
+00104 
+00105   // read its relative rate in the combination
+00106     double cross1Rate = _parser.createParam(1.0, "cross1Rate", "Relative rate for crossover 1", '1', "Variation Operators").value();
+00107 
+00108   // and create the combined operator with this one
+00109   eoPropCombinedQuadOp<Indi> *propXover = 
+00110     new eoPropCombinedQuadOp<Indi>(*cross, cross1Rate);
+00111   // and of course stor it in the state
+00112     _state.storeFunctor(propXover);
+00113 
+00114 
+00115     // Optional: A second(and third, and ...)  crossover   
+00116     //   of course you must create the corresponding classes
+00117     // and all ***MUST*** derive from eoQuadOp<Indi>
+00118 
+00119   /* Uncomment if necessary - and replicate as many time as you need
+00120       cross = new eoOneMaxSecondCrossover<Indi>(varType  _anyVariable); 
+00121       _state.storeFunctor(cross);
+00122       double cross2Rate = _parser.createParam(1.0, "cross2Rate", "Relative rate for crossover 2", '2', "Variation Operators").value(); 
+00123       propXover.add(*cross, cross2Rate); 
+00124   */
+00125   // if you want some gentle output, the last one shoudl be like
+00126   //  propXover.add(*cross, crossXXXRate, true);
+00127 
+00128 
+00129   // the mutation: same story
+00131   // you can have more than one - combined in a proportional way
+00132 
+00133   // for each mutation, 
+00134   // - define the mutator object
+00135   // - read its rate from the parser
+00136   // - add it to the proportional combination
+00137 
+00138   // a first mutation  
+00139   eoMonOp<Indi> *mut = new eoOneMaxMutation<Indi>/* (varType  _anyVariable) */;
+00140   _state.storeFunctor(mut);
+00141   // its relative rate in the combination
+00142   double mut1Rate = _parser.createParam(1.0, "mut1Rate", "Relative rate for mutation 1", '1', "Variation Operators").value();
+00143   // and the creation of the combined operator with this one
+00144   eoPropCombinedMonOp<Indi> *propMutation = new eoPropCombinedMonOp<Indi>(*mut, mut1Rate);
+00145   _state.storeFunctor(propMutation);
+00146 
+00147     // Optional: A second(and third, and ...)  mutation with their rates
+00148     //   of course you must create the corresponding classes
+00149     // and all ***MUST*** derive from eoMonOp<Indi>
+00150 
+00151   /* Uncomment if necessary - and replicate as many time as you need
+00152       mut = new eoOneMaxSecondMutation<Indi>(varType  _anyVariable);
+00153       _state.storeFunctor(mut);
+00154       double mut2Rate = _parser.createParam(1.0, "mut2Rate", "Relative rate for mutation 2", '2', "Variation Operators").value(); 
+00155        propMutation.add(*mut, mut2Rate); 
+00156   */
+00157   // if you want some gentle output, the last one shoudl be like
+00158   //  propMutation.add(*mut, mutXXXRate, true);
+00159 
+00160   // end of crossover and mutation definitions
+00162 
+00163 // END Modify definitions of objects by eventually add parameters
+00164 //*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
+00165 
+00166 // from now on, you do not need to modify anything
+00167 // though you CAN add things to the checkpointing (see tutorial)
+00168 
+00169   // now build the eoGenOp:
+00170   // to simulate SGA (crossover with proba pCross + mutation with proba pMut
+00171   // we must construct
+00172   //     a sequential combination of
+00173   //          with proba 1, a proportional combination of 
+00174   //                        a QuadCopy and our crossover
+00175   //          with proba pMut, our mutation
+00176 
+00177   // but of course you're free to use any smart combination you could think of
+00178   // especially, if you have to use eoBinOp rather than eoQuad Op youùll have
+00179   // to modify that part
+00180 
+00181   // First read the individual level parameters
+00182     eoValueParam<double>& pCrossParam = _parser.createParam(0.6, "pCross", "Probability of Crossover", 'C', "Variation Operators" );
+00183     // minimum check
+00184     if ( (pCrossParam.value() < 0) || (pCrossParam.value() > 1) )
+00185       throw runtime_error("Invalid pCross");
+00186 
+00187     eoValueParam<double>& pMutParam = _parser.createParam(0.1, "pMut", "Probability of Mutation", 'M', "Variation Operators" );
+00188     // minimum check
+00189     if ( (pMutParam.value() < 0) || (pMutParam.value() > 1) )
+00190       throw runtime_error("Invalid pMut");
+00191 
+00192 
+00193   // the crossover - with probability pCross
+00194   eoProportionalOp<Indi> * propOp = new eoProportionalOp<Indi> ;
+00195   _state.storeFunctor(propOp);
+00196   eoQuadOp<Indi> *ptQuad = new eoQuadCloneOp<Indi>;
+00197   _state.storeFunctor(ptQuad);
+00198   propOp->add(*propXover, pCrossParam.value()); // crossover, with proba pcross
+00199   propOp->add(*ptQuad, 1-pCrossParam.value()); // nothing, with proba 1-pcross
+00200 
+00201   // now the sequential
+00202   eoSequentialOp<Indi> *op = new eoSequentialOp<Indi>;
+00203   _state.storeFunctor(op);
+00204   op->add(*propOp, 1.0);         // always do combined crossover
+00205   op->add(*propMutation, pMutParam.value()); // then mutation, with proba pmut
+00206 
+00207   // that's it - return a reference
+00208   return *op;
+00209 }
+00210 #endif
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__op__es_8cpp-source.html b/trunk/paradiseo-eo/doc/html/make__op__es_8cpp-source.html new file mode 100644 index 000000000..dfef3c441 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__op__es_8cpp-source.html @@ -0,0 +1,81 @@ + + +EO: make_op_es.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

make_op_es.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_op_real.cpp
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifdef _MSC_VER
+00028 // to avoid long name warnings
+00029 #pragma warning(disable:4786)
+00030 #endif 
+00031 
+00044 // Templatized code
+00045 #include <es/make_op_es.h>
+00046 
+00048 
+00049 // operators
+00051 eoGenOp<eoEsSimple<double> >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded<eoEsSimple<double> >& _init)
+00052 {
+00053   return do_make_op(_parser, _state, _init);
+00054 }
+00055 
+00056 eoGenOp<eoEsSimple<eoMinimizingFitness> >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded<eoEsSimple<eoMinimizingFitness> >& _init)
+00057 {
+00058   return do_make_op(_parser, _state, _init);
+00059 }
+00060 
+00061 eoGenOp<eoEsStdev<double> >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded<eoEsStdev<double> >& _init)
+00062 {
+00063   return do_make_op(_parser, _state, _init);
+00064 }
+00065 
+00066 eoGenOp<eoEsStdev<eoMinimizingFitness> >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded<eoEsStdev<eoMinimizingFitness> >& _init)
+00067 {
+00068   return do_make_op(_parser, _state, _init);
+00069 }
+00070 
+00071 eoGenOp<eoEsFull<double> >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded<eoEsFull<double> >& _init)
+00072 {
+00073   return do_make_op(_parser, _state, _init);
+00074 }
+00075 
+00076 eoGenOp<eoEsFull<eoMinimizingFitness> >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded<eoEsFull<eoMinimizingFitness> >& _init)
+00077 {
+00078   return do_make_op(_parser, _state, _init);
+00079 }
+00080 
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__op__es_8h-source.html b/trunk/paradiseo-eo/doc/html/make__op__es_8h-source.html new file mode 100644 index 000000000..5cd149640 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__op__es_8h-source.html @@ -0,0 +1,210 @@ + + +EO: make_op_es.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

make_op_es.h

00001 /* (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00002 
+00003 This library is free software; you can redistribute it and/or modify it under
+00004 the terms of the GNU Lesser General Public License as published by the Free
+00005 Software Foundation; either version 2 of the License, or (at your option) any
+00006 later version.
+00007 
+00008 This library is distributed in the hope that it will be useful, but WITHOUT ANY
+00009 WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+00010 PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
+00011 
+00012 You should have received a copy of the GNU Lesser General Public License along
+00013 with this library; if not, write to the Free Software Foundation, Inc., 59
+00014 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+00015 
+00016 Contact: http://eodev.sourceforge.net
+00017          todos@geneura.ugr.es, http://geneura.ugr.es
+00018          Marc.Schoenauer@polytechnique.fr
+00019          mkeijzer@dhi.dk
+00020  */
+00021 
+00022 
+00023 #ifndef EO_make_op_h
+00024 #define EO_make_op_h
+00025 
+00026 // the operators
+00027 #include <eoOp.h>
+00028 #include <eoGenOp.h>
+00029 #include <eoCloneOps.h>
+00030 #include <eoOpContainer.h>
+00031 // combinations of simple eoOps (eoMonOp and eoQuadOp)
+00032 #include <eoProportionalCombinedOp.h>
+00033 
+00034 // the specialized Real stuff
+00035 #include <es/eoReal.h>
+00036 #include <es/eoRealAtomXover.h>
+00037 #include <es/eoEsChromInit.h>
+00038 #include <es/eoEsMutationInit.h>
+00039 #include <es/eoEsMutate.h>
+00040 #include <es/eoEsGlobalXover.h>
+00041 #include <es/eoEsStandardXover.h>
+00042   // also need the parser and param includes
+00043 #include <utils/eoParser.h>
+00044 #include <utils/eoState.h>
+00045 
+00046 
+00047 /*
+00048  * This function builds the operators that will be applied to the eoReal
+00049  *
+00050  * It uses a parser (to get user parameters) and a state (to store the memory)
+00051  * the last argument is an individual, needed for 2 reasons
+00052  *     it disambiguates the call after instanciations
+00053  *     some operator might need some private information about the indis
+00054  *
+00055  * This is why the template is the complete EOT even though only the fitness
+00056  * is actually templatized here: the following only applies to bitstrings
+00057  *
+00058  * Note : the last parameter is an eoInit: if some operator needs some info
+00059  *        about the gneotypes, the init has it all (e.g. bounds, ...)
+00060  *        Simply do
+00061  *        EOT myEO;
+00062  *        _init(myEO);
+00063  *        and myEO is then an ACTUAL object
+00064 */
+00065 
+00066 template <class EOT>
+00067 eoGenOp<EOT> & do_make_op(eoParser& _parser, eoState& _state, eoRealInitBounded<EOT>& _init)
+00068 {
+00069   // get std::vector size
+00070   unsigned vecSize = _init.size();
+00071 
+00072   // First, decide whether the objective variables are bounded
+00073   eoValueParam<eoRealVectorBounds>& boundsParam
+00074       = _parser.getORcreateParam(eoRealVectorBounds(vecSize,eoDummyRealNoBounds),
+00075                                  "objectBounds", "Bounds for variables",
+00076                                  'B', "Variation Operators");
+00077 
+00078   std::cerr << boundsParam.value() << std::endl;
+00079 
+00080     // now we read Pcross and Pmut,
+00081   eoValueParam<std::string>& operatorParam
+00082       = _parser.getORcreateParam(std::string("SGA"), "operator",
+00083                                  "Description of the operator (SGA only now)",
+00084                                  'o', "Variation Operators");
+00085 
+00086   if (operatorParam.value() != std::string("SGA"))
+00087     throw std::runtime_error("Sorry, only SGA-like operator available right now\n");
+00088 
+00089     // now we read Pcross and Pmut,
+00090     // and create the eoGenOp that is exactly
+00091     // crossover with pcross + mutation with pmut
+00092 
+00093   eoValueParam<double>& pCrossParam
+00094       = _parser.getORcreateParam(1.0, "pCross", "Probability of Crossover",
+00095                                  'C', "Variation Operators" );
+00096   // minimum check
+00097   if ( (pCrossParam.value() < 0) || (pCrossParam.value() > 1) )
+00098     throw std::runtime_error("Invalid pCross");
+00099 
+00100   eoValueParam<double>& pMutParam
+00101       = _parser.getORcreateParam(1.0, "pMut", "Probability of Mutation",
+00102                                  'M', "Variation Operators" );
+00103   // minimum check
+00104   if ( (pMutParam.value() < 0) || (pMutParam.value() > 1) )
+00105     throw std::runtime_error("Invalid pMut");
+00106 
+00107 
+00108   // crossover
+00110   // ES crossover
+00111   eoValueParam<std::string>& crossTypeParam
+00112       = _parser.getORcreateParam(std::string("global"), "crossType",
+00113                                  "Type of ES recombination (global or standard)",
+00114                                  'C', "Variation Operators");
+00115 
+00116   eoValueParam<std::string>& crossObjParam
+00117       = _parser.getORcreateParam(std::string("discrete"), "crossObj",
+00118                                  "Recombination of object variables (discrete, intermediate or none)",
+00119                                  'O', "Variation Operators");
+00120   eoValueParam<std::string>& crossStdevParam
+00121       = _parser.getORcreateParam(std::string("intermediate"), "crossStdev",
+00122                                  "Recombination of mutation strategy parameters "
+00123                                  "(intermediate, discrete or none)",
+00124                                  'S', "Variation Operators");
+00125 
+00126   // The pointers: first the atom Xover
+00127   eoBinOp<double> *ptObjAtomCross = NULL;
+00128   eoBinOp<double> *ptStdevAtomCross = NULL;
+00129   // then the EOT-level one (need to be an eoGenOp as global Xover is
+00130   eoGenOp<EOT> *ptCross;
+00131 
+00132   // check for the atom Xovers
+00133   if (crossObjParam.value() == std::string("discrete"))
+00134     ptObjAtomCross = new eoDoubleExchange;
+00135   else if (crossObjParam.value() == std::string("intermediate"))
+00136     ptObjAtomCross = new eoDoubleIntermediate;
+00137   else if (crossObjParam.value() == std::string("none"))
+00138     ptObjAtomCross = new eoBinCloneOp<double>;
+00139   else throw std::runtime_error("Invalid Object variable crossover type");
+00140 
+00141   if (crossStdevParam.value() == std::string("discrete"))
+00142     ptStdevAtomCross = new eoDoubleExchange;
+00143   else if (crossStdevParam.value() == std::string("intermediate"))
+00144     ptStdevAtomCross = new eoDoubleIntermediate;
+00145   else if (crossStdevParam.value() == std::string("none"))
+00146     ptStdevAtomCross = new eoBinCloneOp<double>;
+00147   else throw std::runtime_error("Invalid mutation strategy parameter crossover type");
+00148 
+00149   // and build the indi Xover
+00150   if (crossTypeParam.value() == std::string("global"))
+00151     ptCross = new eoEsGlobalXover<EOT>(*ptObjAtomCross, *ptStdevAtomCross);
+00152   else if (crossTypeParam.value() == std::string("standard"))
+00153     {      // using a standard eoBinOp, but wrap it into an eoGenOp
+00154       eoBinOp<EOT> & crossTmp = _state.storeFunctor(
+00155              new eoEsStandardXover<EOT>(*ptObjAtomCross, *ptStdevAtomCross)
+00156              );
+00157       ptCross = new eoBinGenOp<EOT>(crossTmp);
+00158     }
+00159   else throw std::runtime_error("Invalide Object variable crossover type");
+00160 
+00161   // now that everything is OK, DON'T FORGET TO STORE MEMORY
+00162   _state.storeFunctor(ptObjAtomCross);
+00163   _state.storeFunctor(ptStdevAtomCross);
+00164   _state.storeFunctor(ptCross);
+00165 
+00166   //  mutation
+00168 
+00169   // Ok, time to set up the self-adaptive mutation
+00170   // Proxy for the mutation parameters
+00171   eoEsMutationInit mutateInit(_parser, "Variation Operators");
+00172 
+00173   eoEsMutate<EOT> & mut =  _state.storeFunctor(
+00174       new eoEsMutate<EOT>(mutateInit, boundsParam.value()));
+00175 
+00176   // now the general op - a sequential application of crossover and mutatation
+00177   // no need to first have crossover combined with a clone as it is an
+00178   // eoBinOp and not an eoQuadOp as in SGA paradigm
+00179 
+00180   eoSequentialOp<EOT> & op = _state.storeFunctor(new eoSequentialOp<EOT>);
+00181   op.add(*ptCross, pCrossParam.value());
+00182   op.add(mut, pMutParam.value());
+00183 
+00184   // that's it!
+00185   return op;
+00186 }
+00187 #endif // EO_make_op_h
+00188 
+00189 
+00190 
+00191 // Local Variables:
+00192 // coding: iso-8859-1
+00193 // mode:C++
+00194 // c-file-style: "Stroustrup"
+00195 // comment-column: 35
+00196 // fill-column: 80
+00197 // End:
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__op__ga_8cpp-source.html b/trunk/paradiseo-eo/doc/html/make__op__ga_8cpp-source.html new file mode 100644 index 000000000..8216fc75e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__op__ga_8cpp-source.html @@ -0,0 +1,61 @@ + + +EO: make_op_ga.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / ga
+

make_op_ga.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_op_ga.cpp
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifdef _MSC_VER
+00028 // to avoid long name warnings
+00029 #pragma warning(disable:4786)
+00030 #endif 
+00031 
+00046 // Templatized code
+00047 #include <ga/make_op.h>
+00048 
+00050 
+00051 // oeprators
+00053 eoGenOp<eoBit<double> >&  make_op(eoParser& _parser, eoState& _state, eoInit<eoBit<double> >& _init)
+00054 {
+00055   return do_make_op(_parser, _state, _init);
+00056 }
+00057 
+00058 eoGenOp<eoBit<eoMinimizingFitness> >&  make_op(eoParser& _parser, eoState& _state, eoInit<eoBit<eoMinimizingFitness> >& _init)
+00059 {
+00060   return do_make_op(_parser, _state, _init);
+00061 }
+00062 
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__op__real_8cpp-source.html b/trunk/paradiseo-eo/doc/html/make__op__real_8cpp-source.html new file mode 100644 index 000000000..124a5c376 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__op__real_8cpp-source.html @@ -0,0 +1,60 @@ + + +EO: make_op_real.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

make_op_real.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_op_real.cpp
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifdef _MSC_VER
+00028 // to avoid long name warnings
+00029 #pragma warning(disable:4786)
+00030 #endif 
+00031 
+00044 // Templatized code
+00045 #include <es/make_op_real.h>
+00046 
+00048 
+00049 // oeprators
+00051 eoGenOp<eoReal<double> >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded<eoReal<double> >& _init)
+00052 {
+00053   return do_make_op(_parser, _state, _init);
+00054 }
+00055 
+00056 eoGenOp<eoReal<eoMinimizingFitness> >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded<eoReal<eoMinimizingFitness> >& _init)
+00057 {
+00058   return do_make_op(_parser, _state, _init);
+00059 }
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__op__real_8h-source.html b/trunk/paradiseo-eo/doc/html/make__op__real_8h-source.html new file mode 100644 index 000000000..debecb927 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__op__real_8h-source.html @@ -0,0 +1,297 @@ + + +EO: make_op_real.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

make_op_real.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_op.h - the real-valued version
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _make_op_h
+00028 #define _make_op_h
+00029 
+00030 // the operators
+00031 #include <eoOp.h>
+00032 #include <eoGenOp.h>
+00033 #include <eoCloneOps.h>
+00034 #include <eoOpContainer.h>
+00035 // combinations of simple eoOps (eoMonOp and eoQuadOp)
+00036 #include <eoProportionalCombinedOp.h>
+00037 
+00038 // the specialized Real stuff
+00039 #include <es/eoReal.h>
+00040 #include <es/eoEsChromInit.h>
+00041 #include <es/eoRealOp.h>
+00042 #include <es/eoNormalMutation.h>
+00043   // also need the parser and param includes
+00044 #include <utils/eoParser.h>
+00045 #include <utils/eoState.h>
+00046 
+00047 
+00048 /*
+00049  * This function builds the operators that will be applied to the eoReal
+00050  *
+00051  * It uses a parser (to get user parameters) and a state (to store the memory)
+00052  * the last argument is an individual, needed for 2 reasons
+00053  *     it disambiguates the call after instanciations
+00054  *     some operator might need some private information about the indis
+00055  *
+00056  * This is why the template is the complete EOT even though only the fitness
+00057  * is actually templatized here: the following only applies to bitstrings
+00058  *
+00059  * Note : the last parameter is an eoInit: if some operator needs some info
+00060  *        about the gneotypes, the init has it all (e.g. bounds, ...)
+00061  *        Simply do
+00062  *        EOT myEO;
+00063  *        _init(myEO);
+00064  *        and myEO is then an ACTUAL object
+00065 */
+00066 
+00067 template <class EOT>
+00068 eoGenOp<EOT> & do_make_op(eoParser& _parser, eoState& _state, eoRealInitBounded<EOT>& _init)
+00069 {
+00070   // get std::vector size
+00071   unsigned vecSize = _init.size();
+00072 
+00073   // First, decide whether the objective variables are bounded
+00074   eoValueParam<eoRealVectorBounds>& boundsParam
+00075       = _parser.getORcreateParam(eoRealVectorBounds(vecSize,eoDummyRealNoBounds), "objectBounds",
+00076                                  "Bounds for variables", 'B', "Variation Operators");
+00077 
+00078   // this is a temporary version(!),
+00079   // while Maarten codes the full tree-structured general operator input
+00080   // BTW we must leave that simple version available somehow, as it is the one
+00081   // that 90% people use!
+00082   eoValueParam<std::string>& operatorParam
+00083       = _parser.getORcreateParam(std::string("SGA"), "operator",
+00084                                  "Description of the operator (SGA only now)",
+00085                                  'o', "Variation Operators");
+00086 
+00087   if (operatorParam.value() != std::string("SGA"))
+00088     throw std::runtime_error("Sorry, only SGA-like operator available right now\n");
+00089 
+00090     // now we read Pcross and Pmut,
+00091     // the relative weights for all crossovers -> proportional choice
+00092     // the relative weights for all mutations -> proportional choice
+00093     // and create the eoGenOp that is exactly
+00094     // crossover with pcross + mutation with pmut
+00095 
+00096   eoValueParam<double>& pCrossParam
+00097       = _parser.getORcreateParam(0.6, "pCross",
+00098                                  "Probability of Crossover",
+00099                                  'C', "Variation Operators" );
+00100   // minimum check
+00101   if ( (pCrossParam.value() < 0) || (pCrossParam.value() > 1) )
+00102     throw std::runtime_error("Invalid pCross");
+00103 
+00104   eoValueParam<double>& pMutParam
+00105       = _parser.getORcreateParam(0.1, "pMut",
+00106                                  "Probability of Mutation",
+00107                                  'M', "Variation Operators" );
+00108   // minimum check
+00109   if ( (pMutParam.value() < 0) || (pMutParam.value() > 1) )
+00110     throw std::runtime_error("Invalid pMut");
+00111 
+00112     // the crossovers
+00114     // the parameters
+00115   eoValueParam<double>& alphaParam
+00116       = _parser.getORcreateParam(double(0.0), "alpha",
+00117                                  "Bound for factor of linear recombinations",
+00118                                  'a', "Variation Operators" );
+00119   // minimum check
+00120   if ( (alphaParam.value() < 0) )
+00121     throw std::runtime_error("Invalid BLX coefficient alpha");
+00122 
+00123 
+00124   eoValueParam<double>& segmentRateParam
+00125       = _parser.getORcreateParam(double(1.0), "segmentRate",
+00126                                  "Relative rate for segment crossover",
+00127                                  's', "Variation Operators" );
+00128   // minimum check
+00129   if ( (segmentRateParam.value() < 0) )
+00130     throw std::runtime_error("Invalid segmentRate");
+00131 
+00132   eoValueParam<double>& hypercubeRateParam
+00133       = _parser.getORcreateParam(double(1.0), "hypercubeRate",
+00134                                  "Relative rate for hypercube crossover",
+00135                                  'A', "Variation Operators" );
+00136   // minimum check
+00137   if ( (hypercubeRateParam.value() < 0) )
+00138     throw std::runtime_error("Invalid hypercubeRate");
+00139 
+00140   eoValueParam<double>& uxoverRateParam
+00141       = _parser.getORcreateParam(double(1.0), "uxoverRate",
+00142                                  "Relative rate for uniform crossover",
+00143                                  'A', "Variation Operators" );
+00144   // minimum check
+00145   if ( (uxoverRateParam.value() < 0) )
+00146     throw std::runtime_error("Invalid uxoverRate");
+00147 
+00148     // minimum check
+00149   bool bCross = true;
+00150   if (segmentRateParam.value()+hypercubeRateParam.value()+uxoverRateParam.value()==0)
+00151     {
+00152       std::cerr << "Warning: no crossover" << std::endl;
+00153       bCross = false;
+00154     }
+00155 
+00156   // Create the CombinedQuadOp
+00157   eoPropCombinedQuadOp<EOT> *ptCombinedQuadOp = NULL;
+00158   eoQuadOp<EOT> *ptQuad = NULL;
+00159 
+00160   if (bCross)
+00161     {
+00162       // segment crossover for bitstring - pass it the bounds
+00163       ptQuad = new eoSegmentCrossover<EOT>(boundsParam.value(), alphaParam.value());
+00164       _state.storeFunctor(ptQuad);
+00165       ptCombinedQuadOp = new eoPropCombinedQuadOp<EOT>(*ptQuad, segmentRateParam.value());
+00166 
+00167         // hypercube crossover
+00168       ptQuad = new eoHypercubeCrossover<EOT>(boundsParam.value(), alphaParam.value());
+00169       _state.storeFunctor(ptQuad);
+00170       ptCombinedQuadOp->add(*ptQuad, hypercubeRateParam.value());
+00171 
+00172         // uniform crossover
+00173       ptQuad = new eoRealUXover<EOT>();
+00174       _state.storeFunctor(ptQuad);
+00175       ptCombinedQuadOp->add(*ptQuad, uxoverRateParam.value());
+00176 
+00177       // don't forget to store the CombinedQuadOp
+00178       _state.storeFunctor(ptCombinedQuadOp);
+00179     }
+00180 
+00181   // the mutations
+00183   // the parameters
+00184   eoValueParam<double> & epsilonParam
+00185       = _parser.getORcreateParam(0.01, "epsilon",
+00186                                  "Half-size of interval for Uniform Mutation",
+00187                                  'e', "Variation Operators" );
+00188   // minimum check
+00189   if ( (epsilonParam.value() < 0) )
+00190     throw std::runtime_error("Invalid epsilon");
+00191 
+00192   eoValueParam<double> & uniformMutRateParam
+00193       = _parser.getORcreateParam(1.0, "uniformMutRate",
+00194                                  "Relative rate for uniform mutation",
+00195                                  'u', "Variation Operators" );
+00196   // minimum check
+00197   if ( (uniformMutRateParam.value() < 0) )
+00198     throw std::runtime_error("Invalid uniformMutRate");
+00199 
+00200   eoValueParam<double> & detMutRateParam
+00201       = _parser.getORcreateParam(1.0, "detMutRate",
+00202                                  "Relative rate for deterministic uniform mutation",
+00203                                  'd', "Variation Operators" );
+00204   // minimum check
+00205   if ( (detMutRateParam.value() < 0) )
+00206     throw std::runtime_error("Invalid detMutRate");
+00207 
+00208   eoValueParam<double> & normalMutRateParam
+00209       = _parser.getORcreateParam(1.0, "normalMutRate",
+00210                                  "Relative rate for Gaussian mutation", 'd', "Variation Operators" );
+00211   // minimum check
+00212   if ( (normalMutRateParam.value() < 0) )
+00213     throw std::runtime_error("Invalid normalMutRate");
+00214 
+00215   eoValueParam<double> & sigmaParam
+00216       = _parser.getORcreateParam(0.3, "sigma",
+00217                                  "Sigma (fixed) for Gaussian mutation",
+00218                                  's', "Variation Operators" );
+00219 
+00220   eoValueParam<double> & pNormalParam
+00221       = _parser.getORcreateParam(1.0, "pNormal",
+00222                                  "Proba. to change each variable for Gaussian mutation",
+00223                                  's', "Variation Operators" );
+00224 
+00225     // minimum check
+00226   bool bMut = true;
+00227   if (uniformMutRateParam.value()+detMutRateParam.value()+normalMutRateParam.value()==0)
+00228     {
+00229       std::cerr << "Warning: no mutation" << std::endl;
+00230       bMut = false;
+00231     }
+00232   if (!bCross && !bMut)
+00233     throw std::runtime_error("No operator called in SGA operator definition!!!");
+00234 
+00235     // Create the CombinedMonOp
+00236   eoPropCombinedMonOp<EOT> *ptCombinedMonOp = NULL;
+00237   eoMonOp<EOT> *ptMon = NULL;
+00238 
+00239   if (bMut)
+00240     {
+00241       // uniform mutation on all components:
+00242       // offspring(i) uniformly chosen in [parent(i)-epsilon, parent(i)+epsilon]
+00243       ptMon = new eoUniformMutation<EOT>(boundsParam.value(), epsilonParam.value());
+00244       _state.storeFunctor(ptMon);
+00245       // create the CombinedMonOp
+00246       ptCombinedMonOp = new eoPropCombinedMonOp<EOT>(*ptMon, uniformMutRateParam.value());
+00247 
+00248         // mutate exactly 1 component (uniformly) per individual
+00249       ptMon = new eoDetUniformMutation<EOT>(boundsParam.value(), epsilonParam.value());
+00250       _state.storeFunctor(ptMon);
+00251       ptCombinedMonOp->add(*ptMon, detMutRateParam.value());
+00252 
+00253       // mutate all component using Gaussian mutation
+00254       ptMon = new eoNormalVecMutation<EOT>(boundsParam.value(), sigmaParam.value(), pNormalParam.value());
+00255       _state.storeFunctor(ptMon);
+00256       ptCombinedMonOp->add(*ptMon, normalMutRateParam.value());
+00257       _state.storeFunctor(ptCombinedMonOp);
+00258     }
+00259 
+00260   // now build the eoGenOp:
+00261   // to simulate SGA (crossover with proba pCross + mutation with proba pMut
+00262   // we must construct
+00263   //     a sequential combination of
+00264   //          with proba 1, a proportional combination of
+00265   //                        a QuadCopy and our crossover
+00266   //          with proba pMut, our mutation
+00267 
+00268   // the crossover - with probability pCross
+00269   eoProportionalOp<EOT> * cross = new eoProportionalOp<EOT> ;
+00270   _state.storeFunctor(cross);
+00271   ptQuad = new eoQuadCloneOp<EOT>;
+00272   _state.storeFunctor(ptQuad);
+00273   cross->add(*ptCombinedQuadOp, pCrossParam.value()); // user crossover
+00274   cross->add(*ptQuad, 1-pCrossParam.value()); // clone operator
+00275 
+00276   // now the sequential
+00277   eoSequentialOp<EOT> & op =  _state.storeFunctor(new eoSequentialOp<EOT>);
+00278   op.add(*cross, 1.0);   // always crossover (but clone with prob 1-pCross
+00279   op.add(*ptCombinedMonOp, pMutParam.value());
+00280 
+00281   // that's it!
+00282   return op;
+00283 }
+00284 #endif
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__pop_8h-source.html b/trunk/paradiseo-eo/doc/html/make__pop_8h-source.html new file mode 100644 index 000000000..d0cf9e99f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__pop_8h-source.html @@ -0,0 +1,114 @@ + + +EO: make_pop.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / do
+

make_pop.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_pop.h
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _make_pop_h
+00028 #define _make_pop_h
+00029 
+00030 #include <ctime>  // for time(0) for random seeding
+00031 #include <eoPop.h>
+00032 #include <eoInit.h>
+00033 #include <utils/eoRNG.h>
+00034 #include <utils/eoParser.h>
+00035 #include <utils/eoState.h>
+00036 
+00037 
+00039 
+00048 template <class EOT>
+00049 eoPop<EOT>&  do_make_pop(eoParser & _parser, eoState& _state, eoInit<EOT> & _init)
+00050 {
+00051   // random seed
+00052     eoValueParam<uint32_t>& seedParam = _parser.createParam(uint32_t(0), "seed", "Random number seed", 'S');
+00053     if (seedParam.value() == 0)
+00054         seedParam.value() = time(0);
+00055     eoValueParam<unsigned>& popSize = _parser.createParam(unsigned(20), "popSize", "Population Size", 'P', "Evolution Engine");
+00056 
+00057   // Either load or initialize
+00058   // create an empty pop and let the state handle the memory
+00059   eoPop<EOT>& pop = _state.takeOwnership(eoPop<EOT>());
+00060 
+00061   eoValueParam<std::string>& loadNameParam = _parser.createParam(std::string(""), "Load","A save file to restart from",'L', "Persistence" );
+00062   eoValueParam<bool> & recomputeFitnessParam = _parser.createParam(false, "recomputeFitness", "Recompute the fitness after re-loading the pop.?", 'r',  "Persistence" );
+00063 
+00064   if (loadNameParam.value() != "") // something to load
+00065     {
+00066       // create another state for reading
+00067       eoState inState;          // a state for loading - WITHOUT the parser
+00068       // register the rng and the pop in the state, so they can be loaded,
+00069       // and the present run will be the exact continuation of the saved run
+00070       // eventually with different parameters
+00071       inState.registerObject(pop);
+00072       inState.registerObject(rng);
+00073       inState.load(loadNameParam.value()); //  load the pop and the rng
+00074       // the fitness is read in the file:
+00075       // do only evaluate the pop if the fitness has changed
+00076       if (recomputeFitnessParam.value())
+00077         {
+00078           for (unsigned i=0; i<pop.size(); i++)
+00079             pop[i].invalidate();
+00080         }
+00081       if (pop.size() < popSize.value())
+00082         std::cerr << "WARNING, only " << pop.size() << " individuals read in file " << loadNameParam.value() << "\nThe remaining " << popSize.value() - pop.size() << " will be randomly drawn" << std::endl;
+00083       if (pop.size() > popSize.value())
+00084         {
+00085           std::cerr << "WARNING, Load file contained too many individuals. Only the best will be retained" << std::endl;
+00086           pop.resize(popSize.value());
+00087         }
+00088     }
+00089   else                          // nothing loaded from a file
+00090     {
+00091       rng.reseed(seedParam.value());
+00092     }
+00093 
+00094   if (pop.size() < popSize.value()) // missing some guys
+00095     {
+00096       // Init pop from the randomizer: need to use the append function
+00097       pop.append(popSize.value(), _init);
+00098     }
+00099 
+00100   // for future stateSave, register the algorithm into the state
+00101   _state.registerObject(_parser);
+00102   _state.registerObject(pop);
+00103   _state.registerObject(rng);
+00104 
+00105   return pop;
+00106 }
+00107 
+00108 #endif
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__pop__es_8cpp-source.html b/trunk/paradiseo-eo/doc/html/make__pop__es_8cpp-source.html new file mode 100644 index 000000000..80d672333 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__pop__es_8cpp-source.html @@ -0,0 +1,86 @@ + + +EO: make_pop_es.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

make_pop_es.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_pop_es.cpp
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifdef _MSC_VER
+00028 // to avoid long name warnings
+00029 #pragma warning(disable:4786)
+00030 #endif 
+00031 
+00043 // The templatized code
+00044 #include <do/make_pop.h>
+00045 // the instanciating EOType(s)
+00046 #include <es/eoEsSimple.h>         // one Sigma per individual
+00047 #include <es/eoEsStdev.h>          // one sigmal per object variable
+00048 #include <es/eoEsFull.h>           // full correlation matrix per indi
+00049 
+00051 
+00052 // Init POP
+00054 eoPop<eoEsSimple<double> >&  make_pop(eoParser& _parser, eoState& _state, eoInit<eoEsSimple<double> > & _init)
+00055 {
+00056   return do_make_pop(_parser, _state, _init);
+00057 }
+00058 
+00059 eoPop<eoEsSimple<eoMinimizingFitness> >&  make_pop(eoParser& _parser, eoState& _state, eoInit<eoEsSimple<eoMinimizingFitness> > & _init)
+00060 {
+00061   return do_make_pop(_parser, _state, _init);
+00062 }
+00063 
+00065 eoPop<eoEsStdev<double> >&  make_pop(eoParser& _parser, eoState& _state, eoInit<eoEsStdev<double> > & _init)
+00066 {
+00067   return do_make_pop(_parser, _state, _init);
+00068 }
+00069 
+00070 eoPop<eoEsStdev<eoMinimizingFitness> >&  make_pop(eoParser& _parser, eoState& _state, eoInit<eoEsStdev<eoMinimizingFitness> > & _init)
+00071 {
+00072   return do_make_pop(_parser, _state, _init);
+00073 }
+00074 
+00076 eoPop<eoEsFull<double> >&  make_pop(eoParser& _parser, eoState& _state, eoInit<eoEsFull<double> > & _init)
+00077 {
+00078   return do_make_pop(_parser, _state, _init);
+00079 }
+00080 
+00081 eoPop<eoEsFull<eoMinimizingFitness> >&  make_pop(eoParser& _parser, eoState& _state, eoInit<eoEsFull<eoMinimizingFitness> > & _init)
+00082 {
+00083   return do_make_pop(_parser, _state, _init);
+00084 }
+00085 
+00086 
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__pop__ga_8cpp-source.html b/trunk/paradiseo-eo/doc/html/make__pop__ga_8cpp-source.html new file mode 100644 index 000000000..032cfba8c --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__pop__ga_8cpp-source.html @@ -0,0 +1,64 @@ + + +EO: make_pop_ga.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / ga
+

make_pop_ga.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_pop_ga.cpp
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifdef _MSC_VER
+00028 // to avoid long name warnings
+00029 #pragma warning(disable:4786)
+00030 #endif 
+00031 
+00044 // The templatized code
+00045 #include <do/make_pop.h>
+00046 // the instanciating EOType
+00047 #include <ga/eoBit.h>
+00048 
+00050 
+00051 // Init POP
+00053 eoPop<eoBit<double> >&  make_pop(eoParser& _parser, eoState& _state, eoInit<eoBit<double> > & _init)
+00054 {
+00055   return do_make_pop(_parser, _state, _init);
+00056 }
+00057 
+00058 eoPop<eoBit<eoMinimizingFitness> >&  make_pop(eoParser& _parser, eoState& _state, eoInit<eoBit<eoMinimizingFitness> > & _init)
+00059 {
+00060   return do_make_pop(_parser, _state, _init);
+00061 }
+00062 
+00063 
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__pop__real_8cpp-source.html b/trunk/paradiseo-eo/doc/html/make__pop__real_8cpp-source.html new file mode 100644 index 000000000..170fd6708 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__pop__real_8cpp-source.html @@ -0,0 +1,64 @@ + + +EO: make_pop_real.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

make_pop_real.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_pop_real.cpp
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifdef _MSC_VER
+00028 // to avoid long name warnings
+00029 #pragma warning(disable:4786)
+00030 #endif 
+00031 
+00043 // The templatized code
+00044 #include <do/make_pop.h>
+00045 // the instanciating EOType
+00046 #include <es/eoReal.h>
+00047 
+00049 
+00050 // Init POP
+00052 eoPop<eoReal<double> >&  make_pop(eoParser& _parser, eoState& _state, eoInit<eoReal<double> > & _init)
+00053 {
+00054   return do_make_pop(_parser, _state, _init);
+00055 }
+00056 
+00057 eoPop<eoReal<eoMinimizingFitness> >&  make_pop(eoParser& _parser, eoState& _state, eoInit<eoReal<eoMinimizingFitness> > & _init)
+00058 {
+00059   return do_make_pop(_parser, _state, _init);
+00060 }
+00061 
+00062 
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__real_8h-source.html b/trunk/paradiseo-eo/doc/html/make__real_8h-source.html new file mode 100644 index 000000000..161635f88 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__real_8h-source.html @@ -0,0 +1,98 @@ + + +EO: make_real.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

make_real.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // real.h
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00044 #ifndef real_h
+00045 #define real_h
+00046 
+00047 #include <eoAlgo.h>
+00048 #include <eoScalarFitness.h>
+00049 #include <utils/eoParser.h>
+00050 #include <eoEvalFuncPtr.h>
+00051 #include <eoEvalFuncCounter.h>
+00052 #include <utils/eoCheckPoint.h>
+00053 #include <eoGenOp.h>
+00054 #include <eoPop.h>
+00055 #include <utils/eoDistance.h>
+00056 
+00057 #include <es/eoRealInitBounded.h>
+00058 #include <es/eoReal.h>
+00059 
+00060 //Representation dependent - rewrite everything anew for each representation
+00062 
+00063 // the genotypes 
+00064 eoRealInitBounded<eoReal<double> > & make_genotype(eoParser& _parser, eoState& _state, eoReal<double> _eo);
+00065 eoRealInitBounded<eoReal<eoMinimizingFitness> > & make_genotype(eoParser& _parser, eoState& _state, eoReal<eoMinimizingFitness> _eo);
+00066 
+00067 // the operators
+00068 eoGenOp<eoReal<double> >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded<eoReal<double> >& _init);
+00069 eoGenOp<eoReal<eoMinimizingFitness> >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded<eoReal<eoMinimizingFitness> >& _init);
+00070 
+00071 //Representation INdependent
+00073 // you don't need to modify that part even if you use your own representation
+00074 
+00075 // init pop
+00076 eoPop<eoReal<double> >&  make_pop(eoParser& _parser, eoState& _state, eoInit<eoReal<double> >&);
+00077 eoPop<eoReal<eoMinimizingFitness> >&  make_pop(eoParser& _parser, eoState& _state, eoInit<eoReal<eoMinimizingFitness> >&);
+00078 
+00079 // the continue's
+00080 eoContinue<eoReal<double> >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoReal<double> > & _eval);
+00081 eoContinue<eoReal<eoMinimizingFitness> >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoReal<eoMinimizingFitness> > & _eval);
+00082 
+00083 // the checkpoint
+00084 eoCheckPoint<eoReal<double> >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoReal<double> >& _eval, eoContinue<eoReal<double> >& _continue);
+00085 eoCheckPoint<eoReal<eoMinimizingFitness> >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter<eoReal<eoMinimizingFitness> >& _eval, eoContinue<eoReal<eoMinimizingFitness> >& _continue);
+00086 
+00087 
+00088 // the algo
+00089 eoAlgo<eoReal<double> >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<eoReal<double> >& _eval, eoContinue<eoReal<double> >& _ccontinue, eoGenOp<eoReal<double> >& _op, eoDistance<eoReal<double> >* _dist = NULL);
+00090 
+00091 eoAlgo<eoReal<eoMinimizingFitness> >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc<eoReal<eoMinimizingFitness> >& _eval, eoContinue<eoReal<eoMinimizingFitness> >& _ccontinue, eoGenOp<eoReal<eoMinimizingFitness> >& _op, eoDistance<eoReal<eoMinimizingFitness> >* _dist = NULL);
+00092 
+00093 // run
+00094 void run_ea(eoAlgo<eoReal<double> >& _ga, eoPop<eoReal<double> >& _pop);
+00095 void run_ea(eoAlgo<eoReal<eoMinimizingFitness> >& _ga, eoPop<eoReal<eoMinimizingFitness> >& _pop);
+00096 
+00097 // end of parameter input (+ .status + help)
+00098 // that one is not templatized
+00099 // Because of that, the source is in src/utils dir
+00100 void make_help(eoParser & _parser);
+00101 
+00102 #endif
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__run_8h-source.html b/trunk/paradiseo-eo/doc/html/make__run_8h-source.html new file mode 100644 index 000000000..0d1f0df7b --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__run_8h-source.html @@ -0,0 +1,60 @@ + + +EO: make_run.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / do
+

make_run.h

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_run.h
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef _make_run_h
+00028 #define _make_run_h
+00029 
+00030 // Algorithm (only this one needed)
+00031 #include <eoAlgo.h>
+00032 
+00033 /*
+00034  * A trivial function - only here to allow instanciation with a give EOType
+00035  *      and separate compilation - see in ga dir, make_run_ga
+00036  *
+00037 */
+00038 
+00039 template <class EOT>
+00040 void do_run(eoAlgo<EOT>& _algo, eoPop<EOT>& _pop)
+00041 {
+00042   _algo(_pop);
+00043 }
+00044 
+00045 #endif
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__run__es_8cpp-source.html b/trunk/paradiseo-eo/doc/html/make__run__es_8cpp-source.html new file mode 100644 index 000000000..07bccf765 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__run__es_8cpp-source.html @@ -0,0 +1,87 @@ + + +EO: make_run_es.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

make_run_es.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_run_es.cpp
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifdef _MSC_VER
+00028 // to avoid long name warnings
+00029 #pragma warning(disable:4786)
+00030 #endif 
+00031 
+00043 // The templatized code
+00044 #include <do/make_run.h>
+00045 // the instanciating EOType(s)
+00046 #include <es/eoEsSimple.h>         // one Sigma per individual
+00047 #include <es/eoEsStdev.h>          // one sigmal per object variable
+00048 #include <es/eoEsFull.h>           // full correlation matrix per indi
+00049 // the instanciating fitnesses
+00050 #include <eoScalarFitness.h>
+00051 
+00053 
+00054 // run
+00056 void run_ea(eoAlgo<eoEsSimple<double> >& _ga, eoPop<eoEsSimple<double> >& _pop)
+00057 {
+00058   do_run(_ga, _pop);
+00059 }
+00060 
+00061 void run_ea(eoAlgo<eoEsSimple<eoMinimizingFitness> >& _ga, eoPop<eoEsSimple<eoMinimizingFitness> >& _pop)
+00062 {
+00063   do_run(_ga, _pop);
+00064 }
+00065 
+00067 void run_ea(eoAlgo<eoEsStdev<double> >& _ga, eoPop<eoEsStdev<double> >& _pop)
+00068 {
+00069   do_run(_ga, _pop);
+00070 }
+00071 
+00072 void run_ea(eoAlgo<eoEsStdev<eoMinimizingFitness> >& _ga, eoPop<eoEsStdev<eoMinimizingFitness> >& _pop)
+00073 {
+00074   do_run(_ga, _pop);
+00075 }
+00076 
+00078 void run_ea(eoAlgo<eoEsFull<double> >& _ga, eoPop<eoEsFull<double> >& _pop)
+00079 {
+00080   do_run(_ga, _pop);
+00081 }
+00082 
+00083 void run_ea(eoAlgo<eoEsFull<eoMinimizingFitness> >& _ga, eoPop<eoEsFull<eoMinimizingFitness> >& _pop)
+00084 {
+00085   do_run(_ga, _pop);
+00086 }
+00087 
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__run__ga_8cpp-source.html b/trunk/paradiseo-eo/doc/html/make__run__ga_8cpp-source.html new file mode 100644 index 000000000..8bae11eb2 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__run__ga_8cpp-source.html @@ -0,0 +1,65 @@ + + +EO: make_run_ga.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / ga
+

make_run_ga.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_run_ga.cpp
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifdef _MSC_VER
+00028 // to avoid long name warnings
+00029 #pragma warning(disable:4786)
+00030 #endif 
+00031 
+00046 // The templatized code
+00047 #include <do/make_run.h>
+00048 // the instanciating EOType
+00049 #include <ga/eoBit.h>
+00050 // the instanciating fitnesses
+00051 #include <eoScalarFitness.h>
+00052 
+00054 
+00055 // run
+00057 void run_ea(eoAlgo<eoBit<double> >& _ga, eoPop<eoBit<double> >& _pop)
+00058 {
+00059   do_run(_ga, _pop);
+00060 }
+00061 
+00062 void run_ea(eoAlgo<eoBit<eoMinimizingFitness> >& _ga, eoPop<eoBit<eoMinimizingFitness> >& _pop)
+00063 {
+00064   do_run(_ga, _pop);
+00065 }
+00066 
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/make__run__real_8cpp-source.html b/trunk/paradiseo-eo/doc/html/make__run__real_8cpp-source.html new file mode 100644 index 000000000..dc1f38908 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/make__run__real_8cpp-source.html @@ -0,0 +1,65 @@ + + +EO: make_run_real.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

make_run_real.cpp

00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // make_run_real.cpp
+00005 // (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+00006 /* 
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022              Marc.Schoenauer@polytechnique.fr
+00023              mkeijzer@dhi.dk
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifdef _MSC_VER
+00028 // to avoid long name warnings
+00029 #pragma warning(disable:4786)
+00030 #endif 
+00031 
+00043 // The templatized code
+00044 #include <do/make_run.h>
+00045 // the instanciating EOType
+00046 #include <es/eoReal.h>
+00047 // the instanciating fitnesses
+00048 #include <eoScalarFitness.h>
+00049 
+00051 
+00052 // run
+00054 void run_ea(eoAlgo<eoReal<double> >& _ga, eoPop<eoReal<double> >& _pop)
+00055 {
+00056   do_run(_ga, _pop);
+00057 }
+00058 
+00059 void run_ea(eoAlgo<eoReal<eoMinimizingFitness> >& _ga, eoPop<eoReal<eoMinimizingFitness> >& _pop)
+00060 {
+00061   do_run(_ga, _pop);
+00062 }
+00063 
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/mastermind_8cpp-source.html b/trunk/paradiseo-eo/doc/html/mastermind_8cpp-source.html new file mode 100644 index 000000000..1624ce3d1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/mastermind_8cpp-source.html @@ -0,0 +1,153 @@ + + +EO: mastermind.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+app / mastermind
+

mastermind.cpp

00001 //-----------------------------------------------------------------------------
+00002 // mastermind
+00003 //-----------------------------------------------------------------------------
+00004 
+00005 #include <stdlib.h>                // EXIT_SUCCESS EXIT_FAILURE
+00006 #include <stdexcept>               // exception
+00007 #include <iostream>                // cerr cout
+00008 #include <fstream>                 // ifstream
+00009 #include <string>                  // string
+00010 #include <eo>                      // all usefull eo stuff
+00011 
+00012 #include "mastermind.h"            // Chrom eoChromInit eoChromMutation eoChromXover eoChromEvaluator
+00013 
+00014 using namespace std;
+00015 
+00016 //-----------------------------------------------------------------------------
+00017 // global variables
+00018 //-----------------------------------------------------------------------------
+00019 
+00020 unsigned in, out, hidden;
+00021 
+00022 //-----------------------------------------------------------------------------
+00023 // parameters
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 eoValueParam<unsigned> pop_size(16, "pop_size", "population size", 'p');
+00027 eoValueParam<unsigned> generations(100, "generations", "number of generation", 'g');
+00028 eoValueParam<double> mut_rate(0.1, "mut_rate", "mutation rate", 'm');
+00029 eoValueParam<double> xover_rate(0.5, "xover_rate", "default crossover rate", 'x');
+00030 eoValueParam<unsigned> col_p(default_colors, "colors", "number of colors", 'c');
+00031 eoValueParam<unsigned> len_p(default_length, "legth", "solution legth", 'l');
+00032 eoValueParam<string> sol_p(default_solution, "solution", "problem solution", 's');
+00033 
+00034 //-----------------------------------------------------------------------------
+00035 // auxiliar functions
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 void arg(int argc, char** argv);
+00039 void ga();
+00040 
+00041 //-----------------------------------------------------------------------------
+00042 // main
+00043 //-----------------------------------------------------------------------------
+00044 
+00045 int main(int argc, char** argv)
+00046 {
+00047   try
+00048     {
+00049       arg(argc, argv);
+00050       ga();
+00051     }
+00052   catch (exception& e)
+00053     {
+00054         cerr << argv[0] << ": " << e.what() << endl;
+00055         exit(EXIT_FAILURE);
+00056     }
+00057 
+00058   return 0;
+00059 }
+00060 
+00061 //-----------------------------------------------------------------------------
+00062 // implementation
+00063 //-----------------------------------------------------------------------------
+00064 
+00065 void arg(int argc, char** argv)
+00066 {
+00067   eoParser parser(argc, argv);
+00068 
+00069   parser.processParam(pop_size,    "genetic operators");
+00070   parser.processParam(generations, "genetic operators");
+00071   parser.processParam(mut_rate,    "genetic operators");
+00072   parser.processParam(xover_rate,  "genetic operators");
+00073   parser.processParam(col_p,       "problem");
+00074   parser.processParam(len_p,       "problem");
+00075   parser.processParam(sol_p,       "problem");
+00076 
+00077   if (parser.userNeedsHelp())
+00078     {
+00079       parser.printHelp(cout);
+00080       exit(EXIT_SUCCESS);
+00081     }
+00082 
+00083   init_eoChromEvaluator(col_p.value(), len_p.value(), sol_p.value());
+00084 }
+00085 
+00086 //-----------------------------------------------------------------------------
+00087 
+00088 void ga()
+00089 {
+00090   // create population
+00091   eoInitChrom init;
+00092   eoPop<Chrom> pop(pop_size.value(), init);
+00093 
+00094   // evaluate population
+00095   eoEvalFuncPtr<Chrom> evaluator(eoChromEvaluator);
+00096   apply<Chrom>(evaluator, pop);
+00097 
+00098   // selector
+00099   eoProportionalSelect<Chrom> select(pop);
+00100 
+00101   // genetic operators
+00102   eoChromMutation mutation;
+00103   eoChromXover xover;
+00104 
+00105   // stop condition
+00106   eoGenContinue<Chrom> continuator1(generations.value());
+00107   eoFitContinue<Chrom> continuator2(solution.fitness());
+00108   eoCombinedContinue<Chrom> continuator(continuator1, continuator2);
+00109 
+00110   // checkpoint
+00111   eoCheckPoint<Chrom> checkpoint(continuator);
+00112 
+00113   // monitor
+00114   eoStdoutMonitor monitor;
+00115   checkpoint.add(monitor);
+00116 
+00117   // statistics
+00118   eoBestFitnessStat<Chrom> stats;
+00119   checkpoint.add(stats);
+00120   monitor.add(stats);
+00121 
+00122   // genetic algorithm
+00123   eoSGA<Chrom> sga(select,
+00124                    xover, xover_rate.value(),
+00125                    mutation, mut_rate.value(),
+00126                    evaluator,
+00127                    checkpoint);
+00128   sga(pop);
+00129 
+00130   cout << "solution = " << solution << endl
+00131        << "best     = " << *max_element(pop.begin(), pop.end()) << endl;
+00132 }
+00133 
+00134 //-----------------------------------------------------------------------------
+00135 
+00136 // Local Variables:
+00137 // mode:C++
+00138 // End:
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/mastermind_8h-source.html b/trunk/paradiseo-eo/doc/html/mastermind_8h-source.html new file mode 100644 index 000000000..48d007912 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/mastermind_8h-source.html @@ -0,0 +1,214 @@ + + +EO: mastermind.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+app / mastermind
+

mastermind.h

00001 //-----------------------------------------------------------------------------
+00002 // mastermind.h
+00003 //-----------------------------------------------------------------------------
+00004 
+00005 #ifndef mastermind_h
+00006 #define mastermind_h
+00007 
+00008 //-----------------------------------------------------------------------------
+00009 
+00010 #include <stdlib.h>               // exit EXIT_FAILURE
+00011 #include <eoVector.h>             // eoVectorLength
+00012 #include <eoOp.h>                 // eoMonOp eoQuadraticOp
+00013 #include <eoInit.h>               // eoInit
+00014 #include "utils/rnd_generators.h" // uniform_generator
+00015 
+00016 //-----------------------------------------------------------------------------
+00017 // phenotype
+00018 //-----------------------------------------------------------------------------
+00019 
+00020 typedef float phenotype;
+00021 
+00022 //-----------------------------------------------------------------------------
+00023 // genotype
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 typedef std::vector<int> genotype;
+00027 
+00028 //-----------------------------------------------------------------------------
+00029 // Chrom
+00030 //-----------------------------------------------------------------------------
+00031 
+00032 typedef eoVector<phenotype, int> Chrom;
+00033 
+00034 //-----------------------------------------------------------------------------
+00035 // eoChromEvaluator
+00036 //-----------------------------------------------------------------------------
+00037 
+00038 // const unsigned points_per_black = 3, points_per_white = 1;
+00039 Chrom solution;
+00040 
+00041 phenotype eoChromEvaluator(const Chrom& chrom)
+00042 {
+00043   Chrom tmp = solution;
+00044   unsigned black = 0, white = 0;
+00045 
+00046   // look for blacks
+00047   for (unsigned i = 0; i < chrom.size(); ++i)
+00048     if (chrom[i] == tmp[i])
+00049       {
+00050         ++black;
+00051         tmp[i] = -1;
+00052       }
+00053 
+00054   // look for whites
+00055   for (unsigned i = 0; i < chrom.size(); ++i)
+00056     for (unsigned j = 0; j < tmp.size(); ++j)
+00057       if (chrom[i] == tmp[j])
+00058         {
+00059           ++white;
+00060           tmp[j] = -1;
+00061           break;
+00062         }
+00063 
+00064   //  return black * points_per_black + white * points_per_white;
+00065   return black * chrom.size() + white;
+00066 };
+00067 
+00068 const unsigned default_length = 8;
+00069 const unsigned default_colors = 8;
+00070 const std::string default_solution = "01234567";
+00071 
+00072 
+00073 unsigned num_colors;
+00074 
+00075 void init_eoChromEvaluator(const unsigned& c, const unsigned& l, std::string s)
+00076 {
+00077   num_colors = c;
+00078 
+00079   // check consistency between parameters
+00080   if (s != default_solution)
+00081     {
+00082       // check length
+00083       if (l != default_length && s.size() != l)
+00084         {
+00085           std::cerr << "solution length != length" << std::endl;
+00086           exit(EXIT_FAILURE);
+00087         }
+00088 
+00089       // check number of colors
+00090       if ((c != default_colors) && (c < unsigned(*max_element(s.begin(), s.end()) - '0')))
+00091         {
+00092           std::cerr << "too high color number found!" << std::endl;
+00093           exit(EXIT_FAILURE);
+00094         }
+00095     }
+00096   else
+00097     if (l != default_length || c != default_colors )
+00098       // generate a random solution
+00099       if(num_colors <= 10)
+00100         {
+00101           uniform_generator<char> color('0', static_cast<char>('0' + c));
+00102           s.resize(l);
+00103           generate(s.begin(), s.end(), color);
+00104         }
+00105 
+00106   // put the solution parameter on the solution chromosome
+00107   if (num_colors <= 10)
+00108     {
+00109       solution.resize(s.size());
+00110       for (unsigned i = 0; i < solution.size(); ++i)
+00111         solution[i] = s[i] - '0';
+00112     }
+00113   else
+00114     {
+00115       solution.resize(l);
+00116       uniform_generator<int> color(0, num_colors);
+00117       generate(solution.begin(), solution.end(), color);
+00118     }
+00119 
+00120   solution.fitness(eoChromEvaluator(solution));
+00121 }
+00122 
+00123 //-----------------------------------------------------------------------------
+00124 // eoChromInit
+00125 //-----------------------------------------------------------------------------
+00126 
+00127 class eoInitChrom: public eoInit<Chrom>
+00128 {
+00129 public:
+00130   void operator()(Chrom& chrom)
+00131   {
+00132     uniform_generator<int> color(0, num_colors);
+00133     chrom.resize(solution.size());
+00134     generate(chrom.begin(), chrom.end(), color);
+00135     chrom.invalidate();
+00136   }
+00137 };
+00138 
+00139 //-----------------------------------------------------------------------------
+00140 // eoChromMutation
+00141 //-----------------------------------------------------------------------------
+00142 
+00143 class eoChromMutation: public eoMonOp<Chrom>
+00144 {
+00145   // many operators in one :(
+00146   bool operator()(Chrom& chrom)
+00147   {
+00148     uniform_generator<unsigned> what(0, 2);
+00149     uniform_generator<unsigned> position(0, chrom.size());
+00150 
+00151     switch(what())
+00152       {
+00153       case 0:
+00154         {
+00155           // mutation
+00156           uniform_generator<int> color(0, num_colors);
+00157           chrom[position()] = color();
+00158           break;
+00159         }
+00160       case 1:
+00161         {
+00162           // transposition
+00163           std::swap(chrom[position()], chrom[position()]);
+00164           break;
+00165         }
+00166       default:
+00167         {
+00168           std::cerr << "unknown operator!" << std::endl;
+00169           exit(EXIT_FAILURE);
+00170           break;
+00171         }
+00172       }
+00173 
+00174     return true;
+00175   }
+00176 };
+00177 
+00178 //-----------------------------------------------------------------------------
+00179 // eoChromXover
+00180 //-----------------------------------------------------------------------------
+00181 
+00182 class eoChromXover: public eoQuadOp<Chrom>
+00183 {
+00184 public:
+00185   bool operator()(Chrom& chrom1, Chrom& chrom2)
+00186   {
+00187     uniform_generator<unsigned> position(0, chrom1.size());
+00188     swap_ranges(chrom1.begin(), chrom1.begin() + position(), chrom2.begin());
+00189     return true;
+00190   }
+00191 };
+00192 
+00193 //-----------------------------------------------------------------------------
+00194 
+00195 #endif // mastermind_h
+00196 
+00197 // Local Variables:
+00198 // mode:C++
+00199 // End:
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/matrices_8h-source.html b/trunk/paradiseo-eo/doc/html/matrices_8h-source.html new file mode 100644 index 000000000..82788210f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/matrices_8h-source.html @@ -0,0 +1,57 @@ + + +EO: matrices.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / es
+

matrices.h

00001 #ifndef MATRICES_H
+00002 #define MATRICES_H
+00003 
+00004 #include <vector>
+00005 
+00006 class lower_triangular_matrix {
+00007 
+00008     unsigned n;
+00009     std::vector<double> data;
+00010 
+00011     public:
+00012 
+00013     lower_triangular_matrix(unsigned n_ = 0) : n(n_), data(n * (n+1) / 2) {};
+00014     
+00015     void resize(unsigned n_) {
+00016         n = n_;
+00017         data.resize(n*(n+1)/2);
+00018     }
+00019     
+00020     std::vector<double>::iterator operator[](unsigned i) { return data.begin() + i * (i+1) / 2; }
+00021     std::vector<double>::const_iterator operator[](unsigned i) const { return data.begin() + i*(i+1)/2; }
+00022 };
+00023 
+00024 class square_matrix {
+00025     unsigned n;
+00026     std::vector<double> data;
+00027 
+00028     public:
+00029 
+00030     square_matrix(unsigned n_ = 0) : n(n_), data(n * n) {};
+00031     
+00032     void resize(unsigned n_) {
+00033         n = n_;
+00034         data.resize(n*n);
+00035     }
+00036     
+00037     std::vector<double>::iterator operator[](unsigned i) { return data.begin() + i * n; }
+00038     std::vector<double>::const_iterator operator[](unsigned i) const { return data.begin() + i*n; }
+00039 };
+00040 
+00041 #endif
+00042 
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/mergers_8cpp-source.html b/trunk/paradiseo-eo/doc/html/mergers_8cpp-source.html new file mode 100644 index 000000000..1f35ab890 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/mergers_8cpp-source.html @@ -0,0 +1,56 @@ + + +EO: mergers.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / pyeo
+

mergers.cpp

00001 /*
+00002     PyEO
+00003     
+00004     Copyright (C) 2003 Maarten Keijzer
+00005 
+00006     This program is free software; you can redistribute it and/or modify
+00007     it under the terms of the GNU General Public License as published by
+00008     the Free Software Foundation; either version 2 of the License, or
+00009     (at your option) any later version.
+00010 
+00011     This program is distributed in the hope that it will be useful,
+00012     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00013     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00014     GNU General Public License for more details.
+00015 
+00016     You should have received a copy of the GNU General Public License
+00017     along with this program; if not, write to the Free Software
+00018     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00019 */
+00020 
+00021 #include <eoMerge.h>
+00022 #include "PyEO.h"
+00023 #include "def_abstract_functor.h"
+00024 
+00025 using namespace boost::python;
+00026 
+00027 #define DEF(x) class_<x<PyEO>, bases<eoMerge<PyEO > > >(#x).def("__call__", &eoMerge<PyEO>::operator())
+00028 #define DEF2(x, i1) class_<x<PyEO>, bases<eoMerge<PyEO > > >(#x, init<i1>() ).def("__call__", &eoMerge<PyEO>::operator())
+00029 #define DEF3(x, i1, i2) class_<x<PyEO>, bases<eoMerge<PyEO > > >(#x, init<i1, i2 >() ).def("__call__", &eoMerge<PyEO>::operator())
+00030 
+00031 void mergers()
+00032 {
+00033     def_abstract_functor<eoMerge<PyEO> >("eoMerge");
+00034     
+00035     DEF2(eoElitism, double)
+00036         .def( init<double, bool>() );
+00037     DEF(eoNoElitism);
+00038     DEF(eoPlus);
+00039 
+00040 }
+00041 
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/mlp_8h-source.html b/trunk/paradiseo-eo/doc/html/mlp_8h-source.html new file mode 100644 index 000000000..29599a1e4 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/mlp_8h-source.html @@ -0,0 +1,472 @@ + + +EO: mlp.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+app / gprop
+

mlp.h

00001 //-----------------------------------------------------------------------------
+00002 // mlp.h
+00003 //-----------------------------------------------------------------------------
+00004 
+00005 #ifndef mlp_h
+00006 #define mlp_h
+00007 
+00008 #include <algorithm>              // generate
+00009 #include <cmath>                  // exp
+00010 #include <iostream>
+00011 #include <iterator>
+00012 #include <numeric>
+00013 #include <stdexcept>              // invalid_argument
+00014 #include <utility>
+00015 #include <vector>
+00016 #include <utils/eoRNG.h>          // eoRng
+00017 #include <utils/rnd_generators.h> // normal_generator
+00018 #include <vecop.h>                // *
+00019 
+00020 
+00021 
+00022 
+00023 namespace mlp
+00024 {
+00025     using namespace std;
+00026 
+00027     typedef double real;
+00028     typedef std::vector<real> vector;
+00029 }
+00030 
+00031 
+00032 namespace std {
+00033   ostream& operator<<(ostream& os, const mlp::vector& v)
+00034   {
+00035     ostream_iterator<mlp::real> oi(os, " ");
+00036     copy(v.begin(), v.end(), oi);
+00037     return os;
+00038   }
+00039 
+00040   istream& operator>>(istream& is, mlp::vector& v)
+00041   {
+00042     for (mlp::vector::iterator vi = v.begin() ; vi != v.end() ; vi++) {
+00043         is >> *vi;
+00044     }
+00045     return is;
+00046   }
+00047 }
+00048 
+00049 namespace mlp
+00050 {
+00051   using namespace std;
+00052 
+00053   //---------------------------------------------------------------------------
+00054   // useful typedefs
+00055   //---------------------------------------------------------------------------
+00056 
+00057 
+00058   const real max_real = std::numeric_limits<real>::max();
+00059   const real min_real = std::numeric_limits<real>::min();
+00060 
+00061 
+00062   //---------------------------------------------------------------------------
+00063   // sigmoid
+00064   //---------------------------------------------------------------------------
+00065 
+00066   real sigmoid(const real& x)
+00067   {
+00068     return 1.0 / (1.0 + exp(-x));
+00069   }
+00070 
+00071 
+00072   //---------------------------------------------------------------------------
+00073   // neuron
+00074   //---------------------------------------------------------------------------
+00075 
+00076   struct neuron
+00077   {
+00078     real   bias;
+00079     vector weight;
+00080 
+00081     neuron(const unsigned& num_inputs = 0): weight(num_inputs) {}
+00082 
+00083     void reset()
+00084     {
+00085       normal_generator<real> rnd(1.0);
+00086       bias = rnd();
+00087       generate(weight.begin(), weight.end(), rnd);
+00088     }
+00089 
+00090     real operator()(const vector& input) const
+00091     {
+00092       return sigmoid(bias + weight * input);
+00093     }
+00094 
+00095     unsigned length() const { return weight.size() + 1; }
+00096 
+00097     void normalize()
+00098     {
+00099       real n = sqrt(bias * bias + weight * weight);
+00100       bias /= n;
+00101       weight /= n;
+00102     }
+00103 
+00104     void desaturate()
+00105     {
+00106       bias = -5.0 + 10.0 / (1.0 + exp(bias / -5.0));
+00107 
+00108       for (vector::iterator w = weight.begin(); w != weight.end(); ++w)
+00109         *w = -5.0 + 10.0 / (1.0 + exp(*w / -5.0));
+00110     }
+00111 
+00112     void perturb_num(double &num, double magnitude) {
+00113        double scale = max(num, 0.05) * magnitude;
+00114        double perturbation = scale * (drand48() - 0.5);
+00115        num += perturbation;
+00116     }
+00117 
+00118     void perturb(double magnitude = 0.3, double probability = 1.0)
+00119     {
+00120 
+00121       for (vector::iterator w = weight.begin(); w != weight.end(); ++w)
+00122           if ( probability >= 1.0 || drand48() < probability)
+00123               perturb_num(*w, magnitude);
+00124       if ( probability >= 1.0 || drand48() < probability)
+00125         perturb_num(bias, magnitude);
+00126     }
+00127  };
+00128 }
+00129 
+00130 namespace std {
+00131 
+00132   ostream& operator<<(ostream& os, const mlp::neuron& n)
+00133   {
+00134     return os << n.bias << " " << n.weight;
+00135   }
+00136 
+00137   istream& operator>>(istream& is, mlp::neuron& n)
+00138   {
+00139     return is >> n.bias >> n.weight;
+00140   }
+00141 
+00142 }
+00143 
+00144 namespace mlp {
+00145 
+00146   //---------------------------------------------------------------------------
+00147   // layer
+00148   //---------------------------------------------------------------------------
+00149 
+00150   class layer: public std::vector<neuron>
+00151   {
+00152   public:
+00153     layer(const unsigned& num_inputs = 0, const unsigned& num_neurons = 0):
+00154       std::vector<neuron>(num_neurons, neuron(num_inputs)) {}
+00155 
+00156     void reset()
+00157     {
+00158       normal_generator<real> rnd(1.0);
+00159       for(iterator n = begin(); n != end(); ++n)
+00160         n->reset();
+00161     }
+00162 
+00163     vector operator()(const vector& input) const
+00164     {
+00165       vector output(size());
+00166 
+00167       for(unsigned i = 0; i < output.size(); ++i)
+00168         output[i] = (*this)[i](input);
+00169 
+00170       return output;
+00171     }
+00172 
+00173     unsigned length() const { return front().length() * size(); }
+00174 
+00175     void normalize()
+00176     {
+00177       for(iterator n = begin(); n != end(); ++n)
+00178         n->normalize();
+00179     }
+00180 
+00181     void desaturate()
+00182     {
+00183       for(iterator n = begin(); n != end(); ++n)
+00184         n->desaturate();
+00185     }
+00186 
+00187     void perturb(double magnitude = 0.3, double probability = 1.0)
+00188     {
+00189       for(iterator n = begin(); n != end(); ++n)
+00190         n->perturb();
+00191     }
+00192 
+00193   };
+00194 
+00195 }
+00196 
+00197 namespace std {
+00198 
+00199   ostream& operator<<(ostream& os, const mlp::layer& l)
+00200   {
+00201     ostream_iterator<mlp::neuron> oi(os, " ");
+00202     copy(l.begin(), l.end(), oi);
+00203     return os;
+00204   }
+00205 
+00206   istream& operator>>(istream& is, mlp::layer& l)
+00207   {
+00208     for (mlp::layer::iterator li = l.begin() ; li != l.end() ; li++) {
+00209         is >> *li;
+00210     }
+00211     return is;
+00212   }
+00213 
+00214 }
+00215 
+00216 namespace mlp {
+00217 
+00218 
+00219   //---------------------------------------------------------------------------
+00220   // net
+00221   //---------------------------------------------------------------------------
+00222 
+00223   class net: public std::vector<layer>
+00224   {
+00225   public:
+00226     net(const unsigned& num_inputs = 0,
+00227         const unsigned& num_outputs = 0,
+00228         const std::vector<unsigned>& hidden = std::vector<unsigned>())
+00229     {
+00230       init(num_inputs,num_outputs,hidden);
+00231     }
+00232 
+00233 
+00234     net(istream &is) {
+00235         load(is);
+00236     }
+00237 
+00239       virtual ~net() {};
+00240 
+00241     void load(istream &is) {
+00242         unsigned num_inputs;
+00243         unsigned num_outputs;
+00244         unsigned num_hidden_layers;
+00245 
+00246         is >> num_inputs >> num_outputs >> num_hidden_layers;
+00247 
+00248         std::vector<unsigned> layer_sizes;
+00249         for (unsigned i=0; i<num_hidden_layers;i++) {
+00250            unsigned layer_size;
+00251            is >> layer_size;
+00252            layer_sizes.push_back(layer_size);
+00253         }
+00254         unsigned check_outputs;
+00255         is >> check_outputs;
+00256         assert (check_outputs ==  num_outputs);
+00257         init (num_inputs,num_outputs,layer_sizes);
+00258         // skip forward to pass up opening '<' char
+00259         char c=' ';
+00260         while (c!='<' && !is.eof()) { is >> c;}
+00261         for (iterator l =begin() ; l != end(); l++) {
+00262             is >> *l;
+00263         }
+00264         do { is >> c; } while (c == ' ' && !is.eof());
+00265         assert(c == '>');
+00266     }
+00267 
+00268     void init( unsigned num_inputs,
+00269                unsigned num_outputs,
+00270                const std::vector<unsigned>& hidden ) {
+00271       clear();
+00272       switch(hidden.size())
+00273         {
+00274         case 0:
+00275           push_back(layer(num_inputs, num_outputs));
+00276           break;
+00277         default:
+00278           push_back(layer(num_inputs, hidden.front()));
+00279           for (unsigned i = 0; i < hidden.size() - 1; ++i)
+00280             push_back(layer(hidden[i], hidden[i + 1]));
+00281           push_back(layer(hidden.back(), num_outputs));
+00282           break;
+00283         }
+00284     }
+00285 
+00286     void reset()
+00287     {
+00288       normal_generator<real> rnd(1.0);
+00289       for(iterator l = begin(); l != end(); ++l)
+00290         l->reset();
+00291     }
+00292 
+00293     virtual vector operator()(const vector& input) const ;
+00294 
+00295     unsigned winner(const vector& input) const
+00296     {
+00297       vector tmp = (*this)(input);
+00298       return (max_element(tmp.begin(), tmp.end()) - tmp.begin());
+00299     }
+00300 
+00301     void save(ostream &os) const {
+00302         // Save the number of inputs, number of outputs, and number of hidden layers
+00303         os << num_inputs() << "\n" << num_outputs() << "\n" << num_hidden_layers() << "\n";
+00304         for(const_iterator l = begin(); l != end(); ++l)
+00305            os << l->size() << " ";
+00306         os << "\n";
+00307         os << *this;
+00308         os << "\n";
+00309     }
+00310 
+00311     unsigned num_inputs()  const { return front().front().length() - 1; }
+00312     unsigned num_outputs() const { return back().size(); }
+00313     unsigned num_hidden_layers() const {
+00314         signed s = (signed) size() -1;
+00315         return (s<0) ? 0 : s ;
+00316     }
+00317 
+00318 
+00319     unsigned length()
+00320     {
+00321       unsigned sum = 0;
+00322 
+00323       for(iterator l = begin(); l != end(); ++l)
+00324         sum += l->length();
+00325 
+00326       return sum;
+00327     }
+00328 
+00329     void normalize()
+00330     {
+00331       for(iterator l = begin(); l != end(); ++l)
+00332         l->normalize();
+00333     }
+00334 
+00335     void desaturate()
+00336     {
+00337       for(iterator l = begin(); l != end(); ++l)
+00338         l->desaturate();
+00339     }
+00340 
+00341     void perturb(double magnitude = 0.3, double probability = 1.0)
+00342     {
+00343       for(iterator l = begin(); l != end(); ++l)
+00344         l->perturb();
+00345     }
+00346   };
+00347 
+00348 #ifndef NO_MLP_VIRTUALS
+00349     vector net::operator()(const vector& input) const
+00350     {
+00351       vector tmp = input;
+00352 
+00353       for(const_iterator l = begin(); l != end(); ++l)
+00354         tmp = (*l)(tmp);
+00355 
+00356       return tmp;
+00357     }
+00358 #endif
+00359 
+00360 
+00361   //---------------------------------------------------------------------------
+00362   // sample
+00363   //---------------------------------------------------------------------------
+00364 
+00365   struct sample
+00366   {
+00367     vector input, output;
+00368 
+00369     sample(unsigned input_size = 0, unsigned output_size = 0):
+00370       input(input_size), output(output_size) {}
+00371   };
+00372 
+00373   istream& operator>>(istream& is, sample& s)
+00374   {
+00375     return is >> s.input >> s.output;
+00376   }
+00377 
+00378   ostream& operator<<(ostream& os, const sample& s)
+00379   {
+00380     return os << s.input << " " << s.output;
+00381   }
+00382 
+00383 
+00384   //---------------------------------------------------------------------------
+00385   // set
+00386   //---------------------------------------------------------------------------
+00387 
+00388   class set: public std::vector<sample>
+00389   {
+00390   public:
+00391     set(unsigned input_size  = 0, unsigned output_size = 0,
+00392         unsigned num_samples = 0):
+00393       std::vector<sample>(num_samples, sample(input_size, output_size)) {}
+00394 
+00395     set(istream& is) : std::vector<sample>(0, sample(0, 0)) {
+00396         clear();
+00397         load(is);
+00398     }
+00399 
+00400     void load(istream &is) {
+00401         unsigned input_size, output_size;
+00402         is >> input_size >> output_size;
+00403         sample samp(input_size, output_size);;
+00404         while (is >> samp) { push_back(samp); }
+00405     }
+00406 
+00407     void save(ostream &os) const {
+00408         os << front().input.size() << " " << front().output.size() << endl;
+00409         copy(begin(), end(), ostream_iterator<sample>(os,"\n"));
+00410     }
+00411   };
+00412 
+00413   ostream& operator<<(ostream& os, const set& s)
+00414   {
+00415     os << "<" << endl;
+00416     for (unsigned i = 0; i < s.size(); ++i)
+00417       os << s[i] << endl;
+00418     return os << ">";
+00419   }
+00420 
+00421   //---------------------------------------------------------------------------
+00422   // euclidean_distance
+00423   //---------------------------------------------------------------------------
+00424 
+00425   real euclidean_distance(const net& n1, const net& n2)
+00426   {
+00427     real sum = 0;
+00428 
+00429     for(net::const_reverse_iterator l1 = n1.rbegin(), l2 = n2.rbegin();
+00430         l1 != n1.rend() && l2 != n2.rend(); ++l1, ++l2)
+00431       for(layer::const_iterator n1 = l1->begin(), n2 = l2->begin();
+00432           n1 != l1->end() && n2 != l2->end(); ++n1, ++n2)
+00433         {
+00434           real b = n1->bias - n2->bias;
+00435           vector w = n1->weight - n2->weight;
+00436           sum += b * b + w * w;
+00437         }
+00438     /*
+00439       #include <fstream>
+00440       std::ofstream file("dist.stat", ios::app);
+00441       file << sqrt(sum) << endl;
+00442     */
+00443     return sqrt(sum);
+00444   }
+00445 
+00446   //---------------------------------------------------------------------------
+00447 
+00448 } // namespace mlp
+00449 
+00450 
+00451 
+00452 #endif // mlp_h
+00453 
+00454 
+00455 // Local Variables:
+00456 // mode:C++
+00457 // c-file-style: "Stroustrup"
+00458 // End:
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/modules.html b/trunk/paradiseo-eo/doc/html/modules.html new file mode 100644 index 000000000..948645c09 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/modules.html @@ -0,0 +1,22 @@ + + +EO: Module Index + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

EO Modules

Here is a list of all modules: +
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/monitors_8cpp-source.html b/trunk/paradiseo-eo/doc/html/monitors_8cpp-source.html new file mode 100644 index 000000000..63b56344d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/monitors_8cpp-source.html @@ -0,0 +1,80 @@ + + +EO: monitors.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / pyeo
+

monitors.cpp

00001 /*
+00002     PyEO
+00003     
+00004     Copyright (C) 2003 Maarten Keijzer
+00005 
+00006     This program is free software; you can redistribute it and/or modify
+00007     it under the terms of the GNU General Public License as published by
+00008     the Free Software Foundation; either version 2 of the License, or
+00009     (at your option) any later version.
+00010 
+00011     This program is distributed in the hope that it will be useful,
+00012     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00013     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00014     GNU General Public License for more details.
+00015 
+00016     You should have received a copy of the GNU General Public License
+00017     along with this program; if not, write to the Free Software
+00018     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00019 */
+00020 
+00021 #include <utils/eoParam.h>
+00022 #include <utils/eoMonitor.h>
+00023 #include "PyEO.h"
+00024 
+00025 using namespace boost::python;
+00026 
+00027 class MonitorWrapper : public eoMonitor
+00028 {
+00029     public:
+00030         PyObject* self;
+00031         list objects;
+00032         
+00033         MonitorWrapper(PyObject* p) :self(p) {}
+00034 
+00035         eoMonitor& operator()()
+00036         {
+00037             call_method<void>(self, "__call__");
+00038             return *this;
+00039         }
+00040 
+00041         std::string getString(int i)
+00042         {
+00043             if (static_cast<unsigned>(i) >= vec.size())
+00044             {
+00045                 throw index_error("Index out of bounds");
+00046             }
+00047             
+00048             return vec[i]->getValue();
+00049         }
+00050 
+00051         unsigned size() { return vec.size(); }
+00052 };
+00053 
+00054 void monitors()
+00055 {
+00063     class_<eoMonitor, MonitorWrapper, boost::noncopyable>("eoMonitor", init<>())
+00064         .def("lastCall", &eoMonitor::lastCall)
+00065         .def("add", &eoMonitor::add)
+00066         .def("__call__", &MonitorWrapper::operator(), return_internal_reference<1>() )
+00067         .def("__getitem__", &MonitorWrapper::getString, 
+00068                 "Returns the string value of the indexed Parameter")    
+00069         .def("__len__", &MonitorWrapper::size)
+00070         ;
+00071 }
+00072 
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/mse_8h-source.html b/trunk/paradiseo-eo/doc/html/mse_8h-source.html new file mode 100644 index 000000000..4757a9246 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/mse_8h-source.html @@ -0,0 +1,155 @@ + + +EO: mse.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+app / gprop
+

mse.h

00001 //-----------------------------------------------------------------------------
+00002 // mse.h
+00003 //-----------------------------------------------------------------------------
+00004 
+00005 #ifndef mse_h
+00006 #define mse_h
+00007 
+00008 //-----------------------------------------------------------------------------
+00009 
+00010 #include <qp.h>  // neuron layer net set
+00011 
+00012 //-----------------------------------------------------------------------------
+00013 
+00014 namespace mse
+00015 {
+00016   //---------------------------------------------------------------------------
+00017   // useful typedefs
+00018   //---------------------------------------------------------------------------
+00019 
+00020   using qp::real;
+00021   using qp::vector;
+00022   using qp::max_real;
+00023   using qp::min_real;
+00024   using qp::set;
+00025   using qp::neuron;
+00026   using qp::layer;
+00027 
+00028   //---------------------------------------------------------------------------
+00029   // error
+00030   //---------------------------------------------------------------------------
+00031   
+00032   real error(const mlp::net& net, const set& ts)
+00033   {
+00034     real error_ = 0.0;
+00035 
+00036     for (set::const_iterator s = ts.begin(); s != ts.end(); ++s)
+00037       {
+00038         vector out = net(s->input);
+00039         
+00040         for (unsigned i = 0; i < out.size(); ++i)
+00041           {
+00042             real diff = s->output[i] - out[i];
+00043             error_ += diff * diff;
+00044           }
+00045       }
+00046 
+00047     return error_ / ts.size();
+00048   }
+00049   //-------------------------------------------------------------------------
+00050   // mse
+00051   //-------------------------------------------------------------------------
+00052   
+00053   class net: public qp::net
+00054   {
+00055   public:
+00056     net(mlp::net& n): qp::net(n) {}
+00057     
+00058     real error(const set& ts)
+00059     {
+00060       real error_ = 0;
+00061       
+00062       for (set::const_iterator s = ts.begin(); s != ts.end(); ++s)
+00063         {
+00064           forward(s->input);
+00065           error_ += backward(s->input, s->output);
+00066         }
+00067       error_ /= ts.size();
+00068         
+00069       return error_;
+00070     }
+00071       
+00072   private:
+00073     real backward(const vector& input, const vector& output)
+00074     {
+00075       reverse_iterator current_layer = rbegin();
+00076       reverse_iterator backward_layer = current_layer + 1;
+00077       real error_ = 0;
+00078 
+00079       // output layer
+00080       for (unsigned j = 0; j < current_layer->size(); ++j)
+00081         {
+00082           neuron& n = (*current_layer)[j];
+00083 
+00084           real diff = output[j] - n.out;
+00085           n.ndelta += n.delta = diff * n.out * (1.0 - n.out);
+00086 
+00087           if (size() == 1)                                        // monolayer
+00088             n.dxo += n.delta * input;
+00089           else                                                    // multilayer
+00090             for (unsigned k = 0; k < n.dxo.size(); ++k)
+00091               n.dxo[k] += n.delta * (*backward_layer)[k].out;
+00092           
+00093           error_ += diff * diff;
+00094         }
+00095       
+00096       // hidden layers
+00097       while (++current_layer != rend())
+00098         {
+00099           reverse_iterator forward_layer  = current_layer - 1;
+00100           reverse_iterator backward_layer = current_layer + 1;
+00101           
+00102           for (unsigned j = 0; j < current_layer->size(); ++j)
+00103             {
+00104               
+00105               neuron& n = (*current_layer)[j];
+00106               real sum = 0;
+00107               
+00108               for (unsigned k = 0; k < forward_layer->size(); ++k)
+00109                 {
+00110                   neuron& nf = (*forward_layer)[k];
+00111                   sum += nf.delta * (nf.n->weight[j] + nf.dweight1[j]);
+00112                 }
+00113 
+00114               n.delta = n.out * (1.0 - n.out) * sum;
+00115               n.ndelta += n.delta;
+00116               
+00117               
+00118               if (backward_layer == rend())              // first hidden layer
+00119                 n.dxo += n.delta * input;
+00120               else                                     // rest of hidden layers
+00121                 for (unsigned k = 0; k < n.dxo.size(); ++k)
+00122                   n.dxo[k] += n.delta * (*backward_layer)[k].out;
+00123             }
+00124         }
+00125     
+00126       return error_;
+00127     }
+00128   };
+00129 
+00130   //---------------------------------------------------------------------------
+00131   
+00132 } // namespace mse
+00133 
+00134 //-----------------------------------------------------------------------------
+00135 
+00136 #endif // mse_h
+00137 
+00138 // Local Variables: 
+00139 // mode:C++ 
+00140 // End:
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/namespacegp__parse__tree.html b/trunk/paradiseo-eo/doc/html/namespacegp__parse__tree.html new file mode 100644 index 000000000..2cc005d78 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/namespacegp__parse__tree.html @@ -0,0 +1,111 @@ + + +EO: gp_parse_tree Namespace Reference + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

gp_parse_tree Namespace Reference

Parse_tree and subtree classes (c) copyright Maarten Keijzer 1999, 2000. +More... +

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Classes

class  gp_parse_tree::MemPool
 Pool allocator for the subtree and parse tree classes (homebrew and not compliant to ANSI allocator requirements) (c) copyright Maarten Keijzer 1999, 2000. More...
struct  gp_parse_tree::MemPool::Link
struct  gp_parse_tree::MemPool::Chunk
class  gp_parse_tree::Node_alloc< T >
class  gp_parse_tree::Standard_alloc< T >
class  gp_parse_tree::Standard_Node_alloc< T >
class  gp_parse_tree::Tree_alloc< T >
class  gp_parse_tree::parse_tree< T >
class  gp_parse_tree::parse_tree< T >::subtree
class  gp_parse_tree::parse_tree< T >::base_iterator
class  gp_parse_tree::parse_tree< T >::iterator
class  gp_parse_tree::parse_tree< T >::embedded_iterator
class  gp_parse_tree::parse_tree< T >::base_const_iterator
class  gp_parse_tree::parse_tree< T >::const_iterator
class  gp_parse_tree::parse_tree< T >::embedded_const_iterator

Functions

+template<class T>
void do_the_swap (T &a, T &b)
 This ones defined because gcc does not always implement namespaces.
+

Detailed Description

+Parse_tree and subtree classes (c) copyright Maarten Keijzer 1999, 2000. +

+Permission to copy, use, modify, sell and distribute this software is granted provided this copyright notice appears in all copies. This software is provided "as is" without express or implied warranty, and with no claim as to its suitability for any purpose.

+Permission to modify the code and to distribute modified code is granted, provided the above notices as well as this one are retained, and a notice that the code was modified is included with the above copyright notice.

+Usage information.

+class Node (your node in the tree) must have the following implemented:

+Arity ******

+int arity(void) const

+Note: the default constructor of a Node should provide a Node with arity 0!

+Evaluation ******

+A parse_tree is evaluated through one of it's apply() members:

+1) parse_tree::apply(RetVal)

+is the simplest evaluation, it will call

+RetVal Node::operator()(RetVal, subtree<Node, RetVal>::const_iterator)

+(Unfortunately the first RetVal argument is mandatory (although you might not need it. This is because MSVC does not support member template functions properly. If it cannot deduce the template arguments (as is the case in templatizing over return value) you are not allowed to specify them. calling tree.apply<double>() would result in a syntax error. That is why you have to call tree.apply(double()) instead.)

+2) parse_tree::apply(RetVal v, It values)

+will call:

+RetVal Node::operator()(RetVal, subtree<... , It values)

+where It is whatever type you desire (most of the time this will be a std::vector containing the values of your variables);

+3) parse_tree::apply(RetVal, It values, It2 moreValues)

+will call:

+RetVal Node::operator()(RetVal, subtree<... , It values, It2 moreValues)

+although I do not see the immediate use of this, however...

+4) parse_tree::apply(RetVal, It values, It2 args, It3 adfs)

+that calls:

+RetVal Node::operator()(subtree<... , It values, It2 args, It3 adfs)

+can be useful for implementing adfs.

+In general it is a good idea to leave the specifics of the arguments open so that different ways of evaluation remain possible. Implement the simplest eval as:

+template <class it=""> RetVal operator()(RetVal dummy, It begin) const

+Internal Structure ******

+A parse_tree has two template arguments: the Node and the ReturnValue produced by evaluating the node. The structure of the tree is defined through a subtree class that has the same two template arguments.

+The nodes are stored in a tree like :

+node4 / \ node3 node2 / \ node1 node0

+where nodes 2 and 4 have arity 2 and nodes 0,1 and 3 arity 0 (terminals)

+The nodes are subtrees, containing the structure of the tree, together with its size and depth. They contain a Node, the user defined template argument. To access these nodes from a subtree, use operator-> or operator*.

+The numbers behind the nodes define a reverse-polish or postfix traversel through the tree. The parse_tree defines iterators on the tree such that

+tree.begin() points at the subtree at node0 and tree.back() returns the subtree at node4, the complete tree

+Likewise operator[] is defined on the tree, such that:

+tree[0] will return the subtree at node0, while tree[2] will return the subtree at node2

+Assigments of subtrees is protected so that the code:

+tree[2] = tree[0];

+will not crash and result in a tree structured as:

+node4 / \ node3 node0

+Note that the rank numbers no longer specify their place in the tree:

+tree[0] still points at node0, but tree[1] now points to node3 and tree[2] points at the root node4

+Embedded iterators are implemented to iterate over nodes rather than subtrees. So an easy way to copy your tree to a std::vector is:

+std::vector<Node> vec(tree.size()); copy(tree.ebegin(), tree.eend(), vec.begin());

+You can also copy it to an std::ostream_iterator with this technique, given that your Node implements an appropriate operator<<. Reinitializing a tree with the std::vector is also simple:

+tree.clear(); copy(vec.begin(), vec.end(), back_inserter(tree));

+or from an std::istream:

+copy(std::istream_iterator<T>(my_stream), std::istream_iterator<T>(), back_inserter(tree));

+Note that the back_inserter must be used as there is no resize member in the parse_tree. back_inserter will use the push_back member from the parse_tree +

+

Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/namespacemembers.html b/trunk/paradiseo-eo/doc/html/namespacemembers.html new file mode 100644 index 000000000..974bf3c3f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/namespacemembers.html @@ -0,0 +1,19 @@ + + +EO: Namespace Members + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
All | Functions
+ +

+Here is a list of all documented namespace members with links to the namespaces they belong to:

+
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/namespacemembers_func.html b/trunk/paradiseo-eo/doc/html/namespacemembers_func.html new file mode 100644 index 000000000..1d01d38d2 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/namespacemembers_func.html @@ -0,0 +1,19 @@ + + +EO: Namespace Members - Functions + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
All | Functions
+ +

+

+
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/namespaces.html b/trunk/paradiseo-eo/doc/html/namespaces.html new file mode 100644 index 000000000..e293e16a3 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/namespaces.html @@ -0,0 +1,16 @@ + + +EO: Namespace Index + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

EO Namespace List

Here is a list of all documented namespaces with brief descriptions: + +
gp_parse_treeParse_tree and subtree classes (c) copyright Maarten Keijzer 1999, 2000
+
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/node_8h-source.html b/trunk/paradiseo-eo/doc/html/node_8h-source.html new file mode 100644 index 000000000..c95ab524e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/node_8h-source.html @@ -0,0 +1,263 @@ + + +EO: node.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+app / gpsymreg
+

node.h

00001 /*
+00002     This library is free software; you can redistribute it and/or modify
+00003     it under the terms of the GNU General Public License as published by
+00004     the Free Software Foundation; either version 2 of the License, or
+00005     (at your option) any later version.
+00006     
+00007     This library is distributed in the hope that it will be useful,
+00008     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00009     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00010     Lesser General Public License for more details.
+00011  
+00012     You should have received a copy of the GNU General Public License
+00013     along with this library; if not, write to the Free Software
+00014     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00015  
+00016     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00017              jeggermo@liacs.nl
+00018 */
+00019 
+00020 #ifndef _NODE_H
+00021 #define _NODE_H
+00022 
+00023 
+00024 
+00025 #include <iostream>
+00026 #include <string>
+00027 #include <cmath> // for finite(double) function
+00028 
+00029 using namespace gp_parse_tree;
+00030 using namespace std;
+00031 
+00032 
+00033 /* A new Operation and Node class for even more flexibility.
+00034 
+00035    Improvements over the t-eoSymreg code are:
+00036    
+00037    * No hardcoded functions or operators. The Operation and Node class below
+00038      allow you to specify your own unary and binary functions as well as
+00039      binary operators (like +,-,*,/). Moreover you can detemine if you want
+00040      to allow primitve subroutines with either one or two arguments.
+00041      
+00042      If a Node has a subroutine Operation it will take evaluate the first 
+00043      (and possible second) child branch and use them as input variables for
+00044      the remaining second (or third) child branch.
+00045 */
+00046 
+00047 
+00048 typedef enum {Variable, UFunction, BFunction, BOperator, Const} Type;
+00049 
+00050 typedef double (*BinaryFunction)(const double,const double); 
+00051 typedef double (*UnaryFunction)(const double);
+00052 
+00053 struct Operation
+00054 {
+00055         public:
+00056                 
+00057                 typedef unsigned int VariableID;
+00058                 typedef string Label;
+00059 
+00060         
+00061                 // if your compiler allows you to have nameless unions you can make this a
+00062                 // union by removing the //'s below
+00063                 
+00064                 //union
+00065                 //{
+00066                         UnaryFunction uFunction;
+00067                         BinaryFunction bFunction;
+00068                         VariableID id;
+00069                         double constant;
+00070                 //};
+00071         
+00072                 
+00073         
+00074                 Label label;
+00075                 Type type;
+00076         
+00077                 // the default constructor results in a constant with value 0
+00078                 Operation() : constant(0),  label("0"), type(Const){};
+00079                 // two possible constructors for Unary Functions
+00080                 Operation(UnaryFunction _uf, Label _label): uFunction(_uf), label(_label), type(UFunction) {};
+00081                 Operation(Label _label, UnaryFunction _uf): uFunction(_uf), label(_label), type(UFunction) {};
+00082                 
+00083                 // Watch out there are two constructors using pointers two binary functions:
+00084                 // Binary Function (printed as label(subtree0,subtree1)  (e.g. pow(x,y))
+00085                 // Binary Operator (printed as (subtree0 label subtree1) (e.g. x^y)
+00086                 // The difference is purely cosmetic.
+00087                 
+00088                 // If you specify the label before the function pointer -> Binary Function
+00089                 Operation(Label _label, BinaryFunction _bf): bFunction(_bf), label(_label), type(BFunction) {};
+00090                 // If you specify the function pointer before the label -> Binary Operator
+00091                 Operation(BinaryFunction _bf, Label _label): bFunction(_bf), label(_label), type(BOperator) {};
+00092                 
+00093                 // A constructor for variables
+00094                 Operation(VariableID _id, Label _label): id(_id), label(_label), type(Variable) {};
+00095                 // A constructor for constants
+00096                 Operation(double _constant, Label _label): constant(_constant), label(_label), type(Const) {};
+00097                 
+00098                 
+00099                 Operation(const Operation &_op)
+00100                 {
+00101                         switch(_op.type)
+00102                         {
+00103                                 case Variable: id = _op.id; break;
+00104                                 case UFunction: uFunction = _op.uFunction;  break;
+00105                                 case BFunction: bFunction = _op.bFunction; break;
+00106                                 case BOperator: bFunction = _op.bFunction; break;
+00107                                 case Const: constant = _op.constant;  break;
+00108                         }
+00109                         type = _op.type;
+00110                         label = _op.label;
+00111                 };
+00112                 virtual ~Operation(){};
+00113         
+00114 };
+00115 
+00116 
+00117 class Node
+00118 {
+00119         private:
+00120                 Operation op;
+00121                 
+00122         public:
+00123         
+00124                 Node(void): op(Operation()){};
+00125                 Node(Operation &_op) : op(_op){};
+00126                 virtual ~Node(void) {}
+00127                 
+00128                 int arity(void) const 
+00129                 {
+00130                         switch(op.type)
+00131                         {
+00132                                 case Variable: return 0;
+00133                                 case UFunction: return 1;
+00134                                 case BFunction: return 2;
+00135                                 case BOperator: return 2;
+00136                                 case Const: return 0;
+00137                         }                       
+00138                         return 0;       
+00139                 }
+00140                 
+00141                 void randomize(void) {}
+00142                 
+00143                 template<class Children>
+00144                 void operator()(double& result, Children args, vector<double> &var) const
+00145                 {
+00146                         double result0;
+00147                         double result1;
+00148                         
+00149                         
+00150                         switch(op.type)
+00151                         {
+00152                                 case Variable:  result = var[op.id%var.size()]; //%var.size() used in the case of Subroutines and as a security measure
+00153                                                 break;
+00154                                 case UFunction: args[0].apply(result0, var);
+00155                                                 result = op.uFunction(result0); 
+00156                                                 break;
+00157                                 case BFunction: 
+00158                                 case BOperator: args[0].apply(result0, var);
+00159                                                 args[1].apply(result1, var);    
+00160                                                 result = op.bFunction(result0,result1);
+00161                                                 break;
+00162                                 case Const:     result = op.constant;
+00163                                                 break;  
+00164                                 
+00165                         }
+00166                         
+00167                 }
+00168                 
+00169                 template<class Children>
+00170                 void operator()(string& result, Children args) const
+00171                 {
+00172                         
+00173                         string subtree0;
+00174                         string subtree1;
+00175                         string subtree2;
+00176                         
+00177                         switch(op.type)
+00178                         {
+00179                                 
+00180                                 case Variable:  
+00181                                 case Const:     result += op.label;
+00182                                                 break;
+00183                                         
+00184                                 case UFunction: result += op.label;
+00185                                                 result += "(";
+00186                                                 args[0].apply(subtree0);
+00187                                                 result += subtree0;
+00188                                                 result += ")";
+00189                                                 break;
+00190                                 case BFunction: result += op.label;
+00191                                                 result += "(";
+00192                                                 args[0].apply(subtree0);
+00193                                                 result += subtree0;
+00194                                                 result += ",";
+00195                                                 args[1].apply(subtree1);
+00196                                                 result += subtree1;
+00197                                                 result += ")";
+00198                                                 break;                                                          
+00199                                 case BOperator: result += "(";
+00200                                                 args[0].apply(subtree0);
+00201                                                 result += subtree0;
+00202                                                 result += op.label;
+00203                                                 args[1].apply(subtree1);
+00204                                                 result += subtree1;
+00205                                                 result += ")";
+00206                                                 break;
+00207                                 default: result += "ERROR in Node::operator(string,...) \n"; break;             
+00208                         }
+00209                 }
+00210                 
+00211                 Operation getOp(void) const {return op;}
+00212         
+00213 };
+00214 
+00215                 
+00216                 
+00217 
+00218 
+00219 
+00220 
+00221 
+00222 
+00223 
+00224 
+00225 //-----------------------------------------------------------
+00226 // saving, loading LETS LEAVE IT OUT FOR NOW
+00227 
+00228 
+00229 
+00230 std::ostream& operator<<(std::ostream& os, const Node& eot)
+00231 {
+00232     Operation op(eot.getOp());
+00233     
+00234     os << (eot.getOp()).label;
+00235     return os;
+00236 }
+00237 
+00238 
+00239 // we can't load because we are using function pointers. Instead we prevent a compiler warning by calling the arity() function.
+00240 std::istream& operator>>(std::istream& is, Node& eot)
+00241 {
+00242     eot.arity();
+00243     return is;
+00244 }
+00245 
+00246 
+00247 
+00248 #endif
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/node__pool_8h-source.html b/trunk/paradiseo-eo/doc/html/node__pool_8h-source.html new file mode 100644 index 000000000..ee4ec59db --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/node__pool_8h-source.html @@ -0,0 +1,312 @@ + + +EO: node_pool.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / gp
+

node_pool.h

00001 
+00018 #ifndef node_pool_h
+00019 #define node_pool_h
+00020 
+00021 class MemPool
+00022 {
+00023 public :
+00024     
+00025     MemPool(unsigned int sz) : esize(sz<sizeof(Link)? sizeof(Link) : sz) {}
+00026     ~MemPool()
+00027     {
+00028         Chunk* n = chunks;
+00029         while(n)
+00030         {
+00031             Chunk* p = n;
+00032             n = n->next;
+00033             delete p;
+00034         }
+00035     }
+00036     
+00037     void* allocate()
+00038     {
+00039         if (head == 0) grow();
+00040         Link* p = head;
+00041         head = p->next;
+00042         return static_cast<void*>(p);
+00043     }
+00044 
+00045     void deallocate(void* b)
+00046     {
+00047         Link* p = static_cast<Link*>(b);
+00048         p->next = head;
+00049         head = p;
+00050     }
+00051 
+00052 private :
+00053 
+00054     void grow()
+00055     {
+00056         Chunk* n = new Chunk;
+00057         n->next = chunks;
+00058         chunks = n;
+00059 
+00060         const int nelem = Chunk::size/esize;
+00061         char* start = n->mem;
+00062         char* last  = &start[(nelem-1)*esize];
+00063         for (char* p = start; p < last; p += esize)
+00064         {
+00065             reinterpret_cast<Link*>(p)->next = 
+00066                 reinterpret_cast<Link*>(p + esize);
+00067         }
+00068         
+00069         reinterpret_cast<Link*>(last)->next = 0;
+00070         head = reinterpret_cast<Link*>(start);
+00071     }
+00072 
+00073     struct Link
+00074     {
+00075         Link* next;
+00076     };
+00077 
+00078     struct Chunk
+00079     {
+00080         enum {size = 8 * 1024 - 16};
+00081         Chunk* next;
+00082         char mem[size];
+00083     };
+00084 
+00085     Chunk* chunks;
+00086     const unsigned int esize;
+00087     Link* head;
+00088 };
+00089 
+00090 template<class T>
+00091 class Node_alloc
+00092 {
+00093 public :
+00094     
+00095     T* allocate(void) 
+00096     {
+00097         T* t = static_cast<T*>(mem.allocate());
+00098         t = new  (t) T;
+00099         return t;
+00100     }
+00101     
+00102     T* construct(const T& org) 
+00103     {
+00104         T* t = static_cast<T*>(mem.allocate());
+00105         t = new  (t) T(org);
+00106         return t;
+00107     }
+00108 
+00109     void deallocate(T* t)
+00110     {
+00111         t->~T(); // call destructor
+00112         mem.deallocate(static_cast<void*>(t));
+00113     }
+00114 
+00115 private :
+00116     static MemPool mem;
+00117 };
+00118 
+00119 
+00120 template <class T> 
+00121 class Standard_alloc
+00122 {
+00123 public :
+00124     Standard_alloc() {}
+00125 
+00126     T* allocate(size_t arity = 1)
+00127     {
+00128         if (arity == 0)
+00129             return 0;
+00130 
+00131         return new T [arity];
+00132     }
+00133     
+00134     T* construct(size_t arity, T* org)
+00135     {
+00136         if (arity == 0)
+00137             return 0;
+00138 
+00139         T* t = new T [arity];
+00140 
+00141         for (int i = 0; i < arity; ++i)
+00142         {
+00143             t = T(org[i]);
+00144         }
+00145     }
+00146 
+00147     void deallocate(T* t, size_t arity = 1)
+00148     {
+00149         if (arity == 0)
+00150             return ;
+00151 
+00152         delete [] t;
+00153     }
+00154 
+00155 };
+00156 
+00157 template <class T> 
+00158 class Standard_Node_alloc
+00159 {
+00160 public :
+00161     Standard_Node_alloc() {}
+00162 
+00163     T* allocate(void)
+00164     {
+00165         return new T;// [arity];
+00166     }
+00167 
+00168     T* construct(const T& org)
+00169     {
+00170         return new T(org);
+00171     }
+00172 
+00173     void deallocate(T* t)
+00174     {
+00175         delete t;
+00176     }
+00177 
+00178 };
+00179 
+00180 template <class T>
+00181 class Tree_alloc
+00182 {
+00183 public :
+00184     Tree_alloc() {}
+00185 
+00186     T* allocate(size_t arity)
+00187     {
+00188         T* t;
+00189 
+00190         switch(arity)
+00191         {
+00192 
+00193         case 0 : return 0;
+00194         case 1 :
+00195             {
+00196                 t = static_cast<T*>(mem1.allocate());
+00197                 new (t) T;
+00198                 break;
+00199             }
+00200         case 2 :
+00201             {
+00202                 t = static_cast<T*>(mem2.allocate());
+00203                 new (t) T;
+00204                 new (&t[1]) T;
+00205                 break;
+00206             }
+00207         case 3 :
+00208             {
+00209                 t = static_cast<T*>(mem3.allocate());
+00210                 new (t) T;
+00211                 new (&t[1]) T;
+00212                 new (&t[2]) T;
+00213                 break;
+00214             }
+00215         default :
+00216             {
+00217                 return new T[arity];
+00218             }
+00219         }
+00220 
+00221         return t;
+00222      }
+00223 
+00224     T* construct(size_t arity, T* org)
+00225     {
+00226         T* t;
+00227 
+00228         switch(arity)
+00229         {
+00230 
+00231         case 0 : return 0;
+00232         case 1 :
+00233             {
+00234                 t = static_cast<T*>(mem1.allocate());
+00235                 new (t) T(*org);
+00236                 break;
+00237             }
+00238         case 2 :
+00239             {
+00240                 t = static_cast<T*>(mem2.allocate());
+00241                 new (t) T(*org);
+00242                 new (&t[1]) T(org[1]);
+00243                 break;
+00244             }
+00245         case 3 :
+00246             {
+00247                 t = static_cast<T*>(mem3.allocate());
+00248                 new (t) T(*org);
+00249                 new (&t[1]) T(org[1]);
+00250                 new (&t[1]) T(org[2]);
+00251                 break;
+00252             }
+00253         default :
+00254             {
+00255                 t = new T[arity]; // does call default ctor
+00256                 for (int i = 0; i < arity; ++i)
+00257                 {
+00258                     t[i] = T(org[i]); // constructs now
+00259                 }
+00260             }
+00261         }
+00262 
+00263         return t;
+00264      }
+00265 
+00266 
+00267 
+00268     void deallocate(T* t, size_t arity)
+00269     {
+00270         switch(arity)
+00271         {
+00272         case 0: return;
+00273         case 3 : 
+00274             {
+00275                 t[2].~T(); t[1].~T(); t[0].~T();
+00276                 mem3.deallocate(static_cast<void*>(t));
+00277                 return;
+00278             }
+00279         case 2 : 
+00280             {
+00281                 t[1].~T(); t[0].~T();
+00282                 mem2.deallocate(static_cast<void*>(t));
+00283                 return;
+00284             }
+00285         case 1 : 
+00286             {
+00287                 t[0].~T();
+00288                 mem1.deallocate(static_cast<void*>(t));
+00289                 return;
+00290             }
+00291         default :
+00292             {
+00293                 delete [] t;
+00294                 return;
+00295             }
+00296         }
+00297     }
+00298     
+00299 
+00300 private :
+00301     static MemPool mem1;
+00302     static MemPool mem2;
+00303     static MemPool mem3;
+00304 };
+00305 
+00306 // static (non thread_safe) memory pools
+00307 template <class T> MemPool Node_alloc<T>::mem  = sizeof(T);
+00308 
+00309 template <class T> MemPool Tree_alloc<T>::mem1 = sizeof(T);
+00310 template <class T> MemPool Tree_alloc<T>::mem2 = sizeof(T) * 2;
+00311 template <class T> MemPool Tree_alloc<T>::mem3 = sizeof(T) * 3;
+00312 
+00313 #endif
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/pages.html b/trunk/paradiseo-eo/doc/html/pages.html new file mode 100644 index 000000000..500bce1f1 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/pages.html @@ -0,0 +1,21 @@ + + +EO: Page Index + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

EO Related Pages

Here is a list of all related documentation pages: +
Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/parameters_8h-source.html b/trunk/paradiseo-eo/doc/html/parameters_8h-source.html new file mode 100644 index 000000000..6b1c1bc88 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/parameters_8h-source.html @@ -0,0 +1,127 @@ + + +EO: parameters.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+app / gpsymreg
+

parameters.h

00001 /*
+00002     This library is free software; you can redistribute it and/or modify
+00003     it under the terms of the GNU General Public License as published by
+00004     the Free Software Foundation; either version 2 of the License, or
+00005     (at your option) any later version.
+00006     
+00007     This library is distributed in the hope that it will be useful,
+00008     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00009     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00010     Lesser General Public License for more details.
+00011  
+00012     You should have received a copy of the GNU General Public License
+00013     along with this library; if not, write to the Free Software
+00014     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00015  
+00016     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00017              jeggermo@liacs.nl
+00018 */
+00019 
+00020 #ifndef _PARAMETERS_FUNCTION_H
+00021 #define _PARAMETERS_FUNCTION_H
+00022 
+00023 #include <gp/eoParseTree.h>
+00024 #include <eo>
+00025 
+00026 using namespace gp_parse_tree;
+00027 using namespace std;
+00028 
+00029 struct Parameters{
+00030                         unsigned int nGenerations;      // -G
+00031                         unsigned population_size;       // -P   
+00032                         unsigned offspring_size;        // -O
+00033                         unsigned int MaxSize;           // -S
+00034                         unsigned int InitMaxDepth;      // -D
+00035                         unsigned int randomseed;        // -R
+00036                         double xover_rate;              // -x
+00037                         double mutation_rate;           // -y
+00038                         unsigned int tournamentsize;    // -t
+00039 
+00040 
+00041                         Parameters(int argc, char **argv)
+00042                         {
+00043                                 eoParser parser(argc,argv);
+00044                         
+00045                                 // generations
+00046                                 eoValueParam<unsigned int> paramGenerations(1, "generations", "Generations", 'G', false);
+00047                                 parser.processParam( paramGenerations );
+00048                                 nGenerations = paramGenerations.value();
+00049                                 cerr << "nGenerations= " << nGenerations << endl;
+00050         
+00051                                 // populationsize
+00052                                 eoValueParam<unsigned int> paramPopulationSize(10, "populationsize", "PopulationSize", 'P', false);
+00053                                 parser.processParam( paramPopulationSize );
+00054                                 population_size = paramPopulationSize.value();
+00055                                 cerr << "population_size= " << population_size << endl;
+00056         
+00057                                 // offspringsize
+00058                                 eoValueParam<unsigned int> paramOffspringSize(population_size, "offspringsize", "OffspringSize", 'O', false);
+00059                                 parser.processParam( paramOffspringSize );
+00060                                 offspring_size = paramOffspringSize.value();
+00061                                 cerr << "offspring_size= " << offspring_size << endl;
+00062         
+00063                                 // maxsize
+00064                                 eoValueParam<unsigned int> paramMaxSize(15, "maxsize", "MaxSize", 'S', false);
+00065                                 parser.processParam( paramMaxSize );
+00066                                 MaxSize = paramMaxSize.value();
+00067                                 cerr << "MaxSize= " << MaxSize << endl;
+00068         
+00069                                 // initialmaxdepth
+00070                                 eoValueParam<unsigned int> paramInitialMaxDepth(4, "initialmaxdepth", "InitialMaxDepth", 'D', false);
+00071                                 parser.processParam( paramInitialMaxDepth );
+00072                                 InitMaxDepth = paramInitialMaxDepth.value();
+00073                                 cerr << "InitMaxDepth= " << InitMaxDepth << endl;
+00074                         
+00075                                 // randomseed
+00076                                 eoValueParam<unsigned int> paramRandomSeed(1, "randomseed", "Random Seed", 'R', false);
+00077                                 parser.processParam( paramRandomSeed );
+00078                                 randomseed = paramRandomSeed.value();
+00079                                 cerr << "randomseed= " << randomseed << endl;
+00080         
+00081                                 
+00082                                 // crossover-rate
+00083                                 eoValueParam<double> paramXover(0.75, "crossoverrate", "crossover rate", 'x', false);
+00084                                 parser.processParam(paramXover );
+00085                                 xover_rate = paramXover.value();
+00086                                 cerr << "xover_rate= " << xover_rate << endl;
+00087         
+00088                                 //mutation-rate
+00089                                 eoValueParam<double> paramMutation(0.25, "mutationrate", "mutation rate", 'm', false);
+00090                                 parser.processParam(paramMutation );
+00091                                 mutation_rate = paramMutation.value();
+00092                                 cerr << "mutation_rate= " << mutation_rate << endl;
+00093                                 
+00094                                 //tournament size
+00095                                 eoValueParam<unsigned int > paramTournamentSize(5, "tournamentsize", "tournament size", 't', false);
+00096                                 parser.processParam(paramTournamentSize );
+00097                                 tournamentsize = paramTournamentSize.value();
+00098                                 cerr << "Tournament Size= " << tournamentsize << endl;
+00099                                 
+00100         
+00101                                 if (parser.userNeedsHelp())
+00102                                 {
+00103                                         parser.printHelp(cout);
+00104                                         exit(1);
+00105                                 }
+00106 
+00107                         };
+00108                         
+00109                         ~Parameters(){};
+00110 };                      
+00111 
+00112 #endif
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/parse__tree_8h-source.html b/trunk/paradiseo-eo/doc/html/parse__tree_8h-source.html new file mode 100644 index 000000000..2df3e9e0e --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/parse__tree_8h-source.html @@ -0,0 +1,862 @@ + + +EO: parse_tree.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / gp
+

parse_tree.h

00001 #ifndef PARSE_TREE_HH
+00002 #define PARSE_TREE_HH
+00003 
+00155 #include <vector>
+00156 #include <utility> // for swap
+00157 
+00158 #ifdef _MSC_VER
+00159 #pragma warning(disable : 4786) // disable this nagging warning about the limitations of the mirkosoft debugger
+00160 #endif
+00161 
+00162 namespace gp_parse_tree
+00163 {
+00164 
+00165 #include "node_pool.h"
+00166 
+00168 template <class T>
+00169 inline void do_the_swap(T& a, T& b)
+00170 {
+00171   T tmp = a;
+00172   a = b;
+00173   b = tmp;
+00174 }
+00175 
+00176 template <class T> class parse_tree
+00177 {
+00178   public :
+00179 
+00180 
+00181 class subtree
+00182 {
+00183 
+00184 /*
+00185     a bit nasty way to use a pool allocator (which would otherwise use slooow new and delete)
+00186     TODO: use the std::allocator interface
+00187 */
+00188 
+00189 #if (defined(__GNUC__) || defined(_MSC_VER)) && !(defined(_MT) || defined(MACOSX) || defined(__APPLE__)) // not multithreaded (or MACOSX - J. Eggermont)
+00190     Node_alloc<T>         node_allocator;
+00191     Tree_alloc<subtree>   tree_allocator;
+00192 #else
+00193     Standard_Node_alloc<T>    node_allocator;
+00194     Standard_alloc<subtree>   tree_allocator;
+00195 #endif
+00196 
+00197 public :
+00198 
+00199     typedef subtree* iterator;
+00200     typedef const subtree* const_iterator;
+00201 
+00202         /* Constructors, assignments */
+00203 
+00204     subtree(void) : content(node_allocator.allocate()), args(0), parent(0), _cumulative_size(0), _depth(0), _size(1)
+00205                         {}
+00206     subtree(const subtree& s)
+00207         : content(node_allocator.allocate()),
+00208           args(0),
+00209           parent(0),
+00210           _cumulative_size(1),
+00211           _depth(1),
+00212           _size(1)
+00213     {
+00214         copy(s);
+00215     }
+00216 
+00217     subtree(const T& t) : content(node_allocator.allocate()), args(0), parent(0), _cumulative_size(0), _depth(0), _size(1)
+00218                         { copy(t); }
+00219 
+00220     template <class It>
+00221         subtree(It b, It e) : content(node_allocator.allocate()), args(0), parent(0), _cumulative_size(0), _depth(0), _size(1)
+00222     { // initialize in prefix order for efficiency reasons
+00223         init(b, --e);
+00224     }
+00225 
+00226     virtual ~subtree(void)    { tree_allocator.deallocate(args, arity()); node_allocator.deallocate(content); }
+00227 
+00228     subtree& operator=(const subtree& s)
+00229         {
+00230             if (s.get_root() == get_root())
+00231         { // from the same tree, maybe a child. Don't take any chances
+00232             subtree anotherS = s;
+00233             return copy(anotherS);
+00234         }
+00235 
+00236                 copy(s);
+00237         updateAfterInsert();
+00238         return *this;
+00239         }
+00240 
+00241     subtree& operator=(const T& t)       { copy(t); updateAfterInsert(); return *this; }
+00242 
+00243         /* Access to the nodes */
+00244 
+00245     T&       operator*(void)             { return *content; }
+00246     const T& operator*(void) const       { return *content; }
+00247     T*       operator->(void)            { return content; }
+00248     const T* operator->(void) const      { return content; }
+00249 
+00250         /* Equality, inequality check, Node needs to implement operator== */
+00251 
+00252         bool operator==(const subtree& other) const
+00253         {
+00254                 if (! (*content == *other.content))
+00255                         return false;
+00256 
+00257                 for (int i = 0; i < arity(); i++)
+00258                 {
+00259                         if (!(args[i] == other.args[i]))
+00260                                 return false;
+00261                 }
+00262 
+00263                 return true;
+00264         }
+00265 
+00266         bool operator !=(const subtree& other) const
+00267         {
+00268                 return !operator==(other);
+00269         }
+00270 
+00271         /* Arity */
+00272     int arity(void) const                { return content->arity(); }
+00273 
+00274         /* Evaluation with an increasing amount of user defined arguments */
+00275         template <class RetVal>
+00276         void apply(RetVal& v) const                              { (*content)(v, begin()); }
+00277 
+00278         template <class RetVal, class It>
+00279         void apply(RetVal& v, It values) const
+00280     {
+00281         (*content)(v, begin(), values);
+00282     }
+00283 
+00284     template <class RetVal, class It>
+00285     void apply_mem_func(RetVal& v, It misc, void (T::* f)(RetVal&, typename subtree::iterator, It))
+00286     {
+00287         (content->*f)(v, begin(), misc);
+00288     }
+00289 
+00290 
+00291 /*      template <class RetVal, class It, class It2>
+00292         void apply(RetVal& v, It values, It2 moreValues) const
+00293                 { (*content)(v, begin(), values, moreValues); }
+00294 
+00295         template <class RetVal, class It, class It2, class It3>
+00296         void apply(RetVal& v, It values, It2 moreValues, It3 evenMoreValues) const
+00297                 { (*content)(v, begin(), values, moreValues, evenMoreValues); }
+00298 */
+00299 
+00300     template <class Pred>
+00301     void find_nodes(std::vector<subtree*>& result, Pred& p)
+00302     {
+00303         if (p(*content))
+00304         {
+00305             result.push_back(this);
+00306         }
+00307 
+00308         for (int i = 0; i < arity(); ++i)
+00309         {
+00310             args[i].find_nodes(result, p);
+00311         }
+00312     }
+00313 
+00314     template <class Pred>
+00315     void find_nodes(std::vector<const subtree*>& result, Pred& p) const
+00316     {
+00317         if (p(*content))
+00318         {
+00319             result.push_back(this);
+00320         }
+00321 
+00322         for (int i = 0; i < arity(); ++i)
+00323         {
+00324             args[i].find_nodes(result, p);
+00325         }
+00326     }
+00327 
+00328         /* Iterators */
+00329 
+00330     iterator begin(void)              { return args; }
+00331     const_iterator begin(void) const  { return args; }
+00332 
+00333     iterator end(void)                { return args + arity(); }
+00334     const_iterator end(void) const    { return args + arity(); }
+00335 
+00336         subtree& operator[](int i)                { return *(begin() + i); }
+00337         const subtree& operator[](int i) const { return *(begin() + i); }
+00338 
+00339         /* Some statistics */
+00340 
+00341     size_t size(void) const { return _size; }
+00342 
+00343     size_t cumulative_size(void) const { return _cumulative_size; }
+00344     size_t depth(void) const           { return _depth; }
+00345 
+00346     const subtree& select_cumulative(size_t which) const
+00347     { return imp_select_cumulative(which); }
+00348 
+00349     subtree& select_cumulative(size_t which)
+00350     { return const_cast<subtree&>(imp_select_cumulative(which)); }
+00351 
+00352     subtree& get_node(size_t which)
+00353     { return const_cast<subtree&>(imp_get_node(which));}
+00354     const subtree& get_node(size_t which) const
+00355     { return imp_get_node(which); }
+00356 
+00357     subtree*       get_parent(void)        { return parent; }
+00358     const subtree* get_parent(void) const  { return parent; }
+00359 
+00360         void clear(void)
+00361         { tree_allocator.deallocate(args, arity()); args = 0; *content = T(); parent = 0; _cumulative_size = 0; _depth = 0; _size = 0; }
+00362 
+00363         void swap(subtree& y)
+00364         {
+00365         do_the_swap(content, y.content);
+00366         do_the_swap(args, y.args);
+00367 
+00368         adopt();
+00369         y.adopt();
+00370 
+00371         do_the_swap(parent, y.parent);
+00372 
+00373         do_the_swap(_cumulative_size, y._cumulative_size);
+00374         do_the_swap(_depth, y._depth);
+00375         do_the_swap(_size, y._size);
+00376                 updateAfterInsert();
+00377         }
+00378 
+00379 protected :
+00380 
+00381         virtual void updateAfterInsert(void)
+00382     {
+00383         _depth = 0;
+00384         _size = 1;
+00385         _cumulative_size = 0;
+00386 
+00387         for (iterator it = begin(); it != end(); ++it)
+00388         {
+00389             _size += it->size();
+00390             _cumulative_size += it->_cumulative_size;
+00391             _depth = it->_depth > _depth? it->_depth: _depth;
+00392         }
+00393         _cumulative_size += _size;
+00394         _depth++;
+00395 
+00396         if (parent)
+00397             parent->updateAfterInsert();
+00398     }
+00399 
+00400 private :
+00401 
+00402     const subtree& imp_select_cumulative(size_t which) const
+00403     {
+00404         if (which >= (_cumulative_size - size()))
+00405             return *this;
+00406         // else
+00407 
+00408         for (int i = arity() - 1; i >= 0; --i)
+00409                 {
+00410             if (which < args[i]._cumulative_size)
+00411                 return args[i].imp_select_cumulative(which);
+00412             which -= args[i]._cumulative_size;
+00413         }
+00414 
+00415         return *this; // error!
+00416     }
+00417 
+00418     const subtree& imp_get_node(size_t which) const
+00419     {
+00420         if (which == size() - 1)
+00421             return *this;
+00422 
+00423         for (int i = arity() - 1; i >= 0; --i)
+00424                 {
+00425             unsigned c_size = args[i].size();
+00426             if (which < c_size)
+00427                 return args[i].imp_get_node(which);
+00428             which -= c_size;
+00429         }
+00430 
+00431         return *this; // error!
+00432     }
+00433 
+00434     const subtree* get_root(void) const
+00435     {
+00436         if (parent == 0)
+00437             return this;
+00438         // else
+00439 
+00440         return parent->get_root();
+00441     }
+00442     subtree& copy(const subtree& s)
+00443     {
+00444                 int old_arity = arity();
+00445 
+00446                 int new_arity = s.arity();
+00447 
+00448                 if (new_arity != old_arity)
+00449                 {
+00450                         tree_allocator.deallocate(args, old_arity);
+00451 
+00452             args = tree_allocator.allocate(new_arity);
+00453                 }
+00454 
+00455                 switch(new_arity)
+00456                 {
+00457                 case 3 : args[2].copy(s.args[2]); args[2].parent = this; // no break!
+00458                 case 2 : args[1].copy(s.args[1]); args[1].parent = this;
+00459                 case 1 : args[0].copy(s.args[0]); args[0].parent = this;
+00460                 case 0 : break;
+00461                 default :
+00462                         {
+00463                                 for (int i = 0; i < new_arity; ++i)
+00464                                 {
+00465                                         args[i].copy(s.args[i]);
+00466                     args[i].parent = this;
+00467                                 }
+00468                         }
+00469                 }
+00470 
+00471                 *content = *s.content;
+00472         _size = s._size;
+00473         _depth = s._depth;
+00474         _cumulative_size = s._cumulative_size;
+00475 
+00476         return *this;
+00477     }
+00478 
+00479     subtree& copy(const T& t)
+00480     {
+00481         int oldArity = arity();
+00482 
+00483                 if (content != &t)
+00484             *content = t;
+00485                 else
+00486                         oldArity = -1;
+00487 
+00488                 int ar = arity();
+00489 
+00490                 if (ar != oldArity)
+00491                 {
+00492             if (oldArity != -1)
+00493                             tree_allocator.deallocate(args, oldArity);
+00494 
+00495             args = tree_allocator.allocate(ar);
+00496 
+00497             //if (ar > 0)
+00498                         //      args = new subtree [ar];
+00499                         //else
+00500                         //      args = 0;
+00501                 }
+00502 
+00503         adopt();
+00504         updateAfterInsert();
+00505                 return *this;
+00506     }
+00507 
+00508         void disown(void)
+00509         {
+00510                 switch(arity())
+00511                 {
+00512                 case 3 : args[2].parent = 0; // no break!
+00513                 case 2 : args[1].parent = 0;
+00514                 case 1 : args[0].parent = 0; break;
+00515                 case 0 : break;
+00516                 default :
+00517                         {
+00518                                 for (iterator it = begin(); it != end(); ++it)
+00519                                 {
+00520                                         it->parent = 0;
+00521                                 }
+00522                         }
+00523                 }
+00524 
+00525         }
+00526 
+00527     void adopt(void)
+00528     {
+00529                 switch(arity())
+00530                 {
+00531                 case 3 : args[2].parent = this; // no break!
+00532                 case 2 : args[1].parent = this;
+00533                 case 1 : args[0].parent = this; break;
+00534                 case 0 : break;
+00535                 default :
+00536                         {
+00537                                 for (iterator it = begin(); it != end(); ++it)
+00538                                 {
+00539                                         it->parent = this;
+00540                                 }
+00541                         }
+00542                 }
+00543     }
+00544 
+00545     template <class It>
+00546     void init(It b, It& last)
+00547     {
+00548         *this = *last;
+00549 
+00550 #ifndef NDEBUG
+00551         if (last == b && arity() > 0)
+00552         {
+00553             throw "subtree::init()";
+00554         }
+00555 #endif
+00556 
+00557         for (int i = 0; i < arity(); ++i)
+00558         {
+00559             args[i].parent = 0;
+00560             args[i].init(b, --last);
+00561             args[i].parent = this;
+00562         }
+00563 
+00564         updateAfterInsert();
+00565     }
+00566 
+00567     T* content;
+00568     subtree*                    args;
+00569     subtree*                    parent;
+00570 
+00571         size_t _cumulative_size;
+00572     size_t _depth;
+00573     size_t _size;
+00574 };
+00575 
+00576 // Continuing with parse_tree
+00577 
+00578     typedef T value_type;
+00579 
+00580         /* Constructors and Assignments */
+00581 
+00582     parse_tree(void) : _root(), pushed() {}
+00583     parse_tree(const parse_tree& org) : _root(org._root), pushed(org.pushed) { }
+00584     parse_tree(const subtree& sub) : _root(sub), pushed() { }
+00585 
+00586     template <class It>
+00587         parse_tree(It b, It e) : _root(b, e), pushed() {}
+00588 
+00589     virtual ~parse_tree(void) {}
+00590 
+00591     parse_tree& operator=(const parse_tree& org) { return copy(org); }
+00592         parse_tree& operator=(const subtree& sub)
+00593                 { return copy(sub); }
+00594 
+00595 
+00596         /* Equality and inequality */
+00597 
+00598         bool operator==(const parse_tree& other) const
+00599         { return _root == other._root; }
+00600 
+00601         bool operator !=(const parse_tree& other) const
+00602         { return !operator==(other); }
+00603 
+00604         /* Simple tree statistics */
+00605 
+00606     size_t size(void) const  { return _root.size(); }
+00607         size_t depth(void) const { return _root.depth(); }
+00608     void clear(void)        { _root.clear(); pushed.resize(0); }
+00609 
+00610         /* Evaluation (application), with an increasing number of user defined arguments */
+00611 
+00612         template <class RetVal>
+00613         void apply(RetVal& v) const
+00614                 { _root.apply(v); }
+00615 
+00616         template <class RetVal, class It>
+00617                 void apply(RetVal& v, It varValues) const
+00618                 { _root.apply(v, varValues); }
+00619 
+00620     template <class RetVal, class It>
+00621         void apply_mem_func(RetVal& v, It misc, void (T::* f)(RetVal&, typename subtree::iterator, It))
+00622     {
+00623         _root.apply_mem_func(v, misc, f);
+00624     }
+00625 
+00626         //template <class RetVal, class It, class It2>
+00627         //      void apply(RetVal& v, It varValues, It2 moreValues) const
+00628         //      { _root.apply(v, varValues, moreValues); }
+00629 
+00630         //template <class RetVal, class It, class It2, class It3>
+00631         //      void apply(RetVal& v, It varValues, It2 moreValues, It3 evenMoreValues) const
+00632         //      { _root.apply(v, varValues, moreValues, evenMoreValues); }
+00633 
+00634     template <class Pred>
+00635     void find_nodes(std::vector<subtree*>& result, Pred& p)
+00636     {
+00637         _root.find_nodes(result, p);
+00638     }
+00639 
+00640     template <class Pred>
+00641     void find_nodes(std::vector<const subtree*>& result, Pred& p) const
+00642     {
+00643         _root.find_nodes(p);
+00644     }
+00645 
+00646         /* Customized Swap */
+00647         void swap(parse_tree<T>& other)
+00648         {
+00649                 do_the_swap(pushed, other.pushed);
+00650                 _root.swap(other._root);
+00651         }
+00652 
+00653         /* Definitions of the iterators */
+00654 
+00655     class base_iterator
+00656     {
+00657     public :
+00658 
+00659         base_iterator() {}
+00660         base_iterator(subtree* n)  { node = n; }
+00661 
+00662         base_iterator& operator=(const base_iterator& org)
+00663         { node = org.node; return *this; }
+00664 
+00665         bool operator==(const base_iterator& org) const
+00666         { return node == org.node; }
+00667         bool operator!=(const base_iterator& org) const
+00668         { return !operator==(org); }
+00669 
+00670                 base_iterator operator+(size_t n) const
+00671                 {
+00672                         base_iterator tmp = *this;
+00673 
+00674                         for(;n != 0; --n)
+00675                         {
+00676                                 ++tmp;
+00677                         }
+00678 
+00679                         return tmp;
+00680                 }
+00681 
+00682                 base_iterator& operator++(void)
+00683         {
+00684             subtree* parent = node->get_parent();
+00685 
+00686             if (parent == 0)
+00687             {
+00688                 node = 0;
+00689                 return *this;
+00690             }
+00691             // else
+00692             typename subtree::iterator it;
+00693             for (it = parent->begin(); it != parent->end(); ++it)
+00694             {
+00695                 if (node == &(*it))
+00696                     break;
+00697             }
+00698 
+00699             if (it == parent->begin())
+00700                 node = parent;
+00701             else
+00702             {
+00703                 node = &(--it)->get_node(0);
+00704             }
+00705 
+00706             return *this;
+00707         }
+00708 
+00709         base_iterator operator++(int)
+00710         {
+00711             base_iterator tmp = *this;
+00712             operator++();
+00713             return tmp;
+00714         }
+00715 
+00716     protected :
+00717         subtree* node;
+00718     };
+00719 
+00720     class iterator : public base_iterator
+00721     {
+00722     public:
+00723 
+00724         using base_iterator::node;
+00725 
+00726         typedef std::forward_iterator_tag iterator_category;
+00727         typedef subtree value_type;
+00728         typedef size_t distance_type;
+00729         typedef size_t difference_type;
+00730         typedef subtree* pointer;
+00731         typedef subtree& reference;
+00732 
+00733         iterator() : base_iterator() {}
+00734         iterator(subtree* n): base_iterator(n)  {}
+00735         iterator& operator=(const iterator& org)
+00736         { base_iterator::operator=(org); return *this; }
+00737 
+00738         subtree& operator*(void)  { return *node; }
+00739         subtree* operator->(void) { return node; }
+00740     };
+00741 
+00742 
+00743 
+00744     class embedded_iterator : public base_iterator
+00745     {
+00746     public:
+00747 
+00748         using base_iterator::node;
+00749 
+00750         typedef std::forward_iterator_tag iterator_category;
+00751         typedef T value_type;
+00752         typedef size_t distance_type;
+00753         typedef size_t difference_type;
+00754         typedef T* pointer;
+00755         typedef T& reference;
+00756 
+00757         embedded_iterator() : base_iterator() {}
+00758         embedded_iterator(subtree* n): base_iterator(n)  {}
+00759         embedded_iterator& operator=(const embedded_iterator& org)
+00760         { base_iterator::operator=(org); return *this; }
+00761 
+00762         T&  operator*(void)  { return **node; }
+00763         T* operator->(void) { return &**node; }
+00764     };
+00765 
+00766     class base_const_iterator
+00767     {
+00768     public:
+00769 
+00770         base_const_iterator() {}
+00771         base_const_iterator(const subtree* n)  { node = n; }
+00772 
+00773         base_const_iterator& operator=(const base_const_iterator& org)
+00774         { node = org.node; return *this; }
+00775 
+00776         bool operator==(const base_const_iterator& org) const
+00777         { return node == org.node; }
+00778         bool operator!=(const base_const_iterator& org) const
+00779         { return !operator==(org); }
+00780 
+00781         base_const_iterator& operator++(void)
+00782         {
+00783             const subtree* parent = node->get_parent();
+00784 
+00785             if (parent == 0)
+00786             {
+00787                 node = 0;
+00788                 return *this;
+00789             }
+00790             // else
+00791             typename subtree::const_iterator it;
+00792 
+00793             for (it = parent->begin(); it != parent->end(); ++it)
+00794             {
+00795                 if (node == &(*it))
+00796                     break;
+00797             }
+00798 
+00799             if (it == parent->begin())
+00800                 node = parent;
+00801             else
+00802                 node = &(--it)->get_node(0);
+00803             return *this;
+00804         }
+00805 
+00806         base_const_iterator operator++(int)
+00807         {
+00808             base_const_iterator tmp = *this;
+00809             operator++();
+00810             return tmp;
+00811         }
+00812 
+00813     protected :
+00814 
+00815         const subtree* node;
+00816     };
+00817 
+00818     class const_iterator : public base_const_iterator
+00819     {
+00820     public:
+00821 
+00822         using base_iterator::node;
+00823 
+00824         typedef std::forward_iterator_tag iterator_category;
+00825         typedef const subtree value_type;
+00826         typedef size_t distance_type;
+00827         typedef size_t difference_type;
+00828         typedef const subtree* pointer;
+00829         typedef const subtree& reference;
+00830 
+00831         const_iterator() : base_const_iterator() {}
+00832         const_iterator(const subtree* n): base_const_iterator(n)  {}
+00833         const_iterator& operator=(const const_iterator& org)
+00834         { base_const_iterator::operator=(org); return *this; }
+00835 
+00836         const subtree& operator*(void)  { return *node; }
+00837         const subtree* operator->(void) { return node; }
+00838     };
+00839 
+00840     class embedded_const_iterator : public base_const_iterator
+00841     {
+00842     public:
+00843 
+00844         using base_const_iterator::node;
+00845 
+00846                 typedef std::forward_iterator_tag iterator_category;
+00847                 typedef const T value_type;
+00848                 typedef size_t distance_type;
+00849                 typedef size_t difference_type;
+00850                 typedef const T* pointer;
+00851                 typedef const T& reference;
+00852 
+00853         embedded_const_iterator() : base_const_iterator() {}
+00854         embedded_const_iterator(const subtree* n): base_const_iterator(n)  {}
+00855         embedded_const_iterator& operator=(const embedded_const_iterator& org)
+00856         { base_const_iterator::operator=(org); return *this; }
+00857 
+00858                 embedded_const_iterator operator+(size_t n) const
+00859                 {
+00860                         embedded_const_iterator tmp = *this;
+00861 
+00862                         for(;n != 0; --n)
+00863                         {
+00864                                 ++tmp;
+00865                         }
+00866 
+00867                         return tmp;
+00868                 }
+00869 
+00870         const T&  operator*(void)  const { return **node; }
+00871         const T*  operator->(void) const { return node->operator->(); }
+00872     };
+00873 
+00874         /* Iterator access */
+00875 
+00876     iterator begin(void)            { return iterator(&operator[](0)); }
+00877     const_iterator begin(void) const { return const_iterator(&operator[](0)); }
+00878     iterator end(void)               { return iterator(0); }
+00879     const_iterator end(void) const   { return const_iterator(0);}
+00880 
+00881     embedded_iterator       ebegin(void)       { return embedded_iterator(&operator[](0)); }
+00882     embedded_const_iterator ebegin(void) const { return embedded_const_iterator(&operator[](0)); }
+00883     embedded_iterator       eend(void)         { return embedded_iterator(0); }
+00884     embedded_const_iterator eend(void) const   { return embedded_const_iterator(0);}
+00885 
+00886     bool empty(void) const { return size() == 0; }
+00887     bool valid(void) const { return pushed.empty(); }
+00888 
+00889         /* push_back */
+00890 
+00891         void push_back(const parse_tree<T>& tree)
+00892         {
+00893                 if (!empty())
+00894                         pushed.push_back(_root);
+00895 
+00896                 _root = tree.back();
+00897         }
+00898 
+00899     void push_back(const T& t)
+00900     {
+00901         if (!empty())
+00902             pushed.push_back(_root);
+00903 
+00904                 _root = t;
+00905 
+00906         for (typename subtree::iterator it = _root.begin(); it != _root.end(); it++)
+00907         {
+00908                         *it = pushed.back();
+00909             pushed.pop_back();
+00910         }
+00911 
+00912     }
+00913 
+00914         /* Access to subtrees */
+00915 
+00916     subtree& back(void)              { return _root; }
+00917     const subtree& back(void) const  { return _root; }
+00918     subtree& root(void)              { return _root; }
+00919     const subtree& root(void) const  { return _root; }
+00920 
+00921     subtree& front(void)              { return _root[0]; }
+00922     const subtree& front(void) const  { return _root[0]; }
+00923 
+00924     subtree& operator[](size_t i)
+00925     { return const_cast<subtree&>(_root.get_node(i)); }
+00926     const subtree& operator[](size_t i) const
+00927     { return _root.get_node(i); }
+00928 
+00929     subtree& get_cumulative(size_t i)
+00930     { return const_cast<subtree&>(_root.get_cumulative(i)); }
+00931     const subtree& get_cumulative(size_t i) const
+00932     { return get_cumulative(i); }
+00933 
+00934     private :
+00935 
+00936     parse_tree& copy(const parse_tree& org)
+00937     {
+00938         _root = org._root;
+00939         pushed = org.pushed;
+00940 
+00941         return *this;
+00942     }
+00943 
+00944         parse_tree& copy(const subtree& sub)
+00945     { _root = sub; pushed.resize(0); return *this; }
+00946 
+00947     subtree _root;
+00948     std::vector<subtree > pushed;
+00949 }; // end class parse_tree
+00950 
+00951 
+00952 } // end namespace gp_parse_tree
+00953 
+00954 namespace std
+00955 { // for use with stlport on MSVC
+00956 
+00957 template <class T> inline
+00958 std::forward_iterator_tag iterator_category(typename gp_parse_tree::parse_tree<T>::embedded_iterator)
+00959 {
+00960         return std::forward_iterator_tag();
+00961 }
+00962 
+00963 template <class T> inline
+00964 ptrdiff_t*  distance_type(typename gp_parse_tree::parse_tree<T>::embedded_iterator)
+00965 {
+00966         return 0;
+00967 }
+00968 
+00969 template <class T> inline
+00970 std::forward_iterator_tag iterator_category(typename gp_parse_tree::parse_tree<T>::iterator)
+00971 {
+00972         return std::forward_iterator_tag();
+00973 }
+00974 
+00975 template <class T> inline
+00976 ptrdiff_t*  distance_type(typename gp_parse_tree::parse_tree<T>::iterator)
+00977 {
+00978         return 0;
+00979 }
+00980 
+00981 /* Put customized swaps also in std...
+00982 
+00983 template<class T> inline
+00984 void swap(gp_parse_tree::parse_tree<T>& a, gp_parse_tree::parse_tree<T>& b)
+00985 {
+00986     a.swap(b);
+00987 }
+00988 
+00989 template<class T> inline
+00990 void iter_swap(std::vector<gp_parse_tree::parse_tree<T> >::iterator a, std::vector<gp_parse_tree::parse_tree<T> > b)
+00991 {
+00992     a->swap(*b);
+00993 }*/
+00994 
+00995 
+00996 } // namespace std
+00997 
+00998 
+00999 #endif
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/perf2worth_8cpp-source.html b/trunk/paradiseo-eo/doc/html/perf2worth_8cpp-source.html new file mode 100644 index 000000000..e49a5f071 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/perf2worth_8cpp-source.html @@ -0,0 +1,103 @@ + + +EO: perf2worth.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / pyeo
+

perf2worth.cpp

00001 /*
+00002     PyEO
+00003     
+00004     Copyright (C) 2003 Maarten Keijzer
+00005 
+00006     This program is free software; you can redistribute it and/or modify
+00007     it under the terms of the GNU General Public License as published by
+00008     the Free Software Foundation; either version 2 of the License, or
+00009     (at your option) any later version.
+00010 
+00011     This program is distributed in the hope that it will be useful,
+00012     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00013     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00014     GNU General Public License for more details.
+00015 
+00016     You should have received a copy of the GNU General Public License
+00017     along with this program; if not, write to the Free Software
+00018     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00019 */
+00020 #include <eoNDSorting.h>
+00021 
+00022 #include "PyEO.h"
+00023 
+00024 using namespace boost::python;
+00025 
+00026 struct Perf2WorthWrapper : public eoPerf2Worth<PyEO,double>
+00027 {
+00028     PyObject* self;
+00029     Perf2WorthWrapper(PyObject* p) : self(p) {}
+00030 
+00031     void operator()( const eoPop<PyEO>& pop)
+00032     {
+00033         call_method<void>(self, "__call__", boost::ref(pop));
+00034     }
+00035     
+00036 };
+00037 
+00038 numeric::array get_worths(eoPerf2Worth<PyEO, double>& p)
+00039 {
+00040     std::vector<double>& worths = p.value();
+00041     list result;
+00042         
+00043     for (unsigned i = 0; i < worths.size(); ++i)
+00044         result.append(worths[i]);
+00045     
+00046     return numeric::array(result);
+00047 }
+00048 
+00049 struct CachedPerf2WorthWrapper : public eoPerf2WorthCached<PyEO, double>
+00050 {
+00051     PyObject* self;
+00052     CachedPerf2WorthWrapper(PyObject* p) : self(p) {}
+00053 
+00054     void calculate_worths(const eoPop<PyEO>& pop)
+00055     {
+00056         call_method<void>(self, "calculate_worths", boost::ref(pop));
+00057     }
+00058 };
+00059 
+00060 void perf2worth() 
+00061 {
+00062     //numeric::array::set_module_and_type("Numeric", "ArrayType");
+00063     
+00064     class_<
+00065         eoPerf2Worth<PyEO, double>, 
+00066         Perf2WorthWrapper,
+00067         bases< eoValueParam<std::vector<double> > >,
+00068         boost::noncopyable>("eoPerf2Worth", init<>())
+00069         
+00070             .def("__call__", &Perf2WorthWrapper::operator())
+00071             .def("sort_pop", &eoPerf2Worth<PyEO, double>::sort_pop)
+00072            //.def("value", get_worths)
+00073         ;
+00074 
+00075     class_<eoPerf2WorthCached<PyEO, double>, CachedPerf2WorthWrapper, bases<eoPerf2Worth<PyEO, double> >, boost::noncopyable>
+00076         ("eoPerf2WorthCached", init<>())
+00077         .def("__call__", &eoPerf2WorthCached<PyEO, double>::operator())
+00078         .def("calculate_worths", &CachedPerf2WorthWrapper::calculate_worths)
+00079         ;
+00080     
+00081     //class_<eoNoPerf2Worth<PyEO>, bases<eoPerf2Worth<PyEO, double> > >("eoNoPerf2Worth")
+00082 //      .def("__call__", &eoNoPerf2Worth<PyEO>::operator());
+00083         
+00084     class_<eoNDSorting_II<PyEO>, bases<eoPerf2WorthCached<PyEO, double> > >("eoNDSorting_II")
+00085         .def("calculate_worths", &eoNDSorting_II<PyEO>::calculate_worths);
+00086 }
+00087 
+00088 
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/pickle_8h-source.html b/trunk/paradiseo-eo/doc/html/pickle_8h-source.html new file mode 100644 index 000000000..6234e2562 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/pickle_8h-source.html @@ -0,0 +1,78 @@ + + +EO: pickle.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / pyeo
+

pickle.h

00001 /*
+00002     PyEO
+00003 
+00004     Copyright (C) 2003 Maarten Keijzer
+00005 
+00006     This program is free software; you can redistribute it and/or modify
+00007     it under the terms of the GNU General Public License as published by
+00008     the Free Software Foundation; either version 2 of the License, or
+00009     (at your option) any later version.
+00010 
+00011     This program is distributed in the hope that it will be useful,
+00012     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00013     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00014     GNU General Public License for more details.
+00015 
+00016     You should have received a copy of the GNU General Public License
+00017     along with this program; if not, write to the Free Software
+00018     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00019 */
+00020 
+00021 #ifndef PICKLE_H
+00022 #define PICKLE_h
+00023 
+00024 #include <config.h>
+00025 
+00026 #include <boost/python.hpp>
+00027 #include <sstream>
+00031 template <class T>
+00032 struct T_pickle_suite : boost::python::pickle_suite
+00033 {
+00034     static
+00035     std::string print_to_string(const T& t)
+00036     {
+00037         std::ostringstream os;
+00038         t.printOn(os);
+00039         os << std::ends;
+00040         return os.str();
+00041     }
+00042 
+00043     static
+00044     boost::python::tuple getstate(const T& t)
+00045     {
+00046         std::string s = print_to_string(t);
+00047         return boost::python::make_tuple( boost::python::str(s));
+00048     }
+00049 
+00050     static
+00051     void setstate(T& t, boost::python::tuple pickled)
+00052     {
+00053         std::string s = boost::python::extract<std::string>(pickled[0]);
+00054         std::istringstream is(s);
+00055         t.readFrom(is);
+00056     }
+00057 };
+00058 
+00062 template <class Persistent, class X1, class X2, class X3>
+00063 boost::python::class_<Persistent, X1, X2, X3>& pickle(boost::python::class_<Persistent, X1, X2, X3>& c)
+00064 {
+00065     return c.def_pickle(T_pickle_suite<Persistent>())
+00066         .def("__str__", T_pickle_suite<Persistent>::print_to_string);
+00067 }
+00068 
+00069 #endif
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/pipecom_8cpp-source.html b/trunk/paradiseo-eo/doc/html/pipecom_8cpp-source.html new file mode 100644 index 000000000..0b84d795f --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/pipecom_8cpp-source.html @@ -0,0 +1,187 @@ + + +EO: pipecom.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

pipecom.cpp

00001 /* ----------------------------------------------------------------------
+00002  * Where........: CMAP - Polytechnique
+00003  * File.........: pipecom.c
+00004  * Author.......: Bertrand Lamy (Equipe genetique)
+00005  * Created......: Mon Mar 13 13:50:11 1995
+00006  * Description..: Communication par pipe bidirectionnel avec un autre process
+00007  * ----------------------------------------------------------------------
+00008  */
+00009 
+00010 // MSC equivalent must be written and tested or some #idef instructions added
+00011 // with a clear message at compile time that this is for Unix only ???
+00012 
+00013 #ifdef HAVE_CONFIG_H
+00014 #include <config.h>
+00015 #endif
+00016 
+00017 #include <cstdlib>
+00018 #include <cstring>
+00019 #include <stdio.h>
+00020 #include <signal.h>
+00021 #include <unistd.h>
+00022 
+00023 #include "pipecom.h"
+00024 
+00025 
+00026 
+00027 int Check( PCom *com )
+00028 {
+00029     if( ! com ) {
+00030         fprintf( stderr, "PipeCom: Null pointer.\n" );
+00031         fflush( stderr );
+00032         return 0;
+00033     }
+00034     if( kill( com->pid, 0 ) != 0 ) {
+00035         fprintf( stderr, "PipeCom: process doesn't exists.\n" );
+00036         fflush( stderr );
+00037         return 0;
+00038     }
+00039     return 1;
+00040 }
+00041 
+00042 
+00043 PCom * PipeComOpen( char *prog )
+00044 {
+00045     char        *args[2];
+00046     args[0] = prog;
+00047     args[1] = NULL;
+00048     return PipeComOpenArgv( prog, args );
+00049 }
+00050 
+00051 
+00052 PCom * PipeComOpenArgv( char *prog, char *argv[] )
+00053 {
+00054     int         toFils[2];
+00055     int         toPere[2];
+00056     int         sonPid;
+00057     PCom        * ret = NULL;
+00058 
+00059     if( pipe( toFils ) < 0 ) {
+00060         perror( "PipeComOpen: Creating pipes" );
+00061         return ret;
+00062     }
+00063     if( pipe( toPere ) < 0 ) {
+00064         perror( "PipeComOpen: Creating pipes" );
+00065         return ret;
+00066     }
+00067 
+00068     switch( (sonPid = vfork()) ) {
+00069     case -1:
+00070         perror("PipeComOpen: fork failed" );
+00071         return ret;
+00072         break;
+00073 
+00074     case 0:
+00075         /* --- Here's the son --- */
+00076         /* --- replace old stdin --- */
+00077         if( dup2( toFils[0], fileno(stdin) ) < 0 ) {
+00078             perror( "PipeComOpen(son): could not connect" );
+00079             exit( -1 );
+00080             /* --- AVOIR: kill my father --- */
+00081         }
+00082         if( dup2( toPere[1], fileno(stdout) ) < 0 ) {
+00083             perror( "PipeComOpen(son): could not connect" );
+00084             exit( -1 );
+00085         }
+00086         if( execvp( prog, argv ) < 0 ) {
+00087             perror( prog );
+00088             perror( "PipeComOpen: can't exec" );
+00089             exit(1);
+00090         }
+00091         break;
+00092     default:
+00093         ret = (PCom *) malloc( sizeof(PCom) );
+00094         if( ! ret )
+00095             return NULL;
+00096 
+00097         ret->fWrit = (FILE *)fdopen( toFils[1], "w" );
+00098         ret->fRead = (FILE *)fdopen( toPere[0], "r" );
+00099         ret->pid = sonPid;
+00100     }
+00101     return ret;
+00102 }
+00103 
+00104 
+00105 int PipeComSend( PCom *to, const char *line )
+00106 {
+00107     int nb = 0;
+00108     if( ! Check(to ) )
+00109         return nb;
+00110     nb = fprintf( to->fWrit, line );
+00111     fflush( to->fWrit );
+00112     return nb;
+00113 }
+00114 
+00115 
+00116 int PipeComSendn( PCom *to, const char *data, int n )
+00117 {
+00118     int nb = 0;
+00119     if( ! Check(to) )
+00120         return nb;
+00121 
+00122     nb = fwrite( data, 1, n, to->fWrit );
+00123     fflush( to->fWrit );
+00124     return nb;
+00125 }
+00126 
+00127 
+00128 int PipeComReceive( PCom *from, char *data, int max )
+00129 {
+00130     if( ! Check(from) )
+00131         return 0;
+00132     if( ! data ) {
+00133       fprintf( stderr, "PipeComReceive: Invalid data pointer\n" );
+00134       fflush( stderr );
+00135       return 0;
+00136     }
+00137     if( fgets( data, max, from->fRead ) )
+00138         return strlen(data);
+00139     return 0;
+00140 }
+00141 
+00142 
+00143 
+00144 int PipeComClose( PCom *to )
+00145 {
+00146     if( ! Check(to) )
+00147         return 0;
+00148     fclose( to->fRead );
+00149     fclose( to->fWrit );
+00150     free( to );
+00151     return 1;
+00152 }
+00153 
+00154 
+00155 
+00156 int PipeComWaitFor( PCom *from, char *what )
+00157 {
+00158     char        buffer[256];
+00159     do {
+00160         if( ! PipeComReceive( from, buffer, 256 ) )
+00161             return 0;
+00162     } while( strcmp( buffer, what ) );
+00163     return 1;
+00164 }
+00165 
+00166 
+00167 
+00168 // Local Variables:
+00169 // coding: iso-8859-1
+00170 // c-file-style: "Stroustrup"
+00171 // fill-column: 80
+00172 // End:
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/pipecom_8h-source.html b/trunk/paradiseo-eo/doc/html/pipecom_8h-source.html new file mode 100644 index 000000000..e5a11c8e8 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/pipecom_8h-source.html @@ -0,0 +1,62 @@ + + +EO: pipecom.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

pipecom.h

00001 /* ----------------------------------------------------------------------
+00002  * Where........: CMAP - Polytechnique
+00003  * File.........: pipecom.h
+00004  * Author.......: Bertrand Lamy (EEAAX)
+00005  * Created......: Thu Mar  9 17:21:15 1995
+00006  * Description..: Pipe communication with a process
+00007  * ----------------------------------------------------------------------
+00008  */
+00009 
+00010 // This file cannot be used from C any more due to some const additions.
+00011 // However, if you remove the const, it should work in C as well.
+00012 
+00013 #ifndef EO_PIPECOM_H
+00014 #define EO_PIPECOM_H
+00015 
+00016 #include <stdio.h>
+00017 
+00018 
+00019 typedef struct PipeCommunication {
+00020     FILE        *fWrit;
+00021     FILE        *fRead;
+00022     int         pid;
+00023 } PCom;
+00024 
+00025 
+00026 extern PCom *PipeComOpen( char *prog );
+00027 extern PCom *PipeComOpenArgv( char *prog, char *argv[] );
+00028 
+00029 extern int PipeComSend( PCom *to, const char *line );
+00030 extern int PipeComSendn( PCom *to, const char *data, int n );
+00031 
+00032 extern int PipeComReceive( PCom *from, char *data, int max );
+00033 
+00034 extern int PipeComClose( PCom *to );
+00035 extern int PipeComWaitFor( PCom *from, char *what );
+00036 
+00037 
+00038 #endif // EO_PIPECOM_H
+00039 
+00040 
+00041 
+00042 // Local Variables:
+00043 // coding: iso-8859-1
+00044 // mode: C++
+00045 // c-file-style: "Stroustrup"
+00046 // fill-column: 80
+00047 // End:
+
Generated on Thu Oct 19 05:06:41 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/qp_8h-source.html b/trunk/paradiseo-eo/doc/html/qp_8h-source.html new file mode 100644 index 000000000..dfd3d0d12 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/qp_8h-source.html @@ -0,0 +1,266 @@ + + +EO: qp.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+app / gprop
+

qp.h

00001 //-----------------------------------------------------------------------------
+00002 // qp.h
+00003 //-----------------------------------------------------------------------------
+00004 
+00005 #ifndef qp_h
+00006 #define qp_h
+00007 
+00008 //-----------------------------------------------------------------------------
+00009 
+00010 #include <iostream>               // istream ostream
+00011 #include <algorithm>              // fill
+00012 #include <vector>                 // vector
+00013 #include <utils/rnd_generators.h> // uniform_generator
+00014 #include <mlp.h>                  // neuron layer net
+00015 
+00016 //-----------------------------------------------------------------------------
+00017 
+00018 namespace qp
+00019 {
+00020   //---------------------------------------------------------------------------
+00021   // useful typedefs
+00022   //---------------------------------------------------------------------------
+00023 
+00024   using mlp::real;
+00025   using mlp::vector;
+00026 
+00027   using mlp::max_real;
+00028   using mlp::min_real;
+00029 
+00030   using mlp::set;
+00031 
+00032   //---------------------------------------------------------------------------
+00033   // useful constants
+00034   //---------------------------------------------------------------------------
+00035 
+00036   const real eta_default    = 0.5;
+00037   const real eta_floor      = 0.0001;
+00038   const real alpha_default  = 0.9;
+00039   const real lambda_default = 0.5;
+00040   const real lambda0        = 0.1;
+00041   const real backtrack_step = 0.5;
+00042   const real me_floor       = 0.0001;
+00043   const real mw_floor       = 0.0001;
+00044   
+00045 
+00046   //---------------------------------------------------------------------------
+00047   // neuron
+00048   //---------------------------------------------------------------------------
+00049   
+00050   struct neuron
+00051   {
+00052     mlp::neuron* n;
+00053     real out, delta, ndelta, dbias1, dbias2;
+00054     vector dweight1, dweight2, dxo;
+00055     
+00056     neuron(mlp::neuron& _n): 
+00057       n(&_n), out(0), delta(0), ndelta(0), dbias1(0), dbias2(0), 
+00058       dweight1(n->weight.size(), 0), 
+00059       dweight2(n->weight.size(), 0), 
+00060       dxo(n->weight.size(), 0) {}
+00061     
+00062     void reset()
+00063     {
+00064       // underlaying neuron
+00065       n->reset();
+00066       
+00067       // addons
+00068       out = delta = ndelta = dbias1 = dbias2 = 0;
+00069       fill(dweight1.begin(), dweight1.end(), 0);
+00070       fill(dweight2.begin(), dweight2.end(), 0);
+00071       fill(dxo.begin(), dxo.end(), 0);
+00072     }
+00073     
+00074     real operator()(const vector& input)
+00075     {
+00076       return out = mlp::sigmoid(n->bias + dbias1 + 
+00077                                 (n->weight + dweight1) * input);
+00078     }
+00079   };
+00080   
+00081   ostream& operator<<(ostream& os, const neuron& n)
+00082   {
+00083     return os << *n.n << " " << n.out << " " << n.delta << " " 
+00084               << n.ndelta << " " << n.dbias1 << " " << n.dbias2 << " " 
+00085               << n.dweight1 << " " << n.dweight2 << " " << n.dxo;
+00086   }
+00087   
+00088   
+00089   //---------------------------------------------------------------------------
+00090   // layer
+00091   //---------------------------------------------------------------------------
+00092   
+00093   class layer: public std::vector<neuron>
+00094   {
+00095   public:
+00096     layer(mlp::layer& l)//: std::vector<neuron>(l.begin(), l.end()) {}
+00097     {
+00098       for (mlp::layer::iterator n = l.begin(); n != l.end(); ++n)
+00099         push_back(neuron(*n));
+00100     }
+00101 
+00102     void reset()
+00103     {
+00104       for(iterator n = begin(); n != end(); ++n)
+00105         n->reset();
+00106     }
+00107 
+00108     vector operator()(const vector& input)
+00109     {
+00110       vector output(size());
+00111       
+00112       for(unsigned i = 0; i < output.size(); ++i)
+00113         output[i] = (*this)[i](input);
+00114       
+00115       return output;
+00116     }
+00117   };
+00118 
+00119 
+00120   //---------------------------------------------------------------------------
+00121   // net
+00122   //---------------------------------------------------------------------------
+00123   
+00124   class net: public std::vector<layer>
+00125   {
+00126   public:  
+00127     net(mlp::net& n) //: std::vector<layer>(n.begin(), n.end()) { reset(); }
+00128     {
+00129       for (mlp::net::iterator l = n.begin(); l != n.end(); ++l)
+00130         push_back(*l);
+00131     }
+00132 
+00133     virtual ~net() {}
+00134 
+00135     void reset()
+00136     {
+00137       for(iterator l = begin(); l != end(); ++l)
+00138         l->reset();
+00139     }
+00140     
+00141     real train(const set& ts, 
+00142                unsigned   epochs, 
+00143                real       target_error, 
+00144                real       tolerance,
+00145                real       eta      = eta_default, 
+00146                real       momentum = alpha_default, 
+00147                real       lambda   = lambda_default)
+00148     {
+00149       real error_ = max_real;
+00150       
+00151       while (epochs-- && error_ > target_error)
+00152         {
+00153           real last_error = error_;
+00154           
+00155           init_delta();
+00156 
+00157           error_ = error(ts);
+00158           
+00159           if (error_ < last_error + tolerance)
+00160             {
+00161               coeff_adapt(eta, momentum, lambda);
+00162               weight_update(ts.size(), true, eta, momentum);
+00163             }
+00164           else
+00165             {
+00166               eta *= backtrack_step;
+00167               eta = max(eta, eta_floor);
+00168               momentum = eta * lambda;
+00169               weight_update(ts.size(), false, eta, momentum);
+00170               error_ = last_error;
+00171             }
+00172         }
+00173       
+00174       return error_;
+00175     }
+00176     
+00177     virtual real error(const set& ts) = 0;
+00178 
+00179     // protected:
+00180     void forward(vector input)
+00181     {
+00182       for (iterator l = begin(); l != end(); ++l)
+00183         {
+00184           vector tmp = (*l)(input);
+00185           input.swap(tmp);
+00186         }
+00187     }
+00188      
+00189     // private:
+00190     void init_delta()
+00191     {
+00192       for (iterator l = begin(); l != end(); ++l)
+00193         for (layer::iterator n = l->begin(); n != l->end(); ++n)
+00194           fill(n->dxo.begin(), n->dxo.end(), n->ndelta = 0.0);
+00195     }
+00196     
+00197     void coeff_adapt(real& eta, real& momentum, real& lambda)
+00198     {
+00199       real me = 0, mw = 0, ew = 0;
+00200       
+00201       for (iterator l = begin(); l != end(); ++l)
+00202         for (layer::iterator n = l->begin(); n != l->end(); ++n)
+00203           {
+00204             me += n->dxo * n->dxo;
+00205             mw += n->dweight1 * n->dweight1;
+00206             ew += n->dxo * n->dweight1;
+00207           }
+00208       
+00209       me = max(static_cast<real>(sqrt(me)), me_floor);
+00210       mw = max(static_cast<real>(sqrt(mw)), mw_floor);
+00211       eta *= (1.0 + 0.5 * ew / ( me * mw));
+00212       eta = max(eta, eta_floor);
+00213       lambda = lambda0 * me / mw;
+00214       momentum = eta * lambda;
+00215 #ifdef DEBUG
+00216       cout << me << "  \t" << mw << "  \t" << ew << "  \t" 
+00217            << eta << "  \t" << momentum << "  \t" << lambda << endl;
+00218 #endif // DEBUG
+00219     }
+00220     
+00221     void weight_update(unsigned size, bool fire, real eta, real momentum)
+00222     {
+00223       for (iterator l = begin(); l != end(); ++l)
+00224         for (layer::iterator n = l->begin(); n != l->end(); ++n)
+00225           {
+00226             n->ndelta /= size;
+00227             n->dxo /= size;
+00228             if (fire)
+00229               {
+00230                 n->n->weight += n->dweight1;
+00231                 n->dweight2 = n->dweight1;
+00232                 n->n->bias += n->dbias1;
+00233                 n->dbias2 = n->dbias1;
+00234               }
+00235             n->dweight1 = eta * n->dxo + momentum * n->dweight2;
+00236             n->dbias1 = eta * n->ndelta + momentum * n->dbias2;
+00237           }
+00238     }
+00239   };
+00240 
+00241   //---------------------------------------------------------------------------
+00242   
+00243 } // namespace qp
+00244 
+00245 //-----------------------------------------------------------------------------
+00246 
+00247 #endif // qp_h
+00248 
+00249 // Local Variables: 
+00250 // mode:C++ 
+00251 // End:
+
Generated on Thu Oct 19 05:06:42 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/random__numbers_8cpp-source.html b/trunk/paradiseo-eo/doc/html/random__numbers_8cpp-source.html new file mode 100644 index 000000000..2384712b6 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/random__numbers_8cpp-source.html @@ -0,0 +1,122 @@ + + +EO: random_numbers.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / pyeo
+

random_numbers.cpp

00001 /*
+00002     PyEO
+00003 
+00004     Copyright (C) 2003 Maarten Keijzer
+00005 
+00006     This program is free software; you can redistribute it and/or modify
+00007     it under the terms of the GNU General Public License as published by
+00008     the Free Software Foundation; either version 2 of the License, or
+00009     (at your option) any later version.
+00010 
+00011     This program is distributed in the hope that it will be useful,
+00012     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00013     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00014     GNU General Public License for more details.
+00015 
+00016     You should have received a copy of the GNU General Public License
+00017     along with this program; if not, write to the Free Software
+00018     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00019 */
+00020 
+00021 #include <utils/eoRNG.h>
+00022 #include <boost/python.hpp>
+00023 
+00024 using namespace boost::python;
+00025 
+00026 #include <sstream>
+00027 #include <boost/python/detail/api_placeholder.hpp>
+00028 
+00029 using namespace boost::python;
+00030 
+00031 namespace eo
+00032 {
+00033     eoRng rng(time(0));
+00034 }
+00035 
+00036 eoRng& get_rng() { return rng; }
+00037 double normal(eoRng& rng) { return rng.normal(); }
+00038 
+00039 std::string rng_to_string(const eoRng& _rng)
+00040 {
+00041     std::ostringstream os;
+00042     _rng.printOn(os);
+00043     os << std::ends;
+00044     return os.str();
+00045 }
+00046 
+00047 
+00048 void rng_from_string(eoRng& _rng, std::string s)
+00049 {
+00050     std::istringstream is(s);
+00051     _rng.readFrom(is);
+00052 }
+00053 
+00054 struct RNG_pickle_suite : boost::python::pickle_suite
+00055 {
+00056     static
+00057     boost::python::tuple getstate(const eoRng& _rng)
+00058     {
+00059         return boost::python::make_tuple(str(rng_to_string(_rng)));
+00060     }
+00061     static
+00062     void setstate(eoRng& _rng, boost::python::tuple pickled)
+00063     {
+00064         std::string state = extract<std::string>(pickled[0]);
+00065         rng_from_string(_rng, state);
+00066     }
+00067 };
+00068 
+00069 int spin(eoRng& _rng, numeric::array values, double total)
+00070 {
+00071    if (total == 0.0)
+00072    {
+00073         unsigned sz = len(values);
+00074         for (unsigned i = 0; i < sz; ++i)
+00075         {
+00076             total += extract<double>(values[i]); //extract?
+00077         }
+00078    }
+00079 
+00080    double chance = _rng.uniform() * total;
+00081 
+00082    int i = 0;
+00083    while (chance >= 0.0)
+00084        chance -= extract<double>(values[i++]);
+00085 
+00086    return --i;
+00087 }
+00088 
+00089 void random_numbers()
+00090 {
+00091     class_<eoRng, boost::noncopyable>("eoRng", init<uint32_t>())
+00092         .def("flip", &eoRng::flip)
+00093         .def("random", &eoRng::random)
+00094         .def("rand", &eoRng::rand)
+00095         .def("rand_max", &eoRng::rand_max)
+00096         .def("reseed", &eoRng::reseed)
+00097         .def("uniform", &eoRng::uniform)
+00098         .def("normal", normal)
+00099         .def("negexp", &eoRng::negexp)
+00100         .def("to_string", rng_to_string)
+00101         .def("from_string", rng_from_string)
+00102         .def("roulette_wheel", spin)
+00103         .def_pickle(RNG_pickle_suite())
+00104         ;
+00105 
+00106     def("rng", get_rng, return_value_policy<reference_existing_object>());
+00107 }
+
Generated on Thu Oct 19 05:06:42 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/reduce_8cpp-source.html b/trunk/paradiseo-eo/doc/html/reduce_8cpp-source.html new file mode 100644 index 000000000..2a4cfd72d --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/reduce_8cpp-source.html @@ -0,0 +1,80 @@ + + +EO: reduce.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / pyeo
+

reduce.cpp

00001 /*
+00002     PyEO
+00003     
+00004     Copyright (C) 2003 Maarten Keijzer
+00005 
+00006     This program is free software; you can redistribute it and/or modify
+00007     it under the terms of the GNU General Public License as published by
+00008     the Free Software Foundation; either version 2 of the License, or
+00009     (at your option) any later version.
+00010 
+00011     This program is distributed in the hope that it will be useful,
+00012     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00013     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00014     GNU General Public License for more details.
+00015 
+00016     You should have received a copy of the GNU General Public License
+00017     along with this program; if not, write to the Free Software
+00018     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00019 */
+00020 
+00021 #include <eoReduce.h>
+00022 
+00023 #include "PyEO.h"
+00024 
+00025 using namespace boost::python;
+00026 
+00027 // unfortunately have to define it specially
+00028 class eoReduceWrapper : public eoReduce<PyEO>
+00029 {
+00030     public:
+00031     PyObject* self;
+00032     eoReduceWrapper(PyObject* s) : self(s) {}
+00033     void operator()(eoPop<PyEO>& pop, unsigned i)
+00034     {
+00035         boost::python::call_method<void>(self, "__call__", pop, i );
+00036     }
+00037 };
+00038 
+00039 void reduce()
+00040 {
+00041     
+00042     // ref trick in def_abstract_functor does not work for unsigned int :-(
+00043     class_<eoReduce<PyEO>, eoReduceWrapper, boost::noncopyable>("eoReduce", init<>())
+00044         .def("__call__", &eoReduceWrapper::operator());
+00045 
+00046     class_<eoTruncate<PyEO>, bases<eoReduce<PyEO> > >("eoTruncate", init<>() )
+00047         .def("__call__", &eoReduce<PyEO>::operator())
+00048         ;
+00049     class_<eoRandomReduce<PyEO>, bases<eoReduce<PyEO> > >("eoRandomReduce")
+00050         .def("__call__", &eoReduce<PyEO>::operator())
+00051         ;
+00052     class_<eoEPReduce<PyEO>, bases<eoReduce<PyEO> > >("eoEPReduce", init<unsigned>())
+00053         .def("__call__", &eoReduce<PyEO>::operator())
+00054         ;
+00055     class_<eoLinearTruncate<PyEO>, bases<eoReduce<PyEO> > >("eoLinearTruncate")
+00056         .def("__call__", &eoReduce<PyEO>::operator())
+00057         ;
+00058     class_<eoDetTournamentTruncate<PyEO>, bases<eoReduce<PyEO> > >("eoDetTournamentTruncate", init<unsigned>())
+00059         .def("__call__", &eoReduce<PyEO>::operator())
+00060         ;
+00061     class_<eoStochTournamentTruncate<PyEO>, bases<eoReduce<PyEO> > >("eoStochTournamentTruncate", init<double>())
+00062         .def("__call__", &eoReduce<PyEO>::operator())
+00063         ;
+00064 }
+00065 
+
Generated on Thu Oct 19 05:06:42 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/related.html b/trunk/paradiseo-eo/doc/html/related.html new file mode 100644 index 000000000..a6ba9b2d2 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/related.html @@ -0,0 +1,15 @@ + + +EO: Projects + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+

ParadisEO

+

+ParadisEO is a project to extend EO to make use of dedicated parallel or distributed computing environments by Sébastien Cahon.

Generated on Thu Oct 19 05:07:01 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/replacement_8cpp-source.html b/trunk/paradiseo-eo/doc/html/replacement_8cpp-source.html new file mode 100644 index 000000000..76b0a6119 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/replacement_8cpp-source.html @@ -0,0 +1,87 @@ + + +EO: replacement.cpp Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / pyeo
+

replacement.cpp

00001 /*
+00002     PyEO
+00003     
+00004     Copyright (C) 2003 Maarten Keijzer
+00005 
+00006     This program is free software; you can redistribute it and/or modify
+00007     it under the terms of the GNU General Public License as published by
+00008     the Free Software Foundation; either version 2 of the License, or
+00009     (at your option) any later version.
+00010 
+00011     This program is distributed in the hope that it will be useful,
+00012     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00013     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00014     GNU General Public License for more details.
+00015 
+00016     You should have received a copy of the GNU General Public License
+00017     along with this program; if not, write to the Free Software
+00018     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00019 */
+00020 
+00021 #include <eoReplacement.h>
+00022 #include <eoMergeReduce.h>
+00023 #include <eoReduceMerge.h>
+00024 #include <eoReduceMergeReduce.h>
+00025 #include <eoMGGReplacement.h>
+00026 
+00027 #include "PyEO.h"
+00028 #include "def_abstract_functor.h"
+00029 
+00030 using namespace boost::python;
+00031 
+00032 #define DEF(x) class_<x<PyEO>, bases<eoReplacement<PyEO > > >(#x).def("__call__", &eoReplacement<PyEO>::operator())
+00033 #define DEF2(x, i1) class_<x<PyEO>, bases<eoReplacement<PyEO > > >(#x, init<i1>() ).def("__call__", &eoReplacement<PyEO>::operator())
+00034 #define DEF3(x, i1, i2) class_<x<PyEO>, bases<eoReplacement<PyEO > > >(#x, \
+00035         init<i1, i2 >() [WC2])\
+00036     .def("__call__", &eoReplacement<PyEO>::operator())
+00037 
+00038 void replacement()
+00039 {
+00040     def_abstract_functor<eoReplacement<PyEO> >("eoReplacement");
+00041 
+00042     // eoReplacement.h
+00043     DEF(eoGenerationalReplacement); 
+00044     
+00045     class_<eoWeakElitistReplacement<PyEO>, bases<eoReplacement<PyEO> > > 
+00046         ("eoWeakElitistReplacement",
+00047          init< eoReplacement<PyEO>& >()[WC1]);
+00048     
+00049     // eoMergeReduce.h
+00050     DEF3(eoMergeReduce, eoMerge<PyEO>&, eoReduce<PyEO>& );
+00051     DEF(eoPlusReplacement);
+00052     DEF(eoCommaReplacement);
+00053     DEF2(eoEPReplacement, unsigned);
+00054 
+00055     // eoReduceMerge.h
+00056     DEF3(eoReduceMerge, eoReduce<PyEO>&, eoMerge<PyEO>& );
+00057     DEF(eoSSGAWorseReplacement);
+00058     DEF2(eoSSGADetTournamentReplacement, unsigned);
+00059     DEF2(eoSSGAStochTournamentReplacement, double);
+00060 
+00061     // eoReduceMergeReduce.h
+00062     //class_<eoReduceMergeReduce<PyEO>, bases<eoReplacement<PyEO> > >("eoReplacement",
+00063 //          init<eoHowMany, bool, eoHowMany, eoReduce<PyEO>&, 
+00064 //               eoHowMany, eoReduce<PyEO>&, eoReduce<PyEO>&>())
+00065 //      .def("__call__", &eoReplacement<PyEO>::operator());
+00066             
+00067     //eoMGGReplacement
+00068     DEF(eoMGGReplacement)
+00069         .def( init<eoHowMany>() )
+00070         .def( init<eoHowMany, unsigned>() );
+00071 }
+00072 
+
Generated on Thu Oct 19 05:06:42 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/rnd__generators_8h-source.html b/trunk/paradiseo-eo/doc/html/rnd__generators_8h-source.html new file mode 100644 index 000000000..a389dfb6a --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/rnd__generators_8h-source.html @@ -0,0 +1,150 @@ + + +EO: rnd_generators.h Source File + + + +
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
+
+src / utils
+

rnd_generators.h

00001 /* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003   -----------------------------------------------------------------------------
+00004   rnd_generators.h
+00005     Some utility functors for generating random generators:
+00006         uniform_generator : generates uniform floats or doubles
+00007         random_generator  : generates unsigneds, ints etc.
+00008         normal_generator  : normally distributed floats or doubles
+00009 
+00010  (c) Maarten Keijzer (mak@dhi.dk) and GeNeura Team, 1999, 2000
+00011 
+00012     This library is free software; you can redistribute it and/or
+00013     modify it under the terms of the GNU Lesser General Public
+00014     License as published by the Free Software Foundation; either
+00015     version 2 of the License, or (at your option) any later version.
+00016 
+00017     This library is distributed in the hope that it will be useful,
+00018     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00019     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00020     Lesser General Public License for more details.
+00021 
+00022     You should have received a copy of the GNU Lesser General Public
+00023     License along with this library; if not, write to the Free Software
+00024     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00025 
+00026     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00027  */
+00028 
+00029 //-----------------------------------------------------------------------------
+00030 
+00031 #ifndef eoRND_GENERATORS_H
+00032 #define eoRND_GENERATORS_H
+00033 
+00034 #include "eoRNG.h"
+00035 #include <stdexcept>
+00036 
+00044 template <class T = double> class uniform_generator
+00045 {
+00046   // added new ctor with 2 params, and modified the data to minim and range
+00047   // (was maxim only). MS 3/11/2000
+00048   public :
+00049     uniform_generator(T _max = T(1.0), eoRng& _rng = rng) :
+00050       minim(T(0.0)), range(_max), uniform(_rng) {}
+00051     uniform_generator(T _min, T _max, eoRng& _rng = rng) :
+00052       minim(_min), range(_max-_min), uniform(_rng)
+00053   {
+00054     if (_min>_max)
+00055       throw std::logic_error("Min is greater than Max in uniform_generator");
+00056   }
+00057 
+00058   T operator()(void) { return minim+static_cast<T>(uniform.uniform(range)); }
+00059 
+00060 private :
+00061   T minim;
+00062   T range;
+00063   eoRng& uniform;
+00064 };
+00065 
+00070 class boolean_generator
+00071 {
+00072   public :
+00073     boolean_generator(float _bias = 0.5, eoRng& _rng = rng) : bias(_bias), gen(_rng) {}
+00074 
+00075   bool operator()(void) { return gen.flip(bias); }
+00076   private :
+00077   float bias;
+00078   eoRng& gen;
+00079 };
+00080 
+00087 template <class T = uint32_t> class random_generator
+00088 {
+00089   public :
+00090   // added new ctor with 2 params, and modified the data to minim and range
+00091   // (was maxim only). MS 3/11/2000
+00092     random_generator(T _max, eoRng& _rng = rng) :
+00093       minim(T(0.0)), range(_max), random(_rng) {}
+00094     random_generator(T _min, T _max, eoRng& _rng = rng) :
+00095       minim(_min), range(_max-_min), random(_rng)
+00096   {
+00097     if (_min>_max)
+00098       throw std::logic_error("Min is greater than Max in random_generator");
+00099   }
+00100 
+00101   T operator()(void) { return (T) (minim + random.random(range)); }
+00102 
+00103 private :
+00104   T minim;
+00105   T range;
+00106   eoRng& random;
+00107 };
+00108 
+00110 template <>
+00111 inline bool random_generator<bool>::operator()(void)
+00112 {
+00113     return random.flip(0.5);
+00114 }
+00115 
+00121 template <class T = uint32_t> class UF_random_generator
+00122 {
+00123   public :
+00124     UF_random_generator(eoRng& _rng = rng) :
+00125       random(_rng) {}
+00126 
+00127   T operator()(T _t) { return (T) (random.random(_t)); }
+00128 
+00129 private :
+00130   eoRng& random;
+00131 };
+00132 
+00133 
+00139 template <class T = double> class normal_generator
+00140 {
+00141   public :
+00142     normal_generator(T _stdev = T(1.0), eoRng& _rng = rng) : stdev(_stdev), normal(_rng) {}
+00143 
+00144   T operator()(void) { return (T) normal.normal(stdev); }
+00145 
+00146   private :
+00147     T stdev;
+00148   eoRng& normal;
+00149 };
+00150 
+00156 template <class T = double> class negexp_generator
+00157 {
+00158   public :
+00159     negexp_generator(T _mean = 1.0, eoRng& _rng = rng) : mean(_mean), negexp(_rng) {}
+00160 
+00161   T operator()(void) { return (T) negexp.negexp(mean); }
+00162 
+00163   private :
+00164     T mean;
+00165   eoRng& negexp;
+00166 };
+00167 
+00168 #endif
+
Generated on Thu Oct 19 05:06:42 2006 for EO by  + +doxygen 1.3.9.1
+ + diff --git a/trunk/paradiseo-eo/doc/html/search.idx b/trunk/paradiseo-eo/doc/html/search.idx new file mode 100644 index 0000000000000000000000000000000000000000..acf21038f2458add9c0f9f403ff54d017574ff75 GIT binary patch literal 1173672 zcmeFa4}4VRnLql1hjYe-YE-J&Mh%FV(nJCTh%r?{5=eBCjF}1GF7+_UOvuP2GbR%Z zns#X$TW){sZtT*Q-o}<%+D+To(l*=6z02-Wn_aPu{?KJBYOK*xMVH&6rn|J4*86>) z_nb2`At<%l3O;@u&hzj6_dW05=Y8Lk%KEiICI1Nmf`A|(2nYg#fFK|U2m*qDARq_` z0)l`bAP5Kof`A|(2nYg#fFK|U2m*qDARq_`0)l`bAP5Kof`A|(2nYg#fFK|U2m*qD zARq_`0)l`bAP5Kof`A|(2nYg#fFK|U2m*qDARq_`0)l`bAP5Kof`A|(2nYg#fFK|U z2m*qDARq_`0)l`bAP5Kof`A|(2nYg#fFK|U2m*qDARq_`0)l`bAP5Kof`A|(2nYg# zfFK|U2m*qDARq_`0)l`bAP5Kof`A|(2nYg#fFK|U2m*qDARq_`0)oK12LVGF@1DX+ zNd*Bx;EY7TQ2sMA-;!xT;A}*|P#Y&LmZ3g6sr-$EhPwA86GQz2%M3MyS;~(b`T*!> zCb9ixmdsGU)%H`CD`QGGet(DG7qe`H5d;K*cP;|Pl<#|)Gp0P?(QiZ;Qx3e5iRc9Z zK|l}?1Ox#=KoAfF1OY)n5D)|efp1k(L@+ir)BZN z2m*qDARq_`0)l`bAP5Ko?*;^nsX1qDF^#F;dEK%ZQ~#fn^u|=@oWRsavUJAOpJwsG z2m*q@nT>!k_1QDK0Frw_KoAfF1OY+dEkMASdMqmzM#yO$4 zJ2|AW?v!a5=X7T2jB|RkcwqzqK|l}?1O$Pz4FThvzdPHCB;^qV-gO8V=Y0N6mDxDw z%U(F+oNs%y5Q2apaP}f#obyjyIOCinSR22lY2$q7InQ}6;3xfK7&m$J*+v+~$IrGR zNqGc;*G0fE{+FjWjIX8XX;YLjZ90B=p6s1U7}J*hQCTyl)&5c8C9oiHHXvY3Tg}BV zrrBphaik1_fFSS&2pH2gOlo0F>+s~pv^zao2thy)ICBs%rk(zp)|mEb%=fpSIfZ+h zb81ZMf16W~=mmjy9s)J|mpjRkARq_`0)l`bAP5Kof`A|(2)tbg7}JK~6Bv2B zqL+9D0YTslL%^7J@C?hbWLFRn1Ox#=KoAfF-VF#CzH?5yn1=7-)3y~uK|l~lBVhRE zq#22OHDhb5d9lyz>z-reE{U&*WL0Lt}agm(G~3zwt?oF+Jdw*qEOF7N;?NqbJWK zjOm}rWZ#fBrVnJ<7}Fok=4VX)H^7YZrh9hAc~@u9OFWtgC6{qUZG_(8z74^E&m7tg1{e+fH5=Ot|_!JbMm%r%>36sJn~6G7&D*B zk{a**|FZduznsOpjB)XQx}-8Lsb|`_B|yvWWsCH|;kta)0iG`+t>jSO8%18NP*hMY|4r#USYYn$G*AXCs6lAPBrZ0!H5doMd3k);_kA6q5*y z+1Dv!_R2{#rxqErgQr$PW6b`WN%h8+ldp%2E3?P{Ndt>e5ID;aFs{t@o1Jd)j4PjD zQ{&2K-!O=AuQiK56=TfH_EVh7PUM2X znTUWfFTE~)r{&+6_hV(uo7irT|IyhroNYYg>QnFE8&|(q8CRdY#xOoGqKpsx?2pca zL?8$V0)IXPjQJ<~{U*zeF+X=Qu`=eT&jL(pAVNVv5O`e#jQOiySN~QjjrkM)hVT5p zKCS4D`8!U_PK*SBvl#(n{(TtpzWFCFqA~w_UYf>y{Wr-x!5=^v^Rs;hMnNnqv{CR- z7Vk1fq2-cUPoprE#S0?{2m)yYjKYtm8Bj*y=O*y~&b(3R?8O%z)%-Qt-{&x{NuR$Z z1LGR(&0kZ7-|3yVHLgiG@owg)`;W2UR+rTJqRHbkiY7nTV=TNcJN%+=XYs-a0%tM; z#-i-=a&JXhj75jNXpBX=y?cUF5XR!XERC^Pw_9WJt<{>gk9u z7Jny;cNt^xzbIo#dT-E^FR5@zc?tq&Gy=ww?6L6ASr}tUua~^BWSd75VJ!J9e)qD> zSTf)|v-cHQc#40FCI707rEk3NXDq!($Gz0K2e@=l^UL(TBxBia%2?Kg-~T#AN+K2n z1c6KhjAdUyd-*zkyYc%;rs^cxSoWW=d4}c2vR`?6qhy{(pDtmPEYk6m{8d&Ex{A=cs4{BW&5*uVFUp|;LRamTtE4m`_0An z_JlI7*XJ4Ep4cT;LE!8{z_=lM>^5#Ff87EaH`FTQh6#IiH+=DR!@Qo-xM5e8+E~6U zn=jAy54uXD{PQlE^)$-gdjCjP0>b=B5irWL&zb#66Mq*bW|Y6?mD*Twt}<5Sc{~xu z3Y&Rj#qFNlSn)~7KZD;Nz7J`v(7s1w#cy@I6)ov_E0-&y^6MU-Nf?z+DWmG+`27=p zdfj4FJ)w-1FK3!5V^t`N7e)|xw;^EE9D2hd8#Vg=k5QAp18CfM-YLTwH_o3_XWV#w zmfX0}pT)b3aiczCWZd|QE8?f&ztQ6j|Gmnno&5fxQCpn0t6i0*>o3sp)PK-<)_FQ1 z1OY+djS(>FGsfV++>-(r0qwhU6-EI2{(*Y@(%%kpb#KSh2xuRnadUcZVBGw@w<9Tu zQxJGpAYe57A6!nO;mxn*-waSj!%$W*BlzM3{`XnDFoJ*}@YW$hjD`kZLMj1{2qm1SpWkjHF!5PF2pU3Y(WwhdNk+gmvzth`KaPuWkK|m1r(;#59 zKK-XjNKz35&R_(Lm^o?gjo5k0h+T}|<@jN2j$MP_Qv9;-;A93iVk3c{<`}@;&?N=%z@sIfFJN`!UZf$@2 zer0sxZvu9{ri|2A@x$Kvg$t_c-U>_|!gS zd^lo7A zz1eEoE7#-Kh2O(!+N(Fyh-t?^%ps>8*ZY0bj(;5Ke?BX=X~(nw4o8*}%(Ub8J8?XypTD_BP5aHg_#INy zemf7pYqk8h>G6Bo?|NBA|4jS+`D)s0&D!R*^fv-cbw10?De1Wa3*;X`;0#8MxH2dIM9$k@M)Lyge|s|tnHRj*3ua!R{e9*I^I2wI@DY@0ucvnj z^MYp}e^Hqio>1mxL#|kvmlxvqA!S~neFkRUKX^JJ1OY+d>_foJ`|hNLGV^{ksa%AD zfFSVBN5IT`I4hIpZ0#S&6q>VdWY(OW{(E4VdZ7h@cMAgM?7vp#>`%RI#WiRD-P;y7 zMQqOAq0B1_yfn-!i<0W_do^+2S{yv{`<=GFKGgw~pg5SET<2xLI+&GAk~@?+W~`*7}P7TR$s%^wa+Z zW!7G$%({B~`tUoV%=%kcC;tcnXDR|_;M9MAkIG~QX5p8IU;b$o(F~NF(#{O%x%DXx z9EBP91k(E%e#bmh^Ja{*H)qe|J>@9~^X6LCm^c5Gel|YgJfHPKm}^Ruxn^4i|8knX zWr{M_IphAi&B|<=fuCQQ%^jW%5oScj|13a+5d_W>1kA{?lS*Pn z8U9T#b3zCLZxaG$3VVO4KW^{OO#L0=_*eW!Ce5XpI+P_hQ+j@Gc42PamA>O+ZqoN| zvW!oIF*oJ1m3hZG&QqV=Ge5FVnICybnIHXh{nz7uSIWxg`+n|>NO5fee+or{2Z-}@)coO$0|)bI5E`J_gt zAvEtx-?KXn^DGndKD5XC^qs&g#p^KUeRr_dyzg83`BlBnH^2IIWq$p0TK4sw${ct; zD;Dz`4O;ij^nAk{j4Sgy-_!E%{8E{_F-O>~?-7{02eZNpBM6*L2$b*RQ#QZMiiNF6q*&$;_Mdh<<`1&R<iqIN`DrNrLIH?lJXh%4e=z!qg6$H^u;W*JVKsVdTj#zt&*nBlRl4y&yhf~o` z;){t5L#f&2YEE^y)2?U@w{M6>=8%P7&8dq|4rT|{oJdz&+h%6=s5vdMRC}~jn+~fv8=~zfS2Jr5s5$Xy zxP|FaH76NI?wC0~Cz(ig#lxvsqCGFw5pM5nNpzqn8%X=0F((=Bh;_!oZ2Vx(94<1e za@CxUXsWBDJ#SMY7P*dPMG$qSBBiCtaE!C~pnpzB_>R1cj6Jws&FPHY8D;zUoX$JK zNhZ71oK#1b7Ng8v?M;cU_DD36$4@TPgFDof;dngJTpLbO<_6W35hT}<*i76Wb!Eoe zdT>}>eKm;>sH^b;+hWbkjjF37vCdSuy*bMK5p{KIIK|`%HGls6rbMb04+Pvl3(s(S z#Nm2~YwAqIyHZg{G=^tKl#tuxijG3`R{ckLIIbfD`Opl-xgm0vnjfQT_Rw54zdezn z+&)yK<`X6lRjT=^)+meCst?B6TVn086yftwToo45b4y{ye-Qk5U11?!a=5LqB^Hl< zh)EK6XNpPCi*WSpQ-urZ*{=#~gDe?Ph4qU`v{w}d=(%4N##)FtSeTK8ACD=WQZyCq zpaT4OTotA^C#kvpM5zS}=s80b&8FupRkVQWNgzSx`bmK*TC`wMQ4uBclM=PCFqzP8 z?()fT7dt-7ZE?Oki|o4VKJ5VC;QaGrSu$GxOBlX1SI;|Ru~VBx|AoXe5nMV!b1C)XpRASi1O=YXKRJ)8^kqNQ#zAI>LBj`87QwP^7|3jXkN zwWxRj;NXlt>|ew&tXGSccnLimU$mr%%KtEObn9Y*=HcE&x1uDAsVEQksYUG(BKp;0 z&e_8QN?Q%7;=<-l^tK<~r;6$IJv^d{IjTcy$yLN3R!fQ)?T3%4B~;jlPpBoSRuGT) z)Y3(Z3nQ_%XnQ9*D71d6%a6=l%6WVwPhCree562KOEErDqDo6+s9X+;kND9`C)ztx zc82hO7nPQxv*k|ye{U}>ZHjJ)wIlF>YIN^hhy(G`QuJfG!W`%;Ep^F3M2B9qgRGC2 zmZG7ppiYVk_oxB0R3y5|jwYGUDJ|`44|h;@AI(K77#uW{Us`&5S2%(^#+pf4Tw2N< zH4iM0E-x(&#x}HtNrT)cbYyFhA!lrP6q&2&#$xA_w8-jT9>i5p~P_=pHb-(2ouyL|0R)BTCKW(F2sW2jrtiq3odSJ_dvd4%=zB zkIh63ZAtE89?L5&ZRtQgCc6R*0@03^MQair{3;(SDJ^YH+|d?p-&`4^BpwTSf?!w2 zCUl}CT#py%jfEtj;wD47lX$GVw6rbSM&e$ksIokU7X%?y$;bMcq)PVK0P@w{98J== zM*I*U?84~Y7PX@t9Xz5RT&~KR`#ye?Q%SnML&{`lu=o1pGA><)NDTx*#M!&B+iDpR39ns))!hZ>VqNh<;kE%7eki z+5iP2)pAwdgwZhEO!)tFohol`#$T@7XTr+wfO9TAN9#O+e$ z5o*Xk-CZ6D13Z2!KOKcI%HrdoDA?l$>sk1CUU_5_4XI@DcmXRo*~d#@9dq8mAsX7|LfD(^_eT4K#H&iWIF%8^61I!sh+ zTU595CytkQZ0JHSM(^fHqr9UdOjb|ksq)TF$cZi}r~E%zq9siCfR1fwN2B3zJDH_e zSUaf7F|%>n#*=%9K?I|@>R%B}p`O)tp%`fV4d^&YJ+K0EMIwek z#4vFrdY@Xs9kbhS{%l0^YdXS7>P$z~~-O`>tkydmiX-!)d z!we_5xiiIM_j5kz5y5jaRYiS}h`fsWwj>r-RJ`X3z%<3$xt%|^TvasG2ZMG)d592v z4rqm&TceSHH?>Gt&F5NAp~I{#9B-yIZq&YmrX!qAssiI7Q(G!fM>}Ywcy6#F{BoFu zdq}M_Fhs+3if~6)xScwipBGnzTX|yf^MIa%2a77^|DU) zd^p0DOINtV$%gb{#kNC9}y0<$rib&n+eFU*-hZCj#VlLvws)3sf@g>Y-R&TdO zb+vo3GE3A%Rsm1c%vpSK9Sf*xz1Yg67dqv!9C8b@n0_?tfZM3N@o2Z6!MwPmB2gIK zl!$NA)#t@sC@lLsxK+Hko2=1jI|^%2G_(~?ac>2BQtqc--0v7rMh=2*>uQfRySTpy zaH*yMAkqU~sw1&ZZc{Jia8jLk6;8+dQh}41E@!&&62S5LjF$k*#xBC}rS%mFTDK4x zr+3j2+t5lWywnXY#y!kSy@Yy4f_lrBP)K?mZnj?9r7HLZzO-9abVMQMY4JZKD}L23V2wW`o>`@cdJsSb+%mupo;7eH%I@zn8`@rtfa^a*-p`O9uqS+#O8 zne~ELM8p6HdX7}`=#Kr9%u&R(=@$znjYVL@+E7F$_R>D<4 z&QdJE$@mrIDvtF6H-T4Xs7g30J7P_4jelhp1kG@{QvO~ERmPHW_?U@aUm3$|AoN~| ztI9+dIzYU8Vz+o)mS5zRZIy}c%@~u(W=CbB{c5%zsiZORl_QlHBhgqX)2|j(Cb-eO zT2kpaxLNG4Of>Uy#%(ySu2q#-z)?9~ji^f94qi>FO7c%v)sy%r)1bzEOqG^8W59UC z;XQ*Lj)1+*^_0!=U5(A!9i8I8G{)w6UN6>)wLu%s(9)4YdnIQnyI*1 z{W?!o@f!Nq1&Z_b>yoPa5Q6+q9M96y^k{b?P*qgP9qH z+eMGhHVwVpzJA|IaZ+xwa{l}68RCpA{C+3oP9)i7{r#ZM9BnKhsx0Ts@AqWs(wYDL zaF!x7p#xeIA~=3O>N4s1W*Nzkq=Ogag}6*?KhC8-sj#o%EtYYQ5WABrBpJUp1HuTm z24-i0rELjER*;vWbKa*@Mz^!0th`o~&I*d}syN0ns9MlVrI^FZcazJkE3bvB>N9K9 zYu&`3T!dZ{V{o8FxVvzC4OK_G(Xb^$4i-<*PYRyPdZGamaczEWh{%s>dLPkFa#WrX z;d*L>CR3q#lXP58;jVO2GCX(;YP_aK3c=Tk&J;t zytW6Br2rWE7)t@DDwxyCJCMSJ!cvFmeN$gR%;Bo~tJ#jxbJ2okilM3kRMCjesR{&Z z{N$grrp&Dh&||r(YQXByni5hpT3b`rR|N|@Q=4hlYE2og3R0|74ydZNH6eRtd5yo3 zJb%`d!z>6kR#a34DcsZ&RTb{UWYd}&BEnrZSX0+mVU0xcxT=Etji_!_)zX470s|e* zM69X39#55?Bz>xC!-i-_8~bmqsr{-djvX& zvZfwZRSDhqSyPWyC4!qtYK${Q9jMc^((iN{0>COmmr((x&B#_Fu4%KXFgjV&=4wqe zQA;y`*qxZ5xzUrlNUOcJZA~jvRpjrjjfOkBXc1yftIibYDUvmMdl^N3R#9~!PFqUnl6LuXw6wQgr4Y-m+ zZ~C(JnH;HSW(ugo$i~Uc%M|EEwCg*!%z|tsniM==*-g$YVH>JlW~Hjq9s-`;SZ1KA zv#^=g%ZbhetwAj_Qq|cSjib2|ldS4YM#-tlwbkrZRb3ruV_LbRs;ikc%gL!@nY&b# zw@9(f-NZOkCd(YIf>)F3yLp7#a+fn(vCI?1LT=6S>^o`Qn!;uf<;E(QL{78Mch`Gp}yPl<+^OTJ0@|p z>$#;Ee4(mtxcnI>-+Bb-z?{(X#Ua&>8q2rEwI{`PwX(7Tt6{3azTKe7LqzllXnGz} zD{IIfYx%}k)~v0n1a)rC%9>Cex}DjxXA?VD@yvqABDJ!yu7X!B*12VBC9;xW#LunP zG#N!!hPfX(H@OnKRRqtuy^iHIy zCz$iQR?ghVn$emifh(}S={DW@5n?m8O;BTD)Cf<9HDlidMH?+8xQihzrB2g>*2?-^Se>*h}BJx5o@*llLL=Qzt;--mVH z47HMc9oBiXRwj7yXPq~s9LF`LAmp)0blC6!M6r)UjqYE=c*==1y4Du4ZoazD`nYE@lh zz+aE;hlcu94dt~Y9DYV39vJEolMmfoB9kwO7sps@S zt~ZygoUKITqz`4~AkiQ$@Uf74JnmdBn5hL+X)nkFop1_sfzB{BjSH$#E_#NXz_j+W zF6eeRe!Um$QmZhHpk{jk0K@#ZiK83^*`!lCqDjui3AL)d3rkgs_ClXpMT7W-Ggl>| z@EI+-1}@{)Ywielwqh7hCEBlvM!HC!w+b}~i*2eE7Z#{hN!maldbz4D4_0H#h#0@B zt}3srYM>s7__eCKrjB0Eg%KixL?u;qsFvRRh1(R)V72nmA?v~&4xQC%FB~GNUNTdN z1H|f?%!Q*wlkiA&n4AUHh2z!XHmo@)ix>GIbjX=7BvF2KI8L?qqGDC8y`$De%d5#x zwh`ky+`ZOC$bX`%Gun!>l3&5PXl-@kjwo-@Sr*J87rFCK7c9 z*qJj_4P|!bEJgF7sNSfw-aEtN+>!IWMV^Q<@m{~Gp_=gC^))!`)`9k!v6JFVt=>C4 ziLSJC5+Ox&$dwaw*kv+e#YANiDXcHfIfXoT5_x(=g-gr2cSdPKVv)+GZq?QkbK zyUEriL&!k1gPaG}CHpx3Hf(#LwAQh!Zqhy?FHP?O^I+WSXqIKtdy4WpCWQl1880aXbry zp{l}~6@`lz(4jEvGNo<`x3A)X=&~8=rfBRoUChg7-4xx788o4FS(&;iaVO2;E~{34 zdXtw$l%L+?Wl80)UqwWZqC;-hWn29XdQ;oFY_Gpz4NbvGyx-q2zX={nq7N!R4xM(v zsSwf|Bi3a{{Nc8y2)T!0aCxQXhzxj&tZwo0b#4?+gTB1g6>yvwmphv67Cj_i-ZMd$ z#ZoF;vm|KESv*;6&yr-f)XR5HP=+HBPTLtvFCUzs$K(!+7HVsk@0p;Ywu=L=Xbv_u zj>uy8)E3ROT|qVnPHjUNxcM0Mhnu1_FkXH{`7zznYtPHa{d6X$eJvDMKu&Zq(K9rS z(`?oivouZB_KLZhCbGzzYF$z0$39-WZu?iPRem_F!yQ5NGma<)2@Nq<^nvKYR+V){ zzcwOrz#rQfy(7jG@hgUuKheH{JTVv=X$pgd9u+m?$eeY>z6mxI%ZNXL1c@5+ClZ|6 zIGI6`hd8m@qUpJQ`0*XONcp?E$TY7^)qV*57Y@I4MAOGJt-NYgTfWv`Q&;7$s#_JR zCesikG$kW?eQkLS6WeRcZy~`>Ra>>1h(SD^gME%m%*xxRYFAZ}azxeE)VXmS0^JxS z@wlqJ2~VtPYU@{%;p~}2R1#I9YRP7HWo>XZ%`Rr|s|_w#%{%V9L`bm!Qg4f4a zZb5MDqUb62mD_8>;f@sda#!xB_^6g$Nh#8{gEbe4ZQzOI++2#7Mw_|$pgO}F;xX!# z<|4t3i4;xa<|4@ywhtZ7kA$2vX4c%bsy5mdNbnMAZlo5Qip?CP4}KUnc=bM*6C1JhNR= zdZ|c(2h+N=a36%}S9aCG+E_DAX(d{ypSfy`L$G)4suL4K^C}{}Hl62FwTY}n$Gn-D zf^;8>nCIm|6+?yaj!szf3bIAn_9YXQ=s4lU&~18NC_9j%wZ^HgH#k&UiKN zaF!I+jG}doDBj~)5{yY%JS?s@vLtDI@;^Y@oGdL#a{2ffHSMd5G+Cw{q~tulx}WTc z7;sOi5i`WGc)kh}9jMjwimOLe?PgRJ>PoIYR=b%GRKamWIOXToZbmdj<=0Z5kYB9o z=!m|R->T|X&@-j#s#ft48Y_QmUDX#C|MgCrh=nu&d?uD%Y(T+v(d zj3s}huD+pGlVeyPlkrhJxu5$$2~iMzpt6ou86Q}$>Vm7v3u~yy`#_JXYouec)(5t# zx?5>3Gk>OXod5IlR9%!>?EFf)5JSXTA~e~{mt;uTr|M#ulC^cQe`|ifs!Q;JA#46X zT_R(7K(<59a&i7X#>qK&2F(X&WC}`4)0|$3e{g+WB0Y?Lu!r# z(-F|Ywls(6;E#8YQ(GV0ou#74_SSJf^}#VJ2MNaOsDmunQ^)P2;2@rbde4zG{_`&K2{?Vn+(_Vy2A9X#5H|dhCU~24t!02hCCZ6N_4=}5;s)ev?+#_J+Bt7K~b9Z zjV0@vgPP2adaR!I?yYN%s`@z9{{>3b^B}WeMtwWSv7kh`XW*>`@p^dK-R1a#9rek8 zpJy`*2J4gV%x1wJ(3$g)1;h18_auq6;DC+->jg?~)aAew`RZ{#p)D50S$Uet70rZ_ z`s<>6tg^VuPyw5! zdUSeo1v^<5`2sc{P=tC>0c(k>R)H{H5}~^&g0r3EDugeSPH>Va>4+%OMLl4`&M84_ z(N^Z1`%%`S?Zo1Y1AAo`?FJX+nb)FWkT|nQ5gg(m>9Ks#(M&<+tq^O`@oW{=Mys(a zLTz`k!78G1n4&xoR}9Ws=`Rj|Mg|J8V#2%C`>KnnfSu70-y5+OcQc1`2y~6aTHLDw zS-Y@{`-s<$Z%jytBHikP+XP5eYSg;$4oQ0Y`%P_@Ly5}2_0R{oUSdY zo+!j%!=oI92n7=GPS8YP$@&0JC+I^*#KxTo`I2rYJRmG|&eU5=wxxw+JP^P!pm0+R zyTBaRkP37pn$s_B$v)!Aa)bzXU(#KCEjg57UPd&{e3l$03SM5G87?{IaT9|todFfD zgtR$5_|jS6se4%J2Z4J}RK1q24d}hrrE$j^^^&@+rCY#vQ?{4(2k6)iA-;4sgiY{* zuzWOtPBe_OUDnbgh$Y=&FCB+jGghWNj4nf|vF4)n+A_*g5}>%f-ZJC~ivu3Mmlbe2 zWL83E@TBo+Lu*+jvHFx@G~#xXl%HkDJ&r_jhL=TDK)=C!^61b=xh&~Q;Bcl>AuQ}s z0iNnD+ZxaqmiSd*vmSmBsANlkPg_|f!vUHv(tZ`1lDqwd^LH&Y%P2XPq1CNfPo_#v zcnX+Z>!aB0WUP5(JZg7#!J)_f32h$|{@3PCqDQCV>GPrQ=&<2x^41I27DLwEj2q8z zg7W?_MYNnE;<(f6p=(I(6s{|G7~oxuN}%z>0QBV_hpFMGPe=09m&w3X!_Nm8|idh0oNWnm4Vw= zUwc?*F9Vfh>Sli!_oFEDC)CZjUzoWARqD%CGEz{H4RHp>Ea0cT#!) zLeh@n$u8Q`BdVc+hT_t3rQOvu4L!yE5$ihN$u$(zs6Ue%*vLW2| zD)r>o1+)#3>mW?>qT{-)TFU*zb=w=l5u7%_=^4)3bpxt_cO|de+Yoh6o>2HB4be6% zXNf$ar_>qnnW*t7=0@-xnR&!5t+|6x)NWH1dyKg`jfI6g}@mf z9%`;%=fvRb{#@UxW9JA{4beh)H)tjRj}<4lg>uN$_68J@``GITbZ*_Mdi_vC)C=b1 zVV`P1+nBMMYRfIAC9NqH}nLn zG52Kg4i&6frS}tW*agzASye~odqCgZ$kV?YhC$O^7VCyXLH0}DaMYP$-f&z6u~_z3 z1+jLa+dtOwnJQS{*igZAUa-D_rhm%|RIs4}2fK+bQ9)WW$KjnNwvsp^x)t^j$}4Yi z9GJ`dgQ14TijY1RwtNq^{&ZZ!!H}OpTz&u)g&bAEFkTuBc;($ej3Web`8E}71`5rT zO8HJ&?}nZ07*_dUdih&^Jcy4?MBBq%Ts>CIbyWK5owXtW^&L_D9#^c>(ICbZNyx)^ zzchVW(W`X3dR2yw0G+Nkk0Nn?FnW8IpcsNKv|YW? zRkd6P)61qRzY4aZiM_t(ylU-4BT6U|M3vXAp{g4Oy7EhKj9lpH!3e z4pwn|_3a@(rB67onh}JXl2ceUiz3jaSv5DPhvZeuNl1o%9X*ljgNd$=<|yXJbotj> zl~O@ERsHPa#g=pvpag#9!F2M!zy??9kUDQQy6Kzc{?AeQgxNGu* zUA!AmQyj!R(Ai6@Sp*{?zSpmiJZyTN09 z+39$s{d*n0w3P2nS^fi_z#%Bqs3-hrhV)1VJ?>f1l7mvC;|#Tg2qi}+zq|EZy*3vz zY%{|#M#m9a^>LQkd{^p)=Lm|mnBrOvl81AAnZlt+9C8_W%UzP>{N^2}LTwzHj_3wz zbENA|v!$gpp{(uAlsGHn+P+L7c0S0kKTD<^DYXNcLdOMEJEU-fgM#c+p$b0T$Y~!0 zL((yo;nS`?3iovgVvOveYWk>-RW~D4jr)v5<${B5b$y|UbKSb(Y*87U6`eHyYNtB{R^6d&wR4Za&RmDo9iC`|ir?uh z$m)(wRHD9n$`dLS?(#R&ysO>^a#fs`zxC@t;>tX2?$z(q7U)I7RFCTqYBP^N?%2A5 zK&}qptkMG|nso=VKuCvo)k)2I>TTdDX;(ks@See5J>=BrWozI-2p=)Q?S5qKW+Q~% zOCoa8Hn>v6LzH8GGjd1w%7{&O!c@U;&d=0Pr$Bu$EynG(a3`&XZZ6KU(4*PS%PCQ+ zCO7**b=?*ta;*x%Bb9LglMNyvd>4i895dHVQxYC8Z|)_MJ$g6yQ9$qZp>=aVsVK?; z6=Iiq!;DZXSIfUFfq({pbp{BopX;hat?Wu#*8>r%5ovdXT5&6k$z36Q+KObmiQtLh zx)G3iGj!b{jt657fw=A{MM2bu^HeC7;@QQAi$nNaN+HfhY}Uj3hpSbHW)mL{g%U~r zoQCz`BMS3$_6B@-oScAsFP;l}YYsH}^vQHfT@-v7u9xW6R#$=U3wdeFxaDHq znsSwVVZ#fv#TAG73nvp!o!`36Rnv%&5iK%)>ke1v1m%cHvCCDoWACXGl_2SyU$}L* ztD)#T`@Nac7VrMat@~YhtkZ7d?@&;_ zun^U+-R@SQJLtXJy&)VMK?dm4YL?ySa76bj=lH8V00Q@X^~wG9A=S9jJ!G?iPN~uu zRn~>CIc>ld|2(+nsN-AT+L*B&yS`_VFl4oL5_xIqBtkOYHHkdk3GhC}`rVV-05|x= zD2~0V5i3B)`>}q%YOJfFVQc+S)!3jb{rcmL4KyHxb5$djfaJ&s=c`5sjBv4Pr0+hZ zr`zG>EFd#KQxhGZ;Z{eCo{Mi-y460M%8aUv8Nx2Sg-OPbCmZ2ynSztzAIR2D`h5^9 zJj7OII1|We?9(g;V`fLvacD1m_)sJI*p5^eeFBl^g5krB?d&!U9|wVD6#H;6PEl=a zG9ZIj6OIq+)0*m<8HUrbjXpDH!MqW*iq1Z55k=yIo8>sYV>BVQN6FuAp;Y%|p)dqUL>SbybBsjc6VLqqn9IC+5n* z6fJopGkH?xRJ2H*o`SveXXg76 zkr7Uk$Nq^ko5-P4=yV4cIh1q+tIc(vSBYW4oC6%pnr}*6W zwQON!R+dXkPnJ;{+fEiwNNLAp7TM|TQftZ^>U0;`vRkdGSVU3pT~k53{4EF68k|?J z=c6YrC)U*9(@>2eC^q=ins8jtoHoo{_m^+!1Qpurkg|yWb3H^gpBD%(3`d|MA_ zl!|-J+qQxs`|ZlsYqZ;T+WKJQZF}w7V1>P!K9OhLc1YQ%zg)Q6#+7aJJar?81eJ2* zOq=Ft`1&p}`B1}OY4f6*Cy^VAp{GxPS{s+!Hr-6KZDRbkO{YXPv(~oJ3)9D&qLEB* z!N!QPX<4(en?AWkm~7le6rr+lr;Vvdo7-ARGDte=%s1{MiZ+8c9>lDTKPP8xJi-Ao z?$X5#mee4}FpcNHly_j_xi&6tP!Hs|N#gkw9~C!VtZZ6z#h2Snm=aQ<^I-?GXi5*Bn*OtVf-Hg4{CVGR3 zJr1omUlJn-#NX<&5{Gmy+;Jmu7%KimG6h4fP;~uCXDe|+XM?{jWhD`1hBApL$@#>e z39^z$P@Fc}cgHlvc1|=V$8}Z-soQogHQfKvHFdfcG`+=}i>5zDs+DRiI55j1xVdMtr>*B;wB z!hF{-E86&*jHEfl8oE13um7&Yq^1QGrr;G`L%i#ly@6WHT_;ElqNi2abheqBX-~?= zM_6%CdvleCZn|ppY;m;|ZoA9Clu`YN&z0zHNILoBRH~26oS@3AUmwYHm8+uYEA{@# zM+#iwN)08F{78w?!^21XJPttg(IQajVz7&f4=Z+JDal#+>j>^AK>gRdZF0f<^A|jo!yg;NZa3X5Iq$c!WNtG^bI;YAPidikP#Js6>^AC{dIJ=n z^Vx>pb-Dnk?QSjTZKXgw%kRZU(&$t-cE-6I>)k>so$KCh%Eo6ZoYAs(2fjQBM-%O1 zQyRNi$Db4Dw0FCB_72%+CGUiq8s!p|Kxt9CtROAXj8hMI%X#_hJdXF(B_qu<&m>E z){I-)ovAV&5A)n_5X_^M|JFS=ciCHq?Sy-%2;xs8a@_6bbF819VY_SaPtUS(sSVyr zY6PDyOQ+bNGxh0e8!wY|>lAfsG?smOr!(LC^j?Utz3hBj(E6L*cGBx_{$|+5onjh1 z{|?q52fR3eb0!_t8*IjoBL0027&>$Uo4+r%JKCs! zB3%A{t=+-Xhrf^89pJZb;qYZeAIR(J$;)Sks?28#5CI=Lp<3|S5-8}P4R)a7Etn^3 zf;2RBr-ab?Iit#Fla45JH2G|gBV6g6FaGRS2=3gAJaPM&Yo^bH5<7x}Xza}Y+#$P@chO0D81oJOR=oB3JlMN;4?iDr=OLf( zrf6XL`MrohyZS$Wz^2#t`B5F%nRo9%1nzMLXm=E7md;NTTVnI)->n^SIuVBfi{=Ee zPMUM>*a8tgd{5+d91>*N9()Lg1jEo_?y=eF*modpmnSvyK>hrVBNQtUwW4hA(OWseyfQJx5J#?29OSjI#Shpo(}3dz?j056OBJZ6RrgJMn$C+ns!I zkh^iX#HkH^@c_6~I8MGpVn^*1{)~WLIDGMl);VZ>aokQ(di_2-&T=>=J-oMnR6sS!d47vx7c^EpU4?MzP#Q0%&_(4o%S6#ZO->OzB~llS$}_dpM8h! z?7uvsBdhX0yYS^hT0&7DweO$~f?@vhafPiIW$m0{cYEI@*jcS?a$oISXKzjmTh;pY z8P^qe_N-rz>u~^psO>5|pPoBaxQL#EDonWT+^52X+s?x(yco}~D22TY zJZGpd`KrG%ONE!xbFK=1=tDG1`bv=s^9eknD^(aidcC^*NrW*5=QCCcf-!}^!Jqt3XhiuG$Jz4LJ~u9%{#S<- zl7qL@spMbXr&-L!kj7U>Cf!8*>hTF1gu9GzGdrwyS23;Fs zP_AYy)(N?<9n}huUx#fo*7i7os<-66j#rL5^Xxxy{)mqC^_>ur@gSZRX^+V_mVE?8y`WGOyqH#!=E> zQiVPJapDG8I@;VU%Ld+_oS1ZemJJOk6D^9fEO60rLgwjR zr^}f>`Z&?fpJm6+fm0h(Ex|BFFX3BMKj3-5AL<~k8yt&!!;v;#%zq27K)(;}eZO^> zUzKhS-@;pmYnkF}WR@Umn#&hqQOCS&bJ+}`!~-TiEa z^|$LZ+`*|D*gx_C>%@`b5iBbGM#l_e03DfUy z!#l$5?J-Qn(O(lv!@H;!JNrn(yTLRi7_#AmVIJs*k3g29Z(5P{IG92Z|JIEd>Df!c zxe@%^4uyjz9SQoI2CUlUe&6fgb~A-f%<@g+e;)>`U78Q(h2gkmSMr0s+NcH&F6w_C z?9;q=68^z)Cl>xTCzdT0h4p#Xa9d#DvWyqHvJ9@<7U*6&2`0FCLQ`*CdR zAp#)ooI`r(05ja^9~xD3K@lf6DcBKb2j`)2X9MRa`C)v2om}p;7eO{7IPK1RF(X^C zL&H_(VLIwXGml4L&AUU7l(CL{6OW)(ZlJl*BkMrWvz2uEPy5iE!fmyWY=_=X@p0t3%9i-23=(hgo z7*gWHA%xYVN5OScRv(*16ldVExh&MVd8~*Sn$JB}2`cMY$zxPJmXMl?$V`4GT{ruW zZt&D?{s&SAR{8X&9zT%Bjv@*gZAf+k2fJP6905FNyn6N)t7 z!&A_MeTV~T5;%_+Xqw37OzJlDIAS6jD(>S+9MIF&y^zwJ*153qIK@PNE(s$u8TO}H z4mbcFU+v%-*yDQ@ucseBFku()iJ2sDR>e=OB?fUlv5km~y}u{+KtKzSCq~2AGXn9X zj|eLFlXHpk%K2moE7H6lL1}z>a(y_J(x2*may!M(C*7aiNhD?XNz7bvB8yIafqTkF z44|h}pPEUGb{jsG2O4X4y|jI*K!@SKJ7qmpqIDGAQ<#-++JKM96F5%=K;ys%k?Wib zhUxPkPql{i3h1enqr;?wPpdq&(-An+z^8^04@EMDC&F+-ClDIFrFVC9)aL|(;pj{l zItwLyR8Jdn;~fo!sd|x3tHR#`qt1M^SHVF{k&gDMCTgOi{i-QrhB`XX zDYDT6s>#nT#nDmKq}N)bM^uyE%6!^TO->P>&Qnbx`co&?(*>%@U8+1?qHtR%+KDM2 zwy*WN-kXsajinOXstMCVDPu5kFj(l&< z*4#585_kt%o=K)zoY*06h%gtne;ZauzCr76IxGTqUBSSuBxN@A%%9Q80 za(!3POJFRQ^61>77|VAVY?^H59FO@aVCL7Y#@1&^aJy31nh6%(WQ)sLii%!!*f3}PcaQpCK!G1Ry_le z@o{@=Z0KYo{fClHHr+>X(eivFd&?+^5rpP`Y3vZiL(Ow+yeXXG%OKAJy5@}-^^=%8 zI}532d))LI*hlKUnP<1A73^K6embq)?rJBjH=f<;Di{iy#5_9)k$1-Q**#=H;-j1| z9wnaJLOJuQYJLi*Eoel0ZkuW%cg1r%RFihPJvZncn)vxv5@8eB9Z;ShB7yT4T++Sc z3ppI3zQg^DzzcK9F2kS%M}KJ(_JvAP1QRQHHt@oF=Jfjcg&ty@9`l8PCMv)SNRPd1 z$BsAQq8!ihUf$jmbq;C246D=~+TxXB3QkT;gnOkA=HV^|;gx>x*zv1tn=rL%;ZFWl zMC1I`JL}a0O}Lavz4oi4O;L39F`kRRdaNmmc0(C?^#s0M$KR(JM_FkePF?UgqQ>zO z=Tz|cKFR@24#tmiER6d&a*iQ~`tD!Pa3b&OAZ`{oy&a0bx-b)c;H=~o??8p0%6p8y`+=A$d z-s5Bm@473B6SaD-e*7@R5&o;W*70K$Hx6i#`3Wp#@cfO>OOH6@kNW^GKfkHg(H7z& zC;BUDm%j<=%n-R=HO0{Yi0o;?dW)&8pt!>PrXO1RbUx38elwt&aAF339Vm%a3vV3% zX2_A?kD)f>&nP**wcjrHT#Uc%$qK{QisD#SAc9C44L#%`$qQgpFY5#{HQ(1tCI+R| zw9OxhD9Cfp#}%BM0S;R^A#4mM3d&d$n4r;{LV9B!>pJYrIGc&ueBA_d_~%c~Kc90x zxd5$BSVT$XNllDOmxlwV3xvO9&LC$%%K6?oF?2d36#3vpwT^rRx1cwUeGh_@FZ;D& zBJj-~rF@FA66Ze+M-|7X{7xF!CC6DjIKg}h9%fq8`qVZ@r|U-cd#3ps%HUHwUdM>i zVk5UCPAa&b=X^8Rj>nn+GOdu%lra9_-ZxJ9z{!~&?0kw!LY4Fs!D$yq@9LDf*Ts3_ zM&BLrDJuQz1ZHn2+5;v)ozcuh54?W3BznNumJXd7*E$ zu1;|)b5@rqxpbu>W&GaGkZww z1IQ!K_q;rgV=vbvw<1m5KOr#RbM;L<=%hsPk2y5PQ{OqLh!e7aKUqFeM23WKc3#t^ zCXbNs971@ag&y~P=Mb(Fb-axBodZ1S?1b+epvJx$-#Ms_+$TY5>|>hUHoj>`!BEd> zV$i`1glAJeGr}h1XZD$hMEf*-`0FK2j>pbtViim0e)(vL&+K;&0sG87O*GFSB&^~l ze8LnB8M6SNwVWARx%e!<6O`z+4vi(T&l+?XczApkV&ViA6Eo~E#l#$FqC1X6jUraw z$MsoQ5tBo}XN@cGl(EmJX=f+d=L@l_rrlj$)8;$PR(!rKO}Gfp+4F589r}qrsS-%M3v<9cypQmWZlUO*9HkPd064=d166T-8j4 zz93&UQ+Y2aQ_VPEfkQFA3j)m;00^oJ)-_`f3GEs5h3g^Z^{el~9@R{~8sCLmQJ2%- zWcR&yka$|ZrvE~$@4fqQo*>-JE<)eMMl(5S>78Gk!z8cHh^^$fxC0Nv$(-oJbAjB`1i6e%34yTom+E z#P_;9g`U+%xg&y0>|6u)U0On+-PzlOKKW7XNQ zD2?|IHscR6;I*@K57hLxX-P4xkTzDfbSjMaBgjAoGcM<;yGM^zF{gbi2%#x0_j_ zM!nPRzS*rT4LF&c-LJ!7OI`nwP2X$;)89V!&E89Caon>Hfut>XO!e?NoMuAv|7Yxd zpsUQXI??oq-QR6d=_ihiqLc1UchlXWJ5@zjrRY>QfdHWhkcLo|t_ma}_rgtalY1-o z20~S;DpjPbP}M#-eNs@%A3cmha)O8GEZhiAG3xxqB6=nQE>(pZQ8~b73VRE z`hLHC{-5vMRIkM%_uIdH_W8HZKL7SP=cCA%d678#7}CMzJ^~+WQ}OXhG|~bb{i(1fA6)79mHHkdE91g4_l=7mXM!VD!;+?$yVE^;|8DH z>S5M?%g1e>-+tGUH;&eiZ0vT(1Bbva(h6&bZ_Bb;rDPZ@aadT3mk+bmDshB2==X>7 zJS&1&@_3uYH?WXJ?_2^p#?;Hv+3GIgQ|px3>R!221I6+MWE(ZML8;1<3;5!+G<))l z{Gz{6_T)wUh95o7U-RpljWM^pm_2#Zg8scdHbGC`@o+vkkG+$Gl>3&;tuAIyKC;wc zIWl`Hvj8SwUWlibTOeGJ%${=E5G;9SPqo`1ZvWgD*=cc1qwU3mK1Yw`Kr%P5 zqDX5F9kQsLZ;b<&Eez3g+Ha4p4R3G7P)ep$Zi#^X*HaBvI9tn8b4mt(p0eUFl-C!4 zZjc^TD$HB3%$_=HdAIlIyM>0gY_S#l)CG;(d-5dO%Qn=`$pcLj=QJu@oy?wc>SSCo zT#QbYun&SWIdNF0L>qB$8=Y8PSf@(r1%{mTPN!3Wb4i}j=~(1il4o^F_k3yepz_wl z9d5aG*R0cMp;~rD!EyKkJE6WkKa{M~DWra!hy~y2lrRy*>7YrYc5vYt6kAB0P8qo= zv!0W1?NpO>8coECINI-X@idZ$2CaT0 z5ooGP^xc**>GGa_Fg97j!ZF0GT{ed84gOfk9~{c8?En{(vbKvqgw)%DwQ6_}$kDlM z?Et@c)I<$H*VZt=<+zHeUVBC@YiD2Vz}Z2%u4Z5CBR@>nWMegTPiV&wM!$8Peeonb z->?T|UxUxScpib7t}ositID%E*)uB`i$1u>n4W0^k7VeX6NE^5;PK%5ORGdMM*T=B z!+aTGo3BW{TC(#cUlUVgHz$idi>2UWJZ5MyaRnIpzc7S2>$OG2O=zA0{No zyE)dLb)OcRTZ|;%B@Fy!OPDKBG=8yMf-S0SL%Wca(@VCYU-CL!#RwXU8o2nDp^!QHIA$A=DeK~xZ9rLI zlTiBrXB#d;kSTKxc{g112vm(8Xa=f|&Wc&j8ZIRB$GWj1Dn z^C2fjWTLsTtaHlp*ofrOmm}MFo}BP*oWiVxvN!dCuphoaGFRF(D1y`lpxLGhzIfFV z`4$9G=UlY6I1jjFn~(*zpiQ^Os<@CKYZ1O!j7@ zDg1pEbZMQN?~xr^z{K^gP#>oG^|tF|5bG3Ccr8dc`}7x)L9Z$BdzMll!|dT_y{A>0 zX4HJR_ZmN^m09XVVNua>(W=yDFA{_~sw8>KMZutLJibNGPHewrTdoKd6!8Pfwp@oe zzGk0oxy6+5$9+k{RH?NKN2&GZ8mnl_BjMGZ83@m2QXeemXO}Y&iUJ<<+&;^mMV2Qf zWG4J9DnwjpRg}+4mEd}7F@?{b(gEpylszknrd~-&J$nNnw_CJHd-krEU-EBV2?A}L zn9{B5%vW)>3Ro(xc6<8dFH!&(6-67j)~q~{Hj7W=n3`=pL22p;bG8-9gg-q@txV;% zo@JJpFwwxR7sjfqOYQ;OZ0lu&<(j3wnk3sQ)y8@io3ZsKa}9Y?23zld8xtRWH)yu? zA<;?+KId8AkWmmRk-jn^G1^@1>TBQ=r3`08b?tT5H%H1eMviQjeaB5`SlUl9k9`Y> zOB$*v)V?#INLwa+Rp&%KtC;nn2F&wxSs&F+*&Wrz^g-W58L8HNl4?mBBigoB`Ub_)n?{xi>XP{ds=p1&VRDp_+pIh<|JP$5$5+m}HeRe98je0wjp>_oCCCFmR_8EN18OCh;ImRnFAscc{C8SpG zKzWP)@Ha|&8i(Ha^Ek<>!{O&e;er;c?C-dyB9%$-j+^+P%4&>tj|C8A8v2ndneg^A zQ_8^Vl=pYIR>bn{@1h(oCx~xa)<1}3($^06*h*UaDYJE&vo3prs0tF-oGb%qX!S^xDh`SYL!V+FJU)9HOBlWPjVv2(dXxIgQR z`7ZF|8UyhJ%61LNhd2mjyH3bQ#C}7FtY@`doDFnX3Z`bfp&%PjV#p*UKGP|BF#wTF z9Abk-)U)D&3qnN3ckqBD!(Z1aHFslX0}mt;o+2|D+ieqWDNBWE7f)bW+6onrK26!~ zHu-o=r+hb3&eRa;Q)!U4zx%GDvjy!&#N;t|%Vy7&MTS=N=NbxTH9bG0e%qy>=b5n* zJn{)%R#EfkHTn5Cf8N9e4>GuT{tk%d0q|^4rJ9jY@?a0{R^Sp950qttgJ3!G5NItI>oP(@@0x>@T~5t1~2gkBYa_`Wegn@HUq>u zywK41Sva4o?1ec^!{q@=>L@gDDr{3L;{~fs|>StM#_c;9D`Y;9x7`t zF-1d62E!g3n|_6VPa=`4*}UKeDb+Z1wq@)PGca_aW$XwB^!$0brTD4Rh;y@Q$%bo^*C}-Jh&t3DuZ0vbpzp&X%duIKpfbNAT+TFcN z*=1#s_YESvw2yri2-a%5 z@0cW%?B@_SW!~F?iiA}!XexD(2(lY3OZad zv13a?OsO}H7#?u-IR*v9mXCgvF&k?)HgRl(;ng!Dh<5B66U{uc49D1Z=*6SsLIYtF zWBQ6LEnhhYzZf8X>0_^WY)=)hIh8dh&~EC+6> zYOR#`*kX2oxlUy;wPIFY(u7$pe_8b|FGHM4XUi*9rsN7`T*8bf%g6-tDWq;Wk&u;p zJepC(@}NhQ3!HmZ_gO{`<^35o@G937A7#%{WBB6)XgqySL`Ov_z9s|rjx z;u%dT(>9>kJu18$8twYF&a6zU5aG%%!C%HLqn2YX*;$O;ShKROHa|XGM1jK}HC*s+ zU1gl>L-`IBO^yU*<@-_!qDtea8E+aoejB-WmIA8Df`18WX{Z>qV(~_iI~mr^@m^wG zxWEi}+EJjbEZ>))Mu%{e1*%J(d+DzI#MePoIve>xXumqUlO3$6#FF{oj1k9<=OF5( zJ|-u8vV%}o22iSd@P-OQCgc_Qs~(ZuR*(@|8vvDc0QBkJtkR%~Q!~QK93pW?5XpMn zM$6V$SwJnZ`Cz81r|?Sn84<3MP&u#TWq?ciw}w!6l5YKpnyKhJN3zO8bS(3s^RJnUGxMl}+B` zZ#y8XF5{=3;a68u7B4};D-=@K)j^+vsFm*#qN~p9o4ZUyt}cMU7Z$VXISujmRmiXM zd5Nrg$3&%13uM*%M*5gJL6B7+A+TD_sbvf>4xd|uuC?QXM*)mgt#v9!d22YU_3&0P z^-Nn()n8{b|mcFk{t<%@; zn$K>o57i!+EHIHTw-m>V%6;MG2Gh$UW~86ck(f^I70{Pa4t4C7u$rfqDuGn2 zsdZKh_=PZ|y#9s1&s%|1ps7pllMQX^CcmN7cm5iXsa+7i`f>j1 z$1QEEu~#bOqRQcF0yXuUKW7n&GjH0WItsH6{|VtgX#iQ8uAgox^3Md67rBvCWlf~+mhP;ZJ9XhRI5tr!f&?WNm?rR=j9Y!XV z$Ht+n0lkK`cfO989d5I!;8%y?64wCZ(s6h;PsRmfazIS%!r|))1{cR2i|S!5qq-jx zc_oHQ)J%`TFvHYm+q0Q|L#**Of^6mjzHuivejdpTB*>8=^U3!xwQ7;grjqn&eOGdJ zgvrCXXmUI(Rx!(j0Wr<=l_db-oHkrPEZgj_tSDAx&ie}bTE$9LpB*W(G-oT&7Hafs z7lGpM>)>JvUq|)fjx8hg^#T1UrT2Q-e327ntuOM+UO&djl={7nDxbzmBx8I1tops0 z4nEq)=#92w_4A2}f1}f+Q{s99MLU6YENwF1sNoX}TM+sNB4z|Ehc^(h>Qmm((aMbW zjq@!<7X2HST8dMnbR&D?Do?DVOXTlcAWjz7bn^FIGH4MG_?uD8Wi3Uu>OHr-r8qq? zam0?b=4$e7XKds?B_tU)^Yf~Fsx4!FKag*AH%#_sYmpBgWp8!~m2=X!GWkgZ@z!#n z@&jyoh3~C)(BvpDE9|XaVdk#^{8EcDZ=K*z(#{!Pm8G{Xw-nj2zJexSWDGA1d;fz=+0l+5To6LWyn;4b|ti@zHxNrO$CRa`a(K>9G#{m>+7v zWqRz;=5ZgSEO*SGDZvMWl=CGnqkOFgz_|3yUpvO1GJyTsBZgazhhNnc`0W(}$^7{3 zHey^wM6O1+ZT&{D!(nA5xtIeYtZ3ogRpk835IzLtc&eYd4lk&L{v2ID&!9=&r~Mta8FymQSS z=gN+C3KN`d&_p5W*cFXY{;}%>p;`F-qmYI{tSlV<=!l}Td;8JZ7QE>pL%$zgkYDPq zy6ne>O0b0B__1d!fY360vyY`4XKtgOM*bRq?`-tgO}1|D&|z5=9!<6Xz*JrT4_8(j;z6 zs_Jvt*@>$v4P?84V?k=`>BN0>gL02V_U=-oigobr3I$W*yKNwvUA%WYaK)tBPI$LV zcvObpMK0iy3S+It#_wVs1EtO2bMi|p|GUS*g=G_o;w+X$t9XS>;E~Aq?Yc^WO1N)%I47dKx(i z9TMNWP^#|UL<9WE_EzJf{N81x8;h8#%cb>x?;6slFJ#RAr$NN0w|oER2d;4X8&eeI zFC8q5ICz8d#4yHwp;4;JQmMKaBU`vxs^TILv_3i6&LMzd{bv>Ng+%>n-hVcu4q52W z|E0~V3{CrAJ3w>JjhgxsOG{N*7d78yQ*^epklUZQB=MoKSETwx4}apWVcp?w^vO;m z>d+bRbT9IuZsvuk)2J@+5AZ)H>wmk?OO>;qgc6x5H>G20@Fy2Ua8Ad5@(lAT+lTgk zCtJZkd0q+3heD39fNJQB`zkAuH^fAARH#>OCOJQa;?(Yg2>erBN&^BXt)IFLV%mS} zryvxwGg%5elOZWQ>sg&*aK4PC-;q`)KeIE-BL+N0f)l3U`OxeP5)_Exu6}~8Psgm^ z+{vx%YZ+AXGv&p3xoq9#^FxEx2!(;?ppy1%6A1r1V(ylUiL!s*sW5cH5}tl4@q2D zLO0WhpGHvNczA}zA`^|Dz96LS@TGygpS~_%{dlvRU-xjqct0iT#}cxC2~AP981TPb ziGuUMpBX7txA!;r?uX(38I%S-H_z-qj0o~GC^dZVko#=aO2*IJf!1K2t-j790%ugt z_gPHrjM5m$IbZe*#n_z0Hvgaqc_lFkK%V9CgdpIJ-4 zCK6PRE%CNjQkHlRoTz18tv}m>PwxC6dq2Azzp0WxI|40J{fIV?KeyEHMhvkR7DAu4 zP`wGl{#=D-N%e=VCeoi=kx>%M z_w&o7cW~cO9qgR-Rn_j9qr-%(-z1-{=>3pA{$X37HTd~16Pt?Y=b3HWp@8ASyvs5_ z&w@WRf4ac_)o~zb7Gf<84MnqC=J?dqe?_BiWlQlzN8$c8(wgJI6k-ECXX%Q-fzH21 zl3}DbC=YNFkY<#sM?f`6F%vwYO3tCb03F@1t=lNZFF@i*&Yik5wWHq}nlFV0EslhCPrf=$(YoOUS3CW z2`NUY=i==Oh>YY?4~m6u52h`V)-R^kE=F8x7{w%bUO=}oVA=j{pJ9XknilzQYhc%l zqX_-)ib@51($(BBjEuLCdG$7)&wF1>D^GTr z@t2T5v{m;&PWDSs${sAy=-I|EK})vaz%J$)*7#g*Q=&PRazqrm`#?-)q-7Fx8AT_m zZV0~&#qkH{x~cy1j3g-z{>#_U*kovK_>eL^GS`$}S&noC3rWAi@+ZX~ZvM)wXJt_= zzj917F-m^laEa$9+le!0CiVX}sz_D7m2Dw3&h6EWGAo|2#0QKO12Igv4DCv$^AzUe z${Hk~ryFr!8N{#p2A=2At@a8MzY}|S{9KO_KIX~fyO^VzIQ~5fg#pxXM1s(E{rmoO zh{z892Q(0d?xF!=i}?=-x3R7qoE)(tL~JY_ax_%;#`>n|iWe5Dsz?xYb)9eA{7KB! zMu2Fer=N7)!Nr2BC(;~K7+-HfS&`)&<5D-4n*qz!t9tT4{GPVV-mL5YQ8le^W710X zAD2q?BglU&qb$%6suN+a{i}V9N(LtEA%FFl{lq9tSKF^%u|!+@*IEO^>WurfE;3su zvTHZx6FV$?n%iXN*N`qSvCI+auXW%H>g(CDUxTqRjmX*LUt{XPNOOq^B!jY6@GuN+ zX07lF=ui=Cr{mE zzmDp896Z0V#PQhi=x@|u5qmc1k@jyKR~E>hwf+WzKgXM5FmWE8NMHPvU59Llp=+AA zM|K^h7n25Te5NH`UkJJIXrk;BT)zMfVVp?&btHn4^xRD=Z7=jvhRFZvMg#{wV*lxW zfI{4FE|(DoPcxX=39>AC`f{9b5-9 z+4`+D5LnqU)m^D{p!zp`In{BwUf>4|6Pf(&Ze$z zT-l+%J5U|!yBk+{C|ZvdBts-TC>|0hXAm~;39p+atwN)2SH(zKF#2J-s9o3%u`{RN zZgYKC2%zZs__)!f-$shCJmXoR--d1|H4ILXYUBFbmpCIt0)G3pD7q}|;PWO@C?>-Q zz6mi<7=!-~id8A67W6wP9z^4_%&MBUL6AjN1xDuYTySw3+VA$dcq|RN#E>G%5^Kom zB=(G|>S7)B-XW6yyNK5U_9uZ8_Dd?t-6iw8XFTM95{kh(eZd*-qKA&7+eg5DL`&#~ zh4_UwqlG@!V-1kAFs>?ZP2)4ABG%sJnWXI2AQX3!6`>e|HhilA6&UD48}aPbEwp#`QrLWw zHwB%j;|d75&nseg5jUO7+Rd$7Iy~PzMOuF!tvpD9nZEu$3Ra%-v;&~ur%EzCmSw<` z_1Hd{x&3~bG;H46f!XiR>(OXLzATK6ja4t@fT5ro3D)I(SjE9nklmR0FEbJre5EOL z&&bAqk=!@B`2>IjAnm$}f%n%L+J9Zn>~izyzoO{l_&~n>fPo+s?i3C7deWNz06OHT z#?b#kpHH>s@DES~ao+^Ve}HmuC!R?->k~{n{6nPBYzqHjF9r^3)D8YWL>}!ZoZlBM zY6GJXX}*Zk0C9R@x0L_zkpe?Y`A3LD+Ga#9LO4z^`$qMTpnLXIv$j)zgr>f2^X7;V zDKlNVT8sRnJJ21wxPj!|f!;X+)8DQf{j^V@8J^#%*tR2#^9~Apu_!Ra z;Z2P)3%G-ZVvm?Jd6)dUQODCszMChjw7bFXAEV(|QNvph>W|TIEX7pSA47R85r^8z zHv*D8NQSwM*Z2SNtZqSS%Hy@IKW4Hegvb6TOJ%un6J8)L`{aJTVx%X+f6|DeBhd)zd~uOrcNdvEsjM-W(Jr)>`6-CgDjk~V!8n&mMW zv3H^5SVi(KSwKGS9uIkKLESw~014YRs?KxXMXKzAaTl5v*VkC2cdu(sSw#;J6k`}8 z>KR?pO|xb+goNENb5H`1BS&MaKF)$ zXVp#EZ>O$#e51c<05o9?2PVdO9i?u{EV*wCH4VWHNAa=vMp+k#lnMv;3bIx-Xm1d=!W@D4t@|g7T^T(_4lGlYCx8$Y4+OG5XF;ld{Vm)ORW0b+c#C^NJ!bi ztJj5%q0#D&aB8K{|mW=fNRdU#Gn8{9vGp77^Rd1|j0FYR?t7Ws#PuH_|K zfwzHS9kq3%JQyLHd*52)@!Lq^q8I>|`srFlE z7%7^l*ExLaAqE{YH5_%q;*&@JbF`!lI9m>%kCKkgM^RY4RV-BdG?o#Z#=7A`tB%HT@Mq@~!2&?HzPTHNe(C@J@|L2Y zN}ySzxDeME!@oj5ijlwG*Rs?u#cy_<%-rCwdPBMyj{H?6q}%zyU!4deR_R3=|LOuJ zC*FE2Nhm)>lB#5@|4|?pE<0xC2$;ksK6xYBZ?!kHX2Xu^eFIr>| z?iixXu;h%8c+~wh>V*Nl5$Io|RAfUUrlWpH$_-innwhkKn%uGPh-paNU*A_`?t3aZ ziXG5@TaypL%bD$R`F}%wQ=|)lOpzd2!u$?G{y!8hNx`h~Au=QZ{b}RFV~Xgfg6o&w z(`MPj8+JnJB5pQ=eRwy)j3hlo_3DK<&vO0u4is{!kpO0??g!}7?GKy(`&C#!^bfec zZePg<{$`2F$8NLe{x{SgbLi!7+R)_njtZJ#Iyw$io|yrX1M#Stt{;rr;~zEh zv4==+_!gRn{_S#;7&8I>TV#9}{On*i>zK&;lhMCD6)+p!{@d$uk}N{I16e`ZBAG~D z0Gq@a8IPcLlo912l=7&zX(p|l`5^JOd><_^_3{Q<_UMY?krhf5_ao%Zq{z_z4rLZr zfkiqIURe_^eIoqd4H@2uj<%Z2wiR`zX^t!lR6#Fei8T$2D$MUtiNA|gnEl$ zBz4(lpoPlf)!*0hWVIR<%}oCu%CTNu?;C_aYo@h6^&ggkS~`G1MnLUgst)jKa^v2L zg#E*Srs7;cL*6*e{-JD0C~UIK>TmV7I4P*rUF!$^hWHPcK$6oddiYK@6k$N?QeSGM zhi<2axeNz;|L`bgRMRWHf`U^NI6P$D!_@q;;Y ziD(Ng>k<<*()(gT*kRi+QIjy2Bh0$2nVHi7PFD5=2m1;w*A@@NIBz#&AsCmBjWkuF z?et*_=6Qt=^fr^O%QaonAAoY$s8U7#fst=dZoce4Q1L~_vt;D?12auUtJ+9q^LP|S zjnE1opuXD0I@+voZO-Y|2QK6}gJnFAm6{-<80$Y*_y8)}d7fzFSopww%ZWu_88S12 zs8lyxR*6!>X>@c{wSTlOvSNaoaZuqOp>lNmMyfAFB*45xmOYZe0#kWN%8*4A9@HuP zqqBySw;Phcl9Hg?r*RwrljOp8EHfnJ3&*Jn-_b|H%hTx1?P?dv$B=V1jV*i!#B3++ zE;?dZ^-_wT>c1J@7KJ6P{sOfOSWO`>8S)`DHnkXaNz%%MS?Wm<3meJdb79G8wfq*2 zk_$^vr7lf&OkG&QO7$G(A>ljQP+>G+ z!Ur#*ar&;eg%4g;u`t&5)&?{bXQN7-(XCyptqm3KgG{!aJ9)r|GE}*&Txp_8*@spJ z5kcLiCo}`3eW(-CaGk;=-s$Ctkdm?VQTPzm%Eq$DVqW1xWuJ4`%hO0gKhAYBtsi2k z#L^`NJN7G1iE9q}*(h&R4=3rgF>*>c2?@4b7bzMpHWWT|G0*Ln5JpFw7)4QBSM^Re z3KQ$2kYwkIg$#vECb*DeZA*S3-fX$0n%5qTk9HwzwHThyL1$mc)|B}6Um+W`2wxu| zrD7@SVk9L+t$r0UsMD?ntYZVMQh7tTeNBdz5toOP#uCB)8-5ljoLg~n;vyXU6bh#W zq?dT1a1J9T*=6Sjd!cY!AbRT-3J>s`V{x3a93R8nf^ODkksbJlS83c?XxjuoJU|Q@ zS}#QlPK6K85DFK73Llp2#7jVh52LyuCS36;d>A#hs}Zf<6uwK6qs_v1G5+bPLr8P? zWU*(Q1^!)#7^7HsQA3X5LKMiU!gt+_!;ba@BiO=s-HAE;=#6z*ibT?u>g;Mx54 znYD0af=hgk^}NtzbsWds933`|%Rko9s<8B`qPSPU3rp{Tq$iBtWxhzkcQ4B!Sc50f zqXDZ+-;JiAXSO<1-+d*Zq(=CK??D85gs($=4~(PQ3o`_is~XoE!Vv24$fR{OEqo7D zhM6o{DpL48C?)%iWo_3k;crm*p37Wz)b^1UmPJlJDuY=AR2IojE;!{V?9;H0VWy(k8cB0U$$#axO>h34q&xm1#lnx-3q zTO}$i>$kNOBNg@P>V@%Km2 zeEoo1aQu^9!bk35sDXuk^Zh@d1cSu@)leNiFNJ0nq8bCG% zDS61_AsZ)-7376d!*~EVm7Vsg0le9mOGzkg?|4r@zBWC;`d)+`;SfsT9GI= zb?{NpaAsEL&UD%U@*LC2j7>okh>iN}W<0zr{|2>UyDzqzPymMZ)J^5wyHOQG-s zJx)(_=VVj!11C(q%EZN_`v)F0U7NB&SF|GI{=o@{^Z{{aYmCqpcVUOIRrqUC z>;WwLgG;cig~f7jW$6b|N3lt1(qx?-`oUtN(R%O<^BS&byEL3kt!q2@ycL}@LqCX8 zf?3n%A`hdiLPr`W71|Td#d2N>)V}ECA#kT$1a$sg2@Rz)Jj)h4g^K<2Z-FuDkXC zmK^@d{iwRS%#0BK>5V3t zhqoQdrWGw9t+H535{8wq%J~x#W~AE629jDPv<%c5uMO)4VWba68E}ui6k01NT;C7h ziadd~A9#dX1kHdWV0SHoMNm?DWMQJd27}xa4ZK()_mN;{48d)B92Un%Q5>FAr4j$p zbpd&crPH#?G8;C;xQA{5G?ZWv?5zV^9#nZ$Hz}@TiF{B*knEEXrPe&d3i#;hl!B|O z|L8d+J{p+n!u#lD6sPaJYtxKUP3@;z{HDT#ya$a-$BmY?_&%tWi26$J{8^4iXmapN z=|Y;#IXpKW_*j-EqoU(LO~#-f8}TGG-;AZr z6DCItUGyJ^E~-O@-q7pgP(B;G1ZXCis-R9SHsgQ^(xNy8brH9%2!JNR+uAKxG(2ou z7b49Bpb<*QW;pWiji%9FaTv}YZns?ttW@ZNRA{@Mu-i(DKhc8(x^;V_ke`6n%MZ78 z)A|H7CGcpnq0rFtqh}N93}R}2S%;N@%8J><`$wMpi9djIW9CRjuhjQT?o1vj|%=(Y-Rp!~8K> z7^{X7a5GW0fH%(gd>(BkXu)TVGkGotHWLHu%n5WlV>fbOGck8P&Nx$#VyuafPowFZ zv_u*DbXx>96Va(=*T_%Um_FSX0L_ArxN?iaH$tSDfMX_|QSehfy;?{WN@LRWQC$QhiTU4huemYE%kgvf+&fK7+bSkzs$MFwIgn;|XZSg9hnY`&4`< z(j3hMLJ@-QIVJLJGoEHbFW5n8N*tQF9t&HvnV@T?@RWY|#eLH#jZeH2@i&uu-v(~R z@hB+9T=bvKQg{<#pM}l^g`5}Hn&xOGu-z76UKC7@E?$i_6Viji^7cIRPKj=;pY7)W zJz66+7<9TD&qbASb_vHN%vnOyaz8s43J!dtK6^aBer&`-&l1bW2EBwyesB!a#s`yw zaIkQ)r(^hU(dOE9P&eiJ>|I&_?~)fQ2Ns8yqrl{uD^m>A-lE3E=yJ`7v3)7ZRa-Mz zShdAqIZ&zLMpFA47sjl9I)S~a*u1k6R?<+ocx&l3R+4dM^AiU$t?t3G3{u%6s-K?Z3*8o)eEa@6J>(jN71O0L6#p4lq7S|$k11# zVJdqYC4My;p$9Zc`s!8S%CFVg72wrf=qJ<;X{}sRH_MxsS_-TCrNWh~k>@Y48r5f1 zrE44S@|1PO)u=t`gG_amFRDb7Lspkp-_xzzg!$YGC@m%~yc@)-(&zeI zgn4iV%|%}?=0cowA%Zl0?le?PALw!1=Nxyif%Q40S6dyI&(A>}6fvKcn?bj0RvfrN zDcSuTvg@rxa?`?J)BD^*A5K4TUikcyXkpT9eSChIE`Li{3C*NC`hK}rv+#K+gM4H0 z9TzxZ1n_xOzop=j1YFNv_&jP|(Mol>tg-OGNI6gX%buBGxY8J{BdrC zV+(w0|0rJN}-ywT%o;_q3kXFLC$|-%se!+E8F77ULRMY|$Ta9{LgKA4=)C=6T z)KJiFmvqcCM$fLg{f3SO2@tq_xzm+}jxz#dj8;cKqFudw9Mu`Phxr)lHsQVIbKDe; zgcqC7bWfsytz&cZfX7g|@z#LN@?$iQ@k+NtTOm`fEbrP6uS{_+c&r^70e7VhI1O9t zf{UZLus+tQs77_VQXzZLBIPiM3x-BSVQRkN$V0KTl(=$!%3%%mV+}DrW^mx>b1X`G zbk*(gJ$6z6cQ>pHa$1n>CEO0{i06bT_rp3OYT3Ic*W*SN2W~4a2%0j|qi>0IWVGh| zI;n%vxS=wxQXXF_1YL}l?{O3__;RK2xMX(H4dGk}WWnzUVQ_QtP|*MA7wn;-Mv)YPyEV zmB|hLo~Vf^b)lr`hM$-Xca**K9K%_zDh=Tgm&qqkWLPRkQ^6T5k9=OF48S$kBVI!? z)m`qkV4t`dCEaaPHBa{=X}Nahr-wyrGKkv6r3sPl3VIDn-t@IB9+*9rLaG zLfME5iev7(P!~<<39TJguDN9FHV;ud?OJmc#iBcY)bfT&&n&IEA)R2CG)KwqZ8S#S zIxhXL87;55#}?`Nrx?w87`Fb+Uh|iM*%y{bKz)qHhZ)%ymZ6kn%*3)$QR0DC+XlX{ zQf6$<>AeZtDx`UI?BJG3IG&;vdIHwu1msxOA%&qQN6eoUxGlkiqom%*g8PUlkUZ*m8$=TNW- zSA>A)BEI~y!A*r-Q92R?z7Cq(`ZtiVtdiVYta?3q3o~*z)EcyDBR~Q^FnVlWYzW{d zTTpzlH$uptRo*#v55YWhO&!jl(F<*J(=e1`^Wgr2;N%tnJu2VO(A z0*49*-9+WaK1dF|)71UJ@!Ut5U>=LM5FB!M2J*>AiX&(`$y_{@DbC2cqr<)76=~J;l3*F2r7aoe3cBOL3gf_~DS;AmRLH9z} z9>)%i6YGwmBPVoBH-caUVbod59m=-t2s>5=fNuE(3X|r>hfhJNjBuZs+}=Lu1N1SE-?c?{4qOT!W;V(_-OZYIBX}kwnBgG}D@OOH@xvO*Q3)IyLuC z^rQ~5Aewt9dYna@M`vL=YmVp!>z%WXYU-!en48XHwjxoI@yUBTbm~0mvyDd=pE;dMYD(9kySiLMCo#bD+%MJqb@^FpRq-yTdxasK4&1@ zi0$c1k$Lf;t7>&yYnq#kI^BNy21?eQacFY<{ps5YF8@($r(93plg7f!{iss<#OTux zE!BGm87*(^QVZ0}SfJPZYg;XO3d==!`HkmQ*P=4i?B8aE)LzUh4$ug#9gtsma9jN) zX~d9lN>)8cR9FlB=TB&$3WiEi-{!d5XFtoJCk=VbJTpQnG+HrF+5375YoWc0Xs=-_ ztcA`h+Ng>J3Y*y5p~&l~UOBp8r$^d`61;_AX1=A#p4*o_kxkb7@58z%OaYG;<#0=b zd~vk!#q52!50}Ts%BDBK^qpar=ffBuF+VF`ME%FPc6`k-M$z6Jj&snt7;7r|JqX|( zB*fu1nT)Bm&@aLsgs87LUmODJ{Plv|mLn+mWS$xUCC&!**OwebOD*<6^=NV7i`3&t zuk_OG7cZdG2~Vd7slA$jb0ntvMvfY%{C0vPNIk4cE-5AluqmPwGFXcwcfqc#-y~<_ z<-B;;3iWMTxM*-!nC~w6`pAgKtJ|p+5;#k=w~_u>_BM}PgE-t@eB+I zl47Ep!~>=BkT-9icn0PJm|Y)VyEcdr<|9PIILiW?%>kVg^GWHAh#?R@7lEPd;}MFp zs_br`S%~QB&M2MJGXice&7dNKxXyb(7|$g^>;=T;3A(~FS7RXjW?F89B-QeR=kE&7 z+!h}0C`3uR=K*1o9s-H3;*zqBXh^}AmZVq%Xmt-d*%#4uY=hX@seMWkRa6{oEs-7jQq70_8vfEOkYLiXcC8w5GNs4z zU`!#~$(R^c*_Te|ag6Z7XesAhOpLQ}G0#8)SShJj4hmnol4rntM?V_OWBXsao|^g* zxP=Kq@KzveE~J3%%TSAu7^U&cZFz=CydquRSDohlz=bb&Ws^^@)T}0Jg`O zr8Mmq;Zq?Tw1O|64MBM>sPN?rA=OvpFT-H?u|+Qq7QPI-;o~gw@ku$cDWw48;lp*g zJ_yNNw@>!3a1g zD4BJz0}jGY1=9i};Aq%$7n8rP=u<1B6Z`lodSP8n$i_AyoVH8rW<4N`6LvuJ!8)iY z(dI45#)yU<-IUA-(X1n?>FYdOvkq;$DOXd7;;%GCLo>AQ`XY?5M@?d96t|k9QR`oK zcM;CORIPik2xn-sx?9K^UX@@6`CODi61$hCc=9x|uE>-16Iq4s_7sLYUhqspAMSo( z@Xi!Vpf9-jG?8GxwRZO>Il?yCJ>;0Iy6SS!I@?{2S(K&dZp3sq^6Z|Au`uz+V>n3o zLX3KK#a7*YCT8FWOpx<}1ZRkGpMQ0@#B;L@dMU*KPjPwqkPKJJAa)B^i3Q2J;UnIV zy8E^dc!h9}^ze2eF+vfIu|7<(24%K>Ns2}Mx>WbIep!lPOd?~qyndy{X&y`ZUZVt& z%&QXgusqgxC0UH2THl+5{R9srIlL5)BpG-o+m1;#l@02er1g~~UkxvGkJE8({Y(5?m^7K(gwQlj? zL1}L26K1vetwpO3N*WBnFkmsj%GJaA+R_a*0h~8PAUh^Amf0o&!uXCg;cDzsbKeao zBL;KLoX(Yt*#M0Dbkjg#?B|;DHOw-@hKo&jx(nHMBQ4P z(W|$+i*w>poaw1a>}S&N19#c6^d4XkEDM3o$pYk_mPnH4vaxpUVGPL2Tj2jPs_t0n zQ7y<-Pr%(=5+hQLs!7nGzrg~+jx=9t7AABCPX00SqDXi(g9-ZIEL z+cA6z`$x|C<8x)oyow;6s}KtZPp}fX5hG!d+>T*2cxA|YF;s_c(nqt0eM1l%uDczE zvpZE5z7k;B$nKyCi|PV4vI__}_N&`&7@Eo&Jbod{5m3lR#SDm{Qf#C)MtG3>jZ{Qo z*g~Ir{ho%4%cn9vDq@1&9~f+;F;DP>@zSd6m(L|O`wDttBkj6{FwHU_jDOyJ;sGXb zk$A!prQ}cHJG{JEq6kS0cs9WpCKH;L6V)&KlfBp*s&Ej#k(w9EUc0s*6IRDT4U9R= zYRX3HUlQa)b8w>AH`-gR$dkr}ja10Rd6^(8XUv5K8W>Zco2Zvb6x#t|bepK4i?UK4 zHPzl+stelPW4ehN>cK(rZlZd6V56!6QY;ix`Ik|o`b9Dn5c}@h&1BPzfg%gB33_5e z7yVc23!9)U0b=icqI76Z0GfE9D2DDW12Mz}hvy)Zsp(^z?T5kR1y4 z_A0V{5=ZjqyC_oZK#obzV0uS#h&N~HtpIfg(IszO(d?ax=)or$<^xKcm4ygZ7o!iO zP3|8a$HIJJsHYj_%fEwk&Z}ZwY71GDpUhL#0F1zAY;qajXi(t&DO5SfEveyraFgRJW|j zArXO+*G05&46>y!2j}*nw+!ZZ%trK3ETV1CtZfod4WNGrF9f|x*DH>9LT zKL5bzbl(^=`s|8`yt%TE6BZ^ekXW6W6Htfj$SvF})7UdbnsGb4Xs&{>czu0sY z4;09(vxXG1u^mTj7|n$w@=1%9Oj>a+S2J-4G?me5owxZUXmWTWkJjPIjYt^lsXVG; z)lO>9o^8gki>_=GaUscpv>6eXn=x1s*ODB}fst{uDTftuC(lyT&z%;Yy`Kls)8jmu zDF~-dQSoE3YLsqWTeG|fRR@-1d6I+Kuq>@)QU3MT+HGz3iGHKl+UX7LEo z+V2CRxJ>$xQ2o0JtZmy`PGC6_g*0;1(86tq0`3 zGGtpt+fpKwDcdT_mcr4rmZ9TWEJ3mLQE39WQEgyc2@>{Up{_JceN>`=$QUIV? z3?#%;vB1Zh0%R{!ZJ+f~vph09A=x|hQK>XpJ1)!UCnS-PN)=KgrX+M}bd@ry}_bVY!}((2{0l$n(JBM{T`r*Shsd@qArnULlX$GtxVHraGA+w71!cW$We(prJ}GW<+g3Sf z;|{4r9oxnol)NT{y#}|fH-uah-8SGMx>f_puBNw*q*%kmS5hq07N&2;fp!$2Gr(`M z%*QOD_!BYA3ShWX4v+(}einp4rn5PwQ2K=&K4Dftwq16ZIveZ9peT&uTAnS8<7S@W zW!x98>h})L^>Cl4K3!>;d)2qy7b5hVFCA@rBwvBd?U~RLeyiJ;0~sB|3gZ#$KDWKq zquHMjy}jLj$zasIZMVJCLwsYoy$3+ghE3y@(ymFoUR|z=H(ErZ?EVC!+DP9%lzBN7h_*N2Yc)Att5h2%eg>HniRju)YWS1DaSsTK@U(~E9TcuMFu=Kx z45LlzMUPt4oL4*=1ke?ktk*p<-}=}g6T|JdJTfH=i0?83-1QK>yeoVA+aCZxIYXJ% z#W%qxLhfh@DDqk_1L$$#j-?U2AJ`;ba%0dH5mto507r5=+9Kc}?w}yOBchja`azx; z+0hjt`^Ts14IF2n0oc*2KvP$1*B(*}zr+TbU}iwLVzbT^@ zbvefN^FT~#a*Qt6JFewWua0lVpsnOPG2(m>cHGZl`3ygbd8p{F*!wda9aCB>J1_mq z$&Z3JZYKDc#5=EgMWeqpf`d?>FDuoh!MCKt~TT^FO+pdq~vvkw2c7)Bis$TS$yq8i;*%;9xhMaW6Ru38RKu7kv8 zbC})++jR^`Y0?d=f=>oL8BpT%Kna83vT_Cr{h{>A*)C{dz~k5FuB#E~EkEqK5n*oq zVb|>lf)m3&ynx9B--{r#;1;FoVZ_!bkJlYbKR2nZN5sIAMVS%nz%t<|xwkmO^{0WA z3U@F6NcBrWnG1I)W>uceD3=^J9q7t4_~kj!o5$6TKcx@kL9wX=BYD8N(ha~Is*q++#p#aE#lz$!?{z5sou;a+Sbtt*~J}u+^;ZMBVKa*2||ls*XJFc8co3 zMR8l(y(U$TT;4FAeY;^J&VlvQ1Du$i7 zJL0@^F z>rApZ?R~B%$>6E)bNzV^Xxwu{c`_`mr@+sZ4F`MI(aKKcO~t3Kqn`P>hH$FG^3eGm zT!DLT&JuIZ5zigBnBSp1w_wRe^Q9wt?u?}yAByMBgQV6~!_M!yOCBIgdwg@8>AC6w z2ly;7i8n0qu^w;XQj4}UvffUyviYfG1ibh1g@wfa>iDGb_I|!E$t8CK=tBk158@K%(FruR16-@dolqD6 z2i5v~k=Hx}bF(XZ?E3jy4vPrP^lU_nGJGrtqq>3^Ddc2Ci&J@;xE#@-_0~Tb@SOdU z!M}$<)ohS3%g{HAxK{i;bjy;xw);Hv$kL6V)rfnr#RK$&WN@iRbAEG!D^OLz*iY6t z2irjA6k)V7CePPXY6o2V=pykPZ&>QG;^^5mh)?ffI2MKXNrv8l5|!fMK!p05J~$GC z_E6klC4%Y=y5zsY7Ckrq%@;6jQeNamRoho2xACADoB1cOB) zwVOV7RoU70KA8`wi${q|4k{C%<7z{35IRG;cL!WBy&r_`}-5Ul8pIKs&d4K@=>&{5i@CqGSP_pP#%S zN)|9hbCVZD&0-FJUh<;oTEyYaNnR9X3-EY8@}lTkz~aqCUKGU&P_LtZQ4}gb-RR&& zQKSG=6Nnc@g8~5K_ieT|UxW@pJ=8s?c7*pL^oUARs#FjATH*-Mk{6HVnB27K#glo^ zMS4018ZCM8Tn=(t^5VrDXtm_UD>=;9k{7S%;JlW+cq_*gX~~OsQyhVoJVG;Ym_suW>KEjEfaMDDL;(8*cqTxc&JJny(z$ddZ%FHw28^x_X`Rw!r>8?& zj~qV^NutFJY3a52;N*nA??9;Gpc0$XhBWslMn53+4+k5Ur{nN;sl z8sY%Ine0&-;=p`;?oqnpSfU!;qjV*}{W{&F6vpAM-1aC{agc4@dz6|uBv|3xqtwKq zu`=vYy5bl-b=ad6#bI7++H*=&#bK^3?KvAksy6prh{!=Z+H*O9x+=StM|bM=(LFZ> z)9c7sg$ZiyP6Q@u?S8}(*V>~z?$_GhEW+a=-n%?v@QQeEYlH>0x3@h)oqq4_j3HZC zdwU|t==a|K2yptfcPN6ae(f#Ch`R}QZzIB-66~FeAf*I*kCTkXJYK}{Q@sMlwb_Ts(Y^{IT-eakC@SOo<`Q&d2*bYdubMi zerO)YfS;1~QDS!b#wT&0-O<20yd+PKA{t(nV!>rH_4@P_*9C@G8U{2l7-xHlgo@82 zl6h5|&|Y=?2d(>`&CVlwxs4*B-$6;GF?J;R1{Bo&ZG$eQ>x@Rhgmi{s5MzJ9vm> ze6m>LHDRMe9zMJ!D9hn3WGF`rx$U@GRXuzYF5*!nyQJx4Ly_&%6yQ8C2UWsuF)+b&3 z{9@qSAsohfF9c154@0tzYu^$8-g{C}JKDF5@YKX;B`lASghcIInP3c3wr^E}Lk{pU z_?iT$ZheP{DnT_645cOj4MlesNZbvX~#a3`*w&+NN~3zOMi$1pd?-v- zuMfFPH^v4)?{Cy`>7cy%A`-oCN*#$={2mTBL`4F^cxPfbxY2!V9&n?)u_EKEU_hfk zm;h>AnyCrEK-9u?pfG{d$TVM&O)6)aO+U6UMh#7K$U7N2k4)MPD64dVvWu&Jl78FK zgSerYctdK__e;uJvN3p8#!Pk^JzR#!c7dS=P%ZT z0V~^V5n#nHhMP4Xp=Br@b96VKFP?N%ZyBg~+L5shx1Ms(Ig)%|bl-HoE?zO;=0LJb zmZ6aCdY&z;x?6_9bT}$&y2B~n4dF2CgAl}MSdU{$Ee7$8tdeXfNL^`Zp3PUi(uzDD zq@dJh7`Sw>fk*#&zn3eDfXo;>ngj@tGNhmuOv4tX8G5U3b%2%2n+VnIS>zpcd=7QC zv_w_%$w66AfqalVhiot597f*i)fCPz_fu(bhel=F zXuUd#V~;y({UlRKJo2`U&yh;i@Te1`2So-I!Xx`%48`jAV5uP!BXQQehx;Y5ANB2H zIIUS7!}F;OCiQRRxPhfR9K3%-yR}d?jYr7-iX|c;mO5vtP#AH8VHC$L6&Au$7kp}; zdpvCa83FKUtZdTmKX3W4UhMN-@`0Yx{!tvNW^`9WdVOqayr%Cq*?+^w z#5;mVC#bgvR%#ZZu=&|4u@thc%Ck8;eqc==_3Zh9bpn?f=FsBWwfoh1#^J`)=(t=} zd;mIw2z{Q2z*H!;@tLrgC^xuDUX%j)urX0x3_TM`bec(bssr;);V!zaA2`tz|B~RR zn&Qt0ezqz8QNb_daH#ffHmC!aa}dl0?yh}B-P?TN8vGFSfmmChH={7>U0ck2)p!bv zSW;$pny@vh^qfC%zX=@1|HyEmPlMI2vsx$N2PJ286SZB=77wr(id2=CFUElQN~860 zc!Ra3F2G+an*W+jy`e6&d}uuh zkml)hJctHwVyUMC#(NwcvlbuecL=1q5JQf>4IS<{3QP|K$IA|qu9ZdO!3_tSZrnrX z99lCS-uQ8k7!>#TLJsLE`91yk8OMOxn0jhdRqptC2VtRC9xc_#C5KGncGcceg(iLc zsv~1en5cpqj$s1h0z3gqdp&;Jk?m^@P z+^4V2IY^a^Al$w$SLz&G6=RhtE*l(Nlc%#l53W;m9+Q|F-zVJyMC(s7^hFGTZX6tp zP`wUtuo%%@3piMdAg>J^oQ*K;ZGZ4sME8~W;K>MtVpb<`kE}TAA3Uwl9aE~$L+0?4 z89V0zVWuv6h^mY$9>uHJgV%k!SEsi?=SG}7iXeq*zZmu15awfNc-xZJ^5BCILcgN& zQE3T*AjOrXAqYQabOU;;4xO<7iAX9d7G)1bw=K$RHv=mjKHr8>Y$nRv(yka3jnQ|d zSi@L*Q!I(mNM#_!=oM&XB*oy0wUUC(q-~7ZV2Wo_TtTrWN_qa<2o&b}#J3T`mG~*) zuA}A3u{bUz;A(93$wZ&^2|QjmTHG`x{(_YYfbhaiWW*|$6*+Kp&`t=IYYEJA#j4x{ z&Qn@una}IFDtB^NL|}67N3?M8Sb3C#nPERh2${$tT9m_y8j(L_?a>6dB$Q-jWP<8Pd6HPR@Cj-hDO6H^Q@7;1JiQ+)LnNKlr18e^ zK3tWC7s|{rsfqI%is_d$9qLgp`2nsvSvl;6#wHtOKgjJod01zjse7Q|`e9iFn`|-P z$PgA>@WfJM2e*JHrLd7xXZ$Bk@s3+BHZqzL=FLznfJsxZ98~+3bJ7$rN7Vr^s1xC7 zITr9$$@;y;WK9!mkF)=qoYkKjCXmpeHBKJW(9Y8S7*Z9~r{5zG17F4Rnth&N^0b6C zlsNdg2-RC6lNW_3Y8~UD>ZG}CvAQyVy${H%uJXQ(!YfHc*954^MC)gWtxIB` z{VcJ*02`mgbdJrYsw&*1l=H7C@m8v;S~ox)&%Vku05MV<44ns`sFxfHRFx7KsDWo_ z*;1=Y0SvibDjgKEs(eE(&6G!{VS>31T2<9;*t&ZomRKc4shC|hRsB4SW2L!MbTZHSPce`#(gN#~B ziq+Ji41jA(Q!HHSW%v~WVi!QYqG>%>5m!hgb6b+xZ^X5ZB#YYCsC6a5Ftxo+csTQ{ z4J1Lc0a6Sg&(nj_5f{bo#(=|^eQIWU?5o(|F5C@;519Ddon+!=v~H(-^8ed5bK5h53!6X=hC z!?GVrWGF%=WK;a*azs9iF&o(%5go~{$wubOa}hG39Y7iCxWdr+%T*05En651c`V57 znGnZL8Vsf>Z6i@p8P)kTJ4Oj|ATmU_cJiS_~kW`cBmp&1GB_%B&*?B94`~c8#@X z^Da-A-;)M5N)^JVEzEnxsB%h}ac!SE7f_-R+|WSWOsdqrJJ&f z2#BuU7SS-FR9guIJIsrcHb=7kT<=04TtFnni@#*;HzdC@>qClaR?O;U_3cg%8xf8| zVaM}q&`y13xW14;G2K%qitA_cC~_p1M%B;fF?ZUhekqUor>5#x^LYN?R2^o9W#cl$ zvsc^nB9aUz>o7727XSEE{a%X2JIz>sm}iKOST&a9dAzB8V_6>drdf@ZdDwNQn-S)zXkcG@VL zkJ?;M8@=*So8O{NqKA1IsO3>#7pG_QcwP&qjTU-wMEW;M#XOIvj?-82uxCG}ujgT}CXJGM*;Mvp`fffP?T5AS(+@O*J{Ikl@u8Lw%a`w= zr6EUDwue^aV82`swZ*VkriVI0FfPwST_Nt3<)PjXaxL}HK!jLLJv0&`MoSM>Lb}t? zLo*?w3jEN#qHe(ol9*k!!cPBv7_TF`8Gm!&%G|Dcs@Z2?k%~4!6b( zu0jvD$5_x49PW(aSS1hl#2lVd9`27puX!IHib2=750_(1Y1-jNOb;6N;kguStLgCZ z1Z;Yk!wU*bA9z1}CPouAbw1{aYwA*hA*iXVF+;AnZ^Rsaao>)?urlw(u+#3t4|A9; zwwWa{X0&@|S&TT%npqiRUfs{Eia}TRGizc@)&0ymMc+NM17icU)|oy<@W*ws%E?yk z6UjT0;`Jh}q;O-J=$tq+lj7Jf&jb;kPr>48sz##ZIpOm-MN3i1ekuiUtfq}DdCsPJ z^4dA0l}{Cni#*cNnd@nRVDmL~=2n_5*4LT4X+BSDXC9?l0^L2LH7!oP)8Hd*X)$iv zccdfDVYK;3R~nCoqDOkuY)Ih`}hDte77WBWL-!LCX(@ z6Z_^N=7{2l0r8pPh^c=T$9yd6zR=MypTy7(zLfRPEWE|X1E zubD8FF8X6*)q!iUN3JHN>bN!g4sV<0h#1A3{3$6mPp+89CTxK`F_cXhH^JGO>lH^} zF}>>rWET30Sjs4%LZH8Vr@Omypo+k+ti(w$=!m^HfV5S}_9WNV%;DQ^T+^q$0AHa| zRNk5RLvC6_5^yAHC-%5xUEmce9*I-c=}HMx*I{&|@;>h?w0}g#%GGhvrB`V2NO4B+ z6{?p6cOC(+P_rapWwc(`Zkex8gGe+wLj(B=Rfa^|t18Z4uTVQk(A!b3P!0H9DedR7 z@++)oev3B+x5-{%MOupSQGJE=M(TF5ux|LVjUT83`Phn&S6TRz2c)=PMRDWzD)H%S zmEWKIG-fx%L7Vs=gPO}u75(t%QcBFX-u|?{|g4s%QHY1oyI2$XorwWFT+BiG^ZOD_l zI`RIDqMx&;nlpOmFJ{j!!ZwPh=4kn5FEnSGsMFxjUT(%=j&yw;QCNf620pP)OttWrLd zhfsz1O>Ppf^K*z1N~1fv=Bygrfu;W|5ZaJYVClAG$UR}vgG--GYGJQnPK5x(pbqDK1qjSzHE-VOn`h5Y(G zb^ZP1C_PGEe`xr&PfzSqXT+5TsBf^mu{>r88s!_UF>Dj@MtclR?&Ilf$IxjQaMp|k zrd%!F5L-rX4QM*{;F$fH|55^ltFVfb5nLt1%aO9W zZ?cH4IFhHJZ-}<|kniCKcWeRDpBjRW4BCz1&33_gl5bw~5V-+vmpVrD=1mVM;;ab8+_5yTm8uAB6Mgf3j;XF#DB%%6x!-SN zk7^|51K?X(00xEn*75+eHwV4d8ql?3zttX4Yw(X(xq7QJ0NDD*C#Utrjc@f}O%5vx zOiDlaumprt3d*-$%F`#1X(-1Orn#KMo#Xvm4FlR~iHO(pk+<9rrQyt|u1b z8XIuo2$QvthlAi}fWt-wU9h+GC|O+uXB6k(PlUIg|JJ4VW7a2!-nyz7qj5kYY0Wv9 zxEt>;#!ueu_h&Z=yr)>PQdlnq$@1krY{sOe99;qieF3Yk?W4;K$*-uRD-|_Y!$(*7 zKoDe&LNEYpVD_*B7n@Ag%i}zaaCDu8Fkyy+y_%!aSP<>AsJaY89o0TMXvz8qd5e~4 z^quP@M{ABOSCwfIvz9D}@?o!bu)Af5V-}K)F%>gAwWB93Qo&^~NaJv6YKkXKf=_au zCg*w#pT_Jxe%^_)qvuj^o<>O*^W^Yo+0iR04jkBu6F_O#^W@0(9=(-fVJ})KO&$nH{L&nZPDwu?JHH|a7E6_J4&~?D za*#Y{*HF*d&36#S=D`s-O>a=f7OII4u2eI8SCSz?By(?q9+m0*P?9I{3h#V5$;tCU z?Ca(mNf`T!dP4?!EIF7<^5L8haviZAPqGH}u#jY#5^tqQ+L>mos>CDi^GR-%Oj;qX zqR(GSGA;HH@ch+pBM3#`Nb<4U+A@LJz#(&PasGCak*64URX2^&Y|P&yOYlUV*W%|N zCeR!SV!pN{M-7|%*Onz1q_qceQ`E`?r?HK)0{695367wte{D^IBW&qkTSpfE?uM`R zfilpyev`C${$OebEip_((bD&mttOuc3Z2ItBWCO4YqN%~{*v{WA%y}@8nVbcEnmA$ zT6RlX&RJp@^rEFp*em$t^dI^#KDK)jYc*5#(TX?9Yz8uQ*B1?JW`|$9wJ2Mdyt|9? z%9W2;XlCRO7UjgX%-CL~p?JGRGrARyD0?x$Kuenj3ex-bil%&+xk%%FyDi5uU~l(t z3NZ~GP0`5szTLG5XJgnTq_-)TeMKM|;F*M)GZ$|Uyq}1$bVlBf-6gK_eyncw?d_TO z<4v6CczZqd zrZcJ6(okrW-@e(5E3EQ6&DajO+i2dt-;9Zt+1y9-_M>K8lQ=?*gujzDV^H;P4C_0~ zoAK#OYu;%U2LGx8uSnl%PoOyx)6I}Jzj+*#h4b7YPa<&IMmkE^q~@`a!J$@DVM zbJ{X}X&Wo*iE@<~($dJ>i5XgnAqla>U_iwY<<~iIPIKTKIR`>4PGbjKG*KBvLq}Rk zrETt~__?V~?`1|lx3rg;H=W^q2Q4aEG#IgiiZQXMn9$Dq{jR zy=k8=;MkJbR=wBinp6>?;(g6GCHU+U%S=WdhQiJ)MJ{c;)5{6qGC-b&WBSGA(Okt> zYccN2SROB1LYE**6KDq$u9O-^9`^;8lB89^eR)fx)rIi;HZH~cM}Yf^m&R(b#n9%y zvZb*}Im+kC?Y^p|ak$k?-xv}Z(UG!=DyMCzTOtodE~ym=(*)eV0zp!5&F(w6LZq)* z?(1D4KCN8_Rv<`kn4>FDxDNI18(tw+-uz8sC(QC4R|I$$cpvmNo=1}v(M&M0V$726 zc;EDSsI;p0zB$CZ>)7;uvfxF9)LPq|%9<2DG$guz)p-)6vAuuwd8m?M?ZxB%obyoV zwIjCXru*EV|HnzU!HEe>f+$?!GDWMP=t+fygT< zJM{_#x}ZMk*|}FBOf@B-VW+(8;42Wop1!p5(g};qPZxCzZE>^MRBBU7KBvLH1uiZMra~_Zm)K&6>_@Vmu)apqt+0e|^IR zkl%sKv`GH|b09k{Dov0BxoL6y>|MW@2MQ2}T|L$TvZp^#q~LT0r3%@AYQfN0U5^Q< zG2X%|I8ceGW(*74RGd4pt%zoV(26ljMur24^H5O)a_LwxzOXGG4dn&5#<{$tA>e^7 z(nWdT&lRb8sGFns3TP(iSusZLxzod~xD!0ke;%UrS{pnMRa(0Zorg$os1J;uC%&mR zNh8t&<8C~af?Fc-xVXAamt<;XqBKEfT^h2TcOk87q<(%m4x|UI<>)1?c`$1w61mPn z2JD`yjeL1Q=`WXo53++Ui)~dHrbdUoE*_7m2d56Qr>Z#KM)ZkHkmNN>2+}I*pmZzg zE-JYzWA~C|u6TV*B7Bk^aiegA4WA)=)?gWmG96onO<%Sj^cvaYlrFf}!X8B=-V|>{ zr--+5F>}ysV2{ML$vfyZxEC8vB%^RVgTxPbjqFAHULkrQfFf{V>Uy7YA*NoP7V94H zK9HmFTvu^Hqfa>>$oJv>o%Dgia9nN*KtE9{COjU*d`i-zjRpAwRq1$~kx4oxNu)g=>>ubkA4R%D`Um>YM~7{L=kopmj3vtW zb<-x_*7^aA9tOR1YyAL54ijfWEHL_#LA&)ctL=4f&corwJa@5jNrOro|R=EA=quLqe7y97A^Tw+x=sjON zYr>R?j0Q+pjE7jRr#9ip0>nxg3)sbAr8U6t;DUuBn$DkF(COrD`eFS z&coam{|{&4zgn-SAI_E(rW_CF3rKMuE|rw)p$`)ebPrcr#vAp+F**EtxXTKsXy5j5 zAO4|QH_r$?e3Wnlyj4+zhlj%{$@jPwZmq}T&NzMQ0zb-lQiI<%wrC% zHjzkp2w8gnK%|b)bBB7^&C1zdTwLI@!z4@aNC!F?#&9fUCsX> z$w}BNW!S*bMv)RH?_!VcbCJQA5wfa>hYRTI2#+Z?${M40Qp=?@ zSG{u*Sr-qnHhLErskdgiP5TJ(hU9kwK0M*oR+#>9zmsEy+tD&g!0+UT+w0-KUsdII z@E{)d^naHL5?1=(^$6{jR7-4&F#`em@pk2x^l?PfH8oL3{BBYoAN6@3d;By2`s`O` zZhhGbM54YTzapxy$|Qn~b9EATBbAJOUBKh0TkEU(RHk@h7+Un|n6hx}L-q;QT;DMU zs%u*sS<8LL0m0gRk2HJVM7TX%-^LR5L8ep-bQFbnOBE|SIqcvV(6?wJ)cd@|eHYci z_pG4zmX7e6JB#;Tt4Gs`h)&%A!FbYlrbgb1oH@$hE=NzLCL?gX z-Dv}m=l250us$V%es80MiH(6p7^eO-PW&F4Jb}vqLeAVIVk_@Je{UANY9rXvN#r~T zW3|m@D10JAx)A7|$YxcAL!^3QL01RD{m5Mvo*9LeOE)sWBs5vzgU zdH1Sir+w4d#a7_p=)? z>ad4>zuom(@ni*qz&$xhLI!3Uu<2spG%zhv@_|*vDc{5cnGLmVxXFP!1JMAOw#5yQ ztN3zw87NTUs5I^Xa*WB4H_*ut3HlqvxMyHgc=H<^m~O!5p>mwF8tP*x7SKOH)r9JG zJ^UaW;cd{6mN(ZX@B$4b{Xsr(+nZa_b^;bRgs@}bfc=9?3l}j{aAVBM_(8~bEAt2K zPkmd7WQ_a4w8pXiO&k4S9+5J-{?M}EhaIC2HLUwaJAKdog=ybFvn_u z^#?=w4N8Uk!($Du<=cKr_cgdCxs3J99#K!k#n2|n7f3aE}#;-`vznC7^_Mudd%J;((A|E=F- zj^RK(Q1{;^(ostvQaifZ#GB_4j^-dU(dKGrIFaK$@2bf|wlcmek9Rk)P57MDbv2eBSB~P=#XkN)N z=;@;x;6U{Bum<$O`qRe&Gi(a_^b{HCvFYhqRri^2)8sf%e_7|%` zQXR&FBaFyth_h?`A|L!XCj3GeFi=8K71v*gkU~F%#2BDJ@XPG9vgGoOt{_engW?$D zmtcsJk`5dxhqUuA%ZOIN7+A@w{FnPFG+Z8&x(8v_fh6ru&q6JQbOwV~LqdkJUk){h z;)tWsFGsBg_43Fs$FVNsJ+ylEp8tChXypy&c)kRIJYFcFYJ3@CelN$5_?L3WkC6e< zBSbSW)6f!CuWcMZ4V(sT;_^q=4Ig3an{^uYA7$Q_#{Bww)S|~C$L58fXf9??0YN_$hy#TOF0)D*I z;7K)J=|a`G6^jL`+8jO`5IlMY+xFSj8e+JRVe|DqEBUdUW^Mbdn=cm1veA6D3n`eg zPg1JM=Gh?u^dR%>C?T>*R^#wpI>fW%f>WD|XQv3{Zq*CCEAoQ%d}}c1BDlABE;pS> za8kqaAwE}<9*sjA!%iqG8d~9`MLw?QYINQ(9F(Eyxd}l)!1W2*Qz@!x);;^vbBhhF zTm~TcYb+=B>J`hcv#myXOybwMRwKLfuL~M$o0=rlkC4z0HsTqFWVDu5^y?9;v7Rfe zU(Z|ktg2mI`9vnP>cCHA1C0#`Q%;;FNwhi9Dhq_?0|ZkTU*&szK9_puuiP{X!>Ty_rMKFAM=Jj<)Eb{e=lKZ;_tpl?~f!m6(}!a^?PJ?B;Fi5PCsPq8>OUp832icTr=%Q1#K(!N?uG}Jw~ zSAq2d2c}n1<;`IjZ|{<+_0Vqzr0bW&aar!47$cx95Kl}JNQf&j63!7!^UptR5hYbhIi~{vxkqMqoJPZ# zCwmE&0^BYgln^9lUu7^v9xbA(nQoVYM>!}=cbY z&7z;|K^jlfd9oj5{5(z$GEf*43vkaj?2)~}qFg`Vjd7Yh7!T9tTeN08iP`_-6*GB+LmwO#;B15K3 zAFodeB$LXFVF?y8qR!+Z5?QE;a0cxx!~IMd(C9A|X$JL{(yFr=5yGP%P#Kw6)B)BN zniondGs(=j)hP4R8>_5FsFNuB8)XcU`)@lKVxZq@jNx7}mm$9$wi?xznByXbG2s3! z7btJv^lw#~LYuddqFtjlw>A2(of^yB{;eB;juW^~M>6h+)fkV5u-B3W*ld9~yPGW{ z64A3gjd789cBE0h-PwsoOx9e#&(1dTS~LsxCMIRR{lj2xV}f5Z9xl@?-wZWk7)n&P z0>z_coXt{*H-{Rz`F(RNjUI-=ZrZ{Mc9=I$OLB%5mym|y)mU6q>$l6^%2*P;Gu%`L zjTrpSsQ_5Km32NE?18A%XPdkgJRcF1-9ECs^O0#=@wYafkDxx%+PsIA@K*8pNQ`#= zt+Mk`M3nC7tt!jp7ZKyt^hNGlV}6U)w5MfQ`@q}6m+ky^r%A3HG;vYFHhR0)YNT@{Bv2^^8(a6Wd~Xi{Uym)7=t<|QfChFh z(%7oDpL3m7V>^2hvE3F%#w`(Aj4<1|J_JM9=NoU(bEgrny`XMRZI-3`I{_I@p&KZK z8F5~)wK*AW#1xqqEWs!X6vaE02_jDMT3383$4#Whsl1>lj;m8DS#i7-%6dsz$+UmXGXk$b^ zmosH$o&QYDK}5LvclXCSXPiJgJa)X#`1)0txt(TScJVe#19XBJgMBKY2FJnNfU!w^J4 z>#Cmj9z0+S)|yHyrH9m(u>tMym(y8^A8{as}QZ(TFNJWw$#?ieg$kb%L7eu;X194U!< zzgX>W-Y=t%BqBmqB#I3eKbZFuDky|~ktq4TeBE<(8CLzoEK{igFxa|F)#PSReKd3?&a|bCtY)2T)qJYkHJE9M}bt2;!_QN@i zSmxYyAtOD;?{{?}2XV~8Gx=XA(kNx&zW|Bw{l^<&zf@g^!3l>Z5N-j&`O!o{#JxMg zYr8j}F7#@gXQ#Sw3@DN>;GgGX2!B)%fzpG4G9O!Q{QnV)&NvjgSxwU)4UnGI{n1fG zhU;2HoBYuPSh6%%O4KZ)5_r;rbn{jOLkmJ@Eh~~ru|>}YBB>@8=Im-K(n{sc*}MoR zT9%d2#z?CqK3g1VZIK>&w$h4V&}^x1t;0hZGTodFrD0^J#>DL|noy?|{Q~7U+igXu zDLj{DMK|z2*NP$u1|0&0RuoerLnT&}7jhXKw4xy@U(O9hSw)MhcxcN2`XQIl4bpVH!7v;o6Lm?tCl$0`Bvza!cZOWkG8;_Q!g3(S~f zQL5nWj~%z7SSCR$W`ArE!!`OoR}}UIs|7$Y?F(`&*sNhaXkSodq049|R%sgp`vR!U z6V+I!>Ai$~K@EGCY^C&xkbMDe!6&dA!(>Kg(=GwaY+o?%!b*fcIZkr5|3v(s%thgZ zArwVRu}vm^>HaF5Uik!i8BsAMYecZXX|s!U>qt&DbBG z0NT4{ZGW7i5~iFVhn!jtK>sPjqOp+upR(|TW(v(^3j4_}3<FiJTaWzmFG|z4o zmhIcR3p0WJ$)gg1`z>M-54&8=1E(CK-W3a8))Z+$&?}>^V`_JZxp_JT{Y{TZ(73R~(0#RmK4^jn6`9B>H zd^pYxI{d?U;(vOzjxoISe%)i4WAr=rr}HIPjT7FeNb+e+NYMRY(1g_qqU+ ztTK-L+ zKbDqvxbcO0?%nLqq3FDxS?8x!o=}C$Y-+BNi0GVj&&p?N%7OW|dShO>_ulk`@!ay(XI>O!f8})Ch6}nb4z7 z0GWQd29@&1zj3|gv)7=;@GWv8UW1DAf5O$AnTStG4J$Jod(D1D6>brESY!C?!!05c zYDz&@GaV`kZN_vGdE5mhc0$prF1lvgg@hIrMn;GfTB$3{`f|R+K5!Z8hpm5^)J!4t zNuqT!yOuPd9@~JtpsAY6qz3=v6s*Qq~Zvj0+nqPgI>=mf&~N77ewwaz%F8F-oJp4XMJBXfw7F%67)S zY)twA$7Fs;m)DrIYFxOyM}Kqbd(8oB^e-XJIjF+&HRkksQZSPo^bbrzYTVC3_fP_H zGh^qVf5@=G46hhx90OAf2w%2tlB0Qa>;ncEOPr37@H`JngltD9rt8G0WI0!RGqA3uUc(ITUxNvZByHT ztFXJE99QLIA;isxyNS7am>9L8xq34Fp&h%RApJ=l`_Ew+B>d&kt^gdXZK?}#in|8Ja#VN8i4fs~ERCA&{B_N=S3cJkfz5u+ye~p6n26qFSyKC(0w@A+V%wX`7-FD`0V?1L zB(NmnX4N|evp3HJha(@XS>3ZS`?^f1*|B6rn(GRqDJXYawo{>KUsqz-`7Slu*Hx%Z z$#pe|<#@OSx#9pPoVc1mL<0o`QX2Sk0{b=aUkDtGrjAkeExpkc)dKdGV^M0b>|$h! zyP%v$i#t^QY_;NkBMXU($1E6uvy{b?*4OBZz%HKuTAT+(_STISJ2FGX)}C+}Dg}ER z0xZ$C0{o-=)KS>mN;JT5#U8an*cP$yzA(RlZK*wCv}AAVWkCAkwquNxCf+tetne8l zl09VG>>jA7)F`%X-rCa)hY3J$mk^U#M@xoagu=R27Ib_E4TeOt0PUjWR-VU%r41PsbJb}mvqRjcx^*s zmvjk;{(_B*4EiNK#Oz4hE|>Hxs%SlQaCXVChIsgAmrTM+6^dvn!j6E-shnrV_Ku)7 z{;_xDNk|sBJ(R;4#hG&vXQvdePt5JH{A<0>|DV*1YsBc@Sh!J|@2jIQqLUQUJQlFOx=6S% z?MT5c%>WOo#O=~-D@N^5=|(FSt%Kr}-$!XNR4=Uz)Wo=kDD70{;dW^^6h7*^FCFBJ z#>gSTDS38gk&@Z(3@U!2hP8L*ky`K@V^O;Gw|ABjC13B(5#r=~+BpX!oRmm@LuQQn zd63?atw@F9hFr;y=)zdEfvj$*6qJ0MH-s#nUD!9^8^ROd40X_Yi%oUI2sEYqpBD_y z(4ZD>gyB{TcK!g^4R%49P#co7G(ssbNpR;%pqB~~WkX``nt%pPrYFRd$%xHBp&=3H zpLSV0g}`EjaeXx4mC#Tuj{EDxjY1+Q3rue<8)xo}m|5cJ)4ma`YD3IjD>3aGdkh8% zZUoOpckg~9q(doa&d9h~N}*cl#(9RNs&=D>D8%jnio%-OoiC}Bjg!3_WnsT(kJw#_ zunf?<4~oQ6A-j)|7h84rFc0`xNxP4ul)@Dv#1ksh-4H;$n34bjr~?AKJd-5Am1ncs zq;ASLN;K=Bywr-d@Y5=g`;>x~Qj`w}!vDdQAGMk| zDwGdfO&n6ok6TR}_&;GaUCsY#tLe)daB~MA3GAW1m@uxA?eaORsakCp)VZ=q7w zT_w0$JdGyTH{=_+^{61#QHlLmrBGGL_w-lOf~S1|*!|UW2)8O_jXGZe76U{ zW``OlZ(q%ZN-7 z4#?E*Eg5Tb4TvmiD*&(u)S^i3)#B=#&>$h#hRCiRBCPy<+qGye)Ky$>3)x<^<2=%% z!b|CP<1GNTV8%&u8(B*M+#AVuU50>&s5{7HYDbEy#8*M`I$@?@Zb@DIln8;P2u>U9 zx>-W*yip$lt6*Uei~qc!FDM&fZ9{Sc>|dBcC{vvq+9A|8RF=lHiBUD+x;@-%29wa3 zf*ExhL6*X7puz!Z2es4+qaD%RWu^vkIFHhK%gFFXiDp~Ezz*F3vo+4BvEMN&l5mw~ z(1Zi4aA=G7F@z&4#uVI61xHXB@+DkK{m{yUGQ08&BcMP0o}$of>du#;OqnVMoaK8?{G0_33kIq z)d)Dka4pd6MrjFDJin+$G=qE=%EZZTEC#HmvBomtO3S(p+LX?2tP&hn++u`829YIH z=;!Xyz1^5fqfd|9FL7np?I_h3G0E#?mTpJ;JYE$yW3sH)kk7(|7pXrgXMRpwGY z%=yax(T;Y>Q>E%S7*t=&(@&S$UyJbe0D2Zh`r4G}6j$b68C2D zeuvB!QpP=1emn^i!e55@JsnN5W82e>e-4Rz`Vio(xaSB0S2J*|DQs?~+IvQ1p}%L0 zJeg}Ow<(OV3;S1`?<$9PcF5oiRIsD!`gts7o1C`6N(a=EKco0tFW4 zdTE?cmCt+=$d{{?1l9?9wV4>kXUVub^AS)dRd*I6SZc!2$8f)NJTN& z(uc4&3#Axk7K*83LKnRYLYi5}jEk+10B573RBO!>I&f|+YKpdFu}Fbh2Y|(x&CNYj zTY@?Yl%7;uM^&^L9b3m0%#?Eo>WRtC*9@y|89LH@Ic?c~M77>3wdDfquD;p|2feBzxxoqvW=_bfluUDvTE67Ts1td@- z*xpsbS4`OKy_pKw%o$=YBIl_Fd%Km?EY02lM12vXjI5FOqBHFY$%1Sz)}1kU$$(uR$&L#E zYfJ(&CT4|wZ+iwJLDZflL~33q9Q46>`Wl0$R`j$NNKA9M6*omlStPLRehF51V0yZU zMCi6_?+^$jF|FC&r7&Lmw)Y5z2h4CKMc(~_K(W#}4_Zwk$&lsQN80UUO`hIvUl1|+ zH5z;0F--=R`^FK*|6Raw$d&fIYZBuOd(mAp>K>8(^&%Aw+}95ZUk=@0A3|bTaCc<-A=626(*7s+bMYPyp=W-WQG((agVqPC51H~@Wj5D>54u^-%BAb=ZJ1d!-btBHH? zyCY4lVX^GEd!VUR%;l_%lTO|AU@>s9!NdV;}r38DkxEgO&X?z7n~^MH~JJ8R~5>FeFHgzHTaqH^>0kz>QgG}t}Uyf2j)lp4G81M z6SZg(1K6Ky0E}+iaQO_lZz{pT9X1nchx|>K>?RVFnncBfT*+@BltP@5>YH6c7~X+3 zALCe-FX<}y=21#U>{z;pu#d(08Y3o`Mwk>c%OYg_|K^gy;yaMD^KYWW{z`yzD|!a7 z|0YB5SmqgD7xv#|X%w67Z-PxqdHFYa5PX9cyfae@C0(d9TZcJscdAMXb29HNkchD0 zi%d4*WT6a@ovH$*FLzd=KXHlD8FI<^Id>ir4rm3|MdvYzT<>m$iBrYZ;)^2b-c?pp zTR!6M&1|B32m9XarZ&oOZ*EiD)%-88n)bSDihGNixTC)pot*p3dn>IbTqEVhKl|Pg zgP~pSdmh9kn)dN}&raodl$egDeK7s-A-bCO@gBW>Z%-2kfqVO#_Gu0By@Sf11F=Jv zz7a)W)M^${CoMTry?5SPGQEB)(^Bq{>~G~M|2p=!%B(c^RQ9)0gu(7x;9W*L99G-6 zrmSYXf88wFyKl`}a%F%K-(F=kb0hxkOiq~fS_}Q{JnYVR=prN~m|58{-ws(?8T0K# zGjqyO&$;RyA%FH6HJ3I$9oBfgbOk)o4YK$SZH^n2$-ssvb}{?o|v0_ONs6v@>1s9 zc6VMgH}_1nkrEi~TX%7Dm@Td*$nG)&iN6B7yHDh2sv}6ndV2(gZIwHB_9K*uxE@x! zOv62ys(M5TWR^5N*@(u{hm^=*@9uPW9d=I@kgy%2ayzW_F(i!utDk}MkSPizZQZk< z!R9O30*~gPZL!VgeD`R6vod(KA1#D1nB-(&d$fdFYBkwD+ObqhPU39VG`Sx|Tcsn@ zy(`&|qV<*%aEn4I(4b4B6o!$5sAg5`s-7Rkki#>wN5?GeO=Y}(blT#nrj%$-)Lghk zhoc={ZM7dm9G;uSlnxg;gbRId-r0{;0^)b`*g&)BEgl=ezakcfkByOBeW8y{!iS_{ zieVE3^Wz;csU(N14E{3b$ zDJ0D6V4F6%OW(gcO(eU`TkT8T?ngmFVVQqfoc<8XwZ1KiEB3Oe>Q4x)mfiga!Ct72fH$d;A6uax zc{RgOA7^QVrU=~?ZsFwEk4l6_OHwVWAZzq+kTi7O3WqcDl^jMB@UEwas99P7^nGb# zuTsbf4Zw!?kW2dh;jZNbXy`Ca4G;G$k5d>%q9x^Q_%Pa#*YE7Zy7^>KJB-3J<6L3J zVeYVQG-xYoo5kcO+$Q*$=D70uWFOYm!8zbC>%(k;zn{T&C;GvzG<~xbR1ny1p-%nW0sfbaQnteFQI(&G-{ebzuXrUv+ zsHh$ent1SLOysbRG=4|zCv!mq|F=NdC?DdJM*#Vll3T#1m=C~&(35u~Ld&iSA1l2?%@M*%BX4Fk?`^iPZ>N1A%_du$F3}TbU1Cu?F1(?~w z5~Za@^q~VmpwxFdP^e?^0db`I0rMa=!{Cp|_jsjoWfR%+m=?mAQt7 zd{Mkz`pOR@&A159lpP?}3acM>ThK2^`G1scHFL=NQNGozZ&2Aks<4{()$&@M{i7Ny zzJb;KqnH)f1ILfrExhbW*T?pc4q9rl%y6#?@-kOB-96Yp?)0yuf6VxuvWNKbJcDxV zGN>8s6s`1N01-$zxDo&Cbb}QLupbWAAb{ltt9uYP9T~=~g_aZ3uEAM_^1eXQEyn9` z4B2LS`coNzafM7qlBcp%3Uwjgekwm+*A|ug7WPx6E`MhCRAszQo+;s{^HhfwryBtK zsV@Ahb<$Hk2*OxZ?IND)mk5%ea3M)FWYGhU{nS{zp&>~Z7+j40eS6%y_3#fJjFMgQ zKMWzLEBGHK+!W?O=^v(D6dS~h+y5{Rv_7bQCX*yBk`WmhnrE^-yg%(Tx$y=#$%0JJ z6j*WU#n+nR{`3rd|ueYnE;S*I2-@!fN{9Y!aT_K8LpD4 zV7QyR1GnW6@$+NAY)+NZR$+(VhU(|zh>-n@?$SS>0Rp>l4US~^<4x_2Iq; z3JnAwy!MOv2I7SL;xPjS*R2ZzF^T9h`SvE=WWn6E5>;YoHC$!j+iqvdBL*xi0V7nq1Pa2mVxL9G_xa}(3<~ix0EHAkkenmhxyY-A5izoDl_A<)MR(mazDm!$Xtk1ZH6VIm4yM=wviV6LnTXv&XuZ7RMC zF44JEfLp6(bKAdAcisx|bw$yCQ|hMw^8Y^um4?BW*@C~JPqG#+l)fUMTZ}aXr?O1! zAFcTRlLAbYxh$8+ugki;%u{Y}C|p|R^QVcp+5E9Cqa;5+7dQ@4weug9Up+xqxQ!ht zFL(nMBW$gy{U&|zD_>zppE_s|1kj@t_p1QC>h?Lhez9NeGLgZ;LMD9`Jx);vJu4#O zCk-C8qutx!$`kftwJoM#UV^+JuCOQ2;V9m#i*C|CR!Ql+@M&#nN-+6}3^)1ta^9Rw z;`9lYbw0}{SA;zJs>Lvw^t$(n|Gf^ECXtti5^W{6L08iA7j!EhX)?V}%ICI7q1#n& zmM@-EFpTFJ5F1>GH@aD9;;k5lRQd9Pz7o10F#4X{DLmnRk%IXG^tNJ?a>DI=f)9Q< z7*tLNTE0MAX>WEt(QC3^FOm!xFeo4Ki4g;{U!9mxkX{g+Scq$PsrGch&~XTy&Q%c% zzm~(W&l2G^cceEp!?)F;;esnIbsY3sv0?T_GQdZVZ6ZT4jGHnEyykuz>p0ZBcF-hP zFQ8kds|0k*^hE)W8e)8xE6fFIv#KRg-;L4$zINOs%w3xc_WPbgS1Ew zVVvM75KYFLS*F)BK+Uqho@J6j(B0zLDHx({bY5^rDp(iBsjkomE!pY5o(H`t9%$k6 z=Z$u_bmM;?{Q}`CGzw2}5@>W_eFNi-8GyTd3(Yr93ky;%;*KmbkYvBzFX;9D>tDY; zrf}Fm`7VY1_PE6!fMu&%6M)lir^EvP-!gUA0P4+xc+zNF-t5(QSJ?))xyI<{&4GB5 zBQBP^uttLqTeM>C)oTUC%}qV5ual`l?0CeD5I?v#k1pdU2XRI<@#gT#@oFb09F8xe zP#ZRhoQNmc0p6U}lKI4-DU;C5En`5}7xtSAD$SJy-dbfr4-#%ckM^87*>7bElJNxy z;s5Ot!SKs}J0!uqaOF!VVPUt)^8tbS)Yg*`LkQx3E=!@zc3`eo!DKZzpySlF!MWoA z^_{%A35)(Ql$!#3Zh?Sjsrb$+!r<^uriqXa_fCvp3*3y$j^&+k6HC%59Vd(McV-DC zc>uj;4bK$cS+wM(cNthI+^I}~#XdmbJb`z)+qzTxf$%@KXP+7%h9|V>jZ$x?Mg+6u zVD8iuvFZjw+SP|svxs2c^Z3WusWrXtCJ449Bhds!eYZnm8S1hUxlw+8@Ag=UeEuJ? z#8Ca+V^)GaL(cTzzkKudQe~rjrr+`$)Z1qulHRzT8Ilk-?yX6zpTYFK>_qwY&BElpT!}Qy z-z%`ZS77Y-iY%O@?16m`6AdTmkcWNjz2gYhHYItuGhd*>3>G2C9zGvKK#yhf-6{<9 z`&HWV^ZiLlL)4-;i{b@6zfs`_H6VbVU!O31Kzh`hkQl5*BCdv|#qZlrU5M z5$XurkV@LyhvHr#u@+1OB5KxMit3CR{M!{9`BS#??iWM_Y7qw6(7~jLzs#X`OfH##d zMklLO0!2b|GmQE`kywrViWVjkn70x5=!n#l+RXXf)W9iCnv)taN?;{_ zgp}+;ENU595;v`I$z3vseuU~XHb`eP-F&$yIGgQ){N&H7vQsLKC1)!%pLJBG7-i1c z1hI0Z`fLX|%lLT~f@1|B9whB^If7?_&gC-)nD3}t5a(2NGKW%QF@BB}D(bFtstTE` z9XM?_b?zWpG<|_j64>YZ84+Hud;Gb$wEe!*m9e1ksVTZfpk(IA%h!WB4aE| zn8#w)|8_zS>|}9uur}17at&GuR?T9bl|C6SZcK#3JVRaVKtxpR^A@{Evq3&m#`FP9 z;(CYbmW$Iq4%)q{{rgo!g828VCGB42s?q*^4nQ~@t>eKAqxWmrXd!=pP$L-Gi?A}3 z`TYQbL>` z7wUGfqRVDZ|uwzAtfyzxfyJMv+vD0SEeq{vXSW`fmTMo|0_!K~j z2m89BosW$YgS(QcINX^vx#&rvw-s-35pzU%KFFPqEfBFY&26}I!79|K+*x%l$YeZj zNMKd(Tu?}$n0G9rb%x~yC6v*1sOVf!L0Gn3&IL6RrnQT6K@3HJ`)RbObAc2jG;Kv5&KMk6*7Uxe>pioyroIfRX zwYb=E{&bGvI?VZ`Ul4jV**JC{xD!Q=hw#>vf(O8j zM?H=`qGA|?kV#BfFv?0nD?rRF$h5e6DtDY5;B?MTk>pWVp`P?`oMFIeeqkNwxF$E1 z?jRSg{v3zQF(o+8JSwMJ+kiR&RvGi;4$TQLH=6R3FlEplO0C0rxoF#=Q7pV&wY4(?^jbv{uH zP}c}s?h~wVDKUW_5d)!5B44OMRhRi>wi1fVu+geDWwFH!uZDcQpgk2ox}Y+DrU70-s`8F&;RdLViX@%vvzEW`9)Q!KZTR zXo*CHnke3aWxDgJl7x6ZcRp1CJVjcM)er^#6a;1o;rfHe^v*Z4ir2=%O{iK2IfLdKSpE{<}u(>`pLV+~hgk~-Ipn$wVE+v|`68feLl3*|3EvKE# z>_o!sdz{SN1V6V-td(2h_2H1%xjUIf*b3ud*vaf;zyL#BU!->NW62x^60cM!$8k>9 z2$KV!H6t`7xIQVJ>oXo-xSZy|@|irOluKU(BqL+g<9wzEY$(rX`Vk1>aRXEU!9n4w zEqpxYv!LP_sI)20XBIV_=C0ZKY!GN#ZrEPZ8Vn_&P8PaQdp5FmME6w#hBxojNu7{*;x?I-iWY#ZA!Q0 zWLJ?8SC3ev?4tnK`}9b0F@@wwFyby|sTjvFdq7()-xF{y-Y=%8TX907wXVYDjk zS)7aKgak$bye#8fjEYmn4bCOV0Cg?j)g`C|(I$fA5|kfj$qZF$tdioAkYZIQR#eU< z2@lks#y!=!(rP=GbbtnD)Xe%4)fDaUGjPT;pDNaiX&kE}Vc%7C*5lEO)%C_0@r zr2z0jQ=T=bVR?1KS%b<&6GH%<1hosxJf)m+)}Rp587R#fR2XXyJ4*q30M^wqq937p z+>MiOY0WXz0<2BM{>@o4V)1CwSu>GHwyV%Ibn2}km=if`=2Q@K4)?{xEGUeNxNMb` zaMz5NWhS_Lb1o}Lh|~R$8B8uKN@!pEj4e&zU33Q86De<%cUdPPewU2uP0+)=Tp?6X zJQ6vOND*Lg#EXZKund=%%_UL@Blhx)1pQ=h#JkjB~{}dYfKwUNJ>- zB4>fb|5X8*sLxoUwR)s{MbT|f}-y%J|#kO(pNaMl$tY;0SdbtMG#T^46u)t&4e z>k=03y@lixT6d5^>Va4T>xKwPo3EQ=P+u`|@-p!}q^!jA3M3>InO8&_q{}O1KrE^W zML;4WP+kgn+}V~7KJSP{UtLb#uthIjPTpy&r5y26&FgboboW@FZ@J&V`YOF9`%*4& z+z4EKkQmnM)yILNHqa>mu6YlqFuiSd{-Pa2H#TnYpB8JV#wR8Lkp2ZpX`M$Uo%0t* zm{5&cf3e6IAU6gXP+Ll8BhCRyuZ&Bajr$d-%_J$t#vYBr0fRbtB9e@ejCNKEsa&FY z21U|cHcr8yx&p>?Z1#<_I*pvWIUDEMC>$%U(e)wy{h9#%MRRF)&1%q7_%e=R=&a`3 zxF%;w1c~!CZYx%=eBI6^E?g2p;u7E}ebU`VT!VVR0LuEgCZb}c2V64%Da8!fxrXwK zhSAxS$40u!>|!<*35X@IZsJX)%#^jasZudRdvI;Mi5BMk#|)BQfA~6JU-E?eu95B+OHjS(phdN=xF+_?d2xrrzR11+aDuuM`rUe2L{L27? z>`e;HHC2H$e_5bA+e7nZW{fr&e^?7v@` z!;oNnZaCLwVE)2^8zQdF!n%$BxtIm@nKr><((_Rk0_|Wc_j#P_3i!ZOTeuVlWr*2w z6rkJ~cD9VF7-A>EOTAy~6bCpKp%0-a@sr-V(S!MEZ><8YYtQd&-49UuIrsVQ^A66| zK8Qf_5haS*g>PGhiCaxq+loxmG<~(RZ460ZjmK)(j)GHs-1XPaGMw#$s%FGzI!Pcr zY6`0_0*l~@BM9aFz$pn5RJXnnyCVnSZru^CUyX_s=T6S`G2r!mROhRZI8o|)HE~MG zve@|5adzel=sx-ewmU;Wl}E5bDM5!Iq8o_ae0Eo@Qg#mW-6{i2BT^L5pu8cQWp$sv zac;mD?`_>~0Ap5`Y7JKB4W|{xRoVl$3oS+}s7hqC*#!v+b0OjFgLYx7Bv?18{$h94 zsCw8+b6Rcc?Ce5~=z+1!LJ&_9v3kqqRC8dJp)P$pH==f%55aJYIvzoq z8zByxB)ySuJjgnuD>-`K_D(CD8&UmgzPoW=31+&^ZuEF~XM|2rYjk!Ot0HaJ4_Y|8 zQG4hLYM|MjQptn7)dAN{7)c?`?rs+whLRlLFSaYh_pzIs=Wm?dM9(uEqeO1EFu0?dYlW;OD@OhN$ZMSAjI7M{(Bfu2 zb^c;~iRG%8^{RzedYp=RI>1xv%bU=LB+RelCiGX1PWcSuBV?E(%}qHiVW~8<6<*}w z$$n|HdCyhkep9}$ItUkPaX9FNaXN=(-ag=TO;^kFt(ZWynWwOrmet5j=)%Z=8UnM^ zz8TW7McF@Yh7hbZhHpVr%BXoumFLUPxn(~Z5Vjg5KqnSoRL(8^U;zg*GHBg0tO_MO zj$iqZ&4J*F{O zfXO!N){$k+o zgi+%Z_peZ&v3;tUw=E*Ze3KNW3i+Y4=)9_`lsFKo-0wB@tm8v#19z%glDIAB%=61BQiy%Cpq+x!y zk85ENzGD>&5tlS~WMU`Ihwj9t+qokf9R=@MD3=h<9l5&fWPe8?l0i`O*$A!#2wDL1 z(3Lc(05&~z4ASB6KmubA@7!@vi7(Z9#}PC=Q=sfxhk}3^agRh%yg(`e17tUR2Q@E)VE$; z#xz_=DeGpXI^zzo8pYGE0y?;x6kdBHg$(W&lYQAFEP-6ug!hN4Ty z5aIE0t%uTr+|kpx6qMdmJ!WcBDzbVKIm6P5WGK57L1`jtP5X7R~^;6)4r-0cE4>>%C56 znU&;Z*;r*IH|rIi5Jv#IO8^oa1Y)=990ZSA%5$s`4_nDC>bj%TIBCI6EGcHJB$jFJ z@k8V3Bv#HY7ztQO(H=x{@z0$=qyT}d87M;FMraAjaN?+xNs-c|D-0HvDY(Vijg5_2 zO++eJj3%#;F9wg9(4kIR%EZd?Oxj`b7=h#AN?CTT5Xn?ME`Fu#`d5l&vOz0}8wg67 z8yT{ci6A3Jlj26wi2~Oa-qp<6X^UE9MmvbwCW8$gu{E_3?IpSby^aeyWGx*$I$s+{A~mFZZA#_Nrrm>FsmmKmMHF?E(4>`kHM6ERU%vwoaE54~YiqVp(<_Rm(7~(JrlXWad$QarvA-qye zZ3k}hGdc6ai%0TmHiLu2(!|G!4GDp7-5r}#NsJ~Xwt#fXi3yg%e5771}|1#stT zY)D$!40jf&)KHnIgGk_7+JWQ$F;H#6vpeX3-m|MtGMD>19-!*|RoRHbe#5l#!xZR-l1aTxV*g!3Drswn@e`A_9<0$vaP~gn=``%k>e_;H*CNoKlIZK~T-a{IeGoW( z9g<>gE1S`;v&x8rj8fGdkz_c5Q%#Ye;}|61tkZ$sM)%832dXP}H3O`rYP{0HU5o#0 zvSS7jt+4ojxjD9Y&)I1JA?*zQTXtvb9Wa&G!%n9N>X(ib$7q&7Bn)(eO{i>s`2%&N0CCC5B&AG zP9h7XZ)Br2*aO){-`HrHhGWP#P(s!T`^GnFbRt>R?hgQJSdRrUu0IHy{YYsrW{0%D zSf$~eH?Y``b|*WCN{;(cCiwWn=OR!qBH0l8(fmptSvl^Xm7U@Kc{Ow>qgCe~OBaVp z??DOFS?@i$*hEnBdyq38L0|}SD^C>8Juy@cQSC%2vG3{B9}e*pLAn4v5IXk^dRdAn z_Y8^ZP_jgIN>S)P!MSJLO7eYF=bkAGzWZBJ+A!gs1s9U5#m+agJ>B>>i+GntN%74A z5Vp$f@XZlf0C!gTZrYTqneaL&JlOi32``RdhX*Q~tj;cAq%u2uB#u=5A`3%<65?xu zgpeO37Cn0BnBqkABs2#N((;{HyeU0$=V|@QmD8OqA&!;ZLr^QQrn^UhgPIVBCi?wD zr+X48M$M}z1phXZ%;cc%Z}VXL3Dm*m~Z{b{_5_z+vLyeunr} zK0HX%QJCi$H>=temh&(qN{b*dgrkQZGd4avt6;Tycz6*h+^3kFM<9^@**E8rEX1=< zJQ9>-(FU%A9w`LYHR5=rk~AI|lNvJlJ+hymIFfK4>0@okZ1%_z@N=#Hhc2D9qLZv78y%=XdoHWYs*7e4`c7= z*7Kp!B)m{?;5alcA?eA7@F6zW;yaP;+M!tkQ2gHPBpjC}WZ}@8YbE&w_ZB8$)>Ute zm!0n%rC}Ta`DOH zB##Uk-D}}sx5?u&n1r4~o`G?m97d7 zQ97Xi(V^(MOrk6X2l&#ev=R@7om%>1BW4DFBosX^NS@SLt~crRs4w zTj=y2)JuNjHwahDjPGKtC;O6Sl9Y1`2} zp@Bvb^K2?EF3wpcqeX((dNd+bjSC?`l{a4(#}Sr3Zy$wtwKBzzqNQBlPxP>E9->q) zYdiml8u!PS%K*W>2iGK~H~eE_3Dweg-9EC!LN3~wpd7;dV^?}wW!uxD;`;n?qTa_% z*9sMf4uGXA7b5?p>PFuQR%HH!UI+Ro)E3sL`iiH%OMf2HQo+~bh6J;y6bNffPB{NG zui~Kc1N5s*KZkI92ktbPn)#PvqelLhG70frP_^azmt%feJQ>GS&(@{!vo`%@Y|M}4 zI=>kTmEhJm59Bs&(pxk3jsCExTgsN%gO} zLR<}ZNZ|XgD3(``#x2Jc%<^AVU+|pEIRC0zpUg4oxL?x0N&}jY7Of49LGoE6(=0WZWa%1>Q7)i29ZOesTpq< zzH&#xSCa8gK|`--c2nacegSCc#-?HQj8FMv&{VvY=8Vt!v8FDh8kE4Q!|BTKpNu_g z`BTa(SMoNl^Q@|MPQu9G*)Ab758wOgCj1Qi;k0a~C8iatrxx{eE}6~=5@WD&wFTsJ z8G=k3+5McJL)Y;}l>dMh-;77Qq+On?@<(zlDsPWE&qe(BFkX=0xW+s9tm)@c5~~Mv zZ!GpY*mJ6?mVFBtwrBz(F2#MH*mFHAGdv%8KZb$CuI8JX<+&=eOLz_+VA|L59KKvV z?RR34xdCIv=ZIkqpiCl&C?vA3s6N+AU9q~nD$V-GTX(}WnZN@=n z>9dW_M2!-`_qGNkQn|5KC-99>#HG>+)<>qkAOFzii&S6HvU=BdW}S&~;ieP2*eQIv zu=qCjS)NB7KoY)=WNzC!&lmVpVhxmv$XEBgssPT7D8utAf6X5sf7(d;{D_~2H|8!S z8}pF`3(rq?TIkI8sE3;87X{1ZT$(lA3z>rF?gz>TYIh*-3ps*Jb7<$huu+h@5Wa5u zLP#P^hW?m@#4M|KEz=7fevUGCdt>7ZUFnh6MSTP33+l_zvbc|T8@~7u&`>(oo!f)b zlV8B+;6<9@gHN%rx4n?o7JRz4Hl~i0bZXTI(w!S{7J>I$+=fu^DjON_k$Kr{#hurv zs19G4LAQjlmOk-emS`_;hLGO#VzxhV#jRyqDcg&xPw8U$9Qp7@yz`=J1szN6PHl^s z8D2y?toUTL^CFtS%iJ63UhEYKYT*e^R0-Vtyr^nUp44D*h(dL7Y{3UBgQU{7yvQ;N zwi)&zBug)%Oy)1D4!P{RMlHg~2;UgGqBPiKhQBhDCK;M9ZzN*rC$s!S%XtLB52jn? zC@hOInWtdP#++BR@^G>SSbndQDL*&eH6~FdURA-}kCJX`304X>IqPQtT9FYYPGdmi zOKFX|m3L-$!khxi7#d;I)JUi*gr9UfaC4vTbzX|3N0@coODF->Q)m?C(dCzhWi}n- zrBR7l_JR7B6)&arIS;odL@221H7<;G_%;tXkfPB7IE3^yqxPcpi6-dfD|Yn%KY+v^g*1( z*QV$V-g&uC1zlovTy%wUD1bya|FSfrf;WKvH|Q|&7Thp4y6)dpov&s z{086KAE^jGWrtAe;`<}eW?pAeV;IVwRNusJdX~qcWu!;`rr*zUhd!ZY`}`(t=up8~NxrwY@_cka@nr12~fBCOomWv1}W`C33Z z%W6u|1lC#6ioH`b2Oie@INAn&-Z0vsBD452;XNl zH4IjG2uVz^r;hvi(uI_?_bUheXxDV{m0qA_W&g^6pFr)6UqKstO`B}3!%|Z1d|pXw zbk)1k;!jIT=oX>jgZ;BUq10D7UtP5VUzylm%|wjaD!-bIpj6eXxd^E}@~Z{-(#73` z^C}v!rCtmWURA9J19dqGdbP%16w_?4&SS_B-R=oXw$Ritod_V2D1T2>5~;MAC(y#8 zgFS)jflFJZO+JAd+9z7{6GwrDX`RxdpO_;xd(kwc*JIFh9;M+a-}FYmG&}ck#aRxr zq_oR)u}Y#3e5T9%HKXdaY~R*hinhuhi9yS28*ke&9T9v4qb^5d3Xl@a3jOInazc{k zmIQ7}Hf>_BV;`N~e?Fcv`m@%W8`C=JG&-OsuR4%$4_<^N>e?d^Hr3UQ&8^k-?d_X3 zRYTPc9XHgg@p{fMl44L&;L%JfQ>KSllMIadE4&pm`qdlM$TmIekI_^8H2Q`2>EDDC zI*gI!(!QHEZN*p4tX@NxfpGEzV`^seS^&*nAK@F!gjP%3vdL9v@>-4%)3Hpsocl3J zKB}o+G<&ZV`ei`zU=7E9vT4&UImuKf(XXM$vxba%(#-#_vHMf&tL(R4Ll3|;eCD89 z-c{SMkG|Hen1~Kd5Pj^v>ful4wMoc?xw4V^#@FTmVEKyR$&DgEtc65nezFuX>hA5y zcHzg>3c0zBTN@r?SDK^O^Y9@i*6a1k>)5tHUxZq1OPO#qKbcgid->A zF$uazv8c6Pp9dRO!%T+cq*uW+Spp$BdN@lwldIZ}!2%WJ!N&{)Z&hwRW+1iKv$1E8 zuX)B_0Eo!pXr>bk)M>|zzn!3Y*p1oehPZ!wGJ}Q#u^O^wP*mxl6iaRFW>{b}pB#nF zpuk)(F%uTdC@%rOVfwcFD7y1Tj*pwFDH7)U%i%69y}M7OK~MI|%1`Hw5@aX#U2jx? zl^Ql#*f(l~bm=FsL4&SQKvt~7DD9Bqi8o_YNL_&WL_-z)4Q*d=%D=fie zE_*u*S-2-PZwD2B-=&Q(tG=$=9Im&C*C^_^8(glg?Q-gzez zIq4zloos|*rbEJfR(FH)kV&{0u)Oi*yi;a)G`Y`1IPakLRg(#0{c42sP6B9(+^td#Bw8V0Qt>?>_Vi(L3pDF=LyP|hanMzh;$tl#b^bR3JB`2iz*ga3NzMoSNlvms3OE@)zrsAc0Wf^{Il&#+y(>z`&6zG&m0v99v!$OB4St&$~Cxi=D5m&qqaU^J~M%wM3QL+aLv70 z-2OXf=B?yi;P4*)*nQsXvr_BWq24=UiRHk1!&XWnj;A)za^by+)CLY??@e2{ppSD) z8CTw$vy4sR?<~uhhyE_l?~Km*-BAm-b=36wyHWF&n=_vY!vt`gFNTLKc_qi0FB3yI zBC9OiJ7%HhBbdHWWLDgKN`)EhPr)JjF5}t~nD1OK!sc^|}{DaZT6 zM7yKm`;&^P-u)SM!25FwZC>|t-d|vj6ypQrM3JONebB3u^QcXYI3ElsUo;;aMGEz? zd@#erObae}^}_iu&q|@kifQkMMJWspbjHjY{;4Y69c~myQN4U^^w26efiP2 z0a)6P=13`JJ)6NGyUE!shKwcD*`PqpSc{5&g~`t53CH*};gz1Wf zOxe8=F7v@y;gq!)M;f&;wMZ_k0AFJH;lGI-6yasp04&IOnj`JGF6i1i z)I^K{{JB9U#KKm+9q*hQVdG14pBp0&3U+RiND0lji3OC7^~DsjDR<2b7aCuR0+(el zh{(&bk(}h014H#^;Brt!sr(7#>}OfXI;Rh;Rem`mpu?`oojd|Lb0QaW$e{=#%zw@U z8CMp8|6GX>hNQq1S;EeH_akt{Q7Id9y<%A9zHDy}aASMIme7B_I^K@^6)Xsuvq z3>sJ)z*oq6SzDA+yS%{KQlj|KO<-*$ld_K1h8QBhwXkK7xMRe~Wv9T}5jfjn+=M0S z&A{4erBw`EHGqIJxC>l$9O1H?X$%~=YL0mE079l$EfB2dy-q;u0;wiAUSVi8@M75) zSeL`p3Y(80hTXur5CS`rGA0GqbqP?h7xQyqT@L^Z1c7z^c%fUmz`8-8F#Zxbf|uQC zO&(Y`2Bey?D95@wOF5Kw&#PjL{A)P}nJ< zG`9(XFK4FWUk&rnB=F@NiT6G;X8Glff`pqe0x*cviv)eFbdHLOF14ekyK!_5`jiR`gJZ$f$8`je^aSi-BvA6c?wl$;b9h z#@fKOltC`-fc3R~kO8BFSg!`IJ))9taFtRd8J0rmC1K#&;~Z@{pa-s^RG=tBsfPkZ1)@+46cwf7tox!WVJx40Q8&`#QE>QqVhp5Wa~5fN z>eW@aK+!QJAFjfZ~{e;&ER)qN^$YCsd$JgjX=?&M*(m%#nkTv1~#Ws zaVl+z-!FKEdQ$L3C|}Lyev6w9mVEOdx8f=IZso&YwJ{mMSv#ADpdL}wqnOx)b`q(K zU0PsEhnep{U7Sh9jC9j&t5guKguH7cAlZhCJR}hXyEdL68f+9=b*F8;+>9_{fD!Pf zE)Q!3wihW7_x44q?WGFlRtD7DD+OdIMklb+0NcAM6$9H@5vmiF1jvFFR;-@!IfEvI+hfgM5Je6lPK?0~Sc3k&Q(erjaiVOm&~dIxG#EpT%2{%s?V z;N?k;z>az0&N_o^*IO)#Oq186a#RWmbv-Ibr&qdemHK*CQ%GE?%D8pC)Rb9V2d+nT zg~MNvQO8(w@(y$0`iK`nFadx-!GBk7e`SaR0#NlRdBDs98?rMATVB{#j6ww zb5vo_q6!}V|7iOXuq~&q?VCurMnjU2DItUqLMS2>Dk4Lav61R2W6C^JDq|sJ<`pt! z3L)MigpeWg{ATv@pX)r=zOMUup7Qzr+QYSnwbovH?TP-QaKXWeLd>iT zffh+h+iR{lrDg18)_SM3y}p9m%JU0(qw_NGS_gJ+UKujf7Asig&aGf)v}K8?^AUDY z1pBOWKXV#xxH;4ZoyVHnTC+2FmXY~6qCNb^hUV@!)ZVTy1|O}I zMctmPjYiCFbHiexc|Kz}T;0#Y^@27QI+u4};F)7M_FnA%mDv`e9##zdtcQf&>=8M> zyw)mg4~}{?uOFtRji^Vf`az+Dm@h>=+9DiQDYi_H4nrZ4akIGH-K~qXW@4FsvSfBe9r?M+c&~I!+uNILNbQsSiYJBc2)3eIHeH;LM=|jJ|-t=*k4?T4!KOoUGN;_iF*dc>X18!4syNbkS7rVsSlZ@i1w93=F#n4 zamZH+VM`tI3q2x28zaOraDsLxn)Tef|s2rKok&s5x_%0aBpla-;gfme&tKC>#rOfvVG zR~crKxzD1?unvBATGY3ZyF(lGZB`l9Wl&ed!vnr(Ogq^W_1!y60Qx=&SDk|!QGdG_ zYbbT6{*&O`hx5(;cbb#a`u@|vi&lpIGvKg7^q3DsJklBlp-lcTK{Tk1xuu^DYLC>%c_$7+>&U~bF0+gW`V+0u;0{QI3#x3y z#D@lVMQ9JhSlq#=DV(A02cy1tW`cw^_*4d2>kpp5{4vco&t&(IKL(?c+>~e`*0#R* z5e=TLX!^{2|nNxEI!xq7z#VGv)onb`@xD z4D95q!F!hbprR9}IgnRJ&pfh?jaJQJe>kGKtJ;RF$pX@%*=C)nrkSH`8!R?QaQ|~u)6%g= z*$%em<({*srj3VaCTp9`qMA;Q3u6Y6-GF3k2J)*pR?(^#7o(aXo)+ZO+g=o8+L4Y7 zx*U-gIkNfDh^E4a?rrWtuo9d&f{{ZnmzaBPZXms|1|3Pa(d+Q8o>+D5$dfa+x*rXP z{mKsLwA%wuSE*Tt4|kL+PQ%Y~zinQKhF|7Bdk7;MeyxASH0I$`6vQu1^=PJgFy>6e z`b*Efrk?iYRN7N@ys)2*l`AC05^ow{SmY2gjIfzT`c4)_nP~cB1g;Uw67|| zOyxN3mx}FHgX{EW!ze*cpHLZQLihB^m0`FAAv*oZO3h{`ZbsCsO3iMVNE-K?KCi~F ze2z|ERH>2q>5QyWLsQ2YtpM#iXIxgpYapXDCPNLdDUo4EcCE1!%hAYQ7Ro_(+EV|_KD8yBUbv!~z^E0*Bw`3%NK&KYhg zu%{31bLSGrccfuW!s22oyx0#Rv#l6+q(!ip7u9fYTXg9WhT*=m=<<(|69TVjYqzcqtg%MB zqJxDCJxFN7&WDr1ztr&ByG^0d8H0^k#-hWvXI(f3oI8BAD585-M!@dA5{ZACA>IJP}pTx}VP%z0}?G%hD8bXjXOu4|3$qe8CZ`uQDu(YWD?!7&0M<5#gP zWVaaK+`@QmVKly#@YeC;4`P~=w9+tsEJIZK@srGBai&&kY_)0p?8@*B49>3%x8?h2 z{AZQno6@nUGJNwbTDJynLZvc%yX{)H-L-Xx-MgDVstotroTCX%D#QD5gHkkM{mO92 ze~ZwzGW=-&nYTm5x24z>P=@I0`(L67z38$JUe%mV`@mHl=-kqr$I^L#IWMBql5MAA9gk6XO?A5DO zMsNVSy7`E{C)qG~b*~Yyo*6w~J-jkvAlBNWtIqv$5z4Hf#jW8tp~KGnPy?=m>L(={2c zUFn(zSKaOC7Izl#od(uu**Usyfkoq*WIrgU#oFd|i-7MkXg8d5fVG;^;rd2I!N9bS zE^>{oZwAZ(+Glf67YVfMTLZT%hNh#AWw|vvU*7>(8t$r*2LXxe*I~j%tm=S%2-t04 zzkaypqOa#)9Xt}jod$x0s*z*u3#I^}TS+q4PcaPH==#Ut^jg|>#iE+m&qjb@dQc}S z@gD;(Q(D>H*Z*S3A$2M|F(S5Jl_xeQzHX%_wjsK1@h5fyx&y9Y_UX~YUhsR@qjBuS zH9Bu12>?bW=x=t`*HA+cks2ko?g34lHIVncMY#xGDe&f-U_K-FiAF48+@E-F@KisO z7)`X6LnDTZT%w6H4S{)w?|g|S&IO{o*+D|l7gX%GR3-cBd%&gZxEoZGV-5punM!)V zbqr5$ez}OJFr|rq`mn&4?go|kzaxpyHo1&2Uwvbb_jh4SRq{3WdhNT02Psdp&fvnkzav-t`eFy6zKuEc*{N_T!+nP2kyRUW=nB`wN^x@`Aj zkuE*s0lKpRs};D#=C!b4kyldXj&Itkz-JG<1NSoc<9owDcRbqQvzc_KZ9j9|-}OmU ziJsnv@#4m6ySQr$`HvVQ`1PxV>88yEXI(D%?lpwj$?CW4j7RCur$F6D8|IHFACP$^ z`s-fe;_Oqw-nrn^zXZQ|TJWz;2$PGJBTQeBKRfI zmZ^w7tdG{HL^pJ1nrP7vgzGwXX9(V~zu@EIne=(glaPP5&a#4sb`d=80Ku~-3Eq9R;5+LR=4)DCHLB#M zFIm6#Q+e}~F{rb>L0_Q_RHB@?&tBe)Fuys-EcB<>F*!u?mwjKAZ+e~hrBZ3Q#B!&Xs-HvL>~zU2w)wFC zdbvP)%2@+$@=$j0xjkvr6>-nGBCUZUVSWCEi^Ac&oGIKmBQj z$D{5Rd|9$5o^y%(bN(Pq8k=ldrjj(1j7~WIHmoEwH4dkZ<}zNI-z<1=W5L^`ccizw zJYKej_^i_jf_ok)I4L2_+ukX-qsel}75})&1@V~nP{gq1NO7yApmUzdTh>Ooz zQE<*|!B>wZEWR~uf&9~-B1{vFx#_Bs+37*egul&b24(tJ8^PZs2eW-=(4S$Q+QPGO zk|UX^W#$iMzw{OQ^SL_+e)c-t@)5U%}y|*Lr+45_6Ss+hG9A3Dq@%h5R1wOwb|6jSYiLZKm@W<9C)1ANH z>Thw;yeSNi&wAG5f&Z4?0B)m)+U`&f!!O?5ppq`P3G)fzS(hL~P^LQVWqliXFIn5Z zZ!`Zs*lKx)k~5iQYy5Vc z<_6g*E6IPVwG;5Co+CI-{G2^3T`zlBe4ov9zJ1{q#e4Y;!n~=5g2N%+xOdcgT)%(Adm)rHL z{PlYgE*j5QRv6pK^_@xux{uE%3*E}+m8t7kSuwwCSc%7t=l9}kW(ayY(#uqi?8rZe z&tF!#?OR#98se-R(SsxD&eq*faQef9`QZ%-Eq>ZSG(z`}uLE!67W(tB2Z}hQ8}fQZ z=Y?&yWO&x%J&%WRrnAQNe3jKp+^9Kp=MOe_9P*y3c-BAhwUX`W%lj1Jr4EAjTH#gV zT$9C{jI^0KuxXr%eegp~@)wwA`!xPPX&kBN?0AL?_~H;`pBoPVaP9rD#)^E_(n zdZldu?evt}7 z4yAi!LkH7u-!1zAgVOlhAAbb~&vn$M&Ieqy+_dFuUN&waIIl;xLnQ~czhQ;T$^J`bL9xg6S} zq#>vOrG}_Hhi*lfulIYI&lmqK-1(?I-QB35vG@+vA--d0hJ|`0Q*M;s={VbFclz@l zCwLy9gXKhr#eD3_Rt&42kHvd;^Z3vWit(it>?S$zn43QTz2J9W5XQ8RfcKk>mVfmQ zf=8|)c#P3cm7Y1`MflN1^ZGaxpT+auq(52B@fUZ`#)8R*gtFA8C@)|&-J4)Y8Z~ja8kF9NhU)Y~8+sxXpK_%PE z$H4AB1|B>^_`^>T9A$ihcw?^sgxt94a=|$kzdK*#?F$W4_frt3levtp8y9q0m zCKv~Y(p`*)vqZPi7glGqSr``|6z|86Ei3$cYZE37&l2puvEZ;=>y}0|5>srYqKi-*{F{N|MNUyzRpF0Cmbm__%gw#RBjvd;vxE0@~h$oe#)0S zmT}p)J(gFxbq6{QeD~h_g*%HrEZrZN+;50KXzz|sh>xF@u9NPc6!B`=4mf{ogfNU1 zuUbDxbSJHPczn=T9bKqy+<184Jxz2u1@S_#bo$pftc8&=Z&jNTzX z{&O&4M!HpA!uhu^(>Q4P1bz>E&Hi!TuFK0-zUW(%aSiwnI!W@-)9|C-Q*uBr@1v98 z295vxH6iP;zRDY)^rGWH3rk#E!MARE*W;moKNPJe-9!grT_~9+naj2tznRCc9$Qxg zjTq0=r4{HZ&#wVIY)q?~E{L(I@1^voi+(4}cDqsVa+5s`E21gz(3$(dFM5wR*&S}w zvx(%Bl_T$DbfC5_-O$Cq`3`t|XVq^Ro{xVGuwg~EChLFnhsP1l{5_L zjGL7CF-&w+#;Z>AH|}Db2Y=06h;NCegHDxI*}+R5K^fk*u?KBC!sIAu;6rOWFYA`4 z!0qLs+u8)W>Kpe0f~FVUMVM^nvUH@{G;f&^Z}rWp?7XELeK&A@4NmgR*m-G(!vyI_NMRbq8+|6jZQ6(e&!%vwCKKS_v z;Nkyy0w84O79Y|tzEFRw&f*g`~R!B91}$+vj5mP3fe2|Lg0nB_62T*s<{v3 z;{nSty~QovpohWt1CKU)??}S1R-AU-N&c=w2(#N>CbYQezmE~Fn#R`e=;0{KH5(M} zw6n%D`)>5|agK*hJgF7k(X-1E)*IXQ+lcru#$~P5_PMW*S$=u{lRZDwBiPS_-TbCs z5eE8mJ9&EdpNyOBD_zg(AzL^4g*IEYe>oRGJqp_cXk)CkKXloTj2569?(`BMWZHX1 z`_>Z#sZ{SQL-W#tGXv|N=Hn;l3tZAy4BOPu0%IWjzy1MMO-xd6u~*tN#a#@Ri4dE z9w6^-8oS~_N6Y`A@hR{>SsS5lORp}tVo$;38NvK`!BD1K|1JN$PYS*(`IRnx2L0*U zT?Ds%S8#ME!D}8DyzVi`Ac!n4(URrJt?BxMAL>`6pxr=bw;|VeiOECNFI)LmAH8(A`HAx@vU)%EU$Y zA1wI5=Ylh0Kba)|Jww+MS{Il{^SVLRUpeorh;QO5F9r{@ajzP=AQ-swYuP2^9A4cKK;Cp{7wtW zZ;~zPQd<+Bu78~1rlOH_%MtSLe5GKA?t=S_7Chk-!6BZH@A(M(veJ2bF+AH+?T`%; zoo7STAK7VpD}3aef_K&kKBRWZp3yjw%@`>BtO0^f!`Z9SL$cow68;a-ejYhoMRTRR ziFh$@_7vmg&6gAGBA&?mJqJJNbCCEuKe4yMhZ~JTW?p@&;5Fjy{MHZUzx@uuJHHpa zOZ}MNHf3gXgG}@Bnfy}NHNk%^ zuVCEx;-eWi`=tdS=0a!QN4({uIM9haPIB~Vj9bQmykb zu1*qkk!!^7Y0yRHh~84yL9)8KM&C)yHw!vN&>ei7D)=PuL(my+{gCN$r+XXs(k0r! z(a-CN|FSva4~|K`-e76NdP}m`{meJmz%5>0>?guFIZ@+&-v1tbf0*RA#fx4N&oRH> zXEHq9F~{=BiqpnR%yqWpo^iLY0er4A=P zxx7IU9{QhgtMs0HqnkWVT8SI(Nq2mF7r`--y-C*(=ug+yn40b@8J~XeuJGTVL>TP6 z+2NbfpI02Ntg$DbbhPmI>@WDl?S$0r;@{v#I~|%6m+g0+hpkwNW?OvF@;slXa9;}K z?uKsw4_M>6#&e&-AM6sCL%O{o-RmKy&$l=m5M#}p=}gDI9O!kO{v5-S_+i0b;=|+) ziwpYrP2;<@pYk*LhB4$Cjpx}8s!KM{3S1Xi>gQb)}_M#;kpuzuUWq(tJ#>0{#Z}EmAEZD+42|0PqsZ! zFxZE#(3qZ#*Z7i*7riA@HRfw9Kz_b|J$Zj6rT^HJLf_)(DTkw4V>F%Pj z)c59xy#VQn+bRCJ(xpKM;{tbfrhxQ2HoS!0rG#nsl$PU zaYcL(FZ+W0W%UT zd((MW$baEjg@?6w$^fIyPQZhfU-IwF{!#I`pA+SI)xY<8GvVLvDELla!erGe0UJ5( zW|d@ZlX0Lq?nQ%bb8YFVN%LbBe}mH$-ooX`#s|oMjQJ72zxcY?7dh~Jr8~*W3Hd^s z1M(mCll(QNpTmE0W5KD$Bgkjk0zkxn*xCc|iIxtp1w{NAt>u6ID?sRM4f+$G#+L~u z3B$vAkF<-WhmO(Bcon?TZH8djmwC`T@*k%9rAMpZ)5+Ta5BWFwGlk#0wnMc`*yozw z^^x$j2O|DGHS*tQ;+D!D*5)>BFlj{Ifj-f4V{N z*YgB_muyOZ7ky=w&xy~Lo&$*aas#Ey!am#;8Yz6m6BJG!4K_=}?|iGm_xoMp-LIFw zhh$oI;8OA*w5H${&f8-ykbmrkfZ*wC)E?QjYKLs1hu^6ANp{mL#lQJ}!CPJuTre9D z<@iW4Fk9GLc(u{>@9VIjK-Io`BkDY|y<1E2bjea1jE<8y7u($Zq z73AkWR>-QcHvR)%`8*(Ou;WgVpL>v-z$R<_gYdBLdG6Klqg-zqe*nI1bP^SNmGgxy z6@TIFfY!H7E71b=O|f@*l*^h6j90)*&v^__j~y&X+6S-Pe3bkTd3e~f z?0b2$KpUh5w0$jFK--T~n-+VTeUEPTp=dc<6fyto$F&Hx9~*5`wYNEWa6gqHZz0&^ z9>HR7Gk81f`{=!o!j3zckT&$Qjb0!()^+*8{R!Z|@rMJCy&7HzYoGKpqt$90^cf%X zO&>{yt54~EPU8UG8-C;8TM72}7wP_|ds>RUDofg<;(JrFu;--C-jaHIO6u(;Sr)S3 zVwS1ci_bmy;E}Mme1T}p>XKhP%-FU4}7$>=Xcfxef$%NVV=XzT3-LLm4%=a=|-r1YIityA}-gv!6 zG-U4Rm7hFKhaz6w-}(CSBMMv+NpDFGndms^(tApV@jKi1De&2w+ZXP<=C;Bez4ChD zj@NpsboV!zr8>utOa57&Nn|q1+v1Q=Pte38RdHO$wRq{AJsCgqbzaLO?YFJxfj;A! z8)WnIHU=5rV!pJ|2Y}FX!n*bc_RWU)qdjl?4 zu4kCmkfGmjZ5U%fos2zncV9D$hBV30{1wej<0p`@1RXQPo*v6vY)wD zZ1o3iRk_2SK(=|+d@J!e1>;xGo2$-!1shAbcNKl*bLp&w=-uic{ib#(_X?tYZc^J< zD(%ZP+WDhcmuR7QEZ*cR`nAU!dAB)2{x(wtceDOLy-!+J@RU7-AKe}hyf^w;`HS`X zh46!BUi_H&WF`9^=4rwHN8J~F;QK$4)h|`NbvAO?Pw?130i#NCoau5HLk3I!Cxb-~ z$(dFT%J3yuF(O;vjx8@`~%Y&R=^pNTNJ)< z1HrGw580p3zzp8^dJ5B=x?d>am%+Hz%Klt>feX{&UV~{=Gm$siIxPuKf?1Ktt=w;W%ehN=t+I5Zp zUPgX4m)+6J7;tFMs_!YDxaM3uzyo1F9KMiRo|5yO?&*&}x$Hwp0_t=}|Wh%ZA@(y`tM;4iW4gT-&gz|dkVL)p`j5WT; z-2CxzyD&WUweadN?Il86w|o+D(5A(@56b9!p2MDF)@|F9nHRs|_9Ao3UfmpFDAz9Q zFiyVmBtf?WS-g17D*E-a!?nh-Tb!n!vU#G*7Pr?`Dw|iLTc-mL+iaLy`Fcd$Vie=Y ztxglakciTgBQ8GGi5!{eZ4dCAYU=dd=CO zKP<4e$C$93$z+TfVeWSPv%;VIlHiS}2nJi;o2Gjr-H)bkqTM-{gNzHdyRFXz9(=g# z5Qhr|!};CIet{otU29H<^kGhS>${3S{RBZ@uL*OE?B^ed&ugqdF;<-YwESV7Or0Ef z&i#xQaTeEYafQvS-`h+Z`+PRoXOrdsBEA^UPquiV@6);pa^7pS)}Q`xF1E1og!%2~ zHr`ts86Tr=VV-+lPvUFOZxMdYgUm0?Uu|rSUVDdewa$tD3c7~xw=3q@t`}vauTkDU z7tVv-Va!FqTRQ|fgz|Gfj_-2*9OQ=hHoeT~82xjj`Y->`bPc0t(4y}vNuIosxYYNR zWZ!5UH##c94p%>=_YP&;5GTKQF8$h{X8A%6rjqB{yJk4hqvO&#`Gh$2^Fh68#YMep zeaq?x`QmmZes{AYfJ0r0vv9}`o=-+yH`|T=5(l1~b&um9n>;)|tsim88tWJFlM|Mu zJM6ckoO$?14@W=v+#;-3hJEpwpWU(e=>dZfKfxbm-fmM*3pv!=Xh`jroV_aD=}6;A z!(k2Ohh5#hGUhE;(j7OyS}@2O->+ScxvdzUbUs}$l+V{tit}NUHeh%-Cl>D9Dayb3 zY=#%S?`NaJ{TBI)>oMGDDZ1}N<+aiNf-j24@`Io9IFQZ7K7aH}9UiuRi^AT2KO2!> zaRJg=KVmOE*CCsuturLOw{mS)A$WA|N5p<*K{fp)LF!t$sBL`aJ=t~(zPJak`Q z=9RxchJM2pYY0A8(2f<>u(&1#eqHT0#?OA+jxgU#a{_*oXBX5))#n%%@5b4F9~Z-! z#rWOk%ro)5U!k4S)gL21-FhZr7)P@y)>l?X?AQG13cBN6BpZ^g)}%kVOm>NEWv7?T zr9)VG^UXK$^x%`#Ovg}rhQ%xQXPY+;!~|JS>Z%Jhyf??oElr<*@F zo_ScEOB(^)FCS3gLt8UWF&_sX`FYaxS@pMt2OEO9)5#`t)NbMxt0V9n%M1^C59@w! zwrAWj4Dkv*475q!%Y2Rkna;hy)_x%@D&{ZMdxlFMMA`b9-lX!RKN^3V8)Nb$wRyhw zPDOa;@`vH)w^lsAH;nD@)W9NcOnuGx5AEjnCedBA6~4{;KP(RVI*ffT8^fJc;hbl6 z8{{wDTzn_Ax8*aOs}H}QE(mr;KHG(S@EG`~mV8)a#j57xOW zt+cg)es6d{`DH5z-q)Sb`X%4TdH3cc90&W~T}RO!WJfV>hHsH3AcI+d=pkYKyyJCD zSDalS58?cUpRX_PuYxIt~)?(a~y*X$2iE7XEN489-wF9 zj8E#@G-L}1>B9FGXVa+8=byMyf37Ja@4qxhs8n)4PXrqp?XRGF+Fv0HmRXziP3;Q2GYs|&tX@_e;i zQF}FFoOH5{HOQl|je^g-Pf1h9XN*_Zo{(=TSw!Amf?Il=`crPnvV8V$%+t~)_o>Xx zr?>|LGS2T2DDMq`uDabUrpw+qgRmU0m#@TYSeu}YeJ&c#coueOx0@IC=x|Od*ri|B z7{xKEgS9uxaJkww-NWXSR(9~ug#L5~elEwL(jF6V+3Dha<~3>3& z5yWMiUF>0|>t0pFEB3Pa{Z--o4e7mFW>fF8_J$7ei;n@XNq&U;^s@U-V7`TXDeivg zT8VCdonhe)h+zAVerqdykg3a=oCRHn`zeBsedwi(SKL?OcUwqiK-cp#YjN0zQQQY2 z-8%OBEyDdO;jT2vYV6tiWIFOkKH;n#*B&sZ;2tT!L-*kKlhZU0FZKk5wTU~2D4g_- zy{m4!N#?G>e3RGJw_(pvq5H3S7Sp90Y%aLd_JTpi4LC*q0Y3pk2A;i@{C=lII{n}B zKhab0joLJ%F#)o}@BS$0r_LCcox3vAXIFd=2phEbW%e(PSsFWl_d7r{pMzwtpQdyl zyaJe1inC9R4kJF;uEMdXKgAEa*kOmtKWQ2u#;hBM%YWlng43l( z=Fiv2|H4gzt|R2L-;tl|_if;Y4prPM0-NH4n=m|jM*3p>#jEtkKU^gE*GYuQjspY_ zm?L5Aq0gzvFcIl=R;3#3aMZHKw-3b-f2 zXc6Pu);j`%HbJnID9Xxq5Iiz>0F>M>RRgm z>bXpqCs=;Ty2ml!Y>3H!=Yi}P{}%YY82{1!{=LQJU!MO!oB96taQ>IP|KLb{=Wp)G zD(6+$)9rVy23ZvNy0{-B%x%K`rr}Oj-&-8+J5BwL*5XW}-%%CLo`=kAh5 zVgKMc{>GJLlPi!H`uW9!1wa3iFulO^1o3lqpTsr40WTWO&Yc3c$+JHNpObFE_GEgM zEq!M!!&zo~1|yVz#F3@@`7a80-sGIpeXP-w@~PHSO1+?VJB0K8wm&1@Su&~Edv}TH zJfL;oBVEvT7=N9%MW5iCN3DJs-|NzLLDLx515Nwdw3RhZtc@_Hkfyv13i`tL|HeL; z^!&K2?_E6#_mb|QNtfx2IL-rf`}Y>>Hap$d%yV%(6l5CvY4~@=w*%i8J~`)R$D^J; z*9kf%>+IuQI(Ie1!@3>s)>WB;?rm)pY=>Egw-L|FPkW-5znYeONPI`STxpAd zeClAjDC&OT_Jrwa^9i%{o)aAWhv0ix5;Cui1HWRdSj-xGInH3r@pI0WF3hd$dyCsA zlJi`K^&`sT_j6X?yQzGw@36+;<9b1toNuBn<_uPO!+0O&jbVN`{b7bL{+>+mSg`N9 zK40or2wUR)nALp+TNm#)fxh(COZXP%>KmCnL7j%b2#E2F>%Z{N905P}gRQm(@yTjC z0h&$B=5p9W)Xn4pY+=4mn?5`Se)Mlg)90br2V2*c;)Q(FBMjG`Z?kEE?~1zz@Lksr z!yWy>mQ(77=ojbnaK{?g(EMz6dbao@oMQ{;_VeOg8v6UT0W1UQq_`J8$XfAhwazX( zr}a7PR@|Q#^dGDV@SOw5(|bEI&#cR9f_GmH2wfta_wjq!%KgRI|Iqki#z|JU`7ZSO zqm@U(J$SHp@NO;C_p@~o4q1Jr=^@CI>w#!v?rB3CbB<)?M*s7!F66~LVQcj?)+d?= zV9rJTU$UtB&YR$ty~4x&?l00r$eZQHTrrf_%gJxJ?wPx-g7^AOk$x3qMHuS}`;w0t z(ka33PT%2u7wLhhlb;O>YmVW)lwvOKYy9DU+Q1j#J(aK*E4&vI)-1yq5Z;d|)_`dz zv37vY8rBP6vA#gt`&zKMV}GxsJdX*PQ*Yl5^sw_+Wm?kRiCeoH=_gO6JDI&t5gznw ziyPX-+`%qLck!;m->un!@BNNgrty1+YP(T}_kZBG)8hUPz zF#vq!`lGc~{rz;%W#$i2{Wob2h<-jr<6&K0HNEjK#tSy5?ACkf&wg5o>GGup(x2~s zt>B2}gskf$8yD_u#kh1I^xwiAy?b=w4)^U_nUiU^0}mcQ=^#MY8;gBr!S3L)tl9?Q zbKp`pt)2^GznkxQNUrfQopKG|x$r@jBY(J^mj^uI_tO@7w#N-`4W&2U!?@*}L&*OV z$@FC52@0F&^Vx4rhGXn~zqjXaa(*G)P5qvv=5SZf#r}yKdiNzRgWk3DXt%JI?sJuL zZ5wSy{leM|a;e@Pa?nh%K3v61&uJbzAabW> zTyTT%b!{fxmv3uN#%JPD-F<22vrRv69$3-bYWGr~0__*;^{{uk4ItdvSKn@ev22Mp zmA?x^`&HT7;%$Z%Wr<(6KDKg${*GVI@yLs`kM^iFXSec$Hp6(vbGKe+-`^O<7t#^m z_(2}r3#GcJH|>f%%r=3#(_M`>H{$<;JCc%*H805ynZ+_?zfB@!`Ocb5cYfsKe}hAP zU$l6lwP0&zJNP+nbLWe_GZB4t%K^+gUgvDWLNEBz#9rZJn)a zvc>9)cw?o@r@k*Q`?ITuE$2EZXujo>#Kq^W;IOCQo2EB|ez_kBdJOmd**7p&QJ<|& zt2AYp@ynCUN9nCRkS%r6{XMSCWAX7od;Sdz4|DBO-hd8@cjQpkqpn~X@--hOw6f}) z1$fovf!2A|judCe0g*FOjql$ZDF{U-$kohOCjwK9pw{&ht`txT3 zouTiG{f^ahEwt14Fm3_=@Xk!f@_)3MyUVdM?8~$8^6qlv{rUGr+_YvDeY>~|5#QKk z0dV5)>=)6Mb}XfzL?8n8&%TNqn`6 z%WK=KAvrDCXycpN7o{iaj_d?u-y6Uq5AH$4npM^Qit-+9^kLPV+H#{DOl#$@4*&n* z29NmnYn>@A%Jl!^o5+*(vo^Fb$av8HkS|NxuUXi-(Ka`TW|B+WAPs1!&b{nL@5P<$ z_3mN^?ei?4khg(% zt*+qhdgqO-FZwBL=eC4am-vPraAOScd3BiQv%UPh9O-0(-8>EIc(K`GtSr#?>+IXi z{2Wx?a1`T|`#8}rzVC+R+wKmAC-XM-ycSnxv{!g9?egOh53-&2N1$K)KG^Il@u=k~ zovQXerBXHreF1tgWi;#*l+ms~a&Dvct)*k#@xID=|J`0rtcAI*9#7FcuCN(&dO~pz z(!4hLQF1)(qlO$;Cz%$1t+6fs&p6_fom_Sv_$U48PBuoO9aoq9${upPV2yUf=gpOGxSKjZC=&kg zs|0V;*q%T9x%`hvwsKAEh0(;tYiMmJ?)D$~AJJSn{-rtn$!OQ@#!2T&z8_C~y0v&O zov86Uefc_fXFpIcw7bj`FN;fL( zCsq3;%C#iW*TJIutaw8cys&}EVbM)=cPIyVx7hapeb0HM=U(XZI%l8R4uuRvovQ0!-1Yr`v(62k`L&Z9g3H9o+_U6dzB0g z`<2-y#9MsW9Y={*ldBi9e90f@5Ek^-#A(v$j^q8f2Nm~%lrTN%KEixI=`~iyP>1?+ z(P~{9ZXX{civzFW49kr}nP>F)g$}0+zJ9o1I498SJ^G7t0-t^*|6h_hY3mE+41Z`+Cd|f|-44R`&Isy)BMoU`b zep&i*DF?tGOlRZ9;_OJM_n((Cth}!f^{%&0h4HYk8HBlqjY)eWE%p#`&SBqxPIBN| z%rDd@JMUfPzwAAPMxTWq;qRq{I}?k2hO;LyZni<-Ih%VM{fi$;{SoE=&hz*Cy^Q9{ z`eO`UM`K}nh3c6NS*MJ!-oIW|^tr@0x5N9`*IlP{_jD5s?`8X& z+;N?Ev*W)c=aU_7XZ&Ozjc>^T8qdPJ+KCNYMu*omcc^wrzI%=SbmIkrn>-@8X>-AL z;-~bbkL90rxuCz(orX8TkH3-ltlv(8;f-*Azq@!VeEFLhp0BvOV0hQN=}7tgeedE; z@!Prx|L_z+e`7p4X(jPZR<2Z3Jx{;Pl%2A&zZ3B%GYJ2EU=>lym9eI@TKU0CnS-U;J&Qk?$@ z_s}IfNS-AVG)^biNsgx5s-M#xlyBNj{aKvLKXstKH|^hqVUAtwlRe}v;@Mv-OYcd( z*}!p-F@ATD@n_Hlf?O%ygmL*6_V||a2C{|oMe%l+JF?HVI1t}(o-gim!C2{QM`1lF zoH?^Jr7Z!np`rLBUao0T{;(z%*1Y(gVjhFM-`tmR!+Js3>uY_M9BlFq{OIrYCckKW zusq81>?p(B@BMoiGxxd$Zpb0tEeF{*Wrl|#p5ISv>9w|K^ibPfz1CRm4)Rs;k4C!s z?N{1bQRcDEXTL7;@1tywh(3}PJ|ZrxGq9geXfK@K-N1VLo}_Sg&2Wor&+rbHg=amj z4?zD_HkUvn79LGA8G-ik^dV6QPYiXo7bMG{2bP_$p`C}YuDWGyGhc(-DDzcz*igxxUsKuM}8&=^GdcQ;)OMG z?)Sx7`PP;%Aom4hZ0FiJ=BeCYyb8i#&tcnvrr0K-El@|E?}PoBcE=X530U0`FPz(D zT|?ba7e517?gz5EH1WFN+boOqYv?cJ74~a+URuAmIN(pWcWMtc>c+Kw3&XwymKpi@ z9-^52jQsr07^THN4wq9!9^Ou>zwsybt&oNwUuxwQ>J6G<9`M(yFZO`2?_f7!TU)sT zt-G7)jJ}bUZHw};O`&Ub7zsS+yV&OqoiVhxx3A)uUS@m};#!%}HXgTrKBgm%WPB@6 zwL6r7<@EBDZt-C#pM6j3S9b18v}$q7HLc)Qx)LAKK{hg7#^wsaTsNQ`-YmvFq9>s_Zk z?eYF^=FzD8e_us<=s2&+24UZpTjN`Poyk(QM>JWwtHp^H4Rbu?Ck<8WgLGT_g0`0A zp7k!m6{pn2(Pu4;MnIo$T07X7X0qUQK*@q|HyZQiyi)kQ$PasRDw7Z&{FomsIMwaMmor`QHh?Yu^U1tRbB|Z}b=a`5ns>R+fUjI@n95^(QWRq`P2U z`$^b)HT^|}zo0on^kQ%MU%FB7RncS=>@9CJ1|I9zewTeX-(K8j-AHALqhFamZmj&{ zrq9X0UR%KyqXc(Sd&fKfCjV|d1UXj%AGl32KIC-a-OdvqHcx)PBPt%Cwu}c35`M_z zg0w*(AHH#K@Lu7s)OZ*6B*)kMApDJ=3i|%Bc=GS^yKO(d#q;Nz$;gjyCL4T5@&5I& zL$6P`3+(Y_g?~aaHh$_z`JYic$1`q`pKJcmCH+i({OJJUKYc^+v%Lftts(fM|81ngfAjWtn@zIZOyZM9E?3eT`7@(w(Beva3$DDY!!rd}F&TsKO+DV`3*--X z({J^r{J{>i?OXEGP7I#j{S*23YU0pj0P^cH(&5vBT~opEF6hCtf|EH@R(ld?`{;Xbt+$W0ip1Y^~!OnXAqw-(i^}JAWDZSL|b=fF|j~OI5 z_C7(^Mbb&4oAice!iW8e!G6m{s7mEydg6FTr-Av#g!Qh-{}@gs*F-K1}@*&Q@ecy{>qDdI|3l-}0^@}u{0zwEO4iR;N9 z?r0p*T>g=2k9@*?@?UeYV0e4t2KP_)@A&)P`8{g){2}#2{?HvtH|;-yZrjM8_(T4u zM34Eio67&<1i@D%$19cXux@u0a2U&dFLO9^T-<4}PQo<7mKk5HzAE;Z`~INtes{R9 zxwyl?_pgPyhSrfG8^hfM;f@|(Ka$=CyU8am6V@{sgE`)=YO}PEVeT)^Vu}XBx$JNb zG}xwso+kSp>>Hb0#(IbQf`T0`tP5s49L#!$eZS$}u555q;lugBa2G+~fv0XzxUZ=c zcMfp>9(W(K)b7N%yQ%#O2+0RPhk4o_sDC%A87HhiNe>tOTh0Auz5=KfNYTQ zk?%2XeEWDo_5sE{*N?Lc4kSLi-1+^9j`UkQ7j)pdLb%5!*vi73GTd2U`f#{gF5Ekj z`a2V*2Z#2gPE3AU8s9=1FH?9oCdfjI7i_;KJK{ZlWZB9yuPCG6&k^paNW;Ap15RPw zu)Z1YX<$Bn=SFB(!_~jX6y^0hBY2nV8~ZW8_^K@gLp#=8CuO^0?&<5L=~hmg;mql4 zcdA^z{#>l5=B#VEhr+*-Ppn>}|4zWE+XWoV%eUEssk&bHzi1CTJP+qyDP)y+aCjId23_ z6@9iUY=ENCcn9@;JkWG3@I!c)>yZcK=NntV`#t1(YYTRojU>wxzPV-gImx4hdsX1) z8(e^VgA2Bb@UGL*pRjDH4FN_o`DcX1yGZ`Nk=}E*HixX*TzXVKS>rWv*M6(8Vo#FU zXiPTQIDzj@wRVF}amP3G=Xs5CE>)s8~S9#AQ>ah84EL&kS{@eYyDpPg( zblL)zC0qVk=2L5LF2lSY9!`37`*dBm+O`q%2{JRtaf@5p{etZmkT%<3Pet2x7>V@G zFU7tW>%ju^k;_}Z6f_~;+69LX7JSBHf{kH@2R8jwv32NUz6UG zel2~udM!rxT{l5Il%0F;)c*C|YNPu2>i8B1JmPoRrQ_g5neuKc6WZNp!4{DC+^(1- zg}Kjl0~j}RT|4M>mQT3%DSm8O&kuB4tQld=GQ8pV-;v6LItAJ*=wZpP#D~3ZR_D-% zwfhdT!|!J17#!|#2_~r2v0YUd8zM!A^)3#`Q3Eg1f`NSvd zJSI5!BEcu$CQP$c1&`R8Fk9ODu6QfjWYlj61AUQJ!<~-mr?QU`&-ZHwdJ+vAZ3I~% zS}gY<8ZBIn@D&(GZjZCr^Bop{SC)nK{M$HAM~hxXe9IH%+vy=dw3**QTJBXx|1{K` zhGkt*a?sLfUlsbc-o7&A!#!7J*x$#8JmPsE(Qb5uY!2B1jU72{6Ae&4wAILev7FZC z(Y)p9PEIx59_49jJPTXooQ*sV%0BEDcjLaopbLig=;@PkFs2lA#NMgy8u->y3dV^`~7G1_HtwWZe<(m5ZCQv>2^ocpZ;5N zuN)uI9#wB(mfwZEalMf3=X$ESljdfVF}lb4&K;&#;yZqpDV!5FTs&e+#?!qB79Vn9 zl*VzzgZ~euPlvZ>KFt3m$s3CwANn});jBP*naZC>x0dn!96_bB8f@qDiH|eQd*ghp z{N1E)#}m~K@!i)6|C9J9$;8vi4qp?W^bu_({?1x5(d#*1dUx`p>;~!ZYZ*WN>RiHX z;2VM$v?9zm8ZP+g{(?`o7n~`c%wJGA+spU(m3tu2*46hyRJp6=V*GyK8H{DM&U2Tv zA{_wZZ+N@Y*CeXxGM{7Pg2v9$jXs|D4)J==4S6&$+k*H162m~}e7`~Yg*(pJzkc7D zxpfzs^3r`Opb6d$1ig*-qx^%gI{a8&C(U~-546QbKM9iTl|_0VaJO_Xzg4)AX2Vrjo|N|>DNWqw zE9R&DW>!A%SS_55jnLaap9_ewe|yub0r{4n8uDI5MhF;jX4Ftz%mp z>|a>tXU0jMJW}u((|PbNY%KjjckzQhdaEtdTRvnwt;eB1cQ>8{+YI#CP2*7$?R zIfi4u(2G`X)MNFv1&=fOhW`9+P%6xLmyashWDq;9dCSbkw-q-=FgVjYB=+~ zIo;t-nRup+Tli+JyJg@%W=-H>TYcagK+ps4Up8oC03h!Y0{!yt8NhJ&%uhBhVt*Cy zo zfIg2;I7dQzB#$zk_GH4(_k95$oFsgB2WQ-K^cOPb`k&}8-=o3XF7NFJ9OT`LCIbNd zt!3#17-O2=M!eooMp~7{zws;}=)6wczFl_NS@IUWU&^MQCCmV)5Kp%y@4BuP~pOj~&&^H^t!SBX= z-&AF)k6RPE;uOS#{hjZdgJw5wOTXSFN89m^JlMgh%c74sZvd?wWBdR=-|a>?-|I%3 z@~vISo#i$`I3VYEfV2hR-0ywjTfK9QF`n;RBVBlVh+{hJ-d!$7dcg4B^mjJCK>y-9 z&X7}FCxonSWAbmMN*>;2=G*U(QylBps^}eLYu`<9p7}>W*iBrvMjy?9AN0sKXwb*u zUN4SusQd6mj9=(BT#V5BT+_fM{F3e+Ia{ z*_uITJWCBf-?v8_K5z7j{lqTg#210?R;e2IhA@4?H-o{C{r83+@6!)l4G@05Cl8s( zcjVE=+@}f1dl}b4n@>eNjF)^r9`U)C5Oyz)n~;&q+`#;`9}s;K#!u2Q{M@^bc(lW9 zj6JQ}AU^2$=D!5_o;&)8@3#Z;?LELBjqcGme1{#7@2>-P++KLTua3Rgq<8cc-${U< zeTlxEc!A>aeFXUV4mu#;F|Qhz`Cd76biP*(nZ)^wXo?Bu=_n3%G48!x+vt`mA2CRr)xa9e54nW{W-` z{Kq;(E!_dM;`fFHogu$`I`TuGz0rrzzOVT}1V40wk2d7@;yGIpCeybjK|Y^+2Ho-L#`|dFW>#mwwN3s(F0POW zy8e|8k&cx9p*eOI#;k#RA|CXZ&uqN|<=kx@!8eZ(oF}?s`R4sW+~2v=Ti5kCHfNVR zZ}YL^n!#?>gYM`Xt2g#xZfoB||D5xM;H<&IzhUiwIo=vpPtfK1|B-*gZv=;1eK4Lp zHcS2|S^}c}PtPDsqwd6~iOmHd(|89uWL&Sw!XGNyl+6V)?yla#^Da=F<@w`J`Ty%W zH1FTTc+j;I@aVT4I|8Clc!m*h*Fo@G-?RYDyab3kZL~9B6O6GhGA!nM*pNXpJHro} z3S;aWrVjxh>@bZ@ZlUgBj(PM=@;@+&>GXcJjgeLdl%4mQ!cQ7RU5`E*c=&JqRB)=% z7yR6p5BSrm^lNWD>eSKN5_3?#Qw`cZ;B9)1?(}N3 znap^?^Tqw@3$9i^{j5Kc-{9u~K{pSZ{6fBsB)8HPP2Yw;eM7Lj)fMz|$nJn><2z;x z|MN7$th0rqtv)}SFxVyX^DSTdqyO6+!LT5E?7O-{4)qK3f-Ub*9IiuxCVZZt^+=OV zpo6tfVw^O-jBxQd)XnEa#hELaqgJ%SbGVt5@7Qc;e@!Np4zKw8x8#J=_Am*boK&G$^z!%@f zIwi+!@QR-eDE1)xSY3|gu!*>AO;*2D<$FSUPmK3Ogxi?~T07{~`4qX|jqpOM67MZNlib z1=2RhA9~3mCu9 zE4ju3-TxD(5!W-tU-n(lYSo%c>b9=zTjN6u$DSD4avw z8P*Pf=iJ47!uS+ZPXkZ9yfpCWQ>W=fvf_JSic(?l>wEjT6KNk`&TO#O{`WoI3;+@H+ zH`v%!rMI2As{EgPOh`JVj*7auZ6w*GIl>_GSZ2@e0uxYg8#DmLrzj} zM?Lnk{y_gqpz{^BVAw$Y{keFc(KF&qzlJc0 zFA?nZ5MerQ3}JTOg@VO14`@e3_&}2j@DDP50rwiPuJAv+i~NuO2?*Kx#36v7 zJFZC}-1#Ya-o~Gmu*S2V!nt0HaW2>ym-`*~#+V0O2?)HYgvhU;%fpQRFg6`_Ga%-L z$4n8N(iRYF_`Ev=d`mt>x_eA+0spTyfXHv^D}YEpO?rvmaE1T31AxbP^80cO&nniw zpz{V7140j4?ny!F6j+n)B)-k|F}VS`w%>Vz2fhY~biqD3{x{swXbA}U==KVY?`z>+tOmd%-B%3(|Avp+TR%V!?Y=x9&rZj^~@57vL6bIRo{T`og^uO*j3pOnj>Z^}Q|p(%#}gB)J0 z{Ka=Ee^EZlUwo7D*V-)D;G4oWe7TnmdkRB4vA&4Ua$BFYbGrfFq^z|*g0Ujl5x6b_ z-l08VB|sZX;O7~1)Tx$TVXtD0NoY?1kC4}JKMG|y{In|=d=vS=b{}N;)C1uM&jfoz zu+@ik67B~9t&@kEy8U4-z#CYeV*P}&9lX%ZWEN<>+YCUH`PSFXV6*=W5O(I9O}2wq zXcM)2)>^|4p7JvtvR5GePnJK@`?`y4t)TH>zX&#buD^hWX}bqKkT=i|V-9A%*%%uu z%%*SU0gaE{5O5{u0fV~=|KTt|@EUEhpkdlKu*OAO9_0O2OCh{@xlY5e1b(j1ARg@- zi0A7x91j+X-%7XjJ?M`5H|oZFu+SE{$s72&|F$vYfsJ=4>-rr5QKzSEj0y8w&{2mc z!7iR(YO-k={GlswuaCL0_RRa|A$!*|nTT(GYGb_d z5$0L7?C8k*?1zB|thJ{I<<5H&ANC5_H^P{1<*PkE_wUxRH-tOEEWY-7fbWa7E{uD} z&(t?=yNod7d+4f9n7`Y1tKIeIRbGFtrC1%&7QQF5wi{)xw=WZM$vf*aoz~oxNB;5s zEEB(f#Ix?k9oDtPNJXfPR9FF6cqy+B1Ic^UBh`hO*Y#dldE@r9I~{4e8;3 zw2z=YYpp$4yR8d3y$AD<-41bDTmRsj+k5~Bzt7d3?AlS+dqSOc!h= z3GY0{`lX+tDeM@JSvv4r1GSg-l%XBn79e{D{5%tcct`bRzUduXDV^_COaGWkf40oI z4A1sgpJ!JtCx5W9e0d_{1sg+t?i&oxFK8kBJ2sAjuRk#Uwl=}JrcYl0gzfM%%L}?3 z?h(F@Ez}9^09`rg(qWAz z=*T{&*B%bEL)fcVYd->LjpYGP2Of5tY+>{E^_1FcHRy*=yOsUmc1-q3J-64z_b$pd zvmg61?3vOYDbNJ>MnRr%Zxr-U-xHOebv)v)fIs>oi~)0Bq`$80&$urXI_)RcKH}#< z8$oxey$8wSfNqyE`iAUpVKNZBN1Hsxd+xcxcz(UnJN!4cV|>XtjE%)TPi8xJKJ@t` z>5IB&Bc{1{k zwcDa=*Ad@zJ}7O}D6h}A!yYu&-)XMo3(VhKP6oLZ|aNbBScQBI73+%I8uMtK)L zSd?A+H$@NCcFDBIFCGW&S#Mtz)@SSNt15Zn@4~=Ki?w$mO|Vb8U9#M3y1nbgjqB*e z;IqZ*#n6|7UR+Bb?&SI~!h@bcy%>5g^dmzZe|mOZDP`#_Hi< z1NcWcl$r6=&*j=(ZFybJC(sVXxdF)Tu&*WDrxom>zP}~xt<7Cew)#b1ea3nxGrlKG zkDjb{IQwa@Kjv0$`^$dn3>@Y&SDM~w<7nM5l%HWPvw4=n>Jr1YHV6=XwZZ0qn5Tz3 zHtX)a<#-8RxN9Qff!}%V6yxST8#0~d2AJ=DWBMifi+dPg(;%IQZu3hl%-lBjGYGm| z?KVKz4Z__(|J|Q)va6mH{AL6o_U+i5i=m=|AA4tcFTffD+#Ur;N z%qBf4_}%q{d3&>QSRa}_&-7uGbItXMOa2dYZyjz|k#vn;-0nI190(RHSO`G|2<{Tx z-66=pFt|J11RFFs3^Ee}3^FjdTY%s)K(GwK-QDfCYOPv*?mZ#H`##_IJ%77PNZ-xHE z7=ot$W}PU*ys$0J%kTfke0}otJU`uke&j$ZuV96T5>_8b@!-}%azx$!>O zTxCo>$G5NjG(vS9J8g-tmEK%?z~V>hm{5z|%kqX}KJ9sg(vBPROVHBj7v|Hkc^JnI z{Yl?V`TcX=6 z2lruq)A8wVJsoM3m$>v3sr;ch&(U~RFD%dh(hs6;#tmq08f!D^U&m0J)z5J*K`nas4;-Kv*joPr|W;Tlb~>w=&>XkJ!V}x8KV1 z{6`-UBl#8Kh5eBWF0HX5pD+5r9fKZWd{Zyjcy=YGyWe?heQHO?6y>gX-!oG=&Ya`P zId0tRFS8v#>-cBB&!NQ4>ULMP>rw~#&Axj6o#1o8{nY6;wmgLC#&*KPkUQIB!`mmf ze${?@wucWczIBf0)y5v@5JvmHbJlVDIOmi6h2`~2j}&~VH(@m}WJJvUqdODw?jfGn zpq<}YXJy?yJA>L#65AD|E5OGrb$p^YNWMJVUsdnXKD4H?97H>M9B zg?!6D_Q_z}4Ct8l*LtoU^f$IwY#iAal%Ia3+GC6z?71jE0pGd5g+1rgpQ0R)dob+v zrxSh{AL}bV!uJ=v=Uxo;PMwVH)=!J`DYSRRmx9;quY8_ALpCuTqr8TC)O8^LiECB= z*VS2H=RDAF@Js{rp0<8MCKv%0JMJJhYbTzupgUHt0qojdGr8%-GSKeFV$3r;9U_yBR)mU zF>t8g;(*|vzWbLpyy(N=wV6-6{^d>l$2e2Q#W zzUh6oqj+4g&jFsa(RT8Z%xnFRZ^65$hr+(O+|`Nok}^Rnh6;E>;$q{8Q*S4Eloprab2R6s!HWWWMieEBw$h>g7MNyd`I%AD6F?@16p8ruN}~#YO;bw`Q*&M4P<Z=2XGFC#KMn z2_#E6rca?MyS>f&zTc_b|24Fx{L^EOF^`VF$o&psYovZvc z`U~bARE`nT+~!#2A322}<3VCwTslZ;?nCgtM~$yIccZ^5&O2x$0^GE19Az2I5%tHR zAK4FWKvwZSHDhXXolw4rF+_Whh0Fq+NExft&v<3#8@_+L>~n^Qws3#YFYvZ^!K3=w zn)hn@y^)W#@Y0!rDaVUvVLbDUq}feww>@t3)9(&D4b!{YYdC<+_Id%!0xPPS-x5&ag28CsApWt72gsyM5d>!(CBX}4)TfY@A8@2*R!dw);+8txwwADIm&-8Xczjj_+0(Z{|oe;ifjnRS|#J&LQ@VZ?EeV^g#UKgO*j$531 zpSokoKPQ^$d1$=48QW+MKZr2C)v`;x!~E0FvpjV<#3#q(a=hZ_g&&Q7|B&sWFWxgv zC^}Z|UmGr&%J;1`_6Ru|-<9{P#sB(eqV0_*Kh5@#$2;gTkGz9k^V5oB3!YzMG-4c+ z_OY$Qrd0dM&*|fI!xqe|Rhtu*I~~^&&eV_FSNXXv8dn|2baP$xtNGX>Otbyu2cG{} z>zyM-qno=usORo{BJ0mw{K9=Noq2Rw%Q=7tlfkAD9!lYNSj_iaxwB_ z?flTuc~RgQpVywV^Ha@Z=jXSo{`Z#)TDBcOWFM@9iAM=el50NqhQ^z6_vI`XpdRLG zj-d5;ZVioPZN0uq`!0{IH7B(}XDB~oNY?(`PWRTJZK|1vB<%?e3YBzBiwv%mhA5{(|=sH{nP5 z>XoYZ+6cinmK1#dbHR^}67(IPl&$c5(s0K|7k>h+tKZN1CFbA!UnyPg+*na*-?>44 z2EOh)9aqS8JTUgFpcSiLA!r`qb-m8S%HJSmxTItCP4c&%5aBXUwUzc~{B`qWNg&oRD2HF67Thd!KaGKs}dw zIPW>czn4y(3hJjW%(27k|JhE@y(K)c>{)+XyrkUS@xunH_j4aW=uSvuz=KF*AX_rd zB4`Wc1C&!fK-#p&d%yYOc|1qC0riq*o8}kVWI4j|?RQ&D&+U=AZQsRVpJ~&wL$rRY zuE|yZnB*zPosKm6bG+uOI_XK3^G;yoTbG*m-BxGLuJWQoT2N`q)Tn=l)~o#W@E!D- z!*{jqZFN5?>iaI)r_NP7 zD`&f%&-o5u-(6mGQ;z$;;Nz<2bC|`0uHgA4mjVQB-)d2%x6*nQ%}4p4G!KnGzo~NS zby0thSCzJ}y6?n2TMi!2JhP>))%1V-tB);`A)M6 zT0S^HGM?fKZIV7knbzVgGWw|?{s(?hfT5z(d1pn}w;DToh4v_3nUwvMs zSML(+p+5m{-bnLQ-&8nRFT6H*CwN!kxku>v!v_oczAMY-7Yg5`f5CIszg(*MEIgBX zIh0dwhV7Wo9g2QNIInw&!E>M6UH#ym3C}$jv<+~K_KSsgelk@3`bKzI|K8uU48o5$Pds zDed$5Q%+O*RIMwWO`x9l`Q&}*7kMA@^X`_$-M8sEo*5wD=lWw7QvS=)FXWRKg0}nq zsHuiAzvv@+@I0K!kmsTP>~pZ4a%WF}$t308bMrd#IPj`1zf-&9b;0wF)$`kFuTl2G zd!MTOgZm`>K=9C5XK3eet)u37`MwK<$IZW=t#aQNb4~DU)c5(V?;}V(n(roW@hs># z@|=jWwRIz;3&3yQ(*S%W{y>KCy&w}0;d@%TxZus*^>X9-k2a0#DbE=bH&bIujTt|jdumNlT2E>QR}Yu$$iTIbsoZUPJ7ZMOc(lMI`X9I zHU2!D<&8r{XPeUpU&44&_QCwkEZKwK`uWT(i}D)pgABM_=3!h@j%44H@6m_k%JoqP z`j8v{D(KjX^mzpj|Nda+*CvQQ;M{;dt!SGuAi=Zfn+n=XUsH_LdGSu1oAGQJXV$3; zQJfi+e;PQ4a^E?~Gh)yL)39>`N1=;N+XBUP#@ez^r{!RuC(<_)3;|AB29b72L4Zxu{-f?>G!CZAr<@#9gPUaVX$7dvmgpN{iK{0;zGh;knwC!Gf}*Y@rTeh&#D3M4w?a* z9G*?1{|gE}|{-IxSz}?X!XHQkbN1P8Bd(?^X>z6i07_-sqAdUHKAG>}dkPkZ1V+^sL|LYh+ zHvYddhAkVM|No95=uX;@H@*oR#rUo|8ON-nWBMFd?6u~)40*u4gLcz+`pjdR;FlOL z(n{F9%o%(KkhT@brya{@pj#nJ0w)VUI~wWmjr+*{3g?6JjZXroDUw!`W0iGVqLNC zrqi&6x6X&_#OI>65$c7$KaJ;M55*X!m=D_w@mr9lPvN9|hvbJ|9kp*qFil*iOaWj0 zk_TSKKBqia{)3*SEuF?4eNS65+i*6oIw;!(J)^yq-m7^D|DV-R9%~VFl4BqLH*DEB z*tQ|>FDmC3){XdX@?WAItkXHC6!e+s_OB?NcY@U}dR%GWh1n*f)ocsVO;Hd`EJ^f;c9)Q6H|SRYdN3w-brh)B~MwV0KG}ug=)YWnv-J&2o~84ZIIr^8j1FT zhIXnB>80tU-XR(p<*1u-Bja$TKCw3QdVIE=;cXs!4$wiK`(vD}x4T7iFZzh`S0W8) z{aFv&3(&!(cVWA_A0D{qvz0{_W_}r8o>gFsd{*(?2P)4qf}*3}Z(8Oz4*E=xx_02u zQL`zXI&kT}ffK%q*EnNb@qXGmWaGw@o3kC-s9Ps$U8i-H>FZz{Y_AvJhg*CQQa4fd z>cxiu^pSd!kRxrk7yog$t8I5kmw{_H{R#OPw+(Y&dvTl*z&@CBjPD*6yb*lBd$0GT zKM4G5wH7`)lK+?2PA?HcJbcyaY0+pSOejo?%>3YuPXO`)FYb;3p#Ke4h4UZ`CKQK>QfrU2h$r&&jOov(3&jH}Sc0FZR~AD{Y%N>-fr=6CY|E zo4OV2?nvKZ`^|GHtU=T7y!%ab960MWxxpyDN49aGtJbCY+~?xh1EHNu2MOBN;-P^` zrwvooF;0kg#hOB1+Ag*7K%2*T_ZVnU@y~cmz{YSz}+sf1@lFr0-OSbj(zPk7-q-|BPgCnnl zPeS6a_z?Dld9R@44#?rg%fl0oj|sgH#wmG`Y$!pCW}S%nMYp`-eo9jg06y#|Jl44< z>K8nTy(Y#l_sGpzk&JZuQm^bUI32DgkN1e~|Xiqks*n`rh6W>7_PU!e{dI5E!FHaEu zzoX~y#i3m()=ByX_v{PCiG7JZ`$gzWd>ht7+F3;(%h^_*MbVca&ogVw&B^{398DS7 zch6TouQ_8c)-!Gt9JqH$=5wtL5#MP4-;$ruuf$dMG0#@wzjaRWU$N~{E}CQn+Sh;C za>w_@UMSv$`Q0}52!Pjyo(QywF%|(CV^Q;5KVcb^LBG1iC4j)W+XKIVYoi}!nq~Cg z!Tyf^GJylrqb!~WpQarz#+h;%+NN$J$2nt?_55bgguX-AcKt>1;^IGKSwGiibMir~ z$M5DIGup*m4?T*|vP<;C_Ip*@qxkG1p0y0ieo)4k9M5CCzupQk`#K%|Vr{Z5`gdVH zroC}%zZiSRzoSkAKm2DrvT1(j8H~}a-=Yq9_udZyVvN?cCpUYAL$|V zzcywB@?#C-Tj&cAbB@>^w!!;VGDD3va9F#vEdv}DGy>z*E|bv44CS;j1AIw)B<&Hg zCYHXI&(+r!FRu5n!Lr@}bH2;Rs+V$JPunHb`|v+1|MYvpYVHjL7du3dIug(co^Jvk z@~rZ01H?Fypy{;1!F>2Uk$ZL2|Nbwk&pWVyyY};<4Gq@(N=LI?HZe%k<^_;8FMx*) zR5{~4;(5lz0i;|C_+;pc0Q2miIoX>`H>ZC|u=kyUtBEEyeZIEEy~;mjkYL*EHZKoa z4SG&_9W?dnla+oga7gp(JBMSgeaCR?f7Ag!&3Ox-t8Ui(Ht(OA`O!w_RnPOk;zbLu z^k40_{sS)Uy^)}ai<nw=t4<=2u5wB4{1QlR>Y6ch@XR z=)HP#p8iU2e-|NfA@}_DjcRVCIvn@xTm0`F9r@Zr`wnY<>)`9MEzA?+CB}GQZBKO- z^XqB8m+dBKlZWxJ zEPuMrD_I8Zl z3)wc$Nu{fV>}lR-`xo*+pK*fzF`h2uy`THw9iU^3VbG0^Sq7bLE|lZ@NWVarR(xCO zfn9(&cd*?+`T#WO0|`EoIvn`~fUYq12+kRj2RF&<0@weTXL6V$-f0Fp!TXs4K814R zzZDD+X~r}LO`!iMAY<$RF7z|Y%N=NohYWyx>Rka3{Yh!Yf(MTuvYOIE{soA!V~je~ zvo3})g|RO-jbZF~ls_Hqp#JFl^!%9MK^RMq_0&OIk!JjR+=VvHJ*@Azla7NToj2y9 zf6!*&^MDlrG4IrU1E%iS_gyJQGV=Fc8TIfSdD;Td=dZ8l7W0 z!&q;ajGGr6r;J_}yjO)@^ zC-yg>xr~{Na-Pw`SDLYsktXj%`xktw=NKy)`Q)L9c}LzEabZQr6(bqtjFF6XKMEcS zTxPr@tYzK>0Ju!ZVt|aX317vdUqc$Q=ZUWa0@qL4UgbkYLz}0qsq`6-3qHM->TylX zmO6j5_wwW_e`P^I@?Ny}R`8wi@xysP<9q`b8OIxt@-!ghc4N#LuNvP>`5WJ|*LZji zdnLxd!8?2=?mp7bGTKHN;~8O%GIn$DFyInxurU^lEfjg+L3}3ugV)fH6S%^ACE+K| zvRK#91f_-o(mo&QJ6q_w z??=4rM8320uDb>AepJwBAnBVY9}duz=cGI8d|@5dtBn_PgYlf;YC-DQAaA7acHtYH z->ckqpLsWOt@ne<&wWH~*_V}GX%oQ>PZ6}A=@$Dcy~VA9_U+i_MWuIHL2!>H1gX;i z4cbq9w)k++9u)mNtDovo=LcGMe(baGJ;P!x1Nv-d_`6D9B3dw(9RAO&f9+AKcUSNv zJa0SEdxhingRb2lbByvl->dNq2>pC_59PlbGzH~f%^>)-*ZQb`D15WLSZt+y*5-4G@lNG))%ddrS~e{@u{o4K%lU%V z@y;H+19Yvg)@L>UtV%DiJ0N&f(fO{W{N>IPv@aobz&O*k|Jo|cs@%G_wQf^-z06-v zy0vOoeRoytT{T~2Ke+b+dd@y2ws$>vC*>bk=FGct94dTU1T%I-Ih(XSZM%;9-YZrAe({!SWR9zC44=&Y z+n)A?Q#;o2`z&{N@tMY+y;M%S zUbMTv=A&`I?8-kt^saHBWQWEf(<eurok z@bMfs$5i|Gt;!#Dui$@13ce~lmAsGVzyD16KmJwF=YW%}#5pd>_qE({Xfq#At!c*roAoo_n3@+XrWyzBdP{p7k$Rb}DVV zSWuRdK`(0j!>Vt)c$@Oi|&;^B^6R?em7Jc0GfT%})9JX_wGZPJII z{oUg(1SzfE^UWiD0peSb6UuE!Ef=+_QAKmkL5ASSt!pl zvm(D(Zm~RI{`|4#+_o_FUlwKi*6SC(X1?{hEM60$-d_Q8tp|e&lw9;b{FHL3}-2A z_OXunV!cw2cnn4Fgtor;T<=Z09_pgf7n3-5s$@p{Wk`gkwyLZc0Jf9Pv=KpK5z zTra?fWJ~zMD3z*!S9wd+^$9 zx9nYMn;Lz=8cn-)*}Fy_?9leUfn{E!9=m!&ytaOwcucVeV?15h*-^g%{e#!+OLMRt z#t*z`P5$rv_#?n+ppOfjz&CFveph>CdzKfSj`tznA6WjsE}nltVJQGQ@8Nd3)Ay1*~P02~zhtu{FWsC)jclSCr>qEEp zkDK_v*qD6rCeyY3MdM4%fbTzG{#Z63vt6M498>F_>tBd}7rP|-PGG*~k3|Fc_gx5^ zf6#lHf4GO~IKT3qyqx(=c?Zg%YnWykK;W0}m!uvH_a50lgK?tJ_VTLVuVSeJJ*N8BebjM-Tm= zeR<#p+UJ>5tO4k7x~>PD96yZL9Y+&3kNg`UX^U+{m%W8~?ekt;B)s7_6#oRgul&b+ z9Y2iE7T?9(gTym6>R82J3(vnKc#_7?cocPAPTIq>0?@F2JF#t_7Zg1hV-li#%m|h{ zKAG-`!5HmyxbhEOkg%Fi>sseSSQ~lH(D<$|%N+;L=Pu21CV?2kJ^BJ#kni?8)h2Xe zjJF3oqyJ0H;W-_h*KNx7OMJ3CkMB$yUHc(-`uwy*>!sE)jL#K4mHm_*W2CbS<-obl z5rWMv05Kl6L*zYANUss?p`LAJ))}mN>m}{nZ7G%SmE(M5$oIfC-U))|9V4X2IWBOL zeq4abGh!If;M#Q2!+7o>q} z)bC(^9mB)+kv=bO_apZCv14~^x1`$LeJw!f*!PWn7231@<>X^kev0I{`h~A3eUa9V zakT!>k;)%EM$oY`GB$1fgZGvHVaf{a=g{^anc^hY)1528%V~mk0s5TUHp@%hul%JY zQ&dZTtn`-W0YX2ro#wULIo3U%w?4z?*@qs7eArkVCRx42hdWL5Saved?_M>V+T&gG zXy>kd)ZU}(2|oU~;ET@-j?sRwdihzU9joHwOOVF&tMYw5KSiv6(1P}J`WcQ;zW1$; zhq&a1%J;ebmRBpii}XItJ^CnJ_MhU@&EwBOK6uiZBUOIh9|SLxK1JvK=6yK3_~&FQ zzhg?lw5e4LRq(z4%z*s(cF^Obovr`zP0sJ^_J87T|APlXW+mOmx?&r^E6N4%%NUDB zy1njgi;p?pJ@;cD23~@G+_tfx^~Z<&hv~-SdkBt-bq)Ob>TE&B^4M=_rY%ER7Kpx9 zJI%+k>gHj3W|9$t8~=^4Is55=6X1vM8ZG@oeXgrmRt*gP3OxVghk(GBj297ou#Irb zZW!OnGe7ZT^A+=?7+d|r+F0@elYv99~DI-gTrw43d>+KYZh z9l&g_`sx{`TXi7+l=u6;@J!Ffw}3bH=ofUzY-duGL4L`y)_>uq@_*w$`;z(PKk&9k zAEO-KPdOLg|9Q|RoZVTD9Xb)y@lLOo_%A;?;fCcGj(yrm6!~k3o$x$pw{6+16HcC7 zbYsO>_zA{4Wo`E<-rr!q^lgooL)O-R$=Uh;aP2uM-`g)K^*WtDiucxh zHs&*`j3ZXBX)TWx7t8h^Y2Q*ke?H%BTSvz>u)Uq_T_a|6ZS9X(w`P5cZGTBWu*Vqx z34O26g)Bc27yb1@(oHqGVva$le%y?(=*YN7 z!CEVEJ?BjSFW`CmT@uz~SZ|Ru(fW(A?v7Yibf?5xSzF&QmY(B+F7|0GeaD68D&H|p z=zj$~{%jQUiyox?&WXp~VtHdm$u`!HH16on{GuoEof5sfl)tHD6VvK)$AtAL<&KHR zSU=>3B1fmZI+h(_yBwDCQL)2IIbd9Nb}?tQ)N@s-*J56dz5B}b(mU3*)`e}txsHo3 zylD?;z?+&I??@;-GSrIn%2?|7xlP*12kQ< zuDwUhM)d6~$)UxL&~(!D(ROD&&bNVMJ$xmAi>9Af_T{(eTQN6|r{weL)MFdxN~}Ph z17ptUvkBP4_Xjv^`s;I4pP%}?^Xb3=Jonjn-Nq6)*{=8Yog{Mx{|9}ZXDdO+?Q!fo z$F|!?^xrzW!jtUF<5+aoHKrcgaq62sAFwY^-|hIm61%}ZnYZ4^{J_@|>xyd>-=1gE zlqquE>U^ORUy^cf%0a(x&wo=(*La2YzMcPCpM5W}+1qV( zN^G`6RL{DQqU+Eet=Qbmn!3w&n;Y|bpC8$_W~V#ZZmr$M#%C?IooUx~jAc9XlG0v8_wPgRJc3T^eW+b__zAiv_58HO^v99X*e6WX22iiSQd-uxmL9H`sx9K=0 zX-B*5hGXYj&K}F=;$FSqwib?AHoA}Utuy)XSf$%-DcWr)GA>lnGdKRi=ZYi|Pr)?d4zWRH%4dc?)3>JSDKL>Bk^Vx>a znL~^S+Wecg44~=O<@`@=8q$`bX&VOXaBRCU-ST|jSh}2X*)H_3QGi@!8wA@NFyvj%VLGQEweX%i!Gao!>TLan{pndyb)3?LA9^{Y9X5caD5PQl@pid75kHMbk z(byx;$anS3n;Ci7lNSG_J~$f;eG_74%q4wbZQhWF(AJV?3VM%j+w8xDoC~>wzH*RR z^DYM8C0`r!S3V~{KG?4@1`7H_A38wllc2XvAAI@kL;tyB%1G41fX}D?!Ev8-b_3iP zz8~M;iYavf(m30p{=@ny$fQ08qAf4RlDZF!?ejabf3nq$aRNW4PG?5wK8{8jeWV|_ z^arw44ta0KmQAbUcohHd6WM05Wwi}!o{@WRUgCM!=G6OW+mdcQlEYB%>d#U|6Xmp;3vT?W2C&+zMOOvmTSohUvdbqqb*PTD5Y z{^GWM{Oe+RzK6_+xF1hkt9;9hwq>O4B4p2ZV_yUK-e!V6H?)l+&+H%@wc8}x7Ll?h z%58Jl!^RM}WgA2D6Wa!wKRAvwWl*$Z+dcCK`=6(cgXlQUqiyTZ9=F+gp&qtrpnvVQ zX+3PxP;UBc8x`B2r7eZxAEVv_V>nKZe_U*}Y;)y1S$Ova*1|TEuzs`HN=c7UV)~nI zjms9wzGyy=Eq7U9Y|~%2ae0&Ph_z{atOmS_JnYw&m{)L{pkr9m6P(PtjkNps`CD__ z&`Jb&3Pgq@MDG}1#jO(@Wm+r(f(wiQ%7H}><1WY7kb}uJX7_HI(UY4 zlOEh6xk}#x`QqC+&(5;ThvUD$6Lf}hf0SAG8-45kAL}u7>E#U5y47;dh;K=`ze+!) zjt-eO*l)fP5 z1@*5H4fZ~^tkVy!VtKjaYpD&DcFdCYxaf~9tnyLs5|%qAcDY6AT|=(`ynSs>LdOs& zHhLM~I_AapEMF2cun)YMMxGuy&#@Z4eGe6~eoGRzrw)?iRPn-8DZJ%X( zi+88(YBOycIWPZZ-)Wn;=tJv2@GI%OznS+ZUH^l|hjWN`EpVv5%Q53`IbCVrdy_G^ zN^J9@d%`-)HssR)Uhh45+K3Xz+wKbr`r!N399!HzhPJ)8&tUT+@gsg$?)iwvv%Sqe zHX9)u#rns5Cl7Avw9p^N0V(k@VE;qEU-;3SBVCbXvzRlNfnN70i+B9DGK@Lx8i-g zsZaVN_0I2rj7fc_V>x19LYp*v2lbndO)y95Ig#!W;}QO6jAx4ajPVHg+Ee%zKQ4Tew1?|4Ldp74+UHt zX^aQ`CgJyZVDQaG+VkNKGTQ3&!8+*8=Vad(@drb$1bw8xA;#~KeORuTO7QoieIMqV z{(l&s+oK;IFF^VM_R4XBtW7^Z+{ZwDFw(DG#QF`!><2E>4sgm2`P0==2E8f2CEA5O z&c`3IzWR%P(Z3S!vHv08hxz$-5b8muUohx!j1%tY7%J{0&eh|@NI0< z-{3ZJj$YcFy`^*QAL9%8Vu_GX0W(HK@zwI#wSA*3XaC%V`k-&V=Qz*v9Dkv18^ZxF zsGe;M4_uP(sq9PRb3gmOwEL3WJcH`zIbexL=QDGT7rrs?H?^&Qi5q9z`b9#X!91<> zIooUcY~42Kv>}MOg59C#D(QWDY`|ix>2tT$yYL*wqQsUuPU*B&x9+lTuzjDUQbu7Bt{Mw(^4!@7> z);p1^%>^_;S(v@-AD*fw|{r|K2-RZQeGVZOT6vGUJbv zFfG5;;1jTA_Wt@J$wWRcFZVB`U15o7H0(;YA$bJ*Xv(UPF{zs(aLGf}{SP&tRUpkH>nV zzqr=A{GJ1UAipubC}_kKr!w7m=mSFX2igQgJ;>*I=eFgn5`QrFc-ou9nBko%D~td1 zLf&M!Yiv!G*(W0HcU`y4CuKj3$Nb;2ej{y%Tk{9{9(>O}C%F%b zzNt^K22W@El zvuvEQ7|YJipW43^e{4$;%xbFXTOg@FlU&x#R2J_8{Aq z?>TH_+I`M_kKkjX)1A*eqxxw})A{+nN`JjRVQr#E1Sh^xFm1(ZQ!J>o&u)EZ=roTi z-*F%Feutt5oNEb{FZYAs3eO7;yi9PTF9mrXhPm5P=iD{x3%7qolH8mS^179eEn@oC#@>Bd$$MAK!5HzLFM;-A;|q#Hyrc1 z*ta88&hs&p`&?|Q6`5aOY*Rtv9&l{6dzAKCroICCo9R80Eug0yva#w}?|7>CQvGy| zQ~mT8Repx%p`2;|W3ckCNS@*N#NN+eb-Bu~xkm81?B{g{D%~TFG5U4uYs$A?(>~kf zK0e7D^^8s9IGIJynY6tA^;~M_+m8jm|4J}p{Me?e_-a_+xrpdPi7Dqen~Mi8!P@Gf z|AeeS{U_G!s=+%^zN+*<)oS|Qa@WwB!mDcCdsXkitnW2_xb%)ChOO`8v;NfjA>UbD z^rpi5Dq|Em-lTP3)tG!=+SF7Z_SXB!e`oBdewc~rMlEDF@Z5HN>+D+ht$Xq=QN6xe zFY+hE{*1oIfc=N6+_nOF2aMxi7M%p+g`)mq(LeC`#f5(j#}8fVSG8k(Z?QQzO8NFd z-Y)hT=(l4L`QE*v=N0}o_SSbd_Wnurc`k?dA2@;1jzjABqkl=Bb%NGYW2op<<22!I zTDE(Xv4TXd`8{m1BS_1r6SB$V7BSqSyh z*SPUZ&fhN@uV#nZDfjbD`XrxkR_6#dHWcjjzTnjQj;8PBvwqt;F#8gxuTr_Y$a-(v zWbC-G+S~CKLF>c4A975nu3c4re#pm=`%(|oykthDFMC6fav*q9+Ilp7H_^!LRPK1K zMPCjXV$2AZQ6`wjat>sOZvXAC5_SI9|5L})F&_4E!(!YZ-(M7T9`Mqe1aF#LkmrZU ze|Uh>qYe>#E_gKZUwBQBK2O+NaW4+O%l!iQ>lo45&Nq^uz8Ulk`n9*70z^IE|MR}a zt@DFFD?jgC==^w3r9Yc3VfOFq*^$QkzYcr={BA$OTIVW))7>XH{o#UrLI#A)JZI2R zz`1q-1mE+%(eZ8;-(30JN1{AspW4!r-D|6BTxy#KeMLK4%pkaZJcslSK@R~B(0ZvI zQX!3YcvcENci22iAEotQJ9-wSec#bBTF13xq!X+CCEt7e(yDjDp9D|RI<5`925G$S zqTnZhBli$|B+_{AqZbN3mU6(;F^|w=jG9jQ&u%05lITzErT8v9_xfXiXz%m81i!zB zus&YMBaoBFzgTcGy|+Hu(@Hn?7MyN=K*);IJtWwBA;FoB6r4rhS+@`3>}xB3-qC<) zf5E^Lz=h-c0T=nV;PQtGuBdUZuY8`;8wH(1y)A;i0B#fb1UTqJ!R@z9c)Z{ap9t=9 z5Fq;b=h+2!9VEEF)^|O9P^3>ly#vLE>IdDadIxc*B2tRr!|)uj-csox^kgi17owW*Nb|7XgHPlXvsf@BI#G^k-zu3*?OlhAN#g zf9nrUr}QI}B~1C{iNJfb`*x0#&sX1{So!uf|1!QG^}d})@VlIs^gXZt8sCpIvhk)6 zoahcf$PJVHC|LCsY-(JpJYT5h+fntG_>17On+vX>bzH5#snY9fzU@b$_-1H-n^@m~ zgN{r1li-fRtLjhDFX;GoSy}meW&8UMMjHJ+BIX;=u~jY~se0E=D0tncg1i?D^3Y9^ zi={`xdv6h*RJRB}q)S9T^`im%>-jr_U*kPbO)ofVC&AZ72);kJ;79KZezv?|>Xb^H zwT!o1ecy?4wEun73;4DmeX)@K`4XlZanBT?w*B~!kwt~tpi+M!7t7BcDy=&vWfcFR= z8zV1LdSvinL;G3Es#Z*IkA7=YsicU4Y4Z4GNzZbt~b{x*ezqo|K@-DnX3=6j$+dS9gJ`dH{ywh%z}2Z^9pU+{)lQsW)bj3%+8iMp0nc_GN?5;GYpQ=deD7@n zKYZ?9?z^~EeU0}NnJ8tCXvb$KY%|Yi;=gSh)aGCDF33RX3)4d{PW#45*%$j}NH3{1 z*8P9uweL|+`T8IDfIg=Vte$$#D)p9>mu+XxI*EFf7qYzwtj%;IM%7zCdGPI z+uXIEkJ(?H`c%j;Jih^N_c_=x1Ne^0F`ewkoiany{>KM@z z&(&lDfb&b*0O0vILNn_vWG&Eo z%5>0eW!$>v;UUw2=RXlLO{^pM=#3r^uusN$#$0*7o99qof3_d1CYcBI@lN04<~zNP z%Q+w)ZJqgY4Zd_1-zR>LJq8<+nb?PM^vv@b!Q+WqAicLrl@J=+U!u+ObK zL1P~U8N;}+LCEhI^C7XnoH6Z1fD6Mkj*4xA^z&z+JjMm*pC2s+2>j1;uX@ImuBN#G z`Ox_?t^{mU7Jrn_H0N3s5bxmq6F9$q`%0t(uP~pq4+0LQU6AadF@L^mA!Af%4Fpci z)Y19;wSeGHKEt?vYo+aPPaOgJH~&}6uOE1%pmp|_u8uV3*FGt?^k#WAap+huwo_}} zRBKD-l)pakyDR#Pz737v46y#0Qv7|?yK)=OxwS|;d|MScvkr@{h7}ad>?e<-dLmq2rS`I%2$H4$yAKh*!M&7%!}6`;9r?Any{wc(nV^q<>3u(L2~) zGyOLB?u_qXoNt^JdqRxyTmN8P%4DW<*LSh3_zjSk*E>o~tqCqbIp)uF?~M2^;3Rns zXl!*X(~SWO2`xnxh3){ij9<9}XjAh=ZV*drlP;b@2IOln^ zzg6~qF_zFja~$H`s5cHe(28k+_x+FV&Vw$PI%Ck-q`8Ivj)Qi_`2Fvnfs9QXvcN&m zrdxyVL;rkVtRuj0PABxjUSd^{bDy=7&GpPqdt6_iR0a#BMyTOvrfOX&jPQz=_S+$Jt%v^ zsX98Z-hp{F+ajAF!S{ zKA=B+gHD3(WuKZHAB~CgxTex(s+AXUZ{EPO=u4ihI_71Ohmw{CUKT%^&u8ZMR<_@> zeIDl#V?`Z;*0I(j#x3;<#7ExO4LXr~0It7`ofqFxd+TksU*AZ2!7^?cAB6QemZFW8 zzid0+Di8V_c10hvJ+_@^^v?5HZez|%vX1LV+ui@8Uz|^@eYS^j-|lNZ)9iM><#yv; zo$2fDyoz^uVjZNfHtoRNrtMHpd!B9T8StoWHI6ZErJdXp_3R(Yy?)F0y8kf_=)dhB z+TU5~qs~mR{{X-7ou^sW%ri&scM{*r{X;pAMQ@U8gmZm&@Bpl%ZgcH@5$_nk;vBxO z^J?w$%Y6s83CBF_9P4!)c>Bdr95SBSUqMy>&&L((+@TGZAY&e8xx^p+=H^>vOM}6T?>p$iw zV_Z}l?p2=CUSI1~I1+6_Z!majz{tnEq?}n#`LW1rxo={9?xliP;@N_ela+gk$FgN@ z+oRh?wK2L2ZGgtL?YSxYB%Kru!@4F-itmJ6lyZXkzinEht@>0mvdvZ;M#zt|FOEEX z+Z^H>w&N*rb#hHK4-VN~I9$JWKedy3nz4Nh&|cbj)g~AJtEIh8^Xgx+9q@|OTX3#& z?-%c|PqyhF$FkfvigE4szmYMMStsLK$A7mG{~h}v{@cGK-qZQyF!rVPWys<2ZQ#c< zOU@~Jg#YdR!@2Gn&mGP-f9oFN`W8>+`|vFXj4uDH59Tiay{F=Lk+%rHt8=vXf$@oa+PRfn@Gryj9Q`RpT!gS@hgucJiagG*_H3piz@VbP}JcEq9`h>}chQGqH z_zv%_DW|1BY;A{-|51N@&EI1hyn1EDIaBMnupJVc63_bRB9r2YaeZ=@ZX=^E(i#cx76-wTKoI&{_);!j*Z3EkQ zieHoA`SnXx_V%L@NXyeG%Dd{OJR{{D^}n-XjC;GL8{d;-D}qcLMHmYDvI z%j8&vmxauaF~3ssMU10;+&HGU^kq56^a|1aa<^{!@LI=c9Y?g+nf90Vb&IyT|8Hch z7SgCUvp= z*5W^h{b~9~SLq+zq`$t_spH=8nGzQt-zq4Nj-h30?ByH}&Aj&Bz#-wk z^xlv|d2SVWFl(MSU|bo`81a|syN|Q8w~yy@^5F+QQO^asPal2IQTpgZ?w;mN)C0_Y zaeda59d^1{`8&M;2)TUklh~f#9lGh*KlOqR^+Z6(sr0X!20GODkVbjRU)48v@@`^5kILnc@Y_2)<(DQFJ;rGST1O@w^tC8#5XZvp+wpaZ2oEa)8e zbQ}Zdhv!SV=&+5D5Bhh`(R{Y{*ja!W1M3m_?U31deuz2XHzRF*;xS|RTz%-Xg14;z z2>!};RHa?`Qt8UemTRwAoQ!C34OIj^$ke-toZPy`F!(O(Y@w_ zKl1tJBTFftaSHIw&j+s#e8BvsK3zIKeBdknw=0SKLTgt@Z|CYqK23F29wNB^ax9mA5dDAqO6JG>)^;1lvPM4J^fRkW z#yZV2e-M1&R@PG+_$Iaybao2pAuEHI*=C{S#0uJ@oKBL&8Zz?)lV!7KU+i}3S?}6{&bCQ?pZGN<6@BZ?j z1G0Pniul|dR@i|XB#}1#9Uj>O22O3SJC-J%o%8L`k|EAm@}!p;*Vk< z{5;#W{8hJY_>Wqf-Un294|rw&?-9fK9>>g7A8}TaXT*(NHbgnT%W=wl#_-E}e6Gap z-(Zx|e@uP$uG=e}dx>VARX0;+;u=XDsjs*z>w501!3Q(#@oJyj7|X`MF4PHpjD1_k zwEACN9OKjeA3DB_sZwH^SboabSB{0z%-9qmixj^~`%|7PIi-H?-gpQ2Nx7Q=^W?i} zGFEBytMiegSdahd3nDyd$uQ`9kq7WUW6E&-kjH}V6rO}Nm3&uu@r?_Y`?ZVj$P82P zowenz7u@MiLHlalEE-+AMeD5SBqu(a^`z6l+O{szu~n#(L_T$rfKObj`p-%CSkJe!H+9_)NF#bH6OXB(vN;G_>A6D;&@Z{34Y}L!K{*1d}mB^oi09C?$J))|K{GO zDu3U{1TTAokaL-5_4ORfzz6#i6VD#pigoK>tpW&{(q~a)#f(NQ>gyL~-D-5uec<4* zkgccdXf7Y}1Z0@J4~qO_lh2R`K9cv^>b}{@k=M7Q_;t;<8`8in-<`{QgpnRRQu#wx z6TIsZK(zJP7(nporvi^4A3YsB4>H{>4*){m8L%QCWZ%?d)n5%h0G?rbKF2OBuNLYQ zTs(Lk=5^plf~OA^9F=&G=WC6QsgVylG^_Ya11CXD*}uQBR;y2g6V zgGUfXd2LVOU;MAvw=4Pb)t?Y)w3l%k#*Qxm+kWb#v3KYfZ9-J! zkb4-N46xJ?%&E%I5bxm`$rkPX?(WOdijNGN728PV8HD4MIqq25+wT`N5j5zS@dVrA za5eT^o%xP~CAi00J^&{s83Cv@ z+xm~OU-C@kW6W*u!26gXFK_Y>m>et>?F{sWTUYn>=IbJ7Byor{Lcjt6Z~kDzj&RmZ#izsVR4-OKgOIwJ?3 z^Q<^1aFC8<%Ydb(MK8=k}@|ak#-BCKk@dxm&rv(J@}Q|G;>*)2N@j`0e#ge-U(l zPMbh!@0ZgqvTk2vkDY1QBOxCF?;W3G=gW}B7^W{}Imc;AhB0qxGIkW!t$h^jTUgGw zFrW7Mzjy%KEN6y3>$T6n`)FCvdxrGwuk4#o-VS`-K6ohBX1SwqlGYixzt1rm+t0$& z_tid|9UTjHls(Yqp=$!(aW4cM@g3;xd!gJD`s}mz%2RqS@l`YsxaGZ)?-5)j2pZ^t z<03O&CDQiS@|>moKbC!m$A|Hc(SF)8R}1An*n26*A@&~WxexeW>&A;;^V^pzKV_z} zS6b#K<~R16R*-un;Dq-`?R%r|Ph-8N{bgtRO6m4J(HbEi0N=d_y6g?r%d=aawGme^ z2YF^W7S1@Pkz;#$zHQrN+l|C;pLMq88}uS|H}x=y;~yr6NIYvzIfCanryuDo~#|M`5>g}g~S$Dpm~vuPclQ+Z2%gbc^H zxuV0(F70vIM)KSL{eRGevF`bs0k#t%`(u7=Q{(s^zJtK}1F!w|*i>Hg?Q492-SwT0 zm1^Jq-;39gHaTT~Z#uT5cysaPcAO!~`@q3rqxrs8{0`WzK6j43ZF0$7wJY{e`i_kV z>zhhfULEr%rW@00kJ?=08K#>%s6NN~!q)%BGAFW}^2wFY@xNnemN+`rk5FF2d|S`a z7Spom6EZesYu^H0vg6sG9dZ(IZHVToo^cx*)vwIAzkM_P)1$wQ(IGnoUIAYnv*vxt zl8rngE;hS;&t=`_gBq`pQ);^|&%Ci@=YIPzze+w+u}$C>`3&F#p(jXu&ocIBv3rpp z_zZdHqJvnc<~t3O7dn0}bt4|XHa$@zV<@!NKh{;!2+D!h8>C*KxtnMidA{SRm|rSEsdwakb5XC=NAx#!tc}83vDPQ-$7gD*T}R0G=l#@t zKI4gSJlp2m^BnbLk0%=C7?<%(=TE)W{`;R3RvF(To~in-(|TvdC64^&+S14I{fFOL z>U2N%Y?iZ5j9v2VsNem6i^f7;;W;H}v+r@cBJdJx@#bNI)PsNza_suys|;?XQaF7ZM8Q99qP6>Y{f&zJkYnOe@8XF^jOip@@C6D0encf z2Z0Pdtd91BKS91`->_d}Um&0DJ2mrTjnw`W>lwU`dqeCktUtVY8|34Aa_<-Kstt&B z30iPZ=&W$o%6L$C*VJ7|YYwFs3Ob8eWvRC|F4i1lDDR=R?~;6#FjnuxbHVe%e{DTL z;2C{s@a;Wpc(I=^cb>PGML#eS9`tI=3;o(f$dA1<$}Zgj5cknB zuTgwp0ykRw5&w^V`hV<^FgE64DSPKU` zi2VpyFXkEV-!bHAe0Sa(WtpYrw}y4YyK&Wb`w|iNsq2aFK%Jb^_}~3bINkf3G6wxo z<2#^>`{&YpZ!Php#4_|5iDNDDE>qy^+tR(+?#k=B@Bq`?NyJaJr+{34O~{Gye&Fgj zZP(D})WK1|oOdQW7F7MJ{n$p)AE#Yfv5XoSgQuCXU4r-jAKQ_Q(|!!NV7{8?7o6*i$Hj5v9AVwjHW}Yr zY=t2Aw8bNHTrbCksxppJ(Vb`foD#Ra8=YqgTK z%(|m;PsLri-}imNUSss}0PmV=3AS79@JB)OGW&Bn_BhWbfHzmixdY%e2Lj@G^Sab^ zS3idS4tP`U4ES23YD`Sg!Li;9JI;E_W;D-br@<(A~Z&8Jc>a zJkyZg7;DY_|T2IPvq-(=9|~?EOVx?dOHL!aMxN4IhN z<}kL^SUKbijN4exZlN~cSdnnta~$JxKI_!xo`TT*Z*Oz#Hg-gPj7QEv^O-x44xEg0 zzF3=}e{+Wp4rfQSHA4E~HIW9c(3S|eN_#oLn}#so@0Kn*#w^xbYfe2!9uwcc!*Qh@ zA)e_L>r}Rc-Sfa>NDF6VyG3_Y{EUFl%N~j{(1C$h=DTAbgE20;?SUPgm&Y21p6J@m z1h0Qu&@#q@v9|HO-gB;huF@ypD`=bZ^Y>EvH}zu}C;O{-|9RMytY058iJ*0hlu1$F z_CGHTQu$Ak@$4&5EpP(!Wjl>=SyX$}YMG!(Nc;Xo-(_>q^2$H-enGBjtnCv&R{GR; z1XDj!4HxaLM(R5&->>-cA5`y^=@R~3ka95Qcc!hG_MW@kuQ=~y%AfZ`!RTh-17juv zQm+6={|LZCH9n2QCR9E9y4|YzZrrARmAk_p`3LJY$J zGo5>x5}U8+%ONk7eZt%=+4Fg=+s^MFVms}7@!AHletIP!lJ zUy%QE7t4!I;)F`+)NOdbQh#MF<)36cD5X&eBU{m^HcZTqKBNx^1`?HjiAeIcYy}o7u^UPi+$H~e2#cY83i=4 zfA5l4_+{>$V1HH-J)K1J&$zkDd)X-7y1P`@T`+_%rPgaONr-NapS>f(#N*h&5x)R10J$e#(1u6 z{|ehGXI>e*xWu*2v#k2}qgc;pS`EiYb!^m(aY}uS<3czNgyTOvl=H$nsN=j3UK_^gW-H zw>>ps&;g_e1w99RF4jMI>T@pw27S7P`Sm%DWV*he=s^9%km1pf`$cc+|Cvwe&(0yN zrikakcWR+C0bb7gp7OWqueA3^SG}+FFIN#Z){6dtFMPNUVRNzr0D&ua2d>1o0G~4k zO8bA=D#aSd-Xzy}+4o#J2>DtME~AdQ&tlA%{SW$^XFg@`>HC#l?}vKW!{og~e8*Qm zGOs<(N4%$gOvs%0?ylb=T&%6YNBLjUtzrN~6qF{RGVXAceE zmzQylo6`x`dYr#7j!%3K&T$+Y$$GWCzsT}|@kf68z=_T{v(Nb|G6ei@s1w6lvQDCJ z;0yX~|I#&&P}=9u=5KkfTx>CId+D=P`!J<%V)29j?sT^2I2P99H6J=K`xiDGL-8MY z?mgc)aJc84M)<~ZM-lc4=5K9$t=w;!ap}#!O1$!RKDNBpgZWso33kk(oo3B`18>^w zEUSzSK)m67h8lnS77>T;JSv~Zno2+W=E*@%RM+zub%nPv|G!li?@yhteQ~Y(jrD6E zfaGr(-)#?Tj)n;XF25u`=R-*?G`zdPmx`*IrHjMcWG4pr(`(Cob}52O_%yoojQc&C5Bs`Llr)kdh!y(kM~)&WEaJ7i$38@ z{D;NWmhB$e?H$Ila{#UEwil@VH8%Ls7V^_(qN8K}JW~u?$)I7-A@_*q2V7@7Kdk$V zQ=@o($fsNsww1x-k@nq$}ftOyl1CD07;+Y}ewy2Kl$5>m)AM!8M!`yg%Cl2@?KkJ}H!%?5MzrcZ~f6{ZK z@8f$M(^K~oVm;Vii}LWy(2wuO`t@nAQ2kkhuAm<22+qdSH?qFxv?_P}u)SAC8s((d zs88GgWPGOialS3xQ2mbC^xWN|8@d+}^gLtc)gKleldJ?@o&3ARJD=_vJ} z4bP5&o4ltHxHqs%_07xIIUQ->==!3oB}Uje8gKc@;5pl7U+}4(&-jrq7_aXWIo^r2D-jhQ9mpor|0sbLe zubp@v`<8OH1R6-Y_Mi#)&w10{N#|J6FUW*tj{w;*?^JWVi0)j$^#r<4Q3v+pO}=9=2EXNYJ&<5o-*%aqpgj_gRjB zjFYwi{MK^bjQnoAqGcO|_m3IDHoE(VIFD`2BRr4ysSa?CJ}5D^c%HFNvEErvbJD#n z{ntE<{XgakZKSV^%47U6H}t1z`O&n>+z;S7`=K^m-pa$=l)mHtp&Bd7q`osH&vJCu z1=>u0iT?211@D=52J{88G|vXXw|GVcnvrKF;!l_d@+H7Cf(8W~2^jn*_zl(s@16xD zzX2TOzHC@*N)^W%eaN#QpTEi90ezzE3g|PUJWH!B{1M+(_=V4o^4zX=g3b+j*P&sqa8bWiwZ#)9&<_imk&{;{{p>1Tm*pPTX?V9bA>N%>sQ=c)CFmf~}w z3~@=Yc*0b?jiqzrgc8C(LtA#WeI>;eEMg z6(0lnd4^i$eGX+VeMY$QlISPq&}Xds1f9j&*HV4TD&gz0BGQ37mRT-hd2`C~0HKRBF7b>Pv~Z#SARqL1K$OFt z%V)imWq@mp*9FLPN0if78fnTnfV9C2I<9`S&TH2mH!kuncHH|-TwAT+TJ4d) zqR%0Fya{NW!+P`CyyMmOo&x2-v4Vpat3GiN&l?xZxlQo4|ALc@3xV}aJxn`J!nSZ+ zI63>yd~bxN_WxdQHu zvTXpqjj}%S@*SZ^RcuwP)oCWfdjP%my~guy7(ZLqD%Tv^^mnCQgWEQ)^KNCIy+8jo z-%)U}&!3c@Gxvi&d*5s6>`Tyi^oesEb9tE3oKuWpeotdV=@}ctgRix|ues{7N}s*F zV2(-fTtC|ZS+np1>UXf_xWW}Ao zrCF8ceI@9>>4fJn?-}Xn7@V<@u-9SCZ}75LLe>wR)L=mDcexh=d_()f&h%H*-U#(R zioFe<`$+4j^W$suJoilaX7j)S!Bddto+;oMK37{}AwcYP4hcO8_OZVE%l`V@L!tgj zpQt|V&w>}mSR((?kbwa+hK&69QBHjr+ND1~(&U*!X&7~^eDd-pKx9_p8JVy1o*Frmv*KobY(Z0W0Q)u_QqgCHJsPxJAo~-&ccrI|d z?9GPry#?1NI9cgQMhJRsdM~#6^vK8a)N2L|ofaTt7J!a;kGAP3J?}NszE`_&4wd)V zqd^~GI`sB-D(4;zyg&D7g)UK#ioMtpOR%2yWT2b0rN`PEvZL~k{&T|D08xI-eM%pj z@WjoOJ}K5N%6shPpp!d&pz?j^5chC1x7PNv=b;?^V7w)~m+>6{M=zsx$DAVQy{Nnw< zYm5o$KlX%&=sdi3#N2GNXN*12XVP)gZQzJ;YsSD$q$xMTKb!Oy>EY22K%p zM?PnpOyB48w(81$tk>B1Io9)?K#i}?MjGGmy-WHB`3zh4v7r3D!}xs2O8@;X*1+lR zbzmz(eFf(5orzEe8T*o;{TP$kK47{z&~3x7=i4=z=VxkX-KuBK4*rEPdRz0_Tr~I= z+F0)vmbczHInuo{E(PR=zeE~%nSF4)-`b`Gud1fAP5MCm)%s1b???0!CRZKOgfxyeRbd5mnRQaz3fxX zcgLnLXr23G^u>L1pGM*_%x$4#*_Y~>d65s?_rB5gKBha%tjy=^XV^^pl(G)(Km4-l z@!WijaI8L0A3j^(aReZApNGabhb(&n)7AJ_3htuutS$~5LSHVs7I1w0!X7&4QtStU zzF}O_*1C4ma!ONYh5aG*b7(td1>XVQT;Oih3%VKmQ_u_UPlK+k$mhql!Nwhk?|sX% zaxcXq*D+mNVsb(6C7ub{7k%;^y!IEQ@twYJx9>2P*XKS-Fyq&j`z&rbL;1I94OTnr z8y(-a(J_$aUAQSI>9&Zh&GhwbMJSUp=`$VPowB1=FXf`PU=)eDD(WcT$$uGoFU;zwPK) zKKU~C&98^N5BTZ| z#Mm-E4shqizbpTzhTzX#gxUuKH~NoKdd=wpfkS(1E!A)AulzeV61?Yi!TWLyUseCB zi4JCd)$2{c>5dU}oP?Amt4-%o{`MhPVLmT=SI~C^=NVpOyr6r)y~#zB8HQa@a{S4U?_HAr%Q?bpT94(vci;2= zv2ddElet*Gwm{Gc%;iD@1Q*p@)RwqbY2TB6>>f(nXYY~d1J>g6CkT$|O<12!xKy9{ zSk_kzN8rNF52}2RCzS7dz7P0D={utx)XO;Wm1V}Q-eA6b`mi=HPFeCFYb*bs>UVXW z*6CRHN8k38>KPY)noQ}RVyrP&9q$WHcpM;Pm<=8f^u5K&8yjCfqs`tJ)kPbytokCx8NAN8bdGS9>vYbeSyuD9-tR{~!?KaF7O*C#6210XW!e27sBB8j zO_l48^E0*Z%=d72bo6WK{XW**)F!x^@2M>#Jgpu4sM4kzkG`e!i#rOMZcHEF4IJnj zxB|G`p@8V)pMFt#&lLstQTwgC*|mP^jBgCNx7v;Ms$N$KnoexnrL=LPob3zO8$^o^~}@xT;sf&;4sml#>J;GUDo%iZ!4YgBbuYWP}+Agzo~sv^Q{|{|L*LB!hw8u zm3xfMj%QhkF?>~gd(h#DI+{}-#Q#md&+&xMeud98Z#uiwEpu>Ej3sDe$4HiySjQK2 zWnJ)7#y>}$>6TU9FP36ibN=XWyn9mY(KSc4U3Ot!&GNM6=h3SmA9FWblmlj){~vpA z9{=^!{Ee3-#rt)ZB>R>mgzP(&wIV{uQjuiIntiP#vSf{{?IEOyBCSfIBrTStgzT~; zYq_5@b7s!FPjy|c?|onQ7FLtWaG4ay-%ZC#8v4`nSTT;!VXLy=N|C{G z-i*W7Zhz5bC4CDiosTVj>^Oft6Ii5o&5A~irCg0={1oZjtfr}FOWb*HFrVu-P+(eL zIDH#volBW+Z%}VbeF^!{vxn`)E?DWU=_^XYH>94x3TG7k>(m#JqtiuxLQj#?@W25= z*SF9YP2&Hymvul@`G0%|f&ECQVNB?m$Np{Q|3@_#l3W!Xy8=i5P7uB7s*6nO9x(d_ zO}jv%ORnlc*I*#Z*!c|+%K88^kXxI#WlwWRDZDQADh3wL$3Aiyw-J#$C=+ZOMQQl^o{sy zMIG<|h{MCD^BKl##m0)WXue3gdn2HVpYv+MVPC23y#vj6uyNG3p4^fDv;J6L>fxS0 zQh1jB%JJh7)c=(JR_QHy=#x3uF-`5>;)>t+f6-a=U(qFv>xooG$WGFu#ry9GpV}Tt zSGx^GPF$@=Io!1+J6UZI*q@;f)BOe;3sl?Uiew|KC30C$9x9XAqTsN0W?7)G-zNEfyP4LUhW{oPQK zYZ?0%c1=y@;WU_^=B~w{0dg3%A=)7Eg@b4D|L{>ShV+i4`s3Aolwyx3Ili4!)jh3Y zorJEoV7lWj;}m;3mA>ONZG4_1YfPtpdsBIA4Y??AdiJLNiPFBlt;F+ZpDp1tM34IU zXW>8kQEk89j^*&6Yrph%UO3=Nq3f9oJ?DP?Q9{=<6+LBKhKCypoqgS-Ul&qeK;D;* zXS(^?sJB4=SKOQ0L+0^#u&gs;qXxpK=LGcKfSa!tx~>hU(R>4aV(00x&wMG3H}qHB znxU_tv&7#x;#}9A!)Z=;-^mzr%SjKR{H#MTKDGQ>j_auY&`U$xFdygBurkx!e9||t z?>6iKNafn5QfaQVi|QmjpIGd0C&HnR_07Zw9+dyQ{{*`3vn9Rlwt9raU9AHJ);V3^ zPR|3PuBY7~|8;-r()H#46*5lUxDVz3)SHEW+ED&4WyL($O7w>BFoeVH?J0g62H_(Y z2>(QCQ~X~f{bX-1s=S;e9zDKS zO&1*`-(?^RKZ_2HTfHXfA94X;Mf)A{bnk7TW3J+NCaG-Y`IqC+N3BJ7xMdehnrVKE ziyp>*$`3NR{RGC{)%_Xz@9zLaIn$ex;SS=1Eb@0Re=OrL^I@}Nb^M21 zH91^hdQZ@7_v^kD`hsx`EpPR~qxa!YYbxRT{rQjM_`g5#7J*N-Vi?zIDexB24{BFa zyOsERJNk0#PnoBo;ELpB*hw&k^Z2 zOZ`TPEV*Y@c6kHG8XPF2W(dx~3UaoAb7P|HEg?|DIBI zuICK{KqFZfUZyQbGMM;DZllG)_w%$iD=yxM7Jx(IGwa_Z{HD4zg_Z9?*`HOQ}0ddI@9KCJvTIh#t+6?nrl73 z6@@*=5<9jSLhF}MuPBsDbXu9+7{@j57`$tGmqrC>o{1BGPIEsgpeT4qAcLX3) zX-vdLqNAy8SEiw#r_20g-*@!>{)Mk_UV10r&W045Gri)P(G6ZIWqUs|j91aTL-nYU z$B*{MrxQWP_~)}@fSRX{pMQ7`MSalO_wmKl4ro)=*#}5I@vwcF9{CIobkm&s*8%yvm!(ZRbOD&CO>Ua=ZJM?{mJM&wx;0BQ1UNAoUmRIa^z&HM>7U z<^a!UvM~Pt>cny7Y!sz~_a8pmjA?qVPtM&TeQirF3)b5IFwOY>Ur3MUDy(s=Y~?ui zT;|Q>JXLQy)yMi>EyZ)Hm&cMF3i%DUa=f@V=~^m(dAeKXdxPIx$l+>_+FiI$X#AmF zZJn?w{$p&ZPSX2>JoZ4>ZydIsl=;PcLM?p>@uBl|UCH<7VVCmTmC$KxuE+U>b<$j% zzW>=7UtL$H`-LWd741rWd#+VCPS3u5enz%J#dauflPp7_`Gmxay%|1RiLeTC7S?=6 z%4@u6gVYxl!$Kcfk5c>D_s@qfLwvNyH={V6*o|x$Dj)Wnk}mXL&tRTVjoKb#?xe~B z2fiS1j_8$m<-yFyGCH&;<92W27+N!7j?r((>E6OhX{tT1X@4!Uu5$~OOW*0zvsre= zmdl4etawJt&SV`_sr1|_QjTV6&eOB=H_F^nJo<)&KYkJ*#+04`NPg{$S#Jvc!@~rA zOLHCSrDp;*qqagn@fi~Ig}(En?;kYoB;k6dzQfbkAs>hrgHOe|m4- zrFFQhlc{eZ%lz#fJc-w*Z{{4P_gMM9DAnt1E(@n!SL*6(ij0O6o2M|?-qX@Jd37Jo z!;g^pQT?d0?ae-c>3*Qt^0K#tIa1Gp+>~7Kofz8rlsdb~f1N8T z*ss0@*;;5%-Aj6EC;6Ys=HDTqMIF`l*6&kC%UBD?J}Kcp-Nw+qM^&5)TAeQ87kmb& zdyCZ8(Cg`5fwTkUfc?pq%Y*hM=6yZ~2)S6aE2mfRH)7Z`?+w9!^w-3(O!vdzW*CnA zM4+w_zNPVi`lw&obhm)_Z`0WyTkq)EA3evVYXiGmM174jp?Y3R&jj%qe4NwLdmQ?P zLL=%s$RFQRhMpTs@{YFGGXCMZifr>bi)8H-5cb835;3kyA~k@UX!ye}I^zkVn6IkJw_ivepHkWwt4V$|PW=25PK(##{0$E0 zM$^8u^ex5{-*JcBq_}c75q07FV1PU~0rK4&K)y?ebJli;kmek`-NbhRVN3AcZp;yU z{|R^9`0g9lIV;?G1D$nqb;Ly(I-JAhbf?h17WzQ-(XZ#>KjtmgIq1*rXpKi>1?4@T zbPZ&v<#r5pFIRmqm+QM?Gm#I|Wtx6^U%xzE{pO(eox-eZIQ@7z^*ya?=xp3CfYfG7 z1g7sBx?gJFBX0hXI+aAL7)qa1_?+r6aCzUvllG?=Q$=Gn!NRL2&m<8%Z!UYt9Vq3qX+{`X%z%QUfp z(XTge!v859_sgxq|G;s=GvFq`6z_p)LfgAGL)lZOFpNFbUEh#>0hwYw0l(_(6Bn{U zW(bvc#@7OQucj(+yqm*uv3^Z)i<=rSkEDUSvgg*vf7~nNv;dzQjsLhu$8V!xU+ln< z_>ViAtH~qIqp?eQp>1o^+zL2xbAfzjKHl$nP1tlbSHpb8zOv;iW#HL(jfT z?IHTZbc~+QTcw`|#8H0^i;hfj(Z}h0vYs=Rw-3-S%nREq*;v$mei7Me(4$>R4*(80 zn$rnO1X4YVbKc}INf&*=wkq07c~iN?R{`=#apR?PIUc9W_c_YK4wbow>RXyJzAR5_ zyR9qPS=%FM96{I3Y!8UM(;IEJzuZvbI^9R^cn|Zt zoc2V(|GkVcc^?5fFttnknCy9K3yh(G(pGNC7>*-vJ5U((%g7N-b0@9OFr+i&`OLVl zRC;rJgkj9@M*@vF=dL6F)7Et7RNyTZNgjT? z$;{(Vr!u1s>8<#%@u5r)jZXqZ*&j&loyJK#^*81xJ*W8-U+IlMIbJb>^c31GeSdV@ zwNCty!GyclH)5J^*Pmfn=a9sMa-{E$aXj_inoKX+H)dSl7QMR|X<^S>1F91oGpuf}kPq!WEDzs~hOPR+Xav4M7 zv9L+Ana8Jhw8A=+hNR>8ehm8OC#o;TfS&hEyp&GZ<3SG7Ggsl~D>;6wCFSKg_rp(^ zR{EM~7~4DSBe44c3@y%mk^d8q|4iy0)7dPdY5edGjpfwF>8zS>^k|~dz69Ax=u1A| zhPu{yozwO0$hLrN?tTY{hdmYx{9VQ!=c{Ma4wW&(=ZU`hgX0w&%HB|McCtz8^kKT5 z=?VR5oe8jx2>V<%4>x$>nC#11j@w`xzy(EwH%|GgS zpfo>HIf}Qay-6OnU|yoRjZ=Pn|3muPotwrM-}?|+IH4!UiQ|T*xER0bzL&o@*#w_n z%VA+R8Mk^rir?~JUXLT}#K}&Duunyom$rO(HF5$X|X8U3fNm{xu7QU2riu?Q|d02W_ zM^CN|8f5Nlk}*L2KDrj^JoKx67fs(isbAFQ(Y;GOk0$p(scbkqGOD?xr)R` z(YL(j1=MqB>Wh%iNkI1X{F(YD9Dg~|!?^8zE+Ay}HEM6z0gDgf|MB2n93Ic2`2}`P zkB6Afb#gTKpl;7fT^+BVY3!h!`aa61+u=XTvy;eNaoq_VUw9#Z`h82+qWY$To)LdO z&C`F}#__^~I}3btSBCL`RL*WP|H>If^liHLPUVwzJL=dl>DrIUW*~imcO-dD1G${B zJN{$t(>1=XiPw_3$kz1DX?{REr8TnV$NAI|z2PVC$LUKPp@mng2#weNuv<@~xtPj8 zKB?aVL>Vf!k+#j4JrRzwY1_1!#Qb)adNpkm^!)1&GzX&0y6>>cHba@L&7g17-cha} z%9q+I)A0Sx_5`4hzdBp;so#tt*J+=3g?6K~Bhzke$+Wmd-NXkOO7ms$0Q@|3ZSr`*PW)f}yT#EX`9F`%H0KoQ zZ4KW;#z)v$#y6F<^xBckUkrPXp`7y}*~U6Co%tc$uYVP2)NdH`XOLWD{OK8=;nL>u zRY{9%K)Ywt;(Ctf6OaG(eEu)*wNXBh|M?GadUghg-|WD+zWzR@b6)es&Is32UL*$% z04YA?^UK#53N4j!AJOS@9u0Ro^j<)EM~(aLmd7OC!kP@ZJvc4YvHEn-(3is+Fy!wI zb7Xv~zgCydZo1dj1`l*FzXy)`+_62!@%%2nl(9&0_04d;mzv%glXu54HuT-`^F@A_iEg)d$tO%iIF*CSgR%6Q%E*usw6j|nZRLiIJKl*L(VD8iR(X~Ck>BDr%2kp|fHmAjD3?m(h_N`cF zP4k$8Ib7;osb*eom^y5kYqD@acRKhFX(;2i-=z2eAN+0~km`(fq zUhm(mbqnYiYloBl0$r&0Z`!}Z{6Wvx^%@|2FU}Rd&z!(7Mc3P#^?Hu3>y8{AZz0_a zovQb721WeG_|-Qr-WR)J<$F1hUzPjI#Kw^R#J)~Lii5f=9LF$px|1Q*qcl#^cj+Bj z&-Mm%`8o3v58~}NjdB0cVG^HhfwdTSNA(c+^_ddJb1j9TPt*D}Ts@J);zkPu-bM0H zJn-Y0&dtf56l77)&FMRxdSBCx0zdjS?f-;klqTAL>?A5=oI zu?br=?PKenlH`fGGvy^|qwW?5-weh!2uVr z7XbYqHc|e6LgSd~0bjW(uN86BWi@#hf1Sf=xQ9D1q7rhe&R9_KXkm_)4lm+j<4VT9p4{!s!o!-~|;wjKk4oyqH?cXZn zCG@7bg6d6eL1`eLy*}kQA?>rR%!7UQx!sw+*kQIny~i*`>fknN%XBwl6NX;zEi`E) z|I_`2aGK}>%VV&}D9MS^2#eS@*8P@#Fk@3@NR+=2^^> zY3Lgcm+_-{hYP6A)VCP#TpkLC4$`}amv+E^w9UU{1U>DHt*L%w(E$EK>YeP{;F{*qw@SK9DCE;e|SIU$#W40I)%S|Lr(a+ zG3v?Ri!mM#@5kYy|7*Y}C)w**tMNNin1A(sbM8ON6Ec$gV-+VqB56O7=Kb%l=D6|s zHcaRKNIpa3$JBl${2*JOzris4aT>#NT5NJ^qG2DTD~$>0A%0UHa3yJtyar z|621W#{NvvzO!je%J|i|ZmP_I8i&_L>gPq%9Y<|~_518JCbu2H`I#@*38$xYkw@#F zILr^d9FXdVHcoz5-C@!$?$f)OKkNA154v`?IU>FPM)eHeAIoV=ACL?ozdgQNi6-y6 zLiV|@gfGUoR_06LaoC3(#(A)x)rxWZu0HM=-7IcVb>2#R#S;xyqWP}7u0(U6(%e{{ zFYLQlS};w&v)Ox^`hI55HxZ7xVreR0+8fH>rC>vU-W@!!zxkUS5E#KLhUwr|)U{PN(c=R8MF0U<>FQp?2p2I&P5Yc*l3Lplk1= zvZMcQ>H~;63>BNzk0RRKo_`kz1|{pA*GeqSf`_!5DqFHz2;# z@w@3&fy3U}<4KNh?`EX4rBUwyr8m~gdG)@PJM>}1Ei3bGs{ZT#@= z+~?H+F)sDZkaS01c&R;;E=_N3*jpNp{lM|`%?o|If^?kblX03mpnC?24Om(tBJ6yN;>*J$h?94pXDjtNpOcA z&2ikt<2lSNY|j6wjQUQh-bIja)6^%>WhYWv;Q2-7{gv+|pe;UofYU4nk}id89r8Xy zpYAH>dk~n9(>j#*TCUzr;^~?7^bJP!rmsr2491n(-cOOPMZfSjR?&sFKE1Lt=gD(u zTC*}aKM**C;E zye8E1;C#mdJjwrA*qYKue_nJ0r>FPo!?$8*L_LT75$yp`UN}db(y}y^*A3;gqTVUc zxI@TJA(?|5>Ai+~X`Vr!)R(apEq(N@zUB1u4#J~vIo)$WN(cRwcsR}9hB3W(a6RF# zu%_ejoM@zrOD~cw1li$taiOQvJGXM45xV1Yu?N(5j=j^`Y%|0|Ki{47Wb#!J-36SU zp0Q*3)U+F>^-ArRna5B1iy@^W`9r^@{3)K|PUCHRzQlW7bUTf+pyw#lx1aFp2+6+? z*@>qgl=8ry2iw+w{A~qw<8LRBpY;96z8jgX1=}@!7m@zj4r!r`cT?KXdAn>Xd8Idf zxUPC z4-s7>@8*iU`?pDtLTqA}mI}~K*8PbX9o2G%G-NBwKHZQfU^4dM~cPM@6`0YuTL4QmU z$m?ZYb3aRSJo@vfT7Zz5qrMk-w8%sld5Xl{pZH)CJhcrV^$(qu6x+kzz}GbOU2jec zX{Yn+q*t8syeW0Jwf#90I3GC!k8-3q`8yr#IKH2NF~#>20Qo)wAm1~9oZarYZ02K> z&-tVNd@i2KjPst)%e-FHC*1@+)O;<@x45w<$F(~RZ;zD!x<{dR7dEfWbf2*<%3*s zd0>~WP#)0dK7??{i|&>@Sj6f2(?}14{tW4Nf?o+tW%J8E$A9RSDWjR8BK5~NaebHJVzhQ;-yWVAB`9fcre63f>?rmsUwJcNX zAPv+lmBD0JW%fLp+o3l&Pvrg0&YWjXyILiyucpcMBKfEK5WJY<1WmKU&75Xj?@obM zPTYCCQ*@!PmvmW$w##WspIMrZlsJ!EF05gff66qU+LhYYEta;{cs%yblJVl!lr^L4 zyEm81`fqt%PDk=4+a34RKG~XSwhyQGdeZ$Je}S}{A3av$x>kT_$H8ASj7L8BG;t_WZQy&7in|d(=VniW4i5|cOcn9o2R{f zzwR0Q-`*s8N#^136_p+JSmzvp`cCPs_wauT3#b1I9PO8QIo%$qEsYOz2A2)GXbagZ z4Ra(O@oV|~+|isCrRTVe7~{{jVVXZmAcyVtAk*B8{UwacPi=wy@*&LuA!EPQ7r31C zC2S)%CTJMhEBIgWOwgd$IX#w7O;giKK6)h$%p;WtFt7UF z<#y8aE2PV|bP8kJG^Je}(M`&~i0X%SX(i=#DbH|wl4DMfc+juK} z*IL5q`iWu}h3YSGxSWAnF+DvOMf%;&dAtB;@$p@O{Z9~%b-_`y zIo#gYGT*0@K}XqNS;Wu}p3X4zn$Ixa8W~cb6w?xKdRN?!l`$JmC)e)j6wu|wdzSUCtr60vcEE?{|yz2KdFfZn^hjom?zTT%D=gn)8*{vBbB_Cf! zZLw?hT_Ew*gYsRK=G^`lF~48(CqwZk4t;Wu^sST$W9V(tHK|Yen>}S*<38I7 zOlfjEb6t_oKFK!F{5}|*(m`8Qlf2`J_kp$s|BP0J_=twFc6N}kmYo>J6JKUX`MCE_ zlCZ0!y!N*G#tRY;_OJQwB+X0ci@&7pi>AMEc)_{?dg<%5Ztc|&boinALgqo%2aL-Y z%5>PkY0p)Bd7(bP&|WZfRin!|?aYh)Zc7jEkfeBe9&x323o71SJmDZtZ>99vzY+RM z@7c27BK%Kz$vG-&!}9!5&N|&Wy}0*x45^Jv&&b$O|F-eHSt$&2Is4efdAdK}V49Y{ zX!+!&qwfgTP(@DSiFM%JpYD#eq)x_%1-qcRT$d@XIuYw;hlFQqCgXNh4iZ`r{?0 z7hZI7u|(`+d2lJ6RBuV<3Z=lDqHQJO=DA7e^soF-%{ zoww(ByQT5A)h@!Dc(|U)CkvnLe|l{WFB(%{qJO##1VmZ%O}q%Qf%BE7rfFQ33^*t>W&zv2IyCdGBLQ~C7`zRPcy zIO**eeQPD^+j!}H8`isf)n;CM_ixsd{68$31PC3v_mK?QE?~b$c*FXwk3fU2C=FoV zc-(S<-KeanH~V*?dO;=EvFknKY9(t%;h6yXnIGL(oug)`nHDpo%z>c7)w>p;WVjTyxy5jXIA4HpCAlnJZ>iQ#D0hJ zf0qArE>_RI+TKn27QuRw_j#}{p7wcky}#0akL~lIU(*{@agCmmcY13g9@kgOpk>iB z#r;G+x&8EAi=DP$UOUhHwCq>8KSnX#H@T40_TQ3Dq_F}!MDMIzCgV-d-GmKZO+3*1 zPqhP1_Ner|=R3~OD;4jr^rg9l(uK}UcUoBPZa$gmZsuZ6$8Ym6|JQdK^nDYGt3H1` z`)0)4IY;L=%o%mh=J@8DtHQfqt}Bg6(E&wz3(WH!DcsGo_XTr0_U?Xq_eq3h6%Bi~2s;$OZV1??sj04p})x>`7TuCeW(_YEuxal2)V{YJYYv`|ZKHYEqH`7-# zlD%j?Ru1XMbUVwP?8kh!t*(TdzfaN$=zBfuoz8f(-cI*v^p1|c;p->#M;y%c&wa{J z@8VEj$Q>MN8;tcqzj1hR*kcUkE)Lo_-TBeTs$% zc=-Dn@jz~uJO>E3b^BbS_7F^D8V{F$vLDG7ubxI5ETwEzMKD!N`m&A7C@x*8TkO!aj1LU)Q zfPdU9c|5$((lMUtr%KpGB2O&K=TLrV`zkdUQu!>cWj_o5<1a8|zCmKMg)l7fV?4B` zITLB5Fv5#V3!(ickZHBvs6d0fo%s-G$g^@ChW2*y9vzvNWh%Xus&Au)T}aPB-@hf} zAa*#C|7SZ0XCCw&6n@JY`gRM^*(TRxzmYWbj!}iX)^e8%tnv^%C9jD&S|EW$zouQ07eXqU+=@QZjupj$9%dluj@&`HMFp?wG@71lD z7St!hQerXs|HHPNe{uCi z4AqZ4@9}Hc_B2Kz|A|NTfY3j@SA+HXz0^-=6O|3#s{!5YpY;%q{|o%e@6bR z%*>QB@Hds!J3+>dofXxwl*-9-bxPCX@*7m}0m8g^j#!rmIkq4h7_34ff&q~wFMpSqUR zw_Z3d(21@6z0S5a@uG)~fU`&J382B>ju>@%j^x z`%m+txdLmM)ydjQ{q>*lV(w2mSMtm{l=`aTJo2yWLv3{w%8GvHy?>;&(s~-_=egfW z$CE5W4!9p6(|n#D|J8=#GwPVbcn^T)vLpv9*gdfSxZlv$ORtl>*|x%Y`y?m!7LS#U zWE5kA+gN3S=KNzgKJEW$8UC$JWo@r$C z-XlX>rn$(y*oEsR@7tnn4%<)KYGEUW^8VOH=J$mAMddBkgUW0&c+V1vzlt!;Q)S`b zrS;GFQJ0m<16sPrp!XKY)>4|-W@JN>JqA0Dbp-Bb@Ec=QK_lCZ!bu+}PGfELxSXM^ z0Up>0>3oIlq4L>Qynn~q&nc1)}$3=c743 zw@<}9b=woA>|A zanRot>cQ)a)zp#XGV8>Dg2NtA`_gnN);Rh`cM8+_G^f3)c%bP%kEI10O>G2CQ~lzs zHtqjO9IPuf{gvv2Jyi|+w|W0(yn23C?vs&iMK%QHRJ{vh-@~xhNcN7#(R(+n=PI1T zKc^;f|cn=`!XuZpE^x{l~Ts z-&vsb@($c4zWZN*m_v7H$S`gw`%gUf)466%&%Vd;n<}JNY2J90q277;=QNsMBrer; zb$EGyD4y#>^9%K@wEzDcr+Qq?>BzhHlpd`O4rZE!!8Yf2jxq1OIGpM7CMo2KeJR22 z;Wu%~p51`Mr7iydbpOBD4zeDD?%?$p$ph&Tn$uULi5-Z(=QpW^Z)FTI=kY9KRQg57_#BV*mhYf4?eiJh!#*YYvDDt-3fq{&;*xy`67tD@=JOxuLZ zoW|D*G}Y}%Zv;! znOTQIuj!p7doLQc{_d46U%{*6|9?WK_E{DGzoGMc=ZS~$lP_XlO3 z5L;2(C(j+Im(3&pY24i2IgRr4U`waDkJ?Yqxn*4HqBE6O4mh+Ju_fPqiG7WQKl0~ZTYH>ctChZ_++N6Ff z+8nE=Rb10^+a{lE)Fxivvc8JOA*F+LhMsLsXPR?+;jH6YG)D9MCA<~qD@q4@l+2s= zhwZx@r%&%5l4_Py;zAXP~`ZQnvC+YvIc7P0EBlG+{g4KYgTRpR(z7F0qG@=n@@wW>HfXhc z;UzjBAZ2jFzcbvgxg2=X?Y~fYWbe^4UQQQXCv-_?WuDc=rM^U4m8B{BlS0?MN@+Jr zTj;V!DP_?8O5)Ky&5F3}-B4V#-v*a3)cqXd&G`Q$d{uG&DXl#374g`)GnbR={=b2X z-k`Rkz2vzJ_1qz)t+fAhIQCB}#G0l zG+8r!p7fRAC{~@k(6{Rn@=#7=>lD_yWPCUsEH^(i*r5%#~;co{LSNAuGe|5OZ8}a;~ z#YM-;_z^wn+O@Q{T`kUglSx1GUSn$K|7UP%=e*|$`ROlbXsHcXi}QLs#a#(cbxdn^ z?%zWuTU&+nosj8_YhUYLBj$7-pOVgh1)o9RxF~&$f89??-IIawWk{5qNE z-{SZN@Ne#V@*di1zq7%9tPu9E`LVZGfnV>G{&(U*N8VF54$}8g9tW$z)t(|Axnm}-cBGc}(WQ&y1iYI5S#HVp$+rzA%ir4A9>zeqHOwieBN)vP03$$N~ zeAXB&u>Te*4D~vsb;cJQZ+Pq^aVV|Qdkc(STp?!~Igbt2H@ZLW5yMOG^#V@iz!;sh zgkfm(xrMtLqceV1os7RgXSQVw`r{5TJly?T#^+BkJk~!yYrCEC_{y~AmAL+=zYGs|<$j2}oNe?t z{TjpFnLhwe@;mHXqx-&{3=a+O%lOA<7#?p>c}L$(KiufW#0w2~XUe*e`pW;*&FJB- z8w`&-i@dT7OwaRLY4!r+acAcC@s(N_J>1pA@VN5}8Gn1G;qJ^+4fmDm7%q3|rQM3l z%H*i}DC2QwZf&^ddjP4O`#fj#&>-`N9I zoyU{!lgC_WklQWHJHX<`oweQYy?(%OrWc>@%h0`(Z1$zw@c;19ZVcn~avqOl$DQ$z z@cw-zL+-C*a@qWkdl)@5$oenzI62elSh>pZPVZ&>`m%CPBPOY1Y1T`I7qxTxuDaF* zWBQD<5)aM-{4IAv{4pmm&G-IQ;Ez=ph6WoZUg+2!wKM+F8-~a0*UtE~XACdR%CcG1 zu59$8qv{{nG!tGox*M9)aevn|x<96F#(Pi6_z$@~!bha5r48av?K6Je+>B4_WO%X7 zD;e*Y^Od(2lf1O~#(3QF+^)X2e21p~3WhL>h)zL+~M6}fXU%e{N@TJk+a|askn`Jrkk1sQNn48my_4*pU zG&Ae9Vw-i1UW|X%aL;#Qq|N-|u|^Mf{F(8&=OrBb6nu9C`@nqHBeivqeH$LXL*BG_ zZrL!y{n2k_{P8?~{o)&q9u8`2xLbCy;r{WgAHqRdo?<_UGCte_V_EydANgULXSIM zmGNu7Fub@VWPIG2hPzf-r^>rTl8%3@mhprG4>3IQyD-92nlatz1^WaPdNIx!-T6%t z4*RUjI*hx&L^t`X8W^8HD$9<%;gHJl-6G=&x2p_bZ-U>m!r0;WtRO4=K9$6Atv0hb z?$4!$`$u!z`0uhU5)K$-JmL1;4RA+>IfuEy(%uTFV7hH8_roS=I@Y3||h8J6Q%=m?OWPEhCFI}k&KW$6n zaf8PIUlTvf$BavRxIZ?|bjF1)?`S0ajR#UXxQ{zs`lRT!m}zb=(UP66KLoyb4@1ho*mAp!kIv&p-U3PGI`t#t5#K37_YWU#^swK+jCZH-RNgDE$@t_v zC&>G1!c$z((|BBIi;S}mlayEEJb(I!dK*tjKHVt4Fh}GjUU{&Em)<@n;n|Ew7sJE8c^(aO@)(ZW9br60 zhb*JTtNR$;ol@2wzddAh-|M%8i18Qas~*GH8YMbf%DJ!ccoMPHKK`ri4G-P& zTot$d+30anS$(VhZFKQ3FYWAp&GV3da9rYnob2Nn58c`boHa3pLCrVe=uD|%Dm-3aSii}WO6z5mAxUO23Z+G(8On>4G!~KJ; zGyY}P-{PxY(vO!-FrLy|-xw~w=u;a#QP=4H@LLTJv(_?P-e6B@PR!{Po0jSOm$M#o zC+B{3gFdr#0{fPibi&PN89mk>mvGoOn~K~QFTZBtuIl`Z4;p5;__j~!&Aid*@iL%E zmWp#{X8h&cPVOWf#~2q69A`ZKi%Sd-T^AZIKIJ8^(wiR`y*Rh5uLiX;x<70}#=khm z@X$5OSLw}Mm*U)WjmK3zFyn)EHeCF|OBv!eb(XQuDfB&T!|Gd88VaA?@i=T2yCr*e)FE*Nx@ez#-cU2C{_|NqW z7vJiVj{j`2(LmvoAkt}wbgA8m6LNXokF$*~KFw2}oli1)-0IGZU$iXa<1|g=$v(iL2ifA3ATH@#$F};zd)8UV8lp!;1}zjJKPb@pQh9^=-ok6CF1CZld49^ajQo zFUmGq>Gk18FWTLg@fXY5XDuB!sKdf>%p*QFrH*mS*DYSWD9;fk{8QiCyw37@Y1Aj6OR7ncgF$w-Epa(Z;;dQ_v~Wv!me3whqpI3dc08jh5D;BX^_#2 zv&!a|HESB(^;u%LZ_p&;pFCoCxG}d`+~OId$1z!Uiw&}lEnfK5c-(QhuKGql%hKIh zkA-Qs7=J0fSI9c#tTKJIMt|dR&A-d|;lnCzfS2?o?~%c@4*@Weum-x;A)148_MSK(VdN6Vn0BV zX3@5W(Ou=98Si~j!m%c}LF}x!`QA*6qmMVfqDIzt#q+lr-5vX4!XanhpUJqt>p~0n z3-VYAH>_>+Ftw54F}=%9eY84U-akt1)4Phr^#|p?@OSN>>GMBMICKlYgM>EbcaS8F z(rXVHZ*gW$qj-J`qr1nm%`HB?C2n|Yg7L%-xu1(OH#NHWB~Rt8^sLd{u;8E_H(Xzw>P?byj8}(%X6GR@Oh*A9$9|G zXSwEkg7L)jGk<(FkA3kuuKCt8e)o8tjDMGHgRt}AMwfS$ByQYvjM3w$Y>$;D+-3Bl zdXJ2sQPzKkV{hW`-f9Lmxhn;=K-yCOnJb#Cbk1Css zs^__=7&^&#+%Z7YTFia>y5auLA%=&YW@Y@%n+=cWvqcaLN_^ZRdM zbpO#EhKFlf86G!2BjYc3G`uwKWW$Trx%|bl+~(p#UB*M$G1oo3(Zk}3Pj=xc{I^Cg zhO{%>vA=cU@%!CwbpO$MhKs*-;fd$u@m3m}=X3GTAUy7o+7{RE*CgY&m&y9oc^(j7 z5viQ5_Ba0GukQ_aO>_Ch?|91VVUc~dq4r&B{QkB#3>Tl@!XG9-ZS>gw(~OVII=D1; z9ixkHZHepm)iDRVc5YSU36pc*#rC;8ab&J<@oa9B;;-E-u6y`k!~MRuX8g8O43F(Q zXMDu3hL^_lH{3PdIOAWbeu3@4_x52s@V$Mi2WVH_$S}6oxeVX0$B0}OF6#=%e#28c zKlFj6@As{j@elVjJnXP;#;?lyD{e>=h@=zSuWfkoOs=E&3r~4{Stf_wyBL3XJ+CFi zUwBIM>`BJs+0TT~!}eu*0q?%=ABZHrzF7YIv;K%W(03A#we! zbBrFg-zei(=D8&D+n>T;8l81uahmo6=A@@pmSB&5@f4@y*`Ii-Q{9hp+LL-49@}L- zR2rRiPf;3YJjH3M+c1wjEptWjw8|gWoa|2>^1=SpQ+|_9v-q*yK*LL~&NsX$b;|gu zV+|J{cv|kP_rj#yw(-RWjK3)5wkif^o#u}G(RlnVZ)Nr}8GHsLP@m-X}S*BZY& zvP;Gv?3D3EjSLrG>yl0^JC_-UXIraS?*-#82Je#b-^=E@Bg@*JeY2-D&$=q}vwwD> zyCdrw-F-gKaPh~k<=MmNarm)@i+}c%&gVUi?z`QaaLCylnL~oD!=QggHRten*7_Ew zI7Mi@_Wfe5QM2CmV@;Hd==RS%rT$j^Z zx4q$E!a~F2`iB`_dL`@8V%-CcUbO6%@h8i4-mkwH-Om=?Lv0^AX5AmxU)y-%3njzF z7kjExPqmex!#+Egc|5;yEa9PJnH@PH+sLtc9^3KxG96uQl;u;j6ureV@nqSU`}Jny zafj!&aXnia-S2UQ;bGf$8817#7ba|G^jQ5S!;5Nd5)R$TzT*Mecf8c8__eu~9xMi1jB8Xl|fnDH~~Wc>N6hL>K>vRRybsL_ijr2VPA z#Fx92*YBS7x1Uue?}wH3P3-^P9pm?=J{I3CoMm{Zopo9mm+A40YR2Oh-eb7mZCu7@ zo^5!z`jqdKv?d%pT zG`gShi{aweUD_~=UC-#T^~r{pUYcWg(c)gi-GZ@(`}!(}xDV91Khr}k(Z#X#-o_Wk zd}Vm)rQr$3*lHo;zW7;mV)WZsn7dc>hOhrT)52e6?K7jFr57$%dl&mDK9AuzM07H( zNs20B8@NVU)`|ftn+R`Fi_>!pF0*uf=e(W?wbnFxNIup{*Tz<#B|2=Imri6n4w-4Z z#oE7Se866YyGEO4d_k5a*YFFY`}+GD9@!_l^jEQV)*(gz$;RW@-?{Mk`s*6qzoTV< z?%Jk3)5F#sQuwN9R4;8C;6rw^w8R&>mLu~N{d*dZYp8Ys=A!wp8{K#6VtCm4pp1`J z8KQji{91akyYUn!9Fg&#CK&GSelO$mA2i(WGC1R%jx#(y`=;T=T7MYs<~K9k?{aR& z-^q21?4MlfUV1UNZ?RU^HO28$EpG8sPSZ6QZ*=jAF6sDpHa2?LDz{s>Fv~<3O}xS% zPtQ6!KD(#U#ZS8MxCWWW-CZ{Ke4KTJ-+7kB_0vBvJZzQs1;j7Bq*)sNknt49ADi(X zM;q?S?t!?wa{BJ$UdH2h?wj!&chC5A(H(4uZnc5YW1%({WaF6^jV`|4rEJBI*Bjm4 zmD|wo+{WnshVKmzuQoM2o;Jns((s&D@na*SySuVZbRX9+df2k3;qkQlGyY5i!;3X< z$avqfHvF-s(cQeS4EHx&mGPZkGCXw1bGi6UO?6*07*El+R>ptmW4P-vDdX&mUgG+l zZa2EWA|4z+arb*~s6HqY%B z&X@Ut$KfkF=V5LeCT$r{$?{nod!D5s{>oE-PpfY9aDF|*ki!6c--9ShWqRC91%9p^JsXvtMSB^e;QsImU)U}vTPUMXMTU}U&bFc`y}Hpm+8Zn z6OCRPy2$Y27;S6F==a(`nEUQ18(%wWA7M{5EvcfzjiWSw@RWdm6oXJh#6)U`M0759b^1ug&>}%?>eo7+IzR zTV~x@8oHJ76wPwm7T-N$ba#86Bm53e7~NmHe#YN=*6?`pT*FJx?;awFsMq$?8*vVHUk8UN-R!`*(F?ru9U(V@$>FBtc4 zu4lX@_7g9%SscB&(Ti_J8t(QhlWX>KF8qGVWaA0#f6Vwx7aJbe**N1Tss4iPFi7e{ zdaX1h?_ZRb<@sNItrO2b!F^qoW%PM_>AN^6kJUKn6e~+{RHuYP?|-u`AMic^;5DQ2peaa2`}cc z=H4sQ18?NHGnAcE4ej%~I#$`w@`?ioCLHx3^hD#TrJ~g=kkRYPc?e!nK>E%>zagP&B=bPsXX18CVs7@JjK_C3GLRW5Yi-&!T(a~?Kad~VCw3&XP=8&AmNu=Hma z<1d;F$~gOgmAJ)MS+?CRuO%LgnGIzOhv8WU;|Z#(FixLV*@5n9a&B4LS>F_2RX4hy zoaHWTINa!AcxA)m33=Sa{@)nAWZ&bE*F(D+-Q9AK;eOlk8Gk*?YiPH%(ZdUq3>UxR zsSTRsu~>ZB&3N428)p2LTuy&Q$>{#|Ckzi8=5ZWe(6)ko#=gKI)9ed8<=N{Mi|6)Q zl<{uU6OOx2voB!Wuiz_O;s^Hao$wcOAI9T*Sz57wE>H30W=2Z1nK_7ly}vS*Mf+=QNAP z>l#ndYm zTb3VR`(UH{%W@t4q#i~OHFIBtwl5f6{e@FIi_dULzx4an##204CO3PktYAL5`6J_T zvyL|0*Df1_m%W|olUf-bHux&zZB=fm3~L*`^m`s_#e-dqUM%{-aJOfcJ$LitMi*b; zQkT%SrP1RW=Vbi2Tu1Q}F8sxV*|rtG-$M73*0Q*vZI<&e>`$Y|HTKH*aoH{|J(c;3 z2Xo)KJvT6ZH?vIUhfOqkT!ZqLGL)YDHsiltW_YnEm(A_*ve8}F(T4kpjSUYqazBPM z`xrg;6&sD@q4Z>#zWscG@wh$myy0tQ{pLI7F%_HNWc;Nk^StCco^13`T95bHb-TS~_mV{)YRldS!eE zziN2tmxYEGhh|wT?myh0zu7l<%4^_@##0>HI^&<_{&k(Z7(K)MF+ZgUTACYnPfiC?1;+94av0uiAWEqal8XCPgWJ$*F%d+Hl z-OlK4`V_W^g#Tsbb z#YPV?&o`mfs7!x0%W|+-^n>t!~Wtvw4mQ%kDRNiG7Ak+|rT* zjb7Y4IOCtZWw@(*sOf-kxhb{-Qk%56iYsICMArI!E8IuX8C^@yQ{^>uxNo-`m;N@|%yhGy?lJ z$36}FGEeQ*f3&4hG`ce5pX748T^=yHyRm!5-!7ZOPrt_K;jcWd<0F%eUh03H;RX9h zPxV+Z&ggEJJT~3id5-X#A8S0}nMQ`kqjG9~YGn|d?z`wl}=Jk+_6eh-81$!Rs|ZFs3~ zo^y%@?Tqd_Ka5p8;x$gJBb&);t9`j&>@w5%Ur9c%P( zY90fnzR~C<_MM(&vBwuiclAEV_*+@l{U%QtJ)Dx;Kd?V{NhdbW?NREJ?c3tu3oLHY zqhH47%`n`(r813uR`$IPIBJ1~hf{9N`0png9vh#U@m^UMmHOOi^wQ!F4R_Zy$@p8_ z8tymQKI5aFG(42f%=jtC7#@4&`LxvMFr$|iKV*2(Bd1@?%YE$XZE8IJyh#}!b(GgnOzQ2L=Xzccfc=D#Dn)2?9XHft=fovf=|d(v|#&nRklq;-nSS^gB!f8zTK zzR30(#o=+EX9RX#An>kkfYQdE%k1zU{mcE};0J{2Qv<$2sQlIOL%-}!?MZzBUClUP zm#^@j(!p6L_C-ei+JrCr>q6XZ&f<6!*LAPYxLedE(XjtqcOh{2(r$S>;F^`&bCSpH5_+VmlfKkT3R4 zfcHn){{a58zhV5}eSeNu9I%e?^ErC7%awcMKYS;oxBbPBG5Bw9Eqr{|349+8l>c)j zUz1~gyBj_M*pDdS_9ro)+u?XX{O9+1(C_RY0RLI8cB|yh6Fumz-a+{J{ceO0r})qZ z+;)(^m&l&P|CeQayUE`&zr6nrUoq@QKz+u**LPKEUthDD@FgDt;-3ZKXAclM+oO;v zmQBPTv5nA|{0XT3+W?myiT~?X3Tw;&L|?A+2lIvXNC$v^NIyWx{VwpcPeRbyM>Y7^w+{X< zq;ewt#g77FobX$8kn3H^jv&9yBo6`Oh{h%SM;st>B5(hIuk+DDXJ6jnzk|wy@qE|1 z0^dCf5Onrii}*7y68<@&N8+k}LgG z$9_Ro5FtJg5vy%M3NOZEl zYaag(H$1{HUMpiOzSffea~`i8#JI>Z@?e<*Tq-)z?{zPS`!|v-eR%}_qi@e9-3yrR zSj4r@U_KqMSr=oRrtet#ZnljZ&I@|A-*b`&r%mk%J4)w>#6!N^OQS|`nCX-aI`MyL zN0epE0rG#=Aq-<*wJq>w?`@uG5*PE=lYa?M(l2q~m;9e}oFC9C;V2vX;em|pM{^F9 z4SHeIUm164&EOkTpDQoY*8I19v)Qb*z|O(mU$c3qU_x>IlA|1P~z=;kls|Nh}; z8ERX`E5GLd6j$3Iw=2qF;b=E|w+L-fLH4*V7m55*TBW~fjH5i2m!|Y-jYIPcwQ&WU z=OL;q+MeeL#7lDPW{Vvc2B)!Nh35!_Pri}qzNXk|{`jOD+9&&Mz$+5Yb2`S%{W9L-m)C(# z`eQTm(^C4N8UCZq*>48gkM$Vl)8z9){L~|y?KC>zf!XxBqKFi=7x| z8yRy!pSetP7i}nT^m0Jx7e4QZa*Yz3gVL6EEbCjfi@ANM-(XX)JRpA0>p8vf*&skE zm+VQQJX6H(b{p-?dHF$onMdAzra21ZZNtk_Jk+1l3?@??&NLc>kOP)U*d>WChm&qX znUXA;>{)s7t%qewWKR9Ei9ZWTTWF98_JJWfP<1xvWAg#ZoaQRdlX0?zs69z`cHy$F zIu7LzePy<81)ZPtzv^a|iL@pVS)}&Gx}V2|;Odiu(>4Dc=ARFJh^?3PxDbfmuQ<-Dh)lE@zV2TcVfF~9+rJZd_acGQXwF3VJdq9mv5aN^ac`!F%}*CtPx>L$lR5`V7V*Nh(s$uH>T~=b zxtYM1)7&$K#vb%~Y%lO+(Y>){bNPSa9}J17Sbmq#p4ukSFiw-r6MkzZVI%KNVHh`K zwoEwQNE$tc@#3`9SKXTmf0b#*@AtmO@M4{t4fnf{Z7%Y!GDH8}-rbq*Zs};@uG71Q zmwp^+c}wnL4*Q>`c<67Pf9j6o z|2cm3GzXQ(m%foWu$?Uq^aQWVq|Sm%Jel(dM|yipU#ZVYwFzvV9eos+!S-fa|HS{j z&Z|6^LAHj{xFY>CnZwn;TIfS^jkU$DCkecB7Kg{4!WWZotN1aMgUYmCrP9X~<|>uG zmvQS`%6y`Bmf6jJp2~3opUc7=ve)7G5BX#p9dJCQ2f4KU5sa-VH!)4qR-3jsMfzX% zs?c9Aw_rZovr6-XyGdlq{rDh<`)UdDUKQHm>{Qm?X-uk(&wE%1Uwi<^lQkvEc+m%5$T?TcPiYQuqh4UT zU-xr?h4hiFc~1FR=!415fIaXm=?TnDf7fCdnv%>_hhFUkh%&t{Z9wuLKP0_OIvQhl z-q{?^@_Tw@JkMR_^Vq6zk=wi`!9K+%l25U%$h@n$1=1{G44))v^IQe{VfH)xU)G1P z5z6m-G?H@A+*wf<#WA9vsjd~@aj3|}L zeOcmB`#|JX_P9#PZWjAM_r1iX6P+S7tk2oLrnoDnqicpd-&eD-CHqvUC*QAzeOFE9 zRXOj7|GMr?V=Nx@7ShK!=J88q!rK35>EGg>pnBVrHrY<#5i&<@~N3%jnzGTq9|_8DxtS`Rbb@7@Fu|I^yi^kCXg5qk~$n`ys8<~PXw_`V!JOxu}Z zJmVLENlx>ANViI*r`mB?>FGrR)1HIr%e0pvzAQIMdy+dO9gVfnn%{D~Vhf6ovBmQp zz5(!_B>GABBzLF&K^vqqgtBjh|4n6#*xjaNH;FF{q<7_=hzFmjS2YGidb}n>yc;Iq zKl1M~M8fa*UcyIi1c>lSqOZj#8{+XA4*cv}7V{Cd7m;p2 zK3_<`hhN3cvi-#%^@$r(KSK|zUC^K*{zG52s3I_Z-;zB5=r7&VWqS+p9()XZ_&zqU z4Iusx?*WK8eBv1b)gF7d4*u7yBz76*`UN#5d;!_-lo#fD-aDajrubUGeWjw_+ssq! zM>-y3_JaV3F_gZ8$s6I2-5rkx9Xfdf=^KBj=n#1W9kRvx4KnpoE8$xt{2|%(@xG~? zZv5;LhCG*iKMFXNFXD{0*h;Fmi)4coY0TP~N_%O#?iHDV{@iFkq=PbHbW1FU@yot9{;O zT;7*OTMX|dJpIUKpmv6i*mf5{j5W5;P~M|yJ_1a08n3OH2YHO9wnAGoFY3g+fX3Sp zbAZUEe$y(=p+3jD>qE+?R;6N>&VbOBO%CU@inJCluHKFLWKLF{j5^%2ztHdfNce64 zjK&h=Vy28`UH|D`fqg?;{~3-acAmpt%|ZCTh3(nM{E2pGG)4H*K7#G-wmnAZY!^Zo zp8X#FV}B>@9oe45gP(zpbe{TI_*s|Ye+65@%_%XTuYE4_dDeMo)0=mf|GfVJdDZ>B zCntgqoivVgFZftTL07R20$EsNThIa1H$v$P^q;N;(q4T?cB$^K%UThAw_L_eEMDjI zZNFsC136u>VK8=CH(-okMY09h%?rHiIN{^5?$Q{iv4i~!q-66Qc;1US#76?v)>u=Rswffw9hIx74&-45Kah^IYyLa!F>ZmCy{9Za18%pr9H0nZEE58asyMMKmVzRCLaHS-8kcQ9~?zP%Y^ zCFVCPUM9HGY=Wl=SNX0>_YRoLuZFU`P239{yU12bFBf|NY2sMy?Pud$2Yh~Am)B%2`?gVIo)QO0C?Y?VKruD1;TA%I5 zH^_D&4@jNN-rL3Bbjw()cRys^I%Tc(9Xm1IY;-VTd+X`4EzC{MMMu7h^_TaO(I21h zJ)@1^S>sm(P6e*MF2)7x=H{gYZxL7DQA$Y&&*WO1(EBfBI z_wnH>&)9dp|A@VX_nDvlYz>wFXW4{r3HqM4M`yk7Yg^-J-Yi>g_0GWhtvc8FgpJbP zv*|OxHBGEP?1yOsPXZ2FSa7;ZaOU8@kiX=Of-CAfTI*>YwKmYW6dHEp+f{Gle+h1; zIc;s3`)upul)q#4XV-&}#@XY0nbbRK9Ut?E{dmIks(;F+V+ihV1uk+DENB123cf`$dz87DW563{w89PYS+v zso?8(3BDcYHJ*F_2SLkL{=1#hU*z{t9}De$b(iwLd0+6`ITH2>{vcS5rn9{o=LqIk zbF3#g?@+<+n29TD{Hs->J>aQT`c&`N%LuOahTs~p_fWo8wFb$eCL^9|)2uBNp0 z6E@mk>7i!`?sKf5@6+}>Q0WuL5IkA)SDpN@(tkc(@KoXaD({)9i>Fck#peRzy_bxx z^kuIJUU#J+&)Y#g)gvz|{q&-OdH+_WOtX67W#y-?SoQj>O27A@;Afi)e)SO`-j}{Q zeHPYJ+{W^H3aztxs^^q8{+?Rx+n-iF+X5<|UF+QUJCc>*jI|CW&qCnEMRrvEMcxx! zY_Q;v1qHj}D>#Noy|nO4opR%%bM)(c?+#jr_3kIBo&7cxJoHt;V;%>@`Ez_r=@SkT zOr4SX6eO{Z%bmupZKZGD1rX2Wxl}V=3DOyxvwmV>)q8g7g!z3hYoFC`&Zqph#urQ- zBgtLS&ik65`qR-=PTpj$o)Ysj{gv6Dr{pC#o8~%}^_#i1FPnMxQQCJei)h_hXQtU` zA(bbs(`^2|(pzmLI85uc*=b^>Q&*<><7`Ur_n6@R{}eoYqJ$R<9`&f;37LQKAxfKf zvVP39+Sg6SGS#^R+Vn=voArL05gNbdnf=tx3;Em&eM-N!zF^)}Hebi{pc}r`zG!~@ ziRJCFHP7vFg~!|D#yS8UFhQKhIPZHeQaWSZwk_ZB9qPnWsGRa1JjYllkn>FQx$OZyjdSB%S=sa%sZLjq3n*`6%c(t$5dEUNG__BR{_Ve$9R4?y*+joqmbn?88 zVdOie_K5uM2lhZc@JPJ>3fww7d_Nrz2%6|U^|>|o^=zv(&kKM!1ANy>|3RSl8E*h^ z=q!A$wf{G&f8cV0c~`BN5TH#N&j@fD&2dGX4!UQUzP-?>^n-(XzB|1S&0+4Xqa>d& z;A1C>HG{oqoh9F??sYBlQO-CZfS1KyLp{cnLOOMr>L1o-exX(An+g2%95LsBjH?0o z!7fN+?|%9>)|VeE$e@Avy1RF?}fk7-nR}%kssxJ z=^2cdbvjZ%L-H5MS5l|Lw5fR{?_ukDcs$}xy0xL!bBlBo=#H`vo@xOm;;kx)l#$Cqf>$2_E z-!2fmQfGGSst1{_*8aWVi<=SFuWD~L^Ck}6F6I>Tw|C<9eQsyEeeorPA)o&L{vFsS zqbJVq6E28v_Wf)0&;L8~gZ25X)?4fQyV%$2pW?e%zl%nVyt3YkodDj^PhX_tQx44nf|L1J{|)7HO23CZ5kb z-qvX+=sg4Y1C*b2mh%7hJHd1HJ>?Gcs$84b^r_tRKXre=m%M(L^530X(DeLgUn)&H zzBBi&pAxtKB%EDhnJ;=7>sO0kD!7!+nQGPRlwMuuTD7*;bhXY9<*$3Fpy}=X)>7K^ z^+7sQs$-EI>*vIa1W8weo;_7`Lv_|5a5e0HoZ;!23d6K{7P2=&p$t>>ZQL% zXlF7&I$%`&=XOMQQ{!;-4E^OS=7ttM!?bO3z`d~fbc856TB+$10aXzv{lE8pk#Gs366&t9$k&ti>2j`__4gst8fYpm5N zM+m0wu+C?kn@hf;{AHdMTy8zVwGR^9AkVqfd2MZ?HQeHPjpv8OoT2?csbA&X?mnN- z_>bzH`>x>m!h@~LUQ*injhu!#FHf4UvRF^1ub7&_ywhXey`c5^qThwu2l;b{h61Q-dN+Ky^3>| z=Qq~r{yLwk6V<bkB)#v(0`)M~;{q!~S z%lSOo2}+Ni`@?dqxu#RT?aYj;meP4rFC{v!@Gz_0toqwGg2RND>z#L3dVhUKeZU`- z?i*k5kXYNmv6kN-d8^V#CB1O;j!IK5h5hAyeCk}vFY>4_lur47efOnG-@CJ*V>qgYYBpEcYtzIgL*mok!*TpHky1 zJOkXe&;e|xSxDzo;rV#JqdemXHbefcdP`m?xb%mDdB0K4|4lT$%@)t7e8*W6YJ3~Z zv33{z((JBv-t6(H>g_$5An63WKk-(PM+LgTJT(ut1s_em@rj$1Homle@YABBB&R}q zFNTl-&%dU5ZN58Q>5Spf9&IP4+hZOrIM$?st-S>&Us`bLaS|?*@L<7=9n+rsPNi3m za{+Y5dQ%H-^pjxT2er3eUFlsk9)+j2{&Jtbvwhk%s&{$}0NT4s^ltmc%ap$9zk;MI za7Nufr_!V+#>9WzhowG8=qvSpc@oRZJxbaZw9HQ=A5qP(_0_poj&buDIz7(lGucj& zOCLI#(%u(&b~F>M#r($frsa>k_rlrxb@T`QrcFEOuFZw-bgrxaDyvwp+VXq0r!yVn z;pd7iJm{w%`cyZ07VEMV-7wOGc$UwMj=G>T*x&yDg&)kHiFSxQobkLL2kuOILUy{b zUVL{RJg@)j8#=bU?Z*3fyGWD`|p7<8+qTi%Vb8K?GaBb(>Z{N2W z>#+|P9$5ZcXP>mvPggU))x0aXnbuqDdacve$2vz^Kh4ha>KLv2`f;V3?apO>vybMh z=+LIm-gf%zZ~tjU)?;7zebH~oBSsmw8E4;_eQJB^y*ke(y%+6tY{ejx;Qd_88)z}x zQ}eDDIMFhvF@J^fph=e$B)yBZM>}=k2I?XL(tZ<=_M3pT+r-+W-8dk1H#F`Q?epS4 z&JMpP?R{gPm@X>!!-IEG-G>tI{ox{}JNLt&TaUe)dDb6jlU5rWd7$qvj`@lI)-A?5 zA3JHE-M>aY&RFWw0#auHdv*S0k&p4*d^*5bw;ut*K75S8%@~jAu4H+=?tOqbbEs>I z@A*7vAC%`ERMGidzK`{E=a2C@E^s|))e{3ZA${g2f*;;S*xv6mmbVXo77*)}bR=Zb zyxYfkQa^G+))D;)x;AY_rJEJ=ihf%Ul5}Z*dKBL_piK2!$LxdWFb=bw0f_qh$9Il_ zANKjpCo?bfA6t7qjQ`M^n=bl`wgz7%xTn^gbq1;j7H7VEr%a7?6yt?)B5wmdtCT%j z?%YsU9x`C^I?x;Ax(R%93!cMwGmaVL$MnGxcmw(|sq0tW^{yzFbzeh+j#vfqOyTtmUP9|vQ zBZLd95gV~D)#rz>je3PRYcT)Rxy-S5-Sy%-Fn4<#z-KsKsi)fBCB7-<19D^E^B)oC z0N$17QMJzDOqcsu^KRa2X+ztby)ElGK2ZCi^O&X`B4anA4=Y{5ykd8Il5k!7wav2b zw1_A1JO1xYTgu+|?q#~Q$P|KW94L7BS%PW1P>pdZ)75TTBh_)6Dt%6j5!Tdw^9X(* zI<8_Icl3!d?7?eIv?t5$o2!0pOQxG`MNdiw54!H=iJ0G>D$mDdmsWbc?FF|LJ=z{N zNa+(}{a}7?js1nS$9VIY-#10q@GReTT9#G!#Cpbl`Q&my^y!Cpn67^u%<}fI*cUNh zsKYp+nDbB0RGIas>GLAi3D%9*a_*~o-J@Ao`vhyzwj}LGkRR=0oL1PJ|Es$K##+Mu z^4e#-zNiP>M|~W~jj4|l@DAhylFtM`Hb?Xsc!c~Q(zI6qF64bJApJ~Y{P)$k$W9*b zCm)0FGk@ZBmUfZi53s+y|48Qp=S|Xw_u-pJ7b8u&7tr^sq;oL-jGKq?C;f+cDLyE0 zR@`_y+Q7J9m1hHWtkA|9f!ERYN3#>Qm)M;!>K0pa#*)H(oT+DHEL!xdj&Iyvys3P^ z1 z64#ESe)se&+|zs2`K&jR?XKkrX~Wx*?~jK1n8!62;B&>ccPr5$Ez?eU{ulim^V<){ zKEYU6FXq#k*^X&p`yjABYOxhI?e$AG!ykI6~!VW86IUEYs~NCr|jJV7JZjhKnfQa?kA&C#EfOJNb>6<3ej&cdyXeC`_sQ%-OV+=lwU8(DF1Rk9c81H|~>vXj!OXI5EHtK0tfq~lr7zKzPhm@m#6;5Oq&`yd(~ zI0N{x_#%Q1CUp|=ZrdQI4O(?-(Dhg!wqZQ%C8epWgZZRRDCqpO7l^uLEf?PJ=kh=& zj`?f0rDuLnpPo7!FxGGQZrXu)vc15$K^qEu&+>i9H?13WLA$4(cjW6oaC_1D?#>%i z&y;f9ugOV_doTgd!>fTAAQk(jMG8?D0S^; zgZ4q!KhAvfYQ3ooTKHG;*%&|b6`qG~U9r@~DmqfujT$x?+qaJ%@#pCKTpA@) zS^n0f9#(stZPfPzW52{)Vw{QVV!Q(ninj6p_CBVqI_2$0V{Zk$0~|vAe9c|wKl+vH zO?vy$ChBHh{O_MXs{g_jfupfT-w3*?;eYG-N4|aKbpGpI{ryD#ypI#~fjo-p>%Z2v zc$LTp9!Y&$>yhgI6#L`hZ%~do`{qQ#cIsmVzt&pkIOes!kN#pTYzH;(P^EvLyu
    &_`0MCB(0r}x1t z*nYQvvDOshGQV~H^@6$Y&4(7bXqP^;ebq>>8Dp_ZAD^$zUp3)Dg2atDAD-0tIg;M) zv~ix|3>$@yzIwRkpy;`p?^s|>K3Dh++qPTZ)3%q^pS0fOba*V*_<-{k=|?VLK54SV zfgKsV&eislg0b#wchDODDYaL82;u(OxY{!1uCeo8D!yf`%l(yT0_pn!e^cKN^Ub{m zx@(qq^{%q#fIlXg0(m$OuM0W@bj@ztvrawHYl2(GTE^Ponh2Z&9*6W^$3{$LqTfWz z1s@CCN4ie`eUHt(O*%2~CTwVFUjhEpe*Ct01o>DGqi-i@J^A6wDt*BLgvFNEdLQX~ zz32;bKJo3=>$Q)9X>R88(sRXk?YKA7(J%47aaO=~bgWsKZ~KU1^U3vy{b)NppOMzT z9-!}x_RGA2=J8#D?+A=%bB$X!hU?kw794;v$@(21TO#w zn@^d~c`3MXoFbcQ9kBt*fnT5784&Hx6udKJb0wRYx zmdU39`bnPw*pr)%V19l6NqTnqO9|Tx4H6_hh`m$%#|5u)8Ou8MNZ9*q50K-8Iyp9a zPG@3=9t7Uba?a_J`>?(EUp>5G`Cm^F-x=!}^|xET^Z%BI%l~GA6FUFt+gJ6QigKANl|WuBH40@ZkGdM{*PRT}b@`>r&LC2W<$MG2?JxPw~AN=e;&(d+leg z=JV`#(OVd&$G)TL^&Vw;eUWIQ`sy~%p)}<`Tj|9RJL62;X8%bPA2ebTOnvAn(J za)OVDK45=o(-Px|c^h_#+DZK_>CxvHr!7l7BRjen7wBBRAGi&;_okRT;M`d*XB+ZY zj(aiMB4Q8HZXbQUA!J10!)P-INIQPubK3UB`HMDYx)Bh2B=L83cI>sFfd@f$^alU; z-u0v4>nj67hvbdZ1sQJ?Yk0yqV*%&giutX1)vwl8t0|xHNKww1zJOOR%Y4O{MIY`% z67AL#glq)o4`Ux=jDEkO(v07X^tB%-{aDC?u|}s>|C%{xPIQ?J(=Hr>0rWWLvohDFOOv&`fEG=k$8XLij)~}zWe>} z$N)eS`JA?mUizYOnh{aMXr_4XWmpYE2iw&#g41zdD%<#+S!)^jy~eeO@HXCIjN zO{a9mEYO_5-ro29)4a!W^D)Ku9QFK-w}5wxU6Obt=>woV?S%^e!#M)ZNP48b*C4iE z>}ATm5B7@3uHa?tS^62k-lCs9oY{S`hZE2B?A4X0s=c@7$})WG>c&T)HB;Y>W03D4 zp0W6x*GC6 zpR3kbPSASsXPl!n_aoLK*C6)gW1lGBcA*~(X1ZQ^8^OK*ESP=@>Qm-sx|uq@8~b6} zr3AfSp3*tcPW}8C#|}*d9_;bqtZ(^B%XYtC-NpRsB+*^fNzW^td&PWymG-FG*N}Z% z4?OMteBa9Xu`Q`_!#{*g^i3?U@VNeh{z3_|956d%FiR8I| z8#oTsm4-hA((_n@DNBy$EXy7^=8(~`~2?Y)ojDn(=!9~!+(Rez_Y$~ zAfaOZVQ=j%-n6xU@{Z?Bk8099cVK=!ezXf5#W-KU(TlCha>Y}@m~W!@)!#3{dL_=psye%x_jXeL zfBsIWI4i(2%js-t?;Y|2?EjONS2^R7#Xaayq*3qrGnD`4XM~*3ogQLY{BIxq2L1=m zhtE~tK@5o5gZatxuf;f47=s;y)#YyNTz`_Vq+bwHeVXKli^qkYBw1KrwHhu=@!8Q+X~ zp8e0<|HcmHgi=IzyykG?GMwjljsBK=RT z@!;ib=VV!daa#3G(8ze-x`Ep{K#jd%?s?bLICaBZ4KE}KGG0vvgH&|~g zi^k%A>P98KL3x1sA=v=r8i{K;XS|P(^8RN4)@I7A`^%_34)IRQRqbCXo_Bnx_}@yO z8}u(~y4LBobPmi@b1C+i;J z5Bq!XwGM0gYbtSZ8p(-UlODwWwXC~kU6QqCR=)kko4?)gCgpE@yx`E21+5!v-4ok5 zr*B>P@xy*fzw_1^F1oa~4e{NAc|r5bA3de_Sm!o%Rcu48y#(2&b#bk8MxQF3F)gud zl2$6ZXh|Pb)=A?WgC>1G@H(D&(zr z5;)p>%6|7v+ZO-(nxEQ!_>;!zzUwHymLEM)@3+7H)I~0S`(M#{K9c|b^yB5YHzVof zWQ?66PnhXhzGoyG^-=l%w?B33>{&P3x?q&i;e1aUed{CG*1g&LB)!kNKh~+{oGAx<}SowC+*fWfUDo>msFpddFgFU%ajQ#j^qWH;Iee*9Gl`{@e=q27;Dfne7hLj1!2?9+6rTWjMiiOGRO_>z&kW!1 zG+S=K{Pq~H2&S$o-@!J}_d>^Ph*%a6v))KHfwlo$ZatOT#?Q8WXXrd^jmmbD`>(C?Zdg$;J%p%Qj`UCF`~!8&W_8!ur1cyv@ilU_cjCIzNj2NXmrk zV%wPKhGmV({(-NnR}deYo%D9n3Qo9xQGBJ3c``3njnhy2L-J@5T3}o?x5$ zeu0}ibWDdf1P_w*X;06`9oysd`&o4M?He)WFU3b``#}6ec(7$3BR#{}-nU)5S_Cgs~-^lFzWZF<%8 zsBN1!ZmZn%>1M*OMcy=$kCHo7-?0EluVTGeXWG6D?ZYr*km=qNXJyK-if_W}lOMTl zFSTpB_D=2R)&TkzYk+6%#5sqEzw*J#dd@r|*9hK|zJh!gVtTjOR#@gb{#$&$nkUvX z&Sb|XqO1_|hh;P#)w0{Go_!43ryzX@f^V_j0`*Riwhxp2C5NaE68}`G3+RGS7 zItTH7>rmO|!!Za>8m#)JySX1x|F7>T-*mX|!!FjjS6y?t%FS2tj0DeU*)erC&`#bF z%LfY5?<|4m@E!jOx(#XCGGIU1x8VE#R=c)ANuLDO_u_%89|ozs+xDT`w;=DLLGL^6 z2I+sC;f{rnv89S%i6I}c-Fm6N2o@iKTOo~hQeIhP-~;ZsQND+CLyC^4`H2Iy{_4Xg zSG%^|=6xZaJ5hXcvDNmr#-3sjEh-(3|fwD*)QoU@Wj-;0!$wZ^#i-> zdB$GAdmnvNY0JM~{#5B#{weszP{DUD7JTnbLE3!ddHWp97)X+zFOafl@DH`-%YKQQ zsqW?TBk?JW-GFnm+lPz!aocz=s{YD$1@%je2d#Jeuq{3bw+#6U>e)A8H{UaW-$6a| zJL%KQITuUbg$Q!WoZ0iIWg8=SUJj)7SGy{8=Avh8NXgnB;jMv4y&`;d9| z0F^&?wqWs5sP)p&794zxW7dxQ6YI6BZv-b=L2z>I({eXCfDeLvY6kHV#rI&|?Ufj~ zv(Kh>tmmA5jHOe8_iu88%4sVEe#U&#utCbVFF~H;sGqUc+ZWEK@@~H9vhkEp-!y3N zCeaIpKeA7n^g+|1M}Wgq#v!@m*lefd71}+{>AP4Kw2J&-<301mxsLuFsQuT|vkde| zV(mlkh<=%I27kLJpDX(8Jgaaf9J{sh(?+B9>=#PEs5!7aR`Fzj^KAP%(|)Lj^z45G z1po89M*z{Mp}*(z(!~nf?YNTx&UBpAuV-StqUSwE$iJ{BX*-NP@0bSbjH7(o5+mQX zvsGKPozpH5q+e~+yWm$y2aGcw?Pk2t`tL6w4IFyo`GO-B75wrXKzPpx{^V&B4IbHZJl{oZr@ejPG~7k(FqxoZDsT~}F@_LJ>1kPRfGwVSfaq81- zNA}J7*4~eG7I>X@Vhn=L%(6}%_EWC^c*n^9W6t{L!Nm?CB{WUo4vxq{SB!B5T=+vD%7I&Gw}tVV>=M?mW?M)3drzwL03Z9n zF}4A|Pv=baP2fY^lWnphpR2D8T!D3&_BI74kX}Q*FZWeB@1U_K?1P`U0pIReO~3h$ z^_p|VH+Etv1-=Ka_%v`Hp8w)R)%)TfggVEtz88z{z}V2H7mzl@fV7uJdGW!Ix&3HP z)@=>ZSz`QJuMv9@xuDlz|Syd0&qHGA^=j~7LYN$fNS&qtX_W&Jcso9F9E`K-Z8dJ?|pNG z%D)R751j|baRkm|Oe;Y8L5mnvW3XIzPuTDOI2P&XGh%Y`e8U<^yPcvpYrDSJMxY+P zIc;O>Mr+=-cJ&3KIdm_CcczX)d&r@94s+l*ml>mmeEI@IQHJ&TTg|g{ck%tx&5Hbh zI{;3YI=txb)v;IN8*pDp-Q02Ue+u}9xsmy;;c*#Ex z=%aKbFc#Cr_+!uCIz6H8AYGZp#`@N3%&WE^Drnn9$49mQ z$qnM$(T4TzF8wXj%}!Sc-gOwE?cCb7|6lK9j_m87sV+d<(uuv3{^7&g@f~=MC1}jZ-T9L*lxzgO|gc+umg- z(S42)RDa!K{U&|BG@BfNG}gc|(GPsr>M;(0q-|rbjRo54Xu$AO7x)qTm3BdZX|HSh z+&J%S(^jpu8|q?A7!LrrkhZ?qXM7gvj5TCGh3%<@OVt*}in{)B{$fp#Hl056qEE0b zJ|oth%P?My*MoDJ;{tk=^k(=F*%|f1<~ZluxSi)R^eE{M8oWfYL5uTdSGHZR65pHq zm*;(qEympE_|M)|VC>UwxZG2`F_`W3Ki^w>EX+LLQ|q1sdQh}G#aYAqj`&u{D(Qox z|Np?@h;#Kq@HaU32X8HywyL(N)pPiE+6S73#JAGUHOJO6tF-lv@2$4p5AESRBFza{ z_zK`Lj%(HLy_f^OH|G9Xfyp2Bk3bv`J(Ejuj&^45aJu( z5xryIm__em$knW0?EO~H{b(Q8U3hVzZZ_6h>SkBz3%mM2@2@`jM(w7pV~IDBarBBl z#V~z;z4t#^zrN!M!8J_zK&- z#rB#V&lI$cahK2TX5Zyio_1Bu;}2J0isbl8|JVDw~ z@A&!uIEU3cZ(X_|*)U?1Xn$Ke=b<(~Di*uywmDc1!}V0tNiI1g;E zf7}0?|DdPyK12G|{o2piB5lU9z#JCe!~@%HmhVIV0!QMmivNYXjsK0O19vMAZCPH> z4|lf)i-(AIM)hC(s^-CMME#Nf_pg)xsV^4)qaULI;v6Pz1p1IP(YX8u)9gIE_6V9D zW1sPci`@b3`gP_hcC+3w%KzC8zpej&##fHL&`nLlAq@2AuA ze=Fm~wr13PxBhUv^3VN^VEVSN_PvGa>b#`6ulEPAukGM6_smyC#8}bm~3j5jpcqXRnzMv6ed=cOLJmFHu9n?J{ znL?3$>rKfvK(D$NVlO8wgsr*H>gV$;+^;TM+ zPo?Mc?%DT=)p!#zzv#8hdy3NYKPPDWbL+V{R+wXnr>%7LRJQZ6)@|iI@vAe~PVM`z z6_-@{_{``0fc|!j?oazz-uy~5nSClW)6b&(^uZi|*Xs5|@AsPtgRjf)>=(yXIwpCB=AP$Vr5->$)B270mR9Pg za}8}Pc}@IptuFeV`BQ%1c~8n;n4ff9wC6qCG_>Mt4o9Lp?x9xbJYQE(}Q+>mebw@&uttsY{2v{V*h5^Q&Vxo4hK|E$YzUssH~hWF5J3hh}3D9^*{Gts@){Sgm~`)S{mj1}_*nc1YV zF98SW0)dt>%`?LvP>wX^KY+Fsm@noT_%iK$<)aVfmUCM-$Z?ja3xxM)ytdjjl<)bd z7m4!UZiseqkGbvMf|fJw8gx3^Pk%GT_8{%M>O<#OxpjtYi(nefet1YzqkZcT@tnqc z(;nA$nC0$>_xq4#`VQ&pz^kawGaCJ&&Jf0d@-L(*{{plQ(S6gQKFaM+H0|1a&J>-Z zCl*%!?F-?#rIqg1F{0cI?Z0!e+O=*GL10-$~kTm_Gj?KUzREVetn*dI|Z|Ndm2B{{Tf7DR|UL zdz$rr1BiN#lWHBLq=95lkACeGJXgT|)i2+hlsKuP$%_sW^&wE-HWl_A!FxC4^X#9p zr^KbYL-bM6LApEW57fK+9KDb7M5NR9xN$rR>mV_X6~6P`%TXWSL*KrD9|yj~bJR(~ z9mdy5uaZ_r{q%p-Hr;C7r16LHz1F>L)29V!`iX`spENzvl*d8FPWdHd?!FHBzsGmnyf&)Sd0Jc7qb zp2adi`O!o_Xfqe^1Jnbgy$JgIYMlGfYkBo7z;W>d-J5=rb@l=W=Y34v4^^}3+*TgS zcyBRzPrcddcouko_yqg(1|%b$cIV9mc|Vpio94uoSuUC}__OJIdhHkI&7mx7%`4o} zTH`LHLCE!K?3Qel^Btf{Vr3fcusu<`P`vP{AEn1H@TkA3gVug*3k5 zK7h!7@ijp3MCmW58FN{dH`4}40IWgv_|NhhocL2ng5S)Ij^~m8;RwQdnF$5=ok#GP%>|DQIt^p^h~~7!pcsA^ z@-Zei{e|Vtzhe*g8>2;UW4isjJy_oU{V>53gooO1#F$|Hyb)tLI)C!NjQO4ZWu(W% z5BvrFabr!`=l@nyvTn8WF@yu-0AkK~-;RFlavsVtw|~;wDfjI>f3SxgD}(qJ{dhI@ zy87W*b?t?2%{=hV)L|GGX~9Kh?N{=F|M-*zrMpCBus{|~^oCr3Hf^2eJ2!oQpE zuq{XG8P4bJ>$AkxwcU|<`cd)l)&rRT5VQl{)b=jq(J?;e#dn%f?;#J4dgQ^uo0gcrkmrWXfIK(avAy@dc1JnV?>{9--W&D*qdjA}mUwRDb6ud_pJI;#H;lHa zpn2`qaY|1u+PCO?(JlsSd5PHDc#ga@AnzHlAIwXy^ADAirw$%k_*J|#(i>@A>8{K= zrqlLRJ57e?!1M1LxC!mrj^@a~QAm@Q20Z3=rRi%J?VTAo5Bb&?yL?xruNqH~x^mcW ztzwyP;Z;Xv=WOh=wzLG3G%_K4X*(4o}c9z@m}(bc#bhT z0LddF-#nu2RLmQuUqZzyL_PC}ug|1@yzw~TJUz|7dI8ZM^-sZjl$eFnuwJp>H*YvW zoY6Qt?dNc!;YyPi#Pc(3sWf>)oVkm{en9>bac&{avv|fH>s(mQU3fw39-7D7YmlBZ zk4G8>??3)9L+b+etTKb`u-WuBB{r<#x7K1l@ zCC*^Hm$9tkTX0U(pN__(dN?5JC9OgKHh=HqGsTb3f5ab1f6saXz%9f{z+L3qChn=* z7x1~7dl+lOcX(VgSR=lJ;~Y+z-;TcB_!XW5P0BvTIS(4{ALlBMN??RZqE_Oo<(0l0wf|cCtzGd>_OBjb+t&{lQ67bHvV3W#tysV8dCP4m7s1|eyiVU` zTMpqkHk$`eg7NTOCD$a`O8uwUK`oE+niJC`vB1A;DE`5M8sW33{+?)8FK=p3xx54r>2G;NEp zxkTdnFFJ9K#XUIZAY)`&=EQmHwkc1)m)=Lsg74uS{qYCBi~6ph zlTx=S#zXR6;XTQ~(NFHVm}}sQ*Y9FqIq#&SQJ(aQ@7^>}!r6`;tDEjBkw(tcS%hvTudF`*q!J9}E5a z*jd9En|^n^Iuml;Z?ysX4O~YYA7=^neOI3Jv-RCNN8+4;|1a7KVGd}I2s~;1@8mt} zb^eHY7~@Z$W4p4)!kI|hu?dUq7{{jgfP+8Ji$7%j*7Oewnx|U&G^O_yuCNWh^z`xm zDYZAMd;WlWc<pugtP)@&^FHAIu~9ALs0$(~*a<9bi8I+VH}2nBQEnDQ2cpMB@OWXvt_eD3#F-YwfNm1W^k-*w`@{OZLzhs?mZ_1+2Cc59-cgc@ty zhvnXq{4w?r_~6ZA?y+XlPP3Zo06k-V^T>^n#$LN+J>@?lxkWvm&WhT$G8^=$36rczC z;l1vJbO96+!rw(*oQg48UyV4 z@@?2Fl;uyKzWTx2&^JG9+bE+CB;h?2^9|ZGZ6~Z_+KEYqGxwm7JH)ucPb&3IAamk5 zfpH#u7t1u>nERA{RLPsy^RJ3>j04Z4;FSUoU>x&YX>axg)9g>u-toWlE&cyv4`e&- zv~>>|rFC08AEv)rN#nP^x{L29de_#Cw|v6-*Y;Cyem>7p&uhmgGS-QGsa!c5+qUn5 z_FgM7-8t(qMqO*FvHoAKDSmH1zd#)yL0I#tk6`_K&b$47p82ufRb+|QyGs0*vC7y! zza{1xbQsr-`-QcV<6h(;*%#9h&9Z^BL60V1O+4!JoB9{%XRb@xdZR9Fy>V|=_6uyM zQYKpN#>{J3?t1B9zNg5z*#_F8trYk`o}u6~4-Y;aYl!Ek_IovH@FDmX@_tw+Q;aoo z9otW(9rVcd&#CGm~G1(YEO z-x_bnJ9WO{n~L2k_@%Gjz%#%VUq`=zuU7n=>DDPB=R}%uIx&{KQvl?d4%#aH-KtHz zpEv~XaGc>U_hmb>>BIU+{XN))Ci{eooqkkSE_PnT%F)c9! zfRFp(s%nGtSRQpM>*A(7lXxd}rla3JJIrHOZ^z!!IJNSwfZvz=p!vT}EM=T8c@|m* z$2FO9rg*mcV}AdgXX-nz9u6357w=D*On05=Lu-MHQ3o*NB1OBcy<@!w&K&r^KJTx{ z3pyEN!T*|H{SO|)`7tM$_q551J~U$-i#)7Z(%l%>$<{ z{Ff_z;3NrGPk5l9@m%`vke>oP_mB5gPG2lYXZ$k7NRIsm`+3eu&}A`JI4dUDUXb5{ zH2uT?Pq1%*Y%6dVbWI=J3lR8cvZ?rt=eN2c))nv(ed?g?F=IRcIe&f!zI%nmn6Gg} zei^?fkssp{Jcr+n{?GTK()m5?!>mgo4|jzR{+eZ@?$bdmFMaCn3+M9xr4JL0avVna zt`!1L;4Jq$Pu`Gy8`bwWZ!XL7vOesC$Kx^oXevMGNWn5bh*S1LtZC2)d&U|D9L1b< z_tkr+>=pO*7w0H&6Xxs}`qq9r)^gy*N&e4$s=s`L&z8PfcI-Z$d>{KTs`32AahyNo ztoVkJ#`9<9`VZ5vFP*g?w0NxfUnLAW>u1)!`}+T<@eIEo@{1 zV4)qsk9PY$rk|+5T{z?O{1HEZd!F>i#J-V7z#R6=8|Z&2&U2ip1AH>+EEhi!blz+| zz4r*$n$PY1>?S>DpY+YUOcx*YgYQy$&K(5P9;9Vo^xeMZeKueJlj_q(6m!U!NPyiw zLapyw6I1`Z1|Dw5iKl%`P{r~5) zvqj${f9j6z%so#bjd^|e8bHvr-F6j^?#y!AJCvBxv&6o|UO7BuXjofGql+d1FJS*Y zi*C(&b$1-KoAd77anhdngX-lSfp}=#gB-sq+b_Jzy+fFme;2IR&11X)tuLGUs?oRR z!r!6{Z6rNG-%0dC1bOB;-vmu9-BXT_f0tF?xD9rt0x9IVs(!`_7AYayRlSbc2SKJ<67Ht;Zaz&nfUTSn6DB%h2ubbIhhSOe7UoVcg@Nc=*v|0I6}Tt2?` zOg-VDtY7oq17o=Oy-GVi!WLU8?YIcn4O7}S0WTkeG@g4S+QV3nDI8$i#b%nbl|RRL ze6E?}My2P>`mv2-ZU*SvPTW)MN4Jl0MY|>5K;SZ@9dF>TkLmfFo)C0gfrlSx7d^5U`B=k83751_j_*X;cBB`7gf!NUal~b7Dt%|H zE#y;|6+HFpFY>vN+gtvjxq%+_6)`qAJE&tkc|W-b;)%a~3d*of=6{*b>siQU$P;3I zlP6Rgz===YhI$y688jb~u>_6gdy%T&f8nA2_a*JuCq;SWV~w2>_yKL5Ju_gxeZhS& zHuI|Kg(K^shcit&);7P5*;3z^iv7Y*yZ0@NZiHf<~r(3g+k7 ze==V>@$qet3*{L;@P9puc*7X4KH=-?K+VBOafjD?6zu{pT@-i`@aty?OZ?y~gy$v0 z!x|eJdk|}=#3i1jr}v^onb%tJTEX;pR!x!neSMY7?^&#mpfB;Rab_3Xv`_G&cLme0 zS<~JIY0ULfhX~rQ*_tOJ4Ltpq|FVAb$`F-*^bpg>G4RkGbMpE6E72s)isE+_pEAw?+$Y-3ld=QQ|C9{?QU-uF&Hp8C z6K`ui2(b9c`i}1uFN$#{&k6YSPRx(~NJkjoZFw1Wd;81AFjg$0kCW@7vifX^+66 zIHzs@$UNYa>;A=OJN4pQaQBfqDZb|~dOH`N%lek>m-uS-F<~7=+qI<*N@JfAU9#hj z&IxF=>{Il`vYYr`|L-rGQ(nw%|GN0!PqwN5F@|V^{!4+s=qD|{G2V9wV3Y$dzcCn4 z?e+gJe5g8>FX^4LqQ2T0Wq!&)Sik(o{9X4LpH(dMY=biWct7U3JLcJINh9ADXH@n* z*8*{S>KPZ`ezQ%P^?-wI2W{W|smomEGw)f7{bb5ut@{`6a~raWjrW7buwUcUy=bSu zUXE+t%W~W^##1|EB*z)sd;ezaUu(if@NaJmUNv>XKMP(x7GbrT@Mpz46U^mo3oyT4 z`U%1PHY99sa2z3VN6K>@bIRY-PJa!Y6WVs>_$OT*`KG1gzjYV+zsQ3jw>@$3d>7_3 z^_Z>K8S&g(dwh#>!2Ld9z19P9-axMOSm0FPoA2fV#C}|LKf%)%28_M^5g_F4?`h8K z!MiZOUMJ2qoS_fx!F2P7iv&k32Z-}&fjGCYpBGsK5I87fe6|mXGY4tjZ2^*RniP4y zlfwLV-%0gGAJ8}6O`%U+cT>an7XcSdiX9Khxh}^hf$3fqVU5 zxJ3CQ|F=#G@5GEBt65)3oht=UHesp?z26ucjT{W@h$?-hxpJUp!ly6^5_S3hXc-ErFajo{hZBwez zbrx1b#KV+WENdihliyi%mh8*s_?G68I!jo$pN^()88Dwoc|OqUDSIvUSpno-c5}eUw-?+VX_7J1KS+ z{07jpwrO`v`_#KAHrjg)V&Ba729D`Z|8!^_;OU(|MP2ZLJcoidMc&;jbmf^2im}K1 z8+Y3`L*i=VXyV&hYqrIAr=3Z(UDK}u#*KFMfpf5~Quo`w9{7CGPl8S00ADKTpY_ZJ z>6zRAm3Nw$CyU(e!O64_8I-7tQb5+>QTlR{ZBGt)q~E+0AKw&3v{-| z*iPS(^V)aWFUff=*R^iesN}nr>;94)H|4iQZkv91YszgwM~qT#8*~VGu3wPbjwG-B zMLF#fJ-zQ8!EtYmeik6sBK1u`qprTL(vGY8#0E%%M)LmXma`2zf$bD~@?(zX^VM0B z?@3Puyq@K5FAZh=qW3ZOdP-aFHrNHlMZ2fo+38mt2x-ldBqnFH|X@_{#^FYZ;AbZ zXHv!?eY^2lF59@M|2UsxpYp8#pZ@nh-}?XW%xm!Vv!Ts+56-jVtJMGFyFiPluT8$I z@T-`cq@(z3(o*ri<982poIZE#+l6i9*~aJ6j*s)3a@dYs6g=hHqB+=Z#z5u&BD=tx zq88yGoW8XObQejo9}DB zuihoj9pIX@yHgt&=NI~zU)C3CTCB6#_GNy1ulEJd-c_)yGsv%bw;Ol>b{Mxxu4G%o z-tQJ;{rcHB|M1@T;v55fza!`L{)_zHv{h`Lw|9eij9(bQ0auwLPz8Y%~{KFhNOX^FWXWyIa?*W8tjCV*4^DNI7eyos( zK4uJ!&i}w?px20BF$RS!Ip0=aPsiTRruUqbMNUU4n)bkH!z2@^%2-^!TAxM8O_=dyw zR{GhHtH$`EPwtER;CIfr6w2c}G4K9Pe;>aKW7=AUb*e*yZp51VnfCQ8=Ecw65ws-E zH?|S;k8`1`pHW_)e-g^Tqo%JK>s@laQeGJ}4eqpgpMm)s<4mM6Hs<+Qr$0@$IPAD% z?tptA-2@Qp=<(?VyYKg=3AzsRIBn1#fHN&8$a_EVZkA&?{$kz(wr-PrrT9QGFXvdi z>&AJC{cpL}X)`N*+Rh1Y5IlcXL7r=vqx5H4r(foJ;d5DDFZ*A?9o`W2|4P5S6kCoW4Lr3yA0V z-~YEflkKqmcosTd#V^u^9MjfV4++*A2-^3r{R8D0ZGSw~YC1EE4Bawk+kbWYcD3E* zJc+~TR|Vhv+|qoXzuocMo6Ch8O)oSl2Q0n}*3@2X?==X|W6h;CV1lF0A>U%XSSDez0X-kxoC?i76=SnNn`lbH6Twj*tJ4Sa+>Qs^x7CHJG&_DZo!1OE8+{%qTEhoY~>4g61?{t5XF(qZ|Z|BKGl+R}f~2!;2^5Ki1YNzh~X{!7H<@ z{j_9KL8ps918%U6(I|9_n$}rtqxsWs)E4!eVyw}Z>AnI4%}+ff(7EIr0KeUcbva(t ziJYA2)}A{622VNvxHF3P&%mf9~2pZi%`KCKJKE$``B z757&<=XxK}In?{qQ+OZFQ~FB7o!Mua!`?6An~|TkYpqEiX1X=C_IPWlZa*G{f(;&RaYEQRVb$1|Ino%}49no0V@r-LJ(u#GHIRh_ISySwZ{7c5M6Kh`yH$ z2tKo@OFO8i*tFXAFa4KPm;74oTz;|ORaXgKlkH!l@3EZ7KC|it-(tObp-ly8(}?qV z&AXM}?`1*iL4bz&U`nNlufa#QW@5UTVT9m3ftP?&7XL|bvqc1V{$6kw;lO5(F_b=R zcERJX7kqWbgntoyV=y52(jLu2yFQiq9ly9MC_VAN1t(EIN}NB&CxQ*>LbswE`-MCQ z;FgjXNCzG1Gmh2s=T9wI;zumcbgaGl+IR-%_$MC{wvS(%uzy+oVtgOy+~G0LT9?gQ zu@-XQldb|?O1YhV7v}mcXDoQ9yYmcV%vjJNQ)!)**x|RvJ{lcAoB_vbuE>K^zX&!v zw7mrmpv@Qd@BCT^b;`AB%hoL?N#9yE^sB>x`Ain=+>%`hX9qMNSQa=-G>iqYR58A7_j?ey&b%q|5bwHm#s>Te~G?#vp+=pKlI%b z=^)^i4-eLJAKxSRQ;w7U3;Jv}on%_ywgtAA&wIOW-}UnS4je(>@1T=TnVavaZENt} zN=h3?*!Q@7i`$>uHVd;}xzpN5YrN1`_N(^PW2{&1wtQbW?Z?VDy;bNd#1v=T42D(8^Tyis9q_%PQFZ62 zeJvY@Iq*Kv6B%1N){WPJ^Xkt6zi9mme+Xx^zFdX*1NCdPhK0{!eL;3a|DQOM=(iI4 zYx}p64|yAXive$~8uTshNQ+H3&Z+%EriV2{{U_k1RpT7Nnm&C?Lg_bwfBJjidGODZ z#$NBI*F-%ge1F>L$C++j)Rtpp4t^8Q04G@&$^Jqn60R+NLl!-nZObnu=E!lI(tn8V zXRz+N{Dye$n$#tTaTdR>y)FJc=c4GIVlIe-BOl+*Jq$?sde~V1hrTfx|@l4hhHM= z;iNCp;tMqIYO0Jg;X8egQSrl(a!Ibqe5R*oo1RWAw1@E?tPAUt^nRoClp_R}3^@hL zms?M8ljjA8Eh>1%e+17>Tz39fcwWJmW>x zqn*HXJ^HT%?H6z6HI$xfI>Dt@6ZCz=YBwvreViFsSHsp!xKF~6y8xH&yt~r-t3UMt ze^C0ULj;eGJ&fn?zEtquodqBNv*14hSD^fbL4qF~Ciu}-f*)&s>d)>_`oGf%ChgHQ zpE2D`sqbqRIzZ`#E*9inJn-NU(Ob=u7b<@f^|#sL8KrmJNYFkxcb`G&-8FyB9*-)$ z_hf<(0HEK^gF5q?N6%CGiJJtU7LC)qc%Ra*X*`)h65=jKaElcI&li? z6j~2>`*zJmt92FH09~`ut8A-v`Q%Is2V-p<8Mt|L{D3cLV;MLG^dD(G;fMkMNykJ! z?1OL6`s}^0#Wsr0)8_fEOHXCK<^I(Lns@u&HSb<8{~_x&NBvIlM2%x}r|9tF>(shY z6Afp*f_Jvi{%-FeJYt_6@f{r>I{3aH2Jt!O&%9aw?>AOCMjjLU%W04OSikpae0h!=>pl5|_R_gNx4xhCL|;Z9%uC?Tf^~4#lJ<=E;vC={0pf z7~4Os%=*=7HwdO(RP{itSA75Tu`Y4$ju8k2<1p!7fZ#DKk52hay=Ro8-lc;9aXycs zel%0O&irPN6$Sq?4j|^~v}gy=dYf-oNMk(TjdKmpXIz(ZPhfrTVh>yQ^j`ls+pr%T z-fSKDmLHm$c_?uzM458q-O?HJhhSL{B0eG=O*F;@8Q7-#I8XI=*c&H3>xfEcHw zeMEPFMoe9W_Nh7#_^rRWhjp8mg1;IAKiHqpZVB@=M~oZpmwZ1;d^A1eVRs-Oaj_26 z`m3HigU{CIjthwKTfPqvdx!cZLozN7`0oY(fqX#PbAexH9G2+&LdhrLo#cxER~OC~ ze}uI8Bl1I_e;tpNd=biTd=l+ojj^vtzx|HVAI>94J_-5h2c`8*;9b=3ieD&OY^=pG z^?Zqqw(yaxU#;6KxbK937-RBNsDH|R%D11tb6-{3^62z`UQcig^L^)9;%w{}V-LJz zKI`)7l_tN1wQc>+Y2IVL>_o9PsVfL*-3RhlNFS`{o1^DPec%_aBdp#S%` zyff3{yMTAdZvm$NLHqi$FW&aUIxC~EnosZ=oX?5T4tNdQ@p2w;ANr|iNZI2-&mj3t z+2eucUSvnU-?6ody)5nRf)2(QQx6I>_%=Tx4S7`J7Sa5%esFHuw?N*>Io_sYc?C|g zeL?4cJnQ`UkM-~~_b&CAfv@nLj2jVa+_Zc=vsdRXquUnRvH-_^uuQ-<(*IeO?<}!D zyJZB{$uu93{@E-GDt@oe%r$=X!ECR@MxZ_g_6p|$bK{r>1L6c?PyEn_=TMLLgcxtf z0i0kewpR^#U(m4#9D~5Jg*BE_xpji~IaX=z5%YLx*K*7=&QUq{2J*Qk;Cse#^B5BV z&%HEM^*#tZguP*YjXwP_=QI34`L>60oVvxbzHPVdW7Bl{-bqK>mOIb=qC09GQR|oF zT|v>)d2DsP*E*wJx}vpZBev(5I?hqxMeC4GyOh$5%Z7aW4zzu*Whk>JeeJkx#diDy zJwGo%v}@nei-|6>UP$q!Zy8Mb`YS%%!Xia@xI>_+$tCP0t@B{>ZdR zIV*X0h4)>zn(C!bJ_yB{(wS_XaFdOAJx_fuFNxJLLc)=>Zdc=kx`d&~LlTRhs8|F^)4 zFXK7j{hWK2rF}?=MUdl8y!OK&)E}MivcC=XH*ICS)}n65p3gW2=T4zh;(Wn5a#PSN zfhW-?;vuY8pFJ##cR?2-X~)*aLBnFNzjzj*_XeNexXrxky$4lik@pCrFB;G6_eMK( z@-I8T^Plu))=AyNc(!Jo#>mHe)8^0L!Sb~Gi~qL$i~nAy{C|P_g7sor;qW*&@_qdF zagjz}`9H?Q|24NBpH6<9f9N0Om8#RZd-S;#`56C$t^~xoI)7t8$nNOd8GDHS8ln%- z-Fq!*q_Ja-VLlk!2hT9}4d64vr`587&#}HJTMYdDEYfIe(M1Ih*)HMhfbo9l+p#V5 z^fmrt9gg*p;5@Nb<2j5$`uedC z9L~jqGoY-(&*%Qs{r>Bl^qxukiTD9iQoh=~d772Dj{_wBwXJwy$v-;|gJptrO&!x{jgCvl+CPV@9Md zW|5seFP^EyrnSu7@ppXpw7qb%ec>xk4#r}yt=Yf&q~isXhZrf&4RI~-Soc}!Sf%q_ z&gYBW7V!{#JU{%6@*S_`n-iIqtO9e8w$W|J(sX&V7)r(U3BpsC06n(eSA+n)pLZ_Ikk>ytO479ckI6V(Ez)|xf1Wg z{m3=JC*yu3?-^Tb9LTir4E9gz2UdCiSkHbO%j+R(quKTgriBZ^&)qx`(?$N$eP20j zkjfJmw#)q`))#qE)9$e!@P6`>;q&wkKBqe1Q~T)~`JSPByroYY?O;z(HU|67A`1g< zrhmo2xBK;s6pPI<*c^N9-WSxa7?nZhbZ51 zzUe0e>x(*IfR0giU7V3f)8-TKV{SSYLtFoxTN|*^6z@u#9j03$meUv5L+_$ z3;7DrTB|P0=j%0uBkDcRRQlk53Z8I~;3+2yo_m!b&jUQ~*jmex)>&zll6OY7M2X`350{*v6n#Uan>Ogo7N7`bx20K=+Wg#6Fx^<8R+ct!Jj@^OFB!J2Q zXCc-lXiwfN#{asfWgBmv^XB2PXBHODFLzr_xUwLGPt*I+XtX&=32kFkNb&Xr@7YCQ`Nq9VY7ySf`!#=xArx@ASUiW>2`EAoXNm z*KglC*2Oz3&(`6nhVg8jFWgwjT_SO9{t|-6%b3o*i zcLS|KSsKdUI9lbFH`8w+>N#Gh&tU88SpNLU8fq{3q}BkL9Nw3AF0JqHQu{yj0pfj@ z(K()|eK?G9DeF}&(K1zauhO;FVP(31j`ftEwocXj(dH4?_LSCt_4FsocN{e8I^eyIw`#uadEw{kg&a@EUwt#q8Js5>w?O_#@ccX5 zEB{{y38rk;JVf=8&iuj;ei`^4&m~`2eYb+1`+kVvj|&m%oWQwFIX-Yb=E(~{({D&s5*OsNRclLVeS^|9({U zKDbpdXAV5&8PWkEPq%a@Cf>|&Nj>a;2>lV_-F6x!IkTL&w zeiN;aX7dA--g*f^^W>E0qTQYLSNy6d`^FMHICvMdd${&rbL`?u+vkpD z{#X80`Ii0L#)>r3ls!$#v@Hv8oWWvyY+pz8*@N$T@V9Euav17)BH!|uXXE>jexXnG z=%*IxygSgHJJOchj4iy=9w*LS@DAf{!spuK4;5tmT;$hU|Ltac)#Kd*?(lf`0J*ef z7t_SLhmG{~!Q0|F%Y$q?Mju0{pT2f1hbeUOoTur%mLHktNjkT^YRn6s@4n-(E>im7 zX>W3v+Szt4LB~QJHc06|JpzdSrR`4JbUAI;kiYjbsz<-QNb?Q^(7vZnA5-OyFJ=F| zwpF&gi*!DoJ7;~>KPP#zbN5u5@-UR2e-qMxmk7VNQ!duF&D_;PRsR~zfBVLnmA*07 zA)dQg_}?<3cCMSYb!%;Fm-@bK#}Uq$H61;oK|Q_c4^J|o*?M~4(i)Lm2sEN&ktR=J zeQ(EoGz}*o9k`<=&4V+GGz8#LNi)zk6}~zi_z>TKdOr*T1g_7RrbQ3aw(pjG+8?*? z@QG8fro9J!H_ttX{M(;FyO4$75o3h4Q!NMx{)lTec(Yt9lyOBJ*v8WS8vC2}hk*0} z0QlzadNzHLD2_AQ=oiDd`Y7svSG#_4)>W+USTE4&;hn+Q%pci~3A!fq%L;mTfNqkW z?eKw?$3;8f6=!)CP<5=c8sDe+15J~-2>6hJiCcYtZj>|L@E`G5&IX^QF0dFWeB%jKN>=ML57VUC-+NP~R#2 zm*@}fFsQ4JaY{a?@WuAUPTeBxi*k>IZ=@fW_(stEwhKr*5bF=gJ|21$l#gS+^A5MC zXG{2vTL;f#Trb&5u$zayMQ5$#Bj}^$ppOq{{Z>yx^O)98XvbK9N15(W!NMErOf0^{ z+~+g?sCw5gDwwe=Er+&EXW^MFuPk!P?erY=^e`6Wg)o+B*IeY2zSCGjxWBTzaj0mp z>LAT!WqG1?&n-u^oRBm&>~>5GTORnn&gAO*!`PoPhxB=d^<-Mp^1&e=sUB%Z&@}6g zr}QD`3tI2s#H6*XZ*bSSDz`lF(WHSM-%a_J55D}V(y#ne@L#J7axH*1XpUgInM%B% z?oNPTW{NchSo91|P?~xK|3Bj1Gu*0T=@#B5K-_E1ISr_Yf=Du>C<>yYVme1Wm@@*3 zia8Pt1VPLJ%o!0C69!Be5KNdbp&%we#TA?Li$d++yrKh{&Ldv^Ei z*-U0nfpCc&dr%MI`8sP^J+<*|d6j=lZW-<9^gI{&i=(?#sr5#v65V}>5UTCG&B zO>e<47))PoOn`D@~{JeEkr@T>4cxQh?jQ^<-q_SpZNo(0cVQ?q%+ zhHB>N>{s$N5puY|mug?Bfgk>k(qF%^e)8cIv^eB7;maxHGT}=#XmC9_3Gn55?OEl( zBYp$!3f%`q`90^!s_`ZC0K;Y@bj0F(AGFxz#mNud6F;&4p)Z)tIaKK?nSZjYk8>f< zcfga-u?oBhAF!cQ6+SECZsjr2xcsd%_@4ZaeF+m@1fL%K_2gyreA)oP*WM*Go+tKx z`(L>i#eG5OX)o~!{0HxZ@}MoZ{UvzkErJgjFNXXl_7;5lYQYz03%=Z1@RcJ3UoSa) zRnYw!)y~%U)Y4`hJO_1%0pGtIOdiV;CQ8bTK|wf zWLLpsY+jH)QS(_k+0Kth_x}|T{Ww+YOYt)C-GiS(KH%`Kg6I4pc)s-;`4@a6c#+K~ z+PT=yg@Bjz61>!S1Eeo=c;)v>U*+F()uT$^a-85DF9=fpfO-$v_yIohu;8Tg99ln+ z|Ja*?ll}cuY+plu`1^gfm(tV`K!2y*fHWX=d%#oj{9@_(%74Mu3(_wbei^j!1$?oQ z;7iRN3cpJ)`FzvH66L1*e7`2T61r8Th}}dVRw(ygQ?)baBtZ0cZdbv1+X;T?^Z!w; z(x3bMeN!k+`xfXH)vU*Kx#n<(cMCQ!z6H-4ye(KBDVTpI82dPVLt&3-V(SR|Htilk zha(>7DjO)DzV7gRRei7QvXSOl3$VF;2jH68AIq-eT5jp(dB=+9tws0Bt!+M$rcM{& z21g-{{%&xW;D*LyBHiIq!A(~Z+(z?U-l?6^yL~OVm)1>rpB0qee>K70M$gesAK_2Z zIq5qa`FL;G>L31`(zMe+K6TD;*0Sd{l4@d!D}W6UfW9W#s&_xZpveCQ~EX^m)Jk= zzhC(iH*&ZT5Z^`H8iNy&M!$IWM*3l`_wppeJLFUL0mw5nAmc~_K6!wi)6O61rzEE? zKjY&?n;qm+W&-@;dPDm8qg9W7B$0mMM5SMO7ZBh3>NSF|+j>O$gB1nmeIWSl%7Q=s zEcl1R1)>|}zieC~)2M0Va4*57gqPB{1&<&1;SH>Pq#Lg5(C7-%jXDS}`?O%`5<%J= z;dxVQ5ARvs>H)U6N^t#$1UC>}$~Nq$bo<5*I|**IheI#lX_C^N&lik)hkxk%vt5TO z|6gYcGBySJK^YTdQTy8XAx(R5gFTh*DY}*Q)Vj-h+WwE{hdwLV_e(&WQE5Ac{38rc z0FO61hwnPU;fWtBJ=nivxZww$kFyagZ|wQUZL{t z3nP1IHKiZ&@p?#fA$!EuAL>nd4G`n=sI51o9~~$-Wn)0}^Vy{ZUzjHN@wbAX{>$MB zf?q8w`1L1(-##h$lkI0{*L@I#EqcU*k{=5^|Lq)=`_0w`(zN*l{KLl8;Jt)-%~*$@ z3oiM(VA#MdGeGHvQv_>;UwM8X(l`e<>FQ8;nK!q64*Bg0hc-?~uYJ1Ux-STBs(H)1 z4pw?Q8xQcu-QEGj`FV#smELh3LB=CP{?4l^P5%Wb&ln_t;b)t1xRBmW>oVW#EtTKj z#smF0pe)$y5y3Ct#UlP1c^OoOvB+_`#oi=}f6V?-) zsQo^Fz{m56C6)i=aKUG96r5(`ih3{Y>CnILrKgmh?&;TT+)?iJQw85>FF3=;<$Z7G zgWk%Y`x_woJ&$(rwC&=jT5a5(gSq#=J8ZtDU4p-&Hk4^1J_-4dV>3Q3cnSBv5wYI0J{zcB-ZKbYjWymt){jIh*a|e;eZ(&*M&I%vow@>{LL!=XuRjKKC`GQO;x1izXrcz4Z(I_}=zB zqfrA06&oA47e08m^R*FcdbHsza4gosrIrS6-TWmWaGf!<19w{>ZTYx!{_s1NtEpK7 zGT$ZmU;dP#=jZ;0YZr=dEq&oQ;J)$7om#W)a_6~%dkTlrx#pbPm4D99g06q6xE$aU z7zY8ctLR6>)zUtVZ~v#!6Tn?s3ijEX?WEWNS8and#%#R4Rd-$R_1E0!FTOeGV-!$5VwA;03 ze;mO4{L{M#ivch4d2!|SO5gv6(jO>odbG8#Xnab`KE`LMFLCZY$J)d@mf4(bq<24W zYaIDs8vXm5KAiXm^HX1<59!^I+x5GRZBm9ueP!DVu%6w2RQ^@q2jbv<^%m3|s=HuJMy`qnu6ly_6xE89B7 z`rg-g5{!S(9Rv>_4+!6Ak8G=S%)_!hm=-PpS4LZ30dHuh{JQZcp0j<==q`Lnxh`?( zMdNue9;9P{elJ}1vKjqQqaT3})p)@86To5m<^v48@VK_xOMsj7LtrrQ0yLcWBWQcB ztpo5IYzs6bVr`7>hkUH*QAUfb-_ZH~U_Hu)5X?T0ix`j-b~ZS!bffK zAA8Ct8!@l6@trJF8u6^suXo_{()Tvj*js)bK`8kO*2?5f`8?x!6m#3`$|=M-{=EnMAh?y{U_p- z#QgZY%%4%Yo{%!BuVbF!HKfyXwcwI3V3#@KFY`-b&pBj~6b{lhc2Zz?rby0p4* zCgQS`b`cL%3fc0+sjOGME-QD4+P9NW!tacxVs3ax1U_crP^5t`A!`i(0efiel*1lq zzhhZ1*)Djzk23FuP=9P$&)+;lF#H7Y4hYX(H&yftYhs9<`GDu4D;Y9^nO&9t(_4VB zNelb>4YjW%yZP|JLK$?-6~;8q7}fUdVLLcvIkqpICanAC`Y4_5Y+#c@JO(f5bSC`Z zCEtVf=ndXYdSlRO=yl>vgg?-0>v<60LH=$VKeNW2rsI14mF-pNzn3kB+FraAe__*6 zo;;dmvI&|Co43+Gwa1lbUCXj5#shf(!!6u3Ic=@}AA2(K*7pVbAGF>2Q$E~i8|KOP zSbH9FXX~H%W;~}K4)mY=lf4&w67SK0YXfbs|GP4{6Z10GR*ZWZM~;oHy%^idJX`zq z>3*Gg@O5kT!gjr)?}R?Py@T?A11Z*C^NNok>djz$d+*2hm!`fWNIe&PQ>+`_p<*|<5pyTvEr(Np~tbi?R%J?(Ax++b6r2;fZGFA-iI+waZGHkmOvXz<5#`sR>t1y zDqaoFDwOBi{sx>OpP>JX#-6e^fv3(BEdD>%WY9hL5s>Is*fPXjcF-rMJ3$xNw(Iw@ zUp{}tzZb;=lp9$;@g2APLTLX>9-lMfV*Y&|_Jw0k^*Z?PdIMHA`9tpgQ+ghDK|Kptvw00`^jXAtYXM2`)`d0t{&J}y9 zNz1UWVWU^;c2DXz_^`~^M%Wv1U7?@*%x1mhBQtb6sdI+sVgEj9FO`cpmbB}^ShHW4 z>+p#~dmGf_n!|I~Elc(>v}eJ5h0mKoC4Y>m6t8&~pjfQn!CddM)+r9I*C0 zR(H02U$&F%6YA+Lpj_A!_!(Dzjc#$hh8{!Q9%!9?4ojSe=6v{JVIYP#onl=*8=(%`p=|;NS`bjNYYOZz2nd`4xO!u zdSCKC^^Dd}#b*opbpP$>3wWo^c4D83kxvP_Oo;li^iSI?#W)imhPtHVoBMgSX-&cN zD*DIss?!yxuZF|2D>wN`-T&~1>%N^zO|EMVqcPe)W{8)&NkB;&V~(Ax>_f2 zUN7e7p-(^SMy6Bj;66_%?c-(peu*}Kz};Fn;8R<>F zVqZ$sfxw!ieJS*|`A*o{jd1?*9NVW*-tGLwkD?sUiSRWx+vXj8i@R(3`M_GFe?gpY z+4n9rW!}*u|AY%v{uG-d$jP{W;2ZgEE&aT?fuCnk{-NDeK4d98hobznNvxl(au1(p zd+iShom}3zVZY_w8eqgt;+Wz2Z4aUx#*q9x*6zKJAdPZ7s{oQ;0)M(>Yvi}6$r~NU z=ZPobdCJbD#`~31Jl%ZMk4R%qTvsvYISb{kKUDR{+FB1^49KUhILcF3+~7@kj`(uq z>5%@$&he0M@tn4?>ndW63^#rd`4{#FggoogmjU6&{|(6zb-u=Pp081!XB(s`Yc*aT zbH}+hy@OMb4*UWfG#6>$C(r!Q_bb{k9b=O>=+1QP=lQ-1l@42V_SN<#oSjxu|G8%U ztjT;o6WV{h$9T&B@Sk|$G{I#ORzCVr|3BvQ;P25M=8^MjEjpr2q*=+jY_hUcVV=+mknqdfKz+SdWL zm&_t-Z)X9d!ew(d*%#GW9(&v!x?Gb}8_NJm;Cw@!pG2~;o77XWY zKf$@5`nJ~Qaur^Ia(BFsxQMajm?2FZMEpkj3CDW9El+w7qC_`byU>+FvjGh0U(*RZ>Z zIP?+IfV>y_;^&<3`1jShiFr-{<)7q_K$u=3 zjsrURxBatuF*(gktXo~i#x?q+?-GsEc=`9RedUV>6(6Ag_MO zRO6q5&%_*4*KHNoVZ(kv-8JxU)V%?p)Nl&QgYR*lQ@TrsOpbTVw&p>D*~X%M5-)4G z1)nbMF9ih79`Ga}_Q3;}5FGMv<)3AICZ7A6D7|Up3;d!EBKk$0L*U}ex@*sh{rEiV z?X=Ksx|1L5-FD=2>tEQHF@}w=>Drg=jDfiz9}j$MvK-5ce}`Xa#u>zTou{*jzQyiu z498(78L@=h8DETk_O(x63@(Hg zwxj!DK147`#PTQ?qKtF4p4< zYu>D5R;2jP)75L+bhd06v9pkMM~Rz9|;Az`MX3(gy?PuiEZ4;u+KK70>J0 z;DEM}X9NulJ6M-7giK50XL17UGmo9f?^5h=;L=Q6S78f|>9e9`9aOGj| zPQJ8dii;>d6gctID6|Vc@y{M?-`*kK+~~NSn*jZOI_?$8kN6o@XG-9z&!K!hA|3tX z{NS6z4rHpyZ9vofeVX$&HAQbb3jzl|IEs)ooA_X~0%6ihlN1C!Z;NSYEF<U$D|Ev356&ljCruLav zSuWif#vF#fsK>_edGba0%M_-|;Rh)0^ujOB_|^41e5-|jmyNY2M7+-IEcGv9nAbmR zq5o%(XFEClNno9a@zlmFm^>v1Q{(tohdv@}X2AjW-Z^xPHGUK1H*4=+l z;57M+Dj7pLd_npBQj!UTEIM@1!>5gpSNMWX{?nG$+$Q=Rz9s6|w1*!Zj@cSUW6?+V zEoEaC=QECdI)8yDrynSkb$Pq|b=cZNp8K26-0wTvc03F`;(U-^XuTHq>D~!ns=t-|qi9!JQ%)W=no!(p%&`#EMBTvFI=m&mkuZ{X_E5 zhNGaFls$uXQ_hGr!FvLH5B;%XFQFXU#xKf(Ct+EfwOAJ4!m=UrHhcr09y;RPrz2gr z9moWTf57*4Q}~Q?8F{|9=F|63y*l^2!8>tYYj5+qb>}JkoZ@@@{wL0KL7T)ApwAI6 z!~N6b8|V%?{7Dz|1%!Sld{_Z7PHw?Ffk)vNGyD&{p|eS;)5ds?@!{DS>vx3Cj^)wD zH)4J4yr!VXmCu)Y4QbGqK4X}lU%jf*WBw)h*<`|E^X~XZ^qA&VyG!1jW z`x51=P5Td=iM1R)P+jI8Yr5_l3%X(L=^X3rk;f1ni+dlw)AfT`-uGvY^TqG;+w#HJ z3QpeuP&6Ror6e2nGj{Q3b@3?v+dKEI_>iFt0R95rei!+shqn$O=+HZd050!#-jET5 zPndSgA|JAWcAEo2w$kn}K-|$Wz7F7k&5#DZ47d;wd=uAVGnXmgOgiW|l^=C4AaMHH zX9TCMrt*|AKz7hj=NrWc>gakQkcF)@73J`pXKI{}sZ-kmGKh;=U*{RfD0q(pnFM7K zsK{q(CCl2EIK1V1&_SIn~V?cYPeR$3|MV)K1 z*H2LXkADC{b`f;#=hKmf4CF7hFIfiga;2fj2QF_nmgVzqmR`f{tFSM6eAMKpB4RU+ znx^tx8zCD6o#fhpERHe|Qg3y{12`F zxW}O#5c=o3%ktlbyTS0sMp+5cq>;7;PeVP(%D5H*JKV)~ik=Swf(8vUJ|Sc%A*XE* znXKUr+Mz53aE8$h$T(*RZ^U1ji~w>q;tX(z_dB3X#0}7U;sPM=g#qKP%xzmU`Wmr0 zGdhlMqV6xo#C7qKjyq%aMPKnv++%Fb^{&KP4c|*aH(%WX&#@oOw0Q>n!PW=h@3vmB zE+VdO13R-~zi4RtBw#DyOKIDkS-!NBeJ{Q({O7v-y%cvXS6!m#SA8pZ^+tebXPk{6 z>ecgai!q3pPaW^$^W+O{Yn`i-EGYc8(r+s2otLS6$cFB0sWkn+*w}uJH1^FDl%_li z&*R*^+-&3nm-2J?JYW8I!SGw@vY8|sqc0|ur=LjRUc}WtPVY(nA7h;l*ErTmB zu}1W8Z4XRKX97#1Gp0Of;1dBcV)z=*AXnrw&~HAo_xw+u;XSN}F=jp6>p^>5Uq|C_ z`vCe}Z!U}{flj;oSFG4BEM!^DBj$eWy+~ucCKyi$IA=XRXWv|oC>a^(J?XZM31qzV z6$8AWj~LKE`q04m($@kYeGFhN(YD>zRD0CJw{Wk-_|SG3^A&tw+@&q4draAA0*{>E zD`px#+Pg8IPrM8$o~v})75?97{rUVKcW5ljv#HS;)Z_o<@gH~;`$*V7I6lO_!Fm7w zJCp@(&|V*XuO}0?zSvpg20(l-?fp=OJP06p2itqw@qIR))%>b>QNshYv&`Cnz;m9v z;5(^G*Q>Z&G@Ww9kn26V73+jfMd+oAeuFQXt2QIXUHH@&Zrghy3n4Ejp7nqKA94}j z(^C93?jaZl=e?4jx*?mg&mprZ-2WT-&4@=yy$Xy4=>%Ztcly4R&iujGjka&WJh`9a zaU~uJjuFTU(xDl-Y{0)U&?sG56!oRH+cUKM-o=X*<^~S%Q{%kA;aEcf94av z;$9~1VOSRHjWk=hTRBGnce@QmUEsUlQ*my{hih&scm#Sh;6juIAMX6McqF^i?2dfz zGs}QCXPN(&2Ogj0jE(>&(tq@KsL{I09%0WzkA?q}e?F|QJ$Ijz=iNF=Dx!0dEk?+Mcwyz#(KLB z@5Gsc_x?NJztIU>SIzie_wYVn?q7_uG5QDv9S(UEb(zuc@G*b?P}E01;yih2bEflb zq+pBbf-_bpEY|vikbUF14fLM;eekHlgUTK~B+_&lp^A{hFY)Nut4w%e8EQY<9uydr;J%LhELuizEh zW3#I_RQYTB36A|sƬ@^>AJG-&(X!iTUw${v4G<--^18(%3MK2T?MMH=J42+?T)-v z>4>RBU0cxLDK?*Y&)ZiEx_)Z@y`ASk12?pOfk$%reTuttY}rX58%-pM1=EHuj}$S7P0K-*cIl|I!N(w8DKT zSUC-d2&KBqBH+is(0+f4+tHHh=UleRXn z*2cWcyz+4?3-UY;UU&X@rgO%q#+bTq`J(No%r7o}MUZ+o4e%fIoAgfqi#cx~&uAWa z*sz5R``fT_{PcP}$2xNx#jpj87_-(_=|f|zIcLTvfM-<%(*|LQm9A>x&}?tk{}5Vg6&_JDQA zCGMrHKH?GjH>SOT--d4u{eFHUXb@#~fc#eA3i)5a5gYM6`gWxK9zoxXc_CkHa2NI? z`96=e!Z9#h!?%5?^^m#0DCs_6e{|dQ)4`hUWu>bwfy3jQ+ujaS7Ztd5bXdp*c@-QF=`W+vajq3`DYtSjdN^xMzq*6+9n z;Qups=J#{Hu3rQHL3?=*q&d|64f@z_O8V}QZIK4LZ*%2g9IJT7!u|Hv)Zk9V`MpJa z?pEnCi^s(Hx!y}^yZtfjYtoHyUNY{`^U!gQd)n|d`|GZ#hjYOrMneGqPWRc*7WPdk zhLh(dJ8PG93Zze@3fjTRao zgS8O8=_CH(;CXy6@q%_JHXnu~BUrxj-^Kua;C;3Ji>?|@AwCE1!_Y6@hk-`(?g4u# z?|nd1d7p!O7v9rA#>sQHXsqr!OxB3=CeKxBUw2pDAGckjtYOagD2p-k*mQv_*(cMO zpSfOAoS}>GIo@+5pV!o^TsimoIWL{l;(Qh7qv~@}oQLAvQ+?iv^Guvu;+zuajfkBP z=Z4_>o!?)C4-bCZ`D&ZP;O$Dm)5Tg}EKi5|oN%RoJH|NaRh5#Ra$D})tJz5sv>*AI^mkcdZ@du-1olKs}1}0PYfTeZ;%oA z-Bs9@h0lDpT}NgU{JPak>(SRC*Us6tANlwC`Ic==)Y@m64n-=Hd;AH@FS%UJ{>Q$` z|9?F1<2L}S?m>i zN`{=#w$M|( zR_)-7!e=YisfWJOCPZVn=zqgW&`^$-=12cMf81wyuKyJsSkvjU^Ggra<=EPHV_$PU zm(XjesW~8xkMtIBZlnDr#x4BPQ;r22n>dGsT%7b9G?nxlaD(mm4(TxWv5v6qKV z5%m|4=3N4wpK-LxhaYvyL-E|>Ch2Y(`VaIw4%s*FK2VQ-ppbt3BGrFO>sfkIcpmg9 z?zEd2&x-XG_Oz5cLJuPRcCX%w{nY(c>_aH;_@Xld^djg78#qjzKRgeA*R+MiT>@>S zP@i%o!0`J_f6jP5YgfDn@`A8qqfaT!NpTDNSMg75awy1s2HdamylY3f@tdn0@gD17 zl4JqeFY%oGJM_W09zf4{$A+_(`}fd(ihQ1>u&?s01AT>VL(wkiTlkp`c@Otpl&4() zo`)U;^&gN=Kd8v(9Uk^;>N{W^Qojs*!zQbvUEF7F`Z^%adf^Y$b@q!L?d*s0^uvkg z+~1LQUHampUV479?ZL=*KY5btAni72;ssEjYZ36Rdr@Bau2==&gUP39{iwf2GwRYT z;NANzkcV*$-Y;S+&)JvxT!+rP+5Z?<#+91=06>wL;s$!|*I{!sp%lK+&RkZi3qwU6?jHads;pC0RQrXcTffU6Bf>&uO9 zWPUjtAn1N9%bU$sI&2cR*-zPDgVk;}L~A`eZ-nyC*B+jQeeBdb zl>fAy_fhW^op-X?EtLM!a0&Te_Z9p`>y05lpn@q&$32=#a>G&SnpQ~^G|Kve7#yu|j1lr6#SwF$cP}Ye3{mYi@cd4J@ z3}iX3J6n7la%a%Xsi&|^#1_)sJlc)3>y7>RymBvyb{{aD!2Z_jSw54$dF%u3*Vx7@ z`XIR=#%v{9H;`Mqe6T{3t?>vrrHFDCH3t z3&yp@JL!)B>BP?iuNLvygmxIu29WVc&>rJiU~G7<%42`yU4V`0;_9F->wy1T zqz-tyJKCXcEq;(Im3sqX9*;C$0k|9fN5k*vzLwtrzd<#%V>L&$H`|)V_}sS->(ox| z>~N0q-#S=nzwcBWBFsg^7oxrp_K;#7me;u)Ymj^$AoWuL8TSX@xPfR*^69*b)_f`A z*zf)iwL|_7<}~_W3A%xf9dn zi1Qx4pvm`P%;~2KW4PwpD2Ft80L)*+RoQ(Z@-fyCH{E6Hl0%?;-`RK$zO7$-y~lM$ z$`S88;*(FDuICTf`T^Ytxl_awe}9smf2lpE{MWBc%hnM1xy8juW8EC$d(xo8^gR3^ z(MJx}Uc`F{K9G2W`jpq>JhZs@4UE%(`i~mk0MaiOAmuEmA8UH)v-w=HPO(n9ex)?! zFjy}UpWq+MDxYx(kWU*)z}>a(^N7bBezV9&;(6#GF+Kp&Tz{|?pR|J7BVUR9&`A%! z`oCPo=S2gJbL(J+{2^-QP&@MjND|r%OFtw8#4sz=+Iv>}Z}?rW@23&%es605YcqVr@vMY1&t9*wes;(kfWY}< zrm$RgnfQ|IvJ;iQwL2hi`~jn~~|dfaA+NB)G}H1UugXi2Y~>t$D@Z z08Z|2&yhcP8Np#Mt9-<+xY^S${-*qw#gE6GcKA(CF&=&!rE&}GJFx#OH31N~L)j2y z5Njf7`PAzK4u@a$ZksFrXsZt#Jz+0E)T7U3q{GkpmCgsgx)PuBem8Vz{Cq5XdCW!V zc>0}k?30DZ7&W~e>9Rlu5PGWNb36R2h5d5)Z0<6e{Y<`_Z|}l>#MwRhZ0u2ZW!}$i$=)8r^C&u6X&g$%l@#$|g8t|fCfLK#kbXEH9O#v}3yvw&Wc2G_2nDzLq z_MUNqpPmnhHBqCorKNU68f&FVH^I$pePaKK{q0|yDBaigTjYnIo$y6*_Myrj1*=ytz#2N>8o}77 zs^g8``XQd9y}Mef+{6xoVJrB&_Koc2UdTtgf# zu?CMiT=}Q=6g+*To)0-qY1<~y&-|)!fGGdGXjuNj$$I{x@lL>@=`&Ss_E15_V?lYw zV*&j9P33=iB4N?EEg*2IaWAEtuHtYv2*#Q?7W=APXzz@1|aJ1IZbeXU&BWh zdLHrXBVPTvwa5o9pJy}>xE=e{;7KP}c8DLT(cGD%moR;W==@>1%$VpC2jfL0=h*#O4j_YRR|N zmfK;M-Tpee`y=Ex;4kSj{P8Z*m^=FK1MD^wY3N$+ZM+k{`E0|DrSZc#=I)1?mw6pM zt20h-x5jhfPWT${$%9lPzW0tRbf2IHB#pG+xPkkYOVeiLX+7br>;@jfB zG}gNFk`dE4;jrTn@5a`8RCPly_-XB3*-6crANs!8$2wo+&6_emKWhvj+t}?L{!ekv zV~_b{GV{ZpK688d&{MAX6#!28-A*y+3vU-=yoAm!9OF9oCgB^G^YCHr<$<@+4}Wiw z@8QpYQ=CiS3FlDwp%_ERV+SKL?)5YBG0uB$BIs*L_bn(--BPUm;5R8tK|b~E zu@^>6(TExP@;!Rb>k9-^4A85QMmr(PrwkwKG~#klh7aB)Y~oke-jQN&wm5?Al_R!h zyFp5C-U<+7NIf9vj)e^W_%3>W{PBVuN4(E<1RcZl!kw> z-7MmUG?|Dr_DbrA0;ZURx2Rli;ZnvpBH(-b33oykmEC-e$_1YrXTrD}xTlSt^G?9@ zn@(5y*AaktpU22kOgzZ$Yd+_5`BgC7*LoN4@ZoOM51yuebRDxiL6eM+>K z>>9DY!(QKUxS~T2I`W?InQMyw!N)Ofk*zb-rM)|Rz@KcnG+b?L~m0 zW4YOytXJA~f%5wsoxt;vqRl1h@*>UHI)K$Wq`@iW!81WRc z+P(N(>k;dL>k)gm z*+uXvq016>MBHn@%ev3n689A7t5L>*y@z`V&Qsh=u>M^4MQaZE$1j0CVeOIjoBjI; zqyghzm$r70IV^E9@-cU`Wy2i#y@F^nXf@?^&?mTMI?BPGeZ1i$@)-*X(Cw$>rvp4E zV?qIvR^mK#PzSajde*vs#eFT~X=2^qYPbuz8EGTxkrslcxowN=$3d%j&k8-~A$}eq ztwa9h+oL{c9eMQ)YKr+kF>T*e{__<42R^ucrsbtQn0uROQt8LLQ4V9k_*a0{cRO9S zWjn>=HU`EswFZrOl>d`Fx!MNR`Ob9z?>4Dn^Cx>D%tzR!#+~JXwidC*!$#G4Ala&7 zUf&Q-C!4{gjzM|M+kS@I=zH+F!$dn2KNrtkKB{|jjQd$*SYG;QNQXRgyl6%~L3?uW z{~^be{XWKfw|iN?I9j|wk}uNU6VF{fNZL-Hd&t|t))63M!~@PZx@YGAy#K$J0bOo3 z0c8Q*A7%KJwEE@Sj240RG|@X0FAd-Q@LFu2d_86NSUaw=+7=UYA~ z$QZjA=dcAoZXxpRyoc{txy1kFHV3h6xxaXxGULsmtrfd6KRZ-=T-e!|&yUc*3!R#z zhZp>C=(fzV`NBF3+T=PUiJzp6EO0hrSr0uE51-L$dB96zDGby2%$jDM8Uv7*+2O1(q;!U zT{_$Lb9;|uB&BagAPqeJQ)|8S=eJCk*XRa_KCdxSu$9I>*_<6~v=85MtnH5|ck=au zPe{g+)n3l$+491#Y@OSX#(0LURv+8{F|LQS61?kk!LZ4ic&E~T-bI*SYwcn`{=)hP z_~izK#TI=8=LvTzvVX+6{PYDp!+l(gL9e%v#kTjkaNV!iaO z-R*o1I(W=W%CG+Br!@x2el30bS!_4+`;qjmry1SESj4wZ|61wz)}`(J_{Lq17re%3 zL7i_tZ!FWrCEW$*H3c+W109L^iut&1W#r>s9A~Vhm+ae-j(3GDkmCtFc3D?t9M?&D zsmZTb=&upSFmBm?XcMsAhk{{K5b5SSS*)>>7gA3d6$dyt3K9mUB~?L>Q4x^vONJ~MHx0AZ9HvV8ovqn_<4flzC3DN}s#E8Ae%@#Ft<*{y9{ zZ0e`oiXL0e0=D z0vSp8@}%!ytT*=q8}ho)b1V*Sz1 ztGnKL=>3@d@er1koDqEs9b)R3AWa=%K*|vT!~QYZJs!jQ(t!q!?02WqH>(dJ=SudE zuHzH-d=)!L@uWqAGf^LXZtx2r=8HN6IRA!xh&ljByT8_?YwA8)#IxJ@VXltq1!#R5 zN?0_w1JHO!e7DPCBG5&-EYcuq?*y#`jgXPMzBK zot9G<4f-?GkGA!73(JN*dXegY&QZ4rIM)0_wMQLZ8z;!l_-qyY2OhoG3=nv+uF*U| z`c_0g)-^n^u|`{zMFF3AM#1~(d&br*?q)8xF;Kge|A^yT5C5=t)At?bl4nK0J)FlG z{RHdFHyqZ$TwCveVP89MDAUEp>kAHhSCBs0?7iq$?Jj`8m%2W4ysy?r_1oqQ_wCf< zM}IutkDdW9+{R6|Rp=jmfMRaD4P`y)M%(+a-s#^2W94Ti>GI)jjsE8BJ+QmH??XV8 z=`m68+g%BzPq=YS`Kkw%_V;Q|p#vAX(rcR>3;kI4BEikZ3U+Z?P8~_uX1~}&`Jr=k zglMqz6k!+9(DqE=B)XjO`+M7~hnK`S802&P|iR~P?4>d5Mocg( zFW%I?5q=^w?Rlkk+Dj|(l8h(7yk4PooX)%<4~f_W;dgFf3zWy)M4YRWOkRQXJJ%D2 zZBoA9?@EX7pol>bv3`GjlF!3N&iY%qLj_(FH?YoqZrR7J9%h~L{#qw0V|(l8%&)0g z3wCuw`M-AIT7;z**8t-C*3|x!^e^J9PyQUwKLBGx&BRFcN zAp41Vk8yGR&=i00Gu2OVhg-H~z2rwS^hZw=Zs(IH={b2G&?3L5EY`n@`9*u%TY%HS zH#onrh#uLC`u^}2M?B}88a?`&ZOG4)(X#41%%|I^=5B+^`SE%j2mc@X)@A7i04i*SK_XFY3=>xP6xAGxmO#(uxoYy`iWKzx4RsS*SMa7Gwu?c)m3m_ zFG1ol&RZ=XWjfi#j@pUo;vV5wao_4pvrW=NjE}cf`IaS71~P2=vII`XTBVOi^o24K z!0@$2Uy4Z6mm;9ADft)#F44E3wTV5^esnL&wiTV{l<9n|B6V5 zE`#PodJR55b!>g*dqH$9d|%l4qS}TrVv*$A8BIpNU%1)dxl&E3>6QFn+JC;_f3sEm-G^w{ zp_Y4z$4&b2&#b9;xSy=l#?D&P_U)++pL-kY{KAu1kK?}HT>p=K|ApcFUs}1l;3LNW z0B?q$CHS4jE_-@irn7Im5Ej>cL&&m0-;zHq?3;mi@yzkf%GXZtb(U;>VMBZC9&9gs z7?;o7i|O)6q_Q8`V?gsTc%-6YHxHqwReqhVUc!M(HgC^Z#K>Q zvrfo$LjDr+ktE+p_Qcpj`*ZNP zkNSCM^u>C|#u^{18|U6E*(hV)tKvcEY-{Tma^K$^x2||bZN<6wY0=wa#S{F!;EMu( z!tTrMycW6tai4&sfBr4R_rY;C1kIseZlhrsch~cYb;Gh7YJBZ^?bFM#Txo?~-WPnQ z`zwt2j<%oW>mJDGNq+yx1703u=KR8UT5b?joQtx~J&{vOn z&$`Y-@_)h&%)t(8s zW$0YhhAwqm@ux`!5NFbL{2ah@FwXJRu?GGRJR0pG9d^}ce9LcG#J;AUECswA^^yT! zx}5#d{VLXWlPy_4+0Cq`Z;`Gx#%9g6RX*%!D3gJVmU@uj4XLYvG|#dqA9gdx?1Fm8 zk63&II_o{On=zi!_6$6y{S4}b-tr{F4LqM_xB;Fj?roQv#`@A<#+Wy>JrK_sn-b}g z=xEkt5b_}_+2akB51#{}&wRM?JCF_YzTRTz{iSleLqmJCuR;A}Uo%_JsY`|YUwbG` zJ!Y&i`UM7D%H|hmoY0-3-3-#Sm%%wU>}4pk0e^XUL$;HLUCdSERG;_#m9<-6hJ|`= zZ=HX9E9)n_>yTklmj(OFrZ%tO?ZX}>YzgYgxS$tsw(u`}UL{!_Ku4T@p>QB;*!rE~e5Z4j$#CgiP|Ecq2^bLISoaNa@S{s4$y9`A>X!(d|`Mh-P z@q~e+G53nmgKuZw?Om~6fL~26MB4HyXGrDYS)7qv?~JtK_P(rN>-S*koo=%bb`pA* z?WNe;#u}Xw&6duR=ytY%pGG7V4OC-jqMd18~=m+4oe80d9I+#uZlMwL%J3} zoXaTF1U+**LdCAfICr`i&uyGPVqM9(O!jiK(qStUbiiZBXZr~Mk{#Pa_KikU+Y_c( z>_2GzM_duzG2j~*YaMXrp)9YM>NW@1J1EbCP7Y}Z^2n8<`whO@GL-l`;+GpX70D85@Q$dao(ZuIBeWI_Suu=xi0FQ3+nE> znfoCiUXjLW-x0kt+G%@BGrhlBE_&L^$Y1I|mwCzfJS&5}j5NW%31h}HDQs5V&x-t_ z`@5NEC!iS~D$WD9udatl<>582M{eGh~UwBjA}7wu zfbAqbyU^3}^FxY23(_SMaE&F&r|Cjd^o#a|i z@vrLh!{yUn_j;g<)a|xDgD!TqGcb6i%d9Qn6!nx4ulN`7ntTua{~+(x!@UjI__(cJ z*w`gKe_szp&yU$2=Y;nthKtbAay!K27qiMIVEDldzgxvRr~5li2KE;ITRY&X|M@HP zOBW9(Ofgkh278R3!-~DEyym*D4UqoZ7+@{C&T^c0i*=fM9qbneNxl-Ycz(|no%}iI zNBFo1e~6)Q;s;&1C1}h8j4t=5kLC#{g97wXTO2--}FElx*&zdTC}@aB|dYC zt&3QIu6w8ZBjE38hOc$*p8U>3_esE2_ko*Yy)llF(LvC6*Ilov*$+O)`XUc!Kli~A zz8e%r3ws&wZ=f^ByJDnitAaDz*Y}_v(!bkyW9;1TW6~$>YkVixkjv^6GXgjm=c7~Y z9D#b&xr6^;+Mr;rU$*lD^65_s<>wjigLb}uiZGpzcn<^}efkvu57zW{JjZxYClX^% zTN%uE$4^wR)183GKjKe7jNg$1ls?XQD&!A&2@vH2M?-Iw=N>$N#r7FIfBhPje^auF z@Mltfdwu3FqSxB!2<1~(5Nj{=lOvu_f34>fpOHR;K?`nciF$w!Xpah+PDYy%%x~CC z^PB_v+QfJc$XuEX6I{8SAY)hq*Ju-ha)+*teDI!!&K6|6X*>`8*@^ZX?aZ_KC>Qqs z>3q{&`QJZ87&4-ySG$SP0<6jH))aL6sbY_-kjA~X+c777+pzf<-A(0RzYq}nc9kA( z@urPC@@MrD{7~axd>T9(a3td8(1sdi*Pn&5#!Eq_^rrQ9(K5_ywaH?hwSykV6RIEa zu)jqYdEMUbQubv9H!K51n%A zkYh~_68|h+ajT2Cn|GeXy0z2C5GI{xu3O-31N(mTlez@pkH*?Qi~NaavwYIaZv80J zi|TL-&!x+4{4B<9C8Nt2+rD24UVb3+?U~{rVLrZjoq6KXtgjnE$81HG7tQRF^h`<{ z+L{C{bKgkvr-bxr3s_z&oK6D?hj9nal|k@ofQ z5eXceYdB|p0IuD!Az{{A^r~<$gX>5Bl=KTcc zdpSm+<3CD{rEkYKee(j_i1RP&x~^gV)Q4=N@(lauB%3?5yXG&fSH9eNgKQ?#+0p&H zj_pf^U-k~e%NP&wI>GO&ZQI|0n=bRKybn0l=ng!qe20}Q-KMcBPwB&Ytb5rpEEh2V zcqc(wXA|`GXgq_j#-L3LTd&-uLeJ74F1*PC=4_j`cPOTDiaJTez_zBTT59WpvQu3D{nY{xA>pW9!Y4#&{pLz49MyPneynb8x=xMtm+>jCMz8Jjh3< zc3~4%Wfz`oir&(=W&KC1U6

    MlGS<{z2;dU3$f&Xu$ADs_}w@UH^)P2<$&P zho|8GPIrd?lNu!4Ke$kS<71S_Cmj>Tk(L6E9P@8y1VD%9vle3|o5%z&+YHZDD>47Z zNvIhm4x*b|-x>89-xSeV+hiwmu)o+=TViS*4c6b`o^e){L~Ly-oxy(X{Hlw+0m|Qt z7lW7D0&~!R+WQIkbWnvRg{|^=n`Q06*ncCNK6}6zCQHAyrK$Yc-0vOYZbD;FZSpM( zB^zV^t&5KC!)FTqkE1}~|B9kJ88M*@s?braZUXaXSbl;4xTkL?ApT(V%iw-&tm=i! z+jt*J6LFTeNPkqYn@bSsLjHUzMu>dXAC^0BVJzD?rAhf;0Qg5Ks#N)q8-5O6-Bhn; zIzmCyxi*I2fnfk?(Eo@bn5yvq1qX0_jr%Q9(jj8rk@&-?A^OV{Gq7^%%f|CgU;sZx z(`EEO{o=k#WEsu|^z|TLg)wjJq|Ob5a3pMtdd8}QCMRM4iYN`Mop-k>z9L_12!kc6 z#RrV`fq?)^EAH(Y>;X{e?_mnN`2+Dq*zmA5MmVUrs&ocP2zUARe)(zj2H$V)E^slT ztuEa6x_Fqp=0qFFvk)b1IKFQL#%mUt?c{>g%GrH!i$( zZ(&YJo#kKDGbS*-!poPE%oeyH;{DS#hTLgSGj{y8+ zG&FvuY)%MbLH9fH2m`IT=v+&`-AhAtbD z6JzB5)#~oUW_?@5bI~%XMoONF!rfYGB>@;?mf!E|`}hC6U46HYGbfHk_@kV!Fi+O^ zIAs;pVSxHO(I!oWd?5S_f&L^LUR=x6j5XxY+u!l|1noq=LLUc$j{i;sypW!1#n&PI zz3IS>Di5(fl+hGx^sm!cf9j*_-N1jnR#S9Tnf}G!_0qR4Pdw%A(dE~(6J{;)*aWvB zGc%04t=2{kUbtMR;+id^*8HU^jM3-%>bqeLD^5wXV(r384Fyv?sFf^j^7aZXp?-+RD4cZ=p$u*p-9v##*Y!XzJIBdoUwV8V0&Gg+QSBG`% z*_AeHirGx<+jB(u8oa4|uh0qPiIO&_-`slW$ zhRQ|inx(v~#c*z?fdI(Xv(9xWz(j^ME};KVf<j<&Vf<*u3_dcl zoNH7#s7qVQxXg%tQp+kgpowoOgp5bv^_nnOL+$$=C+F+azXPy74u(bt%d~uPq%Qa=#$uOlu^7)N#yu#_gpIutV*T4Rgte+AS8=ow_gFqA&frZgeYe|+A{=hg8g zcN_PvkM!+|P{sF*$xgoT{EduF5_CY?J7ts%<7FXMvNLJYS8svBmx9NK!RQCd9x2dIH|mHVO1wa-T^(NsO{jv^>0<4a5_=++M}_6Pz`;%S_Au6oxQ#6sv_X5{XvL2>w(oRlaBhJw>vO47lOt?xzEXE zk%I&CfKm^zzCw%%pTwg0jiCBi1IOr-^V}+;O1KthfId-d`8^EshP}^klGGsZQ@YQ5 zEyTh2dXnYY@)kaxir^dI??OmA4Q-E#QuorC zqzKgtf{#aTUrP$PM5&a&TL!+Ce-V*HIzM3XOO}-+rAD}lxv!++v~x~}(FF9K2*K;P zGl$_CIL(HK#Gh0S%wk)e;9b!_f84+>RR<3kFHX+9`eY>co?~mQo#LVw?ez3e>)V&n zqbh$2FE5?TWxh~(sPSOCGg&0k&klrQGz0Mu1tF?m)c|LLM}T{2 zistBLPK5mIOeB!D!`;&`qBnD^NhWj)AR{2_s>l3?3PL@vRKuc$_8W;ncwR zUc4wPYf#jve2g+ABA;Bt^rmS0j+*!A&&9#Xp?qKi|9j;WpDdr~8!Rr(PpJ_`2zyee z(GMZ(&d__jfr)b~NHeV7qgxr92Gdsn`zF2>n{pvHtsA1 zMTUY(xsN23o6ks5fpWSs;61OvB+wqIpm8!cMG^KsU!5qf9u8RH0MJ)8)ZX!)L+x4D zn<=wF+e?cLFi48t6}CWud~4o@$z^H#~c9J1ezX4-t?~(^ZT36o9iX> zv>m-A8IsgH3|0tDLm-Xc;#slKcs8Baa%jf)=tCTQM_7AzFT2Y>&+_+ENPBfJAj{^* z%eA;|QCfMbq+*&*54Z;n2xhqDbur#zS2E1K=#CC~&-uO1C9-5r4JW2Go9Bs(3l&L!R!r9&o$&8XMzFi={XX0 zlq=A*9Q&;^2&Hk0Vfr=Ld#(V2k5zIkIfnjKPC!!oH^>Zok2L^Tak?>%)8%|B!2p!a z4hrWxD9Q*-=N#y8pJY(`*?A3^TOD8fT`GT zZZ*$Q3KOfs&Fv`9Q8y|qO~T%vMx1N3zT+)ueaBnS`qm#lT|%?pyOlrMoXx#oUjO~w z9?%{TVsdi#?|0adKa_KTg5u$}CJ-yO9{%p==QoagIMtmdaqc( zI{r1_9tJ=Qx7UmT1KT_LkA*_I`~$K1>$??@_7($am};58_PF^~FR)NQ2z^hk6&+`S z%G8mw-hiiv#AQ3 zH>ksbq-qE3o}_7K(7m=BXCe2}>H!g&6t_|7&)5u2s#$j2lFJUjdWSsfjIz)0x?vCr zXCrwe|9g;C)l^KoTD=gaNoe>jlL^&KVb4KZSR2V|-iTKh| zLXo~601F6q$vB5Y6ZRRDILZNOtR2v9)C^`Am3UNe$9;0qQ zp}0N^&2ETmA*48qOdQFC$vncIVn%A_!_O;#-s+!PS#>Yq?1J}(vDY*j>nXv+N|#D( zK4dotXdV4Y8uOif>*5hYAQl^nG3bbifv!6Z=yUXh24nF}HNo9IV%s)ei>LH$_h5R} z!Yxt_As7yya&%D?9$rdC5Nvy~Qa6{^35V0-)k0FIj(jx>*CMcWl7su^_Bb zoa{C?-``g9<0CePG;Bi9(};qt#77QiCngoxjzlNl6+e%QHA|iw7?bs09C6Q5gU;)6 zZ=N^3C}@)yD1vjO!`N1&dO=3@C0<@ukU^Ut95a0-$E4fg_zj|#DFtK0EnXc4fN}ut z#}nCDtTiDxcxjJjLv4N+C>4*|9*OasW=haoPG8cd)U~{^)EphLBK6r^9QO4qe6y9+ zLQr)PPpg=^aVD*4`}w?(xECRW_riA#*IhkB}RY3lvq^EwI|^UQ=y;93GR) zL*#LLFT-XOx5BbT2}K?tz(LP&3+-V3N!R7@5u6NBn^k$m8dPy4BOZbnTnL!C$7Djk z_kwQF9q{p}c@6OKD$PwpKZ+N9B*;@Pd*p&>3Rneo;ZiDE4u>1eLWV!)?GGNpV*>#m z9abMBXzuWKOl^e$4`m>z(Smew!C-%S1C9CrMbdVIcPBoCmJUEW4o?oE<(VV??S0vx z!s~u}-}O7oZjtY*hVC5aqsA5`*F4I&{!e1l*kIeEo%*td7;N9YY z(=d6A83FJmfOi4}XKqH(E$o4{F?ZvjG6w?s*C5`t9mzPBN%TAJ>lOMPOWcBe$Me@Q zr;BN(y786`-Zj#x4Og&RG2}d$y&mlr#6B8p2eQ`6T0=QyRT(vl*cft>1=q&>EYz4* z!wGo=doGRl$xBf^&Jr)=PTtmn&SVi)+#G1Z)h+bSeOn2*^c&PXYoza|ar2%e+&ox0 zYt+1YBJAnmgl?{al;`GTv9|9CIv!3Tie4kv8Wux5YX9416TL?(HUTNzY(D{v$7qJe zI*O&bz@25{GbT1wE}$GzGB%D{3z-`n17s^qo-8{16badf=9J2UU{KeBR89zF|E=%e zZw=Qf`#(HR;nHP0h+#r`e7Dbylx?_`8|x*M+EeaU`|Y7{dBB{zJzGkKuVo*4)x{p{ zxxW=eTN5k5snxs+F2y!ncO^mxTijK+}CL zBB^EqI&H=7HC2f9N910q9QJ!y(Nq+GI1O;}swG&)*gR%las&GZbg*N`FIC+=c?Um@w0qdJqra9Tz_(k!&zBRErG1+3BapwF{1 z<*gUpcpkJJk>u|)q{Y|+V9pu&O_Wq)p^0gx+{2*nNN$V2VZo*jIPd}+D2+)D^@j_f#nhRod ztK2yxMF975Il8lo=spUGw-+6k!1i*#SEj0oIz1F{PaQ^O(WFKnQuLl8ZEozmHhDUC z(^l$SpW0w1dhVA1?1eBnu%23!dYyBTcn9qnVbf z>lKfr(NgkS)~JM}=aq6-nirV-X*!4?t0Lt+bYv=3#0eP2X7O!E2%9rMid@LSDZ&58N?{C@+Ol1Q6#r=h> zIN$Bd-@7V?y4IY01P{$(_7Rh@`ECNa1q1?&llv$u2Xn5hsLBjB-wKwCv!8Dmp~IzIa+<{7 zD~xcX$gfkS@r2#Eis_xg&9^K1Fs>75>cDxd{U;DGiOtS~D|2i{6}^UfG7DpHGG^PL zhoQ$^%Pjz%WJQnpm_>RQHrhrejZosEnpTC&f~W~h+h+MZ^}N@~xUltW&e7wkW)(xK zU8IV3QD1IVm#!`H0IZ1ntaPbL$Dpo8Somk~-C(eQLf+=S9gP=|Hs+^j-&y2Uxl8LJ$ER+{%;8AXTtPw1} z3xgQ*!Dn@FMHzU9Hc)y-GktbC#V&*ANb7Xsl@4m&H(fQ!zV5jRA6C`+1CRi#awZ>+ zv7S~I-i*aZEes(9pK#16U5CEif)WKI^^>Mf* zcM(0T2ux`2Ef-fw)-Ce=_9TBOY9AcjDg0raIa~!uxZ;^?EM$??*7WGDMIIyNRm(TS zHykb$ff>GWkP=e2g2Slb%I|F>gRv?8mzuY{tmSd0r!|Bh39)w3Tqmb0e@f)#ckg+h z@d(k-D;Bqd`k|coc&vUSEJV3!L1OO(QACjl4|@#x(AvxqlaP|3jPMG|!Aa_7iEvob zP+<9fAz>po=nupI27p~IqkJj$eMlvDJp$|p>ln0gx$M#Ad19M%M4^!y47jFT;L1#* zUGgsh0E|v`#J;b=0UWU7+B9n00UTgZe;ZW5%T45)P9Or(DJ4-dyo}P#O6X=7_5@Hm zLDM62rQrH0SYS$(&AtX_N9DBHii1TNSe9y;q=+$(lFB-QD4FSq#~nGL)ngAPKklc`|0myej|pK!iW;57T_b z>A_>$?ttZxn(<0E)3}0OVmT7V3BM%8YTd~NE_Ie(x~<5%6x>CF0hH?-P=lsx^dl@* zOT;rMeLiCe0f)*w8lbcdVFQuSCw`mU`wknJR+KMB1N2!~1!GNY*I0l(IIFZxTK%}y z&0qr>uAjNlqWP0Yj@`$?r#(U%y=CzPvrIh3pvX!!U&;GpQYqMbJlbV0^vkvbQa=95g%q?82ie)~C~G3#-6eY zKD(g@LU2JYq+wsG;ZM;R@+vL7&}EB6&>1y)eHXW0p=o?`7z~lMvI`q54~VfBltK43 z#^E4`_O+MYMz1(jAnu;aID`wL*tk zU*j_@a<~=j8o4-fLiaNiZ4q3sODLw*N)%AJtUF;Ic!iBcY zjug&5)hSLvBdn#!ID|2?Q;uWN#VB8mPnh`l57kwY>73pL=O$&wLUhZrz;Iaq-2e2# zny=Z^jfeO3O%+5nz#-HCDv$CFXsi_aYcIXv6aaj8y}Z4R=k^2{&+hk<^gwvhH_lq_oVw z273QZqr_@!T}_^>b%B0z-$@nEa)(W|I~L8H%7 z3}mw802>JH8>jO`fqEcBLB`3>^gU&LkWYm(3>wy)@Ai$yE;@w^gbT)_HU&j6jpp{&oHAn+h+ z7L*gfgIq;HEg?nBvpHM+UeU-8I?!&kBx^6KVFLR{xWRW9u*GLWYp-;cKMiAO$AkH8jSuFtig%W9d@vaqplK1ScBb= z2lH4A5?WYx=YVhDYS;wsJbrt-T!#q&cdD2Cd>saVczIi42uow|JDU_EG(!H4IeiWL zs}6<0Din9o>k;OlICVZp+|p_mdXUSv0dv8V!^st+u0|eA`kql3?F5N9Tsr{58vpC; zpVuW$5V^H_bFDUK*oqsZAw=Th0`HTv&sSG^8EX|4VEI6};AXS@!v(X{AmuIhEcY;k z92))G;32q$dUi+f^xDEGD{JDbFNY~Cqv9K(723c`>ImTXJgVQ;q0%5ckpa`9=xDZ- zNrQB6qd}(mrC63}sEopXA~v}yW?M9JU7iL5#N=w)Kx6+(%{c=g;%W}Zu)o?AO&JtZ zNQT@)z}j)R`UMwk2(K2&E?oD1xcOb&9fDt2JbBpM48M>*7~NB=5dXnTZ$aH$2jTvh zp(4~isTJ2S5$OwQr`T-F6|dV|o!XXYNAQJFl>Ry>avMmY1TRN14NRdp0W(aYdcx!T z4xo^|-vSh3Y6QguJYhOXx53(jiFb;nt-k?1*&B&O(_yvQmP*9IJVK~$w9qw^0L3H* z#!YYW$EZvgg*YAO7hZo3PWZYqhW4XB507xcRh8(cksTFPy}(G%pajDuMEI{}LWH%O zMb*HBrI3L?8Q-Rr9H%;*_i4n_Tx@T+7J`ry5+8R^gTs{qM?P{HZP@AqFW zzT1C!_}%`myQtfzCm(e(0nHBiC_wCEpf9gtOS)bUIEZ@~Kro3kDBiQ8CcMX@T3wtw2#wPZk zMfxfMUYvMfZ->1lfP*qT;%k~(FsjGjG8RwFB~1DV8i~3SiwWNkXmwX1=-|bk|J|jl zGA{4+OJS=)hAYJV_kz?(RTFrEOfNn#do2UDHU=>A zVd{LjlJQgphY7n~U;|l=5o{o}&C&awaiq}=1U`651+2^OLQEht4Y1JAQ_Lko`63eP zpNwBX8>%`rVkyu(+zW6jXS|G(;<29{>?ws#v-~HimpurjJm9Q&#-*j6wj_Tn6{wP# zlFq_jt8(|)8jkpx6(BL8PZFDPJ2Uv3A{fm_Im z=F(EK3y0Yz8fGQUIFS(3vSO18E|BMXFm8t&Cea5a0JBx$+IhR#jzmaI3e3QX1Jst| z6$RXaQz!@xDQiUkl&UG^97>_I3nkQ$YqO%%L!?MB7^Q+?%H6U}F}YaYmAs0V_b|b$ zG?8MWj`Be#9X%0YhGF|f>4K!V!%rG!2Zjnq)8~D)H3X}E|3vE?KI78ID!wUzb#TCs zzQtF%uCxe+6>gIdPuBkNGp>s)Z0t3+N>4I47VIiA$RPvf@ZU;)B+xA+hilIQE2`$6 zEcsBT3rQoNW@->jGFd2ejF@oD^)C~odgFaB{+em*LOSLGZd|BJ(ts{jqw!2Fo&ofB zfYvw|G#ta=VI{_%f!>EIjDrVK^M^x5QDhNZt)b%qR;XCg6a-d0{c$h_6jqOk{lDR8 zgZu~&FIU2OoI=^9Pcs(db@ySjzU2@td?v6A8JH7Vfr5HrAXE35#4(hGDdQL-c0i&# z&|c$7@Ql+>!&lV`Rj;@ufK@y!qp@{NV<*TP979#gS-%n`X%>tDk3+#d^$5kmh00_D z1*}|$JYaDwL;UAA<>XH7PZgJ|6OX#q-1larK*HIeJe1tW;|&Bjc*4O`HkLuW1^7gW z#en{av?B=fhEk`kZDVo#j9W6xPElwng>)PJ(KD*DpvS+mr=$&O?O}5R=?`UmgD&=z z2Nb*zRAmmnF8)hohQ2?EWGG15B-QR-M(!9iXJAxL9zFx@X z>>ZT-8H2^kIp)%%UBskjSf=Ot;~ZAu^DcBnYgD`?0DfLsoY{TnJVkU4iTj;1mim zJ?x}98K4wOp`41Hzr7Y61|?V@ug{j7Gri?+)Dtqb!b>f#_mkDFoTtG+R^`sn1qlwN z3%B{H*$z10Uf!IdK2r+bLT;8wUg9ssE0o&;)LW_pU{!poZN<@cuYf+dS)YpShY2%m zbs`et-IT!ypHz^99JAF6^4I~RP=E$aFV!v8qSMI0RMOE>#jcl)gyXCPz)PtBKSopu zuV?87*nynH^vsU)wt9U@GznAqnA19^cjWj15@HP<>Iz3k+~i + +Search + + + +

    +Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for  +1 document matching your query."; + } + else // $num>1 + { + return "Found $num documents matching your query. Showing best matches first."; + } +} + +function report_matches() +{ + return "Matches: "; +} + +function readInt($file) +{ + $b1 = ord(fgetc($file)); $b2 = ord(fgetc($file)); + $b3 = ord(fgetc($file)); $b4 = ord(fgetc($file)); + return ($b1<<24)|($b2<<16)|($b3<<8)|$b4; +} + +function readString($file) +{ + $result=""; + while (ord($c=fgetc($file))) $result.=$c; + return $result; +} + +function readHeader($file) +{ + $header =fgetc($file); $header.=fgetc($file); + $header.=fgetc($file); $header.=fgetc($file); + return $header; +} + +function computeIndex($word) +{ + if (strlen($word)<2) return -1; + // high char of the index + $hi = ord($word{0}); + if ($hi==0) return -1; + // low char of the index + $lo = ord($word{1}); + if ($lo==0) return -1; + // return index + return $hi*256+$lo; +} + +function search($file,$word,&$statsList) +{ + $index = computeIndex($word); + if ($index!=-1) // found a valid index + { + fseek($file,$index*4+4); // 4 bytes per entry, skip header + $index = readInt($file); + if ($index) // found words matching first two characters + { + $start=sizeof($statsList); + $count=$start; + fseek($file,$index); + $w = readString($file); + while ($w) + { + $statIdx = readInt($file); + if ($word==substr($w,0,strlen($word))) + { // found word that matches (as substring) + $statsList[$count++]=array( + "word"=>$word, + "match"=>$w, + "index"=>$statIdx, + "full"=>strlen($w)==strlen($word), + "docs"=>array() + ); + } + $w = readString($file); + } + $totalHi=0; + $totalFreqHi=0; + $totalFreqLo=0; + for ($count=$start;$count $idx, + "freq" => $freq>>1, + "rank" => 0.0, + "hi" => $freq&1 + ); + if ($freq&1) // word occurs in high priority doc + { + $totalHi++; + $totalFreqHi+=$freq*$multiplier; + } + else // word occurs in low priority doc + { + $totalFreqLo+=$freq*$multiplier; + } + } + // read name and url info for the doc + for ($i=0;$i<$numDocs;$i++) + { + fseek($file,$docInfo[$i]["idx"]); + $docInfo[$i]["name"]=readString($file); + $docInfo[$i]["url"]=readString($file); + } + $statInfo["docs"]=$docInfo; + } + $totalFreq=($totalHi+1)*$totalFreqLo + $totalFreqHi; + for ($count=$start;$count$key, + "name"=>$di["name"], + "rank"=>$rank + ); + } + $docs[$key]["words"][] = array( + "word"=>$wordInfo["word"], + "match"=>$wordInfo["match"], + "freq"=>$di["freq"] + ); + } + } + return $docs; +} + +function filter_results($docs,&$requiredWords,&$forbiddenWords) +{ + $filteredDocs=array(); + while (list ($key, $val) = each ($docs)) + { + $words = &$docs[$key]["words"]; + $copy=1; // copy entry by default + if (sizeof($requiredWords)>0) + { + foreach ($requiredWords as $reqWord) + { + $found=0; + foreach ($words as $wordInfo) + { + $found = $wordInfo["word"]==$reqWord; + if ($found) break; + } + if (!$found) + { + $copy=0; // document contains none of the required words + break; + } + } + } + if (sizeof($forbiddenWords)>0) + { + foreach ($words as $wordInfo) + { + if (in_array($wordInfo["word"],$forbiddenWords)) + { + $copy=0; // document contains a forbidden word + break; + } + } + } + if ($copy) $filteredDocs[$key]=$docs[$key]; + } + return $filteredDocs; +} + +function compare_rank($a,$b) +{ + if ($a["rank"] == $b["rank"]) + { + return 0; + } + return ($a["rank"]>$b["rank"]) ? -1 : 1; +} + +function sort_results($docs,&$sorted) +{ + $sorted = $docs; + usort($sorted,"compare_rank"); + return $sorted; +} + +function report_results(&$docs) +{ + echo "\n"; + echo " \n"; + echo " \n"; + echo " \n"; + $numDocs = sizeof($docs); + if ($numDocs==0) + { + echo " \n"; + echo " \n"; + echo " \n"; + } + else + { + echo " \n"; + echo " \n"; + echo " \n"; + $num=1; + foreach ($docs as $doc) + { + echo " \n"; + echo " "; + echo "\n"; + echo " \n"; + echo " \n"; + echo " \n"; + $num++; + } + } + echo "

    ".search_results()."

    ".matches_text(0)."
    ".matches_text($numDocs); + echo "\n"; + echo "
    $num.".$doc["name"]."
    ".report_matches()." "; + foreach ($doc["words"] as $wordInfo) + { + $word = $wordInfo["word"]; + $matchRight = substr($wordInfo["match"],strlen($word)); + echo "$word$matchRight(".$wordInfo["freq"].") "; + } + echo "
    \n"; +} + +function main() +{ + if(strcmp('4.1.0', phpversion()) > 0) + { + die("Error: PHP version 4.1.0 or above required!"); + } + if (!($file=fopen("search.idx","rb"))) + { + die("Error: Search index file could NOT be opened!"); + } + if (readHeader($file)!="DOXS") + { + die("Error: Header of index file is invalid!"); + } + $query=""; + if (array_key_exists("query", $_GET)) + { + $query=$_GET["query"]; + } + echo "\n"; + echo "\n"; + echo "\n"; + echo "
    \n"; + $results = array(); + $requiredWords = array(); + $forbiddenWords = array(); + $foundWords = array(); + $word=strtok($query," "); + while ($word) // for each word in the search query + { + if (($word{0}=='+')) { $word=substr($word,1); $requiredWords[]=$word; } + if (($word{0}=='-')) { $word=substr($word,1); $forbiddenWords[]=$word; } + if (!in_array($word,$foundWords)) + { + $foundWords[]=$word; + search($file,$word,$results); + } + $word=strtok(" "); + } + $docs = array(); + combine_results($results,$docs); + // filter out documents with forbidden word or that do not contain + // required words + $filteredDocs = filter_results($docs,$requiredWords,$forbiddenWords); + // sort the results based on rank + $sorted = array(); + sort_results($filteredDocs,$sorted); + // report results to the user + report_results($sorted); + fclose($file); +} + +main(); + + +?> +
    Generated on Thu Oct 19 05:07:02 2006 for EO by  + +doxygen 1.3.9.1
    + + diff --git a/trunk/paradiseo-eo/doc/html/select_one_8cpp-source.html b/trunk/paradiseo-eo/doc/html/select_one_8cpp-source.html new file mode 100644 index 000000000..211dc1756 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/select_one_8cpp-source.html @@ -0,0 +1,122 @@ + + +EO: selectOne.cpp Source File + + + +
    +Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
    +
    +src / pyeo
    +

    selectOne.cpp

    00001 /*
+00002     PyEO
+00003     
+00004     Copyright (C) 2003 Maarten Keijzer
+00005 
+00006     This program is free software; you can redistribute it and/or modify
+00007     it under the terms of the GNU General Public License as published by
+00008     the Free Software Foundation; either version 2 of the License, or
+00009     (at your option) any later version.
+00010 
+00011     This program is distributed in the hope that it will be useful,
+00012     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00013     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00014     GNU General Public License for more details.
+00015 
+00016     You should have received a copy of the GNU General Public License
+00017     along with this program; if not, write to the Free Software
+00018     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00019 */
+00020 
+00021 #include <eoSelectOne.h>
+00022 #include <eoDetTournamentSelect.h>
+00023 #include <eoRandomSelect.h>
+00024 #include <eoStochTournamentSelect.h>
+00025 #include <eoTruncatedSelectOne.h>
+00026 #include <eoSequentialSelect.h>
+00027 
+00028 #include "PyEO.h"
+00029 #include "pickle.h"
+00030 #include "def_abstract_functor.h"
+00031 
+00032 using namespace boost::python;
+00033 
+00034 class eoSelectOneWrapper : public eoSelectOne<PyEO>
+00035 {
+00036     public:
+00037     PyObject* self;
+00038     eoSelectOneWrapper(PyObject* p) : self(p) {}
+00039     const PyEO& operator()(const eoPop<PyEO>& pop) 
+00040     {
+00041         return boost::python::call_method< const PyEO& >(self, "__call__", boost::ref(pop));
+00042     }
+00043 };
+00044 
+00045 template <class Select>
+00046 void add_select(std::string name)
+00047 {
+00048     class_<Select, bases<eoSelectOne<PyEO> > >(name.c_str(), init<>() )
+00049         .def("__call__", &Select::operator(), return_internal_reference<>() )
+00050         ;
+00051 }
+00052 
+00053 template <class Select, class Init>
+00054 void add_select(std::string name, Init init)
+00055 {
+00056     class_<Select, bases<eoSelectOne<PyEO> > >(name.c_str(), init)
+00057         .def("__call__", &Select::operator(), return_internal_reference<>() )
+00058         ;
+00059 }
+00060     
+00061 template <class Select, class Init1, class Init2>
+00062 void add_select(std::string name, Init1 init1, Init2 init2)
+00063 {
+00064     class_<Select, bases<eoSelectOne<PyEO> > >(name.c_str(), init1)
+00065         .def( init2 )
+00066         .def("__call__", &Select::operator(), return_internal_reference<>() )
+00067         .def("setup", &Select::setup);
+00068 }
+00069 
+00070 void selectOne()
+00071 {
+00072     /* Concrete classes */
+00073    
+00074     pickle(class_<eoHowMany>("eoHowMany", init<>())
+00075         .def( init<double>() )
+00076         .def( init<double, bool>() )
+00077         .def( init<int>() )
+00078         .def("__call__", &eoHowMany::operator())
+00079         .def("__neg__", &eoHowMany::operator-)
+00080           ); 
+00081     
+00082     class_<eoSelectOne<PyEO>, eoSelectOneWrapper, boost::noncopyable>("eoSelectOne", init<>())
+00083         .def("__call__", &eoSelectOneWrapper::operator(), return_internal_reference<>() )
+00084         .def("setup", &eoSelectOne<PyEO>::setup);
+00085     
+00086     /* SelectOne derived classes */
+00087     
+00088     add_select<eoDetTournamentSelect<PyEO> >("eoDetTournamentSelect", init<>(), init<unsigned>() );
+00089     add_select<eoStochTournamentSelect<PyEO> >("eoStochTournamentSelect", init<>(), init<double>() );
+00090     add_select<eoTruncatedSelectOne<PyEO>  >("eoTruncatedSelectOne", 
+00091             init<eoSelectOne<PyEO>&, double>()[WC1], init<eoSelectOne<PyEO>&, eoHowMany >()[WC1] );
+00092     
+00093     // eoProportionalSelect is not feasible to implement at this point as fitness is not recognizable as a float
+00094     // use eoDetTournament instead: with a t-size of 2 it is equivalent to eoProportional with linear scaling
+00095     //add_select<eoProportionalSelect<PyEO> >("eoProportionalSelect", init<eoPop<PyEO>&>() );
+00096     
+00097     add_select<eoRandomSelect<PyEO> >("eoRandomSelect");
+00098     add_select<eoBestSelect<PyEO> >("eoBestSelect");
+00099     add_select<eoNoSelect<PyEO> >("eoNoSelect");
+00100     
+00101     add_select<eoSequentialSelect<PyEO> >("eoSequentialSelect", init<>(), init<bool>());
+00102     add_select<eoEliteSequentialSelect<PyEO> >("eoEliteSequentialSelect");
+00103     /*
+00104      * eoSelectFromWorth.h:class eoSelectFromWorth : public eoSelectOne<EOT>
+00105     
+00106     */
+00107 }
+
    Generated on Thu Oct 19 05:06:42 2006 for EO by  + +doxygen 1.3.9.1
    + + diff --git a/trunk/paradiseo-eo/doc/html/selectors_8cpp-source.html b/trunk/paradiseo-eo/doc/html/selectors_8cpp-source.html new file mode 100644 index 000000000..fc0c9f760 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/selectors_8cpp-source.html @@ -0,0 +1,76 @@ + + +EO: selectors.cpp Source File + + + +
    +Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
    +
    +src / pyeo
    +

    selectors.cpp

    00001 /*
+00002     PyEO
+00003     
+00004     Copyright (C) 2003 Maarten Keijzer
+00005 
+00006     This program is free software; you can redistribute it and/or modify
+00007     it under the terms of the GNU General Public License as published by
+00008     the Free Software Foundation; either version 2 of the License, or
+00009     (at your option) any later version.
+00010 
+00011     This program is distributed in the hope that it will be useful,
+00012     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00013     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00014     GNU General Public License for more details.
+00015 
+00016     You should have received a copy of the GNU General Public License
+00017     along with this program; if not, write to the Free Software
+00018     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00019 */
+00020 
+00021 #include <eoSelect.h>
+00022 #include <eoDetSelect.h>
+00023 #include <eoSelectMany.h>
+00024 #include <eoSelectNumber.h>
+00025 #include <eoSelectPerc.h>
+00026 #include <eoTruncSelect.h>
+00027 #include <eoTruncatedSelectMany.h>
+00028 
+00029 #include "PyEO.h"
+00030 #include "def_abstract_functor.h"
+00031 
+00032 using namespace boost::python;
+00033 
+00034 #define DEF(x) class_<x<PyEO>, bases<eoSelect<PyEO > > >(#x).def("__call__", &eoSelect<PyEO>::operator())
+00035 #define DEF2(x, i1) class_<x<PyEO>, bases<eoSelect<PyEO > > >(#x, init<i1>()[WC1] ).def("__call__", &eoSelect<PyEO>::operator())
+00036 #define DEF3(x, i1, i2) class_<x<PyEO>, bases<eoSelect<PyEO > > >(#x, init<i1, i2 >()[WC1] ).def("__call__", &eoSelect<PyEO>::operator())
+00037 
+00038 void selectors()
+00039 {
+00040     def_abstract_functor<eoSelect<PyEO> >("eoSelect");
+00041 
+00042     DEF(eoDetSelect).def( init<double>() ).def( init<double, bool>() );
+00043     DEF3(eoSelectMany, eoSelectOne<PyEO>&, double)
+00044         .def( init< eoSelectOne<PyEO>&, double, bool>()[WC1] )
+00045         .def( init< eoSelectOne<PyEO>&, eoHowMany>()[WC1] );
+00046 
+00047     DEF2(eoSelectNumber, eoSelectOne<PyEO>&)
+00048         .def( init< eoSelectOne<PyEO>&, unsigned>()[WC1]);
+00049 
+00050     DEF2(eoSelectPerc, eoSelectOne<PyEO>&)
+00051         .def( init<eoSelectOne<PyEO>&, float>()[WC1] );
+00052 
+00053     DEF3(eoTruncSelect, eoSelectOne<PyEO>&, eoHowMany);
+00054 
+00055     class_<eoTruncatedSelectMany<PyEO>, bases<eoSelect<PyEO> > >("eoTruncatedSelectMany",
+00056             init<eoSelectOne<PyEO>&, double, double>()[WC1])
+00057         .def(init<eoSelectOne<PyEO>&, double, double, bool> ()[WC1])
+00058         .def(init<eoSelectOne<PyEO>&, double, double, bool, bool> ()[WC1])
+00059         .def(init<eoSelectOne<PyEO>&, eoHowMany, eoHowMany> ()[WC1]);
+00060         
+00061 }
+
    Generated on Thu Oct 19 05:06:42 2006 for EO by  + +doxygen 1.3.9.1
    + + diff --git a/trunk/paradiseo-eo/doc/html/selectors_8h-source.html b/trunk/paradiseo-eo/doc/html/selectors_8h-source.html new file mode 100644 index 000000000..3a91de3ad --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/selectors_8h-source.html @@ -0,0 +1,349 @@ + + +EO: selectors.h Source File + + + +
    +Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
    +
    +src / utils
    +

    selectors.h

    00001 /* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003   -----------------------------------------------------------------------------
+00004   selectors.h
+00005     A bunch of useful selector functions. They generally have three forms:
+00006 
+00007     template <class It>
+00008     It select(It begin, It end, params, eoRng& gen = rng);
+00009 
+00010     template <class EOT>
+00011     const EOT& select(const eoPop<EOT>& pop, params, eoRng& gen = rng);
+00012 
+00013     template <class EOT>
+00014     EOT& select(eoPop<EOT>& pop, params, eoRng& gen = rng);
+00015 
+00016     where select is one of: roulette_wheel, deterministic_tournament
+00017     and stochastic_tournament (at the moment).
+00018 
+00019  (c) Maarten Keijzer (mak@dhi.dk) and GeNeura Team, 1999, 2000
+00020 
+00021     This library is free software; you can redistribute it and/or
+00022     modify it under the terms of the GNU Lesser General Public
+00023     License as published by the Free Software Foundation; either
+00024     version 2 of the License, or (at your option) any later version.
+00025 
+00026     This library is distributed in the hope that it will be useful,
+00027     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00028     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00029     Lesser General Public License for more details.
+00030 
+00031     You should have received a copy of the GNU Lesser General Public
+00032     License along with this library; if not, write to the Free Software
+00033     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00034 
+00035     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00036  */
+00037 
+00038 #ifndef SELECT__H
+00039 #define SELECT__H
+00040 
+00041 #include <stdexcept>
+00042 
+00043 #include "eoRNG.h"
+00044 #include <eoPop.h>
+00049 template <class EOT>
+00050 bool minimizing_fitness()
+00051 {
+00052     EOT eo1; // Assuming people don't do anything fancy in the default constructor!
+00053     EOT eo2;
+00054 
+00055     /* Dear user, when the two line below do not compile you are most
+00056        likely not working with scalar fitness values. In that case we're sorry
+00057        but you cannot use lottery or roulette_wheel selection...
+00058     */
+00059 
+00060 #ifdef _MSC_VER
+00061     eo1.fitness( EOT::Fitness(0.0) );
+00062     eo2.fitness( EOT::Fitness(1.0) );
+00063 #else
+00064     eo1.fitness( typename EOT::Fitness(0.0) ); // tried to cast it to an EOT::Fitness, but for some reason GNU barfs on this
+00065     eo2.fitness( typename EOT::Fitness(1.0) );
+00066 #endif
+00067 
+00068     return eo2 < eo1; // check whether we have a minimizing fitness
+00069 }
+00070 
+00071 inline double scale_fitness(const std::pair<double, double>& _minmax, double _value)
+00072 {
+00073     if (_minmax.first == _minmax.second)
+00074     {
+00075         return 0.0; // no differences in fitness, population converged!
+00076     }
+00077     // else
+00078 
+00079     return (_value - _minmax.first) / (_minmax.second - _minmax.first);
+00080 }
+00081 
+00082 template <class It>
+00083 double sum_fitness(It begin, It end)
+00084 {
+00085     double sum = 0.0;
+00086 
+00087     for (; begin != end; ++begin)
+00088     {
+00089         double v = static_cast<double>(begin->fitness());
+00090         if (v < 0.0)
+00091             throw std::logic_error("sum_fitness: negative fitness value encountered");
+00092         sum += v;
+00093     }
+00094 
+00095     return sum;
+00096 }
+00097 
+00098 template <class EOT>
+00099 double sum_fitness(const eoPop<EOT>& _pop)
+00100 {
+00101     return sum_fitness(_pop.begin(), _pop.end());
+00102 }
+00103 
+00104 template <class EOT>
+00105 double sum_fitness(const eoPop<EOT>& _pop, std::pair<double, double>& _minmax)
+00106 {
+00107     double rawTotal, scaledTotal;
+00108 
+00109     typename eoPop<EOT>::const_iterator it = _pop.begin();
+00110 
+00111     _minmax.first = it->fitness();
+00112     _minmax.second = it++->fitness();
+00113 
+00114     for(; it != _pop.end(); ++it)
+00115     {
+00116         double v = static_cast<double>(it->fitness());
+00117 
+00118         _minmax.first = std::min(_minmax.first, v);
+00119         _minmax.second = std::max(_minmax.second, v);
+00120 
+00121         rawTotal += v;
+00122     }
+00123 
+00124     if (minimizing_fitness<EOT>())
+00125     {
+00126         std::swap(_minmax.first, _minmax.second);
+00127     }
+00128 
+00129     scaledTotal = 0.0;
+00130 
+00131     // unfortunately a second loop is neccessary to scale the fitness
+00132     for (it = _pop.begin(); it != _pop.end(); ++it)
+00133     {
+00134         double v = scale_fitness(_minmax, static_cast<double>(it->fitness()));
+00135 
+00136         scaledTotal += v;
+00137     }
+00138 
+00139     return scaledTotal;
+00140 }
+00141 
+00142 template <class It>
+00143 It roulette_wheel(It _begin, It _end, double total, eoRng& _gen = rng)
+00144 {
+00145 
+00146     float roulette = _gen.uniform(total);
+00147 
+00148     if (roulette == 0.0)           // covers the case where total==0.0
+00149       return _begin + _gen.random(_end - _begin); // uniform choice
+00150 
+00151     It i = _begin;
+00152 
+00153     while (roulette > 0.0)
+00154     {
+00155             roulette -= static_cast<double>(*(i++));
+00156     }
+00157 
+00158     return --i;
+00159 }
+00160 
+00161 template <class EOT>
+00162 const EOT& roulette_wheel(const eoPop<EOT>& _pop, double total, eoRng& _gen = rng)
+00163 {
+00164     float roulette = _gen.uniform(total);
+00165 
+00166     if (roulette == 0.0)           // covers the case where total==0.0
+00167       return _pop[_gen.random(_pop.size())]; // uniform choice
+00168 
+00169     typename eoPop<EOT>::const_iterator i = _pop.begin();
+00170 
+00171     while (roulette > 0.0)
+00172     {
+00173             roulette -= static_cast<double>((i++)->fitness());
+00174     }
+00175 
+00176     return *--i;
+00177 }
+00178 
+00179 template <class EOT>
+00180 EOT& roulette_wheel(eoPop<EOT>& _pop, double total, eoRng& _gen = rng)
+00181 {
+00182     float roulette = _gen.uniform(total);
+00183 
+00184     if (roulette == 0.0)           // covers the case where total==0.0
+00185       return _pop[_gen.random(_pop.size())]; // uniform choice
+00186 
+00187     typename eoPop<EOT>::iterator i = _pop.begin();
+00188 
+00189     while (roulette > 0.0)
+00190     {
+00191             roulette -= static_cast<double>((i++)->fitness());
+00192     }
+00193 
+00194     return *--i;
+00195 }
+00196 
+00197 template <class It>
+00198 It deterministic_tournament(It _begin, It _end, unsigned _t_size, eoRng& _gen = rng)
+00199 {
+00200     It best = _begin + _gen.random(_end - _begin);
+00201 
+00202     for (unsigned i = 0; i < _t_size - 1; ++i)
+00203     {
+00204         It competitor = _begin + _gen.random(_end - _begin);
+00205 
+00206         if (*best < *competitor)
+00207         {
+00208             best = competitor;
+00209         }
+00210     }
+00211 
+00212     return best;
+00213 }
+00214 
+00215 template <class EOT>
+00216 const EOT& deterministic_tournament(const eoPop<EOT>& _pop, unsigned _t_size, eoRng& _gen = rng)
+00217 {
+00218     return *deterministic_tournament(_pop.begin(), _pop.end(), _t_size, _gen);
+00219 }
+00220 
+00221 template <class EOT>
+00222 EOT& deterministic_tournament(eoPop<EOT>& _pop, unsigned _t_size, eoRng& _gen = rng)
+00223 {
+00224     return *deterministic_tournament(_pop.begin(), _pop.end(), _t_size, _gen);
+00225 }
+00226 
+00227 template <class It>
+00228 It inverse_deterministic_tournament(It _begin, It _end, unsigned _t_size, eoRng& _gen = rng)
+00229 {
+00230     It worst = _begin + _gen.random(_end - _begin);
+00231 
+00232     for (unsigned i = 1; i < _t_size; ++i)
+00233     {
+00234         It competitor = _begin + _gen.random(_end - _begin);
+00235 
+00236         if (competitor == worst)
+00237         {
+00238             --i;
+00239             continue; // try again
+00240         }
+00241 
+00242         if (*competitor < *worst)
+00243         {
+00244             worst = competitor;
+00245         }
+00246     }
+00247 
+00248     return worst;
+00249 }
+00250 
+00251 template <class EOT>
+00252 const EOT& inverse_deterministic_tournament(const eoPop<EOT>& _pop, unsigned _t_size, eoRng& _gen = rng)
+00253 {
+00254     return *inverse_deterministic_tournament<EOT>(_pop.begin(), _pop.end(), _t_size, _gen);
+00255 }
+00256 
+00257 template <class EOT>
+00258 EOT& inverse_deterministic_tournament(eoPop<EOT>& _pop, unsigned _t_size, eoRng& _gen = rng)
+00259 {
+00260     return *inverse_deterministic_tournament(_pop.begin(), _pop.end(), _t_size, _gen);
+00261 }
+00262 
+00263 template <class It>
+00264 It stochastic_tournament(It _begin, It _end, double _t_rate, eoRng& _gen = rng)
+00265 {
+00266   It i1 = _begin + _gen.random(_end - _begin);
+00267   It i2 = _begin + _gen.random(_end - _begin);
+00268 
+00269   bool return_better = _gen.flip(_t_rate);
+00270 
+00271   if (*i1 < *i2)
+00272   {
+00273       if (return_better) return i2;
+00274       // else
+00275 
+00276       return i1;
+00277    }
+00278     else
+00279     {
+00280       if (return_better) return i1;
+00281       // else
+00282     }
+00283     // else
+00284 
+00285     return i2;
+00286 }
+00287 
+00288 template <class EOT>
+00289 const EOT& stochastic_tournament(const eoPop<EOT>& _pop, double _t_rate, eoRng& _gen = rng)
+00290 {
+00291     return *stochastic_tournament(_pop.begin(), _pop.end(), _t_rate, _gen);
+00292 }
+00293 
+00294 template <class EOT>
+00295 EOT& stochastic_tournament(eoPop<EOT>& _pop, double _t_rate, eoRng& _gen = rng)
+00296 {
+00297     return *stochastic_tournament(_pop.begin(), _pop.end(), _t_rate, _gen);
+00298 }
+00299 
+00300 template <class It>
+00301 It inverse_stochastic_tournament(It _begin, It _end, double _t_rate, eoRng& _gen = rng)
+00302 {
+00303   It i1 = _begin + _gen.random(_end - _begin);
+00304   It i2 = _begin + _gen.random(_end - _begin);
+00305 
+00306   bool return_worse = _gen.flip(_t_rate);
+00307 
+00308   if (*i1 < *i2)
+00309   {
+00310       if (return_worse) return i1;
+00311       // else
+00312 
+00313       return i2;
+00314    }
+00315     else
+00316     {
+00317       if (return_worse) return i2;
+00318       // else
+00319     }
+00320     // else
+00321 
+00322     return i1;
+00323 }
+00324 
+00325 template <class EOT>
+00326 const EOT& inverse_stochastic_tournament(const eoPop<EOT>& _pop, double _t_rate, eoRng& _gen = rng)
+00327 {
+00328     return *inverse_stochastic_tournament(_pop.begin(), _pop.end(), _t_rate, _gen);
+00329 }
+00330 
+00331 template <class EOT>
+00332 EOT& inverse_stochastic_tournament(eoPop<EOT>& _pop, double _t_rate, eoRng& _gen = rng)
+00333 {
+00334     return *inverse_stochastic_tournament(_pop.begin(), _pop.end(), _t_rate, _gen);
+00335 }
+00336 
+00337 
+00338 #endif
+
    Generated on Thu Oct 19 05:06:42 2006 for EO by  + +doxygen 1.3.9.1
    + + diff --git a/trunk/paradiseo-eo/doc/html/shared__ptr_8h-source.html b/trunk/paradiseo-eo/doc/html/shared__ptr_8h-source.html new file mode 100644 index 000000000..ada9672e9 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/shared__ptr_8h-source.html @@ -0,0 +1,117 @@ + + +EO: shared_ptr.h Source File + + + +
    +Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
    +
    +contrib / mathsym
    +

    shared_ptr.h

    00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #ifndef _SHARED_PTR_H
+00019 #define _SHARED_PTR_H
+00020 
+00021 
+00022 template <class T> class weak_ptr;
+00023     
+00024 template <class T>
+00025 class shared_ptr {
+00026     private:
+00027         T* ptr;
+00028         unsigned* count; //
+00029 
+00030         /* special case, null pointer (nil-code) */
+00031         static unsigned* nil() { static unsigned nil_counter(1); return &nil_counter; }
+00032         
+00033         void decref() { if (--(*count) == 0) { delete ptr; delete count; }} 
+00034         void incref() { ++(*count); }
+00035         
+00036         friend class weak_ptr<T>;
+00037         
+00038     public:
+00039         
+00040         shared_ptr() : ptr(0), count(nil()) { incref(); }
+00041         ~shared_ptr() { decref(); }
+00042         
+00043         shared_ptr(const shared_ptr<T>& o) : ptr(o.ptr), count(o.count) { incref(); }
+00044         shared_ptr(T* p) : ptr(p), count(new unsigned(1)) {}
+00045         explicit shared_ptr(const weak_ptr<T>& w) : ptr(w.ptr), count(w.count) { incref(); }
+00046         
+00047         shared_ptr<T>& operator=(const shared_ptr<T>& o) {
+00048             if (ptr == o.ptr) return *this;
+00049             decref();
+00050             ptr = o.ptr;
+00051             count = o.count;
+00052             incref();
+00053             return *this;
+00054         }
+00055         
+00056         T* get() { return ptr; }
+00057         T* operator->() { return ptr; }
+00058         T& operator*()  { return *ptr; }
+00059 
+00060         const T* get() const { return ptr; }
+00061         const T* operator->() const { return ptr; }
+00062         const T& operator*() const { return *ptr; }
+00063 
+00064         bool operator==(const shared_ptr<T>& o) const { return ptr == o.ptr; }
+00065         bool operator!=(const shared_ptr<T>& o) const { return ptr != o.ptr; }
+00066         bool operator<(const shared_ptr<T>& o) const { return ptr < o.ptr; }    
+00067 
+00068         unsigned refcount() const { return *count; }
+00069 };
+00070 
+00071 template <class T>
+00072 class weak_ptr {
+00073         T* ptr;
+00074         unsigned* count;
+00075         
+00076         friend class shared_ptr<T>;
+00077         
+00078     public:
+00079         
+00080         weak_ptr() : ptr(0), count(shared_ptr<T>::nil()) {}
+00081         explicit weak_ptr( const shared_ptr<T>& s) : ptr(s.ptr), count(s.count) {}
+00082         
+00083         shared_ptr<T> lock() const { return shared_ptr<T>(*this); }
+00084 
+00085         
+00086         T* get() { return ptr; }
+00087         T* operator->() { return ptr; }
+00088         T& operator*()  { return *ptr; }
+00089 
+00090         const T* get() const { return ptr; }
+00091         const T* operator->() const { return ptr; }
+00092         const T& operator*() const { return *ptr; }
+00093 
+00094         bool operator==(const shared_ptr<T>& o) const { return ptr == o.ptr; }
+00095         bool operator!=(const shared_ptr<T>& o) const { return ptr != o.ptr; }
+00096         bool operator<(const shared_ptr<T>& o) const { return ptr < o.ptr; }    
+00097         
+00098         unsigned refcount() const { return *count; }
+00099         
+00100 };
+00101 
+00102 #endif
+
    Generated on Thu Oct 19 05:06:42 2006 for EO by  + +doxygen 1.3.9.1
    + + diff --git a/trunk/paradiseo-eo/doc/html/src_2pyeo_2_n_e_w_s-source.html b/trunk/paradiseo-eo/doc/html/src_2pyeo_2_n_e_w_s-source.html new file mode 100644 index 000000000..e5fea14f3 --- /dev/null +++ b/trunk/paradiseo-eo/doc/html/src_2pyeo_2_n_e_w_s-source.html @@ -0,0 +1,15 @@ + + +EO: NEWS Source File + + + +
    +Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages | Search for 
    +
    +src / pyeo
    +

    src/pyeo/NEWS

    Generated on Thu Oct 19 05:06:41 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/src_2pyeo_2_r_e_a_d_m_e-source.html b/trunk/paradiseo-eo/doc/html/src_2pyeo_2_r_e_a_d_m_e-source.html
new file mode 100644
index 000000000..5edf43719
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/src_2pyeo_2_r_e_a_d_m_e-source.html
@@ -0,0 +1,19 @@
+
+
+EO: README Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+src / pyeo
    
+
    src/pyeo/README
    00001 
+00002 See BUILDING for details on how to build this thing
+00003 
+00004 
+
    Generated on Thu Oct 19 05:06:42 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/statistics_8cpp-source.html b/trunk/paradiseo-eo/doc/html/statistics_8cpp-source.html
new file mode 100644
index 000000000..5837a6da8
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/statistics_8cpp-source.html
@@ -0,0 +1,76 @@
+
+
+EO: statistics.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+src / pyeo
    
+
    statistics.cpp
    00001 #include <utils/eoStat.h>
+00002 
+00003 #include "PyEO.h"
+00004 #include "valueParam.h"
+00005 
+00006 using namespace boost::python;
+00007 
+00008 class StatBaseWrapper : public eoStatBase<PyEO> 
+00009 {
+00010     public:
+00011     PyObject* self;
+00012     StatBaseWrapper(PyObject* p) : self(p) {}
+00013 
+00014     void operator()(const eoPop<PyEO>& pop)
+00015     {
+00016         call_method<void>(self, "__call__", boost::ref(pop));
+00017     }
+00018 };
+00019 
+00020 class SortedStatBaseWrapper : public eoSortedStatBase<PyEO> 
+00021 {
+00022     public:
+00023     PyObject* self;
+00024     SortedStatBaseWrapper(PyObject* p) : self(p) {}
+00025 
+00026     void operator()(const std::vector<const PyEO*>& pop)
+00027     {
+00028         call_method<void>(self, "__call__", boost::ref(pop));
+00029     }
+00030 };
+00031 
+00032 typedef std::vector<const PyEO*> eoPopView;
+00033 
+00034 const PyEO& popview_getitem(const std::vector<const PyEO*>& pop, int it) 
+00035 { 
+00036     unsigned item = unsigned(it);
+00037     if (item > pop.size())
+00038         throw index_error("too much");
+00039             
+00040     return *pop[item]; 
+00041 }
+00042 
+00043 void statistics()
+00044 {
+00045     class_<eoStatBase<PyEO>, StatBaseWrapper, boost::noncopyable>
+00046         ("eoStatBase", init<>())
+00047         .def("lastCall", &eoStatBase<PyEO>::lastCall)
+00048         .def("__call__", &StatBaseWrapper::operator())
+00049         ;
+00050 
+00051     class_< eoPopView >("eoPopView")
+00052         .def("__getitem__", popview_getitem, return_internal_reference<>() )
+00053         .def("__len__", &eoPopView::size)
+00054         ;
+00055     
+00056     class_<eoSortedStatBase<PyEO>, SortedStatBaseWrapper, boost::noncopyable>
+00057         ("eoSortedStatBase", init<>())
+00058         .def("lastCall", &eoSortedStatBase<PyEO>::lastCall)
+00059         .def("__call__", &SortedStatBaseWrapper::operator())
+00060         ;
+00061 }
+
    Generated on Thu Oct 19 05:06:42 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/stats_8h-source.html b/trunk/paradiseo-eo/doc/html/stats_8h-source.html
new file mode 100644
index 000000000..86d948eb6
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/stats_8h-source.html
@@ -0,0 +1,133 @@
+
+
+EO: stats.h Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+contrib / mathsym / regression
    
+
    stats.h
    00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #include <vector>
+00019 
+00020 class Mean {
+00021 
+00022     double n;
+00023     double mean;
+00024 
+00025     public:
+00026     Mean() : n(0), mean(0) {}
+00027     
+00028     void update(double v) {
+00029         n++;
+00030         double d = v - mean;
+00031         mean += 1/n * d;
+00032     }
+00033 
+00034     double get_mean() const { return mean; }
+00035 };
+00036 
+00037 class Var {
+00038     double n;
+00039     double mean;
+00040     double sumvar;
+00041 
+00042     public:
+00043     Var() : n(0), mean(0), sumvar(0) {}
+00044 
+00045     void update(double v) {
+00046         n++;
+00047         double d = v - mean;
+00048         mean += 1/n * d;
+00049         sumvar += (n-1)/n * d * d;
+00050     }
+00051 
+00052     double get_mean() const { return mean;           }
+00053     double get_var()  const { return sumvar / (n-1); }
+00054     double get_std()  const { return sqrt(get_var());  }
+00055 };
+00056 
+00058 class Cov {
+00059     double n;
+00060     double meana;
+00061     double meanb;
+00062     double sumcov;
+00063     
+00064     public:
+00065     Cov() : n(0), meana(0), meanb(0), sumcov(0) {}
+00066 
+00067     void update(double a, double b) {
+00068         ++n;
+00069         double da = a - meana;
+00070         double db = b - meanb;
+00071 
+00072         meana += 1/n * da;
+00073         meanb += 1/n * db;
+00074 
+00075         sumcov += (n-1)/n * da * db;
+00076     }
+00077     
+00078     double get_meana() const { return meana; }
+00079     double get_meanb() const { return meanb; }
+00080     double get_cov()   const { return sumcov / (n-1); }
+00081 };
+00082 
+00083 class CovMatrix {
+00084     double n;
+00085     std::vector<double> mean;
+00086     std::vector< std::vector<double> > sumcov;
+00087 
+00088     public:
+00089     CovMatrix(unsigned dim) : n(0), mean(dim), sumcov(dim , std::vector<double>(dim)) {}
+00090 
+00091     void update(const std::vector<double>& v) {
+00092         n++;
+00093         
+00094         for (unsigned i = 0; i < v.size(); ++i) {
+00095             double d = v[i] - mean[i];
+00096             mean[i] += 1/n * d;
+00097 
+00098             sumcov[i][i] += (n-1)/n * d * d;
+00099 
+00100             for (unsigned j = i; j < v.size(); ++j) {
+00101                 double e = v[j] - mean[j]; // mean[j] is not updated yet
+00102                 
+00103                 double upd = (n-1)/n * d * e;
+00104 
+00105                 sumcov[i][j] += upd;
+00106                 sumcov[j][i] += upd;
+00107                 
+00108             }
+00109         }
+00110         
+00111     }
+00112     
+00113     double get_mean(int i) const { return mean[i]; }
+00114     double get_var(int i ) const { return sumcov[i][i] / (n-1); }
+00115     double get_std(int i) const  { return sqrt(get_var(i)); }
+00116     double get_cov(int i, int j) const { return sumcov[i][j] / (n-1); }
+00117     
+00118 };
+00119 
+
    Generated on Thu Oct 19 05:06:42 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/struct_dummy-members.html b/trunk/paradiseo-eo/doc/html/struct_dummy-members.html
new file mode 100644
index 000000000..040fbf5ab
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/struct_dummy-members.html
@@ -0,0 +1,56 @@
+
+
+EO: Member List
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    Dummy Member List
    This is the complete list of members for Dummy, including all inherited members.
    
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+  
+
    className() const EO< double > [inline, virtual]
    Dummy(std::string _s="") (defined in Dummy)Dummy [inline]
    EO()EO< double > [inline]
    EO() (defined in EO< double >)EO< double > [inline]
    fitness() const EO< double > [inline]
    fitness(const Fitness &_fitness)EO< double > [inline]
    fitness(performance_type perf) (defined in EO< double >)EO< double > [inline]
    fitness(void) const  (defined in EO< double >)EO< double > [inline]
    Fitness typedef (defined in EO< double >)EO< double >
    fitness_traits typedef (defined in EO< double >)EO< double >
    invalid() const EO< double > [inline]
    invalidate() (defined in EO< double >)EO< double > [inline]
    invalidate(void) (defined in EO< double >)EO< double > [inline]
    invalidate_worth(void) (defined in EO< double >)EO< double > [inline]
    operator<(const EO &_eo2) const EO< double > [inline]
    operator<(const EO< Fitness, Traits > &other) const  (defined in EO< double >)EO< double > [inline]
    operator>(const EO &_eo2) const  (defined in EO< double >)EO< double > [inline]
    operator>(const EO< Fitness, Traits > &other) const  (defined in EO< double >)EO< double > [inline]
    performance(performance_type perf) (defined in EO< double >)EO< double > [inline]
    performance(void) const  (defined in EO< double >)EO< double > [inline]
    performance_type typedef (defined in EO< double >)EO< double >
    printOn(std::ostream &_os) const Dummy [inline, virtual]
    printOn(std::ostream &_os) const Dummy [inline, virtual]
    printOn(std::ostream &_os) const Dummy [inline, virtual]
    printOn(std::ostream &_os) const Dummy [inline, virtual]
    readFrom(std::istream &_is)EO< double > [inline, virtual]
    s (defined in Dummy)Dummy
    storage_type typedef (defined in EO< double >)EO< double >
    Type typedef (defined in Dummy)Dummy
    Type typedef (defined in Dummy)Dummy
    Type typedef (defined in Dummy)Dummy
    Type typedef (defined in Dummy)Dummy
    Type typedef (defined in Dummy)Dummy
    Type typedef (defined in Dummy)Dummy
    worth(worth_type worth) (defined in EO< double >)EO< double > [inline]
    worth(void) const  (defined in EO< double >)EO< double > [inline]
    worth_type typedef (defined in EO< double >)EO< double >
    xdist (defined in Dummy)Dummy
    ~EO()EO< double > [inline, virtual]
    ~eoObject()eoObject [inline, virtual]
    ~eoPersistent()eoPersistent [inline, virtual]
    ~eoPrintable()eoPrintable [inline, virtual]
    Generated on Thu Oct 19 05:06:47 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/struct_dummy.html b/trunk/paradiseo-eo/doc/html/struct_dummy.html
new file mode 100644
index 000000000..7f702bf67
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/struct_dummy.html
@@ -0,0 +1,255 @@
+
+
+EO: Dummy Struct Reference
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    Dummy Struct Reference
    test program for the general operator - millenium version! uses dummy individuals  
+More...
+
    
+
    Inheritance diagram for Dummy:
+
    
+
+EO< double >
+EO< double >
+EO< double >
+EO< double >
+EO< double >
+EO< double >
+eoPersistent
+eoObject
+eoPersistent
+eoObject
+eoPersistent
+eoObject
+eoPersistent
+eoObject
+eoPersistent
+eoObject
+eoPersistent
+eoObject
+
+List of all members.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+

    Public Types
    
+typedef double Type
    
+typedef double Type
    
+typedef double Type
    
+typedef double Type
    
+typedef double Type
    
+typedef double Type

    Public Member Functions
    
+ Dummy (std::string _s="")
    void printOn (std::ostream &_os) const 
     Write object.  
    void printOn (std::ostream &_os) const 
     Write object.  
    void printOn (std::ostream &_os) const 
     Write object.  
    void printOn (std::ostream &_os) const 
     Write object.  

    Public Attributes
    
+std::string s
    
+double xdist
    
+
    Detailed Description
    
+test program for the general operator - millenium version! uses dummy individuals 
+
    
+
+
    
+Definition at line 27 of file t-eoCheckpointing.cpp.
    Member Function Documentation
    
+
    
+
+  
+    
+  
+
    
+      
+        
+          
+          
+          
+          
+          
+          
+        
+      
    void Dummy::printOn           ( std::ostream &  _os           )  const [inline, virtual]
    
+    
    
+
+  
+    
+    
+  
+
    
+       
+    
+
+
    
+Write object. 
+
    
+Called printOn since it prints the object _on_ a stream. 
    Parameters:
    
+  
+    
+  
    _os A std::ostream. 
    
+
    
+
+
    
+Reimplemented from EO< double >.
+
    
+Definition at line 41 of file t-eoGenOp.cpp.
+
    
+References EO< F >::printOn().    
    
+
    
+
+  
+    
+  
+
    
+      
+        
+          
+          
+          
+          
+          
+          
+        
+      
    void Dummy::printOn           ( std::ostream &  _os           )  const [inline, virtual]
    
+    
    
+
+  
+    
+    
+  
+
    
+       
+    
+
+
    
+Write object. 
+
    
+Called printOn since it prints the object _on_ a stream. 
    Parameters:
    
+  
+    
+  
    _os A std::ostream. 
    
+
    
+
+
    
+Reimplemented from EO< double >.
+
    
+Definition at line 23 of file t-eoReplacement.cpp.
+
    
+References EO< F >::printOn().    
    
+
    
+
+  
+    
+  
+
    
+      
+        
+          
+          
+          
+          
+          
+          
+        
+      
    void Dummy::printOn           ( std::ostream &  _os           )  const [inline, virtual]
    
+    
    
+
+  
+    
+    
+  
+
    
+       
+    
+
+
    
+Write object. 
+
    
+Called printOn since it prints the object _on_ a stream. 
    Parameters:
    
+  
+    
+  
    _os A std::ostream. 
    
+
    
+
+
    
+Reimplemented from EO< double >.
+
    
+Definition at line 18 of file t-eoSelect.cpp.
+
    
+References EO< F >::printOn().    
    
+
    
+
+  
+    
+  
+
    
+      
+        
+          
+          
+          
+          
+          
+          
+        
+      
    void Dummy::printOn           ( std::ostream &  _os           )  const [inline, virtual]
    
+    
    
+
+  
+    
+    
+  
+
    
+       
+    
+
+
    
+Write object. 
+
    
+Called printOn since it prints the object _on_ a stream. 
    Parameters:
    
+  
+    
+  
    _os A std::ostream. 
    
+
    
+
+
    
+Reimplemented from EO< double >.
+
    
+Definition at line 24 of file t-eoSharing.cpp.
+
    
+References EO< F >::printOn().    
    
+
    The documentation for this struct was generated from the following files:
+
    Generated on Thu Oct 19 05:06:47 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/struct_dummy.png b/trunk/paradiseo-eo/doc/html/struct_dummy.png
new file mode 100644
index 0000000000000000000000000000000000000000..c2ce424cf5af29cae0666ecf0b3b53b48ebd85b6
GIT binary patch
literal 1564
zcmeAS@N?(olHy`uVBq!ia0y~yVA%&`A7Ehyl0Q~&p9`cU0(?ST|Ns9FWd8quVE+7s
z2|yMYA2@KJ`q2L;KrUlRkY6x^!?PP{3=FKBJY5_^D(1Ys8ymFRN2E1z??oz!aH2Y|N4K^TE%?S
zc_zp4bH2`>x8+{;Jlu62gXe8
zcb>Y+MkuW~vpXM(g{4HgF4>EVv6L)Dn>k11ezHkBmIgLQo$DQ`=ZIXD`
z;ImHQR(zZz(0Tl=+jm;;IQw?h^H&a>>s(ecFZFw>xp431bv3dYj8m4kR15C$3y6zH
z_khq+zA08yEf?Ogo)QoPq+^_bzqm-{EXbgr2qWcPmw-<0rRFV6G-=bC$^ES>P-r+Vpv
zJ#&IQB0k!QPC0RE&Ihme%}y(WX9}NUJsLVNk%XQaA~c@bP2pjEYWCF5M3z-GPZrg8
z;GDCsPx!~uWxub@DZesL&SdiO?AHz(L-rk;Ycjbu^OZwkh}%NhZ`akg{w@@{v@Cu}
zQt5&ln$w+L$uGOCaw>C9K&5?-W+;1CztOx#_J#M)8d#SX$MHDr&wX1dchqlY*@ps+
zJz|%B?2gy^V&zyEq}Mlr-|7d8h!x*r3C-!@0^;cpLjKtFCoR9Tli4W7QAXT#eQIiwE>f?Qf0(W)4V!V3A_l
zn6w6@Gsu;1K?Je+$5P<&i{GbhDqk~BxNtI>zoEtNUKN8%$){_~3JWK1mt)|ZyXPx|
z$BQRx*&UqJ^KBV~tcX#Xq@sK3+G5r9)9y}^uM6*Oa^d~!I%VPh4x=yPfo=bkPQ`o)
z_xk+St$t$b%~-pc?-hP^>zoO#-~0C7ZoONw`^&rkWeb6X?*8+7AKU)+lJ#HLuxI~1
zzW&qyPigfh=la+(k-x5DY5Vryd#S%k%lvx(-Te43;+j)$|BlbBD%!J09%S;*hyQGW
z`cg0QR)fr{sgKQFy8pzX5C3nwNdD^9aIP0jeWAaI2k5Yee=~3W;h%Pro89fhUISoJ
O&fw|l=d#Wzp$Pz(s@_Tf

literal 0
HcmV?d00001

diff --git a/trunk/paradiseo-eo/doc/html/struct_t__pickle__suite-members.html b/trunk/paradiseo-eo/doc/html/struct_t__pickle__suite-members.html
new file mode 100644
index 000000000..3d8d362f4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/struct_t__pickle__suite-members.html
@@ -0,0 +1,17 @@
+
+
+EO: Member List
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    T_pickle_suite< T > Member List
    This is the complete list of members for T_pickle_suite< T >, including all inherited members.
    
+  
+  
+  
+
    getstate(const T &t) (defined in T_pickle_suite< T >)T_pickle_suite< T > [inline, static]
    print_to_string(const T &t) (defined in T_pickle_suite< T >)T_pickle_suite< T > [inline, static]
    setstate(T &t, boost::python::tuple pickled) (defined in T_pickle_suite< T >)T_pickle_suite< T > [inline, static]
    Generated on Thu Oct 19 05:06:57 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/struct_t__pickle__suite.html b/trunk/paradiseo-eo/doc/html/struct_t__pickle__suite.html
new file mode 100644
index 000000000..dd7edf042
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/struct_t__pickle__suite.html
@@ -0,0 +1,41 @@
+
+
+EO: T_pickle_suite< T > Struct Template Reference
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    T_pickle_suite< T > Struct Template Reference
    Implements pickle support for eoPersistent derivatives.  
+More...
+
    
+#include <pickle.h>
+
    
+List of all members.
+
+
+
+
+
+
+
+
+

    Static Public Member Functions
    
+std::string print_to_string (const T &t)
    
+boost::python::tuple getstate (const T &t)
    
+void setstate (T &t, boost::python::tuple pickled)
    
+
    Detailed Description
    
+
    template<class T>
    
+ struct T_pickle_suite< T >
    
+
+Implements pickle support for eoPersistent derivatives. 
+
    
+
+
    
+Definition at line 32 of file pickle.h.
    The documentation for this struct was generated from the following file:
+
    Generated on Thu Oct 19 05:06:57 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/structeo_eval_func_ptr-members.html b/trunk/paradiseo-eo/doc/html/structeo_eval_func_ptr-members.html
new file mode 100644
index 000000000..5ffe24790
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/structeo_eval_func_ptr-members.html
@@ -0,0 +1,22 @@
+
+
+EO: Member List
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    eoEvalFuncPtr< EOT, FitT, FunctionArg > Member List
    This is the complete list of members for eoEvalFuncPtr< EOT, FitT, FunctionArg >, including all inherited members.
    
+  
+  
+  
+  
+  
+  
+  
+  
+
    eoEvalFuncPtr(FitT(*_eval)(FunctionArg))eoEvalFuncPtr< EOT, FitT, FunctionArg > [inline]
    EOFitT typedef (defined in eoEvalFunc< EOT >)eoEvalFunc< EOT >
    EOType typedef (defined in eoEvalFunc< EOT >)eoEvalFunc< EOT >
    evalFunc (defined in eoEvalFuncPtr< EOT, FitT, FunctionArg >)eoEvalFuncPtr< EOT, FitT, FunctionArg > [private]
    functor_category()eoUF< EOT &, void > [inline, static]
    operator()(EOT &_eo)eoEvalFuncPtr< EOT, FitT, FunctionArg > [inline, virtual]
    ~eoFunctorBase()eoFunctorBase [inline, virtual]
    ~eoUF()eoUF< EOT &, void > [inline, virtual]
    Generated on Thu Oct 19 05:06:48 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/structeo_eval_func_ptr.html b/trunk/paradiseo-eo/doc/html/structeo_eval_func_ptr.html
new file mode 100644
index 000000000..3222cd7ef
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/structeo_eval_func_ptr.html
@@ -0,0 +1,95 @@
+
+
+EO: eoEvalFuncPtr< EOT, FitT, FunctionArg > Struct Template Reference
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    eoEvalFuncPtr< EOT, FitT, FunctionArg > Struct Template Reference
    EOEvalFuncPtr: This class takes an existing function pointer and converts it into a evaluation function class.  
+More...
+
    
+#include <eoEvalFuncPtr.h>
+
    
+
    Inheritance diagram for eoEvalFuncPtr< EOT, FitT, FunctionArg >:
+
    
+
+eoEvalFunc< EOT >
+eoUF< EOT &, void >
+eoFunctorBase
+
+List of all members.
+
+
+
+
+
+
+
+
+
+
+
+

    Public Member Functions
     eoEvalFuncPtr (FitT(*_eval)(FunctionArg))
     Applies the function to the chromosome and sets the fitness of the Chrom.  
    
+virtual void operator() (EOT &_eo)
     Effectively applies the evaluation function to an EO. 

    Private Attributes
    
+FitT(* evalFunc )(FunctionArg)
    
+
    Detailed Description
    
+
    template<class EOT, class FitT = typename EOT::Fitness, class FunctionArg = const EOT&>
    
+ struct eoEvalFuncPtr< EOT, FitT, FunctionArg >
    
+
+EOEvalFuncPtr: This class takes an existing function pointer and converts it into a evaluation function class. 
+
    
+That way, old style C or C++ functions can be adapted to EO function classes. 
+
    
+
+
    
+Definition at line 43 of file eoEvalFuncPtr.h.
    Constructor & Destructor Documentation
    
+
    
+
+  
+    
+  
+
    
+      
+        
+          
+        
+        
+          
+          
+          
+          
+          
+          
+        
+      
    
+template<class EOT, class FitT = typename EOT::Fitness, class FunctionArg = const EOT&> 
    eoEvalFuncPtr< EOT, FitT, FunctionArg >::eoEvalFuncPtr           ( FitT(*)(FunctionArg)  _eval           )  [inline]
    
+    
    
+
+  
+    
+    
+  
+
    
+       
+    
+
+
    
+Applies the function to the chromosome and sets the fitness of the Chrom. 
+
    
+Thus, the evaluation function need not be worried about that. 
    Parameters:
    
+  
+    
+  
    _eval pointer to the evaluation function, takes a EOT as an argument and returns the fitness 
    
+
    
+
    Returns:
    the evaluated fitness for that object. 
    
+
+
    
+Definition at line 51 of file eoEvalFuncPtr.h.    
    
+
    The documentation for this struct was generated from the following file:
+
    Generated on Thu Oct 19 05:06:48 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/structeo_eval_func_ptr.png b/trunk/paradiseo-eo/doc/html/structeo_eval_func_ptr.png
new file mode 100644
index 0000000000000000000000000000000000000000..363d57443bb5a8aac1f5e200cf0f415ee88e615c
GIT binary patch
literal 1552
zcmZ`(3pCSv93RWyqhW`#P4_J6^q{P5x+BjmR$P&*>A~d=dr;nw2siO3k<8qk_nx|)dr$YA@9+2fe7?Wu=kxoWUz)4SK}`*P4G09H
z>F8kZ27xF83d~yvRn(Vk@9QcWr0XFHSuU3=pj^(oc8!{)Kz|n=j~CY@pHNVxNH>=w
z5aMJX0|HUGMb;8IT!0Up0PrUCElyq82Kr$3+C{v8i5Bp1qcD5G2wk{<1)L*|8v(!>rjnM3ce`eX
z+$khAzS|1MWNuUo!Knr7jZ+20H%U~?A-_o*;6nHrD%aG(`>BA`hY+tuQhY0b(T1=N
zYi6Nj+Ou+21>6g;cffLvtp@@O+K}(js&p#{yP^V9^WA8XG1Lf%9?%~rRbuv%iRO6p
z2J!wKo!zdwy(viT8|B&_2)Mw{q4#!PZALY#3Ip5a-DoSCCHk6ojwOnl4*L(T@oOe+
zdrP~#(@CZ;KQ$DWO~Z=*iqaK}*g
z01c9@gd)<2034O2^bZZy1(-{EsnySlK!obcbbgi`@7KYAseqTamb^`h_Qg(;wjHFWkbYZlH|}xDyF|r{mB_FT
zpsPW1!z!roH%(4z2p{YO`EGAcd_e{{63d1~S^G$Jn#jn=AsR+x41TA~gw5c!8ZW9o
zdC;M!G@3bUP_~|}Zk5!ssCvi6_g9WyNG&F?XHIW)*iYJGn_asJWGQqI{|crbue~Q)
zte4=|Z-mFTw^^o$cs8bzb%s#kWwmeV{*Mh`=}?l=Bakl{`{GnpK52GBsCVX)STp^G
z&=SAXtT+DZ4(nIx{0}Xx2PdL&0VVMjy;h?V7Z~I4*+ct0vq>()9*(hrHEpS-xU8$y
zl$w>~W?A3EnJYJhCU8tMHGXbu_@alAfJCccf2dV&q9bVu5Ag|=o|zyD^t=S(&>71Y
zrPa=`cOMlSJ^|}7Q**34odhJ{=$rNT)X0xo>Qz}n4O4dQIXu*V)@><
zt^2%<%)vr=<12T1<@@XA;jdQTB5QpkEUaYDb2T2tpP_wkQvPA&?(%I*ZD<4MBunU|
z0~(vp%$FPg^seckgy9mmC)e=V7W3-7nAXtkbXWJY_F?+K$&mVvW(LFcwb!Vs_l4C=
zem!zB7d`RZD00xU%w1Y{r$Ga-DDB?&7&Nxvn)_Nw`$L0{>awzUYJ?
zfIH!H4^iChgwxW2=5aX@gF=3elJYbU!c-jQ%@06s9hQ#O8et(R`8;(Y-#
+
+EO: eoFunctorBase::binary_function_tag Struct Reference
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    eoFunctorBase::binary_function_tag Struct Reference
    tag to identify a binary function in compile time function selection functor_category  
+More...
+
    
+#include <eoFunctor.h>
+
    
+
+
+
    
+
    Detailed Description
    
+tag to identify a binary function in compile time function selection functor_category 
+
    
+
+
    
+Definition at line 57 of file eoFunctor.h.
    The documentation for this struct was generated from the following file:
+
    Generated on Thu Oct 19 05:06:49 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/structeo_functor_base_1_1procedure__tag.html b/trunk/paradiseo-eo/doc/html/structeo_functor_base_1_1procedure__tag.html
new file mode 100644
index 000000000..f2ebe3924
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/structeo_functor_base_1_1procedure__tag.html
@@ -0,0 +1,28 @@
+
+
+EO: eoFunctorBase::procedure_tag Struct Reference
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    eoFunctorBase::procedure_tag Struct Reference
    tag to identify a procedure in compile time function selection functor_category  
+More...
+
    
+#include <eoFunctor.h>
+
    
+
+
+
    
+
    Detailed Description
    
+tag to identify a procedure in compile time function selection functor_category 
+
    
+
+
    
+Definition at line 53 of file eoFunctor.h.
    The documentation for this struct was generated from the following file:
+
    Generated on Thu Oct 19 05:06:49 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/structeo_functor_base_1_1unary__function__tag.html b/trunk/paradiseo-eo/doc/html/structeo_functor_base_1_1unary__function__tag.html
new file mode 100644
index 000000000..9f963330c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/structeo_functor_base_1_1unary__function__tag.html
@@ -0,0 +1,28 @@
+
+
+EO: eoFunctorBase::unary_function_tag Struct Reference
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    eoFunctorBase::unary_function_tag Struct Reference
    tag to identify a unary function in compile time function selection functor_category  
+More...
+
    
+#include <eoFunctor.h>
+
    
+
+
+
    
+
    Detailed Description
    
+tag to identify a unary function in compile time function selection functor_category 
+
    
+
+
    
+Definition at line 55 of file eoFunctor.h.
    The documentation for this struct was generated from the following file:
+
    Generated on Thu Oct 19 05:06:49 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/structeo_pop_1_1_cmp-members.html b/trunk/paradiseo-eo/doc/html/structeo_pop_1_1_cmp-members.html
new file mode 100644
index 000000000..ce6e59fc1
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/structeo_pop_1_1_cmp-members.html
@@ -0,0 +1,15 @@
+
+
+EO: Member List
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    eoPop< EOT >::Cmp Member List
    This is the complete list of members for eoPop< EOT >::Cmp, including all inherited members.
    
+  
+
    operator()(const EOT *a, const EOT *b) const  (defined in eoPop< EOT >::Cmp)eoPop< EOT >::Cmp [inline]
    Generated on Thu Oct 19 05:06:53 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/structeo_pop_1_1_cmp.html b/trunk/paradiseo-eo/doc/html/structeo_pop_1_1_cmp.html
new file mode 100644
index 000000000..690d78936
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/structeo_pop_1_1_cmp.html
@@ -0,0 +1,35 @@
+
+
+EO: eoPop< EOT >::Cmp Struct Reference
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    eoPop< EOT >::Cmp Struct Reference
    helper struct for comparing on pointers  
+More...
+
    
+#include <eoPop.h>
+
    
+List of all members.
+
+
+
+
+

    Public Member Functions
    
+bool operator() (const EOT *a, const EOT *b) const 
    
+
    Detailed Description
    
+
    template<class EOT>
    
+ struct eoPop< EOT >::Cmp
    
+
+helper struct for comparing on pointers 
+
    
+
+
    
+Definition at line 124 of file eoPop.h.
    The documentation for this struct was generated from the following file:
+
    Generated on Thu Oct 19 05:06:53 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/structeo_pop_1_1_ref-members.html b/trunk/paradiseo-eo/doc/html/structeo_pop_1_1_ref-members.html
new file mode 100644
index 000000000..37fd22d9e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/structeo_pop_1_1_ref-members.html
@@ -0,0 +1,15 @@
+
+
+EO: Member List
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    eoPop< EOT >::Ref Member List
    This is the complete list of members for eoPop< EOT >::Ref, including all inherited members.
    
+  
+
    operator()(const EOT &eot) (defined in eoPop< EOT >::Ref)eoPop< EOT >::Ref [inline]
    Generated on Thu Oct 19 05:06:53 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/structeo_pop_1_1_ref.html b/trunk/paradiseo-eo/doc/html/structeo_pop_1_1_ref.html
new file mode 100644
index 000000000..b3e793995
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/structeo_pop_1_1_ref.html
@@ -0,0 +1,35 @@
+
+
+EO: eoPop< EOT >::Ref Struct Reference
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    eoPop< EOT >::Ref Struct Reference
    helper struct for getting a pointer  
+More...
+
    
+#include <eoPop.h>
+
    
+List of all members.
+
+
+
+
+

    Public Member Functions
    
+const EOT * operator() (const EOT &eot)
    
+
    Detailed Description
    
+
    template<class EOT>
    
+ struct eoPop< EOT >::Ref
    
+
+helper struct for getting a pointer 
+
    
+
+
    
+Definition at line 122 of file eoPop.h.
    The documentation for this struct was generated from the following file:
+
    Generated on Thu Oct 19 05:06:53 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/structeo_state_1_1loading__error-members.html b/trunk/paradiseo-eo/doc/html/structeo_state_1_1loading__error-members.html
new file mode 100644
index 000000000..a390d27fd
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/structeo_state_1_1loading__error-members.html
@@ -0,0 +1,15 @@
+
+
+EO: Member List
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    eoState::loading_error Member List
    This is the complete list of members for eoState::loading_error, including all inherited members.
    
+  
+
    loading_error(std::string huh="Error while loading") (defined in eoState::loading_error)eoState::loading_error [inline]
    Generated on Thu Oct 19 05:06:56 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/structeo_state_1_1loading__error.html b/trunk/paradiseo-eo/doc/html/structeo_state_1_1loading__error.html
new file mode 100644
index 000000000..deec6e10a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/structeo_state_1_1loading__error.html
@@ -0,0 +1,32 @@
+
+
+EO: eoState::loading_error Struct Reference
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    eoState::loading_error Struct Reference
    Loading error thrown when nothing seems to work.  
+More...
+
    
+#include <eoState.h>
+
    
+List of all members.
+
+
+
+
+

    Public Member Functions
    
+ loading_error (std::string huh="Error while loading")
    
+
    Detailed Description
    
+Loading error thrown when nothing seems to work. 
+
    
+
+
    
+Definition at line 83 of file eoState.h.
    The documentation for this struct was generated from the following file:
+
    Generated on Thu Oct 19 05:06:56 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/sym__compile_8cpp-source.html b/trunk/paradiseo-eo/doc/html/sym__compile_8cpp-source.html
new file mode 100644
index 000000000..7670b5755
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/sym__compile_8cpp-source.html
@@ -0,0 +1,234 @@
+
+
+EO: sym_compile.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+contrib / mathsym / eval
    
+
    sym_compile.cpp
    00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 
+00019 #include "Sym.h"
+00020 #include "FunDef.h"
+00021 #include "sym_compile.h"
+00022 
+00023 #include <sstream>
+00024 
+00025 using namespace std;
+00026 
+00027 extern "C" {
+00028     void  symc_init();
+00029     int  symc_compile(const char* func_str);
+00030     int  symc_link();
+00031     void* symc_get_fun(const char* func_name);
+00032     void* symc_make(const char* func_str, const char* func_name);
+00033 }
+00034 
+00035 string make_prototypes() {
+00036     string prot = get_prototypes();
+00037     prot += "double sqr(double x) { return x*x; }";
+00038     return prot;
+00039 }
+00040 
+00041 // contains variable names, like 'a0', 'a1', etc. or regular code
+00042 
+00043 #if USE_TR1 
+00044 typedef std::tr1::unordered_map<Sym, string, HashSym> HashMap;
+00045 #else
+00046 typedef hash_map<Sym, string, HashSym> HashMap;
+00047 #endif
+00048 
+00049 // prints 'num' in reverse notation. Does not matter as it's a unique id
+00050 string make_var(unsigned num) {
+00051     string str = "a";
+00052     do {
+00053         str += char('0' + (num % 10));
+00054         num /= 10;
+00055     } while (num);
+00056     return str;
+00057 }
+00058 
+00059 template <class T>
+00060 string to_string(T t) {
+00061     ostringstream os;
+00062     os << t;
+00063     return os.str();
+00064 }
+00065 
+00066 
+00067 HashMap::iterator find_entry(const Sym& sym, string& str, HashMap& map) {
+00068     HashMap::iterator result = map.find(sym);
+00069 
+00070     if (result == map.end()) { // new entry
+00071         const SymVec& args = sym.args();
+00072         
+00073         vector<string> argstr(args.size());
+00074         for (unsigned i = 0; i < args.size(); ++i) {
+00075             argstr[i] = find_entry(args[i], str, map)->second;
+00076         }
+00077 
+00078         string var = make_var(map.size()); // map.size(): unique id
+00079         string code;    
+00080         // write out the code
+00081         const FunDef& fun = get_element(sym.token());
+00082         code = fun.c_print(argstr, vector<string>() );
+00083             
+00084         str += "double " + var + "=" + code + ";\n";
+00085         result = map.insert( make_pair(sym, var ) ).first; // only want iterator
+00086     }
+00087     
+00088     return result;
+00089 }
+00090 
+00091 void write_entry(const Sym& sym, string& str, HashMap& map, unsigned out) {
+00092     HashMap::iterator it = find_entry(sym, str, map);
+00093     
+00094     str += "y[" + to_string(out) + "]=" + it->second + ";\n";
+00095     //cout << "wrote " << out << '\n';
+00096 }
+00097 
+00098 #include <fstream>
+00099 multi_function compile(const std::vector<Sym>& syms) {
+00100     
+00101     //cout << "Multifunction " << syms.size() << endl;
+00102     // static stream to avoid fragmentation of these LARGE strings
+00103     static string str;
+00104     str.clear();
+00105     str += make_prototypes();
+00106 
+00107     str += "extern double func(const double* x, double* y) { \n ";
+00108    
+00109     multi_function result;
+00110     HashMap map(Sym::get_dag().size());
+00111     
+00112     for (unsigned i = 0; i < syms.size(); ++i) {
+00113         write_entry(syms[i], str, map, i);
+00114     }
+00115     
+00116     str += ";}";
+00117 
+00118     
+00119     /*static int counter = 0;
+00120     ostringstream nm;
+00121     nm << "cmp/compiled" << (counter++) << ".c";
+00122     cout << "Saving as " << nm.str() << endl;
+00123     ofstream cmp(nm.str().c_str());
+00124     cmp << str;
+00125     cmp.close();
+00126 
+00127     //cout << "Multifunction " << syms.size() << endl;
+00128     cout << "Size of map " << map.size() << endl;
+00129 */
+00130 
+00131     result = (multi_function) symc_make(str.c_str(), "func"); 
+00132 
+00133     if (result==0) { // error
+00134         cout << "Error in compile " << endl;
+00135     }
+00136 
+00137     return result;
+00138 }
+00139 
+00140 single_function compile(Sym sym) {
+00141 
+00142     ostringstream os;
+00143 
+00144     os << make_prototypes();
+00145     os << "double func(const double* x) { return ";
+00146     
+00147     string code = c_print(sym);
+00148     os << code;
+00149     os << ";}";
+00150     string func_str = os.str();
+00151   
+00152     //cout << "compiling " << func_str << endl;
+00153     
+00154     return  (single_function) symc_make(func_str.c_str(), "func"); 
+00155 }
+00156 
+00157 /* finds and inserts the full code in a hashmap */
+00158 HashMap::iterator find_code(Sym sym, HashMap& map) {
+00159     HashMap::iterator result = map.find(sym);
+00160 
+00161     if (result == map.end()) { // new entry
+00162         const SymVec& args = sym.args();
+00163         vector<string> argstr(args.size());
+00164         for (unsigned i = 0; i < args.size(); ++i) {
+00165             argstr[i] = find_code(args[i], map)->second;
+00166         }
+00167 
+00168         // write out the code
+00169         const FunDef& fun = get_element(sym.token());
+00170         string code = fun.c_print(argstr, vector<string>());
+00171         result = map.insert( make_pair(sym, code) ).first; // only want iterator
+00172     }
+00173     
+00174     return result;
+00175 }
+00176 
+00177 string print_code(Sym sym, HashMap& map) {
+00178     HashMap::iterator it = find_code(sym, map);
+00179     return it->second;
+00180 }
+00181 
+00182 void compile(const std::vector<Sym>& syms, std::vector<single_function>& functions) {
+00183     symc_init();
+00184     
+00185     static ostringstream os;
+00186     os.str("");
+00187     
+00188     os << make_prototypes();
+00189     HashMap map(Sym::get_dag().size());
+00190     for (unsigned i = 0; i < syms.size(); ++i) {
+00191         
+00192         os << "double func" << i << "(const double* x) { return ";
+00193         os << print_code(syms[i], map); //c_print(syms[i]);
+00194         os << ";}\n";
+00195 
+00196         //symc_compile(os.str().c_str());
+00197         //cout << "compiling " << os.str() << endl;     
+00198     }
+00199 
+00200     os << ends;
+00201 #ifdef INTERVAL_DEBUG
+00202     //cout << "Compiling " << os.str() << endl;
+00203 #endif
+00204     
+00205     symc_compile(os.str().c_str()); 
+00206     symc_link();
+00207 
+00208     functions.resize(syms.size());
+00209     for (unsigned i = 0; i < syms.size(); ++i) {
+00210         ostringstream os2;
+00211         os2 << "func" << i;
+00212         
+00213         functions[i] = (single_function) symc_get_fun(os2.str().c_str());
+00214     }
+00215 
+00216 }
+00217 
+00218 
+00219 
+
    Generated on Thu Oct 19 05:06:42 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/sym__compile_8h-source.html b/trunk/paradiseo-eo/doc/html/sym__compile_8h-source.html
new file mode 100644
index 000000000..23326cc67
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/sym__compile_8h-source.html
@@ -0,0 +1,51 @@
+
+
+EO: sym_compile.h Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+contrib / mathsym / eval
    
+
    sym_compile.h
    00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #ifndef SYMCOMPILE_H_
+00019 #define SYMCOMPILE_H_
+00020 
+00021 #include <vector>
+00022 
+00023 
+00024 typedef double (*single_function)(const double []);
+00025 typedef double (*multi_function)(const double[], double[]);
+00026 
+00027 /* 
+00028  * Important, after every call of the functions below, the function pointers of the previous
+00029  * call are invalidated. Sorry, but that's the way the cookie crumbles (in tcc)
+00030  * */
+00031 
+00032 single_function compile(Sym sym);
+00033 multi_function  compile(const std::vector<Sym>& sym);
+00034 void compile(const std::vector<Sym>& sym, std::vector<single_function>& functions);
+00035 
+00036 #endif
+
    Generated on Thu Oct 19 05:06:42 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/sym__operations_8cpp-source.html b/trunk/paradiseo-eo/doc/html/sym__operations_8cpp-source.html
new file mode 100644
index 000000000..da0985b68
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/sym__operations_8cpp-source.html
@@ -0,0 +1,189 @@
+
+
+EO: sym_operations.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+contrib / mathsym / fun
    
+
    sym_operations.cpp
    00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #include <FunDef.h>
+00019 
+00020 using namespace std;
+00021 
+00022 Sym simplify_constants(Sym sym) {
+00023 
+00024     SymVec args = sym.args();
+00025     token_t token = sym.token();
+00026     
+00027     bool has_changed = false;
+00028     bool all_constants = true;
+00029 
+00030     for (unsigned i = 0; i < args.size(); ++i) {
+00031         
+00032         Sym arg = simplify_constants(args[i]);
+00033         
+00034         if (arg != args[i]) {
+00035             has_changed = true;
+00036         }
+00037         args[i] = arg;
+00038 
+00039         all_constants &= is_constant(args[i].token());
+00040     }
+00041     
+00042     if (args.size() == 0) {
+00043         
+00044         if (sym.token() == sum_token) return SymConst(0.0);
+00045         if (sym.token() == prod_token) return SymConst(1.0);
+00046         
+00047         return sym; // variable or constant
+00048     }
+00049     
+00050     if (all_constants) {
+00051         // evaluate 
+00052         
+00053         vector<double> dummy;
+00054         
+00055         double v = ::eval(sym, dummy);
+00056         
+00057         Sym result = SymConst(v);
+00058         
+00059         return result;
+00060     }
+00061 
+00062     if (has_changed) {
+00063         return Sym(token, args);
+00064     }
+00065 
+00066     return sym;
+00067     
+00068 }
+00069 
+00070 // currently only simplifies constants
+00071 Sym simplify(Sym sym) {
+00072     
+00073     return simplify_constants(sym);
+00074     
+00075 }
+00076 
+00077 Sym derivative(token_t token, Sym x) {
+00078     Sym one = Sym(prod_token);
+00079     
+00080     switch (token) {
+00081         case inv_token : return Sym(inv_token, sqr(x));
+00082         
+00083         case sin_token : return -cos(x);
+00084         case cos_token : return sin(x);
+00085         case tan_token : return one + sqr(tan(x));
+00086                          
+00087         case asin_token : return inv( sqrt(one - sqr(x)));
+00088         case acos_token:  return -inv( sqrt(one - sqr(x)));
+00089         case atan_token : return inv( sqrt(one + sqr(x)));
+00090         
+00091         case cosh_token : return -sinh(x);
+00092         case sinh_token : return cosh(x);
+00093         case tanh_token : return one - sqr( tanh(x) );
+00094         
+00095         case asinh_token : return inv( sqrt( one + sqr(x) ));
+00096         case acosh_token : return inv( sqrt(x-one) * sqrt(x + one)  );
+00097         case atanh_token : return inv(one - sqr(x));
+00098                          
+00099         case exp_token : return exp(x);
+00100         case log_token : return inv(x);
+00101 
+00102         case sqr_token : return SymConst(2.0) * x;
+00103         case sqrt_token : return SymConst(0.5) * inv( sqrt(x));
+00104         default :
+00105             throw differentiation_error();
+00106     }
+00107     
+00108     return x;
+00109 }
+00110 
+00111 extern Sym differentiate(Sym sym, token_t dx) {
+00112     
+00113     token_t token = sym.token();
+00114     
+00115     Sym zero = Sym(sum_token);
+00116     Sym one  = Sym(prod_token);
+00117     
+00118     if (token == dx) {
+00119         return one;
+00120     }
+00121     
+00122     SymVec args = sym.args();
+00123 
+00124     if (args.size() == 0) { // df/dx with f != x
+00125         return zero;
+00126     }
+00127     
+00128     switch (token) {
+00129         
+00130         case sum_token: 
+00131             {
+00132                 for (unsigned i = 0; i < args.size(); ++i) {
+00133                     args[i] = differentiate(args[i], dx);
+00134                 }
+00135 
+00136                 if (args.size() == 1) return args[0];
+00137                 return Sym(sum_token, args);
+00138             }
+00139         case min_token : 
+00140             {
+00141                 return -differentiate(args[0],dx);
+00142             }
+00143         case prod_token: 
+00144             {
+00145                 if (args.size() == 1) return differentiate(args[0], dx);
+00146                 
+00147                 if (args.size() == 2) {
+00148                     return args[0] * differentiate(args[1], dx) + args[1] * differentiate(args[0], dx);
+00149                 }
+00150                 // else 
+00151                 Sym c = args.back();
+00152                 args.pop_back();
+00153                 Sym f = Sym(prod_token, args);
+00154                 Sym df = differentiate( f, dx);
+00155 
+00156                 return c * df + f * differentiate(c,dx);
+00157             }
+00158         case pow_token : 
+00159             {
+00160                 return pow(args[0], args[1]) * args[1] * inv(args[0]);
+00161             }
+00162         case ifltz_token : 
+00163             { // cannot be differentiated
+00164                 throw differentiation_error(); // TODO define proper exception
+00165             }
+00166             
+00167         default: // unary function: apply chain rule
+00168             {
+00169                 Sym arg = args[0];
+00170                 return derivative(token, arg) * differentiate(arg, dx);
+00171             }
+00172     }
+00173     
+00174 }
+
    Generated on Thu Oct 19 05:06:42 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/symreg_8cpp-source.html b/trunk/paradiseo-eo/doc/html/symreg_8cpp-source.html
new file mode 100644
index 000000000..ccae7b935
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/symreg_8cpp-source.html
@@ -0,0 +1,408 @@
+
+
+EO: symreg.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+contrib / mathsym
    
+
    symreg.cpp
    00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 
+00019 #include <LanguageTable.h>
+00020 #include <TreeBuilder.h>
+00021 #include <FunDef.h>
+00022 #include <Dataset.h>
+00023 
+00024 #include <eoSymInit.h>
+00025 #include <eoSym.h>
+00026 #include <eoPop.h>
+00027 #include <eoSymMutate.h>
+00028 //#include <eoSymLambdaMutate.h>
+00029 #include <eoSymCrossover.h>
+00030 #include <eoSymEval.h>
+00031 #include <eoOpContainer.h>
+00032 #include <eoDetTournamentSelect.h>
+00033 #include <eoMergeReduce.h>
+00034 #include <eoGenContinue.h>
+00035 #include <eoEasyEA.h>
+00036 #include <eoGeneralBreeder.h>
+00037 
+00038 #include <utils/eoParser.h>
+00039 #include <utils/eoCheckPoint.h>
+00040 #include <utils/eoStat.h>
+00041 #include <utils/eoStdoutMonitor.h>
+00042 #include <utils/eoRNG.h>
+00043 
+00044 using namespace std;
+00045 
+00046 typedef EoSym<eoMinimizingFitness> EoType;
+00047 
+00048 static int functions_added = 0;
+00049 
+00050 void add_function(LanguageTable& table, eoParser& parser, string name, unsigned arity, token_t token, const FunDef& fun); 
+00051 void setup_language(LanguageTable& table, eoParser& parser);
+00052 
+00053 template <class T>
+00054 T& select(bool check, T& a, T& b) { if (check) return a; return b; }
+00055 
+00056 class eoBestIndividualStat : public eoSortedStat<EoType, string> {
+00057     public: 
+00058     eoBestIndividualStat() : eoSortedStat<EoType, string>("", "best individual") {}
+00059     
+00060     void operator()(const vector<const EoType*>& _pop)  {
+00061         ostringstream os;
+00062         os << (Sym) *_pop[0];
+00063         value() = os.str();
+00064     }
+00065     
+00066 };
+00067 
+00068 class AverageSizeStat : public eoStat<EoType, double> {
+00069     public:
+00070         AverageSizeStat() : eoStat<EoType, double>(0.0, "Average size population") {}
+00071     
+00072         void operator()(const eoPop<EoType>& _pop) {
+00073             double total = 0.0;
+00074             for (unsigned i = 0; i < _pop.size(); ++i) {
+00075                 total += _pop[i].size();
+00076             }
+00077             value() = total/_pop.size();
+00078         }
+00079 };
+00080 
+00081 class SumSizeStat : public eoStat<EoType, unsigned> {
+00082     public:
+00083         SumSizeStat() : eoStat<EoType, unsigned>(0u, "Number of subtrees") {}
+00084     
+00085         void operator()(const eoPop<EoType>& _pop) {
+00086             unsigned total = 0;
+00087             for (unsigned i = 0; i < _pop.size(); ++i) {
+00088                 total += _pop[i].size();
+00089             }
+00090             value() = total;
+00091         }
+00092 };
+00093 
+00094 class DagSizeStat : public eoStat<EoType, unsigned> {
+00095     public:
+00096         DagSizeStat() : eoStat<EoType, unsigned>(0u, "Number of distinct subtrees") {}
+00097 
+00098         void operator()(const eoPop<EoType>& _pop) {
+00099             value() = Sym::get_dag().size();
+00100         }
+00101 };
+00102 
+00103 int main(int argc, char* argv[]) {
+00104    
+00105     eoParser parser(argc, argv);
+00106   
+00107     /* Language */
+00108     LanguageTable table;
+00109     setup_language(table, parser);
+00110    
+00111     /* Data */
+00112     
+00113     eoValueParam<string> datafile = parser.createParam(string(""), "datafile", "Training data", 'd', string("Regression"), true); // mandatory 
+00114     double train_percentage = parser.createParam(1.0, "trainperc", "Percentage of data used for training", 0, string("Regression")).value();
+00115     
+00116     /* Population */
+00117 
+00118     unsigned pop_size = parser.createParam(1500u, "population-size", "Population Size", 'p', string("Population")).value();
+00119   
+00120     uint32_t seed = parser.createParam( uint32_t(time(0)), "random-seed", "Seed for rng", 'D').value();
+00121 
+00122     cout << "Seed " << seed << endl;
+00123     rng.reseed(seed);
+00124     
+00125     double var_prob = parser.createParam(
+00126             0.9, 
+00127             "var-prob", 
+00128             "Probability of selecting a var vs. const when creating a terminal",
+00129             0,
+00130             "Population").value();
+00131 
+00132     
+00133     double grow_prob = parser.createParam(
+00134             0.5,
+00135             "grow-prob",
+00136             "Probability of selecting 'grow' method instead of 'full' in initialization and mutation",
+00137             0,
+00138             "Population").value();
+00139     
+00140     unsigned max_depth = parser.createParam(
+00141             8u,
+00142             "max-depth",
+00143             "Maximum depth used in initialization and mutation",
+00144             0,
+00145             "Population").value();
+00146             
+00147    
+00148     bool use_uniform = parser.createParam(
+00149             false,
+00150             "use-uniform",
+00151             "Use uniform node selection instead of bias towards internal nodes (functions)",
+00152             0,
+00153             "Population").value();
+00154             
+00155     double constant_mut_prob = parser.createParam(
+00156             0.1,
+00157             "constant-mut-rate",
+00158             "Probability of performing constant mutation",
+00159             0,
+00160             "Population").value();
+00161     
+00162     
+00163     double subtree_mut_prob = parser.createParam(
+00164             0.2,
+00165             "subtree-mut-rate",
+00166             "Probability of performing subtree mutation",
+00167             0,
+00168             "Population").value();
+00169     
+00170     double node_mut_prob = parser.createParam(
+00171             0.2,
+00172             "node-mut-rate",
+00173             "Probability of performing node mutation",
+00174             0,
+00175             "Population").value();
+00176     
+00177 /*    double lambda_mut_prob = parser.createParam(
+00178             1.0,
+00179             "lambda-mut-rate",
+00180             "Probability of performing (neutral) lambda extraction/expansion",
+00181             0,
+00182             "Population").value();
+00183 */
+00184     double subtree_xover_prob = parser.createParam(
+00185             0.4,
+00186             "xover-rate",
+00187             "Probability of performing subtree crossover",
+00188             0,
+00189             "Population").value();
+00190 
+00191     double homologous_prob = parser.createParam(
+00192             0.4,
+00193             "homologous-rate",
+00194             "Probability of performing homologous crossover",
+00195             0,
+00196             "Population").value();
+00197 
+00198     unsigned max_gens = parser.createParam(
+00199             50,
+00200             "max-gens",
+00201             "Maximum number of generations to run",
+00202             'g',
+00203             "Population").value();
+00204     
+00205     unsigned tournamentsize = parser.createParam(
+00206             5,
+00207             "tournament-size",
+00208             "Tournament size used for selection",
+00209             't',
+00210             "Population").value();
+00211 
+00212     unsigned maximumSize = parser.createParam(
+00213             -1u,
+00214             "maximum-size",
+00215             "Maximum size after crossover",
+00216             's',
+00217             "Population").value();
+00218     
+00219     unsigned meas_param = parser.createParam(
+00220             2u,
+00221             "measure",
+00222             "Error measure:\n\
+00223                 0 -> absolute error\n\
+00224                 1 -> mean squared error\n\
+00225                 2 -> mean squared error scaled (equivalent with correlation)\n\
+00226                 ",
+00227                 'm',
+00228                 "Regression").value();
+00229   
+00230     
+00231     ErrorMeasure::measure meas = ErrorMeasure::mean_squared_scaled;
+00232     if (meas_param == 0) meas = ErrorMeasure::absolute;
+00233     if (meas_param == 1) meas = ErrorMeasure::mean_squared;
+00234 
+00235     
+00236     /* End parsing */
+00237     if (parser.userNeedsHelp())
+00238     {
+00239         parser.printHelp(std::cout);
+00240         return 1;
+00241     }
+00242     
+00243     if (functions_added == 0) {
+00244         cout << "ERROR: no functions defined" << endl;
+00245         exit(1);
+00246     }
+00247     
+00248     
+00249     Dataset dataset;
+00250     dataset.load_data(datafile.value());
+00251     
+00252     cout << "Data " << datafile.value() << " loaded " << endl;
+00253    
+00254     /* Add Variables */
+00255     unsigned nvars = dataset.n_fields();
+00256     for (unsigned i = 0; i < nvars; ++i) {
+00257         table.add_function( SymVar(i).token(), 0);
+00258     }
+00259     
+00260     TreeBuilder builder(table, var_prob);
+00261     eoSymInit<EoType> init(builder, grow_prob, max_depth);
+00262     
+00263     eoPop<EoType> pop(pop_size, init);
+00264     
+00265     BiasedNodeSelector biased_sel;
+00266     RandomNodeSelector random_sel;
+00267 
+00268     NodeSelector& node_selector = select<NodeSelector>(use_uniform, random_sel, biased_sel);
+00269     
+00270     //eoProportionalOp<EoType> genetic_operator;
+00271     eoSequentialOp<EoType> genetic_operator;
+00272     
+00273     eoSymSubtreeMutate<EoType> submutate(builder, node_selector);
+00274     genetic_operator.add( submutate, subtree_mut_prob);
+00275    
+00276     // todo, make this parameter, etc
+00277     double std = 0.01;
+00278     eoSymConstantMutate<EoType> constmutate(std);
+00279     genetic_operator.add(constmutate, constant_mut_prob);
+00280     
+00281     eoSymNodeMutate<EoType>    nodemutate(table);
+00282     genetic_operator.add(nodemutate, node_mut_prob);
+00283    
+00284 //    eoSymLambdaMutate<EoType> lambda_mutate(node_selector);
+00285 //    genetic_operator.add(lambda_mutate, lambda_mut_prob); // TODO: prob should be settable
+00286     
+00287     //eoQuadSubtreeCrossover<EoType> quad(node_selector);
+00288     eoBinSubtreeCrossover<EoType> bin(node_selector);
+00289     genetic_operator.add(bin, subtree_xover_prob);
+00290     
+00291     eoBinHomologousCrossover<EoType> hom;
+00292     genetic_operator.add(hom, homologous_prob);
+00293 
+00294 
+00295     IntervalBoundsCheck check(dataset.input_minima(), dataset.input_maxima());
+00296     ErrorMeasure measure(dataset, train_percentage, meas);
+00297 
+00298     eoSymPopEval<EoType> evaluator(check, measure, maximumSize);
+00299     
+00300     eoDetTournamentSelect<EoType> selectOne(tournamentsize);
+00301     eoGeneralBreeder<EoType> breeder(selectOne, genetic_operator);
+00302     eoPlusReplacement<EoType> replace;
+00303 
+00304     // Terminators
+00305     eoGenContinue<EoType> term(max_gens);
+00306     eoCheckPoint<EoType> checkpoint(term);
+00307     
+00308     eoBestFitnessStat<EoType> beststat;
+00309     checkpoint.add(beststat);
+00310    
+00311     eoBestIndividualStat printer;
+00312     AverageSizeStat avgSize;
+00313     DagSizeStat dagSize;
+00314     SumSizeStat sumSize;
+00315     
+00316     checkpoint.add(printer);
+00317     checkpoint.add(avgSize);
+00318     checkpoint.add(dagSize);
+00319     checkpoint.add(sumSize);
+00320     
+00321     eoStdoutMonitor genmon;
+00322     genmon.add(beststat);
+00323     genmon.add(printer);
+00324     genmon.add(avgSize);
+00325     genmon.add(dagSize);
+00326     genmon.add(sumSize);
+00327     genmon.add(term); // add generation counter
+00328     
+00329     checkpoint.add(genmon);
+00330     
+00331     eoPop<EoType> dummy;
+00332     evaluator(pop, dummy);
+00333     
+00334     eoEasyEA<EoType> ea(checkpoint, evaluator, breeder, replace);
+00335 
+00336     ea(pop); // run
+00337     
+00338 }
+00339 
+00340 void add_function(LanguageTable& table, eoParser& parser, string name, unsigned arity, token_t token, const FunDef& fun, bool all) {
+00341     ostringstream desc;
+00342     desc << "Enable function " << name << " arity = " << arity;
+00343     bool enabled = parser.createParam(false, name, desc.str(), 0, "Language").value();
+00344     
+00345     if (enabled || all) {
+00346         cout << "Func " << name << " enabled" << endl;
+00347         table.add_function(token, arity);
+00348         if (arity > 0) functions_added++;
+00349     }
+00350 }
+00351 
+00352 void setup_language(LanguageTable& table, eoParser& parser) {
+00353 
+00354     bool all = parser.createParam(false,"all", "Enable all functions").value();
+00355     bool ratio = parser.createParam(false,"ratio","Enable rational functions (inv,min,sum,prod)").value();
+00356     bool poly = parser.createParam(false,"poly","Enable polynomial functions (min,sum,prod)").value();
+00357     
+00358     // assumes that at this point all tokens are defined (none are zeroed out, which can happen with ERCs)
+00359     vector<const FunDef*> lang = get_defined_functions(); 
+00360     
+00361     for (token_t i = 0; i < lang.size(); ++i) {
+00362         
+00363         if (lang[i] == 0) continue;
+00364         
+00365         bool is_poly = false;
+00366         if (poly && (i == prod_token || i == sum_token || i == min_token) ) {
+00367             is_poly = true;
+00368         }
+00369         
+00370         bool is_ratio = false;
+00371         if (ratio && (is_poly || i == inv_token)) {
+00372             is_ratio = true;
+00373         }
+00374         
+00375         const FunDef& fun = *lang[i]; 
+00376         
+00377         if (fun.has_varargs() ) {
+00378 
+00379             for (unsigned j = fun.min_arity(); j < fun.min_arity() + 8; ++j) {
+00380                 if (j==1) continue; // prod 1 and sum 1 are useless
+00381                 ostringstream nm;
+00382                 nm << fun.name() << j;
+00383                 bool addanyway = (all || is_ratio || is_poly) && j == 2;
+00384                 add_function(table, parser, nm.str(), j, i, fun, addanyway);
+00385             }
+00386         }
+00387         else {
+00388             add_function(table, parser, fun.name(), fun.min_arity(), i, fun, all || is_ratio || is_poly);
+00389         }
+00390     }
+00391 }
+00392 
+00393 
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-_m_g_e-control_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-_m_g_e-control_8cpp-source.html
new file mode 100644
index 000000000..fade2a573
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-_m_g_e-control_8cpp-source.html
@@ -0,0 +1,119 @@
+
+
+EO: t-MGE-control.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-MGE-control.cpp
    00001 //-----------------------------------------------------------------------------
+00002 // t-eoMGE.cpp
+00003 //-----------------------------------------------------------------------------
+00004 
+00005 #ifdef HAVE_CONFIG_H
+00006 #include <config.h>
+00007 #endif
+00008 
+00009 #ifndef __GNUG__
+00010 // to avoid long name warnings
+00011 #pragma warning(disable:4786)
+00012 #endif // __GNUG__
+00013 
+00014 #include "eo"
+00015 #include "ga/eoBitOp.h"
+00016 
+00017 #include "RoyalRoad.h"
+00018 
+00019 // Viri
+00020 #include "VirusOp.h"
+00021 #include "eoVirus.h"
+00022 #include "eoInitVirus.h"
+00023 
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 typedef eoVirus<float> Chrom;
+00027 
+00028 //-----------------------------------------------------------------------------
+00029 
+00030 int main()
+00031 {
+00032   const unsigned POP_SIZE = 10, CHROM_SIZE = 12;
+00033   unsigned i;
+00034   eoBooleanGenerator gen;
+00035 
+00036   // the populations:
+00037   eoPop<Chrom> pop;
+00038 
+00039   // Evaluation
+00040   RoyalRoad<Chrom> rr( 8 );
+00041   eoEvalFuncCounter<Chrom> eval( rr );
+00042 
+00043   eoInitVirus<float> random(CHROM_SIZE, gen);
+00044   for (i = 0; i < POP_SIZE; ++i) {
+00045       Chrom chrom;
+00046       random(chrom);
+00047       eval(chrom);
+00048       pop.push_back(chrom);
+00049   }
+00050 
+00051   std::cout << "population:" << std::endl;
+00052   for (i = 0; i < pop.size(); ++i)
+00053     std::cout << "\t" << pop[i] << " " << pop[i].fitness() << std::endl;
+00054 
+00055   // selection
+00056   eoStochTournamentSelect<Chrom> lottery(0.9 );
+00057 
+00058   // breeder
+00059   eoOneBitFlip<Chrom> vm;
+00060   eoUBitXover<Chrom> xover;
+00061   eoProportionalOp<Chrom> propSel;
+00062   eoGeneralBreeder<Chrom> breeder( lottery, propSel );
+00063   propSel.add(vm, 0.2);
+00064   propSel.add(xover, 0.8);
+00065 
+00066   // Replace a single one
+00067   eoCommaReplacement<Chrom> replace;
+00068 
+00069   // Terminators
+00070   eoGenContinue<Chrom> continuator1(10);
+00071   eoFitContinue<Chrom> continuator2(CHROM_SIZE);
+00072   eoCombinedContinue<Chrom> continuator(continuator1, continuator2);
+00073   eoCheckPoint<Chrom> checkpoint(continuator);
+00074   eoStdoutMonitor monitor;
+00075   checkpoint.add(monitor);
+00076   eoSecondMomentStats<Chrom> stats;
+00077   eoPopStat<Chrom> dumper( 10 );
+00078   monitor.add(stats);
+00079   checkpoint.add(dumper);
+00080   checkpoint.add(stats);
+00081 
+00082   // GA generation
+00083   eoEasyEA<Chrom> ea(checkpoint, eval,  breeder, replace );
+00084 
+00085   // evolution
+00086   try
+00087     {
+00088       ea(pop);
+00089     }
+00090   catch (std::exception& e)
+00091     {
+00092         std::cout << "exception: " << e.what() << std::endl;;
+00093         exit(EXIT_FAILURE);
+00094     }
+00095 
+00096   std::cout << "pop" << std::endl;
+00097   for (i = 0; i < pop.size(); ++i)
+00098     std::cout << "\t" <<  pop[i] << " " << pop[i].fitness() << std::endl;
+00099 
+00100   std::cout << "\n --> Number of Evaluations = " << eval.getValue() << std::endl;
+00101   return 0;
+00102 }
+00103 
+00104 //-----------------------------------------------------------------------------
+
    Generated on Thu Oct 19 05:06:44 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-_m_g_e1bit_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-_m_g_e1bit_8cpp-source.html
new file mode 100644
index 000000000..4bb787df7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-_m_g_e1bit_8cpp-source.html
@@ -0,0 +1,126 @@
+
+
+EO: t-MGE1bit.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-MGE1bit.cpp
    00001 //-----------------------------------------------------------------------------
+00002 // t-eoMGE.cpp
+00003 //-----------------------------------------------------------------------------
+00004 
+00005 #ifdef HAVE_CONFIG_H
+00006 #include <config.h>
+00007 #endif
+00008 
+00009 #ifndef __GNUG__
+00010 // to avoid long name warnings
+00011 #pragma warning(disable:4786)
+00012 #endif // __GNUG__
+00013 
+00014 #include "eo"
+00015 #include "ga/eoBitOp.h"
+00016 #include "RoyalRoad.h"
+00017 
+00018 // Viri
+00019 #include "VirusOp.h"
+00020 #include "eoVirus.h"
+00021 #include "eoInitVirus.h"
+00022 
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 typedef eoVirus<float> Chrom;
+00026 
+00027 //-----------------------------------------------------------------------------
+00028 
+00029 int main()
+00030 {
+00031   const unsigned POP_SIZE = 10, CHROM_SIZE = 12;
+00032   unsigned i;
+00033   eoBooleanGenerator gen;
+00034 
+00035   // the populations:
+00036   eoPop<Chrom> pop;
+00037 
+00038   // Evaluation
+00039   RoyalRoad<Chrom> rr( 8 );
+00040   eoEvalFuncCounter<Chrom> eval( rr );
+00041 
+00042   eoInitVirus1bit<float> random(CHROM_SIZE, gen);
+00043   for (i = 0; i < POP_SIZE; ++i) {
+00044       Chrom chrom;
+00045       random(chrom);
+00046       eval(chrom);
+00047       pop.push_back(chrom);
+00048   }
+00049 
+00050   std::cout << "population:" << std::endl;
+00051   for (i = 0; i < pop.size(); ++i)
+00052     std::cout << "\t" << pop[i] << " " << pop[i].fitness() << std::endl;
+00053 
+00054   // selection
+00055   eoStochTournamentSelect<Chrom> lottery(0.9 );
+00056 
+00057   // breeder
+00058   VirusShiftMutation<float> vm;
+00059   VirusTransmission<float> vt;
+00060   VirusBitFlip<float> vf;
+00061   eoUBitXover<Chrom> xover;
+00062   eoProportionalOp<Chrom> propSel;
+00063   eoGeneralBreeder<Chrom> breeder( lottery, propSel );
+00064   propSel.add(vm, 0.8);
+00065   propSel.add(vf, 0.05);
+00066   propSel.add(vt, 0.05);
+00067   propSel.add(xover, 0.1);
+00068 
+00069   // Replace a single one
+00070   eoCommaReplacement<Chrom> replace;
+00071 
+00072   // Terminators
+00073   eoGenContinue<Chrom> continuator1(10);
+00074   eoFitContinue<Chrom> continuator2(CHROM_SIZE);
+00075   eoCombinedContinue<Chrom> continuator(continuator1, continuator2);
+00076   eoCheckPoint<Chrom> checkpoint(continuator);
+00077   eoStdoutMonitor monitor;
+00078   checkpoint.add(monitor);
+00079   eoSecondMomentStats<Chrom> stats;
+00080   eoPopStat<Chrom> dumper( 10 );
+00081   monitor.add(stats);
+00082   checkpoint.add(dumper);
+00083   checkpoint.add(stats);
+00084 
+00085   // GA generation
+00086   eoEasyEA<Chrom> ea(checkpoint, eval, breeder, replace);
+00087 
+00088   // evolution
+00089   try {
+00090       ea(pop);
+00091   } catch (std::exception& e) {
+00092       std::cerr << "exception: " << e.what() << std::endl;;
+00093       exit(EXIT_FAILURE);
+00094   }
+00095 
+00096   std::cout << "pop" << std::endl;
+00097   for (i = 0; i < pop.size(); ++i)
+00098       std::cout << "\t" <<  pop[i] << " " << pop[i].fitness() << std::endl;
+00099 
+00100   std::cout << "\n --> Number of Evaluations = " << eval.getValue() << std::endl;
+00101   return EXIT_SUCCESS;
+00102 }
+00103 
+00104 //-----------------------------------------------------------------------------
+00105 
+00106 
+00107 
+00108 // Local Variables:
+00109 // mode: C++
+00110 // c-file-style: "Stroustrup"
+00111 // End:
+
    Generated on Thu Oct 19 05:06:44 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-_m_g_e_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-_m_g_e_8cpp-source.html
new file mode 100644
index 000000000..a1c1edb30
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-_m_g_e_8cpp-source.html
@@ -0,0 +1,123 @@
+
+
+EO: t-MGE.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-MGE.cpp
    00001 //-----------------------------------------------------------------------------
+00002 // t-eoMGE.cpp
+00003 //-----------------------------------------------------------------------------
+00004 
+00005 #ifdef HAVE_CONFIG_H
+00006 #include <config.h>
+00007 #endif
+00008 
+00009 #ifndef __GNUG__
+00010 // to avoid long name warnings
+00011 #pragma warning(disable:4786)
+00012 #endif // __GNUG__
+00013 
+00014 #include <eo>
+00015 #include <ga/eoBitOp.h>
+00016 
+00017 #include "RoyalRoad.h"
+00018 
+00019 // Viri
+00020 #include "VirusOp.h"
+00021 #include "eoVirus.h"
+00022 #include "eoInitVirus.h"
+00023 
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 typedef eoVirus<float> Chrom;
+00027 
+00028 //-----------------------------------------------------------------------------
+00029 
+00030 int main()
+00031 {
+00032   const unsigned POP_SIZE = 10, CHROM_SIZE = 12;
+00033   unsigned i;
+00034   eoBooleanGenerator gen;
+00035 
+00036   // the populations:
+00037   eoPop<Chrom> pop;
+00038 
+00039   // Evaluation
+00040   RoyalRoad<Chrom> rr( 8 );
+00041   eoEvalFuncCounter<Chrom> eval( rr );
+00042 
+00043   eoInitVirus<float> random(CHROM_SIZE, gen);
+00044   for (i = 0; i < POP_SIZE; ++i) {
+00045       Chrom chrom;
+00046       random(chrom);
+00047       eval(chrom);
+00048       pop.push_back(chrom);
+00049   }
+00050 
+00051   std::cout << "population:" << std::endl;
+00052   for (i = 0; i < pop.size(); ++i)
+00053     std::cout << "\t" << pop[i] << " " << pop[i].fitness() << std::endl;
+00054 
+00055   // selection
+00056   eoStochTournamentSelect<Chrom> lottery(0.9 );
+00057 
+00058   // breeder
+00059   VirusMutation<float> vm;
+00060   VirusTransmission<float> vt;
+00061   VirusBitFlip<float> vf;
+00062   eoUBitXover<Chrom> xover;
+00063   eoProportionalOp<Chrom> propSel;
+00064   eoGeneralBreeder<Chrom> breeder( lottery, propSel );
+00065   propSel.add(vm, 0.1);
+00066   propSel.add(vf, 0.05);
+00067   propSel.add(vt, 0.05);
+00068   propSel.add(xover, 0.8);
+00069 
+00070   // Replace a single one
+00071   eoCommaReplacement<Chrom> replace;
+00072 
+00073   // Terminators
+00074   eoGenContinue<Chrom> continuator1(10);
+00075   eoFitContinue<Chrom> continuator2(CHROM_SIZE);
+00076   eoCombinedContinue<Chrom> continuator(continuator1, continuator2);
+00077   eoCheckPoint<Chrom> checkpoint(continuator);
+00078   eoStdoutMonitor monitor;
+00079   checkpoint.add(monitor);
+00080   eoSecondMomentStats<Chrom> stats;
+00081   eoPopStat<Chrom> dumper( 10 );
+00082   monitor.add(stats);
+00083   checkpoint.add(dumper);
+00084   checkpoint.add(stats);
+00085 
+00086   // GA generation
+00087   eoEasyEA<Chrom> ea(checkpoint, eval,  breeder, replace );
+00088 
+00089   // evolution
+00090   try
+00091     {
+00092       ea(pop);
+00093     }
+00094   catch (std::exception& e)
+00095     {
+00096         std::cout << "exception: " << e.what() << std::endl;;
+00097         exit(EXIT_FAILURE);
+00098     }
+00099 
+00100   std::cout << "pop" << std::endl;
+00101   for (i = 0; i < pop.size(); ++i)
+00102     std::cout << "\t" <<  pop[i] << " " << pop[i].fitness() << std::endl;
+00103 
+00104   std::cout << "\n --> Number of Evaluations = " << eval.getValue() << std::endl;
+00105   return 0;
+00106 }
+00107 
+00108 //-----------------------------------------------------------------------------
+
    Generated on Thu Oct 19 05:06:44 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_8cpp-source.html
new file mode 100644
index 000000000..80c96de2c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_8cpp-source.html
@@ -0,0 +1,38 @@
+
+
+EO: t-eo.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eo.cpp
    00001 //-----------------------------------------------------------------------------
+00002 // t-eo.cpp
+00003 //-----------------------------------------------------------------------------
+00004 
+00005 #include <eo>  // EO
+00006 
+00007 //-----------------------------------------------------------------------------
+00008 
+00009 typedef EO<float> Chrom;
+00010 
+00011 //-----------------------------------------------------------------------------
+00012 
+00013 int main()
+00014 {
+00015   Chrom chrom1, chrom2;
+00016 
+00017   std::cout << "chrom1 = " << chrom1 << std::endl
+00018        << "chrom2 = " << chrom2 << std::endl;
+00019 
+00020   return 0;
+00021 }
+00022 
+00023 //-----------------------------------------------------------------------------
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_atom_ops_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_atom_ops_8cpp-source.html
new file mode 100644
index 000000000..192cc71ff
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_atom_ops_8cpp-source.html
@@ -0,0 +1,81 @@
+
+
+EO: t-eoAtomOps.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoAtomOps.cpp
    00001 /* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003     t-eoAtomOps.cpp
+00004       Program that tests the atomic operator classes
+00005 
+00006     (c) GeNeura Team, 1999 
+00007  
+00008     This program is free software; you can redistribute it and/or modify
+00009     it under the terms of the GNU General Public License as published by
+00010     the Free Software Foundation; either version 2 of the License, or
+00011     (at your option) any later version.
+00012 
+00013     This program is distributed in the hope that it will be useful,
+00014     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00015     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00016     GNU General Public License for more details.
+00017 
+00018     You should have received a copy of the GNU General Public License
+00019     along with this program; if not, write to the Free Software
+00020     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00021  
+00022     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00023             
+00024 */
+00025 
+00026 //-----------------------------------------------------------------------------// 
+00027 
+00028 #ifdef _MSC_VER
+00029 #pragma warning(disable:4786)
+00030 #endif 
+00031 
+00032 #include <string>
+00033 #include <iostream>
+00034 #include <iterator>
+00035 
+00036 using namespace std;
+00037 
+00038 // Operators we are going to test
+00039 #include <eoAtomCreep.h>
+00040 #include <eoAtomBitFlip.h>
+00041 #include <eoAtomRandom.h>
+00042 #include <eoAtomMutation.h>
+00043 
+00044 // Several EOs
+00045 #include <other/eoString.h>
+00046 
+00047 // RNGs
+00048 #include <eoNegExp.h>
+00049 
+00050 main(int argc, char *argv[]) {
+00051   eoString<float> aString("123456");
+00052   eoAtomCreep<char> creeper;
+00053   eoAtomMutation< eoString<float> > mutator( creeper, 0.5 );
+00054 
+00055   eoNegExp<char> charNE( 2 );
+00056   eoAtomRandom<char> randomer( charNE );
+00057   eoAtomMutation<  eoString<float> > mutator2 ( randomer, 0.5 );
+00058 
+00059   std::cout << "Before aString " << aString << std::endl;
+00060   mutator( aString);
+00061   std::cout << " after mutator " << aString << std::endl;
+00062   mutator2( aString);
+00063   std::cout << " after mutator2 " << aString << std::endl;;
+00064   return 0; // to avoid VC++ complaints
+00065 }
+00066 
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_base_functions_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_base_functions_8cpp-source.html
new file mode 100644
index 000000000..f6ee4c79c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_base_functions_8cpp-source.html
@@ -0,0 +1,41 @@
+
+
+EO: t-eoBaseFunctions.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoBaseFunctions.cpp
    00001 
+00002 #include <eoBaseFunctions.h>
+00003 
+00004 #include <iostream>
+00005 
+00006 using namespace std;
+00007 
+00008 struct eo1 : public eoF<void>
+00009 {
+00010     void operator()(void) {}
+00011 };
+00012 
+00013 struct eo2 : public eoF<int>
+00014 {
+00015     int operator()(void) { return 1; }
+00016 };
+00017 
+00018 int main()
+00019 {
+00020     eo1 _1; _1();
+00021     eo2 _2; 
+00022     int i = _2();
+00023 
+00024     std::cout << i << '\n';
+00025     return i;
+00026 }
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_c_m_a_e_s_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_c_m_a_e_s_8cpp-source.html
new file mode 100644
index 000000000..19e5b2bac
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_c_m_a_e_s_8cpp-source.html
@@ -0,0 +1,143 @@
+
+
+EO: t-eoCMAES.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoCMAES.cpp
    00001 
+00002 #include <iostream>
+00003 
+00004 #include <eoScalarFitness.h>
+00005 #include <eoVector.h>
+00006 #include <eoPop.h>
+00007 #include <utils/eoParser.h>
+00008 #include <utils/eoCheckPoint.h>
+00009 #include <eoEvalFuncPtr.h>
+00010 
+00011 #include <eoGenContinue.h>
+00012 #include <eoFitContinue.h>
+00013 #include <utils/eoStdoutMonitor.h>
+00014 #include <utils/eoStat.h>
+00015 #include <utils/eoTimedMonitor.h>
+00016 
+00017 #include <eoMergeReduce.h>
+00018 #include <eoEasyEA.h>
+00019 
+00020 #include <es/CMAState.h>
+00021 #include <es/CMAParams.h>
+00022 #include <es/eoCMAInit.h>
+00023 #include <es/eoCMABreed.h>
+00024 
+00025 using namespace eo;
+00026 using namespace std;
+00027 
+00028 typedef eoMinimizingFitness FitT;
+00029 typedef eoVector<FitT, double> EoType;
+00030 
+00031 double sqr(double x) { return x*x; }
+00032 
+00033 eoValueParam<int> evals(0,"Function Evals","Number of Evaluations");
+00034 
+00035 double f_sphere(const vector<double>& values) {
+00036     double sum = 0.0;
+00037     for (unsigned i = 0; i < values.size(); ++i) {
+00038         sum += values[i] * values[i];
+00039     }
+00040     ++evals.value();
+00041     return sum;
+00042 }
+00043 
+00044 double f_rosen(const vector<double>& x) {
+00045     double sum =0.0;
+00046     
+00047     for (int i = 0; i < x.size()-1; ++i) {
+00048         sum += 100 * sqr(sqr(x[i])-x[i+1]) + sqr(1.-x[i]);
+00049     }
+00050     ++evals.value();
+00051     return sum;
+00052 }
+00053 
+00054 
+00055 
+00056 int main(int argc, char* argv[]) {
+00057     
+00058     // make sure we have a dimensionality parameter (for testing) 
+00059     char** rargv = new char*[argc+1];
+00060     rargv[0] = argv[0];
+00061     rargv[1] = "-N10";
+00062     for (int i = 2; i < argc; ++i) {
+00063         rargv[i] = argv[i-1];
+00064     }
+00065     
+00066     eoParser parser(argc+1, rargv);
+00067     
+00068     CMAParams params(parser);
+00069 
+00070     vector<double> initial_point(params.n, 0.0);
+00071     
+00072     CMAState state(params, initial_point);
+00073     
+00074     if (parser.userNeedsHelp())
+00075     {
+00076         parser.printHelp(std::cout);
+00077         return 1;
+00078     }
+00079 
+00080     eoCMAInit<FitT> init(state);
+00081     
+00082     eoPop<EoType> pop(params.mu, init);
+00083     
+00084     eoEvalFuncPtr<EoType, double, const vector<double>&> eval(  f_rosen );
+00085     
+00086     eoCMABreed<FitT> breed(state, params.lambda);
+00087 
+00088     for (unsigned i = 0; i < pop.size(); ++i) {
+00089         eval(pop[i]);
+00090     }
+00091     
+00092     eoCommaReplacement<EoType> comma;
+00093      
+00094     eoGenContinue<EoType> gen(params.maxgen);
+00095     eoFitContinue<EoType> fit(1e-10);
+00096 
+00097     eoCheckPoint<EoType> checkpoint(gen);
+00098     checkpoint.add(fit);
+00099    
+00100     eoBestFitnessStat<EoType> stat;
+00101 
+00102     eoStdoutMonitor mon;
+00103     mon.add(stat);
+00104     mon.add(evals);
+00105     
+00106     eoTimedMonitor timed(1);// 1 seconds
+00107     timed.add(mon); // wrap it
+00108     
+00109     checkpoint.add(timed);
+00110     checkpoint.add(stat);
+00111     
+00112     eoEasyEA<EoType> algo(
+00113             checkpoint,
+00114             eval,
+00115             breed,
+00116             comma);
+00117     
+00118     
+00119     algo(pop);
+00120     pop.sort();
+00121     
+00122     cout << pop[0] << endl; 
+00123     cout << "Fitness achieved = " << pop[0].fitness() << endl;
+00124     cout << "Function evaluations = " << evals.value() << endl;
+00125 }
+00126 
+00127 
+00128 
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_checkpointing_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_checkpointing_8cpp-source.html
new file mode 100644
index 000000000..09fd38a7e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_checkpointing_8cpp-source.html
@@ -0,0 +1,198 @@
+
+
+EO: t-eoCheckpointing.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoCheckpointing.cpp
    00001 //-----------------------------------------------------------------------------
+00002 
+00003 // to avoid long name warnings
+00004 #ifdef _MSC_VER
+00005 #pragma warning(disable:4786)
+00006 #endif
+00007 
+00008 #include <stdexcept>  // runtime_error
+00009 
+00010 //-----------------------------------------------------------------------------
+00011 // tt.cpp:
+00012 //
+00013 //-----------------------------------------------------------------------------
+00014 
+00015 
+00016 // general
+00017 #include <utils/eoRNG.h>                // Random number generators
+00018 #include <ga.h>
+00019 #include <utils/eoParser.h>
+00020 #include <utils/eoState.h>
+00021 #include <eoGenContinue.h>
+00022 //-----------------------------------------------------------------------------
+00023 
+00024 // include package checkpointing
+00025 #include <utils/checkpointing>
+00026 
+00027 struct Dummy : public EO<double>
+00028 {
+00029     typedef double Type;
+00030 };
+00031 
+00032 
+00033 struct eoDummyPop : public eoPop<Dummy>
+00034 {
+00035 public :
+00036     eoDummyPop(int s = 2) { resize(s); }
+00037 };
+00038 
+00039 //-----------------------------------------------------------------------------
+00040 
+00041 int the_main(int argc, char **argv)
+00042 { // ok, we have a command line parser and a state
+00043 
+00044     typedef eoBit<float> Chrom;
+00045 
+00046     eoParser parser(argc, argv);
+00047 
+00048     // Define Parameters
+00049     eoValueParam<double> rate(0.01, "mutationRatePerBit", "Initial value for mutation rate per bit");
+00050     eoValueParam<double> factor(0.99, "mutationFactor", "Decrease factor for mutation rate");
+00051     eoValueParam<uint32_t> seed(time(0), "seed", "Random number seed");
+00052     eoValueParam<std::string> load_name("", "Load","Load",'L');
+00053     eoValueParam<std::string> save_name("", "Save","Save",'S');
+00054 
+00055     // Register them
+00056     parser.processParam(rate,       "Genetic Operators");
+00057     parser.processParam(factor,     "Genetic Operators");
+00058     parser.processParam(load_name,  "Persistence");
+00059     parser.processParam(save_name,  "Persistence");
+00060     parser.processParam(seed,       "Rng seeding");
+00061 
+00062    eoState state;
+00063    state.registerObject(parser);
+00064 
+00065    if (load_name.value() != "")
+00066    { // load the parser. This is only neccessary when the user wants to
+00067      // be able to change the parameters in the state file by hand.
+00068        state.load(load_name.value()); // load the parser
+00069    }
+00070 
+00071     // Create the algorithm here
+00072     typedef Dummy EoType;
+00073 
+00074     eoDummyPop pop;
+00075 
+00076     eoGenContinue<EoType> genTerm(5); // run for 5 generations
+00077 
+00078     eoCheckPoint<EoType> checkpoint(genTerm);
+00079     // The algorithm will now quit after five generations
+00080 
+00081     // Create a counter parameter
+00082     eoValueParam<unsigned> generationCounter(0, "Generation");
+00083 
+00084     // Create an incrementor (wich is an eoUpdater). Note that the
+00085     // Parameter's value is passed by reference, so every time the incrementer increments,
+00086     // the data in generationCounter will change.
+00087     eoIncrementor<unsigned> increment(generationCounter.value());
+00088 
+00089     // Add it to the checkpoint, this will result in the counter being incremented every generation
+00090     checkpoint.add(increment);
+00091 
+00092     // The file monitor will print parameters to a comma seperated file
+00093     eoFileMonitor monitor("monitor.csv");
+00094 
+00095     // the checkpoint mechanism can handle multiple monitors
+00096     checkpoint.add(monitor);
+00097 
+00098     // the monitor can monitor parameters such as the generationCounter
+00099     monitor.add(generationCounter);
+00100 
+00101     // Second moment stats: average and stdev
+00102     eoSecondMomentStats<EoType> stats;
+00103 
+00104     // Add it to the checkpoint to get it called at the appropriate time
+00105     checkpoint.add(stats);
+00106 
+00107     // Add it to the monitor to get it written to the file
+00108     monitor.add(stats);
+00109 
+00110     // save state every third generation
+00111     eoCountedStateSaver stateSaver1(3, state, "generation");
+00112     // save state every 2 seconds
+00113     eoTimedStateSaver   stateSaver2(2, state, "time");
+00114 
+00115     // And add the two savers to the checkpoint
+00116     checkpoint.add(stateSaver1);
+00117     checkpoint.add(stateSaver2);
+00118 
+00119     // Register the algorithm
+00120     state.registerObject(rng);
+00121     state.registerObject(pop);
+00122 
+00123     if (parser.userNeedsHelp())
+00124     {
+00125         parser.printHelp(std::cout);
+00126         return 0;
+00127     }
+00128 
+00129     // Either load or initialize
+00130     if (load_name.value() != "")
+00131     {
+00132         state.load(load_name.value()); // load the rest
+00133     }
+00134     else
+00135     {
+00136         // else
+00137 
+00138         // initialize rng and population
+00139 
+00140         rng.reseed(seed.value());
+00141 
+00142         pop.resize(2);
+00143 
+00144         pop[0].fitness(1);
+00145         pop[1].fitness(2);
+00146     }
+00147 
+00148     while(checkpoint(pop))
+00149     {
+00150         pop[0].fitness(pop[0].fitness() + 1);
+00151 
+00152         time_t now = time(0);
+00153 
+00154         while (time(0) == now) {} // wait a second to test timed saver
+00155 
+00156         std::cout << "gen " << generationCounter.value() << std::endl;
+00157     }
+00158 
+00159     // run the algorithm
+00160 
+00161     // Save when needed
+00162     if (save_name.value() != "")
+00163     {
+00164         std::string file_name = save_name.value();
+00165         save_name.value() = ""; // so that it does not appear in the parser section of the state file
+00166         state.save(file_name);
+00167     }
+00168 
+00169     return 1;
+00170 }
+00171 
+00172 int main(int argc, char **argv)
+00173 {
+00174     try
+00175     {
+00176         the_main(argc, argv);
+00177     }
+00178     catch(std::exception& e)
+00179     {
+00180         std::cout << "Exception: " << e.what() << std::endl;
+00181     }
+00182 
+00183 }
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_e_s_all_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_e_s_all_8cpp-source.html
new file mode 100644
index 000000000..f88ccdc1d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_e_s_all_8cpp-source.html
@@ -0,0 +1,151 @@
+
+
+EO: t-eoESAll.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoESAll.cpp
    00001 // Program to test several EO-ES features
+00002 
+00003 #ifdef _MSC_VER
+00004 #pragma warning(disable:4786)
+00005 #endif
+00006 
+00007 #include <algorithm>
+00008 #include <string>
+00009 #include <iostream>
+00010 #include <iterator>
+00011 #include <stdexcept>
+00012 #include <ctime>
+00013 
+00014 #ifdef _MSC_VER
+00015   #include <crtdbg.h>
+00016 #endif
+00017 
+00018 using namespace std;
+00019 
+00020 #include <eo>
+00021 
+00022 // representation specific
+00023 #include <es/make_es.h>
+00024 
+00025 #include "real_value.h"         // the sphere fitness
+00026 
+00027 // Now the main
+00029 typedef eoMinimizingFitness  FitT;
+00030 
+00031 template <class EOT>
+00032 void runAlgorithm(EOT, eoParser& _parser, eoState& _state);
+00033 
+00034 int main_function(int argc, char *argv[])
+00035 {
+00036     // Create the command-line parser
+00037     eoParser parser(argc, argv);  // for user-parameter reading
+00038     eoState state;    // keeps all things allocated
+00039     eoValueParam<bool>& simpleParam = parser.getORcreateParam(true, "Isotropic",
+00040                                                               "Isotropic self-adaptive mutation",
+00041                                                               'i', "ES mutation");
+00042     eoValueParam<bool>& stdevsParam = parser.getORcreateParam(false, "Stdev",
+00043                                                               "One self-adaptive stDev per variable",
+00044                                                               's', "ES mutation");
+00045     eoValueParam<bool>& corrParam = parser.getORcreateParam(false, "Correl",
+00046                                                             "Use correlated mutations",
+00047                                                             'c', "ES mutation");
+00048     // Run the appropriate algorithm
+00049     if (simpleParam.value() == false)
+00050     {
+00051         std::cout << "Using eoReal" << std::endl;
+00052         runAlgorithm(eoReal<FitT>(), parser, state);
+00053     }
+00054     else if (stdevsParam.value() == false)
+00055     {
+00056         std::cout << "Using eoEsSimple" << std::endl;
+00057         runAlgorithm(eoEsSimple<FitT>(), parser, state);
+00058     }
+00059     else if (corrParam.value() == false)
+00060     {
+00061         std::cout << "Using eoEsStdev" << std::endl;
+00062         runAlgorithm(eoEsStdev<FitT>(), parser, state);
+00063     }
+00064     else
+00065     {
+00066         std::cout << "Using eoEsFull" << std::endl;
+00067         runAlgorithm(eoEsFull<FitT>(), parser, state);
+00068     }
+00069     return 0;
+00070 }
+00071 
+00072 
+00073 
+00074 // A main that catches the exceptions
+00075 int main(int argc, char **argv)
+00076 {
+00077 #ifdef _MSC_VER
+00078     // rng.reseed(42);
+00079     int flag = _CrtSetDbgFlag(_CRTDBG_LEAK_CHECK_DF);
+00080     flag |= _CRTDBG_LEAK_CHECK_DF;
+00081     _CrtSetDbgFlag(flag);
+00082     // _CrtSetBreakAlloc(100);
+00083 #endif
+00084     try
+00085     {
+00086         main_function(argc, argv);
+00087     }
+00088     catch(std::exception& e)
+00089     {
+00090         std::cout << "Exception: " << e.what() << '\n';
+00091     }
+00092 }
+00093 
+00094 
+00095 
+00101 template <class EOT>
+00102 void runAlgorithm(EOT, eoParser& _parser, eoState& _state)
+00103 {
+00104     typedef typename EOT::Fitness FitT;
+00105 
+00108 
+00109     // The evaluation fn - encapsulated into an eval counter for output
+00110     eoEvalFuncPtr<EOT, double, const std::vector<double>&> mainEval( real_value );
+00111     eoEvalFuncCounter<EOT> eval(mainEval);
+00112 
+00113     // the genotype - through a genotype initializer
+00114     eoRealInitBounded<EOT>& init = make_genotype(_parser, _state, EOT());
+00115 
+00116     // Build the variation operator (any seq/prop construct)
+00117     eoGenOp<EOT>& op = make_op(_parser, _state, init);
+00118 
+00121 
+00122     // initialize the population - and evaluate
+00123     // yes, this is representation indepedent once you have an eoInit
+00124     eoPop<EOT>& pop = make_pop(_parser, _state, init);
+00125     apply<EOT>(eval, pop);
+00126 
+00127     // stopping criteria
+00128     eoContinue<EOT> & term = make_continue(_parser, _state, eval);
+00129     // output
+00130     eoCheckPoint<EOT> & checkpoint = make_checkpoint(_parser, _state, eval, term);
+00131     // algorithm (need the operator!)
+00132     eoAlgo<EOT>& ga = make_algo_scalar(_parser, _state, eval, checkpoint, op);
+00133 
+00136     // to be called AFTER all parameters have been read!!!
+00137     make_help(_parser);
+00138 
+00141     std::cout << "Initial Population\n";
+00142     pop.sortedPrintOn(std::cout);
+00143     std::cout << std::endl;
+00144 
+00145     run_ea(ga, pop); // run the ga
+00146 
+00147     std::cout << "Final Population\n";
+00148     pop.sortedPrintOn(std::cout);
+00149     std::cout << std::endl;
+00150 }
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_e_s_full_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_e_s_full_8cpp-source.html
new file mode 100644
index 000000000..1afe9d292
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_e_s_full_8cpp-source.html
@@ -0,0 +1,194 @@
+
+
+EO: t-eoESFull.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoESFull.cpp
    00001 // Program to test several EO-ES features
+00002 
+00003 #ifdef _MSC_VER
+00004 #pragma warning(disable:4786)
+00005 #endif
+00006 
+00007 #include <algorithm>
+00008 #include <string>
+00009 #include <iostream>
+00010 #include <iterator>
+00011 #include <stdexcept>
+00012 #include <time.h>
+00013 
+00014 using namespace std;
+00015 
+00016 #include <eo>
+00017 
+00018 // representation specific
+00019 #include <es.h>
+00020 
+00021 #include "real_value.h"         // the sphere fitness
+00022 
+00023 // Now the main
+00025 typedef eoMinimizingFitness  FitT;
+00026 
+00027 template <class EOT>
+00028 void runAlgorithm(EOT, eoParser& _parser, eoState& _state, eoRealVectorBounds& _bounds, eoValueParam<string> _load_name);
+00029 
+00030 int main_function(int argc, char *argv[])
+00031 {
+00032   // Create the command-line parser
+00033   eoParser parser( argc, argv, "Basic EA for vector<float> with adaptive mutations");
+00034 
+00035   // Define Parameters and load them
+00036   eoValueParam<uint32_t>& seed        = parser.createParam(static_cast<uint32_t>(time(0)),
+00037                                                            "seed", "Random number seed");
+00038   eoValueParam<string>& load_name   = parser.createParam(string(), "Load","Load a state file",'L');
+00039   eoValueParam<string>& save_name   = parser.createParam(string(), "Save","Saves a state file",'S');
+00040   eoValueParam<bool>&   stdevs      = parser.createParam(false, "Stdev", "Use adaptive mutation rates", 's');
+00041   eoValueParam<bool>&   corr        = parser.createParam(false, "Correl", "Use correlated mutations", 'c');
+00042   eoValueParam<unsigned>& chromSize = parser.createParam(unsigned(50), "ChromSize", "Number of chromosomes", 'n');
+00043   eoValueParam<double>& minimum     = parser.createParam(-1.0, "Min", "Minimum for Objective Variables", 'l');
+00044   eoValueParam<double>& maximum     = parser.createParam(1.0, "Max", "Maximum for Objective Variables", 'h');
+00045 
+00046   eoState state;
+00047     state.registerObject(parser);
+00048     rng.reseed(seed.value());
+00049 
+00050    if (!load_name.value().empty())
+00051    { // load the parser. This is only neccessary when the user wants to
+00052      // be able to change the parameters in the state file by hand
+00053      // Note that only parameters inserted in the parser at this point
+00054      // will be loaded!.
+00055        state.load(load_name.value()); // load the parser
+00056    }
+00057 
+00058     state.registerObject(rng);
+00059 
+00060     eoRealVectorBounds bounds(chromSize.value(), minimum.value(), maximum.value());
+00061 
+00062     // Run the appropriate algorithm
+00063     if (stdevs.value() == false && corr.value() == false)
+00064     {
+00065         runAlgorithm(eoEsSimple<FitT>() ,parser, state, bounds, load_name);
+00066     }
+00067     else if (corr.value() == true)
+00068     {
+00069         runAlgorithm(eoEsFull<FitT>(),parser, state, bounds, load_name);
+00070     }
+00071     else
+00072     {
+00073         runAlgorithm(eoEsStdev<FitT>(), parser, state, bounds, load_name);
+00074     }
+00075 
+00076     // and save
+00077     if (!save_name.value().empty())
+00078     {
+00079         string file_name = save_name.value();
+00080         save_name.value() = ""; // so that it does not appear in the parser section of the state file
+00081         state.save(file_name);
+00082     }
+00083 
+00084         return 0;
+00085 }
+00086 
+00087 // A main that catches the exceptions
+00088 
+00089 int main(int argc, char **argv)
+00090 {
+00091 #ifdef _MSC_VER
+00092   //  rng.reseed(42);
+00093     int flag = _CrtSetDbgFlag(_CRTDBG_LEAK_CHECK_DF);
+00094      flag |= _CRTDBG_LEAK_CHECK_DF;
+00095     _CrtSetDbgFlag(flag);
+00096 //   _CrtSetBreakAlloc(100);
+00097 #endif
+00098 
+00099     try
+00100     {
+00101         main_function(argc, argv);
+00102     }
+00103     catch(std::exception& e)
+00104     {
+00105         std::cout << "Exception: " << e.what() << '\n';
+00106     }
+00107 
+00108     return 1;
+00109 }
+00110 
+00111 template <class EOT>
+00112 void runAlgorithm(EOT, eoParser& _parser, eoState& _state, eoRealVectorBounds& _bounds, eoValueParam<string> _load_name)
+00113 {
+00114     // evaluation
+00115     eoEvalFuncPtr<EOT, double, const vector<double>&> eval(  real_value );
+00116 
+00117     // population parameters, unfortunately these can not be altered in the state file
+00118     eoValueParam<unsigned> mu = _parser.createParam(unsigned(7), "mu","Size of the population");
+00119     eoValueParam<double>lambda_rate = _parser.createParam(double(7.0), "lambda_rate", "Factor of children to produce");
+00120 
+00121     if (lambda_rate.value() < 1.0f)
+00122     {
+00123         throw logic_error("lambda_rate must be larger than 1 in a comma strategy");
+00124     }
+00125 
+00126     // Initialization
+00127     eoEsChromInit<EOT> init(_bounds);
+00128 
+00129     // State takes ownership of pop because it needs to save it in caller
+00130     eoPop<EOT>& pop = _state.takeOwnership(eoPop<EOT>(mu.value(), init));
+00131 
+00132     _state.registerObject(pop);
+00133 
+00134     if (!_load_name.value().empty())
+00135     { // The real loading happens here when all objects are registered
+00136        _state.load(_load_name.value()); // load all and everything
+00137     }
+00138     else
+00139     {
+00140         // evaluate initial population
+00141         apply<EOT>(eval, pop);
+00142     }
+00143 
+00144     // Ok, time to set up the algorithm
+00145     // Proxy for the mutation parameters
+00146     eoEsMutationInit mutateInit(_parser);
+00147 
+00148     eoEsMutate<EOT> mutate(mutateInit, _bounds);
+00149 
+00150     // monitoring, statistics etc.
+00151     eoAverageStat<EOT> average;
+00152     eoStdoutMonitor monitor;
+00153 
+00154     monitor.add(average);
+00155 
+00156     eoGenContinue<EOT> cnt(100);
+00157     eoCheckPoint<EOT> checkpoint(cnt);
+00158     checkpoint.add(monitor);
+00159     checkpoint.add(average);
+00160 
+00161     // only mutation (== with rate 1.0)
+00162     eoMonGenOp<EOT> op(mutate);
+00163 
+00164     // the selection: sequential selection
+00165     eoSequentialSelect<EOT> select;
+00166     // the general breeder (lambda is a rate -> true)
+00167     eoGeneralBreeder<EOT> breed(select, op, lambda_rate.value(), true);
+00168 
+00169     // the replacement - hard-coded Comma replacement
+00170     eoCommaReplacement<EOT> replace;
+00171 
+00172     // now the eoEasyEA
+00173     eoEasyEA<EOT> es(checkpoint, eval, breed, replace);
+00174 
+00175     es(pop);
+00176 
+00177     pop.sort();
+00178     std::cout << "Final population\n" << pop << std::endl;
+00179 
+00180 }
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_e_s_ops_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_e_s_ops_8cpp-source.html
new file mode 100644
index 000000000..963f16c61
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_e_s_ops_8cpp-source.html
@@ -0,0 +1,130 @@
+
+
+EO: t-eoESOps.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoESOps.cpp
    00001 // Program to test several EO-ES features
+00002 
+00003 #ifdef _MSC_VER
+00004 #pragma warning(disable:4786)
+00005 #endif 
+00006 
+00007 #include <string>
+00008 #include <iostream>
+00009 #include <iterator>
+00010 
+00011 using namespace std;
+00012 
+00013 // general
+00014 #include <utils/eoParser.h>            // though contained in all others!
+00015 // evolution specific
+00016 #include <eoEvalFuncPtr.h>
+00017 //#include <eoSequentialOpHolder.h>
+00018 //#include <eoFullEA.h>
+00019 // representation specific
+00020 
+00021 #include <es/eoESFullChrom.h>            // though contained in following
+00022 //#include <eoESReco.h>
+00023 #include <es/eoESFullMut.h>
+00024 //#include <eoESRandomize.h>
+00025 // this fitness
+00026 #include "real_value.h"         // the sphere fitness
+00027 
+00028 // Now the main 
+00030 typedef eoESFullChrom<float> Ind;
+00031   
+00032 main(int argc, char *argv[]) {
+00033   unsigned mu, lambda;
+00034   bool comma;
+00035 
+00036   // Create the command-line parser
+00037   Parser parser( argc, argv, "Basic EA for vector<float> with adaptive mutations");
+00038 
+00039   //reproducible random seed - thanks, Maarten
+00040   InitRandom(parser);
+00041 
+00042   // a first Ind, reading its parameters from the parser
+00043   // will be used later to inialize the whole population
+00044   Ind FirstEO(parser);
+00045 
+00046   // Evaluation
+00047   // here we should call some  parser-based constructor, 
+00048   // as many evaluation function need parameters
+00049   // and also have some preliminary stuffs to do
+00050   eoEvalFuncPtr<Ind> eval(  real_value );
+00051 
+00052  // recombination and mutation operators, reading their parameters from the parser
+00053   eoESMutate<float> MyMut(parser, 
+00054                           FirstEO.StdDevLength(), FirstEO.size(), 
+00055                           FirstEO.CorCffLength() );
+00056 
+00057   std::cout << "First EO " << FirstEO << std::endl;
+00058   MyMut(FirstEO);
+00059   std::cout << "First EO mutated" << FirstEO << std::endl;
+00060 
+00061   /*
+00062   // Evolution and population parameters
+00063   eoScheme<Ind> the_scheme(parser);
+00064 
+00065   // recombination and mutation operators, reading their parameters from the parser
+00066   eoESReco<float> MyReco(parser, FirstEO);
+00067   eoESMutate<float> MyMut(parser, FirstEO);
+00068 
+00069   // termination conditions read by the parser
+00070   eoTermVector<Ind> the_terms(parser);
+00071   
+00072   // Initialization of the population
+00073   // shoudl be called using the parser, in case you want to read from file(s)
+00074   eoESRandomize<float> randomize;       // an eoESInd randomnizer
+00075   eoPop<Ind> pop(the_scheme.PopSize(), FirstEO, randomize); 
+00076   // eval(pop);    // shoudl we call it from inside the constructor???
+00077 
+00078   // ALL parmeters have been read: write them out
+00079   //  Writing the parameters on arv[0].status 
+00080   // but of course this can be modified - see the example parser.cpp
+00081   parser.outputParam();
+00082   // except the help parameter???
+00083   if( parser.getBool("-h" , "--help" , "Shows this help")) {
+00084     parser.printHelp();
+00085     exit(1);
+00086   }
+00087 
+00088   unsigned i, iind;
+00089 
+00090 
+00091     std::cout << "Initial population: \n" << std::endl;
+00092     for (i = 0; i < pop.size(); ++i) {
+00093       eval(pop[i]);
+00094       std::cout << pop[i].fitness() << "\t" << pop[i] << std::endl;
+00095     }
+00096 
+00097   // the Operators
+00098   eoSequentialOpHolder <Ind> seqholder;
+00099   //  seqholder.addOp(MyReco, 1.0);
+00100   seqholder.addOp(MyMut, 1.0);
+00101 
+00102   // One generation
+00103   eoEvolStep<Ind> evol_scheme(the_scheme, seqholder, eval);
+00104   
+00105   // the algorithm: 
+00106   eoFullEA<Ind> ea(evol_scheme, the_terms);
+00107 
+00108   ea(pop);
+00109   
+00110     std::cout << "Final population: \n" << std::endl;
+00111   for (i = 0; i < pop.size(); ++i)
+00112     std::cout << pop[i].fitness() << "\t" << pop[i] << std::endl;
+00113   return 0;
+00114   */
+00115 }
+00116 
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_easy_e_a_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_easy_e_a_8cpp-source.html
new file mode 100644
index 000000000..2ae9a69e1
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_easy_e_a_8cpp-source.html
@@ -0,0 +1,99 @@
+
+
+EO: t-eoEasyEA.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoEasyEA.cpp
    00001 //-----------------------------------------------------------------------------
+00002 // t-eoEasyEA.cpp
+00003 //-----------------------------------------------------------------------------
+00004 
+00005 #ifndef __GNUG__
+00006 // to avoid long name warnings
+00007 #pragma warning(disable:4786)
+00008 #endif // __GNUG__
+00009 
+00010 #include <eo>
+00011 
+00012 #include "binary_value.h"
+00013 
+00014 //-----------------------------------------------------------------------------
+00015 
+00016 typedef eoBin<float> Chrom;
+00017 
+00018 //-----------------------------------------------------------------------------
+00019 
+00020 main()
+00021 {
+00022   const unsigned POP_SIZE = 8, CHROM_SIZE = 16;
+00023   unsigned i;
+00024 
+00025 // a chromosome randomizer
+00026   eoBinRandom<Chrom> random;
+00027 // the populations: 
+00028   eoPop<Chrom> pop; 
+00029 
+00030    // Evaluation
+00031   eoEvalFuncPtr<Chrom> eval(  binary_value );
+00032  
+00033   for (i = 0; i < POP_SIZE; ++i)
+00034     {
+00035       Chrom chrom(CHROM_SIZE);
+00036       random(chrom);
+00037       eval(chrom);
+00038       pop.push_back(chrom);
+00039     }
+00040   
+00041   std::cout << "population:" << std::endl;
+00042   for (i = 0; i < pop.size(); ++i)
+00043     std::cout << "\t" << pop[i] << " " << pop[i].fitness() << std::endl;
+00044 
+00045   
+00046   // selection
+00047   eoLottery<Chrom> lottery;
+00048 
+00049   // breeder
+00050   eoBinBitFlip<Chrom> bitflip;
+00051   eoBinCrossover<Chrom> xover;
+00052   eoProportionalOpSel<Chrom> propSel;
+00053   eoBreeder<Chrom> breeder( propSel );
+00054   propSel.addOp(bitflip, 0.25);
+00055   propSel.addOp(xover, 0.75);
+00056   
+00057   // replacement
+00058   eoInclusion<Chrom> inclusion;
+00059 
+00060   // Terminators
+00061   eoFitTerm<Chrom> term( pow(2.0, CHROM_SIZE), 1 );
+00062 
+00063   // GA generation
+00064   eoEasyEA<Chrom> ea(lottery, breeder, inclusion, eval, term);
+00065 
+00066   // evolution
+00067   try
+00068     {
+00069       ea(pop);
+00070     }
+00071   catch (std::exception& e)
+00072     {
+00073         std::cout << "exception: " << e.what() << std::endl;;
+00074         exit(EXIT_FAILURE);
+00075     }
+00076   
+00077   std::cout << "pop" << std::endl;
+00078   for (i = 0; i < pop.size(); ++i)
+00079     std::cout << "\t" <<  pop[i] << " " << pop[i].fitness() << std::endl;
+00080   
+00081   return 0;
+00082 }
+00083 
+00084 //-----------------------------------------------------------------------------
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_external_e_o_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_external_e_o_8cpp-source.html
new file mode 100644
index 000000000..915b7b7b4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_external_e_o_8cpp-source.html
@@ -0,0 +1,147 @@
+
+
+EO: t-eoExternalEO.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoExternalEO.cpp
    00001 // to avoid long name warnings
+00002 #ifdef _MSC_VER
+00003 #pragma warning(disable:4786)
+00004 #endif
+00005 
+00006 #include <iostream>
+00007 #include <stdexcept>  // runtime_error 
+00008 
+00009 #include <eoEvalFuncPtr.h>
+00010 #include <other/external_eo>
+00011 #include <utils/eoRNG.h>
+00012 
+00013 using namespace std;
+00014 
+00015 struct UserDefStruct
+00016 {
+00017     int a;
+00018     float b;
+00019     double c;
+00020     enum Enum { just, another, test } d;
+00021 };
+00022 
+00023 std::ostream& operator<<(std::ostream& os, const UserDefStruct& str)
+00024 {
+00025     return os << str.a << ' ' << str.b << ' ' << str.c << ' ' << static_cast<int>(str.d) << ' ';
+00026 }
+00027 
+00028 istream& operator>>(istream& is, UserDefStruct& str)
+00029 {
+00030     is >> str.a;
+00031     is >> str.b;
+00032     is >> str.c;
+00033     int i;
+00034     is >> i;
+00035     str.d = static_cast<UserDefStruct::Enum>(i);
+00036 
+00037     return is;
+00038 }
+00039 
+00040 
+00041 UserDefStruct RandomStruct()
+00042 {
+00043     std::cout << "RandomStruct\n";
+00044 
+00045     UserDefStruct result;
+00046 
+00047     result.a = rng.random(5);
+00048     result.b = rng.uniform();
+00049     result.c = rng.uniform();
+00050     result.d = UserDefStruct::another;
+00051 
+00052     return result;
+00053 }
+00054 
+00055 // reading and writing
+00056 
+00057 
+00058 bool UserDefMutate(UserDefStruct& a)
+00059 {
+00060     std::cout << "UserDefMutate\n";
+00061     a = RandomStruct(); // just for testing
+00062 
+00063     if (rng.flip(0.1f))
+00064         a.d = UserDefStruct::test;
+00065     else
+00066         a.d = UserDefStruct::another;
+00067     return true;
+00068 }
+00069 
+00070 bool UserDefBinCrossover(UserDefStruct& a, const UserDefStruct& b)
+00071 {
+00072     std::cout << "UserDefBinCrossover\n";
+00073 
+00074     if (rng.flip(0.5))
+00075         a.a = b.a;
+00076     if (rng.flip(0.5))
+00077         a.b = b.b;
+00078     if (rng.flip(0.5))
+00079         a.c = b.c;
+00080     if (rng.flip(0.5))
+00081         a.d = b.d;
+00082     return true;
+00083 }
+00084 
+00085 bool UserDefQuadCrossover(UserDefStruct& a, UserDefStruct& b)
+00086 {
+00087     std::cout << "UserDefQuadCrossover\n";
+00088     if (rng.flip(0.5))
+00089         swap(a.a, b.a);
+00090     if (rng.flip(0.5))
+00091         swap(a.b, b.b);
+00092     if (rng.flip(0.5))
+00093         swap(a.c, b.c);
+00094     if (rng.flip(0.5))
+00095         swap(a.d, b.d);
+00096 
+00097     return true;
+00098 }
+00099 
+00100 float UserDefEvalFunc(const UserDefStruct& a)
+00101 {
+00102     std::cout << "UserDefEvalFunc\n";
+00103     return a.b;
+00104 }
+00105 
+00106 int main()
+00107 {
+00108     typedef UserDefStruct External;
+00109     typedef float FitnessType;
+00110     typedef eoExternalEO<float, External> EoType;
+00111 
+00112     eoExternalInit<FitnessType, External> init(RandomStruct);
+00113     eoExternalMonOp<FitnessType, External> mutate(UserDefMutate);
+00114     eoExternalBinOp<FitnessType, External> cross1(UserDefBinCrossover);
+00115     eoExternalQuadOp<FitnessType, External> cross2(UserDefQuadCrossover);
+00116 
+00117     // eoExternalEvalFunc<FitnessType, External>   eval(UserDefEvalFunc);
+00118 
+00119     EoType eo1;
+00120     init(eo1);
+00121     EoType eo2;
+00122     init(eo2);
+00123 
+00124     std::cout << "before mutation " << eo1 << '\n';
+00125     mutate(eo1);
+00126     std::cout << "after mutation " << eo1 << '\n';
+00127     cross1(eo1, eo2);
+00128     std::cout << "after crossover " << eo1 << '\n';
+00129 
+00130     cross2(eo1,eo2);
+00131 
+00132 };
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_fitness_assembled_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_fitness_assembled_8cpp-source.html
new file mode 100644
index 000000000..4ff25a117
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_fitness_assembled_8cpp-source.html
@@ -0,0 +1,120 @@
+
+
+EO: t-eoFitnessAssembled.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoFitnessAssembled.cpp
    00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002  
+00003 //-----------------------------------------------------------------------------
+00004 // t-eoFitnessAssembled.cpp
+00005 // Marc Wintermantel & Oliver Koenig
+00006 // IMES-ST@ETHZ.CH
+00007 // March 2003
+00008 
+00009 /*
+00010     This library is free software; you can redistribute it and/or
+00011     modify it under the terms of the GNU Lesser General Public
+00012     License as published by the Free Software Foundation; either
+00013     version 2 of the License, or (at your option) any later version.
+00014  
+00015     This library is distributed in the hope that it will be useful,
+00016     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00017     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00018     Lesser General Public License for more details.
+00019  
+00020     You should have received a copy of the GNU Lesser General Public
+00021     License along with this library; if not, write to the Free Software
+00022     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00023  
+00024     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00025              Marc.Schoenauer@inria.fr
+00026              mak@dhi.dk
+00027 */
+00028 //-----------------------------------------------------------------------------
+00029 #include <iostream>
+00030 #include <stdexcept>
+00031 
+00032 #include "eoScalarFitnessAssembled.h"
+00033 
+00034 void test_eoScalarFitnessAssembledClass(){
+00035   
+00036   // Create instances
+00037   eoAssembledMinimizingFitness A,B,C(5, 1.3, "C value");
+00038 
+00039   // Add some values to them
+00040   A.push_back( 5.6, "first value"  );
+00041   A.push_back( 3.2, "second value" );
+00042   A.push_back( 2.6, "third value" );
+00043 
+00044   B.push_back( 1.2 );
+00045   B.push_back( 3.2 );
+00046   B.push_back( 5.2 );
+00047 
+00048   B.setDescription( 1, "B descr" );
+00049 
+00050   std::cout << "Created instances A,B and C, added some vals; testing << operator " << std::endl;
+00051   std::cout << "A= " << A << std::endl;
+00052   std::cout << "B= " << B << std::endl;
+00053   std::cout << "C= " << C << std::endl;
+00054   std::cout << "Printing values and descriptions: " << std::endl;
+00055   std::cout << "A: "; A.printAll( std::cout ); std::cout << std::endl;
+00056   std::cout << "B: "; B.printAll( std::cout ); std::cout << std::endl; 
+00057   std::cout << "C: "; C.printAll( std::cout ); std::cout << std::endl;
+00058   
+00059   A.resize(8, 100.3, "A resized");
+00060   std::cout << "Resized A: "; A.printAll( std::cout ); std::cout << std::endl;
+00061 
+00062   std::cout << "Access fitness values of A and B: " << "f(A)= " << (double) A << " f(B)= " << (double) B << std::endl;
+00063 
+00064   // Testing constructors and assignments
+00065   eoAssembledMinimizingFitness D(A) ,E(3.2);
+00066   std::cout << "D(A) = " << D << "\t" << "E(3.2)= " << E << std::endl;
+00067   eoAssembledMinimizingFitness F,G;
+00068   F=A;
+00069   G= 7.5;
+00070   std::cout << "F = A : " << F << "\t G = 7.5 : " << G << std::endl;
+00071  
+00072   // Comparing...
+00073   std::cout << "A<B: " << (A<B) << std::endl;
+00074   std::cout << "A>B: " << (A>B) << std::endl;
+00075   std::cout << "A<=B: " << (A<=B) << std::endl;
+00076   std::cout << "A>=B: " << (A>=B) << std::endl;
+00077 
+00078 }
+00079 
+00080 
+00081 
+00082 int main(){
+00083   
+00084   std::cout << "-----------------------------------" << std::endl;
+00085   std::cout << "START t-eoFitnessAssembled" << std::endl;
+00086 
+00087   try{
+00088     // Test the fitness class itself
+00089     test_eoScalarFitnessAssembledClass();
+00090     
+00091     
+00092 
+00093   }
+00094   catch(std::exception& e){
+00095     std::cout << e.what() << std::endl;
+00096     return 1;
+00097   }
+00098 
+00099   std::cout << "END  t-eoFitnessAssembled" << std::endl;
+00100   std::cout << "----------------------------------" << std::endl;
+00101 
+00102   return 0;
+00103 
+00104 }
+00105 
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_fitness_assembled_e_a_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_fitness_assembled_e_a_8cpp-source.html
new file mode 100644
index 000000000..385eb51e7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_fitness_assembled_e_a_8cpp-source.html
@@ -0,0 +1,183 @@
+
+
+EO: t-eoFitnessAssembledEA.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoFitnessAssembledEA.cpp
    00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002  
+00003 //-----------------------------------------------------------------------------
+00004 // t-eoFitnessAssembledEA.cpp
+00005 // Marc Wintermantel & Oliver Koenig
+00006 // IMES-ST@ETHZ.CH
+00007 // March 2003
+00008 
+00009 /*
+00010     This library is free software; you can redistribute it and/or
+00011     modify it under the terms of the GNU Lesser General Public
+00012     License as published by the Free Software Foundation; either
+00013     version 2 of the License, or (at your option) any later version.
+00014  
+00015     This library is distributed in the hope that it will be useful,
+00016     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00017     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00018     Lesser General Public License for more details.
+00019  
+00020     You should have received a copy of the GNU Lesser General Public
+00021     License along with this library; if not, write to the Free Software
+00022     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00023  
+00024     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00025              Marc.Schoenauer@inria.fr
+00026              mak@dhi.dk
+00027 */
+00028 //-----------------------------------------------------------------------------
+00029 #ifdef HAVE_CONFIG_H
+00030 #include <config.h>
+00031 #endif
+00032 
+00033 #include <iostream>
+00034 #include <cmath>
+00035 
+00036 // General eo includes
+00037 #include <eo>
+00038 #include <utils/eoRealVectorBounds.h>   // The real bounds (not yet in general eo include)
+00039 
+00040 // Representation dependent includes and typedefs
+00041 #include <es/eoReal.h>                  // Definition of representation
+00042 #include <es/eoRealInitBounded.h>       // Uniformly initializes real vector in bounds
+00043 #include <es/make_genotype_real.h>              // Initialization of a genotype
+00044 #include <eoEvalFunc.h>                 // Base class for fitness evaluation 
+00045 #include <es/make_op_real.h>            // Variation operators using standard Real operators
+00046 #include <eoScalarFitnessAssembled.h>     // The fitness class
+00047 typedef eoReal<eoAssembledMinimizingFitness> Indi;
+00048 
+00049 // Representation independent modules
+00050 #include <do/make_pop.h>                // Initialization of population
+00051 #include <do/make_continue.h>           // The stopping criterion
+00052 #include <do/make_checkpoint_assembled.h>       // Outputs (stats, population dumps, ...)
+00053 #include <do/make_algo_scalar.h>        // Evolution engine (selection and replacement)
+00054 #include <do/make_run.h>                // simple call to the algo.stays there for consistency reasons 
+00055 
+00056 // Define a fitness class
+00057 template <class EOT>
+00058 class eoAssembledEvalFunc : public eoEvalFunc<EOT>{
+00059 public:
+00060   // Constructor defining number and descriptions of fitness terms
+00061   eoAssembledEvalFunc() {
+00062     
+00063     // Define a temporary fitness object to have access to its static traits
+00064     typename EOT::Fitness tmpfit(3, 0.0);    
+00065     tmpfit.setDescription(0,"Fitness");
+00066     tmpfit.setDescription(1,"Some Value");
+00067     tmpfit.setDescription(2,"Other Value");
+00068 
+00069   }
+00070 
+00071   void operator()(EOT& _eo){
+00072 
+00073     // Define temporary fitness object 
+00074     // (automatically gets initialized with size given in constructor)
+00075     typename EOT::Fitness tmpfit;
+00076     
+00077     // Eval some dummy fitness
+00078     double sum1=0.0, sum2=0.0;
+00079     for (unsigned i=0; i < _eo.size(); ++i){
+00080       sum1 += _eo[i]*_eo[i];
+00081       sum2 += fabs(_eo[i]) + fabs(_eo[i]);
+00082     }
+00083     
+00084     // Store some fitness terms
+00085     tmpfit[1]= sum1;
+00086     tmpfit[2]= sum2;
+00087     
+00088     // Store the fitness
+00089     tmpfit = (sum1 + sum2)/_eo.size();
+00090 
+00091     // Pass it
+00092     _eo.fitness( tmpfit );
+00093   
+00094   }
+00095 };
+00096 
+00097 // checks for help demand, and writes the status file and make_help; in libutils
+00098 void make_help(eoParser & _parser);
+00099 
+00100 // now use all of the above, + representation dependent things
+00101 int main(int argc, char* argv[]){
+00102   
+00103   std::cout << "-----------------------------------" << std::endl;
+00104   std::cout << "START t-eoFitnessAssembledEA" << std::endl;
+00105 
+00106   try{
+00107 
+00108     // Parser & State
+00109     eoParser parser(argc, argv);  // for user-parameter reading    
+00110     eoState state;    // keeps all things allocated
+00111 
+00113     // A) Representation dependent stuff
+00115 
+00116     // The fitness
+00117     eoAssembledEvalFunc<Indi> plainEval;
+00118     // turn that object into an evaluation counter
+00119     eoEvalFuncCounter<Indi> eval(plainEval);
+00120 
+00121     // The genotype
+00122     eoRealInitBounded<Indi>& init = do_make_genotype(parser, state, Indi() );
+00123     
+00124     // The variation operators
+00125     eoGenOp<Indi>& op = do_make_op(parser, state, init);
+00126 
+00128     // B) Create representation independent stuff
+00130 
+00131     // initialize the population
+00132     // yes, this is representation indepedent once you have an eoInit
+00133     eoPop<Indi>& pop   = do_make_pop(parser, state, init);
+00134 
+00135     // stopping criteria
+00136     eoContinue<Indi> & term = do_make_continue(parser, state, eval);
+00137     // output
+00138     eoCheckPoint<Indi> & checkpoint = do_make_checkpoint_assembled(parser, state, eval, term);
+00139     // algorithm (need the operator!)
+00140     eoAlgo<Indi>& ga = do_make_algo_scalar(parser, state, eval, checkpoint, op);
+00141 
+00142 
+00143     make_help(parser);  // To be called after all parameters have been read !
+00144 
+00146     // C) Run the algorithm
+00148 
+00149     // evaluate intial population AFTER help and status in case it takes time
+00150     apply<Indi>(eval, pop);
+00151     // if you want to print it out
+00152     std::cout << "Initial Population\n";
+00153     pop.sortedPrintOn(std::cout);
+00154     std::cout << std::endl;
+00155 
+00156     do_run(ga, pop); // run the ga
+00157 
+00158     std::cout << "Final Population\n";
+00159     pop.sortedPrintOn(std::cout);
+00160     std::cout << std::endl;
+00161     
+00162   }
+00163   catch(std::exception& e)
+00164     {
+00165       std::cout << e.what() << std::endl;
+00166       return 1;
+00167     }
+00168 
+00169   std::cout << "-----------------------------------" << std::endl;
+00170   std::cout << "END t-eoFitnessAssembledEA" << std::endl;
+00171 
+00172   return 0;
+00173 
+00174 }
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_functor_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_functor_8cpp-source.html
new file mode 100644
index 000000000..7cc6d5379
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_functor_8cpp-source.html
@@ -0,0 +1,63 @@
+
+
+EO: t-eoFunctor.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoFunctor.cpp
    00001 
+00002 #include <eoInit.h>
+00003 #include <eoCounter.h>
+00004 
+00005 void f(eoInit<int>& func)
+00006 {
+00007     int i;
+00008     func(i);
+00009 }
+00010 
+00011 class Tester : public eoInit<int>
+00012 {
+00013 public :
+00014     void operator()(int& i)
+00015     {
+00016         i=1;
+00017     }
+00018 };
+00019 
+00020 #include <iostream>
+00021 #include <eoFixedLength.h>
+00022 #include <eoVariableLength.h>
+00023 
+00024 using namespace std;
+00025 
+00026 int main(void)
+00027 {
+00028     Tester test;
+00029 
+00030     eoFunctorStore store;
+00031 
+00033     eoInit<int>& cntr = make_counter(functor_category(test), test, store);
+00034 
+00035     eoUnaryFunctorCounter<eoInit<int> > cntr2(test);
+00036 
+00037     f(cntr);
+00038     f(cntr2);
+00039     f(cntr2);
+00040     f(test);
+00041 
+00042     typedef eoVariableLength<double, int> EoType;
+00043     EoType eo;
+00044 
+00045     eo.push_back(1);
+00046     eo.push_back(2);
+00047 
+00048     return 1;
+00049 }
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_g_a_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_g_a_8cpp-source.html
new file mode 100644
index 000000000..619383e48
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_g_a_8cpp-source.html
@@ -0,0 +1,79 @@
+
+
+EO: t-eoGA.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoGA.cpp
    00001 #include <iostream>
+00002 
+00003 #include <ga/make_ga.h>
+00004 #include <eoEvalFuncPtr.h>
+00005 #include "binary_value.h"
+00006 #include <apply.h>
+00007 
+00008 using namespace std;
+00009 
+00010 int main(int argc, char* argv[])
+00011 {
+00012 
+00013   try
+00014   {
+00015   typedef eoBit<double> EOT;
+00016 
+00017   eoParser parser(argc, argv);  // for user-parameter reading
+00018 
+00019   eoState state;    // keeps all things allocated
+00020 
+00023 
+00024   // The evaluation fn - encapsulated into an eval counter for output 
+00025   eoEvalFuncPtr<EOT, double> mainEval( binary_value<EOT> );
+00026   eoEvalFuncCounter<EOT> eval(mainEval);
+00027 
+00028   // the genotype - through a genotype initializer
+00029   eoInit<EOT>& init = make_genotype(parser, state, EOT());
+00030 
+00031   // Build the variation operator (any seq/prop construct)
+00032   eoGenOp<EOT>& op = make_op(parser, state, init);
+00033 
+00036 
+00037   // initialize the population - and evaluate
+00038   // yes, this is representation indepedent once you have an eoInit
+00039   eoPop<EOT>& pop   = make_pop(parser, state, init);
+00040 
+00041   // stopping criteria
+00042   eoContinue<EOT> & term = make_continue(parser, state, eval);
+00043   // output
+00044   eoCheckPoint<EOT> & checkpoint = make_checkpoint(parser, state, eval, term);
+00045   // algorithm (need the operator!)
+00046   eoAlgo<EOT>& ga = make_algo_scalar(parser, state, eval, checkpoint, op);
+00047 
+00050   // to be called AFTER all parameters have been read!!!
+00051   make_help(parser);
+00052 
+00055   // evaluate intial population AFTER help and status in case it takes time
+00056   apply<EOT>(eval, pop);
+00057   // print it out
+00058   std::cout << "Initial Population\n";
+00059   pop.sortedPrintOn(std::cout);
+00060   std::cout << std::endl;
+00061 
+00062   run_ea(ga, pop); // run the ga
+00063 
+00064   std::cout << "Final Population\n";
+00065   pop.sortedPrintOn(std::cout);
+00066   std::cout << std::endl;
+00067   }
+00068   catch(std::exception& e)
+00069   {
+00070     std::cout << e.what() << std::endl;
+00071   }
+00072 }
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_g_op_sel_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_g_op_sel_8cpp-source.html
new file mode 100644
index 000000000..eda322777
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_g_op_sel_8cpp-source.html
@@ -0,0 +1,146 @@
+
+
+EO: t-eoGOpSel.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoGOpSel.cpp
    00001 /* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003     t-eoGOpSel.cpp
+00004       Testing proportional operator selectors
+00005 
+00006     (c) Maarten Keijzer and GeNeura Team, 2000 
+00007  
+00008     This program is free software; you can redistribute it and/or modify
+00009     it under the terms of the GNU General Public License as published by
+00010     the Free Software Foundation; either version 2 of the License, or
+00011     (at your option) any later version.
+00012 
+00013     This program is distributed in the hope that it will be useful,
+00014     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00015     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00016     GNU General Public License for more details.
+00017 
+00018     You should have received a copy of the GNU General Public License
+00019     along with this program; if not, write to the Free Software
+00020     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00021  
+00022     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00023             
+00024 */
+00025 
+00026 //-----------------------------------------------------------------------------// 
+00027 
+00028 #ifndef __GNUG__
+00029 // to avoid long name warnings
+00030 #pragma warning(disable:4786)
+00031 #endif // __GNUG__
+00032 
+00033 #include <iostream>
+00034 
+00035 #include <ga/eoBin.h>  // eoBin, eoPop, eoBreeder
+00036 #include <eoPop.h>
+00037 #include <ga/eoBitOp.h>
+00038 #include <eoProportionalGOpSel.h>
+00039 #include <eoSequentialGOpSelector.h>
+00040 #include <eoRandomIndiSelector.h>
+00041 
+00042 #include <eoDetTournamentIndiSelector.h>
+00043 #include <eoDetTournamentInserter.h>
+00044 #include <eoStochTournamentInserter.h>
+00045 
+00046 #include <eoGOpBreeder.h>
+00047 
+00048 #include <utils/eoRNG.h>
+00049 #include <utils/eoState.h>
+00050 
+00051 // Fitness evaluation
+00052 #include "binary_value.h"
+00053 
+00054 //-----------------------------------------------------------------------------
+00055 
+00056 typedef eoBin<float> Chrom;
+00057 
+00058 //-----------------------------------------------------------------------------
+00059 
+00060 main()
+00061 {
+00062   rng.reseed(42); // reproducible random seed
+00063 
+00064   const unsigned POP_SIZE = 8, CHROM_SIZE = 4;
+00065   unsigned i;
+00066 
+00067   eoBinRandom<Chrom> random;
+00068   eoPop<Chrom> pop; 
+00069   
+00070   for (i = 0; i < POP_SIZE; ++i)
+00071     {
+00072       Chrom chrom(CHROM_SIZE);
+00073       random(chrom);
+00074       chrom.fitness(binary_value(chrom));
+00075       pop.push_back(chrom);
+00076     }
+00077   
+00078   std::cout << "population:" << std::endl;
+00079   for (i = 0; i < pop.size(); ++i)
+00080     std::cout << pop[i] << " " << pop[i].fitness() << std::endl;
+00081 
+00082   eoBinBitFlip<Chrom> bitflip;
+00083   eoBinCrossover<Chrom> xover;
+00084   
+00085   eoEvalFuncPtr<Chrom> eval(binary_value);
+00086 
+00087   //Create the proportional operator selector and add the 
+00088   // two operators creatd above to it.
+00089 
+00090   eoProportionalGOpSel<Chrom > propSel;
+00091   eoSequentialGOpSel<Chrom>    seqSel;
+00092 
+00093   propSel.addOp(bitflip, 0.5);
+00094   propSel.addOp(xover, 0.5);
+00095   
+00096   // seqSel selects operator in sequence, creating a combined operator
+00097   // add a bitflip, an xover and another bitflip
+00098   seqSel.addOp(bitflip, 0.25);
+00099   seqSel.addOp(xover, 0.5);
+00100   seqSel.addOp(bitflip, 0.25);
+00101 
+00102 
+00103   eoRandomIndiSelector<Chrom>         selector1;
+00104   eoDetTournamentIndiSelector<Chrom>  selector2(2);
+00105 
+00106   eoBackInserter<Chrom> inserter1;
+00107   eoDetTournamentInserter<Chrom> inserter2(eval, 2);
+00108   eoStochTournamentInserter<Chrom> inserter3(eval, 0.9f);
+00109 
+00110   eoGOpBreeder<Chrom> breeder1(propSel, selector1);
+00111   eoGOpBreeder<Chrom> breeder2(seqSel, selector1);
+00112   eoGOpBreeder<Chrom> breeder3(propSel, selector2);
+00113   eoGOpBreeder<Chrom> breeder4(seqSel, selector2);
+00114 
+00115   // test the breeders
+00116 
+00117   breeder1(pop);
+00118   breeder2(pop);
+00119   breeder3(pop);
+00120   breeder4(pop);
+00121 
+00122   eoState state;
+00123 
+00124   state.registerObject(pop);
+00125 
+00126   state.save(std::std::cout);
+00127     
+00128   return 0;
+00129 }
+00130 
+00131 //-----------------------------------------------------------------------------
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_gen_op_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_gen_op_8cpp-source.html
new file mode 100644
index 000000000..06144a3f5
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_gen_op_8cpp-source.html
@@ -0,0 +1,438 @@
+
+
+EO: t-eoGenOp.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoGenOp.cpp
    00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // eoGenOp.cpp
+00005 // (c) Maarten Keijzer and Marc Schoenauer, 2001
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: mkeijzer@dhi.dk
+00022              Marc.Schoenauer@polytechnique.fr
+00023  */
+00024 //-----------------------------------------------------------------------------
+00025 
+00030 #include <sstream>
+00031 
+00032 #include <eo>
+00033 #include <eoPopulator.h>
+00034 #include <eoOpContainer.h>
+00035 
+00036 struct Dummy : public EO<double>
+00037 {
+00038   typedef double Type;
+00039   Dummy(std::string _s="") : s(_s) {}
+00040 
+00041   void printOn(std::ostream & _os) const
+00042   {
+00043     EO<double>::printOn(_os);
+00044     _os << " - " << s ;
+00045   }
+00046 
+00047   std::string s;
+00048 };
+00049 
+00050 typedef Dummy EOT;
+00051 
+00052 unsigned int pSize;      // global to be used as marker in the fitness
+00053 
+00054 // DEFINITIONS of the eoOps
+00055 class monop : public eoMonOp<EOT>
+00056 {
+00057   public :
+00058   monop(char * _sig){sig=_sig;}
+00059     bool operator()(EOT& _eo)
+00060     {
+00061       _eo.s = sig + "(" + _eo.s + ")";
+00062       _eo.fitness(_eo.fitness()+pSize);
+00063       return false;
+00064     }
+00065   std::string className() const {return sig;}
+00066     private:
+00067     std::string sig;
+00068 };
+00069 
+00070 class binop: public eoBinOp<EOT>
+00071 {
+00072   public :
+00073     bool operator()(EOT& _eo1, const EOT& _eo2)
+00074     {
+00075       _eo1.s = "bin(" + _eo1.s + "," + _eo2.s + ")";
+00076       double f= (_eo1.fitness()+_eo2.fitness()) * pSize;
+00077       _eo1.fitness(_eo1.fitness()+f);
+00078       return false;
+00079     }
+00080   std::string className() const {return "binop";}
+00081 };
+00082 
+00083 class quadop: public eoQuadOp<EOT>
+00084 {
+00085   public :
+00086   std::string className() const {return "quadop";}
+00087     bool operator()(EOT& a, EOT& b)
+00088     {
+00089       EOT oi = a;
+00090       EOT oj = b;
+00091 
+00092       a.s = "quad1(" + oi.s + "," + oj.s + ")";
+00093       b.s = "quad2(" + oj.s + "," + oi.s + ")";
+00094       double f= (a.fitness()+b.fitness()+2*pSize) * pSize;
+00095       a.fitness(a.fitness()+f);
+00096       b.fitness(b.fitness()+f);
+00097       return false;
+00098     }
+00099 };
+00100 // an eoQuadOp that does nothing
+00101 class quadClone: public eoQuadOp<EOT>
+00102 {
+00103   public :
+00104   std::string className() const {return "quadclone";}
+00105     bool operator()(EOT& , EOT& ) {return false;}
+00106 };
+00107 
+00108 // User defined General Operator... adapted from Marc's example
+00109 
+00110 class one2threeOp : public eoGenOp<EOT> // :-)
+00111 {
+00112   public:
+00113     unsigned max_production(void) { return 3; }
+00114 
+00115     void apply(eoPopulator<EOT>& _plop)
+00116     {
+00117       EOT& eo = *_plop; // select the guy
+00118 
+00119       ++_plop; // advance
+00120       _plop.insert("v(" + eo.s + ", 1)");
+00121       ++_plop;
+00122       _plop.insert("v(" + eo.s + ", 2)");
+00123       eo.s  =  "v(" + eo.s + ", 0)"; // only now change the thing
+00124       // oh right, and invalidate fitnesses
+00125     }
+00126   virtual std::string className() const {return "one2threeOp";}
+00127 };
+00128 
+00129 
+00130 class two2oneOp : public eoGenOp<EOT> // :-)
+00131 {
+00132   public:
+00133     unsigned max_production(void) { return 1; }
+00134 
+00135     void apply(eoPopulator<EOT>& _plop)
+00136     {
+00137       EOT& eo = *_plop; // select the guy
+00138       const EOT& eo2 = _plop.select();
+00139       eo.s  =  "221(" + eo.s + ", " + eo2.s + ")";
+00140       // oh right, and invalidate fitnesses
+00141     }
+00142   virtual std::string className() const {return "two2oneOp";}
+00143 };
+00144 
+00145 class three2threeOp : public eoGenOp<EOT> // :-)
+00146 {
+00147   public:
+00148     unsigned max_production(void) { return 3; }
+00149 
+00150     void apply(eoPopulator<EOT>& _plop)
+00151     {
+00152       EOT& eo1 = *_plop; // select 1st guy
+00153       EOT& eo2 = *++_plop; // select 2nd guy
+00154       EOT& eo3 = *++_plop; // select 3rd guy
+00155       EOT a = eo1;
+00156       EOT b = eo2;
+00157       EOT c = eo3;
+00158       std::cout << "les selectionnes: a=" << a << " et b=" << b << " et c=" << c << std::endl;
+00159       eo1.s  =  "323-1(" + a.s + ", " + b.s + ", " + c.s + ")";
+00160       eo2.s  =  "323-2(" + a.s + ", " + b.s + ", " + c.s + ")";
+00161       eo3.s  =  "323-3(" + a.s + ", " + b.s + ", " + c.s + ")";
+00162       // oh right, and invalidate fitnesses
+00163       std::cout << "les enfants: a=" << eo1 << " et b=" << eo2 << " et c=" << eo3 << std::endl;
+00164     }
+00165   virtual std::string className() const {return "three2threeOp";}
+00166 };
+00167 
+00168 
+00169 // dummy intialization. Re-init if no pSize, resize first if pSize
+00170 void init(eoPop<Dummy> & _pop, unsigned _pSize)
+00171 {
+00172   if (_pSize)
+00173     {
+00174       _pop.resize(_pSize);
+00175     }
+00176   else
+00177     {
+00178       throw std::runtime_error("init pop with 0 size");
+00179     }
+00180   for (unsigned i=0; i<_pSize; i++)
+00181     {
+00182         std::ostringstream os;
+00183       os << i << std::ends;
+00184       _pop[i] = Dummy(os.str());
+00185       _pop[i].fitness(i);
+00186     }
+00187 }
+00188 
+00189 // ok, now for the real work
+00190 int the_main(int argc, char **argv)
+00191 {
+00192 
+00193   eoParser parser(argc, argv);
+00194   eoValueParam<unsigned int> parentSizeParam = parser.createParam(unsigned(10), "parentSize", "Parent size",'P');
+00195     pSize = parentSizeParam.value(); // global variable
+00196 
+00197     eoValueParam<uint32_t> seedParam(time(0), "seed", "Random number seed", 'S');
+00198     parser.processParam( seedParam );
+00199     eo::rng.reseed(seedParam.value());
+00200 
+00201    // do the following AFTER ALL PARAMETERS HAVE BEEN PROCESSED
+00202    // i.e. in case you need parameters somewhere else, postpone these
+00203     if (parser.userNeedsHelp())
+00204       {
+00205         parser.printHelp(std::cout);
+00206         exit(1);
+00207       }
+00208 
+00210   monop mon("mon1");
+00211   monop clone("clone");
+00212   binop bin;
+00213   quadop quad;
+00214   quadClone quadclone;
+00215 
+00216   // our own operator
+00217   one2threeOp o2t;
+00218   two2oneOp t2o;
+00219   three2threeOp t2t;
+00220 
+00221 
+00222   // a selector
+00223   eoDetTournamentSelect<EOT> select;
+00224   // and a recognizable selector for testing the inbedded selector mechanism
+00225   eoBestSelect<EOT> selectBest;
+00226 
+00227   // proportional selection between quad and bin
+00228   // so we either do a quad or a bin
+00229   eoProportionalOp<EOT> pOp;
+00230   pOp.add(quad, 0.1);
+00231   pOp.add(bin, 0.1);
+00232 
+00233   // sequential selection between pOp and mon
+00234   eoSequentialOp<EOT> sOp;
+00235   sOp.add(pOp, 0.9);
+00236   sOp.add(mon, 0.1);
+00237 
+00238   // with one2three op
+00239   eoSequentialOp<EOT> sOp2;
+00240   sOp2.add(o2t, 1);
+00241   //  sOp2.add(quad, 1);
+00242 
+00243   // with three2three op
+00244   eoSequentialOp<EOT> sOp3;
+00245   sOp3.add(t2t, 1);
+00246 
+00247 //   eoSequentialOp<EOT> sOp3;
+00248 //   sOp3.add(t2o, 1);
+00249 //   sOp3.add(bin, 1);
+00250 //   sOp3.add(quad, 1);
+00251   // try adding quads and bins to see what results you'll get
+00252 
+00253   // now a sequential selection that is a simple "addition"
+00254   eoSequentialOp<EOT> sOpQuadPlusMon;
+00255   sOpQuadPlusMon.add(quad, 1);
+00256   sOpQuadPlusMon.add(mon, 1);
+00257 
+00258   // this corresponds
+00259   eoProportionalOp<EOT> pOpSAGLike;
+00260   pOpSAGLike.add(sOpQuadPlusMon, 0.24);
+00261   pOpSAGLike.add(quad, 0.56);
+00262   pOpSAGLike.add(mon, 0.06);
+00263   pOpSAGLike.add(clone, 0.14);
+00264 
+00265   // init
+00266   eoPop<EOT> pop;
+00267   eoPop<EOT> offspring;
+00268 
+00269   init(pop, pSize);
+00270 // sort pop so seqPopulator is identical to SelectPopulator(SequentialSelect)
+00271   pop.sort();
+00272   std::cout << "Population initiale\n" << pop << std::endl;
+00273 
+00274   // To simulate SGA: first a prop between quadOp and quadClone
+00275   eoProportionalOp<EOT> pSGAOp;
+00276   pSGAOp.add(quad, 0.8);
+00277   pSGAOp.add(quadclone, 0.2);
+00278   // sequential selection between pSGAOp and mon
+00279   eoSequentialOp<EOT> virtualSGA;
+00280   virtualSGA.add(pSGAOp, 1.0);
+00281   virtualSGA.add(mon, 0.3);
+00282 
+00283   eoSeqPopulator<EOT> popit(pop, offspring);  // no selection, a copy of pop
+00284 
+00285   // until we filled a new population
+00286   try
+00287     {
+00288      while (offspring.size() < pop.size())
+00289            {
+00290              virtualSGA(popit);
+00291              std::cout << "SeqPopulator boucle et incremente\n";
+00292        ++popit;
+00293            }
+00294     }
+00295   catch(eoPopulator<EOT>::OutOfIndividuals&)
+00296     {
+00297       std::cout << "Warning: not enough individuals to handle\n";
+00298     }
+00299 
+00300 
+00301   std::swap(pop, offspring);
+00302   offspring.clear();
+00303 
+00304   // ok, now print
+00305   std::cout << "Apres virtualSGA \n" << pop << std::endl;
+00306   init(pop, pSize);
+00307 
+00308   std::cout << "=========================================================\n";
+00309   std::cout << "Now the eoSelectPopulator version !" << std::endl;
+00310 
+00311   eoSequentialSelect<EOT> seqSelect;
+00312   //   select.init(); should be sorted out: is it the setup method???
+00313   eoSelectivePopulator<EOT> it_step3(pop, offspring, seqSelect);
+00314 
+00315   while (offspring.size() < 2*pop.size())
+00316   {
+00317     virtualSGA(it_step3);
+00318              std::cout << "SelectPopulator boucle et incremente\n";
+00319     ++it_step3;
+00320   }
+00321 
+00322   std::swap(pop, offspring);
+00323   offspring.clear();
+00324 
+00325     // ok, now print
+00326   std::cout << "Apres SGA-like eoSelectivePopulator\n" << pop << std::endl;
+00327 
+00328   std::cout << "=========================================================\n";
+00329   std::cout << "Now the pure addition !" << std::endl;
+00330 
+00331   init(pop, pSize);
+00332   eoSelectivePopulator<EOT> it_step4(pop, offspring, seqSelect);
+00333   while (offspring.size() < 2*pop.size())
+00334   {
+00335     sOpQuadPlusMon(it_step4);
+00336     ++it_step4;
+00337   }
+00338 
+00339   std::swap(pop, offspring);
+00340   offspring.clear();
+00341 
+00342     // ok, now print
+00343   std::cout << "Apres Quad+Mon ds un eoSelectivePopulator\n" << pop << std::endl;
+00344 
+00345   // On teste 1->3
+00346   init(pop, pSize);
+00347   eoSelectivePopulator<EOT> it_step5(pop, offspring, seqSelect);
+00348   while (offspring.size() < 2*pop.size())
+00349   {
+00350     sOp2(it_step5);
+00351     ++it_step5;
+00352   }
+00353 
+00354   std::swap(pop, offspring);
+00355   offspring.clear();
+00356 
+00357     // ok, now print
+00358   std::cout << "Apres 1->3 seul ds un eoSelectivePopulator\n" << pop << std::endl;
+00359 
+00360   // On teste 3->3
+00361   init(pop, pSize);
+00362   eoSelectivePopulator<EOT> it_step6(pop, offspring, seqSelect);
+00363   while (offspring.size() < 2*pop.size())
+00364   {
+00365     sOp3(it_step6);
+00366     ++it_step6;
+00367   }
+00368 
+00369   std::swap(pop, offspring);
+00370   offspring.clear();
+00371 
+00372     // ok, now print
+00373   std::cout << "Apres 3->3 seul ds un eoSelectivePopulator\n" << pop << std::endl;
+00374 
+00375 
+00376   return 1;
+00377 }
+00378 
+00379 int main(int argc, char **argv)
+00380 {
+00381     try
+00382     {
+00383         the_main(argc, argv);
+00384     }
+00385     catch(std::exception& e)
+00386     {
+00387         std::cout << "Exception: " << e.what() << std::endl;
+00388     }
+00389 
+00390 }
+00391 
+00392 /*
+00393 If you want to build an SGA, you will need a copying quad op:
+00394 
+00395 class quadclone : ...
+00396 {
+00397   operator(EOT& a, EOT& b)
+00398   {
+00399     // do nothing
+00400   }
+00401 
+00402 }
+00403 
+00404 Then the SGA operator will look like:
+00405 
+00406 quadop quad;
+00407 guadclone clone;
+00408 
+00409 ProportionalGenOp pOp;
+00410 pOp.add(quad, 0.8);
+00411 pOp.add(clone, 0.2); // so 80% xover rate
+00412 
+00413 SequentialGenOp sOp;
+00414 sOp.add(pOp, 1,0); // always try a xover (clone 20%)
+00415 sOp.add(mut, 0.1); // low mutation rate
+00416 
+00417 will result in an algorithm with:
+00418 
+00419 p_xover = 0.8
+00420 p_mut   = 0.1;
+00421 
+00422 p_reproduction = 0.2 * 0.9 = 0.18
+00423 
+00424 this does not add up to 1 because xover and mutation can be applied to a single indi
+00425 
+00426 So what do you think?
+00427 
+00428 */
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_non_uniform_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_non_uniform_8cpp-source.html
new file mode 100644
index 000000000..18b0974be
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_non_uniform_8cpp-source.html
@@ -0,0 +1,46 @@
+
+
+EO: t-eoNonUniform.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoNonUniform.cpp
    00001 //-----------------------------------------------------------------------------
+00002 // t-eoNonUniform.cc
+00003 //-----------------------------------------------------------------------------
+00004 
+00005 #include <iostream>      
+00006 #include <eo>
+00007 
+00008 //-----------------------------------------------------------------------------
+00009 
+00010 main()
+00011 {
+00012   eoNonUniform nu(1000);
+00013 
+00014   std::cout << "----------------------------------------------------------" << std::endl
+00015        << "nu.step() = " << nu.step()
+00016        << "\t nu.num_step() = " << nu.num_step() << std::endl
+00017        << "----------------------------------------------------------" << std::endl;
+00018   
+00019   eoLinear l1(0, 1, nu), l2(1, 0, nu);
+00020   eoNegExp2 n1(0.1, 8, nu), n2(0.75, 3, nu);
+00021   
+00022   for (; nu; ++nu)
+00023     {      
+00024       std::cout << nu.step() 
+00025            << "\t" << l1() << "\t" << l2()
+00026            << "\t" << n1() << "\t" << n2()  
+00027            << std::endl;
+00028     }
+00029 }
+00030 
+00031 //-----------------------------------------------------------------------------
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_p_b_i_l_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_p_b_i_l_8cpp-source.html
new file mode 100644
index 000000000..bcceec5c0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_p_b_i_l_8cpp-source.html
@@ -0,0 +1,146 @@
+
+
+EO: t-eoPBIL.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoPBIL.cpp
    00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // t-eoPBIL.cpp
+00005 // (c) Marc Schoenauer, 2001
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: Marc.Schoenauer@inria.fr
+00022  */
+00023 //-----------------------------------------------------------------------------
+00024 
+00027 #include <iostream>
+00028 #include <eo>
+00029 #include <ga/make_ga.h>
+00030 #include "binary_value.h"
+00031 #include <apply.h>
+00032 #include <ga/eoPBILDistrib.h>
+00033 #include <ga/eoPBILOrg.h>
+00034 #include <ga/eoPBILAdditive.h>
+00035 #include <eoSimpleEDA.h>
+00036 
+00037 using namespace std;
+00038 
+00039 typedef eoBit<double> Indi;
+00040 
+00041 // instanciating the outside subroutine that creates the distribution
+00042 #include "ga/make_PBILdistrib.h"
+00043 eoPBILDistrib<Indi> & make_PBILdistrib(eoParser& _parser, eoState&_state, Indi _eo)
+00044 {
+00045   return do_make_PBILdistrib(_parser, _state, _eo);
+00046 }
+00047 
+00048 // instanciating the outside subroutine that creates the update rule
+00049 #include "ga/make_PBILupdate.h"
+00050 eoDistribUpdater<Indi> & make_PBILupdate(eoParser& _parser, eoState&_state, Indi _eo)
+00051 {
+00052   return do_make_PBILupdate(_parser, _state, _eo);
+00053 }
+00054 
+00055 
+00056 int main(int argc, char* argv[])
+00057 {
+00058 
+00059   try
+00060   {
+00061   eoParser parser(argc, argv);  // for user-parameter reading
+00062 
+00063   eoState state;    // keeps all things allocated
+00064 
+00067 
+00068   // The evaluation fn - encapsulated into an eval counter for output
+00069   eoEvalFuncPtr<Indi, double> mainEval( binary_value<Indi>);
+00070   eoEvalFuncCounter<Indi> eval(mainEval);
+00071 
+00072   // COnstruction of the distribution
+00073   eoPBILDistrib<Indi> & distrib = make_PBILdistrib(parser, state, Indi());
+00074   // and the update rule
+00075   eoDistribUpdater<Indi> & update = make_PBILupdate(parser, state, Indi());
+00076 
+00079 
+00080   // stopping criteria
+00081   eoContinue<Indi> & term = make_continue(parser, state, eval);
+00082   // output
+00083   eoCheckPoint<Indi> & checkpoint = make_checkpoint(parser, state, eval, term);
+00084 
+00085   // add a graphical output for the distribution
+00086   // first, get the direname from the parser
+00087   //    it has been enetered in make_checkoint
+00088 
+00089   eoParam* ptParam = parser.getParamWithLongName(string("resDir"));
+00090   eoValueParam<string>* ptDirNameParam = dynamic_cast<eoValueParam<string>*>(ptParam);
+00091   if (!ptDirNameParam)  // not found
+00092     throw runtime_error("Parameter resDir not found where it was supposed to be");
+00093 
+00094   // now create the snapshot monitor
+00095   eoValueParam<bool>& plotDistribParam = parser.getORcreateParam(false, "plotDistrib",
+00096                                                                  "Plot Distribution", '\0',
+00097                                                                  "Output - Graphical");
+00098     if (plotDistribParam.value())
+00099       {
+00100         unsigned frequency=1;           // frequency of plots updates
+00101         eoGnuplot1DSnapshot *distribSnapshot = new eoGnuplot1DSnapshot(ptDirNameParam->value(),
+00102                                                                        frequency, "distrib");
+00103         state.storeFunctor(distribSnapshot);
+00104         // add the distribution (it is an eoValueParam<vector<double> >)
+00105         distribSnapshot->add(distrib);
+00106         // and of course add it to the checkpoint
+00107         checkpoint.add(*distribSnapshot);
+00108       }
+00109 
+00110   // the algorithm: EDA
+00111     // don't know where else to put the population size!
+00112   unsigned popSize = parser.getORcreateParam(unsigned(100), "popSize",
+00113                                              "Population Size", 'P', "Algorithm").value();
+00114   eoSimpleEDA<Indi> eda(update, eval, popSize, checkpoint);
+00115 
+00118   // to be called AFTER all parameters have been read!!!
+00119   make_help(parser);
+00120 
+00123 
+00124   eda(distrib); // run the eda
+00125 
+00126   std::cout << "Final Distribution\n";
+00127   distrib.printOn(std::cout);
+00128   std::cout << std::endl;
+00129 
+00130   // wait - for graphical output
+00131     if (plotDistribParam.value())
+00132       {
+00133         string foo;
+00134         cin >> foo;
+00135       }
+00136   }
+00137   catch(std::exception& e)
+00138   {
+00139     std::cout << e.what() << std::endl;
+00140   }
+00141 }
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_pareto_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_pareto_8cpp-source.html
new file mode 100644
index 000000000..0f5c27d8c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_pareto_8cpp-source.html
@@ -0,0 +1,259 @@
+
+
+EO: t-eoPareto.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoPareto.cpp
    00001 
+00002 #include <eo>
+00003 
+00004 //#include <utils/eoMOFitnessStat.h>
+00005 #include <eoNDSorting.h>
+00006 #include <eoParetoFitness.h>
+00007 
+00008 using namespace std;
+00009 
+00010 // Look: overloading the maximization without overhead (thing can be inlined)
+00011 class MinimizingFitnessTraits : public eoParetoFitnessTraits
+00012 {
+00013   public :
+00014   static bool maximizing(int) { return false; }
+00015 };
+00016 
+00017 typedef eoParetoFitness<MinimizingFitnessTraits> fitness_type;
+00018 
+00019 const unsigned chromsize=3;
+00020 const double minval = -5;
+00021 const double maxval = 5;
+00022 
+00023 struct eoDouble : public EO<fitness_type>
+00024 {
+00025   double value[chromsize];
+00026 };
+00027 
+00028 class Mutate : public eoMonOp<eoDouble>
+00029 {
+00030   bool operator()(eoDouble& _eo)
+00031   {
+00032     for (unsigned i = 0; i < chromsize; ++i)
+00033     {
+00034       if (rng.flip(1./chromsize))
+00035         _eo.value[i] += rng.normal() * 0.1 * _eo.value[i];
+00036 
+00037       if (_eo.value[i] < minval)
+00038         _eo.value[i] = minval;
+00039       else if (_eo.value[i] > maxval)
+00040         _eo.value[i] = maxval;
+00041     }
+00042 
+00043     return true;
+00044   }
+00045 };
+00046 
+00047 class Eval : public eoEvalFunc<eoDouble>
+00048 {
+00049   void operator()(eoDouble& _eo)
+00050   {
+00051     vector<double> x(_eo.value, _eo.value + chromsize);
+00052     fitness_type f;
+00053 
+00054     for (unsigned i = 0; i < chromsize; ++i)
+00055     {
+00056       if (i < chromsize-1)
+00057       {
+00058         f[0] += -10.0 * exp(-0.2 * sqrt(x[i]*x[i] + x[i+1]*x[i+1]));
+00059       }
+00060 
+00061       f[1] += pow(fabs(x[i]), 0.8) + 5 * pow(sin(x[i]),3.);
+00062     }
+00063 
+00064     _eo.fitness(f);
+00065   }
+00066 };
+00067 
+00068 class Init : public eoInit<eoDouble>
+00069 {
+00070   void operator()(eoDouble& _eo)
+00071   {
+00072     _eo.value[0] = rng.uniform();
+00073 
+00074     double range = maxval - minval;
+00075 
+00076     for (unsigned i = 1; i < chromsize; ++i)
+00077       _eo.value[i] = rng.uniform() * range + minval;
+00078     _eo.invalidate();
+00079   }
+00080 };
+00081 
+00086 template <class EOT, class WorthT = double>
+00087 class eoNDPlusReplacement : public eoReplacement<EOT>
+00088 {
+00089 public:
+00090 
+00091     // using eoNDPlusReplacement< EOT, WorthT >::first;
+00092 
+00093     eoNDPlusReplacement(eoPerf2Worth<EOT, WorthT>& _perf2worth)
+00094         : perf2worth(_perf2worth)
+00095         {}
+00096 
+00097     struct WorthPair : public pair<WorthT, const EOT*>
+00098     {
+00099         bool operator<(const WorthPair& other) const
+00100             { return other.first < this->first; }
+00101     };
+00102 
+00103 
+00104   void operator()(eoPop<EOT>& _parents, eoPop<EOT>& _offspring)
+00105   {
+00106     unsigned sz = _parents.size();
+00107     _parents.reserve(_parents.size() + _offspring.size());
+00108     std::copy(_offspring.begin(), _offspring.end(), back_inserter(_parents));
+00109 
+00110     // calculate worths
+00111     perf2worth(_parents);
+00112     perf2worth.sort_pop(_parents);
+00113     perf2worth.resize(_parents, sz);
+00114 
+00115     _offspring.clear();
+00116   }
+00117 
+00118 private :
+00119     eoPerf2Worth<EOT, WorthT>& perf2worth;
+00120 };
+00121 
+00122 template <class EOT>
+00123 eoPerf2Worth<EOT, double>& make_perf2worth(eoParser& parser, eoState& state)
+00124 {
+00125 
+00126   unsigned what = parser.createParam(unsigned(1), "perf2worth", "worth mapping indicator : \n\t \
+00127                   0: non_dominated sorting \n\t\
+00128                   1: non_dominated sorting 2 \n\t\
+00129                   2: simple ranking \n\t", 'w').value();
+00130 
+00131   switch (what)
+00132   {
+00133     case 1 : return state.storeFunctor(new eoNDSorting_II<EOT>());
+00134     case 2 :
+00135     {
+00136       eoDominanceMap<eoDouble>&  dominance = state.storeFunctor(new eoDominanceMap<EOT>);
+00137       return state.storeFunctor(new eoParetoRanking<EOT>(dominance));
+00138     }
+00139   }
+00140   //default
+00141 
+00142   if (what > 2)
+00143   {
+00144     std::cout << "Warning, need an integer < 3 for perf2worth" << std::endl;
+00145     // should actually set parser flag, but I don't care
+00146   }
+00147 
+00148   return state.storeFunctor(new eoNDSorting_I<EOT>(0.5));
+00149 }
+00150 
+00151 template <class EOT>
+00152 eoSelectOne<EOT>& make_selector(eoParser& parser, eoState& state, eoPerf2Worth<EOT, double>& perf2worth)
+00153 {
+00154   unsigned tournamentsize = parser.createParam(unsigned(2), "tournament_size", "Tournament Size", 't').value();
+00155   double stochtour = parser.createParam(unsigned(0.95), "tournament_prob", "Probability in stochastic tournament").value();
+00156 
+00157   switch (parser.createParam(unsigned(0), "selector", "Which selector (too lazy to explain: use the source)", 's').value())
+00158   {
+00159     case 1 : return state.storeFunctor(new eoStochTournamentWorthSelect<eoDouble>(perf2worth, stochtour));
+00160     case 2 : return state.storeFunctor(new eoRouletteWorthSelect<eoDouble>(perf2worth));
+00161     case 3 : return state.storeFunctor(new eoRandomSelect<EOT>);
+00162   }
+00163   // default
+00164 
+00165   return state.storeFunctor(new eoDetTournamentWorthSelect<eoDouble>(perf2worth, tournamentsize));
+00166 }
+00167 
+00168 // Test pareto dominance and perf2worth, and while you're at it, test the eoGnuPlot monitor as well
+00169 void the_main(int argc, char* argv[])
+00170 {
+00171   Init init;
+00172   Eval eval;
+00173   Mutate mutate;
+00174 
+00175   eoParser parser(argc, argv);
+00176   eoState state;
+00177 
+00178   unsigned num_gen  = parser.createParam(unsigned(50), "num_gen", "number of generations to run", 'g').value();
+00179   unsigned pop_size = parser.createParam(unsigned(100), "pop_size", "population size", 'p').value();
+00180   eoPop<eoDouble> pop(pop_size, init);
+00181 
+00182   // Look, a factory function
+00183   eoPerf2Worth<eoDouble, double>& perf2worth = make_perf2worth<eoDouble>(parser, state);
+00184 
+00185   // Look: another factory function, now for selection
+00186   eoSelectOne<eoDouble>& select = make_selector<eoDouble>(parser, state, perf2worth);
+00187 
+00188   // One general operator
+00189   eoProportionalOp<eoDouble> opsel;
+00190   opsel.add(mutate, 1.0);
+00191 
+00192   // the breeder
+00193   eoGeneralBreeder<eoDouble> breeder(select, opsel);
+00194 
+00195   // replacement
+00196   eoNDPlusReplacement<eoDouble> replace(perf2worth);
+00197 
+00198   unsigned long generation = 0;
+00199   eoGenContinue<eoDouble> gen(num_gen, generation);
+00200   eoCheckPoint<eoDouble> cp(gen);
+00201 
+00202   eoMOFitnessStat<eoDouble> fitness0(0, "FirstObjective");
+00203   eoMOFitnessStat<eoDouble> fitness1(1, "SecondObjective");
+00204 
+00205   cp.add(fitness0);
+00206   cp.add(fitness1);
+00207 
+00208   eoGnuplot1DSnapshot snapshot("pareto");
+00209   //snapshot.with(eoGnuplot::Points(3));
+00210 
+00211   cp.add(snapshot);
+00212 
+00213   snapshot.add(fitness0);
+00214   snapshot.add(fitness1);
+00215 
+00216   // the algo
+00217   eoEasyEA<eoDouble> ea(cp, eval, breeder, replace);
+00218 
+00219   if (parser.userNeedsHelp())
+00220   {
+00221     parser.printHelp(std::cout);
+00222     return;
+00223   }
+00224 
+00225   apply<eoDouble>(eval, pop);
+00226   ea(pop);
+00227 }
+00228 
+00229 
+00230 int main(int argc, char* argv[])
+00231 {
+00232   try
+00233   {
+00234     the_main(argc, argv);
+00235   }
+00236   catch (std::exception& e)
+00237   {
+00238     std::cout << "Exception thrown: " << e.what() << std::endl;
+00239     throw e; // make sure it does not pass the test
+00240   }
+00241 }
+00242 
+00243 
+00244 
+00245 // Local Variables:
+00246 // mode: C++
+00247 // c-file-style: "Stroustrup"
+00248 // End:
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_pareto_fitness_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_pareto_fitness_8cpp-source.html
new file mode 100644
index 000000000..c101cc5c9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_pareto_fitness_8cpp-source.html
@@ -0,0 +1,207 @@
+
+
+EO: t-eoParetoFitness.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoParetoFitness.cpp
    00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // t-eoParetoFitness.cpp
+00005 // (c) Maarten Keijzer
+00006 /*
+00007     This library is free software; you can redistribute it and/or
+00008     modify it under the terms of the GNU Lesser General Public
+00009     License as published by the Free Software Foundation; either
+00010     version 2 of the License, or (at your option) any later version.
+00011 
+00012     This library is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00015     Lesser General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU Lesser General Public
+00018     License along with this library; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: mak@dhi.dk
+00022 
+00023 30/01/02 - MS - Added the eoVariableParetoTraits - and the compare Fn
+00024  */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #include <cassert>
+00028 #include <iostream>
+00029 
+00030 #include "eoParetoFitness.h"
+00031 
+00032 using namespace std;
+00033 
+00036 class MinimizingTraits : public eoParetoFitnessTraits
+00037 {
+00038 public :
+00039 
+00040   static bool maximizing(int) { return false; }
+00041 };
+00042 
+00043 template <class F>
+00044 void compare(F & _eo1, F & _eo2)
+00045 {
+00046   if (_eo1.dominates(_eo2))
+00047     std::cout << _eo1 << " dominates " << _eo2 << std::endl;
+00048   else if (_eo2.dominates(_eo1))
+00049     std::cout << _eo2 << " dominates " << _eo1 << std::endl;
+00050   else
+00051     std::cout << "None of " << _eo1 << " and " << _eo2 << "dominates the other" << std::endl;
+00052   return;
+00053 }
+00054 
+00055 int main()
+00056 {
+00057   typedef eoParetoFitness<> MaxFitness;
+00058   typedef eoParetoFitness<MinimizingTraits> MinFitness;
+00059 
+00060   typedef eoParetoFitness<eoVariableParetoTraits> VarFitness;
+00061 
+00062   try{
+00063 
+00064   MaxFitness f0;
+00065   f0[0] = 0.0;
+00066   f0[1] = 1.0;
+00067 
+00068   MaxFitness f1;
+00069   f1[0] = 1.0;
+00070   f1[1] = 0.0;
+00071 
+00072   MaxFitness f2;
+00073   f2[0] = 0.0;
+00074   f2[1] = 0.5;
+00075 
+00076   // now f0 should dominate f2;
+00077 
+00078   if (!f0.dominates(f2))
+00079   {
+00080     std::cout << f2 << " not dominated by " << f0;
+00081     throw;
+00082   }
+00083 
+00084   // f0 and f1 should not dominate each other
+00085 
+00086   if (f0.dominates(f1) || f1.dominates(f0))
+00087   {
+00088     std::cout << f0 << " and " << f1 << " dominate";
+00089     throw;
+00090   }
+00091 
+00092   if (! (f0 == f0))
+00093   {
+00094     std::cout << "f0 == f0 failed" << std::endl;
+00095     throw;
+00096   }
+00097 
+00098   // test ctors and such
+00099   MaxFitness f3 = f0;
+00100   f3[0] += 1e-9;
+00101 
+00102   // test tolerance
+00103   assert(f3 == f0);
+00104 
+00105   MinFitness m0;
+00106   MinFitness m1;
+00107   MinFitness m2;
+00108   MinFitness m3;
+00109 
+00110   m0[0] = 0.0;
+00111   m0[1] = 1.0;
+00112 
+00113   m1[0] = 1.0;
+00114   m1[1] = 0.0;
+00115 
+00116   m2[0] = 0.0;
+00117   m2[1] = 0.5;
+00118 
+00119   m3[0] = 0.5;
+00120   m3[1] = 0.5;
+00121 
+00122   //m2 should dominate m0
+00123   assert(m2.dominates(m0));
+00124 
+00125   assert(!m1.dominates(m0));
+00126   assert(!m0.dominates(m1));
+00127   assert(!m0.dominates(m2)); // (m2 < m0));
+00128   assert(m2.dominates(m3)); //m3 < m2);
+00129   assert(!m3.dominates(m2)); // (m2 < m3));
+00130   assert(m2.dominates(m3)); //m2 > m3);
+00131 
+00132 
+00134   // now the run-time set-able number of objectives
+00136 
+00137   std::cout << "On y va" << std::endl;
+00138 
+00139 
+00140   // setup fitness WARNING do not try to allocate any EO before that (runtime error)
+00141   vector<bool> b(2, true);
+00142   b[0]=true; 
+00143   b[1]=false;
+00144   VarFitness::setUp(2, b);
+00145   std::cout << "\nMAXimizing on Obj 0 and MINimizing on Obj 1\n";
+00146 
+00147   VarFitness mv0;
+00148   VarFitness mv1;
+00149   VarFitness mv2;
+00150   VarFitness mv3;
+00151 
+00152   mv0[0] = 0.0;
+00153   mv0[1] = 1.0;
+00154 
+00155   mv1[0] = 1.0;
+00156   mv1[1] = 0.0;
+00157 
+00158   mv2[0] = 0.0;
+00159   mv2[1] = 0.5;
+00160 
+00161   mv3[0] = 0.5;
+00162   mv3[1] = 0.5;
+00163 
+00164   compare <VarFitness>(mv0,mv1);
+00165   compare <VarFitness>(mv0,mv2);
+00166   compare <VarFitness>(mv0,mv3);
+00167   compare <VarFitness>(mv1,mv2);
+00168   compare <VarFitness>(mv1,mv3);
+00169   compare <VarFitness>(mv2,mv3);
+00170 
+00171   std::cout << "\nChanging now the min <-> max\n";
+00172   b[0]=false; 
+00173   b[1]=true;
+00174   VarFitness::setUp(2, b);
+00175   std::cout << "\nMINimizing on Obj 0 and MAXimizing on Obj 1\n";
+00176   compare <VarFitness>(mv0,mv1);
+00177   compare <VarFitness>(mv0,mv2);
+00178   compare <VarFitness>(mv0,mv3);
+00179   compare <VarFitness>(mv1,mv2);
+00180   compare <VarFitness>(mv1,mv3);
+00181   compare <VarFitness>(mv2,mv3);
+00182 
+00183   std::cout << "\nTesting WARNING\n";
+00184   b.resize(3);
+00185   b[0]=false; 
+00186   b[1]=true;
+00187   b[2]=true;
+00188   VarFitness::setUp(3, b);
+00189 
+00190   }
+00191   catch(std::exception& e)
+00192   {
+00193     std::cout << e.what() << std::endl;
+00194   }
+00195 
+00196 }
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_random_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_random_8cpp-source.html
new file mode 100644
index 000000000..8fd6c110f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_random_8cpp-source.html
@@ -0,0 +1,77 @@
+
+
+EO: t-eoRandom.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoRandom.cpp
    00001 /* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003     t-eoRandom.cpp
+00004       Test program for random generator
+00005 
+00006     (c) GeNeura Team, 1999
+00007 
+00008     This program is free software; you can redistribute it and/or modify
+00009     it under the terms of the GNU General Public License as published by
+00010     the Free Software Foundation; either version 2 of the License, or
+00011     (at your option) any later version.
+00012 
+00013     This program is distributed in the hope that it will be useful,
+00014     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00015     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00016     GNU General Public License for more details.
+00017 
+00018     You should have received a copy of the GNU General Public License
+00019     along with this program; if not, write to the Free Software
+00020     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00021 
+00022     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00023 
+00024 */
+00025 
+00030 //-----------------------------------------------------------------------------
+00031 
+00032 #include <iostream>   // cout
+00033 #include <fstream>  // ostrstream, istrstream
+00034 #include <utils/eoRndGenerators.h>         // eoBin
+00035 //#include <eoNormal.h>
+00036 //#include <eoNegExp.h>
+00037 
+00038 //-----------------------------------------------------------------------------
+00039 
+00040 int main() {
+00041   eoUniformGenerator<float> u1(-2.5,3.5);
+00042   eoUniformGenerator<double> u2(0.003, 0.05 );
+00043   eoUniformGenerator<unsigned long> u3( 10000U, 10000000U);
+00044 
+00045   try
+00046   { // throws an error
+00047     eoUniformGenerator<unsigned long> utest( 10000000U, 10000U);
+00048     throw; // if this succeeds something is wrong, make sure that that is noticed
+00049   }
+00050   catch (std::logic_error& e)
+00051   {
+00052     std::cout << e.what() << std::endl;
+00053   }
+00054 
+00055   std::ofstream os("t-eoRandom.out");
+00056 
+00057   for ( unsigned i = 0; i < 100; i ++)
+00058   {
+00059     os << u1() << "\t" << u2() << "\t" << u3() << std::endl;
+00060   }
+00061 
+00062   return 0; // to avoid VC++ complaints
+00063 
+00064 }
+00065 
+00066 //-----------------------------------------------------------------------------
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_real_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_real_8cpp-source.html
new file mode 100644
index 000000000..01fd9c28b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_real_8cpp-source.html
@@ -0,0 +1,79 @@
+
+
+EO: t-eoReal.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoReal.cpp
    00001 #include <iostream>
+00002 
+00003 #include <es/make_real.h>
+00004 #include "real_value.h"
+00005 #include <apply.h>
+00006 
+00007 using namespace std;
+00008 
+00009 int main(int argc, char* argv[])
+00010 {
+00011 
+00012   try
+00013   {
+00014   typedef eoReal<eoMinimizingFitness> EOT;
+00015 
+00016   eoParser parser(argc, argv);  // for user-parameter reading
+00017 
+00018   eoState state;    // keeps all things allocated
+00019 
+00022 
+00023   // The evaluation fn - encapsulated into an eval counter for output 
+00024   eoEvalFuncPtr<EOT, double, const std::vector<double>&> 
+00025                mainEval( real_value );
+00026   eoEvalFuncCounter<EOT> eval(mainEval);
+00027 
+00028   // the genotype - through a genotype initializer
+00029   eoRealInitBounded<EOT>& init = make_genotype(parser, state, EOT());
+00030 
+00031   // Build the variation operator (any seq/prop construct)
+00032   eoGenOp<EOT>& op = make_op(parser, state, init);
+00033 
+00036 
+00037   // initialize the population - and evaluate
+00038   // yes, this is representation indepedent once you have an eoInit
+00039   eoPop<EOT>& pop   = make_pop(parser, state, init);
+00040 
+00041   // stopping criteria
+00042   eoContinue<EOT> & term = make_continue(parser, state, eval);
+00043   // output
+00044   eoCheckPoint<EOT> & checkpoint = make_checkpoint(parser, state, eval, term);
+00045   // algorithm (need the operator!)
+00046   eoAlgo<EOT>& ea = make_algo_scalar(parser, state, eval, checkpoint, op);
+00047 
+00050   // to be called AFTER all parameters have been read!!!
+00051   make_help(parser);
+00052 
+00055   // evaluate intial population AFTER help and status in case it takes time
+00056   apply<EOT>(eval, pop);
+00057   // print it out
+00058   std::cout << "Initial Population\n";
+00059   pop.sortedPrintOn(std::cout);
+00060   std::cout << std::endl;
+00061 
+00062   run_ea(ea, pop); // run the ea
+00063 
+00064   std::cout << "Final Population\n";
+00065   pop.sortedPrintOn(std::cout);
+00066   std::cout << std::endl;
+00067   }
+00068   catch(std::exception& e)
+00069   {
+00070     std::cout << e.what() << std::endl;
+00071   }
+00072 }
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_replacement_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_replacement_8cpp-source.html
new file mode 100644
index 000000000..8e9b6022a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_replacement_8cpp-source.html
@@ -0,0 +1,238 @@
+
+
+EO: t-eoReplacement.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoReplacement.cpp
    00001 //-----------------------------------------------------------------------------
+00002 
+00003 // to avoid long name warnings
+00004 #ifdef _MSC_VER
+00005 #pragma warning(disable:4786)
+00006 #endif
+00007 
+00008 #include <stdexcept>  // runtime_error 
+00009 
+00010 //-----------------------------------------------------------------------------
+00011 // tt.cpp: 
+00012 //
+00013 //-----------------------------------------------------------------------------
+00014 
+00015 
+00016 // general
+00017 #include <eo>
+00018 //-----------------------------------------------------------------------------
+00019 
+00020 struct Dummy : public EO<double>
+00021 {
+00022     typedef double Type;
+00023   void printOn(std::ostream & _os) const
+00024   {
+00025       _os << " - ";
+00026       EO<double>::printOn(_os);
+00027   }
+00028 };
+00029 
+00030 
+00031 struct eoDummyPop : public eoPop<Dummy>
+00032 {
+00033 public :
+00034     eoDummyPop(int s=0) { resize(s); }
+00035 };
+00036 
+00037 //-----------------------------------------------------------------------------
+00038 
+00039 int the_main(int argc, char **argv)
+00040 { 
+00041   eoParser parser(argc, argv);
+00042   eoValueParam<unsigned int> parentSizeParam(10, "parentSize", "Parent size",'P');
+00043   parser.processParam( parentSizeParam );
+00044     unsigned int pSize = parentSizeParam.value();
+00045 
+00046   eoValueParam<unsigned int> offsrpringSizeParam(10, "offsrpringSize", "Offsrpring size",'O');
+00047   parser.processParam( offsrpringSizeParam );
+00048     unsigned int oSize = offsrpringSizeParam.value();
+00049 
+00050   eoValueParam<unsigned int> tournamentSizeParam(2, "tournamentSize", "Deterministic tournament size",'T');
+00051   parser.processParam( tournamentSizeParam );
+00052     unsigned int tSize = tournamentSizeParam.value();
+00053 
+00054   eoValueParam<double> tournamentRateParam(0.75, "tournamentRate", "Stochastic tournament rate",'R');
+00055   parser.processParam( tournamentRateParam );
+00056     double tRate = tournamentRateParam.value();
+00057 
+00058   eoValueParam<double> sParentsElitismRateParam(0.1, "sParentsElitismRateParam", "Strong elitism rate for parents",'E');
+00059   parser.processParam( sParentsElitismRateParam );
+00060     double sParentsElitismRate = sParentsElitismRateParam.value();
+00061 
+00062   eoValueParam<double> sParentsEugenismRateParam(0, "sParentsEugenismRateParam", "Strong Eugenism rate",'e');
+00063   parser.processParam( sParentsEugenismRateParam );
+00064     double sParentsEugenismRate = sParentsEugenismRateParam.value();
+00065 
+00066   eoValueParam<double> sOffspringElitismRateParam(0, "sOffspringElitismRateParam", "Strong elitism rate for parents",'E');
+00067   parser.processParam( sOffspringElitismRateParam );
+00068     double sOffspringElitismRate = sOffspringElitismRateParam.value();
+00069 
+00070   eoValueParam<double> sOffspringEugenismRateParam(0, "sOffspringEugenismRateParam", "Strong Eugenism rate",'e');
+00071   parser.processParam( sOffspringEugenismRateParam );
+00072     double sOffspringEugenismRate = sOffspringEugenismRateParam.value();
+00073 
+00074     if (parser.userNeedsHelp())
+00075       {
+00076         parser.printHelp(std::cout);
+00077         exit(1);
+00078       }
+00079 
+00080     unsigned i;
+00081 
+00082     std::cout << "Testing the replacements\nParents SIze = " << pSize 
+00083          << " and offspring size = " << oSize << std::endl;
+00084 
+00085     rng.reseed(42);
+00086 
+00087 
+00088     eoDummyPop orgParents(pSize);
+00089     eoDummyPop orgOffspring(oSize);
+00090 
+00091     // initialize so we can recognize them later!
+00092     for (i=0; i<pSize; i++)
+00093       orgParents[i].fitness(2*i+1);
+00094     for (i=0; i<oSize; i++)
+00095       orgOffspring[i].fitness(2*i);
+00096 
+00097 std::cout << "Initial parents (odd)\n" << orgParents << "\n And initial offsprings (even)\n" << orgOffspring << std::endl;
+00098 
+00099     // now the ones we're going to play with
+00100     eoDummyPop parents(0);
+00101     eoDummyPop offspring(0);
+00102 
+00103 // the replacement procedures under test
+00104     eoGenerationalReplacement<Dummy> genReplace;
+00105     eoPlusReplacement<Dummy> plusReplace;
+00106     eoEPReplacement<Dummy> epReplace(tSize);
+00107     eoCommaReplacement<Dummy> commaReplace;
+00108     eoWeakElitistReplacement<Dummy> weakElitistReplace(commaReplace);
+00109     // the SSGA replacements
+00110     eoSSGAWorseReplacement<Dummy> ssgaWorseReplace;
+00111     eoSSGADetTournamentReplacement<Dummy> ssgaDTReplace(tSize);
+00112     eoSSGAStochTournamentReplacement<Dummy> ssgaDSReplace(tRate);
+00113 
+00114     // here we go
+00115     // Generational
+00116     parents = orgParents;
+00117     offspring = orgOffspring;
+00118 
+00119     std::cout << "eoGenerationalReplacement\n";
+00120     std::cout << "=========================\n";
+00121     genReplace(parents, offspring);
+00122 std::cout << "Parents (originally odd)\n" << parents << "\n And offsprings (orogonally even\n" << offspring << std::endl;
+00123 
+00124     // Plus
+00125     parents = orgParents;
+00126     offspring = orgOffspring;
+00127 
+00128     std::cout << "eoPlusReplacement\n";
+00129     std::cout << "=================\n";
+00130     plusReplace(parents, offspring);
+00131 std::cout << "Parents (originally odd)\n" << parents << "\n And offsprings (originally even)\n" << offspring << std::endl;
+00132 
+00133     // EP (proche d'un PLUS
+00134     parents = orgParents;
+00135     offspring = orgOffspring;
+00136 
+00137     std::cout << "eoEPReplacement\n";
+00138     std::cout << "===============\n";
+00139     epReplace(parents, offspring);
+00140 std::cout << "Parents (originally odd)\n" << parents << "\n And offsprings (originally even)\n" << offspring << std::endl;
+00141 
+00142     // Comma
+00143     parents = orgParents;
+00144     offspring = orgOffspring;
+00145 
+00146     if (parents.size() > offspring.size() )
+00147         std::cout << "Skipping Comma Replacement, more parents than offspring\n";
+00148     else
+00149       {
+00150         std::cout << "eoCommaReplacement\n";
+00151         std::cout << "==================\n";
+00152         commaReplace(parents, offspring);
+00153         std::cout << "Parents (originally odd)\n" << parents << "\n And offsprings (originally even)\n" << offspring << std::endl;
+00154 
+00155         // Comma with weak elitism
+00156         parents = orgParents;
+00157         offspring = orgOffspring;
+00158 
+00159         std::cout << "The same, with WEAK elitism\n";
+00160         std::cout << "===========================\n";
+00161         weakElitistReplace(parents, offspring);
+00162         std::cout << "Parents (originally odd)\n" << parents << "\n And offsprings (originally even)\n" << offspring << std::endl;
+00163       }
+00164 
+00165         // preparing SSGA replace worse
+00166         parents = orgParents;
+00167         offspring = orgOffspring;
+00168 
+00169     if (parents.size() < offspring.size() )
+00170         std::cout << "Skipping all SSGA Replacements, more offspring than parents\n";
+00171     else
+00172       {
+00173         std::cout << "SSGA replace worse\n";
+00174         std::cout << "==================\n";
+00175         ssgaWorseReplace(parents, offspring);
+00176         std::cout << "Parents (originally odd)\n" << parents << "\n And offsprings (originally even)\n" << offspring << std::endl;
+00177 
+00178     // SSGA deterministic tournament
+00179         parents = orgParents;
+00180         offspring = orgOffspring;
+00181 
+00182         std::cout << "SSGA deterministic tournament\n";
+00183         std::cout << "=============================\n";
+00184         ssgaDTReplace(parents, offspring);
+00185         std::cout << "Parents (originally odd)\n" << parents << "\n And offsprings (originally even)\n" << offspring << std::endl;
+00186 
+00187     // SSGA stochastic tournament
+00188         parents = orgParents;
+00189         offspring = orgOffspring;
+00190 
+00191         std::cout << "SSGA stochastic tournament\n";
+00192         std::cout << "==========================\n";
+00193         ssgaDTReplace(parents, offspring);
+00194         std::cout << "Parents (originally odd)\n" << parents << "\n And offsprings (originally even)\n" << offspring << std::endl;
+00195       }
+00196 
+00197     // the general replacement
+00198     eoDeterministicSaDReplacement<Dummy> sAdReplace(sParentsElitismRate, sParentsEugenismRate, sOffspringElitismRate, sOffspringEugenismRate);// 10% parents survive
+00199 
+00200     parents = orgParents;
+00201     offspring = orgOffspring;
+00202 
+00203     std::cout << "General - strong elitism\n";
+00204     std::cout << "========================\n";
+00205     sAdReplace(parents, offspring);
+00206     std::cout << "Parents (originally odd)\n" << parents << "\n And offsprings (originally even)\n" << offspring << std::endl;
+00207 
+00208 
+00209     return 1;
+00210 }
+00211 
+00212 int main(int argc, char **argv)
+00213 {
+00214     try
+00215     {
+00216         the_main(argc, argv);
+00217     }
+00218     catch(std::exception& e)
+00219     {
+00220         std::cout << "Exception: " << e.what() << std::endl;
+00221     }
+00222 
+00223 }
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_roulette_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_roulette_8cpp-source.html
new file mode 100644
index 000000000..11bb2bc43
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_roulette_8cpp-source.html
@@ -0,0 +1,83 @@
+
+
+EO: t-eoRoulette.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoRoulette.cpp
    00001 
+00002 #include <eoPop.h>
+00003 #include <EO.h>
+00004 #include <eoProportionalSelect.h>
+00005 #include <eoStochasticUniversalSelect.h>
+00006 
+00007 class TestEO : public EO<double> { public: unsigned index; };
+00008 
+00009 using namespace std;
+00010 
+00011 template <class Select>
+00012 int test_select()
+00013 {
+00014     vector<double> probs(4);
+00015     probs[0] = 0.1;
+00016     probs[1] = 0.4;
+00017     probs[2] = 0.2;
+00018     probs[3] = 0.3;
+00019 
+00020     vector<double> counts(4,0.0);
+00021 
+00022     // setup population
+00023     eoPop<TestEO> pop;
+00024     for (unsigned i = 0; i < probs.size(); ++i)
+00025     {
+00026         pop.push_back( TestEO());
+00027         pop.back().fitness( probs[i] * 2.1232 ); // some number to check scaling
+00028         pop.back().index = i;
+00029     }
+00030 
+00031     Select select;
+00032     
+00033     unsigned ndraws = 10000;
+00034     
+00035     for (unsigned i = 0; i < ndraws; ++i)
+00036     {
+00037         const TestEO& eo = select(pop);
+00038         
+00039         counts[eo.index]++;
+00040     }
+00041 
+00042     cout << "Threshold = " << 1./sqrt(double(ndraws)) << endl;
+00043     
+00044     for (unsigned i = 0; i < 4; ++i)
+00045     {
+00046         cout << counts[i]/ndraws << ' ';
+00047     
+00048         double c = counts[i]/ndraws;
+00049 
+00050         if (fabs(c - probs[i]) > 1./sqrt((double)ndraws)) {
+00051             cout << "ERROR" << endl;
+00052             return 1;
+00053         }
+00054     }
+00055    
+00056     cout << endl;
+00057     return 0;
+00058 }
+00059 
+00060 int main()
+00061 {
+00062     rng.reseed(44);
+00063 
+00064     if (test_select<eoProportionalSelect<TestEO> >()) return 1;
+00065     
+00066     return test_select<eoStochasticUniversalSelect<TestEO> >();
+00067 }
+00068 
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_s_s_g_a_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_s_s_g_a_8cpp-source.html
new file mode 100644
index 000000000..68c4fa578
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_s_s_g_a_8cpp-source.html
@@ -0,0 +1,132 @@
+
+
+EO: t-eoSSGA.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoSSGA.cpp
    00001 #include <eo>
+00002 
+00003 // tests a Steady State GA
+00004 
+00005 // Needed to define this breeder, maybe make it a breeder
+00006 template <class EOT>
+00007 class eoBreedOne : public eoBreed<EOT>
+00008 {
+00009 public :
+00010   eoBreedOne(eoSelectOne<EOT>& _select, eoGenOp<EOT>& _op) : select(_select), op(_op) {}
+00011 
+00012   void operator()(const eoPop<EOT>& _src, eoPop<EOT>& _dest)
+00013   {
+00014     _dest.clear();
+00015     eoSelectivePopulator<EOT> pop(_src, _dest, select);
+00016     op(pop);
+00017   }
+00018 
+00019 private :
+00020   eoSelectOne<EOT>& select;
+00021   eoGenOp<EOT>& op;
+00022 };
+00023 
+00024 typedef eoMinimizingFitness FitnessType;
+00025 typedef eoVector<FitnessType, unsigned> EoType;
+00026 
+00027 template <class EOT>
+00028 class eoMyEval : public eoEvalFunc<EOT>
+00029 {
+00030   public :
+00031 
+00032   void operator()(EOT& _eo)
+00033   {
+00034     _eo.fitness(*std::max_element(_eo.begin(), _eo.end()));
+00035   }
+00036 };
+00037 
+00038 template <class EOT>
+00039 class Xover : public eoBinOp<EOT>
+00040 {
+00041   bool operator()(EOT& _eo, const EOT& _eo2)
+00042   {
+00043     unsigned point = rng.random(_eo.size());
+00044     std::copy(_eo2.begin() + point, _eo2.end(), _eo.begin() + point);
+00045     return true;
+00046   }
+00047 };
+00048 
+00049 template <class EOT>
+00050 class Mutate : public eoMonOp<EOT>
+00051 {
+00052   bool operator()(EOT& _eo)
+00053   {
+00054     unsigned point = rng.random(_eo.size());
+00055     _eo[point] = rng.random(1024);
+00056     return true;
+00057   }
+00058 };
+00059 
+00060 
+00061 int main()
+00062 {
+00063   int pop_size = 10;
+00064 
+00065   eoGenContinue<EoType> cnt(10);
+00066   eoCheckPoint<EoType> cp(cnt);
+00067 
+00068 
+00069   Xover<EoType> xover;
+00070   Mutate<EoType> mutate;
+00071 
+00072   eoProportionalOp<EoType> opsel;
+00073 
+00074   opsel.add(xover, 0.8);
+00075   opsel.add(mutate, 0.2);
+00076 
+00077 
+00078   eoDetTournamentSelect<EoType> selector(3);
+00079   eoBreedOne<EoType> breed(selector, opsel);
+00080 
+00081   // Replace a single one
+00082   eoSSGAWorseReplacement<EoType> replace;
+00083 
+00084 
+00085 //  eoRandomSelect<EoType> selector;
+00086 //  eoGeneralBreeder<EoType> breed(selector, opsel);
+00087 //  eoPlusReplacement<EoType> replace;
+00088 
+00089 
+00090   eoMyEval<EoType> eval;
+00091 
+00092   eoEasyEA<EoType> algo(cp, eval, breed, replace);
+00093 
+00094   eoUniformGenerator<unsigned> unif(0,1024);
+00095   eoInitFixedLength<EoType> init(20, unif);
+00096 
+00097   eoPop<EoType> pop(pop_size, init);
+00098 
+00099   // evaluate
+00100   apply<EoType>(eval, pop);
+00101 
+00102   eoBestFitnessStat<EoType>  best("Best_Fitness");
+00103         eoAverageStat<EoType> avg("Avg_Fitness");
+00104   eoStdoutMonitor mon;
+00105 
+00106   cp.add(best);
+00107   cp.add(avg);
+00108 
+00109 //  cp.add(mon);
+00110 
+00111   mon.add(best);
+00112   mon.add(avg);
+00113 
+00114   // and run
+00115   algo(pop);
+00116 
+00117 }
+
    Generated on Thu Oct 19 05:06:44 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_select_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_select_8cpp-source.html
new file mode 100644
index 000000000..49b7b86f6
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_select_8cpp-source.html
@@ -0,0 +1,239 @@
+
+
+EO: t-eoSelect.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoSelect.cpp
    00001 //-----------------------------------------------------------------------------
+00002 
+00003 // to avoid long name warnings
+00004 #ifdef _MSC_VER
+00005 #pragma warning(disable:4786)
+00006 #endif
+00007 
+00008 #include <stdexcept>  // runtime_error
+00009 
+00010 // general
+00011 #include <eo>
+00012 
+00013 //-----------------------------------------------------------------------------
+00014 
+00015 struct Dummy : public EO<double>
+00016 {
+00017     typedef double Type;
+00018   void printOn(std::ostream & _os) const
+00019   {
+00020       _os << " - ";
+00021       EO<double>::printOn(_os);
+00022   }
+00023 };
+00024 
+00025 bool operator==(const Dummy & _d1, const Dummy & _d2)
+00026 {
+00027   return _d1.fitness() == _d2.fitness();
+00028 }
+00029 
+00030 struct eoDummyPop : public eoPop<Dummy>
+00031 {
+00032 public :
+00033     eoDummyPop(int s=0) { resize(s); }
+00034 };
+00035 
+00036 // helper - DOES NOT WORK if different individuals have same fitness!!!
+00037 template <class EOT>
+00038 unsigned isInPop(EOT & _indi, eoPop<EOT> & _pop)
+00039 {
+00040   for (unsigned i=0; i<_pop.size(); i++)
+00041     if (_pop[i] == _indi)
+00042       return i;
+00043   return _pop.size();
+00044 }
+00045 
+00046 unsigned int pSize;             // global variable, bouh!
+00047 std::string fitnessType;                // yes, a global variable :-)
+00048 eoDummyPop parentsOrg;
+00049 
+00050 template <class EOT>
+00051 void testSelectMany(eoSelect<EOT> & _select, std::string _name)
+00052 {
+00053     unsigned i;
+00054   std::cout << "\n\n" << fitnessType + _name << std::endl;
+00055   std::cout << "===============\n";
+00056 
+00057     eoDummyPop parents(parentsOrg);
+00058     eoDummyPop offspring(0);
+00059 
+00060     // do the selection
+00061     _select(parents, offspring);
+00062 
+00063     // compute stats
+00064     std::vector<unsigned> nb(parents.size(), 0);
+00065     for (i=0; i<offspring.size();  i++)
+00066       {
+00067         unsigned trouve = isInPop<Dummy>(offspring[i], parents);
+00068         if (trouve == parents.size()) // pas trouve
+00069           throw std::runtime_error("Pas trouve ds parents");
+00070         nb[trouve]++;
+00071        }
+00072     // dump to file so you can plot using gnuplot - dir name is hardcoded!
+00073     std::string fName = "ResSelect/" + fitnessType + _name + ".select";
+00074     std::ofstream os(fName.c_str());
+00075     for (i=0; i<parents.size();  i++)
+00076       {
+00077         std::cout << i << " -> " << ( (double)nb[i])/offspring.size() << std::endl;
+00078         os << i << " " << ( (double)nb[i])/offspring.size() << std::endl;
+00079       }
+00080 
+00081 }
+00082 
+00083 template <class EOT>
+00084 void testSelectOne(eoSelectOne<EOT> & _select, eoHowMany & _offspringRate,
+00085                    eoHowMany & _fertileRate, std::string _name)
+00086 {
+00087   eoTruncatedSelectOne<EOT> truncSelect(_select, _fertileRate);
+00088   eoSelectMany<EOT> percSelect(truncSelect, _offspringRate);
+00089   testSelectMany<EOT>(percSelect, _name);
+00090 }
+00091 
+00092 
+00093 //-----------------------------------------------------------------------------
+00094 
+00095 int the_main(int argc, char **argv)
+00096 {
+00097   eoParser parser(argc, argv);
+00098   eoValueParam<unsigned> parentSizeParam = parser.createParam(unsigned(10), "parentSize", "Parent size",'P');
+00099     pSize = parentSizeParam.value(); // global variable
+00100 
+00101 //   eoValueParam<double> offsrpringRateParam = parser.createParam<double>(1.0, "offsrpringRate", "Offsrpring rate",'O');
+00102 //     double oRate = offsrpringRateParam.value();
+00103   eoValueParam<eoHowMany> offsrpringRateParam = parser.createParam(eoHowMany(1.0), "offsrpringRate", "Offsrpring rate (% or absolute)",'O');
+00104     eoHowMany oRate = offsrpringRateParam.value();
+00105 
+00106   eoValueParam<eoHowMany> fertileRateParam = parser.createParam(eoHowMany(1.0), "fertileRate", "Fertility rate (% or absolute)",'F');
+00107     eoHowMany fRate = fertileRateParam.value();
+00108 
+00109 eoValueParam<unsigned> tournamentSizeParam = parser.createParam(unsigned(2), "tournamentSize", "Deterministic tournament size",'T');
+00110     unsigned int tSize = tournamentSizeParam.value();
+00111 
+00112   eoValueParam<double> tournamentRateParam = parser.createParam(1.0, "tournamentRate", "Stochastic tournament rate",'t');
+00113     double tRate = tournamentRateParam.value();
+00114 
+00115   eoValueParam<double> rankingPressureParam = parser.createParam(2.0, "rankingPressure", "Selective pressure for the ranking selection",'p');
+00116     double rankingPressure = rankingPressureParam.value();
+00117 
+00118   eoValueParam<double> rankingExponentParam = parser.createParam(1.0, "rankingExponent", "Exponent for the ranking selection",'e');
+00119     double rankingExponent = rankingExponentParam.value();
+00120 
+00121   eoValueParam<std::string> fitTypeParam = parser.createParam(std::string("linear"), "fitType", "Type of fitness (linear, exp, log, super",'f');
+00122     fitnessType = fitTypeParam.value();
+00123 
+00124     if (parser.userNeedsHelp())
+00125       {
+00126         parser.printHelp(std::cout);
+00127         exit(0);
+00128       }
+00129 
+00130     // hard-coded directory name ...
+00131     system("mkdir ResSelect");
+00132     std::cout << "Testing the Selections\nParents size = " << pSize
+00133          << ", offspring rate = " << oRate;
+00134     std::cout << " and putting rsulting files in dir ResSelect" << std::endl;
+00135 
+00136     // initialize parent population
+00137     parentsOrg.resize(pSize);
+00138     if (fitnessType == std::string("linear"))
+00139       for (unsigned i=0; i<pSize; i++)
+00140         parentsOrg[i].fitness(i);
+00141     else if (fitnessType == std::string("exp"))
+00142       for (unsigned i=0; i<pSize; i++)
+00143         parentsOrg[i].fitness(exp((double)i));
+00144     else if (fitnessType == std::string("log"))
+00145       for (unsigned i=0; i<pSize; i++)
+00146         parentsOrg[i].fitness(log(i+1.));
+00147     else if (fitnessType == std::string("super"))
+00148       {
+00149         for (unsigned i=0; i<pSize-1; i++)
+00150           parentsOrg[i].fitness(i);
+00151         parentsOrg[pSize-1].fitness(10*pSize);
+00152       }
+00153     else
+00154       throw std::runtime_error("Invalid fitness Type"+fitnessType);
+00155 
+00156     std::cout << "Initial parents (odd)\n" << parentsOrg << std::endl;
+00157 
+00158   // random seed
+00159     eoValueParam<uint32_t>& seedParam = parser.createParam(uint32_t(0), "seed",
+00160                                                            "Random number seed", 'S');
+00161     if (seedParam.value() == 0)
+00162         seedParam.value() = time(0);
+00163     rng.reseed(seedParam.value());
+00164 
+00165     char fileName[1024];
+00166 
+00167 // the selection procedures under test
+00168     //    eoDetSelect<Dummy> detSelect(oRate);
+00169     //    testSelectMany(detSelect, "detSelect");
+00170 
+00171     // Roulette
+00172      eoProportionalSelect<Dummy> propSelect;
+00173      testSelectOne<Dummy>(propSelect, oRate, fRate, "PropSelect");
+00174 
+00175     // Linear ranking using the perf2Worth construct
+00176     eoRankingSelect<Dummy> newRankingSelect(rankingPressure);
+00177     sprintf(fileName,"LinRank_%g",rankingPressure);
+00178     testSelectOne<Dummy>(newRankingSelect, oRate, fRate, fileName);
+00179 
+00180     // Exponential ranking using the perf2Worth construct
+00181     std::cout << "rankingExponent " << rankingExponent << std::endl;
+00182     eoRankingSelect<Dummy> expRankingSelect(rankingPressure,rankingExponent);
+00183     sprintf(fileName,"ExpRank_%g_%g",rankingPressure, rankingExponent);
+00184     testSelectOne<Dummy>(expRankingSelect, oRate, fRate, fileName);
+00185 
+00186     // Det tournament
+00187     eoDetTournamentSelect<Dummy> detTourSelect(tSize);
+00188     sprintf(fileName,"DetTour_%d",tSize);
+00189     testSelectOne<Dummy>(detTourSelect, oRate, fRate, fileName);
+00190 
+00191     // Stoch tournament
+00192     eoStochTournamentSelect<Dummy> stochTourSelect(tRate);
+00193     sprintf(fileName,"StochTour_%g",tRate);
+00194     testSelectOne<Dummy>(stochTourSelect, oRate, fRate, fileName);
+00195 
+00196     // Fitness scaling
+00197     eoFitnessScalingSelect<Dummy> newFitScaleSelect(rankingPressure);
+00198     sprintf(fileName,"LinFitScale_%g",rankingPressure);
+00199     testSelectOne<Dummy>(newFitScaleSelect, oRate, fRate, fileName);
+00200 
+00201     // Sequential selections
+00202     eoSequentialSelect<Dummy> seqSel(false);
+00203     strcpy(fileName,"Sequential");
+00204     testSelectOne<Dummy>(seqSel, oRate, fRate, fileName);
+00205 
+00206     eoEliteSequentialSelect<Dummy> eliteSeqSel;
+00207     strcpy(fileName,"EliteSequential");
+00208     testSelectOne<Dummy>(eliteSeqSel, oRate, fRate, fileName);
+00209 
+00210     return 1;
+00211 }
+00212 
+00213 int main(int argc, char **argv)
+00214 {
+00215     try
+00216     {
+00217         the_main(argc, argv);
+00218     }
+00219     catch(std::exception& e)
+00220     {
+00221         std::cout << "Exception: " << e.what() << std::endl;
+00222         return 1;
+00223     }
+00224 }
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_sharing_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_sharing_8cpp-source.html
new file mode 100644
index 000000000..e153c00de
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_sharing_8cpp-source.html
@@ -0,0 +1,255 @@
+
+
+EO: t-eoSharing.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoSharing.cpp
    00001 #ifdef HAVE_CONFIG_H
+00002 #include <config.h>
+00003 #endif
+00004 
+00005 // to avoid long name warnings
+00006 #ifdef _MSC_VER
+00007 #pragma warning(disable:4786)
+00008 #endif
+00009 
+00010 #include <iostream>
+00011 #include <sstream>
+00012 #include <stdexcept>
+00013 #include <vector>
+00014 
+00015 // general
+00016 #include <eo>
+00017 #include <utils/eoDistance.h>
+00018 
+00019 //-----------------------------------------------------------------------------
+00020 
+00021 struct Dummy : public EO<double>
+00022 {
+00023     typedef double Type;
+00024   void printOn(std::ostream & _os) const
+00025   {
+00026       EO<double>::printOn(_os);
+00027       std::cout << " " << xdist ;
+00028   }
+00029   double xdist;
+00030 };
+00031 
+00032 class
+00033 eoDummyDistance : public eoDistance<Dummy>
+00034 {
+00035   double operator()(const Dummy & _v1, const Dummy & _v2)
+00036   {
+00037     double r= _v1.xdist - _v2.xdist;
+00038     return sqrt(r*r);
+00039   }
+00040 };
+00041 
+00042 
+00043 bool operator==(const Dummy & _d1, const Dummy & _d2)
+00044 {
+00045   return _d1.fitness() == _d2.fitness();
+00046 }
+00047 
+00048 struct eoDummyPop : public eoPop<Dummy>
+00049 {
+00050 public :
+00051     eoDummyPop(int s=0) { resize(s); }
+00052 };
+00053 
+00054 // helper - DOES NOT WORK if different individuals have same fitness!!!
+00055 template <class EOT>
+00056 unsigned isInPop(EOT & _indi, eoPop<EOT> & _pop)
+00057 {
+00058   for (unsigned i=0; i<_pop.size(); i++)
+00059     if (_pop[i] == _indi)
+00060       return i;
+00061   return _pop.size();
+00062 }
+00063 
+00064 unsigned int pSize;             // global variable, bouh!
+00065 std::string fitnessType;                // yes, a global variable :-)
+00066 eoDummyPop parentsOrg;
+00067 
+00068 template <class EOT>
+00069 void testSelectMany(eoSelect<EOT> & _select, std::string _name)
+00070 {
+00071     unsigned i;
+00072   std::cout << "\n\n" << fitnessType + _name << std::endl;
+00073   std::cout << "===============\n";
+00074 
+00075     eoDummyPop parents(parentsOrg);
+00076     eoDummyPop offspring(0);
+00077 
+00078     // do the selection
+00079     _select(parents, offspring);
+00080 
+00081     //    cout << "Pop offspring \n" << offspring << endl;
+00082 
+00083     // compute stats
+00084     std::vector<unsigned> nb(parents.size(), 0);
+00085     for (i=0; i<offspring.size();  i++)
+00086       {
+00087         unsigned trouve = isInPop<Dummy>(offspring[i], parents);
+00088         if (trouve == parents.size()) // pas trouve
+00089           throw std::runtime_error("Pas trouve ds parents");
+00090         nb[trouve]++;
+00091        }
+00092     // dump to file so you can plot using gnuplot - dir name is hardcoded!
+00093     std::string fName = "ResSelect/" + fitnessType + _name + ".select";
+00094     std::ofstream os(fName.c_str());
+00095     for (i=0; i<parents.size();  i++)
+00096       {
+00097         std::cout << i << " -> " << ( (double)nb[i])/offspring.size() << std::endl;
+00098         os << i << " " << ( (double)nb[i])/offspring.size() << std::endl;
+00099       }
+00100 
+00101 }
+00102 
+00103 template <class EOT>
+00104 void testSelectOne(eoSelectOne<EOT> & _select, eoHowMany & _offspringRate,
+00105                    eoHowMany & _fertileRate, std::string _name)
+00106 {
+00107   eoTruncatedSelectOne<EOT> truncSelect(_select, _fertileRate);
+00108   eoSelectMany<EOT> percSelect(truncSelect, _offspringRate);
+00109   testSelectMany<EOT>(percSelect, _name);
+00110 }
+00111 
+00112 
+00113 //-----------------------------------------------------------------------------
+00114 
+00115 int the_main(int argc, char **argv)
+00116 {
+00117   eoParser parser(argc, argv);
+00118 
+00119   // random seed
+00120     eoValueParam<uint32_t>& seedParam = parser.createParam(uint32_t(0), "seed", "Random number seed", 'S');
+00121     if (seedParam.value() == 0)
+00122         seedParam.value() = time(0);
+00123     rng.reseed(seedParam.value());
+00124 
+00125 
+00126   // pSize global variable !
+00127   eoValueParam<unsigned> pSizeParam = parser.createParam(unsigned(10), "parentSize", "Parent size",'P');
+00128   pSize = pSizeParam.value();
+00129 
+00130   eoHowMany oRate = parser.createParam(eoHowMany(1.0), "offsrpringRate", "Offsrpring rate (% or absolute)",'O').value();
+00131 
+00132   eoHowMany fRate = parser.createParam(eoHowMany(1.0), "fertileRate", "Fertility rate (% or absolute)",'F').value();
+00133 
+00134 
+00135   double nicheSize = parser.createParam(0.1, "nicheSize", "Paramter Sigma for Sharing",'\0').value();
+00136 
+00137   eoParamParamType & peakParam = parser.createParam(eoParamParamType("2(1,2)"), "peaks", "Description of the peaks: N(nb1,nb2,...,nbN)", 'p').value();
+00138 
+00139   // the number of peaks: first item of the paramparam
+00140   unsigned peakNumber = atoi(peakParam.first.c_str());
+00141   if (peakNumber < 2)
+00142       {
+00143         std::cerr << "WARNING, nb of peaks must be larger than 2, using 2" << std::endl;
+00144         peakNumber = 2;
+00145       }
+00146 
+00147   std::vector<unsigned> nbIndiPerPeak(peakNumber);
+00148   unsigned i, sum=0;
+00149 
+00150   // the second item is a vector<string> containing all values
+00151   if (!peakParam.second.size())   // no other parameter : equal peaks
+00152       {
+00153         std::cerr << "WARNING, no nb of indis per peaks, using equal nbs" << std::endl;
+00154         for (i=0; i<peakNumber; i++)
+00155           nbIndiPerPeak[i] = pSize/peakNumber;
+00156       }
+00157     else          // parameters passed by user
+00158       if (peakParam.second.size() != peakNumber)
+00159         {
+00160           std::cerr << "ERROR, not enough nb of indis per peaks" << std::endl;
+00161           exit(1);
+00162         }
+00163       else    // now we have in peakParam.second all numbers
+00164         {
+00165           for (i=0; i<peakNumber; i++)
+00166             sum += ( nbIndiPerPeak[i] = atoi(peakParam.second[i].c_str()) );
+00167           // now normalize
+00168           for (i=0; i<peakNumber; i++)
+00169             nbIndiPerPeak[i] = nbIndiPerPeak[i] * pSize / sum;
+00170         }
+00171 
+00172   // compute exact total
+00173   sum = 0;
+00174   for (i=0; i<peakNumber; i++)
+00175     sum += nbIndiPerPeak[i];
+00176   if (sum != pSize)
+00177     {
+00178       pSize = pSizeParam.value() = sum;
+00179       std::cerr << "WARNING, adjusting pSize to " << pSize << std::endl;
+00180     }
+00181 
+00182     make_help(parser);
+00183 
+00184     // hard-coded directory name ...
+00185     std::cout << "Testing the Sharing\n";
+00186     std::cout << " There will be " << peakNumber << " peaks";
+00187     std::cout << " with respective pops ";
+00188     for (i=0; i<peakNumber; i++)
+00189       std::cout << nbIndiPerPeak[i] << ", ";
+00190     std::cout << "\n Peaks are at distance 1 from one-another (dim 1),\n";
+00191       std::cout << " fitness of each peak is nb of peak, and\n";
+00192       std::cout << " fitness of individuals = uniform[fitness of peak +- 0.01]\n\n";
+00193 
+00194       std::cout << "The resulting file (in dir ResSelect), contains \n";
+00195     std::cout << " the empirical proba. for each indi to be selected." << std::endl;
+00196     system("mkdir ResSelect");
+00197 
+00198     // initialize parent population
+00199     parentsOrg.resize(pSize);
+00200 
+00201     // all peaks of equal size in fitness, with different nn of individuals
+00202     unsigned index=0;
+00203     for (unsigned nbP=0; nbP<peakNumber; nbP++)
+00204       for (i=0; i<nbIndiPerPeak[nbP]; i++)
+00205         {
+00206           parentsOrg[index].fitness(nbP+1 + 0.02*eo::rng.uniform() - 0.01);
+00207           parentsOrg[index].xdist = nbP+1 + 0.02*eo::rng.uniform() - 0.01;
+00208           index++;
+00209         }
+00210 
+00211     std::cout << "Initial population\n" << parentsOrg << std::endl;
+00212 
+00213     char fileName[1024];
+00214 
+00215 // the selection procedures under test
+00216     //    eoDetSelect<Dummy> detSelect(oRate);
+00217     //    testSelectMany(detSelect, "detSelect");
+00218 
+00219     // Sharing using the perf2Worth construct
+00220     // need a distance for that
+00221     eoDummyDistance dist;
+00222     eoSharingSelect<Dummy> newSharingSelect(nicheSize, dist);
+00223     sprintf(fileName,"Niche_%g",nicheSize);
+00224     testSelectOne<Dummy>(newSharingSelect, oRate, fRate, fileName);
+00225 
+00226     return 1;
+00227 }
+00228 
+00229 int main(int argc, char **argv)
+00230 {
+00231     try
+00232     {
+00233         the_main(argc, argv);
+00234     }
+00235     catch(std::exception& e)
+00236     {
+00237         std::cout << "Exception: " << e.what() << std::endl;
+00238         return 1;
+00239     }
+00240 }
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_state_and_parser_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_state_and_parser_8cpp-source.html
new file mode 100644
index 000000000..3089ccb8b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_state_and_parser_8cpp-source.html
@@ -0,0 +1,154 @@
+
+
+EO: t-eoStateAndParser.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoStateAndParser.cpp
    00001 //-----------------------------------------------------------------------------
+00002 
+00003 // to avoid long name warnings
+00004 #ifdef _MSC_VER
+00005 #pragma warning(disable:4786)
+00006 #endif
+00007 
+00008 #include <stdexcept>  // runtime_error
+00009 
+00010 //-----------------------------------------------------------------------------
+00011 // tt.cpp:
+00012 //
+00013 //-----------------------------------------------------------------------------
+00014 
+00015 
+00016 // general
+00017 #include <utils/eoRNG.h>                // Random number generators
+00018 #include <ga.h>
+00019 #include <utils/eoParser.h>
+00020 #include <utils/eoState.h>
+00021 
+00022 //-----------------------------------------------------------------------------
+00023 
+00024 // include package checkpointing
+00025 #include <utils/checkpointing>
+00026 // and provisions for Bounds reading
+00027 #include <utils/eoRealVectorBounds.h>
+00028 
+00029 struct Dummy : public EO<double>
+00030 {
+00031     typedef double Type;
+00032 };
+00033 
+00034 
+00035 //-----------------------------------------------------------------------------
+00036 
+00037 int the_main(int argc, char **argv)
+00038 { // ok, we have a command line parser and a state
+00039 
+00040     typedef eoBit<float> Chrom;
+00041 
+00042     eoParser parser(argc, argv);
+00043 
+00044     // Define Parameters
+00045     eoValueParam<unsigned int> dimParam((unsigned int)(5), "dimension", "dimension");
+00046     eoValueParam<double> rate(0.01, "mutationRatePerBit", "Initial value for mutation rate per bit");
+00047     eoValueParam<double> factor(0.99, "mutationFactor", "Decrease factor for mutation rate");
+00048     eoValueParam<uint32_t> seed(time(0), "seed", "Random number seed");
+00049     // test if user entered or if default value used
+00050     if (parser.isItThere(seed))
+00051       std::cout << "YES\n";
+00052     else
+00053       std::cout << "NO\n";
+00054 
+00055     eoValueParam<std::string> load_name("", "Load","Load",'L');
+00056     eoValueParam<std::string> save_name("", "Save","Save",'S');
+00057 
+00058 
+00059     // Register them
+00060     parser.processParam(dimParam,   "Genetic Operators");
+00061     parser.processParam(rate,       "Genetic Operators");
+00062     parser.processParam(factor,     "Genetic Operators");
+00063     parser.processParam(load_name,  "Persistence");
+00064     parser.processParam(save_name,  "Persistence");
+00065     parser.processParam(seed,       "Rng seeding");
+00066 
+00067     // a bound param (need dim)
+00068     eoValueParam<eoRealVectorBounds> boundParam(eoRealVectorBounds(dimParam.value(),eoDummyRealNoBounds), "bounds","bounds",'b');
+00069 
+00070     parser.processParam(boundParam, "Genetic Operators");
+00071 
+00072     std::cout << "Bounds: " << boundParam.value() << std::endl;
+00073 
+00074    eoState state;
+00075    state.registerObject(parser);
+00076 
+00077 
+00078    if (load_name.value() != "")
+00079    { // load the parser. This is only neccessary when the user wants to
+00080      // be able to change the parameters in the state file by hand.
+00081        state.load(load_name.value()); // load the parser
+00082    }
+00083 
+00084     // Create the algorithm here
+00085 
+00086     // Register the algorithm
+00087     state.registerObject(rng);
+00088     //state.registerObject(pop);
+00089 
+00090     if (parser.userNeedsHelp())
+00091     {
+00092         parser.printHelp(std::cout);
+00093         return 0;
+00094     }
+00095 
+00096     // Either load or initialize
+00097     if (load_name.value() != "")
+00098     {
+00099         state.load(load_name.value()); // load the rest
+00100     }
+00101     else
+00102     {
+00103         // else
+00104 
+00105         // initialize rng and population
+00106 
+00107         rng.reseed(seed.value());
+00108     }
+00109 
+00110     // run the algorithm
+00111 
+00112     // Save when needed
+00113     if (save_name.value() != "")
+00114     {
+00115         std::string file_name = save_name.value();
+00116         save_name.value() = ""; // so that it does not appear in the parser section of the state file
+00117         state.save(file_name);
+00118     }
+00119 
+00120     for (int i = 0; i < 100; ++i)
+00121         rng.rand();
+00122 
+00123     std::cout << "a random number is " << rng.random(1024) << std::endl;;
+00124 
+00125     return 1;
+00126 }
+00127 
+00128 int main(int argc, char **argv)
+00129 {
+00130     try
+00131     {
+00132         the_main(argc, argv);
+00133     }
+00134     catch(std::exception& e)
+00135     {
+00136         std::cout << "Exception: " << e.what() << std::endl;
+00137     }
+00138 
+00139 }
+
    Generated on Thu Oct 19 05:06:44 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_symreg_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_symreg_8cpp-source.html
new file mode 100644
index 000000000..706e4777e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_symreg_8cpp-source.html
@@ -0,0 +1,306 @@
+
+
+EO: t-eoSymreg.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoSymreg.cpp
    00001 #ifdef _MSC_VER
+00002 #pragma warning(disable:4786)
+00003 #endif
+00004 
+00005 #include <gp/eoParseTree.h>
+00006 #include <eo>
+00007 
+00008 using namespace gp_parse_tree;
+00009 using namespace std;
+00010 
+00011 //-----------------------------------------------------------------------------
+00012 
+00013 class SymregNode
+00014 {
+00015 public :
+00016 
+00017         enum Operator {X = 'x', Plus = '+', Min = '-', Mult = '*', PDiv = '/'};
+00018 
+00019         SymregNode(void)                                { init(); }
+00020         SymregNode(Operator _op)                { op = _op; }
+00021         virtual ~SymregNode(void)                       {}
+00022 
+00023         // arity function, need this function!
+00024         int arity(void) const      { return op == X? 0 : 2; }
+00025 
+00026     void randomize(void) {}
+00027     
+00028         // evaluation function, single case, using first argument to give value of variable
+00029         template <class Children>
+00030         void operator()(double& result, Children args, double var) const
+00031         {
+00032         double r1, r2;
+00033 
+00034         if (arity() == 2)
+00035         {
+00036             args[0].apply(r1, var);
+00037             args[1].apply(r2, var);
+00038         }
+00039 
+00040                 switch (op)
+00041                 {
+00042                 case Plus : result = r1 + r2; break;
+00043                 case Min  : result = r1 - r2; break;
+00044                 case Mult : result = r1 * r2; break;
+00045                 case PDiv : 
+00046                         {
+00047                                 if (r2 == 0.0)
+00048                                         result = 1.0; // protection a la Koza, realistic implementations should maybe throw an exception
+00049                 else
+00050                                     result = r1 / r2;
+00051                 break;
+00052                         }
+00053 
+00054                 case X    : result = var; break;
+00055                 }
+00056 
+00057         }
+00058 
+00060     template <class Children>
+00061         void operator()(string& result, Children args) const
+00062     {
+00063         static const string lb = "(";
+00064         static const string rb = ")";
+00065         char opStr[4] = "   ";
+00066         opStr[1] = op;
+00067         
+00068             if (arity() == 0)
+00069                 {
+00070             result = "x";
+00071             return;
+00072         }
+00073         // else
+00074         string r1;
+00075         args[0].apply(r1);
+00076         result = lb + r1;
+00077         result += opStr; 
+00078         args[1].apply(r1);
+00079         result += r1 + rb;
+00080     }
+00081 
+00082     Operator getOp(void) const { return op; }    
+00083 
+00084 protected :
+00085 
+00086         void init(void)                                 { op = X; }
+00087 
+00088 private :
+00089 
+00090         Operator op; // the type of node
+00091 };
+00092 
+00094 static SymregNode init_sequence[5] = {SymregNode::X, SymregNode::Plus, SymregNode::Min, SymregNode::Mult, SymregNode::PDiv}; // needed for intialization
+00095 
+00096 // MSVC does not recognize the lt_arity<Node> in eoParseTreeDepthInit
+00097 // without this specialization ...
+00098 // 2 months later, it seems it does not accept this definition ...
+00099 // but dies accept the lt_arity<Node> in eoParseTreeDepthInit
+00100 // !!!
+00101 // #ifdef _MSC_VER 
+00102 // template <>
+00103 // bool lt_arity(const SymregNode &node1, const SymregNode &node2) 
+00104 // {
+00105 //              return (node1.arity() < node2.arity());
+00106 // }
+00107 // #endif
+00108 
+00109 //-----------------------------------------------------------
+00110 // saving, loading
+00111 
+00112 std::ostream& operator<<(std::ostream& os, const SymregNode& eot)
+00113 {
+00114     os << static_cast<char>(eot.getOp());
+00115     return os;
+00116 }
+00117 
+00118 std::istream& operator>>(std::istream& is, SymregNode& eot)
+00119 {
+00120     char type;
+00121     type = (char) is.get();
+00122     eot = SymregNode(static_cast<SymregNode::Operator>(type));
+00123     return is;
+00124 }
+00125 
+00126 
+00127 //-----------------------------------------------------------------------------
+00130 double targetFunction(double x)
+00131 { 
+00132         return x * x * x * x - x * x * x + x * x * x - x * x + x - 10; 
+00133 }
+00134 
+00135 // parameters controlling the sampling of points
+00136 const double xbegin = -10.0f;
+00137 const double xend   = 10.0f;
+00138 const double xstep  = 1.3f; 
+00139 
+00140 template <class FType, class Node> struct RMS: public eoEvalFunc< eoParseTree<FType, Node> > 
+00141 {
+00142 public :
+00143 
+00144     typedef eoParseTree<FType, Node> EoType;
+00145 
+00146     typedef eoParseTree<FType, Node> argument_type;
+00147     typedef double                   fitness_type;
+00148 
+00149         RMS(void) : eoEvalFunc<EoType>()
+00150         {
+00151                 int n = int( (xend - xbegin) / xstep);
+00152                 
+00153                 inputs.resize(n);
+00154                 target.resize(n);
+00155 
+00156                 int i = 0;
+00157 
+00158         for (double x = xbegin; x < xend && i < n; ++i, x+=xstep)
+00159                 {
+00160                         target[i] = targetFunction(x);
+00161                         inputs[i] = x;
+00162                 }
+00163         }
+00164 
+00165     ~RMS() {}
+00166     
+00167         void operator()( EoType & _eo )  
+00168         {
+00169                 vector<double> outputs;
+00170                 outputs.resize(inputs.size());
+00171                 
+00172         double fitness = 0.0;
+00173         
+00174         for (unsigned i = 0; i < inputs.size(); ++i)
+00175         {
+00176                     _eo.apply(outputs[i], inputs[i]);
+00177                 fitness += (outputs[i] - target[i]) * (outputs[i] - target[i]);
+00178         }
+00179                 
+00180         fitness /= (double) target.size();
+00181         fitness = sqrt(fitness);
+00182                         
+00183                 if (fitness > 1e+20)
+00184                         fitness = 1e+20;
+00185 
+00186                 _eo.fitness(fitness);
+00187         }
+00188 
+00189 private :
+00190         vector<double> inputs;
+00191         vector<double> target;
+00192 };
+00193 
+00194 template <class EOT, class FitnessType>
+00195 void print_best(eoPop<EOT>& pop)
+00196 {
+00197     std::cout << std::endl;
+00198     FitnessType best = pop[0].fitness();
+00199     int index = 0;
+00200 
+00201     for (unsigned i = 1; i < pop.size(); ++i)
+00202     {
+00203         if (best < pop[i].fitness())
+00204         {
+00205             best = pop[i].fitness();
+00206             index = i;
+00207         }
+00208     }
+00209     
+00210     std::cout << "\t";
+00211         
+00212     string str;
+00213     pop[index].apply(str);
+00214     
+00215     std::cout << str.c_str();
+00216     std::cout << std::endl << "RMS Error = " << pop[index].fitness() << std::endl;
+00217 }
+00218 
+00219 int main()
+00220 {
+00221     typedef eoMinimizingFitness FitnessType;
+00222     typedef SymregNode GpNode;
+00223 
+00224     typedef eoParseTree<FitnessType, GpNode> EoType;
+00225     typedef eoPop<EoType> Pop;  
+00226 
+00227     const int MaxSize = 100;
+00228     const int nGenerations = 10; // only a test, so few generations
+00229 
+00230     // Initializor sequence, contains the allowable nodes
+00231     vector<GpNode> init(init_sequence, init_sequence + 5);
+00232 
+00233     // Depth Initializor, defaults to grow method.
+00234     eoGpDepthInitializer<FitnessType, GpNode> initializer(10, init);
+00235     
+00236     // Root Mean Squared Error Measure
+00237     RMS<FitnessType, GpNode>              eval;
+00238 
+00239     Pop pop(50, initializer);
+00240 
+00241     apply<EoType>(eval, pop);
+00242 
+00243     eoSubtreeXOver<FitnessType, GpNode>   xover(MaxSize);
+00244     eoBranchMutation<FitnessType, GpNode> mutation(initializer, MaxSize);
+00245 
+00246     // The operators are  encapsulated into an eoTRansform object, 
+00247     // that performs sequentially crossover and mutation
+00248     eoSGATransform<EoType> transform(xover, 0.75, mutation, 0.25);
+00249 
+00250     // The robust tournament selection
+00251     eoDetTournamentSelect<EoType> selectOne(2);   // tSize in [2,POPSIZE]
+00252     // is now encapsulated in a eoSelectMany: 2 at a time -> SteadyState
+00253     eoSelectMany<EoType> select(selectOne,2, eo_is_an_integer);    
+00254   
+00255     // and the Steady-State replacement
+00256     eoSSGAWorseReplacement<EoType> replace;
+00257   
+00258     // Terminators
+00259     eoGenContinue<EoType> term(nGenerations);
+00260 
+00261     eoCheckPoint<EoType> checkPoint(term);
+00262 
+00263     eoAverageStat<EoType>     avg;
+00264     eoBestFitnessStat<EoType> best;
+00265     eoStdoutMonitor monitor;
+00266 
+00267     checkPoint.add(monitor);
+00268     checkPoint.add(avg);
+00269     checkPoint.add(best);
+00270 
+00271     monitor.add(avg);
+00272     monitor.add(best);
+00273 
+00274     // GP generation
+00275     eoEasyEA<EoType> gp(checkPoint, eval, select, transform, replace);
+00276 
+00277     std::cout << "Initialization done" << std::endl;
+00278 
+00279     print_best<EoType, FitnessType>(pop);
+00280 
+00281     try
+00282     {
+00283       gp(pop);
+00284     }
+00285     catch (std::exception& e)
+00286     {
+00287             std::cout << "exception: " << e.what() << std::endl;;
+00288             exit(EXIT_FAILURE);
+00289     }
+00290 
+00291     print_best<EoType, FitnessType>(pop);
+00292 
+00293 }
+00294 
+00295 
+
    Generated on Thu Oct 19 05:06:44 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_uniform_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_uniform_8cpp-source.html
new file mode 100644
index 000000000..d4c19277c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_uniform_8cpp-source.html
@@ -0,0 +1,37 @@
+
+
+EO: t-eoUniform.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoUniform.cpp
    00001 //-----------------------------------------------------------------------------
+00002 // t-eouniform
+00003 //-----------------------------------------------------------------------------
+00004 
+00005 #include <iostream>   // std::cout
+00006 #include <strstream>  // ostrstream, istrstream
+00007 #include <eoUniform.h>         // eoBin
+00008 
+00009 //-----------------------------------------------------------------------------
+00010 
+00011 main() {
+00012   eoUniform<float> u1(-2.5,3.5);
+00013   eoUniform<double> u2(0.003, 0 );
+00014   eoUniform<unsigned long> u3( 10000U, 10000000U);
+00015   std::cout << "u1\t\tu2\t\tu3" << std::endl;
+00016   for ( unsigned i = 0; i < 100; i ++) {
+00017     std::cout << u1() << "\t" << u2() << "\t" << u3() << std::endl;
+00018   }
+00019     
+00020 }
+00021 
+00022 //-----------------------------------------------------------------------------
+
    Generated on Thu Oct 19 05:06:44 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_vector_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_vector_8cpp-source.html
new file mode 100644
index 000000000..21572e8a8
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_vector_8cpp-source.html
@@ -0,0 +1,89 @@
+
+
+EO: t-eoVector.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoVector.cpp
    00001 /* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003     t-eoVector.cpp
+00004       This program tests vector-like chromosomes
+00005     (c) GeNeura Team, 1999, 2000
+00006 
+00007     Modified by Maarten Keijzer 2001
+00008 
+00009     This program is free software; you can redistribute it and/or modify
+00010     it under the terms of the GNU General Public License as published by
+00011     the Free Software Foundation; either version 2 of the License, or
+00012     (at your option) any later version.
+00013 
+00014     This program is distributed in the hope that it will be useful,
+00015     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00016     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00017     GNU General Public License for more details.
+00018 
+00019     You should have received a copy of the GNU General Public License
+00020     along with this program; if not, write to the Free Software
+00021     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00022 
+00023     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00024 
+00025 */
+00026 //-----------------------------------------------------------------------------
+00027 #ifdef HAVE_CONFIG_H
+00028 #include <config.h>
+00029 #endif
+00030 
+00031 #include <cassert>
+00032 #include <iostream>
+00033 
+00034 #include <utils/eoRndGenerators.h>
+00035 #include <eoVector.h>         // eoVector
+00036 #include <eoInit.h>
+00037 #include <eoScalarFitness.h>
+00038 
+00039 //-----------------------------------------------------------------------------
+00040 
+00041 typedef eoVector<eoMaximizingFitness, int> Chrom1;
+00042 typedef eoVector<eoMinimizingFitness, int> Chrom2;
+00043 
+00044 //-----------------------------------------------------------------------------
+00045 
+00046 int main()
+00047 {
+00048   const unsigned SIZE = 4;
+00049 
+00050   // check if the appropriate ctor gets called
+00051   Chrom1 chrom(SIZE, 5);
+00052 
+00053   for (unsigned i = 0; i < chrom.size(); ++i)
+00054   {
+00055     assert(chrom[i] == 5);
+00056   }
+00057 
+00058   eoUniformGenerator<Chrom1::AtomType> uniform(-1,1);
+00059   eoInitFixedLength<Chrom1> init(SIZE, uniform);
+00060 
+00061   init(chrom);
+00062 
+00063   std::cout << chrom << std::endl;
+00064 
+00065   Chrom2 chrom2(chrom);
+00066 
+00067   std::cout << chrom2 << std::endl;
+00068 
+00069 //  eoInitVariableLength<Chrom1> initvar(
+00070 
+00071   return 0;
+00072 }
+00073 
+00074 //-----------------------------------------------------------------------------
+
    Generated on Thu Oct 19 05:06:44 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eo_virus_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eo_virus_8cpp-source.html
new file mode 100644
index 000000000..53bd9c852
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eo_virus_8cpp-source.html
@@ -0,0 +1,92 @@
+
+
+EO: t-eoVirus.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoVirus.cpp
    00001 /* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003     t-eoVirus.cpp
+00004       This program tests the the binary cromosomes and several genetic operators
+00005     (c) GeNeura Team, 1999
+00006 
+00007     This program is free software; you can redistribute it and/or modify
+00008     it under the terms of the GNU General Public License as published by
+00009     the Free Software Foundation; either version 2 of the License, or
+00010     (at your option) any later version.
+00011 
+00012     This program is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00015     GNU General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU General Public License
+00018     along with this program; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022 
+00023 */
+00024 //-----------------------------------------------------------------------------
+00025 
+00026 #include <iostream>   // std::cout
+00027 #include <eo>         // general EO
+00028 #include "MGE/VirusOp.h"
+00029 #include "MGE/eoVirus.h"
+00030 #include "MGE/eoInitVirus.h"
+00031 #include <utils/eoRndGenerators.h>
+00032 
+00033 #include "binary_value.h"
+00034 
+00035 //-----------------------------------------------------------------------------
+00036 
+00037 typedef eoVirus<float> Chrom;
+00038 
+00039 //-----------------------------------------------------------------------------
+00040 
+00041 int main()
+00042 {
+00043   const unsigned SIZE = 8;
+00044   eoBooleanGenerator gen;
+00045   eo::rng.reseed( time( 0 ) );
+00046 
+00047   Chrom chrom(SIZE), chrom2(SIZE);
+00048   chrom.fitness(binary_value(chrom)); chrom2.fitness(binary_value(chrom2));
+00049   std::cout << chrom << std::endl;
+00050   std::cout << chrom2 << std::endl;
+00051 
+00052   // Virus Mutation
+00053   VirusBitFlip<float> vf;
+00054   unsigned i;
+00055   for ( i = 0; i < 10; i++ ) {
+00056         vf( chrom );
+00057         std::cout << chrom << std::endl;
+00058   }
+00059 
+00060   // Chrom Mutation
+00061   std::cout << "Chrom mutation--------" << std::endl;
+00062   VirusMutation<float> vm;
+00063   for ( i = 0; i < 10; i++ ) {
+00064         vm( chrom );
+00065         std::cout << chrom << std::endl;
+00066   }
+00067 
+00068   // Chrom Transmision
+00069   std::cout << "Chrom transmission--------" << std::endl;
+00070   VirusTransmission<float> vt; 
+00071   vt( chrom2, chrom );
+00072   std::cout << chrom2 << std::endl;
+00073 
+00074   return 0;
+00075 
+00076 }
+00077 
+
    Generated on Thu Oct 19 05:06:44 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eobin_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eobin_8cpp-source.html
new file mode 100644
index 000000000..b467c9ede
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eobin_8cpp-source.html
@@ -0,0 +1,233 @@
+
+
+EO: t-eobin.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eobin.cpp
    00001 /* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003     t-eobin.cpp
+00004       This program tests the the binary cromosomes and several genetic operators
+00005     (c) GeNeura Team, 1999
+00006 
+00007     This program is free software; you can redistribute it and/or modify
+00008     it under the terms of the GNU General Public License as published by
+00009     the Free Software Foundation; either version 2 of the License, or
+00010     (at your option) any later version.
+00011 
+00012     This program is distributed in the hope that it will be useful,
+00013     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00014     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00015     GNU General Public License for more details.
+00016 
+00017     You should have received a copy of the GNU General Public License
+00018     along with this program; if not, write to the Free Software
+00019     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00020 
+00021     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00022 
+00023 */
+00024 //-----------------------------------------------------------------------------
+00025 #ifdef HAVE_CONFIG_H
+00026 #include <config.h>
+00027 #endif
+00028 
+00029 #include <iostream>   // std::cout
+00030 #include <sstream>
+00031 
+00032 #include <eo>         // general EO
+00033 #include <ga.h>       // bitstring representation & operators
+00034 #include <utils/eoRndGenerators.h>
+00035 #include "binary_value.h"
+00036 
+00037 //-----------------------------------------------------------------------------
+00038 
+00039 typedef eoBit<double> Chrom;
+00040 
+00041 //-----------------------------------------------------------------------------
+00042 
+00043 void main_function()
+00044 {
+00045   const unsigned SIZE = 8;
+00046   unsigned i, j;
+00047   eoBooleanGenerator gen;
+00048 
+00049   Chrom chrom(SIZE), chrom2;
+00050   chrom.fitness(binary_value(chrom)); chrom2.fitness(binary_value(chrom2));
+00051 
+00052   std::cout << "chrom:  " << chrom << std::endl;
+00053   chrom[0] = chrom[SIZE - 1] = true; chrom.fitness(binary_value(chrom));
+00054   std::cout << "chrom:  " << chrom << std::endl;
+00055   chrom[0] = chrom[SIZE - 1] = false; chrom.fitness(binary_value(chrom));
+00056   std::cout << "chrom:  " << chrom << std::endl;
+00057   chrom[0] = chrom[SIZE - 1] = true; chrom.fitness(binary_value(chrom));
+00058 
+00059   std::cout << "chrom.className() = " << chrom.className() << std::endl;
+00060 
+00061   std::cout << "chrom:  " << chrom << std::endl
+00062        << "chrom2: " << chrom2 << std::endl;
+00063 
+00064   std::ostringstream os;
+00065   os << chrom;
+00066   std::istringstream is(os.str());
+00067   is >> chrom2; chrom.fitness(binary_value(chrom2));
+00068 
+00069   std::cout << "\nTesting reading, writing\n";
+00070   std::cout << "chrom:  " << chrom << "\nchrom2: " << chrom2 << '\n';
+00071 
+00072   std::fill(chrom.begin(), chrom.end(), false);
+00073   std::cout << "--------------------------------------------------"
+00074        << std::endl << "eoMonOp's aplied to .......... " << chrom << std::endl;
+00075 
+00076   eoInitFixedLength<Chrom>
+00077       random(chrom.size(), gen);
+00078 
+00079   random(chrom); chrom.fitness(binary_value(chrom));
+00080   std::cout << "after eoBinRandom ............ " << chrom << std::endl;
+00081 
+00082   eoOneBitFlip<Chrom> bitflip;
+00083   bitflip(chrom); chrom.fitness(binary_value(chrom));
+00084   std::cout << "after eoBitFlip .............. " << chrom << std::endl;
+00085 
+00086   eoBitMutation<Chrom> mutation(0.5);
+00087   mutation(chrom); chrom.fitness(binary_value(chrom));
+00088   std::cout << "after eoBinMutation(0.5) ..... " << chrom << std::endl;
+00089 
+00090   eoBitInversion<Chrom> inversion;
+00091   inversion(chrom); chrom.fitness(binary_value(chrom));
+00092   std::cout << "after eoBinInversion ......... " << chrom << std::endl;
+00093 
+00094   eoBitNext<Chrom> next;
+00095   next(chrom); chrom.fitness(binary_value(chrom));
+00096   std::cout << "after eoBinNext .............. " << chrom << std::endl;
+00097 
+00098   eoBitPrev<Chrom> prev;
+00099   prev(chrom); chrom.fitness(binary_value(chrom));
+00100   std::cout << "after eoBinPrev .............. " << chrom << std::endl;
+00101 
+00102   std::fill(chrom.begin(), chrom.end(), false); chrom.fitness(binary_value(chrom));
+00103   std::fill(chrom2.begin(), chrom2.end(), true); chrom2.fitness(binary_value(chrom2));
+00104   std::cout << "--------------------------------------------------"
+00105        << std::endl << "eoBinOp's aplied to ... "
+00106        << chrom << " " << chrom2 << std::endl;
+00107 
+00108   eo1PtBitXover<Chrom> xover;
+00109   std::fill(chrom.begin(), chrom.end(), false);
+00110   std::fill(chrom2.begin(), chrom2.end(), true);
+00111   xover(chrom, chrom2);
+00112   chrom.fitness(binary_value(chrom)); chrom2.fitness(binary_value(chrom2));
+00113   std::cout << "eoBinCrossover ........ " << chrom << " " << chrom2 << std::endl;
+00114 
+00115   for (i = 1; i < SIZE; i++)
+00116     {
+00117       eoNPtsBitXover<Chrom> nxover(i);
+00118       std::fill(chrom.begin(), chrom.end(), false);
+00119       std::fill(chrom2.begin(), chrom2.end(), true);
+00120       nxover(chrom, chrom2);
+00121       chrom.fitness(binary_value(chrom)); chrom2.fitness(binary_value(chrom2));
+00122       std::cout << "eoBinNxOver(" << i << ") ........ "
+00123            << chrom << " " << chrom2 << std::endl;
+00124     }
+00125 
+00126   for (i = 1; i < SIZE / 2; i++)
+00127     for (j = 1; j < SIZE / 2; j++)
+00128       {
+00129         eoBitGxOver<Chrom> gxover(i, j);
+00130         std::fill(chrom.begin(), chrom.end(), false);
+00131         std::fill(chrom2.begin(), chrom2.end(), true);
+00132         gxover(chrom, chrom2);
+00133         chrom.fitness(binary_value(chrom)); chrom2.fitness(binary_value(chrom2));
+00134         std::cout  << "eoBinGxOver(" << i << ", " << j << ") ..... "
+00135               << chrom << " " << chrom2 << std::endl;
+00136       }
+00137 
+00138     // test SGA algorithm
+00139     eoGenContinue<Chrom> continuator1(50);
+00140     eoFitContinue<Chrom> continuator2(65535.f);
+00141 
+00142     eoCombinedContinue<Chrom> continuator(continuator1, continuator2);
+00143 
+00144     eoCheckPoint<Chrom> checkpoint(continuator);
+00145 
+00146     eoStdoutMonitor monitor;
+00147 
+00148     checkpoint.add(monitor);
+00149 
+00150     eoSecondMomentStats<Chrom> stats;
+00151 
+00152     monitor.add(stats);
+00153     checkpoint.add(stats);
+00154 
+00155     eoProportionalSelect<Chrom> select;
+00156     eoEvalFuncPtr<Chrom>  eval(binary_value);
+00157 
+00158     eoSGA<Chrom> sga(select, xover, 0.8f, bitflip, 0.1f, eval, checkpoint);
+00159 
+00160     eoInitFixedLength<Chrom> init(16, gen);
+00161     eoPop<Chrom> pop(100, init);
+00162 
+00163     apply<Chrom>(eval, pop);
+00164 
+00165     sga(pop);
+00166 
+00167     pop.sort();
+00168 
+00169     std::cout << "Population " << pop << std::endl;
+00170 
+00171     std::cout << "\nBest: " << pop[0].fitness() << '\n';
+00172 
+00173   /*
+00174 
+00175     Commented this out, waiting for a definite decision what to do with the mOp's
+00176 
+00177     // Check multiOps
+00178     eoMultiMonOp<Chrom> mOp( &next );
+00179     mOp.adOp( &bitflip );
+00180     std::cout << "before multiMonOp............  " << chrom << std::endl;
+00181     mOp( chrom );
+00182     std::cout << "after multiMonOp .............. " << chrom << std::endl;
+00183 
+00184     eoBinGxOver<Chrom> gxover(2, 4);
+00185     eoMultiBinOp<Chrom> mbOp( &gxover );
+00186     mOp.adOp( &bitflip );
+00187     std::cout << "before multiBinOp............  " << chrom << " " << chrom2 << std::endl;
+00188     mbOp( chrom, chrom2 );
+00189     std::cout << "after multiBinOp .............. " << chrom << " " << chrom2 <<std::endl;
+00190   */
+00191 }
+00192 
+00193 //-----------------------------------------------------------------------------
+00194 // For MSVC memory lead detection
+00195 #ifdef _MSC_VER
+00196 #include <crtdbg.h>
+00197 #endif
+00198 
+00199 int main()
+00200 {
+00201 #ifdef _MSC_VER
+00202   //  rng.reseed(42);
+00203     int flag = _CrtSetDbgFlag(_CRTDBG_LEAK_CHECK_DF);
+00204      flag |= _CRTDBG_LEAK_CHECK_DF;
+00205     _CrtSetDbgFlag(flag);
+00206 //   _CrtSetBreakAlloc(100);
+00207 #endif
+00208 
+00209     try
+00210     {
+00211         main_function();
+00212     }
+00213     catch(std::exception& e)
+00214     {
+00215         std::cout << "Exception: " << e.what() << '\n';
+00216     }
+00217 
+00218 }
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eobreeder_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eobreeder_8cpp-source.html
new file mode 100644
index 000000000..183f8f7aa
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eobreeder_8cpp-source.html
@@ -0,0 +1,102 @@
+
+
+EO: t-eobreeder.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eobreeder.cpp
    00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // t-eobreeder.cpp
+00005 //   This program test the breeder object
+00006 // (c) GeNeura Team, 1998 
+00007 /* 
+00008     This library is free software; you can redistribute it and/or
+00009     modify it under the terms of the GNU General Public
+00010     License as published by the Free Software Foundation; either
+00011     version 2 of the License, or (at your option) any later version.
+00012 
+00013     This library is distributed in the hope that it will be useful,
+00014     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00015     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+00016     Lesser General Public License for more details.
+00017 
+00018     You should have received a copy of the GNU Lesser General Public
+00019     License along with this library; if not, write to the Free Software
+00020     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00021 
+00022     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00023             
+00024 */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef __GNUG__
+00028 // to avoid long name warnings
+00029 #pragma warning(disable:4786)
+00030 #endif // __GNUG__
+00031 
+00032 #include <ga/eoBin.h>  // eoBin, eoPop, eoBreeder
+00033 #include <eoPop.h>
+00034 #include <ga/eoBitOp.h>
+00035 #include <eoProportionalOpSel.h>
+00036 #include <eoBreeder.h>
+00037 
+00038 //-----------------------------------------------------------------------------
+00039 
+00040 typedef eoBin<float> Chrom;
+00041 
+00042 #include "binary_value.h"
+00043 
+00044 //-----------------------------------------------------------------------------
+00045 
+00046 main()
+00047 {
+00048   const unsigned POP_SIZE = 8, CHROM_SIZE = 4;
+00049   unsigned i;
+00050 
+00051   eoBinRandom<Chrom> random;
+00052   eoPop<Chrom> pop; 
+00053 
+00054   BinaryValue eval;
+00055   
+00056   for (i = 0; i < POP_SIZE; ++i)
+00057     {
+00058       Chrom chrom(CHROM_SIZE);
+00059       random(chrom);
+00060       eval(chrom);
+00061       pop.push_back(chrom);
+00062     }
+00063   
+00064   std::cout << "population:" << std::endl;
+00065   for (i = 0; i < pop.size(); ++i)
+00066     std::cout << pop[i] << " " << pop[i].fitness() << std::endl;
+00067 
+00068   eoBinBitFlip<Chrom> bitflip;
+00069   eoBinCrossover<Chrom> xover;
+00070   eoProportionalOpSel<Chrom> propSel;
+00071   eoBreeder<Chrom> breeder( propSel );
+00072   propSel.addOp(bitflip, 0.25);
+00073   propSel.addOp(xover, 0.75);
+00074 
+00075   breeder(pop);
+00076 
+00077   // reevaluation of fitness 
+00078   for_each(pop.begin(), pop.end(), BinaryValue());
+00079 
+00080   std::cout << "new population:" << std::endl;
+00081   for (i = 0; i < pop.size(); ++i)
+00082     std::cout << pop[i] << " " << pop[i].fitness() << std::endl;
+00083 
+00084   return 0;
+00085 }
+00086 
+00087 //-----------------------------------------------------------------------------
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eofitness_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eofitness_8cpp-source.html
new file mode 100644
index 000000000..95e657cfc
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eofitness_8cpp-source.html
@@ -0,0 +1,105 @@
+
+
+EO: t-eofitness.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eofitness.cpp
    00001 //-----------------------------------------------------------------------------
+00002 // t-eofitness.cpp
+00003 // (c) GeNeura Team 1998
+00004 //-----------------------------------------------------------------------------
+00005 
+00006 #include <time.h>    // time
+00007 #include <stdlib.h>  // srand, rand
+00008 #include <iostream>  // std::cout
+00009 
+00010 #include <eoScalarFitness.h>
+00011 
+00012 using namespace std;
+00013 
+00014 //-----------------------------------------------------------------------------
+00015 
+00016 template <class Fitness>
+00017 int test_fitness(Fitness a, Fitness b)
+00018 {
+00019 //  srand(time(0));
+00020 
+00021 //  Fitness a = aval; //static_cast<double>(rand()) / RAND_MAX; 
+00022 //  Fitness b = bval; //static_cast<double>(rand()) / RAND_MAX;
+00023 
+00024   std::cout.precision(2);
+00025   
+00026   unsigned repeat = 2;
+00027   while (repeat--)
+00028     {
+00029       std::cout << "------------------------------------------------------" << std::endl;
+00030       std::cout << "testing <    ";
+00031       if (a < b)
+00032         std::cout << a << " < " << b << "  is true" << std::endl;
+00033       else
+00034         std::cout << a << " < " << b << "  is false" <<std::endl;
+00035       
+00036       std::cout << "testing >    ";
+00037       if (a > b)
+00038         std::cout << a << " > " << b << "  is true" << std::endl;
+00039       else
+00040         std::cout << a << " > " << b << "  is false" <<std::endl;
+00041       
+00042       std::cout << "testing ==   ";
+00043       if (a == b)
+00044         std::cout << a << " == " << b << " is true" << std::endl;
+00045       else
+00046         std::cout << a << " == " << b << " is false" <<std::endl;
+00047       
+00048       std::cout << "testing !=   ";
+00049       if (a != b)
+00050         std::cout << a << " != " << b << " is true" << std::endl;
+00051       else
+00052         std::cout << a << " != " << b << " is false" <<std::endl;
+00053       
+00054       a = b;
+00055     }
+00056   return 1;
+00057 }
+00058 
+00059 int main()
+00060 {
+00061     std::cout << "Testing minimizing fitness with 1 and 2" << std::endl;
+00062     std::cout << "------------------------------------------------------" << std::endl;
+00063 
+00064     eoMinimizingFitness a = 1;
+00065     eoMinimizingFitness b = 2;
+00066 
+00067     test_fitness(a, b);
+00068 
+00069     std::cout << "Testing minimizing fitness with 2 and 1" << std::endl;
+00070     std::cout << "------------------------------------------------------" << std::endl;
+00071 
+00072     test_fitness(b, a);
+00073 
+00074     std::cout << "Testing maximizing fitness with 1 and 2" << std::endl;
+00075     std::cout << "------------------------------------------------------" << std::endl;
+00076     
+00077     eoMaximizingFitness a1 = 1;
+00078     eoMaximizingFitness b1 = 2;
+00079 
+00080     test_fitness(a1,b1);
+00081     
+00082     std::cout << "Testing maximizing fitness with 2 and 1" << std::endl;
+00083     std::cout << "------------------------------------------------------" << std::endl;
+00084     
+00085     test_fitness(b1,a1);
+00086 
+00087 }
+00088 
+00089 //-----------------------------------------------------------------------------
+00090 
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eogeneration_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eogeneration_8cpp-source.html
new file mode 100644
index 000000000..d615e566d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eogeneration_8cpp-source.html
@@ -0,0 +1,160 @@
+
+
+EO: t-eogeneration.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eogeneration.cpp
    00001 /* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003     t-eogeneration.cpp
+00004       Testing the eoGeneration classes, and classes related to it
+00005 
+00006     (c) GeNeura Team, 1999, 2000
+00007  
+00008     This program is free software; you can redistribute it and/or modify
+00009     it under the terms of the GNU General Public License as published by
+00010     the Free Software Foundation; either version 2 of the License, or
+00011     (at your option) any later version.
+00012 
+00013     This program is distributed in the hope that it will be useful,
+00014     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00015     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00016     GNU General Public License for more details.
+00017 
+00018     You should have received a copy of the GNU General Public License
+00019     along with this program; if not, write to the Free Software
+00020     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00021  
+00022     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00023             
+00024 */
+00025 
+00026 //-----------------------------------------------------------------------------// 
+00027 
+00028 
+00029 // to avoid long name warnings
+00030 #ifdef _MSC_VER
+00031 #pragma warning(disable:4786)
+00032 #endif 
+00033 
+00034 #include <eoGeneration.h>
+00035 #include <eoEvalFuncPtrCnt.h>
+00036 
+00037 #include "binary_value.h"
+00038 
+00039 //-----------------------------------------------------------------------------
+00040 
+00041 typedef eoBin<float> Chrom;
+00042 
+00043 //-----------------------------------------------------------------------------
+00044 
+00045 main()
+00046 {
+00047   const unsigned POP_SIZE = 8, CHROM_SIZE = 16;
+00048   unsigned i;
+00049 
+00050   eoBinRandom<Chrom> random;
+00051   eoPop<Chrom> pop; 
+00052 
+00053   // Evaluation
+00054   eoEvalFuncPtr<Chrom> eval( binary_value );
+00055 
+00056   for (i = 0; i < POP_SIZE; ++i)
+00057     {
+00058       Chrom chrom(CHROM_SIZE);
+00059       random(chrom);
+00060       eval(chrom);
+00061       pop.push_back(chrom);
+00062     }
+00063   
+00064   std::cout << "population:" << std::endl;
+00065   for (i = 0; i < pop.size(); ++i)
+00066     std::cout << "\t" << pop[i] << " " << pop[i].fitness() << std::endl;
+00067 
+00068   
+00069   // selection
+00070   eoLottery<Chrom> lottery;
+00071 
+00072   // breeder
+00073   eoBinBitFlip<Chrom> bitflip;
+00074   eoBinCrossover<Chrom> xover;
+00075   eoProportionalOpSel<Chrom> propSel;
+00076   eoBreeder<Chrom> breeder( propSel );
+00077   propSel.addOp(bitflip, 0.25);
+00078   propSel.addOp(xover, 0.75);
+00079   
+00080   // replacement
+00081   eoInclusion<Chrom> inclusion;
+00082 
+00083   
+00084 
+00085   // GA generation
+00086   eoGeneration<Chrom> generation(lottery, breeder, inclusion, eval);
+00087 
+00088   // evolution
+00089   unsigned g = 0;
+00090   do {
+00091     try
+00092       {
+00093         generation(pop);
+00094       }
+00095     catch (std::exception& e)
+00096       {
+00097         std::cout << "exception: " << e.what() << std::endl;;
+00098         exit(EXIT_FAILURE);
+00099       }
+00100     
+00101     std::cout << "pop[" << ++g << "]" << std::endl;
+00102     for (i = 0; i < pop.size(); ++i)
+00103       std::cout << "\t" <<  pop[i] << " " << pop[i].fitness() << std::endl;
+00104     
+00105   } while (pop[0].fitness() < pow(2.0, CHROM_SIZE) - 1);
+00106 
+00107   // Try again, with a "counted" evaluation function
+00108   // GA generation
+00109   // Evaluation
+00110   eoEvalFuncPtrCnt<Chrom> eval2( binary_value );
+00111   eoPop<Chrom> pop2; 
+00112   
+00113   for (i = 0; i < POP_SIZE; ++i)
+00114     {
+00115       Chrom chrom(CHROM_SIZE);
+00116       random(chrom);
+00117       binary_value(chrom);
+00118       eval2(chrom);
+00119       pop2.push_back(chrom);
+00120     }
+00121   eoGeneration<Chrom> generation2(lottery, breeder, inclusion, eval2);
+00122   
+00123   // evolution
+00124   do {
+00125     try
+00126       {
+00127         generation2(pop2);
+00128       }
+00129     catch (std::exception& e)
+00130       {
+00131         std::cout << "exception: " << e.what() << std::endl;;
+00132         exit(EXIT_FAILURE);
+00133       }
+00134     
+00135     std::cout << "pop[" << ++g << "]" << std::endl;
+00136     for (i = 0; i < pop2.size(); ++i)
+00137       std::cout << "\t" <<  pop2[i] << " " << pop[i].fitness() << std::endl;
+00138     
+00139   } while (pop2[0].fitness() < pow(2.0, CHROM_SIZE) - 1);
+00140 
+00141   std::cout << "Number of evaluations " << eval2.getNumOfEvaluations() << std::endl;
+00142   return 0;
+00143 }
+00144 
+00145 //-----------------------------------------------------------------------------
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eoinclusion_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eoinclusion_8cpp-source.html
new file mode 100644
index 000000000..50d41d8e8
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eoinclusion_8cpp-source.html
@@ -0,0 +1,112 @@
+
+
+EO: t-eoinclusion.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoinclusion.cpp
    00001 //-----------------------------------------------------------------------------
+00002 // t-eoinclusion.cpp
+00003 //-----------------------------------------------------------------------------
+00004 
+00005 #include <ga/eoBin.h>
+00006 #include <eoPop.h>
+00007 #include <eoInclusion.h>
+00008 
+00009 //-----------------------------------------------------------------------------
+00010 
+00011 typedef eoBin<float> Chrom;
+00012 
+00013 #include "binary_value.h"
+00014 
+00015 //-----------------------------------------------------------------------------
+00016 
+00017 main()
+00018 {
+00019   const unsigned CHROM_SIZE = 4;
+00020 
+00021   eoBinRandom<Chrom> random;
+00022   BinaryValue eval;
+00023 
+00024   for (unsigned POP_SIZE = 4; POP_SIZE <=6; POP_SIZE++)
+00025     {
+00026       eoPop<Chrom> pop; 
+00027       unsigned i;
+00028       for ( i = 0; i < POP_SIZE; i++)
+00029             {
+00030               Chrom chrom(CHROM_SIZE);
+00031               random(chrom);
+00032               eval(chrom);
+00033               pop.push_back(chrom);
+00034             }
+00035       
+00036       for (unsigned POP2_SIZE = 4; POP2_SIZE <=6; POP2_SIZE++)
+00037         {
+00038           eoPop<Chrom> pop2, pop3, pop4, pop5;
+00039                 
+00040           for (i = 0; i < POP2_SIZE; i++)
+00041             {
+00042               Chrom chrom(CHROM_SIZE);
+00043               random(chrom);
+00044               eval(chrom);
+00045               pop2.push_back(chrom);
+00046             }
+00047         
+00048           std::cout << "--------------------------------------------------" << std::endl
+00049                << "breeders \tpop" << std::endl
+00050                << "--------------------------------------------------" << std::endl;
+00051           for (i = 0; i < max(pop.size(), pop2.size()); i++)
+00052             {     
+00053               if (pop.size() > i) 
+00054                 std::cout << pop[i] << " " << pop[i].fitness() << "   \t";
+00055               else
+00056                 std::cout << "\t\t";
+00057               if (pop2.size() > i)
+00058                 std::cout << pop2[i] << " " << pop2[i].fitness();
+00059               std::cout << std::endl;
+00060             }
+00061         
+00062           eoInclusion<Chrom> inclusion(0.75);
+00063           pop3 = pop2;
+00064           inclusion(pop, pop3); 
+00065           
+00066           eoInclusion<Chrom> inclusion2; 
+00067           pop4 = pop2;
+00068           inclusion2(pop, pop4); 
+00069           
+00070           eoInclusion<Chrom> inclusion3(1.5);
+00071           pop5 = pop2;
+00072           inclusion3(pop, pop5); 
+00073           
+00074           std::cout << std::endl
+00075                << "0.75 \t\t1.0 \t\t1.5" << std::endl
+00076                << "---- \t\t--- \t\t---" << std::endl;
+00077           for (i = 0; i < pop5.size(); i++)
+00078             {
+00079               if (pop3.size() > i)
+00080                 std::cout << pop3[i] << " " << pop3[i].fitness() << "   \t";
+00081               else
+00082                 std::cout << " \t\t";
+00083               if (pop4.size() > i)
+00084                 std::cout << pop4[i] << " " << pop4[i].fitness() << "   \t";
+00085               else
+00086                 std::cout << " \t\t";
+00087               if (pop5.size() > i)
+00088                 std::cout << pop5[i] << " " << pop5[i].fitness();
+00089               std::cout << std::endl;
+00090             }
+00091         }
+00092     }
+00093   
+00094   return 0;
+00095 }
+00096 
+00097 //-----------------------------------------------------------------------------
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eoinsertion_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eoinsertion_8cpp-source.html
new file mode 100644
index 000000000..f4a81c3ff
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eoinsertion_8cpp-source.html
@@ -0,0 +1,123 @@
+
+
+EO: t-eoinsertion.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoinsertion.cpp
    00001 //-----------------------------------------------------------------------------
+00002 // t-eoinsertion.cpp
+00003 //-----------------------------------------------------------------------------
+00004 
+00005 #include <eo>  // eoBin, eoPop, eoInsertion
+00006 
+00007 //-----------------------------------------------------------------------------
+00008 
+00009 typedef eoBin<float> Chrom;
+00010 
+00011 //-----------------------------------------------------------------------------
+00012 
+00013 void binary_value(Chrom& chrom)
+00014 {
+00015   float sum = 0;
+00016   for (unsigned i = 0; i < chrom.size(); i++)
+00017     if (chrom[i])
+00018       sum += pow(2, chrom.size() - i - 1);
+00019   chrom.fitness(sum);
+00020 }
+00021 
+00022 //-----------------------------------------------------------------------------
+00023 
+00024 main()
+00025 {
+00026   const unsigned CHROM_SIZE = 4;
+00027   unsigned i;
+00028  
+00029   eoBinRandom<Chrom> random;
+00030 
+00031   for (unsigned POP_SIZE = 4; POP_SIZE <=6; POP_SIZE++)
+00032     {
+00033       eoPop<Chrom> pop; 
+00034       
+00035       for (i = 0; i < POP_SIZE; i++)
+00036             {
+00037               Chrom chrom(CHROM_SIZE);
+00038               random(chrom);
+00039               binary_value(chrom);
+00040               pop.push_back(chrom);
+00041             }
+00042       
+00043       for (unsigned POP2_SIZE = 4; POP2_SIZE <=6; POP2_SIZE++)
+00044         {
+00045           eoPop<Chrom> pop2, pop3, pop4, pop5, popx;
+00046                 
+00047           for (i = 0; i < POP2_SIZE; i++)
+00048             {
+00049               Chrom chrom(CHROM_SIZE);
+00050               random(chrom);
+00051               binary_value(chrom);
+00052               pop2.push_back(chrom);
+00053             }
+00054         
+00055           std::cout << "--------------------------------------------------" << std::endl
+00056                << "breeders \tpop" << std::endl
+00057                << "--------------------------------------------------" << std::endl;
+00058           for (i = 0; i < max(pop.size(), pop2.size()); i++)
+00059             {     
+00060               if (pop.size() > i) 
+00061                 std::cout << pop[i] << " " << pop[i].fitness() << "   \t";
+00062               else
+00063                 std::cout << "\t\t";
+00064               if (pop2.size() > i)
+00065                 std::cout << pop2[i] << " " << pop2[i].fitness();
+00066               std::cout << std::endl;
+00067             }
+00068         
+00069           eoInsertion<Chrom> insertion(0.75);
+00070           popx = pop;
+00071           pop3 = pop2;
+00072           insertion(popx, pop3);
+00073           
+00074           eoInsertion<Chrom> insertion2;
+00075           popx = pop; 
+00076           pop4 = pop2;
+00077           insertion2(popx, pop4); 
+00078           
+00079           eoInsertion<Chrom> insertion3(1.5);
+00080           popx = pop;
+00081           pop5 = pop2;
+00082           insertion3(popx, pop5); 
+00083           
+00084           std::cout << std::endl
+00085                << "0.75 \t\t1.0 \t\t1.5" << std::endl
+00086                << "---- \t\t--- \t\t---" << std::endl;
+00087           for (i = 0; i < pop5.size(); i++)
+00088             {
+00089               if (pop3.size() > i)
+00090                 std::cout << pop3[i] << " " << pop3[i].fitness() << "   \t";
+00091               else
+00092                 std::cout << " \t\t";
+00093               if (pop4.size() > i)
+00094                 std::cout << pop4[i] << " " << pop4[i].fitness() << "   \t";
+00095               else
+00096                 std::cout << " \t\t";
+00097               if (pop5.size() > i)
+00098                 std::cout << pop5[i] << " " << pop5[i].fitness();
+00099               std::cout << std::endl;
+00100             }
+00101         }
+00102     }
+00103   
+00104   return 0;
+00105 }
+00106 
+00107 //-----------------------------------------------------------------------------
+00108 
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eolottery_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eolottery_8cpp-source.html
new file mode 100644
index 000000000..f738d45b7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eolottery_8cpp-source.html
@@ -0,0 +1,69 @@
+
+
+EO: t-eolottery.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eolottery.cpp
    00001 //-----------------------------------------------------------------------------
+00002 // t-eolottery.cpp
+00003 //-----------------------------------------------------------------------------
+00004 
+00005 #include <eo>  // eoBin, eoPop, eoLottery
+00006 
+00007 //-----------------------------------------------------------------------------
+00008 
+00009 typedef eoBin<float> Chrom;
+00010 
+00011 void binary_value(Chrom& chrom)
+00012 {
+00013   float sum = 0; 
+00014   for (unsigned i = 0; i < chrom.size(); i++)
+00015     if (chrom[i])
+00016       sum += pow(2, i);
+00017   chrom.fitness(sum);
+00018 }
+00019 
+00020 //-----------------------------------------------------------------------------
+00021 
+00022 main()
+00023 {
+00024   const unsigned POP_SIZE = 8, CHROM_SIZE = 4;
+00025 
+00026   eoPop<Chrom> pop, pop2;
+00027   eoBinRandom<Chrom> random;
+00028   unsigned i;
+00029 
+00030   for (i = 0; i < POP_SIZE; i++)
+00031     {
+00032       Chrom chrom(CHROM_SIZE);
+00033       random(chrom);
+00034       binary_value(chrom);
+00035       pop.push_back(chrom);
+00036     }
+00037   
+00038   std::cout << "original population:" << std::endl;
+00039   sort(pop.begin(), pop.end());
+00040   for (i = 0; i < pop.size(); i++)
+00041     std::cout << pop[i] << "  " << pop[i].fitness() << std::endl;
+00042   
+00043   eoLottery<Chrom> lottery;
+00044   lottery(pop, pop2); 
+00045 
+00046   std::cout << "selected by lottery population:" << std::endl;
+00047   sort(pop2.begin(), pop2.end());
+00048   for (i = 0; i < pop2.size(); i++)
+00049     std::cout << pop2[i] << "  " << pop2[i].fitness() << std::endl;
+00050 
+00051   return 0;
+00052 }
+00053 
+00054 //-----------------------------------------------------------------------------
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-eoproblem_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-eoproblem_8cpp-source.html
new file mode 100644
index 000000000..38db876b7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-eoproblem_8cpp-source.html
@@ -0,0 +1,70 @@
+
+
+EO: t-eoproblem.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-eoproblem.cpp
    00001 //-----------------------------------------------------------------------------
+00002 // t-eoproblem.cpp
+00003 // (c) GeNeura Team 1998
+00004 //-----------------------------------------------------------------------------
+00005 
+00006 #include <time.h>    // time
+00007 #include <math.h>    // fabs
+00008 #include <iostream>  // std::cout
+00009 #include <eo>        // eoVector, eoProblem
+00010 
+00011 //-----------------------------------------------------------------------------
+00012 
+00013 typedef eoVector<float, float> Chrom;
+00014 
+00015 //-----------------------------------------------------------------------------
+00016 
+00017 std::ostream& operator<<(std::ostream& os, const Chrom& chrom)
+00018 {
+00019   copy(chrom.begin(), chrom.end(), std::ostream_iterator<int>(os));
+00020   return os;
+00021 }
+00022 
+00023 //-----------------------------------------------------------------------------
+00024 
+00025 class Easy//: public eoProblem<Chrom>
+00026 {
+00027 public:
+00028   static const unsigned size;
+00029   
+00030   float operator()(const Chrom& chrom)
+00031     {
+00032       return 1.0 / (fabs(chrom[0]) + 1.0);
+00033     }
+00034 };
+00035 const unsigned Easy::size = 1;
+00036 
+00037 //-----------------------------------------------------------------------------
+00038 
+00039 int main()
+00040 {
+00041   Easy easy;
+00042   Chrom chrom(Easy::size);
+00043   
+00044   srand(time(0));
+00045   
+00046   chrom[0] = ((float)rand()) / ((float)RAND_MAX);
+00047   chrom.fitness(easy(chrom));
+00048   
+00049   std::cout << "chrom = " << chrom << std::endl
+00050        << "chrom.fitness() = " << chrom.fitness() << std::endl;
+00051 
+00052   return 0;
+00053 }
+00054 
+00055 //-----------------------------------------------------------------------------
+
    Generated on Thu Oct 19 05:06:43 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/t-select_one_8cpp-source.html b/trunk/paradiseo-eo/doc/html/t-select_one_8cpp-source.html
new file mode 100644
index 000000000..d84fba19a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/t-select_one_8cpp-source.html
@@ -0,0 +1,103 @@
+
+
+EO: t-selectOne.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    t-selectOne.cpp
    00001 // -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 // t-selectOne.cpp
+00005 //   This program test the breeder object
+00006 // (c) GeNeura Team, 1998 
+00007 /* 
+00008     This program is free software; you can redistribute it and/or modify
+00009     it under the terms of the GNU General Public License as published by
+00010     the Free Software Foundation; either version 2 of the License, or
+00011     (at your option) any later version.
+00012 
+00013     This program is distributed in the hope that it will be useful,
+00014     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00015     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00016     GNU General Public License for more details.
+00017 
+00018     You should have received a copy of the GNU General Public License
+00019     along with this program; if not, write to the Free Software
+00020     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00021 
+00022     Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+00023             
+00024 */
+00025 //-----------------------------------------------------------------------------
+00026 
+00027 #ifndef __GNUG__
+00028 // to avoid long name warnings
+00029 #pragma warning(disable:4786)
+00030 #endif // __GNUG__
+00031 
+00032 #include <ga/eoBin.h>  // eoBin, eoPop, eoBreeder
+00033 #include <eoPop.h>
+00034 #include <ga/eoBitOp.h>
+00035 
+00036 #include <eoUniformSelect.h>
+00037 #include <eoStochTournament.h>
+00038 #include <eoDetTournament.h>
+00039 
+00040 
+00041 //-----------------------------------------------------------------------------
+00042 
+00043 typedef eoBin<float> Chrom;
+00044 
+00045 #include "binary_value.h"
+00046 
+00047 //-----------------------------------------------------------------------------
+00048 
+00049 main()
+00050 {
+00051   const unsigned POP_SIZE = 8, CHROM_SIZE = 4;
+00052   unsigned i;
+00053 
+00054   eoBinRandom<Chrom> random;
+00055   eoPop<Chrom> pop; 
+00056 
+00057   // Create the population
+00058   for (i = 0; i < POP_SIZE; ++i) {
+00059     Chrom chrom(CHROM_SIZE);
+00060     random(chrom);
+00061     BinaryValue()(chrom);
+00062     pop.push_back(chrom);
+00063   }
+00064   
+00065   // print population
+00066   std::cout << "population:" << std::endl;
+00067   for (i = 0; i < pop.size(); ++i)
+00068     std::cout << pop[i] << " " << pop[i].fitness() << std::endl;
+00069 
+00070   // Declare 1-selectors
+00071   eoUniformSelect<Chrom> uSelect;
+00072 
+00073   Chrom aChrom;
+00074   aChrom = uSelect( pop );
+00075   std::cout << "Uniform Select " << aChrom << " " << aChrom.fitness() << std::endl;
+00076 
+00077   eoStochTournament<Chrom> sSelect(0.7);
+00078   aChrom = sSelect( pop );
+00079   std::cout << "Stochastic Tournament " << aChrom << " " << aChrom.fitness() << std::endl;
+00080 
+00081   eoDetTournament<Chrom> dSelect(3);
+00082   aChrom = dSelect( pop );
+00083   std::cout << "Deterministic Tournament " << aChrom << " " << aChrom.fitness() << std::endl;
+00084 
+00085   return 0;
+00086 }
+00087 
+00088 //-----------------------------------------------------------------------------
+
    Generated on Thu Oct 19 05:06:44 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/test_2binary__value_8h-source.html b/trunk/paradiseo-eo/doc/html/test_2binary__value_8h-source.html
new file mode 100644
index 000000000..07070991d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/test_2binary__value_8h-source.html
@@ -0,0 +1,26 @@
+
+
+EO: binary_value.h Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    test/binary_value.h
    00001 #include <algorithm>
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 
+00010 template <class Chrom> double binary_value(const Chrom& _chrom)
+00011 {
+00012     double sum = 0.0;
+00013     for (unsigned i=0; i<_chrom.size(); i++)
+00014         sum += _chrom[i];
+00015     return sum;
+00016 }
+
    Generated on Thu Oct 19 05:06:34 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/test_2real__value_8h-source.html b/trunk/paradiseo-eo/doc/html/test_2real__value_8h-source.html
new file mode 100644
index 000000000..955f538c0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/test_2real__value_8h-source.html
@@ -0,0 +1,29 @@
+
+
+EO: real_value.h Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+test
    
+
    test/real_value.h
    00001 #include <vector>
+00002 //-----------------------------------------------------------------------------
+00003 
+00004 
+00010 double real_value(const std::vector<double>& _ind)
+00011 {
+00012   double sum = 0;
+00013   for (unsigned i = 0; i < _ind.size(); i++)
+00014       sum += _ind[i] * _ind[i];
+00015   return sum/_ind.size();
+00016 }
+00017 
+00018 
+00019 
+
    Generated on Thu Oct 19 05:06:42 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/test__compile_8cpp-source.html b/trunk/paradiseo-eo/doc/html/test__compile_8cpp-source.html
new file mode 100644
index 000000000..62990dfd4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/test__compile_8cpp-source.html
@@ -0,0 +1,200 @@
+
+
+EO: test_compile.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+contrib / mathsym / test
    
+
    test_compile.cpp
    00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #include <utils/eoRNG.h>
+00019 
+00020 #include <FunDef.h>
+00021 #include <sym_compile.h>
+00022 
+00023 #include <Dataset.h>
+00024 #include <ErrorMeasure.h>
+00025 #include <LanguageTable.h>
+00026 #include <BoundsCheck.h>
+00027 #include <TreeBuilder.h>
+00028 
+00029 #include <iostream>
+00030 
+00031 using namespace std;
+00032 
+00033 void test_xover();
+00034 
+00035 int main() {
+00036     Dataset dataset;
+00037     dataset.load_data("test_data.txt");
+00038     
+00039     cout << "Records/Fields " << dataset.n_records() << ' ' << dataset.n_fields() << endl;
+00040    
+00041     LanguageTable table;
+00042     table.add_function(sum_token, 2);
+00043     table.add_function(prod_token, 2);
+00044     table.add_function(sum_token, 0);
+00045     table.add_function(prod_token, 0);
+00046     table.add_function(inv_token, 1);
+00047     table.add_function(min_token, 1);
+00048    
+00049     for (unsigned i = 0; i < dataset.n_fields(); ++i) {
+00050         table.add_function( SymVar(i).token(), 0);
+00051     }
+00052     
+00053     TreeBuilder builder(table);
+00054     
+00055     IntervalBoundsCheck bounds(dataset.input_minima(), dataset.input_maxima() );
+00056     ErrorMeasure measure(dataset, 1.0);
+00057     
+00058     
+00059     unsigned n = 1000;
+00060     unsigned k = 0;
+00061     
+00062     vector<Sym> pop;
+00063     double sumsize = 0; 
+00064     for (unsigned i = 0; i < n; ++i) {
+00065 
+00066         Sym sym = builder.build_tree(6, i%2);
+00067         pop.push_back(sym);
+00068         sumsize += sym.size();
+00069     }
+00070    
+00071     cout << "Size " << sumsize/pop.size() << endl;
+00072     
+00073     // shuffle
+00074     for (unsigned gen = 0; gen < 10; ++gen) {
+00075         random_shuffle(pop.begin(), pop.end());
+00076         for (unsigned i = 0; i < pop.size(); i+=2) {
+00077             
+00078             unsigned p1 = rng.random(pop[i].size());
+00079             unsigned p2 = rng.random(pop[i+1].size());
+00080 
+00081             Sym a = insert_subtree(pop[i], p1, get_subtree(pop[i+1], p2));
+00082             Sym b = insert_subtree(pop[i+1], p2, get_subtree(pop[i], p1));
+00083 
+00084             pop[i] = a;
+00085             pop[i+1] = b;
+00086             
+00087         }
+00088         cout << gen << ' ' << Sym::get_dag().size() << endl;
+00089     }
+00090 
+00091     vector<Sym> oldpop;
+00092     swap(pop,oldpop);
+00093     for (unsigned i = 0; i < oldpop.size(); ++i) {
+00094         Sym sym = oldpop[i];
+00095         if (!bounds.in_bounds(sym)) {
+00096             k++;
+00097             continue;
+00098         }
+00099         pop.push_back(sym);
+00100     }
+00101     
+00102     cout << "Done" << endl;
+00103     
+00104     // full compilation
+00105     
+00106     time_t start_time = time(0);
+00107     time_t compile_time; 
+00108     {
+00109         multi_function f = compile(pop);
+00110         compile_time = time(0);
+00111         vector<double> out(pop.size());
+00112         
+00113         for (unsigned j = 0; j < dataset.n_records(); ++j) {
+00114             f(&dataset.get_inputs(j)[0], &out[0]);
+00115         }
+00116     }
+00117 
+00118     time_t end_time = time(0);
+00119 
+00120     cout << "Evaluated " << n-k << " syms in " << end_time - start_time << " seconds, compile took " << compile_time - start_time << " seconds" << endl;
+00121     
+00122     start_time = time(0);
+00123     vector<single_function> funcs;
+00124     compile(pop, funcs);
+00125     compile_time = time(0);
+00126     for (unsigned i = 0; i < pop.size(); ++i) {
+00127         
+00128         single_function f = funcs[i];
+00129         for (unsigned j = 0; j < dataset.n_records(); ++j) {
+00130             f(&dataset.get_inputs(j)[0]);
+00131         }
+00132         
+00133     }
+00134      
+00135     end_time = time(0);
+00136     
+00137     cout << "Evaluated " << n-k << " syms in " << end_time - start_time << " seconds, compile took " << compile_time - start_time << " seconds" << endl;
+00138     return 0; // skip the 'slow' one-by-one method
+00139     start_time = time(0);
+00140     for (unsigned i = 0; i < pop.size(); ++i) {
+00141         
+00142         single_function f = compile(pop[i]);
+00143         for (unsigned j = 0; j < dataset.n_records(); ++j) {
+00144             f(&dataset.get_inputs(j)[0]);
+00145         }
+00146         
+00147     }
+00148      
+00149     end_time = time(0);
+00150     
+00151     cout << "Evaluated " << n-k << " syms in " << end_time - start_time << " seconds" << endl;
+00152     
+00153 }
+00154 
+00155 void test_xover() {
+00156     Sym c = SymVar(0);
+00157     Sym x = c + c * c + c;
+00158     
+00159     cout << c << endl;
+00160     cout << x << endl;
+00161     
+00162     vector<Sym> pop;
+00163     for (unsigned i = 0; i < x.size(); ++i) {
+00164         for (unsigned j = 0; j < x.size(); ++j) {
+00165 
+00166             Sym s = insert_subtree(x, i, get_subtree(x, j));
+00167             pop.push_back(s);
+00168             cout << i << ' ' << j << ' ' << s << endl;
+00169         }
+00170     }
+00171 
+00172     x = Sym();
+00173     c = Sym();
+00174 
+00175     SymMap& dag = Sym::get_dag();
+00176 
+00177     for (SymMap::iterator it = dag.begin(); it != dag.end(); ++it) {
+00178         Sym s(it);
+00179         cout << s << ' ' << s.refcount() << endl;
+00180     }
+00181     
+00182             
+00183     
+00184 }
+00185 
+
    Generated on Thu Oct 19 05:06:44 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/test__diff_8cpp-source.html b/trunk/paradiseo-eo/doc/html/test__diff_8cpp-source.html
new file mode 100644
index 000000000..8c369a941
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/test__diff_8cpp-source.html
@@ -0,0 +1,32 @@
+
+
+EO: test_diff.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+contrib / mathsym / test
    
+
    test_diff.cpp
    00001 #include <Sym.h>
+00002 #include <FunDef.h>
+00003 #include <iostream>
+00004 
+00005 using namespace std;
+00006 
+00007 int main() {
+00008     
+00009     Sym v = SymConst(1.2);
+00010 
+00011     Sym g = exp(-sqr(v));
+00012 
+00013     cout << g << endl;
+00014     cout << differentiate(g, v.token()) << endl;
+00015     
+00016 }
+00017 
+
    Generated on Thu Oct 19 05:06:44 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/test__lambda_8cpp-source.html b/trunk/paradiseo-eo/doc/html/test__lambda_8cpp-source.html
new file mode 100644
index 000000000..4db583964
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/test__lambda_8cpp-source.html
@@ -0,0 +1,49 @@
+
+
+EO: test_lambda.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+contrib / mathsym / test
    
+
    test_lambda.cpp
    00001 #include <FunDef.h>
+00002 
+00003 using namespace std;
+00004 
+00005 int main() {
+00006 
+00007     Sym x = SymVar(0);
+00008     Sym y = SymVar(1);
+00009 
+00010     Sym f = y + x*x;
+00011 
+00012     Sym l = SymLambda(f);
+00013     
+00014     SymVec args = l.args();
+00015     args[0] = x;
+00016     args[1] = y;
+00017     l = Sym(l.token(), args);
+00018     
+00019     vector<double> v(3);
+00020     v[0] = 2.0;
+00021     v[1] = 3.0;
+00022     v[2] = 4.0;
+00023 
+00024     double v1 = eval(f,v);
+00025     double v2 = eval(l,v);
+00026 
+00027     cout << v1 << ' ' << v2 << endl;
+00028     cout << f << endl;
+00029     cout << l << endl;
+00030 
+00031     if (v1 != 7.0) return 1;
+00032     if (v2 != 11.0) return 1;
+00033 }
+00034 
+
    Generated on Thu Oct 19 05:06:44 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/test__mf_8cpp-source.html b/trunk/paradiseo-eo/doc/html/test__mf_8cpp-source.html
new file mode 100644
index 000000000..f3e056921
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/test__mf_8cpp-source.html
@@ -0,0 +1,60 @@
+
+
+EO: test_mf.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+contrib / mathsym / test
    
+
    test_mf.cpp
    00001 
+00002 #include "Sym.h"
+00003 #include "MultiFunction.h"
+00004 #include "FunDef.h"
+00005 
+00006 using namespace std;
+00007 
+00008 int main() {
+00009 
+00010     Sym v = SymVar(0);
+00011     Sym c = SymConst(0.1);
+00012 
+00013     Sym sym = inv(v) + c;
+00014     Sym a = sym;
+00015     
+00016     sym = sym * sym;
+00017     Sym b = sym;
+00018     sym = sym + sym;
+00019     
+00020     c = sym;
+00021     
+00022     vector<Sym> pop;
+00023     pop.push_back(sym);
+00024 
+00025     MultiFunction m(pop);
+00026 
+00027 
+00028     vector<double> vec(1);
+00029     vec[0] = 10.0;
+00030     cout << sym << endl;
+00031 
+00032     cout << "Eval " << eval(sym, vec);
+00033     
+00034     vector<double> y(1);
+00035 
+00036     m(vec,y);
+00037 
+00038     cout << " " << y[0] << endl;
+00039     
+00040     cout << "3 " << eval(a,vec) << endl;
+00041     cout << "4 " << eval(b, vec) << endl;
+00042     cout << "5 " << eval(c, vec) << endl;
+00043     
+00044 }
+00045 
+
    Generated on Thu Oct 19 05:06:44 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/test__simplify_8cpp-source.html b/trunk/paradiseo-eo/doc/html/test__simplify_8cpp-source.html
new file mode 100644
index 000000000..9e6049935
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/test__simplify_8cpp-source.html
@@ -0,0 +1,36 @@
+
+
+EO: test_simplify.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+contrib / mathsym / test
    
+
    test_simplify.cpp
    00001 
+00002 #include <FunDef.h>
+00003 
+00004 using namespace std;
+00005 
+00006 int main() {
+00007     
+00008     Sym c1 = SymConst(0.4);
+00009     Sym c2 = SymConst(0.3);
+00010     Sym v1 = SymVar(0);
+00011 
+00012     Sym expr = (c1 + c2) * ( (c1 + c2) * v1);
+00013     
+00014     cout << expr << endl;
+00015     cout << simplify(expr) << endl;
+00016 
+00017     Sym dv = differentiate( exp(expr) , v1.token());
+00018     cout << dv << endl;
+00019     cout << simplify(dv) << endl;
+00020 }
+00021 
+
    Generated on Thu Oct 19 05:06:44 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/testeo_8cpp-source.html b/trunk/paradiseo-eo/doc/html/testeo_8cpp-source.html
new file mode 100644
index 000000000..b5420ac0c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/testeo_8cpp-source.html
@@ -0,0 +1,134 @@
+
+
+EO: testeo.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+contrib / mathsym / test
    
+
    testeo.cpp
    00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 
+00019 #include <LanguageTable.h>
+00020 #include <TreeBuilder.h>
+00021 #include <FunDef.h>
+00022 #include <Dataset.h>
+00023 
+00024 #include <eoSymInit.h>
+00025 #include <eoSym.h>
+00026 #include <eoPop.h>
+00027 #include <eoSymMutate.h>
+00028 #include <eoSymCrossover.h>
+00029 #include <eoSymEval.h>
+00030 
+00031 typedef EoSym<double> EoType;
+00032 
+00033 int main() {
+00034     
+00035     LanguageTable table;
+00036     table.add_function(sum_token, 2);
+00037     table.add_function(prod_token, 2);
+00038     table.add_function(inv_token, 1);
+00039     table.add_function(min_token, 1);
+00040     table.add_function( SymVar(0).token(), 0);
+00041     
+00042     table.add_function(tan_token, 1);
+00043     
+00044     table.add_function(sum_token, 0);
+00045     table.add_function(prod_token, 0);
+00046     
+00047     TreeBuilder builder(table);
+00048 
+00049     eoSymInit<EoType> init(builder);
+00050     
+00051     eoPop<EoType> pop(10, init);
+00052     
+00053     for (unsigned i = 0; i < pop.size(); ++i) {
+00054         // write out pretty printed
+00055         cout << (Sym) pop[i] << endl;   
+00056     }
+00057 
+00058     BiasedNodeSelector node_selector;
+00059     eoSymSubtreeMutate<EoType> mutate1(builder, node_selector);
+00060     eoSymNodeMutate<EoType> mutate2(table);
+00061     
+00062     cout << "****** MUTATION ************" << endl;
+00063 
+00064     for (unsigned i = 0; i < pop.size(); ++i) {
+00065         
+00066         cout << "Before  " << (Sym) pop[i] << endl;
+00067         mutate1(pop[i]);
+00068         cout << "After 1 " << (Sym) pop[i] << endl;
+00069         mutate2(pop[i]);
+00070         cout << "After 2 " << (Sym) pop[i] << endl;
+00071     }
+00072    
+00073     cout << "****** CROSSOVER ***********" << endl;
+00074     
+00075     eoQuadSubtreeCrossover<EoType> quad(node_selector);
+00076     eoBinSubtreeCrossover<EoType> bin(node_selector);
+00077     eoBinHomologousCrossover<EoType> hom;
+00078 
+00079     for (unsigned i = 0; i < pop.size()-1; ++i) {
+00080         cout << "Before    " << (Sym) pop[i] << endl;
+00081         cout << "Before    " << (Sym) pop[i+1] << endl;
+00082         
+00083         hom(pop[i], pop[i+1]);
+00084         
+00085         cout << "After hom  " << (Sym) pop[i] << endl;
+00086         cout << "After hom  " << (Sym) pop[i+1] << endl;
+00087         
+00088         
+00089         quad(pop[i], pop[i+1]);
+00090 
+00091         cout << "After quad " << (Sym) pop[i] << endl;
+00092         cout << "After quad " << (Sym) pop[i+1] << endl;
+00093         
+00094         bin(pop[i], pop[i+1]);
+00095         
+00096         cout << "After bin  " << (Sym) pop[i] << endl;
+00097         cout << "After bin  " << (Sym) pop[i+1] << endl;
+00098         
+00099         cout << endl;
+00100     }
+00101   
+00102     cout << "****** Evaluation **********" << endl;
+00103     
+00104     Dataset dataset;
+00105     dataset.load_data("test_data.txt");
+00106     IntervalBoundsCheck check(dataset.input_minima(), dataset.input_maxima());
+00107     ErrorMeasure measure(dataset, 0.90, ErrorMeasure::mean_squared_scaled);
+00108 
+00109     eoSymPopEval<EoType> evaluator(check, measure, 20000);
+00110     
+00111     eoPop<EoType> dummy;
+00112     evaluator(pop, dummy);
+00113 
+00114     for (unsigned i = 0; i < pop.size(); ++i) {
+00115         cout << pop[i] << endl;
+00116     }
+00117     
+00118 }
+00119 
+
    Generated on Thu Oct 19 05:06:44 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/todo.html b/trunk/paradiseo-eo/doc/html/todo.html
new file mode 100644
index 000000000..7691f4752
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/todo.html
@@ -0,0 +1,22 @@
+
+
+EO: Todo List
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    Todo List
     
    
+
    Class eoDominanceMap< EoType >  
    
+
    make it an eoStat? 
    
+
    
+
    
+ 
    
+
    Member eoEsChromInit::create_self_adapt (eoEsStdev< FitT > &result) 
    
+
    Should we scale sigmas to the corresponding object variable range? 
    
+
    
+
    Generated on Thu Oct 19 05:07:01 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/token_8h-source.html b/trunk/paradiseo-eo/doc/html/token_8h-source.html
new file mode 100644
index 000000000..468f04050
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/token_8h-source.html
@@ -0,0 +1,43 @@
+
+
+EO: token.h Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+contrib / mathsym / sym
    
+
    token.h
    00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 #ifndef TOKEN_H
+00018 #define TOKEN_H
+00019 
+00020 
+00021 typedef unsigned token_t;
+00022 
+00023 struct functor_t {
+00024     token_t token;
+00025     unsigned arity;
+00026 };
+00027 
+00028 #endif
+
    Generated on Thu Oct 19 05:06:44 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/tree.html b/trunk/paradiseo-eo/doc/html/tree.html
new file mode 100644
index 000000000..fcff7f221
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/tree.html
@@ -0,0 +1,2495 @@
+
+  
+    
+    
+    
+    
+    TreeView
+    
+    
+  
+
+  
+    
    
+      
    EO
    
+      
    
+        
    o*Welcome to Evolving Objects
    
+        
    o+File List
    
+        
    
+          
    |o*abstract1.cpp
    
+          
    |o*algos.cpp
    
+          
    |o*apply.h
    
+          
    |o*test/binary_value.h
    
+          
    |o*tutorial/Lesson2/binary_value.h
    
+          
    |o*tutorial/Lesson3/binary_value.h
    
+          
    |o*tutorial/Lesson4/binary_value.h
    
+          
    |o*BitEA.cpp
    
+          
    |o*BoundsCheck.cpp
    
+          
    |o*BoundsCheck.h
    
+          
    |o*breeders.cpp
    
+          
    |o*CMAParams.cpp
    
+          
    |o*CMAParams.h
    
+          
    |o*CMAState.cpp
    
+          
    |o*CMAState.h
    
+          
    |o*compatibility.h
    
+          
    |o*continuators.cpp
    
+          
    |o*Dataset.cpp
    
+          
    |o*Dataset.h
    
+          
    |o*def_abstract_functor.h
    
+          
    |o*eig.cpp
    
+          
    |o*eig.h
    
+          
    |o*EO.h
    
+          
    |o*eoAged.h
    
+          
    |o*eoAlgo.h
    
+          
    |o*eoAssembledFitnessStat.h
    
+          
    |o*eoBit.h
    
+          
    |o*eoBitOp.h
    
+          
    |o*eoBitOpFactory.h
    
+          
    |o*eoBoolFlip.h
    
+          
    |o*eoBreed.h
    
+          
    |o*eoCellularEasyEA.h
    
+          
    |o*eoCheckPoint.h
    
+          
    |o*eoCloneOps.h
    
+          
    |o*eoCMABreed.h
    
+          
    |o*eoCMAInit.h
    
+          
    |o*eoCombinedContinue.h
    
+          
    |o*eoCombinedInit.h
    
+          
    |o*eoContinue.h
    
+          
    |o*eoCounter.h
    
+          
    |o*eoCtrlCContinue.cpp
    
+          
    |o*eoCtrlCContinue.h
    
+          
    |o*eoData.cpp
    
+          
    |o*eoData.h
    
+          
    |o*eoDetSelect.h
    
+          
    |o*eoDetTournamentSelect.h
    
+          
    |o*eoDistance.h
    
+          
    |o*eoDistribUpdater.h
    
+          
    |o*eoDistribution.h
    
+          
    |o*eoDominanceMap.h
    
+          
    |o*eoDrawable.h
    
+          
    |o*eoEasyEA.h
    
+          
    |o*eoEDA.h
    
+          
    |o*eoEsChromInit.h
    
+          
    |o*eoEsFull.h
    
+          
    |o*eoEsGlobalXover.h
    
+          
    |o*eoEsMutate.h
    
+          
    |o*eoEsMutationInit.h
    
+          
    |o*eoEsSimple.h
    
+          
    |o*eoEsStandardXover.h
    
+          
    |o*eoEsStdev.h
    
+          
    |o*eoEvalContinue.h
    
+          
    |o*eoEvalFunc.h
    
+          
    |o*eoEvalFuncCounter.h
    
+          
    |o*eoEvalFuncPtr.h
    
+          
    |o*eoExternalEO.h
    
+          
    |o*eoExternalOpFunctions.h
    
+          
    |o*eoFactory.h
    
+          
    |o*eoFDCStat.h
    
+          
    |o*eoFileMonitor.cpp
    
+          
    |o*eoFileMonitor.h
    
+          
    |o*eoFileSnapshot.h
    
+          
    |o*eoFitContinue.h
    
+          
    |o*eoFitnessScalingSelect.h
    
+          
    |o*eoFlOrBinOp.h
    
+          
    |o*eoFlOrMonOp.h
    
+          
    |o*eoFlOrQuadOp.h
    
+          
    |o*eoFunctor.h
    
+          
    |o*eoFunctorStore.cpp
    
+          
    |o*eoFunctorStore.h
    
+          
    |o*eoG3Replacement.h
    
+          
    |o*eoGenContinue.h
    
+          
    |o*eoGeneralBreeder.h
    
+          
    |o*eoGenOp.h
    
+          
    |o*eoGnuplot.cpp
    
+          
    |o*eoGnuplot.h
    
+          
    |o*eoGnuplot1DMonitor.cpp
    
+          
    |o*eoGnuplot1DMonitor.h
    
+          
    |o*eoGnuplot1DSnapshot.cpp
    
+          
    |o*eoGnuplot1DSnapshot.h
    
+          
    |o*eoHowMany.h
    
+          
    |o*eoInit.h
    
+          
    |o*eoInitVirus.h
    
+          
    |o*eoIntBounds.cpp
    
+          
    |o*eoIntBounds.h
    
+          
    |o*eoInvalidateOps.h
    
+          
    |o*eoLinearFitScaling.h
    
+          
    |o*eoMerge.h
    
+          
    |o*eoMergeReduce.h
    
+          
    |o*eoMGGReplacement.h
    
+          
    |o*eoMOFitnessStat.h
    
+          
    |o*eoMonitor.h
    
+          
    |o*eoNDSorting.h
    
+          
    |o*eoNormalMutation.h
    
+          
    |o*eoObject.h
    
+          
    |o*eoOneMax.h
    
+          
    |o*eoOneMaxEvalFunc.h
    
+          
    |o*eoOneMaxInit.h
    
+          
    |o*eoOneMaxMutation.h
    
+          
    |o*eoOneMaxQuadCrossover.h
    
+          
    |o*eoOneToOneBreeder.h
    
+          
    |o*eoOp.h
    
+          
    |o*eoOpContainer.h
    
+          
    |o*eoOpSelMason.h
    
+          
    |o*eoParam.h
    
+          
    |o*eoParetoConstraintFitness.h
    
+          
    |o*eoParetoFitness.cpp
    
+          
    |o*eoParetoFitness.h
    
+          
    |o*eoParetoRanking.h
    
+          
    |o*eoParser.cpp
    
+          
    |o*eoParser.h
    
+          
    |o*eoParseTree.h
    
+          
    |o*eoParseTreeDepthInit.h
    
+          
    |o*eoParseTreeOp.h
    
+          
    |o*eoPBILAdditive.h
    
+          
    |o*eoPBILDistrib.h
    
+          
    |o*eoPBILOrg.h
    
+          
    |o*eoPerf2Worth.h
    
+          
    |o*eoPeriodicContinue.h
    
+          
    |o*eoPersistent.cpp
    
+          
    |o*eoPersistent.h
    
+          
    |o*eoPop.h
    
+          
    |o*eoPopAlgo.h
    
+          
    |o*eoPopEvalFunc.h
    
+          
    |o*eoPopStat.h
    
+          
    |o*eoPopulator.h
    
+          
    |o*eoPrintable.cpp
    
+          
    |o*eoPrintable.h
    
+          
    |o*eoPropGAGenOp.h
    
+          
    |o*eoProportionalCombinedOp.h
    
+          
    |o*eoProportionalSelect.h
    
+          
    |o*eoRandomSelect.h
    
+          
    |o*eoRanking.h
    
+          
    |o*eoRankingSelect.h
    
+          
    |o*eoReal.h
    
+          
    |o*eoRealAtomXover.h
    
+          
    |o*eoRealBounds.cpp
    
+          
    |o*eoRealBounds.h
    
+          
    |o*eoRealInitBounded.h
    
+          
    |o*eoRealOp.h
    
+          
    |o*eoRealVectorBounds.h
    
+          
    |o*eoReduce.h
    
+          
    |o*eoReduceMerge.h
    
+          
    |o*eoReduceMergeReduce.h
    
+          
    |o*eoReduceSplit.h
    
+          
    |o*eoReplacement.h
    
+          
    |o*eoRndGenerators.h
    
+          
    |o*eoRNG.cpp
    
+          
    |o*eoRNG.h
    
+          
    |o*eoSBXcross.h
    
+          
    |o*eoScalarFitness.h
    
+          
    |o*eoScalarFitnessAssembled.cpp
    
+          
    |o*eoScalarFitnessAssembled.h
    
+          
    |o*eoScalarFitnessStat.h
    
+          
    |o*eoSelect.h
    
+          
    |o*eoSelectFactory.h
    
+          
    |o*eoSelectFromWorth.h
    
+          
    |o*eoSelectMany.h
    
+          
    |o*eoSelectNumber.h
    
+          
    |o*eoSelectOne.h
    
+          
    |o*eoSelectPerc.h
    
+          
    |o*eoSequentialSelect.h
    
+          
    |o*eoSGA.h
    
+          
    |o*eoSGAGenOp.h
    
+          
    |o*eoSGATransform.h
    
+          
    |o*eoSharing.h
    
+          
    |o*eoSharingSelect.h
    
+          
    |o*eoSimpleEDA.h
    
+          
    |o*eoStat.h
    
+          
    |o*eoState.cpp
    
+          
    |o*eoState.h
    
+          
    |o*eoStdoutMonitor.cpp
    
+          
    |o*eoStdoutMonitor.h
    
+          
    |o*eoSteadyFitContinue.h
    
+          
    |o*eoSTLFunctor.h
    
+          
    |o*eoStochasticUniversalSelect.h
    
+          
    |o*eoStochTournamentSelect.h
    
+          
    |o*eoStParseTreeDepthInit.h
    
+          
    |o*eoStParseTreeOp.h
    
+          
    |o*eoString.h
    
+          
    |o*eoSurviveAndDie.h
    
+          
    |o*eoSym.h
    
+          
    |o*eoSymCrossover.cpp
    
+          
    |o*eoSymCrossover.h
    
+          
    |o*eoSymEval.h
    
+          
    |o*eoSymInit.h
    
+          
    |o*eoSymLambdaMutate.cpp
    
+          
    |o*eoSymLambdaMutate.h
    
+          
    |o*eoSymMutate.cpp
    
+          
    |o*eoSymMutate.h
    
+          
    |o*eoTimeCounter.h
    
+          
    |o*eoTimedMonitor.h
    
+          
    |o*eoTransform.h
    
+          
    |o*eoTruncatedSelectMany.h
    
+          
    |o*eoTruncatedSelectOne.h
    
+          
    |o*eoTruncSelect.h
    
+          
    |o*eoUniformInit.h
    
+          
    |o*eoUpdatable.h
    
+          
    |o*eoUpdater.cpp
    
+          
    |o*eoUpdater.h
    
+          
    |o*eoVariableLengthCrossover.h
    
+          
    |o*eoVariableLengthMutation.h
    
+          
    |o*eoVector.h
    
+          
    |o*eoVirus.h
    
+          
    |o*ErrorMeasure.cpp
    
+          
    |o*ErrorMeasure.h
    
+          
    |o*es.h
    
+          
    |o*ESEA.cpp
    
+          
    |o*exercise1.3.cpp
    
+          
    |o*exercise2.3.cpp
    
+          
    |o*exercise3.1.cpp
    
+          
    |o*FirstBitEA.cpp
    
+          
    |o*FirstBitGA.cpp
    
+          
    |o*FirstRealEA.cpp
    
+          
    |o*FirstRealGA.cpp
    
+          
    |o*fitness.h
    
+          
    |o*fitness_traits.cpp
    
+          
    |o*FunDef.cpp
    
+          
    |o*FunDef.h
    
+          
    |o*ga.h
    
+          
    |o*geneticOps.cpp
    
+          
    |o*gprop.cpp
    
+          
    |o*gprop.h
    
+          
    |o*index.h
    
+          
    |o*Interval.h
    
+          
    |o*l2.h
    
+          
    |o*LanguageTable.cpp
    
+          
    |o*LanguageTable.h
    
+          
    |o*main.cpp
    
+          
    |o*make_algo_easea.h
    
+          
    |o*make_algo_pareto.h
    
+          
    |o*make_algo_scalar.h
    
+          
    |o*make_algo_scalar_es.cpp
    
+          
    |o*make_algo_scalar_ga.cpp
    
+          
    |o*make_algo_scalar_real.cpp
    
+          
    |o*make_checkpoint.h
    
+          
    |o*make_checkpoint_assembled.h
    
+          
    |o*make_checkpoint_es.cpp
    
+          
    |o*make_checkpoint_FDC.h
    
+          
    |o*make_checkpoint_ga.cpp
    
+          
    |o*make_checkpoint_pareto.h
    
+          
    |o*make_checkpoint_real.cpp
    
+          
    |o*make_continue.h
    
+          
    |o*make_continue_es.cpp
    
+          
    |o*make_continue_ga.cpp
    
+          
    |o*make_continue_pareto.h
    
+          
    |o*make_continue_real.cpp
    
+          
    |o*make_es.h
    
+          
    |o*make_ga.h
    
+          
    |o*make_general_replacement.h
    
+          
    |o*make_genotype_es.cpp
    
+          
    |o*make_genotype_ga.cpp
    
+          
    |o*make_genotype_ga.h
    
+          
    |o*make_genotype_MyStruct.h
    
+          
    |o*make_genotype_OneMax.h
    
+          
    |o*make_genotype_real.cpp
    
+          
    |o*make_genotype_real.h
    
+          
    |o*make_help.cpp
    
+          
    |o*make_MyStruct.cpp
    
+          
    |o*make_OneMax.cpp
    
+          
    |o*es/make_op.h
    
+          
    |o*ga/make_op.h
    
+          
    |o*make_op_es.cpp
    
+          
    |o*make_op_es.h
    
+          
    |o*make_op_ga.cpp
    
+          
    |o*make_op_MyStruct.h
    
+          
    |o*make_op_OneMax.h
    
+          
    |o*make_op_real.cpp
    
+          
    |o*make_op_real.h
    
+          
    |o*make_PBILdistrib.h
    
+          
    |o*make_PBILupdate.h
    
+          
    |o*make_pop.h
    
+          
    |o*make_pop_es.cpp
    
+          
    |o*make_pop_ga.cpp
    
+          
    |o*make_pop_real.cpp
    
+          
    |o*make_real.h
    
+          
    |o*make_run.h
    
+          
    |o*make_run_es.cpp
    
+          
    |o*make_run_ga.cpp
    
+          
    |o*make_run_real.cpp
    
+          
    |o*mastermind.cpp
    
+          
    |o*mastermind.h
    
+          
    |o*matrices.h
    
+          
    |o*mergers.cpp
    
+          
    |o*mlp.h
    
+          
    |o*monitors.cpp
    
+          
    |o*mse.h
    
+          
    |o*MultiFuncs.cpp
    
+          
    |o*MultiFunction.cpp
    
+          
    |o*MultiFunction.h
    
+          
    |o*MyStructEA.cpp
    
+          
    |o*MyStructLibEA.cpp
    
+          
    |o*MyStructSEA.cpp
    
+          
    |o*NEWS
    
+          
    |o*src/pyeo/NEWS
    
+          
    |o*node.h
    
+          
    |o*node_pool.h
    
+          
    |o*NodeSelector.cpp
    
+          
    |o*NodeSelector.h
    
+          
    |o*OneMaxEA.cpp
    
+          
    |o*OneMaxLibEA.cpp
    
+          
    |o*parameters.h
    
+          
    |o*parse_tree.h
    
+          
    |o*perf2worth.cpp
    
+          
    |o*pickle.h
    
+          
    |o*pipecom.cpp
    
+          
    |o*pipecom.h
    
+          
    |o*PyEO.cpp
    
+          
    |o*PyEO.h
    
+          
    |o*qp.h
    
+          
    |o*random_numbers.cpp
    
+          
    |o*contrib/mathsym/README
    
+          
    |o*README
    
+          
    |o*src/pyeo/README
    
+          
    |o*tutorial/README
    
+          
    |o*tutorial/Templates/README
    
+          
    |o*README.cpp
    
+          
    |o*test/real_value.h
    
+          
    |o*tutorial/Lesson2/real_value.h
    
+          
    |o*tutorial/Lesson3/real_value.h
    
+          
    |o*tutorial/Lesson4/real_value.h
    
+          
    |o*RealEA.cpp
    
+          
    |o*reduce.cpp
    
+          
    |o*replacement.cpp
    
+          
    |o*rnd_generators.h
    
+          
    |o*RoyalRoad.h
    
+          
    |o*Scaling.cpp
    
+          
    |o*Scaling.h
    
+          
    |o*SecondBitEA.cpp
    
+          
    |o*SecondRealEA.cpp
    
+          
    |o*selectOne.cpp
    
+          
    |o*selectors.cpp
    
+          
    |o*selectors.h
    
+          
    |o*shared_ptr.h
    
+          
    |o*statistics.cpp
    
+          
    |o*stats.h
    
+          
    |o*Sym.cpp
    
+          
    |o*Sym.h
    
+          
    |o*sym_compile.cpp
    
+          
    |o*sym_compile.h
    
+          
    |o*sym_operations.cpp
    
+          
    |o*SymImpl.cpp
    
+          
    |o*SymImpl.h
    
+          
    |o*SymOps.cpp
    
+          
    |o*SymOps.h
    
+          
    |o*symreg.cpp
    
+          
    |o*t-eo.cpp
    
+          
    |o*t-eoAtomOps.cpp
    
+          
    |o*t-eoBaseFunctions.cpp
    
+          
    |o*t-eobin.cpp
    
+          
    |o*t-eobreeder.cpp
    
+          
    |o*t-eoCheckpointing.cpp
    
+          
    |o*t-eoCMAES.cpp
    
+          
    |o*t-eoEasyEA.cpp
    
+          
    |o*t-eoESAll.cpp
    
+          
    |o*t-eoESFull.cpp
    
+          
    |o*t-eoESOps.cpp
    
+          
    |o*t-eoExternalEO.cpp
    
+          
    |o*t-eofitness.cpp
    
+          
    |o*t-eoFitnessAssembled.cpp
    
+          
    |o*t-eoFitnessAssembledEA.cpp
    
+          
    |o*t-eoFunctor.cpp
    
+          
    |o*t-eoGA.cpp
    
+          
    |o*t-eogeneration.cpp
    
+          
    |o*t-eoGenOp.cpp
    
+          
    |o*t-eoGOpSel.cpp
    
+          
    |o*t-eoinclusion.cpp
    
+          
    |o*t-eoinsertion.cpp
    
+          
    |o*t-eolottery.cpp
    
+          
    |o*t-eoNonUniform.cpp
    
+          
    |o*t-eoPareto.cpp
    
+          
    |o*t-eoParetoFitness.cpp
    
+          
    |o*t-eoPBIL.cpp
    
+          
    |o*t-eoproblem.cpp
    
+          
    |o*t-eoRandom.cpp
    
+          
    |o*t-eoReal.cpp
    
+          
    |o*t-eoReplacement.cpp
    
+          
    |o*t-eoRoulette.cpp
    
+          
    |o*t-eoSelect.cpp
    
+          
    |o*t-eoSharing.cpp
    
+          
    |o*t-eoSSGA.cpp
    
+          
    |o*t-eoStateAndParser.cpp
    
+          
    |o*t-eoSymreg.cpp
    
+          
    |o*t-eoUniform.cpp
    
+          
    |o*t-eoVector.cpp
    
+          
    |o*t-eoVirus.cpp
    
+          
    |o*t-MGE-control.cpp
    
+          
    |o*t-MGE.cpp
    
+          
    |o*t-MGE1bit.cpp
    
+          
    |o*t-selectOne.cpp
    
+          
    |o*TargetInfo.cpp
    
+          
    |o*TargetInfo.h
    
+          
    |o*test_compile.cpp
    
+          
    |o*test_diff.cpp
    
+          
    |o*test_lambda.cpp
    
+          
    |o*test_mf.cpp
    
+          
    |o*test_simplify.cpp
    
+          
    |o*testeo.cpp
    
+          
    |o*token.h
    
+          
    |o*TreeBuilder.cpp
    
+          
    |o*TreeBuilder.h
    
+          
    |o*util.cpp
    
+          
    |o*valueParam.cpp
    
+          
    |o*valueParam.h
    
+          
    |o*vecop.h
    
+          
    |\*VirusOp.h
    
+        
    
+        
    o+Class List
    
+        
    
+          
    |o*eo1PtBitCrossover
    
+          
    |o*eoAged< Object >
    
+          
    |o*eoAlgo< EOT >
    
+          
    |o*eoArithmeticCrossover
    
+          
    |o*eoAssembledFitnessAverageStat< EOT >
    
+          
    |o*eoAssembledFitnessBestStat< EOT >
    
+          
    |o*eoAtomExchange< Atom >
    
+          
    |o*eoAverageStat< EOT >
    
+          
    |o*eoBestFitnessStat< EOT >
    
+          
    |o*eoBestSelect< EOT >
    
+          
    |o*eoBF< A1, A2, R >
    
+          
    |o*BiasedNodeSelector
    
+          
    |o*eoBinaryFunctorCounter< BinaryFunctor >
    
+          
    |o*eoBinCloneOp< EOT >
    
+          
    |o*eoBinGenOp< EOT >
    
+          
    |o*eoBinOp< EOType >
    
+          
    |o*eoBit< FitT >
    
+          
    |o*eoBitBitFlip
    
+          
    |o*eoBitGxOver< Chrom >
    
+          
    |o*eoBitInversion< Chrom >
    
+          
    |o*eoBitMutation< Chrom >
    
+          
    |o*eoBitNext< Chrom >
    
+          
    |o*eoBitOpFactory< EOT >
    
+          
    |o*eoBitPrev< Chrom >
    
+          
    |o*boolean_generator
    
+          
    |o*eoBooleanGenerator
    
+          
    |o*eoBooleanInit
    
+          
    |o*eoBoolFlip
    
+          
    |o*eoBranchMutation< FType, Node >
    
+          
    |o*eoBreed< EOT >
    
+          
    |o*eoCellularEasyEA< EOT >
    
+          
    |o*eoCheckPoint< EOT >
    
+          
    |o*eoCMABreed< FitT >
    
+          
    |o*eoCMAInit< FitT >
    
+          
    |o*eoCollapseSubtreeMutation< FType, Node >
    
+          
    |o*eoCombinedContinue< EOT >
    
+          
    |o*eoCombinedInit< EOT >
    
+          
    |o*eoCommaReplacement< EOT >
    
+          
    |o*eoContinue< EOT >
    
+          
    |o*eoCountedDynUpdate
    
+          
    |o*eoCountedStateSaver
    
+          
    |o*Cov
    
+          
    |o*eoCtrlCContinue< EOT >
    
+          
    |o*eoDetBitFlip< Chrom >
    
+          
    |o*eoDeterministicSaDReplacement< EOT >
    
+          
    |o*eoDeterministicSurviveAndDie< EOT >
    
+          
    |o*eoDetSelect< EOT >
    
+          
    |o*eoDetTournamentSelect< EOT >
    
+          
    |o*eoDetTournamentTruncate< EOT >
    
+          
    |o*eoDetTournamentTruncateSplit< EOT >
    
+          
    |o*eoDetTournamentWorthSelect< EOT, WorthT >
    
+          
    |o*eoDetUniformMutation< EOT >
    
+          
    |o*eoDistance< EOT >
    
+          
    |o*eoDistribUpdater< EOT >
    
+          
    |o*eoDistribution< EOT >
    
+          
    |o*dMatrix
    
+          
    |o*eoDominanceMap< EoType >
    
+          
    |o*eoDoubleExchange
    
+          
    |o*eoDoubleIntermediate
    
+          
    |o*eoDrawable< Object >
    
+          
    |o*Dummy
    
+          
    |o*eoDynSGATransform< EOT >
    
+          
    |o*eoDynUpdater
    
+          
    |o*eoEasyEA< EOT >
    
+          
    |o*eoEDA< EOT >
    
+          
    |o*eoEliteSequentialSelect< EOT >
    
+          
    |o*eoElitism< EOT >
    
+          
    |o*EO< F >
    
+          
    |o*eoEPReduce< EOT >
    
+          
    |o*eoEPReplacement< EOT >
    
+          
    |o*eoEsChromInit< EOT >
    
+          
    |o*eoEsFull< Fit >
    
+          
    |o*eoEsGlobalXover< EOT >
    
+          
    |o*eoEsMutate< EOT >
    
+          
    |o*eoEsMutationInit
    
+          
    |o*eoEsSimple< Fit >
    
+          
    |o*eoEsStandardXover< EOT >
    
+          
    |o*eoEsStdev< Fit >
    
+          
    |o*eoEvalContinue< EOT >
    
+          
    |o*eoEvalFunc< EOT >
    
+          
    |o*eoEvalFuncCounter< EOT >
    
+          
    |o*eoEvalFuncPtr< EOT, FitT, FunctionArg >
    
+          
    |o*eoExpansionMutation< FType, Node >
    
+          
    |o*eoExternalBinOp< F, External, ExternalEO >
    
+          
    |o*eoExternalEO< Fit, External >
    
+          
    |o*eoExternalEvalFunc< F, External, ExternalEO >
    
+          
    |o*eoExternalInit< F, External, ExternalEO >
    
+          
    |o*eoExternalMonOp< F, External, ExternalEO >
    
+          
    |o*eoExternalQuadOp< F, External, ExternalEO >
    
+          
    |o*eoF< R >
    
+          
    |o*eoFactory< EOClass >
    
+          
    |o*eoFDCFileSnapshot< EOT >
    
+          
    |o*eoFDCStat< EOT >
    
+          
    |o*eoFileMonitor
    
+          
    |o*eoFileSnapshot
    
+          
    |o*eoFitContinue< EOT >
    
+          
    |o*eoFitnessScalingSelect< EOT >
    
+          
    |o*eoFitnessStat< EOT, FitT >
    
+          
    |o*eoFlOr1ptBinOp< EOT >
    
+          
    |o*eoFlOr1ptQuadOp< EOT >
    
+          
    |o*eoFlOrAllAtomBinOp< EOT >
    
+          
    |o*eoFlOrAllAtomQuadOp< EOT >
    
+          
    |o*eoFlOrAllMutation< EOT >
    
+          
    |o*eoFlOrKAtomBinOp< EOT >
    
+          
    |o*eoFlOrKAtomQuadOp< EOT >
    
+          
    |o*eoFlOrKMutation< EOT >
    
+          
    |o*eoFlOrUniformBinOp< EOT >
    
+          
    |o*eoFlOrUniformQuadOp< EOT >
    
+          
    |o*eoFunctorBase
    
+          
    |o*eoFunctorBase::binary_function_tag
    
+          
    |o*eoFunctorBase::procedure_tag
    
+          
    |o*eoFunctorBase::unary_function_tag
    
+          
    |o*eoFunctorStore
    
+          
    |o*eoG3Replacement< EOT >
    
+          
    |o*eoGenContinue< EOT >
    
+          
    |o*eoGeneDelChooser< EOT >
    
+          
    |o*eoGeneralBreeder< EOT >
    
+          
    |o*eoGeneralIntBounds
    
+          
    |o*eoGeneralRealBounds
    
+          
    |o*eoGenerationalReplacement< EOT >
    
+          
    |o*eoGenOp< EOT >
    
+          
    |o*eoGnuplot
    
+          
    |o*eoGnuplot1DMonitor
    
+          
    |o*eoGnuplot1DSnapshot
    
+          
    |o*eoHammingDistance< EOT >
    
+          
    |o*eoHoistMutation< FType, Node >
    
+          
    |o*eoHowMany
    
+          
    |o*eoIncrementor< T >
    
+          
    |o*eoIncrementorParam< T >
    
+          
    |o*eoInit< EOT >
    
+          
    |o*eoInitAdaptor< EOT >
    
+          
    |o*eoInitFixedLength< EOT >
    
+          
    |o*eoInitGenerator< EOT >
    
+          
    |o*eoInitVariableLength< EOT >
    
+          
    |o*eoInitVirus< FitT >
    
+          
    |o*eoInitVirus1bit< FitT >
    
+          
    |o*eoInnerExchangeQuadOp< EOT >
    
+          
    |o*eoIntAboveBound
    
+          
    |o*eoIntBelowBound
    
+          
    |o*eoIntBounds
    
+          
    |o*eoIntInterval
    
+          
    |o*eoIntNoBounds
    
+          
    |o*eoInvalidateBinOp< EOT >
    
+          
    |o*eoInvalidateMonOp< EOT >
    
+          
    |o*eoInvalidateQuadOp< EOT >
    
+          
    |o*eoLinearFitScaling< EOT >
    
+          
    |o*eoLinearRandomSplit< EOT >
    
+          
    |o*eoLinearTruncate< EOT >
    
+          
    |o*eoLinearTruncateSplit< EOT >
    
+          
    |o*MemPool
    
+          
    |o*gp_parse_tree::MemPool
    
+          
    |o*eoMerge< Chrom >
    
+          
    |o*eoMergeReduce< EOT >
    
+          
    |o*eoMGGReplacement< EOT >
    
+          
    |o*MinimizingTraits
    
+          
    |o*eoMOFitnessStat< EOT, PartFitT >
    
+          
    |o*eoMonCloneOp< EOT >
    
+          
    |o*eoMonGenOp< EOT >
    
+          
    |o*eoMonitor
    
+          
    |o*eoMonOp< EOType >
    
+          
    |o*eoNDPlusReplacement< EOT, WorthT >
    
+          
    |o*eoNDSorting< EOT >
    
+          
    |o*eoNDSorting< EOT >::DummyEO
    
+          
    |o*eoNDSorting_I< EOT >
    
+          
    |o*eoNDSorting_II< EOT >
    
+          
    |o*negexp_generator< T >
    
+          
    |o*eoNegExpGenerator< T >
    
+          
    |o*eoNegExpInit< T >
    
+          
    |o*NodeSelector
    
+          
    |o*eoNoElitism< EOT >
    
+          
    |o*eoNoPerf2Worth< EOT >
    
+          
    |o*normal_generator< T >
    
+          
    |o*eoNormalGenerator< T >
    
+          
    |o*eoNormalInit< T >
    
+          
    |o*eoNormalMutation< EOT >
    
+          
    |o*eoNormalVecMutation< EOT >
    
+          
    |o*eoNoSelect< EOT >
    
+          
    |o*eoNPtsBitXover< Chrom >
    
+          
    |o*eoNthElementFitnessStat< EOT >
    
+          
    |o*eoObject
    
+          
    |o*eoOneFifthMutation< EOT >
    
+          
    |o*eoOneMax< FitT >
    
+          
    |o*eoOneMaxEvalFunc< EOT >
    
+          
    |o*eoOneMaxInit< GenotypeT >
    
+          
    |o*eoOneMaxMutation< GenotypeT >
    
+          
    |o*eoOneMaxQuadCrossover< GenotypeT >
    
+          
    |o*eoOp< EOType >
    
+          
    |o*eoOpContainer< EOT >
    
+          
    |o*eoOpSelMason< eoClass >
    
+          
    |o*eoParam
    
+          
    |o*eoParameterLoader
    
+          
    |o*eoParamParamType
    
+          
    |o*eoParetoFitness< FitnessTraits >
    
+          
    |o*eoParetoFitnessTraits
    
+          
    |o*eoParetoOneConstraintFitness< FitnessTraits >
    
+          
    |o*eoParetoRanking< EOT >
    
+          
    |o*eoParser
    
+          
    |o*eoParseTree< FType, Node >
    
+          
    |o*eoParseTreeDepthInit< FType, Node >
    
+          
    |o*eoPBILAdditive< EOT >
    
+          
    |o*eoPBILDistrib< EOT >
    
+          
    |o*eoPBILOrg< EOT >
    
+          
    |o*eoPerf2Worth< EOT, WorthT >
    
+          
    |o*eoPerf2Worth< EOT, WorthT >::compare_worth
    
+          
    |o*eoPerf2WorthCached< EOT, WorthT >
    
+          
    |o*eoPerf2WorthCached< EOT, WorthT >::compare_worth
    
+          
    |o*eoPersistent
    
+          
    |o*eoPlus< EOT >
    
+          
    |o*eoPlusReplacement< EOT >
    
+          
    |o*eoPointMutation< FType, Node >
    
+          
    |o*eoPop< EOT >
    
+          
    |o*eoPop< EOT >::Cmp
    
+          
    |o*eoPop< EOT >::Ref
    
+          
    |o*eoPopAlgo< EOT >
    
+          
    |o*eoPopEvalFunc< EOT >
    
+          
    |o*eoPopLoopEval< EOT >
    
+          
    |o*eoPopStat< EOT >
    
+          
    |o*eoPopulator< EOT >
    
+          
    |o*eoPrintable
    
+          
    |o*eoProcedureCounter< Procedure >
    
+          
    |o*eoPropCombinedBinOp< EOT >
    
+          
    |o*eoPropCombinedMonOp< EOT >
    
+          
    |o*eoPropCombinedQuadOp< EOT >
    
+          
    |o*eoPropGAGenOp< EOT >
    
+          
    |o*eoProportionalOp< EOT >
    
+          
    |o*eoProportionalSelect< EOT >
    
+          
    |o*eoQuad2BinOp< EOT >
    
+          
    |o*eoQuadCloneOp< EOT >
    
+          
    |o*eoQuadDistance< EOT >
    
+          
    |o*eoQuadGenOp< EOT >
    
+          
    |o*eoQuadOp< EOType >
    
+          
    |o*random_generator< T >
    
+          
    |o*RandomNodeSelector
    
+          
    |o*eoRandomReduce< EOT >
    
+          
    |o*eoRandomSelect< EOT >
    
+          
    |o*eoRandomSplit< EOT >
    
+          
    |o*eoRanking< EOT >
    
+          
    |o*eoRankingSelect< EOT >
    
+          
    |o*eoReal< FitT >
    
+          
    |o*eoRealAboveBound
    
+          
    |o*eoRealBaseVectorBounds
    
+          
    |o*eoRealBelowBound
    
+          
    |o*eoRealBounds
    
+          
    |o*eoRealInitBounded< EOT >
    
+          
    |o*eoRealInterval
    
+          
    |o*eoRealNoBounds
    
+          
    |o*eoRealUxOver
    
+          
    |o*eoRealVectorBounds
    
+          
    |o*eoRealVectorNoBounds
    
+          
    |o*eoReduce< EOT >
    
+          
    |o*eoReduceMerge< EOT >
    
+          
    |o*eoReduceMergeReduce< EOT >
    
+          
    |o*eoReduceSplit< EOT >
    
+          
    |o*eoReplacement< EOT >
    
+          
    |o*eoRndGenerator< T >
    
+          
    |o*eoRng
    
+          
    |o*eoRouletteWorthSelect< EOT, WorthT >
    
+          
    |o*eoScalarFitness< ScalarType, Compare >
    
+          
    |o*eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits >
    
+          
    |o*eoScalarFitnessAssembledTraits
    
+          
    |o*eoScalarFitnessStat< EOT, FitT >
    
+          
    |o*eoSecondMomentStats< EOT >
    
+          
    |o*eoSegmentCrossover< EOT >
    
+          
    |o*eoSelBinGenOp< EOT >
    
+          
    |o*eoSelect< EOT >
    
+          
    |o*eoSelectFactory< EOT >
    
+          
    |o*eoSelectFromWorth< EOT, WorthType >
    
+          
    |o*eoSelectivePopulator< EOT >
    
+          
    |o*eoSelectMany< EOT >
    
+          
    |o*eoSelectNumber< EOT >
    
+          
    |o*eoSelectOne< EOT, WorthT >
    
+          
    |o*eoSelectPerc< EOT >
    
+          
    |o*eoSelectTransform< EOT >
    
+          
    |o*eoSeqPopulator< EOT >
    
+          
    |o*eoSequentialOp< EOT >
    
+          
    |o*eoSequentialSelect< EOT >
    
+          
    |o*eoSGA< EOT >
    
+          
    |o*eoSGAGenOp< EOT >
    
+          
    |o*eoSGATransform< EOT >
    
+          
    |o*eoSharing< EOT >
    
+          
    |o*eoSharingSelect< EOT >
    
+          
    |o*eoSimpleEDA< EOT >
    
+          
    |o*eoSortedPopStat< EOT >
    
+          
    |o*eoSortedStat< EOT, ParamType >
    
+          
    |o*eoSortedStatBase< EOT >
    
+          
    |o*eoSSGADetTournamentReplacement< EOT >
    
+          
    |o*eoSSGAStochTournamentReplacement< EOT >
    
+          
    |o*eoSSGAWorseReplacement< EOT >
    
+          
    |o*eoStat< EOT, T >
    
+          
    |o*eoStatBase< EOT >
    
+          
    |o*eoState
    
+          
    |o*eoState::loading_error
    
+          
    |o*eoStBranchMutation< FType, Node >
    
+          
    |o*eoStdoutMonitor
    
+          
    |o*eoSteadyFitContinue< EOT >
    
+          
    |o*eoStHoistMutation< FType, Node >
    
+          
    |o*eoSTLBF< A1, A2, R >
    
+          
    |o*eoSTLF< R >
    
+          
    |o*eoSTLUF< A1, R >
    
+          
    |o*eoStochasticUniversalSelect< EOT >
    
+          
    |o*eoStochTournamentSelect< EOT >
    
+          
    |o*eoStochTournamentTruncate< EOT >
    
+          
    |o*eoStochTournamentTruncateSplit< EOT >
    
+          
    |o*eoStochTournamentWorthSelect< EOT, WorthT >
    
+          
    |o*eoStParseTreeDepthInit< FType, Node >
    
+          
    |o*eoStPointMutation< FType, Node >
    
+          
    |o*eoString< fitnessT >
    
+          
    |o*eoStSubtreeXOver< FType, Node >
    
+          
    |o*eoSubtreeXOver< FType, Node >
    
+          
    |o*eoSurviveAndDie< EOT >
    
+          
    |o*eoSymInit< EoType >
    
+          
    |o*T_pickle_suite< T >
    
+          
    |o*eoTimeCounter
    
+          
    |o*eoTimedDynUpdate
    
+          
    |o*eoTimedMonitor
    
+          
    |o*eoTimedStateSaver
    
+          
    |o*eoTimeVaryingLoopEval< EOT >
    
+          
    |o*eoTransform< EOT >
    
+          
    |o*eoTruncate< EOT >
    
+          
    |o*eoTruncatedSelectMany< EOT >
    
+          
    |o*eoTruncatedSelectOne< EOT >
    
+          
    |o*eoTruncateSplit< EOT >
    
+          
    |o*eoTruncSelect< EOT >
    
+          
    |o*eoUBitXover< Chrom >
    
+          
    |o*eoUF< A1, R >
    
+          
    |o*UF_random_generator< T >
    
+          
    |o*eoUnaryFunctorCounter< UnaryFunctor >
    
+          
    |o*uniform_generator< T >
    
+          
    |o*eoUniformAtomExchange< Atom >
    
+          
    |o*eoUniformGeneChooser< EOT >
    
+          
    |o*eoUniformGenerator< T >
    
+          
    |o*eoUniformInit< T >
    
+          
    |o*eoUniformMutation< EOT >
    
+          
    |o*eoUpdatable
    
+          
    |o*eoUpdater
    
+          
    |o*eoValueParam< ValueType >
    
+          
    |o*eoVariableParetoTraits
    
+          
    |o*eoVector< FitT, GeneType >
    
+          
    |o*VirusBitFlip< FitT >
    
+          
    |o*VirusShiftMutation< FitT >
    
+          
    |o*eoVlAddMutation< EOT >
    
+          
    |o*eoVlAtomExchangeQuadOp< EOT >
    
+          
    |o*eoVlDelMutation< EOT >
    
+          
    |o*eoVlUniformBinOp< EOT >
    
+          
    |o*eoVlUniformQuadOp< EOT >
    
+          
    |\*eoWeakElitistReplacement< EOT >
    
+        
    
+        
    o+Class Hierarchy
    
+        
    
+          
    |o*eo1PtBitCrossover
    
+          
    |o*eoAged< Object >
    
+          
    |o*eoArithmeticCrossover
    
+          
    |o*eoBestFitnessStat< EOT >::CmpFitness
    
+          
    |o+binary_function
    
+          
+          
    |o+binary_function
    
+          
+          
    |o+binary_function
    
+          
    
+            
    ||\+eoBF< PyEO &, PyEO &, bool >
    
+            
    
+              
    || \+eoQuadOp< PyEO >
    
+              
    
+                
    ||  \*QuadOpWrapper
    
+              
    
+            
    
+          
    
+          
    |o+binary_function
    
+          
+          
    |o+binary_function
    
+          
    
+            
    ||\+eoBF< Chrom &, Chrom &, bool >
    
+            
    
+              
    || \+eoQuadOp< Chrom >
    
+              
    
+                
    ||  o*eo1PtBitXover< Chrom >
    
+                
    ||  o*eoBitGxOver< Chrom >
    
+                
    ||  o*eoChromXover
    
+                
    ||  o*eoChromXover
    
+                
    ||  o*eoNPtsBitXover< Chrom >
    
+                
    ||  \*eoUBitXover< Chrom >
    
+              
    
+            
    
+          
    
+          
    |o+binary_function
    
+          
+          
    |o*binary_function
    
+          
    |o+binary_function
    
+          
+          
    |o+binary_function
    
+          
+          
    |o+binary_function
    
+          
+          
    |o+binary_function
    
+          
    
+            
    ||\+eoBF< EoType &, EoType &, bool >
    
+            
    
+              
    || \+eoQuadOp< EoType >
    
+              
    
+                
    ||  \*eoQuadSubtreeCrossover< EoType >
    
+              
    
+            
    
+          
    
+          
    |o+binary_function
    
+          
+          
    |o+binary_function
    
+          
+          
    |o+binary_function
    
+          
    
+            
    ||\+eoBF< EoType &, const EoType &, bool >
    
+            
    
+              
    || \+eoBinOp< EoType >
    
+              
    
+                
    ||  o*eoBinHomologousCrossover< EoType >
    
+                
    ||  \*eoBinSubtreeCrossover< EoType >
    
+              
    
+            
    
+          
    
+          
    |o+binary_function
    
+          
+          
    |o+binary_function
    
+          
+          
    |o+binary_function
    
+          
+          
    |o+binary_function
    
+          
+          
    |o+binary_function
    
+          
+          
    |o+binary_function
    
+          
+          
    |o+binary_function
    
+          
+          
    |o+binary_function
    
+          
+          
    |o+binary_function
    
+          
+          
    |o+binary_function
    
+          
+          
    |o*binary_function
    
+          
    |o+binary_function
    
+          
+          
    |o+binary_function
    
+          
+          
    |o+binary_function
    
+          
+          
    |o*binary_function
    
+          
    |o*BinaryValue
    
+          
    |o*eoutils::BinaryWrapper< Binary >
    
+          
    |o*eoBitBitFlip
    
+          
    |o*boolean_generator
    
+          
    |o*BoundsCheck
    
+          
    |o*eo::CMAParams
    
+          
    |o*eo::CMAState
    
+          
    |o*eo::CMAStateImpl
    
+          
    |o*Compiler
    
+          
    |o*Const
    
+          
    |o*Cov
    
+          
    |o*CovMatrix
    
+          
    |o*Dataset
    
+          
    |o*DataSetImpl
    
+          
    |o*differentiation_error
    
+          
    |o*dMatrix
    
+          
    |o*eoDrawable< Object >
    
+          
    |o*Easy
    
+          
    |o*eoEPReduce< EOT >::Cmp
    
+          
    |o*ErrorMeasure
    
+          
    |o*ErrorMeasure::result
    
+          
    |o*ErrorMeasureImpl
    
+          
    |o*eoEsMutationInit
    
+          
    |o*fitness_traits< T >
    
+          
    |o*fitness_traits< maximization >
    
+          
    |o*fitness_traits< minimization >
    
+          
    |o*fitness_traits< pair< Performance, Worth > >
    
+          
    |o*Function
    
+          
    |o*functor_t
    
+          
    |o+eoFunctorBase
    
+          
    
+            
    ||o*eoBF< A1, A2, R >
    
+            
    ||o*eoBF< Chrom &, Chrom &, bool >
    
+            
    ||o*eoBF< const Dummy &, const Dummy &, double >
    
+            
    ||o*eoBF< const eoPop< Chrom > &, eoPop< Chrom > &, void >
    
+            
    ||o*eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >
    
+            
    ||o*eoBF< const eoPop< eoVector< FitT, double > > &, eoPop< eoVector< FitT, double > > &, void >
    
+            
    ||o*eoBF< const EOT &, const EOT &, double >
    
+            
    ||o*eoBF< double &, const double &, bool >
    
+            
    ||o*eoBF< eoDistribution< EOT > &, eoPop< EOT > &, void >
    
+            
    ||o*eoBF< eoParseTree< FType, Node > &, eoParseTree< FType, Node > &, bool >
    
+            
    ||o*eoBF< eoPop< EOT > &, eoPop< EOT > &, void >
    
+            
    ||o*eoBF< eoPop< EOT > &, unsigned, void >
    
+            
    ||o*eoBF< eoPop< EoType > &, eoPop< EoType > &, void >
    
+            
    ||o*eoBF< eoPop< PyEO > &, unsigned, void >
    
+            
    ||o*eoBF< EOT &, const EOT &, bool >
    
+            
    ||o*eoBF< EOT &, EOT &, bool >
    
+            
    ||o*eoBF< EOType &, const EOType &, bool >
    
+            
    ||o*eoBF< EoType &, const EoType &, bool >
    
+            
    ||o*eoBF< EoType &, EoType &, bool >
    
+            
    ||o*eoBF< EOType &, EOType &, bool >
    
+            
    ||o*eoBF< eoVirus< FitT > &, const eoVirus< FitT > &, bool >
    
+            
    ||o*eoBF< ExternalEO &, const ExternalEO &, bool >
    
+            
    ||o*eoBF< ExternalEO &, ExternalEO &, bool >
    
+            
    ||o*eoBF< GenotypeT &, GenotypeT &, bool >
    
+            
    ||o*eoBF< PyEO &, const PyEO &, bool >
    
+            
    ||o*eoBF< PyEO &, PyEO &, bool >
    
+            
    ||o*eoBF< unsigned, Atom &, bool >
    
+            
    ||o*eoF< R >
    
+            
    ||o+eoF< bool >
    
+            
+            
    ||o+eoF< eoMonitor & >
    
+            
+            
    ||o+eoF< EOT >
    
+            
+            
    ||o+eoF< int >
    
+            
    
+              
    |||\*eo2
    
+            
    
+            
    ||o+eoF< T >
    
+            
+            
    ||o+eoF< void >
    
+            
+            
    ||o+eoUF< A1, R >
    
+            
+            
    ||o+eoUF< bool &, bool >
    
+            
+            
    ||o+eoUF< bool &, void >
    
+            
+            
    ||o+eoUF< Chrom &, bool >
    
+            
    
+              
    |||\+eoMonOp< Chrom >
    
+              
    
+                
    ||| o*eoBitInversion< Chrom >
    
+                
    ||| o*eoBitMutation< Chrom >
    
+                
    ||| o*eoBitNext< Chrom >
    
+                
    ||| o*eoBitPrev< Chrom >
    
+                
    ||| o*eoChromMutation
    
+                
    ||| o*eoChromMutation
    
+                
    ||| o*eoDetBitFlip< Chrom >
    
+                
    ||| \*eoOneBitFlip< Chrom >
    
+              
    
+            
    
+            
    ||o+eoUF< Chrom &, void >
    
+            
    
+              
    |||\+eoInit< Chrom >
    
+              
    
+                
    ||| o*eoInitChrom
    
+                
    ||| \*eoInitChrom
    
+              
    
+            
    
+            
    ||o+eoUF< const eoPop< EOT > &, bool >
    
+            
+            
    ||o+eoUF< const eoPop< EOT > &, const EOT & >
    
+            
+            
    ||o+eoUF< const eoPop< EOT > &, void >
    
+            
+            
    ||o+eoUF< const eoPop< EoType > &, void >
    
+            
    
+              
    |||o*eoDominanceMap< EoType >
    
+              
    |||\+eoStatBase< EoType >
    
+              
    
+                
    ||| o+eoStat< EoType, double >
    
+                
    
+                  
    ||| |\*AverageSizeStat
    
+                
    
+                
    ||| \+eoStat< EoType, unsigned >
    
+                
    
+                  
    |||  o*DagSizeStat
    
+                  
    |||  \*SumSizeStat
    
+                
    
+              
    
+            
    
+            
    ||o+eoUF< const eoPop< PyEO > &, const PyEO & >
    
+            
    
+              
    |||\+eoSelectOne< PyEO >
    
+              
    
+                
    ||| \*eoSelectOneWrapper
    
+              
    
+            
    
+            
    ||o+eoUF< const eoPop< PyEO > &, void >
    
+            
    
+              
    |||o*eoPerf2Worth< PyEO >
    
+              
    |||o+eoPerf2Worth< PyEO, double >
    
+              
    
+                
    ||||o+eoPerf2WorthCached< PyEO, double >
    
+                
    
+                  
    |||||\*CachedPerf2WorthWrapper
    
+                
    
+                
    ||||\*Perf2WorthWrapper
    
+              
    
+              
    |||\+eoStatBase< PyEO >
    
+              
    
+                
    ||| \*StatBaseWrapper
    
+              
    
+            
    
+            
    ||o+eoUF< const std::vector< const EOT * > &, void >
    
+            
+            
    ||o+eoUF< const std::vector< const EoType * > &, void >
    
+            
    
+              
    |||\+eoSortedStatBase< EoType >
    
+              
    
+                
    ||| \+eoSortedStat< EoType, string >
    
+                
    
+                  
    |||  \*eoBestIndividualStat
    
+                
    
+              
    
+            
    
+            
    ||o+eoUF< const std::vector< const PyEO * > &, void >
    
+            
    
+              
    |||\+eoSortedStatBase< PyEO >
    
+              
    
+                
    ||| \*SortedStatBaseWrapper
    
+              
    
+            
    
+            
    ||o+eoUF< eoDistribution< EOT > &, void >
    
+            
+            
    ||o+eoUF< eoDouble &, bool >
    
+            
    
+              
    |||\+eoMonOp< eoDouble >
    
+              
    
+                
    ||| \*Mutate< EOT >
    
+              
    
+            
    
+            
    ||o+eoUF< eoDouble &, void >
    
+            
    
+              
    |||o+eoEvalFunc< eoDouble >
    
+              
    
+                
    ||||\*Eval
    
+              
    
+              
    |||\+eoInit< eoDouble >
    
+              
    
+                
    ||| \*Init
    
+              
    
+            
    
+            
    ||o+eoUF< eoParseTree< FitnessType, Node > &, void >
    
+            
+            
    ||o+eoUF< eoParseTree< FType, Node > &, bool >
    
+            
+            
    ||o+eoUF< eoParseTree< FType, Node > &, void >
    
+            
+            
    ||o+eoUF< eoPop< EOT > &, void >
    
+            
+            
    ||o+eoUF< eoPopulator< EOT > &, void >
    
+            
+            
    ||o+eoUF< eoPopulator< PyEO > &, void >
    
+            
    
+              
    |||\+eoGenOp< PyEO >
    
+              
    
+                
    ||| \*GenOpWrapper
    
+              
    
+            
    
+            
    ||o+eoUF< EOT &, bool >
    
+            
+            
    ||o+eoUF< EOT &, unsigned int >
    
+            
+            
    ||o+eoUF< EOT &, void >
    
+            
+            
    ||o+eoUF< EoType &, bool >
    
+            
    
+              
    |||\+eoMonOp< EoType >
    
+              
    
+                
    ||| o*eoSymConstantMutate< EoType >
    
+                
    ||| o*eoSymLambdaMutate< EoType >
    
+                
    ||| o*eoSymNodeMutate< EoType >
    
+                
    ||| \*eoSymSubtreeMutate< EoType >
    
+              
    
+            
    
+            
    ||o+eoUF< EOType &, bool >
    
+            
+            
    ||o+eoUF< EoType &, void >
    
+            
+            
    ||o+eoUF< eoVector< FitT, double > &, void >
    
+            
+            
    ||o+eoUF< eoVirus< FitT > &, bool >
    
+            
+            
    ||o+eoUF< eoVirus< FitT > &, void >
    
+            
+            
    ||o+eoUF< ExternalEO &, bool >
    
+            
+            
    ||o+eoUF< ExternalEO &, void >
    
+            
+            
    ||o+eoUF< GenotypeT &, bool >
    
+            
+            
    ||o+eoUF< GenotypeT &, void >
    
+            
+            
    ||o+eoUF< int &, void >
    
+            
    
+              
    |||\+eoInit< int >
    
+              
    
+                
    ||| \*Tester
    
+              
    
+            
    
+            
    ||o+eoUF< PyEO &, bool >
    
+            
    
+              
    |||\+eoMonOp< PyEO >
    
+              
    
+                
    ||| \*MonOpWrapper
    
+              
    
+            
    
+            
    ||\+eoUF< T &, void >
    
+            
+          
    
+          
    |o*eoFunctorBase::binary_function_tag
    
+          
    |o*eoFunctorBase::procedure_tag
    
+          
    |o*eoFunctorBase::unary_function_tag
    
+          
    |o+eoFunctorStore
    
+          
    
+            
    ||\*eoState
    
+          
    
+          
    |o*FunDef
    
+          
    |o+eoGnuplot
    
+          
+          
    |o*HashDouble
    
+          
    |o*HashSym
    
+          
    |o*index_error
    
+          
    |o*interval_error
    
+          
    |o*IntervalBoundsCheck
    
+          
    |o*IntervalBoundsCheckImpl
    
+          
    |o*Inv
    
+          
    |o*IsNeg
    
+          
    |o*Lambda
    
+          
    |o*LanguageImpl
    
+          
    |o*LanguageTable
    
+          
    |o*mlp::layer
    
+          
    |o*qp::layer
    
+          
    |o*LinearScaling
    
+          
    |o*lower_triangular_matrix
    
+          
    |o*maximization
    
+          
    |o*Mean
    
+          
    |o*MemPool
    
+          
    |o*gp_parse_tree::MemPool
    
+          
    |o*MemPool::Chunk
    
+          
    |o*gp_parse_tree::MemPool::Chunk
    
+          
    |o*MemPool::Link
    
+          
    |o*gp_parse_tree::MemPool::Link
    
+          
    |o*Min
    
+          
    |o*minimization
    
+          
    |o*MultiFunction
    
+          
    |o*MultiFunctionImpl
    
+          
    |o*MyNodeStats
    
+          
    |o*eoNDPlusReplacement< EOT, WorthT >::WorthPair
    
+          
    |o*eoNDSorting< EOT >::Sorter
    
+          
    |o*eoNDSorting_II< EOT >::compare_nodes
    
+          
    |o*negexp_generator< T >
    
+          
    |o*mlp::net
    
+          
    |o*l2::net
    
+          
    |o*mse::net
    
+          
    |o*qp::net
    
+          
    |o*qp::neuron
    
+          
    |o*mlp::neuron
    
+          
    |o*NoBoundsCheck
    
+          
    |o*Node
    
+          
    |o*Node_alloc< T >
    
+          
    |o*gp_parse_tree::Node_alloc< T >
    
+          
    |o+NodeSelector
    
+          
+          
    |o*NodeSelector::NodeSelection
    
+          
    |o*normal_generator< T >
    
+          
    |o*NoScaling
    
+          
    |o*eoNthElementFitnessStat< EOT >::CmpFitness
    
+          
    |o+eoObject
    
+          
+          
    |o+eoOp< EOType >
    
+          
+          
    |o+eoOp< bool >
    
+          
+          
    |o+eoOp< Chrom >
    
+          
+          
    |o+eoOp< double >
    
+          
+          
    |o+eoOp< eoDouble >
    
+          
+          
    |o+eoOp< eoParseTree< FType, Node > >
    
+          
+          
    |o+eoOp< EOT >
    
+          
+          
    |o+eoOp< EoType >
    
+          
+          
    |o+eoOp< eoVirus< FitT > >
    
+          
+          
    |o+eoOp< ExternalEO >
    
+          
+          
    |o+eoOp< GenotypeT >
    
+          
+          
    |o+eoOp< PyEO >
    
+          
+          
    |o*Operation
    
+          
    |o+eoParam
    
+          
+          
    |o+eoParameterLoader
    
+          
    
+            
    ||\*eoParser
    
+          
    
+          
    |o*Parameters
    
+          
    |o*eoParamParamType
    
+          
    |o*eoParetoFitness< FitnessTraits >
    
+          
    |o+eoParetoFitnessTraits
    
+          
    
+            
    ||o*eoVariableParetoTraits
    
+            
    ||o*MinimizingFitnessTraits
    
+            
    ||o*MinimizingFitnessTraits
    
+            
    ||\*MinimizingTraits
    
+          
    
+          
    |o*eoParetoOneConstraintFitness< FitnessTraits >
    
+          
    |o*gp_parse_tree::parse_tree< T >
    
+          
    |o*gp_parse_tree::parse_tree< T >::base_const_iterator
    
+          
    |o*gp_parse_tree::parse_tree< T >::base_iterator
    
+          
    |o*gp_parse_tree::parse_tree< T >::const_iterator
    
+          
    |o*gp_parse_tree::parse_tree< T >::embedded_const_iterator
    
+          
    |o*gp_parse_tree::parse_tree< T >::embedded_iterator
    
+          
    |o*gp_parse_tree::parse_tree< T >::iterator
    
+          
    |o*gp_parse_tree::parse_tree< T >::subtree
    
+          
    |o*eoParseTreeDepthInit< FType, Node >::lt_arity
    
+          
    |o*eoPerf2Worth< EOT, WorthT >::compare_worth
    
+          
    |o*eoPerf2WorthCached< EOT, WorthT >::compare_worth
    
+          
    |o*phenotype
    
+          
    |o*PipeCommunication
    
+          
    |o*eoPop< EOT >::Cmp
    
+          
    |o*eoPop< EOT >::GetFitness
    
+          
    |o*eoPop< EOT >::Ref
    
+          
    |o+eoPopulator< EOT >
    
+          
+          
    |o*eoPopulator< EOT >::OutOfIndividuals
    
+          
    |o+eoPopulator< PyEO >
    
+          
    
+            
    ||\*PopulatorWrapper
    
+          
    
+          
    |o*Power
    
+          
    |o+eoPrintable
    
+          
+          
    |o*eoutils::ProcWrapper< Proc >
    
+          
    |o*Prod
    
+          
    |o*PyEO_pickle_suite
    
+          
    |o*PyFitness
    
+          
    |o*pyPop_pickle_suite
    
+          
    |o*random_generator< T >
    
+          
    |o+eoRealBaseVectorBounds
    
+          
+          
    |o*eoRealUxOver
    
+          
    |o*RNG_pickle_suite
    
+          
    |o*mlp::sample
    
+          
    |o*eoScalarFitness< ScalarType, Compare >
    
+          
    |o*eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits >
    
+          
    |o*eoScalarFitnessAssembledTraits
    
+          
    |o*ScalingBase
    
+          
    |o*eoSeqPopulator< EOT >::OutOfIndividuals
    
+          
    |o*mlp::set
    
+          
    |o*shared_ptr< T >
    
+          
    |o*SortOnTargets
    
+          
    |o*square_matrix
    
+          
    |o*Standard_alloc< T >
    
+          
    |o*gp_parse_tree::Standard_alloc< T >
    
+          
    |o*Standard_Node_alloc< T >
    
+          
    |o*gp_parse_tree::Standard_Node_alloc< T >
    
+          
    |o*eoState::loading_error
    
+          
    |o*eoSTLBF< A1, A2, R >
    
+          
    |o*eoSTLF< R >
    
+          
    |o*eoSTLUF< A1, R >
    
+          
    |o*Sum
    
+          
    |o*Sym
    
+          
    |o*detail::SymArgs
    
+          
    |o*detail::SymArgsImpl
    
+          
    |o*detail::SymKey
    
+          
    |o*detail::SymKey::Hash
    
+          
    |o*SymregNode
    
+          
    |o*detail::SymValue
    
+          
    |o*T_pickle_suite< T >
    
+          
    |o*TargetInfo
    
+          
    |o*gp_parse_tree::Tree_alloc< T >
    
+          
    |o*Tree_alloc< T >
    
+          
    |o*TreeBuilder
    
+          
    |o*UF_random_generator< T >
    
+          
    |o*Unary< Func >
    
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o*unary_function
    
+          
    |o*unary_function
    
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o+unary_function
    
+          
+          
    |o*eoutils::UnaryWrapper< Unary >
    
+          
    |o*uniform_generator< T >
    
+          
    |o*UniqueNodeStats
    
+          
    |o+eoUpdatable
    
+          
+          
    |o*UserDefStruct
    
+          
    |o*ValueParam_pickle_suite< T >
    
+          
    |o*Var
    
+          
    |o+vector
    
+          
+          
    |o+vector
    
+          
+          
    |o+vector
    
+          
+          
    |o+vector
    
+          
+          
    |o*vector
    
+          
    |o+vector
    
+          
+          
    |o+vector
    
+          
+          
    |o+vector
    
+          
+          
    |\*weak_ptr< T >
    
+        
    
+        
    o*Class Members
    
+        
    o+Namespace List
    
+        
+        
    o+Modules
    
+        
+        
    o*Namespace Members
    
+        
    \+Related Pages
    
+        
+      
    
+    
    
+  
+
diff --git a/trunk/paradiseo-eo/doc/html/tutorial_2_lesson2_2binary__value_8h-source.html b/trunk/paradiseo-eo/doc/html/tutorial_2_lesson2_2binary__value_8h-source.html
new file mode 100644
index 000000000..b2c378e87
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/tutorial_2_lesson2_2binary__value_8h-source.html
@@ -0,0 +1,28 @@
+
+
+EO: binary_value.h Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+tutorial / Lesson2
    
+
    tutorial/Lesson2/binary_value.h
    00001 #include <eo>
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 
+00009 // INIT
+00010 double binary_value(const std::vector<bool>& _chrom)
+00011 {
+00012   double sum = 0;
+00013   for (unsigned i = 0; i < _chrom.size(); i++)
+00014     sum += _chrom[i];
+00015   return sum;
+00016 }
+00017 
+
    Generated on Thu Oct 19 05:06:34 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/tutorial_2_lesson2_2real__value_8h-source.html b/trunk/paradiseo-eo/doc/html/tutorial_2_lesson2_2real__value_8h-source.html
new file mode 100644
index 000000000..ee37be209
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/tutorial_2_lesson2_2real__value_8h-source.html
@@ -0,0 +1,30 @@
+
+
+EO: real_value.h Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+tutorial / Lesson2
    
+
    tutorial/Lesson2/real_value.h
    00001 #include <vector>
+00002 //-----------------------------------------------------------------------------
+00008 // INIT
+00009 double real_value(const std::vector<double>& _ind)
+00010 {
+00011   double sum = 0;
+00012   for (unsigned i = 0; i < _ind.size(); i++)
+00013       {
+00014           sum += _ind[i] * _ind[i];
+00015       }
+00016   return -sum;
+00017 }
+00018 
+00019 
+00020 
+
    Generated on Thu Oct 19 05:06:42 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/tutorial_2_lesson3_2binary__value_8h-source.html b/trunk/paradiseo-eo/doc/html/tutorial_2_lesson3_2binary__value_8h-source.html
new file mode 100644
index 000000000..e8da24328
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/tutorial_2_lesson3_2binary__value_8h-source.html
@@ -0,0 +1,28 @@
+
+
+EO: binary_value.h Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+tutorial / Lesson3
    
+
    tutorial/Lesson3/binary_value.h
    00001 #include <eo>
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 
+00009 // INIT
+00010 double binary_value(const std::vector<bool>& _chrom)
+00011 {
+00012   double sum = 0;
+00013   for (unsigned i = 0; i < _chrom.size(); i++)
+00014     sum += _chrom[i];
+00015   return sum;
+00016 }
+00017 
+
    Generated on Thu Oct 19 05:06:34 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/tutorial_2_lesson3_2real__value_8h-source.html b/trunk/paradiseo-eo/doc/html/tutorial_2_lesson3_2real__value_8h-source.html
new file mode 100644
index 000000000..00c6d4512
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/tutorial_2_lesson3_2real__value_8h-source.html
@@ -0,0 +1,30 @@
+
+
+EO: real_value.h Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+tutorial / Lesson3
    
+
    tutorial/Lesson3/real_value.h
    00001 #include <vector>
+00002 //-----------------------------------------------------------------------------
+00008 // INIT
+00009 double real_value(const std::vector<double>& _ind)
+00010 {
+00011   double sum = 0;
+00012   for (unsigned i = 0; i < _ind.size(); i++)
+00013       {
+00014           sum += _ind[i] * _ind[i];
+00015       }
+00016   return sum;
+00017 }
+00018 
+00019 
+00020 
+
    Generated on Thu Oct 19 05:06:42 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/tutorial_2_lesson4_2binary__value_8h-source.html b/trunk/paradiseo-eo/doc/html/tutorial_2_lesson4_2binary__value_8h-source.html
new file mode 100644
index 000000000..4a8b62cec
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/tutorial_2_lesson4_2binary__value_8h-source.html
@@ -0,0 +1,35 @@
+
+
+EO: binary_value.h Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+tutorial / Lesson4
    
+
    tutorial/Lesson4/binary_value.h
    00001 #include <eo>
+00002 
+00003 //-----------------------------------------------------------------------------
+00004 
+00010 template <class Chrom> double binary_value(const Chrom& _chrom)
+00011 {
+00012   double sum = 0;
+00013   for (unsigned i = 0; i < _chrom.size(); i++)
+00014     if (_chrom[i])
+00015         sum += _chrom[i];
+00016   return sum;
+00017 }
+00018 
+00019 struct BinaryValue
+00020 {
+00021   template <class Chrom> void operator()(Chrom& _chrom)
+00022   {
+00023     _chrom.fitness(binary_value(_chrom));
+00024   }
+00025 };
+
    Generated on Thu Oct 19 05:06:34 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/tutorial_2_lesson4_2real__value_8h-source.html b/trunk/paradiseo-eo/doc/html/tutorial_2_lesson4_2real__value_8h-source.html
new file mode 100644
index 000000000..ca33cef67
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/tutorial_2_lesson4_2real__value_8h-source.html
@@ -0,0 +1,29 @@
+
+
+EO: real_value.h Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+tutorial / Lesson4
    
+
    tutorial/Lesson4/real_value.h
    00001 #include <vector>
+00002 //-----------------------------------------------------------------------------
+00003 
+00004 
+00010 double real_value(const std::vector<double>& _ind)
+00011 {
+00012   double sum = 0;
+00013   for (unsigned i = 0; i < _ind.size(); i++)
+00014       sum += _ind[i] * _ind[i];
+00015   return sqrt(sum);
+00016 }
+00017 
+00018 
+00019 
+
    Generated on Thu Oct 19 05:06:42 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/tutorial_2_r_e_a_d_m_e-source.html b/trunk/paradiseo-eo/doc/html/tutorial_2_r_e_a_d_m_e-source.html
new file mode 100644
index 000000000..25066b41e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/tutorial_2_r_e_a_d_m_e-source.html
@@ -0,0 +1,28 @@
+
+
+EO: README Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+tutorial
    
+
    tutorial/README
    00001 Eo Tutorial - corresponding to EO version 0.9.1+
+00002 
+00003 To start the tutorial, read index.html in your favorite browser.
+00004 
+00005 Many things are missing, including many solutions for the exercises, 
+00006 the introduction to EC and most of the Component-based pages.
+00007 More important, all examples of this tutorial have only been tested 
+00008 on a Linux computer, and the Makefile will not work with MS-Windows 
+00009 systems. Any help is welcome!
+00010 
+00011 Be patient ... 
+00012 evoMarc
+00013 
+
    Generated on Thu Oct 19 05:06:42 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/tutorial_2_templates_2_r_e_a_d_m_e-source.html b/trunk/paradiseo-eo/doc/html/tutorial_2_templates_2_r_e_a_d_m_e-source.html
new file mode 100644
index 000000000..f906a0472
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/tutorial_2_templates_2_r_e_a_d_m_e-source.html
@@ -0,0 +1,164 @@
+
+
+EO: README Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+tutorial / Templates
    
+
    tutorial/Templates/README
    00001 Quick NOTE: This version of README is obsolete (May 25, 2004)
+00002 In particular, a simpler version of the algorithm can be generated
+00003 using the script 
+00004                    createSimple
+00005 
+00006 with the same syntax. It is also more powerful, allowing for instance
+00007 to create you own statistics on the population, saving it in a file
+00008 and/or plotting on on-line during the run (see eoStat.tmpl).
+00009 More details some day, when I have some time ...
+00010 
+00011 ============= Old README (most is still accurate, though) ==========
+00012 
+00013 This directory contains sample files that should make it easy to
+00014 create an EO algorithm to evolve any type of structure 
+00015 (EO comes with two examples, bitstrings and vector of real variables,
+00016 so you'll need this as soon as you want to evolve something else).
+00017 
+00018 At the moment, only algorithms involving a scalar fitness (double)
+00019 are implemented (see test dir for Pareto optimization of multiple-
+00020 objective fitness - or be patient :-)
+00021 
+00022 This file will help you to build the same algorithm than the ones 
+00023 in the Lesson4 of the tutorial, but with YOUR genotype instead of
+00024 bitstrings or vector<double>. More details in Lesson5 of the tutorial.
+00025 
+00026 It is assumed in the following that you have read the first part of
+00027 the tutorial (Lessons 1 to 4).
+00028 
+00029 Creating the algorithm for your genotype
+00030 ----------------------------------------
+00031 In what follows, we will suppose that you want to evolve some data
+00032 structure, and that you have enough programming skills to be able to
+00033 write C code for its random initilialization, its crossover, its
+00034 mutation and the computation of its fitness.
+00035 
+00036 The helper script * create.sh * will create for you the files you need
+00037 from the samples in tutorial/Templates dir, and all you'll have to do
+00038 is to include the actual code where indicated in those files (between
+00039 keywords START and END). 
+00040 
+00041 First, let's choose a name: let's call the new EO class eoAppli.
+00042 All newly created classes will be named eoAppliXXX (in the file
+00043 eoAppliXXX)
+00044 
+00045 1- cd to the tutorial dir
+00046 
+00047 2- create the directory for your application (let's assume you call it
+00048 APPLICATION): type in
+00049 
+00050             mkdir APPLICATION
+00051 
+00052 3- go to the Templates dir 
+00053 
+00054             cd Templates
+00055 
+00056 and run the helper script create.sh with the following arguments 
+00057 
+00058             ./create.sh Appli ../APPLICATION
+00059 
+00060 4- cd to the APPLICATION dir (cd ../APPLICATION). 
+00061 You should see there the following files:
+00062    AppliEA.cpp            the main file, includes all other, to be compiled
+00063    Makefile               with default target eoAppliEA
+00064    eoAppli.h              class eoAppli<FitT>, FitT = template fitness
+00065    eoAppliEvalFunc.h      class for the computation of fotness
+00066    eoAppliInit.h          class for genotype initlialization
+00067    eoAppliMutation.h      class for mutation 
+00068    eoAppliQuadCrossover.h class for (quadratic) crossover
+00069    make_genotype_Appli.h  helper function that create the initializer
+00070    make_op_Appli.h        helper function that creates the variatin operators
+00071 
+00072 Note: You can go directly to step 6 and 7: you'll get a lot of
+00073 warnings, but will be able to run an EA that does nothing!
+00074 
+00075 5- Edit those files to suit your needs. The minimal addition you'll need
+00076 to make are
+00077    in eoAppli.h              define your genotype
+00078    in eoAppliInit.h          define the initialization of one genotype
+00079    in eoAppliMutation.h      define the mutation of one genotype
+00080    in eoAppliQuadCrossover.h define the crossover of 2 genotypes
+00081 
+00082 HINT: look for keywords START and END and modify code in between.
+00083 
+00084 6- Compile eoAppliEA.cpp. If your APPLICATION dir is in the tutorial
+00085 dir, you don't need to modify Makefile. Just type in
+00086 
+00087                % make
+00088 
+00089 7- Run the resulting program:
+00090 
+00091                % eoAppliEA
+00092 
+00093 The default output is one line per generation with the generation
+00094 number, the number of evaluations performed, the best and average
+00095 fitnesses in the population.
+00096 The algorithm stops by default after 100 generations.
+00097 
+00098 8- Customize the parameters: copy eoAppliEA.status into
+00099 e.g. eoAppliEA.param, edit eoAppliEA.param (uncomment the lines you
+00100 want to become active), and run
+00101 
+00102                % eoAppliEA @eoAppliEA.param
+00103 
+00104 (see the Lesson 5 of the tutorial for more details now).
+00105 
+00106 HINTS
+00107 -----
+00108 
+00109 1- If some new classes you create require some user parameter, you can
+00110 either read them in the file where they are created (e.g.
+00111 make_op_Appli.h for variation operators), or pass the eoParser to the
+00112 constructor of the class, and read the parameter from the parser.
+00113 
+00114 2- If you stick to privacy for the data in your EO class, you will
+00115 probably need to write accessors to those data, as well as some public
+00116 methods to modify them, as soon as some other methods need them too.
+00117 
+00118 3- The sample make_op_Appli.h supposes that you ony have one crossover
+00119 and one mutation operator. However, the code for multiple operators is
+00120 there: you can have for instance 2 crossover operators, and choose
+00121 among them according to relative weights (proportional choice) - same
+00122 for mutation. Look at the operator section in eoAppliEA.cpp In
+00123 particular, the user parameters cross1Rate and mut1Rate are totally
+00124 useless for a single operator.
+00125 
+00126 To add another operator, you have to create another class by mimicking
+00127 what has been done for the first operator.
+00128 For instance, let's suppose you want to create another mutation.
+00129 
+00130 * duplicate the code for eoAppliMutation class 
+00131 * in the second version, change the class name (eoAppliMutation) into
+00132 another name (let's say eoAppliBetterMutation) - you must change the
+00133 name in the class declaration, in the constructor and in the
+00134 className() method.
+00135 * in the new eoAppliBetterMutation class, change the code for the
+00136 operator() - and eventually the code for the constructor.
+00137 * in the make_op_Appli.h file, in the mutation section, uncomment the 
+00138 lines 
+00139       mut = new eoAppliSecondMutation<Indi>(varType  _anyVariable);
+00140       _state.storeFunctor(mut);
+00141       double mut2Rate = _parser.createParam(1.0, "mut2Rate", "Relative rate for mutation 2", '2', "Variation Operators").value(); 
+00142        propMutation.add(*mut, mut2Rate); 
+00143 
+00144 and change the name of the class from eoAppliSecondMutation to your
+00145 name eoAppliBetterMutation (you can also change the keyword from
+00146 mut2Rate to something more meaningful like BetterMutationRate).
+00147 You're done!
+00148 
+00149 In case of problem: Marc.Schoenauer@inria.fr
+
    Generated on Thu Oct 19 05:06:42 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/util_8cpp-source.html b/trunk/paradiseo-eo/doc/html/util_8cpp-source.html
new file mode 100644
index 000000000..57906d8ce
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/util_8cpp-source.html
@@ -0,0 +1,42 @@
+
+
+EO: util.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+contrib / mathsym / fun
    
+
    util.cpp
    00001 /*          
+00002  *             Copyright (C) 2005 Maarten Keijzer
+00003  *
+00004  *          This program is free software; you can redistribute it and/or modify
+00005  *          it under the terms of version 2 of the GNU General Public License as 
+00006  *          published by the Free Software Foundation. 
+00007  *
+00008  *          This program is distributed in the hope that it will be useful,
+00009  *          but WITHOUT ANY WARRANTY; without even the implied warranty of
+00010  *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00011  *          GNU General Public License for more details.
+00012  *
+00013  *          You should have received a copy of the GNU General Public License
+00014  *          along with this program; if not, write to the Free Software
+00015  *          Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00016  */
+00017 
+00018 #include <string>
+00019 #include <iostream>
+00020 
+00021 using namespace std;
+00022 
+00023 double error(string errstr) {
+00024     cerr << "ERROR: " << errstr << endl;
+00025     exit(1);
+00026 }
+00027 
+
    Generated on Thu Oct 19 05:06:44 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/value_param_8cpp-source.html b/trunk/paradiseo-eo/doc/html/value_param_8cpp-source.html
new file mode 100644
index 000000000..46b40712f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/value_param_8cpp-source.html
@@ -0,0 +1,209 @@
+
+
+EO: valueParam.cpp Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+src / pyeo
    
+
    valueParam.cpp
    00001 /*
+00002     PyEO
+00003     
+00004     Copyright (C) 2003 Maarten Keijzer
+00005 
+00006     This program is free software; you can redistribute it and/or modify
+00007     it under the terms of the GNU General Public License as published by
+00008     the Free Software Foundation; either version 2 of the License, or
+00009     (at your option) any later version.
+00010 
+00011     This program is distributed in the hope that it will be useful,
+00012     but WITHOUT ANY WARRANTY; without even the implied warranty of
+00013     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+00014     GNU General Public License for more details.
+00015 
+00016     You should have received a copy of the GNU General Public License
+00017     along with this program; if not, write to the Free Software
+00018     Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+00019 */
+00020 
+00021 #include <utils/eoParam.h>
+00022 #include <stdexcept>
+00023 
+00024 // Here's 'len'. Why? dunno
+00025 #include "valueParam.h"
+00026 #include <boost/python/detail/api_placeholder.hpp>
+00027 
+00028 using namespace boost::python;
+00029 
+00030 class ParamWrapper : public eoParam
+00031 {
+00032 public:
+00033     PyObject* self;
+00034     ParamWrapper(PyObject* p) : self(p) {}
+00035     ParamWrapper(PyObject* p,
+00036         std::string a,
+00037         std::string b,
+00038         std::string c,
+00039         char d,
+00040         bool e) : eoParam(a,b,c,d,e), self(p) {}
+00041 
+00042     
+00043     std::string getValue() const
+00044     {
+00045         return call_method<std::string>(self, "getValueAsString");
+00046     }
+00047 
+00048     void setValue(const std::string& s)
+00049     {
+00050         call_method<void>(self, "setValueAsString", s);
+00051     }
+00052         
+00053 };
+00054 
+00055 template <typename T>
+00056 struct ValueParam_pickle_suite : boost::python::pickle_suite
+00057 {
+00058     static
+00059     boost::python::tuple getstate(const eoValueParam<T>& _param)
+00060     {
+00061         str v(_param.getValue());
+00062         str d(_param.description());
+00063         str def(_param.defValue());
+00064         str l(_param.longName());
+00065         object s(_param.shortName());
+00066         object r(_param.required());    
+00067         return make_tuple(v,d,def,l,s,r);
+00068     }
+00069     static
+00070     void setstate(eoValueParam<T>& _param, boost::python::tuple pickled)
+00071     {
+00072         std::string v = extract<std::string>(pickled[0]);
+00073         std::string d = extract<std::string>(pickled[1]);
+00074         std::string def = extract<std::string>(pickled[2]);
+00075         std::string l = extract<std::string>(pickled[3]);
+00076         char s = extract<char>(pickled[4]);
+00077         bool r = extract<bool>(pickled[5]);
+00078 
+00079         _param = eoValueParam<T>(T(), l, d, s, r);
+00080         _param.defValue(d);
+00081         _param.setValue(v);
+00082     }
+00083 };
+00084 
+00085 template <class T, class U>
+00086 U getv(const eoValueParam<T>& v)    { return v.value(); }
+00087 
+00088 template <class T, class U>
+00089 void setv(eoValueParam<T>& v, U val) { v.value() = val; }
+00090 
+00091 template <>
+00092 numeric::array getv< std::vector<double>, numeric::array >
+00093     (const eoValueParam< std::vector<double> >& param)
+00094 {
+00095     const std::vector<double>& v = param.value();
+00096     list result;
+00097 
+00098     for (unsigned i =0; i < v.size(); ++i)
+00099         result.append(v[i]);
+00100     
+00101     return numeric::array(result);
+00102 }
+00103 
+00104 template <>
+00105 void setv< std::vector<double>, numeric::array >
+00106     (eoValueParam< std::vector<double> >& param, numeric::array val)
+00107 {
+00108     std::vector<double>& v = param.value();
+00109     v.resize( boost::python::len(val) );
+00110     for (unsigned i = 0; i < v.size(); ++i)
+00111     {
+00112         extract<double> x(val[i]);
+00113         if (!x.check())
+00114             throw std::runtime_error("double expected");
+00115         
+00116         v[i] = x();
+00117     }
+00118 }
+00119 
+00120 template <>
+00121 tuple getv<std::pair<double, double>, tuple >
+00122     (const eoValueParam< std::pair<double,double> >& p)
+00123 {
+00124     return make_tuple(p.value().first, p.value().second);
+00125 }
+00126 
+00127 template <>
+00128 void setv< std::pair<double, double>, tuple >
+00129     (eoValueParam< std::pair<double,double> >& p, tuple val)
+00130 {
+00131     extract<double> first(val[0]);
+00132     extract<double> second(val[1]);
+00133 
+00134     if (!first.check())
+00135         throw std::runtime_error("doubles expected");
+00136     if (!second.check())
+00137         throw std::runtime_error("doubles expected");
+00138 
+00139     p.value().first = first();
+00140     p.value().second = second();
+00141 }
+00142 
+00143 template <class T, class U>
+00144 void define_valueParam(std::string prefix)
+00145 {
+00146     std::string name = "eoValueParam";
+00147     name += prefix;
+00148     
+00149     class_<eoValueParam<T>, bases<eoParam> >(name.c_str(), init<>())
+00150         .def(init<T, std::string, std::string, char, bool>())
+00151         .def(init<T, std::string, std::string, char>())
+00152         .def(init<T, std::string, std::string>())
+00153         .def(init<T, std::string>())
+00154         .def("getValueAsString", &eoValueParam<T>::getValue)
+00155         .def("__str__", &eoValueParam<T>::getValue)
+00156         .def("setValueAsString", &eoValueParam<T>::setValue)
+00157         .def("getValue", getv<T, U>)
+00158         .def("setValue", setv<T, U>)
+00159         .add_property("value", getv<T, U>, setv<T, U>)
+00160         .def_pickle(ValueParam_pickle_suite<T>())
+00161         ;
+00162 }
+00163 
+00164 void valueParam()
+00165 {
+00166     class_<eoParam, ParamWrapper, boost::noncopyable>("eoParam", init<>())
+00167         .def(init< std::string, std::string, std::string, char, bool>())
+00168         .def("getValueAsString", &ParamWrapper::getValue)
+00169         .def("setValueAsString", &ParamWrapper::setValue)
+00170         .def("longName", &eoParam::longName, return_value_policy<copy_const_reference>())
+00171         //.def("defValue", &eoParam::defValue, return_value_policy<copy_const_reference>())
+00172         .def("description", &eoParam::description, return_value_policy<copy_const_reference>())
+00173         .def("shortName", &eoParam::shortName)
+00174         .def("required", &eoParam::required)
+00175         ;
+00176     
+00177     define_valueParam<int, int>("Int");
+00178     define_valueParam<double, double>("Float");
+00179     define_valueParam<std::vector<double>, numeric::array >("Vec");
+00180     define_valueParam< std::pair<double, double>, tuple >("Pair");
+00181     //define_valueParam< object, object >("Py");
+00182 
+00183     class_<ValueParam, bases<eoParam> >("eoValueParam", init<>())
+00184         //.def(init<object, std::string, std::string, char, bool>())
+00185         //.def(init<object, std::string, std::string, char>())
+00186         //.def(init<object, std::string, std::string>())
+00187         .def(init<object, std::string>())
+00188         .def("getValueAsString", &ValueParam::getValue)
+00189         .def("__str__", &ValueParam::getValue)
+00190         .def("setValueAsString", &ValueParam::setValue)
+00191         .add_property("object", &ValueParam::getObj, &ValueParam::setObj)
+00192         ;
+00193 }
+00194 
+
    Generated on Thu Oct 19 05:06:44 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/value_param_8h-source.html b/trunk/paradiseo-eo/doc/html/value_param_8h-source.html
new file mode 100644
index 000000000..1aac6c30d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/value_param_8h-source.html
@@ -0,0 +1,58 @@
+
+
+EO: valueParam.h Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+src / pyeo
    
+
    valueParam.h
    00001 #ifndef VALUEPARAM_H
+00002 #define VALUEPARAM_H
+00003 
+00004 #include <string>
+00005 #include <boost/python.hpp>
+00006 
+00007 class ValueParam : public eoParam // ValueParam containing python object
+00008 {
+00009     boost::python::object obj;
+00010     
+00011     public:
+00012     
+00013     ValueParam() : eoParam(), obj() {}
+00014     
+00015     ValueParam(boost::python::object o, 
+00016             std::string longName, 
+00017             std::string d = "No Description",
+00018             char s = 0,
+00019             bool r = false) : eoParam(longName, "", d, s, r) 
+00020             {
+00021                 std::cerr << "HI" << std::endl;
+00022                 obj = o;
+00023                 eoParam::defValue(getValue());
+00024             }
+00025 
+00026     
+00027     std::string getValue() const
+00028     {
+00029         boost::python::str s = boost::python::str(obj);
+00030         return std::string(boost::python::extract<const char*>(s));
+00031     }
+00032 
+00033     void setValue(const std::string& v)
+00034     {
+00035         std::cerr << "not implemented yet" << std::endl;
+00036     }
+00037 
+00038     boost::python::object getObj() const { return obj;}
+00039     void setObj(boost::python::object o) { obj = o; }
+00040     
+00041 };
+00042 
+00043 #endif
+
    Generated on Thu Oct 19 05:06:44 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/vecop_8h-source.html b/trunk/paradiseo-eo/doc/html/vecop_8h-source.html
new file mode 100644
index 000000000..01400c63a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/vecop_8h-source.html
@@ -0,0 +1,229 @@
+
+
+EO: vecop.h Source File
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    
+app / gprop
    
+
    vecop.h
    00001 //-----------------------------------------------------------------------------
+00002 // vecop.h
+00003 //-----------------------------------------------------------------------------
+00004 
+00005 #ifndef VECOP_H
+00006 #define VECOP_H
+00007 
+00008 //-----------------------------------------------------------------------------
+00009 
+00010 #include <iostream>    // ostream istream
+00011 #include <vector>      // vector
+00012 #include <functional>  // plus minus multiplies divides
+00013 #include <numeric>     // inner_product
+00014 
+00015 //-----------------------------------------------------------------------------
+00016 // vector + vector
+00017 //-----------------------------------------------------------------------------
+00018 
+00019 template<class T> vector<T> operator+(const vector<T>& v1, const vector<T>& v2)
+00020 {
+00021   vector<T> tmp = v1;
+00022   transform(tmp.begin(), tmp.end(), v2.begin(), tmp.begin(), plus<T>());
+00023   return tmp;
+00024 }
+00025 
+00026 template<class T> vector<T> operator-(const vector<T>& v1, const vector<T>& v2)
+00027 {
+00028   vector<T> tmp = v1;
+00029   transform(tmp.begin(), tmp.end(), v2.begin(), tmp.begin(), minus<T>());
+00030   return tmp;
+00031 }
+00032 
+00033 template<class T> T operator*(const vector<T>& v1, const vector<T>& v2)
+00034 {
+00035   return inner_product(v1.begin(), v1.end(), v2.begin(), static_cast<T>(0));
+00036 }
+00037 
+00038 template<class T> T operator/(const vector<T>& v1, const vector<T>& v2)
+00039 {
+00040   return inner_product(v1.begin(), v1.end(), v2.begin(), static_cast<T>(0),
+00041                        plus<T>(), divides<T>());
+00042 }
+00043 
+00044 //-----------------------------------------------------------------------------
+00045 // vector += vector
+00046 //-----------------------------------------------------------------------------
+00047 
+00048 template<class T> vector<T>& operator+=(vector<T>& v1, const vector<T>& v2)
+00049 {
+00050   transform(v1.begin(), v1.end(), v2.begin(), v1.begin(), plus<T>());
+00051   return v1;
+00052 }
+00053 
+00054 template<class T> vector<T>& operator-=(vector<T>& v1, const vector<T>& v2)
+00055 {
+00056   transform(v1.begin(), v1.end(), v2.begin(), v1.begin(), minus<T>());
+00057   return v1;
+00058 }
+00059 
+00060 //-----------------------------------------------------------------------------
+00061 // vector + number
+00062 //-----------------------------------------------------------------------------
+00063 
+00064 template<class A, class B> vector<A> operator+(const vector<A>& a, const B& b)
+00065 {
+00066   vector<A> tmp = a;
+00067   transform(tmp.begin(), tmp.end(), tmp.begin(), bind2nd(plus<A>(), b));
+00068   return tmp;
+00069 }
+00070 
+00071 template<class A, class B> vector<A> operator-(const vector<A>& a, const B& b)
+00072 {
+00073   vector<A> tmp = a;
+00074   transform(tmp.begin(), tmp.end(), tmp.begin(), bind2nd(minus<A>(), b));
+00075   return tmp;
+00076 }
+00077 
+00078 template<class A, class B> vector<A> operator*(const vector<A>& a, const B& b)
+00079 {
+00080   vector<A> tmp = a;
+00081   transform(tmp.begin(), tmp.end(), tmp.begin(), bind2nd(multiplies<A>(), b));
+00082   return tmp;
+00083 }
+00084 
+00085 template<class A, class B> vector<A> operator/(const vector<A>& a, const B& b)
+00086 {
+00087   vector<A> tmp = a;
+00088   transform(tmp.begin(), tmp.end(), tmp.begin(), bind2nd(divides<A>(), b));
+00089   return tmp;
+00090 }
+00091 
+00092 //-----------------------------------------------------------------------------
+00093 // number + vector
+00094 //-----------------------------------------------------------------------------
+00095 
+00096 template<class A, class B> vector<A> operator+(const B& b, const vector<A>& a)
+00097 {
+00098   vector<A> tmp = a;
+00099   transform(tmp.begin(), tmp.end(), tmp.begin(), bind2nd(plus<A>(), b));
+00100   return tmp;
+00101 }
+00102 
+00103 template<class A, class B> vector<A> operator-(const B& b, const vector<A>& a)
+00104 {
+00105   vector<A> tmp(a.size(), b);
+00106   transform(tmp.begin(), tmp.end(), a.begin(), tmp.begin(), minus<A>());
+00107   return tmp;
+00108 }
+00109 
+00110 template<class A, class B> vector<A> operator*(const B& b, const vector<A>& a)
+00111 {
+00112   vector<A> tmp = a;
+00113   transform(tmp.begin(), tmp.end(), tmp.begin(), bind2nd(multiplies<A>(), b));
+00114   return tmp;
+00115 }
+00116 
+00117 template<class A, class B> vector<A> operator/(const B& b, const vector<A>& a)
+00118 {
+00119   vector<A> tmp(a.size(), b);
+00120   transform(tmp.begin(), tmp.end(), a.begin(), tmp.begin(), divides<A>());
+00121   return tmp;
+00122 }
+00123 
+00124 //-----------------------------------------------------------------------------
+00125 // vector += number
+00126 //-----------------------------------------------------------------------------
+00127 
+00128 template<class A, class B> vector<A>& operator+=(vector<A>& a, const B& b)
+00129 {
+00130   transform(a.begin(), a.end(), a.begin(), bind2nd(plus<A>(), b));
+00131   return a;
+00132 }
+00133 
+00134 template<class A, class B> vector<A>& operator-=(vector<A>& a, const B& b)
+00135 {
+00136   transform(a.begin(), a.end(), a.begin(), bind2nd(minus<A>(), b));
+00137   return a;
+00138 }
+00139 
+00140 template<class A, class B> vector<A>& operator*=(vector<A>& a, const B& b)
+00141 {
+00142   transform(a.begin(), a.end(), a.begin(), bind2nd(multiplies<A>(), b));
+00143   return a;
+00144 }
+00145 
+00146 template<class A, class B> vector<A>& operator/=(vector<A>& a, const B& b)
+00147 {
+00148   transform(a.begin(), a.end(), a.begin(), bind2nd(divides<A>(), b));
+00149   return a;
+00150 }
+00151 
+00152 //-----------------------------------------------------------------------------
+00153 // I/O
+00154 //-----------------------------------------------------------------------------
+00155 
+00156 template<class T> ostream& operator<<(ostream& os, const vector<T>& v)
+00157 {
+00158   os << '<';
+00159   if (v.size())
+00160     {
+00161       copy(v.begin(), v.end() - 1, ostream_iterator<T>(os, " "));
+00162       os << v.back();
+00163     } 
+00164   return os << '>';
+00165 }
+00166 
+00167 template<class T> istream& operator>>(istream& is, vector<T>& v)
+00168 {
+00169   v.clear();
+00170   
+00171   char c;
+00172   is >> c;
+00173   if (!is || c != '<')
+00174     is.setstate(ios::failbit);
+00175   else
+00176     {
+00177       T t;
+00178       do {
+00179         is >> c;
+00180         if (is && c!= '>')
+00181           {
+00182             is.putback(c);
+00183             is >> t;
+00184             if (is)
+00185               v.push_back(t);
+00186           }
+00187       } while (is && c != '>');
+00188     }
+00189   
+00190   return is;
+00191 }
+00192 
+00193 //-----------------------------------------------------------------------------
+00194 // euclidean_distance
+00195 //-----------------------------------------------------------------------------
+00196 
+00197 template<class T> T euclidean_distance(const vector<T>& v1, 
+00198                                        const vector<T>& v2)
+00199 {
+00200   T sum = 0, tmp;
+00201   
+00202   for (unsigned i = 0; i < v1.size(); ++i)
+00203     {
+00204       tmp = v1[i] - v2[i];
+00205       sum += tmp * tmp;
+00206     }
+00207 
+00208   return sqrt(sum);
+00209 }
+00210 
+00211 //-----------------------------------------------------------------------------
+00212 
+00213 #endif
+00214 
+
    Generated on Thu Oct 19 05:06:44 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/html/webpages.html b/trunk/paradiseo-eo/doc/html/webpages.html
new file mode 100644
index 000000000..a518263a3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/html/webpages.html
@@ -0,0 +1,15 @@
+
+
+EO: Related webpages
+
+
+
+
      
    
+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
    
+
    Related webpages
    
+
    Generated on Thu Oct 19 05:07:01 2006 for EO by 
+
+doxygen 1.3.9.1 
    
+
+
diff --git a/trunk/paradiseo-eo/doc/index.h b/trunk/paradiseo-eo/doc/index.h
new file mode 100644
index 000000000..537c02716
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/index.h
@@ -0,0 +1,67 @@
+/** @mainpage Welcome to Evolving Objects
+
+@section intro Introduction
+
+EO is a templates-based, ANSI-C++ compliant evolutionary computation library. It
+contains classes for almost any kind of evolutionary computation you might come
+up to - at least for the ones we could think of. It is component-based, so that
+if you don't find the class you need in it, it is very easy to subclass existing
+abstract or concrete classes.
+
+
+
+@section tutorial Tutorial
+
+The best place to learn about the features and approaches of EO is to look at
+the tutorial.
+
+
+
+@section install Installation
+
+The installation procedure of the package is detailed in the README file in the top-directory of the source-tree.
+
+
+
+@section design Overall Design
+
+For an introduction to the design of EO you can look at the slides from a talk
+at EA 2001 or the corresponding article in Lecture Notes In
+Computer Science 2310, Selected Papers from the 5th European
+Conference on Artificial Evolution.
+*/
+
+
+
+/** @page webpages Related webpages
+
+- EO homepage
+- EO Tutorial.
+- SourceForge project page
+- README
+- NEWS
+*/
+
+
+
+/** @page Related Projects
+
+
    ParadisEO
    
+
+ParadisEO is a project to
+extend EO to make use of dedicated parallel or distributed computing
+environments by Sébastien Cahon.
+*/
+
+
+
+// Local Variables:
+// coding: iso-8859-1
+// mode: C++
+// c-file-style: "Stroustrup"
+// fill-column: 80
+// End:
diff --git a/trunk/paradiseo-eo/doc/latex/Helvetica.ttf b/trunk/paradiseo-eo/doc/latex/Helvetica.ttf
new file mode 100644
index 0000000000000000000000000000000000000000..8051f8a119f13c1cce42c147c8252d69c40d8dff
GIT binary patch
literal 32760
zcmcG$cYIV;8aIBUe)m29`kxMbik2ou#B8Ed*Zy)|Jb<~A$%JwgQiVvoQGUUM2PHw_mye0
z?wC3`hI_#4{RrLu(DW%2C*Qj0svDsxec}D$>2Sb!mA?mGFN4?V(`V0Lysb5jzP|&$
zZ{4i9lO`f_&N_sqWy0$XGp97n>HM&>A41bx;5$dpp161(GgDZB&`dr2e{jyk*;Af4
zb-n^#=fLZ`=FM%KUtsU)hu3g^)G=w{{NU2`C-M=R1+TevQ|C>ay(qH#M}!(m;r0G`
z4O8Ydp8Ti{p+(;yB$yCp*5S>FgZCcg3g8O7$u099no2AJM`WHQ^oNCSXJEPUQ&}~%
z3aKcF_HyqhhT#I;P52z;;p1oqz3|)H&%l<47-r(LQZP7(U4$0>cDT29w4h9lE)N;0wI2l{}(a
z5yxI&kfdWTVB{8f?gC*>kbETKM{sxKiYiyiJIaSDm&+?V%25UEE7xF^pBFNR%wbqz
z#G-3KrtO-_p{pp!w$T{^Il`N`V{keVjXL1tTFE{&B9!w4@sfOs5zDwzwj7o6Wtb@^
zB#1FSB}wwi(9UhHXcSHsFRxVEl?xX-E?iK)M->&7O2=1&hmUUNScI`su9Vm0=UEwZ
zfmy~y1@^B?zASwD44%b^xL@MGzD0mDMCsiPcL*ldZ#=#rm@qfsjZm&X)n>&-n*cl$j5bRN@;otG{pzD=&_
zb=o_>W^1_jkrxGUzPdIur8I?zte8SZnT}YG_};X>>H8^#$Hb0Ama!p`
zo#K`BI>lu$=@h5Y!ke8&D`RsS9mMW5x{2Lo@DRIK@-a5Al)~6t20w3h83Mf7D@k5&
z7>PE7M1#u}b{cI?r_oNrHikipE^Ovo@nN;pXfzlkNkm?k%jrat-DWc@HyL$2&ybst
z>mh^lAw$@xnqyVQ?M7l;5RxA9iVwl}!r&b;$ATb|tz>6&aQAd7NbzX<1?9qx?PWS%
zAXu>O8o}f^DjhJC=2$MQ*K*yX%azyHc6ZT@>A!wph~x2kr!}ppz#1wFSqm7t6xh?4
zkUhktSwoC9WDQLlwfoIMi63z8sI8-L&ruJL+Iwm+b|l^%wRL3TjZq75+2F+Q-FVLy
zJaY@)n;1@)Er~5#5+m`R#7I(sXM)BI?Ci!``Q9iS<)c#kff`=s$826sadB?{(1=iV
zZoIgTnUuSPSrlr_U0S?0)ReoiSjlhg{Njil^9O_Jg*mOA=hd8GT49|~n(fe+1RdFV
zAsN~AC7?;jUJ}a7dq-bl)9Xv}^q~^g*@JH-&m6AiFxQTK$H+6tOZGN91Mf#$agi#4
zd24byZ5+yO#U%%^)B}#TWWA3KzGJu)KDzB-QDcP4uVjhkMbt=Bgo(70TUArG!|4nJ
zg2B?#9zC+M;J+VK9S9~h8qLp_Wl73ID)_Xspwg{GuZmpv#<|K0g(%1HM#SS%)l|V%
zaVxk@9Lu?5Z{DkELcFs5a(z41S*iqGzn~kx{k;rRf4Lo1T!!P9%VC-?gYI0={^A$R
z7H4d&v3qo_ak)0d`FXBBcc_CxC3v
z6^Bc!a41+(TA0zJ3KjI|W{$$!QL8Q2ln)=t*UN}rOSEg1+=6aKquJ5yl`CNnMdLWm
z6?G>WB@U;_tQB=FT4(UpKb7?ul^=UB{Fuqu1r!Ru}vJ<+>SnOj}wvE@w{-lRY7N&tFyilmN_W;UEgOw5M1K7dAN|7xAWYfV4(V3$^+7!~Al{juKEH3Eb
zfays~jo?%s=BJ=XF-#AG3q<^XcyG~@Th|{tvS#%G9P3jv=H|YzFsTn*`!l}yhYppL38#Ut*task+CA;k}Imq4q^+B>;y4y!i1>eXZ
zryVD~_LYk7(6C*vq@67NS1;Nv;1X@>|K+RHon$6&$`3P*`AC!FhvmZ@(O;*5JbB_Bd={{{pJG&|c9_RonKSAP}hO55vQeQM2ZTFOQ=#Nr6$+-`SYro`(B!K^O+~MzLNMG)^&3q&%1R>(;c%D{ssLe3>Y{uEe%&D4nHt;
z<6Xn{?wvGg+p7=;Nk4D+J-i4EEp
zcU+;$2+p$t0x}%O5n`rhtAN+RuU*0T%PoJX9CKpj9T~mSKwlEWPT-%g@%wWfSI^e0
z-+KJzL?A(xdoY|ox9j}+Op>V(QBp9ni1Z4i?F^<@U_#rO@g`#c-297{|9yUI8ZsAV
zMBujo%%)u-?^5fU+ACwp$`fNM&p^a~9{>5o(XH#p{PAkXx$hJIObBpxm6=37gtNQQ
z8g-D2Wyy=Z5-W*%8p`W<850+1wpE8%MsQjTIvvls;M=VhvtlynWgDww1T68K45?Mn
zhHbC#9Fm`f@MVi?;GRXQ*;;g+ESRa
zG22+QZba3(`v#5J)E!bbj2cioTgDy+t6i!F&>WHcEHHC89WTy-yZo8Mb1Fy`Buj2R
zwXihyt-M^`UanjyFGsnTAqKjfpBFYmcmvTcgf(V@6ZLr09=s`0-;N*HMYp>WbKpFC
z5?|oE(P<>1p@$?0@?U@RZR{$aljxXaTTypqy^{5^((5}<<_eLt+6UV}Nd*fD8M`nZF%Te9)
z$UKHr;z~kr8X_KU9(=&f&byD^*@d|B70Rt_hcT`PlU)?D_a<4m_0S8aUWuL!23H`?JBQ;L4gZQUevMEG|mS%)%i7vfdnyV_))}kesRziBM^J3
zL0jx$1`}pGvyUOnLWCjM1-*pNNz6Bhd;@a58&1wPFM<1qn511v>Jp7Q<6x<%PDP`3
zT!8WJ&56-&?(e_AHxM)e;&n6E2Kt(U4z=(>x8iHT??2a66Dj@P3&Dy2Ud7OP?bOX|lKP*U)j84;^OJ*HWSq^0Wk5i{T4vGCyho9o`+
z`N19cAKkrd+3wwUE*lgl?_(DCdT~N?qVrrLk$7$Iwj=n7#KS*a!qaix_cPYex%d(W
z=qikjgc{W#LvyB?>8nRI;MfFj7gY{Yl2Du?sV47{kQ9K$-GaIq42qd+DTy5$7{%sHc
zC3il%^rmHjmj=8ufnHxZ%(o7%&yT)Vi+gfC`QzLx{Bhlz!rMOGKz)t=HsehFWaARc
z66-yd6PAmfi{48f{VVbjEAc8mB}MTo{O>w1AstMx09lIrnGioo;l_&heB&m;Ie
zAajDp#~Azy1o6#PW^8W7u0sYt1nmA+a$GfGqL&(-@5A-b`NYS`N)$v2#MgTBp$amA
z%q1%bOOBCrh|xA3NKPn?yP{M`sr4$aXzxe{&YJPM?pkRK2HJIfmP--DwGCl=C{h9=
za@|o0OWGqt>6^d;iKU&!2p1oPY1$-sO|p?tJ~?
z)R_-HzTSG~)9?0<-gDxabrbVpBu93B#X4Xlqv(A#lQTFB{S0diY(MiT^Fl9kt7Dc@
zXPfL;V7SA!#<1RYkM~)F#043e2FVnrVRbmopa;|OOtT7Kb{xA<7BWB@qu1M67tMIw
zWV)Je_xm{3pJlK#P6*Bol3C4Lws8bg9clyrrY5N0Gt&krd8
zucK=O5$DL3z?PXS_C2+{V2I5kH@2>+o3X*x68i3?#qZ3VI{B{6iElo7wG-d%dSvbX
zyO!;=JxLZXpLEx%Rl!4VPCGbx!sFfjFK=v1{P-29FW_CQ0`Y`|4Cu02Y#FVeu76a&
zTmQD68^R1RJj5~C#S@;Ng
zM`Bya)FT`xsVRX%36e(Dpi@)R3Uy7PBHd;aSj#rmV6YV;qL3hA$RT4Z-k^=#-{YWc
z(J0^@%2$w>gT6uTb_LRNI%2UH1p90^L$THi66Y(}dMa!Qat)oPUdcGb88A{(PgwPU;8X8|=mVq)?8
zR5n3*)il=cGngkRG#%cgunNebOOrzvMlQugT$_WI6SxSO@D`Bb(u2lB|4SYN|0$2Z
zN+flWG3q-3w4&s!TG`h-)dov?<3&@
zhgk;--I5VZ3x=p>n=}2Yq1r$|l)U);33Tj0iAB!u4N1Nhrg2$K(m8x?KrAjVV_
zKo>UWNK|?KIHpP!&I!)B&J|A9*-Fxzqg~#t{kraUsjjB7xpC^)v|*tttAoH3bQMe*
zwQm-?jb;wWtdzj$II!(EqsClqcI6D5IkNYN+ez;e(^@(fon7_k#DypB`DX9u9VJy8
zhc-O()Y2t;*x|;yyvn?rzW>vt+Qh&AxW4^PJQy#-yIxL8xrk<
zi%mzFyZ&_#`^(-9TN0MU)z;7U;_vXAk5lY-ILxveX4#3-08{=_Eh%!~EXP2{z{pqn
zZ}T`Y4=+c{@iKP4P%k&=7Z{c}??vnJ26m0GQeLHBW4O=xuK5kCB^9RopfBj5n_w`P
zZn^~layqa2vx0i$cOkvk-+f1S+}#rL^IWFiV(>S*l^>ba)7
z_Ur<^qE?EIxF7WDcWPmoXNW^h8|xUAHkFy>nC+RCw#2jCzrk~_|53+o&k4_Wj<14O
zg4SM+CmnkoOj*`so@7w-l?G$$3I+LKroYNKf!Zn`=oE+FuTH923$;*zV>pIn&@%IX
zS*IMTdo5J;%r}PCteS~=^K}*b)j?7nyJ3v3s~C#Ym|e3yH<6;k460nP1-#7xi5Lwc
zBbfTiF6?FAUdOVD!e}-=9gY!3LiWC`r{j@h7kndJzm2`Kz?9Q*D8WUUO3#9&e?oH!MdXZD49npT71yqz@#SH)-E(
zM61=@M)_{}LHTL4ijz}d^e`%yNMLHz?MbgQVQAf|IE9ZI6$jUE(FRfP7xN=sz
zjFo`W@w#$WDwWH)T(*KGK^C(+P1i4}98xR|8Ku{zbR+>ZF!kC+BIRwW(x{>S`i0&|
zx=wecUDvPrdh!MLI}iPZ?a97|cr-@UZ(^DtyykdDAlz{>1`aZ0%t4~^$8a?S1l3@C
zU%)Q}S>h4caxLUupzFf*%Bht>?p#l0JN&pjU02nW5f@>*i0$*3Q`ZsW^g=abs`EgILr`Tm}U7e7{Kl14CJ`4aL6NKw~)+qFC^2!
zcs=Bs03~X}0JRgXbVBo8SlF^_rOaD&VaD(3cx)H7w*PU*O=J@b@c@Q+h|oKRY82ct
zr-JvbMqKia`4<2*Dd&+#2m+qob;n=D;eN|2+vzR;k2@A|5&U7c=d~gRU+ZK}k(G&w
z&A0-WHz%gjyB-5JUk^E_AElyIYA)!nmn`!v^OD;=Q@muRexi|#fn)U;4)s5~GA%2QK=<)M%tjrY%y#yjiMmGMDH8S2umBd!|WN;7i6
z%t1BF;kvaz;ewgY4wOLR;Qj#o(I9K8oKy{yaVks0R3p(*vB#fazau~Wc6W_6vYydrZ!ep%ee)xZ)91c>uJ)<fZ5zfL9F*_xaRpcp-
z^$Cx3)ufCKjm#Q3ux8{G*Oc(otc9K>DGlkXU8_7BQtl0{jkt|UwGlDHsl${^8F_NG
zOk|zoIJpJ&L4(QhmOf>S6rf>Q84gD0MM?A+u0$E+_~G1J(oKLrwvxM5lTv*XO1JDV
zrROR0w6eu+sD?b*Qc;?n4xblM8hH}%>>^y`9z7}v2toCt15yL9fOGQotnbT}iQ}sF0+mrLs^Xu&@Qe^pXN2X46u0
zFvTuQEGX22rI45wqh&-e^*>!xWhCr9y>||)*)`+oe>RMIGM3uB*`JkCG_qm!3yHm_
zze_Ct@I(CIkC?}|k3LlJQ)16QzDV4Y_^Horlb7IEvHBCfw_)PDhd=2z!e&S~?z*jX
zS^X_*C#v;z>eGYAPXA=(c3iPzZ2Yl~i5pDbj9%5)u<3c6`qF2KY2W>rcyjmtJ7=6*
z(Qt9g%b#8T9Gh_P)Z2ScCBFFcJJ}g-Jmj8jeO8^Cx^8Rl&3^!i?*x7WSHm3xEjJ>R
z2A~L(*`UD2L;xLQNWpt#^ye>hJht;w{EtWar}_%GW54vrClY+*s
z=3Dp%vle5nRI6FGf7-~jscDVkDv_VzS-{N`!TfS}%Y24IWLz29en*NZS}p$U?5r#V
z#e9NE!0$IB!4=_e3rF;xoD_dhGi32-&v6>?0Ra+dHq@lR#?nL?76__AbpY@))5}r;?r$ZLU8fqSPFuZcRMV>)5)a~DD@z9r
z?tj;liO=xt@sU1b%5K}TA+eV`R	_~!~TPBcwBP@B)(YIaPm95^@Y>JFX0bY}ls
z?*NJgMpHY#<`#nGNI|V??Ico{0)DH9VG`K2`6*3kRmx`cDE9*Mtl=orVtCVV7F|gB
zSBlwaNinCSFxh;jIolTu3^0tejk1q)Pv>T)EVbNgd6ap?_^59eeunHae`vHK8}cYN
z#lun<>|kaLQ=gxa8B>6}!FsKJJ>&JWq7pF;LXjX8-#r0mBq(6P?VkjLs9})Q9ni`i
z4F)ROla?kLg>oyXK?8R3AlvCMI+pYT5Ns%rfytqw4`N-+ww&yhcQoi|AmnJAFjTN=lt;^9&zCOsct(Scq;M3{l^pEu0H{G^+}Mj
zF(4x*7@t*YBpASbgyh7V6~74yaG?-IdIBj**S!0Gop-q6Unf034~mGzj8`Y{0w=Hn
z%e!437vW_|FBv4zTZheIbuhe_afYzP2rHN13t@+34nc_taO-UNfzlEc5~u+>AfX^2
zBH>Vv;v|#;*+%F|{PPQA?yQ;LICRPVr&lMSlyv{I`TZ&%o;7rD;$7~TJ!Q!4i8HT1
zpGfSU*kf;Te!p*@`|97>K)k`|DbR&);67zER<-k-Ul4RU;IU8%mqfpe1jww~RG(rg
z)ZNAm3Q9o(kvs-g?7C}x&#}pgqBI0;sxDuM{=Ij?_xf`c9HDwsHSHv+uJb}&N&-&;3()o7=5Dl^V+<2Qk#Lt3s!7l($i7M
z;v``NLxFjx-^f4$Az~cK2&aP|hil2G1%#rZDFbJuM1m5Q+>uFLgHhRDsl=~P@(2(J
zKH3T2FS%W%w
zmCA)f*e8RG*vzo}xT;s+(pJJ%G3cQ~m>>vE
z;dITVy)>M+xu7t)?Ut9^W@aU~X&Oi3ws^hE&8CO9P})%o^rnMz>JDq2E?Opva?4K(XxP|)i<-wdyXt}RQqDWO8xwl!NE^!OKQ
zFE^Yi9PTBEZg(#p@+?UdB#vR(ASc-XLIk2zP{-RqhMeYt)xsf
z0dT*A+t0Oe=Yc3PNTA2$JRJ_|nsobh41{WH00a&O;U?qyp1WXEbK<>Uc?0{WIjHfp$TVg`0Eyk+07`^dBVc4}NameJi)KK-t^$l@U4?;r)
z1&2f&!aDQTljIYu>v)9R)rmT;Tmp&DA|H3WbZr~?>bnHc9<|wHvtjl)RG{iH0WIW^
zK(oPC^1N!)5fEPO{`udyudm`s3!W6pkR8tQM-a?^?S=2#h7fOp?^Eysbp;|O!A86S
zyHLMI|CXK+^#k<-O-vRWHslybGh^9>hQ-FU20b45InCEr8g_w-SJdVJ`5&^K}JWhaJL4T|1R;*$|1j?$E4F;o8L4rtXEln0;IYxE?
z$eDkT3qox=UzPNt6jb#qpmuwVj0Dn#4DXOuEUO{_JVDbu1w$cZ5rpC4ijIBVxg6RZMBmojMMi7BCE9wN62?Dkd
z56ULIW49$+F-HL*Ow1lVK*hYn*zIb
zy8F|C8#>daeVS9O0d>LDF<|rKZ!+ZAo7WOBJS*81Ff>h9n;_Dg1Tnzp+y{_Nc+m>A
z)?>mp#b)z5ywJVLZa>3V{IY0|P(F&M2{=`P
z0ImgG1_GHhnuOQk;#0W)3oVJmubfF7+w~Ss`S>&Jz2n>a|B(2Yyn|=sCr&1w{nM9;
z9f#h+V}6(Tcj62##NK8sKbW{ku>y!`*$&WM18^KhsYO%FGi_wBGT1g&8Ea!@y&qH%
zIbAgLLxLqDc!C}be;${i%SO0=wGl&=`Zy#vH=?bi8}7_K)ZLKB(8`q-p^~fz
zDrY@V^L^s%n6#FOzM`KuE5aL0_6DTiktPjqy=$lwht#@%g)@)0nXHgey?oY+w&
zwx|zGh-{A#x2wcXWFH%#0h29YOXIV-Zq8_=Cs*z)iwxn0I0r`J+=#T%k-6MbW(l`}
z*}!cFSNJrV05;t6IqWs~es1k_4)XZ@!*0K!hiLCbQw
zLPTc_nG2M+HAD`w9>CXPg<>iw@L5)fg!FSuYXG<)BbPEfcsmaDOJ
zk}OeL5d))kBZ`YAYl@PfnqnrU%xozGr(J{VH6w2XH}7%B%wXm$uozWeOaYg#qy}KQ
zVYk3mT?Yav-P4-J02MS6)$}M?H4p71>tBC&$vf{?W{w!rdHLjsIitFT2LBoFT)lPZ
z!%rvjxMNjs-SPNGDdF^?3xJ-JziLCNtm|076qMXCV7kVO7zb5=zd^>6hZ5@JlbA_t
zBQu|6!x=?P%-4q*s2h^fFVHu=f5vd8MmH{HROUTaW2PaJPSTl-aIvW{t#7zr?wH`n
zv=QN1a-CtOajI>K>kfH|VTozEvLL-NyoOmX-(y&Bx=&f1es}l*!&cK)yFZ+6G{{^C
z@@KE0<5`CAIGmme#~{t~cH0Ctrrm+MDL9C$aV?$)tTi5@-2G~}o8RwXIDa?M8}SSh
zBPa`Jd3uB*794?6AhoFZH&QN&ll=!)Knv=yT&8p?zzrbd>VjOf5&|u(6D<^`_9q;1W+M8GVX|B!duJd?ipS^u4iJ_uo=_t{O3bY|Gb7fX4<=Z
z|ISz`{&aNHk~LSKcr)>@NASnWocl)I+}O9@v^3|$Xvx!4=Ds?4#=9$x_ikJ{wyL0D
zW@gVr3m2Seoc}G{19Vid$3UBOs0xT;#1F#*$u7^aP@`&W)1AQ6>|X
za`k!oTKzr3J>q74oBons4(hA*fXK@N;22_1;B1g_LhcnLoQ)7p#Dx1cC_yYaMZi-C
z#N9yH$c$ABxJlS7z-tVB7DUaAO(1v^*$y=Wdc+*$syUJe@#AJlDlTyx#E|Qnxh%(m2ruvEV^ul3F|eaZt1XF!qmw5K6ap
zeh={?{Lqjw6Fyd~g^WNa(Xxs-1cC7oK%QCzSb$0Ij<^1Zmv;}OcEcOq=z#3;>c>s<
z7B6PAv@8;6f4YU#PU8(~-z*d{XIUby7%Dc$EXA&YXn=X3Wq@lm8f6}B8Rb&83ENBr
zI+!>DJxq|n$$GsAZA>P;&1$jGJ|-75b`hRoSn@mB)Y*U~sO4JK3J7+R0AXl7S&oM5=1j(!*09lW?EEcFv
z2p*@?qx2T>Fcd_3SleMyp^!4{aF7CpZg(rb_du7;_P8rMAYSkAxI0`!`%UTl)eXyi
zJz}S38`Phg0BwP&wDPynJDr+eV|lRKlow)dds~>7Ac&1`2u>Mr^=YcrR5J#`
zd|SyVH4BWS8#`o@Wy!LZ;u5A*C>2W$WyT^)iB+;#X*zD9D`Qs<4on#>C;x43uD%5y
zV71Jht`^}%GKsKRx=cCS7_k(yWkQ)uzws8~Ha0GdlgAiuvrNNN*g9dRJi|D}vVdJ8
zQ0K77vdFrIU9Vd&ZDCu5BbGPVw}p?{PlQj6A6dR;zY)GMer3s_opT}vyT>rHqF7DP
z@q-n`09|xeNa#gkkQu#Ik}}cXevtue*$@N<9KSYU=WZ=hSqS8|?XhL*-lN2T`Y5+5s%{l~
ziUYV~m<9(fZw!K?FCf0OCN}_!d~?_fAb~eVyTK0nXnxqH27ECq1QHA^2BX7SZnZd^
zfR?}>!@?dUcwea9A&^Y9#AJO+s24^lp>kQGdxY-ktxh;*b;2>aM_}*zH6^z4fOEvTp-g;#e}
zUi+EI-HNLH2~4Gx@3P~1TzD8DC5G(@H}`e3#Yy3xuT>-Lux?l}bOmpH((KX@qfgZS
zu)}7;$^ybDWJ|e5b~>KUPnW;oSt>rfpc8pszYZcH&sr^565X>8V?6ASuB_Du9
zQXUAzhI9jVhayG5OQRtN7#tv_31Ij+YF_BhS|eBy1y+OiJHb@=z%aB3dQs0F>%0uK
zu*({U2y6rhhsIA6HRK3H0tDcT18xcl)g)&I)*MPwvF7Rd`N3=9U6
zki-g-6ahdkQ^G$3vK_=Mn08jmlzoMmu3&~fX@)Ia*e9x$9)*A5{5qb>A@(JBYPFscW-xpEEED_JiCcAqAK
z)PaIm1q%(vSTo4D0W2wiVW2yzNK!*F>84Rk>)yl+;)0Q(oQ?p?L@`k~K8kb}kPIFF63d0P
zfa^u!iRsB`3&`+Y-Ga#rg?VCW{Ne9O$
zBQXQFXm?Sl`dBWi;}wQP5w`FghsjGU6V{;@#m8v-lt$CwJ*sC7|G5*CuTqp`!^US4F?8LYuBR`LU=?<{F6Ep6*
zi;jK`y9d9=orM3Xg|@R&r@N4-CUYT0u$tio1)@}s!(CX7s~Ms)Ku!V6fUpAW{I#&t
zN`@cAYk&(@+f3YS{ZX8&QNJ%I>ygmAptk<1
znWzM(s2fFtnC&)rva<}?*?@)GOT1;-1GD3Xcy^s(Ms{u9dc&HmM;(uOb{p)^x%Xrq
zb|24t-F+tWkM_?qg}x3Pa0Xn_ob19F8_OBU-jXv?sEJM$W<(e2*8(f|XT#4?b4ekT
z`jy=DLT8VV%{3uwZWhV%TqoVqPPzA%aD5b
z7&&XAG7*JC>8)g}s${5?)*OuFMfOFwNPbN7H-4bX#oA(IM-0cDVOMHy`YZeyo&@*`
zp78ml00IJZPKypv+I>~taq%L>Gk{H+q&UO7_23<;gM^Y+lFsYkE;v@A%%;`<(ToKog<0=CC10)at
zdV%j|-@L%)0AFS;ca#IAZipu?#0{fOamRR1oiNKV-89EB$I}-0RDaHS&ixnb-<^MV
z|25@&pflhOa=E5lTOLvNNE?P+c?aH)FJU$Ste`5)V7GrjNfOL}Dic&7Dc1{zJ_#*VXw-wG
zi>Yrw_0XtLU>pIxx<
zMW{3UxT$K>JB^7S5+6N*x4tss-qWYfzHu5fuDbIZrX8f-gHEdhL_H4p`dIrohg*j`
zYpu1;$H-&MqlRacXFPhr;Fjvh45p4-pr2=GGCZe0Bp#Ly>Gck%CH$2z#?%R>xuz8+
z#suX2J?cQ(5?qaHfu2C^=6R^FiO6JvW-Hd>lXWg1EBj2?lx|G*!d0Zp(EwOj$P@
    l4D1v*qT
z^1)6D0{|AAWZWc~21!|D$`7Rc@Y1=&zZ<^2XYZc^``jzWtlRUSF6%k3zKihDcMVqy7Jw5U>tiU6Pdm7)Y<
zrjd=hM2jh%^7@Jo7u0=lckR~P=8oWt3l=`RYw6;hYo6S2_37=HSwE~dF+%Cq^6opY
zzH#o|*I~>CgEsm>vg|NsU#OD<$Y&=bm^c>~N61r{ncQ4)iYzElm{LfFbMO;DDn*N!O|A*@eFuvMybW
zR(4zf&>Y-feN@9kI=Wc)fL5@t2VP53*pl$SO&8KY5**T)Ao
zGyOU06|LZ&n!uwwQM2l|iP+@Mb?3REY0mwa{&B-@gWxe_8uq)}+^n14U8W~cm?9V$
zy~!tGJBiw?EW;ydJM=hqT2D{mjDtqbyHI{cCUEaBV8c(9MZq
z%y%F|lmmT9t(9fYmLrF4L*#xoUQBVPKT_F(hMi&W;>iai}<}BB#IHKh!Vlw$N=^Gjx+eld@`ansUx%d=vUU?S~Ar)4|(Y
z$$^$kpH-(>FeM03AGKdis0|)%K&5NB+MDzFOj5s8pI&m<3&I6b*yTFw#EMgO);gP@
z`(VBahf!)E{T0(0)0d`B6B{s9n5w`kx}!PsLsTIlOO4mlh=iJX3IbjM0I;2UUE0WT
zA=#1(bg6o1Vb_d%Nii)QP|_3_ekVkINhZK=x#&~($vyhaU%t*|#0&R-c4^Lg_nlbs
z+?3CD{O-F)o?E_b*WM+Ica8Q83-_2jrey!Uxcu{N7;o6tbgk~EGmBqfvfpca<=xlb
zcnxNMEl~X_yU2zP9EFBNXzsB)3&U&?(~mi3V6`r+bcn;8f?032F&xnFeVon))Tpqi
z78DnDint9}Rzo#l(pgwsxZiQfLFPGjIQBa_9jt@c!pUl+9X@;s&If4GS?~=k8fqT^
zLqj8yuDWCt28nhdQcDGfil%3pxEXn)E^OrWUThFR(BSC<(8y08#GuvLsb|D?sI*cp
zEA(`m*S6f*w(zCFEemE=-&YQ9@ShLFpLx7v0@=BC>F|xqJC1{ltpgQ&9v8edUM(#78f!@I7frG@?5nKM`I
zY~<=WQ2x%Rpa;54yG9FoM6HAjhwI4}aBDcuDR7*Q1uipZMc5z{09K&KRMye!l6jra
zY}yQZ54Z|+e1#=xvy20Bg8ZtmlH!(v-VYCC
zzkTn$pO-#j9QXh`?&^-$D<@Oy2IJ5C1otN6cU6y$AIXmq8I$2(+!dY~!7P%9g%4Ua
zAmLK8C4&MBms((J0agYa2x$k@Rd9r70Ziaa!~rlmd^c&dw1`z?Cr8XwVx
zg&1EdRv4-bHEaz(T2~`3XYb%15#Qkd$bQ6M;J?-VoBvs`TO?quFf5@I7GSVQ93Y+H
zByk1EEa4=XMS_`U1t`2~PmmI189}QYHXY$q!$koxPaNwBmOssi^6bt_1uX`38uUCC!4zzhiGjJ5`uq3N_F=A^_#
z0b1oKIptsq<*0mcFsN+~gp#xrXrO~aWIYtvHSmfDOe&<6@(()b=8J=h#%zI&_DZj9
z4#>%W1}F)#b9ySv=PVX%4mg|5R<5n!Tvrad=s*AcfH(PZU`tUvq+X-F0REH)w3l@)
zc+a0CV?dh+6jI)h(U=a-5ZV~4xAD^lSLzY6&5A8dHKn0
z@+nMhY8b4N38)dq$dHzlpjz)dL=AJHl-chC-fr
z!|Jd%bP~Lrrj=9^>l-K@p&69BAw$=&d9aLp1Uyk1dgCZ`?|!28mJMJTFR&NHKRYi5
zxevK3LE;pGX`;&;1Xwf8@8j)08B`GSX+Tnu&W7>k@QyGEgDx7wo3-ZN_#sz#Gd#AS
z6~|R5)E1ye2!JCj4P@fErxssMK
zKx}@)Ry0C2AY#*-z1U)~UpJRDYN2;$r!E44#@M9jR=i%pWHYrrTm6O>1jX}jiPfRaz0OxJ*|eQLqy
zwL7a7sU>^nEsf8!k%#y7n^)Omc}F8zGiP@12j1Urk$*mv2
z-y)3UYlLb13_&PV$}DA$B3D0Uuw}5LpKBa9PP|o#TjGveU9-8_;$&sEWwv9oYY{Zn
z@SI^Ra~pS?G*&;0nZiwxX6YrTkJXt$>JaO3Ll|@Mo_+|5CUHqs%Sd|y+Cz=9WA#4eW2L^Rey0fH(b1(yIo{K$E{j_By^8z
zk?(I~k-pE|^ZU=RW9i@S{W8&h^x)bx2b))~JxHuLW8=capF2+f?Jn%chIdcB``+(Q
zy#uFS3ph~-#>E0r-Wl~-z0ytTr3_Zsis1er2?VqBX(>JIJyLE?nHSs~6v~`s-a*bm
z-Wp-7ew=fh7fKiU8Om(uOmAE8ecR`*&pq$^FW4^l&j&k$jx;u^MD0avnF7^OWsGuB
z{#!~yks7=Jpk!C*2o9{m9Imj
zLM2LTrPpX5sNUM8WV9@;^}1!4ncuV!u6?HLf$8hc)-CvQ>6lI3&Ce}d{KE6|8xJIA
za4)YPHf%%Zwx<(U?;TRsag}-I^y{ZSJoV1UFkZJLW-#YrycFbvzQAoViIQwrPcoR?
zq30{?74E_A&Hf#JuFzWOt?>7?_Vq$C@110wTM&1VL6f!!E1&C&yCajoLQ?04V#G2-t
z|3}uD;{T60HyPw!rV-D7jSsY0!c!NtBwfo5AhP|Blrty$;SnzPFpEnM(4fWJb|q0phJ+mX2YxsAW{VfLOr{o0!!eDo%bCRRhZ^ahNM8Qrb+%(Y^L
z#c6CI+lL*_PG#q_yl56gK{Qy+q5;A4Ut~=TkR)bqhCYVWpcPw5s`>vIrCJ7b;Su01
z0ByM3K>6!*(rNpd7AiqE9(^7eg&`U!`!8u^lX(vixXr7dx@ktm*zq^rd~?t7Ha{EL
zS$|8}^BDswY8yH}px0jkNW%fR{yhAtx|B_|rIv|<#J=exQ>UaZ6E}*h(x0=wkaLnT
zh)$2onKwA+BPZu2BM4D?V97O37$=UC#>wOK;|z5|omeN;$#wcVLrbJ3!$esV=~>0;
zW272+a%6Jm{IvN%s(Da)T>n7k!#P{>o{@IzpU!wDvpMqnh$97}0@dP=jS(`!dWrP}
zBX(Bqp5mbywlCnWa96n}xc9lwxOtO1;GXOL(#;0ko7}{G9Kc^Y%)uU2Q798s!Dk^#
z(hyoOKFu~qq1II5H^M^^arbd4vreVW5x
zj&{LC^?(-vIjg=w1KJwsQyk#03*v<6R?X<C-hsFWBU#o~@M^~<-SqdOiKnc6iik|^b
zjDx(6HirBclLhER^s#YNJt7qcP4_Hawzw$#;2V!r^)Ai6fB5p3$C&r)8)q!5b2xIn
zt6q6{$qD>(tIgaDZQZgvTBb$^|ppY3X
zVLk5D3H`)=wYqu0&E5=6ir`~*07<(|cUH&ij*&VbF%%zwAeVYy?Eyhhbh|*U002+)
zDUC4Z1;CV};Z`&nb|$eWiWHbjKxfj-T5~l~JVVNFpOv#}Rr8@k)@Y`G=XT|$DNm6}
z8?bIx;=TsBmr(IIBEVja^6{ibUhaOuU
zGN2)5xE)mB2)mqGh~dO-PV5{Ced$myp&^Fnl84Om?C|XObb441mN0o(#b_`YC{u%W6+w)_>b=Myn3Ks9Gz=vR
z%v~TH^#0KV3fN57$^T5nvJb~UU8Tq^vU$$1VHzk#iThIV$Bpyj>gwf(uJeAB4W{8Us
z&<@BQ!eViev=*u|YnXd<>xA{<6KI=wzw{z{N_rU`(H)T9M!%QNp%10MqrXa5(Pb$I
zngS#ja!8qoHc!LzekGApEsjD?g+NgPic46OY@#Rucm?^C#$Dl{lYsUW&@!NajN{?AE{UZbG!p60v=cUg*eS`;SXZMWb$R!
zGOu45CSc7eq5oIzAY=y`u}9;D03igwl$iCq3t=ev{QYQR4jbuMHEr%~3&}c~y(cT@
zM_@)QzMYjbWUCZ*a
zC>sTfg5VjgI-lT`Qy_Q?>#~KYu@DvM%7mWAzRUn#)l~|Eg16@Myz!+vA>+H#ryMf6!1jclajpb9Sl-AGb^%h}pF7&t~2;1&&3r%EPc@HMjz
z8a>PwOBA3X04I!+ULQ6XZO{xLm`$drBtVH@pbVt0S%eOAorM)lX1&oMnI(8u4e&u|
zUmKlP3$Q?qNU~i~445_-H5nK~D}Ek$A5{{bE3Kfle=8%`4!+1oV}xaJW{>
z2cc^KKYs{cv0edN1a84y36Bk8A*QEa_Q7FG4CTNAxWNG{P2y{k8L-yBK*>)U>B;KUm`_Xwg9j&$
zAKP8Q7VJK{y{OmWeTkOiyR$w9p?~ax`5iK+W810IWa`y(WZ9u>XF&Q*V2}O*(y!n}
zM@$xMf^t7aDpcql7-QPXZWW*f)zrqd@ol+q?-<`z&M_Z~?-@Q*E=m>)RI!tkBwo}=NhY8i11HI3GAK6)
zNs7e7b3-KM4fKXcl&7#!8Z^EZ8#8aHl?1GEL;gJ5^wsc#o)j
zHQxjzl~&S6H3peGNop0`=s@$bWOR5rXPdDs*i`5rhQMPy#Do-ERub7PHePOf!NzT4yzx*{ir4B*9pjzexJIkj
z%9mPSz(J%j)_gdL<&!@LgGZ;=nxw^fy&5D^=fo==@ewJ1);v;<{Yiu|nxk#O;DI%q
z^XoCKM6HT5N12wt|1nD_mHRLoViD4Yb4Qrmh>8~Lc2a=o!n&QPV+;#Iz^q+QM32lw
zk9-ctj?O@m?2PE(7y4r=4%JlE#NyZYhV6@C*SUQZ*+W3Q^Djd3#X2+eB4r0kh3}|S1mgK
zz@}|mHuKeAy!uRYaK5PLBJ|UfsOLm>mp1{5tbS_dR#p)e?|K7g0yCzv2FwjG=Dh5^
z3YKDC6jN@2XhG}@*2-JWGh*ggx>+ahG=KsH&E8qllUR`zk~3T&Q)XP^R2PnYOieFLr{a>5c)LqW!FZR92d!N@m}5_l
z*TAjNe^6Cf$I`IX2h9~YxGa`GFqxGkyzy}8#jcsv1JUl7E842v3#;vYzBucm#cP+V
z=BB0g>Sd+g&MdC=%;GEfoIy5wTIV%aT4MLN-#Y%efAz+)Nzb1;?($Xcw`8n*i1iJ2
z2nirMh8+^23tyoM=<;M+y-=`bc$o7GIy_0k%i_bT(5NHc4#jo{#DVaQ0HIeD%QVTy
z_Crs}t)Fg1Smh|m4YDM+3B8~nji3yRA?htmH+tm=N)p}RBX12X8ATa5=D-p(eAFP(
zm5}1lw8Vsi*6doFt1z|J>M|DA79C`2t??jrurL~Pf9ZozYbw(4Wr>P5h(;(^+@d8a
zc2{MIrX@nC4XRj-9(=MuNP6I9QK~e?5eP}bi=s7;@eN-o&=^Z7FtEg6y0k#~ibr|J
zj`87X3wp1##O-gt?ems(+g(+MP91l*Oxtfs?|W!`?~V?Xz#?9zE>t#Q{dR#D1FV{!
z6PKE&M#*PotdFWm5lUyEyH)5&
z!RxqqNkVbsT=O)s=q%rFDy!1Oz%>bAT(s(``rB{v`<+cYE4{bPtH1WcIo|cW?DZR*
zQ**7e>rU2J+E!JG+QtGynD(YWUb!@>{$qT70tBK*-YYB-rvAI0BC%s;`ZYA~<1+=|
z7e1svQ^WXdYBAd*k3^1`emy~#juI_1PLOyFqKJadPtg)}fYJanOu2NuVIc*ebGC~=
zL0beUx#U%!q7C4G0{2ZYj|#uwUjTR;P!CuL$OZ`7EI
z?X=FYFmfL8?J>MU*8m=Z{Soy&I$*4!YjOV={Jns4!&QO@VeK(KL3=^}4&0Z6_7Kbf
z?jMG|8~!Fw*keq0Qx<4303+zd2xliigxC3!?z-$GygC_-M
zGvH443f;wCi97;#m~3ffp9B}k@KsNPNhXt8+jjonKWcLU%wQG5V^6O{3I1xvV!
zDDfIZXN0cj4x;48h^)UPO4W$cx`@(2&w#(oV?{n_(K(g;4$_H=$E@-uRm#6^#T?GK0sBkUdM?}Rp5tZDF{ZW{ua4SQa%eO*Zz6EeQ
zQ3b-Bf;>z^8miHVYY;~5eSnXM>JWb&!m6(ZpbYBI5H&o3Vtk9JNhN9qy#?vloRHCrd2CEJp~Vz#@cl5+RgRt;8aPa_WZb6!5$W
zoHYI^aI(Y&aGfU8GY!7pguPZ`k+v$yUnS$JA`4=vk}+0MF5<1CJc&gJRa7DQeUj2D
zaht?55pNaEllBGDzEIi&(%vP*>;|quEIwcn3l4)ydoFlt5R1SfmKy8@3EU=mW+KKK
zge>?)$mp>Wi=5UXwB5iK@YEtSVb7KJJc$b=k5A$@Ntub-szqpme}TjSiMt~oL5Hy@
zw|ZG_^$61kyC}VSgt;3yFLE=mNMXH9VLehPctqao5vH)um#&@C9+19*z%%frlQ(IB
zOzi@h&LHf46okDGI?qHdx+J|@(z_*HjLOR>09^;-$FZZ4PH2sM2;Yi|{){wxVnD{z
z9Hi(t&LOFRvtg1&g)JU!5K{1<#9|jIYUel~Zkw>HpqDgl=jF
zP(QSAuAzCd6C{`C_D3!pIV`1tqrwt6}8h$nuXGv10l@0$lrYG
zMExwp$QnScbkWu5@QY~)^tp$q$1rK_rZsCUYuBy4wr9iY{v
zk>R(I|3;~H)3@jWdYj!Ba|orkh{E99k9yyyELK@$W#n_Dz(Lm|4Jyj;b@n2}@@Jxj
zyw5V(7NrHDJQ~p>{|PP|%CL|2(NXC9o6a4E?#Qgj>!{^2x&fg+K*Mwx*BCudzi07=
zbCJiO`a26XI|KO{r8n4%%J}(h!kLVTp1#_~O_&P(pp#rMRZ;G5m
z`?&%&xQKoTpZ~)?;ahRtqWnZ{jWna3ZKrRF(xxBNJ1m=(L$Y`wFNQ+!hm;Lyk)`l^
z1+749-vNyvuh3hVIv(cn{DktT`lR}WF?alQBoQ^@rUz+1y~GlbQ;iL#K*s0$Bxe#-o!ikYJOJf
zQ`RfbtIfDD*HLeS$kI;ZnehO$K>pYGCy|QC9cZ0fXd6=hE$BNKMLRh`zr*!5y~_+N
z4&suDNQr|jU^nC1%I;>5umkLIHi}q&!QN#bu)nd7*%urg6^9#erkv;Fa`FxQdVW9u
z4%A1U;J@I1;h!lPO1|PzAcn34m32tfoyxtq4k_=b+3E>3f^x1f?14zh0mGAqmksBP
z@upj$p62KOeDr+D`M1Vt{I2mmB?fISJ|lCsO(X6<>$&Dly{YXDF4J2QDdQJAzyW?9(B69
zRNbULq`t4dZ|FAs%vuJ@A
zf9$lf4FZ3M=pH^r&EjwHH_)D!(h6l3M@!`g*j@Y^Y?K!mZZOvIIyRfmscw|@PjE!<
zAG}VP1#QRkX%)XB8lW*%#jFK0;N$q7#WCdV4TOAyF`jMZXN~bR%;Y?q{aBf-dX%5h
z@0GV9S@$r#sp3#2`;h-o=|C%ZUTrW0$f10P4l3)RY4{NLW48B&c^BI8Y=$`}b+QWf
zse;#hJ{zs5N_h`bMXUL5=|lA6yXf0&g}RdN!IzJ=(EIcQ^onA`T4RYZjs2A4lnR6s
zMv1GBBX>1W&!QMo>2|hQ*=Ibm%Ff
zMngdTC0mKt&V}SsPh)i3qEx63n73e5>Bg9L7`^)_#(^ef7ATo$IWy5N7GQ+fhifm!
z2^B4y9%874$YpIYs<;b65lw%31EEWBoSXZ!S0ASnvP>)RO)xOhBVzB(xI)at*uPl
zJ9|Lrxr7kXHIP~_=g~FcuLn+-aeBdd%~v?RQBLngPG-^SslKdK^E);Db)QokV_kCt
zu;1--1~vUdX`dzS_ey&L><$M!X#UJTpQf{r=GR*{_YL|(zOqs_6c^j#Z0U_HE2W{>
zI9TIg(=(jc4Y7;{CM`U}Ups^&f(gi?p6&Gc^(-g6A{fQx?^&UD%nkT`ISxm#tW;+$
z%bm+~ayIKp9?3#2G8*03qMKwiTEC9m&`xcr^u@tlV-{K#^2D!juIT9w=t>X5@axGQ
z#Ou>DZu(>9m$wMq+7h_)Qr8@1(4X0_3Fg7UJ2m}#a|4(7&2fkjf
zyHHc@^EJfAw+90{+m0wTkrR=tX#RSgenAPX()1W-v$Jn-RR~p+J*d;X8y&;h+1?|O
z)0FMk20H^zhu)au4EFeJL#Z@4@5YfVuaC-PJ+P;WI2F0V!f;1^`@rLRDZ^y@J#p+QTnpd*V+
zH@GZLZSZ443vhn;m&++V6BMJ%@-YcV(M~QlHJ$ZbujPqL(^`1@*gmj3@Z_eR|(PQ7UU!O%pjZSM?RdKWzv
zBMKDd2Db^Dp3)LfayV$h#&ZJ8_rnd=*}FybypB2*2ikg#`sGk1y*~c
zDVe{3>bC=z0~!Hy080V80Y?4;&mUf4w>HJ$;~TG;vAn>C=>uv0fF3cEca`1iZkbWx
z)dX_aUI`n}cQq(j^1AmtfLnpw_uL1YK3BayK5+VsK%p0aPXHqF&I=|j
zKgyhyC(QhjlE&!$q}qygO>O)*JRV0i9H+MdDk|tWg#af23MBzI0+s?^1e^s#07h`<
zBOkjZP693mGy;|aZULMH7-e$KA}O5K0gEI)BNJ8*+z6N>?)Y(BV#4a+4sR|#6y&kA
zDZ8=BmdEDgMe=wRrKe-^WKA~XQ$PuaKS}uXlLU%sisAS0-FSVpW11K>cMpG-i?4+2
z9dCXJ
zAMGDt_YBrEw&(1pv@w+p+kXwplZWjmZ9D8gEgv(3a?A}KE5r7qnq)m3p)@nac0J$VA4~RcHTa}8A?Q6Tu$xF
zH2oj*ontI^ZkKLwHZ$GYPVJq|dbOv0%oLfYS9#iXQ^(bTA;#_rf~xbo#u&z(F%}V|
z?KxsraD*63-hOwEFpIX|9Sl-t`sT*WMr%WIO{?!~P)HI(KCvS(@xwOO#b2f;SKov0
z9P3Zy2K5SIiR40%;6KE);Rs%k&iQ>u*k6Sa3>;A!*x&r~1YK$H1%vHlY@y`C4#{7^
zhZX|^eC9mT1RrVUyeQwkD4z@d!B-#*@WnuBzvOep#7I7s3BI9$0>5vl00=x88VyLE
zfeh_Zp4VL9aRGrRJxs4jp4ZaDf=6$V!PsnI$pZol!&{eRv9WB)B2zvjS;{9^c3foH
zA!AaasgXPaA(({I7kCm*gXdx~{yR%=Gj_N}>VnI={g`rvoc>-wNZ+}+FH;XM)3l-G
zLE(Uzk2|z%d7m(Qdi9{Q*QYOc`m~`s>F+Df-NL!f=^LVMe`jE*+uQ3KuJhLUojtzb
z$n=h>RhPxJ<6>M>JH95a4iOlXerZF~rN6JlRVAFKi@2&pTvZ~j>E7uwE|P7$BQRv9
z<{+j8(j0+)2(;Hwjw9HdZn>^OHr_f%=GL5}DzO6;hpA9JCeH}~(XPvy%9?}|`jl`=
z6!Yo{r_8N&j+~?Hz=V?pG@8TiA;DihgFc19;g@sRb

literal 0
HcmV?d00001

diff --git a/trunk/paradiseo-eo/doc/latex/Makefile b/trunk/paradiseo-eo/doc/latex/Makefile
new file mode 100644
index 000000000..6769968a2
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/Makefile
@@ -0,0 +1,39 @@
+all clean: refman.dvi
+
+ps: refman.ps
+
+pdf: refman.pdf
+
+ps_2on1: refman_2on1.ps
+
+pdf_2on1: refman_2on1.pdf
+
+refman.ps: refman.dvi
+	dvips -o refman.ps refman.dvi
+
+refman.pdf: refman.ps
+	ps2pdf refman.ps refman.pdf
+
+refman.dvi: refman.tex doxygen.sty
+	echo "Running latex..."
+	latex refman.tex
+	echo "Running makeindex..."
+	makeindex refman.idx
+	echo "Rerunning latex...."
+	latex refman.tex
+	latex_count=5 ; \
+	while egrep -s 'Rerun (LaTeX|to get cross-references right)' refman.log && [ $$latex_count -gt 0 ] ;\
+	    do \
+	      echo "Rerunning latex...." ;\
+	      latex refman.tex ;\
+	      latex_count=`expr $$latex_count - 1` ;\
+	    done
+
+refman_2on1.ps: refman.ps
+	psnup -2 refman.ps >refman_2on1.ps
+
+refman_2on1.pdf: refman_2on1.ps
+	ps2pdf refman_2on1.ps refman_2on1.pdf
+
+clean:
+	rm -f *.ps *.dvi *.aux *.toc *.idx *.ind *.ilg *.log *.out refman.pdf
diff --git a/trunk/paradiseo-eo/doc/latex/annotated.tex b/trunk/paradiseo-eo/doc/latex/annotated.tex
new file mode 100644
index 000000000..ff8a82c34
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/annotated.tex
@@ -0,0 +1,349 @@
+\section{EO Class List}
+Here are the classes, structs, unions and interfaces with brief descriptions:\begin{CompactList}
+\item\contentsline{section}{{\bf eo1Pt\-Bit\-Crossover} (Eo1Pt\-Bit\-Xover --$>$ classic 1-point crossover )}{\pageref{classeo1_pt_bit_crossover}}{}
+\item\contentsline{section}{{\bf eo\-Aged$<$ Object $>$} (Eo\-Age is a template class that adds an age to an object.$\backslash$ Requisites for template instantiation are that the object must admit a default ctor and a copy ctor )}{\pageref{classeo_aged}}{}
+\item\contentsline{section}{{\bf eo\-Algo$<$ EOT $>$} (This is a generic class for population-transforming algorithms )}{\pageref{classeo_algo}}{}
+\item\contentsline{section}{{\bf eo\-Arithmetic\-Crossover} (Eo\-Hypercube\-Crossover --$>$ uniform choice in hypercube == arithmetical with different values for each coordinate )}{\pageref{classeo_arithmetic_crossover}}{}
+\item\contentsline{section}{{\bf eo\-Assembled\-Fitness\-Average\-Stat$<$ EOT $>$} (Average fitness values of a population, where the fitness is of type eo\-Scalar\-Assembled\-Fitness )}{\pageref{classeo_assembled_fitness_average_stat}}{}
+\item\contentsline{section}{{\bf eo\-Assembled\-Fitness\-Best\-Stat$<$ EOT $>$} (Fitness values of best individuum in a population, where the fitness is of type eo\-Scalar\-Assembled\-Fitness )}{\pageref{classeo_assembled_fitness_best_stat}}{}
+\item\contentsline{section}{{\bf eo\-Atom\-Exchange$<$ Atom $>$} (A helper class for choosing which genes to exchange )}{\pageref{classeo_atom_exchange}}{}
+\item\contentsline{section}{{\bf eo\-Average\-Stat$<$ EOT $>$} (Average fitness of a population )}{\pageref{classeo_average_stat}}{}
+\item\contentsline{section}{{\bf eo\-Best\-Fitness\-Stat$<$ EOT $>$} (Best fitness of a population )}{\pageref{classeo_best_fitness_stat}}{}
+\item\contentsline{section}{{\bf eo\-Best\-Select$<$ EOT $>$} (Eo\-Best\-Select: a selection method that always return the best (mainly for testing purposes) )}{\pageref{classeo_best_select}}{}
+\item\contentsline{section}{{\bf eo\-BF$<$ A1, A2, R $>$} (Basic Binary Functor )}{\pageref{classeo_b_f}}{}
+\item\contentsline{section}{{\bf Biased\-Node\-Selector} (A node selector that does a specified number of rounds ignoring terminals )}{\pageref{class_biased_node_selector}}{}
+\item\contentsline{section}{{\bf eo\-Binary\-Functor\-Counter$<$ Binary\-Functor $>$} (Generic counter class that counts the number of times a binary function is used )}{\pageref{classeo_binary_functor_counter}}{}
+\item\contentsline{section}{{\bf eo\-Bin\-Clone\-Op$<$ EOT $>$} (Binary clone: two operands, only the first could be modified )}{\pageref{classeo_bin_clone_op}}{}
+\item\contentsline{section}{{\bf eo\-Bin\-Gen\-Op$<$ EOT $>$} (Wrapper for binop: here we use select method of {\bf eo\-Populator}{\rm (p.\,\pageref{classeo_populator})} but we could also have an embedded selector to select the second parent )}{\pageref{classeo_bin_gen_op}}{}
+\item\contentsline{section}{{\bf eo\-Bin\-Op$<$ EOType $>$} (Binary genetic operator: subclasses {\bf eo\-Op}{\rm (p.\,\pageref{classeo_op})}, and defines basically the operator() with two operands, only the first one can be modified When defining your own, make sure that you return a boolean value indicating that you have changed the content )}{\pageref{classeo_bin_op}}{}
+\item\contentsline{section}{{\bf eo\-Bit$<$ Fit\-T $>$} (Implementation of bitstring chromosome )}{\pageref{classeo_bit}}{}
+\item\contentsline{section}{{\bf eo\-Bit\-Bit\-Flip} (Eo\-Bit\-Flip --$>$ changes 1 bit )}{\pageref{classeo_bit_bit_flip}}{}
+\item\contentsline{section}{{\bf eo\-Bit\-Gx\-Over$<$ Chrom $>$} (Eo\-Bit\-Gx\-Over --$>$ Npts crossover when bistd::string considered as a std::string of binary-encoded genes (exchanges genes) Is anybody still using it apart from historians ??? :-) )}{\pageref{classeo_bit_gx_over}}{}
+\item\contentsline{section}{{\bf eo\-Bit\-Inversion$<$ Chrom $>$} (Eo\-Bit\-Inversion: inverts the bits of the chromosome between an interval )}{\pageref{classeo_bit_inversion}}{}
+\item\contentsline{section}{{\bf eo\-Bit\-Mutation$<$ Chrom $>$} (Eo\-Bit\-Mutation --$>$ classical mutation )}{\pageref{classeo_bit_mutation}}{}
+\item\contentsline{section}{{\bf eo\-Bit\-Next$<$ Chrom $>$} (Eo\-Bit\-Next --$>$ next value when bitstring considered as binary value )}{\pageref{classeo_bit_next}}{}
+\item\contentsline{section}{{\bf eo\-Bit\-Op\-Factory$<$ EOT $>$} ({\bf EO}{\rm (p.\,\pageref{class_e_o})} Factory )}{\pageref{classeo_bit_op_factory}}{}
+\item\contentsline{section}{{\bf eo\-Bit\-Prev$<$ Chrom $>$} (Eo\-Bit\-Prev --$>$ previous value when bitstring treated as binary value )}{\pageref{classeo_bit_prev}}{}
+\item\contentsline{section}{{\bf boolean\_\-generator} (The class boolean\_\-generator can be used in the STL generate function to easily generate random booleans with a specified bias )}{\pageref{classboolean__generator}}{}
+\item\contentsline{section}{{\bf eo\-Boolean\-Generator} (The class eo\-Boolean\-Generator can be used in the STL generate function to easily generate random booleans with a specified bias )}{\pageref{classeo_boolean_generator}}{}
+\item\contentsline{section}{{\bf eo\-Boolean\-Init} (The class eo\-Boolean\-Init can be used in the STL apply function to easily generate random booleans with a specified bias )}{\pageref{classeo_boolean_init}}{}
+\item\contentsline{section}{{\bf eo\-Bool\-Flip} (Simple boolean mutation - to be used in generic eo\-Op's )}{\pageref{classeo_bool_flip}}{}
+\item\contentsline{section}{{\bf eo\-Branch\-Mutation$<$ FType, Node $>$} (Eo\-Branch\-Mutation --$>$ replace a subtree with a randomly created subtree )}{\pageref{classeo_branch_mutation}}{}
+\item\contentsline{section}{{\bf eo\-Breed$<$ EOT $>$} (Breeding: combination of selecting and transforming a population )}{\pageref{classeo_breed}}{}
+\item\contentsline{section}{{\bf eo\-Cellular\-Easy\-EA$<$ EOT $>$} (The abstract cellular easy algorithm )}{\pageref{classeo_cellular_easy_e_a}}{}
+\item\contentsline{section}{{\bf eo\-Check\-Point$<$ EOT $>$} (Eo\-Check\-Point is a container class )}{\pageref{classeo_check_point}}{}
+\item\contentsline{section}{{\bf eo\-CMABreed$<$ Fit\-T $>$} (TODO, handle bounds )}{\pageref{classeo_c_m_a_breed}}{}
+\item\contentsline{section}{{\bf eo\-CMAInit$<$ Fit\-T $>$} (TODO, handle bounds )}{\pageref{classeo_c_m_a_init}}{}
+\item\contentsline{section}{{\bf eo\-Collapse\-Subtree\-Mutation$<$ FType, Node $>$} (Eo\-Collapse\-Subtree --$>$ replace a subtree with a randomly chosen terminal )}{\pageref{classeo_collapse_subtree_mutation}}{}
+\item\contentsline{section}{{\bf eo\-Combined\-Continue$<$ EOT $>$} (Combined continuators - logical AND: Continues until one of the embedded continuators says halt! )}{\pageref{classeo_combined_continue}}{}
+\item\contentsline{section}{{\bf eo\-Combined\-Init$<$ EOT $>$} (Combined INIT: a proportional recombination of {\bf eo\-Init}{\rm (p.\,\pageref{classeo_init})} objects )}{\pageref{classeo_combined_init}}{}
+\item\contentsline{section}{{\bf eo\-Comma\-Replacement$<$ EOT $>$} (ES type of replacement strategy: ignore parents, truncate offspring )}{\pageref{classeo_comma_replacement}}{}
+\item\contentsline{section}{{\bf eo\-Continue$<$ EOT $>$} (Termination condition for the genetic algorithm Takes the population as input, returns true for continue, false for termination )}{\pageref{classeo_continue}}{}
+\item\contentsline{section}{{\bf eo\-Counted\-Dyn\-Update} (An {\bf eo\-Updater}{\rm (p.\,\pageref{classeo_updater})} to update an {\bf eo\-Updatable}{\rm (p.\,\pageref{classeo_updatable})} object every given tic )}{\pageref{classeo_counted_dyn_update}}{}
+\item\contentsline{section}{{\bf eo\-Counted\-State\-Saver} (Eo\-Updater that saves a state every given generations )}{\pageref{classeo_counted_state_saver}}{}
+\item\contentsline{section}{{\bf Cov} (Single covariance between two variates )}{\pageref{class_cov}}{}
+\item\contentsline{section}{{\bf eo\-Ctrl\-CContinue$<$ EOT $>$} (Ctrl C handling: this {\bf eo\-Continue}{\rm (p.\,\pageref{classeo_continue})} tells whether the user pressed Ctrl C )}{\pageref{classeo_ctrl_c_continue}}{}
+\item\contentsline{section}{{\bf eo\-Det\-Bit\-Flip$<$ Chrom $>$} (Eo\-Det\-Bit\-Flip --$>$ changes exactly k bits )}{\pageref{classeo_det_bit_flip}}{}
+\item\contentsline{section}{{\bf eo\-Deterministic\-Sa\-DReplacement$<$ EOT $>$} (Eo\-Deterministic\-Sa\-DReplacement: replacement strategy that is just, in sequence saves best and kill worse from parents + saves best and kill worse from offspring + merge remaining (neither save nor killed) parents and offspring + reduce that merged population = returns reduced pop + best parents + best offspring )}{\pageref{classeo_deterministic_sa_d_replacement}}{}
+\item\contentsline{section}{{\bf eo\-Deterministic\-Survive\-And\-Die$<$ EOT $>$} (An instance (theonly one as of today, Dec )}{\pageref{classeo_deterministic_survive_and_die}}{}
+\item\contentsline{section}{{\bf eo\-Det\-Select$<$ EOT $>$} (Eo\-Det\-Select selects many individuals determinisctically )}{\pageref{classeo_det_select}}{}
+\item\contentsline{section}{{\bf eo\-Det\-Tournament\-Select$<$ EOT $>$} (Eo\-Det\-Tournament\-Select: a selection method that selects ONE individual by deterministic tournament -MS- 24/10/99 )}{\pageref{classeo_det_tournament_select}}{}
+\item\contentsline{section}{{\bf eo\-Det\-Tournament\-Truncate$<$ EOT $>$} (Truncate class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g )}{\pageref{classeo_det_tournament_truncate}}{}
+\item\contentsline{section}{{\bf eo\-Det\-Tournament\-Truncate\-Split$<$ EOT $>$} (Reduce\-Split class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g )}{\pageref{classeo_det_tournament_truncate_split}}{}
+\item\contentsline{section}{{\bf eo\-Det\-Tournament\-Worth\-Select$<$ EOT, Worth\-T $>$} (An instance of eo\-Select\-Perf2Worth that does selection from the Worthes using a .. )}{\pageref{classeo_det_tournament_worth_select}}{}
+\item\contentsline{section}{{\bf eo\-Det\-Uniform\-Mutation$<$ EOT $>$} (Eo\-Det\-Uniform\-Mutation --$>$ changes exactly k values of the std::vector by uniform choice with range epsilon )}{\pageref{classeo_det_uniform_mutation}}{}
+\item\contentsline{section}{{\bf eo\-Distance$<$ EOT $>$} (This is a generic class for distance functors: takes 2 things ane returns a double )}{\pageref{classeo_distance}}{}
+\item\contentsline{section}{{\bf eo\-Distrib\-Updater$<$ EOT $>$} (Base class for Distribution Evolution Algorithms within {\bf EO}{\rm (p.\,\pageref{class_e_o})}: the update rule of distribution )}{\pageref{classeo_distrib_updater}}{}
+\item\contentsline{section}{{\bf eo\-Distribution$<$ EOT $>$} (Abstract class for Distribution Evolution Algorithms within {\bf EO}{\rm (p.\,\pageref{class_e_o})}: the distribution itself )}{\pageref{classeo_distribution}}{}
+\item\contentsline{section}{{\bf d\-Matrix} (A helper class for Sharing - to hold distances )}{\pageref{classd_matrix}}{}
+\item\contentsline{section}{{\bf eo\-Dominance\-Map$<$ Eo\-Type $>$} (Eo\-Dominance\-Map, utility class to calculate and maintain a map (std::vector$<$std::vector$<$bool$>$ $>$) of pareto dominance statistics )}{\pageref{classeo_dominance_map}}{}
+\item\contentsline{section}{{\bf eo\-Double\-Exchange} (Discrete crossover == exchange of values )}{\pageref{classeo_double_exchange}}{}
+\item\contentsline{section}{{\bf eo\-Double\-Intermediate} (Intermediate crossover == linear combination )}{\pageref{classeo_double_intermediate}}{}
+\item\contentsline{section}{{\bf eo\-Drawable$<$ Object $>$} (Eo\-Drawable is a template class that adds a drawing interface to an object.$\backslash$ Requisites for template instantiation are that the object must admit a default ctor and a copy ctor )}{\pageref{classeo_drawable}}{}
+\item\contentsline{section}{{\bf Dummy} (Test program for the general operator - millenium version! uses dummy individuals )}{\pageref{struct_dummy}}{}
+\item\contentsline{section}{{\bf eo\-Dyn\-SGATransform$<$ EOT $>$} (Eo\-Dyn\-SGATransform: transforms a population using genetic operators )}{\pageref{classeo_dyn_s_g_a_transform}}{}
+\item\contentsline{section}{{\bf eo\-Dyn\-Updater} (A base class to actually update an {\bf eo\-Updatable}{\rm (p.\,\pageref{classeo_updatable})} object )}{\pageref{classeo_dyn_updater}}{}
+\item\contentsline{section}{{\bf eo\-Easy\-EA$<$ EOT $>$} (An easy-to-use evolutionary algorithm; you can use any chromosome, and any selection transformation, merging and evaluation algorithms; you can even change in runtime parameters of those sub-algorithms )}{\pageref{classeo_easy_e_a}}{}
+\item\contentsline{section}{{\bf eo\-EDA$<$ EOT $>$} (Eo\-EDA: Estimation of Distribution Algorithm within {\bf EO}{\rm (p.\,\pageref{class_e_o})} )}{\pageref{classeo_e_d_a}}{}
+\item\contentsline{section}{{\bf eo\-Elite\-Sequential\-Select$<$ EOT $>$} (All Individuals in order )}{\pageref{classeo_elite_sequential_select}}{}
+\item\contentsline{section}{{\bf eo\-Elitism$<$ EOT $>$} (Straightforward elitism class, specify the number of individuals to copy into new geneneration or the rate w.r.t )}{\pageref{classeo_elitism}}{}
+\item\contentsline{section}{{\bf EO$<$ F $>$} (EO is a base class for evolvable objects, that is, the subjects of evolution )}{\pageref{class_e_o}}{}
+\item\contentsline{section}{{\bf eo\-EPReduce$<$ EOT $>$} (EP truncation method (some global stochastic tournament + sort) Softer selective pressure than pure truncate )}{\pageref{classeo_e_p_reduce}}{}
+\item\contentsline{section}{{\bf eo\-EPReplacement$<$ EOT $>$} (EP type of replacement strategy: first add parents to population, then truncate using EP tournament )}{\pageref{classeo_e_p_replacement}}{}
+\item\contentsline{section}{{\bf eo\-Es\-Chrom\-Init$<$ EOT $>$} (Random Es-chromosome initializer (therefore derived from {\bf eo\-Init}{\rm (p.\,\pageref{classeo_init})}) )}{\pageref{classeo_es_chrom_init}}{}
+\item\contentsline{section}{{\bf eo\-Es\-Full$<$ Fit $>$} (The most complex evolutionary strategy representation )}{\pageref{classeo_es_full}}{}
+\item\contentsline{section}{{\bf eo\-Es\-Global\-Xover$<$ EOT $>$} (Gloabl crossover operator for ES genotypes )}{\pageref{classeo_es_global_xover}}{}
+\item\contentsline{section}{{\bf eo\-Es\-Mutate$<$ EOT $>$} (ES-style mutation in the large )}{\pageref{classeo_es_mutate}}{}
+\item\contentsline{section}{{\bf eo\-Es\-Mutation\-Init} (Initialize Mutation operator )}{\pageref{classeo_es_mutation_init}}{}
+\item\contentsline{section}{{\bf eo\-Es\-Simple$<$ Fit $>$} (Simple Evolution Strategy )}{\pageref{classeo_es_simple}}{}
+\item\contentsline{section}{{\bf eo\-Es\-Standard\-Xover$<$ EOT $>$} (Standard (i.e )}{\pageref{classeo_es_standard_xover}}{}
+\item\contentsline{section}{{\bf eo\-Es\-Stdev$<$ Fit $>$} (Evolutionary Strategy with a standard deviation per parameter )}{\pageref{classeo_es_stdev}}{}
+\item\contentsline{section}{{\bf eo\-Eval\-Continue$<$ EOT $>$} (Continues until a number of evaluations has been made )}{\pageref{classeo_eval_continue}}{}
+\item\contentsline{section}{{\bf eo\-Eval\-Func$<$ EOT $>$} (Evaluate: takes one {\bf EO}{\rm (p.\,\pageref{class_e_o})} and sets its \char`\"{}fitness\char`\"{} property returning this fitness also )}{\pageref{classeo_eval_func}}{}
+\item\contentsline{section}{{\bf eo\-Eval\-Func\-Counter$<$ EOT $>$} (Counts the number of evaluations actually performed, thus checks first if it has to evaluate. )}{\pageref{classeo_eval_func_counter}}{}
+\item\contentsline{section}{{\bf eo\-Eval\-Func\-Ptr$<$ EOT, Fit\-T, Function\-Arg $>$} (EOEval\-Func\-Ptr: This class takes an existing function pointer and converts it into a evaluation function class )}{\pageref{structeo_eval_func_ptr}}{}
+\item\contentsline{section}{{\bf eo\-Expansion\-Mutation$<$ FType, Node $>$} (Eo\-Expansion\-Mutation --$>$ replace a terminal with a randomly created subtree )}{\pageref{classeo_expansion_mutation}}{}
+\item\contentsline{section}{{\bf eo\-External\-Bin\-Op$<$ F, External, External\-EO $>$} (Crossover of external struct, ctor expects a function of the following signature: )}{\pageref{classeo_external_bin_op}}{}
+\item\contentsline{section}{{\bf eo\-External\-EO$<$ Fit, External $>$} (Definition of an object that allows an external struct to be inserted in {\bf EO}{\rm (p.\,\pageref{class_e_o})} )}{\pageref{classeo_external_e_o}}{}
+\item\contentsline{section}{{\bf eo\-External\-Eval\-Func$<$ F, External, External\-EO $>$} (Evaluation of external struct, ctor expects a function of the following signature: )}{\pageref{classeo_external_eval_func}}{}
+\item\contentsline{section}{{\bf eo\-External\-Init$<$ F, External, External\-EO $>$} (Initialization of external struct, ctor expects a function of the following signature: )}{\pageref{classeo_external_init}}{}
+\item\contentsline{section}{{\bf eo\-External\-Mon\-Op$<$ F, External, External\-EO $>$} (Mutation of external struct, ctor expects a function of the following signature: )}{\pageref{classeo_external_mon_op}}{}
+\item\contentsline{section}{{\bf eo\-External\-Quad\-Op$<$ F, External, External\-EO $>$} (Crossover of external struct, ctor expects a function of the following signature: )}{\pageref{classeo_external_quad_op}}{}
+\item\contentsline{section}{{\bf eo\-F$<$ R $>$} (Basic Function )}{\pageref{classeo_f}}{}
+\item\contentsline{section}{{\bf eo\-Factory$<$ EOClass $>$} ({\bf EO}{\rm (p.\,\pageref{class_e_o})} Factory )}{\pageref{classeo_factory}}{}
+\item\contentsline{section}{{\bf eo\-FDCFile\-Snapshot$<$ EOT $>$} (Specific class for FDCStat monitoring: As I failed to have FDC stat as an {\bf eo\-Stat}{\rm (p.\,\pageref{classeo_stat})}, this is the trick to put the 2 {\bf eo\-Param}{\rm (p.\,\pageref{classeo_param})}$<$std::vector$<$double$>$ $>$ into a monitor This class does nothing else )}{\pageref{classeo_f_d_c_file_snapshot}}{}
+\item\contentsline{section}{{\bf eo\-FDCStat$<$ EOT $>$} (The FDC computation - stores the values into eo\-Value\-Param$<$EOT,double$>$ so they can be snapshot by some eo\-Gnuplot\-Snapshot .. )}{\pageref{classeo_f_d_c_stat}}{}
+\item\contentsline{section}{{\bf eo\-File\-Monitor} (Prints statistics to file )}{\pageref{classeo_file_monitor}}{}
+\item\contentsline{section}{{\bf eo\-File\-Snapshot} (Prints snapshots of fitnesses to a (new) file every N generations )}{\pageref{classeo_file_snapshot}}{}
+\item\contentsline{section}{{\bf eo\-Fit\-Continue$<$ EOT $>$} (Fitness continuation: )}{\pageref{classeo_fit_continue}}{}
+\item\contentsline{section}{{\bf eo\-Fitness\-Scaling\-Select$<$ EOT $>$} (Eo\-Fitness\-Scaling\-Select: select an individual proportional to the linearly scaled fitness that is computed by the private {\bf eo\-Linear\-Fit\-Scaling}{\rm (p.\,\pageref{classeo_linear_fit_scaling})} object )}{\pageref{classeo_fitness_scaling_select}}{}
+\item\contentsline{section}{{\bf eo\-Fitness\-Stat$<$ EOT, Fit\-T $>$} (The fitnesses of a whole population, as a vector )}{\pageref{classeo_fitness_stat}}{}
+\item\contentsline{section}{{\bf eo\-Fl\-Or1pt\-Bin\-Op$<$ EOT $>$} (The 1pt crossover (just in case someone wants it some day!) )}{\pageref{classeo_fl_or1pt_bin_op}}{}
+\item\contentsline{section}{{\bf eo\-Fl\-Or1pt\-Quad\-Op$<$ EOT $>$} (The 1pt crossover (just in case someone wants it some day!) )}{\pageref{classeo_fl_or1pt_quad_op}}{}
+\item\contentsline{section}{{\bf eo\-Fl\-Or\-All\-Atom\-Bin\-Op$<$ EOT $>$} (Bin Crossover using an Atom Crossover that is applied to a ALL components with given rate )}{\pageref{classeo_fl_or_all_atom_bin_op}}{}
+\item\contentsline{section}{{\bf eo\-Fl\-Or\-All\-Atom\-Quad\-Op$<$ EOT $>$} (Quad Crossover using an Atom Crossover )}{\pageref{classeo_fl_or_all_atom_quad_op}}{}
+\item\contentsline{section}{{\bf eo\-Fl\-Or\-All\-Mutation$<$ EOT $>$} (Applies an atomic mutation to all the components with a given rate )}{\pageref{classeo_fl_or_all_mutation}}{}
+\item\contentsline{section}{{\bf eo\-Fl\-Or\-KAtom\-Bin\-Op$<$ EOT $>$} (Bin Crossover using an Atom Crossover that is applied to a FIXED NB of components )}{\pageref{classeo_fl_or_k_atom_bin_op}}{}
+\item\contentsline{section}{{\bf eo\-Fl\-Or\-KAtom\-Quad\-Op$<$ EOT $>$} (Quad Crossover using an Atom Crossover that is applied to a FIXED NB of components )}{\pageref{classeo_fl_or_k_atom_quad_op}}{}
+\item\contentsline{section}{{\bf eo\-Fl\-Or\-KMutation$<$ EOT $>$} (Applies an atomic mutation to a fixed number of components (1 by default) )}{\pageref{classeo_fl_or_k_mutation}}{}
+\item\contentsline{section}{{\bf eo\-Fl\-Or\-Uniform\-Bin\-Op$<$ EOT $>$} (The uniform crossover - exchanges atoms uniformly ! )}{\pageref{classeo_fl_or_uniform_bin_op}}{}
+\item\contentsline{section}{{\bf eo\-Fl\-Or\-Uniform\-Quad\-Op$<$ EOT $>$} (The uniform crossover - exchanges atoms uniformly ! )}{\pageref{classeo_fl_or_uniform_quad_op}}{}
+\item\contentsline{section}{{\bf eo\-Functor\-Base} (Base class for functors to get a nice hierarchy diagram )}{\pageref{classeo_functor_base}}{}
+\item\contentsline{section}{{\bf eo\-Functor\-Base::binary\_\-function\_\-tag} (Tag to identify a binary function in compile time function selection functor\_\-category )}{\pageref{structeo_functor_base_1_1binary__function__tag}}{}
+\item\contentsline{section}{{\bf eo\-Functor\-Base::procedure\_\-tag} (Tag to identify a procedure in compile time function selection functor\_\-category )}{\pageref{structeo_functor_base_1_1procedure__tag}}{}
+\item\contentsline{section}{{\bf eo\-Functor\-Base::unary\_\-function\_\-tag} (Tag to identify a unary function in compile time function selection functor\_\-category )}{\pageref{structeo_functor_base_1_1unary__function__tag}}{}
+\item\contentsline{section}{{\bf eo\-Functor\-Store} (Eo\-Functor\-Store is a class that stores functors that are allocated on the heap )}{\pageref{classeo_functor_store}}{}
+\item\contentsline{section}{{\bf eo\-G3Replacement$<$ EOT $>$} (Eo\-G3Replacement is an {\bf eo\-Replacement}{\rm (p.\,\pageref{classeo_replacement})}: - no strong elitism (is suppposed to be within a steady-state engine) - choose N (2) parents RANDOMLY - remove them from the parent population - merge offspring and the N removed parents - select best N of this merged population - put them back into parent population )}{\pageref{classeo_g3_replacement}}{}
+\item\contentsline{section}{{\bf eo\-Gen\-Continue$<$ EOT $>$} (Generational continuator: continues until a number of generations is reached )}{\pageref{classeo_gen_continue}}{}
+\item\contentsline{section}{{\bf eo\-Gene\-Del\-Chooser$<$ EOT $>$} (A helper class for choosing which site to delete )}{\pageref{classeo_gene_del_chooser}}{}
+\item\contentsline{section}{{\bf eo\-General\-Breeder$<$ EOT $>$} (Base class for breeders using generalized operators )}{\pageref{classeo_general_breeder}}{}
+\item\contentsline{section}{{\bf eo\-General\-Int\-Bounds} (A class that encapsulate all possible {\bf eo\-Int\-Bounds}{\rm (p.\,\pageref{classeo_int_bounds})} )}{\pageref{classeo_general_int_bounds}}{}
+\item\contentsline{section}{{\bf eo\-General\-Real\-Bounds} (A class that encapsulate all possible {\bf eo\-Int\-Bounds}{\rm (p.\,\pageref{classeo_int_bounds})} )}{\pageref{classeo_general_real_bounds}}{}
+\item\contentsline{section}{{\bf eo\-Generational\-Replacement$<$ EOT $>$} (Generational replacement == swap populations )}{\pageref{classeo_generational_replacement}}{}
+\item\contentsline{section}{{\bf eo\-Gen\-Op$<$ EOT $>$} (The base class for General Operators Subclass this operator is you want to define an operator that falls outside of the {\bf eo\-Mon\-Op}{\rm (p.\,\pageref{classeo_mon_op})}, {\bf eo\-Bin\-Op}{\rm (p.\,\pageref{classeo_bin_op})}, {\bf eo\-Quad\-Op}{\rm (p.\,\pageref{classeo_quad_op})} classification )}{\pageref{classeo_gen_op}}{}
+\item\contentsline{section}{{\bf eo\-Gnuplot} (Base class for calls to gnuplot )}{\pageref{classeo_gnuplot}}{}
+\item\contentsline{section}{{\bf eo\-Gnuplot1DMonitor} (Plot {\bf eo\-Stat}{\rm (p.\,\pageref{classeo_stat})} )}{\pageref{classeo_gnuplot1_d_monitor}}{}
+\item\contentsline{section}{{\bf eo\-Gnuplot1DSnapshot} (Plot stats through gnuplot )}{\pageref{classeo_gnuplot1_d_snapshot}}{}
+\item\contentsline{section}{{\bf eo\-Hamming\-Distance$<$ EOT $>$} (This is a generic class for L1 distance computation: assumes the 2 things are std::vectors of something that is double-castable For bitstrings, this is the Hamming distance )}{\pageref{classeo_hamming_distance}}{}
+\item\contentsline{section}{{\bf eo\-Hoist\-Mutation$<$ FType, Node $>$} (Eo\-Hoist\-Mutation --$>$ replace the individual with one of its subtree's )}{\pageref{classeo_hoist_mutation}}{}
+\item\contentsline{section}{{\bf eo\-How\-Many} (A helper class, to determine a number of individuals from another one Typically, is used in selection / replacement procedures, e.g )}{\pageref{classeo_how_many}}{}
+\item\contentsline{section}{{\bf eo\-Incrementor$<$ T $>$} (Eo\-Updater that simply increments a counter )}{\pageref{classeo_incrementor}}{}
+\item\contentsline{section}{{\bf eo\-Incrementor\-Param$<$ T $>$} (Eo\-Updater that is an {\bf eo\-Value\-Param}{\rm (p.\,\pageref{classeo_value_param})} (and thus OWNS its counter) Mandatory for generation counter in make\_\-checkpoint )}{\pageref{classeo_incrementor_param}}{}
+\item\contentsline{section}{{\bf eo\-Init$<$ EOT $>$} (Base (name) class for Initialization of chromosomes, used in a population contructor )}{\pageref{classeo_init}}{}
+\item\contentsline{section}{{\bf eo\-Init\-Adaptor$<$ EOT $>$} (Eo\-Init\-Adaptor changes the place in the hierarchy from {\bf eo\-Init}{\rm (p.\,\pageref{classeo_init})} to {\bf eo\-Mon\-Op}{\rm (p.\,\pageref{classeo_mon_op})} )}{\pageref{classeo_init_adaptor}}{}
+\item\contentsline{section}{{\bf eo\-Init\-Fixed\-Length$<$ EOT $>$} (Initializer for fixed length representations with a single type )}{\pageref{classeo_init_fixed_length}}{}
+\item\contentsline{section}{{\bf eo\-Init\-Generator$<$ EOT $>$} (Turning an {\bf eo\-Init}{\rm (p.\,\pageref{classeo_init})} into a generator probably we should only use genrators - and suppress {\bf eo\-Init}{\rm (p.\,\pageref{classeo_init})} ??? MS - July 2001 )}{\pageref{classeo_init_generator}}{}
+\item\contentsline{section}{{\bf eo\-Init\-Variable\-Length$<$ EOT $>$} (Initializer for variable length representations with a single type )}{\pageref{classeo_init_variable_length}}{}
+\item\contentsline{section}{{\bf eo\-Init\-Virus$<$ Fit\-T $>$} (Initializer for binary chromosome with MGE )}{\pageref{classeo_init_virus}}{}
+\item\contentsline{section}{{\bf eo\-Init\-Virus1bit$<$ Fit\-T $>$} (Inits the virus with one bit to the left set to one )}{\pageref{classeo_init_virus1bit}}{}
+\item\contentsline{section}{{\bf eo\-Inner\-Exchange\-Quad\-Op$<$ EOT $>$} (Crossover using an Atom\-Crossover )}{\pageref{classeo_inner_exchange_quad_op}}{}
+\item\contentsline{section}{{\bf eo\-Int\-Above\-Bound} (An eo\-Int\-Bound bounded from above only )}{\pageref{classeo_int_above_bound}}{}
+\item\contentsline{section}{{\bf eo\-Int\-Below\-Bound} (Eo\-Int\-Bound bounded from below only )}{\pageref{classeo_int_below_bound}}{}
+\item\contentsline{section}{{\bf eo\-Int\-Bounds} (Defines bound classes for real numbers )}{\pageref{classeo_int_bounds}}{}
+\item\contentsline{section}{{\bf eo\-Int\-Interval} (Fully bounded eo\-Int\-Bound == interval )}{\pageref{classeo_int_interval}}{}
+\item\contentsline{section}{{\bf eo\-Int\-No\-Bounds} (A default class for unbounded variables )}{\pageref{classeo_int_no_bounds}}{}
+\item\contentsline{section}{{\bf eo\-Invalidate\-Bin\-Op$<$ EOT $>$} (One of the invalidator operators )}{\pageref{classeo_invalidate_bin_op}}{}
+\item\contentsline{section}{{\bf eo\-Invalidate\-Mon\-Op$<$ EOT $>$} (One of the invalidator operators )}{\pageref{classeo_invalidate_mon_op}}{}
+\item\contentsline{section}{{\bf eo\-Invalidate\-Quad\-Op$<$ EOT $>$} (One of the invalidator operators )}{\pageref{classeo_invalidate_quad_op}}{}
+\item\contentsline{section}{{\bf eo\-Linear\-Fit\-Scaling$<$ EOT $>$} (An instance of {\bf eo\-Perf2Worth}{\rm (p.\,\pageref{classeo_perf2_worth})} COmputes the linearly scaled fitnesses with given selective pressure Pselect(Best) == pressure/size\-Pop Pselect(average) == 1.0/size\-Pop truncate negative values to 0 - )}{\pageref{classeo_linear_fit_scaling}}{}
+\item\contentsline{section}{{\bf eo\-Linear\-Random\-Split$<$ EOT $>$} (Random truncation - linear version )}{\pageref{classeo_linear_random_split}}{}
+\item\contentsline{section}{{\bf eo\-Linear\-Truncate$<$ EOT $>$} (Truncate class that does not sort, but repeatidely kills the worse )}{\pageref{classeo_linear_truncate}}{}
+\item\contentsline{section}{{\bf eo\-Linear\-Truncate\-Split$<$ EOT $>$} (Reduce\-Split class that does not sort, but repeatidely kills the worse )}{\pageref{classeo_linear_truncate_split}}{}
+\item\contentsline{section}{{\bf Mem\-Pool} (Pool allocator for the subtree and parse tree classes (homebrew and not compliant to ANSI allocator requirements) (c) copyright Maarten Keijzer 1999, 2000 )}{\pageref{class_mem_pool}}{}
+\item\contentsline{section}{{\bf gp\_\-parse\_\-tree::Mem\-Pool} (Pool allocator for the subtree and parse tree classes (homebrew and not compliant to ANSI allocator requirements) (c) copyright Maarten Keijzer 1999, 2000 )}{\pageref{classgp__parse__tree_1_1_mem_pool}}{}
+\item\contentsline{section}{{\bf eo\-Merge$<$ Chrom $>$} (Eo\-Merge: Base class for elitist replacement algorithms )}{\pageref{classeo_merge}}{}
+\item\contentsline{section}{{\bf eo\-Merge\-Reduce$<$ EOT $>$} (Eo\-Merge\-Reduce: abstract replacement strategy that is just an application of an embedded merge, followed by an embedded reduce )}{\pageref{classeo_merge_reduce}}{}
+\item\contentsline{section}{{\bf eo\-MGGReplacement$<$ EOT $>$} (Eo\-MGGReplacement is an {\bf eo\-Replacement}{\rm (p.\,\pageref{classeo_replacement})}: - choose N (2) parents RANDOMLY - remove them from the parent population - select best offspring, add to parents - merge (other?) offspring and the N removed parents - select best N-1 of this merged population (det\-Tournament only at the moment) - put them back into parent population )}{\pageref{classeo_m_g_g_replacement}}{}
+\item\contentsline{section}{{\bf Minimizing\-Traits} (Test program for Pareto Fitness )}{\pageref{class_minimizing_traits}}{}
+\item\contentsline{section}{{\bf eo\-MOFitness\-Stat$<$ EOT, Part\-Fit\-T $>$} (For multi-objective fitness, we need to translate a stat$<$vector$<$double$>$ $>$ into a vector$<$stat$>$, so each objective gets a seperate stat )}{\pageref{classeo_m_o_fitness_stat}}{}
+\item\contentsline{section}{{\bf eo\-Mon\-Clone\-Op$<$ EOT $>$} (Mon clone: one argument )}{\pageref{classeo_mon_clone_op}}{}
+\item\contentsline{section}{{\bf eo\-Mon\-Gen\-Op$<$ EOT $>$} (Wrapper for {\bf eo\-Mon\-Op}{\rm (p.\,\pageref{classeo_mon_op})} )}{\pageref{classeo_mon_gen_op}}{}
+\item\contentsline{section}{{\bf eo\-Monitor} (The abstract monitor class is a std::vector of parameter pointers )}{\pageref{classeo_monitor}}{}
+\item\contentsline{section}{{\bf eo\-Mon\-Op$<$ EOType $>$} (Eo\-Mon\-Op is the monary operator: genetic operator that takes only one {\bf EO}{\rm (p.\,\pageref{class_e_o})} )}{\pageref{classeo_mon_op}}{}
+\item\contentsline{section}{{\bf eo\-NDPlus\-Replacement$<$ EOT, Worth\-T $>$} (An elitist non-dominated sorted replacement scheme )}{\pageref{classeo_n_d_plus_replacement}}{}
+\item\contentsline{section}{{\bf eo\-NDSorting$<$ EOT $>$} (Non dominated sorting, it $\ast$is a$\ast$ std::vector of doubles, the integer part is the rank (to which front it belongs), the fractional part the niching penalty or distance penalty or whatever penalty you want to squeeze into the bits )}{\pageref{classeo_n_d_sorting}}{}
+\item\contentsline{section}{{\bf eo\-NDSorting$<$ EOT $>$::Dummy\-EO} (Used in fast nondominated sorting {\bf Dummy\-EO}{\rm (p.\,\pageref{classeo_n_d_sorting_1_1_dummy_e_o})} is just a storage place for fitnesses and to store the original index )}{\pageref{classeo_n_d_sorting_1_1_dummy_e_o}}{}
+\item\contentsline{section}{{\bf eo\-NDSorting\_\-I$<$ EOT $>$} (The original Non Dominated Sorting algorithm from Srinivas and Deb )}{\pageref{classeo_n_d_sorting___i}}{}
+\item\contentsline{section}{{\bf eo\-NDSorting\_\-II$<$ EOT $>$} (Fast Elitist Non-Dominant Sorting Genetic Algorithm )}{\pageref{classeo_n_d_sorting___i_i}}{}
+\item\contentsline{section}{{\bf negexp\_\-generator$<$ T $>$} (The class negexp\_\-generator can be used in the STL generate function to easily generate negative exponential distributed floats and doubles )}{\pageref{classnegexp__generator}}{}
+\item\contentsline{section}{{\bf eo\-Neg\-Exp\-Generator$<$ T $>$} (The class {\bf negexp\_\-generator}{\rm (p.\,\pageref{classnegexp__generator})} can be used in the STL generate function to easily generate negative exponential distributed floats and doubles )}{\pageref{classeo_neg_exp_generator}}{}
+\item\contentsline{section}{{\bf eo\-Neg\-Exp\-Init$<$ T $>$} (The class {\bf negexp\_\-generator}{\rm (p.\,\pageref{classnegexp__generator})} can be used in the STL generate function to easily generate negative exponential distributed floats and doubles )}{\pageref{classeo_neg_exp_init}}{}
+\item\contentsline{section}{{\bf Node\-Selector} (Base class for selecting nodes )}{\pageref{class_node_selector}}{}
+\item\contentsline{section}{{\bf eo\-No\-Elitism$<$ EOT $>$} (No elite )}{\pageref{classeo_no_elitism}}{}
+\item\contentsline{section}{{\bf eo\-No\-Perf2Worth$<$ EOT $>$} (A dummy perf2worth, just in case you need it )}{\pageref{classeo_no_perf2_worth}}{}
+\item\contentsline{section}{{\bf normal\_\-generator$<$ T $>$} (The class normal\_\-generator can be used in the STL generate function to easily generate gaussian distributed floats and doubles )}{\pageref{classnormal__generator}}{}
+\item\contentsline{section}{{\bf eo\-Normal\-Generator$<$ T $>$} (The class {\bf normal\_\-generator}{\rm (p.\,\pageref{classnormal__generator})} can be used in the STL generate function to easily generate gaussian distributed floats and doubles )}{\pageref{classeo_normal_generator}}{}
+\item\contentsline{section}{{\bf eo\-Normal\-Init$<$ T $>$} (The class {\bf normal\_\-generator}{\rm (p.\,\pageref{classnormal__generator})} can be used in the STL generate function to easily generate gaussian distributed floats and doubles )}{\pageref{classeo_normal_init}}{}
+\item\contentsline{section}{{\bf eo\-Normal\-Mutation$<$ EOT $>$} (Simple normal mutation of a std::vector of real values )}{\pageref{classeo_normal_mutation}}{}
+\item\contentsline{section}{{\bf eo\-Normal\-Vec\-Mutation$<$ EOT $>$} (Simple normal mutation of a std::vector of real values )}{\pageref{classeo_normal_vec_mutation}}{}
+\item\contentsline{section}{{\bf eo\-No\-Select$<$ EOT $>$} (Eo\-No\-Select: returns all individual in order WITHOUT USING FITNESS!!! looping back to the beginning when exhasuted )}{\pageref{classeo_no_select}}{}
+\item\contentsline{section}{{\bf eo\-NPts\-Bit\-Xover$<$ Chrom $>$} (Eo\-NPts\-Bit\-Xover --$>$ n-point crossover )}{\pageref{classeo_n_pts_bit_xover}}{}
+\item\contentsline{section}{{\bf eo\-Nth\-Element\-Fitness\-Stat$<$ EOT $>$} (The n\_\-th element fitness in the population (see {\bf eo\-Best\-Fitness\-Stat}{\rm (p.\,\pageref{classeo_best_fitness_stat})}) )}{\pageref{classeo_nth_element_fitness_stat}}{}
+\item\contentsline{section}{{\bf eo\-Object} (Eo\-Object used to be the base class for the whole hierarchy, but this has changed )}{\pageref{classeo_object}}{}
+\item\contentsline{section}{{\bf eo\-One\-Fifth\-Mutation$<$ EOT $>$} (Dynamic version: just say it is updatable - and write the {\bf update()}{\rm (p.\,\pageref{classeo_one_fifth_mutation_a3})} method! here the 1 fifth rule: count the proportion of successful mutations, and increase sigma if more than threshold (1/5 !) )}{\pageref{classeo_one_fifth_mutation}}{}
+\item\contentsline{section}{{\bf eo\-One\-Max$<$ Fit\-T $>$} (Always write a comment in this format before class definition if you want the class to be documented by Doxygen )}{\pageref{classeo_one_max}}{}
+\item\contentsline{section}{{\bf eo\-One\-Max\-Eval\-Func$<$ EOT $>$} (Always write a comment in this format before class definition if you want the class to be documented by Doxygen )}{\pageref{classeo_one_max_eval_func}}{}
+\item\contentsline{section}{{\bf eo\-One\-Max\-Init$<$ Genotype\-T $>$} (Always write a comment in this format before class definition if you want the class to be documented by Doxygen )}{\pageref{classeo_one_max_init}}{}
+\item\contentsline{section}{{\bf eo\-One\-Max\-Mutation$<$ Genotype\-T $>$} (Always write a comment in this format before class definition if you want the class to be documented by Doxygen )}{\pageref{classeo_one_max_mutation}}{}
+\item\contentsline{section}{{\bf eo\-One\-Max\-Quad\-Crossover$<$ Genotype\-T $>$} (Always write a comment in this format before class definition if you want the class to be documented by Doxygen )}{\pageref{classeo_one_max_quad_crossover}}{}
+\item\contentsline{section}{{\bf eo\-Op$<$ EOType $>$} (Abstract data types for {\bf EO}{\rm (p.\,\pageref{class_e_o})} operators )}{\pageref{classeo_op}}{}
+\item\contentsline{section}{{\bf eo\-Op\-Container$<$ EOT $>$} (Eo\-Op\-Container is a base class for the sequential and proportional selectors It takes care of wrapping the other operators, and deleting stuff that it has allocated )}{\pageref{classeo_op_container}}{}
+\item\contentsline{section}{{\bf eo\-Op\-Sel\-Mason$<$ eo\-Class $>$} ({\bf EO}{\rm (p.\,\pageref{class_e_o})} Mason, or builder, for operator selectors )}{\pageref{classeo_op_sel_mason}}{}
+\item\contentsline{section}{{\bf eo\-Param} (Eo\-Param: Base class for monitoring and parsing parameters )}{\pageref{classeo_param}}{}
+\item\contentsline{section}{{\bf eo\-Parameter\-Loader} (Parameter saving and loading )}{\pageref{classeo_parameter_loader}}{}
+\item\contentsline{section}{{\bf eo\-Param\-Param\-Type} (Another helper class for parsing parameters like Keyword(arg1, arg2, ...) )}{\pageref{classeo_param_param_type}}{}
+\item\contentsline{section}{{\bf eo\-Pareto\-Fitness$<$ Fitness\-Traits $>$} (Eo\-Pareto\-Fitness class: std::vector of doubles with overloaded comparison operators )}{\pageref{classeo_pareto_fitness}}{}
+\item\contentsline{section}{{\bf eo\-Pareto\-Fitness\-Traits} (Eo\-Fitness\-Traits: a traits class to specify the number of objectives and which one are maximizing or not See test/t-eo\-Pareto\-Fitness for its use )}{\pageref{classeo_pareto_fitness_traits}}{}
+\item\contentsline{section}{{\bf eo\-Pareto\-One\-Constraint\-Fitness$<$ Fitness\-Traits $>$} (Eo\-Pareto\-One\-Constraint\-Fitness class: std::vector of doubles + constraint value )}{\pageref{classeo_pareto_one_constraint_fitness}}{}
+\item\contentsline{section}{{\bf eo\-Pareto\-Ranking$<$ EOT $>$} (Straightforward pareto ranking )}{\pageref{classeo_pareto_ranking}}{}
+\item\contentsline{section}{{\bf eo\-Parser} (Eo\-Parser: command line parser and configuration file reader This class is persistent, so it can be stored and reloaded to restore parameter settings )}{\pageref{classeo_parser}}{}
+\item\contentsline{section}{{\bf eo\-Parse\-Tree$<$ FType, Node $>$} (Implementation of parse-tree for genetic programming )}{\pageref{classeo_parse_tree}}{}
+\item\contentsline{section}{{\bf eo\-Parse\-Tree\-Depth\-Init$<$ FType, Node $>$} (Eo\-Parse\-Tree\-Depth\-Init : the initializer class for {\bf eo\-Parse\-Tree}{\rm (p.\,\pageref{classeo_parse_tree})} )}{\pageref{classeo_parse_tree_depth_init}}{}
+\item\contentsline{section}{{\bf eo\-PBILAdditive$<$ EOT $>$} (Distribution Class for PBIL algorithm (Population-Based Incremental Learning, Baluja and Caruana 96) )}{\pageref{classeo_p_b_i_l_additive}}{}
+\item\contentsline{section}{{\bf eo\-PBILDistrib$<$ EOT $>$} (Distribution Class for PBIL algorithm (Population-Based Incremental Learning, Baluja and Caruana 96) )}{\pageref{classeo_p_b_i_l_distrib}}{}
+\item\contentsline{section}{{\bf eo\-PBILOrg$<$ EOT $>$} (Distribution Class for PBIL algorithm (Population-Based Incremental Learning, Baluja and Caruana 95) )}{\pageref{classeo_p_b_i_l_org}}{}
+\item\contentsline{section}{{\bf eo\-Perf2Worth$<$ EOT, Worth\-T $>$} (Base class to transform raw fitnesses into fitness for selection )}{\pageref{classeo_perf2_worth}}{}
+\item\contentsline{section}{{\bf eo\-Perf2Worth$<$ EOT, Worth\-T $>$::compare\_\-worth} (Helper class used to sort indices into populations/worths )}{\pageref{classeo_perf2_worth_1_1compare__worth}}{}
+\item\contentsline{section}{{\bf eo\-Perf2Worth\-Cached$<$ EOT, Worth\-T $>$} (Perf2Worth with fitness cache )}{\pageref{classeo_perf2_worth_cached}}{}
+\item\contentsline{section}{{\bf eo\-Perf2Worth\-Cached$<$ EOT, Worth\-T $>$::compare\_\-worth} (Helper class used to sort indices into populations/worths )}{\pageref{classeo_perf2_worth_cached_1_1compare__worth}}{}
+\item\contentsline{section}{{\bf eo\-Persistent} (An persistent object that knows how to write (through functions inherited from {\bf eo\-Printable}{\rm (p.\,\pageref{classeo_printable})}\#) and read itself )}{\pageref{classeo_persistent}}{}
+\item\contentsline{section}{{\bf eo\-Plus$<$ EOT $>$} (Very elitist class, copies entire population into next gen )}{\pageref{classeo_plus}}{}
+\item\contentsline{section}{{\bf eo\-Plus\-Replacement$<$ EOT $>$} (ES type of replacement strategy: first add parents to population, then truncate )}{\pageref{classeo_plus_replacement}}{}
+\item\contentsline{section}{{\bf eo\-Point\-Mutation$<$ FType, Node $>$} (Eo\-Point\-Mutation --$>$ replace a Node with a Node of the same arity )}{\pageref{classeo_point_mutation}}{}
+\item\contentsline{section}{{\bf eo\-Pop$<$ EOT $>$} (A std::vector of {\bf EO}{\rm (p.\,\pageref{class_e_o})} object, to be used in all algorithms (selectors, operators, replacements, ...) )}{\pageref{classeo_pop}}{}
+\item\contentsline{section}{{\bf eo\-Pop$<$ EOT $>$::Cmp} (Helper struct for comparing on pointers )}{\pageref{structeo_pop_1_1_cmp}}{}
+\item\contentsline{section}{{\bf eo\-Pop$<$ EOT $>$::Ref} (Helper struct for getting a pointer )}{\pageref{structeo_pop_1_1_ref}}{}
+\item\contentsline{section}{{\bf eo\-Pop\-Algo$<$ EOT $>$} (For all \char`\"{}population transforming\char`\"{} algos .. )}{\pageref{classeo_pop_algo}}{}
+\item\contentsline{section}{{\bf eo\-Pop\-Eval\-Func$<$ EOT $>$} (Eo\-Pop\-Eval\-Func: This abstract class is for GLOBAL evaluators of a population after variation )}{\pageref{classeo_pop_eval_func}}{}
+\item\contentsline{section}{{\bf eo\-Pop\-Loop\-Eval$<$ EOT $>$} (Eo\-Pop\-Loop\-Eval: an instance of {\bf eo\-Pop\-Eval\-Func}{\rm (p.\,\pageref{classeo_pop_eval_func})} that simply applies a private {\bf eo\-Eval\-Func}{\rm (p.\,\pageref{classeo_eval_func})} to all offspring )}{\pageref{classeo_pop_loop_eval}}{}
+\item\contentsline{section}{{\bf eo\-Pop\-Stat$<$ EOT $>$} (Thanks to MS/VC++, {\bf eo\-Param}{\rm (p.\,\pageref{classeo_param})} mechanism is unable to handle std::vectors of stats )}{\pageref{classeo_pop_stat}}{}
+\item\contentsline{section}{{\bf eo\-Populator$<$ EOT $>$} (Eo\-Populator is a helper class for general operators {\bf eo\-Gen\-Op}{\rm (p.\,\pageref{classeo_gen_op})} It is an {\bf eo\-Pop}{\rm (p.\,\pageref{classeo_pop})} but also behaves like an eo\-Pop::iterator as far as operator$\ast$ and operator++ are concerned )}{\pageref{classeo_populator}}{}
+\item\contentsline{section}{{\bf eo\-Printable} (Base class for objects that can print themselves ({\bf print\-On}{\rm (p.\,\pageref{classeo_printable_a1})}\#) )}{\pageref{classeo_printable}}{}
+\item\contentsline{section}{{\bf eo\-Procedure\-Counter$<$ Procedure $>$} (Generic counter class that counts the number of times a procedure is used )}{\pageref{classeo_procedure_counter}}{}
+\item\contentsline{section}{{\bf eo\-Prop\-Combined\-Bin\-Op$<$ EOT $>$} (COmbined Binary genetic operator: operator() has two operands, only the first one can be modified )}{\pageref{classeo_prop_combined_bin_op}}{}
+\item\contentsline{section}{{\bf eo\-Prop\-Combined\-Mon\-Op$<$ EOT $>$} (Eo\-Mon\-Op is the monary operator: genetic operator that takes only one {\bf EO}{\rm (p.\,\pageref{class_e_o})} )}{\pageref{classeo_prop_combined_mon_op}}{}
+\item\contentsline{section}{{\bf eo\-Prop\-Combined\-Quad\-Op$<$ EOT $>$} (Combined quad genetic operator: operator() has two operands, both can be modified )}{\pageref{classeo_prop_combined_quad_op}}{}
+\item\contentsline{section}{{\bf eo\-Prop\-GAGen\-Op$<$ EOT $>$} ($\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$ eo\-Prop\-GAGen\-Op (for Simple GA, but Proportional) choice between Crossover, mutation or cloining with respect to given relatve weights )}{\pageref{classeo_prop_g_a_gen_op}}{}
+\item\contentsline{section}{{\bf eo\-Proportional\-Op$<$ EOT $>$} (The proportional versions: easy! )}{\pageref{classeo_proportional_op}}{}
+\item\contentsline{section}{{\bf eo\-Proportional\-Select$<$ EOT $>$} (Eo\-Proportional\-Select: select an individual proportional to her stored fitness value )}{\pageref{classeo_proportional_select}}{}
+\item\contentsline{section}{{\bf eo\-Quad2Bin\-Op$<$ EOT $>$} (Turning an {\bf eo\-Quad\-Op}{\rm (p.\,\pageref{classeo_quad_op})} into an {\bf eo\-Bin\-Op}{\rm (p.\,\pageref{classeo_bin_op})}: simply don't touch the second arg! )}{\pageref{classeo_quad2_bin_op}}{}
+\item\contentsline{section}{{\bf eo\-Quad\-Clone\-Op$<$ EOT $>$} (Quad clone: two operands, both could be modified - but are not! )}{\pageref{classeo_quad_clone_op}}{}
+\item\contentsline{section}{{\bf eo\-Quad\-Distance$<$ EOT $>$} (This is a generic class for Euclidain distance (L2 norm) computation: assumes the 2 things are std::vectors of something that is double-castable )}{\pageref{classeo_quad_distance}}{}
+\item\contentsline{section}{{\bf eo\-Quad\-Gen\-Op$<$ EOT $>$} (Wrapper for quadop: easy as pie )}{\pageref{classeo_quad_gen_op}}{}
+\item\contentsline{section}{{\bf eo\-Quad\-Op$<$ EOType $>$} (Quad genetic operator: subclasses {\bf eo\-Op}{\rm (p.\,\pageref{classeo_op})}, and defines basically the operator() with two operands, both can be modified )}{\pageref{classeo_quad_op}}{}
+\item\contentsline{section}{{\bf random\_\-generator$<$ T $>$} (The class random\_\-generator can be used in the STL generate function to easily generate random ints either between [0, \_\-max) if only one value (\_\-max) is given to the ctor or in [\_\-min,\_\-max) if 2 values are given (\_\-min, \_\-max) )}{\pageref{classrandom__generator}}{}
+\item\contentsline{section}{{\bf Random\-Node\-Selector} (Select nodes uniformly )}{\pageref{class_random_node_selector}}{}
+\item\contentsline{section}{{\bf eo\-Random\-Reduce$<$ EOT $>$} (Random truncation )}{\pageref{classeo_random_reduce}}{}
+\item\contentsline{section}{{\bf eo\-Random\-Select$<$ EOT $>$} (Eo\-Random\-Select: a selection method that selects ONE individual randomly )}{\pageref{classeo_random_select}}{}
+\item\contentsline{section}{{\bf eo\-Random\-Split$<$ EOT $>$} (Random truncation - batch version )}{\pageref{classeo_random_split}}{}
+\item\contentsline{section}{{\bf eo\-Ranking$<$ EOT $>$} (An instance of eo\-Perf\-From\-Worth COmputes the ranked fitness: fitnesses range in [m,M] with m=2-pressure/pop\-Size and M=pressure/pop\-Size )}{\pageref{classeo_ranking}}{}
+\item\contentsline{section}{{\bf eo\-Ranking\-Select$<$ EOT $>$} (Eo\-Ranking\-Select: select an individual by roulette wheel on its rank is an {\bf eo\-Roulette\-Worth\-Select}{\rm (p.\,\pageref{classeo_roulette_worth_select})}, i.e )}{\pageref{classeo_ranking_select}}{}
+\item\contentsline{section}{{\bf eo\-Real$<$ Fit\-T $>$} (Eo\-Real: implementation of simple real-valued chromosome )}{\pageref{classeo_real}}{}
+\item\contentsline{section}{{\bf eo\-Real\-Above\-Bound} (An eo\-Real\-Bound bounded from above only )}{\pageref{classeo_real_above_bound}}{}
+\item\contentsline{section}{{\bf eo\-Real\-Base\-Vector\-Bounds} (Vector type for bounds (see {\bf eo\-Real\-Bounds.h}{\rm (p.\,\pageref{eo_real_bounds_8h})} for scalar types) ------------ Class {\bf eo\-Real\-Vector\-Bounds}{\rm (p.\,\pageref{classeo_real_vector_bounds})} implements the std::vectorized version: it is basically a std::vector of {\bf eo\-Real\-Bounds}{\rm (p.\,\pageref{classeo_real_bounds})} $\ast$ and forwards all request to the elements of the std::vector )}{\pageref{classeo_real_base_vector_bounds}}{}
+\item\contentsline{section}{{\bf eo\-Real\-Below\-Bound} (Eo\-Real\-Bound bounded from below only )}{\pageref{classeo_real_below_bound}}{}
+\item\contentsline{section}{{\bf eo\-Real\-Bounds} (Defines bound classes for real numbers )}{\pageref{classeo_real_bounds}}{}
+\item\contentsline{section}{{\bf eo\-Real\-Init\-Bounded$<$ EOT $>$} (Simple initialization for any EOT that derives from std::vector$<$double$>$ uniformly in some bounds )}{\pageref{classeo_real_init_bounded}}{}
+\item\contentsline{section}{{\bf eo\-Real\-Interval} (Fully bounded eo\-Real\-Bound == interval )}{\pageref{classeo_real_interval}}{}
+\item\contentsline{section}{{\bf eo\-Real\-No\-Bounds} (A default class for unbounded variables )}{\pageref{classeo_real_no_bounds}}{}
+\item\contentsline{section}{{\bf eo\-Real\-Ux\-Over} (Eo\-Real\-Ux\-Over --$>$ Uniform crossover, also termed intermediate crossover )}{\pageref{classeo_real_ux_over}}{}
+\item\contentsline{section}{{\bf eo\-Real\-Vector\-Bounds} (Now a derived class, for parser reading It holds some of the bounds (and destroy them when dying) )}{\pageref{classeo_real_vector_bounds}}{}
+\item\contentsline{section}{{\bf eo\-Real\-Vector\-No\-Bounds} ({\bf Dummy}{\rm (p.\,\pageref{struct_dummy})} unbounded {\bf eo\-Real\-Vector\-Bounds}{\rm (p.\,\pageref{classeo_real_vector_bounds})}: usefull if you don't need bounds! everything is inlined )}{\pageref{classeo_real_vector_no_bounds}}{}
+\item\contentsline{section}{{\bf eo\-Reduce$<$ EOT $>$} (Eo\-Reduce: .reduce the new generation to the specified size At the moment, limited to truncation - with 2 different methods, one that sorts the whole population, and one that repeatidely kills the worst )}{\pageref{classeo_reduce}}{}
+\item\contentsline{section}{{\bf eo\-Reduce\-Merge$<$ EOT $>$} (Eo\-Reduce\-Merge: Replacement strategies that start by reducing the parents, then merge with the offspring )}{\pageref{classeo_reduce_merge}}{}
+\item\contentsline{section}{{\bf eo\-Reduce\-Merge\-Reduce$<$ EOT $>$} (Eo\-Reduce\-Merge\-Reduce is an {\bf eo\-Replacement}{\rm (p.\,\pageref{classeo_replacement})}: - saves possible elite parents - reduces rest of parents - reduces offspring - merges reduced populations - reduces resulting merged pop if necessary )}{\pageref{classeo_reduce_merge_reduce}}{}
+\item\contentsline{section}{{\bf eo\-Reduce\-Split$<$ EOT $>$} (Eo\-Reduce\-Split: reduce the pop to the specified size AND eventually returns the eliminated guys )}{\pageref{classeo_reduce_split}}{}
+\item\contentsline{section}{{\bf eo\-Replacement$<$ EOT $>$} }{\pageref{classeo_replacement}}{}
+\item\contentsline{section}{{\bf eo\-Rnd\-Generator$<$ T $>$} (By popular demand re-introducing a base class for a family of random number generators )}{\pageref{classeo_rnd_generator}}{}
+\item\contentsline{section}{{\bf eo\-Rng} (Random Number Generator )}{\pageref{classeo_rng}}{}
+\item\contentsline{section}{{\bf eo\-Roulette\-Worth\-Select$<$ EOT, Worth\-T $>$} (An instance of eo\-Select\-Perf2Worth that does selection from the Worthes using a .. )}{\pageref{classeo_roulette_worth_select}}{}
+\item\contentsline{section}{{\bf eo\-Scalar\-Fitness$<$ Scalar\-Type, Compare $>$} (Eo\-Scalar\-Fitness$<$Scalar\-Type, Compare = less$<$Scalar\-Type$>$ $>$: Wraps a scalar fitness values such as a double or int, with the option of maximizing (using less$<$Scalar\-Type$>$) or minimizing (using greater$<$Scalar\-Type$>$) )}{\pageref{classeo_scalar_fitness}}{}
+\item\contentsline{section}{{\bf eo\-Scalar\-Fitness\-Assembled$<$ Scalar\-Type, Compare, Fitness\-Traits $>$} (Implements fitness as std::vector, storing all values that might occur during fitness assembly )}{\pageref{classeo_scalar_fitness_assembled}}{}
+\item\contentsline{section}{{\bf eo\-Scalar\-Fitness\-Assembled\-Traits} (Defines properties of {\bf eo\-Scalar\-Fitness\-Assembled}{\rm (p.\,\pageref{classeo_scalar_fitness_assembled})} )}{\pageref{classeo_scalar_fitness_assembled_traits}}{}
+\item\contentsline{section}{{\bf eo\-Scalar\-Fitness\-Stat$<$ EOT, Fit\-T $>$} (The fitnesses of a whole population, as a std::vector )}{\pageref{classeo_scalar_fitness_stat}}{}
+\item\contentsline{section}{{\bf eo\-Second\-Moment\-Stats$<$ EOT $>$} (Average fitness + Std )}{\pageref{classeo_second_moment_stats}}{}
+\item\contentsline{section}{{\bf eo\-Segment\-Crossover$<$ EOT $>$} (Eo\-Segment\-Crossover --$>$ uniform choice in segment == arithmetical with same value along all coordinates )}{\pageref{classeo_segment_crossover}}{}
+\item\contentsline{section}{{\bf eo\-Sel\-Bin\-Gen\-Op$<$ EOT $>$} (Wrapper for {\bf eo\-Bin\-Op}{\rm (p.\,\pageref{classeo_bin_op})} with a selector )}{\pageref{classeo_sel_bin_gen_op}}{}
+\item\contentsline{section}{{\bf eo\-Select$<$ EOT $>$} (Eo\-Select selects a number of individuals from the first argument and puts it in the second )}{\pageref{classeo_select}}{}
+\item\contentsline{section}{{\bf eo\-Select\-Factory$<$ EOT $>$} ({\bf EO}{\rm (p.\,\pageref{class_e_o})} Factory.An instance of the factory class to create selectors, that is, {\bf eo\-Select}{\rm (p.\,\pageref{classeo_select})} objects )}{\pageref{classeo_select_factory}}{}
+\item\contentsline{section}{{\bf eo\-Select\-From\-Worth$<$ EOT, Worth\-Type $>$} (Selects one element from a population (is an {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})}) but the selection is based on a std::vector of Worth that is different from the fitnesses (e.g )}{\pageref{classeo_select_from_worth}}{}
+\item\contentsline{section}{{\bf eo\-Selective\-Populator$<$ EOT $>$} (Selective\-Populator an eo\-Poplator that uses an {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} to select guys )}{\pageref{classeo_selective_populator}}{}
+\item\contentsline{section}{{\bf eo\-Select\-Many$<$ EOT $>$} (Eo\-Select\-Many selects many individuals using {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} as it's mechanism )}{\pageref{classeo_select_many}}{}
+\item\contentsline{section}{{\bf eo\-Select\-Number$<$ EOT $>$} (Eo\-Select\-Number selects many individuals using {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} as it's mechanism )}{\pageref{classeo_select_number}}{}
+\item\contentsline{section}{{\bf eo\-Select\-One$<$ EOT, Worth\-T $>$} (Eo\-Select\-One selects only one element from a whole population )}{\pageref{classeo_select_one}}{}
+\item\contentsline{section}{{\bf eo\-Select\-Perc$<$ EOT $>$} (Eo\-Select\-Perc selects many individuals using {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} as it's mechanism )}{\pageref{classeo_select_perc}}{}
+\item\contentsline{section}{{\bf eo\-Select\-Transform$<$ EOT $>$} (Embedded select, followed by an embedded transform )}{\pageref{classeo_select_transform}}{}
+\item\contentsline{section}{{\bf eo\-Seq\-Populator$<$ EOT $>$} (Seq\-Populator: an {\bf eo\-Populator}{\rm (p.\,\pageref{classeo_populator})} that sequentially goes through the population is supposed to be used after a batch select of a whole bunch or genitors )}{\pageref{classeo_seq_populator}}{}
+\item\contentsline{section}{{\bf eo\-Sequential\-Op$<$ EOT $>$} (Sequential selection: note the mark, rewind, unmark cycle here operators are repeatedly applied on the same individual(s) not all too elegant, but it sort of works.. )}{\pageref{classeo_sequential_op}}{}
+\item\contentsline{section}{{\bf eo\-Sequential\-Select$<$ EOT $>$} (All Individuals in order )}{\pageref{classeo_sequential_select}}{}
+\item\contentsline{section}{{\bf eo\-SGA$<$ EOT $>$} (The Simple Genetic Algorithm, following Holland and Goldberg )}{\pageref{classeo_s_g_a}}{}
+\item\contentsline{section}{{\bf eo\-SGAGen\-Op$<$ EOT $>$} ($\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$ eo\-SGAGen\-Op (for Simple GA) mimicks the usual crossover with proba p\-Cross + mutation with proba p\-Mut inside an eo\-General\-Op It does it exactly as class {\bf eo\-SGATransform}{\rm (p.\,\pageref{classeo_s_g_a_transform})}, i.e )}{\pageref{classeo_s_g_a_gen_op}}{}
+\item\contentsline{section}{{\bf eo\-SGATransform$<$ EOT $>$} (Eo\-SGATransform: transforms a population using genetic operators )}{\pageref{classeo_s_g_a_transform}}{}
+\item\contentsline{section}{{\bf eo\-Sharing$<$ EOT $>$} (Sharing is a perf2worth class that implements Goldberg and Richardson's basic sharing see {\bf eo\-Sharing\-Select}{\rm (p.\,\pageref{classeo_sharing_select})} for how to use it and test/t-eo\-Sharing.cpp for a sample use of both )}{\pageref{classeo_sharing}}{}
+\item\contentsline{section}{{\bf eo\-Sharing\-Select$<$ EOT $>$} (Eo\-Sharing\-Select: select an individual by roulette wheel on its SHARED fitness )}{\pageref{classeo_sharing_select}}{}
+\item\contentsline{section}{{\bf eo\-Simple\-EDA$<$ EOT $>$} (Eo\-Simple\-EDA: a very simple Estimation of Distribution Algorithm )}{\pageref{classeo_simple_e_d_a}}{}
+\item\contentsline{section}{{\bf eo\-Sorted\-Pop\-Stat$<$ EOT $>$} (Thanks to MS/VC++, {\bf eo\-Param}{\rm (p.\,\pageref{classeo_param})} mechanism is unable to handle std::vectors of stats )}{\pageref{classeo_sorted_pop_stat}}{}
+\item\contentsline{section}{{\bf eo\-Sorted\-Stat$<$ EOT, Param\-Type $>$} (The actual class that will be used as base for all statistics that need to be calculated over the sorted population It's an {\bf eo\-Sorted\-Stat\-Base}{\rm (p.\,\pageref{classeo_sorted_stat_base})} AND an {\bf eo\-Value\-Param}{\rm (p.\,\pageref{classeo_value_param})} so it can be used in Monitors )}{\pageref{classeo_sorted_stat}}{}
+\item\contentsline{section}{{\bf eo\-Sorted\-Stat\-Base$<$ EOT $>$} (Base class for statistics calculated over a sorted snapshot of the population )}{\pageref{classeo_sorted_stat_base}}{}
+\item\contentsline{section}{{\bf eo\-SSGADet\-Tournament\-Replacement$<$ EOT $>$} (SSGA deterministic tournament replacement )}{\pageref{classeo_s_s_g_a_det_tournament_replacement}}{}
+\item\contentsline{section}{{\bf eo\-SSGAStoch\-Tournament\-Replacement$<$ EOT $>$} (SSGA stochastic tournament replacement )}{\pageref{classeo_s_s_g_a_stoch_tournament_replacement}}{}
+\item\contentsline{section}{{\bf eo\-SSGAWorse\-Replacement$<$ EOT $>$} (SSGA replace worst )}{\pageref{classeo_s_s_g_a_worse_replacement}}{}
+\item\contentsline{section}{{\bf eo\-Stat$<$ EOT, T $>$} (The actual class that will be used as base for all statistics that need to be calculated over the (unsorted) population It is an {\bf eo\-Stat\-Base}{\rm (p.\,\pageref{classeo_stat_base})} AND an {\bf eo\-Value\-Param}{\rm (p.\,\pageref{classeo_value_param})} so it can be used in Monitors )}{\pageref{classeo_stat}}{}
+\item\contentsline{section}{{\bf eo\-Stat\-Base$<$ EOT $>$} (Base class for all statistics that need to be calculated over the (unsorted) population (I guess it is not really necessary? MS )}{\pageref{classeo_stat_base}}{}
+\item\contentsline{section}{{\bf eo\-State} (Eo\-State can be used to register derivants of {\bf eo\-Persistent}{\rm (p.\,\pageref{classeo_persistent})} )}{\pageref{classeo_state}}{}
+\item\contentsline{section}{{\bf eo\-State::loading\_\-error} (Loading error thrown when nothing seems to work )}{\pageref{structeo_state_1_1loading__error}}{}
+\item\contentsline{section}{{\bf eo\-St\-Branch\-Mutation$<$ FType, Node $>$} (Eo\-St\-Branch\-Mutation --$>$ replace a strongly typed subtree with a randomly created strongly typed subtree )}{\pageref{classeo_st_branch_mutation}}{}
+\item\contentsline{section}{{\bf eo\-Stdout\-Monitor} (Prints statistics to stdout )}{\pageref{classeo_stdout_monitor}}{}
+\item\contentsline{section}{{\bf eo\-Steady\-Fit\-Continue$<$ EOT $>$} (A continuator: does a minimum number of generations, then stops whenever a given number of generations takes place without improvement )}{\pageref{classeo_steady_fit_continue}}{}
+\item\contentsline{section}{{\bf eo\-St\-Hoist\-Mutation$<$ FType, Node $>$} (Eo\-St\-Hoist\-Mutation --$>$ replace the individual with one of its strongly typed subtree's )}{\pageref{classeo_st_hoist_mutation}}{}
+\item\contentsline{section}{{\bf eo\-STLBF$<$ A1, A2, R $>$} (Generic set of classes that wrap an {\bf eo\-F}{\rm (p.\,\pageref{classeo_f})}, {\bf eo\-UF}{\rm (p.\,\pageref{classeo_u_f})} or {\bf eo\-BF}{\rm (p.\,\pageref{classeo_b_f})} so that they have the copy semantics the STL functions usually require (i.e )}{\pageref{classeo_s_t_l_b_f}}{}
+\item\contentsline{section}{{\bf eo\-STLF$<$ R $>$} (Generic set of classes that wrap an {\bf eo\-F}{\rm (p.\,\pageref{classeo_f})}, {\bf eo\-UF}{\rm (p.\,\pageref{classeo_u_f})} or {\bf eo\-BF}{\rm (p.\,\pageref{classeo_b_f})} so that they have the copy semantics the STL functions usually require (i.e )}{\pageref{classeo_s_t_l_f}}{}
+\item\contentsline{section}{{\bf eo\-STLUF$<$ A1, R $>$} (Generic set of classes that wrap an {\bf eo\-F}{\rm (p.\,\pageref{classeo_f})}, {\bf eo\-UF}{\rm (p.\,\pageref{classeo_u_f})} or {\bf eo\-BF}{\rm (p.\,\pageref{classeo_b_f})} so that they have the copy semantics the STL functions usually require (i.e )}{\pageref{classeo_s_t_l_u_f}}{}
+\item\contentsline{section}{{\bf eo\-Stochastic\-Universal\-Select$<$ EOT $>$} (Eo\-Stochastic\-Universal\-Select: select an individual proportional to her stored fitness value, but in contrast with eo\-Stochastic\-Universal\-Select, get rid of most finite sampling effects by doing all selections in one go, using a single random number )}{\pageref{classeo_stochastic_universal_select}}{}
+\item\contentsline{section}{{\bf eo\-Stoch\-Tournament\-Select$<$ EOT $>$} (Eo\-Stoch\-Tournament\-Select: a selection method that selects ONE individual by binary stochastic tournament -MS- 24/10/99 )}{\pageref{classeo_stoch_tournament_select}}{}
+\item\contentsline{section}{{\bf eo\-Stoch\-Tournament\-Truncate$<$ EOT $>$} (Truncate class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g )}{\pageref{classeo_stoch_tournament_truncate}}{}
+\item\contentsline{section}{{\bf eo\-Stoch\-Tournament\-Truncate\-Split$<$ EOT $>$} (Reduce\-Split class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g )}{\pageref{classeo_stoch_tournament_truncate_split}}{}
+\item\contentsline{section}{{\bf eo\-Stoch\-Tournament\-Worth\-Select$<$ EOT, Worth\-T $>$} (An instance of eo\-Select\-Perf2Worth that does selection from the Worthes using a .. )}{\pageref{classeo_stoch_tournament_worth_select}}{}
+\item\contentsline{section}{{\bf eo\-St\-Parse\-Tree\-Depth\-Init$<$ FType, Node $>$} (Eo\-St\-Parse\-Tree\-Depth\-Init : the initializer class for strongly typed tree-based genetic programming )}{\pageref{classeo_st_parse_tree_depth_init}}{}
+\item\contentsline{section}{{\bf eo\-St\-Point\-Mutation$<$ FType, Node $>$} (Eo\-St\-Point\-Mutation --$>$ replace a Node with a Node of the same arity and type )}{\pageref{classeo_st_point_mutation}}{}
+\item\contentsline{section}{{\bf eo\-String$<$ fitness\-T $>$} (Adaptor that turns an STL std::string into an {\bf EO}{\rm (p.\,\pageref{class_e_o})} )}{\pageref{classeo_string}}{}
+\item\contentsline{section}{{\bf eo\-St\-Subtree\-XOver$<$ FType, Node $>$} (Eo\-St\-Subtree\-XOver --$>$ subtree xover for strongly typed tree-based genetic programming )}{\pageref{classeo_st_subtree_x_over}}{}
+\item\contentsline{section}{{\bf eo\-Subtree\-XOver$<$ FType, Node $>$} (Eo\-Subtree\-XOver --$>$ subtree xover )}{\pageref{classeo_subtree_x_over}}{}
+\item\contentsline{section}{{\bf eo\-Survive\-And\-Die$<$ EOT $>$} (Eo\-Survive\-And\-Die A pure abstract class, to store the howmany's )}{\pageref{classeo_survive_and_die}}{}
+\item\contentsline{section}{{\bf eo\-Sym\-Init$<$ Eo\-Type $>$} (Default initializer, Koza style )}{\pageref{classeo_sym_init}}{}
+\item\contentsline{section}{{\bf T\_\-pickle\_\-suite$<$ T $>$} (Implements pickle support for {\bf eo\-Persistent}{\rm (p.\,\pageref{classeo_persistent})} derivatives )}{\pageref{struct_t__pickle__suite}}{}
+\item\contentsline{section}{{\bf eo\-Time\-Counter} (An {\bf eo\-Stat}{\rm (p.\,\pageref{classeo_stat})} that simply gives the user time since first generation It has to be tempatized by EOT because it must be an {\bf eo\-Stat}{\rm (p.\,\pageref{classeo_stat})} )}{\pageref{classeo_time_counter}}{}
+\item\contentsline{section}{{\bf eo\-Timed\-Dyn\-Update} (An {\bf eo\-Updater}{\rm (p.\,\pageref{classeo_updater})} to update an {\bf eo\-Updatable}{\rm (p.\,\pageref{classeo_updatable})} object every given time interval )}{\pageref{classeo_timed_dyn_update}}{}
+\item\contentsline{section}{{\bf eo\-Timed\-Monitor} (Holds a collection of monitors and only fires them when a time limit has been reached )}{\pageref{classeo_timed_monitor}}{}
+\item\contentsline{section}{{\bf eo\-Timed\-State\-Saver} (Eo\-Updater that saves a state every given time interval )}{\pageref{classeo_timed_state_saver}}{}
+\item\contentsline{section}{{\bf eo\-Time\-Varying\-Loop\-Eval$<$ EOT $>$} (Eo\-Pop\-Loop\-Eval: an instance of {\bf eo\-Pop\-Eval\-Func}{\rm (p.\,\pageref{classeo_pop_eval_func})} that simply applies a private {\bf eo\-Eval\-Func}{\rm (p.\,\pageref{classeo_eval_func})} to all offspring AND ALL PARENTS as the fitness is supposed here to vary )}{\pageref{classeo_time_varying_loop_eval}}{}
+\item\contentsline{section}{{\bf eo\-Transform$<$ EOT $>$} (Eo\-Transform transforms a population by applying genetic operators on it )}{\pageref{classeo_transform}}{}
+\item\contentsline{section}{{\bf eo\-Truncate$<$ EOT $>$} (Truncation method using sort )}{\pageref{classeo_truncate}}{}
+\item\contentsline{section}{{\bf eo\-Truncated\-Select\-Many$<$ EOT $>$} (Eo\-Truncated\-Select\-Many selects many individuals using {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} as it's mechanism )}{\pageref{classeo_truncated_select_many}}{}
+\item\contentsline{section}{{\bf eo\-Truncated\-Select\-One$<$ EOT $>$} (Eo\-Truncated\-Select\-One selects one individual using {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} as it's mechanism )}{\pageref{classeo_truncated_select_one}}{}
+\item\contentsline{section}{{\bf eo\-Truncate\-Split$<$ EOT $>$} (Deterministic truncation method using sort )}{\pageref{classeo_truncate_split}}{}
+\item\contentsline{section}{{\bf eo\-Trunc\-Select$<$ EOT $>$} (Eo\-Trunc\-Select selects individuals after truncating the population using {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} as it's mechanism )}{\pageref{classeo_trunc_select}}{}
+\item\contentsline{section}{{\bf eo\-UBit\-Xover$<$ Chrom $>$} (Eo\-UBit\-Xover --$>$ classic Uniform crossover )}{\pageref{classeo_u_bit_xover}}{}
+\item\contentsline{section}{{\bf eo\-UF$<$ A1, R $>$} (Basic Unary Functor )}{\pageref{classeo_u_f}}{}
+\item\contentsline{section}{{\bf UF\_\-random\_\-generator$<$ T $>$} (Another class {\bf random\_\-generator}{\rm (p.\,\pageref{classrandom__generator})} that can be used in the STL random\_\-shuffle function (see {\bf eo\-Pop::shuffle}{\rm (p.\,\pageref{classeo_pop_a7})}): its operator() takes an unsigned argument m and must return an unsigned uniformly distributed in [0,m\} )}{\pageref{class_u_f__random__generator}}{}
+\item\contentsline{section}{{\bf eo\-Unary\-Functor\-Counter$<$ Unary\-Functor $>$} (Generic counter class that counts the number of times a unary function is used )}{\pageref{classeo_unary_functor_counter}}{}
+\item\contentsline{section}{{\bf uniform\_\-generator$<$ T $>$} (The class uniform\_\-generator can be used in the STL generate function to easily generate random floats and doubles either in [0, \_\-max) if only 1 value (\_\-max) is given (or none, as \_\-max defaults to 1.0) or in [\_\-min,\_\-max) if 2 values are given (\_\-min, \_\-max) )}{\pageref{classuniform__generator}}{}
+\item\contentsline{section}{{\bf eo\-Uniform\-Atom\-Exchange$<$ Atom $>$} (Uniform crossover - well, not really, efficient for Fixed\-Length )}{\pageref{classeo_uniform_atom_exchange}}{}
+\item\contentsline{section}{{\bf eo\-Uniform\-Gene\-Chooser$<$ EOT $>$} (Uniform choice of gene to delete )}{\pageref{classeo_uniform_gene_chooser}}{}
+\item\contentsline{section}{{\bf eo\-Uniform\-Generator$<$ T $>$} (The class eo\-Uniform can be used in the STL generate function to easily generate random floats and doubles )}{\pageref{classeo_uniform_generator}}{}
+\item\contentsline{section}{{\bf eo\-Uniform\-Init$<$ T $>$} (The class eo\-Uniform\-Init can be used in the STL apply function to easily randomize floats and doubles )}{\pageref{classeo_uniform_init}}{}
+\item\contentsline{section}{{\bf eo\-Uniform\-Mutation$<$ EOT $>$} (Eo\-Uniform\-Mutation --$>$ changes all values of the std::vector by uniform choice with range epsilon with probability p\_\-change per variable )}{\pageref{classeo_uniform_mutation}}{}
+\item\contentsline{section}{{\bf eo\-Updatable} (Eo\-Updatable is a generic class for adding updatation to an existing class Just says it has an update() method )}{\pageref{classeo_updatable}}{}
+\item\contentsline{section}{{\bf eo\-Updater} (Eo\-Updater is a generic procudere for updating whatever you want )}{\pageref{classeo_updater}}{}
+\item\contentsline{section}{{\bf eo\-Value\-Param$<$ Value\-Type $>$} (Eo\-Value\-Param$<$Value\-Type$>$: templatized derivation of {\bf eo\-Param}{\rm (p.\,\pageref{classeo_param})} )}{\pageref{classeo_value_param}}{}
+\item\contentsline{section}{{\bf eo\-Variable\-Pareto\-Traits} (Eo\-Variable\-Pareto\-Traits : an {\bf eo\-Pareto\-Fitness\-Traits}{\rm (p.\,\pageref{classeo_pareto_fitness_traits})} whose characteristics can be set at run-time (nb objectives and min/max's) Why bother? For didactical purposes (and EASEA implementation :-) )}{\pageref{classeo_variable_pareto_traits}}{}
+\item\contentsline{section}{{\bf eo\-Vector$<$ Fit\-T, Gene\-Type $>$} (Base class for fixed length chromosomes, just derives from {\bf EO}{\rm (p.\,\pageref{class_e_o})} and std::vector and redirects the smaller than operator to EO (fitness based comparison) )}{\pageref{classeo_vector}}{}
+\item\contentsline{section}{{\bf Virus\-Bit\-Flip$<$ Fit\-T $>$} (Virus\-Bit\-Flip --$>$ changes 1 bit )}{\pageref{class_virus_bit_flip}}{}
+\item\contentsline{section}{{\bf Virus\-Shift\-Mutation$<$ Fit\-T $>$} (Works for 1-bit virus; shifts the one to the right or left )}{\pageref{class_virus_shift_mutation}}{}
+\item\contentsline{section}{{\bf eo\-Vl\-Add\-Mutation$<$ EOT $>$} (Addition of a gene Is inserted at a random position - so can be applied to both order-dependent and order-independent )}{\pageref{classeo_vl_add_mutation}}{}
+\item\contentsline{section}{{\bf eo\-Vl\-Atom\-Exchange\-Quad\-Op$<$ EOT $>$} (Exchange Crossover using an Atom\-Exchange )}{\pageref{classeo_vl_atom_exchange_quad_op}}{}
+\item\contentsline{section}{{\bf eo\-Vl\-Del\-Mutation$<$ EOT $>$} (Deletion of a gene By default at a random position, but a \char`\"{}chooser\char`\"{} can be specified can of course be applied to both order-dependent and order-independent )}{\pageref{classeo_vl_del_mutation}}{}
+\item\contentsline{section}{{\bf eo\-Vl\-Uniform\-Bin\-Op$<$ EOT $>$} (Direct Uniform Exchange of genes for Variable Length, BINARY version )}{\pageref{classeo_vl_uniform_bin_op}}{}
+\item\contentsline{section}{{\bf eo\-Vl\-Uniform\-Quad\-Op$<$ EOT $>$} (Direct Uniform Exchange of genes (obsolete, already :-) stays there for historical reasons )}{\pageref{classeo_vl_uniform_quad_op}}{}
+\item\contentsline{section}{{\bf eo\-Weak\-Elitist\-Replacement$<$ EOT $>$} (Eo\-Weak\-Elitist\-Replacement: a wrapper for other replacement procedures )}{\pageref{classeo_weak_elitist_replacement}}{}
+\end{CompactList}
diff --git a/trunk/paradiseo-eo/doc/latex/class_biased_node_selector.eps b/trunk/paradiseo-eo/doc/latex/class_biased_node_selector.eps
new file mode 100644
index 000000000..1fa6ecf54
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/class_biased_node_selector.eps
@@ -0,0 +1,197 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 296.296
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.6875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 2 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(BiasedNodeSelector) cw
+(NodeSelector) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (BiasedNodeSelector) 0 0 box
+ (NodeSelector) 0 1 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
diff --git a/trunk/paradiseo-eo/doc/latex/class_biased_node_selector.tex b/trunk/paradiseo-eo/doc/latex/class_biased_node_selector.tex
new file mode 100644
index 000000000..872835c7c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/class_biased_node_selector.tex
@@ -0,0 +1,41 @@
+\section{Biased\-Node\-Selector Class Reference}
+\label{class_biased_node_selector}\index{BiasedNodeSelector@{BiasedNodeSelector}}
+A node selector that does a specified number of rounds ignoring terminals.  
+
+
+{\tt \#include $<$Node\-Selector.h$>$}
+
+Inheritance diagram for Biased\-Node\-Selector::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2cm]{class_biased_node_selector}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf Biased\-Node\-Selector} (unsigned n)\label{class_biased_node_selector_a1}
+
+\item 
+Node\-Selection {\bf select\_\-node} (Sym sym) const \label{class_biased_node_selector_a2}
+
+\end{CompactItemize}
+\subsection*{Public Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf n\-Rounds}\label{class_biased_node_selector_o0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+A node selector that does a specified number of rounds ignoring terminals. 
+
+
+
+Definition at line 55 of file Node\-Selector.h.
+
+The documentation for this class was generated from the following files:\begin{CompactItemize}
+\item 
+Node\-Selector.h\item 
+Node\-Selector.cpp\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/class_cov.tex b/trunk/paradiseo-eo/doc/latex/class_cov.tex
new file mode 100644
index 000000000..9962c296b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/class_cov.tex
@@ -0,0 +1,49 @@
+\section{Cov Class Reference}
+\label{class_cov}\index{Cov@{Cov}}
+Single covariance between two variates.  
+
+
+{\tt \#include $<$stats.h$>$}
+
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+void {\bf update} (double a, double b)\label{class_cov_a1}
+
+\item 
+double {\bf get\_\-meana} () const \label{class_cov_a2}
+
+\item 
+double {\bf get\_\-meanb} () const \label{class_cov_a3}
+
+\item 
+double {\bf get\_\-cov} () const \label{class_cov_a4}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf n}\label{class_cov_r0}
+
+\item 
+double {\bf meana}\label{class_cov_r1}
+
+\item 
+double {\bf meanb}\label{class_cov_r2}
+
+\item 
+double {\bf sumcov}\label{class_cov_r3}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Single covariance between two variates. 
+
+
+
+Definition at line 58 of file stats.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+stats.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/class_e_o.eps b/trunk/paradiseo-eo/doc/latex/class_e_o.eps
new file mode 100644
index 000000000..63a01da93
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/class_e_o.eps
@@ -0,0 +1,209 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 337.079
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.48333 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 3 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(EO< F >) cw
+(eoObject) cw
+(eoPersistent) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (EO< F >) 0.5 0 box
+ (eoObject) 0 1 box
+ (eoPersistent) 1 1 box
+ (eoPrintable) 1 2 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+0 1 1 conn
+solid
+1 0 1 in
+solid
+1 1 1 in
+solid
+0 1 1 out
+solid
+1 1 2 in
diff --git a/trunk/paradiseo-eo/doc/latex/class_e_o.tex b/trunk/paradiseo-eo/doc/latex/class_e_o.tex
new file mode 100644
index 000000000..c2dd35aaa
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/class_e_o.tex
@@ -0,0 +1,244 @@
+\section{EO$<$ F $>$ Class Template Reference}
+\label{class_e_o}\index{EO@{EO}}
+EO is a base class for evolvable objects, that is, the subjects of evolution.  
+
+
+{\tt \#include $<$EO.h$>$}
+
+Inheritance diagram for EO$<$ F $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3cm]{class_e_o}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef F {\bf Fitness}\label{class_e_o_w0}
+
+\item 
+typedef Traits {\bf fitness\_\-traits}\label{class_e_o_w1}
+
+\item 
+typedef Traits::storage\_\-type {\bf storage\_\-type}\label{class_e_o_w2}
+
+\item 
+typedef Traits::performance\_\-type {\bf performance\_\-type}\label{class_e_o_w3}
+
+\item 
+typedef Traits::worth\_\-type {\bf worth\_\-type}\label{class_e_o_w4}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf EO} ()
+\begin{CompactList}\small\item\em Default constructor. \item\end{CompactList}\item 
+virtual {\bf $\sim$EO} ()\label{class_e_o_a1}
+
+\begin{CompactList}\small\item\em Virtual dtor. \item\end{CompactList}\item 
+Fitness {\bf fitness} () const \label{class_e_o_a2}
+
+\begin{CompactList}\small\item\em Return fitness value. \item\end{CompactList}\item 
+void {\bf invalidate} ()\label{class_e_o_a3}
+
+\item 
+void {\bf fitness} (const Fitness \&\_\-fitness)
+\begin{CompactList}\small\item\em Set fitness. \item\end{CompactList}\item 
+bool {\bf invalid} () const 
+\begin{CompactList}\small\item\em Return true If fitness value is invalid, false otherwise. \item\end{CompactList}\item 
+bool {\bf operator$<$} (const {\bf EO} \&\_\-eo2) const 
+\begin{CompactList}\small\item\em Returns true if. \item\end{CompactList}\item 
+bool {\bf operator$>$} (const {\bf EO} \&\_\-eo2) const \label{class_e_o_a7}
+
+\item 
+void {\bf fitness} (performance\_\-type perf)\label{class_e_o_a9}
+
+\item 
+void {\bf performance} (performance\_\-type perf)\label{class_e_o_a10}
+
+\item 
+performance\_\-type {\bf performance} (void) const \label{class_e_o_a11}
+
+\item 
+void {\bf worth} (worth\_\-type worth)\label{class_e_o_a12}
+
+\item 
+worth\_\-type {\bf worth} (void) const \label{class_e_o_a13}
+
+\item 
+worth\_\-type {\bf fitness} (void) const \label{class_e_o_a14}
+
+\item 
+void {\bf invalidate} (void)\label{class_e_o_a15}
+
+\item 
+void {\bf invalidate\_\-worth} (void)\label{class_e_o_a16}
+
+\item 
+bool {\bf operator$<$} (const EO$<$ Fitness, Traits $>$ \&other) const \label{class_e_o_a17}
+
+\item 
+bool {\bf operator$>$} (const EO$<$ Fitness, Traits $>$ \&other) const \label{class_e_o_a18}
+
+\end{CompactItemize}
+{\bf }\par
+\begin{CompactItemize}
+\item 
+virtual std::string {\bf class\-Name} () const 
+\begin{CompactList}\small\item\em Return the class id. \item\end{CompactList}\item 
+virtual void {\bf read\-From} (std::istream \&\_\-is)
+\begin{CompactList}\small\item\em Read object.$\backslash$ Calls base class, just in case that one had something to do. \item\end{CompactList}\item 
+virtual void {\bf print\-On} (std::ostream \&\_\-os) const 
+\begin{CompactList}\small\item\em Write object. \item\end{CompactList}\end{CompactItemize}
+
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+Fitness {\bf rep\-Fitness}\label{class_e_o_r0}
+
+\item 
+bool {\bf invalid\-Fitness}\label{class_e_o_r1}
+
+\item 
+bool {\bf valid\_\-performance}\label{class_e_o_r2}
+
+\item 
+bool {\bf valid\_\-worth}\label{class_e_o_r3}
+
+\item 
+storage\_\-type {\bf rep\_\-fitness}\label{class_e_o_r4}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class F$>$ class EO$<$ F $>$}
+
+EO is a base class for evolvable objects, that is, the subjects of evolution. 
+
+EOs have only got a fitness, which at the same time needs to be only an object with the operation less than ($<$) defined. Fitness says how good is the object; evolution or change of these objects is left to the genetic operators. A fitness less than another means a worse fitness, in whatever the context; thus, fitness is always maximized; although it can be minimized with a proper definition of the $<$ operator. The fitness object must have, besides an void ctor, a copy ctor. 
+
+
+
+Definition at line 44 of file EO.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{EO@{EO}!EO@{EO}}
+\index{EO@{EO}!EO@{EO}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class F$>$ {\bf EO}$<$ F $>$::{\bf EO} ()\hspace{0.3cm}{\tt  [inline]}}\label{class_e_o_a0}
+
+
+Default constructor. 
+
+Fitness must have a ctor which takes 0 as a value; we can not use void ctors here since default types like float have no void initializer. VC++ allows it, but gcc does not 
+
+Definition at line 54 of file EO.h.
+
+\subsection{Member Function Documentation}
+\index{EO@{EO}!fitness@{fitness}}
+\index{fitness@{fitness}!EO@{EO}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class F$>$ void {\bf EO}$<$ F $>$::fitness (const Fitness \& {\em \_\-fitness})\hspace{0.3cm}{\tt  [inline]}}\label{class_e_o_a4}
+
+
+Set fitness. 
+
+At the same time, validates it. \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-fitness}]New fitness value. \end{description}
+\end{Desc}
+
+
+Definition at line 72 of file EO.h.\index{EO@{EO}!invalid@{invalid}}
+\index{invalid@{invalid}!EO@{EO}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class F$>$ bool {\bf EO}$<$ F $>$::invalid () const\hspace{0.3cm}{\tt  [inline]}}\label{class_e_o_a5}
+
+
+Return true If fitness value is invalid, false otherwise. 
+
+\begin{Desc}
+\item[Returns:]true If fitness is invalid. \end{Desc}
+
+
+Definition at line 81 of file EO.h.
+
+Referenced by EO$<$ Py\-Fitness $>$::fitness(), eo\-One\-Max\-Eval\-Func$<$ EOT $>$::operator()(), eo\-One\-Fifth\-Mutation$<$ EOT $>$::operator()(), eo\-Eval\-Func\-Ptr$<$ EOT, Fit\-T, Function\-Arg $>$::operator()(), eo\-Eval\-Func\-Counter$<$ EOT $>$::operator()(), and EO$<$ Py\-Fitness $>$::print\-On().\index{EO@{EO}!operator<@{operator$<$}}
+\index{operator<@{operator$<$}!EO@{EO}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class F$>$ bool {\bf EO}$<$ F $>$::operator$<$ (const {\bf EO}$<$ F $>$ \& {\em \_\-eo2}) const\hspace{0.3cm}{\tt  [inline]}}\label{class_e_o_a6}
+
+
+Returns true if. 
+
+\begin{Desc}
+\item[Returns:]true if the fitness is higher \end{Desc}
+
+
+Definition at line 86 of file EO.h.
+
+Referenced by eo\-Vector$<$ Fit\-T, bool $>$::operator$<$().\index{EO@{EO}!className@{className}}
+\index{className@{className}!EO@{EO}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class F$>$ virtual std::string {\bf EO}$<$ F $>$::class\-Name (void) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{class_e_o_z10_0}
+
+
+Return the class id. 
+
+\begin{Desc}
+\item[Returns:]the class name as a std::string \end{Desc}
+
+
+Implements {\bf eo\-Object} {\rm (p.\,\pageref{classeo_object_a1})}.
+
+Reimplemented in {\bf eo\-Es\-Full$<$ Fit $>$} {\rm (p.\,\pageref{classeo_es_full_a1})}, {\bf eo\-Es\-Simple$<$ Fit $>$} {\rm (p.\,\pageref{classeo_es_simple_a1})}, {\bf eo\-Es\-Stdev$<$ Fit $>$} {\rm (p.\,\pageref{classeo_es_stdev_a1})}, {\bf eo\-Real$<$ Fit\-T $>$} {\rm (p.\,\pageref{classeo_real_a1})}, {\bf eo\-Bit$<$ Fit\-T $>$} {\rm (p.\,\pageref{classeo_bit_a1})}, {\bf eo\-Parse\-Tree$<$ FType, Node $>$} {\rm (p.\,\pageref{classeo_parse_tree_a4})}, {\bf eo\-String$<$ fitness\-T $>$} {\rm (p.\,\pageref{classeo_string_z26_0})}, and {\bf eo\-One\-Max$<$ Fit\-T $>$} {\rm (p.\,\pageref{classeo_one_max_a2})}.
+
+Definition at line 95 of file EO.h.\index{EO@{EO}!readFrom@{readFrom}}
+\index{readFrom@{readFrom}!EO@{EO}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class F$>$ virtual void {\bf EO}$<$ F $>$::read\-From (std::istream \& {\em \_\-is})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{class_e_o_z10_1}
+
+
+Read object.$\backslash$ Calls base class, just in case that one had something to do. 
+
+The read and print methods should be compatible and have the same format. In principle, format is \char`\"{}plain\char`\"{}: they just print a number \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-is}]a std::istream. \end{description}
+\end{Desc}
+\begin{Desc}
+\item[Exceptions:]
+\begin{description}
+\item[{\em runtime\_\-std::exception}]If a valid object can't be read. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Persistent} {\rm (p.\,\pageref{classeo_persistent_a1})}.
+
+Reimplemented in {\bf eo\-Vector$<$ Fit\-T, Gene\-Type $>$} {\rm (p.\,\pageref{classeo_vector_a5})}, {\bf eo\-Es\-Full$<$ Fit $>$} {\rm (p.\,\pageref{classeo_es_full_a3})}, {\bf eo\-Es\-Simple$<$ Fit $>$} {\rm (p.\,\pageref{classeo_es_simple_a3})}, {\bf eo\-Es\-Stdev$<$ Fit $>$} {\rm (p.\,\pageref{classeo_es_stdev_a3})}, {\bf eo\-Bit$<$ Fit\-T $>$} {\rm (p.\,\pageref{classeo_bit_a3})}, {\bf eo\-Parse\-Tree$<$ FType, Node $>$} {\rm (p.\,\pageref{classeo_parse_tree_a6})}, {\bf eo\-External\-EO$<$ Fit, External $>$} {\rm (p.\,\pageref{classeo_external_e_o_a3})}, {\bf eo\-Vector$<$ Fit, double $>$} {\rm (p.\,\pageref{classeo_vector_a5})}, {\bf eo\-Vector$<$ Fit\-T, double $>$} {\rm (p.\,\pageref{classeo_vector_a5})}, and {\bf eo\-Vector$<$ Fit\-T, bool $>$} {\rm (p.\,\pageref{classeo_vector_a5})}.
+
+Definition at line 105 of file EO.h.
+
+Referenced by eo\-Vector$<$ Fit\-T, bool $>$::read\-From(), eo\-Pop$<$ Dummy $>$::read\-From(), eo\-Parse\-Tree$<$ FType, Node $>$::read\-From(), eo\-One\-Max$<$ Fit\-T $>$::read\-From(), eo\-External\-EO$<$ Fit, External $>$::read\-From(), and eo\-Bit$<$ Fit\-T $>$::read\-From().\index{EO@{EO}!printOn@{printOn}}
+\index{printOn@{printOn}!EO@{EO}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class F$>$ virtual void {\bf EO}$<$ F $>$::print\-On (std::ostream \& {\em \_\-os}) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{class_e_o_z10_2}
+
+
+Write object. 
+
+Called print\-On since it prints the object \_\-on\_\- a stream. \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-os}]A std::ostream. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Printable} {\rm (p.\,\pageref{classeo_printable_a1})}.
+
+Reimplemented in {\bf eo\-Vector$<$ Fit\-T, Gene\-Type $>$} {\rm (p.\,\pageref{classeo_vector_a4})}, {\bf eo\-Es\-Full$<$ Fit $>$} {\rm (p.\,\pageref{classeo_es_full_a2})}, {\bf eo\-Es\-Simple$<$ Fit $>$} {\rm (p.\,\pageref{classeo_es_simple_a2})}, {\bf eo\-Es\-Stdev$<$ Fit $>$} {\rm (p.\,\pageref{classeo_es_stdev_a2})}, {\bf eo\-Bit$<$ Fit\-T $>$} {\rm (p.\,\pageref{classeo_bit_a2})}, {\bf eo\-Parse\-Tree$<$ FType, Node $>$} {\rm (p.\,\pageref{classeo_parse_tree_a5})}, {\bf eo\-External\-EO$<$ Fit, External $>$} {\rm (p.\,\pageref{classeo_external_e_o_a4})}, {\bf eo\-String$<$ fitness\-T $>$} {\rm (p.\,\pageref{classeo_string_z24_1})}, {\bf Dummy} {\rm (p.\,\pageref{struct_dummy_a1})}, {\bf Dummy} {\rm (p.\,\pageref{struct_dummy_a2})}, {\bf Dummy} {\rm (p.\,\pageref{struct_dummy_a3})}, {\bf Dummy} {\rm (p.\,\pageref{struct_dummy_a4})}, {\bf eo\-Vector$<$ Fit, double $>$} {\rm (p.\,\pageref{classeo_vector_a4})}, {\bf eo\-Vector$<$ Fit\-T, double $>$} {\rm (p.\,\pageref{classeo_vector_a4})}, and {\bf eo\-Vector$<$ Fit\-T, bool $>$} {\rm (p.\,\pageref{classeo_vector_a4})}.
+
+Definition at line 129 of file EO.h.
+
+Referenced by Dummy::print\-On(), eo\-Vector$<$ Fit\-T, bool $>$::print\-On(), eo\-String$<$ fitness\-T $>$::print\-On(), eo\-Parse\-Tree$<$ FType, Node $>$::print\-On(), eo\-One\-Max$<$ Fit\-T $>$::print\-On(), eo\-External\-EO$<$ Fit, External $>$::print\-On(), and eo\-Bit$<$ Fit\-T $>$::print\-On().
+
+The documentation for this class was generated from the following files:\begin{CompactItemize}
+\item 
+EO.h\item 
+fitness\_\-traits.cpp\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/class_mem_pool.tex b/trunk/paradiseo-eo/doc/latex/class_mem_pool.tex
new file mode 100644
index 000000000..e293a5f55
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/class_mem_pool.tex
@@ -0,0 +1,53 @@
+\section{Mem\-Pool Class Reference}
+\label{class_mem_pool}\index{MemPool@{MemPool}}
+Pool allocator for the subtree and parse tree classes (homebrew and not compliant to ANSI allocator requirements) (c) copyright Maarten Keijzer 1999, 2000.  
+
+
+{\tt \#include $<$node\_\-pool.h$>$}
+
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf Mem\-Pool} (unsigned int sz)\label{class_mem_pool_a0}
+
+\item 
+void $\ast$ {\bf allocate} ()\label{class_mem_pool_a2}
+
+\item 
+void {\bf deallocate} (void $\ast$b)\label{class_mem_pool_a3}
+
+\end{CompactItemize}
+\subsection*{Private Member Functions}
+\begin{CompactItemize}
+\item 
+void {\bf grow} ()\label{class_mem_pool_d0}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+Chunk $\ast$ {\bf chunks}\label{class_mem_pool_r0}
+
+\item 
+const unsigned int {\bf esize}\label{class_mem_pool_r1}
+
+\item 
+Link $\ast$ {\bf head}\label{class_mem_pool_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Pool allocator for the subtree and parse tree classes (homebrew and not compliant to ANSI allocator requirements) (c) copyright Maarten Keijzer 1999, 2000. 
+
+Permission to copy, use, modify, sell and distribute this software is granted provided this copyright notice appears in all copies. This software is provided \char`\"{}as is\char`\"{} without express or implied warranty, and with no claim as to its suitability for any purpose.
+
+Permission to modify the code and to distribute modified code is granted, provided the above notices are retained, and a notice that the code was modified is included with the above copyright notice. 
+
+
+
+Definition at line 21 of file node\_\-pool.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+node\_\-pool.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/class_minimizing_traits.eps b/trunk/paradiseo-eo/doc/latex/class_minimizing_traits.eps
new file mode 100644
index 000000000..a146992c9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/class_minimizing_traits.eps
@@ -0,0 +1,197 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 281.69
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.775 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 2 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(MinimizingTraits) cw
+(eoParetoFitnessTraits) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (MinimizingTraits) 0 0 box
+ (eoParetoFitnessTraits) 0 1 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
diff --git a/trunk/paradiseo-eo/doc/latex/class_minimizing_traits.tex b/trunk/paradiseo-eo/doc/latex/class_minimizing_traits.tex
new file mode 100644
index 000000000..44705ab69
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/class_minimizing_traits.tex
@@ -0,0 +1,29 @@
+\section{Minimizing\-Traits Class Reference}
+\label{class_minimizing_traits}\index{MinimizingTraits@{MinimizingTraits}}
+test program for Pareto Fitness  
+
+
+Inheritance diagram for Minimizing\-Traits::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2cm]{class_minimizing_traits}
+\end{center}
+\end{figure}
+\subsection*{Static Public Member Functions}
+\begin{CompactItemize}
+\item 
+bool {\bf maximizing} (int)\label{class_minimizing_traits_e0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+test program for Pareto Fitness 
+
+
+
+Definition at line 36 of file t-eo\-Pareto\-Fitness.cpp.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+t-eo\-Pareto\-Fitness.cpp\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/class_node_selector.eps b/trunk/paradiseo-eo/doc/latex/class_node_selector.eps
new file mode 100644
index 000000000..57bec7947
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/class_node_selector.eps
@@ -0,0 +1,203 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 140.845
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.55 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 2 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(NodeSelector) cw
+(BiasedNodeSelector) cw
+(RandomNodeSelector) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (NodeSelector) 0.5 1 box
+ (BiasedNodeSelector) 0 0 box
+ (RandomNodeSelector) 1 0 box
+
+% ----- relations -----
+
+solid
+1 0.5 0.25 out
+solid
+0 1 1 conn
+solid
+0 0 0.75 in
+solid
+0 1 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/class_node_selector.tex b/trunk/paradiseo-eo/doc/latex/class_node_selector.tex
new file mode 100644
index 000000000..c5bb9fa25
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/class_node_selector.tex
@@ -0,0 +1,31 @@
+\section{Node\-Selector Class Reference}
+\label{class_node_selector}\index{NodeSelector@{NodeSelector}}
+Base class for selecting nodes.  
+
+
+{\tt \#include $<$Node\-Selector.h$>$}
+
+Inheritance diagram for Node\-Selector::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2cm]{class_node_selector}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual Node\-Selection {\bf select\_\-node} (Sym sym) const =0\label{class_node_selector_a1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Base class for selecting nodes. 
+
+
+
+Definition at line 24 of file Node\-Selector.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+Node\-Selector.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/class_random_node_selector.eps b/trunk/paradiseo-eo/doc/latex/class_random_node_selector.eps
new file mode 100644
index 000000000..0fdf86204
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/class_random_node_selector.eps
@@ -0,0 +1,197 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 281.69
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.775 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 2 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(RandomNodeSelector) cw
+(NodeSelector) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (RandomNodeSelector) 0 0 box
+ (NodeSelector) 0 1 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
diff --git a/trunk/paradiseo-eo/doc/latex/class_random_node_selector.tex b/trunk/paradiseo-eo/doc/latex/class_random_node_selector.tex
new file mode 100644
index 000000000..05fe8e310
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/class_random_node_selector.tex
@@ -0,0 +1,32 @@
+\section{Random\-Node\-Selector Class Reference}
+\label{class_random_node_selector}\index{RandomNodeSelector@{RandomNodeSelector}}
+Select nodes uniformly.  
+
+
+{\tt \#include $<$Node\-Selector.h$>$}
+
+Inheritance diagram for Random\-Node\-Selector::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2cm]{class_random_node_selector}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+Node\-Selection {\bf select\_\-node} (Sym sym) const \label{class_random_node_selector_a0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Select nodes uniformly. 
+
+
+
+Definition at line 49 of file Node\-Selector.h.
+
+The documentation for this class was generated from the following files:\begin{CompactItemize}
+\item 
+Node\-Selector.h\item 
+Node\-Selector.cpp\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/class_u_f__random__generator.tex b/trunk/paradiseo-eo/doc/latex/class_u_f__random__generator.tex
new file mode 100644
index 000000000..6ac2ca7e6
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/class_u_f__random__generator.tex
@@ -0,0 +1,36 @@
+\section{UF\_\-random\_\-generator$<$ T $>$ Class Template Reference}
+\label{class_u_f__random__generator}\index{UF_random_generator@{UF\_\-random\_\-generator}}
+Another class {\bf random\_\-generator}{\rm (p.\,\pageref{classrandom__generator})} that can be used in the STL random\_\-shuffle function (see {\bf eo\-Pop::shuffle}{\rm (p.\,\pageref{classeo_pop_a7})}): its operator() takes an unsigned argument m and must return an unsigned uniformly distributed in [0,m\}.  
+
+
+{\tt \#include $<$rnd\_\-generators.h$>$}
+
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf UF\_\-random\_\-generator} ({\bf eo\-Rng} \&\_\-rng=rng)\label{class_u_f__random__generator_a0}
+
+\item 
+T {\bf operator()} (T \_\-t)\label{class_u_f__random__generator_a1}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Rng} \& {\bf random}\label{class_u_f__random__generator_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class T = uint32\_\-t$>$ class UF\_\-random\_\-generator$<$ T $>$}
+
+Another class {\bf random\_\-generator}{\rm (p.\,\pageref{classrandom__generator})} that can be used in the STL random\_\-shuffle function (see {\bf eo\-Pop::shuffle}{\rm (p.\,\pageref{classeo_pop_a7})}): its operator() takes an unsigned argument m and must return an unsigned uniformly distributed in [0,m\}. 
+
+
+
+Definition at line 121 of file rnd\_\-generators.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+rnd\_\-generators.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/class_virus_bit_flip.eps b/trunk/paradiseo-eo/doc/latex/class_virus_bit_flip.eps
new file mode 100644
index 000000000..a9bc9d2fe
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/class_virus_bit_flip.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 100.629
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.96875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(VirusBitFlip< FitT >) cw
+(eoMonOp< eoVirus< FitT > >) cw
+(eoOp< eoVirus< FitT > >) cw
+(eoUF< eoVirus< FitT > &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< eoVirus< FitT > &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (VirusBitFlip< FitT >) 0.5 0 box
+ (eoMonOp< eoVirus< FitT > >) 0.5 1 box
+ (eoOp< eoVirus< FitT > >) 0 2 box
+ (eoUF< eoVirus< FitT > &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< eoVirus< FitT > &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/class_virus_bit_flip.tex b/trunk/paradiseo-eo/doc/latex/class_virus_bit_flip.tex
new file mode 100644
index 000000000..2272ffa0a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/class_virus_bit_flip.tex
@@ -0,0 +1,54 @@
+\section{Virus\-Bit\-Flip$<$ Fit\-T $>$ Class Template Reference}
+\label{class_virus_bit_flip}\index{VirusBitFlip@{VirusBitFlip}}
+Virus\-Bit\-Flip --$>$ changes 1 bit.  
+
+
+{\tt \#include $<$Virus\-Op.h$>$}
+
+Inheritance diagram for Virus\-Bit\-Flip$<$ Fit\-T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.81761cm]{class_virus_bit_flip}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual std::string {\bf class\-Name} () const \label{class_virus_bit_flip_a0}
+
+\begin{CompactList}\small\item\em The class name. \item\end{CompactList}\item 
+bool {\bf operator()} (eo\-Virus$<$ {\bf Fit\-T} $>$ \&\_\-chrom)
+\begin{CompactList}\small\item\em Change one bit. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Fit\-T$>$ class Virus\-Bit\-Flip$<$ Fit\-T $>$}
+
+Virus\-Bit\-Flip --$>$ changes 1 bit. 
+
+
+
+Definition at line 40 of file Virus\-Op.h.
+
+\subsection{Member Function Documentation}
+\index{VirusBitFlip@{Virus\-Bit\-Flip}!operator()@{operator()}}
+\index{operator()@{operator()}!VirusBitFlip@{Virus\-Bit\-Flip}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Fit\-T$>$ bool {\bf Virus\-Bit\-Flip}$<$ {\bf Fit\-T} $>$::operator() (eo\-Virus$<$ {\bf Fit\-T} $>$ \& {\em \_\-chrom})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{class_virus_bit_flip_a1}
+
+
+Change one bit. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em chrom}]The cromosome which one bit is going to be changed. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-UF$<$ eo\-Virus$<$ Fit\-T $>$ \&, bool $>$} {\rm (p.\,\pageref{classeo_u_f_a1})}.
+
+Definition at line 49 of file Virus\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+Virus\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/class_virus_shift_mutation.eps b/trunk/paradiseo-eo/doc/latex/class_virus_shift_mutation.eps
new file mode 100644
index 000000000..ed3005e6e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/class_virus_shift_mutation.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 100.629
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.96875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(VirusShiftMutation< FitT >) cw
+(eoMonOp< eoVirus< FitT > >) cw
+(eoOp< eoVirus< FitT > >) cw
+(eoUF< eoVirus< FitT > &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< eoVirus< FitT > &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (VirusShiftMutation< FitT >) 0.5 0 box
+ (eoMonOp< eoVirus< FitT > >) 0.5 1 box
+ (eoOp< eoVirus< FitT > >) 0 2 box
+ (eoUF< eoVirus< FitT > &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< eoVirus< FitT > &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/class_virus_shift_mutation.tex b/trunk/paradiseo-eo/doc/latex/class_virus_shift_mutation.tex
new file mode 100644
index 000000000..8c44fb7d3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/class_virus_shift_mutation.tex
@@ -0,0 +1,57 @@
+\section{Virus\-Shift\-Mutation$<$ Fit\-T $>$ Class Template Reference}
+\label{class_virus_shift_mutation}\index{VirusShiftMutation@{VirusShiftMutation}}
+Works for 1-bit virus; shifts the one to the right or left.  
+
+
+{\tt \#include $<$Virus\-Op.h$>$}
+
+Inheritance diagram for Virus\-Shift\-Mutation$<$ Fit\-T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.81761cm]{class_virus_shift_mutation}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf Virus\-Shift\-Mutation} ()\label{class_virus_shift_mutation_a0}
+
+\begin{CompactList}\small\item\em Ctor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{class_virus_shift_mutation_a1}
+
+\begin{CompactList}\small\item\em The class name. \item\end{CompactList}\item 
+bool {\bf operator()} (eo\-Virus$<$ {\bf Fit\-T} $>$ \&\_\-chrom)
+\begin{CompactList}\small\item\em Change one bit. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Fit\-T$>$ class Virus\-Shift\-Mutation$<$ Fit\-T $>$}
+
+Works for 1-bit virus; shifts the one to the right or left. 
+
+
+
+Definition at line 86 of file Virus\-Op.h.
+
+\subsection{Member Function Documentation}
+\index{VirusShiftMutation@{Virus\-Shift\-Mutation}!operator()@{operator()}}
+\index{operator()@{operator()}!VirusShiftMutation@{Virus\-Shift\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Fit\-T$>$ bool {\bf Virus\-Shift\-Mutation}$<$ {\bf Fit\-T} $>$::operator() (eo\-Virus$<$ {\bf Fit\-T} $>$ \& {\em \_\-chrom})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{class_virus_shift_mutation_a2}
+
+
+Change one bit. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em chrom}]The cromosome which one bit is going to be changed. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-UF$<$ eo\-Virus$<$ Fit\-T $>$ \&, bool $>$} {\rm (p.\,\pageref{classeo_u_f_a1})}.
+
+Definition at line 99 of file Virus\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+Virus\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classboolean__generator.tex b/trunk/paradiseo-eo/doc/latex/classboolean__generator.tex
new file mode 100644
index 000000000..38ea794ee
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classboolean__generator.tex
@@ -0,0 +1,37 @@
+\section{boolean\_\-generator Class Reference}
+\label{classboolean__generator}\index{boolean_generator@{boolean\_\-generator}}
+The class boolean\_\-generator can be used in the STL generate function to easily generate random booleans with a specified bias.  
+
+
+{\tt \#include $<$rnd\_\-generators.h$>$}
+
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf boolean\_\-generator} (float \_\-bias=0.5, {\bf eo\-Rng} \&\_\-rng=rng)\label{classboolean__generator_a0}
+
+\item 
+bool {\bf operator()} (void)\label{classboolean__generator_a1}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+float {\bf bias}\label{classboolean__generator_r0}
+
+\item 
+{\bf eo\-Rng} \& {\bf gen}\label{classboolean__generator_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+The class boolean\_\-generator can be used in the STL generate function to easily generate random booleans with a specified bias. 
+
+
+
+Definition at line 70 of file rnd\_\-generators.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+rnd\_\-generators.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classd_matrix.tex b/trunk/paradiseo-eo/doc/latex/classd_matrix.tex
new file mode 100644
index 000000000..7ee408525
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classd_matrix.tex
@@ -0,0 +1,40 @@
+\section{d\-Matrix Class Reference}
+\label{classd_matrix}\index{dMatrix@{dMatrix}}
+A helper class for Sharing - to hold distances.  
+
+
+{\tt \#include $<$eo\-Sharing.h$>$}
+
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf d\-Matrix} (unsigned \_\-s)\label{classd_matrix_a0}
+
+\item 
+double {\bf operator()} (unsigned \_\-i, unsigned \_\-j) const \label{classd_matrix_a1}
+
+\begin{CompactList}\small\item\em simple accessor \item\end{CompactList}\item 
+double \& {\bf operator()} (unsigned \_\-i, unsigned \_\-j)\label{classd_matrix_a2}
+
+\begin{CompactList}\small\item\em reference - to set values \item\end{CompactList}\item 
+void {\bf print\-On} (std::ostream \&\_\-os)\label{classd_matrix_a3}
+
+\begin{CompactList}\small\item\em just in case \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf r\-Size}\label{classd_matrix_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+A helper class for Sharing - to hold distances. 
+
+
+
+Definition at line 37 of file eo\-Sharing.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Sharing.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo1_pt_bit_crossover.tex b/trunk/paradiseo-eo/doc/latex/classeo1_pt_bit_crossover.tex
new file mode 100644
index 000000000..fd1070886
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo1_pt_bit_crossover.tex
@@ -0,0 +1,17 @@
+\section{eo1Pt\-Bit\-Crossover Class Reference}
+\label{classeo1_pt_bit_crossover}\index{eo1PtBitCrossover@{eo1PtBitCrossover}}
+eo1Pt\-Bit\-Xover --$>$ classic 1-point crossover  
+
+
+{\tt \#include $<$ga/eo\-Bit\-Op.h$>$}
+
+
+
+\subsection{Detailed Description}
+eo1Pt\-Bit\-Xover --$>$ classic 1-point crossover 
+
+
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Bit\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_aged.tex b/trunk/paradiseo-eo/doc/latex/classeo_aged.tex
new file mode 100644
index 000000000..a572a1379
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_aged.tex
@@ -0,0 +1,121 @@
+\section{eo\-Aged$<$ Object $>$ Class Template Reference}
+\label{classeo_aged}\index{eoAged@{eoAged}}
+eo\-Age is a template class that adds an age to an object.$\backslash$ Requisites for template instantiation are that the object must admit a default ctor and a copy ctor.  
+
+
+{\tt \#include $<$eo\-Aged.h$>$}
+
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Aged} (const Object \&\_\-o)\label{classeo_aged_a0}
+
+\begin{CompactList}\small\item\em Main ctor from an already built Object. \item\end{CompactList}\item 
+{\bf eo\-Aged} (const {\bf eo\-Aged} \&\_\-a)\label{classeo_aged_a1}
+
+\begin{CompactList}\small\item\em Copy constructor. \item\end{CompactList}\item 
+virtual {\bf $\sim$eo\-Aged} ()\label{classeo_aged_a2}
+
+\begin{CompactList}\small\item\em Virtual dtor. They are needed in virtual class hierarchies. \item\end{CompactList}\item 
+unsigned long {\bf Age} () const \label{classeo_aged_a3}
+
+\begin{CompactList}\small\item\em returns the age of the object \item\end{CompactList}\item 
+const {\bf eo\-Aged} \& {\bf operator++} ()\label{classeo_aged_a4}
+
+\begin{CompactList}\small\item\em Increments age. \item\end{CompactList}\end{CompactItemize}
+\begin{Indent}{\bf Methods from eo\-Object}\par
+{\em read\-From and print\-On are directly inherited from eo1d }\begin{CompactItemize}
+\item 
+virtual std::string {\bf class\-Name} () const 
+\begin{CompactList}\small\item\em Return the class id. \item\end{CompactList}\item 
+virtual void {\bf read\-From} (istream \&\_\-is)
+\begin{CompactList}\small\item\em Read object. \item\end{CompactList}\item 
+virtual void {\bf print\-On} (ostream \&\_\-os) const 
+\begin{CompactList}\small\item\em Write object. \item\end{CompactList}\end{CompactItemize}
+\end{Indent}
+\subsection*{Private Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Aged} ()
+\begin{CompactList}\small\item\em Default Constructor. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned long {\bf age}\label{classeo_aged_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Object$>$ class eo\-Aged$<$ Object $>$}
+
+eo\-Age is a template class that adds an age to an object.$\backslash$ Requisites for template instantiation are that the object must admit a default ctor and a copy ctor. 
+
+The Object must be an {\bf eo\-Object}{\rm (p.\,\pageref{classeo_object})}, thus, it must have its methods: class\-Name, print\-On, read\-From. \begin{Desc}
+\item[See also:]{\bf eo\-Object}{\rm (p.\,\pageref{classeo_object})} \end{Desc}
+
+
+
+
+Definition at line 47 of file eo\-Aged.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoAged@{eo\-Aged}!eoAged@{eoAged}}
+\index{eoAged@{eoAged}!eoAged@{eo\-Aged}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Object$>$ {\bf eo\-Aged}$<$ Object $>$::{\bf eo\-Aged} ()\hspace{0.3cm}{\tt  [inline, private]}}\label{classeo_aged_d0}
+
+
+Default Constructor. 
+
+$\backslash$ It180s private so that it is not used anywhere; the right way of using this object is to create an Object and passing it to an aged by means of the copy ctor; that way it180s turned into an Aged object 
+
+Definition at line 103 of file eo\-Aged.h.
+
+\subsection{Member Function Documentation}
+\index{eoAged@{eo\-Aged}!className@{className}}
+\index{className@{className}!eoAged@{eo\-Aged}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Object$>$ virtual std::string {\bf eo\-Aged}$<$ Object $>$::class\-Name () const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_aged_z9_0}
+
+
+Return the class id. 
+
+This should be redefined in each class; but it's got code as an example of implementation. Only \char`\"{}leaf\char`\"{} classes can be non-virtual. 
+
+Definition at line 74 of file eo\-Aged.h.\index{eoAged@{eo\-Aged}!readFrom@{readFrom}}
+\index{readFrom@{readFrom}!eoAged@{eo\-Aged}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Object$>$ virtual void {\bf eo\-Aged}$<$ Object $>$::read\-From (istream \& {\em \_\-is})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_aged_z9_1}
+
+
+Read object. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-is}]A istream. \end{description}
+\end{Desc}
+\begin{Desc}
+\item[Exceptions:]
+\begin{description}
+\item[{\em runtime\_\-exception}]If a valid object can't be read. \end{description}
+\end{Desc}
+
+
+Definition at line 81 of file eo\-Aged.h.\index{eoAged@{eo\-Aged}!printOn@{printOn}}
+\index{printOn@{printOn}!eoAged@{eo\-Aged}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Object$>$ virtual void {\bf eo\-Aged}$<$ Object $>$::print\-On (ostream \& {\em \_\-os}) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_aged_z9_2}
+
+
+Write object. 
+
+It's called print\-On since it prints the object \_\-on\_\- a stream. \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-os}]A ostream. \end{description}
+\end{Desc}
+
+
+Definition at line 91 of file eo\-Aged.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Aged.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_algo.eps b/trunk/paradiseo-eo/doc/latex/classeo_algo.eps
new file mode 100644
index 000000000..d3dc78d78
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_algo.eps
@@ -0,0 +1,225 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 102.171
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.89375 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoAlgo< EOT >) cw
+(eoUF< eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< eoPop< EOT > &, void >) cw
+(eoCellularEasyEA< EOT >) cw
+(eoEasyEA< EOT >) cw
+(eoSGA< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoAlgo< EOT >) 1 1 box
+ (eoUF< eoPop< EOT > &, void >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< eoPop< EOT > &, void >) 1.5 3 box
+ (eoCellularEasyEA< EOT >) 0 0 box
+ (eoEasyEA< EOT >) 1 0 box
+ (eoSGA< EOT >) 2 0 box
+
+% ----- relations -----
+
+solid
+0 1 1 out
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
+solid
+1 1 0.25 out
+solid
+0 2 1 conn
+solid
+0 0 0.75 in
+solid
+0 1 0.75 in
+solid
+0 2 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_algo.tex b/trunk/paradiseo-eo/doc/latex/classeo_algo.tex
new file mode 100644
index 000000000..2e0dd8ddb
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_algo.tex
@@ -0,0 +1,29 @@
+\section{eo\-Algo$<$ EOT $>$ Class Template Reference}
+\label{classeo_algo}\index{eoAlgo@{eoAlgo}}
+This is a generic class for population-transforming algorithms.  
+
+
+{\tt \#include $<$eo\-Algo.h$>$}
+
+Inheritance diagram for eo\-Algo$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.86079cm]{classeo_algo}
+\end{center}
+\end{figure}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Algo$<$ EOT $>$}
+
+This is a generic class for population-transforming algorithms. 
+
+There is only one operator defined, which takes a population and does stuff to it. It needn't be a complete algorithm, can be also a step of an algorithm. This class just gives a common interface to linear population-transforming algorithms. 
+
+
+
+Definition at line 39 of file eo\-Algo.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Algo.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_arithmetic_crossover.tex b/trunk/paradiseo-eo/doc/latex/classeo_arithmetic_crossover.tex
new file mode 100644
index 000000000..23cdff75f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_arithmetic_crossover.tex
@@ -0,0 +1,17 @@
+\section{eo\-Arithmetic\-Crossover Class Reference}
+\label{classeo_arithmetic_crossover}\index{eoArithmeticCrossover@{eoArithmeticCrossover}}
+eo\-Hypercube\-Crossover --$>$ uniform choice in hypercube == arithmetical with different values for each coordinate  
+
+
+{\tt \#include $<$Tutorial/eo\-Real\-Op.h$>$}
+
+
+
+\subsection{Detailed Description}
+eo\-Hypercube\-Crossover --$>$ uniform choice in hypercube == arithmetical with different values for each coordinate 
+
+
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Real\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_assembled_fitness_average_stat.eps b/trunk/paradiseo-eo/doc/latex/classeo_assembled_fitness_average_stat.eps
new file mode 100644
index 000000000..046ba3a7d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_assembled_fitness_average_stat.eps
@@ -0,0 +1,233 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 112.613
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.44 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoAssembledFitnessAverageStat< EOT >) cw
+(eoStat< EOT, double >) cw
+(eoValueParam< double >) cw
+(eoStatBase< EOT >) cw
+(eoParam) cw
+(eoUF< const eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoAssembledFitnessAverageStat< EOT >) 0.5 0 box
+ (eoStat< EOT, double >) 0.5 1 box
+ (eoValueParam< double >) 0 2 box
+ (eoStatBase< EOT >) 1 2 box
+ (eoParam) 0 3 box
+ (eoUF< const eoPop< EOT > &, void >) 1 3 box
+ (eoFunctorBase) 0.5 4 box
+ (unary_function< const eoPop< EOT > &, void >) 1.5 4 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+0 1 3 out
+solid
+0.5 1.5 4 conn
+solid
+1 0.5 4 in
+solid
+1 1.5 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_assembled_fitness_average_stat.tex b/trunk/paradiseo-eo/doc/latex/classeo_assembled_fitness_average_stat.tex
new file mode 100644
index 000000000..aad261bbe
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_assembled_fitness_average_stat.tex
@@ -0,0 +1,50 @@
+\section{eo\-Assembled\-Fitness\-Average\-Stat$<$ EOT $>$ Class Template Reference}
+\label{classeo_assembled_fitness_average_stat}\index{eoAssembledFitnessAverageStat@{eoAssembledFitnessAverageStat}}
+Average fitness values of a population, where the fitness is of type eo\-Scalar\-Assembled\-Fitness.  
+
+
+{\tt \#include $<$eo\-Assembled\-Fitness\-Stat.h$>$}
+
+Inheritance diagram for eo\-Assembled\-Fitness\-Average\-Stat$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.15315cm]{classeo_assembled_fitness_average_stat}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Fitness {\bf Fitness}\label{classeo_assembled_fitness_average_stat_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Assembled\-Fitness\-Average\-Stat} (unsigned \_\-which\-Term=0, std::string \_\-description=\char`\"{}Average Fitness\char`\"{})\label{classeo_assembled_fitness_average_stat_a0}
+
+\item 
+virtual void {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_assembled_fitness_average_stat_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf which\-Fitness\-Term}\label{classeo_assembled_fitness_average_stat_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Assembled\-Fitness\-Average\-Stat$<$ EOT $>$}
+
+Average fitness values of a population, where the fitness is of type eo\-Scalar\-Assembled\-Fitness. 
+
+Specify in the constructor, for which fitness term (index) the average should be evaluated. Only values of object where the failed boolean = false is set are counted. 
+
+
+
+Definition at line 46 of file eo\-Assembled\-Fitness\-Stat.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Assembled\-Fitness\-Stat.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_assembled_fitness_best_stat.eps b/trunk/paradiseo-eo/doc/latex/classeo_assembled_fitness_best_stat.eps
new file mode 100644
index 000000000..2f4acd87c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_assembled_fitness_best_stat.eps
@@ -0,0 +1,233 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 112.613
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.44 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoAssembledFitnessBestStat< EOT >) cw
+(eoStat< EOT, double >) cw
+(eoValueParam< double >) cw
+(eoStatBase< EOT >) cw
+(eoParam) cw
+(eoUF< const eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoAssembledFitnessBestStat< EOT >) 0.5 0 box
+ (eoStat< EOT, double >) 0.5 1 box
+ (eoValueParam< double >) 0 2 box
+ (eoStatBase< EOT >) 1 2 box
+ (eoParam) 0 3 box
+ (eoUF< const eoPop< EOT > &, void >) 1 3 box
+ (eoFunctorBase) 0.5 4 box
+ (unary_function< const eoPop< EOT > &, void >) 1.5 4 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+0 1 3 out
+solid
+0.5 1.5 4 conn
+solid
+1 0.5 4 in
+solid
+1 1.5 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_assembled_fitness_best_stat.tex b/trunk/paradiseo-eo/doc/latex/classeo_assembled_fitness_best_stat.tex
new file mode 100644
index 000000000..52bf0c88d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_assembled_fitness_best_stat.tex
@@ -0,0 +1,50 @@
+\section{eo\-Assembled\-Fitness\-Best\-Stat$<$ EOT $>$ Class Template Reference}
+\label{classeo_assembled_fitness_best_stat}\index{eoAssembledFitnessBestStat@{eoAssembledFitnessBestStat}}
+Fitness values of best individuum in a population, where the fitness is of type eo\-Scalar\-Assembled\-Fitness.  
+
+
+{\tt \#include $<$eo\-Assembled\-Fitness\-Stat.h$>$}
+
+Inheritance diagram for eo\-Assembled\-Fitness\-Best\-Stat$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.15315cm]{classeo_assembled_fitness_best_stat}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Fitness {\bf Fitness}\label{classeo_assembled_fitness_best_stat_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Assembled\-Fitness\-Best\-Stat} (unsigned \_\-which\-Term=0, std::string \_\-description=\char`\"{}Best Fitness\char`\"{})\label{classeo_assembled_fitness_best_stat_a0}
+
+\item 
+virtual void {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_assembled_fitness_best_stat_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf which\-Fitness\-Term}\label{classeo_assembled_fitness_best_stat_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Assembled\-Fitness\-Best\-Stat$<$ EOT $>$}
+
+Fitness values of best individuum in a population, where the fitness is of type eo\-Scalar\-Assembled\-Fitness. 
+
+Specify in the constructor, for which fitness term (index) the value should be evaluated. 
+
+
+
+Definition at line 87 of file eo\-Assembled\-Fitness\-Stat.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Assembled\-Fitness\-Stat.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_atom_exchange.eps b/trunk/paradiseo-eo/doc/latex/classeo_atom_exchange.eps
new file mode 100644
index 000000000..12eac908e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_atom_exchange.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 149.813
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.3375 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoAtomExchange< Atom >) cw
+(eoBF< unsigned, Atom &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< unsigned, Atom &, bool >) cw
+(eoUniformAtomExchange< Atom >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoAtomExchange< Atom >) 0.5 1 box
+ (eoBF< unsigned, Atom &, bool >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< unsigned, Atom &, bool >) 1 3 box
+ (eoUniformAtomExchange< Atom >) 0.5 0 box
+
+% ----- relations -----
+
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+1 0.5 0.25 out
+solid
+0 0.5 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_atom_exchange.tex b/trunk/paradiseo-eo/doc/latex/classeo_atom_exchange.tex
new file mode 100644
index 000000000..58922b9d0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_atom_exchange.tex
@@ -0,0 +1,36 @@
+\section{eo\-Atom\-Exchange$<$ Atom $>$ Class Template Reference}
+\label{classeo_atom_exchange}\index{eoAtomExchange@{eoAtomExchange}}
+A helper class for choosing which genes to exchange.  
+
+
+{\tt \#include $<$eo\-Variable\-Length\-Crossover.h$>$}
+
+Inheritance diagram for eo\-Atom\-Exchange$<$ Atom $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_atom_exchange}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual void {\bf randomize} (unsigned int, unsigned int)\label{classeo_atom_exchange_a0}
+
+\begin{CompactList}\small\item\em a function to initlialize - to be called before every crossover \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const =0\label{classeo_atom_exchange_a1}
+
+\begin{CompactList}\small\item\em the inherited {\bf class\-Name()}{\rm (p.\,\pageref{classeo_atom_exchange_a1})} \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Atom$>$ class eo\-Atom\-Exchange$<$ Atom $>$}
+
+A helper class for choosing which genes to exchange. 
+
+
+
+Definition at line 41 of file eo\-Variable\-Length\-Crossover.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Variable\-Length\-Crossover.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_average_stat.eps b/trunk/paradiseo-eo/doc/latex/classeo_average_stat.eps
new file mode 100644
index 000000000..b6ba490e9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_average_stat.eps
@@ -0,0 +1,233 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 112.613
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.44 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoAverageStat< EOT >) cw
+(eoStat< EOT, EOT::Fitness >) cw
+(eoValueParam< EOT::Fitness >) cw
+(eoStatBase< EOT >) cw
+(eoParam) cw
+(eoUF< const eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoAverageStat< EOT >) 0.5 0 box
+ (eoStat< EOT, EOT::Fitness >) 0.5 1 box
+ (eoValueParam< EOT::Fitness >) 0 2 box
+ (eoStatBase< EOT >) 1 2 box
+ (eoParam) 0 3 box
+ (eoUF< const eoPop< EOT > &, void >) 1 3 box
+ (eoFunctorBase) 0.5 4 box
+ (unary_function< const eoPop< EOT > &, void >) 1.5 4 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+0 1 3 out
+solid
+0.5 1.5 4 conn
+solid
+1 0.5 4 in
+solid
+1 1.5 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_average_stat.tex b/trunk/paradiseo-eo/doc/latex/classeo_average_stat.tex
new file mode 100644
index 000000000..b8e4e7c4d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_average_stat.tex
@@ -0,0 +1,69 @@
+\section{eo\-Average\-Stat$<$ EOT $>$ Class Template Reference}
+\label{classeo_average_stat}\index{eoAverageStat@{eoAverageStat}}
+Average fitness of a population.  
+
+
+{\tt \#include $<$eo\-Stat.h$>$}
+
+Inheritance diagram for eo\-Average\-Stat$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.15315cm]{classeo_average_stat}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Fitness {\bf Fitness}\label{classeo_average_stat_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Average\-Stat} (std::string \_\-description=\char`\"{}Average Fitness\char`\"{})\label{classeo_average_stat_a0}
+
+\item 
+{\bf eo\-Average\-Stat} (double \_\-value, std::string \_\-desc)\label{classeo_average_stat_a1}
+
+\item 
+virtual void {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_average_stat_a2}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} (void) const \label{classeo_average_stat_a3}
+
+\end{CompactItemize}
+\subsection*{Static Public Member Functions}
+\begin{CompactItemize}
+\item 
+Fitness {\bf sum\-Fitness} (double \_\-sum, const {\bf EOT} \&\_\-eot)\label{classeo_average_stat_e0}
+
+\end{CompactItemize}
+\subsection*{Private Member Functions}
+\begin{CompactItemize}
+\item 
+template$<$class T$>$ void {\bf doit} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop, {\bf eo\-Pareto\-Fitness}$<$ T $>$)\label{classeo_average_stat_d0}
+
+\item 
+template$<$class T$>$ void {\bf doit} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop, T)\label{classeo_average_stat_d1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Average\-Stat$<$ EOT $>$}
+
+Average fitness of a population. 
+
+Fitness can be:\begin{itemize}
+\item double\item eo\-Minimizing\-Fitness or eo\-Maximizing\-Fitness\item {\bf eo\-Pareto\-Fitness}{\rm (p.\,\pageref{classeo_pareto_fitness})}: The average of each objective is evaluated.\end{itemize}
+
+
+( For {\bf eo\-Scalar\-Fitness\-Assembled}{\rm (p.\,\pageref{classeo_scalar_fitness_assembled})} user eo\-Assembled\-Fitness\-Stat classes.) 
+
+
+
+Definition at line 108 of file eo\-Stat.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Stat.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_b_f.eps b/trunk/paradiseo-eo/doc/latex/classeo_b_f.eps
new file mode 100644
index 000000000..e9cda4fcc
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_b_f.eps
@@ -0,0 +1,197 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 303.03
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.65 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 2 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoBF< A1, A2, R >) cw
+(eoFunctorBase) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoBF< A1, A2, R >) 0 0 box
+ (eoFunctorBase) 0 1 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_b_f.tex b/trunk/paradiseo-eo/doc/latex/classeo_b_f.tex
new file mode 100644
index 000000000..0855d389a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_b_f.tex
@@ -0,0 +1,44 @@
+\section{eo\-BF$<$ A1, A2, R $>$ Class Template Reference}
+\label{classeo_b_f}\index{eoBF@{eoBF}}
+Basic Binary Functor.  
+
+
+{\tt \#include $<$eo\-Functor.h$>$}
+
+Inheritance diagram for eo\-BF$<$ A1, A2, R $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2cm]{classeo_b_f}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual {\bf $\sim$eo\-BF} ()\label{classeo_b_f_a0}
+
+\begin{CompactList}\small\item\em virtual dtor here so there is no need to define it in derived classes \item\end{CompactList}\item 
+virtual R {\bf operator()} (A1, A2)=0\label{classeo_b_f_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Static Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Functor\-Base::binary\_\-function\_\-tag} {\bf functor\_\-category} ()\label{classeo_b_f_e0}
+
+\begin{CompactList}\small\item\em tag to identify a procedure in compile time function selection functor\_\-category \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class A1, class A2, class R$>$ class eo\-BF$<$ A1, A2, R $>$}
+
+Basic Binary Functor. 
+
+Derive from this class when defining any binary function. First template argument is result\_\-type, second is first\_\-argument\_\-type, third is second\_\-argument\_\-type. Argument and result types can be any type including void for result\_\-type 
+
+
+
+Definition at line 145 of file eo\-Functor.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Functor.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_best_fitness_stat.eps b/trunk/paradiseo-eo/doc/latex/classeo_best_fitness_stat.eps
new file mode 100644
index 000000000..d4da7096c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_best_fitness_stat.eps
@@ -0,0 +1,233 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 112.613
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.44 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoBestFitnessStat< EOT >) cw
+(eoStat< EOT, EOT::Fitness >) cw
+(eoValueParam< EOT::Fitness >) cw
+(eoStatBase< EOT >) cw
+(eoParam) cw
+(eoUF< const eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoBestFitnessStat< EOT >) 0.5 0 box
+ (eoStat< EOT, EOT::Fitness >) 0.5 1 box
+ (eoValueParam< EOT::Fitness >) 0 2 box
+ (eoStatBase< EOT >) 1 2 box
+ (eoParam) 0 3 box
+ (eoUF< const eoPop< EOT > &, void >) 1 3 box
+ (eoFunctorBase) 0.5 4 box
+ (unary_function< const eoPop< EOT > &, void >) 1.5 4 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+0 1 3 out
+solid
+0.5 1.5 4 conn
+solid
+1 0.5 4 in
+solid
+1 1.5 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_best_fitness_stat.tex b/trunk/paradiseo-eo/doc/latex/classeo_best_fitness_stat.tex
new file mode 100644
index 000000000..406de92b4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_best_fitness_stat.tex
@@ -0,0 +1,60 @@
+\section{eo\-Best\-Fitness\-Stat$<$ EOT $>$ Class Template Reference}
+\label{classeo_best_fitness_stat}\index{eoBestFitnessStat@{eoBestFitnessStat}}
+Best fitness of a population.  
+
+
+{\tt \#include $<$eo\-Stat.h$>$}
+
+Inheritance diagram for eo\-Best\-Fitness\-Stat$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.15315cm]{classeo_best_fitness_stat}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Fitness {\bf Fitness}\label{classeo_best_fitness_stat_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Best\-Fitness\-Stat} (std::string \_\-description=\char`\"{}Best \char`\"{})\label{classeo_best_fitness_stat_a0}
+
+\item 
+void {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_best_fitness_stat_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} (void) const \label{classeo_best_fitness_stat_a2}
+
+\end{CompactItemize}
+\subsection*{Private Member Functions}
+\begin{CompactItemize}
+\item 
+template$<$class T$>$ void {\bf doit} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop, {\bf eo\-Pareto\-Fitness}$<$ T $>$)\label{classeo_best_fitness_stat_d0}
+
+\item 
+template$<$class T$>$ void {\bf doit} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop, T)\label{classeo_best_fitness_stat_d1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Best\-Fitness\-Stat$<$ EOT $>$}
+
+Best fitness of a population. 
+
+Fitness can be:\begin{itemize}
+\item double\item eo\-Minimizing\-Fitness or eo\-Maximizing\-Fitness\item {\bf eo\-Pareto\-Fitness}{\rm (p.\,\pageref{classeo_pareto_fitness})}:\end{itemize}
+
+
+( For {\bf eo\-Scalar\-Fitness\-Assembled}{\rm (p.\,\pageref{classeo_scalar_fitness_assembled})} look at eo\-Assembled\-Fitness\-Stat ) 
+
+
+
+Definition at line 316 of file eo\-Stat.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Stat.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_best_select.eps b/trunk/paradiseo-eo/doc/latex/classeo_best_select.eps
new file mode 100644
index 000000000..9726af548
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_best_select.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 115.607
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.325 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoBestSelect< EOT >) cw
+(eoSelectOne< EOT >) cw
+(eoUF< const eoPop< EOT > &, const EOT & >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, const EOT & >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoBestSelect< EOT >) 0.5 0 box
+ (eoSelectOne< EOT >) 0.5 1 box
+ (eoUF< const eoPop< EOT > &, const EOT & >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< const eoPop< EOT > &, const EOT & >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_best_select.tex b/trunk/paradiseo-eo/doc/latex/classeo_best_select.tex
new file mode 100644
index 000000000..27159c4ce
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_best_select.tex
@@ -0,0 +1,33 @@
+\section{eo\-Best\-Select$<$ EOT $>$ Class Template Reference}
+\label{classeo_best_select}\index{eoBestSelect@{eoBestSelect}}
+eo\-Best\-Select: a selection method that always return the best (mainly for testing purposes)  
+
+
+{\tt \#include $<$eo\-Random\-Select.h$>$}
+
+Inheritance diagram for eo\-Best\-Select$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.23699cm]{classeo_best_select}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual const {\bf EOT} \& {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_best_select_a0}
+
+\begin{CompactList}\small\item\em not a big deal!!! \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Best\-Select$<$ EOT $>$}
+
+eo\-Best\-Select: a selection method that always return the best (mainly for testing purposes) 
+
+
+
+Definition at line 60 of file eo\-Random\-Select.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Random\-Select.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_bin_clone_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_bin_clone_op.eps
new file mode 100644
index 000000000..377a3feac
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_bin_clone_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 92.9152
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.38125 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoBinCloneOp< EOT >) cw
+(eoBinOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoBF< EOT &, const EOT &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< EOT &, const EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoBinCloneOp< EOT >) 0.5 0 box
+ (eoBinOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoBF< EOT &, const EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< EOT &, const EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_bin_clone_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_bin_clone_op.tex
new file mode 100644
index 000000000..cff226730
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_bin_clone_op.tex
@@ -0,0 +1,39 @@
+\section{eo\-Bin\-Clone\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_bin_clone_op}\index{eoBinCloneOp@{eoBinCloneOp}}
+Binary clone: two operands, only the first could be modified.  
+
+
+{\tt \#include $<$eo\-Clone\-Ops.h$>$}
+
+Inheritance diagram for eo\-Bin\-Clone\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.60163cm]{classeo_bin_clone_op}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Bin\-Clone\-Op} ()\label{classeo_bin_clone_op_a0}
+
+\begin{CompactList}\small\item\em Ctor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_bin_clone_op_a1}
+
+\item 
+virtual bool {\bf operator()} ({\bf EOT} \&, const {\bf EOT} \&)\label{classeo_bin_clone_op_a2}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Bin\-Clone\-Op$<$ EOT $>$}
+
+Binary clone: two operands, only the first could be modified. 
+
+
+
+Definition at line 57 of file eo\-Clone\-Ops.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Clone\-Ops.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_bin_gen_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_bin_gen_op.eps
new file mode 100644
index 000000000..b21e26f31
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_bin_gen_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 91.0125
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.49375 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoBinGenOp< EOT >) cw
+(eoGenOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoUF< eoPopulator< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< eoPopulator< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoBinGenOp< EOT >) 0.5 0 box
+ (eoGenOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoUF< eoPopulator< EOT > &, void >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< eoPopulator< EOT > &, void >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_bin_gen_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_bin_gen_op.tex
new file mode 100644
index 000000000..0050fbf87
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_bin_gen_op.tex
@@ -0,0 +1,48 @@
+\section{eo\-Bin\-Gen\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_bin_gen_op}\index{eoBinGenOp@{eoBinGenOp}}
+Wrapper for binop: here we use select method of {\bf eo\-Populator}{\rm (p.\,\pageref{classeo_populator})} but we could also have an embedded selector to select the second parent.  
+
+
+{\tt \#include $<$eo\-Gen\-Op.h$>$}
+
+Inheritance diagram for eo\-Bin\-Gen\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.54835cm]{classeo_bin_gen_op}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Bin\-Gen\-Op} ({\bf eo\-Bin\-Op}$<$ {\bf EOT} $>$ \&\_\-op)\label{classeo_bin_gen_op_a0}
+
+\item 
+unsigned {\bf max\_\-production} (void)\label{classeo_bin_gen_op_a1}
+
+\begin{CompactList}\small\item\em Max production is used to reserve space for all elements that are used by the operator, not setting it properly can result in a crash. \item\end{CompactList}\item 
+void {\bf apply} ({\bf eo\-Populator}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_bin_gen_op_a2}
+
+\begin{CompactList}\small\item\em do the work: get 2 individuals from the population, modifies only one (it's a {\bf eo\-Bin\-Op}{\rm (p.\,\pageref{classeo_bin_op})}) \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_bin_gen_op_a3}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Bin\-Op}$<$ {\bf EOT} $>$ \& {\bf op}\label{classeo_bin_gen_op_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Bin\-Gen\-Op$<$ EOT $>$}
+
+Wrapper for binop: here we use select method of {\bf eo\-Populator}{\rm (p.\,\pageref{classeo_populator})} but we could also have an embedded selector to select the second parent. 
+
+
+
+Definition at line 107 of file eo\-Gen\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Gen\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_bin_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_bin_op.eps
new file mode 100644
index 000000000..7021477db
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_bin_op.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 60.7903
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 8.225 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 3 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoBinOp< EOType >) cw
+(eoOp< EOType >) cw
+(eoBF< EOType &, const EOType &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< EOType &, const EOType &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoBinOp< EOType >) 0.5 0 box
+ (eoOp< EOType >) 0 1 box
+ (eoBF< EOType &, const EOType &, bool >) 1 1 box
+ (eoFunctorBase) 0.5 2 box
+ (binary_function< EOType &, const EOType &, bool >) 1.5 2 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+0 1 1 conn
+solid
+1 0 1 in
+solid
+1 1 1 in
+solid
+0 1 1 out
+solid
+0.5 1.5 2 conn
+solid
+1 0.5 2 in
+solid
+1 1.5 2 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_bin_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_bin_op.tex
new file mode 100644
index 000000000..a356863da
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_bin_op.tex
@@ -0,0 +1,36 @@
+\section{eo\-Bin\-Op$<$ EOType $>$ Class Template Reference}
+\label{classeo_bin_op}\index{eoBinOp@{eoBinOp}}
+Binary genetic operator: subclasses {\bf eo\-Op}{\rm (p.\,\pageref{classeo_op})}, and defines basically the operator() with two operands, only the first one can be modified When defining your own, make sure that you return a boolean value indicating that you have changed the content.  
+
+
+{\tt \#include $<$eo\-Op.h$>$}
+
+Inheritance diagram for eo\-Bin\-Op$<$ EOType $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=1.70213cm]{classeo_bin_op}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Bin\-Op} ()\label{classeo_bin_op_a0}
+
+\begin{CompactList}\small\item\em Ctor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_bin_op_a1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOType$>$ class eo\-Bin\-Op$<$ EOType $>$}
+
+Binary genetic operator: subclasses {\bf eo\-Op}{\rm (p.\,\pageref{classeo_op})}, and defines basically the operator() with two operands, only the first one can be modified When defining your own, make sure that you return a boolean value indicating that you have changed the content. 
+
+
+
+Definition at line 117 of file eo\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_binary_functor_counter.eps b/trunk/paradiseo-eo/doc/latex/classeo_binary_functor_counter.eps
new file mode 100644
index 000000000..89cb6505f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_binary_functor_counter.eps
@@ -0,0 +1,203 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 226.415
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.20833 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 3 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoBinaryFunctorCounter< BinaryFunctor >) cw
+(eoValueParam< unsigned long >) cw
+(eoParam) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoBinaryFunctorCounter< BinaryFunctor >) 0 0 box
+ (eoValueParam< unsigned long >) 0 1 box
+ (eoParam) 0 2 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_binary_functor_counter.tex b/trunk/paradiseo-eo/doc/latex/classeo_binary_functor_counter.tex
new file mode 100644
index 000000000..44a765421
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_binary_functor_counter.tex
@@ -0,0 +1,65 @@
+\section{eo\-Binary\-Functor\-Counter$<$ Binary\-Functor $>$ Class Template Reference}
+\label{classeo_binary_functor_counter}\index{eoBinaryFunctorCounter@{eoBinaryFunctorCounter}}
+Generic counter class that counts the number of times a binary function is used.  
+
+
+{\tt \#include $<$eo\-Counter.h$>$}
+
+Inheritance diagram for eo\-Binary\-Functor\-Counter$<$ Binary\-Functor $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3cm]{classeo_binary_functor_counter}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Binary\-Functor\-Counter} (Binary\-Functor \&\_\-func, std::string \_\-name=\char`\"{}proc\_\-counter\char`\"{})\label{classeo_binary_functor_counter_a0}
+
+\item 
+Binary\-Functor::result\_\-type {\bf operator()} (typename Binary\-Functor::first\_\-argument\_\-type \_\-arg1, typename Binary\-Functor::second\_\-argument\_\-type \_\-arg2)
+\begin{CompactList}\small\item\em Calls the embedded function and increments the counter. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+Binary\-Functor \& {\bf func}\label{classeo_binary_functor_counter_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Binary\-Functor$>$ class eo\-Binary\-Functor\-Counter$<$ Binary\-Functor $>$}
+
+Generic counter class that counts the number of times a binary function is used. 
+
+Add a binary function through its ctor and use this class instead of it.
+
+It is derived from {\bf eo\-Value\-Param}{\rm (p.\,\pageref{classeo_value_param})} so you can add it to a monitor. 
+
+
+
+Definition at line 142 of file eo\-Counter.h.
+
+\subsection{Member Function Documentation}
+\index{eoBinaryFunctorCounter@{eo\-Binary\-Functor\-Counter}!operator()@{operator()}}
+\index{operator()@{operator()}!eoBinaryFunctorCounter@{eo\-Binary\-Functor\-Counter}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Binary\-Functor$>$ Binary\-Functor::result\_\-type {\bf eo\-Binary\-Functor\-Counter}$<$ Binary\-Functor $>$::operator() (typename Binary\-Functor::first\_\-argument\_\-type {\em \_\-arg1}, typename Binary\-Functor::second\_\-argument\_\-type {\em \_\-arg2})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_binary_functor_counter_a1}
+
+
+Calls the embedded function and increments the counter. 
+
+Note for MSVC users, if this code does not compile, you are quite likely trying to count a function that has a non-void return type. Don't look at us, look at the MSVC builders. Code like \char`\"{}return void;\char`\"{} is perfectly legal according to the ANSI standard, but the guys at Microsoft didn't get to implementing it yet.
+
+We had two choices: assuming (and compiling ) code that returns void or code that returns non-void. Given that in {\bf EO}{\rm (p.\,\pageref{class_e_o})} most functors return void, it was chosen to support void.
+
+But also please let me know if you have a compiler that defines \_\-MSC\_\-VER (lot's of windows compilers do), but is quite capable of compiling return void; type of code. We'll try to change the signature then.
+
+You happy GNU (and other compiler) users will not have a problem with this. 
+
+Definition at line 166 of file eo\-Counter.h.
+
+References eo\-Value\-Param$<$ unsigned long $>$::value().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Counter.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_bit.eps b/trunk/paradiseo-eo/doc/latex/classeo_bit.eps
new file mode 100644
index 000000000..162a0438d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_bit.eps
@@ -0,0 +1,233 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 266.667
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 6 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoBit< FitT >) cw
+(eoVector< FitT, bool >) cw
+(EO< FitT >) cw
+(vector< bool >) cw
+(eoObject) cw
+(eoPersistent) cw
+(eoPrintable) cw
+(eoVirus< FitT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoBit< FitT >) 1 1 box
+ (eoVector< FitT, bool >) 1 2 box
+ (EO< FitT >) 0.5 3 box
+ (vector< bool >) 1.5 3 box
+ (eoObject) 0 4 box
+ (eoPersistent) 1 4 box
+ (eoPrintable) 1 5 box
+ (eoVirus< FitT >) 1 0 box
+
+% ----- relations -----
+
+solid
+0 1 1 out
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+0 0.5 3 out
+solid
+0 1 4 conn
+solid
+1 1.5 3 in
+solid
+1 0 4 in
+solid
+1 1 4 in
+solid
+0 1 4 out
+solid
+1 1 5 in
+solid
+1 1 0.25 out
+solid
+0 1 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_bit.tex b/trunk/paradiseo-eo/doc/latex/classeo_bit.tex
new file mode 100644
index 000000000..ca15f3d54
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_bit.tex
@@ -0,0 +1,97 @@
+\section{eo\-Bit$<$ Fit\-T $>$ Class Template Reference}
+\label{classeo_bit}\index{eoBit@{eoBit}}
+Implementation of bitstring chromosome.  
+
+
+{\tt \#include $<$ga/eo\-Bit.h$>$}
+
+Inheritance diagram for eo\-Bit$<$ Fit\-T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=6cm]{classeo_bit}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Bit} (unsigned size=0, bool value=false)
+\begin{CompactList}\small\item\em (Default) Constructor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_bit_a1}
+
+\begin{CompactList}\small\item\em My class name. \item\end{CompactList}\item 
+virtual void {\bf print\-On} (std::ostream \&os) const 
+\begin{CompactList}\small\item\em To print me on a stream. \item\end{CompactList}\item 
+virtual void {\bf read\-From} (std::istream \&is)
+\begin{CompactList}\small\item\em To read me from a stream. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Fit\-T$>$ class eo\-Bit$<$ Fit\-T $>$}
+
+Implementation of bitstring chromosome. 
+
+Based on STL's vector$<$bool$>$ specialization. 
+
+
+
+Definition at line 56 of file eo\-Bit.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoBit@{eo\-Bit}!eoBit@{eoBit}}
+\index{eoBit@{eoBit}!eoBit@{eo\-Bit}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Fit\-T$>$ {\bf eo\-Bit}$<$ {\bf Fit\-T} $>$::{\bf eo\-Bit} (unsigned {\em size} = {\tt 0}, bool {\em value} = {\tt false})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_bit_a0}
+
+
+(Default) Constructor. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em size}]Size of the binary std::string. \end{description}
+\end{Desc}
+
+
+Definition at line 69 of file eo\-Bit.h.
+
+\subsection{Member Function Documentation}
+\index{eoBit@{eo\-Bit}!printOn@{printOn}}
+\index{printOn@{printOn}!eoBit@{eo\-Bit}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Fit\-T$>$ virtual void {\bf eo\-Bit}$<$ {\bf Fit\-T} $>$::print\-On (std::ostream \& {\em os}) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_bit_a2}
+
+
+To print me on a stream. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em os}]The std::ostream. \end{description}
+\end{Desc}
+
+
+Reimplemented from {\bf eo\-Vector$<$ Fit\-T, bool $>$} {\rm (p.\,\pageref{classeo_vector_a4})}.
+
+Definition at line 82 of file eo\-Bit.h.
+
+References EO$<$ F $>$::print\-On().\index{eoBit@{eo\-Bit}!readFrom@{readFrom}}
+\index{readFrom@{readFrom}!eoBit@{eo\-Bit}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Fit\-T$>$ virtual void {\bf eo\-Bit}$<$ {\bf Fit\-T} $>$::read\-From (std::istream \& {\em is})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_bit_a3}
+
+
+To read me from a stream. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em is}]The std::istream. \end{description}
+\end{Desc}
+
+
+Reimplemented from {\bf eo\-Vector$<$ Fit\-T, bool $>$} {\rm (p.\,\pageref{classeo_vector_a5})}.
+
+Definition at line 94 of file eo\-Bit.h.
+
+References EO$<$ F $>$::read\-From().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Bit.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_bit_bit_flip.tex b/trunk/paradiseo-eo/doc/latex/classeo_bit_bit_flip.tex
new file mode 100644
index 000000000..8cef12c50
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_bit_bit_flip.tex
@@ -0,0 +1,17 @@
+\section{eo\-Bit\-Bit\-Flip Class Reference}
+\label{classeo_bit_bit_flip}\index{eoBitBitFlip@{eoBitBitFlip}}
+eo\-Bit\-Flip --$>$ changes 1 bit  
+
+
+{\tt \#include $<$ga/eo\-Bit\-Op.h$>$}
+
+
+
+\subsection{Detailed Description}
+eo\-Bit\-Flip --$>$ changes 1 bit 
+
+
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Bit\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_bit_gx_over.eps b/trunk/paradiseo-eo/doc/latex/classeo_bit_gx_over.eps
new file mode 100644
index 000000000..aa146eca8
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_bit_gx_over.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 96.6184
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.175 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoBitGxOver< Chrom >) cw
+(eoQuadOp< Chrom >) cw
+(eoOp< Chrom >) cw
+(eoBF< Chrom &, Chrom &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< Chrom &, Chrom &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoBitGxOver< Chrom >) 0.5 0 box
+ (eoQuadOp< Chrom >) 0.5 1 box
+ (eoOp< Chrom >) 0 2 box
+ (eoBF< Chrom &, Chrom &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< Chrom &, Chrom &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_bit_gx_over.tex b/trunk/paradiseo-eo/doc/latex/classeo_bit_gx_over.tex
new file mode 100644
index 000000000..eec1771d9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_bit_gx_over.tex
@@ -0,0 +1,66 @@
+\section{eo\-Bit\-Gx\-Over$<$ Chrom $>$ Class Template Reference}
+\label{classeo_bit_gx_over}\index{eoBitGxOver@{eoBitGxOver}}
+eo\-Bit\-Gx\-Over --$>$ Npts crossover when bistd::string considered as a std::string of binary-encoded genes (exchanges genes) Is anybody still using it apart from historians ??? :-)  
+
+
+{\tt \#include $<$ga/eo\-Bit\-Op.h$>$}
+
+Inheritance diagram for eo\-Bit\-Gx\-Over$<$ Chrom $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.70531cm]{classeo_bit_gx_over}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Bit\-Gx\-Over} (const unsigned \_\-gene\_\-size, const unsigned \_\-num\_\-points=2)\label{classeo_bit_gx_over_a0}
+
+\begin{CompactList}\small\item\em Constructor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_bit_gx_over_a1}
+
+\begin{CompactList}\small\item\em The class name. \item\end{CompactList}\item 
+bool {\bf operator()} (Chrom \&chrom1, Chrom \&chrom2)
+\begin{CompactList}\small\item\em Gene crossover for binary chromosomes. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf gene\_\-size}\label{classeo_bit_gx_over_r0}
+
+\item 
+unsigned {\bf num\_\-points}\label{classeo_bit_gx_over_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Chrom$>$ class eo\-Bit\-Gx\-Over$<$ Chrom $>$}
+
+eo\-Bit\-Gx\-Over --$>$ Npts crossover when bistd::string considered as a std::string of binary-encoded genes (exchanges genes) Is anybody still using it apart from historians ??? :-) 
+
+
+
+Definition at line 388 of file eo\-Bit\-Op.h.
+
+\subsection{Member Function Documentation}
+\index{eoBitGxOver@{eo\-Bit\-Gx\-Over}!operator()@{operator()}}
+\index{operator()@{operator()}!eoBitGxOver@{eo\-Bit\-Gx\-Over}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Chrom$>$ bool {\bf eo\-Bit\-Gx\-Over}$<$ Chrom $>$::operator() (Chrom \& {\em chrom1}, Chrom \& {\em chrom2})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_bit_gx_over_a2}
+
+
+Gene crossover for binary chromosomes. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em chrom1}]The first chromosome. \item[{\em chrom2}]The first chromosome. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-BF$<$ Chrom \&, Chrom \&, bool $>$} {\rm (p.\,\pageref{classeo_b_f_a1})}.
+
+Definition at line 409 of file eo\-Bit\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Bit\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_bit_inversion.eps b/trunk/paradiseo-eo/doc/latex/classeo_bit_inversion.eps
new file mode 100644
index 000000000..6188e8b5e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_bit_inversion.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 125.196
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.99375 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoBitInversion< Chrom >) cw
+(eoMonOp< Chrom >) cw
+(eoOp< Chrom >) cw
+(eoUF< Chrom &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< Chrom &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoBitInversion< Chrom >) 0.5 0 box
+ (eoMonOp< Chrom >) 0.5 1 box
+ (eoOp< Chrom >) 0 2 box
+ (eoUF< Chrom &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< Chrom &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_bit_inversion.tex b/trunk/paradiseo-eo/doc/latex/classeo_bit_inversion.tex
new file mode 100644
index 000000000..08cbc747d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_bit_inversion.tex
@@ -0,0 +1,54 @@
+\section{eo\-Bit\-Inversion$<$ Chrom $>$ Class Template Reference}
+\label{classeo_bit_inversion}\index{eoBitInversion@{eoBitInversion}}
+eo\-Bit\-Inversion: inverts the bits of the chromosome between an interval  
+
+
+{\tt \#include $<$ga/eo\-Bit\-Op.h$>$}
+
+Inheritance diagram for eo\-Bit\-Inversion$<$ Chrom $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.50548cm]{classeo_bit_inversion}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_bit_inversion_a0}
+
+\begin{CompactList}\small\item\em The class name. \item\end{CompactList}\item 
+bool {\bf operator()} (Chrom \&chrom)
+\begin{CompactList}\small\item\em Inverts a range of bits in a binary chromosome. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Chrom$>$ class eo\-Bit\-Inversion$<$ Chrom $>$}
+
+eo\-Bit\-Inversion: inverts the bits of the chromosome between an interval 
+
+
+
+Definition at line 146 of file eo\-Bit\-Op.h.
+
+\subsection{Member Function Documentation}
+\index{eoBitInversion@{eo\-Bit\-Inversion}!operator()@{operator()}}
+\index{operator()@{operator()}!eoBitInversion@{eo\-Bit\-Inversion}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Chrom$>$ bool {\bf eo\-Bit\-Inversion}$<$ Chrom $>$::operator() (Chrom \& {\em chrom})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_bit_inversion_a1}
+
+
+Inverts a range of bits in a binary chromosome. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em chrom}]The chromosome whos bits are going to be inverted (a range). \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-UF$<$ Chrom \&, bool $>$} {\rm (p.\,\pageref{classeo_u_f_a1})}.
+
+Definition at line 156 of file eo\-Bit\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Bit\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_bit_mutation.eps b/trunk/paradiseo-eo/doc/latex/classeo_bit_mutation.eps
new file mode 100644
index 000000000..07738136a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_bit_mutation.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 125.196
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.99375 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoBitMutation< Chrom >) cw
+(eoMonOp< Chrom >) cw
+(eoOp< Chrom >) cw
+(eoUF< Chrom &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< Chrom &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoBitMutation< Chrom >) 0.5 0 box
+ (eoMonOp< Chrom >) 0.5 1 box
+ (eoOp< Chrom >) 0 2 box
+ (eoUF< Chrom &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< Chrom &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_bit_mutation.tex b/trunk/paradiseo-eo/doc/latex/classeo_bit_mutation.tex
new file mode 100644
index 000000000..bed0f1504
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_bit_mutation.tex
@@ -0,0 +1,82 @@
+\section{eo\-Bit\-Mutation$<$ Chrom $>$ Class Template Reference}
+\label{classeo_bit_mutation}\index{eoBitMutation@{eoBitMutation}}
+eo\-Bit\-Mutation --$>$ classical mutation  
+
+
+{\tt \#include $<$ga/eo\-Bit\-Op.h$>$}
+
+Inheritance diagram for eo\-Bit\-Mutation$<$ Chrom $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.50548cm]{classeo_bit_mutation}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Bit\-Mutation} (const double \&\_\-rate=0.01, bool \_\-normalize=false)
+\begin{CompactList}\small\item\em (Default) Constructor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_bit_mutation_a1}
+
+\begin{CompactList}\small\item\em The class name. \item\end{CompactList}\item 
+bool {\bf operator()} (Chrom \&chrom)
+\begin{CompactList}\small\item\em Mutate a chromosome. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf rate}\label{classeo_bit_mutation_r0}
+
+\item 
+bool {\bf normalize}\label{classeo_bit_mutation_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Chrom$>$ class eo\-Bit\-Mutation$<$ Chrom $>$}
+
+eo\-Bit\-Mutation --$>$ classical mutation 
+
+
+
+Definition at line 104 of file eo\-Bit\-Op.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoBitMutation@{eo\-Bit\-Mutation}!eoBitMutation@{eoBitMutation}}
+\index{eoBitMutation@{eoBitMutation}!eoBitMutation@{eo\-Bit\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Chrom$>$ {\bf eo\-Bit\-Mutation}$<$ Chrom $>$::{\bf eo\-Bit\-Mutation} (const double \& {\em \_\-rate} = {\tt 0.01}, bool {\em \_\-normalize} = {\tt false})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_bit_mutation_a0}
+
+
+(Default) Constructor. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-rate}]Rate of mutation. \end{description}
+\end{Desc}
+
+
+Definition at line 111 of file eo\-Bit\-Op.h.
+
+\subsection{Member Function Documentation}
+\index{eoBitMutation@{eo\-Bit\-Mutation}!operator()@{operator()}}
+\index{operator()@{operator()}!eoBitMutation@{eo\-Bit\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Chrom$>$ bool {\bf eo\-Bit\-Mutation}$<$ Chrom $>$::operator() (Chrom \& {\em chrom})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_bit_mutation_a2}
+
+
+Mutate a chromosome. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em chrom}]The chromosome to be mutated. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-UF$<$ Chrom \&, bool $>$} {\rm (p.\,\pageref{classeo_u_f_a1})}.
+
+Definition at line 121 of file eo\-Bit\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Bit\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_bit_next.eps b/trunk/paradiseo-eo/doc/latex/classeo_bit_next.eps
new file mode 100644
index 000000000..8ebca31bf
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_bit_next.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 125.196
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.99375 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoBitNext< Chrom >) cw
+(eoMonOp< Chrom >) cw
+(eoOp< Chrom >) cw
+(eoUF< Chrom &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< Chrom &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoBitNext< Chrom >) 0.5 0 box
+ (eoMonOp< Chrom >) 0.5 1 box
+ (eoOp< Chrom >) 0 2 box
+ (eoUF< Chrom &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< Chrom &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_bit_next.tex b/trunk/paradiseo-eo/doc/latex/classeo_bit_next.tex
new file mode 100644
index 000000000..7344eae6a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_bit_next.tex
@@ -0,0 +1,54 @@
+\section{eo\-Bit\-Next$<$ Chrom $>$ Class Template Reference}
+\label{classeo_bit_next}\index{eoBitNext@{eoBitNext}}
+eo\-Bit\-Next --$>$ next value when bitstring considered as binary value  
+
+
+{\tt \#include $<$ga/eo\-Bit\-Op.h$>$}
+
+Inheritance diagram for eo\-Bit\-Next$<$ Chrom $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.50548cm]{classeo_bit_next}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_bit_next_a0}
+
+\begin{CompactList}\small\item\em The class name. \item\end{CompactList}\item 
+bool {\bf operator()} (Chrom \&chrom)
+\begin{CompactList}\small\item\em Change the bit std::string x to be x+1. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Chrom$>$ class eo\-Bit\-Next$<$ Chrom $>$}
+
+eo\-Bit\-Next --$>$ next value when bitstring considered as binary value 
+
+
+
+Definition at line 174 of file eo\-Bit\-Op.h.
+
+\subsection{Member Function Documentation}
+\index{eoBitNext@{eo\-Bit\-Next}!operator()@{operator()}}
+\index{operator()@{operator()}!eoBitNext@{eo\-Bit\-Next}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Chrom$>$ bool {\bf eo\-Bit\-Next}$<$ Chrom $>$::operator() (Chrom \& {\em chrom})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_bit_next_a1}
+
+
+Change the bit std::string x to be x+1. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em chrom}]The chromosome to be added one. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-UF$<$ Chrom \&, bool $>$} {\rm (p.\,\pageref{classeo_u_f_a1})}.
+
+Definition at line 184 of file eo\-Bit\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Bit\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_bit_op_factory.eps b/trunk/paradiseo-eo/doc/latex/classeo_bit_op_factory.eps
new file mode 100644
index 000000000..202098ac0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_bit_op_factory.eps
@@ -0,0 +1,203 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 379.747
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.31667 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 3 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoBitOpFactory< EOT >) cw
+(eoFactory< EOT >) cw
+(eoObject) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoBitOpFactory< EOT >) 0 0 box
+ (eoFactory< EOT >) 0 1 box
+ (eoObject) 0 2 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_bit_op_factory.tex b/trunk/paradiseo-eo/doc/latex/classeo_bit_op_factory.tex
new file mode 100644
index 000000000..d0db444c1
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_bit_op_factory.tex
@@ -0,0 +1,72 @@
+\section{eo\-Bit\-Op\-Factory$<$ EOT $>$ Class Template Reference}
+\label{classeo_bit_op_factory}\index{eoBitOpFactory@{eoBitOpFactory}}
+{\bf EO}{\rm (p.\,\pageref{class_e_o})} Factory.  
+
+
+{\tt \#include $<$eo\-Bit\-Op\-Factory.h$>$}
+
+Inheritance diagram for eo\-Bit\-Op\-Factory$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3cm]{classeo_bit_op_factory}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual {\bf eo\-Op}$<$ {\bf EOT} $>$ $\ast$ {\bf make} (std::istream \&\_\-is)
+\begin{CompactList}\small\item\em Another factory method: creates an object from an std::istream, reading from it whatever is needed to create the object. \item\end{CompactList}\end{CompactItemize}
+\begin{Indent}{\bf ctors and dtors}\par
+\begin{CompactItemize}
+\item 
+{\bf eo\-Bit\-Op\-Factory} ()\label{classeo_bit_op_factory_z23_0}
+
+\begin{CompactList}\small\item\em constructor \item\end{CompactList}\item 
+virtual {\bf $\sim$eo\-Bit\-Op\-Factory} ()\label{classeo_bit_op_factory_z23_1}
+
+\begin{CompactList}\small\item\em destructor \item\end{CompactList}\end{CompactItemize}
+\end{Indent}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Bit\-Op\-Factory$<$ EOT $>$}
+
+{\bf EO}{\rm (p.\,\pageref{class_e_o})} Factory. 
+
+An instance of the factory class to create operators that act on bitstring chromosomes. Only those chromosomes can instantiate the operators that are created here \begin{Desc}
+\item[See also:]{\bf eo\-Select}{\rm (p.\,\pageref{classeo_select})} \end{Desc}
+
+
+
+
+Definition at line 39 of file eo\-Bit\-Op\-Factory.h.
+
+\subsection{Member Function Documentation}
+\index{eoBitOpFactory@{eo\-Bit\-Op\-Factory}!make@{make}}
+\index{make@{make}!eoBitOpFactory@{eo\-Bit\-Op\-Factory}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ virtual {\bf eo\-Op}$<${\bf EOT}$>$$\ast$ {\bf eo\-Bit\-Op\-Factory}$<$ {\bf EOT} $>$::make (std::istream \& {\em \_\-is})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_bit_op_factory_a0}
+
+
+Another factory method: creates an object from an std::istream, reading from it whatever is needed to create the object. 
+
+Usually, the format for the std::istream will be$\backslash$ object\-Type parameter1 parameter2 ... parametern$\backslash$ If there are problems, an std::exception is raised; it should be caught at the upper level, because it might be something for that level$\backslash$ At the same time, it catches std::exceptions thrown at a lower level, which will indicate that whatever is in the stream is for this method to process \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-is}]an stream from where a single line will be read \end{description}
+\end{Desc}
+\begin{Desc}
+\item[Exceptions:]
+\begin{description}
+\item[{\em runtime\_\-std::exception}]if the object type is not known\end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Factory$<$ EOT $>$} {\rm (p.\,\pageref{classeo_factory_a0})}.
+
+Definition at line 63 of file eo\-Bit\-Op\-Factory.h.
+
+References eo\-Factory$<$ EOClass $>$::make().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Bit\-Op\-Factory.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_bit_prev.eps b/trunk/paradiseo-eo/doc/latex/classeo_bit_prev.eps
new file mode 100644
index 000000000..fd1e0e907
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_bit_prev.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 125.196
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.99375 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoBitPrev< Chrom >) cw
+(eoMonOp< Chrom >) cw
+(eoOp< Chrom >) cw
+(eoUF< Chrom &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< Chrom &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoBitPrev< Chrom >) 0.5 0 box
+ (eoMonOp< Chrom >) 0.5 1 box
+ (eoOp< Chrom >) 0 2 box
+ (eoUF< Chrom &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< Chrom &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_bit_prev.tex b/trunk/paradiseo-eo/doc/latex/classeo_bit_prev.tex
new file mode 100644
index 000000000..f05c75362
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_bit_prev.tex
@@ -0,0 +1,54 @@
+\section{eo\-Bit\-Prev$<$ Chrom $>$ Class Template Reference}
+\label{classeo_bit_prev}\index{eoBitPrev@{eoBitPrev}}
+eo\-Bit\-Prev --$>$ previous value when bitstring treated as binary value  
+
+
+{\tt \#include $<$ga/eo\-Bit\-Op.h$>$}
+
+Inheritance diagram for eo\-Bit\-Prev$<$ Chrom $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.50548cm]{classeo_bit_prev}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_bit_prev_a0}
+
+\begin{CompactList}\small\item\em The class name. \item\end{CompactList}\item 
+bool {\bf operator()} (Chrom \&chrom)
+\begin{CompactList}\small\item\em Change the bit std::string x to be x-1. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Chrom$>$ class eo\-Bit\-Prev$<$ Chrom $>$}
+
+eo\-Bit\-Prev --$>$ previous value when bitstring treated as binary value 
+
+
+
+Definition at line 208 of file eo\-Bit\-Op.h.
+
+\subsection{Member Function Documentation}
+\index{eoBitPrev@{eo\-Bit\-Prev}!operator()@{operator()}}
+\index{operator()@{operator()}!eoBitPrev@{eo\-Bit\-Prev}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Chrom$>$ bool {\bf eo\-Bit\-Prev}$<$ Chrom $>$::operator() (Chrom \& {\em chrom})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_bit_prev_a1}
+
+
+Change the bit std::string x to be x-1. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em chrom}]The chromosome to be substracted one. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-UF$<$ Chrom \&, bool $>$} {\rm (p.\,\pageref{classeo_u_f_a1})}.
+
+Definition at line 218 of file eo\-Bit\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Bit\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_bool_flip.eps b/trunk/paradiseo-eo/doc/latex/classeo_bool_flip.eps
new file mode 100644
index 000000000..35ef1ddc7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_bool_flip.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 133.333
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.75 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoBoolFlip) cw
+(eoMonOp< bool >) cw
+(eoOp< bool >) cw
+(eoUF< bool &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< bool &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoBoolFlip) 0.5 0 box
+ (eoMonOp< bool >) 0.5 1 box
+ (eoOp< bool >) 0 2 box
+ (eoUF< bool &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< bool &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_bool_flip.tex b/trunk/paradiseo-eo/doc/latex/classeo_bool_flip.tex
new file mode 100644
index 000000000..1b2d35778
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_bool_flip.tex
@@ -0,0 +1,34 @@
+\section{eo\-Bool\-Flip Class Reference}
+\label{classeo_bool_flip}\index{eoBoolFlip@{eoBoolFlip}}
+a simple boolean mutation - to be used in generic eo\-Op's  
+
+
+{\tt \#include $<$eo\-Bool\-Flip.h$>$}
+
+Inheritance diagram for eo\-Bool\-Flip::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.73333cm]{classeo_bool_flip}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+bool {\bf operator()} (bool \&\_\-b)\label{classeo_bool_flip_a0}
+
+\begin{CompactList}\small\item\em simply flips the boolean argument \item\end{CompactList}\item 
+virtual string {\bf class\-Name} () const \label{classeo_bool_flip_a1}
+
+\begin{CompactList}\small\item\em inherited {\bf class\-Name()}{\rm (p.\,\pageref{classeo_bool_flip_a1})} \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+a simple boolean mutation - to be used in generic eo\-Op's 
+
+
+
+Definition at line 32 of file eo\-Bool\-Flip.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Bool\-Flip.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_boolean_generator.eps b/trunk/paradiseo-eo/doc/latex/classeo_boolean_generator.eps
new file mode 100644
index 000000000..1ddb9c5be
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_boolean_generator.eps
@@ -0,0 +1,209 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 496.894
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.00625 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoBooleanGenerator) cw
+(eoRndGenerator< bool >) cw
+(eoF< bool >) cw
+(eoFunctorBase) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoBooleanGenerator) 0 0 box
+ (eoRndGenerator< bool >) 0 1 box
+ (eoF< bool >) 0 2 box
+ (eoFunctorBase) 0 3 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 0 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_boolean_generator.tex b/trunk/paradiseo-eo/doc/latex/classeo_boolean_generator.tex
new file mode 100644
index 000000000..505dc1f49
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_boolean_generator.tex
@@ -0,0 +1,43 @@
+\section{eo\-Boolean\-Generator Class Reference}
+\label{classeo_boolean_generator}\index{eoBooleanGenerator@{eoBooleanGenerator}}
+The class eo\-Boolean\-Generator can be used in the STL generate function to easily generate random booleans with a specified bias.  
+
+
+{\tt \#include $<$eo\-Rnd\-Generators.h$>$}
+
+Inheritance diagram for eo\-Boolean\-Generator::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_boolean_generator}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Boolean\-Generator} (float \_\-bias=0.5, {\bf eo\-Rng} \&\_\-rng=rng)\label{classeo_boolean_generator_a0}
+
+\item 
+bool {\bf operator()} (void)\label{classeo_boolean_generator_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+float {\bf bias}\label{classeo_boolean_generator_r0}
+
+\item 
+{\bf eo\-Rng} \& {\bf gen}\label{classeo_boolean_generator_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+The class eo\-Boolean\-Generator can be used in the STL generate function to easily generate random booleans with a specified bias. 
+
+
+
+Definition at line 104 of file eo\-Rnd\-Generators.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Rnd\-Generators.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_boolean_init.eps b/trunk/paradiseo-eo/doc/latex/classeo_boolean_init.eps
new file mode 100644
index 000000000..fb64a6f36
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_boolean_init.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 200
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.5 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoBooleanInit) cw
+(eoInit< bool >) cw
+(eoUF< bool &, void >) cw
+(eoFunctorBase) cw
+(unary_function< bool &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoBooleanInit) 0.5 0 box
+ (eoInit< bool >) 0.5 1 box
+ (eoUF< bool &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< bool &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_boolean_init.tex b/trunk/paradiseo-eo/doc/latex/classeo_boolean_init.tex
new file mode 100644
index 000000000..ce19ca847
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_boolean_init.tex
@@ -0,0 +1,43 @@
+\section{eo\-Boolean\-Init Class Reference}
+\label{classeo_boolean_init}\index{eoBooleanInit@{eoBooleanInit}}
+The class eo\-Boolean\-Init can be used in the STL apply function to easily generate random booleans with a specified bias.  
+
+
+{\tt \#include $<$eo\-Uniform\-Init.h$>$}
+
+Inheritance diagram for eo\-Boolean\-Init::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_boolean_init}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Boolean\-Init} (float \_\-bias=0.5, {\bf eo\-Rng} \&\_\-rng=rng)\label{classeo_boolean_init_a0}
+
+\item 
+void {\bf operator()} (bool \&\_\-b)\label{classeo_boolean_init_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+float {\bf bias}\label{classeo_boolean_init_r0}
+
+\item 
+{\bf eo\-Rng} \& {\bf gen}\label{classeo_boolean_init_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+The class eo\-Boolean\-Init can be used in the STL apply function to easily generate random booleans with a specified bias. 
+
+
+
+Definition at line 110 of file eo\-Uniform\-Init.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Uniform\-Init.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_branch_mutation.eps b/trunk/paradiseo-eo/doc/latex/classeo_branch_mutation.eps
new file mode 100644
index 000000000..e3c822002
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_branch_mutation.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 76.6284
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 6.525 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoBranchMutation< FType, Node >) cw
+(eoMonOp< eoParseTree< FType, Node > >) cw
+(eoOp< eoParseTree< FType, Node > >) cw
+(eoUF< eoParseTree< FType, Node > &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< eoParseTree< FType, Node > &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoBranchMutation< FType, Node >) 0.5 0 box
+ (eoMonOp< eoParseTree< FType, Node > >) 0.5 1 box
+ (eoOp< eoParseTree< FType, Node > >) 0 2 box
+ (eoUF< eoParseTree< FType, Node > &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< eoParseTree< FType, Node > &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_branch_mutation.tex b/trunk/paradiseo-eo/doc/latex/classeo_branch_mutation.tex
new file mode 100644
index 000000000..ba816c168
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_branch_mutation.tex
@@ -0,0 +1,91 @@
+\section{eo\-Branch\-Mutation$<$ FType, Node $>$ Class Template Reference}
+\label{classeo_branch_mutation}\index{eoBranchMutation@{eoBranchMutation}}
+eo\-Branch\-Mutation --$>$ replace a subtree with a randomly created subtree  
+
+
+{\tt \#include $<$gp/eo\-Parse\-Tree\-Op.h$>$}
+
+Inheritance diagram for eo\-Branch\-Mutation$<$ FType, Node $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.14559cm]{classeo_branch_mutation}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef {\bf eo\-Parse\-Tree}$<$ FType, Node $>$ {\bf Eo\-Type}\label{classeo_branch_mutation_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Branch\-Mutation} ({\bf eo\-Init}$<$ {\bf Eo\-Type} $>$ \&\_\-init, unsigned \_\-max\_\-length)
+\begin{CompactList}\small\item\em Constructor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_branch_mutation_a1}
+
+\begin{CompactList}\small\item\em the class name \item\end{CompactList}\item 
+virtual {\bf $\sim$eo\-Branch\-Mutation} ()\label{classeo_branch_mutation_a2}
+
+\begin{CompactList}\small\item\em Dtor. \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf Eo\-Type} \&\_\-eo1)
+\begin{CompactList}\small\item\em Mutate an individual. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf max\_\-length}\label{classeo_branch_mutation_r0}
+
+\item 
+{\bf eo\-Init}$<$ {\bf Eo\-Type} $>$ \& {\bf initializer}\label{classeo_branch_mutation_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class FType, class Node$>$ class eo\-Branch\-Mutation$<$ FType, Node $>$}
+
+eo\-Branch\-Mutation --$>$ replace a subtree with a randomly created subtree 
+
+
+
+Definition at line 87 of file eo\-Parse\-Tree\-Op.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoBranchMutation@{eo\-Branch\-Mutation}!eoBranchMutation@{eoBranchMutation}}
+\index{eoBranchMutation@{eoBranchMutation}!eoBranchMutation@{eo\-Branch\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ {\bf eo\-Branch\-Mutation}$<$ FType, Node $>$::{\bf eo\-Branch\-Mutation} ({\bf eo\-Init}$<$ {\bf Eo\-Type} $>$ \& {\em \_\-init}, unsigned {\em \_\-max\_\-length})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_branch_mutation_a0}
+
+
+Constructor. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-init}]An instantiation of eo\-Gp\-Depth\-Initializer \item[{\em \_\-max\_\-length}]the maximum size of an individual \end{description}
+\end{Desc}
+
+
+Definition at line 97 of file eo\-Parse\-Tree\-Op.h.
+
+\subsection{Member Function Documentation}
+\index{eoBranchMutation@{eo\-Branch\-Mutation}!operator()@{operator()}}
+\index{operator()@{operator()}!eoBranchMutation@{eo\-Branch\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ bool {\bf eo\-Branch\-Mutation}$<$ FType, Node $>$::operator() ({\bf Eo\-Type} \& {\em \_\-eo1})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_branch_mutation_a3}
+
+
+Mutate an individual. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-eo1}]The individual that is to be changed \end{description}
+\end{Desc}
+
+
+Definition at line 111 of file eo\-Parse\-Tree\-Op.h.
+
+References eo\-Parse\-Tree$<$ FType, Node $>$::prune\-Tree(), and eo\-Rng::random().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Parse\-Tree\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_breed.eps b/trunk/paradiseo-eo/doc/latex/classeo_breed.eps
new file mode 100644
index 000000000..d2aaf0fe8
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_breed.eps
@@ -0,0 +1,229 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 49.14
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 10.175 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 4 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoBreed< EOT >) cw
+(eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< const eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoBreedOne< EOT >) cw
+(eoGeneralBreeder< EOT >) cw
+(eoOneToOneBreeder< EOT >) cw
+(eoSelectTransform< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoBreed< EOT >) 1.5 1 box
+ (eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) 1.5 2 box
+ (eoFunctorBase) 1 3 box
+ (binary_function< const eoPop< EOT > &, eoPop< EOT > &, void >) 2 3 box
+ (eoBreedOne< EOT >) 0 0 box
+ (eoGeneralBreeder< EOT >) 1 0 box
+ (eoOneToOneBreeder< EOT >) 2 0 box
+ (eoSelectTransform< EOT >) 3 0 box
+
+% ----- relations -----
+
+solid
+0 1.5 1 out
+solid
+1 1.5 2 in
+solid
+0 1.5 2 out
+solid
+1 2 3 conn
+solid
+1 1 3 in
+solid
+1 2 3 in
+solid
+1 1.5 0.25 out
+solid
+0 3 1 conn
+solid
+0 0 0.75 in
+solid
+0 1 0.75 in
+solid
+0 2 0.75 in
+solid
+0 3 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_breed.tex b/trunk/paradiseo-eo/doc/latex/classeo_breed.tex
new file mode 100644
index 000000000..a54153d60
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_breed.tex
@@ -0,0 +1,33 @@
+\section{eo\-Breed$<$ EOT $>$ Class Template Reference}
+\label{classeo_breed}\index{eoBreed@{eoBreed}}
+Breeding: combination of selecting and transforming a population.  
+
+
+{\tt \#include $<$eo\-Breed.h$>$}
+
+Inheritance diagram for eo\-Breed$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=1.37592cm]{classeo_breed}
+\end{center}
+\end{figure}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Breed$<$ EOT $>$}
+
+Breeding: combination of selecting and transforming a population. 
+
+Breeding is thought of a combination of selecting and transforming a population. For efficiency reasons you might want to build your own eo\-Breed derived class rather than relying on a seperate select and transform function.
+
+\begin{Desc}
+\item[See also:]{\bf eo\-Select}{\rm (p.\,\pageref{classeo_select})}, {\bf eo\-Transform}{\rm (p.\,\pageref{classeo_transform})}, {\bf eo\-Select\-Transform}{\rm (p.\,\pageref{classeo_select_transform})} \end{Desc}
+
+
+
+
+Definition at line 46 of file eo\-Breed.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Breed.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_c_m_a_breed.eps b/trunk/paradiseo-eo/doc/latex/classeo_c_m_a_breed.eps
new file mode 100644
index 000000000..bbb5817b3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_c_m_a_breed.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 62.0155
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 8.0625 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoCMABreed< FitT >) cw
+(eoBreed< eoVector< FitT, double > >) cw
+(eoBF< const eoPop< eoVector< FitT, double > > &, eoPop< eoVector< FitT, double > > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< const eoPop< eoVector< FitT, double > > &, eoPop< eoVector< FitT, double > > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoCMABreed< FitT >) 0.5 0 box
+ (eoBreed< eoVector< FitT, double > >) 0.5 1 box
+ (eoBF< const eoPop< eoVector< FitT, double > > &, eoPop< eoVector< FitT, double > > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< const eoPop< eoVector< FitT, double > > &, eoPop< eoVector< FitT, double > > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_c_m_a_breed.tex b/trunk/paradiseo-eo/doc/latex/classeo_c_m_a_breed.tex
new file mode 100644
index 000000000..9b0bc09a8
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_c_m_a_breed.tex
@@ -0,0 +1,51 @@
+\section{eo\-CMABreed$<$ Fit\-T $>$ Class Template Reference}
+\label{classeo_c_m_a_breed}\index{eoCMABreed@{eoCMABreed}}
+TODO, handle bounds.  
+
+
+{\tt \#include $<$eo\-CMABreed.h$>$}
+
+Inheritance diagram for eo\-CMABreed$<$ Fit\-T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=1.73643cm]{classeo_c_m_a_breed}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-CMABreed} (eo::CMAState \&state\_\-, unsigned lambda\_\-)\label{classeo_c_m_a_breed_a0}
+
+\item 
+void {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&parents, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&offspring)\label{classeo_c_m_a_breed_a1}
+
+\end{CompactItemize}
+\subsection*{Private Types}
+\begin{CompactItemize}
+\item 
+typedef {\bf eo\-Vector}$<$ {\bf Fit\-T}, double $>$ {\bf EOT}\label{classeo_c_m_a_breed_y0}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+eo::CMAState \& {\bf state}\label{classeo_c_m_a_breed_r0}
+
+\item 
+unsigned {\bf lambda}\label{classeo_c_m_a_breed_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Fit\-T$>$ class eo\-CMABreed$<$ Fit\-T $>$}
+
+TODO, handle bounds. 
+
+
+
+Definition at line 36 of file eo\-CMABreed.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-CMABreed.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_c_m_a_init.eps b/trunk/paradiseo-eo/doc/latex/classeo_c_m_a_init.eps
new file mode 100644
index 000000000..57a59fbc7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_c_m_a_init.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 125
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoCMAInit< FitT >) cw
+(eoInit< eoVector< FitT, double > >) cw
+(eoUF< eoVector< FitT, double > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< eoVector< FitT, double > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoCMAInit< FitT >) 0.5 0 box
+ (eoInit< eoVector< FitT, double > >) 0.5 1 box
+ (eoUF< eoVector< FitT, double > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< eoVector< FitT, double > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_c_m_a_init.tex b/trunk/paradiseo-eo/doc/latex/classeo_c_m_a_init.tex
new file mode 100644
index 000000000..f7447339d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_c_m_a_init.tex
@@ -0,0 +1,48 @@
+\section{eo\-CMAInit$<$ Fit\-T $>$ Class Template Reference}
+\label{classeo_c_m_a_init}\index{eoCMAInit@{eoCMAInit}}
+TODO, handle bounds.  
+
+
+{\tt \#include $<$eo\-CMAInit.h$>$}
+
+Inheritance diagram for eo\-CMAInit$<$ Fit\-T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.5cm]{classeo_c_m_a_init}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-CMAInit} (const eo::CMAState \&state\_\-)\label{classeo_c_m_a_init_a0}
+
+\item 
+void {\bf operator()} ({\bf EOT} \&v)\label{classeo_c_m_a_init_a1}
+
+\end{CompactItemize}
+\subsection*{Private Types}
+\begin{CompactItemize}
+\item 
+typedef {\bf eo\-Vector}$<$ {\bf Fit\-T}, double $>$ {\bf EOT}\label{classeo_c_m_a_init_y0}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+const eo::CMAState \& {\bf state}\label{classeo_c_m_a_init_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Fit\-T$>$ class eo\-CMAInit$<$ Fit\-T $>$}
+
+TODO, handle bounds. 
+
+
+
+Definition at line 37 of file eo\-CMAInit.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-CMAInit.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_cellular_easy_e_a.eps b/trunk/paradiseo-eo/doc/latex/classeo_cellular_easy_e_a.eps
new file mode 100644
index 000000000..f803ca678
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_cellular_easy_e_a.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 153.257
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.2625 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoCellularEasyEA< EOT >) cw
+(eoAlgo< EOT >) cw
+(eoUF< eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoCellularEasyEA< EOT >) 0.5 0 box
+ (eoAlgo< EOT >) 0.5 1 box
+ (eoUF< eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_cellular_easy_e_a.tex b/trunk/paradiseo-eo/doc/latex/classeo_cellular_easy_e_a.tex
new file mode 100644
index 000000000..15d6575d9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_cellular_easy_e_a.tex
@@ -0,0 +1,72 @@
+\section{eo\-Cellular\-Easy\-EA$<$ EOT $>$ Class Template Reference}
+\label{classeo_cellular_easy_e_a}\index{eoCellularEasyEA@{eoCellularEasyEA}}
+The abstract cellular easy algorithm.  
+
+
+{\tt \#include $<$eo\-Cellular\-Easy\-EA.h$>$}
+
+Inheritance diagram for eo\-Cellular\-Easy\-EA$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_cellular_easy_e_a}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Cellular\-Easy\-EA} ({\bf eo\-Continue}$<$ {\bf EOT} $>$ \&\_\-cont, {\bf eo\-Eval\-Func}$<$ {\bf EOT} $>$ \&\_\-eval, {\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \&\_\-sel\_\-neigh, {\bf eo\-Bin\-Op}$<$ {\bf EOT} $>$ \&\_\-cross, {\bf eo\-Mon\-Op}$<$ {\bf EOT} $>$ \&\_\-mut, {\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \&\_\-sel\_\-repl)\label{classeo_cellular_easy_e_a_a0}
+
+\begin{CompactList}\small\item\em Two constructors. \item\end{CompactList}\item 
+{\bf eo\-Cellular\-Easy\-EA} ({\bf eo\-Continue}$<$ {\bf EOT} $>$ \&\_\-cont, {\bf eo\-Eval\-Func}$<$ {\bf EOT} $>$ \&\_\-eval, {\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \&\_\-sel\_\-neigh, {\bf eo\-Quad\-Op}$<$ {\bf EOT} $>$ \&\_\-cross, {\bf eo\-Mon\-Op}$<$ {\bf EOT} $>$ \&\_\-mut, {\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \&\_\-sel\_\-child, {\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \&\_\-sel\_\-repl)\label{classeo_cellular_easy_e_a_a1}
+
+\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&pop)\label{classeo_cellular_easy_e_a_a2}
+
+\begin{CompactList}\small\item\em For a given population. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Protected Member Functions}
+\begin{CompactItemize}
+\item 
+virtual {\bf eo\-Pop}$<$ {\bf EOT} $>$ {\bf neighbours} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&pop, int rank)=0\label{classeo_cellular_easy_e_a_b0}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Continue}$<$ {\bf EOT} $>$ \& {\bf cont}\label{classeo_cellular_easy_e_a_r0}
+
+\item 
+{\bf eo\-Eval\-Func}$<$ {\bf EOT} $>$ \& {\bf eval}\label{classeo_cellular_easy_e_a_r1}
+
+\item 
+{\bf eo\-Pop\-Loop\-Eval}$<$ {\bf EOT} $>$ {\bf pop\-Eval}\label{classeo_cellular_easy_e_a_r2}
+
+\item 
+{\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \& {\bf sel\_\-neigh}\label{classeo_cellular_easy_e_a_r3}
+
+\item 
+{\bf eo\-BF}$<$ {\bf EOT} \&, {\bf EOT} \&, bool $>$ \& {\bf cross}\label{classeo_cellular_easy_e_a_r4}
+
+\item 
+{\bf eo\-Mon\-Op}$<$ {\bf EOT} $>$ \& {\bf mut}\label{classeo_cellular_easy_e_a_r5}
+
+\item 
+{\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \& {\bf sel\_\-child}\label{classeo_cellular_easy_e_a_r6}
+
+\item 
+{\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \& {\bf sel\_\-repl}\label{classeo_cellular_easy_e_a_r7}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Cellular\-Easy\-EA$<$ EOT $>$}
+
+The abstract cellular easy algorithm. 
+
+
+
+Definition at line 38 of file eo\-Cellular\-Easy\-EA.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Cellular\-Easy\-EA.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_check_point.eps b/trunk/paradiseo-eo/doc/latex/classeo_check_point.eps
new file mode 100644
index 000000000..a4b0aa7d6
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_check_point.eps
@@ -0,0 +1,227 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 90.0901
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.55 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoCheckPoint< EOT >) cw
+(eoContinue< EOT >) cw
+(eoUF< const eoPop< EOT > &, bool >) cw
+(eoPersistent) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, bool >) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoCheckPoint< EOT >) 1.25 0 box
+ (eoContinue< EOT >) 1.25 1 box
+ (eoUF< const eoPop< EOT > &, bool >) 0.5 2 box
+ (eoPersistent) 2 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< const eoPop< EOT > &, bool >) 1 3 box
+ (eoPrintable) 2 3 box
+
+% ----- relations -----
+
+solid
+0 1.25 0 out
+solid
+1 1.25 1 in
+solid
+0 1.25 1 out
+solid
+0.5 2 2 conn
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 2 2 in
+solid
+0 2 2 out
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+1 2 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_check_point.tex b/trunk/paradiseo-eo/doc/latex/classeo_check_point.tex
new file mode 100644
index 000000000..6006ecefc
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_check_point.tex
@@ -0,0 +1,77 @@
+\section{eo\-Check\-Point$<$ EOT $>$ Class Template Reference}
+\label{classeo_check_point}\index{eoCheckPoint@{eoCheckPoint}}
+eo\-Check\-Point is a container class.  
+
+
+{\tt \#include $<$eo\-Check\-Point.h$>$}
+
+Inheritance diagram for eo\-Check\-Point$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.52252cm]{classeo_check_point}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Check\-Point} ({\bf eo\-Continue}$<$ {\bf EOT} $>$ \&\_\-cont)\label{classeo_check_point_a0}
+
+\item 
+bool {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_check_point_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\item 
+void {\bf add} ({\bf eo\-Continue}$<$ {\bf EOT} $>$ \&\_\-cont)\label{classeo_check_point_a2}
+
+\item 
+void {\bf add} ({\bf eo\-Sorted\-Stat\-Base}$<$ {\bf EOT} $>$ \&\_\-stat)\label{classeo_check_point_a3}
+
+\item 
+void {\bf add} ({\bf eo\-Stat\-Base}$<$ {\bf EOT} $>$ \&\_\-stat)\label{classeo_check_point_a4}
+
+\item 
+void {\bf add} ({\bf eo\-Monitor} \&\_\-mon)\label{classeo_check_point_a5}
+
+\item 
+void {\bf add} ({\bf eo\-Updater} \&\_\-upd)\label{classeo_check_point_a6}
+
+\item 
+virtual std::string {\bf class\-Name} (void) const \label{classeo_check_point_a7}
+
+\item 
+std::string {\bf all\-Class\-Names} () const \label{classeo_check_point_a8}
+
+\begin{CompactList}\small\item\em returns a string with all class\-Name() of data separated with \char`\"{}$\backslash$n\char`\"{} (for debugging) \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+std::vector$<$ {\bf eo\-Continue}$<$ {\bf EOT} $>$ $\ast$ $>$ {\bf continuators}\label{classeo_check_point_r0}
+
+\item 
+std::vector$<$ {\bf eo\-Sorted\-Stat\-Base}$<$ {\bf EOT} $>$ $\ast$ $>$ {\bf sorted}\label{classeo_check_point_r1}
+
+\item 
+std::vector$<$ {\bf eo\-Stat\-Base}$<$ {\bf EOT} $>$ $\ast$ $>$ {\bf stats}\label{classeo_check_point_r2}
+
+\item 
+std::vector$<$ {\bf eo\-Monitor} $\ast$ $>$ {\bf monitors}\label{classeo_check_point_r3}
+
+\item 
+std::vector$<$ {\bf eo\-Updater} $\ast$ $>$ {\bf updaters}\label{classeo_check_point_r4}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Check\-Point$<$ EOT $>$}
+
+eo\-Check\-Point is a container class. 
+
+It contains std::vectors of (pointers to) {\bf eo\-Continue}{\rm (p.\,\pageref{classeo_continue})} (modif. MS July 16. 2002) eo\-Stats, {\bf eo\-Updater}{\rm (p.\,\pageref{classeo_updater})} and {\bf eo\-Monitor}{\rm (p.\,\pageref{classeo_monitor})} it is an {\bf eo\-Continue}{\rm (p.\,\pageref{classeo_continue})}, so its operator() will be called every generation - and will return the contained-combined-eo\-Continue result but before that it will call in turn every single \{statistics, updaters, monitors\} that it has been given, and after that, if stopping, all last\-Call methods of the above. 
+
+
+
+Definition at line 46 of file eo\-Check\-Point.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Check\-Point.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_collapse_subtree_mutation.eps b/trunk/paradiseo-eo/doc/latex/classeo_collapse_subtree_mutation.eps
new file mode 100644
index 000000000..5addd882e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_collapse_subtree_mutation.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 76.6284
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 6.525 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoCollapseSubtreeMutation< FType, Node >) cw
+(eoMonOp< eoParseTree< FType, Node > >) cw
+(eoOp< eoParseTree< FType, Node > >) cw
+(eoUF< eoParseTree< FType, Node > &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< eoParseTree< FType, Node > &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoCollapseSubtreeMutation< FType, Node >) 0.5 0 box
+ (eoMonOp< eoParseTree< FType, Node > >) 0.5 1 box
+ (eoOp< eoParseTree< FType, Node > >) 0 2 box
+ (eoUF< eoParseTree< FType, Node > &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< eoParseTree< FType, Node > &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_collapse_subtree_mutation.tex b/trunk/paradiseo-eo/doc/latex/classeo_collapse_subtree_mutation.tex
new file mode 100644
index 000000000..1621cf639
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_collapse_subtree_mutation.tex
@@ -0,0 +1,91 @@
+\section{eo\-Collapse\-Subtree\-Mutation$<$ FType, Node $>$ Class Template Reference}
+\label{classeo_collapse_subtree_mutation}\index{eoCollapseSubtreeMutation@{eoCollapseSubtreeMutation}}
+eo\-Collapse\-Subtree --$>$ replace a subtree with a randomly chosen terminal  
+
+
+{\tt \#include $<$gp/eo\-Parse\-Tree\-Op.h$>$}
+
+Inheritance diagram for eo\-Collapse\-Subtree\-Mutation$<$ FType, Node $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.14559cm]{classeo_collapse_subtree_mutation}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef {\bf eo\-Parse\-Tree}$<$ FType, Node $>$ {\bf Eo\-Type}\label{classeo_collapse_subtree_mutation_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Collapse\-Subtree\-Mutation} ({\bf eo\-Init}$<$ {\bf Eo\-Type} $>$ \&\_\-init, unsigned \_\-max\_\-length)
+\begin{CompactList}\small\item\em Constructor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_collapse_subtree_mutation_a1}
+
+\begin{CompactList}\small\item\em The class name. \item\end{CompactList}\item 
+virtual {\bf $\sim$eo\-Collapse\-Subtree\-Mutation} ()\label{classeo_collapse_subtree_mutation_a2}
+
+\begin{CompactList}\small\item\em Dtor. \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf Eo\-Type} \&\_\-eo1)
+\begin{CompactList}\small\item\em Mutate an individual. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf max\_\-length}\label{classeo_collapse_subtree_mutation_r0}
+
+\item 
+{\bf eo\-Init}$<$ {\bf Eo\-Type} $>$ \& {\bf initializer}\label{classeo_collapse_subtree_mutation_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class FType, class Node$>$ class eo\-Collapse\-Subtree\-Mutation$<$ FType, Node $>$}
+
+eo\-Collapse\-Subtree --$>$ replace a subtree with a randomly chosen terminal 
+
+
+
+Definition at line 272 of file eo\-Parse\-Tree\-Op.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoCollapseSubtreeMutation@{eo\-Collapse\-Subtree\-Mutation}!eoCollapseSubtreeMutation@{eoCollapseSubtreeMutation}}
+\index{eoCollapseSubtreeMutation@{eoCollapseSubtreeMutation}!eoCollapseSubtreeMutation@{eo\-Collapse\-Subtree\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ {\bf eo\-Collapse\-Subtree\-Mutation}$<$ FType, Node $>$::{\bf eo\-Collapse\-Subtree\-Mutation} ({\bf eo\-Init}$<$ {\bf Eo\-Type} $>$ \& {\em \_\-init}, unsigned {\em \_\-max\_\-length})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_collapse_subtree_mutation_a0}
+
+
+Constructor. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-init}]An instantiation of eo\-Gp\-Depth\-Initializer \item[{\em \_\-max\_\-length}]the maximum size of an individual \end{description}
+\end{Desc}
+
+
+Definition at line 282 of file eo\-Parse\-Tree\-Op.h.
+
+\subsection{Member Function Documentation}
+\index{eoCollapseSubtreeMutation@{eo\-Collapse\-Subtree\-Mutation}!operator()@{operator()}}
+\index{operator()@{operator()}!eoCollapseSubtreeMutation@{eo\-Collapse\-Subtree\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ bool {\bf eo\-Collapse\-Subtree\-Mutation}$<$ FType, Node $>$::operator() ({\bf Eo\-Type} \& {\em \_\-eo1})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_collapse_subtree_mutation_a3}
+
+
+Mutate an individual. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-eo1}]The individual that is to be changed \end{description}
+\end{Desc}
+
+
+Definition at line 295 of file eo\-Parse\-Tree\-Op.h.
+
+References eo\-Parse\-Tree$<$ FType, Node $>$::prune\-Tree(), and eo\-Rng::random().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Parse\-Tree\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_combined_continue.eps b/trunk/paradiseo-eo/doc/latex/classeo_combined_continue.eps
new file mode 100644
index 000000000..8154aee21
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_combined_continue.eps
@@ -0,0 +1,227 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 90.0901
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.55 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoCombinedContinue< EOT >) cw
+(eoContinue< EOT >) cw
+(eoUF< const eoPop< EOT > &, bool >) cw
+(eoPersistent) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, bool >) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoCombinedContinue< EOT >) 1.25 0 box
+ (eoContinue< EOT >) 1.25 1 box
+ (eoUF< const eoPop< EOT > &, bool >) 0.5 2 box
+ (eoPersistent) 2 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< const eoPop< EOT > &, bool >) 1 3 box
+ (eoPrintable) 2 3 box
+
+% ----- relations -----
+
+solid
+0 1.25 0 out
+solid
+1 1.25 1 in
+solid
+0 1.25 1 out
+solid
+0.5 2 2 conn
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 2 2 in
+solid
+0 2 2 out
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+1 2 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_combined_continue.tex b/trunk/paradiseo-eo/doc/latex/classeo_combined_continue.tex
new file mode 100644
index 000000000..2b47f5da8
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_combined_continue.tex
@@ -0,0 +1,64 @@
+\section{eo\-Combined\-Continue$<$ EOT $>$ Class Template Reference}
+\label{classeo_combined_continue}\index{eoCombinedContinue@{eoCombinedContinue}}
+Combined continuators - logical AND: Continues until one of the embedded continuators says halt!  
+
+
+{\tt \#include $<$eo\-Combined\-Continue.h$>$}
+
+Inheritance diagram for eo\-Combined\-Continue$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.52252cm]{classeo_combined_continue}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Fitness {\bf Fitness\-Type}\label{classeo_combined_continue_w0}
+
+\begin{CompactList}\small\item\em Define Fitness. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Combined\-Continue} ({\bf eo\-Continue}$<$ {\bf EOT} $>$ \&\_\-cont)\label{classeo_combined_continue_a0}
+
+\begin{CompactList}\small\item\em Ctor, make sure that at least on continuator is present. \item\end{CompactList}\item 
+{\bf eo\-Combined\-Continue} ({\bf eo\-Continue}$<$ {\bf EOT} $>$ \&\_\-cont1, {\bf eo\-Continue}$<$ {\bf EOT} $>$ \&\_\-cont2)\label{classeo_combined_continue_a1}
+
+\begin{CompactList}\small\item\em Ctor - for historical reasons ... should disspear some day. \item\end{CompactList}\item 
+void {\bf add} ({\bf eo\-Continue}$<$ {\bf EOT} $>$ \&\_\-cont)\label{classeo_combined_continue_a2}
+
+\item 
+void {\bf remove\-Last} (void)\label{classeo_combined_continue_a3}
+
+\item 
+virtual bool {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_combined_continue_a4}
+
+\begin{CompactList}\small\item\em Returns false when one of the embedded continuators say so (logical and). \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} (void) const \label{classeo_combined_continue_a5}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+std::vector$<$ {\bf eo\-Continue}$<$ {\bf EOT} $>$ $\ast$ $>$ {\bf continuators}\label{classeo_combined_continue_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Combined\-Continue$<$ EOT $>$}
+
+Combined continuators - logical AND: Continues until one of the embedded continuators says halt! 
+
+20/11/00 MS: Changed the 2-continuator construct to a std::vector$<$eo\-Continue$<$EOT$>$ $>$ to be consistent with other Combined constructs and allow to easily handle more than 2 continuators
+
+02/2003 Ram\'{o}n Casero Ca\~{n}as - added the remove\-Last() method 
+
+
+
+Definition at line 42 of file eo\-Combined\-Continue.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Combined\-Continue.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_combined_init.eps b/trunk/paradiseo-eo/doc/latex/classeo_combined_init.eps
new file mode 100644
index 000000000..38120c1ee
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_combined_init.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 199.005
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.5125 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoCombinedInit< EOT >) cw
+(eoInit< EOT >) cw
+(eoUF< EOT &, void >) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoCombinedInit< EOT >) 0.5 0 box
+ (eoInit< EOT >) 0.5 1 box
+ (eoUF< EOT &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< EOT &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_combined_init.tex b/trunk/paradiseo-eo/doc/latex/classeo_combined_init.tex
new file mode 100644
index 000000000..4ffa4fdd1
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_combined_init.tex
@@ -0,0 +1,69 @@
+\section{eo\-Combined\-Init$<$ EOT $>$ Class Template Reference}
+\label{classeo_combined_init}\index{eoCombinedInit@{eoCombinedInit}}
+Combined INIT: a proportional recombination of {\bf eo\-Init}{\rm (p.\,\pageref{classeo_init})} objects.  
+
+
+{\tt \#include $<$eo\-Combined\-Init.h$>$}
+
+Inheritance diagram for eo\-Combined\-Init$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_combined_init}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Combined\-Init} ({\bf eo\-Init}$<$ {\bf EOT} $>$ \&\_\-init, double \_\-rate)\label{classeo_combined_init_a0}
+
+\begin{CompactList}\small\item\em Ctor, make sure that at least one {\bf eo\-Init}{\rm (p.\,\pageref{classeo_init})} is present. \item\end{CompactList}\item 
+void {\bf add} ({\bf eo\-Init}$<$ {\bf EOT} $>$ \&\_\-init, double \_\-rate, bool \_\-verbose=false)\label{classeo_combined_init_a1}
+
+\begin{CompactList}\small\item\em The usual method to add objects to the combination note the \_\-verbose parameter, that allows to print what's inside the combination with scaled rates. \item\end{CompactList}\item 
+virtual void {\bf print\-On} (std::ostream \&\_\-os)\label{classeo_combined_init_a2}
+
+\begin{CompactList}\small\item\em outputs the operators and percentages \item\end{CompactList}\item 
+virtual void {\bf operator()} ({\bf EOT} \&\_\-eo)\label{classeo_combined_init_a3}
+
+\begin{CompactList}\small\item\em Performs the init: chooses among all initializers using roulette wheel on the rates. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} (void) const 
+\begin{CompactList}\small\item\em class\-Name: Mandatory because of eo\-Combined\-Init. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+std::vector$<$ {\bf eo\-Init}$<$ {\bf EOT} $>$ $\ast$ $>$ {\bf initializers}\label{classeo_combined_init_r0}
+
+\item 
+std::vector$<$ double $>$ {\bf rates}\label{classeo_combined_init_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Combined\-Init$<$ EOT $>$}
+
+Combined INIT: a proportional recombination of {\bf eo\-Init}{\rm (p.\,\pageref{classeo_init})} objects. 
+
+
+
+Definition at line 35 of file eo\-Combined\-Init.h.
+
+\subsection{Member Function Documentation}
+\index{eoCombinedInit@{eo\-Combined\-Init}!className@{className}}
+\index{className@{className}!eoCombinedInit@{eo\-Combined\-Init}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ virtual std::string {\bf eo\-Combined\-Init}$<$ {\bf EOT} $>$::class\-Name (void) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_combined_init_a4}
+
+
+class\-Name: Mandatory because of eo\-Combined\-Init. 
+
+SHould be pure virtual, but then we should go over the whole code to write the method for all derived classes ... MS 16/7/04 
+
+Reimplemented from {\bf eo\-Init$<$ EOT $>$} {\rm (p.\,\pageref{classeo_init_a0})}.
+
+Definition at line 81 of file eo\-Combined\-Init.h.
+
+Referenced by eo\-Combined\-Init$<$ EOT $>$::print\-On().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Combined\-Init.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_comma_replacement.eps b/trunk/paradiseo-eo/doc/latex/classeo_comma_replacement.eps
new file mode 100644
index 000000000..347a3a78a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_comma_replacement.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 134.409
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.72 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoCommaReplacement< EOT >) cw
+(eoMergeReduce< EOT >) cw
+(eoReplacement< EOT >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoCommaReplacement< EOT >) 0.5 0 box
+ (eoMergeReduce< EOT >) 0.5 1 box
+ (eoReplacement< EOT >) 0.5 2 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 3 box
+ (eoFunctorBase) 0 4 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 1 4 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+1 0.5 3 in
+solid
+0 0.5 3 out
+solid
+0 1 4 conn
+solid
+1 0 4 in
+solid
+1 1 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_comma_replacement.tex b/trunk/paradiseo-eo/doc/latex/classeo_comma_replacement.tex
new file mode 100644
index 000000000..1b6c2aca9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_comma_replacement.tex
@@ -0,0 +1,36 @@
+\section{eo\-Comma\-Replacement$<$ EOT $>$ Class Template Reference}
+\label{classeo_comma_replacement}\index{eoCommaReplacement@{eoCommaReplacement}}
+ES type of replacement strategy: ignore parents, truncate offspring.  
+
+
+{\tt \#include $<$eo\-Merge\-Reduce.h$>$}
+
+Inheritance diagram for eo\-Comma\-Replacement$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.76344cm]{classeo_comma_replacement}
+\end{center}
+\end{figure}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-No\-Elitism}$<$ {\bf EOT} $>$ {\bf no\_\-elite}\label{classeo_comma_replacement_r0}
+
+\item 
+{\bf eo\-Truncate}$<$ {\bf EOT} $>$ {\bf truncate}\label{classeo_comma_replacement_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Comma\-Replacement$<$ EOT $>$}
+
+ES type of replacement strategy: ignore parents, truncate offspring. 
+
+
+
+Definition at line 87 of file eo\-Merge\-Reduce.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Merge\-Reduce.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_continue.eps b/trunk/paradiseo-eo/doc/latex/classeo_continue.eps
new file mode 100644
index 000000000..99155abff
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_continue.eps
@@ -0,0 +1,257 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 185.811
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.69091 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 11 def
+/cols 4 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoContinue< EOT >) cw
+(eoUF< const eoPop< EOT > &, bool >) cw
+(eoPersistent) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, bool >) cw
+(eoPrintable) cw
+(eoCheckPoint< EOT >) cw
+(eoCombinedContinue< EOT >) cw
+(eoCtrlCContinue< EOT >) cw
+(eoEvalContinue< EOT >) cw
+(eoFitContinue< EOT >) cw
+(eoGenContinue< EOT >) cw
+(eoPeriodicContinue< EOT >) cw
+(eoSteadyFitContinue< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoContinue< EOT >) 1.25 8 box
+ (eoUF< const eoPop< EOT > &, bool >) 0.5 9 box
+ (eoPersistent) 2 9 box
+ (eoFunctorBase) 0 10 box
+ (unary_function< const eoPop< EOT > &, bool >) 1 10 box
+ (eoPrintable) 2 10 box
+ (eoCheckPoint< EOT >) 2.25 7 box
+ (eoCombinedContinue< EOT >) 2.25 6 box
+ (eoCtrlCContinue< EOT >) 2.25 5 box
+ (eoEvalContinue< EOT >) 2.25 4 box
+ (eoFitContinue< EOT >) 2.25 3 box
+ (eoGenContinue< EOT >) 2.25 2 box
+ (eoPeriodicContinue< EOT >) 2.25 1 box
+ (eoSteadyFitContinue< EOT >) 2.25 0 box
+
+% ----- relations -----
+
+solid
+0 1.25 8 out
+solid
+0.5 2 9 conn
+solid
+1 0.5 9 in
+solid
+0 0.5 9 out
+solid
+0 1 10 conn
+solid
+1 2 9 in
+solid
+0 2 9 out
+solid
+1 0 10 in
+solid
+1 1 10 in
+solid
+1 2 10 in
+solid
+1 1.25 7.25 out
+solid
+0 1.25 7.5 hedge
+solid
+0 1.25 6.5 hedge
+solid
+0 1.25 5.5 hedge
+solid
+0 1.25 4.5 hedge
+solid
+0 1.25 3.5 hedge
+solid
+0 1.25 2.5 hedge
+solid
+0 1.25 1.5 hedge
+solid
+0 1.25 0.5 hedge
+solid
+1.25 8 0.5 vedge
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_continue.tex b/trunk/paradiseo-eo/doc/latex/classeo_continue.tex
new file mode 100644
index 000000000..61035c420
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_continue.tex
@@ -0,0 +1,81 @@
+\section{eo\-Continue$<$ EOT $>$ Class Template Reference}
+\label{classeo_continue}\index{eoContinue@{eoContinue}}
+Termination condition for the genetic algorithm Takes the population as input, returns true for continue, false for termination.  
+
+
+{\tt \#include $<$eo\-Continue.h$>$}
+
+Inheritance diagram for eo\-Continue$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=5.2027cm]{classeo_continue}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual std::string {\bf class\-Name} (void) const \label{classeo_continue_a0}
+
+\item 
+void {\bf read\-From} (std::istream \&\_\-\_\-is)
+\begin{CompactList}\small\item\em Read object. \item\end{CompactList}\item 
+void {\bf print\-On} (std::ostream \&\_\-\_\-os) const 
+\begin{CompactList}\small\item\em Write object. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Continue$<$ EOT $>$}
+
+Termination condition for the genetic algorithm Takes the population as input, returns true for continue, false for termination. 
+
+
+
+Definition at line 37 of file eo\-Continue.h.
+
+\subsection{Member Function Documentation}
+\index{eoContinue@{eo\-Continue}!readFrom@{readFrom}}
+\index{readFrom@{readFrom}!eoContinue@{eo\-Continue}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ void {\bf eo\-Continue}$<$ {\bf EOT} $>$::read\-From (std::istream \& {\em \_\-\_\-is})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_continue_a1}
+
+
+Read object. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-is}]A std::istream. \end{description}
+\end{Desc}
+\begin{Desc}
+\item[Exceptions:]
+\begin{description}
+\item[{\em runtime\_\-std::exception}]If a valid object can't be read. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Persistent} {\rm (p.\,\pageref{classeo_persistent_a1})}.
+
+Reimplemented in {\bf eo\-Gen\-Continue$<$ EOT $>$} {\rm (p.\,\pageref{classeo_gen_continue_a6})}.
+
+Definition at line 42 of file eo\-Continue.h.\index{eoContinue@{eo\-Continue}!printOn@{printOn}}
+\index{printOn@{printOn}!eoContinue@{eo\-Continue}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ void {\bf eo\-Continue}$<$ {\bf EOT} $>$::print\-On (std::ostream \& {\em \_\-\_\-os}) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_continue_a2}
+
+
+Write object. 
+
+It's called print\-On since it prints the object on a stream. \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-os}]A std::ostream. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Printable} {\rm (p.\,\pageref{classeo_printable_a1})}.
+
+Reimplemented in {\bf eo\-Gen\-Continue$<$ EOT $>$} {\rm (p.\,\pageref{classeo_gen_continue_a7})}.
+
+Definition at line 47 of file eo\-Continue.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Continue.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_counted_dyn_update.eps b/trunk/paradiseo-eo/doc/latex/classeo_counted_dyn_update.eps
new file mode 100644
index 000000000..8860f166f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_counted_dyn_update.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 699.301
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 0.715 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoCountedDynUpdate) cw
+(eoDynUpdater) cw
+(eoUpdater) cw
+(eoF< void >) cw
+(eoFunctorBase) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoCountedDynUpdate) 0 0 box
+ (eoDynUpdater) 0 1 box
+ (eoUpdater) 0 2 box
+ (eoF< void >) 0 3 box
+ (eoFunctorBase) 0 4 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 0 3 in
+solid
+0 0 3 out
+solid
+1 0 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_counted_dyn_update.tex b/trunk/paradiseo-eo/doc/latex/classeo_counted_dyn_update.tex
new file mode 100644
index 000000000..9137976de
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_counted_dyn_update.tex
@@ -0,0 +1,43 @@
+\section{eo\-Counted\-Dyn\-Update Class Reference}
+\label{classeo_counted_dyn_update}\index{eoCountedDynUpdate@{eoCountedDynUpdate}}
+An {\bf eo\-Updater}{\rm (p.\,\pageref{classeo_updater})} to update an {\bf eo\-Updatable}{\rm (p.\,\pageref{classeo_updatable})} object every given tic.  
+
+
+{\tt \#include $<$eo\-Updatable.h$>$}
+
+Inheritance diagram for eo\-Counted\-Dyn\-Update::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=5cm]{classeo_counted_dyn_update}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Counted\-Dyn\-Update} ({\bf eo\-Updatable} \&\_\-to\-Update, unsigned \_\-interval)\label{classeo_counted_dyn_update_a0}
+
+\item 
+void {\bf operator()} (void)\label{classeo_counted_dyn_update_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+const unsigned {\bf interval}\label{classeo_counted_dyn_update_r0}
+
+\item 
+unsigned {\bf counter}\label{classeo_counted_dyn_update_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+An {\bf eo\-Updater}{\rm (p.\,\pageref{classeo_updater})} to update an {\bf eo\-Updatable}{\rm (p.\,\pageref{classeo_updatable})} object every given tic. 
+
+
+
+Definition at line 93 of file eo\-Updatable.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Updatable.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_counted_state_saver.eps b/trunk/paradiseo-eo/doc/latex/classeo_counted_state_saver.eps
new file mode 100644
index 000000000..2b9adc9c3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_counted_state_saver.eps
@@ -0,0 +1,209 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 559.441
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 0.89375 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoCountedStateSaver) cw
+(eoUpdater) cw
+(eoF< void >) cw
+(eoFunctorBase) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoCountedStateSaver) 0 0 box
+ (eoUpdater) 0 1 box
+ (eoF< void >) 0 2 box
+ (eoFunctorBase) 0 3 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 0 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_counted_state_saver.tex b/trunk/paradiseo-eo/doc/latex/classeo_counted_state_saver.tex
new file mode 100644
index 000000000..79d3f2cbf
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_counted_state_saver.tex
@@ -0,0 +1,71 @@
+\section{eo\-Counted\-State\-Saver Class Reference}
+\label{classeo_counted_state_saver}\index{eoCountedStateSaver@{eoCountedStateSaver}}
+an {\bf eo\-Updater}{\rm (p.\,\pageref{classeo_updater})} that saves a state every given generations  
+
+
+{\tt \#include $<$eo\-Updater.h$>$}
+
+Inheritance diagram for eo\-Counted\-State\-Saver::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_counted_state_saver}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Counted\-State\-Saver} (unsigned \_\-interval, const {\bf eo\-State} \&\_\-state, std::string \_\-prefix, bool \_\-save\-On\-Last\-Call, std::string \_\-extension=\char`\"{}sav\char`\"{}, unsigned \_\-counter=0)\label{classeo_counted_state_saver_a0}
+
+\item 
+{\bf eo\-Counted\-State\-Saver} (unsigned \_\-interval, const {\bf eo\-State} \&\_\-state, std::string \_\-prefix=\char`\"{}state\char`\"{}, std::string \_\-extension=\char`\"{}sav\char`\"{}, unsigned \_\-counter=0)\label{classeo_counted_state_saver_a1}
+
+\item 
+virtual void {\bf last\-Call} (void)\label{classeo_counted_state_saver_a2}
+
+\item 
+void {\bf operator()} (void)\label{classeo_counted_state_saver_a3}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} (void) const \label{classeo_counted_state_saver_a4}
+
+\end{CompactItemize}
+\subsection*{Private Member Functions}
+\begin{CompactItemize}
+\item 
+void {\bf do\-It\-Now} (void)\label{classeo_counted_state_saver_d0}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+const {\bf eo\-State} \& {\bf state}\label{classeo_counted_state_saver_r0}
+
+\item 
+const unsigned {\bf interval}\label{classeo_counted_state_saver_r1}
+
+\item 
+unsigned {\bf counter}\label{classeo_counted_state_saver_r2}
+
+\item 
+bool {\bf save\-On\-Last\-Call}\label{classeo_counted_state_saver_r3}
+
+\item 
+const std::string {\bf prefix}\label{classeo_counted_state_saver_r4}
+
+\item 
+const std::string {\bf extension}\label{classeo_counted_state_saver_r5}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+an {\bf eo\-Updater}{\rm (p.\,\pageref{classeo_updater})} that saves a state every given generations 
+
+
+
+Definition at line 127 of file eo\-Updater.h.
+
+The documentation for this class was generated from the following files:\begin{CompactItemize}
+\item 
+eo\-Updater.h\item 
+eo\-Updater.cpp\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_ctrl_c_continue.eps b/trunk/paradiseo-eo/doc/latex/classeo_ctrl_c_continue.eps
new file mode 100644
index 000000000..901737675
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_ctrl_c_continue.eps
@@ -0,0 +1,227 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 90.0901
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.55 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoCtrlCContinue< EOT >) cw
+(eoContinue< EOT >) cw
+(eoUF< const eoPop< EOT > &, bool >) cw
+(eoPersistent) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, bool >) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoCtrlCContinue< EOT >) 1.25 0 box
+ (eoContinue< EOT >) 1.25 1 box
+ (eoUF< const eoPop< EOT > &, bool >) 0.5 2 box
+ (eoPersistent) 2 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< const eoPop< EOT > &, bool >) 1 3 box
+ (eoPrintable) 2 3 box
+
+% ----- relations -----
+
+solid
+0 1.25 0 out
+solid
+1 1.25 1 in
+solid
+0 1.25 1 out
+solid
+0.5 2 2 conn
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 2 2 in
+solid
+0 2 2 out
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+1 2 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_ctrl_c_continue.tex b/trunk/paradiseo-eo/doc/latex/classeo_ctrl_c_continue.tex
new file mode 100644
index 000000000..1d9a11db5
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_ctrl_c_continue.tex
@@ -0,0 +1,39 @@
+\section{eo\-Ctrl\-CContinue$<$ EOT $>$ Class Template Reference}
+\label{classeo_ctrl_c_continue}\index{eoCtrlCContinue@{eoCtrlCContinue}}
+Ctrl C handling: this {\bf eo\-Continue}{\rm (p.\,\pageref{classeo_continue})} tells whether the user pressed Ctrl C.  
+
+
+{\tt \#include $<$eo\-Ctrl\-CContinue.h$>$}
+
+Inheritance diagram for eo\-Ctrl\-CContinue$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.52252cm]{classeo_ctrl_c_continue}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Ctrl\-CContinue} ()\label{classeo_ctrl_c_continue_a0}
+
+\begin{CompactList}\small\item\em Ctor : installs the signal handler. \item\end{CompactList}\item 
+virtual bool {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-v\-EO)\label{classeo_ctrl_c_continue_a1}
+
+\begin{CompactList}\small\item\em Returns false when Ctrl C has been typed in reached. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} (void) const \label{classeo_ctrl_c_continue_a2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Ctrl\-CContinue$<$ EOT $>$}
+
+Ctrl C handling: this {\bf eo\-Continue}{\rm (p.\,\pageref{classeo_continue})} tells whether the user pressed Ctrl C. 
+
+
+
+Definition at line 45 of file eo\-Ctrl\-CContinue.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Ctrl\-CContinue.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_det_bit_flip.eps b/trunk/paradiseo-eo/doc/latex/classeo_det_bit_flip.eps
new file mode 100644
index 000000000..18676a91b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_det_bit_flip.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 125.196
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.99375 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoDetBitFlip< Chrom >) cw
+(eoMonOp< Chrom >) cw
+(eoOp< Chrom >) cw
+(eoUF< Chrom &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< Chrom &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoDetBitFlip< Chrom >) 0.5 0 box
+ (eoMonOp< Chrom >) 0.5 1 box
+ (eoOp< Chrom >) 0 2 box
+ (eoUF< Chrom &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< Chrom &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_det_bit_flip.tex b/trunk/paradiseo-eo/doc/latex/classeo_det_bit_flip.tex
new file mode 100644
index 000000000..4d49b8f71
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_det_bit_flip.tex
@@ -0,0 +1,79 @@
+\section{eo\-Det\-Bit\-Flip$<$ Chrom $>$ Class Template Reference}
+\label{classeo_det_bit_flip}\index{eoDetBitFlip@{eoDetBitFlip}}
+eo\-Det\-Bit\-Flip --$>$ changes exactly k bits  
+
+
+{\tt \#include $<$ga/eo\-Bit\-Op.h$>$}
+
+Inheritance diagram for eo\-Det\-Bit\-Flip$<$ Chrom $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.50548cm]{classeo_det_bit_flip}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Det\-Bit\-Flip} (const unsigned \&\_\-num\_\-bit=1)
+\begin{CompactList}\small\item\em (Default) Constructor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_det_bit_flip_a1}
+
+\begin{CompactList}\small\item\em The class name. \item\end{CompactList}\item 
+bool {\bf operator()} (Chrom \&chrom)
+\begin{CompactList}\small\item\em Change num\_\-bit bits. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf num\_\-bit}\label{classeo_det_bit_flip_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Chrom$>$ class eo\-Det\-Bit\-Flip$<$ Chrom $>$}
+
+eo\-Det\-Bit\-Flip --$>$ changes exactly k bits 
+
+
+
+Definition at line 67 of file eo\-Bit\-Op.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoDetBitFlip@{eo\-Det\-Bit\-Flip}!eoDetBitFlip@{eoDetBitFlip}}
+\index{eoDetBitFlip@{eoDetBitFlip}!eoDetBitFlip@{eo\-Det\-Bit\-Flip}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Chrom$>$ {\bf eo\-Det\-Bit\-Flip}$<$ Chrom $>$::{\bf eo\-Det\-Bit\-Flip} (const unsigned \& {\em \_\-num\_\-bit} = {\tt 1})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_det_bit_flip_a0}
+
+
+(Default) Constructor. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-num\_\-bit}]The number of bits to change default is one - equivalent to eo\-One\-Bit\-Flip then \end{description}
+\end{Desc}
+
+
+Definition at line 75 of file eo\-Bit\-Op.h.
+
+\subsection{Member Function Documentation}
+\index{eoDetBitFlip@{eo\-Det\-Bit\-Flip}!operator()@{operator()}}
+\index{operator()@{operator()}!eoDetBitFlip@{eo\-Det\-Bit\-Flip}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Chrom$>$ bool {\bf eo\-Det\-Bit\-Flip}$<$ Chrom $>$::operator() (Chrom \& {\em chrom})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_det_bit_flip_a2}
+
+
+Change num\_\-bit bits. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em chrom}]The cromosome which one bit is going to be changed. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-UF$<$ Chrom \&, bool $>$} {\rm (p.\,\pageref{classeo_u_f_a1})}.
+
+Definition at line 84 of file eo\-Bit\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Bit\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_det_select.eps b/trunk/paradiseo-eo/doc/latex/classeo_det_select.eps
new file mode 100644
index 000000000..e20a75bea
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_det_select.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 98.2801
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.0875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoDetSelect< EOT >) cw
+(eoSelect< EOT >) cw
+(eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< const eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoDetSelect< EOT >) 0.5 0 box
+ (eoSelect< EOT >) 0.5 1 box
+ (eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< const eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_det_select.tex b/trunk/paradiseo-eo/doc/latex/classeo_det_select.tex
new file mode 100644
index 000000000..127617c2b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_det_select.tex
@@ -0,0 +1,58 @@
+\section{eo\-Det\-Select$<$ EOT $>$ Class Template Reference}
+\label{classeo_det_select}\index{eoDetSelect@{eoDetSelect}}
+eo\-Det\-Select selects many individuals determinisctically  
+
+
+{\tt \#include $<$eo\-Det\-Select.h$>$}
+
+Inheritance diagram for eo\-Det\-Select$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.75184cm]{classeo_det_select}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Det\-Select} (double \_\-rate=1.0, bool \_\-interpret\_\-as\_\-rate=true)\label{classeo_det_select_a0}
+
+\begin{CompactList}\small\item\em init \item\end{CompactList}\item 
+virtual void {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-source, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-dest)
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-How\-Many} {\bf how\-Many}\label{classeo_det_select_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Det\-Select$<$ EOT $>$}
+
+eo\-Det\-Select selects many individuals determinisctically 
+
+
+
+Definition at line 40 of file eo\-Det\-Select.h.
+
+\subsection{Member Function Documentation}
+\index{eoDetSelect@{eo\-Det\-Select}!operator()@{operator()}}
+\index{operator()@{operator()}!eoDetSelect@{eo\-Det\-Select}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ virtual void {\bf eo\-Det\-Select}$<$ {\bf EOT} $>$::operator() (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\em \_\-source}, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\em \_\-dest})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_det_select_a1}
+
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-source}]the source population \item[{\em \_\-dest}]the resulting population (size of this population is given by the How\-Many data It empties the destination and adds the selection into it) \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-BF$<$ const eo\-Pop$<$ EOT $>$ \&, eo\-Pop$<$ EOT $>$ \&, void $>$} {\rm (p.\,\pageref{classeo_b_f_a1})}.
+
+Definition at line 53 of file eo\-Det\-Select.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Det\-Select.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_det_tournament_select.eps b/trunk/paradiseo-eo/doc/latex/classeo_det_tournament_select.eps
new file mode 100644
index 000000000..60d7fc45f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_det_tournament_select.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 115.607
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.325 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoDetTournamentSelect< EOT >) cw
+(eoSelectOne< EOT >) cw
+(eoUF< const eoPop< EOT > &, const EOT & >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, const EOT & >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoDetTournamentSelect< EOT >) 0.5 0 box
+ (eoSelectOne< EOT >) 0.5 1 box
+ (eoUF< const eoPop< EOT > &, const EOT & >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< const eoPop< EOT > &, const EOT & >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_det_tournament_select.tex b/trunk/paradiseo-eo/doc/latex/classeo_det_tournament_select.tex
new file mode 100644
index 000000000..53ee0d3bb
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_det_tournament_select.tex
@@ -0,0 +1,42 @@
+\section{eo\-Det\-Tournament\-Select$<$ EOT $>$ Class Template Reference}
+\label{classeo_det_tournament_select}\index{eoDetTournamentSelect@{eoDetTournamentSelect}}
+eo\-Det\-Tournament\-Select: a selection method that selects ONE individual by deterministic tournament -MS- 24/10/99  
+
+
+{\tt \#include $<$eo\-Det\-Tournament\-Select.h$>$}
+
+Inheritance diagram for eo\-Det\-Tournament\-Select$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.23699cm]{classeo_det_tournament_select}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Det\-Tournament\-Select} (unsigned \_\-t\-Size=2)\label{classeo_det_tournament_select_a0}
+
+\item 
+virtual const {\bf EOT} \& {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_det_tournament_select_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf t\-Size}\label{classeo_det_tournament_select_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Det\-Tournament\-Select$<$ EOT $>$}
+
+eo\-Det\-Tournament\-Select: a selection method that selects ONE individual by deterministic tournament -MS- 24/10/99 
+
+
+
+Definition at line 44 of file eo\-Det\-Tournament\-Select.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Det\-Tournament\-Select.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_det_tournament_truncate.eps b/trunk/paradiseo-eo/doc/latex/classeo_det_tournament_truncate.eps
new file mode 100644
index 000000000..5dd15235d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_det_tournament_truncate.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 123.457
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.05 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoDetTournamentTruncate< EOT >) cw
+(eoReduce< EOT >) cw
+(eoBF< eoPop< EOT > &, unsigned, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, unsigned, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoDetTournamentTruncate< EOT >) 0.5 0 box
+ (eoReduce< EOT >) 0.5 1 box
+ (eoBF< eoPop< EOT > &, unsigned, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< eoPop< EOT > &, unsigned, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_det_tournament_truncate.tex b/trunk/paradiseo-eo/doc/latex/classeo_det_tournament_truncate.tex
new file mode 100644
index 000000000..6bd95e6e8
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_det_tournament_truncate.tex
@@ -0,0 +1,44 @@
+\section{eo\-Det\-Tournament\-Truncate$<$ EOT $>$ Class Template Reference}
+\label{classeo_det_tournament_truncate}\index{eoDetTournamentTruncate@{eoDetTournamentTruncate}}
+a truncate class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g.  
+
+
+{\tt \#include $<$eo\-Reduce.h$>$}
+
+Inheritance diagram for eo\-Det\-Tournament\-Truncate$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.45679cm]{classeo_det_tournament_truncate}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Det\-Tournament\-Truncate} (unsigned \_\-t\_\-size)\label{classeo_det_tournament_truncate_a0}
+
+\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-newgen, unsigned \_\-newsize)\label{classeo_det_tournament_truncate_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf t\_\-size}\label{classeo_det_tournament_truncate_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Det\-Tournament\-Truncate$<$ EOT $>$}
+
+a truncate class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g. 
+
+see {\bf eo\-SSGADet\-Tournament\-Replacement}{\rm (p.\,\pageref{classeo_s_s_g_a_det_tournament_replacement})}) 
+
+
+
+Definition at line 188 of file eo\-Reduce.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Reduce.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_det_tournament_truncate_split.eps b/trunk/paradiseo-eo/doc/latex/classeo_det_tournament_truncate_split.eps
new file mode 100644
index 000000000..a9110e583
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_det_tournament_truncate_split.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 107.527
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.65 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoDetTournamentTruncateSplit< EOT >) cw
+(eoReduceSplit< EOT >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoDetTournamentTruncateSplit< EOT >) 0.5 0 box
+ (eoReduceSplit< EOT >) 0.5 1 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_det_tournament_truncate_split.tex b/trunk/paradiseo-eo/doc/latex/classeo_det_tournament_truncate_split.tex
new file mode 100644
index 000000000..8b056d384
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_det_tournament_truncate_split.tex
@@ -0,0 +1,50 @@
+\section{eo\-Det\-Tournament\-Truncate\-Split$<$ EOT $>$ Class Template Reference}
+\label{classeo_det_tournament_truncate_split}\index{eoDetTournamentTruncateSplit@{eoDetTournamentTruncateSplit}}
+a Reduce\-Split class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g.  
+
+
+{\tt \#include $<$eo\-Reduce\-Split.h$>$}
+
+Inheritance diagram for eo\-Det\-Tournament\-Truncate\-Split$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.01075cm]{classeo_det_tournament_truncate_split}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Det\-Tournament\-Truncate\-Split} (unsigned \_\-t\_\-size, {\bf eo\-How\-Many} \_\-how\-Many, bool \_\-return\-Eliminated=false)\label{classeo_det_tournament_truncate_split_a0}
+
+\begin{CompactList}\small\item\em Ctor: must provide amount of reduction, and whether or not you need to return the eliminated guys. \item\end{CompactList}\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-newgen, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-eliminated)\label{classeo_det_tournament_truncate_split_a1}
+
+\begin{CompactList}\small\item\em Performs repeated inverse\_\-deterministic\_\-tournament on the pop. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf t\_\-size}\label{classeo_det_tournament_truncate_split_r0}
+
+\item 
+{\bf eo\-How\-Many} {\bf how\-Many}\label{classeo_det_tournament_truncate_split_r1}
+
+\item 
+bool {\bf return\-Eliminated}\label{classeo_det_tournament_truncate_split_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Det\-Tournament\-Truncate\-Split$<$ EOT $>$}
+
+a Reduce\-Split class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g. 
+
+see {\bf eo\-SSGADet\-Tournament\-Replacement}{\rm (p.\,\pageref{classeo_s_s_g_a_det_tournament_replacement})}) 
+
+
+
+Definition at line 205 of file eo\-Reduce\-Split.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Reduce\-Split.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_det_tournament_worth_select.eps b/trunk/paradiseo-eo/doc/latex/classeo_det_tournament_worth_select.eps
new file mode 100644
index 000000000..f2c50943a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_det_tournament_worth_select.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 144.509
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.46 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoDetTournamentWorthSelect< EOT, WorthT >) cw
+(eoSelectFromWorth< EOT, WorthT >) cw
+(eoSelectOne< EOT >) cw
+(eoUF< const eoPop< EOT > &, const EOT & >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, const EOT & >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoDetTournamentWorthSelect< EOT, WorthT >) 0.5 0 box
+ (eoSelectFromWorth< EOT, WorthT >) 0.5 1 box
+ (eoSelectOne< EOT >) 0.5 2 box
+ (eoUF< const eoPop< EOT > &, const EOT & >) 0.5 3 box
+ (eoFunctorBase) 0 4 box
+ (unary_function< const eoPop< EOT > &, const EOT & >) 1 4 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+1 0.5 3 in
+solid
+0 0.5 3 out
+solid
+0 1 4 conn
+solid
+1 0 4 in
+solid
+1 1 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_det_tournament_worth_select.tex b/trunk/paradiseo-eo/doc/latex/classeo_det_tournament_worth_select.tex
new file mode 100644
index 000000000..1b85d23a0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_det_tournament_worth_select.tex
@@ -0,0 +1,50 @@
+\section{eo\-Det\-Tournament\-Worth\-Select$<$ EOT, Worth\-T $>$ Class Template Reference}
+\label{classeo_det_tournament_worth_select}\index{eoDetTournamentWorthSelect@{eoDetTournamentWorthSelect}}
+An instance of eo\-Select\-Perf2Worth that does selection from the Worthes using a ...  
+
+
+{\tt \#include $<$eo\-Select\-From\-Worth.h$>$}
+
+Inheritance diagram for eo\-Det\-Tournament\-Worth\-Select$<$ EOT, Worth\-T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4.04624cm]{classeo_det_tournament_worth_select}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef std::vector$<$ Worth\-T $>$::iterator {\bf worth\-Iterator}\label{classeo_det_tournament_worth_select_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Det\-Tournament\-Worth\-Select} ({\bf eo\-Perf2Worth}$<$ {\bf EOT}, Worth\-T $>$ \&perf2Worth, unsigned \_\-t\-Size)\label{classeo_det_tournament_worth_select_a0}
+
+\item 
+virtual const {\bf EOT} \& {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&pop)\label{classeo_det_tournament_worth_select_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf t\-Size}\label{classeo_det_tournament_worth_select_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT, class Worth\-T = double$>$ class eo\-Det\-Tournament\-Worth\-Select$<$ EOT, Worth\-T $>$}
+
+An instance of eo\-Select\-Perf2Worth that does selection from the Worthes using a ... 
+
+determinisitic tournament, yes! 
+
+
+
+Definition at line 91 of file eo\-Select\-From\-Worth.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Select\-From\-Worth.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_det_uniform_mutation.eps b/trunk/paradiseo-eo/doc/latex/classeo_det_uniform_mutation.eps
new file mode 100644
index 000000000..06e705186
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_det_uniform_mutation.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 132.67
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.76875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoDetUniformMutation< EOT >) cw
+(eoMonOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoUF< EOT &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoDetUniformMutation< EOT >) 0.5 0 box
+ (eoMonOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoUF< EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_det_uniform_mutation.tex b/trunk/paradiseo-eo/doc/latex/classeo_det_uniform_mutation.tex
new file mode 100644
index 000000000..30a3185ae
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_det_uniform_mutation.tex
@@ -0,0 +1,126 @@
+\section{eo\-Det\-Uniform\-Mutation$<$ EOT $>$ Class Template Reference}
+\label{classeo_det_uniform_mutation}\index{eoDetUniformMutation@{eoDetUniformMutation}}
+eo\-Det\-Uniform\-Mutation --$>$ changes exactly k values of the std::vector by uniform choice with range epsilon  
+
+
+{\tt \#include $<$Tutorial/eo\-Real\-Op.h$>$}
+
+Inheritance diagram for eo\-Det\-Uniform\-Mutation$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.71476cm]{classeo_det_uniform_mutation}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Det\-Uniform\-Mutation} (const double \&\_\-epsilon, const unsigned \&\_\-no=1)
+\begin{CompactList}\small\item\em (Default) Constructor for homogeneous genotype it's there mostly for backward compatibility \item\end{CompactList}\item 
+{\bf eo\-Det\-Uniform\-Mutation} ({\bf eo\-Real\-Vector\-Bounds} \&\_\-bounds, const double \&\_\-epsilon, const unsigned \&\_\-no=1)
+\begin{CompactList}\small\item\em Constructor with bounds. \item\end{CompactList}\item 
+{\bf eo\-Det\-Uniform\-Mutation} ({\bf eo\-Real\-Vector\-Bounds} \&\_\-bounds, const std::vector$<$ double $>$ \&\_\-epsilon, const unsigned \&\_\-no=1)
+\begin{CompactList}\small\item\em Constructor with bounds and full std::vector of epsilon. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_det_uniform_mutation_a3}
+
+\begin{CompactList}\small\item\em The class name. \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eo)
+\begin{CompactList}\small\item\em Do it! \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+bool {\bf homogeneous}\label{classeo_det_uniform_mutation_r0}
+
+\item 
+{\bf eo\-Real\-Vector\-Bounds} \& {\bf bounds}\label{classeo_det_uniform_mutation_r1}
+
+\item 
+std::vector$<$ double $>$ {\bf epsilon}\label{classeo_det_uniform_mutation_r2}
+
+\item 
+unsigned {\bf no}\label{classeo_det_uniform_mutation_r3}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Det\-Uniform\-Mutation$<$ EOT $>$}
+
+eo\-Det\-Uniform\-Mutation --$>$ changes exactly k values of the std::vector by uniform choice with range epsilon 
+
+
+
+Definition at line 144 of file eo\-Real\-Op.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoDetUniformMutation@{eo\-Det\-Uniform\-Mutation}!eoDetUniformMutation@{eoDetUniformMutation}}
+\index{eoDetUniformMutation@{eoDetUniformMutation}!eoDetUniformMutation@{eo\-Det\-Uniform\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Det\-Uniform\-Mutation}$<$ {\bf EOT} $>$::{\bf eo\-Det\-Uniform\-Mutation} (const double \& {\em \_\-epsilon}, const unsigned \& {\em \_\-no} = {\tt 1})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_det_uniform_mutation_a0}
+
+
+(Default) Constructor for homogeneous genotype it's there mostly for backward compatibility 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-epsilon}]the range for uniform nutation \item[{\em number}]of coordinate to modify \end{description}
+\end{Desc}
+
+
+Definition at line 154 of file eo\-Real\-Op.h.\index{eoDetUniformMutation@{eo\-Det\-Uniform\-Mutation}!eoDetUniformMutation@{eoDetUniformMutation}}
+\index{eoDetUniformMutation@{eoDetUniformMutation}!eoDetUniformMutation@{eo\-Det\-Uniform\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Det\-Uniform\-Mutation}$<$ {\bf EOT} $>$::{\bf eo\-Det\-Uniform\-Mutation} ({\bf eo\-Real\-Vector\-Bounds} \& {\em \_\-bounds}, const double \& {\em \_\-epsilon}, const unsigned \& {\em \_\-no} = {\tt 1})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_det_uniform_mutation_a1}
+
+
+Constructor with bounds. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-bounds}]an {\bf eo\-Real\-Vector\-Bounds}{\rm (p.\,\pageref{classeo_real_vector_bounds})} that contains the bounds \item[{\em \_\-epsilon}]the range for uniform nutation (to be scaled if necessary) \item[{\em number}]of coordinate to modify \end{description}
+\end{Desc}
+
+
+Definition at line 164 of file eo\-Real\-Op.h.
+
+References eo\-Real\-Base\-Vector\-Bounds::is\-Bounded(), and eo\-Real\-Base\-Vector\-Bounds::range().\index{eoDetUniformMutation@{eo\-Det\-Uniform\-Mutation}!eoDetUniformMutation@{eoDetUniformMutation}}
+\index{eoDetUniformMutation@{eoDetUniformMutation}!eoDetUniformMutation@{eo\-Det\-Uniform\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Det\-Uniform\-Mutation}$<$ {\bf EOT} $>$::{\bf eo\-Det\-Uniform\-Mutation} ({\bf eo\-Real\-Vector\-Bounds} \& {\em \_\-bounds}, const std::vector$<$ double $>$ \& {\em \_\-epsilon}, const unsigned \& {\em \_\-no} = {\tt 1})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_det_uniform_mutation_a2}
+
+
+Constructor with bounds and full std::vector of epsilon. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-bounds}]an {\bf eo\-Real\-Vector\-Bounds}{\rm (p.\,\pageref{classeo_real_vector_bounds})} that contains the bounds \item[{\em \_\-epsilon}]the VECTOR of ranges for uniform mutation \item[{\em number}]of coordinate to modify \end{description}
+\end{Desc}
+
+
+Definition at line 181 of file eo\-Real\-Op.h.
+
+References eo\-Real\-Base\-Vector\-Bounds::is\-Bounded(), and eo\-Real\-Base\-Vector\-Bounds::range().
+
+\subsection{Member Function Documentation}
+\index{eoDetUniformMutation@{eo\-Det\-Uniform\-Mutation}!operator()@{operator()}}
+\index{operator()@{operator()}!eoDetUniformMutation@{eo\-Det\-Uniform\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ bool {\bf eo\-Det\-Uniform\-Mutation}$<$ {\bf EOT} $>$::operator() ({\bf EOT} \& {\em \_\-eo})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_det_uniform_mutation_a4}
+
+
+Do it! 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-eo}]The indi undergoing the mutation \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-UF$<$ EOT \&, bool $>$} {\rm (p.\,\pageref{classeo_u_f_a1})}.
+
+Definition at line 199 of file eo\-Real\-Op.h.
+
+References eo\-Real\-Base\-Vector\-Bounds::is\-Max\-Bounded(), eo\-Real\-Base\-Vector\-Bounds::is\-Min\-Bounded(), eo\-Real\-Base\-Vector\-Bounds::maximum(), eo\-Real\-Base\-Vector\-Bounds::minimum(), eo\-Rng::random(), and eo\-Rng::uniform().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Real\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_deterministic_sa_d_replacement.eps b/trunk/paradiseo-eo/doc/latex/classeo_deterministic_sa_d_replacement.eps
new file mode 100644
index 000000000..f25474995
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_deterministic_sa_d_replacement.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 107.527
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.65 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoDeterministicSaDReplacement< EOT >) cw
+(eoReplacement< EOT >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoDeterministicSaDReplacement< EOT >) 0.5 0 box
+ (eoReplacement< EOT >) 0.5 1 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_deterministic_sa_d_replacement.tex b/trunk/paradiseo-eo/doc/latex/classeo_deterministic_sa_d_replacement.tex
new file mode 100644
index 000000000..602e933d3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_deterministic_sa_d_replacement.tex
@@ -0,0 +1,59 @@
+\section{eo\-Deterministic\-Sa\-DReplacement$<$ EOT $>$ Class Template Reference}
+\label{classeo_deterministic_sa_d_replacement}\index{eoDeterministicSaDReplacement@{eoDeterministicSaDReplacement}}
+eo\-Deterministic\-Sa\-DReplacement: replacement strategy that is just, in sequence saves best and kill worse from parents + saves best and kill worse from offspring + merge remaining (neither save nor killed) parents and offspring + reduce that merged population = returns reduced pop + best parents + best offspring  
+
+
+{\tt \#include $<$eo\-Survive\-And\-Die.h$>$}
+
+Inheritance diagram for eo\-Deterministic\-Sa\-DReplacement$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.01075cm]{classeo_deterministic_sa_d_replacement}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Deterministic\-Sa\-DReplacement} ({\bf eo\-Reduce}$<$ {\bf EOT} $>$ \&\_\-reduce\-Global, double \_\-survive\-Parents, double \_\-die\-Parents=0, double \_\-survive\-Offspring=0, double \_\-die\-Offspring=0, bool \_\-interpret\_\-as\_\-rate=true)\label{classeo_deterministic_sa_d_replacement_a0}
+
+\begin{CompactList}\small\item\em Constructor with reduce. \item\end{CompactList}\item 
+{\bf eo\-Deterministic\-Sa\-DReplacement} (double \_\-survive\-Parents, double \_\-die\-Parents=0, double \_\-survive\-Offspring=0, double \_\-die\-Offspring=0, bool \_\-interpret\_\-as\_\-rate=true)\label{classeo_deterministic_sa_d_replacement_a1}
+
+\begin{CompactList}\small\item\em Constructor with default truncate used as reduce. \item\end{CompactList}\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-parents, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-offspring)\label{classeo_deterministic_sa_d_replacement_a2}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Reduce}$<$ {\bf EOT} $>$ \& {\bf reduce\-Global}\label{classeo_deterministic_sa_d_replacement_r0}
+
+\item 
+{\bf eo\-Deterministic\-Survive\-And\-Die}$<$ {\bf EOT} $>$ {\bf s\-Ad\-Parents}\label{classeo_deterministic_sa_d_replacement_r1}
+
+\item 
+{\bf eo\-Deterministic\-Survive\-And\-Die}$<$ {\bf EOT} $>$ {\bf s\-Ad\-Offspring}\label{classeo_deterministic_sa_d_replacement_r2}
+
+\item 
+{\bf eo\-Plus}$<$ {\bf EOT} $>$ {\bf plus}\label{classeo_deterministic_sa_d_replacement_r3}
+
+\item 
+{\bf eo\-Truncate}$<$ {\bf EOT} $>$ {\bf truncate}\label{classeo_deterministic_sa_d_replacement_r4}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Deterministic\-Sa\-DReplacement$<$ EOT $>$}
+
+eo\-Deterministic\-Sa\-DReplacement: replacement strategy that is just, in sequence saves best and kill worse from parents + saves best and kill worse from offspring + merge remaining (neither save nor killed) parents and offspring + reduce that merged population = returns reduced pop + best parents + best offspring 
+
+An obvious use is as strong elitist strategy, i.e. preserving best parents, and reducing (either offspring or parents+offspring) 
+
+
+
+Definition at line 132 of file eo\-Survive\-And\-Die.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Survive\-And\-Die.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_deterministic_survive_and_die.eps b/trunk/paradiseo-eo/doc/latex/classeo_deterministic_survive_and_die.eps
new file mode 100644
index 000000000..0d3080e07
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_deterministic_survive_and_die.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 107.527
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.65 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoDeterministicSurviveAndDie< EOT >) cw
+(eoSurviveAndDie< EOT >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoDeterministicSurviveAndDie< EOT >) 0.5 0 box
+ (eoSurviveAndDie< EOT >) 0.5 1 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_deterministic_survive_and_die.tex b/trunk/paradiseo-eo/doc/latex/classeo_deterministic_survive_and_die.tex
new file mode 100644
index 000000000..cf2610bec
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_deterministic_survive_and_die.tex
@@ -0,0 +1,40 @@
+\section{eo\-Deterministic\-Survive\-And\-Die$<$ EOT $>$ Class Template Reference}
+\label{classeo_deterministic_survive_and_die}\index{eoDeterministicSurviveAndDie@{eoDeterministicSurviveAndDie}}
+An instance (theonly one as of today, Dec.  
+
+
+{\tt \#include $<$eo\-Survive\-And\-Die.h$>$}
+
+Inheritance diagram for eo\-Deterministic\-Survive\-And\-Die$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.01075cm]{classeo_deterministic_survive_and_die}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Deterministic\-Survive\-And\-Die} (double \_\-survive, double \_\-die, bool \_\-interpret\_\-as\_\-rate=true)\label{classeo_deterministic_survive_and_die_a0}
+
+\begin{CompactList}\small\item\em constructor \item\end{CompactList}\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-lucky\-Guys)\label{classeo_deterministic_survive_and_die_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Deterministic\-Survive\-And\-Die$<$ EOT $>$}
+
+An instance (theonly one as of today, Dec. 
+
+20, 2000) of an {\bf eo\-Survive\-And\-Die}{\rm (p.\,\pageref{classeo_survive_and_die})}, that does everything deterministically
+
+Used in {\bf eo\-Deterministic\-Sa\-DReplacement}{\rm (p.\,\pageref{classeo_deterministic_sa_d_replacement})}. 
+
+
+
+Definition at line 73 of file eo\-Survive\-And\-Die.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Survive\-And\-Die.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_distance.eps b/trunk/paradiseo-eo/doc/latex/classeo_distance.eps
new file mode 100644
index 000000000..ec2605819
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_distance.eps
@@ -0,0 +1,225 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 79.3651
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 6.3 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoDistance< EOT >) cw
+(eoBF< const EOT &, const EOT &, double >) cw
+(eoFunctorBase) cw
+(binary_function< const EOT &, const EOT &, double >) cw
+(eoFitnessDistance< EOT >) cw
+(eoHammingDistance< EOT >) cw
+(eoQuadDistance< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoDistance< EOT >) 1 1 box
+ (eoBF< const EOT &, const EOT &, double >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< const EOT &, const EOT &, double >) 1.5 3 box
+ (eoFitnessDistance< EOT >) 0 0 box
+ (eoHammingDistance< EOT >) 1 0 box
+ (eoQuadDistance< EOT >) 2 0 box
+
+% ----- relations -----
+
+solid
+0 1 1 out
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
+solid
+1 1 0.25 out
+solid
+0 2 1 conn
+solid
+0 0 0.75 in
+solid
+0 1 0.75 in
+solid
+0 2 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_distance.tex b/trunk/paradiseo-eo/doc/latex/classeo_distance.tex
new file mode 100644
index 000000000..660810923
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_distance.tex
@@ -0,0 +1,27 @@
+\section{eo\-Distance$<$ EOT $>$ Class Template Reference}
+\label{classeo_distance}\index{eoDistance@{eoDistance}}
+This is a generic class for distance functors: takes 2 things ane returns a double.  
+
+
+{\tt \#include $<$eo\-Distance.h$>$}
+
+Inheritance diagram for eo\-Distance$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.22222cm]{classeo_distance}
+\end{center}
+\end{figure}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Distance$<$ EOT $>$}
+
+This is a generic class for distance functors: takes 2 things ane returns a double. 
+
+
+
+Definition at line 35 of file eo\-Distance.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Distance.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_distrib_updater.eps b/trunk/paradiseo-eo/doc/latex/classeo_distrib_updater.eps
new file mode 100644
index 000000000..bb65570da
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_distrib_updater.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 96.8523
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.1625 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoDistribUpdater< EOT >) cw
+(eoBF< eoDistribution< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoDistribution< EOT > &, eoPop< EOT > &, void >) cw
+(eoPBILAdditive< EOT >) cw
+(eoPBILOrg< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoDistribUpdater< EOT >) 0.5 1 box
+ (eoBF< eoDistribution< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< eoDistribution< EOT > &, eoPop< EOT > &, void >) 1 3 box
+ (eoPBILAdditive< EOT >) 0 0 box
+ (eoPBILOrg< EOT >) 1 0 box
+
+% ----- relations -----
+
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+1 0.5 0.25 out
+solid
+0 1 1 conn
+solid
+0 0 0.75 in
+solid
+0 1 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_distrib_updater.tex b/trunk/paradiseo-eo/doc/latex/classeo_distrib_updater.tex
new file mode 100644
index 000000000..a31640783
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_distrib_updater.tex
@@ -0,0 +1,35 @@
+\section{eo\-Distrib\-Updater$<$ EOT $>$ Class Template Reference}
+\label{classeo_distrib_updater}\index{eoDistribUpdater@{eoDistribUpdater}}
+Base class for Distribution Evolution Algorithms within {\bf EO}{\rm (p.\,\pageref{class_e_o})}: the update rule of distribution.  
+
+
+{\tt \#include $<$eo\-Distrib\-Updater.h$>$}
+
+Inheritance diagram for eo\-Distrib\-Updater$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.71186cm]{classeo_distrib_updater}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual void {\bf operator()} ({\bf eo\-Distribution}$<$ {\bf EOT} $>$ \&, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&)=0\label{classeo_distrib_updater_a0}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Distrib\-Updater$<$ EOT $>$}
+
+Base class for Distribution Evolution Algorithms within {\bf EO}{\rm (p.\,\pageref{class_e_o})}: the update rule of distribution. 
+
+It takes one distribution and updates it according to one population 
+
+
+
+Definition at line 43 of file eo\-Distrib\-Updater.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Distrib\-Updater.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_distribution.eps b/trunk/paradiseo-eo/doc/latex/classeo_distribution.eps
new file mode 100644
index 000000000..84c39d341
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_distribution.eps
@@ -0,0 +1,237 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 124.378
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.02 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 4 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoDistribution< EOT >) cw
+(eoInit< EOT >) cw
+(eoPersistent) cw
+(eoObject) cw
+(eoUF< EOT &, void >) cw
+(eoPrintable) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, void >) cw
+(eoPBILDistrib< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoDistribution< EOT >) 1.5 1 box
+ (eoInit< EOT >) 0.5 2 box
+ (eoPersistent) 1.5 2 box
+ (eoObject) 2.5 2 box
+ (eoUF< EOT &, void >) 0.5 3 box
+ (eoPrintable) 1.5 3 box
+ (eoFunctorBase) 0 4 box
+ (unary_function< EOT &, void >) 1 4 box
+ (eoPBILDistrib< EOT >) 1.5 0 box
+
+% ----- relations -----
+
+solid
+0 1.5 1 out
+solid
+0.5 2.5 2 conn
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+1 1.5 2 in
+solid
+0 1.5 2 out
+solid
+1 2.5 2 in
+solid
+1 0.5 3 in
+solid
+0 0.5 3 out
+solid
+0 1 4 conn
+solid
+1 1.5 3 in
+solid
+1 0 4 in
+solid
+1 1 4 in
+solid
+1 1.5 0.25 out
+solid
+0 1.5 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_distribution.tex b/trunk/paradiseo-eo/doc/latex/classeo_distribution.tex
new file mode 100644
index 000000000..edc021537
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_distribution.tex
@@ -0,0 +1,37 @@
+\section{eo\-Distribution$<$ EOT $>$ Class Template Reference}
+\label{classeo_distribution}\index{eoDistribution@{eoDistribution}}
+Abstract class for Distribution Evolution Algorithms within {\bf EO}{\rm (p.\,\pageref{class_e_o})}: the distribution itself.  
+
+
+{\tt \#include $<$eo\-Distribution.h$>$}
+
+Inheritance diagram for eo\-Distribution$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.48259cm]{classeo_distribution}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual void {\bf operator()} ({\bf EOT} \&)=0\label{classeo_distribution_a0}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Distribution$<$ EOT $>$}
+
+Abstract class for Distribution Evolution Algorithms within {\bf EO}{\rm (p.\,\pageref{class_e_o})}: the distribution itself. 
+
+It basically IS AN {\bf eo\-Init}{\rm (p.\,\pageref{classeo_init})} - {\bf operator()(EOT \&)}{\rm (p.\,\pageref{classeo_distribution_a0})} generates new indis
+
+The instances will probably be {\bf eo\-Value\-Param}{\rm (p.\,\pageref{classeo_value_param})} of some kind see {\bf eo\-PBILDistrib.h}{\rm (p.\,\pageref{eo_p_b_i_l_distrib_8h})} 
+
+
+
+Definition at line 45 of file eo\-Distribution.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Distribution.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_dominance_map.eps b/trunk/paradiseo-eo/doc/latex/classeo_dominance_map.eps
new file mode 100644
index 000000000..c84f6d551
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_dominance_map.eps
@@ -0,0 +1,209 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 95.5414
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.23333 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 3 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoDominanceMap< EoType >) cw
+(eoUF< const eoPop< EoType > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EoType > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoDominanceMap< EoType >) 0.5 0 box
+ (eoUF< const eoPop< EoType > &, void >) 0.5 1 box
+ (eoFunctorBase) 0 2 box
+ (unary_function< const eoPop< EoType > &, void >) 1 2 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_dominance_map.tex b/trunk/paradiseo-eo/doc/latex/classeo_dominance_map.tex
new file mode 100644
index 000000000..64a6bc402
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_dominance_map.tex
@@ -0,0 +1,87 @@
+\section{eo\-Dominance\-Map$<$ Eo\-Type $>$ Class Template Reference}
+\label{classeo_dominance_map}\index{eoDominanceMap@{eoDominanceMap}}
+eo\-Dominance\-Map, utility class to calculate and maintain a map (std::vector$<$std::vector$<$bool$>$ $>$) of pareto dominance statistics.  
+
+
+{\tt \#include $<$eo\-Dominance\-Map.h$>$}
+
+Inheritance diagram for eo\-Dominance\-Map$<$ Eo\-Type $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.67516cm]{classeo_dominance_map}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+void {\bf clear} ()\label{classeo_dominance_map_a0}
+
+\begin{CompactList}\small\item\em Clears the map. \item\end{CompactList}\item 
+void {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf Eo\-Type} $>$ \&\_\-pop)\label{classeo_dominance_map_a1}
+
+\begin{CompactList}\small\item\em Update or create the dominance map. \item\end{CompactList}\item 
+void {\bf remove} (unsigned i)\label{classeo_dominance_map_a2}
+
+\begin{CompactList}\small\item\em Removes the domination info for a given individual, thus nothing dominates it and it dominates nothing. \item\end{CompactList}\item 
+void {\bf setup} (const {\bf eo\-Pop}$<$ {\bf Eo\-Type} $>$ \&\_\-pop)
+\begin{CompactList}\small\item\em Create domination matrix from scratch. \item\end{CompactList}\item 
+std::vector$<$ double $>$ {\bf sum\_\-dominators} () const 
+\begin{CompactList}\small\item\em For all elements, returns the no. \item\end{CompactList}\item 
+std::vector$<$ double $>$ {\bf sum\_\-dominants} () const \label{classeo_dominance_map_a5}
+
+\begin{CompactList}\small\item\em For all elements, returns the number of elements that the element dominates Thus: higher is better It returns a std::vector$<$double$>$ cuz that makes subsequent manipulation that much easier. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+std::vector$<$ typename Eo\-Type::Fitness $>$ {\bf fitness}\label{classeo_dominance_map_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Eo\-Type$>$ class eo\-Dominance\-Map$<$ Eo\-Type $>$}
+
+eo\-Dominance\-Map, utility class to calculate and maintain a map (std::vector$<$std::vector$<$bool$>$ $>$) of pareto dominance statistics. 
+
+It is set up such that
+
+if map[i][j] == true then i dominates j
+
+The dominance map can be used to perform pareto ranking ({\bf eo\-Pareto\-Ranking}{\rm (p.\,\pageref{classeo_pareto_ranking})}) or non dominated sorting. For the latter, the {\bf remove()}{\rm (p.\,\pageref{classeo_dominance_map_a2})} member function might come in handy.
+
+\begin{Desc}
+\item[{\bf Todo}]make it an {\bf eo\-Stat}{\rm (p.\,\pageref{classeo_stat})}? \end{Desc}
+
+
+
+
+Definition at line 47 of file eo\-Dominance\-Map.h.
+
+\subsection{Member Function Documentation}
+\index{eoDominanceMap@{eo\-Dominance\-Map}!setup@{setup}}
+\index{setup@{setup}!eoDominanceMap@{eo\-Dominance\-Map}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Eo\-Type$>$ void {\bf eo\-Dominance\-Map}$<$ {\bf Eo\-Type} $>$::setup (const {\bf eo\-Pop}$<$ {\bf Eo\-Type} $>$ \& {\em \_\-pop})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_dominance_map_a3}
+
+
+Create domination matrix from scratch. 
+
+Complexity O(N$^\wedge$2) 
+
+Definition at line 81 of file eo\-Dominance\-Map.h.
+
+Referenced by eo\-Dominance\-Map$<$ EOT $>$::operator()().\index{eoDominanceMap@{eo\-Dominance\-Map}!sum_dominators@{sum\_\-dominators}}
+\index{sum_dominators@{sum\_\-dominators}!eoDominanceMap@{eo\-Dominance\-Map}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Eo\-Type$>$ std::vector$<$double$>$ {\bf eo\-Dominance\-Map}$<$ {\bf Eo\-Type} $>$::sum\_\-dominators () const\hspace{0.3cm}{\tt  [inline]}}\label{classeo_dominance_map_a4}
+
+
+For all elements, returns the no. 
+
+of elements that dominate the element Thus: lower is better (and 0 is the front). It returns a std::vector$<$double$>$ cuz that makes subsequent manipulation that much easier 
+
+Definition at line 118 of file eo\-Dominance\-Map.h.
+
+Referenced by eo\-Pareto\-Ranking$<$ EOT $>$::calculate\_\-worths().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Dominance\-Map.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_double_exchange.eps b/trunk/paradiseo-eo/doc/latex/classeo_double_exchange.eps
new file mode 100644
index 000000000..164739177
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_double_exchange.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 85.197
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.86875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoDoubleExchange) cw
+(eoBinOp< double >) cw
+(eoOp< double >) cw
+(eoBF< double &, const double &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< double &, const double &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoDoubleExchange) 0.5 0 box
+ (eoBinOp< double >) 0.5 1 box
+ (eoOp< double >) 0 2 box
+ (eoBF< double &, const double &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< double &, const double &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_double_exchange.tex b/trunk/paradiseo-eo/doc/latex/classeo_double_exchange.tex
new file mode 100644
index 000000000..c11272111
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_double_exchange.tex
@@ -0,0 +1,37 @@
+\section{eo\-Double\-Exchange Class Reference}
+\label{classeo_double_exchange}\index{eoDoubleExchange@{eoDoubleExchange}}
+Discrete crossover == exchange of values.  
+
+
+{\tt \#include $<$eo\-Real\-Atom\-Xover.h$>$}
+
+Inheritance diagram for eo\-Double\-Exchange::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.38552cm]{classeo_double_exchange}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Double\-Exchange} ()\label{classeo_double_exchange_a0}
+
+\begin{CompactList}\small\item\em (Default) Constructor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_double_exchange_a1}
+
+\begin{CompactList}\small\item\em The class name. Used to display statistics. \item\end{CompactList}\item 
+bool {\bf operator()} (double \&r1, const double \&r2)\label{classeo_double_exchange_a2}
+
+\begin{CompactList}\small\item\em Exchanges or not the values. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Discrete crossover == exchange of values. 
+
+
+
+Definition at line 41 of file eo\-Real\-Atom\-Xover.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Real\-Atom\-Xover.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_double_intermediate.eps b/trunk/paradiseo-eo/doc/latex/classeo_double_intermediate.eps
new file mode 100644
index 000000000..ee5f2643b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_double_intermediate.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 85.197
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.86875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoDoubleIntermediate) cw
+(eoBinOp< double >) cw
+(eoOp< double >) cw
+(eoBF< double &, const double &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< double &, const double &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoDoubleIntermediate) 0.5 0 box
+ (eoBinOp< double >) 0.5 1 box
+ (eoOp< double >) 0 2 box
+ (eoBF< double &, const double &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< double &, const double &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_double_intermediate.tex b/trunk/paradiseo-eo/doc/latex/classeo_double_intermediate.tex
new file mode 100644
index 000000000..4e6a40939
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_double_intermediate.tex
@@ -0,0 +1,37 @@
+\section{eo\-Double\-Intermediate Class Reference}
+\label{classeo_double_intermediate}\index{eoDoubleIntermediate@{eoDoubleIntermediate}}
+Intermediate crossover == linear combination.  
+
+
+{\tt \#include $<$eo\-Real\-Atom\-Xover.h$>$}
+
+Inheritance diagram for eo\-Double\-Intermediate::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.38552cm]{classeo_double_intermediate}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Double\-Intermediate} ()\label{classeo_double_intermediate_a0}
+
+\begin{CompactList}\small\item\em (Default) Constructor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_double_intermediate_a1}
+
+\begin{CompactList}\small\item\em The class name. Used to display statistics. \item\end{CompactList}\item 
+bool {\bf operator()} (double \&r1, const double \&r2)\label{classeo_double_intermediate_a2}
+
+\begin{CompactList}\small\item\em Linear combination of both parents. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Intermediate crossover == linear combination. 
+
+
+
+Definition at line 71 of file eo\-Real\-Atom\-Xover.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Real\-Atom\-Xover.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_drawable.tex b/trunk/paradiseo-eo/doc/latex/classeo_drawable.tex
new file mode 100644
index 000000000..c71e0d8c9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_drawable.tex
@@ -0,0 +1,54 @@
+\section{eo\-Drawable$<$ Object $>$ Class Template Reference}
+\label{classeo_drawable}\index{eoDrawable@{eoDrawable}}
+eo\-Drawable is a template class that adds a drawing interface to an object.$\backslash$ Requisites for template instantiation are that the object must admit a default ctor and a copy ctor.  
+
+
+{\tt \#include $<$eo\-Drawable.h$>$}
+
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Drawable} (const Object \&\_\-o)\label{classeo_drawable_a0}
+
+\begin{CompactList}\small\item\em Main ctor from an already built Object. \item\end{CompactList}\item 
+{\bf eo\-Drawable} (const {\bf eo\-Drawable} \&\_\-d)\label{classeo_drawable_a1}
+
+\begin{CompactList}\small\item\em Copy constructor. \item\end{CompactList}\item 
+virtual {\bf $\sim$eo\-Drawable} ()\label{classeo_drawable_a2}
+
+\begin{CompactList}\small\item\em Virtual dtor. They are needed in virtual class hierarchies. \item\end{CompactList}\item 
+virtual void {\bf draw} (unsigned \_\-x, unsigned \_\-y)=0
+\begin{CompactList}\small\item\em Draws the object. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Object$>$ class eo\-Drawable$<$ Object $>$}
+
+eo\-Drawable is a template class that adds a drawing interface to an object.$\backslash$ Requisites for template instantiation are that the object must admit a default ctor and a copy ctor. 
+
+The Object must be an {\bf eo\-Object}{\rm (p.\,\pageref{classeo_object})}, thus, it must have its methods: class\-Name, eo\-Drawables can be drawn on any two-dimensional surface; it can be added to any object with above characteristics. \begin{Desc}
+\item[See also:]{\bf eo\-Object}{\rm (p.\,\pageref{classeo_object})} \end{Desc}
+
+
+
+
+Definition at line 44 of file eo\-Drawable.h.
+
+\subsection{Member Function Documentation}
+\index{eoDrawable@{eo\-Drawable}!draw@{draw}}
+\index{draw@{draw}!eoDrawable@{eo\-Drawable}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Object$>$ virtual void {\bf eo\-Drawable}$<$ Object $>$::draw (unsigned {\em \_\-x}, unsigned {\em \_\-y})\hspace{0.3cm}{\tt  [pure virtual]}}\label{classeo_drawable_a3}
+
+
+Draws the object. 
+
+It must be redefined in any subclass, it180s impossible to have a general drawing method \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-x,\_\-y}]coorinates \end{description}
+\end{Desc}
+
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Drawable.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_dyn_s_g_a_transform.eps b/trunk/paradiseo-eo/doc/latex/classeo_dyn_s_g_a_transform.eps
new file mode 100644
index 000000000..9feb78f93
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_dyn_s_g_a_transform.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 153.257
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.2625 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoDynSGATransform< EOT >) cw
+(eoTransform< EOT >) cw
+(eoUF< eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoDynSGATransform< EOT >) 0.5 0 box
+ (eoTransform< EOT >) 0.5 1 box
+ (eoUF< eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_dyn_s_g_a_transform.tex b/trunk/paradiseo-eo/doc/latex/classeo_dyn_s_g_a_transform.tex
new file mode 100644
index 000000000..ee7f2de05
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_dyn_s_g_a_transform.tex
@@ -0,0 +1,88 @@
+\section{eo\-Dyn\-SGATransform$<$ EOT $>$ Class Template Reference}
+\label{classeo_dyn_s_g_a_transform}\index{eoDynSGATransform@{eoDynSGATransform}}
+eo\-Dyn\-SGATransform: transforms a population using genetic operators.  
+
+
+{\tt \#include $<$eo\-SGATransform.h$>$}
+
+Inheritance diagram for eo\-Dyn\-SGATransform$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_dyn_s_g_a_transform}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Dyn\-SGATransform} ({\bf eo\-Quad\-Op}$<$ {\bf EOT} $>$ \&\_\-cross, double \_\-c\-Proba, {\bf eo\-Mon\-Op}$<$ {\bf EOT} $>$ \&\_\-mutate, double \_\-m\-Proba)\label{classeo_dyn_s_g_a_transform_a0}
+
+\begin{CompactList}\small\item\em Default constructor - receives values. \item\end{CompactList}\item 
+{\bf eo\-Dyn\-SGATransform} ({\bf eo\-Quad\-Op}$<$ {\bf EOT} $>$ \&\_\-cross, double $\ast$\_\-c\-Proba\-Ref, {\bf eo\-Mon\-Op}$<$ {\bf EOT} $>$ \&\_\-mutate, double $\ast$\_\-m\-Proba\-Ref)\label{classeo_dyn_s_g_a_transform_a1}
+
+\begin{CompactList}\small\item\em This constructor receives pointers. \item\end{CompactList}\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)
+\begin{CompactList}\small\item\em Transforms a population. \item\end{CompactList}\item 
+double \& {\bf PCross\-Handle} ()\label{classeo_dyn_s_g_a_transform_a3}
+
+\item 
+double \& {\bf PMut\-Handle} ()\label{classeo_dyn_s_g_a_transform_a4}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Invalidate\-Quad\-Op}$<$ {\bf EOT} $>$ {\bf cross}\label{classeo_dyn_s_g_a_transform_r0}
+
+\item 
+double {\bf crossover\-Proba\-Holder}\label{classeo_dyn_s_g_a_transform_r1}
+
+\item 
+double \& {\bf crossover\-Proba}\label{classeo_dyn_s_g_a_transform_r2}
+
+\item 
+{\bf eo\-Invalidate\-Mon\-Op}$<$ {\bf EOT} $>$ {\bf mutate}\label{classeo_dyn_s_g_a_transform_r3}
+
+\item 
+double {\bf mutation\-Proba\-Holder}\label{classeo_dyn_s_g_a_transform_r4}
+
+\item 
+double \& {\bf mutation\-Proba}\label{classeo_dyn_s_g_a_transform_r5}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Dyn\-SGATransform$<$ EOT $>$}
+
+eo\-Dyn\-SGATransform: transforms a population using genetic operators. 
+
+It is the Dynamic version of the above {\bf eo\-SGATransform}{\rm (p.\,\pageref{classeo_s_g_a_transform})} i.e. the operators probabilities can be passed as an {\bf eo\-Value\-Param}{\rm (p.\,\pageref{classeo_value_param})}, and hence can be modified from outside It is here mainly for tutorial reasons 
+
+
+
+Definition at line 98 of file eo\-SGATransform.h.
+
+\subsection{Member Function Documentation}
+\index{eoDynSGATransform@{eo\-Dyn\-SGATransform}!operator()@{operator()}}
+\index{operator()@{operator()}!eoDynSGATransform@{eo\-Dyn\-SGATransform}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ void {\bf eo\-Dyn\-SGATransform}$<$ {\bf EOT} $>$::operator() ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\em \_\-pop})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_dyn_s_g_a_transform_a2}
+
+
+Transforms a population. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em pop}]The population to be transformed. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-UF$<$ eo\-Pop$<$ EOT $>$ \&, void $>$} {\rm (p.\,\pageref{classeo_u_f_a1})}.
+
+Definition at line 125 of file eo\-SGATransform.h.
+
+References eo\-Rng::flip().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-SGATransform.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_dyn_updater.eps b/trunk/paradiseo-eo/doc/latex/classeo_dyn_updater.eps
new file mode 100644
index 000000000..280c7edf7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_dyn_updater.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 349.65
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.43 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoDynUpdater) cw
+(eoUpdater) cw
+(eoF< void >) cw
+(eoFunctorBase) cw
+(eoCountedDynUpdate) cw
+(eoTimedDynUpdate) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoDynUpdater) 0.5 1 box
+ (eoUpdater) 0.5 2 box
+ (eoF< void >) 0.5 3 box
+ (eoFunctorBase) 0.5 4 box
+ (eoCountedDynUpdate) 0 0 box
+ (eoTimedDynUpdate) 1 0 box
+
+% ----- relations -----
+
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+1 0.5 3 in
+solid
+0 0.5 3 out
+solid
+1 0.5 4 in
+solid
+1 0.5 0.25 out
+solid
+0 1 1 conn
+solid
+0 0 0.75 in
+solid
+0 1 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_dyn_updater.tex b/trunk/paradiseo-eo/doc/latex/classeo_dyn_updater.tex
new file mode 100644
index 000000000..bccc88880
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_dyn_updater.tex
@@ -0,0 +1,40 @@
+\section{eo\-Dyn\-Updater Class Reference}
+\label{classeo_dyn_updater}\index{eoDynUpdater@{eoDynUpdater}}
+A base class to actually update an {\bf eo\-Updatable}{\rm (p.\,\pageref{classeo_updatable})} object.  
+
+
+{\tt \#include $<$eo\-Updatable.h$>$}
+
+Inheritance diagram for eo\-Dyn\-Updater::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=5cm]{classeo_dyn_updater}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Dyn\-Updater} ({\bf eo\-Updatable} \&\_\-to\-Update)\label{classeo_dyn_updater_a0}
+
+\item 
+virtual void {\bf operator()} ()\label{classeo_dyn_updater_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Updatable} \& {\bf to\-Update}\label{classeo_dyn_updater_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+A base class to actually update an {\bf eo\-Updatable}{\rm (p.\,\pageref{classeo_updatable})} object. 
+
+
+
+Definition at line 51 of file eo\-Updatable.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Updatable.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_e_d_a.eps b/trunk/paradiseo-eo/doc/latex/classeo_e_d_a.eps
new file mode 100644
index 000000000..70c3d72c3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_e_d_a.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 132.45
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.775 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoEDA< EOT >) cw
+(eoUF< eoDistribution< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< eoDistribution< EOT > &, void >) cw
+(eoSimpleEDA< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoEDA< EOT >) 0.5 1 box
+ (eoUF< eoDistribution< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< eoDistribution< EOT > &, void >) 1 3 box
+ (eoSimpleEDA< EOT >) 0.5 0 box
+
+% ----- relations -----
+
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+1 0.5 0.25 out
+solid
+0 0.5 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_e_d_a.tex b/trunk/paradiseo-eo/doc/latex/classeo_e_d_a.tex
new file mode 100644
index 000000000..e524b25d7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_e_d_a.tex
@@ -0,0 +1,31 @@
+\section{eo\-EDA$<$ EOT $>$ Class Template Reference}
+\label{classeo_e_d_a}\index{eoEDA@{eoEDA}}
+eo\-EDA: Estimation of Distribution Algorithm within {\bf EO}{\rm (p.\,\pageref{class_e_o})}  
+
+
+{\tt \#include $<$eo\-EDA.h$>$}
+
+Inheritance diagram for eo\-EDA$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.70861cm]{classeo_e_d_a}
+\end{center}
+\end{figure}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-EDA$<$ EOT $>$}
+
+eo\-EDA: Estimation of Distribution Algorithm within {\bf EO}{\rm (p.\,\pageref{class_e_o})} 
+
+The abstract class for algorithms that evolve a probability distribution on the spaces of populations rather than a population
+
+It IS NOT an {\bf eo\-Algo}{\rm (p.\,\pageref{classeo_algo})}, as it evolves a distribution, not a population 
+
+
+
+Definition at line 41 of file eo\-EDA.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-EDA.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_e_p_reduce.eps b/trunk/paradiseo-eo/doc/latex/classeo_e_p_reduce.eps
new file mode 100644
index 000000000..0f8b5a125
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_e_p_reduce.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 123.457
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.05 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoEPReduce< EOT >) cw
+(eoReduce< EOT >) cw
+(eoBF< eoPop< EOT > &, unsigned, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, unsigned, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoEPReduce< EOT >) 0.5 0 box
+ (eoReduce< EOT >) 0.5 1 box
+ (eoBF< eoPop< EOT > &, unsigned, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< eoPop< EOT > &, unsigned, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_e_p_reduce.tex b/trunk/paradiseo-eo/doc/latex/classeo_e_p_reduce.tex
new file mode 100644
index 000000000..bbbbfc635
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_e_p_reduce.tex
@@ -0,0 +1,51 @@
+\section{eo\-EPReduce$<$ EOT $>$ Class Template Reference}
+\label{classeo_e_p_reduce}\index{eoEPReduce@{eoEPReduce}}
+EP truncation method (some global stochastic tournament + sort) Softer selective pressure than pure truncate.  
+
+
+{\tt \#include $<$eo\-Reduce.h$>$}
+
+Inheritance diagram for eo\-EPReduce$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.45679cm]{classeo_e_p_reduce}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Fitness {\bf Fitness}\label{classeo_e_p_reduce_w0}
+
+\item 
+typedef std::pair$<$ float, typename {\bf eo\-Pop}$<$ {\bf EOT} $>$::iterator $>$ {\bf EPpair}\label{classeo_e_p_reduce_w1}
+
+\begin{CompactList}\small\item\em helper struct for comparing on std::pairs \item\end{CompactList}\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-EPReduce} (unsigned \_\-t\_\-size)\label{classeo_e_p_reduce_a0}
+
+\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-newgen, unsigned \_\-newsize)\label{classeo_e_p_reduce_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf t\_\-size}\label{classeo_e_p_reduce_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-EPReduce$<$ EOT $>$}
+
+EP truncation method (some global stochastic tournament + sort) Softer selective pressure than pure truncate. 
+
+
+
+Definition at line 83 of file eo\-Reduce.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Reduce.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_e_p_replacement.eps b/trunk/paradiseo-eo/doc/latex/classeo_e_p_replacement.eps
new file mode 100644
index 000000000..02bf3b87a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_e_p_replacement.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 134.409
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.72 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoEPReplacement< EOT >) cw
+(eoMergeReduce< EOT >) cw
+(eoReplacement< EOT >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoEPReplacement< EOT >) 0.5 0 box
+ (eoMergeReduce< EOT >) 0.5 1 box
+ (eoReplacement< EOT >) 0.5 2 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 3 box
+ (eoFunctorBase) 0 4 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 1 4 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+1 0.5 3 in
+solid
+0 0.5 3 out
+solid
+0 1 4 conn
+solid
+1 0 4 in
+solid
+1 1 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_e_p_replacement.tex b/trunk/paradiseo-eo/doc/latex/classeo_e_p_replacement.tex
new file mode 100644
index 000000000..90f6dd83d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_e_p_replacement.tex
@@ -0,0 +1,42 @@
+\section{eo\-EPReplacement$<$ EOT $>$ Class Template Reference}
+\label{classeo_e_p_replacement}\index{eoEPReplacement@{eoEPReplacement}}
+EP type of replacement strategy: first add parents to population, then truncate using EP tournament.  
+
+
+{\tt \#include $<$eo\-Merge\-Reduce.h$>$}
+
+Inheritance diagram for eo\-EPReplacement$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.76344cm]{classeo_e_p_replacement}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-EPReplacement} (int \_\-t\-Size)\label{classeo_e_p_replacement_a0}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Plus}$<$ {\bf EOT} $>$ {\bf plus}\label{classeo_e_p_replacement_r0}
+
+\item 
+{\bf eo\-EPReduce}$<$ {\bf EOT} $>$ {\bf truncate}\label{classeo_e_p_replacement_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-EPReplacement$<$ EOT $>$}
+
+EP type of replacement strategy: first add parents to population, then truncate using EP tournament. 
+
+
+
+Definition at line 102 of file eo\-Merge\-Reduce.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Merge\-Reduce.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_easy_e_a.eps b/trunk/paradiseo-eo/doc/latex/classeo_easy_e_a.eps
new file mode 100644
index 000000000..5b466c504
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_easy_e_a.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 153.257
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.2625 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoEasyEA< EOT >) cw
+(eoAlgo< EOT >) cw
+(eoUF< eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoEasyEA< EOT >) 0.5 0 box
+ (eoAlgo< EOT >) 0.5 1 box
+ (eoUF< eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_easy_e_a.tex b/trunk/paradiseo-eo/doc/latex/classeo_easy_e_a.tex
new file mode 100644
index 000000000..0c06d8a91
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_easy_e_a.tex
@@ -0,0 +1,103 @@
+\section{eo\-Easy\-EA$<$ EOT $>$ Class Template Reference}
+\label{classeo_easy_e_a}\index{eoEasyEA@{eoEasyEA}}
+An easy-to-use evolutionary algorithm; you can use any chromosome, and any selection transformation, merging and evaluation algorithms; you can even change in runtime parameters of those sub-algorithms.  
+
+
+{\tt \#include $<$eo\-Easy\-EA.h$>$}
+
+Inheritance diagram for eo\-Easy\-EA$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_easy_e_a}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Easy\-EA} ({\bf eo\-Continue}$<$ {\bf EOT} $>$ \&\_\-continuator, {\bf eo\-Eval\-Func}$<$ {\bf EOT} $>$ \&\_\-eval, {\bf eo\-Breed}$<$ {\bf EOT} $>$ \&\_\-breed, {\bf eo\-Replacement}$<$ {\bf EOT} $>$ \&\_\-replace)\label{classeo_easy_e_a_a0}
+
+\begin{CompactList}\small\item\em Ctor taking a breed and merge. \item\end{CompactList}\item 
+{\bf eo\-Easy\-EA} ({\bf eo\-Continue}$<$ {\bf EOT} $>$ \&\_\-continuator, {\bf eo\-Pop\-Eval\-Func}$<$ {\bf EOT} $>$ \&\_\-eval, {\bf eo\-Breed}$<$ {\bf EOT} $>$ \&\_\-breed, {\bf eo\-Replacement}$<$ {\bf EOT} $>$ \&\_\-replace)\label{classeo_easy_e_a_a1}
+
+\begin{CompactList}\small\item\em NEW Ctor taking a breed and merge and an eo\-Pop\-Eval. \item\end{CompactList}\item 
+{\bf eo\-Easy\-EA} ({\bf eo\-Continue}$<$ {\bf EOT} $>$ \&\_\-continuator, {\bf eo\-Eval\-Func}$<$ {\bf EOT} $>$ \&\_\-eval, {\bf eo\-Breed}$<$ {\bf EOT} $>$ \&\_\-breed, {\bf eo\-Merge}$<$ {\bf EOT} $>$ \&\_\-merge, {\bf eo\-Reduce}$<$ {\bf EOT} $>$ \&\_\-reduce)\label{classeo_easy_e_a_a2}
+
+\begin{CompactList}\small\item\em Ctor {\bf eo\-Breed}{\rm (p.\,\pageref{classeo_breed})}, {\bf eo\-Merge}{\rm (p.\,\pageref{classeo_merge})} and {\bf eo\-Reduce}{\rm (p.\,\pageref{classeo_reduce})}. \item\end{CompactList}\item 
+{\bf eo\-Easy\-EA} ({\bf eo\-Continue}$<$ {\bf EOT} $>$ \&\_\-continuator, {\bf eo\-Eval\-Func}$<$ {\bf EOT} $>$ \&\_\-eval, {\bf eo\-Select}$<$ {\bf EOT} $>$ \&\_\-select, {\bf eo\-Transform}$<$ {\bf EOT} $>$ \&\_\-transform, {\bf eo\-Replacement}$<$ {\bf EOT} $>$ \&\_\-replace)\label{classeo_easy_e_a_a3}
+
+\begin{CompactList}\small\item\em Ctor {\bf eo\-Select}{\rm (p.\,\pageref{classeo_select})}, {\bf eo\-Transform}{\rm (p.\,\pageref{classeo_transform})}, and {\bf eo\-Replacement}{\rm (p.\,\pageref{classeo_replacement})}. \item\end{CompactList}\item 
+{\bf eo\-Easy\-EA} ({\bf eo\-Continue}$<$ {\bf EOT} $>$ \&\_\-continuator, {\bf eo\-Eval\-Func}$<$ {\bf EOT} $>$ \&\_\-eval, {\bf eo\-Select}$<$ {\bf EOT} $>$ \&\_\-select, {\bf eo\-Transform}$<$ {\bf EOT} $>$ \&\_\-transform, {\bf eo\-Merge}$<$ {\bf EOT} $>$ \&\_\-merge, {\bf eo\-Reduce}$<$ {\bf EOT} $>$ \&\_\-reduce)\label{classeo_easy_e_a_a4}
+
+\begin{CompactList}\small\item\em Ctor {\bf eo\-Select}{\rm (p.\,\pageref{classeo_select})}, {\bf eo\-Transform}{\rm (p.\,\pageref{classeo_transform})}, {\bf eo\-Merge}{\rm (p.\,\pageref{classeo_merge})} and {\bf eo\-Reduce}{\rm (p.\,\pageref{classeo_reduce})}. \item\end{CompactList}\item 
+virtual void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_easy_e_a_a5}
+
+\begin{CompactList}\small\item\em Apply a few generation of evolution to the population. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Protected Attributes}
+\begin{CompactItemize}
+\item 
+eo\-Easy\-EA::eo\-Dummy\-Select {\bf dummy\-Select}\label{classeo_easy_e_a_p0}
+
+\item 
+eo\-Easy\-EA::eo\-Dummy\-Transform {\bf dummy\-Transform}\label{classeo_easy_e_a_p1}
+
+\item 
+eo\-Easy\-EA::eo\-Dummy\-Eval {\bf dummy\-Eval}\label{classeo_easy_e_a_p2}
+
+\item 
+{\bf eo\-Continue}$<$ {\bf EOT} $>$ \& {\bf continuator}\label{classeo_easy_e_a_p3}
+
+\item 
+{\bf eo\-Eval\-Func}$<$ {\bf EOT} $>$ \& {\bf eval}\label{classeo_easy_e_a_p4}
+
+\item 
+{\bf eo\-Pop\-Loop\-Eval}$<$ {\bf EOT} $>$ {\bf loop\-Eval}\label{classeo_easy_e_a_p5}
+
+\item 
+{\bf eo\-Pop\-Eval\-Func}$<$ {\bf EOT} $>$ \& {\bf pop\-Eval}\label{classeo_easy_e_a_p6}
+
+\item 
+{\bf eo\-Select\-Transform}$<$ {\bf EOT} $>$ {\bf select\-Transform}\label{classeo_easy_e_a_p7}
+
+\item 
+{\bf eo\-Breed}$<$ {\bf EOT} $>$ \& {\bf breed}\label{classeo_easy_e_a_p8}
+
+\item 
+{\bf eo\-No\-Elitism}$<$ {\bf EOT} $>$ {\bf dummy\-Merge}\label{classeo_easy_e_a_p9}
+
+\item 
+{\bf eo\-Truncate}$<$ {\bf EOT} $>$ {\bf dummy\-Reduce}\label{classeo_easy_e_a_p10}
+
+\item 
+{\bf eo\-Merge\-Reduce}$<$ {\bf EOT} $>$ {\bf merge\-Reduce}\label{classeo_easy_e_a_p11}
+
+\item 
+{\bf eo\-Replacement}$<$ {\bf EOT} $>$ \& {\bf replace}\label{classeo_easy_e_a_p12}
+
+\end{CompactItemize}
+\subsection*{Friends}
+\begin{CompactItemize}
+\item 
+class {\bf eo\-Islands\-Easy\-EA$<$EOT$>$}\label{classeo_easy_e_a_n0}
+
+\item 
+class {\bf eo\-Dist\-Eval\-Easy\-EA$<$EOT$>$}\label{classeo_easy_e_a_n1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Easy\-EA$<$ EOT $>$}
+
+An easy-to-use evolutionary algorithm; you can use any chromosome, and any selection transformation, merging and evaluation algorithms; you can even change in runtime parameters of those sub-algorithms. 
+
+Change (MS, July 3. 2001): Replaced the {\bf eo\-Eval\-Func}{\rm (p.\,\pageref{classeo_eval_func})} by an {\bf eo\-Pop\-Eval\-Func}{\rm (p.\,\pageref{classeo_pop_eval_func})}: this immediately allows many useful constructs, such as co-evolution (e.g. game players), parisian approach (the solution to the problem is the whole population) or simple distribution of evaluations on a cluster. In case an {\bf eo\-Eval\-Func}{\rm (p.\,\pageref{classeo_eval_func})} is passed, it is embedded on an {\bf eo\-Pop\-Loop\-Eval}{\rm (p.\,\pageref{classeo_pop_loop_eval})} This makes things a little uglier (required an additional \char`\"{}dummy\char`\"{} member
+
+Note: it looks ugly only because we wanted to authorize many different constructors. Please only look at the operator() and there shall be light 
+
+
+
+Definition at line 63 of file eo\-Easy\-EA.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Easy\-EA.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_elite_sequential_select.eps b/trunk/paradiseo-eo/doc/latex/classeo_elite_sequential_select.eps
new file mode 100644
index 000000000..2ac7cfed9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_elite_sequential_select.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 115.607
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.325 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoEliteSequentialSelect< EOT >) cw
+(eoSelectOne< EOT >) cw
+(eoUF< const eoPop< EOT > &, const EOT & >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, const EOT & >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoEliteSequentialSelect< EOT >) 0.5 0 box
+ (eoSelectOne< EOT >) 0.5 1 box
+ (eoUF< const eoPop< EOT > &, const EOT & >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< const eoPop< EOT > &, const EOT & >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_elite_sequential_select.tex b/trunk/paradiseo-eo/doc/latex/classeo_elite_sequential_select.tex
new file mode 100644
index 000000000..fd62059b9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_elite_sequential_select.tex
@@ -0,0 +1,52 @@
+\section{eo\-Elite\-Sequential\-Select$<$ EOT $>$ Class Template Reference}
+\label{classeo_elite_sequential_select}\index{eoEliteSequentialSelect@{eoEliteSequentialSelect}}
+All Individuals in order.  
+
+
+{\tt \#include $<$eo\-Sequential\-Select.h$>$}
+
+Inheritance diagram for eo\-Elite\-Sequential\-Select$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.23699cm]{classeo_elite_sequential_select}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Elite\-Sequential\-Select} ()\label{classeo_elite_sequential_select_a0}
+
+\begin{CompactList}\small\item\em Ctor: sets the current pter to numeric\_\-limits$<$unsigned$>$::max() so init will take place first time not very elegant, maybe ... \item\end{CompactList}\item 
+void {\bf setup} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_elite_sequential_select_a1}
+
+\begin{CompactList}\small\item\em virtual function to setup some population stats (for instance eo\-Proportional can benefit greatly from this) \item\end{CompactList}\item 
+virtual const {\bf EOT} \& {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_elite_sequential_select_a2}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf current}\label{classeo_elite_sequential_select_r0}
+
+\item 
+std::vector$<$ const {\bf EOT} $\ast$ $>$ {\bf eo\-Pters}\label{classeo_elite_sequential_select_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Elite\-Sequential\-Select$<$ EOT $>$}
+
+All Individuals in order. 
+
+The best individual first, then the others in sequence (random order). for G3 evolution engine, see Deb, Anad and Joshi, CEC 2002
+
+As {\bf eo\-Sequential\-Select}{\rm (p.\,\pageref{classeo_sequential_select})}, it is an {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} to be used within the eo\-Easey\-EA algo, but conceptually it should be a global {\bf eo\-Select}{\rm (p.\,\pageref{classeo_select})}, as it selects a bunch of guys in one go (done in the setup function now) 
+
+
+
+Definition at line 97 of file eo\-Sequential\-Select.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Sequential\-Select.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_elitism.eps b/trunk/paradiseo-eo/doc/latex/classeo_elitism.eps
new file mode 100644
index 000000000..17dffe3be
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_elitism.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 122.85
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.07 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoElitism< EOT >) cw
+(eoMerge< EOT >) cw
+(eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< const eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoNoElitism< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoElitism< EOT >) 0.5 1 box
+ (eoMerge< EOT >) 0.5 2 box
+ (eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 3 box
+ (eoFunctorBase) 0 4 box
+ (binary_function< const eoPop< EOT > &, eoPop< EOT > &, void >) 1 4 box
+ (eoNoElitism< EOT >) 0.5 0 box
+
+% ----- relations -----
+
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+1 0.5 3 in
+solid
+0 0.5 3 out
+solid
+0 1 4 conn
+solid
+1 0 4 in
+solid
+1 1 4 in
+solid
+1 0.5 0.25 out
+solid
+0 0.5 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_elitism.tex b/trunk/paradiseo-eo/doc/latex/classeo_elitism.tex
new file mode 100644
index 000000000..018baa675
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_elitism.tex
@@ -0,0 +1,47 @@
+\section{eo\-Elitism$<$ EOT $>$ Class Template Reference}
+\label{classeo_elitism}\index{eoElitism@{eoElitism}}
+Straightforward elitism class, specify the number of individuals to copy into new geneneration or the rate w.r.t.  
+
+
+{\tt \#include $<$eo\-Merge.h$>$}
+
+Inheritance diagram for eo\-Elitism$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.4398cm]{classeo_elitism}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Elitism} (double \_\-rate, bool \_\-interpret\_\-as\_\-rate=true)\label{classeo_elitism_a0}
+
+\item 
+void {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-offspring)\label{classeo_elitism_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf rate}\label{classeo_elitism_r0}
+
+\item 
+unsigned {\bf combien}\label{classeo_elitism_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Elitism$<$ EOT $>$}
+
+Straightforward elitism class, specify the number of individuals to copy into new geneneration or the rate w.r.t. 
+
+pop size 
+
+
+
+Definition at line 55 of file eo\-Merge.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Merge.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_es_chrom_init.eps b/trunk/paradiseo-eo/doc/latex/classeo_es_chrom_init.eps
new file mode 100644
index 000000000..eba61c9a4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_es_chrom_init.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 248.756
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.01 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoEsChromInit< EOT >) cw
+(eoRealInitBounded< EOT >) cw
+(eoInit< EOT >) cw
+(eoUF< EOT &, void >) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoEsChromInit< EOT >) 0.5 0 box
+ (eoRealInitBounded< EOT >) 0.5 1 box
+ (eoInit< EOT >) 0.5 2 box
+ (eoUF< EOT &, void >) 0.5 3 box
+ (eoFunctorBase) 0 4 box
+ (unary_function< EOT &, void >) 1 4 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+1 0.5 3 in
+solid
+0 0.5 3 out
+solid
+0 1 4 conn
+solid
+1 0 4 in
+solid
+1 1 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_es_chrom_init.tex b/trunk/paradiseo-eo/doc/latex/classeo_es_chrom_init.tex
new file mode 100644
index 000000000..62b2e4588
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_es_chrom_init.tex
@@ -0,0 +1,169 @@
+\section{eo\-Es\-Chrom\-Init$<$ EOT $>$ Class Template Reference}
+\label{classeo_es_chrom_init}\index{eoEsChromInit@{eoEsChromInit}}
+Random Es-chromosome initializer (therefore derived from {\bf eo\-Init}{\rm (p.\,\pageref{classeo_init})}).  
+
+
+{\tt \#include $<$eo\-Es\-Chrom\-Init.h$>$}
+
+Inheritance diagram for eo\-Es\-Chrom\-Init$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=5cm]{classeo_es_chrom_init}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Fitness {\bf Fit\-T}\label{classeo_es_chrom_init_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Es\-Chrom\-Init} ({\bf eo\-Real\-Vector\-Bounds} \&\_\-bounds, double \_\-sigma=0.3, bool \_\-to\_\-scale=false)
+\begin{CompactList}\small\item\em Constructor. \item\end{CompactList}\item 
+{\bf eo\-Es\-Chrom\-Init} ({\bf eo\-Real\-Vector\-Bounds} \&\_\-bounds, std::vector$<$ double $>$ \_\-vec\-Sigma)
+\begin{CompactList}\small\item\em Constructor. \item\end{CompactList}\item 
+void {\bf operator()} ({\bf EOT} \&\_\-eo)\label{classeo_es_chrom_init_a2}
+
+\begin{CompactList}\small\item\em simply passes the argument to the uniform method of the bounds \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Member Functions}
+\begin{CompactItemize}
+\item 
+void {\bf create\_\-self\_\-adapt} ({\bf eo\-Real}$<$ Fit\-T $>$ \&)
+\begin{CompactList}\small\item\em Create intializer. \item\end{CompactList}\item 
+void {\bf create\_\-self\_\-adapt} ({\bf eo\-Es\-Simple}$<$ Fit\-T $>$ \&result)
+\begin{CompactList}\small\item\em Create intializer. \item\end{CompactList}\item 
+void {\bf create\_\-self\_\-adapt} ({\bf eo\-Es\-Stdev}$<$ Fit\-T $>$ \&result)
+\begin{CompactList}\small\item\em Create intializer. \item\end{CompactList}\item 
+void {\bf create\_\-self\_\-adapt} ({\bf eo\-Es\-Full}$<$ Fit\-T $>$ \&result)
+\begin{CompactList}\small\item\em Create intializer. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf unique\-Sigma}\label{classeo_es_chrom_init_r0}
+
+\begin{CompactList}\small\item\em Initial value in case of a unique sigma. \item\end{CompactList}\item 
+std::vector$<$ double $>$ {\bf vec\-Sigma}\label{classeo_es_chrom_init_r1}
+
+\begin{CompactList}\small\item\em Initial values in case of a vector of sigmas. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Es\-Chrom\-Init$<$ EOT $>$}
+
+Random Es-chromosome initializer (therefore derived from {\bf eo\-Init}{\rm (p.\,\pageref{classeo_init})}). 
+
+This class can initialize four types of real-valued genotypes thanks to tempate specialization of private method create:
+
+\begin{itemize}
+\item {\bf eo\-Real}{\rm (p.\,\pageref{classeo_real})} just an eo\-Vector$<$double$>$\item {\bf eo\-Es\-Simple}{\rm (p.\,\pageref{classeo_es_simple})} + one self-adapting single sigma for all variables\item {\bf eo\-Es\-Stdev}{\rm (p.\,\pageref{classeo_es_stdev})} a whole std::vector of self-adapting sigmas\item {\bf eo\-Es\-Full}{\rm (p.\,\pageref{classeo_es_full})} a full self-adapting correlation matrix\end{itemize}
+
+
+\begin{Desc}
+\item[See also:]{\bf eo\-Real}{\rm (p.\,\pageref{classeo_real})} {\bf eo\-Es\-Simple}{\rm (p.\,\pageref{classeo_es_simple})} {\bf eo\-Es\-Stdev}{\rm (p.\,\pageref{classeo_es_stdev})} {\bf eo\-Es\-Full}{\rm (p.\,\pageref{classeo_es_full})} {\bf eo\-Init}{\rm (p.\,\pageref{classeo_init})} \end{Desc}
+
+
+
+
+Definition at line 55 of file eo\-Es\-Chrom\-Init.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoEsChromInit@{eo\-Es\-Chrom\-Init}!eoEsChromInit@{eoEsChromInit}}
+\index{eoEsChromInit@{eoEsChromInit}!eoEsChromInit@{eo\-Es\-Chrom\-Init}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Es\-Chrom\-Init}$<$ {\bf EOT} $>$::{\bf eo\-Es\-Chrom\-Init} ({\bf eo\-Real\-Vector\-Bounds} \& {\em \_\-bounds}, double {\em \_\-sigma} = {\tt 0.3}, bool {\em \_\-to\_\-scale} = {\tt false})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_es_chrom_init_a0}
+
+
+Constructor. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-bounds}]bounds for uniform initialization \item[{\em \_\-sigma}]initial value for the stddev \item[{\em \_\-to\_\-scale}]wether sigma should be multiplied by the range of each variable added December 2004 - MS (together with the whole comment :-) \end{description}
+\end{Desc}
+
+
+Definition at line 71 of file eo\-Es\-Chrom\-Init.h.
+
+References eo\-Real\-Base\-Vector\-Bounds::range(), eo\-Real\-Init\-Bounded$<$ EOT $>$::the\-Bounds(), eo\-Es\-Chrom\-Init$<$ EOT $>$::unique\-Sigma, and eo\-Es\-Chrom\-Init$<$ EOT $>$::vec\-Sigma.\index{eoEsChromInit@{eo\-Es\-Chrom\-Init}!eoEsChromInit@{eoEsChromInit}}
+\index{eoEsChromInit@{eoEsChromInit}!eoEsChromInit@{eo\-Es\-Chrom\-Init}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Es\-Chrom\-Init}$<$ {\bf EOT} $>$::{\bf eo\-Es\-Chrom\-Init} ({\bf eo\-Real\-Vector\-Bounds} \& {\em \_\-bounds}, std::vector$<$ double $>$ {\em \_\-vec\-Sigma})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_es_chrom_init_a1}
+
+
+Constructor. 
+
+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
+
+Specify individual initial sigmas for each variable.
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-bounds}]bounds for uniform initialization \item[{\em \_\-sigma}]initial value for the stddev \end{description}
+\end{Desc}
+
+
+Definition at line 109 of file eo\-Es\-Chrom\-Init.h.
+
+References eo\-Es\-Chrom\-Init$<$ EOT $>$::unique\-Sigma, and eo\-Es\-Chrom\-Init$<$ EOT $>$::vec\-Sigma.
+
+\subsection{Member Function Documentation}
+\index{eoEsChromInit@{eo\-Es\-Chrom\-Init}!create_self_adapt@{create\_\-self\_\-adapt}}
+\index{create_self_adapt@{create\_\-self\_\-adapt}!eoEsChromInit@{eo\-Es\-Chrom\-Init}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ void {\bf eo\-Es\-Chrom\-Init}$<$ {\bf EOT} $>$::create\_\-self\_\-adapt ({\bf eo\-Real}$<$ Fit\-T $>$ \&)\hspace{0.3cm}{\tt  [inline, private]}}\label{classeo_es_chrom_init_d0}
+
+
+Create intializer. 
+
+No adaptive mutation at all 
+
+Definition at line 128 of file eo\-Es\-Chrom\-Init.h.
+
+Referenced by eo\-Es\-Chrom\-Init$<$ EOT $>$::operator()().\index{eoEsChromInit@{eo\-Es\-Chrom\-Init}!create_self_adapt@{create\_\-self\_\-adapt}}
+\index{create_self_adapt@{create\_\-self\_\-adapt}!eoEsChromInit@{eo\-Es\-Chrom\-Init}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ void {\bf eo\-Es\-Chrom\-Init}$<$ {\bf EOT} $>$::create\_\-self\_\-adapt ({\bf eo\-Es\-Simple}$<$ Fit\-T $>$ \& {\em result})\hspace{0.3cm}{\tt  [inline, private]}}\label{classeo_es_chrom_init_d1}
+
+
+Create intializer. 
+
+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
+
+Adaptive mutation through a unique sigma 
+
+Definition at line 139 of file eo\-Es\-Chrom\-Init.h.
+
+References eo\-Es\-Simple$<$ Fit $>$::stdev.\index{eoEsChromInit@{eo\-Es\-Chrom\-Init}!create_self_adapt@{create\_\-self\_\-adapt}}
+\index{create_self_adapt@{create\_\-self\_\-adapt}!eoEsChromInit@{eo\-Es\-Chrom\-Init}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ void {\bf eo\-Es\-Chrom\-Init}$<$ {\bf EOT} $>$::create\_\-self\_\-adapt ({\bf eo\-Es\-Stdev}$<$ Fit\-T $>$ \& {\em result})\hspace{0.3cm}{\tt  [inline, private]}}\label{classeo_es_chrom_init_d2}
+
+
+Create intializer. 
+
+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
+
+Adaptive mutation through a std::vector of sigmas
+
+\begin{Desc}
+\item[{\bf Todo}]Should we scale sigmas to the corresponding object variable range? \end{Desc}
+
+
+Definition at line 155 of file eo\-Es\-Chrom\-Init.h.
+
+References eo\-Es\-Stdev$<$ Fit $>$::stdevs.\index{eoEsChromInit@{eo\-Es\-Chrom\-Init}!create_self_adapt@{create\_\-self\_\-adapt}}
+\index{create_self_adapt@{create\_\-self\_\-adapt}!eoEsChromInit@{eo\-Es\-Chrom\-Init}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ void {\bf eo\-Es\-Chrom\-Init}$<$ {\bf EOT} $>$::create\_\-self\_\-adapt ({\bf eo\-Es\-Full}$<$ Fit\-T $>$ \& {\em result})\hspace{0.3cm}{\tt  [inline, private]}}\label{classeo_es_chrom_init_d3}
+
+
+Create intializer. 
+
+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
+
+Adaptive mutation through a whole correlation matrix 
+
+Definition at line 169 of file eo\-Es\-Chrom\-Init.h.
+
+References eo\-Es\-Full$<$ Fit $>$::correlations, eo\-Es\-Full$<$ Fit $>$::stdevs, and eo\-Rng::uniform().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Es\-Chrom\-Init.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_es_full.eps b/trunk/paradiseo-eo/doc/latex/classeo_es_full.eps
new file mode 100644
index 000000000..45bd64486
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_es_full.eps
@@ -0,0 +1,227 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 212.314
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.355 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoEsFull< Fit >) cw
+(eoVector< Fit, double >) cw
+(EO< Fit >) cw
+(vector< double >) cw
+(eoObject) cw
+(eoPersistent) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoEsFull< Fit >) 1 0 box
+ (eoVector< Fit, double >) 1 1 box
+ (EO< Fit >) 0.5 2 box
+ (vector< double >) 1.5 2 box
+ (eoObject) 0 3 box
+ (eoPersistent) 1 3 box
+ (eoPrintable) 1 4 box
+
+% ----- relations -----
+
+solid
+0 1 0 out
+solid
+1 1 1 in
+solid
+0 1 1 out
+solid
+0.5 1.5 2 conn
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 1.5 2 in
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+0 1 3 out
+solid
+1 1 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_es_full.tex b/trunk/paradiseo-eo/doc/latex/classeo_es_full.tex
new file mode 100644
index 000000000..315fc1fd7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_es_full.tex
@@ -0,0 +1,71 @@
+\section{eo\-Es\-Full$<$ Fit $>$ Class Template Reference}
+\label{classeo_es_full}\index{eoEsFull@{eoEsFull}}
+The most complex evolutionary strategy representation.  
+
+
+{\tt \#include $<$eo\-Es\-Full.h$>$}
+
+Inheritance diagram for eo\-Es\-Full$<$ Fit $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=5cm]{classeo_es_full}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef double {\bf Type}\label{classeo_es_full_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual std::string {\bf class\-Name} (void) const 
+\begin{CompactList}\small\item\em Return the class id. \item\end{CompactList}\item 
+void {\bf print\-On} (std::ostream \&os) const \label{classeo_es_full_a2}
+
+\begin{CompactList}\small\item\em printing... \item\end{CompactList}\item 
+void {\bf read\-From} (std::istream \&is)\label{classeo_es_full_a3}
+
+\begin{CompactList}\small\item\em reading... \item\end{CompactList}\end{CompactItemize}
+\subsection*{Public Attributes}
+\begin{CompactItemize}
+\item 
+std::vector$<$ double $>$ {\bf stdevs}\label{classeo_es_full_o0}
+
+\item 
+std::vector$<$ double $>$ {\bf correlations}\label{classeo_es_full_o1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Fit$>$ class eo\-Es\-Full$<$ Fit $>$}
+
+The most complex evolutionary strategy representation. 
+
+Co-evolving mutation rates and correlated mutations. 
+
+
+
+Definition at line 40 of file eo\-Es\-Full.h.
+
+\subsection{Member Function Documentation}
+\index{eoEsFull@{eo\-Es\-Full}!className@{className}}
+\index{className@{className}!eoEsFull@{eo\-Es\-Full}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Fit$>$ virtual std::string {\bf eo\-Es\-Full}$<$ Fit $>$::class\-Name (void) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_es_full_a1}
+
+
+Return the class id. 
+
+\begin{Desc}
+\item[Returns:]the class name as a std::string \end{Desc}
+
+
+Reimplemented from {\bf EO$<$ Fit $>$} {\rm (p.\,\pageref{class_e_o_z10_0})}.
+
+Definition at line 51 of file eo\-Es\-Full.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Es\-Full.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_es_global_xover.eps b/trunk/paradiseo-eo/doc/latex/classeo_es_global_xover.eps
new file mode 100644
index 000000000..8629aac06
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_es_global_xover.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 91.0125
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.49375 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoEsGlobalXover< EOT >) cw
+(eoGenOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoUF< eoPopulator< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< eoPopulator< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoEsGlobalXover< EOT >) 0.5 0 box
+ (eoGenOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoUF< eoPopulator< EOT > &, void >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< eoPopulator< EOT > &, void >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_es_global_xover.tex b/trunk/paradiseo-eo/doc/latex/classeo_es_global_xover.tex
new file mode 100644
index 000000000..cc09e0cbc
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_es_global_xover.tex
@@ -0,0 +1,126 @@
+\section{eo\-Es\-Global\-Xover$<$ EOT $>$ Class Template Reference}
+\label{classeo_es_global_xover}\index{eoEsGlobalXover@{eoEsGlobalXover}}
+Gloabl crossover operator for ES genotypes.  
+
+
+{\tt \#include $<$eo\-Es\-Global\-Xover.h$>$}
+
+Inheritance diagram for eo\-Es\-Global\-Xover$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.54835cm]{classeo_es_global_xover}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Fitness {\bf Fit\-T}\label{classeo_es_global_xover_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Es\-Global\-Xover} ({\bf eo\-Bin\-Op}$<$ double $>$ \&\_\-cross\-Obj, {\bf eo\-Bin\-Op}$<$ double $>$ \&\_\-cross\-Mut)\label{classeo_es_global_xover_a0}
+
+\begin{CompactList}\small\item\em (Default) Constructor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_es_global_xover_a1}
+
+\begin{CompactList}\small\item\em The class name. Used to display statistics. \item\end{CompactList}\item 
+unsigned {\bf max\_\-production} (void)\label{classeo_es_global_xover_a2}
+
+\begin{CompactList}\small\item\em The TOTAL number of offspring (here = nb of parents modified in place). \item\end{CompactList}\item 
+void {\bf apply} ({\bf eo\-Populator}$<$ {\bf EOT} $>$ \&\_\-plop)
+\begin{CompactList}\small\item\em modifies one parents in the populator using 2 new parents for each component! \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Member Functions}
+\begin{CompactItemize}
+\item 
+void {\bf cross\_\-self\_\-adapt} ({\bf eo\-Es\-Simple}$<$ Fit\-T $>$ \&\_\-parent, const {\bf eo\-Pop}$<$ {\bf eo\-Es\-Simple}$<$ Fit\-T $>$ $>$ \&\_\-pop)
+\begin{CompactList}\small\item\em Method for cross self-adaptation parameters. \item\end{CompactList}\item 
+void {\bf cross\_\-self\_\-adapt} ({\bf eo\-Es\-Stdev}$<$ Fit\-T $>$ \&\_\-parent, const {\bf eo\-Pop}$<$ {\bf eo\-Es\-Stdev}$<$ Fit\-T $>$ $>$ \&\_\-pop)
+\begin{CompactList}\small\item\em Method for cross self-adaptation parameters. \item\end{CompactList}\item 
+void {\bf cross\_\-self\_\-adapt} ({\bf eo\-Es\-Full}$<$ Fit\-T $>$ \&\_\-parent, const {\bf eo\-Pop}$<$ {\bf eo\-Es\-Full}$<$ Fit\-T $>$ $>$ \&\_\-pop)
+\begin{CompactList}\small\item\em Method for cross self-adaptation parameters. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Random\-Select}$<$ {\bf EOT} $>$ {\bf sel}\label{classeo_es_global_xover_r0}
+
+\item 
+{\bf eo\-Bin\-Op}$<$ double $>$ \& {\bf cross\-Obj}\label{classeo_es_global_xover_r1}
+
+\item 
+{\bf eo\-Bin\-Op}$<$ double $>$ \& {\bf cross\-Mut}\label{classeo_es_global_xover_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Es\-Global\-Xover$<$ EOT $>$}
+
+Gloabl crossover operator for ES genotypes. 
+
+Uses some Atom crossovers to handle both the object variables and the mutation strategy parameters 
+
+
+
+Definition at line 44 of file eo\-Es\-Global\-Xover.h.
+
+\subsection{Member Function Documentation}
+\index{eoEsGlobalXover@{eo\-Es\-Global\-Xover}!apply@{apply}}
+\index{apply@{apply}!eoEsGlobalXover@{eo\-Es\-Global\-Xover}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ void {\bf eo\-Es\-Global\-Xover}$<$ {\bf EOT} $>$::apply ({\bf eo\-Populator}$<$ {\bf EOT} $>$ \& {\em \_\-plop})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_es_global_xover_a3}
+
+
+modifies one parents in the populator using 2 new parents for each component! 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-pop}]a POPULATOR (not a simple population) \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Gen\-Op$<$ EOT $>$} {\rm (p.\,\pageref{classeo_gen_op_b0})}.
+
+Definition at line 67 of file eo\-Es\-Global\-Xover.h.
+
+References eo\-Es\-Global\-Xover$<$ EOT $>$::cross\_\-self\_\-adapt(), EO$<$ F $>$::invalidate(), and eo\-Populator$<$ EOT $>$::source().\index{eoEsGlobalXover@{eo\-Es\-Global\-Xover}!cross_self_adapt@{cross\_\-self\_\-adapt}}
+\index{cross_self_adapt@{cross\_\-self\_\-adapt}!eoEsGlobalXover@{eo\-Es\-Global\-Xover}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ void {\bf eo\-Es\-Global\-Xover}$<$ {\bf EOT} $>$::cross\_\-self\_\-adapt ({\bf eo\-Es\-Simple}$<$ Fit\-T $>$ \& {\em \_\-parent}, const {\bf eo\-Pop}$<$ {\bf eo\-Es\-Simple}$<$ Fit\-T $>$ $>$ \& {\em \_\-pop})\hspace{0.3cm}{\tt  [inline, private]}}\label{classeo_es_global_xover_d0}
+
+
+Method for cross self-adaptation parameters. 
+
+Specialization for {\bf eo\-Es\-Simple}{\rm (p.\,\pageref{classeo_es_simple})}. 
+
+Definition at line 94 of file eo\-Es\-Global\-Xover.h.
+
+References eo\-Es\-Simple$<$ Fit $>$::stdev.
+
+Referenced by eo\-Es\-Global\-Xover$<$ EOT $>$::apply().\index{eoEsGlobalXover@{eo\-Es\-Global\-Xover}!cross_self_adapt@{cross\_\-self\_\-adapt}}
+\index{cross_self_adapt@{cross\_\-self\_\-adapt}!eoEsGlobalXover@{eo\-Es\-Global\-Xover}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ void {\bf eo\-Es\-Global\-Xover}$<$ {\bf EOT} $>$::cross\_\-self\_\-adapt ({\bf eo\-Es\-Stdev}$<$ Fit\-T $>$ \& {\em \_\-parent}, const {\bf eo\-Pop}$<$ {\bf eo\-Es\-Stdev}$<$ Fit\-T $>$ $>$ \& {\em \_\-pop})\hspace{0.3cm}{\tt  [inline, private]}}\label{classeo_es_global_xover_d1}
+
+
+Method for cross self-adaptation parameters. 
+
+Specialization for {\bf eo\-Es\-Stdev}{\rm (p.\,\pageref{classeo_es_stdev})}. 
+
+Definition at line 106 of file eo\-Es\-Global\-Xover.h.
+
+References eo\-Es\-Stdev$<$ Fit $>$::stdevs.\index{eoEsGlobalXover@{eo\-Es\-Global\-Xover}!cross_self_adapt@{cross\_\-self\_\-adapt}}
+\index{cross_self_adapt@{cross\_\-self\_\-adapt}!eoEsGlobalXover@{eo\-Es\-Global\-Xover}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ void {\bf eo\-Es\-Global\-Xover}$<$ {\bf EOT} $>$::cross\_\-self\_\-adapt ({\bf eo\-Es\-Full}$<$ Fit\-T $>$ \& {\em \_\-parent}, const {\bf eo\-Pop}$<$ {\bf eo\-Es\-Full}$<$ Fit\-T $>$ $>$ \& {\em \_\-pop})\hspace{0.3cm}{\tt  [inline, private]}}\label{classeo_es_global_xover_d2}
+
+
+Method for cross self-adaptation parameters. 
+
+Specialization for {\bf eo\-Es\-Full}{\rm (p.\,\pageref{classeo_es_full})}. 
+
+Definition at line 121 of file eo\-Es\-Global\-Xover.h.
+
+References eo\-Es\-Full$<$ Fit $>$::correlations, and eo\-Es\-Full$<$ Fit $>$::stdevs.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Es\-Global\-Xover.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_es_mutate.eps b/trunk/paradiseo-eo/doc/latex/classeo_es_mutate.eps
new file mode 100644
index 000000000..c4231caf6
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_es_mutate.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 132.67
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.76875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoEsMutate< EOT >) cw
+(eoMonOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoUF< EOT &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoEsMutate< EOT >) 0.5 0 box
+ (eoMonOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoUF< EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_es_mutate.tex b/trunk/paradiseo-eo/doc/latex/classeo_es_mutate.tex
new file mode 100644
index 000000000..18dd28742
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_es_mutate.tex
@@ -0,0 +1,224 @@
+\section{eo\-Es\-Mutate$<$ EOT $>$ Class Template Reference}
+\label{classeo_es_mutate}\index{eoEsMutate@{eoEsMutate}}
+ES-style mutation in the large.  
+
+
+{\tt \#include $<$eo\-Es\-Mutate.h$>$}
+
+Inheritance diagram for eo\-Es\-Mutate$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.71476cm]{classeo_es_mutate}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Fitness {\bf Fit\-T}\label{classeo_es_mutate_w0}
+
+\begin{CompactList}\small\item\em Fitness-type. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Es\-Mutate} ({\bf eo\-Es\-Mutation\-Init} \&\_\-init, {\bf eo\-Real\-Vector\-Bounds} \&\_\-bounds)
+\begin{CompactList}\small\item\em Initialization. \item\end{CompactList}\item 
+virtual {\bf $\sim$eo\-Es\-Mutate} ()\label{classeo_es_mutate_a1}
+
+\begin{CompactList}\small\item\em Virtual Destructor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const 
+\begin{CompactList}\small\item\em Classname. \item\end{CompactList}\item 
+virtual bool {\bf operator()} ({\bf eo\-Es\-Simple}$<$ {\bf Fit\-T} $>$ \&\_\-eo)
+\begin{CompactList}\small\item\em Mutate {\bf eo\-Es\-Simple}{\rm (p.\,\pageref{classeo_es_simple})}. \item\end{CompactList}\item 
+virtual bool {\bf operator()} ({\bf eo\-Es\-Stdev}$<$ {\bf Fit\-T} $>$ \&\_\-eo)
+\begin{CompactList}\small\item\em Standard mutation in ES. \item\end{CompactList}\item 
+virtual bool {\bf operator()} ({\bf eo\-Es\-Full}$<$ {\bf Fit\-T} $>$ \&\_\-eo)
+\begin{CompactList}\small\item\em Correlated mutations in ES. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Member Functions}
+\begin{CompactItemize}
+\item 
+void {\bf init} ({\bf eo\-Es\-Simple}$<$ {\bf Fit\-T} $>$, {\bf eo\-Es\-Mutation\-Init} \&\_\-init)\label{classeo_es_mutate_d0}
+
+\begin{CompactList}\small\item\em Initialization of simple ES. \item\end{CompactList}\item 
+void {\bf init} ({\bf eo\-Es\-Stdev}$<$ {\bf Fit\-T} $>$, {\bf eo\-Es\-Mutation\-Init} \&\_\-init)
+\begin{CompactList}\small\item\em Initialization of standard ES. \item\end{CompactList}\item 
+void {\bf init} ({\bf eo\-Es\-Full}$<$ {\bf Fit\-T} $>$, {\bf eo\-Es\-Mutation\-Init} \&\_\-init)
+\begin{CompactList}\small\item\em Initialization of full ES. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf Tau\-Lcl}\label{classeo_es_mutate_r0}
+
+\begin{CompactList}\small\item\em Local factor for mutation of std deviations. \item\end{CompactList}\item 
+double {\bf Tau\-Glb}\label{classeo_es_mutate_r1}
+
+\begin{CompactList}\small\item\em Global factor for mutation of std deviations. \item\end{CompactList}\item 
+double {\bf Tau\-Beta}\label{classeo_es_mutate_r2}
+
+\begin{CompactList}\small\item\em Factor for mutation of correlation parameters. \item\end{CompactList}\item 
+{\bf eo\-Real\-Vector\-Bounds} \& {\bf bounds}\label{classeo_es_mutate_r3}
+
+\begin{CompactList}\small\item\em Bounds of parameters. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Static Private Attributes}
+\begin{CompactItemize}
+\item 
+const double {\bf stdev\_\-eps} = 1.0e-40
+\begin{CompactList}\small\item\em Minimum stdev. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Es\-Mutate$<$ EOT $>$}
+
+ES-style mutation in the large. 
+
+Obviously, valid only for eo\-ES$\ast$. It is currently valid for three types of ES chromosomes:\begin{itemize}
+\item {\bf eo\-Es\-Simple}{\rm (p.\,\pageref{classeo_es_simple})}: Exactly one stdandard-deviation\item {\bf eo\-Es\-Stdev}{\rm (p.\,\pageref{classeo_es_stdev})}: As many standard deviations as object variables\item {\bf eo\-Es\-Full}{\rm (p.\,\pageref{classeo_es_full})}: The whole guacemole: correlations, stdevs and object variables\end{itemize}
+
+
+Each of these three variant has it's own operator() in eo\-Es\-Mutate and intialization is also split into three cases (that share some commonalities) 
+
+
+
+Definition at line 60 of file eo\-Es\-Mutate.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoEsMutate@{eo\-Es\-Mutate}!eoEsMutate@{eoEsMutate}}
+\index{eoEsMutate@{eoEsMutate}!eoEsMutate@{eo\-Es\-Mutate}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Es\-Mutate}$<$ {\bf EOT} $>$::{\bf eo\-Es\-Mutate} ({\bf eo\-Es\-Mutation\-Init} \& {\em \_\-init}, {\bf eo\-Real\-Vector\-Bounds} \& {\em \_\-bounds})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_es_mutate_a0}
+
+
+Initialization. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-init}]Proxy class for initializating the three parameters eo\-Es\-Mutate needs \item[{\em \_\-bounds}]Bounds for the objective variables \end{description}
+\end{Desc}
+
+
+Definition at line 74 of file eo\-Es\-Mutate.h.
+
+References eo\-Es\-Mutate$<$ EOT $>$::bounds, and eo\-Es\-Mutate$<$ EOT $>$::init().
+
+\subsection{Member Function Documentation}
+\index{eoEsMutate@{eo\-Es\-Mutate}!className@{className}}
+\index{className@{className}!eoEsMutate@{eo\-Es\-Mutate}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ virtual std::string {\bf eo\-Es\-Mutate}$<$ {\bf EOT} $>$::class\-Name (void) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_es_mutate_a2}
+
+
+Classname. 
+
+Inherited from {\bf eo\-Object}{\rm (p.\,\pageref{classeo_object})} \begin{Desc}
+\item[See also:]{\bf eo\-Object}{\rm (p.\,\pageref{classeo_object})}\end{Desc}
+\begin{Desc}
+\item[Returns:]Name of class. \end{Desc}
+
+
+Reimplemented from {\bf eo\-Mon\-Op$<$ EOT $>$} {\rm (p.\,\pageref{classeo_mon_op})}.
+
+Definition at line 90 of file eo\-Es\-Mutate.h.\index{eoEsMutate@{eo\-Es\-Mutate}!operator()@{operator()}}
+\index{operator()@{operator()}!eoEsMutate@{eo\-Es\-Mutate}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ virtual bool {\bf eo\-Es\-Mutate}$<$ {\bf EOT} $>$::operator() ({\bf eo\-Es\-Simple}$<$ {\bf Fit\-T} $>$ \& {\em \_\-eo})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_es_mutate_a3}
+
+
+Mutate {\bf eo\-Es\-Simple}{\rm (p.\,\pageref{classeo_es_simple})}. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-eo}]Individual to mutate. \end{description}
+\end{Desc}
+
+
+Definition at line 97 of file eo\-Es\-Mutate.h.
+
+References eo\-Es\-Mutate$<$ EOT $>$::bounds, eo\-Real\-Base\-Vector\-Bounds::folds\-In\-Bounds(), eo\-Rng::normal(), eo\-Es\-Simple$<$ Fit $>$::stdev, and eo\-Es\-Mutate$<$ EOT $>$::Tau\-Lcl.\index{eoEsMutate@{eo\-Es\-Mutate}!operator()@{operator()}}
+\index{operator()@{operator()}!eoEsMutate@{eo\-Es\-Mutate}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ virtual bool {\bf eo\-Es\-Mutate}$<$ {\bf EOT} $>$::operator() ({\bf eo\-Es\-Stdev}$<$ {\bf Fit\-T} $>$ \& {\em \_\-eo})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_es_mutate_a4}
+
+
+Standard mutation in ES. 
+
+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
+
+Standard mutation of object variables and standard deviations in ESs.
+
+If there are fewer different standard deviations available than the dimension of the objective function requires, the last standard deviation is responsible for ALL remaining object variables.
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-eo}]Individual to mutate.\end{description}
+\end{Desc}
+\begin{Desc}
+\item[See also:]Schwefel 1977: Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie, pp. 165 ff. \end{Desc}
+
+
+Definition at line 128 of file eo\-Es\-Mutate.h.
+
+References eo\-Es\-Mutate$<$ EOT $>$::bounds, eo\-Real\-Base\-Vector\-Bounds::folds\-In\-Bounds(), eo\-Rng::normal(), eo\-Es\-Stdev$<$ Fit $>$::stdevs, eo\-Es\-Mutate$<$ EOT $>$::Tau\-Glb, and eo\-Es\-Mutate$<$ EOT $>$::Tau\-Lcl.\index{eoEsMutate@{eo\-Es\-Mutate}!operator()@{operator()}}
+\index{operator()@{operator()}!eoEsMutate@{eo\-Es\-Mutate}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ virtual bool {\bf eo\-Es\-Mutate}$<$ {\bf EOT} $>$::operator() ({\bf eo\-Es\-Full}$<$ {\bf Fit\-T} $>$ \& {\em \_\-eo})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_es_mutate_a5}
+
+
+Correlated mutations in ES. 
+
+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
+
+Mutation of object variables, standard deviations, and their correlations in ESs.
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-eo}]Individual to mutate.\end{description}
+\end{Desc}
+\begin{Desc}
+\item[See also:]\begin{itemize}
+\item H.-P. Schwefel: Internal Report of KFA Juelich, KFA-STE-IB-3/80, p. 43, 1980.\item G. Rudolph: Globale Optimierung mit parallelen Evolutionsstrategien, Diploma Thesis, University of Dortmund, 1990. \end{itemize}
+\end{Desc}
+
+
+Definition at line 159 of file eo\-Es\-Mutate.h.
+
+References eo\-Es\-Mutate$<$ EOT $>$::bounds, eo\-Es\-Full$<$ Fit $>$::correlations, eo\-Real\-Base\-Vector\-Bounds::folds\-In\-Bounds(), eo\-Rng::normal(), eo\-Es\-Full$<$ Fit $>$::stdevs, eo\-Es\-Mutate$<$ EOT $>$::Tau\-Beta, eo\-Es\-Mutate$<$ EOT $>$::Tau\-Glb, and eo\-Es\-Mutate$<$ EOT $>$::Tau\-Lcl.\index{eoEsMutate@{eo\-Es\-Mutate}!init@{init}}
+\index{init@{init}!eoEsMutate@{eo\-Es\-Mutate}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ void {\bf eo\-Es\-Mutate}$<$ {\bf EOT} $>$::init ({\bf eo\-Es\-Stdev}$<$ {\bf Fit\-T} $>$, {\bf eo\-Es\-Mutation\-Init} \& {\em \_\-init})\hspace{0.3cm}{\tt  [inline, private]}}\label{classeo_es_mutate_d1}
+
+
+Initialization of standard ES. 
+
+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 
+
+Definition at line 228 of file eo\-Es\-Mutate.h.
+
+References eo\-Es\-Mutate$<$ EOT $>$::bounds, eo\-Es\-Mutation\-Init::Tau\-Glb(), eo\-Es\-Mutate$<$ EOT $>$::Tau\-Glb, eo\-Es\-Mutation\-Init::Tau\-Lcl(), and eo\-Es\-Mutate$<$ EOT $>$::Tau\-Lcl.\index{eoEsMutate@{eo\-Es\-Mutate}!init@{init}}
+\index{init@{init}!eoEsMutate@{eo\-Es\-Mutate}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ void {\bf eo\-Es\-Mutate}$<$ {\bf EOT} $>$::init ({\bf eo\-Es\-Full}$<$ {\bf Fit\-T} $>$, {\bf eo\-Es\-Mutation\-Init} \& {\em \_\-init})\hspace{0.3cm}{\tt  [inline, private]}}\label{classeo_es_mutate_d2}
+
+
+Initialization of full ES. 
+
+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 
+
+Definition at line 244 of file eo\-Es\-Mutate.h.
+
+References eo\-Es\-Mutate$<$ EOT $>$::init(), eo\-Es\-Mutation\-Init::Tau\-Beta(), eo\-Es\-Mutate$<$ EOT $>$::Tau\-Beta, eo\-Es\-Mutate$<$ EOT $>$::Tau\-Glb, and eo\-Es\-Mutate$<$ EOT $>$::Tau\-Lcl.
+
+\subsection{Member Data Documentation}
+\index{eoEsMutate@{eo\-Es\-Mutate}!stdev_eps@{stdev\_\-eps}}
+\index{stdev_eps@{stdev\_\-eps}!eoEsMutate@{eo\-Es\-Mutate}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ const double {\bf eo\-Es\-Mutate}$<$ {\bf EOT} $>$::{\bf stdev\_\-eps} = 1.0e-40\hspace{0.3cm}{\tt  [static, private]}}\label{classeo_es_mutate_v0}
+
+
+Minimum stdev. 
+
+If you let the step-size go to 0, self-adaptation stops, therefore we give a lower bound. The actual value used is somewhat arbitrary and the is no theoretical reasoning known for it (Sep 2005).
+
+The code that we have in {\bf EO}{\rm (p.\,\pageref{class_e_o})} is a port from a C code that Thomas B\"{a}ck kindly donated to the community some years ago. It has been modified by Marc Schoenauer for inclusion in Evol\-C, than by Maarten Keijzer into {\bf EO}{\rm (p.\,\pageref{class_e_o})}. The exact value was adjusted based on practice.
+
+Removing this doesn't work well, but it was never tried to figure out what the best value would be. 
+
+Definition at line 284 of file eo\-Es\-Mutate.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Es\-Mutate.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_es_mutation_init.tex b/trunk/paradiseo-eo/doc/latex/classeo_es_mutation_init.tex
new file mode 100644
index 000000000..9e3884b4e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_es_mutation_init.tex
@@ -0,0 +1,103 @@
+\section{eo\-Es\-Mutation\-Init Class Reference}
+\label{classeo_es_mutation_init}\index{eoEsMutationInit@{eoEsMutationInit}}
+Initialize Mutation operator.  
+
+
+{\tt \#include $<$eo\-Es\-Mutation\-Init.h$>$}
+
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Es\-Mutation\-Init} ({\bf eo\-Parser} \&\_\-parser, std::string \_\-section=\char`\"{}ES mutation parameters\char`\"{})
+\begin{CompactList}\small\item\em Constructor. \item\end{CompactList}\item 
+virtual {\bf $\sim$eo\-Es\-Mutation\-Init} ()\label{classeo_es_mutation_init_a1}
+
+\begin{CompactList}\small\item\em Virtual destructor. \item\end{CompactList}\item 
+double {\bf Tau\-Lcl} (void)\label{classeo_es_mutation_init_a2}
+
+\begin{CompactList}\small\item\em local  \item\end{CompactList}\item 
+double {\bf Tau\-Glb} (void)\label{classeo_es_mutation_init_a3}
+
+\begin{CompactList}\small\item\em global tau \item\end{CompactList}\item 
+double {\bf Tau\-Beta} (void)\label{classeo_es_mutation_init_a4}
+
+\begin{CompactList}\small\item\em correlation's tau \item\end{CompactList}\end{CompactItemize}
+\subsection*{Protected Member Functions}
+\begin{CompactItemize}
+\item 
+virtual std::string {\bf section} (void)\label{classeo_es_mutation_init_b0}
+
+\item 
+virtual std::string {\bf Tau\-Lcl\-Name} (void) const \label{classeo_es_mutation_init_b1}
+
+\item 
+virtual char {\bf Tau\-Lcl\-Short} (void) const \label{classeo_es_mutation_init_b2}
+
+\item 
+virtual std::string {\bf Tau\-Glb\-Name} (void) const \label{classeo_es_mutation_init_b3}
+
+\item 
+virtual char {\bf Tau\-Glb\-Short} (void) const \label{classeo_es_mutation_init_b4}
+
+\item 
+virtual std::string {\bf Tau\-Beta\-Name} (void) const \label{classeo_es_mutation_init_b5}
+
+\item 
+virtual char {\bf Tau\-Beta\-Short} (void) const \label{classeo_es_mutation_init_b6}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Parser} \& {\bf parser}\label{classeo_es_mutation_init_r0}
+
+\item 
+std::string {\bf rep\-Section}\label{classeo_es_mutation_init_r1}
+
+\item 
+{\bf eo\-Value\-Param}$<$ double $>$ $\ast$ {\bf Tau\-Lcl\-Param}\label{classeo_es_mutation_init_r2}
+
+\item 
+{\bf eo\-Value\-Param}$<$ double $>$ $\ast$ {\bf Tau\-Glb\-Param}\label{classeo_es_mutation_init_r3}
+
+\item 
+{\bf eo\-Value\-Param}$<$ double $>$ $\ast$ {\bf Tau\-Beta\-Param}\label{classeo_es_mutation_init_r4}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Initialize Mutation operator. 
+
+Proxy class that is used for initializing the mutation operator. It provides an interface between {\bf eo\-Es\-Mutate}{\rm (p.\,\pageref{classeo_es_mutate})} and the abstract parameter\-Loader. It also provides the names for the parameters in this class as virtual protected member functions.
+
+If you have more than a single ES in a project that need different names in the configuration files, you might consider overriding this class to change the names.
+
+\begin{Desc}
+\item[See also:]{\bf eo\-Es\-Mutate}{\rm (p.\,\pageref{classeo_es_mutate})} \end{Desc}
+
+
+
+
+Definition at line 47 of file eo\-Es\-Mutation\-Init.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoEsMutationInit@{eo\-Es\-Mutation\-Init}!eoEsMutationInit@{eoEsMutationInit}}
+\index{eoEsMutationInit@{eoEsMutationInit}!eoEsMutationInit@{eo\-Es\-Mutation\-Init}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}eo\-Es\-Mutation\-Init::eo\-Es\-Mutation\-Init ({\bf eo\-Parser} \& {\em \_\-parser}, std::string {\em \_\-section} = {\tt \char`\"{}ES\ mutation\ parameters\char`\"{}})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_es_mutation_init_a0}
+
+
+Constructor. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-parser}]Parser to read parameters from. \item[{\em \_\-section}]Parser section for -parameters. \end{description}
+\end{Desc}
+
+
+Definition at line 56 of file eo\-Es\-Mutation\-Init.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Es\-Mutation\-Init.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_es_simple.eps b/trunk/paradiseo-eo/doc/latex/classeo_es_simple.eps
new file mode 100644
index 000000000..648924070
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_es_simple.eps
@@ -0,0 +1,227 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 212.314
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.355 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoEsSimple< Fit >) cw
+(eoVector< Fit, double >) cw
+(EO< Fit >) cw
+(vector< double >) cw
+(eoObject) cw
+(eoPersistent) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoEsSimple< Fit >) 1 0 box
+ (eoVector< Fit, double >) 1 1 box
+ (EO< Fit >) 0.5 2 box
+ (vector< double >) 1.5 2 box
+ (eoObject) 0 3 box
+ (eoPersistent) 1 3 box
+ (eoPrintable) 1 4 box
+
+% ----- relations -----
+
+solid
+0 1 0 out
+solid
+1 1 1 in
+solid
+0 1 1 out
+solid
+0.5 1.5 2 conn
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 1.5 2 in
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+0 1 3 out
+solid
+1 1 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_es_simple.tex b/trunk/paradiseo-eo/doc/latex/classeo_es_simple.tex
new file mode 100644
index 000000000..38a47a3c6
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_es_simple.tex
@@ -0,0 +1,72 @@
+\section{eo\-Es\-Simple$<$ Fit $>$ Class Template Reference}
+\label{classeo_es_simple}\index{eoEsSimple@{eoEsSimple}}
+Simple Evolution Strategy.  
+
+
+{\tt \#include $<$eo\-Es\-Simple.h$>$}
+
+Inheritance diagram for eo\-Es\-Simple$<$ Fit $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=5cm]{classeo_es_simple}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef double {\bf Type}\label{classeo_es_simple_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual std::string {\bf class\-Name} () const 
+\begin{CompactList}\small\item\em Return the class id. \item\end{CompactList}\item 
+void {\bf print\-On} (std::ostream \&os) const \label{classeo_es_simple_a2}
+
+\begin{CompactList}\small\item\em printing... \item\end{CompactList}\item 
+void {\bf read\-From} (std::istream \&is)\label{classeo_es_simple_a3}
+
+\begin{CompactList}\small\item\em reading... \item\end{CompactList}\end{CompactItemize}
+\subsection*{Public Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf stdev}\label{classeo_es_simple_o0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Fit$>$ class eo\-Es\-Simple$<$ Fit $>$}
+
+Simple Evolution Strategy. 
+
+One of the more simple evolution strategies, sporting just a single stdeviation for the entire chromosome. For more advanced versions see also {\bf eo\-Es\-Stdev}{\rm (p.\,\pageref{classeo_es_stdev})} {\bf eo\-Es\-Full}{\rm (p.\,\pageref{classeo_es_full})}
+
+\begin{Desc}
+\item[See also:]{\bf eo\-Es\-Stdev}{\rm (p.\,\pageref{classeo_es_stdev})} {\bf eo\-Es\-Full}{\rm (p.\,\pageref{classeo_es_full})} \end{Desc}
+
+
+
+
+Definition at line 42 of file eo\-Es\-Simple.h.
+
+\subsection{Member Function Documentation}
+\index{eoEsSimple@{eo\-Es\-Simple}!className@{className}}
+\index{className@{className}!eoEsSimple@{eo\-Es\-Simple}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Fit$>$ virtual std::string {\bf eo\-Es\-Simple}$<$ Fit $>$::class\-Name (void) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_es_simple_a1}
+
+
+Return the class id. 
+
+\begin{Desc}
+\item[Returns:]the class name as a std::string \end{Desc}
+
+
+Reimplemented from {\bf EO$<$ Fit $>$} {\rm (p.\,\pageref{class_e_o_z10_0})}.
+
+Definition at line 50 of file eo\-Es\-Simple.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Es\-Simple.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_es_standard_xover.eps b/trunk/paradiseo-eo/doc/latex/classeo_es_standard_xover.eps
new file mode 100644
index 000000000..189839afb
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_es_standard_xover.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 92.9152
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.38125 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoEsStandardXover< EOT >) cw
+(eoBinOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoBF< EOT &, const EOT &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< EOT &, const EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoEsStandardXover< EOT >) 0.5 0 box
+ (eoBinOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoBF< EOT &, const EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< EOT &, const EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_es_standard_xover.tex b/trunk/paradiseo-eo/doc/latex/classeo_es_standard_xover.tex
new file mode 100644
index 000000000..f5eef2eea
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_es_standard_xover.tex
@@ -0,0 +1,71 @@
+\section{eo\-Es\-Standard\-Xover$<$ EOT $>$ Class Template Reference}
+\label{classeo_es_standard_xover}\index{eoEsStandardXover@{eoEsStandardXover}}
+Standard (i.e.  
+
+
+{\tt \#include $<$eo\-Es\-Standard\-Xover.h$>$}
+
+Inheritance diagram for eo\-Es\-Standard\-Xover$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.60163cm]{classeo_es_standard_xover}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Fitness {\bf Fit\-T}\label{classeo_es_standard_xover_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Es\-Standard\-Xover} ({\bf eo\-Bin\-Op}$<$ double $>$ \&\_\-cross\-Obj, {\bf eo\-Bin\-Op}$<$ double $>$ \&\_\-cross\-Mut)\label{classeo_es_standard_xover_a0}
+
+\begin{CompactList}\small\item\em (Default) Constructor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_es_standard_xover_a1}
+
+\begin{CompactList}\small\item\em The class name. Used to display statistics. \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eo1, const {\bf EOT} \&\_\-eo2)\label{classeo_es_standard_xover_a2}
+
+\begin{CompactList}\small\item\em modifies one parents in the populator using a second parent \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Member Functions}
+\begin{CompactItemize}
+\item 
+bool {\bf cross\_\-self\_\-adapt} ({\bf eo\-Es\-Simple}$<$ Fit\-T $>$ \&\_\-parent1, const {\bf eo\-Es\-Simple}$<$ Fit\-T $>$ \&\_\-parent2)\label{classeo_es_standard_xover_d0}
+
+\item 
+bool {\bf cross\_\-self\_\-adapt} ({\bf eo\-Es\-Stdev}$<$ Fit\-T $>$ \&\_\-parent1, const {\bf eo\-Es\-Stdev}$<$ Fit\-T $>$ \&\_\-parent2)\label{classeo_es_standard_xover_d1}
+
+\item 
+bool {\bf cross\_\-self\_\-adapt} ({\bf eo\-Es\-Full}$<$ Fit\-T $>$ \&\_\-parent1, const {\bf eo\-Es\-Full}$<$ Fit\-T $>$ \&\_\-parent2)\label{classeo_es_standard_xover_d2}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Random\-Select}$<$ {\bf EOT} $>$ {\bf sel}\label{classeo_es_standard_xover_r0}
+
+\item 
+{\bf eo\-Bin\-Op}$<$ double $>$ \& {\bf cross\-Obj}\label{classeo_es_standard_xover_r1}
+
+\item 
+{\bf eo\-Bin\-Op}$<$ double $>$ \& {\bf cross\-Mut}\label{classeo_es_standard_xover_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Es\-Standard\-Xover$<$ EOT $>$}
+
+Standard (i.e. 
+
+{\bf eo\-Bin\-Op}{\rm (p.\,\pageref{classeo_bin_op})}) crossover operator for ES genotypes. Uses some Atom crossovers to handle both the object variables and the mutation strategy parameters It is an {\bf eo\-Bin\-Op}{\rm (p.\,\pageref{classeo_bin_op})} and has to be wrapped into an {\bf eo\-Gen\-Op}{\rm (p.\,\pageref{classeo_gen_op})} before being used like the global version 
+
+
+
+Definition at line 46 of file eo\-Es\-Standard\-Xover.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Es\-Standard\-Xover.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_es_stdev.eps b/trunk/paradiseo-eo/doc/latex/classeo_es_stdev.eps
new file mode 100644
index 000000000..8c82c123f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_es_stdev.eps
@@ -0,0 +1,227 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 212.314
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.355 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoEsStdev< Fit >) cw
+(eoVector< Fit, double >) cw
+(EO< Fit >) cw
+(vector< double >) cw
+(eoObject) cw
+(eoPersistent) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoEsStdev< Fit >) 1 0 box
+ (eoVector< Fit, double >) 1 1 box
+ (EO< Fit >) 0.5 2 box
+ (vector< double >) 1.5 2 box
+ (eoObject) 0 3 box
+ (eoPersistent) 1 3 box
+ (eoPrintable) 1 4 box
+
+% ----- relations -----
+
+solid
+0 1 0 out
+solid
+1 1 1 in
+solid
+0 1 1 out
+solid
+0.5 1.5 2 conn
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 1.5 2 in
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+0 1 3 out
+solid
+1 1 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_es_stdev.tex b/trunk/paradiseo-eo/doc/latex/classeo_es_stdev.tex
new file mode 100644
index 000000000..cd7e23b85
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_es_stdev.tex
@@ -0,0 +1,68 @@
+\section{eo\-Es\-Stdev$<$ Fit $>$ Class Template Reference}
+\label{classeo_es_stdev}\index{eoEsStdev@{eoEsStdev}}
+Evolutionary Strategy with a standard deviation per parameter.  
+
+
+{\tt \#include $<$eo\-Es\-Stdev.h$>$}
+
+Inheritance diagram for eo\-Es\-Stdev$<$ Fit $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=5cm]{classeo_es_stdev}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef double {\bf Type}\label{classeo_es_stdev_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual std::string {\bf class\-Name} (void) const 
+\begin{CompactList}\small\item\em Return the class id. \item\end{CompactList}\item 
+void {\bf print\-On} (std::ostream \&os) const \label{classeo_es_stdev_a2}
+
+\begin{CompactList}\small\item\em printing... \item\end{CompactList}\item 
+void {\bf read\-From} (std::istream \&is)\label{classeo_es_stdev_a3}
+
+\begin{CompactList}\small\item\em reading... \item\end{CompactList}\end{CompactItemize}
+\subsection*{Public Attributes}
+\begin{CompactItemize}
+\item 
+std::vector$<$ double $>$ {\bf stdevs}\label{classeo_es_stdev_o0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Fit$>$ class eo\-Es\-Stdev$<$ Fit $>$}
+
+Evolutionary Strategy with a standard deviation per parameter. 
+
+Evolutionary strategie style representation, supporting co-evolving standard deviations. 
+
+
+
+Definition at line 37 of file eo\-Es\-Stdev.h.
+
+\subsection{Member Function Documentation}
+\index{eoEsStdev@{eo\-Es\-Stdev}!className@{className}}
+\index{className@{className}!eoEsStdev@{eo\-Es\-Stdev}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Fit$>$ virtual std::string {\bf eo\-Es\-Stdev}$<$ Fit $>$::class\-Name (void) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_es_stdev_a1}
+
+
+Return the class id. 
+
+\begin{Desc}
+\item[Returns:]the class name as a std::string \end{Desc}
+
+
+Reimplemented from {\bf EO$<$ Fit $>$} {\rm (p.\,\pageref{class_e_o_z10_0})}.
+
+Definition at line 47 of file eo\-Es\-Stdev.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Es\-Stdev.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_eval_continue.eps b/trunk/paradiseo-eo/doc/latex/classeo_eval_continue.eps
new file mode 100644
index 000000000..55df079a4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_eval_continue.eps
@@ -0,0 +1,227 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 90.0901
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.55 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoEvalContinue< EOT >) cw
+(eoContinue< EOT >) cw
+(eoUF< const eoPop< EOT > &, bool >) cw
+(eoPersistent) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, bool >) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoEvalContinue< EOT >) 1.25 0 box
+ (eoContinue< EOT >) 1.25 1 box
+ (eoUF< const eoPop< EOT > &, bool >) 0.5 2 box
+ (eoPersistent) 2 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< const eoPop< EOT > &, bool >) 1 3 box
+ (eoPrintable) 2 3 box
+
+% ----- relations -----
+
+solid
+0 1.25 0 out
+solid
+1 1.25 1 in
+solid
+0 1.25 1 out
+solid
+0.5 2 2 conn
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 2 2 in
+solid
+0 2 2 out
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+1 2 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_eval_continue.tex b/trunk/paradiseo-eo/doc/latex/classeo_eval_continue.tex
new file mode 100644
index 000000000..b195f0a92
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_eval_continue.tex
@@ -0,0 +1,51 @@
+\section{eo\-Eval\-Continue$<$ EOT $>$ Class Template Reference}
+\label{classeo_eval_continue}\index{eoEvalContinue@{eoEvalContinue}}
+Continues until a number of evaluations has been made.  
+
+
+{\tt \#include $<$eo\-Eval\-Continue.h$>$}
+
+Inheritance diagram for eo\-Eval\-Continue$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.52252cm]{classeo_eval_continue}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Eval\-Continue} ({\bf eo\-Eval\-Func\-Counter}$<$ {\bf EOT} $>$ \&\_\-eval, unsigned long \_\-total\-Eval)\label{classeo_eval_continue_a0}
+
+\begin{CompactList}\small\item\em Ctor. \item\end{CompactList}\item 
+virtual bool {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-v\-EO)\label{classeo_eval_continue_a1}
+
+\begin{CompactList}\small\item\em Returns false when a certain number of evaluations has been done. \item\end{CompactList}\item 
+virtual unsigned long {\bf total\-Evaluations} ()\label{classeo_eval_continue_a2}
+
+\begin{CompactList}\small\item\em Returns the number of generations to reach. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} (void) const \label{classeo_eval_continue_a3}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Eval\-Func\-Counter}$<$ {\bf EOT} $>$ \& {\bf eval}\label{classeo_eval_continue_r0}
+
+\item 
+unsigned long {\bf rep\-Total\-Evaluations}\label{classeo_eval_continue_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Eval\-Continue$<$ EOT $>$}
+
+Continues until a number of evaluations has been made. 
+
+
+
+Definition at line 36 of file eo\-Eval\-Continue.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Eval\-Continue.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_eval_func.eps b/trunk/paradiseo-eo/doc/latex/classeo_eval_func.eps
new file mode 100644
index 000000000..5c0afd37d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_eval_func.eps
@@ -0,0 +1,241 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 43.6205
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 11.4625 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 7 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoEvalFunc< EOT >) cw
+(eoUF< EOT &, void >) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, void >) cw
+(eoAssembledEvalFunc< EOT >) cw
+(eoEasyEA< EOT >::eoDummyEval) cw
+(eoEvalFuncCounter< EOT >) cw
+(eoEvalFuncPtr< EOT, FitT, FunctionArg >) cw
+(eoMyEval< EOT >) cw
+(eoOneMaxEvalFunc< EOT >) cw
+(RoyalRoad< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoEvalFunc< EOT >) 3 1 box
+ (eoUF< EOT &, void >) 3 2 box
+ (eoFunctorBase) 2.5 3 box
+ (unary_function< EOT &, void >) 3.5 3 box
+ (eoAssembledEvalFunc< EOT >) 0 0 box
+ (eoEasyEA< EOT >::eoDummyEval) 1 0 box
+ (eoEvalFuncCounter< EOT >) 2 0 box
+ (eoEvalFuncPtr< EOT, FitT, FunctionArg >) 3 0 box
+ (eoMyEval< EOT >) 4 0 box
+ (eoOneMaxEvalFunc< EOT >) 5 0 box
+ (RoyalRoad< EOT >) 6 0 box
+
+% ----- relations -----
+
+solid
+0 3 1 out
+solid
+1 3 2 in
+solid
+0 3 2 out
+solid
+2.5 3.5 3 conn
+solid
+1 2.5 3 in
+solid
+1 3.5 3 in
+solid
+1 3 0.25 out
+solid
+0 6 1 conn
+solid
+0 0 0.75 in
+solid
+0 1 0.75 in
+solid
+0 2 0.75 in
+solid
+0 3 0.75 in
+solid
+0 4 0.75 in
+solid
+0 5 0.75 in
+solid
+0 6 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_eval_func.tex b/trunk/paradiseo-eo/doc/latex/classeo_eval_func.tex
new file mode 100644
index 000000000..5219df8ac
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_eval_func.tex
@@ -0,0 +1,40 @@
+\section{eo\-Eval\-Func$<$ EOT $>$ Class Template Reference}
+\label{classeo_eval_func}\index{eoEvalFunc@{eoEvalFunc}}
+Evaluate: takes one {\bf EO}{\rm (p.\,\pageref{class_e_o})} and sets its \char`\"{}fitness\char`\"{} property returning this fitness also.  
+
+
+{\tt \#include $<$eo\-Eval\-Func.h$>$}
+
+Inheritance diagram for eo\-Eval\-Func$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=1.22137cm]{classeo_eval_func}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef {\bf EOT} {\bf EOType}\label{classeo_eval_func_w0}
+
+\item 
+typedef EOT::Fitness {\bf EOFit\-T}\label{classeo_eval_func_w1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Eval\-Func$<$ EOT $>$}
+
+Evaluate: takes one {\bf EO}{\rm (p.\,\pageref{class_e_o})} and sets its \char`\"{}fitness\char`\"{} property returning this fitness also. 
+
+That is why EOT is passed by non-const reference: it must be altered within evaluate.$\backslash$
+
+The requirements on the types with which this class is to be instantiated with are null, or else, they depend on the particular class it's going to be applied to; {\bf EO}{\rm (p.\,\pageref{class_e_o})} does not impose any requirement on it. If you subclass this abstract class, and use it to evaluate an {\bf EO}{\rm (p.\,\pageref{class_e_o})}, the requirements on this {\bf EO}{\rm (p.\,\pageref{class_e_o})} will depend on the evaluator. 
+
+
+
+Definition at line 41 of file eo\-Eval\-Func.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Eval\-Func.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_eval_func_counter.eps b/trunk/paradiseo-eo/doc/latex/classeo_eval_func_counter.eps
new file mode 100644
index 000000000..d9e1a89b1
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_eval_func_counter.eps
@@ -0,0 +1,227 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 128.824
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.88125 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoEvalFuncCounter< EOT >) cw
+(eoEvalFunc< EOT >) cw
+(eoValueParam< unsigned long >) cw
+(eoUF< EOT &, void >) cw
+(eoParam) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoEvalFuncCounter< EOT >) 1 0 box
+ (eoEvalFunc< EOT >) 0.5 1 box
+ (eoValueParam< unsigned long >) 1.5 1 box
+ (eoUF< EOT &, void >) 0.5 2 box
+ (eoParam) 1.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< EOT &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 1 0 out
+solid
+0.5 1.5 1 conn
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 1.5 1 in
+solid
+0 1.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 1.5 2 in
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_eval_func_counter.tex b/trunk/paradiseo-eo/doc/latex/classeo_eval_func_counter.tex
new file mode 100644
index 000000000..3e4c6de4b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_eval_func_counter.tex
@@ -0,0 +1,44 @@
+\section{eo\-Eval\-Func\-Counter$<$ EOT $>$ Class Template Reference}
+\label{classeo_eval_func_counter}\index{eoEvalFuncCounter@{eoEvalFuncCounter}}
+Counts the number of evaluations actually performed, thus checks first if it has to evaluate..  
+
+
+{\tt \#include $<$eo\-Eval\-Func\-Counter.h$>$}
+
+Inheritance diagram for eo\-Eval\-Func\-Counter$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.60709cm]{classeo_eval_func_counter}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Eval\-Func\-Counter} ({\bf eo\-Eval\-Func}$<$ {\bf EOT} $>$ \&\_\-func, std::string \_\-name=\char`\"{}Eval. \char`\"{})\label{classeo_eval_func_counter_a0}
+
+\item 
+virtual void {\bf operator()} ({\bf EOT} \&\_\-eo)\label{classeo_eval_func_counter_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Eval\-Func}$<$ {\bf EOT} $>$ \& {\bf func}\label{classeo_eval_func_counter_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Eval\-Func\-Counter$<$ EOT $>$}
+
+Counts the number of evaluations actually performed, thus checks first if it has to evaluate.. 
+
+etc. 
+
+
+
+Definition at line 37 of file eo\-Eval\-Func\-Counter.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Eval\-Func\-Counter.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_expansion_mutation.eps b/trunk/paradiseo-eo/doc/latex/classeo_expansion_mutation.eps
new file mode 100644
index 000000000..d88c282c8
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_expansion_mutation.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 76.6284
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 6.525 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoExpansionMutation< FType, Node >) cw
+(eoMonOp< eoParseTree< FType, Node > >) cw
+(eoOp< eoParseTree< FType, Node > >) cw
+(eoUF< eoParseTree< FType, Node > &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< eoParseTree< FType, Node > &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoExpansionMutation< FType, Node >) 0.5 0 box
+ (eoMonOp< eoParseTree< FType, Node > >) 0.5 1 box
+ (eoOp< eoParseTree< FType, Node > >) 0 2 box
+ (eoUF< eoParseTree< FType, Node > &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< eoParseTree< FType, Node > &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_expansion_mutation.tex b/trunk/paradiseo-eo/doc/latex/classeo_expansion_mutation.tex
new file mode 100644
index 000000000..42ee72c99
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_expansion_mutation.tex
@@ -0,0 +1,91 @@
+\section{eo\-Expansion\-Mutation$<$ FType, Node $>$ Class Template Reference}
+\label{classeo_expansion_mutation}\index{eoExpansionMutation@{eoExpansionMutation}}
+eo\-Expansion\-Mutation --$>$ replace a terminal with a randomly created subtree  
+
+
+{\tt \#include $<$gp/eo\-Parse\-Tree\-Op.h$>$}
+
+Inheritance diagram for eo\-Expansion\-Mutation$<$ FType, Node $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.14559cm]{classeo_expansion_mutation}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef {\bf eo\-Parse\-Tree}$<$ FType, Node $>$ {\bf Eo\-Type}\label{classeo_expansion_mutation_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Expansion\-Mutation} ({\bf eo\-Init}$<$ {\bf Eo\-Type} $>$ \&\_\-init, unsigned \_\-max\_\-length)
+\begin{CompactList}\small\item\em Constructor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_expansion_mutation_a1}
+
+\begin{CompactList}\small\item\em The class name. \item\end{CompactList}\item 
+virtual {\bf $\sim$eo\-Expansion\-Mutation} ()\label{classeo_expansion_mutation_a2}
+
+\begin{CompactList}\small\item\em Dtor. \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf Eo\-Type} \&\_\-eo1)
+\begin{CompactList}\small\item\em Mutate an individual. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf max\_\-length}\label{classeo_expansion_mutation_r0}
+
+\item 
+{\bf eo\-Init}$<$ {\bf Eo\-Type} $>$ \& {\bf initializer}\label{classeo_expansion_mutation_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class FType, class Node$>$ class eo\-Expansion\-Mutation$<$ FType, Node $>$}
+
+eo\-Expansion\-Mutation --$>$ replace a terminal with a randomly created subtree 
+
+
+
+Definition at line 204 of file eo\-Parse\-Tree\-Op.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoExpansionMutation@{eo\-Expansion\-Mutation}!eoExpansionMutation@{eoExpansionMutation}}
+\index{eoExpansionMutation@{eoExpansionMutation}!eoExpansionMutation@{eo\-Expansion\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ {\bf eo\-Expansion\-Mutation}$<$ FType, Node $>$::{\bf eo\-Expansion\-Mutation} ({\bf eo\-Init}$<$ {\bf Eo\-Type} $>$ \& {\em \_\-init}, unsigned {\em \_\-max\_\-length})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_expansion_mutation_a0}
+
+
+Constructor. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-init}]An instantiation of eo\-Gp\-Depth\-Initializer \item[{\em \_\-max\_\-length}]the maximum size of an individual \end{description}
+\end{Desc}
+
+
+Definition at line 215 of file eo\-Parse\-Tree\-Op.h.
+
+\subsection{Member Function Documentation}
+\index{eoExpansionMutation@{eo\-Expansion\-Mutation}!operator()@{operator()}}
+\index{operator()@{operator()}!eoExpansionMutation@{eo\-Expansion\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ bool {\bf eo\-Expansion\-Mutation}$<$ FType, Node $>$::operator() ({\bf Eo\-Type} \& {\em \_\-eo1})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_expansion_mutation_a3}
+
+
+Mutate an individual. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-eo1}]The individual that is to be changed \end{description}
+\end{Desc}
+
+
+Definition at line 228 of file eo\-Parse\-Tree\-Op.h.
+
+References eo\-Parse\-Tree$<$ FType, Node $>$::prune\-Tree(), and eo\-Rng::random().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Parse\-Tree\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_external_bin_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_external_bin_op.eps
new file mode 100644
index 000000000..5c96f88d8
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_external_bin_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 73.0594
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 6.84375 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoExternalBinOp< F, External, ExternalEO >) cw
+(eoBinOp< ExternalEO >) cw
+(eoOp< ExternalEO >) cw
+(eoBF< ExternalEO &, const ExternalEO &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< ExternalEO &, const ExternalEO &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoExternalBinOp< F, External, ExternalEO >) 0.5 0 box
+ (eoBinOp< ExternalEO >) 0.5 1 box
+ (eoOp< ExternalEO >) 0 2 box
+ (eoBF< ExternalEO &, const ExternalEO &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< ExternalEO &, const ExternalEO &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_external_bin_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_external_bin_op.tex
new file mode 100644
index 000000000..a3a107fdb
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_external_bin_op.tex
@@ -0,0 +1,46 @@
+\section{eo\-External\-Bin\-Op$<$ F, External, External\-EO $>$ Class Template Reference}
+\label{classeo_external_bin_op}\index{eoExternalBinOp@{eoExternalBinOp}}
+Crossover of external struct, ctor expects a function of the following signature:.  
+
+
+{\tt \#include $<$eo\-External\-Op\-Functions.h$>$}
+
+Inheritance diagram for eo\-External\-Bin\-Op$<$ F, External, External\-EO $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.04566cm]{classeo_external_bin_op}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-External\-Bin\-Op} (bool($\ast$\_\-binop)(External \&, const External \&))\label{classeo_external_bin_op_a0}
+
+\item 
+bool {\bf operator()} (External\-EO \&eo1, const External\-EO \&eo2)\label{classeo_external_bin_op_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+bool($\ast$ {\bf binop} )(External \&, const External \&)\label{classeo_external_bin_op_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class F, class External, class External\-EO = eo\-External\-EO$<$F, External$>$$>$ class eo\-External\-Bin\-Op$<$ F, External, External\-EO $>$}
+
+Crossover of external struct, ctor expects a function of the following signature:. 
+
+bool func(External\&, const External\&);
+
+Where External is the user defined struct or class The function should return true when it changed something, false otherwise 
+
+
+
+Definition at line 128 of file eo\-External\-Op\-Functions.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-External\-Op\-Functions.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_external_e_o.eps b/trunk/paradiseo-eo/doc/latex/classeo_external_e_o.eps
new file mode 100644
index 000000000..5b36980d6
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_external_e_o.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 209.424
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.3875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoExternalEO< Fit, External >) cw
+(EO< Fit >) cw
+(eoObject) cw
+(eoPersistent) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoExternalEO< Fit, External >) 0.5 0 box
+ (EO< Fit >) 0.5 1 box
+ (eoObject) 0 2 box
+ (eoPersistent) 1 2 box
+ (eoPrintable) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_external_e_o.tex b/trunk/paradiseo-eo/doc/latex/classeo_external_e_o.tex
new file mode 100644
index 000000000..abbd9255a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_external_e_o.tex
@@ -0,0 +1,64 @@
+\section{eo\-External\-EO$<$ Fit, External $>$ Class Template Reference}
+\label{classeo_external_e_o}\index{eoExternalEO@{eoExternalEO}}
+Definition of an object that allows an external struct to be inserted in {\bf EO}{\rm (p.\,\pageref{class_e_o})}.  
+
+
+{\tt \#include $<$eo\-External\-EO.h$>$}
+
+Inheritance diagram for eo\-External\-EO$<$ Fit, External $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_external_e_o}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-External\-EO} (const External \&ext)\label{classeo_external_e_o_a1}
+
+\begin{CompactList}\small\item\em Init external\-Eo with the struct itself and set fitness to zero. \item\end{CompactList}\item 
+{\bf eo\-External\-EO} (std::istream \&is, const External \&ext)\label{classeo_external_e_o_a2}
+
+\item 
+virtual void {\bf read\-From} (std::istream \&\_\-is)\label{classeo_external_e_o_a3}
+
+\begin{CompactList}\small\item\em Read object, the external struct needs to have an operator$>$$>$ defined. \item\end{CompactList}\item 
+virtual void {\bf print\-On} (std::ostream \&\_\-os) const 
+\begin{CompactList}\small\item\em Write object. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Fit, class External$>$ class eo\-External\-EO$<$ Fit, External $>$}
+
+Definition of an object that allows an external struct to be inserted in {\bf EO}{\rm (p.\,\pageref{class_e_o})}. 
+
+This struct or class can be of any form, the only thing this class does is attach a fitness value to it and makes it the appropriate type (derives it from {\bf EO}{\rm (p.\,\pageref{class_e_o})}). 
+
+
+
+Definition at line 39 of file eo\-External\-EO.h.
+
+\subsection{Member Function Documentation}
+\index{eoExternalEO@{eo\-External\-EO}!printOn@{printOn}}
+\index{printOn@{printOn}!eoExternalEO@{eo\-External\-EO}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Fit, class External$>$ virtual void {\bf eo\-External\-EO}$<$ Fit, External $>$::print\-On (std::ostream \& {\em \_\-os}) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_external_e_o_a4}
+
+
+Write object. 
+
+Called print\-On since it prints the object \_\-on\_\- a stream. \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-os}]A std::ostream. \end{description}
+\end{Desc}
+
+
+Reimplemented from {\bf EO$<$ Fit $>$} {\rm (p.\,\pageref{class_e_o_z10_2})}.
+
+Definition at line 69 of file eo\-External\-EO.h.
+
+References EO$<$ F $>$::print\-On().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-External\-EO.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_external_eval_func.eps b/trunk/paradiseo-eo/doc/latex/classeo_external_eval_func.eps
new file mode 100644
index 000000000..b3b22249e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_external_eval_func.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 136.054
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.675 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoExternalEvalFunc< F, External, ExternalEO >) cw
+(eoEvalFunc< ExternalEO >) cw
+(eoUF< ExternalEO &, void >) cw
+(eoFunctorBase) cw
+(unary_function< ExternalEO &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoExternalEvalFunc< F, External, ExternalEO >) 0.5 0 box
+ (eoEvalFunc< ExternalEO >) 0.5 1 box
+ (eoUF< ExternalEO &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< ExternalEO &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_external_eval_func.tex b/trunk/paradiseo-eo/doc/latex/classeo_external_eval_func.tex
new file mode 100644
index 000000000..616f120c9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_external_eval_func.tex
@@ -0,0 +1,46 @@
+\section{eo\-External\-Eval\-Func$<$ F, External, External\-EO $>$ Class Template Reference}
+\label{classeo_external_eval_func}\index{eoExternalEvalFunc@{eoExternalEvalFunc}}
+Evaluation of external struct, ctor expects a function of the following signature:.  
+
+
+{\tt \#include $<$eo\-External\-Op\-Functions.h$>$}
+
+Inheritance diagram for eo\-External\-Eval\-Func$<$ F, External, External\-EO $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.80952cm]{classeo_external_eval_func}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-External\-Eval\-Func} (F($\ast$\_\-eval)(const External \&))\label{classeo_external_eval_func_a0}
+
+\item 
+void {\bf operator()} (External\-EO \&eo)\label{classeo_external_eval_func_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+F($\ast$ {\bf eval} )(const External \&)\label{classeo_external_eval_func_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class F, class External, class External\-EO = eo\-External\-EO$<$F, External$>$$>$ class eo\-External\-Eval\-Func$<$ F, External, External\-EO $>$}
+
+Evaluation of external struct, ctor expects a function of the following signature:. 
+
+Fit func(External\&);
+
+Where External is the user defined struct or class and Fit the fitness type 
+
+
+
+Definition at line 73 of file eo\-External\-Op\-Functions.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-External\-Op\-Functions.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_external_init.eps b/trunk/paradiseo-eo/doc/latex/classeo_external_init.eps
new file mode 100644
index 000000000..bafdcb4e3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_external_init.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 156.25
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.2 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoExternalInit< F, External, ExternalEO >) cw
+(eoInit< ExternalEO >) cw
+(eoUF< ExternalEO &, void >) cw
+(eoFunctorBase) cw
+(unary_function< ExternalEO &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoExternalInit< F, External, ExternalEO >) 0.5 0 box
+ (eoInit< ExternalEO >) 0.5 1 box
+ (eoUF< ExternalEO &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< ExternalEO &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_external_init.tex b/trunk/paradiseo-eo/doc/latex/classeo_external_init.tex
new file mode 100644
index 000000000..bcd13e9d4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_external_init.tex
@@ -0,0 +1,46 @@
+\section{eo\-External\-Init$<$ F, External, External\-EO $>$ Class Template Reference}
+\label{classeo_external_init}\index{eoExternalInit@{eoExternalInit}}
+Initialization of external struct, ctor expects a function of the following signature:.  
+
+
+{\tt \#include $<$eo\-External\-Op\-Functions.h$>$}
+
+Inheritance diagram for eo\-External\-Init$<$ F, External, External\-EO $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_external_init}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-External\-Init} (External($\ast$\_\-init)(void))\label{classeo_external_init_a0}
+
+\item 
+void {\bf operator()} (External\-EO \&\_\-eo)\label{classeo_external_init_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+External($\ast$ {\bf init} )(void)\label{classeo_external_init_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class F, class External, class External\-EO = eo\-External\-EO$<$F, External$>$$>$ class eo\-External\-Init$<$ F, External, External\-EO $>$}
+
+Initialization of external struct, ctor expects a function of the following signature:. 
+
+External func();
+
+Where External is the user defined struct or class 
+
+
+
+Definition at line 45 of file eo\-External\-Op\-Functions.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-External\-Op\-Functions.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_external_mon_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_external_mon_op.eps
new file mode 100644
index 000000000..322083eba
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_external_mon_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 94.5626
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.2875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoExternalMonOp< F, External, ExternalEO >) cw
+(eoMonOp< ExternalEO >) cw
+(eoOp< ExternalEO >) cw
+(eoUF< ExternalEO &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< ExternalEO &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoExternalMonOp< F, External, ExternalEO >) 0.5 0 box
+ (eoMonOp< ExternalEO >) 0.5 1 box
+ (eoOp< ExternalEO >) 0 2 box
+ (eoUF< ExternalEO &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< ExternalEO &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_external_mon_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_external_mon_op.tex
new file mode 100644
index 000000000..f0268be20
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_external_mon_op.tex
@@ -0,0 +1,46 @@
+\section{eo\-External\-Mon\-Op$<$ F, External, External\-EO $>$ Class Template Reference}
+\label{classeo_external_mon_op}\index{eoExternalMonOp@{eoExternalMonOp}}
+Mutation of external struct, ctor expects a function of the following signature:.  
+
+
+{\tt \#include $<$eo\-External\-Op\-Functions.h$>$}
+
+Inheritance diagram for eo\-External\-Mon\-Op$<$ F, External, External\-EO $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.64775cm]{classeo_external_mon_op}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-External\-Mon\-Op} (bool($\ast$\_\-mutate)(External \&))\label{classeo_external_mon_op_a0}
+
+\item 
+bool {\bf operator()} (External\-EO \&eo)\label{classeo_external_mon_op_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+bool($\ast$ {\bf mutate} )(External \&)\label{classeo_external_mon_op_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class F, class External, class External\-EO = eo\-External\-EO$<$F, External$>$$>$ class eo\-External\-Mon\-Op$<$ F, External, External\-EO $>$}
+
+Mutation of external struct, ctor expects a function of the following signature:. 
+
+bool func(External\&);
+
+Where External is the user defined struct or class. The function should return true when it changed something, false otherwise 
+
+
+
+Definition at line 102 of file eo\-External\-Op\-Functions.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-External\-Op\-Functions.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_external_quad_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_external_quad_op.eps
new file mode 100644
index 000000000..1e0cbc74d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_external_quad_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 80.8081
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 6.1875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoExternalQuadOp< F, External, ExternalEO >) cw
+(eoQuadOp< ExternalEO >) cw
+(eoOp< ExternalEO >) cw
+(eoBF< ExternalEO &, ExternalEO &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< ExternalEO &, ExternalEO &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoExternalQuadOp< F, External, ExternalEO >) 0.5 0 box
+ (eoQuadOp< ExternalEO >) 0.5 1 box
+ (eoOp< ExternalEO >) 0 2 box
+ (eoBF< ExternalEO &, ExternalEO &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< ExternalEO &, ExternalEO &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_external_quad_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_external_quad_op.tex
new file mode 100644
index 000000000..acd703df2
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_external_quad_op.tex
@@ -0,0 +1,46 @@
+\section{eo\-External\-Quad\-Op$<$ F, External, External\-EO $>$ Class Template Reference}
+\label{classeo_external_quad_op}\index{eoExternalQuadOp@{eoExternalQuadOp}}
+Crossover of external struct, ctor expects a function of the following signature:.  
+
+
+{\tt \#include $<$eo\-External\-Op\-Functions.h$>$}
+
+Inheritance diagram for eo\-External\-Quad\-Op$<$ F, External, External\-EO $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.26263cm]{classeo_external_quad_op}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-External\-Quad\-Op} (bool($\ast$\_\-quadop)(External \&, External \&))\label{classeo_external_quad_op_a0}
+
+\item 
+bool {\bf operator()} (External\-EO \&eo1, External\-EO \&eo2)\label{classeo_external_quad_op_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+bool($\ast$ {\bf quadop} )(External \&, External \&)\label{classeo_external_quad_op_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class F, class External, class External\-EO = eo\-External\-EO$<$F, External$>$$>$ class eo\-External\-Quad\-Op$<$ F, External, External\-EO $>$}
+
+Crossover of external struct, ctor expects a function of the following signature:. 
+
+bool func(External\&, External\&);
+
+Where External is the user defined struct or class The function should return true when it changed something, false otherwise 
+
+
+
+Definition at line 154 of file eo\-External\-Op\-Functions.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-External\-Op\-Functions.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_f.eps b/trunk/paradiseo-eo/doc/latex/classeo_f.eps
new file mode 100644
index 000000000..634be144d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_f.eps
@@ -0,0 +1,197 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 377.358
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.325 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 2 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoF< R >) cw
+(eoFunctorBase) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoF< R >) 0 0 box
+ (eoFunctorBase) 0 1 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_f.tex b/trunk/paradiseo-eo/doc/latex/classeo_f.tex
new file mode 100644
index 000000000..603c4920e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_f.tex
@@ -0,0 +1,50 @@
+\section{eo\-F$<$ R $>$ Class Template Reference}
+\label{classeo_f}\index{eoF@{eoF}}
+Basic Function.  
+
+
+{\tt \#include $<$eo\-Functor.h$>$}
+
+Inheritance diagram for eo\-F$<$ R $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2cm]{classeo_f}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef R {\bf result\_\-type}\label{classeo_f_w0}
+
+\begin{CompactList}\small\item\em the return type - probably useless .... \item\end{CompactList}\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual {\bf $\sim$eo\-F} ()\label{classeo_f_a0}
+
+\begin{CompactList}\small\item\em virtual dtor here so there is no need to define it in derived classes \item\end{CompactList}\item 
+virtual R {\bf operator()} ()=0\label{classeo_f_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Static Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Functor\-Base::procedure\_\-tag} {\bf functor\_\-category} ()\label{classeo_f_e0}
+
+\begin{CompactList}\small\item\em tag to identify a procedure in compile time function selection functor\_\-category \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class R$>$ class eo\-F$<$ R $>$}
+
+Basic Function. 
+
+Derive from this class when defining any procedure. It defines a result\_\-type that can be used to determine the return type Argument and result types can be any type including void for result\_\-type 
+
+
+
+Definition at line 68 of file eo\-Functor.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Functor.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_f_d_c_file_snapshot.eps b/trunk/paradiseo-eo/doc/latex/classeo_f_d_c_file_snapshot.eps
new file mode 100644
index 000000000..3688f92a5
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_f_d_c_file_snapshot.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 549.451
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 0.91 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoFDCFileSnapshot< EOT >) cw
+(eoFileSnapshot) cw
+(eoMonitor) cw
+(eoF< eoMonitor & >) cw
+(eoFunctorBase) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoFDCFileSnapshot< EOT >) 0 0 box
+ (eoFileSnapshot) 0 1 box
+ (eoMonitor) 0 2 box
+ (eoF< eoMonitor & >) 0 3 box
+ (eoFunctorBase) 0 4 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 0 3 in
+solid
+0 0 3 out
+solid
+1 0 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_f_d_c_file_snapshot.tex b/trunk/paradiseo-eo/doc/latex/classeo_f_d_c_file_snapshot.tex
new file mode 100644
index 000000000..f647dff7a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_f_d_c_file_snapshot.tex
@@ -0,0 +1,55 @@
+\section{eo\-FDCFile\-Snapshot$<$ EOT $>$ Class Template Reference}
+\label{classeo_f_d_c_file_snapshot}\index{eoFDCFileSnapshot@{eoFDCFileSnapshot}}
+Specific class for FDCStat monitoring: As I failed to have FDC stat as an {\bf eo\-Stat}{\rm (p.\,\pageref{classeo_stat})}, this is the trick to put the 2 {\bf eo\-Param}{\rm (p.\,\pageref{classeo_param})}$<$std::vector$<$double$>$ $>$ into a monitor This class does nothing else.  
+
+
+{\tt \#include $<$eo\-FDCStat.h$>$}
+
+Inheritance diagram for eo\-FDCFile\-Snapshot$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=5cm]{classeo_f_d_c_file_snapshot}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-FDCFile\-Snapshot} ({\bf eo\-FDCStat}$<$ {\bf EOT} $>$ \&\_\-FDCstat, std::string \_\-dirname=\char`\"{}tmp\-FDC\char`\"{}, unsigned \_\-frequency=1, std::string \_\-filename=\char`\"{}FDC\char`\"{}, std::string \_\-delim=\char`\"{} \char`\"{})
+\begin{CompactList}\small\item\em Ctor: in addition to the parameters of the ctor of an {\bf eo\-File\-Snapshot}{\rm (p.\,\pageref{classeo_file_snapshot})} we need here an {\bf eo\-FDCStat}{\rm (p.\,\pageref{classeo_f_d_c_stat})}. \item\end{CompactList}\item 
+virtual void {\bf add} (const {\bf eo\-Param} \&\_\-param)\label{classeo_f_d_c_file_snapshot_a1}
+
+\begin{CompactList}\small\item\em just to be sure the add method is not called further \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-FDCStat}$<$ {\bf EOT} $>$ \& {\bf FDCstat}\label{classeo_f_d_c_file_snapshot_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-FDCFile\-Snapshot$<$ EOT $>$}
+
+Specific class for FDCStat monitoring: As I failed to have FDC stat as an {\bf eo\-Stat}{\rm (p.\,\pageref{classeo_stat})}, this is the trick to put the 2 {\bf eo\-Param}{\rm (p.\,\pageref{classeo_param})}$<$std::vector$<$double$>$ $>$ into a monitor This class does nothing else. 
+
+
+
+Definition at line 111 of file eo\-FDCStat.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoFDCFileSnapshot@{eo\-FDCFile\-Snapshot}!eoFDCFileSnapshot@{eoFDCFileSnapshot}}
+\index{eoFDCFileSnapshot@{eoFDCFileSnapshot}!eoFDCFileSnapshot@{eo\-FDCFile\-Snapshot}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-FDCFile\-Snapshot}$<$ {\bf EOT} $>$::{\bf eo\-FDCFile\-Snapshot} ({\bf eo\-FDCStat}$<$ {\bf EOT} $>$ \& {\em \_\-FDCstat}, std::string {\em \_\-dirname} = {\tt \char`\"{}tmpFDC\char`\"{}}, unsigned {\em \_\-frequency} = {\tt 1}, std::string {\em \_\-filename} = {\tt \char`\"{}FDC\char`\"{}}, std::string {\em \_\-delim} = {\tt \char`\"{}\ \char`\"{}})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_f_d_c_file_snapshot_a0}
+
+
+Ctor: in addition to the parameters of the ctor of an {\bf eo\-File\-Snapshot}{\rm (p.\,\pageref{classeo_file_snapshot})} we need here an {\bf eo\-FDCStat}{\rm (p.\,\pageref{classeo_f_d_c_stat})}. 
+
+The 2 std::vectors (distances to optimum and fitnesses) are added to the monitor so they can be processed later to a file - and eventually by gnuplot 
+
+Definition at line 119 of file eo\-FDCStat.h.
+
+References eo\-File\-Snapshot::add().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-FDCStat.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_f_d_c_stat.eps b/trunk/paradiseo-eo/doc/latex/classeo_f_d_c_stat.eps
new file mode 100644
index 000000000..e262b0325
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_f_d_c_stat.eps
@@ -0,0 +1,233 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 112.613
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.44 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoFDCStat< EOT >) cw
+(eoStat< EOT, double >) cw
+(eoValueParam< double >) cw
+(eoStatBase< EOT >) cw
+(eoParam) cw
+(eoUF< const eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoFDCStat< EOT >) 0.5 0 box
+ (eoStat< EOT, double >) 0.5 1 box
+ (eoValueParam< double >) 0 2 box
+ (eoStatBase< EOT >) 1 2 box
+ (eoParam) 0 3 box
+ (eoUF< const eoPop< EOT > &, void >) 1 3 box
+ (eoFunctorBase) 0.5 4 box
+ (unary_function< const eoPop< EOT > &, void >) 1.5 4 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+0 1 3 out
+solid
+0.5 1.5 4 conn
+solid
+1 0.5 4 in
+solid
+1 1.5 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_f_d_c_stat.tex b/trunk/paradiseo-eo/doc/latex/classeo_f_d_c_stat.tex
new file mode 100644
index 000000000..e1d4ec87e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_f_d_c_stat.tex
@@ -0,0 +1,63 @@
+\section{eo\-FDCStat$<$ EOT $>$ Class Template Reference}
+\label{classeo_f_d_c_stat}\index{eoFDCStat@{eoFDCStat}}
+The FDC computation - stores the values into eo\-Value\-Param$<$EOT,double$>$ so they can be snapshot by some eo\-Gnuplot\-Snapshot ...  
+
+
+{\tt \#include $<$eo\-FDCStat.h$>$}
+
+Inheritance diagram for eo\-FDCStat$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.15315cm]{classeo_f_d_c_stat}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-FDCStat} ({\bf eo\-Distance}$<$ {\bf EOT} $>$ \&\_\-dist, std::string \_\-description=\char`\"{}FDC\char`\"{})\label{classeo_f_d_c_stat_a0}
+
+\begin{CompactList}\small\item\em Ctor without the optimum. \item\end{CompactList}\item 
+{\bf eo\-FDCStat} ({\bf eo\-Distance}$<$ {\bf EOT} $>$ \&\_\-dist, {\bf EOT} \&\_\-the\-Best, std::string \_\-description=\char`\"{}FDC\char`\"{})\label{classeo_f_d_c_stat_a1}
+
+\begin{CompactList}\small\item\em Ctor with the optimum. \item\end{CompactList}\item 
+virtual void {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_f_d_c_stat_a2}
+
+\begin{CompactList}\small\item\em Compute the FDC - either from best in pop, or from absolute best if it was passed in the constructor. \item\end{CompactList}\item 
+const {\bf eo\-Value\-Param}$<$ std::vector$<$ double $>$ $>$ \& {\bf the\-Dist} ()\label{classeo_f_d_c_stat_a3}
+
+\begin{CompactList}\small\item\em accessors to the private {\bf eo\-Value\-Param}{\rm (p.\,\pageref{classeo_value_param})}$<$std::vector$<$double$>$ $>$ \item\end{CompactList}\item 
+const {\bf eo\-Value\-Param}$<$ std::vector$<$ double $>$ $>$ \& {\bf the\-Fit} ()\label{classeo_f_d_c_stat_a4}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Distance}$<$ {\bf EOT} $>$ \& {\bf dist}\label{classeo_f_d_c_stat_r0}
+
+\item 
+{\bf EOT} {\bf the\-Best}\label{classeo_f_d_c_stat_r1}
+
+\item 
+bool {\bf bool\-Opt}\label{classeo_f_d_c_stat_r2}
+
+\item 
+{\bf eo\-Value\-Param}$<$ std::vector$<$ double $>$ $>$ {\bf dist\-To\-Best}\label{classeo_f_d_c_stat_r3}
+
+\item 
+{\bf eo\-Value\-Param}$<$ std::vector$<$ double $>$ $>$ {\bf fitnesses}\label{classeo_f_d_c_stat_r4}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-FDCStat$<$ EOT $>$}
+
+The FDC computation - stores the values into eo\-Value\-Param$<$EOT,double$>$ so they can be snapshot by some eo\-Gnuplot\-Snapshot ... 
+
+
+
+Definition at line 39 of file eo\-FDCStat.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-FDCStat.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_factory.eps b/trunk/paradiseo-eo/doc/latex/classeo_factory.eps
new file mode 100644
index 000000000..cb057335d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_factory.eps
@@ -0,0 +1,197 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 264.901
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.8875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 2 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoFactory< EOClass >) cw
+(eoObject) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoFactory< EOClass >) 0 0 box
+ (eoObject) 0 1 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_factory.tex b/trunk/paradiseo-eo/doc/latex/classeo_factory.tex
new file mode 100644
index 000000000..31b2aa956
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_factory.tex
@@ -0,0 +1,65 @@
+\section{eo\-Factory$<$ EOClass $>$ Class Template Reference}
+\label{classeo_factory}\index{eoFactory@{eoFactory}}
+{\bf EO}{\rm (p.\,\pageref{class_e_o})} Factory.  
+
+
+{\tt \#include $<$eo\-Factory.h$>$}
+
+Inheritance diagram for eo\-Factory$<$ EOClass $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2cm]{classeo_factory}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual EOClass $\ast$ {\bf make} (std::istream \&\_\-is)=0
+\begin{CompactList}\small\item\em Another factory methods: creates an object from an std::istream, reading from it whatever is needed to create the object. \item\end{CompactList}\end{CompactItemize}
+\begin{Indent}{\bf ctors and dtors}\par
+\begin{CompactItemize}
+\item 
+{\bf eo\-Factory} ()\label{classeo_factory_z11_0}
+
+\begin{CompactList}\small\item\em constructor \item\end{CompactList}\item 
+virtual {\bf $\sim$eo\-Factory} ()\label{classeo_factory_z11_1}
+
+\begin{CompactList}\small\item\em destructor \item\end{CompactList}\end{CompactItemize}
+\end{Indent}
+\begin{Indent}{\bf eo\-Object methods}\par
+\begin{CompactItemize}
+\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_factory_z13_0}
+
+\begin{CompactList}\small\item\em Return the class id. \item\end{CompactList}\end{CompactItemize}
+\end{Indent}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOClass$>$ class eo\-Factory$<$ EOClass $>$}
+
+{\bf EO}{\rm (p.\,\pageref{class_e_o})} Factory. 
+
+A factory is used to create other objects. In particular, it can be used so that objects of that kind can180t be created in any other way. It should be instantiated with anything that needs a factory, like selectors or whatever; but the instance class should be the parent class from which all the object that are going to be created descend. This class basically defines an interface, as usual. The base factory class for each hierarchy should be redefined every time a new object is added to the hierarchy, which is not too good, but in any case, some code would have to be modified 
+
+
+
+Definition at line 42 of file eo\-Factory.h.
+
+\subsection{Member Function Documentation}
+\index{eoFactory@{eo\-Factory}!make@{make}}
+\index{make@{make}!eoFactory@{eo\-Factory}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOClass$>$ virtual EOClass$\ast$ {\bf eo\-Factory}$<$ EOClass $>$::make (std::istream \& {\em \_\-is})\hspace{0.3cm}{\tt  [pure virtual]}}\label{classeo_factory_a0}
+
+
+Another factory methods: creates an object from an std::istream, reading from it whatever is needed to create the object. 
+
+Usually, the format for the std::istream will be$\backslash$ object\-Type parameter1 parameter2 ... parametern$\backslash$
+
+Implemented in {\bf eo\-Op\-Sel\-Mason$<$ eo\-Class $>$} {\rm (p.\,\pageref{classeo_op_sel_mason_a0})}, {\bf eo\-Select\-Factory$<$ EOT $>$} {\rm (p.\,\pageref{classeo_select_factory_a0})}, and {\bf eo\-Bit\-Op\-Factory$<$ EOT $>$} {\rm (p.\,\pageref{classeo_bit_op_factory_a0})}.
+
+Referenced by eo\-Bit\-Op\-Factory$<$ EOT $>$::make().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Factory.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_file_monitor.eps b/trunk/paradiseo-eo/doc/latex/classeo_file_monitor.eps
new file mode 100644
index 000000000..1029add91
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_file_monitor.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 729.927
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 0.685 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoFileMonitor) cw
+(eoMonitor) cw
+(eoF< eoMonitor & >) cw
+(eoFunctorBase) cw
+(eoGnuplot1DMonitor) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoFileMonitor) 0 1 box
+ (eoMonitor) 0 2 box
+ (eoF< eoMonitor & >) 0 3 box
+ (eoFunctorBase) 0 4 box
+ (eoGnuplot1DMonitor) 0 0 box
+
+% ----- relations -----
+
+solid
+0 0 1 out
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 0 3 in
+solid
+0 0 3 out
+solid
+1 0 4 in
+solid
+1 0 0.25 out
+solid
+0 0 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_file_monitor.tex b/trunk/paradiseo-eo/doc/latex/classeo_file_monitor.tex
new file mode 100644
index 000000000..1bce4a2e3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_file_monitor.tex
@@ -0,0 +1,71 @@
+\section{eo\-File\-Monitor Class Reference}
+\label{classeo_file_monitor}\index{eoFileMonitor@{eoFileMonitor}}
+Prints statistics to file.  
+
+
+{\tt \#include $<$eo\-File\-Monitor.h$>$}
+
+Inheritance diagram for eo\-File\-Monitor::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=5cm]{classeo_file_monitor}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-File\-Monitor} (std::string \_\-filename, std::string \_\-delim=\char`\"{} \char`\"{}, bool \_\-keep=false, bool \_\-header=false)\label{classeo_file_monitor_a0}
+
+\item 
+virtual {\bf eo\-Monitor} \& {\bf operator()} (void)\label{classeo_file_monitor_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\item 
+virtual {\bf eo\-Monitor} \& {\bf operator()} (std::ostream \&os)\label{classeo_file_monitor_a2}
+
+\item 
+void {\bf print\-Header} (void)\label{classeo_file_monitor_a3}
+
+\item 
+virtual void {\bf print\-Header} (std::ostream \&os)\label{classeo_file_monitor_a4}
+
+\item 
+virtual std::string {\bf get\-File\-Name} ()\label{classeo_file_monitor_a5}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+std::string {\bf filename}\label{classeo_file_monitor_r0}
+
+\item 
+std::string {\bf delim}\label{classeo_file_monitor_r1}
+
+\item 
+bool {\bf keep}\label{classeo_file_monitor_r2}
+
+\item 
+bool {\bf header}\label{classeo_file_monitor_r3}
+
+\item 
+bool {\bf firstcall}\label{classeo_file_monitor_r4}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Prints statistics to file. 
+
+Modified the default behavior, so that it erases existing files. Can be modified in the ctor.
+
+\begin{Desc}
+\item[Version:]MS 25/11/00 \end{Desc}
+
+
+
+
+Definition at line 44 of file eo\-File\-Monitor.h.
+
+The documentation for this class was generated from the following files:\begin{CompactItemize}
+\item 
+eo\-File\-Monitor.h\item 
+eo\-File\-Monitor.cpp\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_file_snapshot.eps b/trunk/paradiseo-eo/doc/latex/classeo_file_snapshot.eps
new file mode 100644
index 000000000..ec05aa53f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_file_snapshot.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 274.725
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.82 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoFileSnapshot) cw
+(eoMonitor) cw
+(eoF< eoMonitor & >) cw
+(eoFunctorBase) cw
+(eoFDCFileSnapshot< EOT >) cw
+(eoGnuplot1DSnapshot) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoFileSnapshot) 0.5 1 box
+ (eoMonitor) 0.5 2 box
+ (eoF< eoMonitor & >) 0.5 3 box
+ (eoFunctorBase) 0.5 4 box
+ (eoFDCFileSnapshot< EOT >) 0 0 box
+ (eoGnuplot1DSnapshot) 1 0 box
+
+% ----- relations -----
+
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+1 0.5 3 in
+solid
+0 0.5 3 out
+solid
+1 0.5 4 in
+solid
+1 0.5 0.25 out
+solid
+0 1 1 conn
+solid
+0 0 0.75 in
+solid
+0 1 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_file_snapshot.tex b/trunk/paradiseo-eo/doc/latex/classeo_file_snapshot.tex
new file mode 100644
index 000000000..949af6bac
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_file_snapshot.tex
@@ -0,0 +1,99 @@
+\section{eo\-File\-Snapshot Class Reference}
+\label{classeo_file_snapshot}\index{eoFileSnapshot@{eoFileSnapshot}}
+Prints snapshots of fitnesses to a (new) file every N generations.  
+
+
+{\tt \#include $<$eo\-File\-Snapshot.h$>$}
+
+Inheritance diagram for eo\-File\-Snapshot::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=5cm]{classeo_file_snapshot}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef std::vector$<$ double $>$ {\bf v\-Double}\label{classeo_file_snapshot_w0}
+
+\item 
+typedef {\bf eo\-Value\-Param}$<$ std::vector$<$ double $>$ $>$ {\bf v\-Double\-Param}\label{classeo_file_snapshot_w1}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-File\-Snapshot} (std::string \_\-dirname, unsigned \_\-frequency=1, std::string \_\-filename=\char`\"{}gen\char`\"{}, std::string \_\-delim=\char`\"{} \char`\"{}, unsigned \_\-counter=0, bool \_\-rm\-Files=true)\label{classeo_file_snapshot_a0}
+
+\item 
+virtual bool {\bf has\-Changed} ()\label{classeo_file_snapshot_a1}
+
+\begin{CompactList}\small\item\em accessor: has something changed (for gnuplot subclass) \item\end{CompactList}\item 
+unsigned {\bf get\-Counter} ()\label{classeo_file_snapshot_a2}
+
+\begin{CompactList}\small\item\em accessor to the counter: needed by the gnuplot subclass \item\end{CompactList}\item 
+std::string {\bf get\-File\-Name} ()\label{classeo_file_snapshot_a3}
+
+\begin{CompactList}\small\item\em accessor to the current filename: needed by the gnuplot subclass \item\end{CompactList}\item 
+void {\bf set\-Current\-File\-Name} ()\label{classeo_file_snapshot_a4}
+
+\begin{CompactList}\small\item\em sets the current filename depending on the counter \item\end{CompactList}\item 
+{\bf eo\-Monitor} \& {\bf operator()} (void)\label{classeo_file_snapshot_a5}
+
+\begin{CompactList}\small\item\em The operator(void): opens the std::ostream and calls the write method. \item\end{CompactList}\item 
+{\bf eo\-Monitor} \& {\bf operator()} (std::ostream \&\_\-os)\label{classeo_file_snapshot_a6}
+
+\begin{CompactList}\small\item\em The operator(): write on an std::ostream. \item\end{CompactList}\item 
+virtual const std::string {\bf get\-Dir\-Name} ()\label{classeo_file_snapshot_a7}
+
+\item 
+virtual const std::string {\bf base\-File\-Name} ()\label{classeo_file_snapshot_a8}
+
+\item 
+void {\bf add} (const {\bf eo\-Param} \&\_\-param)\label{classeo_file_snapshot_a9}
+
+\begin{CompactList}\small\item\em add checks whether it is a std::vector of doubles \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+std::string {\bf dirname}\label{classeo_file_snapshot_r0}
+
+\item 
+unsigned {\bf frequency}\label{classeo_file_snapshot_r1}
+
+\item 
+std::string {\bf filename}\label{classeo_file_snapshot_r2}
+
+\item 
+std::string {\bf delim}\label{classeo_file_snapshot_r3}
+
+\item 
+unsigned int {\bf counter}\label{classeo_file_snapshot_r4}
+
+\item 
+std::string {\bf current\-File\-Name}\label{classeo_file_snapshot_r5}
+
+\item 
+bool {\bf bool\-Changed}\label{classeo_file_snapshot_r6}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Prints snapshots of fitnesses to a (new) file every N generations. 
+
+Assumes that the parameters that are passed to the monitor (method add in {\bf eo\-Monitor.h}{\rm (p.\,\pageref{eo_monitor_8h})}) are {\bf eo\-Value\-Param}{\rm (p.\,\pageref{classeo_value_param})}$<$std::vector$<$double$>$ $>$ of same size.
+
+A dir is created and one file per snapshot is created there - so you can later generate a movie!
+
+TODO: The counter is handled internally, but this should be changed so that you can pass e.g. an evalcounter (minor)
+
+I failed to templatize everything so that it can handle {\bf eo\-Param}{\rm (p.\,\pageref{classeo_param})}$<$std::vector$<$T$>$ $>$ for any type T, simply calling their get\-Value method ... 
+
+
+
+Definition at line 53 of file eo\-File\-Snapshot.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-File\-Snapshot.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_fit_continue.eps b/trunk/paradiseo-eo/doc/latex/classeo_fit_continue.eps
new file mode 100644
index 000000000..403f2325a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_fit_continue.eps
@@ -0,0 +1,227 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 90.0901
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.55 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoFitContinue< EOT >) cw
+(eoContinue< EOT >) cw
+(eoUF< const eoPop< EOT > &, bool >) cw
+(eoPersistent) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, bool >) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoFitContinue< EOT >) 1.25 0 box
+ (eoContinue< EOT >) 1.25 1 box
+ (eoUF< const eoPop< EOT > &, bool >) 0.5 2 box
+ (eoPersistent) 2 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< const eoPop< EOT > &, bool >) 1 3 box
+ (eoPrintable) 2 3 box
+
+% ----- relations -----
+
+solid
+0 1.25 0 out
+solid
+1 1.25 1 in
+solid
+0 1.25 1 out
+solid
+0.5 2 2 conn
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 2 2 in
+solid
+0 2 2 out
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+1 2 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_fit_continue.tex b/trunk/paradiseo-eo/doc/latex/classeo_fit_continue.tex
new file mode 100644
index 000000000..d605f636d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_fit_continue.tex
@@ -0,0 +1,68 @@
+\section{eo\-Fit\-Continue$<$ EOT $>$ Class Template Reference}
+\label{classeo_fit_continue}\index{eoFitContinue@{eoFitContinue}}
+Fitness continuation:.  
+
+
+{\tt \#include $<$eo\-Fit\-Continue.h$>$}
+
+Inheritance diagram for eo\-Fit\-Continue$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.52252cm]{classeo_fit_continue}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Fitness {\bf Fitness\-Type}\label{classeo_fit_continue_w0}
+
+\begin{CompactList}\small\item\em Define Fitness. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Fit\-Continue} (const {\bf Fitness\-Type} \_\-maximum)\label{classeo_fit_continue_a0}
+
+\begin{CompactList}\small\item\em Ctor. \item\end{CompactList}\item 
+virtual bool {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)
+\begin{CompactList}\small\item\em Returns false when a fitness criterium is reached. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} (void) const \label{classeo_fit_continue_a2}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf Fitness\-Type} {\bf maximum}\label{classeo_fit_continue_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Fit\-Continue$<$ EOT $>$}
+
+Fitness continuation:. 
+
+Continues until the maximum fitness level is reached. 
+
+
+
+Definition at line 36 of file eo\-Fit\-Continue.h.
+
+\subsection{Member Function Documentation}
+\index{eoFitContinue@{eo\-Fit\-Continue}!operator()@{operator()}}
+\index{operator()@{operator()}!eoFitContinue@{eo\-Fit\-Continue}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ virtual bool {\bf eo\-Fit\-Continue}$<$ {\bf EOT} $>$::operator() (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\em \_\-pop})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_fit_continue_a1}
+
+
+Returns false when a fitness criterium is reached. 
+
+Assumes pop is not sorted! 
+
+Implements {\bf eo\-UF$<$ const eo\-Pop$<$ EOT $>$ \&, bool $>$} {\rm (p.\,\pageref{classeo_u_f_a1})}.
+
+Definition at line 48 of file eo\-Fit\-Continue.h.
+
+References eo\-Pop$<$ EOT $>$::nth\_\-element\_\-fitness().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Fit\-Continue.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_fitness_scaling_select.eps b/trunk/paradiseo-eo/doc/latex/classeo_fitness_scaling_select.eps
new file mode 100644
index 000000000..bf60c2f93
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_fitness_scaling_select.eps
@@ -0,0 +1,227 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 173.41
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.88333 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 6 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoFitnessScalingSelect< EOT >) cw
+(eoRouletteWorthSelect< EOT, double >) cw
+(eoSelectFromWorth< EOT, double >) cw
+(eoSelectOne< EOT >) cw
+(eoUF< const eoPop< EOT > &, const EOT & >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, const EOT & >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoFitnessScalingSelect< EOT >) 0.5 0 box
+ (eoRouletteWorthSelect< EOT, double >) 0.5 1 box
+ (eoSelectFromWorth< EOT, double >) 0.5 2 box
+ (eoSelectOne< EOT >) 0.5 3 box
+ (eoUF< const eoPop< EOT > &, const EOT & >) 0.5 4 box
+ (eoFunctorBase) 0 5 box
+ (unary_function< const eoPop< EOT > &, const EOT & >) 1 5 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+1 0.5 3 in
+solid
+0 0.5 3 out
+solid
+1 0.5 4 in
+solid
+0 0.5 4 out
+solid
+0 1 5 conn
+solid
+1 0 5 in
+solid
+1 1 5 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_fitness_scaling_select.tex b/trunk/paradiseo-eo/doc/latex/classeo_fitness_scaling_select.tex
new file mode 100644
index 000000000..4408edeea
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_fitness_scaling_select.tex
@@ -0,0 +1,55 @@
+\section{eo\-Fitness\-Scaling\-Select$<$ EOT $>$ Class Template Reference}
+\label{classeo_fitness_scaling_select}\index{eoFitnessScalingSelect@{eoFitnessScalingSelect}}
+eo\-Fitness\-Scaling\-Select: select an individual proportional to the linearly scaled fitness that is computed by the private {\bf eo\-Linear\-Fit\-Scaling}{\rm (p.\,\pageref{classeo_linear_fit_scaling})} object  
+
+
+{\tt \#include $<$eo\-Fitness\-Scaling\-Select.h$>$}
+
+Inheritance diagram for eo\-Fitness\-Scaling\-Select$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4.85549cm]{classeo_fitness_scaling_select}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Fitness\-Scaling\-Select} (double \_\-p=2.0)
+\begin{CompactList}\small\item\em Ctor:. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Linear\-Fit\-Scaling}$<$ {\bf EOT} $>$ {\bf scaling}\label{classeo_fitness_scaling_select_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Fitness\-Scaling\-Select$<$ EOT $>$}
+
+eo\-Fitness\-Scaling\-Select: select an individual proportional to the linearly scaled fitness that is computed by the private {\bf eo\-Linear\-Fit\-Scaling}{\rm (p.\,\pageref{classeo_linear_fit_scaling})} object 
+
+
+
+Definition at line 40 of file eo\-Fitness\-Scaling\-Select.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoFitnessScalingSelect@{eo\-Fitness\-Scaling\-Select}!eoFitnessScalingSelect@{eoFitnessScalingSelect}}
+\index{eoFitnessScalingSelect@{eoFitnessScalingSelect}!eoFitnessScalingSelect@{eo\-Fitness\-Scaling\-Select}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Fitness\-Scaling\-Select}$<$ {\bf EOT} $>$::{\bf eo\-Fitness\-Scaling\-Select} (double {\em \_\-p} = {\tt 2.0})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_fitness_scaling_select_a0}
+
+
+Ctor:. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-p}]the selective pressure, should be in [1,2] (2 is the default) \end{description}
+\end{Desc}
+
+
+Definition at line 46 of file eo\-Fitness\-Scaling\-Select.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Fitness\-Scaling\-Select.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_fitness_stat.eps b/trunk/paradiseo-eo/doc/latex/classeo_fitness_stat.eps
new file mode 100644
index 000000000..e2e42c20b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_fitness_stat.eps
@@ -0,0 +1,233 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 91.3242
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.475 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoFitnessStat< EOT, FitT >) cw
+(eoSortedStat< EOT, std::vector< FitT > >) cw
+(eoSortedStatBase< EOT >) cw
+(eoValueParam< std::vector< FitT > >) cw
+(eoUF< const std::vector< const EOT * > &, void >) cw
+(eoParam) cw
+(eoFunctorBase) cw
+(unary_function< const std::vector< const EOT * > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoFitnessStat< EOT, FitT >) 1 0 box
+ (eoSortedStat< EOT, std::vector< FitT > >) 1 1 box
+ (eoSortedStatBase< EOT >) 0.5 2 box
+ (eoValueParam< std::vector< FitT > >) 1.5 2 box
+ (eoUF< const std::vector< const EOT * > &, void >) 0.5 3 box
+ (eoParam) 1.5 3 box
+ (eoFunctorBase) 0 4 box
+ (unary_function< const std::vector< const EOT * > &, void >) 1 4 box
+
+% ----- relations -----
+
+solid
+0 1 0 out
+solid
+1 1 1 in
+solid
+0 1 1 out
+solid
+0.5 1.5 2 conn
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+1 1.5 2 in
+solid
+0 1.5 2 out
+solid
+1 0.5 3 in
+solid
+0 0.5 3 out
+solid
+0 1 4 conn
+solid
+1 1.5 3 in
+solid
+1 0 4 in
+solid
+1 1 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_fitness_stat.tex b/trunk/paradiseo-eo/doc/latex/classeo_fitness_stat.tex
new file mode 100644
index 000000000..282a317c3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_fitness_stat.tex
@@ -0,0 +1,36 @@
+\section{eo\-Fitness\-Stat$<$ EOT, Fit\-T $>$ Class Template Reference}
+\label{classeo_fitness_stat}\index{eoFitnessStat@{eoFitnessStat}}
+The fitnesses of a whole population, as a vector.  
+
+
+{\tt \#include $<$eo\-MOFitness\-Stat.h$>$}
+
+Inheritance diagram for eo\-Fitness\-Stat$<$ EOT, Fit\-T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.55708cm]{classeo_fitness_stat}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Fitness\-Stat} (std::string \_\-description=\char`\"{}All\-Fitnesses\char`\"{})\label{classeo_fitness_stat_a0}
+
+\item 
+virtual void {\bf operator()} (const std::vector$<$ const {\bf EOT} $\ast$ $>$ \&\_\-pop\-Pters)\label{classeo_fitness_stat_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT, class Fit\-T = typename EOT::Fitness$>$ class eo\-Fitness\-Stat$<$ EOT, Fit\-T $>$}
+
+The fitnesses of a whole population, as a vector. 
+
+
+
+Definition at line 36 of file eo\-MOFitness\-Stat.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-MOFitness\-Stat.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_fl_or1pt_bin_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_fl_or1pt_bin_op.eps
new file mode 100644
index 000000000..090857e51
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_fl_or1pt_bin_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 92.9152
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.38125 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoFlOr1ptBinOp< EOT >) cw
+(eoBinOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoBF< EOT &, const EOT &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< EOT &, const EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoFlOr1ptBinOp< EOT >) 0.5 0 box
+ (eoBinOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoBF< EOT &, const EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< EOT &, const EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_fl_or1pt_bin_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_fl_or1pt_bin_op.tex
new file mode 100644
index 000000000..dd625ff07
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_fl_or1pt_bin_op.tex
@@ -0,0 +1,45 @@
+\section{eo\-Fl\-Or1pt\-Bin\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_fl_or1pt_bin_op}\index{eoFlOr1ptBinOp@{eoFlOr1ptBinOp}}
+The 1pt crossover (just in case someone wants it some day!).  
+
+
+{\tt \#include $<$eo\-Fl\-Or\-Bin\-Op.h$>$}
+
+Inheritance diagram for eo\-Fl\-Or1pt\-Bin\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.60163cm]{classeo_fl_or1pt_bin_op}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Atom\-Type {\bf Atom\-Type}\label{classeo_fl_or1pt_bin_op_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Vl\-Uniform\-Bin\-Op} ()\label{classeo_fl_or1pt_bin_op_a0}
+
+\begin{CompactList}\small\item\em default ctor: no argument \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eo1, {\bf EOT} \&\_\-eo2)\label{classeo_fl_or1pt_bin_op_a1}
+
+\begin{CompactList}\small\item\em exchanges first and second parts of the vectors of Atoms \item\end{CompactList}\item 
+virtual string {\bf class\-Name} () const \label{classeo_fl_or1pt_bin_op_a2}
+
+\begin{CompactList}\small\item\em inherited {\bf class\-Name()}{\rm (p.\,\pageref{classeo_fl_or1pt_bin_op_a2})} \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Fl\-Or1pt\-Bin\-Op$<$ EOT $>$}
+
+The 1pt crossover (just in case someone wants it some day!). 
+
+
+
+Definition at line 181 of file eo\-Fl\-Or\-Bin\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Fl\-Or\-Bin\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_fl_or1pt_quad_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_fl_or1pt_quad_op.eps
new file mode 100644
index 000000000..a18d0fa7e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_fl_or1pt_quad_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 105.82
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.725 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoFlOr1ptQuadOp< EOT >) cw
+(eoQuadOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoBF< EOT &, EOT &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< EOT &, EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoFlOr1ptQuadOp< EOT >) 0.5 0 box
+ (eoQuadOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoBF< EOT &, EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< EOT &, EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_fl_or1pt_quad_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_fl_or1pt_quad_op.tex
new file mode 100644
index 000000000..882add8d0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_fl_or1pt_quad_op.tex
@@ -0,0 +1,45 @@
+\section{eo\-Fl\-Or1pt\-Quad\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_fl_or1pt_quad_op}\index{eoFlOr1ptQuadOp@{eoFlOr1ptQuadOp}}
+The 1pt crossover (just in case someone wants it some day!).  
+
+
+{\tt \#include $<$eo\-Fl\-Or\-Quad\-Op.h$>$}
+
+Inheritance diagram for eo\-Fl\-Or1pt\-Quad\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.96296cm]{classeo_fl_or1pt_quad_op}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Atom\-Type {\bf Atom\-Type}\label{classeo_fl_or1pt_quad_op_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Vl\-Uniform\-Quad\-Op} ()\label{classeo_fl_or1pt_quad_op_a0}
+
+\begin{CompactList}\small\item\em default ctor: no argument \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eo1, {\bf EOT} \&\_\-eo2)\label{classeo_fl_or1pt_quad_op_a1}
+
+\begin{CompactList}\small\item\em exchanges first and second parts of the vectors of Atoms \item\end{CompactList}\item 
+virtual string {\bf class\-Name} () const \label{classeo_fl_or1pt_quad_op_a2}
+
+\begin{CompactList}\small\item\em inherited {\bf class\-Name()}{\rm (p.\,\pageref{classeo_fl_or1pt_quad_op_a2})} \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Fl\-Or1pt\-Quad\-Op$<$ EOT $>$}
+
+The 1pt crossover (just in case someone wants it some day!). 
+
+
+
+Definition at line 173 of file eo\-Fl\-Or\-Quad\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Fl\-Or\-Quad\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_fl_or_all_atom_bin_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_all_atom_bin_op.eps
new file mode 100644
index 000000000..fd506a5c6
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_all_atom_bin_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 92.9152
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.38125 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoFlOrAllAtomBinOp< EOT >) cw
+(eoBinOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoBF< EOT &, const EOT &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< EOT &, const EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoFlOrAllAtomBinOp< EOT >) 0.5 0 box
+ (eoBinOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoBF< EOT &, const EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< EOT &, const EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_fl_or_all_atom_bin_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_all_atom_bin_op.tex
new file mode 100644
index 000000000..e7175405f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_all_atom_bin_op.tex
@@ -0,0 +1,54 @@
+\section{eo\-Fl\-Or\-All\-Atom\-Bin\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_fl_or_all_atom_bin_op}\index{eoFlOrAllAtomBinOp@{eoFlOrAllAtomBinOp}}
+Bin Crossover using an Atom Crossover that is applied to a ALL components with given rate.  
+
+
+{\tt \#include $<$eo\-Fl\-Or\-Bin\-Op.h$>$}
+
+Inheritance diagram for eo\-Fl\-Or\-All\-Atom\-Bin\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.60163cm]{classeo_fl_or_all_atom_bin_op}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Atom\-Type {\bf Atom\-Type}\label{classeo_fl_or_all_atom_bin_op_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Fl\-Or\-All\-Atom\-Bin\-Op} ({\bf eo\-Bin\-Op}$<$ Atom\-Type $>$ \&\_\-op, float \_\-rate=1.0)\label{classeo_fl_or_all_atom_bin_op_a0}
+
+\begin{CompactList}\small\item\em default ctor: requires an Atom Bin\-Op \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eo1, const {\bf EOT} \&\_\-eo2)\label{classeo_fl_or_all_atom_bin_op_a1}
+
+\begin{CompactList}\small\item\em applies Atom crossover to ALL components with given rate \item\end{CompactList}\item 
+virtual string {\bf class\-Name} () const \label{classeo_fl_or_all_atom_bin_op_a2}
+
+\begin{CompactList}\small\item\em inherited {\bf class\-Name()}{\rm (p.\,\pageref{classeo_fl_or_all_atom_bin_op_a2})} \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf rate}\label{classeo_fl_or_all_atom_bin_op_r0}
+
+\item 
+{\bf eo\-Bin\-Op}$<$ Atom\-Type $>$ \& {\bf op}\label{classeo_fl_or_all_atom_bin_op_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Fl\-Or\-All\-Atom\-Bin\-Op$<$ EOT $>$}
+
+Bin Crossover using an Atom Crossover that is applied to a ALL components with given rate. 
+
+
+
+Definition at line 49 of file eo\-Fl\-Or\-Bin\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Fl\-Or\-Bin\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_fl_or_all_atom_quad_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_all_atom_quad_op.eps
new file mode 100644
index 000000000..319db7b6b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_all_atom_quad_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 105.82
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.725 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoFlOrAllAtomQuadOp< EOT >) cw
+(eoQuadOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoBF< EOT &, EOT &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< EOT &, EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoFlOrAllAtomQuadOp< EOT >) 0.5 0 box
+ (eoQuadOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoBF< EOT &, EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< EOT &, EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_fl_or_all_atom_quad_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_all_atom_quad_op.tex
new file mode 100644
index 000000000..fd71ec8ba
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_all_atom_quad_op.tex
@@ -0,0 +1,54 @@
+\section{eo\-Fl\-Or\-All\-Atom\-Quad\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_fl_or_all_atom_quad_op}\index{eoFlOrAllAtomQuadOp@{eoFlOrAllAtomQuadOp}}
+Quad Crossover using an Atom Crossover.  
+
+
+{\tt \#include $<$eo\-Fl\-Or\-Quad\-Op.h$>$}
+
+Inheritance diagram for eo\-Fl\-Or\-All\-Atom\-Quad\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.96296cm]{classeo_fl_or_all_atom_quad_op}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Atom\-Type {\bf Atom\-Type}\label{classeo_fl_or_all_atom_quad_op_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Fl\-Or\-All\-Atom\-Quad\-Op} ({\bf eo\-Quad\-Op}$<$ Atom\-Type $>$ \&\_\-op, double \_\-rate=1)\label{classeo_fl_or_all_atom_quad_op_a0}
+
+\begin{CompactList}\small\item\em default ctor: requires an Atom Quad\-Op \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eo1, {\bf EOT} \&\_\-eo2)\label{classeo_fl_or_all_atom_quad_op_a1}
+
+\begin{CompactList}\small\item\em applies Atom crossover to ALL components with given rate \item\end{CompactList}\item 
+virtual string {\bf class\-Name} () const \label{classeo_fl_or_all_atom_quad_op_a2}
+
+\begin{CompactList}\small\item\em inherited {\bf class\-Name()}{\rm (p.\,\pageref{classeo_fl_or_all_atom_quad_op_a2})} \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf rate}\label{classeo_fl_or_all_atom_quad_op_r0}
+
+\item 
+{\bf eo\-Quad\-Op}$<$ Atom\-Type $>$ \& {\bf op}\label{classeo_fl_or_all_atom_quad_op_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Fl\-Or\-All\-Atom\-Quad\-Op$<$ EOT $>$}
+
+Quad Crossover using an Atom Crossover. 
+
+
+
+Definition at line 46 of file eo\-Fl\-Or\-Quad\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Fl\-Or\-Quad\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_fl_or_all_mutation.eps b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_all_mutation.eps
new file mode 100644
index 000000000..58fa6e122
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_all_mutation.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 132.67
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.76875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoFlOrAllMutation< EOT >) cw
+(eoMonOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoUF< EOT &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoFlOrAllMutation< EOT >) 0.5 0 box
+ (eoMonOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoUF< EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_fl_or_all_mutation.tex b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_all_mutation.tex
new file mode 100644
index 000000000..255f811ab
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_all_mutation.tex
@@ -0,0 +1,54 @@
+\section{eo\-Fl\-Or\-All\-Mutation$<$ EOT $>$ Class Template Reference}
+\label{classeo_fl_or_all_mutation}\index{eoFlOrAllMutation@{eoFlOrAllMutation}}
+applies an atomic mutation to all the components with a given rate  
+
+
+{\tt \#include $<$eo\-Fl\-Or\-Mon\-Op.h$>$}
+
+Inheritance diagram for eo\-Fl\-Or\-All\-Mutation$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.71476cm]{classeo_fl_or_all_mutation}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Atom\-Type {\bf Atom\-Type}\label{classeo_fl_or_all_mutation_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Fl\-Or\-All\-Mutation} ({\bf eo\-Mon\-Op}$<$ Atom\-Type $>$ \&\_\-atom\-Mutation, double \_\-rate=1.0)\label{classeo_fl_or_all_mutation_a0}
+
+\begin{CompactList}\small\item\em default ctor: requires an Atom mutation and a rate \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eo)\label{classeo_fl_or_all_mutation_a1}
+
+\begin{CompactList}\small\item\em applies the atom mutation to all components with given rate \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_fl_or_all_mutation_a2}
+
+\begin{CompactList}\small\item\em inherited {\bf class\-Name()}{\rm (p.\,\pageref{classeo_fl_or_all_mutation_a2})} \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Mon\-Op}$<$ Atom\-Type $>$ \& {\bf atom\-Mutation}\label{classeo_fl_or_all_mutation_r0}
+
+\item 
+double {\bf rate}\label{classeo_fl_or_all_mutation_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Fl\-Or\-All\-Mutation$<$ EOT $>$}
+
+applies an atomic mutation to all the components with a given rate 
+
+
+
+Definition at line 45 of file eo\-Fl\-Or\-Mon\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Fl\-Or\-Mon\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_fl_or_k_atom_bin_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_k_atom_bin_op.eps
new file mode 100644
index 000000000..b8ce1be52
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_k_atom_bin_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 92.9152
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.38125 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoFlOrKAtomBinOp< EOT >) cw
+(eoBinOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoBF< EOT &, const EOT &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< EOT &, const EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoFlOrKAtomBinOp< EOT >) 0.5 0 box
+ (eoBinOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoBF< EOT &, const EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< EOT &, const EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_fl_or_k_atom_bin_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_k_atom_bin_op.tex
new file mode 100644
index 000000000..d97ed3832
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_k_atom_bin_op.tex
@@ -0,0 +1,54 @@
+\section{eo\-Fl\-Or\-KAtom\-Bin\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_fl_or_k_atom_bin_op}\index{eoFlOrKAtomBinOp@{eoFlOrKAtomBinOp}}
+Bin Crossover using an Atom Crossover that is applied to a FIXED NB of components.  
+
+
+{\tt \#include $<$eo\-Fl\-Or\-Bin\-Op.h$>$}
+
+Inheritance diagram for eo\-Fl\-Or\-KAtom\-Bin\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.60163cm]{classeo_fl_or_k_atom_bin_op}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Atom\-Type {\bf Atom\-Type}\label{classeo_fl_or_k_atom_bin_op_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Fl\-Or\-Atom\-Bin\-Op} ({\bf eo\-Bin\-Op}$<$ Atom\-Type $>$ \&\_\-op, unsigned \_\-k=1)\label{classeo_fl_or_k_atom_bin_op_a0}
+
+\begin{CompactList}\small\item\em default ctor: requires an Atom Bin\-Op and an unsigned \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eo1, const {\bf EOT} \&\_\-eo2)\label{classeo_fl_or_k_atom_bin_op_a1}
+
+\begin{CompactList}\small\item\em applies the Atom Bin\-Op to some components \item\end{CompactList}\item 
+virtual string {\bf class\-Name} () const \label{classeo_fl_or_k_atom_bin_op_a2}
+
+\begin{CompactList}\small\item\em inherited {\bf class\-Name()}{\rm (p.\,\pageref{classeo_fl_or_k_atom_bin_op_a2})} \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf k}\label{classeo_fl_or_k_atom_bin_op_r0}
+
+\item 
+{\bf eo\-Bin\-Op}$<$ Atom\-Type $>$ \& {\bf op}\label{classeo_fl_or_k_atom_bin_op_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Fl\-Or\-KAtom\-Bin\-Op$<$ EOT $>$}
+
+Bin Crossover using an Atom Crossover that is applied to a FIXED NB of components. 
+
+
+
+Definition at line 92 of file eo\-Fl\-Or\-Bin\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Fl\-Or\-Bin\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_fl_or_k_atom_quad_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_k_atom_quad_op.eps
new file mode 100644
index 000000000..47149650c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_k_atom_quad_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 105.82
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.725 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoFlOrKAtomQuadOp< EOT >) cw
+(eoQuadOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoBF< EOT &, EOT &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< EOT &, EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoFlOrKAtomQuadOp< EOT >) 0.5 0 box
+ (eoQuadOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoBF< EOT &, EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< EOT &, EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_fl_or_k_atom_quad_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_k_atom_quad_op.tex
new file mode 100644
index 000000000..238670b64
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_k_atom_quad_op.tex
@@ -0,0 +1,54 @@
+\section{eo\-Fl\-Or\-KAtom\-Quad\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_fl_or_k_atom_quad_op}\index{eoFlOrKAtomQuadOp@{eoFlOrKAtomQuadOp}}
+Quad Crossover using an Atom Crossover that is applied to a FIXED NB of components.  
+
+
+{\tt \#include $<$eo\-Fl\-Or\-Quad\-Op.h$>$}
+
+Inheritance diagram for eo\-Fl\-Or\-KAtom\-Quad\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.96296cm]{classeo_fl_or_k_atom_quad_op}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Atom\-Type {\bf Atom\-Type}\label{classeo_fl_or_k_atom_quad_op_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Fl\-Or\-Atom\-Quad\-Op} ({\bf eo\-Quad\-Op}$<$ Atom\-Type $>$ \&\_\-op, unsigned \_\-k=1)\label{classeo_fl_or_k_atom_quad_op_a0}
+
+\begin{CompactList}\small\item\em default ctor: requires an Atom Quad\-Op and an unsigned \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eo1, const {\bf EOT} \&\_\-eo2)\label{classeo_fl_or_k_atom_quad_op_a1}
+
+\begin{CompactList}\small\item\em applies the Atom Quad\-Op to some components \item\end{CompactList}\item 
+virtual string {\bf class\-Name} () const \label{classeo_fl_or_k_atom_quad_op_a2}
+
+\begin{CompactList}\small\item\em inherited {\bf class\-Name()}{\rm (p.\,\pageref{classeo_fl_or_k_atom_quad_op_a2})} \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf k}\label{classeo_fl_or_k_atom_quad_op_r0}
+
+\item 
+{\bf eo\-Quad\-Op}$<$ Atom\-Type $>$ \& {\bf op}\label{classeo_fl_or_k_atom_quad_op_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Fl\-Or\-KAtom\-Quad\-Op$<$ EOT $>$}
+
+Quad Crossover using an Atom Crossover that is applied to a FIXED NB of components. 
+
+
+
+Definition at line 84 of file eo\-Fl\-Or\-Quad\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Fl\-Or\-Quad\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_fl_or_k_mutation.eps b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_k_mutation.eps
new file mode 100644
index 000000000..c233db3e2
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_k_mutation.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 132.67
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.76875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoFlOrKMutation< EOT >) cw
+(eoMonOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoUF< EOT &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoFlOrKMutation< EOT >) 0.5 0 box
+ (eoMonOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoUF< EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_fl_or_k_mutation.tex b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_k_mutation.tex
new file mode 100644
index 000000000..177fc98c4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_k_mutation.tex
@@ -0,0 +1,54 @@
+\section{eo\-Fl\-Or\-KMutation$<$ EOT $>$ Class Template Reference}
+\label{classeo_fl_or_k_mutation}\index{eoFlOrKMutation@{eoFlOrKMutation}}
+Applies an atomic mutation to a fixed number of components (1 by default).  
+
+
+{\tt \#include $<$eo\-Fl\-Or\-Mon\-Op.h$>$}
+
+Inheritance diagram for eo\-Fl\-Or\-KMutation$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.71476cm]{classeo_fl_or_k_mutation}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Atom\-Type {\bf Atom\-Type}\label{classeo_fl_or_k_mutation_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Fl\-Or\-KMutation} ({\bf eo\-Mon\-Op}$<$ Atom\-Type $>$ \&\_\-atom\-Mutation, unsigned \_\-nb=1)\label{classeo_fl_or_k_mutation_a0}
+
+\begin{CompactList}\small\item\em default ctor: requires an Atom mutation \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eo)\label{classeo_fl_or_k_mutation_a1}
+
+\begin{CompactList}\small\item\em applies the atom mutation to K randomly selected components \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_fl_or_k_mutation_a2}
+
+\begin{CompactList}\small\item\em inherited {\bf class\-Name()}{\rm (p.\,\pageref{classeo_fl_or_k_mutation_a2})} \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf nb}\label{classeo_fl_or_k_mutation_r0}
+
+\item 
+{\bf eo\-Mon\-Op}$<$ Atom\-Type $>$ \& {\bf atom\-Mutation}\label{classeo_fl_or_k_mutation_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Fl\-Or\-KMutation$<$ EOT $>$}
+
+Applies an atomic mutation to a fixed number of components (1 by default). 
+
+
+
+Definition at line 82 of file eo\-Fl\-Or\-Mon\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Fl\-Or\-Mon\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_fl_or_uniform_bin_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_uniform_bin_op.eps
new file mode 100644
index 000000000..e1a56b908
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_uniform_bin_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 92.9152
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.38125 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoFlOrUniformBinOp< EOT >) cw
+(eoBinOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoBF< EOT &, const EOT &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< EOT &, const EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoFlOrUniformBinOp< EOT >) 0.5 0 box
+ (eoBinOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoBF< EOT &, const EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< EOT &, const EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_fl_or_uniform_bin_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_uniform_bin_op.tex
new file mode 100644
index 000000000..c7cf459db
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_uniform_bin_op.tex
@@ -0,0 +1,51 @@
+\section{eo\-Fl\-Or\-Uniform\-Bin\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_fl_or_uniform_bin_op}\index{eoFlOrUniformBinOp@{eoFlOrUniformBinOp}}
+The uniform crossover - exchanges atoms uniformly !  
+
+
+{\tt \#include $<$eo\-Fl\-Or\-Bin\-Op.h$>$}
+
+Inheritance diagram for eo\-Fl\-Or\-Uniform\-Bin\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.60163cm]{classeo_fl_or_uniform_bin_op}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Atom\-Type {\bf Atom\-Type}\label{classeo_fl_or_uniform_bin_op_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Fl\-Or\-Uniform\-Bin\-Op} (double \_\-rate=0.5)\label{classeo_fl_or_uniform_bin_op_a0}
+
+\begin{CompactList}\small\item\em default ctor: requires a rate - 0.5 by default \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eo1, const {\bf EOT} \&\_\-eo2)\label{classeo_fl_or_uniform_bin_op_a1}
+
+\begin{CompactList}\small\item\em excahnges atoms at given rate \item\end{CompactList}\item 
+virtual string {\bf class\-Name} () const \label{classeo_fl_or_uniform_bin_op_a2}
+
+\begin{CompactList}\small\item\em inherited {\bf class\-Name()}{\rm (p.\,\pageref{classeo_fl_or_uniform_bin_op_a2})} \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf rate}\label{classeo_fl_or_uniform_bin_op_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Fl\-Or\-Uniform\-Bin\-Op$<$ EOT $>$}
+
+The uniform crossover - exchanges atoms uniformly ! 
+
+
+
+Definition at line 136 of file eo\-Fl\-Or\-Bin\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Fl\-Or\-Bin\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_fl_or_uniform_quad_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_uniform_quad_op.eps
new file mode 100644
index 000000000..31e6d2cbd
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_uniform_quad_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 105.82
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.725 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoFlOrUniformQuadOp< EOT >) cw
+(eoQuadOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoBF< EOT &, EOT &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< EOT &, EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoFlOrUniformQuadOp< EOT >) 0.5 0 box
+ (eoQuadOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoBF< EOT &, EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< EOT &, EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_fl_or_uniform_quad_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_uniform_quad_op.tex
new file mode 100644
index 000000000..32d31c162
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_fl_or_uniform_quad_op.tex
@@ -0,0 +1,51 @@
+\section{eo\-Fl\-Or\-Uniform\-Quad\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_fl_or_uniform_quad_op}\index{eoFlOrUniformQuadOp@{eoFlOrUniformQuadOp}}
+The uniform crossover - exchanges atoms uniformly !  
+
+
+{\tt \#include $<$eo\-Fl\-Or\-Quad\-Op.h$>$}
+
+Inheritance diagram for eo\-Fl\-Or\-Uniform\-Quad\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.96296cm]{classeo_fl_or_uniform_quad_op}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Atom\-Type {\bf Atom\-Type}\label{classeo_fl_or_uniform_quad_op_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Vl\-Uniform\-Quad\-Op} (double \_\-rate=0.5)\label{classeo_fl_or_uniform_quad_op_a0}
+
+\begin{CompactList}\small\item\em default ctor: requires a rate - 0.5 by default \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eo1, {\bf EOT} \&\_\-eo2)\label{classeo_fl_or_uniform_quad_op_a1}
+
+\begin{CompactList}\small\item\em excahnges atoms at given rate \item\end{CompactList}\item 
+virtual string {\bf class\-Name} () const \label{classeo_fl_or_uniform_quad_op_a2}
+
+\begin{CompactList}\small\item\em inherited {\bf class\-Name()}{\rm (p.\,\pageref{classeo_fl_or_uniform_quad_op_a2})} \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf rate}\label{classeo_fl_or_uniform_quad_op_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Fl\-Or\-Uniform\-Quad\-Op$<$ EOT $>$}
+
+The uniform crossover - exchanges atoms uniformly ! 
+
+
+
+Definition at line 127 of file eo\-Fl\-Or\-Quad\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Fl\-Or\-Quad\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_functor_base.eps b/trunk/paradiseo-eo/doc/latex/classeo_functor_base.eps
new file mode 100644
index 000000000..505a1e213
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_functor_base.eps
@@ -0,0 +1,558 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 1260.65
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 0.396622 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 74 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoFunctorBase) cw
+(eoBF< A1, A2, R >) cw
+(eoBF< Chrom &, Chrom &, bool >) cw
+(eoBF< const Dummy &, const Dummy &, double >) cw
+(eoBF< const eoPop< Chrom > &, eoPop< Chrom > &, void >) cw
+(eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoBF< const eoPop< eoVector< FitT, double > > &, eoPop< eoVector< FitT, double > > &, void >) cw
+(eoBF< const EOT &, const EOT &, double >) cw
+(eoBF< double &, const double &, bool >) cw
+(eoBF< eoDistribution< EOT > &, eoPop< EOT > &, void >) cw
+(eoBF< eoParseTree< FType, Node > &, eoParseTree< FType, Node > &, bool >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoBF< eoPop< EOT > &, unsigned, void >) cw
+(eoBF< eoPop< EoType > &, eoPop< EoType > &, void >) cw
+(eoBF< eoPop< PyEO > &, unsigned, void >) cw
+(eoBF< EOT &, const EOT &, bool >) cw
+(eoBF< EOT &, EOT &, bool >) cw
+(eoBF< EOType &, const EOType &, bool >) cw
+(eoBF< EoType &, const EoType &, bool >) cw
+(eoBF< EoType &, EoType &, bool >) cw
+(eoBF< EOType &, EOType &, bool >) cw
+(eoBF< eoVirus< FitT > &, const eoVirus< FitT > &, bool >) cw
+(eoBF< ExternalEO &, const ExternalEO &, bool >) cw
+(eoBF< ExternalEO &, ExternalEO &, bool >) cw
+(eoBF< GenotypeT &, GenotypeT &, bool >) cw
+(eoBF< PyEO &, const PyEO &, bool >) cw
+(eoBF< PyEO &, PyEO &, bool >) cw
+(eoBF< unsigned, Atom &, bool >) cw
+(eoF< R >) cw
+(eoF< bool >) cw
+(eoF< eoMonitor & >) cw
+(eoF< EOT >) cw
+(eoF< int >) cw
+(eoF< T >) cw
+(eoF< void >) cw
+(eoUF< A1, R >) cw
+(eoUF< bool &, bool >) cw
+(eoUF< bool &, void >) cw
+(eoUF< Chrom &, bool >) cw
+(eoUF< Chrom &, void >) cw
+(eoUF< const eoPop< EOT > &, bool >) cw
+(eoUF< const eoPop< EOT > &, const EOT & >) cw
+(eoUF< const eoPop< EOT > &, void >) cw
+(eoUF< const eoPop< EoType > &, void >) cw
+(eoUF< const eoPop< PyEO > &, const PyEO & >) cw
+(eoUF< const eoPop< PyEO > &, void >) cw
+(eoUF< const std::vector< const EOT * > &, void >) cw
+(eoUF< const std::vector< const EoType * > &, void >) cw
+(eoUF< const std::vector< const PyEO * > &, void >) cw
+(eoUF< eoDistribution< EOT > &, void >) cw
+(eoUF< eoDouble &, bool >) cw
+(eoUF< eoDouble &, void >) cw
+(eoUF< eoParseTree< FitnessType, Node > &, void >) cw
+(eoUF< eoParseTree< FType, Node > &, bool >) cw
+(eoUF< eoParseTree< FType, Node > &, void >) cw
+(eoUF< eoPop< EOT > &, void >) cw
+(eoUF< eoPopulator< EOT > &, void >) cw
+(eoUF< eoPopulator< PyEO > &, void >) cw
+(eoUF< EOT &, bool >) cw
+(eoUF< EOT &, unsigned int >) cw
+(eoUF< EOT &, void >) cw
+(eoUF< EoType &, bool >) cw
+(eoUF< EOType &, bool >) cw
+(eoUF< EoType &, void >) cw
+(eoUF< eoVector< FitT, double > &, void >) cw
+(eoUF< eoVirus< FitT > &, bool >) cw
+(eoUF< eoVirus< FitT > &, void >) cw
+(eoUF< ExternalEO &, bool >) cw
+(eoUF< ExternalEO &, void >) cw
+(eoUF< GenotypeT &, bool >) cw
+(eoUF< GenotypeT &, void >) cw
+(eoUF< int &, void >) cw
+(eoUF< PyEO &, bool >) cw
+(eoUF< T &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoFunctorBase) 0 73 box
+ (eoBF< A1, A2, R >) 1 72 box
+ (eoBF< Chrom &, Chrom &, bool >) 1 71 box
+1 71 mark
+ (eoBF< const Dummy &, const Dummy &, double >) 1 70 box
+1 70 mark
+ (eoBF< const eoPop< Chrom > &, eoPop< Chrom > &, void >) 1 69 box
+1 69 mark
+ (eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) 1 68 box
+1 68 mark
+ (eoBF< const eoPop< eoVector< FitT, double > > &, eoPop< eoVector< FitT, double > > &, void >) 1 67 box
+1 67 mark
+ (eoBF< const EOT &, const EOT &, double >) 1 66 box
+1 66 mark
+ (eoBF< double &, const double &, bool >) 1 65 box
+1 65 mark
+ (eoBF< eoDistribution< EOT > &, eoPop< EOT > &, void >) 1 64 box
+1 64 mark
+ (eoBF< eoParseTree< FType, Node > &, eoParseTree< FType, Node > &, bool >) 1 63 box
+1 63 mark
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 1 62 box
+1 62 mark
+ (eoBF< eoPop< EOT > &, unsigned, void >) 1 61 box
+1 61 mark
+ (eoBF< eoPop< EoType > &, eoPop< EoType > &, void >) 1 60 box
+1 60 mark
+ (eoBF< eoPop< PyEO > &, unsigned, void >) 1 59 box
+1 59 mark
+ (eoBF< EOT &, const EOT &, bool >) 1 58 box
+1 58 mark
+ (eoBF< EOT &, EOT &, bool >) 1 57 box
+1 57 mark
+ (eoBF< EOType &, const EOType &, bool >) 1 56 box
+1 56 mark
+ (eoBF< EoType &, const EoType &, bool >) 1 55 box
+1 55 mark
+ (eoBF< EoType &, EoType &, bool >) 1 54 box
+1 54 mark
+ (eoBF< EOType &, EOType &, bool >) 1 53 box
+1 53 mark
+ (eoBF< eoVirus< FitT > &, const eoVirus< FitT > &, bool >) 1 52 box
+1 52 mark
+ (eoBF< ExternalEO &, const ExternalEO &, bool >) 1 51 box
+1 51 mark
+ (eoBF< ExternalEO &, ExternalEO &, bool >) 1 50 box
+1 50 mark
+ (eoBF< GenotypeT &, GenotypeT &, bool >) 1 49 box
+1 49 mark
+ (eoBF< PyEO &, const PyEO &, bool >) 1 48 box
+1 48 mark
+ (eoBF< PyEO &, PyEO &, bool >) 1 47 box
+1 47 mark
+ (eoBF< unsigned, Atom &, bool >) 1 46 box
+1 46 mark
+ (eoF< R >) 1 45 box
+ (eoF< bool >) 1 44 box
+1 44 mark
+ (eoF< eoMonitor & >) 1 43 box
+1 43 mark
+ (eoF< EOT >) 1 42 box
+1 42 mark
+ (eoF< int >) 1 41 box
+1 41 mark
+ (eoF< T >) 1 40 box
+1 40 mark
+ (eoF< void >) 1 39 box
+1 39 mark
+ (eoUF< A1, R >) 1 38 box
+1 38 mark
+ (eoUF< bool &, bool >) 1 37 box
+1 37 mark
+ (eoUF< bool &, void >) 1 36 box
+1 36 mark
+ (eoUF< Chrom &, bool >) 1 35 box
+1 35 mark
+ (eoUF< Chrom &, void >) 1 34 box
+1 34 mark
+ (eoUF< const eoPop< EOT > &, bool >) 1 33 box
+1 33 mark
+ (eoUF< const eoPop< EOT > &, const EOT & >) 1 32 box
+1 32 mark
+ (eoUF< const eoPop< EOT > &, void >) 1 31 box
+1 31 mark
+ (eoUF< const eoPop< EoType > &, void >) 1 30 box
+1 30 mark
+ (eoUF< const eoPop< PyEO > &, const PyEO & >) 1 29 box
+1 29 mark
+ (eoUF< const eoPop< PyEO > &, void >) 1 28 box
+1 28 mark
+ (eoUF< const std::vector< const EOT * > &, void >) 1 27 box
+1 27 mark
+ (eoUF< const std::vector< const EoType * > &, void >) 1 26 box
+1 26 mark
+ (eoUF< const std::vector< const PyEO * > &, void >) 1 25 box
+1 25 mark
+ (eoUF< eoDistribution< EOT > &, void >) 1 24 box
+1 24 mark
+ (eoUF< eoDouble &, bool >) 1 23 box
+1 23 mark
+ (eoUF< eoDouble &, void >) 1 22 box
+1 22 mark
+ (eoUF< eoParseTree< FitnessType, Node > &, void >) 1 21 box
+1 21 mark
+ (eoUF< eoParseTree< FType, Node > &, bool >) 1 20 box
+1 20 mark
+ (eoUF< eoParseTree< FType, Node > &, void >) 1 19 box
+1 19 mark
+ (eoUF< eoPop< EOT > &, void >) 1 18 box
+1 18 mark
+ (eoUF< eoPopulator< EOT > &, void >) 1 17 box
+1 17 mark
+ (eoUF< eoPopulator< PyEO > &, void >) 1 16 box
+1 16 mark
+ (eoUF< EOT &, bool >) 1 15 box
+1 15 mark
+ (eoUF< EOT &, unsigned int >) 1 14 box
+1 14 mark
+ (eoUF< EOT &, void >) 1 13 box
+1 13 mark
+ (eoUF< EoType &, bool >) 1 12 box
+1 12 mark
+ (eoUF< EOType &, bool >) 1 11 box
+1 11 mark
+ (eoUF< EoType &, void >) 1 10 box
+1 10 mark
+ (eoUF< eoVector< FitT, double > &, void >) 1 9 box
+1 9 mark
+ (eoUF< eoVirus< FitT > &, bool >) 1 8 box
+1 8 mark
+ (eoUF< eoVirus< FitT > &, void >) 1 7 box
+1 7 mark
+ (eoUF< ExternalEO &, bool >) 1 6 box
+1 6 mark
+ (eoUF< ExternalEO &, void >) 1 5 box
+1 5 mark
+ (eoUF< GenotypeT &, bool >) 1 4 box
+1 4 mark
+ (eoUF< GenotypeT &, void >) 1 3 box
+1 3 mark
+ (eoUF< int &, void >) 1 2 box
+1 2 mark
+ (eoUF< PyEO &, bool >) 1 1 box
+1 1 mark
+ (eoUF< T &, void >) 1 0 box
+1 0 mark
+
+% ----- relations -----
+
+solid
+1 0 72.25 out
+solid
+0 0 72.5 hedge
+solid
+0 0 71.5 hedge
+solid
+0 0 70.5 hedge
+solid
+0 0 69.5 hedge
+solid
+0 0 68.5 hedge
+solid
+0 0 67.5 hedge
+solid
+0 0 66.5 hedge
+solid
+0 0 65.5 hedge
+solid
+0 0 64.5 hedge
+solid
+0 0 63.5 hedge
+solid
+0 0 62.5 hedge
+solid
+0 0 61.5 hedge
+solid
+0 0 60.5 hedge
+solid
+0 0 59.5 hedge
+solid
+0 0 58.5 hedge
+solid
+0 0 57.5 hedge
+solid
+0 0 56.5 hedge
+solid
+0 0 55.5 hedge
+solid
+0 0 54.5 hedge
+solid
+0 0 53.5 hedge
+solid
+0 0 52.5 hedge
+solid
+0 0 51.5 hedge
+solid
+0 0 50.5 hedge
+solid
+0 0 49.5 hedge
+solid
+0 0 48.5 hedge
+solid
+0 0 47.5 hedge
+solid
+0 0 46.5 hedge
+solid
+0 0 45.5 hedge
+solid
+0 0 44.5 hedge
+solid
+0 0 43.5 hedge
+solid
+0 0 42.5 hedge
+solid
+0 0 41.5 hedge
+solid
+0 0 40.5 hedge
+solid
+0 0 39.5 hedge
+solid
+0 0 38.5 hedge
+solid
+0 0 37.5 hedge
+solid
+0 0 36.5 hedge
+solid
+0 0 35.5 hedge
+solid
+0 0 34.5 hedge
+solid
+0 0 33.5 hedge
+solid
+0 0 32.5 hedge
+solid
+0 0 31.5 hedge
+solid
+0 0 30.5 hedge
+solid
+0 0 29.5 hedge
+solid
+0 0 28.5 hedge
+solid
+0 0 27.5 hedge
+solid
+0 0 26.5 hedge
+solid
+0 0 25.5 hedge
+solid
+0 0 24.5 hedge
+solid
+0 0 23.5 hedge
+solid
+0 0 22.5 hedge
+solid
+0 0 21.5 hedge
+solid
+0 0 20.5 hedge
+solid
+0 0 19.5 hedge
+solid
+0 0 18.5 hedge
+solid
+0 0 17.5 hedge
+solid
+0 0 16.5 hedge
+solid
+0 0 15.5 hedge
+solid
+0 0 14.5 hedge
+solid
+0 0 13.5 hedge
+solid
+0 0 12.5 hedge
+solid
+0 0 11.5 hedge
+solid
+0 0 10.5 hedge
+solid
+0 0 9.5 hedge
+solid
+0 0 8.5 hedge
+solid
+0 0 7.5 hedge
+solid
+0 0 6.5 hedge
+solid
+0 0 5.5 hedge
+solid
+0 0 4.5 hedge
+solid
+0 0 3.5 hedge
+solid
+0 0 2.5 hedge
+solid
+0 0 1.5 hedge
+solid
+0 0 0.5 hedge
+solid
+0 73 0.5 vedge
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_functor_base.tex b/trunk/paradiseo-eo/doc/latex/classeo_functor_base.tex
new file mode 100644
index 000000000..503bc15d1
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_functor_base.tex
@@ -0,0 +1,39 @@
+\section{eo\-Functor\-Base Class Reference}
+\label{classeo_functor_base}\index{eoFunctorBase@{eoFunctorBase}}
+Base class for functors to get a nice hierarchy diagram.  
+
+
+{\tt \#include $<$eo\-Functor.h$>$}
+
+Inheritance diagram for eo\-Functor\-Base::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=12cm]{classeo_functor_base}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual {\bf $\sim$eo\-Functor\-Base} ()\label{classeo_functor_base_a0}
+
+\begin{CompactList}\small\item\em virtual dtor here so there is no need to define it in derived classes \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Base class for functors to get a nice hierarchy diagram. 
+
+That's actually quite an understatement as it does quite a bit more than just that. By having all functors derive from the same base class, we can do some memory management that would otherwise be very hard.
+
+The memory management base class is called {\bf eo\-Functor\-Store}{\rm (p.\,\pageref{classeo_functor_store})}, and it supports a member add() to add a pointer to a functor. When the functor\-Store is destroyed, it will delete all those pointers. So beware: do not delete the functor\-Store before you are done with anything that might have been allocated.
+
+\begin{Desc}
+\item[See also:]{\bf eo\-Functor\-Store}{\rm (p.\,\pageref{classeo_functor_store})} \end{Desc}
+
+
+
+
+Definition at line 46 of file eo\-Functor.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Functor.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_functor_store.eps b/trunk/paradiseo-eo/doc/latex/classeo_functor_store.eps
new file mode 100644
index 000000000..523dc4081
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_functor_store.eps
@@ -0,0 +1,197 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 370.37
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.35 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 2 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoFunctorStore) cw
+(eoState) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoFunctorStore) 0 1 box
+ (eoState) 0 0 box
+
+% ----- relations -----
+
+solid
+1 0 0.25 out
+solid
+0 0 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_functor_store.tex b/trunk/paradiseo-eo/doc/latex/classeo_functor_store.tex
new file mode 100644
index 000000000..05474e5b7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_functor_store.tex
@@ -0,0 +1,55 @@
+\section{eo\-Functor\-Store Class Reference}
+\label{classeo_functor_store}\index{eoFunctorStore@{eoFunctorStore}}
+eo\-Functor\-Store is a class that stores functors that are allocated on the heap.  
+
+
+{\tt \#include $<$eo\-Functor\-Store.h$>$}
+
+Inheritance diagram for eo\-Functor\-Store::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2cm]{classeo_functor_store}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Functor\-Store} ()\label{classeo_functor_store_a0}
+
+\begin{CompactList}\small\item\em Default Ctor. \item\end{CompactList}\item 
+virtual {\bf $\sim$eo\-Functor\-Store} ()\label{classeo_functor_store_a1}
+
+\begin{CompactList}\small\item\em clears the memory \item\end{CompactList}\item 
+template$<$class Functor$>$ Functor \& {\bf store\-Functor} (Functor $\ast$r)\label{classeo_functor_store_a2}
+
+\begin{CompactList}\small\item\em Add an {\bf eo\-Functor\-Base}{\rm (p.\,\pageref{classeo_functor_base})} to the store. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Functor\-Store} (const {\bf eo\-Functor\-Store} \&)\label{classeo_functor_store_d0}
+
+\begin{CompactList}\small\item\em no copying allowed \item\end{CompactList}\item 
+{\bf eo\-Functor\-Store} {\bf operator=} (const {\bf eo\-Functor\-Store} \&)\label{classeo_functor_store_d1}
+
+\begin{CompactList}\small\item\em no copying allowed \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+std::vector$<$ {\bf eo\-Functor\-Base} $\ast$ $>$ {\bf vec}\label{classeo_functor_store_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+eo\-Functor\-Store is a class that stores functors that are allocated on the heap. 
+
+This class can be used in factories to store allocated memory for dynamically created functors. 
+
+
+
+Definition at line 39 of file eo\-Functor\-Store.h.
+
+The documentation for this class was generated from the following files:\begin{CompactItemize}
+\item 
+eo\-Functor\-Store.h\item 
+eo\-Functor\-Store.cpp\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_g3_replacement.eps b/trunk/paradiseo-eo/doc/latex/classeo_g3_replacement.eps
new file mode 100644
index 000000000..7f33bebaf
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_g3_replacement.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 107.527
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.65 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoG3Replacement< EOT >) cw
+(eoReplacement< EOT >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoG3Replacement< EOT >) 0.5 0 box
+ (eoReplacement< EOT >) 0.5 1 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_g3_replacement.tex b/trunk/paradiseo-eo/doc/latex/classeo_g3_replacement.tex
new file mode 100644
index 000000000..2ba536946
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_g3_replacement.tex
@@ -0,0 +1,48 @@
+\section{eo\-G3Replacement$<$ EOT $>$ Class Template Reference}
+\label{classeo_g3_replacement}\index{eoG3Replacement@{eoG3Replacement}}
+eo\-G3Replacement is an {\bf eo\-Replacement}{\rm (p.\,\pageref{classeo_replacement})}: - no strong elitism (is suppposed to be within a steady-state engine) - choose N (2) parents RANDOMLY - remove them from the parent population - merge offspring and the N removed parents - select best N of this merged population - put them back into parent population  
+
+
+{\tt \#include $<$eo\-G3Replacement.h$>$}
+
+Inheritance diagram for eo\-G3Replacement$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.01075cm]{classeo_g3_replacement}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-G3Replacement} ({\bf eo\-How\-Many} \_\-how\-Many\-Eliminated\-Parents={\bf eo\-How\-Many}(2, false))\label{classeo_g3_replacement_a0}
+
+\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-parents, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-offspring)\label{classeo_g3_replacement_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Linear\-Truncate\-Split}$<$ {\bf EOT} $>$ {\bf split}\label{classeo_g3_replacement_r0}
+
+\item 
+{\bf eo\-Truncate\-Split}$<$ {\bf EOT} $>$ {\bf reduce}\label{classeo_g3_replacement_r1}
+
+\item 
+{\bf eo\-Plus}$<$ {\bf EOT} $>$ {\bf plus}\label{classeo_g3_replacement_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-G3Replacement$<$ EOT $>$}
+
+eo\-G3Replacement is an {\bf eo\-Replacement}{\rm (p.\,\pageref{classeo_replacement})}: - no strong elitism (is suppposed to be within a steady-state engine) - choose N (2) parents RANDOMLY - remove them from the parent population - merge offspring and the N removed parents - select best N of this merged population - put them back into parent population 
+
+
+
+Definition at line 50 of file eo\-G3Replacement.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-G3Replacement.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_gen_continue.eps b/trunk/paradiseo-eo/doc/latex/classeo_gen_continue.eps
new file mode 100644
index 000000000..6ae239f53
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_gen_continue.eps
@@ -0,0 +1,239 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 67.5676
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 7.4 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 4 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoGenContinue< EOT >) cw
+(eoContinue< EOT >) cw
+(eoValueParam< unsigned >) cw
+(eoUF< const eoPop< EOT > &, bool >) cw
+(eoPersistent) cw
+(eoParam) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, bool >) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoGenContinue< EOT >) 2.12 0 box
+ (eoContinue< EOT >) 1.25 1 box
+ (eoValueParam< unsigned >) 3 1 box
+ (eoUF< const eoPop< EOT > &, bool >) 0.5 2 box
+ (eoPersistent) 2 2 box
+ (eoParam) 3 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< const eoPop< EOT > &, bool >) 1 3 box
+ (eoPrintable) 2 3 box
+
+% ----- relations -----
+
+solid
+0 2.12 0 out
+solid
+1.25 3 1 conn
+solid
+1 1.25 1 in
+solid
+0 1.25 1 out
+solid
+0.5 2 2 conn
+solid
+1 3 1 in
+solid
+0 3 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 2 2 in
+solid
+0 2 2 out
+solid
+1 3 2 in
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+1 2 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_gen_continue.tex b/trunk/paradiseo-eo/doc/latex/classeo_gen_continue.tex
new file mode 100644
index 000000000..5cceecba3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_gen_continue.tex
@@ -0,0 +1,110 @@
+\section{eo\-Gen\-Continue$<$ EOT $>$ Class Template Reference}
+\label{classeo_gen_continue}\index{eoGenContinue@{eoGenContinue}}
+Generational continuator: continues until a number of generations is reached.  
+
+
+{\tt \#include $<$eo\-Gen\-Continue.h$>$}
+
+Inheritance diagram for eo\-Gen\-Continue$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=1.89189cm]{classeo_gen_continue}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Gen\-Continue} (unsigned long \_\-total\-Gens)\label{classeo_gen_continue_a0}
+
+\begin{CompactList}\small\item\em Ctor for setting a. \item\end{CompactList}\item 
+{\bf eo\-Gen\-Continue} (unsigned long \_\-total\-Gens, unsigned long \&\_\-current\-Gen)\label{classeo_gen_continue_a1}
+
+\begin{CompactList}\small\item\em Ctor for enabling the save/load the no. of generations counted. \item\end{CompactList}\item 
+virtual bool {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-v\-EO)\label{classeo_gen_continue_a2}
+
+\begin{CompactList}\small\item\em Returns false when a certain number of generations is reached. \item\end{CompactList}\item 
+virtual void {\bf total\-Generations} (unsigned long \_\-tg)\label{classeo_gen_continue_a3}
+
+\begin{CompactList}\small\item\em Sets the number of generations to reach and sets the current generation to 0 (the begin). \item\end{CompactList}\item 
+virtual unsigned long {\bf total\-Generations} ()\label{classeo_gen_continue_a4}
+
+\begin{CompactList}\small\item\em Returns the number of generations to reach. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} (void) const \label{classeo_gen_continue_a5}
+
+\item 
+void {\bf read\-From} (std::istream \&\_\-\_\-is)
+\begin{CompactList}\small\item\em Read object. \item\end{CompactList}\item 
+void {\bf print\-On} (std::ostream \&\_\-\_\-os) const 
+\begin{CompactList}\small\item\em Write object. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Public Attributes}
+\begin{CompactItemize}
+\item 
+bool {\bf verbose}\label{classeo_gen_continue_o0}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned long {\bf rep\-Total\-Generations}\label{classeo_gen_continue_r0}
+
+\item 
+unsigned long {\bf this\-Generation\-Place\-Holder}\label{classeo_gen_continue_r1}
+
+\item 
+unsigned long \& {\bf this\-Generation}\label{classeo_gen_continue_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Gen\-Continue$<$ EOT $>$}
+
+Generational continuator: continues until a number of generations is reached. 
+
+
+
+Definition at line 34 of file eo\-Gen\-Continue.h.
+
+\subsection{Member Function Documentation}
+\index{eoGenContinue@{eo\-Gen\-Continue}!readFrom@{readFrom}}
+\index{readFrom@{readFrom}!eoGenContinue@{eo\-Gen\-Continue}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ void {\bf eo\-Gen\-Continue}$<$ {\bf EOT} $>$::read\-From (std::istream \& {\em \_\-\_\-is})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_gen_continue_a6}
+
+
+Read object. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-is}]A std::istream. \end{description}
+\end{Desc}
+\begin{Desc}
+\item[Exceptions:]
+\begin{description}
+\item[{\em runtime\_\-std::exception}]If a valid object can't be read. \end{description}
+\end{Desc}
+
+
+Reimplemented from {\bf eo\-Continue$<$ EOT $>$} {\rm (p.\,\pageref{classeo_continue_a1})}.
+
+Definition at line 83 of file eo\-Gen\-Continue.h.\index{eoGenContinue@{eo\-Gen\-Continue}!printOn@{printOn}}
+\index{printOn@{printOn}!eoGenContinue@{eo\-Gen\-Continue}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ void {\bf eo\-Gen\-Continue}$<$ {\bf EOT} $>$::print\-On (std::ostream \& {\em \_\-\_\-os}) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_gen_continue_a7}
+
+
+Write object. 
+
+It's called print\-On since it prints the object on a stream. \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-os}]A std::ostream. \end{description}
+\end{Desc}
+
+
+Reimplemented from {\bf eo\-Continue$<$ EOT $>$} {\rm (p.\,\pageref{classeo_continue_a2})}.
+
+Definition at line 88 of file eo\-Gen\-Continue.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Gen\-Continue.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_gen_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_gen_op.eps
new file mode 100644
index 000000000..3c7ed1716
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_gen_op.eps
@@ -0,0 +1,264 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 318.544
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.56964 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 14 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoGenOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoUF< eoPopulator< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< eoPopulator< EOT > &, void >) cw
+(eoBinGenOp< EOT >) cw
+(eoEsGlobalXover< EOT >) cw
+(eoMonGenOp< EOT >) cw
+(eoOpContainer< EOT >) cw
+(eoPropGAGenOp< EOT >) cw
+(eoQuadGenOp< EOT >) cw
+(eoSelBinGenOp< EOT >) cw
+(eoSGAGenOp< EOT >) cw
+(one2threeOp) cw
+(three2threeOp) cw
+(two2oneOp) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoGenOp< EOT >) 0.5 11 box
+ (eoOp< EOT >) 0 12 box
+ (eoUF< eoPopulator< EOT > &, void >) 1 12 box
+ (eoFunctorBase) 0.5 13 box
+ (unary_function< eoPopulator< EOT > &, void >) 1.5 13 box
+ (eoBinGenOp< EOT >) 1.5 10 box
+ (eoEsGlobalXover< EOT >) 1.5 9 box
+ (eoMonGenOp< EOT >) 1.5 8 box
+ (eoOpContainer< EOT >) 1.5 7 box
+1.5 7 mark
+ (eoPropGAGenOp< EOT >) 1.5 6 box
+ (eoQuadGenOp< EOT >) 1.5 5 box
+ (eoSelBinGenOp< EOT >) 1.5 4 box
+ (eoSGAGenOp< EOT >) 1.5 3 box
+ (one2threeOp) 1.5 2 box
+ (three2threeOp) 1.5 1 box
+ (two2oneOp) 1.5 0 box
+
+% ----- relations -----
+
+solid
+0 0.5 11 out
+solid
+0 1 12 conn
+solid
+1 0 12 in
+solid
+1 1 12 in
+solid
+0 1 12 out
+solid
+0.5 1.5 13 conn
+solid
+1 0.5 13 in
+solid
+1 1.5 13 in
+solid
+1 0.5 10.25 out
+solid
+0 0.5 10.5 hedge
+solid
+0 0.5 9.5 hedge
+solid
+0 0.5 8.5 hedge
+solid
+0 0.5 7.5 hedge
+solid
+0 0.5 6.5 hedge
+solid
+0 0.5 5.5 hedge
+solid
+0 0.5 4.5 hedge
+solid
+0 0.5 3.5 hedge
+solid
+0 0.5 2.5 hedge
+solid
+0 0.5 1.5 hedge
+solid
+0 0.5 0.5 hedge
+solid
+0.5 11 0.5 vedge
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_gen_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_gen_op.tex
new file mode 100644
index 000000000..af3743c71
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_gen_op.tex
@@ -0,0 +1,52 @@
+\section{eo\-Gen\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_gen_op}\index{eoGenOp@{eoGenOp}}
+The base class for General Operators Subclass this operator is you want to define an operator that falls outside of the {\bf eo\-Mon\-Op}{\rm (p.\,\pageref{classeo_mon_op})}, {\bf eo\-Bin\-Op}{\rm (p.\,\pageref{classeo_bin_op})}, {\bf eo\-Quad\-Op}{\rm (p.\,\pageref{classeo_quad_op})} classification.  
+
+
+{\tt \#include $<$eo\-Gen\-Op.h$>$}
+
+Inheritance diagram for eo\-Gen\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=8.91923cm]{classeo_gen_op}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Gen\-Op} ()\label{classeo_gen_op_a0}
+
+\begin{CompactList}\small\item\em Ctor that honors its superclass. \item\end{CompactList}\item 
+virtual unsigned {\bf max\_\-production} (void)=0\label{classeo_gen_op_a1}
+
+\begin{CompactList}\small\item\em Max production is used to reserve space for all elements that are used by the operator, not setting it properly can result in a crash. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const =0\label{classeo_gen_op_a2}
+
+\item 
+void {\bf operator()} ({\bf eo\-Populator}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_gen_op_a3}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Protected Member Functions}
+\begin{CompactItemize}
+\item 
+virtual void {\bf apply} ({\bf eo\-Populator}$<$ {\bf EOT} $>$ \&\_\-pop)=0\label{classeo_gen_op_b0}
+
+\begin{CompactList}\small\item\em the function that will do the work \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Gen\-Op$<$ EOT $>$}
+
+The base class for General Operators Subclass this operator is you want to define an operator that falls outside of the {\bf eo\-Mon\-Op}{\rm (p.\,\pageref{classeo_mon_op})}, {\bf eo\-Bin\-Op}{\rm (p.\,\pageref{classeo_bin_op})}, {\bf eo\-Quad\-Op}{\rm (p.\,\pageref{classeo_quad_op})} classification. 
+
+The argument the operator will receive is an {\bf eo\-Populator}{\rm (p.\,\pageref{classeo_populator})}, which is a wrapper around the original population, is an instantiation of the next population and has often a selection function embedded in it to select new individuals.
+
+Note that the actual work is performed in the apply function. AND that the apply function is responsible for invalidating the object if necessary 
+
+
+
+Definition at line 57 of file eo\-Gen\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Gen\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_gene_del_chooser.eps b/trunk/paradiseo-eo/doc/latex/classeo_gene_del_chooser.eps
new file mode 100644
index 000000000..479204f0b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_gene_del_chooser.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 162.602
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.075 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoGeneDelChooser< EOT >) cw
+(eoUF< EOT &, unsigned int >) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, unsigned int >) cw
+(eoUniformGeneChooser< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoGeneDelChooser< EOT >) 0.5 1 box
+ (eoUF< EOT &, unsigned int >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< EOT &, unsigned int >) 1 3 box
+ (eoUniformGeneChooser< EOT >) 0.5 0 box
+
+% ----- relations -----
+
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+1 0.5 0.25 out
+solid
+0 0.5 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_gene_del_chooser.tex b/trunk/paradiseo-eo/doc/latex/classeo_gene_del_chooser.tex
new file mode 100644
index 000000000..d37ac9ee2
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_gene_del_chooser.tex
@@ -0,0 +1,33 @@
+\section{eo\-Gene\-Del\-Chooser$<$ EOT $>$ Class Template Reference}
+\label{classeo_gene_del_chooser}\index{eoGeneDelChooser@{eoGeneDelChooser}}
+A helper class for choosing which site to delete.  
+
+
+{\tt \#include $<$eo\-Variable\-Length\-Mutation.h$>$}
+
+Inheritance diagram for eo\-Gene\-Del\-Chooser$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_gene_del_chooser}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual std::string {\bf class\-Name} () const =0\label{classeo_gene_del_chooser_a0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Gene\-Del\-Chooser$<$ EOT $>$}
+
+A helper class for choosing which site to delete. 
+
+
+
+Definition at line 85 of file eo\-Variable\-Length\-Mutation.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Variable\-Length\-Mutation.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_general_breeder.eps b/trunk/paradiseo-eo/doc/latex/classeo_general_breeder.eps
new file mode 100644
index 000000000..876032211
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_general_breeder.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 98.2801
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.0875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoGeneralBreeder< EOT >) cw
+(eoBreed< EOT >) cw
+(eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< const eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoGeneralBreeder< EOT >) 0.5 0 box
+ (eoBreed< EOT >) 0.5 1 box
+ (eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< const eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_general_breeder.tex b/trunk/paradiseo-eo/doc/latex/classeo_general_breeder.tex
new file mode 100644
index 000000000..02bbac9e2
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_general_breeder.tex
@@ -0,0 +1,101 @@
+\section{eo\-General\-Breeder$<$ EOT $>$ Class Template Reference}
+\label{classeo_general_breeder}\index{eoGeneralBreeder@{eoGeneralBreeder}}
+Base class for breeders using generalized operators.  
+
+
+{\tt \#include $<$eo\-General\-Breeder.h$>$}
+
+Inheritance diagram for eo\-General\-Breeder$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.75184cm]{classeo_general_breeder}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-General\-Breeder} ({\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \&\_\-select, {\bf eo\-Gen\-Op}$<$ {\bf EOT} $>$ \&\_\-op, double \_\-rate=1.0, bool \_\-interpret\_\-as\_\-rate=true)
+\begin{CompactList}\small\item\em Ctor:. \item\end{CompactList}\item 
+{\bf eo\-General\-Breeder} ({\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \&\_\-select, {\bf eo\-Gen\-Op}$<$ {\bf EOT} $>$ \&\_\-op, {\bf eo\-How\-Many} \_\-how\-Many)
+\begin{CompactList}\small\item\em Ctor:. \item\end{CompactList}\item 
+void {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-parents, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-offspring)
+\begin{CompactList}\small\item\em The breeder: simply calls the gen\-Op on a selective populator! \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_general_breeder_a3}
+
+\begin{CompactList}\small\item\em The class name. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \& {\bf select}\label{classeo_general_breeder_r0}
+
+\item 
+{\bf eo\-Gen\-Op}$<$ {\bf EOT} $>$ \& {\bf op}\label{classeo_general_breeder_r1}
+
+\item 
+{\bf eo\-How\-Many} {\bf how\-Many}\label{classeo_general_breeder_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-General\-Breeder$<$ EOT $>$}
+
+Base class for breeders using generalized operators. 
+
+
+
+Definition at line 46 of file eo\-General\-Breeder.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoGeneralBreeder@{eo\-General\-Breeder}!eoGeneralBreeder@{eoGeneralBreeder}}
+\index{eoGeneralBreeder@{eoGeneralBreeder}!eoGeneralBreeder@{eo\-General\-Breeder}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-General\-Breeder}$<$ {\bf EOT} $>$::{\bf eo\-General\-Breeder} ({\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \& {\em \_\-select}, {\bf eo\-Gen\-Op}$<$ {\bf EOT} $>$ \& {\em \_\-op}, double {\em \_\-rate} = {\tt 1.0}, bool {\em \_\-interpret\_\-as\_\-rate} = {\tt true})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_general_breeder_a0}
+
+
+Ctor:. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-select}]a selecto\-One, to be used for all selections \item[{\em \_\-op}]a general operator (will generally be an {\bf eo\-Op\-Container}{\rm (p.\,\pageref{classeo_op_container})}) \item[{\em \_\-rate}]pour how\-Many, le nbre d'enfants a generer \item[{\em \_\-interpret\_\-as\_\-rate}]{\tt explanation} \end{description}
+\end{Desc}
+
+
+Definition at line 56 of file eo\-General\-Breeder.h.\index{eoGeneralBreeder@{eo\-General\-Breeder}!eoGeneralBreeder@{eoGeneralBreeder}}
+\index{eoGeneralBreeder@{eoGeneralBreeder}!eoGeneralBreeder@{eo\-General\-Breeder}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-General\-Breeder}$<$ {\bf EOT} $>$::{\bf eo\-General\-Breeder} ({\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \& {\em \_\-select}, {\bf eo\-Gen\-Op}$<$ {\bf EOT} $>$ \& {\em \_\-op}, {\bf eo\-How\-Many} {\em \_\-how\-Many})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_general_breeder_a1}
+
+
+Ctor:. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-select}]a selecto\-One, to be used for all selections \item[{\em \_\-op}]a general operator (will generally be an {\bf eo\-Op\-Container}{\rm (p.\,\pageref{classeo_op_container})}) \item[{\em \_\-how\-Many}]an {\bf eo\-How\-Many}{\rm (p.\,\pageref{classeo_how_many})} {\tt explanation} \end{description}
+\end{Desc}
+
+
+Definition at line 69 of file eo\-General\-Breeder.h.
+
+\subsection{Member Function Documentation}
+\index{eoGeneralBreeder@{eo\-General\-Breeder}!operator()@{operator()}}
+\index{operator()@{operator()}!eoGeneralBreeder@{eo\-General\-Breeder}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ void {\bf eo\-General\-Breeder}$<$ {\bf EOT} $>$::operator() (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\em \_\-parents}, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\em \_\-offspring})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_general_breeder_a2}
+
+
+The breeder: simply calls the gen\-Op on a selective populator! 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-parents}]the initial population \item[{\em \_\-offspring}]the resulting population (content -if any- is lost) \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-BF$<$ const eo\-Pop$<$ EOT $>$ \&, eo\-Pop$<$ EOT $>$ \&, void $>$} {\rm (p.\,\pageref{classeo_b_f_a1})}.
+
+Definition at line 80 of file eo\-General\-Breeder.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-General\-Breeder.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_general_int_bounds.eps b/trunk/paradiseo-eo/doc/latex/classeo_general_int_bounds.eps
new file mode 100644
index 000000000..c1668de94
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_general_int_bounds.eps
@@ -0,0 +1,209 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 597.015
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 0.8375 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoGeneralIntBounds) cw
+(eoIntBounds) cw
+(eoPersistent) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoGeneralIntBounds) 0 0 box
+ (eoIntBounds) 0 1 box
+ (eoPersistent) 0 2 box
+ (eoPrintable) 0 3 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 0 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_general_int_bounds.tex b/trunk/paradiseo-eo/doc/latex/classeo_general_int_bounds.tex
new file mode 100644
index 000000000..c5c4d430d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_general_int_bounds.tex
@@ -0,0 +1,103 @@
+\section{eo\-General\-Int\-Bounds Class Reference}
+\label{classeo_general_int_bounds}\index{eoGeneralIntBounds@{eoGeneralIntBounds}}
+A class that encapsulate all possible {\bf eo\-Int\-Bounds}{\rm (p.\,\pageref{classeo_int_bounds})}.  
+
+
+{\tt \#include $<$eo\-Int\-Bounds.h$>$}
+
+Inheritance diagram for eo\-General\-Int\-Bounds::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_general_int_bounds}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-General\-Int\-Bounds} (std::string \_\-s=\char`\"{}[-infinity,+infinity]\char`\"{})\label{classeo_general_int_bounds_a0}
+
+\begin{CompactList}\small\item\em Ctor: from a string, chooses the type of bound. \item\end{CompactList}\item 
+{\bf eo\-General\-Int\-Bounds} (const {\bf eo\-General\-Int\-Bounds} \&\_\-b)\label{classeo_general_int_bounds_a1}
+
+\begin{CompactList}\small\item\em Need a Cpy Ctor because we are allocating memory. \item\end{CompactList}\item 
+{\bf eo\-General\-Int\-Bounds} \& {\bf operator=} (const {\bf eo\-General\-Int\-Bounds} \&\_\-b)\label{classeo_general_int_bounds_a2}
+
+\item 
+{\bf $\sim$eo\-General\-Int\-Bounds} ()\label{classeo_general_int_bounds_a3}
+
+\begin{CompactList}\small\item\em Need a Dtor because we allocate an actual bound. \item\end{CompactList}\item 
+virtual bool {\bf is\-Bounded} (void) const \label{classeo_general_int_bounds_a4}
+
+\begin{CompactList}\small\item\em Self-Test: true if $\ast$$\ast$$\ast$both$\ast$$\ast$$\ast$ a min and a max. \item\end{CompactList}\item 
+virtual bool {\bf has\-No\-Bound\-At\-All} (void) const \label{classeo_general_int_bounds_a5}
+
+\begin{CompactList}\small\item\em Self-Test: true if no min $\ast$$\ast$$\ast$and$\ast$$\ast$$\ast$ no max hence no further need to test/truncate/fold anything. \item\end{CompactList}\item 
+virtual bool {\bf is\-Min\-Bounded} (void) const \label{classeo_general_int_bounds_a6}
+
+\begin{CompactList}\small\item\em Self-Test: bounded from below??? \item\end{CompactList}\item 
+virtual bool {\bf is\-Max\-Bounded} (void) const \label{classeo_general_int_bounds_a7}
+
+\begin{CompactList}\small\item\em Self-Test: bounded from above??? \item\end{CompactList}\item 
+virtual bool {\bf is\-In\-Bounds} (double \_\-x) const \label{classeo_general_int_bounds_a8}
+
+\begin{CompactList}\small\item\em Test on a value: is it in bounds? \item\end{CompactList}\item 
+virtual void {\bf folds\-In\-Bounds} (double \&\_\-x) const \label{classeo_general_int_bounds_a9}
+
+\begin{CompactList}\small\item\em Put value back into bounds - by folding back and forth. \item\end{CompactList}\item 
+virtual void {\bf truncate} (double \&\_\-x) const \label{classeo_general_int_bounds_a10}
+
+\begin{CompactList}\small\item\em Put value back into bounds - by truncating to a boundary value. \item\end{CompactList}\item 
+virtual long int {\bf minimum} () const \label{classeo_general_int_bounds_a11}
+
+\begin{CompactList}\small\item\em get minimum value ::exception if does not exist \item\end{CompactList}\item 
+virtual long int {\bf maximum} () const \label{classeo_general_int_bounds_a12}
+
+\begin{CompactList}\small\item\em get maximum value ::exception if does not exist \item\end{CompactList}\item 
+virtual long int {\bf range} () const \label{classeo_general_int_bounds_a13}
+
+\begin{CompactList}\small\item\em get range ::exception if unbounded \item\end{CompactList}\item 
+virtual double {\bf uniform} ({\bf eo\-Rng} \&\_\-rng=eo::rng) const \label{classeo_general_int_bounds_a14}
+
+\begin{CompactList}\small\item\em random generator of uniform doubles in bounds ::exception if unbounded \item\end{CompactList}\item 
+virtual long int {\bf random} ({\bf eo\-Rng} \&\_\-rng=eo::rng) const \label{classeo_general_int_bounds_a15}
+
+\begin{CompactList}\small\item\em random generator of uniform ints in bounds ::exception if unbounded \item\end{CompactList}\item 
+virtual {\bf eo\-Int\-Bounds} $\ast$ {\bf dup} () const \label{classeo_general_int_bounds_a16}
+
+\begin{CompactList}\small\item\em for memory managements - ugly \item\end{CompactList}\item 
+const {\bf eo\-Int\-Bounds} \& {\bf the\-Bounds} () const \label{classeo_general_int_bounds_a17}
+
+\begin{CompactList}\small\item\em for efficiency, it's better to use the embedded boud directly \item\end{CompactList}\item 
+virtual void {\bf print\-On} (std::ostream \&\_\-os) const \label{classeo_general_int_bounds_a18}
+
+\begin{CompactList}\small\item\em don't forget the print\-On method - again that of the embedded bound \item\end{CompactList}\item 
+virtual void {\bf read\-From} (std::istream \&\_\-is)\label{classeo_general_int_bounds_a19}
+
+\begin{CompactList}\small\item\em no read\-From ??? Have to check that later \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Int\-Bounds} $\ast$ {\bf get\-Bounds\-From\-String} (std::string)\label{classeo_general_int_bounds_d0}
+
+\begin{CompactList}\small\item\em the constructor for eo\-General\-Int\-Bound - from a string \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Int\-Bounds} $\ast$ {\bf rep\-Bound}\label{classeo_general_int_bounds_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+A class that encapsulate all possible {\bf eo\-Int\-Bounds}{\rm (p.\,\pageref{classeo_int_bounds})}. 
+
+Mandatory in order to read through the parser 
+
+
+
+Definition at line 541 of file eo\-Int\-Bounds.h.
+
+The documentation for this class was generated from the following files:\begin{CompactItemize}
+\item 
+eo\-Int\-Bounds.h\item 
+eo\-Int\-Bounds.cpp\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_general_real_bounds.eps b/trunk/paradiseo-eo/doc/latex/classeo_general_real_bounds.eps
new file mode 100644
index 000000000..9fc246842
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_general_real_bounds.eps
@@ -0,0 +1,209 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 547.945
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 0.9125 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoGeneralRealBounds) cw
+(eoRealBounds) cw
+(eoPersistent) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoGeneralRealBounds) 0 0 box
+ (eoRealBounds) 0 1 box
+ (eoPersistent) 0 2 box
+ (eoPrintable) 0 3 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 0 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_general_real_bounds.tex b/trunk/paradiseo-eo/doc/latex/classeo_general_real_bounds.tex
new file mode 100644
index 000000000..c8fbd0797
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_general_real_bounds.tex
@@ -0,0 +1,100 @@
+\section{eo\-General\-Real\-Bounds Class Reference}
+\label{classeo_general_real_bounds}\index{eoGeneralRealBounds@{eoGeneralRealBounds}}
+A class that encapsulate all possible {\bf eo\-Int\-Bounds}{\rm (p.\,\pageref{classeo_int_bounds})}.  
+
+
+{\tt \#include $<$eo\-Real\-Bounds.h$>$}
+
+Inheritance diagram for eo\-General\-Real\-Bounds::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_general_real_bounds}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-General\-Real\-Bounds} (std::string \_\-s=\char`\"{}[-infinity,+infinity]\char`\"{})\label{classeo_general_real_bounds_a0}
+
+\begin{CompactList}\small\item\em Ctor: from a string, chooses the type of bound. \item\end{CompactList}\item 
+{\bf eo\-General\-Real\-Bounds} (const {\bf eo\-General\-Real\-Bounds} \&\_\-b)\label{classeo_general_real_bounds_a1}
+
+\begin{CompactList}\small\item\em Need a Cpy Ctor because we are allocating memory. \item\end{CompactList}\item 
+{\bf eo\-General\-Real\-Bounds} \& {\bf operator=} (const {\bf eo\-General\-Real\-Bounds} \&\_\-b)\label{classeo_general_real_bounds_a2}
+
+\item 
+{\bf $\sim$eo\-General\-Real\-Bounds} ()\label{classeo_general_real_bounds_a3}
+
+\begin{CompactList}\small\item\em Need a Dtor because we allocate an actual bound. \item\end{CompactList}\item 
+virtual bool {\bf is\-Bounded} (void) const \label{classeo_general_real_bounds_a4}
+
+\begin{CompactList}\small\item\em Self-Test: true if $\ast$$\ast$$\ast$both$\ast$$\ast$$\ast$ a min and a max. \item\end{CompactList}\item 
+virtual bool {\bf has\-No\-Bound\-At\-All} (void) const \label{classeo_general_real_bounds_a5}
+
+\begin{CompactList}\small\item\em Self-Test: true if no min $\ast$$\ast$$\ast$and$\ast$$\ast$$\ast$ no max hence no further need to test/truncate/fold anything. \item\end{CompactList}\item 
+virtual bool {\bf is\-Min\-Bounded} (void) const \label{classeo_general_real_bounds_a6}
+
+\begin{CompactList}\small\item\em Self-Test: bounded from below??? \item\end{CompactList}\item 
+virtual bool {\bf is\-Max\-Bounded} (void) const \label{classeo_general_real_bounds_a7}
+
+\begin{CompactList}\small\item\em Self-Test: bounded from above??? \item\end{CompactList}\item 
+virtual bool {\bf is\-In\-Bounds} (double \_\-x) const \label{classeo_general_real_bounds_a8}
+
+\begin{CompactList}\small\item\em Test on a value: is it in bounds? \item\end{CompactList}\item 
+virtual void {\bf folds\-In\-Bounds} (double \&\_\-x) const \label{classeo_general_real_bounds_a9}
+
+\begin{CompactList}\small\item\em Put value back into bounds - by folding back and forth. \item\end{CompactList}\item 
+virtual void {\bf truncate} (double \&\_\-x) const \label{classeo_general_real_bounds_a10}
+
+\begin{CompactList}\small\item\em Put value back into bounds - by truncating to a boundary value. \item\end{CompactList}\item 
+virtual double {\bf minimum} () const \label{classeo_general_real_bounds_a11}
+
+\begin{CompactList}\small\item\em get minimum value ::exception if does not exist \item\end{CompactList}\item 
+virtual double {\bf maximum} () const \label{classeo_general_real_bounds_a12}
+
+\begin{CompactList}\small\item\em get maximum value ::exception if does not exist \item\end{CompactList}\item 
+virtual double {\bf range} () const \label{classeo_general_real_bounds_a13}
+
+\begin{CompactList}\small\item\em get range ::exception if unbounded \item\end{CompactList}\item 
+virtual double {\bf uniform} ({\bf eo\-Rng} \&\_\-rng=eo::rng) const \label{classeo_general_real_bounds_a14}
+
+\begin{CompactList}\small\item\em random generator of uniform numbers in bounds ::exception if unbounded \item\end{CompactList}\item 
+virtual {\bf eo\-Real\-Bounds} $\ast$ {\bf dup} () const \label{classeo_general_real_bounds_a15}
+
+\begin{CompactList}\small\item\em for memory managements - ugly \item\end{CompactList}\item 
+const {\bf eo\-Real\-Bounds} \& {\bf the\-Bounds} () const \label{classeo_general_real_bounds_a16}
+
+\begin{CompactList}\small\item\em for efficiency, it's better to use the embedded boud directly \item\end{CompactList}\item 
+virtual void {\bf print\-On} (std::ostream \&\_\-os) const \label{classeo_general_real_bounds_a17}
+
+\begin{CompactList}\small\item\em don't forget the print\-On method - again that of the embedded bound \item\end{CompactList}\item 
+virtual void {\bf read\-From} (std::istream \&\_\-is)\label{classeo_general_real_bounds_a18}
+
+\begin{CompactList}\small\item\em no read\-From ??? Have to check that later \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Real\-Bounds} $\ast$ {\bf get\-Bounds\-From\-String} (std::string)\label{classeo_general_real_bounds_d0}
+
+\begin{CompactList}\small\item\em the constructor for eo\-General\-Real\-Bound - from a string very similar to the {\bf eo\-Real\-Vector\-Bounds::read\-From}{\rm (p.\,\pageref{classeo_real_vector_bounds_a7})} above but was written much later so the read\-From does not call this one as it should do \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Real\-Bounds} $\ast$ {\bf rep\-Bound}\label{classeo_general_real_bounds_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+A class that encapsulate all possible {\bf eo\-Int\-Bounds}{\rm (p.\,\pageref{classeo_int_bounds})}. 
+
+Mandatory in order to read through the parser 
+
+
+
+Definition at line 506 of file eo\-Real\-Bounds.h.
+
+The documentation for this class was generated from the following files:\begin{CompactItemize}
+\item 
+eo\-Real\-Bounds.h\item 
+eo\-Real\-Bounds.cpp\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_generational_replacement.eps b/trunk/paradiseo-eo/doc/latex/classeo_generational_replacement.eps
new file mode 100644
index 000000000..7dcd74daa
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_generational_replacement.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 107.527
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.65 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoGenerationalReplacement< EOT >) cw
+(eoReplacement< EOT >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoGenerationalReplacement< EOT >) 0.5 0 box
+ (eoReplacement< EOT >) 0.5 1 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_generational_replacement.tex b/trunk/paradiseo-eo/doc/latex/classeo_generational_replacement.tex
new file mode 100644
index 000000000..9c437773f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_generational_replacement.tex
@@ -0,0 +1,33 @@
+\section{eo\-Generational\-Replacement$<$ EOT $>$ Class Template Reference}
+\label{classeo_generational_replacement}\index{eoGenerationalReplacement@{eoGenerationalReplacement}}
+generational replacement == swap populations  
+
+
+{\tt \#include $<$eo\-Replacement.h$>$}
+
+Inheritance diagram for eo\-Generational\-Replacement$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.01075cm]{classeo_generational_replacement}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-parents, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-offspring)\label{classeo_generational_replacement_a0}
+
+\begin{CompactList}\small\item\em swap \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Generational\-Replacement$<$ EOT $>$}
+
+generational replacement == swap populations 
+
+
+
+Definition at line 84 of file eo\-Replacement.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Replacement.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_gnuplot.eps b/trunk/paradiseo-eo/doc/latex/classeo_gnuplot.eps
new file mode 100644
index 000000000..6b9deff82
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_gnuplot.eps
@@ -0,0 +1,203 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 137.931
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.625 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 2 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoGnuplot) cw
+(eoGnuplot1DMonitor) cw
+(eoGnuplot1DSnapshot) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoGnuplot) 0.5 1 box
+ (eoGnuplot1DMonitor) 0 0 box
+ (eoGnuplot1DSnapshot) 1 0 box
+
+% ----- relations -----
+
+solid
+1 0.5 0.25 out
+solid
+0 1 1 conn
+solid
+0 0 0.75 in
+solid
+0 1 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_gnuplot.tex b/trunk/paradiseo-eo/doc/latex/classeo_gnuplot.tex
new file mode 100644
index 000000000..e8e760227
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_gnuplot.tex
@@ -0,0 +1,129 @@
+\section{eo\-Gnuplot Class Reference}
+\label{classeo_gnuplot}\index{eoGnuplot@{eoGnuplot}}
+Base class for calls to gnuplot.  
+
+
+{\tt \#include $<$eo\-Gnuplot.h$>$}
+
+Inheritance diagram for eo\-Gnuplot::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2cm]{classeo_gnuplot}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Gnuplot} (std::string \_\-title, std::string \_\-extra=std::string(\char`\"{}\char`\"{}))
+\begin{CompactList}\small\item\em Open pipe to Gnuplot. \item\end{CompactList}\item 
+virtual {\bf $\sim$eo\-Gnuplot} ()
+\begin{CompactList}\small\item\em Destructor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_gnuplot_a2}
+
+\begin{CompactList}\small\item\em Class name. \item\end{CompactList}\item 
+void {\bf gnuplot\-Command} (const char $\ast$\_\-command)\label{classeo_gnuplot_a3}
+
+\begin{CompactList}\small\item\em Send command to gnuplot. \item\end{CompactList}\item 
+void {\bf gnuplot\-Command} (std::string \_\-command)
+\begin{CompactList}\small\item\em Send command to gnuplot. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Protected Member Functions}
+\begin{CompactItemize}
+\item 
+void {\bf init\-Gnu\-Plot} (std::string \_\-title, std::string \_\-extra)
+\begin{CompactList}\small\item\em Initialize gnuplot. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Protected Attributes}
+\begin{CompactItemize}
+\item 
+bool {\bf first\-Time}\label{classeo_gnuplot_p0}
+
+\begin{CompactList}\small\item\em The stats might be unknown in Ctor. \item\end{CompactList}\item 
+PCom $\ast$ {\bf gp\-Com}\label{classeo_gnuplot_p1}
+
+\begin{CompactList}\small\item\em Communication with gnuplot OK. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Static Protected Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf num\-Window} = 0\label{classeo_gnuplot_t0}
+
+\begin{CompactList}\small\item\em Internal counter for gnuplot windows. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Base class for calls to gnuplot. 
+
+This class is the abstract class that will be used by further gnuplot calls to plots what is already written by some {\bf eo\-Monitor}{\rm (p.\,\pageref{classeo_monitor})} into a file
+
+\begin{Desc}
+\item[Author:]Marc Schoenauer \end{Desc}
+\begin{Desc}
+\item[Version:]0.0 (2001) \end{Desc}
+
+
+
+
+Definition at line 38 of file eo\-Gnuplot.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoGnuplot@{eo\-Gnuplot}!eoGnuplot@{eoGnuplot}}
+\index{eoGnuplot@{eoGnuplot}!eoGnuplot@{eo\-Gnuplot}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}eo\-Gnuplot::eo\-Gnuplot (std::string {\em \_\-title}, std::string {\em \_\-extra} = {\tt std::string(\char`\"{}\char`\"{})})}\label{classeo_gnuplot_a0}
+
+
+Open pipe to Gnuplot. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-title}]Title for gnuplot window. \item[{\em \_\-extra}]Extra parameters to gnuplot (default $<$none$>$). \end{description}
+\end{Desc}
+
+
+Definition at line 37 of file eo\-Gnuplot.cpp.
+
+References init\-Gnu\-Plot().\index{eoGnuplot@{eo\-Gnuplot}!~eoGnuplot@{$\sim$eoGnuplot}}
+\index{~eoGnuplot@{$\sim$eoGnuplot}!eoGnuplot@{eo\-Gnuplot}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}eo\-Gnuplot::$\sim${\bf eo\-Gnuplot} ()\hspace{0.3cm}{\tt  [virtual]}}\label{classeo_gnuplot_a1}
+
+
+Destructor. 
+
+Close the gnuplot windows if pipe was correctly opened 
+
+Definition at line 45 of file eo\-Gnuplot.cpp.
+
+References gp\-Com.
+
+\subsection{Member Function Documentation}
+\index{eoGnuplot@{eo\-Gnuplot}!gnuplotCommand@{gnuplotCommand}}
+\index{gnuplotCommand@{gnuplotCommand}!eoGnuplot@{eo\-Gnuplot}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}void eo\-Gnuplot::gnuplot\-Command (std::string {\em \_\-command})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_gnuplot_a4}
+
+
+Send command to gnuplot. 
+
+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 
+
+Definition at line 66 of file eo\-Gnuplot.h.\index{eoGnuplot@{eo\-Gnuplot}!initGnuPlot@{initGnuPlot}}
+\index{initGnuPlot@{initGnuPlot}!eoGnuplot@{eo\-Gnuplot}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}void eo\-Gnuplot::init\-Gnu\-Plot (std::string {\em \_\-title}, std::string {\em \_\-extra})\hspace{0.3cm}{\tt  [protected]}}\label{classeo_gnuplot_b0}
+
+
+Initialize gnuplot. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-title}]Title for gnuplot window. \item[{\em \_\-extra}]Extra parameters to gnuplot. \end{description}
+\end{Desc}
+
+
+Definition at line 70 of file eo\-Gnuplot.cpp.
+
+References gp\-Com, and num\-Window.
+
+Referenced by eo\-Gnuplot().
+
+The documentation for this class was generated from the following files:\begin{CompactItemize}
+\item 
+eo\-Gnuplot.h\item 
+eo\-Gnuplot.cpp\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_gnuplot1_d_monitor.eps b/trunk/paradiseo-eo/doc/latex/classeo_gnuplot1_d_monitor.eps
new file mode 100644
index 000000000..302fa935d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_gnuplot1_d_monitor.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 364.964
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.37 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoGnuplot1DMonitor) cw
+(eoFileMonitor) cw
+(eoGnuplot) cw
+(eoMonitor) cw
+(eoF< eoMonitor & >) cw
+(eoFunctorBase) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoGnuplot1DMonitor) 0.5 0 box
+ (eoFileMonitor) 0 1 box
+ (eoGnuplot) 1 1 box
+ (eoMonitor) 0 2 box
+ (eoF< eoMonitor & >) 0 3 box
+ (eoFunctorBase) 0 4 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+0 1 1 conn
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 1 1 in
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 0 3 in
+solid
+0 0 3 out
+solid
+1 0 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_gnuplot1_d_monitor.tex b/trunk/paradiseo-eo/doc/latex/classeo_gnuplot1_d_monitor.tex
new file mode 100644
index 000000000..a60689306
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_gnuplot1_d_monitor.tex
@@ -0,0 +1,54 @@
+\section{eo\-Gnuplot1DMonitor Class Reference}
+\label{classeo_gnuplot1_d_monitor}\index{eoGnuplot1DMonitor@{eoGnuplot1DMonitor}}
+Plot {\bf eo\-Stat}{\rm (p.\,\pageref{classeo_stat})}.  
+
+
+{\tt \#include $<$eo\-Gnuplot1DMonitor.h$>$}
+
+Inheritance diagram for eo\-Gnuplot1DMonitor::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=5cm]{classeo_gnuplot1_d_monitor}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Gnuplot1DMonitor} (std::string \_\-filename, bool \_\-top=false)\label{classeo_gnuplot1_d_monitor_a0}
+
+\begin{CompactList}\small\item\em Constructor. \item\end{CompactList}\item 
+virtual {\bf $\sim$eo\-Gnuplot1DMonitor} ()\label{classeo_gnuplot1_d_monitor_a1}
+
+\begin{CompactList}\small\item\em Destructor. \item\end{CompactList}\item 
+virtual {\bf eo\-Monitor} \& {\bf operator()} ()\label{classeo_gnuplot1_d_monitor_a2}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\item 
+virtual void {\bf First\-Plot} ()\label{classeo_gnuplot1_d_monitor_a3}
+
+\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_gnuplot1_d_monitor_a4}
+
+\begin{CompactList}\small\item\em Class name. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Plot {\bf eo\-Stat}{\rm (p.\,\pageref{classeo_stat})}. 
+
+\begin{Desc}
+\item[Author:]Marc Schoenauer \end{Desc}
+\begin{Desc}
+\item[Version:]0.0 (2000)\end{Desc}
+This class plots through gnuplot the {\bf eo\-Stat}{\rm (p.\,\pageref{classeo_stat})} given as argument
+
+eo\-Gnuplot1DMonitor plots stats through gnuplot
+
+Assumes that the same file is appened every so and so, and replots it everytime 
+
+
+
+Definition at line 47 of file eo\-Gnuplot1DMonitor.h.
+
+The documentation for this class was generated from the following files:\begin{CompactItemize}
+\item 
+eo\-Gnuplot1DMonitor.h\item 
+eo\-Gnuplot1DMonitor.cpp\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_gnuplot1_d_snapshot.eps b/trunk/paradiseo-eo/doc/latex/classeo_gnuplot1_d_snapshot.eps
new file mode 100644
index 000000000..91591e860
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_gnuplot1_d_snapshot.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 344.828
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.45 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoGnuplot1DSnapshot) cw
+(eoFileSnapshot) cw
+(eoGnuplot) cw
+(eoMonitor) cw
+(eoF< eoMonitor & >) cw
+(eoFunctorBase) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoGnuplot1DSnapshot) 0.5 0 box
+ (eoFileSnapshot) 0 1 box
+ (eoGnuplot) 1 1 box
+ (eoMonitor) 0 2 box
+ (eoF< eoMonitor & >) 0 3 box
+ (eoFunctorBase) 0 4 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+0 1 1 conn
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 1 1 in
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 0 3 in
+solid
+0 0 3 out
+solid
+1 0 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_gnuplot1_d_snapshot.tex b/trunk/paradiseo-eo/doc/latex/classeo_gnuplot1_d_snapshot.tex
new file mode 100644
index 000000000..12e4f1399
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_gnuplot1_d_snapshot.tex
@@ -0,0 +1,67 @@
+\section{eo\-Gnuplot1DSnapshot Class Reference}
+\label{classeo_gnuplot1_d_snapshot}\index{eoGnuplot1DSnapshot@{eoGnuplot1DSnapshot}}
+Plot stats through gnuplot.  
+
+
+{\tt \#include $<$eo\-Gnuplot1DSnapshot.h$>$}
+
+Inheritance diagram for eo\-Gnuplot1DSnapshot::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=5cm]{classeo_gnuplot1_d_snapshot}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Gnuplot1DSnapshot} (std::string \_\-dirname, unsigned \_\-frequency=1, std::string \_\-filename=\char`\"{}gen\char`\"{}, std::string \_\-delim=\char`\"{} \char`\"{}, unsigned \_\-counter=0, bool \_\-rm\-Files=true)\label{classeo_gnuplot1_d_snapshot_a0}
+
+\item 
+{\bf eo\-Gnuplot1DSnapshot} (std::string \_\-dirname, {\bf eo\-Real\-Vector\-Bounds} \&\_\-bounds, unsigned \_\-frequency=1, std::string \_\-filename=\char`\"{}gen\char`\"{}, std::string \_\-delim=\char`\"{} \char`\"{}, unsigned \_\-counter=0, bool \_\-rm\-Files=true)\label{classeo_gnuplot1_d_snapshot_a1}
+
+\item 
+{\bf eo\-Gnuplot1DSnapshot} ({\bf eo\-File\-Snapshot} \&\_\-f\-Snapshot)\label{classeo_gnuplot1_d_snapshot_a2}
+
+\item 
+{\bf eo\-Gnuplot1DSnapshot} ({\bf eo\-File\-Snapshot} \&\_\-f\-Snapshot, {\bf eo\-Real\-Vector\-Bounds} \&\_\-bounds)\label{classeo_gnuplot1_d_snapshot_a3}
+
+\item 
+virtual {\bf eo\-Monitor} \& {\bf operator()} ()\label{classeo_gnuplot1_d_snapshot_a5}
+
+\begin{CompactList}\small\item\em The operator(void): opens the std::ostream and calls the write method. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_gnuplot1_d_snapshot_a6}
+
+\begin{CompactList}\small\item\em Class name. \item\end{CompactList}\item 
+virtual void {\bf handle\-Bounds} ({\bf eo\-Real\-Vector\-Bounds} \&\_\-bounds)\label{classeo_gnuplot1_d_snapshot_a7}
+
+\item 
+void {\bf set\-Point\-Size} (unsigned \_\-point\-Size)\label{classeo_gnuplot1_d_snapshot_a8}
+
+\end{CompactItemize}
+\subsection*{Protected Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf point\-Size}\label{classeo_gnuplot1_d_snapshot_p0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Plot stats through gnuplot. 
+
+\begin{Desc}
+\item[Author:]Marc Schoenauer 2000 \end{Desc}
+\begin{Desc}
+\item[Version:]0.0\end{Desc}
+This class plots through gnuplot the {\bf eo\-Stat}{\rm (p.\,\pageref{classeo_stat})} given as argument
+
+Assumes that the same file is re-written every so and so, and plots it from scratch everytime it's called 
+
+
+
+Definition at line 51 of file eo\-Gnuplot1DSnapshot.h.
+
+The documentation for this class was generated from the following files:\begin{CompactItemize}
+\item 
+eo\-Gnuplot1DSnapshot.h\item 
+eo\-Gnuplot1DSnapshot.cpp\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_hamming_distance.eps b/trunk/paradiseo-eo/doc/latex/classeo_hamming_distance.eps
new file mode 100644
index 000000000..22b3d974b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_hamming_distance.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 119.048
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.2 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoHammingDistance< EOT >) cw
+(eoDistance< EOT >) cw
+(eoBF< const EOT &, const EOT &, double >) cw
+(eoFunctorBase) cw
+(binary_function< const EOT &, const EOT &, double >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoHammingDistance< EOT >) 0.5 0 box
+ (eoDistance< EOT >) 0.5 1 box
+ (eoBF< const EOT &, const EOT &, double >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< const EOT &, const EOT &, double >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_hamming_distance.tex b/trunk/paradiseo-eo/doc/latex/classeo_hamming_distance.tex
new file mode 100644
index 000000000..e30ba309c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_hamming_distance.tex
@@ -0,0 +1,33 @@
+\section{eo\-Hamming\-Distance$<$ EOT $>$ Class Template Reference}
+\label{classeo_hamming_distance}\index{eoHammingDistance@{eoHammingDistance}}
+This is a generic class for L1 distance computation: assumes the 2 things are std::vectors of something that is double-castable For bitstrings, this is the Hamming distance.  
+
+
+{\tt \#include $<$eo\-Distance.h$>$}
+
+Inheritance diagram for eo\-Hamming\-Distance$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.33333cm]{classeo_hamming_distance}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+double {\bf operator()} (const {\bf EOT} \&\_\-v1, const {\bf EOT} \&\_\-v2)\label{classeo_hamming_distance_a0}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Hamming\-Distance$<$ EOT $>$}
+
+This is a generic class for L1 distance computation: assumes the 2 things are std::vectors of something that is double-castable For bitstrings, this is the Hamming distance. 
+
+
+
+Definition at line 66 of file eo\-Distance.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Distance.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_hoist_mutation.eps b/trunk/paradiseo-eo/doc/latex/classeo_hoist_mutation.eps
new file mode 100644
index 000000000..d35f28d54
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_hoist_mutation.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 76.6284
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 6.525 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoHoistMutation< FType, Node >) cw
+(eoMonOp< eoParseTree< FType, Node > >) cw
+(eoOp< eoParseTree< FType, Node > >) cw
+(eoUF< eoParseTree< FType, Node > &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< eoParseTree< FType, Node > &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoHoistMutation< FType, Node >) 0.5 0 box
+ (eoMonOp< eoParseTree< FType, Node > >) 0.5 1 box
+ (eoOp< eoParseTree< FType, Node > >) 0 2 box
+ (eoUF< eoParseTree< FType, Node > &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< eoParseTree< FType, Node > &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_hoist_mutation.tex b/trunk/paradiseo-eo/doc/latex/classeo_hoist_mutation.tex
new file mode 100644
index 000000000..b1f80b7f9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_hoist_mutation.tex
@@ -0,0 +1,82 @@
+\section{eo\-Hoist\-Mutation$<$ FType, Node $>$ Class Template Reference}
+\label{classeo_hoist_mutation}\index{eoHoistMutation@{eoHoistMutation}}
+eo\-Hoist\-Mutation --$>$ replace the individual with one of its subtree's  
+
+
+{\tt \#include $<$gp/eo\-Parse\-Tree\-Op.h$>$}
+
+Inheritance diagram for eo\-Hoist\-Mutation$<$ FType, Node $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.14559cm]{classeo_hoist_mutation}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef {\bf eo\-Parse\-Tree}$<$ FType, Node $>$ {\bf Eo\-Type}\label{classeo_hoist_mutation_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Hoist\-Mutation} ()
+\begin{CompactList}\small\item\em Constructor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_hoist_mutation_a1}
+
+\begin{CompactList}\small\item\em The class name. \item\end{CompactList}\item 
+virtual {\bf $\sim$eo\-Hoist\-Mutation} ()\label{classeo_hoist_mutation_a2}
+
+\begin{CompactList}\small\item\em Dtor. \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf Eo\-Type} \&\_\-eo1)
+\begin{CompactList}\small\item\em Mutate an individual. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class FType, class Node$>$ class eo\-Hoist\-Mutation$<$ FType, Node $>$}
+
+eo\-Hoist\-Mutation --$>$ replace the individual with one of its subtree's 
+
+
+
+Definition at line 336 of file eo\-Parse\-Tree\-Op.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoHoistMutation@{eo\-Hoist\-Mutation}!eoHoistMutation@{eoHoistMutation}}
+\index{eoHoistMutation@{eoHoistMutation}!eoHoistMutation@{eo\-Hoist\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ {\bf eo\-Hoist\-Mutation}$<$ FType, Node $>$::{\bf eo\-Hoist\-Mutation} ()\hspace{0.3cm}{\tt  [inline]}}\label{classeo_hoist_mutation_a0}
+
+
+Constructor. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em none}]\end{description}
+\end{Desc}
+
+
+Definition at line 345 of file eo\-Parse\-Tree\-Op.h.
+
+\subsection{Member Function Documentation}
+\index{eoHoistMutation@{eo\-Hoist\-Mutation}!operator()@{operator()}}
+\index{operator()@{operator()}!eoHoistMutation@{eo\-Hoist\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ bool {\bf eo\-Hoist\-Mutation}$<$ FType, Node $>$::operator() ({\bf Eo\-Type} \& {\em \_\-eo1})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_hoist_mutation_a3}
+
+
+Mutate an individual. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-eo1}]The individual that is to be changed \end{description}
+\end{Desc}
+
+
+Definition at line 358 of file eo\-Parse\-Tree\-Op.h.
+
+References eo\-Rng::random().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Parse\-Tree\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_how_many.eps b/trunk/paradiseo-eo/doc/latex/classeo_how_many.eps
new file mode 100644
index 000000000..8cc506517
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_how_many.eps
@@ -0,0 +1,203 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 659.341
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 0.758333 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 3 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoHowMany) cw
+(eoPersistent) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoHowMany) 0 0 box
+ (eoPersistent) 0 1 box
+ (eoPrintable) 0 2 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_how_many.tex b/trunk/paradiseo-eo/doc/latex/classeo_how_many.tex
new file mode 100644
index 000000000..ad6521a91
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_how_many.tex
@@ -0,0 +1,146 @@
+\section{eo\-How\-Many Class Reference}
+\label{classeo_how_many}\index{eoHowMany@{eoHowMany}}
+A helper class, to determine a number of individuals from another one Typically, is used in selection / replacement procedures, e.g.  
+
+
+{\tt \#include $<$eo\-How\-Many.h$>$}
+
+Inheritance diagram for eo\-How\-Many::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3cm]{classeo_how_many}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-How\-Many} (double \_\-rate=0.0, bool \_\-interpret\_\-as\_\-rate=true)
+\begin{CompactList}\small\item\em Original Ctor from direct rate + bool. \item\end{CompactList}\item 
+{\bf eo\-How\-Many} (int \_\-combien)\label{classeo_how_many_a1}
+
+\begin{CompactList}\small\item\em Ctor from an int - both from int and unsigned int are needed to avoid ambiguity with the Ctor from a double. \item\end{CompactList}\item 
+{\bf eo\-How\-Many} (unsigned int \_\-combien)\label{classeo_how_many_a2}
+
+\begin{CompactList}\small\item\em Ctor from an unsigned int - both from int and unsigned int are needed to avoid ambiguity with the Ctor from a double. \item\end{CompactList}\item 
+virtual {\bf $\sim$eo\-How\-Many} ()\label{classeo_how_many_a3}
+
+\begin{CompactList}\small\item\em Virtual dtor. They are needed in virtual class hierarchies. \item\end{CompactList}\item 
+unsigned int {\bf operator()} (unsigned int \_\-size)
+\begin{CompactList}\small\item\em Does what it was designed for combien==0 : return rate$\ast$\_\-size else combien$>$0 : return combien (regardless of \_\-size) combien$<$0 : return \_\-size-$|$combien$|$. \item\end{CompactList}\item 
+virtual void {\bf print\-On} (std::ostream \&\_\-os) const 
+\begin{CompactList}\small\item\em Write object. \item\end{CompactList}\item 
+virtual void {\bf read\-From} (std::istream \&\_\-is)
+\begin{CompactList}\small\item\em Read object. \item\end{CompactList}\item 
+void {\bf read\-From} (std::string \_\-value)\label{classeo_how_many_a7}
+
+\item 
+{\bf eo\-How\-Many} {\bf operator-} ()\label{classeo_how_many_a8}
+
+\begin{CompactList}\small\item\em The unary - operator: reverses the computation. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf rate}\label{classeo_how_many_r0}
+
+\item 
+int {\bf combien}\label{classeo_how_many_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+A helper class, to determine a number of individuals from another one Typically, is used in selection / replacement procedures, e.g. 
+
+the number of offspring from the number of parents, or the number of survivors for an {\bf eo\-Reduce}{\rm (p.\,\pageref{classeo_reduce})} functor, ...
+
+Such construct is very useful because in some cases you might not know the population size that will enter the replacement. For instance, you cannot simply have a pre-computed (double) rate of 1/pop\-Size if you want to select or kill just 1 guy. Using an eo\-How\-Many allows one to modify the population size without touching anything else.
+
+There are 4 possible way to compute the return value from the argument:\begin{itemize}
+\item an absolute POSITIVE integer --$>$ return it (regardless of popsize)\item a POSITIVE rate --$>$ return rate$\ast$pop\-Size\item an absolute NEGATIVE integer --$>$ return popsize-rate (if positive)\item a NEGATIVE rate in [-1,0] --$>$ store and use 1-$|$rate$|$ (positive) Note that a negative rate should be have been necessary because a rate is relative, but it is there for consistency reasons - and because it is needed in {\tt eo\-G3Replacement}\end{itemize}
+
+
+It has 2 private members, a double and an integer to cover all cases
+
+Example use: in {\tt eo\-General\-Breeder.h} Example reading from parser: in {\tt do/make\_\-algo\_\-scalar.h line 141}
+
+MS 10/04/2002: Added the possibility to have a negative number - when treated as a number: returns then (size - combien) Should not modify anything when a positive number is passed in the ctor
+
+MS 20/06/2002: Added the negative rate and the {\bf operator-()}{\rm (p.\,\pageref{classeo_how_many_a8})} (for eo\-G3Repalcement)
+
+It is an {\bf eo\-Persistent}{\rm (p.\,\pageref{classeo_persistent})} because we need to be able to use eo\-Param\-Value$<$eo\-How\-Many$>$ 
+
+
+
+Definition at line 69 of file eo\-How\-Many.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoHowMany@{eo\-How\-Many}!eoHowMany@{eoHowMany}}
+\index{eoHowMany@{eoHowMany}!eoHowMany@{eo\-How\-Many}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}eo\-How\-Many::eo\-How\-Many (double {\em \_\-rate} = {\tt 0.0}, bool {\em \_\-interpret\_\-as\_\-rate} = {\tt true})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_how_many_a0}
+
+
+Original Ctor from direct rate + bool. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em rate}]the rate, OR the integer to store, depending on 2nd arg. \item[{\em \_\-interpret\_\-as\_\-rate}]to tell whether the rate actually is a rate \end{description}
+\end{Desc}
+
+
+Definition at line 76 of file eo\-How\-Many.h.
+
+\subsection{Member Function Documentation}
+\index{eoHowMany@{eo\-How\-Many}!operator()@{operator()}}
+\index{operator()@{operator()}!eoHowMany@{eo\-How\-Many}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}unsigned int eo\-How\-Many::operator() (unsigned int {\em \_\-size})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_how_many_a4}
+
+
+Does what it was designed for combien==0 : return rate$\ast$\_\-size else combien$>$0 : return combien (regardless of \_\-size) combien$<$0 : return \_\-size-$|$combien$|$. 
+
+\begin{itemize}
+\item $\ast$ - $\ast$ - $\ast$ - \end{itemize}
+
+
+Definition at line 114 of file eo\-How\-Many.h.\index{eoHowMany@{eo\-How\-Many}!printOn@{printOn}}
+\index{printOn@{printOn}!eoHowMany@{eo\-How\-Many}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}virtual void eo\-How\-Many::print\-On (std::ostream \& {\em \_\-os}) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_how_many_a5}
+
+
+Write object. 
+
+It's called print\-On since it prints the object on a stream. \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-os}]A std::ostream. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Printable} {\rm (p.\,\pageref{classeo_printable_a1})}.
+
+Definition at line 130 of file eo\-How\-Many.h.\index{eoHowMany@{eo\-How\-Many}!readFrom@{readFrom}}
+\index{readFrom@{readFrom}!eoHowMany@{eo\-How\-Many}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}virtual void eo\-How\-Many::read\-From (std::istream \& {\em \_\-is})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_how_many_a6}
+
+
+Read object. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-is}]A std::istream. \end{description}
+\end{Desc}
+\begin{Desc}
+\item[Exceptions:]
+\begin{description}
+\item[{\em runtime\_\-std::exception}]If a valid object can't be read. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Persistent} {\rm (p.\,\pageref{classeo_persistent_a1})}.
+
+Definition at line 140 of file eo\-How\-Many.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-How\-Many.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_incrementor.eps b/trunk/paradiseo-eo/doc/latex/classeo_incrementor.eps
new file mode 100644
index 000000000..2ba20848e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_incrementor.eps
@@ -0,0 +1,209 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 606.061
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 0.825 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoIncrementor< T >) cw
+(eoUpdater) cw
+(eoF< void >) cw
+(eoFunctorBase) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoIncrementor< T >) 0 0 box
+ (eoUpdater) 0 1 box
+ (eoF< void >) 0 2 box
+ (eoFunctorBase) 0 3 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 0 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_incrementor.tex b/trunk/paradiseo-eo/doc/latex/classeo_incrementor.tex
new file mode 100644
index 000000000..f7598a98f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_incrementor.tex
@@ -0,0 +1,48 @@
+\section{eo\-Incrementor$<$ T $>$ Class Template Reference}
+\label{classeo_incrementor}\index{eoIncrementor@{eoIncrementor}}
+an {\bf eo\-Updater}{\rm (p.\,\pageref{classeo_updater})} that simply increments a counter  
+
+
+{\tt \#include $<$eo\-Updater.h$>$}
+
+Inheritance diagram for eo\-Incrementor$<$ T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_incrementor}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Incrementor} (T \&\_\-counter, T \_\-stepsize=1)\label{classeo_incrementor_a0}
+
+\begin{CompactList}\small\item\em Default Ctor - requires a reference to the thing to increment. \item\end{CompactList}\item 
+virtual void {\bf operator()} ()\label{classeo_incrementor_a1}
+
+\begin{CompactList}\small\item\em Simply increments. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} (void) const \label{classeo_incrementor_a2}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+T \& {\bf counter}\label{classeo_incrementor_r0}
+
+\item 
+T {\bf stepsize}\label{classeo_incrementor_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class T$>$ class eo\-Incrementor$<$ T $>$}
+
+an {\bf eo\-Updater}{\rm (p.\,\pageref{classeo_updater})} that simply increments a counter 
+
+
+
+Definition at line 50 of file eo\-Updater.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Updater.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_incrementor_param.eps b/trunk/paradiseo-eo/doc/latex/classeo_incrementor_param.eps
new file mode 100644
index 000000000..90d9e146d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_incrementor_param.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 238.095
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.1 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoIncrementorParam< T >) cw
+(eoUpdater) cw
+(eoValueParam< T >) cw
+(eoF< void >) cw
+(eoParam) cw
+(eoFunctorBase) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoIncrementorParam< T >) 0.5 0 box
+ (eoUpdater) 0 1 box
+ (eoValueParam< T >) 1 1 box
+ (eoF< void >) 0 2 box
+ (eoParam) 1 2 box
+ (eoFunctorBase) 0 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+0 1 1 conn
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 1 1 in
+solid
+0 1 1 out
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 1 2 in
+solid
+1 0 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_incrementor_param.tex b/trunk/paradiseo-eo/doc/latex/classeo_incrementor_param.tex
new file mode 100644
index 000000000..7db55e891
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_incrementor_param.tex
@@ -0,0 +1,48 @@
+\section{eo\-Incrementor\-Param$<$ T $>$ Class Template Reference}
+\label{classeo_incrementor_param}\index{eoIncrementorParam@{eoIncrementorParam}}
+an {\bf eo\-Updater}{\rm (p.\,\pageref{classeo_updater})} that is an {\bf eo\-Value\-Param}{\rm (p.\,\pageref{classeo_value_param})} (and thus OWNS its counter) Mandatory for generation counter in make\_\-checkpoint  
+
+
+{\tt \#include $<$eo\-Updater.h$>$}
+
+Inheritance diagram for eo\-Incrementor\-Param$<$ T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_incrementor_param}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Incrementor\-Param} (std::string \_\-name, T \_\-stepsize=1)\label{classeo_incrementor_param_a0}
+
+\begin{CompactList}\small\item\em Default Ctor : a name and optionally an increment. \item\end{CompactList}\item 
+{\bf eo\-Incrementor\-Param} (std::string \_\-name, T \_\-count\-Value, T \_\-stepsize)\label{classeo_incrementor_param_a1}
+
+\begin{CompactList}\small\item\em Ctor with a name and non-zero initial value and mandatory step\-Size to remove ambiguity. \item\end{CompactList}\item 
+virtual void {\bf operator()} ()\label{classeo_incrementor_param_a2}
+
+\begin{CompactList}\small\item\em Simply increments. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} (void) const \label{classeo_incrementor_param_a3}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+T {\bf stepsize}\label{classeo_incrementor_param_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class T$>$ class eo\-Incrementor\-Param$<$ T $>$}
+
+an {\bf eo\-Updater}{\rm (p.\,\pageref{classeo_updater})} that is an {\bf eo\-Value\-Param}{\rm (p.\,\pageref{classeo_value_param})} (and thus OWNS its counter) Mandatory for generation counter in make\_\-checkpoint 
+
+
+
+Definition at line 71 of file eo\-Updater.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Updater.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_init.eps b/trunk/paradiseo-eo/doc/latex/classeo_init.eps
new file mode 100644
index 000000000..36ca1fc87
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_init.eps
@@ -0,0 +1,245 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 99.5025
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.025 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 5 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoInit< EOT >) cw
+(eoUF< EOT &, void >) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, void >) cw
+(eoCombinedInit< EOT >) cw
+(eoDistribution< EOT >) cw
+(eoInitFixedLength< EOT >) cw
+(eoInitVariableLength< EOT >) cw
+(eoRealInitBounded< EOT >) cw
+(eoPBILDistrib< EOT >) cw
+(eoEsChromInit< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoInit< EOT >) 2 2 box
+ (eoUF< EOT &, void >) 2 3 box
+ (eoFunctorBase) 1.5 4 box
+ (unary_function< EOT &, void >) 2.5 4 box
+ (eoCombinedInit< EOT >) 0 1 box
+ (eoDistribution< EOT >) 1 1 box
+ (eoInitFixedLength< EOT >) 2 1 box
+ (eoInitVariableLength< EOT >) 3 1 box
+ (eoRealInitBounded< EOT >) 4 1 box
+ (eoPBILDistrib< EOT >) 1 0 box
+ (eoEsChromInit< EOT >) 4 0 box
+
+% ----- relations -----
+
+solid
+0 2 2 out
+solid
+1 2 3 in
+solid
+0 2 3 out
+solid
+1.5 2.5 4 conn
+solid
+1 1.5 4 in
+solid
+1 2.5 4 in
+solid
+1 2 1.25 out
+solid
+0 4 2 conn
+solid
+0 0 1.75 in
+solid
+0 1 1.75 in
+solid
+1 1 0.25 out
+solid
+0 2 1.75 in
+solid
+0 3 1.75 in
+solid
+0 4 1.75 in
+solid
+1 4 0.25 out
+solid
+0 1 0.75 in
+solid
+0 4 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_init.tex b/trunk/paradiseo-eo/doc/latex/classeo_init.tex
new file mode 100644
index 000000000..7dd8a9669
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_init.tex
@@ -0,0 +1,52 @@
+\section{eo\-Init$<$ EOT $>$ Class Template Reference}
+\label{classeo_init}\index{eoInit@{eoInit}}
+Base (name) class for Initialization of chromosomes, used in a population contructor.  
+
+
+{\tt \#include $<$eo\-Init.h$>$}
+
+Inheritance diagram for eo\-Init$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.78607cm]{classeo_init}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual std::string {\bf class\-Name} (void) const 
+\begin{CompactList}\small\item\em class\-Name: Mandatory because of {\bf eo\-Combined\-Init}{\rm (p.\,\pageref{classeo_combined_init})}. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Init$<$ EOT $>$}
+
+Base (name) class for Initialization of chromosomes, used in a population contructor. 
+
+It is derived from {\bf eo\-Mon\-Op}{\rm (p.\,\pageref{classeo_mon_op})}, so it can be used inside the algorithm as well.
+
+\begin{Desc}
+\item[See also:]{\bf eo\-Pop}{\rm (p.\,\pageref{classeo_pop})} \end{Desc}
+
+
+
+
+Definition at line 45 of file eo\-Init.h.
+
+\subsection{Member Function Documentation}
+\index{eoInit@{eo\-Init}!className@{className}}
+\index{className@{className}!eoInit@{eo\-Init}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ virtual std::string {\bf eo\-Init}$<$ {\bf EOT} $>$::class\-Name (void) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_init_a0}
+
+
+class\-Name: Mandatory because of {\bf eo\-Combined\-Init}{\rm (p.\,\pageref{classeo_combined_init})}. 
+
+SHould be pure virtual, but then we should go over the whole code to write the method for all derived classes ... MS 16/7/04 
+
+Reimplemented in {\bf eo\-Combined\-Init$<$ EOT $>$} {\rm (p.\,\pageref{classeo_combined_init_a4})}, {\bf eo\-PBILDistrib$<$ EOT $>$} {\rm (p.\,\pageref{classeo_p_b_i_l_distrib_a6})}, {\bf eo\-Parse\-Tree\-Depth\-Init$<$ FType, Node $>$} {\rm (p.\,\pageref{classeo_parse_tree_depth_init_a1})}, and {\bf eo\-St\-Parse\-Tree\-Depth\-Init$<$ FType, Node $>$} {\rm (p.\,\pageref{classeo_st_parse_tree_depth_init_a1})}.
+
+Definition at line 52 of file eo\-Init.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Init.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_init_adaptor.eps b/trunk/paradiseo-eo/doc/latex/classeo_init_adaptor.eps
new file mode 100644
index 000000000..df81dfd39
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_init_adaptor.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 132.67
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.76875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoInitAdaptor< EOT >) cw
+(eoMonOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoUF< EOT &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoInitAdaptor< EOT >) 0.5 0 box
+ (eoMonOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoUF< EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_init_adaptor.tex b/trunk/paradiseo-eo/doc/latex/classeo_init_adaptor.tex
new file mode 100644
index 000000000..9db9eccf7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_init_adaptor.tex
@@ -0,0 +1,46 @@
+\section{eo\-Init\-Adaptor$<$ EOT $>$ Class Template Reference}
+\label{classeo_init_adaptor}\index{eoInitAdaptor@{eoInitAdaptor}}
+eo\-Init\-Adaptor changes the place in the hierarchy from {\bf eo\-Init}{\rm (p.\,\pageref{classeo_init})} to {\bf eo\-Mon\-Op}{\rm (p.\,\pageref{classeo_mon_op})}.  
+
+
+{\tt \#include $<$eo\-Init.h$>$}
+
+Inheritance diagram for eo\-Init\-Adaptor$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.71476cm]{classeo_init_adaptor}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Init\-Adaptor} ({\bf eo\-Init}$<$ {\bf EOT} $>$ \&\_\-init)\label{classeo_init_adaptor_a0}
+
+\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eot)\label{classeo_init_adaptor_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Init}$<$ {\bf EOT} $>$ \& {\bf init}\label{classeo_init_adaptor_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Init\-Adaptor$<$ EOT $>$}
+
+eo\-Init\-Adaptor changes the place in the hierarchy from {\bf eo\-Init}{\rm (p.\,\pageref{classeo_init})} to {\bf eo\-Mon\-Op}{\rm (p.\,\pageref{classeo_mon_op})}. 
+
+This is mainly a type conversion, nothing else \begin{Desc}
+\item[See also:]{\bf eo\-Init}{\rm (p.\,\pageref{classeo_init})}, {\bf eo\-Mon\-Op}{\rm (p.\,\pageref{classeo_mon_op})} \end{Desc}
+
+
+
+
+Definition at line 157 of file eo\-Init.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Init.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_init_fixed_length.eps b/trunk/paradiseo-eo/doc/latex/classeo_init_fixed_length.eps
new file mode 100644
index 000000000..9c47cdb03
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_init_fixed_length.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 199.005
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.5125 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoInitFixedLength< EOT >) cw
+(eoInit< EOT >) cw
+(eoUF< EOT &, void >) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoInitFixedLength< EOT >) 0.5 0 box
+ (eoInit< EOT >) 0.5 1 box
+ (eoUF< EOT &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< EOT &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_init_fixed_length.tex b/trunk/paradiseo-eo/doc/latex/classeo_init_fixed_length.tex
new file mode 100644
index 000000000..f14e3788b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_init_fixed_length.tex
@@ -0,0 +1,51 @@
+\section{eo\-Init\-Fixed\-Length$<$ EOT $>$ Class Template Reference}
+\label{classeo_init_fixed_length}\index{eoInitFixedLength@{eoInitFixedLength}}
+Initializer for fixed length representations with a single type.  
+
+
+{\tt \#include $<$eo\-Init.h$>$}
+
+Inheritance diagram for eo\-Init\-Fixed\-Length$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_init_fixed_length}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Atom\-Type {\bf Atom\-Type}\label{classeo_init_fixed_length_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Init\-Fixed\-Length} (unsigned \_\-combien, {\bf eo\-Rnd\-Generator}$<$ Atom\-Type $>$ \&\_\-generator)\label{classeo_init_fixed_length_a0}
+
+\item 
+virtual void {\bf operator()} ({\bf EOT} \&chrom)\label{classeo_init_fixed_length_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf combien}\label{classeo_init_fixed_length_r0}
+
+\item 
+{\bf eo\-STLF}$<$ Atom\-Type $>$ {\bf generator}\label{classeo_init_fixed_length_r1}
+
+\begin{CompactList}\small\item\em generic wrapper for eo\-Functor (s), to make them have the function-pointer style copy semantics \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Init\-Fixed\-Length$<$ EOT $>$}
+
+Initializer for fixed length representations with a single type. 
+
+
+
+Definition at line 81 of file eo\-Init.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Init.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_init_generator.eps b/trunk/paradiseo-eo/doc/latex/classeo_init_generator.eps
new file mode 100644
index 000000000..10b433b2a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_init_generator.eps
@@ -0,0 +1,203 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 384.615
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.3 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 3 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoInitGenerator< EOT >) cw
+(eoF< EOT >) cw
+(eoFunctorBase) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoInitGenerator< EOT >) 0 0 box
+ (eoF< EOT >) 0 1 box
+ (eoFunctorBase) 0 2 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_init_generator.tex b/trunk/paradiseo-eo/doc/latex/classeo_init_generator.tex
new file mode 100644
index 000000000..7236a0a7f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_init_generator.tex
@@ -0,0 +1,42 @@
+\section{eo\-Init\-Generator$<$ EOT $>$ Class Template Reference}
+\label{classeo_init_generator}\index{eoInitGenerator@{eoInitGenerator}}
+turning an {\bf eo\-Init}{\rm (p.\,\pageref{classeo_init})} into a generator probably we should only use genrators - and suppress {\bf eo\-Init}{\rm (p.\,\pageref{classeo_init})} ??? MS - July 2001  
+
+
+{\tt \#include $<$eo\-Init.h$>$}
+
+Inheritance diagram for eo\-Init\-Generator$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3cm]{classeo_init_generator}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Init\-Generator} ({\bf eo\-Init}$<$ {\bf EOT} $>$ \&\_\-init)\label{classeo_init_generator_a0}
+
+\begin{CompactList}\small\item\em Ctor from a plain {\bf eo\-Init}{\rm (p.\,\pageref{classeo_init})}. \item\end{CompactList}\item 
+virtual {\bf EOT} {\bf operator()} ()\label{classeo_init_generator_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Init}$<$ {\bf EOT} $>$ \& {\bf init}\label{classeo_init_generator_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Init\-Generator$<$ EOT $>$}
+
+turning an {\bf eo\-Init}{\rm (p.\,\pageref{classeo_init})} into a generator probably we should only use genrators - and suppress {\bf eo\-Init}{\rm (p.\,\pageref{classeo_init})} ??? MS - July 2001 
+
+
+
+Definition at line 60 of file eo\-Init.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Init.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_init_variable_length.eps b/trunk/paradiseo-eo/doc/latex/classeo_init_variable_length.eps
new file mode 100644
index 000000000..360cdb4ee
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_init_variable_length.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 199.005
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.5125 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoInitVariableLength< EOT >) cw
+(eoInit< EOT >) cw
+(eoUF< EOT &, void >) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoInitVariableLength< EOT >) 0.5 0 box
+ (eoInit< EOT >) 0.5 1 box
+ (eoUF< EOT &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< EOT &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_init_variable_length.tex b/trunk/paradiseo-eo/doc/latex/classeo_init_variable_length.tex
new file mode 100644
index 000000000..5b8eacd26
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_init_variable_length.tex
@@ -0,0 +1,57 @@
+\section{eo\-Init\-Variable\-Length$<$ EOT $>$ Class Template Reference}
+\label{classeo_init_variable_length}\index{eoInitVariableLength@{eoInitVariableLength}}
+Initializer for variable length representations with a single type.  
+
+
+{\tt \#include $<$eo\-Init.h$>$}
+
+Inheritance diagram for eo\-Init\-Variable\-Length$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_init_variable_length}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Atom\-Type {\bf Atom\-Type}\label{classeo_init_variable_length_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Init\-Variable\-Length} (unsigned \_\-min\-Size, unsigned \_\-max\-Size, {\bf eo\-Init}$<$ Atom\-Type $>$ \&\_\-init)\label{classeo_init_variable_length_a0}
+
+\begin{CompactList}\small\item\em Ctor from an {\bf eo\-Init}{\rm (p.\,\pageref{classeo_init})}. \item\end{CompactList}\item 
+virtual void {\bf operator()} ({\bf EOT} \&\_\-chrom)\label{classeo_init_variable_length_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\item 
+{\bf eo\-Init}$<$ Atom\-Type $>$ \& {\bf atom\-Init} ()\label{classeo_init_variable_length_a2}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf offset}\label{classeo_init_variable_length_r0}
+
+\item 
+unsigned {\bf extent}\label{classeo_init_variable_length_r1}
+
+\item 
+{\bf eo\-Init}$<$ Atom\-Type $>$ \& {\bf init}\label{classeo_init_variable_length_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Init\-Variable\-Length$<$ EOT $>$}
+
+Initializer for variable length representations with a single type. 
+
+
+
+Definition at line 107 of file eo\-Init.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Init.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_init_virus.eps b/trunk/paradiseo-eo/doc/latex/classeo_init_virus.eps
new file mode 100644
index 000000000..50c8b30fd
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_init_virus.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 150.943
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.3125 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoInitVirus< FitT >) cw
+(eoInit< eoVirus< FitT > >) cw
+(eoUF< eoVirus< FitT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< eoVirus< FitT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoInitVirus< FitT >) 0.5 0 box
+ (eoInit< eoVirus< FitT > >) 0.5 1 box
+ (eoUF< eoVirus< FitT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< eoVirus< FitT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_init_virus.tex b/trunk/paradiseo-eo/doc/latex/classeo_init_virus.tex
new file mode 100644
index 000000000..3a28dd1fa
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_init_virus.tex
@@ -0,0 +1,45 @@
+\section{eo\-Init\-Virus$<$ Fit\-T $>$ Class Template Reference}
+\label{classeo_init_virus}\index{eoInitVirus@{eoInitVirus}}
+Initializer for binary chromosome with MGE.  
+
+
+{\tt \#include $<$eo\-Init\-Virus.h$>$}
+
+Inheritance diagram for eo\-Init\-Virus$<$ Fit\-T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_init_virus}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Init\-Virus} (unsigned \_\-combien, {\bf eo\-Rnd\-Generator}$<$ bool $>$ \&\_\-generator)\label{classeo_init_virus_a0}
+
+\item 
+virtual void {\bf operator()} (eo\-Virus$<$ {\bf Fit\-T} $>$ \&chrom)\label{classeo_init_virus_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf combien}\label{classeo_init_virus_r0}
+
+\item 
+{\bf eo\-STLF}$<$ bool $>$ {\bf generator}\label{classeo_init_virus_r1}
+
+\begin{CompactList}\small\item\em generic wrapper for eo\-Functor (s), to make them have the function-pointer style copy semantics \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Fit\-T$>$ class eo\-Init\-Virus$<$ Fit\-T $>$}
+
+Initializer for binary chromosome with MGE. 
+
+
+
+Definition at line 41 of file eo\-Init\-Virus.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Init\-Virus.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_init_virus1bit.eps b/trunk/paradiseo-eo/doc/latex/classeo_init_virus1bit.eps
new file mode 100644
index 000000000..6b478271a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_init_virus1bit.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 150.943
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.3125 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoInitVirus1bit< FitT >) cw
+(eoInit< eoVirus< FitT > >) cw
+(eoUF< eoVirus< FitT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< eoVirus< FitT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoInitVirus1bit< FitT >) 0.5 0 box
+ (eoInit< eoVirus< FitT > >) 0.5 1 box
+ (eoUF< eoVirus< FitT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< eoVirus< FitT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_init_virus1bit.tex b/trunk/paradiseo-eo/doc/latex/classeo_init_virus1bit.tex
new file mode 100644
index 000000000..025059685
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_init_virus1bit.tex
@@ -0,0 +1,45 @@
+\section{eo\-Init\-Virus1bit$<$ Fit\-T $>$ Class Template Reference}
+\label{classeo_init_virus1bit}\index{eoInitVirus1bit@{eoInitVirus1bit}}
+Inits the virus with one bit to the left set to one.  
+
+
+{\tt \#include $<$eo\-Init\-Virus.h$>$}
+
+Inheritance diagram for eo\-Init\-Virus1bit$<$ Fit\-T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_init_virus1bit}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Init\-Virus1bit} (unsigned \_\-combien, {\bf eo\-Rnd\-Generator}$<$ bool $>$ \&\_\-generator)\label{classeo_init_virus1bit_a0}
+
+\item 
+virtual void {\bf operator()} (eo\-Virus$<$ {\bf Fit\-T} $>$ \&chrom)\label{classeo_init_virus1bit_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf combien}\label{classeo_init_virus1bit_r0}
+
+\item 
+{\bf eo\-STLF}$<$ bool $>$ {\bf generator}\label{classeo_init_virus1bit_r1}
+
+\begin{CompactList}\small\item\em generic wrapper for eo\-Functor (s), to make them have the function-pointer style copy semantics \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Fit\-T$>$ class eo\-Init\-Virus1bit$<$ Fit\-T $>$}
+
+Inits the virus with one bit to the left set to one. 
+
+
+
+Definition at line 66 of file eo\-Init\-Virus.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Init\-Virus.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_inner_exchange_quad_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_inner_exchange_quad_op.eps
new file mode 100644
index 000000000..8c6fd2c59
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_inner_exchange_quad_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 105.82
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.725 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoInnerExchangeQuadOp< EOT >) cw
+(eoQuadOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoBF< EOT &, EOT &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< EOT &, EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoInnerExchangeQuadOp< EOT >) 0.5 0 box
+ (eoQuadOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoBF< EOT &, EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< EOT &, EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_inner_exchange_quad_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_inner_exchange_quad_op.tex
new file mode 100644
index 000000000..5c17c459b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_inner_exchange_quad_op.tex
@@ -0,0 +1,56 @@
+\section{eo\-Inner\-Exchange\-Quad\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_inner_exchange_quad_op}\index{eoInnerExchangeQuadOp@{eoInnerExchangeQuadOp}}
+Crossover using an Atom\-Crossover.  
+
+
+{\tt \#include $<$eo\-Variable\-Length\-Crossover.h$>$}
+
+Inheritance diagram for eo\-Inner\-Exchange\-Quad\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.96296cm]{classeo_inner_exchange_quad_op}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Atom\-Type {\bf Atom\-Type}\label{classeo_inner_exchange_quad_op_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Inner\-Exchange\-Quad\-Op} ({\bf eo\-Quad\-Op}$<$ Atom\-Type $>$ \&\_\-op, float \_\-rate=0.5)\label{classeo_inner_exchange_quad_op_a0}
+
+\begin{CompactList}\small\item\em default ctor: requires bounds on number of genes + a rate \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eo1, {\bf EOT} \&\_\-eo2)\label{classeo_inner_exchange_quad_op_a1}
+
+\begin{CompactList}\small\item\em performs the Atom crossover \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_inner_exchange_quad_op_a2}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+float {\bf rate}\label{classeo_inner_exchange_quad_op_r0}
+
+\item 
+{\bf eo\-Quad\-Op}$<$ Atom\-Type $>$ \& {\bf op}\label{classeo_inner_exchange_quad_op_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Inner\-Exchange\-Quad\-Op$<$ EOT $>$}
+
+Crossover using an Atom\-Crossover. 
+
+Probably irrelevant in Variable Length - see {\bf eo\-Fl\-Or\-Bin\-Op.h}{\rm (p.\,\pageref{eo_fl_or_bin_op_8h})} and {\bf eo\-Fl\-Or\-Quad\-Op.h}{\rm (p.\,\pageref{eo_fl_or_quad_op_8h})} for the similar Fixed Length operators 
+
+
+
+Definition at line 172 of file eo\-Variable\-Length\-Crossover.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Variable\-Length\-Crossover.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_int_above_bound.eps b/trunk/paradiseo-eo/doc/latex/classeo_int_above_bound.eps
new file mode 100644
index 000000000..c4ada49fc
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_int_above_bound.eps
@@ -0,0 +1,209 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 666.667
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 0.75 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoIntAboveBound) cw
+(eoIntBounds) cw
+(eoPersistent) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoIntAboveBound) 0 0 box
+ (eoIntBounds) 0 1 box
+ (eoPersistent) 0 2 box
+ (eoPrintable) 0 3 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 0 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_int_above_bound.tex b/trunk/paradiseo-eo/doc/latex/classeo_int_above_bound.tex
new file mode 100644
index 000000000..c813414f7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_int_above_bound.tex
@@ -0,0 +1,115 @@
+\section{eo\-Int\-Above\-Bound Class Reference}
+\label{classeo_int_above_bound}\index{eoIntAboveBound@{eoIntAboveBound}}
+An eo\-Int\-Bound bounded from above only.  
+
+
+{\tt \#include $<$eo\-Int\-Bounds.h$>$}
+
+Inheritance diagram for eo\-Int\-Above\-Bound::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_int_above_bound}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Int\-Above\-Bound} (long int \_\-max=0)\label{classeo_int_above_bound_a1}
+
+\begin{CompactList}\small\item\em Simple bounds = minimum. \item\end{CompactList}\item 
+virtual long int {\bf maximum} () const \label{classeo_int_above_bound_a2}
+
+\begin{CompactList}\small\item\em get maximum value ::exception if does not exist \item\end{CompactList}\item 
+virtual long int {\bf minimum} () const \label{classeo_int_above_bound_a3}
+
+\begin{CompactList}\small\item\em get minimum value ::exception if does not exist \item\end{CompactList}\item 
+virtual long int {\bf range} () const \label{classeo_int_above_bound_a4}
+
+\begin{CompactList}\small\item\em get range ::exception if unbounded \item\end{CompactList}\item 
+virtual double {\bf uniform} ({\bf eo\-Rng} \&\_\-rng=eo::rng) const \label{classeo_int_above_bound_a5}
+
+\begin{CompactList}\small\item\em random generator of uniform numbers in bounds uses same naming convention than eo::rng ::exception if unbounded \item\end{CompactList}\item 
+virtual long int {\bf random} ({\bf eo\-Rng} \&\_\-rng=eo::rng) const \label{classeo_int_above_bound_a6}
+
+\item 
+virtual bool {\bf is\-Bounded} (void) const \label{classeo_int_above_bound_a7}
+
+\begin{CompactList}\small\item\em Self-Test: true if $\ast$$\ast$$\ast$both$\ast$$\ast$$\ast$ a min and a max. \item\end{CompactList}\item 
+virtual bool {\bf has\-No\-Bound\-At\-All} (void) const \label{classeo_int_above_bound_a8}
+
+\begin{CompactList}\small\item\em Self-Test: true if no min $\ast$$\ast$$\ast$and$\ast$$\ast$$\ast$ no max hence no further need to test/truncate/fold anything. \item\end{CompactList}\item 
+virtual bool {\bf is\-Min\-Bounded} (void) const \label{classeo_int_above_bound_a9}
+
+\begin{CompactList}\small\item\em Self-Test: bounded from below??? \item\end{CompactList}\item 
+virtual bool {\bf is\-Max\-Bounded} (void) const \label{classeo_int_above_bound_a10}
+
+\begin{CompactList}\small\item\em Self-Test: bounded from above??? \item\end{CompactList}\item 
+virtual bool {\bf is\-In\-Bounds} (double \_\-r) const \label{classeo_int_above_bound_a11}
+
+\begin{CompactList}\small\item\em Test on a value: is it in bounds? \item\end{CompactList}\item 
+virtual void {\bf folds\-In\-Bounds} (double \&\_\-r) const \label{classeo_int_above_bound_a12}
+
+\begin{CompactList}\small\item\em Put value back into bounds - by folding back and forth. \item\end{CompactList}\item 
+virtual void {\bf truncate} (double \&\_\-r) const \label{classeo_int_above_bound_a13}
+
+\begin{CompactList}\small\item\em Put value back into bounds - by truncating to a boundary value. \item\end{CompactList}\item 
+virtual void {\bf read\-From} (std::istream \&\_\-is)
+\begin{CompactList}\small\item\em Read object. \item\end{CompactList}\item 
+virtual void {\bf print\-On} (std::ostream \&\_\-os) const 
+\begin{CompactList}\small\item\em Write object. \item\end{CompactList}\item 
+virtual {\bf eo\-Int\-Bounds} $\ast$ {\bf dup} () const \label{classeo_int_above_bound_a16}
+
+\begin{CompactList}\small\item\em for memory managements - ugly \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+long int {\bf rep\-Maximum}\label{classeo_int_above_bound_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+An eo\-Int\-Bound bounded from above only. 
+
+
+
+Definition at line 441 of file eo\-Int\-Bounds.h.
+
+\subsection{Member Function Documentation}
+\index{eoIntAboveBound@{eo\-Int\-Above\-Bound}!readFrom@{readFrom}}
+\index{readFrom@{readFrom}!eoIntAboveBound@{eo\-Int\-Above\-Bound}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}virtual void eo\-Int\-Above\-Bound::read\-From (std::istream \& {\em \_\-is})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_int_above_bound_a14}
+
+
+Read object. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-is}]A std::istream. but reading should not be done here, because of bound problems see eo\-Int\-Vector\-Bounds \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Persistent} {\rm (p.\,\pageref{classeo_persistent_a1})}.
+
+Definition at line 512 of file eo\-Int\-Bounds.h.\index{eoIntAboveBound@{eo\-Int\-Above\-Bound}!printOn@{printOn}}
+\index{printOn@{printOn}!eoIntAboveBound@{eo\-Int\-Above\-Bound}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}virtual void eo\-Int\-Above\-Bound::print\-On (std::ostream \& {\em \_\-os}) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_int_above_bound_a15}
+
+
+Write object. 
+
+It's called print\-On since it prints the object on a stream. \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-os}]A std::ostream. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Printable} {\rm (p.\,\pageref{classeo_printable_a1})}.
+
+Definition at line 521 of file eo\-Int\-Bounds.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Int\-Bounds.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_int_below_bound.eps b/trunk/paradiseo-eo/doc/latex/classeo_int_below_bound.eps
new file mode 100644
index 000000000..79316ddbf
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_int_below_bound.eps
@@ -0,0 +1,209 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 683.761
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 0.73125 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoIntBelowBound) cw
+(eoIntBounds) cw
+(eoPersistent) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoIntBelowBound) 0 0 box
+ (eoIntBounds) 0 1 box
+ (eoPersistent) 0 2 box
+ (eoPrintable) 0 3 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 0 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_int_below_bound.tex b/trunk/paradiseo-eo/doc/latex/classeo_int_below_bound.tex
new file mode 100644
index 000000000..dc7d8d771
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_int_below_bound.tex
@@ -0,0 +1,115 @@
+\section{eo\-Int\-Below\-Bound Class Reference}
+\label{classeo_int_below_bound}\index{eoIntBelowBound@{eoIntBelowBound}}
+an eo\-Int\-Bound bounded from below only  
+
+
+{\tt \#include $<$eo\-Int\-Bounds.h$>$}
+
+Inheritance diagram for eo\-Int\-Below\-Bound::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_int_below_bound}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Int\-Below\-Bound} (long int \_\-min=0)\label{classeo_int_below_bound_a1}
+
+\begin{CompactList}\small\item\em Simple bounds = minimum. \item\end{CompactList}\item 
+virtual long int {\bf minimum} () const \label{classeo_int_below_bound_a2}
+
+\begin{CompactList}\small\item\em get minimum value ::exception if does not exist \item\end{CompactList}\item 
+virtual long int {\bf maximum} () const \label{classeo_int_below_bound_a3}
+
+\begin{CompactList}\small\item\em get maximum value ::exception if does not exist \item\end{CompactList}\item 
+virtual long int {\bf range} () const \label{classeo_int_below_bound_a4}
+
+\begin{CompactList}\small\item\em get range ::exception if unbounded \item\end{CompactList}\item 
+virtual double {\bf uniform} ({\bf eo\-Rng} \&\_\-rng=eo::rng) const \label{classeo_int_below_bound_a5}
+
+\begin{CompactList}\small\item\em random generator of uniform numbers in bounds uses same naming convention than eo::rng ::exception if unbounded \item\end{CompactList}\item 
+virtual long int {\bf random} ({\bf eo\-Rng} \&\_\-rng=eo::rng) const \label{classeo_int_below_bound_a6}
+
+\item 
+virtual bool {\bf is\-Bounded} (void) const \label{classeo_int_below_bound_a7}
+
+\begin{CompactList}\small\item\em Self-Test: true if $\ast$$\ast$$\ast$both$\ast$$\ast$$\ast$ a min and a max. \item\end{CompactList}\item 
+virtual bool {\bf has\-No\-Bound\-At\-All} (void) const \label{classeo_int_below_bound_a8}
+
+\begin{CompactList}\small\item\em Self-Test: true if no min $\ast$$\ast$$\ast$and$\ast$$\ast$$\ast$ no max hence no further need to test/truncate/fold anything. \item\end{CompactList}\item 
+virtual bool {\bf is\-Min\-Bounded} (void) const \label{classeo_int_below_bound_a9}
+
+\begin{CompactList}\small\item\em Self-Test: bounded from below??? \item\end{CompactList}\item 
+virtual bool {\bf is\-Max\-Bounded} (void) const \label{classeo_int_below_bound_a10}
+
+\begin{CompactList}\small\item\em Self-Test: bounded from above??? \item\end{CompactList}\item 
+virtual bool {\bf is\-In\-Bounds} (double \_\-r) const \label{classeo_int_below_bound_a11}
+
+\begin{CompactList}\small\item\em Test on a value: is it in bounds? \item\end{CompactList}\item 
+virtual void {\bf folds\-In\-Bounds} (double \&\_\-r) const \label{classeo_int_below_bound_a12}
+
+\begin{CompactList}\small\item\em Put value back into bounds - by folding back and forth. \item\end{CompactList}\item 
+virtual void {\bf truncate} (double \&\_\-r) const \label{classeo_int_below_bound_a13}
+
+\begin{CompactList}\small\item\em Put value back into bounds - by truncating to a boundary value. \item\end{CompactList}\item 
+virtual void {\bf read\-From} (std::istream \&\_\-is)
+\begin{CompactList}\small\item\em Read object. \item\end{CompactList}\item 
+virtual void {\bf print\-On} (std::ostream \&\_\-os) const 
+\begin{CompactList}\small\item\em Write object. \item\end{CompactList}\item 
+virtual {\bf eo\-Int\-Bounds} $\ast$ {\bf dup} () const \label{classeo_int_below_bound_a16}
+
+\begin{CompactList}\small\item\em for memory managements - ugly \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+long int {\bf rep\-Minimum}\label{classeo_int_below_bound_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+an eo\-Int\-Bound bounded from below only 
+
+
+
+Definition at line 344 of file eo\-Int\-Bounds.h.
+
+\subsection{Member Function Documentation}
+\index{eoIntBelowBound@{eo\-Int\-Below\-Bound}!readFrom@{readFrom}}
+\index{readFrom@{readFrom}!eoIntBelowBound@{eo\-Int\-Below\-Bound}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}virtual void eo\-Int\-Below\-Bound::read\-From (std::istream \& {\em \_\-is})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_int_below_bound_a14}
+
+
+Read object. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-is}]A std::istream. but reading should not be done here, because of bound problems see eo\-Int\-Vector\-Bounds \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Persistent} {\rm (p.\,\pageref{classeo_persistent_a1})}.
+
+Definition at line 414 of file eo\-Int\-Bounds.h.\index{eoIntBelowBound@{eo\-Int\-Below\-Bound}!printOn@{printOn}}
+\index{printOn@{printOn}!eoIntBelowBound@{eo\-Int\-Below\-Bound}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}virtual void eo\-Int\-Below\-Bound::print\-On (std::ostream \& {\em \_\-os}) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_int_below_bound_a15}
+
+
+Write object. 
+
+It's called print\-On since it prints the object on a stream. \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-os}]A std::ostream. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Printable} {\rm (p.\,\pageref{classeo_printable_a1})}.
+
+Definition at line 423 of file eo\-Int\-Bounds.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Int\-Bounds.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_int_bounds.eps b/trunk/paradiseo-eo/doc/latex/classeo_int_bounds.eps
new file mode 100644
index 000000000..98dfd1e19
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_int_bounds.eps
@@ -0,0 +1,227 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 119.403
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.1875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 5 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoIntBounds) cw
+(eoPersistent) cw
+(eoPrintable) cw
+(eoGeneralIntBounds) cw
+(eoIntAboveBound) cw
+(eoIntBelowBound) cw
+(eoIntInterval) cw
+(eoIntNoBounds) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoIntBounds) 2 1 box
+ (eoPersistent) 2 2 box
+ (eoPrintable) 2 3 box
+ (eoGeneralIntBounds) 0 0 box
+ (eoIntAboveBound) 1 0 box
+ (eoIntBelowBound) 2 0 box
+ (eoIntInterval) 3 0 box
+ (eoIntNoBounds) 4 0 box
+
+% ----- relations -----
+
+solid
+0 2 1 out
+solid
+1 2 2 in
+solid
+0 2 2 out
+solid
+1 2 3 in
+solid
+1 2 0.25 out
+solid
+0 4 1 conn
+solid
+0 0 0.75 in
+solid
+0 1 0.75 in
+solid
+0 2 0.75 in
+solid
+0 3 0.75 in
+solid
+0 4 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_int_bounds.tex b/trunk/paradiseo-eo/doc/latex/classeo_int_bounds.tex
new file mode 100644
index 000000000..d0b2a29eb
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_int_bounds.tex
@@ -0,0 +1,89 @@
+\section{eo\-Int\-Bounds Class Reference}
+\label{classeo_int_bounds}\index{eoIntBounds@{eoIntBounds}}
+Defines bound classes for real numbers.  
+
+
+{\tt \#include $<$es/eo\-Int\-Bounds.h$>$}
+
+Inheritance diagram for eo\-Int\-Bounds::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.34328cm]{classeo_int_bounds}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual bool {\bf is\-Bounded} (void) const =0\label{classeo_int_bounds_a1}
+
+\begin{CompactList}\small\item\em Self-Test: true if $\ast$$\ast$$\ast$both$\ast$$\ast$$\ast$ a min and a max. \item\end{CompactList}\item 
+virtual bool {\bf has\-No\-Bound\-At\-All} (void) const =0\label{classeo_int_bounds_a2}
+
+\begin{CompactList}\small\item\em Self-Test: true if no min $\ast$$\ast$$\ast$and$\ast$$\ast$$\ast$ no max hence no further need to test/truncate/fold anything. \item\end{CompactList}\item 
+virtual bool {\bf is\-Min\-Bounded} (void) const =0\label{classeo_int_bounds_a3}
+
+\begin{CompactList}\small\item\em Self-Test: bounded from below??? \item\end{CompactList}\item 
+virtual bool {\bf is\-Max\-Bounded} (void) const =0\label{classeo_int_bounds_a4}
+
+\begin{CompactList}\small\item\em Self-Test: bounded from above??? \item\end{CompactList}\item 
+virtual bool {\bf is\-In\-Bounds} (double) const =0\label{classeo_int_bounds_a5}
+
+\begin{CompactList}\small\item\em Test on a value: is it in bounds? \item\end{CompactList}\item 
+virtual void {\bf folds\-In\-Bounds} (double \&) const =0\label{classeo_int_bounds_a6}
+
+\begin{CompactList}\small\item\em Put value back into bounds - by folding back and forth. \item\end{CompactList}\item 
+virtual void {\bf folds\-In\-Bounds} (long int \&i) const \label{classeo_int_bounds_a7}
+
+\begin{CompactList}\small\item\em folds\-In\-Bounds for ints: call the method for double and convert back \item\end{CompactList}\item 
+virtual void {\bf truncate} (double \&) const =0\label{classeo_int_bounds_a8}
+
+\begin{CompactList}\small\item\em Put value back into bounds - by truncating to a boundary value. \item\end{CompactList}\item 
+virtual void {\bf truncate} (long int \&i) const \label{classeo_int_bounds_a9}
+
+\begin{CompactList}\small\item\em truncate for ints: call the method for double and convert back \item\end{CompactList}\item 
+virtual long int {\bf minimum} () const =0\label{classeo_int_bounds_a10}
+
+\begin{CompactList}\small\item\em get minimum value ::exception if does not exist \item\end{CompactList}\item 
+virtual long int {\bf maximum} () const =0\label{classeo_int_bounds_a11}
+
+\begin{CompactList}\small\item\em get maximum value ::exception if does not exist \item\end{CompactList}\item 
+virtual long int {\bf range} () const =0\label{classeo_int_bounds_a12}
+
+\begin{CompactList}\small\item\em get range ::exception if unbounded \item\end{CompactList}\item 
+virtual double {\bf uniform} ({\bf eo\-Rng} \&\_\-rng=eo::rng) const =0\label{classeo_int_bounds_a13}
+
+\begin{CompactList}\small\item\em random generator of uniform numbers in bounds uses same naming convention than eo::rng ::exception if unbounded \item\end{CompactList}\item 
+virtual long int {\bf random} ({\bf eo\-Rng} \&\_\-rng=eo::rng) const =0\label{classeo_int_bounds_a14}
+
+\item 
+virtual {\bf eo\-Int\-Bounds} $\ast$ {\bf dup} () const =0\label{classeo_int_bounds_a15}
+
+\begin{CompactList}\small\item\em for memory managements - ugly \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Defines bound classes for real numbers. 
+
+Scalar type: ------------ Basic class is eo\-Int\-Bounds, a pure virtual.
+
+The following pure virtual methods are to be used in mutations:\begin{itemize}
+\item void folds\-In\-Bounds(long int \&) that folds any value that falls out of the bounds back into the bounds, by bouncing on the limit (if any)\item bool is\-In\-Bounds(long int) that simply says whether or not the argument is in the bounds\item void truncate(long int \&) that set the argument to the bound value it it exceeds it\end{itemize}
+
+
+So mutation can choose\begin{itemize}
+\item iterate trying until they fall in bounds,\item only try once and \char`\"{}restd::pair\char`\"{} by using the folds\-In\-Bounds method\item only try once and restd::pair using the truncate method (will create a huge bias toward the bound if the soluiton is not far from the bounds)\end{itemize}
+
+
+There is also a {\bf uniform()}{\rm (p.\,\pageref{classeo_int_bounds_a13})} method that generates a uniform value (if possible, i.e. if bounded) in the interval.
+
+Derived class are {\bf eo\-Int\-Interval}{\rm (p.\,\pageref{classeo_int_interval})} that holds a minimum and maximum value, {\bf eo\-Int\-No\-Bounds}{\rm (p.\,\pageref{classeo_int_no_bounds})} the \char`\"{}unbounded bounds\char`\"{} (-infinity, +infinity) {\bf eo\-Int\-Below\-Bound}{\rm (p.\,\pageref{classeo_int_below_bound})} the half-bounded interval [min, +infinity) {\bf eo\-Int\-Above\-Bound}{\rm (p.\,\pageref{classeo_int_above_bound})} the half-bounded interval (-infinity, max]
+
+THis file also contains the declaration of $\ast$the$\ast$ global object that is the unbounded bound 
+
+
+
+Definition at line 75 of file eo\-Int\-Bounds.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Int\-Bounds.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_int_interval.eps b/trunk/paradiseo-eo/doc/latex/classeo_int_interval.eps
new file mode 100644
index 000000000..3813a8d47
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_int_interval.eps
@@ -0,0 +1,209 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 898.876
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 0.55625 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoIntInterval) cw
+(eoIntBounds) cw
+(eoPersistent) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoIntInterval) 0 0 box
+ (eoIntBounds) 0 1 box
+ (eoPersistent) 0 2 box
+ (eoPrintable) 0 3 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 0 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_int_interval.tex b/trunk/paradiseo-eo/doc/latex/classeo_int_interval.tex
new file mode 100644
index 000000000..e8bc46585
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_int_interval.tex
@@ -0,0 +1,121 @@
+\section{eo\-Int\-Interval Class Reference}
+\label{classeo_int_interval}\index{eoIntInterval@{eoIntInterval}}
+fully bounded eo\-Int\-Bound == interval  
+
+
+{\tt \#include $<$eo\-Int\-Bounds.h$>$}
+
+Inheritance diagram for eo\-Int\-Interval::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_int_interval}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Int\-Interval} (long int \_\-min=0, long int \_\-max=1)\label{classeo_int_interval_a1}
+
+\begin{CompactList}\small\item\em Simple bounds = minimum and maximum (allowed). \item\end{CompactList}\item 
+virtual long int {\bf minimum} () const \label{classeo_int_interval_a2}
+
+\begin{CompactList}\small\item\em get minimum value ::exception if does not exist \item\end{CompactList}\item 
+virtual long int {\bf maximum} () const \label{classeo_int_interval_a3}
+
+\begin{CompactList}\small\item\em get maximum value ::exception if does not exist \item\end{CompactList}\item 
+virtual long int {\bf range} () const \label{classeo_int_interval_a4}
+
+\begin{CompactList}\small\item\em get range ::exception if unbounded \item\end{CompactList}\item 
+virtual bool {\bf is\-Bounded} (void) const \label{classeo_int_interval_a5}
+
+\begin{CompactList}\small\item\em Self-Test: true if $\ast$$\ast$$\ast$both$\ast$$\ast$$\ast$ a min and a max. \item\end{CompactList}\item 
+virtual bool {\bf has\-No\-Bound\-At\-All} (void) const \label{classeo_int_interval_a6}
+
+\begin{CompactList}\small\item\em Self-Test: true if no min $\ast$$\ast$$\ast$and$\ast$$\ast$$\ast$ no max hence no further need to test/truncate/fold anything. \item\end{CompactList}\item 
+virtual bool {\bf is\-Min\-Bounded} (void) const \label{classeo_int_interval_a7}
+
+\begin{CompactList}\small\item\em Self-Test: bounded from below??? \item\end{CompactList}\item 
+virtual bool {\bf is\-Max\-Bounded} (void) const \label{classeo_int_interval_a8}
+
+\begin{CompactList}\small\item\em Self-Test: bounded from above??? \item\end{CompactList}\item 
+virtual double {\bf uniform} ({\bf eo\-Rng} \&\_\-rng=eo::rng) const \label{classeo_int_interval_a9}
+
+\begin{CompactList}\small\item\em random generator of uniform numbers in bounds uses same naming convention than eo::rng ::exception if unbounded \item\end{CompactList}\item 
+virtual long int {\bf random} ({\bf eo\-Rng} \&\_\-rng=eo::rng) const \label{classeo_int_interval_a10}
+
+\item 
+virtual bool {\bf is\-In\-Bounds} (double \_\-r) const \label{classeo_int_interval_a11}
+
+\begin{CompactList}\small\item\em Test on a value: is it in bounds? \item\end{CompactList}\item 
+virtual void {\bf folds\-In\-Bounds} (double \&\_\-r) const \label{classeo_int_interval_a12}
+
+\begin{CompactList}\small\item\em Put value back into bounds - by folding back and forth. \item\end{CompactList}\item 
+virtual void {\bf truncate} (double \&\_\-r) const \label{classeo_int_interval_a13}
+
+\begin{CompactList}\small\item\em Put value back into bounds - by truncating to a boundary value. \item\end{CompactList}\item 
+virtual void {\bf read\-From} (std::istream \&\_\-is)
+\begin{CompactList}\small\item\em Read object. \item\end{CompactList}\item 
+virtual void {\bf print\-On} (std::ostream \&\_\-os) const 
+\begin{CompactList}\small\item\em Write object. \item\end{CompactList}\item 
+virtual {\bf eo\-Int\-Bounds} $\ast$ {\bf dup} () const \label{classeo_int_interval_a16}
+
+\begin{CompactList}\small\item\em for memory managements - ugly \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+long int {\bf rep\-Minimum}\label{classeo_int_interval_r0}
+
+\item 
+long int {\bf rep\-Maximum}\label{classeo_int_interval_r1}
+
+\item 
+long int {\bf rep\-Range}\label{classeo_int_interval_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+fully bounded eo\-Int\-Bound == interval 
+
+
+
+Definition at line 223 of file eo\-Int\-Bounds.h.
+
+\subsection{Member Function Documentation}
+\index{eoIntInterval@{eo\-Int\-Interval}!readFrom@{readFrom}}
+\index{readFrom@{readFrom}!eoIntInterval@{eo\-Int\-Interval}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}virtual void eo\-Int\-Interval::read\-From (std::istream \& {\em \_\-is})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_int_interval_a14}
+
+
+Read object. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-is}]A std::istream. but reading should not be done here, because of bound problems see eo\-Int\-Vector\-Bounds \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Persistent} {\rm (p.\,\pageref{classeo_persistent_a1})}.
+
+Definition at line 315 of file eo\-Int\-Bounds.h.\index{eoIntInterval@{eo\-Int\-Interval}!printOn@{printOn}}
+\index{printOn@{printOn}!eoIntInterval@{eo\-Int\-Interval}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}virtual void eo\-Int\-Interval::print\-On (std::ostream \& {\em \_\-os}) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_int_interval_a15}
+
+
+Write object. 
+
+It's called print\-On since it prints the object on a stream. \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-os}]A std::ostream. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Printable} {\rm (p.\,\pageref{classeo_printable_a1})}.
+
+Definition at line 324 of file eo\-Int\-Bounds.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Int\-Bounds.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_int_no_bounds.eps b/trunk/paradiseo-eo/doc/latex/classeo_int_no_bounds.eps
new file mode 100644
index 000000000..27a97e5aa
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_int_no_bounds.eps
@@ -0,0 +1,209 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 761.905
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 0.65625 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoIntNoBounds) cw
+(eoIntBounds) cw
+(eoPersistent) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoIntNoBounds) 0 0 box
+ (eoIntBounds) 0 1 box
+ (eoPersistent) 0 2 box
+ (eoPrintable) 0 3 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 0 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_int_no_bounds.tex b/trunk/paradiseo-eo/doc/latex/classeo_int_no_bounds.tex
new file mode 100644
index 000000000..d1048da89
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_int_no_bounds.tex
@@ -0,0 +1,106 @@
+\section{eo\-Int\-No\-Bounds Class Reference}
+\label{classeo_int_no_bounds}\index{eoIntNoBounds@{eoIntNoBounds}}
+A default class for unbounded variables.  
+
+
+{\tt \#include $<$eo\-Int\-Bounds.h$>$}
+
+Inheritance diagram for eo\-Int\-No\-Bounds::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_int_no_bounds}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual bool {\bf is\-Bounded} (void) const \label{classeo_int_no_bounds_a1}
+
+\begin{CompactList}\small\item\em Self-Test: true if $\ast$$\ast$$\ast$both$\ast$$\ast$$\ast$ a min and a max. \item\end{CompactList}\item 
+virtual bool {\bf has\-No\-Bound\-At\-All} (void) const \label{classeo_int_no_bounds_a2}
+
+\begin{CompactList}\small\item\em Self-Test: true if no min $\ast$$\ast$$\ast$and$\ast$$\ast$$\ast$ no max hence no further need to test/truncate/fold anything. \item\end{CompactList}\item 
+virtual bool {\bf is\-Min\-Bounded} (void) const \label{classeo_int_no_bounds_a3}
+
+\begin{CompactList}\small\item\em Self-Test: bounded from below??? \item\end{CompactList}\item 
+virtual bool {\bf is\-Max\-Bounded} (void) const \label{classeo_int_no_bounds_a4}
+
+\begin{CompactList}\small\item\em Self-Test: bounded from above??? \item\end{CompactList}\item 
+virtual void {\bf folds\-In\-Bounds} (double \&) const \label{classeo_int_no_bounds_a5}
+
+\begin{CompactList}\small\item\em Put value back into bounds - by folding back and forth. \item\end{CompactList}\item 
+virtual void {\bf truncate} (double \&) const \label{classeo_int_no_bounds_a6}
+
+\begin{CompactList}\small\item\em Put value back into bounds - by truncating to a boundary value. \item\end{CompactList}\item 
+virtual bool {\bf is\-In\-Bounds} (double) const \label{classeo_int_no_bounds_a7}
+
+\begin{CompactList}\small\item\em Test on a value: is it in bounds? \item\end{CompactList}\item 
+virtual long int {\bf minimum} () const \label{classeo_int_no_bounds_a8}
+
+\begin{CompactList}\small\item\em get minimum value ::exception if does not exist \item\end{CompactList}\item 
+virtual long int {\bf maximum} () const \label{classeo_int_no_bounds_a9}
+
+\begin{CompactList}\small\item\em get maximum value ::exception if does not exist \item\end{CompactList}\item 
+virtual long int {\bf range} () const \label{classeo_int_no_bounds_a10}
+
+\begin{CompactList}\small\item\em get range ::exception if unbounded \item\end{CompactList}\item 
+virtual double {\bf uniform} ({\bf eo\-Rng} \&\_\-rng=eo::rng) const \label{classeo_int_no_bounds_a11}
+
+\begin{CompactList}\small\item\em random generator of uniform numbers in bounds uses same naming convention than eo::rng ::exception if unbounded \item\end{CompactList}\item 
+virtual long int {\bf random} ({\bf eo\-Rng} \&\_\-rng=eo::rng) const \label{classeo_int_no_bounds_a12}
+
+\item 
+virtual void {\bf read\-From} (std::istream \&\_\-is)
+\begin{CompactList}\small\item\em Read object. \item\end{CompactList}\item 
+virtual void {\bf print\-On} (std::ostream \&\_\-os) const 
+\begin{CompactList}\small\item\em Write object. \item\end{CompactList}\item 
+virtual {\bf eo\-Int\-Bounds} $\ast$ {\bf dup} () const \label{classeo_int_no_bounds_a15}
+
+\begin{CompactList}\small\item\em for memory managements - ugly \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+A default class for unbounded variables. 
+
+
+
+Definition at line 153 of file eo\-Int\-Bounds.h.
+
+\subsection{Member Function Documentation}
+\index{eoIntNoBounds@{eo\-Int\-No\-Bounds}!readFrom@{readFrom}}
+\index{readFrom@{readFrom}!eoIntNoBounds@{eo\-Int\-No\-Bounds}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}virtual void eo\-Int\-No\-Bounds::read\-From (std::istream \& {\em \_\-is})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_int_no_bounds_a13}
+
+
+Read object. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-is}]A std::istream. but reading should not be done here, because of bound problems see eo\-Int\-Vector\-Bounds \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Persistent} {\rm (p.\,\pageref{classeo_persistent_a1})}.
+
+Definition at line 195 of file eo\-Int\-Bounds.h.\index{eoIntNoBounds@{eo\-Int\-No\-Bounds}!printOn@{printOn}}
+\index{printOn@{printOn}!eoIntNoBounds@{eo\-Int\-No\-Bounds}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}virtual void eo\-Int\-No\-Bounds::print\-On (std::ostream \& {\em \_\-os}) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_int_no_bounds_a14}
+
+
+Write object. 
+
+It's called print\-On since it prints the object on a stream. \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-os}]A std::ostream. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Printable} {\rm (p.\,\pageref{classeo_printable_a1})}.
+
+Definition at line 204 of file eo\-Int\-Bounds.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Int\-Bounds.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_invalidate_bin_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_invalidate_bin_op.eps
new file mode 100644
index 000000000..bcc487461
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_invalidate_bin_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 92.9152
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.38125 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoInvalidateBinOp< EOT >) cw
+(eoBinOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoBF< EOT &, const EOT &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< EOT &, const EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoInvalidateBinOp< EOT >) 0.5 0 box
+ (eoBinOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoBF< EOT &, const EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< EOT &, const EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_invalidate_bin_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_invalidate_bin_op.tex
new file mode 100644
index 000000000..924155232
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_invalidate_bin_op.tex
@@ -0,0 +1,48 @@
+\section{eo\-Invalidate\-Bin\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_invalidate_bin_op}\index{eoInvalidateBinOp@{eoInvalidateBinOp}}
+One of the invalidator operators.  
+
+
+{\tt \#include $<$eo\-Invalidate\-Ops.h$>$}
+
+Inheritance diagram for eo\-Invalidate\-Bin\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.60163cm]{classeo_invalidate_bin_op}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Invalidate\-Bin\-Op} ({\bf eo\-Bin\-Op}$<$ {\bf EOT} $>$ \&\_\-op)\label{classeo_invalidate_bin_op_a0}
+
+\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eo, const {\bf EOT} \&\_\-eo2)\label{classeo_invalidate_bin_op_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Bin\-Op}$<$ {\bf EOT} $>$ \& {\bf op}\label{classeo_invalidate_bin_op_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Invalidate\-Bin\-Op$<$ EOT $>$}
+
+One of the invalidator operators. 
+
+Use this one as a 'hat' on an operator that is defined to work on a generic datatype. This functor will then check the return type of the operator and invalidate the fitness of the individual.
+
+This functor is used in algorithms that work with straight {\bf eo\-Mon\-Op}{\rm (p.\,\pageref{classeo_mon_op})}, {\bf eo\-Bin\-Op}{\rm (p.\,\pageref{classeo_bin_op})} or {\bf eo\-Quad\-Op}{\rm (p.\,\pageref{classeo_quad_op})} operators, for instance {\bf eo\-SGA}{\rm (p.\,\pageref{classeo_s_g_a})}. Note that {\bf eo\-Gen\-Op}{\rm (p.\,\pageref{classeo_gen_op})} derived operators generally do invalidate the fitness of the objects they have changed.
+
+Return value means \char`\"{}Has\_\-Changed\char`\"{} and not \char`\"{}Needs\_\-To\_\-Be\_\-Invalidated\char`\"{} as successive invalidation are not really a problem 
+
+
+
+Definition at line 80 of file eo\-Invalidate\-Ops.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Invalidate\-Ops.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_invalidate_mon_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_invalidate_mon_op.eps
new file mode 100644
index 000000000..32962b509
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_invalidate_mon_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 132.67
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.76875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoInvalidateMonOp< EOT >) cw
+(eoMonOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoUF< EOT &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoInvalidateMonOp< EOT >) 0.5 0 box
+ (eoMonOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoUF< EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_invalidate_mon_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_invalidate_mon_op.tex
new file mode 100644
index 000000000..e66cd9bf8
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_invalidate_mon_op.tex
@@ -0,0 +1,48 @@
+\section{eo\-Invalidate\-Mon\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_invalidate_mon_op}\index{eoInvalidateMonOp@{eoInvalidateMonOp}}
+One of the invalidator operators.  
+
+
+{\tt \#include $<$eo\-Invalidate\-Ops.h$>$}
+
+Inheritance diagram for eo\-Invalidate\-Mon\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.71476cm]{classeo_invalidate_mon_op}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Invalidate\-Mon\-Op} ({\bf eo\-Mon\-Op}$<$ {\bf EOT} $>$ \&\_\-op)\label{classeo_invalidate_mon_op_a0}
+
+\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eo)\label{classeo_invalidate_mon_op_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Mon\-Op}$<$ {\bf EOT} $>$ \& {\bf op}\label{classeo_invalidate_mon_op_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Invalidate\-Mon\-Op$<$ EOT $>$}
+
+One of the invalidator operators. 
+
+Use this one as a 'hat' on an operator that is defined to work on a generic datatype. This functor will then check the return type of the operator and invalidate the fitness of the individual.
+
+This functor is used in algorithms that work with straight {\bf eo\-Mon\-Op}{\rm (p.\,\pageref{classeo_mon_op})}, {\bf eo\-Bin\-Op}{\rm (p.\,\pageref{classeo_bin_op})} or {\bf eo\-Quad\-Op}{\rm (p.\,\pageref{classeo_quad_op})} operators, for instance {\bf eo\-SGA}{\rm (p.\,\pageref{classeo_s_g_a})}. Note that {\bf eo\-Gen\-Op}{\rm (p.\,\pageref{classeo_gen_op})} derived operators generally do invalidate the fitness of the objects they have changed.
+
+Return value means \char`\"{}Has\_\-Changed\char`\"{} and not \char`\"{}Needs\_\-To\_\-Be\_\-Invalidated\char`\"{} as successive invalidation are not really a problem 
+
+
+
+Definition at line 46 of file eo\-Invalidate\-Ops.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Invalidate\-Ops.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_invalidate_quad_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_invalidate_quad_op.eps
new file mode 100644
index 000000000..e7a49be40
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_invalidate_quad_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 105.82
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.725 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoInvalidateQuadOp< EOT >) cw
+(eoQuadOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoBF< EOT &, EOT &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< EOT &, EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoInvalidateQuadOp< EOT >) 0.5 0 box
+ (eoQuadOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoBF< EOT &, EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< EOT &, EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_invalidate_quad_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_invalidate_quad_op.tex
new file mode 100644
index 000000000..3b442fb35
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_invalidate_quad_op.tex
@@ -0,0 +1,48 @@
+\section{eo\-Invalidate\-Quad\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_invalidate_quad_op}\index{eoInvalidateQuadOp@{eoInvalidateQuadOp}}
+One of the invalidator operators.  
+
+
+{\tt \#include $<$eo\-Invalidate\-Ops.h$>$}
+
+Inheritance diagram for eo\-Invalidate\-Quad\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.96296cm]{classeo_invalidate_quad_op}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Invalidate\-Quad\-Op} ({\bf eo\-Quad\-Op}$<$ {\bf EOT} $>$ \&\_\-op)\label{classeo_invalidate_quad_op_a0}
+
+\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eo1, {\bf EOT} \&\_\-eo2)\label{classeo_invalidate_quad_op_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Quad\-Op}$<$ {\bf EOT} $>$ \& {\bf op}\label{classeo_invalidate_quad_op_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Invalidate\-Quad\-Op$<$ EOT $>$}
+
+One of the invalidator operators. 
+
+Use this one as a 'hat' on an operator that is defined to work on a generic datatype. This functor will then check the return type of the operator and invalidate the fitness of the individual.
+
+This functor is used in algorithms that work with straight {\bf eo\-Mon\-Op}{\rm (p.\,\pageref{classeo_mon_op})}, {\bf eo\-Bin\-Op}{\rm (p.\,\pageref{classeo_bin_op})} or {\bf eo\-Quad\-Op}{\rm (p.\,\pageref{classeo_quad_op})} operators, for instance {\bf eo\-SGA}{\rm (p.\,\pageref{classeo_s_g_a})}. Note that {\bf eo\-Gen\-Op}{\rm (p.\,\pageref{classeo_gen_op})} derived operators generally do invalidate the fitness of the objects they have changed.
+
+Return value means \char`\"{}Has\_\-Changed\char`\"{} and not \char`\"{}Needs\_\-To\_\-Be\_\-Invalidated\char`\"{} as successive invalidation are not really a problem 
+
+
+
+Definition at line 114 of file eo\-Invalidate\-Ops.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Invalidate\-Ops.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_linear_fit_scaling.eps b/trunk/paradiseo-eo/doc/latex/classeo_linear_fit_scaling.eps
new file mode 100644
index 000000000..04d5f4601
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_linear_fit_scaling.eps
@@ -0,0 +1,227 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 90.0901
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.55 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoLinearFitScaling< EOT >) cw
+(eoPerf2Worth< EOT >) cw
+(eoUF< const eoPop< EOT > &, void >) cw
+(eoValueParam< std::vector< double > >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, void >) cw
+(eoParam) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoLinearFitScaling< EOT >) 1.25 0 box
+ (eoPerf2Worth< EOT >) 1.25 1 box
+ (eoUF< const eoPop< EOT > &, void >) 0.5 2 box
+ (eoValueParam< std::vector< double > >) 2 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< const eoPop< EOT > &, void >) 1 3 box
+ (eoParam) 2 3 box
+
+% ----- relations -----
+
+solid
+0 1.25 0 out
+solid
+1 1.25 1 in
+solid
+0 1.25 1 out
+solid
+0.5 2 2 conn
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 2 2 in
+solid
+0 2 2 out
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+1 2 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_linear_fit_scaling.tex b/trunk/paradiseo-eo/doc/latex/classeo_linear_fit_scaling.tex
new file mode 100644
index 000000000..f93875905
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_linear_fit_scaling.tex
@@ -0,0 +1,44 @@
+\section{eo\-Linear\-Fit\-Scaling$<$ EOT $>$ Class Template Reference}
+\label{classeo_linear_fit_scaling}\index{eoLinearFitScaling@{eoLinearFitScaling}}
+An instance of {\bf eo\-Perf2Worth}{\rm (p.\,\pageref{classeo_perf2_worth})} COmputes the linearly scaled fitnesses with given selective pressure Pselect(Best) == pressure/size\-Pop Pselect(average) == 1.0/size\-Pop truncate negative values to 0 -.  
+
+
+{\tt \#include $<$eo\-Linear\-Fit\-Scaling.h$>$}
+
+Inheritance diagram for eo\-Linear\-Fit\-Scaling$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.52252cm]{classeo_linear_fit_scaling}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Linear\-Fit\-Scaling} (double \_\-p=2.0)\label{classeo_linear_fit_scaling_a0}
+
+\item 
+virtual void {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_linear_fit_scaling_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf pressure}\label{classeo_linear_fit_scaling_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Linear\-Fit\-Scaling$<$ EOT $>$}
+
+An instance of {\bf eo\-Perf2Worth}{\rm (p.\,\pageref{classeo_perf2_worth})} COmputes the linearly scaled fitnesses with given selective pressure Pselect(Best) == pressure/size\-Pop Pselect(average) == 1.0/size\-Pop truncate negative values to 0 -. 
+
+to be used within an {\bf eo\-Select\-From\-Worth}{\rm (p.\,\pageref{classeo_select_from_worth})} object 
+
+
+
+Definition at line 43 of file eo\-Linear\-Fit\-Scaling.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Linear\-Fit\-Scaling.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_linear_random_split.eps b/trunk/paradiseo-eo/doc/latex/classeo_linear_random_split.eps
new file mode 100644
index 000000000..57de0cb2c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_linear_random_split.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 107.527
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.65 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoLinearRandomSplit< EOT >) cw
+(eoReduceSplit< EOT >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoLinearRandomSplit< EOT >) 0.5 0 box
+ (eoReduceSplit< EOT >) 0.5 1 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_linear_random_split.tex b/trunk/paradiseo-eo/doc/latex/classeo_linear_random_split.tex
new file mode 100644
index 000000000..3b0978802
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_linear_random_split.tex
@@ -0,0 +1,45 @@
+\section{eo\-Linear\-Random\-Split$<$ EOT $>$ Class Template Reference}
+\label{classeo_linear_random_split}\index{eoLinearRandomSplit@{eoLinearRandomSplit}}
+random truncation - linear version  
+
+
+{\tt \#include $<$eo\-Reduce\-Split.h$>$}
+
+Inheritance diagram for eo\-Linear\-Random\-Split$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.01075cm]{classeo_linear_random_split}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Linear\-Random\-Split} ({\bf eo\-How\-Many} \_\-how\-Many, bool \_\-return\-Eliminated=false)\label{classeo_linear_random_split_a0}
+
+\begin{CompactList}\small\item\em Ctor: must provide amount of reduction, and whether or not you need to return the eliminated guys. \item\end{CompactList}\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-newgen, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-eliminated)\label{classeo_linear_random_split_a1}
+
+\begin{CompactList}\small\item\em do the job \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-How\-Many} {\bf how\-Many}\label{classeo_linear_random_split_r0}
+
+\item 
+bool {\bf return\-Eliminated}\label{classeo_linear_random_split_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Linear\-Random\-Split$<$ EOT $>$}
+
+random truncation - linear version 
+
+
+
+Definition at line 163 of file eo\-Reduce\-Split.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Reduce\-Split.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_linear_truncate.eps b/trunk/paradiseo-eo/doc/latex/classeo_linear_truncate.eps
new file mode 100644
index 000000000..d8d7d8b7f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_linear_truncate.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 123.457
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.05 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoLinearTruncate< EOT >) cw
+(eoReduce< EOT >) cw
+(eoBF< eoPop< EOT > &, unsigned, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, unsigned, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoLinearTruncate< EOT >) 0.5 0 box
+ (eoReduce< EOT >) 0.5 1 box
+ (eoBF< eoPop< EOT > &, unsigned, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< eoPop< EOT > &, unsigned, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_linear_truncate.tex b/trunk/paradiseo-eo/doc/latex/classeo_linear_truncate.tex
new file mode 100644
index 000000000..22612917b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_linear_truncate.tex
@@ -0,0 +1,35 @@
+\section{eo\-Linear\-Truncate$<$ EOT $>$ Class Template Reference}
+\label{classeo_linear_truncate}\index{eoLinearTruncate@{eoLinearTruncate}}
+a truncate class that does not sort, but repeatidely kills the worse.  
+
+
+{\tt \#include $<$eo\-Reduce.h$>$}
+
+Inheritance diagram for eo\-Linear\-Truncate$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.45679cm]{classeo_linear_truncate}
+\end{center}
+\end{figure}
+\subsection*{Private Member Functions}
+\begin{CompactItemize}
+\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-newgen, unsigned \_\-newsize)\label{classeo_linear_truncate_d0}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Linear\-Truncate$<$ EOT $>$}
+
+a truncate class that does not sort, but repeatidely kills the worse. 
+
+To be used in SSGA-like replacements (e.g. see {\bf eo\-SSGAWorse\-Replacement}{\rm (p.\,\pageref{classeo_s_s_g_a_worse_replacement})}) 
+
+
+
+Definition at line 167 of file eo\-Reduce.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Reduce.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_linear_truncate_split.eps b/trunk/paradiseo-eo/doc/latex/classeo_linear_truncate_split.eps
new file mode 100644
index 000000000..e9916798a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_linear_truncate_split.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 107.527
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.65 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoLinearTruncateSplit< EOT >) cw
+(eoReduceSplit< EOT >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoLinearTruncateSplit< EOT >) 0.5 0 box
+ (eoReduceSplit< EOT >) 0.5 1 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_linear_truncate_split.tex b/trunk/paradiseo-eo/doc/latex/classeo_linear_truncate_split.tex
new file mode 100644
index 000000000..b7716387e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_linear_truncate_split.tex
@@ -0,0 +1,47 @@
+\section{eo\-Linear\-Truncate\-Split$<$ EOT $>$ Class Template Reference}
+\label{classeo_linear_truncate_split}\index{eoLinearTruncateSplit@{eoLinearTruncateSplit}}
+a Reduce\-Split class that does not sort, but repeatidely kills the worse.  
+
+
+{\tt \#include $<$eo\-Reduce\-Split.h$>$}
+
+Inheritance diagram for eo\-Linear\-Truncate\-Split$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.01075cm]{classeo_linear_truncate_split}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Linear\-Truncate\-Split} ({\bf eo\-How\-Many} \_\-how\-Many, bool \_\-return\-Eliminated=false)\label{classeo_linear_truncate_split_a0}
+
+\begin{CompactList}\small\item\em Ctor: must provide amount of reduction, and whether or not you need to return the eliminated guys. \item\end{CompactList}\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-newgen, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-eliminated)\label{classeo_linear_truncate_split_a1}
+
+\begin{CompactList}\small\item\em do the job \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-How\-Many} {\bf how\-Many}\label{classeo_linear_truncate_split_r0}
+
+\item 
+bool {\bf return\-Eliminated}\label{classeo_linear_truncate_split_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Linear\-Truncate\-Split$<$ EOT $>$}
+
+a Reduce\-Split class that does not sort, but repeatidely kills the worse. 
+
+To be used in SSGA-like replacements (e.g. see {\bf eo\-SSGAWorse\-Replacement}{\rm (p.\,\pageref{classeo_s_s_g_a_worse_replacement})}) 
+
+
+
+Definition at line 87 of file eo\-Reduce\-Split.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Reduce\-Split.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_m_g_g_replacement.eps b/trunk/paradiseo-eo/doc/latex/classeo_m_g_g_replacement.eps
new file mode 100644
index 000000000..bee144478
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_m_g_g_replacement.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 107.527
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.65 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoMGGReplacement< EOT >) cw
+(eoReplacement< EOT >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoMGGReplacement< EOT >) 0.5 0 box
+ (eoReplacement< EOT >) 0.5 1 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_m_g_g_replacement.tex b/trunk/paradiseo-eo/doc/latex/classeo_m_g_g_replacement.tex
new file mode 100644
index 000000000..8a81ffed5
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_m_g_g_replacement.tex
@@ -0,0 +1,48 @@
+\section{eo\-MGGReplacement$<$ EOT $>$ Class Template Reference}
+\label{classeo_m_g_g_replacement}\index{eoMGGReplacement@{eoMGGReplacement}}
+eo\-MGGReplacement is an {\bf eo\-Replacement}{\rm (p.\,\pageref{classeo_replacement})}: - choose N (2) parents RANDOMLY - remove them from the parent population - select best offspring, add to parents - merge (other?) offspring and the N removed parents - select best N-1 of this merged population (det\-Tournament only at the moment) - put them back into parent population  
+
+
+{\tt \#include $<$eo\-MGGReplacement.h$>$}
+
+Inheritance diagram for eo\-MGGReplacement$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.01075cm]{classeo_m_g_g_replacement}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-MGGReplacement} ({\bf eo\-How\-Many} \_\-how\-Many\-Eliminated\-Parents={\bf eo\-How\-Many}(2, false), unsigned \_\-t\-Size=2)\label{classeo_m_g_g_replacement_a0}
+
+\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-parents, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-offspring)\label{classeo_m_g_g_replacement_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Linear\-Truncate\-Split}$<$ {\bf EOT} $>$ {\bf split}\label{classeo_m_g_g_replacement_r0}
+
+\item 
+{\bf eo\-Plus}$<$ {\bf EOT} $>$ {\bf plus}\label{classeo_m_g_g_replacement_r1}
+
+\item 
+unsigned int {\bf t\-Size}\label{classeo_m_g_g_replacement_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-MGGReplacement$<$ EOT $>$}
+
+eo\-MGGReplacement is an {\bf eo\-Replacement}{\rm (p.\,\pageref{classeo_replacement})}: - choose N (2) parents RANDOMLY - remove them from the parent population - select best offspring, add to parents - merge (other?) offspring and the N removed parents - select best N-1 of this merged population (det\-Tournament only at the moment) - put them back into parent population 
+
+
+
+Definition at line 50 of file eo\-MGGReplacement.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-MGGReplacement.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_m_o_fitness_stat.eps b/trunk/paradiseo-eo/doc/latex/classeo_m_o_fitness_stat.eps
new file mode 100644
index 000000000..32788913c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_m_o_fitness_stat.eps
@@ -0,0 +1,233 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 91.3242
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.475 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoMOFitnessStat< EOT, PartFitT >) cw
+(eoSortedStat< EOT, std::vector< PartFitT > >) cw
+(eoSortedStatBase< EOT >) cw
+(eoValueParam< std::vector< PartFitT > >) cw
+(eoUF< const std::vector< const EOT * > &, void >) cw
+(eoParam) cw
+(eoFunctorBase) cw
+(unary_function< const std::vector< const EOT * > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoMOFitnessStat< EOT, PartFitT >) 1 0 box
+ (eoSortedStat< EOT, std::vector< PartFitT > >) 1 1 box
+ (eoSortedStatBase< EOT >) 0.5 2 box
+ (eoValueParam< std::vector< PartFitT > >) 1.5 2 box
+ (eoUF< const std::vector< const EOT * > &, void >) 0.5 3 box
+ (eoParam) 1.5 3 box
+ (eoFunctorBase) 0 4 box
+ (unary_function< const std::vector< const EOT * > &, void >) 1 4 box
+
+% ----- relations -----
+
+solid
+0 1 0 out
+solid
+1 1 1 in
+solid
+0 1 1 out
+solid
+0.5 1.5 2 conn
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+1 1.5 2 in
+solid
+0 1.5 2 out
+solid
+1 0.5 3 in
+solid
+0 0.5 3 out
+solid
+0 1 4 conn
+solid
+1 1.5 3 in
+solid
+1 0 4 in
+solid
+1 1 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_m_o_fitness_stat.tex b/trunk/paradiseo-eo/doc/latex/classeo_m_o_fitness_stat.tex
new file mode 100644
index 000000000..9917011fd
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_m_o_fitness_stat.tex
@@ -0,0 +1,42 @@
+\section{eo\-MOFitness\-Stat$<$ EOT, Part\-Fit\-T $>$ Class Template Reference}
+\label{classeo_m_o_fitness_stat}\index{eoMOFitnessStat@{eoMOFitnessStat}}
+For multi-objective fitness, we need to translate a stat$<$vector$<$double$>$ $>$ into a vector$<$stat$>$, so each objective gets a seperate stat.  
+
+
+{\tt \#include $<$eo\-MOFitness\-Stat.h$>$}
+
+Inheritance diagram for eo\-MOFitness\-Stat$<$ EOT, Part\-Fit\-T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.55708cm]{classeo_m_o_fitness_stat}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-MOFitness\-Stat} (unsigned \_\-objective, std::string \_\-description=\char`\"{}MO-Fitness\char`\"{})\label{classeo_m_o_fitness_stat_a0}
+
+\begin{CompactList}\small\item\em Ctor: say what component you want. \item\end{CompactList}\item 
+virtual void {\bf operator()} (const std::vector$<$ const {\bf EOT} $\ast$ $>$ \&\_\-pop\-Pters)\label{classeo_m_o_fitness_stat_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned int {\bf objective}\label{classeo_m_o_fitness_stat_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT, class Part\-Fit\-T = double$>$ class eo\-MOFitness\-Stat$<$ EOT, Part\-Fit\-T $>$}
+
+For multi-objective fitness, we need to translate a stat$<$vector$<$double$>$ $>$ into a vector$<$stat$>$, so each objective gets a seperate stat. 
+
+
+
+Definition at line 64 of file eo\-MOFitness\-Stat.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-MOFitness\-Stat.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_merge.eps b/trunk/paradiseo-eo/doc/latex/classeo_merge.eps
new file mode 100644
index 000000000..ac79cd652
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_merge.eps
@@ -0,0 +1,209 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 69.6056
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 7.18333 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 3 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoMerge< Chrom >) cw
+(eoBF< const eoPop< Chrom > &, eoPop< Chrom > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< const eoPop< Chrom > &, eoPop< Chrom > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoMerge< Chrom >) 0.5 0 box
+ (eoBF< const eoPop< Chrom > &, eoPop< Chrom > &, void >) 0.5 1 box
+ (eoFunctorBase) 0 2 box
+ (binary_function< const eoPop< Chrom > &, eoPop< Chrom > &, void >) 1 2 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_merge.tex b/trunk/paradiseo-eo/doc/latex/classeo_merge.tex
new file mode 100644
index 000000000..6e7fef983
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_merge.tex
@@ -0,0 +1,31 @@
+\section{eo\-Merge$<$ Chrom $>$ Class Template Reference}
+\label{classeo_merge}\index{eoMerge@{eoMerge}}
+eo\-Merge: Base class for elitist replacement algorithms.  
+
+
+{\tt \#include $<$eo\-Merge.h$>$}
+
+Inheritance diagram for eo\-Merge$<$ Chrom $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=1.94896cm]{classeo_merge}
+\end{center}
+\end{figure}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Chrom$>$ class eo\-Merge$<$ Chrom $>$}
+
+eo\-Merge: Base class for elitist replacement algorithms. 
+
+Merges the old population (first argument), with the new generation
+
+Its signature is exactly that of the selection base {\bf eo\-Select}{\rm (p.\,\pageref{classeo_select})}, but its purpose is to merge the two populations into one (the second argument). Note that the algorithms assume that the second argument denotes the next generation. 
+
+
+
+Definition at line 48 of file eo\-Merge.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Merge.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_merge_reduce.eps b/trunk/paradiseo-eo/doc/latex/classeo_merge_reduce.eps
new file mode 100644
index 000000000..d28657e6d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_merge_reduce.eps
@@ -0,0 +1,231 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 89.6057
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.58 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoMergeReduce< EOT >) cw
+(eoReplacement< EOT >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoCommaReplacement< EOT >) cw
+(eoEPReplacement< EOT >) cw
+(eoPlusReplacement< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoMergeReduce< EOT >) 1 1 box
+ (eoReplacement< EOT >) 1 2 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+ (eoFunctorBase) 0.5 4 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 1.5 4 box
+ (eoCommaReplacement< EOT >) 0 0 box
+ (eoEPReplacement< EOT >) 1 0 box
+ (eoPlusReplacement< EOT >) 2 0 box
+
+% ----- relations -----
+
+solid
+0 1 1 out
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+1 1 3 in
+solid
+0 1 3 out
+solid
+0.5 1.5 4 conn
+solid
+1 0.5 4 in
+solid
+1 1.5 4 in
+solid
+1 1 0.25 out
+solid
+0 2 1 conn
+solid
+0 0 0.75 in
+solid
+0 1 0.75 in
+solid
+0 2 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_merge_reduce.tex b/trunk/paradiseo-eo/doc/latex/classeo_merge_reduce.tex
new file mode 100644
index 000000000..050365147
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_merge_reduce.tex
@@ -0,0 +1,45 @@
+\section{eo\-Merge\-Reduce$<$ EOT $>$ Class Template Reference}
+\label{classeo_merge_reduce}\index{eoMergeReduce@{eoMergeReduce}}
+eo\-Merge\-Reduce: abstract replacement strategy that is just an application of an embedded merge, followed by an embedded reduce  
+
+
+{\tt \#include $<$eo\-Merge\-Reduce.h$>$}
+
+Inheritance diagram for eo\-Merge\-Reduce$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.50896cm]{classeo_merge_reduce}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Merge\-Reduce} ({\bf eo\-Merge}$<$ {\bf EOT} $>$ \&\_\-merge, {\bf eo\-Reduce}$<$ {\bf EOT} $>$ \&\_\-reduce)\label{classeo_merge_reduce_a0}
+
+\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-parents, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-offspring)\label{classeo_merge_reduce_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Merge}$<$ {\bf EOT} $>$ \& {\bf merge}\label{classeo_merge_reduce_r0}
+
+\item 
+{\bf eo\-Reduce}$<$ {\bf EOT} $>$ \& {\bf reduce}\label{classeo_merge_reduce_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Merge\-Reduce$<$ EOT $>$}
+
+eo\-Merge\-Reduce: abstract replacement strategy that is just an application of an embedded merge, followed by an embedded reduce 
+
+
+
+Definition at line 50 of file eo\-Merge\-Reduce.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Merge\-Reduce.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_mon_clone_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_mon_clone_op.eps
new file mode 100644
index 000000000..14763689a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_mon_clone_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 132.67
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.76875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoMonCloneOp< EOT >) cw
+(eoMonOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoUF< EOT &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoMonCloneOp< EOT >) 0.5 0 box
+ (eoMonOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoUF< EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_mon_clone_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_mon_clone_op.tex
new file mode 100644
index 000000000..2fa3048e6
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_mon_clone_op.tex
@@ -0,0 +1,39 @@
+\section{eo\-Mon\-Clone\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_mon_clone_op}\index{eoMonCloneOp@{eoMonCloneOp}}
+Mon clone: one argument.  
+
+
+{\tt \#include $<$eo\-Clone\-Ops.h$>$}
+
+Inheritance diagram for eo\-Mon\-Clone\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.71476cm]{classeo_mon_clone_op}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Mon\-Clone\-Op} ()\label{classeo_mon_clone_op_a0}
+
+\begin{CompactList}\small\item\em Ctor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_mon_clone_op_a1}
+
+\item 
+virtual bool {\bf operator()} ({\bf EOT} \&)\label{classeo_mon_clone_op_a2}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Mon\-Clone\-Op$<$ EOT $>$}
+
+Mon clone: one argument. 
+
+
+
+Definition at line 44 of file eo\-Clone\-Ops.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Clone\-Ops.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_mon_gen_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_mon_gen_op.eps
new file mode 100644
index 000000000..39d9ffaf3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_mon_gen_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 91.0125
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.49375 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoMonGenOp< EOT >) cw
+(eoGenOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoUF< eoPopulator< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< eoPopulator< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoMonGenOp< EOT >) 0.5 0 box
+ (eoGenOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoUF< eoPopulator< EOT > &, void >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< eoPopulator< EOT > &, void >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_mon_gen_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_mon_gen_op.tex
new file mode 100644
index 000000000..fcb9533ea
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_mon_gen_op.tex
@@ -0,0 +1,48 @@
+\section{eo\-Mon\-Gen\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_mon_gen_op}\index{eoMonGenOp@{eoMonGenOp}}
+Wrapper for {\bf eo\-Mon\-Op}{\rm (p.\,\pageref{classeo_mon_op})}.  
+
+
+{\tt \#include $<$eo\-Gen\-Op.h$>$}
+
+Inheritance diagram for eo\-Mon\-Gen\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.54835cm]{classeo_mon_gen_op}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Mon\-Gen\-Op} ({\bf eo\-Mon\-Op}$<$ {\bf EOT} $>$ \&\_\-op)\label{classeo_mon_gen_op_a0}
+
+\item 
+unsigned {\bf max\_\-production} (void)\label{classeo_mon_gen_op_a1}
+
+\begin{CompactList}\small\item\em Max production is used to reserve space for all elements that are used by the operator, not setting it properly can result in a crash. \item\end{CompactList}\item 
+void {\bf apply} ({\bf eo\-Populator}$<$ {\bf EOT} $>$ \&\_\-it)\label{classeo_mon_gen_op_a2}
+
+\begin{CompactList}\small\item\em the function that will do the work \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_mon_gen_op_a3}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Mon\-Op}$<$ {\bf EOT} $>$ \& {\bf op}\label{classeo_mon_gen_op_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Mon\-Gen\-Op$<$ EOT $>$}
+
+Wrapper for {\bf eo\-Mon\-Op}{\rm (p.\,\pageref{classeo_mon_op})}. 
+
+
+
+Definition at line 85 of file eo\-Gen\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Gen\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_mon_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_mon_op.eps
new file mode 100644
index 000000000..53240f6e3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_mon_op.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 90.0901
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.55 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 3 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoMonOp< EOType >) cw
+(eoOp< EOType >) cw
+(eoUF< EOType &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< EOType &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoMonOp< EOType >) 0.5 0 box
+ (eoOp< EOType >) 0 1 box
+ (eoUF< EOType &, bool >) 1 1 box
+ (eoFunctorBase) 0.5 2 box
+ (unary_function< EOType &, bool >) 1.5 2 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+0 1 1 conn
+solid
+1 0 1 in
+solid
+1 1 1 in
+solid
+0 1 1 out
+solid
+0.5 1.5 2 conn
+solid
+1 0.5 2 in
+solid
+1 1.5 2 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_mon_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_mon_op.tex
new file mode 100644
index 000000000..7db2e675a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_mon_op.tex
@@ -0,0 +1,38 @@
+\section{eo\-Mon\-Op$<$ EOType $>$ Class Template Reference}
+\label{classeo_mon_op}\index{eoMonOp@{eoMonOp}}
+eo\-Mon\-Op is the monary operator: genetic operator that takes only one {\bf EO}{\rm (p.\,\pageref{class_e_o})}.  
+
+
+{\tt \#include $<$eo\-Op.h$>$}
+
+Inheritance diagram for eo\-Mon\-Op$<$ EOType $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.52252cm]{classeo_mon_op}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Mon\-Op} ()\label{classeo_mon_op_a0}
+
+\begin{CompactList}\small\item\em Ctor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_mon_op_a1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOType$>$ class eo\-Mon\-Op$<$ EOType $>$}
+
+eo\-Mon\-Op is the monary operator: genetic operator that takes only one {\bf EO}{\rm (p.\,\pageref{class_e_o})}. 
+
+When defining your own, make sure that you return a boolean value indicating that you have changed the content. 
+
+
+
+Definition at line 101 of file eo\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_monitor.eps b/trunk/paradiseo-eo/doc/latex/classeo_monitor.eps
new file mode 100644
index 000000000..847345144
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_monitor.eps
@@ -0,0 +1,245 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 91.5751
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.46 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 6 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoMonitor) cw
+(eoF< eoMonitor & >) cw
+(eoFunctorBase) cw
+(eoFileMonitor) cw
+(eoFileSnapshot) cw
+(eoStdoutMonitor) cw
+(eoTimedMonitor) cw
+(MonitorWrapper) cw
+(eoGnuplot1DMonitor) cw
+(eoFDCFileSnapshot< EOT >) cw
+(eoGnuplot1DSnapshot) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoMonitor) 2.5 2 box
+ (eoF< eoMonitor & >) 2.5 3 box
+ (eoFunctorBase) 2.5 4 box
+ (eoFileMonitor) 0 1 box
+ (eoFileSnapshot) 1.5 1 box
+ (eoStdoutMonitor) 2.5 1 box
+ (eoTimedMonitor) 3.5 1 box
+ (MonitorWrapper) 4.5 1 box
+ (eoGnuplot1DMonitor) 0 0 box
+ (eoFDCFileSnapshot< EOT >) 1 0 box
+ (eoGnuplot1DSnapshot) 2 0 box
+
+% ----- relations -----
+
+solid
+0 2.5 2 out
+solid
+1 2.5 3 in
+solid
+0 2.5 3 out
+solid
+1 2.5 4 in
+solid
+1 2.5 1.25 out
+solid
+0 4.5 2 conn
+solid
+0 0 1.75 in
+solid
+1 0 0.25 out
+solid
+0 1.5 1.75 in
+solid
+1 1.5 0.25 out
+solid
+1 2 1 conn
+solid
+0 2.5 1.75 in
+solid
+0 3.5 1.75 in
+solid
+0 4.5 1.75 in
+solid
+0 0 0.75 in
+solid
+0 1 0.75 in
+solid
+0 2 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_monitor.tex b/trunk/paradiseo-eo/doc/latex/classeo_monitor.tex
new file mode 100644
index 000000000..632d46322
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_monitor.tex
@@ -0,0 +1,66 @@
+\section{eo\-Monitor Class Reference}
+\label{classeo_monitor}\index{eoMonitor@{eoMonitor}}
+The abstract monitor class is a std::vector of parameter pointers.  
+
+
+{\tt \#include $<$eo\-Monitor.h$>$}
+
+Inheritance diagram for eo\-Monitor::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.5641cm]{classeo_monitor}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual void {\bf last\-Call} ()\label{classeo_monitor_a0}
+
+\item 
+virtual void {\bf add} (const {\bf eo\-Param} \&\_\-param)
+\begin{CompactList}\small\item\em Adds a parameter to the monitor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} (void) const \label{classeo_monitor_a2}
+
+\end{CompactItemize}
+\subsection*{Protected Types}
+\begin{CompactItemize}
+\item 
+typedef std::vector$<$ const {\bf eo\-Param} $\ast$ $>$::iterator {\bf iterator}\label{classeo_monitor_x0}
+
+\end{CompactItemize}
+\subsection*{Protected Attributes}
+\begin{CompactItemize}
+\item 
+std::vector$<$ const {\bf eo\-Param} $\ast$ $>$ {\bf vec}\label{classeo_monitor_p0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+The abstract monitor class is a std::vector of parameter pointers. 
+
+Use either push\_\-back a pointer or add a reference to a parameter. Derived classes will then implement the {\bf operator()(void)}{\rm (p.\,\pageref{classeo_f_a1})} which will stream or pipe the current values of the parameters to wherever you want it streamed or piped to. 
+
+
+
+Definition at line 46 of file eo\-Monitor.h.
+
+\subsection{Member Function Documentation}
+\index{eoMonitor@{eo\-Monitor}!add@{add}}
+\index{add@{add}!eoMonitor@{eo\-Monitor}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}virtual void eo\-Monitor::add (const {\bf eo\-Param} \& {\em \_\-param})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_monitor_a1}
+
+
+Adds a parameter to the monitor. 
+
+It is virtual so you can do some type checking in derived classes if you must. 
+
+Reimplemented in {\bf eo\-FDCFile\-Snapshot$<$ EOT $>$} {\rm (p.\,\pageref{classeo_f_d_c_file_snapshot_a1})}, and {\bf eo\-File\-Snapshot} {\rm (p.\,\pageref{classeo_file_snapshot_a9})}.
+
+Definition at line 56 of file eo\-Monitor.h.
+
+Referenced by eo\-File\-Snapshot::add().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Monitor.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_n_d_plus_replacement.eps b/trunk/paradiseo-eo/doc/latex/classeo_n_d_plus_replacement.eps
new file mode 100644
index 000000000..5ede6417b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_n_d_plus_replacement.eps
@@ -0,0 +1,239 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 53.7634
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 9.3 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 4 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoNDPlusReplacement< EOT, WorthT >) cw
+(eoReplacement< EOT >) cw
+(eoReplacement< EOT >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoNDPlusReplacement< EOT, WorthT >) 1.5 0 box
+ (eoReplacement< EOT >) 0.5 1 box
+ (eoReplacement< EOT >) 2.5 1 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 2.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+ (eoFunctorBase) 2 3 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 3 3 box
+
+% ----- relations -----
+
+solid
+0 1.5 0 out
+solid
+0.5 2.5 1 conn
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 2.5 1 in
+solid
+0 2.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 2.5 2 in
+solid
+0 2.5 2 out
+solid
+2 3 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+1 2 3 in
+solid
+1 3 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_n_d_plus_replacement.tex b/trunk/paradiseo-eo/doc/latex/classeo_n_d_plus_replacement.tex
new file mode 100644
index 000000000..d3b4c2800
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_n_d_plus_replacement.tex
@@ -0,0 +1,52 @@
+\section{eo\-NDPlus\-Replacement$<$ EOT, Worth\-T $>$ Class Template Reference}
+\label{classeo_n_d_plus_replacement}\index{eoNDPlusReplacement@{eoNDPlusReplacement}}
+An elitist non-dominated sorted replacement scheme.  
+
+
+Inheritance diagram for eo\-NDPlus\-Replacement$<$ EOT, Worth\-T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=1.50538cm]{classeo_n_d_plus_replacement}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-NDPlus\-Replacement} ({\bf eo\-Perf2Worth}$<$ {\bf EOT}, Worth\-T $>$ \&\_\-perf2worth)\label{classeo_n_d_plus_replacement_a0}
+
+\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-parents, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-offspring)\label{classeo_n_d_plus_replacement_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\item 
+{\bf eo\-NDPlus\-Replacement} ({\bf eo\-Perf2Worth}$<$ {\bf EOT}, Worth\-T $>$ \&\_\-perf2worth)\label{classeo_n_d_plus_replacement_a2}
+
+\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-parents, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-offspring)\label{classeo_n_d_plus_replacement_a3}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Perf2Worth}$<$ {\bf EOT}, Worth\-T $>$ \& {\bf perf2worth}\label{classeo_n_d_plus_replacement_r0}
+
+\item 
+{\bf eo\-Perf2Worth}$<$ {\bf EOT}, Worth\-T $>$ \& {\bf perf2worth}\label{classeo_n_d_plus_replacement_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT, class Worth\-T = double$>$ class eo\-NDPlus\-Replacement$<$ EOT, Worth\-T $>$}
+
+An elitist non-dominated sorted replacement scheme. 
+
+Trying out an elitist non-dominated sorted replacement scheme. 
+
+
+
+Definition at line 45 of file make\_\-algo\_\-pareto.h.
+
+The documentation for this class was generated from the following files:\begin{CompactItemize}
+\item 
+make\_\-algo\_\-pareto.h\item 
+t-eo\-Pareto.cpp\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting.eps b/trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting.eps
new file mode 100644
index 000000000..f8909f2f2
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting.eps
@@ -0,0 +1,245 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 135.135
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.7 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 6 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoNDSorting< EOT >) cw
+(eoPerf2WorthCached< EOT, double >) cw
+(eoPerf2Worth< EOT, double >) cw
+(eoUF< const eoPop< EOT > &, void >) cw
+(eoValueParam< std::vector< double > >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, void >) cw
+(eoParam) cw
+(eoNDSorting_I< EOT >) cw
+(eoNDSorting_II< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoNDSorting< EOT >) 1.25 1 box
+ (eoPerf2WorthCached< EOT, double >) 1.25 2 box
+ (eoPerf2Worth< EOT, double >) 1.25 3 box
+ (eoUF< const eoPop< EOT > &, void >) 0.5 4 box
+ (eoValueParam< std::vector< double > >) 2 4 box
+ (eoFunctorBase) 0 5 box
+ (unary_function< const eoPop< EOT > &, void >) 1 5 box
+ (eoParam) 2 5 box
+ (eoNDSorting_I< EOT >) 0.75 0 box
+ (eoNDSorting_II< EOT >) 1.75 0 box
+
+% ----- relations -----
+
+solid
+0 1.25 1 out
+solid
+1 1.25 2 in
+solid
+0 1.25 2 out
+solid
+1 1.25 3 in
+solid
+0 1.25 3 out
+solid
+0.5 2 4 conn
+solid
+1 0.5 4 in
+solid
+0 0.5 4 out
+solid
+0 1 5 conn
+solid
+1 2 4 in
+solid
+0 2 4 out
+solid
+1 0 5 in
+solid
+1 1 5 in
+solid
+1 2 5 in
+solid
+1 1.25 0.25 out
+solid
+0.75 1.75 1 conn
+solid
+0 0.75 0.75 in
+solid
+0 1.75 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting.tex b/trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting.tex
new file mode 100644
index 000000000..f0e37d9c0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting.tex
@@ -0,0 +1,91 @@
+\section{eo\-NDSorting$<$ EOT $>$ Class Template Reference}
+\label{classeo_n_d_sorting}\index{eoNDSorting@{eoNDSorting}}
+Non dominated sorting, it $\ast$is a$\ast$ std::vector of doubles, the integer part is the rank (to which front it belongs), the fractional part the niching penalty or distance penalty or whatever penalty you want to squeeze into the bits.  
+
+
+{\tt \#include $<$eo\-NDSorting.h$>$}
+
+Inheritance diagram for eo\-NDSorting$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.78378cm]{classeo_n_d_sorting}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-NDSorting} (bool nasty\_\-flag\_\-=false)\label{classeo_n_d_sorting_a0}
+
+\item 
+virtual std::vector$<$ double $>$ {\bf niche\_\-penalty} (const std::vector$<$ unsigned $>$ \¤t\_\-front, const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)=0
+\begin{CompactList}\small\item\em Pure virtual function that calculates the 'distance' for each element in the current front Implement to create your own nondominated sorting algorithm. \item\end{CompactList}\item 
+void {\bf calculate\_\-worths} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_n_d_sorting_a3}
+
+\begin{CompactList}\small\item\em The actual virtual function the derived classes should implement. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Public Attributes}
+\begin{CompactItemize}
+\item 
+bool {\bf nasty\_\-declone\_\-flag\_\-that\_\-only\_\-is\_\-implemented\_\-for\_\-two\_\-objectives}\label{classeo_n_d_sorting_o0}
+
+\end{CompactItemize}
+\subsection*{Private Member Functions}
+\begin{CompactItemize}
+\item 
+void {\bf one\_\-objective} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_n_d_sorting_d0}
+
+\item 
+void {\bf two\_\-objectives} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)
+\begin{CompactList}\small\item\em Optimization for two objectives. \item\end{CompactList}\item 
+void {\bf m\_\-objectives} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_n_d_sorting_d2}
+
+\item 
+void {\bf rank\_\-to\_\-worth} ()\label{classeo_n_d_sorting_d3}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-NDSorting$<$ EOT $>$}
+
+Non dominated sorting, it $\ast$is a$\ast$ std::vector of doubles, the integer part is the rank (to which front it belongs), the fractional part the niching penalty or distance penalty or whatever penalty you want to squeeze into the bits. 
+
+
+
+Definition at line 42 of file eo\-NDSorting.h.
+
+\subsection{Member Function Documentation}
+\index{eoNDSorting@{eo\-NDSorting}!niche_penalty@{niche\_\-penalty}}
+\index{niche_penalty@{niche\_\-penalty}!eoNDSorting@{eo\-NDSorting}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ virtual std::vector$<$double$>$ {\bf eo\-NDSorting}$<$ {\bf EOT} $>$::niche\_\-penalty (const std::vector$<$ unsigned $>$ \& {\em current\_\-front}, const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\em \_\-pop})\hspace{0.3cm}{\tt  [pure virtual]}}\label{classeo_n_d_sorting_a2}
+
+
+Pure virtual function that calculates the 'distance' for each element in the current front Implement to create your own nondominated sorting algorithm. 
+
+The size of the returned std::vector should be equal to the size of the current\_\-front. 
+
+Implemented in {\bf eo\-NDSorting\_\-I$<$ EOT $>$} {\rm (p.\,\pageref{classeo_n_d_sorting___i_a1})}, and {\bf eo\-NDSorting\_\-II$<$ EOT $>$} {\rm (p.\,\pageref{classeo_n_d_sorting___i_i_a1})}.
+
+Referenced by eo\-NDSorting$<$ EOT $>$::two\_\-objectives().\index{eoNDSorting@{eo\-NDSorting}!two_objectives@{two\_\-objectives}}
+\index{two_objectives@{two\_\-objectives}!eoNDSorting@{eo\-NDSorting}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ void {\bf eo\-NDSorting}$<$ {\bf EOT} $>$::two\_\-objectives (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\em \_\-pop})\hspace{0.3cm}{\tt  [inline, private]}}\label{classeo_n_d_sorting_d1}
+
+
+Optimization for two objectives. 
+
+Makes the algorithm run in complexity O(n log n) where n is the population size
+
+This is the same complexity as for a single objective or truncation selection or sorting.
+
+It will perform a sort on the two objectives seperately, and from the information on the ranks of the individuals on these two objectives, the non-dominated sorting rank is determined. There are then three nlogn operations in place: one sort per objective, plus a binary search procedure to combine the information about the ranks.
+
+After that it is a simple exercise to calculate the distance penalty 
+
+Definition at line 140 of file eo\-NDSorting.h.
+
+References eo\-NDSorting$<$ EOT $>$::niche\_\-penalty(), and eo\-Value\-Param$<$ std::vector$<$ double $>$ $>$::value().
+
+Referenced by eo\-NDSorting$<$ EOT $>$::calculate\_\-worths().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-NDSorting.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting_1_1_dummy_e_o.eps b/trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting_1_1_dummy_e_o.eps
new file mode 100644
index 000000000..c1d3f7b0b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting_1_1_dummy_e_o.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 194.175
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.575 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoNDSorting< EOT >::DummyEO) cw
+(EO< EOT::Fitness >) cw
+(eoObject) cw
+(eoPersistent) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoNDSorting< EOT >::DummyEO) 0.5 0 box
+ (EO< EOT::Fitness >) 0.5 1 box
+ (eoObject) 0 2 box
+ (eoPersistent) 1 2 box
+ (eoPrintable) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting_1_1_dummy_e_o.tex b/trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting_1_1_dummy_e_o.tex
new file mode 100644
index 000000000..c63dcee84
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting_1_1_dummy_e_o.tex
@@ -0,0 +1,31 @@
+\section{eo\-NDSorting$<$ EOT $>$::Dummy\-EO Class Reference}
+\label{classeo_n_d_sorting_1_1_dummy_e_o}\index{eoNDSorting::DummyEO@{eoNDSorting::DummyEO}}
+used in fast nondominated sorting {\bf Dummy\-EO}{\rm (p.\,\pageref{classeo_n_d_sorting_1_1_dummy_e_o})} is just a storage place for fitnesses and to store the original index  
+
+
+Inheritance diagram for eo\-NDSorting$<$ EOT $>$::Dummy\-EO::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_n_d_sorting_1_1_dummy_e_o}
+\end{center}
+\end{figure}
+\subsection*{Public Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf index}\label{classeo_n_d_sorting_1_1_dummy_e_o_o0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-NDSorting$<$ EOT $>$::Dummy\-EO}
+
+used in fast nondominated sorting {\bf Dummy\-EO}{\rm (p.\,\pageref{classeo_n_d_sorting_1_1_dummy_e_o})} is just a storage place for fitnesses and to store the original index 
+
+
+
+Definition at line 94 of file eo\-NDSorting.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-NDSorting.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting___i.eps b/trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting___i.eps
new file mode 100644
index 000000000..95fba24a8
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting___i.eps
@@ -0,0 +1,239 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 135.135
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.7 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 6 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoNDSorting_I< EOT >) cw
+(eoNDSorting< EOT >) cw
+(eoPerf2WorthCached< EOT, double >) cw
+(eoPerf2Worth< EOT, double >) cw
+(eoUF< const eoPop< EOT > &, void >) cw
+(eoValueParam< std::vector< double > >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, void >) cw
+(eoParam) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoNDSorting_I< EOT >) 1.25 0 box
+ (eoNDSorting< EOT >) 1.25 1 box
+ (eoPerf2WorthCached< EOT, double >) 1.25 2 box
+ (eoPerf2Worth< EOT, double >) 1.25 3 box
+ (eoUF< const eoPop< EOT > &, void >) 0.5 4 box
+ (eoValueParam< std::vector< double > >) 2 4 box
+ (eoFunctorBase) 0 5 box
+ (unary_function< const eoPop< EOT > &, void >) 1 5 box
+ (eoParam) 2 5 box
+
+% ----- relations -----
+
+solid
+0 1.25 0 out
+solid
+1 1.25 1 in
+solid
+0 1.25 1 out
+solid
+1 1.25 2 in
+solid
+0 1.25 2 out
+solid
+1 1.25 3 in
+solid
+0 1.25 3 out
+solid
+0.5 2 4 conn
+solid
+1 0.5 4 in
+solid
+0 0.5 4 out
+solid
+0 1 5 conn
+solid
+1 2 4 in
+solid
+0 2 4 out
+solid
+1 0 5 in
+solid
+1 1 5 in
+solid
+1 2 5 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting___i.tex b/trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting___i.tex
new file mode 100644
index 000000000..eff7aee38
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting___i.tex
@@ -0,0 +1,55 @@
+\section{eo\-NDSorting\_\-I$<$ EOT $>$ Class Template Reference}
+\label{classeo_n_d_sorting___i}\index{eoNDSorting_I@{eoNDSorting\_\-I}}
+The original Non Dominated Sorting algorithm from Srinivas and Deb.  
+
+
+{\tt \#include $<$eo\-NDSorting.h$>$}
+
+Inheritance diagram for eo\-NDSorting\_\-I$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.78378cm]{classeo_n_d_sorting___i}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-NDSorting\_\-I} (double \_\-niche\-Size, bool nasty\_\-flag\_\-=false)\label{classeo_n_d_sorting___i_a0}
+
+\item 
+std::vector$<$ double $>$ {\bf niche\_\-penalty} (const std::vector$<$ unsigned $>$ \¤t\_\-front, const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)
+\begin{CompactList}\small\item\em Pure virtual function that calculates the 'distance' for each element in the current front Implement to create your own nondominated sorting algorithm. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf niche\-Size}\label{classeo_n_d_sorting___i_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-NDSorting\_\-I$<$ EOT $>$}
+
+The original Non Dominated Sorting algorithm from Srinivas and Deb. 
+
+
+
+Definition at line 380 of file eo\-NDSorting.h.
+
+\subsection{Member Function Documentation}
+\index{eoNDSorting_I@{eo\-NDSorting\_\-I}!niche_penalty@{niche\_\-penalty}}
+\index{niche_penalty@{niche\_\-penalty}!eoNDSorting_I@{eo\-NDSorting\_\-I}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ std::vector$<$double$>$ {\bf eo\-NDSorting\_\-I}$<$ {\bf EOT} $>$::niche\_\-penalty (const std::vector$<$ unsigned $>$ \& {\em current\_\-front}, const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\em \_\-pop})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_n_d_sorting___i_a1}
+
+
+Pure virtual function that calculates the 'distance' for each element in the current front Implement to create your own nondominated sorting algorithm. 
+
+The size of the returned std::vector should be equal to the size of the current\_\-front. 
+
+Implements {\bf eo\-NDSorting$<$ EOT $>$} {\rm (p.\,\pageref{classeo_n_d_sorting_a2})}.
+
+Definition at line 385 of file eo\-NDSorting.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-NDSorting.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting___i_i.eps b/trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting___i_i.eps
new file mode 100644
index 000000000..2cd69baf2
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting___i_i.eps
@@ -0,0 +1,239 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 135.135
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.7 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 6 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoNDSorting_II< EOT >) cw
+(eoNDSorting< EOT >) cw
+(eoPerf2WorthCached< EOT, double >) cw
+(eoPerf2Worth< EOT, double >) cw
+(eoUF< const eoPop< EOT > &, void >) cw
+(eoValueParam< std::vector< double > >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, void >) cw
+(eoParam) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoNDSorting_II< EOT >) 1.25 0 box
+ (eoNDSorting< EOT >) 1.25 1 box
+ (eoPerf2WorthCached< EOT, double >) 1.25 2 box
+ (eoPerf2Worth< EOT, double >) 1.25 3 box
+ (eoUF< const eoPop< EOT > &, void >) 0.5 4 box
+ (eoValueParam< std::vector< double > >) 2 4 box
+ (eoFunctorBase) 0 5 box
+ (unary_function< const eoPop< EOT > &, void >) 1 5 box
+ (eoParam) 2 5 box
+
+% ----- relations -----
+
+solid
+0 1.25 0 out
+solid
+1 1.25 1 in
+solid
+0 1.25 1 out
+solid
+1 1.25 2 in
+solid
+0 1.25 2 out
+solid
+1 1.25 3 in
+solid
+0 1.25 3 out
+solid
+0.5 2 4 conn
+solid
+1 0.5 4 in
+solid
+0 0.5 4 out
+solid
+0 1 5 conn
+solid
+1 2 4 in
+solid
+0 2 4 out
+solid
+1 0 5 in
+solid
+1 1 5 in
+solid
+1 2 5 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting___i_i.tex b/trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting___i_i.tex
new file mode 100644
index 000000000..bffaf010a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_n_d_sorting___i_i.tex
@@ -0,0 +1,48 @@
+\section{eo\-NDSorting\_\-II$<$ EOT $>$ Class Template Reference}
+\label{classeo_n_d_sorting___i_i}\index{eoNDSorting_II@{eoNDSorting\_\-II}}
+Fast Elitist Non-Dominant Sorting Genetic Algorithm.  
+
+
+{\tt \#include $<$eo\-NDSorting.h$>$}
+
+Inheritance diagram for eo\-NDSorting\_\-II$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.78378cm]{classeo_n_d_sorting___i_i}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef std::pair$<$ double, unsigned $>$ {\bf double\_\-index\_\-pair}\label{classeo_n_d_sorting___i_i_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-NDSorting\_\-II} (bool nasty\_\-flag\_\-=false)\label{classeo_n_d_sorting___i_i_a0}
+
+\item 
+std::vector$<$ double $>$ {\bf niche\_\-penalty} (const std::vector$<$ unsigned $>$ \&\_\-cf, const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_n_d_sorting___i_i_a1}
+
+\begin{CompactList}\small\item\em \_\-cf points into the elements that consist of the current front \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-NDSorting\_\-II$<$ EOT $>$}
+
+Fast Elitist Non-Dominant Sorting Genetic Algorithm. 
+
+Adapted from Deb, Agrawal, Pratab and Meyarivan: A Fast Elitist Non-Dominant Sorting Genetic Algorithm for Multi\-Objective Optimization: NSGA-II Kan\-GAL Report No. 200001
+
+Note that this class does not do the sorting per se, but the sorting of it worth\_\-std::vector will give the right order
+
+The crowding distance is calculated as the sum of the distances to the nearest neighbours. As we need to return the penalty value, we have to invert that and invert it again in the base class, but such is life, sigh 
+
+
+
+Definition at line 434 of file eo\-NDSorting.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-NDSorting.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_n_pts_bit_xover.eps b/trunk/paradiseo-eo/doc/latex/classeo_n_pts_bit_xover.eps
new file mode 100644
index 000000000..216e65ff3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_n_pts_bit_xover.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 96.6184
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.175 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoNPtsBitXover< Chrom >) cw
+(eoQuadOp< Chrom >) cw
+(eoOp< Chrom >) cw
+(eoBF< Chrom &, Chrom &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< Chrom &, Chrom &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoNPtsBitXover< Chrom >) 0.5 0 box
+ (eoQuadOp< Chrom >) 0.5 1 box
+ (eoOp< Chrom >) 0 2 box
+ (eoBF< Chrom &, Chrom &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< Chrom &, Chrom &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_n_pts_bit_xover.tex b/trunk/paradiseo-eo/doc/latex/classeo_n_pts_bit_xover.tex
new file mode 100644
index 000000000..5d3f297de
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_n_pts_bit_xover.tex
@@ -0,0 +1,63 @@
+\section{eo\-NPts\-Bit\-Xover$<$ Chrom $>$ Class Template Reference}
+\label{classeo_n_pts_bit_xover}\index{eoNPtsBitXover@{eoNPtsBitXover}}
+eo\-NPts\-Bit\-Xover --$>$ n-point crossover  
+
+
+{\tt \#include $<$ga/eo\-Bit\-Op.h$>$}
+
+Inheritance diagram for eo\-NPts\-Bit\-Xover$<$ Chrom $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.70531cm]{classeo_n_pts_bit_xover}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-NPts\-Bit\-Xover} (const unsigned \&\_\-num\_\-points=2)\label{classeo_n_pts_bit_xover_a0}
+
+\begin{CompactList}\small\item\em (Default) Constructor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_n_pts_bit_xover_a1}
+
+\begin{CompactList}\small\item\em The class name. \item\end{CompactList}\item 
+bool {\bf operator()} (Chrom \&chrom1, Chrom \&chrom2)
+\begin{CompactList}\small\item\em n-point crossover for binary chromosomes. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf num\_\-points}\label{classeo_n_pts_bit_xover_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Chrom$>$ class eo\-NPts\-Bit\-Xover$<$ Chrom $>$}
+
+eo\-NPts\-Bit\-Xover --$>$ n-point crossover 
+
+
+
+Definition at line 319 of file eo\-Bit\-Op.h.
+
+\subsection{Member Function Documentation}
+\index{eoNPtsBitXover@{eo\-NPts\-Bit\-Xover}!operator()@{operator()}}
+\index{operator()@{operator()}!eoNPtsBitXover@{eo\-NPts\-Bit\-Xover}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Chrom$>$ bool {\bf eo\-NPts\-Bit\-Xover}$<$ Chrom $>$::operator() (Chrom \& {\em chrom1}, Chrom \& {\em chrom2})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_n_pts_bit_xover_a2}
+
+
+n-point crossover for binary chromosomes. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em chrom1}]The first chromosome. \item[{\em chrom2}]The first chromosome. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-BF$<$ Chrom \&, Chrom \&, bool $>$} {\rm (p.\,\pageref{classeo_b_f_a1})}.
+
+Definition at line 337 of file eo\-Bit\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Bit\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_neg_exp_generator.eps b/trunk/paradiseo-eo/doc/latex/classeo_neg_exp_generator.eps
new file mode 100644
index 000000000..e5243b03c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_neg_exp_generator.eps
@@ -0,0 +1,209 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 481.928
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.0375 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoNegExpGenerator< T >) cw
+(eoRndGenerator< T >) cw
+(eoF< T >) cw
+(eoFunctorBase) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoNegExpGenerator< T >) 0 0 box
+ (eoRndGenerator< T >) 0 1 box
+ (eoF< T >) 0 2 box
+ (eoFunctorBase) 0 3 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 0 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_neg_exp_generator.tex b/trunk/paradiseo-eo/doc/latex/classeo_neg_exp_generator.tex
new file mode 100644
index 000000000..48da5a8cb
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_neg_exp_generator.tex
@@ -0,0 +1,47 @@
+\section{eo\-Neg\-Exp\-Generator$<$ T $>$ Class Template Reference}
+\label{classeo_neg_exp_generator}\index{eoNegExpGenerator@{eoNegExpGenerator}}
+The class {\bf negexp\_\-generator}{\rm (p.\,\pageref{classnegexp__generator})} can be used in the STL generate function to easily generate negative exponential distributed floats and doubles.  
+
+
+{\tt \#include $<$eo\-Rnd\-Generators.h$>$}
+
+Inheritance diagram for eo\-Neg\-Exp\-Generator$<$ T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_neg_exp_generator}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Neg\-Exp\-Generator} (T \_\-mean=1.0, {\bf eo\-Rng} \&\_\-rng=rng)\label{classeo_neg_exp_generator_a0}
+
+\item 
+T {\bf operator()} (void)\label{classeo_neg_exp_generator_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+T {\bf mean}\label{classeo_neg_exp_generator_r0}
+
+\item 
+{\bf eo\-Rng} \& {\bf negexp}\label{classeo_neg_exp_generator_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class T = double$>$ class eo\-Neg\-Exp\-Generator$<$ T $>$}
+
+The class {\bf negexp\_\-generator}{\rm (p.\,\pageref{classnegexp__generator})} can be used in the STL generate function to easily generate negative exponential distributed floats and doubles. 
+
+The user can supply a mean. 
+
+
+
+Definition at line 137 of file eo\-Rnd\-Generators.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Rnd\-Generators.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_neg_exp_init.eps b/trunk/paradiseo-eo/doc/latex/classeo_neg_exp_init.eps
new file mode 100644
index 000000000..61e355a8a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_neg_exp_init.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 218.579
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.2875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoNegExpInit< T >) cw
+(eoInit< T >) cw
+(eoUF< T &, void >) cw
+(eoFunctorBase) cw
+(unary_function< T &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoNegExpInit< T >) 0.5 0 box
+ (eoInit< T >) 0.5 1 box
+ (eoUF< T &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< T &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_neg_exp_init.tex b/trunk/paradiseo-eo/doc/latex/classeo_neg_exp_init.tex
new file mode 100644
index 000000000..59c68bf87
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_neg_exp_init.tex
@@ -0,0 +1,47 @@
+\section{eo\-Neg\-Exp\-Init$<$ T $>$ Class Template Reference}
+\label{classeo_neg_exp_init}\index{eoNegExpInit@{eoNegExpInit}}
+The class {\bf negexp\_\-generator}{\rm (p.\,\pageref{classnegexp__generator})} can be used in the STL generate function to easily generate negative exponential distributed floats and doubles.  
+
+
+{\tt \#include $<$eo\-Uniform\-Init.h$>$}
+
+Inheritance diagram for eo\-Neg\-Exp\-Init$<$ T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_neg_exp_init}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Neg\-Exp\-Init} (T \_\-mean=1.0, {\bf eo\-Rng} \&\_\-rng=rng)\label{classeo_neg_exp_init_a0}
+
+\item 
+void {\bf operator()} (T \&\_\-t)\label{classeo_neg_exp_init_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+T {\bf mean}\label{classeo_neg_exp_init_r0}
+
+\item 
+{\bf eo\-Rng} \& {\bf negexp}\label{classeo_neg_exp_init_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class T = double$>$ class eo\-Neg\-Exp\-Init$<$ T $>$}
+
+The class {\bf negexp\_\-generator}{\rm (p.\,\pageref{classnegexp__generator})} can be used in the STL generate function to easily generate negative exponential distributed floats and doubles. 
+
+The user can supply a mean. 
+
+
+
+Definition at line 143 of file eo\-Uniform\-Init.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Uniform\-Init.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_no_elitism.eps b/trunk/paradiseo-eo/doc/latex/classeo_no_elitism.eps
new file mode 100644
index 000000000..d0318d26c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_no_elitism.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 122.85
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.07 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoNoElitism< EOT >) cw
+(eoElitism< EOT >) cw
+(eoMerge< EOT >) cw
+(eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< const eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoNoElitism< EOT >) 0.5 0 box
+ (eoElitism< EOT >) 0.5 1 box
+ (eoMerge< EOT >) 0.5 2 box
+ (eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 3 box
+ (eoFunctorBase) 0 4 box
+ (binary_function< const eoPop< EOT > &, eoPop< EOT > &, void >) 1 4 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+1 0.5 3 in
+solid
+0 0.5 3 out
+solid
+0 1 4 conn
+solid
+1 0 4 in
+solid
+1 1 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_no_elitism.tex b/trunk/paradiseo-eo/doc/latex/classeo_no_elitism.tex
new file mode 100644
index 000000000..4c90c3e49
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_no_elitism.tex
@@ -0,0 +1,27 @@
+\section{eo\-No\-Elitism$<$ EOT $>$ Class Template Reference}
+\label{classeo_no_elitism}\index{eoNoElitism@{eoNoElitism}}
+No elite.  
+
+
+{\tt \#include $<$eo\-Merge.h$>$}
+
+Inheritance diagram for eo\-No\-Elitism$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.4398cm]{classeo_no_elitism}
+\end{center}
+\end{figure}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-No\-Elitism$<$ EOT $>$}
+
+No elite. 
+
+
+
+Definition at line 107 of file eo\-Merge.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Merge.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_no_perf2_worth.eps b/trunk/paradiseo-eo/doc/latex/classeo_no_perf2_worth.eps
new file mode 100644
index 000000000..aeea68119
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_no_perf2_worth.eps
@@ -0,0 +1,227 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 90.0901
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.55 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoNoPerf2Worth< EOT >) cw
+(eoPerf2Worth< EOT, EOT::Fitness >) cw
+(eoUF< const eoPop< EOT > &, void >) cw
+(eoValueParam< ValueType >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, void >) cw
+(eoParam) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoNoPerf2Worth< EOT >) 1.25 0 box
+ (eoPerf2Worth< EOT, EOT::Fitness >) 1.25 1 box
+ (eoUF< const eoPop< EOT > &, void >) 0.5 2 box
+ (eoValueParam< ValueType >) 2 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< const eoPop< EOT > &, void >) 1 3 box
+ (eoParam) 2 3 box
+
+% ----- relations -----
+
+solid
+0 1.25 0 out
+solid
+1 1.25 1 in
+solid
+0 1.25 1 out
+solid
+0.5 2 2 conn
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 2 2 in
+solid
+0 2 2 out
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+1 2 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_no_perf2_worth.tex b/trunk/paradiseo-eo/doc/latex/classeo_no_perf2_worth.tex
new file mode 100644
index 000000000..e02b6ab5d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_no_perf2_worth.tex
@@ -0,0 +1,33 @@
+\section{eo\-No\-Perf2Worth$<$ EOT $>$ Class Template Reference}
+\label{classeo_no_perf2_worth}\index{eoNoPerf2Worth@{eoNoPerf2Worth}}
+A dummy perf2worth, just in case you need it.  
+
+
+{\tt \#include $<$eo\-Perf2Worth.h$>$}
+
+Inheritance diagram for eo\-No\-Perf2Worth$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.52252cm]{classeo_no_perf2_worth}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+void {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_no_perf2_worth_a0}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-No\-Perf2Worth$<$ EOT $>$}
+
+A dummy perf2worth, just in case you need it. 
+
+
+
+Definition at line 230 of file eo\-Perf2Worth.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Perf2Worth.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_no_select.eps b/trunk/paradiseo-eo/doc/latex/classeo_no_select.eps
new file mode 100644
index 000000000..a13176b5e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_no_select.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 115.607
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.325 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoNoSelect< EOT >) cw
+(eoSelectOne< EOT >) cw
+(eoUF< const eoPop< EOT > &, const EOT & >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, const EOT & >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoNoSelect< EOT >) 0.5 0 box
+ (eoSelectOne< EOT >) 0.5 1 box
+ (eoUF< const eoPop< EOT > &, const EOT & >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< const eoPop< EOT > &, const EOT & >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_no_select.tex b/trunk/paradiseo-eo/doc/latex/classeo_no_select.tex
new file mode 100644
index 000000000..9aa523904
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_no_select.tex
@@ -0,0 +1,42 @@
+\section{eo\-No\-Select$<$ EOT $>$ Class Template Reference}
+\label{classeo_no_select}\index{eoNoSelect@{eoNoSelect}}
+eo\-No\-Select: returns all individual in order WITHOUT USING FITNESS!!! looping back to the beginning when exhasuted  
+
+
+{\tt \#include $<$eo\-Random\-Select.h$>$}
+
+Inheritance diagram for eo\-No\-Select$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.23699cm]{classeo_no_select}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-No\-Select} ()\label{classeo_no_select_a0}
+
+\begin{CompactList}\small\item\em Ctor. \item\end{CompactList}\item 
+virtual const {\bf EOT} \& {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_no_select_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf current}\label{classeo_no_select_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-No\-Select$<$ EOT $>$}
+
+eo\-No\-Select: returns all individual in order WITHOUT USING FITNESS!!! looping back to the beginning when exhasuted 
+
+
+
+Definition at line 78 of file eo\-Random\-Select.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Random\-Select.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_normal_generator.eps b/trunk/paradiseo-eo/doc/latex/classeo_normal_generator.eps
new file mode 100644
index 000000000..2ece9d3e1
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_normal_generator.eps
@@ -0,0 +1,209 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 493.827
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.0125 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoNormalGenerator< T >) cw
+(eoRndGenerator< T >) cw
+(eoF< T >) cw
+(eoFunctorBase) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoNormalGenerator< T >) 0 0 box
+ (eoRndGenerator< T >) 0 1 box
+ (eoF< T >) 0 2 box
+ (eoFunctorBase) 0 3 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 0 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_normal_generator.tex b/trunk/paradiseo-eo/doc/latex/classeo_normal_generator.tex
new file mode 100644
index 000000000..11ad797cd
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_normal_generator.tex
@@ -0,0 +1,47 @@
+\section{eo\-Normal\-Generator$<$ T $>$ Class Template Reference}
+\label{classeo_normal_generator}\index{eoNormalGenerator@{eoNormalGenerator}}
+The class {\bf normal\_\-generator}{\rm (p.\,\pageref{classnormal__generator})} can be used in the STL generate function to easily generate gaussian distributed floats and doubles.  
+
+
+{\tt \#include $<$eo\-Rnd\-Generators.h$>$}
+
+Inheritance diagram for eo\-Normal\-Generator$<$ T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_normal_generator}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Normal\-Generator} (T \_\-stdev=T(1.0), {\bf eo\-Rng} \&\_\-rng=rng)\label{classeo_normal_generator_a0}
+
+\item 
+T {\bf operator()} (void)\label{classeo_normal_generator_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+T {\bf stdev}\label{classeo_normal_generator_r0}
+
+\item 
+{\bf eo\-Rng} \& {\bf normal}\label{classeo_normal_generator_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class T = double$>$ class eo\-Normal\-Generator$<$ T $>$}
+
+The class {\bf normal\_\-generator}{\rm (p.\,\pageref{classnormal__generator})} can be used in the STL generate function to easily generate gaussian distributed floats and doubles. 
+
+The user can supply a standard deviation which defaults to 1. 
+
+
+
+Definition at line 120 of file eo\-Rnd\-Generators.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Rnd\-Generators.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_normal_init.eps b/trunk/paradiseo-eo/doc/latex/classeo_normal_init.eps
new file mode 100644
index 000000000..28718a335
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_normal_init.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 218.579
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.2875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoNormalInit< T >) cw
+(eoInit< T >) cw
+(eoUF< T &, void >) cw
+(eoFunctorBase) cw
+(unary_function< T &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoNormalInit< T >) 0.5 0 box
+ (eoInit< T >) 0.5 1 box
+ (eoUF< T &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< T &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_normal_init.tex b/trunk/paradiseo-eo/doc/latex/classeo_normal_init.tex
new file mode 100644
index 000000000..0487bbec5
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_normal_init.tex
@@ -0,0 +1,47 @@
+\section{eo\-Normal\-Init$<$ T $>$ Class Template Reference}
+\label{classeo_normal_init}\index{eoNormalInit@{eoNormalInit}}
+The class {\bf normal\_\-generator}{\rm (p.\,\pageref{classnormal__generator})} can be used in the STL generate function to easily generate gaussian distributed floats and doubles.  
+
+
+{\tt \#include $<$eo\-Uniform\-Init.h$>$}
+
+Inheritance diagram for eo\-Normal\-Init$<$ T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_normal_init}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Normal\-Init} (T \_\-stdev=T(1.0), {\bf eo\-Rng} \&\_\-rng=rng)\label{classeo_normal_init_a0}
+
+\item 
+void {\bf operator()} (T \&\_\-t)\label{classeo_normal_init_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+T {\bf stdev}\label{classeo_normal_init_r0}
+
+\item 
+{\bf eo\-Rng} \& {\bf normal}\label{classeo_normal_init_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class T = double$>$ class eo\-Normal\-Init$<$ T $>$}
+
+The class {\bf normal\_\-generator}{\rm (p.\,\pageref{classnormal__generator})} can be used in the STL generate function to easily generate gaussian distributed floats and doubles. 
+
+The user can supply a standard deviation which defaults to 1. 
+
+
+
+Definition at line 126 of file eo\-Uniform\-Init.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Uniform\-Init.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_normal_mutation.eps b/trunk/paradiseo-eo/doc/latex/classeo_normal_mutation.eps
new file mode 100644
index 000000000..12bf3971a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_normal_mutation.eps
@@ -0,0 +1,227 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 165.837
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.015 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoNormalMutation< EOT >) cw
+(eoMonOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoUF< EOT &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, bool >) cw
+(eoOneFifthMutation< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoNormalMutation< EOT >) 0.5 1 box
+ (eoMonOp< EOT >) 0.5 2 box
+ (eoOp< EOT >) 0 3 box
+ (eoUF< EOT &, bool >) 1 3 box
+ (eoFunctorBase) 0.5 4 box
+ (unary_function< EOT &, bool >) 1.5 4 box
+ (eoOneFifthMutation< EOT >) 0.5 0 box
+
+% ----- relations -----
+
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+0 1 3 out
+solid
+0.5 1.5 4 conn
+solid
+1 0.5 4 in
+solid
+1 1.5 4 in
+solid
+1 0.5 0.25 out
+solid
+0 0.5 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_normal_mutation.tex b/trunk/paradiseo-eo/doc/latex/classeo_normal_mutation.tex
new file mode 100644
index 000000000..ae44e89b9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_normal_mutation.tex
@@ -0,0 +1,116 @@
+\section{eo\-Normal\-Mutation$<$ EOT $>$ Class Template Reference}
+\label{classeo_normal_mutation}\index{eoNormalMutation@{eoNormalMutation}}
+Simple normal mutation of a std::vector of real values.  
+
+
+{\tt \#include $<$eo\-Normal\-Mutation.h$>$}
+
+Inheritance diagram for eo\-Normal\-Mutation$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4.64345cm]{classeo_normal_mutation}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Normal\-Mutation} (double \&\_\-sigma, const double \&\_\-p\_\-change=1.0)
+\begin{CompactList}\small\item\em (Default) Constructor. \item\end{CompactList}\item 
+{\bf eo\-Normal\-Mutation} ({\bf eo\-Real\-Vector\-Bounds} \&\_\-bounds, double \_\-sigma, const double \&\_\-p\_\-change=1.0)
+\begin{CompactList}\small\item\em Constructor with bounds. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_normal_mutation_a2}
+
+\begin{CompactList}\small\item\em The class name. \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eo)
+\begin{CompactList}\small\item\em Do it! \item\end{CompactList}\item 
+double \& {\bf Sigma} ()\label{classeo_normal_mutation_a4}
+
+\begin{CompactList}\small\item\em Accessor to ref to sigma - for update and monitor. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double \& {\bf sigma}\label{classeo_normal_mutation_r0}
+
+\item 
+{\bf eo\-Real\-Vector\-Bounds} \& {\bf bounds}\label{classeo_normal_mutation_r1}
+
+\item 
+double {\bf p\_\-change}\label{classeo_normal_mutation_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Normal\-Mutation$<$ EOT $>$}
+
+Simple normal mutation of a std::vector of real values. 
+
+The st\-Dev is fixed - but it is passed ans stored as a reference, to enable dynamic mutations (see eo\-Oen\-Fith\-Mutation below).
+
+As for the bounds, the values are here folded back into the bounds. The other possiblity would be to iterate until we fall inside the bounds - but this sometimes takes a long time!!! 
+
+
+
+Definition at line 116 of file eo\-Normal\-Mutation.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoNormalMutation@{eo\-Normal\-Mutation}!eoNormalMutation@{eoNormalMutation}}
+\index{eoNormalMutation@{eoNormalMutation}!eoNormalMutation@{eo\-Normal\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Normal\-Mutation}$<$ {\bf EOT} $>$::{\bf eo\-Normal\-Mutation} (double \& {\em \_\-sigma}, const double \& {\em \_\-p\_\-change} = {\tt 1.0})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_normal_mutation_a0}
+
+
+(Default) Constructor. 
+
+The bounds are initialized with the global object that says: no bounds.
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-sigma}]the range for uniform nutation \item[{\em \_\-p\_\-change}]the probability to change a given coordinate \end{description}
+\end{Desc}
+
+
+Definition at line 127 of file eo\-Normal\-Mutation.h.\index{eoNormalMutation@{eo\-Normal\-Mutation}!eoNormalMutation@{eoNormalMutation}}
+\index{eoNormalMutation@{eoNormalMutation}!eoNormalMutation@{eo\-Normal\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Normal\-Mutation}$<$ {\bf EOT} $>$::{\bf eo\-Normal\-Mutation} ({\bf eo\-Real\-Vector\-Bounds} \& {\em \_\-bounds}, double {\em \_\-sigma}, const double \& {\em \_\-p\_\-change} = {\tt 1.0})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_normal_mutation_a1}
+
+
+Constructor with bounds. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-bounds}]an {\bf eo\-Real\-Vector\-Bounds}{\rm (p.\,\pageref{classeo_real_vector_bounds})} that contains the bounds \item[{\em \_\-sigma}]the range for uniform nutation \item[{\em \_\-p\_\-change}]the probability to change a given coordinate \end{description}
+\end{Desc}
+
+
+Definition at line 136 of file eo\-Normal\-Mutation.h.
+
+\subsection{Member Function Documentation}
+\index{eoNormalMutation@{eo\-Normal\-Mutation}!operator()@{operator()}}
+\index{operator()@{operator()}!eoNormalMutation@{eo\-Normal\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ bool {\bf eo\-Normal\-Mutation}$<$ {\bf EOT} $>$::operator() ({\bf EOT} \& {\em \_\-eo})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_normal_mutation_a3}
+
+
+Do it! 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-eo}]The cromosome undergoing the mutation \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-UF$<$ EOT \&, bool $>$} {\rm (p.\,\pageref{classeo_u_f_a1})}.
+
+Reimplemented in {\bf eo\-One\-Fifth\-Mutation$<$ EOT $>$} {\rm (p.\,\pageref{classeo_one_fifth_mutation_a2})}.
+
+Definition at line 147 of file eo\-Normal\-Mutation.h.
+
+References eo\-Rng::flip(), eo\-Real\-Base\-Vector\-Bounds::folds\-In\-Bounds(), and eo\-Rng::normal().
+
+Referenced by eo\-One\-Fifth\-Mutation$<$ EOT $>$::operator()().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Normal\-Mutation.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_normal_vec_mutation.eps b/trunk/paradiseo-eo/doc/latex/classeo_normal_vec_mutation.eps
new file mode 100644
index 000000000..b049a15df
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_normal_vec_mutation.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 132.67
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.76875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoNormalVecMutation< EOT >) cw
+(eoMonOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoUF< EOT &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoNormalVecMutation< EOT >) 0.5 0 box
+ (eoMonOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoUF< EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_normal_vec_mutation.tex b/trunk/paradiseo-eo/doc/latex/classeo_normal_vec_mutation.tex
new file mode 100644
index 000000000..11ddec0ac
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_normal_vec_mutation.tex
@@ -0,0 +1,111 @@
+\section{eo\-Normal\-Vec\-Mutation$<$ EOT $>$ Class Template Reference}
+\label{classeo_normal_vec_mutation}\index{eoNormalVecMutation@{eoNormalVecMutation}}
+Simple normal mutation of a std::vector of real values.  
+
+
+{\tt \#include $<$eo\-Normal\-Mutation.h$>$}
+
+Inheritance diagram for eo\-Normal\-Vec\-Mutation$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.71476cm]{classeo_normal_vec_mutation}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Normal\-Vec\-Mutation} (double \_\-sigma, const double \&\_\-p\_\-change=1.0)
+\begin{CompactList}\small\item\em (Default) Constructor. \item\end{CompactList}\item 
+{\bf eo\-Normal\-Vec\-Mutation} ({\bf eo\-Real\-Vector\-Bounds} \&\_\-bounds, double \_\-sigma, const double \&\_\-p\_\-change=1.0)
+\begin{CompactList}\small\item\em Constructor with bounds. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_normal_vec_mutation_a2}
+
+\begin{CompactList}\small\item\em The class name. \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eo)
+\begin{CompactList}\small\item\em Do it! \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+std::vector$<$ double $>$ {\bf sigma}\label{classeo_normal_vec_mutation_r0}
+
+\item 
+{\bf eo\-Real\-Vector\-Bounds} \& {\bf bounds}\label{classeo_normal_vec_mutation_r1}
+
+\item 
+double {\bf p\_\-change}\label{classeo_normal_vec_mutation_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Normal\-Vec\-Mutation$<$ EOT $>$}
+
+Simple normal mutation of a std::vector of real values. 
+
+The st\-Dev is fixed - but it is passed ans stored as a reference, to enable dynamic mutations (see eo\-Oen\-Fith\-Mutation below).
+
+As for the bounds, the values are here folded back into the bounds. The other possiblity would be to iterate until we fall inside the bounds - but this sometimes takes a long time!!! 
+
+
+
+Definition at line 48 of file eo\-Normal\-Mutation.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoNormalVecMutation@{eo\-Normal\-Vec\-Mutation}!eoNormalVecMutation@{eoNormalVecMutation}}
+\index{eoNormalVecMutation@{eoNormalVecMutation}!eoNormalVecMutation@{eo\-Normal\-Vec\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Normal\-Vec\-Mutation}$<$ {\bf EOT} $>$::{\bf eo\-Normal\-Vec\-Mutation} (double {\em \_\-sigma}, const double \& {\em \_\-p\_\-change} = {\tt 1.0})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_normal_vec_mutation_a0}
+
+
+(Default) Constructor. 
+
+The bounds are initialized with the global object that says: no bounds.
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-sigma}]the range for uniform nutation \item[{\em \_\-p\_\-change}]the probability to change a given coordinate \end{description}
+\end{Desc}
+
+
+Definition at line 58 of file eo\-Normal\-Mutation.h.\index{eoNormalVecMutation@{eo\-Normal\-Vec\-Mutation}!eoNormalVecMutation@{eoNormalVecMutation}}
+\index{eoNormalVecMutation@{eoNormalVecMutation}!eoNormalVecMutation@{eo\-Normal\-Vec\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Normal\-Vec\-Mutation}$<$ {\bf EOT} $>$::{\bf eo\-Normal\-Vec\-Mutation} ({\bf eo\-Real\-Vector\-Bounds} \& {\em \_\-bounds}, double {\em \_\-sigma}, const double \& {\em \_\-p\_\-change} = {\tt 1.0})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_normal_vec_mutation_a1}
+
+
+Constructor with bounds. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-bounds}]an {\bf eo\-Real\-Vector\-Bounds}{\rm (p.\,\pageref{classeo_real_vector_bounds})} that contains the bounds \item[{\em \_\-sigma}]the range for uniform nutation \item[{\em \_\-p\_\-change}]the probability to change a given coordinate\end{description}
+\end{Desc}
+for each component, the sigma is scaled to the range of the bound, if bounded 
+
+Definition at line 69 of file eo\-Normal\-Mutation.h.
+
+References eo\-Real\-Base\-Vector\-Bounds::is\-Bounded(), and eo\-Real\-Base\-Vector\-Bounds::range().
+
+\subsection{Member Function Documentation}
+\index{eoNormalVecMutation@{eo\-Normal\-Vec\-Mutation}!operator()@{operator()}}
+\index{operator()@{operator()}!eoNormalVecMutation@{eo\-Normal\-Vec\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ bool {\bf eo\-Normal\-Vec\-Mutation}$<$ {\bf EOT} $>$::operator() ({\bf EOT} \& {\em \_\-eo})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_normal_vec_mutation_a3}
+
+
+Do it! 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-eo}]The cromosome undergoing the mutation \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-UF$<$ EOT \&, bool $>$} {\rm (p.\,\pageref{classeo_u_f_a1})}.
+
+Definition at line 86 of file eo\-Normal\-Mutation.h.
+
+References eo\-Rng::flip(), eo\-Real\-Base\-Vector\-Bounds::folds\-In\-Bounds(), and eo\-Rng::normal().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Normal\-Mutation.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_nth_element_fitness_stat.eps b/trunk/paradiseo-eo/doc/latex/classeo_nth_element_fitness_stat.eps
new file mode 100644
index 000000000..5aef15d6a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_nth_element_fitness_stat.eps
@@ -0,0 +1,233 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 91.3242
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.475 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoNthElementFitnessStat< EOT >) cw
+(eoSortedStat< EOT, EOT::Fitness >) cw
+(eoSortedStatBase< EOT >) cw
+(eoValueParam< EOT::Fitness >) cw
+(eoUF< const std::vector< const EOT * > &, void >) cw
+(eoParam) cw
+(eoFunctorBase) cw
+(unary_function< const std::vector< const EOT * > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoNthElementFitnessStat< EOT >) 1 0 box
+ (eoSortedStat< EOT, EOT::Fitness >) 1 1 box
+ (eoSortedStatBase< EOT >) 0.5 2 box
+ (eoValueParam< EOT::Fitness >) 1.5 2 box
+ (eoUF< const std::vector< const EOT * > &, void >) 0.5 3 box
+ (eoParam) 1.5 3 box
+ (eoFunctorBase) 0 4 box
+ (unary_function< const std::vector< const EOT * > &, void >) 1 4 box
+
+% ----- relations -----
+
+solid
+0 1 0 out
+solid
+1 1 1 in
+solid
+0 1 1 out
+solid
+0.5 1.5 2 conn
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+1 1.5 2 in
+solid
+0 1.5 2 out
+solid
+1 0.5 3 in
+solid
+0 0.5 3 out
+solid
+0 1 4 conn
+solid
+1 1.5 3 in
+solid
+1 0 4 in
+solid
+1 1 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_nth_element_fitness_stat.tex b/trunk/paradiseo-eo/doc/latex/classeo_nth_element_fitness_stat.tex
new file mode 100644
index 000000000..a14f7c7b6
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_nth_element_fitness_stat.tex
@@ -0,0 +1,60 @@
+\section{eo\-Nth\-Element\-Fitness\-Stat$<$ EOT $>$ Class Template Reference}
+\label{classeo_nth_element_fitness_stat}\index{eoNthElementFitnessStat@{eoNthElementFitnessStat}}
+The n\_\-th element fitness in the population (see {\bf eo\-Best\-Fitness\-Stat}{\rm (p.\,\pageref{classeo_best_fitness_stat})}).  
+
+
+{\tt \#include $<$eo\-Stat.h$>$}
+
+Inheritance diagram for eo\-Nth\-Element\-Fitness\-Stat$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.55708cm]{classeo_nth_element_fitness_stat}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Fitness {\bf Fitness}\label{classeo_nth_element_fitness_stat_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Nth\-Element\-Fitness\-Stat} (unsigned \_\-which\-Element, std::string \_\-description=\char`\"{}nth element fitness\char`\"{})\label{classeo_nth_element_fitness_stat_a0}
+
+\item 
+virtual void {\bf operator()} (const std::vector$<$ const {\bf EOT} $\ast$ $>$ \&\_\-pop)\label{classeo_nth_element_fitness_stat_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} (void) const \label{classeo_nth_element_fitness_stat_a2}
+
+\end{CompactItemize}
+\subsection*{Private Member Functions}
+\begin{CompactItemize}
+\item 
+template$<$class T$>$ void {\bf doit} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop, {\bf eo\-Pareto\-Fitness}$<$ T $>$)\label{classeo_nth_element_fitness_stat_d0}
+
+\item 
+template$<$class T$>$ void {\bf doit} (const std::vector$<$ const {\bf EOT} $\ast$ $>$ \&\_\-pop, T)\label{classeo_nth_element_fitness_stat_d1}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf which\-Element}\label{classeo_nth_element_fitness_stat_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Nth\-Element\-Fitness\-Stat$<$ EOT $>$}
+
+The n\_\-th element fitness in the population (see {\bf eo\-Best\-Fitness\-Stat}{\rm (p.\,\pageref{classeo_best_fitness_stat})}). 
+
+
+
+Definition at line 211 of file eo\-Stat.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Stat.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_object.eps b/trunk/paradiseo-eo/doc/latex/classeo_object.eps
new file mode 100644
index 000000000..2ac2c1077
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_object.eps
@@ -0,0 +1,294 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 883.534
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 0.565909 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 22 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoObject) cw
+(EO< F >) cw
+(EO< double >) cw
+(EO< EOT::Fitness >) cw
+(EO< Fit >) cw
+(EO< Fitness >) cw
+(EO< fitness_type >) cw
+(EO< fitnessT >) cw
+(EO< FitT >) cw
+(EO< FType >) cw
+(EO< phenotype >) cw
+(EO< PyFitness >) cw
+(eoDistribution< EOT >) cw
+(eoFactory< EOClass >) cw
+(eoFactory< eoOpSelector< eoClass > >) cw
+(eoFactory< eoSelect< EOT > >) cw
+(eoFactory< EOT >) cw
+(eoParser) cw
+(eoPop< EOT >) cw
+(eoPop< Dummy >) cw
+(eoPop< PyEO >) cw
+(eoRng) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoObject) 0 21 box
+ (EO< F >) 1 20 box
+ (EO< double >) 1 19 box
+1 19 mark
+ (EO< EOT::Fitness >) 1 18 box
+1 18 mark
+ (EO< Fit >) 1 17 box
+1 17 mark
+ (EO< Fitness >) 1 16 box
+1 16 mark
+ (EO< fitness_type >) 1 15 box
+1 15 mark
+ (EO< fitnessT >) 1 14 box
+1 14 mark
+ (EO< FitT >) 1 13 box
+1 13 mark
+ (EO< FType >) 1 12 box
+1 12 mark
+ (EO< phenotype >) 1 11 box
+1 11 mark
+ (EO< PyFitness >) 1 10 box
+1 10 mark
+ (eoDistribution< EOT >) 1 9 box
+1 9 mark
+ (eoFactory< EOClass >) 1 8 box
+ (eoFactory< eoOpSelector< eoClass > >) 1 7 box
+1 7 mark
+ (eoFactory< eoSelect< EOT > >) 1 6 box
+1 6 mark
+ (eoFactory< EOT >) 1 5 box
+1 5 mark
+ (eoParser) 1 4 box
+ (eoPop< EOT >) 1 3 box
+ (eoPop< Dummy >) 1 2 box
+1 2 mark
+ (eoPop< PyEO >) 1 1 box
+ (eoRng) 1 0 box
+
+% ----- relations -----
+
+solid
+1 0 20.25 out
+solid
+0 0 20.5 hedge
+solid
+0 0 19.5 hedge
+solid
+0 0 18.5 hedge
+solid
+0 0 17.5 hedge
+solid
+0 0 16.5 hedge
+solid
+0 0 15.5 hedge
+solid
+0 0 14.5 hedge
+solid
+0 0 13.5 hedge
+solid
+0 0 12.5 hedge
+solid
+0 0 11.5 hedge
+solid
+0 0 10.5 hedge
+solid
+0 0 9.5 hedge
+solid
+0 0 8.5 hedge
+solid
+0 0 7.5 hedge
+solid
+0 0 6.5 hedge
+solid
+0 0 5.5 hedge
+solid
+0 0 4.5 hedge
+solid
+0 0 3.5 hedge
+solid
+0 0 2.5 hedge
+solid
+0 0 1.5 hedge
+solid
+0 0 0.5 hedge
+solid
+0 21 0.5 vedge
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_object.tex b/trunk/paradiseo-eo/doc/latex/classeo_object.tex
new file mode 100644
index 000000000..03d371482
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_object.tex
@@ -0,0 +1,57 @@
+\section{eo\-Object Class Reference}
+\label{classeo_object}\index{eoObject@{eoObject}}
+eo\-Object used to be the base class for the whole hierarchy, but this has changed.  
+
+
+{\tt \#include $<$eo\-Object.h$>$}
+
+Inheritance diagram for eo\-Object::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=12cm]{classeo_object}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual {\bf $\sim$eo\-Object} ()\label{classeo_object_a0}
+
+\begin{CompactList}\small\item\em Virtual dtor. They are needed in virtual class hierarchies. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const =0
+\begin{CompactList}\small\item\em Return the class id. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+eo\-Object used to be the base class for the whole hierarchy, but this has changed. 
+
+eo\-Object is used to define a name ({\bf class\-Name}{\rm (p.\,\pageref{classeo_object_a1})}\#) that is used when loading or saving the state.
+
+Previously, this object also defined a print and read interface, but it180s been moved to {\bf eo\-Printable}{\rm (p.\,\pageref{classeo_printable})} and {\bf eo\-Persistent}{\rm (p.\,\pageref{classeo_persistent})}.
+
+It is recommended that you only derive from eo\-Object in concrete classes. Some parts of {\bf EO}{\rm (p.\,\pageref{class_e_o})} do not implement this yet, but that will change in the future. eo\-Object, together with {\bf eo\-Persistent}{\rm (p.\,\pageref{classeo_persistent})} and {\bf eo\-Printable}{\rm (p.\,\pageref{classeo_printable})} provide a simple persistence framework that is only needed when the classes have state that changes at runtime.
+
+\begin{Desc}
+\item[See also:]{\bf eo\-Persistent}{\rm (p.\,\pageref{classeo_persistent})} {\bf eo\-Printable}{\rm (p.\,\pageref{classeo_printable})}, {\bf eo\-State}{\rm (p.\,\pageref{classeo_state})} \end{Desc}
+
+
+
+
+Definition at line 55 of file eo\-Object.h.
+
+\subsection{Member Function Documentation}
+\index{eoObject@{eo\-Object}!className@{className}}
+\index{className@{className}!eoObject@{eo\-Object}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}virtual std::string eo\-Object::class\-Name () const\hspace{0.3cm}{\tt  [pure virtual]}}\label{classeo_object_a1}
+
+
+Return the class id. 
+
+This should be redefined in each class. Only \char`\"{}leaf\char`\"{} classes can be non-virtual.
+
+Maarten: removed the default implementation as this proved to be too error-prone: I found several classes that had a typo in class\-Name (like classname), which would print eo\-Object instead of their own. Having it pure will force the implementor to provide a name. 
+
+Implemented in {\bf EO$<$ F $>$} {\rm (p.\,\pageref{class_e_o_z10_0})}, {\bf eo\-Factory$<$ EOClass $>$} {\rm (p.\,\pageref{classeo_factory_z13_0})}, {\bf eo\-Op\-Sel\-Mason$<$ eo\-Class $>$} {\rm (p.\,\pageref{classeo_op_sel_mason_z17_0})}, {\bf eo\-Pop$<$ EOT $>$} {\rm (p.\,\pageref{classeo_pop_z19_1})}, {\bf eo\-Es\-Full$<$ Fit $>$} {\rm (p.\,\pageref{classeo_es_full_a1})}, {\bf eo\-Es\-Simple$<$ Fit $>$} {\rm (p.\,\pageref{classeo_es_simple_a1})}, {\bf eo\-Es\-Stdev$<$ Fit $>$} {\rm (p.\,\pageref{classeo_es_stdev_a1})}, {\bf eo\-Real$<$ Fit\-T $>$} {\rm (p.\,\pageref{classeo_real_a1})}, {\bf eo\-Bit$<$ Fit\-T $>$} {\rm (p.\,\pageref{classeo_bit_a1})}, {\bf eo\-PBILDistrib$<$ EOT $>$} {\rm (p.\,\pageref{classeo_p_b_i_l_distrib_a6})}, {\bf eo\-Parse\-Tree$<$ FType, Node $>$} {\rm (p.\,\pageref{classeo_parse_tree_a4})}, {\bf eo\-String$<$ fitness\-T $>$} {\rm (p.\,\pageref{classeo_string_z26_0})}, {\bf eo\-Parser} {\rm (p.\,\pageref{classeo_parser_a4})}, {\bf eo\-Rng} {\rm (p.\,\pageref{classeo_rng_a18})}, {\bf eo\-One\-Max$<$ Fit\-T $>$} {\rm (p.\,\pageref{classeo_one_max_a2})}, {\bf EO$<$ double $>$} {\rm (p.\,\pageref{class_e_o_z10_0})}, {\bf EO$<$ EOT::Fitness $>$} {\rm (p.\,\pageref{class_e_o_z10_0})}, {\bf EO$<$ Fit\-T $>$} {\rm (p.\,\pageref{class_e_o_z10_0})}, {\bf EO$<$ phenotype $>$} {\rm (p.\,\pageref{class_e_o_z10_0})}, {\bf EO$<$ fitness\-T $>$} {\rm (p.\,\pageref{class_e_o_z10_0})}, {\bf EO$<$ Fit $>$} {\rm (p.\,\pageref{class_e_o_z10_0})}, {\bf EO$<$ FType $>$} {\rm (p.\,\pageref{class_e_o_z10_0})}, {\bf EO$<$ fitness\_\-type $>$} {\rm (p.\,\pageref{class_e_o_z10_0})}, {\bf EO$<$ Fitness $>$} {\rm (p.\,\pageref{class_e_o_z10_0})}, {\bf EO$<$ Py\-Fitness $>$} {\rm (p.\,\pageref{class_e_o_z10_0})}, {\bf eo\-Factory$<$ eo\-Op\-Selector$<$ eo\-Class $>$ $>$} {\rm (p.\,\pageref{classeo_factory_z13_0})}, {\bf eo\-Factory$<$ EOT $>$} {\rm (p.\,\pageref{classeo_factory_z13_0})}, {\bf eo\-Factory$<$ eo\-Select$<$ EOT $>$ $>$} {\rm (p.\,\pageref{classeo_factory_z13_0})}, {\bf eo\-Pop$<$ Py\-EO $>$} {\rm (p.\,\pageref{classeo_pop_z19_1})}, and {\bf eo\-Pop$<$ Dummy $>$} {\rm (p.\,\pageref{classeo_pop_z19_1})}.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Object.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_one_fifth_mutation.eps b/trunk/paradiseo-eo/doc/latex/classeo_one_fifth_mutation.eps
new file mode 100644
index 000000000..c8540706f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_one_fifth_mutation.eps
@@ -0,0 +1,233 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 165.837
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.015 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoOneFifthMutation< EOT >) cw
+(eoNormalMutation< EOT >) cw
+(eoUpdatable) cw
+(eoMonOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoUF< EOT &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoOneFifthMutation< EOT >) 1 0 box
+ (eoNormalMutation< EOT >) 0.5 1 box
+ (eoUpdatable) 1.5 1 box
+ (eoMonOp< EOT >) 0.5 2 box
+ (eoOp< EOT >) 0 3 box
+ (eoUF< EOT &, bool >) 1 3 box
+ (eoFunctorBase) 0.5 4 box
+ (unary_function< EOT &, bool >) 1.5 4 box
+
+% ----- relations -----
+
+solid
+0 1 0 out
+solid
+0.5 1.5 1 conn
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 1.5 1 in
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+0 1 3 out
+solid
+0.5 1.5 4 conn
+solid
+1 0.5 4 in
+solid
+1 1.5 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_one_fifth_mutation.tex b/trunk/paradiseo-eo/doc/latex/classeo_one_fifth_mutation.tex
new file mode 100644
index 000000000..cd50bef64
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_one_fifth_mutation.tex
@@ -0,0 +1,105 @@
+\section{eo\-One\-Fifth\-Mutation$<$ EOT $>$ Class Template Reference}
+\label{classeo_one_fifth_mutation}\index{eoOneFifthMutation@{eoOneFifthMutation}}
+the dynamic version: just say it is updatable - and write the {\bf update()}{\rm (p.\,\pageref{classeo_one_fifth_mutation_a3})} method! here the 1 fifth rule: count the proportion of successful mutations, and increase sigma if more than threshold (1/5 !)  
+
+
+{\tt \#include $<$eo\-Normal\-Mutation.h$>$}
+
+Inheritance diagram for eo\-One\-Fifth\-Mutation$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4.64345cm]{classeo_one_fifth_mutation}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Fitness {\bf Fitness}\label{classeo_one_fifth_mutation_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-One\-Fifth\-Mutation} ({\bf eo\-Eval\-Func}$<$ {\bf EOT} $>$ \&\_\-eval, double \&\_\-sigma\-Init, unsigned \_\-window\-Size=10, double \_\-update\-Factor=0.83, double \_\-threshold=0.2)
+\begin{CompactList}\small\item\em (Default) Constructor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_one_fifth_mutation_a1}
+
+\begin{CompactList}\small\item\em The class name. \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eo)
+\begin{CompactList}\small\item\em Do it! calls the standard mutation, then checks for success and updates stats. \item\end{CompactList}\item 
+void {\bf update} ()\label{classeo_one_fifth_mutation_a3}
+
+\begin{CompactList}\small\item\em the method that will be called every generation if the object is added to the checkpoint \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Eval\-Func}$<$ {\bf EOT} $>$ \& {\bf eval}\label{classeo_one_fifth_mutation_r0}
+
+\item 
+double {\bf threshold}\label{classeo_one_fifth_mutation_r1}
+
+\item 
+double {\bf update\-Factor}\label{classeo_one_fifth_mutation_r2}
+
+\item 
+std::vector$<$ unsigned $>$ {\bf nb\-Mut}\label{classeo_one_fifth_mutation_r3}
+
+\item 
+std::vector$<$ unsigned $>$ {\bf nb\-Success}\label{classeo_one_fifth_mutation_r4}
+
+\item 
+unsigned {\bf gen\-Index}\label{classeo_one_fifth_mutation_r5}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-One\-Fifth\-Mutation$<$ EOT $>$}
+
+the dynamic version: just say it is updatable - and write the {\bf update()}{\rm (p.\,\pageref{classeo_one_fifth_mutation_a3})} method! here the 1 fifth rule: count the proportion of successful mutations, and increase sigma if more than threshold (1/5 !) 
+
+
+
+Definition at line 177 of file eo\-Normal\-Mutation.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoOneFifthMutation@{eo\-One\-Fifth\-Mutation}!eoOneFifthMutation@{eoOneFifthMutation}}
+\index{eoOneFifthMutation@{eoOneFifthMutation}!eoOneFifthMutation@{eo\-One\-Fifth\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-One\-Fifth\-Mutation}$<$ {\bf EOT} $>$::{\bf eo\-One\-Fifth\-Mutation} ({\bf eo\-Eval\-Func}$<$ {\bf EOT} $>$ \& {\em \_\-eval}, double \& {\em \_\-sigma\-Init}, unsigned {\em \_\-window\-Size} = {\tt 10}, double {\em \_\-update\-Factor} = {\tt 0.83}, double {\em \_\-threshold} = {\tt 0.2})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_one_fifth_mutation_a0}
+
+
+(Default) Constructor. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em eval}]the evaluation function, needed to recompute the fitmess \item[{\em \_\-sigma\-Init}]the initial value for uniform mutation \item[{\em \_\-window\-Size}]the size of the window for statistics \item[{\em \_\-threshold}]the threshold (the 1/5 - 0.2) \item[{\em \_\-update\-Factor}]multiplicative update factor for sigma \end{description}
+\end{Desc}
+
+
+Definition at line 195 of file eo\-Normal\-Mutation.h.
+
+\subsection{Member Function Documentation}
+\index{eoOneFifthMutation@{eo\-One\-Fifth\-Mutation}!operator()@{operator()}}
+\index{operator()@{operator()}!eoOneFifthMutation@{eo\-One\-Fifth\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ bool {\bf eo\-One\-Fifth\-Mutation}$<$ {\bf EOT} $>$::operator() ({\bf EOT} \& {\em \_\-eo})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_one_fifth_mutation_a2}
+
+
+Do it! calls the standard mutation, then checks for success and updates stats. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-eo}]The chromosome undergoing the mutation \end{description}
+\end{Desc}
+
+
+Reimplemented from {\bf eo\-Normal\-Mutation$<$ EOT $>$} {\rm (p.\,\pageref{classeo_normal_mutation_a3})}.
+
+Definition at line 216 of file eo\-Normal\-Mutation.h.
+
+References EO$<$ F $>$::fitness(), EO$<$ F $>$::invalid(), EO$<$ F $>$::invalidate(), and eo\-Normal\-Mutation$<$ EOT $>$::operator()().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Normal\-Mutation.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_one_max.eps b/trunk/paradiseo-eo/doc/latex/classeo_one_max.eps
new file mode 100644
index 000000000..6129cadda
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_one_max.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 314.961
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.5875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoOneMax< FitT >) cw
+(EO< FitT >) cw
+(eoObject) cw
+(eoPersistent) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoOneMax< FitT >) 0.5 0 box
+ (EO< FitT >) 0.5 1 box
+ (eoObject) 0 2 box
+ (eoPersistent) 1 2 box
+ (eoPrintable) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_one_max.tex b/trunk/paradiseo-eo/doc/latex/classeo_one_max.tex
new file mode 100644
index 000000000..8cc09ac36
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_one_max.tex
@@ -0,0 +1,108 @@
+\section{eo\-One\-Max$<$ Fit\-T $>$ Class Template Reference}
+\label{classeo_one_max}\index{eoOneMax@{eoOneMax}}
+Always write a comment in this format before class definition if you want the class to be documented by Doxygen.  
+
+
+{\tt \#include $<$eo\-One\-Max.h$>$}
+
+Inheritance diagram for eo\-One\-Max$<$ Fit\-T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_one_max}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-One\-Max} ()
+\begin{CompactList}\small\item\em Ctor: you MUST provide a default ctor. \item\end{CompactList}\item 
+virtual string {\bf class\-Name} () const 
+\begin{CompactList}\small\item\em Return the class id. \item\end{CompactList}\item 
+void {\bf print\-On} (ostream \&\_\-os) const 
+\begin{CompactList}\small\item\em printing... \item\end{CompactList}\item 
+void {\bf read\-From} (istream \&\_\-is)
+\begin{CompactList}\small\item\em reading... \item\end{CompactList}\item 
+void {\bf set\-B} (vector$<$ bool $>$ \&\_\-b)\label{classeo_one_max_a5}
+
+\item 
+const vector$<$ bool $>$ \& {\bf B} ()\label{classeo_one_max_a6}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+std::vector$<$ bool $>$ {\bf b}\label{classeo_one_max_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Fit\-T$>$ class eo\-One\-Max$<$ Fit\-T $>$}
+
+Always write a comment in this format before class definition if you want the class to be documented by Doxygen. 
+
+Note that you MUST derive your structure from EO$<$fit\-T$>$ but you MAY use some other already prepared class in the hierarchy like {\bf eo\-Vector}{\rm (p.\,\pageref{classeo_vector})} for instance, if you handle a vector of something....
+
+If you create a structure from scratch, the only thing you need to provide are a default constructor IO routines print\-On and read\-From
+
+Note that operator$<$$<$ and operator$>$$>$ are defined at {\bf EO}{\rm (p.\,\pageref{class_e_o})} level using these routines 
+
+
+
+Definition at line 31 of file eo\-One\-Max.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoOneMax@{eo\-One\-Max}!eoOneMax@{eoOneMax}}
+\index{eoOneMax@{eoOneMax}!eoOneMax@{eo\-One\-Max}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Fit\-T$>$ {\bf eo\-One\-Max}$<$ {\bf Fit\-T} $>$::{\bf eo\-One\-Max} ()\hspace{0.3cm}{\tt  [inline]}}\label{classeo_one_max_a0}
+
+
+Ctor: you MUST provide a default ctor. 
+
+though such individuals will generally be processed by some {\bf eo\-Init}{\rm (p.\,\pageref{classeo_init})} object 
+
+Definition at line 37 of file eo\-One\-Max.h.
+
+\subsection{Member Function Documentation}
+\index{eoOneMax@{eo\-One\-Max}!className@{className}}
+\index{className@{className}!eoOneMax@{eo\-One\-Max}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Fit\-T$>$ virtual string {\bf eo\-One\-Max}$<$ {\bf Fit\-T} $>$::class\-Name (void) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_one_max_a2}
+
+
+Return the class id. 
+
+\begin{Desc}
+\item[Returns:]the class name as a std::string \end{Desc}
+
+
+Reimplemented from {\bf EO$<$ Fit\-T $>$} {\rm (p.\,\pageref{class_e_o_z10_0})}.
+
+Definition at line 49 of file eo\-One\-Max.h.\index{eoOneMax@{eo\-One\-Max}!printOn@{printOn}}
+\index{printOn@{printOn}!eoOneMax@{eo\-One\-Max}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Fit\-T$>$ void {\bf eo\-One\-Max}$<$ {\bf Fit\-T} $>$::print\-On (ostream \& {\em \_\-os}) const\hspace{0.3cm}{\tt  [inline]}}\label{classeo_one_max_a3}
+
+
+printing... 
+
+HINTS in {\bf EO}{\rm (p.\,\pageref{class_e_o})} we systematically write the sizes of things before the things so read\-From is easier to code (see below)
+
+Definition at line 52 of file eo\-One\-Max.h.
+
+References EO$<$ F $>$::print\-On().\index{eoOneMax@{eo\-One\-Max}!readFrom@{readFrom}}
+\index{readFrom@{readFrom}!eoOneMax@{eo\-One\-Max}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Fit\-T$>$ void {\bf eo\-One\-Max}$<$ {\bf Fit\-T} $>$::read\-From (istream \& {\em \_\-is})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_one_max_a4}
+
+
+reading... 
+
+of course, your read\-From must be able to read what print\-On writes!!!
+
+HINTS remember the eo\-One\-Max object will come from the default ctor this is why having the sizes written out is useful 
+
+Definition at line 72 of file eo\-One\-Max.h.
+
+References EO$<$ F $>$::read\-From().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-One\-Max.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_one_max_eval_func.eps b/trunk/paradiseo-eo/doc/latex/classeo_one_max_eval_func.eps
new file mode 100644
index 000000000..8ed1ec006
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_one_max_eval_func.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 199.005
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.5125 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoOneMaxEvalFunc< EOT >) cw
+(eoEvalFunc< EOT >) cw
+(eoUF< EOT &, void >) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoOneMaxEvalFunc< EOT >) 0.5 0 box
+ (eoEvalFunc< EOT >) 0.5 1 box
+ (eoUF< EOT &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< EOT &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_one_max_eval_func.tex b/trunk/paradiseo-eo/doc/latex/classeo_one_max_eval_func.tex
new file mode 100644
index 000000000..b7b59e420
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_one_max_eval_func.tex
@@ -0,0 +1,56 @@
+\section{eo\-One\-Max\-Eval\-Func$<$ EOT $>$ Class Template Reference}
+\label{classeo_one_max_eval_func}\index{eoOneMaxEvalFunc@{eoOneMaxEvalFunc}}
+Always write a comment in this format before class definition if you want the class to be documented by Doxygen.  
+
+
+{\tt \#include $<$eo\-One\-Max\-Eval\-Func.h$>$}
+
+Inheritance diagram for eo\-One\-Max\-Eval\-Func$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_one_max_eval_func}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-One\-Max\-Eval\-Func} ()\label{classeo_one_max_eval_func_a0}
+
+\begin{CompactList}\small\item\em Ctor - no requirement. \item\end{CompactList}\item 
+void {\bf operator()} ({\bf EOT} \&\_\-eo)
+\begin{CompactList}\small\item\em Actually compute the fitness. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-One\-Max\-Eval\-Func$<$ EOT $>$}
+
+Always write a comment in this format before class definition if you want the class to be documented by Doxygen. 
+
+
+
+Definition at line 26 of file eo\-One\-Max\-Eval\-Func.h.
+
+\subsection{Member Function Documentation}
+\index{eoOneMaxEvalFunc@{eo\-One\-Max\-Eval\-Func}!operator()@{operator()}}
+\index{operator()@{operator()}!eoOneMaxEvalFunc@{eo\-One\-Max\-Eval\-Func}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ void {\bf eo\-One\-Max\-Eval\-Func}$<$ {\bf EOT} $>$::operator() ({\bf EOT} \& {\em \_\-eo})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_one_max_eval_func_a1}
+
+
+Actually compute the fitness. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em EOT}]\& \_\-eo the {\bf EO}{\rm (p.\,\pageref{class_e_o})} object to evaluate it should stay templatized to be usable with any fitness type \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-UF$<$ EOT \&, void $>$} {\rm (p.\,\pageref{classeo_u_f_a1})}.
+
+Definition at line 45 of file eo\-One\-Max\-Eval\-Func.h.
+
+References EO$<$ F $>$::fitness(), and EO$<$ F $>$::invalid().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-One\-Max\-Eval\-Func.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_one_max_init.eps b/trunk/paradiseo-eo/doc/latex/classeo_one_max_init.eps
new file mode 100644
index 000000000..36a3b0855
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_one_max_init.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 168.776
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.9625 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoOneMaxInit< GenotypeT >) cw
+(eoInit< GenotypeT >) cw
+(eoUF< GenotypeT &, void >) cw
+(eoFunctorBase) cw
+(unary_function< GenotypeT &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoOneMaxInit< GenotypeT >) 0.5 0 box
+ (eoInit< GenotypeT >) 0.5 1 box
+ (eoUF< GenotypeT &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< GenotypeT &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_one_max_init.tex b/trunk/paradiseo-eo/doc/latex/classeo_one_max_init.tex
new file mode 100644
index 000000000..4627a3721
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_one_max_init.tex
@@ -0,0 +1,64 @@
+\section{eo\-One\-Max\-Init$<$ Genotype\-T $>$ Class Template Reference}
+\label{classeo_one_max_init}\index{eoOneMaxInit@{eoOneMaxInit}}
+Always write a comment in this format before class definition if you want the class to be documented by Doxygen.  
+
+
+{\tt \#include $<$eo\-One\-Max\-Init.h$>$}
+
+Inheritance diagram for eo\-One\-Max\-Init$<$ Genotype\-T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_one_max_init}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-One\-Max\-Init} (unsigned \_\-vec\-Size)\label{classeo_one_max_init_a0}
+
+\begin{CompactList}\small\item\em Ctor - no requirement. \item\end{CompactList}\item 
+void {\bf operator()} (Genotype\-T \&\_\-genotype)
+\begin{CompactList}\small\item\em initialize a genotype \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf vec\-Size}\label{classeo_one_max_init_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Genotype\-T$>$ class eo\-One\-Max\-Init$<$ Genotype\-T $>$}
+
+Always write a comment in this format before class definition if you want the class to be documented by Doxygen. 
+
+There is NO ASSUMPTION on the class Genoype\-T. In particular, it does not need to derive from {\bf EO}{\rm (p.\,\pageref{class_e_o})} (e.g. to initialize atoms of an {\bf eo\-Vector}{\rm (p.\,\pageref{classeo_vector})} you will need an {\bf eo\-Init$<$Atom\-Type$>$}{\rm (p.\,\pageref{classeo_init})}) 
+
+
+
+Definition at line 26 of file eo\-One\-Max\-Init.h.
+
+\subsection{Member Function Documentation}
+\index{eoOneMaxInit@{eo\-One\-Max\-Init}!operator()@{operator()}}
+\index{operator()@{operator()}!eoOneMaxInit@{eo\-One\-Max\-Init}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Genotype\-T$>$ void {\bf eo\-One\-Max\-Init}$<$ Genotype\-T $>$::operator() (Genotype\-T \& {\em \_\-genotype})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_one_max_init_a1}
+
+
+initialize a genotype 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-genotype}]generally a genotype that has been default-constructed whatever it contains will be lost \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-UF$<$ Genotype\-T \&, void $>$} {\rm (p.\,\pageref{classeo_u_f_a1})}.
+
+Definition at line 44 of file eo\-One\-Max\-Init.h.
+
+References eo\-Rng::flip().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-One\-Max\-Init.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_one_max_mutation.eps b/trunk/paradiseo-eo/doc/latex/classeo_one_max_mutation.eps
new file mode 100644
index 000000000..ec27106f5
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_one_max_mutation.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 112.518
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.44375 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoOneMaxMutation< GenotypeT >) cw
+(eoMonOp< GenotypeT >) cw
+(eoOp< GenotypeT >) cw
+(eoUF< GenotypeT &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< GenotypeT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoOneMaxMutation< GenotypeT >) 0.5 0 box
+ (eoMonOp< GenotypeT >) 0.5 1 box
+ (eoOp< GenotypeT >) 0 2 box
+ (eoUF< GenotypeT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< GenotypeT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_one_max_mutation.tex b/trunk/paradiseo-eo/doc/latex/classeo_one_max_mutation.tex
new file mode 100644
index 000000000..7e97af7f6
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_one_max_mutation.tex
@@ -0,0 +1,61 @@
+\section{eo\-One\-Max\-Mutation$<$ Genotype\-T $>$ Class Template Reference}
+\label{classeo_one_max_mutation}\index{eoOneMaxMutation@{eoOneMaxMutation}}
+Always write a comment in this format before class definition if you want the class to be documented by Doxygen.  
+
+
+{\tt \#include $<$eo\-One\-Max\-Mutation.h$>$}
+
+Inheritance diagram for eo\-One\-Max\-Mutation$<$ Genotype\-T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.15049cm]{classeo_one_max_mutation}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-One\-Max\-Mutation} ()\label{classeo_one_max_mutation_a0}
+
+\begin{CompactList}\small\item\em Ctor - no requirement. \item\end{CompactList}\item 
+string {\bf class\-Name} () const \label{classeo_one_max_mutation_a1}
+
+\begin{CompactList}\small\item\em The class name. Used to display statistics. \item\end{CompactList}\item 
+bool {\bf operator()} (Genotype\-T \&\_\-genotype)
+\begin{CompactList}\small\item\em modifies the parent \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Genotype\-T$>$ class eo\-One\-Max\-Mutation$<$ Genotype\-T $>$}
+
+Always write a comment in this format before class definition if you want the class to be documented by Doxygen. 
+
+THere is NO ASSUMPTION on the class Genoype\-T. In particular, it does not need to derive from {\bf EO}{\rm (p.\,\pageref{class_e_o})} 
+
+
+
+Definition at line 25 of file eo\-One\-Max\-Mutation.h.
+
+\subsection{Member Function Documentation}
+\index{eoOneMaxMutation@{eo\-One\-Max\-Mutation}!operator()@{operator()}}
+\index{operator()@{operator()}!eoOneMaxMutation@{eo\-One\-Max\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Genotype\-T$>$ bool {\bf eo\-One\-Max\-Mutation}$<$ Genotype\-T $>$::operator() (Genotype\-T \& {\em \_\-genotype})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_one_max_mutation_a2}
+
+
+modifies the parent 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-genotype}]The parent genotype (will be modified)\end{description}
+\end{Desc}
+
+
+Requirement if (\_\-genotype has been modified) is\-Modified = true; else is\-Modified = false; 
+
+Implements {\bf eo\-UF$<$ Genotype\-T \&, bool $>$} {\rm (p.\,\pageref{classeo_u_f_a1})}.
+
+Definition at line 47 of file eo\-One\-Max\-Mutation.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-One\-Max\-Mutation.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_one_max_quad_crossover.eps b/trunk/paradiseo-eo/doc/latex/classeo_one_max_quad_crossover.eps
new file mode 100644
index 000000000..7f9aae6ec
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_one_max_quad_crossover.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 82.3045
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 6.075 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoOneMaxQuadCrossover< GenotypeT >) cw
+(eoQuadOp< GenotypeT >) cw
+(eoOp< GenotypeT >) cw
+(eoBF< GenotypeT &, GenotypeT &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< GenotypeT &, GenotypeT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoOneMaxQuadCrossover< GenotypeT >) 0.5 0 box
+ (eoQuadOp< GenotypeT >) 0.5 1 box
+ (eoOp< GenotypeT >) 0 2 box
+ (eoBF< GenotypeT &, GenotypeT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< GenotypeT &, GenotypeT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_one_max_quad_crossover.tex b/trunk/paradiseo-eo/doc/latex/classeo_one_max_quad_crossover.tex
new file mode 100644
index 000000000..65de8a6ff
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_one_max_quad_crossover.tex
@@ -0,0 +1,61 @@
+\section{eo\-One\-Max\-Quad\-Crossover$<$ Genotype\-T $>$ Class Template Reference}
+\label{classeo_one_max_quad_crossover}\index{eoOneMaxQuadCrossover@{eoOneMaxQuadCrossover}}
+Always write a comment in this format before class definition if you want the class to be documented by Doxygen.  
+
+
+{\tt \#include $<$eo\-One\-Max\-Quad\-Crossover.h$>$}
+
+Inheritance diagram for eo\-One\-Max\-Quad\-Crossover$<$ Genotype\-T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.30453cm]{classeo_one_max_quad_crossover}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-One\-Max\-Quad\-Crossover} ()\label{classeo_one_max_quad_crossover_a0}
+
+\begin{CompactList}\small\item\em Ctor - no requirement. \item\end{CompactList}\item 
+string {\bf class\-Name} () const \label{classeo_one_max_quad_crossover_a1}
+
+\begin{CompactList}\small\item\em The class name. Used to display statistics. \item\end{CompactList}\item 
+bool {\bf operator()} (Genotype\-T \&\_\-genotype1, Genotype\-T \&\_\-genotype2)
+\begin{CompactList}\small\item\em eo\-Quad crossover - modifies both parents \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Genotype\-T$>$ class eo\-One\-Max\-Quad\-Crossover$<$ Genotype\-T $>$}
+
+Always write a comment in this format before class definition if you want the class to be documented by Doxygen. 
+
+THere is NO ASSUMPTION on the class Genoype\-T. In particular, it does not need to derive from {\bf EO}{\rm (p.\,\pageref{class_e_o})} 
+
+
+
+Definition at line 26 of file eo\-One\-Max\-Quad\-Crossover.h.
+
+\subsection{Member Function Documentation}
+\index{eoOneMaxQuadCrossover@{eo\-One\-Max\-Quad\-Crossover}!operator()@{operator()}}
+\index{operator()@{operator()}!eoOneMaxQuadCrossover@{eo\-One\-Max\-Quad\-Crossover}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Genotype\-T$>$ bool {\bf eo\-One\-Max\-Quad\-Crossover}$<$ Genotype\-T $>$::operator() (Genotype\-T \& {\em \_\-genotype1}, Genotype\-T \& {\em \_\-genotype2})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_one_max_quad_crossover_a2}
+
+
+eo\-Quad crossover - modifies both parents 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-genotype1}]The first parent \item[{\em \_\-genotype2}]The second parent\end{description}
+\end{Desc}
+
+
+Requirement if (at least one genotype has been modified) // no way to distinguish one\-At\-Least\-Is\-Modified = true; else one\-At\-Least\-Is\-Modified = false; 
+
+Implements {\bf eo\-BF$<$ Genotype\-T \&, Genotype\-T \&, bool $>$} {\rm (p.\,\pageref{classeo_b_f_a1})}.
+
+Definition at line 49 of file eo\-One\-Max\-Quad\-Crossover.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-One\-Max\-Quad\-Crossover.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_op.eps
new file mode 100644
index 000000000..8d02b11be
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_op.eps
@@ -0,0 +1,207 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 87.7193
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.7 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 2 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoOp< EOType >) cw
+(eoBinOp< EOType >) cw
+(eoMonOp< EOType >) cw
+(eoQuadOp< EOType >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoOp< EOType >) 1 1 box
+ (eoBinOp< EOType >) 0 0 box
+ (eoMonOp< EOType >) 1 0 box
+ (eoQuadOp< EOType >) 2 0 box
+
+% ----- relations -----
+
+solid
+1 1 0.25 out
+solid
+0 2 1 conn
+solid
+0 0 0.75 in
+solid
+0 1 0.75 in
+solid
+0 2 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_op.tex
new file mode 100644
index 000000000..d6cf1a982
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_op.tex
@@ -0,0 +1,53 @@
+\section{eo\-Op$<$ EOType $>$ Class Template Reference}
+\label{classeo_op}\index{eoOp@{eoOp}}
+Abstract data types for {\bf EO}{\rm (p.\,\pageref{class_e_o})} operators.  
+
+
+{\tt \#include $<$eo\-Op.h$>$}
+
+Inheritance diagram for eo\-Op$<$ EOType $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2cm]{classeo_op}
+\end{center}
+\end{figure}
+\subsection*{[NOHEADER]}
+\begin{CompactItemize}
+\item 
+enum {\bf Op\-Type} \{ {\bf unary} =  0, 
+{\bf binary} =  1, 
+{\bf quadratic} =  2, 
+{\bf general} =  3
+ \}
+\item 
+{\bf eo\-Op} (Op\-Type \_\-type)\label{classeo_op_z14_1}
+
+\begin{CompactList}\small\item\em Ctor. \item\end{CompactList}\item 
+{\bf eo\-Op} (const {\bf eo\-Op} \&\_\-eop)\label{classeo_op_z14_2}
+
+\begin{CompactList}\small\item\em Copy Ctor. \item\end{CompactList}\item 
+virtual {\bf $\sim$eo\-Op} ()\label{classeo_op_z14_3}
+
+\begin{CompactList}\small\item\em Needed virtual destructor. \item\end{CompactList}\item 
+Op\-Type {\bf get\-Type} () const \label{classeo_op_z14_4}
+
+\begin{CompactList}\small\item\em get\-Type: number of operands it takes and individuals it produces \item\end{CompactList}\item 
+Op\-Type {\bf op\-Type}\label{classeo_op_z14_5}
+
+\begin{CompactList}\small\item\em Op\-Type is the type of the operator: how many operands it takes and how many it produces. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOType$>$ class eo\-Op$<$ EOType $>$}
+
+Abstract data types for {\bf EO}{\rm (p.\,\pageref{class_e_o})} operators. 
+
+Genetic operators act on chromosomes, changing them. The type to use them on is problem specific. If your genotype is a std::vector$<$bool$>$, there are operators that work specifically on std::vector$<$bool$>$, but you might also find that generic operators working on std::vector$<$T$>$ are what you need. 
+
+
+
+Definition at line 68 of file eo\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_op_container.eps b/trunk/paradiseo-eo/doc/latex/classeo_op_container.eps
new file mode 100644
index 000000000..e90ff5e57
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_op_container.eps
@@ -0,0 +1,233 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 113.766
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.395 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoOpContainer< EOT >) cw
+(eoGenOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoUF< eoPopulator< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< eoPopulator< EOT > &, void >) cw
+(eoProportionalOp< EOT >) cw
+(eoSequentialOp< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoOpContainer< EOT >) 0.5 1 box
+ (eoGenOp< EOT >) 0.5 2 box
+ (eoOp< EOT >) 0 3 box
+ (eoUF< eoPopulator< EOT > &, void >) 1 3 box
+ (eoFunctorBase) 0.5 4 box
+ (unary_function< eoPopulator< EOT > &, void >) 1.5 4 box
+ (eoProportionalOp< EOT >) 0 0 box
+ (eoSequentialOp< EOT >) 1 0 box
+
+% ----- relations -----
+
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+0 1 3 out
+solid
+0.5 1.5 4 conn
+solid
+1 0.5 4 in
+solid
+1 1.5 4 in
+solid
+1 0.5 0.25 out
+solid
+0 1 1 conn
+solid
+0 0 0.75 in
+solid
+0 1 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_op_container.tex b/trunk/paradiseo-eo/doc/latex/classeo_op_container.tex
new file mode 100644
index 000000000..d5d4dd2e9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_op_container.tex
@@ -0,0 +1,76 @@
+\section{eo\-Op\-Container$<$ EOT $>$ Class Template Reference}
+\label{classeo_op_container}\index{eoOpContainer@{eoOpContainer}}
+eo\-Op\-Container is a base class for the sequential and proportional selectors It takes care of wrapping the other operators, and deleting stuff that it has allocated  
+
+
+{\tt \#include $<$eo\-Op\-Container.h$>$}
+
+Inheritance diagram for eo\-Op\-Container$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.18544cm]{classeo_op_container}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Op\-Container} ()\label{classeo_op_container_a0}
+
+\begin{CompactList}\small\item\em Ctor: nothing much to do. \item\end{CompactList}\item 
+virtual {\bf $\sim$eo\-Op\-Container} (void)\label{classeo_op_container_a1}
+
+\begin{CompactList}\small\item\em Dtor: delete all the Gen\-Ops created when wrapping simple ops. \item\end{CompactList}\item 
+virtual unsigned {\bf max\_\-production} (void)\label{classeo_op_container_a2}
+
+\begin{CompactList}\small\item\em for memory management (doesn't have to be very precise \item\end{CompactList}\item 
+void {\bf add} ({\bf eo\-Op}$<$ {\bf EOT} $>$ \&\_\-op, double \_\-rate)
+\begin{CompactList}\small\item\em Add an operator to the container, also give it a rate. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const =0\label{classeo_op_container_a4}
+
+\end{CompactItemize}
+\subsection*{Protected Attributes}
+\begin{CompactItemize}
+\item 
+std::vector$<$ double $>$ {\bf rates}\label{classeo_op_container_p0}
+
+\item 
+std::vector$<$ {\bf eo\-Gen\-Op}$<$ {\bf EOT} $>$ $\ast$ $>$ {\bf ops}\label{classeo_op_container_p1}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Functor\-Store} {\bf store}\label{classeo_op_container_r0}
+
+\item 
+unsigned {\bf max\_\-to\_\-produce}\label{classeo_op_container_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Op\-Container$<$ EOT $>$}
+
+eo\-Op\-Container is a base class for the sequential and proportional selectors It takes care of wrapping the other operators, and deleting stuff that it has allocated 
+
+Warning: all operators are added together with a rate (double) However, the meaning of this rate will be different in the differnet instances of eo\-Op\-Container: an $\ast$$\ast$$\ast$absolute$\ast$$\ast$$\ast$ probability in the sequential version, and a $\ast$$\ast$$\ast$relative$\ast$$\ast$$\ast$ weight in the proportional version 
+
+
+
+Definition at line 42 of file eo\-Op\-Container.h.
+
+\subsection{Member Function Documentation}
+\index{eoOpContainer@{eo\-Op\-Container}!add@{add}}
+\index{add@{add}!eoOpContainer@{eo\-Op\-Container}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ void {\bf eo\-Op\-Container}$<$ {\bf EOT} $>$::add ({\bf eo\-Op}$<$ {\bf EOT} $>$ \& {\em \_\-op}, double {\em \_\-rate})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_op_container_a3}
+
+
+Add an operator to the container, also give it a rate. 
+
+(sidenote, it's much less hairy since I added the wrap\_\-op is used) 
+
+Definition at line 63 of file eo\-Op\-Container.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Op\-Container.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_op_sel_mason.eps b/trunk/paradiseo-eo/doc/latex/classeo_op_sel_mason.eps
new file mode 100644
index 000000000..b8f92c4e7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_op_sel_mason.eps
@@ -0,0 +1,203 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 240.964
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.075 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 3 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoOpSelMason< eoClass >) cw
+(eoFactory< eoOpSelector< eoClass > >) cw
+(eoObject) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoOpSelMason< eoClass >) 0 0 box
+ (eoFactory< eoOpSelector< eoClass > >) 0 1 box
+ (eoObject) 0 2 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_op_sel_mason.tex b/trunk/paradiseo-eo/doc/latex/classeo_op_sel_mason.tex
new file mode 100644
index 000000000..d598bff71
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_op_sel_mason.tex
@@ -0,0 +1,83 @@
+\section{eo\-Op\-Sel\-Mason$<$ eo\-Class $>$ Class Template Reference}
+\label{classeo_op_sel_mason}\index{eoOpSelMason@{eoOpSelMason}}
+{\bf EO}{\rm (p.\,\pageref{class_e_o})} Mason, or builder, for operator selectors.  
+
+
+{\tt \#include $<$eo\-Op\-Sel\-Mason.h$>$}
+
+Inheritance diagram for eo\-Op\-Sel\-Mason$<$ eo\-Class $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3cm]{classeo_op_sel_mason}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef std::vector$<$ {\bf eo\-Op}$<$ eo\-Class $>$ $\ast$ $>$ {\bf v\-Op\-P}\label{classeo_op_sel_mason_w0}
+
+\item 
+typedef map$<$ eo\-Op\-Selector$<$ eo\-Class $>$ $\ast$, v\-Op\-P $>$ {\bf MEV}\label{classeo_op_sel_mason_w1}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual eo\-Op\-Selector$<$ eo\-Class $>$ $\ast$ {\bf make} (std::istream \&\_\-is)
+\begin{CompactList}\small\item\em Factory methods: creates an object from an std::istream, reading from it whatever is needed to create the object. \item\end{CompactList}\end{CompactItemize}
+\begin{Indent}{\bf ctors and dtors}\par
+\begin{CompactItemize}
+\item 
+{\bf eo\-Op\-Sel\-Mason} (eo\-Op\-Factory$<$ eo\-Class $>$ \&\_\-op\-Fact)\label{classeo_op_sel_mason_z15_0}
+
+\begin{CompactList}\small\item\em constructor \item\end{CompactList}\item 
+virtual {\bf $\sim$eo\-Op\-Sel\-Mason} ()\label{classeo_op_sel_mason_z15_1}
+
+\begin{CompactList}\small\item\em destructor \item\end{CompactList}\end{CompactItemize}
+\end{Indent}
+\begin{Indent}{\bf eo\-Object methods}\par
+\begin{CompactItemize}
+\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_op_sel_mason_z17_0}
+
+\begin{CompactList}\small\item\em Return the class id. \item\end{CompactList}\end{CompactItemize}
+\end{Indent}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+map$<$ eo\-Op\-Selector$<$ eo\-Class $>$ $\ast$, std::vector$<$ {\bf eo\-Op}$<$ eo\-Class $>$ $\ast$ $>$ $>$ {\bf alloc\-Map}\label{classeo_op_sel_mason_r0}
+
+\item 
+eo\-Op\-Factory$<$ eo\-Class $>$ \& {\bf operator\-Factory}\label{classeo_op_sel_mason_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class eo\-Class$>$ class eo\-Op\-Sel\-Mason$<$ eo\-Class $>$}
+
+{\bf EO}{\rm (p.\,\pageref{class_e_o})} Mason, or builder, for operator selectors. 
+
+A builder must allocate memory to the objects it builds, and then deallocate it when it gets out of scope 
+
+
+
+Definition at line 39 of file eo\-Op\-Sel\-Mason.h.
+
+\subsection{Member Function Documentation}
+\index{eoOpSelMason@{eo\-Op\-Sel\-Mason}!make@{make}}
+\index{make@{make}!eoOpSelMason@{eo\-Op\-Sel\-Mason}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class eo\-Class$>$ virtual eo\-Op\-Selector$<$eo\-Class$>$$\ast$ {\bf eo\-Op\-Sel\-Mason}$<$ eo\-Class $>$::make (std::istream \& {\em \_\-is})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_op_sel_mason_a0}
+
+
+Factory methods: creates an object from an std::istream, reading from it whatever is needed to create the object. 
+
+The format is op\-Sel\-Class\-Name$\backslash$ rate 1 operator1$\backslash$ rate 2 operator2$\backslash$ ...$\backslash$ Stores all operators built in a database (\#alloc\-Map\#), so that somebody can destroy them later. The Mason is in charge or destroying the operators, since the built object can180t do it itself. The objects built must be destroyed from outside, using the \#destroy\# method
+
+Implements {\bf eo\-Factory$<$ eo\-Op\-Selector$<$ eo\-Class $>$ $>$} {\rm (p.\,\pageref{classeo_factory_a0})}.
+
+Definition at line 65 of file eo\-Op\-Sel\-Mason.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Op\-Sel\-Mason.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_p_b_i_l_additive.eps b/trunk/paradiseo-eo/doc/latex/classeo_p_b_i_l_additive.eps
new file mode 100644
index 000000000..05f713c78
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_p_b_i_l_additive.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 96.8523
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.1625 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoPBILAdditive< EOT >) cw
+(eoDistribUpdater< EOT >) cw
+(eoBF< eoDistribution< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoDistribution< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoPBILAdditive< EOT >) 0.5 0 box
+ (eoDistribUpdater< EOT >) 0.5 1 box
+ (eoBF< eoDistribution< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< eoDistribution< EOT > &, eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_p_b_i_l_additive.tex b/trunk/paradiseo-eo/doc/latex/classeo_p_b_i_l_additive.tex
new file mode 100644
index 000000000..496a29420
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_p_b_i_l_additive.tex
@@ -0,0 +1,66 @@
+\section{eo\-PBILAdditive$<$ EOT $>$ Class Template Reference}
+\label{classeo_p_b_i_l_additive}\index{eoPBILAdditive@{eoPBILAdditive}}
+Distribution Class for PBIL algorithm (Population-Based Incremental Learning, Baluja and Caruana 96).  
+
+
+{\tt \#include $<$eo\-PBILAdditive.h$>$}
+
+Inheritance diagram for eo\-PBILAdditive$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.71186cm]{classeo_p_b_i_l_additive}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-PBILAdditive} (double \_\-LRBest, unsigned \_\-nb\-Best=1, double \_\-tolerance=0.0, double \_\-LRWorst=0.0, unsigned \_\-nb\-Worst=0)\label{classeo_p_b_i_l_additive_a0}
+
+\begin{CompactList}\small\item\em Ctor with parameters using the default values is equivalent to using {\bf eo\-PBILOrg}{\rm (p.\,\pageref{classeo_p_b_i_l_org})}. \item\end{CompactList}\item 
+virtual void {\bf operator()} ({\bf eo\-Distribution}$<$ {\bf EOT} $>$ \&\_\-distrib, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_p_b_i_l_additive_a1}
+
+\begin{CompactList}\small\item\em Update the distribution from the current population. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf max\-Bound}\label{classeo_p_b_i_l_additive_r0}
+
+\item 
+double {\bf min\-Bound}\label{classeo_p_b_i_l_additive_r1}
+
+\item 
+double {\bf LR}\label{classeo_p_b_i_l_additive_r2}
+
+\item 
+unsigned {\bf nb\-Best}\label{classeo_p_b_i_l_additive_r3}
+
+\item 
+unsigned {\bf nb\-Worst}\label{classeo_p_b_i_l_additive_r4}
+
+\item 
+double {\bf lrb}\label{classeo_p_b_i_l_additive_r5}
+
+\item 
+double {\bf lrw}\label{classeo_p_b_i_l_additive_r6}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-PBILAdditive$<$ EOT $>$}
+
+Distribution Class for PBIL algorithm (Population-Based Incremental Learning, Baluja and Caruana 96). 
+
+This class implements an extended update rule: in the original paper, the authors used
+
+p(i)(t+1) = (1-LR)$\ast$p(i)(t) + LR$\ast$best(i)
+
+here the same formula is applied, with some of the best individuals and for some of the worst individuals (with different learning rates) 
+
+
+
+Definition at line 46 of file eo\-PBILAdditive.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-PBILAdditive.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_p_b_i_l_distrib.eps b/trunk/paradiseo-eo/doc/latex/classeo_p_b_i_l_distrib.eps
new file mode 100644
index 000000000..26a941e04
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_p_b_i_l_distrib.eps
@@ -0,0 +1,249 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 80.9717
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 6.175 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 5 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoPBILDistrib< EOT >) cw
+(eoDistribution< EOT >) cw
+(eoValueParam< std::vector< double > >) cw
+(eoInit< EOT >) cw
+(eoPersistent) cw
+(eoObject) cw
+(eoParam) cw
+(eoUF< EOT &, void >) cw
+(eoPrintable) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoPBILDistrib< EOT >) 2.5 0 box
+ (eoDistribution< EOT >) 1.5 1 box
+ (eoValueParam< std::vector< double > >) 3.5 1 box
+ (eoInit< EOT >) 0.5 2 box
+ (eoPersistent) 1.5 2 box
+ (eoObject) 2.5 2 box
+ (eoParam) 3.5 2 box
+ (eoUF< EOT &, void >) 0.5 3 box
+ (eoPrintable) 1.5 3 box
+ (eoFunctorBase) 0 4 box
+ (unary_function< EOT &, void >) 1 4 box
+
+% ----- relations -----
+
+solid
+0 2.5 0 out
+solid
+1.5 3.5 1 conn
+solid
+1 1.5 1 in
+solid
+0 1.5 1 out
+solid
+0.5 2.5 2 conn
+solid
+1 3.5 1 in
+solid
+0 3.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+1 1.5 2 in
+solid
+0 1.5 2 out
+solid
+1 2.5 2 in
+solid
+1 3.5 2 in
+solid
+1 0.5 3 in
+solid
+0 0.5 3 out
+solid
+0 1 4 conn
+solid
+1 1.5 3 in
+solid
+1 0 4 in
+solid
+1 1 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_p_b_i_l_distrib.tex b/trunk/paradiseo-eo/doc/latex/classeo_p_b_i_l_distrib.tex
new file mode 100644
index 000000000..bde26964f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_p_b_i_l_distrib.tex
@@ -0,0 +1,76 @@
+\section{eo\-PBILDistrib$<$ EOT $>$ Class Template Reference}
+\label{classeo_p_b_i_l_distrib}\index{eoPBILDistrib@{eoPBILDistrib}}
+Distribution Class for PBIL algorithm (Population-Based Incremental Learning, Baluja and Caruana 96).  
+
+
+{\tt \#include $<$eo\-PBILDistrib.h$>$}
+
+Inheritance diagram for eo\-PBILDistrib$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.26721cm]{classeo_p_b_i_l_distrib}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-PBILDistrib} (unsigned \_\-genome\-Size)\label{classeo_p_b_i_l_distrib_a0}
+
+\begin{CompactList}\small\item\em Ctor with size of genomes, and update parameters. \item\end{CompactList}\item 
+virtual void {\bf operator()} ({\bf EOT} \&\_\-eo)\label{classeo_p_b_i_l_distrib_a1}
+
+\begin{CompactList}\small\item\em the randomizer of indis \item\end{CompactList}\item 
+unsigned {\bf Size} ()\label{classeo_p_b_i_l_distrib_a2}
+
+\begin{CompactList}\small\item\em Accessor to the genome size. \item\end{CompactList}\item 
+virtual void {\bf print\-On} (std::ostream \&os) const \label{classeo_p_b_i_l_distrib_a3}
+
+\begin{CompactList}\small\item\em printing... \item\end{CompactList}\item 
+virtual void {\bf read\-From} (std::istream \&is)\label{classeo_p_b_i_l_distrib_a4}
+
+\begin{CompactList}\small\item\em reading... \item\end{CompactList}\item 
+unsigned int {\bf size} ()\label{classeo_p_b_i_l_distrib_a5}
+
+\item 
+virtual std::string {\bf class\-Name} () const 
+\begin{CompactList}\small\item\em class\-Name: Mandatory because of {\bf eo\-Combined\-Init}{\rm (p.\,\pageref{classeo_combined_init})}. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf genome\-Size}\label{classeo_p_b_i_l_distrib_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-PBILDistrib$<$ EOT $>$}
+
+Distribution Class for PBIL algorithm (Population-Based Incremental Learning, Baluja and Caruana 96). 
+
+It encodes a univariate distribution on the space of bitstrings, i.e. one probability for each bit to be one
+
+It is an {\bf eo\-Value\-Param}{\rm (p.\,\pageref{classeo_value_param})}$<$std::vector$<$double$>$ $>$ : the std::vector$<$double$>$ stores the probabilities that each bit is 1
+
+It is still pure virtual, as the update method needs to be specified 
+
+
+
+Definition at line 44 of file eo\-PBILDistrib.h.
+
+\subsection{Member Function Documentation}
+\index{eoPBILDistrib@{eo\-PBILDistrib}!className@{className}}
+\index{className@{className}!eoPBILDistrib@{eo\-PBILDistrib}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ virtual std::string {\bf eo\-PBILDistrib}$<$ {\bf EOT} $>$::class\-Name (void) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_p_b_i_l_distrib_a6}
+
+
+class\-Name: Mandatory because of {\bf eo\-Combined\-Init}{\rm (p.\,\pageref{classeo_combined_init})}. 
+
+SHould be pure virtual, but then we should go over the whole code to write the method for all derived classes ... MS 16/7/04 
+
+Reimplemented from {\bf eo\-Init$<$ EOT $>$} {\rm (p.\,\pageref{classeo_init_a0})}.
+
+Definition at line 94 of file eo\-PBILDistrib.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-PBILDistrib.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_p_b_i_l_org.eps b/trunk/paradiseo-eo/doc/latex/classeo_p_b_i_l_org.eps
new file mode 100644
index 000000000..1767fa8b0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_p_b_i_l_org.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 96.8523
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.1625 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoPBILOrg< EOT >) cw
+(eoDistribUpdater< EOT >) cw
+(eoBF< eoDistribution< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoDistribution< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoPBILOrg< EOT >) 0.5 0 box
+ (eoDistribUpdater< EOT >) 0.5 1 box
+ (eoBF< eoDistribution< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< eoDistribution< EOT > &, eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_p_b_i_l_org.tex b/trunk/paradiseo-eo/doc/latex/classeo_p_b_i_l_org.tex
new file mode 100644
index 000000000..57870e5e0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_p_b_i_l_org.tex
@@ -0,0 +1,52 @@
+\section{eo\-PBILOrg$<$ EOT $>$ Class Template Reference}
+\label{classeo_p_b_i_l_org}\index{eoPBILOrg@{eoPBILOrg}}
+Distribution Class for PBIL algorithm (Population-Based Incremental Learning, Baluja and Caruana 95).  
+
+
+{\tt \#include $<$eo\-PBILOrg.h$>$}
+
+Inheritance diagram for eo\-PBILOrg$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.71186cm]{classeo_p_b_i_l_org}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-PBILOrg} (double \_\-LR, double \_\-tolerance=0.0)\label{classeo_p_b_i_l_org_a0}
+
+\begin{CompactList}\small\item\em Ctor with size of genomes, and update parameters. \item\end{CompactList}\item 
+virtual void {\bf operator()} ({\bf eo\-Distribution}$<$ {\bf EOT} $>$ \&\_\-distrib, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_p_b_i_l_org_a1}
+
+\begin{CompactList}\small\item\em Update the distribution from the current population. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf LR}\label{classeo_p_b_i_l_org_r0}
+
+\item 
+double {\bf max\-Bound}\label{classeo_p_b_i_l_org_r1}
+
+\item 
+double {\bf min\-Bound}\label{classeo_p_b_i_l_org_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-PBILOrg$<$ EOT $>$}
+
+Distribution Class for PBIL algorithm (Population-Based Incremental Learning, Baluja and Caruana 95). 
+
+This class implements the update rule from the original paper:
+
+p(i)(t+1) = (1-LR)$\ast$p(i)(t) + LR$\ast$best(i) 
+
+
+
+Definition at line 42 of file eo\-PBILOrg.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-PBILOrg.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_param.eps b/trunk/paradiseo-eo/doc/latex/classeo_param.eps
new file mode 100644
index 000000000..d85da18ae
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_param.eps
@@ -0,0 +1,273 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 607.143
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 0.823529 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 17 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoParam) cw
+(eoValueParam< ValueType >) cw
+(eoValueParam< double >) cw
+(eoValueParam< EOT::Fitness >) cw
+(eoValueParam< ParamType >) cw
+(eoValueParam< std::pair< double, double > >) cw
+(eoValueParam< std::string >) cw
+(eoValueParam< std::vector< double > >) cw
+(eoValueParam< std::vector< FitT > >) cw
+(eoValueParam< std::vector< PartFitT > >) cw
+(eoValueParam< std::vector< WorthT > >) cw
+(eoValueParam< string >) cw
+(eoValueParam< T >) cw
+(eoValueParam< unsigned >) cw
+(eoValueParam< unsigned long >) cw
+(ParamWrapper) cw
+(ValueParam) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoParam) 0 16 box
+ (eoValueParam< ValueType >) 1 15 box
+1 15 mark
+ (eoValueParam< double >) 1 14 box
+1 14 mark
+ (eoValueParam< EOT::Fitness >) 1 13 box
+1 13 mark
+ (eoValueParam< ParamType >) 1 12 box
+1 12 mark
+ (eoValueParam< std::pair< double, double > >) 1 11 box
+1 11 mark
+ (eoValueParam< std::string >) 1 10 box
+1 10 mark
+ (eoValueParam< std::vector< double > >) 1 9 box
+1 9 mark
+ (eoValueParam< std::vector< FitT > >) 1 8 box
+1 8 mark
+ (eoValueParam< std::vector< PartFitT > >) 1 7 box
+1 7 mark
+ (eoValueParam< std::vector< WorthT > >) 1 6 box
+1 6 mark
+ (eoValueParam< string >) 1 5 box
+1 5 mark
+ (eoValueParam< T >) 1 4 box
+1 4 mark
+ (eoValueParam< unsigned >) 1 3 box
+1 3 mark
+ (eoValueParam< unsigned long >) 1 2 box
+1 2 mark
+ (ParamWrapper) 1 1 box
+ (ValueParam) 1 0 box
+
+% ----- relations -----
+
+solid
+1 0 15.25 out
+solid
+0 0 15.5 hedge
+solid
+0 0 14.5 hedge
+solid
+0 0 13.5 hedge
+solid
+0 0 12.5 hedge
+solid
+0 0 11.5 hedge
+solid
+0 0 10.5 hedge
+solid
+0 0 9.5 hedge
+solid
+0 0 8.5 hedge
+solid
+0 0 7.5 hedge
+solid
+0 0 6.5 hedge
+solid
+0 0 5.5 hedge
+solid
+0 0 4.5 hedge
+solid
+0 0 3.5 hedge
+solid
+0 0 2.5 hedge
+solid
+0 0 1.5 hedge
+solid
+0 0 0.5 hedge
+solid
+0 16 0.5 vedge
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_param.tex b/trunk/paradiseo-eo/doc/latex/classeo_param.tex
new file mode 100644
index 000000000..835e79a7a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_param.tex
@@ -0,0 +1,98 @@
+\section{eo\-Param Class Reference}
+\label{classeo_param}\index{eoParam@{eoParam}}
+eo\-Param: Base class for monitoring and parsing parameters  
+
+
+{\tt \#include $<$eo\-Param.h$>$}
+
+Inheritance diagram for eo\-Param::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=12cm]{classeo_param}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Param} ()\label{classeo_param_a0}
+
+\begin{CompactList}\small\item\em Empty constructor - called from outside any parser. \item\end{CompactList}\item 
+{\bf eo\-Param} (std::string \_\-long\-Name, std::string \_\-default, std::string \_\-description, char \_\-short\-Name=0, bool \_\-required=false)
+\begin{CompactList}\small\item\em Construct a Param. \item\end{CompactList}\item 
+virtual {\bf $\sim$eo\-Param} ()\label{classeo_param_a2}
+
+\begin{CompactList}\small\item\em Virtual destructor is needed. \item\end{CompactList}\item 
+virtual std::string {\bf get\-Value} () const =0\label{classeo_param_a3}
+
+\begin{CompactList}\small\item\em Pure virtual function to get the value out. \item\end{CompactList}\item 
+virtual void {\bf set\-Value} (const std::string \&\_\-value)=0\label{classeo_param_a4}
+
+\begin{CompactList}\small\item\em Pure virtual function to set the value. \item\end{CompactList}\item 
+char {\bf short\-Name} () const \label{classeo_param_a5}
+
+\begin{CompactList}\small\item\em Returns the short name. \item\end{CompactList}\item 
+const std::string \& {\bf long\-Name} () const \label{classeo_param_a6}
+
+\begin{CompactList}\small\item\em Returns the long name. \item\end{CompactList}\item 
+const std::string \& {\bf description} () const \label{classeo_param_a7}
+
+\begin{CompactList}\small\item\em Returns the description of the argument. \item\end{CompactList}\item 
+const std::string \& {\bf def\-Value} () const \label{classeo_param_a8}
+
+\begin{CompactList}\small\item\em Returns the default value of the argument. \item\end{CompactList}\item 
+void {\bf def\-Value} (const std::string \&str)\label{classeo_param_a9}
+
+\begin{CompactList}\small\item\em Sets the default value of the argument,. \item\end{CompactList}\item 
+void {\bf set\-Long\-Name} (std::string \_\-long\-Name)\label{classeo_param_a10}
+
+\begin{CompactList}\small\item\em ALlows to change the name (see the prefix in {\bf eo\-Parser.h}{\rm (p.\,\pageref{eo_parser_8h})}). \item\end{CompactList}\item 
+bool {\bf required} () const \label{classeo_param_a11}
+
+\begin{CompactList}\small\item\em Returns if required or not. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+std::string {\bf rep\-Long\-Name}\label{classeo_param_r0}
+
+\item 
+std::string {\bf rep\-Default}\label{classeo_param_r1}
+
+\item 
+std::string {\bf rep\-Description}\label{classeo_param_r2}
+
+\item 
+char {\bf rep\-Short\-Hand}\label{classeo_param_r3}
+
+\item 
+bool {\bf rep\-Required}\label{classeo_param_r4}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+eo\-Param: Base class for monitoring and parsing parameters 
+
+
+
+Definition at line 42 of file eo\-Param.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoParam@{eo\-Param}!eoParam@{eoParam}}
+\index{eoParam@{eoParam}!eoParam@{eo\-Param}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}eo\-Param::eo\-Param (std::string {\em \_\-long\-Name}, std::string {\em \_\-default}, std::string {\em \_\-description}, char {\em \_\-short\-Name} = {\tt 0}, bool {\em \_\-required} = {\tt false})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_param_a1}
+
+
+Construct a Param. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-long\-Name}]Long name of the argument \item[{\em \_\-default}]The default value \item[{\em \_\-description}]Description of the parameter. What is useful for. \item[{\em \_\-short\-Name}]Short name of the argument (Optional) \item[{\em \_\-required}]If it is a necessary parameter or not \end{description}
+\end{Desc}
+
+
+Definition at line 60 of file eo\-Param.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Param.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_param_param_type.tex b/trunk/paradiseo-eo/doc/latex/classeo_param_param_type.tex
new file mode 100644
index 000000000..ebb8f07e7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_param_param_type.tex
@@ -0,0 +1,36 @@
+\section{eo\-Param\-Param\-Type Class Reference}
+\label{classeo_param_param_type}\index{eoParamParamType@{eoParamParamType}}
+Another helper class for parsing parameters like Keyword(arg1, arg2, ...).  
+
+
+{\tt \#include $<$eo\-Param.h$>$}
+
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Param\-Param\-Type} (std::string \_\-value)\label{classeo_param_param_type_a0}
+
+\item 
+std::ostream \& {\bf print\-On} (std::ostream \&\_\-os) const \label{classeo_param_param_type_a1}
+
+\item 
+std::istream \& {\bf read\-From} (std::istream \&\_\-is)\label{classeo_param_param_type_a2}
+
+\item 
+void {\bf read\-From} (std::string \&\_\-value)\label{classeo_param_param_type_a3}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Another helper class for parsing parameters like Keyword(arg1, arg2, ...). 
+
+It is basically a std::pair$<$std::string,std::vector$<$std::string$>$ $>$ first std::string is keyword the std::vector$<$std::string$>$ contains all arguments (as std::strings) See make\_\-algo.h 
+
+
+
+Definition at line 373 of file eo\-Param.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Param.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_parameter_loader.eps b/trunk/paradiseo-eo/doc/latex/classeo_parameter_loader.eps
new file mode 100644
index 000000000..2c2541ce0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_parameter_loader.eps
@@ -0,0 +1,197 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 303.03
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.65 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 2 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoParameterLoader) cw
+(eoParser) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoParameterLoader) 0 1 box
+ (eoParser) 0 0 box
+
+% ----- relations -----
+
+solid
+1 0 0.25 out
+solid
+0 0 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_parameter_loader.tex b/trunk/paradiseo-eo/doc/latex/classeo_parameter_loader.tex
new file mode 100644
index 000000000..192a0aa5b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_parameter_loader.tex
@@ -0,0 +1,82 @@
+\section{eo\-Parameter\-Loader Class Reference}
+\label{classeo_parameter_loader}\index{eoParameterLoader@{eoParameterLoader}}
+Parameter saving and loading.  
+
+
+{\tt \#include $<$eo\-Parser.h$>$}
+
+Inheritance diagram for eo\-Parameter\-Loader::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2cm]{classeo_parameter_loader}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual {\bf $\sim$eo\-Parameter\-Loader} ()\label{classeo_parameter_loader_a0}
+
+\begin{CompactList}\small\item\em Need a virtual destructor. \item\end{CompactList}\item 
+virtual void {\bf process\-Param} ({\bf eo\-Param} \¶m, std::string section=\char`\"{}\char`\"{})=0
+\begin{CompactList}\small\item\em Register a parameter and set its value if it is known. \item\end{CompactList}\item 
+virtual bool {\bf is\-It\-There} ({\bf eo\-Param} \&\_\-param) const =0\label{classeo_parameter_loader_a2}
+
+\begin{CompactList}\small\item\em checks if \_\-param has been actually entered \item\end{CompactList}\item 
+template$<$class Value\-Type$>$ {\bf eo\-Value\-Param}$<$ Value\-Type $>$ \& {\bf create\-Param} (Value\-Type \_\-default\-Value, std::string \_\-long\-Name, std::string \_\-description, char \_\-short\-Hand=0, std::string \_\-section=\char`\"{}\char`\"{}, bool \_\-required=false)
+\begin{CompactList}\small\item\em Construct a Param and sets its value. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+std::vector$<$ {\bf eo\-Param} $\ast$ $>$ {\bf owned\-Params}\label{classeo_parameter_loader_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Parameter saving and loading. 
+
+eo\-Parameter\-Loader is an abstract class that can be used as a base for your own parameter loading and saving. The command line parser {\bf eo\-Parser}{\rm (p.\,\pageref{classeo_parser})} is derived from this class. 
+
+
+
+Definition at line 40 of file eo\-Parser.h.
+
+\subsection{Member Function Documentation}
+\index{eoParameterLoader@{eo\-Parameter\-Loader}!processParam@{processParam}}
+\index{processParam@{processParam}!eoParameterLoader@{eo\-Parameter\-Loader}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}virtual void eo\-Parameter\-Loader::process\-Param ({\bf eo\-Param} \& {\em param}, std::string {\em section} = {\tt \char`\"{}\char`\"{}})\hspace{0.3cm}{\tt  [pure virtual]}}\label{classeo_parameter_loader_a1}
+
+
+Register a parameter and set its value if it is known. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em param}]the parameter to process \item[{\em section}]the section where this parameter belongs \end{description}
+\end{Desc}
+
+
+Implemented in {\bf eo\-Parser} {\rm (p.\,\pageref{classeo_parser_a1})}.\index{eoParameterLoader@{eo\-Parameter\-Loader}!createParam@{createParam}}
+\index{createParam@{createParam}!eoParameterLoader@{eo\-Parameter\-Loader}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Value\-Type$>$ {\bf eo\-Value\-Param}$<$Value\-Type$>$\& eo\-Parameter\-Loader::create\-Param (Value\-Type {\em \_\-default\-Value}, std::string {\em \_\-long\-Name}, std::string {\em \_\-description}, char {\em \_\-short\-Hand} = {\tt 0}, std::string {\em \_\-section} = {\tt \char`\"{}\char`\"{}}, bool {\em \_\-required} = {\tt false})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_parameter_loader_a3}
+
+
+Construct a Param and sets its value. 
+
+The loader will own the memory thus created
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-default\-Value}]The default value \item[{\em \_\-long\-Name}]Long name of the argument \item[{\em \_\-description}]Description of the parameter. What is useful for. \item[{\em \_\-short\-Name}]Short name of the argument (Optional) \item[{\em \_\-section}]Name of the section where the parameter belongs \item[{\em \_\-required}]If it is a necessary parameter or not \end{description}
+\end{Desc}
+
+
+Definition at line 70 of file eo\-Parser.h.
+
+Referenced by eo\-Parser::get\-ORcreate\-Param(), and eo\-Parser::set\-ORcreate\-Param().
+
+The documentation for this class was generated from the following files:\begin{CompactItemize}
+\item 
+eo\-Parser.h\item 
+eo\-Parser.cpp\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_pareto_fitness.tex b/trunk/paradiseo-eo/doc/latex/classeo_pareto_fitness.tex
new file mode 100644
index 000000000..fb752c438
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_pareto_fitness.tex
@@ -0,0 +1,67 @@
+\section{eo\-Pareto\-Fitness$<$ Fitness\-Traits $>$ Class Template Reference}
+\label{classeo_pareto_fitness}\index{eoParetoFitness@{eoParetoFitness}}
+eo\-Pareto\-Fitness class: std::vector of doubles with overloaded comparison operators.  
+
+
+{\tt \#include $<$eo\-Pareto\-Fitness.h$>$}
+
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef Fitness\-Traits {\bf fitness\_\-traits}\label{classeo_pareto_fitness_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Pareto\-Fitness} (std::vector$<$ double $>$ \&\_\-v)\label{classeo_pareto_fitness_a1}
+
+\item 
+bool {\bf dominates} (const {\bf eo\-Pareto\-Fitness}$<$ Fitness\-Traits $>$ \&\_\-other) const \label{classeo_pareto_fitness_a2}
+
+\begin{CompactList}\small\item\em Partial order based on Pareto-dominance. \item\end{CompactList}\item 
+bool {\bf operator$<$} (const {\bf eo\-Pareto\-Fitness}$<$ Fitness\-Traits $>$ \&\_\-other) const \label{classeo_pareto_fitness_a3}
+
+\begin{CompactList}\small\item\em compare $\ast$not$\ast$ on dominance, but on the first, then the second, etc \item\end{CompactList}\item 
+bool {\bf operator$>$} (const {\bf eo\-Pareto\-Fitness}$<$ Fitness\-Traits $>$ \&\_\-other) const \label{classeo_pareto_fitness_a4}
+
+\item 
+bool {\bf operator$<$=} (const {\bf eo\-Pareto\-Fitness}$<$ Fitness\-Traits $>$ \&\_\-other) const \label{classeo_pareto_fitness_a5}
+
+\item 
+bool {\bf operator$>$=} (const {\bf eo\-Pareto\-Fitness}$<$ Fitness\-Traits $>$ \&\_\-other) const \label{classeo_pareto_fitness_a6}
+
+\item 
+bool {\bf operator==} (const {\bf eo\-Pareto\-Fitness}$<$ Fitness\-Traits $>$ \&\_\-other) const \label{classeo_pareto_fitness_a7}
+
+\item 
+bool {\bf operator!=} (const {\bf eo\-Pareto\-Fitness}$<$ Fitness\-Traits $>$ \&\_\-other) const \label{classeo_pareto_fitness_a8}
+
+\end{CompactItemize}
+\subsection*{Static Public Member Functions}
+\begin{CompactItemize}
+\item 
+void {\bf set\-Up} (unsigned \_\-n, std::vector$<$ bool $>$ \&\_\-b)\label{classeo_pareto_fitness_e0}
+
+\begin{CompactList}\small\item\em access to the traits characteristics (so you don't have to write a lot of typedef's around \item\end{CompactList}\item 
+bool {\bf maximizing} (unsigned \_\-i)\label{classeo_pareto_fitness_e1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Fitness\-Traits = eo\-Pareto\-Fitness\-Traits$>$ class eo\-Pareto\-Fitness$<$ Fitness\-Traits $>$}
+
+eo\-Pareto\-Fitness class: std::vector of doubles with overloaded comparison operators. 
+
+Comparison is done on pareto dominance. The template argument Fitness\-Traits defaults to {\bf eo\-Pareto\-Fitness\-Traits}{\rm (p.\,\pageref{classeo_pareto_fitness_traits})}, which can be replaces at will by any other class that implements the static functions defined therein.
+
+Note that the comparison defines a partial order, so that !(a $<$ b) \&\& !(b $<$a) does not neccessarily imply that (a==b) The other way around does hold. 
+
+
+
+Definition at line 108 of file eo\-Pareto\-Fitness.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Pareto\-Fitness.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_pareto_fitness_traits.eps b/trunk/paradiseo-eo/doc/latex/classeo_pareto_fitness_traits.eps
new file mode 100644
index 000000000..911a217fc
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_pareto_fitness_traits.eps
@@ -0,0 +1,211 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 66.6667
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 7.5 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 2 def
+/cols 4 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoParetoFitnessTraits) cw
+(eoVariableParetoTraits) cw
+(MinimizingFitnessTraits) cw
+(MinimizingFitnessTraits) cw
+(MinimizingTraits) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoParetoFitnessTraits) 1.5 1 box
+ (eoVariableParetoTraits) 0 0 box
+ (MinimizingFitnessTraits) 1 0 box
+ (MinimizingFitnessTraits) 2 0 box
+ (MinimizingTraits) 3 0 box
+
+% ----- relations -----
+
+solid
+1 1.5 0.25 out
+solid
+0 3 1 conn
+solid
+0 0 0.75 in
+solid
+0 1 0.75 in
+solid
+0 2 0.75 in
+solid
+0 3 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_pareto_fitness_traits.tex b/trunk/paradiseo-eo/doc/latex/classeo_pareto_fitness_traits.tex
new file mode 100644
index 000000000..27b95590a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_pareto_fitness_traits.tex
@@ -0,0 +1,39 @@
+\section{eo\-Pareto\-Fitness\-Traits Class Reference}
+\label{classeo_pareto_fitness_traits}\index{eoParetoFitnessTraits@{eoParetoFitnessTraits}}
+eo\-Fitness\-Traits: a traits class to specify the number of objectives and which one are maximizing or not See test/t-eo\-Pareto\-Fitness for its use.  
+
+
+{\tt \#include $<$eo\-Pareto\-Fitness.h$>$}
+
+Inheritance diagram for eo\-Pareto\-Fitness\-Traits::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=1.86667cm]{classeo_pareto_fitness_traits}
+\end{center}
+\end{figure}
+\subsection*{Static Public Member Functions}
+\begin{CompactItemize}
+\item 
+unsigned {\bf n\-Objectives} ()\label{classeo_pareto_fitness_traits_e0}
+
+\item 
+double {\bf tol} ()\label{classeo_pareto_fitness_traits_e1}
+
+\item 
+bool {\bf maximizing} (int which)\label{classeo_pareto_fitness_traits_e2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+eo\-Fitness\-Traits: a traits class to specify the number of objectives and which one are maximizing or not See test/t-eo\-Pareto\-Fitness for its use. 
+
+If you define your own, make sure you make the functions static! 
+
+
+
+Definition at line 42 of file eo\-Pareto\-Fitness.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Pareto\-Fitness.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_pareto_one_constraint_fitness.tex b/trunk/paradiseo-eo/doc/latex/classeo_pareto_one_constraint_fitness.tex
new file mode 100644
index 000000000..4d5a4df0c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_pareto_one_constraint_fitness.tex
@@ -0,0 +1,94 @@
+\section{eo\-Pareto\-One\-Constraint\-Fitness$<$ Fitness\-Traits $>$ Class Template Reference}
+\label{classeo_pareto_one_constraint_fitness}\index{eoParetoOneConstraintFitness@{eoParetoOneConstraintFitness}}
+eo\-Pareto\-One\-Constraint\-Fitness class: std::vector of doubles + constraint value  
+
+
+{\tt \#include $<$eo\-Pareto\-Constraint\-Fitness.h$>$}
+
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef Fitness\-Traits {\bf fitness\_\-traits}\label{classeo_pareto_one_constraint_fitness_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Pareto\-One\-Constraint\-Fitness} (std::vector$<$ double $>$ \&\_\-v)\label{classeo_pareto_one_constraint_fitness_a1}
+
+\item 
+{\bf eo\-Pareto\-One\-Constraint\-Fitness} (std::vector$<$ double $>$ \&\_\-v, double \_\-c)\label{classeo_pareto_one_constraint_fitness_a2}
+
+\item 
+bool {\bf feasible} () const \label{classeo_pareto_one_constraint_fitness_a3}
+
+\item 
+double {\bf violation} () const \label{classeo_pareto_one_constraint_fitness_a4}
+
+\item 
+double {\bf Constraint\-Value} () const \label{classeo_pareto_one_constraint_fitness_a5}
+
+\item 
+void {\bf Constraint\-Value} (double \_\-c)\label{classeo_pareto_one_constraint_fitness_a6}
+
+\item 
+bool {\bf dominates} (const {\bf eo\-Pareto\-One\-Constraint\-Fitness}$<$ Fitness\-Traits $>$ \&\_\-other) const \label{classeo_pareto_one_constraint_fitness_a7}
+
+\begin{CompactList}\small\item\em Partial order based on Pareto-dominance. \item\end{CompactList}\item 
+bool {\bf operator$<$} (const {\bf eo\-Pareto\-One\-Constraint\-Fitness}$<$ Fitness\-Traits $>$ \&\_\-other) const \label{classeo_pareto_one_constraint_fitness_a8}
+
+\begin{CompactList}\small\item\em compare $\ast$not$\ast$ on dominance, but on the first, then the second, etc \item\end{CompactList}\item 
+bool {\bf operator$>$} (const {\bf eo\-Pareto\-One\-Constraint\-Fitness}$<$ Fitness\-Traits $>$ \&\_\-other) const \label{classeo_pareto_one_constraint_fitness_a9}
+
+\item 
+bool {\bf operator$<$=} (const {\bf eo\-Pareto\-One\-Constraint\-Fitness}$<$ Fitness\-Traits $>$ \&\_\-other) const \label{classeo_pareto_one_constraint_fitness_a10}
+
+\item 
+bool {\bf operator$>$=} (const {\bf eo\-Pareto\-One\-Constraint\-Fitness}$<$ Fitness\-Traits $>$ \&\_\-other) const \label{classeo_pareto_one_constraint_fitness_a11}
+
+\item 
+bool {\bf operator==} (const {\bf eo\-Pareto\-One\-Constraint\-Fitness}$<$ Fitness\-Traits $>$ \&\_\-other) const \label{classeo_pareto_one_constraint_fitness_a12}
+
+\item 
+bool {\bf operator!=} (const {\bf eo\-Pareto\-One\-Constraint\-Fitness}$<$ Fitness\-Traits $>$ \&\_\-other) const \label{classeo_pareto_one_constraint_fitness_a13}
+
+\end{CompactItemize}
+\subsection*{Static Public Member Functions}
+\begin{CompactItemize}
+\item 
+void {\bf set\-Up} (unsigned \_\-n, std::vector$<$ bool $>$ \&\_\-b)\label{classeo_pareto_one_constraint_fitness_e0}
+
+\begin{CompactList}\small\item\em access to the traits characteristics (so you don't have to write a lot of typedef's around \item\end{CompactList}\item 
+bool {\bf maximizing} (unsigned \_\-i)\label{classeo_pareto_one_constraint_fitness_e1}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf constraint\-Value}\label{classeo_pareto_one_constraint_fitness_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Fitness\-Traits = eo\-Pareto\-Fitness\-Traits$>$ class eo\-Pareto\-One\-Constraint\-Fitness$<$ Fitness\-Traits $>$}
+
+eo\-Pareto\-One\-Constraint\-Fitness class: std::vector of doubles + constraint value 
+
+Comparison (dominance) is done on pareto dominance for 2 feasible individuals, one feasible individual always wins over an infeasible on constraint violations for 2 infeasible individuals
+
+The template argument Fitness\-Traits defaults to {\bf eo\-Pareto\-Fitness\-Traits}{\rm (p.\,\pageref{classeo_pareto_fitness_traits})}, which can be replaces at will by any other class that implements the static functions defined therein.
+
+Note that the domninance defines a partial order, so that !dominates(a,b) \&\& !domaintes(b,a) does not neccessarily imply that (a==b) The other way around does hold.
+
+However, be careful that the comparison operators do define a total order based on considering first objective, then in case of tie, second objective, etc
+
+NOTE: in a hurry, I did not want to make it derive from {\bf eo\-Pareto\-Fitness}{\rm (p.\,\pageref{classeo_pareto_fitness})} (used cut-and-paste instead!) : I know it might be a good idea, but I'm not sure I see why at the moment (any hint someone?) 
+
+
+
+Definition at line 61 of file eo\-Pareto\-Constraint\-Fitness.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Pareto\-Constraint\-Fitness.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_pareto_ranking.eps b/trunk/paradiseo-eo/doc/latex/classeo_pareto_ranking.eps
new file mode 100644
index 000000000..606da278b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_pareto_ranking.eps
@@ -0,0 +1,233 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 112.613
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.44 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoParetoRanking< EOT >) cw
+(eoPerf2WorthCached< EOT, double >) cw
+(eoPerf2Worth< EOT, double >) cw
+(eoUF< const eoPop< EOT > &, void >) cw
+(eoValueParam< std::vector< double > >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, void >) cw
+(eoParam) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoParetoRanking< EOT >) 1.25 0 box
+ (eoPerf2WorthCached< EOT, double >) 1.25 1 box
+ (eoPerf2Worth< EOT, double >) 1.25 2 box
+ (eoUF< const eoPop< EOT > &, void >) 0.5 3 box
+ (eoValueParam< std::vector< double > >) 2 3 box
+ (eoFunctorBase) 0 4 box
+ (unary_function< const eoPop< EOT > &, void >) 1 4 box
+ (eoParam) 2 4 box
+
+% ----- relations -----
+
+solid
+0 1.25 0 out
+solid
+1 1.25 1 in
+solid
+0 1.25 1 out
+solid
+1 1.25 2 in
+solid
+0 1.25 2 out
+solid
+0.5 2 3 conn
+solid
+1 0.5 3 in
+solid
+0 0.5 3 out
+solid
+0 1 4 conn
+solid
+1 2 3 in
+solid
+0 2 3 out
+solid
+1 0 4 in
+solid
+1 1 4 in
+solid
+1 2 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_pareto_ranking.tex b/trunk/paradiseo-eo/doc/latex/classeo_pareto_ranking.tex
new file mode 100644
index 000000000..c5a1c5d1e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_pareto_ranking.tex
@@ -0,0 +1,44 @@
+\section{eo\-Pareto\-Ranking$<$ EOT $>$ Class Template Reference}
+\label{classeo_pareto_ranking}\index{eoParetoRanking@{eoParetoRanking}}
+Straightforward pareto ranking.  
+
+
+{\tt \#include $<$eo\-Pareto\-Ranking.h$>$}
+
+Inheritance diagram for eo\-Pareto\-Ranking$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.15315cm]{classeo_pareto_ranking}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Pareto\-Ranking} ({\bf eo\-Dominance\-Map}$<$ {\bf EOT} $>$ \&\_\-dominance\-Map)\label{classeo_pareto_ranking_a0}
+
+\item 
+void {\bf calculate\_\-worths} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_pareto_ranking_a1}
+
+\begin{CompactList}\small\item\em The actual virtual function the derived classes should implement. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Dominance\-Map}$<$ {\bf EOT} $>$ \& {\bf dominance\-Map}\label{classeo_pareto_ranking_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Pareto\-Ranking$<$ EOT $>$}
+
+Straightforward pareto ranking. 
+
+Every individual gets a rank according to the number of elements it dominates. Note that without niching, this technique will usually not find the whole front of non-dominated solutions, but will quite likely converge on a single spot on the front. 
+
+
+
+Definition at line 40 of file eo\-Pareto\-Ranking.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Pareto\-Ranking.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_parse_tree.eps b/trunk/paradiseo-eo/doc/latex/classeo_parse_tree.eps
new file mode 100644
index 000000000..5b65cd853
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_parse_tree.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 208.333
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.4 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoParseTree< FType, Node >) cw
+(EO< FType >) cw
+(eoObject) cw
+(eoPersistent) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoParseTree< FType, Node >) 0.5 0 box
+ (EO< FType >) 0.5 1 box
+ (eoObject) 0 2 box
+ (eoPersistent) 1 2 box
+ (eoPrintable) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_parse_tree.tex b/trunk/paradiseo-eo/doc/latex/classeo_parse_tree.tex
new file mode 100644
index 000000000..40c6a0d11
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_parse_tree.tex
@@ -0,0 +1,148 @@
+\section{eo\-Parse\-Tree$<$ FType, Node $>$ Class Template Reference}
+\label{classeo_parse_tree}\index{eoParseTree@{eoParseTree}}
+Implementation of parse-tree for genetic programming.  
+
+
+{\tt \#include $<$gp/eo\-Parse\-Tree.h$>$}
+
+Inheritance diagram for eo\-Parse\-Tree$<$ FType, Node $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_parse_tree}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef parse\_\-tree$<$ Node $>$::subtree {\bf Subtree}\label{classeo_parse_tree_w0}
+
+\item 
+typedef Node {\bf reference}\label{classeo_parse_tree_w1}
+
+\item 
+typedef const reference {\bf const\_\-reference}\label{classeo_parse_tree_w2}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Parse\-Tree} (void)\label{classeo_parse_tree_a0}
+
+\begin{CompactList}\small\item\em Default Constructor. \item\end{CompactList}\item 
+{\bf eo\-Parse\-Tree} (const parse\_\-tree$<$ Node $>$ \&tree)
+\begin{CompactList}\small\item\em Copy Constructor. \item\end{CompactList}\item 
+virtual void {\bf prune\-Tree} (unsigned \_\-size)
+\begin{CompactList}\small\item\em To prune me to a certain size. \item\end{CompactList}\item 
+{\bf eo\-Parse\-Tree} (std::istream \&is)
+\begin{CompactList}\small\item\em To read me from a stream. \item\end{CompactList}\item 
+std::string {\bf class\-Name} (void) const \label{classeo_parse_tree_a4}
+
+\begin{CompactList}\small\item\em My class name. \item\end{CompactList}\item 
+void {\bf print\-On} (std::ostream \&os) const 
+\begin{CompactList}\small\item\em To print me on a stream. \item\end{CompactList}\item 
+void {\bf read\-From} (std::istream \&is)
+\begin{CompactList}\small\item\em To read me from a stream. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class FType, class Node$>$ class eo\-Parse\-Tree$<$ FType, Node $>$}
+
+Implementation of parse-tree for genetic programming. 
+
+
+
+Definition at line 54 of file eo\-Parse\-Tree.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoParseTree@{eo\-Parse\-Tree}!eoParseTree@{eoParseTree}}
+\index{eoParseTree@{eoParseTree}!eoParseTree@{eo\-Parse\-Tree}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ {\bf eo\-Parse\-Tree}$<$ FType, Node $>$::{\bf eo\-Parse\-Tree} (const parse\_\-tree$<$ Node $>$ \& {\em tree})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_parse_tree_a1}
+
+
+Copy Constructor. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em tree}]The tree to copy \end{description}
+\end{Desc}
+
+
+Definition at line 79 of file eo\-Parse\-Tree.h.\index{eoParseTree@{eo\-Parse\-Tree}!eoParseTree@{eoParseTree}}
+\index{eoParseTree@{eoParseTree}!eoParseTree@{eo\-Parse\-Tree}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ {\bf eo\-Parse\-Tree}$<$ FType, Node $>$::{\bf eo\-Parse\-Tree} (std::istream \& {\em is})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_parse_tree_a3}
+
+
+To read me from a stream. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em is}]The std::istream \end{description}
+\end{Desc}
+
+
+Definition at line 102 of file eo\-Parse\-Tree.h.
+
+References eo\-Parse\-Tree$<$ FType, Node $>$::read\-From().
+
+\subsection{Member Function Documentation}
+\index{eoParseTree@{eo\-Parse\-Tree}!pruneTree@{pruneTree}}
+\index{pruneTree@{pruneTree}!eoParseTree@{eo\-Parse\-Tree}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ virtual void {\bf eo\-Parse\-Tree}$<$ FType, Node $>$::prune\-Tree (unsigned {\em \_\-size})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_parse_tree_a2}
+
+
+To prune me to a certain size. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-size}]My maximum size \end{description}
+\end{Desc}
+
+
+Definition at line 86 of file eo\-Parse\-Tree.h.
+
+Referenced by eo\-Collapse\-Subtree\-Mutation$<$ FType, Node $>$::operator()(), eo\-Expansion\-Mutation$<$ FType, Node $>$::operator()(), eo\-Branch\-Mutation$<$ FType, Node $>$::operator()(), and eo\-Subtree\-XOver$<$ FType, Node $>$::operator()().\index{eoParseTree@{eo\-Parse\-Tree}!printOn@{printOn}}
+\index{printOn@{printOn}!eoParseTree@{eo\-Parse\-Tree}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ void {\bf eo\-Parse\-Tree}$<$ FType, Node $>$::print\-On (std::ostream \& {\em os}) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_parse_tree_a5}
+
+
+To print me on a stream. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em os}]The std::ostream \end{description}
+\end{Desc}
+
+
+Reimplemented from {\bf EO$<$ FType $>$} {\rm (p.\,\pageref{class_e_o_z10_2})}.
+
+Definition at line 114 of file eo\-Parse\-Tree.h.
+
+References EO$<$ F $>$::print\-On().\index{eoParseTree@{eo\-Parse\-Tree}!readFrom@{readFrom}}
+\index{readFrom@{readFrom}!eoParseTree@{eo\-Parse\-Tree}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ void {\bf eo\-Parse\-Tree}$<$ FType, Node $>$::read\-From (std::istream \& {\em is})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_parse_tree_a6}
+
+
+To read me from a stream. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em is}]The std::istream \end{description}
+\end{Desc}
+
+
+Reimplemented from {\bf EO$<$ FType $>$} {\rm (p.\,\pageref{class_e_o_z10_1})}.
+
+Definition at line 128 of file eo\-Parse\-Tree.h.
+
+References EO$<$ F $>$::read\-From().
+
+Referenced by eo\-Parse\-Tree$<$ FType, Node $>$::eo\-Parse\-Tree().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Parse\-Tree.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_parse_tree_depth_init.eps b/trunk/paradiseo-eo/doc/latex/classeo_parse_tree_depth_init.eps
new file mode 100644
index 000000000..02f091a17
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_parse_tree_depth_init.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 114.943
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.35 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoParseTreeDepthInit< FType, Node >) cw
+(eoInit< eoParseTree< FType, Node > >) cw
+(eoUF< eoParseTree< FType, Node > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< eoParseTree< FType, Node > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoParseTreeDepthInit< FType, Node >) 0.5 0 box
+ (eoInit< eoParseTree< FType, Node > >) 0.5 1 box
+ (eoUF< eoParseTree< FType, Node > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< eoParseTree< FType, Node > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_parse_tree_depth_init.tex b/trunk/paradiseo-eo/doc/latex/classeo_parse_tree_depth_init.tex
new file mode 100644
index 000000000..e75fb6984
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_parse_tree_depth_init.tex
@@ -0,0 +1,101 @@
+\section{eo\-Parse\-Tree\-Depth\-Init$<$ FType, Node $>$ Class Template Reference}
+\label{classeo_parse_tree_depth_init}\index{eoParseTreeDepthInit@{eoParseTreeDepthInit}}
+eo\-Parse\-Tree\-Depth\-Init : the initializer class for {\bf eo\-Parse\-Tree}{\rm (p.\,\pageref{classeo_parse_tree})}  
+
+
+{\tt \#include $<$gp/eo\-Parse\-Tree\-Depth\-Init.h$>$}
+
+Inheritance diagram for eo\-Parse\-Tree\-Depth\-Init$<$ FType, Node $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.21839cm]{classeo_parse_tree_depth_init}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef {\bf eo\-Parse\-Tree}$<$ FType, Node $>$ {\bf Eo\-Type}\label{classeo_parse_tree_depth_init_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Parse\-Tree\-Depth\-Init} (unsigned \_\-max\_\-depth, const std::vector$<$ Node $>$ \&\_\-initializor, bool \_\-grow=true, bool \_\-ramped\_\-half\_\-and\_\-half=false)
+\begin{CompactList}\small\item\em Constructor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_parse_tree_depth_init_a1}
+
+\begin{CompactList}\small\item\em My class name. \item\end{CompactList}\item 
+void {\bf operator()} ({\bf Eo\-Type} \&\_\-tree)
+\begin{CompactList}\small\item\em initialize a tree \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Member Functions}
+\begin{CompactItemize}
+\item 
+void {\bf generate} (std::list$<$ Node $>$ \&sequence, int the\_\-max, int last\_\-terminal=-1)\label{classeo_parse_tree_depth_init_d0}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf max\_\-depth}\label{classeo_parse_tree_depth_init_r0}
+
+\item 
+std::vector$<$ Node $>$ {\bf initializor}\label{classeo_parse_tree_depth_init_r1}
+
+\item 
+bool {\bf grow}\label{classeo_parse_tree_depth_init_r2}
+
+\item 
+bool {\bf ramped\_\-half\_\-and\_\-half}\label{classeo_parse_tree_depth_init_r3}
+
+\item 
+unsigned {\bf current\_\-depth}\label{classeo_parse_tree_depth_init_r4}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class FType, class Node$>$ class eo\-Parse\-Tree\-Depth\-Init$<$ FType, Node $>$}
+
+eo\-Parse\-Tree\-Depth\-Init : the initializer class for {\bf eo\-Parse\-Tree}{\rm (p.\,\pageref{classeo_parse_tree})} 
+
+
+
+Definition at line 48 of file eo\-Parse\-Tree\-Depth\-Init.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoParseTreeDepthInit@{eo\-Parse\-Tree\-Depth\-Init}!eoParseTreeDepthInit@{eoParseTreeDepthInit}}
+\index{eoParseTreeDepthInit@{eoParseTreeDepthInit}!eoParseTreeDepthInit@{eo\-Parse\-Tree\-Depth\-Init}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ {\bf eo\-Parse\-Tree\-Depth\-Init}$<$ FType, Node $>$::{\bf eo\-Parse\-Tree\-Depth\-Init} (unsigned {\em \_\-max\_\-depth}, const std::vector$<$ Node $>$ \& {\em \_\-initializor}, bool {\em \_\-grow} = {\tt true}, bool {\em \_\-ramped\_\-half\_\-and\_\-half} = {\tt false})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_parse_tree_depth_init_a0}
+
+
+Constructor. 
+
+\_\-max\_\-depth The maximum depth of a tree \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-initializor}]A std::vector containing the possible nodes \item[{\em \_\-grow}]False results in a full tree, True result is a randomly grown tree \item[{\em \_\-ramped\_\-half\_\-and\_\-half}]True results in Ramped Half and Half Initialization \end{description}
+\end{Desc}
+
+
+Definition at line 69 of file eo\-Parse\-Tree\-Depth\-Init.h.
+
+\subsection{Member Function Documentation}
+\index{eoParseTreeDepthInit@{eo\-Parse\-Tree\-Depth\-Init}!operator()@{operator()}}
+\index{operator()@{operator()}!eoParseTreeDepthInit@{eo\-Parse\-Tree\-Depth\-Init}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ void {\bf eo\-Parse\-Tree\-Depth\-Init}$<$ FType, Node $>$::operator() ({\bf Eo\-Type} \& {\em \_\-tree})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_parse_tree_depth_init_a2}
+
+
+initialize a tree 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-tree}]: the tree to be initialized \end{description}
+\end{Desc}
+
+
+Definition at line 96 of file eo\-Parse\-Tree\-Depth\-Init.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Parse\-Tree\-Depth\-Init.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_parser.eps b/trunk/paradiseo-eo/doc/latex/classeo_parser.eps
new file mode 100644
index 000000000..678772102
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_parser.eps
@@ -0,0 +1,213 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 151.515
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.3 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 3 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoParser) cw
+(eoParameterLoader) cw
+(eoObject) cw
+(eoPersistent) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoParser) 1 0 box
+ (eoParameterLoader) 0 1 box
+ (eoObject) 1 1 box
+ (eoPersistent) 2 1 box
+ (eoPrintable) 2 2 box
+
+% ----- relations -----
+
+solid
+0 1 0 out
+solid
+0 2 1 conn
+solid
+1 0 1 in
+solid
+1 1 1 in
+solid
+1 2 1 in
+solid
+0 2 1 out
+solid
+1 2 2 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_parser.tex b/trunk/paradiseo-eo/doc/latex/classeo_parser.tex
new file mode 100644
index 000000000..9f6a21288
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_parser.tex
@@ -0,0 +1,238 @@
+\section{eo\-Parser Class Reference}
+\label{classeo_parser}\index{eoParser@{eoParser}}
+eo\-Parser: command line parser and configuration file reader This class is persistent, so it can be stored and reloaded to restore parameter settings.  
+
+
+{\tt \#include $<$eo\-Parser.h$>$}
+
+Inheritance diagram for eo\-Parser::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3cm]{classeo_parser}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Parser} (unsigned \_\-argc, char $\ast$$\ast$\_\-argv, std::string \_\-program\-Description=\char`\"{}\char`\"{}, std::string \_\-l\-File\-Param\-Name=\char`\"{}param-file\char`\"{}, char \_\-short\-Hand= 'p')
+\begin{CompactList}\small\item\em Constructor a complete constructor that reads the command line an optionally reads a configuration file. \item\end{CompactList}\item 
+void {\bf process\-Param} ({\bf eo\-Param} \¶m, std::string section=\char`\"{}\char`\"{})\label{classeo_parser_a1}
+
+\begin{CompactList}\small\item\em Processes the parameter and puts it in the appropriate section for readability. \item\end{CompactList}\item 
+void {\bf read\-From} (std::istream \&is)
+\begin{CompactList}\small\item\em Read object. \item\end{CompactList}\item 
+void {\bf print\-On} (std::ostream \&os) const 
+\begin{CompactList}\small\item\em Write object. \item\end{CompactList}\item 
+std::string {\bf class\-Name} (void) const \label{classeo_parser_a4}
+
+\begin{CompactList}\small\item\em class\-Name for readibility \item\end{CompactList}\item 
+bool {\bf user\-Needs\-Help} (void)\label{classeo_parser_a5}
+
+\begin{CompactList}\small\item\em true if the user made an error or asked for help \item\end{CompactList}\item 
+void {\bf print\-Help} (std::ostream \&os)\label{classeo_parser_a6}
+
+\begin{CompactList}\small\item\em Prints an automatic help in the specified output using the information provided by parameters. \item\end{CompactList}\item 
+std::string {\bf Program\-Name} ()\label{classeo_parser_a7}
+
+\item 
+virtual bool {\bf is\-It\-There} ({\bf eo\-Param} \&\_\-param) const 
+\begin{CompactList}\small\item\em Has param been entered by user? \item\end{CompactList}\item 
+{\bf eo\-Param} $\ast$ {\bf get\-Param\-With\-Long\-Name} (const std::string \&\_\-name) const 
+\begin{CompactList}\small\item\em get a handle on a param from its long\-Name \item\end{CompactList}\item 
+template$<$class Value\-Type$>$ {\bf eo\-Value\-Param}$<$ Value\-Type $>$ \& {\bf get\-ORcreate\-Param} (Value\-Type \_\-default\-Value, std::string \_\-long\-Name, std::string \_\-description, char \_\-short\-Hand=0, std::string \_\-section=\char`\"{}\char`\"{}, bool \_\-required=false)
+\begin{CompactList}\small\item\em Get or create parameter. \item\end{CompactList}\item 
+template$<$class Value\-Type$>$ {\bf eo\-Value\-Param}$<$ Value\-Type $>$ \& {\bf set\-ORcreate\-Param} (Value\-Type \_\-default\-Value, std::string \_\-long\-Name, std::string \_\-description, char \_\-short\-Hand=0, std::string \_\-section=\char`\"{}\char`\"{}, bool \_\-required=false)
+\begin{CompactList}\small\item\em Set parameter value or create parameter. \item\end{CompactList}\item 
+void {\bf set\-Stop\-On\-Unknown\-Param} (bool \_\-b)\label{classeo_parser_a12}
+
+\begin{CompactList}\small\item\em accessors to the stop\-On\-Unknown\-Param value \item\end{CompactList}\item 
+bool {\bf get\-Stop\-On\-Unknown\-Param} ()\label{classeo_parser_a13}
+
+\item 
+void {\bf set\-Prefix} (const std::string \&\_\-prefix)\label{classeo_parser_a14}
+
+\begin{CompactList}\small\item\em Prefix handling. \item\end{CompactList}\item 
+void {\bf reset\-Prefix} ()\label{classeo_parser_a15}
+
+\item 
+std::string {\bf get\-Prefix} ()\label{classeo_parser_a16}
+
+\end{CompactItemize}
+\subsection*{Private Types}
+\begin{CompactItemize}
+\item 
+typedef std::multimap$<$ std::string, {\bf eo\-Param} $\ast$ $>$ {\bf Multi\-Map\-Type}\label{classeo_parser_y0}
+
+\item 
+typedef std::map$<$ char, std::string $>$ {\bf Short\-Name\-Map\-Type}\label{classeo_parser_y1}
+
+\item 
+typedef std::map$<$ std::string, std::string $>$ {\bf Long\-Name\-Map\-Type}\label{classeo_parser_y2}
+
+\end{CompactItemize}
+\subsection*{Private Member Functions}
+\begin{CompactItemize}
+\item 
+void {\bf do\-Register\-Param} ({\bf eo\-Param} \¶m) const \label{classeo_parser_d0}
+
+\item 
+std::pair$<$ bool, std::string $>$ {\bf get\-Value} ({\bf eo\-Param} \&\_\-param) const \label{classeo_parser_d1}
+
+\item 
+void {\bf update\-Parameters} () const \label{classeo_parser_d2}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+Multi\-Map\-Type {\bf params}\label{classeo_parser_r0}
+
+\item 
+std::string {\bf program\-Name}\label{classeo_parser_r1}
+
+\item 
+std::string {\bf program\-Description}\label{classeo_parser_r2}
+
+\item 
+Short\-Name\-Map\-Type {\bf short\-Name\-Map}\label{classeo_parser_r3}
+
+\item 
+Long\-Name\-Map\-Type {\bf long\-Name\-Map}\label{classeo_parser_r4}
+
+\item 
+{\bf eo\-Value\-Param}$<$ bool $>$ {\bf need\-Help}\label{classeo_parser_r5}
+
+\item 
+{\bf eo\-Value\-Param}$<$ bool $>$ {\bf stop\-On\-Unknown\-Param}\label{classeo_parser_r6}
+
+\item 
+std::vector$<$ std::string $>$ {\bf messages}\label{classeo_parser_r7}
+
+\item 
+std::string {\bf prefix}\label{classeo_parser_r8}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+eo\-Parser: command line parser and configuration file reader This class is persistent, so it can be stored and reloaded to restore parameter settings. 
+
+
+
+Definition at line 100 of file eo\-Parser.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoParser@{eo\-Parser}!eoParser@{eoParser}}
+\index{eoParser@{eoParser}!eoParser@{eo\-Parser}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}eo\-Parser::eo\-Parser (unsigned {\em \_\-argc}, char $\ast$$\ast$ {\em \_\-argv}, std::string {\em \_\-program\-Description} = {\tt \char`\"{}\char`\"{}}, std::string {\em \_\-l\-File\-Param\-Name} = {\tt \char`\"{}param-file\char`\"{}}, char {\em \_\-short\-Hand} = {\tt 'p'})}\label{classeo_parser_a0}
+
+
+Constructor a complete constructor that reads the command line an optionally reads a configuration file. 
+
+my\-Eo --param-file=param.rc will then load using the parameter file param.rc
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-argc}]command line arguments count \item[{\em \_\-argv}]command line parameters \item[{\em \_\-program\-Description}]Description of the work the program does \item[{\em \_\-l\-File\-Param\-Name}]Name of the parameter specifying the configuration file (--param-file) \item[{\em \_\-short\-Hand}]Single charachter shorthand for specifying the configuration file \end{description}
+\end{Desc}
+
+
+\subsection{Member Function Documentation}
+\index{eoParser@{eo\-Parser}!readFrom@{readFrom}}
+\index{readFrom@{readFrom}!eoParser@{eo\-Parser}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}void eo\-Parser::read\-From (std::istream \& {\em is})\hspace{0.3cm}{\tt  [virtual]}}\label{classeo_parser_a2}
+
+
+Read object. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-is}]A std::istream. \end{description}
+\end{Desc}
+\begin{Desc}
+\item[Exceptions:]
+\begin{description}
+\item[{\em runtime\_\-std::exception}]If a valid object can't be read. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Persistent} {\rm (p.\,\pageref{classeo_persistent_a1})}.\index{eoParser@{eo\-Parser}!printOn@{printOn}}
+\index{printOn@{printOn}!eoParser@{eo\-Parser}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}void eo\-Parser::print\-On (std::ostream \& {\em os}) const\hspace{0.3cm}{\tt  [virtual]}}\label{classeo_parser_a3}
+
+
+Write object. 
+
+It's called print\-On since it prints the object on a stream. \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-os}]A std::ostream. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Printable} {\rm (p.\,\pageref{classeo_printable_a1})}.\index{eoParser@{eo\-Parser}!isItThere@{isItThere}}
+\index{isItThere@{isItThere}!eoParser@{eo\-Parser}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}virtual bool eo\-Parser::is\-It\-There ({\bf eo\-Param} \& {\em \_\-param}) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_parser_a8}
+
+
+Has param been entered by user? 
+
+Checks if \_\-param has been actually entered by the user 
+
+Implements {\bf eo\-Parameter\-Loader} {\rm (p.\,\pageref{classeo_parameter_loader_a2})}.
+
+Definition at line 148 of file eo\-Parser.h.
+
+Referenced by set\-ORcreate\-Param().\index{eoParser@{eo\-Parser}!getParamWithLongName@{getParamWithLongName}}
+\index{getParamWithLongName@{getParamWithLongName}!eoParser@{eo\-Parser}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}{\bf eo\-Param}$\ast$ eo\-Parser::get\-Param\-With\-Long\-Name (const std::string \& {\em \_\-name}) const}\label{classeo_parser_a9}
+
+
+get a handle on a param from its long\-Name 
+
+if not found, returns 0 (null pointer :-)
+
+Not very clean (requires hard-coding of the long name twice!) but very useful in many occasions... 
+
+Referenced by get\-ORcreate\-Param().\index{eoParser@{eo\-Parser}!getORcreateParam@{getORcreateParam}}
+\index{getORcreateParam@{getORcreateParam}!eoParser@{eo\-Parser}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Value\-Type$>$ {\bf eo\-Value\-Param}$<$Value\-Type$>$\& eo\-Parser::get\-ORcreate\-Param (Value\-Type {\em \_\-default\-Value}, std::string {\em \_\-long\-Name}, std::string {\em \_\-description}, char {\em \_\-short\-Hand} = {\tt 0}, std::string {\em \_\-section} = {\tt \char`\"{}\char`\"{}}, bool {\em \_\-required} = {\tt false})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_parser_a10}
+
+
+Get or create parameter. 
+
+It seems finally that the easiest use of the above method is through the following, whose interface is similar to that of the widely-used create\-Param.
+
+For some (probably very stupid) reason, I failed to put it in the .cpp. Any hint??? 
+
+Definition at line 173 of file eo\-Parser.h.
+
+References eo\-Parameter\-Loader::create\-Param(), and get\-Param\-With\-Long\-Name().\index{eoParser@{eo\-Parser}!setORcreateParam@{setORcreateParam}}
+\index{setORcreateParam@{setORcreateParam}!eoParser@{eo\-Parser}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Value\-Type$>$ {\bf eo\-Value\-Param}$<$Value\-Type$>$\& eo\-Parser::set\-ORcreate\-Param (Value\-Type {\em \_\-default\-Value}, std::string {\em \_\-long\-Name}, std::string {\em \_\-description}, char {\em \_\-short\-Hand} = {\tt 0}, std::string {\em \_\-section} = {\tt \char`\"{}\char`\"{}}, bool {\em \_\-required} = {\tt false})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_parser_a11}
+
+
+Set parameter value or create parameter. 
+
+This makes sure that the specified parameter has the given value. If the parameter does not exist yet, it is created.
+
+This requires that operator$<$$<$ is defined for Value\-Type.
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-default\-Value}]Default value. \item[{\em \_\-long\-Name}]Long name of the argument. \item[{\em \_\-description}]Description of the parameter. \item[{\em \_\-short\-Name}]Short name of the argument (Optional) \item[{\em \_\-section}]Name of the section where the parameter belongs. \item[{\em \_\-required}]Is the parameter mandatory? \end{description}
+\end{Desc}
+\begin{Desc}
+\item[Returns:]Corresponding parameter. \end{Desc}
+
+
+Definition at line 211 of file eo\-Parser.h.
+
+References eo\-Parameter\-Loader::create\-Param(), is\-It\-There(), and eo\-Value\-Param$<$ Value\-Type $>$::set\-Value().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Parser.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_perf2_worth.eps b/trunk/paradiseo-eo/doc/latex/classeo_perf2_worth.eps
new file mode 100644
index 000000000..f1dfbd3fa
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_perf2_worth.eps
@@ -0,0 +1,227 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 90.0901
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.55 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoPerf2Worth< EOT, WorthT >) cw
+(eoUF< const eoPop< EOT > &, void >) cw
+(eoValueParam< std::vector< WorthT > >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, void >) cw
+(eoParam) cw
+(eoPerf2WorthCached< EOT, WorthT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoPerf2Worth< EOT, WorthT >) 1.25 1 box
+ (eoUF< const eoPop< EOT > &, void >) 0.5 2 box
+ (eoValueParam< std::vector< WorthT > >) 2 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< const eoPop< EOT > &, void >) 1 3 box
+ (eoParam) 2 3 box
+ (eoPerf2WorthCached< EOT, WorthT >) 1.25 0 box
+
+% ----- relations -----
+
+solid
+0 1.25 1 out
+solid
+0.5 2 2 conn
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 2 2 in
+solid
+0 2 2 out
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+1 2 3 in
+solid
+1 1.25 0.25 out
+solid
+0 1.25 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_perf2_worth.tex b/trunk/paradiseo-eo/doc/latex/classeo_perf2_worth.tex
new file mode 100644
index 000000000..7cac48c21
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_perf2_worth.tex
@@ -0,0 +1,47 @@
+\section{eo\-Perf2Worth$<$ EOT, Worth\-T $>$ Class Template Reference}
+\label{classeo_perf2_worth}\index{eoPerf2Worth@{eoPerf2Worth}}
+Base class to transform raw fitnesses into fitness for selection.  
+
+
+{\tt \#include $<$eo\-Perf2Worth.h$>$}
+
+Inheritance diagram for eo\-Perf2Worth$<$ EOT, Worth\-T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.52252cm]{classeo_perf2_worth}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Perf2Worth} (std::string \_\-description=\char`\"{}Worths\char`\"{})\label{classeo_perf2_worth_a0}
+
+\begin{CompactList}\small\item\em default constructor \item\end{CompactList}\item 
+virtual void {\bf sort\_\-pop} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_perf2_worth_a1}
+
+\begin{CompactList}\small\item\em Sort population according to worth, will keep the worths and fitness\_\-cache in sync with the population. \item\end{CompactList}\item 
+virtual void {\bf resize} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop, unsigned sz)\label{classeo_perf2_worth_a2}
+
+\item 
+virtual void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_perf2_worth_a3}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT, class Worth\-T = double$>$ class eo\-Perf2Worth$<$ EOT, Worth\-T $>$}
+
+Base class to transform raw fitnesses into fitness for selection. 
+
+\begin{Desc}
+\item[See also:]{\bf eo\-Select\-From\-Worth}{\rm (p.\,\pageref{classeo_select_from_worth})} \end{Desc}
+
+
+
+
+Definition at line 43 of file eo\-Perf2Worth.h.
+
+The documentation for this class was generated from the following files:\begin{CompactItemize}
+\item 
+eo\-Perf2Worth.h\item 
+fitness\_\-traits.cpp\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_perf2_worth_1_1compare__worth.tex b/trunk/paradiseo-eo/doc/latex/classeo_perf2_worth_1_1compare__worth.tex
new file mode 100644
index 000000000..e903d2fd1
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_perf2_worth_1_1compare__worth.tex
@@ -0,0 +1,36 @@
+\section{eo\-Perf2Worth$<$ EOT, Worth\-T $>$::compare\_\-worth Class Reference}
+\label{classeo_perf2_worth_1_1compare__worth}\index{eoPerf2Worth::compare_worth@{eoPerf2Worth::compare\_\-worth}}
+helper class used to sort indices into populations/worths  
+
+
+{\tt \#include $<$eo\-Perf2Worth.h$>$}
+
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf compare\_\-worth} (const std::vector$<$ Worth\-T $>$ \&\_\-worths)\label{classeo_perf2_worth_1_1compare__worth_a0}
+
+\item 
+bool {\bf operator()} (unsigned a, unsigned b) const \label{classeo_perf2_worth_1_1compare__worth_a1}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+const std::vector$<$ Worth\-T $>$ \& {\bf worths}\label{classeo_perf2_worth_1_1compare__worth_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT, class Worth\-T = double$>$ class eo\-Perf2Worth$<$ EOT, Worth\-T $>$::compare\_\-worth}
+
+helper class used to sort indices into populations/worths 
+
+
+
+Definition at line 83 of file eo\-Perf2Worth.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Perf2Worth.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_perf2_worth_cached.eps b/trunk/paradiseo-eo/doc/latex/classeo_perf2_worth_cached.eps
new file mode 100644
index 000000000..6d863f721
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_perf2_worth_cached.eps
@@ -0,0 +1,227 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 90.0901
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.55 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoPerf2WorthCached< EOT, WorthT >) cw
+(eoPerf2Worth< EOT, WorthT >) cw
+(eoUF< const eoPop< EOT > &, void >) cw
+(eoValueParam< std::vector< WorthT > >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, void >) cw
+(eoParam) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoPerf2WorthCached< EOT, WorthT >) 1.25 0 box
+ (eoPerf2Worth< EOT, WorthT >) 1.25 1 box
+ (eoUF< const eoPop< EOT > &, void >) 0.5 2 box
+ (eoValueParam< std::vector< WorthT > >) 2 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< const eoPop< EOT > &, void >) 1 3 box
+ (eoParam) 2 3 box
+
+% ----- relations -----
+
+solid
+0 1.25 0 out
+solid
+1 1.25 1 in
+solid
+0 1.25 1 out
+solid
+0.5 2 2 conn
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 2 2 in
+solid
+0 2 2 out
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+1 2 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_perf2_worth_cached.tex b/trunk/paradiseo-eo/doc/latex/classeo_perf2_worth_cached.tex
new file mode 100644
index 000000000..cd36cdba1
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_perf2_worth_cached.tex
@@ -0,0 +1,64 @@
+\section{eo\-Perf2Worth\-Cached$<$ EOT, Worth\-T $>$ Class Template Reference}
+\label{classeo_perf2_worth_cached}\index{eoPerf2WorthCached@{eoPerf2WorthCached}}
+Perf2Worth with fitness cache.  
+
+
+{\tt \#include $<$eo\-Perf2Worth.h$>$}
+
+Inheritance diagram for eo\-Perf2Worth\-Cached$<$ EOT, Worth\-T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.52252cm]{classeo_perf2_worth_cached}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Perf2Worth\-Cached} (std::string \_\-description=\char`\"{}Worths\char`\"{})\label{classeo_perf2_worth_cached_a0}
+
+\item 
+void {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)
+\begin{CompactList}\small\item\em Implementation of the operator(), updating a cache of fitnesses. \item\end{CompactList}\item 
+virtual void {\bf calculate\_\-worths} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)=0\label{classeo_perf2_worth_cached_a2}
+
+\begin{CompactList}\small\item\em The actual virtual function the derived classes should implement. \item\end{CompactList}\item 
+virtual void {\bf sort\_\-pop} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_perf2_worth_cached_a3}
+
+\begin{CompactList}\small\item\em Sort population according to worth, will keep the worths and fitness\_\-cache in sync with the population. \item\end{CompactList}\item 
+virtual void {\bf resize} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop, unsigned sz)\label{classeo_perf2_worth_cached_a4}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+std::vector$<$ typename EOT::Fitness $>$ {\bf fitness\_\-cache}\label{classeo_perf2_worth_cached_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT, class Worth\-T = typename EOT::Fitness$>$ class eo\-Perf2Worth\-Cached$<$ EOT, Worth\-T $>$}
+
+Perf2Worth with fitness cache. 
+
+
+
+Definition at line 111 of file eo\-Perf2Worth.h.
+
+\subsection{Member Function Documentation}
+\index{eoPerf2WorthCached@{eo\-Perf2Worth\-Cached}!operator()@{operator()}}
+\index{operator()@{operator()}!eoPerf2WorthCached@{eo\-Perf2Worth\-Cached}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT, class Worth\-T = typename EOT::Fitness$>$ void {\bf eo\-Perf2Worth\-Cached}$<$ {\bf EOT}, Worth\-T $>$::operator() (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\em \_\-pop})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_perf2_worth_cached_a1}
+
+
+Implementation of the operator(), updating a cache of fitnesses. 
+
+Calls the virtual function calculate\_\-worths when one of the fitnesses has changed. It is not virtual, but derived classes can remove the fitness caching trough the third template element 
+
+Implements {\bf eo\-UF$<$ const eo\-Pop$<$ EOT $>$ \&, void $>$} {\rm (p.\,\pageref{classeo_u_f_a1})}.
+
+Definition at line 125 of file eo\-Perf2Worth.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Perf2Worth.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_perf2_worth_cached_1_1compare__worth.tex b/trunk/paradiseo-eo/doc/latex/classeo_perf2_worth_cached_1_1compare__worth.tex
new file mode 100644
index 000000000..d1a16e518
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_perf2_worth_cached_1_1compare__worth.tex
@@ -0,0 +1,36 @@
+\section{eo\-Perf2Worth\-Cached$<$ EOT, Worth\-T $>$::compare\_\-worth Class Reference}
+\label{classeo_perf2_worth_cached_1_1compare__worth}\index{eoPerf2WorthCached::compare_worth@{eoPerf2WorthCached::compare\_\-worth}}
+helper class used to sort indices into populations/worths  
+
+
+{\tt \#include $<$eo\-Perf2Worth.h$>$}
+
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf compare\_\-worth} (const std::vector$<$ Worth\-T $>$ \&\_\-worths)\label{classeo_perf2_worth_cached_1_1compare__worth_a0}
+
+\item 
+bool {\bf operator()} (unsigned a, unsigned b) const \label{classeo_perf2_worth_cached_1_1compare__worth_a1}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+const std::vector$<$ Worth\-T $>$ \& {\bf worths}\label{classeo_perf2_worth_cached_1_1compare__worth_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT, class Worth\-T = typename EOT::Fitness$>$ class eo\-Perf2Worth\-Cached$<$ EOT, Worth\-T $>$::compare\_\-worth}
+
+helper class used to sort indices into populations/worths 
+
+
+
+Definition at line 200 of file eo\-Perf2Worth.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Perf2Worth.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_persistent.eps b/trunk/paradiseo-eo/doc/latex/classeo_persistent.eps
new file mode 100644
index 000000000..3b479689b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_persistent.eps
@@ -0,0 +1,305 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 1643.84
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 0.304167 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 24 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoPersistent) cw
+(eoPrintable) cw
+(EO< F >) cw
+(EO< double >) cw
+(EO< EOT::Fitness >) cw
+(EO< Fit >) cw
+(EO< Fitness >) cw
+(EO< fitness_type >) cw
+(EO< fitnessT >) cw
+(EO< FitT >) cw
+(EO< FType >) cw
+(EO< phenotype >) cw
+(EO< PyFitness >) cw
+(eoContinue< EOT >) cw
+(eoDistribution< EOT >) cw
+(eoHowMany) cw
+(eoIntBounds) cw
+(eoParser) cw
+(eoPop< EOT >) cw
+(eoPop< Dummy >) cw
+(eoPop< PyEO >) cw
+(eoRealBounds) cw
+(eoRealVectorBounds) cw
+(eoRng) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoPersistent) 0 22 box
+ (eoPrintable) 0 23 box
+ (EO< F >) 1 21 box
+ (EO< double >) 1 20 box
+1 20 mark
+ (EO< EOT::Fitness >) 1 19 box
+1 19 mark
+ (EO< Fit >) 1 18 box
+1 18 mark
+ (EO< Fitness >) 1 17 box
+1 17 mark
+ (EO< fitness_type >) 1 16 box
+1 16 mark
+ (EO< fitnessT >) 1 15 box
+1 15 mark
+ (EO< FitT >) 1 14 box
+1 14 mark
+ (EO< FType >) 1 13 box
+1 13 mark
+ (EO< phenotype >) 1 12 box
+1 12 mark
+ (EO< PyFitness >) 1 11 box
+1 11 mark
+ (eoContinue< EOT >) 1 10 box
+1 10 mark
+ (eoDistribution< EOT >) 1 9 box
+1 9 mark
+ (eoHowMany) 1 8 box
+ (eoIntBounds) 1 7 box
+1 7 mark
+ (eoParser) 1 6 box
+ (eoPop< EOT >) 1 5 box
+ (eoPop< Dummy >) 1 4 box
+1 4 mark
+ (eoPop< PyEO >) 1 3 box
+ (eoRealBounds) 1 2 box
+1 2 mark
+ (eoRealVectorBounds) 1 1 box
+1 1 mark
+ (eoRng) 1 0 box
+
+% ----- relations -----
+
+solid
+0 0 22 out
+solid
+1 0 23 in
+solid
+1 0 21.25 out
+solid
+0 0 21.5 hedge
+solid
+0 0 20.5 hedge
+solid
+0 0 19.5 hedge
+solid
+0 0 18.5 hedge
+solid
+0 0 17.5 hedge
+solid
+0 0 16.5 hedge
+solid
+0 0 15.5 hedge
+solid
+0 0 14.5 hedge
+solid
+0 0 13.5 hedge
+solid
+0 0 12.5 hedge
+solid
+0 0 11.5 hedge
+solid
+0 0 10.5 hedge
+solid
+0 0 9.5 hedge
+solid
+0 0 8.5 hedge
+solid
+0 0 7.5 hedge
+solid
+0 0 6.5 hedge
+solid
+0 0 5.5 hedge
+solid
+0 0 4.5 hedge
+solid
+0 0 3.5 hedge
+solid
+0 0 2.5 hedge
+solid
+0 0 1.5 hedge
+solid
+0 0 0.5 hedge
+solid
+0 22 0.5 vedge
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_persistent.tex b/trunk/paradiseo-eo/doc/latex/classeo_persistent.tex
new file mode 100644
index 000000000..802cdaf54
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_persistent.tex
@@ -0,0 +1,57 @@
+\section{eo\-Persistent Class Reference}
+\label{classeo_persistent}\index{eoPersistent@{eoPersistent}}
+An persistent object that knows how to write (through functions inherited from {\bf eo\-Printable}{\rm (p.\,\pageref{classeo_printable})}\#) and read itself.  
+
+
+{\tt \#include $<$eo\-Persistent.h$>$}
+
+Inheritance diagram for eo\-Persistent::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=12cm]{classeo_persistent}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual {\bf $\sim$eo\-Persistent} ()\label{classeo_persistent_a0}
+
+\begin{CompactList}\small\item\em Virtual dtor. They are needed in virtual class hierarchies. \item\end{CompactList}\item 
+virtual void {\bf read\-From} (std::istream \&\_\-is)=0
+\begin{CompactList}\small\item\em Read object. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+An persistent object that knows how to write (through functions inherited from {\bf eo\-Printable}{\rm (p.\,\pageref{classeo_printable})}\#) and read itself. 
+
+
+
+Definition at line 52 of file eo\-Persistent.h.
+
+\subsection{Member Function Documentation}
+\index{eoPersistent@{eo\-Persistent}!readFrom@{readFrom}}
+\index{readFrom@{readFrom}!eoPersistent@{eo\-Persistent}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}virtual void eo\-Persistent::read\-From (std::istream \& {\em \_\-is})\hspace{0.3cm}{\tt  [pure virtual]}}\label{classeo_persistent_a1}
+
+
+Read object. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-is}]A std::istream. \end{description}
+\end{Desc}
+\begin{Desc}
+\item[Exceptions:]
+\begin{description}
+\item[{\em runtime\_\-std::exception}]If a valid object can't be read. \end{description}
+\end{Desc}
+
+
+Implemented in {\bf EO$<$ F $>$} {\rm (p.\,\pageref{class_e_o_z10_1})}, {\bf eo\-Continue$<$ EOT $>$} {\rm (p.\,\pageref{classeo_continue_a1})}, {\bf eo\-Gen\-Continue$<$ EOT $>$} {\rm (p.\,\pageref{classeo_gen_continue_a6})}, {\bf eo\-Pop$<$ EOT $>$} {\rm (p.\,\pageref{classeo_pop_z19_0})}, {\bf eo\-Vector$<$ Fit\-T, Gene\-Type $>$} {\rm (p.\,\pageref{classeo_vector_a5})}, {\bf eo\-Es\-Full$<$ Fit $>$} {\rm (p.\,\pageref{classeo_es_full_a3})}, {\bf eo\-Es\-Simple$<$ Fit $>$} {\rm (p.\,\pageref{classeo_es_simple_a3})}, {\bf eo\-Es\-Stdev$<$ Fit $>$} {\rm (p.\,\pageref{classeo_es_stdev_a3})}, {\bf eo\-Bit$<$ Fit\-T $>$} {\rm (p.\,\pageref{classeo_bit_a3})}, {\bf eo\-PBILDistrib$<$ EOT $>$} {\rm (p.\,\pageref{classeo_p_b_i_l_distrib_a4})}, {\bf eo\-Parse\-Tree$<$ FType, Node $>$} {\rm (p.\,\pageref{classeo_parse_tree_a6})}, {\bf eo\-External\-EO$<$ Fit, External $>$} {\rm (p.\,\pageref{classeo_external_e_o_a3})}, {\bf eo\-How\-Many} {\rm (p.\,\pageref{classeo_how_many_a6})}, {\bf eo\-Int\-No\-Bounds} {\rm (p.\,\pageref{classeo_int_no_bounds_a13})}, {\bf eo\-Int\-Interval} {\rm (p.\,\pageref{classeo_int_interval_a14})}, {\bf eo\-Int\-Below\-Bound} {\rm (p.\,\pageref{classeo_int_below_bound_a14})}, {\bf eo\-Int\-Above\-Bound} {\rm (p.\,\pageref{classeo_int_above_bound_a14})}, {\bf eo\-General\-Int\-Bounds} {\rm (p.\,\pageref{classeo_general_int_bounds_a19})}, {\bf eo\-Parser} {\rm (p.\,\pageref{classeo_parser_a2})}, {\bf eo\-Real\-No\-Bounds} {\rm (p.\,\pageref{classeo_real_no_bounds_a12})}, {\bf eo\-Real\-Interval} {\rm (p.\,\pageref{classeo_real_interval_a13})}, {\bf eo\-Real\-Below\-Bound} {\rm (p.\,\pageref{classeo_real_below_bound_a13})}, {\bf eo\-Real\-Above\-Bound} {\rm (p.\,\pageref{classeo_real_above_bound_a13})}, {\bf eo\-General\-Real\-Bounds} {\rm (p.\,\pageref{classeo_general_real_bounds_a18})}, {\bf eo\-Real\-Vector\-Bounds} {\rm (p.\,\pageref{classeo_real_vector_bounds_a7})}, {\bf eo\-Rng} {\rm (p.\,\pageref{classeo_rng_a17})}, {\bf EO$<$ double $>$} {\rm (p.\,\pageref{class_e_o_z10_1})}, {\bf EO$<$ EOT::Fitness $>$} {\rm (p.\,\pageref{class_e_o_z10_1})}, {\bf EO$<$ Fit\-T $>$} {\rm (p.\,\pageref{class_e_o_z10_1})}, {\bf EO$<$ phenotype $>$} {\rm (p.\,\pageref{class_e_o_z10_1})}, {\bf EO$<$ fitness\-T $>$} {\rm (p.\,\pageref{class_e_o_z10_1})}, {\bf EO$<$ Fit $>$} {\rm (p.\,\pageref{class_e_o_z10_1})}, {\bf EO$<$ FType $>$} {\rm (p.\,\pageref{class_e_o_z10_1})}, {\bf EO$<$ fitness\_\-type $>$} {\rm (p.\,\pageref{class_e_o_z10_1})}, {\bf EO$<$ Fitness $>$} {\rm (p.\,\pageref{class_e_o_z10_1})}, {\bf EO$<$ Py\-Fitness $>$} {\rm (p.\,\pageref{class_e_o_z10_1})}, {\bf eo\-Pop$<$ Py\-EO $>$} {\rm (p.\,\pageref{classeo_pop_z19_0})}, {\bf eo\-Pop$<$ Dummy $>$} {\rm (p.\,\pageref{classeo_pop_z19_0})}, {\bf eo\-Vector$<$ Fit, double $>$} {\rm (p.\,\pageref{classeo_vector_a5})}, {\bf eo\-Vector$<$ Fit\-T, double $>$} {\rm (p.\,\pageref{classeo_vector_a5})}, and {\bf eo\-Vector$<$ Fit\-T, bool $>$} {\rm (p.\,\pageref{classeo_vector_a5})}.
+
+Referenced by eo\-State::load().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Persistent.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_plus.eps b/trunk/paradiseo-eo/doc/latex/classeo_plus.eps
new file mode 100644
index 000000000..c5f8e5dd4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_plus.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 98.2801
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.0875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoPlus< EOT >) cw
+(eoMerge< EOT >) cw
+(eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< const eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoPlus< EOT >) 0.5 0 box
+ (eoMerge< EOT >) 0.5 1 box
+ (eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< const eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_plus.tex b/trunk/paradiseo-eo/doc/latex/classeo_plus.tex
new file mode 100644
index 000000000..ac24355f1
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_plus.tex
@@ -0,0 +1,33 @@
+\section{eo\-Plus$<$ EOT $>$ Class Template Reference}
+\label{classeo_plus}\index{eoPlus@{eoPlus}}
+Very elitist class, copies entire population into next gen.  
+
+
+{\tt \#include $<$eo\-Merge.h$>$}
+
+Inheritance diagram for eo\-Plus$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.75184cm]{classeo_plus}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+void {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-offspring)\label{classeo_plus_a0}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Plus$<$ EOT $>$}
+
+Very elitist class, copies entire population into next gen. 
+
+
+
+Definition at line 116 of file eo\-Merge.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Merge.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_plus_replacement.eps b/trunk/paradiseo-eo/doc/latex/classeo_plus_replacement.eps
new file mode 100644
index 000000000..f57867515
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_plus_replacement.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 134.409
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.72 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoPlusReplacement< EOT >) cw
+(eoMergeReduce< EOT >) cw
+(eoReplacement< EOT >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoPlusReplacement< EOT >) 0.5 0 box
+ (eoMergeReduce< EOT >) 0.5 1 box
+ (eoReplacement< EOT >) 0.5 2 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 3 box
+ (eoFunctorBase) 0 4 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 1 4 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+1 0.5 3 in
+solid
+0 0.5 3 out
+solid
+0 1 4 conn
+solid
+1 0 4 in
+solid
+1 1 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_plus_replacement.tex b/trunk/paradiseo-eo/doc/latex/classeo_plus_replacement.tex
new file mode 100644
index 000000000..6be04357e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_plus_replacement.tex
@@ -0,0 +1,36 @@
+\section{eo\-Plus\-Replacement$<$ EOT $>$ Class Template Reference}
+\label{classeo_plus_replacement}\index{eoPlusReplacement@{eoPlusReplacement}}
+ES type of replacement strategy: first add parents to population, then truncate.  
+
+
+{\tt \#include $<$eo\-Merge\-Reduce.h$>$}
+
+Inheritance diagram for eo\-Plus\-Replacement$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.76344cm]{classeo_plus_replacement}
+\end{center}
+\end{figure}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Plus}$<$ {\bf EOT} $>$ {\bf plus}\label{classeo_plus_replacement_r0}
+
+\item 
+{\bf eo\-Truncate}$<$ {\bf EOT} $>$ {\bf truncate}\label{classeo_plus_replacement_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Plus\-Replacement$<$ EOT $>$}
+
+ES type of replacement strategy: first add parents to population, then truncate. 
+
+
+
+Definition at line 73 of file eo\-Merge\-Reduce.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Merge\-Reduce.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_point_mutation.eps b/trunk/paradiseo-eo/doc/latex/classeo_point_mutation.eps
new file mode 100644
index 000000000..c2aa33161
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_point_mutation.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 76.6284
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 6.525 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoPointMutation< FType, Node >) cw
+(eoMonOp< eoParseTree< FType, Node > >) cw
+(eoOp< eoParseTree< FType, Node > >) cw
+(eoUF< eoParseTree< FType, Node > &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< eoParseTree< FType, Node > &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoPointMutation< FType, Node >) 0.5 0 box
+ (eoMonOp< eoParseTree< FType, Node > >) 0.5 1 box
+ (eoOp< eoParseTree< FType, Node > >) 0 2 box
+ (eoUF< eoParseTree< FType, Node > &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< eoParseTree< FType, Node > &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_point_mutation.tex b/trunk/paradiseo-eo/doc/latex/classeo_point_mutation.tex
new file mode 100644
index 000000000..1dc3f6f65
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_point_mutation.tex
@@ -0,0 +1,88 @@
+\section{eo\-Point\-Mutation$<$ FType, Node $>$ Class Template Reference}
+\label{classeo_point_mutation}\index{eoPointMutation@{eoPointMutation}}
+eo\-Point\-Mutation --$>$ replace a Node with a Node of the same arity  
+
+
+{\tt \#include $<$gp/eo\-Parse\-Tree\-Op.h$>$}
+
+Inheritance diagram for eo\-Point\-Mutation$<$ FType, Node $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.14559cm]{classeo_point_mutation}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef {\bf eo\-Parse\-Tree}$<$ FType, Node $>$ {\bf Eo\-Type}\label{classeo_point_mutation_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Point\-Mutation} (std::vector$<$ Node $>$ \&\_\-initializor)
+\begin{CompactList}\small\item\em Constructor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_point_mutation_a1}
+
+\begin{CompactList}\small\item\em the class name \item\end{CompactList}\item 
+virtual {\bf $\sim$eo\-Point\-Mutation} ()\label{classeo_point_mutation_a2}
+
+\begin{CompactList}\small\item\em Dtor. \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf Eo\-Type} \&\_\-eo1)
+\begin{CompactList}\small\item\em Mutate an individual. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+std::vector$<$ Node $>$ \& {\bf initializor}\label{classeo_point_mutation_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class FType, class Node$>$ class eo\-Point\-Mutation$<$ FType, Node $>$}
+
+eo\-Point\-Mutation --$>$ replace a Node with a Node of the same arity 
+
+
+
+Definition at line 147 of file eo\-Parse\-Tree\-Op.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoPointMutation@{eo\-Point\-Mutation}!eoPointMutation@{eoPointMutation}}
+\index{eoPointMutation@{eoPointMutation}!eoPointMutation@{eo\-Point\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ {\bf eo\-Point\-Mutation}$<$ FType, Node $>$::{\bf eo\-Point\-Mutation} (std::vector$<$ Node $>$ \& {\em \_\-initializor})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_point_mutation_a0}
+
+
+Constructor. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-initializor}]The std::vector of Nodes given to the eo\-Gp\-Depth\-Initializer \end{description}
+\end{Desc}
+
+
+Definition at line 157 of file eo\-Parse\-Tree\-Op.h.
+
+\subsection{Member Function Documentation}
+\index{eoPointMutation@{eo\-Point\-Mutation}!operator()@{operator()}}
+\index{operator()@{operator()}!eoPointMutation@{eo\-Point\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ bool {\bf eo\-Point\-Mutation}$<$ FType, Node $>$::operator() ({\bf Eo\-Type} \& {\em \_\-eo1})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_point_mutation_a3}
+
+
+Mutate an individual. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-eo1}]The individual that is to be changed \end{description}
+\end{Desc}
+
+
+Definition at line 171 of file eo\-Parse\-Tree\-Op.h.
+
+References eo\-Rng::random().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Parse\-Tree\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_pop.eps b/trunk/paradiseo-eo/doc/latex/classeo_pop.eps
new file mode 100644
index 000000000..dc78ae7ef
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_pop.eps
@@ -0,0 +1,209 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 285.714
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.75 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 3 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoPop< EOT >) cw
+(eoObject) cw
+(eoPersistent) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoPop< EOT >) 0.5 0 box
+ (eoObject) 0 1 box
+ (eoPersistent) 1 1 box
+ (eoPrintable) 1 2 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+0 1 1 conn
+solid
+1 0 1 in
+solid
+1 1 1 in
+solid
+0 1 1 out
+solid
+1 1 2 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_pop.tex b/trunk/paradiseo-eo/doc/latex/classeo_pop.tex
new file mode 100644
index 000000000..7945d917f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_pop.tex
@@ -0,0 +1,284 @@
+\section{eo\-Pop$<$ EOT $>$ Class Template Reference}
+\label{classeo_pop}\index{eoPop@{eoPop}}
+A std::vector of {\bf EO}{\rm (p.\,\pageref{class_e_o})} object, to be used in all algorithms (selectors, operators, replacements, ...).  
+
+
+{\tt \#include $<$eo\-Pop.h$>$}
+
+Inheritance diagram for eo\-Pop$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3cm]{classeo_pop}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Fitness {\bf Fitness}\label{classeo_pop_w0}
+
+\item 
+typedef EOT::fitness\_\-traits {\bf fitness\_\-traits}\label{classeo_pop_w1}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Pop} ()
+\begin{CompactList}\small\item\em Default ctor. \item\end{CompactList}\item 
+{\bf eo\-Pop} (unsigned \_\-pop\-Size, {\bf eo\-Init}$<$ {\bf EOT} $>$ \&\_\-chrom\-Init)
+\begin{CompactList}\small\item\em Ctor for the initialization of chromosomes. \item\end{CompactList}\item 
+void {\bf append} (unsigned \_\-new\-Pop\-Size, {\bf eo\-Init}$<$ {\bf EOT} $>$ \&\_\-chrom\-Init)
+\begin{CompactList}\small\item\em appstd::ends random guys at end of pop. \item\end{CompactList}\item 
+{\bf eo\-Pop} (std::istream \&\_\-is)
+\begin{CompactList}\small\item\em Ctor from an std::istream; reads the population from a stream, each element should be in different lines. \item\end{CompactList}\item 
+virtual {\bf $\sim$eo\-Pop} ()\label{classeo_pop_a4}
+
+\begin{CompactList}\small\item\em Empty Dtor. \item\end{CompactList}\item 
+void {\bf sort} (void)
+\begin{CompactList}\small\item\em sort the population. \item\end{CompactList}\item 
+void {\bf sort} (std::vector$<$ const {\bf EOT} $\ast$ $>$ \&result) const \label{classeo_pop_a6}
+
+\begin{CompactList}\small\item\em creates a std::vector$<$EOT$\ast$$>$ pointing to the individuals in descending order \item\end{CompactList}\item 
+void {\bf shuffle} (void)
+\begin{CompactList}\small\item\em shuffle the population. \item\end{CompactList}\item 
+void {\bf shuffle} (std::vector$<$ const {\bf EOT} $\ast$ $>$ \&result) const \label{classeo_pop_a8}
+
+\begin{CompactList}\small\item\em creates a std::vector$<$EOT$\ast$$>$ pointing to the individuals in random order \item\end{CompactList}\item 
+{\bf eo\-Pop}$<$ {\bf EOT} $>$::iterator {\bf it\_\-best\_\-element} ()\label{classeo_pop_a9}
+
+\begin{CompactList}\small\item\em returns an iterator to the best individual DOES NOT MOVE ANYBODY \item\end{CompactList}\item 
+const {\bf EOT} \& {\bf best\_\-element} () const \label{classeo_pop_a10}
+
+\begin{CompactList}\small\item\em returns an iterator to the best individual DOES NOT MOVE ANYBODY \item\end{CompactList}\item 
+const {\bf EOT} \& {\bf worse\_\-element} () const \label{classeo_pop_a11}
+
+\begin{CompactList}\small\item\em returns a const reference to the worse individual DOES NOT MOVE ANYBODY \item\end{CompactList}\item 
+{\bf eo\-Pop}$<$ {\bf EOT} $>$::iterator {\bf it\_\-worse\_\-element} ()\label{classeo_pop_a12}
+
+\begin{CompactList}\small\item\em returns an iterator to the worse individual DOES NOT MOVE ANYBODY \item\end{CompactList}\item 
+{\bf eo\-Pop}$<$ {\bf EOT} $>$::iterator {\bf nth\_\-element} (int nth)
+\begin{CompactList}\small\item\em slightly faster algorithm than sort to find all individuals that are better than the nth individual. \item\end{CompactList}\item 
+Fitness {\bf nth\_\-element\_\-fitness} (int which) const \label{classeo_pop_a14}
+
+\begin{CompactList}\small\item\em returns the fitness of the nth element \item\end{CompactList}\item 
+void {\bf nth\_\-element} (int which, std::vector$<$ const {\bf EOT} $\ast$ $>$ \&result) const \label{classeo_pop_a15}
+
+\begin{CompactList}\small\item\em const nth\_\-element function, returns pointers to sorted individuals up the the nth \item\end{CompactList}\item 
+void {\bf swap} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&other)\label{classeo_pop_a16}
+
+\begin{CompactList}\small\item\em does STL swap with other pop \item\end{CompactList}\item 
+virtual void {\bf sorted\-Print\-On} (std::ostream \&\_\-os) const 
+\begin{CompactList}\small\item\em Prints sorted pop but does NOT modify it! \item\end{CompactList}\item 
+virtual void {\bf print\-On} (std::ostream \&\_\-os) const 
+\begin{CompactList}\small\item\em Write object. \item\end{CompactList}\item 
+virtual void {\bf invalidate} ()\label{classeo_pop_a19}
+
+\item 
+void {\bf sort} ()\label{classeo_pop_a21}
+
+\item 
+void {\bf scale} ()\label{classeo_pop_a22}
+
+\item 
+void {\bf set\-Perf2Worth} ({\bf eo\-Perf2Worth}$<$ {\bf EOT} $>$ \&\_\-p2w)\label{classeo_pop_a23}
+
+\item 
+void {\bf set\-Perf2Worth} ({\bf eo\-Perf2Worth}$<$ {\bf EOT} $>$ $\ast$\_\-p2w)\label{classeo_pop_a24}
+
+\item 
+{\bf eo\-Perf2Worth}$<$ {\bf EOT} $>$ $\ast$ {\bf get\-Perf2Worth} ()\label{classeo_pop_a25}
+
+\item 
+void {\bf swap} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&other)\label{classeo_pop_a26}
+
+\end{CompactItemize}
+\begin{Indent}{\bf Methods from eo\-Object}\par
+\begin{CompactItemize}
+\item 
+virtual void {\bf read\-From} (std::istream \&\_\-is)
+\begin{CompactList}\small\item\em Read object. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const 
+\begin{CompactList}\small\item\em Inherited from {\bf eo\-Object}{\rm (p.\,\pageref{classeo_object})}. \item\end{CompactList}\end{CompactItemize}
+\end{Indent}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Perf2Worth}$<$ {\bf EOT} $>$ $\ast$ {\bf p2w}\label{classeo_pop_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Pop$<$ EOT $>$}
+
+A std::vector of {\bf EO}{\rm (p.\,\pageref{class_e_o})} object, to be used in all algorithms (selectors, operators, replacements, ...). 
+
+We have no idea if a population can be some other thing that a std::vector, but if somebody thinks of it, this concrete implementation can be moved to \char`\"{}generic\char`\"{} and an abstract Population interface be provided.
+
+The template can be instantiated with anything that accepts a \char`\"{}size\char`\"{} and {\bf eo\-Init}{\rm (p.\,\pageref{classeo_init})} derived object. in the ctor. EOT must also have a copy ctor, since temporaries are created and then passed to the {\bf eo\-Init}{\rm (p.\,\pageref{classeo_init})} object 
+
+
+
+Definition at line 54 of file eo\-Pop.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoPop@{eo\-Pop}!eoPop@{eoPop}}
+\index{eoPop@{eoPop}!eoPop@{eo\-Pop}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Pop}$<$ {\bf EOT} $>$::{\bf eo\-Pop} ()\hspace{0.3cm}{\tt  [inline]}}\label{classeo_pop_a0}
+
+
+Default ctor. 
+
+Creates empty pop
+
+Definition at line 68 of file eo\-Pop.h.\index{eoPop@{eo\-Pop}!eoPop@{eoPop}}
+\index{eoPop@{eoPop}!eoPop@{eo\-Pop}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Pop}$<$ {\bf EOT} $>$::{\bf eo\-Pop} (unsigned {\em \_\-pop\-Size}, {\bf eo\-Init}$<$ {\bf EOT} $>$ \& {\em \_\-chrom\-Init})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_pop_a1}
+
+
+Ctor for the initialization of chromosomes. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-pop\-Size}]total population size \item[{\em \_\-chrom\-Init}]Initialization routine, produces EO's, needs to be an {\bf eo\-Init}{\rm (p.\,\pageref{classeo_init})}\end{description}
+\end{Desc}
+
+
+Definition at line 75 of file eo\-Pop.h.\index{eoPop@{eo\-Pop}!eoPop@{eoPop}}
+\index{eoPop@{eoPop}!eoPop@{eo\-Pop}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Pop}$<$ {\bf EOT} $>$::{\bf eo\-Pop} (std::istream \& {\em \_\-is})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_pop_a3}
+
+
+Ctor from an std::istream; reads the population from a stream, each element should be in different lines. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-is}]the stream \end{description}
+\end{Desc}
+
+
+Definition at line 113 of file eo\-Pop.h.
+
+\subsection{Member Function Documentation}
+\index{eoPop@{eo\-Pop}!append@{append}}
+\index{append@{append}!eoPop@{eo\-Pop}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ void {\bf eo\-Pop}$<$ {\bf EOT} $>$::append (unsigned {\em \_\-new\-Pop\-Size}, {\bf eo\-Init}$<$ {\bf EOT} $>$ \& {\em \_\-chrom\-Init})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_pop_a2}
+
+
+appstd::ends random guys at end of pop. 
+
+Can be used to initialize it pop is empty
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-pop\-Size}]total population size \item[{\em \_\-chrom\-Init}]Initialization routine, produces EO's, needs to be an {\bf eo\-Init}{\rm (p.\,\pageref{classeo_init})}\end{description}
+\end{Desc}
+
+
+Definition at line 91 of file eo\-Pop.h.
+
+Referenced by eo\-Easy\-EA$<$ EOT $>$::operator()().\index{eoPop@{eo\-Pop}!sort@{sort}}
+\index{sort@{sort}!eoPop@{eo\-Pop}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ void {\bf eo\-Pop}$<$ {\bf EOT} $>$::sort (void)\hspace{0.3cm}{\tt  [inline]}}\label{classeo_pop_a5}
+
+
+sort the population. 
+
+Use this member to sort in order of descending Fitness, so the first individual is the best! 
+
+Definition at line 133 of file eo\-Pop.h.
+
+Referenced by eo\-Truncated\-Select\-Many$<$ EOT $>$::operator()(), eo\-Reduce\-Merge\-Reduce$<$ EOT $>$::operator()(), eo\-Ranking$<$ EOT $>$::operator()(), eo\-PBILAdditive$<$ EOT $>$::operator()(), eo\-Check\-Point$<$ EOT $>$::operator()(), eo\-Sequential\-Select$<$ EOT $>$::setup(), and eo\-Pop$<$ Dummy $>$::sorted\-Print\-On().\index{eoPop@{eo\-Pop}!shuffle@{shuffle}}
+\index{shuffle@{shuffle}!eoPop@{eo\-Pop}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ void {\bf eo\-Pop}$<$ {\bf EOT} $>$::shuffle (void)\hspace{0.3cm}{\tt  [inline]}}\label{classeo_pop_a7}
+
+
+shuffle the population. 
+
+Use this member to put the population in random order 
+
+Definition at line 152 of file eo\-Pop.h.
+
+Referenced by eo\-Truncated\-Select\-Many$<$ EOT $>$::operator()(), eo\-Random\-Split$<$ EOT $>$::operator()(), eo\-Random\-Reduce$<$ EOT $>$::operator()(), eo\-Elite\-Sequential\-Select$<$ EOT $>$::setup(), and eo\-Sequential\-Select$<$ EOT $>$::setup().\index{eoPop@{eo\-Pop}!nth_element@{nth\_\-element}}
+\index{nth_element@{nth\_\-element}!eoPop@{eo\-Pop}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Pop}$<${\bf EOT}$>$::iterator {\bf eo\-Pop}$<$ {\bf EOT} $>$::nth\_\-element (int {\em nth})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_pop_a13}
+
+
+slightly faster algorithm than sort to find all individuals that are better than the nth individual. 
+
+INDIVIDUALS ARE MOVED AROUND in the pop. 
+
+Definition at line 201 of file eo\-Pop.h.
+
+Referenced by eo\-Deterministic\-Survive\-And\-Die$<$ EOT $>$::operator()(), eo\-Truncate\-Split$<$ EOT $>$::operator()(), eo\-Reduce\-Merge\-Reduce$<$ EOT $>$::operator()(), eo\-Truncate$<$ EOT $>$::operator()(), eo\-Elitism$<$ EOT $>$::operator()(), and eo\-Truncated\-Select\-One$<$ EOT $>$::setup().\index{eoPop@{eo\-Pop}!sortedPrintOn@{sortedPrintOn}}
+\index{sortedPrintOn@{sortedPrintOn}!eoPop@{eo\-Pop}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ virtual void {\bf eo\-Pop}$<$ {\bf EOT} $>$::sorted\-Print\-On (std::ostream \& {\em \_\-os}) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_pop_a17}
+
+
+Prints sorted pop but does NOT modify it! 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-os}]A std::ostream. \end{description}
+\end{Desc}
+
+
+Definition at line 247 of file eo\-Pop.h.\index{eoPop@{eo\-Pop}!printOn@{printOn}}
+\index{printOn@{printOn}!eoPop@{eo\-Pop}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ virtual void {\bf eo\-Pop}$<$ {\bf EOT} $>$::print\-On (std::ostream \& {\em \_\-os}) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_pop_a18}
+
+
+Write object. 
+
+It's called print\-On since it prints the object \_\-on\_\- a stream. \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-os}]A std::ostream. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Printable} {\rm (p.\,\pageref{classeo_printable_a1})}.
+
+Definition at line 262 of file eo\-Pop.h.\index{eoPop@{eo\-Pop}!readFrom@{readFrom}}
+\index{readFrom@{readFrom}!eoPop@{eo\-Pop}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ virtual void {\bf eo\-Pop}$<$ {\bf EOT} $>$::read\-From (std::istream \& {\em \_\-is})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_pop_z19_0}
+
+
+Read object. 
+
+The EOT class must have a ctor from a stream; \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-is}]A std::istream. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Persistent} {\rm (p.\,\pageref{classeo_persistent_a1})}.
+
+Definition at line 274 of file eo\-Pop.h.
+
+Referenced by eo\-Pop$<$ Dummy $>$::eo\-Pop().\index{eoPop@{eo\-Pop}!className@{className}}
+\index{className@{className}!eoPop@{eo\-Pop}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ virtual std::string {\bf eo\-Pop}$<$ {\bf EOT} $>$::class\-Name (void) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_pop_z19_1}
+
+
+Inherited from {\bf eo\-Object}{\rm (p.\,\pageref{classeo_object})}. 
+
+Returns the class name. \begin{Desc}
+\item[See also:]{\bf eo\-Object}{\rm (p.\,\pageref{classeo_object})} \end{Desc}
+
+
+Implements {\bf eo\-Object} {\rm (p.\,\pageref{classeo_object_a1})}.
+
+Definition at line 289 of file eo\-Pop.h.
+
+Referenced by eo\-Check\-Point$<$ EOT $>$::all\-Class\-Names().
+
+The documentation for this class was generated from the following files:\begin{CompactItemize}
+\item 
+eo\-Pop.h\item 
+fitness\_\-traits.cpp\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_pop_algo.eps b/trunk/paradiseo-eo/doc/latex/classeo_pop_algo.eps
new file mode 100644
index 000000000..eedbb872b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_pop_algo.eps
@@ -0,0 +1,209 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 114.943
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.35 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 3 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoPopAlgo< EOT >) cw
+(eoUF< eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoPopAlgo< EOT >) 0.5 0 box
+ (eoUF< eoPop< EOT > &, void >) 0.5 1 box
+ (eoFunctorBase) 0 2 box
+ (unary_function< eoPop< EOT > &, void >) 1 2 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_pop_algo.tex b/trunk/paradiseo-eo/doc/latex/classeo_pop_algo.tex
new file mode 100644
index 000000000..9f86f2e06
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_pop_algo.tex
@@ -0,0 +1,27 @@
+\section{eo\-Pop\-Algo$<$ EOT $>$ Class Template Reference}
+\label{classeo_pop_algo}\index{eoPopAlgo@{eoPopAlgo}}
+For all \char`\"{}population transforming\char`\"{} algos ...  
+
+
+{\tt \#include $<$eo\-Pop\-Algo.h$>$}
+
+Inheritance diagram for eo\-Pop\-Algo$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3cm]{classeo_pop_algo}
+\end{center}
+\end{figure}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Pop\-Algo$<$ EOT $>$}
+
+For all \char`\"{}population transforming\char`\"{} algos ... 
+
+
+
+Definition at line 13 of file eo\-Pop\-Algo.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Pop\-Algo.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_pop_eval_func.eps b/trunk/paradiseo-eo/doc/latex/classeo_pop_eval_func.eps
new file mode 100644
index 000000000..8a4a4bd59
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_pop_eval_func.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 107.527
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.65 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoPopEvalFunc< EOT >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoPopLoopEval< EOT >) cw
+(eoTimeVaryingLoopEval< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoPopEvalFunc< EOT >) 0.5 1 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+ (eoPopLoopEval< EOT >) 0 0 box
+ (eoTimeVaryingLoopEval< EOT >) 1 0 box
+
+% ----- relations -----
+
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+1 0.5 0.25 out
+solid
+0 1 1 conn
+solid
+0 0 0.75 in
+solid
+0 1 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_pop_eval_func.tex b/trunk/paradiseo-eo/doc/latex/classeo_pop_eval_func.tex
new file mode 100644
index 000000000..d6b230016
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_pop_eval_func.tex
@@ -0,0 +1,37 @@
+\section{eo\-Pop\-Eval\-Func$<$ EOT $>$ Class Template Reference}
+\label{classeo_pop_eval_func}\index{eoPopEvalFunc@{eoPopEvalFunc}}
+eo\-Pop\-Eval\-Func: This abstract class is for GLOBAL evaluators of a population after variation.  
+
+
+{\tt \#include $<$eo\-Pop\-Eval\-Func.h$>$}
+
+Inheritance diagram for eo\-Pop\-Eval\-Func$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.01075cm]{classeo_pop_eval_func}
+\end{center}
+\end{figure}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Pop\-Eval\-Func$<$ EOT $>$}
+
+eo\-Pop\-Eval\-Func: This abstract class is for GLOBAL evaluators of a population after variation. 
+
+It takes 2 populations (typically the parents and the offspring) and is suppposed to evaluate them alltogether
+
+Basic use: apply an embedded {\bf eo\-Eval\-Func}{\rm (p.\,\pageref{classeo_eval_func})} to the offspring
+
+Time-varying fitness: apply the embedded {\bf eo\-Eval\-Func}{\rm (p.\,\pageref{classeo_eval_func})} to both offspring and parents
+
+Advanced uses: Co-evolution or \char`\"{}parisian\char`\"{} approach, or ...
+
+Basic parallelization (synchronous standard evolution engine): call the slaves and wait for the results 
+
+
+
+Definition at line 49 of file eo\-Pop\-Eval\-Func.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Pop\-Eval\-Func.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_pop_loop_eval.eps b/trunk/paradiseo-eo/doc/latex/classeo_pop_loop_eval.eps
new file mode 100644
index 000000000..e8c27c371
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_pop_loop_eval.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 107.527
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.65 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoPopLoopEval< EOT >) cw
+(eoPopEvalFunc< EOT >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoPopLoopEval< EOT >) 0.5 0 box
+ (eoPopEvalFunc< EOT >) 0.5 1 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_pop_loop_eval.tex b/trunk/paradiseo-eo/doc/latex/classeo_pop_loop_eval.tex
new file mode 100644
index 000000000..3768c8c23
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_pop_loop_eval.tex
@@ -0,0 +1,42 @@
+\section{eo\-Pop\-Loop\-Eval$<$ EOT $>$ Class Template Reference}
+\label{classeo_pop_loop_eval}\index{eoPopLoopEval@{eoPopLoopEval}}
+eo\-Pop\-Loop\-Eval: an instance of {\bf eo\-Pop\-Eval\-Func}{\rm (p.\,\pageref{classeo_pop_eval_func})} that simply applies a private {\bf eo\-Eval\-Func}{\rm (p.\,\pageref{classeo_eval_func})} to all offspring  
+
+
+{\tt \#include $<$eo\-Pop\-Eval\-Func.h$>$}
+
+Inheritance diagram for eo\-Pop\-Loop\-Eval$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.01075cm]{classeo_pop_loop_eval}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Pop\-Loop\-Eval} ({\bf eo\-Eval\-Func}$<$ {\bf EOT} $>$ \&\_\-eval)\label{classeo_pop_loop_eval_a0}
+
+\begin{CompactList}\small\item\em Ctor: set value of embedded {\bf eo\-Eval\-Func}{\rm (p.\,\pageref{classeo_eval_func})}. \item\end{CompactList}\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-parents, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-offspring)\label{classeo_pop_loop_eval_a1}
+
+\begin{CompactList}\small\item\em Do the job: simple loop over the offspring. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Eval\-Func}$<$ {\bf EOT} $>$ \& {\bf eval}\label{classeo_pop_loop_eval_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Pop\-Loop\-Eval$<$ EOT $>$}
+
+eo\-Pop\-Loop\-Eval: an instance of {\bf eo\-Pop\-Eval\-Func}{\rm (p.\,\pageref{classeo_pop_eval_func})} that simply applies a private {\bf eo\-Eval\-Func}{\rm (p.\,\pageref{classeo_eval_func})} to all offspring 
+
+
+
+Definition at line 60 of file eo\-Pop\-Eval\-Func.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Pop\-Eval\-Func.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_pop_stat.eps b/trunk/paradiseo-eo/doc/latex/classeo_pop_stat.eps
new file mode 100644
index 000000000..ba4eaa949
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_pop_stat.eps
@@ -0,0 +1,233 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 112.613
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.44 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoPopStat< EOT >) cw
+(eoStat< EOT, std::string >) cw
+(eoValueParam< std::string >) cw
+(eoStatBase< EOT >) cw
+(eoParam) cw
+(eoUF< const eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoPopStat< EOT >) 0.5 0 box
+ (eoStat< EOT, std::string >) 0.5 1 box
+ (eoValueParam< std::string >) 0 2 box
+ (eoStatBase< EOT >) 1 2 box
+ (eoParam) 0 3 box
+ (eoUF< const eoPop< EOT > &, void >) 1 3 box
+ (eoFunctorBase) 0.5 4 box
+ (unary_function< const eoPop< EOT > &, void >) 1.5 4 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+0 1 3 out
+solid
+0.5 1.5 4 conn
+solid
+1 0.5 4 in
+solid
+1 1.5 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_pop_stat.tex b/trunk/paradiseo-eo/doc/latex/classeo_pop_stat.tex
new file mode 100644
index 000000000..879a2003e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_pop_stat.tex
@@ -0,0 +1,73 @@
+\section{eo\-Pop\-Stat$<$ EOT $>$ Class Template Reference}
+\label{classeo_pop_stat}\index{eoPopStat@{eoPopStat}}
+Thanks to MS/VC++, {\bf eo\-Param}{\rm (p.\,\pageref{classeo_param})} mechanism is unable to handle std::vectors of stats.  
+
+
+{\tt \#include $<$eo\-Pop\-Stat.h$>$}
+
+Inheritance diagram for eo\-Pop\-Stat$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.15315cm]{classeo_pop_stat}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Pop\-Stat} (unsigned \_\-how\-Many=0, std::string \_\-desc=\char`\"{}\char`\"{})
+\begin{CompactList}\small\item\em default Ctor, void std::string by default, as it appears on the description line once at beginning of evolution. \item\end{CompactList}\item 
+void {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)
+\begin{CompactList}\small\item\em Fills the {\bf value()}{\rm (p.\,\pageref{classeo_value_param_a2})} of the {\bf eo\-Param}{\rm (p.\,\pageref{classeo_param})} with the dump of the population. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf combien}\label{classeo_pop_stat_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Pop\-Stat$<$ EOT $>$}
+
+Thanks to MS/VC++, {\bf eo\-Param}{\rm (p.\,\pageref{classeo_param})} mechanism is unable to handle std::vectors of stats. 
+
+This snippet is a workaround: This class will \char`\"{}print\char`\"{} a whole population into a std::string - that you can later send to any stream This is the plain version - see eo\-Pop\-String for the Sorted version
+
+Note: this Stat should probably be used only within eo\-Std\-Out\-Monitor, and not inside an {\bf eo\-File\-Monitor}{\rm (p.\,\pageref{classeo_file_monitor})}, as the {\bf eo\-State}{\rm (p.\,\pageref{classeo_state})} construct will work much better there. 
+
+
+
+Definition at line 51 of file eo\-Pop\-Stat.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoPopStat@{eo\-Pop\-Stat}!eoPopStat@{eoPopStat}}
+\index{eoPopStat@{eoPopStat}!eoPopStat@{eo\-Pop\-Stat}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Pop\-Stat}$<$ {\bf EOT} $>$::{\bf eo\-Pop\-Stat} (unsigned {\em \_\-how\-Many} = {\tt 0}, std::string {\em \_\-desc} = {\tt \char`\"{}\char`\"{}})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_pop_stat_a0}
+
+
+default Ctor, void std::string by default, as it appears on the description line once at beginning of evolution. 
+
+and is meaningless there. \_\-how\-Many defaults to 0, that is, the whole population 
+
+Definition at line 61 of file eo\-Pop\-Stat.h.
+
+\subsection{Member Function Documentation}
+\index{eoPopStat@{eo\-Pop\-Stat}!operator()@{operator()}}
+\index{operator()@{operator()}!eoPopStat@{eo\-Pop\-Stat}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ void {\bf eo\-Pop\-Stat}$<$ {\bf EOT} $>$::operator() (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\em \_\-pop})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_pop_stat_a1}
+
+
+Fills the {\bf value()}{\rm (p.\,\pageref{classeo_value_param_a2})} of the {\bf eo\-Param}{\rm (p.\,\pageref{classeo_param})} with the dump of the population. 
+
+Adds a \par
+ before so it does not get mixed up with the rest of the stats that are written by the monitor it is probably used from. 
+
+Implements {\bf eo\-UF$<$ const eo\-Pop$<$ EOT $>$ \&, void $>$} {\rm (p.\,\pageref{classeo_u_f_a1})}.
+
+Definition at line 68 of file eo\-Pop\-Stat.h.
+
+References eo\-Value\-Param$<$ std::string $>$::value().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Pop\-Stat.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_populator.eps b/trunk/paradiseo-eo/doc/latex/classeo_populator.eps
new file mode 100644
index 000000000..ed498815b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_populator.eps
@@ -0,0 +1,203 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 105.82
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.725 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 2 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoPopulator< EOT >) cw
+(eoSelectivePopulator< EOT >) cw
+(eoSeqPopulator< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoPopulator< EOT >) 0.5 1 box
+ (eoSelectivePopulator< EOT >) 0 0 box
+ (eoSeqPopulator< EOT >) 1 0 box
+
+% ----- relations -----
+
+solid
+1 0.5 0.25 out
+solid
+0 1 1 conn
+solid
+0 0 0.75 in
+solid
+0 1 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_populator.tex b/trunk/paradiseo-eo/doc/latex/classeo_populator.tex
new file mode 100644
index 000000000..520d24655
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_populator.tex
@@ -0,0 +1,121 @@
+\section{eo\-Populator$<$ EOT $>$ Class Template Reference}
+\label{classeo_populator}\index{eoPopulator@{eoPopulator}}
+eo\-Populator is a helper class for general operators {\bf eo\-Gen\-Op}{\rm (p.\,\pageref{classeo_gen_op})} It is an {\bf eo\-Pop}{\rm (p.\,\pageref{classeo_pop})} but also behaves like an eo\-Pop::iterator as far as operator$\ast$ and operator++ are concerned  
+
+
+{\tt \#include $<$eo\-Populator.h$>$}
+
+Inheritance diagram for eo\-Populator$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2cm]{classeo_populator}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef unsigned {\bf position\_\-type}\label{classeo_populator_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Populator} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-src, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-dest)\label{classeo_populator_a0}
+
+\item 
+virtual {\bf $\sim$eo\-Populator} ()\label{classeo_populator_a1}
+
+\begin{CompactList}\small\item\em Virtual Constructor. \item\end{CompactList}\item 
+{\bf EOT} \& {\bf operator $\ast$} (void)
+\begin{CompactList}\small\item\em a populator behaves like an iterator. \item\end{CompactList}\item 
+{\bf eo\-Populator} \& {\bf operator++} ()\label{classeo_populator_a3}
+
+\begin{CompactList}\small\item\em only prefix increment defined Does not add a new element when at the end, use operator$\ast$ for that If not on the end, increment the pointer to the next individual \item\end{CompactList}\item 
+void {\bf insert} (const {\bf EOT} \&\_\-eo)\label{classeo_populator_a4}
+
+\begin{CompactList}\small\item\em mandatory for operators that generate more offspring than parents if such a thing exists ? \item\end{CompactList}\item 
+void {\bf reserve} (int how\_\-many)\label{classeo_populator_a5}
+
+\begin{CompactList}\small\item\em just to make memory mangement more efficient \item\end{CompactList}\item 
+const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\bf source} (void)
+\begin{CompactList}\small\item\em can be useful for operators with embedded selectors e.g. \item\end{CompactList}\item 
+{\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\bf offspring} (void)
+\begin{CompactList}\small\item\em Get the offspring population. \item\end{CompactList}\item 
+position\_\-type {\bf tellp} ()\label{classeo_populator_a8}
+
+\begin{CompactList}\small\item\em this is a direct access container: tell position \item\end{CompactList}\item 
+void {\bf seekp} (position\_\-type pos)\label{classeo_populator_a9}
+
+\begin{CompactList}\small\item\em this is a direct access container: go to position \item\end{CompactList}\item 
+bool {\bf exhausted} (void)\label{classeo_populator_a10}
+
+\begin{CompactList}\small\item\em no more individuals \item\end{CompactList}\item 
+virtual const {\bf EOT} \& {\bf select} ()=0\label{classeo_populator_a11}
+
+\begin{CompactList}\small\item\em the pure virtual selection method - will be instanciated in {\bf eo\-Seq\-Populator}{\rm (p.\,\pageref{classeo_seq_populator})} and {\bf eo\-Selective\-Populator}{\rm (p.\,\pageref{classeo_selective_populator})} \item\end{CompactList}\end{CompactItemize}
+\subsection*{Protected Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\bf dest}\label{classeo_populator_p0}
+
+\item 
+{\bf eo\-Pop}$<$ {\bf EOT} $>$::iterator {\bf current}\label{classeo_populator_p1}
+
+\item 
+const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\bf src}\label{classeo_populator_p2}
+
+\end{CompactItemize}
+\subsection*{Private Member Functions}
+\begin{CompactItemize}
+\item 
+void {\bf get\_\-next} ()\label{classeo_populator_d0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Populator$<$ EOT $>$}
+
+eo\-Populator is a helper class for general operators {\bf eo\-Gen\-Op}{\rm (p.\,\pageref{classeo_gen_op})} It is an {\bf eo\-Pop}{\rm (p.\,\pageref{classeo_pop})} but also behaves like an eo\-Pop::iterator as far as operator$\ast$ and operator++ are concerned 
+
+See {\bf eo\-Gen\-Op}{\rm (p.\,\pageref{classeo_gen_op})} and {\bf eo\-Op\-Container}{\rm (p.\,\pageref{classeo_op_container})} 
+
+
+
+Definition at line 39 of file eo\-Populator.h.
+
+\subsection{Member Function Documentation}
+\index{eoPopulator@{eo\-Populator}!operator *@{operator $\ast$}}
+\index{operator *@{operator $\ast$}!eoPopulator@{eo\-Populator}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf EOT}\& {\bf eo\-Populator}$<$ {\bf EOT} $>$::operator $\ast$ (void)\hspace{0.3cm}{\tt  [inline]}}\label{classeo_populator_a2}
+
+
+a populator behaves like an iterator. 
+
+Hence the operator$\ast$ it returns the current individual -- eventually getting a new one through the operator++ if at the end 
+
+Definition at line 58 of file eo\-Populator.h.\index{eoPopulator@{eo\-Populator}!source@{source}}
+\index{source@{source}!eoPopulator@{eo\-Populator}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ const {\bf eo\-Pop}$<${\bf EOT}$>$\& {\bf eo\-Populator}$<$ {\bf EOT} $>$::source (void)\hspace{0.3cm}{\tt  [inline]}}\label{classeo_populator_a6}
+
+
+can be useful for operators with embedded selectors e.g. 
+
+your brain and my beauty -type 
+
+Definition at line 105 of file eo\-Populator.h.
+
+Referenced by eo\-Sel\-Bin\-Gen\-Op$<$ EOT $>$::apply(), and eo\-Es\-Global\-Xover$<$ EOT $>$::apply().\index{eoPopulator@{eo\-Populator}!offspring@{offspring}}
+\index{offspring@{offspring}!eoPopulator@{eo\-Populator}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Pop}$<${\bf EOT}$>$\& {\bf eo\-Populator}$<$ {\bf EOT} $>$::offspring (void)\hspace{0.3cm}{\tt  [inline]}}\label{classeo_populator_a7}
+
+
+Get the offspring population. 
+
+Can be useful when you want to do some online niching kind of thing 
+
+Definition at line 110 of file eo\-Populator.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Populator.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_printable.eps b/trunk/paradiseo-eo/doc/latex/classeo_printable.eps
new file mode 100644
index 000000000..ffa1af917
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_printable.eps
@@ -0,0 +1,305 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 1643.84
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 0.304167 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 24 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoPrintable) cw
+(eoPersistent) cw
+(EO< F >) cw
+(EO< double >) cw
+(EO< EOT::Fitness >) cw
+(EO< Fit >) cw
+(EO< Fitness >) cw
+(EO< fitness_type >) cw
+(EO< fitnessT >) cw
+(EO< FitT >) cw
+(EO< FType >) cw
+(EO< phenotype >) cw
+(EO< PyFitness >) cw
+(eoContinue< EOT >) cw
+(eoDistribution< EOT >) cw
+(eoHowMany) cw
+(eoIntBounds) cw
+(eoParser) cw
+(eoPop< EOT >) cw
+(eoPop< Dummy >) cw
+(eoPop< PyEO >) cw
+(eoRealBounds) cw
+(eoRealVectorBounds) cw
+(eoRng) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoPrintable) 0 23 box
+ (eoPersistent) 0 22 box
+ (EO< F >) 1 21 box
+ (EO< double >) 1 20 box
+1 20 mark
+ (EO< EOT::Fitness >) 1 19 box
+1 19 mark
+ (EO< Fit >) 1 18 box
+1 18 mark
+ (EO< Fitness >) 1 17 box
+1 17 mark
+ (EO< fitness_type >) 1 16 box
+1 16 mark
+ (EO< fitnessT >) 1 15 box
+1 15 mark
+ (EO< FitT >) 1 14 box
+1 14 mark
+ (EO< FType >) 1 13 box
+1 13 mark
+ (EO< phenotype >) 1 12 box
+1 12 mark
+ (EO< PyFitness >) 1 11 box
+1 11 mark
+ (eoContinue< EOT >) 1 10 box
+1 10 mark
+ (eoDistribution< EOT >) 1 9 box
+1 9 mark
+ (eoHowMany) 1 8 box
+ (eoIntBounds) 1 7 box
+1 7 mark
+ (eoParser) 1 6 box
+ (eoPop< EOT >) 1 5 box
+ (eoPop< Dummy >) 1 4 box
+1 4 mark
+ (eoPop< PyEO >) 1 3 box
+ (eoRealBounds) 1 2 box
+1 2 mark
+ (eoRealVectorBounds) 1 1 box
+1 1 mark
+ (eoRng) 1 0 box
+
+% ----- relations -----
+
+solid
+1 0 22.25 out
+solid
+0 0 22.75 in
+solid
+1 0 21.25 out
+solid
+0 0 21.5 hedge
+solid
+0 0 20.5 hedge
+solid
+0 0 19.5 hedge
+solid
+0 0 18.5 hedge
+solid
+0 0 17.5 hedge
+solid
+0 0 16.5 hedge
+solid
+0 0 15.5 hedge
+solid
+0 0 14.5 hedge
+solid
+0 0 13.5 hedge
+solid
+0 0 12.5 hedge
+solid
+0 0 11.5 hedge
+solid
+0 0 10.5 hedge
+solid
+0 0 9.5 hedge
+solid
+0 0 8.5 hedge
+solid
+0 0 7.5 hedge
+solid
+0 0 6.5 hedge
+solid
+0 0 5.5 hedge
+solid
+0 0 4.5 hedge
+solid
+0 0 3.5 hedge
+solid
+0 0 2.5 hedge
+solid
+0 0 1.5 hedge
+solid
+0 0 0.5 hedge
+solid
+0 22 0.5 vedge
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_printable.tex b/trunk/paradiseo-eo/doc/latex/classeo_printable.tex
new file mode 100644
index 000000000..473f96286
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_printable.tex
@@ -0,0 +1,54 @@
+\section{eo\-Printable Class Reference}
+\label{classeo_printable}\index{eoPrintable@{eoPrintable}}
+Base class for objects that can print themselves ({\bf print\-On}{\rm (p.\,\pageref{classeo_printable_a1})}\#).  
+
+
+{\tt \#include $<$eo\-Printable.h$>$}
+
+Inheritance diagram for eo\-Printable::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=12cm]{classeo_printable}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual {\bf $\sim$eo\-Printable} ()\label{classeo_printable_a0}
+
+\begin{CompactList}\small\item\em Virtual dtor. They are needed in virtual class hierarchies. \item\end{CompactList}\item 
+virtual void {\bf print\-On} (std::ostream \&\_\-os) const =0
+\begin{CompactList}\small\item\em Write object. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Base class for objects that can print themselves ({\bf print\-On}{\rm (p.\,\pageref{classeo_printable_a1})}\#). 
+
+Besides, this file defines the standard output for all the objects; if the objects define print\-On there's no need to define \#operator $<$$<$\#.$\backslash$ This functionality was separated from {\bf eo\-Object}{\rm (p.\,\pageref{classeo_object})}, since it makes no sense to print some objects (for instance, a {\bf eo\-Factory}{\rm (p.\,\pageref{classeo_factory})}\# or a random number generator. 
+
+
+
+Definition at line 43 of file eo\-Printable.h.
+
+\subsection{Member Function Documentation}
+\index{eoPrintable@{eo\-Printable}!printOn@{printOn}}
+\index{printOn@{printOn}!eoPrintable@{eo\-Printable}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}virtual void eo\-Printable::print\-On (std::ostream \& {\em \_\-os}) const\hspace{0.3cm}{\tt  [pure virtual]}}\label{classeo_printable_a1}
+
+
+Write object. 
+
+It's called print\-On since it prints the object on a stream. \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-os}]A std::ostream. \end{description}
+\end{Desc}
+
+
+Implemented in {\bf EO$<$ F $>$} {\rm (p.\,\pageref{class_e_o_z10_2})}, {\bf eo\-Continue$<$ EOT $>$} {\rm (p.\,\pageref{classeo_continue_a2})}, {\bf eo\-Gen\-Continue$<$ EOT $>$} {\rm (p.\,\pageref{classeo_gen_continue_a7})}, {\bf eo\-Pop$<$ EOT $>$} {\rm (p.\,\pageref{classeo_pop_a18})}, {\bf eo\-Vector$<$ Fit\-T, Gene\-Type $>$} {\rm (p.\,\pageref{classeo_vector_a4})}, {\bf eo\-Es\-Full$<$ Fit $>$} {\rm (p.\,\pageref{classeo_es_full_a2})}, {\bf eo\-Es\-Simple$<$ Fit $>$} {\rm (p.\,\pageref{classeo_es_simple_a2})}, {\bf eo\-Es\-Stdev$<$ Fit $>$} {\rm (p.\,\pageref{classeo_es_stdev_a2})}, {\bf eo\-Bit$<$ Fit\-T $>$} {\rm (p.\,\pageref{classeo_bit_a2})}, {\bf eo\-PBILDistrib$<$ EOT $>$} {\rm (p.\,\pageref{classeo_p_b_i_l_distrib_a3})}, {\bf eo\-Parse\-Tree$<$ FType, Node $>$} {\rm (p.\,\pageref{classeo_parse_tree_a5})}, {\bf eo\-External\-EO$<$ Fit, External $>$} {\rm (p.\,\pageref{classeo_external_e_o_a4})}, {\bf eo\-String$<$ fitness\-T $>$} {\rm (p.\,\pageref{classeo_string_z24_1})}, {\bf eo\-How\-Many} {\rm (p.\,\pageref{classeo_how_many_a5})}, {\bf eo\-Int\-No\-Bounds} {\rm (p.\,\pageref{classeo_int_no_bounds_a14})}, {\bf eo\-Int\-Interval} {\rm (p.\,\pageref{classeo_int_interval_a15})}, {\bf eo\-Int\-Below\-Bound} {\rm (p.\,\pageref{classeo_int_below_bound_a15})}, {\bf eo\-Int\-Above\-Bound} {\rm (p.\,\pageref{classeo_int_above_bound_a15})}, {\bf eo\-General\-Int\-Bounds} {\rm (p.\,\pageref{classeo_general_int_bounds_a18})}, {\bf eo\-Parser} {\rm (p.\,\pageref{classeo_parser_a3})}, {\bf eo\-Real\-No\-Bounds} {\rm (p.\,\pageref{classeo_real_no_bounds_a13})}, {\bf eo\-Real\-Interval} {\rm (p.\,\pageref{classeo_real_interval_a14})}, {\bf eo\-Real\-Below\-Bound} {\rm (p.\,\pageref{classeo_real_below_bound_a14})}, {\bf eo\-Real\-Above\-Bound} {\rm (p.\,\pageref{classeo_real_above_bound_a14})}, {\bf eo\-General\-Real\-Bounds} {\rm (p.\,\pageref{classeo_general_real_bounds_a17})}, {\bf eo\-Real\-Vector\-Bounds} {\rm (p.\,\pageref{classeo_real_vector_bounds_a9})}, {\bf eo\-Rng} {\rm (p.\,\pageref{classeo_rng_a16})}, {\bf Dummy} {\rm (p.\,\pageref{struct_dummy_a1})}, {\bf Dummy} {\rm (p.\,\pageref{struct_dummy_a2})}, {\bf Dummy} {\rm (p.\,\pageref{struct_dummy_a3})}, {\bf Dummy} {\rm (p.\,\pageref{struct_dummy_a4})}, {\bf EO$<$ double $>$} {\rm (p.\,\pageref{class_e_o_z10_2})}, {\bf EO$<$ EOT::Fitness $>$} {\rm (p.\,\pageref{class_e_o_z10_2})}, {\bf EO$<$ Fit\-T $>$} {\rm (p.\,\pageref{class_e_o_z10_2})}, {\bf EO$<$ phenotype $>$} {\rm (p.\,\pageref{class_e_o_z10_2})}, {\bf EO$<$ fitness\-T $>$} {\rm (p.\,\pageref{class_e_o_z10_2})}, {\bf EO$<$ Fit $>$} {\rm (p.\,\pageref{class_e_o_z10_2})}, {\bf EO$<$ FType $>$} {\rm (p.\,\pageref{class_e_o_z10_2})}, {\bf EO$<$ fitness\_\-type $>$} {\rm (p.\,\pageref{class_e_o_z10_2})}, {\bf EO$<$ Fitness $>$} {\rm (p.\,\pageref{class_e_o_z10_2})}, {\bf EO$<$ Py\-Fitness $>$} {\rm (p.\,\pageref{class_e_o_z10_2})}, {\bf eo\-Pop$<$ Py\-EO $>$} {\rm (p.\,\pageref{classeo_pop_a18})}, {\bf eo\-Pop$<$ Dummy $>$} {\rm (p.\,\pageref{classeo_pop_a18})}, {\bf eo\-Vector$<$ Fit, double $>$} {\rm (p.\,\pageref{classeo_vector_a4})}, {\bf eo\-Vector$<$ Fit\-T, double $>$} {\rm (p.\,\pageref{classeo_vector_a4})}, and {\bf eo\-Vector$<$ Fit\-T, bool $>$} {\rm (p.\,\pageref{classeo_vector_a4})}.
+
+Referenced by eo\-Real\-Vector\-Bounds::print\-On(), eo\-General\-Real\-Bounds::print\-On(), eo\-General\-Int\-Bounds::print\-On(), and eo\-State::save().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Printable.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_procedure_counter.eps b/trunk/paradiseo-eo/doc/latex/classeo_procedure_counter.eps
new file mode 100644
index 000000000..4555bbb3a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_procedure_counter.eps
@@ -0,0 +1,203 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 269.058
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.85833 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 3 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoProcedureCounter< Procedure >) cw
+(eoValueParam< unsigned long >) cw
+(eoParam) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoProcedureCounter< Procedure >) 0 0 box
+ (eoValueParam< unsigned long >) 0 1 box
+ (eoParam) 0 2 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_procedure_counter.tex b/trunk/paradiseo-eo/doc/latex/classeo_procedure_counter.tex
new file mode 100644
index 000000000..7cbf615f7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_procedure_counter.tex
@@ -0,0 +1,65 @@
+\section{eo\-Procedure\-Counter$<$ Procedure $>$ Class Template Reference}
+\label{classeo_procedure_counter}\index{eoProcedureCounter@{eoProcedureCounter}}
+Generic counter class that counts the number of times a procedure is used.  
+
+
+{\tt \#include $<$eo\-Counter.h$>$}
+
+Inheritance diagram for eo\-Procedure\-Counter$<$ Procedure $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3cm]{classeo_procedure_counter}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Procedure\-Counter} (Procedure \&\_\-proc, std::string \_\-name=\char`\"{}proc\_\-counter\char`\"{})\label{classeo_procedure_counter_a0}
+
+\item 
+Procedure::result\_\-type {\bf operator()} (void)
+\begin{CompactList}\small\item\em Calls the embedded function and increments the counter. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+Procedure \& {\bf proc}\label{classeo_procedure_counter_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Procedure$>$ class eo\-Procedure\-Counter$<$ Procedure $>$}
+
+Generic counter class that counts the number of times a procedure is used. 
+
+Add a procedure through its ctor and use this class instead of it.
+
+It is derived from {\bf eo\-Value\-Param}{\rm (p.\,\pageref{classeo_value_param})} so you can add it to a monitor. 
+
+
+
+Definition at line 41 of file eo\-Counter.h.
+
+\subsection{Member Function Documentation}
+\index{eoProcedureCounter@{eo\-Procedure\-Counter}!operator()@{operator()}}
+\index{operator()@{operator()}!eoProcedureCounter@{eo\-Procedure\-Counter}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Procedure$>$ Procedure::result\_\-type {\bf eo\-Procedure\-Counter}$<$ Procedure $>$::operator() (void)\hspace{0.3cm}{\tt  [inline]}}\label{classeo_procedure_counter_a1}
+
+
+Calls the embedded function and increments the counter. 
+
+Note for MSVC users, if this code does not compile, you are quite likely trying to count a function that has a non-void return type. Don't look at us, look at the MSVC builders. Code like \char`\"{}return void;\char`\"{} is perfectly legal according to the ANSI standard, but the guys at Microsoft didn't get to implementing it yet.
+
+We had two choices: assuming (and compiling ) code that returns void or code that returns non-void. Given that in {\bf EO}{\rm (p.\,\pageref{class_e_o})} most functors return void, it was chosen to support void.
+
+But also please let me know if you have a compiler that defines \_\-MSC\_\-VER (lot's of windows compilers do), but is quite capable of compiling return void; type of code. We'll try to change the signature then.
+
+You happy GNU (and other compiler) users will not have a problem with this.. 
+
+Definition at line 64 of file eo\-Counter.h.
+
+References eo\-Value\-Param$<$ unsigned long $>$::value().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Counter.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_prop_combined_bin_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_prop_combined_bin_op.eps
new file mode 100644
index 000000000..691e4b7fa
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_prop_combined_bin_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 92.9152
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.38125 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoPropCombinedBinOp< EOT >) cw
+(eoBinOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoBF< EOT &, const EOT &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< EOT &, const EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoPropCombinedBinOp< EOT >) 0.5 0 box
+ (eoBinOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoBF< EOT &, const EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< EOT &, const EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_prop_combined_bin_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_prop_combined_bin_op.tex
new file mode 100644
index 000000000..1fdfa4618
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_prop_combined_bin_op.tex
@@ -0,0 +1,51 @@
+\section{eo\-Prop\-Combined\-Bin\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_prop_combined_bin_op}\index{eoPropCombinedBinOp@{eoPropCombinedBinOp}}
+COmbined Binary genetic operator: operator() has two operands, only the first one can be modified.  
+
+
+{\tt \#include $<$eo\-Proportional\-Combined\-Op.h$>$}
+
+Inheritance diagram for eo\-Prop\-Combined\-Bin\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.60163cm]{classeo_prop_combined_bin_op}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Prop\-Combined\-Bin\-Op} ({\bf eo\-Bin\-Op}$<$ {\bf EOT} $>$ \&\_\-first, const double \_\-rate)\label{classeo_prop_combined_bin_op_a0}
+
+\begin{CompactList}\small\item\em Ctor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_prop_combined_bin_op_a1}
+
+\item 
+virtual void {\bf add} ({\bf eo\-Bin\-Op}$<$ {\bf EOT} $>$ \&\_\-op, const double \_\-rate, bool \_\-verbose=false)\label{classeo_prop_combined_bin_op_a2}
+
+\item 
+virtual void {\bf operator()} ({\bf EOT} \&\_\-indi1, const {\bf EOT} \&\_\-indi2)\label{classeo_prop_combined_bin_op_a3}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+std::vector$<$ {\bf eo\-Bin\-Op}$<$ {\bf EOT} $>$ $\ast$ $>$ {\bf ops}\label{classeo_prop_combined_bin_op_r0}
+
+\item 
+std::vector$<$ double $>$ {\bf rates}\label{classeo_prop_combined_bin_op_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Prop\-Combined\-Bin\-Op$<$ EOT $>$}
+
+COmbined Binary genetic operator: operator() has two operands, only the first one can be modified. 
+
+
+
+Definition at line 109 of file eo\-Proportional\-Combined\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Proportional\-Combined\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_prop_combined_mon_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_prop_combined_mon_op.eps
new file mode 100644
index 000000000..aa0013295
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_prop_combined_mon_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 128.205
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.9 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoPropCombinedMonOp< EOT >) cw
+(eoMonOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoUF< EOT &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoPropCombinedMonOp< EOT >) 0.5 0 box
+ (eoMonOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoUF< EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_prop_combined_mon_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_prop_combined_mon_op.tex
new file mode 100644
index 000000000..3a7ec020c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_prop_combined_mon_op.tex
@@ -0,0 +1,56 @@
+\section{eo\-Prop\-Combined\-Mon\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_prop_combined_mon_op}\index{eoPropCombinedMonOp@{eoPropCombinedMonOp}}
+{\bf eo\-Mon\-Op}{\rm (p.\,\pageref{classeo_mon_op})} is the monary operator: genetic operator that takes only one {\bf EO}{\rm (p.\,\pageref{class_e_o})}  
+
+
+{\tt \#include $<$eo\-Proportional\-Combined\-Op.h$>$}
+
+Inheritance diagram for eo\-Prop\-Combined\-Mon\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.58974cm]{classeo_prop_combined_mon_op}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Prop\-Combined\-Mon\-Op} ({\bf eo\-Mon\-Op}$<$ {\bf EOT} $>$ \&\_\-first, const double \_\-rate)\label{classeo_prop_combined_mon_op_a0}
+
+\begin{CompactList}\small\item\em Ctor from a \char`\"{}true\char`\"{} operator. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_prop_combined_mon_op_a1}
+
+\item 
+virtual void {\bf add} ({\bf eo\-Mon\-Op}$<$ {\bf EOT} $>$ \&\_\-op, const double \_\-rate, bool \_\-verbose=false)\label{classeo_prop_combined_mon_op_a2}
+
+\item 
+virtual void {\bf print\-On} (std::ostream \&\_\-os)\label{classeo_prop_combined_mon_op_a3}
+
+\item 
+virtual bool {\bf operator()} ({\bf EOT} \&\_\-indi)\label{classeo_prop_combined_mon_op_a4}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Protected Attributes}
+\begin{CompactItemize}
+\item 
+std::vector$<$ {\bf eo\-Mon\-Op}$<$ {\bf EOT} $>$ $\ast$ $>$ {\bf ops}\label{classeo_prop_combined_mon_op_p0}
+
+\item 
+std::vector$<$ double $>$ {\bf rates}\label{classeo_prop_combined_mon_op_p1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Prop\-Combined\-Mon\-Op$<$ EOT $>$}
+
+{\bf eo\-Mon\-Op}{\rm (p.\,\pageref{classeo_mon_op})} is the monary operator: genetic operator that takes only one {\bf EO}{\rm (p.\,\pageref{class_e_o})} 
+
+now accepts generic operators 
+
+
+
+Definition at line 58 of file eo\-Proportional\-Combined\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Proportional\-Combined\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_prop_combined_quad_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_prop_combined_quad_op.eps
new file mode 100644
index 000000000..b9e2fb4ff
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_prop_combined_quad_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 105.82
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.725 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoPropCombinedQuadOp< EOT >) cw
+(eoQuadOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoBF< EOT &, EOT &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< EOT &, EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoPropCombinedQuadOp< EOT >) 0.5 0 box
+ (eoQuadOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoBF< EOT &, EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< EOT &, EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_prop_combined_quad_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_prop_combined_quad_op.tex
new file mode 100644
index 000000000..6ac4e144c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_prop_combined_quad_op.tex
@@ -0,0 +1,56 @@
+\section{eo\-Prop\-Combined\-Quad\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_prop_combined_quad_op}\index{eoPropCombinedQuadOp@{eoPropCombinedQuadOp}}
+Combined quad genetic operator: operator() has two operands, both can be modified.  
+
+
+{\tt \#include $<$eo\-Proportional\-Combined\-Op.h$>$}
+
+Inheritance diagram for eo\-Prop\-Combined\-Quad\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.96296cm]{classeo_prop_combined_quad_op}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Prop\-Combined\-Quad\-Op} ({\bf eo\-Quad\-Op}$<$ {\bf EOT} $>$ \&\_\-first, const double \_\-rate)\label{classeo_prop_combined_quad_op_a0}
+
+\begin{CompactList}\small\item\em Ctor from a true operator. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_prop_combined_quad_op_a1}
+
+\item 
+virtual void {\bf add} ({\bf eo\-Quad\-Op}$<$ {\bf EOT} $>$ \&\_\-op, const double \_\-rate, bool \_\-verbose=false)\label{classeo_prop_combined_quad_op_a2}
+
+\item 
+virtual void {\bf print\-On} (std::ostream \&\_\-os)\label{classeo_prop_combined_quad_op_a3}
+
+\item 
+virtual bool {\bf operator()} ({\bf EOT} \&\_\-indi1, {\bf EOT} \&\_\-indi2)\label{classeo_prop_combined_quad_op_a4}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+std::vector$<$ {\bf eo\-Quad\-Op}$<$ {\bf EOT} $>$ $\ast$ $>$ {\bf ops}\label{classeo_prop_combined_quad_op_r0}
+
+\item 
+std::vector$<$ double $>$ {\bf rates}\label{classeo_prop_combined_quad_op_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Prop\-Combined\-Quad\-Op$<$ EOT $>$}
+
+Combined quad genetic operator: operator() has two operands, both can be modified. 
+
+generic operators are now allowed: there are imbedded into the corresponding \char`\"{}true\char`\"{} operator 
+
+
+
+Definition at line 163 of file eo\-Proportional\-Combined\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Proportional\-Combined\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_prop_g_a_gen_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_prop_g_a_gen_op.eps
new file mode 100644
index 000000000..655e3aa2e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_prop_g_a_gen_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 91.0125
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.49375 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoPropGAGenOp< EOT >) cw
+(eoGenOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoUF< eoPopulator< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< eoPopulator< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoPropGAGenOp< EOT >) 0.5 0 box
+ (eoGenOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoUF< eoPopulator< EOT > &, void >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< eoPopulator< EOT > &, void >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_prop_g_a_gen_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_prop_g_a_gen_op.tex
new file mode 100644
index 000000000..121ce2584
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_prop_g_a_gen_op.tex
@@ -0,0 +1,66 @@
+\section{eo\-Prop\-GAGen\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_prop_g_a_gen_op}\index{eoPropGAGenOp@{eoPropGAGenOp}}
+$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$ eo\-Prop\-GAGen\-Op (for Simple GA, but Proportional) choice between Crossover, mutation or cloining with respect to given relatve weights  
+
+
+{\tt \#include $<$eo\-Prop\-GAGen\-Op.h$>$}
+
+Inheritance diagram for eo\-Prop\-GAGen\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.54835cm]{classeo_prop_g_a_gen_op}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Prop\-GAGen\-Op} (double \_\-w\-Clone, {\bf eo\-Quad\-Op}$<$ {\bf EOT} $>$ \&\_\-cross, double \_\-w\-Cross, {\bf eo\-Mon\-Op}$<$ {\bf EOT} $>$ \&\_\-mut, double \_\-w\-Mut)\label{classeo_prop_g_a_gen_op_a0}
+
+\begin{CompactList}\small\item\em Ctor from $\ast$ weight of clone $\ast$ crossover (with weight) $\ast$ mutation (with weight). \item\end{CompactList}\item 
+virtual void {\bf apply} ({\bf eo\-Populator}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_prop_g_a_gen_op_a1}
+
+\begin{CompactList}\small\item\em do the job: delegate to op \item\end{CompactList}\item 
+virtual unsigned {\bf max\_\-production} (void)\label{classeo_prop_g_a_gen_op_a2}
+
+\begin{CompactList}\small\item\em inherited from {\bf eo\-Gen\-Op}{\rm (p.\,\pageref{classeo_gen_op})} \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_prop_g_a_gen_op_a3}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf w\-Clone}\label{classeo_prop_g_a_gen_op_r0}
+
+\item 
+{\bf eo\-Quad\-Op}$<$ {\bf EOT} $>$ \& {\bf cross}\label{classeo_prop_g_a_gen_op_r1}
+
+\item 
+double {\bf w\-Cross}\label{classeo_prop_g_a_gen_op_r2}
+
+\item 
+{\bf eo\-Mon\-Op}$<$ {\bf EOT} $>$ \& {\bf mut}\label{classeo_prop_g_a_gen_op_r3}
+
+\item 
+double {\bf w\-Mut}\label{classeo_prop_g_a_gen_op_r4}
+
+\item 
+{\bf eo\-Proportional\-Op}$<$ {\bf EOT} $>$ {\bf prop\-Op}\label{classeo_prop_g_a_gen_op_r5}
+
+\item 
+{\bf eo\-Mon\-Clone\-Op}$<$ {\bf EOT} $>$ {\bf mon\-Clone}\label{classeo_prop_g_a_gen_op_r6}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Prop\-GAGen\-Op$<$ EOT $>$}
+
+$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$ eo\-Prop\-GAGen\-Op (for Simple GA, but Proportional) choice between Crossover, mutation or cloining with respect to given relatve weights 
+
+
+
+Definition at line 42 of file eo\-Prop\-GAGen\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Prop\-GAGen\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_proportional_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_proportional_op.eps
new file mode 100644
index 000000000..7eae97c83
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_proportional_op.eps
@@ -0,0 +1,227 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 113.766
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.395 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoProportionalOp< EOT >) cw
+(eoOpContainer< EOT >) cw
+(eoGenOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoUF< eoPopulator< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< eoPopulator< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoProportionalOp< EOT >) 0.5 0 box
+ (eoOpContainer< EOT >) 0.5 1 box
+ (eoGenOp< EOT >) 0.5 2 box
+ (eoOp< EOT >) 0 3 box
+ (eoUF< eoPopulator< EOT > &, void >) 1 3 box
+ (eoFunctorBase) 0.5 4 box
+ (unary_function< eoPopulator< EOT > &, void >) 1.5 4 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+0 1 3 out
+solid
+0.5 1.5 4 conn
+solid
+1 0.5 4 in
+solid
+1 1.5 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_proportional_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_proportional_op.tex
new file mode 100644
index 000000000..fc20a3816
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_proportional_op.tex
@@ -0,0 +1,36 @@
+\section{eo\-Proportional\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_proportional_op}\index{eoProportionalOp@{eoProportionalOp}}
+The proportional versions: easy!  
+
+
+{\tt \#include $<$eo\-Op\-Container.h$>$}
+
+Inheritance diagram for eo\-Proportional\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.18544cm]{classeo_proportional_op}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+void {\bf apply} ({\bf eo\-Populator}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_proportional_op_a0}
+
+\begin{CompactList}\small\item\em the function that will do the work \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_proportional_op_a1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Proportional\-Op$<$ EOT $>$}
+
+The proportional versions: easy! 
+
+
+
+Definition at line 135 of file eo\-Op\-Container.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Op\-Container.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_proportional_select.eps b/trunk/paradiseo-eo/doc/latex/classeo_proportional_select.eps
new file mode 100644
index 000000000..cf2643028
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_proportional_select.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 115.607
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.325 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoProportionalSelect< EOT >) cw
+(eoSelectOne< EOT >) cw
+(eoUF< const eoPop< EOT > &, const EOT & >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, const EOT & >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoProportionalSelect< EOT >) 0.5 0 box
+ (eoSelectOne< EOT >) 0.5 1 box
+ (eoUF< const eoPop< EOT > &, const EOT & >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< const eoPop< EOT > &, const EOT & >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_proportional_select.tex b/trunk/paradiseo-eo/doc/latex/classeo_proportional_select.tex
new file mode 100644
index 000000000..3c74a6c60
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_proportional_select.tex
@@ -0,0 +1,53 @@
+\section{eo\-Proportional\-Select$<$ EOT $>$ Class Template Reference}
+\label{classeo_proportional_select}\index{eoProportionalSelect@{eoProportionalSelect}}
+eo\-Proportional\-Select: select an individual proportional to her stored fitness value  
+
+
+{\tt \#include $<$eo\-Proportional\-Select.h$>$}
+
+Inheritance diagram for eo\-Proportional\-Select$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.23699cm]{classeo_proportional_select}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Proportional\-Select} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&pop={\bf eo\-Pop}$<$ {\bf EOT} $>$())\label{classeo_proportional_select_a0}
+
+\begin{CompactList}\small\item\em Sanity check. \item\end{CompactList}\item 
+void {\bf setup} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_proportional_select_a1}
+
+\begin{CompactList}\small\item\em virtual function to setup some population stats (for instance eo\-Proportional can benefit greatly from this) \item\end{CompactList}\item 
+const {\bf EOT} \& {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_proportional_select_a2}
+
+\begin{CompactList}\small\item\em do the selection, \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Types}
+\begin{CompactItemize}
+\item 
+typedef std::vector$<$ typename EOT::Fitness $>$ {\bf Fit\-Vec}\label{classeo_proportional_select_y0}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+Fit\-Vec {\bf cumulative}\label{classeo_proportional_select_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Proportional\-Select$<$ EOT $>$}
+
+eo\-Proportional\-Select: select an individual proportional to her stored fitness value 
+
+Changed the algorithm to make use of a cumulative array of fitness scores, This changes the algorithm from O(n) per call to O(log n) per call. (MK) 
+
+
+
+Definition at line 45 of file eo\-Proportional\-Select.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Proportional\-Select.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_quad2_bin_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_quad2_bin_op.eps
new file mode 100644
index 000000000..c67d1adbf
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_quad2_bin_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 92.9152
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.38125 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoQuad2BinOp< EOT >) cw
+(eoBinOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoBF< EOT &, const EOT &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< EOT &, const EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoQuad2BinOp< EOT >) 0.5 0 box
+ (eoBinOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoBF< EOT &, const EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< EOT &, const EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_quad2_bin_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_quad2_bin_op.tex
new file mode 100644
index 000000000..5c7a9c2b9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_quad2_bin_op.tex
@@ -0,0 +1,58 @@
+\section{eo\-Quad2Bin\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_quad2_bin_op}\index{eoQuad2BinOp@{eoQuad2BinOp}}
+Turning an {\bf eo\-Quad\-Op}{\rm (p.\,\pageref{classeo_quad_op})} into an {\bf eo\-Bin\-Op}{\rm (p.\,\pageref{classeo_bin_op})}: simply don't touch the second arg!  
+
+
+{\tt \#include $<$eo\-Op.h$>$}
+
+Inheritance diagram for eo\-Quad2Bin\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.60163cm]{classeo_quad2_bin_op}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Quad2Bin\-Op} ({\bf eo\-Quad\-Op}$<$ {\bf EOT} $>$ \&\_\-quad\-Op)
+\begin{CompactList}\small\item\em Ctor. \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eo1, const {\bf EOT} \&\_\-eo2)\label{classeo_quad2_bin_op_a1}
+
+\begin{CompactList}\small\item\em Operator() simply calls embedded quad\-Op operator() with dummy second arg. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Quad\-Op}$<$ {\bf EOT} $>$ \& {\bf quad\-Op}\label{classeo_quad2_bin_op_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Quad2Bin\-Op$<$ EOT $>$}
+
+Turning an {\bf eo\-Quad\-Op}{\rm (p.\,\pageref{classeo_quad_op})} into an {\bf eo\-Bin\-Op}{\rm (p.\,\pageref{classeo_bin_op})}: simply don't touch the second arg! 
+
+
+
+Definition at line 143 of file eo\-Op.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoQuad2BinOp@{eo\-Quad2Bin\-Op}!eoQuad2BinOp@{eoQuad2BinOp}}
+\index{eoQuad2BinOp@{eoQuad2BinOp}!eoQuad2BinOp@{eo\-Quad2Bin\-Op}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Quad2Bin\-Op}$<$ {\bf EOT} $>$::{\bf eo\-Quad2Bin\-Op} ({\bf eo\-Quad\-Op}$<$ {\bf EOT} $>$ \& {\em \_\-quad\-Op})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_quad2_bin_op_a0}
+
+
+Ctor. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-quad\-Op}]the {\bf eo\-Quad\-Op}{\rm (p.\,\pageref{classeo_quad_op})} to be transformed \end{description}
+\end{Desc}
+
+
+Definition at line 149 of file eo\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_quad_clone_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_quad_clone_op.eps
new file mode 100644
index 000000000..5c5e35a71
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_quad_clone_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 105.82
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.725 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoQuadCloneOp< EOT >) cw
+(eoQuadOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoBF< EOT &, EOT &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< EOT &, EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoQuadCloneOp< EOT >) 0.5 0 box
+ (eoQuadOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoBF< EOT &, EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< EOT &, EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_quad_clone_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_quad_clone_op.tex
new file mode 100644
index 000000000..7eeb9630d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_quad_clone_op.tex
@@ -0,0 +1,39 @@
+\section{eo\-Quad\-Clone\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_quad_clone_op}\index{eoQuadCloneOp@{eoQuadCloneOp}}
+Quad clone: two operands, both could be modified - but are not!  
+
+
+{\tt \#include $<$eo\-Clone\-Ops.h$>$}
+
+Inheritance diagram for eo\-Quad\-Clone\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.96296cm]{classeo_quad_clone_op}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Quad\-Clone\-Op} ()\label{classeo_quad_clone_op_a0}
+
+\begin{CompactList}\small\item\em Ctor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_quad_clone_op_a1}
+
+\item 
+virtual bool {\bf operator()} ({\bf EOT} \&, {\bf EOT} \&)\label{classeo_quad_clone_op_a2}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Quad\-Clone\-Op$<$ EOT $>$}
+
+Quad clone: two operands, both could be modified - but are not! 
+
+
+
+Definition at line 69 of file eo\-Clone\-Ops.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Clone\-Ops.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_quad_distance.eps b/trunk/paradiseo-eo/doc/latex/classeo_quad_distance.eps
new file mode 100644
index 000000000..57c986a4e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_quad_distance.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 119.048
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.2 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoQuadDistance< EOT >) cw
+(eoDistance< EOT >) cw
+(eoBF< const EOT &, const EOT &, double >) cw
+(eoFunctorBase) cw
+(binary_function< const EOT &, const EOT &, double >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoQuadDistance< EOT >) 0.5 0 box
+ (eoDistance< EOT >) 0.5 1 box
+ (eoBF< const EOT &, const EOT &, double >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< const EOT &, const EOT &, double >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_quad_distance.tex b/trunk/paradiseo-eo/doc/latex/classeo_quad_distance.tex
new file mode 100644
index 000000000..bf792c2e5
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_quad_distance.tex
@@ -0,0 +1,33 @@
+\section{eo\-Quad\-Distance$<$ EOT $>$ Class Template Reference}
+\label{classeo_quad_distance}\index{eoQuadDistance@{eoQuadDistance}}
+This is a generic class for Euclidain distance (L2 norm) computation: assumes the 2 things are std::vectors of something that is double-castable.  
+
+
+{\tt \#include $<$eo\-Distance.h$>$}
+
+Inheritance diagram for eo\-Quad\-Distance$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.33333cm]{classeo_quad_distance}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+double {\bf operator()} (const {\bf EOT} \&\_\-v1, const {\bf EOT} \&\_\-v2)\label{classeo_quad_distance_a0}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Quad\-Distance$<$ EOT $>$}
+
+This is a generic class for Euclidain distance (L2 norm) computation: assumes the 2 things are std::vectors of something that is double-castable. 
+
+
+
+Definition at line 44 of file eo\-Distance.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Distance.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_quad_gen_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_quad_gen_op.eps
new file mode 100644
index 000000000..cb88a554b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_quad_gen_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 91.0125
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.49375 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoQuadGenOp< EOT >) cw
+(eoGenOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoUF< eoPopulator< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< eoPopulator< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoQuadGenOp< EOT >) 0.5 0 box
+ (eoGenOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoUF< eoPopulator< EOT > &, void >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< eoPopulator< EOT > &, void >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_quad_gen_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_quad_gen_op.tex
new file mode 100644
index 000000000..3767c07e4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_quad_gen_op.tex
@@ -0,0 +1,48 @@
+\section{eo\-Quad\-Gen\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_quad_gen_op}\index{eoQuadGenOp@{eoQuadGenOp}}
+Wrapper for quadop: easy as pie.  
+
+
+{\tt \#include $<$eo\-Gen\-Op.h$>$}
+
+Inheritance diagram for eo\-Quad\-Gen\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.54835cm]{classeo_quad_gen_op}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Quad\-Gen\-Op} ({\bf eo\-Quad\-Op}$<$ {\bf EOT} $>$ \&\_\-op)\label{classeo_quad_gen_op_a0}
+
+\item 
+unsigned {\bf max\_\-production} (void)\label{classeo_quad_gen_op_a1}
+
+\begin{CompactList}\small\item\em Max production is used to reserve space for all elements that are used by the operator, not setting it properly can result in a crash. \item\end{CompactList}\item 
+void {\bf apply} ({\bf eo\-Populator}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_quad_gen_op_a2}
+
+\begin{CompactList}\small\item\em the function that will do the work \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_quad_gen_op_a3}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Quad\-Op}$<$ {\bf EOT} $>$ \& {\bf op}\label{classeo_quad_gen_op_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Quad\-Gen\-Op$<$ EOT $>$}
+
+Wrapper for quadop: easy as pie. 
+
+
+
+Definition at line 157 of file eo\-Gen\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Gen\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_quad_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_quad_op.eps
new file mode 100644
index 000000000..abceb399e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_quad_op.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 68.0272
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 7.35 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 3 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoQuadOp< EOType >) cw
+(eoOp< EOType >) cw
+(eoBF< EOType &, EOType &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< EOType &, EOType &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoQuadOp< EOType >) 0.5 0 box
+ (eoOp< EOType >) 0 1 box
+ (eoBF< EOType &, EOType &, bool >) 1 1 box
+ (eoFunctorBase) 0.5 2 box
+ (binary_function< EOType &, EOType &, bool >) 1.5 2 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+0 1 1 conn
+solid
+1 0 1 in
+solid
+1 1 1 in
+solid
+0 1 1 out
+solid
+0.5 1.5 2 conn
+solid
+1 0.5 2 in
+solid
+1 1.5 2 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_quad_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_quad_op.tex
new file mode 100644
index 000000000..4d94ce4a4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_quad_op.tex
@@ -0,0 +1,38 @@
+\section{eo\-Quad\-Op$<$ EOType $>$ Class Template Reference}
+\label{classeo_quad_op}\index{eoQuadOp@{eoQuadOp}}
+Quad genetic operator: subclasses {\bf eo\-Op}{\rm (p.\,\pageref{classeo_op})}, and defines basically the operator() with two operands, both can be modified.  
+
+
+{\tt \#include $<$eo\-Op.h$>$}
+
+Inheritance diagram for eo\-Quad\-Op$<$ EOType $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=1.90476cm]{classeo_quad_op}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Quad\-Op} ()\label{classeo_quad_op_a0}
+
+\begin{CompactList}\small\item\em Ctor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_quad_op_a1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOType$>$ class eo\-Quad\-Op$<$ EOType $>$}
+
+Quad genetic operator: subclasses {\bf eo\-Op}{\rm (p.\,\pageref{classeo_op})}, and defines basically the operator() with two operands, both can be modified. 
+
+When defining your own, make sure that you return a boolean value indicating that you have changed the content. 
+
+
+
+Definition at line 132 of file eo\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_random_reduce.eps b/trunk/paradiseo-eo/doc/latex/classeo_random_reduce.eps
new file mode 100644
index 000000000..322b83894
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_random_reduce.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 123.457
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.05 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoRandomReduce< EOT >) cw
+(eoReduce< EOT >) cw
+(eoBF< eoPop< EOT > &, unsigned, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, unsigned, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoRandomReduce< EOT >) 0.5 0 box
+ (eoReduce< EOT >) 0.5 1 box
+ (eoBF< eoPop< EOT > &, unsigned, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< eoPop< EOT > &, unsigned, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_random_reduce.tex b/trunk/paradiseo-eo/doc/latex/classeo_random_reduce.tex
new file mode 100644
index 000000000..c4a556076
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_random_reduce.tex
@@ -0,0 +1,33 @@
+\section{eo\-Random\-Reduce$<$ EOT $>$ Class Template Reference}
+\label{classeo_random_reduce}\index{eoRandomReduce@{eoRandomReduce}}
+random truncation  
+
+
+{\tt \#include $<$eo\-Reduce.h$>$}
+
+Inheritance diagram for eo\-Random\-Reduce$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.45679cm]{classeo_random_reduce}
+\end{center}
+\end{figure}
+\subsection*{Private Member Functions}
+\begin{CompactItemize}
+\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-newgen, unsigned \_\-newsize)\label{classeo_random_reduce_d0}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Random\-Reduce$<$ EOT $>$}
+
+random truncation 
+
+
+
+Definition at line 64 of file eo\-Reduce.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Reduce.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_random_select.eps b/trunk/paradiseo-eo/doc/latex/classeo_random_select.eps
new file mode 100644
index 000000000..fe029e631
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_random_select.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 115.607
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.325 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoRandomSelect< EOT >) cw
+(eoSelectOne< EOT >) cw
+(eoUF< const eoPop< EOT > &, const EOT & >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, const EOT & >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoRandomSelect< EOT >) 0.5 0 box
+ (eoSelectOne< EOT >) 0.5 1 box
+ (eoUF< const eoPop< EOT > &, const EOT & >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< const eoPop< EOT > &, const EOT & >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_random_select.tex b/trunk/paradiseo-eo/doc/latex/classeo_random_select.tex
new file mode 100644
index 000000000..ee29f5e12
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_random_select.tex
@@ -0,0 +1,33 @@
+\section{eo\-Random\-Select$<$ EOT $>$ Class Template Reference}
+\label{classeo_random_select}\index{eoRandomSelect@{eoRandomSelect}}
+eo\-Random\-Select: a selection method that selects ONE individual randomly  
+
+
+{\tt \#include $<$eo\-Random\-Select.h$>$}
+
+Inheritance diagram for eo\-Random\-Select$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.23699cm]{classeo_random_select}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual const {\bf EOT} \& {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_random_select_a0}
+
+\begin{CompactList}\small\item\em not a big deal!!! \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Random\-Select$<$ EOT $>$}
+
+eo\-Random\-Select: a selection method that selects ONE individual randomly 
+
+
+
+Definition at line 44 of file eo\-Random\-Select.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Random\-Select.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_random_split.eps b/trunk/paradiseo-eo/doc/latex/classeo_random_split.eps
new file mode 100644
index 000000000..b67274c50
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_random_split.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 107.527
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.65 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoRandomSplit< EOT >) cw
+(eoReduceSplit< EOT >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoRandomSplit< EOT >) 0.5 0 box
+ (eoReduceSplit< EOT >) 0.5 1 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_random_split.tex b/trunk/paradiseo-eo/doc/latex/classeo_random_split.tex
new file mode 100644
index 000000000..5266808dc
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_random_split.tex
@@ -0,0 +1,45 @@
+\section{eo\-Random\-Split$<$ EOT $>$ Class Template Reference}
+\label{classeo_random_split}\index{eoRandomSplit@{eoRandomSplit}}
+random truncation - batch version  
+
+
+{\tt \#include $<$eo\-Reduce\-Split.h$>$}
+
+Inheritance diagram for eo\-Random\-Split$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.01075cm]{classeo_random_split}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Random\-Split} ({\bf eo\-How\-Many} \_\-how\-Many, bool \_\-return\-Eliminated=false)\label{classeo_random_split_a0}
+
+\begin{CompactList}\small\item\em Ctor: must provide amount of reduction, and whether or not you need to return the eliminated guys. \item\end{CompactList}\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-newgen, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-eliminated)\label{classeo_random_split_a1}
+
+\begin{CompactList}\small\item\em do the job \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-How\-Many} {\bf how\-Many}\label{classeo_random_split_r0}
+
+\item 
+bool {\bf return\-Eliminated}\label{classeo_random_split_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Random\-Split$<$ EOT $>$}
+
+random truncation - batch version 
+
+
+
+Definition at line 124 of file eo\-Reduce\-Split.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Reduce\-Split.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_ranking.eps b/trunk/paradiseo-eo/doc/latex/classeo_ranking.eps
new file mode 100644
index 000000000..ff9bb679e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_ranking.eps
@@ -0,0 +1,227 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 90.0901
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.55 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoRanking< EOT >) cw
+(eoPerf2Worth< EOT >) cw
+(eoUF< const eoPop< EOT > &, void >) cw
+(eoValueParam< std::vector< double > >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, void >) cw
+(eoParam) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoRanking< EOT >) 1.25 0 box
+ (eoPerf2Worth< EOT >) 1.25 1 box
+ (eoUF< const eoPop< EOT > &, void >) 0.5 2 box
+ (eoValueParam< std::vector< double > >) 2 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< const eoPop< EOT > &, void >) 1 3 box
+ (eoParam) 2 3 box
+
+% ----- relations -----
+
+solid
+0 1.25 0 out
+solid
+1 1.25 1 in
+solid
+0 1.25 1 out
+solid
+0.5 2 2 conn
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 2 2 in
+solid
+0 2 2 out
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+1 2 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_ranking.tex b/trunk/paradiseo-eo/doc/latex/classeo_ranking.tex
new file mode 100644
index 000000000..83f18dbad
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_ranking.tex
@@ -0,0 +1,50 @@
+\section{eo\-Ranking$<$ EOT $>$ Class Template Reference}
+\label{classeo_ranking}\index{eoRanking@{eoRanking}}
+An instance of eo\-Perf\-From\-Worth COmputes the ranked fitness: fitnesses range in [m,M] with m=2-pressure/pop\-Size and M=pressure/pop\-Size.  
+
+
+{\tt \#include $<$eo\-Ranking.h$>$}
+
+Inheritance diagram for eo\-Ranking$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.52252cm]{classeo_ranking}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Ranking} (double \_\-p=2.0, double \_\-e=1.0)\label{classeo_ranking_a0}
+
+\item 
+int {\bf lookfor} (const {\bf EOT} $\ast$\_\-eo, const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_ranking_a1}
+
+\item 
+virtual void {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_ranking_a2}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf pressure}\label{classeo_ranking_r0}
+
+\item 
+double {\bf exponent}\label{classeo_ranking_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Ranking$<$ EOT $>$}
+
+An instance of eo\-Perf\-From\-Worth COmputes the ranked fitness: fitnesses range in [m,M] with m=2-pressure/pop\-Size and M=pressure/pop\-Size. 
+
+in between, the progression depstd::ends on exponent (linear if 1). 
+
+
+
+Definition at line 38 of file eo\-Ranking.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Ranking.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_ranking_select.eps b/trunk/paradiseo-eo/doc/latex/classeo_ranking_select.eps
new file mode 100644
index 000000000..6b6610824
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_ranking_select.eps
@@ -0,0 +1,227 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 173.41
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.88333 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 6 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoRankingSelect< EOT >) cw
+(eoRouletteWorthSelect< EOT, double >) cw
+(eoSelectFromWorth< EOT, double >) cw
+(eoSelectOne< EOT >) cw
+(eoUF< const eoPop< EOT > &, const EOT & >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, const EOT & >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoRankingSelect< EOT >) 0.5 0 box
+ (eoRouletteWorthSelect< EOT, double >) 0.5 1 box
+ (eoSelectFromWorth< EOT, double >) 0.5 2 box
+ (eoSelectOne< EOT >) 0.5 3 box
+ (eoUF< const eoPop< EOT > &, const EOT & >) 0.5 4 box
+ (eoFunctorBase) 0 5 box
+ (unary_function< const eoPop< EOT > &, const EOT & >) 1 5 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+1 0.5 3 in
+solid
+0 0.5 3 out
+solid
+1 0.5 4 in
+solid
+0 0.5 4 out
+solid
+0 1 5 conn
+solid
+1 0 5 in
+solid
+1 1 5 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_ranking_select.tex b/trunk/paradiseo-eo/doc/latex/classeo_ranking_select.tex
new file mode 100644
index 000000000..57907b984
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_ranking_select.tex
@@ -0,0 +1,57 @@
+\section{eo\-Ranking\-Select$<$ EOT $>$ Class Template Reference}
+\label{classeo_ranking_select}\index{eoRankingSelect@{eoRankingSelect}}
+eo\-Ranking\-Select: select an individual by roulette wheel on its rank is an {\bf eo\-Roulette\-Worth\-Select}{\rm (p.\,\pageref{classeo_roulette_worth_select})}, i.e.  
+
+
+{\tt \#include $<$eo\-Ranking\-Select.h$>$}
+
+Inheritance diagram for eo\-Ranking\-Select$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4.85549cm]{classeo_ranking_select}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Ranking\-Select} (double \_\-p=2.0, double \_\-e=1.0)
+\begin{CompactList}\small\item\em Ctor:. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Ranking}$<$ {\bf EOT} $>$ {\bf ranking}\label{classeo_ranking_select_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Ranking\-Select$<$ EOT $>$}
+
+eo\-Ranking\-Select: select an individual by roulette wheel on its rank is an {\bf eo\-Roulette\-Worth\-Select}{\rm (p.\,\pageref{classeo_roulette_worth_select})}, i.e. 
+
+a selector using a std::vector of worthes rather than the raw fitness (see {\bf eo\-Select\-From\-Worth.h}{\rm (p.\,\pageref{eo_select_from_worth_8h})}) uses an internal {\bf eo\-Ranking}{\rm (p.\,\pageref{classeo_ranking})} object which is an {\bf eo\-Perf2Worth$<$EOT, double$>$}{\rm (p.\,\pageref{classeo_perf2_worth})} 
+
+
+
+Definition at line 41 of file eo\-Ranking\-Select.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoRankingSelect@{eo\-Ranking\-Select}!eoRankingSelect@{eoRankingSelect}}
+\index{eoRankingSelect@{eoRankingSelect}!eoRankingSelect@{eo\-Ranking\-Select}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Ranking\-Select}$<$ {\bf EOT} $>$::{\bf eo\-Ranking\-Select} (double {\em \_\-p} = {\tt 2.0}, double {\em \_\-e} = {\tt 1.0})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_ranking_select_a0}
+
+
+Ctor:. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-p}]the selective pressure, should be in [1,2] (2 is the default) \item[{\em \_\-e}]exponent (1 == linear) \end{description}
+\end{Desc}
+
+
+Definition at line 48 of file eo\-Ranking\-Select.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Ranking\-Select.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_real.eps b/trunk/paradiseo-eo/doc/latex/classeo_real.eps
new file mode 100644
index 000000000..240ba374e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_real.eps
@@ -0,0 +1,227 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 203.252
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.46 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoReal< FitT >) cw
+(eoVector< FitT, double >) cw
+(EO< FitT >) cw
+(vector< double >) cw
+(eoObject) cw
+(eoPersistent) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoReal< FitT >) 1 0 box
+ (eoVector< FitT, double >) 1 1 box
+ (EO< FitT >) 0.5 2 box
+ (vector< double >) 1.5 2 box
+ (eoObject) 0 3 box
+ (eoPersistent) 1 3 box
+ (eoPrintable) 1 4 box
+
+% ----- relations -----
+
+solid
+0 1 0 out
+solid
+1 1 1 in
+solid
+0 1 1 out
+solid
+0.5 1.5 2 conn
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 1.5 2 in
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+0 1 3 out
+solid
+1 1 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_real.tex b/trunk/paradiseo-eo/doc/latex/classeo_real.tex
new file mode 100644
index 000000000..20bd223f9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_real.tex
@@ -0,0 +1,54 @@
+\section{eo\-Real$<$ Fit\-T $>$ Class Template Reference}
+\label{classeo_real}\index{eoReal@{eoReal}}
+eo\-Real: implementation of simple real-valued chromosome.  
+
+
+{\tt \#include $<$eo\-Real.h$>$}
+
+Inheritance diagram for eo\-Real$<$ Fit\-T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=5cm]{classeo_real}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Real} (unsigned size=0, double value=0.0)
+\begin{CompactList}\small\item\em (Default) Constructor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_real_a1}
+
+\begin{CompactList}\small\item\em My class name. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Fit\-T$>$ class eo\-Real$<$ Fit\-T $>$}
+
+eo\-Real: implementation of simple real-valued chromosome. 
+
+based on {\bf eo\-Vector}{\rm (p.\,\pageref{classeo_vector})} class 
+
+
+
+Definition at line 37 of file eo\-Real.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoReal@{eo\-Real}!eoReal@{eoReal}}
+\index{eoReal@{eoReal}!eoReal@{eo\-Real}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Fit\-T$>$ {\bf eo\-Real}$<$ {\bf Fit\-T} $>$::{\bf eo\-Real} (unsigned {\em size} = {\tt 0}, double {\em value} = {\tt 0.0})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_real_a0}
+
+
+(Default) Constructor. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em size}]Size of the std::vector \end{description}
+\end{Desc}
+
+
+Definition at line 45 of file eo\-Real.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Real.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_real_above_bound.eps b/trunk/paradiseo-eo/doc/latex/classeo_real_above_bound.eps
new file mode 100644
index 000000000..8efca1bf4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_real_above_bound.eps
@@ -0,0 +1,209 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 606.061
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 0.825 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoRealAboveBound) cw
+(eoRealBounds) cw
+(eoPersistent) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoRealAboveBound) 0 0 box
+ (eoRealBounds) 0 1 box
+ (eoPersistent) 0 2 box
+ (eoPrintable) 0 3 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 0 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_real_above_bound.tex b/trunk/paradiseo-eo/doc/latex/classeo_real_above_bound.tex
new file mode 100644
index 000000000..ba7eea93e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_real_above_bound.tex
@@ -0,0 +1,112 @@
+\section{eo\-Real\-Above\-Bound Class Reference}
+\label{classeo_real_above_bound}\index{eoRealAboveBound@{eoRealAboveBound}}
+An eo\-Real\-Bound bounded from above only.  
+
+
+{\tt \#include $<$eo\-Real\-Bounds.h$>$}
+
+Inheritance diagram for eo\-Real\-Above\-Bound::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_real_above_bound}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Real\-Above\-Bound} (double \_\-max=0)\label{classeo_real_above_bound_a1}
+
+\begin{CompactList}\small\item\em Simple bounds = minimum. \item\end{CompactList}\item 
+virtual double {\bf maximum} () const \label{classeo_real_above_bound_a2}
+
+\begin{CompactList}\small\item\em get maximum value ::exception if does not exist \item\end{CompactList}\item 
+virtual double {\bf minimum} () const \label{classeo_real_above_bound_a3}
+
+\begin{CompactList}\small\item\em get minimum value ::exception if does not exist \item\end{CompactList}\item 
+virtual double {\bf range} () const \label{classeo_real_above_bound_a4}
+
+\begin{CompactList}\small\item\em get range ::exception if unbounded \item\end{CompactList}\item 
+virtual double {\bf uniform} ({\bf eo\-Rng} \&\_\-rng=eo::rng) const \label{classeo_real_above_bound_a5}
+
+\begin{CompactList}\small\item\em random generator of uniform numbers in bounds ::exception if unbounded \item\end{CompactList}\item 
+virtual bool {\bf is\-Bounded} (void) const \label{classeo_real_above_bound_a6}
+
+\begin{CompactList}\small\item\em Self-Test: true if $\ast$$\ast$$\ast$both$\ast$$\ast$$\ast$ a min and a max. \item\end{CompactList}\item 
+virtual bool {\bf has\-No\-Bound\-At\-All} (void) const \label{classeo_real_above_bound_a7}
+
+\begin{CompactList}\small\item\em Self-Test: true if no min $\ast$$\ast$$\ast$and$\ast$$\ast$$\ast$ no max hence no further need to test/truncate/fold anything. \item\end{CompactList}\item 
+virtual bool {\bf is\-Min\-Bounded} (void) const \label{classeo_real_above_bound_a8}
+
+\begin{CompactList}\small\item\em Self-Test: bounded from below??? \item\end{CompactList}\item 
+virtual bool {\bf is\-Max\-Bounded} (void) const \label{classeo_real_above_bound_a9}
+
+\begin{CompactList}\small\item\em Self-Test: bounded from above??? \item\end{CompactList}\item 
+virtual bool {\bf is\-In\-Bounds} (double \_\-r) const \label{classeo_real_above_bound_a10}
+
+\begin{CompactList}\small\item\em Test on a value: is it in bounds? \item\end{CompactList}\item 
+virtual void {\bf folds\-In\-Bounds} (double \&\_\-r) const \label{classeo_real_above_bound_a11}
+
+\begin{CompactList}\small\item\em Put value back into bounds - by folding back and forth. \item\end{CompactList}\item 
+virtual void {\bf truncate} (double \&\_\-r) const \label{classeo_real_above_bound_a12}
+
+\begin{CompactList}\small\item\em Put value back into bounds - by truncating to a boundary value. \item\end{CompactList}\item 
+virtual void {\bf read\-From} (std::istream \&\_\-is)
+\begin{CompactList}\small\item\em Read object. \item\end{CompactList}\item 
+virtual void {\bf print\-On} (std::ostream \&\_\-os) const 
+\begin{CompactList}\small\item\em Write object. \item\end{CompactList}\item 
+virtual {\bf eo\-Real\-Bounds} $\ast$ {\bf dup} () const \label{classeo_real_above_bound_a15}
+
+\begin{CompactList}\small\item\em for memory managements - ugly \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf rep\-Maximum}\label{classeo_real_above_bound_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+An eo\-Real\-Bound bounded from above only. 
+
+
+
+Definition at line 409 of file eo\-Real\-Bounds.h.
+
+\subsection{Member Function Documentation}
+\index{eoRealAboveBound@{eo\-Real\-Above\-Bound}!readFrom@{readFrom}}
+\index{readFrom@{readFrom}!eoRealAboveBound@{eo\-Real\-Above\-Bound}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}virtual void eo\-Real\-Above\-Bound::read\-From (std::istream \& {\em \_\-is})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_real_above_bound_a13}
+
+
+Read object. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-is}]A std::istream. but reading should not be done here, because of bound problems see {\bf eo\-Real\-Vector\-Bounds}{\rm (p.\,\pageref{classeo_real_vector_bounds})} \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Persistent} {\rm (p.\,\pageref{classeo_persistent_a1})}.
+
+Definition at line 477 of file eo\-Real\-Bounds.h.\index{eoRealAboveBound@{eo\-Real\-Above\-Bound}!printOn@{printOn}}
+\index{printOn@{printOn}!eoRealAboveBound@{eo\-Real\-Above\-Bound}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}virtual void eo\-Real\-Above\-Bound::print\-On (std::ostream \& {\em \_\-os}) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_real_above_bound_a14}
+
+
+Write object. 
+
+It's called print\-On since it prints the object on a stream. \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-os}]A std::ostream. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Printable} {\rm (p.\,\pageref{classeo_printable_a1})}.
+
+Definition at line 486 of file eo\-Real\-Bounds.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Real\-Bounds.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_real_base_vector_bounds.eps b/trunk/paradiseo-eo/doc/latex/classeo_real_base_vector_bounds.eps
new file mode 100644
index 000000000..3c0fc4880
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_real_base_vector_bounds.eps
@@ -0,0 +1,203 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 359.281
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.39167 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 3 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoRealBaseVectorBounds) cw
+(eoRealVectorBounds) cw
+(eoRealVectorNoBounds) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoRealBaseVectorBounds) 0 2 box
+ (eoRealVectorBounds) 0 1 box
+ (eoRealVectorNoBounds) 0 0 box
+
+% ----- relations -----
+
+solid
+1 0 1.25 out
+solid
+0 0 1.75 in
+solid
+1 0 0.25 out
+solid
+0 0 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_real_base_vector_bounds.tex b/trunk/paradiseo-eo/doc/latex/classeo_real_base_vector_bounds.tex
new file mode 100644
index 000000000..80bd07ca7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_real_base_vector_bounds.tex
@@ -0,0 +1,118 @@
+\section{eo\-Real\-Base\-Vector\-Bounds Class Reference}
+\label{classeo_real_base_vector_bounds}\index{eoRealBaseVectorBounds@{eoRealBaseVectorBounds}}
+Vector type for bounds (see {\bf eo\-Real\-Bounds.h}{\rm (p.\,\pageref{eo_real_bounds_8h})} for scalar types) ------------ Class {\bf eo\-Real\-Vector\-Bounds}{\rm (p.\,\pageref{classeo_real_vector_bounds})} implements the std::vectorized version: it is basically a std::vector of {\bf eo\-Real\-Bounds}{\rm (p.\,\pageref{classeo_real_bounds})} $\ast$ and forwards all request to the elements of the std::vector.  
+
+
+{\tt \#include $<$eo\-Real\-Vector\-Bounds.h$>$}
+
+Inheritance diagram for eo\-Real\-Base\-Vector\-Bounds::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3cm]{classeo_real_base_vector_bounds}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Real\-Base\-Vector\-Bounds} ()\label{classeo_real_base_vector_bounds_a1}
+
+\begin{CompactList}\small\item\em Default Ctor. \item\end{CompactList}\item 
+{\bf eo\-Real\-Base\-Vector\-Bounds} (unsigned \_\-dim, {\bf eo\-Real\-Bounds} \&\_\-bounds)\label{classeo_real_base_vector_bounds_a2}
+
+\begin{CompactList}\small\item\em Ctor: same bounds for everybody, given as an {\bf eo\-Real\-Bounds}{\rm (p.\,\pageref{classeo_real_bounds})}. \item\end{CompactList}\item 
+{\bf eo\-Real\-Base\-Vector\-Bounds} ({\bf eo\-Real\-Bounds} \&\_\-xbounds, {\bf eo\-Real\-Bounds} \&\_\-ybounds)\label{classeo_real_base_vector_bounds_a3}
+
+\begin{CompactList}\small\item\em Ctor, particular case of dim-2. \item\end{CompactList}\item 
+virtual bool {\bf is\-Bounded} (unsigned \_\-i)\label{classeo_real_base_vector_bounds_a4}
+
+\begin{CompactList}\small\item\em test: is i\_\-th component bounded \item\end{CompactList}\item 
+virtual bool {\bf is\-Bounded} (void)\label{classeo_real_base_vector_bounds_a5}
+
+\begin{CompactList}\small\item\em test: bounded iff all are bounded \item\end{CompactList}\item 
+virtual bool {\bf has\-No\-Bound\-At\-All} (unsigned \_\-i)\label{classeo_real_base_vector_bounds_a6}
+
+\begin{CompactList}\small\item\em Self-test: true iff i\_\-th component has no bounds at all. \item\end{CompactList}\item 
+virtual bool {\bf has\-No\-Bound\-At\-All} (void)\label{classeo_real_base_vector_bounds_a7}
+
+\begin{CompactList}\small\item\em Self-test: true iff all components have no bound at all. \item\end{CompactList}\item 
+virtual bool {\bf is\-Min\-Bounded} (unsigned \_\-i)\label{classeo_real_base_vector_bounds_a8}
+
+\item 
+virtual bool {\bf is\-Max\-Bounded} (unsigned \_\-i)\label{classeo_real_base_vector_bounds_a9}
+
+\item 
+virtual void {\bf folds\-In\-Bounds} (unsigned \_\-i, double \&\_\-r)\label{classeo_real_base_vector_bounds_a10}
+
+\begin{CompactList}\small\item\em Folds a real value back into the bounds - i\_\-th component. \item\end{CompactList}\item 
+virtual void {\bf folds\-In\-Bounds} (std::vector$<$ double $>$ \&\_\-v)\label{classeo_real_base_vector_bounds_a11}
+
+\begin{CompactList}\small\item\em Folds all variables of a std::vector of real values into the bounds. \item\end{CompactList}\item 
+virtual void {\bf truncate} (unsigned \_\-i, double \&\_\-r)\label{classeo_real_base_vector_bounds_a12}
+
+\begin{CompactList}\small\item\em Truncates a real value to the bounds - i\_\-th component. \item\end{CompactList}\item 
+virtual void {\bf truncate} (std::vector$<$ double $>$ \&\_\-v)\label{classeo_real_base_vector_bounds_a13}
+
+\begin{CompactList}\small\item\em truncates all variables of a std::vector of real values to the bounds \item\end{CompactList}\item 
+virtual bool {\bf is\-In\-Bounds} (unsigned \_\-i, double \_\-r)\label{classeo_real_base_vector_bounds_a14}
+
+\begin{CompactList}\small\item\em test: is i\_\-th component within the bounds? \item\end{CompactList}\item 
+virtual bool {\bf is\-In\-Bounds} (std::vector$<$ double $>$ \_\-v)\label{classeo_real_base_vector_bounds_a15}
+
+\begin{CompactList}\small\item\em test: are ALL components within the bounds? \item\end{CompactList}\item 
+virtual double {\bf minimum} (unsigned \_\-i)\label{classeo_real_base_vector_bounds_a16}
+
+\begin{CompactList}\small\item\em Accessors: will raise an std::exception if these do not exist. \item\end{CompactList}\item 
+virtual double {\bf maximum} (unsigned \_\-i)\label{classeo_real_base_vector_bounds_a17}
+
+\item 
+virtual double {\bf range} (unsigned \_\-i)\label{classeo_real_base_vector_bounds_a18}
+
+\item 
+virtual double {\bf average\-Range} ()\label{classeo_real_base_vector_bounds_a19}
+
+\begin{CompactList}\small\item\em Computes the average range An std::exception will be raised if one of the component is unbounded. \item\end{CompactList}\item 
+virtual double {\bf uniform} (unsigned \_\-i, {\bf eo\-Rng} \&\_\-rng=eo::rng)\label{classeo_real_base_vector_bounds_a20}
+
+\begin{CompactList}\small\item\em Generates a random number in i\_\-th range An std::exception will be raised if one of the component is unbounded. \item\end{CompactList}\item 
+void {\bf uniform} (std::vector$<$ double $>$ \&\_\-v, {\bf eo\-Rng} \&\_\-rng=eo::rng)\label{classeo_real_base_vector_bounds_a21}
+
+\begin{CompactList}\small\item\em fills a std::vector with uniformly chosen variables in bounds An std::exception will be raised if one of the component is unbounded \item\end{CompactList}\item 
+virtual void {\bf print\-On} (std::ostream \&\_\-os) const 
+\begin{CompactList}\small\item\em Write object. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Vector type for bounds (see {\bf eo\-Real\-Bounds.h}{\rm (p.\,\pageref{eo_real_bounds_8h})} for scalar types) ------------ Class {\bf eo\-Real\-Vector\-Bounds}{\rm (p.\,\pageref{classeo_real_vector_bounds})} implements the std::vectorized version: it is basically a std::vector of {\bf eo\-Real\-Bounds}{\rm (p.\,\pageref{classeo_real_bounds})} $\ast$ and forwards all request to the elements of the std::vector. 
+
+This file also contains the global variables and eo\-Dummy\-Vector\-No\-Bounds that are used as defaults in ctors (i.e. when no bounds are given, it is assumed unbounded values)
+
+THe 2 main classes defined here are
+
+eo\-Real\-Base\-Vector\-Bounds, base class that handles all useful functions {\bf eo\-Real\-Vector\-Bounds}{\rm (p.\,\pageref{classeo_real_vector_bounds})} which derives from the preceding $\ast$and$\ast$ {\bf eo\-Persistent}{\rm (p.\,\pageref{classeo_persistent})} and also has a mechanism for memory handling of the pointers it has to allocate 
+
+
+
+Definition at line 58 of file eo\-Real\-Vector\-Bounds.h.
+
+\subsection{Member Function Documentation}
+\index{eoRealBaseVectorBounds@{eo\-Real\-Base\-Vector\-Bounds}!printOn@{printOn}}
+\index{printOn@{printOn}!eoRealBaseVectorBounds@{eo\-Real\-Base\-Vector\-Bounds}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}virtual void eo\-Real\-Base\-Vector\-Bounds::print\-On (std::ostream \& {\em \_\-os}) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_real_base_vector_bounds_a22}
+
+
+Write object. 
+
+It's called print\-On since it prints the object on a stream. \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-os}]A std::ostream. \end{description}
+\end{Desc}
+
+
+Reimplemented in {\bf eo\-Real\-Vector\-Bounds} {\rm (p.\,\pageref{classeo_real_vector_bounds_a9})}.
+
+Definition at line 214 of file eo\-Real\-Vector\-Bounds.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Real\-Vector\-Bounds.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_real_below_bound.eps b/trunk/paradiseo-eo/doc/latex/classeo_real_below_bound.eps
new file mode 100644
index 000000000..2c3e4b22f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_real_below_bound.eps
@@ -0,0 +1,209 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 620.155
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 0.80625 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoRealBelowBound) cw
+(eoRealBounds) cw
+(eoPersistent) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoRealBelowBound) 0 0 box
+ (eoRealBounds) 0 1 box
+ (eoPersistent) 0 2 box
+ (eoPrintable) 0 3 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 0 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_real_below_bound.tex b/trunk/paradiseo-eo/doc/latex/classeo_real_below_bound.tex
new file mode 100644
index 000000000..45d91b02c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_real_below_bound.tex
@@ -0,0 +1,112 @@
+\section{eo\-Real\-Below\-Bound Class Reference}
+\label{classeo_real_below_bound}\index{eoRealBelowBound@{eoRealBelowBound}}
+an eo\-Real\-Bound bounded from below only  
+
+
+{\tt \#include $<$eo\-Real\-Bounds.h$>$}
+
+Inheritance diagram for eo\-Real\-Below\-Bound::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_real_below_bound}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Real\-Below\-Bound} (double \_\-min=0)\label{classeo_real_below_bound_a1}
+
+\begin{CompactList}\small\item\em Simple bounds = minimum. \item\end{CompactList}\item 
+virtual double {\bf minimum} () const \label{classeo_real_below_bound_a2}
+
+\begin{CompactList}\small\item\em get minimum value ::exception if does not exist \item\end{CompactList}\item 
+virtual double {\bf maximum} () const \label{classeo_real_below_bound_a3}
+
+\begin{CompactList}\small\item\em get maximum value ::exception if does not exist \item\end{CompactList}\item 
+virtual double {\bf range} () const \label{classeo_real_below_bound_a4}
+
+\begin{CompactList}\small\item\em get range ::exception if unbounded \item\end{CompactList}\item 
+virtual double {\bf uniform} ({\bf eo\-Rng} \&\_\-rng=eo::rng) const \label{classeo_real_below_bound_a5}
+
+\begin{CompactList}\small\item\em random generator of uniform numbers in bounds ::exception if unbounded \item\end{CompactList}\item 
+virtual bool {\bf is\-Bounded} (void) const \label{classeo_real_below_bound_a6}
+
+\begin{CompactList}\small\item\em Self-Test: true if $\ast$$\ast$$\ast$both$\ast$$\ast$$\ast$ a min and a max. \item\end{CompactList}\item 
+virtual bool {\bf has\-No\-Bound\-At\-All} (void) const \label{classeo_real_below_bound_a7}
+
+\begin{CompactList}\small\item\em Self-Test: true if no min $\ast$$\ast$$\ast$and$\ast$$\ast$$\ast$ no max hence no further need to test/truncate/fold anything. \item\end{CompactList}\item 
+virtual bool {\bf is\-Min\-Bounded} (void) const \label{classeo_real_below_bound_a8}
+
+\begin{CompactList}\small\item\em Self-Test: bounded from below??? \item\end{CompactList}\item 
+virtual bool {\bf is\-Max\-Bounded} (void) const \label{classeo_real_below_bound_a9}
+
+\begin{CompactList}\small\item\em Self-Test: bounded from above??? \item\end{CompactList}\item 
+virtual bool {\bf is\-In\-Bounds} (double \_\-r) const \label{classeo_real_below_bound_a10}
+
+\begin{CompactList}\small\item\em Test on a value: is it in bounds? \item\end{CompactList}\item 
+virtual void {\bf folds\-In\-Bounds} (double \&\_\-r) const \label{classeo_real_below_bound_a11}
+
+\begin{CompactList}\small\item\em Put value back into bounds - by folding back and forth. \item\end{CompactList}\item 
+virtual void {\bf truncate} (double \&\_\-r) const \label{classeo_real_below_bound_a12}
+
+\begin{CompactList}\small\item\em Put value back into bounds - by truncating to a boundary value. \item\end{CompactList}\item 
+virtual void {\bf read\-From} (std::istream \&\_\-is)
+\begin{CompactList}\small\item\em Read object. \item\end{CompactList}\item 
+virtual void {\bf print\-On} (std::ostream \&\_\-os) const 
+\begin{CompactList}\small\item\em Write object. \item\end{CompactList}\item 
+virtual {\bf eo\-Real\-Bounds} $\ast$ {\bf dup} () const \label{classeo_real_below_bound_a15}
+
+\begin{CompactList}\small\item\em for memory managements - ugly \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf rep\-Minimum}\label{classeo_real_below_bound_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+an eo\-Real\-Bound bounded from below only 
+
+
+
+Definition at line 315 of file eo\-Real\-Bounds.h.
+
+\subsection{Member Function Documentation}
+\index{eoRealBelowBound@{eo\-Real\-Below\-Bound}!readFrom@{readFrom}}
+\index{readFrom@{readFrom}!eoRealBelowBound@{eo\-Real\-Below\-Bound}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}virtual void eo\-Real\-Below\-Bound::read\-From (std::istream \& {\em \_\-is})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_real_below_bound_a13}
+
+
+Read object. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-is}]A std::istream. but reading should not be done here, because of bound problems see {\bf eo\-Real\-Vector\-Bounds}{\rm (p.\,\pageref{classeo_real_vector_bounds})} \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Persistent} {\rm (p.\,\pageref{classeo_persistent_a1})}.
+
+Definition at line 382 of file eo\-Real\-Bounds.h.\index{eoRealBelowBound@{eo\-Real\-Below\-Bound}!printOn@{printOn}}
+\index{printOn@{printOn}!eoRealBelowBound@{eo\-Real\-Below\-Bound}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}virtual void eo\-Real\-Below\-Bound::print\-On (std::ostream \& {\em \_\-os}) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_real_below_bound_a14}
+
+
+Write object. 
+
+It's called print\-On since it prints the object on a stream. \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-os}]A std::ostream. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Printable} {\rm (p.\,\pageref{classeo_printable_a1})}.
+
+Definition at line 391 of file eo\-Real\-Bounds.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Real\-Bounds.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_real_bounds.eps b/trunk/paradiseo-eo/doc/latex/classeo_real_bounds.eps
new file mode 100644
index 000000000..f4d3d4047
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_real_bounds.eps
@@ -0,0 +1,227 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 109.589
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.5625 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 5 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoRealBounds) cw
+(eoPersistent) cw
+(eoPrintable) cw
+(eoGeneralRealBounds) cw
+(eoRealAboveBound) cw
+(eoRealBelowBound) cw
+(eoRealInterval) cw
+(eoRealNoBounds) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoRealBounds) 2 1 box
+ (eoPersistent) 2 2 box
+ (eoPrintable) 2 3 box
+ (eoGeneralRealBounds) 0 0 box
+ (eoRealAboveBound) 1 0 box
+ (eoRealBelowBound) 2 0 box
+ (eoRealInterval) 3 0 box
+ (eoRealNoBounds) 4 0 box
+
+% ----- relations -----
+
+solid
+0 2 1 out
+solid
+1 2 2 in
+solid
+0 2 2 out
+solid
+1 2 3 in
+solid
+1 2 0.25 out
+solid
+0 4 1 conn
+solid
+0 0 0.75 in
+solid
+0 1 0.75 in
+solid
+0 2 0.75 in
+solid
+0 3 0.75 in
+solid
+0 4 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_real_bounds.tex b/trunk/paradiseo-eo/doc/latex/classeo_real_bounds.tex
new file mode 100644
index 000000000..cb4bb9524
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_real_bounds.tex
@@ -0,0 +1,80 @@
+\section{eo\-Real\-Bounds Class Reference}
+\label{classeo_real_bounds}\index{eoRealBounds@{eoRealBounds}}
+Defines bound classes for real numbers.  
+
+
+{\tt \#include $<$es/eo\-Real\-Bounds.h$>$}
+
+Inheritance diagram for eo\-Real\-Bounds::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.06849cm]{classeo_real_bounds}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual bool {\bf is\-Bounded} (void) const =0\label{classeo_real_bounds_a1}
+
+\begin{CompactList}\small\item\em Self-Test: true if $\ast$$\ast$$\ast$both$\ast$$\ast$$\ast$ a min and a max. \item\end{CompactList}\item 
+virtual bool {\bf has\-No\-Bound\-At\-All} (void) const =0\label{classeo_real_bounds_a2}
+
+\begin{CompactList}\small\item\em Self-Test: true if no min $\ast$$\ast$$\ast$and$\ast$$\ast$$\ast$ no max hence no further need to test/truncate/fold anything. \item\end{CompactList}\item 
+virtual bool {\bf is\-Min\-Bounded} (void) const =0\label{classeo_real_bounds_a3}
+
+\begin{CompactList}\small\item\em Self-Test: bounded from below??? \item\end{CompactList}\item 
+virtual bool {\bf is\-Max\-Bounded} (void) const =0\label{classeo_real_bounds_a4}
+
+\begin{CompactList}\small\item\em Self-Test: bounded from above??? \item\end{CompactList}\item 
+virtual bool {\bf is\-In\-Bounds} (double) const =0\label{classeo_real_bounds_a5}
+
+\begin{CompactList}\small\item\em Test on a value: is it in bounds? \item\end{CompactList}\item 
+virtual void {\bf folds\-In\-Bounds} (double \&) const =0\label{classeo_real_bounds_a6}
+
+\begin{CompactList}\small\item\em Put value back into bounds - by folding back and forth. \item\end{CompactList}\item 
+virtual void {\bf truncate} (double \&) const =0\label{classeo_real_bounds_a7}
+
+\begin{CompactList}\small\item\em Put value back into bounds - by truncating to a boundary value. \item\end{CompactList}\item 
+virtual double {\bf minimum} () const =0\label{classeo_real_bounds_a8}
+
+\begin{CompactList}\small\item\em get minimum value ::exception if does not exist \item\end{CompactList}\item 
+virtual double {\bf maximum} () const =0\label{classeo_real_bounds_a9}
+
+\begin{CompactList}\small\item\em get maximum value ::exception if does not exist \item\end{CompactList}\item 
+virtual double {\bf range} () const =0\label{classeo_real_bounds_a10}
+
+\begin{CompactList}\small\item\em get range ::exception if unbounded \item\end{CompactList}\item 
+virtual double {\bf uniform} ({\bf eo\-Rng} \&\_\-rng=eo::rng) const =0\label{classeo_real_bounds_a11}
+
+\begin{CompactList}\small\item\em random generator of uniform numbers in bounds ::exception if unbounded \item\end{CompactList}\item 
+virtual {\bf eo\-Real\-Bounds} $\ast$ {\bf dup} () const =0\label{classeo_real_bounds_a12}
+
+\begin{CompactList}\small\item\em for memory managements - ugly \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Defines bound classes for real numbers. 
+
+Scalar type: ------------ Basic class is eo\-Real\-Bounds, a pure virtual.
+
+The following pure virtual methods are to be used in mutations:\begin{itemize}
+\item void folds\-In\-Bounds(double \&) that folds any value that falls out of the bounds back into the bounds, by bouncing on the limit (if any)\item bool is\-In\-Bounds(double) that simply says whether or not the argument is in the bounds\item void truncate(double \&) that set the argument to the bound value it it exceeds it\end{itemize}
+
+
+So mutation can choose\begin{itemize}
+\item iterate trying until they fall in bounds,\item only try once and \char`\"{}restd::pair\char`\"{} by using the folds\-In\-Bounds method\item only try once and restd::pair using the truncate method (will create a huge bias toward the bound if the soluiton is not far from the bounds)\end{itemize}
+
+
+There is also a {\bf uniform()}{\rm (p.\,\pageref{classeo_real_bounds_a11})} method that generates a uniform value (if possible, i.e. if bounded) in the interval.
+
+Derived class are {\bf eo\-Real\-Interval}{\rm (p.\,\pageref{classeo_real_interval})} that holds a minimum and maximum value, {\bf eo\-Real\-No\-Bounds}{\rm (p.\,\pageref{classeo_real_no_bounds})} the \char`\"{}unbounded bounds\char`\"{} (-infinity, +infinity) {\bf eo\-Real\-Below\-Bound}{\rm (p.\,\pageref{classeo_real_below_bound})} the half-bounded interval [min, +infinity) {\bf eo\-Real\-Above\-Bound}{\rm (p.\,\pageref{classeo_real_above_bound})} the half-bounded interval (-infinity, max]
+
+THis file also contains the declaration of $\ast$the$\ast$ global object that is the unbounded bound 
+
+
+
+Definition at line 75 of file eo\-Real\-Bounds.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Real\-Bounds.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_real_init_bounded.eps b/trunk/paradiseo-eo/doc/latex/classeo_real_init_bounded.eps
new file mode 100644
index 000000000..24692015f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_real_init_bounded.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 248.756
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.01 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoRealInitBounded< EOT >) cw
+(eoInit< EOT >) cw
+(eoUF< EOT &, void >) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, void >) cw
+(eoEsChromInit< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoRealInitBounded< EOT >) 0.5 1 box
+ (eoInit< EOT >) 0.5 2 box
+ (eoUF< EOT &, void >) 0.5 3 box
+ (eoFunctorBase) 0 4 box
+ (unary_function< EOT &, void >) 1 4 box
+ (eoEsChromInit< EOT >) 0.5 0 box
+
+% ----- relations -----
+
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+1 0.5 3 in
+solid
+0 0.5 3 out
+solid
+0 1 4 conn
+solid
+1 0 4 in
+solid
+1 1 4 in
+solid
+1 0.5 0.25 out
+solid
+0 0.5 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_real_init_bounded.tex b/trunk/paradiseo-eo/doc/latex/classeo_real_init_bounded.tex
new file mode 100644
index 000000000..5f7af6633
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_real_init_bounded.tex
@@ -0,0 +1,48 @@
+\section{eo\-Real\-Init\-Bounded$<$ EOT $>$ Class Template Reference}
+\label{classeo_real_init_bounded}\index{eoRealInitBounded@{eoRealInitBounded}}
+Simple initialization for any EOT that derives from std::vector$<$double$>$ uniformly in some bounds.  
+
+
+{\tt \#include $<$eo\-Real\-Init\-Bounded.h$>$}
+
+Inheritance diagram for eo\-Real\-Init\-Bounded$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=5cm]{classeo_real_init_bounded}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Real\-Init\-Bounded} ({\bf eo\-Real\-Vector\-Bounds} \&\_\-bounds)\label{classeo_real_init_bounded_a0}
+
+\begin{CompactList}\small\item\em Ctor - from {\bf eo\-Real\-Vector\-Bounds}{\rm (p.\,\pageref{classeo_real_vector_bounds})}. \item\end{CompactList}\item 
+virtual void {\bf operator()} ({\bf EOT} \&\_\-eo)\label{classeo_real_init_bounded_a1}
+
+\begin{CompactList}\small\item\em simply passes the argument to the uniform method of the bounds \item\end{CompactList}\item 
+virtual {\bf eo\-Real\-Vector\-Bounds} \& {\bf the\-Bounds} ()\label{classeo_real_init_bounded_a2}
+
+\begin{CompactList}\small\item\em accessor to the bounds \item\end{CompactList}\item 
+virtual unsigned {\bf size} ()\label{classeo_real_init_bounded_a3}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Real\-Vector\-Bounds} \& {\bf bounds}\label{classeo_real_init_bounded_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Real\-Init\-Bounded$<$ EOT $>$}
+
+Simple initialization for any EOT that derives from std::vector$<$double$>$ uniformly in some bounds. 
+
+
+
+Definition at line 40 of file eo\-Real\-Init\-Bounded.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Real\-Init\-Bounded.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_real_interval.eps b/trunk/paradiseo-eo/doc/latex/classeo_real_interval.eps
new file mode 100644
index 000000000..8fa0769be
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_real_interval.eps
@@ -0,0 +1,209 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 792.079
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 0.63125 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoRealInterval) cw
+(eoRealBounds) cw
+(eoPersistent) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoRealInterval) 0 0 box
+ (eoRealBounds) 0 1 box
+ (eoPersistent) 0 2 box
+ (eoPrintable) 0 3 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 0 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_real_interval.tex b/trunk/paradiseo-eo/doc/latex/classeo_real_interval.tex
new file mode 100644
index 000000000..9f3a33466
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_real_interval.tex
@@ -0,0 +1,118 @@
+\section{eo\-Real\-Interval Class Reference}
+\label{classeo_real_interval}\index{eoRealInterval@{eoRealInterval}}
+fully bounded eo\-Real\-Bound == interval  
+
+
+{\tt \#include $<$eo\-Real\-Bounds.h$>$}
+
+Inheritance diagram for eo\-Real\-Interval::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_real_interval}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Real\-Interval} (double \_\-min=0, double \_\-max=1)\label{classeo_real_interval_a1}
+
+\begin{CompactList}\small\item\em Simple bounds = minimum and maximum (allowed). \item\end{CompactList}\item 
+virtual double {\bf minimum} () const \label{classeo_real_interval_a2}
+
+\begin{CompactList}\small\item\em get minimum value ::exception if does not exist \item\end{CompactList}\item 
+virtual double {\bf maximum} () const \label{classeo_real_interval_a3}
+
+\begin{CompactList}\small\item\em get maximum value ::exception if does not exist \item\end{CompactList}\item 
+virtual double {\bf range} () const \label{classeo_real_interval_a4}
+
+\begin{CompactList}\small\item\em get range ::exception if unbounded \item\end{CompactList}\item 
+virtual bool {\bf is\-Bounded} (void) const \label{classeo_real_interval_a5}
+
+\begin{CompactList}\small\item\em Self-Test: true if $\ast$$\ast$$\ast$both$\ast$$\ast$$\ast$ a min and a max. \item\end{CompactList}\item 
+virtual bool {\bf has\-No\-Bound\-At\-All} (void) const \label{classeo_real_interval_a6}
+
+\begin{CompactList}\small\item\em Self-Test: true if no min $\ast$$\ast$$\ast$and$\ast$$\ast$$\ast$ no max hence no further need to test/truncate/fold anything. \item\end{CompactList}\item 
+virtual bool {\bf is\-Min\-Bounded} (void) const \label{classeo_real_interval_a7}
+
+\begin{CompactList}\small\item\em Self-Test: bounded from below??? \item\end{CompactList}\item 
+virtual bool {\bf is\-Max\-Bounded} (void) const \label{classeo_real_interval_a8}
+
+\begin{CompactList}\small\item\em Self-Test: bounded from above??? \item\end{CompactList}\item 
+virtual double {\bf uniform} ({\bf eo\-Rng} \&\_\-rng=eo::rng) const \label{classeo_real_interval_a9}
+
+\begin{CompactList}\small\item\em random generator of uniform numbers in bounds ::exception if unbounded \item\end{CompactList}\item 
+virtual bool {\bf is\-In\-Bounds} (double \_\-r) const \label{classeo_real_interval_a10}
+
+\begin{CompactList}\small\item\em Test on a value: is it in bounds? \item\end{CompactList}\item 
+virtual void {\bf folds\-In\-Bounds} (double \&\_\-r) const \label{classeo_real_interval_a11}
+
+\begin{CompactList}\small\item\em Put value back into bounds - by folding back and forth. \item\end{CompactList}\item 
+virtual void {\bf truncate} (double \&\_\-r) const \label{classeo_real_interval_a12}
+
+\begin{CompactList}\small\item\em Put value back into bounds - by truncating to a boundary value. \item\end{CompactList}\item 
+virtual void {\bf read\-From} (std::istream \&\_\-is)
+\begin{CompactList}\small\item\em Read object. \item\end{CompactList}\item 
+virtual void {\bf print\-On} (std::ostream \&\_\-os) const 
+\begin{CompactList}\small\item\em Write object. \item\end{CompactList}\item 
+virtual {\bf eo\-Real\-Bounds} $\ast$ {\bf dup} () const \label{classeo_real_interval_a15}
+
+\begin{CompactList}\small\item\em for memory managements - ugly \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf rep\-Minimum}\label{classeo_real_interval_r0}
+
+\item 
+double {\bf rep\-Maximum}\label{classeo_real_interval_r1}
+
+\item 
+double {\bf rep\-Range}\label{classeo_real_interval_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+fully bounded eo\-Real\-Bound == interval 
+
+
+
+Definition at line 199 of file eo\-Real\-Bounds.h.
+
+\subsection{Member Function Documentation}
+\index{eoRealInterval@{eo\-Real\-Interval}!readFrom@{readFrom}}
+\index{readFrom@{readFrom}!eoRealInterval@{eo\-Real\-Interval}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}virtual void eo\-Real\-Interval::read\-From (std::istream \& {\em \_\-is})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_real_interval_a13}
+
+
+Read object. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-is}]A std::istream. but reading should not be done here, because of bound problems see {\bf eo\-Real\-Vector\-Bounds}{\rm (p.\,\pageref{classeo_real_vector_bounds})} \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Persistent} {\rm (p.\,\pageref{classeo_persistent_a1})}.
+
+Definition at line 286 of file eo\-Real\-Bounds.h.\index{eoRealInterval@{eo\-Real\-Interval}!printOn@{printOn}}
+\index{printOn@{printOn}!eoRealInterval@{eo\-Real\-Interval}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}virtual void eo\-Real\-Interval::print\-On (std::ostream \& {\em \_\-os}) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_real_interval_a14}
+
+
+Write object. 
+
+It's called print\-On since it prints the object on a stream. \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-os}]A std::ostream. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Printable} {\rm (p.\,\pageref{classeo_printable_a1})}.
+
+Definition at line 295 of file eo\-Real\-Bounds.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Real\-Bounds.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_real_no_bounds.eps b/trunk/paradiseo-eo/doc/latex/classeo_real_no_bounds.eps
new file mode 100644
index 000000000..1fcfba649
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_real_no_bounds.eps
@@ -0,0 +1,209 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 683.761
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 0.73125 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoRealNoBounds) cw
+(eoRealBounds) cw
+(eoPersistent) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoRealNoBounds) 0 0 box
+ (eoRealBounds) 0 1 box
+ (eoPersistent) 0 2 box
+ (eoPrintable) 0 3 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 0 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_real_no_bounds.tex b/trunk/paradiseo-eo/doc/latex/classeo_real_no_bounds.tex
new file mode 100644
index 000000000..46b413530
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_real_no_bounds.tex
@@ -0,0 +1,103 @@
+\section{eo\-Real\-No\-Bounds Class Reference}
+\label{classeo_real_no_bounds}\index{eoRealNoBounds@{eoRealNoBounds}}
+A default class for unbounded variables.  
+
+
+{\tt \#include $<$eo\-Real\-Bounds.h$>$}
+
+Inheritance diagram for eo\-Real\-No\-Bounds::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_real_no_bounds}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual bool {\bf is\-Bounded} (void) const \label{classeo_real_no_bounds_a1}
+
+\begin{CompactList}\small\item\em Self-Test: true if $\ast$$\ast$$\ast$both$\ast$$\ast$$\ast$ a min and a max. \item\end{CompactList}\item 
+virtual bool {\bf has\-No\-Bound\-At\-All} (void) const \label{classeo_real_no_bounds_a2}
+
+\begin{CompactList}\small\item\em Self-Test: true if no min $\ast$$\ast$$\ast$and$\ast$$\ast$$\ast$ no max hence no further need to test/truncate/fold anything. \item\end{CompactList}\item 
+virtual bool {\bf is\-Min\-Bounded} (void) const \label{classeo_real_no_bounds_a3}
+
+\begin{CompactList}\small\item\em Self-Test: bounded from below??? \item\end{CompactList}\item 
+virtual bool {\bf is\-Max\-Bounded} (void) const \label{classeo_real_no_bounds_a4}
+
+\begin{CompactList}\small\item\em Self-Test: bounded from above??? \item\end{CompactList}\item 
+virtual void {\bf folds\-In\-Bounds} (double \&) const \label{classeo_real_no_bounds_a5}
+
+\begin{CompactList}\small\item\em Put value back into bounds - by folding back and forth. \item\end{CompactList}\item 
+virtual void {\bf truncate} (double \&) const \label{classeo_real_no_bounds_a6}
+
+\begin{CompactList}\small\item\em Put value back into bounds - by truncating to a boundary value. \item\end{CompactList}\item 
+virtual bool {\bf is\-In\-Bounds} (double) const \label{classeo_real_no_bounds_a7}
+
+\begin{CompactList}\small\item\em Test on a value: is it in bounds? \item\end{CompactList}\item 
+virtual double {\bf minimum} () const \label{classeo_real_no_bounds_a8}
+
+\begin{CompactList}\small\item\em get minimum value ::exception if does not exist \item\end{CompactList}\item 
+virtual double {\bf maximum} () const \label{classeo_real_no_bounds_a9}
+
+\begin{CompactList}\small\item\em get maximum value ::exception if does not exist \item\end{CompactList}\item 
+virtual double {\bf range} () const \label{classeo_real_no_bounds_a10}
+
+\begin{CompactList}\small\item\em get range ::exception if unbounded \item\end{CompactList}\item 
+virtual double {\bf uniform} ({\bf eo\-Rng} \&\_\-rng=eo::rng) const \label{classeo_real_no_bounds_a11}
+
+\begin{CompactList}\small\item\em random generator of uniform numbers in bounds ::exception if unbounded \item\end{CompactList}\item 
+virtual void {\bf read\-From} (std::istream \&\_\-is)
+\begin{CompactList}\small\item\em Read object. \item\end{CompactList}\item 
+virtual void {\bf print\-On} (std::ostream \&\_\-os) const 
+\begin{CompactList}\small\item\em Write object. \item\end{CompactList}\item 
+virtual {\bf eo\-Real\-Bounds} $\ast$ {\bf dup} () const \label{classeo_real_no_bounds_a14}
+
+\begin{CompactList}\small\item\em for memory managements - ugly \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+A default class for unbounded variables. 
+
+
+
+Definition at line 133 of file eo\-Real\-Bounds.h.
+
+\subsection{Member Function Documentation}
+\index{eoRealNoBounds@{eo\-Real\-No\-Bounds}!readFrom@{readFrom}}
+\index{readFrom@{readFrom}!eoRealNoBounds@{eo\-Real\-No\-Bounds}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}virtual void eo\-Real\-No\-Bounds::read\-From (std::istream \& {\em \_\-is})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_real_no_bounds_a12}
+
+
+Read object. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-is}]A std::istream. but reading should not be done here, because of bound problems see {\bf eo\-Real\-Vector\-Bounds}{\rm (p.\,\pageref{classeo_real_vector_bounds})} \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Persistent} {\rm (p.\,\pageref{classeo_persistent_a1})}.
+
+Definition at line 171 of file eo\-Real\-Bounds.h.\index{eoRealNoBounds@{eo\-Real\-No\-Bounds}!printOn@{printOn}}
+\index{printOn@{printOn}!eoRealNoBounds@{eo\-Real\-No\-Bounds}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}virtual void eo\-Real\-No\-Bounds::print\-On (std::ostream \& {\em \_\-os}) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_real_no_bounds_a13}
+
+
+Write object. 
+
+It's called print\-On since it prints the object on a stream. \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-os}]A std::ostream. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Printable} {\rm (p.\,\pageref{classeo_printable_a1})}.
+
+Definition at line 180 of file eo\-Real\-Bounds.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Real\-Bounds.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_real_ux_over.tex b/trunk/paradiseo-eo/doc/latex/classeo_real_ux_over.tex
new file mode 100644
index 000000000..565b24156
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_real_ux_over.tex
@@ -0,0 +1,17 @@
+\section{eo\-Real\-Ux\-Over Class Reference}
+\label{classeo_real_ux_over}\index{eoRealUxOver@{eoRealUxOver}}
+eo\-Real\-Ux\-Over --$>$ Uniform crossover, also termed intermediate crossover  
+
+
+{\tt \#include $<$Tutorial/eo\-Real\-Op.h$>$}
+
+
+
+\subsection{Detailed Description}
+eo\-Real\-Ux\-Over --$>$ Uniform crossover, also termed intermediate crossover 
+
+
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Real\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_real_vector_bounds.eps b/trunk/paradiseo-eo/doc/latex/classeo_real_vector_bounds.eps
new file mode 100644
index 000000000..d6a33a38c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_real_vector_bounds.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 239.521
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.0875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoRealVectorBounds) cw
+(eoRealBaseVectorBounds) cw
+(eoPersistent) cw
+(eoPrintable) cw
+(eoRealVectorNoBounds) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoRealVectorBounds) 0.5 1 box
+ (eoRealBaseVectorBounds) 0 2 box
+ (eoPersistent) 1 2 box
+ (eoPrintable) 1 3 box
+ (eoRealVectorNoBounds) 0.5 0 box
+
+% ----- relations -----
+
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+1 1 3 in
+solid
+1 0.5 0.25 out
+solid
+0 0.5 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_real_vector_bounds.tex b/trunk/paradiseo-eo/doc/latex/classeo_real_vector_bounds.tex
new file mode 100644
index 000000000..cebed385a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_real_vector_bounds.tex
@@ -0,0 +1,115 @@
+\section{eo\-Real\-Vector\-Bounds Class Reference}
+\label{classeo_real_vector_bounds}\index{eoRealVectorBounds@{eoRealVectorBounds}}
+Now a derived class, for parser reading It holds some of the bounds (and destroy them when dying).  
+
+
+{\tt \#include $<$eo\-Real\-Vector\-Bounds.h$>$}
+
+Inheritance diagram for eo\-Real\-Vector\-Bounds::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_real_vector_bounds}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Real\-Vector\-Bounds} ()\label{classeo_real_vector_bounds_a0}
+
+\begin{CompactList}\small\item\em Default Ctor will call base class default ctor. \item\end{CompactList}\item 
+{\bf eo\-Real\-Vector\-Bounds} (unsigned \_\-dim, {\bf eo\-Real\-Bounds} \&\_\-bounds)\label{classeo_real_vector_bounds_a1}
+
+\begin{CompactList}\small\item\em Ctor: same bounds for everybody, given as an {\bf eo\-Real\-Bounds}{\rm (p.\,\pageref{classeo_real_bounds})}. \item\end{CompactList}\item 
+{\bf eo\-Real\-Vector\-Bounds} ({\bf eo\-Real\-Bounds} \&\_\-xbounds, {\bf eo\-Real\-Bounds} \&\_\-ybounds)\label{classeo_real_vector_bounds_a2}
+
+\begin{CompactList}\small\item\em Ctor, particular case of dim-2. \item\end{CompactList}\item 
+{\bf eo\-Real\-Vector\-Bounds} (unsigned \_\-dim, double \_\-min, double \_\-max)\label{classeo_real_vector_bounds_a3}
+
+\begin{CompactList}\small\item\em Simple bounds = minimum and maximum (allowed). \item\end{CompactList}\item 
+{\bf eo\-Real\-Vector\-Bounds} (std::vector$<$ double $>$ \_\-min, std::vector$<$ double $>$ \_\-max)\label{classeo_real_vector_bounds_a4}
+
+\begin{CompactList}\small\item\em Ctor: different bounds for different variables, std::vectors of double. \item\end{CompactList}\item 
+{\bf eo\-Real\-Vector\-Bounds} (std::string \_\-s)\label{classeo_real_vector_bounds_a5}
+
+\begin{CompactList}\small\item\em Ctor from a std::string and don't worry, the {\bf read\-From(std::string)}{\rm (p.\,\pageref{classeo_real_vector_bounds_a8})} starts by setting everything to 0! \item\end{CompactList}\item 
+virtual {\bf $\sim$eo\-Real\-Vector\-Bounds} ()\label{classeo_real_vector_bounds_a6}
+
+\begin{CompactList}\small\item\em Dtor: destroy all owned\-Bounds - BUG ??? \item\end{CompactList}\item 
+virtual void {\bf read\-From} (std::istream \&\_\-is)
+\begin{CompactList}\small\item\em Read object from a stream only calls the {\bf read\-From(std::string)}{\rm (p.\,\pageref{classeo_real_vector_bounds_a8})} - for param reading. \item\end{CompactList}\item 
+virtual void {\bf read\-From} (std::string \_\-s)
+\begin{CompactList}\small\item\em Read object from a std::string. \item\end{CompactList}\item 
+virtual void {\bf print\-On} (std::ostream \&\_\-os) const \label{classeo_real_vector_bounds_a9}
+
+\begin{CompactList}\small\item\em overload print\-On method to save space \item\end{CompactList}\item 
+void {\bf adjust\_\-size} (unsigned \_\-dim)\label{classeo_real_vector_bounds_a10}
+
+\begin{CompactList}\small\item\em Eventually increases the size by duplicating last bound. \item\end{CompactList}\item 
+{\bf eo\-Real\-Vector\-Bounds} (const {\bf eo\-Real\-Vector\-Bounds} \&)\label{classeo_real_vector_bounds_a11}
+
+\begin{CompactList}\small\item\em need to rewrite copy ctor and assignement operator because of owned\-Bounds \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Real\-Vector\-Bounds} \& {\bf operator=} (const {\bf eo\-Real\-Vector\-Bounds} \&)\label{classeo_real_vector_bounds_d0}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+std::vector$<$ unsigned int $>$ {\bf factor}\label{classeo_real_vector_bounds_r0}
+
+\item 
+std::vector$<$ {\bf eo\-Real\-Bounds} $\ast$ $>$ {\bf owned\-Bounds}\label{classeo_real_vector_bounds_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Now a derived class, for parser reading It holds some of the bounds (and destroy them when dying). 
+
+
+
+Definition at line 228 of file eo\-Real\-Vector\-Bounds.h.
+
+\subsection{Member Function Documentation}
+\index{eoRealVectorBounds@{eo\-Real\-Vector\-Bounds}!readFrom@{readFrom}}
+\index{readFrom@{readFrom}!eoRealVectorBounds@{eo\-Real\-Vector\-Bounds}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}void eo\-Real\-Vector\-Bounds::read\-From (std::istream \& {\em \_\-is})\hspace{0.3cm}{\tt  [virtual]}}\label{classeo_real_vector_bounds_a7}
+
+
+Read object from a stream only calls the {\bf read\-From(std::string)}{\rm (p.\,\pageref{classeo_real_vector_bounds_a8})} - for param reading. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-is}]A std::istream. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Persistent} {\rm (p.\,\pageref{classeo_persistent_a1})}.
+
+Definition at line 65 of file eo\-Real\-Bounds.cpp.
+
+Referenced by eo\-Real\-Vector\-Bounds().\index{eoRealVectorBounds@{eo\-Real\-Vector\-Bounds}!readFrom@{readFrom}}
+\index{readFrom@{readFrom}!eoRealVectorBounds@{eo\-Real\-Vector\-Bounds}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}void eo\-Real\-Vector\-Bounds::read\-From (std::string {\em \_\-s})\hspace{0.3cm}{\tt  [virtual]}}\label{classeo_real_vector_bounds_a8}
+
+
+Read object from a std::string. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-is}]A std::istream. \end{description}
+\end{Desc}
+
+
+Definition at line 73 of file eo\-Real\-Bounds.cpp.
+
+References adjust\_\-size().
+
+The documentation for this class was generated from the following files:\begin{CompactItemize}
+\item 
+eo\-Real\-Vector\-Bounds.h\item 
+eo\-Real\-Bounds.cpp\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_real_vector_no_bounds.eps b/trunk/paradiseo-eo/doc/latex/classeo_real_vector_no_bounds.eps
new file mode 100644
index 000000000..85af9e7ae
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_real_vector_no_bounds.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 239.521
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.0875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoRealVectorNoBounds) cw
+(eoRealVectorBounds) cw
+(eoRealBaseVectorBounds) cw
+(eoPersistent) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoRealVectorNoBounds) 0.5 0 box
+ (eoRealVectorBounds) 0.5 1 box
+ (eoRealBaseVectorBounds) 0 2 box
+ (eoPersistent) 1 2 box
+ (eoPrintable) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_real_vector_no_bounds.tex b/trunk/paradiseo-eo/doc/latex/classeo_real_vector_no_bounds.tex
new file mode 100644
index 000000000..781f52ade
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_real_vector_no_bounds.tex
@@ -0,0 +1,87 @@
+\section{eo\-Real\-Vector\-No\-Bounds Class Reference}
+\label{classeo_real_vector_no_bounds}\index{eoRealVectorNoBounds@{eoRealVectorNoBounds}}
+the dummy unbounded {\bf eo\-Real\-Vector\-Bounds}{\rm (p.\,\pageref{classeo_real_vector_bounds})}: usefull if you don't need bounds! everything is inlined.  
+
+
+{\tt \#include $<$eo\-Real\-Vector\-Bounds.h$>$}
+
+Inheritance diagram for eo\-Real\-Vector\-No\-Bounds::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_real_vector_no_bounds}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Real\-Vector\-No\-Bounds} (unsigned \_\-dim)\label{classeo_real_vector_no_bounds_a1}
+
+\begin{CompactList}\small\item\em Ctor: nothing to do, but beware of dimension: call base class ctor. \item\end{CompactList}\item 
+virtual bool {\bf is\-Bounded} (unsigned)\label{classeo_real_vector_no_bounds_a2}
+
+\begin{CompactList}\small\item\em test: is i\_\-th component bounded \item\end{CompactList}\item 
+virtual bool {\bf is\-Bounded} (void)\label{classeo_real_vector_no_bounds_a3}
+
+\begin{CompactList}\small\item\em test: bounded iff all are bounded \item\end{CompactList}\item 
+virtual bool {\bf has\-No\-Bound\-At\-All} (unsigned)\label{classeo_real_vector_no_bounds_a4}
+
+\begin{CompactList}\small\item\em Self-test: true iff i\_\-th component has no bounds at all. \item\end{CompactList}\item 
+virtual bool {\bf has\-No\-Bound\-At\-All} (void)\label{classeo_real_vector_no_bounds_a5}
+
+\begin{CompactList}\small\item\em Self-test: true iff all components have no bound at all. \item\end{CompactList}\item 
+virtual bool {\bf is\-Min\-Bounded} (unsigned)\label{classeo_real_vector_no_bounds_a6}
+
+\item 
+virtual bool {\bf is\-Max\-Bounded} (unsigned)\label{classeo_real_vector_no_bounds_a7}
+
+\item 
+virtual void {\bf folds\-In\-Bounds} (unsigned, double \&)\label{classeo_real_vector_no_bounds_a8}
+
+\begin{CompactList}\small\item\em Folds a real value back into the bounds - i\_\-th component. \item\end{CompactList}\item 
+virtual void {\bf folds\-In\-Bounds} (std::vector$<$ double $>$ \&)\label{classeo_real_vector_no_bounds_a9}
+
+\begin{CompactList}\small\item\em Folds all variables of a std::vector of real values into the bounds. \item\end{CompactList}\item 
+virtual void {\bf truncate} (unsigned, double \&)\label{classeo_real_vector_no_bounds_a10}
+
+\begin{CompactList}\small\item\em Truncates a real value to the bounds - i\_\-th component. \item\end{CompactList}\item 
+virtual void {\bf truncate} (std::vector$<$ double $>$ \&)\label{classeo_real_vector_no_bounds_a11}
+
+\begin{CompactList}\small\item\em truncates all variables of a std::vector of real values to the bounds \item\end{CompactList}\item 
+virtual bool {\bf is\-In\-Bounds} (unsigned, double)\label{classeo_real_vector_no_bounds_a12}
+
+\begin{CompactList}\small\item\em test: is i\_\-th component within the bounds? \item\end{CompactList}\item 
+virtual bool {\bf is\-In\-Bounds} (std::vector$<$ double $>$)\label{classeo_real_vector_no_bounds_a13}
+
+\begin{CompactList}\small\item\em test: are ALL components within the bounds? \item\end{CompactList}\item 
+virtual double {\bf minimum} (unsigned)\label{classeo_real_vector_no_bounds_a14}
+
+\begin{CompactList}\small\item\em Accessors: will raise an std::exception if these do not exist. \item\end{CompactList}\item 
+virtual double {\bf maximum} (unsigned)\label{classeo_real_vector_no_bounds_a15}
+
+\item 
+virtual double {\bf range} (unsigned)\label{classeo_real_vector_no_bounds_a16}
+
+\item 
+virtual double {\bf average\-Range} ()\label{classeo_real_vector_no_bounds_a17}
+
+\begin{CompactList}\small\item\em Computes the average range An std::exception will be raised if one of the component is unbounded. \item\end{CompactList}\item 
+virtual double {\bf uniform} (unsigned, {\bf eo\-Rng} \&\_\-rng=eo::rng)\label{classeo_real_vector_no_bounds_a18}
+
+\begin{CompactList}\small\item\em Generates a random number in i\_\-th range An std::exception will be raised if one of the component is unbounded. \item\end{CompactList}\item 
+void {\bf uniform} (std::vector$<$ double $>$ \&, {\bf eo\-Rng} \&\_\-rng=eo::rng)\label{classeo_real_vector_no_bounds_a19}
+
+\begin{CompactList}\small\item\em fills a std::vector with uniformly chosen variables in bounds An std::exception will be raised if one of the component is unbounded \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+the dummy unbounded {\bf eo\-Real\-Vector\-Bounds}{\rm (p.\,\pageref{classeo_real_vector_bounds})}: usefull if you don't need bounds! everything is inlined. 
+
+Warning: we do need this class, and not only a std::vector$<$eo\-Real\-No\-Bounds $\ast$$>$ 
+
+
+
+Definition at line 352 of file eo\-Real\-Vector\-Bounds.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Real\-Vector\-Bounds.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_reduce.eps b/trunk/paradiseo-eo/doc/latex/classeo_reduce.eps
new file mode 100644
index 000000000..4f2d7b067
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_reduce.eps
@@ -0,0 +1,241 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 35.2734
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 14.175 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 7 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoReduce< EOT >) cw
+(eoBF< eoPop< EOT > &, unsigned, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, unsigned, void >) cw
+(eoDetTournamentTruncate< EOT >) cw
+(eoEPReduce< EOT >) cw
+(eoLinearTruncate< EOT >) cw
+(eoRandomReduce< EOT >) cw
+(eoStochTournamentTruncate< EOT >) cw
+(eoStochTournamentTruncateSplit< EOT >) cw
+(eoTruncate< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoReduce< EOT >) 3 1 box
+ (eoBF< eoPop< EOT > &, unsigned, void >) 3 2 box
+ (eoFunctorBase) 2.5 3 box
+ (binary_function< eoPop< EOT > &, unsigned, void >) 3.5 3 box
+ (eoDetTournamentTruncate< EOT >) 0 0 box
+ (eoEPReduce< EOT >) 1 0 box
+ (eoLinearTruncate< EOT >) 2 0 box
+ (eoRandomReduce< EOT >) 3 0 box
+ (eoStochTournamentTruncate< EOT >) 4 0 box
+ (eoStochTournamentTruncateSplit< EOT >) 5 0 box
+ (eoTruncate< EOT >) 6 0 box
+
+% ----- relations -----
+
+solid
+0 3 1 out
+solid
+1 3 2 in
+solid
+0 3 2 out
+solid
+2.5 3.5 3 conn
+solid
+1 2.5 3 in
+solid
+1 3.5 3 in
+solid
+1 3 0.25 out
+solid
+0 6 1 conn
+solid
+0 0 0.75 in
+solid
+0 1 0.75 in
+solid
+0 2 0.75 in
+solid
+0 3 0.75 in
+solid
+0 4 0.75 in
+solid
+0 5 0.75 in
+solid
+0 6 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_reduce.tex b/trunk/paradiseo-eo/doc/latex/classeo_reduce.tex
new file mode 100644
index 000000000..ad0253f69
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_reduce.tex
@@ -0,0 +1,29 @@
+\section{eo\-Reduce$<$ EOT $>$ Class Template Reference}
+\label{classeo_reduce}\index{eoReduce@{eoReduce}}
+eo\-Reduce: .reduce the new generation to the specified size At the moment, limited to truncation - with 2 different methods, one that sorts the whole population, and one that repeatidely kills the worst.  
+
+
+{\tt \#include $<$eo\-Reduce.h$>$}
+
+Inheritance diagram for eo\-Reduce$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=0.987654cm]{classeo_reduce}
+\end{center}
+\end{figure}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Reduce$<$ EOT $>$}
+
+eo\-Reduce: .reduce the new generation to the specified size At the moment, limited to truncation - with 2 different methods, one that sorts the whole population, and one that repeatidely kills the worst. 
+
+Ideally, we should be able to choose at run-time!!! 
+
+
+
+Definition at line 45 of file eo\-Reduce.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Reduce.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_reduce_merge.eps b/trunk/paradiseo-eo/doc/latex/classeo_reduce_merge.eps
new file mode 100644
index 000000000..9e1b9ff57
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_reduce_merge.eps
@@ -0,0 +1,231 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 89.6057
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.58 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoReduceMerge< EOT >) cw
+(eoReplacement< EOT >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoSSGADetTournamentReplacement< EOT >) cw
+(eoSSGAStochTournamentReplacement< EOT >) cw
+(eoSSGAWorseReplacement< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoReduceMerge< EOT >) 1 1 box
+ (eoReplacement< EOT >) 1 2 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+ (eoFunctorBase) 0.5 4 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 1.5 4 box
+ (eoSSGADetTournamentReplacement< EOT >) 0 0 box
+ (eoSSGAStochTournamentReplacement< EOT >) 1 0 box
+ (eoSSGAWorseReplacement< EOT >) 2 0 box
+
+% ----- relations -----
+
+solid
+0 1 1 out
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+1 1 3 in
+solid
+0 1 3 out
+solid
+0.5 1.5 4 conn
+solid
+1 0.5 4 in
+solid
+1 1.5 4 in
+solid
+1 1 0.25 out
+solid
+0 2 1 conn
+solid
+0 0 0.75 in
+solid
+0 1 0.75 in
+solid
+0 2 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_reduce_merge.tex b/trunk/paradiseo-eo/doc/latex/classeo_reduce_merge.tex
new file mode 100644
index 000000000..7c53e18f0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_reduce_merge.tex
@@ -0,0 +1,49 @@
+\section{eo\-Reduce\-Merge$<$ EOT $>$ Class Template Reference}
+\label{classeo_reduce_merge}\index{eoReduceMerge@{eoReduceMerge}}
+eo\-Reduce\-Merge: Replacement strategies that start by reducing the parents, then merge with the offspring  
+
+
+{\tt \#include $<$eo\-Reduce\-Merge.h$>$}
+
+Inheritance diagram for eo\-Reduce\-Merge$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.50896cm]{classeo_reduce_merge}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Reduce\-Merge} ({\bf eo\-Reduce}$<$ {\bf EOT} $>$ \&\_\-reduce, {\bf eo\-Merge}$<$ {\bf EOT} $>$ \&\_\-merge)\label{classeo_reduce_merge_a0}
+
+\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-parents, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-offspring)\label{classeo_reduce_merge_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Reduce}$<$ {\bf EOT} $>$ \& {\bf reduce}\label{classeo_reduce_merge_r0}
+
+\item 
+{\bf eo\-Merge}$<$ {\bf EOT} $>$ \& {\bf merge}\label{classeo_reduce_merge_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Reduce\-Merge$<$ EOT $>$}
+
+eo\-Reduce\-Merge: Replacement strategies that start by reducing the parents, then merge with the offspring 
+
+This is the way to do SSGA: the offspring gets inserted in the population even if it is worse than anybody else.
+
+: eo\-Reduce\-Merge, {\bf eo\-SSGAWorse\-Replacement}{\rm (p.\,\pageref{classeo_s_s_g_a_worse_replacement})}, {\bf eo\-SSGADet\-Tournament\-Replacement}{\rm (p.\,\pageref{classeo_s_s_g_a_det_tournament_replacement})}, {\bf eo\-SSGAStoch\-Tournament\-Replacement}{\rm (p.\,\pageref{classeo_s_s_g_a_stoch_tournament_replacement})} 
+
+
+
+Definition at line 53 of file eo\-Reduce\-Merge.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Reduce\-Merge.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_reduce_merge_reduce.eps b/trunk/paradiseo-eo/doc/latex/classeo_reduce_merge_reduce.eps
new file mode 100644
index 000000000..338201467
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_reduce_merge_reduce.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 107.527
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.65 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoReduceMergeReduce< EOT >) cw
+(eoReplacement< EOT >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoReduceMergeReduce< EOT >) 0.5 0 box
+ (eoReplacement< EOT >) 0.5 1 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_reduce_merge_reduce.tex b/trunk/paradiseo-eo/doc/latex/classeo_reduce_merge_reduce.tex
new file mode 100644
index 000000000..332271ecf
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_reduce_merge_reduce.tex
@@ -0,0 +1,60 @@
+\section{eo\-Reduce\-Merge\-Reduce$<$ EOT $>$ Class Template Reference}
+\label{classeo_reduce_merge_reduce}\index{eoReduceMergeReduce@{eoReduceMergeReduce}}
+eo\-Reduce\-Merge\-Reduce is an {\bf eo\-Replacement}{\rm (p.\,\pageref{classeo_replacement})}: - saves possible elite parents - reduces rest of parents - reduces offspring - merges reduced populations - reduces resulting merged pop if necessary  
+
+
+{\tt \#include $<$eo\-Reduce\-Merge\-Reduce.h$>$}
+
+Inheritance diagram for eo\-Reduce\-Merge\-Reduce$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.01075cm]{classeo_reduce_merge_reduce}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Reduce\-Merge\-Reduce} ({\bf eo\-How\-Many} \_\-how\-Many\-Elite, bool \_\-strong\-Elitism, {\bf eo\-How\-Many} \_\-how\-Many\-Reduced\-Parents, {\bf eo\-Reduce}$<$ {\bf EOT} $>$ \&\_\-reduce\-Parents, {\bf eo\-How\-Many} \_\-how\-Many\-Reduced\-Offspring, {\bf eo\-Reduce}$<$ {\bf EOT} $>$ \&\_\-reduce\-Offspring, {\bf eo\-Reduce}$<$ {\bf EOT} $>$ \&\_\-reduce\-Final)\label{classeo_reduce_merge_reduce_a0}
+
+\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-parents, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-offspring)\label{classeo_reduce_merge_reduce_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-How\-Many} {\bf how\-Many\-Elite}\label{classeo_reduce_merge_reduce_r0}
+
+\item 
+bool {\bf strong\-Elitism}\label{classeo_reduce_merge_reduce_r1}
+
+\item 
+{\bf eo\-How\-Many} {\bf how\-Many\-Reduced\-Parents}\label{classeo_reduce_merge_reduce_r2}
+
+\item 
+{\bf eo\-How\-Many} {\bf how\-Many\-Reduced\-Offspring}\label{classeo_reduce_merge_reduce_r3}
+
+\item 
+{\bf eo\-Reduce}$<$ {\bf EOT} $>$ \& {\bf reduce\-Parents}\label{classeo_reduce_merge_reduce_r4}
+
+\item 
+{\bf eo\-Reduce}$<$ {\bf EOT} $>$ \& {\bf reduce\-Offspring}\label{classeo_reduce_merge_reduce_r5}
+
+\item 
+{\bf eo\-Reduce}$<$ {\bf EOT} $>$ \& {\bf reduce\-Final}\label{classeo_reduce_merge_reduce_r6}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Reduce\-Merge\-Reduce$<$ EOT $>$}
+
+eo\-Reduce\-Merge\-Reduce is an {\bf eo\-Replacement}{\rm (p.\,\pageref{classeo_replacement})}: - saves possible elite parents - reduces rest of parents - reduces offspring - merges reduced populations - reduces resulting merged pop if necessary 
+
+
+
+Definition at line 49 of file eo\-Reduce\-Merge\-Reduce.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Reduce\-Merge\-Reduce.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_reduce_split.eps b/trunk/paradiseo-eo/doc/latex/classeo_reduce_split.eps
new file mode 100644
index 000000000..b2a72f18d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_reduce_split.eps
@@ -0,0 +1,233 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 43.0108
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 11.625 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 5 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoReduceSplit< EOT >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoDetTournamentTruncateSplit< EOT >) cw
+(eoLinearRandomSplit< EOT >) cw
+(eoLinearTruncateSplit< EOT >) cw
+(eoRandomSplit< EOT >) cw
+(eoTruncateSplit< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoReduceSplit< EOT >) 2 1 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 2 2 box
+ (eoFunctorBase) 1.5 3 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 2.5 3 box
+ (eoDetTournamentTruncateSplit< EOT >) 0 0 box
+ (eoLinearRandomSplit< EOT >) 1 0 box
+ (eoLinearTruncateSplit< EOT >) 2 0 box
+ (eoRandomSplit< EOT >) 3 0 box
+ (eoTruncateSplit< EOT >) 4 0 box
+
+% ----- relations -----
+
+solid
+0 2 1 out
+solid
+1 2 2 in
+solid
+0 2 2 out
+solid
+1.5 2.5 3 conn
+solid
+1 1.5 3 in
+solid
+1 2.5 3 in
+solid
+1 2 0.25 out
+solid
+0 4 1 conn
+solid
+0 0 0.75 in
+solid
+0 1 0.75 in
+solid
+0 2 0.75 in
+solid
+0 3 0.75 in
+solid
+0 4 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_reduce_split.tex b/trunk/paradiseo-eo/doc/latex/classeo_reduce_split.tex
new file mode 100644
index 000000000..339664f94
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_reduce_split.tex
@@ -0,0 +1,27 @@
+\section{eo\-Reduce\-Split$<$ EOT $>$ Class Template Reference}
+\label{classeo_reduce_split}\index{eoReduceSplit@{eoReduceSplit}}
+eo\-Reduce\-Split: reduce the pop to the specified size AND eventually returns the eliminated guys  
+
+
+{\tt \#include $<$eo\-Reduce\-Split.h$>$}
+
+Inheritance diagram for eo\-Reduce\-Split$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=1.2043cm]{classeo_reduce_split}
+\end{center}
+\end{figure}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Reduce\-Split$<$ EOT $>$}
+
+eo\-Reduce\-Split: reduce the pop to the specified size AND eventually returns the eliminated guys 
+
+
+
+Definition at line 42 of file eo\-Reduce\-Split.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Reduce\-Split.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_replacement.eps b/trunk/paradiseo-eo/doc/latex/classeo_replacement.eps
new file mode 100644
index 000000000..527427f13
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_replacement.eps
@@ -0,0 +1,255 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 232.975
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.14615 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 13 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoReplacement< EOT >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoDeterministicSaDReplacement< EOT >) cw
+(eoG3Replacement< EOT >) cw
+(eoGenerationalReplacement< EOT >) cw
+(eoMergeReduce< EOT >) cw
+(eoMGGReplacement< EOT >) cw
+(eoNDPlusReplacement< EOT, WorthT >) cw
+(eoNDPlusReplacement< EOT, WorthT >) cw
+(eoReduceMerge< EOT >) cw
+(eoReduceMergeReduce< EOT >) cw
+(eoWeakElitistReplacement< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoReplacement< EOT >) 0.5 10 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 11 box
+ (eoFunctorBase) 0 12 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 1 12 box
+ (eoDeterministicSaDReplacement< EOT >) 1.5 9 box
+ (eoG3Replacement< EOT >) 1.5 8 box
+ (eoGenerationalReplacement< EOT >) 1.5 7 box
+ (eoMergeReduce< EOT >) 1.5 6 box
+1.5 6 mark
+ (eoMGGReplacement< EOT >) 1.5 5 box
+ (eoNDPlusReplacement< EOT, WorthT >) 1.5 4 box
+ (eoNDPlusReplacement< EOT, WorthT >) 1.5 3 box
+ (eoReduceMerge< EOT >) 1.5 2 box
+1.5 2 mark
+ (eoReduceMergeReduce< EOT >) 1.5 1 box
+ (eoWeakElitistReplacement< EOT >) 1.5 0 box
+
+% ----- relations -----
+
+solid
+0 0.5 10 out
+solid
+1 0.5 11 in
+solid
+0 0.5 11 out
+solid
+0 1 12 conn
+solid
+1 0 12 in
+solid
+1 1 12 in
+solid
+1 0.5 9.25 out
+solid
+0 0.5 9.5 hedge
+solid
+0 0.5 8.5 hedge
+solid
+0 0.5 7.5 hedge
+solid
+0 0.5 6.5 hedge
+solid
+0 0.5 5.5 hedge
+solid
+0 0.5 4.5 hedge
+solid
+0 0.5 3.5 hedge
+solid
+0 0.5 2.5 hedge
+solid
+0 0.5 1.5 hedge
+solid
+0 0.5 0.5 hedge
+solid
+0.5 10 0.5 vedge
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_replacement.tex b/trunk/paradiseo-eo/doc/latex/classeo_replacement.tex
new file mode 100644
index 000000000..bd3a43b5f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_replacement.tex
@@ -0,0 +1,34 @@
+\section{eo\-Replacement$<$ EOT $>$ Class Template Reference}
+\label{classeo_replacement}\index{eoReplacement@{eoReplacement}}
+{\tt \#include $<$eo\-Replacement.h$>$}
+
+Inheritance diagram for eo\-Replacement$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=6.5233cm]{classeo_replacement}
+\end{center}
+\end{figure}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Replacement$<$ EOT $>$}
+
+NOTE: 2 {\bf eo\-Pop}{\rm (p.\,\pageref{classeo_pop})} as arguments the resulting population should be in the first argument (replace parents by offspring)! The second argument can contain any rubbish
+
+--- The {\bf eo\-Merge\-Reduce}{\rm (p.\,\pageref{classeo_merge_reduce})}, combination of {\bf eo\-Merge}{\rm (p.\,\pageref{classeo_merge})} and {\bf eo\-Reduce}{\rm (p.\,\pageref{classeo_reduce})}, can be found in file {\bf eo\-Merge\-Reduce.h}{\rm (p.\,\pageref{eo_merge_reduce_8h})}
+
+The {\bf eo\-Reduce\-Merge\-Reduce}{\rm (p.\,\pageref{classeo_reduce_merge_reduce})} that reduces the parents and the offspring, merges the 2 reduced populations, and eventually reduces that final population, can be found in {\bf eo\-Reduce\-Merge\-Reduce.h}{\rm (p.\,\pageref{eo_reduce_merge_reduce_8h})}
+
+LOG --- Removed the const before first argument: though it makes too many classes with the same interface, it allows to minimize the number of actual copies by choosing the right destination I also removed the enforced \char`\"{}swap\char`\"{} in the eo\-Easy\-Algo and hence the generational replacement gets a class of its own that only does the swap (instead of the eo\-No\-Replacement that did nothing, relying on the algo to swap popualtions). MS 12/12/2000
+
+\begin{Desc}
+\item[See also:]{\bf eo\-Merge}{\rm (p.\,\pageref{classeo_merge})}, {\bf eo\-Reduce}{\rm (p.\,\pageref{classeo_reduce})}, {\bf eo\-Merge\-Reduce}{\rm (p.\,\pageref{classeo_merge_reduce})}, {\bf eo\-Reduce\-Merge}{\rm (p.\,\pageref{classeo_reduce_merge})}\end{Desc}
+eo\-Replacement, base (pure abstract) class {\bf eo\-Generational\-Replacement}{\rm (p.\,\pageref{classeo_generational_replacement})}, as it says ... {\bf eo\-Weak\-Elitist\-Replacement}{\rm (p.\,\pageref{classeo_weak_elitist_replacement})} a wrapper to add elitism 
+
+
+
+Definition at line 77 of file eo\-Replacement.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Replacement.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_rnd_generator.eps b/trunk/paradiseo-eo/doc/latex/classeo_rnd_generator.eps
new file mode 100644
index 000000000..e8f9e9459
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_rnd_generator.eps
@@ -0,0 +1,219 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 160.643
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.1125 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoRndGenerator< T >) cw
+(eoF< T >) cw
+(eoFunctorBase) cw
+(eoNegExpGenerator< T >) cw
+(eoNormalGenerator< T >) cw
+(eoUniformGenerator< T >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoRndGenerator< T >) 1 1 box
+ (eoF< T >) 1 2 box
+ (eoFunctorBase) 1 3 box
+ (eoNegExpGenerator< T >) 0 0 box
+ (eoNormalGenerator< T >) 1 0 box
+ (eoUniformGenerator< T >) 2 0 box
+
+% ----- relations -----
+
+solid
+0 1 1 out
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+1 1 3 in
+solid
+1 1 0.25 out
+solid
+0 2 1 conn
+solid
+0 0 0.75 in
+solid
+0 1 0.75 in
+solid
+0 2 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_rnd_generator.tex b/trunk/paradiseo-eo/doc/latex/classeo_rnd_generator.tex
new file mode 100644
index 000000000..69253fdff
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_rnd_generator.tex
@@ -0,0 +1,37 @@
+\section{eo\-Rnd\-Generator$<$ T $>$ Class Template Reference}
+\label{classeo_rnd_generator}\index{eoRndGenerator@{eoRndGenerator}}
+By popular demand re-introducing a base class for a family of random number generators.  
+
+
+{\tt \#include $<$eo\-Rnd\-Generators.h$>$}
+
+Inheritance diagram for eo\-Rnd\-Generator$<$ T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_rnd_generator}
+\end{center}
+\end{figure}
+\subsection*{Private Types}
+\begin{CompactItemize}
+\item 
+typedef T {\bf Atom\-Type}\label{classeo_rnd_generator_y0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class T$>$ class eo\-Rnd\-Generator$<$ T $>$}
+
+By popular demand re-introducing a base class for a family of random number generators. 
+
+Derived members of this class are useful to initialize fixed/variable length genotypes that have an 'atomic' type in an indepent way (thus without employing any knowledge about the problem domain).
+
+See derived classes {\bf eo\-Uniform\-Generator}{\rm (p.\,\pageref{classeo_uniform_generator})}, {\bf eo\-Boolean\-Generator}{\rm (p.\,\pageref{classeo_boolean_generator})}, {\bf eo\-Normal\-Generator}{\rm (p.\,\pageref{classeo_normal_generator})} and {\bf eo\-Neg\-Exp\-Generator}{\rm (p.\,\pageref{classeo_neg_exp_generator})} 
+
+
+
+Definition at line 47 of file eo\-Rnd\-Generators.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Rnd\-Generators.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_rng.eps b/trunk/paradiseo-eo/doc/latex/classeo_rng.eps
new file mode 100644
index 000000000..1add06def
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_rng.eps
@@ -0,0 +1,209 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 337.079
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.48333 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 3 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoRng) cw
+(eoObject) cw
+(eoPersistent) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoRng) 0.5 0 box
+ (eoObject) 0 1 box
+ (eoPersistent) 1 1 box
+ (eoPrintable) 1 2 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+0 1 1 conn
+solid
+1 0 1 in
+solid
+1 1 1 in
+solid
+0 1 1 out
+solid
+1 1 2 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_rng.tex b/trunk/paradiseo-eo/doc/latex/classeo_rng.tex
new file mode 100644
index 000000000..f7e0b75ac
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_rng.tex
@@ -0,0 +1,304 @@
+\section{eo\-Rng Class Reference}
+\label{classeo_rng}\index{eoRng@{eoRng}}
+Random Number Generator.  
+
+
+{\tt \#include $<$utils/eo\-RNG.h$>$}
+
+Inheritance diagram for eo\-Rng::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3cm]{classeo_rng}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Rng} (uint32\_\-t s)
+\begin{CompactList}\small\item\em Constructor. \item\end{CompactList}\item 
+void {\bf reseed} (uint32\_\-t s)
+\begin{CompactList}\small\item\em Re-initializes the Random Number Generator. \item\end{CompactList}\item 
+void {\bf old\-Reseed} (uint32\_\-t s)
+\begin{CompactList}\small\item\em Re-initializes the Random Number Generator. \item\end{CompactList}\item 
+double {\bf uniform} (double m=1.0)\label{classeo_rng_a4}
+
+\begin{CompactList}\small\item\em uniform(m = 1.0) returns a random double in the range [0, m) \item\end{CompactList}\item 
+uint32\_\-t {\bf random} (uint32\_\-t m)\label{classeo_rng_a5}
+
+\begin{CompactList}\small\item\em {\bf random()}{\rm (p.\,\pageref{classeo_rng_a5})} returns a random integer in the range [0, m) \item\end{CompactList}\item 
+bool {\bf flip} (float bias=0.5)\label{classeo_rng_a6}
+
+\begin{CompactList}\small\item\em {\bf flip()}{\rm (p.\,\pageref{classeo_rng_a6})} tosses a biased coin such that flip(x/100.0) will returns true x\% of the time \item\end{CompactList}\item 
+double {\bf normal} (void)\label{classeo_rng_a7}
+
+\begin{CompactList}\small\item\em {\bf normal()}{\rm (p.\,\pageref{classeo_rng_a7})} zero mean gaussian deviate with standard deviation of 1 \item\end{CompactList}\item 
+double {\bf normal} (double stdev)\label{classeo_rng_a8}
+
+\begin{CompactList}\small\item\em normal(stdev) zero mean gaussian deviate with user defined standard deviation \item\end{CompactList}\item 
+double {\bf normal} (double mean, double stdev)\label{classeo_rng_a9}
+
+\begin{CompactList}\small\item\em normal(mean, stdev) user defined mean gaussian deviate with user defined standard deviation \item\end{CompactList}\item 
+double {\bf negexp} (double mean)\label{classeo_rng_a10}
+
+\begin{CompactList}\small\item\em Generates random numbers using a negative exponential distribution. \item\end{CompactList}\item 
+uint32\_\-t {\bf rand} ()\label{classeo_rng_a11}
+
+\begin{CompactList}\small\item\em {\bf rand()}{\rm (p.\,\pageref{classeo_rng_a11})} returns a random number in the range [0, rand\_\-max) \item\end{CompactList}\item 
+uint32\_\-t {\bf rand\_\-max} (void) const \label{classeo_rng_a12}
+
+\begin{CompactList}\small\item\em {\bf rand\_\-max()}{\rm (p.\,\pageref{classeo_rng_a12})} the maximum returned by {\bf rand()}{\rm (p.\,\pageref{classeo_rng_a11})} \item\end{CompactList}\item 
+template$<$typename TYPE$>$ int {\bf roulette\_\-wheel} (const std::vector$<$ TYPE $>$ \&vec, TYPE total=0)
+\begin{CompactList}\small\item\em roulette\_\-wheel(vec, total = 0) does a roulette wheel selection on the input std::vector vec. \item\end{CompactList}\item 
+template$<$typename TYPE$>$ const TYPE \& {\bf choice} (const std::vector$<$ TYPE $>$ \&vec) const 
+\begin{CompactList}\small\item\em Randomly select element from vector. \item\end{CompactList}\item 
+template$<$typename TYPE$>$ TYPE \& {\bf choice} (std::vector$<$ TYPE $>$ \&vec)
+\begin{CompactList}\small\item\em Randomly select element from vector. \item\end{CompactList}\item 
+void {\bf print\-On} (std::ostream \&\_\-os) const 
+\begin{CompactList}\small\item\em Write object. \item\end{CompactList}\item 
+void {\bf read\-From} (std::istream \&\_\-is)
+\begin{CompactList}\small\item\em Read object. \item\end{CompactList}\item 
+std::string {\bf class\-Name} (void) const 
+\begin{CompactList}\small\item\em Return the class id. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Member Functions}
+\begin{CompactItemize}
+\item 
+uint32\_\-t {\bf restart} (void)\label{classeo_rng_d0}
+
+\item 
+void {\bf initialize} (uint32\_\-t seed)\label{classeo_rng_d1}
+
+\item 
+{\bf eo\-Rng} (const {\bf eo\-Rng} \&)
+\begin{CompactList}\small\item\em Copy constructor. \item\end{CompactList}\item 
+{\bf eo\-Rng} \& {\bf operator=} (const {\bf eo\-Rng} \&)
+\begin{CompactList}\small\item\em Assignmant operator. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+uint32\_\-t $\ast$ {\bf state}\label{classeo_rng_r0}
+
+\begin{CompactList}\small\item\em Array for the state. \item\end{CompactList}\item 
+uint32\_\-t $\ast$ {\bf next}\label{classeo_rng_r1}
+
+\item 
+int {\bf left}\label{classeo_rng_r2}
+
+\item 
+bool {\bf cached}\label{classeo_rng_r3}
+
+\item 
+float {\bf cache\-Value}\label{classeo_rng_r4}
+
+\item 
+const int {\bf N}\label{classeo_rng_r5}
+
+\item 
+const int {\bf M}\label{classeo_rng_r6}
+
+\item 
+const uint32\_\-t {\bf K}\label{classeo_rng_r7}
+
+\begin{CompactList}\small\item\em Magic constant. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Random Number Generator. 
+
+eo\-Rng is a persistent class that uses the ``Mersenne Twister'' random number generator MT19937 for generating random numbers. The various member functions implement useful functions for evolutionary algorithms. Included are: {\bf rand()}{\rm (p.\,\pageref{classeo_rng_a11})}, {\bf random()}{\rm (p.\,\pageref{classeo_rng_a5})}, {\bf flip()}{\rm (p.\,\pageref{classeo_rng_a6})} and {\bf normal()}{\rm (p.\,\pageref{classeo_rng_a7})}.
+
+{\bf EO}{\rm (p.\,\pageref{class_e_o})} provides a global random number generator {\tt rng} that is seeded by the current UNIX time at program start. Moreover some global convenience functions are provided that use the global random number generator: {\tt random}, {\tt normal}.
+
+\begin{Desc}
+\item[Warning:]If you want to repeatedly generated the same sequence of pseudo-random numbers, you should always reseed the generator at the beginning of your code.\end{Desc}
+\subsection*{Documentation in original file}
+
+This is the ``Mersenne Twister'' random number generator MT19937, which generates pseudorandom integers uniformly distributed in 0..(2$^\wedge$32 - 1) starting from any odd seed in 0..(2$^\wedge$32 - 1). This version is a recode by Shawn Cokus ({\tt Cokus@math.washington.edu}) on March 8, 1998 of a version by Takuji Nishimura (who had suggestions from Topher Cooper and Marc Rieffel in July-August 1997).
+
+Effectiveness of the recoding (on Goedel2.math.washington.edu, a DEC Alpha running OSF/1) using GCC -O3 as a compiler: before recoding: 51.6 sec. to generate 300 million random numbers; after recoding: 24.0 sec. for the same (i.e., 46.5\% of original time), so speed is now about 12.5 million random number generations per second on this machine.
+
+According to the URL $<${\tt http://www.math.keio.ac.jp/$\sim$matumoto/emt.html}$>$ (and paraphrasing a bit in places), the Mersenne Twister is ``designed with consideration of the flaws of various existing generators,'' has a period of 2$^\wedge$19937 - 1, gives a sequence that is 623-dimensionally equidistributed, and ``has passed many std::stringent tests, including the die-hard test of G. Marsaglia and the load test of P. Hellekalek and S. Wegenkittl.'' It is efficient in memory usage (typically using 2506 to 5012 bytes of static data, depending on data type sizes, and the code is quite short as well). It generates random numbers in batches of 624 at a time, so the caching and pipelining of modern systems is exploited. It is also divide- and mod-free.
+
+The code as Shawn received it included the following notice: {\tt Copyright (C) 1997 Makoto Matsumoto and Takuji Nishimura. When you use this, send an e-mail to $<${\tt matumoto@math.keio.ac.jp}$>$ with an appropriate reference to your work.} It would be nice to Cc: $<${\tt Cokus@math.washington.edu}$>$ and $<${\tt eodev-main@lists.sourceforge.net}$>$ when you write.
+
+\subsection*{Portability}
+
+Note for people porting {\bf EO}{\rm (p.\,\pageref{class_e_o})} to other platforms: please make sure that the type uint32\_\-t in the file {\bf eo\-Rng.h}{\rm (p.\,\pageref{eo_r_n_g_8h})} is exactly 32 bits long. It may in principle be longer, but not shorter. If it is longer, file compatibility between {\bf EO}{\rm (p.\,\pageref{class_e_o})} on different platforms may be broken. 
+
+
+
+Definition at line 103 of file eo\-RNG.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoRng@{eo\-Rng}!eoRng@{eoRng}}
+\index{eoRng@{eoRng}!eoRng@{eo\-Rng}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}eo\-Rng::eo\-Rng (uint32\_\-t {\em s})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_rng_a0}
+
+
+Constructor. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em s}]Random seed; if you want another seed, use reseed.\end{description}
+\end{Desc}
+\begin{Desc}
+\item[See also:]{\bf reseed}{\rm (p.\,\pageref{classeo_rng_a2})} for details on usage of the seeding value. \end{Desc}
+
+
+Definition at line 113 of file eo\-RNG.h.
+
+References K, and state.\index{eoRng@{eo\-Rng}!eoRng@{eoRng}}
+\index{eoRng@{eoRng}!eoRng@{eo\-Rng}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}eo\-Rng::eo\-Rng (const {\bf eo\-Rng} \&)\hspace{0.3cm}{\tt  [private]}}\label{classeo_rng_d2}
+
+
+Copy constructor. 
+
+Private copy ctor and assignment operator to make sure that nobody accidentally copies the random number generator. If you want similar RNG's, make two RNG's and initialize them with the same seed.
+
+As it cannot be called, we do not provide an implementation. 
+
+\subsection{Member Function Documentation}
+\index{eoRng@{eo\-Rng}!reseed@{reseed}}
+\index{reseed@{reseed}!eoRng@{eo\-Rng}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}void eo\-Rng::reseed (uint32\_\-t {\em s})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_rng_a2}
+
+
+Re-initializes the Random Number Generator. 
+
+WARNING: Jeroen Eggermont $<${\tt jeggermo@liacs.nl}$>$ noticed that initialize does not differentiate between odd and even numbers, therefore the argument to reseed is now doubled before being passed on.
+
+Manually divide the seed by 2 if you want to re-run old runs
+
+\begin{Desc}
+\item[Version:]MS. 5 Oct. 2001 \end{Desc}
+
+
+Definition at line 135 of file eo\-RNG.h.\index{eoRng@{eo\-Rng}!oldReseed@{oldReseed}}
+\index{oldReseed@{oldReseed}!eoRng@{eo\-Rng}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}void eo\-Rng::old\-Reseed (uint32\_\-t {\em s})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_rng_a3}
+
+
+Re-initializes the Random Number Generator. 
+
+This is the traditional seeding procedure. This version is deprecated and only provided for compatibility with old code. In new projects you should use reseed.
+
+\begin{Desc}
+\item[See also:]{\bf reseed}{\rm (p.\,\pageref{classeo_rng_a2})} for details on usage of the seeding value.\end{Desc}
+\begin{Desc}
+\item[Version:]old version (deprecated) \end{Desc}
+
+
+Definition at line 150 of file eo\-RNG.h.\index{eoRng@{eo\-Rng}!roulette_wheel@{roulette\_\-wheel}}
+\index{roulette_wheel@{roulette\_\-wheel}!eoRng@{eo\-Rng}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$typename TYPE$>$ int eo\-Rng::roulette\_\-wheel (const std::vector$<$ TYPE $>$ \& {\em vec}, TYPE {\em total} = {\tt 0})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_rng_a13}
+
+
+roulette\_\-wheel(vec, total = 0) does a roulette wheel selection on the input std::vector vec. 
+
+If the total is not supplied, it is calculated. It returns an integer denoting the selected argument. 
+
+Definition at line 225 of file eo\-RNG.h.
+
+References uniform().
+
+Referenced by eo\-Prop\-Combined\-Quad\-Op$<$ EOT $>$::operator()(), eo\-Prop\-Combined\-Bin\-Op$<$ EOT $>$::operator()(), eo\-Prop\-Combined\-Mon\-Op$<$ EOT $>$::operator()(), and eo\-Combined\-Init$<$ EOT $>$::operator()().\index{eoRng@{eo\-Rng}!choice@{choice}}
+\index{choice@{choice}!eoRng@{eo\-Rng}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$typename TYPE$>$ const TYPE\& eo\-Rng::choice (const std::vector$<$ TYPE $>$ \& {\em vec}) const\hspace{0.3cm}{\tt  [inline]}}\label{classeo_rng_a14}
+
+
+Randomly select element from vector. 
+
+\begin{Desc}
+\item[Returns:]Uniformly chosen element from the vector. \end{Desc}
+
+
+Definition at line 247 of file eo\-RNG.h.
+
+References random().\index{eoRng@{eo\-Rng}!choice@{choice}}
+\index{choice@{choice}!eoRng@{eo\-Rng}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$typename TYPE$>$ TYPE\& eo\-Rng::choice (std::vector$<$ TYPE $>$ \& {\em vec})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_rng_a15}
+
+
+Randomly select element from vector. 
+
+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
+
+Provide a version returning a non-const element reference.
+
+\begin{Desc}
+\item[Returns:]Uniformly chosen element from the vector.\end{Desc}
+\begin{Desc}
+\item[Warning:]Changing the return value does alter the vector. \end{Desc}
+
+
+Definition at line 262 of file eo\-RNG.h.
+
+References random().\index{eoRng@{eo\-Rng}!printOn@{printOn}}
+\index{printOn@{printOn}!eoRng@{eo\-Rng}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}void eo\-Rng::print\-On (std::ostream \& {\em \_\-os}) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_rng_a16}
+
+
+Write object. 
+
+It's called print\-On since it prints the object on a stream. \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-os}]A std::ostream. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Printable} {\rm (p.\,\pageref{classeo_printable_a1})}.
+
+Definition at line 266 of file eo\-RNG.h.
+
+References state.\index{eoRng@{eo\-Rng}!readFrom@{readFrom}}
+\index{readFrom@{readFrom}!eoRng@{eo\-Rng}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}void eo\-Rng::read\-From (std::istream \& {\em \_\-is})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_rng_a17}
+
+
+Read object. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-is}]A std::istream. \end{description}
+\end{Desc}
+\begin{Desc}
+\item[Exceptions:]
+\begin{description}
+\item[{\em runtime\_\-std::exception}]If a valid object can't be read. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-Persistent} {\rm (p.\,\pageref{classeo_persistent_a1})}.
+
+Definition at line 277 of file eo\-RNG.h.
+
+References state.\index{eoRng@{eo\-Rng}!className@{className}}
+\index{className@{className}!eoRng@{eo\-Rng}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}std::string eo\-Rng::class\-Name (void) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_rng_a18}
+
+
+Return the class id. 
+
+This should be redefined in each class. Only \char`\"{}leaf\char`\"{} classes can be non-virtual.
+
+Maarten: removed the default implementation as this proved to be too error-prone: I found several classes that had a typo in class\-Name (like classname), which would print {\bf eo\-Object}{\rm (p.\,\pageref{classeo_object})} instead of their own. Having it pure will force the implementor to provide a name. 
+
+Implements {\bf eo\-Object} {\rm (p.\,\pageref{classeo_object_a1})}.
+
+Definition at line 293 of file eo\-RNG.h.\index{eoRng@{eo\-Rng}!operator=@{operator=}}
+\index{operator=@{operator=}!eoRng@{eo\-Rng}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}{\bf eo\-Rng}\& eo\-Rng::operator= (const {\bf eo\-Rng} \&)\hspace{0.3cm}{\tt  [private]}}\label{classeo_rng_d3}
+
+
+Assignmant operator. 
+
+\begin{Desc}
+\item[See also:]Copy constructor {\bf eo\-Rng(const eo\-Rng\&)}{\rm (p.\,\pageref{classeo_rng_d2})}. \end{Desc}
+
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-RNG.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_roulette_worth_select.eps b/trunk/paradiseo-eo/doc/latex/classeo_roulette_worth_select.eps
new file mode 100644
index 000000000..33261a077
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_roulette_worth_select.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 144.509
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.46 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoRouletteWorthSelect< EOT, WorthT >) cw
+(eoSelectFromWorth< EOT, WorthT >) cw
+(eoSelectOne< EOT >) cw
+(eoUF< const eoPop< EOT > &, const EOT & >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, const EOT & >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoRouletteWorthSelect< EOT, WorthT >) 0.5 0 box
+ (eoSelectFromWorth< EOT, WorthT >) 0.5 1 box
+ (eoSelectOne< EOT >) 0.5 2 box
+ (eoUF< const eoPop< EOT > &, const EOT & >) 0.5 3 box
+ (eoFunctorBase) 0 4 box
+ (unary_function< const eoPop< EOT > &, const EOT & >) 1 4 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+1 0.5 3 in
+solid
+0 0.5 3 out
+solid
+0 1 4 conn
+solid
+1 0 4 in
+solid
+1 1 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_roulette_worth_select.tex b/trunk/paradiseo-eo/doc/latex/classeo_roulette_worth_select.tex
new file mode 100644
index 000000000..805bf7352
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_roulette_worth_select.tex
@@ -0,0 +1,53 @@
+\section{eo\-Roulette\-Worth\-Select$<$ EOT, Worth\-T $>$ Class Template Reference}
+\label{classeo_roulette_worth_select}\index{eoRouletteWorthSelect@{eoRouletteWorthSelect}}
+An instance of eo\-Select\-Perf2Worth that does selection from the Worthes using a ...  
+
+
+{\tt \#include $<$eo\-Select\-From\-Worth.h$>$}
+
+Inheritance diagram for eo\-Roulette\-Worth\-Select$<$ EOT, Worth\-T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4.04624cm]{classeo_roulette_worth_select}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef std::vector$<$ Worth\-T $>$::iterator {\bf worth\-Iterator}\label{classeo_roulette_worth_select_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Roulette\-Worth\-Select} ({\bf eo\-Perf2Worth}$<$ {\bf EOT}, Worth\-T $>$ \&\_\-perf2Worth)\label{classeo_roulette_worth_select_a0}
+
+\item 
+virtual void {\bf setup} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_roulette_worth_select_a1}
+
+\begin{CompactList}\small\item\em virtual function to setup some population stats (for instance eo\-Proportional can benefit greatly from this) \item\end{CompactList}\item 
+virtual const {\bf EOT} \& {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_roulette_worth_select_a2}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf total}\label{classeo_roulette_worth_select_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT, class Worth\-T = double$>$ class eo\-Roulette\-Worth\-Select$<$ EOT, Worth\-T $>$}
+
+An instance of eo\-Select\-Perf2Worth that does selection from the Worthes using a ... 
+
+roulette wheel selection, yes! 
+
+
+
+Definition at line 167 of file eo\-Select\-From\-Worth.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Select\-From\-Worth.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_s_g_a.eps b/trunk/paradiseo-eo/doc/latex/classeo_s_g_a.eps
new file mode 100644
index 000000000..ee100e94e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_s_g_a.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 153.257
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.2625 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSGA< EOT >) cw
+(eoAlgo< EOT >) cw
+(eoUF< eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSGA< EOT >) 0.5 0 box
+ (eoAlgo< EOT >) 0.5 1 box
+ (eoUF< eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_s_g_a.tex b/trunk/paradiseo-eo/doc/latex/classeo_s_g_a.tex
new file mode 100644
index 000000000..811eccdd9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_s_g_a.tex
@@ -0,0 +1,62 @@
+\section{eo\-SGA$<$ EOT $>$ Class Template Reference}
+\label{classeo_s_g_a}\index{eoSGA@{eoSGA}}
+The Simple Genetic Algorithm, following Holland and Goldberg.  
+
+
+{\tt \#include $<$eo\-SGA.h$>$}
+
+Inheritance diagram for eo\-SGA$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_s_g_a}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-SGA} ({\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \&\_\-select, {\bf eo\-Quad\-Op}$<$ {\bf EOT} $>$ \&\_\-cross, float \_\-crate, {\bf eo\-Mon\-Op}$<$ {\bf EOT} $>$ \&\_\-mutate, float \_\-mrate, {\bf eo\-Eval\-Func}$<$ {\bf EOT} $>$ \&\_\-eval, {\bf eo\-Continue}$<$ {\bf EOT} $>$ \&\_\-cont)\label{classeo_s_g_a_a0}
+
+\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_s_g_a_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Continue}$<$ {\bf EOT} $>$ \& {\bf cont}\label{classeo_s_g_a_r0}
+
+\item 
+{\bf eo\-Invalidate\-Mon\-Op}$<$ {\bf EOT} $>$ {\bf mutate}\label{classeo_s_g_a_r1}
+
+\begin{CompactList}\small\item\em {\bf eo\-Invalidate\-Mon\-Op}{\rm (p.\,\pageref{classeo_invalidate_mon_op})} invalidates the embedded operator \item\end{CompactList}\item 
+float {\bf mutation\-Rate}\label{classeo_s_g_a_r2}
+
+\item 
+{\bf eo\-Invalidate\-Quad\-Op}$<$ {\bf EOT} $>$ {\bf cross}\label{classeo_s_g_a_r3}
+
+\item 
+float {\bf crossover\-Rate}\label{classeo_s_g_a_r4}
+
+\item 
+{\bf eo\-Select\-Perc}$<$ {\bf EOT} $>$ {\bf select}\label{classeo_s_g_a_r5}
+
+\item 
+{\bf eo\-Eval\-Func}$<$ {\bf EOT} $>$ \& {\bf eval}\label{classeo_s_g_a_r6}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-SGA$<$ EOT $>$}
+
+The Simple Genetic Algorithm, following Holland and Goldberg. 
+
+Needs a selector (class {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})}) a crossover (eo\-Quad, i.e. a 2-$>$2 operator) and a mutation with their respective rates, of course an evaluation function ({\bf eo\-Eval\-Func}{\rm (p.\,\pageref{classeo_eval_func})}) and a continuator ({\bf eo\-Continue}{\rm (p.\,\pageref{classeo_continue})}) which gives the stopping criterion. Performs full generational replacement. 
+
+
+
+Definition at line 49 of file eo\-SGA.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-SGA.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_s_g_a_gen_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_s_g_a_gen_op.eps
new file mode 100644
index 000000000..9507d2177
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_s_g_a_gen_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 91.0125
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.49375 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSGAGenOp< EOT >) cw
+(eoGenOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoUF< eoPopulator< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< eoPopulator< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSGAGenOp< EOT >) 0.5 0 box
+ (eoGenOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoUF< eoPopulator< EOT > &, void >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< eoPopulator< EOT > &, void >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_s_g_a_gen_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_s_g_a_gen_op.tex
new file mode 100644
index 000000000..70ce55541
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_s_g_a_gen_op.tex
@@ -0,0 +1,68 @@
+\section{eo\-SGAGen\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_s_g_a_gen_op}\index{eoSGAGenOp@{eoSGAGenOp}}
+$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$ eo\-SGAGen\-Op (for Simple GA) mimicks the usual crossover with proba p\-Cross + mutation with proba p\-Mut inside an eo\-General\-Op It does it exactly as class {\bf eo\-SGATransform}{\rm (p.\,\pageref{classeo_s_g_a_transform})}, i.e.  
+
+
+{\tt \#include $<$eo\-SGAGen\-Op.h$>$}
+
+Inheritance diagram for eo\-SGAGen\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.54835cm]{classeo_s_g_a_gen_op}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-SGAGen\-Op} ({\bf eo\-Quad\-Op}$<$ {\bf EOT} $>$ \&\_\-cross, double \_\-p\-Cross, {\bf eo\-Mon\-Op}$<$ {\bf EOT} $>$ \&\_\-mut, double \_\-p\-Mut)\label{classeo_s_g_a_gen_op_a0}
+
+\begin{CompactList}\small\item\em Ctor from crossover (with proba) and mutation (with proba) Builds the sequential op that first applies a proportional choice between the crossover and nothing (cloning), then the mutation. \item\end{CompactList}\item 
+virtual void {\bf apply} ({\bf eo\-Populator}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_s_g_a_gen_op_a1}
+
+\begin{CompactList}\small\item\em do the job: delegate to op \item\end{CompactList}\item 
+virtual unsigned {\bf max\_\-production} (void)\label{classeo_s_g_a_gen_op_a2}
+
+\begin{CompactList}\small\item\em inherited from {\bf eo\-Gen\-Op}{\rm (p.\,\pageref{classeo_gen_op})} \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_s_g_a_gen_op_a3}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Quad\-Op}$<$ {\bf EOT} $>$ \& {\bf cross}\label{classeo_s_g_a_gen_op_r0}
+
+\item 
+double {\bf p\-Cross}\label{classeo_s_g_a_gen_op_r1}
+
+\item 
+{\bf eo\-Mon\-Op}$<$ {\bf EOT} $>$ \& {\bf mut}\label{classeo_s_g_a_gen_op_r2}
+
+\item 
+double {\bf p\-Mut}\label{classeo_s_g_a_gen_op_r3}
+
+\item 
+{\bf eo\-Proportional\-Op}$<$ {\bf EOT} $>$ {\bf prop\-Op}\label{classeo_s_g_a_gen_op_r4}
+
+\item 
+{\bf eo\-Quad\-Clone\-Op}$<$ {\bf EOT} $>$ {\bf quad\-Clone}\label{classeo_s_g_a_gen_op_r5}
+
+\item 
+{\bf eo\-Sequential\-Op}$<$ {\bf EOT} $>$ {\bf op}\label{classeo_s_g_a_gen_op_r6}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-SGAGen\-Op$<$ EOT $>$}
+
+$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$$\ast$ eo\-SGAGen\-Op (for Simple GA) mimicks the usual crossover with proba p\-Cross + mutation with proba p\-Mut inside an eo\-General\-Op It does it exactly as class {\bf eo\-SGATransform}{\rm (p.\,\pageref{classeo_s_g_a_transform})}, i.e. 
+
+only accepts quadratic crossover and unary mutation It was introduced for didactic reasons, but seems to be popular :-) 
+
+
+
+Definition at line 44 of file eo\-SGAGen\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-SGAGen\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_s_g_a_transform.eps b/trunk/paradiseo-eo/doc/latex/classeo_s_g_a_transform.eps
new file mode 100644
index 000000000..a3d04bef7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_s_g_a_transform.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 153.257
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.2625 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSGATransform< EOT >) cw
+(eoTransform< EOT >) cw
+(eoUF< eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSGATransform< EOT >) 0.5 0 box
+ (eoTransform< EOT >) 0.5 1 box
+ (eoUF< eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_s_g_a_transform.tex b/trunk/paradiseo-eo/doc/latex/classeo_s_g_a_transform.tex
new file mode 100644
index 000000000..ee2b55f46
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_s_g_a_transform.tex
@@ -0,0 +1,73 @@
+\section{eo\-SGATransform$<$ EOT $>$ Class Template Reference}
+\label{classeo_s_g_a_transform}\index{eoSGATransform@{eoSGATransform}}
+eo\-SGATransform: transforms a population using genetic operators.  
+
+
+{\tt \#include $<$eo\-SGATransform.h$>$}
+
+Inheritance diagram for eo\-SGATransform$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_s_g_a_transform}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-SGATransform} ({\bf eo\-Quad\-Op}$<$ {\bf EOT} $>$ \&\_\-cross, double \_\-c\-Proba, {\bf eo\-Mon\-Op}$<$ {\bf EOT} $>$ \&\_\-mutate, double \_\-m\-Proba)\label{classeo_s_g_a_transform_a0}
+
+\begin{CompactList}\small\item\em Default constructor. \item\end{CompactList}\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)
+\begin{CompactList}\small\item\em Transforms a population. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Invalidate\-Quad\-Op}$<$ {\bf EOT} $>$ {\bf cross}\label{classeo_s_g_a_transform_r0}
+
+\item 
+double {\bf crossover\-Proba}\label{classeo_s_g_a_transform_r1}
+
+\item 
+{\bf eo\-Invalidate\-Mon\-Op}$<$ {\bf EOT} $>$ {\bf mutate}\label{classeo_s_g_a_transform_r2}
+
+\item 
+double {\bf mutation\-Proba}\label{classeo_s_g_a_transform_r3}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-SGATransform$<$ EOT $>$}
+
+eo\-SGATransform: transforms a population using genetic operators. 
+
+It does it exactly as class {\bf eo\-SGA}{\rm (p.\,\pageref{classeo_s_g_a})}, i.e. only accepts quadratic crossover and unary mutation It is here mainly for tutorial reasons 
+
+
+
+Definition at line 45 of file eo\-SGATransform.h.
+
+\subsection{Member Function Documentation}
+\index{eoSGATransform@{eo\-SGATransform}!operator()@{operator()}}
+\index{operator()@{operator()}!eoSGATransform@{eo\-SGATransform}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ void {\bf eo\-SGATransform}$<$ {\bf EOT} $>$::operator() ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\em \_\-pop})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_s_g_a_transform_a1}
+
+
+Transforms a population. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em pop}]The population to be transformed. \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-UF$<$ eo\-Pop$<$ EOT $>$ \&, void $>$} {\rm (p.\,\pageref{classeo_u_f_a1})}.
+
+Definition at line 62 of file eo\-SGATransform.h.
+
+References eo\-Rng::flip().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-SGATransform.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_s_s_g_a_det_tournament_replacement.eps b/trunk/paradiseo-eo/doc/latex/classeo_s_s_g_a_det_tournament_replacement.eps
new file mode 100644
index 000000000..465d6227b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_s_s_g_a_det_tournament_replacement.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 134.409
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.72 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSSGADetTournamentReplacement< EOT >) cw
+(eoReduceMerge< EOT >) cw
+(eoReplacement< EOT >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSSGADetTournamentReplacement< EOT >) 0.5 0 box
+ (eoReduceMerge< EOT >) 0.5 1 box
+ (eoReplacement< EOT >) 0.5 2 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 3 box
+ (eoFunctorBase) 0 4 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 1 4 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+1 0.5 3 in
+solid
+0 0.5 3 out
+solid
+0 1 4 conn
+solid
+1 0 4 in
+solid
+1 1 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_s_s_g_a_det_tournament_replacement.tex b/trunk/paradiseo-eo/doc/latex/classeo_s_s_g_a_det_tournament_replacement.tex
new file mode 100644
index 000000000..85dbdf0ac
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_s_s_g_a_det_tournament_replacement.tex
@@ -0,0 +1,44 @@
+\section{eo\-SSGADet\-Tournament\-Replacement$<$ EOT $>$ Class Template Reference}
+\label{classeo_s_s_g_a_det_tournament_replacement}\index{eoSSGADetTournamentReplacement@{eoSSGADetTournamentReplacement}}
+SSGA deterministic tournament replacement.  
+
+
+{\tt \#include $<$eo\-Reduce\-Merge.h$>$}
+
+Inheritance diagram for eo\-SSGADet\-Tournament\-Replacement$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.76344cm]{classeo_s_s_g_a_det_tournament_replacement}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-SSGADet\-Tournament\-Replacement} (unsigned \_\-t\_\-size)\label{classeo_s_s_g_a_det_tournament_replacement_a0}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Det\-Tournament\-Truncate}$<$ {\bf EOT} $>$ {\bf truncate}\label{classeo_s_s_g_a_det_tournament_replacement_r0}
+
+\item 
+{\bf eo\-Plus}$<$ {\bf EOT} $>$ {\bf plus}\label{classeo_s_s_g_a_det_tournament_replacement_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-SSGADet\-Tournament\-Replacement$<$ EOT $>$}
+
+SSGA deterministic tournament replacement. 
+
+Is an {\bf eo\-Reduce\-Merge}{\rm (p.\,\pageref{classeo_reduce_merge})}. 
+
+
+
+Definition at line 91 of file eo\-Reduce\-Merge.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Reduce\-Merge.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_s_s_g_a_stoch_tournament_replacement.eps b/trunk/paradiseo-eo/doc/latex/classeo_s_s_g_a_stoch_tournament_replacement.eps
new file mode 100644
index 000000000..ffb34d6d5
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_s_s_g_a_stoch_tournament_replacement.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 134.409
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.72 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSSGAStochTournamentReplacement< EOT >) cw
+(eoReduceMerge< EOT >) cw
+(eoReplacement< EOT >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSSGAStochTournamentReplacement< EOT >) 0.5 0 box
+ (eoReduceMerge< EOT >) 0.5 1 box
+ (eoReplacement< EOT >) 0.5 2 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 3 box
+ (eoFunctorBase) 0 4 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 1 4 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+1 0.5 3 in
+solid
+0 0.5 3 out
+solid
+0 1 4 conn
+solid
+1 0 4 in
+solid
+1 1 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_s_s_g_a_stoch_tournament_replacement.tex b/trunk/paradiseo-eo/doc/latex/classeo_s_s_g_a_stoch_tournament_replacement.tex
new file mode 100644
index 000000000..7639b7270
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_s_s_g_a_stoch_tournament_replacement.tex
@@ -0,0 +1,44 @@
+\section{eo\-SSGAStoch\-Tournament\-Replacement$<$ EOT $>$ Class Template Reference}
+\label{classeo_s_s_g_a_stoch_tournament_replacement}\index{eoSSGAStochTournamentReplacement@{eoSSGAStochTournamentReplacement}}
+SSGA stochastic tournament replacement.  
+
+
+{\tt \#include $<$eo\-Reduce\-Merge.h$>$}
+
+Inheritance diagram for eo\-SSGAStoch\-Tournament\-Replacement$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.76344cm]{classeo_s_s_g_a_stoch_tournament_replacement}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-SSGAStoch\-Tournament\-Replacement} (double \_\-t\_\-rate)\label{classeo_s_s_g_a_stoch_tournament_replacement_a0}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Stoch\-Tournament\-Truncate}$<$ {\bf EOT} $>$ {\bf truncate}\label{classeo_s_s_g_a_stoch_tournament_replacement_r0}
+
+\item 
+{\bf eo\-Plus}$<$ {\bf EOT} $>$ {\bf plus}\label{classeo_s_s_g_a_stoch_tournament_replacement_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-SSGAStoch\-Tournament\-Replacement$<$ EOT $>$}
+
+SSGA stochastic tournament replacement. 
+
+Is an {\bf eo\-Reduce\-Merge}{\rm (p.\,\pageref{classeo_reduce_merge})}. It much cleaner to insert directly the offspring in the parent population, but it is NOT equivalent in case of more than 1 offspring as already replaced could be removed , which is not possible in the {\bf eo\-Reduce\-Merge}{\rm (p.\,\pageref{classeo_reduce_merge})} So what the heck ! 
+
+
+
+Definition at line 108 of file eo\-Reduce\-Merge.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Reduce\-Merge.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_s_s_g_a_worse_replacement.eps b/trunk/paradiseo-eo/doc/latex/classeo_s_s_g_a_worse_replacement.eps
new file mode 100644
index 000000000..54228ed1d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_s_s_g_a_worse_replacement.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 134.409
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.72 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSSGAWorseReplacement< EOT >) cw
+(eoReduceMerge< EOT >) cw
+(eoReplacement< EOT >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSSGAWorseReplacement< EOT >) 0.5 0 box
+ (eoReduceMerge< EOT >) 0.5 1 box
+ (eoReplacement< EOT >) 0.5 2 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 3 box
+ (eoFunctorBase) 0 4 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 1 4 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+1 0.5 3 in
+solid
+0 0.5 3 out
+solid
+0 1 4 conn
+solid
+1 0 4 in
+solid
+1 1 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_s_s_g_a_worse_replacement.tex b/trunk/paradiseo-eo/doc/latex/classeo_s_s_g_a_worse_replacement.tex
new file mode 100644
index 000000000..f59309bcc
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_s_s_g_a_worse_replacement.tex
@@ -0,0 +1,38 @@
+\section{eo\-SSGAWorse\-Replacement$<$ EOT $>$ Class Template Reference}
+\label{classeo_s_s_g_a_worse_replacement}\index{eoSSGAWorseReplacement@{eoSSGAWorseReplacement}}
+SSGA replace worst.  
+
+
+{\tt \#include $<$eo\-Reduce\-Merge.h$>$}
+
+Inheritance diagram for eo\-SSGAWorse\-Replacement$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.76344cm]{classeo_s_s_g_a_worse_replacement}
+\end{center}
+\end{figure}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Linear\-Truncate}$<$ {\bf EOT} $>$ {\bf truncate}\label{classeo_s_s_g_a_worse_replacement_r0}
+
+\item 
+{\bf eo\-Plus}$<$ {\bf EOT} $>$ {\bf plus}\label{classeo_s_s_g_a_worse_replacement_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-SSGAWorse\-Replacement$<$ EOT $>$}
+
+SSGA replace worst. 
+
+Is an {\bf eo\-Reduce\-Merge}{\rm (p.\,\pageref{classeo_reduce_merge})}. 
+
+
+
+Definition at line 77 of file eo\-Reduce\-Merge.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Reduce\-Merge.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_s_t_l_b_f.tex b/trunk/paradiseo-eo/doc/latex/classeo_s_t_l_b_f.tex
new file mode 100644
index 000000000..d970ad2fc
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_s_t_l_b_f.tex
@@ -0,0 +1,40 @@
+\section{eo\-STLBF$<$ A1, A2, R $>$ Class Template Reference}
+\label{classeo_s_t_l_b_f}\index{eoSTLBF@{eoSTLBF}}
+Generic set of classes that wrap an {\bf eo\-F}{\rm (p.\,\pageref{classeo_f})}, {\bf eo\-UF}{\rm (p.\,\pageref{classeo_u_f})} or {\bf eo\-BF}{\rm (p.\,\pageref{classeo_b_f})} so that they have the copy semantics the STL functions usually require (i.e.  
+
+
+{\tt \#include $<$eo\-STLFunctor.h$>$}
+
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-STLBF} ({\bf eo\-UF}$<$ A1, R $>$ \&\_\-f)\label{classeo_s_t_l_b_f_a0}
+
+\item 
+R {\bf operator()} (A1 a1, A2 a2)\label{classeo_s_t_l_b_f_a1}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-BF}$<$ A1, A2, R $>$ \& {\bf f}\label{classeo_s_t_l_b_f_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class A1, class A2, class R$>$ class eo\-STLBF$<$ A1, A2, R $>$}
+
+Generic set of classes that wrap an {\bf eo\-F}{\rm (p.\,\pageref{classeo_f})}, {\bf eo\-UF}{\rm (p.\,\pageref{classeo_u_f})} or {\bf eo\-BF}{\rm (p.\,\pageref{classeo_b_f})} so that they have the copy semantics the STL functions usually require (i.e. 
+
+they can be passed by value, rather than the {\bf EO}{\rm (p.\,\pageref{class_e_o})} standard pass by reference).
+
+The family consists of {\bf eo\-STLF}{\rm (p.\,\pageref{classeo_s_t_l_f})}, {\bf eo\-STLUF}{\rm (p.\,\pageref{classeo_s_t_l_u_f})}, eo\-STLBF that modify {\bf eo\-F}{\rm (p.\,\pageref{classeo_f})}, {\bf eo\-UF}{\rm (p.\,\pageref{classeo_u_f})} and {\bf eo\-BF}{\rm (p.\,\pageref{classeo_b_f})} respectively 
+
+
+
+Definition at line 101 of file eo\-STLFunctor.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-STLFunctor.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_s_t_l_f.tex b/trunk/paradiseo-eo/doc/latex/classeo_s_t_l_f.tex
new file mode 100644
index 000000000..0dc50d270
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_s_t_l_f.tex
@@ -0,0 +1,46 @@
+\section{eo\-STLF$<$ R $>$ Class Template Reference}
+\label{classeo_s_t_l_f}\index{eoSTLF@{eoSTLF}}
+Generic set of classes that wrap an {\bf eo\-F}{\rm (p.\,\pageref{classeo_f})}, {\bf eo\-UF}{\rm (p.\,\pageref{classeo_u_f})} or {\bf eo\-BF}{\rm (p.\,\pageref{classeo_b_f})} so that they have the copy semantics the STL functions usually require (i.e.  
+
+
+{\tt \#include $<$eo\-STLFunctor.h$>$}
+
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef R {\bf result\_\-type}\label{classeo_s_t_l_f_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-STLF} ({\bf eo\-F}$<$ R $>$ \&\_\-f)\label{classeo_s_t_l_f_a0}
+
+\item 
+R {\bf operator()} (void)\label{classeo_s_t_l_f_a1}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-F}$<$ R $>$ \& {\bf f}\label{classeo_s_t_l_f_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class R$>$ class eo\-STLF$<$ R $>$}
+
+Generic set of classes that wrap an {\bf eo\-F}{\rm (p.\,\pageref{classeo_f})}, {\bf eo\-UF}{\rm (p.\,\pageref{classeo_u_f})} or {\bf eo\-BF}{\rm (p.\,\pageref{classeo_b_f})} so that they have the copy semantics the STL functions usually require (i.e. 
+
+they can be passed by value, rather than the {\bf EO}{\rm (p.\,\pageref{class_e_o})} standard pass by reference).
+
+The family consists of eo\-STLF, {\bf eo\-STLUF}{\rm (p.\,\pageref{classeo_s_t_l_u_f})}, {\bf eo\-STLBF}{\rm (p.\,\pageref{classeo_s_t_l_b_f})} that modify {\bf eo\-F}{\rm (p.\,\pageref{classeo_f})}, {\bf eo\-UF}{\rm (p.\,\pageref{classeo_u_f})} and {\bf eo\-BF}{\rm (p.\,\pageref{classeo_b_f})} respectively 
+
+
+
+Definition at line 41 of file eo\-STLFunctor.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-STLFunctor.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_s_t_l_u_f.tex b/trunk/paradiseo-eo/doc/latex/classeo_s_t_l_u_f.tex
new file mode 100644
index 000000000..cdb626022
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_s_t_l_u_f.tex
@@ -0,0 +1,40 @@
+\section{eo\-STLUF$<$ A1, R $>$ Class Template Reference}
+\label{classeo_s_t_l_u_f}\index{eoSTLUF@{eoSTLUF}}
+Generic set of classes that wrap an {\bf eo\-F}{\rm (p.\,\pageref{classeo_f})}, {\bf eo\-UF}{\rm (p.\,\pageref{classeo_u_f})} or {\bf eo\-BF}{\rm (p.\,\pageref{classeo_b_f})} so that they have the copy semantics the STL functions usually require (i.e.  
+
+
+{\tt \#include $<$eo\-STLFunctor.h$>$}
+
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-STLUF} ({\bf eo\-UF}$<$ A1, R $>$ \&\_\-f)\label{classeo_s_t_l_u_f_a0}
+
+\item 
+R {\bf operator()} (A1 a)\label{classeo_s_t_l_u_f_a1}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-UF}$<$ A1, R $>$ \& {\bf f}\label{classeo_s_t_l_u_f_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class A1, class R$>$ class eo\-STLUF$<$ A1, R $>$}
+
+Generic set of classes that wrap an {\bf eo\-F}{\rm (p.\,\pageref{classeo_f})}, {\bf eo\-UF}{\rm (p.\,\pageref{classeo_u_f})} or {\bf eo\-BF}{\rm (p.\,\pageref{classeo_b_f})} so that they have the copy semantics the STL functions usually require (i.e. 
+
+they can be passed by value, rather than the {\bf EO}{\rm (p.\,\pageref{class_e_o})} standard pass by reference).
+
+The family consists of {\bf eo\-STLF}{\rm (p.\,\pageref{classeo_s_t_l_f})}, eo\-STLUF, {\bf eo\-STLBF}{\rm (p.\,\pageref{classeo_s_t_l_b_f})} that modify {\bf eo\-F}{\rm (p.\,\pageref{classeo_f})}, {\bf eo\-UF}{\rm (p.\,\pageref{classeo_u_f})} and {\bf eo\-BF}{\rm (p.\,\pageref{classeo_b_f})} respectively 
+
+
+
+Definition at line 78 of file eo\-STLFunctor.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-STLFunctor.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_scalar_fitness.tex b/trunk/paradiseo-eo/doc/latex/classeo_scalar_fitness.tex
new file mode 100644
index 000000000..ab3888631
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_scalar_fitness.tex
@@ -0,0 +1,61 @@
+\section{eo\-Scalar\-Fitness$<$ Scalar\-Type, Compare $>$ Class Template Reference}
+\label{classeo_scalar_fitness}\index{eoScalarFitness@{eoScalarFitness}}
+eo\-Scalar\-Fitness$<$Scalar\-Type, Compare = less$<$Scalar\-Type$>$ $>$: Wraps a scalar fitness values such as a double or int, with the option of maximizing (using less$<$Scalar\-Type$>$) or minimizing (using greater$<$Scalar\-Type$>$)  
+
+
+{\tt \#include $<$eo\-Scalar\-Fitness.h$>$}
+
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Scalar\-Fitness} (const {\bf eo\-Scalar\-Fitness} \&other)\label{classeo_scalar_fitness_a1}
+
+\item 
+{\bf eo\-Scalar\-Fitness} (const Scalar\-Type \&v)\label{classeo_scalar_fitness_a2}
+
+\item 
+{\bf eo\-Scalar\-Fitness} \& {\bf operator=} (const {\bf eo\-Scalar\-Fitness} \&other)\label{classeo_scalar_fitness_a3}
+
+\item 
+{\bf eo\-Scalar\-Fitness} \& {\bf operator=} (const Scalar\-Type \&v)\label{classeo_scalar_fitness_a4}
+
+\item 
+{\bf operator Scalar\-Type} (void) const \label{classeo_scalar_fitness_a5}
+
+\item 
+bool {\bf operator$<$} (const {\bf eo\-Scalar\-Fitness} \&other) const \label{classeo_scalar_fitness_a6}
+
+\begin{CompactList}\small\item\em Comparison, using less by default. \item\end{CompactList}\item 
+bool {\bf operator$>$} (const {\bf eo\-Scalar\-Fitness}$<$ Scalar\-Type, Compare $>$ \&y) const \label{classeo_scalar_fitness_a7}
+
+\item 
+bool {\bf operator$<$=} (const {\bf eo\-Scalar\-Fitness}$<$ Scalar\-Type, Compare $>$ \&y) const \label{classeo_scalar_fitness_a8}
+
+\item 
+bool {\bf operator$>$=} (const {\bf eo\-Scalar\-Fitness}$<$ Scalar\-Type, Compare $>$ \&y) const \label{classeo_scalar_fitness_a9}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+Scalar\-Type {\bf value}\label{classeo_scalar_fitness_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Scalar\-Type, class Compare$>$ class eo\-Scalar\-Fitness$<$ Scalar\-Type, Compare $>$}
+
+eo\-Scalar\-Fitness$<$Scalar\-Type, Compare = less$<$Scalar\-Type$>$ $>$: Wraps a scalar fitness values such as a double or int, with the option of maximizing (using less$<$Scalar\-Type$>$) or minimizing (using greater$<$Scalar\-Type$>$) 
+
+It overrides {\bf operator$<$()}{\rm (p.\,\pageref{classeo_scalar_fitness_a6})} to use the Compare template argument
+
+Suitable constructors and assignments and casts are defined to work with this quantity as if it were a Scalar\-Type. 
+
+
+
+Definition at line 43 of file eo\-Scalar\-Fitness.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Scalar\-Fitness.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_scalar_fitness_assembled.tex b/trunk/paradiseo-eo/doc/latex/classeo_scalar_fitness_assembled.tex
new file mode 100644
index 000000000..f296957a0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_scalar_fitness_assembled.tex
@@ -0,0 +1,111 @@
+\section{eo\-Scalar\-Fitness\-Assembled$<$ Scalar\-Type, Compare, Fitness\-Traits $>$ Class Template Reference}
+\label{classeo_scalar_fitness_assembled}\index{eoScalarFitnessAssembled@{eoScalarFitnessAssembled}}
+Implements fitness as std::vector, storing all values that might occur during fitness assembly.  
+
+
+{\tt \#include $<$eo\-Scalar\-Fitness\-Assembled.h$>$}
+
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef std::vector$<$ Scalar\-Type $>$ {\bf base\-Vector}\label{classeo_scalar_fitness_assembled_w0}
+
+\item 
+typedef base\-Vector::size\_\-type {\bf size\_\-type}\label{classeo_scalar_fitness_assembled_w1}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Scalar\-Fitness\-Assembled} (size\_\-type \_\-n, const Scalar\-Type \&\_\-val, const std::string \&\_\-descr=\char`\"{}Unnamed variable\char`\"{})\label{classeo_scalar_fitness_assembled_a1}
+
+\item 
+{\bf eo\-Scalar\-Fitness\-Assembled} (const {\bf eo\-Scalar\-Fitness\-Assembled} \&other)\label{classeo_scalar_fitness_assembled_a2}
+
+\item 
+{\bf eo\-Scalar\-Fitness\-Assembled} \& {\bf operator=} (const {\bf eo\-Scalar\-Fitness\-Assembled} \&other)\label{classeo_scalar_fitness_assembled_a3}
+
+\item 
+{\bf eo\-Scalar\-Fitness\-Assembled} (const Scalar\-Type \&v)\label{classeo_scalar_fitness_assembled_a4}
+
+\item 
+{\bf eo\-Scalar\-Fitness\-Assembled} \& {\bf operator=} (const Scalar\-Type \&v)\label{classeo_scalar_fitness_assembled_a5}
+
+\item 
+void {\bf push\_\-back} (const Scalar\-Type \&\_\-val)\label{classeo_scalar_fitness_assembled_a6}
+
+\begin{CompactList}\small\item\em Overload {\bf push\_\-back()}{\rm (p.\,\pageref{classeo_scalar_fitness_assembled_a6})}. \item\end{CompactList}\item 
+void {\bf push\_\-back} (const Scalar\-Type \&\_\-val, const std::string \&\_\-descr)\label{classeo_scalar_fitness_assembled_a7}
+
+\begin{CompactList}\small\item\em Overload {\bf push\_\-back()}{\rm (p.\,\pageref{classeo_scalar_fitness_assembled_a6})}. \item\end{CompactList}\item 
+void {\bf resize} (size\_\-type \_\-n, const Scalar\-Type \&\_\-val=Scalar\-Type(), const std::string \&\_\-descr=\char`\"{}Unnamed variable\char`\"{})\label{classeo_scalar_fitness_assembled_a8}
+
+\begin{CompactList}\small\item\em Overload {\bf resize()}{\rm (p.\,\pageref{classeo_scalar_fitness_assembled_a8})}. \item\end{CompactList}\item 
+void {\bf set\-Description} (size\_\-type \_\-idx, std::string \_\-descr)\label{classeo_scalar_fitness_assembled_a9}
+
+\begin{CompactList}\small\item\em Set description. \item\end{CompactList}\item 
+std::string {\bf get\-Description} (size\_\-type \_\-idx)\label{classeo_scalar_fitness_assembled_a10}
+
+\begin{CompactList}\small\item\em Get description. \item\end{CompactList}\item 
+std::vector$<$ std::string $>$ {\bf get\-Description\-Vector} ()\label{classeo_scalar_fitness_assembled_a11}
+
+\begin{CompactList}\small\item\em Get vector with descriptions. \item\end{CompactList}\item 
+{\bf operator Scalar\-Type} (void) const \label{classeo_scalar_fitness_assembled_a12}
+
+\item 
+void {\bf print\-All} (std::ostream \&os) const \label{classeo_scalar_fitness_assembled_a13}
+
+\begin{CompactList}\small\item\em Print term values and descriptions. \item\end{CompactList}\item 
+bool {\bf operator$<$} (const {\bf eo\-Scalar\-Fitness\-Assembled} \&other) const \label{classeo_scalar_fitness_assembled_a14}
+
+\item 
+bool {\bf operator$>$} (const {\bf eo\-Scalar\-Fitness\-Assembled}$<$ Scalar\-Type, Compare, Fitness\-Traits $>$ \&y) const \label{classeo_scalar_fitness_assembled_a15}
+
+\item 
+bool {\bf operator$<$=} (const {\bf eo\-Scalar\-Fitness\-Assembled}$<$ Scalar\-Type, Compare, Fitness\-Traits $>$ \&y) const \label{classeo_scalar_fitness_assembled_a16}
+
+\item 
+bool {\bf operator$>$=} (const {\bf eo\-Scalar\-Fitness\-Assembled}$<$ Scalar\-Type, Compare, Fitness\-Traits $>$ \&y) const \label{classeo_scalar_fitness_assembled_a17}
+
+\end{CompactItemize}
+\subsection*{Public Attributes}
+\begin{CompactItemize}
+\item 
+bool {\bf feasible}\label{classeo_scalar_fitness_assembled_o0}
+
+\begin{CompactList}\small\item\em Can be specified anywhere in fitness evaluation as an indicator if the individual is in some feasible range. \item\end{CompactList}\item 
+bool {\bf failed}\label{classeo_scalar_fitness_assembled_o1}
+
+\begin{CompactList}\small\item\em Can be specified anywhere in fitness evaluation as an indicator if the evaluation of the individual failed. \item\end{CompactList}\item 
+std::string {\bf msg}
+\begin{CompactList}\small\item\em Can be specified anywhere in fitness evaluation. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Scalar\-Type, class Compare, class Fitness\-Traits$>$ class eo\-Scalar\-Fitness\-Assembled$<$ Scalar\-Type, Compare, Fitness\-Traits $>$}
+
+Implements fitness as std::vector, storing all values that might occur during fitness assembly. 
+
+Properties:\begin{itemize}
+\item Wraps a scalar fitness values such as a double or int, with the option of maximizing (using less$<$Scalar\-Type$>$) or minimizing (using greater$<$Scalar\-Type$>$).\item Stores all kinda different values met during fitness assembly, to be defined in {\bf eo\-Eval\-Func}{\rm (p.\,\pageref{classeo_eval_func})}.\item It overrides operator$<$() to use the Compare template argument.\item Suitable constructors and assignments and casts are defined to work with this quantity as if it were a Scalar\-Type.\item Global fitness value is stored as first element in the vector \end{itemize}
+
+
+
+
+Definition at line 88 of file eo\-Scalar\-Fitness\-Assembled.h.
+
+\subsection{Member Data Documentation}
+\index{eoScalarFitnessAssembled@{eo\-Scalar\-Fitness\-Assembled}!msg@{msg}}
+\index{msg@{msg}!eoScalarFitnessAssembled@{eo\-Scalar\-Fitness\-Assembled}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Scalar\-Type, class Compare, class Fitness\-Traits$>$ std::string {\bf eo\-Scalar\-Fitness\-Assembled}$<$ Scalar\-Type, Compare, Fitness\-Traits $>$::{\bf msg}}\label{classeo_scalar_fitness_assembled_o2}
+
+
+Can be specified anywhere in fitness evaluation. 
+
+Typically used to store some sort of error messages, if evaluation of individual failed. 
+
+Definition at line 195 of file eo\-Scalar\-Fitness\-Assembled.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Scalar\-Fitness\-Assembled.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_scalar_fitness_assembled_traits.tex b/trunk/paradiseo-eo/doc/latex/classeo_scalar_fitness_assembled_traits.tex
new file mode 100644
index 000000000..91fb24af3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_scalar_fitness_assembled_traits.tex
@@ -0,0 +1,54 @@
+\section{eo\-Scalar\-Fitness\-Assembled\-Traits Class Reference}
+\label{classeo_scalar_fitness_assembled_traits}\index{eoScalarFitnessAssembledTraits@{eoScalarFitnessAssembledTraits}}
+Defines properties of {\bf eo\-Scalar\-Fitness\-Assembled}{\rm (p.\,\pageref{classeo_scalar_fitness_assembled})}.  
+
+
+{\tt \#include $<$eo\-Scalar\-Fitness\-Assembled.h$>$}
+
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef std::vector$<$ std::string $>$::size\_\-type {\bf size\_\-type}\label{classeo_scalar_fitness_assembled_traits_w0}
+
+\end{CompactItemize}
+\subsection*{Static Public Member Functions}
+\begin{CompactItemize}
+\item 
+void {\bf set\-Description} (size\_\-type \_\-idx, std::string \_\-descr)\label{classeo_scalar_fitness_assembled_traits_e0}
+
+\item 
+std::string {\bf get\-Description} (size\_\-type \_\-idx)\label{classeo_scalar_fitness_assembled_traits_e1}
+
+\item 
+void {\bf resize} (size\_\-type \_\-n, const std::string \&\_\-descr)\label{classeo_scalar_fitness_assembled_traits_e2}
+
+\item 
+size\_\-type {\bf size} ()\label{classeo_scalar_fitness_assembled_traits_e3}
+
+\item 
+std::vector$<$ std::string $>$ {\bf get\-Description\-Vector} ()\label{classeo_scalar_fitness_assembled_traits_e4}
+
+\end{CompactItemize}
+\subsection*{Static Private Attributes}
+\begin{CompactItemize}
+\item 
+std::vector$<$ std::string $>$ {\bf Term\-Descriptions}\label{classeo_scalar_fitness_assembled_traits_v0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Defines properties of {\bf eo\-Scalar\-Fitness\-Assembled}{\rm (p.\,\pageref{classeo_scalar_fitness_assembled})}. 
+
+Properties that are hold in this traits class:\begin{itemize}
+\item std::vector$<$std::string$>$ to hold descriptions of the different fitness terms \end{itemize}
+
+
+
+
+Definition at line 43 of file eo\-Scalar\-Fitness\-Assembled.h.
+
+The documentation for this class was generated from the following files:\begin{CompactItemize}
+\item 
+eo\-Scalar\-Fitness\-Assembled.h\item 
+eo\-Scalar\-Fitness\-Assembled.cpp\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_scalar_fitness_stat.eps b/trunk/paradiseo-eo/doc/latex/classeo_scalar_fitness_stat.eps
new file mode 100644
index 000000000..3025f9ca6
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_scalar_fitness_stat.eps
@@ -0,0 +1,233 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 91.3242
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.475 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoScalarFitnessStat< EOT, FitT >) cw
+(eoSortedStat< EOT, std::vector< double > >) cw
+(eoSortedStatBase< EOT >) cw
+(eoValueParam< std::vector< double > >) cw
+(eoUF< const std::vector< const EOT * > &, void >) cw
+(eoParam) cw
+(eoFunctorBase) cw
+(unary_function< const std::vector< const EOT * > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoScalarFitnessStat< EOT, FitT >) 1 0 box
+ (eoSortedStat< EOT, std::vector< double > >) 1 1 box
+ (eoSortedStatBase< EOT >) 0.5 2 box
+ (eoValueParam< std::vector< double > >) 1.5 2 box
+ (eoUF< const std::vector< const EOT * > &, void >) 0.5 3 box
+ (eoParam) 1.5 3 box
+ (eoFunctorBase) 0 4 box
+ (unary_function< const std::vector< const EOT * > &, void >) 1 4 box
+
+% ----- relations -----
+
+solid
+0 1 0 out
+solid
+1 1 1 in
+solid
+0 1 1 out
+solid
+0.5 1.5 2 conn
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+1 1.5 2 in
+solid
+0 1.5 2 out
+solid
+1 0.5 3 in
+solid
+0 0.5 3 out
+solid
+0 1 4 conn
+solid
+1 1.5 3 in
+solid
+1 0 4 in
+solid
+1 1 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_scalar_fitness_stat.tex b/trunk/paradiseo-eo/doc/latex/classeo_scalar_fitness_stat.tex
new file mode 100644
index 000000000..6dfee3e92
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_scalar_fitness_stat.tex
@@ -0,0 +1,42 @@
+\section{eo\-Scalar\-Fitness\-Stat$<$ EOT, Fit\-T $>$ Class Template Reference}
+\label{classeo_scalar_fitness_stat}\index{eoScalarFitnessStat@{eoScalarFitnessStat}}
+The fitnesses of a whole population, as a std::vector.  
+
+
+{\tt \#include $<$eo\-Scalar\-Fitness\-Stat.h$>$}
+
+Inheritance diagram for eo\-Scalar\-Fitness\-Stat$<$ EOT, Fit\-T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.55708cm]{classeo_scalar_fitness_stat}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Scalar\-Fitness\-Stat} (std::string \_\-description=\char`\"{}Fitness\-ES\char`\"{}, eo\-Real\-Vector\-Bounds \&\_\-bounds=eo\-Dummy\-Vector\-No\-Bounds)\label{classeo_scalar_fitness_stat_a0}
+
+\item 
+virtual void {\bf operator()} (const std::vector$<$ const {\bf EOT} $\ast$ $>$ \&\_\-pop\-Pters)\label{classeo_scalar_fitness_stat_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Real\-Bounds} \& {\bf range}\label{classeo_scalar_fitness_stat_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT, class Fit\-T = typename EOT::Fitness$>$ class eo\-Scalar\-Fitness\-Stat$<$ EOT, Fit\-T $>$}
+
+The fitnesses of a whole population, as a std::vector. 
+
+
+
+Definition at line 37 of file eo\-Scalar\-Fitness\-Stat.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Scalar\-Fitness\-Stat.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_second_moment_stats.eps b/trunk/paradiseo-eo/doc/latex/classeo_second_moment_stats.eps
new file mode 100644
index 000000000..cffe530dd
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_second_moment_stats.eps
@@ -0,0 +1,233 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 112.613
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.44 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSecondMomentStats< EOT >) cw
+(eoStat< EOT, std::pair< double, double > >) cw
+(eoValueParam< std::pair< double, double > >) cw
+(eoStatBase< EOT >) cw
+(eoParam) cw
+(eoUF< const eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSecondMomentStats< EOT >) 0.5 0 box
+ (eoStat< EOT, std::pair< double, double > >) 0.5 1 box
+ (eoValueParam< std::pair< double, double > >) 0 2 box
+ (eoStatBase< EOT >) 1 2 box
+ (eoParam) 0 3 box
+ (eoUF< const eoPop< EOT > &, void >) 1 3 box
+ (eoFunctorBase) 0.5 4 box
+ (unary_function< const eoPop< EOT > &, void >) 1.5 4 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+0 1 3 out
+solid
+0.5 1.5 4 conn
+solid
+1 0.5 4 in
+solid
+1 1.5 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_second_moment_stats.tex b/trunk/paradiseo-eo/doc/latex/classeo_second_moment_stats.tex
new file mode 100644
index 000000000..2b243d20e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_second_moment_stats.tex
@@ -0,0 +1,56 @@
+\section{eo\-Second\-Moment\-Stats$<$ EOT $>$ Class Template Reference}
+\label{classeo_second_moment_stats}\index{eoSecondMomentStats@{eoSecondMomentStats}}
+Average fitness + Std.  
+
+
+{\tt \#include $<$eo\-Stat.h$>$}
+
+Inheritance diagram for eo\-Second\-Moment\-Stats$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.15315cm]{classeo_second_moment_stats}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Fitness {\bf fitness\_\-type}\label{classeo_second_moment_stats_w0}
+
+\item 
+typedef std::pair$<$ double, double $>$ {\bf Square\-Pair}\label{classeo_second_moment_stats_w1}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Second\-Moment\-Stats} (std::string \_\-description=\char`\"{}Average \& Stdev\char`\"{})\label{classeo_second_moment_stats_a0}
+
+\item 
+virtual void {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_second_moment_stats_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} (void) const \label{classeo_second_moment_stats_a2}
+
+\end{CompactItemize}
+\subsection*{Static Public Member Functions}
+\begin{CompactItemize}
+\item 
+Square\-Pair {\bf sum\-Of\-Squares} (Square\-Pair \_\-sq, const {\bf EOT} \&\_\-eo)\label{classeo_second_moment_stats_e0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Second\-Moment\-Stats$<$ EOT $>$}
+
+Average fitness + Std. 
+
+dev. of a population, fitness needs to be scalar. 
+
+
+
+Definition at line 168 of file eo\-Stat.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Stat.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_segment_crossover.eps b/trunk/paradiseo-eo/doc/latex/classeo_segment_crossover.eps
new file mode 100644
index 000000000..c7998efc8
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_segment_crossover.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 105.82
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.725 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSegmentCrossover< EOT >) cw
+(eoQuadOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoBF< EOT &, EOT &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< EOT &, EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSegmentCrossover< EOT >) 0.5 0 box
+ (eoQuadOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoBF< EOT &, EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< EOT &, EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_segment_crossover.tex b/trunk/paradiseo-eo/doc/latex/classeo_segment_crossover.tex
new file mode 100644
index 000000000..a61b6ba80
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_segment_crossover.tex
@@ -0,0 +1,105 @@
+\section{eo\-Segment\-Crossover$<$ EOT $>$ Class Template Reference}
+\label{classeo_segment_crossover}\index{eoSegmentCrossover@{eoSegmentCrossover}}
+eo\-Segment\-Crossover --$>$ uniform choice in segment == arithmetical with same value along all coordinates  
+
+
+{\tt \#include $<$Tutorial/eo\-Real\-Op.h$>$}
+
+Inheritance diagram for eo\-Segment\-Crossover$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.96296cm]{classeo_segment_crossover}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Segment\-Crossover} (const double \&\_\-alpha=0.0)
+\begin{CompactList}\small\item\em (Default) Constructor. \item\end{CompactList}\item 
+{\bf eo\-Segment\-Crossover} ({\bf eo\-Real\-Vector\-Bounds} \&\_\-bounds, const double \&\_\-alpha=0.0)
+\begin{CompactList}\small\item\em Constructor with bounds. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_segment_crossover_a2}
+
+\begin{CompactList}\small\item\em The class name. \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eo1, {\bf EOT} \&\_\-eo2)
+\begin{CompactList}\small\item\em segment crossover - modifies both parents \item\end{CompactList}\end{CompactItemize}
+\subsection*{Protected Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Real\-Vector\-Bounds} \& {\bf bounds}\label{classeo_segment_crossover_p0}
+
+\item 
+double {\bf alpha}\label{classeo_segment_crossover_p1}
+
+\item 
+double {\bf range}\label{classeo_segment_crossover_p2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Segment\-Crossover$<$ EOT $>$}
+
+eo\-Segment\-Crossover --$>$ uniform choice in segment == arithmetical with same value along all coordinates 
+
+
+
+Definition at line 247 of file eo\-Real\-Op.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoSegmentCrossover@{eo\-Segment\-Crossover}!eoSegmentCrossover@{eoSegmentCrossover}}
+\index{eoSegmentCrossover@{eoSegmentCrossover}!eoSegmentCrossover@{eo\-Segment\-Crossover}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Segment\-Crossover}$<$ {\bf EOT} $>$::{\bf eo\-Segment\-Crossover} (const double \& {\em \_\-alpha} = {\tt 0.0})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_segment_crossover_a0}
+
+
+(Default) Constructor. 
+
+The bounds are initialized with the global object that says: no bounds.
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-alpha\-Min}]the amount of exploration OUTSIDE the parents as in BLX-alpha notation (Eshelman and Schaffer) 0 == contractive application Must be positive \end{description}
+\end{Desc}
+
+
+Definition at line 259 of file eo\-Real\-Op.h.\index{eoSegmentCrossover@{eo\-Segment\-Crossover}!eoSegmentCrossover@{eoSegmentCrossover}}
+\index{eoSegmentCrossover@{eoSegmentCrossover}!eoSegmentCrossover@{eo\-Segment\-Crossover}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Segment\-Crossover}$<$ {\bf EOT} $>$::{\bf eo\-Segment\-Crossover} ({\bf eo\-Real\-Vector\-Bounds} \& {\em \_\-bounds}, const double \& {\em \_\-alpha} = {\tt 0.0})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_segment_crossover_a1}
+
+
+Constructor with bounds. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-bounds}]an {\bf eo\-Real\-Vector\-Bounds}{\rm (p.\,\pageref{classeo_real_vector_bounds})} that contains the bounds \item[{\em \_\-alpha\-Min}]the amount of exploration OUTSIDE the parents as in BLX-alpha notation (Eshelman and Schaffer) 0 == contractive application Must be positive \end{description}
+\end{Desc}
+
+
+Definition at line 270 of file eo\-Real\-Op.h.
+
+\subsection{Member Function Documentation}
+\index{eoSegmentCrossover@{eo\-Segment\-Crossover}!operator()@{operator()}}
+\index{operator()@{operator()}!eoSegmentCrossover@{eo\-Segment\-Crossover}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ bool {\bf eo\-Segment\-Crossover}$<$ {\bf EOT} $>$::operator() ({\bf EOT} \& {\em \_\-eo1}, {\bf EOT} \& {\em \_\-eo2})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_segment_crossover_a3}
+
+
+segment crossover - modifies both parents 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-eo1}]The first parent \item[{\em \_\-eo2}]The first parent \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-BF$<$ EOT \&, EOT \&, bool $>$} {\rm (p.\,\pageref{classeo_b_f_a1})}.
+
+Definition at line 282 of file eo\-Real\-Op.h.
+
+References eo\-Real\-Base\-Vector\-Bounds::is\-Max\-Bounded(), eo\-Real\-Base\-Vector\-Bounds::is\-Min\-Bounded(), eo\-Real\-Base\-Vector\-Bounds::maximum(), eo\-Real\-Base\-Vector\-Bounds::minimum(), and eo\-Rng::uniform().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Real\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_sel_bin_gen_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_sel_bin_gen_op.eps
new file mode 100644
index 000000000..e23ef65e9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_sel_bin_gen_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 91.0125
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.49375 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSelBinGenOp< EOT >) cw
+(eoGenOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoUF< eoPopulator< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< eoPopulator< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSelBinGenOp< EOT >) 0.5 0 box
+ (eoGenOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoUF< eoPopulator< EOT > &, void >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< eoPopulator< EOT > &, void >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_sel_bin_gen_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_sel_bin_gen_op.tex
new file mode 100644
index 000000000..4d741f39e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_sel_bin_gen_op.tex
@@ -0,0 +1,51 @@
+\section{eo\-Sel\-Bin\-Gen\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_sel_bin_gen_op}\index{eoSelBinGenOp@{eoSelBinGenOp}}
+wrapper for {\bf eo\-Bin\-Op}{\rm (p.\,\pageref{classeo_bin_op})} with a selector  
+
+
+{\tt \#include $<$eo\-Gen\-Op.h$>$}
+
+Inheritance diagram for eo\-Sel\-Bin\-Gen\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.54835cm]{classeo_sel_bin_gen_op}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Sel\-Bin\-Gen\-Op} ({\bf eo\-Bin\-Op}$<$ {\bf EOT} $>$ \&\_\-op, {\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \&\_\-sel)\label{classeo_sel_bin_gen_op_a0}
+
+\item 
+unsigned {\bf max\_\-production} (void)\label{classeo_sel_bin_gen_op_a1}
+
+\begin{CompactList}\small\item\em Max production is used to reserve space for all elements that are used by the operator, not setting it properly can result in a crash. \item\end{CompactList}\item 
+void {\bf apply} ({\bf eo\-Populator}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_sel_bin_gen_op_a2}
+
+\begin{CompactList}\small\item\em the function that will do the work \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_sel_bin_gen_op_a3}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Bin\-Op}$<$ {\bf EOT} $>$ \& {\bf op}\label{classeo_sel_bin_gen_op_r0}
+
+\item 
+{\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \& {\bf sel}\label{classeo_sel_bin_gen_op_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Sel\-Bin\-Gen\-Op$<$ EOT $>$}
+
+wrapper for {\bf eo\-Bin\-Op}{\rm (p.\,\pageref{classeo_bin_op})} with a selector 
+
+
+
+Definition at line 133 of file eo\-Gen\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Gen\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_select.eps b/trunk/paradiseo-eo/doc/latex/classeo_select.eps
new file mode 100644
index 000000000..8ec498192
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_select.eps
@@ -0,0 +1,241 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 28.08
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 17.8062 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 7 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSelect< EOT >) cw
+(eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< const eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoDetSelect< EOT >) cw
+(eoEasyEA< EOT >::eoDummySelect) cw
+(eoSelectMany< EOT >) cw
+(eoSelectNumber< EOT >) cw
+(eoSelectPerc< EOT >) cw
+(eoTruncatedSelectMany< EOT >) cw
+(eoTruncSelect< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSelect< EOT >) 3 1 box
+ (eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) 3 2 box
+ (eoFunctorBase) 2.5 3 box
+ (binary_function< const eoPop< EOT > &, eoPop< EOT > &, void >) 3.5 3 box
+ (eoDetSelect< EOT >) 0 0 box
+ (eoEasyEA< EOT >::eoDummySelect) 1 0 box
+ (eoSelectMany< EOT >) 2 0 box
+ (eoSelectNumber< EOT >) 3 0 box
+ (eoSelectPerc< EOT >) 4 0 box
+ (eoTruncatedSelectMany< EOT >) 5 0 box
+ (eoTruncSelect< EOT >) 6 0 box
+
+% ----- relations -----
+
+solid
+0 3 1 out
+solid
+1 3 2 in
+solid
+0 3 2 out
+solid
+2.5 3.5 3 conn
+solid
+1 2.5 3 in
+solid
+1 3.5 3 in
+solid
+1 3 0.25 out
+solid
+0 6 1 conn
+solid
+0 0 0.75 in
+solid
+0 1 0.75 in
+solid
+0 2 0.75 in
+solid
+0 3 0.75 in
+solid
+0 4 0.75 in
+solid
+0 5 0.75 in
+solid
+0 6 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_select.tex b/trunk/paradiseo-eo/doc/latex/classeo_select.tex
new file mode 100644
index 000000000..0e4ca7651
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_select.tex
@@ -0,0 +1,29 @@
+\section{eo\-Select$<$ EOT $>$ Class Template Reference}
+\label{classeo_select}\index{eoSelect@{eoSelect}}
+eo\-Select selects a number of individuals from the first argument and puts it in the second.  
+
+
+{\tt \#include $<$eo\-Select.h$>$}
+
+Inheritance diagram for eo\-Select$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=0.786241cm]{classeo_select}
+\end{center}
+\end{figure}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Select$<$ EOT $>$}
+
+eo\-Select selects a number of individuals from the first argument and puts it in the second. 
+
+To emphasize that it should not try to enlarge the population, the second argument is an eo\-Pop\-Range, a simple struct that holds a begin and end iterator to the population 
+
+
+
+Definition at line 40 of file eo\-Select.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Select.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_select_factory.eps b/trunk/paradiseo-eo/doc/latex/classeo_select_factory.eps
new file mode 100644
index 000000000..f6b99f613
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_select_factory.eps
@@ -0,0 +1,203 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 300
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.66667 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 3 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSelectFactory< EOT >) cw
+(eoFactory< eoSelect< EOT > >) cw
+(eoObject) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSelectFactory< EOT >) 0 0 box
+ (eoFactory< eoSelect< EOT > >) 0 1 box
+ (eoObject) 0 2 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_select_factory.tex b/trunk/paradiseo-eo/doc/latex/classeo_select_factory.tex
new file mode 100644
index 000000000..d53b02e6d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_select_factory.tex
@@ -0,0 +1,70 @@
+\section{eo\-Select\-Factory$<$ EOT $>$ Class Template Reference}
+\label{classeo_select_factory}\index{eoSelectFactory@{eoSelectFactory}}
+{\bf EO}{\rm (p.\,\pageref{class_e_o})} Factory.An instance of the factory class to create selectors, that is, {\bf eo\-Select}{\rm (p.\,\pageref{classeo_select})} objects.  
+
+
+{\tt \#include $<$eo\-Select\-Factory.h$>$}
+
+Inheritance diagram for eo\-Select\-Factory$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3cm]{classeo_select_factory}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual {\bf eo\-Select}$<$ {\bf EOT} $>$ $\ast$ {\bf make} (std::istream \&\_\-is)
+\begin{CompactList}\small\item\em Another factory methods: creates an object from an std::istream, reading from it whatever is needed to create the object. \item\end{CompactList}\end{CompactItemize}
+\begin{Indent}{\bf ctors and dtors}\par
+\begin{CompactItemize}
+\item 
+{\bf eo\-Select\-Factory} ()\label{classeo_select_factory_z20_0}
+
+\begin{CompactList}\small\item\em constructor \item\end{CompactList}\item 
+virtual {\bf $\sim$eo\-Select\-Factory} ()\label{classeo_select_factory_z20_1}
+
+\begin{CompactList}\small\item\em destructor \item\end{CompactList}\end{CompactItemize}
+\end{Indent}
+\begin{Indent}{\bf eo\-Object methods}\par
+\begin{CompactItemize}
+\item 
+void {\bf print\-On} (std::ostream \&\_\-os) const \label{classeo_select_factory_z22_0}
+
+\item 
+void {\bf read\-From} (std::istream \&\_\-is)\label{classeo_select_factory_z22_1}
+
+\end{CompactItemize}
+\end{Indent}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Select\-Factory$<$ EOT $>$}
+
+{\bf EO}{\rm (p.\,\pageref{class_e_o})} Factory.An instance of the factory class to create selectors, that is, {\bf eo\-Select}{\rm (p.\,\pageref{classeo_select})} objects. 
+
+\begin{Desc}
+\item[See also:]{\bf eo\-Select}{\rm (p.\,\pageref{classeo_select})} \end{Desc}
+
+
+
+
+Definition at line 39 of file eo\-Select\-Factory.h.
+
+\subsection{Member Function Documentation}
+\index{eoSelectFactory@{eo\-Select\-Factory}!make@{make}}
+\index{make@{make}!eoSelectFactory@{eo\-Select\-Factory}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ virtual {\bf eo\-Select}$<${\bf EOT}$>$$\ast$ {\bf eo\-Select\-Factory}$<$ {\bf EOT} $>$::make (std::istream \& {\em \_\-is})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_select_factory_a0}
+
+
+Another factory methods: creates an object from an std::istream, reading from it whatever is needed to create the object. 
+
+Usually, the format for the std::istream will be$\backslash$ object\-Type parameter1 parameter2 ... parametern$\backslash$
+
+Implements {\bf eo\-Factory$<$ eo\-Select$<$ EOT $>$ $>$} {\rm (p.\,\pageref{classeo_factory_a0})}.
+
+Definition at line 56 of file eo\-Select\-Factory.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Select\-Factory.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_select_from_worth.eps b/trunk/paradiseo-eo/doc/latex/classeo_select_from_worth.eps
new file mode 100644
index 000000000..04e8e9927
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_select_from_worth.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 115.607
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.325 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSelectFromWorth< EOT, WorthType >) cw
+(eoSelectOne< EOT >) cw
+(eoUF< const eoPop< EOT > &, const EOT & >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, const EOT & >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSelectFromWorth< EOT, WorthType >) 0.5 0 box
+ (eoSelectOne< EOT >) 0.5 1 box
+ (eoUF< const eoPop< EOT > &, const EOT & >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< const eoPop< EOT > &, const EOT & >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_select_from_worth.tex b/trunk/paradiseo-eo/doc/latex/classeo_select_from_worth.tex
new file mode 100644
index 000000000..1cff43319
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_select_from_worth.tex
@@ -0,0 +1,59 @@
+\section{eo\-Select\-From\-Worth$<$ EOT, Worth\-Type $>$ Class Template Reference}
+\label{classeo_select_from_worth}\index{eoSelectFromWorth@{eoSelectFromWorth}}
+selects one element from a population (is an {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})}) but the selection is based on a std::vector of Worth that is different from the fitnesses (e.g.  
+
+
+{\tt \#include $<$eo\-Select\-From\-Worth.h$>$}
+
+Inheritance diagram for eo\-Select\-From\-Worth$<$ EOT, Worth\-Type $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.23699cm]{classeo_select_from_worth}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Select\-From\-Worth} ({\bf eo\-Perf2Worth}$<$ {\bf EOT}, Worth\-Type $>$ \&\_\-perf2Worth)\label{classeo_select_from_worth_a0}
+
+\item 
+virtual void {\bf setup} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&pop)\label{classeo_select_from_worth_a1}
+
+\begin{CompactList}\small\item\em virtual function to setup some population stats (for instance eo\-Proportional can benefit greatly from this) \item\end{CompactList}\end{CompactItemize}
+\subsection*{Protected Member Functions}
+\begin{CompactItemize}
+\item 
+void {\bf check\_\-sync} (unsigned index, const {\bf EOT} \&\_\-eo)\label{classeo_select_from_worth_b0}
+
+\end{CompactItemize}
+\subsection*{Protected Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Perf2Worth}$<$ {\bf EOT}, Worth\-Type $>$ \& {\bf perf2Worth}\label{classeo_select_from_worth_p0}
+
+\item 
+std::vector$<$ typename EOT::Fitness $>$ {\bf fitness}\label{classeo_select_from_worth_p1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT, class Worth\-Type = double$>$ class eo\-Select\-From\-Worth$<$ EOT, Worth\-Type $>$}
+
+selects one element from a population (is an {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})}) but the selection is based on a std::vector of Worth that is different from the fitnesses (e.g. 
+
+{\bf EO}{\rm (p.\,\pageref{class_e_o})} fitness is what Koza terms \char`\"{}raw fitness\char`\"{}, Worth is what the selection is based upon).
+
+see class {\bf eo\-Perf2Worth}{\rm (p.\,\pageref{classeo_perf2_worth})}: an {\bf eo\-Stat}{\rm (p.\,\pageref{classeo_stat})} that transforms fitnesses into Worthes
+
+Note: Worthes will not always be doubles - see some multi-objective techniques where it is a std::pair of doubles ...
+
+It has to have a $<$ operator it you want to call an existing selector (see selector.h) - but of course you can write the whole thing ... 
+
+
+
+Definition at line 51 of file eo\-Select\-From\-Worth.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Select\-From\-Worth.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_select_many.eps b/trunk/paradiseo-eo/doc/latex/classeo_select_many.eps
new file mode 100644
index 000000000..577c69652
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_select_many.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 98.2801
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.0875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSelectMany< EOT >) cw
+(eoSelect< EOT >) cw
+(eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< const eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSelectMany< EOT >) 0.5 0 box
+ (eoSelect< EOT >) 0.5 1 box
+ (eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< const eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_select_many.tex b/trunk/paradiseo-eo/doc/latex/classeo_select_many.tex
new file mode 100644
index 000000000..c0771497c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_select_many.tex
@@ -0,0 +1,72 @@
+\section{eo\-Select\-Many$<$ EOT $>$ Class Template Reference}
+\label{classeo_select_many}\index{eoSelectMany@{eoSelectMany}}
+eo\-Select\-Many selects many individuals using {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} as it's mechanism.  
+
+
+{\tt \#include $<$eo\-Select\-Many.h$>$}
+
+Inheritance diagram for eo\-Select\-Many$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.75184cm]{classeo_select_many}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Select\-Many} ({\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \&\_\-select, double \_\-rate, bool \_\-interpret\_\-as\_\-rate=true)\label{classeo_select_many_a0}
+
+\begin{CompactList}\small\item\em init \item\end{CompactList}\item 
+{\bf eo\-Select\-Many} ({\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \&\_\-select, {\bf eo\-How\-Many} \_\-how\-Many)\label{classeo_select_many_a1}
+
+\item 
+virtual void {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-source, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-dest)
+\begin{CompactList}\small\item\em The implementation repeatidly selects an individual. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \& {\bf select}\label{classeo_select_many_r0}
+
+\item 
+{\bf eo\-How\-Many} {\bf how\-Many}\label{classeo_select_many_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Select\-Many$<$ EOT $>$}
+
+eo\-Select\-Many selects many individuals using {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} as it's mechanism. 
+
+Therefore eo\-Select\-Many needs an {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} in its ctor
+
+It will use an eo\-How\-Mnay to determine the number of guys to select, and push them to the back of the destination population. 
+
+
+
+Definition at line 45 of file eo\-Select\-Many.h.
+
+\subsection{Member Function Documentation}
+\index{eoSelectMany@{eo\-Select\-Many}!operator()@{operator()}}
+\index{operator()@{operator()}!eoSelectMany@{eo\-Select\-Many}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ virtual void {\bf eo\-Select\-Many}$<$ {\bf EOT} $>$::operator() (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\em \_\-source}, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\em \_\-dest})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_select_many_a2}
+
+
+The implementation repeatidly selects an individual. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-source}]the source population \item[{\em \_\-dest}]the resulting population (size of this population is the number of times {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} is called. It empties the destination and adds the selection into it) \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-BF$<$ const eo\-Pop$<$ EOT $>$ \&, eo\-Pop$<$ EOT $>$ \&, void $>$} {\rm (p.\,\pageref{classeo_b_f_a1})}.
+
+Definition at line 63 of file eo\-Select\-Many.h.
+
+References eo\-Select\-One$<$ EOT, Worth\-T $>$::setup().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Select\-Many.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_select_number.eps b/trunk/paradiseo-eo/doc/latex/classeo_select_number.eps
new file mode 100644
index 000000000..3274b73b5
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_select_number.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 98.2801
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.0875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSelectNumber< EOT >) cw
+(eoSelect< EOT >) cw
+(eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< const eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSelectNumber< EOT >) 0.5 0 box
+ (eoSelect< EOT >) 0.5 1 box
+ (eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< const eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_select_number.tex b/trunk/paradiseo-eo/doc/latex/classeo_select_number.tex
new file mode 100644
index 000000000..c621931ff
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_select_number.tex
@@ -0,0 +1,69 @@
+\section{eo\-Select\-Number$<$ EOT $>$ Class Template Reference}
+\label{classeo_select_number}\index{eoSelectNumber@{eoSelectNumber}}
+eo\-Select\-Number selects many individuals using {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} as it's mechanism.  
+
+
+{\tt \#include $<$eo\-Select\-Number.h$>$}
+
+Inheritance diagram for eo\-Select\-Number$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.75184cm]{classeo_select_number}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Select\-Number} ({\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \&\_\-select, unsigned \_\-nb\_\-to\_\-select=1)\label{classeo_select_number_a0}
+
+\begin{CompactList}\small\item\em init \item\end{CompactList}\item 
+virtual void {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-source, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-dest)
+\begin{CompactList}\small\item\em The implementation repeatidly selects an individual. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \& {\bf select}\label{classeo_select_number_r0}
+
+\item 
+unsigned {\bf nb\_\-to\_\-select}\label{classeo_select_number_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Select\-Number$<$ EOT $>$}
+
+eo\-Select\-Number selects many individuals using {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} as it's mechanism. 
+
+Therefore eo\-Select\-Number needs an {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} in its ctor
+
+It will select a fixed number of individuals and pushes them to the back of the destination population. 
+
+
+
+Definition at line 42 of file eo\-Select\-Number.h.
+
+\subsection{Member Function Documentation}
+\index{eoSelectNumber@{eo\-Select\-Number}!operator()@{operator()}}
+\index{operator()@{operator()}!eoSelectNumber@{eo\-Select\-Number}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ virtual void {\bf eo\-Select\-Number}$<$ {\bf EOT} $>$::operator() (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\em \_\-source}, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\em \_\-dest})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_select_number_a1}
+
+
+The implementation repeatidly selects an individual. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-source}]the source population \item[{\em \_\-dest}]the resulting population (size of this population is the number of times {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} is called. It empties the destination and adds the selection into it) \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-BF$<$ const eo\-Pop$<$ EOT $>$ \&, eo\-Pop$<$ EOT $>$ \&, void $>$} {\rm (p.\,\pageref{classeo_b_f_a1})}.
+
+Definition at line 55 of file eo\-Select\-Number.h.
+
+References eo\-Select\-One$<$ EOT, Worth\-T $>$::setup().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Select\-Number.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_select_one.eps b/trunk/paradiseo-eo/doc/latex/classeo_select_one.eps
new file mode 100644
index 000000000..c86a8c29f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_select_one.eps
@@ -0,0 +1,209 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 86.7052
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.76667 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 3 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSelectOne< EOT, WorthT >) cw
+(eoUF< const eoPop< EOT > &, const EOT & >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, const EOT & >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSelectOne< EOT, WorthT >) 0.5 0 box
+ (eoUF< const eoPop< EOT > &, const EOT & >) 0.5 1 box
+ (eoFunctorBase) 0 2 box
+ (unary_function< const eoPop< EOT > &, const EOT & >) 1 2 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_select_one.tex b/trunk/paradiseo-eo/doc/latex/classeo_select_one.tex
new file mode 100644
index 000000000..e231d6e9b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_select_one.tex
@@ -0,0 +1,39 @@
+\section{eo\-Select\-One$<$ EOT, Worth\-T $>$ Class Template Reference}
+\label{classeo_select_one}\index{eoSelectOne@{eoSelectOne}}
+eo\-Select\-One selects only one element from a whole population.  
+
+
+{\tt \#include $<$eo\-Select\-One.h$>$}
+
+Inheritance diagram for eo\-Select\-One$<$ EOT, Worth\-T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.42775cm]{classeo_select_one}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual void {\bf setup} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_select_one_a0}
+
+\begin{CompactList}\small\item\em virtual function to setup some population stats (for instance eo\-Proportional can benefit greatly from this) \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT, class Worth\-T = typename EOT::Fitness$>$ class eo\-Select\-One$<$ EOT, Worth\-T $>$}
+
+eo\-Select\-One selects only one element from a whole population. 
+
+Most selection techniques are simply repeated applications of eo\-Select\-One.
+
+\begin{Desc}
+\item[See also:]{\bf eo\-Select\-Many}{\rm (p.\,\pageref{classeo_select_many})}, eo\-Select\-Random, eo\-Det\-Tournament, eo\-Stoch\-Tournament, eo\-Proportional \end{Desc}
+
+
+
+
+Definition at line 45 of file eo\-Select\-One.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Select\-One.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_select_perc.eps b/trunk/paradiseo-eo/doc/latex/classeo_select_perc.eps
new file mode 100644
index 000000000..c00db7dc8
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_select_perc.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 98.2801
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.0875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSelectPerc< EOT >) cw
+(eoSelect< EOT >) cw
+(eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< const eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSelectPerc< EOT >) 0.5 0 box
+ (eoSelect< EOT >) 0.5 1 box
+ (eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< const eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_select_perc.tex b/trunk/paradiseo-eo/doc/latex/classeo_select_perc.tex
new file mode 100644
index 000000000..b5f39a53c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_select_perc.tex
@@ -0,0 +1,69 @@
+\section{eo\-Select\-Perc$<$ EOT $>$ Class Template Reference}
+\label{classeo_select_perc}\index{eoSelectPerc@{eoSelectPerc}}
+eo\-Select\-Perc selects many individuals using {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} as it's mechanism.  
+
+
+{\tt \#include $<$eo\-Select\-Perc.h$>$}
+
+Inheritance diagram for eo\-Select\-Perc$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.75184cm]{classeo_select_perc}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Select\-Perc} ({\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \&\_\-select, float \_\-rate=1.0)\label{classeo_select_perc_a0}
+
+\begin{CompactList}\small\item\em init \item\end{CompactList}\item 
+virtual void {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-source, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-dest)
+\begin{CompactList}\small\item\em The implementation selects a percentage. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \& {\bf select}\label{classeo_select_perc_r0}
+
+\item 
+float {\bf rate}\label{classeo_select_perc_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Select\-Perc$<$ EOT $>$}
+
+eo\-Select\-Perc selects many individuals using {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} as it's mechanism. 
+
+Therefore eo\-Select\-Perc needs an {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} in its ctor
+
+It will select floor(rate$\ast$pop.size()) individuals and pushes them to the back of the destination population. 
+
+
+
+Definition at line 42 of file eo\-Select\-Perc.h.
+
+\subsection{Member Function Documentation}
+\index{eoSelectPerc@{eo\-Select\-Perc}!operator()@{operator()}}
+\index{operator()@{operator()}!eoSelectPerc@{eo\-Select\-Perc}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ virtual void {\bf eo\-Select\-Perc}$<$ {\bf EOT} $>$::operator() (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\em \_\-source}, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\em \_\-dest})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_select_perc_a1}
+
+
+The implementation selects a percentage. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-source}]the source population \item[{\em \_\-dest}]the resulting population (size of this population is the number of times {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} is called. It empties the destination and adds the selection into it) \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-BF$<$ const eo\-Pop$<$ EOT $>$ \&, eo\-Pop$<$ EOT $>$ \&, void $>$} {\rm (p.\,\pageref{classeo_b_f_a1})}.
+
+Definition at line 55 of file eo\-Select\-Perc.h.
+
+References eo\-Select\-One$<$ EOT, Worth\-T $>$::setup().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Select\-Perc.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_select_transform.eps b/trunk/paradiseo-eo/doc/latex/classeo_select_transform.eps
new file mode 100644
index 000000000..24316cc63
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_select_transform.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 98.2801
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.0875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSelectTransform< EOT >) cw
+(eoBreed< EOT >) cw
+(eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< const eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSelectTransform< EOT >) 0.5 0 box
+ (eoBreed< EOT >) 0.5 1 box
+ (eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< const eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_select_transform.tex b/trunk/paradiseo-eo/doc/latex/classeo_select_transform.tex
new file mode 100644
index 000000000..590b0f218
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_select_transform.tex
@@ -0,0 +1,47 @@
+\section{eo\-Select\-Transform$<$ EOT $>$ Class Template Reference}
+\label{classeo_select_transform}\index{eoSelectTransform@{eoSelectTransform}}
+Embedded select, followed by an embedded transform.  
+
+
+{\tt \#include $<$eo\-Breed.h$>$}
+
+Inheritance diagram for eo\-Select\-Transform$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.75184cm]{classeo_select_transform}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Select\-Transform} ({\bf eo\-Select}$<$ {\bf EOT} $>$ \&\_\-select, {\bf eo\-Transform}$<$ {\bf EOT} $>$ \&\_\-transform)\label{classeo_select_transform_a0}
+
+\item 
+void {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-parents, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-offspring)\label{classeo_select_transform_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Select}$<$ {\bf EOT} $>$ \& {\bf select}\label{classeo_select_transform_r0}
+
+\item 
+{\bf eo\-Transform}$<$ {\bf EOT} $>$ \& {\bf transform}\label{classeo_select_transform_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Select\-Transform$<$ EOT $>$}
+
+Embedded select, followed by an embedded transform. 
+
+Special breeder that is just an application of an embedded select, followed by an embedded transform 
+
+
+
+Definition at line 57 of file eo\-Breed.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Breed.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_selective_populator.eps b/trunk/paradiseo-eo/doc/latex/classeo_selective_populator.eps
new file mode 100644
index 000000000..1431f0351
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_selective_populator.eps
@@ -0,0 +1,197 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 211.64
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.3625 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 2 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSelectivePopulator< EOT >) cw
+(eoPopulator< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSelectivePopulator< EOT >) 0 0 box
+ (eoPopulator< EOT >) 0 1 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_selective_populator.tex b/trunk/paradiseo-eo/doc/latex/classeo_selective_populator.tex
new file mode 100644
index 000000000..b47da81f9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_selective_populator.tex
@@ -0,0 +1,44 @@
+\section{eo\-Selective\-Populator$<$ EOT $>$ Class Template Reference}
+\label{classeo_selective_populator}\index{eoSelectivePopulator@{eoSelectivePopulator}}
+Selective\-Populator an eo\-Poplator that uses an {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} to select guys.  
+
+
+{\tt \#include $<$eo\-Populator.h$>$}
+
+Inheritance diagram for eo\-Selective\-Populator$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2cm]{classeo_selective_populator}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Selective\-Populator} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-dest, {\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \&\_\-sel)\label{classeo_selective_populator_a0}
+
+\item 
+const {\bf EOT} \& {\bf select} ()\label{classeo_selective_populator_a1}
+
+\begin{CompactList}\small\item\em the select method actually selects one guy from the src pop \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \& {\bf sel}\label{classeo_selective_populator_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Selective\-Populator$<$ EOT $>$}
+
+Selective\-Populator an eo\-Poplator that uses an {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} to select guys. 
+
+Supposedly, it is passed the initial population. 
+
+
+
+Definition at line 184 of file eo\-Populator.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Populator.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_seq_populator.eps b/trunk/paradiseo-eo/doc/latex/classeo_seq_populator.eps
new file mode 100644
index 000000000..e989a89c7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_seq_populator.eps
@@ -0,0 +1,197 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 253.165
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.975 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 2 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSeqPopulator< EOT >) cw
+(eoPopulator< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSeqPopulator< EOT >) 0 0 box
+ (eoPopulator< EOT >) 0 1 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_seq_populator.tex b/trunk/paradiseo-eo/doc/latex/classeo_seq_populator.tex
new file mode 100644
index 000000000..d0222c45c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_seq_populator.tex
@@ -0,0 +1,42 @@
+\section{eo\-Seq\-Populator$<$ EOT $>$ Class Template Reference}
+\label{classeo_seq_populator}\index{eoSeqPopulator@{eoSeqPopulator}}
+Seq\-Populator: an {\bf eo\-Populator}{\rm (p.\,\pageref{classeo_populator})} that sequentially goes through the population is supposed to be used after a batch select of a whole bunch or genitors.  
+
+
+{\tt \#include $<$eo\-Populator.h$>$}
+
+Inheritance diagram for eo\-Seq\-Populator$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2cm]{classeo_seq_populator}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Seq\-Populator} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-dest)\label{classeo_seq_populator_a0}
+
+\item 
+const {\bf EOT} \& {\bf select} (void)\label{classeo_seq_populator_a1}
+
+\begin{CompactList}\small\item\em the select method simply returns next individual in the src pop \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf current}\label{classeo_seq_populator_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Seq\-Populator$<$ EOT $>$}
+
+Seq\-Populator: an {\bf eo\-Populator}{\rm (p.\,\pageref{classeo_populator})} that sequentially goes through the population is supposed to be used after a batch select of a whole bunch or genitors. 
+
+
+
+Definition at line 152 of file eo\-Populator.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Populator.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_sequential_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_sequential_op.eps
new file mode 100644
index 000000000..27e3da8f2
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_sequential_op.eps
@@ -0,0 +1,227 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 113.766
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.395 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSequentialOp< EOT >) cw
+(eoOpContainer< EOT >) cw
+(eoGenOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoUF< eoPopulator< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< eoPopulator< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSequentialOp< EOT >) 0.5 0 box
+ (eoOpContainer< EOT >) 0.5 1 box
+ (eoGenOp< EOT >) 0.5 2 box
+ (eoOp< EOT >) 0 3 box
+ (eoUF< eoPopulator< EOT > &, void >) 1 3 box
+ (eoFunctorBase) 0.5 4 box
+ (unary_function< eoPopulator< EOT > &, void >) 1.5 4 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+0 1 3 out
+solid
+0.5 1.5 4 conn
+solid
+1 0.5 4 in
+solid
+1 1.5 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_sequential_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_sequential_op.tex
new file mode 100644
index 000000000..8a8d82d41
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_sequential_op.tex
@@ -0,0 +1,51 @@
+\section{eo\-Sequential\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_sequential_op}\index{eoSequentialOp@{eoSequentialOp}}
+Sequential selection: note the mark, rewind, unmark cycle here operators are repeatedly applied on the same individual(s) not all too elegant, but it sort of works...  
+
+
+{\tt \#include $<$eo\-Op\-Container.h$>$}
+
+Inheritance diagram for eo\-Sequential\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.18544cm]{classeo_sequential_op}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef unsigned {\bf position\_\-type}\label{classeo_sequential_op_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+void {\bf apply} ({\bf eo\-Populator}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_sequential_op_a0}
+
+\begin{CompactList}\small\item\em the function that will do the work \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_sequential_op_a1}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+std::vector$<$ size\_\-t $>$ {\bf to\_\-apply}\label{classeo_sequential_op_r0}
+
+\item 
+std::vector$<$ size\_\-t $>$ {\bf production}\label{classeo_sequential_op_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Sequential\-Op$<$ EOT $>$}
+
+Sequential selection: note the mark, rewind, unmark cycle here operators are repeatedly applied on the same individual(s) not all too elegant, but it sort of works... 
+
+
+
+Definition at line 88 of file eo\-Op\-Container.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Op\-Container.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_sequential_select.eps b/trunk/paradiseo-eo/doc/latex/classeo_sequential_select.eps
new file mode 100644
index 000000000..a98df7206
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_sequential_select.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 115.607
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.325 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSequentialSelect< EOT >) cw
+(eoSelectOne< EOT >) cw
+(eoUF< const eoPop< EOT > &, const EOT & >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, const EOT & >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSequentialSelect< EOT >) 0.5 0 box
+ (eoSelectOne< EOT >) 0.5 1 box
+ (eoUF< const eoPop< EOT > &, const EOT & >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< const eoPop< EOT > &, const EOT & >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_sequential_select.tex b/trunk/paradiseo-eo/doc/latex/classeo_sequential_select.tex
new file mode 100644
index 000000000..f6adc902e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_sequential_select.tex
@@ -0,0 +1,55 @@
+\section{eo\-Sequential\-Select$<$ EOT $>$ Class Template Reference}
+\label{classeo_sequential_select}\index{eoSequentialSelect@{eoSequentialSelect}}
+All Individuals in order.  
+
+
+{\tt \#include $<$eo\-Sequential\-Select.h$>$}
+
+Inheritance diagram for eo\-Sequential\-Select$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.23699cm]{classeo_sequential_select}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Sequential\-Select} (bool \_\-ordered=true)\label{classeo_sequential_select_a0}
+
+\begin{CompactList}\small\item\em Ctor: sets the current pter to numeric\_\-limits$<$unsigned$>$::max() so init will take place first time not very elegant, maybe ... \item\end{CompactList}\item 
+void {\bf setup} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_sequential_select_a1}
+
+\begin{CompactList}\small\item\em virtual function to setup some population stats (for instance eo\-Proportional can benefit greatly from this) \item\end{CompactList}\item 
+virtual const {\bf EOT} \& {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_sequential_select_a2}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+bool {\bf ordered}\label{classeo_sequential_select_r0}
+
+\item 
+unsigned {\bf current}\label{classeo_sequential_select_r1}
+
+\item 
+std::vector$<$ const {\bf EOT} $\ast$ $>$ {\bf eo\-Pters}\label{classeo_sequential_select_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Sequential\-Select$<$ EOT $>$}
+
+All Individuals in order. 
+
+Looping back to the beginning when exhausted, can be from best to worse, or in random order.
+
+It is the {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} equivalent of {\bf eo\-Det\-Select}{\rm (p.\,\pageref{classeo_det_select})} - though {\bf eo\-Det\-Select}{\rm (p.\,\pageref{classeo_det_select})} always returns individuals from best to worst 
+
+
+
+Definition at line 52 of file eo\-Sequential\-Select.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Sequential\-Select.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_sharing.eps b/trunk/paradiseo-eo/doc/latex/classeo_sharing.eps
new file mode 100644
index 000000000..629e04414
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_sharing.eps
@@ -0,0 +1,227 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 90.0901
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.55 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSharing< EOT >) cw
+(eoPerf2Worth< EOT >) cw
+(eoUF< const eoPop< EOT > &, void >) cw
+(eoValueParam< std::vector< double > >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, void >) cw
+(eoParam) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSharing< EOT >) 1.25 0 box
+ (eoPerf2Worth< EOT >) 1.25 1 box
+ (eoUF< const eoPop< EOT > &, void >) 0.5 2 box
+ (eoValueParam< std::vector< double > >) 2 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< const eoPop< EOT > &, void >) 1 3 box
+ (eoParam) 2 3 box
+
+% ----- relations -----
+
+solid
+0 1.25 0 out
+solid
+1 1.25 1 in
+solid
+0 1.25 1 out
+solid
+0.5 2 2 conn
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 2 2 in
+solid
+0 2 2 out
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+1 2 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_sharing.tex b/trunk/paradiseo-eo/doc/latex/classeo_sharing.tex
new file mode 100644
index 000000000..6cebaf38c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_sharing.tex
@@ -0,0 +1,45 @@
+\section{eo\-Sharing$<$ EOT $>$ Class Template Reference}
+\label{classeo_sharing}\index{eoSharing@{eoSharing}}
+Sharing is a perf2worth class that implements Goldberg and Richardson's basic sharing see {\bf eo\-Sharing\-Select}{\rm (p.\,\pageref{classeo_sharing_select})} for how to use it and test/t-eo\-Sharing.cpp for a sample use of both.  
+
+
+{\tt \#include $<$eo\-Sharing.h$>$}
+
+Inheritance diagram for eo\-Sharing$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.52252cm]{classeo_sharing}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Sharing} (double \_\-niche\-Size, {\bf eo\-Distance}$<$ {\bf EOT} $>$ \&\_\-dist)\label{classeo_sharing_a0}
+
+\item 
+void {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_sharing_a1}
+
+\begin{CompactList}\small\item\em Computes shared fitnesses. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf niche\-Size}\label{classeo_sharing_r0}
+
+\item 
+{\bf eo\-Distance}$<$ {\bf EOT} $>$ \& {\bf dist}\label{classeo_sharing_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Sharing$<$ EOT $>$}
+
+Sharing is a perf2worth class that implements Goldberg and Richardson's basic sharing see {\bf eo\-Sharing\-Select}{\rm (p.\,\pageref{classeo_sharing_select})} for how to use it and test/t-eo\-Sharing.cpp for a sample use of both. 
+
+
+
+Definition at line 79 of file eo\-Sharing.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Sharing.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_sharing_select.eps b/trunk/paradiseo-eo/doc/latex/classeo_sharing_select.eps
new file mode 100644
index 000000000..250161a2f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_sharing_select.eps
@@ -0,0 +1,227 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 173.41
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.88333 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 6 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSharingSelect< EOT >) cw
+(eoRouletteWorthSelect< EOT, double >) cw
+(eoSelectFromWorth< EOT, double >) cw
+(eoSelectOne< EOT >) cw
+(eoUF< const eoPop< EOT > &, const EOT & >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, const EOT & >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSharingSelect< EOT >) 0.5 0 box
+ (eoRouletteWorthSelect< EOT, double >) 0.5 1 box
+ (eoSelectFromWorth< EOT, double >) 0.5 2 box
+ (eoSelectOne< EOT >) 0.5 3 box
+ (eoUF< const eoPop< EOT > &, const EOT & >) 0.5 4 box
+ (eoFunctorBase) 0 5 box
+ (unary_function< const eoPop< EOT > &, const EOT & >) 1 5 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+1 0.5 3 in
+solid
+0 0.5 3 out
+solid
+1 0.5 4 in
+solid
+0 0.5 4 out
+solid
+0 1 5 conn
+solid
+1 0 5 in
+solid
+1 1 5 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_sharing_select.tex b/trunk/paradiseo-eo/doc/latex/classeo_sharing_select.tex
new file mode 100644
index 000000000..a4130d2ac
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_sharing_select.tex
@@ -0,0 +1,57 @@
+\section{eo\-Sharing\-Select$<$ EOT $>$ Class Template Reference}
+\label{classeo_sharing_select}\index{eoSharingSelect@{eoSharingSelect}}
+eo\-Sharing\-Select: select an individual by roulette wheel on its SHARED fitness.  
+
+
+{\tt \#include $<$eo\-Sharing\-Select.h$>$}
+
+Inheritance diagram for eo\-Sharing\-Select$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4.85549cm]{classeo_sharing_select}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Sharing\-Select} (double \_\-sigma, {\bf eo\-Distance}$<$ {\bf EOT} $>$ \&\_\-dist)
+\begin{CompactList}\small\item\em Ctor:. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Sharing}$<$ {\bf EOT} $>$ {\bf sharing}\label{classeo_sharing_select_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Sharing\-Select$<$ EOT $>$}
+
+eo\-Sharing\-Select: select an individual by roulette wheel on its SHARED fitness. 
+
+It is an {\bf eo\-Roulette\-Worth\-Select}{\rm (p.\,\pageref{classeo_roulette_worth_select})}, i.e. a selector using a std::vector of worthes rather than the raw fitness (see {\bf eo\-Select\-From\-Worth.h}{\rm (p.\,\pageref{eo_select_from_worth_8h})}) It uses an internal {\bf eo\-Sharing}{\rm (p.\,\pageref{classeo_sharing})} object which is an {\bf eo\-Perf2Worth$<$EOT, double$>$}{\rm (p.\,\pageref{classeo_perf2_worth})} 
+
+
+
+Definition at line 43 of file eo\-Sharing\-Select.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoSharingSelect@{eo\-Sharing\-Select}!eoSharingSelect@{eoSharingSelect}}
+\index{eoSharingSelect@{eoSharingSelect}!eoSharingSelect@{eo\-Sharing\-Select}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Sharing\-Select}$<$ {\bf EOT} $>$::{\bf eo\-Sharing\-Select} (double {\em \_\-sigma}, {\bf eo\-Distance}$<$ {\bf EOT} $>$ \& {\em \_\-dist})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_sharing_select_a0}
+
+
+Ctor:. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-s}]the sigma\_\-share \end{description}
+\end{Desc}
+
+
+Definition at line 49 of file eo\-Sharing\-Select.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Sharing\-Select.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_simple_e_d_a.eps b/trunk/paradiseo-eo/doc/latex/classeo_simple_e_d_a.eps
new file mode 100644
index 000000000..789180089
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_simple_e_d_a.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 132.45
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.775 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSimpleEDA< EOT >) cw
+(eoEDA< EOT >) cw
+(eoUF< eoDistribution< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< eoDistribution< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSimpleEDA< EOT >) 0.5 0 box
+ (eoEDA< EOT >) 0.5 1 box
+ (eoUF< eoDistribution< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< eoDistribution< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_simple_e_d_a.tex b/trunk/paradiseo-eo/doc/latex/classeo_simple_e_d_a.tex
new file mode 100644
index 000000000..1837e47ce
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_simple_e_d_a.tex
@@ -0,0 +1,64 @@
+\section{eo\-Simple\-EDA$<$ EOT $>$ Class Template Reference}
+\label{classeo_simple_e_d_a}\index{eoSimpleEDA@{eoSimpleEDA}}
+eo\-Simple\-EDA: a very simple Estimation of Distribution Algorithm  
+
+
+{\tt \#include $<$eo\-Simple\-EDA.h$>$}
+
+Inheritance diagram for eo\-Simple\-EDA$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.70861cm]{classeo_simple_e_d_a}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Simple\-EDA} ({\bf eo\-Distrib\-Updater}$<$ {\bf EOT} $>$ \&\_\-update, {\bf eo\-Eval\-Func}$<$ {\bf EOT} $>$ \&\_\-eval, unsigned \_\-pop\-Size, {\bf eo\-Continue}$<$ {\bf EOT} $>$ \&\_\-continuator)
+\begin{CompactList}\small\item\em Ctor from an {\bf eo\-Distrib\-Updater}{\rm (p.\,\pageref{classeo_distrib_updater})} ... \item\end{CompactList}\item 
+virtual void {\bf operator()} ({\bf eo\-Distribution}$<$ {\bf EOT} $>$ \&\_\-distrib)\label{classeo_simple_e_d_a_a1}
+
+\begin{CompactList}\small\item\em The algorithm: generate pop from distrib, evaluate pop, update distrib. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Distrib\-Updater}$<$ {\bf EOT} $>$ \& {\bf update}\label{classeo_simple_e_d_a_r0}
+
+\item 
+{\bf eo\-Eval\-Func}$<$ {\bf EOT} $>$ \& {\bf eval}\label{classeo_simple_e_d_a_r1}
+
+\item 
+unsigned {\bf pop\-Size}\label{classeo_simple_e_d_a_r2}
+
+\item 
+{\bf eo\-Continue}$<$ {\bf EOT} $>$ \& {\bf continuator}\label{classeo_simple_e_d_a_r3}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Simple\-EDA$<$ EOT $>$}
+
+eo\-Simple\-EDA: a very simple Estimation of Distribution Algorithm 
+
+The algorithm that evolves a probability distribution on the spaces of populations with the loop generate a population from the current distribution evaluate that population update the distribution 
+
+
+
+Definition at line 46 of file eo\-Simple\-EDA.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoSimpleEDA@{eo\-Simple\-EDA}!eoSimpleEDA@{eoSimpleEDA}}
+\index{eoSimpleEDA@{eoSimpleEDA}!eoSimpleEDA@{eo\-Simple\-EDA}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Simple\-EDA}$<$ {\bf EOT} $>$::{\bf eo\-Simple\-EDA} ({\bf eo\-Distrib\-Updater}$<$ {\bf EOT} $>$ \& {\em \_\-update}, {\bf eo\-Eval\-Func}$<$ {\bf EOT} $>$ \& {\em \_\-eval}, unsigned {\em \_\-pop\-Size}, {\bf eo\-Continue}$<$ {\bf EOT} $>$ \& {\em \_\-continuator})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_simple_e_d_a_a0}
+
+
+Ctor from an {\bf eo\-Distrib\-Updater}{\rm (p.\,\pageref{classeo_distrib_updater})} ... 
+
+plus an eo\-Eval and {\bf eo\-Continue}{\rm (p.\,\pageref{classeo_continue})} of course 
+
+Definition at line 53 of file eo\-Simple\-EDA.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Simple\-EDA.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_sorted_pop_stat.eps b/trunk/paradiseo-eo/doc/latex/classeo_sorted_pop_stat.eps
new file mode 100644
index 000000000..9c67bd5aa
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_sorted_pop_stat.eps
@@ -0,0 +1,233 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 91.3242
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.475 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSortedPopStat< EOT >) cw
+(eoSortedStat< EOT, std::string >) cw
+(eoSortedStatBase< EOT >) cw
+(eoValueParam< std::string >) cw
+(eoUF< const std::vector< const EOT * > &, void >) cw
+(eoParam) cw
+(eoFunctorBase) cw
+(unary_function< const std::vector< const EOT * > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSortedPopStat< EOT >) 1 0 box
+ (eoSortedStat< EOT, std::string >) 1 1 box
+ (eoSortedStatBase< EOT >) 0.5 2 box
+ (eoValueParam< std::string >) 1.5 2 box
+ (eoUF< const std::vector< const EOT * > &, void >) 0.5 3 box
+ (eoParam) 1.5 3 box
+ (eoFunctorBase) 0 4 box
+ (unary_function< const std::vector< const EOT * > &, void >) 1 4 box
+
+% ----- relations -----
+
+solid
+0 1 0 out
+solid
+1 1 1 in
+solid
+0 1 1 out
+solid
+0.5 1.5 2 conn
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+1 1.5 2 in
+solid
+0 1.5 2 out
+solid
+1 0.5 3 in
+solid
+0 0.5 3 out
+solid
+0 1 4 conn
+solid
+1 1.5 3 in
+solid
+1 0 4 in
+solid
+1 1 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_sorted_pop_stat.tex b/trunk/paradiseo-eo/doc/latex/classeo_sorted_pop_stat.tex
new file mode 100644
index 000000000..c08d93307
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_sorted_pop_stat.tex
@@ -0,0 +1,73 @@
+\section{eo\-Sorted\-Pop\-Stat$<$ EOT $>$ Class Template Reference}
+\label{classeo_sorted_pop_stat}\index{eoSortedPopStat@{eoSortedPopStat}}
+Thanks to MS/VC++, {\bf eo\-Param}{\rm (p.\,\pageref{classeo_param})} mechanism is unable to handle std::vectors of stats.  
+
+
+{\tt \#include $<$eo\-Pop\-Stat.h$>$}
+
+Inheritance diagram for eo\-Sorted\-Pop\-Stat$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.55708cm]{classeo_sorted_pop_stat}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Sorted\-Pop\-Stat} (unsigned \_\-how\-Many=0, std::string \_\-desc=\char`\"{}\char`\"{})
+\begin{CompactList}\small\item\em default Ctor, void std::string by default, as it appears on the description line once at beginning of evolution. \item\end{CompactList}\item 
+void {\bf operator()} (const std::vector$<$ const {\bf EOT} $\ast$ $>$ \&\_\-pop)
+\begin{CompactList}\small\item\em Fills the {\bf value()}{\rm (p.\,\pageref{classeo_value_param_a2})} of the {\bf eo\-Param}{\rm (p.\,\pageref{classeo_param})} with the dump of the population. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf combien}\label{classeo_sorted_pop_stat_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Sorted\-Pop\-Stat$<$ EOT $>$}
+
+Thanks to MS/VC++, {\bf eo\-Param}{\rm (p.\,\pageref{classeo_param})} mechanism is unable to handle std::vectors of stats. 
+
+This snippet is a workaround: This class will \char`\"{}print\char`\"{} a whole population into a std::string - that you can later send to any stream This is the Sorted version - see eo\-Pop\-String for the plain version
+
+Note: this Stat should probably be used only within eo\-Std\-Out\-Monitor, and not inside an {\bf eo\-File\-Monitor}{\rm (p.\,\pageref{classeo_file_monitor})}, as the {\bf eo\-State}{\rm (p.\,\pageref{classeo_state})} construct will work much better there. 
+
+
+
+Definition at line 96 of file eo\-Pop\-Stat.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoSortedPopStat@{eo\-Sorted\-Pop\-Stat}!eoSortedPopStat@{eoSortedPopStat}}
+\index{eoSortedPopStat@{eoSortedPopStat}!eoSortedPopStat@{eo\-Sorted\-Pop\-Stat}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Sorted\-Pop\-Stat}$<$ {\bf EOT} $>$::{\bf eo\-Sorted\-Pop\-Stat} (unsigned {\em \_\-how\-Many} = {\tt 0}, std::string {\em \_\-desc} = {\tt \char`\"{}\char`\"{}})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_sorted_pop_stat_a0}
+
+
+default Ctor, void std::string by default, as it appears on the description line once at beginning of evolution. 
+
+and is meaningless there \_\-how\-Many defaults to 0, that is, the whole population 
+
+Definition at line 107 of file eo\-Pop\-Stat.h.
+
+\subsection{Member Function Documentation}
+\index{eoSortedPopStat@{eo\-Sorted\-Pop\-Stat}!operator()@{operator()}}
+\index{operator()@{operator()}!eoSortedPopStat@{eo\-Sorted\-Pop\-Stat}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ void {\bf eo\-Sorted\-Pop\-Stat}$<$ {\bf EOT} $>$::operator() (const std::vector$<$ const {\bf EOT} $\ast$ $>$ \& {\em \_\-pop})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_sorted_pop_stat_a1}
+
+
+Fills the {\bf value()}{\rm (p.\,\pageref{classeo_value_param_a2})} of the {\bf eo\-Param}{\rm (p.\,\pageref{classeo_param})} with the dump of the population. 
+
+Adds a \par
+ before so it does not get mixed up with the rest of the stats that are written by the monitor it is probably used from. 
+
+Implements {\bf eo\-UF$<$ const std::vector$<$ const EOT $\ast$ $>$ \&, void $>$} {\rm (p.\,\pageref{classeo_u_f_a1})}.
+
+Definition at line 116 of file eo\-Pop\-Stat.h.
+
+References eo\-Value\-Param$<$ std::string $>$::value().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Pop\-Stat.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_sorted_stat.eps b/trunk/paradiseo-eo/doc/latex/classeo_sorted_stat.eps
new file mode 100644
index 000000000..8ee8ce9c5
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_sorted_stat.eps
@@ -0,0 +1,227 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 73.0594
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 6.84375 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSortedStat< EOT, ParamType >) cw
+(eoSortedStatBase< EOT >) cw
+(eoValueParam< ParamType >) cw
+(eoUF< const std::vector< const EOT * > &, void >) cw
+(eoParam) cw
+(eoFunctorBase) cw
+(unary_function< const std::vector< const EOT * > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSortedStat< EOT, ParamType >) 1 0 box
+ (eoSortedStatBase< EOT >) 0.5 1 box
+ (eoValueParam< ParamType >) 1.5 1 box
+ (eoUF< const std::vector< const EOT * > &, void >) 0.5 2 box
+ (eoParam) 1.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< const std::vector< const EOT * > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 1 0 out
+solid
+0.5 1.5 1 conn
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 1.5 1 in
+solid
+0 1.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 1.5 2 in
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_sorted_stat.tex b/trunk/paradiseo-eo/doc/latex/classeo_sorted_stat.tex
new file mode 100644
index 000000000..0d8dce0a4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_sorted_stat.tex
@@ -0,0 +1,36 @@
+\section{eo\-Sorted\-Stat$<$ EOT, Param\-Type $>$ Class Template Reference}
+\label{classeo_sorted_stat}\index{eoSortedStat@{eoSortedStat}}
+The actual class that will be used as base for all statistics that need to be calculated over the sorted population It's an {\bf eo\-Sorted\-Stat\-Base}{\rm (p.\,\pageref{classeo_sorted_stat_base})} AND an {\bf eo\-Value\-Param}{\rm (p.\,\pageref{classeo_value_param})} so it can be used in Monitors.  
+
+
+{\tt \#include $<$eo\-Stat.h$>$}
+
+Inheritance diagram for eo\-Sorted\-Stat$<$ EOT, Param\-Type $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.04566cm]{classeo_sorted_stat}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Sorted\-Stat} (Param\-Type \_\-value, std::string \_\-desc)\label{classeo_sorted_stat_a0}
+
+\item 
+virtual std::string {\bf class\-Name} (void) const \label{classeo_sorted_stat_a1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT, class Param\-Type$>$ class eo\-Sorted\-Stat$<$ EOT, Param\-Type $>$}
+
+The actual class that will be used as base for all statistics that need to be calculated over the sorted population It's an {\bf eo\-Sorted\-Stat\-Base}{\rm (p.\,\pageref{classeo_sorted_stat_base})} AND an {\bf eo\-Value\-Param}{\rm (p.\,\pageref{classeo_value_param})} so it can be used in Monitors. 
+
+
+
+Definition at line 89 of file eo\-Stat.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Stat.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_sorted_stat_base.eps b/trunk/paradiseo-eo/doc/latex/classeo_sorted_stat_base.eps
new file mode 100644
index 000000000..611431a77
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_sorted_stat_base.eps
@@ -0,0 +1,267 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 45.6621
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 10.95 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 6 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSortedStatBase< EOT >) cw
+(eoUF< const std::vector< const EOT * > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< const std::vector< const EOT * > &, void >) cw
+(eoSortedStat< EOT, ParamType >) cw
+(eoSortedStat< EOT, EOT::Fitness >) cw
+(eoSortedStat< EOT, std::string >) cw
+(eoSortedStat< EOT, std::vector< double > >) cw
+(eoSortedStat< EOT, std::vector< FitT > >) cw
+(eoSortedStat< EOT, std::vector< PartFitT > >) cw
+(eoNthElementFitnessStat< EOT >) cw
+(eoSortedPopStat< EOT >) cw
+(eoScalarFitnessStat< EOT, FitT >) cw
+(eoFitnessStat< EOT, FitT >) cw
+(eoMOFitnessStat< EOT, PartFitT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSortedStatBase< EOT >) 2.5 2 box
+ (eoUF< const std::vector< const EOT * > &, void >) 2.5 3 box
+ (eoFunctorBase) 2 4 box
+ (unary_function< const std::vector< const EOT * > &, void >) 3 4 box
+ (eoSortedStat< EOT, ParamType >) 0 1 box
+ (eoSortedStat< EOT, EOT::Fitness >) 1 1 box
+ (eoSortedStat< EOT, std::string >) 2 1 box
+ (eoSortedStat< EOT, std::vector< double > >) 3 1 box
+ (eoSortedStat< EOT, std::vector< FitT > >) 4 1 box
+ (eoSortedStat< EOT, std::vector< PartFitT > >) 5 1 box
+ (eoNthElementFitnessStat< EOT >) 1 0 box
+ (eoSortedPopStat< EOT >) 2 0 box
+ (eoScalarFitnessStat< EOT, FitT >) 3 0 box
+ (eoFitnessStat< EOT, FitT >) 4 0 box
+ (eoMOFitnessStat< EOT, PartFitT >) 5 0 box
+
+% ----- relations -----
+
+solid
+0 2.5 2 out
+solid
+1 2.5 3 in
+solid
+0 2.5 3 out
+solid
+2 3 4 conn
+solid
+1 2 4 in
+solid
+1 3 4 in
+solid
+1 2.5 1.25 out
+solid
+0 5 2 conn
+solid
+0 0 1.75 in
+solid
+0 1 1.75 in
+solid
+1 1 0.25 out
+solid
+0 2 1.75 in
+solid
+1 2 0.25 out
+solid
+0 3 1.75 in
+solid
+1 3 0.25 out
+solid
+0 4 1.75 in
+solid
+1 4 0.25 out
+solid
+0 5 1.75 in
+solid
+1 5 0.25 out
+solid
+0 1 0.75 in
+solid
+0 2 0.75 in
+solid
+0 3 0.75 in
+solid
+0 4 0.75 in
+solid
+0 5 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_sorted_stat_base.tex b/trunk/paradiseo-eo/doc/latex/classeo_sorted_stat_base.tex
new file mode 100644
index 000000000..387c4d6a5
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_sorted_stat_base.tex
@@ -0,0 +1,36 @@
+\section{eo\-Sorted\-Stat\-Base$<$ EOT $>$ Class Template Reference}
+\label{classeo_sorted_stat_base}\index{eoSortedStatBase@{eoSortedStatBase}}
+Base class for statistics calculated over a sorted snapshot of the population.  
+
+
+{\tt \#include $<$eo\-Stat.h$>$}
+
+Inheritance diagram for eo\-Sorted\-Stat\-Base$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=1.27854cm]{classeo_sorted_stat_base}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual void {\bf last\-Call} (const std::vector$<$ const {\bf EOT} $\ast$ $>$ \&)\label{classeo_sorted_stat_base_a0}
+
+\item 
+virtual std::string {\bf class\-Name} (void) const \label{classeo_sorted_stat_base_a1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Sorted\-Stat\-Base$<$ EOT $>$}
+
+Base class for statistics calculated over a sorted snapshot of the population. 
+
+
+
+Definition at line 76 of file eo\-Stat.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Stat.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_st_branch_mutation.eps b/trunk/paradiseo-eo/doc/latex/classeo_st_branch_mutation.eps
new file mode 100644
index 000000000..2c89d8407
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_st_branch_mutation.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 76.6284
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 6.525 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoStBranchMutation< FType, Node >) cw
+(eoMonOp< eoParseTree< FType, Node > >) cw
+(eoOp< eoParseTree< FType, Node > >) cw
+(eoUF< eoParseTree< FType, Node > &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< eoParseTree< FType, Node > &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoStBranchMutation< FType, Node >) 0.5 0 box
+ (eoMonOp< eoParseTree< FType, Node > >) 0.5 1 box
+ (eoOp< eoParseTree< FType, Node > >) 0 2 box
+ (eoUF< eoParseTree< FType, Node > &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< eoParseTree< FType, Node > &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_st_branch_mutation.tex b/trunk/paradiseo-eo/doc/latex/classeo_st_branch_mutation.tex
new file mode 100644
index 000000000..da0f4ecbe
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_st_branch_mutation.tex
@@ -0,0 +1,91 @@
+\section{eo\-St\-Branch\-Mutation$<$ FType, Node $>$ Class Template Reference}
+\label{classeo_st_branch_mutation}\index{eoStBranchMutation@{eoStBranchMutation}}
+eo\-St\-Branch\-Mutation --$>$ replace a strongly typed subtree with a randomly created strongly typed subtree  
+
+
+{\tt \#include $<$gp/eo\-St\-Parse\-Tree\-Op.h$>$}
+
+Inheritance diagram for eo\-St\-Branch\-Mutation$<$ FType, Node $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.14559cm]{classeo_st_branch_mutation}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef {\bf eo\-Parse\-Tree}$<$ FType, Node $>$ {\bf Eo\-Type}\label{classeo_st_branch_mutation_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-St\-Branch\-Mutation} ({\bf eo\-Init}$<$ {\bf Eo\-Type} $>$ \&\_\-init, unsigned \_\-max\_\-length)
+\begin{CompactList}\small\item\em Constructor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_st_branch_mutation_a1}
+
+\begin{CompactList}\small\item\em the class name \item\end{CompactList}\item 
+virtual {\bf $\sim$eo\-St\-Branch\-Mutation} ()\label{classeo_st_branch_mutation_a2}
+
+\begin{CompactList}\small\item\em Dtor. \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf Eo\-Type} \&\_\-eo1)
+\begin{CompactList}\small\item\em Mutate an individual. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf max\_\-length}\label{classeo_st_branch_mutation_r0}
+
+\item 
+{\bf eo\-Init}$<$ {\bf Eo\-Type} $>$ \& {\bf initializer}\label{classeo_st_branch_mutation_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class FType, class Node$>$ class eo\-St\-Branch\-Mutation$<$ FType, Node $>$}
+
+eo\-St\-Branch\-Mutation --$>$ replace a strongly typed subtree with a randomly created strongly typed subtree 
+
+
+
+Definition at line 130 of file eo\-St\-Parse\-Tree\-Op.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoStBranchMutation@{eo\-St\-Branch\-Mutation}!eoStBranchMutation@{eoStBranchMutation}}
+\index{eoStBranchMutation@{eoStBranchMutation}!eoStBranchMutation@{eo\-St\-Branch\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ {\bf eo\-St\-Branch\-Mutation}$<$ FType, Node $>$::{\bf eo\-St\-Branch\-Mutation} ({\bf eo\-Init}$<$ {\bf Eo\-Type} $>$ \& {\em \_\-init}, unsigned {\em \_\-max\_\-length})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_st_branch_mutation_a0}
+
+
+Constructor. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-init}]An instantiation of eo\-Gp\-Depth\-Initializer \item[{\em \_\-max\_\-length}]the maximum size of an individual \end{description}
+\end{Desc}
+
+
+Definition at line 140 of file eo\-St\-Parse\-Tree\-Op.h.
+
+\subsection{Member Function Documentation}
+\index{eoStBranchMutation@{eo\-St\-Branch\-Mutation}!operator()@{operator()}}
+\index{operator()@{operator()}!eoStBranchMutation@{eo\-St\-Branch\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ bool {\bf eo\-St\-Branch\-Mutation}$<$ FType, Node $>$::operator() ({\bf Eo\-Type} \& {\em \_\-eo1})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_st_branch_mutation_a3}
+
+
+Mutate an individual. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-eo1}]The individual that is to be changed \end{description}
+\end{Desc}
+
+
+Definition at line 154 of file eo\-St\-Parse\-Tree\-Op.h.
+
+References eo\-Rng::random().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-St\-Parse\-Tree\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_st_hoist_mutation.eps b/trunk/paradiseo-eo/doc/latex/classeo_st_hoist_mutation.eps
new file mode 100644
index 000000000..af8178c52
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_st_hoist_mutation.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 76.6284
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 6.525 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoStHoistMutation< FType, Node >) cw
+(eoMonOp< eoParseTree< FType, Node > >) cw
+(eoOp< eoParseTree< FType, Node > >) cw
+(eoUF< eoParseTree< FType, Node > &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< eoParseTree< FType, Node > &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoStHoistMutation< FType, Node >) 0.5 0 box
+ (eoMonOp< eoParseTree< FType, Node > >) 0.5 1 box
+ (eoOp< eoParseTree< FType, Node > >) 0 2 box
+ (eoUF< eoParseTree< FType, Node > &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< eoParseTree< FType, Node > &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_st_hoist_mutation.tex b/trunk/paradiseo-eo/doc/latex/classeo_st_hoist_mutation.tex
new file mode 100644
index 000000000..be35b98ca
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_st_hoist_mutation.tex
@@ -0,0 +1,91 @@
+\section{eo\-St\-Hoist\-Mutation$<$ FType, Node $>$ Class Template Reference}
+\label{classeo_st_hoist_mutation}\index{eoStHoistMutation@{eoStHoistMutation}}
+eo\-St\-Hoist\-Mutation --$>$ replace the individual with one of its strongly typed subtree's  
+
+
+{\tt \#include $<$gp/eo\-St\-Parse\-Tree\-Op.h$>$}
+
+Inheritance diagram for eo\-St\-Hoist\-Mutation$<$ FType, Node $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.14559cm]{classeo_st_hoist_mutation}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef {\bf eo\-Parse\-Tree}$<$ FType, Node $>$ {\bf Eo\-Type}\label{classeo_st_hoist_mutation_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-St\-Hoist\-Mutation} ({\bf eo\-Init}$<$ {\bf Eo\-Type} $>$ \&\_\-init, unsigned \_\-max\_\-length)
+\begin{CompactList}\small\item\em Constructor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_st_hoist_mutation_a1}
+
+\begin{CompactList}\small\item\em the class name \item\end{CompactList}\item 
+virtual {\bf $\sim$eo\-St\-Hoist\-Mutation} ()\label{classeo_st_hoist_mutation_a2}
+
+\begin{CompactList}\small\item\em Dtor. \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf Eo\-Type} \&\_\-eo1)
+\begin{CompactList}\small\item\em Mutate an individual. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf max\_\-length}\label{classeo_st_hoist_mutation_r0}
+
+\item 
+{\bf eo\-Init}$<$ {\bf Eo\-Type} $>$ \& {\bf initializer}\label{classeo_st_hoist_mutation_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class FType, class Node$>$ class eo\-St\-Hoist\-Mutation$<$ FType, Node $>$}
+
+eo\-St\-Hoist\-Mutation --$>$ replace the individual with one of its strongly typed subtree's 
+
+
+
+Definition at line 258 of file eo\-St\-Parse\-Tree\-Op.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoStHoistMutation@{eo\-St\-Hoist\-Mutation}!eoStHoistMutation@{eoStHoistMutation}}
+\index{eoStHoistMutation@{eoStHoistMutation}!eoStHoistMutation@{eo\-St\-Hoist\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ {\bf eo\-St\-Hoist\-Mutation}$<$ FType, Node $>$::{\bf eo\-St\-Hoist\-Mutation} ({\bf eo\-Init}$<$ {\bf Eo\-Type} $>$ \& {\em \_\-init}, unsigned {\em \_\-max\_\-length})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_st_hoist_mutation_a0}
+
+
+Constructor. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-init}]An instantiation of eo\-St\-Depth\-Init \item[{\em \_\-max\_\-length}]the maximum size of an individual \end{description}
+\end{Desc}
+
+
+Definition at line 268 of file eo\-St\-Parse\-Tree\-Op.h.
+
+\subsection{Member Function Documentation}
+\index{eoStHoistMutation@{eo\-St\-Hoist\-Mutation}!operator()@{operator()}}
+\index{operator()@{operator()}!eoStHoistMutation@{eo\-St\-Hoist\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ bool {\bf eo\-St\-Hoist\-Mutation}$<$ FType, Node $>$::operator() ({\bf Eo\-Type} \& {\em \_\-eo1})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_st_hoist_mutation_a3}
+
+
+Mutate an individual. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-eo1}]The individual that is to be changed \end{description}
+\end{Desc}
+
+
+Definition at line 282 of file eo\-St\-Parse\-Tree\-Op.h.
+
+References eo\-Rng::random().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-St\-Parse\-Tree\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_st_parse_tree_depth_init.eps b/trunk/paradiseo-eo/doc/latex/classeo_st_parse_tree_depth_init.eps
new file mode 100644
index 000000000..f344aae9e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_st_parse_tree_depth_init.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 114.943
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.35 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoStParseTreeDepthInit< FType, Node >) cw
+(eoInit< eoParseTree< FType, Node > >) cw
+(eoUF< eoParseTree< FType, Node > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< eoParseTree< FType, Node > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoStParseTreeDepthInit< FType, Node >) 0.5 0 box
+ (eoInit< eoParseTree< FType, Node > >) 0.5 1 box
+ (eoUF< eoParseTree< FType, Node > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< eoParseTree< FType, Node > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_st_parse_tree_depth_init.tex b/trunk/paradiseo-eo/doc/latex/classeo_st_parse_tree_depth_init.tex
new file mode 100644
index 000000000..1bba1ce4d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_st_parse_tree_depth_init.tex
@@ -0,0 +1,98 @@
+\section{eo\-St\-Parse\-Tree\-Depth\-Init$<$ FType, Node $>$ Class Template Reference}
+\label{classeo_st_parse_tree_depth_init}\index{eoStParseTreeDepthInit@{eoStParseTreeDepthInit}}
+eo\-St\-Parse\-Tree\-Depth\-Init : the initializer class for strongly typed tree-based genetic programming  
+
+
+{\tt \#include $<$gp/eo\-St\-Parse\-Tree\-Depth\-Init.h$>$}
+
+Inheritance diagram for eo\-St\-Parse\-Tree\-Depth\-Init$<$ FType, Node $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.21839cm]{classeo_st_parse_tree_depth_init}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef {\bf eo\-Parse\-Tree}$<$ FType, Node $>$ {\bf Eo\-Type}\label{classeo_st_parse_tree_depth_init_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-St\-Parse\-Tree\-Depth\-Init} (unsigned \_\-max\_\-depth, const std::vector$<$ Node $>$ \&\_\-node, const int \&\_\-return\_\-type, bool \_\-grow=true)
+\begin{CompactList}\small\item\em Constructor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_st_parse_tree_depth_init_a1}
+
+\begin{CompactList}\small\item\em My class name. \item\end{CompactList}\item 
+void {\bf operator()} ({\bf Eo\-Type} \&\_\-tree)
+\begin{CompactList}\small\item\em initialize a tree \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Member Functions}
+\begin{CompactItemize}
+\item 
+bool {\bf generate} (std::list$<$ Node $>$ \&sequence, int the\_\-max, int request\_\-type)\label{classeo_st_parse_tree_depth_init_d0}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf max\_\-depth}\label{classeo_st_parse_tree_depth_init_r0}
+
+\item 
+map$<$ int, map$<$ int, std::vector$<$ Node $>$ $>$ $>$ {\bf node}\label{classeo_st_parse_tree_depth_init_r1}
+
+\item 
+int {\bf return\_\-type}\label{classeo_st_parse_tree_depth_init_r2}
+
+\item 
+bool {\bf grow}\label{classeo_st_parse_tree_depth_init_r3}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class FType, class Node$>$ class eo\-St\-Parse\-Tree\-Depth\-Init$<$ FType, Node $>$}
+
+eo\-St\-Parse\-Tree\-Depth\-Init : the initializer class for strongly typed tree-based genetic programming 
+
+
+
+Definition at line 61 of file eo\-St\-Parse\-Tree\-Depth\-Init.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoStParseTreeDepthInit@{eo\-St\-Parse\-Tree\-Depth\-Init}!eoStParseTreeDepthInit@{eoStParseTreeDepthInit}}
+\index{eoStParseTreeDepthInit@{eoStParseTreeDepthInit}!eoStParseTreeDepthInit@{eo\-St\-Parse\-Tree\-Depth\-Init}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ {\bf eo\-St\-Parse\-Tree\-Depth\-Init}$<$ FType, Node $>$::{\bf eo\-St\-Parse\-Tree\-Depth\-Init} (unsigned {\em \_\-max\_\-depth}, const std::vector$<$ Node $>$ \& {\em \_\-node}, const int \& {\em \_\-return\_\-type}, bool {\em \_\-grow} = {\tt true})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_st_parse_tree_depth_init_a0}
+
+
+Constructor. 
+
+\_\-max\_\-depth The maximum depth of a tree \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-initializor}]A std::vector containing the possible nodes \item[{\em \_\-grow}]False results in a full tree, True result is a randomly grown tree \end{description}
+\end{Desc}
+
+
+Definition at line 73 of file eo\-St\-Parse\-Tree\-Depth\-Init.h.
+
+\subsection{Member Function Documentation}
+\index{eoStParseTreeDepthInit@{eo\-St\-Parse\-Tree\-Depth\-Init}!operator()@{operator()}}
+\index{operator()@{operator()}!eoStParseTreeDepthInit@{eo\-St\-Parse\-Tree\-Depth\-Init}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ void {\bf eo\-St\-Parse\-Tree\-Depth\-Init}$<$ FType, Node $>$::operator() ({\bf Eo\-Type} \& {\em \_\-tree})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_st_parse_tree_depth_init_a2}
+
+
+initialize a tree 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-tree}]: the tree to be initialized \end{description}
+\end{Desc}
+
+
+Definition at line 125 of file eo\-St\-Parse\-Tree\-Depth\-Init.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-St\-Parse\-Tree\-Depth\-Init.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_st_point_mutation.eps b/trunk/paradiseo-eo/doc/latex/classeo_st_point_mutation.eps
new file mode 100644
index 000000000..a91d198c6
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_st_point_mutation.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 76.6284
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 6.525 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoStPointMutation< FType, Node >) cw
+(eoMonOp< eoParseTree< FType, Node > >) cw
+(eoOp< eoParseTree< FType, Node > >) cw
+(eoUF< eoParseTree< FType, Node > &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< eoParseTree< FType, Node > &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoStPointMutation< FType, Node >) 0.5 0 box
+ (eoMonOp< eoParseTree< FType, Node > >) 0.5 1 box
+ (eoOp< eoParseTree< FType, Node > >) 0 2 box
+ (eoUF< eoParseTree< FType, Node > &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< eoParseTree< FType, Node > &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_st_point_mutation.tex b/trunk/paradiseo-eo/doc/latex/classeo_st_point_mutation.tex
new file mode 100644
index 000000000..1d7c2596f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_st_point_mutation.tex
@@ -0,0 +1,88 @@
+\section{eo\-St\-Point\-Mutation$<$ FType, Node $>$ Class Template Reference}
+\label{classeo_st_point_mutation}\index{eoStPointMutation@{eoStPointMutation}}
+eo\-St\-Point\-Mutation --$>$ replace a Node with a Node of the same arity and type  
+
+
+{\tt \#include $<$gp/eo\-St\-Parse\-Tree\-Op.h$>$}
+
+Inheritance diagram for eo\-St\-Point\-Mutation$<$ FType, Node $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.14559cm]{classeo_st_point_mutation}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef {\bf eo\-Parse\-Tree}$<$ FType, Node $>$ {\bf Eo\-Type}\label{classeo_st_point_mutation_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-St\-Point\-Mutation} (std::vector$<$ Node $>$ \&\_\-node)
+\begin{CompactList}\small\item\em Constructor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_st_point_mutation_a1}
+
+\begin{CompactList}\small\item\em the class name \item\end{CompactList}\item 
+virtual {\bf $\sim$eo\-St\-Point\-Mutation} ()\label{classeo_st_point_mutation_a2}
+
+\begin{CompactList}\small\item\em Dtor. \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf Eo\-Type} \&\_\-eo1)
+\begin{CompactList}\small\item\em Mutate an individual. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+map$<$ int, map$<$ int, std::vector$<$ Node $>$ $>$ $>$ {\bf node}\label{classeo_st_point_mutation_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class FType, class Node$>$ class eo\-St\-Point\-Mutation$<$ FType, Node $>$}
+
+eo\-St\-Point\-Mutation --$>$ replace a Node with a Node of the same arity and type 
+
+
+
+Definition at line 195 of file eo\-St\-Parse\-Tree\-Op.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoStPointMutation@{eo\-St\-Point\-Mutation}!eoStPointMutation@{eoStPointMutation}}
+\index{eoStPointMutation@{eoStPointMutation}!eoStPointMutation@{eo\-St\-Point\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ {\bf eo\-St\-Point\-Mutation}$<$ FType, Node $>$::{\bf eo\-St\-Point\-Mutation} (std::vector$<$ Node $>$ \& {\em \_\-node})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_st_point_mutation_a0}
+
+
+Constructor. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-initializor}]The std::vector of Nodes given to the eo\-Gp\-Depth\-Initializer \end{description}
+\end{Desc}
+
+
+Definition at line 205 of file eo\-St\-Parse\-Tree\-Op.h.
+
+\subsection{Member Function Documentation}
+\index{eoStPointMutation@{eo\-St\-Point\-Mutation}!operator()@{operator()}}
+\index{operator()@{operator()}!eoStPointMutation@{eo\-St\-Point\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ bool {\bf eo\-St\-Point\-Mutation}$<$ FType, Node $>$::operator() ({\bf Eo\-Type} \& {\em \_\-eo1})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_st_point_mutation_a3}
+
+
+Mutate an individual. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-eo1}]The individual that is to be changed \end{description}
+\end{Desc}
+
+
+Definition at line 234 of file eo\-St\-Parse\-Tree\-Op.h.
+
+References eo\-Rng::random().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-St\-Parse\-Tree\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_st_subtree_x_over.eps b/trunk/paradiseo-eo/doc/latex/classeo_st_subtree_x_over.eps
new file mode 100644
index 000000000..8d2f4b5a4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_st_subtree_x_over.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 48.84
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 10.2375 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoStSubtreeXOver< FType, Node >) cw
+(eoQuadOp< eoParseTree< FType, Node > >) cw
+(eoOp< eoParseTree< FType, Node > >) cw
+(eoBF< eoParseTree< FType, Node > &, eoParseTree< FType, Node > &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< eoParseTree< FType, Node > &, eoParseTree< FType, Node > &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoStSubtreeXOver< FType, Node >) 0.5 0 box
+ (eoQuadOp< eoParseTree< FType, Node > >) 0.5 1 box
+ (eoOp< eoParseTree< FType, Node > >) 0 2 box
+ (eoBF< eoParseTree< FType, Node > &, eoParseTree< FType, Node > &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< eoParseTree< FType, Node > &, eoParseTree< FType, Node > &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_st_subtree_x_over.tex b/trunk/paradiseo-eo/doc/latex/classeo_st_subtree_x_over.tex
new file mode 100644
index 000000000..8c9a8c2ca
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_st_subtree_x_over.tex
@@ -0,0 +1,70 @@
+\section{eo\-St\-Subtree\-XOver$<$ FType, Node $>$ Class Template Reference}
+\label{classeo_st_subtree_x_over}\index{eoStSubtreeXOver@{eoStSubtreeXOver}}
+eo\-St\-Subtree\-XOver --$>$ subtree xover for strongly typed tree-based genetic programming  
+
+
+{\tt \#include $<$gp/eo\-St\-Parse\-Tree\-Op.h$>$}
+
+Inheritance diagram for eo\-St\-Subtree\-XOver$<$ FType, Node $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=1.36752cm]{classeo_st_subtree_x_over}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef {\bf eo\-Parse\-Tree}$<$ FType, Node $>$ {\bf Eo\-Type}\label{classeo_st_subtree_x_over_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-St\-Subtree\-XOver} (unsigned \_\-max\_\-length)
+\begin{CompactList}\small\item\em Constructor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_st_subtree_x_over_a1}
+
+\begin{CompactList}\small\item\em the ckassname \item\end{CompactList}\item 
+virtual {\bf $\sim$eo\-St\-Subtree\-XOver} ()\label{classeo_st_subtree_x_over_a2}
+
+\begin{CompactList}\small\item\em Dtor. \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf Eo\-Type} \&\_\-eo1, {\bf Eo\-Type} \&\_\-eo2)\label{classeo_st_subtree_x_over_a3}
+
+\begin{CompactList}\small\item\em Perform crossover on two individuals param \_\-eo1 The first parent individual param \_\-eo2 The second parent individual. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf max\_\-length}\label{classeo_st_subtree_x_over_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class FType, class Node$>$ class eo\-St\-Subtree\-XOver$<$ FType, Node $>$}
+
+eo\-St\-Subtree\-XOver --$>$ subtree xover for strongly typed tree-based genetic programming 
+
+
+
+Definition at line 56 of file eo\-St\-Parse\-Tree\-Op.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoStSubtreeXOver@{eo\-St\-Subtree\-XOver}!eoStSubtreeXOver@{eoStSubtreeXOver}}
+\index{eoStSubtreeXOver@{eoStSubtreeXOver}!eoStSubtreeXOver@{eo\-St\-Subtree\-XOver}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ {\bf eo\-St\-Subtree\-XOver}$<$ FType, Node $>$::{\bf eo\-St\-Subtree\-XOver} (unsigned {\em \_\-max\_\-length})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_st_subtree_x_over_a0}
+
+
+Constructor. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-max\_\-length}]the maximum size of an individual \end{description}
+\end{Desc}
+
+
+Definition at line 64 of file eo\-St\-Parse\-Tree\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-St\-Parse\-Tree\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_stat.eps b/trunk/paradiseo-eo/doc/latex/classeo_stat.eps
new file mode 100644
index 000000000..73e4b93e3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_stat.eps
@@ -0,0 +1,227 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 90.0901
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.55 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoStat< EOT, T >) cw
+(eoValueParam< T >) cw
+(eoStatBase< EOT >) cw
+(eoParam) cw
+(eoUF< const eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoStat< EOT, T >) 0.5 0 box
+ (eoValueParam< T >) 0 1 box
+ (eoStatBase< EOT >) 1 1 box
+ (eoParam) 0 2 box
+ (eoUF< const eoPop< EOT > &, void >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< const eoPop< EOT > &, void >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+0 1 1 conn
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 1 1 in
+solid
+0 1 1 out
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_stat.tex b/trunk/paradiseo-eo/doc/latex/classeo_stat.tex
new file mode 100644
index 000000000..58d74c932
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_stat.tex
@@ -0,0 +1,36 @@
+\section{eo\-Stat$<$ EOT, T $>$ Class Template Reference}
+\label{classeo_stat}\index{eoStat@{eoStat}}
+The actual class that will be used as base for all statistics that need to be calculated over the (unsorted) population It is an {\bf eo\-Stat\-Base}{\rm (p.\,\pageref{classeo_stat_base})} AND an {\bf eo\-Value\-Param}{\rm (p.\,\pageref{classeo_value_param})} so it can be used in Monitors.  
+
+
+{\tt \#include $<$eo\-Stat.h$>$}
+
+Inheritance diagram for eo\-Stat$<$ EOT, T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.52252cm]{classeo_stat}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Stat} (T \_\-value, std::string \_\-description)\label{classeo_stat_a0}
+
+\item 
+virtual std::string {\bf class\-Name} (void) const \label{classeo_stat_a1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT, class T$>$ class eo\-Stat$<$ EOT, T $>$}
+
+The actual class that will be used as base for all statistics that need to be calculated over the (unsorted) population It is an {\bf eo\-Stat\-Base}{\rm (p.\,\pageref{classeo_stat_base})} AND an {\bf eo\-Value\-Param}{\rm (p.\,\pageref{classeo_value_param})} so it can be used in Monitors. 
+
+
+
+Definition at line 58 of file eo\-Stat.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Stat.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_stat_base.eps b/trunk/paradiseo-eo/doc/latex/classeo_stat_base.eps
new file mode 100644
index 000000000..6beaf8eb9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_stat_base.eps
@@ -0,0 +1,277 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 77.2201
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 6.475 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 8 def
+/cols 7 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoStatBase< EOT >) cw
+(eoUF< const eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, void >) cw
+(eoStat< EOT, T >) cw
+(eoStat< EOT, double >) cw
+(eoStat< EOT, EOT::Fitness >) cw
+(eoStat< EOT, std::pair< double, double > >) cw
+(eoStat< EOT, std::string >) cw
+(eoAssembledFitnessAverageStat< EOT >) cw
+(eoAssembledFitnessBestStat< EOT >) cw
+(eoDistanceStat< EOT >) cw
+(eoFDCStat< EOT >) cw
+(eoAverageStat< EOT >) cw
+(eoBestFitnessStat< EOT >) cw
+(eoSecondMomentStats< EOT >) cw
+(eoPopStat< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoStatBase< EOT >) 3 5 box
+ (eoUF< const eoPop< EOT > &, void >) 3 6 box
+ (eoFunctorBase) 2.5 7 box
+ (unary_function< const eoPop< EOT > &, void >) 3.5 7 box
+ (eoStat< EOT, T >) 0 4 box
+ (eoStat< EOT, double >) 1 4 box
+ (eoStat< EOT, EOT::Fitness >) 3 4 box
+ (eoStat< EOT, std::pair< double, double > >) 5 4 box
+ (eoStat< EOT, std::string >) 6 4 box
+ (eoAssembledFitnessAverageStat< EOT >) 2 3 box
+ (eoAssembledFitnessBestStat< EOT >) 2 2 box
+ (eoDistanceStat< EOT >) 2 1 box
+ (eoFDCStat< EOT >) 2 0 box
+ (eoAverageStat< EOT >) 4 3 box
+ (eoBestFitnessStat< EOT >) 4 2 box
+ (eoSecondMomentStats< EOT >) 5 3 box
+ (eoPopStat< EOT >) 6 3 box
+
+% ----- relations -----
+
+solid
+0 3 5 out
+solid
+1 3 6 in
+solid
+0 3 6 out
+solid
+2.5 3.5 7 conn
+solid
+1 2.5 7 in
+solid
+1 3.5 7 in
+solid
+1 3 4.25 out
+solid
+0 6 5 conn
+solid
+0 0 4.75 in
+solid
+0 1 4.75 in
+solid
+1 1 3.25 out
+solid
+0 3 4.75 in
+solid
+1 3 3.25 out
+solid
+0 5 4.75 in
+solid
+1 5 3.25 out
+solid
+0 6 4.75 in
+solid
+1 6 3.25 out
+solid
+0 1 3.5 hedge
+solid
+0 1 2.5 hedge
+solid
+0 1 1.5 hedge
+solid
+0 1 0.5 hedge
+solid
+1 4 0.5 vedge
+solid
+0 3 3.5 hedge
+solid
+0 3 2.5 hedge
+solid
+3 4 2.5 vedge
+solid
+0 5 3.75 in
+solid
+0 6 3.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_stat_base.tex b/trunk/paradiseo-eo/doc/latex/classeo_stat_base.tex
new file mode 100644
index 000000000..2021fbe1b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_stat_base.tex
@@ -0,0 +1,38 @@
+\section{eo\-Stat\-Base$<$ EOT $>$ Class Template Reference}
+\label{classeo_stat_base}\index{eoStatBase@{eoStatBase}}
+Base class for all statistics that need to be calculated over the (unsorted) population (I guess it is not really necessary? MS.  
+
+
+{\tt \#include $<$eo\-Stat.h$>$}
+
+Inheritance diagram for eo\-Stat\-Base$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.16216cm]{classeo_stat_base}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual void {\bf last\-Call} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&)\label{classeo_stat_base_a0}
+
+\item 
+virtual std::string {\bf class\-Name} (void) const \label{classeo_stat_base_a1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Stat\-Base$<$ EOT $>$}
+
+Base class for all statistics that need to be calculated over the (unsorted) population (I guess it is not really necessary? MS. 
+
+Depstd::ends, there might be reasons to have a stat that is not an {\bf eo\-Value\-Param}{\rm (p.\,\pageref{classeo_value_param})}, but maybe I'm just kidding myself, MK) 
+
+
+
+Definition at line 45 of file eo\-Stat.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Stat.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_state.eps b/trunk/paradiseo-eo/doc/latex/classeo_state.eps
new file mode 100644
index 000000000..4e25912fb
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_state.eps
@@ -0,0 +1,197 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 370.37
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.35 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 2 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoState) cw
+(eoFunctorStore) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoState) 0 0 box
+ (eoFunctorStore) 0 1 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_state.tex b/trunk/paradiseo-eo/doc/latex/classeo_state.tex
new file mode 100644
index 000000000..4f5304d0e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_state.tex
@@ -0,0 +1,153 @@
+\section{eo\-State Class Reference}
+\label{classeo_state}\index{eoState@{eoState}}
+eo\-State can be used to register derivants of {\bf eo\-Persistent}{\rm (p.\,\pageref{classeo_persistent})}.  
+
+
+{\tt \#include $<$eo\-State.h$>$}
+
+Inheritance diagram for eo\-State::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2cm]{classeo_state}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+void {\bf register\-Object} ({\bf eo\-Persistent} \®istrant)\label{classeo_state_a2}
+
+\begin{CompactList}\small\item\em Object registration function, note that it does not take ownership! \item\end{CompactList}\item 
+template$<$class T$>$ T \& {\bf take\-Ownership} (const T \&persistent)
+\begin{CompactList}\small\item\em Copies the object (MUST be derived from {\bf eo\-Persistent}{\rm (p.\,\pageref{classeo_persistent})}) and returns a reference to the owned object. \item\end{CompactList}\item 
+std::string {\bf get\-Comment\-String} (void) const \label{classeo_state_a4}
+
+\item 
+void {\bf load} (const std::string \&\_\-filename)
+\begin{CompactList}\small\item\em Reads the file specified. \item\end{CompactList}\item 
+void {\bf load} (std::istream \&is)
+\begin{CompactList}\small\item\em Reads the file specified. \item\end{CompactList}\item 
+void {\bf save} (const std::string \&\_\-filename) const 
+\begin{CompactList}\small\item\em Saves the state in file specified. \item\end{CompactList}\item 
+void {\bf save} (std::ostream \&os) const 
+\begin{CompactList}\small\item\em Saves the state in file specified. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Types}
+\begin{CompactItemize}
+\item 
+typedef std::map$<$ std::string, {\bf eo\-Persistent} $\ast$ $>$ {\bf Object\-Map}\label{classeo_state_y0}
+
+\end{CompactItemize}
+\subsection*{Private Member Functions}
+\begin{CompactItemize}
+\item 
+std::string {\bf create\-Object\-Name} ({\bf eo\-Object} $\ast$obj)\label{classeo_state_d0}
+
+\item 
+{\bf eo\-State} (const {\bf eo\-State} \&)\label{classeo_state_d1}
+
+\item 
+{\bf eo\-State} \& {\bf operator=} (const {\bf eo\-State} \&)\label{classeo_state_d2}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+Object\-Map {\bf object\-Map}\label{classeo_state_r0}
+
+\item 
+std::vector$<$ Object\-Map::iterator $>$ {\bf creation\-Order}\label{classeo_state_r1}
+
+\item 
+std::vector$<$ {\bf eo\-Persistent} $\ast$ $>$ {\bf owned\-Objects}\label{classeo_state_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+eo\-State can be used to register derivants of {\bf eo\-Persistent}{\rm (p.\,\pageref{classeo_persistent})}. 
+
+It will then in turn implement the persistence framework through members load and save, that will call read\-From and print\-On for the registrated objects.
+
+It is derived from {\bf eo\-Functor\-Store}{\rm (p.\,\pageref{classeo_functor_store})}, so that it also serves as a place where all those nifty eo functors can be stored. This is useful in the case you want to use one of the make\_\-$\ast$ functions. These functions generally take as their last argument an {\bf eo\-Functor\-Store}{\rm (p.\,\pageref{classeo_functor_store})} (or a state) which is used to hold all dynamically generated data. Note however, that unlike with {\bf eo\-Persistent}{\rm (p.\,\pageref{classeo_persistent})} derived classes, {\bf eo\-Functor\-Base}{\rm (p.\,\pageref{classeo_functor_base})} derived classes are not saved or loaded. To govern the creation of functors, command-line parameters (which can be stored) are needed. 
+
+
+
+Definition at line 54 of file eo\-State.h.
+
+\subsection{Member Function Documentation}
+\index{eoState@{eo\-State}!takeOwnership@{takeOwnership}}
+\index{takeOwnership@{takeOwnership}!eoState@{eo\-State}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class T$>$ T\& eo\-State::take\-Ownership (const T \& {\em persistent})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_state_a3}
+
+
+Copies the object (MUST be derived from {\bf eo\-Persistent}{\rm (p.\,\pageref{classeo_persistent})}) and returns a reference to the owned object. 
+
+Note: it does not register the object, this must be done afterwards! 
+
+Definition at line 73 of file eo\-State.h.\index{eoState@{eo\-State}!load@{load}}
+\index{load@{load}!eoState@{eo\-State}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}void eo\-State::load (const std::string \& {\em \_\-filename})}\label{classeo_state_a5}
+
+
+Reads the file specified. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-filename}]the name of the file to load from \end{description}
+\end{Desc}
+
+
+Definition at line 74 of file eo\-State.cpp.\index{eoState@{eo\-State}!load@{load}}
+\index{load@{load}!eoState@{eo\-State}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}void eo\-State::load (std::istream \& {\em is})}\label{classeo_state_a6}
+
+
+Reads the file specified. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em is}]the stream to load from \end{description}
+\end{Desc}
+
+
+Definition at line 87 of file eo\-State.cpp.
+
+References eo\-Persistent::read\-From().\index{eoState@{eo\-State}!save@{save}}
+\index{save@{save}!eoState@{eo\-State}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}void eo\-State::save (const std::string \& {\em \_\-filename}) const}\label{classeo_state_a7}
+
+
+Saves the state in file specified. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-filename}]the name of the file to save into \end{description}
+\end{Desc}
+
+
+Definition at line 148 of file eo\-State.cpp.
+
+Referenced by eo\-Timed\-State\-Saver::operator()().\index{eoState@{eo\-State}!save@{save}}
+\index{save@{save}!eoState@{eo\-State}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}void eo\-State::save (std::ostream \& {\em os}) const}\label{classeo_state_a8}
+
+
+Saves the state in file specified. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em os}]the stream to save into \end{description}
+\end{Desc}
+
+
+Definition at line 161 of file eo\-State.cpp.
+
+References eo\-Printable::print\-On().
+
+The documentation for this class was generated from the following files:\begin{CompactItemize}
+\item 
+eo\-State.h\item 
+eo\-State.cpp\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_stdout_monitor.eps b/trunk/paradiseo-eo/doc/latex/classeo_stdout_monitor.eps
new file mode 100644
index 000000000..315354122
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_stdout_monitor.eps
@@ -0,0 +1,209 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 583.942
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 0.85625 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoStdoutMonitor) cw
+(eoMonitor) cw
+(eoF< eoMonitor & >) cw
+(eoFunctorBase) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoStdoutMonitor) 0 0 box
+ (eoMonitor) 0 1 box
+ (eoF< eoMonitor & >) 0 2 box
+ (eoFunctorBase) 0 3 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 0 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_stdout_monitor.tex b/trunk/paradiseo-eo/doc/latex/classeo_stdout_monitor.tex
new file mode 100644
index 000000000..4abbb2144
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_stdout_monitor.tex
@@ -0,0 +1,50 @@
+\section{eo\-Stdout\-Monitor Class Reference}
+\label{classeo_stdout_monitor}\index{eoStdoutMonitor@{eoStdoutMonitor}}
+Prints statistics to stdout.  
+
+
+{\tt \#include $<$eo\-Stdout\-Monitor.h$>$}
+
+Inheritance diagram for eo\-Stdout\-Monitor::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_stdout_monitor}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Stdout\-Monitor} (bool \_\-verbose=true, std::string \_\-delim=\char`\"{}$\backslash$t\char`\"{})\label{classeo_stdout_monitor_a0}
+
+\item 
+{\bf eo\-Monitor} \& {\bf operator()} (void)\label{classeo_stdout_monitor_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} (void) const \label{classeo_stdout_monitor_a2}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+bool {\bf verbose}\label{classeo_stdout_monitor_r0}
+
+\item 
+std::string {\bf delim}\label{classeo_stdout_monitor_r1}
+
+\item 
+bool {\bf firsttime}\label{classeo_stdout_monitor_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Prints statistics to stdout. 
+
+
+
+Definition at line 38 of file eo\-Stdout\-Monitor.h.
+
+The documentation for this class was generated from the following files:\begin{CompactItemize}
+\item 
+eo\-Stdout\-Monitor.h\item 
+eo\-Stdout\-Monitor.cpp\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_steady_fit_continue.eps b/trunk/paradiseo-eo/doc/latex/classeo_steady_fit_continue.eps
new file mode 100644
index 000000000..a28da4033
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_steady_fit_continue.eps
@@ -0,0 +1,227 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 90.0901
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.55 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSteadyFitContinue< EOT >) cw
+(eoContinue< EOT >) cw
+(eoUF< const eoPop< EOT > &, bool >) cw
+(eoPersistent) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, bool >) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSteadyFitContinue< EOT >) 1.25 0 box
+ (eoContinue< EOT >) 1.25 1 box
+ (eoUF< const eoPop< EOT > &, bool >) 0.5 2 box
+ (eoPersistent) 2 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< const eoPop< EOT > &, bool >) 1 3 box
+ (eoPrintable) 2 3 box
+
+% ----- relations -----
+
+solid
+0 1.25 0 out
+solid
+1 1.25 1 in
+solid
+0 1.25 1 out
+solid
+0.5 2 2 conn
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 2 2 in
+solid
+0 2 2 out
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+1 2 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_steady_fit_continue.tex b/trunk/paradiseo-eo/doc/latex/classeo_steady_fit_continue.tex
new file mode 100644
index 000000000..73fcaf0e8
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_steady_fit_continue.tex
@@ -0,0 +1,97 @@
+\section{eo\-Steady\-Fit\-Continue$<$ EOT $>$ Class Template Reference}
+\label{classeo_steady_fit_continue}\index{eoSteadyFitContinue@{eoSteadyFitContinue}}
+A continuator: does a minimum number of generations, then stops whenever a given number of generations takes place without improvement.  
+
+
+{\tt \#include $<$eo\-Steady\-Fit\-Continue.h$>$}
+
+Inheritance diagram for eo\-Steady\-Fit\-Continue$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.52252cm]{classeo_steady_fit_continue}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Fitness {\bf Fitness}\label{classeo_steady_fit_continue_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Steady\-Fit\-Continue} (unsigned long \_\-min\-Gens, unsigned long \_\-steady\-Gens)\label{classeo_steady_fit_continue_a0}
+
+\begin{CompactList}\small\item\em Ctor for setting a. \item\end{CompactList}\item 
+{\bf eo\-Steady\-Fit\-Continue} (unsigned long \_\-min\-Gens, unsigned long \_\-steady\-Gen, unsigned long \&\_\-current\-Gen)\label{classeo_steady_fit_continue_a1}
+
+\begin{CompactList}\small\item\em Ctor for enabling the save/load the no. of generations counted. \item\end{CompactList}\item 
+virtual bool {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-v\-EO)\label{classeo_steady_fit_continue_a2}
+
+\begin{CompactList}\small\item\em Returns false when a certain number of generations is reached withtout improvement. \item\end{CompactList}\item 
+virtual void {\bf total\-Generations} (unsigned long \_\-mg, unsigned long \_\-sg)
+\begin{CompactList}\small\item\em Sets the parameters (minimum nb of gen. \item\end{CompactList}\item 
+virtual void {\bf reset} ()\label{classeo_steady_fit_continue_a4}
+
+\begin{CompactList}\small\item\em Resets the state after it's been reached. \item\end{CompactList}\item 
+virtual unsigned long {\bf min\-Generations} ()\label{classeo_steady_fit_continue_a5}
+
+\begin{CompactList}\small\item\em accessors \item\end{CompactList}\item 
+virtual unsigned long {\bf steady\-Generations} ()\label{classeo_steady_fit_continue_a6}
+
+\item 
+virtual std::string {\bf class\-Name} (void) const \label{classeo_steady_fit_continue_a7}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned long {\bf rep\-Min\-Generations}\label{classeo_steady_fit_continue_r0}
+
+\item 
+unsigned long {\bf rep\-Steady\-Generations}\label{classeo_steady_fit_continue_r1}
+
+\item 
+bool {\bf steady\-State}\label{classeo_steady_fit_continue_r2}
+
+\item 
+unsigned long {\bf this\-Generation\-Place\-Holder}\label{classeo_steady_fit_continue_r3}
+
+\item 
+unsigned long \& {\bf this\-Generation}\label{classeo_steady_fit_continue_r4}
+
+\item 
+unsigned int {\bf last\-Improvement}\label{classeo_steady_fit_continue_r5}
+
+\item 
+Fitness {\bf best\-So\-Far}\label{classeo_steady_fit_continue_r6}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Steady\-Fit\-Continue$<$ EOT $>$}
+
+A continuator: does a minimum number of generations, then stops whenever a given number of generations takes place without improvement. 
+
+
+
+Definition at line 35 of file eo\-Steady\-Fit\-Continue.h.
+
+\subsection{Member Function Documentation}
+\index{eoSteadyFitContinue@{eo\-Steady\-Fit\-Continue}!totalGenerations@{totalGenerations}}
+\index{totalGenerations@{totalGenerations}!eoSteadyFitContinue@{eo\-Steady\-Fit\-Continue}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ virtual void {\bf eo\-Steady\-Fit\-Continue}$<$ {\bf EOT} $>$::total\-Generations (unsigned long {\em \_\-mg}, unsigned long {\em \_\-sg})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_steady_fit_continue_a3}
+
+
+Sets the parameters (minimum nb of gen. 
+
++ steady nb of gen.) and sets the current generation to 0 (the begin) 
+
+Definition at line 84 of file eo\-Steady\-Fit\-Continue.h.
+
+References eo\-Steady\-Fit\-Continue$<$ EOT $>$::reset().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Steady\-Fit\-Continue.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_select.eps b/trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_select.eps
new file mode 100644
index 000000000..b2df06dc5
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_select.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 115.607
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.325 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoStochTournamentSelect< EOT >) cw
+(eoSelectOne< EOT >) cw
+(eoUF< const eoPop< EOT > &, const EOT & >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, const EOT & >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoStochTournamentSelect< EOT >) 0.5 0 box
+ (eoSelectOne< EOT >) 0.5 1 box
+ (eoUF< const eoPop< EOT > &, const EOT & >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< const eoPop< EOT > &, const EOT & >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_select.tex b/trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_select.tex
new file mode 100644
index 000000000..35dc5d1cd
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_select.tex
@@ -0,0 +1,42 @@
+\section{eo\-Stoch\-Tournament\-Select$<$ EOT $>$ Class Template Reference}
+\label{classeo_stoch_tournament_select}\index{eoStochTournamentSelect@{eoStochTournamentSelect}}
+eo\-Stoch\-Tournament\-Select: a selection method that selects ONE individual by binary stochastic tournament -MS- 24/10/99  
+
+
+{\tt \#include $<$eo\-Stoch\-Tournament\-Select.h$>$}
+
+Inheritance diagram for eo\-Stoch\-Tournament\-Select$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.23699cm]{classeo_stoch_tournament_select}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Stoch\-Tournament\-Select} (double \_\-Trate=1.0)\label{classeo_stoch_tournament_select_a0}
+
+\item 
+virtual const {\bf EOT} \& {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&pop)\label{classeo_stoch_tournament_select_a1}
+
+\begin{CompactList}\small\item\em Perform the stochastic tournament. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf Trate}\label{classeo_stoch_tournament_select_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Stoch\-Tournament\-Select$<$ EOT $>$}
+
+eo\-Stoch\-Tournament\-Select: a selection method that selects ONE individual by binary stochastic tournament -MS- 24/10/99 
+
+
+
+Definition at line 42 of file eo\-Stoch\-Tournament\-Select.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Stoch\-Tournament\-Select.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_truncate.eps b/trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_truncate.eps
new file mode 100644
index 000000000..464922fae
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_truncate.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 123.457
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.05 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoStochTournamentTruncate< EOT >) cw
+(eoReduce< EOT >) cw
+(eoBF< eoPop< EOT > &, unsigned, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, unsigned, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoStochTournamentTruncate< EOT >) 0.5 0 box
+ (eoReduce< EOT >) 0.5 1 box
+ (eoBF< eoPop< EOT > &, unsigned, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< eoPop< EOT > &, unsigned, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_truncate.tex b/trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_truncate.tex
new file mode 100644
index 000000000..6c09095ec
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_truncate.tex
@@ -0,0 +1,44 @@
+\section{eo\-Stoch\-Tournament\-Truncate$<$ EOT $>$ Class Template Reference}
+\label{classeo_stoch_tournament_truncate}\index{eoStochTournamentTruncate@{eoStochTournamentTruncate}}
+a truncate class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g.  
+
+
+{\tt \#include $<$eo\-Reduce.h$>$}
+
+Inheritance diagram for eo\-Stoch\-Tournament\-Truncate$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.45679cm]{classeo_stoch_tournament_truncate}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Stoch\-Tournament\-Truncate} (double \_\-t\_\-rate)\label{classeo_stoch_tournament_truncate_a0}
+
+\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-newgen, unsigned \_\-newsize)\label{classeo_stoch_tournament_truncate_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf t\_\-rate}\label{classeo_stoch_tournament_truncate_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Stoch\-Tournament\-Truncate$<$ EOT $>$}
+
+a truncate class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g. 
+
+see {\bf eo\-SSGAStoch\-Tournament\-Replacement}{\rm (p.\,\pageref{classeo_s_s_g_a_stoch_tournament_replacement})}) 
+
+
+
+Definition at line 236 of file eo\-Reduce.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Reduce.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_truncate_split.eps b/trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_truncate_split.eps
new file mode 100644
index 000000000..d036da725
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_truncate_split.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 123.457
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.05 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoStochTournamentTruncateSplit< EOT >) cw
+(eoReduce< EOT >) cw
+(eoBF< eoPop< EOT > &, unsigned, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, unsigned, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoStochTournamentTruncateSplit< EOT >) 0.5 0 box
+ (eoReduce< EOT >) 0.5 1 box
+ (eoBF< eoPop< EOT > &, unsigned, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< eoPop< EOT > &, unsigned, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_truncate_split.tex b/trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_truncate_split.tex
new file mode 100644
index 000000000..36013a0af
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_truncate_split.tex
@@ -0,0 +1,50 @@
+\section{eo\-Stoch\-Tournament\-Truncate\-Split$<$ EOT $>$ Class Template Reference}
+\label{classeo_stoch_tournament_truncate_split}\index{eoStochTournamentTruncateSplit@{eoStochTournamentTruncateSplit}}
+a Reduce\-Split class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g.  
+
+
+{\tt \#include $<$eo\-Reduce\-Split.h$>$}
+
+Inheritance diagram for eo\-Stoch\-Tournament\-Truncate\-Split$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.45679cm]{classeo_stoch_tournament_truncate_split}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Stoch\-Tournament\-Truncate\-Split} (double \_\-t\_\-rate, {\bf eo\-How\-Many} \_\-how\-Many, bool \_\-return\-Eliminated=false)\label{classeo_stoch_tournament_truncate_split_a0}
+
+\begin{CompactList}\small\item\em Ctor: must provide amount of reduction, and whether or not you need to return the eliminated guys. \item\end{CompactList}\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-newgen, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-eliminated)\label{classeo_stoch_tournament_truncate_split_a1}
+
+\begin{CompactList}\small\item\em Performs repeated inverse\_\-stochastic\_\-tournament on the pop. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf t\_\-rate}\label{classeo_stoch_tournament_truncate_split_r0}
+
+\item 
+{\bf eo\-How\-Many} {\bf how\-Many}\label{classeo_stoch_tournament_truncate_split_r1}
+
+\item 
+bool {\bf return\-Eliminated}\label{classeo_stoch_tournament_truncate_split_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Stoch\-Tournament\-Truncate\-Split$<$ EOT $>$}
+
+a Reduce\-Split class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g. 
+
+see {\bf eo\-SSGAStoch\-Tournament\-Replacement}{\rm (p.\,\pageref{classeo_s_s_g_a_stoch_tournament_replacement})}) 
+
+
+
+Definition at line 256 of file eo\-Reduce\-Split.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Reduce\-Split.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_worth_select.eps b/trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_worth_select.eps
new file mode 100644
index 000000000..446249099
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_worth_select.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 144.509
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.46 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoStochTournamentWorthSelect< EOT, WorthT >) cw
+(eoSelectFromWorth< EOT, WorthT >) cw
+(eoSelectOne< EOT >) cw
+(eoUF< const eoPop< EOT > &, const EOT & >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, const EOT & >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoStochTournamentWorthSelect< EOT, WorthT >) 0.5 0 box
+ (eoSelectFromWorth< EOT, WorthT >) 0.5 1 box
+ (eoSelectOne< EOT >) 0.5 2 box
+ (eoUF< const eoPop< EOT > &, const EOT & >) 0.5 3 box
+ (eoFunctorBase) 0 4 box
+ (unary_function< const eoPop< EOT > &, const EOT & >) 1 4 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+1 0.5 3 in
+solid
+0 0.5 3 out
+solid
+0 1 4 conn
+solid
+1 0 4 in
+solid
+1 1 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_worth_select.tex b/trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_worth_select.tex
new file mode 100644
index 000000000..0903cda02
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_stoch_tournament_worth_select.tex
@@ -0,0 +1,50 @@
+\section{eo\-Stoch\-Tournament\-Worth\-Select$<$ EOT, Worth\-T $>$ Class Template Reference}
+\label{classeo_stoch_tournament_worth_select}\index{eoStochTournamentWorthSelect@{eoStochTournamentWorthSelect}}
+An instance of eo\-Select\-Perf2Worth that does selection from the Worthes using a ...  
+
+
+{\tt \#include $<$eo\-Select\-From\-Worth.h$>$}
+
+Inheritance diagram for eo\-Stoch\-Tournament\-Worth\-Select$<$ EOT, Worth\-T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4.04624cm]{classeo_stoch_tournament_worth_select}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef std::vector$<$ Worth\-T $>$::iterator {\bf worth\-Iterator}\label{classeo_stoch_tournament_worth_select_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Stoch\-Tournament\-Worth\-Select} ({\bf eo\-Perf2Worth}$<$ {\bf EOT}, Worth\-T $>$ \&\_\-perf2Worth, double \_\-t\-Rate)\label{classeo_stoch_tournament_worth_select_a0}
+
+\item 
+virtual const {\bf EOT} \& {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_stoch_tournament_worth_select_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf t\-Rate}\label{classeo_stoch_tournament_worth_select_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT, class Worth\-T = double$>$ class eo\-Stoch\-Tournament\-Worth\-Select$<$ EOT, Worth\-T $>$}
+
+An instance of eo\-Select\-Perf2Worth that does selection from the Worthes using a ... 
+
+stochastic tournament, yes! 
+
+
+
+Definition at line 128 of file eo\-Select\-From\-Worth.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Select\-From\-Worth.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_stochastic_universal_select.eps b/trunk/paradiseo-eo/doc/latex/classeo_stochastic_universal_select.eps
new file mode 100644
index 000000000..16d8e60cf
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_stochastic_universal_select.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 115.607
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.325 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoStochasticUniversalSelect< EOT >) cw
+(eoSelectOne< EOT >) cw
+(eoUF< const eoPop< EOT > &, const EOT & >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, const EOT & >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoStochasticUniversalSelect< EOT >) 0.5 0 box
+ (eoSelectOne< EOT >) 0.5 1 box
+ (eoUF< const eoPop< EOT > &, const EOT & >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< const eoPop< EOT > &, const EOT & >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_stochastic_universal_select.tex b/trunk/paradiseo-eo/doc/latex/classeo_stochastic_universal_select.tex
new file mode 100644
index 000000000..8a775f828
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_stochastic_universal_select.tex
@@ -0,0 +1,51 @@
+\section{eo\-Stochastic\-Universal\-Select$<$ EOT $>$ Class Template Reference}
+\label{classeo_stochastic_universal_select}\index{eoStochasticUniversalSelect@{eoStochasticUniversalSelect}}
+eo\-Stochastic\-Universal\-Select: select an individual proportional to her stored fitness value, but in contrast with eo\-Stochastic\-Universal\-Select, get rid of most finite sampling effects by doing all selections in one go, using a single random number.  
+
+
+{\tt \#include $<$eo\-Stochastic\-Universal\-Select.h$>$}
+
+Inheritance diagram for eo\-Stochastic\-Universal\-Select$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.23699cm]{classeo_stochastic_universal_select}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Stochastic\-Universal\-Select} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&pop={\bf eo\-Pop}$<$ {\bf EOT} $>$())\label{classeo_stochastic_universal_select_a0}
+
+\begin{CompactList}\small\item\em Sanity check. \item\end{CompactList}\item 
+void {\bf setup} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_stochastic_universal_select_a1}
+
+\begin{CompactList}\small\item\em virtual function to setup some population stats (for instance eo\-Proportional can benefit greatly from this) \item\end{CompactList}\item 
+const {\bf EOT} \& {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)\label{classeo_stochastic_universal_select_a2}
+
+\begin{CompactList}\small\item\em do the selection, \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Types}
+\begin{CompactItemize}
+\item 
+typedef std::vector$<$ unsigned $>$ {\bf Index\-Vec}\label{classeo_stochastic_universal_select_y0}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+Index\-Vec {\bf indices}\label{classeo_stochastic_universal_select_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Stochastic\-Universal\-Select$<$ EOT $>$}
+
+eo\-Stochastic\-Universal\-Select: select an individual proportional to her stored fitness value, but in contrast with eo\-Stochastic\-Universal\-Select, get rid of most finite sampling effects by doing all selections in one go, using a single random number. 
+
+
+
+Definition at line 44 of file eo\-Stochastic\-Universal\-Select.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Stochastic\-Universal\-Select.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_string.eps b/trunk/paradiseo-eo/doc/latex/classeo_string.eps
new file mode 100644
index 000000000..e8ac196b2
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_string.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 298.507
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.675 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoString< fitnessT >) cw
+(EO< fitnessT >) cw
+(eoObject) cw
+(eoPersistent) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoString< fitnessT >) 0.5 0 box
+ (EO< fitnessT >) 0.5 1 box
+ (eoObject) 0 2 box
+ (eoPersistent) 1 2 box
+ (eoPrintable) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_string.tex b/trunk/paradiseo-eo/doc/latex/classeo_string.tex
new file mode 100644
index 000000000..219d73834
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_string.tex
@@ -0,0 +1,72 @@
+\section{eo\-String$<$ fitness\-T $>$ Class Template Reference}
+\label{classeo_string}\index{eoString@{eoString}}
+Adaptor that turns an STL std::string into an {\bf EO}{\rm (p.\,\pageref{class_e_o})}.  
+
+
+{\tt \#include $<$eo\-String.h$>$}
+
+Inheritance diagram for eo\-String$<$ fitness\-T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_string}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef char {\bf Type}\label{classeo_string_w0}
+
+\item 
+typedef char {\bf Atom\-Type}\label{classeo_string_w1}
+
+\item 
+typedef std::string {\bf Container\-Type}\label{classeo_string_w2}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+{\bf }\par
+\begin{CompactItemize}
+\item 
+{\bf eo\-String} (const std::string \&\_\-str=\char`\"{}\char`\"{})\label{classeo_string_z24_0}
+
+\begin{CompactList}\small\item\em ctor \item\end{CompactList}\item 
+virtual void {\bf print\-On} (std::ostream \&os) const \label{classeo_string_z24_1}
+
+\begin{CompactList}\small\item\em printing... \item\end{CompactList}\end{CompactItemize}
+
+\begin{Indent}{\bf Methods from eo\-Object}\par
+{\em read\-From and print\-On are directly inherited from eo1d }\begin{CompactItemize}
+\item 
+virtual std::string {\bf class\-Name} () const 
+\begin{CompactList}\small\item\em Inherited from {\bf eo\-Object}{\rm (p.\,\pageref{classeo_object})}. \item\end{CompactList}\end{CompactItemize}
+\end{Indent}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class fitness\-T$>$ class eo\-String$<$ fitness\-T $>$}
+
+Adaptor that turns an STL std::string into an {\bf EO}{\rm (p.\,\pageref{class_e_o})}. 
+
+
+
+Definition at line 42 of file eo\-String.h.
+
+\subsection{Member Function Documentation}
+\index{eoString@{eo\-String}!className@{className}}
+\index{className@{className}!eoString@{eo\-String}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class fitness\-T$>$ virtual std::string {\bf eo\-String}$<$ fitness\-T $>$::class\-Name (void) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_string_z26_0}
+
+
+Inherited from {\bf eo\-Object}{\rm (p.\,\pageref{classeo_object})}. 
+
+\begin{Desc}
+\item[See also:]{\bf eo\-Object}{\rm (p.\,\pageref{classeo_object})} \end{Desc}
+
+
+Reimplemented from {\bf EO$<$ fitness\-T $>$} {\rm (p.\,\pageref{class_e_o_z10_0})}.
+
+Definition at line 74 of file eo\-String.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-String.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_subtree_x_over.eps b/trunk/paradiseo-eo/doc/latex/classeo_subtree_x_over.eps
new file mode 100644
index 000000000..96f3ebbf3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_subtree_x_over.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 48.84
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 10.2375 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSubtreeXOver< FType, Node >) cw
+(eoQuadOp< eoParseTree< FType, Node > >) cw
+(eoOp< eoParseTree< FType, Node > >) cw
+(eoBF< eoParseTree< FType, Node > &, eoParseTree< FType, Node > &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< eoParseTree< FType, Node > &, eoParseTree< FType, Node > &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSubtreeXOver< FType, Node >) 0.5 0 box
+ (eoQuadOp< eoParseTree< FType, Node > >) 0.5 1 box
+ (eoOp< eoParseTree< FType, Node > >) 0 2 box
+ (eoBF< eoParseTree< FType, Node > &, eoParseTree< FType, Node > &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< eoParseTree< FType, Node > &, eoParseTree< FType, Node > &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_subtree_x_over.tex b/trunk/paradiseo-eo/doc/latex/classeo_subtree_x_over.tex
new file mode 100644
index 000000000..b9c4719d5
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_subtree_x_over.tex
@@ -0,0 +1,70 @@
+\section{eo\-Subtree\-XOver$<$ FType, Node $>$ Class Template Reference}
+\label{classeo_subtree_x_over}\index{eoSubtreeXOver@{eoSubtreeXOver}}
+eo\-Subtree\-XOver --$>$ subtree xover  
+
+
+{\tt \#include $<$gp/eo\-Parse\-Tree\-Op.h$>$}
+
+Inheritance diagram for eo\-Subtree\-XOver$<$ FType, Node $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=1.36752cm]{classeo_subtree_x_over}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef {\bf eo\-Parse\-Tree}$<$ FType, Node $>$ {\bf Eo\-Type}\label{classeo_subtree_x_over_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Subtree\-XOver} (unsigned \_\-max\_\-length)
+\begin{CompactList}\small\item\em Constructor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_subtree_x_over_a1}
+
+\begin{CompactList}\small\item\em the ckassname \item\end{CompactList}\item 
+virtual {\bf $\sim$eo\-Subtree\-XOver} ()\label{classeo_subtree_x_over_a2}
+
+\begin{CompactList}\small\item\em Dtor. \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf Eo\-Type} \&\_\-eo1, {\bf Eo\-Type} \&\_\-eo2)\label{classeo_subtree_x_over_a3}
+
+\begin{CompactList}\small\item\em Perform crossover on two individuals param \_\-eo1 The first parent individual param \_\-eo2 The second parent individual. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf max\_\-length}\label{classeo_subtree_x_over_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class FType, class Node$>$ class eo\-Subtree\-XOver$<$ FType, Node $>$}
+
+eo\-Subtree\-XOver --$>$ subtree xover 
+
+
+
+Definition at line 42 of file eo\-Parse\-Tree\-Op.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoSubtreeXOver@{eo\-Subtree\-XOver}!eoSubtreeXOver@{eoSubtreeXOver}}
+\index{eoSubtreeXOver@{eoSubtreeXOver}!eoSubtreeXOver@{eo\-Subtree\-XOver}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ {\bf eo\-Subtree\-XOver}$<$ FType, Node $>$::{\bf eo\-Subtree\-XOver} (unsigned {\em \_\-max\_\-length})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_subtree_x_over_a0}
+
+
+Constructor. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-max\_\-length}]the maximum size of an individual \end{description}
+\end{Desc}
+
+
+Definition at line 50 of file eo\-Parse\-Tree\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Parse\-Tree\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_survive_and_die.eps b/trunk/paradiseo-eo/doc/latex/classeo_survive_and_die.eps
new file mode 100644
index 000000000..df4d11f2a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_survive_and_die.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 107.527
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.65 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSurviveAndDie< EOT >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoDeterministicSurviveAndDie< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSurviveAndDie< EOT >) 0.5 1 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+ (eoDeterministicSurviveAndDie< EOT >) 0.5 0 box
+
+% ----- relations -----
+
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
+solid
+1 0.5 0.25 out
+solid
+0 0.5 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_survive_and_die.tex b/trunk/paradiseo-eo/doc/latex/classeo_survive_and_die.tex
new file mode 100644
index 000000000..9f473f741
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_survive_and_die.tex
@@ -0,0 +1,42 @@
+\section{eo\-Survive\-And\-Die$<$ EOT $>$ Class Template Reference}
+\label{classeo_survive_and_die}\index{eoSurviveAndDie@{eoSurviveAndDie}}
+eo\-Survive\-And\-Die A pure abstract class, to store the howmany's  
+
+
+{\tt \#include $<$eo\-Survive\-And\-Die.h$>$}
+
+Inheritance diagram for eo\-Survive\-And\-Die$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.01075cm]{classeo_survive_and_die}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Survive\-And\-Die} (double \_\-survive, double \_\-die, bool \_\-interpret\_\-as\_\-rate=true)\label{classeo_survive_and_die_a0}
+
+\end{CompactItemize}
+\subsection*{Protected Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-How\-Many} {\bf howmany\-Survive}\label{classeo_survive_and_die_p0}
+
+\item 
+{\bf eo\-How\-Many} {\bf howmany\-Die}\label{classeo_survive_and_die_p1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Survive\-And\-Die$<$ EOT $>$}
+
+eo\-Survive\-And\-Die A pure abstract class, to store the howmany's 
+
+
+
+Definition at line 53 of file eo\-Survive\-And\-Die.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Survive\-And\-Die.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_sym_init.eps b/trunk/paradiseo-eo/doc/latex/classeo_sym_init.eps
new file mode 100644
index 000000000..76c47e086
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_sym_init.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 182.648
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.7375 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoSymInit< EoType >) cw
+(eoInit< EoType >) cw
+(eoUF< EoType &, void >) cw
+(eoFunctorBase) cw
+(unary_function< EoType &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoSymInit< EoType >) 0.5 0 box
+ (eoInit< EoType >) 0.5 1 box
+ (eoUF< EoType &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< EoType &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_sym_init.tex b/trunk/paradiseo-eo/doc/latex/classeo_sym_init.tex
new file mode 100644
index 000000000..53da9a38e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_sym_init.tex
@@ -0,0 +1,57 @@
+\section{eo\-Sym\-Init$<$ Eo\-Type $>$ Class Template Reference}
+\label{classeo_sym_init}\index{eoSymInit@{eoSymInit}}
+Default initializer, Koza style.  
+
+
+{\tt \#include $<$eo\-Sym\-Init.h$>$}
+
+Inheritance diagram for eo\-Sym\-Init$<$ Eo\-Type $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_sym_init}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Sym\-Init} (Tree\-Builder \&\_\-builder)\label{classeo_sym_init_a0}
+
+\begin{CompactList}\small\item\em By default build ramped half and half with max depth 6. \item\end{CompactList}\item 
+{\bf eo\-Sym\-Init} (Tree\-Builder \&\_\-builder, double \&\_\-grow\_\-prob, unsigned \&\_\-max\_\-depth)\label{classeo_sym_init_a1}
+
+\begin{CompactList}\small\item\em Control the grow\_\-prob and max\_\-depth externally. \item\end{CompactList}\item 
+void {\bf operator()} ({\bf Eo\-Type} \&tree)\label{classeo_sym_init_a2}
+
+\begin{CompactList}\small\item\em build the tree \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+Tree\-Builder \& {\bf builder}\label{classeo_sym_init_r0}
+
+\item 
+double {\bf own\_\-grow\_\-prob}\label{classeo_sym_init_r1}
+
+\item 
+unsigned {\bf own\_\-max\_\-depth}\label{classeo_sym_init_r2}
+
+\item 
+double \& {\bf grow\_\-prob}\label{classeo_sym_init_r3}
+
+\item 
+unsigned \& {\bf max\_\-depth}\label{classeo_sym_init_r4}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Eo\-Type$>$ class eo\-Sym\-Init$<$ Eo\-Type $>$}
+
+Default initializer, Koza style. 
+
+
+
+Definition at line 26 of file eo\-Sym\-Init.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Sym\-Init.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_time_counter.eps b/trunk/paradiseo-eo/doc/latex/classeo_time_counter.eps
new file mode 100644
index 000000000..81420c284
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_time_counter.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 242.424
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.0625 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoTimeCounter) cw
+(eoUpdater) cw
+(eoValueParam< double >) cw
+(eoF< void >) cw
+(eoParam) cw
+(eoFunctorBase) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoTimeCounter) 0.5 0 box
+ (eoUpdater) 0 1 box
+ (eoValueParam< double >) 1 1 box
+ (eoF< void >) 0 2 box
+ (eoParam) 1 2 box
+ (eoFunctorBase) 0 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+0 1 1 conn
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 1 1 in
+solid
+0 1 1 out
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 1 2 in
+solid
+1 0 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_time_counter.tex b/trunk/paradiseo-eo/doc/latex/classeo_time_counter.tex
new file mode 100644
index 000000000..bc2ba5a1d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_time_counter.tex
@@ -0,0 +1,37 @@
+\section{eo\-Time\-Counter Class Reference}
+\label{classeo_time_counter}\index{eoTimeCounter@{eoTimeCounter}}
+An {\bf eo\-Stat}{\rm (p.\,\pageref{classeo_stat})} that simply gives the user time since first generation It has to be tempatized by EOT because it must be an {\bf eo\-Stat}{\rm (p.\,\pageref{classeo_stat})}.  
+
+
+{\tt \#include $<$eo\-Time\-Counter.h$>$}
+
+Inheritance diagram for eo\-Time\-Counter::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_time_counter}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual void {\bf operator()} ()\label{classeo_time_counter_a1}
+
+\begin{CompactList}\small\item\em simply stores the time spent in process in its {\bf value()}{\rm (p.\,\pageref{classeo_value_param_a2})} \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+clock\_\-t {\bf utime}\label{classeo_time_counter_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+An {\bf eo\-Stat}{\rm (p.\,\pageref{classeo_stat})} that simply gives the user time since first generation It has to be tempatized by EOT because it must be an {\bf eo\-Stat}{\rm (p.\,\pageref{classeo_stat})}. 
+
+
+
+Definition at line 38 of file eo\-Time\-Counter.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Time\-Counter.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_time_varying_loop_eval.eps b/trunk/paradiseo-eo/doc/latex/classeo_time_varying_loop_eval.eps
new file mode 100644
index 000000000..c5be6d7b2
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_time_varying_loop_eval.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 107.527
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.65 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoTimeVaryingLoopEval< EOT >) cw
+(eoPopEvalFunc< EOT >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoTimeVaryingLoopEval< EOT >) 0.5 0 box
+ (eoPopEvalFunc< EOT >) 0.5 1 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_time_varying_loop_eval.tex b/trunk/paradiseo-eo/doc/latex/classeo_time_varying_loop_eval.tex
new file mode 100644
index 000000000..6bc693523
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_time_varying_loop_eval.tex
@@ -0,0 +1,42 @@
+\section{eo\-Time\-Varying\-Loop\-Eval$<$ EOT $>$ Class Template Reference}
+\label{classeo_time_varying_loop_eval}\index{eoTimeVaryingLoopEval@{eoTimeVaryingLoopEval}}
+{\bf eo\-Pop\-Loop\-Eval}{\rm (p.\,\pageref{classeo_pop_loop_eval})}: an instance of {\bf eo\-Pop\-Eval\-Func}{\rm (p.\,\pageref{classeo_pop_eval_func})} that simply applies a private {\bf eo\-Eval\-Func}{\rm (p.\,\pageref{classeo_eval_func})} to all offspring AND ALL PARENTS as the fitness is supposed here to vary  
+
+
+{\tt \#include $<$eo\-Pop\-Eval\-Func.h$>$}
+
+Inheritance diagram for eo\-Time\-Varying\-Loop\-Eval$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.01075cm]{classeo_time_varying_loop_eval}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Time\-Varying\-Loop\-Eval} ({\bf eo\-Eval\-Func}$<$ {\bf EOT} $>$ \&\_\-eval)\label{classeo_time_varying_loop_eval_a0}
+
+\begin{CompactList}\small\item\em Ctor: set value of embedded {\bf eo\-Eval\-Func}{\rm (p.\,\pageref{classeo_eval_func})}. \item\end{CompactList}\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-parents, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-offspring)\label{classeo_time_varying_loop_eval_a1}
+
+\begin{CompactList}\small\item\em Do the job: simple loop over the offspring. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Eval\-Func}$<$ {\bf EOT} $>$ \& {\bf eval}\label{classeo_time_varying_loop_eval_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Time\-Varying\-Loop\-Eval$<$ EOT $>$}
+
+{\bf eo\-Pop\-Loop\-Eval}{\rm (p.\,\pageref{classeo_pop_loop_eval})}: an instance of {\bf eo\-Pop\-Eval\-Func}{\rm (p.\,\pageref{classeo_pop_eval_func})} that simply applies a private {\bf eo\-Eval\-Func}{\rm (p.\,\pageref{classeo_eval_func})} to all offspring AND ALL PARENTS as the fitness is supposed here to vary 
+
+
+
+Definition at line 84 of file eo\-Pop\-Eval\-Func.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Pop\-Eval\-Func.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_timed_dyn_update.eps b/trunk/paradiseo-eo/doc/latex/classeo_timed_dyn_update.eps
new file mode 100644
index 000000000..72a2c433d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_timed_dyn_update.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 775.194
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 0.645 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoTimedDynUpdate) cw
+(eoDynUpdater) cw
+(eoUpdater) cw
+(eoF< void >) cw
+(eoFunctorBase) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoTimedDynUpdate) 0 0 box
+ (eoDynUpdater) 0 1 box
+ (eoUpdater) 0 2 box
+ (eoF< void >) 0 3 box
+ (eoFunctorBase) 0 4 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 0 3 in
+solid
+0 0 3 out
+solid
+1 0 4 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_timed_dyn_update.tex b/trunk/paradiseo-eo/doc/latex/classeo_timed_dyn_update.tex
new file mode 100644
index 000000000..d7a99b12b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_timed_dyn_update.tex
@@ -0,0 +1,46 @@
+\section{eo\-Timed\-Dyn\-Update Class Reference}
+\label{classeo_timed_dyn_update}\index{eoTimedDynUpdate@{eoTimedDynUpdate}}
+An {\bf eo\-Updater}{\rm (p.\,\pageref{classeo_updater})} to update an {\bf eo\-Updatable}{\rm (p.\,\pageref{classeo_updatable})} object every given time interval.  
+
+
+{\tt \#include $<$eo\-Updatable.h$>$}
+
+Inheritance diagram for eo\-Timed\-Dyn\-Update::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=5cm]{classeo_timed_dyn_update}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Timed\-Dyn\-Update} ({\bf eo\-Updatable} \&\_\-to\-Update, time\_\-t \_\-interval)\label{classeo_timed_dyn_update_a0}
+
+\item 
+void {\bf operator()} (void)\label{classeo_timed_dyn_update_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+const time\_\-t {\bf interval}\label{classeo_timed_dyn_update_r0}
+
+\item 
+time\_\-t {\bf last\_\-time}\label{classeo_timed_dyn_update_r1}
+
+\item 
+const time\_\-t {\bf first\_\-time}\label{classeo_timed_dyn_update_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+An {\bf eo\-Updater}{\rm (p.\,\pageref{classeo_updater})} to update an {\bf eo\-Updatable}{\rm (p.\,\pageref{classeo_updatable})} object every given time interval. 
+
+
+
+Definition at line 67 of file eo\-Updatable.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Updatable.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_timed_monitor.eps b/trunk/paradiseo-eo/doc/latex/classeo_timed_monitor.eps
new file mode 100644
index 000000000..a7e889393
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_timed_monitor.eps
@@ -0,0 +1,209 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 583.942
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 0.85625 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoTimedMonitor) cw
+(eoMonitor) cw
+(eoF< eoMonitor & >) cw
+(eoFunctorBase) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoTimedMonitor) 0 0 box
+ (eoMonitor) 0 1 box
+ (eoF< eoMonitor & >) 0 2 box
+ (eoFunctorBase) 0 3 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 0 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_timed_monitor.tex b/trunk/paradiseo-eo/doc/latex/classeo_timed_monitor.tex
new file mode 100644
index 000000000..f9e83bb61
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_timed_monitor.tex
@@ -0,0 +1,52 @@
+\section{eo\-Timed\-Monitor Class Reference}
+\label{classeo_timed_monitor}\index{eoTimedMonitor@{eoTimedMonitor}}
+Holds a collection of monitors and only fires them when a time limit has been reached.  
+
+
+{\tt \#include $<$eo\-Timed\-Monitor.h$>$}
+
+Inheritance diagram for eo\-Timed\-Monitor::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_timed_monitor}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Timed\-Monitor} (int seconds\_\-)\label{classeo_timed_monitor_a0}
+
+\item 
+{\bf eo\-Monitor} \& {\bf operator()} (void)\label{classeo_timed_monitor_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\item 
+void {\bf add} ({\bf eo\-Monitor} \&mon)\label{classeo_timed_monitor_a2}
+
+\item 
+virtual std::string {\bf class\-Name} (void) const \label{classeo_timed_monitor_a3}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+clock\_\-t {\bf last\_\-tick}\label{classeo_timed_monitor_r0}
+
+\item 
+int {\bf seconds}\label{classeo_timed_monitor_r1}
+
+\item 
+std::vector$<$ {\bf eo\-Monitor} $\ast$ $>$ {\bf monitors}\label{classeo_timed_monitor_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Holds a collection of monitors and only fires them when a time limit has been reached. 
+
+
+
+Definition at line 40 of file eo\-Timed\-Monitor.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Timed\-Monitor.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_timed_state_saver.eps b/trunk/paradiseo-eo/doc/latex/classeo_timed_state_saver.eps
new file mode 100644
index 000000000..e0fd51da5
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_timed_state_saver.eps
@@ -0,0 +1,209 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 620.155
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 0.80625 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoTimedStateSaver) cw
+(eoUpdater) cw
+(eoF< void >) cw
+(eoFunctorBase) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoTimedStateSaver) 0 0 box
+ (eoUpdater) 0 1 box
+ (eoF< void >) 0 2 box
+ (eoFunctorBase) 0 3 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 0 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_timed_state_saver.tex b/trunk/paradiseo-eo/doc/latex/classeo_timed_state_saver.tex
new file mode 100644
index 000000000..b7940111d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_timed_state_saver.tex
@@ -0,0 +1,59 @@
+\section{eo\-Timed\-State\-Saver Class Reference}
+\label{classeo_timed_state_saver}\index{eoTimedStateSaver@{eoTimedStateSaver}}
+an {\bf eo\-Updater}{\rm (p.\,\pageref{classeo_updater})} that saves a state every given time interval  
+
+
+{\tt \#include $<$eo\-Updater.h$>$}
+
+Inheritance diagram for eo\-Timed\-State\-Saver::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_timed_state_saver}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Timed\-State\-Saver} (time\_\-t \_\-interval, const {\bf eo\-State} \&\_\-state, std::string \_\-prefix=\char`\"{}state\char`\"{}, std::string \_\-extension=\char`\"{}sav\char`\"{})\label{classeo_timed_state_saver_a0}
+
+\item 
+void {\bf operator()} (void)\label{classeo_timed_state_saver_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} (void) const \label{classeo_timed_state_saver_a2}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+const {\bf eo\-State} \& {\bf state}\label{classeo_timed_state_saver_r0}
+
+\item 
+const time\_\-t {\bf interval}\label{classeo_timed_state_saver_r1}
+
+\item 
+time\_\-t {\bf last\_\-time}\label{classeo_timed_state_saver_r2}
+
+\item 
+const time\_\-t {\bf first\_\-time}\label{classeo_timed_state_saver_r3}
+
+\item 
+const std::string {\bf prefix}\label{classeo_timed_state_saver_r4}
+
+\item 
+const std::string {\bf extension}\label{classeo_timed_state_saver_r5}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+an {\bf eo\-Updater}{\rm (p.\,\pageref{classeo_updater})} that saves a state every given time interval 
+
+
+
+Definition at line 104 of file eo\-Updater.h.
+
+The documentation for this class was generated from the following files:\begin{CompactItemize}
+\item 
+eo\-Updater.h\item 
+eo\-Updater.cpp\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_transform.eps b/trunk/paradiseo-eo/doc/latex/classeo_transform.eps
new file mode 100644
index 000000000..5b7ef4392
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_transform.eps
@@ -0,0 +1,225 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 102.171
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.89375 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoTransform< EOT >) cw
+(eoUF< eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(unary_function< eoPop< EOT > &, void >) cw
+(eoDynSGATransform< EOT >) cw
+(eoEasyEA< EOT >::eoDummyTransform) cw
+(eoSGATransform< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoTransform< EOT >) 1 1 box
+ (eoUF< eoPop< EOT > &, void >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< eoPop< EOT > &, void >) 1.5 3 box
+ (eoDynSGATransform< EOT >) 0 0 box
+ (eoEasyEA< EOT >::eoDummyTransform) 1 0 box
+ (eoSGATransform< EOT >) 2 0 box
+
+% ----- relations -----
+
+solid
+0 1 1 out
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
+solid
+1 1 0.25 out
+solid
+0 2 1 conn
+solid
+0 0 0.75 in
+solid
+0 1 0.75 in
+solid
+0 2 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_transform.tex b/trunk/paradiseo-eo/doc/latex/classeo_transform.tex
new file mode 100644
index 000000000..b40a3161b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_transform.tex
@@ -0,0 +1,27 @@
+\section{eo\-Transform$<$ EOT $>$ Class Template Reference}
+\label{classeo_transform}\index{eoTransform@{eoTransform}}
+eo\-Transform transforms a population by applying genetic operators on it.  
+
+
+{\tt \#include $<$eo\-Transform.h$>$}
+
+Inheritance diagram for eo\-Transform$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.86079cm]{classeo_transform}
+\end{center}
+\end{figure}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Transform$<$ EOT $>$}
+
+eo\-Transform transforms a population by applying genetic operators on it. 
+
+
+
+Definition at line 38 of file eo\-Transform.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Transform.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_trunc_select.eps b/trunk/paradiseo-eo/doc/latex/classeo_trunc_select.eps
new file mode 100644
index 000000000..499e8d367
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_trunc_select.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 98.2801
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.0875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoTruncSelect< EOT >) cw
+(eoSelect< EOT >) cw
+(eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< const eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoTruncSelect< EOT >) 0.5 0 box
+ (eoSelect< EOT >) 0.5 1 box
+ (eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< const eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_trunc_select.tex b/trunk/paradiseo-eo/doc/latex/classeo_trunc_select.tex
new file mode 100644
index 000000000..6bf8ae24b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_trunc_select.tex
@@ -0,0 +1,67 @@
+\section{eo\-Trunc\-Select$<$ EOT $>$ Class Template Reference}
+\label{classeo_trunc_select}\index{eoTruncSelect@{eoTruncSelect}}
+eo\-Trunc\-Select selects individuals after truncating the population using {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} as it's mechanism.  
+
+
+{\tt \#include $<$eo\-Trunc\-Select.h$>$}
+
+Inheritance diagram for eo\-Trunc\-Select$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.75184cm]{classeo_trunc_select}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Trunc\-Select} ({\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \&\_\-select, {\bf eo\-How\-Many} \_\-how\-Many)\label{classeo_trunc_select_a0}
+
+\begin{CompactList}\small\item\em Ctor: from an {\bf eo\-Select}{\rm (p.\,\pageref{classeo_select})} (and an eo\-Many to tell how many are kept for selectino. \item\end{CompactList}\item 
+virtual void {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-source, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-dest)
+\begin{CompactList}\small\item\em The implementation repeatidly selects an individual. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \& {\bf select}\label{classeo_trunc_select_r0}
+
+\item 
+{\bf eo\-How\-Many} {\bf how\-Many}\label{classeo_trunc_select_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Trunc\-Select$<$ EOT $>$}
+
+eo\-Trunc\-Select selects individuals after truncating the population using {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} as it's mechanism. 
+
+Therefore {\bf eo\-Select\-Many}{\rm (p.\,\pageref{classeo_select_many})} needs an {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} in its ctor It will use an eo\-How\-Mnay to determine the number of guys to keep, 
+
+
+
+Definition at line 43 of file eo\-Trunc\-Select.h.
+
+\subsection{Member Function Documentation}
+\index{eoTruncSelect@{eo\-Trunc\-Select}!operator()@{operator()}}
+\index{operator()@{operator()}!eoTruncSelect@{eo\-Trunc\-Select}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ virtual void {\bf eo\-Trunc\-Select}$<$ {\bf EOT} $>$::operator() (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\em \_\-source}, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\em \_\-dest})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_trunc_select_a1}
+
+
+The implementation repeatidly selects an individual. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-source}]the source population \item[{\em \_\-dest}]the resulting population (size of this population is the number of times {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} is called. It empties the destination and adds the selection into it) \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-BF$<$ const eo\-Pop$<$ EOT $>$ \&, eo\-Pop$<$ EOT $>$ \&, void $>$} {\rm (p.\,\pageref{classeo_b_f_a1})}.
+
+Definition at line 56 of file eo\-Trunc\-Select.h.
+
+References eo\-Select\-One$<$ EOT, Worth\-T $>$::setup().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Trunc\-Select.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_truncate.eps b/trunk/paradiseo-eo/doc/latex/classeo_truncate.eps
new file mode 100644
index 000000000..f5f90e0d9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_truncate.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 123.457
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.05 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoTruncate< EOT >) cw
+(eoReduce< EOT >) cw
+(eoBF< eoPop< EOT > &, unsigned, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, unsigned, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoTruncate< EOT >) 0.5 0 box
+ (eoReduce< EOT >) 0.5 1 box
+ (eoBF< eoPop< EOT > &, unsigned, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< eoPop< EOT > &, unsigned, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_truncate.tex b/trunk/paradiseo-eo/doc/latex/classeo_truncate.tex
new file mode 100644
index 000000000..db7b3d078
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_truncate.tex
@@ -0,0 +1,33 @@
+\section{eo\-Truncate$<$ EOT $>$ Class Template Reference}
+\label{classeo_truncate}\index{eoTruncate@{eoTruncate}}
+truncation method using sort  
+
+
+{\tt \#include $<$eo\-Reduce.h$>$}
+
+Inheritance diagram for eo\-Truncate$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.45679cm]{classeo_truncate}
+\end{center}
+\end{figure}
+\subsection*{Private Member Functions}
+\begin{CompactItemize}
+\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-newgen, unsigned \_\-newsize)\label{classeo_truncate_d0}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Truncate$<$ EOT $>$}
+
+truncation method using sort 
+
+
+
+Definition at line 49 of file eo\-Reduce.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Reduce.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_truncate_split.eps b/trunk/paradiseo-eo/doc/latex/classeo_truncate_split.eps
new file mode 100644
index 000000000..60b47684e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_truncate_split.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 107.527
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.65 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoTruncateSplit< EOT >) cw
+(eoReduceSplit< EOT >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoTruncateSplit< EOT >) 0.5 0 box
+ (eoReduceSplit< EOT >) 0.5 1 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_truncate_split.tex b/trunk/paradiseo-eo/doc/latex/classeo_truncate_split.tex
new file mode 100644
index 000000000..069248b28
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_truncate_split.tex
@@ -0,0 +1,45 @@
+\section{eo\-Truncate\-Split$<$ EOT $>$ Class Template Reference}
+\label{classeo_truncate_split}\index{eoTruncateSplit@{eoTruncateSplit}}
+deterministic truncation method using sort  
+
+
+{\tt \#include $<$eo\-Reduce\-Split.h$>$}
+
+Inheritance diagram for eo\-Truncate\-Split$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.01075cm]{classeo_truncate_split}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Truncate\-Split} ({\bf eo\-How\-Many} \_\-how\-Many, bool \_\-return\-Eliminated=false)\label{classeo_truncate_split_a0}
+
+\begin{CompactList}\small\item\em Ctor: must provide amount of reduction, and whether or not you need to return the eliminated guys. \item\end{CompactList}\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-newgen, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-eliminated)\label{classeo_truncate_split_a1}
+
+\begin{CompactList}\small\item\em do the jonb \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-How\-Many} {\bf how\-Many}\label{classeo_truncate_split_r0}
+
+\item 
+bool {\bf return\-Eliminated}\label{classeo_truncate_split_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Truncate\-Split$<$ EOT $>$}
+
+deterministic truncation method using sort 
+
+
+
+Definition at line 47 of file eo\-Reduce\-Split.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Reduce\-Split.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_truncated_select_many.eps b/trunk/paradiseo-eo/doc/latex/classeo_truncated_select_many.eps
new file mode 100644
index 000000000..22e2f5d12
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_truncated_select_many.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 98.2801
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.0875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoTruncatedSelectMany< EOT >) cw
+(eoSelect< EOT >) cw
+(eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< const eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoTruncatedSelectMany< EOT >) 0.5 0 box
+ (eoSelect< EOT >) 0.5 1 box
+ (eoBF< const eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< const eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_truncated_select_many.tex b/trunk/paradiseo-eo/doc/latex/classeo_truncated_select_many.tex
new file mode 100644
index 000000000..58c7ef9ca
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_truncated_select_many.tex
@@ -0,0 +1,81 @@
+\section{eo\-Truncated\-Select\-Many$<$ EOT $>$ Class Template Reference}
+\label{classeo_truncated_select_many}\index{eoTruncatedSelectMany@{eoTruncatedSelectMany}}
+eo\-Truncated\-Select\-Many selects many individuals using {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} as it's mechanism.  
+
+
+{\tt \#include $<$eo\-Truncated\-Select\-Many.h$>$}
+
+Inheritance diagram for eo\-Truncated\-Select\-Many$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.75184cm]{classeo_truncated_select_many}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Truncated\-Select\-Many} ({\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \&\_\-select, double \_\-rate\-Genitors, double \_\-rate\-Fertile, bool \_\-interpret\_\-as\_\-rate\-G=true, bool \_\-interpret\_\-as\_\-rate\-F=true)\label{classeo_truncated_select_many_a0}
+
+\begin{CompactList}\small\item\em Ctor. \item\end{CompactList}\item 
+{\bf eo\-Truncated\-Select\-Many} ({\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \&\_\-select, {\bf eo\-How\-Many} \_\-how\-Many\-Genitors, {\bf eo\-How\-Many} \_\-how\-Many\-Fertile)\label{classeo_truncated_select_many_a1}
+
+\item 
+virtual void {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-source, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-dest)
+\begin{CompactList}\small\item\em The implementation repeatidly selects an individual. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \& {\bf select}\label{classeo_truncated_select_many_r0}
+
+\item 
+{\bf eo\-How\-Many} {\bf how\-Many\-Genitors}\label{classeo_truncated_select_many_r1}
+
+\item 
+{\bf eo\-How\-Many} {\bf how\-Many\-Fertile}\label{classeo_truncated_select_many_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Truncated\-Select\-Many$<$ EOT $>$}
+
+eo\-Truncated\-Select\-Many selects many individuals using {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} as it's mechanism. 
+
+Therefore {\bf eo\-Select\-Many}{\rm (p.\,\pageref{classeo_select_many})} needs an {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} in its ctor
+
+It will use an eo\-How\-Mnay to determine the number of guys to select, and push them to the back of the destination population.
+
+And it will only perform selection from the top guys in the population.
+
+It is NOT a special case of {\bf eo\-Select\-Many}{\rm (p.\,\pageref{classeo_select_many})} because it needs to SORT the population to discard the worst guys before doing the selection
+
+However, the same result can be obtained by embedding an {\bf eo\-Truncated\-Select\-One}{\rm (p.\,\pageref{classeo_truncated_select_one})} into an {\bf eo\-Select\-Many}{\rm (p.\,\pageref{classeo_select_many})} ... 
+
+
+
+Definition at line 53 of file eo\-Truncated\-Select\-Many.h.
+
+\subsection{Member Function Documentation}
+\index{eoTruncatedSelectMany@{eo\-Truncated\-Select\-Many}!operator()@{operator()}}
+\index{operator()@{operator()}!eoTruncatedSelectMany@{eo\-Truncated\-Select\-Many}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ virtual void {\bf eo\-Truncated\-Select\-Many}$<$ {\bf EOT} $>$::operator() (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\em \_\-source}, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\em \_\-dest})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_truncated_select_many_a2}
+
+
+The implementation repeatidly selects an individual. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-source}]the source population \item[{\em \_\-dest}]the resulting population (size of this population is the number of times {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} is called. It empties the destination and adds the selection into it) \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-BF$<$ const eo\-Pop$<$ EOT $>$ \&, eo\-Pop$<$ EOT $>$ \&, void $>$} {\rm (p.\,\pageref{classeo_b_f_a1})}.
+
+Definition at line 77 of file eo\-Truncated\-Select\-Many.h.
+
+References eo\-Select\-One$<$ EOT, Worth\-T $>$::setup(), eo\-Pop$<$ EOT $>$::shuffle(), and eo\-Pop$<$ EOT $>$::sort().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Truncated\-Select\-Many.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_truncated_select_one.eps b/trunk/paradiseo-eo/doc/latex/classeo_truncated_select_one.eps
new file mode 100644
index 000000000..f855b0f34
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_truncated_select_one.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 115.607
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.325 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoTruncatedSelectOne< EOT >) cw
+(eoSelectOne< EOT >) cw
+(eoUF< const eoPop< EOT > &, const EOT & >) cw
+(eoFunctorBase) cw
+(unary_function< const eoPop< EOT > &, const EOT & >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoTruncatedSelectOne< EOT >) 0.5 0 box
+ (eoSelectOne< EOT >) 0.5 1 box
+ (eoUF< const eoPop< EOT > &, const EOT & >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< const eoPop< EOT > &, const EOT & >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_truncated_select_one.tex b/trunk/paradiseo-eo/doc/latex/classeo_truncated_select_one.tex
new file mode 100644
index 000000000..7d2963f78
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_truncated_select_one.tex
@@ -0,0 +1,79 @@
+\section{eo\-Truncated\-Select\-One$<$ EOT $>$ Class Template Reference}
+\label{classeo_truncated_select_one}\index{eoTruncatedSelectOne@{eoTruncatedSelectOne}}
+eo\-Truncated\-Select\-One selects one individual using {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} as it's mechanism.  
+
+
+{\tt \#include $<$eo\-Truncated\-Select\-One.h$>$}
+
+Inheritance diagram for eo\-Truncated\-Select\-One$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.23699cm]{classeo_truncated_select_one}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Truncated\-Select\-One} ({\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \&\_\-select, double \_\-rate\-Fertile, bool \_\-interpret\_\-as\_\-rate\-F=true)\label{classeo_truncated_select_one_a0}
+
+\begin{CompactList}\small\item\em Ctor from rate and bool. \item\end{CompactList}\item 
+{\bf eo\-Truncated\-Select\-One} ({\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \&\_\-select, {\bf eo\-How\-Many} \_\-how\-Many\-Fertile)\label{classeo_truncated_select_one_a1}
+
+\begin{CompactList}\small\item\em Ctor with {\bf eo\-How\-Many}{\rm (p.\,\pageref{classeo_how_many})}. \item\end{CompactList}\item 
+void {\bf setup} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-source)\label{classeo_truncated_select_one_a2}
+
+\begin{CompactList}\small\item\em setup procedures: fills the temporary population with the fertile guys \item\end{CompactList}\item 
+const {\bf EOT} \& {\bf operator()} (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop)
+\begin{CompactList}\small\item\em The implementation selects an individual from the fertile pop. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Select\-One}$<$ {\bf EOT} $>$ \& {\bf select}\label{classeo_truncated_select_one_r0}
+
+\item 
+{\bf eo\-How\-Many} {\bf how\-Many\-Fertile}\label{classeo_truncated_select_one_r1}
+
+\item 
+{\bf eo\-Pop}$<$ {\bf EOT} $>$ {\bf tmp\-Pop}\label{classeo_truncated_select_one_r2}
+
+\item 
+{\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\bf actual\-Pop}\label{classeo_truncated_select_one_r3}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Truncated\-Select\-One$<$ EOT $>$}
+
+eo\-Truncated\-Select\-One selects one individual using {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} as it's mechanism. 
+
+Therefore eo\-Truncated\-Select\-One needs an {\bf eo\-Select\-One}{\rm (p.\,\pageref{classeo_select_one})} in its ctor
+
+It will perform selection only from the top guys in the population. 
+
+
+
+Definition at line 45 of file eo\-Truncated\-Select\-One.h.
+
+\subsection{Member Function Documentation}
+\index{eoTruncatedSelectOne@{eo\-Truncated\-Select\-One}!operator()@{operator()}}
+\index{operator()@{operator()}!eoTruncatedSelectOne@{eo\-Truncated\-Select\-One}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ const {\bf EOT}\& {\bf eo\-Truncated\-Select\-One}$<$ {\bf EOT} $>$::operator() (const {\bf eo\-Pop}$<$ {\bf EOT} $>$ \& {\em \_\-pop})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_truncated_select_one_a3}
+
+
+The implementation selects an individual from the fertile pop. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-source}]the source population \item[{\em \_\-dest}]the selected guy \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-UF$<$ const eo\-Pop$<$ EOT $>$ \&, const EOT \& $>$} {\rm (p.\,\pageref{classeo_u_f_a1})}.
+
+Definition at line 98 of file eo\-Truncated\-Select\-One.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Truncated\-Select\-One.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_u_bit_xover.eps b/trunk/paradiseo-eo/doc/latex/classeo_u_bit_xover.eps
new file mode 100644
index 000000000..96e8379cf
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_u_bit_xover.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 96.6184
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.175 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoUBitXover< Chrom >) cw
+(eoQuadOp< Chrom >) cw
+(eoOp< Chrom >) cw
+(eoBF< Chrom &, Chrom &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< Chrom &, Chrom &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoUBitXover< Chrom >) 0.5 0 box
+ (eoQuadOp< Chrom >) 0.5 1 box
+ (eoOp< Chrom >) 0 2 box
+ (eoBF< Chrom &, Chrom &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< Chrom &, Chrom &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_u_bit_xover.tex b/trunk/paradiseo-eo/doc/latex/classeo_u_bit_xover.tex
new file mode 100644
index 000000000..3862677d7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_u_bit_xover.tex
@@ -0,0 +1,63 @@
+\section{eo\-UBit\-Xover$<$ Chrom $>$ Class Template Reference}
+\label{classeo_u_bit_xover}\index{eoUBitXover@{eoUBitXover}}
+eo\-UBit\-Xover --$>$ classic Uniform crossover  
+
+
+{\tt \#include $<$ga/eo\-Bit\-Op.h$>$}
+
+Inheritance diagram for eo\-UBit\-Xover$<$ Chrom $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.70531cm]{classeo_u_bit_xover}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-UBit\-Xover} (const float \&\_\-preference=0.5)\label{classeo_u_bit_xover_a0}
+
+\begin{CompactList}\small\item\em (Default) Constructor. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_u_bit_xover_a1}
+
+\begin{CompactList}\small\item\em The class name. \item\end{CompactList}\item 
+bool {\bf operator()} (Chrom \&chrom1, Chrom \&chrom2)
+\begin{CompactList}\small\item\em Uniform crossover for binary chromosomes. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+float {\bf preference}\label{classeo_u_bit_xover_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Chrom$>$ class eo\-UBit\-Xover$<$ Chrom $>$}
+
+eo\-UBit\-Xover --$>$ classic Uniform crossover 
+
+
+
+Definition at line 274 of file eo\-Bit\-Op.h.
+
+\subsection{Member Function Documentation}
+\index{eoUBitXover@{eo\-UBit\-Xover}!operator()@{operator()}}
+\index{operator()@{operator()}!eoUBitXover@{eo\-UBit\-Xover}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Chrom$>$ bool {\bf eo\-UBit\-Xover}$<$ Chrom $>$::operator() (Chrom \& {\em chrom1}, Chrom \& {\em chrom2})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_u_bit_xover_a2}
+
+
+Uniform crossover for binary chromosomes. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em chrom1}]The first chromosome. \item[{\em chrom2}]The first chromosome. ::runtime\_\-error if sizes don't match \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-BF$<$ Chrom \&, Chrom \&, bool $>$} {\rm (p.\,\pageref{classeo_b_f_a1})}.
+
+Definition at line 292 of file eo\-Bit\-Op.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Bit\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_u_f.eps b/trunk/paradiseo-eo/doc/latex/classeo_u_f.eps
new file mode 100644
index 000000000..fdace8fe2
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_u_f.eps
@@ -0,0 +1,203 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 368.098
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.35833 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 3 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoUF< A1, R >) cw
+(eoFunctorBase) cw
+(eoPerf2Worth< Dummy >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoUF< A1, R >) 0 1 box
+ (eoFunctorBase) 0 2 box
+ (eoPerf2Worth< Dummy >) 0 0 box
+
+% ----- relations -----
+
+solid
+0 0 1 out
+solid
+1 0 2 in
+solid
+1 0 0.25 out
+solid
+0 0 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_u_f.tex b/trunk/paradiseo-eo/doc/latex/classeo_u_f.tex
new file mode 100644
index 000000000..bf7026006
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_u_f.tex
@@ -0,0 +1,44 @@
+\section{eo\-UF$<$ A1, R $>$ Class Template Reference}
+\label{classeo_u_f}\index{eoUF@{eoUF}}
+Basic Unary Functor.  
+
+
+{\tt \#include $<$eo\-Functor.h$>$}
+
+Inheritance diagram for eo\-UF$<$ A1, R $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3cm]{classeo_u_f}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual {\bf $\sim$eo\-UF} ()\label{classeo_u_f_a0}
+
+\begin{CompactList}\small\item\em virtual dtor here so there is no need to define it in derived classes \item\end{CompactList}\item 
+virtual R {\bf operator()} (A1)=0\label{classeo_u_f_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Static Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Functor\-Base::unary\_\-function\_\-tag} {\bf functor\_\-category} ()\label{classeo_u_f_e0}
+
+\begin{CompactList}\small\item\em tag to identify a procedure in compile time function selection functor\_\-category \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class A1, class R$>$ class eo\-UF$<$ A1, R $>$}
+
+Basic Unary Functor. 
+
+Derive from this class when defining any unary function. First template argument is the first\_\-argument\_\-type, second result\_\-type. Argument and result types can be any type including void for result\_\-type 
+
+
+
+Definition at line 108 of file eo\-Functor.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Functor.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_unary_functor_counter.eps b/trunk/paradiseo-eo/doc/latex/classeo_unary_functor_counter.eps
new file mode 100644
index 000000000..acbb2eb0b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_unary_functor_counter.eps
@@ -0,0 +1,203 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 231.66
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.15833 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 3 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoUnaryFunctorCounter< UnaryFunctor >) cw
+(eoValueParam< unsigned long >) cw
+(eoParam) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoUnaryFunctorCounter< UnaryFunctor >) 0 0 box
+ (eoValueParam< unsigned long >) 0 1 box
+ (eoParam) 0 2 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_unary_functor_counter.tex b/trunk/paradiseo-eo/doc/latex/classeo_unary_functor_counter.tex
new file mode 100644
index 000000000..eeece80fb
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_unary_functor_counter.tex
@@ -0,0 +1,71 @@
+\section{eo\-Unary\-Functor\-Counter$<$ Unary\-Functor $>$ Class Template Reference}
+\label{classeo_unary_functor_counter}\index{eoUnaryFunctorCounter@{eoUnaryFunctorCounter}}
+Generic counter class that counts the number of times a unary function is used.  
+
+
+{\tt \#include $<$eo\-Counter.h$>$}
+
+Inheritance diagram for eo\-Unary\-Functor\-Counter$<$ Unary\-Functor $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3cm]{classeo_unary_functor_counter}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Unary\-Functor\-Counter} (Unary\-Functor \&\_\-func, std::string \_\-name=\char`\"{}uf\_\-counter\char`\"{})\label{classeo_unary_functor_counter_a0}
+
+\item 
+Unary\-Functor::result\_\-type {\bf operator()} (typename Unary\-Functor::first\_\-argument\_\-type \_\-arg1)
+\begin{CompactList}\small\item\em Calls the embedded function and increments the counter. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+Unary\-Functor \& {\bf func}\label{classeo_unary_functor_counter_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Unary\-Functor$>$ class eo\-Unary\-Functor\-Counter$<$ Unary\-Functor $>$}
+
+Generic counter class that counts the number of times a unary function is used. 
+
+Add a unary function through its ctor and use this class instead of it.
+
+It is derived from {\bf eo\-Value\-Param}{\rm (p.\,\pageref{classeo_value_param})} so you can add it to a monitor.
+
+Example: suppose you have an {\bf eo\-Eval\-Func}{\rm (p.\,\pageref{classeo_eval_func})} called myeval, to count the number of evaluations, just define:
+
+eo\-Unary\-Functor\-Counter$<$void, Eo\-Type$>$ eval\-Counter(myeval);
+
+and use eval\-Counter now instead of myeval. 
+
+
+
+Definition at line 95 of file eo\-Counter.h.
+
+\subsection{Member Function Documentation}
+\index{eoUnaryFunctorCounter@{eo\-Unary\-Functor\-Counter}!operator()@{operator()}}
+\index{operator()@{operator()}!eoUnaryFunctorCounter@{eo\-Unary\-Functor\-Counter}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Unary\-Functor$>$ Unary\-Functor::result\_\-type {\bf eo\-Unary\-Functor\-Counter}$<$ Unary\-Functor $>$::operator() (typename Unary\-Functor::first\_\-argument\_\-type {\em \_\-arg1})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_unary_functor_counter_a1}
+
+
+Calls the embedded function and increments the counter. 
+
+Note for MSVC users, if this code does not compile, you are quite likely trying to count a function that has a non-void return type. Don't look at us, look at the MSVC builders. Code like \char`\"{}return void;\char`\"{} is perfectly legal according to the ANSI standard, but the guys at Microsoft didn't get to implementing it yet.
+
+We had two choices: assuming (and compiling ) code that returns void or code that returns non-void. Given that in {\bf EO}{\rm (p.\,\pageref{class_e_o})} most functors return void, it was chosen to support void.
+
+But also please let me know if you have a compiler that defines \_\-MSC\_\-VER (lot's of windows compilers do), but is quite capable of compiling return void; type of code. We'll try to change the signature then.
+
+You happy GNU (and other compiler) users will not have a problem with this. 
+
+Definition at line 118 of file eo\-Counter.h.
+
+References eo\-Value\-Param$<$ unsigned long $>$::value().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Counter.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_uniform_atom_exchange.eps b/trunk/paradiseo-eo/doc/latex/classeo_uniform_atom_exchange.eps
new file mode 100644
index 000000000..3e120c398
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_uniform_atom_exchange.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 149.813
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.3375 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoUniformAtomExchange< Atom >) cw
+(eoAtomExchange< Atom >) cw
+(eoBF< unsigned, Atom &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< unsigned, Atom &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoUniformAtomExchange< Atom >) 0.5 0 box
+ (eoAtomExchange< Atom >) 0.5 1 box
+ (eoBF< unsigned, Atom &, bool >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< unsigned, Atom &, bool >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_uniform_atom_exchange.tex b/trunk/paradiseo-eo/doc/latex/classeo_uniform_atom_exchange.tex
new file mode 100644
index 000000000..430c1f9e5
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_uniform_atom_exchange.tex
@@ -0,0 +1,51 @@
+\section{eo\-Uniform\-Atom\-Exchange$<$ Atom $>$ Class Template Reference}
+\label{classeo_uniform_atom_exchange}\index{eoUniformAtomExchange@{eoUniformAtomExchange}}
+Uniform crossover - well, not really, efficient for Fixed\-Length.  
+
+
+{\tt \#include $<$eo\-Variable\-Length\-Crossover.h$>$}
+
+Inheritance diagram for eo\-Uniform\-Atom\-Exchange$<$ Atom $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_uniform_atom_exchange}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Uniform\-Atom\-Exchange} (double \_\-rate=0.5)\label{classeo_uniform_atom_exchange_a0}
+
+\item 
+void {\bf randomize} (unsigned \_\-size1, unsigned \_\-size2)\label{classeo_uniform_atom_exchange_a1}
+
+\begin{CompactList}\small\item\em randomize: fill the mask: the exchange will be simulated first to see if sizes are OK, so it must be repeatable : the mask has to be a private data, cannot be computed on the fly \item\end{CompactList}\item 
+bool {\bf operator()} (unsigned \_\-i, Atom \&)\label{classeo_uniform_atom_exchange_a2}
+
+\begin{CompactList}\small\item\em the operator() simply returns the mask booleans in turn \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_uniform_atom_exchange_a3}
+
+\begin{CompactList}\small\item\em inherited {\bf class\-Name()}{\rm (p.\,\pageref{classeo_uniform_atom_exchange_a3})} \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+double {\bf rate}\label{classeo_uniform_atom_exchange_r0}
+
+\item 
+std::vector$<$ bool $>$ {\bf mask}\label{classeo_uniform_atom_exchange_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Atom$>$ class eo\-Uniform\-Atom\-Exchange$<$ Atom $>$}
+
+Uniform crossover - well, not really, efficient for Fixed\-Length. 
+
+
+
+Definition at line 52 of file eo\-Variable\-Length\-Crossover.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Variable\-Length\-Crossover.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_uniform_gene_chooser.eps b/trunk/paradiseo-eo/doc/latex/classeo_uniform_gene_chooser.eps
new file mode 100644
index 000000000..ddbb369bb
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_uniform_gene_chooser.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 162.602
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.075 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoUniformGeneChooser< EOT >) cw
+(eoGeneDelChooser< EOT >) cw
+(eoUF< EOT &, unsigned int >) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, unsigned int >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoUniformGeneChooser< EOT >) 0.5 0 box
+ (eoGeneDelChooser< EOT >) 0.5 1 box
+ (eoUF< EOT &, unsigned int >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< EOT &, unsigned int >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_uniform_gene_chooser.tex b/trunk/paradiseo-eo/doc/latex/classeo_uniform_gene_chooser.tex
new file mode 100644
index 000000000..5412414b6
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_uniform_gene_chooser.tex
@@ -0,0 +1,36 @@
+\section{eo\-Uniform\-Gene\-Chooser$<$ EOT $>$ Class Template Reference}
+\label{classeo_uniform_gene_chooser}\index{eoUniformGeneChooser@{eoUniformGeneChooser}}
+Uniform choice of gene to delete.  
+
+
+{\tt \#include $<$eo\-Variable\-Length\-Mutation.h$>$}
+
+Inheritance diagram for eo\-Uniform\-Gene\-Chooser$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_uniform_gene_chooser}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+unsigned {\bf operator()} ({\bf EOT} \&\_\-eo)\label{classeo_uniform_gene_chooser_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_uniform_gene_chooser_a2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Uniform\-Gene\-Chooser$<$ EOT $>$}
+
+Uniform choice of gene to delete. 
+
+
+
+Definition at line 94 of file eo\-Variable\-Length\-Mutation.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Variable\-Length\-Mutation.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_uniform_generator.eps b/trunk/paradiseo-eo/doc/latex/classeo_uniform_generator.eps
new file mode 100644
index 000000000..16f2f0e37
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_uniform_generator.eps
@@ -0,0 +1,209 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 484.848
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.03125 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoUniformGenerator< T >) cw
+(eoRndGenerator< T >) cw
+(eoF< T >) cw
+(eoFunctorBase) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoUniformGenerator< T >) 0 0 box
+ (eoRndGenerator< T >) 0 1 box
+ (eoF< T >) 0 2 box
+ (eoFunctorBase) 0 3 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 0 2 in
+solid
+0 0 2 out
+solid
+1 0 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_uniform_generator.tex b/trunk/paradiseo-eo/doc/latex/classeo_uniform_generator.tex
new file mode 100644
index 000000000..6246d90b0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_uniform_generator.tex
@@ -0,0 +1,60 @@
+\section{eo\-Uniform\-Generator$<$ T $>$ Class Template Reference}
+\label{classeo_uniform_generator}\index{eoUniformGenerator@{eoUniformGenerator}}
+The class eo\-Uniform can be used in the STL generate function to easily generate random floats and doubles.  
+
+
+{\tt \#include $<$eo\-Rnd\-Generators.h$>$}
+
+Inheritance diagram for eo\-Uniform\-Generator$<$ T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_uniform_generator}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Uniform\-Generator} (T \_\-max=T(1.0), {\bf eo\-Rng} \&\_\-rng=rng)\label{classeo_uniform_generator_a0}
+
+\item 
+{\bf eo\-Uniform\-Generator} (T \_\-min, T \_\-max, {\bf eo\-Rng} \&\_\-rng=rng)\label{classeo_uniform_generator_a1}
+
+\item 
+T {\bf operator()} (void)\label{classeo_uniform_generator_a2}
+
+\begin{CompactList}\small\item\em Generates the number, uses a static\_\-cast to get the right behaviour for ints and unsigneds. \item\end{CompactList}\item 
+template$<$$>$ bool {\bf operator()} (void)\label{classeo_uniform_generator_a3}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+T {\bf minim}\label{classeo_uniform_generator_r0}
+
+\item 
+T {\bf range}\label{classeo_uniform_generator_r1}
+
+\item 
+{\bf eo\-Rng} \& {\bf uniform}\label{classeo_uniform_generator_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class T = double$>$ class eo\-Uniform\-Generator$<$ T $>$}
+
+The class eo\-Uniform can be used in the STL generate function to easily generate random floats and doubles. 
+
+It can also be used for ints and unsigneds by virtue of the static\_\-cast in the generator function.
+
+Also present is a specialization for boolean, that will ignore the minima and maxima that are possibly set and will return an unbiased flip of a coin. For a biased flip, use the eo\-Boolean
+
+either in [0, \_\-max) if only 1 value (\_\-max) is given (or none, as \_\-max defaults to 1.0) or in [\_\-min,\_\-max) if 2 values are given (\_\-min, \_\-max) 
+
+
+
+Definition at line 66 of file eo\-Rnd\-Generators.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Rnd\-Generators.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_uniform_init.eps b/trunk/paradiseo-eo/doc/latex/classeo_uniform_init.eps
new file mode 100644
index 000000000..87c19eda4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_uniform_init.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 218.579
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.2875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoUniformInit< T >) cw
+(eoInit< T >) cw
+(eoUF< T &, void >) cw
+(eoFunctorBase) cw
+(unary_function< T &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoUniformInit< T >) 0.5 0 box
+ (eoInit< T >) 0.5 1 box
+ (eoUF< T &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< T &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_uniform_init.tex b/trunk/paradiseo-eo/doc/latex/classeo_uniform_init.tex
new file mode 100644
index 000000000..f62d58f22
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_uniform_init.tex
@@ -0,0 +1,63 @@
+\section{eo\-Uniform\-Init$<$ T $>$ Class Template Reference}
+\label{classeo_uniform_init}\index{eoUniformInit@{eoUniformInit}}
+The class eo\-Uniform\-Init can be used in the STL apply function to easily randomize floats and doubles.  
+
+
+{\tt \#include $<$eo\-Uniform\-Init.h$>$}
+
+Inheritance diagram for eo\-Uniform\-Init$<$ T $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_uniform_init}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Uniform\-Init} (T \_\-max=T(1.0), {\bf eo\-Rng} \&\_\-rng=rng)\label{classeo_uniform_init_a0}
+
+\begin{CompactList}\small\item\em Ctor with only a max bound. \item\end{CompactList}\item 
+{\bf eo\-Uniform\-Init} ({\bf eo\-Real\-Bounds} \&\_\-bound, {\bf eo\-Rng} \&\_\-rng=rng)\label{classeo_uniform_init_a1}
+
+\begin{CompactList}\small\item\em Ctor with an eo\-Real\-Bound. \item\end{CompactList}\item 
+{\bf eo\-Uniform\-Init} (T \_\-min, T \_\-max, {\bf eo\-Rng} \&\_\-rng=rng)\label{classeo_uniform_init_a2}
+
+\begin{CompactList}\small\item\em Ctor with explicit min and max. \item\end{CompactList}\item 
+void {\bf operator()} (T \&\_\-t)\label{classeo_uniform_init_a3}
+
+\begin{CompactList}\small\item\em Generates the number, uses a static\_\-cast to get the right behaviour for ints and unsigneds. \item\end{CompactList}\item 
+template$<$$>$ void {\bf operator()} (bool \&\_\-b)\label{classeo_uniform_init_a4}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+T {\bf minim}\label{classeo_uniform_init_r0}
+
+\item 
+T {\bf range}\label{classeo_uniform_init_r1}
+
+\item 
+{\bf eo\-Rng} \& {\bf uniform}\label{classeo_uniform_init_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class T = double$>$ class eo\-Uniform\-Init$<$ T $>$}
+
+The class eo\-Uniform\-Init can be used in the STL apply function to easily randomize floats and doubles. 
+
+It can also be used for ints and unsigneds by virtue of the static\_\-cast
+
+Also present is a specialization for boolean, that will ignore the minima and maxima that are possibly set and will return an unbiased flip of a coin. For a biased flip, use the eo\-Boolean
+
+either in [0, \_\-max) if only 1 value (\_\-max) is given (or none, as \_\-max defaults to 1.0) or in [\_\-min,\_\-max) if 2 values are given (\_\-min, \_\-max) 
+
+
+
+Definition at line 62 of file eo\-Uniform\-Init.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Uniform\-Init.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_uniform_mutation.eps b/trunk/paradiseo-eo/doc/latex/classeo_uniform_mutation.eps
new file mode 100644
index 000000000..8d9737193
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_uniform_mutation.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 132.67
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.76875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoUniformMutation< EOT >) cw
+(eoMonOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoUF< EOT &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoUniformMutation< EOT >) 0.5 0 box
+ (eoMonOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoUF< EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_uniform_mutation.tex b/trunk/paradiseo-eo/doc/latex/classeo_uniform_mutation.tex
new file mode 100644
index 000000000..08287f68e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_uniform_mutation.tex
@@ -0,0 +1,124 @@
+\section{eo\-Uniform\-Mutation$<$ EOT $>$ Class Template Reference}
+\label{classeo_uniform_mutation}\index{eoUniformMutation@{eoUniformMutation}}
+eo\-Uniform\-Mutation --$>$ changes all values of the std::vector by uniform choice with range epsilon with probability p\_\-change per variable  
+
+
+{\tt \#include $<$Tutorial/eo\-Real\-Op.h$>$}
+
+Inheritance diagram for eo\-Uniform\-Mutation$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.71476cm]{classeo_uniform_mutation}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Uniform\-Mutation} (const double \&\_\-epsilon, const double \&\_\-p\_\-change=1.0)
+\begin{CompactList}\small\item\em Constructor without bounds == unbounded variables :-) not very clean, but who's doing unbounded optimization anyway? and it's there mostly for backward compatibility. \item\end{CompactList}\item 
+{\bf eo\-Uniform\-Mutation} ({\bf eo\-Real\-Vector\-Bounds} \&\_\-bounds, const double \&\_\-epsilon, const double \&\_\-p\_\-change=1.0)
+\begin{CompactList}\small\item\em Constructor with bounds. \item\end{CompactList}\item 
+{\bf eo\-Uniform\-Mutation} ({\bf eo\-Real\-Vector\-Bounds} \&\_\-bounds, const std::vector$<$ double $>$ \&\_\-epsilon, const std::vector$<$ double $>$ \&\_\-p\_\-change)
+\begin{CompactList}\small\item\em Constructor with bounds. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_uniform_mutation_a3}
+
+\begin{CompactList}\small\item\em The class name. \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eo)
+\begin{CompactList}\small\item\em Do it! \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+bool {\bf homogeneous}\label{classeo_uniform_mutation_r0}
+
+\item 
+{\bf eo\-Real\-Vector\-Bounds} \& {\bf bounds}\label{classeo_uniform_mutation_r1}
+
+\item 
+std::vector$<$ double $>$ {\bf epsilon}\label{classeo_uniform_mutation_r2}
+
+\item 
+std::vector$<$ double $>$ {\bf p\_\-change}\label{classeo_uniform_mutation_r3}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Uniform\-Mutation$<$ EOT $>$}
+
+eo\-Uniform\-Mutation --$>$ changes all values of the std::vector by uniform choice with range epsilon with probability p\_\-change per variable 
+
+
+
+Definition at line 45 of file eo\-Real\-Op.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoUniformMutation@{eo\-Uniform\-Mutation}!eoUniformMutation@{eoUniformMutation}}
+\index{eoUniformMutation@{eoUniformMutation}!eoUniformMutation@{eo\-Uniform\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Uniform\-Mutation}$<$ {\bf EOT} $>$::{\bf eo\-Uniform\-Mutation} (const double \& {\em \_\-epsilon}, const double \& {\em \_\-p\_\-change} = {\tt 1.0})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_uniform_mutation_a0}
+
+
+Constructor without bounds == unbounded variables :-) not very clean, but who's doing unbounded optimization anyway? and it's there mostly for backward compatibility. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-epsilon}]the range for uniform nutation \item[{\em \_\-p\_\-change}]the probability to change a given coordinate \end{description}
+\end{Desc}
+
+
+Definition at line 56 of file eo\-Real\-Op.h.\index{eoUniformMutation@{eo\-Uniform\-Mutation}!eoUniformMutation@{eoUniformMutation}}
+\index{eoUniformMutation@{eoUniformMutation}!eoUniformMutation@{eo\-Uniform\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Uniform\-Mutation}$<$ {\bf EOT} $>$::{\bf eo\-Uniform\-Mutation} ({\bf eo\-Real\-Vector\-Bounds} \& {\em \_\-bounds}, const double \& {\em \_\-epsilon}, const double \& {\em \_\-p\_\-change} = {\tt 1.0})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_uniform_mutation_a1}
+
+
+Constructor with bounds. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-bounds}]an {\bf eo\-Real\-Vector\-Bounds}{\rm (p.\,\pageref{classeo_real_vector_bounds})} that contains the bounds \item[{\em \_\-epsilon}]the range for uniform mutation - a double to be scaled \item[{\em \_\-p\_\-change}]the one probability to change all coordinates \end{description}
+\end{Desc}
+
+
+Definition at line 66 of file eo\-Real\-Op.h.
+
+References eo\-Real\-Base\-Vector\-Bounds::is\-Bounded(), and eo\-Real\-Base\-Vector\-Bounds::range().\index{eoUniformMutation@{eo\-Uniform\-Mutation}!eoUniformMutation@{eoUniformMutation}}
+\index{eoUniformMutation@{eoUniformMutation}!eoUniformMutation@{eo\-Uniform\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Uniform\-Mutation}$<$ {\bf EOT} $>$::{\bf eo\-Uniform\-Mutation} ({\bf eo\-Real\-Vector\-Bounds} \& {\em \_\-bounds}, const std::vector$<$ double $>$ \& {\em \_\-epsilon}, const std::vector$<$ double $>$ \& {\em \_\-p\_\-change})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_uniform_mutation_a2}
+
+
+Constructor with bounds. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-bounds}]an {\bf eo\-Real\-Vector\-Bounds}{\rm (p.\,\pageref{classeo_real_vector_bounds})} that contains the bounds \item[{\em \_\-epsilon}]the VECTOR of ranges for uniform mutation \item[{\em \_\-p\_\-change}]the VECTOR of probabilities for each coordinates \end{description}
+\end{Desc}
+
+
+Definition at line 83 of file eo\-Real\-Op.h.
+
+\subsection{Member Function Documentation}
+\index{eoUniformMutation@{eo\-Uniform\-Mutation}!operator()@{operator()}}
+\index{operator()@{operator()}!eoUniformMutation@{eo\-Uniform\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ bool {\bf eo\-Uniform\-Mutation}$<$ {\bf EOT} $>$::operator() ({\bf EOT} \& {\em \_\-eo})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_uniform_mutation_a4}
+
+
+Do it! 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-eo}]The indi undergoing the mutation \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-UF$<$ EOT \&, bool $>$} {\rm (p.\,\pageref{classeo_u_f_a1})}.
+
+Definition at line 96 of file eo\-Real\-Op.h.
+
+References eo\-Rng::flip(), eo\-Real\-Base\-Vector\-Bounds::is\-Max\-Bounded(), eo\-Real\-Base\-Vector\-Bounds::is\-Min\-Bounded(), eo\-Real\-Base\-Vector\-Bounds::maximum(), eo\-Real\-Base\-Vector\-Bounds::minimum(), and eo\-Rng::uniform().
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Real\-Op.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_updatable.eps b/trunk/paradiseo-eo/doc/latex/classeo_updatable.eps
new file mode 100644
index 000000000..a55ae535d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_updatable.eps
@@ -0,0 +1,197 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 222.222
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.25 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 2 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoUpdatable) cw
+(eoOneFifthMutation< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoUpdatable) 0 1 box
+ (eoOneFifthMutation< EOT >) 0 0 box
+
+% ----- relations -----
+
+solid
+1 0 0.25 out
+solid
+0 0 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_updatable.tex b/trunk/paradiseo-eo/doc/latex/classeo_updatable.tex
new file mode 100644
index 000000000..c1fdf8aa7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_updatable.tex
@@ -0,0 +1,34 @@
+\section{eo\-Updatable Class Reference}
+\label{classeo_updatable}\index{eoUpdatable@{eoUpdatable}}
+eo\-Updatable is a generic class for adding updatation to an existing class Just says it has an update() method  
+
+
+{\tt \#include $<$eo\-Updatable.h$>$}
+
+Inheritance diagram for eo\-Updatable::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2cm]{classeo_updatable}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual {\bf $\sim$eo\-Updatable} ()\label{classeo_updatable_a0}
+
+\begin{CompactList}\small\item\em Virtual destructor. \item\end{CompactList}\item 
+virtual void {\bf update} ()=0\label{classeo_updatable_a1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+eo\-Updatable is a generic class for adding updatation to an existing class Just says it has an update() method 
+
+
+
+Definition at line 36 of file eo\-Updatable.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Updatable.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_updater.eps b/trunk/paradiseo-eo/doc/latex/classeo_updater.eps
new file mode 100644
index 000000000..3b878023c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_updater.eps
@@ -0,0 +1,243 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 99.2063
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.04 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 5 def
+/cols 6 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoUpdater) cw
+(eoF< void >) cw
+(eoFunctorBase) cw
+(eoCountedStateSaver) cw
+(eoDynUpdater) cw
+(eoIncrementor< T >) cw
+(eoIncrementorParam< T >) cw
+(eoTimeCounter) cw
+(eoTimedStateSaver) cw
+(eoCountedDynUpdate) cw
+(eoTimedDynUpdate) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoUpdater) 2.5 2 box
+ (eoF< void >) 2.5 3 box
+ (eoFunctorBase) 2.5 4 box
+ (eoCountedStateSaver) 0 1 box
+ (eoDynUpdater) 1 1 box
+ (eoIncrementor< T >) 2 1 box
+ (eoIncrementorParam< T >) 3 1 box
+ (eoTimeCounter) 4 1 box
+ (eoTimedStateSaver) 5 1 box
+ (eoCountedDynUpdate) 0.5 0 box
+ (eoTimedDynUpdate) 1.5 0 box
+
+% ----- relations -----
+
+solid
+0 2.5 2 out
+solid
+1 2.5 3 in
+solid
+0 2.5 3 out
+solid
+1 2.5 4 in
+solid
+1 2.5 1.25 out
+solid
+0 5 2 conn
+solid
+0 0 1.75 in
+solid
+0 1 1.75 in
+solid
+1 1 0.25 out
+solid
+0.5 1.5 1 conn
+solid
+0 2 1.75 in
+solid
+0 3 1.75 in
+solid
+0 4 1.75 in
+solid
+0 5 1.75 in
+solid
+0 0.5 0.75 in
+solid
+0 1.5 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_updater.tex b/trunk/paradiseo-eo/doc/latex/classeo_updater.tex
new file mode 100644
index 000000000..581253a03
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_updater.tex
@@ -0,0 +1,36 @@
+\section{eo\-Updater Class Reference}
+\label{classeo_updater}\index{eoUpdater@{eoUpdater}}
+eo\-Updater is a generic procudere for updating whatever you want.  
+
+
+{\tt \#include $<$eo\-Updater.h$>$}
+
+Inheritance diagram for eo\-Updater::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.77778cm]{classeo_updater}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+virtual void {\bf last\-Call} ()\label{classeo_updater_a0}
+
+\item 
+virtual std::string {\bf class\-Name} (void) const \label{classeo_updater_a1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+eo\-Updater is a generic procudere for updating whatever you want. 
+
+Yet again an empty name 
+
+
+
+Definition at line 39 of file eo\-Updater.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Updater.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_value_param.eps b/trunk/paradiseo-eo/doc/latex/classeo_value_param.eps
new file mode 100644
index 000000000..394ada209
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_value_param.eps
@@ -0,0 +1,209 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 352.423
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.41875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoValueParam< ValueType >) cw
+(eoParam) cw
+(eoPerf2Worth< EOT, EOT::Fitness >) cw
+(eoNoPerf2Worth< EOT >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoValueParam< ValueType >) 0 2 box
+ (eoParam) 0 3 box
+ (eoPerf2Worth< EOT, EOT::Fitness >) 0 1 box
+ (eoNoPerf2Worth< EOT >) 0 0 box
+
+% ----- relations -----
+
+solid
+0 0 2 out
+solid
+1 0 3 in
+solid
+1 0 1.25 out
+solid
+0 0 1.75 in
+solid
+1 0 0.25 out
+solid
+0 0 0.75 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_value_param.tex b/trunk/paradiseo-eo/doc/latex/classeo_value_param.tex
new file mode 100644
index 000000000..50c61214a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_value_param.tex
@@ -0,0 +1,101 @@
+\section{eo\-Value\-Param$<$ Value\-Type $>$ Class Template Reference}
+\label{classeo_value_param}\index{eoValueParam@{eoValueParam}}
+eo\-Value\-Param$<$Value\-Type$>$: templatized derivation of {\bf eo\-Param}{\rm (p.\,\pageref{classeo_param})}.  
+
+
+{\tt \#include $<$eo\-Param.h$>$}
+
+Inheritance diagram for eo\-Value\-Param$<$ Value\-Type $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_value_param}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Value\-Param} (void)\label{classeo_value_param_a0}
+
+\begin{CompactList}\small\item\em Construct a Param. \item\end{CompactList}\item 
+{\bf eo\-Value\-Param} (Value\-Type \_\-default\-Value, std::string \_\-long\-Name, std::string \_\-description=\char`\"{}No description\char`\"{}, char \_\-short\-Hand=0, bool \_\-required=false)
+\begin{CompactList}\small\item\em Construct a Param. \item\end{CompactList}\item 
+Value\-Type \& {\bf value} ()
+\begin{CompactList}\small\item\em Parameter value. \item\end{CompactList}\item 
+const Value\-Type \& {\bf value} () const 
+\begin{CompactList}\small\item\em Parameter value. \item\end{CompactList}\item 
+std::string {\bf get\-Value} (void) const \label{classeo_value_param_a4}
+
+\begin{CompactList}\small\item\em Pure virtual function to get the value out. \item\end{CompactList}\item 
+void {\bf set\-Value} (const std::string \&\_\-value)\label{classeo_value_param_a5}
+
+\begin{CompactList}\small\item\em Pure virtual function to set the value. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Protected Attributes}
+\begin{CompactItemize}
+\item 
+Value\-Type {\bf rep\-Value}\label{classeo_value_param_p0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Value\-Type$>$ class eo\-Value\-Param$<$ Value\-Type $>$}
+
+eo\-Value\-Param$<$Value\-Type$>$: templatized derivation of {\bf eo\-Param}{\rm (p.\,\pageref{classeo_param})}. 
+
+Can be used to contain any scalar value type. It makes use of std::strstream to get and set values. This should be changed to std::stringstream when that class is available in g++.
+
+Note also that there is a template specialization for std::pair$<$double, double$>$ and for std::vector$<$double$>$. These stream their contents delimited with whitespace. 
+
+
+
+Definition at line 136 of file eo\-Param.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoValueParam@{eo\-Value\-Param}!eoValueParam@{eoValueParam}}
+\index{eoValueParam@{eoValueParam}!eoValueParam@{eo\-Value\-Param}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Value\-Type$>$ {\bf eo\-Value\-Param}$<$ Value\-Type $>$::{\bf eo\-Value\-Param} (Value\-Type {\em \_\-default\-Value}, std::string {\em \_\-long\-Name}, std::string {\em \_\-description} = {\tt \char`\"{}No\ description\char`\"{}}, char {\em \_\-short\-Hand} = {\tt 0}, bool {\em \_\-required} = {\tt false})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_value_param_a1}
+
+
+Construct a Param. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-default\-Value}]The default value \item[{\em \_\-long\-Name}]Long name of the argument \item[{\em \_\-description}]Description of the parameter. What is useful for. \item[{\em \_\-short\-Name}]Short name of the argument (Optional) \item[{\em \_\-required}]If it is a necessary parameter or not \end{description}
+\end{Desc}
+
+
+Definition at line 151 of file eo\-Param.h.
+
+\subsection{Member Function Documentation}
+\index{eoValueParam@{eo\-Value\-Param}!value@{value}}
+\index{value@{value}!eoValueParam@{eo\-Value\-Param}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Value\-Type$>$ Value\-Type\& {\bf eo\-Value\-Param}$<$ Value\-Type $>$::value ()\hspace{0.3cm}{\tt  [inline]}}\label{classeo_value_param_a2}
+
+
+Parameter value. 
+
+\begin{Desc}
+\item[Returns:]parameter value \end{Desc}
+
+
+Definition at line 166 of file eo\-Param.h.
+
+Referenced by eo\-No\-Perf2Worth$<$ EOT $>$::operator()(), eo\-File\-Snapshot::operator()(), eo\-FDCStat$<$ EOT $>$::operator()(), and eo\-Parser::set\-Stop\-On\-Unknown\-Param().\index{eoValueParam@{eo\-Value\-Param}!value@{value}}
+\index{value@{value}!eoValueParam@{eo\-Value\-Param}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Value\-Type$>$ const Value\-Type\& {\bf eo\-Value\-Param}$<$ Value\-Type $>$::value () const\hspace{0.3cm}{\tt  [inline]}}\label{classeo_value_param_a3}
+
+
+Parameter value. 
+
+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
+
+\begin{Desc}
+\item[Returns:]parameter value \end{Desc}
+
+
+Definition at line 175 of file eo\-Param.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Param.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_variable_pareto_traits.eps b/trunk/paradiseo-eo/doc/latex/classeo_variable_pareto_traits.eps
new file mode 100644
index 000000000..c1a41a6e6
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_variable_pareto_traits.eps
@@ -0,0 +1,197 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 266.667
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 1.875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 2 def
+/cols 1 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoVariableParetoTraits) cw
+(eoParetoFitnessTraits) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoVariableParetoTraits) 0 0 box
+ (eoParetoFitnessTraits) 0 1 box
+
+% ----- relations -----
+
+solid
+0 0 0 out
+solid
+1 0 1 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_variable_pareto_traits.tex b/trunk/paradiseo-eo/doc/latex/classeo_variable_pareto_traits.tex
new file mode 100644
index 000000000..bf776c33c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_variable_pareto_traits.tex
@@ -0,0 +1,47 @@
+\section{eo\-Variable\-Pareto\-Traits Class Reference}
+\label{classeo_variable_pareto_traits}\index{eoVariableParetoTraits@{eoVariableParetoTraits}}
+eo\-Variable\-Pareto\-Traits : an {\bf eo\-Pareto\-Fitness\-Traits}{\rm (p.\,\pageref{classeo_pareto_fitness_traits})} whose characteristics can be set at run-time (nb objectives and min/max's) Why bother? For didactical purposes (and EASEA implementation :-)  
+
+
+{\tt \#include $<$eo\-Pareto\-Fitness.h$>$}
+
+Inheritance diagram for eo\-Variable\-Pareto\-Traits::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2cm]{classeo_variable_pareto_traits}
+\end{center}
+\end{figure}
+\subsection*{Static Public Member Functions}
+\begin{CompactItemize}
+\item 
+void {\bf set\-Up} (unsigned \_\-n, std::vector$<$ bool $>$ \&\_\-b)\label{classeo_variable_pareto_traits_e0}
+
+\begin{CompactList}\small\item\em setting the static stuff \item\end{CompactList}\item 
+unsigned {\bf n\-Objectives} ()\label{classeo_variable_pareto_traits_e1}
+
+\begin{CompactList}\small\item\em the accessors \item\end{CompactList}\item 
+bool {\bf maximizing} (unsigned \_\-i)\label{classeo_variable_pareto_traits_e2}
+
+\end{CompactItemize}
+\subsection*{Static Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf n\-Obj}\label{classeo_variable_pareto_traits_v0}
+
+\item 
+std::vector$<$ bool $>$ {\bf b\-Obj}\label{classeo_variable_pareto_traits_v1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+eo\-Variable\-Pareto\-Traits : an {\bf eo\-Pareto\-Fitness\-Traits}{\rm (p.\,\pageref{classeo_pareto_fitness_traits})} whose characteristics can be set at run-time (nb objectives and min/max's) Why bother? For didactical purposes (and EASEA implementation :-) 
+
+
+
+Definition at line 56 of file eo\-Pareto\-Fitness.h.
+
+The documentation for this class was generated from the following files:\begin{CompactItemize}
+\item 
+eo\-Pareto\-Fitness.h\item 
+eo\-Pareto\-Fitness.cpp\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_vector.eps b/trunk/paradiseo-eo/doc/latex/classeo_vector.eps
new file mode 100644
index 000000000..f147920fb
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_vector.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 217.391
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 2.3 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoVector< FitT, GeneType >) cw
+(EO< FitT >) cw
+(eoObject) cw
+(eoPersistent) cw
+(eoPrintable) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoVector< FitT, GeneType >) 0.5 0 box
+ (EO< FitT >) 0.5 1 box
+ (eoObject) 0 2 box
+ (eoPersistent) 1 2 box
+ (eoPrintable) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_vector.tex b/trunk/paradiseo-eo/doc/latex/classeo_vector.tex
new file mode 100644
index 000000000..a0828da4b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_vector.tex
@@ -0,0 +1,75 @@
+\section{eo\-Vector$<$ Fit\-T, Gene\-Type $>$ Class Template Reference}
+\label{classeo_vector}\index{eoVector@{eoVector}}
+Base class for fixed length chromosomes, just derives from {\bf EO}{\rm (p.\,\pageref{class_e_o})} and std::vector and redirects the smaller than operator to EO (fitness based comparison).  
+
+
+{\tt \#include $<$eo\-Vector.h$>$}
+
+Inheritance diagram for eo\-Vector$<$ Fit\-T, Gene\-Type $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{classeo_vector}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef Gene\-Type {\bf Atom\-Type}\label{classeo_vector_w0}
+
+\item 
+typedef std::vector$<$ Gene\-Type $>$ {\bf Container\-Type}\label{classeo_vector_w1}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Vector} (unsigned size=0, Gene\-Type value=Gene\-Type())
+\begin{CompactList}\small\item\em default constructor \item\end{CompactList}\item 
+template$<$class Other\-Fitness\-Type$>$ {\bf eo\-Vector} (const {\bf eo\-Vector}$<$ Other\-Fitness\-Type, Gene\-Type $>$ \&\_\-vec)\label{classeo_vector_a1}
+
+\begin{CompactList}\small\item\em copy ctor abstracting from the Fit\-T \item\end{CompactList}\item 
+void {\bf value} (const std::vector$<$ Gene\-Type $>$ \&\_\-v)\label{classeo_vector_a2}
+
+\item 
+bool {\bf operator$<$} (const {\bf eo\-Vector}$<$ {\bf Fit\-T}, Gene\-Type $>$ \&\_\-eo) const \label{classeo_vector_a3}
+
+\begin{CompactList}\small\item\em to avoid conflicts between EO::operator$<$ and std::vector$<$Gene\-Type$>$::operator$<$ \item\end{CompactList}\item 
+virtual void {\bf print\-On} (std::ostream \&os) const \label{classeo_vector_a4}
+
+\begin{CompactList}\small\item\em printing... \item\end{CompactList}\item 
+virtual void {\bf read\-From} (std::istream \&is)\label{classeo_vector_a5}
+
+\begin{CompactList}\small\item\em reading... \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class Fit\-T, class Gene\-Type$>$ class eo\-Vector$<$ Fit\-T, Gene\-Type $>$}
+
+Base class for fixed length chromosomes, just derives from {\bf EO}{\rm (p.\,\pageref{class_e_o})} and std::vector and redirects the smaller than operator to EO (fitness based comparison). 
+
+Gene\-Type must have the following methods: void ctor (needed for the std::vector$<$$>$), copy ctor, 
+
+
+
+Definition at line 46 of file eo\-Vector.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoVector@{eo\-Vector}!eoVector@{eoVector}}
+\index{eoVector@{eoVector}!eoVector@{eo\-Vector}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class Fit\-T, class Gene\-Type$>$ {\bf eo\-Vector}$<$ {\bf Fit\-T}, Gene\-Type $>$::{\bf eo\-Vector} (unsigned {\em size} = {\tt 0}, Gene\-Type {\em value} = {\tt GeneType()})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_vector_a0}
+
+
+default constructor 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em size}]Length of vector (default is 0) \item[{\em value}]Initial value of all elements (default is default value of type Gene\-Type) \end{description}
+\end{Desc}
+
+
+Definition at line 65 of file eo\-Vector.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Vector.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_vl_add_mutation.eps b/trunk/paradiseo-eo/doc/latex/classeo_vl_add_mutation.eps
new file mode 100644
index 000000000..5731ffdd3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_vl_add_mutation.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 132.67
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.76875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoVlAddMutation< EOT >) cw
+(eoMonOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoUF< EOT &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoVlAddMutation< EOT >) 0.5 0 box
+ (eoMonOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoUF< EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_vl_add_mutation.tex b/trunk/paradiseo-eo/doc/latex/classeo_vl_add_mutation.tex
new file mode 100644
index 000000000..30e19934d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_vl_add_mutation.tex
@@ -0,0 +1,70 @@
+\section{eo\-Vl\-Add\-Mutation$<$ EOT $>$ Class Template Reference}
+\label{classeo_vl_add_mutation}\index{eoVlAddMutation@{eoVlAddMutation}}
+Addition of a gene Is inserted at a random position - so can be applied to both order-dependent and order-independent.  
+
+
+{\tt \#include $<$eo\-Variable\-Length\-Mutation.h$>$}
+
+Inheritance diagram for eo\-Vl\-Add\-Mutation$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.71476cm]{classeo_vl_add_mutation}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Atom\-Type {\bf Atom\-Type}\label{classeo_vl_add_mutation_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Vl\-Add\-Mutation} (unsigned \_\-n\-Max, {\bf eo\-Init}$<$ Atom\-Type $>$ \&\_\-atom\-Init)
+\begin{CompactList}\small\item\em default ctor \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eo)\label{classeo_vl_add_mutation_a1}
+
+\begin{CompactList}\small\item\em operator: actually adds an Atom \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_vl_add_mutation_a2}
+
+\begin{CompactList}\small\item\em inherited class\-Name \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf n\-Max}\label{classeo_vl_add_mutation_r0}
+
+\item 
+{\bf eo\-Init}$<$ Atom\-Type $>$ \& {\bf atom\-Init}\label{classeo_vl_add_mutation_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Vl\-Add\-Mutation$<$ EOT $>$}
+
+Addition of a gene Is inserted at a random position - so can be applied to both order-dependent and order-independent. 
+
+
+
+Definition at line 48 of file eo\-Variable\-Length\-Mutation.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoVlAddMutation@{eo\-Vl\-Add\-Mutation}!eoVlAddMutation@{eoVlAddMutation}}
+\index{eoVlAddMutation@{eoVlAddMutation}!eoVlAddMutation@{eo\-Vl\-Add\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Vl\-Add\-Mutation}$<$ {\bf EOT} $>$::{\bf eo\-Vl\-Add\-Mutation} (unsigned {\em \_\-n\-Max}, {\bf eo\-Init}$<$ Atom\-Type $>$ \& {\em \_\-atom\-Init})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_vl_add_mutation_a0}
+
+
+default ctor 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em n\-Max}]max number of atoms \item[{\em \_\-atom\-Init}]an Atom initializer \end{description}
+\end{Desc}
+
+
+Definition at line 59 of file eo\-Variable\-Length\-Mutation.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Variable\-Length\-Mutation.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_vl_atom_exchange_quad_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_vl_atom_exchange_quad_op.eps
new file mode 100644
index 000000000..71567bd95
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_vl_atom_exchange_quad_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 105.82
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.725 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoVlAtomExchangeQuadOp< EOT >) cw
+(eoQuadOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoBF< EOT &, EOT &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< EOT &, EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoVlAtomExchangeQuadOp< EOT >) 0.5 0 box
+ (eoQuadOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoBF< EOT &, EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< EOT &, EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_vl_atom_exchange_quad_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_vl_atom_exchange_quad_op.tex
new file mode 100644
index 000000000..88a040989
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_vl_atom_exchange_quad_op.tex
@@ -0,0 +1,57 @@
+\section{eo\-Vl\-Atom\-Exchange\-Quad\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_vl_atom_exchange_quad_op}\index{eoVlAtomExchangeQuadOp@{eoVlAtomExchangeQuadOp}}
+Exchange Crossover using an Atom\-Exchange.  
+
+
+{\tt \#include $<$eo\-Variable\-Length\-Crossover.h$>$}
+
+Inheritance diagram for eo\-Vl\-Atom\-Exchange\-Quad\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.96296cm]{classeo_vl_atom_exchange_quad_op}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Atom\-Type {\bf Atom\-Type}\label{classeo_vl_atom_exchange_quad_op_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Vl\-Atom\-Exchange\-Quad\-Op} (unsigned \_\-Min, unsigned \_\-Max, {\bf eo\-Atom\-Exchange}$<$ Atom\-Type $>$ \&\_\-atom\-Exchange)\label{classeo_vl_atom_exchange_quad_op_a0}
+
+\begin{CompactList}\small\item\em default ctor: requires bounds on number of genes + a rate \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eo1, {\bf EOT} \&\_\-eo2)\label{classeo_vl_atom_exchange_quad_op_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_vl_atom_exchange_quad_op_a2}
+
+\begin{CompactList}\small\item\em the inherited class\-Name \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf Min}\label{classeo_vl_atom_exchange_quad_op_r0}
+
+\item 
+unsigned {\bf Max}\label{classeo_vl_atom_exchange_quad_op_r1}
+
+\item 
+{\bf eo\-Atom\-Exchange}$<$ Atom\-Type $>$ \& {\bf atom\-Exchange}\label{classeo_vl_atom_exchange_quad_op_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Vl\-Atom\-Exchange\-Quad\-Op$<$ EOT $>$}
+
+Exchange Crossover using an Atom\-Exchange. 
+
+
+
+Definition at line 89 of file eo\-Variable\-Length\-Crossover.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Variable\-Length\-Crossover.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_vl_del_mutation.eps b/trunk/paradiseo-eo/doc/latex/classeo_vl_del_mutation.eps
new file mode 100644
index 000000000..5ba870409
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_vl_del_mutation.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 132.67
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.76875 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoVlDelMutation< EOT >) cw
+(eoMonOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoUF< EOT &, bool >) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoVlDelMutation< EOT >) 0.5 0 box
+ (eoMonOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoUF< EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (unary_function< EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_vl_del_mutation.tex b/trunk/paradiseo-eo/doc/latex/classeo_vl_del_mutation.tex
new file mode 100644
index 000000000..e58ae4d1e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_vl_del_mutation.tex
@@ -0,0 +1,107 @@
+\section{eo\-Vl\-Del\-Mutation$<$ EOT $>$ Class Template Reference}
+\label{classeo_vl_del_mutation}\index{eoVlDelMutation@{eoVlDelMutation}}
+Deletion of a gene By default at a random position, but a \char`\"{}chooser\char`\"{} can be specified can of course be applied to both order-dependent and order-independent.  
+
+
+{\tt \#include $<$eo\-Variable\-Length\-Mutation.h$>$}
+
+Inheritance diagram for eo\-Vl\-Del\-Mutation$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.71476cm]{classeo_vl_del_mutation}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Atom\-Type {\bf Atom\-Type}\label{classeo_vl_del_mutation_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Vl\-Del\-Mutation} (unsigned \_\-n\-Min, {\bf eo\-Gene\-Del\-Chooser}$<$ {\bf EOT} $>$ \&\_\-chooser)
+\begin{CompactList}\small\item\em ctor with an external gene chooser \item\end{CompactList}\item 
+{\bf eo\-Vl\-Del\-Mutation} (unsigned \_\-n\-Min)
+\begin{CompactList}\small\item\em ctor with uniform gene chooser - the default \item\end{CompactList}\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eo)
+\begin{CompactList}\small\item\em Do the job (delete one gene). \item\end{CompactList}\item 
+virtual std::string {\bf class\-Name} () const \label{classeo_vl_del_mutation_a3}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf n\-Min}\label{classeo_vl_del_mutation_r0}
+
+\item 
+{\bf eo\-Uniform\-Gene\-Chooser}$<$ {\bf EOT} $>$ {\bf u\-Chooser}\label{classeo_vl_del_mutation_r1}
+
+\item 
+{\bf eo\-Gene\-Del\-Chooser}$<$ {\bf EOT} $>$ \& {\bf chooser}\label{classeo_vl_del_mutation_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Vl\-Del\-Mutation$<$ EOT $>$}
+
+Deletion of a gene By default at a random position, but a \char`\"{}chooser\char`\"{} can be specified can of course be applied to both order-dependent and order-independent. 
+
+
+
+Definition at line 110 of file eo\-Variable\-Length\-Mutation.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoVlDelMutation@{eo\-Vl\-Del\-Mutation}!eoVlDelMutation@{eoVlDelMutation}}
+\index{eoVlDelMutation@{eoVlDelMutation}!eoVlDelMutation@{eo\-Vl\-Del\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Vl\-Del\-Mutation}$<$ {\bf EOT} $>$::{\bf eo\-Vl\-Del\-Mutation} (unsigned {\em \_\-n\-Min}, {\bf eo\-Gene\-Del\-Chooser}$<$ {\bf EOT} $>$ \& {\em \_\-chooser})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_vl_del_mutation_a0}
+
+
+ctor with an external gene chooser 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em n\-Min}]min number of atoms to leave in the individual \item[{\em \_\-gene\-Chooser}]an eo\-Gene\-CHooser to choose which one to delete \end{description}
+\end{Desc}
+
+
+Definition at line 121 of file eo\-Variable\-Length\-Mutation.h.\index{eoVlDelMutation@{eo\-Vl\-Del\-Mutation}!eoVlDelMutation@{eoVlDelMutation}}
+\index{eoVlDelMutation@{eoVlDelMutation}!eoVlDelMutation@{eo\-Vl\-Del\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ {\bf eo\-Vl\-Del\-Mutation}$<$ {\bf EOT} $>$::{\bf eo\-Vl\-Del\-Mutation} (unsigned {\em \_\-n\-Min})\hspace{0.3cm}{\tt  [inline]}}\label{classeo_vl_del_mutation_a1}
+
+
+ctor with uniform gene chooser - the default 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em n\-Min}]min number of atoms to leave in the individual \end{description}
+\end{Desc}
+
+
+Definition at line 128 of file eo\-Variable\-Length\-Mutation.h.
+
+\subsection{Member Function Documentation}
+\index{eoVlDelMutation@{eo\-Vl\-Del\-Mutation}!operator()@{operator()}}
+\index{operator()@{operator()}!eoVlDelMutation@{eo\-Vl\-Del\-Mutation}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT$>$ bool {\bf eo\-Vl\-Del\-Mutation}$<$ {\bf EOT} $>$::operator() ({\bf EOT} \& {\em \_\-eo})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classeo_vl_del_mutation_a2}
+
+
+Do the job (delete one gene). 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-eo}]the {\bf EO}{\rm (p.\,\pageref{class_e_o})} to mutate \end{description}
+\end{Desc}
+
+
+Implements {\bf eo\-UF$<$ EOT \&, bool $>$} {\rm (p.\,\pageref{classeo_u_f_a1})}.
+
+Definition at line 134 of file eo\-Variable\-Length\-Mutation.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Variable\-Length\-Mutation.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_vl_uniform_bin_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_vl_uniform_bin_op.eps
new file mode 100644
index 000000000..99bb766ae
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_vl_uniform_bin_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 92.9152
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 5.38125 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoVlUniformBinOp< EOT >) cw
+(eoBinOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoBF< EOT &, const EOT &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< EOT &, const EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoVlUniformBinOp< EOT >) 0.5 0 box
+ (eoBinOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoBF< EOT &, const EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< EOT &, const EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_vl_uniform_bin_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_vl_uniform_bin_op.tex
new file mode 100644
index 000000000..71e549869
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_vl_uniform_bin_op.tex
@@ -0,0 +1,56 @@
+\section{eo\-Vl\-Uniform\-Bin\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_vl_uniform_bin_op}\index{eoVlUniformBinOp@{eoVlUniformBinOp}}
+Direct Uniform Exchange of genes for Variable Length, BINARY version.  
+
+
+{\tt \#include $<$eo\-Variable\-Length\-Crossover.h$>$}
+
+Inheritance diagram for eo\-Vl\-Uniform\-Bin\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.60163cm]{classeo_vl_uniform_bin_op}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Atom\-Type {\bf Atom\-Type}\label{classeo_vl_uniform_bin_op_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Vl\-Uniform\-Bin\-Op} (unsigned \_\-Min, unsigned \_\-Max, double \_\-rate=0.5)\label{classeo_vl_uniform_bin_op_a0}
+
+\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eo1, const {\bf EOT} \&\_\-eo2)\label{classeo_vl_uniform_bin_op_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf Min}\label{classeo_vl_uniform_bin_op_r0}
+
+\item 
+unsigned {\bf Max}\label{classeo_vl_uniform_bin_op_r1}
+
+\item 
+double {\bf rate}\label{classeo_vl_uniform_bin_op_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Vl\-Uniform\-Bin\-Op$<$ EOT $>$}
+
+Direct Uniform Exchange of genes for Variable Length, BINARY version. 
+
+A very primitive version, that does no verification at all!!! NEEDS to be improved - but no time now :-((( Especially, if both guys have maximal size, it will take some time to generate even 1 offspring that is not oversized!!! Also, we should first check for identical atoms, and copy them to the offspring, and only after that exchange the other ones (Radcliffe's RRR). 
+
+
+
+Definition at line 280 of file eo\-Variable\-Length\-Crossover.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Variable\-Length\-Crossover.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_vl_uniform_quad_op.eps b/trunk/paradiseo-eo/doc/latex/classeo_vl_uniform_quad_op.eps
new file mode 100644
index 000000000..bbb223927
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_vl_uniform_quad_op.eps
@@ -0,0 +1,221 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 105.82
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.725 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 3 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoVlUniformQuadOp< EOT >) cw
+(eoQuadOp< EOT >) cw
+(eoOp< EOT >) cw
+(eoBF< EOT &, EOT &, bool >) cw
+(eoFunctorBase) cw
+(binary_function< EOT &, EOT &, bool >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoVlUniformQuadOp< EOT >) 0.5 0 box
+ (eoQuadOp< EOT >) 0.5 1 box
+ (eoOp< EOT >) 0 2 box
+ (eoBF< EOT &, EOT &, bool >) 1 2 box
+ (eoFunctorBase) 0.5 3 box
+ (binary_function< EOT &, EOT &, bool >) 1.5 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+0 1 2 conn
+solid
+1 0 2 in
+solid
+1 1 2 in
+solid
+0 1 2 out
+solid
+0.5 1.5 3 conn
+solid
+1 0.5 3 in
+solid
+1 1.5 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_vl_uniform_quad_op.tex b/trunk/paradiseo-eo/doc/latex/classeo_vl_uniform_quad_op.tex
new file mode 100644
index 000000000..1c654a466
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_vl_uniform_quad_op.tex
@@ -0,0 +1,56 @@
+\section{eo\-Vl\-Uniform\-Quad\-Op$<$ EOT $>$ Class Template Reference}
+\label{classeo_vl_uniform_quad_op}\index{eoVlUniformQuadOp@{eoVlUniformQuadOp}}
+Direct Uniform Exchange of genes (obsolete, already :-) stays there for historical reasons.  
+
+
+{\tt \#include $<$eo\-Variable\-Length\-Crossover.h$>$}
+
+Inheritance diagram for eo\-Vl\-Uniform\-Quad\-Op$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=2.96296cm]{classeo_vl_uniform_quad_op}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Atom\-Type {\bf Atom\-Type}\label{classeo_vl_uniform_quad_op_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Vl\-Uniform\-Quad\-Op} (unsigned \_\-Min, unsigned \_\-Max, double \_\-rate=0.5)\label{classeo_vl_uniform_quad_op_a0}
+
+\item 
+bool {\bf operator()} ({\bf EOT} \&\_\-eo1, {\bf EOT} \&\_\-eo2)\label{classeo_vl_uniform_quad_op_a1}
+
+\begin{CompactList}\small\item\em The pure virtual function that needs to be implemented by the subclass. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+unsigned {\bf Min}\label{classeo_vl_uniform_quad_op_r0}
+
+\item 
+unsigned {\bf Max}\label{classeo_vl_uniform_quad_op_r1}
+
+\item 
+double {\bf rate}\label{classeo_vl_uniform_quad_op_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Vl\-Uniform\-Quad\-Op$<$ EOT $>$}
+
+Direct Uniform Exchange of genes (obsolete, already :-) stays there for historical reasons. 
+
+A very primitive version, that does no verification at all!!! NEEDS to be improved - but no time now :-((( Especially, if both guys have maximal size, it will take a lot of time to generate 2 offspring that both are not oversized!!! Also, we should first check for identical atoms, and copy them to the offspring, and only after that exchange the other ones (Radcliffe's RRR). 
+
+
+
+Definition at line 219 of file eo\-Variable\-Length\-Crossover.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Variable\-Length\-Crossover.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_weak_elitist_replacement.eps b/trunk/paradiseo-eo/doc/latex/classeo_weak_elitist_replacement.eps
new file mode 100644
index 000000000..09065d250
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_weak_elitist_replacement.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 107.527
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 4.65 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoWeakElitistReplacement< EOT >) cw
+(eoReplacement< EOT >) cw
+(eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+(eoFunctorBase) cw
+(binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoWeakElitistReplacement< EOT >) 0.5 0 box
+ (eoReplacement< EOT >) 0.5 1 box
+ (eoBF< eoPop< EOT > &, eoPop< EOT > &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (binary_function< eoPop< EOT > &, eoPop< EOT > &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/classeo_weak_elitist_replacement.tex b/trunk/paradiseo-eo/doc/latex/classeo_weak_elitist_replacement.tex
new file mode 100644
index 000000000..fd0050671
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classeo_weak_elitist_replacement.tex
@@ -0,0 +1,50 @@
+\section{eo\-Weak\-Elitist\-Replacement$<$ EOT $>$ Class Template Reference}
+\label{classeo_weak_elitist_replacement}\index{eoWeakElitistReplacement@{eoWeakElitistReplacement}}
+eo\-Weak\-Elitist\-Replacement: a wrapper for other replacement procedures.  
+
+
+{\tt \#include $<$eo\-Replacement.h$>$}
+
+Inheritance diagram for eo\-Weak\-Elitist\-Replacement$<$ EOT $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=3.01075cm]{classeo_weak_elitist_replacement}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef EOT::Fitness {\bf Fitness}\label{classeo_weak_elitist_replacement_w0}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Weak\-Elitist\-Replacement} ({\bf eo\-Replacement}$<$ {\bf EOT} $>$ \&\_\-replace)\label{classeo_weak_elitist_replacement_a0}
+
+\item 
+void {\bf operator()} ({\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-pop, {\bf eo\-Pop}$<$ {\bf EOT} $>$ \&\_\-offspring)\label{classeo_weak_elitist_replacement_a1}
+
+\begin{CompactList}\small\item\em do replacement \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Replacement}$<$ {\bf EOT} $>$ \& {\bf replace}\label{classeo_weak_elitist_replacement_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ class eo\-Weak\-Elitist\-Replacement$<$ EOT $>$}
+
+eo\-Weak\-Elitist\-Replacement: a wrapper for other replacement procedures. 
+
+Copies in the new pop the best individual from the old pop, AFTER normal replacement, if the best of the new pop is worse than the best of the old pop. Removes the worse individual from the new pop. This could be changed by adding a selector there... 
+
+
+
+Definition at line 102 of file eo\-Replacement.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Replacement.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classgp__parse__tree_1_1_mem_pool.tex b/trunk/paradiseo-eo/doc/latex/classgp__parse__tree_1_1_mem_pool.tex
new file mode 100644
index 000000000..bad828de7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classgp__parse__tree_1_1_mem_pool.tex
@@ -0,0 +1,53 @@
+\section{gp\_\-parse\_\-tree::Mem\-Pool Class Reference}
+\label{classgp__parse__tree_1_1_mem_pool}\index{gp_parse_tree::MemPool@{gp\_\-parse\_\-tree::MemPool}}
+Pool allocator for the subtree and parse tree classes (homebrew and not compliant to ANSI allocator requirements) (c) copyright Maarten Keijzer 1999, 2000.  
+
+
+{\tt \#include $<$parse\_\-tree.h$>$}
+
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf Mem\-Pool} (unsigned int sz)\label{classgp__parse__tree_1_1_mem_pool_a0}
+
+\item 
+void $\ast$ {\bf allocate} ()\label{classgp__parse__tree_1_1_mem_pool_a2}
+
+\item 
+void {\bf deallocate} (void $\ast$b)\label{classgp__parse__tree_1_1_mem_pool_a3}
+
+\end{CompactItemize}
+\subsection*{Private Member Functions}
+\begin{CompactItemize}
+\item 
+void {\bf grow} ()\label{classgp__parse__tree_1_1_mem_pool_d0}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+Chunk $\ast$ {\bf chunks}\label{classgp__parse__tree_1_1_mem_pool_r0}
+
+\item 
+const unsigned int {\bf esize}\label{classgp__parse__tree_1_1_mem_pool_r1}
+
+\item 
+Link $\ast$ {\bf head}\label{classgp__parse__tree_1_1_mem_pool_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Pool allocator for the subtree and parse tree classes (homebrew and not compliant to ANSI allocator requirements) (c) copyright Maarten Keijzer 1999, 2000. 
+
+Permission to copy, use, modify, sell and distribute this software is granted provided this copyright notice appears in all copies. This software is provided \char`\"{}as is\char`\"{} without express or implied warranty, and with no claim as to its suitability for any purpose.
+
+Permission to modify the code and to distribute modified code is granted, provided the above notices are retained, and a notice that the code was modified is included with the above copyright notice. 
+
+
+
+Definition at line 185 of file parse\_\-tree.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+parse\_\-tree.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classnegexp__generator.tex b/trunk/paradiseo-eo/doc/latex/classnegexp__generator.tex
new file mode 100644
index 000000000..f853e5e1a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classnegexp__generator.tex
@@ -0,0 +1,41 @@
+\section{negexp\_\-generator$<$ T $>$ Class Template Reference}
+\label{classnegexp__generator}\index{negexp_generator@{negexp\_\-generator}}
+The class negexp\_\-generator can be used in the STL generate function to easily generate negative exponential distributed floats and doubles.  
+
+
+{\tt \#include $<$rnd\_\-generators.h$>$}
+
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf negexp\_\-generator} (T \_\-mean=1.0, {\bf eo\-Rng} \&\_\-rng=rng)\label{classnegexp__generator_a0}
+
+\item 
+T {\bf operator()} (void)\label{classnegexp__generator_a1}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+T {\bf mean}\label{classnegexp__generator_r0}
+
+\item 
+{\bf eo\-Rng} \& {\bf negexp}\label{classnegexp__generator_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class T = double$>$ class negexp\_\-generator$<$ T $>$}
+
+The class negexp\_\-generator can be used in the STL generate function to easily generate negative exponential distributed floats and doubles. 
+
+The user can supply a mean. 
+
+
+
+Definition at line 156 of file rnd\_\-generators.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+rnd\_\-generators.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classnormal__generator.tex b/trunk/paradiseo-eo/doc/latex/classnormal__generator.tex
new file mode 100644
index 000000000..10ec41ce0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classnormal__generator.tex
@@ -0,0 +1,41 @@
+\section{normal\_\-generator$<$ T $>$ Class Template Reference}
+\label{classnormal__generator}\index{normal_generator@{normal\_\-generator}}
+The class normal\_\-generator can be used in the STL generate function to easily generate gaussian distributed floats and doubles.  
+
+
+{\tt \#include $<$rnd\_\-generators.h$>$}
+
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf normal\_\-generator} (T \_\-stdev=T(1.0), {\bf eo\-Rng} \&\_\-rng=rng)\label{classnormal__generator_a0}
+
+\item 
+T {\bf operator()} (void)\label{classnormal__generator_a1}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+T {\bf stdev}\label{classnormal__generator_r0}
+
+\item 
+{\bf eo\-Rng} \& {\bf normal}\label{classnormal__generator_r1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class T = double$>$ class normal\_\-generator$<$ T $>$}
+
+The class normal\_\-generator can be used in the STL generate function to easily generate gaussian distributed floats and doubles. 
+
+The user can supply a standard deviation which defaults to 1. 
+
+
+
+Definition at line 139 of file rnd\_\-generators.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+rnd\_\-generators.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classrandom__generator.tex b/trunk/paradiseo-eo/doc/latex/classrandom__generator.tex
new file mode 100644
index 000000000..af8b76272
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classrandom__generator.tex
@@ -0,0 +1,48 @@
+\section{random\_\-generator$<$ T $>$ Class Template Reference}
+\label{classrandom__generator}\index{random_generator@{random\_\-generator}}
+The class random\_\-generator can be used in the STL generate function to easily generate random ints either between [0, \_\-max) if only one value (\_\-max) is given to the ctor or in [\_\-min,\_\-max) if 2 values are given (\_\-min, \_\-max).  
+
+
+{\tt \#include $<$rnd\_\-generators.h$>$}
+
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf random\_\-generator} (T \_\-max, {\bf eo\-Rng} \&\_\-rng=rng)\label{classrandom__generator_a0}
+
+\item 
+{\bf random\_\-generator} (T \_\-min, T \_\-max, {\bf eo\-Rng} \&\_\-rng=rng)\label{classrandom__generator_a1}
+
+\item 
+T {\bf operator()} (void)\label{classrandom__generator_a2}
+
+\item 
+template$<$$>$ bool {\bf operator()} (void)\label{classrandom__generator_a3}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+T {\bf minim}\label{classrandom__generator_r0}
+
+\item 
+T {\bf range}\label{classrandom__generator_r1}
+
+\item 
+{\bf eo\-Rng} \& {\bf random}\label{classrandom__generator_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class T = uint32\_\-t$>$ class random\_\-generator$<$ T $>$}
+
+The class random\_\-generator can be used in the STL generate function to easily generate random ints either between [0, \_\-max) if only one value (\_\-max) is given to the ctor or in [\_\-min,\_\-max) if 2 values are given (\_\-min, \_\-max). 
+
+
+
+Definition at line 87 of file rnd\_\-generators.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+rnd\_\-generators.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/classuniform__generator.tex b/trunk/paradiseo-eo/doc/latex/classuniform__generator.tex
new file mode 100644
index 000000000..8cd6eb947
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/classuniform__generator.tex
@@ -0,0 +1,45 @@
+\section{uniform\_\-generator$<$ T $>$ Class Template Reference}
+\label{classuniform__generator}\index{uniform_generator@{uniform\_\-generator}}
+The class uniform\_\-generator can be used in the STL generate function to easily generate random floats and doubles either in [0, \_\-max) if only 1 value (\_\-max) is given (or none, as \_\-max defaults to 1.0) or in [\_\-min,\_\-max) if 2 values are given (\_\-min, \_\-max).  
+
+
+{\tt \#include $<$rnd\_\-generators.h$>$}
+
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf uniform\_\-generator} (T \_\-max=T(1.0), {\bf eo\-Rng} \&\_\-rng=rng)\label{classuniform__generator_a0}
+
+\item 
+{\bf uniform\_\-generator} (T \_\-min, T \_\-max, {\bf eo\-Rng} \&\_\-rng=rng)\label{classuniform__generator_a1}
+
+\item 
+T {\bf operator()} (void)\label{classuniform__generator_a2}
+
+\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+T {\bf minim}\label{classuniform__generator_r0}
+
+\item 
+T {\bf range}\label{classuniform__generator_r1}
+
+\item 
+{\bf eo\-Rng} \& {\bf uniform}\label{classuniform__generator_r2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class T = double$>$ class uniform\_\-generator$<$ T $>$}
+
+The class uniform\_\-generator can be used in the STL generate function to easily generate random floats and doubles either in [0, \_\-max) if only 1 value (\_\-max) is given (or none, as \_\-max defaults to 1.0) or in [\_\-min,\_\-max) if 2 values are given (\_\-min, \_\-max). 
+
+
+
+Definition at line 44 of file rnd\_\-generators.h.
+
+The documentation for this class was generated from the following file:\begin{CompactItemize}
+\item 
+rnd\_\-generators.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000000.tex b/trunk/paradiseo-eo/doc/latex/dir_000000.tex
new file mode 100644
index 000000000..e4277f419
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000000.tex
@@ -0,0 +1,230 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ Directory Reference}
+\label{dir_000000}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ Directory Reference}}
+\subsection*{Directories}
+\begin{CompactItemize}
+\item 
+directory{\bf do}
+\item 
+directory{\bf es}
+\item 
+directory{\bf ga}
+\item 
+directory{\bf gp}
+\item 
+directory{\bf other}
+\item 
+directory{\bf pyeo}
+\item 
+directory{\bf utils}
+\end{CompactItemize}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf apply.h}
+\item 
+file {\bf EO.h}
+\item 
+file {\bf eoAlgo.h}
+\item 
+file {\bf eoBreed.h}
+\item 
+file {\bf eoCellularEasyEA.h}
+\item 
+file {\bf eoCloneOps.h}
+\item 
+file {\bf eoCombinedContinue.h}
+\item 
+file {\bf eoCombinedInit.h}
+\item 
+file {\bf eoContinue.h}
+\item 
+file {\bf eoCounter.h}
+\item 
+file {\bf eoCtrlCContinue.cpp}
+\item 
+file {\bf eoCtrlCContinue.h}
+\item 
+file {\bf eoDetSelect.h}
+\item 
+file {\bf eoDetTournamentSelect.h}
+\item 
+file {\bf eoDistribUpdater.h}
+\item 
+file {\bf eoDistribution.h}
+\item 
+file {\bf eoDominanceMap.h}
+\item 
+file {\bf eoEasyEA.h}
+\item 
+file {\bf eoEDA.h}
+\item 
+file {\bf eoEvalContinue.h}
+\item 
+file {\bf eoEvalFunc.h}
+\item 
+file {\bf eoEvalFuncCounter.h}
+\item 
+file {\bf eoEvalFuncPtr.h}
+\item 
+file {\bf eoFactory.h}
+\item 
+file {\bf eoFitContinue.h}
+\item 
+file {\bf eoFitnessScalingSelect.h}
+\item 
+file {\bf eoFlOrBinOp.h}
+\item 
+file {\bf eoFlOrMonOp.h}
+\item 
+file {\bf eoFlOrQuadOp.h}
+\item 
+file {\bf eoFunctor.h}
+\item 
+file {\bf eoFunctorStore.cpp}
+\item 
+file {\bf eoFunctorStore.h}
+\item 
+file {\bf eoG3Replacement.h}
+\item 
+file {\bf eoGenContinue.h}
+\item 
+file {\bf eoGeneralBreeder.h}
+\item 
+file {\bf eoGenOp.h}
+\item 
+file {\bf eoInit.h}
+\item 
+file {\bf eoInvalidateOps.h}
+\item 
+file {\bf eoLinearFitScaling.h}
+\item 
+file {\bf eoMerge.h}
+\item 
+file {\bf eoMergeReduce.h}
+\item 
+file {\bf eoMGGReplacement.h}
+\item 
+file {\bf eoNDSorting.h}
+\item 
+file {\bf eoObject.h}
+\item 
+file {\bf eoOneToOneBreeder.h}
+\item 
+file {\bf eoOp.h}
+\item 
+file {\bf eoOpContainer.h}
+\item 
+file {\bf eoOpSelMason.h}
+\item 
+file {\bf eoParetoConstraintFitness.h}
+\item 
+file {\bf eoParetoFitness.cpp}
+\item 
+file {\bf eoParetoFitness.h}
+\item 
+file {\bf eoParetoRanking.h}
+\item 
+file {\bf eoPerf2Worth.h}
+\item 
+file {\bf eoPeriodicContinue.h}
+\item 
+file {\bf eoPersistent.cpp}
+\item 
+file {\bf eoPersistent.h}
+\item 
+file {\bf eoPop.h}
+\item 
+file {\bf eoPopAlgo.h}
+\item 
+file {\bf eoPopEvalFunc.h}
+\item 
+file {\bf eoPopulator.h}
+\item 
+file {\bf eoPrintable.cpp}
+\item 
+file {\bf eoPrintable.h}
+\item 
+file {\bf eoPropGAGenOp.h}
+\item 
+file {\bf eoProportionalCombinedOp.h}
+\item 
+file {\bf eoProportionalSelect.h}
+\item 
+file {\bf eoRandomSelect.h}
+\item 
+file {\bf eoRanking.h}
+\item 
+file {\bf eoRankingSelect.h}
+\item 
+file {\bf eoReduce.h}
+\item 
+file {\bf eoReduceMerge.h}
+\item 
+file {\bf eoReduceMergeReduce.h}
+\item 
+file {\bf eoReduceSplit.h}
+\item 
+file {\bf eoReplacement.h}
+\item 
+file {\bf eoScalarFitness.h}
+\item 
+file {\bf eoScalarFitnessAssembled.cpp}
+\item 
+file {\bf eoScalarFitnessAssembled.h}
+\item 
+file {\bf eoSelect.h}
+\item 
+file {\bf eoSelectFactory.h}
+\item 
+file {\bf eoSelectFromWorth.h}
+\item 
+file {\bf eoSelectMany.h}
+\item 
+file {\bf eoSelectNumber.h}
+\item 
+file {\bf eoSelectOne.h}
+\item 
+file {\bf eoSelectPerc.h}
+\item 
+file {\bf eoSequentialSelect.h}
+\item 
+file {\bf eoSGA.h}
+\item 
+file {\bf eoSGAGenOp.h}
+\item 
+file {\bf eoSGATransform.h}
+\item 
+file {\bf eoSharing.h}
+\item 
+file {\bf eoSharingSelect.h}
+\item 
+file {\bf eoSimpleEDA.h}
+\item 
+file {\bf eoSteadyFitContinue.h}
+\item 
+file {\bf eoSTLFunctor.h}
+\item 
+file {\bf eoStochasticUniversalSelect.h}
+\item 
+file {\bf eoStochTournamentSelect.h}
+\item 
+file {\bf eoSurviveAndDie.h}
+\item 
+file {\bf eoTransform.h}
+\item 
+file {\bf eoTruncatedSelectMany.h}
+\item 
+file {\bf eoTruncatedSelectOne.h}
+\item 
+file {\bf eoTruncSelect.h}
+\item 
+file {\bf eoVariableLengthCrossover.h}
+\item 
+file {\bf eoVariableLengthMutation.h}
+\item 
+file {\bf eoVector.h}
+\item 
+file {\bf es.h}
+\item 
+file {\bf ga.h}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000001.tex b/trunk/paradiseo-eo/doc/latex/dir_000001.tex
new file mode 100644
index 000000000..207a8046a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000001.tex
@@ -0,0 +1,49 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/ Directory Reference}
+\label{dir_000001}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/ Directory Reference}}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf abstract1.cpp}
+\item 
+file {\bf algos.cpp}
+\item 
+file {\bf breeders.cpp}
+\item 
+file {\bf continuators.cpp}
+\item 
+file {\bf def_abstract_functor.h}
+\item 
+file {\bf geneticOps.cpp}
+\item 
+file {\bf mergers.cpp}
+\item 
+file {\bf monitors.cpp}
+\item 
+file {\bf src/pyeo/NEWS}
+\item 
+file {\bf perf2worth.cpp}
+\item 
+file {\bf pickle.h}
+\item 
+file {\bf PyEO.cpp}
+\item 
+file {\bf PyEO.h}
+\item 
+file {\bf random_numbers.cpp}
+\item 
+file {\bf src/pyeo/README}
+\item 
+file {\bf reduce.cpp}
+\item 
+file {\bf replacement.cpp}
+\item 
+file {\bf selectOne.cpp}
+\item 
+file {\bf selectors.cpp}
+\item 
+file {\bf statistics.cpp}
+\item 
+file {\bf valueParam.cpp}
+\item 
+file {\bf valueParam.h}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000002.tex b/trunk/paradiseo-eo/doc/latex/dir_000002.tex
new file mode 100644
index 000000000..145c7c06a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000002.tex
@@ -0,0 +1,101 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/test/ Directory Reference}
+\label{dir_000002}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/test/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/test/ Directory Reference}}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf test/binary_value.h}
+\item 
+file {\bf fitness_traits.cpp}
+\item 
+file {\bf test/real_value.h}
+\item 
+file {\bf RoyalRoad.h}
+\item 
+file {\bf t-eo.cpp}
+\item 
+file {\bf t-eoAtomOps.cpp}
+\item 
+file {\bf t-eoBaseFunctions.cpp}
+\item 
+file {\bf t-eobin.cpp}
+\item 
+file {\bf t-eobreeder.cpp}
+\item 
+file {\bf t-eoCheckpointing.cpp}
+\item 
+file {\bf t-eoCMAES.cpp}
+\item 
+file {\bf t-eoEasyEA.cpp}
+\item 
+file {\bf t-eoESAll.cpp}
+\item 
+file {\bf t-eoESFull.cpp}
+\item 
+file {\bf t-eoESOps.cpp}
+\item 
+file {\bf t-eoExternalEO.cpp}
+\item 
+file {\bf t-eofitness.cpp}
+\item 
+file {\bf t-eoFitnessAssembled.cpp}
+\item 
+file {\bf t-eoFitnessAssembledEA.cpp}
+\item 
+file {\bf t-eoFunctor.cpp}
+\item 
+file {\bf t-eoGA.cpp}
+\item 
+file {\bf t-eogeneration.cpp}
+\item 
+file {\bf t-eoGenOp.cpp}
+\item 
+file {\bf t-eoGOpSel.cpp}
+\item 
+file {\bf t-eoinclusion.cpp}
+\item 
+file {\bf t-eoinsertion.cpp}
+\item 
+file {\bf t-eolottery.cpp}
+\item 
+file {\bf t-eoNonUniform.cpp}
+\item 
+file {\bf t-eoPareto.cpp}
+\item 
+file {\bf t-eoParetoFitness.cpp}
+\item 
+file {\bf t-eoPBIL.cpp}
+\item 
+file {\bf t-eoproblem.cpp}
+\item 
+file {\bf t-eoRandom.cpp}
+\item 
+file {\bf t-eoReal.cpp}
+\item 
+file {\bf t-eoReplacement.cpp}
+\item 
+file {\bf t-eoRoulette.cpp}
+\item 
+file {\bf t-eoSelect.cpp}
+\item 
+file {\bf t-eoSharing.cpp}
+\item 
+file {\bf t-eoSSGA.cpp}
+\item 
+file {\bf t-eoStateAndParser.cpp}
+\item 
+file {\bf t-eoSymreg.cpp}
+\item 
+file {\bf t-eoUniform.cpp}
+\item 
+file {\bf t-eoVector.cpp}
+\item 
+file {\bf t-eoVirus.cpp}
+\item 
+file {\bf t-MGE-control.cpp}
+\item 
+file {\bf t-MGE.cpp}
+\item 
+file {\bf t-MGE1bit.cpp}
+\item 
+file {\bf t-selectOne.cpp}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000003.tex b/trunk/paradiseo-eo/doc/latex/dir_000003.tex
new file mode 100644
index 000000000..841182e16
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000003.tex
@@ -0,0 +1,22 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/ Directory Reference}
+\label{dir_000003}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/ Directory Reference}}
+\subsection*{Directories}
+\begin{CompactItemize}
+\item 
+directory{\bf Lesson1}
+\item 
+directory{\bf Lesson2}
+\item 
+directory{\bf Lesson3}
+\item 
+directory{\bf Lesson4}
+\item 
+directory{\bf Lesson5}
+\item 
+directory{\bf Templates}
+\end{CompactItemize}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf tutorial/README}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000004.tex b/trunk/paradiseo-eo/doc/latex/dir_000004.tex
new file mode 100644
index 000000000..d33f68f4c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000004.tex
@@ -0,0 +1,15 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson2/ Directory Reference}
+\label{dir_000004}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson2/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson2/ Directory Reference}}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf tutorial/Lesson2/binary_value.h}
+\item 
+file {\bf exercise2.3.cpp}
+\item 
+file {\bf FirstBitEA.cpp}
+\item 
+file {\bf FirstRealEA.cpp}
+\item 
+file {\bf tutorial/Lesson2/real_value.h}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000005.tex b/trunk/paradiseo-eo/doc/latex/dir_000005.tex
new file mode 100644
index 000000000..c939914b3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000005.tex
@@ -0,0 +1,15 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson3/ Directory Reference}
+\label{dir_000005}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson3/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson3/ Directory Reference}}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf tutorial/Lesson3/binary_value.h}
+\item 
+file {\bf exercise3.1.cpp}
+\item 
+file {\bf tutorial/Lesson3/real_value.h}
+\item 
+file {\bf SecondBitEA.cpp}
+\item 
+file {\bf SecondRealEA.cpp}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000006.tex b/trunk/paradiseo-eo/doc/latex/dir_000006.tex
new file mode 100644
index 000000000..d1b827cb4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000006.tex
@@ -0,0 +1,15 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson4/ Directory Reference}
+\label{dir_000006}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson4/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson4/ Directory Reference}}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf tutorial/Lesson4/binary_value.h}
+\item 
+file {\bf BitEA.cpp}
+\item 
+file {\bf ESEA.cpp}
+\item 
+file {\bf tutorial/Lesson4/real_value.h}
+\item 
+file {\bf RealEA.cpp}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000007.tex b/trunk/paradiseo-eo/doc/latex/dir_000007.tex
new file mode 100644
index 000000000..40a2e7d72
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000007.tex
@@ -0,0 +1,16 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/ Directory Reference}
+\label{dir_000007}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/ Directory Reference}}
+\subsection*{Directories}
+\begin{CompactItemize}
+\item 
+directory{\bf mathsym}
+\item 
+directory{\bf MGE}
+\end{CompactItemize}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf eoAged.h}
+\item 
+file {\bf eoDrawable.h}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000008.tex b/trunk/paradiseo-eo/doc/latex/dir_000008.tex
new file mode 100644
index 000000000..248602f1c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000008.tex
@@ -0,0 +1,28 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/ Directory Reference}
+\label{dir_000008}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/ Directory Reference}}
+\subsection*{Directories}
+\begin{CompactItemize}
+\item 
+directory{\bf eo\_\-interface}
+\item 
+directory{\bf eval}
+\item 
+directory{\bf fun}
+\item 
+directory{\bf gen}
+\item 
+directory{\bf regression}
+\item 
+directory{\bf sym}
+\item 
+directory{\bf test}
+\end{CompactItemize}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf contrib/mathsym/README}
+\item 
+file {\bf shared_ptr.h}
+\item 
+file {\bf symreg.cpp}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000009.tex b/trunk/paradiseo-eo/doc/latex/dir_000009.tex
new file mode 100644
index 000000000..8f0eaf795
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000009.tex
@@ -0,0 +1,21 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eval/ Directory Reference}
+\label{dir_000009}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eval/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eval/ Directory Reference}}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf BoundsCheck.cpp}
+\item 
+file {\bf BoundsCheck.h}
+\item 
+file {\bf Interval.h}
+\item 
+file {\bf MultiFuncs.cpp}
+\item 
+file {\bf MultiFunction.cpp}
+\item 
+file {\bf MultiFunction.h}
+\item 
+file {\bf sym_compile.cpp}
+\item 
+file {\bf sym_compile.h}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000010.tex b/trunk/paradiseo-eo/doc/latex/dir_000010.tex
new file mode 100644
index 000000000..386e12416
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000010.tex
@@ -0,0 +1,91 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/ Directory Reference}
+\label{dir_000010}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/ Directory Reference}}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf CMAParams.cpp}
+\item 
+file {\bf CMAParams.h}
+\item 
+file {\bf CMAState.cpp}
+\item 
+file {\bf CMAState.h}
+\item 
+file {\bf eig.cpp}
+\item 
+file {\bf eig.h}
+\item 
+file {\bf eoCMABreed.h}
+\item 
+file {\bf eoCMAInit.h}
+\item 
+file {\bf eoEsChromInit.h}
+\item 
+file {\bf eoEsFull.h}
+\item 
+file {\bf eoEsGlobalXover.h}
+\item 
+file {\bf eoEsMutate.h}
+\item 
+file {\bf eoEsMutationInit.h}
+\item 
+file {\bf eoEsSimple.h}
+\item 
+file {\bf eoEsStandardXover.h}
+\item 
+file {\bf eoEsStdev.h}
+\item 
+file {\bf eoNormalMutation.h}
+\item 
+file {\bf eoReal.h}
+\item 
+file {\bf eoRealAtomXover.h}
+\item 
+file {\bf eoRealInitBounded.h}
+\item 
+file {\bf eoRealOp.h}
+\item 
+file {\bf eoSBXcross.h}
+\item 
+file {\bf make_algo_scalar_es.cpp}
+\item 
+file {\bf make_algo_scalar_real.cpp}
+\item 
+file {\bf make_checkpoint_es.cpp}
+\item 
+file {\bf make_checkpoint_real.cpp}
+\item 
+file {\bf make_continue_es.cpp}
+\item 
+file {\bf make_continue_real.cpp}
+\item 
+file {\bf make_es.h}
+\item 
+file {\bf make_genotype_es.cpp}
+\item 
+file {\bf make_genotype_real.cpp}
+\item 
+file {\bf make_genotype_real.h}
+\item 
+file {\bf es/make_op.h}
+\item 
+file {\bf make_op_es.cpp}
+\item 
+file {\bf make_op_es.h}
+\item 
+file {\bf make_op_real.cpp}
+\item 
+file {\bf make_op_real.h}
+\item 
+file {\bf make_pop_es.cpp}
+\item 
+file {\bf make_pop_real.cpp}
+\item 
+file {\bf make_real.h}
+\item 
+file {\bf make_run_es.cpp}
+\item 
+file {\bf make_run_real.cpp}
+\item 
+file {\bf matrices.h}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000011.tex b/trunk/paradiseo-eo/doc/latex/dir_000011.tex
new file mode 100644
index 000000000..7dabd96b6
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000011.tex
@@ -0,0 +1,101 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/ Directory Reference}
+\label{dir_000011}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/ Directory Reference}}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf compatibility.h}
+\item 
+file {\bf eoAssembledFitnessStat.h}
+\item 
+file {\bf eoCheckPoint.h}
+\item 
+file {\bf eoData.cpp}
+\item 
+file {\bf eoData.h}
+\item 
+file {\bf eoDistance.h}
+\item 
+file {\bf eoFDCStat.h}
+\item 
+file {\bf eoFileMonitor.cpp}
+\item 
+file {\bf eoFileMonitor.h}
+\item 
+file {\bf eoFileSnapshot.h}
+\item 
+file {\bf eoGnuplot.cpp}
+\item 
+file {\bf eoGnuplot.h}
+\item 
+file {\bf eoGnuplot1DMonitor.cpp}
+\item 
+file {\bf eoGnuplot1DMonitor.h}
+\item 
+file {\bf eoGnuplot1DSnapshot.cpp}
+\item 
+file {\bf eoGnuplot1DSnapshot.h}
+\item 
+file {\bf eoHowMany.h}
+\item 
+file {\bf eoIntBounds.cpp}
+\item 
+file {\bf eoIntBounds.h}
+\item 
+file {\bf eoMOFitnessStat.h}
+\item 
+file {\bf eoMonitor.h}
+\item 
+file {\bf eoParam.h}
+\item 
+file {\bf eoParser.cpp}
+\item 
+file {\bf eoParser.h}
+\item 
+file {\bf eoPopStat.h}
+\item 
+file {\bf eoRealBounds.cpp}
+\item 
+file {\bf eoRealBounds.h}
+\item 
+file {\bf eoRealVectorBounds.h}
+\item 
+file {\bf eoRndGenerators.h}
+\item 
+file {\bf eoRNG.cpp}
+\item 
+file {\bf eoRNG.h}
+\item 
+file {\bf eoScalarFitnessStat.h}
+\item 
+file {\bf eoStat.h}
+\item 
+file {\bf eoState.cpp}
+\item 
+file {\bf eoState.h}
+\item 
+file {\bf eoStdoutMonitor.cpp}
+\item 
+file {\bf eoStdoutMonitor.h}
+\item 
+file {\bf eoTimeCounter.h}
+\item 
+file {\bf eoTimedMonitor.h}
+\item 
+file {\bf eoUniformInit.h}
+\item 
+file {\bf eoUpdatable.h}
+\item 
+file {\bf eoUpdater.cpp}
+\item 
+file {\bf eoUpdater.h}
+\item 
+file {\bf make_help.cpp}
+\item 
+file {\bf pipecom.cpp}
+\item 
+file {\bf pipecom.h}
+\item 
+file {\bf rnd_generators.h}
+\item 
+file {\bf selectors.h}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000012.tex b/trunk/paradiseo-eo/doc/latex/dir_000012.tex
new file mode 100644
index 000000000..86e5c69be
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000012.tex
@@ -0,0 +1,23 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/ Directory Reference}
+\label{dir_000012}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/ Directory Reference}}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf Dataset.cpp}
+\item 
+file {\bf Dataset.h}
+\item 
+file {\bf ErrorMeasure.cpp}
+\item 
+file {\bf ErrorMeasure.h}
+\item 
+file {\bf Scaling.cpp}
+\item 
+file {\bf Scaling.h}
+\item 
+file {\bf stats.h}
+\item 
+file {\bf TargetInfo.cpp}
+\item 
+file {\bf TargetInfo.h}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000013.tex b/trunk/paradiseo-eo/doc/latex/dir_000013.tex
new file mode 100644
index 000000000..5ba2bcdbb
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000013.tex
@@ -0,0 +1,43 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/ Directory Reference}
+\label{dir_000013}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/ Directory Reference}}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf eoBit.h}
+\item 
+file {\bf eoBitOp.h}
+\item 
+file {\bf eoBitOpFactory.h}
+\item 
+file {\bf eoBoolFlip.h}
+\item 
+file {\bf eoPBILAdditive.h}
+\item 
+file {\bf eoPBILDistrib.h}
+\item 
+file {\bf eoPBILOrg.h}
+\item 
+file {\bf make_algo_scalar_ga.cpp}
+\item 
+file {\bf make_checkpoint_ga.cpp}
+\item 
+file {\bf make_continue_ga.cpp}
+\item 
+file {\bf make_ga.h}
+\item 
+file {\bf make_genotype_ga.cpp}
+\item 
+file {\bf make_genotype_ga.h}
+\item 
+file {\bf ga/make_op.h}
+\item 
+file {\bf make_op_ga.cpp}
+\item 
+file {\bf make_PBILdistrib.h}
+\item 
+file {\bf make_PBILupdate.h}
+\item 
+file {\bf make_pop_ga.cpp}
+\item 
+file {\bf make_run_ga.cpp}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000014.tex b/trunk/paradiseo-eo/doc/latex/dir_000014.tex
new file mode 100644
index 000000000..e9e651aa7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000014.tex
@@ -0,0 +1,11 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/src/other/ Directory Reference}
+\label{dir_000014}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/src/other/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/src/other/ Directory Reference}}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf eoExternalEO.h}
+\item 
+file {\bf eoExternalOpFunctions.h}
+\item 
+file {\bf eoString.h}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000015.tex b/trunk/paradiseo-eo/doc/latex/dir_000015.tex
new file mode 100644
index 000000000..540f914cd
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000015.tex
@@ -0,0 +1,11 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/MGE/ Directory Reference}
+\label{dir_000015}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/MGE/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/MGE/ Directory Reference}}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf eoInitVirus.h}
+\item 
+file {\bf eoVirus.h}
+\item 
+file {\bf VirusOp.h}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000016.tex b/trunk/paradiseo-eo/doc/latex/dir_000016.tex
new file mode 100644
index 000000000..29212416b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000016.tex
@@ -0,0 +1,25 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson5/ Directory Reference}
+\label{dir_000016}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson5/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson5/ Directory Reference}}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf eoOneMax.h}
+\item 
+file {\bf eoOneMaxEvalFunc.h}
+\item 
+file {\bf eoOneMaxInit.h}
+\item 
+file {\bf eoOneMaxMutation.h}
+\item 
+file {\bf eoOneMaxQuadCrossover.h}
+\item 
+file {\bf make_genotype_OneMax.h}
+\item 
+file {\bf make_OneMax.cpp}
+\item 
+file {\bf make_op_OneMax.h}
+\item 
+file {\bf OneMaxEA.cpp}
+\item 
+file {\bf OneMaxLibEA.cpp}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000017.tex b/trunk/paradiseo-eo/doc/latex/dir_000017.tex
new file mode 100644
index 000000000..6cd043aba
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000017.tex
@@ -0,0 +1,19 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/ Directory Reference}
+\label{dir_000017}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/ Directory Reference}}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf eoParseTree.h}
+\item 
+file {\bf eoParseTreeDepthInit.h}
+\item 
+file {\bf eoParseTreeOp.h}
+\item 
+file {\bf eoStParseTreeDepthInit.h}
+\item 
+file {\bf eoStParseTreeOp.h}
+\item 
+file {\bf node_pool.h}
+\item 
+file {\bf parse_tree.h}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000018.tex b/trunk/paradiseo-eo/doc/latex/dir_000018.tex
new file mode 100644
index 000000000..0966af74e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000018.tex
@@ -0,0 +1,23 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eo\_\-interface/ Directory Reference}
+\label{dir_000018}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eo_interface/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eo\_\-interface/ Directory Reference}}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf eoSym.h}
+\item 
+file {\bf eoSymCrossover.cpp}
+\item 
+file {\bf eoSymCrossover.h}
+\item 
+file {\bf eoSymEval.h}
+\item 
+file {\bf eoSymInit.h}
+\item 
+file {\bf eoSymLambdaMutate.cpp}
+\item 
+file {\bf eoSymLambdaMutate.h}
+\item 
+file {\bf eoSymMutate.cpp}
+\item 
+file {\bf eoSymMutate.h}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000019.tex b/trunk/paradiseo-eo/doc/latex/dir_000019.tex
new file mode 100644
index 000000000..147baccbc
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000019.tex
@@ -0,0 +1,11 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson1/ Directory Reference}
+\label{dir_000019}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson1/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson1/ Directory Reference}}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf exercise1.3.cpp}
+\item 
+file {\bf FirstBitGA.cpp}
+\item 
+file {\bf FirstRealGA.cpp}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000020.tex b/trunk/paradiseo-eo/doc/latex/dir_000020.tex
new file mode 100644
index 000000000..6cb1ba3f3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000020.tex
@@ -0,0 +1,11 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/app/ Directory Reference}
+\label{dir_000020}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/app/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/app/ Directory Reference}}
+\subsection*{Directories}
+\begin{CompactItemize}
+\item 
+directory{\bf gprop}
+\item 
+directory{\bf gpsymreg}
+\item 
+directory{\bf mastermind}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000021.tex b/trunk/paradiseo-eo/doc/latex/dir_000021.tex
new file mode 100644
index 000000000..b19339d59
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000021.tex
@@ -0,0 +1,13 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gpsymreg/ Directory Reference}
+\label{dir_000021}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gpsymreg/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gpsymreg/ Directory Reference}}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf fitness.h}
+\item 
+file {\bf main.cpp}
+\item 
+file {\bf node.h}
+\item 
+file {\bf parameters.h}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000022.tex b/trunk/paradiseo-eo/doc/latex/dir_000022.tex
new file mode 100644
index 000000000..df6cbd65c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000022.tex
@@ -0,0 +1,17 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/fun/ Directory Reference}
+\label{dir_000022}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/fun/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/fun/ Directory Reference}}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf FunDef.cpp}
+\item 
+file {\bf FunDef.h}
+\item 
+file {\bf sym_operations.cpp}
+\item 
+file {\bf SymOps.cpp}
+\item 
+file {\bf SymOps.h}
+\item 
+file {\bf util.cpp}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000023.tex b/trunk/paradiseo-eo/doc/latex/dir_000023.tex
new file mode 100644
index 000000000..afbeca2a0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000023.tex
@@ -0,0 +1,19 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gprop/ Directory Reference}
+\label{dir_000023}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gprop/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gprop/ Directory Reference}}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf gprop.cpp}
+\item 
+file {\bf gprop.h}
+\item 
+file {\bf l2.h}
+\item 
+file {\bf mlp.h}
+\item 
+file {\bf mse.h}
+\item 
+file {\bf qp.h}
+\item 
+file {\bf vecop.h}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000024.tex b/trunk/paradiseo-eo/doc/latex/dir_000024.tex
new file mode 100644
index 000000000..a6785e21f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000024.tex
@@ -0,0 +1,17 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/gen/ Directory Reference}
+\label{dir_000024}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/gen/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/gen/ Directory Reference}}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf LanguageTable.cpp}
+\item 
+file {\bf LanguageTable.h}
+\item 
+file {\bf NodeSelector.cpp}
+\item 
+file {\bf NodeSelector.h}
+\item 
+file {\bf TreeBuilder.cpp}
+\item 
+file {\bf TreeBuilder.h}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000025.tex b/trunk/paradiseo-eo/doc/latex/dir_000025.tex
new file mode 100644
index 000000000..e333b1065
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000025.tex
@@ -0,0 +1,29 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/src/do/ Directory Reference}
+\label{dir_000025}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/src/do/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/src/do/ Directory Reference}}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf make_algo_easea.h}
+\item 
+file {\bf make_algo_pareto.h}
+\item 
+file {\bf make_algo_scalar.h}
+\item 
+file {\bf make_checkpoint.h}
+\item 
+file {\bf make_checkpoint_assembled.h}
+\item 
+file {\bf make_checkpoint_FDC.h}
+\item 
+file {\bf make_checkpoint_pareto.h}
+\item 
+file {\bf make_continue.h}
+\item 
+file {\bf make_continue_pareto.h}
+\item 
+file {\bf make_general_replacement.h}
+\item 
+file {\bf make_pop.h}
+\item 
+file {\bf make_run.h}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000026.tex b/trunk/paradiseo-eo/doc/latex/dir_000026.tex
new file mode 100644
index 000000000..586af581f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000026.tex
@@ -0,0 +1,19 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Templates/ Directory Reference}
+\label{dir_000026}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Templates/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Templates/ Directory Reference}}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf make_genotype_MyStruct.h}
+\item 
+file {\bf make_MyStruct.cpp}
+\item 
+file {\bf make_op_MyStruct.h}
+\item 
+file {\bf MyStructEA.cpp}
+\item 
+file {\bf MyStructLibEA.cpp}
+\item 
+file {\bf MyStructSEA.cpp}
+\item 
+file {\bf tutorial/Templates/README}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000027.tex b/trunk/paradiseo-eo/doc/latex/dir_000027.tex
new file mode 100644
index 000000000..3670d5de9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000027.tex
@@ -0,0 +1,9 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/app/mastermind/ Directory Reference}
+\label{dir_000027}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/app/mastermind/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/app/mastermind/ Directory Reference}}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf mastermind.cpp}
+\item 
+file {\bf mastermind.h}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000028.tex b/trunk/paradiseo-eo/doc/latex/dir_000028.tex
new file mode 100644
index 000000000..cca9f1797
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000028.tex
@@ -0,0 +1,17 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/sym/ Directory Reference}
+\label{dir_000028}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/sym/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/sym/ Directory Reference}}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf README.cpp}
+\item 
+file {\bf Sym.cpp}
+\item 
+file {\bf Sym.h}
+\item 
+file {\bf SymImpl.cpp}
+\item 
+file {\bf SymImpl.h}
+\item 
+file {\bf token.h}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/dir_000029.tex b/trunk/paradiseo-eo/doc/latex/dir_000029.tex
new file mode 100644
index 000000000..09a5adacc
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/dir_000029.tex
@@ -0,0 +1,17 @@
+\section{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/test/ Directory Reference}
+\label{dir_000029}\index{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/test/ Directory Reference@{/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/test/ Directory Reference}}
+\subsection*{Files}
+\begin{CompactItemize}
+\item 
+file {\bf test_compile.cpp}
+\item 
+file {\bf test_diff.cpp}
+\item 
+file {\bf test_lambda.cpp}
+\item 
+file {\bf test_mf.cpp}
+\item 
+file {\bf test_simplify.cpp}
+\item 
+file {\bf testeo.cpp}
+\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/doxygen.sty b/trunk/paradiseo-eo/doc/latex/doxygen.sty
new file mode 100644
index 000000000..387f34339
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/doxygen.sty
@@ -0,0 +1,64 @@
+\NeedsTeXFormat{LaTeX2e}
+\ProvidesPackage{doxygen}
+\RequirePackage{calc}
+\RequirePackage{array}
+\pagestyle{fancyplain}
+\newcommand{\clearemptydoublepage}{\newpage{\pagestyle{empty}\cleardoublepage}}
+\renewcommand{\chaptermark}[1]{\markboth{#1}{}}
+\renewcommand{\sectionmark}[1]{\markright{\thesection\ #1}}
+\lhead[\fancyplain{}{\bfseries\thepage}]
+        {\fancyplain{}{\bfseries\rightmark}}
+\rhead[\fancyplain{}{\bfseries\leftmark}]
+        {\fancyplain{}{\bfseries\thepage}}
+\rfoot[\fancyplain{}{\bfseries\scriptsize Generated on Thu Oct 19 05:06:33 2006 for EO by Doxygen }]{}
+\lfoot[]{\fancyplain{}{\bfseries\scriptsize Generated on Thu Oct 19 05:06:33 2006 for EO by Doxygen }}
+\cfoot{}
+\newenvironment{CompactList}
+{\begin{list}{}{
+  \setlength{\leftmargin}{0.5cm}
+  \setlength{\itemsep}{0pt}
+  \setlength{\parsep}{0pt}
+  \setlength{\topsep}{0pt}
+  \renewcommand{\makelabel}{}}}
+{\end{list}}
+\newenvironment{CompactItemize}
+{
+  \begin{itemize}
+  \setlength{\itemsep}{-3pt}
+  \setlength{\parsep}{0pt}
+  \setlength{\topsep}{0pt}
+  \setlength{\partopsep}{0pt}
+}
+{\end{itemize}}
+\newcommand{\PBS}[1]{\let\temp=\\#1\let\\=\temp}
+\newlength{\tmplength}
+\newenvironment{TabularC}[1]
+{
+\setlength{\tmplength}
+     {\linewidth/(#1)-\tabcolsep*2-\arrayrulewidth*(#1+1)/(#1)}
+      \par\begin{tabular*}{\linewidth}
+             {*{#1}{|>{\PBS\raggedright\hspace{0pt}}p{\the\tmplength}}|}
+}
+{\end{tabular*}\par}
+\newcommand{\entrylabel}[1]{
+   {\parbox[b]{\labelwidth-4pt}{\makebox[0pt][l]{\textbf{#1}}\\}}}
+\newenvironment{Desc}
+{\begin{list}{}
+  {
+    \settowidth{\labelwidth}{40pt}
+    \setlength{\leftmargin}{\labelwidth}
+    \setlength{\parsep}{0pt}
+    \setlength{\itemsep}{-4pt}
+    \renewcommand{\makelabel}{\entrylabel}
+  }
+}
+{\end{list}}
+\newenvironment{Indent}
+  {\begin{list}{}{\setlength{\leftmargin}{0.5cm}}
+      \item[]\ignorespaces}
+  {\unskip\end{list}}
+\setlength{\parindent}{0cm}
+\setlength{\parskip}{0.2cm}
+\addtocounter{secnumdepth}{1}
+\sloppy
+\usepackage[T1]{fontenc}
diff --git a/trunk/paradiseo-eo/doc/latex/group___evolution_strategies.tex b/trunk/paradiseo-eo/doc/latex/group___evolution_strategies.tex
new file mode 100644
index 000000000..ff0199f36
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/group___evolution_strategies.tex
@@ -0,0 +1,21 @@
+\section{Evolution\-Strategies}
+\label{group___evolution_strategies}\index{EvolutionStrategies@{EvolutionStrategies}}
+\subsection*{Classes}
+\begin{CompactItemize}
+\item 
+class {\bf eo\-Es\-Chrom\-Init$<$ EOT $>$}
+\begin{CompactList}\small\item\em Random Es-chromosome initializer (therefore derived from {\bf eo\-Init}{\rm (p.\,\pageref{classeo_init})}). \item\end{CompactList}\item 
+class {\bf eo\-Es\-Full$<$ Fit $>$}
+\begin{CompactList}\small\item\em The most complex evolutionary strategy representation. \item\end{CompactList}\item 
+class {\bf eo\-Es\-Mutate$<$ EOT $>$}
+\begin{CompactList}\small\item\em ES-style mutation in the large. \item\end{CompactList}\item 
+class {\bf eo\-Es\-Mutation\-Init}
+\begin{CompactList}\small\item\em Initialize Mutation operator. \item\end{CompactList}\item 
+class {\bf eo\-Es\-Simple$<$ Fit $>$}
+\begin{CompactList}\small\item\em Simple Evolution Strategy. \item\end{CompactList}\item 
+class {\bf eo\-Es\-Stdev$<$ Fit $>$}
+\begin{CompactList}\small\item\em Evolutionary Strategy with a standard deviation per parameter. \item\end{CompactList}\item 
+class {\bf eo\-Int\-Bounds}
+\begin{CompactList}\small\item\em Defines bound classes for real numbers. \item\end{CompactList}\item 
+class {\bf eo\-Real\-Bounds}
+\begin{CompactList}\small\item\em Defines bound classes for real numbers. \item\end{CompactList}\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/group___operators.tex b/trunk/paradiseo-eo/doc/latex/group___operators.tex
new file mode 100644
index 000000000..d7f8153be
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/group___operators.tex
@@ -0,0 +1,3 @@
+\section{Operators}
+\label{group___operators}\index{Operators@{Operators}}
+Genetic Operators are used for various purposes.  
diff --git a/trunk/paradiseo-eo/doc/latex/group___parse_tree.tex b/trunk/paradiseo-eo/doc/latex/group___parse_tree.tex
new file mode 100644
index 000000000..a8c9fc413
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/group___parse_tree.tex
@@ -0,0 +1,50 @@
+\section{Parse\-Tree}
+\label{group___parse_tree}\index{ParseTree@{ParseTree}}
+Various functions for tree-based Genetic Programming.  
+\subsection*{Classes}
+\begin{CompactItemize}
+\item 
+class {\bf eo\-Parse\-Tree$<$ FType, Node $>$}
+\begin{CompactList}\small\item\em Implementation of parse-tree for genetic programming. \item\end{CompactList}\item 
+class {\bf eo\-Parse\-Tree\-Depth\-Init$<$ FType, Node $>$}
+\begin{CompactList}\small\item\em eo\-Parse\-Tree\-Depth\-Init : the initializer class for {\bf eo\-Parse\-Tree}{\rm (p.\,\pageref{classeo_parse_tree})} \item\end{CompactList}\item 
+class {\bf eo\-Subtree\-XOver$<$ FType, Node $>$}
+\begin{CompactList}\small\item\em eo\-Subtree\-XOver --$>$ subtree xover \item\end{CompactList}\item 
+class {\bf eo\-Branch\-Mutation$<$ FType, Node $>$}
+\begin{CompactList}\small\item\em eo\-Branch\-Mutation --$>$ replace a subtree with a randomly created subtree \item\end{CompactList}\item 
+class {\bf eo\-Point\-Mutation$<$ FType, Node $>$}
+\begin{CompactList}\small\item\em eo\-Point\-Mutation --$>$ replace a Node with a Node of the same arity \item\end{CompactList}\item 
+class {\bf eo\-Expansion\-Mutation$<$ FType, Node $>$}
+\begin{CompactList}\small\item\em eo\-Expansion\-Mutation --$>$ replace a terminal with a randomly created subtree \item\end{CompactList}\item 
+class {\bf eo\-Collapse\-Subtree\-Mutation$<$ FType, Node $>$}
+\begin{CompactList}\small\item\em eo\-Collapse\-Subtree --$>$ replace a subtree with a randomly chosen terminal \item\end{CompactList}\item 
+class {\bf eo\-Hoist\-Mutation$<$ FType, Node $>$}
+\begin{CompactList}\small\item\em eo\-Hoist\-Mutation --$>$ replace the individual with one of its subtree's \item\end{CompactList}\end{CompactItemize}
+\subsection*{Functions}
+\begin{CompactItemize}
+\item 
+template$<$class FType, class Node$>$ void {\bf eo\-Init\-Ramped\-Half\-And\-Half} ({\bf eo\-Pop}$<$ {\bf eo\-Parse\-Tree}$<$ FType, Node $>$ $>$ \&pop, unsigned int population\_\-size, unsigned int init\_\-max\_\-depth, std::vector$<$ Node $>$ \&initializor)
+\begin{CompactList}\small\item\em A template function for ramped half and half initialization of an {\bf eo\-Parse\-Tree}{\rm (p.\,\pageref{classeo_parse_tree})} population. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Various functions for tree-based Genetic Programming. 
+
+
+
+\subsection{Function Documentation}
+\index{ParseTree@{Parse\-Tree}!eoInitRampedHalfAndHalf@{eoInitRampedHalfAndHalf}}
+\index{eoInitRampedHalfAndHalf@{eoInitRampedHalfAndHalf}!ParseTree@{Parse\-Tree}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class FType, class Node$>$ void eo\-Init\-Ramped\-Half\-And\-Half ({\bf eo\-Pop}$<$ {\bf eo\-Parse\-Tree}$<$ FType, Node $>$ $>$ \& {\em pop}, unsigned int {\em population\_\-size}, unsigned int {\em init\_\-max\_\-depth}, std::vector$<$ Node $>$ \& {\em initializor})}\label{group___parse_tree_ga0}
+
+
+A template function for ramped half and half initialization of an {\bf eo\-Parse\-Tree}{\rm (p.\,\pageref{classeo_parse_tree})} population. 
+
+\begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em pop}]the population to be created \item[{\em population\_\-size}]the size of the population to be created \item[{\em init\_\-max\_\-depth}]the initial maximum tree depth \item[{\em initializor}]A std::vector containing the possible nodes \end{description}
+\end{Desc}
+
+
+Definition at line 179 of file eo\-Parse\-Tree\-Depth\-Init.h.
\ No newline at end of file
diff --git a/trunk/paradiseo-eo/doc/latex/group___prop_combined_operators.tex b/trunk/paradiseo-eo/doc/latex/group___prop_combined_operators.tex
new file mode 100644
index 000000000..cc50f0444
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/group___prop_combined_operators.tex
@@ -0,0 +1,3 @@
+\section{Prop\-Combined\-Operators}
+\label{group___prop_combined_operators}\index{PropCombinedOperators@{PropCombinedOperators}}
+Combination of same-type Genetic Operators - Proportional choice.  
diff --git a/trunk/paradiseo-eo/doc/latex/group___st_parse_tree.tex b/trunk/paradiseo-eo/doc/latex/group___st_parse_tree.tex
new file mode 100644
index 000000000..f4906f452
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/group___st_parse_tree.tex
@@ -0,0 +1,24 @@
+\section{St\-Parse\-Tree}
+\label{group___st_parse_tree}\index{StParseTree@{StParseTree}}
+Various functions for strongly typed tree-based Genetic Programming.  
+\subsection*{Classes}
+\begin{CompactItemize}
+\item 
+class {\bf eo\-St\-Parse\-Tree\-Depth\-Init$<$ FType, Node $>$}
+\begin{CompactList}\small\item\em eo\-St\-Parse\-Tree\-Depth\-Init : the initializer class for strongly typed tree-based genetic programming \item\end{CompactList}\item 
+class {\bf eo\-St\-Subtree\-XOver$<$ FType, Node $>$}
+\begin{CompactList}\small\item\em eo\-St\-Subtree\-XOver --$>$ subtree xover for strongly typed tree-based genetic programming \item\end{CompactList}\item 
+class {\bf eo\-St\-Branch\-Mutation$<$ FType, Node $>$}
+\begin{CompactList}\small\item\em eo\-St\-Branch\-Mutation --$>$ replace a strongly typed subtree with a randomly created strongly typed subtree \item\end{CompactList}\item 
+class {\bf eo\-St\-Point\-Mutation$<$ FType, Node $>$}
+\begin{CompactList}\small\item\em eo\-St\-Point\-Mutation --$>$ replace a Node with a Node of the same arity and type \item\end{CompactList}\item 
+class {\bf eo\-St\-Hoist\-Mutation$<$ FType, Node $>$}
+\begin{CompactList}\small\item\em eo\-St\-Hoist\-Mutation --$>$ replace the individual with one of its strongly typed subtree's \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Various functions for strongly typed tree-based Genetic Programming. 
+
+The St\-Parse\-Tree functions use the same {\bf eo\-Parse\-Tree}{\rm (p.\,\pageref{classeo_parse_tree})} class for the individual but now each node class must have two additional functions. \begin{itemize}
+\item int type(void) which returns the return type of the node \item int type(int child) which returns the required type for child 0, 1 or 2\end{itemize}
+Pruning strongly typed trees is not possible at the moment. 
\ No newline at end of file
diff --git a/trunk/paradiseo-eo/doc/latex/group__bitstring.tex b/trunk/paradiseo-eo/doc/latex/group__bitstring.tex
new file mode 100644
index 000000000..8bc90acfe
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/group__bitstring.tex
@@ -0,0 +1,35 @@
+\section{Bitstring}
+\label{group__bitstring}\index{Bitstring@{Bitstring}}
+Various functions for a bitstring representation.  
+\subsection*{Classes}
+\begin{CompactItemize}
+\item 
+class {\bf eo\-Bit$<$ Fit\-T $>$}
+\begin{CompactList}\small\item\em Implementation of bitstring chromosome. \item\end{CompactList}\item 
+class {\bf eo\-Bit$<$ Fit\-T $>$}
+\begin{CompactList}\small\item\em Implementation of bitstring chromosome. \item\end{CompactList}\item 
+class {\bf eo\-Bit\-Bit\-Flip}
+\begin{CompactList}\small\item\em eo\-Bit\-Flip --$>$ changes 1 bit \item\end{CompactList}\item 
+class {\bf eo\-Det\-Bit\-Flip$<$ Chrom $>$}
+\begin{CompactList}\small\item\em eo\-Det\-Bit\-Flip --$>$ changes exactly k bits \item\end{CompactList}\item 
+class {\bf eo\-Bit\-Mutation$<$ Chrom $>$}
+\begin{CompactList}\small\item\em eo\-Bit\-Mutation --$>$ classical mutation \item\end{CompactList}\item 
+class {\bf eo\-Bit\-Inversion$<$ Chrom $>$}
+\begin{CompactList}\small\item\em eo\-Bit\-Inversion: inverts the bits of the chromosome between an interval \item\end{CompactList}\item 
+class {\bf eo\-Bit\-Next$<$ Chrom $>$}
+\begin{CompactList}\small\item\em eo\-Bit\-Next --$>$ next value when bitstring considered as binary value \item\end{CompactList}\item 
+class {\bf eo\-Bit\-Prev$<$ Chrom $>$}
+\begin{CompactList}\small\item\em eo\-Bit\-Prev --$>$ previous value when bitstring treated as binary value \item\end{CompactList}\item 
+class {\bf eo1Pt\-Bit\-Crossover}
+\begin{CompactList}\small\item\em eo1Pt\-Bit\-Xover --$>$ classic 1-point crossover \item\end{CompactList}\item 
+class {\bf eo\-UBit\-Xover$<$ Chrom $>$}
+\begin{CompactList}\small\item\em eo\-UBit\-Xover --$>$ classic Uniform crossover \item\end{CompactList}\item 
+class {\bf eo\-NPts\-Bit\-Xover$<$ Chrom $>$}
+\begin{CompactList}\small\item\em eo\-NPts\-Bit\-Xover --$>$ n-point crossover \item\end{CompactList}\item 
+class {\bf eo\-Bit\-Gx\-Over$<$ Chrom $>$}
+\begin{CompactList}\small\item\em eo\-Bit\-Gx\-Over --$>$ Npts crossover when bistd::string considered as a std::string of binary-encoded genes (exchanges genes) Is anybody still using it apart from historians ??? :-) \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Various functions for a bitstring representation. 
+
diff --git a/trunk/paradiseo-eo/doc/latex/group__selectors.tex b/trunk/paradiseo-eo/doc/latex/group__selectors.tex
new file mode 100644
index 000000000..81beb80ed
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/group__selectors.tex
@@ -0,0 +1,2 @@
+\section{Selectors}
+\label{group__selectors}\index{Selectors@{Selectors}}
diff --git a/trunk/paradiseo-eo/doc/latex/hierarchy.tex b/trunk/paradiseo-eo/doc/latex/hierarchy.tex
new file mode 100644
index 000000000..e4d23d853
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/hierarchy.tex
@@ -0,0 +1,1311 @@
+\section{EO Class Hierarchy}
+This inheritance list is sorted roughly, but not completely, alphabetically:\begin{CompactList}
+\item \contentsline{section}{eo1Pt\-Bit\-Crossover}{\pageref{classeo1_pt_bit_crossover}}{}
+\item \contentsline{section}{eo\-Aged$<$ Object $>$}{\pageref{classeo_aged}}{}
+\item \contentsline{section}{eo\-Arithmetic\-Crossover}{\pageref{classeo_arithmetic_crossover}}{}
+\item eo\-Best\-Fitness\-Stat$<$ EOT $>$::Cmp\-Fitness\item binary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-BF$<$ eo\-Pop$<$ EOT $>$ \&, unsigned, void $>$}{\pageref{classeo_b_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Reduce$<$ EOT $>$}{\pageref{classeo_reduce}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Det\-Tournament\-Truncate$<$ EOT $>$}{\pageref{classeo_det_tournament_truncate}}{}
+\item \contentsline{section}{eo\-EPReduce$<$ EOT $>$}{\pageref{classeo_e_p_reduce}}{}
+\item \contentsline{section}{eo\-Linear\-Truncate$<$ EOT $>$}{\pageref{classeo_linear_truncate}}{}
+\item \contentsline{section}{eo\-Random\-Reduce$<$ EOT $>$}{\pageref{classeo_random_reduce}}{}
+\item \contentsline{section}{eo\-Stoch\-Tournament\-Truncate$<$ EOT $>$}{\pageref{classeo_stoch_tournament_truncate}}{}
+\item \contentsline{section}{eo\-Stoch\-Tournament\-Truncate\-Split$<$ EOT $>$}{\pageref{classeo_stoch_tournament_truncate_split}}{}
+\item \contentsline{section}{eo\-Truncate$<$ EOT $>$}{\pageref{classeo_truncate}}{}
+\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item binary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-BF$<$ eo\-Distribution$<$ EOT $>$ \&, eo\-Pop$<$ EOT $>$ \&, void $>$}{\pageref{classeo_b_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Distrib\-Updater$<$ EOT $>$}{\pageref{classeo_distrib_updater}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-PBILAdditive$<$ EOT $>$}{\pageref{classeo_p_b_i_l_additive}}{}
+\item \contentsline{section}{eo\-PBILOrg$<$ EOT $>$}{\pageref{classeo_p_b_i_l_org}}{}
+\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item binary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-BF$<$ Py\-EO \&, Py\-EO \&, bool $>$}{\pageref{classeo_b_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Quad\-Op$<$ Py\-EO $>$}{\pageref{classeo_quad_op}}{}
+\begin{CompactList}
+\item Quad\-Op\-Wrapper\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item binary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-BF$<$ eo\-Pop$<$ EOT $>$ \&, eo\-Pop$<$ EOT $>$ \&, void $>$}{\pageref{classeo_b_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Pop\-Eval\-Func$<$ EOT $>$}{\pageref{classeo_pop_eval_func}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Pop\-Loop\-Eval$<$ EOT $>$}{\pageref{classeo_pop_loop_eval}}{}
+\item \contentsline{section}{eo\-Time\-Varying\-Loop\-Eval$<$ EOT $>$}{\pageref{classeo_time_varying_loop_eval}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Reduce\-Split$<$ EOT $>$}{\pageref{classeo_reduce_split}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Det\-Tournament\-Truncate\-Split$<$ EOT $>$}{\pageref{classeo_det_tournament_truncate_split}}{}
+\item \contentsline{section}{eo\-Linear\-Random\-Split$<$ EOT $>$}{\pageref{classeo_linear_random_split}}{}
+\item \contentsline{section}{eo\-Linear\-Truncate\-Split$<$ EOT $>$}{\pageref{classeo_linear_truncate_split}}{}
+\item \contentsline{section}{eo\-Random\-Split$<$ EOT $>$}{\pageref{classeo_random_split}}{}
+\item \contentsline{section}{eo\-Truncate\-Split$<$ EOT $>$}{\pageref{classeo_truncate_split}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Replacement$<$ EOT $>$}{\pageref{classeo_replacement}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Deterministic\-Sa\-DReplacement$<$ EOT $>$}{\pageref{classeo_deterministic_sa_d_replacement}}{}
+\item \contentsline{section}{eo\-G3Replacement$<$ EOT $>$}{\pageref{classeo_g3_replacement}}{}
+\item \contentsline{section}{eo\-Generational\-Replacement$<$ EOT $>$}{\pageref{classeo_generational_replacement}}{}
+\item \contentsline{section}{eo\-Merge\-Reduce$<$ EOT $>$}{\pageref{classeo_merge_reduce}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Comma\-Replacement$<$ EOT $>$}{\pageref{classeo_comma_replacement}}{}
+\item \contentsline{section}{eo\-EPReplacement$<$ EOT $>$}{\pageref{classeo_e_p_replacement}}{}
+\item \contentsline{section}{eo\-Plus\-Replacement$<$ EOT $>$}{\pageref{classeo_plus_replacement}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-MGGReplacement$<$ EOT $>$}{\pageref{classeo_m_g_g_replacement}}{}
+\item \contentsline{section}{eo\-NDPlus\-Replacement$<$ EOT, Worth\-T $>$}{\pageref{classeo_n_d_plus_replacement}}{}
+\item \contentsline{section}{eo\-NDPlus\-Replacement$<$ EOT, Worth\-T $>$}{\pageref{classeo_n_d_plus_replacement}}{}
+\item \contentsline{section}{eo\-Reduce\-Merge$<$ EOT $>$}{\pageref{classeo_reduce_merge}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-SSGADet\-Tournament\-Replacement$<$ EOT $>$}{\pageref{classeo_s_s_g_a_det_tournament_replacement}}{}
+\item \contentsline{section}{eo\-SSGAStoch\-Tournament\-Replacement$<$ EOT $>$}{\pageref{classeo_s_s_g_a_stoch_tournament_replacement}}{}
+\item \contentsline{section}{eo\-SSGAWorse\-Replacement$<$ EOT $>$}{\pageref{classeo_s_s_g_a_worse_replacement}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Reduce\-Merge\-Reduce$<$ EOT $>$}{\pageref{classeo_reduce_merge_reduce}}{}
+\item \contentsline{section}{eo\-Weak\-Elitist\-Replacement$<$ EOT $>$}{\pageref{classeo_weak_elitist_replacement}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Survive\-And\-Die$<$ EOT $>$}{\pageref{classeo_survive_and_die}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Deterministic\-Survive\-And\-Die$<$ EOT $>$}{\pageref{classeo_deterministic_survive_and_die}}{}
+\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item binary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-BF$<$ Chrom \&, Chrom \&, bool $>$}{\pageref{classeo_b_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Quad\-Op$<$ Chrom $>$}{\pageref{classeo_quad_op}}{}
+\begin{CompactList}
+\item eo1Pt\-Bit\-Xover\item \contentsline{section}{eo\-Bit\-Gx\-Over$<$ Chrom $>$}{\pageref{classeo_bit_gx_over}}{}
+\item eo\-Chrom\-Xover\item eo\-Chrom\-Xover\item \contentsline{section}{eo\-NPts\-Bit\-Xover$<$ Chrom $>$}{\pageref{classeo_n_pts_bit_xover}}{}
+\item \contentsline{section}{eo\-UBit\-Xover$<$ Chrom $>$}{\pageref{classeo_u_bit_xover}}{}
+\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item binary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-BF$<$ External\-EO \&, const External\-EO \&, bool $>$}{\pageref{classeo_b_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Bin\-Op$<$ External\-EO $>$}{\pageref{classeo_bin_op}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-External\-Bin\-Op$<$ F, External, External\-EO $>$}{\pageref{classeo_external_bin_op}}{}
+\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item binary\_\-function\item binary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-BF$<$ const Dummy \&, const Dummy \&, double $>$}{\pageref{classeo_b_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Distance$<$ Dummy $>$}{\pageref{classeo_distance}}{}
+\begin{CompactList}
+\item eo\-Dummy\-Distance\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item binary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-BF$<$ EOType \&, EOType \&, bool $>$}{\pageref{classeo_b_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Quad\-Op$<$ EOType $>$}{\pageref{classeo_quad_op}}{}
+\end{CompactList}
+\end{CompactList}
+\item binary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-BF$<$ Genotype\-T \&, Genotype\-T \&, bool $>$}{\pageref{classeo_b_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Quad\-Op$<$ Genotype\-T $>$}{\pageref{classeo_quad_op}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-One\-Max\-Quad\-Crossover$<$ Genotype\-T $>$}{\pageref{classeo_one_max_quad_crossover}}{}
+\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item binary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-BF$<$ Eo\-Type \&, Eo\-Type \&, bool $>$}{\pageref{classeo_b_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Quad\-Op$<$ Eo\-Type $>$}{\pageref{classeo_quad_op}}{}
+\begin{CompactList}
+\item eo\-Quad\-Subtree\-Crossover\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item binary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-BF$<$ unsigned, Atom \&, bool $>$}{\pageref{classeo_b_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Atom\-Exchange$<$ Atom $>$}{\pageref{classeo_atom_exchange}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Uniform\-Atom\-Exchange$<$ Atom $>$}{\pageref{classeo_uniform_atom_exchange}}{}
+\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item binary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-BF$<$ eo\-Virus$<$ Fit\-T $>$ \&, const eo\-Virus$<$ Fit\-T $>$ \&, bool $>$}{\pageref{classeo_b_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Bin\-Op$<$ eo\-Virus$<$ Fit\-T $>$ $>$}{\pageref{classeo_bin_op}}{}
+\begin{CompactList}
+\item Virus\-Transmission\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item binary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-BF$<$ Eo\-Type \&, const Eo\-Type \&, bool $>$}{\pageref{classeo_b_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Bin\-Op$<$ Eo\-Type $>$}{\pageref{classeo_bin_op}}{}
+\begin{CompactList}
+\item eo\-Bin\-Homologous\-Crossover\item eo\-Bin\-Subtree\-Crossover\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item binary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-BF$<$ EOT \&, const EOT \&, bool $>$}{\pageref{classeo_b_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Bin\-Op$<$ EOT $>$}{\pageref{classeo_bin_op}}{}
+\begin{CompactList}
+\item binop\item \contentsline{section}{eo\-Bin\-Clone\-Op$<$ EOT $>$}{\pageref{classeo_bin_clone_op}}{}
+\item \contentsline{section}{eo\-Es\-Standard\-Xover$<$ EOT $>$}{\pageref{classeo_es_standard_xover}}{}
+\item \contentsline{section}{eo\-Fl\-Or1pt\-Bin\-Op$<$ EOT $>$}{\pageref{classeo_fl_or1pt_bin_op}}{}
+\item \contentsline{section}{eo\-Fl\-Or\-All\-Atom\-Bin\-Op$<$ EOT $>$}{\pageref{classeo_fl_or_all_atom_bin_op}}{}
+\item \contentsline{section}{eo\-Fl\-Or\-KAtom\-Bin\-Op$<$ EOT $>$}{\pageref{classeo_fl_or_k_atom_bin_op}}{}
+\item \contentsline{section}{eo\-Fl\-Or\-Uniform\-Bin\-Op$<$ EOT $>$}{\pageref{classeo_fl_or_uniform_bin_op}}{}
+\item \contentsline{section}{eo\-Invalidate\-Bin\-Op$<$ EOT $>$}{\pageref{classeo_invalidate_bin_op}}{}
+\item \contentsline{section}{eo\-Prop\-Combined\-Bin\-Op$<$ EOT $>$}{\pageref{classeo_prop_combined_bin_op}}{}
+\item \contentsline{section}{eo\-Quad2Bin\-Op$<$ EOT $>$}{\pageref{classeo_quad2_bin_op}}{}
+\item \contentsline{section}{eo\-Vl\-Uniform\-Bin\-Op$<$ EOT $>$}{\pageref{classeo_vl_uniform_bin_op}}{}
+\item Xover\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item binary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-BF$<$ External\-EO \&, External\-EO \&, bool $>$}{\pageref{classeo_b_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Quad\-Op$<$ External\-EO $>$}{\pageref{classeo_quad_op}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-External\-Quad\-Op$<$ F, External, External\-EO $>$}{\pageref{classeo_external_quad_op}}{}
+\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item binary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-BF$<$ EOT \&, EOT \&, bool $>$}{\pageref{classeo_b_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Quad\-Op$<$ EOT $>$}{\pageref{classeo_quad_op}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Fl\-Or1pt\-Quad\-Op$<$ EOT $>$}{\pageref{classeo_fl_or1pt_quad_op}}{}
+\item \contentsline{section}{eo\-Fl\-Or\-All\-Atom\-Quad\-Op$<$ EOT $>$}{\pageref{classeo_fl_or_all_atom_quad_op}}{}
+\item \contentsline{section}{eo\-Fl\-Or\-KAtom\-Quad\-Op$<$ EOT $>$}{\pageref{classeo_fl_or_k_atom_quad_op}}{}
+\item \contentsline{section}{eo\-Fl\-Or\-Uniform\-Quad\-Op$<$ EOT $>$}{\pageref{classeo_fl_or_uniform_quad_op}}{}
+\item eo\-Hypercube\-Crossover\item \contentsline{section}{eo\-Inner\-Exchange\-Quad\-Op$<$ EOT $>$}{\pageref{classeo_inner_exchange_quad_op}}{}
+\item \contentsline{section}{eo\-Invalidate\-Quad\-Op$<$ EOT $>$}{\pageref{classeo_invalidate_quad_op}}{}
+\item \contentsline{section}{eo\-Prop\-Combined\-Quad\-Op$<$ EOT $>$}{\pageref{classeo_prop_combined_quad_op}}{}
+\item \contentsline{section}{eo\-Quad\-Clone\-Op$<$ EOT $>$}{\pageref{classeo_quad_clone_op}}{}
+\item eo\-Real\-UXover\item eo\-SBXCrossover\item \contentsline{section}{eo\-Segment\-Crossover$<$ EOT $>$}{\pageref{classeo_segment_crossover}}{}
+\item \contentsline{section}{eo\-Vl\-Atom\-Exchange\-Quad\-Op$<$ EOT $>$}{\pageref{classeo_vl_atom_exchange_quad_op}}{}
+\item \contentsline{section}{eo\-Vl\-Uniform\-Quad\-Op$<$ EOT $>$}{\pageref{classeo_vl_uniform_quad_op}}{}
+\item quad\-Clone\item quadop\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item binary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-BF$<$ eo\-Pop$<$ Eo\-Type $>$ \&, eo\-Pop$<$ Eo\-Type $>$ \&, void $>$}{\pageref{classeo_b_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Pop\-Eval\-Func$<$ Eo\-Type $>$}{\pageref{classeo_pop_eval_func}}{}
+\begin{CompactList}
+\item eo\-Sym\-Pop\-Eval\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item binary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-BF$<$ const eo\-Pop$<$ EOT $>$ \&, eo\-Pop$<$ EOT $>$ \&, void $>$}{\pageref{classeo_b_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Breed$<$ EOT $>$}{\pageref{classeo_breed}}{}
+\begin{CompactList}
+\item eo\-Breed\-One\item \contentsline{section}{eo\-General\-Breeder$<$ EOT $>$}{\pageref{classeo_general_breeder}}{}
+\item eo\-One\-To\-One\-Breeder\item \contentsline{section}{eo\-Select\-Transform$<$ EOT $>$}{\pageref{classeo_select_transform}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Merge$<$ EOT $>$}{\pageref{classeo_merge}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Elitism$<$ EOT $>$}{\pageref{classeo_elitism}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-No\-Elitism$<$ EOT $>$}{\pageref{classeo_no_elitism}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Plus$<$ EOT $>$}{\pageref{classeo_plus}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Select$<$ EOT $>$}{\pageref{classeo_select}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Det\-Select$<$ EOT $>$}{\pageref{classeo_det_select}}{}
+\item eo\-Easy\-EA::eo\-Dummy\-Select\item \contentsline{section}{eo\-Select\-Many$<$ EOT $>$}{\pageref{classeo_select_many}}{}
+\item \contentsline{section}{eo\-Select\-Number$<$ EOT $>$}{\pageref{classeo_select_number}}{}
+\item \contentsline{section}{eo\-Select\-Perc$<$ EOT $>$}{\pageref{classeo_select_perc}}{}
+\item \contentsline{section}{eo\-Truncated\-Select\-Many$<$ EOT $>$}{\pageref{classeo_truncated_select_many}}{}
+\item \contentsline{section}{eo\-Trunc\-Select$<$ EOT $>$}{\pageref{classeo_trunc_select}}{}
+\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item binary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-BF$<$ const EOT \&, const EOT \&, double $>$}{\pageref{classeo_b_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Distance$<$ EOT $>$}{\pageref{classeo_distance}}{}
+\begin{CompactList}
+\item eo\-Fitness\-Distance\item \contentsline{section}{eo\-Hamming\-Distance$<$ EOT $>$}{\pageref{classeo_hamming_distance}}{}
+\item \contentsline{section}{eo\-Quad\-Distance$<$ EOT $>$}{\pageref{classeo_quad_distance}}{}
+\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item binary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-BF$<$ EOType \&, const EOType \&, bool $>$}{\pageref{classeo_b_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Bin\-Op$<$ EOType $>$}{\pageref{classeo_bin_op}}{}
+\end{CompactList}
+\end{CompactList}
+\item binary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-BF$<$ eo\-Pop$<$ Py\-EO $>$ \&, unsigned, void $>$}{\pageref{classeo_b_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Reduce$<$ Py\-EO $>$}{\pageref{classeo_reduce}}{}
+\begin{CompactList}
+\item eo\-Reduce\-Wrapper\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item binary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-BF$<$ const eo\-Pop$<$ Chrom $>$ \&, eo\-Pop$<$ Chrom $>$ \&, void $>$}{\pageref{classeo_b_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Merge$<$ Chrom $>$}{\pageref{classeo_merge}}{}
+\end{CompactList}
+\end{CompactList}
+\item binary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-BF$<$ eo\-Parse\-Tree$<$ FType, Node $>$ \&, eo\-Parse\-Tree$<$ FType, Node $>$ \&, bool $>$}{\pageref{classeo_b_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Quad\-Op$<$ eo\-Parse\-Tree$<$ FType, Node $>$ $>$}{\pageref{classeo_quad_op}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-St\-Subtree\-XOver$<$ FType, Node $>$}{\pageref{classeo_st_subtree_x_over}}{}
+\item \contentsline{section}{eo\-Subtree\-XOver$<$ FType, Node $>$}{\pageref{classeo_subtree_x_over}}{}
+\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item binary\_\-function\item binary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-BF$<$ Py\-EO \&, const Py\-EO \&, bool $>$}{\pageref{classeo_b_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Bin\-Op$<$ Py\-EO $>$}{\pageref{classeo_bin_op}}{}
+\begin{CompactList}
+\item Bin\-Op\-Wrapper\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item binary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-BF$<$ const eo\-Pop$<$ eo\-Vector$<$ Fit\-T, double $>$ $>$ \&, eo\-Pop$<$ eo\-Vector$<$ Fit\-T, double $>$ $>$ \&, void $>$}{\pageref{classeo_b_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Breed$<$ eo\-Vector$<$ Fit\-T, double $>$ $>$}{\pageref{classeo_breed}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-CMABreed$<$ Fit\-T $>$}{\pageref{classeo_c_m_a_breed}}{}
+\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item binary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-BF$<$ double \&, const double \&, bool $>$}{\pageref{classeo_b_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Bin\-Op$<$ double $>$}{\pageref{classeo_bin_op}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Double\-Exchange}{\pageref{classeo_double_exchange}}{}
+\item \contentsline{section}{eo\-Double\-Intermediate}{\pageref{classeo_double_intermediate}}{}
+\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item binary\_\-function\item Binary\-Value\item eoutils::Binary\-Wrapper$<$ Binary $>$\item \contentsline{section}{eo\-Bit\-Bit\-Flip}{\pageref{classeo_bit_bit_flip}}{}
+\item \contentsline{section}{boolean\_\-generator}{\pageref{classboolean__generator}}{}
+\item Bounds\-Check\item eo::CMAParams\item eo::CMAState\item eo::CMAState\-Impl\item Compiler\item Const\item \contentsline{section}{Cov}{\pageref{class_cov}}{}
+\item Cov\-Matrix\item Dataset\item Data\-Set\-Impl\item differentiation\_\-error\item \contentsline{section}{d\-Matrix}{\pageref{classd_matrix}}{}
+\item \contentsline{section}{eo\-Drawable$<$ Object $>$}{\pageref{classeo_drawable}}{}
+\item Easy\item eo\-EPReduce$<$ EOT $>$::Cmp\item Error\-Measure\item Error\-Measure::result\item Error\-Measure\-Impl\item \contentsline{section}{eo\-Es\-Mutation\-Init}{\pageref{classeo_es_mutation_init}}{}
+\item fitness\_\-traits$<$ T $>$\item fitness\_\-traits$<$ maximization $>$\item fitness\_\-traits$<$ minimization $>$\item fitness\_\-traits$<$ pair$<$ Performance, Worth $>$ $>$\item Function\item functor\_\-t\item \contentsline{section}{eo\-Functor\-Base}{\pageref{classeo_functor_base}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-BF$<$ A1, A2, R $>$}{\pageref{classeo_b_f}}{}
+\item \contentsline{section}{eo\-BF$<$ Chrom \&, Chrom \&, bool $>$}{\pageref{classeo_b_f}}{}
+\item \contentsline{section}{eo\-BF$<$ const Dummy \&, const Dummy \&, double $>$}{\pageref{classeo_b_f}}{}
+\item \contentsline{section}{eo\-BF$<$ const eo\-Pop$<$ Chrom $>$ \&, eo\-Pop$<$ Chrom $>$ \&, void $>$}{\pageref{classeo_b_f}}{}
+\item \contentsline{section}{eo\-BF$<$ const eo\-Pop$<$ EOT $>$ \&, eo\-Pop$<$ EOT $>$ \&, void $>$}{\pageref{classeo_b_f}}{}
+\item \contentsline{section}{eo\-BF$<$ const eo\-Pop$<$ eo\-Vector$<$ Fit\-T, double $>$ $>$ \&, eo\-Pop$<$ eo\-Vector$<$ Fit\-T, double $>$ $>$ \&, void $>$}{\pageref{classeo_b_f}}{}
+\item \contentsline{section}{eo\-BF$<$ const EOT \&, const EOT \&, double $>$}{\pageref{classeo_b_f}}{}
+\item \contentsline{section}{eo\-BF$<$ double \&, const double \&, bool $>$}{\pageref{classeo_b_f}}{}
+\item \contentsline{section}{eo\-BF$<$ eo\-Distribution$<$ EOT $>$ \&, eo\-Pop$<$ EOT $>$ \&, void $>$}{\pageref{classeo_b_f}}{}
+\item \contentsline{section}{eo\-BF$<$ eo\-Parse\-Tree$<$ FType, Node $>$ \&, eo\-Parse\-Tree$<$ FType, Node $>$ \&, bool $>$}{\pageref{classeo_b_f}}{}
+\item \contentsline{section}{eo\-BF$<$ eo\-Pop$<$ EOT $>$ \&, eo\-Pop$<$ EOT $>$ \&, void $>$}{\pageref{classeo_b_f}}{}
+\item \contentsline{section}{eo\-BF$<$ eo\-Pop$<$ EOT $>$ \&, unsigned, void $>$}{\pageref{classeo_b_f}}{}
+\item \contentsline{section}{eo\-BF$<$ eo\-Pop$<$ Eo\-Type $>$ \&, eo\-Pop$<$ Eo\-Type $>$ \&, void $>$}{\pageref{classeo_b_f}}{}
+\item \contentsline{section}{eo\-BF$<$ eo\-Pop$<$ Py\-EO $>$ \&, unsigned, void $>$}{\pageref{classeo_b_f}}{}
+\item \contentsline{section}{eo\-BF$<$ EOT \&, const EOT \&, bool $>$}{\pageref{classeo_b_f}}{}
+\item \contentsline{section}{eo\-BF$<$ EOT \&, EOT \&, bool $>$}{\pageref{classeo_b_f}}{}
+\item \contentsline{section}{eo\-BF$<$ EOType \&, const EOType \&, bool $>$}{\pageref{classeo_b_f}}{}
+\item \contentsline{section}{eo\-BF$<$ Eo\-Type \&, const Eo\-Type \&, bool $>$}{\pageref{classeo_b_f}}{}
+\item \contentsline{section}{eo\-BF$<$ Eo\-Type \&, Eo\-Type \&, bool $>$}{\pageref{classeo_b_f}}{}
+\item \contentsline{section}{eo\-BF$<$ EOType \&, EOType \&, bool $>$}{\pageref{classeo_b_f}}{}
+\item \contentsline{section}{eo\-BF$<$ eo\-Virus$<$ Fit\-T $>$ \&, const eo\-Virus$<$ Fit\-T $>$ \&, bool $>$}{\pageref{classeo_b_f}}{}
+\item \contentsline{section}{eo\-BF$<$ External\-EO \&, const External\-EO \&, bool $>$}{\pageref{classeo_b_f}}{}
+\item \contentsline{section}{eo\-BF$<$ External\-EO \&, External\-EO \&, bool $>$}{\pageref{classeo_b_f}}{}
+\item \contentsline{section}{eo\-BF$<$ Genotype\-T \&, Genotype\-T \&, bool $>$}{\pageref{classeo_b_f}}{}
+\item \contentsline{section}{eo\-BF$<$ Py\-EO \&, const Py\-EO \&, bool $>$}{\pageref{classeo_b_f}}{}
+\item \contentsline{section}{eo\-BF$<$ Py\-EO \&, Py\-EO \&, bool $>$}{\pageref{classeo_b_f}}{}
+\item \contentsline{section}{eo\-BF$<$ unsigned, Atom \&, bool $>$}{\pageref{classeo_b_f}}{}
+\item \contentsline{section}{eo\-F$<$ R $>$}{\pageref{classeo_f}}{}
+\item \contentsline{section}{eo\-F$<$ bool $>$}{\pageref{classeo_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Rnd\-Generator$<$ bool $>$}{\pageref{classeo_rnd_generator}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Boolean\-Generator}{\pageref{classeo_boolean_generator}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-F$<$ eo\-Monitor \& $>$}{\pageref{classeo_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Monitor}{\pageref{classeo_monitor}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-File\-Monitor}{\pageref{classeo_file_monitor}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Gnuplot1DMonitor}{\pageref{classeo_gnuplot1_d_monitor}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-File\-Snapshot}{\pageref{classeo_file_snapshot}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-FDCFile\-Snapshot$<$ EOT $>$}{\pageref{classeo_f_d_c_file_snapshot}}{}
+\item \contentsline{section}{eo\-Gnuplot1DSnapshot}{\pageref{classeo_gnuplot1_d_snapshot}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Stdout\-Monitor}{\pageref{classeo_stdout_monitor}}{}
+\item \contentsline{section}{eo\-Timed\-Monitor}{\pageref{classeo_timed_monitor}}{}
+\item Monitor\-Wrapper\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-F$<$ EOT $>$}{\pageref{classeo_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Init\-Generator$<$ EOT $>$}{\pageref{classeo_init_generator}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-F$<$ int $>$}{\pageref{classeo_f}}{}
+\begin{CompactList}
+\item eo2\end{CompactList}
+\item \contentsline{section}{eo\-F$<$ T $>$}{\pageref{classeo_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Rnd\-Generator$<$ T $>$}{\pageref{classeo_rnd_generator}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Neg\-Exp\-Generator$<$ T $>$}{\pageref{classeo_neg_exp_generator}}{}
+\item \contentsline{section}{eo\-Normal\-Generator$<$ T $>$}{\pageref{classeo_normal_generator}}{}
+\item \contentsline{section}{eo\-Uniform\-Generator$<$ T $>$}{\pageref{classeo_uniform_generator}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-F$<$ void $>$}{\pageref{classeo_f}}{}
+\begin{CompactList}
+\item eo1\item \contentsline{section}{eo\-Updater}{\pageref{classeo_updater}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Counted\-State\-Saver}{\pageref{classeo_counted_state_saver}}{}
+\item \contentsline{section}{eo\-Dyn\-Updater}{\pageref{classeo_dyn_updater}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Counted\-Dyn\-Update}{\pageref{classeo_counted_dyn_update}}{}
+\item \contentsline{section}{eo\-Timed\-Dyn\-Update}{\pageref{classeo_timed_dyn_update}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Incrementor$<$ T $>$}{\pageref{classeo_incrementor}}{}
+\item \contentsline{section}{eo\-Incrementor\-Param$<$ T $>$}{\pageref{classeo_incrementor_param}}{}
+\item \contentsline{section}{eo\-Time\-Counter}{\pageref{classeo_time_counter}}{}
+\item \contentsline{section}{eo\-Timed\-State\-Saver}{\pageref{classeo_timed_state_saver}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ A1, R $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Perf2Worth$<$ Dummy $>$}{\pageref{classeo_perf2_worth}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ bool \&, bool $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Mon\-Op$<$ bool $>$}{\pageref{classeo_mon_op}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Bool\-Flip}{\pageref{classeo_bool_flip}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ bool \&, void $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Init$<$ bool $>$}{\pageref{classeo_init}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Boolean\-Init}{\pageref{classeo_boolean_init}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ Chrom \&, bool $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Mon\-Op$<$ Chrom $>$}{\pageref{classeo_mon_op}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Bit\-Inversion$<$ Chrom $>$}{\pageref{classeo_bit_inversion}}{}
+\item \contentsline{section}{eo\-Bit\-Mutation$<$ Chrom $>$}{\pageref{classeo_bit_mutation}}{}
+\item \contentsline{section}{eo\-Bit\-Next$<$ Chrom $>$}{\pageref{classeo_bit_next}}{}
+\item \contentsline{section}{eo\-Bit\-Prev$<$ Chrom $>$}{\pageref{classeo_bit_prev}}{}
+\item eo\-Chrom\-Mutation\item eo\-Chrom\-Mutation\item \contentsline{section}{eo\-Det\-Bit\-Flip$<$ Chrom $>$}{\pageref{classeo_det_bit_flip}}{}
+\item eo\-One\-Bit\-Flip\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ Chrom \&, void $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Init$<$ Chrom $>$}{\pageref{classeo_init}}{}
+\begin{CompactList}
+\item eo\-Init\-Chrom\item eo\-Init\-Chrom\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ const eo\-Pop$<$ EOT $>$ \&, bool $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Continue$<$ EOT $>$}{\pageref{classeo_continue}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Check\-Point$<$ EOT $>$}{\pageref{classeo_check_point}}{}
+\item \contentsline{section}{eo\-Combined\-Continue$<$ EOT $>$}{\pageref{classeo_combined_continue}}{}
+\item \contentsline{section}{eo\-Ctrl\-CContinue$<$ EOT $>$}{\pageref{classeo_ctrl_c_continue}}{}
+\item \contentsline{section}{eo\-Eval\-Continue$<$ EOT $>$}{\pageref{classeo_eval_continue}}{}
+\item \contentsline{section}{eo\-Fit\-Continue$<$ EOT $>$}{\pageref{classeo_fit_continue}}{}
+\item \contentsline{section}{eo\-Gen\-Continue$<$ EOT $>$}{\pageref{classeo_gen_continue}}{}
+\item eo\-Periodic\-Continue\item \contentsline{section}{eo\-Steady\-Fit\-Continue$<$ EOT $>$}{\pageref{classeo_steady_fit_continue}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ const eo\-Pop$<$ EOT $>$ \&, const EOT \& $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Select\-One$<$ EOT, Worth\-T $>$}{\pageref{classeo_select_one}}{}
+\item \contentsline{section}{eo\-Select\-One$<$ EOT $>$}{\pageref{classeo_select_one}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Best\-Select$<$ EOT $>$}{\pageref{classeo_best_select}}{}
+\item eo\-Cellular\-Easy\-EA::eo\-Select\-First\-One\item \contentsline{section}{eo\-Det\-Tournament\-Select$<$ EOT $>$}{\pageref{classeo_det_tournament_select}}{}
+\item \contentsline{section}{eo\-Elite\-Sequential\-Select$<$ EOT $>$}{\pageref{classeo_elite_sequential_select}}{}
+\item \contentsline{section}{eo\-No\-Select$<$ EOT $>$}{\pageref{classeo_no_select}}{}
+\item \contentsline{section}{eo\-Proportional\-Select$<$ EOT $>$}{\pageref{classeo_proportional_select}}{}
+\item \contentsline{section}{eo\-Random\-Select$<$ EOT $>$}{\pageref{classeo_random_select}}{}
+\item \contentsline{section}{eo\-Select\-From\-Worth$<$ EOT, Worth\-Type $>$}{\pageref{classeo_select_from_worth}}{}
+\item \contentsline{section}{eo\-Select\-From\-Worth$<$ EOT, double $>$}{\pageref{classeo_select_from_worth}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Roulette\-Worth\-Select$<$ EOT, double $>$}{\pageref{classeo_roulette_worth_select}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Fitness\-Scaling\-Select$<$ EOT $>$}{\pageref{classeo_fitness_scaling_select}}{}
+\item \contentsline{section}{eo\-Ranking\-Select$<$ EOT $>$}{\pageref{classeo_ranking_select}}{}
+\item \contentsline{section}{eo\-Sharing\-Select$<$ EOT $>$}{\pageref{classeo_sharing_select}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-Select\-From\-Worth$<$ EOT, Worth\-T $>$}{\pageref{classeo_select_from_worth}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Det\-Tournament\-Worth\-Select$<$ EOT, Worth\-T $>$}{\pageref{classeo_det_tournament_worth_select}}{}
+\item \contentsline{section}{eo\-Roulette\-Worth\-Select$<$ EOT, Worth\-T $>$}{\pageref{classeo_roulette_worth_select}}{}
+\item \contentsline{section}{eo\-Stoch\-Tournament\-Worth\-Select$<$ EOT, Worth\-T $>$}{\pageref{classeo_stoch_tournament_worth_select}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Sequential\-Select$<$ EOT $>$}{\pageref{classeo_sequential_select}}{}
+\item \contentsline{section}{eo\-Stochastic\-Universal\-Select$<$ EOT $>$}{\pageref{classeo_stochastic_universal_select}}{}
+\item \contentsline{section}{eo\-Stoch\-Tournament\-Select$<$ EOT $>$}{\pageref{classeo_stoch_tournament_select}}{}
+\item \contentsline{section}{eo\-Truncated\-Select\-One$<$ EOT $>$}{\pageref{classeo_truncated_select_one}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ const eo\-Pop$<$ EOT $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Perf2Worth$<$ EOT, Worth\-T $>$}{\pageref{classeo_perf2_worth}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Perf2Worth\-Cached$<$ EOT, Worth\-T $>$}{\pageref{classeo_perf2_worth_cached}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Perf2Worth$<$ EOT $>$}{\pageref{classeo_perf2_worth}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Linear\-Fit\-Scaling$<$ EOT $>$}{\pageref{classeo_linear_fit_scaling}}{}
+\item \contentsline{section}{eo\-Ranking$<$ EOT $>$}{\pageref{classeo_ranking}}{}
+\item \contentsline{section}{eo\-Sharing$<$ EOT $>$}{\pageref{classeo_sharing}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Perf2Worth$<$ EOT, double $>$}{\pageref{classeo_perf2_worth}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Perf2Worth\-Cached$<$ EOT, double $>$}{\pageref{classeo_perf2_worth_cached}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-NDSorting$<$ EOT $>$}{\pageref{classeo_n_d_sorting}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-NDSorting\_\-I$<$ EOT $>$}{\pageref{classeo_n_d_sorting___i}}{}
+\item \contentsline{section}{eo\-NDSorting\_\-II$<$ EOT $>$}{\pageref{classeo_n_d_sorting___i_i}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Pareto\-Ranking$<$ EOT $>$}{\pageref{classeo_pareto_ranking}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-Perf2Worth$<$ EOT, EOT::Fitness $>$}{\pageref{classeo_perf2_worth}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-No\-Perf2Worth$<$ EOT $>$}{\pageref{classeo_no_perf2_worth}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Stat\-Base$<$ EOT $>$}{\pageref{classeo_stat_base}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Stat$<$ EOT, T $>$}{\pageref{classeo_stat}}{}
+\item \contentsline{section}{eo\-Stat$<$ EOT, double $>$}{\pageref{classeo_stat}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Assembled\-Fitness\-Average\-Stat$<$ EOT $>$}{\pageref{classeo_assembled_fitness_average_stat}}{}
+\item \contentsline{section}{eo\-Assembled\-Fitness\-Best\-Stat$<$ EOT $>$}{\pageref{classeo_assembled_fitness_best_stat}}{}
+\item eo\-Distance\-Stat\item \contentsline{section}{eo\-FDCStat$<$ EOT $>$}{\pageref{classeo_f_d_c_stat}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Stat$<$ EOT, EOT::Fitness $>$}{\pageref{classeo_stat}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Average\-Stat$<$ EOT $>$}{\pageref{classeo_average_stat}}{}
+\item \contentsline{section}{eo\-Best\-Fitness\-Stat$<$ EOT $>$}{\pageref{classeo_best_fitness_stat}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Stat$<$ EOT, std::pair$<$ double, double $>$ $>$}{\pageref{classeo_stat}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Second\-Moment\-Stats$<$ EOT $>$}{\pageref{classeo_second_moment_stats}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Stat$<$ EOT, std::string $>$}{\pageref{classeo_stat}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Pop\-Stat$<$ EOT $>$}{\pageref{classeo_pop_stat}}{}
+\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ const eo\-Pop$<$ Eo\-Type $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Dominance\-Map$<$ Eo\-Type $>$}{\pageref{classeo_dominance_map}}{}
+\item \contentsline{section}{eo\-Stat\-Base$<$ Eo\-Type $>$}{\pageref{classeo_stat_base}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Stat$<$ Eo\-Type, double $>$}{\pageref{classeo_stat}}{}
+\begin{CompactList}
+\item Average\-Size\-Stat\end{CompactList}
+\item \contentsline{section}{eo\-Stat$<$ Eo\-Type, unsigned $>$}{\pageref{classeo_stat}}{}
+\begin{CompactList}
+\item Dag\-Size\-Stat\item Sum\-Size\-Stat\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ const eo\-Pop$<$ Py\-EO $>$ \&, const Py\-EO \& $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Select\-One$<$ Py\-EO $>$}{\pageref{classeo_select_one}}{}
+\begin{CompactList}
+\item eo\-Select\-One\-Wrapper\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ const eo\-Pop$<$ Py\-EO $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Perf2Worth$<$ Py\-EO $>$}{\pageref{classeo_perf2_worth}}{}
+\item \contentsline{section}{eo\-Perf2Worth$<$ Py\-EO, double $>$}{\pageref{classeo_perf2_worth}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Perf2Worth\-Cached$<$ Py\-EO, double $>$}{\pageref{classeo_perf2_worth_cached}}{}
+\begin{CompactList}
+\item Cached\-Perf2Worth\-Wrapper\end{CompactList}
+\item Perf2Worth\-Wrapper\end{CompactList}
+\item \contentsline{section}{eo\-Stat\-Base$<$ Py\-EO $>$}{\pageref{classeo_stat_base}}{}
+\begin{CompactList}
+\item Stat\-Base\-Wrapper\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ const std::vector$<$ const EOT $\ast$ $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Sorted\-Stat\-Base$<$ EOT $>$}{\pageref{classeo_sorted_stat_base}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Sorted\-Stat$<$ EOT, Param\-Type $>$}{\pageref{classeo_sorted_stat}}{}
+\item \contentsline{section}{eo\-Sorted\-Stat$<$ EOT, EOT::Fitness $>$}{\pageref{classeo_sorted_stat}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Nth\-Element\-Fitness\-Stat$<$ EOT $>$}{\pageref{classeo_nth_element_fitness_stat}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Sorted\-Stat$<$ EOT, std::string $>$}{\pageref{classeo_sorted_stat}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Sorted\-Pop\-Stat$<$ EOT $>$}{\pageref{classeo_sorted_pop_stat}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Sorted\-Stat$<$ EOT, std::vector$<$ double $>$ $>$}{\pageref{classeo_sorted_stat}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Scalar\-Fitness\-Stat$<$ EOT, Fit\-T $>$}{\pageref{classeo_scalar_fitness_stat}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Sorted\-Stat$<$ EOT, std::vector$<$ Fit\-T $>$ $>$}{\pageref{classeo_sorted_stat}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Fitness\-Stat$<$ EOT, Fit\-T $>$}{\pageref{classeo_fitness_stat}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Sorted\-Stat$<$ EOT, std::vector$<$ Part\-Fit\-T $>$ $>$}{\pageref{classeo_sorted_stat}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-MOFitness\-Stat$<$ EOT, Part\-Fit\-T $>$}{\pageref{classeo_m_o_fitness_stat}}{}
+\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ const std::vector$<$ const Eo\-Type $\ast$ $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Sorted\-Stat\-Base$<$ Eo\-Type $>$}{\pageref{classeo_sorted_stat_base}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Sorted\-Stat$<$ Eo\-Type, string $>$}{\pageref{classeo_sorted_stat}}{}
+\begin{CompactList}
+\item eo\-Best\-Individual\-Stat\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ const std::vector$<$ const Py\-EO $\ast$ $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Sorted\-Stat\-Base$<$ Py\-EO $>$}{\pageref{classeo_sorted_stat_base}}{}
+\begin{CompactList}
+\item Sorted\-Stat\-Base\-Wrapper\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ eo\-Distribution$<$ EOT $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-EDA$<$ EOT $>$}{\pageref{classeo_e_d_a}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Simple\-EDA$<$ EOT $>$}{\pageref{classeo_simple_e_d_a}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ eo\-Double \&, bool $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Mon\-Op$<$ eo\-Double $>$}{\pageref{classeo_mon_op}}{}
+\begin{CompactList}
+\item Mutate\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ eo\-Double \&, void $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Eval\-Func$<$ eo\-Double $>$}{\pageref{classeo_eval_func}}{}
+\begin{CompactList}
+\item Eval\end{CompactList}
+\item \contentsline{section}{eo\-Init$<$ eo\-Double $>$}{\pageref{classeo_init}}{}
+\begin{CompactList}
+\item Init\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ eo\-Parse\-Tree$<$ Fitness\-Type, Node $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Eval\-Func$<$ eo\-Parse\-Tree$<$ Fitness\-Type, Node $>$ $>$}{\pageref{classeo_eval_func}}{}
+\begin{CompactList}
+\item Reg\-Fitness\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ eo\-Parse\-Tree$<$ FType, Node $>$ \&, bool $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Mon\-Op$<$ eo\-Parse\-Tree$<$ FType, Node $>$ $>$}{\pageref{classeo_mon_op}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Branch\-Mutation$<$ FType, Node $>$}{\pageref{classeo_branch_mutation}}{}
+\item \contentsline{section}{eo\-Collapse\-Subtree\-Mutation$<$ FType, Node $>$}{\pageref{classeo_collapse_subtree_mutation}}{}
+\item \contentsline{section}{eo\-Expansion\-Mutation$<$ FType, Node $>$}{\pageref{classeo_expansion_mutation}}{}
+\item \contentsline{section}{eo\-Hoist\-Mutation$<$ FType, Node $>$}{\pageref{classeo_hoist_mutation}}{}
+\item \contentsline{section}{eo\-Point\-Mutation$<$ FType, Node $>$}{\pageref{classeo_point_mutation}}{}
+\item \contentsline{section}{eo\-St\-Branch\-Mutation$<$ FType, Node $>$}{\pageref{classeo_st_branch_mutation}}{}
+\item \contentsline{section}{eo\-St\-Hoist\-Mutation$<$ FType, Node $>$}{\pageref{classeo_st_hoist_mutation}}{}
+\item \contentsline{section}{eo\-St\-Point\-Mutation$<$ FType, Node $>$}{\pageref{classeo_st_point_mutation}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ eo\-Parse\-Tree$<$ FType, Node $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Eval\-Func$<$ eo\-Parse\-Tree$<$ FType, Node $>$ $>$}{\pageref{classeo_eval_func}}{}
+\begin{CompactList}
+\item RMS\end{CompactList}
+\item \contentsline{section}{eo\-Init$<$ eo\-Parse\-Tree$<$ FType, Node $>$ $>$}{\pageref{classeo_init}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Parse\-Tree\-Depth\-Init$<$ FType, Node $>$}{\pageref{classeo_parse_tree_depth_init}}{}
+\item \contentsline{section}{eo\-St\-Parse\-Tree\-Depth\-Init$<$ FType, Node $>$}{\pageref{classeo_st_parse_tree_depth_init}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ eo\-Pop$<$ EOT $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Algo$<$ EOT $>$}{\pageref{classeo_algo}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Cellular\-Easy\-EA$<$ EOT $>$}{\pageref{classeo_cellular_easy_e_a}}{}
+\item \contentsline{section}{eo\-Easy\-EA$<$ EOT $>$}{\pageref{classeo_easy_e_a}}{}
+\item \contentsline{section}{eo\-SGA$<$ EOT $>$}{\pageref{classeo_s_g_a}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Pop\-Algo$<$ EOT $>$}{\pageref{classeo_pop_algo}}{}
+\item \contentsline{section}{eo\-Transform$<$ EOT $>$}{\pageref{classeo_transform}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Dyn\-SGATransform$<$ EOT $>$}{\pageref{classeo_dyn_s_g_a_transform}}{}
+\item eo\-Easy\-EA::eo\-Dummy\-Transform\item \contentsline{section}{eo\-SGATransform$<$ EOT $>$}{\pageref{classeo_s_g_a_transform}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ eo\-Populator$<$ EOT $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Gen\-Op$<$ EOT $>$}{\pageref{classeo_gen_op}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Bin\-Gen\-Op$<$ EOT $>$}{\pageref{classeo_bin_gen_op}}{}
+\item \contentsline{section}{eo\-Es\-Global\-Xover$<$ EOT $>$}{\pageref{classeo_es_global_xover}}{}
+\item \contentsline{section}{eo\-Mon\-Gen\-Op$<$ EOT $>$}{\pageref{classeo_mon_gen_op}}{}
+\item \contentsline{section}{eo\-Op\-Container$<$ EOT $>$}{\pageref{classeo_op_container}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Proportional\-Op$<$ EOT $>$}{\pageref{classeo_proportional_op}}{}
+\item \contentsline{section}{eo\-Sequential\-Op$<$ EOT $>$}{\pageref{classeo_sequential_op}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Prop\-GAGen\-Op$<$ EOT $>$}{\pageref{classeo_prop_g_a_gen_op}}{}
+\item \contentsline{section}{eo\-Quad\-Gen\-Op$<$ EOT $>$}{\pageref{classeo_quad_gen_op}}{}
+\item \contentsline{section}{eo\-Sel\-Bin\-Gen\-Op$<$ EOT $>$}{\pageref{classeo_sel_bin_gen_op}}{}
+\item \contentsline{section}{eo\-SGAGen\-Op$<$ EOT $>$}{\pageref{classeo_s_g_a_gen_op}}{}
+\item one2three\-Op\item three2three\-Op\item two2one\-Op\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ eo\-Populator$<$ Py\-EO $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Gen\-Op$<$ Py\-EO $>$}{\pageref{classeo_gen_op}}{}
+\begin{CompactList}
+\item Gen\-Op\-Wrapper\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ EOT \&, bool $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Mon\-Op$<$ EOT $>$}{\pageref{classeo_mon_op}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Det\-Uniform\-Mutation$<$ EOT $>$}{\pageref{classeo_det_uniform_mutation}}{}
+\item \contentsline{section}{eo\-Es\-Mutate$<$ EOT $>$}{\pageref{classeo_es_mutate}}{}
+\item \contentsline{section}{eo\-Fl\-Or\-All\-Mutation$<$ EOT $>$}{\pageref{classeo_fl_or_all_mutation}}{}
+\item \contentsline{section}{eo\-Fl\-Or\-KMutation$<$ EOT $>$}{\pageref{classeo_fl_or_k_mutation}}{}
+\item \contentsline{section}{eo\-Init\-Adaptor$<$ EOT $>$}{\pageref{classeo_init_adaptor}}{}
+\item \contentsline{section}{eo\-Invalidate\-Mon\-Op$<$ EOT $>$}{\pageref{classeo_invalidate_mon_op}}{}
+\item \contentsline{section}{eo\-Mon\-Clone\-Op$<$ EOT $>$}{\pageref{classeo_mon_clone_op}}{}
+\item \contentsline{section}{eo\-Normal\-Mutation$<$ EOT $>$}{\pageref{classeo_normal_mutation}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-One\-Fifth\-Mutation$<$ EOT $>$}{\pageref{classeo_one_fifth_mutation}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Normal\-Vec\-Mutation$<$ EOT $>$}{\pageref{classeo_normal_vec_mutation}}{}
+\item \contentsline{section}{eo\-Prop\-Combined\-Mon\-Op$<$ EOT $>$}{\pageref{classeo_prop_combined_mon_op}}{}
+\item \contentsline{section}{eo\-Uniform\-Mutation$<$ EOT $>$}{\pageref{classeo_uniform_mutation}}{}
+\item \contentsline{section}{eo\-Vl\-Add\-Mutation$<$ EOT $>$}{\pageref{classeo_vl_add_mutation}}{}
+\item \contentsline{section}{eo\-Vl\-Del\-Mutation$<$ EOT $>$}{\pageref{classeo_vl_del_mutation}}{}
+\item monop\item Mutate\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ EOT \&, unsigned int $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Gene\-Del\-Chooser$<$ EOT $>$}{\pageref{classeo_gene_del_chooser}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Uniform\-Gene\-Chooser$<$ EOT $>$}{\pageref{classeo_uniform_gene_chooser}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ EOT \&, void $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Eval\-Func$<$ EOT $>$}{\pageref{classeo_eval_func}}{}
+\begin{CompactList}
+\item eo\-Assembled\-Eval\-Func\item eo\-Easy\-EA::eo\-Dummy\-Eval\item \contentsline{section}{eo\-Eval\-Func\-Counter$<$ EOT $>$}{\pageref{classeo_eval_func_counter}}{}
+\item \contentsline{section}{eo\-Eval\-Func\-Ptr$<$ EOT, Fit\-T, Function\-Arg $>$}{\pageref{structeo_eval_func_ptr}}{}
+\item eo\-My\-Eval\item \contentsline{section}{eo\-One\-Max\-Eval\-Func$<$ EOT $>$}{\pageref{classeo_one_max_eval_func}}{}
+\item Royal\-Road\end{CompactList}
+\item \contentsline{section}{eo\-Init$<$ EOT $>$}{\pageref{classeo_init}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Combined\-Init$<$ EOT $>$}{\pageref{classeo_combined_init}}{}
+\item \contentsline{section}{eo\-Distribution$<$ EOT $>$}{\pageref{classeo_distribution}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-PBILDistrib$<$ EOT $>$}{\pageref{classeo_p_b_i_l_distrib}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Init\-Fixed\-Length$<$ EOT $>$}{\pageref{classeo_init_fixed_length}}{}
+\item \contentsline{section}{eo\-Init\-Variable\-Length$<$ EOT $>$}{\pageref{classeo_init_variable_length}}{}
+\item \contentsline{section}{eo\-Real\-Init\-Bounded$<$ EOT $>$}{\pageref{classeo_real_init_bounded}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Es\-Chrom\-Init$<$ EOT $>$}{\pageref{classeo_es_chrom_init}}{}
+\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ Eo\-Type \&, bool $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Mon\-Op$<$ Eo\-Type $>$}{\pageref{classeo_mon_op}}{}
+\begin{CompactList}
+\item eo\-Sym\-Constant\-Mutate\item eo\-Sym\-Lambda\-Mutate\item eo\-Sym\-Node\-Mutate\item eo\-Sym\-Subtree\-Mutate\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ EOType \&, bool $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Mon\-Op$<$ EOType $>$}{\pageref{classeo_mon_op}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ Eo\-Type \&, void $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Init$<$ Eo\-Type $>$}{\pageref{classeo_init}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Sym\-Init$<$ Eo\-Type $>$}{\pageref{classeo_sym_init}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ eo\-Vector$<$ Fit\-T, double $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Init$<$ eo\-Vector$<$ Fit\-T, double $>$ $>$}{\pageref{classeo_init}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-CMAInit$<$ Fit\-T $>$}{\pageref{classeo_c_m_a_init}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ eo\-Virus$<$ Fit\-T $>$ \&, bool $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Mon\-Op$<$ eo\-Virus$<$ Fit\-T $>$ $>$}{\pageref{classeo_mon_op}}{}
+\begin{CompactList}
+\item \contentsline{section}{Virus\-Bit\-Flip$<$ Fit\-T $>$}{\pageref{class_virus_bit_flip}}{}
+\item Virus\-Mutation\item \contentsline{section}{Virus\-Shift\-Mutation$<$ Fit\-T $>$}{\pageref{class_virus_shift_mutation}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ eo\-Virus$<$ Fit\-T $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Init$<$ eo\-Virus$<$ Fit\-T $>$ $>$}{\pageref{classeo_init}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Init\-Virus$<$ Fit\-T $>$}{\pageref{classeo_init_virus}}{}
+\item \contentsline{section}{eo\-Init\-Virus1bit$<$ Fit\-T $>$}{\pageref{classeo_init_virus1bit}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ External\-EO \&, bool $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Mon\-Op$<$ External\-EO $>$}{\pageref{classeo_mon_op}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-External\-Mon\-Op$<$ F, External, External\-EO $>$}{\pageref{classeo_external_mon_op}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ External\-EO \&, void $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Eval\-Func$<$ External\-EO $>$}{\pageref{classeo_eval_func}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-External\-Eval\-Func$<$ F, External, External\-EO $>$}{\pageref{classeo_external_eval_func}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Init$<$ External\-EO $>$}{\pageref{classeo_init}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-External\-Init$<$ F, External, External\-EO $>$}{\pageref{classeo_external_init}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ Genotype\-T \&, bool $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Mon\-Op$<$ Genotype\-T $>$}{\pageref{classeo_mon_op}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-One\-Max\-Mutation$<$ Genotype\-T $>$}{\pageref{classeo_one_max_mutation}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ Genotype\-T \&, void $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Init$<$ Genotype\-T $>$}{\pageref{classeo_init}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-One\-Max\-Init$<$ Genotype\-T $>$}{\pageref{classeo_one_max_init}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ int \&, void $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Init$<$ int $>$}{\pageref{classeo_init}}{}
+\begin{CompactList}
+\item Tester\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ Py\-EO \&, bool $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Mon\-Op$<$ Py\-EO $>$}{\pageref{classeo_mon_op}}{}
+\begin{CompactList}
+\item Mon\-Op\-Wrapper\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-UF$<$ T \&, void $>$}{\pageref{classeo_u_f}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Init$<$ T $>$}{\pageref{classeo_init}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Neg\-Exp\-Init$<$ T $>$}{\pageref{classeo_neg_exp_init}}{}
+\item \contentsline{section}{eo\-Normal\-Init$<$ T $>$}{\pageref{classeo_normal_init}}{}
+\item \contentsline{section}{eo\-Uniform\-Init$<$ T $>$}{\pageref{classeo_uniform_init}}{}
+\end{CompactList}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-Functor\-Base::binary\_\-function\_\-tag}{\pageref{structeo_functor_base_1_1binary__function__tag}}{}
+\item \contentsline{section}{eo\-Functor\-Base::procedure\_\-tag}{\pageref{structeo_functor_base_1_1procedure__tag}}{}
+\item \contentsline{section}{eo\-Functor\-Base::unary\_\-function\_\-tag}{\pageref{structeo_functor_base_1_1unary__function__tag}}{}
+\item \contentsline{section}{eo\-Functor\-Store}{\pageref{classeo_functor_store}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-State}{\pageref{classeo_state}}{}
+\end{CompactList}
+\item Fun\-Def\item \contentsline{section}{eo\-Gnuplot}{\pageref{classeo_gnuplot}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Gnuplot1DMonitor}{\pageref{classeo_gnuplot1_d_monitor}}{}
+\item \contentsline{section}{eo\-Gnuplot1DSnapshot}{\pageref{classeo_gnuplot1_d_snapshot}}{}
+\end{CompactList}
+\item Hash\-Double\item Hash\-Sym\item index\_\-error\item interval\_\-error\item Interval\-Bounds\-Check\item Interval\-Bounds\-Check\-Impl\item Inv\item Is\-Neg\item Lambda\item Language\-Impl\item Language\-Table\item mlp::layer\item qp::layer\item Linear\-Scaling\item lower\_\-triangular\_\-matrix\item maximization\item Mean\item \contentsline{section}{Mem\-Pool}{\pageref{class_mem_pool}}{}
+\item \contentsline{section}{gp\_\-parse\_\-tree::Mem\-Pool}{\pageref{classgp__parse__tree_1_1_mem_pool}}{}
+\item Mem\-Pool::Chunk\item gp\_\-parse\_\-tree::Mem\-Pool::Chunk\item Mem\-Pool::Link\item gp\_\-parse\_\-tree::Mem\-Pool::Link\item Min\item minimization\item Multi\-Function\item Multi\-Function\-Impl\item My\-Node\-Stats\item eo\-NDPlus\-Replacement$<$ EOT, Worth\-T $>$::Worth\-Pair\item eo\-NDSorting$<$ EOT $>$::Sorter\item eo\-NDSorting\_\-II$<$ EOT $>$::compare\_\-nodes\item \contentsline{section}{negexp\_\-generator$<$ T $>$}{\pageref{classnegexp__generator}}{}
+\item mlp::net\item l2::net\item mse::net\item qp::net\item qp::neuron\item mlp::neuron\item No\-Bounds\-Check\item Node\item Node\_\-alloc$<$ T $>$\item gp\_\-parse\_\-tree::Node\_\-alloc$<$ T $>$\item \contentsline{section}{Node\-Selector}{\pageref{class_node_selector}}{}
+\begin{CompactList}
+\item \contentsline{section}{Biased\-Node\-Selector}{\pageref{class_biased_node_selector}}{}
+\item \contentsline{section}{Random\-Node\-Selector}{\pageref{class_random_node_selector}}{}
+\end{CompactList}
+\item Node\-Selector::Node\-Selection\item \contentsline{section}{normal\_\-generator$<$ T $>$}{\pageref{classnormal__generator}}{}
+\item No\-Scaling\item eo\-Nth\-Element\-Fitness\-Stat$<$ EOT $>$::Cmp\-Fitness\item \contentsline{section}{eo\-Object}{\pageref{classeo_object}}{}
+\begin{CompactList}
+\item \contentsline{section}{EO$<$ F $>$}{\pageref{class_e_o}}{}
+\item \contentsline{section}{EO$<$ double $>$}{\pageref{class_e_o}}{}
+\begin{CompactList}
+\item \contentsline{section}{Dummy}{\pageref{struct_dummy}}{}
+\item \contentsline{section}{Dummy}{\pageref{struct_dummy}}{}
+\item \contentsline{section}{Dummy}{\pageref{struct_dummy}}{}
+\item \contentsline{section}{Dummy}{\pageref{struct_dummy}}{}
+\item \contentsline{section}{Dummy}{\pageref{struct_dummy}}{}
+\item \contentsline{section}{Dummy}{\pageref{struct_dummy}}{}
+\item Test\-EO\end{CompactList}
+\item \contentsline{section}{EO$<$ EOT::Fitness $>$}{\pageref{class_e_o}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-NDSorting$<$ EOT $>$::Dummy\-EO}{\pageref{classeo_n_d_sorting_1_1_dummy_e_o}}{}
+\end{CompactList}
+\item \contentsline{section}{EO$<$ Fit $>$}{\pageref{class_e_o}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-External\-EO$<$ Fit, External $>$}{\pageref{classeo_external_e_o}}{}
+\item \contentsline{section}{eo\-Vector$<$ Fit, double $>$}{\pageref{classeo_vector}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Es\-Full$<$ Fit $>$}{\pageref{classeo_es_full}}{}
+\item \contentsline{section}{eo\-Es\-Simple$<$ Fit $>$}{\pageref{classeo_es_simple}}{}
+\item \contentsline{section}{eo\-Es\-Stdev$<$ Fit $>$}{\pageref{classeo_es_stdev}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{EO$<$ Fitness $>$}{\pageref{class_e_o}}{}
+\begin{CompactList}
+\item Eo\-Sym\end{CompactList}
+\item \contentsline{section}{EO$<$ fitness\_\-type $>$}{\pageref{class_e_o}}{}
+\begin{CompactList}
+\item eo\-Double\end{CompactList}
+\item \contentsline{section}{EO$<$ fitness\-T $>$}{\pageref{class_e_o}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-String$<$ fitness\-T $>$}{\pageref{classeo_string}}{}
+\end{CompactList}
+\item \contentsline{section}{EO$<$ Fit\-T $>$}{\pageref{class_e_o}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-One\-Max$<$ Fit\-T $>$}{\pageref{classeo_one_max}}{}
+\item \contentsline{section}{eo\-Vector$<$ Fit\-T, Gene\-Type $>$}{\pageref{classeo_vector}}{}
+\item \contentsline{section}{eo\-Vector$<$ Fit\-T, bool $>$}{\pageref{classeo_vector}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Bit$<$ Fit\-T $>$}{\pageref{classeo_bit}}{}
+\begin{CompactList}
+\item eo\-Virus\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{eo\-Vector$<$ Fit\-T, double $>$}{\pageref{classeo_vector}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Real$<$ Fit\-T $>$}{\pageref{classeo_real}}{}
+\end{CompactList}
+\end{CompactList}
+\item \contentsline{section}{EO$<$ FType $>$}{\pageref{class_e_o}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Parse\-Tree$<$ FType, Node $>$}{\pageref{classeo_parse_tree}}{}
+\end{CompactList}
+\item \contentsline{section}{EO$<$ phenotype $>$}{\pageref{class_e_o}}{}
+\begin{CompactList}
+\item Chrom\end{CompactList}
+\item \contentsline{section}{EO$<$ Py\-Fitness $>$}{\pageref{class_e_o}}{}
+\begin{CompactList}
+\item Py\-EO\end{CompactList}
+\item \contentsline{section}{eo\-Distribution$<$ EOT $>$}{\pageref{classeo_distribution}}{}
+\item \contentsline{section}{eo\-Factory$<$ EOClass $>$}{\pageref{classeo_factory}}{}
+\item \contentsline{section}{eo\-Factory$<$ eo\-Op\-Selector$<$ eo\-Class $>$ $>$}{\pageref{classeo_factory}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Op\-Sel\-Mason$<$ eo\-Class $>$}{\pageref{classeo_op_sel_mason}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Factory$<$ eo\-Select$<$ EOT $>$ $>$}{\pageref{classeo_factory}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Select\-Factory$<$ EOT $>$}{\pageref{classeo_select_factory}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Factory$<$ EOT $>$}{\pageref{classeo_factory}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Bit\-Op\-Factory$<$ EOT $>$}{\pageref{classeo_bit_op_factory}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Parser}{\pageref{classeo_parser}}{}
+\item \contentsline{section}{eo\-Pop$<$ EOT $>$}{\pageref{classeo_pop}}{}
+\item \contentsline{section}{eo\-Pop$<$ Dummy $>$}{\pageref{classeo_pop}}{}
+\begin{CompactList}
+\item eo\-Dummy\-Pop\item eo\-Dummy\-Pop\item eo\-Dummy\-Pop\item eo\-Dummy\-Pop\end{CompactList}
+\item \contentsline{section}{eo\-Pop$<$ Py\-EO $>$}{\pageref{classeo_pop}}{}
+\item \contentsline{section}{eo\-Rng}{\pageref{classeo_rng}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Op$<$ EOType $>$}{\pageref{classeo_op}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Bin\-Op$<$ EOType $>$}{\pageref{classeo_bin_op}}{}
+\item \contentsline{section}{eo\-Mon\-Op$<$ EOType $>$}{\pageref{classeo_mon_op}}{}
+\item \contentsline{section}{eo\-Quad\-Op$<$ EOType $>$}{\pageref{classeo_quad_op}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Op$<$ bool $>$}{\pageref{classeo_op}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Mon\-Op$<$ bool $>$}{\pageref{classeo_mon_op}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Op$<$ Chrom $>$}{\pageref{classeo_op}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Mon\-Op$<$ Chrom $>$}{\pageref{classeo_mon_op}}{}
+\item \contentsline{section}{eo\-Quad\-Op$<$ Chrom $>$}{\pageref{classeo_quad_op}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Op$<$ double $>$}{\pageref{classeo_op}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Bin\-Op$<$ double $>$}{\pageref{classeo_bin_op}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Op$<$ eo\-Double $>$}{\pageref{classeo_op}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Mon\-Op$<$ eo\-Double $>$}{\pageref{classeo_mon_op}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Op$<$ eo\-Parse\-Tree$<$ FType, Node $>$ $>$}{\pageref{classeo_op}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Mon\-Op$<$ eo\-Parse\-Tree$<$ FType, Node $>$ $>$}{\pageref{classeo_mon_op}}{}
+\item \contentsline{section}{eo\-Quad\-Op$<$ eo\-Parse\-Tree$<$ FType, Node $>$ $>$}{\pageref{classeo_quad_op}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Op$<$ EOT $>$}{\pageref{classeo_op}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Bin\-Op$<$ EOT $>$}{\pageref{classeo_bin_op}}{}
+\item \contentsline{section}{eo\-Gen\-Op$<$ EOT $>$}{\pageref{classeo_gen_op}}{}
+\item \contentsline{section}{eo\-Mon\-Op$<$ EOT $>$}{\pageref{classeo_mon_op}}{}
+\item \contentsline{section}{eo\-Quad\-Op$<$ EOT $>$}{\pageref{classeo_quad_op}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Op$<$ Eo\-Type $>$}{\pageref{classeo_op}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Bin\-Op$<$ Eo\-Type $>$}{\pageref{classeo_bin_op}}{}
+\item \contentsline{section}{eo\-Mon\-Op$<$ Eo\-Type $>$}{\pageref{classeo_mon_op}}{}
+\item \contentsline{section}{eo\-Quad\-Op$<$ Eo\-Type $>$}{\pageref{classeo_quad_op}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Op$<$ eo\-Virus$<$ Fit\-T $>$ $>$}{\pageref{classeo_op}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Bin\-Op$<$ eo\-Virus$<$ Fit\-T $>$ $>$}{\pageref{classeo_bin_op}}{}
+\item \contentsline{section}{eo\-Mon\-Op$<$ eo\-Virus$<$ Fit\-T $>$ $>$}{\pageref{classeo_mon_op}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Op$<$ External\-EO $>$}{\pageref{classeo_op}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Bin\-Op$<$ External\-EO $>$}{\pageref{classeo_bin_op}}{}
+\item \contentsline{section}{eo\-Mon\-Op$<$ External\-EO $>$}{\pageref{classeo_mon_op}}{}
+\item \contentsline{section}{eo\-Quad\-Op$<$ External\-EO $>$}{\pageref{classeo_quad_op}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Op$<$ Genotype\-T $>$}{\pageref{classeo_op}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Mon\-Op$<$ Genotype\-T $>$}{\pageref{classeo_mon_op}}{}
+\item \contentsline{section}{eo\-Quad\-Op$<$ Genotype\-T $>$}{\pageref{classeo_quad_op}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Op$<$ Py\-EO $>$}{\pageref{classeo_op}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Bin\-Op$<$ Py\-EO $>$}{\pageref{classeo_bin_op}}{}
+\item \contentsline{section}{eo\-Gen\-Op$<$ Py\-EO $>$}{\pageref{classeo_gen_op}}{}
+\item \contentsline{section}{eo\-Mon\-Op$<$ Py\-EO $>$}{\pageref{classeo_mon_op}}{}
+\item \contentsline{section}{eo\-Quad\-Op$<$ Py\-EO $>$}{\pageref{classeo_quad_op}}{}
+\end{CompactList}
+\item Operation\item \contentsline{section}{eo\-Param}{\pageref{classeo_param}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Value\-Param$<$ Value\-Type $>$}{\pageref{classeo_value_param}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Perf2Worth$<$ EOT, EOT::Fitness $>$}{\pageref{classeo_perf2_worth}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Value\-Param$<$ double $>$}{\pageref{classeo_value_param}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Stat$<$ EOT, double $>$}{\pageref{classeo_stat}}{}
+\item \contentsline{section}{eo\-Stat$<$ Eo\-Type, double $>$}{\pageref{classeo_stat}}{}
+\item \contentsline{section}{eo\-Time\-Counter}{\pageref{classeo_time_counter}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Value\-Param$<$ EOT::Fitness $>$}{\pageref{classeo_value_param}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Sorted\-Stat$<$ EOT, EOT::Fitness $>$}{\pageref{classeo_sorted_stat}}{}
+\item \contentsline{section}{eo\-Stat$<$ EOT, EOT::Fitness $>$}{\pageref{classeo_stat}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Value\-Param$<$ Param\-Type $>$}{\pageref{classeo_value_param}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Sorted\-Stat$<$ EOT, Param\-Type $>$}{\pageref{classeo_sorted_stat}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Value\-Param$<$ std::pair$<$ double, double $>$ $>$}{\pageref{classeo_value_param}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Stat$<$ EOT, std::pair$<$ double, double $>$ $>$}{\pageref{classeo_stat}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Value\-Param$<$ std::string $>$}{\pageref{classeo_value_param}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Sorted\-Stat$<$ EOT, std::string $>$}{\pageref{classeo_sorted_stat}}{}
+\item \contentsline{section}{eo\-Stat$<$ EOT, std::string $>$}{\pageref{classeo_stat}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Value\-Param$<$ std::vector$<$ double $>$ $>$}{\pageref{classeo_value_param}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-PBILDistrib$<$ EOT $>$}{\pageref{classeo_p_b_i_l_distrib}}{}
+\item \contentsline{section}{eo\-Perf2Worth$<$ Dummy $>$}{\pageref{classeo_perf2_worth}}{}
+\item \contentsline{section}{eo\-Perf2Worth$<$ EOT $>$}{\pageref{classeo_perf2_worth}}{}
+\item \contentsline{section}{eo\-Perf2Worth$<$ EOT, double $>$}{\pageref{classeo_perf2_worth}}{}
+\item \contentsline{section}{eo\-Perf2Worth$<$ Py\-EO $>$}{\pageref{classeo_perf2_worth}}{}
+\item \contentsline{section}{eo\-Perf2Worth$<$ Py\-EO, double $>$}{\pageref{classeo_perf2_worth}}{}
+\item \contentsline{section}{eo\-Sorted\-Stat$<$ EOT, std::vector$<$ double $>$ $>$}{\pageref{classeo_sorted_stat}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Value\-Param$<$ std::vector$<$ Fit\-T $>$ $>$}{\pageref{classeo_value_param}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Sorted\-Stat$<$ EOT, std::vector$<$ Fit\-T $>$ $>$}{\pageref{classeo_sorted_stat}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Value\-Param$<$ std::vector$<$ Part\-Fit\-T $>$ $>$}{\pageref{classeo_value_param}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Sorted\-Stat$<$ EOT, std::vector$<$ Part\-Fit\-T $>$ $>$}{\pageref{classeo_sorted_stat}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Value\-Param$<$ std::vector$<$ Worth\-T $>$ $>$}{\pageref{classeo_value_param}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Perf2Worth$<$ EOT, Worth\-T $>$}{\pageref{classeo_perf2_worth}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Value\-Param$<$ string $>$}{\pageref{classeo_value_param}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Sorted\-Stat$<$ Eo\-Type, string $>$}{\pageref{classeo_sorted_stat}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Value\-Param$<$ T $>$}{\pageref{classeo_value_param}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Incrementor\-Param$<$ T $>$}{\pageref{classeo_incrementor_param}}{}
+\item \contentsline{section}{eo\-Stat$<$ EOT, T $>$}{\pageref{classeo_stat}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Value\-Param$<$ unsigned $>$}{\pageref{classeo_value_param}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Gen\-Continue$<$ EOT $>$}{\pageref{classeo_gen_continue}}{}
+\item \contentsline{section}{eo\-Stat$<$ Eo\-Type, unsigned $>$}{\pageref{classeo_stat}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Value\-Param$<$ unsigned long $>$}{\pageref{classeo_value_param}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Binary\-Functor\-Counter$<$ Binary\-Functor $>$}{\pageref{classeo_binary_functor_counter}}{}
+\item \contentsline{section}{eo\-Eval\-Func\-Counter$<$ EOT $>$}{\pageref{classeo_eval_func_counter}}{}
+\item \contentsline{section}{eo\-Procedure\-Counter$<$ Procedure $>$}{\pageref{classeo_procedure_counter}}{}
+\item \contentsline{section}{eo\-Unary\-Functor\-Counter$<$ Unary\-Functor $>$}{\pageref{classeo_unary_functor_counter}}{}
+\end{CompactList}
+\item Param\-Wrapper\item Value\-Param\end{CompactList}
+\item \contentsline{section}{eo\-Parameter\-Loader}{\pageref{classeo_parameter_loader}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Parser}{\pageref{classeo_parser}}{}
+\end{CompactList}
+\item Parameters\item \contentsline{section}{eo\-Param\-Param\-Type}{\pageref{classeo_param_param_type}}{}
+\item \contentsline{section}{eo\-Pareto\-Fitness$<$ Fitness\-Traits $>$}{\pageref{classeo_pareto_fitness}}{}
+\item \contentsline{section}{eo\-Pareto\-Fitness\-Traits}{\pageref{classeo_pareto_fitness_traits}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Variable\-Pareto\-Traits}{\pageref{classeo_variable_pareto_traits}}{}
+\item Minimizing\-Fitness\-Traits\item Minimizing\-Fitness\-Traits\item \contentsline{section}{Minimizing\-Traits}{\pageref{class_minimizing_traits}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Pareto\-One\-Constraint\-Fitness$<$ Fitness\-Traits $>$}{\pageref{classeo_pareto_one_constraint_fitness}}{}
+\item gp\_\-parse\_\-tree::parse\_\-tree$<$ T $>$\item gp\_\-parse\_\-tree::parse\_\-tree$<$ T $>$::base\_\-const\_\-iterator\item gp\_\-parse\_\-tree::parse\_\-tree$<$ T $>$::base\_\-iterator\item gp\_\-parse\_\-tree::parse\_\-tree$<$ T $>$::const\_\-iterator\item gp\_\-parse\_\-tree::parse\_\-tree$<$ T $>$::embedded\_\-const\_\-iterator\item gp\_\-parse\_\-tree::parse\_\-tree$<$ T $>$::embedded\_\-iterator\item gp\_\-parse\_\-tree::parse\_\-tree$<$ T $>$::iterator\item gp\_\-parse\_\-tree::parse\_\-tree$<$ T $>$::subtree\item eo\-Parse\-Tree\-Depth\-Init$<$ FType, Node $>$::lt\_\-arity\item \contentsline{section}{eo\-Perf2Worth$<$ EOT, Worth\-T $>$::compare\_\-worth}{\pageref{classeo_perf2_worth_1_1compare__worth}}{}
+\item \contentsline{section}{eo\-Perf2Worth\-Cached$<$ EOT, Worth\-T $>$::compare\_\-worth}{\pageref{classeo_perf2_worth_cached_1_1compare__worth}}{}
+\item phenotype\item Pipe\-Communication\item \contentsline{section}{eo\-Pop$<$ EOT $>$::Cmp}{\pageref{structeo_pop_1_1_cmp}}{}
+\item eo\-Pop$<$ EOT $>$::Get\-Fitness\item \contentsline{section}{eo\-Pop$<$ EOT $>$::Ref}{\pageref{structeo_pop_1_1_ref}}{}
+\item \contentsline{section}{eo\-Populator$<$ EOT $>$}{\pageref{classeo_populator}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Selective\-Populator$<$ EOT $>$}{\pageref{classeo_selective_populator}}{}
+\item \contentsline{section}{eo\-Seq\-Populator$<$ EOT $>$}{\pageref{classeo_seq_populator}}{}
+\end{CompactList}
+\item eo\-Populator$<$ EOT $>$::Out\-Of\-Individuals\item \contentsline{section}{eo\-Populator$<$ Py\-EO $>$}{\pageref{classeo_populator}}{}
+\begin{CompactList}
+\item Populator\-Wrapper\end{CompactList}
+\item Power\item \contentsline{section}{eo\-Printable}{\pageref{classeo_printable}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Persistent}{\pageref{classeo_persistent}}{}
+\begin{CompactList}
+\item \contentsline{section}{EO$<$ F $>$}{\pageref{class_e_o}}{}
+\item \contentsline{section}{EO$<$ double $>$}{\pageref{class_e_o}}{}
+\item \contentsline{section}{EO$<$ EOT::Fitness $>$}{\pageref{class_e_o}}{}
+\item \contentsline{section}{EO$<$ Fit $>$}{\pageref{class_e_o}}{}
+\item \contentsline{section}{EO$<$ Fitness $>$}{\pageref{class_e_o}}{}
+\item \contentsline{section}{EO$<$ fitness\_\-type $>$}{\pageref{class_e_o}}{}
+\item \contentsline{section}{EO$<$ fitness\-T $>$}{\pageref{class_e_o}}{}
+\item \contentsline{section}{EO$<$ Fit\-T $>$}{\pageref{class_e_o}}{}
+\item \contentsline{section}{EO$<$ FType $>$}{\pageref{class_e_o}}{}
+\item \contentsline{section}{EO$<$ phenotype $>$}{\pageref{class_e_o}}{}
+\item \contentsline{section}{EO$<$ Py\-Fitness $>$}{\pageref{class_e_o}}{}
+\item \contentsline{section}{eo\-Continue$<$ EOT $>$}{\pageref{classeo_continue}}{}
+\item \contentsline{section}{eo\-Distribution$<$ EOT $>$}{\pageref{classeo_distribution}}{}
+\item \contentsline{section}{eo\-How\-Many}{\pageref{classeo_how_many}}{}
+\item \contentsline{section}{eo\-Int\-Bounds}{\pageref{classeo_int_bounds}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-General\-Int\-Bounds}{\pageref{classeo_general_int_bounds}}{}
+\item \contentsline{section}{eo\-Int\-Above\-Bound}{\pageref{classeo_int_above_bound}}{}
+\item \contentsline{section}{eo\-Int\-Below\-Bound}{\pageref{classeo_int_below_bound}}{}
+\item \contentsline{section}{eo\-Int\-Interval}{\pageref{classeo_int_interval}}{}
+\item \contentsline{section}{eo\-Int\-No\-Bounds}{\pageref{classeo_int_no_bounds}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Parser}{\pageref{classeo_parser}}{}
+\item \contentsline{section}{eo\-Pop$<$ EOT $>$}{\pageref{classeo_pop}}{}
+\item \contentsline{section}{eo\-Pop$<$ Dummy $>$}{\pageref{classeo_pop}}{}
+\item \contentsline{section}{eo\-Pop$<$ Py\-EO $>$}{\pageref{classeo_pop}}{}
+\item \contentsline{section}{eo\-Real\-Bounds}{\pageref{classeo_real_bounds}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-General\-Real\-Bounds}{\pageref{classeo_general_real_bounds}}{}
+\item \contentsline{section}{eo\-Real\-Above\-Bound}{\pageref{classeo_real_above_bound}}{}
+\item \contentsline{section}{eo\-Real\-Below\-Bound}{\pageref{classeo_real_below_bound}}{}
+\item \contentsline{section}{eo\-Real\-Interval}{\pageref{classeo_real_interval}}{}
+\item \contentsline{section}{eo\-Real\-No\-Bounds}{\pageref{classeo_real_no_bounds}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Real\-Vector\-Bounds}{\pageref{classeo_real_vector_bounds}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Real\-Vector\-No\-Bounds}{\pageref{classeo_real_vector_no_bounds}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Rng}{\pageref{classeo_rng}}{}
+\end{CompactList}
+\end{CompactList}
+\item eoutils::Proc\-Wrapper$<$ Proc $>$\item Prod\item Py\-EO\_\-pickle\_\-suite\item Py\-Fitness\item py\-Pop\_\-pickle\_\-suite\item \contentsline{section}{random\_\-generator$<$ T $>$}{\pageref{classrandom__generator}}{}
+\item \contentsline{section}{eo\-Real\-Base\-Vector\-Bounds}{\pageref{classeo_real_base_vector_bounds}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-Real\-Vector\-Bounds}{\pageref{classeo_real_vector_bounds}}{}
+\end{CompactList}
+\item \contentsline{section}{eo\-Real\-Ux\-Over}{\pageref{classeo_real_ux_over}}{}
+\item RNG\_\-pickle\_\-suite\item mlp::sample\item \contentsline{section}{eo\-Scalar\-Fitness$<$ Scalar\-Type, Compare $>$}{\pageref{classeo_scalar_fitness}}{}
+\item \contentsline{section}{eo\-Scalar\-Fitness\-Assembled$<$ Scalar\-Type, Compare, Fitness\-Traits $>$}{\pageref{classeo_scalar_fitness_assembled}}{}
+\item \contentsline{section}{eo\-Scalar\-Fitness\-Assembled\-Traits}{\pageref{classeo_scalar_fitness_assembled_traits}}{}
+\item Scaling\-Base\item eo\-Seq\-Populator$<$ EOT $>$::Out\-Of\-Individuals\item mlp::set\item shared\_\-ptr$<$ T $>$\item Sort\-On\-Targets\item square\_\-matrix\item Standard\_\-alloc$<$ T $>$\item gp\_\-parse\_\-tree::Standard\_\-alloc$<$ T $>$\item Standard\_\-Node\_\-alloc$<$ T $>$\item gp\_\-parse\_\-tree::Standard\_\-Node\_\-alloc$<$ T $>$\item \contentsline{section}{eo\-State::loading\_\-error}{\pageref{structeo_state_1_1loading__error}}{}
+\item \contentsline{section}{eo\-STLBF$<$ A1, A2, R $>$}{\pageref{classeo_s_t_l_b_f}}{}
+\item \contentsline{section}{eo\-STLF$<$ R $>$}{\pageref{classeo_s_t_l_f}}{}
+\item \contentsline{section}{eo\-STLUF$<$ A1, R $>$}{\pageref{classeo_s_t_l_u_f}}{}
+\item Sum\item Sym\item detail::Sym\-Args\item detail::Sym\-Args\-Impl\item detail::Sym\-Key\item detail::Sym\-Key::Hash\item Symreg\-Node\item detail::Sym\-Value\item \contentsline{section}{T\_\-pickle\_\-suite$<$ T $>$}{\pageref{struct_t__pickle__suite}}{}
+\item Target\-Info\item gp\_\-parse\_\-tree::Tree\_\-alloc$<$ T $>$\item Tree\_\-alloc$<$ T $>$\item Tree\-Builder\item \contentsline{section}{UF\_\-random\_\-generator$<$ T $>$}{\pageref{class_u_f__random__generator}}{}
+\item Unary$<$ Func $>$\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ Eo\-Type \&, bool $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ eo\-Distribution$<$ EOT $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ const std::vector$<$ const EOT $\ast$ $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ const eo\-Pop$<$ EOT $>$ \&, const EOT \& $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ EOT \&, bool $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ Genotype\-T \&, void $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ External\-EO \&, bool $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ eo\-Parse\-Tree$<$ FType, Node $>$ \&, bool $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ eo\-Double \&, void $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ Genotype\-T \&, bool $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ const eo\-Pop$<$ Eo\-Type $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ const std::vector$<$ const Py\-EO $\ast$ $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ const eo\-Pop$<$ EOT $>$ \&, bool $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ EOType \&, bool $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ EOT \&, unsigned int $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ const eo\-Pop$<$ Py\-EO $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\item unary\_\-function\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ eo\-Double \&, bool $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ int \&, void $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ eo\-Parse\-Tree$<$ Fitness\-Type, Node $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ Chrom \&, void $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ const std::vector$<$ const Eo\-Type $\ast$ $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ eo\-Pop$<$ EOT $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ bool \&, void $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ T \&, void $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ eo\-Populator$<$ Py\-EO $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ Py\-EO \&, bool $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ eo\-Vector$<$ Fit\-T, double $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ eo\-Populator$<$ EOT $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ External\-EO \&, void $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ Eo\-Type \&, void $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ eo\-Parse\-Tree$<$ FType, Node $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ eo\-Virus$<$ Fit\-T $>$ \&, bool $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ bool \&, bool $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ Chrom \&, bool $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ EOT \&, void $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ const eo\-Pop$<$ EOT $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ const eo\-Pop$<$ Py\-EO $>$ \&, const Py\-EO \& $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item unary\_\-function\begin{CompactList}
+\item \contentsline{section}{eo\-UF$<$ eo\-Virus$<$ Fit\-T $>$ \&, void $>$}{\pageref{classeo_u_f}}{}
+\end{CompactList}
+\item eoutils::Unary\-Wrapper$<$ Unary $>$\item \contentsline{section}{uniform\_\-generator$<$ T $>$}{\pageref{classuniform__generator}}{}
+\item Unique\-Node\-Stats\item \contentsline{section}{eo\-Updatable}{\pageref{classeo_updatable}}{}
+\begin{CompactList}
+\item \contentsline{section}{eo\-One\-Fifth\-Mutation$<$ EOT $>$}{\pageref{classeo_one_fifth_mutation}}{}
+\end{CompactList}
+\item User\-Def\-Struct\item Value\-Param\_\-pickle\_\-suite$<$ T $>$\item Var\item vector\begin{CompactList}
+\item \contentsline{section}{eo\-Vector$<$ Fit\-T, bool $>$}{\pageref{classeo_vector}}{}
+\end{CompactList}
+\item vector\begin{CompactList}
+\item \contentsline{section}{eo\-Pop$<$ Py\-EO $>$}{\pageref{classeo_pop}}{}
+\end{CompactList}
+\item vector\begin{CompactList}
+\item \contentsline{section}{eo\-Vector$<$ Fit\-T, double $>$}{\pageref{classeo_vector}}{}
+\end{CompactList}
+\item vector\begin{CompactList}
+\item \contentsline{section}{eo\-Pop$<$ Dummy $>$}{\pageref{classeo_pop}}{}
+\end{CompactList}
+\item vector\item vector\begin{CompactList}
+\item \contentsline{section}{eo\-Vector$<$ Fit, double $>$}{\pageref{classeo_vector}}{}
+\end{CompactList}
+\item vector\begin{CompactList}
+\item \contentsline{section}{eo\-Pop$<$ Py\-EO $>$}{\pageref{classeo_pop}}{}
+\end{CompactList}
+\item vector\begin{CompactList}
+\item \contentsline{section}{eo\-Pop$<$ Dummy $>$}{\pageref{classeo_pop}}{}
+\end{CompactList}
+\item weak\_\-ptr$<$ T $>$\end{CompactList}
diff --git a/trunk/paradiseo-eo/doc/latex/main.tex b/trunk/paradiseo-eo/doc/latex/main.tex
new file mode 100644
index 000000000..9e404455d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/main.tex
@@ -0,0 +1,5 @@
+\section{Introduction}\label{main_intro}
+{\bf EO}{\rm (p.\,\pageref{class_e_o})} is a templates-based, ANSI-C++ compliant evolutionary computation library. It contains classes for almost any kind of evolutionary computation you might come up to - at least for the ones we could think of. It is component-based, so that if you don't find the class you need in it, it is very easy to subclass existing abstract or concrete classes.\section{Tutorial}\label{main_tutorial}
+The best place to learn about the features and approaches of {\bf EO}{\rm (p.\,\pageref{class_e_o})} is to look at the {\tt tutorial}.\section{Installation}\label{main_install}
+The installation procedure of the package is detailed in the {\tt README} file in the top-directory of the source-tree.\section{Overall Design}\label{main_design}
+For an introduction to the design of {\bf EO}{\rm (p.\,\pageref{class_e_o})} you can look at the {\tt slides} from a talk at EA 2001 or the corresponding {\tt article} in {\tt {\em Lecture Notes In Computer Science\/} {\bf 2310}, {\em Selected Papers from the 5th European Conference on Artificial Evolution\/}}. 
\ No newline at end of file
diff --git a/trunk/paradiseo-eo/doc/latex/modules.tex b/trunk/paradiseo-eo/doc/latex/modules.tex
new file mode 100644
index 000000000..48c284cef
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/modules.tex
@@ -0,0 +1,10 @@
+\section{EO Modules}
+Here is a list of all modules:\begin{CompactList}
+\item \contentsline{section}{Bitstring}{\pageref{group__bitstring}}{}
+\item \contentsline{section}{Operators}{\pageref{group___operators}}{}
+\item \contentsline{section}{Prop\-Combined\-Operators}{\pageref{group___prop_combined_operators}}{}
+\item \contentsline{section}{Parse\-Tree}{\pageref{group___parse_tree}}{}
+\item \contentsline{section}{St\-Parse\-Tree}{\pageref{group___st_parse_tree}}{}
+\item \contentsline{section}{Evolution\-Strategies}{\pageref{group___evolution_strategies}}{}
+\item \contentsline{section}{Selectors}{\pageref{group__selectors}}{}
+\end{CompactList}
diff --git a/trunk/paradiseo-eo/doc/latex/namespacegp__parse__tree.tex b/trunk/paradiseo-eo/doc/latex/namespacegp__parse__tree.tex
new file mode 100644
index 000000000..d8cb129c0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/namespacegp__parse__tree.tex
@@ -0,0 +1,149 @@
+\section{gp\_\-parse\_\-tree Namespace Reference}
+\label{namespacegp__parse__tree}\index{gp_parse_tree@{gp\_\-parse\_\-tree}}
+Parse\_\-tree and subtree classes (c) copyright Maarten Keijzer 1999, 2000.  
+
+
+\subsection*{Classes}
+\begin{CompactItemize}
+\item 
+class {\bf gp\_\-parse\_\-tree::Mem\-Pool}
+\begin{CompactList}\small\item\em Pool allocator for the subtree and parse tree classes (homebrew and not compliant to ANSI allocator requirements) (c) copyright Maarten Keijzer 1999, 2000. \item\end{CompactList}\item 
+struct {\bf gp\_\-parse\_\-tree::Mem\-Pool::Link}
+\item 
+struct {\bf gp\_\-parse\_\-tree::Mem\-Pool::Chunk}
+\item 
+class {\bf gp\_\-parse\_\-tree::Node\_\-alloc$<$ T $>$}
+\item 
+class {\bf gp\_\-parse\_\-tree::Standard\_\-alloc$<$ T $>$}
+\item 
+class {\bf gp\_\-parse\_\-tree::Standard\_\-Node\_\-alloc$<$ T $>$}
+\item 
+class {\bf gp\_\-parse\_\-tree::Tree\_\-alloc$<$ T $>$}
+\item 
+class {\bf gp\_\-parse\_\-tree::parse\_\-tree$<$ T $>$}
+\item 
+class {\bf gp\_\-parse\_\-tree::parse\_\-tree$<$ T $>$::subtree}
+\item 
+class {\bf gp\_\-parse\_\-tree::parse\_\-tree$<$ T $>$::base\_\-iterator}
+\item 
+class {\bf gp\_\-parse\_\-tree::parse\_\-tree$<$ T $>$::iterator}
+\item 
+class {\bf gp\_\-parse\_\-tree::parse\_\-tree$<$ T $>$::embedded\_\-iterator}
+\item 
+class {\bf gp\_\-parse\_\-tree::parse\_\-tree$<$ T $>$::base\_\-const\_\-iterator}
+\item 
+class {\bf gp\_\-parse\_\-tree::parse\_\-tree$<$ T $>$::const\_\-iterator}
+\item 
+class {\bf gp\_\-parse\_\-tree::parse\_\-tree$<$ T $>$::embedded\_\-const\_\-iterator}
+\end{CompactItemize}
+\subsection*{Functions}
+\begin{CompactItemize}
+\item 
+template$<$class T$>$ void {\bf do\_\-the\_\-swap} (T \&a, T \&b)\label{namespacegp__parse__tree_a0}
+
+\begin{CompactList}\small\item\em This ones defined because gcc does not always implement namespaces. \item\end{CompactList}\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Parse\_\-tree and subtree classes (c) copyright Maarten Keijzer 1999, 2000. 
+
+Permission to copy, use, modify, sell and distribute this software is granted provided this copyright notice appears in all copies. This software is provided \char`\"{}as is\char`\"{} without express or implied warranty, and with no claim as to its suitability for any purpose.
+
+Permission to modify the code and to distribute modified code is granted, provided the above notices as well as this one are retained, and a notice that the code was modified is included with the above copyright notice.
+
+Usage information.
+
+class Node (your node in the tree) must have the following implemented:
+
+Arity $\ast$$\ast$$\ast$$\ast$$\ast$$\ast$
+
+int arity(void) const
+
+Note: the default constructor of a Node should provide a Node with arity 0!
+
+Evaluation $\ast$$\ast$$\ast$$\ast$$\ast$$\ast$
+
+A parse\_\-tree is evaluated through one of it's apply() members:
+
+1) parse\_\-tree::apply(Ret\-Val)
+
+is the simplest evaluation, it will call
+
+Ret\-Val Node::operator()(Ret\-Val, subtree$<$Node, Ret\-Val$>$::const\_\-iterator)
+
+(Unfortunately the first Ret\-Val argument is mandatory (although you might not need it. This is because MSVC does not support member template functions properly. If it cannot deduce the template arguments (as is the case in templatizing over return value) you are not allowed to specify them. calling tree.apply$<$double$>$() would result in a syntax error. That is why you have to call tree.apply(double()) instead.)
+
+2) parse\_\-tree::apply(Ret\-Val v, It values)
+
+will call:
+
+Ret\-Val Node::operator()(Ret\-Val, subtree$<$... , It values)
+
+where It is whatever type you desire (most of the time this will be a std::vector containing the values of your variables);
+
+3) parse\_\-tree::apply(Ret\-Val, It values, It2 more\-Values)
+
+will call:
+
+Ret\-Val Node::operator()(Ret\-Val, subtree$<$... , It values, It2 more\-Values)
+
+although I do not see the immediate use of this, however...
+
+4) parse\_\-tree::apply(Ret\-Val, It values, It2 args, It3 adfs)
+
+that calls:
+
+Ret\-Val Node::operator()(subtree$<$... , It values, It2 args, It3 adfs)
+
+can be useful for implementing adfs.
+
+In general it is a good idea to leave the specifics of the arguments open so that different ways of evaluation remain possible. Implement the simplest eval as:
+
+template $<$class it=\char`\"{}\char`\"{}$>$ Ret\-Val operator()(Ret\-Val dummy, It begin) const
+
+Internal Structure $\ast$$\ast$$\ast$$\ast$$\ast$$\ast$
+
+A parse\_\-tree has two template arguments: the Node and the Return\-Value produced by evaluating the node. The structure of the tree is defined through a subtree class that has the same two template arguments.
+
+The nodes are stored in a tree like :
+
+node4 / $\backslash$ node3 node2 / $\backslash$ node1 node0
+
+where nodes 2 and 4 have arity 2 and nodes 0,1 and 3 arity 0 (terminals)
+
+The nodes are subtrees, containing the structure of the tree, together with its size and depth. They contain a Node, the user defined template argument. To access these nodes from a subtree, use operator-$>$ or operator$\ast$.
+
+The numbers behind the nodes define a reverse-polish or postfix traversel through the tree. The parse\_\-tree defines iterators on the tree such that
+
+tree.begin() points at the subtree at node0 and tree.back() returns the subtree at node4, the complete tree
+
+Likewise operator[] is defined on the tree, such that:
+
+tree[0] will return the subtree at node0, while tree[2] will return the subtree at node2
+
+Assigments of subtrees is protected so that the code:
+
+tree[2] = tree[0];
+
+will not crash and result in a tree structured as:
+
+node4 / $\backslash$ node3 node0
+
+Note that the rank numbers no longer specify their place in the tree:
+
+tree[0] still points at node0, but tree[1] now points to node3 and tree[2] points at the root node4
+
+Embedded iterators are implemented to iterate over nodes rather than subtrees. So an easy way to copy your tree to a std::vector is:
+
+std::vector$<$Node$>$ vec(tree.size()); copy(tree.ebegin(), tree.eend(), vec.begin());
+
+You can also copy it to an std::ostream\_\-iterator with this technique, given that your Node implements an appropriate operator$<$$<$. Reinitializing a tree with the std::vector is also simple:
+
+tree.clear(); copy(vec.begin(), vec.end(), back\_\-inserter(tree));
+
+or from an std::istream:
+
+copy(std::istream\_\-iterator$<$T$>$(my\_\-stream), std::istream\_\-iterator$<$T$>$(), back\_\-inserter(tree));
+
+Note that the back\_\-inserter must be used as there is no resize member in the parse\_\-tree. back\_\-inserter will use the push\_\-back member from the parse\_\-tree 
+
diff --git a/trunk/paradiseo-eo/doc/latex/namespaces.tex b/trunk/paradiseo-eo/doc/latex/namespaces.tex
new file mode 100644
index 000000000..fbd262e0f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/namespaces.tex
@@ -0,0 +1,4 @@
+\section{EO Namespace List}
+Here is a list of all documented namespaces with brief descriptions:\begin{CompactList}
+\item\contentsline{section}{{\bf gp\_\-parse\_\-tree} (Parse\_\-tree and subtree classes (c) copyright Maarten Keijzer 1999, 2000 )}{\pageref{namespacegp__parse__tree}}{}
+\end{CompactList}
diff --git a/trunk/paradiseo-eo/doc/latex/pages.tex b/trunk/paradiseo-eo/doc/latex/pages.tex
new file mode 100644
index 000000000..3d91f40a0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/pages.tex
@@ -0,0 +1,9 @@
+\section{EO Related Pages}
+Here is a list of all related documentation pages:\begin{CompactList}
+\item \contentsline{section}{Related webpages}{\pageref{webpages}}{}
+
+\item \contentsline{section}{Projects}{\pageref{related}}{}
+
+\item \contentsline{section}{Todo List}{\pageref{todo}}{}
+
+\end{CompactList}
diff --git a/trunk/paradiseo-eo/doc/latex/refman.tex b/trunk/paradiseo-eo/doc/latex/refman.tex
new file mode 100644
index 000000000..6a8b1b6a6
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/refman.tex
@@ -0,0 +1,404 @@
+\documentclass[a4paper]{book}
+\usepackage{a4wide}
+\usepackage{makeidx}
+\usepackage{fancyhdr}
+\usepackage{graphicx}
+\usepackage{multicol}
+\usepackage{float}
+\usepackage{textcomp}
+\usepackage{alltt}
+\usepackage{doxygen}
+\makeindex
+\setcounter{tocdepth}{1}
+\renewcommand{\footrulewidth}{0.4pt}
+\begin{document}
+\begin{titlepage}
+\vspace*{7cm}
+\begin{center}
+{\Large EO Reference Manual\\[1ex]\large 0.9.4-cvs }\\
+\vspace*{1cm}
+{\large Generated by Doxygen 1.3.9.1}\\
+\vspace*{0.5cm}
+{\small Thu Oct 19 05:06:33 2006}\\
+\end{center}
+\end{titlepage}
+\clearemptydoublepage
+\pagenumbering{roman}
+\tableofcontents
+\clearemptydoublepage
+\pagenumbering{arabic}
+\chapter{Welcome to Evolving Objects }
+\label{index}\input{main}
+\chapter{EO Module Index}
+\input{modules}
+\chapter{EO Namespace Index}
+\input{namespaces}
+\chapter{EO Hierarchical Index}
+\input{hierarchy}
+\chapter{EO Class Index}
+\input{annotated}
+\chapter{EO Page Index}
+\input{pages}
+\chapter{EO Module Documentation}
+\input{group__bitstring}
+\include{group___operators}
+\include{group___prop_combined_operators}
+\include{group___parse_tree}
+\include{group___st_parse_tree}
+\include{group___evolution_strategies}
+\include{group__selectors}
+\chapter{EO Namespace Documentation}
+\input{namespacegp__parse__tree}
+\chapter{EO Class Documentation}
+\input{classeo1_pt_bit_crossover}
+\include{classeo_aged}
+\include{classeo_algo}
+\include{classeo_arithmetic_crossover}
+\include{classeo_assembled_fitness_average_stat}
+\include{classeo_assembled_fitness_best_stat}
+\include{classeo_atom_exchange}
+\include{classeo_average_stat}
+\include{classeo_best_fitness_stat}
+\include{classeo_best_select}
+\include{classeo_b_f}
+\include{class_biased_node_selector}
+\include{classeo_binary_functor_counter}
+\include{classeo_bin_clone_op}
+\include{classeo_bin_gen_op}
+\include{classeo_bin_op}
+\include{classeo_bit}
+\include{classeo_bit_bit_flip}
+\include{classeo_bit_gx_over}
+\include{classeo_bit_inversion}
+\include{classeo_bit_mutation}
+\include{classeo_bit_next}
+\include{classeo_bit_op_factory}
+\include{classeo_bit_prev}
+\include{classboolean__generator}
+\include{classeo_boolean_generator}
+\include{classeo_boolean_init}
+\include{classeo_bool_flip}
+\include{classeo_branch_mutation}
+\include{classeo_breed}
+\include{classeo_cellular_easy_e_a}
+\include{classeo_check_point}
+\include{classeo_c_m_a_breed}
+\include{classeo_c_m_a_init}
+\include{classeo_collapse_subtree_mutation}
+\include{classeo_combined_continue}
+\include{classeo_combined_init}
+\include{classeo_comma_replacement}
+\include{classeo_continue}
+\include{classeo_counted_dyn_update}
+\include{classeo_counted_state_saver}
+\include{class_cov}
+\include{classeo_ctrl_c_continue}
+\include{classeo_det_bit_flip}
+\include{classeo_deterministic_sa_d_replacement}
+\include{classeo_deterministic_survive_and_die}
+\include{classeo_det_select}
+\include{classeo_det_tournament_select}
+\include{classeo_det_tournament_truncate}
+\include{classeo_det_tournament_truncate_split}
+\include{classeo_det_tournament_worth_select}
+\include{classeo_det_uniform_mutation}
+\include{classeo_distance}
+\include{classeo_distrib_updater}
+\include{classeo_distribution}
+\include{classd_matrix}
+\include{classeo_dominance_map}
+\include{classeo_double_exchange}
+\include{classeo_double_intermediate}
+\include{classeo_drawable}
+\include{struct_dummy}
+\include{classeo_dyn_s_g_a_transform}
+\include{classeo_dyn_updater}
+\include{classeo_easy_e_a}
+\include{classeo_e_d_a}
+\include{classeo_elite_sequential_select}
+\include{classeo_elitism}
+\include{class_e_o}
+\include{classeo_e_p_reduce}
+\include{classeo_e_p_replacement}
+\include{classeo_es_chrom_init}
+\include{classeo_es_full}
+\include{classeo_es_global_xover}
+\include{classeo_es_mutate}
+\include{classeo_es_mutation_init}
+\include{classeo_es_simple}
+\include{classeo_es_standard_xover}
+\include{classeo_es_stdev}
+\include{classeo_eval_continue}
+\include{classeo_eval_func}
+\include{classeo_eval_func_counter}
+\include{structeo_eval_func_ptr}
+\include{classeo_expansion_mutation}
+\include{classeo_external_bin_op}
+\include{classeo_external_e_o}
+\include{classeo_external_eval_func}
+\include{classeo_external_init}
+\include{classeo_external_mon_op}
+\include{classeo_external_quad_op}
+\include{classeo_f}
+\include{classeo_factory}
+\include{classeo_f_d_c_file_snapshot}
+\include{classeo_f_d_c_stat}
+\include{classeo_file_monitor}
+\include{classeo_file_snapshot}
+\include{classeo_fit_continue}
+\include{classeo_fitness_scaling_select}
+\include{classeo_fitness_stat}
+\include{classeo_fl_or1pt_bin_op}
+\include{classeo_fl_or1pt_quad_op}
+\include{classeo_fl_or_all_atom_bin_op}
+\include{classeo_fl_or_all_atom_quad_op}
+\include{classeo_fl_or_all_mutation}
+\include{classeo_fl_or_k_atom_bin_op}
+\include{classeo_fl_or_k_atom_quad_op}
+\include{classeo_fl_or_k_mutation}
+\include{classeo_fl_or_uniform_bin_op}
+\include{classeo_fl_or_uniform_quad_op}
+\include{classeo_functor_base}
+\include{structeo_functor_base_1_1binary__function__tag}
+\include{structeo_functor_base_1_1procedure__tag}
+\include{structeo_functor_base_1_1unary__function__tag}
+\include{classeo_functor_store}
+\include{classeo_g3_replacement}
+\include{classeo_gen_continue}
+\include{classeo_gene_del_chooser}
+\include{classeo_general_breeder}
+\include{classeo_general_int_bounds}
+\include{classeo_general_real_bounds}
+\include{classeo_generational_replacement}
+\include{classeo_gen_op}
+\include{classeo_gnuplot}
+\include{classeo_gnuplot1_d_monitor}
+\include{classeo_gnuplot1_d_snapshot}
+\include{classeo_hamming_distance}
+\include{classeo_hoist_mutation}
+\include{classeo_how_many}
+\include{classeo_incrementor}
+\include{classeo_incrementor_param}
+\include{classeo_init}
+\include{classeo_init_adaptor}
+\include{classeo_init_fixed_length}
+\include{classeo_init_generator}
+\include{classeo_init_variable_length}
+\include{classeo_init_virus}
+\include{classeo_init_virus1bit}
+\include{classeo_inner_exchange_quad_op}
+\include{classeo_int_above_bound}
+\include{classeo_int_below_bound}
+\include{classeo_int_bounds}
+\include{classeo_int_interval}
+\include{classeo_int_no_bounds}
+\include{classeo_invalidate_bin_op}
+\include{classeo_invalidate_mon_op}
+\include{classeo_invalidate_quad_op}
+\include{classeo_linear_fit_scaling}
+\include{classeo_linear_random_split}
+\include{classeo_linear_truncate}
+\include{classeo_linear_truncate_split}
+\include{class_mem_pool}
+\include{classgp__parse__tree_1_1_mem_pool}
+\include{classeo_merge}
+\include{classeo_merge_reduce}
+\include{classeo_m_g_g_replacement}
+\include{class_minimizing_traits}
+\include{classeo_m_o_fitness_stat}
+\include{classeo_mon_clone_op}
+\include{classeo_mon_gen_op}
+\include{classeo_monitor}
+\include{classeo_mon_op}
+\include{classeo_n_d_plus_replacement}
+\include{classeo_n_d_sorting}
+\include{classeo_n_d_sorting_1_1_dummy_e_o}
+\include{classeo_n_d_sorting___i}
+\include{classeo_n_d_sorting___i_i}
+\include{classnegexp__generator}
+\include{classeo_neg_exp_generator}
+\include{classeo_neg_exp_init}
+\include{class_node_selector}
+\include{classeo_no_elitism}
+\include{classeo_no_perf2_worth}
+\include{classnormal__generator}
+\include{classeo_normal_generator}
+\include{classeo_normal_init}
+\include{classeo_normal_mutation}
+\include{classeo_normal_vec_mutation}
+\include{classeo_no_select}
+\include{classeo_n_pts_bit_xover}
+\include{classeo_nth_element_fitness_stat}
+\include{classeo_object}
+\include{classeo_one_fifth_mutation}
+\include{classeo_one_max}
+\include{classeo_one_max_eval_func}
+\include{classeo_one_max_init}
+\include{classeo_one_max_mutation}
+\include{classeo_one_max_quad_crossover}
+\include{classeo_op}
+\include{classeo_op_container}
+\include{classeo_op_sel_mason}
+\include{classeo_param}
+\include{classeo_parameter_loader}
+\include{classeo_param_param_type}
+\include{classeo_pareto_fitness}
+\include{classeo_pareto_fitness_traits}
+\include{classeo_pareto_one_constraint_fitness}
+\include{classeo_pareto_ranking}
+\include{classeo_parser}
+\include{classeo_parse_tree}
+\include{classeo_parse_tree_depth_init}
+\include{classeo_p_b_i_l_additive}
+\include{classeo_p_b_i_l_distrib}
+\include{classeo_p_b_i_l_org}
+\include{classeo_perf2_worth}
+\include{classeo_perf2_worth_1_1compare__worth}
+\include{classeo_perf2_worth_cached}
+\include{classeo_perf2_worth_cached_1_1compare__worth}
+\include{classeo_persistent}
+\include{classeo_plus}
+\include{classeo_plus_replacement}
+\include{classeo_point_mutation}
+\include{classeo_pop}
+\include{structeo_pop_1_1_cmp}
+\include{structeo_pop_1_1_ref}
+\include{classeo_pop_algo}
+\include{classeo_pop_eval_func}
+\include{classeo_pop_loop_eval}
+\include{classeo_pop_stat}
+\include{classeo_populator}
+\include{classeo_printable}
+\include{classeo_procedure_counter}
+\include{classeo_prop_combined_bin_op}
+\include{classeo_prop_combined_mon_op}
+\include{classeo_prop_combined_quad_op}
+\include{classeo_prop_g_a_gen_op}
+\include{classeo_proportional_op}
+\include{classeo_proportional_select}
+\include{classeo_quad2_bin_op}
+\include{classeo_quad_clone_op}
+\include{classeo_quad_distance}
+\include{classeo_quad_gen_op}
+\include{classeo_quad_op}
+\include{classrandom__generator}
+\include{class_random_node_selector}
+\include{classeo_random_reduce}
+\include{classeo_random_select}
+\include{classeo_random_split}
+\include{classeo_ranking}
+\include{classeo_ranking_select}
+\include{classeo_real}
+\include{classeo_real_above_bound}
+\include{classeo_real_base_vector_bounds}
+\include{classeo_real_below_bound}
+\include{classeo_real_bounds}
+\include{classeo_real_init_bounded}
+\include{classeo_real_interval}
+\include{classeo_real_no_bounds}
+\include{classeo_real_ux_over}
+\include{classeo_real_vector_bounds}
+\include{classeo_real_vector_no_bounds}
+\include{classeo_reduce}
+\include{classeo_reduce_merge}
+\include{classeo_reduce_merge_reduce}
+\include{classeo_reduce_split}
+\include{classeo_replacement}
+\include{classeo_rnd_generator}
+\include{classeo_rng}
+\include{classeo_roulette_worth_select}
+\include{classeo_scalar_fitness}
+\include{classeo_scalar_fitness_assembled}
+\include{classeo_scalar_fitness_assembled_traits}
+\include{classeo_scalar_fitness_stat}
+\include{classeo_second_moment_stats}
+\include{classeo_segment_crossover}
+\include{classeo_sel_bin_gen_op}
+\include{classeo_select}
+\include{classeo_select_factory}
+\include{classeo_select_from_worth}
+\include{classeo_selective_populator}
+\include{classeo_select_many}
+\include{classeo_select_number}
+\include{classeo_select_one}
+\include{classeo_select_perc}
+\include{classeo_select_transform}
+\include{classeo_seq_populator}
+\include{classeo_sequential_op}
+\include{classeo_sequential_select}
+\include{classeo_s_g_a}
+\include{classeo_s_g_a_gen_op}
+\include{classeo_s_g_a_transform}
+\include{classeo_sharing}
+\include{classeo_sharing_select}
+\include{classeo_simple_e_d_a}
+\include{classeo_sorted_pop_stat}
+\include{classeo_sorted_stat}
+\include{classeo_sorted_stat_base}
+\include{classeo_s_s_g_a_det_tournament_replacement}
+\include{classeo_s_s_g_a_stoch_tournament_replacement}
+\include{classeo_s_s_g_a_worse_replacement}
+\include{classeo_stat}
+\include{classeo_stat_base}
+\include{classeo_state}
+\include{structeo_state_1_1loading__error}
+\include{classeo_st_branch_mutation}
+\include{classeo_stdout_monitor}
+\include{classeo_steady_fit_continue}
+\include{classeo_st_hoist_mutation}
+\include{classeo_s_t_l_b_f}
+\include{classeo_s_t_l_f}
+\include{classeo_s_t_l_u_f}
+\include{classeo_stochastic_universal_select}
+\include{classeo_stoch_tournament_select}
+\include{classeo_stoch_tournament_truncate}
+\include{classeo_stoch_tournament_truncate_split}
+\include{classeo_stoch_tournament_worth_select}
+\include{classeo_st_parse_tree_depth_init}
+\include{classeo_st_point_mutation}
+\include{classeo_string}
+\include{classeo_st_subtree_x_over}
+\include{classeo_subtree_x_over}
+\include{classeo_survive_and_die}
+\include{classeo_sym_init}
+\include{struct_t__pickle__suite}
+\include{classeo_time_counter}
+\include{classeo_timed_dyn_update}
+\include{classeo_timed_monitor}
+\include{classeo_timed_state_saver}
+\include{classeo_time_varying_loop_eval}
+\include{classeo_transform}
+\include{classeo_truncate}
+\include{classeo_truncated_select_many}
+\include{classeo_truncated_select_one}
+\include{classeo_truncate_split}
+\include{classeo_trunc_select}
+\include{classeo_u_bit_xover}
+\include{classeo_u_f}
+\include{class_u_f__random__generator}
+\include{classeo_unary_functor_counter}
+\include{classuniform__generator}
+\include{classeo_uniform_atom_exchange}
+\include{classeo_uniform_gene_chooser}
+\include{classeo_uniform_generator}
+\include{classeo_uniform_init}
+\include{classeo_uniform_mutation}
+\include{classeo_updatable}
+\include{classeo_updater}
+\include{classeo_value_param}
+\include{classeo_variable_pareto_traits}
+\include{classeo_vector}
+\include{class_virus_bit_flip}
+\include{class_virus_shift_mutation}
+\include{classeo_vl_add_mutation}
+\include{classeo_vl_atom_exchange_quad_op}
+\include{classeo_vl_del_mutation}
+\include{classeo_vl_uniform_bin_op}
+\include{classeo_vl_uniform_quad_op}
+\include{classeo_weak_elitist_replacement}
+\chapter{EO Page Documentation}
+\input{webpages}
+\include{related}
+\include{todo}
+\printindex
+\end{document}
diff --git a/trunk/paradiseo-eo/doc/latex/related.tex b/trunk/paradiseo-eo/doc/latex/related.tex
new file mode 100644
index 000000000..365da3957
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/related.tex
@@ -0,0 +1,3 @@
+\subsection*{Paradis\-EO}
+
+{\tt Paradis\-EO} is a project to extend {\bf EO}{\rm (p.\,\pageref{class_e_o})} to make use of dedicated parallel or distributed computing environments by {\tt S\'{e}bastien Cahon}. 
\ No newline at end of file
diff --git a/trunk/paradiseo-eo/doc/latex/struct_dummy.eps b/trunk/paradiseo-eo/doc/latex/struct_dummy.eps
new file mode 100644
index 000000000..70dc9946a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/struct_dummy.eps
@@ -0,0 +1,297 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 66.6667
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 7.5 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 12 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(Dummy) cw
+(EO< double >) cw
+(EO< double >) cw
+(EO< double >) cw
+(EO< double >) cw
+(EO< double >) cw
+(EO< double >) cw
+(eoObject) cw
+(eoPersistent) cw
+(eoObject) cw
+(eoPersistent) cw
+(eoObject) cw
+(eoPersistent) cw
+(eoObject) cw
+(eoPersistent) cw
+(eoObject) cw
+(eoPersistent) cw
+(eoObject) cw
+(eoPersistent) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (Dummy) 5 0 box
+ (EO< double >) 0 1 box
+ (EO< double >) 2 1 box
+ (EO< double >) 4 1 box
+ (EO< double >) 6 1 box
+ (EO< double >) 8 1 box
+ (EO< double >) 10 1 box
+ (eoPersistent) 11 2 box
+11 2 mark
+ (eoObject) 11 3 box
+ (eoPersistent) 9 2 box
+9 2 mark
+ (eoObject) 9 3 box
+ (eoPersistent) 7 2 box
+7 2 mark
+ (eoObject) 7 3 box
+ (eoPersistent) 5 2 box
+5 2 mark
+ (eoObject) 5 3 box
+ (eoPersistent) 3 2 box
+3 2 mark
+ (eoObject) 3 3 box
+ (eoPersistent) 1 2 box
+1 2 mark
+ (eoObject) 1 3 box
+
+% ----- relations -----
+
+solid
+0 5 0 out
+solid
+0 10 1 conn
+solid
+1 0 1 in
+solid
+0 0 1 out
+solid
+1 2 1 in
+solid
+0 2 1 out
+solid
+1 4 1 in
+solid
+0 4 1 out
+solid
+1 6 1 in
+solid
+0 6 1 out
+solid
+1 8 1 in
+solid
+0 8 1 out
+solid
+1 10 1 in
+solid
+0 10 1 out
+solid
+1 0 2.5 hedge
+solid
+1 0 3.5 hedge
+solid
+0 2 3.5 vedge
+solid
+1 2 2.5 hedge
+solid
+1 2 3.5 hedge
+solid
+2 2 3.5 vedge
+solid
+1 4 2.5 hedge
+solid
+1 4 3.5 hedge
+solid
+4 2 3.5 vedge
+solid
+1 6 2.5 hedge
+solid
+1 6 3.5 hedge
+solid
+6 2 3.5 vedge
+solid
+1 8 2.5 hedge
+solid
+1 8 3.5 hedge
+solid
+8 2 3.5 vedge
+solid
+1 10 2.5 hedge
+solid
+1 10 3.5 hedge
+solid
+10 2 3.5 vedge
diff --git a/trunk/paradiseo-eo/doc/latex/struct_dummy.tex b/trunk/paradiseo-eo/doc/latex/struct_dummy.tex
new file mode 100644
index 000000000..ec95af6f5
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/struct_dummy.tex
@@ -0,0 +1,147 @@
+\section{Dummy Struct Reference}
+\label{struct_dummy}\index{Dummy@{Dummy}}
+test program for the general operator - millenium version! uses dummy individuals  
+
+
+Inheritance diagram for Dummy::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=1.86667cm]{struct_dummy}
+\end{center}
+\end{figure}
+\subsection*{Public Types}
+\begin{CompactItemize}
+\item 
+typedef double {\bf Type}\label{struct_dummy_w0}
+
+\item 
+typedef double {\bf Type}\label{struct_dummy_w1}
+
+\item 
+typedef double {\bf Type}\label{struct_dummy_w2}
+
+\item 
+typedef double {\bf Type}\label{struct_dummy_w3}
+
+\item 
+typedef double {\bf Type}\label{struct_dummy_w4}
+
+\item 
+typedef double {\bf Type}\label{struct_dummy_w5}
+
+\end{CompactItemize}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf Dummy} (std::string \_\-s=\char`\"{}\char`\"{})\label{struct_dummy_a0}
+
+\item 
+void {\bf print\-On} (std::ostream \&\_\-os) const 
+\begin{CompactList}\small\item\em Write object. \item\end{CompactList}\item 
+void {\bf print\-On} (std::ostream \&\_\-os) const 
+\begin{CompactList}\small\item\em Write object. \item\end{CompactList}\item 
+void {\bf print\-On} (std::ostream \&\_\-os) const 
+\begin{CompactList}\small\item\em Write object. \item\end{CompactList}\item 
+void {\bf print\-On} (std::ostream \&\_\-os) const 
+\begin{CompactList}\small\item\em Write object. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Public Attributes}
+\begin{CompactItemize}
+\item 
+std::string {\bf s}\label{struct_dummy_o0}
+
+\item 
+double {\bf xdist}\label{struct_dummy_o1}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+test program for the general operator - millenium version! uses dummy individuals 
+
+
+
+Definition at line 27 of file t-eo\-Checkpointing.cpp.
+
+\subsection{Member Function Documentation}
+\index{Dummy@{Dummy}!printOn@{printOn}}
+\index{printOn@{printOn}!Dummy@{Dummy}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}void Dummy::print\-On (std::ostream \& {\em \_\-os}) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{struct_dummy_a1}
+
+
+Write object. 
+
+Called print\-On since it prints the object \_\-on\_\- a stream. \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-os}]A std::ostream. \end{description}
+\end{Desc}
+
+
+Reimplemented from {\bf EO$<$ double $>$} {\rm (p.\,\pageref{class_e_o_z10_2})}.
+
+Definition at line 41 of file t-eo\-Gen\-Op.cpp.
+
+References EO$<$ F $>$::print\-On().\index{Dummy@{Dummy}!printOn@{printOn}}
+\index{printOn@{printOn}!Dummy@{Dummy}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}void Dummy::print\-On (std::ostream \& {\em \_\-os}) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{struct_dummy_a2}
+
+
+Write object. 
+
+Called print\-On since it prints the object \_\-on\_\- a stream. \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-os}]A std::ostream. \end{description}
+\end{Desc}
+
+
+Reimplemented from {\bf EO$<$ double $>$} {\rm (p.\,\pageref{class_e_o_z10_2})}.
+
+Definition at line 23 of file t-eo\-Replacement.cpp.
+
+References EO$<$ F $>$::print\-On().\index{Dummy@{Dummy}!printOn@{printOn}}
+\index{printOn@{printOn}!Dummy@{Dummy}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}void Dummy::print\-On (std::ostream \& {\em \_\-os}) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{struct_dummy_a3}
+
+
+Write object. 
+
+Called print\-On since it prints the object \_\-on\_\- a stream. \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-os}]A std::ostream. \end{description}
+\end{Desc}
+
+
+Reimplemented from {\bf EO$<$ double $>$} {\rm (p.\,\pageref{class_e_o_z10_2})}.
+
+Definition at line 18 of file t-eo\-Select.cpp.
+
+References EO$<$ F $>$::print\-On().\index{Dummy@{Dummy}!printOn@{printOn}}
+\index{printOn@{printOn}!Dummy@{Dummy}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}void Dummy::print\-On (std::ostream \& {\em \_\-os}) const\hspace{0.3cm}{\tt  [inline, virtual]}}\label{struct_dummy_a4}
+
+
+Write object. 
+
+Called print\-On since it prints the object \_\-on\_\- a stream. \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-os}]A std::ostream. \end{description}
+\end{Desc}
+
+
+Reimplemented from {\bf EO$<$ double $>$} {\rm (p.\,\pageref{class_e_o_z10_2})}.
+
+Definition at line 24 of file t-eo\-Sharing.cpp.
+
+References EO$<$ F $>$::print\-On().
+
+The documentation for this struct was generated from the following files:\begin{CompactItemize}
+\item 
+t-eo\-Checkpointing.cpp\item 
+t-eo\-Gen\-Op.cpp\item 
+t-eo\-Replacement.cpp\item 
+t-eo\-Select.cpp\item 
+t-eo\-Sharing.cpp\item 
+t-eo\-State\-And\-Parser.cpp\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/struct_t__pickle__suite.tex b/trunk/paradiseo-eo/doc/latex/struct_t__pickle__suite.tex
new file mode 100644
index 000000000..d10597ad7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/struct_t__pickle__suite.tex
@@ -0,0 +1,33 @@
+\section{T\_\-pickle\_\-suite$<$ T $>$ Struct Template Reference}
+\label{struct_t__pickle__suite}\index{T_pickle_suite@{T\_\-pickle\_\-suite}}
+Implements pickle support for {\bf eo\-Persistent}{\rm (p.\,\pageref{classeo_persistent})} derivatives.  
+
+
+{\tt \#include $<$pickle.h$>$}
+
+\subsection*{Static Public Member Functions}
+\begin{CompactItemize}
+\item 
+std::string {\bf print\_\-to\_\-string} (const T \&t)\label{struct_t__pickle__suite_e0}
+
+\item 
+boost::python::tuple {\bf getstate} (const T \&t)\label{struct_t__pickle__suite_e1}
+
+\item 
+void {\bf setstate} (T \&t, boost::python::tuple pickled)\label{struct_t__pickle__suite_e2}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class T$>$ struct T\_\-pickle\_\-suite$<$ T $>$}
+
+Implements pickle support for {\bf eo\-Persistent}{\rm (p.\,\pageref{classeo_persistent})} derivatives. 
+
+
+
+Definition at line 32 of file pickle.h.
+
+The documentation for this struct was generated from the following file:\begin{CompactItemize}
+\item 
+pickle.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/structeo_eval_func_ptr.eps b/trunk/paradiseo-eo/doc/latex/structeo_eval_func_ptr.eps
new file mode 100644
index 000000000..6ab3e8c42
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/structeo_eval_func_ptr.eps
@@ -0,0 +1,215 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: ClassName
+%%Creator: Doxygen
+%%CreationDate: Time
+%%For: 
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 500 152.672
+%%Pages: 0
+%%BeginSetup
+%%EndSetup
+%%EndComments
+
+% ----- variables -----
+
+/boxwidth 0 def
+/boxheight 40 def
+/fontheight 24 def
+/marginwidth 10 def
+/distx 20 def
+/disty 40 def
+/boundaspect 3.275 def  % aspect ratio of the BoundingBox (width/height)
+/boundx 500 def
+/boundy boundx boundaspect div def
+/xspacing 0 def
+/yspacing 0 def
+/rows 4 def
+/cols 2 def
+/scalefactor 0 def
+/boxfont /Times-Roman findfont fontheight scalefont def
+
+% ----- procedures -----
+
+/dotted { [1 4] 0 setdash } def
+/dashed { [5] 0 setdash } def
+/solid  { [] 0 setdash } def
+
+/max % result = MAX(arg1,arg2)
+{
+  /a exch def
+  /b exch def
+  a b gt {a} {b} ifelse
+} def
+
+/xoffset % result = MAX(0,(scalefactor-(boxwidth*cols+distx*(cols-1)))/2)
+{
+  0 scalefactor boxwidth cols mul distx cols 1 sub mul add sub 2 div max
+} def
+
+/cw % boxwidth = MAX(boxwidth, stringwidth(arg1))
+{
+  /str exch def
+  /boxwidth boxwidth str stringwidth pop max def
+} def
+
+/box % draws a box with text `arg1' at grid pos (arg2,arg3)
+{ gsave
+  2 setlinewidth
+  newpath
+  exch xspacing mul xoffset add
+  exch yspacing mul
+  moveto
+  boxwidth 0 rlineto 
+  0 boxheight rlineto 
+  boxwidth neg 0 rlineto 
+  0 boxheight neg rlineto 
+  closepath
+  dup stringwidth pop neg boxwidth add 2 div
+  boxheight fontheight 2 div sub 2 div
+  rmoveto show stroke
+  grestore
+} def  
+
+/mark
+{ newpath
+  exch xspacing mul xoffset add boxwidth add
+  exch yspacing mul
+  moveto
+  0 boxheight 4 div rlineto
+  boxheight neg 4 div boxheight neg 4 div rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/arrow
+{ newpath
+  moveto
+  3 -8 rlineto
+  -6 0 rlineto
+  3 8 rlineto
+  closepath
+  eofill
+  stroke
+} def
+
+/out % draws an output connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight add
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto 
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/in % draws an input connector for the block at (arg1,arg2)
+{
+  newpath
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul disty 2 div sub
+  /y exch def
+  /x exch def
+  x y moveto
+  0 disty 2 div rlineto
+  stroke
+  1 eq { x y disty 2 div add arrow } if
+} def
+
+/hedge
+{
+  exch xspacing mul xoffset add boxwidth 2 div add
+  exch yspacing mul boxheight 2 div sub
+  /y exch def
+  /x exch def
+  newpath
+  x y moveto
+  boxwidth 2 div distx add 0 rlineto
+  stroke
+  1 eq
+  { newpath x boxwidth 2 div distx add add y moveto
+    -8 3 rlineto
+    0 -6 rlineto
+    8 3 rlineto
+    closepath
+    eofill
+    stroke
+  } if
+} def
+
+/vedge
+{
+  /ye exch def
+  /ys exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add dup
+  ys yspacing mul boxheight 2 div sub
+  moveto
+  ye yspacing mul boxheight 2 div sub
+  lineto
+  stroke
+} def
+
+/conn % connections the blocks from col `arg1' to `arg2' of row `arg3'
+{
+  /ys exch def
+  /xe exch def
+  /xs exch def
+  newpath
+  xs xspacing mul xoffset add boxwidth 2 div add
+  ys yspacing mul disty 2 div sub
+  moveto
+  xspacing xe xs sub mul 0
+  rlineto
+  stroke
+} def
+
+% ----- main ------
+
+boxfont setfont
+1 boundaspect scale
+(eoEvalFuncPtr< EOT, FitT, FunctionArg >) cw
+(eoEvalFunc< EOT >) cw
+(eoUF< EOT &, void >) cw
+(eoFunctorBase) cw
+(unary_function< EOT &, void >) cw
+/boxwidth boxwidth marginwidth 2 mul add def
+/xspacing boxwidth distx add def
+/yspacing boxheight disty add def
+/scalefactor 
+  boxwidth cols mul distx cols 1 sub mul add
+  boxheight rows mul disty rows 1 sub mul add boundaspect mul 
+  max def
+boundx scalefactor div boundy scalefactor div scale
+
+% ----- classes -----
+
+ (eoEvalFuncPtr< EOT, FitT, FunctionArg >) 0.5 0 box
+ (eoEvalFunc< EOT >) 0.5 1 box
+ (eoUF< EOT &, void >) 0.5 2 box
+ (eoFunctorBase) 0 3 box
+ (unary_function< EOT &, void >) 1 3 box
+
+% ----- relations -----
+
+solid
+0 0.5 0 out
+solid
+1 0.5 1 in
+solid
+0 0.5 1 out
+solid
+1 0.5 2 in
+solid
+0 0.5 2 out
+solid
+0 1 3 conn
+solid
+1 0 3 in
+solid
+1 1 3 in
diff --git a/trunk/paradiseo-eo/doc/latex/structeo_eval_func_ptr.tex b/trunk/paradiseo-eo/doc/latex/structeo_eval_func_ptr.tex
new file mode 100644
index 000000000..edfe80373
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/structeo_eval_func_ptr.tex
@@ -0,0 +1,62 @@
+\section{eo\-Eval\-Func\-Ptr$<$ EOT, Fit\-T, Function\-Arg $>$ Struct Template Reference}
+\label{structeo_eval_func_ptr}\index{eoEvalFuncPtr@{eoEvalFuncPtr}}
+EOEval\-Func\-Ptr: This class takes an existing function pointer and converts it into a evaluation function class.  
+
+
+{\tt \#include $<$eo\-Eval\-Func\-Ptr.h$>$}
+
+Inheritance diagram for eo\-Eval\-Func\-Ptr$<$ EOT, Fit\-T, Function\-Arg $>$::\begin{figure}[H]
+\begin{center}
+\leavevmode
+\includegraphics[height=4cm]{structeo_eval_func_ptr}
+\end{center}
+\end{figure}
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf eo\-Eval\-Func\-Ptr} ({\bf Fit\-T}($\ast$\_\-eval)(Function\-Arg))
+\begin{CompactList}\small\item\em Applies the function to the chromosome and sets the fitness of the Chrom. \item\end{CompactList}\item 
+virtual void {\bf operator()} ({\bf EOT} \&\_\-eo)\label{structeo_eval_func_ptr_a1}
+
+\begin{CompactList}\small\item\em Effectively applies the evaluation function to an {\bf EO}{\rm (p.\,\pageref{class_e_o})}. \item\end{CompactList}\end{CompactItemize}
+\subsection*{Private Attributes}
+\begin{CompactItemize}
+\item 
+{\bf Fit\-T}($\ast$ {\bf eval\-Func} )(Function\-Arg)\label{structeo_eval_func_ptr_r0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT, class Fit\-T = typename EOT::Fitness, class Function\-Arg = const EOT\&$>$ struct eo\-Eval\-Func\-Ptr$<$ EOT, Fit\-T, Function\-Arg $>$}
+
+EOEval\-Func\-Ptr: This class takes an existing function pointer and converts it into a evaluation function class. 
+
+That way, old style C or C++ functions can be adapted to {\bf EO}{\rm (p.\,\pageref{class_e_o})} function classes. 
+
+
+
+Definition at line 43 of file eo\-Eval\-Func\-Ptr.h.
+
+\subsection{Constructor \& Destructor Documentation}
+\index{eoEvalFuncPtr@{eo\-Eval\-Func\-Ptr}!eoEvalFuncPtr@{eoEvalFuncPtr}}
+\index{eoEvalFuncPtr@{eoEvalFuncPtr}!eoEvalFuncPtr@{eo\-Eval\-Func\-Ptr}}
+\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class EOT, class Fit\-T = typename EOT::Fitness, class Function\-Arg = const EOT\&$>$ {\bf eo\-Eval\-Func\-Ptr}$<$ {\bf EOT}, {\bf Fit\-T}, Function\-Arg $>$::{\bf eo\-Eval\-Func\-Ptr} ({\bf Fit\-T}($\ast$)(Function\-Arg) {\em \_\-eval})\hspace{0.3cm}{\tt  [inline]}}\label{structeo_eval_func_ptr_a0}
+
+
+Applies the function to the chromosome and sets the fitness of the Chrom. 
+
+Thus, the evaluation function need not be worried about that. \begin{Desc}
+\item[Parameters:]
+\begin{description}
+\item[{\em \_\-eval}]pointer to the evaluation function, takes a EOT as an argument and returns the fitness \end{description}
+\end{Desc}
+\begin{Desc}
+\item[Returns:]the evaluated fitness for that object. \end{Desc}
+
+
+Definition at line 51 of file eo\-Eval\-Func\-Ptr.h.
+
+The documentation for this struct was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Eval\-Func\-Ptr.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/structeo_functor_base_1_1binary__function__tag.tex b/trunk/paradiseo-eo/doc/latex/structeo_functor_base_1_1binary__function__tag.tex
new file mode 100644
index 000000000..8de8aecf4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/structeo_functor_base_1_1binary__function__tag.tex
@@ -0,0 +1,19 @@
+\section{eo\-Functor\-Base::binary\_\-function\_\-tag Struct Reference}
+\label{structeo_functor_base_1_1binary__function__tag}\index{eoFunctorBase::binary_function_tag@{eoFunctorBase::binary\_\-function\_\-tag}}
+tag to identify a binary function in compile time function selection functor\_\-category  
+
+
+{\tt \#include $<$eo\-Functor.h$>$}
+
+
+
+\subsection{Detailed Description}
+tag to identify a binary function in compile time function selection functor\_\-category 
+
+
+
+Definition at line 57 of file eo\-Functor.h.
+
+The documentation for this struct was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Functor.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/structeo_functor_base_1_1procedure__tag.tex b/trunk/paradiseo-eo/doc/latex/structeo_functor_base_1_1procedure__tag.tex
new file mode 100644
index 000000000..56cabff59
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/structeo_functor_base_1_1procedure__tag.tex
@@ -0,0 +1,19 @@
+\section{eo\-Functor\-Base::procedure\_\-tag Struct Reference}
+\label{structeo_functor_base_1_1procedure__tag}\index{eoFunctorBase::procedure_tag@{eoFunctorBase::procedure\_\-tag}}
+tag to identify a procedure in compile time function selection functor\_\-category  
+
+
+{\tt \#include $<$eo\-Functor.h$>$}
+
+
+
+\subsection{Detailed Description}
+tag to identify a procedure in compile time function selection functor\_\-category 
+
+
+
+Definition at line 53 of file eo\-Functor.h.
+
+The documentation for this struct was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Functor.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/structeo_functor_base_1_1unary__function__tag.tex b/trunk/paradiseo-eo/doc/latex/structeo_functor_base_1_1unary__function__tag.tex
new file mode 100644
index 000000000..62e0f222a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/structeo_functor_base_1_1unary__function__tag.tex
@@ -0,0 +1,19 @@
+\section{eo\-Functor\-Base::unary\_\-function\_\-tag Struct Reference}
+\label{structeo_functor_base_1_1unary__function__tag}\index{eoFunctorBase::unary_function_tag@{eoFunctorBase::unary\_\-function\_\-tag}}
+tag to identify a unary function in compile time function selection functor\_\-category  
+
+
+{\tt \#include $<$eo\-Functor.h$>$}
+
+
+
+\subsection{Detailed Description}
+tag to identify a unary function in compile time function selection functor\_\-category 
+
+
+
+Definition at line 55 of file eo\-Functor.h.
+
+The documentation for this struct was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Functor.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/structeo_pop_1_1_cmp.tex b/trunk/paradiseo-eo/doc/latex/structeo_pop_1_1_cmp.tex
new file mode 100644
index 000000000..f97bc58a5
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/structeo_pop_1_1_cmp.tex
@@ -0,0 +1,27 @@
+\section{eo\-Pop$<$ EOT $>$::Cmp Struct Reference}
+\label{structeo_pop_1_1_cmp}\index{eoPop::Cmp@{eoPop::Cmp}}
+helper struct for comparing on pointers  
+
+
+{\tt \#include $<$eo\-Pop.h$>$}
+
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+bool {\bf operator()} (const {\bf EOT} $\ast$a, const {\bf EOT} $\ast$b) const \label{structeo_pop_1_1_cmp_a0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ struct eo\-Pop$<$ EOT $>$::Cmp}
+
+helper struct for comparing on pointers 
+
+
+
+Definition at line 124 of file eo\-Pop.h.
+
+The documentation for this struct was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Pop.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/structeo_pop_1_1_ref.tex b/trunk/paradiseo-eo/doc/latex/structeo_pop_1_1_ref.tex
new file mode 100644
index 000000000..0274989a8
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/structeo_pop_1_1_ref.tex
@@ -0,0 +1,27 @@
+\section{eo\-Pop$<$ EOT $>$::Ref Struct Reference}
+\label{structeo_pop_1_1_ref}\index{eoPop::Ref@{eoPop::Ref}}
+helper struct for getting a pointer  
+
+
+{\tt \#include $<$eo\-Pop.h$>$}
+
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+const {\bf EOT} $\ast$ {\bf operator()} (const {\bf EOT} \&eot)\label{structeo_pop_1_1_ref_a0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+\subsubsection*{template$<$class EOT$>$ struct eo\-Pop$<$ EOT $>$::Ref}
+
+helper struct for getting a pointer 
+
+
+
+Definition at line 122 of file eo\-Pop.h.
+
+The documentation for this struct was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-Pop.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/structeo_state_1_1loading__error.tex b/trunk/paradiseo-eo/doc/latex/structeo_state_1_1loading__error.tex
new file mode 100644
index 000000000..0027cb9c1
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/structeo_state_1_1loading__error.tex
@@ -0,0 +1,25 @@
+\section{eo\-State::loading\_\-error Struct Reference}
+\label{structeo_state_1_1loading__error}\index{eoState::loading_error@{eoState::loading\_\-error}}
+Loading error thrown when nothing seems to work.  
+
+
+{\tt \#include $<$eo\-State.h$>$}
+
+\subsection*{Public Member Functions}
+\begin{CompactItemize}
+\item 
+{\bf loading\_\-error} (std::string huh=\char`\"{}Error while loading\char`\"{})\label{structeo_state_1_1loading__error_a0}
+
+\end{CompactItemize}
+
+
+\subsection{Detailed Description}
+Loading error thrown when nothing seems to work. 
+
+
+
+Definition at line 83 of file eo\-State.h.
+
+The documentation for this struct was generated from the following file:\begin{CompactItemize}
+\item 
+eo\-State.h\end{CompactItemize}
diff --git a/trunk/paradiseo-eo/doc/latex/todo.tex b/trunk/paradiseo-eo/doc/latex/todo.tex
new file mode 100644
index 000000000..e77021cd1
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/todo.tex
@@ -0,0 +1,9 @@
+\section{Todo List}\label{todo}
+\label{todo__todo000001}
+ \begin{description}
+\item[Class {\bf eo\-Dominance\-Map$<$ Eo\-Type $>$}{\rm (p.\,\pageref{classeo_dominance_map})} ]make it an {\bf eo\-Stat}{\rm (p.\,\pageref{classeo_stat})}? \end{description}
+
+
+\label{todo__todo000002}
+ \begin{description}
+\item[Member {\bf eo\-Es\-Chrom\-Init::create\_\-self\_\-adapt}{\rm (p.\,\pageref{classeo_es_chrom_init_d2})}(eo\-Es\-Stdev$<$ Fit\-T $>$ \&result) ]Should we scale sigmas to the corresponding object variable range? \end{description}
diff --git a/trunk/paradiseo-eo/doc/latex/webpages.tex b/trunk/paradiseo-eo/doc/latex/webpages.tex
new file mode 100644
index 000000000..fef5ccc68
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/latex/webpages.tex
@@ -0,0 +1,3 @@
+\section{Related webpages}\label{webpages}
+\begin{itemize}
+\item {\bf EO}{\rm (p.\,\pageref{class_e_o})} {\tt homepage}\item {\bf EO}{\rm (p.\,\pageref{class_e_o})} {\tt Tutorial}.\item Source\-Forge {\tt project page}\item {\tt README}\item {\tt NEWS} \end{itemize}
diff --git a/trunk/paradiseo-eo/doc/mainpage.html b/trunk/paradiseo-eo/doc/mainpage.html
new file mode 100644
index 000000000..518fafc70
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/mainpage.html
@@ -0,0 +1,317 @@
+
+
+  
+    
+    
+    
+    
+    
+    EO Evolutionary Computation Framework
+    
+  
+  
+    
    
+      
    EO Evolutionary Computation Framework
    
+    
    
+    
+      
+        
+          
+          
+        
+        
+          
+          
+        
+        
+          
+          
+        
+        
+          
+          
+        
+        
+          
+          
+        
+        
+          
+          
+        
+          
+          
+        
+        
+          
+          
+        
+        
+          
+          
+        
+        
+        
+          
+          
+        
+        
+      
+    
    
+            
    What is EO?
    
+              		
+            
    
+              EO is a templates-based, ANSI-C++ compliant evolutionary
+              computation library. It contains classes for almost any kind of
+              evolutionary computation you might come up to - at least for the
+              ones we could think of. It is component-based, so that if you
+              don't find the class you need in it, it is very easy to subclass
+              existing abstract or concrete classes.
+            
    
+
+            
    
+              EO was started by the
+              Geneura Team at the
+              University of Granada, headed
+              by Juan Julián
+              Merelo.
+              The original
+              Web site is also the only place where you will find old
+              releases of EO (up to 0.8.7), but beware that it is not compatible
+              at all with the current version.
+            
    
+
+            
    
+              The developement team has then been reinforced by
+              Maarten Keijzer, the
+              C++ wizzard, and Marc
+              Schoenauer. Later
+              came Jeroen
+              Eggermont, who, among other things, did a lot of work on GP,
+            Sébastien Cahon, who
+            developped the parallel version of EO, ParadisEO,
+            Olivier König,
+            who did a lot of useful additions and cleaning of the code
+            and Jochen Küpper,
+            working on automatic installation procedures.
+            
    
+          
    
+            
    Platforms
    
+              		
+            
    
+              EO should work on Windows and any Un*x-like operating system with
+              a standard-conforming C++ development system.
+            
    
+
+            
    
+              Recent versions of EO have been tested on the following platforms:
+            
    
+            
      
+              
    • Linux x86 with GCC 3.x and 4.x
      • 
+              
    • Linux x86_64 with GCC 3.x and GCC 4.x (t-MGE1bit fails)
      • 
+              
    • MacOS X/Darwin PowerPC with GCC 3.3
      • 
+              
    • Solaris SPARC with GCC 3.3.2
      • 
+              
    • Solaris x86 with GCC 3.3.2 (t-MGE1bit fails)
      • 
+              
    • CygWin (Windows XP) with GCC 3.3.1 (cygming special).
+              
    • Win95/NT with VC++ 5.0 and Borland Builder. Makefiles and
+                projects files are provided.
      • 
+            
    
+            
    
+              If you have tested EO on a system not listed here, please
+              let
+                us know.
+            
    
+
+            
    
+              If you are working on a system with an older C++ compiler there is
+              a good chance that eo-0.9.3z.1 works. It is tested on Linux with
+              gcc-2.9x and several systems (IRIX, Solaris) with egcs.
+            
    
+          
    
+            
    Documentation
    
+              		
+            
    
+              The tutorial demonstrates that writing an evolutionary algorithm
+              evolving your own structures is now easy, using
+              ready-to-use template files. Although it has not been upgraded for
+              some time now and refers to version 0.9.2 of EO, it nevertheless
+              remains the best way to dive into EO. You can start by trying it
+              on-line at 
+              LRI
+              or SourceForge,
+              before downloading it.
+              The tutorial is also included in
+              the released
+              sources.              
+            
    
+            
    
+              The latest
+              tutorial
+              release includes
+              a introduction
+              to ParadisEO, the parallel version of EO.
+            
    
+            
    
+              The complete code is also well documented and you can look at the
+              generated interface
+              documentation.
+            
    
+          
    
+            
    Presentations
    
+              		
+            
    
+              A functional and "philosophical" overview of EO was presented at
+              EA'01
+                conference. You can download the
+                paper or
+              the
+                slides.
+            
    
+            
+            
    
+              An older (but huge) PowerPoint presentation shows the EO
+              philosophy, and it includes a Visual Basic macro for evolving
+              objects in Visual Basic for Applications. You can download
+              it from
+              here.
+            
    
+
+            
    
+              You can also look a the list of
+              publications that used EO to solve real problems.
+            
    
+          
    
+            
    Download
    
+              		
+            
    
+              The current release
+              is 0.9.3z.1.
+              It supports GCC 3.x, 4.x, and good old g++ 2.9x. This is the
+              version you should use now
+              (September 2005). Current cvs and all subsequent versions will
+              require GCC 3.x or later.
+            
    
+            
+            
    
+              You can obtain the latest version directly
+              via cvs or
+              download a daily snapshot from
+              LRI.
+            
    
+            
+            
    
+              All releases can be obtained from the SourceForge download
+              area.
+            
    
+          
    
+            
    Mailing Lists
    
+              		We would like EO to be an open development
+            effort; that is why we have created two mailing lists to discuss
+            future developments, solve technical problems, announce releases,
+            publish patches, and discuss evolutionary computation in general.
+            Join the EO
+            mailing lists
    
+            
    EO@sourceforge
    
+              		
+            
    The following resources are available, thanks to sourceforge
    
+            
+          
    
+            
    License
    
+              		EO is distributed under the
+            GNU Lesser General
+              Public License
    
+            
    Related Apps
    
+              		
+            
    
+              ParadisEO
+              provides extensions for EO on parallel architectures.
+            
    
+
+            
    
+              DegaX is an
+              ActiveX control developed by three degree students which
+              embeds EO
+              0.8.4. (Currently these links are dead. Please
+              let
+              us know where they should point.)
+            
    
+
+            
    
+              MOEO, a
+              multi-objective package on top of EO.
+            
    
+          
    
+            
    Links
    
+              		
+            
+          
    
+    
    
+      
    maartenkeijzer@users.sourceforge.net
+        - merelo@users.sourceforge.net
+        - evomarc@users.sourceforge.net
+      
    
+      
    
+        Hosted by:
    SF logo
+      
    
+    
    
+    
    
+      
+        Valid HTML 4.01 Transitional
+      
    
+      Please send comments on this webpage to
+      the EO
+      mailing list.
+    
    
+  
+
+
+
+
+
+
+
diff --git a/trunk/paradiseo-eo/doc/make_snapshot.out b/trunk/paradiseo-eo/doc/make_snapshot.out
new file mode 100644
index 000000000..bd5f1eb6c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/make_snapshot.out
@@ -0,0 +1,1449 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/MGE/eoVirus.h:36: Warning: missing title after \defgroup bitstring
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoOp.h:33: Warning: missing title after \defgroup Operators
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoProportionalCombinedOp.h:33: Warning: missing title after \defgroup PropCombinedOperators
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoProportionalCombinedOp.h:212: Warning: Missing //@}
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoNormalMutation.h:274: Warning: end of group without matching begin.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoRealInitBounded.h:66: Warning: end of group without matching begin.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoRealOp.h:503: Warning: end of group without matching begin.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoBit.h:44: Warning: missing title after \defgroup bitstring
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoBitOp.h:446: Warning: end of group without matching begin.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTree.h:40: Warning: missing title after \defgroup ParseTree
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoStParseTreeDepthInit.h:44: Warning: missing title after \defgroup StParseTree
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:34: Warning: missing title after \defgroup EvolutionStrategies
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:34: Warning: missing title after \defgroup EvolutionStrategies
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealVectorBounds.h:35: Warning: missing title after \defgroup EvolutionStrategies
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/selectors.h:46: Warning: missing title after \defgroup selectors
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFunctor.h:52: Command @see not allowed in single-line C++ comment! Ignoring.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFunctor.h:54: Command @see not allowed in single-line C++ comment! Ignoring.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFunctor.h:56: Command @see not allowed in single-line C++ comment! Ignoring.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFunctor.h:81: Command @see not allowed in single-line C++ comment! Ignoring.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFunctor.h:118: Command @see not allowed in single-line C++ comment! Ignoring.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFunctor.h:158: Command @see not allowed in single-line C++ comment! Ignoring.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoBit.h:44: Warning: group bitstring already documented. Skipping documentation.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:34: Warning: group EvolutionStrategies already documented. Skipping documentation.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealVectorBounds.h:35: Warning: group EvolutionStrategies already documented. Skipping documentation.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoBit.h:51: Warning: class eoBit already has a detailed description. Skipping the one found here.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoBit.h:51: Warning: class eoBit already has a brief description
+         skipping the one found here.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:56: Warning: Compound fitness_traits< minimization > is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eval/MultiFunction.cpp:29: Warning: Compound Function is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/sym/SymImpl.h:87: Warning: Compound detail::SymValue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eval/BoundsCheck.h:34: Warning: Compound IntervalBoundsCheck is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/valueParam.cpp:57: Warning: Compound ValueParam_pickle_suite is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoDistance.h:87: Warning: Compound eoFitnessDistance is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:52: Warning: Compound minimization is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoPareto.cpp:69: Warning: Compound Init is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/valueParam.cpp:31: Warning: Compound ParamWrapper is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoSBXcross.h:36: Warning: Compound eoSBXCrossover is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:339: Warning: Compound eoBestFitnessStat::CmpFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/TargetInfo.cpp:107: Warning: Compound SortOnTargets is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gprop/gprop.h:47: Warning: Compound phenotype is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/parse_tree.h:1033: Warning: Compound gp_parse_tree::parse_tree::iterator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/parse_tree.h:286: Warning: Compound gp_parse_tree::Standard_alloc is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/sym/Sym.h:54: Warning: Compound Sym is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoGenOp.cpp:56: Warning: Compound monop is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoOneToOneBreeder.h:53: Warning: Compound eoOneToOneBreeder is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/symreg.cpp:81: Warning: Compound SumSizeStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/sym/README.cpp:235: Warning: Compound MyNodeStats is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoSymreg.cpp:141: Warning: Compound RMS is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eo_interface/eoSymLambdaMutate.h:30: Warning: Compound eoSymLambdaMutate is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:234: Warning: Compound eoNthElementFitnessStat::CmpFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gpsymreg/fitness.h:166: Warning: Compound RegFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:66: Warning: Compound fitness_traits< maximization > is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoPareto.cpp:98: Warning: Compound eoNDPlusReplacement::WorthPair is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/do/make_algo_pareto.h:51: Warning: Compound eoNDPlusReplacement::WorthPair is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/matrices.h:6: Warning: Compound lower_triangular_matrix is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/RoyalRoad.h:29: Warning: Compound RoyalRoad is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/sym/SymImpl.cpp:22: Warning: Compound detail::SymArgsImpl is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/Scaling.h:48: Warning: Compound LinearScaling is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gprop/mse.h:54: Warning: Compound mse::net is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/sym/SymImpl.h:66: Warning: Compound detail::SymKey::Hash is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:77: Warning: Compound fitness_traits< pair< Performance, Worth > > is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoBitOp.h:45: Warning: Compound eoOneBitFlip is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gprop/l2.h:58: Warning: Compound l2::net is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/perf2worth.cpp:27: Warning: Compound Perf2WorthWrapper is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/MGE/VirusOp.h:57: Warning: Compound VirusMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eo_interface/eoSymCrossover.h:55: Warning: Compound eoBinHomologousCrossover is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eval/BoundsCheck.h:51: Warning: Compound NoBoundsCheck is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/ErrorMeasure.cpp:48: Warning: Compound ErrorMeasureImpl is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/parse_tree.h:968: Warning: Compound gp_parse_tree::parse_tree::base_iterator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/fun/FunDef.h:126: Warning: Compound differentiation_error is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoGenOp.cpp:71: Warning: Compound binop is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoRealOp.h:338: Warning: Compound eoHypercubeCrossover is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoRoulette.cpp:7: Warning: Compound TestEO is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/parse_tree.h:1153: Warning: Compound gp_parse_tree::parse_tree::embedded_const_iterator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/monitors.cpp:28: Warning: Compound MonitorWrapper is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eval/BoundsCheck.cpp:27: Warning: Compound IntervalBoundsCheckImpl is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/node_pool.h:79: Warning: Compound MemPool::Chunk is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/stats.h:83: Warning: Compound CovMatrix is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoEasyEA.h:209: Warning: Compound eoEasyEA::eoDummySelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/mastermind/mastermind.h:144: Warning: Compound eoChromMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gprop/gprop.h:166: Warning: Compound eoChromMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eo_interface/eoSymCrossover.h:40: Warning: Compound eoBinSubtreeCrossover is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eval/MultiFunction.h:9: Warning: Compound MultiFunction is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/node_pool.h:74: Warning: Compound MemPool::Link is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/reduce.cpp:29: Warning: Compound eoReduceWrapper is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTreeDepthInit.h:54: Warning: Compound eoParseTreeDepthInit::lt_arity is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/parse_tree.h:346: Warning: Compound gp_parse_tree::Tree_alloc is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eo_interface/eoSym.h:27: Warning: Compound EoSym is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/parse_tree.h:243: Warning: Compound gp_parse_tree::MemPool::Chunk is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/def_abstract_functor.h:98: Warning: Compound eoutils::BinaryWrapper is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/MGE/VirusOp.h:125: Warning: Compound VirusTransmission is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/Scaling.h:29: Warning: Compound ScalingBase is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eo_interface/eoSymEval.h:29: Warning: Compound eoSymPopEval is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/statistics.cpp:21: Warning: Compound SortedStatBaseWrapper is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoNDSorting.h:443: Warning: Compound eoNDSorting_II::compare_nodes is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/sym/SymImpl.h:58: Warning: Compound detail::SymKey is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/geneticOps.cpp:86: Warning: Compound QuadOpWrapper is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/geneticOps.cpp:54: Warning: Compound PopulatorWrapper is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eval/BoundsCheck.h:26: Warning: Compound BoundsCheck is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eval/MultiFunction.cpp:199: Warning: Compound MultiFunctionImpl is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/PyEO.cpp:76: Warning: Compound pyPop_pickle_suite is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gprop/qp.h:51: Warning: Compound qp::neuron is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/sym/SymImpl.h:38: Warning: Compound detail::SymArgs is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson4/binary_value.h:20: Warning: Compound BinaryValue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoGenOp.cpp:111: Warning: Compound one2threeOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eval/Interval.h:32: Warning: Compound interval_error is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/fun/FunDef.h:29: Warning: Compound FunDef is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoGenOp.cpp:102: Warning: Compound quadClone is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoBaseFunctions.cpp:9: Warning: Compound eo1 is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoBaseFunctions.cpp:14: Warning: Compound eo2 is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gprop/mlp.h:389: Warning: Compound mlp::set is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/shared_ptr.h:72: Warning: Compound weak_ptr is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/ErrorMeasure.h:27: Warning: Compound ErrorMeasure is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/mastermind/mastermind.h:183: Warning: Compound eoChromXover is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gprop/gprop.h:181: Warning: Compound eoChromXover is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/parse_tree.h:494: Warning: Compound gp_parse_tree::parse_tree::subtree is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoRealOp.h:458: Warning: Compound eoRealUXover is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoSharing.cpp:49: Warning: Compound eoDummyPop is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoSelect.cpp:31: Warning: Compound eoDummyPop is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoReplacement.cpp:32: Warning: Compound eoDummyPop is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoCheckpointing.cpp:34: Warning: Compound eoDummyPop is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/statistics.cpp:9: Warning: Compound StatBaseWrapper is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/stats.h:37: Warning: Compound Var is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/pipecom.h:19: Warning: Compound PipeCommunication is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gpsymreg/node.h:118: Warning: Compound Node is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/shared_ptr.h:25: Warning: Compound shared_ptr is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoFitnessAssembledEA.cpp:58: Warning: Compound eoAssembledEvalFunc is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/PyEO.h:31: Warning: Compound index_error is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoExternalEO.cpp:16: Warning: Compound UserDefStruct is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/MGE/eoVirus.h:50: Warning: Compound eoVirus is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gpsymreg/parameters.h:29: Warning: Compound Parameters is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:379: Warning: Compound eoDistanceStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoGenOp.cpp:84: Warning: Compound quadop is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduce.h:102: Warning: Compound eoEPReduce::Cmp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/parse_tree.h:1131: Warning: Compound gp_parse_tree::parse_tree::const_iterator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/PyEO.h:140: Warning: Compound PyEO_pickle_suite is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoPareto.cpp:24: Warning: Compound eoDouble is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoPareto.cpp:12: Warning: Compound MinimizingFitnessTraits is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gpsymreg/fitness.h:44: Warning: Compound MinimizingFitnessTraits is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoEasyEA.h:212: Warning: Compound eoEasyEA::eoDummyTransform is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/node_pool.h:159: Warning: Compound Standard_Node_alloc is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eval/MultiFunction.cpp:51: Warning: Compound Compiler is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPeriodicContinue.h:30: Warning: Compound eoPeriodicContinue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoSharing.cpp:34: Warning: Compound eoDummyDistance is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPopulator.h:174: Warning: Compound eoSeqPopulator::OutOfIndividuals is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:53: Warning: Compound maximization is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/parse_tree.h:238: Warning: Compound gp_parse_tree::MemPool::Link is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/CMAState.cpp:70: Warning: Compound eo::CMAStateImpl is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/geneticOps.cpp:70: Warning: Compound MonOpWrapper is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/PyEO.h:113: Warning: Compound PyEO is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gprop/mlp.h:366: Warning: Compound mlp::sample is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoGenOp.cpp:146: Warning: Compound three2threeOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/parse_tree.h:1057: Warning: Compound gp_parse_tree::parse_tree::embedded_iterator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gprop/mlp.h:224: Warning: Compound mlp::net is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/valueParam.h:8: Warning: Compound ValueParam is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPop.h:208: Warning: Compound eoPop::GetFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoSSGA.cpp:8: Warning: Compound eoBreedOne is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPopulator.h:52: Warning: Compound eoPopulator::OutOfIndividuals is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoproblem.cpp:26: Warning: Compound Easy is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eo_interface/eoSymMutate.h:28: Warning: Compound eoSymSubtreeMutate is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/def_abstract_functor.h:36: Warning: Compound eoutils::ProcWrapper is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/node_pool.h:122: Warning: Compound Standard_alloc is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoPareto.cpp:48: Warning: Compound Eval is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gpsymreg/node.h:54: Warning: Compound Operation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoEasyEA.h:215: Warning: Compound eoEasyEA::eoDummyEval is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoSymreg.cpp:14: Warning: Compound SymregNode is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/gen/NodeSelector.h:27: Warning: Compound NodeSelector::NodeSelection is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gprop/gprop.h:108: Warning: Compound Chrom is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eo_interface/eoSymCrossover.h:28: Warning: Compound eoQuadSubtreeCrossover is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/parse_tree.h:323: Warning: Compound gp_parse_tree::Standard_Node_alloc is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eo_interface/eoSymMutate.h:58: Warning: Compound eoSymNodeMutate is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/random_numbers.cpp:55: Warning: Compound RNG_pickle_suite is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gprop/qp.h:125: Warning: Compound qp::net is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/perf2worth.cpp:50: Warning: Compound CachedPerf2WorthWrapper is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/symreg.cpp:94: Warning: Compound DagSizeStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:15: Warning: Compound fitness_traits is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/CMAState.h:24: Warning: Compound eo::CMAState is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/selectOne.cpp:35: Warning: Compound eoSelectOneWrapper is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/CMAParams.h:20: Warning: Compound eo::CMAParams is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/sym/Sym.h:153: Warning: Compound HashSym is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoFunctor.cpp:12: Warning: Compound Tester is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/PyEO.h:38: Warning: Compound PyFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/def_abstract_functor.h:65: Warning: Compound eoutils::UnaryWrapper is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/node_pool.h:182: Warning: Compound Tree_alloc is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/parse_tree.h:256: Warning: Compound gp_parse_tree::Node_alloc is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/mastermind/mastermind.h:128: Warning: Compound eoInitChrom is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gprop/gprop.h:132: Warning: Compound eoInitChrom is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/Dataset.cpp:26: Warning: Compound DataSetImpl is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/gen/LanguageTable.h:26: Warning: Compound LanguageTable is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/parse_tree.h:1079: Warning: Compound gp_parse_tree::parse_tree::base_const_iterator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/parse_tree.h:489: Warning: Compound gp_parse_tree::parse_tree is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/stats.h:20: Warning: Compound Mean is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/ErrorMeasure.h:39: Warning: Compound ErrorMeasure::result is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoNDSorting.h:242: Warning: Compound eoNDSorting::Sorter is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/Dataset.h:26: Warning: Compound Dataset is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/geneticOps.cpp:78: Warning: Compound BinOpWrapper is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/gen/LanguageTable.cpp:28: Warning: Compound LanguageImpl is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/fun/FunDef.cpp:111: Warning: Compound HashDouble is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/TargetInfo.h:24: Warning: Compound TargetInfo is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoGenOp.cpp:131: Warning: Compound two2oneOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/symreg.cpp:56: Warning: Compound eoBestIndividualStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/gen/TreeBuilder.h:24: Warning: Compound TreeBuilder is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/sym/token.h:23: Warning: Compound functor_t is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/sym/Sym.h:31: Warning: Compound UniqueNodeStats is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gprop/mlp.h:151: Warning: Compound mlp::layer is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoSSGA.cpp:51: Warning: Compound Mutate is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoPareto.cpp:29: Warning: Compound Mutate is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/Scaling.h:73: Warning: Compound NoScaling is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoCellularEasyEA.h:148: Warning: Compound eoCellularEasyEA::eoSelectFirstOne is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoBitOp.h:243: Warning: Compound eo1PtBitXover is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/node_pool.h:92: Warning: Compound Node_alloc is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoSSGA.cpp:29: Warning: Compound eoMyEval is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/symreg.cpp:68: Warning: Compound AverageSizeStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gprop/mlp.h:77: Warning: Compound mlp::neuron is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoSSGA.cpp:40: Warning: Compound Xover is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/geneticOps.cpp:33: Warning: Compound GenOpWrapper is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eo_interface/eoSymMutate.h:99: Warning: Compound eoSymConstantMutate is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gprop/qp.h:94: Warning: Compound qp::layer is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/matrices.h:24: Warning: Compound square_matrix is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/sym/SymImpl.cpp:50: Warning: no matching class member found for
+  const SymArgs & detail::SymArgs::operator=(const SymArgs &args)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eig.h:21: Warning: no matching file member found for 
+int eo::eig(int N, const lower_triangular_matrix &C, std::valarray< double > &diag, square_matrix &Q, int niter=0)
+Possible candidates:
+  int eig(int N, const lower_triangular_matrix &C, valarray< double > &diag, square_matrix &Q, int niter)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.cpp:71: Warning: no matching class member found for
+  eoParser::eoParser(unsigned _argc, char **_argv, string _programDescription, string _lFileParamName, char _shortHand)
+Possible candidates:
+  eoParser::eoParser(unsigned _argc, char **_argv, std::string _programDescription="", std::string _lFileParamName="param-file", char _shortHand= 'p')
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.cpp:106: Warning: no matching class member found for
+  eoParam * eoParser::getParamWithLongName(const std::string &_name) const
+Possible candidates:
+  eoParam * eoParser::getParamWithLongName(const std::string &_name) const 
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.cpp:119: Warning: no matching class member found for
+  void eoParser::processParam(eoParam ¶m, std::string section)
+Possible candidates:
+  void eoParser::processParam(eoParam ¶m, std::string section="")
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.cpp:131: Warning: no matching class member found for
+  void eoParser::doRegisterParam(eoParam ¶m) const
+Possible candidates:
+  void eoParser::doRegisterParam(eoParam ¶m) const 
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.cpp:145: Warning: no matching class member found for
+  pair< bool, string > eoParser::getValue(eoParam &_param) const
+Possible candidates:
+  std::pair< bool, std::string > eoParser::getValue(eoParam &_param) const 
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.cpp:170: Warning: no matching class member found for
+  void eoParser::updateParameters() const
+Possible candidates:
+  void eoParser::updateParameters() const 
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.cpp:180: Warning: no matching class member found for
+  void eoParser::readFrom(istream &is)
+Possible candidates:
+  void eoParser::readFrom(std::istream &is)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.cpp:250: Warning: no matching class member found for
+  void eoParser::printOn(ostream &os) const
+Possible candidates:
+  void eoParser::printOn(std::ostream &os) const 
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.cpp:294: Warning: no matching class member found for
+  void eoParser::printHelp(ostream &os)
+Possible candidates:
+  void eoParser::printHelp(std::ostream &os)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.cpp:347: Warning: no matching class member found for
+  bool eoParser::userNeedsHelp(void)
+Possible candidates:
+  bool eoParser::userNeedsHelp(void)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/eoAged.h:105: Warning: Member age of class eoAged is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoAssembledFitnessStat.h:52: Warning: Member Fitness of class eoAssembledFitnessAverageStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoAssembledFitnessStat.h:57: Warning: Member eoAssembledFitnessAverageStat(unsigned _whichTerm=0, std::string _description="Average Fitness") of class eoAssembledFitnessAverageStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoAssembledFitnessStat.h:78: Warning: Member whichFitnessTerm of class eoAssembledFitnessAverageStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoAssembledFitnessStat.h:93: Warning: Member Fitness of class eoAssembledFitnessBestStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoAssembledFitnessStat.h:97: Warning: Member eoAssembledFitnessBestStat(unsigned _whichTerm=0, std::string _description="Best Fitness") of class eoAssembledFitnessBestStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoAssembledFitnessStat.h:109: Warning: Member whichFitnessTerm of class eoAssembledFitnessBestStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:115: Warning: Member Fitness of class eoAverageStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:118: Warning: Member eoAverageStat(std::string _description="Average Fitness") of class eoAverageStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:125: Warning: Member eoAverageStat(double _value, std::string _desc) of class eoAverageStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:131: Warning: Member className(void) const  of class eoAverageStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:120: Warning: Member sumFitness(double _sum, const EOT &_eot) of class eoAverageStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:138: Warning: Member doit(const eoPop< EOT > &_pop, eoParetoFitness< T >) of class eoAverageStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:156: Warning: Member doit(const eoPop< EOT > &_pop, T) of class eoAverageStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:323: Warning: Member Fitness of class eoBestFitnessStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:327: Warning: Member eoBestFitnessStat(std::string _description="Best ") of class eoBestFitnessStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:333: Warning: Member className(void) const  of class eoBestFitnessStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:357: Warning: Member doit(const eoPop< EOT > &_pop, eoParetoFitness< T >) of class eoBestFitnessStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:371: Warning: Member doit(const eoPop< EOT > &_pop, T) of class eoBestFitnessStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/gen/NodeSelector.h:60: Warning: Member BiasedNodeSelector(unsigned n) of class BiasedNodeSelector is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/gen/NodeSelector.h:62: Warning: Member select_node(Sym sym) const  of class BiasedNodeSelector is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/gen/NodeSelector.h:57: Warning: Member nRounds of class BiasedNodeSelector is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoCounter.h:146: Warning: Member eoBinaryFunctorCounter(BinaryFunctor &_func, std::string _name="proc_counter") of class eoBinaryFunctorCounter is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoCounter.h:179: Warning: Member func of class eoBinaryFunctorCounter is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoCloneOps.h:62: Warning: Member className() const  of class eoBinCloneOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoGenOp.h:110: Warning: Member eoBinGenOp(eoBinOp< EOT > &_op) of class eoBinGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoGenOp.h:125: Warning: Member className() const  of class eoBinGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoGenOp.h:128: Warning: Member op of class eoBinGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoOp.h:123: Warning: Member className() const  of class eoBinOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoBit.h:65: Warning: The following parameters of eoBit< FitT >::eoBit(unsigned size=0, bool value=false) are not documented:
+  parameter value
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoBitOp.h:439: Warning: Member gene_size of class eoBitGxOver is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoBitOp.h:440: Warning: Member num_points of class eoBitGxOver is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoBitOp.h:136: Warning: Member rate of class eoBitMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoBitOp.h:137: Warning: Member normalize of class eoBitMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoBitOp.h:107: Warning: The following parameters of eoBitMutation< Chrom >::eoBitMutation(const double &_rate=0.01, bool _normalize=false) are not documented:
+  parameter _normalize
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:73: Warning: Member boolean_generator(float _bias=0.5, eoRng &_rng=rng) of class boolean_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:75: Warning: Member operator()(void) of class boolean_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:77: Warning: Member bias of class boolean_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:78: Warning: Member gen of class boolean_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRndGenerators.h:107: Warning: Member eoBooleanGenerator(float _bias=0.5, eoRng &_rng=rng) of class eoBooleanGenerator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRndGenerators.h:111: Warning: Member bias of class eoBooleanGenerator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRndGenerators.h:112: Warning: Member gen of class eoBooleanGenerator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUniformInit.h:113: Warning: Member eoBooleanInit(float _bias=0.5, eoRng &_rng=rng) of class eoBooleanInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUniformInit.h:117: Warning: Member bias of class eoBooleanInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUniformInit.h:118: Warning: Member gen of class eoBooleanInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTreeOp.h:91: Warning: Member EoType of class eoBranchMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTreeOp.h:129: Warning: Member max_length of class eoBranchMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTreeOp.h:130: Warning: Member initializer of class eoBranchMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoCellularEasyEA.h:81: Warning: Member eoCellularEasyEA(eoContinue< EOT > &_cont, eoEvalFunc< EOT > &_eval, eoSelectOne< EOT > &_sel_neigh, eoQuadOp< EOT > &_cross, eoMonOp< EOT > &_mut, eoSelectOne< EOT > &_sel_child, eoSelectOne< EOT > &_sel_repl) of class eoCellularEasyEA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoCellularEasyEA.h:135: Warning: Member neighbours(const eoPop< EOT > &pop, int rank)=0 of class eoCellularEasyEA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoCellularEasyEA.h:139: Warning: Member cont of class eoCellularEasyEA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoCellularEasyEA.h:140: Warning: Member eval of class eoCellularEasyEA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoCellularEasyEA.h:141: Warning: Member popEval of class eoCellularEasyEA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoCellularEasyEA.h:142: Warning: Member sel_neigh of class eoCellularEasyEA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoCellularEasyEA.h:143: Warning: Member cross of class eoCellularEasyEA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoCellularEasyEA.h:144: Warning: Member mut of class eoCellularEasyEA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoCellularEasyEA.h:145: Warning: Member sel_child of class eoCellularEasyEA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoCellularEasyEA.h:146: Warning: Member sel_repl of class eoCellularEasyEA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoCheckPoint.h:51: Warning: Member eoCheckPoint(eoContinue< EOT > &_cont) of class eoCheckPoint is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoCheckPoint.h:57: Warning: Member add(eoContinue< EOT > &_cont) of class eoCheckPoint is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoCheckPoint.h:58: Warning: Member add(eoSortedStatBase< EOT > &_stat) of class eoCheckPoint is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoCheckPoint.h:59: Warning: Member add(eoStatBase< EOT > &_stat) of class eoCheckPoint is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoCheckPoint.h:60: Warning: Member add(eoMonitor &_mon) of class eoCheckPoint is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoCheckPoint.h:61: Warning: Member add(eoUpdater &_upd) of class eoCheckPoint is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoCheckPoint.h:63: Warning: Member className(void) const  of class eoCheckPoint is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoCheckPoint.h:68: Warning: Member continuators of class eoCheckPoint is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoCheckPoint.h:69: Warning: Member sorted of class eoCheckPoint is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoCheckPoint.h:70: Warning: Member stats of class eoCheckPoint is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoCheckPoint.h:71: Warning: Member monitors of class eoCheckPoint is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoCheckPoint.h:72: Warning: Member updaters of class eoCheckPoint is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoCMABreed.h:44: Warning: Member eoCMABreed(eo::CMAState &state_, unsigned lambda_) of class eoCMABreed is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoCMABreed.h:46: Warning: Member operator()(const eoPop< EOT > &parents, eoPop< EOT > &offspring) of class eoCMABreed is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoCMABreed.h:41: Warning: Member EOT of class eoCMABreed is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoCMABreed.h:38: Warning: Member state of class eoCMABreed is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoCMABreed.h:39: Warning: Member lambda of class eoCMABreed is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoCMAInit.h:44: Warning: Member eoCMAInit(const eo::CMAState &state_) of class eoCMAInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoCMAInit.h:47: Warning: Member operator()(EOT &v) of class eoCMAInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoCMAInit.h:41: Warning: Member EOT of class eoCMAInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoCMAInit.h:39: Warning: Member state of class eoCMAInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTreeOp.h:276: Warning: Member EoType of class eoCollapseSubtreeMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTreeOp.h:325: Warning: Member max_length of class eoCollapseSubtreeMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTreeOp.h:326: Warning: Member initializer of class eoCollapseSubtreeMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoCombinedContinue.h:64: Warning: Member add(eoContinue< EOT > &_cont) of class eoCombinedContinue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoCombinedContinue.h:70: Warning: Member removeLast(void) of class eoCombinedContinue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoCombinedContinue.h:85: Warning: Member className(void) const  of class eoCombinedContinue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoCombinedContinue.h:88: Warning: Member continuators of class eoCombinedContinue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoCombinedInit.h:84: Warning: Member initializers of class eoCombinedInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoCombinedInit.h:85: Warning: Member rates of class eoCombinedInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoMergeReduce.h:93: Warning: Member no_elite of class eoCommaReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoMergeReduce.h:94: Warning: Member truncate of class eoCommaReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoContinue.h:40: Warning: Member className(void) const  of class eoContinue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPersistent.h:58: Warning: argument `_is' of command @param is not found in the argument list of eoContinue< EOT >::readFrom(std::istream &__is)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPersistent.h:58: Warning: The following parameters of eoContinue< EOT >::readFrom(std::istream &__is) are not documented:
+  parameter __is
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPrintable.h:49: Warning: argument `_os' of command @param is not found in the argument list of eoContinue< EOT >::printOn(std::ostream &__os) const
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPrintable.h:49: Warning: The following parameters of eoContinue< EOT >::printOn(std::ostream &__os) const are not documented:
+  parameter __os
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdatable.h:97: Warning: Member eoCountedDynUpdate(eoUpdatable &_toUpdate, unsigned _interval) of class eoCountedDynUpdate is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdatable.h:107: Warning: Member interval of class eoCountedDynUpdate is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdatable.h:108: Warning: Member counter of class eoCountedDynUpdate is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdater.h:133: Warning: Member eoCountedStateSaver(unsigned _interval, const eoState &_state, std::string _prefix, bool _saveOnLastCall, std::string _extension="sav", unsigned _counter=0) of class eoCountedStateSaver is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdater.h:138: Warning: Member eoCountedStateSaver(unsigned _interval, const eoState &_state, std::string _prefix="state", std::string _extension="sav", unsigned _counter=0) of class eoCountedStateSaver is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdater.h:140: Warning: Member lastCall(void) of class eoCountedStateSaver is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdater.h:143: Warning: Member className(void) const  of class eoCountedStateSaver is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdater.h:145: Warning: Member doItNow(void) of class eoCountedStateSaver is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdater.h:147: Warning: Member state of class eoCountedStateSaver is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdater.h:148: Warning: Member interval of class eoCountedStateSaver is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdater.h:149: Warning: Member counter of class eoCountedStateSaver is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdater.h:150: Warning: Member saveOnLastCall of class eoCountedStateSaver is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdater.h:152: Warning: Member prefix of class eoCountedStateSaver is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdater.h:153: Warning: Member extension of class eoCountedStateSaver is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/stats.h:67: Warning: Member update(double a, double b) of class Cov is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/stats.h:78: Warning: Member get_meana() const  of class Cov is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/stats.h:79: Warning: Member get_meanb() const  of class Cov is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/stats.h:80: Warning: Member get_cov() const  of class Cov is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/stats.h:59: Warning: Member n of class Cov is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/stats.h:60: Warning: Member meana of class Cov is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/stats.h:61: Warning: Member meanb of class Cov is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/stats.h:62: Warning: Member sumcov of class Cov is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoCtrlCContinue.h:69: Warning: Member className(void) const  of class eoCtrlCContinue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoBitOp.h:95: Warning: Member num_bit of class eoDetBitFlip is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSurviveAndDie.h:180: Warning: Member reduceGlobal of class eoDeterministicSaDReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSurviveAndDie.h:181: Warning: Member sAdParents of class eoDeterministicSaDReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSurviveAndDie.h:182: Warning: Member sAdOffspring of class eoDeterministicSaDReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSurviveAndDie.h:184: Warning: Member plus of class eoDeterministicSaDReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSurviveAndDie.h:186: Warning: Member truncate of class eoDeterministicSaDReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoDetSelect.h:80: Warning: Member howMany of class eoDetSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoDetTournamentSelect.h:50: Warning: Member eoDetTournamentSelect(unsigned _tSize=2) of class eoDetTournamentSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoDetTournamentSelect.h:67: Warning: Member tSize of class eoDetTournamentSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduce.h:193: Warning: Member eoDetTournamentTruncate(unsigned _t_size) of class eoDetTournamentTruncate is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduce.h:229: Warning: Member t_size of class eoDetTournamentTruncate is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceSplit.h:247: Warning: Member t_size of class eoDetTournamentTruncateSplit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceSplit.h:248: Warning: Member howMany of class eoDetTournamentTruncateSplit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceSplit.h:249: Warning: Member returnEliminated of class eoDetTournamentTruncateSplit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSelectFromWorth.h:97: Warning: Member worthIterator of class eoDetTournamentWorthSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSelectFromWorth.h:102: Warning: Member eoDetTournamentWorthSelect(eoPerf2Worth< EOT, WorthT > &perf2Worth, unsigned _tSize) of class eoDetTournamentWorthSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSelectFromWorth.h:121: Warning: Member tSize of class eoDetTournamentWorthSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoRealOp.h:232: Warning: Member homogeneous of class eoDetUniformMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoRealOp.h:233: Warning: Member bounds of class eoDetUniformMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoRealOp.h:234: Warning: Member epsilon of class eoDetUniformMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoRealOp.h:235: Warning: Member no of class eoDetUniformMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoRealOp.h:147: Warning: argument `number' of command @param is not found in the argument list of eoDetUniformMutation< EOT >::eoDetUniformMutation(const double &_epsilon, const unsigned &_no=1)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoRealOp.h:147: Warning: The following parameters of eoDetUniformMutation< EOT >::eoDetUniformMutation(const double &_epsilon, const unsigned &_no=1) are not documented:
+  parameter _no
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoRealOp.h:158: Warning: argument `number' of command @param is not found in the argument list of eoDetUniformMutation< EOT >::eoDetUniformMutation(eoRealVectorBounds &_bounds, const double &_epsilon, const unsigned &_no=1)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoRealOp.h:158: Warning: The following parameters of eoDetUniformMutation< EOT >::eoDetUniformMutation(eoRealVectorBounds &_bounds, const double &_epsilon, const unsigned &_no=1) are not documented:
+  parameter _no
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoRealOp.h:175: Warning: argument `number' of command @param is not found in the argument list of eoDetUniformMutation< EOT >::eoDetUniformMutation(eoRealVectorBounds &_bounds, const std::vector< double > &_epsilon, const unsigned &_no=1)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoRealOp.h:175: Warning: The following parameters of eoDetUniformMutation< EOT >::eoDetUniformMutation(eoRealVectorBounds &_bounds, const std::vector< double > &_epsilon, const unsigned &_no=1) are not documented:
+  parameter _no
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSharing.h:41: Warning: Member dMatrix(unsigned _s) of class dMatrix is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSharing.h:69: Warning: Member rSize of class dMatrix is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoDominanceMap.h:159: Warning: Member fitness of class eoDominanceMap is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoCheckpointing.cpp:29: Warning: Member Type of class Dummy is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoGenOp.cpp:38: Warning: Member Type of class Dummy is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoReplacement.cpp:22: Warning: Member Type of class Dummy is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoSelect.cpp:17: Warning: Member Type of class Dummy is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoSharing.cpp:23: Warning: Member Type of class Dummy is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoStateAndParser.cpp:31: Warning: Member Type of class Dummy is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoGenOp.cpp:39: Warning: Member Dummy(std::string _s="") of class Dummy is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoGenOp.cpp:47: Warning: Member s of class Dummy is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoSharing.cpp:29: Warning: Member xdist of class Dummy is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGATransform.h:148: Warning: Member PCrossHandle() of class eoDynSGATransform is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGATransform.h:149: Warning: Member PMutHandle() of class eoDynSGATransform is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGATransform.h:155: Warning: Member cross of class eoDynSGATransform is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGATransform.h:156: Warning: Member crossoverProbaHolder of class eoDynSGATransform is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGATransform.h:157: Warning: Member crossoverProba of class eoDynSGATransform is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGATransform.h:158: Warning: Member mutate of class eoDynSGATransform is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGATransform.h:159: Warning: Member mutationProbaHolder of class eoDynSGATransform is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGATransform.h:160: Warning: Member mutationProba of class eoDynSGATransform is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGATransform.h:121: Warning: argument `pop' of command @param is not found in the argument list of eoDynSGATransform< EOT >::operator()(eoPop< EOT > &_pop)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGATransform.h:121: Warning: The following parameters of eoDynSGATransform< EOT >::operator()(eoPop< EOT > &_pop) are not documented:
+  parameter _pop
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdatable.h:53: Warning: Member eoDynUpdater(eoUpdatable &_toUpdate) of class eoDynUpdater is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdatable.h:61: Warning: Member toUpdate of class eoDynUpdater is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoEasyEA.h:209: Warning: Member dummySelect of class eoEasyEA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoEasyEA.h:212: Warning: Member dummyTransform of class eoEasyEA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoEasyEA.h:215: Warning: Member dummyEval of class eoEasyEA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoEasyEA.h:217: Warning: Member continuator of class eoEasyEA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoEasyEA.h:219: Warning: Member eval of class eoEasyEA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoEasyEA.h:220: Warning: Member loopEval of class eoEasyEA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoEasyEA.h:222: Warning: Member popEval of class eoEasyEA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoEasyEA.h:224: Warning: Member selectTransform of class eoEasyEA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoEasyEA.h:225: Warning: Member breed of class eoEasyEA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoEasyEA.h:229: Warning: Member dummyMerge of class eoEasyEA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoEasyEA.h:230: Warning: Member dummyReduce of class eoEasyEA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoEasyEA.h:232: Warning: Member mergeReduce of class eoEasyEA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoEasyEA.h:233: Warning: Member replace of class eoEasyEA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoEasyEA.h:236: Warning: Member eoIslandsEasyEA of class eoEasyEA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoEasyEA.h:237: Warning: Member eoDistEvalEasyEA of class eoEasyEA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSequentialSelect.h:139: Warning: Member current of class eoEliteSequentialSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSequentialSelect.h:140: Warning: Member eoPters of class eoEliteSequentialSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoMerge.h:60: Warning: Member eoElitism(double _rate, bool _interpret_as_rate=true) of class eoElitism is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoMerge.h:100: Warning: Member rate of class eoElitism is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoMerge.h:101: Warning: Member combien of class eoElitism is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/EO.h:47: Warning: Member Fitness of class EO is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:115: Warning: Member fitness_traits of class EO is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:116: Warning: Member storage_type of class EO is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:117: Warning: Member performance_type of class EO is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:118: Warning: Member worth_type of class EO is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/EO.h:67: Warning: Member invalidate() of class EO is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/EO.h:87: Warning: Member operator>(const EO &_eo2) const  of class EO is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:124: Warning: Member fitness(performance_type perf) of class EO is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:129: Warning: Member performance(performance_type perf) of class EO is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:135: Warning: Member performance(void) const  of class EO is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:141: Warning: Member worth(worth_type worth) of class EO is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:147: Warning: Member worth(void) const  of class EO is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:154: Warning: Member fitness(void) const  of class EO is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:159: Warning: Member invalidate(void) of class EO is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:165: Warning: Member invalidate_worth(void) of class EO is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:170: Warning: Member operator<(const EO< Fitness, Traits > &other) const  of class EO is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:175: Warning: Member operator>(const EO< Fitness, Traits > &other) const  of class EO is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/EO.h:146: Warning: Member repFitness of class EO is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/EO.h:147: Warning: Member invalidFitness of class EO is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:181: Warning: Member valid_performance of class EO is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:182: Warning: Member valid_worth of class EO is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:183: Warning: Member rep_fitness of class EO is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduce.h:86: Warning: Member Fitness of class eoEPReduce is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduce.h:90: Warning: Member eoEPReduce(unsigned _t_size) of class eoEPReduce is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduce.h:160: Warning: Member t_size of class eoEPReduce is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoMergeReduce.h:107: Warning: Member eoEPReplacement(int _tSize) of class eoEPReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoMergeReduce.h:109: Warning: Member plus of class eoEPReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoMergeReduce.h:110: Warning: Member truncate of class eoEPReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsChromInit.h:62: Warning: Member FitT of class eoEsChromInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsChromInit.h:100: Warning: argument `_sigma' of command @param is not found in the argument list of eoEsChromInit< EOT >::eoEsChromInit(eoRealVectorBounds &_bounds, std::vector< double > _vecSigma)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsChromInit.h:100: Warning: The following parameters of eoEsChromInit< EOT >::eoEsChromInit(eoRealVectorBounds &_bounds, std::vector< double > _vecSigma) are not documented:
+  parameter _vecSigma
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsFull.h:47: Warning: Member Type of class eoEsFull is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsFull.h:79: Warning: Member stdevs of class eoEsFull is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsFull.h:80: Warning: Member correlations of class eoEsFull is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsGlobalXover.h:47: Warning: Member FitT of class eoEsGlobalXover is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsGlobalXover.h:144: Warning: Member sel of class eoEsGlobalXover is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsGlobalXover.h:145: Warning: Member crossObj of class eoEsGlobalXover is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsGlobalXover.h:146: Warning: Member crossMut of class eoEsGlobalXover is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsGlobalXover.h:61: Warning: argument `_pop' of command @param is not found in the argument list of eoEsGlobalXover< EOT >::apply(eoPopulator< EOT > &_plop)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsGlobalXover.h:61: Warning: The following parameters of eoEsGlobalXover< EOT >::apply(eoPopulator< EOT > &_plop) are not documented:
+  parameter _plop
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsMutationInit.h:64: Warning: Found unknown command `\tau'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsMutationInit.h:101: Warning: Member section(void) of class eoEsMutationInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsMutationInit.h:103: Warning: Member TauLclName(void) const  of class eoEsMutationInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsMutationInit.h:104: Warning: Member TauLclShort(void) const  of class eoEsMutationInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsMutationInit.h:106: Warning: Member TauGlbName(void) const  of class eoEsMutationInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsMutationInit.h:107: Warning: Member TauGlbShort(void) const  of class eoEsMutationInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsMutationInit.h:109: Warning: Member TauBetaName(void) const  of class eoEsMutationInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsMutationInit.h:110: Warning: Member TauBetaShort(void) const  of class eoEsMutationInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsMutationInit.h:114: Warning: Member parser of class eoEsMutationInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsMutationInit.h:115: Warning: Member repSection of class eoEsMutationInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsMutationInit.h:116: Warning: Member TauLclParam of class eoEsMutationInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsMutationInit.h:117: Warning: Member TauGlbParam of class eoEsMutationInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsMutationInit.h:118: Warning: Member TauBetaParam of class eoEsMutationInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsMutationInit.h:52: Warning: Found unknown command `\tau'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsSimple.h:46: Warning: Member Type of class eoEsSimple is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsSimple.h:64: Warning: Member stdev of class eoEsSimple is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsStandardXover.h:49: Warning: Member FitT of class eoEsStandardXover is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsStandardXover.h:82: Warning: Member cross_self_adapt(eoEsSimple< FitT > &_parent1, const eoEsSimple< FitT > &_parent2) of class eoEsStandardXover is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsStandardXover.h:87: Warning: Member cross_self_adapt(eoEsStdev< FitT > &_parent1, const eoEsStdev< FitT > &_parent2) of class eoEsStandardXover is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsStandardXover.h:97: Warning: Member cross_self_adapt(eoEsFull< FitT > &_parent1, const eoEsFull< FitT > &_parent2) of class eoEsStandardXover is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsStandardXover.h:115: Warning: Member sel of class eoEsStandardXover is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsStandardXover.h:116: Warning: Member crossObj of class eoEsStandardXover is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsStandardXover.h:117: Warning: Member crossMut of class eoEsStandardXover is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsStdev.h:43: Warning: Member Type of class eoEsStdev is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoEsStdev.h:67: Warning: Member stdevs of class eoEsStdev is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoEvalContinue.h:62: Warning: Member className(void) const  of class eoEvalContinue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoEvalContinue.h:64: Warning: Member eval of class eoEvalContinue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoEvalContinue.h:65: Warning: Member repTotalEvaluations of class eoEvalContinue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoEvalFunc.h:44: Warning: Member EOType of class eoEvalFunc is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoEvalFunc.h:46: Warning: Member EOFitT of class eoEvalFunc is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoEvalFuncCounter.h:41: Warning: Member eoEvalFuncCounter(eoEvalFunc< EOT > &_func, std::string _name="Eval. ") of class eoEvalFuncCounter is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoEvalFuncCounter.h:53: Warning: Member func of class eoEvalFuncCounter is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoEvalFuncPtr.h:62: Warning: Member evalFunc)(FunctionArg) of class eoEvalFuncPtr is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTreeOp.h:208: Warning: Member EoType of class eoExpansionMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTreeOp.h:262: Warning: Member max_length of class eoExpansionMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTreeOp.h:263: Warning: Member initializer of class eoExpansionMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/other/eoExternalOpFunctions.h:132: Warning: Member eoExternalBinOp(bool(*_binop)(External &, const External &)) of class eoExternalBinOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/other/eoExternalOpFunctions.h:141: Warning: Member binop)(External &, const External &) of class eoExternalBinOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/other/eoExternalEO.h:54: Warning: Member eoExternalEO(std::istream &is, const External &ext) of class eoExternalEO is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/other/eoExternalOpFunctions.h:77: Warning: Member eoExternalEvalFunc(F(*_eval)(const External &)) of class eoExternalEvalFunc is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/other/eoExternalOpFunctions.h:87: Warning: Member eval)(const External &) of class eoExternalEvalFunc is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/other/eoExternalOpFunctions.h:50: Warning: Member eoExternalInit(External(*_init)(void)) of class eoExternalInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/other/eoExternalOpFunctions.h:61: Warning: Member init)(void) of class eoExternalInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/other/eoExternalOpFunctions.h:106: Warning: Member eoExternalMonOp(bool(*_mutate)(External &)) of class eoExternalMonOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/other/eoExternalOpFunctions.h:115: Warning: Member mutate)(External &) of class eoExternalMonOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/other/eoExternalOpFunctions.h:158: Warning: Member eoExternalQuadOp(bool(*_quadop)(External &, External &)) of class eoExternalQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/other/eoExternalOpFunctions.h:167: Warning: Member quadop)(External &, External &) of class eoExternalQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFDCStat.h:135: Warning: Member FDCstat of class eoFDCFileSnapshot is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFDCStat.h:94: Warning: Member theFit() of class eoFDCStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFDCStat.h:98: Warning: Member dist of class eoFDCStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFDCStat.h:99: Warning: Member theBest of class eoFDCStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFDCStat.h:100: Warning: Member boolOpt of class eoFDCStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFDCStat.h:101: Warning: Member distToBest of class eoFDCStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFDCStat.h:102: Warning: Member fitnesses of class eoFDCStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFileMonitor.h:50: Warning: Member eoFileMonitor(std::string _filename, std::string _delim=" ", bool _keep=false, bool _header=false) of class eoFileMonitor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFileMonitor.h:62: Warning: Member operator()(std::ostream &os) of class eoFileMonitor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFileMonitor.h:64: Warning: Member printHeader(void) of class eoFileMonitor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFileMonitor.h:65: Warning: Member printHeader(std::ostream &os) of class eoFileMonitor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFileMonitor.h:67: Warning: Member getFileName() of class eoFileMonitor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFileMonitor.h:70: Warning: Member filename of class eoFileMonitor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFileMonitor.h:71: Warning: Member delim of class eoFileMonitor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFileMonitor.h:72: Warning: Member keep of class eoFileMonitor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFileMonitor.h:73: Warning: Member header of class eoFileMonitor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFileMonitor.h:74: Warning: Member firstcall of class eoFileMonitor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFileSnapshot.h:56: Warning: Member vDouble of class eoFileSnapshot is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFileSnapshot.h:57: Warning: Member vDoubleParam of class eoFileSnapshot is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFileSnapshot.h:63: Warning: Member eoFileSnapshot(std::string _dirname, unsigned _frequency=1, std::string _filename="gen", std::string _delim=" ", unsigned _counter=0, bool _rmFiles=true) of class eoFileSnapshot is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFileSnapshot.h:166: Warning: Member getDirName() of class eoFileSnapshot is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFileSnapshot.h:168: Warning: Member baseFileName() of class eoFileSnapshot is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFileSnapshot.h:181: Warning: Member dirname of class eoFileSnapshot is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFileSnapshot.h:182: Warning: Member frequency of class eoFileSnapshot is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFileSnapshot.h:183: Warning: Member filename of class eoFileSnapshot is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFileSnapshot.h:184: Warning: Member delim of class eoFileSnapshot is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFileSnapshot.h:185: Warning: Member counter of class eoFileSnapshot is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFileSnapshot.h:186: Warning: Member currentFileName of class eoFileSnapshot is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoFileSnapshot.h:187: Warning: Member boolChanged of class eoFileSnapshot is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFitContinue.h:60: Warning: Member className(void) const  of class eoFitContinue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFitContinue.h:62: Warning: Member maximum of class eoFitContinue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFitnessScalingSelect.h:50: Warning: Member scaling of class eoFitnessScalingSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoMOFitnessStat.h:43: Warning: Member eoFitnessStat(std::string _description="AllFitnesses") of class eoFitnessStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFlOrBinOp.h:185: Warning: Member AtomType of class eoFlOr1ptBinOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFlOrQuadOp.h:177: Warning: Member AtomType of class eoFlOr1ptQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFlOrBinOp.h:53: Warning: Member AtomType of class eoFlOrAllAtomBinOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFlOrBinOp.h:81: Warning: Member rate of class eoFlOrAllAtomBinOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFlOrBinOp.h:82: Warning: Member op of class eoFlOrAllAtomBinOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFlOrQuadOp.h:50: Warning: Member AtomType of class eoFlOrAllAtomQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFlOrQuadOp.h:73: Warning: Member rate of class eoFlOrAllAtomQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFlOrQuadOp.h:74: Warning: Member op of class eoFlOrAllAtomQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFlOrMonOp.h:49: Warning: Member AtomType of class eoFlOrAllMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFlOrMonOp.h:74: Warning: Member atomMutation of class eoFlOrAllMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFlOrMonOp.h:75: Warning: Member rate of class eoFlOrAllMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFlOrBinOp.h:96: Warning: Member AtomType of class eoFlOrKAtomBinOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFlOrBinOp.h:125: Warning: Member k of class eoFlOrKAtomBinOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFlOrBinOp.h:126: Warning: Member op of class eoFlOrKAtomBinOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFlOrQuadOp.h:88: Warning: Member AtomType of class eoFlOrKAtomQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFlOrQuadOp.h:117: Warning: Member k of class eoFlOrKAtomQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFlOrQuadOp.h:118: Warning: Member op of class eoFlOrKAtomQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFlOrMonOp.h:86: Warning: Member AtomType of class eoFlOrKMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFlOrMonOp.h:113: Warning: Member nb of class eoFlOrKMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFlOrMonOp.h:114: Warning: Member atomMutation of class eoFlOrKMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFlOrBinOp.h:140: Warning: Member AtomType of class eoFlOrUniformBinOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFlOrBinOp.h:172: Warning: Member rate of class eoFlOrUniformBinOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFlOrQuadOp.h:131: Warning: Member AtomType of class eoFlOrUniformQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFlOrQuadOp.h:165: Warning: Member rate of class eoFlOrUniformQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoFunctorStore.h:67: Warning: Member vec of class eoFunctorStore is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoG3Replacement.h:58: Warning: Member eoG3Replacement(eoHowMany _howManyEliminatedParents=eoHowMany(2, false)) of class eoG3Replacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoG3Replacement.h:81: Warning: Member split of class eoG3Replacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoG3Replacement.h:82: Warning: Member reduce of class eoG3Replacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoG3Replacement.h:83: Warning: Member plus of class eoG3Replacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoGenContinue.h:81: Warning: Member className(void) const  of class eoGenContinue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoGenContinue.h:99: Warning: Member verbose of class eoGenContinue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoGenContinue.h:94: Warning: Member repTotalGenerations of class eoGenContinue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoGenContinue.h:95: Warning: Member thisGenerationPlaceHolder of class eoGenContinue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoGenContinue.h:96: Warning: Member thisGeneration of class eoGenContinue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPersistent.h:58: Warning: argument `_is' of command @param is not found in the argument list of eoGenContinue< EOT >::readFrom(std::istream &__is)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPersistent.h:58: Warning: The following parameters of eoGenContinue< EOT >::readFrom(std::istream &__is) are not documented:
+  parameter __is
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPrintable.h:49: Warning: argument `_os' of command @param is not found in the argument list of eoGenContinue< EOT >::printOn(std::ostream &__os) const
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPrintable.h:49: Warning: The following parameters of eoGenContinue< EOT >::printOn(std::ostream &__os) const are not documented:
+  parameter __os
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthMutation.h:88: Warning: Member className() const =0 of class eoGeneDelChooser is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoGeneralBreeder.h:100: Warning: Member select of class eoGeneralBreeder is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoGeneralBreeder.h:101: Warning: Member op of class eoGeneralBreeder is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoGeneralBreeder.h:102: Warning: Member howMany of class eoGeneralBreeder is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:574: Warning: Member operator=(const eoGeneralIntBounds &_b) of class eoGeneralIntBounds is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:637: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:641: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:645: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:650: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:655: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:688: Warning: Member repBound of class eoGeneralIntBounds is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:539: Warning: Member operator=(const eoGeneralRealBounds &_b) of class eoGeneralRealBounds is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:602: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:606: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:610: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:615: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:648: Warning: Member repBound of class eoGeneralRealBounds is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoGenOp.h:68: Warning: Member className() const =0 of class eoGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoGnuplot.h:44: Warning: Unsupported html tag  found
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoGnuplot1DMonitor.h:66: Warning: Member FirstPlot() of class eoGnuplot1DMonitor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoGnuplot1DSnapshot.h:61: Warning: Member eoGnuplot1DSnapshot(std::string _dirname, unsigned _frequency=1, std::string _filename="gen", std::string _delim=" ", unsigned _counter=0, bool _rmFiles=true) of class eoGnuplot1DSnapshot is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoGnuplot1DSnapshot.h:70: Warning: Member eoGnuplot1DSnapshot(std::string _dirname, eoRealVectorBounds &_bounds, unsigned _frequency=1, std::string _filename="gen", std::string _delim=" ", unsigned _counter=0, bool _rmFiles=true) of class eoGnuplot1DSnapshot is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoGnuplot1DSnapshot.h:78: Warning: Member eoGnuplot1DSnapshot(eoFileSnapshot &_fSnapshot) of class eoGnuplot1DSnapshot is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoGnuplot1DSnapshot.h:85: Warning: Member eoGnuplot1DSnapshot(eoFileSnapshot &_fSnapshot, eoRealVectorBounds &_bounds) of class eoGnuplot1DSnapshot is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoGnuplot1DSnapshot.h:98: Warning: Member handleBounds(eoRealVectorBounds &_bounds) of class eoGnuplot1DSnapshot is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoGnuplot1DSnapshot.h:111: Warning: Member setPointSize(unsigned _pointSize) of class eoGnuplot1DSnapshot is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoGnuplot1DSnapshot.h:115: Warning: Member pointSize of class eoGnuplot1DSnapshot is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTreeOp.h:340: Warning: Member EoType of class eoHoistMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTreeOp.h:341: Warning: argument `none' of command @param is not found in the argument list of eoHoistMutation< FType, Node >::eoHoistMutation()
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoHowMany.h:149: Warning: Member readFrom(std::string _value) of class eoHowMany is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoHowMany.h:186: Warning: Member rate of class eoHowMany is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoHowMany.h:187: Warning: Member combien of class eoHowMany is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoHowMany.h:72: Warning: argument `rate' of command @param is not found in the argument list of eoHowMany::eoHowMany(double _rate=0.0, bool _interpret_as_rate=true)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoHowMany.h:72: Warning: The following parameters of eoHowMany::eoHowMany(double _rate=0.0, bool _interpret_as_rate=true) are not documented:
+  parameter _rate
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdater.h:61: Warning: Member className(void) const  of class eoIncrementor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdater.h:63: Warning: Member counter of class eoIncrementor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdater.h:64: Warning: Member stepsize of class eoIncrementor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdater.h:93: Warning: Member className(void) const  of class eoIncrementorParam is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdater.h:96: Warning: Member stepsize of class eoIncrementorParam is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoInit.h:160: Warning: Member eoInitAdaptor(eoInit< EOT > &_init) of class eoInitAdaptor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoInit.h:169: Warning: Member init of class eoInitAdaptor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoInit.h:152: Warning: End of list marker found without any preceding list items
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoInit.h:85: Warning: Member AtomType of class eoInitFixedLength is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoInit.h:88: Warning: Member eoInitFixedLength(unsigned _combien, eoRndGenerator< AtomType > &_generator) of class eoInitFixedLength is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoInit.h:98: Warning: Member combien of class eoInitFixedLength is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoInit.h:74: Warning: Member init of class eoInitGenerator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoInit.h:110: Warning: Member AtomType of class eoInitVariableLength is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoInit.h:141: Warning: Member atomInit() of class eoInitVariableLength is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoInit.h:144: Warning: Member offset of class eoInitVariableLength is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoInit.h:145: Warning: Member extent of class eoInitVariableLength is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoInit.h:146: Warning: Member init of class eoInitVariableLength is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/MGE/eoInitVirus.h:45: Warning: Member eoInitVirus(unsigned _combien, eoRndGenerator< bool > &_generator) of class eoInitVirus is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/MGE/eoInitVirus.h:59: Warning: Member combien of class eoInitVirus is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/MGE/eoInitVirus.h:70: Warning: Member eoInitVirus1bit(unsigned _combien, eoRndGenerator< bool > &_generator) of class eoInitVirus1bit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/MGE/eoInitVirus.h:82: Warning: Member combien of class eoInitVirus1bit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthCrossover.h:176: Warning: Member AtomType of class eoInnerExchangeQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthCrossover.h:197: Warning: Member className() const  of class eoInnerExchangeQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthCrossover.h:202: Warning: Member rate of class eoInnerExchangeQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthCrossover.h:203: Warning: Member op of class eoInnerExchangeQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:131: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:127: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:135: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:140: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:470: Warning: Member random(eoRng &_rng=eo::rng) const  of class eoIntAboveBound is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:533: Warning: Member repMaximum of class eoIntAboveBound is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:127: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:131: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:135: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:140: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:372: Warning: Member random(eoRng &_rng=eo::rng) const  of class eoIntBelowBound is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:435: Warning: Member repMinimum of class eoIntBelowBound is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:127: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:131: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:135: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:140: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:145: Warning: Member random(eoRng &_rng=eo::rng) const =0 of class eoIntBounds is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:127: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:131: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:135: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:140: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:255: Warning: Member random(eoRng &_rng=eo::rng) const  of class eoIntInterval is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:336: Warning: Member repMinimum of class eoIntInterval is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:337: Warning: Member repMaximum of class eoIntInterval is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:338: Warning: Member repRange of class eoIntInterval is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:127: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:131: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:135: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:140: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoIntBounds.h:184: Warning: Member random(eoRng &_rng=eo::rng) const  of class eoIntNoBounds is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoInvalidateOps.h:83: Warning: Member eoInvalidateBinOp(eoBinOp< EOT > &_op) of class eoInvalidateBinOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoInvalidateOps.h:97: Warning: Member op of class eoInvalidateBinOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoInvalidateOps.h:49: Warning: Member eoInvalidateMonOp(eoMonOp< EOT > &_op) of class eoInvalidateMonOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoInvalidateOps.h:63: Warning: Member op of class eoInvalidateMonOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoInvalidateOps.h:117: Warning: Member eoInvalidateQuadOp(eoQuadOp< EOT > &_op) of class eoInvalidateQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoInvalidateOps.h:131: Warning: Member op of class eoInvalidateQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoLinearFitScaling.h:54: Warning: Member eoLinearFitScaling(double _p=2.0) of class eoLinearFitScaling is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoLinearFitScaling.h:87: Warning: Member pressure of class eoLinearFitScaling is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceSplit.h:196: Warning: Member howMany of class eoLinearRandomSplit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceSplit.h:197: Warning: Member returnEliminated of class eoLinearRandomSplit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceSplit.h:118: Warning: Member howMany of class eoLinearTruncateSplit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceSplit.h:119: Warning: Member returnEliminated of class eoLinearTruncateSplit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/node_pool.h:25: Warning: Member MemPool(unsigned int sz) of class MemPool is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/node_pool.h:38: Warning: Member allocate() of class MemPool is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/node_pool.h:46: Warning: Member deallocate(void *b) of class MemPool is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/node_pool.h:55: Warning: Member grow() of class MemPool is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/node_pool.h:85: Warning: Member chunks of class MemPool is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/node_pool.h:86: Warning: Member esize of class MemPool is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/node_pool.h:87: Warning: Member head of class MemPool is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoMergeReduce.h:55: Warning: Member eoMergeReduce(eoMerge< EOT > &_merge, eoReduce< EOT > &_reduce) of class eoMergeReduce is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoMergeReduce.h:65: Warning: Member merge of class eoMergeReduce is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoMergeReduce.h:66: Warning: Member reduce of class eoMergeReduce is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoMGGReplacement.h:58: Warning: Member eoMGGReplacement(eoHowMany _howManyEliminatedParents=eoHowMany(2, false), unsigned _tSize=2) of class eoMGGReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoMGGReplacement.h:98: Warning: Member split of class eoMGGReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoMGGReplacement.h:99: Warning: Member plus of class eoMGGReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoMGGReplacement.h:100: Warning: Member tSize of class eoMGGReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoParetoFitness.cpp:40: Warning: Member maximizing(int) of class MinimizingTraits is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoMOFitnessStat.h:88: Warning: Member objective of class eoMOFitnessStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoCloneOps.h:49: Warning: Member className() const  of class eoMonCloneOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoGenOp.h:88: Warning: Member eoMonGenOp(eoMonOp< EOT > &_op) of class eoMonGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoGenOp.h:98: Warning: Member className() const  of class eoMonGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoGenOp.h:100: Warning: Member op of class eoMonGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoMonitor.h:50: Warning: Member lastCall() of class eoMonitor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoMonitor.h:58: Warning: Member className(void) const  of class eoMonitor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoMonitor.h:61: Warning: Member iterator of class eoMonitor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoMonitor.h:62: Warning: Member vec of class eoMonitor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoOp.h:107: Warning: Member className() const  of class eoMonOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/do/make_algo_pareto.h:48: Warning: Member eoNDPlusReplacement(eoPerf2Worth< EOT, WorthT > &_perf2worth) of class eoNDPlusReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoPareto.cpp:95: Warning: Member eoNDPlusReplacement(eoPerf2Worth< EOT, WorthT > &_perf2worth) of class eoNDPlusReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/do/make_algo_pareto.h:70: Warning: Member perf2worth of class eoNDPlusReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/t-eoPareto.cpp:119: Warning: Member perf2worth of class eoNDPlusReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoNDSorting.h:49: Warning: Member eoNDSorting(bool nasty_flag_=false) of class eoNDSorting is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoNDSorting.h:373: Warning: Member nasty_declone_flag_that_only_is_implemented_for_two_objectives of class eoNDSorting is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoNDSorting.h:100: Warning: Member one_objective(const eoPop< EOT > &_pop) of class eoNDSorting is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoNDSorting.h:273: Warning: Member m_objectives(const eoPop< EOT > &_pop) of class eoNDSorting is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoNDSorting.h:360: Warning: Member rank_to_worth() of class eoNDSorting is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoNDSorting.h:96: Warning: Member index of class eoNDSorting::DummyEO is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoNDSorting.h:383: Warning: Member eoNDSorting_I(double _nicheSize, bool nasty_flag_=false) of class eoNDSorting_I is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoNDSorting.h:416: Warning: Member nicheSize of class eoNDSorting_I is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoNDSorting.h:440: Warning: Member double_index_pair of class eoNDSorting_II is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoNDSorting.h:438: Warning: Member eoNDSorting_II(bool nasty_flag_=false) of class eoNDSorting_II is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:159: Warning: Member negexp_generator(T _mean=1.0, eoRng &_rng=rng) of class negexp_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:161: Warning: Member operator()(void) of class negexp_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:164: Warning: Member mean of class negexp_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:165: Warning: Member negexp of class negexp_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRndGenerators.h:140: Warning: Member eoNegExpGenerator(T _mean=1.0, eoRng &_rng=rng) of class eoNegExpGenerator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRndGenerators.h:145: Warning: Member mean of class eoNegExpGenerator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRndGenerators.h:146: Warning: Member negexp of class eoNegExpGenerator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUniformInit.h:146: Warning: Member eoNegExpInit(T _mean=1.0, eoRng &_rng=rng) of class eoNegExpInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUniformInit.h:151: Warning: Member mean of class eoNegExpInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUniformInit.h:152: Warning: Member negexp of class eoNegExpInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/gen/NodeSelector.h:44: Warning: Member select_node(Sym sym) const =0 of class NodeSelector is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:142: Warning: Member normal_generator(T _stdev=T(1.0), eoRng &_rng=rng) of class normal_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:144: Warning: Member operator()(void) of class normal_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:147: Warning: Member stdev of class normal_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:148: Warning: Member normal of class normal_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRndGenerators.h:123: Warning: Member eoNormalGenerator(T _stdev=T(1.0), eoRng &_rng=rng) of class eoNormalGenerator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRndGenerators.h:128: Warning: Member stdev of class eoNormalGenerator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRndGenerators.h:129: Warning: Member normal of class eoNormalGenerator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUniformInit.h:129: Warning: Member eoNormalInit(T _stdev=T(1.0), eoRng &_rng=rng) of class eoNormalInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUniformInit.h:134: Warning: Member stdev of class eoNormalInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUniformInit.h:135: Warning: Member normal of class eoNormalInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoNormalMutation.h:166: Warning: Member sigma of class eoNormalMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoNormalMutation.h:167: Warning: Member bounds of class eoNormalMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoNormalMutation.h:168: Warning: Member p_change of class eoNormalMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoNormalMutation.h:102: Warning: Member sigma of class eoNormalVecMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoNormalMutation.h:103: Warning: Member bounds of class eoNormalVecMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoNormalMutation.h:104: Warning: Member p_change of class eoNormalVecMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoRandomSelect.h:94: Warning: Member current of class eoNoSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoBitOp.h:376: Warning: Member num_points of class eoNPtsBitXover is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:217: Warning: Member Fitness of class eoNthElementFitnessStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:220: Warning: Member eoNthElementFitnessStat(unsigned _whichElement, std::string _description="nth element fitness") of class eoNthElementFitnessStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:230: Warning: Member className(void) const  of class eoNthElementFitnessStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:252: Warning: Member doit(const eoPop< EOT > &_pop, eoParetoFitness< T >) of class eoNthElementFitnessStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:271: Warning: Member doit(const std::vector< const EOT * > &_pop, T) of class eoNthElementFitnessStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:275: Warning: Member whichElement of class eoNthElementFitnessStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoNormalMutation.h:184: Warning: Member Fitness of class eoOneFifthMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoNormalMutation.h:264: Warning: Member eval of class eoOneFifthMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoNormalMutation.h:265: Warning: Member threshold of class eoOneFifthMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoNormalMutation.h:266: Warning: Member updateFactor of class eoOneFifthMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoNormalMutation.h:267: Warning: Member nbMut of class eoOneFifthMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoNormalMutation.h:268: Warning: Member nbSuccess of class eoOneFifthMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoNormalMutation.h:269: Warning: Member genIndex of class eoOneFifthMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoNormalMutation.h:186: Warning: argument `eval' of command @param is not found in the argument list of eoOneFifthMutation< EOT >::eoOneFifthMutation(eoEvalFunc< EOT > &_eval, double &_sigmaInit, unsigned _windowSize=10, double _updateFactor=0.83, double _threshold=0.2)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoNormalMutation.h:186: Warning: The following parameters of eoOneFifthMutation< EOT >::eoOneFifthMutation(eoEvalFunc< EOT > &_eval, double &_sigmaInit, unsigned _windowSize=10, double _updateFactor=0.83, double _threshold=0.2) are not documented:
+  parameter _eval
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson5/eoOneMax.h:96: Warning: Member setB(vector< bool > &_b) of class eoOneMax is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson5/eoOneMax.h:100: Warning: Member B() of class eoOneMax is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson5/eoOneMax.h:106: Warning: Member b of class eoOneMax is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson5/eoOneMaxEvalFunc.h:39: Warning: argument `EOT' of command @param is not found in the argument list of eoOneMaxEvalFunc< EOT >::operator()(EOT &_eo)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson5/eoOneMaxEvalFunc.h:39: Warning: The following parameters of eoOneMaxEvalFunc< EOT >::operator()(EOT &_eo) are not documented:
+  parameter _eo
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson5/eoOneMaxInit.h:57: Warning: Member vecSize of class eoOneMaxInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoOpContainer.h:70: Warning: Member className() const =0 of class eoOpContainer is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoOpContainer.h:74: Warning: Member rates of class eoOpContainer is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoOpContainer.h:75: Warning: Member ops of class eoOpContainer is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoOpContainer.h:78: Warning: Member store of class eoOpContainer is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoOpContainer.h:79: Warning: Member max_to_produce of class eoOpContainer is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoOpSelMason.h:42: Warning: Member vOpP of class eoOpSelMason is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoOpSelMason.h:43: Warning: Member MEV of class eoOpSelMason is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoOpSelMason.h:104: Warning: Member allocMap of class eoOpSelMason is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoOpSelMason.h:105: Warning: Member operatorFactory of class eoOpSelMason is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParam.h:118: Warning: Member repLongName of class eoParam is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParam.h:119: Warning: Member repDefault of class eoParam is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParam.h:120: Warning: Member repDescription of class eoParam is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParam.h:121: Warning: Member repShortHand of class eoParam is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParam.h:122: Warning: Member repRequired of class eoParam is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.h:90: Warning: Member ownedParams of class eoParameterLoader is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.h:59: Warning: argument `_shortName' of command @param is not found in the argument list of eoParameterLoader::createParam(ValueType _defaultValue, std::string _longName, std::string _description, char _shortHand=0, std::string _section="", bool _required=false)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.h:59: Warning: The following parameters of eoParameterLoader::createParam(ValueType _defaultValue, std::string _longName, std::string _description, char _shortHand=0, std::string _section="", bool _required=false) are not documented:
+  parameter _shortHand
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParam.h:377: Warning: Member eoParamParamType(std::string _value) of class eoParamParamType is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParam.h:382: Warning: Member printOn(std::ostream &_os) const  of class eoParamParamType is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParam.h:403: Warning: Member readFrom(std::istream &_is) of class eoParamParamType is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParam.h:411: Warning: Member readFrom(std::string &_value) of class eoParamParamType is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoFitness.h:112: Warning: Member fitness_traits of class eoParetoFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoFitness.h:117: Warning: Member eoParetoFitness(std::vector< double > &_v) of class eoParetoFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoFitness.h:182: Warning: Member operator>(const eoParetoFitness< FitnessTraits > &_other) const  of class eoParetoFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoFitness.h:187: Warning: Member operator<=(const eoParetoFitness< FitnessTraits > &_other) const  of class eoParetoFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoFitness.h:192: Warning: Member operator>=(const eoParetoFitness< FitnessTraits > &_other) const  of class eoParetoFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoFitness.h:197: Warning: Member operator==(const eoParetoFitness< FitnessTraits > &_other) const  of class eoParetoFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoFitness.h:209: Warning: Member operator!=(const eoParetoFitness< FitnessTraits > &_other) const  of class eoParetoFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoFitness.h:124: Warning: Member maximizing(unsigned _i) of class eoParetoFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoFitness.h:46: Warning: Member nObjectives() of class eoParetoFitnessTraits is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoFitness.h:47: Warning: Member tol() of class eoParetoFitnessTraits is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoFitness.h:48: Warning: Member maximizing(int which) of class eoParetoFitnessTraits is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoConstraintFitness.h:69: Warning: Member fitness_traits of class eoParetoOneConstraintFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoConstraintFitness.h:76: Warning: Member eoParetoOneConstraintFitness(std::vector< double > &_v) of class eoParetoOneConstraintFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoConstraintFitness.h:88: Warning: Member eoParetoOneConstraintFitness(std::vector< double > &_v, double _c) of class eoParetoOneConstraintFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoConstraintFitness.h:102: Warning: Member feasible() const  of class eoParetoOneConstraintFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoConstraintFitness.h:103: Warning: Member violation() const  of class eoParetoOneConstraintFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoConstraintFitness.h:104: Warning: Member ConstraintValue() const  of class eoParetoOneConstraintFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoConstraintFitness.h:105: Warning: Member ConstraintValue(double _c) of class eoParetoOneConstraintFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoConstraintFitness.h:173: Warning: Member operator>(const eoParetoOneConstraintFitness< FitnessTraits > &_other) const  of class eoParetoOneConstraintFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoConstraintFitness.h:178: Warning: Member operator<=(const eoParetoOneConstraintFitness< FitnessTraits > &_other) const  of class eoParetoOneConstraintFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoConstraintFitness.h:183: Warning: Member operator>=(const eoParetoOneConstraintFitness< FitnessTraits > &_other) const  of class eoParetoOneConstraintFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoConstraintFitness.h:188: Warning: Member operator==(const eoParetoOneConstraintFitness< FitnessTraits > &_other) const  of class eoParetoOneConstraintFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoConstraintFitness.h:200: Warning: Member operator!=(const eoParetoOneConstraintFitness< FitnessTraits > &_other) const  of class eoParetoOneConstraintFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoConstraintFitness.h:100: Warning: Member maximizing(unsigned _i) of class eoParetoOneConstraintFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoConstraintFitness.h:66: Warning: Member constraintValue of class eoParetoOneConstraintFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoRanking.h:48: Warning: Member eoParetoRanking(eoDominanceMap< EOT > &_dominanceMap) of class eoParetoRanking is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoRanking.h:68: Warning: Member dominanceMap of class eoParetoRanking is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.h:142: Warning: Member ProgramName() of class eoParser is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.h:235: Warning: Member getStopOnUnknownParam() of class eoParser is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.h:240: Warning: Member resetPrefix() of class eoParser is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.h:242: Warning: Member getPrefix() of class eoParser is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.h:252: Warning: Member MultiMapType of class eoParser is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.h:260: Warning: Member ShortNameMapType of class eoParser is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.h:263: Warning: Member LongNameMapType of class eoParser is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.h:246: Warning: Member doRegisterParam(eoParam ¶m) const  of class eoParser is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.h:248: Warning: Member getValue(eoParam &_param) const  of class eoParser is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.h:250: Warning: Member updateParameters() const  of class eoParser is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.h:255: Warning: Member params of class eoParser is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.h:257: Warning: Member programName of class eoParser is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.h:258: Warning: Member programDescription of class eoParser is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.h:261: Warning: Member shortNameMap of class eoParser is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.h:264: Warning: Member longNameMap of class eoParser is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.h:266: Warning: Member needHelp of class eoParser is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.h:267: Warning: Member stopOnUnknownParam of class eoParser is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.h:269: Warning: Member messages of class eoParser is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.h:271: Warning: Member prefix of class eoParser is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPersistent.h:58: Warning: argument `_is' of command @param is not found in the argument list of eoParser::readFrom(std::istream &is)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPersistent.h:58: Warning: The following parameters of eoParser::readFrom(std::istream &is) are not documented:
+  parameter is
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPrintable.h:49: Warning: argument `_os' of command @param is not found in the argument list of eoParser::printOn(std::ostream &os) const
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPrintable.h:49: Warning: The following parameters of eoParser::printOn(std::ostream &os) const are not documented:
+  parameter os
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.h:194: Warning: argument `_shortName' of command @param is not found in the argument list of eoParser::setORcreateParam(ValueType _defaultValue, std::string _longName, std::string _description, char _shortHand=0, std::string _section="", bool _required=false)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParser.h:194: Warning: The following parameters of eoParser::setORcreateParam(ValueType _defaultValue, std::string _longName, std::string _description, char _shortHand=0, std::string _section="", bool _required=false) are not documented:
+  parameter _shortHand
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTree.h:64: Warning: Member Subtree of class eoParseTree is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTree.h:67: Warning: Member reference of class eoParseTree is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTree.h:68: Warning: Member const_reference of class eoParseTree is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTreeDepthInit.h:60: Warning: Member EoType of class eoParseTreeDepthInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTreeDepthInit.h:120: Warning: Member generate(std::list< Node > &sequence, int the_max, int last_terminal=-1) of class eoParseTreeDepthInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTreeDepthInit.h:162: Warning: Member max_depth of class eoParseTreeDepthInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTreeDepthInit.h:163: Warning: Member initializor of class eoParseTreeDepthInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTreeDepthInit.h:164: Warning: Member grow of class eoParseTreeDepthInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTreeDepthInit.h:165: Warning: Member ramped_half_and_half of class eoParseTreeDepthInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTreeDepthInit.h:166: Warning: Member current_depth of class eoParseTreeDepthInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTreeDepthInit.h:62: Warning: Found unknown command `\parm'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTreeDepthInit.h:62: Warning: The following parameters of eoParseTreeDepthInit< FType, Node >::eoParseTreeDepthInit(unsigned _max_depth, const std::vector< Node > &_initializor, bool _grow=true, bool _ramped_half_and_half=false) are not documented:
+  parameter _max_depth
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoPBILAdditive.h:113: Warning: Member maxBound of class eoPBILAdditive is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoPBILAdditive.h:113: Warning: Member minBound of class eoPBILAdditive is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoPBILAdditive.h:114: Warning: Member LR of class eoPBILAdditive is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoPBILAdditive.h:115: Warning: Member nbBest of class eoPBILAdditive is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoPBILAdditive.h:116: Warning: Member nbWorst of class eoPBILAdditive is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoPBILAdditive.h:117: Warning: Member lrb of class eoPBILAdditive is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoPBILAdditive.h:117: Warning: Member lrw of class eoPBILAdditive is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoPBILDistrib.h:92: Warning: Member size() of class eoPBILDistrib is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoPBILDistrib.h:97: Warning: Member genomeSize of class eoPBILDistrib is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoPBILOrg.h:74: Warning: Member LR of class eoPBILOrg is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoPBILOrg.h:75: Warning: Member maxBound of class eoPBILOrg is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoPBILOrg.h:75: Warning: Member minBound of class eoPBILOrg is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPerf2Worth.h:100: Warning: Member resize(eoPop< EOT > &_pop, unsigned sz) of class eoPerf2Worth is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:207: Warning: Member operator()(eoPop< EOT > &_pop) of class eoPerf2Worth is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPerf2Worth.h:87: Warning: Member compare_worth(const std::vector< WorthT > &_worths) of class eoPerf2Worth::compare_worth is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPerf2Worth.h:89: Warning: Member operator()(unsigned a, unsigned b) const  of class eoPerf2Worth::compare_worth is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPerf2Worth.h:95: Warning: Member worths of class eoPerf2Worth::compare_worth is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPerf2Worth.h:117: Warning: Member eoPerf2WorthCached(std::string _description="Worths") of class eoPerf2WorthCached is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPerf2Worth.h:216: Warning: Member resize(eoPop< EOT > &_pop, unsigned sz) of class eoPerf2WorthCached is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPerf2Worth.h:223: Warning: Member fitness_cache of class eoPerf2WorthCached is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPerf2Worth.h:203: Warning: Member compare_worth(const std::vector< WorthT > &_worths) of class eoPerf2WorthCached::compare_worth is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPerf2Worth.h:206: Warning: Member operator()(unsigned a, unsigned b) const  of class eoPerf2WorthCached::compare_worth is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPerf2Worth.h:212: Warning: Member worths of class eoPerf2WorthCached::compare_worth is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoMergeReduce.h:79: Warning: Member plus of class eoPlusReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoMergeReduce.h:80: Warning: Member truncate of class eoPlusReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTreeOp.h:151: Warning: Member EoType of class eoPointMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTreeOp.h:194: Warning: Member initializor of class eoPointMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPop.h:65: Warning: Member Fitness of class eoPop is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:222: Warning: Member fitness_traits of class eoPop is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPop.h:293: Warning: Member invalidate() of class eoPop is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:227: Warning: Member sort() of class eoPop is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:234: Warning: Member scale() of class eoPop is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:251: Warning: Member setPerf2Worth(eoPerf2Worth< EOT > &_p2w) of class eoPop is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:256: Warning: Member setPerf2Worth(eoPerf2Worth< EOT > *_p2w) of class eoPop is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:260: Warning: Member getPerf2Worth() of class eoPop is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:263: Warning: Member swap(eoPop< EOT > &other) of class eoPop is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/fitness_traits.cpp:273: Warning: Member p2w of class eoPop is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPop.h:85: Warning: argument `_popSize' of command @param is not found in the argument list of eoPop< EOT >::append(unsigned _newPopSize, eoInit< EOT > &_chromInit)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPop.h:85: Warning: The following parameters of eoPop< EOT >::append(unsigned _newPopSize, eoInit< EOT > &_chromInit) are not documented:
+  parameter _newPopSize
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPop.h:126: Warning: Member operator()(const EOT *a, const EOT *b) const  of class eoPop::Cmp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPop.h:122: Warning: Member operator()(const EOT &eot) of class eoPop::Ref is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPopEvalFunc.h:72: Warning: Member eval of class eoPopLoopEval is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoPopStat.h:83: Warning: Member combien of class eoPopStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPopulator.h:112: Warning: Member position_type of class eoPopulator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPopulator.h:44: Warning: Member eoPopulator(const eoPop< EOT > &_src, eoPop< EOT > &_dest) of class eoPopulator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPopulator.h:127: Warning: Member dest of class eoPopulator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPopulator.h:128: Warning: Member current of class eoPopulator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPopulator.h:129: Warning: Member src of class eoPopulator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPopulator.h:133: Warning: Member get_next() of class eoPopulator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoCounter.h:46: Warning: Member eoProcedureCounter(Procedure &_proc, std::string _name="proc_counter") of class eoProcedureCounter is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoCounter.h:76: Warning: Member proc of class eoProcedureCounter is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoProportionalCombinedOp.h:119: Warning: Member className() const  of class eoPropCombinedBinOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoProportionalCombinedOp.h:122: Warning: Member add(eoBinOp< EOT > &_op, const double _rate, bool _verbose=false) of class eoPropCombinedBinOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoProportionalCombinedOp.h:144: Warning: Member ops of class eoPropCombinedBinOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoProportionalCombinedOp.h:145: Warning: Member rates of class eoPropCombinedBinOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoProportionalCombinedOp.h:68: Warning: Member className() const  of class eoPropCombinedMonOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoProportionalCombinedOp.h:71: Warning: Member add(eoMonOp< EOT > &_op, const double _rate, bool _verbose=false) of class eoPropCombinedMonOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoProportionalCombinedOp.h:81: Warning: Member printOn(std::ostream &_os) of class eoPropCombinedMonOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoProportionalCombinedOp.h:97: Warning: Member ops of class eoPropCombinedMonOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoProportionalCombinedOp.h:98: Warning: Member rates of class eoPropCombinedMonOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoProportionalCombinedOp.h:173: Warning: Member className() const  of class eoPropCombinedQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoProportionalCombinedOp.h:177: Warning: Member add(eoQuadOp< EOT > &_op, const double _rate, bool _verbose=false) of class eoPropCombinedQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoProportionalCombinedOp.h:187: Warning: Member printOn(std::ostream &_os) of class eoPropCombinedQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoProportionalCombinedOp.h:203: Warning: Member ops of class eoPropCombinedQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoProportionalCombinedOp.h:204: Warning: Member rates of class eoPropCombinedQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPropGAGenOp.h:73: Warning: Member className() const  of class eoPropGAGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPropGAGenOp.h:77: Warning: Member wClone of class eoPropGAGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPropGAGenOp.h:78: Warning: Member cross of class eoPropGAGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPropGAGenOp.h:79: Warning: Member wCross of class eoPropGAGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPropGAGenOp.h:80: Warning: Member mut of class eoPropGAGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPropGAGenOp.h:81: Warning: Member wMut of class eoPropGAGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPropGAGenOp.h:82: Warning: Member propOp of class eoPropGAGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPropGAGenOp.h:83: Warning: Member monClone of class eoPropGAGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoOpContainer.h:154: Warning: Member className() const  of class eoProportionalOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoProportionalSelect.h:81: Warning: Member FitVec of class eoProportionalSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoProportionalSelect.h:82: Warning: Member cumulative of class eoProportionalSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoOp.h:165: Warning: Member quadOp of class eoQuad2BinOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoCloneOps.h:74: Warning: Member className() const  of class eoQuadCloneOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoGenOp.h:160: Warning: Member eoQuadGenOp(eoQuadOp< EOT > &_op) of class eoQuadGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoGenOp.h:177: Warning: Member className() const  of class eoQuadGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoGenOp.h:180: Warning: Member op of class eoQuadGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoOp.h:137: Warning: Member className() const  of class eoQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:93: Warning: Member random_generator(T _max, eoRng &_rng=rng) of class random_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:96: Warning: Member random_generator(T _min, T _max, eoRng &_rng=rng) of class random_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:101: Warning: Member operator()(void) of class random_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:112: Warning: Member operator()(void) of class random_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:104: Warning: Member minim of class random_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:105: Warning: Member range of class random_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:106: Warning: Member random of class random_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/gen/NodeSelector.h:51: Warning: Member select_node(Sym sym) const  of class RandomNodeSelector is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceSplit.h:156: Warning: Member howMany of class eoRandomSplit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceSplit.h:157: Warning: Member returnEliminated of class eoRandomSplit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoRanking.h:49: Warning: Member eoRanking(double _p=2.0, double _e=1.0) of class eoRanking is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoRanking.h:53: Warning: Member lookfor(const EOT *_eo, const eoPop< EOT > &_pop) of class eoRanking is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoRanking.h:104: Warning: Member pressure of class eoRanking is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoRanking.h:105: Warning: Member exponent of class eoRanking is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoRankingSelect.h:52: Warning: Member ranking of class eoRankingSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoReal.h:41: Warning: The following parameters of eoReal< FitT >::eoReal(unsigned size=0, double value=0.0) are not documented:
+  parameter value
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:113: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:109: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:117: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:122: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:498: Warning: Member repMaximum of class eoRealAboveBound is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealVectorBounds.h:118: Warning: Member isMinBounded(unsigned _i) of class eoRealBaseVectorBounds is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealVectorBounds.h:121: Warning: Member isMaxBounded(unsigned _i) of class eoRealBaseVectorBounds is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealVectorBounds.h:175: Warning: Member maximum(unsigned _i) of class eoRealBaseVectorBounds is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealVectorBounds.h:176: Warning: Member range(unsigned _i) of class eoRealBaseVectorBounds is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:109: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:113: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:117: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:122: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:403: Warning: Member repMinimum of class eoRealBelowBound is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:109: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:113: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:117: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:122: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoRealInitBounded.h:59: Warning: Member size() of class eoRealInitBounded is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoRealInitBounded.h:62: Warning: Member bounds of class eoRealInitBounded is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:109: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:113: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:117: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:122: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:307: Warning: Member repMinimum of class eoRealInterval is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:308: Warning: Member repMaximum of class eoRealInterval is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:309: Warning: Member repRange of class eoRealInterval is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:109: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:113: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:117: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealBounds.h:122: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealVectorBounds.h:344: Warning: Member operator=(const eoRealVectorBounds &) of class eoRealVectorBounds is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealVectorBounds.h:341: Warning: Member factor of class eoRealVectorBounds is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealVectorBounds.h:342: Warning: Member ownedBounds of class eoRealVectorBounds is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealVectorBounds.h:306: Warning: argument `_is' of command @param is not found in the argument list of eoRealVectorBounds::readFrom(std::string _s)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealVectorBounds.h:306: Warning: The following parameters of eoRealVectorBounds::readFrom(std::string _s) are not documented:
+  parameter _s
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealVectorBounds.h:372: Warning: Member isMinBounded(unsigned) of class eoRealVectorNoBounds is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealVectorBounds.h:373: Warning: Member isMaxBounded(unsigned) of class eoRealVectorNoBounds is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealVectorBounds.h:390: Warning: Member maximum(unsigned) of class eoRealVectorNoBounds is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRealVectorBounds.h:394: Warning: Member range(unsigned) of class eoRealVectorNoBounds is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceMerge.h:58: Warning: Member eoReduceMerge(eoReduce< EOT > &_reduce, eoMerge< EOT > &_merge) of class eoReduceMerge is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceMerge.h:69: Warning: Member reduce of class eoReduceMerge is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceMerge.h:70: Warning: Member merge of class eoReduceMerge is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceMerge.h:44: Warning: Found unknown command `\classes'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceMergeReduce.h:66: Warning: Member eoReduceMergeReduce(eoHowMany _howManyElite, bool _strongElitism, eoHowMany _howManyReducedParents, eoReduce< EOT > &_reduceParents, eoHowMany _howManyReducedOffspring, eoReduce< EOT > &_reduceOffspring, eoReduce< EOT > &_reduceFinal) of class eoReduceMergeReduce is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceMergeReduce.h:133: Warning: Member howManyElite of class eoReduceMergeReduce is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceMergeReduce.h:134: Warning: Member strongElitism of class eoReduceMergeReduce is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceMergeReduce.h:135: Warning: Member howManyReducedParents of class eoReduceMergeReduce is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceMergeReduce.h:136: Warning: Member howManyReducedOffspring of class eoReduceMergeReduce is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceMergeReduce.h:138: Warning: Member reduceParents of class eoReduceMergeReduce is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceMergeReduce.h:139: Warning: Member reduceOffspring of class eoReduceMergeReduce is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceMergeReduce.h:140: Warning: Member reduceFinal of class eoReduceMergeReduce is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReplacement.h:64: Warning: Found unknown command `\classes'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRndGenerators.h:49: Warning: Member AtomType of class eoRndGenerator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRNG.h:297: Warning: Member restart(void) of class eoRng is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRNG.h:346: Warning: Member initialize(uint32_t seed) of class eoRng is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRNG.h:351: Warning: Member next of class eoRng is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRNG.h:353: Warning: Member left of class eoRng is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRNG.h:356: Warning: Member cached of class eoRng is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRNG.h:358: Warning: Member cacheValue of class eoRng is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRNG.h:360: Warning: Member N of class eoRng is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRNG.h:362: Warning: Member M of class eoRng is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSelectFromWorth.h:173: Warning: Member worthIterator of class eoRouletteWorthSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSelectFromWorth.h:179: Warning: Member eoRouletteWorthSelect(eoPerf2Worth< EOT, WorthT > &_perf2Worth) of class eoRouletteWorthSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSelectFromWorth.h:220: Warning: Member total of class eoRouletteWorthSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitness.h:48: Warning: Member eoScalarFitness(const eoScalarFitness &other) of class eoScalarFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitness.h:49: Warning: Member eoScalarFitness(const ScalarType &v) of class eoScalarFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitness.h:52: Warning: Member operator=(const eoScalarFitness &other) of class eoScalarFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitness.h:54: Warning: Member operator=(const ScalarType &v) of class eoScalarFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitness.h:56: Warning: Member operator ScalarType(void) const  of class eoScalarFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitness.h:63: Warning: Member operator>(const eoScalarFitness< ScalarType, Compare > &y) const  of class eoScalarFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitness.h:65: Warning: Member operator<=(const eoScalarFitness< ScalarType, Compare > &y) const  of class eoScalarFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitness.h:67: Warning: Member operator>=(const eoScalarFitness< ScalarType, Compare > &y) const  of class eoScalarFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitness.h:71: Warning: Member value of class eoScalarFitness is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitnessAssembled.h:97: Warning: Member baseVector of class eoScalarFitnessAssembled is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitnessAssembled.h:98: Warning: Member size_type of class eoScalarFitnessAssembled is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitnessAssembled.h:111: Warning: Member eoScalarFitnessAssembled(size_type _n, const ScalarType &_val, const std::string &_descr="Unnamed variable") of class eoScalarFitnessAssembled is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitnessAssembled.h:121: Warning: Member eoScalarFitnessAssembled(const eoScalarFitnessAssembled &other) of class eoScalarFitnessAssembled is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitnessAssembled.h:123: Warning: Member operator=(const eoScalarFitnessAssembled &other) of class eoScalarFitnessAssembled is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitnessAssembled.h:135: Warning: Member eoScalarFitnessAssembled(const ScalarType &v) of class eoScalarFitnessAssembled is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitnessAssembled.h:137: Warning: Member operator=(const ScalarType &v) of class eoScalarFitnessAssembled is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitnessAssembled.h:199: Warning: Member operator ScalarType(void) const  of class eoScalarFitnessAssembled is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitnessAssembled.h:213: Warning: Member operator<(const eoScalarFitnessAssembled &other) const  of class eoScalarFitnessAssembled is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitnessAssembled.h:221: Warning: Member operator>(const eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > &y) const  of class eoScalarFitnessAssembled is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitnessAssembled.h:224: Warning: Member operator<=(const eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > &y) const  of class eoScalarFitnessAssembled is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitnessAssembled.h:227: Warning: Member operator>=(const eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > &y) const  of class eoScalarFitnessAssembled is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitnessAssembled.h:47: Warning: Member size_type of class eoScalarFitnessAssembledTraits is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitnessAssembled.h:49: Warning: Member setDescription(size_type _idx, std::string _descr) of class eoScalarFitnessAssembledTraits is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitnessAssembled.h:58: Warning: Member getDescription(size_type _idx) of class eoScalarFitnessAssembledTraits is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitnessAssembled.h:65: Warning: Member resize(size_type _n, const std::string &_descr) of class eoScalarFitnessAssembledTraits is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitnessAssembled.h:69: Warning: Member size() of class eoScalarFitnessAssembledTraits is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitnessAssembled.h:71: Warning: Member getDescriptionVector() of class eoScalarFitnessAssembledTraits is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoScalarFitnessAssembled.h:74: Warning: Member TermDescriptions of class eoScalarFitnessAssembledTraits is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoScalarFitnessStat.h:47: Warning: Member eoScalarFitnessStat(std::string _description="FitnessES", eoRealVectorBounds &_bounds=eoDummyVectorNoBounds) of class eoScalarFitnessStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoScalarFitnessStat.h:60: Warning: Member range of class eoScalarFitnessStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:174: Warning: Member fitness_type of class eoSecondMomentStats is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:176: Warning: Member SquarePair of class eoSecondMomentStats is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:180: Warning: Member eoSecondMomentStats(std::string _description="Average & Stdev") of class eoSecondMomentStats is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:200: Warning: Member className(void) const  of class eoSecondMomentStats is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:183: Warning: Member sumOfSquares(SquarePair _sq, const EOT &_eo) of class eoSecondMomentStats is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoRealOp.h:326: Warning: Member bounds of class eoSegmentCrossover is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoRealOp.h:327: Warning: Member alpha of class eoSegmentCrossover is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoRealOp.h:328: Warning: Member range of class eoSegmentCrossover is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoRealOp.h:250: Warning: argument `_alphaMin' of command @param is not found in the argument list of eoSegmentCrossover< EOT >::eoSegmentCrossover(const double &_alpha=0.0)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoRealOp.h:250: Warning: The following parameters of eoSegmentCrossover< EOT >::eoSegmentCrossover(const double &_alpha=0.0) are not documented:
+  parameter _alpha
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoRealOp.h:262: Warning: argument `_alphaMin' of command @param is not found in the argument list of eoSegmentCrossover< EOT >::eoSegmentCrossover(eoRealVectorBounds &_bounds, const double &_alpha=0.0)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoRealOp.h:262: Warning: The following parameters of eoSegmentCrossover< EOT >::eoSegmentCrossover(eoRealVectorBounds &_bounds, const double &_alpha=0.0) are not documented:
+  parameter _alpha
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoGenOp.h:137: Warning: Member eoSelBinGenOp(eoBinOp< EOT > &_op, eoSelectOne< EOT > &_sel) of class eoSelBinGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoGenOp.h:146: Warning: Member className() const  of class eoSelBinGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoGenOp.h:149: Warning: Member op of class eoSelBinGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoGenOp.h:150: Warning: Member sel of class eoSelBinGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSelectFromWorth.h:58: Warning: Member eoSelectFromWorth(eoPerf2Worth< EOT, WorthType > &_perf2Worth) of class eoSelectFromWorth is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSelectFromWorth.h:78: Warning: Member check_sync(unsigned index, const EOT &_eo) of class eoSelectFromWorth is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSelectFromWorth.h:74: Warning: Member perf2Worth of class eoSelectFromWorth is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSelectFromWorth.h:77: Warning: Member fitness of class eoSelectFromWorth is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPopulator.h:192: Warning: Member eoSelectivePopulator(const eoPop< EOT > &_pop, eoPop< EOT > &_dest, eoSelectOne< EOT > &_sel) of class eoSelectivePopulator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPopulator.h:202: Warning: Member sel of class eoSelectivePopulator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSelectMany.h:55: Warning: Member eoSelectMany(eoSelectOne< EOT > &_select, eoHowMany _howMany) of class eoSelectMany is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSelectMany.h:76: Warning: Member select of class eoSelectMany is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSelectMany.h:77: Warning: Member howMany of class eoSelectMany is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSelectNumber.h:68: Warning: Member select of class eoSelectNumber is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSelectNumber.h:69: Warning: Member nb_to_select of class eoSelectNumber is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSelectPerc.h:68: Warning: Member select of class eoSelectPerc is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSelectPerc.h:69: Warning: Member rate of class eoSelectPerc is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoBreed.h:62: Warning: Member eoSelectTransform(eoSelect< EOT > &_select, eoTransform< EOT > &_transform) of class eoSelectTransform is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoBreed.h:71: Warning: Member select of class eoSelectTransform is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoBreed.h:72: Warning: Member transform of class eoSelectTransform is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPopulator.h:159: Warning: Member eoSeqPopulator(const eoPop< EOT > &_pop, eoPop< EOT > &_dest) of class eoSeqPopulator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPopulator.h:176: Warning: Member current of class eoSeqPopulator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoOpContainer.h:95: Warning: Member position_type of class eoSequentialOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoOpContainer.h:123: Warning: Member className() const  of class eoSequentialOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoOpContainer.h:127: Warning: Member to_apply of class eoSequentialOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoOpContainer.h:128: Warning: Member production of class eoSequentialOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSequentialSelect.h:81: Warning: Member ordered of class eoSequentialSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSequentialSelect.h:82: Warning: Member current of class eoSequentialSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSequentialSelect.h:83: Warning: Member eoPters of class eoSequentialSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGA.h:67: Warning: Member eoSGA(eoSelectOne< EOT > &_select, eoQuadOp< EOT > &_cross, float _crate, eoMonOp< EOT > &_mutate, float _mrate, eoEvalFunc< EOT > &_eval, eoContinue< EOT > &_cont) of class eoSGA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGA.h:109: Warning: Member cont of class eoSGA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGA.h:112: Warning: Member mutationRate of class eoSGA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGA.h:114: Warning: Member cross of class eoSGA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGA.h:115: Warning: Member crossoverRate of class eoSGA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGA.h:116: Warning: Member select of class eoSGA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGA.h:117: Warning: Member eval of class eoSGA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGAGenOp.h:77: Warning: Member className() const  of class eoSGAGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGAGenOp.h:81: Warning: Member cross of class eoSGAGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGAGenOp.h:82: Warning: Member pCross of class eoSGAGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGAGenOp.h:83: Warning: Member mut of class eoSGAGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGAGenOp.h:84: Warning: Member pMut of class eoSGAGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGAGenOp.h:85: Warning: Member propOp of class eoSGAGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGAGenOp.h:86: Warning: Member quadClone of class eoSGAGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGAGenOp.h:87: Warning: Member op of class eoSGAGenOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGATransform.h:86: Warning: Member cross of class eoSGATransform is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGATransform.h:87: Warning: Member crossoverProba of class eoSGATransform is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGATransform.h:88: Warning: Member mutate of class eoSGATransform is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGATransform.h:89: Warning: Member mutationProba of class eoSGATransform is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGATransform.h:58: Warning: argument `pop' of command @param is not found in the argument list of eoSGATransform< EOT >::operator()(eoPop< EOT > &_pop)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSGATransform.h:58: Warning: The following parameters of eoSGATransform< EOT >::operator()(eoPop< EOT > &_pop) are not documented:
+  parameter _pop
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSharing.h:90: Warning: Member eoSharing(double _nicheSize, eoDistance< EOT > &_dist) of class eoSharing is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSharing.h:131: Warning: Member nicheSize of class eoSharing is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSharing.h:132: Warning: Member dist of class eoSharing is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSharingSelect.h:53: Warning: Member sharing of class eoSharingSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSharingSelect.h:46: Warning: argument `_s' of command @param is not found in the argument list of eoSharingSelect< EOT >::eoSharingSelect(double _sigma, eoDistance< EOT > &_dist)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSharingSelect.h:46: Warning: The following parameters of eoSharingSelect< EOT >::eoSharingSelect(double _sigma, eoDistance< EOT > &_dist) are not documented:
+  parameter _sigma
+  parameter _dist
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSimpleEDA.h:93: Warning: Member update of class eoSimpleEDA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSimpleEDA.h:95: Warning: Member eval of class eoSimpleEDA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSimpleEDA.h:97: Warning: Member popSize of class eoSimpleEDA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSimpleEDA.h:99: Warning: Member continuator of class eoSimpleEDA is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoPopStat.h:130: Warning: Member combien of class eoSortedPopStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:92: Warning: Member eoSortedStat(ParamType _value, std::string _desc) of class eoSortedStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:93: Warning: Member className(void) const  of class eoSortedStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:79: Warning: Member lastCall(const std::vector< const EOT * > &) of class eoSortedStatBase is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:80: Warning: Member className(void) const  of class eoSortedStatBase is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceMerge.h:95: Warning: Member eoSSGADetTournamentReplacement(unsigned _t_size) of class eoSSGADetTournamentReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceMerge.h:98: Warning: Member truncate of class eoSSGADetTournamentReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceMerge.h:99: Warning: Member plus of class eoSSGADetTournamentReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceMerge.h:112: Warning: Member eoSSGAStochTournamentReplacement(double _t_rate) of class eoSSGAStochTournamentReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceMerge.h:115: Warning: Member truncate of class eoSSGAStochTournamentReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceMerge.h:116: Warning: Member plus of class eoSSGAStochTournamentReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceMerge.h:83: Warning: Member truncate of class eoSSGAWorseReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceMerge.h:84: Warning: Member plus of class eoSSGAWorseReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:64: Warning: Member eoStat(T _value, std::string _description) of class eoStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:67: Warning: Member className(void) const  of class eoStat is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:48: Warning: Member lastCall(const eoPop< EOT > &) of class eoStatBase is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStat.h:49: Warning: Member className(void) const  of class eoStatBase is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoState.h:88: Warning: Member getCommentString(void) const  of class eoState is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoState.h:122: Warning: Member ObjectMap of class eoState is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoState.h:119: Warning: Member createObjectName(eoObject *obj) of class eoState is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoState.h:130: Warning: Member eoState(const eoState &) of class eoState is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoState.h:131: Warning: Member operator=(const eoState &) of class eoState is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoState.h:124: Warning: Member objectMap of class eoState is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoState.h:126: Warning: Member creationOrder of class eoState is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoState.h:127: Warning: Member ownedObjects of class eoState is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoState.h:85: Warning: Member loading_error(std::string huh="Error while loading") of class eoState::loading_error is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoStParseTreeOp.h:134: Warning: Member EoType of class eoStBranchMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoStParseTreeOp.h:185: Warning: Member max_length of class eoStBranchMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoStParseTreeOp.h:186: Warning: Member initializer of class eoStBranchMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStdoutMonitor.h:42: Warning: Member eoStdoutMonitor(bool _verbose=true, std::string _delim="\t") of class eoStdoutMonitor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStdoutMonitor.h:45: Warning: Member className(void) const  of class eoStdoutMonitor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStdoutMonitor.h:47: Warning: Member verbose of class eoStdoutMonitor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStdoutMonitor.h:48: Warning: Member delim of class eoStdoutMonitor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoStdoutMonitor.h:49: Warning: Member firsttime of class eoStdoutMonitor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSteadyFitContinue.h:38: Warning: Member Fitness of class eoSteadyFitContinue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSteadyFitContinue.h:100: Warning: Member steadyGenerations() of class eoSteadyFitContinue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSteadyFitContinue.h:102: Warning: Member className(void) const  of class eoSteadyFitContinue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSteadyFitContinue.h:104: Warning: Member repMinGenerations of class eoSteadyFitContinue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSteadyFitContinue.h:105: Warning: Member repSteadyGenerations of class eoSteadyFitContinue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSteadyFitContinue.h:106: Warning: Member steadyState of class eoSteadyFitContinue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSteadyFitContinue.h:107: Warning: Member thisGenerationPlaceHolder of class eoSteadyFitContinue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSteadyFitContinue.h:108: Warning: Member thisGeneration of class eoSteadyFitContinue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSteadyFitContinue.h:109: Warning: Member lastImprovement of class eoSteadyFitContinue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSteadyFitContinue.h:110: Warning: Member bestSoFar of class eoSteadyFitContinue is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoStParseTreeOp.h:262: Warning: Member EoType of class eoStHoistMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoStParseTreeOp.h:310: Warning: Member max_length of class eoStHoistMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoStParseTreeOp.h:311: Warning: Member initializer of class eoStHoistMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSTLFunctor.h:104: Warning: Member eoSTLBF(eoUF< A1, R > &_f) of class eoSTLBF is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSTLFunctor.h:107: Warning: Member operator()(A1 a1, A2 a2) of class eoSTLBF is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSTLFunctor.h:113: Warning: Member f of class eoSTLBF is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSTLFunctor.h:45: Warning: Member result_type of class eoSTLF is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSTLFunctor.h:47: Warning: Member eoSTLF(eoF< R > &_f) of class eoSTLF is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSTLFunctor.h:50: Warning: Member operator()(void) of class eoSTLF is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSTLFunctor.h:56: Warning: Member f of class eoSTLF is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSTLFunctor.h:81: Warning: Member eoSTLUF(eoUF< A1, R > &_f) of class eoSTLUF is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSTLFunctor.h:84: Warning: Member operator()(A1 a) of class eoSTLUF is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSTLFunctor.h:89: Warning: Member f of class eoSTLUF is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoStochasticUniversalSelect.h:105: Warning: Member IndexVec of class eoStochasticUniversalSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoStochasticUniversalSelect.h:106: Warning: Member indices of class eoStochasticUniversalSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoStochTournamentSelect.h:48: Warning: Member eoStochTournamentSelect(double _Trate=1.0) of class eoStochTournamentSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoStochTournamentSelect.h:67: Warning: Member Trate of class eoStochTournamentSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduce.h:241: Warning: Member eoStochTournamentTruncate(double _t_rate) of class eoStochTournamentTruncate is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduce.h:283: Warning: Member t_rate of class eoStochTournamentTruncate is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceSplit.h:316: Warning: Member t_rate of class eoStochTournamentTruncateSplit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceSplit.h:317: Warning: Member howMany of class eoStochTournamentTruncateSplit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceSplit.h:318: Warning: Member returnEliminated of class eoStochTournamentTruncateSplit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSelectFromWorth.h:134: Warning: Member worthIterator of class eoStochTournamentWorthSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSelectFromWorth.h:139: Warning: Member eoStochTournamentWorthSelect(eoPerf2Worth< EOT, WorthT > &_perf2Worth, double _tRate) of class eoStochTournamentWorthSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSelectFromWorth.h:160: Warning: Member tRate of class eoStochTournamentWorthSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoStParseTreeDepthInit.h:65: Warning: Member EoType of class eoStParseTreeDepthInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoStParseTreeDepthInit.h:140: Warning: Member generate(std::list< Node > &sequence, int the_max, int request_type) of class eoStParseTreeDepthInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoStParseTreeDepthInit.h:183: Warning: Member max_depth of class eoStParseTreeDepthInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoStParseTreeDepthInit.h:184: Warning: Member node of class eoStParseTreeDepthInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoStParseTreeDepthInit.h:186: Warning: Member return_type of class eoStParseTreeDepthInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoStParseTreeDepthInit.h:187: Warning: Member grow of class eoStParseTreeDepthInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoStParseTreeDepthInit.h:67: Warning: Found unknown command `\parm'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoStParseTreeDepthInit.h:67: Warning: argument `_initializor' of command @param is not found in the argument list of eoStParseTreeDepthInit< FType, Node >::eoStParseTreeDepthInit(unsigned _max_depth, const std::vector< Node > &_node, const int &_return_type, bool _grow=true)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoStParseTreeDepthInit.h:67: Warning: The following parameters of eoStParseTreeDepthInit< FType, Node >::eoStParseTreeDepthInit(unsigned _max_depth, const std::vector< Node > &_node, const int &_return_type, bool _grow=true) are not documented:
+  parameter _max_depth
+  parameter _node
+  parameter _return_type
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoStParseTreeOp.h:199: Warning: Member EoType of class eoStPointMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoStParseTreeOp.h:249: Warning: Member node of class eoStPointMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoStParseTreeOp.h:201: Warning: argument `_initializor' of command @param is not found in the argument list of eoStPointMutation< FType, Node >::eoStPointMutation(std::vector< Node > &_node)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoStParseTreeOp.h:201: Warning: The following parameters of eoStPointMutation< FType, Node >::eoStPointMutation(std::vector< Node > &_node) are not documented:
+  parameter _node
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/other/eoString.h:46: Warning: Member Type of class eoString is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/other/eoString.h:47: Warning: Member AtomType of class eoString is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/other/eoString.h:48: Warning: Member ContainerType of class eoString is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoStParseTreeOp.h:59: Warning: Member EoType of class eoStSubtreeXOver is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoStParseTreeOp.h:122: Warning: Member max_length of class eoStSubtreeXOver is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTreeOp.h:45: Warning: Member EoType of class eoSubtreeXOver is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/eoParseTreeOp.h:79: Warning: Member max_length of class eoSubtreeXOver is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSurviveAndDie.h:59: Warning: Member eoSurviveAndDie(double _survive, double _die, bool _interpret_as_rate=true) of class eoSurviveAndDie is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSurviveAndDie.h:62: Warning: Member howmanySurvive of class eoSurviveAndDie is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoSurviveAndDie.h:63: Warning: Member howmanyDie of class eoSurviveAndDie is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eo_interface/eoSymInit.h:28: Warning: Member builder of class eoSymInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eo_interface/eoSymInit.h:30: Warning: Member own_grow_prob of class eoSymInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eo_interface/eoSymInit.h:31: Warning: Member own_max_depth of class eoSymInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eo_interface/eoSymInit.h:34: Warning: Member grow_prob of class eoSymInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eo_interface/eoSymInit.h:35: Warning: Member max_depth of class eoSymInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/pickle.h:36: Warning: Member print_to_string(const T &t) of class T_pickle_suite is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/pickle.h:45: Warning: Member getstate(const T &t) of class T_pickle_suite is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/pickle.h:52: Warning: Member setstate(T &t, boost::python::tuple pickled) of class T_pickle_suite is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoTimeCounter.h:62: Warning: Member utime of class eoTimeCounter is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdatable.h:72: Warning: Member eoTimedDynUpdate(eoUpdatable &_toUpdate, time_t _interval) of class eoTimedDynUpdate is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdatable.h:85: Warning: Member interval of class eoTimedDynUpdate is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdatable.h:86: Warning: Member last_time of class eoTimedDynUpdate is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdatable.h:87: Warning: Member first_time of class eoTimedDynUpdate is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoTimedMonitor.h:43: Warning: Member eoTimedMonitor(int seconds_) of class eoTimedMonitor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoTimedMonitor.h:67: Warning: Member add(eoMonitor &mon) of class eoTimedMonitor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoTimedMonitor.h:69: Warning: Member className(void) const  of class eoTimedMonitor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoTimedMonitor.h:71: Warning: Member last_tick of class eoTimedMonitor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoTimedMonitor.h:72: Warning: Member seconds of class eoTimedMonitor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoTimedMonitor.h:73: Warning: Member monitors of class eoTimedMonitor is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdater.h:109: Warning: Member eoTimedStateSaver(time_t _interval, const eoState &_state, std::string _prefix="state", std::string _extension="sav") of class eoTimedStateSaver is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdater.h:113: Warning: Member className(void) const  of class eoTimedStateSaver is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdater.h:115: Warning: Member state of class eoTimedStateSaver is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdater.h:117: Warning: Member interval of class eoTimedStateSaver is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdater.h:118: Warning: Member last_time of class eoTimedStateSaver is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdater.h:119: Warning: Member first_time of class eoTimedStateSaver is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdater.h:120: Warning: Member prefix of class eoTimedStateSaver is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdater.h:121: Warning: Member extension of class eoTimedStateSaver is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoPopEvalFunc.h:97: Warning: Member eval of class eoTimeVaryingLoopEval is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoTruncatedSelectMany.h:69: Warning: Member eoTruncatedSelectMany(eoSelectOne< EOT > &_select, eoHowMany _howManyGenitors, eoHowMany _howManyFertile) of class eoTruncatedSelectMany is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoTruncatedSelectMany.h:112: Warning: Member select of class eoTruncatedSelectMany is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoTruncatedSelectMany.h:113: Warning: Member howManyGenitors of class eoTruncatedSelectMany is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoTruncatedSelectMany.h:114: Warning: Member howManyFertile of class eoTruncatedSelectMany is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoTruncatedSelectOne.h:105: Warning: Member select of class eoTruncatedSelectOne is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoTruncatedSelectOne.h:106: Warning: Member howManyFertile of class eoTruncatedSelectOne is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoTruncatedSelectOne.h:107: Warning: Member tmpPop of class eoTruncatedSelectOne is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoTruncatedSelectOne.h:108: Warning: Member actualPop of class eoTruncatedSelectOne is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoTruncatedSelectOne.h:92: Warning: argument `_source' of command @param is not found in the argument list of eoTruncatedSelectOne< EOT >::operator()(const eoPop< EOT > &_pop)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoTruncatedSelectOne.h:92: Warning: argument `_dest' of command @param is not found in the argument list of eoTruncatedSelectOne< EOT >::operator()(const eoPop< EOT > &_pop)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoTruncatedSelectOne.h:92: Warning: The following parameters of eoTruncatedSelectOne< EOT >::operator()(const eoPop< EOT > &_pop) are not documented:
+  parameter _pop
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceSplit.h:79: Warning: Member howMany of class eoTruncateSplit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReduceSplit.h:80: Warning: Member returnEliminated of class eoTruncateSplit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoTruncSelect.h:69: Warning: Member select of class eoTruncSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoTruncSelect.h:70: Warning: Member howMany of class eoTruncSelect is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoBitOp.h:310: Warning: Member preference of class eoUBitXover is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/eoBitOp.h:288: Warning: Found unknown command `\std'
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:125: Warning: Member UF_random_generator(eoRng &_rng=rng) of class UF_random_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:127: Warning: Member operator()(T _t) of class UF_random_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:130: Warning: Member random of class UF_random_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoCounter.h:99: Warning: Member eoUnaryFunctorCounter(UnaryFunctor &_func, std::string _name="uf_counter") of class eoUnaryFunctorCounter is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoCounter.h:130: Warning: Member func of class eoUnaryFunctorCounter is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:50: Warning: Member uniform_generator(T _max=T(1.0), eoRng &_rng=rng) of class uniform_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:53: Warning: Member uniform_generator(T _min, T _max, eoRng &_rng=rng) of class uniform_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:58: Warning: Member operator()(void) of class uniform_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:61: Warning: Member minim of class uniform_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:62: Warning: Member range of class uniform_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/rnd_generators.h:63: Warning: Member uniform of class uniform_generator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthCrossover.h:55: Warning: Member eoUniformAtomExchange(double _rate=0.5) of class eoUniformAtomExchange is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthCrossover.h:78: Warning: Member rate of class eoUniformAtomExchange is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthCrossover.h:79: Warning: Member mask of class eoUniformAtomExchange is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthMutation.h:102: Warning: Member className() const  of class eoUniformGeneChooser is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRndGenerators.h:72: Warning: Member eoUniformGenerator(T _max=T(1.0), eoRng &_rng=rng) of class eoUniformGenerator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRndGenerators.h:75: Warning: Member eoUniformGenerator(T _min, T _max, eoRng &_rng=rng) of class eoUniformGenerator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRndGenerators.h:87: Warning: Member minim of class eoUniformGenerator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRndGenerators.h:88: Warning: Member range of class eoUniformGenerator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoRndGenerators.h:89: Warning: Member uniform of class eoUniformGenerator is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUniformInit.h:102: Warning: Member operator()(bool &_b) of class eoUniformInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUniformInit.h:93: Warning: Member minim of class eoUniformInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUniformInit.h:94: Warning: Member range of class eoUniformInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUniformInit.h:95: Warning: Member uniform of class eoUniformInit is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoRealOp.h:132: Warning: Member homogeneous of class eoUniformMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoRealOp.h:133: Warning: Member bounds of class eoUniformMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoRealOp.h:134: Warning: Member epsilon of class eoUniformMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/eoRealOp.h:135: Warning: Member p_change of class eoUniformMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdatable.h:43: Warning: Member update()=0 of class eoUpdatable is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdater.h:42: Warning: Member lastCall() of class eoUpdater is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoUpdater.h:43: Warning: Member className(void) const  of class eoUpdater is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParam.h:195: Warning: Member repValue of class eoValueParam is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParam.h:143: Warning: argument `_shortName' of command @param is not found in the argument list of eoValueParam< ValueType >::eoValueParam(ValueType _defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/eoParam.h:143: Warning: The following parameters of eoValueParam< ValueType >::eoValueParam(ValueType _defaultValue, std::string _longName, std::string _description="No description", char _shortHand=0, bool _required=false) are not documented:
+  parameter _shortHand
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoFitness.h:86: Warning: Member maximizing(unsigned _i) of class eoVariableParetoTraits is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoFitness.h:94: Warning: Member nObj of class eoVariableParetoTraits is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoParetoFitness.h:95: Warning: Member bObj of class eoVariableParetoTraits is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVector.h:57: Warning: Member AtomType of class eoVector is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVector.h:58: Warning: Member ContainerType of class eoVector is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVector.h:77: Warning: Member value(const std::vector< GeneType > &_v) of class eoVector is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/MGE/VirusOp.h:45: Warning: argument `chrom' of command @param is not found in the argument list of VirusBitFlip< FitT >::operator()(eoVirus< FitT > &_chrom)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/MGE/VirusOp.h:45: Warning: The following parameters of VirusBitFlip< FitT >::operator()(eoVirus< FitT > &_chrom) are not documented:
+  parameter _chrom
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/MGE/VirusOp.h:95: Warning: argument `chrom' of command @param is not found in the argument list of VirusShiftMutation< FitT >::operator()(eoVirus< FitT > &_chrom)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/MGE/VirusOp.h:95: Warning: The following parameters of VirusShiftMutation< FitT >::operator()(eoVirus< FitT > &_chrom) are not documented:
+  parameter _chrom
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthMutation.h:52: Warning: Member AtomType of class eoVlAddMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthMutation.h:78: Warning: Member nMax of class eoVlAddMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthMutation.h:79: Warning: Member atomInit of class eoVlAddMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthMutation.h:54: Warning: argument `nMax' of command @param is not found in the argument list of eoVlAddMutation< EOT >::eoVlAddMutation(unsigned _nMax, eoInit< AtomType > &_atomInit)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthMutation.h:54: Warning: The following parameters of eoVlAddMutation< EOT >::eoVlAddMutation(unsigned _nMax, eoInit< AtomType > &_atomInit) are not documented:
+  parameter _nMax
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthCrossover.h:93: Warning: Member AtomType of class eoVlAtomExchangeQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthCrossover.h:164: Warning: Member Min of class eoVlAtomExchangeQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthCrossover.h:164: Warning: Member Max of class eoVlAtomExchangeQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthCrossover.h:165: Warning: Member atomExchange of class eoVlAtomExchangeQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthMutation.h:114: Warning: Member AtomType of class eoVlDelMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthMutation.h:144: Warning: Member className() const  of class eoVlDelMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthMutation.h:151: Warning: Member nMin of class eoVlDelMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthMutation.h:152: Warning: Member uChooser of class eoVlDelMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthMutation.h:153: Warning: Member chooser of class eoVlDelMutation is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthMutation.h:116: Warning: argument `nMin' of command @param is not found in the argument list of eoVlDelMutation< EOT >::eoVlDelMutation(unsigned _nMin, eoGeneDelChooser< EOT > &_chooser)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthMutation.h:116: Warning: argument `_geneChooser' of command @param is not found in the argument list of eoVlDelMutation< EOT >::eoVlDelMutation(unsigned _nMin, eoGeneDelChooser< EOT > &_chooser)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthMutation.h:116: Warning: The following parameters of eoVlDelMutation< EOT >::eoVlDelMutation(unsigned _nMin, eoGeneDelChooser< EOT > &_chooser) are not documented:
+  parameter _nMin
+  parameter _chooser
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthMutation.h:124: Warning: argument `nMin' of command @param is not found in the argument list of eoVlDelMutation< EOT >::eoVlDelMutation(unsigned _nMin)
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthMutation.h:124: Warning: The following parameters of eoVlDelMutation< EOT >::eoVlDelMutation(unsigned _nMin) are not documented:
+  parameter _nMin
+
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthCrossover.h:284: Warning: Member AtomType of class eoVlUniformBinOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthCrossover.h:288: Warning: Member eoVlUniformBinOp(unsigned _Min, unsigned _Max, double _rate=0.5) of class eoVlUniformBinOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthCrossover.h:342: Warning: Member Min of class eoVlUniformBinOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthCrossover.h:342: Warning: Member Max of class eoVlUniformBinOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthCrossover.h:343: Warning: Member rate of class eoVlUniformBinOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthCrossover.h:223: Warning: Member AtomType of class eoVlUniformQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthCrossover.h:227: Warning: Member eoVlUniformQuadOp(unsigned _Min, unsigned _Max, double _rate=0.5) of class eoVlUniformQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthCrossover.h:265: Warning: Member Min of class eoVlUniformQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthCrossover.h:265: Warning: Member Max of class eoVlUniformQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoVariableLengthCrossover.h:266: Warning: Member rate of class eoVlUniformQuadOp is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReplacement.h:105: Warning: Member Fitness of class eoWeakElitistReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReplacement.h:109: Warning: Member eoWeakElitistReplacement(eoReplacement< EOT > &_replace) of class eoWeakElitistReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/eoReplacement.h:123: Warning: Member replace of class eoWeakElitistReplacement is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/parse_tree.h:75: Warning: Unsupported html tag  found
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/parse_tree.h:189: Warning: Member MemPool(unsigned int sz) of class gp_parse_tree::MemPool is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/parse_tree.h:202: Warning: Member allocate() of class gp_parse_tree::MemPool is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/parse_tree.h:210: Warning: Member deallocate(void *b) of class gp_parse_tree::MemPool is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/parse_tree.h:219: Warning: Member grow() of class gp_parse_tree::MemPool is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/parse_tree.h:249: Warning: Member chunks of class gp_parse_tree::MemPool is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/parse_tree.h:250: Warning: Member esize of class gp_parse_tree::MemPool is not documented.
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/parse_tree.h:251: Warning: Member head of class gp_parse_tree::MemPool is not documented.
diff --git a/trunk/paradiseo-eo/doc/man/man3/BiasedNodeSelector.3 b/trunk/paradiseo-eo/doc/man/man3/BiasedNodeSelector.3
new file mode 100644
index 000000000..c4be48347
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/BiasedNodeSelector.3
@@ -0,0 +1,40 @@
+.TH "BiasedNodeSelector" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+BiasedNodeSelector \- A node selector that does a specified number of rounds ignoring terminals.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBNodeSelector\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBBiasedNodeSelector\fP (unsigned n)"
+.br
+.ti -1c
+.RI "NodeSelection \fBselect_node\fP (Sym sym) const "
+.br
+.in -1c
+.SS "Public Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBnRounds\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+A node selector that does a specified number of rounds ignoring terminals. 
+.PP
+Definition at line 55 of file NodeSelector.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/Bitstring.3 b/trunk/paradiseo-eo/doc/man/man3/Bitstring.3
new file mode 100644
index 000000000..3278c50f0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/Bitstring.3
@@ -0,0 +1,64 @@
+.TH "Bitstring" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+Bitstring \- Various functions for a bitstring representation.  
+
+.PP
+.SS "Classes"
+
+.in +1c
+.ti -1c
+.RI "class \fBeoBit< FitT >\fP"
+.br
+.RI "\fIImplementation of bitstring chromosome. \fP"
+.ti -1c
+.RI "class \fBeoBit< FitT >\fP"
+.br
+.RI "\fIImplementation of bitstring chromosome. \fP"
+.ti -1c
+.RI "class \fBeoBitBitFlip\fP"
+.br
+.RI "\fIeoBitFlip --> changes 1 bit \fP"
+.ti -1c
+.RI "class \fBeoDetBitFlip< Chrom >\fP"
+.br
+.RI "\fIeoDetBitFlip --> changes exactly k bits \fP"
+.ti -1c
+.RI "class \fBeoBitMutation< Chrom >\fP"
+.br
+.RI "\fIeoBitMutation --> classical mutation \fP"
+.ti -1c
+.RI "class \fBeoBitInversion< Chrom >\fP"
+.br
+.RI "\fIeoBitInversion: inverts the bits of the chromosome between an interval \fP"
+.ti -1c
+.RI "class \fBeoBitNext< Chrom >\fP"
+.br
+.RI "\fIeoBitNext --> next value when bitstring considered as binary value \fP"
+.ti -1c
+.RI "class \fBeoBitPrev< Chrom >\fP"
+.br
+.RI "\fIeoBitPrev --> previous value when bitstring treated as binary value \fP"
+.ti -1c
+.RI "class \fBeo1PtBitCrossover\fP"
+.br
+.RI "\fIeo1PtBitXover --> classic 1-point crossover \fP"
+.ti -1c
+.RI "class \fBeoUBitXover< Chrom >\fP"
+.br
+.RI "\fIeoUBitXover --> classic Uniform crossover \fP"
+.ti -1c
+.RI "class \fBeoNPtsBitXover< Chrom >\fP"
+.br
+.RI "\fIeoNPtsBitXover --> n-point crossover \fP"
+.ti -1c
+.RI "class \fBeoBitGxOver< Chrom >\fP"
+.br
+.RI "\fIeoBitGxOver --> Npts crossover when bistd::string considered as a std::string of binary-encoded genes (exchanges genes) Is anybody still using it apart from historians ??? :-) \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+Various functions for a bitstring representation. 
+.PP
+
diff --git a/trunk/paradiseo-eo/doc/man/man3/Cov.3 b/trunk/paradiseo-eo/doc/man/man3/Cov.3
new file mode 100644
index 000000000..902f37f41
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/Cov.3
@@ -0,0 +1,53 @@
+.TH "Cov" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+Cov \- Single covariance between two variates.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "void \fBupdate\fP (double a, double b)"
+.br
+.ti -1c
+.RI "double \fBget_meana\fP () const "
+.br
+.ti -1c
+.RI "double \fBget_meanb\fP () const "
+.br
+.ti -1c
+.RI "double \fBget_cov\fP () const "
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBn\fP"
+.br
+.ti -1c
+.RI "double \fBmeana\fP"
+.br
+.ti -1c
+.RI "double \fBmeanb\fP"
+.br
+.ti -1c
+.RI "double \fBsumcov\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+Single covariance between two variates. 
+.PP
+Definition at line 58 of file stats.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/Dummy.3 b/trunk/paradiseo-eo/doc/man/man3/Dummy.3
new file mode 100644
index 000000000..0f13bb7fc
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/Dummy.3
@@ -0,0 +1,150 @@
+.TH "Dummy" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+Dummy \- test program for the general operator - millenium version! uses dummy individuals  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+Inherits \fBEO< double >\fP, \fBEO< double >\fP, \fBEO< double >\fP, \fBEO< double >\fP, \fBEO< double >\fP, and \fBEO< double >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef double \fBType\fP"
+.br
+.ti -1c
+.RI "typedef double \fBType\fP"
+.br
+.ti -1c
+.RI "typedef double \fBType\fP"
+.br
+.ti -1c
+.RI "typedef double \fBType\fP"
+.br
+.ti -1c
+.RI "typedef double \fBType\fP"
+.br
+.ti -1c
+.RI "typedef double \fBType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBDummy\fP (std::string _s='')"
+.br
+.ti -1c
+.RI "void \fBprintOn\fP (std::ostream &_os) const "
+.br
+.RI "\fIWrite object. \fP"
+.ti -1c
+.RI "void \fBprintOn\fP (std::ostream &_os) const "
+.br
+.RI "\fIWrite object. \fP"
+.ti -1c
+.RI "void \fBprintOn\fP (std::ostream &_os) const "
+.br
+.RI "\fIWrite object. \fP"
+.ti -1c
+.RI "void \fBprintOn\fP (std::ostream &_os) const "
+.br
+.RI "\fIWrite object. \fP"
+.in -1c
+.SS "Public Attributes"
+
+.in +1c
+.ti -1c
+.RI "std::string \fBs\fP"
+.br
+.ti -1c
+.RI "double \fBxdist\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+test program for the general operator - millenium version! uses dummy individuals 
+.PP
+Definition at line 27 of file t-eoCheckpointing.cpp.
+.SH "Member Function Documentation"
+.PP 
+.SS "void Dummy::printOn (std::ostream & _os) const\fC [inline, virtual]\fP"
+.PP
+Write object. 
+.PP
+Called printOn since it prints the object _on_ a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_os\fP A std::ostream. 
+.RE
+.PP
+
+.PP
+Reimplemented from \fBEO< double >\fP.
+.PP
+Definition at line 41 of file t-eoGenOp.cpp.
+.PP
+References EO< F >::printOn().
+.SS "void Dummy::printOn (std::ostream & _os) const\fC [inline, virtual]\fP"
+.PP
+Write object. 
+.PP
+Called printOn since it prints the object _on_ a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_os\fP A std::ostream. 
+.RE
+.PP
+
+.PP
+Reimplemented from \fBEO< double >\fP.
+.PP
+Definition at line 23 of file t-eoReplacement.cpp.
+.PP
+References EO< F >::printOn().
+.SS "void Dummy::printOn (std::ostream & _os) const\fC [inline, virtual]\fP"
+.PP
+Write object. 
+.PP
+Called printOn since it prints the object _on_ a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_os\fP A std::ostream. 
+.RE
+.PP
+
+.PP
+Reimplemented from \fBEO< double >\fP.
+.PP
+Definition at line 18 of file t-eoSelect.cpp.
+.PP
+References EO< F >::printOn().
+.SS "void Dummy::printOn (std::ostream & _os) const\fC [inline, virtual]\fP"
+.PP
+Write object. 
+.PP
+Called printOn since it prints the object _on_ a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_os\fP A std::ostream. 
+.RE
+.PP
+
+.PP
+Reimplemented from \fBEO< double >\fP.
+.PP
+Definition at line 24 of file t-eoSharing.cpp.
+.PP
+References EO< F >::printOn().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/EO.3 b/trunk/paradiseo-eo/doc/man/man3/EO.3
new file mode 100644
index 000000000..3ad2f05fd
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/EO.3
@@ -0,0 +1,263 @@
+.TH "EO" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+EO \- EO is a base class for evolvable objects, that is, the subjects of evolution.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoObject\fP, and \fBeoPersistent\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef F \fBFitness\fP"
+.br
+.ti -1c
+.RI "typedef Traits \fBfitness_traits\fP"
+.br
+.ti -1c
+.RI "typedef Traits::storage_type \fBstorage_type\fP"
+.br
+.ti -1c
+.RI "typedef Traits::performance_type \fBperformance_type\fP"
+.br
+.ti -1c
+.RI "typedef Traits::worth_type \fBworth_type\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBEO\fP ()"
+.br
+.RI "\fIDefault constructor. \fP"
+.ti -1c
+.RI "virtual \fB~EO\fP ()"
+.br
+.RI "\fIVirtual dtor. \fP"
+.ti -1c
+.RI "Fitness \fBfitness\fP () const "
+.br
+.RI "\fIReturn fitness value. \fP"
+.ti -1c
+.RI "void \fBinvalidate\fP ()"
+.br
+.ti -1c
+.RI "void \fBfitness\fP (const Fitness &_fitness)"
+.br
+.RI "\fISet fitness. \fP"
+.ti -1c
+.RI "bool \fBinvalid\fP () const "
+.br
+.RI "\fIReturn true If fitness value is invalid, false otherwise. \fP"
+.ti -1c
+.RI "bool \fBoperator<\fP (const \fBEO\fP &_eo2) const "
+.br
+.RI "\fIReturns true if. \fP"
+.ti -1c
+.RI "bool \fBoperator>\fP (const \fBEO\fP &_eo2) const "
+.br
+.ti -1c
+.RI "void \fBfitness\fP (performance_type perf)"
+.br
+.ti -1c
+.RI "void \fBperformance\fP (performance_type perf)"
+.br
+.ti -1c
+.RI "performance_type \fBperformance\fP (void) const "
+.br
+.ti -1c
+.RI "void \fBworth\fP (worth_type worth)"
+.br
+.ti -1c
+.RI "worth_type \fBworth\fP (void) const "
+.br
+.ti -1c
+.RI "worth_type \fBfitness\fP (void) const "
+.br
+.ti -1c
+.RI "void \fBinvalidate\fP (void)"
+.br
+.ti -1c
+.RI "void \fBinvalidate_worth\fP (void)"
+.br
+.ti -1c
+.RI "bool \fBoperator<\fP (const EO< Fitness, Traits > &other) const "
+.br
+.ti -1c
+.RI "bool \fBoperator>\fP (const EO< Fitness, Traits > &other) const "
+.br
+.in -1c
+.PP
+.RI "\fB\fP"
+.br
+
+.in +1c
+.in +1c
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIReturn the class id. \fP"
+.ti -1c
+.RI "virtual void \fBreadFrom\fP (std::istream &_is)"
+.br
+.RI "\fIRead object.\\ Calls base class, just in case that one had something to do. \fP"
+.ti -1c
+.RI "virtual void \fBprintOn\fP (std::ostream &_os) const "
+.br
+.RI "\fIWrite object. \fP"
+.in -1c
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "Fitness \fBrepFitness\fP"
+.br
+.ti -1c
+.RI "bool \fBinvalidFitness\fP"
+.br
+.ti -1c
+.RI "bool \fBvalid_performance\fP"
+.br
+.ti -1c
+.RI "bool \fBvalid_worth\fP"
+.br
+.ti -1c
+.RI "storage_type \fBrep_fitness\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class EO< F >"
+EO is a base class for evolvable objects, that is, the subjects of evolution. 
+
+EOs have only got a fitness, which at the same time needs to be only an object with the operation less than (<) defined. Fitness says how good is the object; evolution or change of these objects is left to the genetic operators. A fitness less than another means a worse fitness, in whatever the context; thus, fitness is always maximized; although it can be minimized with a proper definition of the < operator. The fitness object must have, besides an void ctor, a copy ctor. 
+.PP
+Definition at line 44 of file EO.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBEO\fP< F >::\fBEO\fP ()\fC [inline]\fP"
+.PP
+Default constructor. 
+.PP
+Fitness must have a ctor which takes 0 as a value; we can not use void ctors here since default types like float have no void initializer. VC++ allows it, but gcc does not 
+.PP
+Definition at line 54 of file EO.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template void \fBEO\fP< F >::fitness (const Fitness & _fitness)\fC [inline]\fP"
+.PP
+Set fitness. 
+.PP
+At the same time, validates it. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_fitness\fP New fitness value. 
+.RE
+.PP
+
+.PP
+Definition at line 72 of file EO.h.
+.SS "template bool \fBEO\fP< F >::invalid () const\fC [inline]\fP"
+.PP
+Return true If fitness value is invalid, false otherwise. 
+.PP
+\fBReturns:\fP
+.RS 4
+true If fitness is invalid. 
+.RE
+.PP
+
+.PP
+Definition at line 81 of file EO.h.
+.PP
+Referenced by EO< PyFitness >::fitness(), eoOneMaxEvalFunc< EOT >::operator()(), eoOneFifthMutation< EOT >::operator()(), eoEvalFuncPtr< EOT, FitT, FunctionArg >::operator()(), eoEvalFuncCounter< EOT >::operator()(), and EO< PyFitness >::printOn().
+.SS "template bool \fBEO\fP< F >::operator< (const \fBEO\fP< F > & _eo2) const\fC [inline]\fP"
+.PP
+Returns true if. 
+.PP
+\fBReturns:\fP
+.RS 4
+true if the fitness is higher 
+.RE
+.PP
+
+.PP
+Definition at line 86 of file EO.h.
+.PP
+Referenced by eoVector< FitT, bool >::operator<().
+.SS "template virtual std::string \fBEO\fP< F >::className (void) const\fC [inline, virtual]\fP"
+.PP
+Return the class id. 
+.PP
+\fBReturns:\fP
+.RS 4
+the class name as a std::string 
+.RE
+.PP
+
+.PP
+Implements \fBeoObject\fP.
+.PP
+Reimplemented in \fBeoEsFull< Fit >\fP, \fBeoEsSimple< Fit >\fP, \fBeoEsStdev< Fit >\fP, \fBeoReal< FitT >\fP, \fBeoBit< FitT >\fP, \fBeoParseTree< FType, Node >\fP, \fBeoString< fitnessT >\fP, and \fBeoOneMax< FitT >\fP.
+.PP
+Definition at line 95 of file EO.h.
+.SS "template virtual void \fBEO\fP< F >::readFrom (std::istream & _is)\fC [inline, virtual]\fP"
+.PP
+Read object.\\ Calls base class, just in case that one had something to do. 
+.PP
+The read and print methods should be compatible and have the same format. In principle, format is 'plain': they just print a number 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_is\fP a std::istream. 
+.RE
+.PP
+\fBExceptions:\fP
+.RS 4
+\fIruntime_std::exception\fP If a valid object can't be read. 
+.RE
+.PP
+
+.PP
+Implements \fBeoPersistent\fP.
+.PP
+Reimplemented in \fBeoVector< FitT, GeneType >\fP, \fBeoEsFull< Fit >\fP, \fBeoEsSimple< Fit >\fP, \fBeoEsStdev< Fit >\fP, \fBeoBit< FitT >\fP, \fBeoParseTree< FType, Node >\fP, \fBeoExternalEO< Fit, External >\fP, \fBeoVector< Fit, double >\fP, \fBeoVector< FitT, double >\fP, and \fBeoVector< FitT, bool >\fP.
+.PP
+Definition at line 105 of file EO.h.
+.PP
+Referenced by eoVector< FitT, bool >::readFrom(), eoPop< Dummy >::readFrom(), eoParseTree< FType, Node >::readFrom(), eoOneMax< FitT >::readFrom(), eoExternalEO< Fit, External >::readFrom(), and eoBit< FitT >::readFrom().
+.SS "template virtual void \fBEO\fP< F >::printOn (std::ostream & _os) const\fC [inline, virtual]\fP"
+.PP
+Write object. 
+.PP
+Called printOn since it prints the object _on_ a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_os\fP A std::ostream. 
+.RE
+.PP
+
+.PP
+Implements \fBeoPrintable\fP.
+.PP
+Reimplemented in \fBeoVector< FitT, GeneType >\fP, \fBeoEsFull< Fit >\fP, \fBeoEsSimple< Fit >\fP, \fBeoEsStdev< Fit >\fP, \fBeoBit< FitT >\fP, \fBeoParseTree< FType, Node >\fP, \fBeoExternalEO< Fit, External >\fP, \fBeoString< fitnessT >\fP, \fBDummy\fP, \fBDummy\fP, \fBDummy\fP, \fBDummy\fP, \fBeoVector< Fit, double >\fP, \fBeoVector< FitT, double >\fP, and \fBeoVector< FitT, bool >\fP.
+.PP
+Definition at line 129 of file EO.h.
+.PP
+Referenced by Dummy::printOn(), eoVector< FitT, bool >::printOn(), eoString< fitnessT >::printOn(), eoParseTree< FType, Node >::printOn(), eoOneMax< FitT >::printOn(), eoExternalEO< Fit, External >::printOn(), and eoBit< FitT >::printOn().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/EvolutionStrategies.3 b/trunk/paradiseo-eo/doc/man/man3/EvolutionStrategies.3
new file mode 100644
index 000000000..b553385d4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/EvolutionStrategies.3
@@ -0,0 +1,41 @@
+.TH "EvolutionStrategies" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+EvolutionStrategies \- 
+.SS "Classes"
+
+.in +1c
+.ti -1c
+.RI "class \fBeoEsChromInit< EOT >\fP"
+.br
+.RI "\fIRandom Es-chromosome initializer (therefore derived from \fBeoInit\fP). \fP"
+.ti -1c
+.RI "class \fBeoEsFull< Fit >\fP"
+.br
+.RI "\fIThe most complex evolutionary strategy representation. \fP"
+.ti -1c
+.RI "class \fBeoEsMutate< EOT >\fP"
+.br
+.RI "\fIES-style mutation in the large. \fP"
+.ti -1c
+.RI "class \fBeoEsMutationInit\fP"
+.br
+.RI "\fIInitialize Mutation operator. \fP"
+.ti -1c
+.RI "class \fBeoEsSimple< Fit >\fP"
+.br
+.RI "\fISimple Evolution Strategy. \fP"
+.ti -1c
+.RI "class \fBeoEsStdev< Fit >\fP"
+.br
+.RI "\fIEvolutionary Strategy with a standard deviation per parameter. \fP"
+.ti -1c
+.RI "class \fBeoIntBounds\fP"
+.br
+.RI "\fIDefines bound classes for real numbers. \fP"
+.ti -1c
+.RI "class \fBeoRealBounds\fP"
+.br
+.RI "\fIDefines bound classes for real numbers. \fP"
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/MemPool.3 b/trunk/paradiseo-eo/doc/man/man3/MemPool.3
new file mode 100644
index 000000000..05cc5fb02
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/MemPool.3
@@ -0,0 +1,58 @@
+.TH "MemPool" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+MemPool \- Pool allocator for the subtree and parse tree classes (homebrew and not compliant to ANSI allocator requirements) (c) copyright Maarten Keijzer 1999, 2000.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBMemPool\fP (unsigned int sz)"
+.br
+.ti -1c
+.RI "void * \fBallocate\fP ()"
+.br
+.ti -1c
+.RI "void \fBdeallocate\fP (void *b)"
+.br
+.in -1c
+.SS "Private Member Functions"
+
+.in +1c
+.ti -1c
+.RI "void \fBgrow\fP ()"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "Chunk * \fBchunks\fP"
+.br
+.ti -1c
+.RI "const unsigned int \fBesize\fP"
+.br
+.ti -1c
+.RI "Link * \fBhead\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+Pool allocator for the subtree and parse tree classes (homebrew and not compliant to ANSI allocator requirements) (c) copyright Maarten Keijzer 1999, 2000. 
+
+Permission to copy, use, modify, sell and distribute this software is granted provided this copyright notice appears in all copies. This software is provided 'as is' without express or implied warranty, and with no claim as to its suitability for any purpose.
+.PP
+Permission to modify the code and to distribute modified code is granted, provided the above notices are retained, and a notice that the code was modified is included with the above copyright notice. 
+.PP
+Definition at line 21 of file node_pool.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/MinimizingTraits.3 b/trunk/paradiseo-eo/doc/man/man3/MinimizingTraits.3
new file mode 100644
index 000000000..9e13c7fcf
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/MinimizingTraits.3
@@ -0,0 +1,28 @@
+.TH "MinimizingTraits" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+MinimizingTraits \- test program for Pareto Fitness  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+Inherits \fBeoParetoFitnessTraits\fP.
+.PP
+.SS "Static Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "bool \fBmaximizing\fP (int)"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+test program for Pareto Fitness 
+.PP
+Definition at line 36 of file t-eoParetoFitness.cpp.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/NodeSelector.3 b/trunk/paradiseo-eo/doc/man/man3/NodeSelector.3
new file mode 100644
index 000000000..55be97315
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/NodeSelector.3
@@ -0,0 +1,30 @@
+.TH "NodeSelector" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+NodeSelector \- Base class for selecting nodes.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherited by \fBBiasedNodeSelector\fP, and \fBRandomNodeSelector\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual NodeSelection \fBselect_node\fP (Sym sym) const =0"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+Base class for selecting nodes. 
+.PP
+Definition at line 24 of file NodeSelector.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/Operators.3 b/trunk/paradiseo-eo/doc/man/man3/Operators.3
new file mode 100644
index 000000000..fbb561e66
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/Operators.3
@@ -0,0 +1,8 @@
+.TH "Operators" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+Operators \- Genetic Operators are used for various purposes.  
+
+.PP
+
diff --git a/trunk/paradiseo-eo/doc/man/man3/ParseTree.3 b/trunk/paradiseo-eo/doc/man/man3/ParseTree.3
new file mode 100644
index 000000000..2148f99a4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/ParseTree.3
@@ -0,0 +1,75 @@
+.TH "ParseTree" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+ParseTree \- Various functions for tree-based Genetic Programming.  
+
+.PP
+.SS "Classes"
+
+.in +1c
+.ti -1c
+.RI "class \fBeoParseTree< FType, Node >\fP"
+.br
+.RI "\fIImplementation of parse-tree for genetic programming. \fP"
+.ti -1c
+.RI "class \fBeoParseTreeDepthInit< FType, Node >\fP"
+.br
+.RI "\fIeoParseTreeDepthInit : the initializer class for \fBeoParseTree\fP \fP"
+.ti -1c
+.RI "class \fBeoSubtreeXOver< FType, Node >\fP"
+.br
+.RI "\fIeoSubtreeXOver --> subtree xover \fP"
+.ti -1c
+.RI "class \fBeoBranchMutation< FType, Node >\fP"
+.br
+.RI "\fIeoBranchMutation --> replace a subtree with a randomly created subtree \fP"
+.ti -1c
+.RI "class \fBeoPointMutation< FType, Node >\fP"
+.br
+.RI "\fIeoPointMutation --> replace a Node with a Node of the same arity \fP"
+.ti -1c
+.RI "class \fBeoExpansionMutation< FType, Node >\fP"
+.br
+.RI "\fIeoExpansionMutation --> replace a terminal with a randomly created subtree \fP"
+.ti -1c
+.RI "class \fBeoCollapseSubtreeMutation< FType, Node >\fP"
+.br
+.RI "\fIeoCollapseSubtree --> replace a subtree with a randomly chosen terminal \fP"
+.ti -1c
+.RI "class \fBeoHoistMutation< FType, Node >\fP"
+.br
+.RI "\fIeoHoistMutation --> replace the individual with one of its subtree's \fP"
+.in -1c
+.SS "Functions"
+
+.in +1c
+.ti -1c
+.RI "template void \fBeoInitRampedHalfAndHalf\fP (\fBeoPop\fP< \fBeoParseTree\fP< FType, Node > > &pop, unsigned int population_size, unsigned int init_max_depth, std::vector< Node > &initializor)"
+.br
+.RI "\fIA template function for ramped half and half initialization of an \fBeoParseTree\fP population. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+Various functions for tree-based Genetic Programming. 
+.PP
+.SH "Function Documentation"
+.PP 
+.SS "template void eoInitRampedHalfAndHalf (\fBeoPop\fP< \fBeoParseTree\fP< FType, Node > > & pop, unsigned int population_size, unsigned int init_max_depth, std::vector< Node > & initializor)"
+.PP
+A template function for ramped half and half initialization of an \fBeoParseTree\fP population. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIpop\fP the population to be created 
+.br
+\fIpopulation_size\fP the size of the population to be created 
+.br
+\fIinit_max_depth\fP the initial maximum tree depth 
+.br
+\fIinitializor\fP A std::vector containing the possible nodes 
+.RE
+.PP
+
+.PP
+Definition at line 179 of file eoParseTreeDepthInit.h.
diff --git a/trunk/paradiseo-eo/doc/man/man3/PropCombinedOperators.3 b/trunk/paradiseo-eo/doc/man/man3/PropCombinedOperators.3
new file mode 100644
index 000000000..9aa9dc271
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/PropCombinedOperators.3
@@ -0,0 +1,8 @@
+.TH "PropCombinedOperators" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+PropCombinedOperators \- Combination of same-type Genetic Operators - Proportional choice.  
+
+.PP
+
diff --git a/trunk/paradiseo-eo/doc/man/man3/RandomNodeSelector.3 b/trunk/paradiseo-eo/doc/man/man3/RandomNodeSelector.3
new file mode 100644
index 000000000..1632f4975
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/RandomNodeSelector.3
@@ -0,0 +1,30 @@
+.TH "RandomNodeSelector" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+RandomNodeSelector \- Select nodes uniformly.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBNodeSelector\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "NodeSelection \fBselect_node\fP (Sym sym) const "
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+Select nodes uniformly. 
+.PP
+Definition at line 49 of file NodeSelector.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/Selectors.3 b/trunk/paradiseo-eo/doc/man/man3/Selectors.3
new file mode 100644
index 000000000..68a456ba4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/Selectors.3
@@ -0,0 +1,5 @@
+.TH "Selectors" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+Selectors \- 
diff --git a/trunk/paradiseo-eo/doc/man/man3/StParseTree.3 b/trunk/paradiseo-eo/doc/man/man3/StParseTree.3
new file mode 100644
index 000000000..27565aae7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/StParseTree.3
@@ -0,0 +1,44 @@
+.TH "StParseTree" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+StParseTree \- Various functions for strongly typed tree-based Genetic Programming.  
+
+.PP
+.SS "Classes"
+
+.in +1c
+.ti -1c
+.RI "class \fBeoStParseTreeDepthInit< FType, Node >\fP"
+.br
+.RI "\fIeoStParseTreeDepthInit : the initializer class for strongly typed tree-based genetic programming \fP"
+.ti -1c
+.RI "class \fBeoStSubtreeXOver< FType, Node >\fP"
+.br
+.RI "\fIeoStSubtreeXOver --> subtree xover for strongly typed tree-based genetic programming \fP"
+.ti -1c
+.RI "class \fBeoStBranchMutation< FType, Node >\fP"
+.br
+.RI "\fIeoStBranchMutation --> replace a strongly typed subtree with a randomly created strongly typed subtree \fP"
+.ti -1c
+.RI "class \fBeoStPointMutation< FType, Node >\fP"
+.br
+.RI "\fIeoStPointMutation --> replace a Node with a Node of the same arity and type \fP"
+.ti -1c
+.RI "class \fBeoStHoistMutation< FType, Node >\fP"
+.br
+.RI "\fIeoStHoistMutation --> replace the individual with one of its strongly typed subtree's \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+Various functions for strongly typed tree-based Genetic Programming. 
+.PP
+The StParseTree functions use the same \fBeoParseTree\fP class for the individual but now each node class must have two additional functions. 
+.PD 0
+
+.IP "\(bu" 2
+int type(void) which returns the return type of the node 
+.IP "\(bu" 2
+int type(int child) which returns the required type for child 0, 1 or 2
+.PP
+Pruning strongly typed trees is not possible at the moment. 
diff --git a/trunk/paradiseo-eo/doc/man/man3/T_pickle_suite.3 b/trunk/paradiseo-eo/doc/man/man3/T_pickle_suite.3
new file mode 100644
index 000000000..2fb95aca6
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/T_pickle_suite.3
@@ -0,0 +1,36 @@
+.TH "T_pickle_suite" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+T_pickle_suite \- Implements pickle support for \fBeoPersistent\fP derivatives.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Static Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "std::string \fBprint_to_string\fP (const T &t)"
+.br
+.ti -1c
+.RI "boost::python::tuple \fBgetstate\fP (const T &t)"
+.br
+.ti -1c
+.RI "void \fBsetstate\fP (T &t, boost::python::tuple pickled)"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template struct T_pickle_suite< T >"
+Implements pickle support for \fBeoPersistent\fP derivatives. 
+.PP
+Definition at line 32 of file pickle.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/UF_random_generator.3 b/trunk/paradiseo-eo/doc/man/man3/UF_random_generator.3
new file mode 100644
index 000000000..486e4f399
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/UF_random_generator.3
@@ -0,0 +1,40 @@
+.TH "UF_random_generator" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+UF_random_generator \- Another class \fBrandom_generator\fP that can be used in the STL random_shuffle function (see \fBeoPop::shuffle\fP): its operator() takes an unsigned argument m and must return an unsigned uniformly distributed in [0,m}.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBUF_random_generator\fP (\fBeoRng\fP &_rng=rng)"
+.br
+.ti -1c
+.RI "T \fBoperator()\fP (T _t)"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoRng\fP & \fBrandom\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class UF_random_generator< T >"
+Another class \fBrandom_generator\fP that can be used in the STL random_shuffle function (see \fBeoPop::shuffle\fP): its operator() takes an unsigned argument m and must return an unsigned uniformly distributed in [0,m}. 
+.PP
+Definition at line 121 of file rnd_generators.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/VirusBitFlip.3 b/trunk/paradiseo-eo/doc/man/man3/VirusBitFlip.3
new file mode 100644
index 000000000..bea0b8cbe
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/VirusBitFlip.3
@@ -0,0 +1,53 @@
+.TH "VirusBitFlip" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+VirusBitFlip \- VirusBitFlip --> changes 1 bit.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< eoVirus< FitT > >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIThe class name. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (eoVirus< \fBFitT\fP > &_chrom)"
+.br
+.RI "\fIChange one bit. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class VirusBitFlip< FitT >"
+VirusBitFlip --> changes 1 bit. 
+.PP
+Definition at line 40 of file VirusOp.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template bool \fBVirusBitFlip\fP< \fBFitT\fP >::operator() (eoVirus< \fBFitT\fP > & _chrom)\fC [inline, virtual]\fP"
+.PP
+Change one bit. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIchrom\fP The cromosome which one bit is going to be changed. 
+.RE
+.PP
+
+.PP
+Implements \fBeoUF< eoVirus< FitT > &, bool >\fP.
+.PP
+Definition at line 49 of file VirusOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/VirusShiftMutation.3 b/trunk/paradiseo-eo/doc/man/man3/VirusShiftMutation.3
new file mode 100644
index 000000000..bcba1ebc7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/VirusShiftMutation.3
@@ -0,0 +1,57 @@
+.TH "VirusShiftMutation" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+VirusShiftMutation \- Works for 1-bit virus; shifts the one to the right or left.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< eoVirus< FitT > >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBVirusShiftMutation\fP ()"
+.br
+.RI "\fICtor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIThe class name. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (eoVirus< \fBFitT\fP > &_chrom)"
+.br
+.RI "\fIChange one bit. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class VirusShiftMutation< FitT >"
+Works for 1-bit virus; shifts the one to the right or left. 
+.PP
+Definition at line 86 of file VirusOp.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template bool \fBVirusShiftMutation\fP< \fBFitT\fP >::operator() (eoVirus< \fBFitT\fP > & _chrom)\fC [inline, virtual]\fP"
+.PP
+Change one bit. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIchrom\fP The cromosome which one bit is going to be changed. 
+.RE
+.PP
+
+.PP
+Implements \fBeoUF< eoVirus< FitT > &, bool >\fP.
+.PP
+Definition at line 99 of file VirusOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_app_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_app_.3
new file mode 100644
index 000000000..b129eac96
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_app_.3
@@ -0,0 +1,18 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/app/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/ Directory Reference \- 
+.SS "Directories"
+
+.in +1c
+.ti -1c
+.RI "directory\fBgprop\fP"
+.br
+.ti -1c
+.RI "directory\fBgpsymreg\fP"
+.br
+.ti -1c
+.RI "directory\fBmastermind\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_app_gprop_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_app_gprop_.3
new file mode 100644
index 000000000..0e50b3dad
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_app_gprop_.3
@@ -0,0 +1,30 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gprop/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gprop/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gprop/ Directory Reference \- 
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBgprop.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBgprop.h\fP"
+.br
+.ti -1c
+.RI "file \fBl2.h\fP"
+.br
+.ti -1c
+.RI "file \fBmlp.h\fP"
+.br
+.ti -1c
+.RI "file \fBmse.h\fP"
+.br
+.ti -1c
+.RI "file \fBqp.h\fP"
+.br
+.ti -1c
+.RI "file \fBvecop.h\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_app_gpsymreg_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_app_gpsymreg_.3
new file mode 100644
index 000000000..7158c7304
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_app_gpsymreg_.3
@@ -0,0 +1,21 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gpsymreg/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gpsymreg/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/gpsymreg/ Directory Reference \- 
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBfitness.h\fP"
+.br
+.ti -1c
+.RI "file \fBmain.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBnode.h\fP"
+.br
+.ti -1c
+.RI "file \fBparameters.h\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_app_mastermind_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_app_mastermind_.3
new file mode 100644
index 000000000..6edf55aa7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_app_mastermind_.3
@@ -0,0 +1,15 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/mastermind/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/app/mastermind/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/app/mastermind/ Directory Reference \- 
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBmastermind.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBmastermind.h\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_.3
new file mode 100644
index 000000000..9f5be757c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_.3
@@ -0,0 +1,25 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/ Directory Reference \- 
+.SS "Directories"
+
+.in +1c
+.ti -1c
+.RI "directory\fBmathsym\fP"
+.br
+.ti -1c
+.RI "directory\fBMGE\fP"
+.br
+.in -1c
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBeoAged.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoDrawable.h\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_MGE_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_MGE_.3
new file mode 100644
index 000000000..8d98007bf
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_MGE_.3
@@ -0,0 +1,18 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/MGE/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/MGE/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/MGE/ Directory Reference \- 
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBeoInitVirus.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoVirus.h\fP"
+.br
+.ti -1c
+.RI "file \fBVirusOp.h\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_.3
new file mode 100644
index 000000000..a64a7d6d6
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_.3
@@ -0,0 +1,43 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/ Directory Reference \- 
+.SS "Directories"
+
+.in +1c
+.ti -1c
+.RI "directory\fBeo_interface\fP"
+.br
+.ti -1c
+.RI "directory\fBeval\fP"
+.br
+.ti -1c
+.RI "directory\fBfun\fP"
+.br
+.ti -1c
+.RI "directory\fBgen\fP"
+.br
+.ti -1c
+.RI "directory\fBregression\fP"
+.br
+.ti -1c
+.RI "directory\fBsym\fP"
+.br
+.ti -1c
+.RI "directory\fBtest\fP"
+.br
+.in -1c
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBcontrib/mathsym/README\fP"
+.br
+.ti -1c
+.RI "file \fBshared_ptr.h\fP"
+.br
+.ti -1c
+.RI "file \fBsymreg.cpp\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_eo_interface_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_eo_interface_.3
new file mode 100644
index 000000000..078e14927
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_eo_interface_.3
@@ -0,0 +1,36 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eo_interface/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eo_interface/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eo_interface/ Directory Reference \- 
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBeoSym.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoSymCrossover.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBeoSymCrossover.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoSymEval.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoSymInit.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoSymLambdaMutate.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBeoSymLambdaMutate.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoSymMutate.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBeoSymMutate.h\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_eval_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_eval_.3
new file mode 100644
index 000000000..ebcc5503e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_eval_.3
@@ -0,0 +1,33 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eval/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eval/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/eval/ Directory Reference \- 
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBBoundsCheck.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBBoundsCheck.h\fP"
+.br
+.ti -1c
+.RI "file \fBInterval.h\fP"
+.br
+.ti -1c
+.RI "file \fBMultiFuncs.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBMultiFunction.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBMultiFunction.h\fP"
+.br
+.ti -1c
+.RI "file \fBsym_compile.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBsym_compile.h\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_fun_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_fun_.3
new file mode 100644
index 000000000..e7741cb41
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_fun_.3
@@ -0,0 +1,27 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/fun/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/fun/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/fun/ Directory Reference \- 
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBFunDef.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBFunDef.h\fP"
+.br
+.ti -1c
+.RI "file \fBsym_operations.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBSymOps.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBSymOps.h\fP"
+.br
+.ti -1c
+.RI "file \fButil.cpp\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_gen_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_gen_.3
new file mode 100644
index 000000000..bcd18f1ad
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_gen_.3
@@ -0,0 +1,27 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/gen/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/gen/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/gen/ Directory Reference \- 
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBLanguageTable.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBLanguageTable.h\fP"
+.br
+.ti -1c
+.RI "file \fBNodeSelector.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBNodeSelector.h\fP"
+.br
+.ti -1c
+.RI "file \fBTreeBuilder.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBTreeBuilder.h\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_regression_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_regression_.3
new file mode 100644
index 000000000..ba17b0566
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_regression_.3
@@ -0,0 +1,36 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/regression/ Directory Reference \- 
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBDataset.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBDataset.h\fP"
+.br
+.ti -1c
+.RI "file \fBErrorMeasure.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBErrorMeasure.h\fP"
+.br
+.ti -1c
+.RI "file \fBScaling.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBScaling.h\fP"
+.br
+.ti -1c
+.RI "file \fBstats.h\fP"
+.br
+.ti -1c
+.RI "file \fBTargetInfo.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBTargetInfo.h\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_sym_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_sym_.3
new file mode 100644
index 000000000..c8e4370dd
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_sym_.3
@@ -0,0 +1,27 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/sym/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/sym/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/sym/ Directory Reference \- 
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBREADME.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBSym.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBSym.h\fP"
+.br
+.ti -1c
+.RI "file \fBSymImpl.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBSymImpl.h\fP"
+.br
+.ti -1c
+.RI "file \fBtoken.h\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_test_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_test_.3
new file mode 100644
index 000000000..dbcc25324
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_contrib_mathsym_test_.3
@@ -0,0 +1,27 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/test/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/test/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/contrib/mathsym/test/ Directory Reference \- 
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBtest_compile.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBtest_diff.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBtest_lambda.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBtest_mf.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBtest_simplify.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBtesteo.cpp\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_.3
new file mode 100644
index 000000000..b02ea9a41
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_.3
@@ -0,0 +1,346 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ Directory Reference \- 
+.SS "Directories"
+
+.in +1c
+.ti -1c
+.RI "directory\fBdo\fP"
+.br
+.ti -1c
+.RI "directory\fBes\fP"
+.br
+.ti -1c
+.RI "directory\fBga\fP"
+.br
+.ti -1c
+.RI "directory\fBgp\fP"
+.br
+.ti -1c
+.RI "directory\fBother\fP"
+.br
+.ti -1c
+.RI "directory\fBpyeo\fP"
+.br
+.ti -1c
+.RI "directory\fButils\fP"
+.br
+.in -1c
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBapply.h\fP"
+.br
+.ti -1c
+.RI "file \fBEO.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoAlgo.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoBreed.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoCellularEasyEA.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoCloneOps.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoCombinedContinue.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoCombinedInit.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoContinue.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoCounter.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoCtrlCContinue.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBeoCtrlCContinue.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoDetSelect.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoDetTournamentSelect.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoDistribUpdater.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoDistribution.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoDominanceMap.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoEasyEA.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoEDA.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoEvalContinue.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoEvalFunc.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoEvalFuncCounter.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoEvalFuncPtr.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoFactory.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoFitContinue.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoFitnessScalingSelect.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoFlOrBinOp.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoFlOrMonOp.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoFlOrQuadOp.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoFunctor.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoFunctorStore.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBeoFunctorStore.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoG3Replacement.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoGenContinue.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoGeneralBreeder.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoGenOp.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoInit.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoInvalidateOps.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoLinearFitScaling.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoMerge.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoMergeReduce.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoMGGReplacement.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoNDSorting.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoObject.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoOneToOneBreeder.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoOp.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoOpContainer.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoOpSelMason.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoParetoConstraintFitness.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoParetoFitness.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBeoParetoFitness.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoParetoRanking.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoPerf2Worth.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoPeriodicContinue.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoPersistent.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBeoPersistent.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoPop.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoPopAlgo.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoPopEvalFunc.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoPopulator.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoPrintable.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBeoPrintable.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoPropGAGenOp.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoProportionalCombinedOp.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoProportionalSelect.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoRandomSelect.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoRanking.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoRankingSelect.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoReduce.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoReduceMerge.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoReduceMergeReduce.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoReduceSplit.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoReplacement.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoScalarFitness.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoScalarFitnessAssembled.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBeoScalarFitnessAssembled.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoSelect.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoSelectFactory.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoSelectFromWorth.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoSelectMany.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoSelectNumber.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoSelectOne.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoSelectPerc.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoSequentialSelect.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoSGA.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoSGAGenOp.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoSGATransform.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoSharing.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoSharingSelect.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoSimpleEDA.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoSteadyFitContinue.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoSTLFunctor.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoStochasticUniversalSelect.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoStochTournamentSelect.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoSurviveAndDie.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoTransform.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoTruncatedSelectMany.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoTruncatedSelectOne.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoTruncSelect.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoVariableLengthCrossover.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoVariableLengthMutation.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoVector.h\fP"
+.br
+.ti -1c
+.RI "file \fBes.h\fP"
+.br
+.ti -1c
+.RI "file \fBga.h\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_do_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_do_.3
new file mode 100644
index 000000000..dab2b4ab9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_do_.3
@@ -0,0 +1,45 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/do/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/src/do/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/do/ Directory Reference \- 
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBmake_algo_easea.h\fP"
+.br
+.ti -1c
+.RI "file \fBmake_algo_pareto.h\fP"
+.br
+.ti -1c
+.RI "file \fBmake_algo_scalar.h\fP"
+.br
+.ti -1c
+.RI "file \fBmake_checkpoint.h\fP"
+.br
+.ti -1c
+.RI "file \fBmake_checkpoint_assembled.h\fP"
+.br
+.ti -1c
+.RI "file \fBmake_checkpoint_FDC.h\fP"
+.br
+.ti -1c
+.RI "file \fBmake_checkpoint_pareto.h\fP"
+.br
+.ti -1c
+.RI "file \fBmake_continue.h\fP"
+.br
+.ti -1c
+.RI "file \fBmake_continue_pareto.h\fP"
+.br
+.ti -1c
+.RI "file \fBmake_general_replacement.h\fP"
+.br
+.ti -1c
+.RI "file \fBmake_pop.h\fP"
+.br
+.ti -1c
+.RI "file \fBmake_run.h\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_es_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_es_.3
new file mode 100644
index 000000000..c03e69b14
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_es_.3
@@ -0,0 +1,138 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/es/ Directory Reference \- 
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBCMAParams.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBCMAParams.h\fP"
+.br
+.ti -1c
+.RI "file \fBCMAState.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBCMAState.h\fP"
+.br
+.ti -1c
+.RI "file \fBeig.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBeig.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoCMABreed.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoCMAInit.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoEsChromInit.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoEsFull.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoEsGlobalXover.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoEsMutate.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoEsMutationInit.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoEsSimple.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoEsStandardXover.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoEsStdev.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoNormalMutation.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoReal.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoRealAtomXover.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoRealInitBounded.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoRealOp.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoSBXcross.h\fP"
+.br
+.ti -1c
+.RI "file \fBmake_algo_scalar_es.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBmake_algo_scalar_real.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBmake_checkpoint_es.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBmake_checkpoint_real.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBmake_continue_es.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBmake_continue_real.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBmake_es.h\fP"
+.br
+.ti -1c
+.RI "file \fBmake_genotype_es.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBmake_genotype_real.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBmake_genotype_real.h\fP"
+.br
+.ti -1c
+.RI "file \fBes/make_op.h\fP"
+.br
+.ti -1c
+.RI "file \fBmake_op_es.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBmake_op_es.h\fP"
+.br
+.ti -1c
+.RI "file \fBmake_op_real.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBmake_op_real.h\fP"
+.br
+.ti -1c
+.RI "file \fBmake_pop_es.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBmake_pop_real.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBmake_real.h\fP"
+.br
+.ti -1c
+.RI "file \fBmake_run_es.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBmake_run_real.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBmatrices.h\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_ga_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_ga_.3
new file mode 100644
index 000000000..405c6cae8
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_ga_.3
@@ -0,0 +1,66 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/ga/ Directory Reference \- 
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBeoBit.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoBitOp.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoBitOpFactory.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoBoolFlip.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoPBILAdditive.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoPBILDistrib.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoPBILOrg.h\fP"
+.br
+.ti -1c
+.RI "file \fBmake_algo_scalar_ga.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBmake_checkpoint_ga.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBmake_continue_ga.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBmake_ga.h\fP"
+.br
+.ti -1c
+.RI "file \fBmake_genotype_ga.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBmake_genotype_ga.h\fP"
+.br
+.ti -1c
+.RI "file \fBga/make_op.h\fP"
+.br
+.ti -1c
+.RI "file \fBmake_op_ga.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBmake_PBILdistrib.h\fP"
+.br
+.ti -1c
+.RI "file \fBmake_PBILupdate.h\fP"
+.br
+.ti -1c
+.RI "file \fBmake_pop_ga.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBmake_run_ga.cpp\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_gp_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_gp_.3
new file mode 100644
index 000000000..4ac350809
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_gp_.3
@@ -0,0 +1,30 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/gp/ Directory Reference \- 
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBeoParseTree.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoParseTreeDepthInit.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoParseTreeOp.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoStParseTreeDepthInit.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoStParseTreeOp.h\fP"
+.br
+.ti -1c
+.RI "file \fBnode_pool.h\fP"
+.br
+.ti -1c
+.RI "file \fBparse_tree.h\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_other_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_other_.3
new file mode 100644
index 000000000..e5bff2bae
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_other_.3
@@ -0,0 +1,18 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/other/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/src/other/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/other/ Directory Reference \- 
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBeoExternalEO.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoExternalOpFunctions.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoString.h\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_pyeo_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_pyeo_.3
new file mode 100644
index 000000000..e660ec568
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_pyeo_.3
@@ -0,0 +1,75 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/pyeo/ Directory Reference \- 
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBabstract1.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBalgos.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBbreeders.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBcontinuators.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBdef_abstract_functor.h\fP"
+.br
+.ti -1c
+.RI "file \fBgeneticOps.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBmergers.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBmonitors.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBsrc/pyeo/NEWS\fP"
+.br
+.ti -1c
+.RI "file \fBperf2worth.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBpickle.h\fP"
+.br
+.ti -1c
+.RI "file \fBPyEO.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBPyEO.h\fP"
+.br
+.ti -1c
+.RI "file \fBrandom_numbers.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBsrc/pyeo/README\fP"
+.br
+.ti -1c
+.RI "file \fBreduce.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBreplacement.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBselectOne.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBselectors.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBstatistics.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBvalueParam.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBvalueParam.h\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_utils_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_utils_.3
new file mode 100644
index 000000000..cb0f97851
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_src_utils_.3
@@ -0,0 +1,153 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/src/utils/ Directory Reference \- 
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBcompatibility.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoAssembledFitnessStat.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoCheckPoint.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoData.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBeoData.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoDistance.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoFDCStat.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoFileMonitor.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBeoFileMonitor.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoFileSnapshot.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoGnuplot.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBeoGnuplot.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoGnuplot1DMonitor.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBeoGnuplot1DMonitor.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoGnuplot1DSnapshot.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBeoGnuplot1DSnapshot.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoHowMany.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoIntBounds.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBeoIntBounds.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoMOFitnessStat.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoMonitor.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoParam.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoParser.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBeoParser.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoPopStat.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoRealBounds.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBeoRealBounds.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoRealVectorBounds.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoRndGenerators.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoRNG.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBeoRNG.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoScalarFitnessStat.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoStat.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoState.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBeoState.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoStdoutMonitor.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBeoStdoutMonitor.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoTimeCounter.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoTimedMonitor.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoUniformInit.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoUpdatable.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoUpdater.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBeoUpdater.h\fP"
+.br
+.ti -1c
+.RI "file \fBmake_help.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBpipecom.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBpipecom.h\fP"
+.br
+.ti -1c
+.RI "file \fBrnd_generators.h\fP"
+.br
+.ti -1c
+.RI "file \fBselectors.h\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_test_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_test_.3
new file mode 100644
index 000000000..5850d27a8
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_test_.3
@@ -0,0 +1,153 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/test/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/test/ Directory Reference \- 
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBtest/binary_value.h\fP"
+.br
+.ti -1c
+.RI "file \fBfitness_traits.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBtest/real_value.h\fP"
+.br
+.ti -1c
+.RI "file \fBRoyalRoad.h\fP"
+.br
+.ti -1c
+.RI "file \fBt-eo.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoAtomOps.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoBaseFunctions.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eobin.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eobreeder.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoCheckpointing.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoCMAES.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoEasyEA.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoESAll.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoESFull.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoESOps.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoExternalEO.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eofitness.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoFitnessAssembled.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoFitnessAssembledEA.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoFunctor.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoGA.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eogeneration.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoGenOp.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoGOpSel.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoinclusion.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoinsertion.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eolottery.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoNonUniform.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoPareto.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoParetoFitness.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoPBIL.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoproblem.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoRandom.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoReal.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoReplacement.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoRoulette.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoSelect.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoSharing.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoSSGA.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoStateAndParser.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoSymreg.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoUniform.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoVector.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-eoVirus.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-MGE-control.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-MGE.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-MGE1bit.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBt-selectOne.cpp\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_.3
new file mode 100644
index 000000000..e72a5bad9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_.3
@@ -0,0 +1,34 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/ Directory Reference \- 
+.SS "Directories"
+
+.in +1c
+.ti -1c
+.RI "directory\fBLesson1\fP"
+.br
+.ti -1c
+.RI "directory\fBLesson2\fP"
+.br
+.ti -1c
+.RI "directory\fBLesson3\fP"
+.br
+.ti -1c
+.RI "directory\fBLesson4\fP"
+.br
+.ti -1c
+.RI "directory\fBLesson5\fP"
+.br
+.ti -1c
+.RI "directory\fBTemplates\fP"
+.br
+.in -1c
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBtutorial/README\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_Lesson1_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_Lesson1_.3
new file mode 100644
index 000000000..8947bf384
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_Lesson1_.3
@@ -0,0 +1,18 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson1/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson1/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson1/ Directory Reference \- 
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBexercise1.3.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBFirstBitGA.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBFirstRealGA.cpp\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_Lesson2_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_Lesson2_.3
new file mode 100644
index 000000000..4a319e37e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_Lesson2_.3
@@ -0,0 +1,24 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson2/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson2/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson2/ Directory Reference \- 
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBtutorial/Lesson2/binary_value.h\fP"
+.br
+.ti -1c
+.RI "file \fBexercise2.3.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBFirstBitEA.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBFirstRealEA.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBtutorial/Lesson2/real_value.h\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_Lesson3_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_Lesson3_.3
new file mode 100644
index 000000000..947bf56c9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_Lesson3_.3
@@ -0,0 +1,24 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson3/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson3/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson3/ Directory Reference \- 
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBtutorial/Lesson3/binary_value.h\fP"
+.br
+.ti -1c
+.RI "file \fBexercise3.1.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBtutorial/Lesson3/real_value.h\fP"
+.br
+.ti -1c
+.RI "file \fBSecondBitEA.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBSecondRealEA.cpp\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_Lesson4_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_Lesson4_.3
new file mode 100644
index 000000000..667e2ae14
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_Lesson4_.3
@@ -0,0 +1,24 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson4/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson4/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson4/ Directory Reference \- 
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBtutorial/Lesson4/binary_value.h\fP"
+.br
+.ti -1c
+.RI "file \fBBitEA.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBESEA.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBtutorial/Lesson4/real_value.h\fP"
+.br
+.ti -1c
+.RI "file \fBRealEA.cpp\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_Lesson5_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_Lesson5_.3
new file mode 100644
index 000000000..1d5d4b426
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_Lesson5_.3
@@ -0,0 +1,39 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson5/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson5/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Lesson5/ Directory Reference \- 
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBeoOneMax.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoOneMaxEvalFunc.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoOneMaxInit.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoOneMaxMutation.h\fP"
+.br
+.ti -1c
+.RI "file \fBeoOneMaxQuadCrossover.h\fP"
+.br
+.ti -1c
+.RI "file \fBmake_genotype_OneMax.h\fP"
+.br
+.ti -1c
+.RI "file \fBmake_OneMax.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBmake_op_OneMax.h\fP"
+.br
+.ti -1c
+.RI "file \fBOneMaxEA.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBOneMaxLibEA.cpp\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_Templates_.3 b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_Templates_.3
new file mode 100644
index 000000000..eb8615f80
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/_users_dsa_marc_WWW_EO_eo.19Oct2006_tutorial_Templates_.3
@@ -0,0 +1,30 @@
+/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Templates/ Directory Reference.TH "/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Templates/ Directory Reference" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+/users/dsa/marc/WWW/EO/eo.19Oct2006/tutorial/Templates/ Directory Reference \- 
+.SS "Files"
+
+.in +1c
+.ti -1c
+.RI "file \fBmake_genotype_MyStruct.h\fP"
+.br
+.ti -1c
+.RI "file \fBmake_MyStruct.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBmake_op_MyStruct.h\fP"
+.br
+.ti -1c
+.RI "file \fBMyStructEA.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBMyStructLibEA.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBMyStructSEA.cpp\fP"
+.br
+.ti -1c
+.RI "file \fBtutorial/Templates/README\fP"
+.br
+.in -1c
diff --git a/trunk/paradiseo-eo/doc/man/man3/boolean_generator.3 b/trunk/paradiseo-eo/doc/man/man3/boolean_generator.3
new file mode 100644
index 000000000..934f0194e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/boolean_generator.3
@@ -0,0 +1,41 @@
+.TH "boolean_generator" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+boolean_generator \- The class boolean_generator can be used in the STL generate function to easily generate random booleans with a specified bias.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBboolean_generator\fP (float _bias=0.5, \fBeoRng\fP &_rng=rng)"
+.br
+.ti -1c
+.RI "bool \fBoperator()\fP (void)"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "float \fBbias\fP"
+.br
+.ti -1c
+.RI "\fBeoRng\fP & \fBgen\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+The class boolean_generator can be used in the STL generate function to easily generate random booleans with a specified bias. 
+.PP
+Definition at line 70 of file rnd_generators.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/dMatrix.3 b/trunk/paradiseo-eo/doc/man/man3/dMatrix.3
new file mode 100644
index 000000000..a2f02f03e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/dMatrix.3
@@ -0,0 +1,47 @@
+.TH "dMatrix" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+dMatrix \- A helper class for Sharing - to hold distances.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBdMatrix\fP (unsigned _s)"
+.br
+.ti -1c
+.RI "double \fBoperator()\fP (unsigned _i, unsigned _j) const "
+.br
+.RI "\fIsimple accessor \fP"
+.ti -1c
+.RI "double & \fBoperator()\fP (unsigned _i, unsigned _j)"
+.br
+.RI "\fIreference - to set values \fP"
+.ti -1c
+.RI "void \fBprintOn\fP (std::ostream &_os)"
+.br
+.RI "\fIjust in case \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBrSize\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+A helper class for Sharing - to hold distances. 
+.PP
+Definition at line 37 of file eoSharing.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eo1PtBitCrossover.3 b/trunk/paradiseo-eo/doc/man/man3/eo1PtBitCrossover.3
new file mode 100644
index 000000000..e5fb7cc1f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eo1PtBitCrossover.3
@@ -0,0 +1,22 @@
+.PP
+.TH "eo1PtBitCrossover" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eo1PtBitCrossover \- eo1PtBitXover --> classic 1-point crossover  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SH "Detailed Description"
+.PP 
+eo1PtBitXover --> classic 1-point crossover 
+.PP
+
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoAged.3 b/trunk/paradiseo-eo/doc/man/man3/eoAged.3
new file mode 100644
index 000000000..59bbe0988
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoAged.3
@@ -0,0 +1,141 @@
+.TH "eoAged" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoAged \- eoAge is a template class that adds an age to an object.\\ Requisites for template instantiation are that the object must admit a default ctor and a copy ctor.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoAged\fP (const Object &_o)"
+.br
+.RI "\fIMain ctor from an already built Object. \fP"
+.ti -1c
+.RI "\fBeoAged\fP (const \fBeoAged\fP &_a)"
+.br
+.RI "\fICopy constructor. \fP"
+.ti -1c
+.RI "virtual \fB~eoAged\fP ()"
+.br
+.RI "\fIVirtual dtor. They are needed in virtual class hierarchies. \fP"
+.ti -1c
+.RI "unsigned long \fBAge\fP () const "
+.br
+.RI "\fIreturns the age of the object \fP"
+.ti -1c
+.RI "const \fBeoAged\fP & \fBoperator++\fP ()"
+.br
+.RI "\fIIncrements age. \fP"
+.in -1c
+.PP
+.RI "\fBMethods from eoObject\fP"
+.br
+readFrom and printOn are directly inherited from eo1d 
+.PP
+.in +1c
+.in +1c
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIReturn the class id. \fP"
+.ti -1c
+.RI "virtual void \fBreadFrom\fP (istream &_is)"
+.br
+.RI "\fIRead object. \fP"
+.ti -1c
+.RI "virtual void \fBprintOn\fP (ostream &_os) const "
+.br
+.RI "\fIWrite object. \fP"
+.in -1c
+.in -1c
+.SS "Private Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoAged\fP ()"
+.br
+.RI "\fIDefault Constructor. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned long \fBage\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoAged< Object >"
+eoAge is a template class that adds an age to an object.\\ Requisites for template instantiation are that the object must admit a default ctor and a copy ctor. 
+
+The Object must be an \fBeoObject\fP, thus, it must have its methods: className, printOn, readFrom. 
+.PP
+\fBSee also:\fP
+.RS 4
+\fBeoObject\fP 
+.RE
+.PP
+
+.PP
+Definition at line 47 of file eoAged.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoAged\fP< Object >::\fBeoAged\fP ()\fC [inline, private]\fP"
+.PP
+Default Constructor. 
+.PP
+\\ It´s private so that it is not used anywhere; the right way of using this object is to create an Object and passing it to an aged by means of the copy ctor; that way it´s turned into an Aged object 
+.PP
+Definition at line 103 of file eoAged.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template virtual std::string \fBeoAged\fP< Object >::className () const\fC [inline, virtual]\fP"
+.PP
+Return the class id. 
+.PP
+This should be redefined in each class; but it's got code as an example of implementation. Only 'leaf' classes can be non-virtual. 
+.PP
+Definition at line 74 of file eoAged.h.
+.SS "template virtual void \fBeoAged\fP< Object >::readFrom (istream & _is)\fC [inline, virtual]\fP"
+.PP
+Read object. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_is\fP A istream. 
+.RE
+.PP
+\fBExceptions:\fP
+.RS 4
+\fIruntime_exception\fP If a valid object can't be read. 
+.RE
+.PP
+
+.PP
+Definition at line 81 of file eoAged.h.
+.SS "template virtual void \fBeoAged\fP< Object >::printOn (ostream & _os) const\fC [inline, virtual]\fP"
+.PP
+Write object. 
+.PP
+It's called printOn since it prints the object _on_ a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_os\fP A ostream. 
+.RE
+.PP
+
+.PP
+Definition at line 91 of file eoAged.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoAlgo.3 b/trunk/paradiseo-eo/doc/man/man3/eoAlgo.3
new file mode 100644
index 000000000..696fc7f24
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoAlgo.3
@@ -0,0 +1,29 @@
+.TH "eoAlgo" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoAlgo \- This is a generic class for population-transforming algorithms.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoUF< eoPop< EOT > &, void >\fP.
+.PP
+Inherited by \fBeoCellularEasyEA< EOT >\fP, \fBeoEasyEA< EOT >\fP, and \fBeoSGA< EOT >\fP.
+.PP
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoAlgo< EOT >"
+This is a generic class for population-transforming algorithms. 
+
+There is only one operator defined, which takes a population and does stuff to it. It needn't be a complete algorithm, can be also a step of an algorithm. This class just gives a common interface to linear population-transforming algorithms. 
+.PP
+Definition at line 39 of file eoAlgo.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoArithmeticCrossover.3 b/trunk/paradiseo-eo/doc/man/man3/eoArithmeticCrossover.3
new file mode 100644
index 000000000..fe8b75db9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoArithmeticCrossover.3
@@ -0,0 +1,21 @@
+.TH "eoArithmeticCrossover" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoArithmeticCrossover \- eoHypercubeCrossover --> uniform choice in hypercube == arithmetical with different values for each coordinate  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SH "Detailed Description"
+.PP 
+eoHypercubeCrossover --> uniform choice in hypercube == arithmetical with different values for each coordinate 
+.PP
+
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoAssembledFitnessAverageStat.3 b/trunk/paradiseo-eo/doc/man/man3/eoAssembledFitnessAverageStat.3
new file mode 100644
index 000000000..7908c2321
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoAssembledFitnessAverageStat.3
@@ -0,0 +1,52 @@
+.TH "eoAssembledFitnessAverageStat" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoAssembledFitnessAverageStat \- Average fitness values of a population, where the fitness is of type eoScalarAssembledFitness.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoStat< EOT, double >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::Fitness \fBFitness\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoAssembledFitnessAverageStat\fP (unsigned _whichTerm=0, std::string _description='Average Fitness')"
+.br
+.ti -1c
+.RI "virtual void \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBwhichFitnessTerm\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoAssembledFitnessAverageStat< EOT >"
+Average fitness values of a population, where the fitness is of type eoScalarAssembledFitness. 
+
+Specify in the constructor, for which fitness term (index) the average should be evaluated. Only values of object where the failed boolean = false is set are counted. 
+.PP
+Definition at line 46 of file eoAssembledFitnessStat.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoAssembledFitnessBestStat.3 b/trunk/paradiseo-eo/doc/man/man3/eoAssembledFitnessBestStat.3
new file mode 100644
index 000000000..24bd1c9cd
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoAssembledFitnessBestStat.3
@@ -0,0 +1,52 @@
+.TH "eoAssembledFitnessBestStat" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoAssembledFitnessBestStat \- Fitness values of best individuum in a population, where the fitness is of type eoScalarAssembledFitness.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoStat< EOT, double >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::Fitness \fBFitness\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoAssembledFitnessBestStat\fP (unsigned _whichTerm=0, std::string _description='Best Fitness')"
+.br
+.ti -1c
+.RI "virtual void \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBwhichFitnessTerm\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoAssembledFitnessBestStat< EOT >"
+Fitness values of best individuum in a population, where the fitness is of type eoScalarAssembledFitness. 
+
+Specify in the constructor, for which fitness term (index) the value should be evaluated. 
+.PP
+Definition at line 87 of file eoAssembledFitnessStat.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoAtomExchange.3 b/trunk/paradiseo-eo/doc/man/man3/eoAtomExchange.3
new file mode 100644
index 000000000..6000da00c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoAtomExchange.3
@@ -0,0 +1,39 @@
+.TH "eoAtomExchange" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoAtomExchange \- A helper class for choosing which genes to exchange.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoBF< unsigned, Atom &, bool >\fP.
+.PP
+Inherited by \fBeoUniformAtomExchange< Atom >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual void \fBrandomize\fP (unsigned int, unsigned int)"
+.br
+.RI "\fIa function to initlialize - to be called before every crossover \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const =0"
+.br
+.RI "\fIthe inherited \fBclassName()\fP \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoAtomExchange< Atom >"
+A helper class for choosing which genes to exchange. 
+.PP
+Definition at line 41 of file eoVariableLengthCrossover.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoAverageStat.3 b/trunk/paradiseo-eo/doc/man/man3/eoAverageStat.3
new file mode 100644
index 000000000..66619462e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoAverageStat.3
@@ -0,0 +1,77 @@
+.TH "eoAverageStat" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoAverageStat \- Average fitness of a population.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoStat< EOT, EOT::Fitness >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::Fitness \fBFitness\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoAverageStat\fP (std::string _description='Average Fitness')"
+.br
+.ti -1c
+.RI "\fBeoAverageStat\fP (double _value, std::string _desc)"
+.br
+.ti -1c
+.RI "virtual void \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.in -1c
+.SS "Static Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "Fitness \fBsumFitness\fP (double _sum, const \fBEOT\fP &_eot)"
+.br
+.in -1c
+.SS "Private Member Functions"
+
+.in +1c
+.ti -1c
+.RI "template void \fBdoit\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop, \fBeoParetoFitness\fP< T >)"
+.br
+.ti -1c
+.RI "template void \fBdoit\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop, T)"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoAverageStat< EOT >"
+Average fitness of a population. 
+
+Fitness can be:
+.IP "\(bu" 2
+double
+.IP "\(bu" 2
+eoMinimizingFitness or eoMaximizingFitness
+.IP "\(bu" 2
+\fBeoParetoFitness\fP: The average of each objective is evaluated.
+.PP
+.PP
+( For \fBeoScalarFitnessAssembled\fP user eoAssembledFitnessStat classes.) 
+.PP
+Definition at line 108 of file eoStat.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoBF.3 b/trunk/paradiseo-eo/doc/man/man3/eoBF.3
new file mode 100644
index 000000000..efaea6439
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoBF.3
@@ -0,0 +1,47 @@
+.TH "eoBF" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoBF \- Basic Binary Functor.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoFunctorBase\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual \fB~eoBF\fP ()"
+.br
+.RI "\fIvirtual dtor here so there is no need to define it in derived classes \fP"
+.ti -1c
+.RI "virtual R \fBoperator()\fP (A1, A2)=0"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Static Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoFunctorBase::binary_function_tag\fP \fBfunctor_category\fP ()"
+.br
+.RI "\fItag to identify a procedure in compile time function selection functor_category \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoBF< A1, A2, R >"
+Basic Binary Functor. 
+
+Derive from this class when defining any binary function. First template argument is result_type, second is first_argument_type, third is second_argument_type. Argument and result types can be any type including void for result_type 
+.PP
+Definition at line 145 of file eoFunctor.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoBestFitnessStat.3 b/trunk/paradiseo-eo/doc/man/man3/eoBestFitnessStat.3
new file mode 100644
index 000000000..cb3566c8b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoBestFitnessStat.3
@@ -0,0 +1,67 @@
+.TH "eoBestFitnessStat" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoBestFitnessStat \- Best fitness of a population.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoStat< EOT, EOT::Fitness >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::Fitness \fBFitness\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoBestFitnessStat\fP (std::string _description='Best ')"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.in -1c
+.SS "Private Member Functions"
+
+.in +1c
+.ti -1c
+.RI "template void \fBdoit\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop, \fBeoParetoFitness\fP< T >)"
+.br
+.ti -1c
+.RI "template void \fBdoit\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop, T)"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoBestFitnessStat< EOT >"
+Best fitness of a population. 
+
+Fitness can be:
+.IP "\(bu" 2
+double
+.IP "\(bu" 2
+eoMinimizingFitness or eoMaximizingFitness
+.IP "\(bu" 2
+\fBeoParetoFitness\fP:
+.PP
+.PP
+( For \fBeoScalarFitnessAssembled\fP look at eoAssembledFitnessStat ) 
+.PP
+Definition at line 316 of file eoStat.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoBestSelect.3 b/trunk/paradiseo-eo/doc/man/man3/eoBestSelect.3
new file mode 100644
index 000000000..7c01b2ad3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoBestSelect.3
@@ -0,0 +1,33 @@
+.TH "eoBestSelect" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoBestSelect \- eoBestSelect: a selection method that always return the best (mainly for testing purposes)  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoSelectOne< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual const \fBEOT\fP & \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fInot a big deal!!! \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoBestSelect< EOT >"
+eoBestSelect: a selection method that always return the best (mainly for testing purposes) 
+.PP
+Definition at line 60 of file eoRandomSelect.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoBinCloneOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoBinCloneOp.3
new file mode 100644
index 000000000..659988db0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoBinCloneOp.3
@@ -0,0 +1,40 @@
+.TH "eoBinCloneOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoBinCloneOp \- Binary clone: two operands, only the first could be modified.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoBinOp< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoBinCloneOp\fP ()"
+.br
+.RI "\fICtor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.ti -1c
+.RI "virtual bool \fBoperator()\fP (\fBEOT\fP &, const \fBEOT\fP &)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoBinCloneOp< EOT >"
+Binary clone: two operands, only the first could be modified. 
+.PP
+Definition at line 57 of file eoCloneOps.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoBinGenOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoBinGenOp.3
new file mode 100644
index 000000000..774d41b07
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoBinGenOp.3
@@ -0,0 +1,50 @@
+.TH "eoBinGenOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoBinGenOp \- Wrapper for binop: here we use select method of \fBeoPopulator\fP but we could also have an embedded selector to select the second parent.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoGenOp< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoBinGenOp\fP (\fBeoBinOp\fP< \fBEOT\fP > &_op)"
+.br
+.ti -1c
+.RI "unsigned \fBmax_production\fP (void)"
+.br
+.RI "\fIMax production is used to reserve space for all elements that are used by the operator, not setting it properly can result in a crash. \fP"
+.ti -1c
+.RI "void \fBapply\fP (\fBeoPopulator\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIdo the work: get 2 individuals from the population, modifies only one (it's a \fBeoBinOp\fP) \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoBinOp\fP< \fBEOT\fP > & \fBop\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoBinGenOp< EOT >"
+Wrapper for binop: here we use select method of \fBeoPopulator\fP but we could also have an embedded selector to select the second parent. 
+.PP
+Definition at line 107 of file eoGenOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoBinOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoBinOp.3
new file mode 100644
index 000000000..daa0e0693
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoBinOp.3
@@ -0,0 +1,36 @@
+.TH "eoBinOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoBinOp \- Binary genetic operator: subclasses \fBeoOp\fP, and defines basically the operator() with two operands, only the first one can be modified When defining your own, make sure that you return a boolean value indicating that you have changed the content.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoOp< EOType >< EOType >\fP, and \fBeoBF< EOType &, const EOType &, bool >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoBinOp\fP ()"
+.br
+.RI "\fICtor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoBinOp< EOType >"
+Binary genetic operator: subclasses \fBeoOp\fP, and defines basically the operator() with two operands, only the first one can be modified When defining your own, make sure that you return a boolean value indicating that you have changed the content. 
+.PP
+Definition at line 117 of file eoOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoBinaryFunctorCounter.3 b/trunk/paradiseo-eo/doc/man/man3/eoBinaryFunctorCounter.3
new file mode 100644
index 000000000..59fb3792d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoBinaryFunctorCounter.3
@@ -0,0 +1,64 @@
+.TH "eoBinaryFunctorCounter" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoBinaryFunctorCounter \- Generic counter class that counts the number of times a binary function is used.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoValueParam< unsigned long >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoBinaryFunctorCounter\fP (BinaryFunctor &_func, std::string _name='proc_counter')"
+.br
+.ti -1c
+.RI "BinaryFunctor::result_type \fBoperator()\fP (typename BinaryFunctor::first_argument_type _arg1, typename BinaryFunctor::second_argument_type _arg2)"
+.br
+.RI "\fICalls the embedded function and increments the counter. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "BinaryFunctor & \fBfunc\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoBinaryFunctorCounter< BinaryFunctor >"
+Generic counter class that counts the number of times a binary function is used. 
+
+Add a binary function through its ctor and use this class instead of it.
+.PP
+It is derived from \fBeoValueParam\fP so you can add it to a monitor. 
+.PP
+Definition at line 142 of file eoCounter.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template BinaryFunctor::result_type \fBeoBinaryFunctorCounter\fP< BinaryFunctor >::operator() (typename BinaryFunctor::first_argument_type _arg1, typename BinaryFunctor::second_argument_type _arg2)\fC [inline]\fP"
+.PP
+Calls the embedded function and increments the counter. 
+.PP
+Note for MSVC users, if this code does not compile, you are quite likely trying to count a function that has a non-void return type. Don't look at us, look at the MSVC builders. Code like 'return void;' is perfectly legal according to the ANSI standard, but the guys at Microsoft didn't get to implementing it yet.
+.PP
+We had two choices: assuming (and compiling ) code that returns void or code that returns non-void. Given that in \fBEO\fP most functors return void, it was chosen to support void.
+.PP
+But also please let me know if you have a compiler that defines _MSC_VER (lot's of windows compilers do), but is quite capable of compiling return void; type of code. We'll try to change the signature then.
+.PP
+You happy GNU (and other compiler) users will not have a problem with this. 
+.PP
+Definition at line 166 of file eoCounter.h.
+.PP
+References eoValueParam< unsigned long >::value().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoBit.3 b/trunk/paradiseo-eo/doc/man/man3/eoBit.3
new file mode 100644
index 000000000..cdcc31fb0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoBit.3
@@ -0,0 +1,97 @@
+.TH "eoBit" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoBit \- Implementation of bitstring chromosome.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoVector< FitT, bool >\fP.
+.PP
+Inherited by eoVirus< FitT >.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoBit\fP (unsigned size=0, bool value=false)"
+.br
+.RI "\fI(Default) Constructor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIMy class name. \fP"
+.ti -1c
+.RI "virtual void \fBprintOn\fP (std::ostream &os) const "
+.br
+.RI "\fITo print me on a stream. \fP"
+.ti -1c
+.RI "virtual void \fBreadFrom\fP (std::istream &is)"
+.br
+.RI "\fITo read me from a stream. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoBit< FitT >"
+Implementation of bitstring chromosome. 
+
+Based on STL's vector specialization. 
+.PP
+Definition at line 56 of file eoBit.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoBit\fP< \fBFitT\fP >::\fBeoBit\fP (unsigned size = \fC0\fP, bool value = \fCfalse\fP)\fC [inline]\fP"
+.PP
+(Default) Constructor. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIsize\fP Size of the binary std::string. 
+.RE
+.PP
+
+.PP
+Definition at line 69 of file eoBit.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template virtual void \fBeoBit\fP< \fBFitT\fP >::printOn (std::ostream & os) const\fC [inline, virtual]\fP"
+.PP
+To print me on a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIos\fP The std::ostream. 
+.RE
+.PP
+
+.PP
+Reimplemented from \fBeoVector< FitT, bool >\fP.
+.PP
+Definition at line 82 of file eoBit.h.
+.PP
+References EO< F >::printOn().
+.SS "template virtual void \fBeoBit\fP< \fBFitT\fP >::readFrom (std::istream & is)\fC [inline, virtual]\fP"
+.PP
+To read me from a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIis\fP The std::istream. 
+.RE
+.PP
+
+.PP
+Reimplemented from \fBeoVector< FitT, bool >\fP.
+.PP
+Definition at line 94 of file eoBit.h.
+.PP
+References EO< F >::readFrom().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoBitBitFlip.3 b/trunk/paradiseo-eo/doc/man/man3/eoBitBitFlip.3
new file mode 100644
index 000000000..db84a0eaf
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoBitBitFlip.3
@@ -0,0 +1,21 @@
+.TH "eoBitBitFlip" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoBitBitFlip \- eoBitFlip --> changes 1 bit  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SH "Detailed Description"
+.PP 
+eoBitFlip --> changes 1 bit 
+.PP
+
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoBitGxOver.3 b/trunk/paradiseo-eo/doc/man/man3/eoBitGxOver.3
new file mode 100644
index 000000000..b2d468651
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoBitGxOver.3
@@ -0,0 +1,69 @@
+.TH "eoBitGxOver" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoBitGxOver \- eoBitGxOver --> Npts crossover when bistd::string considered as a std::string of binary-encoded genes (exchanges genes) Is anybody still using it apart from historians ??? :-)  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoQuadOp< Chrom >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoBitGxOver\fP (const unsigned _gene_size, const unsigned _num_points=2)"
+.br
+.RI "\fIConstructor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIThe class name. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (Chrom &chrom1, Chrom &chrom2)"
+.br
+.RI "\fIGene crossover for binary chromosomes. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBgene_size\fP"
+.br
+.ti -1c
+.RI "unsigned \fBnum_points\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoBitGxOver< Chrom >"
+eoBitGxOver --> Npts crossover when bistd::string considered as a std::string of binary-encoded genes (exchanges genes) Is anybody still using it apart from historians ??? :-) 
+.PP
+Definition at line 388 of file eoBitOp.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template bool \fBeoBitGxOver\fP< Chrom >::operator() (Chrom & chrom1, Chrom & chrom2)\fC [inline, virtual]\fP"
+.PP
+Gene crossover for binary chromosomes. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIchrom1\fP The first chromosome. 
+.br
+\fIchrom2\fP The first chromosome. 
+.RE
+.PP
+
+.PP
+Implements \fBeoBF< Chrom &, Chrom &, bool >\fP.
+.PP
+Definition at line 409 of file eoBitOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoBitInversion.3 b/trunk/paradiseo-eo/doc/man/man3/eoBitInversion.3
new file mode 100644
index 000000000..3cb7a69a6
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoBitInversion.3
@@ -0,0 +1,53 @@
+.TH "eoBitInversion" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoBitInversion \- eoBitInversion: inverts the bits of the chromosome between an interval  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< Chrom >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIThe class name. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (Chrom &chrom)"
+.br
+.RI "\fIInverts a range of bits in a binary chromosome. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoBitInversion< Chrom >"
+eoBitInversion: inverts the bits of the chromosome between an interval 
+.PP
+Definition at line 146 of file eoBitOp.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template bool \fBeoBitInversion\fP< Chrom >::operator() (Chrom & chrom)\fC [inline, virtual]\fP"
+.PP
+Inverts a range of bits in a binary chromosome. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIchrom\fP The chromosome whos bits are going to be inverted (a range). 
+.RE
+.PP
+
+.PP
+Implements \fBeoUF< Chrom &, bool >\fP.
+.PP
+Definition at line 156 of file eoBitOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoBitMutation.3 b/trunk/paradiseo-eo/doc/man/man3/eoBitMutation.3
new file mode 100644
index 000000000..9057157c5
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoBitMutation.3
@@ -0,0 +1,81 @@
+.TH "eoBitMutation" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoBitMutation \- eoBitMutation --> classical mutation  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< Chrom >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoBitMutation\fP (const double &_rate=0.01, bool _normalize=false)"
+.br
+.RI "\fI(Default) Constructor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIThe class name. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (Chrom &chrom)"
+.br
+.RI "\fIMutate a chromosome. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBrate\fP"
+.br
+.ti -1c
+.RI "bool \fBnormalize\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoBitMutation< Chrom >"
+eoBitMutation --> classical mutation 
+.PP
+Definition at line 104 of file eoBitOp.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoBitMutation\fP< Chrom >::\fBeoBitMutation\fP (const double & _rate = \fC0.01\fP, bool _normalize = \fCfalse\fP)\fC [inline]\fP"
+.PP
+(Default) Constructor. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_rate\fP Rate of mutation. 
+.RE
+.PP
+
+.PP
+Definition at line 111 of file eoBitOp.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template bool \fBeoBitMutation\fP< Chrom >::operator() (Chrom & chrom)\fC [inline, virtual]\fP"
+.PP
+Mutate a chromosome. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIchrom\fP The chromosome to be mutated. 
+.RE
+.PP
+
+.PP
+Implements \fBeoUF< Chrom &, bool >\fP.
+.PP
+Definition at line 121 of file eoBitOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoBitNext.3 b/trunk/paradiseo-eo/doc/man/man3/eoBitNext.3
new file mode 100644
index 000000000..b788e715d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoBitNext.3
@@ -0,0 +1,53 @@
+.TH "eoBitNext" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoBitNext \- eoBitNext --> next value when bitstring considered as binary value  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< Chrom >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIThe class name. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (Chrom &chrom)"
+.br
+.RI "\fIChange the bit std::string x to be x+1. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoBitNext< Chrom >"
+eoBitNext --> next value when bitstring considered as binary value 
+.PP
+Definition at line 174 of file eoBitOp.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template bool \fBeoBitNext\fP< Chrom >::operator() (Chrom & chrom)\fC [inline, virtual]\fP"
+.PP
+Change the bit std::string x to be x+1. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIchrom\fP The chromosome to be added one. 
+.RE
+.PP
+
+.PP
+Implements \fBeoUF< Chrom &, bool >\fP.
+.PP
+Definition at line 184 of file eoBitOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoBitOpFactory.3 b/trunk/paradiseo-eo/doc/man/man3/eoBitOpFactory.3
new file mode 100644
index 000000000..1b454a8dc
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoBitOpFactory.3
@@ -0,0 +1,83 @@
+.TH "eoBitOpFactory" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoBitOpFactory \- \fBEO\fP Factory.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoFactory< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual \fBeoOp\fP< \fBEOT\fP > * \fBmake\fP (std::istream &_is)"
+.br
+.RI "\fIAnother factory method: creates an object from an std::istream, reading from it whatever is needed to create the object. \fP"
+.in -1c
+.PP
+.RI "\fBctors and dtors\fP"
+.br
+
+.in +1c
+.in +1c
+.ti -1c
+.RI "\fBeoBitOpFactory\fP ()"
+.br
+.RI "\fIconstructor \fP"
+.ti -1c
+.RI "virtual \fB~eoBitOpFactory\fP ()"
+.br
+.RI "\fIdestructor \fP"
+.in -1c
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoBitOpFactory< EOT >"
+\fBEO\fP Factory. 
+
+An instance of the factory class to create operators that act on bitstring chromosomes. Only those chromosomes can instantiate the operators that are created here 
+.PP
+\fBSee also:\fP
+.RS 4
+\fBeoSelect\fP 
+.RE
+.PP
+
+.PP
+Definition at line 39 of file eoBitOpFactory.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template virtual \fBeoOp\fP<\fBEOT\fP>* \fBeoBitOpFactory\fP< \fBEOT\fP >::make (std::istream & _is)\fC [inline, virtual]\fP"
+.PP
+Another factory method: creates an object from an std::istream, reading from it whatever is needed to create the object. 
+.PP
+Usually, the format for the std::istream will be\\ objectType parameter1 parameter2 ... parametern\\ If there are problems, an std::exception is raised; it should be caught at the upper level, because it might be something for that level\\ At the same time, it catches std::exceptions thrown at a lower level, which will indicate that whatever is in the stream is for this method to process 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_is\fP an stream from where a single line will be read 
+.RE
+.PP
+\fBExceptions:\fP
+.RS 4
+\fIruntime_std::exception\fP if the object type is not known
+.RE
+.PP
+
+.PP
+Implements \fBeoFactory< EOT >\fP.
+.PP
+Definition at line 63 of file eoBitOpFactory.h.
+.PP
+References eoFactory< EOClass >::make().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoBitPrev.3 b/trunk/paradiseo-eo/doc/man/man3/eoBitPrev.3
new file mode 100644
index 000000000..dd8515452
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoBitPrev.3
@@ -0,0 +1,53 @@
+.TH "eoBitPrev" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoBitPrev \- eoBitPrev --> previous value when bitstring treated as binary value  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< Chrom >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIThe class name. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (Chrom &chrom)"
+.br
+.RI "\fIChange the bit std::string x to be x-1. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoBitPrev< Chrom >"
+eoBitPrev --> previous value when bitstring treated as binary value 
+.PP
+Definition at line 208 of file eoBitOp.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template bool \fBeoBitPrev\fP< Chrom >::operator() (Chrom & chrom)\fC [inline, virtual]\fP"
+.PP
+Change the bit std::string x to be x-1. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIchrom\fP The chromosome to be substracted one. 
+.RE
+.PP
+
+.PP
+Implements \fBeoUF< Chrom &, bool >\fP.
+.PP
+Definition at line 218 of file eoBitOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoBoolFlip.3 b/trunk/paradiseo-eo/doc/man/man3/eoBoolFlip.3
new file mode 100644
index 000000000..2597e6840
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoBoolFlip.3
@@ -0,0 +1,35 @@
+.TH "eoBoolFlip" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoBoolFlip \- a simple boolean mutation - to be used in generic eoOp's  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< bool >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "bool \fBoperator()\fP (bool &_b)"
+.br
+.RI "\fIsimply flips the boolean argument \fP"
+.ti -1c
+.RI "virtual string \fBclassName\fP () const "
+.br
+.RI "\fIinherited \fBclassName()\fP \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+a simple boolean mutation - to be used in generic eoOp's 
+.PP
+Definition at line 32 of file eoBoolFlip.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoBooleanGenerator.3 b/trunk/paradiseo-eo/doc/man/man3/eoBooleanGenerator.3
new file mode 100644
index 000000000..fb775538a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoBooleanGenerator.3
@@ -0,0 +1,44 @@
+.TH "eoBooleanGenerator" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoBooleanGenerator \- The class eoBooleanGenerator can be used in the STL generate function to easily generate random booleans with a specified bias.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoRndGenerator< bool >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoBooleanGenerator\fP (float _bias=0.5, \fBeoRng\fP &_rng=rng)"
+.br
+.ti -1c
+.RI "bool \fBoperator()\fP (void)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "float \fBbias\fP"
+.br
+.ti -1c
+.RI "\fBeoRng\fP & \fBgen\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+The class eoBooleanGenerator can be used in the STL generate function to easily generate random booleans with a specified bias. 
+.PP
+Definition at line 104 of file eoRndGenerators.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoBooleanInit.3 b/trunk/paradiseo-eo/doc/man/man3/eoBooleanInit.3
new file mode 100644
index 000000000..df43a687f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoBooleanInit.3
@@ -0,0 +1,44 @@
+.TH "eoBooleanInit" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoBooleanInit \- The class eoBooleanInit can be used in the STL apply function to easily generate random booleans with a specified bias.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoInit< bool >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoBooleanInit\fP (float _bias=0.5, \fBeoRng\fP &_rng=rng)"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (bool &_b)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "float \fBbias\fP"
+.br
+.ti -1c
+.RI "\fBeoRng\fP & \fBgen\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+The class eoBooleanInit can be used in the STL apply function to easily generate random booleans with a specified bias. 
+.PP
+Definition at line 110 of file eoUniformInit.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoBranchMutation.3 b/trunk/paradiseo-eo/doc/man/man3/eoBranchMutation.3
new file mode 100644
index 000000000..268997697
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoBranchMutation.3
@@ -0,0 +1,94 @@
+.TH "eoBranchMutation" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoBranchMutation \- eoBranchMutation --> replace a subtree with a randomly created subtree  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< eoParseTree< FType, Node > >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef \fBeoParseTree\fP< FType, Node > \fBEoType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoBranchMutation\fP (\fBeoInit\fP< \fBEoType\fP > &_init, unsigned _max_length)"
+.br
+.RI "\fIConstructor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIthe class name \fP"
+.ti -1c
+.RI "virtual \fB~eoBranchMutation\fP ()"
+.br
+.RI "\fIDtor. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEoType\fP &_eo1)"
+.br
+.RI "\fIMutate an individual. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBmax_length\fP"
+.br
+.ti -1c
+.RI "\fBeoInit\fP< \fBEoType\fP > & \fBinitializer\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoBranchMutation< FType, Node >"
+eoBranchMutation --> replace a subtree with a randomly created subtree 
+.PP
+Definition at line 87 of file eoParseTreeOp.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoBranchMutation\fP< FType, Node >::\fBeoBranchMutation\fP (\fBeoInit\fP< \fBEoType\fP > & _init, unsigned _max_length)\fC [inline]\fP"
+.PP
+Constructor. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_init\fP An instantiation of eoGpDepthInitializer 
+.br
+\fI_max_length\fP the maximum size of an individual 
+.RE
+.PP
+
+.PP
+Definition at line 97 of file eoParseTreeOp.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template bool \fBeoBranchMutation\fP< FType, Node >::operator() (\fBEoType\fP & _eo1)\fC [inline]\fP"
+.PP
+Mutate an individual. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_eo1\fP The individual that is to be changed 
+.RE
+.PP
+
+.PP
+Definition at line 111 of file eoParseTreeOp.h.
+.PP
+References eoParseTree< FType, Node >::pruneTree(), and eoRng::random().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoBreed.3 b/trunk/paradiseo-eo/doc/man/man3/eoBreed.3
new file mode 100644
index 000000000..663963ca2
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoBreed.3
@@ -0,0 +1,36 @@
+.TH "eoBreed" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoBreed \- Breeding: combination of selecting and transforming a population.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoBF< const eoPop< EOT > &, eoPop< EOT > &, void >\fP.
+.PP
+Inherited by eoBreedOne< EOT >, \fBeoGeneralBreeder< EOT >\fP, eoOneToOneBreeder< EOT >, and \fBeoSelectTransform< EOT >\fP.
+.PP
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoBreed< EOT >"
+Breeding: combination of selecting and transforming a population. 
+
+Breeding is thought of a combination of selecting and transforming a population. For efficiency reasons you might want to build your own eoBreed derived class rather than relying on a seperate select and transform function.
+.PP
+\fBSee also:\fP
+.RS 4
+\fBeoSelect\fP, \fBeoTransform\fP, \fBeoSelectTransform\fP 
+.RE
+.PP
+
+.PP
+Definition at line 46 of file eoBreed.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoCMABreed.3 b/trunk/paradiseo-eo/doc/man/man3/eoCMABreed.3
new file mode 100644
index 000000000..5597fb8a5
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoCMABreed.3
@@ -0,0 +1,52 @@
+.TH "eoCMABreed" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoCMABreed \- TODO, handle bounds.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoBreed< eoVector< FitT, double > >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoCMABreed\fP (eo::CMAState &state_, unsigned lambda_)"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &parents, \fBeoPop\fP< \fBEOT\fP > &offspring)"
+.br
+.in -1c
+.SS "Private Types"
+
+.in +1c
+.ti -1c
+.RI "typedef \fBeoVector\fP< \fBFitT\fP, double > \fBEOT\fP"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "eo::CMAState & \fBstate\fP"
+.br
+.ti -1c
+.RI "unsigned \fBlambda\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoCMABreed< FitT >"
+TODO, handle bounds. 
+.PP
+Definition at line 36 of file eoCMABreed.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoCMAInit.3 b/trunk/paradiseo-eo/doc/man/man3/eoCMAInit.3
new file mode 100644
index 000000000..0a1c6b38d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoCMAInit.3
@@ -0,0 +1,49 @@
+.TH "eoCMAInit" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoCMAInit \- TODO, handle bounds.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoInit< eoVector< FitT, double > >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoCMAInit\fP (const eo::CMAState &state_)"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (\fBEOT\fP &v)"
+.br
+.in -1c
+.SS "Private Types"
+
+.in +1c
+.ti -1c
+.RI "typedef \fBeoVector\fP< \fBFitT\fP, double > \fBEOT\fP"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "const eo::CMAState & \fBstate\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoCMAInit< FitT >"
+TODO, handle bounds. 
+.PP
+Definition at line 37 of file eoCMAInit.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoCellularEasyEA.3 b/trunk/paradiseo-eo/doc/man/man3/eoCellularEasyEA.3
new file mode 100644
index 000000000..bbf04228b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoCellularEasyEA.3
@@ -0,0 +1,75 @@
+.TH "eoCellularEasyEA" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoCellularEasyEA \- The abstract cellular easy algorithm.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoAlgo< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoCellularEasyEA\fP (\fBeoContinue\fP< \fBEOT\fP > &_cont, \fBeoEvalFunc\fP< \fBEOT\fP > &_eval, \fBeoSelectOne\fP< \fBEOT\fP > &_sel_neigh, \fBeoBinOp\fP< \fBEOT\fP > &_cross, \fBeoMonOp\fP< \fBEOT\fP > &_mut, \fBeoSelectOne\fP< \fBEOT\fP > &_sel_repl)"
+.br
+.RI "\fITwo constructors. \fP"
+.ti -1c
+.RI "\fBeoCellularEasyEA\fP (\fBeoContinue\fP< \fBEOT\fP > &_cont, \fBeoEvalFunc\fP< \fBEOT\fP > &_eval, \fBeoSelectOne\fP< \fBEOT\fP > &_sel_neigh, \fBeoQuadOp\fP< \fBEOT\fP > &_cross, \fBeoMonOp\fP< \fBEOT\fP > &_mut, \fBeoSelectOne\fP< \fBEOT\fP > &_sel_child, \fBeoSelectOne\fP< \fBEOT\fP > &_sel_repl)"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &pop)"
+.br
+.RI "\fIFor a given population. \fP"
+.in -1c
+.SS "Protected Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual \fBeoPop\fP< \fBEOT\fP > \fBneighbours\fP (const \fBeoPop\fP< \fBEOT\fP > &pop, int rank)=0"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoContinue\fP< \fBEOT\fP > & \fBcont\fP"
+.br
+.ti -1c
+.RI "\fBeoEvalFunc\fP< \fBEOT\fP > & \fBeval\fP"
+.br
+.ti -1c
+.RI "\fBeoPopLoopEval\fP< \fBEOT\fP > \fBpopEval\fP"
+.br
+.ti -1c
+.RI "\fBeoSelectOne\fP< \fBEOT\fP > & \fBsel_neigh\fP"
+.br
+.ti -1c
+.RI "\fBeoBF\fP< \fBEOT\fP &, \fBEOT\fP &, bool > & \fBcross\fP"
+.br
+.ti -1c
+.RI "\fBeoMonOp\fP< \fBEOT\fP > & \fBmut\fP"
+.br
+.ti -1c
+.RI "\fBeoSelectOne\fP< \fBEOT\fP > & \fBsel_child\fP"
+.br
+.ti -1c
+.RI "\fBeoSelectOne\fP< \fBEOT\fP > & \fBsel_repl\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoCellularEasyEA< EOT >"
+The abstract cellular easy algorithm. 
+.PP
+Definition at line 38 of file eoCellularEasyEA.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoCheckPoint.3 b/trunk/paradiseo-eo/doc/man/man3/eoCheckPoint.3
new file mode 100644
index 000000000..eac1518d6
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoCheckPoint.3
@@ -0,0 +1,79 @@
+.TH "eoCheckPoint" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoCheckPoint \- eoCheckPoint is a container class.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoContinue< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoCheckPoint\fP (\fBeoContinue\fP< \fBEOT\fP > &_cont)"
+.br
+.ti -1c
+.RI "bool \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.ti -1c
+.RI "void \fBadd\fP (\fBeoContinue\fP< \fBEOT\fP > &_cont)"
+.br
+.ti -1c
+.RI "void \fBadd\fP (\fBeoSortedStatBase\fP< \fBEOT\fP > &_stat)"
+.br
+.ti -1c
+.RI "void \fBadd\fP (\fBeoStatBase\fP< \fBEOT\fP > &_stat)"
+.br
+.ti -1c
+.RI "void \fBadd\fP (\fBeoMonitor\fP &_mon)"
+.br
+.ti -1c
+.RI "void \fBadd\fP (\fBeoUpdater\fP &_upd)"
+.br
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.ti -1c
+.RI "std::string \fBallClassNames\fP () const "
+.br
+.RI "\fIreturns a string with all className() of data separated with '\\n' (for debugging) \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "std::vector< \fBeoContinue\fP< \fBEOT\fP > * > \fBcontinuators\fP"
+.br
+.ti -1c
+.RI "std::vector< \fBeoSortedStatBase\fP< \fBEOT\fP > * > \fBsorted\fP"
+.br
+.ti -1c
+.RI "std::vector< \fBeoStatBase\fP< \fBEOT\fP > * > \fBstats\fP"
+.br
+.ti -1c
+.RI "std::vector< \fBeoMonitor\fP * > \fBmonitors\fP"
+.br
+.ti -1c
+.RI "std::vector< \fBeoUpdater\fP * > \fBupdaters\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoCheckPoint< EOT >"
+eoCheckPoint is a container class. 
+
+It contains std::vectors of (pointers to) \fBeoContinue\fP (modif. MS July 16. 2002) eoStats, \fBeoUpdater\fP and \fBeoMonitor\fP it is an \fBeoContinue\fP, so its operator() will be called every generation - and will return the contained-combined-eoContinue result but before that it will call in turn every single {statistics, updaters, monitors} that it has been given, and after that, if stopping, all lastCall methods of the above. 
+.PP
+Definition at line 46 of file eoCheckPoint.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoCollapseSubtreeMutation.3 b/trunk/paradiseo-eo/doc/man/man3/eoCollapseSubtreeMutation.3
new file mode 100644
index 000000000..a62717de2
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoCollapseSubtreeMutation.3
@@ -0,0 +1,94 @@
+.TH "eoCollapseSubtreeMutation" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoCollapseSubtreeMutation \- eoCollapseSubtree --> replace a subtree with a randomly chosen terminal  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< eoParseTree< FType, Node > >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef \fBeoParseTree\fP< FType, Node > \fBEoType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoCollapseSubtreeMutation\fP (\fBeoInit\fP< \fBEoType\fP > &_init, unsigned _max_length)"
+.br
+.RI "\fIConstructor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIThe class name. \fP"
+.ti -1c
+.RI "virtual \fB~eoCollapseSubtreeMutation\fP ()"
+.br
+.RI "\fIDtor. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEoType\fP &_eo1)"
+.br
+.RI "\fIMutate an individual. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBmax_length\fP"
+.br
+.ti -1c
+.RI "\fBeoInit\fP< \fBEoType\fP > & \fBinitializer\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoCollapseSubtreeMutation< FType, Node >"
+eoCollapseSubtree --> replace a subtree with a randomly chosen terminal 
+.PP
+Definition at line 272 of file eoParseTreeOp.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoCollapseSubtreeMutation\fP< FType, Node >::\fBeoCollapseSubtreeMutation\fP (\fBeoInit\fP< \fBEoType\fP > & _init, unsigned _max_length)\fC [inline]\fP"
+.PP
+Constructor. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_init\fP An instantiation of eoGpDepthInitializer 
+.br
+\fI_max_length\fP the maximum size of an individual 
+.RE
+.PP
+
+.PP
+Definition at line 282 of file eoParseTreeOp.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template bool \fBeoCollapseSubtreeMutation\fP< FType, Node >::operator() (\fBEoType\fP & _eo1)\fC [inline]\fP"
+.PP
+Mutate an individual. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_eo1\fP The individual that is to be changed 
+.RE
+.PP
+
+.PP
+Definition at line 295 of file eoParseTreeOp.h.
+.PP
+References eoParseTree< FType, Node >::pruneTree(), and eoRng::random().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoCombinedContinue.3 b/trunk/paradiseo-eo/doc/man/man3/eoCombinedContinue.3
new file mode 100644
index 000000000..cc5ff5dfb
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoCombinedContinue.3
@@ -0,0 +1,69 @@
+.TH "eoCombinedContinue" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoCombinedContinue \- Combined continuators - logical AND: Continues until one of the embedded continuators says halt!  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoContinue< EOT >< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::Fitness \fBFitnessType\fP"
+.br
+.RI "\fIDefine Fitness. \fP"
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoCombinedContinue\fP (\fBeoContinue\fP< \fBEOT\fP > &_cont)"
+.br
+.RI "\fICtor, make sure that at least on continuator is present. \fP"
+.ti -1c
+.RI "\fBeoCombinedContinue\fP (\fBeoContinue\fP< \fBEOT\fP > &_cont1, \fBeoContinue\fP< \fBEOT\fP > &_cont2)"
+.br
+.RI "\fICtor - for historical reasons ... should disspear some day. \fP"
+.ti -1c
+.RI "void \fBadd\fP (\fBeoContinue\fP< \fBEOT\fP > &_cont)"
+.br
+.ti -1c
+.RI "void \fBremoveLast\fP (void)"
+.br
+.ti -1c
+.RI "virtual bool \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIReturns false when one of the embedded continuators say so (logical and). \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "std::vector< \fBeoContinue\fP< \fBEOT\fP > * > \fBcontinuators\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoCombinedContinue< EOT >"
+Combined continuators - logical AND: Continues until one of the embedded continuators says halt! 
+
+20/11/00 MS: Changed the 2-continuator construct to a std::vector > to be consistent with other Combined constructs and allow to easily handle more than 2 continuators
+.PP
+02/2003 Ramón Casero Cañas - added the removeLast() method 
+.PP
+Definition at line 42 of file eoCombinedContinue.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoCombinedInit.3 b/trunk/paradiseo-eo/doc/man/man3/eoCombinedInit.3
new file mode 100644
index 000000000..189419e85
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoCombinedInit.3
@@ -0,0 +1,72 @@
+.TH "eoCombinedInit" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoCombinedInit \- Combined INIT: a proportional recombination of \fBeoInit\fP objects.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoInit< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoCombinedInit\fP (\fBeoInit\fP< \fBEOT\fP > &_init, double _rate)"
+.br
+.RI "\fICtor, make sure that at least one \fBeoInit\fP is present. \fP"
+.ti -1c
+.RI "void \fBadd\fP (\fBeoInit\fP< \fBEOT\fP > &_init, double _rate, bool _verbose=false)"
+.br
+.RI "\fIThe usual method to add objects to the combination note the _verbose parameter, that allows to print what's inside the combination with scaled rates. \fP"
+.ti -1c
+.RI "virtual void \fBprintOn\fP (std::ostream &_os)"
+.br
+.RI "\fIoutputs the operators and percentages \fP"
+.ti -1c
+.RI "virtual void \fBoperator()\fP (\fBEOT\fP &_eo)"
+.br
+.RI "\fIPerforms the init: chooses among all initializers using roulette wheel on the rates. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.RI "\fIclassName: Mandatory because of eoCombinedInit. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "std::vector< \fBeoInit\fP< \fBEOT\fP > * > \fBinitializers\fP"
+.br
+.ti -1c
+.RI "std::vector< double > \fBrates\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoCombinedInit< EOT >"
+Combined INIT: a proportional recombination of \fBeoInit\fP objects. 
+.PP
+Definition at line 35 of file eoCombinedInit.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template virtual std::string \fBeoCombinedInit\fP< \fBEOT\fP >::className (void) const\fC [inline, virtual]\fP"
+.PP
+className: Mandatory because of eoCombinedInit. 
+.PP
+SHould be pure virtual, but then we should go over the whole code to write the method for all derived classes ... MS 16/7/04 
+.PP
+Reimplemented from \fBeoInit< EOT >\fP.
+.PP
+Definition at line 81 of file eoCombinedInit.h.
+.PP
+Referenced by eoCombinedInit< EOT >::printOn().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoCommaReplacement.3 b/trunk/paradiseo-eo/doc/man/man3/eoCommaReplacement.3
new file mode 100644
index 000000000..45e081af3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoCommaReplacement.3
@@ -0,0 +1,35 @@
+.TH "eoCommaReplacement" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoCommaReplacement \- ES type of replacement strategy: ignore parents, truncate offspring.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMergeReduce< EOT >< EOT >\fP.
+.PP
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoNoElitism\fP< \fBEOT\fP > \fBno_elite\fP"
+.br
+.ti -1c
+.RI "\fBeoTruncate\fP< \fBEOT\fP > \fBtruncate\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoCommaReplacement< EOT >"
+ES type of replacement strategy: ignore parents, truncate offspring. 
+.PP
+Definition at line 87 of file eoMergeReduce.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoContinue.3 b/trunk/paradiseo-eo/doc/man/man3/eoContinue.3
new file mode 100644
index 000000000..fd9db016e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoContinue.3
@@ -0,0 +1,83 @@
+.TH "eoContinue" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoContinue \- Termination condition for the genetic algorithm Takes the population as input, returns true for continue, false for termination.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoUF< const eoPop< EOT > &, bool >\fP, and \fBeoPersistent\fP.
+.PP
+Inherited by \fBeoCheckPoint< EOT >\fP, \fBeoCombinedContinue< EOT >\fP, \fBeoCtrlCContinue< EOT >\fP, \fBeoEvalContinue< EOT >\fP, \fBeoFitContinue< EOT >\fP, \fBeoGenContinue< EOT >\fP, eoPeriodicContinue< EOT >, and \fBeoSteadyFitContinue< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.ti -1c
+.RI "void \fBreadFrom\fP (std::istream &__is)"
+.br
+.RI "\fIRead object. \fP"
+.ti -1c
+.RI "void \fBprintOn\fP (std::ostream &__os) const "
+.br
+.RI "\fIWrite object. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoContinue< EOT >"
+Termination condition for the genetic algorithm Takes the population as input, returns true for continue, false for termination. 
+.PP
+Definition at line 37 of file eoContinue.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template void \fBeoContinue\fP< \fBEOT\fP >::readFrom (std::istream & __is)\fC [inline, virtual]\fP"
+.PP
+Read object. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_is\fP A std::istream. 
+.RE
+.PP
+\fBExceptions:\fP
+.RS 4
+\fIruntime_std::exception\fP If a valid object can't be read. 
+.RE
+.PP
+
+.PP
+Implements \fBeoPersistent\fP.
+.PP
+Reimplemented in \fBeoGenContinue< EOT >\fP.
+.PP
+Definition at line 42 of file eoContinue.h.
+.SS "template void \fBeoContinue\fP< \fBEOT\fP >::printOn (std::ostream & __os) const\fC [inline, virtual]\fP"
+.PP
+Write object. 
+.PP
+It's called printOn since it prints the object on a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_os\fP A std::ostream. 
+.RE
+.PP
+
+.PP
+Implements \fBeoPrintable\fP.
+.PP
+Reimplemented in \fBeoGenContinue< EOT >\fP.
+.PP
+Definition at line 47 of file eoContinue.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoCountedDynUpdate.3 b/trunk/paradiseo-eo/doc/man/man3/eoCountedDynUpdate.3
new file mode 100644
index 000000000..37389ce58
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoCountedDynUpdate.3
@@ -0,0 +1,44 @@
+.TH "eoCountedDynUpdate" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoCountedDynUpdate \- An \fBeoUpdater\fP to update an \fBeoUpdatable\fP object every given tic.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoDynUpdater\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoCountedDynUpdate\fP (\fBeoUpdatable\fP &_toUpdate, unsigned _interval)"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (void)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "const unsigned \fBinterval\fP"
+.br
+.ti -1c
+.RI "unsigned \fBcounter\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+An \fBeoUpdater\fP to update an \fBeoUpdatable\fP object every given tic. 
+.PP
+Definition at line 93 of file eoUpdatable.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoCountedStateSaver.3 b/trunk/paradiseo-eo/doc/man/man3/eoCountedStateSaver.3
new file mode 100644
index 000000000..6b0f3539b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoCountedStateSaver.3
@@ -0,0 +1,72 @@
+.TH "eoCountedStateSaver" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoCountedStateSaver \- an \fBeoUpdater\fP that saves a state every given generations  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoUpdater\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoCountedStateSaver\fP (unsigned _interval, const \fBeoState\fP &_state, std::string _prefix, bool _saveOnLastCall, std::string _extension='sav', unsigned _counter=0)"
+.br
+.ti -1c
+.RI "\fBeoCountedStateSaver\fP (unsigned _interval, const \fBeoState\fP &_state, std::string _prefix='state', std::string _extension='sav', unsigned _counter=0)"
+.br
+.ti -1c
+.RI "virtual void \fBlastCall\fP (void)"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (void)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.in -1c
+.SS "Private Member Functions"
+
+.in +1c
+.ti -1c
+.RI "void \fBdoItNow\fP (void)"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "const \fBeoState\fP & \fBstate\fP"
+.br
+.ti -1c
+.RI "const unsigned \fBinterval\fP"
+.br
+.ti -1c
+.RI "unsigned \fBcounter\fP"
+.br
+.ti -1c
+.RI "bool \fBsaveOnLastCall\fP"
+.br
+.ti -1c
+.RI "const std::string \fBprefix\fP"
+.br
+.ti -1c
+.RI "const std::string \fBextension\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+an \fBeoUpdater\fP that saves a state every given generations 
+.PP
+Definition at line 127 of file eoUpdater.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoCtrlCContinue.3 b/trunk/paradiseo-eo/doc/man/man3/eoCtrlCContinue.3
new file mode 100644
index 000000000..d741a0282
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoCtrlCContinue.3
@@ -0,0 +1,40 @@
+.TH "eoCtrlCContinue" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoCtrlCContinue \- Ctrl C handling: this \fBeoContinue\fP tells whether the user pressed Ctrl C.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoContinue< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoCtrlCContinue\fP ()"
+.br
+.RI "\fICtor : installs the signal handler. \fP"
+.ti -1c
+.RI "virtual bool \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_vEO)"
+.br
+.RI "\fIReturns false when Ctrl C has been typed in reached. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoCtrlCContinue< EOT >"
+Ctrl C handling: this \fBeoContinue\fP tells whether the user pressed Ctrl C. 
+.PP
+Definition at line 45 of file eoCtrlCContinue.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoDetBitFlip.3 b/trunk/paradiseo-eo/doc/man/man3/eoDetBitFlip.3
new file mode 100644
index 000000000..5607c6ee3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoDetBitFlip.3
@@ -0,0 +1,78 @@
+.TH "eoDetBitFlip" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoDetBitFlip \- eoDetBitFlip --> changes exactly k bits  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< Chrom >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoDetBitFlip\fP (const unsigned &_num_bit=1)"
+.br
+.RI "\fI(Default) Constructor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIThe class name. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (Chrom &chrom)"
+.br
+.RI "\fIChange num_bit bits. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBnum_bit\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoDetBitFlip< Chrom >"
+eoDetBitFlip --> changes exactly k bits 
+.PP
+Definition at line 67 of file eoBitOp.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoDetBitFlip\fP< Chrom >::\fBeoDetBitFlip\fP (const unsigned & _num_bit = \fC1\fP)\fC [inline]\fP"
+.PP
+(Default) Constructor. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_num_bit\fP The number of bits to change default is one - equivalent to eoOneBitFlip then 
+.RE
+.PP
+
+.PP
+Definition at line 75 of file eoBitOp.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template bool \fBeoDetBitFlip\fP< Chrom >::operator() (Chrom & chrom)\fC [inline, virtual]\fP"
+.PP
+Change num_bit bits. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIchrom\fP The cromosome which one bit is going to be changed. 
+.RE
+.PP
+
+.PP
+Implements \fBeoUF< Chrom &, bool >\fP.
+.PP
+Definition at line 84 of file eoBitOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoDetSelect.3 b/trunk/paradiseo-eo/doc/man/man3/eoDetSelect.3
new file mode 100644
index 000000000..b805795cd
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoDetSelect.3
@@ -0,0 +1,59 @@
+.TH "eoDetSelect" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoDetSelect \- eoDetSelect selects many individuals determinisctically  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoSelect< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoDetSelect\fP (double _rate=1.0, bool _interpret_as_rate=true)"
+.br
+.RI "\fIinit \fP"
+.ti -1c
+.RI "virtual void \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_source, \fBeoPop\fP< \fBEOT\fP > &_dest)"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoHowMany\fP \fBhowMany\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoDetSelect< EOT >"
+eoDetSelect selects many individuals determinisctically 
+.PP
+Definition at line 40 of file eoDetSelect.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template virtual void \fBeoDetSelect\fP< \fBEOT\fP >::operator() (const \fBeoPop\fP< \fBEOT\fP > & _source, \fBeoPop\fP< \fBEOT\fP > & _dest)\fC [inline, virtual]\fP"
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_source\fP the source population 
+.br
+\fI_dest\fP the resulting population (size of this population is given by the HowMany data It empties the destination and adds the selection into it) 
+.RE
+.PP
+
+.PP
+Implements \fBeoBF< const eoPop< EOT > &, eoPop< EOT > &, void >\fP.
+.PP
+Definition at line 53 of file eoDetSelect.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoDetTournamentSelect.3 b/trunk/paradiseo-eo/doc/man/man3/eoDetTournamentSelect.3
new file mode 100644
index 000000000..ae6fe6ca0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoDetTournamentSelect.3
@@ -0,0 +1,43 @@
+.TH "eoDetTournamentSelect" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoDetTournamentSelect \- eoDetTournamentSelect: a selection method that selects ONE individual by deterministic tournament -MS- 24/10/99  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoSelectOne< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoDetTournamentSelect\fP (unsigned _tSize=2)"
+.br
+.ti -1c
+.RI "virtual const \fBEOT\fP & \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBtSize\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoDetTournamentSelect< EOT >"
+eoDetTournamentSelect: a selection method that selects ONE individual by deterministic tournament -MS- 24/10/99 
+.PP
+Definition at line 44 of file eoDetTournamentSelect.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoDetTournamentTruncate.3 b/trunk/paradiseo-eo/doc/man/man3/eoDetTournamentTruncate.3
new file mode 100644
index 000000000..7ceb23981
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoDetTournamentTruncate.3
@@ -0,0 +1,45 @@
+.TH "eoDetTournamentTruncate" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoDetTournamentTruncate \- a truncate class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoReduce< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoDetTournamentTruncate\fP (unsigned _t_size)"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_newgen, unsigned _newsize)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBt_size\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoDetTournamentTruncate< EOT >"
+a truncate class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g. 
+
+see \fBeoSSGADetTournamentReplacement\fP) 
+.PP
+Definition at line 188 of file eoReduce.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoDetTournamentTruncateSplit.3 b/trunk/paradiseo-eo/doc/man/man3/eoDetTournamentTruncateSplit.3
new file mode 100644
index 000000000..f0d783bfe
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoDetTournamentTruncateSplit.3
@@ -0,0 +1,52 @@
+.TH "eoDetTournamentTruncateSplit" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoDetTournamentTruncateSplit \- a ReduceSplit class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoReduceSplit< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoDetTournamentTruncateSplit\fP (unsigned _t_size, \fBeoHowMany\fP _howMany, bool _returnEliminated=false)"
+.br
+.RI "\fICtor: must provide amount of reduction, and whether or not you need to return the eliminated guys. \fP"
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_newgen, \fBeoPop\fP< \fBEOT\fP > &_eliminated)"
+.br
+.RI "\fIPerforms repeated inverse_deterministic_tournament on the pop. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBt_size\fP"
+.br
+.ti -1c
+.RI "\fBeoHowMany\fP \fBhowMany\fP"
+.br
+.ti -1c
+.RI "bool \fBreturnEliminated\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoDetTournamentTruncateSplit< EOT >"
+a ReduceSplit class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g. 
+
+see \fBeoSSGADetTournamentReplacement\fP) 
+.PP
+Definition at line 205 of file eoReduceSplit.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoDetTournamentWorthSelect.3 b/trunk/paradiseo-eo/doc/man/man3/eoDetTournamentWorthSelect.3
new file mode 100644
index 000000000..8a00e45b3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoDetTournamentWorthSelect.3
@@ -0,0 +1,52 @@
+.TH "eoDetTournamentWorthSelect" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoDetTournamentWorthSelect \- An instance of eoSelectPerf2Worth that does selection from the Worthes using a ...  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoSelectFromWorth< EOT, WorthT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef std::vector< WorthT >::iterator \fBworthIterator\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoDetTournamentWorthSelect\fP (\fBeoPerf2Worth\fP< \fBEOT\fP, WorthT > &perf2Worth, unsigned _tSize)"
+.br
+.ti -1c
+.RI "virtual const \fBEOT\fP & \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &pop)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBtSize\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoDetTournamentWorthSelect< EOT, WorthT >"
+An instance of eoSelectPerf2Worth that does selection from the Worthes using a ... 
+
+determinisitic tournament, yes! 
+.PP
+Definition at line 91 of file eoSelectFromWorth.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoDetUniformMutation.3 b/trunk/paradiseo-eo/doc/man/man3/eoDetUniformMutation.3
new file mode 100644
index 000000000..d04e674cd
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoDetUniformMutation.3
@@ -0,0 +1,135 @@
+.TH "eoDetUniformMutation" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoDetUniformMutation \- eoDetUniformMutation --> changes exactly k values of the std::vector by uniform choice with range epsilon  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoDetUniformMutation\fP (const double &_epsilon, const unsigned &_no=1)"
+.br
+.RI "\fI(Default) Constructor for homogeneous genotype it's there mostly for backward compatibility \fP"
+.ti -1c
+.RI "\fBeoDetUniformMutation\fP (\fBeoRealVectorBounds\fP &_bounds, const double &_epsilon, const unsigned &_no=1)"
+.br
+.RI "\fIConstructor with bounds. \fP"
+.ti -1c
+.RI "\fBeoDetUniformMutation\fP (\fBeoRealVectorBounds\fP &_bounds, const std::vector< double > &_epsilon, const unsigned &_no=1)"
+.br
+.RI "\fIConstructor with bounds and full std::vector of epsilon. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIThe class name. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eo)"
+.br
+.RI "\fIDo it! \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "bool \fBhomogeneous\fP"
+.br
+.ti -1c
+.RI "\fBeoRealVectorBounds\fP & \fBbounds\fP"
+.br
+.ti -1c
+.RI "std::vector< double > \fBepsilon\fP"
+.br
+.ti -1c
+.RI "unsigned \fBno\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoDetUniformMutation< EOT >"
+eoDetUniformMutation --> changes exactly k values of the std::vector by uniform choice with range epsilon 
+.PP
+Definition at line 144 of file eoRealOp.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoDetUniformMutation\fP< \fBEOT\fP >::\fBeoDetUniformMutation\fP (const double & _epsilon, const unsigned & _no = \fC1\fP)\fC [inline]\fP"
+.PP
+(Default) Constructor for homogeneous genotype it's there mostly for backward compatibility 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_epsilon\fP the range for uniform nutation 
+.br
+\fInumber\fP of coordinate to modify 
+.RE
+.PP
+
+.PP
+Definition at line 154 of file eoRealOp.h.
+.SS "template \fBeoDetUniformMutation\fP< \fBEOT\fP >::\fBeoDetUniformMutation\fP (\fBeoRealVectorBounds\fP & _bounds, const double & _epsilon, const unsigned & _no = \fC1\fP)\fC [inline]\fP"
+.PP
+Constructor with bounds. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_bounds\fP an \fBeoRealVectorBounds\fP that contains the bounds 
+.br
+\fI_epsilon\fP the range for uniform nutation (to be scaled if necessary) 
+.br
+\fInumber\fP of coordinate to modify 
+.RE
+.PP
+
+.PP
+Definition at line 164 of file eoRealOp.h.
+.PP
+References eoRealBaseVectorBounds::isBounded(), and eoRealBaseVectorBounds::range().
+.SS "template \fBeoDetUniformMutation\fP< \fBEOT\fP >::\fBeoDetUniformMutation\fP (\fBeoRealVectorBounds\fP & _bounds, const std::vector< double > & _epsilon, const unsigned & _no = \fC1\fP)\fC [inline]\fP"
+.PP
+Constructor with bounds and full std::vector of epsilon. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_bounds\fP an \fBeoRealVectorBounds\fP that contains the bounds 
+.br
+\fI_epsilon\fP the VECTOR of ranges for uniform mutation 
+.br
+\fInumber\fP of coordinate to modify 
+.RE
+.PP
+
+.PP
+Definition at line 181 of file eoRealOp.h.
+.PP
+References eoRealBaseVectorBounds::isBounded(), and eoRealBaseVectorBounds::range().
+.SH "Member Function Documentation"
+.PP 
+.SS "template bool \fBeoDetUniformMutation\fP< \fBEOT\fP >::operator() (\fBEOT\fP & _eo)\fC [inline, virtual]\fP"
+.PP
+Do it! 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_eo\fP The indi undergoing the mutation 
+.RE
+.PP
+
+.PP
+Implements \fBeoUF< EOT &, bool >\fP.
+.PP
+Definition at line 199 of file eoRealOp.h.
+.PP
+References eoRealBaseVectorBounds::isMaxBounded(), eoRealBaseVectorBounds::isMinBounded(), eoRealBaseVectorBounds::maximum(), eoRealBaseVectorBounds::minimum(), eoRng::random(), and eoRng::uniform().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoDeterministicSaDReplacement.3 b/trunk/paradiseo-eo/doc/man/man3/eoDeterministicSaDReplacement.3
new file mode 100644
index 000000000..847ca94da
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoDeterministicSaDReplacement.3
@@ -0,0 +1,62 @@
+.TH "eoDeterministicSaDReplacement" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoDeterministicSaDReplacement \- eoDeterministicSaDReplacement: replacement strategy that is just, in sequence saves best and kill worse from parents + saves best and kill worse from offspring + merge remaining (neither save nor killed) parents and offspring + reduce that merged population = returns reduced pop + best parents + best offspring  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoReplacement< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoDeterministicSaDReplacement\fP (\fBeoReduce\fP< \fBEOT\fP > &_reduceGlobal, double _surviveParents, double _dieParents=0, double _surviveOffspring=0, double _dieOffspring=0, bool _interpret_as_rate=true)"
+.br
+.RI "\fIConstructor with reduce. \fP"
+.ti -1c
+.RI "\fBeoDeterministicSaDReplacement\fP (double _surviveParents, double _dieParents=0, double _surviveOffspring=0, double _dieOffspring=0, bool _interpret_as_rate=true)"
+.br
+.RI "\fIConstructor with default truncate used as reduce. \fP"
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_parents, \fBeoPop\fP< \fBEOT\fP > &_offspring)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoReduce\fP< \fBEOT\fP > & \fBreduceGlobal\fP"
+.br
+.ti -1c
+.RI "\fBeoDeterministicSurviveAndDie\fP< \fBEOT\fP > \fBsAdParents\fP"
+.br
+.ti -1c
+.RI "\fBeoDeterministicSurviveAndDie\fP< \fBEOT\fP > \fBsAdOffspring\fP"
+.br
+.ti -1c
+.RI "\fBeoPlus\fP< \fBEOT\fP > \fBplus\fP"
+.br
+.ti -1c
+.RI "\fBeoTruncate\fP< \fBEOT\fP > \fBtruncate\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoDeterministicSaDReplacement< EOT >"
+eoDeterministicSaDReplacement: replacement strategy that is just, in sequence saves best and kill worse from parents + saves best and kill worse from offspring + merge remaining (neither save nor killed) parents and offspring + reduce that merged population = returns reduced pop + best parents + best offspring 
+
+An obvious use is as strong elitist strategy, i.e. preserving best parents, and reducing (either offspring or parents+offspring) 
+.PP
+Definition at line 132 of file eoSurviveAndDie.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoDeterministicSurviveAndDie.3 b/trunk/paradiseo-eo/doc/man/man3/eoDeterministicSurviveAndDie.3
new file mode 100644
index 000000000..900e1f830
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoDeterministicSurviveAndDie.3
@@ -0,0 +1,41 @@
+.TH "eoDeterministicSurviveAndDie" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoDeterministicSurviveAndDie \- An instance (theonly one as of today, Dec.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoSurviveAndDie< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoDeterministicSurviveAndDie\fP (double _survive, double _die, bool _interpret_as_rate=true)"
+.br
+.RI "\fIconstructor \fP"
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_pop, \fBeoPop\fP< \fBEOT\fP > &_luckyGuys)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoDeterministicSurviveAndDie< EOT >"
+An instance (theonly one as of today, Dec. 
+
+20, 2000) of an \fBeoSurviveAndDie\fP, that does everything deterministically
+.PP
+Used in \fBeoDeterministicSaDReplacement\fP. 
+.PP
+Definition at line 73 of file eoSurviveAndDie.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoDistance.3 b/trunk/paradiseo-eo/doc/man/man3/eoDistance.3
new file mode 100644
index 000000000..5fc941b76
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoDistance.3
@@ -0,0 +1,27 @@
+.TH "eoDistance" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoDistance \- This is a generic class for distance functors: takes 2 things ane returns a double.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoBF< const EOT &, const EOT &, double >\fP.
+.PP
+Inherited by eoFitnessDistance< EOT >, \fBeoHammingDistance< EOT >\fP, and \fBeoQuadDistance< EOT >\fP.
+.PP
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoDistance< EOT >"
+This is a generic class for distance functors: takes 2 things ane returns a double. 
+.PP
+Definition at line 35 of file eoDistance.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoDistribUpdater.3 b/trunk/paradiseo-eo/doc/man/man3/eoDistribUpdater.3
new file mode 100644
index 000000000..96d7276c8
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoDistribUpdater.3
@@ -0,0 +1,37 @@
+.TH "eoDistribUpdater" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoDistribUpdater \- Base class for Distribution Evolution Algorithms within \fBEO\fP: the update rule of distribution.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoBF< eoDistribution< EOT > &, eoPop< EOT > &, void >\fP.
+.PP
+Inherited by \fBeoPBILAdditive< EOT >\fP, and \fBeoPBILOrg< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual void \fBoperator()\fP (\fBeoDistribution\fP< \fBEOT\fP > &, \fBeoPop\fP< \fBEOT\fP > &)=0"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoDistribUpdater< EOT >"
+Base class for Distribution Evolution Algorithms within \fBEO\fP: the update rule of distribution. 
+
+It takes one distribution and updates it according to one population 
+.PP
+Definition at line 43 of file eoDistribUpdater.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoDistribution.3 b/trunk/paradiseo-eo/doc/man/man3/eoDistribution.3
new file mode 100644
index 000000000..b708ee68a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoDistribution.3
@@ -0,0 +1,39 @@
+.TH "eoDistribution" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoDistribution \- Abstract class for Distribution Evolution Algorithms within \fBEO\fP: the distribution itself.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoInit< EOT >< EOT >\fP, \fBeoPersistent\fP, and \fBeoObject\fP.
+.PP
+Inherited by \fBeoPBILDistrib< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual void \fBoperator()\fP (\fBEOT\fP &)=0"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoDistribution< EOT >"
+Abstract class for Distribution Evolution Algorithms within \fBEO\fP: the distribution itself. 
+
+It basically IS AN \fBeoInit\fP - \fBoperator()(EOT &)\fP generates new indis
+.PP
+The instances will probably be \fBeoValueParam\fP of some kind see \fBeoPBILDistrib.h\fP 
+.PP
+Definition at line 45 of file eoDistribution.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoDominanceMap.3 b/trunk/paradiseo-eo/doc/man/man3/eoDominanceMap.3
new file mode 100644
index 000000000..b99edd612
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoDominanceMap.3
@@ -0,0 +1,93 @@
+.TH "eoDominanceMap" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoDominanceMap \- eoDominanceMap, utility class to calculate and maintain a map (std::vector >) of pareto dominance statistics.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoUF< const eoPop< EoType > &, void >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "void \fBclear\fP ()"
+.br
+.RI "\fIClears the map. \fP"
+.ti -1c
+.RI "void \fBoperator()\fP (const \fBeoPop\fP< \fBEoType\fP > &_pop)"
+.br
+.RI "\fIUpdate or create the dominance map. \fP"
+.ti -1c
+.RI "void \fBremove\fP (unsigned i)"
+.br
+.RI "\fIRemoves the domination info for a given individual, thus nothing dominates it and it dominates nothing. \fP"
+.ti -1c
+.RI "void \fBsetup\fP (const \fBeoPop\fP< \fBEoType\fP > &_pop)"
+.br
+.RI "\fICreate domination matrix from scratch. \fP"
+.ti -1c
+.RI "std::vector< double > \fBsum_dominators\fP () const "
+.br
+.RI "\fIFor all elements, returns the no. \fP"
+.ti -1c
+.RI "std::vector< double > \fBsum_dominants\fP () const "
+.br
+.RI "\fIFor all elements, returns the number of elements that the element dominates Thus: higher is better It returns a std::vector cuz that makes subsequent manipulation that much easier. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "std::vector< typename EoType::Fitness > \fBfitness\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoDominanceMap< EoType >"
+eoDominanceMap, utility class to calculate and maintain a map (std::vector >) of pareto dominance statistics. 
+
+It is set up such that
+.PP
+if map[i][j] == true then i dominates j
+.PP
+The dominance map can be used to perform pareto ranking (\fBeoParetoRanking\fP) or non dominated sorting. For the latter, the \fBremove()\fP member function might come in handy.
+.PP
+\fBTodo\fP
+.RS 4
+make it an \fBeoStat\fP? 
+.RE
+.PP
+
+.PP
+Definition at line 47 of file eoDominanceMap.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template void \fBeoDominanceMap\fP< \fBEoType\fP >::setup (const \fBeoPop\fP< \fBEoType\fP > & _pop)\fC [inline]\fP"
+.PP
+Create domination matrix from scratch. 
+.PP
+Complexity O(N^2) 
+.PP
+Definition at line 81 of file eoDominanceMap.h.
+.PP
+Referenced by eoDominanceMap< EOT >::operator()().
+.SS "template std::vector \fBeoDominanceMap\fP< \fBEoType\fP >::sum_dominators () const\fC [inline]\fP"
+.PP
+For all elements, returns the no. 
+.PP
+of elements that dominate the element Thus: lower is better (and 0 is the front). It returns a std::vector cuz that makes subsequent manipulation that much easier 
+.PP
+Definition at line 118 of file eoDominanceMap.h.
+.PP
+Referenced by eoParetoRanking< EOT >::calculate_worths().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoDoubleExchange.3 b/trunk/paradiseo-eo/doc/man/man3/eoDoubleExchange.3
new file mode 100644
index 000000000..3f4a01de3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoDoubleExchange.3
@@ -0,0 +1,39 @@
+.TH "eoDoubleExchange" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoDoubleExchange \- Discrete crossover == exchange of values.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoBinOp< double >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoDoubleExchange\fP ()"
+.br
+.RI "\fI(Default) Constructor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIThe class name. Used to display statistics. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (double &r1, const double &r2)"
+.br
+.RI "\fIExchanges or not the values. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+Discrete crossover == exchange of values. 
+.PP
+Definition at line 41 of file eoRealAtomXover.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoDoubleIntermediate.3 b/trunk/paradiseo-eo/doc/man/man3/eoDoubleIntermediate.3
new file mode 100644
index 000000000..29dd6182b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoDoubleIntermediate.3
@@ -0,0 +1,39 @@
+.TH "eoDoubleIntermediate" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoDoubleIntermediate \- Intermediate crossover == linear combination.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoBinOp< double >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoDoubleIntermediate\fP ()"
+.br
+.RI "\fI(Default) Constructor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIThe class name. Used to display statistics. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (double &r1, const double &r2)"
+.br
+.RI "\fILinear combination of both parents. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+Intermediate crossover == linear combination. 
+.PP
+Definition at line 71 of file eoRealAtomXover.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoDrawable.3 b/trunk/paradiseo-eo/doc/man/man3/eoDrawable.3
new file mode 100644
index 000000000..75c2341f2
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoDrawable.3
@@ -0,0 +1,66 @@
+.TH "eoDrawable" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoDrawable \- eoDrawable is a template class that adds a drawing interface to an object.\\ Requisites for template instantiation are that the object must admit a default ctor and a copy ctor.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoDrawable\fP (const Object &_o)"
+.br
+.RI "\fIMain ctor from an already built Object. \fP"
+.ti -1c
+.RI "\fBeoDrawable\fP (const \fBeoDrawable\fP &_d)"
+.br
+.RI "\fICopy constructor. \fP"
+.ti -1c
+.RI "virtual \fB~eoDrawable\fP ()"
+.br
+.RI "\fIVirtual dtor. They are needed in virtual class hierarchies. \fP"
+.ti -1c
+.RI "virtual void \fBdraw\fP (unsigned _x, unsigned _y)=0"
+.br
+.RI "\fIDraws the object. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoDrawable< Object >"
+eoDrawable is a template class that adds a drawing interface to an object.\\ Requisites for template instantiation are that the object must admit a default ctor and a copy ctor. 
+
+The Object must be an \fBeoObject\fP, thus, it must have its methods: className, eoDrawables can be drawn on any two-dimensional surface; it can be added to any object with above characteristics. 
+.PP
+\fBSee also:\fP
+.RS 4
+\fBeoObject\fP 
+.RE
+.PP
+
+.PP
+Definition at line 44 of file eoDrawable.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template virtual void \fBeoDrawable\fP< Object >::draw (unsigned _x, unsigned _y)\fC [pure virtual]\fP"
+.PP
+Draws the object. 
+.PP
+It must be redefined in any subclass, it´s impossible to have a general drawing method 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_x,_y\fP coorinates 
+.RE
+.PP
+
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoDynSGATransform.3 b/trunk/paradiseo-eo/doc/man/man3/eoDynSGATransform.3
new file mode 100644
index 000000000..6dbc3bbce
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoDynSGATransform.3
@@ -0,0 +1,89 @@
+.TH "eoDynSGATransform" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoDynSGATransform \- eoDynSGATransform: transforms a population using genetic operators.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoTransform< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoDynSGATransform\fP (\fBeoQuadOp\fP< \fBEOT\fP > &_cross, double _cProba, \fBeoMonOp\fP< \fBEOT\fP > &_mutate, double _mProba)"
+.br
+.RI "\fIDefault constructor - receives values. \fP"
+.ti -1c
+.RI "\fBeoDynSGATransform\fP (\fBeoQuadOp\fP< \fBEOT\fP > &_cross, double *_cProbaRef, \fBeoMonOp\fP< \fBEOT\fP > &_mutate, double *_mProbaRef)"
+.br
+.RI "\fIThis constructor receives pointers. \fP"
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fITransforms a population. \fP"
+.ti -1c
+.RI "double & \fBPCrossHandle\fP ()"
+.br
+.ti -1c
+.RI "double & \fBPMutHandle\fP ()"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoInvalidateQuadOp\fP< \fBEOT\fP > \fBcross\fP"
+.br
+.ti -1c
+.RI "double \fBcrossoverProbaHolder\fP"
+.br
+.ti -1c
+.RI "double & \fBcrossoverProba\fP"
+.br
+.ti -1c
+.RI "\fBeoInvalidateMonOp\fP< \fBEOT\fP > \fBmutate\fP"
+.br
+.ti -1c
+.RI "double \fBmutationProbaHolder\fP"
+.br
+.ti -1c
+.RI "double & \fBmutationProba\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoDynSGATransform< EOT >"
+eoDynSGATransform: transforms a population using genetic operators. 
+
+It is the Dynamic version of the above \fBeoSGATransform\fP i.e. the operators probabilities can be passed as an \fBeoValueParam\fP, and hence can be modified from outside It is here mainly for tutorial reasons 
+.PP
+Definition at line 98 of file eoSGATransform.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template void \fBeoDynSGATransform\fP< \fBEOT\fP >::operator() (\fBeoPop\fP< \fBEOT\fP > & _pop)\fC [inline, virtual]\fP"
+.PP
+Transforms a population. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIpop\fP The population to be transformed. 
+.RE
+.PP
+
+.PP
+Implements \fBeoUF< eoPop< EOT > &, void >\fP.
+.PP
+Definition at line 125 of file eoSGATransform.h.
+.PP
+References eoRng::flip().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoDynUpdater.3 b/trunk/paradiseo-eo/doc/man/man3/eoDynUpdater.3
new file mode 100644
index 000000000..5deacb20e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoDynUpdater.3
@@ -0,0 +1,43 @@
+.TH "eoDynUpdater" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoDynUpdater \- A base class to actually update an \fBeoUpdatable\fP object.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoUpdater\fP.
+.PP
+Inherited by \fBeoCountedDynUpdate\fP, and \fBeoTimedDynUpdate\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoDynUpdater\fP (\fBeoUpdatable\fP &_toUpdate)"
+.br
+.ti -1c
+.RI "virtual void \fBoperator()\fP ()"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoUpdatable\fP & \fBtoUpdate\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+A base class to actually update an \fBeoUpdatable\fP object. 
+.PP
+Definition at line 51 of file eoUpdatable.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoEDA.3 b/trunk/paradiseo-eo/doc/man/man3/eoEDA.3
new file mode 100644
index 000000000..eb48a038a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoEDA.3
@@ -0,0 +1,31 @@
+.TH "eoEDA" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoEDA \- eoEDA: Estimation of Distribution Algorithm within \fBEO\fP  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoUF< eoDistribution< EOT > &, void >\fP.
+.PP
+Inherited by \fBeoSimpleEDA< EOT >\fP.
+.PP
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoEDA< EOT >"
+eoEDA: Estimation of Distribution Algorithm within \fBEO\fP 
+
+The abstract class for algorithms that evolve a probability distribution on the spaces of populations rather than a population
+.PP
+It IS NOT an \fBeoAlgo\fP, as it evolves a distribution, not a population 
+.PP
+Definition at line 41 of file eoEDA.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoEPReduce.3 b/trunk/paradiseo-eo/doc/man/man3/eoEPReduce.3
new file mode 100644
index 000000000..219260454
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoEPReduce.3
@@ -0,0 +1,54 @@
+.TH "eoEPReduce" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoEPReduce \- EP truncation method (some global stochastic tournament + sort) Softer selective pressure than pure truncate.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoReduce< EOT >< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::Fitness \fBFitness\fP"
+.br
+.ti -1c
+.RI "typedef std::pair< float, typename \fBeoPop\fP< \fBEOT\fP >::iterator > \fBEPpair\fP"
+.br
+.RI "\fIhelper struct for comparing on std::pairs \fP"
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoEPReduce\fP (unsigned _t_size)"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_newgen, unsigned _newsize)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBt_size\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoEPReduce< EOT >"
+EP truncation method (some global stochastic tournament + sort) Softer selective pressure than pure truncate. 
+.PP
+Definition at line 83 of file eoReduce.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoEPReplacement.3 b/trunk/paradiseo-eo/doc/man/man3/eoEPReplacement.3
new file mode 100644
index 000000000..e5aeff65f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoEPReplacement.3
@@ -0,0 +1,42 @@
+.TH "eoEPReplacement" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoEPReplacement \- EP type of replacement strategy: first add parents to population, then truncate using EP tournament.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMergeReduce< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoEPReplacement\fP (int _tSize)"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoPlus\fP< \fBEOT\fP > \fBplus\fP"
+.br
+.ti -1c
+.RI "\fBeoEPReduce\fP< \fBEOT\fP > \fBtruncate\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoEPReplacement< EOT >"
+EP type of replacement strategy: first add parents to population, then truncate using EP tournament. 
+.PP
+Definition at line 102 of file eoMergeReduce.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoEasyEA.3 b/trunk/paradiseo-eo/doc/man/man3/eoEasyEA.3
new file mode 100644
index 000000000..14a5f5737
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoEasyEA.3
@@ -0,0 +1,110 @@
+.TH "eoEasyEA" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoEasyEA \- An easy-to-use evolutionary algorithm; you can use any chromosome, and any selection transformation, merging and evaluation algorithms; you can even change in runtime parameters of those sub-algorithms.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoAlgo< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoEasyEA\fP (\fBeoContinue\fP< \fBEOT\fP > &_continuator, \fBeoEvalFunc\fP< \fBEOT\fP > &_eval, \fBeoBreed\fP< \fBEOT\fP > &_breed, \fBeoReplacement\fP< \fBEOT\fP > &_replace)"
+.br
+.RI "\fICtor taking a breed and merge. \fP"
+.ti -1c
+.RI "\fBeoEasyEA\fP (\fBeoContinue\fP< \fBEOT\fP > &_continuator, \fBeoPopEvalFunc\fP< \fBEOT\fP > &_eval, \fBeoBreed\fP< \fBEOT\fP > &_breed, \fBeoReplacement\fP< \fBEOT\fP > &_replace)"
+.br
+.RI "\fINEW Ctor taking a breed and merge and an eoPopEval. \fP"
+.ti -1c
+.RI "\fBeoEasyEA\fP (\fBeoContinue\fP< \fBEOT\fP > &_continuator, \fBeoEvalFunc\fP< \fBEOT\fP > &_eval, \fBeoBreed\fP< \fBEOT\fP > &_breed, \fBeoMerge\fP< \fBEOT\fP > &_merge, \fBeoReduce\fP< \fBEOT\fP > &_reduce)"
+.br
+.RI "\fICtor \fBeoBreed\fP, \fBeoMerge\fP and \fBeoReduce\fP. \fP"
+.ti -1c
+.RI "\fBeoEasyEA\fP (\fBeoContinue\fP< \fBEOT\fP > &_continuator, \fBeoEvalFunc\fP< \fBEOT\fP > &_eval, \fBeoSelect\fP< \fBEOT\fP > &_select, \fBeoTransform\fP< \fBEOT\fP > &_transform, \fBeoReplacement\fP< \fBEOT\fP > &_replace)"
+.br
+.RI "\fICtor \fBeoSelect\fP, \fBeoTransform\fP, and \fBeoReplacement\fP. \fP"
+.ti -1c
+.RI "\fBeoEasyEA\fP (\fBeoContinue\fP< \fBEOT\fP > &_continuator, \fBeoEvalFunc\fP< \fBEOT\fP > &_eval, \fBeoSelect\fP< \fBEOT\fP > &_select, \fBeoTransform\fP< \fBEOT\fP > &_transform, \fBeoMerge\fP< \fBEOT\fP > &_merge, \fBeoReduce\fP< \fBEOT\fP > &_reduce)"
+.br
+.RI "\fICtor \fBeoSelect\fP, \fBeoTransform\fP, \fBeoMerge\fP and \fBeoReduce\fP. \fP"
+.ti -1c
+.RI "virtual void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIApply a few generation of evolution to the population. \fP"
+.in -1c
+.SS "Protected Attributes"
+
+.in +1c
+.ti -1c
+.RI "eoEasyEA::eoDummySelect \fBdummySelect\fP"
+.br
+.ti -1c
+.RI "eoEasyEA::eoDummyTransform \fBdummyTransform\fP"
+.br
+.ti -1c
+.RI "eoEasyEA::eoDummyEval \fBdummyEval\fP"
+.br
+.ti -1c
+.RI "\fBeoContinue\fP< \fBEOT\fP > & \fBcontinuator\fP"
+.br
+.ti -1c
+.RI "\fBeoEvalFunc\fP< \fBEOT\fP > & \fBeval\fP"
+.br
+.ti -1c
+.RI "\fBeoPopLoopEval\fP< \fBEOT\fP > \fBloopEval\fP"
+.br
+.ti -1c
+.RI "\fBeoPopEvalFunc\fP< \fBEOT\fP > & \fBpopEval\fP"
+.br
+.ti -1c
+.RI "\fBeoSelectTransform\fP< \fBEOT\fP > \fBselectTransform\fP"
+.br
+.ti -1c
+.RI "\fBeoBreed\fP< \fBEOT\fP > & \fBbreed\fP"
+.br
+.ti -1c
+.RI "\fBeoNoElitism\fP< \fBEOT\fP > \fBdummyMerge\fP"
+.br
+.ti -1c
+.RI "\fBeoTruncate\fP< \fBEOT\fP > \fBdummyReduce\fP"
+.br
+.ti -1c
+.RI "\fBeoMergeReduce\fP< \fBEOT\fP > \fBmergeReduce\fP"
+.br
+.ti -1c
+.RI "\fBeoReplacement\fP< \fBEOT\fP > & \fBreplace\fP"
+.br
+.in -1c
+.SS "Friends"
+
+.in +1c
+.ti -1c
+.RI "class \fBeoIslandsEasyEA\fP"
+.br
+.ti -1c
+.RI "class \fBeoDistEvalEasyEA\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoEasyEA< EOT >"
+An easy-to-use evolutionary algorithm; you can use any chromosome, and any selection transformation, merging and evaluation algorithms; you can even change in runtime parameters of those sub-algorithms. 
+
+Change (MS, July 3. 2001): Replaced the \fBeoEvalFunc\fP by an \fBeoPopEvalFunc\fP: this immediately allows many useful constructs, such as co-evolution (e.g. game players), parisian approach (the solution to the problem is the whole population) or simple distribution of evaluations on a cluster. In case an \fBeoEvalFunc\fP is passed, it is embedded on an \fBeoPopLoopEval\fP This makes things a little uglier (required an additional 'dummy' member
+.PP
+Note: it looks ugly only because we wanted to authorize many different constructors. Please only look at the operator() and there shall be light 
+.PP
+Definition at line 63 of file eoEasyEA.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoEliteSequentialSelect.3 b/trunk/paradiseo-eo/doc/man/man3/eoEliteSequentialSelect.3
new file mode 100644
index 000000000..5abd6fea4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoEliteSequentialSelect.3
@@ -0,0 +1,55 @@
+.TH "eoEliteSequentialSelect" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoEliteSequentialSelect \- All Individuals in order.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoSelectOne< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoEliteSequentialSelect\fP ()"
+.br
+.RI "\fICtor: sets the current pter to numeric_limits::max() so init will take place first time not very elegant, maybe ... \fP"
+.ti -1c
+.RI "void \fBsetup\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIvirtual function to setup some population stats (for instance eoProportional can benefit greatly from this) \fP"
+.ti -1c
+.RI "virtual const \fBEOT\fP & \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBcurrent\fP"
+.br
+.ti -1c
+.RI "std::vector< const \fBEOT\fP * > \fBeoPters\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoEliteSequentialSelect< EOT >"
+All Individuals in order. 
+
+The best individual first, then the others in sequence (random order). for G3 evolution engine, see Deb, Anad and Joshi, CEC 2002
+.PP
+As \fBeoSequentialSelect\fP, it is an \fBeoSelectOne\fP to be used within the eoEaseyEA algo, but conceptually it should be a global \fBeoSelect\fP, as it selects a bunch of guys in one go (done in the setup function now) 
+.PP
+Definition at line 97 of file eoSequentialSelect.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoElitism.3 b/trunk/paradiseo-eo/doc/man/man3/eoElitism.3
new file mode 100644
index 000000000..2393fc557
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoElitism.3
@@ -0,0 +1,50 @@
+.TH "eoElitism" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoElitism \- Straightforward elitism class, specify the number of individuals to copy into new geneneration or the rate w.r.t.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMerge< EOT >\fP.
+.PP
+Inherited by \fBeoNoElitism< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoElitism\fP (double _rate, bool _interpret_as_rate=true)"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop, \fBeoPop\fP< \fBEOT\fP > &_offspring)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBrate\fP"
+.br
+.ti -1c
+.RI "unsigned \fBcombien\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoElitism< EOT >"
+Straightforward elitism class, specify the number of individuals to copy into new geneneration or the rate w.r.t. 
+
+pop size 
+.PP
+Definition at line 55 of file eoMerge.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoEsChromInit.3 b/trunk/paradiseo-eo/doc/man/man3/eoEsChromInit.3
new file mode 100644
index 000000000..e62c8b8e1
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoEsChromInit.3
@@ -0,0 +1,190 @@
+.TH "eoEsChromInit" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoEsChromInit \- Random Es-chromosome initializer (therefore derived from \fBeoInit\fP).  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoRealInitBounded< EOT >< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::Fitness \fBFitT\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoEsChromInit\fP (\fBeoRealVectorBounds\fP &_bounds, double _sigma=0.3, bool _to_scale=false)"
+.br
+.RI "\fIConstructor. \fP"
+.ti -1c
+.RI "\fBeoEsChromInit\fP (\fBeoRealVectorBounds\fP &_bounds, std::vector< double > _vecSigma)"
+.br
+.RI "\fIConstructor. \fP"
+.ti -1c
+.RI "void \fBoperator()\fP (\fBEOT\fP &_eo)"
+.br
+.RI "\fIsimply passes the argument to the uniform method of the bounds \fP"
+.in -1c
+.SS "Private Member Functions"
+
+.in +1c
+.ti -1c
+.RI "void \fBcreate_self_adapt\fP (\fBeoReal\fP< FitT > &)"
+.br
+.RI "\fICreate intializer. \fP"
+.ti -1c
+.RI "void \fBcreate_self_adapt\fP (\fBeoEsSimple\fP< FitT > &result)"
+.br
+.RI "\fICreate intializer. \fP"
+.ti -1c
+.RI "void \fBcreate_self_adapt\fP (\fBeoEsStdev\fP< FitT > &result)"
+.br
+.RI "\fICreate intializer. \fP"
+.ti -1c
+.RI "void \fBcreate_self_adapt\fP (\fBeoEsFull\fP< FitT > &result)"
+.br
+.RI "\fICreate intializer. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBuniqueSigma\fP"
+.br
+.RI "\fIInitial value in case of a unique sigma. \fP"
+.ti -1c
+.RI "std::vector< double > \fBvecSigma\fP"
+.br
+.RI "\fIInitial values in case of a vector of sigmas. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoEsChromInit< EOT >"
+Random Es-chromosome initializer (therefore derived from \fBeoInit\fP). 
+
+This class can initialize four types of real-valued genotypes thanks to tempate specialization of private method create:
+.PP
+.IP "\(bu" 2
+\fBeoReal\fP just an eoVector
+.IP "\(bu" 2
+\fBeoEsSimple\fP + one self-adapting single sigma for all variables
+.IP "\(bu" 2
+\fBeoEsStdev\fP a whole std::vector of self-adapting sigmas
+.IP "\(bu" 2
+\fBeoEsFull\fP a full self-adapting correlation matrix
+.PP
+.PP
+\fBSee also:\fP
+.RS 4
+\fBeoReal\fP \fBeoEsSimple\fP \fBeoEsStdev\fP \fBeoEsFull\fP \fBeoInit\fP 
+.RE
+.PP
+
+.PP
+Definition at line 55 of file eoEsChromInit.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoEsChromInit\fP< \fBEOT\fP >::\fBeoEsChromInit\fP (\fBeoRealVectorBounds\fP & _bounds, double _sigma = \fC0.3\fP, bool _to_scale = \fCfalse\fP)\fC [inline]\fP"
+.PP
+Constructor. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_bounds\fP bounds for uniform initialization 
+.br
+\fI_sigma\fP initial value for the stddev 
+.br
+\fI_to_scale\fP wether sigma should be multiplied by the range of each variable added December 2004 - MS (together with the whole comment :-) 
+.RE
+.PP
+
+.PP
+Definition at line 71 of file eoEsChromInit.h.
+.PP
+References eoRealBaseVectorBounds::range(), eoRealInitBounded< EOT >::theBounds(), eoEsChromInit< EOT >::uniqueSigma, and eoEsChromInit< EOT >::vecSigma.
+.SS "template \fBeoEsChromInit\fP< \fBEOT\fP >::\fBeoEsChromInit\fP (\fBeoRealVectorBounds\fP & _bounds, std::vector< double > _vecSigma)\fC [inline]\fP"
+.PP
+Constructor. 
+.PP
+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
+.PP
+Specify individual initial sigmas for each variable.
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_bounds\fP bounds for uniform initialization 
+.br
+\fI_sigma\fP initial value for the stddev 
+.RE
+.PP
+
+.PP
+Definition at line 109 of file eoEsChromInit.h.
+.PP
+References eoEsChromInit< EOT >::uniqueSigma, and eoEsChromInit< EOT >::vecSigma.
+.SH "Member Function Documentation"
+.PP 
+.SS "template void \fBeoEsChromInit\fP< \fBEOT\fP >::create_self_adapt (\fBeoReal\fP< FitT > &)\fC [inline, private]\fP"
+.PP
+Create intializer. 
+.PP
+No adaptive mutation at all 
+.PP
+Definition at line 128 of file eoEsChromInit.h.
+.PP
+Referenced by eoEsChromInit< EOT >::operator()().
+.SS "template void \fBeoEsChromInit\fP< \fBEOT\fP >::create_self_adapt (\fBeoEsSimple\fP< FitT > & result)\fC [inline, private]\fP"
+.PP
+Create intializer. 
+.PP
+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
+.PP
+Adaptive mutation through a unique sigma 
+.PP
+Definition at line 139 of file eoEsChromInit.h.
+.PP
+References eoEsSimple< Fit >::stdev.
+.SS "template void \fBeoEsChromInit\fP< \fBEOT\fP >::create_self_adapt (\fBeoEsStdev\fP< FitT > & result)\fC [inline, private]\fP"
+.PP
+Create intializer. 
+.PP
+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
+.PP
+Adaptive mutation through a std::vector of sigmas
+.PP
+\fBTodo\fP
+.RS 4
+Should we scale sigmas to the corresponding object variable range? 
+.RE
+.PP
+
+.PP
+Definition at line 155 of file eoEsChromInit.h.
+.PP
+References eoEsStdev< Fit >::stdevs.
+.SS "template void \fBeoEsChromInit\fP< \fBEOT\fP >::create_self_adapt (\fBeoEsFull\fP< FitT > & result)\fC [inline, private]\fP"
+.PP
+Create intializer. 
+.PP
+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
+.PP
+Adaptive mutation through a whole correlation matrix 
+.PP
+Definition at line 169 of file eoEsChromInit.h.
+.PP
+References eoEsFull< Fit >::correlations, eoEsFull< Fit >::stdevs, and eoRng::uniform().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoEsFull.3 b/trunk/paradiseo-eo/doc/man/man3/eoEsFull.3
new file mode 100644
index 000000000..3a5229692
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoEsFull.3
@@ -0,0 +1,76 @@
+.TH "eoEsFull" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoEsFull \- The most complex evolutionary strategy representation.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoVector< Fit, double >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef double \fBType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.RI "\fIReturn the class id. \fP"
+.ti -1c
+.RI "void \fBprintOn\fP (std::ostream &os) const "
+.br
+.RI "\fIprinting... \fP"
+.ti -1c
+.RI "void \fBreadFrom\fP (std::istream &is)"
+.br
+.RI "\fIreading... \fP"
+.in -1c
+.SS "Public Attributes"
+
+.in +1c
+.ti -1c
+.RI "std::vector< double > \fBstdevs\fP"
+.br
+.ti -1c
+.RI "std::vector< double > \fBcorrelations\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoEsFull< Fit >"
+The most complex evolutionary strategy representation. 
+
+Co-evolving mutation rates and correlated mutations. 
+.PP
+Definition at line 40 of file eoEsFull.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template virtual std::string \fBeoEsFull\fP< Fit >::className (void) const\fC [inline, virtual]\fP"
+.PP
+Return the class id. 
+.PP
+\fBReturns:\fP
+.RS 4
+the class name as a std::string 
+.RE
+.PP
+
+.PP
+Reimplemented from \fBEO< Fit >\fP.
+.PP
+Definition at line 51 of file eoEsFull.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoEsGlobalXover.3 b/trunk/paradiseo-eo/doc/man/man3/eoEsGlobalXover.3
new file mode 100644
index 000000000..c6191a9f1
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoEsGlobalXover.3
@@ -0,0 +1,130 @@
+.TH "eoEsGlobalXover" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoEsGlobalXover \- Gloabl crossover operator for ES genotypes.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoGenOp< EOT >< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::Fitness \fBFitT\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoEsGlobalXover\fP (\fBeoBinOp\fP< double > &_crossObj, \fBeoBinOp\fP< double > &_crossMut)"
+.br
+.RI "\fI(Default) Constructor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIThe class name. Used to display statistics. \fP"
+.ti -1c
+.RI "unsigned \fBmax_production\fP (void)"
+.br
+.RI "\fIThe TOTAL number of offspring (here = nb of parents modified in place). \fP"
+.ti -1c
+.RI "void \fBapply\fP (\fBeoPopulator\fP< \fBEOT\fP > &_plop)"
+.br
+.RI "\fImodifies one parents in the populator using 2 new parents for each component! \fP"
+.in -1c
+.SS "Private Member Functions"
+
+.in +1c
+.ti -1c
+.RI "void \fBcross_self_adapt\fP (\fBeoEsSimple\fP< FitT > &_parent, const \fBeoPop\fP< \fBeoEsSimple\fP< FitT > > &_pop)"
+.br
+.RI "\fIMethod for cross self-adaptation parameters. \fP"
+.ti -1c
+.RI "void \fBcross_self_adapt\fP (\fBeoEsStdev\fP< FitT > &_parent, const \fBeoPop\fP< \fBeoEsStdev\fP< FitT > > &_pop)"
+.br
+.RI "\fIMethod for cross self-adaptation parameters. \fP"
+.ti -1c
+.RI "void \fBcross_self_adapt\fP (\fBeoEsFull\fP< FitT > &_parent, const \fBeoPop\fP< \fBeoEsFull\fP< FitT > > &_pop)"
+.br
+.RI "\fIMethod for cross self-adaptation parameters. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoRandomSelect\fP< \fBEOT\fP > \fBsel\fP"
+.br
+.ti -1c
+.RI "\fBeoBinOp\fP< double > & \fBcrossObj\fP"
+.br
+.ti -1c
+.RI "\fBeoBinOp\fP< double > & \fBcrossMut\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoEsGlobalXover< EOT >"
+Gloabl crossover operator for ES genotypes. 
+
+Uses some Atom crossovers to handle both the object variables and the mutation strategy parameters 
+.PP
+Definition at line 44 of file eoEsGlobalXover.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template void \fBeoEsGlobalXover\fP< \fBEOT\fP >::apply (\fBeoPopulator\fP< \fBEOT\fP > & _plop)\fC [inline, virtual]\fP"
+.PP
+modifies one parents in the populator using 2 new parents for each component! 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_pop\fP a POPULATOR (not a simple population) 
+.RE
+.PP
+
+.PP
+Implements \fBeoGenOp< EOT >\fP.
+.PP
+Definition at line 67 of file eoEsGlobalXover.h.
+.PP
+References eoEsGlobalXover< EOT >::cross_self_adapt(), EO< F >::invalidate(), and eoPopulator< EOT >::source().
+.SS "template void \fBeoEsGlobalXover\fP< \fBEOT\fP >::cross_self_adapt (\fBeoEsSimple\fP< FitT > & _parent, const \fBeoPop\fP< \fBeoEsSimple\fP< FitT > > & _pop)\fC [inline, private]\fP"
+.PP
+Method for cross self-adaptation parameters. 
+.PP
+Specialization for \fBeoEsSimple\fP. 
+.PP
+Definition at line 94 of file eoEsGlobalXover.h.
+.PP
+References eoEsSimple< Fit >::stdev.
+.PP
+Referenced by eoEsGlobalXover< EOT >::apply().
+.SS "template void \fBeoEsGlobalXover\fP< \fBEOT\fP >::cross_self_adapt (\fBeoEsStdev\fP< FitT > & _parent, const \fBeoPop\fP< \fBeoEsStdev\fP< FitT > > & _pop)\fC [inline, private]\fP"
+.PP
+Method for cross self-adaptation parameters. 
+.PP
+Specialization for \fBeoEsStdev\fP. 
+.PP
+Definition at line 106 of file eoEsGlobalXover.h.
+.PP
+References eoEsStdev< Fit >::stdevs.
+.SS "template void \fBeoEsGlobalXover\fP< \fBEOT\fP >::cross_self_adapt (\fBeoEsFull\fP< FitT > & _parent, const \fBeoPop\fP< \fBeoEsFull\fP< FitT > > & _pop)\fC [inline, private]\fP"
+.PP
+Method for cross self-adaptation parameters. 
+.PP
+Specialization for \fBeoEsFull\fP. 
+.PP
+Definition at line 121 of file eoEsGlobalXover.h.
+.PP
+References eoEsFull< Fit >::correlations, and eoEsFull< Fit >::stdevs.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoEsMutate.3 b/trunk/paradiseo-eo/doc/man/man3/eoEsMutate.3
new file mode 100644
index 000000000..37115c8c3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoEsMutate.3
@@ -0,0 +1,254 @@
+.TH "eoEsMutate" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoEsMutate \- ES-style mutation in the large.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::Fitness \fBFitT\fP"
+.br
+.RI "\fIFitness-type. \fP"
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoEsMutate\fP (\fBeoEsMutationInit\fP &_init, \fBeoRealVectorBounds\fP &_bounds)"
+.br
+.RI "\fIInitialization. \fP"
+.ti -1c
+.RI "virtual \fB~eoEsMutate\fP ()"
+.br
+.RI "\fIVirtual Destructor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIClassname. \fP"
+.ti -1c
+.RI "virtual bool \fBoperator()\fP (\fBeoEsSimple\fP< \fBFitT\fP > &_eo)"
+.br
+.RI "\fIMutate \fBeoEsSimple\fP. \fP"
+.ti -1c
+.RI "virtual bool \fBoperator()\fP (\fBeoEsStdev\fP< \fBFitT\fP > &_eo)"
+.br
+.RI "\fIStandard mutation in ES. \fP"
+.ti -1c
+.RI "virtual bool \fBoperator()\fP (\fBeoEsFull\fP< \fBFitT\fP > &_eo)"
+.br
+.RI "\fICorrelated mutations in ES. \fP"
+.in -1c
+.SS "Private Member Functions"
+
+.in +1c
+.ti -1c
+.RI "void \fBinit\fP (\fBeoEsSimple\fP< \fBFitT\fP >, \fBeoEsMutationInit\fP &_init)"
+.br
+.RI "\fIInitialization of simple ES. \fP"
+.ti -1c
+.RI "void \fBinit\fP (\fBeoEsStdev\fP< \fBFitT\fP >, \fBeoEsMutationInit\fP &_init)"
+.br
+.RI "\fIInitialization of standard ES. \fP"
+.ti -1c
+.RI "void \fBinit\fP (\fBeoEsFull\fP< \fBFitT\fP >, \fBeoEsMutationInit\fP &_init)"
+.br
+.RI "\fIInitialization of full ES. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBTauLcl\fP"
+.br
+.RI "\fILocal factor for mutation of std deviations. \fP"
+.ti -1c
+.RI "double \fBTauGlb\fP"
+.br
+.RI "\fIGlobal factor for mutation of std deviations. \fP"
+.ti -1c
+.RI "double \fBTauBeta\fP"
+.br
+.RI "\fIFactor for mutation of correlation parameters. \fP"
+.ti -1c
+.RI "\fBeoRealVectorBounds\fP & \fBbounds\fP"
+.br
+.RI "\fIBounds of parameters. \fP"
+.in -1c
+.SS "Static Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "const double \fBstdev_eps\fP = 1.0e-40"
+.br
+.RI "\fIMinimum stdev. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoEsMutate< EOT >"
+ES-style mutation in the large. 
+
+Obviously, valid only for eoES*. It is currently valid for three types of ES chromosomes:
+.IP "\(bu" 2
+\fBeoEsSimple\fP: Exactly one stdandard-deviation
+.IP "\(bu" 2
+\fBeoEsStdev\fP: As many standard deviations as object variables
+.IP "\(bu" 2
+\fBeoEsFull\fP: The whole guacemole: correlations, stdevs and object variables
+.PP
+.PP
+Each of these three variant has it's own operator() in eoEsMutate and intialization is also split into three cases (that share some commonalities) 
+.PP
+Definition at line 60 of file eoEsMutate.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoEsMutate\fP< \fBEOT\fP >::\fBeoEsMutate\fP (\fBeoEsMutationInit\fP & _init, \fBeoRealVectorBounds\fP & _bounds)\fC [inline]\fP"
+.PP
+Initialization. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_init\fP Proxy class for initializating the three parameters eoEsMutate needs 
+.br
+\fI_bounds\fP Bounds for the objective variables 
+.RE
+.PP
+
+.PP
+Definition at line 74 of file eoEsMutate.h.
+.PP
+References eoEsMutate< EOT >::bounds, and eoEsMutate< EOT >::init().
+.SH "Member Function Documentation"
+.PP 
+.SS "template virtual std::string \fBeoEsMutate\fP< \fBEOT\fP >::className (void) const\fC [inline, virtual]\fP"
+.PP
+Classname. 
+.PP
+Inherited from \fBeoObject\fP 
+.PP
+\fBSee also:\fP
+.RS 4
+\fBeoObject\fP
+.RE
+.PP
+\fBReturns:\fP
+.RS 4
+Name of class. 
+.RE
+.PP
+
+.PP
+Reimplemented from \fBeoMonOp< EOT >\fP.
+.PP
+Definition at line 90 of file eoEsMutate.h.
+.SS "template virtual bool \fBeoEsMutate\fP< \fBEOT\fP >::operator() (\fBeoEsSimple\fP< \fBFitT\fP > & _eo)\fC [inline, virtual]\fP"
+.PP
+Mutate \fBeoEsSimple\fP. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_eo\fP Individual to mutate. 
+.RE
+.PP
+
+.PP
+Definition at line 97 of file eoEsMutate.h.
+.PP
+References eoEsMutate< EOT >::bounds, eoRealBaseVectorBounds::foldsInBounds(), eoRng::normal(), eoEsSimple< Fit >::stdev, and eoEsMutate< EOT >::TauLcl.
+.SS "template virtual bool \fBeoEsMutate\fP< \fBEOT\fP >::operator() (\fBeoEsStdev\fP< \fBFitT\fP > & _eo)\fC [inline, virtual]\fP"
+.PP
+Standard mutation in ES. 
+.PP
+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
+.PP
+Standard mutation of object variables and standard deviations in ESs.
+.PP
+If there are fewer different standard deviations available than the dimension of the objective function requires, the last standard deviation is responsible for ALL remaining object variables.
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_eo\fP Individual to mutate.
+.RE
+.PP
+\fBSee also:\fP
+.RS 4
+Schwefel 1977: Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie, pp. 165 ff. 
+.RE
+.PP
+
+.PP
+Definition at line 128 of file eoEsMutate.h.
+.PP
+References eoEsMutate< EOT >::bounds, eoRealBaseVectorBounds::foldsInBounds(), eoRng::normal(), eoEsStdev< Fit >::stdevs, eoEsMutate< EOT >::TauGlb, and eoEsMutate< EOT >::TauLcl.
+.SS "template virtual bool \fBeoEsMutate\fP< \fBEOT\fP >::operator() (\fBeoEsFull\fP< \fBFitT\fP > & _eo)\fC [inline, virtual]\fP"
+.PP
+Correlated mutations in ES. 
+.PP
+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
+.PP
+Mutation of object variables, standard deviations, and their correlations in ESs.
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_eo\fP Individual to mutate.
+.RE
+.PP
+\fBSee also:\fP
+.RS 4
+.IP "\(bu" 2
+H.-P. Schwefel: Internal Report of KFA Juelich, KFA-STE-IB-3/80, p. 43, 1980.
+.IP "\(bu" 2
+G. Rudolph: Globale Optimierung mit parallelen Evolutionsstrategien, Diploma Thesis, University of Dortmund, 1990. 
+.PP
+.RE
+.PP
+
+.PP
+Definition at line 159 of file eoEsMutate.h.
+.PP
+References eoEsMutate< EOT >::bounds, eoEsFull< Fit >::correlations, eoRealBaseVectorBounds::foldsInBounds(), eoRng::normal(), eoEsFull< Fit >::stdevs, eoEsMutate< EOT >::TauBeta, eoEsMutate< EOT >::TauGlb, and eoEsMutate< EOT >::TauLcl.
+.SS "template void \fBeoEsMutate\fP< \fBEOT\fP >::init (\fBeoEsStdev\fP< \fBFitT\fP >, \fBeoEsMutationInit\fP & _init)\fC [inline, private]\fP"
+.PP
+Initialization of standard ES. 
+.PP
+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 
+.PP
+Definition at line 228 of file eoEsMutate.h.
+.PP
+References eoEsMutate< EOT >::bounds, eoEsMutationInit::TauGlb(), eoEsMutate< EOT >::TauGlb, eoEsMutationInit::TauLcl(), and eoEsMutate< EOT >::TauLcl.
+.SS "template void \fBeoEsMutate\fP< \fBEOT\fP >::init (\fBeoEsFull\fP< \fBFitT\fP >, \fBeoEsMutationInit\fP & _init)\fC [inline, private]\fP"
+.PP
+Initialization of full ES. 
+.PP
+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 
+.PP
+Definition at line 244 of file eoEsMutate.h.
+.PP
+References eoEsMutate< EOT >::init(), eoEsMutationInit::TauBeta(), eoEsMutate< EOT >::TauBeta, eoEsMutate< EOT >::TauGlb, and eoEsMutate< EOT >::TauLcl.
+.SH "Member Data Documentation"
+.PP 
+.SS "template const double \fBeoEsMutate\fP< \fBEOT\fP >::\fBstdev_eps\fP = 1.0e-40\fC [static, private]\fP"
+.PP
+Minimum stdev. 
+.PP
+If you let the step-size go to 0, self-adaptation stops, therefore we give a lower bound. The actual value used is somewhat arbitrary and the is no theoretical reasoning known for it (Sep 2005).
+.PP
+The code that we have in \fBEO\fP is a port from a C code that Thomas Bäck kindly donated to the community some years ago. It has been modified by Marc Schoenauer for inclusion in EvolC, than by Maarten Keijzer into \fBEO\fP. The exact value was adjusted based on practice.
+.PP
+Removing this doesn't work well, but it was never tried to figure out what the best value would be. 
+.PP
+Definition at line 284 of file eoEsMutate.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoEsMutationInit.3 b/trunk/paradiseo-eo/doc/man/man3/eoEsMutationInit.3
new file mode 100644
index 000000000..78db90858
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoEsMutationInit.3
@@ -0,0 +1,116 @@
+.TH "eoEsMutationInit" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoEsMutationInit \- Initialize Mutation operator.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoEsMutationInit\fP (\fBeoParser\fP &_parser, std::string _section='ES mutation parameters')"
+.br
+.RI "\fIConstructor. \fP"
+.ti -1c
+.RI "virtual \fB~eoEsMutationInit\fP ()"
+.br
+.RI "\fIVirtual destructor. \fP"
+.ti -1c
+.RI "double \fBTauLcl\fP (void)"
+.br
+.RI "\fIlocal  \fP"
+.ti -1c
+.RI "double \fBTauGlb\fP (void)"
+.br
+.RI "\fIglobal tau \fP"
+.ti -1c
+.RI "double \fBTauBeta\fP (void)"
+.br
+.RI "\fIcorrelation's tau \fP"
+.in -1c
+.SS "Protected Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual std::string \fBsection\fP (void)"
+.br
+.ti -1c
+.RI "virtual std::string \fBTauLclName\fP (void) const "
+.br
+.ti -1c
+.RI "virtual char \fBTauLclShort\fP (void) const "
+.br
+.ti -1c
+.RI "virtual std::string \fBTauGlbName\fP (void) const "
+.br
+.ti -1c
+.RI "virtual char \fBTauGlbShort\fP (void) const "
+.br
+.ti -1c
+.RI "virtual std::string \fBTauBetaName\fP (void) const "
+.br
+.ti -1c
+.RI "virtual char \fBTauBetaShort\fP (void) const "
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoParser\fP & \fBparser\fP"
+.br
+.ti -1c
+.RI "std::string \fBrepSection\fP"
+.br
+.ti -1c
+.RI "\fBeoValueParam\fP< double > * \fBTauLclParam\fP"
+.br
+.ti -1c
+.RI "\fBeoValueParam\fP< double > * \fBTauGlbParam\fP"
+.br
+.ti -1c
+.RI "\fBeoValueParam\fP< double > * \fBTauBetaParam\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+Initialize Mutation operator. 
+
+Proxy class that is used for initializing the mutation operator. It provides an interface between \fBeoEsMutate\fP and the abstract parameterLoader. It also provides the names for the parameters in this class as virtual protected member functions.
+.PP
+If you have more than a single ES in a project that need different names in the configuration files, you might consider overriding this class to change the names.
+.PP
+\fBSee also:\fP
+.RS 4
+\fBeoEsMutate\fP 
+.RE
+.PP
+
+.PP
+Definition at line 47 of file eoEsMutationInit.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "eoEsMutationInit::eoEsMutationInit (\fBeoParser\fP & _parser, std::string _section = \fC'ES mutation parameters'\fP)\fC [inline]\fP"
+.PP
+Constructor. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_parser\fP Parser to read parameters from. 
+.br
+\fI_section\fP Parser section for -parameters. 
+.RE
+.PP
+
+.PP
+Definition at line 56 of file eoEsMutationInit.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoEsSimple.3 b/trunk/paradiseo-eo/doc/man/man3/eoEsSimple.3
new file mode 100644
index 000000000..1ef67d55e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoEsSimple.3
@@ -0,0 +1,80 @@
+.TH "eoEsSimple" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoEsSimple \- Simple Evolution Strategy.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoVector< Fit, double >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef double \fBType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIReturn the class id. \fP"
+.ti -1c
+.RI "void \fBprintOn\fP (std::ostream &os) const "
+.br
+.RI "\fIprinting... \fP"
+.ti -1c
+.RI "void \fBreadFrom\fP (std::istream &is)"
+.br
+.RI "\fIreading... \fP"
+.in -1c
+.SS "Public Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBstdev\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoEsSimple< Fit >"
+Simple Evolution Strategy. 
+
+One of the more simple evolution strategies, sporting just a single stdeviation for the entire chromosome. For more advanced versions see also \fBeoEsStdev\fP \fBeoEsFull\fP
+.PP
+\fBSee also:\fP
+.RS 4
+\fBeoEsStdev\fP \fBeoEsFull\fP 
+.RE
+.PP
+
+.PP
+Definition at line 42 of file eoEsSimple.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template virtual std::string \fBeoEsSimple\fP< Fit >::className (void) const\fC [inline, virtual]\fP"
+.PP
+Return the class id. 
+.PP
+\fBReturns:\fP
+.RS 4
+the class name as a std::string 
+.RE
+.PP
+
+.PP
+Reimplemented from \fBEO< Fit >\fP.
+.PP
+Definition at line 50 of file eoEsSimple.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoEsStandardXover.3 b/trunk/paradiseo-eo/doc/man/man3/eoEsStandardXover.3
new file mode 100644
index 000000000..e2ea45d49
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoEsStandardXover.3
@@ -0,0 +1,76 @@
+.TH "eoEsStandardXover" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoEsStandardXover \- Standard (i.e.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoBinOp< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::Fitness \fBFitT\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoEsStandardXover\fP (\fBeoBinOp\fP< double > &_crossObj, \fBeoBinOp\fP< double > &_crossMut)"
+.br
+.RI "\fI(Default) Constructor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIThe class name. Used to display statistics. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eo1, const \fBEOT\fP &_eo2)"
+.br
+.RI "\fImodifies one parents in the populator using a second parent \fP"
+.in -1c
+.SS "Private Member Functions"
+
+.in +1c
+.ti -1c
+.RI "bool \fBcross_self_adapt\fP (\fBeoEsSimple\fP< FitT > &_parent1, const \fBeoEsSimple\fP< FitT > &_parent2)"
+.br
+.ti -1c
+.RI "bool \fBcross_self_adapt\fP (\fBeoEsStdev\fP< FitT > &_parent1, const \fBeoEsStdev\fP< FitT > &_parent2)"
+.br
+.ti -1c
+.RI "bool \fBcross_self_adapt\fP (\fBeoEsFull\fP< FitT > &_parent1, const \fBeoEsFull\fP< FitT > &_parent2)"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoRandomSelect\fP< \fBEOT\fP > \fBsel\fP"
+.br
+.ti -1c
+.RI "\fBeoBinOp\fP< double > & \fBcrossObj\fP"
+.br
+.ti -1c
+.RI "\fBeoBinOp\fP< double > & \fBcrossMut\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoEsStandardXover< EOT >"
+Standard (i.e. 
+
+\fBeoBinOp\fP) crossover operator for ES genotypes. Uses some Atom crossovers to handle both the object variables and the mutation strategy parameters It is an \fBeoBinOp\fP and has to be wrapped into an \fBeoGenOp\fP before being used like the global version 
+.PP
+Definition at line 46 of file eoEsStandardXover.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoEsStdev.3 b/trunk/paradiseo-eo/doc/man/man3/eoEsStdev.3
new file mode 100644
index 000000000..749643395
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoEsStdev.3
@@ -0,0 +1,73 @@
+.TH "eoEsStdev" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoEsStdev \- Evolutionary Strategy with a standard deviation per parameter.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoVector< Fit, double >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef double \fBType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.RI "\fIReturn the class id. \fP"
+.ti -1c
+.RI "void \fBprintOn\fP (std::ostream &os) const "
+.br
+.RI "\fIprinting... \fP"
+.ti -1c
+.RI "void \fBreadFrom\fP (std::istream &is)"
+.br
+.RI "\fIreading... \fP"
+.in -1c
+.SS "Public Attributes"
+
+.in +1c
+.ti -1c
+.RI "std::vector< double > \fBstdevs\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoEsStdev< Fit >"
+Evolutionary Strategy with a standard deviation per parameter. 
+
+Evolutionary strategie style representation, supporting co-evolving standard deviations. 
+.PP
+Definition at line 37 of file eoEsStdev.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template virtual std::string \fBeoEsStdev\fP< Fit >::className (void) const\fC [inline, virtual]\fP"
+.PP
+Return the class id. 
+.PP
+\fBReturns:\fP
+.RS 4
+the class name as a std::string 
+.RE
+.PP
+
+.PP
+Reimplemented from \fBEO< Fit >\fP.
+.PP
+Definition at line 47 of file eoEsStdev.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoEvalContinue.3 b/trunk/paradiseo-eo/doc/man/man3/eoEvalContinue.3
new file mode 100644
index 000000000..2f7143412
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoEvalContinue.3
@@ -0,0 +1,54 @@
+.TH "eoEvalContinue" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoEvalContinue \- Continues until a number of evaluations has been made.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoContinue< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoEvalContinue\fP (\fBeoEvalFuncCounter\fP< \fBEOT\fP > &_eval, unsigned long _totalEval)"
+.br
+.RI "\fICtor. \fP"
+.ti -1c
+.RI "virtual bool \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_vEO)"
+.br
+.RI "\fIReturns false when a certain number of evaluations has been done. \fP"
+.ti -1c
+.RI "virtual unsigned long \fBtotalEvaluations\fP ()"
+.br
+.RI "\fIReturns the number of generations to reach. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoEvalFuncCounter\fP< \fBEOT\fP > & \fBeval\fP"
+.br
+.ti -1c
+.RI "unsigned long \fBrepTotalEvaluations\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoEvalContinue< EOT >"
+Continues until a number of evaluations has been made. 
+.PP
+Definition at line 36 of file eoEvalContinue.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoEvalFunc.3 b/trunk/paradiseo-eo/doc/man/man3/eoEvalFunc.3
new file mode 100644
index 000000000..6dfff8f7c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoEvalFunc.3
@@ -0,0 +1,41 @@
+.TH "eoEvalFunc" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoEvalFunc \- Evaluate: takes one \fBEO\fP and sets its 'fitness' property returning this fitness also.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoUF< EOT &, void >\fP.
+.PP
+Inherited by eoAssembledEvalFunc< EOT >, eoEasyEA< EOT >::eoDummyEval, \fBeoEvalFuncCounter< EOT >\fP, \fBeoEvalFuncPtr< EOT, FitT, FunctionArg >\fP, eoMyEval< EOT >, \fBeoOneMaxEvalFunc< EOT >\fP, and RoyalRoad< EOT >.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef \fBEOT\fP \fBEOType\fP"
+.br
+.ti -1c
+.RI "typedef EOT::Fitness \fBEOFitT\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoEvalFunc< EOT >"
+Evaluate: takes one \fBEO\fP and sets its 'fitness' property returning this fitness also. 
+
+That is why EOT is passed by non-const reference: it must be altered within evaluate.\\
+.PP
+The requirements on the types with which this class is to be instantiated with are null, or else, they depend on the particular class it's going to be applied to; \fBEO\fP does not impose any requirement on it. If you subclass this abstract class, and use it to evaluate an \fBEO\fP, the requirements on this \fBEO\fP will depend on the evaluator. 
+.PP
+Definition at line 41 of file eoEvalFunc.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoEvalFuncCounter.3 b/trunk/paradiseo-eo/doc/man/man3/eoEvalFuncCounter.3
new file mode 100644
index 000000000..fd5da2a30
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoEvalFuncCounter.3
@@ -0,0 +1,45 @@
+.TH "eoEvalFuncCounter" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoEvalFuncCounter \- Counts the number of evaluations actually performed, thus checks first if it has to evaluate..  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoEvalFunc< EOT >< EOT >\fP, and \fBeoValueParam< unsigned long >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoEvalFuncCounter\fP (\fBeoEvalFunc\fP< \fBEOT\fP > &_func, std::string _name='Eval. ')"
+.br
+.ti -1c
+.RI "virtual void \fBoperator()\fP (\fBEOT\fP &_eo)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoEvalFunc\fP< \fBEOT\fP > & \fBfunc\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoEvalFuncCounter< EOT >"
+Counts the number of evaluations actually performed, thus checks first if it has to evaluate.. 
+
+etc. 
+.PP
+Definition at line 37 of file eoEvalFuncCounter.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoEvalFuncPtr.3 b/trunk/paradiseo-eo/doc/man/man3/eoEvalFuncPtr.3
new file mode 100644
index 000000000..87546b498
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoEvalFuncPtr.3
@@ -0,0 +1,67 @@
+.TH "eoEvalFuncPtr" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoEvalFuncPtr \- EOEvalFuncPtr: This class takes an existing function pointer and converts it into a evaluation function class.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoEvalFunc< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoEvalFuncPtr\fP (\fBFitT\fP(*_eval)(FunctionArg))"
+.br
+.RI "\fIApplies the function to the chromosome and sets the fitness of the Chrom. \fP"
+.ti -1c
+.RI "virtual void \fBoperator()\fP (\fBEOT\fP &_eo)"
+.br
+.RI "\fIEffectively applies the evaluation function to an \fBEO\fP. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBFitT\fP(* \fBevalFunc\fP )(FunctionArg)"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template struct eoEvalFuncPtr< EOT, FitT, FunctionArg >"
+EOEvalFuncPtr: This class takes an existing function pointer and converts it into a evaluation function class. 
+
+That way, old style C or C++ functions can be adapted to \fBEO\fP function classes. 
+.PP
+Definition at line 43 of file eoEvalFuncPtr.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoEvalFuncPtr\fP< \fBEOT\fP, \fBFitT\fP, FunctionArg >::\fBeoEvalFuncPtr\fP (\fBFitT\fP(*)(FunctionArg) _eval)\fC [inline]\fP"
+.PP
+Applies the function to the chromosome and sets the fitness of the Chrom. 
+.PP
+Thus, the evaluation function need not be worried about that. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_eval\fP pointer to the evaluation function, takes a EOT as an argument and returns the fitness 
+.RE
+.PP
+\fBReturns:\fP
+.RS 4
+the evaluated fitness for that object. 
+.RE
+.PP
+
+.PP
+Definition at line 51 of file eoEvalFuncPtr.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoExpansionMutation.3 b/trunk/paradiseo-eo/doc/man/man3/eoExpansionMutation.3
new file mode 100644
index 000000000..838089c43
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoExpansionMutation.3
@@ -0,0 +1,94 @@
+.TH "eoExpansionMutation" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoExpansionMutation \- eoExpansionMutation --> replace a terminal with a randomly created subtree  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< eoParseTree< FType, Node > >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef \fBeoParseTree\fP< FType, Node > \fBEoType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoExpansionMutation\fP (\fBeoInit\fP< \fBEoType\fP > &_init, unsigned _max_length)"
+.br
+.RI "\fIConstructor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIThe class name. \fP"
+.ti -1c
+.RI "virtual \fB~eoExpansionMutation\fP ()"
+.br
+.RI "\fIDtor. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEoType\fP &_eo1)"
+.br
+.RI "\fIMutate an individual. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBmax_length\fP"
+.br
+.ti -1c
+.RI "\fBeoInit\fP< \fBEoType\fP > & \fBinitializer\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoExpansionMutation< FType, Node >"
+eoExpansionMutation --> replace a terminal with a randomly created subtree 
+.PP
+Definition at line 204 of file eoParseTreeOp.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoExpansionMutation\fP< FType, Node >::\fBeoExpansionMutation\fP (\fBeoInit\fP< \fBEoType\fP > & _init, unsigned _max_length)\fC [inline]\fP"
+.PP
+Constructor. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_init\fP An instantiation of eoGpDepthInitializer 
+.br
+\fI_max_length\fP the maximum size of an individual 
+.RE
+.PP
+
+.PP
+Definition at line 215 of file eoParseTreeOp.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template bool \fBeoExpansionMutation\fP< FType, Node >::operator() (\fBEoType\fP & _eo1)\fC [inline]\fP"
+.PP
+Mutate an individual. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_eo1\fP The individual that is to be changed 
+.RE
+.PP
+
+.PP
+Definition at line 228 of file eoParseTreeOp.h.
+.PP
+References eoParseTree< FType, Node >::pruneTree(), and eoRng::random().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoExternalBinOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoExternalBinOp.3
new file mode 100644
index 000000000..2f98466b2
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoExternalBinOp.3
@@ -0,0 +1,47 @@
+.TH "eoExternalBinOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoExternalBinOp \- Crossover of external struct, ctor expects a function of the following signature:.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoBinOp< ExternalEO >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoExternalBinOp\fP (bool(*_binop)(External &, const External &))"
+.br
+.ti -1c
+.RI "bool \fBoperator()\fP (ExternalEO &eo1, const ExternalEO &eo2)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "bool(* \fBbinop\fP )(External &, const External &)"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template> class eoExternalBinOp< F, External, ExternalEO >"
+Crossover of external struct, ctor expects a function of the following signature:. 
+
+bool func(External&, const External&);
+.PP
+Where External is the user defined struct or class The function should return true when it changed something, false otherwise 
+.PP
+Definition at line 128 of file eoExternalOpFunctions.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoExternalEO.3 b/trunk/paradiseo-eo/doc/man/man3/eoExternalEO.3
new file mode 100644
index 000000000..5811cf100
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoExternalEO.3
@@ -0,0 +1,66 @@
+.TH "eoExternalEO" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoExternalEO \- Definition of an object that allows an external struct to be inserted in \fBEO\fP.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBEO< Fit >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoExternalEO\fP (const External &ext)"
+.br
+.RI "\fIInit externalEo with the struct itself and set fitness to zero. \fP"
+.ti -1c
+.RI "\fBeoExternalEO\fP (std::istream &is, const External &ext)"
+.br
+.ti -1c
+.RI "virtual void \fBreadFrom\fP (std::istream &_is)"
+.br
+.RI "\fIRead object, the external struct needs to have an operator>> defined. \fP"
+.ti -1c
+.RI "virtual void \fBprintOn\fP (std::ostream &_os) const "
+.br
+.RI "\fIWrite object. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoExternalEO< Fit, External >"
+Definition of an object that allows an external struct to be inserted in \fBEO\fP. 
+
+This struct or class can be of any form, the only thing this class does is attach a fitness value to it and makes it the appropriate type (derives it from \fBEO\fP). 
+.PP
+Definition at line 39 of file eoExternalEO.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template virtual void \fBeoExternalEO\fP< Fit, External >::printOn (std::ostream & _os) const\fC [inline, virtual]\fP"
+.PP
+Write object. 
+.PP
+Called printOn since it prints the object _on_ a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_os\fP A std::ostream. 
+.RE
+.PP
+
+.PP
+Reimplemented from \fBEO< Fit >\fP.
+.PP
+Definition at line 69 of file eoExternalEO.h.
+.PP
+References EO< F >::printOn().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoExternalEvalFunc.3 b/trunk/paradiseo-eo/doc/man/man3/eoExternalEvalFunc.3
new file mode 100644
index 000000000..21dc03989
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoExternalEvalFunc.3
@@ -0,0 +1,47 @@
+.TH "eoExternalEvalFunc" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoExternalEvalFunc \- Evaluation of external struct, ctor expects a function of the following signature:.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoEvalFunc< ExternalEO >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoExternalEvalFunc\fP (F(*_eval)(const External &))"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (ExternalEO &eo)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "F(* \fBeval\fP )(const External &)"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template> class eoExternalEvalFunc< F, External, ExternalEO >"
+Evaluation of external struct, ctor expects a function of the following signature:. 
+
+Fit func(External&);
+.PP
+Where External is the user defined struct or class and Fit the fitness type 
+.PP
+Definition at line 73 of file eoExternalOpFunctions.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoExternalInit.3 b/trunk/paradiseo-eo/doc/man/man3/eoExternalInit.3
new file mode 100644
index 000000000..188a6ef57
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoExternalInit.3
@@ -0,0 +1,47 @@
+.TH "eoExternalInit" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoExternalInit \- Initialization of external struct, ctor expects a function of the following signature:.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoInit< ExternalEO >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoExternalInit\fP (External(*_init)(void))"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (ExternalEO &_eo)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "External(* \fBinit\fP )(void)"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template> class eoExternalInit< F, External, ExternalEO >"
+Initialization of external struct, ctor expects a function of the following signature:. 
+
+External func();
+.PP
+Where External is the user defined struct or class 
+.PP
+Definition at line 45 of file eoExternalOpFunctions.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoExternalMonOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoExternalMonOp.3
new file mode 100644
index 000000000..12979f2c7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoExternalMonOp.3
@@ -0,0 +1,47 @@
+.TH "eoExternalMonOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoExternalMonOp \- Mutation of external struct, ctor expects a function of the following signature:.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< ExternalEO >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoExternalMonOp\fP (bool(*_mutate)(External &))"
+.br
+.ti -1c
+.RI "bool \fBoperator()\fP (ExternalEO &eo)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "bool(* \fBmutate\fP )(External &)"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template> class eoExternalMonOp< F, External, ExternalEO >"
+Mutation of external struct, ctor expects a function of the following signature:. 
+
+bool func(External&);
+.PP
+Where External is the user defined struct or class. The function should return true when it changed something, false otherwise 
+.PP
+Definition at line 102 of file eoExternalOpFunctions.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoExternalQuadOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoExternalQuadOp.3
new file mode 100644
index 000000000..46d4bc6e0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoExternalQuadOp.3
@@ -0,0 +1,47 @@
+.TH "eoExternalQuadOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoExternalQuadOp \- Crossover of external struct, ctor expects a function of the following signature:.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoQuadOp< ExternalEO >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoExternalQuadOp\fP (bool(*_quadop)(External &, External &))"
+.br
+.ti -1c
+.RI "bool \fBoperator()\fP (ExternalEO &eo1, ExternalEO &eo2)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "bool(* \fBquadop\fP )(External &, External &)"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template> class eoExternalQuadOp< F, External, ExternalEO >"
+Crossover of external struct, ctor expects a function of the following signature:. 
+
+bool func(External&, External&);
+.PP
+Where External is the user defined struct or class The function should return true when it changed something, false otherwise 
+.PP
+Definition at line 154 of file eoExternalOpFunctions.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoF.3 b/trunk/paradiseo-eo/doc/man/man3/eoF.3
new file mode 100644
index 000000000..d75551df8
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoF.3
@@ -0,0 +1,55 @@
+.TH "eoF" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoF \- Basic Function.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoFunctorBase\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef R \fBresult_type\fP"
+.br
+.RI "\fIthe return type - probably useless .... \fP"
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual \fB~eoF\fP ()"
+.br
+.RI "\fIvirtual dtor here so there is no need to define it in derived classes \fP"
+.ti -1c
+.RI "virtual R \fBoperator()\fP ()=0"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Static Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoFunctorBase::procedure_tag\fP \fBfunctor_category\fP ()"
+.br
+.RI "\fItag to identify a procedure in compile time function selection functor_category \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoF< R >"
+Basic Function. 
+
+Derive from this class when defining any procedure. It defines a result_type that can be used to determine the return type Argument and result types can be any type including void for result_type 
+.PP
+Definition at line 68 of file eoFunctor.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoFDCFileSnapshot.3 b/trunk/paradiseo-eo/doc/man/man3/eoFDCFileSnapshot.3
new file mode 100644
index 000000000..b00083966
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoFDCFileSnapshot.3
@@ -0,0 +1,55 @@
+.TH "eoFDCFileSnapshot" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoFDCFileSnapshot \- Specific class for FDCStat monitoring: As I failed to have FDC stat as an \fBeoStat\fP, this is the trick to put the 2 \fBeoParam\fP > into a monitor This class does nothing else.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoFileSnapshot\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoFDCFileSnapshot\fP (\fBeoFDCStat\fP< \fBEOT\fP > &_FDCstat, std::string _dirname='tmpFDC', unsigned _frequency=1, std::string _filename='FDC', std::string _delim=' ')"
+.br
+.RI "\fICtor: in addition to the parameters of the ctor of an \fBeoFileSnapshot\fP we need here an \fBeoFDCStat\fP. \fP"
+.ti -1c
+.RI "virtual void \fBadd\fP (const \fBeoParam\fP &_param)"
+.br
+.RI "\fIjust to be sure the add method is not called further \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoFDCStat\fP< \fBEOT\fP > & \fBFDCstat\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoFDCFileSnapshot< EOT >"
+Specific class for FDCStat monitoring: As I failed to have FDC stat as an \fBeoStat\fP, this is the trick to put the 2 \fBeoParam\fP > into a monitor This class does nothing else. 
+.PP
+Definition at line 111 of file eoFDCStat.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoFDCFileSnapshot\fP< \fBEOT\fP >::\fBeoFDCFileSnapshot\fP (\fBeoFDCStat\fP< \fBEOT\fP > & _FDCstat, std::string _dirname = \fC'tmpFDC'\fP, unsigned _frequency = \fC1\fP, std::string _filename = \fC'FDC'\fP, std::string _delim = \fC' '\fP)\fC [inline]\fP"
+.PP
+Ctor: in addition to the parameters of the ctor of an \fBeoFileSnapshot\fP we need here an \fBeoFDCStat\fP. 
+.PP
+The 2 std::vectors (distances to optimum and fitnesses) are added to the monitor so they can be processed later to a file - and eventually by gnuplot 
+.PP
+Definition at line 119 of file eoFDCStat.h.
+.PP
+References eoFileSnapshot::add().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoFDCStat.3 b/trunk/paradiseo-eo/doc/man/man3/eoFDCStat.3
new file mode 100644
index 000000000..bfef1b8e3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoFDCStat.3
@@ -0,0 +1,67 @@
+.TH "eoFDCStat" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoFDCStat \- The FDC computation - stores the values into eoValueParam so they can be snapshot by some eoGnuplotSnapshot ...  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoStat< EOT, double >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoFDCStat\fP (\fBeoDistance\fP< \fBEOT\fP > &_dist, std::string _description='FDC')"
+.br
+.RI "\fICtor without the optimum. \fP"
+.ti -1c
+.RI "\fBeoFDCStat\fP (\fBeoDistance\fP< \fBEOT\fP > &_dist, \fBEOT\fP &_theBest, std::string _description='FDC')"
+.br
+.RI "\fICtor with the optimum. \fP"
+.ti -1c
+.RI "virtual void \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fICompute the FDC - either from best in pop, or from absolute best if it was passed in the constructor. \fP"
+.ti -1c
+.RI "const \fBeoValueParam\fP< std::vector< double > > & \fBtheDist\fP ()"
+.br
+.RI "\fIaccessors to the private \fBeoValueParam\fP > \fP"
+.ti -1c
+.RI "const \fBeoValueParam\fP< std::vector< double > > & \fBtheFit\fP ()"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoDistance\fP< \fBEOT\fP > & \fBdist\fP"
+.br
+.ti -1c
+.RI "\fBEOT\fP \fBtheBest\fP"
+.br
+.ti -1c
+.RI "bool \fBboolOpt\fP"
+.br
+.ti -1c
+.RI "\fBeoValueParam\fP< std::vector< double > > \fBdistToBest\fP"
+.br
+.ti -1c
+.RI "\fBeoValueParam\fP< std::vector< double > > \fBfitnesses\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoFDCStat< EOT >"
+The FDC computation - stores the values into eoValueParam so they can be snapshot by some eoGnuplotSnapshot ... 
+.PP
+Definition at line 39 of file eoFDCStat.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoFactory.3 b/trunk/paradiseo-eo/doc/man/man3/eoFactory.3
new file mode 100644
index 000000000..1d88bf528
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoFactory.3
@@ -0,0 +1,74 @@
+.TH "eoFactory" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoFactory \- \fBEO\fP Factory.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoObject\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual EOClass * \fBmake\fP (std::istream &_is)=0"
+.br
+.RI "\fIAnother factory methods: creates an object from an std::istream, reading from it whatever is needed to create the object. \fP"
+.in -1c
+.PP
+.RI "\fBctors and dtors\fP"
+.br
+
+.in +1c
+.in +1c
+.ti -1c
+.RI "\fBeoFactory\fP ()"
+.br
+.RI "\fIconstructor \fP"
+.ti -1c
+.RI "virtual \fB~eoFactory\fP ()"
+.br
+.RI "\fIdestructor \fP"
+.in -1c
+.in -1c
+.PP
+.RI "\fBeoObject methods\fP"
+.br
+
+.in +1c
+.in +1c
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIReturn the class id. \fP"
+.in -1c
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoFactory< EOClass >"
+\fBEO\fP Factory. 
+
+A factory is used to create other objects. In particular, it can be used so that objects of that kind can´t be created in any other way. It should be instantiated with anything that needs a factory, like selectors or whatever; but the instance class should be the parent class from which all the object that are going to be created descend. This class basically defines an interface, as usual. The base factory class for each hierarchy should be redefined every time a new object is added to the hierarchy, which is not too good, but in any case, some code would have to be modified 
+.PP
+Definition at line 42 of file eoFactory.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template virtual EOClass* \fBeoFactory\fP< EOClass >::make (std::istream & _is)\fC [pure virtual]\fP"
+.PP
+Another factory methods: creates an object from an std::istream, reading from it whatever is needed to create the object. 
+.PP
+Usually, the format for the std::istream will be\\ objectType parameter1 parameter2 ... parametern\\
+.PP
+Implemented in \fBeoOpSelMason< eoClass >\fP, \fBeoSelectFactory< EOT >\fP, and \fBeoBitOpFactory< EOT >\fP.
+.PP
+Referenced by eoBitOpFactory< EOT >::make().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoFileMonitor.3 b/trunk/paradiseo-eo/doc/man/man3/eoFileMonitor.3
new file mode 100644
index 000000000..854ec5e5f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoFileMonitor.3
@@ -0,0 +1,76 @@
+.TH "eoFileMonitor" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoFileMonitor \- Prints statistics to file.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonitor\fP.
+.PP
+Inherited by \fBeoGnuplot1DMonitor\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoFileMonitor\fP (std::string _filename, std::string _delim=' ', bool _keep=false, bool _header=false)"
+.br
+.ti -1c
+.RI "virtual \fBeoMonitor\fP & \fBoperator()\fP (void)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.ti -1c
+.RI "virtual \fBeoMonitor\fP & \fBoperator()\fP (std::ostream &os)"
+.br
+.ti -1c
+.RI "void \fBprintHeader\fP (void)"
+.br
+.ti -1c
+.RI "virtual void \fBprintHeader\fP (std::ostream &os)"
+.br
+.ti -1c
+.RI "virtual std::string \fBgetFileName\fP ()"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "std::string \fBfilename\fP"
+.br
+.ti -1c
+.RI "std::string \fBdelim\fP"
+.br
+.ti -1c
+.RI "bool \fBkeep\fP"
+.br
+.ti -1c
+.RI "bool \fBheader\fP"
+.br
+.ti -1c
+.RI "bool \fBfirstcall\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+Prints statistics to file. 
+
+Modified the default behavior, so that it erases existing files. Can be modified in the ctor.
+.PP
+\fBVersion:\fP
+.RS 4
+MS 25/11/00 
+.RE
+.PP
+
+.PP
+Definition at line 44 of file eoFileMonitor.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoFileSnapshot.3 b/trunk/paradiseo-eo/doc/man/man3/eoFileSnapshot.3
new file mode 100644
index 000000000..e82de6b4d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoFileSnapshot.3
@@ -0,0 +1,109 @@
+.TH "eoFileSnapshot" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoFileSnapshot \- Prints snapshots of fitnesses to a (new) file every N generations.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonitor\fP.
+.PP
+Inherited by \fBeoFDCFileSnapshot< EOT >\fP, and \fBeoGnuplot1DSnapshot\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef std::vector< double > \fBvDouble\fP"
+.br
+.ti -1c
+.RI "typedef \fBeoValueParam\fP< std::vector< double > > \fBvDoubleParam\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoFileSnapshot\fP (std::string _dirname, unsigned _frequency=1, std::string _filename='gen', std::string _delim=' ', unsigned _counter=0, bool _rmFiles=true)"
+.br
+.ti -1c
+.RI "virtual bool \fBhasChanged\fP ()"
+.br
+.RI "\fIaccessor: has something changed (for gnuplot subclass) \fP"
+.ti -1c
+.RI "unsigned \fBgetCounter\fP ()"
+.br
+.RI "\fIaccessor to the counter: needed by the gnuplot subclass \fP"
+.ti -1c
+.RI "std::string \fBgetFileName\fP ()"
+.br
+.RI "\fIaccessor to the current filename: needed by the gnuplot subclass \fP"
+.ti -1c
+.RI "void \fBsetCurrentFileName\fP ()"
+.br
+.RI "\fIsets the current filename depending on the counter \fP"
+.ti -1c
+.RI "\fBeoMonitor\fP & \fBoperator()\fP (void)"
+.br
+.RI "\fIThe operator(void): opens the std::ostream and calls the write method. \fP"
+.ti -1c
+.RI "\fBeoMonitor\fP & \fBoperator()\fP (std::ostream &_os)"
+.br
+.RI "\fIThe operator(): write on an std::ostream. \fP"
+.ti -1c
+.RI "virtual const std::string \fBgetDirName\fP ()"
+.br
+.ti -1c
+.RI "virtual const std::string \fBbaseFileName\fP ()"
+.br
+.ti -1c
+.RI "void \fBadd\fP (const \fBeoParam\fP &_param)"
+.br
+.RI "\fIadd checks whether it is a std::vector of doubles \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "std::string \fBdirname\fP"
+.br
+.ti -1c
+.RI "unsigned \fBfrequency\fP"
+.br
+.ti -1c
+.RI "std::string \fBfilename\fP"
+.br
+.ti -1c
+.RI "std::string \fBdelim\fP"
+.br
+.ti -1c
+.RI "unsigned int \fBcounter\fP"
+.br
+.ti -1c
+.RI "std::string \fBcurrentFileName\fP"
+.br
+.ti -1c
+.RI "bool \fBboolChanged\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+Prints snapshots of fitnesses to a (new) file every N generations. 
+
+Assumes that the parameters that are passed to the monitor (method add in \fBeoMonitor.h\fP) are \fBeoValueParam\fP > of same size.
+.PP
+A dir is created and one file per snapshot is created there - so you can later generate a movie!
+.PP
+TODO: The counter is handled internally, but this should be changed so that you can pass e.g. an evalcounter (minor)
+.PP
+I failed to templatize everything so that it can handle \fBeoParam\fP > for any type T, simply calling their getValue method ... 
+.PP
+Definition at line 53 of file eoFileSnapshot.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoFitContinue.3 b/trunk/paradiseo-eo/doc/man/man3/eoFitContinue.3
new file mode 100644
index 000000000..bc2b82be1
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoFitContinue.3
@@ -0,0 +1,70 @@
+.TH "eoFitContinue" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoFitContinue \- Fitness continuation:.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoContinue< EOT >< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::Fitness \fBFitnessType\fP"
+.br
+.RI "\fIDefine Fitness. \fP"
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoFitContinue\fP (const \fBFitnessType\fP _maximum)"
+.br
+.RI "\fICtor. \fP"
+.ti -1c
+.RI "virtual bool \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIReturns false when a fitness criterium is reached. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBFitnessType\fP \fBmaximum\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoFitContinue< EOT >"
+Fitness continuation:. 
+
+Continues until the maximum fitness level is reached. 
+.PP
+Definition at line 36 of file eoFitContinue.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template virtual bool \fBeoFitContinue\fP< \fBEOT\fP >::operator() (const \fBeoPop\fP< \fBEOT\fP > & _pop)\fC [inline, virtual]\fP"
+.PP
+Returns false when a fitness criterium is reached. 
+.PP
+Assumes pop is not sorted! 
+.PP
+Implements \fBeoUF< const eoPop< EOT > &, bool >\fP.
+.PP
+Definition at line 48 of file eoFitContinue.h.
+.PP
+References eoPop< EOT >::nth_element_fitness().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoFitnessScalingSelect.3 b/trunk/paradiseo-eo/doc/man/man3/eoFitnessScalingSelect.3
new file mode 100644
index 000000000..c512d3a1f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoFitnessScalingSelect.3
@@ -0,0 +1,54 @@
+.TH "eoFitnessScalingSelect" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoFitnessScalingSelect \- eoFitnessScalingSelect: select an individual proportional to the linearly scaled fitness that is computed by the private \fBeoLinearFitScaling\fP object  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoRouletteWorthSelect< EOT, double >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoFitnessScalingSelect\fP (double _p=2.0)"
+.br
+.RI "\fICtor:. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoLinearFitScaling\fP< \fBEOT\fP > \fBscaling\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoFitnessScalingSelect< EOT >"
+eoFitnessScalingSelect: select an individual proportional to the linearly scaled fitness that is computed by the private \fBeoLinearFitScaling\fP object 
+.PP
+Definition at line 40 of file eoFitnessScalingSelect.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoFitnessScalingSelect\fP< \fBEOT\fP >::\fBeoFitnessScalingSelect\fP (double _p = \fC2.0\fP)\fC [inline]\fP"
+.PP
+Ctor:. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_p\fP the selective pressure, should be in [1,2] (2 is the default) 
+.RE
+.PP
+
+.PP
+Definition at line 46 of file eoFitnessScalingSelect.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoFitnessStat.3 b/trunk/paradiseo-eo/doc/man/man3/eoFitnessStat.3
new file mode 100644
index 000000000..591283430
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoFitnessStat.3
@@ -0,0 +1,36 @@
+.TH "eoFitnessStat" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoFitnessStat \- The fitnesses of a whole population, as a vector.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoSortedStat< EOT, std::vector< FitT > >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoFitnessStat\fP (std::string _description='AllFitnesses')"
+.br
+.ti -1c
+.RI "virtual void \fBoperator()\fP (const std::vector< const \fBEOT\fP * > &_popPters)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoFitnessStat< EOT, FitT >"
+The fitnesses of a whole population, as a vector. 
+.PP
+Definition at line 36 of file eoMOFitnessStat.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoFlOr1ptBinOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoFlOr1ptBinOp.3
new file mode 100644
index 000000000..e2f6bba5b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoFlOr1ptBinOp.3
@@ -0,0 +1,48 @@
+.TH "eoFlOr1ptBinOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoFlOr1ptBinOp \- The 1pt crossover (just in case someone wants it some day!).  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoBinOp< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::AtomType \fBAtomType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoVlUniformBinOp\fP ()"
+.br
+.RI "\fIdefault ctor: no argument \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eo1, \fBEOT\fP &_eo2)"
+.br
+.RI "\fIexchanges first and second parts of the vectors of Atoms \fP"
+.ti -1c
+.RI "virtual string \fBclassName\fP () const "
+.br
+.RI "\fIinherited \fBclassName()\fP \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoFlOr1ptBinOp< EOT >"
+The 1pt crossover (just in case someone wants it some day!). 
+.PP
+Definition at line 181 of file eoFlOrBinOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoFlOr1ptQuadOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoFlOr1ptQuadOp.3
new file mode 100644
index 000000000..8987e43d1
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoFlOr1ptQuadOp.3
@@ -0,0 +1,48 @@
+.TH "eoFlOr1ptQuadOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoFlOr1ptQuadOp \- The 1pt crossover (just in case someone wants it some day!).  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoQuadOp< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::AtomType \fBAtomType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoVlUniformQuadOp\fP ()"
+.br
+.RI "\fIdefault ctor: no argument \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eo1, \fBEOT\fP &_eo2)"
+.br
+.RI "\fIexchanges first and second parts of the vectors of Atoms \fP"
+.ti -1c
+.RI "virtual string \fBclassName\fP () const "
+.br
+.RI "\fIinherited \fBclassName()\fP \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoFlOr1ptQuadOp< EOT >"
+The 1pt crossover (just in case someone wants it some day!). 
+.PP
+Definition at line 173 of file eoFlOrQuadOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoFlOrAllAtomBinOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoFlOrAllAtomBinOp.3
new file mode 100644
index 000000000..da4f654c2
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoFlOrAllAtomBinOp.3
@@ -0,0 +1,58 @@
+.TH "eoFlOrAllAtomBinOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoFlOrAllAtomBinOp \- Bin Crossover using an Atom Crossover that is applied to a ALL components with given rate.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoBinOp< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::AtomType \fBAtomType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoFlOrAllAtomBinOp\fP (\fBeoBinOp\fP< AtomType > &_op, float _rate=1.0)"
+.br
+.RI "\fIdefault ctor: requires an Atom BinOp \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eo1, const \fBEOT\fP &_eo2)"
+.br
+.RI "\fIapplies Atom crossover to ALL components with given rate \fP"
+.ti -1c
+.RI "virtual string \fBclassName\fP () const "
+.br
+.RI "\fIinherited \fBclassName()\fP \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBrate\fP"
+.br
+.ti -1c
+.RI "\fBeoBinOp\fP< AtomType > & \fBop\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoFlOrAllAtomBinOp< EOT >"
+Bin Crossover using an Atom Crossover that is applied to a ALL components with given rate. 
+.PP
+Definition at line 49 of file eoFlOrBinOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoFlOrAllAtomQuadOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoFlOrAllAtomQuadOp.3
new file mode 100644
index 000000000..d6599e3e1
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoFlOrAllAtomQuadOp.3
@@ -0,0 +1,58 @@
+.TH "eoFlOrAllAtomQuadOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoFlOrAllAtomQuadOp \- Quad Crossover using an Atom Crossover.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoQuadOp< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::AtomType \fBAtomType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoFlOrAllAtomQuadOp\fP (\fBeoQuadOp\fP< AtomType > &_op, double _rate=1)"
+.br
+.RI "\fIdefault ctor: requires an Atom QuadOp \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eo1, \fBEOT\fP &_eo2)"
+.br
+.RI "\fIapplies Atom crossover to ALL components with given rate \fP"
+.ti -1c
+.RI "virtual string \fBclassName\fP () const "
+.br
+.RI "\fIinherited \fBclassName()\fP \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBrate\fP"
+.br
+.ti -1c
+.RI "\fBeoQuadOp\fP< AtomType > & \fBop\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoFlOrAllAtomQuadOp< EOT >"
+Quad Crossover using an Atom Crossover. 
+.PP
+Definition at line 46 of file eoFlOrQuadOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoFlOrAllMutation.3 b/trunk/paradiseo-eo/doc/man/man3/eoFlOrAllMutation.3
new file mode 100644
index 000000000..ec517d23e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoFlOrAllMutation.3
@@ -0,0 +1,58 @@
+.TH "eoFlOrAllMutation" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoFlOrAllMutation \- applies an atomic mutation to all the components with a given rate  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::AtomType \fBAtomType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoFlOrAllMutation\fP (\fBeoMonOp\fP< AtomType > &_atomMutation, double _rate=1.0)"
+.br
+.RI "\fIdefault ctor: requires an Atom mutation and a rate \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eo)"
+.br
+.RI "\fIapplies the atom mutation to all components with given rate \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIinherited \fBclassName()\fP \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoMonOp\fP< AtomType > & \fBatomMutation\fP"
+.br
+.ti -1c
+.RI "double \fBrate\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoFlOrAllMutation< EOT >"
+applies an atomic mutation to all the components with a given rate 
+.PP
+Definition at line 45 of file eoFlOrMonOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoFlOrKAtomBinOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoFlOrKAtomBinOp.3
new file mode 100644
index 000000000..e82e068f8
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoFlOrKAtomBinOp.3
@@ -0,0 +1,58 @@
+.TH "eoFlOrKAtomBinOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoFlOrKAtomBinOp \- Bin Crossover using an Atom Crossover that is applied to a FIXED NB of components.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoBinOp< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::AtomType \fBAtomType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoFlOrAtomBinOp\fP (\fBeoBinOp\fP< AtomType > &_op, unsigned _k=1)"
+.br
+.RI "\fIdefault ctor: requires an Atom BinOp and an unsigned \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eo1, const \fBEOT\fP &_eo2)"
+.br
+.RI "\fIapplies the Atom BinOp to some components \fP"
+.ti -1c
+.RI "virtual string \fBclassName\fP () const "
+.br
+.RI "\fIinherited \fBclassName()\fP \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBk\fP"
+.br
+.ti -1c
+.RI "\fBeoBinOp\fP< AtomType > & \fBop\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoFlOrKAtomBinOp< EOT >"
+Bin Crossover using an Atom Crossover that is applied to a FIXED NB of components. 
+.PP
+Definition at line 92 of file eoFlOrBinOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoFlOrKAtomQuadOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoFlOrKAtomQuadOp.3
new file mode 100644
index 000000000..483cd0682
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoFlOrKAtomQuadOp.3
@@ -0,0 +1,58 @@
+.TH "eoFlOrKAtomQuadOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoFlOrKAtomQuadOp \- Quad Crossover using an Atom Crossover that is applied to a FIXED NB of components.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoQuadOp< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::AtomType \fBAtomType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoFlOrAtomQuadOp\fP (\fBeoQuadOp\fP< AtomType > &_op, unsigned _k=1)"
+.br
+.RI "\fIdefault ctor: requires an Atom QuadOp and an unsigned \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eo1, const \fBEOT\fP &_eo2)"
+.br
+.RI "\fIapplies the Atom QuadOp to some components \fP"
+.ti -1c
+.RI "virtual string \fBclassName\fP () const "
+.br
+.RI "\fIinherited \fBclassName()\fP \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBk\fP"
+.br
+.ti -1c
+.RI "\fBeoQuadOp\fP< AtomType > & \fBop\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoFlOrKAtomQuadOp< EOT >"
+Quad Crossover using an Atom Crossover that is applied to a FIXED NB of components. 
+.PP
+Definition at line 84 of file eoFlOrQuadOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoFlOrKMutation.3 b/trunk/paradiseo-eo/doc/man/man3/eoFlOrKMutation.3
new file mode 100644
index 000000000..583529db4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoFlOrKMutation.3
@@ -0,0 +1,58 @@
+.TH "eoFlOrKMutation" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoFlOrKMutation \- Applies an atomic mutation to a fixed number of components (1 by default).  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::AtomType \fBAtomType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoFlOrKMutation\fP (\fBeoMonOp\fP< AtomType > &_atomMutation, unsigned _nb=1)"
+.br
+.RI "\fIdefault ctor: requires an Atom mutation \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eo)"
+.br
+.RI "\fIapplies the atom mutation to K randomly selected components \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIinherited \fBclassName()\fP \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBnb\fP"
+.br
+.ti -1c
+.RI "\fBeoMonOp\fP< AtomType > & \fBatomMutation\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoFlOrKMutation< EOT >"
+Applies an atomic mutation to a fixed number of components (1 by default). 
+.PP
+Definition at line 82 of file eoFlOrMonOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoFlOrUniformBinOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoFlOrUniformBinOp.3
new file mode 100644
index 000000000..e558acbb4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoFlOrUniformBinOp.3
@@ -0,0 +1,55 @@
+.TH "eoFlOrUniformBinOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoFlOrUniformBinOp \- The uniform crossover - exchanges atoms uniformly !  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoBinOp< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::AtomType \fBAtomType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoFlOrUniformBinOp\fP (double _rate=0.5)"
+.br
+.RI "\fIdefault ctor: requires a rate - 0.5 by default \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eo1, const \fBEOT\fP &_eo2)"
+.br
+.RI "\fIexcahnges atoms at given rate \fP"
+.ti -1c
+.RI "virtual string \fBclassName\fP () const "
+.br
+.RI "\fIinherited \fBclassName()\fP \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBrate\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoFlOrUniformBinOp< EOT >"
+The uniform crossover - exchanges atoms uniformly ! 
+.PP
+Definition at line 136 of file eoFlOrBinOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoFlOrUniformQuadOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoFlOrUniformQuadOp.3
new file mode 100644
index 000000000..7a8ce0051
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoFlOrUniformQuadOp.3
@@ -0,0 +1,55 @@
+.TH "eoFlOrUniformQuadOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoFlOrUniformQuadOp \- The uniform crossover - exchanges atoms uniformly !  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoQuadOp< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::AtomType \fBAtomType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoVlUniformQuadOp\fP (double _rate=0.5)"
+.br
+.RI "\fIdefault ctor: requires a rate - 0.5 by default \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eo1, \fBEOT\fP &_eo2)"
+.br
+.RI "\fIexcahnges atoms at given rate \fP"
+.ti -1c
+.RI "virtual string \fBclassName\fP () const "
+.br
+.RI "\fIinherited \fBclassName()\fP \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBrate\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoFlOrUniformQuadOp< EOT >"
+The uniform crossover - exchanges atoms uniformly ! 
+.PP
+Definition at line 127 of file eoFlOrQuadOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoFunctorBase.3 b/trunk/paradiseo-eo/doc/man/man3/eoFunctorBase.3
new file mode 100644
index 000000000..da71bab51
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoFunctorBase.3
@@ -0,0 +1,42 @@
+.TH "eoFunctorBase" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoFunctorBase \- Base class for functors to get a nice hierarchy diagram.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherited by \fBeoBF< A1, A2, R >\fP, \fBeoBF< AtomType &, AtomType &, bool >\fP, \fBeoBF< AtomType &, const AtomType &, bool >\fP, \fBeoBF< Chrom &, Chrom &, bool >\fP, \fBeoBF< const Dummy &, const Dummy &, double >\fP, \fBeoBF< const eoPop< Chrom > &, eoPop< Chrom > &, void >\fP, \fBeoBF< const eoPop< EOT > &, eoPop< EOT > &, void >\fP, \fBeoBF< const eoPop< eoVector< FitT, double > > &, eoPop< eoVector< FitT, double > > &, void >\fP, \fBeoBF< const EOT &, const EOT &, double >\fP, \fBeoBF< double &, const double &, bool >\fP, \fBeoBF< eoDistribution< EOT > &, eoPop< EOT > &, void >\fP, \fBeoBF< eoParseTree< FType, Node > &, eoParseTree< FType, Node > &, bool >\fP, \fBeoBF< eoPop< EOT > &, eoPop< EOT > &, void >\fP, \fBeoBF< eoPop< EOT > &, unsigned, void >\fP, \fBeoBF< eoPop< EoType > &, eoPop< EoType > &, void >\fP, \fBeoBF< eoPop< PyEO > &, unsigned, void >\fP, \fBeoBF< EOT &, const EOT &, bool >\fP, \fBeoBF< EOT &, EOT &, bool >\fP, \fBeoBF< EOType &, const EOType &, bool >\fP, \fBeoBF< EoType &, const EoType &, bool >\fP, \fBeoBF< EoType &, EoType &, bool >\fP, \fBeoBF< EOType &, EOType &, bool >\fP, \fBeoBF< eoVirus< FitT > &, const eoVirus< FitT > &, bool >\fP, \fBeoBF< ExternalEO &, const ExternalEO &, bool >\fP, \fBeoBF< ExternalEO &, ExternalEO &, bool >\fP, \fBeoBF< GenotypeT &, GenotypeT &, bool >\fP, \fBeoBF< PyEO &, const PyEO &, bool >\fP, \fBeoBF< PyEO &, PyEO &, bool >\fP, \fBeoBF< unsigned, Atom &, bool >\fP, \fBeoBF< unsigned, AtomType &, bool >\fP, \fBeoF< R >\fP, \fBeoF< AtomType >\fP, \fBeoF< bool >\fP, \fBeoF< eoMonitor & >\fP, \fBeoF< EOT >\fP, \fBeoF< int >\fP, \fBeoF< T >\fP, \fBeoF< void >\fP, \fBeoUF< A1, R >\fP, \fBeoUF< AtomType &, bool >\fP, \fBeoUF< AtomType &, void >\fP, \fBeoUF< bool &, bool >\fP, \fBeoUF< bool &, void >\fP, \fBeoUF< Chrom &, bool >\fP, \fBeoUF< Chrom &, void >\fP, \fBeoUF< const eoPop< EOT > &, bool >\fP, \fBeoUF< const eoPop< EOT > &, const EOT & >\fP, \fBeoUF< const eoPop< EOT > &, void >\fP, \fBeoUF< const eoPop< EoType > &, void >\fP, \fBeoUF< const eoPop< PyEO > &, const PyEO & >\fP, \fBeoUF< const eoPop< PyEO > &, void >\fP, \fBeoUF< const std::vector< const EOT * > &, void >\fP, \fBeoUF< const std::vector< const EoType * > &, void >\fP, \fBeoUF< const std::vector< const PyEO * > &, void >\fP, \fBeoUF< eoDistribution< EOT > &, void >\fP, \fBeoUF< eoDouble &, bool >\fP, \fBeoUF< eoDouble &, void >\fP, \fBeoUF< eoParseTree< FitnessType, Node > &, void >\fP, \fBeoUF< eoParseTree< FType, Node > &, bool >\fP, \fBeoUF< eoParseTree< FType, Node > &, void >\fP, \fBeoUF< eoPop< EOT > &, void >\fP, \fBeoUF< eoPopulator< EOT > &, void >\fP, \fBeoUF< eoPopulator< PyEO > &, void >\fP, \fBeoUF< EOT &, bool >\fP, \fBeoUF< EOT &, unsigned int >\fP, \fBeoUF< EOT &, void >\fP, \fBeoUF< EoType &, bool >\fP, \fBeoUF< EOType &, bool >\fP, \fBeoUF< EoType &, void >\fP, \fBeoUF< eoVector< FitT, double > &, void >\fP, \fBeoUF< eoVirus< FitT > &, bool >\fP, \fBeoUF< eoVirus< FitT > &, void >\fP, \fBeoUF< ExternalEO &, bool >\fP, \fBeoUF< ExternalEO &, void >\fP, \fBeoUF< GenotypeT &, bool >\fP, \fBeoUF< GenotypeT &, void >\fP, \fBeoUF< int &, void >\fP, \fBeoUF< PyEO &, bool >\fP, and \fBeoUF< T &, void >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual \fB~eoFunctorBase\fP ()"
+.br
+.RI "\fIvirtual dtor here so there is no need to define it in derived classes \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+Base class for functors to get a nice hierarchy diagram. 
+
+That's actually quite an understatement as it does quite a bit more than just that. By having all functors derive from the same base class, we can do some memory management that would otherwise be very hard.
+.PP
+The memory management base class is called \fBeoFunctorStore\fP, and it supports a member add() to add a pointer to a functor. When the functorStore is destroyed, it will delete all those pointers. So beware: do not delete the functorStore before you are done with anything that might have been allocated.
+.PP
+\fBSee also:\fP
+.RS 4
+\fBeoFunctorStore\fP 
+.RE
+.PP
+
+.PP
+Definition at line 46 of file eoFunctor.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoFunctorBase_binary_function_tag.3 b/trunk/paradiseo-eo/doc/man/man3/eoFunctorBase_binary_function_tag.3
new file mode 100644
index 000000000..6bb82c339
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoFunctorBase_binary_function_tag.3
@@ -0,0 +1,21 @@
+.TH "eoFunctorBase::binary_function_tag" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoFunctorBase::binary_function_tag \- tag to identify a binary function in compile time function selection functor_category  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SH "Detailed Description"
+.PP 
+tag to identify a binary function in compile time function selection functor_category 
+.PP
+Definition at line 57 of file eoFunctor.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoFunctorBase_procedure_tag.3 b/trunk/paradiseo-eo/doc/man/man3/eoFunctorBase_procedure_tag.3
new file mode 100644
index 000000000..b3a1e2a6d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoFunctorBase_procedure_tag.3
@@ -0,0 +1,21 @@
+.TH "eoFunctorBase::procedure_tag" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoFunctorBase::procedure_tag \- tag to identify a procedure in compile time function selection functor_category  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SH "Detailed Description"
+.PP 
+tag to identify a procedure in compile time function selection functor_category 
+.PP
+Definition at line 53 of file eoFunctor.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoFunctorBase_unary_function_tag.3 b/trunk/paradiseo-eo/doc/man/man3/eoFunctorBase_unary_function_tag.3
new file mode 100644
index 000000000..8900087cc
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoFunctorBase_unary_function_tag.3
@@ -0,0 +1,21 @@
+.TH "eoFunctorBase::unary_function_tag" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoFunctorBase::unary_function_tag \- tag to identify a unary function in compile time function selection functor_category  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SH "Detailed Description"
+.PP 
+tag to identify a unary function in compile time function selection functor_category 
+.PP
+Definition at line 55 of file eoFunctor.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoFunctorStore.3 b/trunk/paradiseo-eo/doc/man/man3/eoFunctorStore.3
new file mode 100644
index 000000000..a0cb58f21
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoFunctorStore.3
@@ -0,0 +1,60 @@
+.TH "eoFunctorStore" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoFunctorStore \- eoFunctorStore is a class that stores functors that are allocated on the heap.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherited by \fBeoState\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoFunctorStore\fP ()"
+.br
+.RI "\fIDefault Ctor. \fP"
+.ti -1c
+.RI "virtual \fB~eoFunctorStore\fP ()"
+.br
+.RI "\fIclears the memory \fP"
+.ti -1c
+.RI "template Functor & \fBstoreFunctor\fP (Functor *r)"
+.br
+.RI "\fIAdd an \fBeoFunctorBase\fP to the store. \fP"
+.in -1c
+.SS "Private Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoFunctorStore\fP (const \fBeoFunctorStore\fP &)"
+.br
+.RI "\fIno copying allowed \fP"
+.ti -1c
+.RI "\fBeoFunctorStore\fP \fBoperator=\fP (const \fBeoFunctorStore\fP &)"
+.br
+.RI "\fIno copying allowed \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "std::vector< \fBeoFunctorBase\fP * > \fBvec\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+eoFunctorStore is a class that stores functors that are allocated on the heap. 
+
+This class can be used in factories to store allocated memory for dynamically created functors. 
+.PP
+Definition at line 39 of file eoFunctorStore.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoG3Replacement.3 b/trunk/paradiseo-eo/doc/man/man3/eoG3Replacement.3
new file mode 100644
index 000000000..cf5ad9c62
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoG3Replacement.3
@@ -0,0 +1,49 @@
+.TH "eoG3Replacement" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoG3Replacement \- eoG3Replacement is an \fBeoReplacement\fP: - no strong elitism (is suppposed to be within a steady-state engine) - choose N (2) parents RANDOMLY - remove them from the parent population - merge offspring and the N removed parents - select best N of this merged population - put them back into parent population  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoReplacement< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoG3Replacement\fP (\fBeoHowMany\fP _howManyEliminatedParents=\fBeoHowMany\fP(2, false))"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_parents, \fBeoPop\fP< \fBEOT\fP > &_offspring)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoLinearTruncateSplit\fP< \fBEOT\fP > \fBsplit\fP"
+.br
+.ti -1c
+.RI "\fBeoTruncateSplit\fP< \fBEOT\fP > \fBreduce\fP"
+.br
+.ti -1c
+.RI "\fBeoPlus\fP< \fBEOT\fP > \fBplus\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoG3Replacement< EOT >"
+eoG3Replacement is an \fBeoReplacement\fP: - no strong elitism (is suppposed to be within a steady-state engine) - choose N (2) parents RANDOMLY - remove them from the parent population - merge offspring and the N removed parents - select best N of this merged population - put them back into parent population 
+.PP
+Definition at line 50 of file eoG3Replacement.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoGenContinue.3 b/trunk/paradiseo-eo/doc/man/man3/eoGenContinue.3
new file mode 100644
index 000000000..d3ec74f22
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoGenContinue.3
@@ -0,0 +1,117 @@
+.TH "eoGenContinue" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoGenContinue \- Generational continuator: continues until a number of generations is reached.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoContinue< EOT >< EOT >\fP, and \fBeoValueParam< unsigned >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoGenContinue\fP (unsigned long _totalGens)"
+.br
+.RI "\fICtor for setting a. \fP"
+.ti -1c
+.RI "\fBeoGenContinue\fP (unsigned long _totalGens, unsigned long &_currentGen)"
+.br
+.RI "\fICtor for enabling the save/load the no. of generations counted. \fP"
+.ti -1c
+.RI "virtual bool \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_vEO)"
+.br
+.RI "\fIReturns false when a certain number of generations is reached. \fP"
+.ti -1c
+.RI "virtual void \fBtotalGenerations\fP (unsigned long _tg)"
+.br
+.RI "\fISets the number of generations to reach and sets the current generation to 0 (the begin). \fP"
+.ti -1c
+.RI "virtual unsigned long \fBtotalGenerations\fP ()"
+.br
+.RI "\fIReturns the number of generations to reach. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.ti -1c
+.RI "void \fBreadFrom\fP (std::istream &__is)"
+.br
+.RI "\fIRead object. \fP"
+.ti -1c
+.RI "void \fBprintOn\fP (std::ostream &__os) const "
+.br
+.RI "\fIWrite object. \fP"
+.in -1c
+.SS "Public Attributes"
+
+.in +1c
+.ti -1c
+.RI "bool \fBverbose\fP"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned long \fBrepTotalGenerations\fP"
+.br
+.ti -1c
+.RI "unsigned long \fBthisGenerationPlaceHolder\fP"
+.br
+.ti -1c
+.RI "unsigned long & \fBthisGeneration\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoGenContinue< EOT >"
+Generational continuator: continues until a number of generations is reached. 
+.PP
+Definition at line 34 of file eoGenContinue.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template void \fBeoGenContinue\fP< \fBEOT\fP >::readFrom (std::istream & __is)\fC [inline, virtual]\fP"
+.PP
+Read object. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_is\fP A std::istream. 
+.RE
+.PP
+\fBExceptions:\fP
+.RS 4
+\fIruntime_std::exception\fP If a valid object can't be read. 
+.RE
+.PP
+
+.PP
+Reimplemented from \fBeoContinue< EOT >\fP.
+.PP
+Definition at line 83 of file eoGenContinue.h.
+.SS "template void \fBeoGenContinue\fP< \fBEOT\fP >::printOn (std::ostream & __os) const\fC [inline, virtual]\fP"
+.PP
+Write object. 
+.PP
+It's called printOn since it prints the object on a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_os\fP A std::ostream. 
+.RE
+.PP
+
+.PP
+Reimplemented from \fBeoContinue< EOT >\fP.
+.PP
+Definition at line 88 of file eoGenContinue.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoGenOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoGenOp.3
new file mode 100644
index 000000000..a9e84af03
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoGenOp.3
@@ -0,0 +1,58 @@
+.TH "eoGenOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoGenOp \- The base class for General Operators Subclass this operator is you want to define an operator that falls outside of the \fBeoMonOp\fP, \fBeoBinOp\fP, \fBeoQuadOp\fP classification.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoOp< EOT >\fP, and \fBeoUF< eoPopulator< EOT > &, void >\fP.
+.PP
+Inherited by \fBeoBinGenOp< EOT >\fP, \fBeoEsGlobalXover< EOT >\fP, \fBeoMonGenOp< EOT >\fP, \fBeoOpContainer< EOT >\fP, \fBeoPropGAGenOp< EOT >\fP, \fBeoQuadGenOp< EOT >\fP, \fBeoSelBinGenOp< EOT >\fP, \fBeoSGAGenOp< EOT >\fP, one2threeOp, three2threeOp, and two2oneOp.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoGenOp\fP ()"
+.br
+.RI "\fICtor that honors its superclass. \fP"
+.ti -1c
+.RI "virtual unsigned \fBmax_production\fP (void)=0"
+.br
+.RI "\fIMax production is used to reserve space for all elements that are used by the operator, not setting it properly can result in a crash. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const =0"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPopulator\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Protected Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual void \fBapply\fP (\fBeoPopulator\fP< \fBEOT\fP > &_pop)=0"
+.br
+.RI "\fIthe function that will do the work \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoGenOp< EOT >"
+The base class for General Operators Subclass this operator is you want to define an operator that falls outside of the \fBeoMonOp\fP, \fBeoBinOp\fP, \fBeoQuadOp\fP classification. 
+
+The argument the operator will receive is an \fBeoPopulator\fP, which is a wrapper around the original population, is an instantiation of the next population and has often a selection function embedded in it to select new individuals.
+.PP
+Note that the actual work is performed in the apply function. AND that the apply function is responsible for invalidating the object if necessary 
+.PP
+Definition at line 57 of file eoGenOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoGeneDelChooser.3 b/trunk/paradiseo-eo/doc/man/man3/eoGeneDelChooser.3
new file mode 100644
index 000000000..1c7179050
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoGeneDelChooser.3
@@ -0,0 +1,34 @@
+.TH "eoGeneDelChooser" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoGeneDelChooser \- A helper class for choosing which site to delete.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoUF< EOT &, unsigned int >\fP.
+.PP
+Inherited by \fBeoUniformGeneChooser< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const =0"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoGeneDelChooser< EOT >"
+A helper class for choosing which site to delete. 
+.PP
+Definition at line 85 of file eoVariableLengthMutation.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoGeneralBreeder.3 b/trunk/paradiseo-eo/doc/man/man3/eoGeneralBreeder.3
new file mode 100644
index 000000000..7c04935ab
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoGeneralBreeder.3
@@ -0,0 +1,112 @@
+.TH "eoGeneralBreeder" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoGeneralBreeder \- Base class for breeders using generalized operators.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoBreed< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoGeneralBreeder\fP (\fBeoSelectOne\fP< \fBEOT\fP > &_select, \fBeoGenOp\fP< \fBEOT\fP > &_op, double _rate=1.0, bool _interpret_as_rate=true)"
+.br
+.RI "\fICtor:. \fP"
+.ti -1c
+.RI "\fBeoGeneralBreeder\fP (\fBeoSelectOne\fP< \fBEOT\fP > &_select, \fBeoGenOp\fP< \fBEOT\fP > &_op, \fBeoHowMany\fP _howMany)"
+.br
+.RI "\fICtor:. \fP"
+.ti -1c
+.RI "void \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_parents, \fBeoPop\fP< \fBEOT\fP > &_offspring)"
+.br
+.RI "\fIThe breeder: simply calls the genOp on a selective populator! \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIThe class name. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSelectOne\fP< \fBEOT\fP > & \fBselect\fP"
+.br
+.ti -1c
+.RI "\fBeoGenOp\fP< \fBEOT\fP > & \fBop\fP"
+.br
+.ti -1c
+.RI "\fBeoHowMany\fP \fBhowMany\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoGeneralBreeder< EOT >"
+Base class for breeders using generalized operators. 
+.PP
+Definition at line 46 of file eoGeneralBreeder.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoGeneralBreeder\fP< \fBEOT\fP >::\fBeoGeneralBreeder\fP (\fBeoSelectOne\fP< \fBEOT\fP > & _select, \fBeoGenOp\fP< \fBEOT\fP > & _op, double _rate = \fC1.0\fP, bool _interpret_as_rate = \fCtrue\fP)\fC [inline]\fP"
+.PP
+Ctor:. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_select\fP a selectoOne, to be used for all selections 
+.br
+\fI_op\fP a general operator (will generally be an \fBeoOpContainer\fP) 
+.br
+\fI_rate\fP pour howMany, le nbre d'enfants a generer 
+.br
+\fI_interpret_as_rate\fP \fCexplanation\fP 
+.RE
+.PP
+
+.PP
+Definition at line 56 of file eoGeneralBreeder.h.
+.SS "template \fBeoGeneralBreeder\fP< \fBEOT\fP >::\fBeoGeneralBreeder\fP (\fBeoSelectOne\fP< \fBEOT\fP > & _select, \fBeoGenOp\fP< \fBEOT\fP > & _op, \fBeoHowMany\fP _howMany)\fC [inline]\fP"
+.PP
+Ctor:. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_select\fP a selectoOne, to be used for all selections 
+.br
+\fI_op\fP a general operator (will generally be an \fBeoOpContainer\fP) 
+.br
+\fI_howMany\fP an \fBeoHowMany\fP \fCexplanation\fP 
+.RE
+.PP
+
+.PP
+Definition at line 69 of file eoGeneralBreeder.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template void \fBeoGeneralBreeder\fP< \fBEOT\fP >::operator() (const \fBeoPop\fP< \fBEOT\fP > & _parents, \fBeoPop\fP< \fBEOT\fP > & _offspring)\fC [inline, virtual]\fP"
+.PP
+The breeder: simply calls the genOp on a selective populator! 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_parents\fP the initial population 
+.br
+\fI_offspring\fP the resulting population (content -if any- is lost) 
+.RE
+.PP
+
+.PP
+Implements \fBeoBF< const eoPop< EOT > &, eoPop< EOT > &, void >\fP.
+.PP
+Definition at line 80 of file eoGeneralBreeder.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoGeneralIntBounds.3 b/trunk/paradiseo-eo/doc/man/man3/eoGeneralIntBounds.3
new file mode 100644
index 000000000..921e7b8a2
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoGeneralIntBounds.3
@@ -0,0 +1,123 @@
+.TH "eoGeneralIntBounds" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoGeneralIntBounds \- A class that encapsulate all possible \fBeoIntBounds\fP.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoIntBounds\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoGeneralIntBounds\fP (std::string _s='[-infinity,+infinity]')"
+.br
+.RI "\fICtor: from a string, chooses the type of bound. \fP"
+.ti -1c
+.RI "\fBeoGeneralIntBounds\fP (const \fBeoGeneralIntBounds\fP &_b)"
+.br
+.RI "\fINeed a Cpy Ctor because we are allocating memory. \fP"
+.ti -1c
+.RI "\fBeoGeneralIntBounds\fP & \fBoperator=\fP (const \fBeoGeneralIntBounds\fP &_b)"
+.br
+.ti -1c
+.RI "\fB~eoGeneralIntBounds\fP ()"
+.br
+.RI "\fINeed a Dtor because we allocate an actual bound. \fP"
+.ti -1c
+.RI "virtual bool \fBisBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: true if ***both*** a min and a max. \fP"
+.ti -1c
+.RI "virtual bool \fBhasNoBoundAtAll\fP (void) const "
+.br
+.RI "\fISelf-Test: true if no min ***and*** no max hence no further need to test/truncate/fold anything. \fP"
+.ti -1c
+.RI "virtual bool \fBisMinBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: bounded from below??? \fP"
+.ti -1c
+.RI "virtual bool \fBisMaxBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: bounded from above??? \fP"
+.ti -1c
+.RI "virtual bool \fBisInBounds\fP (double _x) const "
+.br
+.RI "\fITest on a value: is it in bounds? \fP"
+.ti -1c
+.RI "virtual void \fBfoldsInBounds\fP (double &_x) const "
+.br
+.RI "\fIPut value back into bounds - by folding back and forth. \fP"
+.ti -1c
+.RI "virtual void \fBtruncate\fP (double &_x) const "
+.br
+.RI "\fIPut value back into bounds - by truncating to a boundary value. \fP"
+.ti -1c
+.RI "virtual long int \fBminimum\fP () const "
+.br
+.RI "\fIget minimum value ::exception if does not exist \fP"
+.ti -1c
+.RI "virtual long int \fBmaximum\fP () const "
+.br
+.RI "\fIget maximum value ::exception if does not exist \fP"
+.ti -1c
+.RI "virtual long int \fBrange\fP () const "
+.br
+.RI "\fIget range ::exception if unbounded \fP"
+.ti -1c
+.RI "virtual double \fBuniform\fP (\fBeoRng\fP &_rng=eo::rng) const "
+.br
+.RI "\fIrandom generator of uniform doubles in bounds ::exception if unbounded \fP"
+.ti -1c
+.RI "virtual long int \fBrandom\fP (\fBeoRng\fP &_rng=eo::rng) const "
+.br
+.RI "\fIrandom generator of uniform ints in bounds ::exception if unbounded \fP"
+.ti -1c
+.RI "virtual \fBeoIntBounds\fP * \fBdup\fP () const "
+.br
+.RI "\fIfor memory managements - ugly \fP"
+.ti -1c
+.RI "const \fBeoIntBounds\fP & \fBtheBounds\fP () const "
+.br
+.RI "\fIfor efficiency, it's better to use the embedded boud directly \fP"
+.ti -1c
+.RI "virtual void \fBprintOn\fP (std::ostream &_os) const "
+.br
+.RI "\fIdon't forget the printOn method - again that of the embedded bound \fP"
+.ti -1c
+.RI "virtual void \fBreadFrom\fP (std::istream &_is)"
+.br
+.RI "\fIno readFrom ??? Have to check that later \fP"
+.in -1c
+.SS "Private Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoIntBounds\fP * \fBgetBoundsFromString\fP (std::string)"
+.br
+.RI "\fIthe constructor for eoGeneralIntBound - from a string \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoIntBounds\fP * \fBrepBound\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+A class that encapsulate all possible \fBeoIntBounds\fP. 
+
+Mandatory in order to read through the parser 
+.PP
+Definition at line 541 of file eoIntBounds.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoGeneralRealBounds.3 b/trunk/paradiseo-eo/doc/man/man3/eoGeneralRealBounds.3
new file mode 100644
index 000000000..f748a752f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoGeneralRealBounds.3
@@ -0,0 +1,119 @@
+.TH "eoGeneralRealBounds" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoGeneralRealBounds \- A class that encapsulate all possible \fBeoIntBounds\fP.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoRealBounds\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoGeneralRealBounds\fP (std::string _s='[-infinity,+infinity]')"
+.br
+.RI "\fICtor: from a string, chooses the type of bound. \fP"
+.ti -1c
+.RI "\fBeoGeneralRealBounds\fP (const \fBeoGeneralRealBounds\fP &_b)"
+.br
+.RI "\fINeed a Cpy Ctor because we are allocating memory. \fP"
+.ti -1c
+.RI "\fBeoGeneralRealBounds\fP & \fBoperator=\fP (const \fBeoGeneralRealBounds\fP &_b)"
+.br
+.ti -1c
+.RI "\fB~eoGeneralRealBounds\fP ()"
+.br
+.RI "\fINeed a Dtor because we allocate an actual bound. \fP"
+.ti -1c
+.RI "virtual bool \fBisBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: true if ***both*** a min and a max. \fP"
+.ti -1c
+.RI "virtual bool \fBhasNoBoundAtAll\fP (void) const "
+.br
+.RI "\fISelf-Test: true if no min ***and*** no max hence no further need to test/truncate/fold anything. \fP"
+.ti -1c
+.RI "virtual bool \fBisMinBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: bounded from below??? \fP"
+.ti -1c
+.RI "virtual bool \fBisMaxBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: bounded from above??? \fP"
+.ti -1c
+.RI "virtual bool \fBisInBounds\fP (double _x) const "
+.br
+.RI "\fITest on a value: is it in bounds? \fP"
+.ti -1c
+.RI "virtual void \fBfoldsInBounds\fP (double &_x) const "
+.br
+.RI "\fIPut value back into bounds - by folding back and forth. \fP"
+.ti -1c
+.RI "virtual void \fBtruncate\fP (double &_x) const "
+.br
+.RI "\fIPut value back into bounds - by truncating to a boundary value. \fP"
+.ti -1c
+.RI "virtual double \fBminimum\fP () const "
+.br
+.RI "\fIget minimum value ::exception if does not exist \fP"
+.ti -1c
+.RI "virtual double \fBmaximum\fP () const "
+.br
+.RI "\fIget maximum value ::exception if does not exist \fP"
+.ti -1c
+.RI "virtual double \fBrange\fP () const "
+.br
+.RI "\fIget range ::exception if unbounded \fP"
+.ti -1c
+.RI "virtual double \fBuniform\fP (\fBeoRng\fP &_rng=eo::rng) const "
+.br
+.RI "\fIrandom generator of uniform numbers in bounds ::exception if unbounded \fP"
+.ti -1c
+.RI "virtual \fBeoRealBounds\fP * \fBdup\fP () const "
+.br
+.RI "\fIfor memory managements - ugly \fP"
+.ti -1c
+.RI "const \fBeoRealBounds\fP & \fBtheBounds\fP () const "
+.br
+.RI "\fIfor efficiency, it's better to use the embedded boud directly \fP"
+.ti -1c
+.RI "virtual void \fBprintOn\fP (std::ostream &_os) const "
+.br
+.RI "\fIdon't forget the printOn method - again that of the embedded bound \fP"
+.ti -1c
+.RI "virtual void \fBreadFrom\fP (std::istream &_is)"
+.br
+.RI "\fIno readFrom ??? Have to check that later \fP"
+.in -1c
+.SS "Private Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoRealBounds\fP * \fBgetBoundsFromString\fP (std::string)"
+.br
+.RI "\fIthe constructor for eoGeneralRealBound - from a string very similar to the \fBeoRealVectorBounds::readFrom\fP above but was written much later so the readFrom does not call this one as it should do \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoRealBounds\fP * \fBrepBound\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+A class that encapsulate all possible \fBeoIntBounds\fP. 
+
+Mandatory in order to read through the parser 
+.PP
+Definition at line 506 of file eoRealBounds.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoGenerationalReplacement.3 b/trunk/paradiseo-eo/doc/man/man3/eoGenerationalReplacement.3
new file mode 100644
index 000000000..a146cc4d9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoGenerationalReplacement.3
@@ -0,0 +1,33 @@
+.TH "eoGenerationalReplacement" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoGenerationalReplacement \- generational replacement == swap populations  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoReplacement< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_parents, \fBeoPop\fP< \fBEOT\fP > &_offspring)"
+.br
+.RI "\fIswap \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoGenerationalReplacement< EOT >"
+generational replacement == swap populations 
+.PP
+Definition at line 84 of file eoReplacement.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoGnuplot.3 b/trunk/paradiseo-eo/doc/man/man3/eoGnuplot.3
new file mode 100644
index 000000000..4d1abeddf
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoGnuplot.3
@@ -0,0 +1,143 @@
+.TH "eoGnuplot" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoGnuplot \- Base class for calls to gnuplot.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherited by \fBeoGnuplot1DMonitor\fP, and \fBeoGnuplot1DSnapshot\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoGnuplot\fP (std::string _title, std::string _extra=std::string(''))"
+.br
+.RI "\fIOpen pipe to Gnuplot. \fP"
+.ti -1c
+.RI "virtual \fB~eoGnuplot\fP ()"
+.br
+.RI "\fIDestructor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIClass name. \fP"
+.ti -1c
+.RI "void \fBgnuplotCommand\fP (const char *_command)"
+.br
+.RI "\fISend command to gnuplot. \fP"
+.ti -1c
+.RI "void \fBgnuplotCommand\fP (std::string _command)"
+.br
+.RI "\fISend command to gnuplot. \fP"
+.in -1c
+.SS "Protected Member Functions"
+
+.in +1c
+.ti -1c
+.RI "void \fBinitGnuPlot\fP (std::string _title, std::string _extra)"
+.br
+.RI "\fIInitialize gnuplot. \fP"
+.in -1c
+.SS "Protected Attributes"
+
+.in +1c
+.ti -1c
+.RI "bool \fBfirstTime\fP"
+.br
+.RI "\fIThe stats might be unknown in Ctor. \fP"
+.ti -1c
+.RI "PCom * \fBgpCom\fP"
+.br
+.RI "\fICommunication with gnuplot OK. \fP"
+.in -1c
+.SS "Static Protected Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBnumWindow\fP = 0"
+.br
+.RI "\fIInternal counter for gnuplot windows. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+Base class for calls to gnuplot. 
+
+This class is the abstract class that will be used by further gnuplot calls to plots what is already written by some \fBeoMonitor\fP into a file
+.PP
+\fBAuthor:\fP
+.RS 4
+Marc Schoenauer 
+.RE
+.PP
+\fBVersion:\fP
+.RS 4
+0.0 (2001) 
+.RE
+.PP
+
+.PP
+Definition at line 38 of file eoGnuplot.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "eoGnuplot::eoGnuplot (std::string _title, std::string _extra = \fCstd::string('')\fP)"
+.PP
+Open pipe to Gnuplot. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_title\fP Title for gnuplot window. 
+.br
+\fI_extra\fP Extra parameters to gnuplot (default ). 
+.RE
+.PP
+
+.PP
+Definition at line 37 of file eoGnuplot.cpp.
+.PP
+References initGnuPlot().
+.SS "eoGnuplot::~\fBeoGnuplot\fP ()\fC [virtual]\fP"
+.PP
+Destructor. 
+.PP
+Close the gnuplot windows if pipe was correctly opened 
+.PP
+Definition at line 45 of file eoGnuplot.cpp.
+.PP
+References gpCom.
+.SH "Member Function Documentation"
+.PP 
+.SS "void eoGnuplot::gnuplotCommand (std::string _command)\fC [inline]\fP"
+.PP
+Send command to gnuplot. 
+.PP
+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 
+.PP
+Definition at line 66 of file eoGnuplot.h.
+.SS "void eoGnuplot::initGnuPlot (std::string _title, std::string _extra)\fC [protected]\fP"
+.PP
+Initialize gnuplot. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_title\fP Title for gnuplot window. 
+.br
+\fI_extra\fP Extra parameters to gnuplot. 
+.RE
+.PP
+
+.PP
+Definition at line 70 of file eoGnuplot.cpp.
+.PP
+References gpCom, and numWindow.
+.PP
+Referenced by eoGnuplot().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoGnuplot1DMonitor.3 b/trunk/paradiseo-eo/doc/man/man3/eoGnuplot1DMonitor.3
new file mode 100644
index 000000000..b05838cc1
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoGnuplot1DMonitor.3
@@ -0,0 +1,62 @@
+.TH "eoGnuplot1DMonitor" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoGnuplot1DMonitor \- Plot \fBeoStat\fP.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoFileMonitor\fP, and \fBeoGnuplot\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoGnuplot1DMonitor\fP (std::string _filename, bool _top=false)"
+.br
+.RI "\fIConstructor. \fP"
+.ti -1c
+.RI "virtual \fB~eoGnuplot1DMonitor\fP ()"
+.br
+.RI "\fIDestructor. \fP"
+.ti -1c
+.RI "virtual \fBeoMonitor\fP & \fBoperator()\fP ()"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.ti -1c
+.RI "virtual void \fBFirstPlot\fP ()"
+.br
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIClass name. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+Plot \fBeoStat\fP. 
+
+\fBAuthor:\fP
+.RS 4
+Marc Schoenauer 
+.RE
+.PP
+\fBVersion:\fP
+.RS 4
+0.0 (2000)
+.RE
+.PP
+This class plots through gnuplot the \fBeoStat\fP given as argument
+.PP
+eoGnuplot1DMonitor plots stats through gnuplot
+.PP
+Assumes that the same file is appened every so and so, and replots it everytime 
+.PP
+Definition at line 47 of file eoGnuplot1DMonitor.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoGnuplot1DSnapshot.3 b/trunk/paradiseo-eo/doc/man/man3/eoGnuplot1DSnapshot.3
new file mode 100644
index 000000000..7954068ed
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoGnuplot1DSnapshot.3
@@ -0,0 +1,74 @@
+.TH "eoGnuplot1DSnapshot" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoGnuplot1DSnapshot \- Plot stats through gnuplot.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoFileSnapshot\fP, and \fBeoGnuplot\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoGnuplot1DSnapshot\fP (std::string _dirname, unsigned _frequency=1, std::string _filename='gen', std::string _delim=' ', unsigned _counter=0, bool _rmFiles=true)"
+.br
+.ti -1c
+.RI "\fBeoGnuplot1DSnapshot\fP (std::string _dirname, \fBeoRealVectorBounds\fP &_bounds, unsigned _frequency=1, std::string _filename='gen', std::string _delim=' ', unsigned _counter=0, bool _rmFiles=true)"
+.br
+.ti -1c
+.RI "\fBeoGnuplot1DSnapshot\fP (\fBeoFileSnapshot\fP &_fSnapshot)"
+.br
+.ti -1c
+.RI "\fBeoGnuplot1DSnapshot\fP (\fBeoFileSnapshot\fP &_fSnapshot, \fBeoRealVectorBounds\fP &_bounds)"
+.br
+.ti -1c
+.RI "virtual \fBeoMonitor\fP & \fBoperator()\fP ()"
+.br
+.RI "\fIThe operator(void): opens the std::ostream and calls the write method. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIClass name. \fP"
+.ti -1c
+.RI "virtual void \fBhandleBounds\fP (\fBeoRealVectorBounds\fP &_bounds)"
+.br
+.ti -1c
+.RI "void \fBsetPointSize\fP (unsigned _pointSize)"
+.br
+.in -1c
+.SS "Protected Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBpointSize\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+Plot stats through gnuplot. 
+
+\fBAuthor:\fP
+.RS 4
+Marc Schoenauer 2000 
+.RE
+.PP
+\fBVersion:\fP
+.RS 4
+0.0
+.RE
+.PP
+This class plots through gnuplot the \fBeoStat\fP given as argument
+.PP
+Assumes that the same file is re-written every so and so, and plots it from scratch everytime it's called 
+.PP
+Definition at line 51 of file eoGnuplot1DSnapshot.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoHammingDistance.3 b/trunk/paradiseo-eo/doc/man/man3/eoHammingDistance.3
new file mode 100644
index 000000000..aba5ab24e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoHammingDistance.3
@@ -0,0 +1,33 @@
+.TH "eoHammingDistance" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoHammingDistance \- This is a generic class for L1 distance computation: assumes the 2 things are std::vectors of something that is double-castable For bitstrings, this is the Hamming distance.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoDistance< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "double \fBoperator()\fP (const \fBEOT\fP &_v1, const \fBEOT\fP &_v2)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoHammingDistance< EOT >"
+This is a generic class for L1 distance computation: assumes the 2 things are std::vectors of something that is double-castable For bitstrings, this is the Hamming distance. 
+.PP
+Definition at line 66 of file eoDistance.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoHoistMutation.3 b/trunk/paradiseo-eo/doc/man/man3/eoHoistMutation.3
new file mode 100644
index 000000000..ec00d9802
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoHoistMutation.3
@@ -0,0 +1,81 @@
+.TH "eoHoistMutation" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoHoistMutation \- eoHoistMutation --> replace the individual with one of its subtree's  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< eoParseTree< FType, Node > >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef \fBeoParseTree\fP< FType, Node > \fBEoType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoHoistMutation\fP ()"
+.br
+.RI "\fIConstructor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIThe class name. \fP"
+.ti -1c
+.RI "virtual \fB~eoHoistMutation\fP ()"
+.br
+.RI "\fIDtor. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEoType\fP &_eo1)"
+.br
+.RI "\fIMutate an individual. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoHoistMutation< FType, Node >"
+eoHoistMutation --> replace the individual with one of its subtree's 
+.PP
+Definition at line 336 of file eoParseTreeOp.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoHoistMutation\fP< FType, Node >::\fBeoHoistMutation\fP ()\fC [inline]\fP"
+.PP
+Constructor. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fInone\fP .RE
+.PP
+
+.PP
+Definition at line 345 of file eoParseTreeOp.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template bool \fBeoHoistMutation\fP< FType, Node >::operator() (\fBEoType\fP & _eo1)\fC [inline]\fP"
+.PP
+Mutate an individual. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_eo1\fP The individual that is to be changed 
+.RE
+.PP
+
+.PP
+Definition at line 358 of file eoParseTreeOp.h.
+.PP
+References eoRng::random().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoHowMany.3 b/trunk/paradiseo-eo/doc/man/man3/eoHowMany.3
new file mode 100644
index 000000000..a4f19faa5
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoHowMany.3
@@ -0,0 +1,160 @@
+.TH "eoHowMany" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoHowMany \- A helper class, to determine a number of individuals from another one Typically, is used in selection / replacement procedures, e.g.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoPersistent\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoHowMany\fP (double _rate=0.0, bool _interpret_as_rate=true)"
+.br
+.RI "\fIOriginal Ctor from direct rate + bool. \fP"
+.ti -1c
+.RI "\fBeoHowMany\fP (int _combien)"
+.br
+.RI "\fICtor from an int - both from int and unsigned int are needed to avoid ambiguity with the Ctor from a double. \fP"
+.ti -1c
+.RI "\fBeoHowMany\fP (unsigned int _combien)"
+.br
+.RI "\fICtor from an unsigned int - both from int and unsigned int are needed to avoid ambiguity with the Ctor from a double. \fP"
+.ti -1c
+.RI "virtual \fB~eoHowMany\fP ()"
+.br
+.RI "\fIVirtual dtor. They are needed in virtual class hierarchies. \fP"
+.ti -1c
+.RI "unsigned int \fBoperator()\fP (unsigned int _size)"
+.br
+.RI "\fIDoes what it was designed for combien==0 : return rate*_size else combien>0 : return combien (regardless of _size) combien<0 : return _size-|combien|. \fP"
+.ti -1c
+.RI "virtual void \fBprintOn\fP (std::ostream &_os) const "
+.br
+.RI "\fIWrite object. \fP"
+.ti -1c
+.RI "virtual void \fBreadFrom\fP (std::istream &_is)"
+.br
+.RI "\fIRead object. \fP"
+.ti -1c
+.RI "void \fBreadFrom\fP (std::string _value)"
+.br
+.ti -1c
+.RI "\fBeoHowMany\fP \fBoperator-\fP ()"
+.br
+.RI "\fIThe unary - operator: reverses the computation. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBrate\fP"
+.br
+.ti -1c
+.RI "int \fBcombien\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+A helper class, to determine a number of individuals from another one Typically, is used in selection / replacement procedures, e.g. 
+
+the number of offspring from the number of parents, or the number of survivors for an \fBeoReduce\fP functor, ...
+.PP
+Such construct is very useful because in some cases you might not know the population size that will enter the replacement. For instance, you cannot simply have a pre-computed (double) rate of 1/popSize if you want to select or kill just 1 guy. Using an eoHowMany allows one to modify the population size without touching anything else.
+.PP
+There are 4 possible way to compute the return value from the argument:
+.IP "\(bu" 2
+an absolute POSITIVE integer --> return it (regardless of popsize)
+.IP "\(bu" 2
+a POSITIVE rate --> return rate*popSize
+.IP "\(bu" 2
+an absolute NEGATIVE integer --> return popsize-rate (if positive)
+.IP "\(bu" 2
+a NEGATIVE rate in [-1,0] --> store and use 1-|rate| (positive) Note that a negative rate should be have been necessary because a rate is relative, but it is there for consistency reasons - and because it is needed in \fCeoG3Replacement\fP
+.PP
+.PP
+It has 2 private members, a double and an integer to cover all cases
+.PP
+Example use: in \fCeoGeneralBreeder.h\fP Example reading from parser: in \fCdo/make_algo_scalar.h line 141\fP
+.PP
+MS 10/04/2002: Added the possibility to have a negative number - when treated as a number: returns then (size - combien) Should not modify anything when a positive number is passed in the ctor
+.PP
+MS 20/06/2002: Added the negative rate and the \fBoperator-()\fP (for eoG3Repalcement)
+.PP
+It is an \fBeoPersistent\fP because we need to be able to use eoParamValue 
+.PP
+Definition at line 69 of file eoHowMany.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "eoHowMany::eoHowMany (double _rate = \fC0.0\fP, bool _interpret_as_rate = \fCtrue\fP)\fC [inline]\fP"
+.PP
+Original Ctor from direct rate + bool. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIrate\fP the rate, OR the integer to store, depending on 2nd arg. 
+.br
+\fI_interpret_as_rate\fP to tell whether the rate actually is a rate 
+.RE
+.PP
+
+.PP
+Definition at line 76 of file eoHowMany.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "unsigned int eoHowMany::operator() (unsigned int _size)\fC [inline]\fP"
+.PP
+Does what it was designed for combien==0 : return rate*_size else combien>0 : return combien (regardless of _size) combien<0 : return _size-|combien|. 
+.PP
+.IP "\(bu" 2
+* - * - * - 
+.PP
+
+.PP
+Definition at line 114 of file eoHowMany.h.
+.SS "virtual void eoHowMany::printOn (std::ostream & _os) const\fC [inline, virtual]\fP"
+.PP
+Write object. 
+.PP
+It's called printOn since it prints the object on a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_os\fP A std::ostream. 
+.RE
+.PP
+
+.PP
+Implements \fBeoPrintable\fP.
+.PP
+Definition at line 130 of file eoHowMany.h.
+.SS "virtual void eoHowMany::readFrom (std::istream & _is)\fC [inline, virtual]\fP"
+.PP
+Read object. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_is\fP A std::istream. 
+.RE
+.PP
+\fBExceptions:\fP
+.RS 4
+\fIruntime_std::exception\fP If a valid object can't be read. 
+.RE
+.PP
+
+.PP
+Implements \fBeoPersistent\fP.
+.PP
+Definition at line 140 of file eoHowMany.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoIncrementor.3 b/trunk/paradiseo-eo/doc/man/man3/eoIncrementor.3
new file mode 100644
index 000000000..5822abfe9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoIncrementor.3
@@ -0,0 +1,50 @@
+.TH "eoIncrementor" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoIncrementor \- an \fBeoUpdater\fP that simply increments a counter  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoUpdater\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoIncrementor\fP (T &_counter, T _stepsize=1)"
+.br
+.RI "\fIDefault Ctor - requires a reference to the thing to increment. \fP"
+.ti -1c
+.RI "virtual void \fBoperator()\fP ()"
+.br
+.RI "\fISimply increments. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "T & \fBcounter\fP"
+.br
+.ti -1c
+.RI "T \fBstepsize\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoIncrementor< T >"
+an \fBeoUpdater\fP that simply increments a counter 
+.PP
+Definition at line 50 of file eoUpdater.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoIncrementorParam.3 b/trunk/paradiseo-eo/doc/man/man3/eoIncrementorParam.3
new file mode 100644
index 000000000..efc2b8c56
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoIncrementorParam.3
@@ -0,0 +1,51 @@
+.TH "eoIncrementorParam" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoIncrementorParam \- an \fBeoUpdater\fP that is an \fBeoValueParam\fP (and thus OWNS its counter) Mandatory for generation counter in make_checkpoint  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoUpdater\fP, and \fBeoValueParam< T >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoIncrementorParam\fP (std::string _name, T _stepsize=1)"
+.br
+.RI "\fIDefault Ctor : a name and optionally an increment. \fP"
+.ti -1c
+.RI "\fBeoIncrementorParam\fP (std::string _name, T _countValue, T _stepsize)"
+.br
+.RI "\fICtor with a name and non-zero initial value and mandatory stepSize to remove ambiguity. \fP"
+.ti -1c
+.RI "virtual void \fBoperator()\fP ()"
+.br
+.RI "\fISimply increments. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "T \fBstepsize\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoIncrementorParam< T >"
+an \fBeoUpdater\fP that is an \fBeoValueParam\fP (and thus OWNS its counter) Mandatory for generation counter in make_checkpoint 
+.PP
+Definition at line 71 of file eoUpdater.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoInit.3 b/trunk/paradiseo-eo/doc/man/man3/eoInit.3
new file mode 100644
index 000000000..52745b968
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoInit.3
@@ -0,0 +1,55 @@
+.TH "eoInit" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoInit \- Base (name) class for Initialization of chromosomes, used in a population contructor.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoUF< EOT &, void >\fP.
+.PP
+Inherited by \fBeoCombinedInit< EOT >\fP, \fBeoDistribution< EOT >\fP, \fBeoInitFixedLength< EOT >\fP, \fBeoInitVariableLength< EOT >\fP, and \fBeoRealInitBounded< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.RI "\fIclassName: Mandatory because of \fBeoCombinedInit\fP. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoInit< EOT >"
+Base (name) class for Initialization of chromosomes, used in a population contructor. 
+
+It is derived from \fBeoMonOp\fP, so it can be used inside the algorithm as well.
+.PP
+\fBSee also:\fP
+.RS 4
+\fBeoPop\fP 
+.RE
+.PP
+
+.PP
+Definition at line 45 of file eoInit.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template virtual std::string \fBeoInit\fP< \fBEOT\fP >::className (void) const\fC [inline, virtual]\fP"
+.PP
+className: Mandatory because of \fBeoCombinedInit\fP. 
+.PP
+SHould be pure virtual, but then we should go over the whole code to write the method for all derived classes ... MS 16/7/04 
+.PP
+Reimplemented in \fBeoCombinedInit< EOT >\fP, \fBeoPBILDistrib< EOT >\fP, \fBeoParseTreeDepthInit< FType, Node >\fP, and \fBeoStParseTreeDepthInit< FType, Node >\fP.
+.PP
+Definition at line 52 of file eoInit.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoInitAdaptor.3 b/trunk/paradiseo-eo/doc/man/man3/eoInitAdaptor.3
new file mode 100644
index 000000000..c25c6f1cf
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoInitAdaptor.3
@@ -0,0 +1,52 @@
+.TH "eoInitAdaptor" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoInitAdaptor \- eoInitAdaptor changes the place in the hierarchy from \fBeoInit\fP to \fBeoMonOp\fP.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoInitAdaptor\fP (\fBeoInit\fP< \fBEOT\fP > &_init)"
+.br
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eot)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoInit\fP< \fBEOT\fP > & \fBinit\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoInitAdaptor< EOT >"
+eoInitAdaptor changes the place in the hierarchy from \fBeoInit\fP to \fBeoMonOp\fP. 
+
+This is mainly a type conversion, nothing else 
+.PP
+\fBSee also:\fP
+.RS 4
+\fBeoInit\fP, \fBeoMonOp\fP 
+.RE
+.PP
+
+.PP
+Definition at line 157 of file eoInit.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoInitFixedLength.3 b/trunk/paradiseo-eo/doc/man/man3/eoInitFixedLength.3
new file mode 100644
index 000000000..7c0b96274
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoInitFixedLength.3
@@ -0,0 +1,54 @@
+.TH "eoInitFixedLength" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoInitFixedLength \- Initializer for fixed length representations with a single type.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoInit< EOT >< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::AtomType \fBAtomType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoInitFixedLength\fP (unsigned _combien, \fBeoRndGenerator\fP< AtomType > &_generator)"
+.br
+.ti -1c
+.RI "virtual void \fBoperator()\fP (\fBEOT\fP &chrom)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBcombien\fP"
+.br
+.ti -1c
+.RI "\fBeoSTLF\fP< AtomType > \fBgenerator\fP"
+.br
+.RI "\fIgeneric wrapper for eoFunctor (s), to make them have the function-pointer style copy semantics \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoInitFixedLength< EOT >"
+Initializer for fixed length representations with a single type. 
+.PP
+Definition at line 81 of file eoInit.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoInitGenerator.3 b/trunk/paradiseo-eo/doc/man/man3/eoInitGenerator.3
new file mode 100644
index 000000000..057de4561
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoInitGenerator.3
@@ -0,0 +1,44 @@
+.TH "eoInitGenerator" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoInitGenerator \- turning an \fBeoInit\fP into a generator probably we should only use genrators - and suppress \fBeoInit\fP ??? MS - July 2001  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoF< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoInitGenerator\fP (\fBeoInit\fP< \fBEOT\fP > &_init)"
+.br
+.RI "\fICtor from a plain \fBeoInit\fP. \fP"
+.ti -1c
+.RI "virtual \fBEOT\fP \fBoperator()\fP ()"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoInit\fP< \fBEOT\fP > & \fBinit\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoInitGenerator< EOT >"
+turning an \fBeoInit\fP into a generator probably we should only use genrators - and suppress \fBeoInit\fP ??? MS - July 2001 
+.PP
+Definition at line 60 of file eoInit.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoInitVariableLength.3 b/trunk/paradiseo-eo/doc/man/man3/eoInitVariableLength.3
new file mode 100644
index 000000000..7d50b4b29
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoInitVariableLength.3
@@ -0,0 +1,60 @@
+.TH "eoInitVariableLength" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoInitVariableLength \- Initializer for variable length representations with a single type.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoInit< EOT >< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::AtomType \fBAtomType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoInitVariableLength\fP (unsigned _minSize, unsigned _maxSize, \fBeoInit\fP< AtomType > &_init)"
+.br
+.RI "\fICtor from an \fBeoInit\fP. \fP"
+.ti -1c
+.RI "virtual void \fBoperator()\fP (\fBEOT\fP &_chrom)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.ti -1c
+.RI "\fBeoInit\fP< AtomType > & \fBatomInit\fP ()"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBoffset\fP"
+.br
+.ti -1c
+.RI "unsigned \fBextent\fP"
+.br
+.ti -1c
+.RI "\fBeoInit\fP< AtomType > & \fBinit\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoInitVariableLength< EOT >"
+Initializer for variable length representations with a single type. 
+.PP
+Definition at line 107 of file eoInit.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoInitVirus.3 b/trunk/paradiseo-eo/doc/man/man3/eoInitVirus.3
new file mode 100644
index 000000000..cb7908a87
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoInitVirus.3
@@ -0,0 +1,47 @@
+.TH "eoInitVirus" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoInitVirus \- Initializer for binary chromosome with MGE.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoInit< eoVirus< FitT > >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoInitVirus\fP (unsigned _combien, \fBeoRndGenerator\fP< bool > &_generator)"
+.br
+.ti -1c
+.RI "virtual void \fBoperator()\fP (eoVirus< \fBFitT\fP > &chrom)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBcombien\fP"
+.br
+.ti -1c
+.RI "\fBeoSTLF\fP< bool > \fBgenerator\fP"
+.br
+.RI "\fIgeneric wrapper for eoFunctor (s), to make them have the function-pointer style copy semantics \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoInitVirus< FitT >"
+Initializer for binary chromosome with MGE. 
+.PP
+Definition at line 41 of file eoInitVirus.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoInitVirus1bit.3 b/trunk/paradiseo-eo/doc/man/man3/eoInitVirus1bit.3
new file mode 100644
index 000000000..989b1fdbb
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoInitVirus1bit.3
@@ -0,0 +1,47 @@
+.TH "eoInitVirus1bit" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoInitVirus1bit \- Inits the virus with one bit to the left set to one.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoInit< eoVirus< FitT > >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoInitVirus1bit\fP (unsigned _combien, \fBeoRndGenerator\fP< bool > &_generator)"
+.br
+.ti -1c
+.RI "virtual void \fBoperator()\fP (eoVirus< \fBFitT\fP > &chrom)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBcombien\fP"
+.br
+.ti -1c
+.RI "\fBeoSTLF\fP< bool > \fBgenerator\fP"
+.br
+.RI "\fIgeneric wrapper for eoFunctor (s), to make them have the function-pointer style copy semantics \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoInitVirus1bit< FitT >"
+Inits the virus with one bit to the left set to one. 
+.PP
+Definition at line 66 of file eoInitVirus.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoInnerExchangeQuadOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoInnerExchangeQuadOp.3
new file mode 100644
index 000000000..2ea77a600
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoInnerExchangeQuadOp.3
@@ -0,0 +1,59 @@
+.TH "eoInnerExchangeQuadOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoInnerExchangeQuadOp \- Crossover using an AtomCrossover.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoQuadOp< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::AtomType \fBAtomType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoInnerExchangeQuadOp\fP (\fBeoQuadOp\fP< AtomType > &_op, float _rate=0.5)"
+.br
+.RI "\fIdefault ctor: requires bounds on number of genes + a rate \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eo1, \fBEOT\fP &_eo2)"
+.br
+.RI "\fIperforms the Atom crossover \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "float \fBrate\fP"
+.br
+.ti -1c
+.RI "\fBeoQuadOp\fP< AtomType > & \fBop\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoInnerExchangeQuadOp< EOT >"
+Crossover using an AtomCrossover. 
+
+Probably irrelevant in Variable Length - see \fBeoFlOrBinOp.h\fP and \fBeoFlOrQuadOp.h\fP for the similar Fixed Length operators 
+.PP
+Definition at line 172 of file eoVariableLengthCrossover.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoIntAboveBound.3 b/trunk/paradiseo-eo/doc/man/man3/eoIntAboveBound.3
new file mode 100644
index 000000000..e3208b292
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoIntAboveBound.3
@@ -0,0 +1,129 @@
+.TH "eoIntAboveBound" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoIntAboveBound \- An eoIntBound bounded from above only.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoIntBounds\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoIntAboveBound\fP (long int _max=0)"
+.br
+.RI "\fISimple bounds = minimum. \fP"
+.ti -1c
+.RI "virtual long int \fBmaximum\fP () const "
+.br
+.RI "\fIget maximum value ::exception if does not exist \fP"
+.ti -1c
+.RI "virtual long int \fBminimum\fP () const "
+.br
+.RI "\fIget minimum value ::exception if does not exist \fP"
+.ti -1c
+.RI "virtual long int \fBrange\fP () const "
+.br
+.RI "\fIget range ::exception if unbounded \fP"
+.ti -1c
+.RI "virtual double \fBuniform\fP (\fBeoRng\fP &_rng=eo::rng) const "
+.br
+.RI "\fIrandom generator of uniform numbers in bounds uses same naming convention than eo::rng ::exception if unbounded \fP"
+.ti -1c
+.RI "virtual long int \fBrandom\fP (\fBeoRng\fP &_rng=eo::rng) const "
+.br
+.ti -1c
+.RI "virtual bool \fBisBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: true if ***both*** a min and a max. \fP"
+.ti -1c
+.RI "virtual bool \fBhasNoBoundAtAll\fP (void) const "
+.br
+.RI "\fISelf-Test: true if no min ***and*** no max hence no further need to test/truncate/fold anything. \fP"
+.ti -1c
+.RI "virtual bool \fBisMinBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: bounded from below??? \fP"
+.ti -1c
+.RI "virtual bool \fBisMaxBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: bounded from above??? \fP"
+.ti -1c
+.RI "virtual bool \fBisInBounds\fP (double _r) const "
+.br
+.RI "\fITest on a value: is it in bounds? \fP"
+.ti -1c
+.RI "virtual void \fBfoldsInBounds\fP (double &_r) const "
+.br
+.RI "\fIPut value back into bounds - by folding back and forth. \fP"
+.ti -1c
+.RI "virtual void \fBtruncate\fP (double &_r) const "
+.br
+.RI "\fIPut value back into bounds - by truncating to a boundary value. \fP"
+.ti -1c
+.RI "virtual void \fBreadFrom\fP (std::istream &_is)"
+.br
+.RI "\fIRead object. \fP"
+.ti -1c
+.RI "virtual void \fBprintOn\fP (std::ostream &_os) const "
+.br
+.RI "\fIWrite object. \fP"
+.ti -1c
+.RI "virtual \fBeoIntBounds\fP * \fBdup\fP () const "
+.br
+.RI "\fIfor memory managements - ugly \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "long int \fBrepMaximum\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+An eoIntBound bounded from above only. 
+.PP
+Definition at line 441 of file eoIntBounds.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "virtual void eoIntAboveBound::readFrom (std::istream & _is)\fC [inline, virtual]\fP"
+.PP
+Read object. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_is\fP A std::istream. but reading should not be done here, because of bound problems see eoIntVectorBounds 
+.RE
+.PP
+
+.PP
+Implements \fBeoPersistent\fP.
+.PP
+Definition at line 512 of file eoIntBounds.h.
+.SS "virtual void eoIntAboveBound::printOn (std::ostream & _os) const\fC [inline, virtual]\fP"
+.PP
+Write object. 
+.PP
+It's called printOn since it prints the object on a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_os\fP A std::ostream. 
+.RE
+.PP
+
+.PP
+Implements \fBeoPrintable\fP.
+.PP
+Definition at line 521 of file eoIntBounds.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoIntBelowBound.3 b/trunk/paradiseo-eo/doc/man/man3/eoIntBelowBound.3
new file mode 100644
index 000000000..8f619aa70
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoIntBelowBound.3
@@ -0,0 +1,129 @@
+.TH "eoIntBelowBound" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoIntBelowBound \- an eoIntBound bounded from below only  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoIntBounds\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoIntBelowBound\fP (long int _min=0)"
+.br
+.RI "\fISimple bounds = minimum. \fP"
+.ti -1c
+.RI "virtual long int \fBminimum\fP () const "
+.br
+.RI "\fIget minimum value ::exception if does not exist \fP"
+.ti -1c
+.RI "virtual long int \fBmaximum\fP () const "
+.br
+.RI "\fIget maximum value ::exception if does not exist \fP"
+.ti -1c
+.RI "virtual long int \fBrange\fP () const "
+.br
+.RI "\fIget range ::exception if unbounded \fP"
+.ti -1c
+.RI "virtual double \fBuniform\fP (\fBeoRng\fP &_rng=eo::rng) const "
+.br
+.RI "\fIrandom generator of uniform numbers in bounds uses same naming convention than eo::rng ::exception if unbounded \fP"
+.ti -1c
+.RI "virtual long int \fBrandom\fP (\fBeoRng\fP &_rng=eo::rng) const "
+.br
+.ti -1c
+.RI "virtual bool \fBisBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: true if ***both*** a min and a max. \fP"
+.ti -1c
+.RI "virtual bool \fBhasNoBoundAtAll\fP (void) const "
+.br
+.RI "\fISelf-Test: true if no min ***and*** no max hence no further need to test/truncate/fold anything. \fP"
+.ti -1c
+.RI "virtual bool \fBisMinBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: bounded from below??? \fP"
+.ti -1c
+.RI "virtual bool \fBisMaxBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: bounded from above??? \fP"
+.ti -1c
+.RI "virtual bool \fBisInBounds\fP (double _r) const "
+.br
+.RI "\fITest on a value: is it in bounds? \fP"
+.ti -1c
+.RI "virtual void \fBfoldsInBounds\fP (double &_r) const "
+.br
+.RI "\fIPut value back into bounds - by folding back and forth. \fP"
+.ti -1c
+.RI "virtual void \fBtruncate\fP (double &_r) const "
+.br
+.RI "\fIPut value back into bounds - by truncating to a boundary value. \fP"
+.ti -1c
+.RI "virtual void \fBreadFrom\fP (std::istream &_is)"
+.br
+.RI "\fIRead object. \fP"
+.ti -1c
+.RI "virtual void \fBprintOn\fP (std::ostream &_os) const "
+.br
+.RI "\fIWrite object. \fP"
+.ti -1c
+.RI "virtual \fBeoIntBounds\fP * \fBdup\fP () const "
+.br
+.RI "\fIfor memory managements - ugly \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "long int \fBrepMinimum\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+an eoIntBound bounded from below only 
+.PP
+Definition at line 344 of file eoIntBounds.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "virtual void eoIntBelowBound::readFrom (std::istream & _is)\fC [inline, virtual]\fP"
+.PP
+Read object. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_is\fP A std::istream. but reading should not be done here, because of bound problems see eoIntVectorBounds 
+.RE
+.PP
+
+.PP
+Implements \fBeoPersistent\fP.
+.PP
+Definition at line 414 of file eoIntBounds.h.
+.SS "virtual void eoIntBelowBound::printOn (std::ostream & _os) const\fC [inline, virtual]\fP"
+.PP
+Write object. 
+.PP
+It's called printOn since it prints the object on a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_os\fP A std::ostream. 
+.RE
+.PP
+
+.PP
+Implements \fBeoPrintable\fP.
+.PP
+Definition at line 423 of file eoIntBounds.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoIntBounds.3 b/trunk/paradiseo-eo/doc/man/man3/eoIntBounds.3
new file mode 100644
index 000000000..50dd1f27a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoIntBounds.3
@@ -0,0 +1,114 @@
+.TH "eoIntBounds" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoIntBounds \- Defines bound classes for real numbers.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoPersistent\fP.
+.PP
+Inherited by \fBeoGeneralIntBounds\fP, \fBeoIntAboveBound\fP, \fBeoIntBelowBound\fP, \fBeoIntInterval\fP, and \fBeoIntNoBounds\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual bool \fBisBounded\fP (void) const =0"
+.br
+.RI "\fISelf-Test: true if ***both*** a min and a max. \fP"
+.ti -1c
+.RI "virtual bool \fBhasNoBoundAtAll\fP (void) const =0"
+.br
+.RI "\fISelf-Test: true if no min ***and*** no max hence no further need to test/truncate/fold anything. \fP"
+.ti -1c
+.RI "virtual bool \fBisMinBounded\fP (void) const =0"
+.br
+.RI "\fISelf-Test: bounded from below??? \fP"
+.ti -1c
+.RI "virtual bool \fBisMaxBounded\fP (void) const =0"
+.br
+.RI "\fISelf-Test: bounded from above??? \fP"
+.ti -1c
+.RI "virtual bool \fBisInBounds\fP (double) const =0"
+.br
+.RI "\fITest on a value: is it in bounds? \fP"
+.ti -1c
+.RI "virtual void \fBfoldsInBounds\fP (double &) const =0"
+.br
+.RI "\fIPut value back into bounds - by folding back and forth. \fP"
+.ti -1c
+.RI "virtual void \fBfoldsInBounds\fP (long int &i) const "
+.br
+.RI "\fIfoldsInBounds for ints: call the method for double and convert back \fP"
+.ti -1c
+.RI "virtual void \fBtruncate\fP (double &) const =0"
+.br
+.RI "\fIPut value back into bounds - by truncating to a boundary value. \fP"
+.ti -1c
+.RI "virtual void \fBtruncate\fP (long int &i) const "
+.br
+.RI "\fItruncate for ints: call the method for double and convert back \fP"
+.ti -1c
+.RI "virtual long int \fBminimum\fP () const =0"
+.br
+.RI "\fIget minimum value ::exception if does not exist \fP"
+.ti -1c
+.RI "virtual long int \fBmaximum\fP () const =0"
+.br
+.RI "\fIget maximum value ::exception if does not exist \fP"
+.ti -1c
+.RI "virtual long int \fBrange\fP () const =0"
+.br
+.RI "\fIget range ::exception if unbounded \fP"
+.ti -1c
+.RI "virtual double \fBuniform\fP (\fBeoRng\fP &_rng=eo::rng) const =0"
+.br
+.RI "\fIrandom generator of uniform numbers in bounds uses same naming convention than eo::rng ::exception if unbounded \fP"
+.ti -1c
+.RI "virtual long int \fBrandom\fP (\fBeoRng\fP &_rng=eo::rng) const =0"
+.br
+.ti -1c
+.RI "virtual \fBeoIntBounds\fP * \fBdup\fP () const =0"
+.br
+.RI "\fIfor memory managements - ugly \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+Defines bound classes for real numbers. 
+
+Scalar type: ------------ Basic class is eoIntBounds, a pure virtual.
+.PP
+The following pure virtual methods are to be used in mutations:
+.IP "\(bu" 2
+void foldsInBounds(long int &) that folds any value that falls out of the bounds back into the bounds, by bouncing on the limit (if any)
+.IP "\(bu" 2
+bool isInBounds(long int) that simply says whether or not the argument is in the bounds
+.IP "\(bu" 2
+void truncate(long int &) that set the argument to the bound value it it exceeds it
+.PP
+.PP
+So mutation can choose
+.IP "\(bu" 2
+iterate trying until they fall in bounds,
+.IP "\(bu" 2
+only try once and 'restd::pair' by using the foldsInBounds method
+.IP "\(bu" 2
+only try once and restd::pair using the truncate method (will create a huge bias toward the bound if the soluiton is not far from the bounds)
+.PP
+.PP
+There is also a \fBuniform()\fP method that generates a uniform value (if possible, i.e. if bounded) in the interval.
+.PP
+Derived class are \fBeoIntInterval\fP that holds a minimum and maximum value, \fBeoIntNoBounds\fP the 'unbounded bounds' (-infinity, +infinity) \fBeoIntBelowBound\fP the half-bounded interval [min, +infinity) \fBeoIntAboveBound\fP the half-bounded interval (-infinity, max]
+.PP
+THis file also contains the declaration of *the* global object that is the unbounded bound 
+.PP
+Definition at line 75 of file eoIntBounds.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoIntInterval.3 b/trunk/paradiseo-eo/doc/man/man3/eoIntInterval.3
new file mode 100644
index 000000000..8712acca3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoIntInterval.3
@@ -0,0 +1,135 @@
+.TH "eoIntInterval" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoIntInterval \- fully bounded eoIntBound == interval  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoIntBounds\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoIntInterval\fP (long int _min=0, long int _max=1)"
+.br
+.RI "\fISimple bounds = minimum and maximum (allowed). \fP"
+.ti -1c
+.RI "virtual long int \fBminimum\fP () const "
+.br
+.RI "\fIget minimum value ::exception if does not exist \fP"
+.ti -1c
+.RI "virtual long int \fBmaximum\fP () const "
+.br
+.RI "\fIget maximum value ::exception if does not exist \fP"
+.ti -1c
+.RI "virtual long int \fBrange\fP () const "
+.br
+.RI "\fIget range ::exception if unbounded \fP"
+.ti -1c
+.RI "virtual bool \fBisBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: true if ***both*** a min and a max. \fP"
+.ti -1c
+.RI "virtual bool \fBhasNoBoundAtAll\fP (void) const "
+.br
+.RI "\fISelf-Test: true if no min ***and*** no max hence no further need to test/truncate/fold anything. \fP"
+.ti -1c
+.RI "virtual bool \fBisMinBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: bounded from below??? \fP"
+.ti -1c
+.RI "virtual bool \fBisMaxBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: bounded from above??? \fP"
+.ti -1c
+.RI "virtual double \fBuniform\fP (\fBeoRng\fP &_rng=eo::rng) const "
+.br
+.RI "\fIrandom generator of uniform numbers in bounds uses same naming convention than eo::rng ::exception if unbounded \fP"
+.ti -1c
+.RI "virtual long int \fBrandom\fP (\fBeoRng\fP &_rng=eo::rng) const "
+.br
+.ti -1c
+.RI "virtual bool \fBisInBounds\fP (double _r) const "
+.br
+.RI "\fITest on a value: is it in bounds? \fP"
+.ti -1c
+.RI "virtual void \fBfoldsInBounds\fP (double &_r) const "
+.br
+.RI "\fIPut value back into bounds - by folding back and forth. \fP"
+.ti -1c
+.RI "virtual void \fBtruncate\fP (double &_r) const "
+.br
+.RI "\fIPut value back into bounds - by truncating to a boundary value. \fP"
+.ti -1c
+.RI "virtual void \fBreadFrom\fP (std::istream &_is)"
+.br
+.RI "\fIRead object. \fP"
+.ti -1c
+.RI "virtual void \fBprintOn\fP (std::ostream &_os) const "
+.br
+.RI "\fIWrite object. \fP"
+.ti -1c
+.RI "virtual \fBeoIntBounds\fP * \fBdup\fP () const "
+.br
+.RI "\fIfor memory managements - ugly \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "long int \fBrepMinimum\fP"
+.br
+.ti -1c
+.RI "long int \fBrepMaximum\fP"
+.br
+.ti -1c
+.RI "long int \fBrepRange\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+fully bounded eoIntBound == interval 
+.PP
+Definition at line 223 of file eoIntBounds.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "virtual void eoIntInterval::readFrom (std::istream & _is)\fC [inline, virtual]\fP"
+.PP
+Read object. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_is\fP A std::istream. but reading should not be done here, because of bound problems see eoIntVectorBounds 
+.RE
+.PP
+
+.PP
+Implements \fBeoPersistent\fP.
+.PP
+Definition at line 315 of file eoIntBounds.h.
+.SS "virtual void eoIntInterval::printOn (std::ostream & _os) const\fC [inline, virtual]\fP"
+.PP
+Write object. 
+.PP
+It's called printOn since it prints the object on a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_os\fP A std::ostream. 
+.RE
+.PP
+
+.PP
+Implements \fBeoPrintable\fP.
+.PP
+Definition at line 324 of file eoIntBounds.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoIntNoBounds.3 b/trunk/paradiseo-eo/doc/man/man3/eoIntNoBounds.3
new file mode 100644
index 000000000..6bf3f8a6b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoIntNoBounds.3
@@ -0,0 +1,118 @@
+.TH "eoIntNoBounds" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoIntNoBounds \- A default class for unbounded variables.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoIntBounds\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual bool \fBisBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: true if ***both*** a min and a max. \fP"
+.ti -1c
+.RI "virtual bool \fBhasNoBoundAtAll\fP (void) const "
+.br
+.RI "\fISelf-Test: true if no min ***and*** no max hence no further need to test/truncate/fold anything. \fP"
+.ti -1c
+.RI "virtual bool \fBisMinBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: bounded from below??? \fP"
+.ti -1c
+.RI "virtual bool \fBisMaxBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: bounded from above??? \fP"
+.ti -1c
+.RI "virtual void \fBfoldsInBounds\fP (double &) const "
+.br
+.RI "\fIPut value back into bounds - by folding back and forth. \fP"
+.ti -1c
+.RI "virtual void \fBtruncate\fP (double &) const "
+.br
+.RI "\fIPut value back into bounds - by truncating to a boundary value. \fP"
+.ti -1c
+.RI "virtual bool \fBisInBounds\fP (double) const "
+.br
+.RI "\fITest on a value: is it in bounds? \fP"
+.ti -1c
+.RI "virtual long int \fBminimum\fP () const "
+.br
+.RI "\fIget minimum value ::exception if does not exist \fP"
+.ti -1c
+.RI "virtual long int \fBmaximum\fP () const "
+.br
+.RI "\fIget maximum value ::exception if does not exist \fP"
+.ti -1c
+.RI "virtual long int \fBrange\fP () const "
+.br
+.RI "\fIget range ::exception if unbounded \fP"
+.ti -1c
+.RI "virtual double \fBuniform\fP (\fBeoRng\fP &_rng=eo::rng) const "
+.br
+.RI "\fIrandom generator of uniform numbers in bounds uses same naming convention than eo::rng ::exception if unbounded \fP"
+.ti -1c
+.RI "virtual long int \fBrandom\fP (\fBeoRng\fP &_rng=eo::rng) const "
+.br
+.ti -1c
+.RI "virtual void \fBreadFrom\fP (std::istream &_is)"
+.br
+.RI "\fIRead object. \fP"
+.ti -1c
+.RI "virtual void \fBprintOn\fP (std::ostream &_os) const "
+.br
+.RI "\fIWrite object. \fP"
+.ti -1c
+.RI "virtual \fBeoIntBounds\fP * \fBdup\fP () const "
+.br
+.RI "\fIfor memory managements - ugly \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+A default class for unbounded variables. 
+.PP
+Definition at line 153 of file eoIntBounds.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "virtual void eoIntNoBounds::readFrom (std::istream & _is)\fC [inline, virtual]\fP"
+.PP
+Read object. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_is\fP A std::istream. but reading should not be done here, because of bound problems see eoIntVectorBounds 
+.RE
+.PP
+
+.PP
+Implements \fBeoPersistent\fP.
+.PP
+Definition at line 195 of file eoIntBounds.h.
+.SS "virtual void eoIntNoBounds::printOn (std::ostream & _os) const\fC [inline, virtual]\fP"
+.PP
+Write object. 
+.PP
+It's called printOn since it prints the object on a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_os\fP A std::ostream. 
+.RE
+.PP
+
+.PP
+Implements \fBeoPrintable\fP.
+.PP
+Definition at line 204 of file eoIntBounds.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoInvalidateBinOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoInvalidateBinOp.3
new file mode 100644
index 000000000..60b7e99df
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoInvalidateBinOp.3
@@ -0,0 +1,49 @@
+.TH "eoInvalidateBinOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoInvalidateBinOp \- One of the invalidator operators.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoBinOp< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoInvalidateBinOp\fP (\fBeoBinOp\fP< \fBEOT\fP > &_op)"
+.br
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eo, const \fBEOT\fP &_eo2)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoBinOp\fP< \fBEOT\fP > & \fBop\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoInvalidateBinOp< EOT >"
+One of the invalidator operators. 
+
+Use this one as a 'hat' on an operator that is defined to work on a generic datatype. This functor will then check the return type of the operator and invalidate the fitness of the individual.
+.PP
+This functor is used in algorithms that work with straight \fBeoMonOp\fP, \fBeoBinOp\fP or \fBeoQuadOp\fP operators, for instance \fBeoSGA\fP. Note that \fBeoGenOp\fP derived operators generally do invalidate the fitness of the objects they have changed.
+.PP
+Return value means 'Has_Changed' and not 'Needs_To_Be_Invalidated' as successive invalidation are not really a problem 
+.PP
+Definition at line 80 of file eoInvalidateOps.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoInvalidateMonOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoInvalidateMonOp.3
new file mode 100644
index 000000000..da3bc7fd3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoInvalidateMonOp.3
@@ -0,0 +1,49 @@
+.TH "eoInvalidateMonOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoInvalidateMonOp \- One of the invalidator operators.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoInvalidateMonOp\fP (\fBeoMonOp\fP< \fBEOT\fP > &_op)"
+.br
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eo)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoMonOp\fP< \fBEOT\fP > & \fBop\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoInvalidateMonOp< EOT >"
+One of the invalidator operators. 
+
+Use this one as a 'hat' on an operator that is defined to work on a generic datatype. This functor will then check the return type of the operator and invalidate the fitness of the individual.
+.PP
+This functor is used in algorithms that work with straight \fBeoMonOp\fP, \fBeoBinOp\fP or \fBeoQuadOp\fP operators, for instance \fBeoSGA\fP. Note that \fBeoGenOp\fP derived operators generally do invalidate the fitness of the objects they have changed.
+.PP
+Return value means 'Has_Changed' and not 'Needs_To_Be_Invalidated' as successive invalidation are not really a problem 
+.PP
+Definition at line 46 of file eoInvalidateOps.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoInvalidateQuadOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoInvalidateQuadOp.3
new file mode 100644
index 000000000..993fb87aa
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoInvalidateQuadOp.3
@@ -0,0 +1,49 @@
+.TH "eoInvalidateQuadOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoInvalidateQuadOp \- One of the invalidator operators.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoQuadOp< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoInvalidateQuadOp\fP (\fBeoQuadOp\fP< \fBEOT\fP > &_op)"
+.br
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eo1, \fBEOT\fP &_eo2)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoQuadOp\fP< \fBEOT\fP > & \fBop\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoInvalidateQuadOp< EOT >"
+One of the invalidator operators. 
+
+Use this one as a 'hat' on an operator that is defined to work on a generic datatype. This functor will then check the return type of the operator and invalidate the fitness of the individual.
+.PP
+This functor is used in algorithms that work with straight \fBeoMonOp\fP, \fBeoBinOp\fP or \fBeoQuadOp\fP operators, for instance \fBeoSGA\fP. Note that \fBeoGenOp\fP derived operators generally do invalidate the fitness of the objects they have changed.
+.PP
+Return value means 'Has_Changed' and not 'Needs_To_Be_Invalidated' as successive invalidation are not really a problem 
+.PP
+Definition at line 114 of file eoInvalidateOps.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoLinearFitScaling.3 b/trunk/paradiseo-eo/doc/man/man3/eoLinearFitScaling.3
new file mode 100644
index 000000000..8ffeb06bf
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoLinearFitScaling.3
@@ -0,0 +1,45 @@
+.TH "eoLinearFitScaling" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoLinearFitScaling \- An instance of \fBeoPerf2Worth\fP COmputes the linearly scaled fitnesses with given selective pressure Pselect(Best) == pressure/sizePop Pselect(average) == 1.0/sizePop truncate negative values to 0 -.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoPerf2Worth< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoLinearFitScaling\fP (double _p=2.0)"
+.br
+.ti -1c
+.RI "virtual void \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBpressure\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoLinearFitScaling< EOT >"
+An instance of \fBeoPerf2Worth\fP COmputes the linearly scaled fitnesses with given selective pressure Pselect(Best) == pressure/sizePop Pselect(average) == 1.0/sizePop truncate negative values to 0 -. 
+
+to be used within an \fBeoSelectFromWorth\fP object 
+.PP
+Definition at line 43 of file eoLinearFitScaling.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoLinearRandomSplit.3 b/trunk/paradiseo-eo/doc/man/man3/eoLinearRandomSplit.3
new file mode 100644
index 000000000..28f1bea51
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoLinearRandomSplit.3
@@ -0,0 +1,47 @@
+.TH "eoLinearRandomSplit" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoLinearRandomSplit \- random truncation - linear version  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoReduceSplit< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoLinearRandomSplit\fP (\fBeoHowMany\fP _howMany, bool _returnEliminated=false)"
+.br
+.RI "\fICtor: must provide amount of reduction, and whether or not you need to return the eliminated guys. \fP"
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_newgen, \fBeoPop\fP< \fBEOT\fP > &_eliminated)"
+.br
+.RI "\fIdo the job \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoHowMany\fP \fBhowMany\fP"
+.br
+.ti -1c
+.RI "bool \fBreturnEliminated\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoLinearRandomSplit< EOT >"
+random truncation - linear version 
+.PP
+Definition at line 163 of file eoReduceSplit.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoLinearTruncate.3 b/trunk/paradiseo-eo/doc/man/man3/eoLinearTruncate.3
new file mode 100644
index 000000000..49210b5d4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoLinearTruncate.3
@@ -0,0 +1,35 @@
+.TH "eoLinearTruncate" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoLinearTruncate \- a truncate class that does not sort, but repeatidely kills the worse.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoReduce< EOT >< EOT >\fP.
+.PP
+.SS "Private Member Functions"
+
+.in +1c
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_newgen, unsigned _newsize)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoLinearTruncate< EOT >"
+a truncate class that does not sort, but repeatidely kills the worse. 
+
+To be used in SSGA-like replacements (e.g. see \fBeoSSGAWorseReplacement\fP) 
+.PP
+Definition at line 167 of file eoReduce.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoLinearTruncateSplit.3 b/trunk/paradiseo-eo/doc/man/man3/eoLinearTruncateSplit.3
new file mode 100644
index 000000000..66fed4c74
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoLinearTruncateSplit.3
@@ -0,0 +1,49 @@
+.TH "eoLinearTruncateSplit" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoLinearTruncateSplit \- a ReduceSplit class that does not sort, but repeatidely kills the worse.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoReduceSplit< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoLinearTruncateSplit\fP (\fBeoHowMany\fP _howMany, bool _returnEliminated=false)"
+.br
+.RI "\fICtor: must provide amount of reduction, and whether or not you need to return the eliminated guys. \fP"
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_newgen, \fBeoPop\fP< \fBEOT\fP > &_eliminated)"
+.br
+.RI "\fIdo the job \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoHowMany\fP \fBhowMany\fP"
+.br
+.ti -1c
+.RI "bool \fBreturnEliminated\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoLinearTruncateSplit< EOT >"
+a ReduceSplit class that does not sort, but repeatidely kills the worse. 
+
+To be used in SSGA-like replacements (e.g. see \fBeoSSGAWorseReplacement\fP) 
+.PP
+Definition at line 87 of file eoReduceSplit.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoMGGReplacement.3 b/trunk/paradiseo-eo/doc/man/man3/eoMGGReplacement.3
new file mode 100644
index 000000000..08c812716
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoMGGReplacement.3
@@ -0,0 +1,49 @@
+.TH "eoMGGReplacement" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoMGGReplacement \- eoMGGReplacement is an \fBeoReplacement\fP: - choose N (2) parents RANDOMLY - remove them from the parent population - select best offspring, add to parents - merge (other?) offspring and the N removed parents - select best N-1 of this merged population (detTournament only at the moment) - put them back into parent population  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoReplacement< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoMGGReplacement\fP (\fBeoHowMany\fP _howManyEliminatedParents=\fBeoHowMany\fP(2, false), unsigned _tSize=2)"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_parents, \fBeoPop\fP< \fBEOT\fP > &_offspring)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoLinearTruncateSplit\fP< \fBEOT\fP > \fBsplit\fP"
+.br
+.ti -1c
+.RI "\fBeoPlus\fP< \fBEOT\fP > \fBplus\fP"
+.br
+.ti -1c
+.RI "unsigned int \fBtSize\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoMGGReplacement< EOT >"
+eoMGGReplacement is an \fBeoReplacement\fP: - choose N (2) parents RANDOMLY - remove them from the parent population - select best offspring, add to parents - merge (other?) offspring and the N removed parents - select best N-1 of this merged population (detTournament only at the moment) - put them back into parent population 
+.PP
+Definition at line 50 of file eoMGGReplacement.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoMOFitnessStat.3 b/trunk/paradiseo-eo/doc/man/man3/eoMOFitnessStat.3
new file mode 100644
index 000000000..252744946
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoMOFitnessStat.3
@@ -0,0 +1,44 @@
+.TH "eoMOFitnessStat" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoMOFitnessStat \- For multi-objective fitness, we need to translate a stat > into a vector, so each objective gets a seperate stat.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoSortedStat< EOT, std::vector< PartFitT > >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoMOFitnessStat\fP (unsigned _objective, std::string _description='MO-Fitness')"
+.br
+.RI "\fICtor: say what component you want. \fP"
+.ti -1c
+.RI "virtual void \fBoperator()\fP (const std::vector< const \fBEOT\fP * > &_popPters)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned int \fBobjective\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoMOFitnessStat< EOT, PartFitT >"
+For multi-objective fitness, we need to translate a stat > into a vector, so each objective gets a seperate stat. 
+.PP
+Definition at line 64 of file eoMOFitnessStat.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoMerge.3 b/trunk/paradiseo-eo/doc/man/man3/eoMerge.3
new file mode 100644
index 000000000..129bc10a4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoMerge.3
@@ -0,0 +1,29 @@
+.TH "eoMerge" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoMerge \- eoMerge: Base class for elitist replacement algorithms.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoBF< const eoPop< Chrom > &, eoPop< Chrom > &, void >\fP.
+.PP
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoMerge< Chrom >"
+eoMerge: Base class for elitist replacement algorithms. 
+
+Merges the old population (first argument), with the new generation
+.PP
+Its signature is exactly that of the selection base \fBeoSelect\fP, but its purpose is to merge the two populations into one (the second argument). Note that the algorithms assume that the second argument denotes the next generation. 
+.PP
+Definition at line 48 of file eoMerge.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoMergeReduce.3 b/trunk/paradiseo-eo/doc/man/man3/eoMergeReduce.3
new file mode 100644
index 000000000..a76fb4ebc
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoMergeReduce.3
@@ -0,0 +1,48 @@
+.TH "eoMergeReduce" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoMergeReduce \- eoMergeReduce: abstract replacement strategy that is just an application of an embedded merge, followed by an embedded reduce  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoReplacement< EOT >< EOT >\fP.
+.PP
+Inherited by \fBeoCommaReplacement< EOT >\fP, \fBeoEPReplacement< EOT >\fP, and \fBeoPlusReplacement< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoMergeReduce\fP (\fBeoMerge\fP< \fBEOT\fP > &_merge, \fBeoReduce\fP< \fBEOT\fP > &_reduce)"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_parents, \fBeoPop\fP< \fBEOT\fP > &_offspring)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoMerge\fP< \fBEOT\fP > & \fBmerge\fP"
+.br
+.ti -1c
+.RI "\fBeoReduce\fP< \fBEOT\fP > & \fBreduce\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoMergeReduce< EOT >"
+eoMergeReduce: abstract replacement strategy that is just an application of an embedded merge, followed by an embedded reduce 
+.PP
+Definition at line 50 of file eoMergeReduce.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoMonCloneOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoMonCloneOp.3
new file mode 100644
index 000000000..dd4e31cf1
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoMonCloneOp.3
@@ -0,0 +1,40 @@
+.TH "eoMonCloneOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoMonCloneOp \- Mon clone: one argument.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoMonCloneOp\fP ()"
+.br
+.RI "\fICtor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.ti -1c
+.RI "virtual bool \fBoperator()\fP (\fBEOT\fP &)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoMonCloneOp< EOT >"
+Mon clone: one argument. 
+.PP
+Definition at line 44 of file eoCloneOps.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoMonGenOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoMonGenOp.3
new file mode 100644
index 000000000..741abb6fe
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoMonGenOp.3
@@ -0,0 +1,50 @@
+.TH "eoMonGenOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoMonGenOp \- Wrapper for \fBeoMonOp\fP.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoGenOp< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoMonGenOp\fP (\fBeoMonOp\fP< \fBEOT\fP > &_op)"
+.br
+.ti -1c
+.RI "unsigned \fBmax_production\fP (void)"
+.br
+.RI "\fIMax production is used to reserve space for all elements that are used by the operator, not setting it properly can result in a crash. \fP"
+.ti -1c
+.RI "void \fBapply\fP (\fBeoPopulator\fP< \fBEOT\fP > &_it)"
+.br
+.RI "\fIthe function that will do the work \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoMonOp\fP< \fBEOT\fP > & \fBop\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoMonGenOp< EOT >"
+Wrapper for \fBeoMonOp\fP. 
+.PP
+Definition at line 85 of file eoGenOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoMonOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoMonOp.3
new file mode 100644
index 000000000..e2bea1345
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoMonOp.3
@@ -0,0 +1,38 @@
+.TH "eoMonOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoMonOp \- eoMonOp is the monary operator: genetic operator that takes only one \fBEO\fP.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoOp< EOType >< EOType >\fP, and \fBeoUF< EOType &, bool >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoMonOp\fP ()"
+.br
+.RI "\fICtor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoMonOp< EOType >"
+eoMonOp is the monary operator: genetic operator that takes only one \fBEO\fP. 
+
+When defining your own, make sure that you return a boolean value indicating that you have changed the content. 
+.PP
+Definition at line 101 of file eoOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoMonitor.3 b/trunk/paradiseo-eo/doc/man/man3/eoMonitor.3
new file mode 100644
index 000000000..fdee2bc5f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoMonitor.3
@@ -0,0 +1,68 @@
+.TH "eoMonitor" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoMonitor \- The abstract monitor class is a std::vector of parameter pointers.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoF< eoMonitor & >\fP.
+.PP
+Inherited by \fBeoFileMonitor\fP, \fBeoFileSnapshot\fP, \fBeoStdoutMonitor\fP, \fBeoTimedMonitor\fP, and MonitorWrapper.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual void \fBlastCall\fP ()"
+.br
+.ti -1c
+.RI "virtual void \fBadd\fP (const \fBeoParam\fP &_param)"
+.br
+.RI "\fIAdds a parameter to the monitor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.in -1c
+.SS "Protected Types"
+
+.in +1c
+.ti -1c
+.RI "typedef std::vector< const \fBeoParam\fP * >::iterator \fBiterator\fP"
+.br
+.in -1c
+.SS "Protected Attributes"
+
+.in +1c
+.ti -1c
+.RI "std::vector< const \fBeoParam\fP * > \fBvec\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+The abstract monitor class is a std::vector of parameter pointers. 
+
+Use either push_back a pointer or add a reference to a parameter. Derived classes will then implement the \fBoperator()(void)\fP which will stream or pipe the current values of the parameters to wherever you want it streamed or piped to. 
+.PP
+Definition at line 46 of file eoMonitor.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "virtual void eoMonitor::add (const \fBeoParam\fP & _param)\fC [inline, virtual]\fP"
+.PP
+Adds a parameter to the monitor. 
+.PP
+It is virtual so you can do some type checking in derived classes if you must. 
+.PP
+Reimplemented in \fBeoFDCFileSnapshot< EOT >\fP, and \fBeoFileSnapshot\fP.
+.PP
+Definition at line 56 of file eoMonitor.h.
+.PP
+Referenced by eoFileSnapshot::add().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoNDPlusReplacement.3 b/trunk/paradiseo-eo/doc/man/man3/eoNDPlusReplacement.3
new file mode 100644
index 000000000..b65b8da62
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoNDPlusReplacement.3
@@ -0,0 +1,53 @@
+.TH "eoNDPlusReplacement" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoNDPlusReplacement \- An elitist non-dominated sorted replacement scheme.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+Inherits \fBeoReplacement< EOT >< EOT >\fP, and \fBeoReplacement< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoNDPlusReplacement\fP (\fBeoPerf2Worth\fP< \fBEOT\fP, WorthT > &_perf2worth)"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_parents, \fBeoPop\fP< \fBEOT\fP > &_offspring)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.ti -1c
+.RI "\fBeoNDPlusReplacement\fP (\fBeoPerf2Worth\fP< \fBEOT\fP, WorthT > &_perf2worth)"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_parents, \fBeoPop\fP< \fBEOT\fP > &_offspring)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoPerf2Worth\fP< \fBEOT\fP, WorthT > & \fBperf2worth\fP"
+.br
+.ti -1c
+.RI "\fBeoPerf2Worth\fP< \fBEOT\fP, WorthT > & \fBperf2worth\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoNDPlusReplacement< EOT, WorthT >"
+An elitist non-dominated sorted replacement scheme. 
+
+Trying out an elitist non-dominated sorted replacement scheme. 
+.PP
+Definition at line 45 of file make_algo_pareto.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoNDSorting.3 b/trunk/paradiseo-eo/doc/man/man3/eoNDSorting.3
new file mode 100644
index 000000000..9b41bd3ea
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoNDSorting.3
@@ -0,0 +1,94 @@
+.TH "eoNDSorting" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoNDSorting \- Non dominated sorting, it *is a* std::vector of doubles, the integer part is the rank (to which front it belongs), the fractional part the niching penalty or distance penalty or whatever penalty you want to squeeze into the bits.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoPerf2WorthCached< EOT, double >\fP.
+.PP
+Inherited by \fBeoNDSorting_I< EOT >\fP, and \fBeoNDSorting_II< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoNDSorting\fP (bool nasty_flag_=false)"
+.br
+.ti -1c
+.RI "virtual std::vector< double > \fBniche_penalty\fP (const std::vector< unsigned > ¤t_front, const \fBeoPop\fP< \fBEOT\fP > &_pop)=0"
+.br
+.RI "\fIPure virtual function that calculates the 'distance' for each element in the current front Implement to create your own nondominated sorting algorithm. \fP"
+.ti -1c
+.RI "void \fBcalculate_worths\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIThe actual virtual function the derived classes should implement. \fP"
+.in -1c
+.SS "Public Attributes"
+
+.in +1c
+.ti -1c
+.RI "bool \fBnasty_declone_flag_that_only_is_implemented_for_two_objectives\fP"
+.br
+.in -1c
+.SS "Private Member Functions"
+
+.in +1c
+.ti -1c
+.RI "void \fBone_objective\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.ti -1c
+.RI "void \fBtwo_objectives\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIOptimization for two objectives. \fP"
+.ti -1c
+.RI "void \fBm_objectives\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.ti -1c
+.RI "void \fBrank_to_worth\fP ()"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoNDSorting< EOT >"
+Non dominated sorting, it *is a* std::vector of doubles, the integer part is the rank (to which front it belongs), the fractional part the niching penalty or distance penalty or whatever penalty you want to squeeze into the bits. 
+.PP
+Definition at line 42 of file eoNDSorting.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template virtual std::vector \fBeoNDSorting\fP< \fBEOT\fP >::niche_penalty (const std::vector< unsigned > & current_front, const \fBeoPop\fP< \fBEOT\fP > & _pop)\fC [pure virtual]\fP"
+.PP
+Pure virtual function that calculates the 'distance' for each element in the current front Implement to create your own nondominated sorting algorithm. 
+.PP
+The size of the returned std::vector should be equal to the size of the current_front. 
+.PP
+Implemented in \fBeoNDSorting_I< EOT >\fP, and \fBeoNDSorting_II< EOT >\fP.
+.PP
+Referenced by eoNDSorting< EOT >::two_objectives().
+.SS "template void \fBeoNDSorting\fP< \fBEOT\fP >::two_objectives (const \fBeoPop\fP< \fBEOT\fP > & _pop)\fC [inline, private]\fP"
+.PP
+Optimization for two objectives. 
+.PP
+Makes the algorithm run in complexity O(n log n) where n is the population size
+.PP
+This is the same complexity as for a single objective or truncation selection or sorting.
+.PP
+It will perform a sort on the two objectives seperately, and from the information on the ranks of the individuals on these two objectives, the non-dominated sorting rank is determined. There are then three nlogn operations in place: one sort per objective, plus a binary search procedure to combine the information about the ranks.
+.PP
+After that it is a simple exercise to calculate the distance penalty 
+.PP
+Definition at line 140 of file eoNDSorting.h.
+.PP
+References eoNDSorting< EOT >::niche_penalty(), and eoValueParam< std::vector< double > >::value().
+.PP
+Referenced by eoNDSorting< EOT >::calculate_worths().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoNDSorting_DummyEO.3 b/trunk/paradiseo-eo/doc/man/man3/eoNDSorting_DummyEO.3
new file mode 100644
index 000000000..f72972965
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoNDSorting_DummyEO.3
@@ -0,0 +1,30 @@
+.TH "eoNDSorting::DummyEO" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoNDSorting::DummyEO \- used in fast nondominated sorting \fBDummyEO\fP is just a storage place for fitnesses and to store the original index  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+Inherits \fBEO< EOT::Fitness >\fP.
+.PP
+.SS "Public Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBindex\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoNDSorting< EOT >::DummyEO"
+used in fast nondominated sorting \fBDummyEO\fP is just a storage place for fitnesses and to store the original index 
+.PP
+Definition at line 94 of file eoNDSorting.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoNDSorting_I.3 b/trunk/paradiseo-eo/doc/man/man3/eoNDSorting_I.3
new file mode 100644
index 000000000..1490b2be9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoNDSorting_I.3
@@ -0,0 +1,54 @@
+.TH "eoNDSorting_I" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoNDSorting_I \- The original Non Dominated Sorting algorithm from Srinivas and Deb.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoNDSorting< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoNDSorting_I\fP (double _nicheSize, bool nasty_flag_=false)"
+.br
+.ti -1c
+.RI "std::vector< double > \fBniche_penalty\fP (const std::vector< unsigned > ¤t_front, const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIPure virtual function that calculates the 'distance' for each element in the current front Implement to create your own nondominated sorting algorithm. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBnicheSize\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoNDSorting_I< EOT >"
+The original Non Dominated Sorting algorithm from Srinivas and Deb. 
+.PP
+Definition at line 380 of file eoNDSorting.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template std::vector \fBeoNDSorting_I\fP< \fBEOT\fP >::niche_penalty (const std::vector< unsigned > & current_front, const \fBeoPop\fP< \fBEOT\fP > & _pop)\fC [inline, virtual]\fP"
+.PP
+Pure virtual function that calculates the 'distance' for each element in the current front Implement to create your own nondominated sorting algorithm. 
+.PP
+The size of the returned std::vector should be equal to the size of the current_front. 
+.PP
+Implements \fBeoNDSorting< EOT >\fP.
+.PP
+Definition at line 385 of file eoNDSorting.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoNDSorting_II.3 b/trunk/paradiseo-eo/doc/man/man3/eoNDSorting_II.3
new file mode 100644
index 000000000..a255484d7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoNDSorting_II.3
@@ -0,0 +1,49 @@
+.TH "eoNDSorting_II" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoNDSorting_II \- Fast Elitist Non-Dominant Sorting Genetic Algorithm.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoNDSorting< EOT >< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef std::pair< double, unsigned > \fBdouble_index_pair\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoNDSorting_II\fP (bool nasty_flag_=false)"
+.br
+.ti -1c
+.RI "std::vector< double > \fBniche_penalty\fP (const std::vector< unsigned > &_cf, const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fI_cf points into the elements that consist of the current front \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoNDSorting_II< EOT >"
+Fast Elitist Non-Dominant Sorting Genetic Algorithm. 
+
+Adapted from Deb, Agrawal, Pratab and Meyarivan: A Fast Elitist Non-Dominant Sorting Genetic Algorithm for MultiObjective Optimization: NSGA-II KanGAL Report No. 200001
+.PP
+Note that this class does not do the sorting per se, but the sorting of it worth_std::vector will give the right order
+.PP
+The crowding distance is calculated as the sum of the distances to the nearest neighbours. As we need to return the penalty value, we have to invert that and invert it again in the base class, but such is life, sigh 
+.PP
+Definition at line 434 of file eoNDSorting.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoNPtsBitXover.3 b/trunk/paradiseo-eo/doc/man/man3/eoNPtsBitXover.3
new file mode 100644
index 000000000..1af960077
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoNPtsBitXover.3
@@ -0,0 +1,66 @@
+.TH "eoNPtsBitXover" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoNPtsBitXover \- eoNPtsBitXover --> n-point crossover  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoQuadOp< Chrom >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoNPtsBitXover\fP (const unsigned &_num_points=2)"
+.br
+.RI "\fI(Default) Constructor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIThe class name. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (Chrom &chrom1, Chrom &chrom2)"
+.br
+.RI "\fIn-point crossover for binary chromosomes. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBnum_points\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoNPtsBitXover< Chrom >"
+eoNPtsBitXover --> n-point crossover 
+.PP
+Definition at line 319 of file eoBitOp.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template bool \fBeoNPtsBitXover\fP< Chrom >::operator() (Chrom & chrom1, Chrom & chrom2)\fC [inline, virtual]\fP"
+.PP
+n-point crossover for binary chromosomes. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIchrom1\fP The first chromosome. 
+.br
+\fIchrom2\fP The first chromosome. 
+.RE
+.PP
+
+.PP
+Implements \fBeoBF< Chrom &, Chrom &, bool >\fP.
+.PP
+Definition at line 337 of file eoBitOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoNegExpGenerator.3 b/trunk/paradiseo-eo/doc/man/man3/eoNegExpGenerator.3
new file mode 100644
index 000000000..9f661f663
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoNegExpGenerator.3
@@ -0,0 +1,48 @@
+.TH "eoNegExpGenerator" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoNegExpGenerator \- The class \fBnegexp_generator\fP can be used in the STL generate function to easily generate negative exponential distributed floats and doubles.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoRndGenerator< T >< T >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoNegExpGenerator\fP (T _mean=1.0, \fBeoRng\fP &_rng=rng)"
+.br
+.ti -1c
+.RI "T \fBoperator()\fP (void)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "T \fBmean\fP"
+.br
+.ti -1c
+.RI "\fBeoRng\fP & \fBnegexp\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoNegExpGenerator< T >"
+The class \fBnegexp_generator\fP can be used in the STL generate function to easily generate negative exponential distributed floats and doubles. 
+
+The user can supply a mean. 
+.PP
+Definition at line 137 of file eoRndGenerators.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoNegExpInit.3 b/trunk/paradiseo-eo/doc/man/man3/eoNegExpInit.3
new file mode 100644
index 000000000..99e17ca34
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoNegExpInit.3
@@ -0,0 +1,48 @@
+.TH "eoNegExpInit" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoNegExpInit \- The class \fBnegexp_generator\fP can be used in the STL generate function to easily generate negative exponential distributed floats and doubles.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoInit< T >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoNegExpInit\fP (T _mean=1.0, \fBeoRng\fP &_rng=rng)"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (T &_t)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "T \fBmean\fP"
+.br
+.ti -1c
+.RI "\fBeoRng\fP & \fBnegexp\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoNegExpInit< T >"
+The class \fBnegexp_generator\fP can be used in the STL generate function to easily generate negative exponential distributed floats and doubles. 
+
+The user can supply a mean. 
+.PP
+Definition at line 143 of file eoUniformInit.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoNoElitism.3 b/trunk/paradiseo-eo/doc/man/man3/eoNoElitism.3
new file mode 100644
index 000000000..4028a927e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoNoElitism.3
@@ -0,0 +1,25 @@
+.TH "eoNoElitism" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoNoElitism \- No elite.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoElitism< EOT >< EOT >\fP.
+.PP
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoNoElitism< EOT >"
+No elite. 
+.PP
+Definition at line 107 of file eoMerge.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoNoPerf2Worth.3 b/trunk/paradiseo-eo/doc/man/man3/eoNoPerf2Worth.3
new file mode 100644
index 000000000..39dd45443
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoNoPerf2Worth.3
@@ -0,0 +1,33 @@
+.TH "eoNoPerf2Worth" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoNoPerf2Worth \- A dummy perf2worth, just in case you need it.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoPerf2Worth< EOT, EOT::Fitness >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "void \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoNoPerf2Worth< EOT >"
+A dummy perf2worth, just in case you need it. 
+.PP
+Definition at line 230 of file eoPerf2Worth.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoNoSelect.3 b/trunk/paradiseo-eo/doc/man/man3/eoNoSelect.3
new file mode 100644
index 000000000..c85a5fd2f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoNoSelect.3
@@ -0,0 +1,44 @@
+.TH "eoNoSelect" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoNoSelect \- eoNoSelect: returns all individual in order WITHOUT USING FITNESS!!! looping back to the beginning when exhasuted  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoSelectOne< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoNoSelect\fP ()"
+.br
+.RI "\fICtor. \fP"
+.ti -1c
+.RI "virtual const \fBEOT\fP & \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBcurrent\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoNoSelect< EOT >"
+eoNoSelect: returns all individual in order WITHOUT USING FITNESS!!! looping back to the beginning when exhasuted 
+.PP
+Definition at line 78 of file eoRandomSelect.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoNormalGenerator.3 b/trunk/paradiseo-eo/doc/man/man3/eoNormalGenerator.3
new file mode 100644
index 000000000..89bbae7e0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoNormalGenerator.3
@@ -0,0 +1,48 @@
+.TH "eoNormalGenerator" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoNormalGenerator \- The class \fBnormal_generator\fP can be used in the STL generate function to easily generate gaussian distributed floats and doubles.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoRndGenerator< T >< T >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoNormalGenerator\fP (T _stdev=T(1.0), \fBeoRng\fP &_rng=rng)"
+.br
+.ti -1c
+.RI "T \fBoperator()\fP (void)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "T \fBstdev\fP"
+.br
+.ti -1c
+.RI "\fBeoRng\fP & \fBnormal\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoNormalGenerator< T >"
+The class \fBnormal_generator\fP can be used in the STL generate function to easily generate gaussian distributed floats and doubles. 
+
+The user can supply a standard deviation which defaults to 1. 
+.PP
+Definition at line 120 of file eoRndGenerators.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoNormalInit.3 b/trunk/paradiseo-eo/doc/man/man3/eoNormalInit.3
new file mode 100644
index 000000000..055285bae
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoNormalInit.3
@@ -0,0 +1,48 @@
+.TH "eoNormalInit" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoNormalInit \- The class \fBnormal_generator\fP can be used in the STL generate function to easily generate gaussian distributed floats and doubles.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoInit< T >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoNormalInit\fP (T _stdev=T(1.0), \fBeoRng\fP &_rng=rng)"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (T &_t)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "T \fBstdev\fP"
+.br
+.ti -1c
+.RI "\fBeoRng\fP & \fBnormal\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoNormalInit< T >"
+The class \fBnormal_generator\fP can be used in the STL generate function to easily generate gaussian distributed floats and doubles. 
+
+The user can supply a standard deviation which defaults to 1. 
+.PP
+Definition at line 126 of file eoUniformInit.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoNormalMutation.3 b/trunk/paradiseo-eo/doc/man/man3/eoNormalMutation.3
new file mode 100644
index 000000000..d0c18e0f7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoNormalMutation.3
@@ -0,0 +1,124 @@
+.TH "eoNormalMutation" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoNormalMutation \- Simple normal mutation of a std::vector of real values.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< EOT >\fP.
+.PP
+Inherited by \fBeoOneFifthMutation< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoNormalMutation\fP (double &_sigma, const double &_p_change=1.0)"
+.br
+.RI "\fI(Default) Constructor. \fP"
+.ti -1c
+.RI "\fBeoNormalMutation\fP (\fBeoRealVectorBounds\fP &_bounds, double _sigma, const double &_p_change=1.0)"
+.br
+.RI "\fIConstructor with bounds. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIThe class name. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eo)"
+.br
+.RI "\fIDo it! \fP"
+.ti -1c
+.RI "double & \fBSigma\fP ()"
+.br
+.RI "\fIAccessor to ref to sigma - for update and monitor. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double & \fBsigma\fP"
+.br
+.ti -1c
+.RI "\fBeoRealVectorBounds\fP & \fBbounds\fP"
+.br
+.ti -1c
+.RI "double \fBp_change\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoNormalMutation< EOT >"
+Simple normal mutation of a std::vector of real values. 
+
+The stDev is fixed - but it is passed ans stored as a reference, to enable dynamic mutations (see eoOenFithMutation below).
+.PP
+As for the bounds, the values are here folded back into the bounds. The other possiblity would be to iterate until we fall inside the bounds - but this sometimes takes a long time!!! 
+.PP
+Definition at line 116 of file eoNormalMutation.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoNormalMutation\fP< \fBEOT\fP >::\fBeoNormalMutation\fP (double & _sigma, const double & _p_change = \fC1.0\fP)\fC [inline]\fP"
+.PP
+(Default) Constructor. 
+.PP
+The bounds are initialized with the global object that says: no bounds.
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_sigma\fP the range for uniform nutation 
+.br
+\fI_p_change\fP the probability to change a given coordinate 
+.RE
+.PP
+
+.PP
+Definition at line 127 of file eoNormalMutation.h.
+.SS "template \fBeoNormalMutation\fP< \fBEOT\fP >::\fBeoNormalMutation\fP (\fBeoRealVectorBounds\fP & _bounds, double _sigma, const double & _p_change = \fC1.0\fP)\fC [inline]\fP"
+.PP
+Constructor with bounds. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_bounds\fP an \fBeoRealVectorBounds\fP that contains the bounds 
+.br
+\fI_sigma\fP the range for uniform nutation 
+.br
+\fI_p_change\fP the probability to change a given coordinate 
+.RE
+.PP
+
+.PP
+Definition at line 136 of file eoNormalMutation.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template bool \fBeoNormalMutation\fP< \fBEOT\fP >::operator() (\fBEOT\fP & _eo)\fC [inline, virtual]\fP"
+.PP
+Do it! 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_eo\fP The cromosome undergoing the mutation 
+.RE
+.PP
+
+.PP
+Implements \fBeoUF< EOT &, bool >\fP.
+.PP
+Reimplemented in \fBeoOneFifthMutation< EOT >\fP.
+.PP
+Definition at line 147 of file eoNormalMutation.h.
+.PP
+References eoRng::flip(), eoRealBaseVectorBounds::foldsInBounds(), and eoRng::normal().
+.PP
+Referenced by eoOneFifthMutation< EOT >::operator()().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoNormalVecMutation.3 b/trunk/paradiseo-eo/doc/man/man3/eoNormalVecMutation.3
new file mode 100644
index 000000000..7b0e87fb9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoNormalVecMutation.3
@@ -0,0 +1,116 @@
+.TH "eoNormalVecMutation" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoNormalVecMutation \- Simple normal mutation of a std::vector of real values.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoNormalVecMutation\fP (double _sigma, const double &_p_change=1.0)"
+.br
+.RI "\fI(Default) Constructor. \fP"
+.ti -1c
+.RI "\fBeoNormalVecMutation\fP (\fBeoRealVectorBounds\fP &_bounds, double _sigma, const double &_p_change=1.0)"
+.br
+.RI "\fIConstructor with bounds. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIThe class name. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eo)"
+.br
+.RI "\fIDo it! \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "std::vector< double > \fBsigma\fP"
+.br
+.ti -1c
+.RI "\fBeoRealVectorBounds\fP & \fBbounds\fP"
+.br
+.ti -1c
+.RI "double \fBp_change\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoNormalVecMutation< EOT >"
+Simple normal mutation of a std::vector of real values. 
+
+The stDev is fixed - but it is passed ans stored as a reference, to enable dynamic mutations (see eoOenFithMutation below).
+.PP
+As for the bounds, the values are here folded back into the bounds. The other possiblity would be to iterate until we fall inside the bounds - but this sometimes takes a long time!!! 
+.PP
+Definition at line 48 of file eoNormalMutation.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoNormalVecMutation\fP< \fBEOT\fP >::\fBeoNormalVecMutation\fP (double _sigma, const double & _p_change = \fC1.0\fP)\fC [inline]\fP"
+.PP
+(Default) Constructor. 
+.PP
+The bounds are initialized with the global object that says: no bounds.
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_sigma\fP the range for uniform nutation 
+.br
+\fI_p_change\fP the probability to change a given coordinate 
+.RE
+.PP
+
+.PP
+Definition at line 58 of file eoNormalMutation.h.
+.SS "template \fBeoNormalVecMutation\fP< \fBEOT\fP >::\fBeoNormalVecMutation\fP (\fBeoRealVectorBounds\fP & _bounds, double _sigma, const double & _p_change = \fC1.0\fP)\fC [inline]\fP"
+.PP
+Constructor with bounds. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_bounds\fP an \fBeoRealVectorBounds\fP that contains the bounds 
+.br
+\fI_sigma\fP the range for uniform nutation 
+.br
+\fI_p_change\fP the probability to change a given coordinate
+.RE
+.PP
+for each component, the sigma is scaled to the range of the bound, if bounded 
+.PP
+Definition at line 69 of file eoNormalMutation.h.
+.PP
+References eoRealBaseVectorBounds::isBounded(), and eoRealBaseVectorBounds::range().
+.SH "Member Function Documentation"
+.PP 
+.SS "template bool \fBeoNormalVecMutation\fP< \fBEOT\fP >::operator() (\fBEOT\fP & _eo)\fC [inline, virtual]\fP"
+.PP
+Do it! 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_eo\fP The cromosome undergoing the mutation 
+.RE
+.PP
+
+.PP
+Implements \fBeoUF< EOT &, bool >\fP.
+.PP
+Definition at line 86 of file eoNormalMutation.h.
+.PP
+References eoRng::flip(), eoRealBaseVectorBounds::foldsInBounds(), and eoRng::normal().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoNthElementFitnessStat.3 b/trunk/paradiseo-eo/doc/man/man3/eoNthElementFitnessStat.3
new file mode 100644
index 000000000..b65a75a26
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoNthElementFitnessStat.3
@@ -0,0 +1,63 @@
+.TH "eoNthElementFitnessStat" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoNthElementFitnessStat \- The n_th element fitness in the population (see \fBeoBestFitnessStat\fP).  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoSortedStat< EOT, EOT::Fitness >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::Fitness \fBFitness\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoNthElementFitnessStat\fP (unsigned _whichElement, std::string _description='nth element fitness')"
+.br
+.ti -1c
+.RI "virtual void \fBoperator()\fP (const std::vector< const \fBEOT\fP * > &_pop)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.in -1c
+.SS "Private Member Functions"
+
+.in +1c
+.ti -1c
+.RI "template void \fBdoit\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop, \fBeoParetoFitness\fP< T >)"
+.br
+.ti -1c
+.RI "template void \fBdoit\fP (const std::vector< const \fBEOT\fP * > &_pop, T)"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBwhichElement\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoNthElementFitnessStat< EOT >"
+The n_th element fitness in the population (see \fBeoBestFitnessStat\fP). 
+.PP
+Definition at line 211 of file eoStat.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoObject.3 b/trunk/paradiseo-eo/doc/man/man3/eoObject.3
new file mode 100644
index 000000000..5cb742903
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoObject.3
@@ -0,0 +1,59 @@
+.TH "eoObject" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoObject \- eoObject used to be the base class for the whole hierarchy, but this has changed.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherited by \fBEO< F >\fP, \fBEO< double >\fP, \fBEO< EOT::Fitness >\fP, \fBEO< Fit >\fP, \fBEO< Fitness >\fP, \fBEO< fitness_type >\fP, \fBEO< fitnessT >\fP, \fBEO< FitT >\fP, \fBEO< FType >\fP, \fBEO< phenotype >\fP, \fBEO< PyFitness >\fP, \fBeoDistribution< EOT >\fP, \fBeoFactory< EOClass >\fP, \fBeoFactory< eoOpSelector< eoClass > >\fP, \fBeoFactory< eoSelect< EOT > >\fP, \fBeoFactory< EOT >\fP, \fBeoParser\fP, \fBeoPop< EOT >\fP, \fBeoPop< Dummy >\fP, \fBeoPop< PyEO >\fP, and \fBeoRng\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual \fB~eoObject\fP ()"
+.br
+.RI "\fIVirtual dtor. They are needed in virtual class hierarchies. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const =0"
+.br
+.RI "\fIReturn the class id. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+eoObject used to be the base class for the whole hierarchy, but this has changed. 
+
+eoObject is used to define a name (\fBclassName\fP#) that is used when loading or saving the state.
+.PP
+Previously, this object also defined a print and read interface, but it´s been moved to \fBeoPrintable\fP and \fBeoPersistent\fP.
+.PP
+It is recommended that you only derive from eoObject in concrete classes. Some parts of \fBEO\fP do not implement this yet, but that will change in the future. eoObject, together with \fBeoPersistent\fP and \fBeoPrintable\fP provide a simple persistence framework that is only needed when the classes have state that changes at runtime.
+.PP
+\fBSee also:\fP
+.RS 4
+\fBeoPersistent\fP \fBeoPrintable\fP, \fBeoState\fP 
+.RE
+.PP
+
+.PP
+Definition at line 55 of file eoObject.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "virtual std::string eoObject::className () const\fC [pure virtual]\fP"
+.PP
+Return the class id. 
+.PP
+This should be redefined in each class. Only 'leaf' classes can be non-virtual.
+.PP
+Maarten: removed the default implementation as this proved to be too error-prone: I found several classes that had a typo in className (like classname), which would print eoObject instead of their own. Having it pure will force the implementor to provide a name. 
+.PP
+Implemented in \fBEO< F >\fP, \fBeoFactory< EOClass >\fP, \fBeoOpSelMason< eoClass >\fP, \fBeoPop< EOT >\fP, \fBeoEsFull< Fit >\fP, \fBeoEsSimple< Fit >\fP, \fBeoEsStdev< Fit >\fP, \fBeoReal< FitT >\fP, \fBeoBit< FitT >\fP, \fBeoPBILDistrib< EOT >\fP, \fBeoParseTree< FType, Node >\fP, \fBeoString< fitnessT >\fP, \fBeoParser\fP, \fBeoRng\fP, \fBeoOneMax< FitT >\fP, \fBEO< double >\fP, \fBEO< EOT::Fitness >\fP, \fBEO< FitT >\fP, \fBEO< phenotype >\fP, \fBEO< fitnessT >\fP, \fBEO< Fit >\fP, \fBEO< FType >\fP, \fBEO< fitness_type >\fP, \fBEO< Fitness >\fP, \fBEO< PyFitness >\fP, \fBeoFactory< eoOpSelector< eoClass > >\fP, \fBeoFactory< EOT >\fP, \fBeoFactory< eoSelect< EOT > >\fP, \fBeoPop< PyEO >\fP, and \fBeoPop< Dummy >\fP.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoOneFifthMutation.3 b/trunk/paradiseo-eo/doc/man/man3/eoOneFifthMutation.3
new file mode 100644
index 000000000..3951a10f0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoOneFifthMutation.3
@@ -0,0 +1,114 @@
+.TH "eoOneFifthMutation" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoOneFifthMutation \- the dynamic version: just say it is updatable - and write the \fBupdate()\fP method! here the 1 fifth rule: count the proportion of successful mutations, and increase sigma if more than threshold (1/5 !)  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoNormalMutation< EOT >< EOT >\fP, and \fBeoUpdatable\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::Fitness \fBFitness\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoOneFifthMutation\fP (\fBeoEvalFunc\fP< \fBEOT\fP > &_eval, double &_sigmaInit, unsigned _windowSize=10, double _updateFactor=0.83, double _threshold=0.2)"
+.br
+.RI "\fI(Default) Constructor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIThe class name. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eo)"
+.br
+.RI "\fIDo it! calls the standard mutation, then checks for success and updates stats. \fP"
+.ti -1c
+.RI "void \fBupdate\fP ()"
+.br
+.RI "\fIthe method that will be called every generation if the object is added to the checkpoint \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoEvalFunc\fP< \fBEOT\fP > & \fBeval\fP"
+.br
+.ti -1c
+.RI "double \fBthreshold\fP"
+.br
+.ti -1c
+.RI "double \fBupdateFactor\fP"
+.br
+.ti -1c
+.RI "std::vector< unsigned > \fBnbMut\fP"
+.br
+.ti -1c
+.RI "std::vector< unsigned > \fBnbSuccess\fP"
+.br
+.ti -1c
+.RI "unsigned \fBgenIndex\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoOneFifthMutation< EOT >"
+the dynamic version: just say it is updatable - and write the \fBupdate()\fP method! here the 1 fifth rule: count the proportion of successful mutations, and increase sigma if more than threshold (1/5 !) 
+.PP
+Definition at line 177 of file eoNormalMutation.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoOneFifthMutation\fP< \fBEOT\fP >::\fBeoOneFifthMutation\fP (\fBeoEvalFunc\fP< \fBEOT\fP > & _eval, double & _sigmaInit, unsigned _windowSize = \fC10\fP, double _updateFactor = \fC0.83\fP, double _threshold = \fC0.2\fP)\fC [inline]\fP"
+.PP
+(Default) Constructor. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIeval\fP the evaluation function, needed to recompute the fitmess 
+.br
+\fI_sigmaInit\fP the initial value for uniform mutation 
+.br
+\fI_windowSize\fP the size of the window for statistics 
+.br
+\fI_threshold\fP the threshold (the 1/5 - 0.2) 
+.br
+\fI_updateFactor\fP multiplicative update factor for sigma 
+.RE
+.PP
+
+.PP
+Definition at line 195 of file eoNormalMutation.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template bool \fBeoOneFifthMutation\fP< \fBEOT\fP >::operator() (\fBEOT\fP & _eo)\fC [inline, virtual]\fP"
+.PP
+Do it! calls the standard mutation, then checks for success and updates stats. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_eo\fP The chromosome undergoing the mutation 
+.RE
+.PP
+
+.PP
+Reimplemented from \fBeoNormalMutation< EOT >\fP.
+.PP
+Definition at line 216 of file eoNormalMutation.h.
+.PP
+References EO< F >::fitness(), EO< F >::invalid(), EO< F >::invalidate(), and eoNormalMutation< EOT >::operator()().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoOneMax.3 b/trunk/paradiseo-eo/doc/man/man3/eoOneMax.3
new file mode 100644
index 000000000..ea5244ed0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoOneMax.3
@@ -0,0 +1,109 @@
+.TH "eoOneMax" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoOneMax \- Always write a comment in this format before class definition if you want the class to be documented by Doxygen.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBEO< FitT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoOneMax\fP ()"
+.br
+.RI "\fICtor: you MUST provide a default ctor. \fP"
+.ti -1c
+.RI "virtual string \fBclassName\fP () const "
+.br
+.RI "\fIReturn the class id. \fP"
+.ti -1c
+.RI "void \fBprintOn\fP (ostream &_os) const "
+.br
+.RI "\fIprinting... \fP"
+.ti -1c
+.RI "void \fBreadFrom\fP (istream &_is)"
+.br
+.RI "\fIreading... \fP"
+.ti -1c
+.RI "void \fBsetB\fP (vector< bool > &_b)"
+.br
+.ti -1c
+.RI "const vector< bool > & \fBB\fP ()"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "std::vector< bool > \fBb\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoOneMax< FitT >"
+Always write a comment in this format before class definition if you want the class to be documented by Doxygen. 
+
+Note that you MUST derive your structure from EO but you MAY use some other already prepared class in the hierarchy like \fBeoVector\fP for instance, if you handle a vector of something....
+.PP
+If you create a structure from scratch, the only thing you need to provide are a default constructor IO routines printOn and readFrom
+.PP
+Note that operator<< and operator>> are defined at \fBEO\fP level using these routines 
+.PP
+Definition at line 31 of file eoOneMax.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoOneMax\fP< \fBFitT\fP >::\fBeoOneMax\fP ()\fC [inline]\fP"
+.PP
+Ctor: you MUST provide a default ctor. 
+.PP
+though such individuals will generally be processed by some \fBeoInit\fP object 
+.PP
+Definition at line 37 of file eoOneMax.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template virtual string \fBeoOneMax\fP< \fBFitT\fP >::className (void) const\fC [inline, virtual]\fP"
+.PP
+Return the class id. 
+.PP
+\fBReturns:\fP
+.RS 4
+the class name as a std::string 
+.RE
+.PP
+
+.PP
+Reimplemented from \fBEO< FitT >\fP.
+.PP
+Definition at line 49 of file eoOneMax.h.
+.SS "template void \fBeoOneMax\fP< \fBFitT\fP >::printOn (ostream & _os) const\fC [inline]\fP"
+.PP
+printing... 
+.PP
+HINTS in \fBEO\fP we systematically write the sizes of things before the things so readFrom is easier to code (see below)
+.PP
+Definition at line 52 of file eoOneMax.h.
+.PP
+References EO< F >::printOn().
+.SS "template void \fBeoOneMax\fP< \fBFitT\fP >::readFrom (istream & _is)\fC [inline]\fP"
+.PP
+reading... 
+.PP
+of course, your readFrom must be able to read what printOn writes!!!
+.PP
+HINTS remember the eoOneMax object will come from the default ctor this is why having the sizes written out is useful 
+.PP
+Definition at line 72 of file eoOneMax.h.
+.PP
+References EO< F >::readFrom().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoOneMaxEvalFunc.3 b/trunk/paradiseo-eo/doc/man/man3/eoOneMaxEvalFunc.3
new file mode 100644
index 000000000..7da0ee070
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoOneMaxEvalFunc.3
@@ -0,0 +1,55 @@
+.TH "eoOneMaxEvalFunc" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoOneMaxEvalFunc \- Always write a comment in this format before class definition if you want the class to be documented by Doxygen.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoEvalFunc< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoOneMaxEvalFunc\fP ()"
+.br
+.RI "\fICtor - no requirement. \fP"
+.ti -1c
+.RI "void \fBoperator()\fP (\fBEOT\fP &_eo)"
+.br
+.RI "\fIActually compute the fitness. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoOneMaxEvalFunc< EOT >"
+Always write a comment in this format before class definition if you want the class to be documented by Doxygen. 
+.PP
+Definition at line 26 of file eoOneMaxEvalFunc.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template void \fBeoOneMaxEvalFunc\fP< \fBEOT\fP >::operator() (\fBEOT\fP & _eo)\fC [inline, virtual]\fP"
+.PP
+Actually compute the fitness. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIEOT\fP & _eo the \fBEO\fP object to evaluate it should stay templatized to be usable with any fitness type 
+.RE
+.PP
+
+.PP
+Implements \fBeoUF< EOT &, void >\fP.
+.PP
+Definition at line 45 of file eoOneMaxEvalFunc.h.
+.PP
+References EO< F >::fitness(), and EO< F >::invalid().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoOneMaxInit.3 b/trunk/paradiseo-eo/doc/man/man3/eoOneMaxInit.3
new file mode 100644
index 000000000..9f65e8e94
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoOneMaxInit.3
@@ -0,0 +1,64 @@
+.TH "eoOneMaxInit" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoOneMaxInit \- Always write a comment in this format before class definition if you want the class to be documented by Doxygen.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoInit< GenotypeT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoOneMaxInit\fP (unsigned _vecSize)"
+.br
+.RI "\fICtor - no requirement. \fP"
+.ti -1c
+.RI "void \fBoperator()\fP (GenotypeT &_genotype)"
+.br
+.RI "\fIinitialize a genotype \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBvecSize\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoOneMaxInit< GenotypeT >"
+Always write a comment in this format before class definition if you want the class to be documented by Doxygen. 
+
+There is NO ASSUMPTION on the class GenoypeT. In particular, it does not need to derive from \fBEO\fP (e.g. to initialize atoms of an \fBeoVector\fP you will need an \fBeoInit\fP) 
+.PP
+Definition at line 26 of file eoOneMaxInit.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template void \fBeoOneMaxInit\fP< GenotypeT >::operator() (GenotypeT & _genotype)\fC [inline, virtual]\fP"
+.PP
+initialize a genotype 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_genotype\fP generally a genotype that has been default-constructed whatever it contains will be lost 
+.RE
+.PP
+
+.PP
+Implements \fBeoUF< GenotypeT &, void >\fP.
+.PP
+Definition at line 44 of file eoOneMaxInit.h.
+.PP
+References eoRng::flip().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoOneMaxMutation.3 b/trunk/paradiseo-eo/doc/man/man3/eoOneMaxMutation.3
new file mode 100644
index 000000000..98bbb5448
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoOneMaxMutation.3
@@ -0,0 +1,60 @@
+.TH "eoOneMaxMutation" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoOneMaxMutation \- Always write a comment in this format before class definition if you want the class to be documented by Doxygen.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< GenotypeT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoOneMaxMutation\fP ()"
+.br
+.RI "\fICtor - no requirement. \fP"
+.ti -1c
+.RI "string \fBclassName\fP () const "
+.br
+.RI "\fIThe class name. Used to display statistics. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (GenotypeT &_genotype)"
+.br
+.RI "\fImodifies the parent \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoOneMaxMutation< GenotypeT >"
+Always write a comment in this format before class definition if you want the class to be documented by Doxygen. 
+
+THere is NO ASSUMPTION on the class GenoypeT. In particular, it does not need to derive from \fBEO\fP 
+.PP
+Definition at line 25 of file eoOneMaxMutation.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template bool \fBeoOneMaxMutation\fP< GenotypeT >::operator() (GenotypeT & _genotype)\fC [inline, virtual]\fP"
+.PP
+modifies the parent 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_genotype\fP The parent genotype (will be modified)
+.RE
+.PP
+.PP
+Requirement if (_genotype has been modified) isModified = true; else isModified = false; 
+.PP
+Implements \fBeoUF< GenotypeT &, bool >\fP.
+.PP
+Definition at line 47 of file eoOneMaxMutation.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoOneMaxQuadCrossover.3 b/trunk/paradiseo-eo/doc/man/man3/eoOneMaxQuadCrossover.3
new file mode 100644
index 000000000..12a2e8d5a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoOneMaxQuadCrossover.3
@@ -0,0 +1,62 @@
+.TH "eoOneMaxQuadCrossover" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoOneMaxQuadCrossover \- Always write a comment in this format before class definition if you want the class to be documented by Doxygen.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoQuadOp< GenotypeT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoOneMaxQuadCrossover\fP ()"
+.br
+.RI "\fICtor - no requirement. \fP"
+.ti -1c
+.RI "string \fBclassName\fP () const "
+.br
+.RI "\fIThe class name. Used to display statistics. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (GenotypeT &_genotype1, GenotypeT &_genotype2)"
+.br
+.RI "\fIeoQuad crossover - modifies both parents \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoOneMaxQuadCrossover< GenotypeT >"
+Always write a comment in this format before class definition if you want the class to be documented by Doxygen. 
+
+THere is NO ASSUMPTION on the class GenoypeT. In particular, it does not need to derive from \fBEO\fP 
+.PP
+Definition at line 26 of file eoOneMaxQuadCrossover.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template bool \fBeoOneMaxQuadCrossover\fP< GenotypeT >::operator() (GenotypeT & _genotype1, GenotypeT & _genotype2)\fC [inline, virtual]\fP"
+.PP
+eoQuad crossover - modifies both parents 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_genotype1\fP The first parent 
+.br
+\fI_genotype2\fP The second parent
+.RE
+.PP
+.PP
+Requirement if (at least one genotype has been modified) // no way to distinguish oneAtLeastIsModified = true; else oneAtLeastIsModified = false; 
+.PP
+Implements \fBeoBF< GenotypeT &, GenotypeT &, bool >\fP.
+.PP
+Definition at line 49 of file eoOneMaxQuadCrossover.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoOp.3
new file mode 100644
index 000000000..ca16766e1
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoOp.3
@@ -0,0 +1,54 @@
+.TH "eoOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoOp \- Abstract data types for \fBEO\fP operators.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherited by \fBeoBinOp< EOType >\fP, \fBeoMonOp< EOType >\fP, and \fBeoQuadOp< EOType >\fP.
+.PP
+.SS "[NOHEADER]"
+
+.in +1c
+.ti -1c
+.RI "enum \fBOpType\fP { \fBunary\fP =  0, \fBbinary\fP =  1, \fBquadratic\fP =  2, \fBgeneral\fP =  3 }"
+.br
+.ti -1c
+.RI "\fBeoOp\fP (OpType _type)"
+.br
+.RI "\fICtor. \fP"
+.ti -1c
+.RI "\fBeoOp\fP (const \fBeoOp\fP &_eop)"
+.br
+.RI "\fICopy Ctor. \fP"
+.ti -1c
+.RI "virtual \fB~eoOp\fP ()"
+.br
+.RI "\fINeeded virtual destructor. \fP"
+.ti -1c
+.RI "OpType \fBgetType\fP () const "
+.br
+.RI "\fIgetType: number of operands it takes and individuals it produces \fP"
+.ti -1c
+.RI "OpType \fBopType\fP"
+.br
+.RI "\fIOpType is the type of the operator: how many operands it takes and how many it produces. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoOp< EOType >"
+Abstract data types for \fBEO\fP operators. 
+
+Genetic operators act on chromosomes, changing them. The type to use them on is problem specific. If your genotype is a std::vector, there are operators that work specifically on std::vector, but you might also find that generic operators working on std::vector are what you need. 
+.PP
+Definition at line 68 of file eoOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoOpContainer.3 b/trunk/paradiseo-eo/doc/man/man3/eoOpContainer.3
new file mode 100644
index 000000000..255957301
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoOpContainer.3
@@ -0,0 +1,81 @@
+.TH "eoOpContainer" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoOpContainer \- eoOpContainer is a base class for the sequential and proportional selectors It takes care of wrapping the other operators, and deleting stuff that it has allocated  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoGenOp< EOT >< EOT >\fP.
+.PP
+Inherited by \fBeoProportionalOp< EOT >\fP, and \fBeoSequentialOp< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoOpContainer\fP ()"
+.br
+.RI "\fICtor: nothing much to do. \fP"
+.ti -1c
+.RI "virtual \fB~eoOpContainer\fP (void)"
+.br
+.RI "\fIDtor: delete all the GenOps created when wrapping simple ops. \fP"
+.ti -1c
+.RI "virtual unsigned \fBmax_production\fP (void)"
+.br
+.RI "\fIfor memory management (doesn't have to be very precise \fP"
+.ti -1c
+.RI "void \fBadd\fP (\fBeoOp\fP< \fBEOT\fP > &_op, double _rate)"
+.br
+.RI "\fIAdd an operator to the container, also give it a rate. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const =0"
+.br
+.in -1c
+.SS "Protected Attributes"
+
+.in +1c
+.ti -1c
+.RI "std::vector< double > \fBrates\fP"
+.br
+.ti -1c
+.RI "std::vector< \fBeoGenOp\fP< \fBEOT\fP > * > \fBops\fP"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoFunctorStore\fP \fBstore\fP"
+.br
+.ti -1c
+.RI "unsigned \fBmax_to_produce\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoOpContainer< EOT >"
+eoOpContainer is a base class for the sequential and proportional selectors It takes care of wrapping the other operators, and deleting stuff that it has allocated 
+
+Warning: all operators are added together with a rate (double) However, the meaning of this rate will be different in the differnet instances of eoOpContainer: an ***absolute*** probability in the sequential version, and a ***relative*** weight in the proportional version 
+.PP
+Definition at line 42 of file eoOpContainer.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template void \fBeoOpContainer\fP< \fBEOT\fP >::add (\fBeoOp\fP< \fBEOT\fP > & _op, double _rate)\fC [inline]\fP"
+.PP
+Add an operator to the container, also give it a rate. 
+.PP
+(sidenote, it's much less hairy since I added the wrap_op is used) 
+.PP
+Definition at line 63 of file eoOpContainer.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoOpSelMason.3 b/trunk/paradiseo-eo/doc/man/man3/eoOpSelMason.3
new file mode 100644
index 000000000..3f130eb1d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoOpSelMason.3
@@ -0,0 +1,94 @@
+.TH "eoOpSelMason" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoOpSelMason \- \fBEO\fP Mason, or builder, for operator selectors.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoFactory< eoOpSelector< eoClass > >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef std::vector< \fBeoOp\fP< eoClass > * > \fBvOpP\fP"
+.br
+.ti -1c
+.RI "typedef map< eoOpSelector< eoClass > *, vOpP > \fBMEV\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual eoOpSelector< eoClass > * \fBmake\fP (std::istream &_is)"
+.br
+.RI "\fIFactory methods: creates an object from an std::istream, reading from it whatever is needed to create the object. \fP"
+.in -1c
+.PP
+.RI "\fBctors and dtors\fP"
+.br
+
+.in +1c
+.in +1c
+.ti -1c
+.RI "\fBeoOpSelMason\fP (eoOpFactory< eoClass > &_opFact)"
+.br
+.RI "\fIconstructor \fP"
+.ti -1c
+.RI "virtual \fB~eoOpSelMason\fP ()"
+.br
+.RI "\fIdestructor \fP"
+.in -1c
+.in -1c
+.PP
+.RI "\fBeoObject methods\fP"
+.br
+
+.in +1c
+.in +1c
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIReturn the class id. \fP"
+.in -1c
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "map< eoOpSelector< eoClass > *, std::vector< \fBeoOp\fP< eoClass > * > > \fBallocMap\fP"
+.br
+.ti -1c
+.RI "eoOpFactory< eoClass > & \fBoperatorFactory\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoOpSelMason< eoClass >"
+\fBEO\fP Mason, or builder, for operator selectors. 
+
+A builder must allocate memory to the objects it builds, and then deallocate it when it gets out of scope 
+.PP
+Definition at line 39 of file eoOpSelMason.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template virtual eoOpSelector* \fBeoOpSelMason\fP< eoClass >::make (std::istream & _is)\fC [inline, virtual]\fP"
+.PP
+Factory methods: creates an object from an std::istream, reading from it whatever is needed to create the object. 
+.PP
+The format is opSelClassName\\ rate 1 operator1\\ rate 2 operator2\\ ...\\ Stores all operators built in a database (#allocMap#), so that somebody can destroy them later. The Mason is in charge or destroying the operators, since the built object can´t do it itself. The objects built must be destroyed from outside, using the #destroy# method
+.PP
+Implements \fBeoFactory< eoOpSelector< eoClass > >\fP.
+.PP
+Definition at line 65 of file eoOpSelMason.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoPBILAdditive.3 b/trunk/paradiseo-eo/doc/man/man3/eoPBILAdditive.3
new file mode 100644
index 000000000..3f2e658d0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoPBILAdditive.3
@@ -0,0 +1,68 @@
+.TH "eoPBILAdditive" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoPBILAdditive \- Distribution Class for PBIL algorithm (Population-Based Incremental Learning, Baluja and Caruana 96).  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoDistribUpdater< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoPBILAdditive\fP (double _LRBest, unsigned _nbBest=1, double _tolerance=0.0, double _LRWorst=0.0, unsigned _nbWorst=0)"
+.br
+.RI "\fICtor with parameters using the default values is equivalent to using \fBeoPBILOrg\fP. \fP"
+.ti -1c
+.RI "virtual void \fBoperator()\fP (\fBeoDistribution\fP< \fBEOT\fP > &_distrib, \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIUpdate the distribution from the current population. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBmaxBound\fP"
+.br
+.ti -1c
+.RI "double \fBminBound\fP"
+.br
+.ti -1c
+.RI "double \fBLR\fP"
+.br
+.ti -1c
+.RI "unsigned \fBnbBest\fP"
+.br
+.ti -1c
+.RI "unsigned \fBnbWorst\fP"
+.br
+.ti -1c
+.RI "double \fBlrb\fP"
+.br
+.ti -1c
+.RI "double \fBlrw\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoPBILAdditive< EOT >"
+Distribution Class for PBIL algorithm (Population-Based Incremental Learning, Baluja and Caruana 96). 
+
+This class implements an extended update rule: in the original paper, the authors used
+.PP
+p(i)(t+1) = (1-LR)*p(i)(t) + LR*best(i)
+.PP
+here the same formula is applied, with some of the best individuals and for some of the worst individuals (with different learning rates) 
+.PP
+Definition at line 46 of file eoPBILAdditive.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoPBILDistrib.3 b/trunk/paradiseo-eo/doc/man/man3/eoPBILDistrib.3
new file mode 100644
index 000000000..666a9d425
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoPBILDistrib.3
@@ -0,0 +1,80 @@
+.TH "eoPBILDistrib" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoPBILDistrib \- Distribution Class for PBIL algorithm (Population-Based Incremental Learning, Baluja and Caruana 96).  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoDistribution< EOT >< EOT >\fP, and \fBeoValueParam< std::vector< double > >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoPBILDistrib\fP (unsigned _genomeSize)"
+.br
+.RI "\fICtor with size of genomes, and update parameters. \fP"
+.ti -1c
+.RI "virtual void \fBoperator()\fP (\fBEOT\fP &_eo)"
+.br
+.RI "\fIthe randomizer of indis \fP"
+.ti -1c
+.RI "unsigned \fBSize\fP ()"
+.br
+.RI "\fIAccessor to the genome size. \fP"
+.ti -1c
+.RI "virtual void \fBprintOn\fP (std::ostream &os) const "
+.br
+.RI "\fIprinting... \fP"
+.ti -1c
+.RI "virtual void \fBreadFrom\fP (std::istream &is)"
+.br
+.RI "\fIreading... \fP"
+.ti -1c
+.RI "unsigned int \fBsize\fP ()"
+.br
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIclassName: Mandatory because of \fBeoCombinedInit\fP. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBgenomeSize\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoPBILDistrib< EOT >"
+Distribution Class for PBIL algorithm (Population-Based Incremental Learning, Baluja and Caruana 96). 
+
+It encodes a univariate distribution on the space of bitstrings, i.e. one probability for each bit to be one
+.PP
+It is an \fBeoValueParam\fP > : the std::vector stores the probabilities that each bit is 1
+.PP
+It is still pure virtual, as the update method needs to be specified 
+.PP
+Definition at line 44 of file eoPBILDistrib.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template virtual std::string \fBeoPBILDistrib\fP< \fBEOT\fP >::className (void) const\fC [inline, virtual]\fP"
+.PP
+className: Mandatory because of \fBeoCombinedInit\fP. 
+.PP
+SHould be pure virtual, but then we should go over the whole code to write the method for all derived classes ... MS 16/7/04 
+.PP
+Reimplemented from \fBeoInit< EOT >\fP.
+.PP
+Definition at line 94 of file eoPBILDistrib.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoPBILOrg.3 b/trunk/paradiseo-eo/doc/man/man3/eoPBILOrg.3
new file mode 100644
index 000000000..6d6ea78c9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoPBILOrg.3
@@ -0,0 +1,54 @@
+.TH "eoPBILOrg" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoPBILOrg \- Distribution Class for PBIL algorithm (Population-Based Incremental Learning, Baluja and Caruana 95).  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoDistribUpdater< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoPBILOrg\fP (double _LR, double _tolerance=0.0)"
+.br
+.RI "\fICtor with size of genomes, and update parameters. \fP"
+.ti -1c
+.RI "virtual void \fBoperator()\fP (\fBeoDistribution\fP< \fBEOT\fP > &_distrib, \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIUpdate the distribution from the current population. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBLR\fP"
+.br
+.ti -1c
+.RI "double \fBmaxBound\fP"
+.br
+.ti -1c
+.RI "double \fBminBound\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoPBILOrg< EOT >"
+Distribution Class for PBIL algorithm (Population-Based Incremental Learning, Baluja and Caruana 95). 
+
+This class implements the update rule from the original paper:
+.PP
+p(i)(t+1) = (1-LR)*p(i)(t) + LR*best(i) 
+.PP
+Definition at line 42 of file eoPBILOrg.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoParam.3 b/trunk/paradiseo-eo/doc/man/man3/eoParam.3
new file mode 100644
index 000000000..b2b7a3f99
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoParam.3
@@ -0,0 +1,116 @@
+.TH "eoParam" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoParam \- eoParam: Base class for monitoring and parsing parameters  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherited by \fBeoValueParam< ValueType >\fP, \fBeoValueParam< bool >\fP, \fBeoValueParam< double >\fP, \fBeoValueParam< EOT::Fitness >\fP, \fBeoValueParam< ParamType >\fP, \fBeoValueParam< std::pair< double, double > >\fP, \fBeoValueParam< std::string >\fP, \fBeoValueParam< std::vector< double > >\fP, \fBeoValueParam< std::vector< FitT > >\fP, \fBeoValueParam< std::vector< PartFitT > >\fP, \fBeoValueParam< std::vector< WorthT > >\fP, \fBeoValueParam< string >\fP, \fBeoValueParam< T >\fP, \fBeoValueParam< unsigned >\fP, \fBeoValueParam< unsigned long >\fP, ParamWrapper, and ValueParam.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoParam\fP ()"
+.br
+.RI "\fIEmpty constructor - called from outside any parser. \fP"
+.ti -1c
+.RI "\fBeoParam\fP (std::string _longName, std::string _default, std::string _description, char _shortName=0, bool _required=false)"
+.br
+.RI "\fIConstruct a Param. \fP"
+.ti -1c
+.RI "virtual \fB~eoParam\fP ()"
+.br
+.RI "\fIVirtual destructor is needed. \fP"
+.ti -1c
+.RI "virtual std::string \fBgetValue\fP () const =0"
+.br
+.RI "\fIPure virtual function to get the value out. \fP"
+.ti -1c
+.RI "virtual void \fBsetValue\fP (const std::string &_value)=0"
+.br
+.RI "\fIPure virtual function to set the value. \fP"
+.ti -1c
+.RI "char \fBshortName\fP () const "
+.br
+.RI "\fIReturns the short name. \fP"
+.ti -1c
+.RI "const std::string & \fBlongName\fP () const "
+.br
+.RI "\fIReturns the long name. \fP"
+.ti -1c
+.RI "const std::string & \fBdescription\fP () const "
+.br
+.RI "\fIReturns the description of the argument. \fP"
+.ti -1c
+.RI "const std::string & \fBdefValue\fP () const "
+.br
+.RI "\fIReturns the default value of the argument. \fP"
+.ti -1c
+.RI "void \fBdefValue\fP (const std::string &str)"
+.br
+.RI "\fISets the default value of the argument,. \fP"
+.ti -1c
+.RI "void \fBsetLongName\fP (std::string _longName)"
+.br
+.RI "\fIALlows to change the name (see the prefix in \fBeoParser.h\fP). \fP"
+.ti -1c
+.RI "bool \fBrequired\fP () const "
+.br
+.RI "\fIReturns if required or not. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "std::string \fBrepLongName\fP"
+.br
+.ti -1c
+.RI "std::string \fBrepDefault\fP"
+.br
+.ti -1c
+.RI "std::string \fBrepDescription\fP"
+.br
+.ti -1c
+.RI "char \fBrepShortHand\fP"
+.br
+.ti -1c
+.RI "bool \fBrepRequired\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+eoParam: Base class for monitoring and parsing parameters 
+.PP
+Definition at line 42 of file eoParam.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "eoParam::eoParam (std::string _longName, std::string _default, std::string _description, char _shortName = \fC0\fP, bool _required = \fCfalse\fP)\fC [inline]\fP"
+.PP
+Construct a Param. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_longName\fP Long name of the argument 
+.br
+\fI_default\fP The default value 
+.br
+\fI_description\fP Description of the parameter. What is useful for. 
+.br
+\fI_shortName\fP Short name of the argument (Optional) 
+.br
+\fI_required\fP If it is a necessary parameter or not 
+.RE
+.PP
+
+.PP
+Definition at line 60 of file eoParam.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoParamParamType.3 b/trunk/paradiseo-eo/doc/man/man3/eoParamParamType.3
new file mode 100644
index 000000000..b36b54c6c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoParamParamType.3
@@ -0,0 +1,39 @@
+.TH "eoParamParamType" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoParamParamType \- Another helper class for parsing parameters like Keyword(arg1, arg2, ...).  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoParamParamType\fP (std::string _value)"
+.br
+.ti -1c
+.RI "std::ostream & \fBprintOn\fP (std::ostream &_os) const "
+.br
+.ti -1c
+.RI "std::istream & \fBreadFrom\fP (std::istream &_is)"
+.br
+.ti -1c
+.RI "void \fBreadFrom\fP (std::string &_value)"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+Another helper class for parsing parameters like Keyword(arg1, arg2, ...). 
+
+It is basically a std::pair > first std::string is keyword the std::vector contains all arguments (as std::strings) See make_algo.h 
+.PP
+Definition at line 373 of file eoParam.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoParameterLoader.3 b/trunk/paradiseo-eo/doc/man/man3/eoParameterLoader.3
new file mode 100644
index 000000000..c20117b61
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoParameterLoader.3
@@ -0,0 +1,94 @@
+.TH "eoParameterLoader" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoParameterLoader \- Parameter saving and loading.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherited by \fBeoParser\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual \fB~eoParameterLoader\fP ()"
+.br
+.RI "\fINeed a virtual destructor. \fP"
+.ti -1c
+.RI "virtual void \fBprocessParam\fP (\fBeoParam\fP ¶m, std::string section='')=0"
+.br
+.RI "\fIRegister a parameter and set its value if it is known. \fP"
+.ti -1c
+.RI "virtual bool \fBisItThere\fP (\fBeoParam\fP &_param) const =0"
+.br
+.RI "\fIchecks if _param has been actually entered \fP"
+.ti -1c
+.RI "template \fBeoValueParam\fP< ValueType > & \fBcreateParam\fP (ValueType _defaultValue, std::string _longName, std::string _description, char _shortHand=0, std::string _section='', bool _required=false)"
+.br
+.RI "\fIConstruct a Param and sets its value. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "std::vector< \fBeoParam\fP * > \fBownedParams\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+Parameter saving and loading. 
+
+eoParameterLoader is an abstract class that can be used as a base for your own parameter loading and saving. The command line parser \fBeoParser\fP is derived from this class. 
+.PP
+Definition at line 40 of file eoParser.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "virtual void eoParameterLoader::processParam (\fBeoParam\fP & param, std::string section = \fC''\fP)\fC [pure virtual]\fP"
+.PP
+Register a parameter and set its value if it is known. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIparam\fP the parameter to process 
+.br
+\fIsection\fP the section where this parameter belongs 
+.RE
+.PP
+
+.PP
+Implemented in \fBeoParser\fP.
+.SS "template \fBeoValueParam\fP& eoParameterLoader::createParam (ValueType _defaultValue, std::string _longName, std::string _description, char _shortHand = \fC0\fP, std::string _section = \fC''\fP, bool _required = \fCfalse\fP)\fC [inline]\fP"
+.PP
+Construct a Param and sets its value. 
+.PP
+The loader will own the memory thus created
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_defaultValue\fP The default value 
+.br
+\fI_longName\fP Long name of the argument 
+.br
+\fI_description\fP Description of the parameter. What is useful for. 
+.br
+\fI_shortName\fP Short name of the argument (Optional) 
+.br
+\fI_section\fP Name of the section where the parameter belongs 
+.br
+\fI_required\fP If it is a necessary parameter or not 
+.RE
+.PP
+
+.PP
+Definition at line 70 of file eoParser.h.
+.PP
+Referenced by eoParser::getORcreateParam(), and eoParser::setORcreateParam().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoParetoFitness.3 b/trunk/paradiseo-eo/doc/man/man3/eoParetoFitness.3
new file mode 100644
index 000000000..f1999d36c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoParetoFitness.3
@@ -0,0 +1,75 @@
+.TH "eoParetoFitness" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoParetoFitness \- eoParetoFitness class: std::vector of doubles with overloaded comparison operators.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef FitnessTraits \fBfitness_traits\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoParetoFitness\fP (std::vector< double > &_v)"
+.br
+.ti -1c
+.RI "bool \fBdominates\fP (const \fBeoParetoFitness\fP< FitnessTraits > &_other) const "
+.br
+.RI "\fIPartial order based on Pareto-dominance. \fP"
+.ti -1c
+.RI "bool \fBoperator<\fP (const \fBeoParetoFitness\fP< FitnessTraits > &_other) const "
+.br
+.RI "\fIcompare *not* on dominance, but on the first, then the second, etc \fP"
+.ti -1c
+.RI "bool \fBoperator>\fP (const \fBeoParetoFitness\fP< FitnessTraits > &_other) const "
+.br
+.ti -1c
+.RI "bool \fBoperator<=\fP (const \fBeoParetoFitness\fP< FitnessTraits > &_other) const "
+.br
+.ti -1c
+.RI "bool \fBoperator>=\fP (const \fBeoParetoFitness\fP< FitnessTraits > &_other) const "
+.br
+.ti -1c
+.RI "bool \fBoperator==\fP (const \fBeoParetoFitness\fP< FitnessTraits > &_other) const "
+.br
+.ti -1c
+.RI "bool \fBoperator!=\fP (const \fBeoParetoFitness\fP< FitnessTraits > &_other) const "
+.br
+.in -1c
+.SS "Static Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "void \fBsetUp\fP (unsigned _n, std::vector< bool > &_b)"
+.br
+.RI "\fIaccess to the traits characteristics (so you don't have to write a lot of typedef's around \fP"
+.ti -1c
+.RI "bool \fBmaximizing\fP (unsigned _i)"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoParetoFitness< FitnessTraits >"
+eoParetoFitness class: std::vector of doubles with overloaded comparison operators. 
+
+Comparison is done on pareto dominance. The template argument FitnessTraits defaults to \fBeoParetoFitnessTraits\fP, which can be replaces at will by any other class that implements the static functions defined therein.
+.PP
+Note that the comparison defines a partial order, so that !(a < b) && !(b \fP
+.PP
+Inherited by \fBeoVariableParetoTraits\fP, MinimizingFitnessTraits, MinimizingFitnessTraits, and \fBMinimizingTraits\fP.
+.PP
+.SS "Static Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBnObjectives\fP ()"
+.br
+.ti -1c
+.RI "double \fBtol\fP ()"
+.br
+.ti -1c
+.RI "bool \fBmaximizing\fP (int which)"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+eoFitnessTraits: a traits class to specify the number of objectives and which one are maximizing or not See test/t-eoParetoFitness for its use. 
+
+If you define your own, make sure you make the functions static! 
+.PP
+Definition at line 42 of file eoParetoFitness.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoParetoOneConstraintFitness.3 b/trunk/paradiseo-eo/doc/man/man3/eoParetoOneConstraintFitness.3
new file mode 100644
index 000000000..c7a126bf7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoParetoOneConstraintFitness.3
@@ -0,0 +1,103 @@
+.TH "eoParetoOneConstraintFitness" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoParetoOneConstraintFitness \- eoParetoOneConstraintFitness class: std::vector of doubles + constraint value  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef FitnessTraits \fBfitness_traits\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoParetoOneConstraintFitness\fP (std::vector< double > &_v)"
+.br
+.ti -1c
+.RI "\fBeoParetoOneConstraintFitness\fP (std::vector< double > &_v, double _c)"
+.br
+.ti -1c
+.RI "bool \fBfeasible\fP () const "
+.br
+.ti -1c
+.RI "double \fBviolation\fP () const "
+.br
+.ti -1c
+.RI "double \fBConstraintValue\fP () const "
+.br
+.ti -1c
+.RI "void \fBConstraintValue\fP (double _c)"
+.br
+.ti -1c
+.RI "bool \fBdominates\fP (const \fBeoParetoOneConstraintFitness\fP< FitnessTraits > &_other) const "
+.br
+.RI "\fIPartial order based on Pareto-dominance. \fP"
+.ti -1c
+.RI "bool \fBoperator<\fP (const \fBeoParetoOneConstraintFitness\fP< FitnessTraits > &_other) const "
+.br
+.RI "\fIcompare *not* on dominance, but on the first, then the second, etc \fP"
+.ti -1c
+.RI "bool \fBoperator>\fP (const \fBeoParetoOneConstraintFitness\fP< FitnessTraits > &_other) const "
+.br
+.ti -1c
+.RI "bool \fBoperator<=\fP (const \fBeoParetoOneConstraintFitness\fP< FitnessTraits > &_other) const "
+.br
+.ti -1c
+.RI "bool \fBoperator>=\fP (const \fBeoParetoOneConstraintFitness\fP< FitnessTraits > &_other) const "
+.br
+.ti -1c
+.RI "bool \fBoperator==\fP (const \fBeoParetoOneConstraintFitness\fP< FitnessTraits > &_other) const "
+.br
+.ti -1c
+.RI "bool \fBoperator!=\fP (const \fBeoParetoOneConstraintFitness\fP< FitnessTraits > &_other) const "
+.br
+.in -1c
+.SS "Static Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "void \fBsetUp\fP (unsigned _n, std::vector< bool > &_b)"
+.br
+.RI "\fIaccess to the traits characteristics (so you don't have to write a lot of typedef's around \fP"
+.ti -1c
+.RI "bool \fBmaximizing\fP (unsigned _i)"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBconstraintValue\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoParetoOneConstraintFitness< FitnessTraits >"
+eoParetoOneConstraintFitness class: std::vector of doubles + constraint value 
+
+Comparison (dominance) is done on pareto dominance for 2 feasible individuals, one feasible individual always wins over an infeasible on constraint violations for 2 infeasible individuals
+.PP
+The template argument FitnessTraits defaults to \fBeoParetoFitnessTraits\fP, which can be replaces at will by any other class that implements the static functions defined therein.
+.PP
+Note that the domninance defines a partial order, so that !dominates(a,b) && !domaintes(b,a) does not neccessarily imply that (a==b) The other way around does hold.
+.PP
+However, be careful that the comparison operators do define a total order based on considering first objective, then in case of tie, second objective, etc
+.PP
+NOTE: in a hurry, I did not want to make it derive from \fBeoParetoFitness\fP (used cut-and-paste instead!) : I know it might be a good idea, but I'm not sure I see why at the moment (any hint someone?) 
+.PP
+Definition at line 61 of file eoParetoConstraintFitness.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoParetoRanking.3 b/trunk/paradiseo-eo/doc/man/man3/eoParetoRanking.3
new file mode 100644
index 000000000..22dedf43e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoParetoRanking.3
@@ -0,0 +1,45 @@
+.TH "eoParetoRanking" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoParetoRanking \- Straightforward pareto ranking.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoPerf2WorthCached< EOT, double >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoParetoRanking\fP (\fBeoDominanceMap\fP< \fBEOT\fP > &_dominanceMap)"
+.br
+.ti -1c
+.RI "void \fBcalculate_worths\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIThe actual virtual function the derived classes should implement. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoDominanceMap\fP< \fBEOT\fP > & \fBdominanceMap\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoParetoRanking< EOT >"
+Straightforward pareto ranking. 
+
+Every individual gets a rank according to the number of elements it dominates. Note that without niching, this technique will usually not find the whole front of non-dominated solutions, but will quite likely converge on a single spot on the front. 
+.PP
+Definition at line 40 of file eoParetoRanking.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoParseTree.3 b/trunk/paradiseo-eo/doc/man/man3/eoParseTree.3
new file mode 100644
index 000000000..94bf0a85d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoParseTree.3
@@ -0,0 +1,148 @@
+.TH "eoParseTree" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoParseTree \- Implementation of parse-tree for genetic programming.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBEO< FType >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef parse_tree< Node >::subtree \fBSubtree\fP"
+.br
+.ti -1c
+.RI "typedef Node \fBreference\fP"
+.br
+.ti -1c
+.RI "typedef const reference \fBconst_reference\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoParseTree\fP (void)"
+.br
+.RI "\fIDefault Constructor. \fP"
+.ti -1c
+.RI "\fBeoParseTree\fP (const parse_tree< Node > &tree)"
+.br
+.RI "\fICopy Constructor. \fP"
+.ti -1c
+.RI "virtual void \fBpruneTree\fP (unsigned _size)"
+.br
+.RI "\fITo prune me to a certain size. \fP"
+.ti -1c
+.RI "\fBeoParseTree\fP (std::istream &is)"
+.br
+.RI "\fITo read me from a stream. \fP"
+.ti -1c
+.RI "std::string \fBclassName\fP (void) const "
+.br
+.RI "\fIMy class name. \fP"
+.ti -1c
+.RI "void \fBprintOn\fP (std::ostream &os) const "
+.br
+.RI "\fITo print me on a stream. \fP"
+.ti -1c
+.RI "void \fBreadFrom\fP (std::istream &is)"
+.br
+.RI "\fITo read me from a stream. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoParseTree< FType, Node >"
+Implementation of parse-tree for genetic programming. 
+.PP
+Definition at line 54 of file eoParseTree.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoParseTree\fP< FType, Node >::\fBeoParseTree\fP (const parse_tree< Node > & tree)\fC [inline]\fP"
+.PP
+Copy Constructor. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fItree\fP The tree to copy 
+.RE
+.PP
+
+.PP
+Definition at line 79 of file eoParseTree.h.
+.SS "template \fBeoParseTree\fP< FType, Node >::\fBeoParseTree\fP (std::istream & is)\fC [inline]\fP"
+.PP
+To read me from a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIis\fP The std::istream 
+.RE
+.PP
+
+.PP
+Definition at line 102 of file eoParseTree.h.
+.PP
+References eoParseTree< FType, Node >::readFrom().
+.SH "Member Function Documentation"
+.PP 
+.SS "template virtual void \fBeoParseTree\fP< FType, Node >::pruneTree (unsigned _size)\fC [inline, virtual]\fP"
+.PP
+To prune me to a certain size. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_size\fP My maximum size 
+.RE
+.PP
+
+.PP
+Definition at line 86 of file eoParseTree.h.
+.PP
+Referenced by eoCollapseSubtreeMutation< FType, Node >::operator()(), eoExpansionMutation< FType, Node >::operator()(), eoBranchMutation< FType, Node >::operator()(), and eoSubtreeXOver< FType, Node >::operator()().
+.SS "template void \fBeoParseTree\fP< FType, Node >::printOn (std::ostream & os) const\fC [inline, virtual]\fP"
+.PP
+To print me on a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIos\fP The std::ostream 
+.RE
+.PP
+
+.PP
+Reimplemented from \fBEO< FType >\fP.
+.PP
+Definition at line 114 of file eoParseTree.h.
+.PP
+References EO< F >::printOn().
+.SS "template void \fBeoParseTree\fP< FType, Node >::readFrom (std::istream & is)\fC [inline, virtual]\fP"
+.PP
+To read me from a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIis\fP The std::istream 
+.RE
+.PP
+
+.PP
+Reimplemented from \fBEO< FType >\fP.
+.PP
+Definition at line 128 of file eoParseTree.h.
+.PP
+References EO< F >::readFrom().
+.PP
+Referenced by eoParseTree< FType, Node >::eoParseTree().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoParseTreeDepthInit.3 b/trunk/paradiseo-eo/doc/man/man3/eoParseTreeDepthInit.3
new file mode 100644
index 000000000..1960deb39
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoParseTreeDepthInit.3
@@ -0,0 +1,108 @@
+.TH "eoParseTreeDepthInit" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoParseTreeDepthInit \- eoParseTreeDepthInit : the initializer class for \fBeoParseTree\fP  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoInit< eoParseTree< FType, Node > >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef \fBeoParseTree\fP< FType, Node > \fBEoType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoParseTreeDepthInit\fP (unsigned _max_depth, const std::vector< Node > &_initializor, bool _grow=true, bool _ramped_half_and_half=false)"
+.br
+.RI "\fIConstructor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIMy class name. \fP"
+.ti -1c
+.RI "void \fBoperator()\fP (\fBEoType\fP &_tree)"
+.br
+.RI "\fIinitialize a tree \fP"
+.in -1c
+.SS "Private Member Functions"
+
+.in +1c
+.ti -1c
+.RI "void \fBgenerate\fP (std::list< Node > &sequence, int the_max, int last_terminal=-1)"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBmax_depth\fP"
+.br
+.ti -1c
+.RI "std::vector< Node > \fBinitializor\fP"
+.br
+.ti -1c
+.RI "bool \fBgrow\fP"
+.br
+.ti -1c
+.RI "bool \fBramped_half_and_half\fP"
+.br
+.ti -1c
+.RI "unsigned \fBcurrent_depth\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoParseTreeDepthInit< FType, Node >"
+eoParseTreeDepthInit : the initializer class for \fBeoParseTree\fP 
+.PP
+Definition at line 48 of file eoParseTreeDepthInit.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoParseTreeDepthInit\fP< FType, Node >::\fBeoParseTreeDepthInit\fP (unsigned _max_depth, const std::vector< Node > & _initializor, bool _grow = \fCtrue\fP, bool _ramped_half_and_half = \fCfalse\fP)\fC [inline]\fP"
+.PP
+Constructor. 
+.PP
+_max_depth The maximum depth of a tree 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_initializor\fP A std::vector containing the possible nodes 
+.br
+\fI_grow\fP False results in a full tree, True result is a randomly grown tree 
+.br
+\fI_ramped_half_and_half\fP True results in Ramped Half and Half Initialization 
+.RE
+.PP
+
+.PP
+Definition at line 69 of file eoParseTreeDepthInit.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template void \fBeoParseTreeDepthInit\fP< FType, Node >::operator() (\fBEoType\fP & _tree)\fC [inline]\fP"
+.PP
+initialize a tree 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_tree\fP : the tree to be initialized 
+.RE
+.PP
+
+.PP
+Definition at line 96 of file eoParseTreeDepthInit.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoParser.3 b/trunk/paradiseo-eo/doc/man/man3/eoParser.3
new file mode 100644
index 000000000..e6eb6a935
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoParser.3
@@ -0,0 +1,267 @@
+.TH "eoParser" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoParser \- eoParser: command line parser and configuration file reader This class is persistent, so it can be stored and reloaded to restore parameter settings.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoParameterLoader\fP, \fBeoObject\fP, and \fBeoPersistent\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoParser\fP (unsigned _argc, char **_argv, std::string _programDescription='', std::string _lFileParamName='param-file', char _shortHand= 'p')"
+.br
+.RI "\fIConstructor a complete constructor that reads the command line an optionally reads a configuration file. \fP"
+.ti -1c
+.RI "void \fBprocessParam\fP (\fBeoParam\fP ¶m, std::string section='')"
+.br
+.RI "\fIProcesses the parameter and puts it in the appropriate section for readability. \fP"
+.ti -1c
+.RI "void \fBreadFrom\fP (std::istream &is)"
+.br
+.RI "\fIRead object. \fP"
+.ti -1c
+.RI "void \fBprintOn\fP (std::ostream &os) const "
+.br
+.RI "\fIWrite object. \fP"
+.ti -1c
+.RI "std::string \fBclassName\fP (void) const "
+.br
+.RI "\fIclassName for readibility \fP"
+.ti -1c
+.RI "bool \fBuserNeedsHelp\fP (void)"
+.br
+.RI "\fItrue if the user made an error or asked for help \fP"
+.ti -1c
+.RI "void \fBprintHelp\fP (std::ostream &os)"
+.br
+.RI "\fIPrints an automatic help in the specified output using the information provided by parameters. \fP"
+.ti -1c
+.RI "std::string \fBProgramName\fP ()"
+.br
+.ti -1c
+.RI "virtual bool \fBisItThere\fP (\fBeoParam\fP &_param) const "
+.br
+.RI "\fIHas param been entered by user? \fP"
+.ti -1c
+.RI "\fBeoParam\fP * \fBgetParamWithLongName\fP (const std::string &_name) const "
+.br
+.RI "\fIget a handle on a param from its longName \fP"
+.ti -1c
+.RI "template \fBeoValueParam\fP< ValueType > & \fBgetORcreateParam\fP (ValueType _defaultValue, std::string _longName, std::string _description, char _shortHand=0, std::string _section='', bool _required=false)"
+.br
+.RI "\fIGet or create parameter. \fP"
+.ti -1c
+.RI "template \fBeoValueParam\fP< ValueType > & \fBsetORcreateParam\fP (ValueType _defaultValue, std::string _longName, std::string _description, char _shortHand=0, std::string _section='', bool _required=false)"
+.br
+.RI "\fISet parameter value or create parameter. \fP"
+.ti -1c
+.RI "void \fBsetStopOnUnknownParam\fP (bool _b)"
+.br
+.RI "\fIaccessors to the stopOnUnknownParam value \fP"
+.ti -1c
+.RI "bool \fBgetStopOnUnknownParam\fP ()"
+.br
+.ti -1c
+.RI "void \fBsetPrefix\fP (const std::string &_prefix)"
+.br
+.RI "\fIPrefix handling. \fP"
+.ti -1c
+.RI "void \fBresetPrefix\fP ()"
+.br
+.ti -1c
+.RI "std::string \fBgetPrefix\fP ()"
+.br
+.in -1c
+.SS "Private Types"
+
+.in +1c
+.ti -1c
+.RI "typedef std::multimap< std::string, \fBeoParam\fP * > \fBMultiMapType\fP"
+.br
+.ti -1c
+.RI "typedef std::map< char, std::string > \fBShortNameMapType\fP"
+.br
+.ti -1c
+.RI "typedef std::map< std::string, std::string > \fBLongNameMapType\fP"
+.br
+.in -1c
+.SS "Private Member Functions"
+
+.in +1c
+.ti -1c
+.RI "void \fBdoRegisterParam\fP (\fBeoParam\fP ¶m) const "
+.br
+.ti -1c
+.RI "std::pair< bool, std::string > \fBgetValue\fP (\fBeoParam\fP &_param) const "
+.br
+.ti -1c
+.RI "void \fBupdateParameters\fP () const "
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "MultiMapType \fBparams\fP"
+.br
+.ti -1c
+.RI "std::string \fBprogramName\fP"
+.br
+.ti -1c
+.RI "std::string \fBprogramDescription\fP"
+.br
+.ti -1c
+.RI "ShortNameMapType \fBshortNameMap\fP"
+.br
+.ti -1c
+.RI "LongNameMapType \fBlongNameMap\fP"
+.br
+.ti -1c
+.RI "\fBeoValueParam\fP< bool > \fBneedHelp\fP"
+.br
+.ti -1c
+.RI "\fBeoValueParam\fP< bool > \fBstopOnUnknownParam\fP"
+.br
+.ti -1c
+.RI "std::vector< std::string > \fBmessages\fP"
+.br
+.ti -1c
+.RI "std::string \fBprefix\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+eoParser: command line parser and configuration file reader This class is persistent, so it can be stored and reloaded to restore parameter settings. 
+.PP
+Definition at line 100 of file eoParser.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "eoParser::eoParser (unsigned _argc, char ** _argv, std::string _programDescription = \fC''\fP, std::string _lFileParamName = \fC'param-file'\fP, char _shortHand = \fC'p'\fP)"
+.PP
+Constructor a complete constructor that reads the command line an optionally reads a configuration file. 
+.PP
+myEo --param-file=param.rc will then load using the parameter file param.rc
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_argc\fP command line arguments count 
+.br
+\fI_argv\fP command line parameters 
+.br
+\fI_programDescription\fP Description of the work the program does 
+.br
+\fI_lFileParamName\fP Name of the parameter specifying the configuration file (--param-file) 
+.br
+\fI_shortHand\fP Single charachter shorthand for specifying the configuration file 
+.RE
+.PP
+
+.SH "Member Function Documentation"
+.PP 
+.SS "void eoParser::readFrom (std::istream & is)\fC [virtual]\fP"
+.PP
+Read object. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_is\fP A std::istream. 
+.RE
+.PP
+\fBExceptions:\fP
+.RS 4
+\fIruntime_std::exception\fP If a valid object can't be read. 
+.RE
+.PP
+
+.PP
+Implements \fBeoPersistent\fP.
+.SS "void eoParser::printOn (std::ostream & os) const\fC [virtual]\fP"
+.PP
+Write object. 
+.PP
+It's called printOn since it prints the object on a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_os\fP A std::ostream. 
+.RE
+.PP
+
+.PP
+Implements \fBeoPrintable\fP.
+.SS "virtual bool eoParser::isItThere (\fBeoParam\fP & _param) const\fC [inline, virtual]\fP"
+.PP
+Has param been entered by user? 
+.PP
+Checks if _param has been actually entered by the user 
+.PP
+Implements \fBeoParameterLoader\fP.
+.PP
+Definition at line 148 of file eoParser.h.
+.PP
+Referenced by setORcreateParam().
+.SS "\fBeoParam\fP* eoParser::getParamWithLongName (const std::string & _name) const"
+.PP
+get a handle on a param from its longName 
+.PP
+if not found, returns 0 (null pointer :-)
+.PP
+Not very clean (requires hard-coding of the long name twice!) but very useful in many occasions... 
+.PP
+Referenced by getORcreateParam().
+.SS "template \fBeoValueParam\fP& eoParser::getORcreateParam (ValueType _defaultValue, std::string _longName, std::string _description, char _shortHand = \fC0\fP, std::string _section = \fC''\fP, bool _required = \fCfalse\fP)\fC [inline]\fP"
+.PP
+Get or create parameter. 
+.PP
+It seems finally that the easiest use of the above method is through the following, whose interface is similar to that of the widely-used createParam.
+.PP
+For some (probably very stupid) reason, I failed to put it in the .cpp. Any hint??? 
+.PP
+Definition at line 173 of file eoParser.h.
+.PP
+References eoParameterLoader::createParam(), and getParamWithLongName().
+.SS "template \fBeoValueParam\fP& eoParser::setORcreateParam (ValueType _defaultValue, std::string _longName, std::string _description, char _shortHand = \fC0\fP, std::string _section = \fC''\fP, bool _required = \fCfalse\fP)\fC [inline]\fP"
+.PP
+Set parameter value or create parameter. 
+.PP
+This makes sure that the specified parameter has the given value. If the parameter does not exist yet, it is created.
+.PP
+This requires that operator<< is defined for ValueType.
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_defaultValue\fP Default value. 
+.br
+\fI_longName\fP Long name of the argument. 
+.br
+\fI_description\fP Description of the parameter. 
+.br
+\fI_shortName\fP Short name of the argument (Optional) 
+.br
+\fI_section\fP Name of the section where the parameter belongs. 
+.br
+\fI_required\fP Is the parameter mandatory? 
+.RE
+.PP
+\fBReturns:\fP
+.RS 4
+Corresponding parameter. 
+.RE
+.PP
+
+.PP
+Definition at line 211 of file eoParser.h.
+.PP
+References eoParameterLoader::createParam(), isItThere(), and eoValueParam< ValueType >::setValue().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoPerf2Worth.3 b/trunk/paradiseo-eo/doc/man/man3/eoPerf2Worth.3
new file mode 100644
index 000000000..e0034242f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoPerf2Worth.3
@@ -0,0 +1,52 @@
+.TH "eoPerf2Worth" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoPerf2Worth \- Base class to transform raw fitnesses into fitness for selection.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoUF< const eoPop< EOT > &, void >\fP, and \fBeoValueParam< std::vector< WorthT > >\fP.
+.PP
+Inherited by \fBeoPerf2WorthCached< EOT, WorthT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoPerf2Worth\fP (std::string _description='Worths')"
+.br
+.RI "\fIdefault constructor \fP"
+.ti -1c
+.RI "virtual void \fBsort_pop\fP (\fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fISort population according to worth, will keep the worths and fitness_cache in sync with the population. \fP"
+.ti -1c
+.RI "virtual void \fBresize\fP (\fBeoPop\fP< \fBEOT\fP > &_pop, unsigned sz)"
+.br
+.ti -1c
+.RI "virtual void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoPerf2Worth< EOT, WorthT >"
+Base class to transform raw fitnesses into fitness for selection. 
+
+\fBSee also:\fP
+.RS 4
+\fBeoSelectFromWorth\fP 
+.RE
+.PP
+
+.PP
+Definition at line 43 of file eoPerf2Worth.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoPerf2WorthCached.3 b/trunk/paradiseo-eo/doc/man/man3/eoPerf2WorthCached.3
new file mode 100644
index 000000000..5a60d7629
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoPerf2WorthCached.3
@@ -0,0 +1,65 @@
+.TH "eoPerf2WorthCached" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoPerf2WorthCached \- Perf2Worth with fitness cache.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoPerf2Worth< EOT, WorthT >< EOT, WorthT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoPerf2WorthCached\fP (std::string _description='Worths')"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIImplementation of the operator(), updating a cache of fitnesses. \fP"
+.ti -1c
+.RI "virtual void \fBcalculate_worths\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)=0"
+.br
+.RI "\fIThe actual virtual function the derived classes should implement. \fP"
+.ti -1c
+.RI "virtual void \fBsort_pop\fP (\fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fISort population according to worth, will keep the worths and fitness_cache in sync with the population. \fP"
+.ti -1c
+.RI "virtual void \fBresize\fP (\fBeoPop\fP< \fBEOT\fP > &_pop, unsigned sz)"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "std::vector< typename EOT::Fitness > \fBfitness_cache\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoPerf2WorthCached< EOT, WorthT >"
+Perf2Worth with fitness cache. 
+.PP
+Definition at line 111 of file eoPerf2Worth.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template void \fBeoPerf2WorthCached\fP< \fBEOT\fP, WorthT >::operator() (const \fBeoPop\fP< \fBEOT\fP > & _pop)\fC [inline, virtual]\fP"
+.PP
+Implementation of the operator(), updating a cache of fitnesses. 
+.PP
+Calls the virtual function calculate_worths when one of the fitnesses has changed. It is not virtual, but derived classes can remove the fitness caching trough the third template element 
+.PP
+Implements \fBeoUF< const eoPop< EOT > &, void >\fP.
+.PP
+Definition at line 125 of file eoPerf2Worth.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoPerf2WorthCached_compare_worth.3 b/trunk/paradiseo-eo/doc/man/man3/eoPerf2WorthCached_compare_worth.3
new file mode 100644
index 000000000..bc4c9f830
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoPerf2WorthCached_compare_worth.3
@@ -0,0 +1,40 @@
+.TH "eoPerf2WorthCached::compare_worth" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoPerf2WorthCached::compare_worth \- helper class used to sort indices into populations/worths  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBcompare_worth\fP (const std::vector< WorthT > &_worths)"
+.br
+.ti -1c
+.RI "bool \fBoperator()\fP (unsigned a, unsigned b) const "
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "const std::vector< WorthT > & \fBworths\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoPerf2WorthCached< EOT, WorthT >::compare_worth"
+helper class used to sort indices into populations/worths 
+.PP
+Definition at line 200 of file eoPerf2Worth.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoPerf2Worth_compare_worth.3 b/trunk/paradiseo-eo/doc/man/man3/eoPerf2Worth_compare_worth.3
new file mode 100644
index 000000000..73a13a1c4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoPerf2Worth_compare_worth.3
@@ -0,0 +1,40 @@
+.TH "eoPerf2Worth::compare_worth" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoPerf2Worth::compare_worth \- helper class used to sort indices into populations/worths  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBcompare_worth\fP (const std::vector< WorthT > &_worths)"
+.br
+.ti -1c
+.RI "bool \fBoperator()\fP (unsigned a, unsigned b) const "
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "const std::vector< WorthT > & \fBworths\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoPerf2Worth< EOT, WorthT >::compare_worth"
+helper class used to sort indices into populations/worths 
+.PP
+Definition at line 83 of file eoPerf2Worth.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoPersistent.3 b/trunk/paradiseo-eo/doc/man/man3/eoPersistent.3
new file mode 100644
index 000000000..683ca0bdb
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoPersistent.3
@@ -0,0 +1,58 @@
+.TH "eoPersistent" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoPersistent \- An persistent object that knows how to write (through functions inherited from \fBeoPrintable\fP#) and read itself.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoPrintable\fP.
+.PP
+Inherited by \fBEO< F >\fP, \fBEO< double >\fP, \fBEO< EOT::Fitness >\fP, \fBEO< Fit >\fP, \fBEO< Fitness >\fP, \fBEO< fitness_type >\fP, \fBEO< fitnessT >\fP, \fBEO< FitT >\fP, \fBEO< FType >\fP, \fBEO< phenotype >\fP, \fBEO< PyFitness >\fP, \fBeoContinue< EOT >\fP, \fBeoDistribution< EOT >\fP, \fBeoHowMany\fP, \fBeoIntBounds\fP, \fBeoParser\fP, \fBeoPop< EOT >\fP, \fBeoPop< Dummy >\fP, \fBeoPop< PyEO >\fP, \fBeoRealBounds\fP, \fBeoRealVectorBounds\fP, and \fBeoRng\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual \fB~eoPersistent\fP ()"
+.br
+.RI "\fIVirtual dtor. They are needed in virtual class hierarchies. \fP"
+.ti -1c
+.RI "virtual void \fBreadFrom\fP (std::istream &_is)=0"
+.br
+.RI "\fIRead object. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+An persistent object that knows how to write (through functions inherited from \fBeoPrintable\fP#) and read itself. 
+.PP
+Definition at line 52 of file eoPersistent.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "virtual void eoPersistent::readFrom (std::istream & _is)\fC [pure virtual]\fP"
+.PP
+Read object. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_is\fP A std::istream. 
+.RE
+.PP
+\fBExceptions:\fP
+.RS 4
+\fIruntime_std::exception\fP If a valid object can't be read. 
+.RE
+.PP
+
+.PP
+Implemented in \fBEO< F >\fP, \fBeoContinue< EOT >\fP, \fBeoGenContinue< EOT >\fP, \fBeoPop< EOT >\fP, \fBeoVector< FitT, GeneType >\fP, \fBeoEsFull< Fit >\fP, \fBeoEsSimple< Fit >\fP, \fBeoEsStdev< Fit >\fP, \fBeoBit< FitT >\fP, \fBeoPBILDistrib< EOT >\fP, \fBeoParseTree< FType, Node >\fP, \fBeoExternalEO< Fit, External >\fP, \fBeoHowMany\fP, \fBeoIntNoBounds\fP, \fBeoIntInterval\fP, \fBeoIntBelowBound\fP, \fBeoIntAboveBound\fP, \fBeoGeneralIntBounds\fP, \fBeoParser\fP, \fBeoRealNoBounds\fP, \fBeoRealInterval\fP, \fBeoRealBelowBound\fP, \fBeoRealAboveBound\fP, \fBeoGeneralRealBounds\fP, \fBeoRealVectorBounds\fP, \fBeoRng\fP, \fBEO< double >\fP, \fBEO< EOT::Fitness >\fP, \fBEO< FitT >\fP, \fBEO< phenotype >\fP, \fBEO< fitnessT >\fP, \fBEO< Fit >\fP, \fBEO< FType >\fP, \fBEO< fitness_type >\fP, \fBEO< Fitness >\fP, \fBEO< PyFitness >\fP, \fBeoPop< PyEO >\fP, \fBeoPop< Dummy >\fP, \fBeoVector< Fit, double >\fP, \fBeoVector< FitT, double >\fP, and \fBeoVector< FitT, bool >\fP.
+.PP
+Referenced by eoState::load().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoPlus.3 b/trunk/paradiseo-eo/doc/man/man3/eoPlus.3
new file mode 100644
index 000000000..27e806bed
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoPlus.3
@@ -0,0 +1,33 @@
+.TH "eoPlus" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoPlus \- Very elitist class, copies entire population into next gen.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMerge< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "void \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop, \fBeoPop\fP< \fBEOT\fP > &_offspring)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoPlus< EOT >"
+Very elitist class, copies entire population into next gen. 
+.PP
+Definition at line 116 of file eoMerge.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoPlusReplacement.3 b/trunk/paradiseo-eo/doc/man/man3/eoPlusReplacement.3
new file mode 100644
index 000000000..343db2edb
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoPlusReplacement.3
@@ -0,0 +1,35 @@
+.TH "eoPlusReplacement" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoPlusReplacement \- ES type of replacement strategy: first add parents to population, then truncate.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMergeReduce< EOT >< EOT >\fP.
+.PP
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoPlus\fP< \fBEOT\fP > \fBplus\fP"
+.br
+.ti -1c
+.RI "\fBeoTruncate\fP< \fBEOT\fP > \fBtruncate\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoPlusReplacement< EOT >"
+ES type of replacement strategy: first add parents to population, then truncate. 
+.PP
+Definition at line 73 of file eoMergeReduce.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoPointMutation.3 b/trunk/paradiseo-eo/doc/man/man3/eoPointMutation.3
new file mode 100644
index 000000000..a69241827
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoPointMutation.3
@@ -0,0 +1,89 @@
+.TH "eoPointMutation" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoPointMutation \- eoPointMutation --> replace a Node with a Node of the same arity  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< eoParseTree< FType, Node > >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef \fBeoParseTree\fP< FType, Node > \fBEoType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoPointMutation\fP (std::vector< Node > &_initializor)"
+.br
+.RI "\fIConstructor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIthe class name \fP"
+.ti -1c
+.RI "virtual \fB~eoPointMutation\fP ()"
+.br
+.RI "\fIDtor. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEoType\fP &_eo1)"
+.br
+.RI "\fIMutate an individual. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "std::vector< Node > & \fBinitializor\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoPointMutation< FType, Node >"
+eoPointMutation --> replace a Node with a Node of the same arity 
+.PP
+Definition at line 147 of file eoParseTreeOp.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoPointMutation\fP< FType, Node >::\fBeoPointMutation\fP (std::vector< Node > & _initializor)\fC [inline]\fP"
+.PP
+Constructor. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_initializor\fP The std::vector of Nodes given to the eoGpDepthInitializer 
+.RE
+.PP
+
+.PP
+Definition at line 157 of file eoParseTreeOp.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template bool \fBeoPointMutation\fP< FType, Node >::operator() (\fBEoType\fP & _eo1)\fC [inline]\fP"
+.PP
+Mutate an individual. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_eo1\fP The individual that is to be changed 
+.RE
+.PP
+
+.PP
+Definition at line 171 of file eoParseTreeOp.h.
+.PP
+References eoRng::random().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoPop.3 b/trunk/paradiseo-eo/doc/man/man3/eoPop.3
new file mode 100644
index 000000000..0a3578120
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoPop.3
@@ -0,0 +1,309 @@
+.TH "eoPop" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoPop \- A std::vector of \fBEO\fP object, to be used in all algorithms (selectors, operators, replacements, ...).  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoObject\fP, and \fBeoPersistent\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::Fitness \fBFitness\fP"
+.br
+.ti -1c
+.RI "typedef EOT::fitness_traits \fBfitness_traits\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoPop\fP ()"
+.br
+.RI "\fIDefault ctor. \fP"
+.ti -1c
+.RI "\fBeoPop\fP (unsigned _popSize, \fBeoInit\fP< \fBEOT\fP > &_chromInit)"
+.br
+.RI "\fICtor for the initialization of chromosomes. \fP"
+.ti -1c
+.RI "void \fBappend\fP (unsigned _newPopSize, \fBeoInit\fP< \fBEOT\fP > &_chromInit)"
+.br
+.RI "\fIappstd::ends random guys at end of pop. \fP"
+.ti -1c
+.RI "\fBeoPop\fP (std::istream &_is)"
+.br
+.RI "\fICtor from an std::istream; reads the population from a stream, each element should be in different lines. \fP"
+.ti -1c
+.RI "virtual \fB~eoPop\fP ()"
+.br
+.RI "\fIEmpty Dtor. \fP"
+.ti -1c
+.RI "void \fBsort\fP (void)"
+.br
+.RI "\fIsort the population. \fP"
+.ti -1c
+.RI "void \fBsort\fP (std::vector< const \fBEOT\fP * > &result) const "
+.br
+.RI "\fIcreates a std::vector pointing to the individuals in descending order \fP"
+.ti -1c
+.RI "void \fBshuffle\fP (void)"
+.br
+.RI "\fIshuffle the population. \fP"
+.ti -1c
+.RI "void \fBshuffle\fP (std::vector< const \fBEOT\fP * > &result) const "
+.br
+.RI "\fIcreates a std::vector pointing to the individuals in random order \fP"
+.ti -1c
+.RI "\fBeoPop\fP< \fBEOT\fP >::iterator \fBit_best_element\fP ()"
+.br
+.RI "\fIreturns an iterator to the best individual DOES NOT MOVE ANYBODY \fP"
+.ti -1c
+.RI "const \fBEOT\fP & \fBbest_element\fP () const "
+.br
+.RI "\fIreturns an iterator to the best individual DOES NOT MOVE ANYBODY \fP"
+.ti -1c
+.RI "const \fBEOT\fP & \fBworse_element\fP () const "
+.br
+.RI "\fIreturns a const reference to the worse individual DOES NOT MOVE ANYBODY \fP"
+.ti -1c
+.RI "\fBeoPop\fP< \fBEOT\fP >::iterator \fBit_worse_element\fP ()"
+.br
+.RI "\fIreturns an iterator to the worse individual DOES NOT MOVE ANYBODY \fP"
+.ti -1c
+.RI "\fBeoPop\fP< \fBEOT\fP >::iterator \fBnth_element\fP (int nth)"
+.br
+.RI "\fIslightly faster algorithm than sort to find all individuals that are better than the nth individual. \fP"
+.ti -1c
+.RI "Fitness \fBnth_element_fitness\fP (int which) const "
+.br
+.RI "\fIreturns the fitness of the nth element \fP"
+.ti -1c
+.RI "void \fBnth_element\fP (int which, std::vector< const \fBEOT\fP * > &result) const "
+.br
+.RI "\fIconst nth_element function, returns pointers to sorted individuals up the the nth \fP"
+.ti -1c
+.RI "void \fBswap\fP (\fBeoPop\fP< \fBEOT\fP > &other)"
+.br
+.RI "\fIdoes STL swap with other pop \fP"
+.ti -1c
+.RI "virtual void \fBsortedPrintOn\fP (std::ostream &_os) const "
+.br
+.RI "\fIPrints sorted pop but does NOT modify it! \fP"
+.ti -1c
+.RI "virtual void \fBprintOn\fP (std::ostream &_os) const "
+.br
+.RI "\fIWrite object. \fP"
+.ti -1c
+.RI "virtual void \fBinvalidate\fP ()"
+.br
+.ti -1c
+.RI "void \fBsort\fP ()"
+.br
+.ti -1c
+.RI "void \fBscale\fP ()"
+.br
+.ti -1c
+.RI "void \fBsetPerf2Worth\fP (\fBeoPerf2Worth\fP< \fBEOT\fP > &_p2w)"
+.br
+.ti -1c
+.RI "void \fBsetPerf2Worth\fP (\fBeoPerf2Worth\fP< \fBEOT\fP > *_p2w)"
+.br
+.ti -1c
+.RI "\fBeoPerf2Worth\fP< \fBEOT\fP > * \fBgetPerf2Worth\fP ()"
+.br
+.ti -1c
+.RI "void \fBswap\fP (\fBeoPop\fP< \fBEOT\fP > &other)"
+.br
+.in -1c
+.PP
+.RI "\fBMethods from eoObject\fP"
+.br
+
+.in +1c
+.in +1c
+.ti -1c
+.RI "virtual void \fBreadFrom\fP (std::istream &_is)"
+.br
+.RI "\fIRead object. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIInherited from \fBeoObject\fP. \fP"
+.in -1c
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoPerf2Worth\fP< \fBEOT\fP > * \fBp2w\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoPop< EOT >"
+A std::vector of \fBEO\fP object, to be used in all algorithms (selectors, operators, replacements, ...). 
+
+We have no idea if a population can be some other thing that a std::vector, but if somebody thinks of it, this concrete implementation can be moved to 'generic' and an abstract Population interface be provided.
+.PP
+The template can be instantiated with anything that accepts a 'size' and \fBeoInit\fP derived object. in the ctor. EOT must also have a copy ctor, since temporaries are created and then passed to the \fBeoInit\fP object 
+.PP
+Definition at line 54 of file eoPop.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoPop\fP< \fBEOT\fP >::\fBeoPop\fP ()\fC [inline]\fP"
+.PP
+Default ctor. 
+.PP
+Creates empty pop
+.PP
+Definition at line 68 of file eoPop.h.
+.SS "template \fBeoPop\fP< \fBEOT\fP >::\fBeoPop\fP (unsigned _popSize, \fBeoInit\fP< \fBEOT\fP > & _chromInit)\fC [inline]\fP"
+.PP
+Ctor for the initialization of chromosomes. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_popSize\fP total population size 
+.br
+\fI_chromInit\fP Initialization routine, produces EO's, needs to be an \fBeoInit\fP
+.RE
+.PP
+
+.PP
+Definition at line 75 of file eoPop.h.
+.SS "template \fBeoPop\fP< \fBEOT\fP >::\fBeoPop\fP (std::istream & _is)\fC [inline]\fP"
+.PP
+Ctor from an std::istream; reads the population from a stream, each element should be in different lines. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_is\fP the stream 
+.RE
+.PP
+
+.PP
+Definition at line 113 of file eoPop.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template void \fBeoPop\fP< \fBEOT\fP >::append (unsigned _newPopSize, \fBeoInit\fP< \fBEOT\fP > & _chromInit)\fC [inline]\fP"
+.PP
+appstd::ends random guys at end of pop. 
+.PP
+Can be used to initialize it pop is empty
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_popSize\fP total population size 
+.br
+\fI_chromInit\fP Initialization routine, produces EO's, needs to be an \fBeoInit\fP
+.RE
+.PP
+
+.PP
+Definition at line 91 of file eoPop.h.
+.PP
+Referenced by eoEasyEA< EOT >::operator()().
+.SS "template void \fBeoPop\fP< \fBEOT\fP >::sort (void)\fC [inline]\fP"
+.PP
+sort the population. 
+.PP
+Use this member to sort in order of descending Fitness, so the first individual is the best! 
+.PP
+Definition at line 133 of file eoPop.h.
+.PP
+Referenced by eoTruncatedSelectMany< EOT >::operator()(), eoReduceMergeReduce< EOT >::operator()(), eoRanking< EOT >::operator()(), eoPBILAdditive< EOT >::operator()(), eoCheckPoint< EOT >::operator()(), eoSequentialSelect< EOT >::setup(), and eoPop< Dummy >::sortedPrintOn().
+.SS "template void \fBeoPop\fP< \fBEOT\fP >::shuffle (void)\fC [inline]\fP"
+.PP
+shuffle the population. 
+.PP
+Use this member to put the population in random order 
+.PP
+Definition at line 152 of file eoPop.h.
+.PP
+Referenced by eoTruncatedSelectMany< EOT >::operator()(), eoRandomSplit< EOT >::operator()(), eoRandomReduce< EOT >::operator()(), eoEliteSequentialSelect< EOT >::setup(), and eoSequentialSelect< EOT >::setup().
+.SS "template \fBeoPop\fP<\fBEOT\fP>::iterator \fBeoPop\fP< \fBEOT\fP >::nth_element (int nth)\fC [inline]\fP"
+.PP
+slightly faster algorithm than sort to find all individuals that are better than the nth individual. 
+.PP
+INDIVIDUALS ARE MOVED AROUND in the pop. 
+.PP
+Definition at line 201 of file eoPop.h.
+.PP
+Referenced by eoDeterministicSurviveAndDie< EOT >::operator()(), eoTruncateSplit< EOT >::operator()(), eoReduceMergeReduce< EOT >::operator()(), eoTruncate< EOT >::operator()(), eoElitism< EOT >::operator()(), and eoTruncatedSelectOne< EOT >::setup().
+.SS "template virtual void \fBeoPop\fP< \fBEOT\fP >::sortedPrintOn (std::ostream & _os) const\fC [inline, virtual]\fP"
+.PP
+Prints sorted pop but does NOT modify it! 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_os\fP A std::ostream. 
+.RE
+.PP
+
+.PP
+Definition at line 247 of file eoPop.h.
+.SS "template virtual void \fBeoPop\fP< \fBEOT\fP >::printOn (std::ostream & _os) const\fC [inline, virtual]\fP"
+.PP
+Write object. 
+.PP
+It's called printOn since it prints the object _on_ a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_os\fP A std::ostream. 
+.RE
+.PP
+
+.PP
+Implements \fBeoPrintable\fP.
+.PP
+Definition at line 262 of file eoPop.h.
+.SS "template virtual void \fBeoPop\fP< \fBEOT\fP >::readFrom (std::istream & _is)\fC [inline, virtual]\fP"
+.PP
+Read object. 
+.PP
+The EOT class must have a ctor from a stream; 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_is\fP A std::istream. 
+.RE
+.PP
+
+.PP
+Implements \fBeoPersistent\fP.
+.PP
+Definition at line 274 of file eoPop.h.
+.PP
+Referenced by eoPop< Dummy >::eoPop().
+.SS "template virtual std::string \fBeoPop\fP< \fBEOT\fP >::className (void) const\fC [inline, virtual]\fP"
+.PP
+Inherited from \fBeoObject\fP. 
+.PP
+Returns the class name. 
+.PP
+\fBSee also:\fP
+.RS 4
+\fBeoObject\fP 
+.RE
+.PP
+
+.PP
+Implements \fBeoObject\fP.
+.PP
+Definition at line 289 of file eoPop.h.
+.PP
+Referenced by eoCheckPoint< EOT >::allClassNames().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoPopAlgo.3 b/trunk/paradiseo-eo/doc/man/man3/eoPopAlgo.3
new file mode 100644
index 000000000..f9166ccb4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoPopAlgo.3
@@ -0,0 +1,25 @@
+.TH "eoPopAlgo" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoPopAlgo \- For all 'population transforming' algos ...  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoUF< eoPop< EOT > &, void >\fP.
+.PP
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoPopAlgo< EOT >"
+For all 'population transforming' algos ... 
+.PP
+Definition at line 13 of file eoPopAlgo.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoPopEvalFunc.3 b/trunk/paradiseo-eo/doc/man/man3/eoPopEvalFunc.3
new file mode 100644
index 000000000..08026ac1a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoPopEvalFunc.3
@@ -0,0 +1,37 @@
+.TH "eoPopEvalFunc" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoPopEvalFunc \- eoPopEvalFunc: This abstract class is for GLOBAL evaluators of a population after variation.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoBF< eoPop< EOT > &, eoPop< EOT > &, void >\fP.
+.PP
+Inherited by \fBeoPopLoopEval< EOT >\fP, and \fBeoTimeVaryingLoopEval< EOT >\fP.
+.PP
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoPopEvalFunc< EOT >"
+eoPopEvalFunc: This abstract class is for GLOBAL evaluators of a population after variation. 
+
+It takes 2 populations (typically the parents and the offspring) and is suppposed to evaluate them alltogether
+.PP
+Basic use: apply an embedded \fBeoEvalFunc\fP to the offspring
+.PP
+Time-varying fitness: apply the embedded \fBeoEvalFunc\fP to both offspring and parents
+.PP
+Advanced uses: Co-evolution or 'parisian' approach, or ...
+.PP
+Basic parallelization (synchronous standard evolution engine): call the slaves and wait for the results 
+.PP
+Definition at line 49 of file eoPopEvalFunc.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoPopLoopEval.3 b/trunk/paradiseo-eo/doc/man/man3/eoPopLoopEval.3
new file mode 100644
index 000000000..bc8f4ce4c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoPopLoopEval.3
@@ -0,0 +1,44 @@
+.TH "eoPopLoopEval" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoPopLoopEval \- eoPopLoopEval: an instance of \fBeoPopEvalFunc\fP that simply applies a private \fBeoEvalFunc\fP to all offspring  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoPopEvalFunc< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoPopLoopEval\fP (\fBeoEvalFunc\fP< \fBEOT\fP > &_eval)"
+.br
+.RI "\fICtor: set value of embedded \fBeoEvalFunc\fP. \fP"
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_parents, \fBeoPop\fP< \fBEOT\fP > &_offspring)"
+.br
+.RI "\fIDo the job: simple loop over the offspring. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoEvalFunc\fP< \fBEOT\fP > & \fBeval\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoPopLoopEval< EOT >"
+eoPopLoopEval: an instance of \fBeoPopEvalFunc\fP that simply applies a private \fBeoEvalFunc\fP to all offspring 
+.PP
+Definition at line 60 of file eoPopEvalFunc.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoPopStat.3 b/trunk/paradiseo-eo/doc/man/man3/eoPopStat.3
new file mode 100644
index 000000000..cbc44f8d8
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoPopStat.3
@@ -0,0 +1,72 @@
+.TH "eoPopStat" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoPopStat \- Thanks to MS/VC++, \fBeoParam\fP mechanism is unable to handle std::vectors of stats.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoStat< EOT, std::string >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoPopStat\fP (unsigned _howMany=0, std::string _desc='')"
+.br
+.RI "\fIdefault Ctor, void std::string by default, as it appears on the description line once at beginning of evolution. \fP"
+.ti -1c
+.RI "void \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIFills the \fBvalue()\fP of the \fBeoParam\fP with the dump of the population. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBcombien\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoPopStat< EOT >"
+Thanks to MS/VC++, \fBeoParam\fP mechanism is unable to handle std::vectors of stats. 
+
+This snippet is a workaround: This class will 'print' a whole population into a std::string - that you can later send to any stream This is the plain version - see eoPopString for the Sorted version
+.PP
+Note: this Stat should probably be used only within eoStdOutMonitor, and not inside an \fBeoFileMonitor\fP, as the \fBeoState\fP construct will work much better there. 
+.PP
+Definition at line 51 of file eoPopStat.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoPopStat\fP< \fBEOT\fP >::\fBeoPopStat\fP (unsigned _howMany = \fC0\fP, std::string _desc = \fC''\fP)\fC [inline]\fP"
+.PP
+default Ctor, void std::string by default, as it appears on the description line once at beginning of evolution. 
+.PP
+and is meaningless there. _howMany defaults to 0, that is, the whole population 
+.PP
+Definition at line 61 of file eoPopStat.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template void \fBeoPopStat\fP< \fBEOT\fP >::operator() (const \fBeoPop\fP< \fBEOT\fP > & _pop)\fC [inline, virtual]\fP"
+.PP
+Fills the \fBvalue()\fP of the \fBeoParam\fP with the dump of the population. 
+.PP
+Adds a 
+.br
+ before so it does not get mixed up with the rest of the stats that are written by the monitor it is probably used from. 
+.PP
+Implements \fBeoUF< const eoPop< EOT > &, void >\fP.
+.PP
+Definition at line 68 of file eoPopStat.h.
+.PP
+References eoValueParam< std::string >::value().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoPop_Cmp.3 b/trunk/paradiseo-eo/doc/man/man3/eoPop_Cmp.3
new file mode 100644
index 000000000..c9f0506d5
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoPop_Cmp.3
@@ -0,0 +1,30 @@
+.TH "eoPop::Cmp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoPop::Cmp \- helper struct for comparing on pointers  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "bool \fBoperator()\fP (const \fBEOT\fP *a, const \fBEOT\fP *b) const "
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template struct eoPop< EOT >::Cmp"
+helper struct for comparing on pointers 
+.PP
+Definition at line 124 of file eoPop.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoPop_Ref.3 b/trunk/paradiseo-eo/doc/man/man3/eoPop_Ref.3
new file mode 100644
index 000000000..deeafe673
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoPop_Ref.3
@@ -0,0 +1,30 @@
+.TH "eoPop::Ref" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoPop::Ref \- helper struct for getting a pointer  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "const \fBEOT\fP * \fBoperator()\fP (const \fBEOT\fP &eot)"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template struct eoPop< EOT >::Ref"
+helper struct for getting a pointer 
+.PP
+Definition at line 122 of file eoPop.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoPopulator.3 b/trunk/paradiseo-eo/doc/man/man3/eoPopulator.3
new file mode 100644
index 000000000..f40c3a1bd
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoPopulator.3
@@ -0,0 +1,130 @@
+.TH "eoPopulator" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoPopulator \- eoPopulator is a helper class for general operators \fBeoGenOp\fP It is an \fBeoPop\fP but also behaves like an eoPop::iterator as far as operator* and operator++ are concerned  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherited by \fBeoSelectivePopulator< EOT >\fP, and \fBeoSeqPopulator< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef unsigned \fBposition_type\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoPopulator\fP (const \fBeoPop\fP< \fBEOT\fP > &_src, \fBeoPop\fP< \fBEOT\fP > &_dest)"
+.br
+.ti -1c
+.RI "virtual \fB~eoPopulator\fP ()"
+.br
+.RI "\fIVirtual Constructor. \fP"
+.ti -1c
+.RI "\fBEOT\fP & \fBoperator *\fP (void)"
+.br
+.RI "\fIa populator behaves like an iterator. \fP"
+.ti -1c
+.RI "\fBeoPopulator\fP & \fBoperator++\fP ()"
+.br
+.RI "\fIonly prefix increment defined Does not add a new element when at the end, use operator* for that If not on the end, increment the pointer to the next individual \fP"
+.ti -1c
+.RI "void \fBinsert\fP (const \fBEOT\fP &_eo)"
+.br
+.RI "\fImandatory for operators that generate more offspring than parents if such a thing exists ? \fP"
+.ti -1c
+.RI "void \fBreserve\fP (int how_many)"
+.br
+.RI "\fIjust to make memory mangement more efficient \fP"
+.ti -1c
+.RI "const \fBeoPop\fP< \fBEOT\fP > & \fBsource\fP (void)"
+.br
+.RI "\fIcan be useful for operators with embedded selectors e.g. \fP"
+.ti -1c
+.RI "\fBeoPop\fP< \fBEOT\fP > & \fBoffspring\fP (void)"
+.br
+.RI "\fIGet the offspring population. \fP"
+.ti -1c
+.RI "position_type \fBtellp\fP ()"
+.br
+.RI "\fIthis is a direct access container: tell position \fP"
+.ti -1c
+.RI "void \fBseekp\fP (position_type pos)"
+.br
+.RI "\fIthis is a direct access container: go to position \fP"
+.ti -1c
+.RI "bool \fBexhausted\fP (void)"
+.br
+.RI "\fIno more individuals \fP"
+.ti -1c
+.RI "virtual const \fBEOT\fP & \fBselect\fP ()=0"
+.br
+.RI "\fIthe pure virtual selection method - will be instanciated in \fBeoSeqPopulator\fP and \fBeoSelectivePopulator\fP \fP"
+.in -1c
+.SS "Protected Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoPop\fP< \fBEOT\fP > & \fBdest\fP"
+.br
+.ti -1c
+.RI "\fBeoPop\fP< \fBEOT\fP >::iterator \fBcurrent\fP"
+.br
+.ti -1c
+.RI "const \fBeoPop\fP< \fBEOT\fP > & \fBsrc\fP"
+.br
+.in -1c
+.SS "Private Member Functions"
+
+.in +1c
+.ti -1c
+.RI "void \fBget_next\fP ()"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoPopulator< EOT >"
+eoPopulator is a helper class for general operators \fBeoGenOp\fP It is an \fBeoPop\fP but also behaves like an eoPop::iterator as far as operator* and operator++ are concerned 
+
+See \fBeoGenOp\fP and \fBeoOpContainer\fP 
+.PP
+Definition at line 39 of file eoPopulator.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template \fBEOT\fP& \fBeoPopulator\fP< \fBEOT\fP >::operator * (void)\fC [inline]\fP"
+.PP
+a populator behaves like an iterator. 
+.PP
+Hence the operator* it returns the current individual -- eventually getting a new one through the operator++ if at the end 
+.PP
+Definition at line 58 of file eoPopulator.h.
+.SS "template const \fBeoPop\fP<\fBEOT\fP>& \fBeoPopulator\fP< \fBEOT\fP >::source (void)\fC [inline]\fP"
+.PP
+can be useful for operators with embedded selectors e.g. 
+.PP
+your brain and my beauty -type 
+.PP
+Definition at line 105 of file eoPopulator.h.
+.PP
+Referenced by eoSelBinGenOp< EOT >::apply(), and eoEsGlobalXover< EOT >::apply().
+.SS "template \fBeoPop\fP<\fBEOT\fP>& \fBeoPopulator\fP< \fBEOT\fP >::offspring (void)\fC [inline]\fP"
+.PP
+Get the offspring population. 
+.PP
+Can be useful when you want to do some online niching kind of thing 
+.PP
+Definition at line 110 of file eoPopulator.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoPrintable.3 b/trunk/paradiseo-eo/doc/man/man3/eoPrintable.3
new file mode 100644
index 000000000..49026fd26
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoPrintable.3
@@ -0,0 +1,55 @@
+.TH "eoPrintable" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoPrintable \- Base class for objects that can print themselves (\fBprintOn\fP#).  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherited by \fBeoPersistent\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual \fB~eoPrintable\fP ()"
+.br
+.RI "\fIVirtual dtor. They are needed in virtual class hierarchies. \fP"
+.ti -1c
+.RI "virtual void \fBprintOn\fP (std::ostream &_os) const =0"
+.br
+.RI "\fIWrite object. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+Base class for objects that can print themselves (\fBprintOn\fP#). 
+
+Besides, this file defines the standard output for all the objects; if the objects define printOn there's no need to define #operator <<#.\\ This functionality was separated from \fBeoObject\fP, since it makes no sense to print some objects (for instance, a \fBeoFactory\fP# or a random number generator. 
+.PP
+Definition at line 43 of file eoPrintable.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "virtual void eoPrintable::printOn (std::ostream & _os) const\fC [pure virtual]\fP"
+.PP
+Write object. 
+.PP
+It's called printOn since it prints the object on a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_os\fP A std::ostream. 
+.RE
+.PP
+
+.PP
+Implemented in \fBEO< F >\fP, \fBeoContinue< EOT >\fP, \fBeoGenContinue< EOT >\fP, \fBeoPop< EOT >\fP, \fBeoVector< FitT, GeneType >\fP, \fBeoEsFull< Fit >\fP, \fBeoEsSimple< Fit >\fP, \fBeoEsStdev< Fit >\fP, \fBeoBit< FitT >\fP, \fBeoPBILDistrib< EOT >\fP, \fBeoParseTree< FType, Node >\fP, \fBeoExternalEO< Fit, External >\fP, \fBeoString< fitnessT >\fP, \fBeoHowMany\fP, \fBeoIntNoBounds\fP, \fBeoIntInterval\fP, \fBeoIntBelowBound\fP, \fBeoIntAboveBound\fP, \fBeoGeneralIntBounds\fP, \fBeoParser\fP, \fBeoRealNoBounds\fP, \fBeoRealInterval\fP, \fBeoRealBelowBound\fP, \fBeoRealAboveBound\fP, \fBeoGeneralRealBounds\fP, \fBeoRealVectorBounds\fP, \fBeoRng\fP, \fBDummy\fP, \fBDummy\fP, \fBDummy\fP, \fBDummy\fP, \fBEO< double >\fP, \fBEO< EOT::Fitness >\fP, \fBEO< FitT >\fP, \fBEO< phenotype >\fP, \fBEO< fitnessT >\fP, \fBEO< Fit >\fP, \fBEO< FType >\fP, \fBEO< fitness_type >\fP, \fBEO< Fitness >\fP, \fBEO< PyFitness >\fP, \fBeoPop< PyEO >\fP, \fBeoPop< Dummy >\fP, \fBeoVector< Fit, double >\fP, \fBeoVector< FitT, double >\fP, and \fBeoVector< FitT, bool >\fP.
+.PP
+Referenced by eoRealVectorBounds::printOn(), eoGeneralRealBounds::printOn(), eoGeneralIntBounds::printOn(), and eoState::save().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoProcedureCounter.3 b/trunk/paradiseo-eo/doc/man/man3/eoProcedureCounter.3
new file mode 100644
index 000000000..65e0b3809
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoProcedureCounter.3
@@ -0,0 +1,64 @@
+.TH "eoProcedureCounter" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoProcedureCounter \- Generic counter class that counts the number of times a procedure is used.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoValueParam< unsigned long >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoProcedureCounter\fP (Procedure &_proc, std::string _name='proc_counter')"
+.br
+.ti -1c
+.RI "Procedure::result_type \fBoperator()\fP (void)"
+.br
+.RI "\fICalls the embedded function and increments the counter. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "Procedure & \fBproc\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoProcedureCounter< Procedure >"
+Generic counter class that counts the number of times a procedure is used. 
+
+Add a procedure through its ctor and use this class instead of it.
+.PP
+It is derived from \fBeoValueParam\fP so you can add it to a monitor. 
+.PP
+Definition at line 41 of file eoCounter.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template Procedure::result_type \fBeoProcedureCounter\fP< Procedure >::operator() (void)\fC [inline]\fP"
+.PP
+Calls the embedded function and increments the counter. 
+.PP
+Note for MSVC users, if this code does not compile, you are quite likely trying to count a function that has a non-void return type. Don't look at us, look at the MSVC builders. Code like 'return void;' is perfectly legal according to the ANSI standard, but the guys at Microsoft didn't get to implementing it yet.
+.PP
+We had two choices: assuming (and compiling ) code that returns void or code that returns non-void. Given that in \fBEO\fP most functors return void, it was chosen to support void.
+.PP
+But also please let me know if you have a compiler that defines _MSC_VER (lot's of windows compilers do), but is quite capable of compiling return void; type of code. We'll try to change the signature then.
+.PP
+You happy GNU (and other compiler) users will not have a problem with this.. 
+.PP
+Definition at line 64 of file eoCounter.h.
+.PP
+References eoValueParam< unsigned long >::value().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoPropCombinedBinOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoPropCombinedBinOp.3
new file mode 100644
index 000000000..13f97c6b2
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoPropCombinedBinOp.3
@@ -0,0 +1,53 @@
+.TH "eoPropCombinedBinOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoPropCombinedBinOp \- COmbined Binary genetic operator: operator() has two operands, only the first one can be modified.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoBinOp< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoPropCombinedBinOp\fP (\fBeoBinOp\fP< \fBEOT\fP > &_first, const double _rate)"
+.br
+.RI "\fICtor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.ti -1c
+.RI "virtual void \fBadd\fP (\fBeoBinOp\fP< \fBEOT\fP > &_op, const double _rate, bool _verbose=false)"
+.br
+.ti -1c
+.RI "virtual void \fBoperator()\fP (\fBEOT\fP &_indi1, const \fBEOT\fP &_indi2)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "std::vector< \fBeoBinOp\fP< \fBEOT\fP > * > \fBops\fP"
+.br
+.ti -1c
+.RI "std::vector< double > \fBrates\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoPropCombinedBinOp< EOT >"
+COmbined Binary genetic operator: operator() has two operands, only the first one can be modified. 
+.PP
+Definition at line 109 of file eoProportionalCombinedOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoPropCombinedMonOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoPropCombinedMonOp.3
new file mode 100644
index 000000000..ecebc4ebd
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoPropCombinedMonOp.3
@@ -0,0 +1,58 @@
+.TH "eoPropCombinedMonOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoPropCombinedMonOp \- \fBeoMonOp\fP is the monary operator: genetic operator that takes only one \fBEO\fP  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoPropCombinedMonOp\fP (\fBeoMonOp\fP< \fBEOT\fP > &_first, const double _rate)"
+.br
+.RI "\fICtor from a 'true' operator. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.ti -1c
+.RI "virtual void \fBadd\fP (\fBeoMonOp\fP< \fBEOT\fP > &_op, const double _rate, bool _verbose=false)"
+.br
+.ti -1c
+.RI "virtual void \fBprintOn\fP (std::ostream &_os)"
+.br
+.ti -1c
+.RI "virtual bool \fBoperator()\fP (\fBEOT\fP &_indi)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Protected Attributes"
+
+.in +1c
+.ti -1c
+.RI "std::vector< \fBeoMonOp\fP< \fBEOT\fP > * > \fBops\fP"
+.br
+.ti -1c
+.RI "std::vector< double > \fBrates\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoPropCombinedMonOp< EOT >"
+\fBeoMonOp\fP is the monary operator: genetic operator that takes only one \fBEO\fP 
+
+now accepts generic operators 
+.PP
+Definition at line 58 of file eoProportionalCombinedOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoPropCombinedQuadOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoPropCombinedQuadOp.3
new file mode 100644
index 000000000..4675ae813
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoPropCombinedQuadOp.3
@@ -0,0 +1,58 @@
+.TH "eoPropCombinedQuadOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoPropCombinedQuadOp \- Combined quad genetic operator: operator() has two operands, both can be modified.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoQuadOp< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoPropCombinedQuadOp\fP (\fBeoQuadOp\fP< \fBEOT\fP > &_first, const double _rate)"
+.br
+.RI "\fICtor from a true operator. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.ti -1c
+.RI "virtual void \fBadd\fP (\fBeoQuadOp\fP< \fBEOT\fP > &_op, const double _rate, bool _verbose=false)"
+.br
+.ti -1c
+.RI "virtual void \fBprintOn\fP (std::ostream &_os)"
+.br
+.ti -1c
+.RI "virtual bool \fBoperator()\fP (\fBEOT\fP &_indi1, \fBEOT\fP &_indi2)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "std::vector< \fBeoQuadOp\fP< \fBEOT\fP > * > \fBops\fP"
+.br
+.ti -1c
+.RI "std::vector< double > \fBrates\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoPropCombinedQuadOp< EOT >"
+Combined quad genetic operator: operator() has two operands, both can be modified. 
+
+generic operators are now allowed: there are imbedded into the corresponding 'true' operator 
+.PP
+Definition at line 163 of file eoProportionalCombinedOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoPropGAGenOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoPropGAGenOp.3
new file mode 100644
index 000000000..1da1824db
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoPropGAGenOp.3
@@ -0,0 +1,69 @@
+.TH "eoPropGAGenOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoPropGAGenOp \- *************************************************************************** eoPropGAGenOp (for Simple GA, but Proportional) choice between Crossover, mutation or cloining with respect to given relatve weights  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoGenOp< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoPropGAGenOp\fP (double _wClone, \fBeoQuadOp\fP< \fBEOT\fP > &_cross, double _wCross, \fBeoMonOp\fP< \fBEOT\fP > &_mut, double _wMut)"
+.br
+.RI "\fICtor from * weight of clone * crossover (with weight) * mutation (with weight). \fP"
+.ti -1c
+.RI "virtual void \fBapply\fP (\fBeoPopulator\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIdo the job: delegate to op \fP"
+.ti -1c
+.RI "virtual unsigned \fBmax_production\fP (void)"
+.br
+.RI "\fIinherited from \fBeoGenOp\fP \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBwClone\fP"
+.br
+.ti -1c
+.RI "\fBeoQuadOp\fP< \fBEOT\fP > & \fBcross\fP"
+.br
+.ti -1c
+.RI "double \fBwCross\fP"
+.br
+.ti -1c
+.RI "\fBeoMonOp\fP< \fBEOT\fP > & \fBmut\fP"
+.br
+.ti -1c
+.RI "double \fBwMut\fP"
+.br
+.ti -1c
+.RI "\fBeoProportionalOp\fP< \fBEOT\fP > \fBpropOp\fP"
+.br
+.ti -1c
+.RI "\fBeoMonCloneOp\fP< \fBEOT\fP > \fBmonClone\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoPropGAGenOp< EOT >"
+*************************************************************************** eoPropGAGenOp (for Simple GA, but Proportional) choice between Crossover, mutation or cloining with respect to given relatve weights 
+.PP
+Definition at line 42 of file eoPropGAGenOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoProportionalOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoProportionalOp.3
new file mode 100644
index 000000000..d9e4b9e46
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoProportionalOp.3
@@ -0,0 +1,36 @@
+.TH "eoProportionalOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoProportionalOp \- The proportional versions: easy!  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoOpContainer< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "void \fBapply\fP (\fBeoPopulator\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIthe function that will do the work \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoProportionalOp< EOT >"
+The proportional versions: easy! 
+.PP
+Definition at line 135 of file eoOpContainer.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoProportionalSelect.3 b/trunk/paradiseo-eo/doc/man/man3/eoProportionalSelect.3
new file mode 100644
index 000000000..d6d32a29b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoProportionalSelect.3
@@ -0,0 +1,57 @@
+.TH "eoProportionalSelect" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoProportionalSelect \- eoProportionalSelect: select an individual proportional to her stored fitness value  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoSelectOne< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoProportionalSelect\fP (const \fBeoPop\fP< \fBEOT\fP > &pop=\fBeoPop\fP< \fBEOT\fP >())"
+.br
+.RI "\fISanity check. \fP"
+.ti -1c
+.RI "void \fBsetup\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIvirtual function to setup some population stats (for instance eoProportional can benefit greatly from this) \fP"
+.ti -1c
+.RI "const \fBEOT\fP & \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIdo the selection, \fP"
+.in -1c
+.SS "Private Types"
+
+.in +1c
+.ti -1c
+.RI "typedef std::vector< typename EOT::Fitness > \fBFitVec\fP"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "FitVec \fBcumulative\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoProportionalSelect< EOT >"
+eoProportionalSelect: select an individual proportional to her stored fitness value 
+
+Changed the algorithm to make use of a cumulative array of fitness scores, This changes the algorithm from O(n) per call to O(log n) per call. (MK) 
+.PP
+Definition at line 45 of file eoProportionalSelect.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoQuad2BinOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoQuad2BinOp.3
new file mode 100644
index 000000000..f23b2e858
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoQuad2BinOp.3
@@ -0,0 +1,58 @@
+.TH "eoQuad2BinOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoQuad2BinOp \- Turning an \fBeoQuadOp\fP into an \fBeoBinOp\fP: simply don't touch the second arg!  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoBinOp< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoQuad2BinOp\fP (\fBeoQuadOp\fP< \fBEOT\fP > &_quadOp)"
+.br
+.RI "\fICtor. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eo1, const \fBEOT\fP &_eo2)"
+.br
+.RI "\fIOperator() simply calls embedded quadOp operator() with dummy second arg. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoQuadOp\fP< \fBEOT\fP > & \fBquadOp\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoQuad2BinOp< EOT >"
+Turning an \fBeoQuadOp\fP into an \fBeoBinOp\fP: simply don't touch the second arg! 
+.PP
+Definition at line 143 of file eoOp.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoQuad2BinOp\fP< \fBEOT\fP >::\fBeoQuad2BinOp\fP (\fBeoQuadOp\fP< \fBEOT\fP > & _quadOp)\fC [inline]\fP"
+.PP
+Ctor. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_quadOp\fP the \fBeoQuadOp\fP to be transformed 
+.RE
+.PP
+
+.PP
+Definition at line 149 of file eoOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoQuadCloneOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoQuadCloneOp.3
new file mode 100644
index 000000000..cbc46b497
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoQuadCloneOp.3
@@ -0,0 +1,40 @@
+.TH "eoQuadCloneOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoQuadCloneOp \- Quad clone: two operands, both could be modified - but are not!  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoQuadOp< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoQuadCloneOp\fP ()"
+.br
+.RI "\fICtor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.ti -1c
+.RI "virtual bool \fBoperator()\fP (\fBEOT\fP &, \fBEOT\fP &)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoQuadCloneOp< EOT >"
+Quad clone: two operands, both could be modified - but are not! 
+.PP
+Definition at line 69 of file eoCloneOps.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoQuadDistance.3 b/trunk/paradiseo-eo/doc/man/man3/eoQuadDistance.3
new file mode 100644
index 000000000..db41f4421
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoQuadDistance.3
@@ -0,0 +1,33 @@
+.TH "eoQuadDistance" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoQuadDistance \- This is a generic class for Euclidain distance (L2 norm) computation: assumes the 2 things are std::vectors of something that is double-castable.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoDistance< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "double \fBoperator()\fP (const \fBEOT\fP &_v1, const \fBEOT\fP &_v2)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoQuadDistance< EOT >"
+This is a generic class for Euclidain distance (L2 norm) computation: assumes the 2 things are std::vectors of something that is double-castable. 
+.PP
+Definition at line 44 of file eoDistance.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoQuadGenOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoQuadGenOp.3
new file mode 100644
index 000000000..6e5e8a965
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoQuadGenOp.3
@@ -0,0 +1,50 @@
+.TH "eoQuadGenOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoQuadGenOp \- Wrapper for quadop: easy as pie.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoGenOp< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoQuadGenOp\fP (\fBeoQuadOp\fP< \fBEOT\fP > &_op)"
+.br
+.ti -1c
+.RI "unsigned \fBmax_production\fP (void)"
+.br
+.RI "\fIMax production is used to reserve space for all elements that are used by the operator, not setting it properly can result in a crash. \fP"
+.ti -1c
+.RI "void \fBapply\fP (\fBeoPopulator\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIthe function that will do the work \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoQuadOp\fP< \fBEOT\fP > & \fBop\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoQuadGenOp< EOT >"
+Wrapper for quadop: easy as pie. 
+.PP
+Definition at line 157 of file eoGenOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoQuadOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoQuadOp.3
new file mode 100644
index 000000000..3bb9eb078
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoQuadOp.3
@@ -0,0 +1,38 @@
+.TH "eoQuadOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoQuadOp \- Quad genetic operator: subclasses \fBeoOp\fP, and defines basically the operator() with two operands, both can be modified.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoOp< EOType >< EOType >\fP, and \fBeoBF< EOType &, EOType &, bool >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoQuadOp\fP ()"
+.br
+.RI "\fICtor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoQuadOp< EOType >"
+Quad genetic operator: subclasses \fBeoOp\fP, and defines basically the operator() with two operands, both can be modified. 
+
+When defining your own, make sure that you return a boolean value indicating that you have changed the content. 
+.PP
+Definition at line 132 of file eoOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoRandomReduce.3 b/trunk/paradiseo-eo/doc/man/man3/eoRandomReduce.3
new file mode 100644
index 000000000..632b8f556
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoRandomReduce.3
@@ -0,0 +1,33 @@
+.TH "eoRandomReduce" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoRandomReduce \- random truncation  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoReduce< EOT >< EOT >\fP.
+.PP
+.SS "Private Member Functions"
+
+.in +1c
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_newgen, unsigned _newsize)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoRandomReduce< EOT >"
+random truncation 
+.PP
+Definition at line 64 of file eoReduce.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoRandomSelect.3 b/trunk/paradiseo-eo/doc/man/man3/eoRandomSelect.3
new file mode 100644
index 000000000..4a8b5d639
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoRandomSelect.3
@@ -0,0 +1,33 @@
+.TH "eoRandomSelect" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoRandomSelect \- eoRandomSelect: a selection method that selects ONE individual randomly  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoSelectOne< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual const \fBEOT\fP & \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fInot a big deal!!! \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoRandomSelect< EOT >"
+eoRandomSelect: a selection method that selects ONE individual randomly 
+.PP
+Definition at line 44 of file eoRandomSelect.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoRandomSplit.3 b/trunk/paradiseo-eo/doc/man/man3/eoRandomSplit.3
new file mode 100644
index 000000000..e9eba2d71
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoRandomSplit.3
@@ -0,0 +1,47 @@
+.TH "eoRandomSplit" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoRandomSplit \- random truncation - batch version  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoReduceSplit< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoRandomSplit\fP (\fBeoHowMany\fP _howMany, bool _returnEliminated=false)"
+.br
+.RI "\fICtor: must provide amount of reduction, and whether or not you need to return the eliminated guys. \fP"
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_newgen, \fBeoPop\fP< \fBEOT\fP > &_eliminated)"
+.br
+.RI "\fIdo the job \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoHowMany\fP \fBhowMany\fP"
+.br
+.ti -1c
+.RI "bool \fBreturnEliminated\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoRandomSplit< EOT >"
+random truncation - batch version 
+.PP
+Definition at line 124 of file eoReduceSplit.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoRanking.3 b/trunk/paradiseo-eo/doc/man/man3/eoRanking.3
new file mode 100644
index 000000000..5658e4208
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoRanking.3
@@ -0,0 +1,51 @@
+.TH "eoRanking" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoRanking \- An instance of eoPerfFromWorth COmputes the ranked fitness: fitnesses range in [m,M] with m=2-pressure/popSize and M=pressure/popSize.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoPerf2Worth< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoRanking\fP (double _p=2.0, double _e=1.0)"
+.br
+.ti -1c
+.RI "int \fBlookfor\fP (const \fBEOT\fP *_eo, const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.ti -1c
+.RI "virtual void \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBpressure\fP"
+.br
+.ti -1c
+.RI "double \fBexponent\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoRanking< EOT >"
+An instance of eoPerfFromWorth COmputes the ranked fitness: fitnesses range in [m,M] with m=2-pressure/popSize and M=pressure/popSize. 
+
+in between, the progression depstd::ends on exponent (linear if 1). 
+.PP
+Definition at line 38 of file eoRanking.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoRankingSelect.3 b/trunk/paradiseo-eo/doc/man/man3/eoRankingSelect.3
new file mode 100644
index 000000000..aca925dca
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoRankingSelect.3
@@ -0,0 +1,58 @@
+.TH "eoRankingSelect" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoRankingSelect \- eoRankingSelect: select an individual by roulette wheel on its rank is an \fBeoRouletteWorthSelect\fP, i.e.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoRouletteWorthSelect< EOT, double >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoRankingSelect\fP (double _p=2.0, double _e=1.0)"
+.br
+.RI "\fICtor:. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoRanking\fP< \fBEOT\fP > \fBranking\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoRankingSelect< EOT >"
+eoRankingSelect: select an individual by roulette wheel on its rank is an \fBeoRouletteWorthSelect\fP, i.e. 
+
+a selector using a std::vector of worthes rather than the raw fitness (see \fBeoSelectFromWorth.h\fP) uses an internal \fBeoRanking\fP object which is an \fBeoPerf2Worth\fP 
+.PP
+Definition at line 41 of file eoRankingSelect.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoRankingSelect\fP< \fBEOT\fP >::\fBeoRankingSelect\fP (double _p = \fC2.0\fP, double _e = \fC1.0\fP)\fC [inline]\fP"
+.PP
+Ctor:. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_p\fP the selective pressure, should be in [1,2] (2 is the default) 
+.br
+\fI_e\fP exponent (1 == linear) 
+.RE
+.PP
+
+.PP
+Definition at line 48 of file eoRankingSelect.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoReal.3 b/trunk/paradiseo-eo/doc/man/man3/eoReal.3
new file mode 100644
index 000000000..e6d43981c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoReal.3
@@ -0,0 +1,53 @@
+.TH "eoReal" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoReal \- eoReal: implementation of simple real-valued chromosome.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoVector< FitT, double >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoReal\fP (unsigned size=0, double value=0.0)"
+.br
+.RI "\fI(Default) Constructor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIMy class name. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoReal< FitT >"
+eoReal: implementation of simple real-valued chromosome. 
+
+based on \fBeoVector\fP class 
+.PP
+Definition at line 37 of file eoReal.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoReal\fP< \fBFitT\fP >::\fBeoReal\fP (unsigned size = \fC0\fP, double value = \fC0.0\fP)\fC [inline]\fP"
+.PP
+(Default) Constructor. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIsize\fP Size of the std::vector 
+.RE
+.PP
+
+.PP
+Definition at line 45 of file eoReal.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoRealAboveBound.3 b/trunk/paradiseo-eo/doc/man/man3/eoRealAboveBound.3
new file mode 100644
index 000000000..b26ed9609
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoRealAboveBound.3
@@ -0,0 +1,126 @@
+.TH "eoRealAboveBound" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoRealAboveBound \- An eoRealBound bounded from above only.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoRealBounds\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoRealAboveBound\fP (double _max=0)"
+.br
+.RI "\fISimple bounds = minimum. \fP"
+.ti -1c
+.RI "virtual double \fBmaximum\fP () const "
+.br
+.RI "\fIget maximum value ::exception if does not exist \fP"
+.ti -1c
+.RI "virtual double \fBminimum\fP () const "
+.br
+.RI "\fIget minimum value ::exception if does not exist \fP"
+.ti -1c
+.RI "virtual double \fBrange\fP () const "
+.br
+.RI "\fIget range ::exception if unbounded \fP"
+.ti -1c
+.RI "virtual double \fBuniform\fP (\fBeoRng\fP &_rng=eo::rng) const "
+.br
+.RI "\fIrandom generator of uniform numbers in bounds ::exception if unbounded \fP"
+.ti -1c
+.RI "virtual bool \fBisBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: true if ***both*** a min and a max. \fP"
+.ti -1c
+.RI "virtual bool \fBhasNoBoundAtAll\fP (void) const "
+.br
+.RI "\fISelf-Test: true if no min ***and*** no max hence no further need to test/truncate/fold anything. \fP"
+.ti -1c
+.RI "virtual bool \fBisMinBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: bounded from below??? \fP"
+.ti -1c
+.RI "virtual bool \fBisMaxBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: bounded from above??? \fP"
+.ti -1c
+.RI "virtual bool \fBisInBounds\fP (double _r) const "
+.br
+.RI "\fITest on a value: is it in bounds? \fP"
+.ti -1c
+.RI "virtual void \fBfoldsInBounds\fP (double &_r) const "
+.br
+.RI "\fIPut value back into bounds - by folding back and forth. \fP"
+.ti -1c
+.RI "virtual void \fBtruncate\fP (double &_r) const "
+.br
+.RI "\fIPut value back into bounds - by truncating to a boundary value. \fP"
+.ti -1c
+.RI "virtual void \fBreadFrom\fP (std::istream &_is)"
+.br
+.RI "\fIRead object. \fP"
+.ti -1c
+.RI "virtual void \fBprintOn\fP (std::ostream &_os) const "
+.br
+.RI "\fIWrite object. \fP"
+.ti -1c
+.RI "virtual \fBeoRealBounds\fP * \fBdup\fP () const "
+.br
+.RI "\fIfor memory managements - ugly \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBrepMaximum\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+An eoRealBound bounded from above only. 
+.PP
+Definition at line 409 of file eoRealBounds.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "virtual void eoRealAboveBound::readFrom (std::istream & _is)\fC [inline, virtual]\fP"
+.PP
+Read object. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_is\fP A std::istream. but reading should not be done here, because of bound problems see \fBeoRealVectorBounds\fP 
+.RE
+.PP
+
+.PP
+Implements \fBeoPersistent\fP.
+.PP
+Definition at line 477 of file eoRealBounds.h.
+.SS "virtual void eoRealAboveBound::printOn (std::ostream & _os) const\fC [inline, virtual]\fP"
+.PP
+Write object. 
+.PP
+It's called printOn since it prints the object on a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_os\fP A std::ostream. 
+.RE
+.PP
+
+.PP
+Implements \fBeoPrintable\fP.
+.PP
+Definition at line 486 of file eoRealBounds.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoRealBaseVectorBounds.3 b/trunk/paradiseo-eo/doc/man/man3/eoRealBaseVectorBounds.3
new file mode 100644
index 000000000..d966474a1
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoRealBaseVectorBounds.3
@@ -0,0 +1,135 @@
+.TH "eoRealBaseVectorBounds" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoRealBaseVectorBounds \- Vector type for bounds (see \fBeoRealBounds.h\fP for scalar types) ------------ Class \fBeoRealVectorBounds\fP implements the std::vectorized version: it is basically a std::vector of \fBeoRealBounds\fP * and forwards all request to the elements of the std::vector.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherited by \fBeoRealVectorBounds\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoRealBaseVectorBounds\fP ()"
+.br
+.RI "\fIDefault Ctor. \fP"
+.ti -1c
+.RI "\fBeoRealBaseVectorBounds\fP (unsigned _dim, \fBeoRealBounds\fP &_bounds)"
+.br
+.RI "\fICtor: same bounds for everybody, given as an \fBeoRealBounds\fP. \fP"
+.ti -1c
+.RI "\fBeoRealBaseVectorBounds\fP (\fBeoRealBounds\fP &_xbounds, \fBeoRealBounds\fP &_ybounds)"
+.br
+.RI "\fICtor, particular case of dim-2. \fP"
+.ti -1c
+.RI "virtual bool \fBisBounded\fP (unsigned _i)"
+.br
+.RI "\fItest: is i_th component bounded \fP"
+.ti -1c
+.RI "virtual bool \fBisBounded\fP (void)"
+.br
+.RI "\fItest: bounded iff all are bounded \fP"
+.ti -1c
+.RI "virtual bool \fBhasNoBoundAtAll\fP (unsigned _i)"
+.br
+.RI "\fISelf-test: true iff i_th component has no bounds at all. \fP"
+.ti -1c
+.RI "virtual bool \fBhasNoBoundAtAll\fP (void)"
+.br
+.RI "\fISelf-test: true iff all components have no bound at all. \fP"
+.ti -1c
+.RI "virtual bool \fBisMinBounded\fP (unsigned _i)"
+.br
+.ti -1c
+.RI "virtual bool \fBisMaxBounded\fP (unsigned _i)"
+.br
+.ti -1c
+.RI "virtual void \fBfoldsInBounds\fP (unsigned _i, double &_r)"
+.br
+.RI "\fIFolds a real value back into the bounds - i_th component. \fP"
+.ti -1c
+.RI "virtual void \fBfoldsInBounds\fP (std::vector< double > &_v)"
+.br
+.RI "\fIFolds all variables of a std::vector of real values into the bounds. \fP"
+.ti -1c
+.RI "virtual void \fBtruncate\fP (unsigned _i, double &_r)"
+.br
+.RI "\fITruncates a real value to the bounds - i_th component. \fP"
+.ti -1c
+.RI "virtual void \fBtruncate\fP (std::vector< double > &_v)"
+.br
+.RI "\fItruncates all variables of a std::vector of real values to the bounds \fP"
+.ti -1c
+.RI "virtual bool \fBisInBounds\fP (unsigned _i, double _r)"
+.br
+.RI "\fItest: is i_th component within the bounds? \fP"
+.ti -1c
+.RI "virtual bool \fBisInBounds\fP (std::vector< double > _v)"
+.br
+.RI "\fItest: are ALL components within the bounds? \fP"
+.ti -1c
+.RI "virtual double \fBminimum\fP (unsigned _i)"
+.br
+.RI "\fIAccessors: will raise an std::exception if these do not exist. \fP"
+.ti -1c
+.RI "virtual double \fBmaximum\fP (unsigned _i)"
+.br
+.ti -1c
+.RI "virtual double \fBrange\fP (unsigned _i)"
+.br
+.ti -1c
+.RI "virtual double \fBaverageRange\fP ()"
+.br
+.RI "\fIComputes the average range An std::exception will be raised if one of the component is unbounded. \fP"
+.ti -1c
+.RI "virtual double \fBuniform\fP (unsigned _i, \fBeoRng\fP &_rng=eo::rng)"
+.br
+.RI "\fIGenerates a random number in i_th range An std::exception will be raised if one of the component is unbounded. \fP"
+.ti -1c
+.RI "void \fBuniform\fP (std::vector< double > &_v, \fBeoRng\fP &_rng=eo::rng)"
+.br
+.RI "\fIfills a std::vector with uniformly chosen variables in bounds An std::exception will be raised if one of the component is unbounded \fP"
+.ti -1c
+.RI "virtual void \fBprintOn\fP (std::ostream &_os) const "
+.br
+.RI "\fIWrite object. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+Vector type for bounds (see \fBeoRealBounds.h\fP for scalar types) ------------ Class \fBeoRealVectorBounds\fP implements the std::vectorized version: it is basically a std::vector of \fBeoRealBounds\fP * and forwards all request to the elements of the std::vector. 
+
+This file also contains the global variables and eoDummyVectorNoBounds that are used as defaults in ctors (i.e. when no bounds are given, it is assumed unbounded values)
+.PP
+THe 2 main classes defined here are
+.PP
+eoRealBaseVectorBounds, base class that handles all useful functions \fBeoRealVectorBounds\fP which derives from the preceding *and* \fBeoPersistent\fP and also has a mechanism for memory handling of the pointers it has to allocate 
+.PP
+Definition at line 58 of file eoRealVectorBounds.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "virtual void eoRealBaseVectorBounds::printOn (std::ostream & _os) const\fC [inline, virtual]\fP"
+.PP
+Write object. 
+.PP
+It's called printOn since it prints the object on a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_os\fP A std::ostream. 
+.RE
+.PP
+
+.PP
+Reimplemented in \fBeoRealVectorBounds\fP.
+.PP
+Definition at line 214 of file eoRealVectorBounds.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoRealBelowBound.3 b/trunk/paradiseo-eo/doc/man/man3/eoRealBelowBound.3
new file mode 100644
index 000000000..323cd326c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoRealBelowBound.3
@@ -0,0 +1,126 @@
+.TH "eoRealBelowBound" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoRealBelowBound \- an eoRealBound bounded from below only  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoRealBounds\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoRealBelowBound\fP (double _min=0)"
+.br
+.RI "\fISimple bounds = minimum. \fP"
+.ti -1c
+.RI "virtual double \fBminimum\fP () const "
+.br
+.RI "\fIget minimum value ::exception if does not exist \fP"
+.ti -1c
+.RI "virtual double \fBmaximum\fP () const "
+.br
+.RI "\fIget maximum value ::exception if does not exist \fP"
+.ti -1c
+.RI "virtual double \fBrange\fP () const "
+.br
+.RI "\fIget range ::exception if unbounded \fP"
+.ti -1c
+.RI "virtual double \fBuniform\fP (\fBeoRng\fP &_rng=eo::rng) const "
+.br
+.RI "\fIrandom generator of uniform numbers in bounds ::exception if unbounded \fP"
+.ti -1c
+.RI "virtual bool \fBisBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: true if ***both*** a min and a max. \fP"
+.ti -1c
+.RI "virtual bool \fBhasNoBoundAtAll\fP (void) const "
+.br
+.RI "\fISelf-Test: true if no min ***and*** no max hence no further need to test/truncate/fold anything. \fP"
+.ti -1c
+.RI "virtual bool \fBisMinBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: bounded from below??? \fP"
+.ti -1c
+.RI "virtual bool \fBisMaxBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: bounded from above??? \fP"
+.ti -1c
+.RI "virtual bool \fBisInBounds\fP (double _r) const "
+.br
+.RI "\fITest on a value: is it in bounds? \fP"
+.ti -1c
+.RI "virtual void \fBfoldsInBounds\fP (double &_r) const "
+.br
+.RI "\fIPut value back into bounds - by folding back and forth. \fP"
+.ti -1c
+.RI "virtual void \fBtruncate\fP (double &_r) const "
+.br
+.RI "\fIPut value back into bounds - by truncating to a boundary value. \fP"
+.ti -1c
+.RI "virtual void \fBreadFrom\fP (std::istream &_is)"
+.br
+.RI "\fIRead object. \fP"
+.ti -1c
+.RI "virtual void \fBprintOn\fP (std::ostream &_os) const "
+.br
+.RI "\fIWrite object. \fP"
+.ti -1c
+.RI "virtual \fBeoRealBounds\fP * \fBdup\fP () const "
+.br
+.RI "\fIfor memory managements - ugly \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBrepMinimum\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+an eoRealBound bounded from below only 
+.PP
+Definition at line 315 of file eoRealBounds.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "virtual void eoRealBelowBound::readFrom (std::istream & _is)\fC [inline, virtual]\fP"
+.PP
+Read object. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_is\fP A std::istream. but reading should not be done here, because of bound problems see \fBeoRealVectorBounds\fP 
+.RE
+.PP
+
+.PP
+Implements \fBeoPersistent\fP.
+.PP
+Definition at line 382 of file eoRealBounds.h.
+.SS "virtual void eoRealBelowBound::printOn (std::ostream & _os) const\fC [inline, virtual]\fP"
+.PP
+Write object. 
+.PP
+It's called printOn since it prints the object on a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_os\fP A std::ostream. 
+.RE
+.PP
+
+.PP
+Implements \fBeoPrintable\fP.
+.PP
+Definition at line 391 of file eoRealBounds.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoRealBounds.3 b/trunk/paradiseo-eo/doc/man/man3/eoRealBounds.3
new file mode 100644
index 000000000..f7e15a83b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoRealBounds.3
@@ -0,0 +1,103 @@
+.TH "eoRealBounds" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoRealBounds \- Defines bound classes for real numbers.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoPersistent\fP.
+.PP
+Inherited by \fBeoGeneralRealBounds\fP, \fBeoRealAboveBound\fP, \fBeoRealBelowBound\fP, \fBeoRealInterval\fP, and \fBeoRealNoBounds\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual bool \fBisBounded\fP (void) const =0"
+.br
+.RI "\fISelf-Test: true if ***both*** a min and a max. \fP"
+.ti -1c
+.RI "virtual bool \fBhasNoBoundAtAll\fP (void) const =0"
+.br
+.RI "\fISelf-Test: true if no min ***and*** no max hence no further need to test/truncate/fold anything. \fP"
+.ti -1c
+.RI "virtual bool \fBisMinBounded\fP (void) const =0"
+.br
+.RI "\fISelf-Test: bounded from below??? \fP"
+.ti -1c
+.RI "virtual bool \fBisMaxBounded\fP (void) const =0"
+.br
+.RI "\fISelf-Test: bounded from above??? \fP"
+.ti -1c
+.RI "virtual bool \fBisInBounds\fP (double) const =0"
+.br
+.RI "\fITest on a value: is it in bounds? \fP"
+.ti -1c
+.RI "virtual void \fBfoldsInBounds\fP (double &) const =0"
+.br
+.RI "\fIPut value back into bounds - by folding back and forth. \fP"
+.ti -1c
+.RI "virtual void \fBtruncate\fP (double &) const =0"
+.br
+.RI "\fIPut value back into bounds - by truncating to a boundary value. \fP"
+.ti -1c
+.RI "virtual double \fBminimum\fP () const =0"
+.br
+.RI "\fIget minimum value ::exception if does not exist \fP"
+.ti -1c
+.RI "virtual double \fBmaximum\fP () const =0"
+.br
+.RI "\fIget maximum value ::exception if does not exist \fP"
+.ti -1c
+.RI "virtual double \fBrange\fP () const =0"
+.br
+.RI "\fIget range ::exception if unbounded \fP"
+.ti -1c
+.RI "virtual double \fBuniform\fP (\fBeoRng\fP &_rng=eo::rng) const =0"
+.br
+.RI "\fIrandom generator of uniform numbers in bounds ::exception if unbounded \fP"
+.ti -1c
+.RI "virtual \fBeoRealBounds\fP * \fBdup\fP () const =0"
+.br
+.RI "\fIfor memory managements - ugly \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+Defines bound classes for real numbers. 
+
+Scalar type: ------------ Basic class is eoRealBounds, a pure virtual.
+.PP
+The following pure virtual methods are to be used in mutations:
+.IP "\(bu" 2
+void foldsInBounds(double &) that folds any value that falls out of the bounds back into the bounds, by bouncing on the limit (if any)
+.IP "\(bu" 2
+bool isInBounds(double) that simply says whether or not the argument is in the bounds
+.IP "\(bu" 2
+void truncate(double &) that set the argument to the bound value it it exceeds it
+.PP
+.PP
+So mutation can choose
+.IP "\(bu" 2
+iterate trying until they fall in bounds,
+.IP "\(bu" 2
+only try once and 'restd::pair' by using the foldsInBounds method
+.IP "\(bu" 2
+only try once and restd::pair using the truncate method (will create a huge bias toward the bound if the soluiton is not far from the bounds)
+.PP
+.PP
+There is also a \fBuniform()\fP method that generates a uniform value (if possible, i.e. if bounded) in the interval.
+.PP
+Derived class are \fBeoRealInterval\fP that holds a minimum and maximum value, \fBeoRealNoBounds\fP the 'unbounded bounds' (-infinity, +infinity) \fBeoRealBelowBound\fP the half-bounded interval [min, +infinity) \fBeoRealAboveBound\fP the half-bounded interval (-infinity, max]
+.PP
+THis file also contains the declaration of *the* global object that is the unbounded bound 
+.PP
+Definition at line 75 of file eoRealBounds.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoRealInitBounded.3 b/trunk/paradiseo-eo/doc/man/man3/eoRealInitBounded.3
new file mode 100644
index 000000000..2056b0d60
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoRealInitBounded.3
@@ -0,0 +1,53 @@
+.TH "eoRealInitBounded" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoRealInitBounded \- Simple initialization for any EOT that derives from std::vector uniformly in some bounds.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoInit< EOT >< EOT >\fP.
+.PP
+Inherited by \fBeoEsChromInit< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoRealInitBounded\fP (\fBeoRealVectorBounds\fP &_bounds)"
+.br
+.RI "\fICtor - from \fBeoRealVectorBounds\fP. \fP"
+.ti -1c
+.RI "virtual void \fBoperator()\fP (\fBEOT\fP &_eo)"
+.br
+.RI "\fIsimply passes the argument to the uniform method of the bounds \fP"
+.ti -1c
+.RI "virtual \fBeoRealVectorBounds\fP & \fBtheBounds\fP ()"
+.br
+.RI "\fIaccessor to the bounds \fP"
+.ti -1c
+.RI "virtual unsigned \fBsize\fP ()"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoRealVectorBounds\fP & \fBbounds\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoRealInitBounded< EOT >"
+Simple initialization for any EOT that derives from std::vector uniformly in some bounds. 
+.PP
+Definition at line 40 of file eoRealInitBounded.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoRealInterval.3 b/trunk/paradiseo-eo/doc/man/man3/eoRealInterval.3
new file mode 100644
index 000000000..dd2bb1000
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoRealInterval.3
@@ -0,0 +1,132 @@
+.TH "eoRealInterval" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoRealInterval \- fully bounded eoRealBound == interval  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoRealBounds\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoRealInterval\fP (double _min=0, double _max=1)"
+.br
+.RI "\fISimple bounds = minimum and maximum (allowed). \fP"
+.ti -1c
+.RI "virtual double \fBminimum\fP () const "
+.br
+.RI "\fIget minimum value ::exception if does not exist \fP"
+.ti -1c
+.RI "virtual double \fBmaximum\fP () const "
+.br
+.RI "\fIget maximum value ::exception if does not exist \fP"
+.ti -1c
+.RI "virtual double \fBrange\fP () const "
+.br
+.RI "\fIget range ::exception if unbounded \fP"
+.ti -1c
+.RI "virtual bool \fBisBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: true if ***both*** a min and a max. \fP"
+.ti -1c
+.RI "virtual bool \fBhasNoBoundAtAll\fP (void) const "
+.br
+.RI "\fISelf-Test: true if no min ***and*** no max hence no further need to test/truncate/fold anything. \fP"
+.ti -1c
+.RI "virtual bool \fBisMinBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: bounded from below??? \fP"
+.ti -1c
+.RI "virtual bool \fBisMaxBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: bounded from above??? \fP"
+.ti -1c
+.RI "virtual double \fBuniform\fP (\fBeoRng\fP &_rng=eo::rng) const "
+.br
+.RI "\fIrandom generator of uniform numbers in bounds ::exception if unbounded \fP"
+.ti -1c
+.RI "virtual bool \fBisInBounds\fP (double _r) const "
+.br
+.RI "\fITest on a value: is it in bounds? \fP"
+.ti -1c
+.RI "virtual void \fBfoldsInBounds\fP (double &_r) const "
+.br
+.RI "\fIPut value back into bounds - by folding back and forth. \fP"
+.ti -1c
+.RI "virtual void \fBtruncate\fP (double &_r) const "
+.br
+.RI "\fIPut value back into bounds - by truncating to a boundary value. \fP"
+.ti -1c
+.RI "virtual void \fBreadFrom\fP (std::istream &_is)"
+.br
+.RI "\fIRead object. \fP"
+.ti -1c
+.RI "virtual void \fBprintOn\fP (std::ostream &_os) const "
+.br
+.RI "\fIWrite object. \fP"
+.ti -1c
+.RI "virtual \fBeoRealBounds\fP * \fBdup\fP () const "
+.br
+.RI "\fIfor memory managements - ugly \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBrepMinimum\fP"
+.br
+.ti -1c
+.RI "double \fBrepMaximum\fP"
+.br
+.ti -1c
+.RI "double \fBrepRange\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+fully bounded eoRealBound == interval 
+.PP
+Definition at line 199 of file eoRealBounds.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "virtual void eoRealInterval::readFrom (std::istream & _is)\fC [inline, virtual]\fP"
+.PP
+Read object. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_is\fP A std::istream. but reading should not be done here, because of bound problems see \fBeoRealVectorBounds\fP 
+.RE
+.PP
+
+.PP
+Implements \fBeoPersistent\fP.
+.PP
+Definition at line 286 of file eoRealBounds.h.
+.SS "virtual void eoRealInterval::printOn (std::ostream & _os) const\fC [inline, virtual]\fP"
+.PP
+Write object. 
+.PP
+It's called printOn since it prints the object on a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_os\fP A std::ostream. 
+.RE
+.PP
+
+.PP
+Implements \fBeoPrintable\fP.
+.PP
+Definition at line 295 of file eoRealBounds.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoRealNoBounds.3 b/trunk/paradiseo-eo/doc/man/man3/eoRealNoBounds.3
new file mode 100644
index 000000000..6014503ef
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoRealNoBounds.3
@@ -0,0 +1,115 @@
+.TH "eoRealNoBounds" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoRealNoBounds \- A default class for unbounded variables.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoRealBounds\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual bool \fBisBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: true if ***both*** a min and a max. \fP"
+.ti -1c
+.RI "virtual bool \fBhasNoBoundAtAll\fP (void) const "
+.br
+.RI "\fISelf-Test: true if no min ***and*** no max hence no further need to test/truncate/fold anything. \fP"
+.ti -1c
+.RI "virtual bool \fBisMinBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: bounded from below??? \fP"
+.ti -1c
+.RI "virtual bool \fBisMaxBounded\fP (void) const "
+.br
+.RI "\fISelf-Test: bounded from above??? \fP"
+.ti -1c
+.RI "virtual void \fBfoldsInBounds\fP (double &) const "
+.br
+.RI "\fIPut value back into bounds - by folding back and forth. \fP"
+.ti -1c
+.RI "virtual void \fBtruncate\fP (double &) const "
+.br
+.RI "\fIPut value back into bounds - by truncating to a boundary value. \fP"
+.ti -1c
+.RI "virtual bool \fBisInBounds\fP (double) const "
+.br
+.RI "\fITest on a value: is it in bounds? \fP"
+.ti -1c
+.RI "virtual double \fBminimum\fP () const "
+.br
+.RI "\fIget minimum value ::exception if does not exist \fP"
+.ti -1c
+.RI "virtual double \fBmaximum\fP () const "
+.br
+.RI "\fIget maximum value ::exception if does not exist \fP"
+.ti -1c
+.RI "virtual double \fBrange\fP () const "
+.br
+.RI "\fIget range ::exception if unbounded \fP"
+.ti -1c
+.RI "virtual double \fBuniform\fP (\fBeoRng\fP &_rng=eo::rng) const "
+.br
+.RI "\fIrandom generator of uniform numbers in bounds ::exception if unbounded \fP"
+.ti -1c
+.RI "virtual void \fBreadFrom\fP (std::istream &_is)"
+.br
+.RI "\fIRead object. \fP"
+.ti -1c
+.RI "virtual void \fBprintOn\fP (std::ostream &_os) const "
+.br
+.RI "\fIWrite object. \fP"
+.ti -1c
+.RI "virtual \fBeoRealBounds\fP * \fBdup\fP () const "
+.br
+.RI "\fIfor memory managements - ugly \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+A default class for unbounded variables. 
+.PP
+Definition at line 133 of file eoRealBounds.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "virtual void eoRealNoBounds::readFrom (std::istream & _is)\fC [inline, virtual]\fP"
+.PP
+Read object. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_is\fP A std::istream. but reading should not be done here, because of bound problems see \fBeoRealVectorBounds\fP 
+.RE
+.PP
+
+.PP
+Implements \fBeoPersistent\fP.
+.PP
+Definition at line 171 of file eoRealBounds.h.
+.SS "virtual void eoRealNoBounds::printOn (std::ostream & _os) const\fC [inline, virtual]\fP"
+.PP
+Write object. 
+.PP
+It's called printOn since it prints the object on a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_os\fP A std::ostream. 
+.RE
+.PP
+
+.PP
+Implements \fBeoPrintable\fP.
+.PP
+Definition at line 180 of file eoRealBounds.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoRealUxOver.3 b/trunk/paradiseo-eo/doc/man/man3/eoRealUxOver.3
new file mode 100644
index 000000000..7162bffe7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoRealUxOver.3
@@ -0,0 +1,21 @@
+.TH "eoRealUxOver" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoRealUxOver \- eoRealUxOver --> Uniform crossover, also termed intermediate crossover  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SH "Detailed Description"
+.PP 
+eoRealUxOver --> Uniform crossover, also termed intermediate crossover 
+.PP
+
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoRealVectorBounds.3 b/trunk/paradiseo-eo/doc/man/man3/eoRealVectorBounds.3
new file mode 100644
index 000000000..898d74a2d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoRealVectorBounds.3
@@ -0,0 +1,126 @@
+.TH "eoRealVectorBounds" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoRealVectorBounds \- Now a derived class, for parser reading It holds some of the bounds (and destroy them when dying).  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoRealBaseVectorBounds\fP, and \fBeoPersistent\fP.
+.PP
+Inherited by \fBeoRealVectorNoBounds\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoRealVectorBounds\fP ()"
+.br
+.RI "\fIDefault Ctor will call base class default ctor. \fP"
+.ti -1c
+.RI "\fBeoRealVectorBounds\fP (unsigned _dim, \fBeoRealBounds\fP &_bounds)"
+.br
+.RI "\fICtor: same bounds for everybody, given as an \fBeoRealBounds\fP. \fP"
+.ti -1c
+.RI "\fBeoRealVectorBounds\fP (\fBeoRealBounds\fP &_xbounds, \fBeoRealBounds\fP &_ybounds)"
+.br
+.RI "\fICtor, particular case of dim-2. \fP"
+.ti -1c
+.RI "\fBeoRealVectorBounds\fP (unsigned _dim, double _min, double _max)"
+.br
+.RI "\fISimple bounds = minimum and maximum (allowed). \fP"
+.ti -1c
+.RI "\fBeoRealVectorBounds\fP (std::vector< double > _min, std::vector< double > _max)"
+.br
+.RI "\fICtor: different bounds for different variables, std::vectors of double. \fP"
+.ti -1c
+.RI "\fBeoRealVectorBounds\fP (std::string _s)"
+.br
+.RI "\fICtor from a std::string and don't worry, the \fBreadFrom(std::string)\fP starts by setting everything to 0! \fP"
+.ti -1c
+.RI "virtual \fB~eoRealVectorBounds\fP ()"
+.br
+.RI "\fIDtor: destroy all ownedBounds - BUG ??? \fP"
+.ti -1c
+.RI "virtual void \fBreadFrom\fP (std::istream &_is)"
+.br
+.RI "\fIRead object from a stream only calls the \fBreadFrom(std::string)\fP - for param reading. \fP"
+.ti -1c
+.RI "virtual void \fBreadFrom\fP (std::string _s)"
+.br
+.RI "\fIRead object from a std::string. \fP"
+.ti -1c
+.RI "virtual void \fBprintOn\fP (std::ostream &_os) const "
+.br
+.RI "\fIoverload printOn method to save space \fP"
+.ti -1c
+.RI "void \fBadjust_size\fP (unsigned _dim)"
+.br
+.RI "\fIEventually increases the size by duplicating last bound. \fP"
+.ti -1c
+.RI "\fBeoRealVectorBounds\fP (const \fBeoRealVectorBounds\fP &)"
+.br
+.RI "\fIneed to rewrite copy ctor and assignement operator because of ownedBounds \fP"
+.in -1c
+.SS "Private Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoRealVectorBounds\fP & \fBoperator=\fP (const \fBeoRealVectorBounds\fP &)"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "std::vector< unsigned int > \fBfactor\fP"
+.br
+.ti -1c
+.RI "std::vector< \fBeoRealBounds\fP * > \fBownedBounds\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+Now a derived class, for parser reading It holds some of the bounds (and destroy them when dying). 
+.PP
+Definition at line 228 of file eoRealVectorBounds.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "void eoRealVectorBounds::readFrom (std::istream & _is)\fC [virtual]\fP"
+.PP
+Read object from a stream only calls the \fBreadFrom(std::string)\fP - for param reading. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_is\fP A std::istream. 
+.RE
+.PP
+
+.PP
+Implements \fBeoPersistent\fP.
+.PP
+Definition at line 65 of file eoRealBounds.cpp.
+.PP
+Referenced by eoRealVectorBounds().
+.SS "void eoRealVectorBounds::readFrom (std::string _s)\fC [virtual]\fP"
+.PP
+Read object from a std::string. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_is\fP A std::istream. 
+.RE
+.PP
+
+.PP
+Definition at line 73 of file eoRealBounds.cpp.
+.PP
+References adjust_size().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoRealVectorNoBounds.3 b/trunk/paradiseo-eo/doc/man/man3/eoRealVectorNoBounds.3
new file mode 100644
index 000000000..c7758a924
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoRealVectorNoBounds.3
@@ -0,0 +1,101 @@
+.TH "eoRealVectorNoBounds" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoRealVectorNoBounds \- the dummy unbounded \fBeoRealVectorBounds\fP: usefull if you don't need bounds! everything is inlined.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoRealVectorBounds\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoRealVectorNoBounds\fP (unsigned _dim)"
+.br
+.RI "\fICtor: nothing to do, but beware of dimension: call base class ctor. \fP"
+.ti -1c
+.RI "virtual bool \fBisBounded\fP (unsigned)"
+.br
+.RI "\fItest: is i_th component bounded \fP"
+.ti -1c
+.RI "virtual bool \fBisBounded\fP (void)"
+.br
+.RI "\fItest: bounded iff all are bounded \fP"
+.ti -1c
+.RI "virtual bool \fBhasNoBoundAtAll\fP (unsigned)"
+.br
+.RI "\fISelf-test: true iff i_th component has no bounds at all. \fP"
+.ti -1c
+.RI "virtual bool \fBhasNoBoundAtAll\fP (void)"
+.br
+.RI "\fISelf-test: true iff all components have no bound at all. \fP"
+.ti -1c
+.RI "virtual bool \fBisMinBounded\fP (unsigned)"
+.br
+.ti -1c
+.RI "virtual bool \fBisMaxBounded\fP (unsigned)"
+.br
+.ti -1c
+.RI "virtual void \fBfoldsInBounds\fP (unsigned, double &)"
+.br
+.RI "\fIFolds a real value back into the bounds - i_th component. \fP"
+.ti -1c
+.RI "virtual void \fBfoldsInBounds\fP (std::vector< double > &)"
+.br
+.RI "\fIFolds all variables of a std::vector of real values into the bounds. \fP"
+.ti -1c
+.RI "virtual void \fBtruncate\fP (unsigned, double &)"
+.br
+.RI "\fITruncates a real value to the bounds - i_th component. \fP"
+.ti -1c
+.RI "virtual void \fBtruncate\fP (std::vector< double > &)"
+.br
+.RI "\fItruncates all variables of a std::vector of real values to the bounds \fP"
+.ti -1c
+.RI "virtual bool \fBisInBounds\fP (unsigned, double)"
+.br
+.RI "\fItest: is i_th component within the bounds? \fP"
+.ti -1c
+.RI "virtual bool \fBisInBounds\fP (std::vector< double >)"
+.br
+.RI "\fItest: are ALL components within the bounds? \fP"
+.ti -1c
+.RI "virtual double \fBminimum\fP (unsigned)"
+.br
+.RI "\fIAccessors: will raise an std::exception if these do not exist. \fP"
+.ti -1c
+.RI "virtual double \fBmaximum\fP (unsigned)"
+.br
+.ti -1c
+.RI "virtual double \fBrange\fP (unsigned)"
+.br
+.ti -1c
+.RI "virtual double \fBaverageRange\fP ()"
+.br
+.RI "\fIComputes the average range An std::exception will be raised if one of the component is unbounded. \fP"
+.ti -1c
+.RI "virtual double \fBuniform\fP (unsigned, \fBeoRng\fP &_rng=eo::rng)"
+.br
+.RI "\fIGenerates a random number in i_th range An std::exception will be raised if one of the component is unbounded. \fP"
+.ti -1c
+.RI "void \fBuniform\fP (std::vector< double > &, \fBeoRng\fP &_rng=eo::rng)"
+.br
+.RI "\fIfills a std::vector with uniformly chosen variables in bounds An std::exception will be raised if one of the component is unbounded \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+the dummy unbounded \fBeoRealVectorBounds\fP: usefull if you don't need bounds! everything is inlined. 
+
+Warning: we do need this class, and not only a std::vector 
+.PP
+Definition at line 352 of file eoRealVectorBounds.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoReduce.3 b/trunk/paradiseo-eo/doc/man/man3/eoReduce.3
new file mode 100644
index 000000000..3150aae15
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoReduce.3
@@ -0,0 +1,29 @@
+.TH "eoReduce" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoReduce \- eoReduce: .reduce the new generation to the specified size At the moment, limited to truncation - with 2 different methods, one that sorts the whole population, and one that repeatidely kills the worst.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoBF< eoPop< EOT > &, unsigned, void >\fP.
+.PP
+Inherited by \fBeoDetTournamentTruncate< EOT >\fP, \fBeoEPReduce< EOT >\fP, \fBeoLinearTruncate< EOT >\fP, \fBeoRandomReduce< EOT >\fP, \fBeoStochTournamentTruncate< EOT >\fP, \fBeoStochTournamentTruncateSplit< EOT >\fP, and \fBeoTruncate< EOT >\fP.
+.PP
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoReduce< EOT >"
+eoReduce: .reduce the new generation to the specified size At the moment, limited to truncation - with 2 different methods, one that sorts the whole population, and one that repeatidely kills the worst. 
+
+Ideally, we should be able to choose at run-time!!! 
+.PP
+Definition at line 45 of file eoReduce.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoReduceMerge.3 b/trunk/paradiseo-eo/doc/man/man3/eoReduceMerge.3
new file mode 100644
index 000000000..1cb7e5032
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoReduceMerge.3
@@ -0,0 +1,52 @@
+.TH "eoReduceMerge" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoReduceMerge \- eoReduceMerge: Replacement strategies that start by reducing the parents, then merge with the offspring  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoReplacement< EOT >< EOT >\fP.
+.PP
+Inherited by \fBeoSSGADetTournamentReplacement< EOT >\fP, \fBeoSSGAStochTournamentReplacement< EOT >\fP, and \fBeoSSGAWorseReplacement< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoReduceMerge\fP (\fBeoReduce\fP< \fBEOT\fP > &_reduce, \fBeoMerge\fP< \fBEOT\fP > &_merge)"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_parents, \fBeoPop\fP< \fBEOT\fP > &_offspring)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoReduce\fP< \fBEOT\fP > & \fBreduce\fP"
+.br
+.ti -1c
+.RI "\fBeoMerge\fP< \fBEOT\fP > & \fBmerge\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoReduceMerge< EOT >"
+eoReduceMerge: Replacement strategies that start by reducing the parents, then merge with the offspring 
+
+This is the way to do SSGA: the offspring gets inserted in the population even if it is worse than anybody else.
+.PP
+: eoReduceMerge, \fBeoSSGAWorseReplacement\fP, \fBeoSSGADetTournamentReplacement\fP, \fBeoSSGAStochTournamentReplacement\fP 
+.PP
+Definition at line 53 of file eoReduceMerge.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoReduceMergeReduce.3 b/trunk/paradiseo-eo/doc/man/man3/eoReduceMergeReduce.3
new file mode 100644
index 000000000..9c6813d36
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoReduceMergeReduce.3
@@ -0,0 +1,61 @@
+.TH "eoReduceMergeReduce" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoReduceMergeReduce \- eoReduceMergeReduce is an \fBeoReplacement\fP: - saves possible elite parents - reduces rest of parents - reduces offspring - merges reduced populations - reduces resulting merged pop if necessary  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoReplacement< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoReduceMergeReduce\fP (\fBeoHowMany\fP _howManyElite, bool _strongElitism, \fBeoHowMany\fP _howManyReducedParents, \fBeoReduce\fP< \fBEOT\fP > &_reduceParents, \fBeoHowMany\fP _howManyReducedOffspring, \fBeoReduce\fP< \fBEOT\fP > &_reduceOffspring, \fBeoReduce\fP< \fBEOT\fP > &_reduceFinal)"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_parents, \fBeoPop\fP< \fBEOT\fP > &_offspring)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoHowMany\fP \fBhowManyElite\fP"
+.br
+.ti -1c
+.RI "bool \fBstrongElitism\fP"
+.br
+.ti -1c
+.RI "\fBeoHowMany\fP \fBhowManyReducedParents\fP"
+.br
+.ti -1c
+.RI "\fBeoHowMany\fP \fBhowManyReducedOffspring\fP"
+.br
+.ti -1c
+.RI "\fBeoReduce\fP< \fBEOT\fP > & \fBreduceParents\fP"
+.br
+.ti -1c
+.RI "\fBeoReduce\fP< \fBEOT\fP > & \fBreduceOffspring\fP"
+.br
+.ti -1c
+.RI "\fBeoReduce\fP< \fBEOT\fP > & \fBreduceFinal\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoReduceMergeReduce< EOT >"
+eoReduceMergeReduce is an \fBeoReplacement\fP: - saves possible elite parents - reduces rest of parents - reduces offspring - merges reduced populations - reduces resulting merged pop if necessary 
+.PP
+Definition at line 49 of file eoReduceMergeReduce.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoReduceSplit.3 b/trunk/paradiseo-eo/doc/man/man3/eoReduceSplit.3
new file mode 100644
index 000000000..2618fbda8
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoReduceSplit.3
@@ -0,0 +1,27 @@
+.TH "eoReduceSplit" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoReduceSplit \- eoReduceSplit: reduce the pop to the specified size AND eventually returns the eliminated guys  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoBF< eoPop< EOT > &, eoPop< EOT > &, void >\fP.
+.PP
+Inherited by \fBeoDetTournamentTruncateSplit< EOT >\fP, \fBeoLinearRandomSplit< EOT >\fP, \fBeoLinearTruncateSplit< EOT >\fP, \fBeoRandomSplit< EOT >\fP, and \fBeoTruncateSplit< EOT >\fP.
+.PP
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoReduceSplit< EOT >"
+eoReduceSplit: reduce the pop to the specified size AND eventually returns the eliminated guys 
+.PP
+Definition at line 42 of file eoReduceSplit.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoReplacement.3 b/trunk/paradiseo-eo/doc/man/man3/eoReplacement.3
new file mode 100644
index 000000000..3f134d0bb
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoReplacement.3
@@ -0,0 +1,38 @@
+.TH "eoReplacement" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoReplacement \- 
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoBF< eoPop< EOT > &, eoPop< EOT > &, void >\fP.
+.PP
+Inherited by \fBeoDeterministicSaDReplacement< EOT >\fP, \fBeoG3Replacement< EOT >\fP, \fBeoGenerationalReplacement< EOT >\fP, \fBeoMergeReduce< EOT >\fP, \fBeoMGGReplacement< EOT >\fP, \fBeoNDPlusReplacement< EOT, WorthT >\fP, \fBeoNDPlusReplacement< EOT, WorthT >\fP, \fBeoReduceMerge< EOT >\fP, \fBeoReduceMergeReduce< EOT >\fP, and \fBeoWeakElitistReplacement< EOT >\fP.
+.PP
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoReplacement< EOT >"
+NOTE: 2 \fBeoPop\fP as arguments the resulting population should be in the first argument (replace parents by offspring)! The second argument can contain any rubbish
+.PP
+--- The \fBeoMergeReduce\fP, combination of \fBeoMerge\fP and \fBeoReduce\fP, can be found in file \fBeoMergeReduce.h\fP
+.PP
+The \fBeoReduceMergeReduce\fP that reduces the parents and the offspring, merges the 2 reduced populations, and eventually reduces that final population, can be found in \fBeoReduceMergeReduce.h\fP
+.PP
+LOG --- Removed the const before first argument: though it makes too many classes with the same interface, it allows to minimize the number of actual copies by choosing the right destination I also removed the enforced 'swap' in the eoEasyAlgo and hence the generational replacement gets a class of its own that only does the swap (instead of the eoNoReplacement that did nothing, relying on the algo to swap popualtions). MS 12/12/2000
+.PP
+\fBSee also:\fP
+.RS 4
+\fBeoMerge\fP, \fBeoReduce\fP, \fBeoMergeReduce\fP, \fBeoReduceMerge\fP
+.RE
+.PP
+eoReplacement, base (pure abstract) class \fBeoGenerationalReplacement\fP, as it says ... \fBeoWeakElitistReplacement\fP a wrapper to add elitism 
+.PP
+Definition at line 77 of file eoReplacement.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoRndGenerator.3 b/trunk/paradiseo-eo/doc/man/man3/eoRndGenerator.3
new file mode 100644
index 000000000..98718c042
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoRndGenerator.3
@@ -0,0 +1,38 @@
+.TH "eoRndGenerator" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoRndGenerator \- By popular demand re-introducing a base class for a family of random number generators.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoF< T >\fP.
+.PP
+Inherited by \fBeoNegExpGenerator< T >\fP, \fBeoNormalGenerator< T >\fP, and \fBeoUniformGenerator< T >\fP.
+.PP
+.SS "Private Types"
+
+.in +1c
+.ti -1c
+.RI "typedef T \fBAtomType\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoRndGenerator< T >"
+By popular demand re-introducing a base class for a family of random number generators. 
+
+Derived members of this class are useful to initialize fixed/variable length genotypes that have an 'atomic' type in an indepent way (thus without employing any knowledge about the problem domain).
+.PP
+See derived classes \fBeoUniformGenerator\fP, \fBeoBooleanGenerator\fP, \fBeoNormalGenerator\fP and \fBeoNegExpGenerator\fP 
+.PP
+Definition at line 47 of file eoRndGenerators.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoRng.3 b/trunk/paradiseo-eo/doc/man/man3/eoRng.3
new file mode 100644
index 000000000..b91f17d40
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoRng.3
@@ -0,0 +1,345 @@
+.TH "eoRng" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoRng \- Random Number Generator.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoObject\fP, and \fBeoPersistent\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoRng\fP (uint32_t s)"
+.br
+.RI "\fIConstructor. \fP"
+.ti -1c
+.RI "void \fBreseed\fP (uint32_t s)"
+.br
+.RI "\fIRe-initializes the Random Number Generator. \fP"
+.ti -1c
+.RI "void \fBoldReseed\fP (uint32_t s)"
+.br
+.RI "\fIRe-initializes the Random Number Generator. \fP"
+.ti -1c
+.RI "double \fBuniform\fP (double m=1.0)"
+.br
+.RI "\fIuniform(m = 1.0) returns a random double in the range [0, m) \fP"
+.ti -1c
+.RI "uint32_t \fBrandom\fP (uint32_t m)"
+.br
+.RI "\fI\fBrandom()\fP returns a random integer in the range [0, m) \fP"
+.ti -1c
+.RI "bool \fBflip\fP (float bias=0.5)"
+.br
+.RI "\fI\fBflip()\fP tosses a biased coin such that flip(x/100.0) will returns true x% of the time \fP"
+.ti -1c
+.RI "double \fBnormal\fP (void)"
+.br
+.RI "\fI\fBnormal()\fP zero mean gaussian deviate with standard deviation of 1 \fP"
+.ti -1c
+.RI "double \fBnormal\fP (double stdev)"
+.br
+.RI "\fInormal(stdev) zero mean gaussian deviate with user defined standard deviation \fP"
+.ti -1c
+.RI "double \fBnormal\fP (double mean, double stdev)"
+.br
+.RI "\fInormal(mean, stdev) user defined mean gaussian deviate with user defined standard deviation \fP"
+.ti -1c
+.RI "double \fBnegexp\fP (double mean)"
+.br
+.RI "\fIGenerates random numbers using a negative exponential distribution. \fP"
+.ti -1c
+.RI "uint32_t \fBrand\fP ()"
+.br
+.RI "\fI\fBrand()\fP returns a random number in the range [0, rand_max) \fP"
+.ti -1c
+.RI "uint32_t \fBrand_max\fP (void) const "
+.br
+.RI "\fI\fBrand_max()\fP the maximum returned by \fBrand()\fP \fP"
+.ti -1c
+.RI "template int \fBroulette_wheel\fP (const std::vector< TYPE > &vec, TYPE total=0)"
+.br
+.RI "\fIroulette_wheel(vec, total = 0) does a roulette wheel selection on the input std::vector vec. \fP"
+.ti -1c
+.RI "template const TYPE & \fBchoice\fP (const std::vector< TYPE > &vec) const "
+.br
+.RI "\fIRandomly select element from vector. \fP"
+.ti -1c
+.RI "template TYPE & \fBchoice\fP (std::vector< TYPE > &vec)"
+.br
+.RI "\fIRandomly select element from vector. \fP"
+.ti -1c
+.RI "void \fBprintOn\fP (std::ostream &_os) const "
+.br
+.RI "\fIWrite object. \fP"
+.ti -1c
+.RI "void \fBreadFrom\fP (std::istream &_is)"
+.br
+.RI "\fIRead object. \fP"
+.ti -1c
+.RI "std::string \fBclassName\fP (void) const "
+.br
+.RI "\fIReturn the class id. \fP"
+.in -1c
+.SS "Private Member Functions"
+
+.in +1c
+.ti -1c
+.RI "uint32_t \fBrestart\fP (void)"
+.br
+.ti -1c
+.RI "void \fBinitialize\fP (uint32_t seed)"
+.br
+.ti -1c
+.RI "\fBeoRng\fP (const \fBeoRng\fP &)"
+.br
+.RI "\fICopy constructor. \fP"
+.ti -1c
+.RI "\fBeoRng\fP & \fBoperator=\fP (const \fBeoRng\fP &)"
+.br
+.RI "\fIAssignmant operator. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "uint32_t * \fBstate\fP"
+.br
+.RI "\fIArray for the state. \fP"
+.ti -1c
+.RI "uint32_t * \fBnext\fP"
+.br
+.ti -1c
+.RI "int \fBleft\fP"
+.br
+.ti -1c
+.RI "bool \fBcached\fP"
+.br
+.ti -1c
+.RI "float \fBcacheValue\fP"
+.br
+.ti -1c
+.RI "const int \fBN\fP"
+.br
+.ti -1c
+.RI "const int \fBM\fP"
+.br
+.ti -1c
+.RI "const uint32_t \fBK\fP"
+.br
+.RI "\fIMagic constant. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+Random Number Generator. 
+
+eoRng is a persistent class that uses the ``Mersenne Twister'' random number generator MT19937 for generating random numbers. The various member functions implement useful functions for evolutionary algorithms. Included are: \fBrand()\fP, \fBrandom()\fP, \fBflip()\fP and \fBnormal()\fP.
+.PP
+\fBEO\fP provides a global random number generator \fCrng\fP that is seeded by the current UNIX time at program start. Moreover some global convenience functions are provided that use the global random number generator: \fCrandom\fP, \fCnormal\fP.
+.PP
+\fBWarning:\fP
+.RS 4
+If you want to repeatedly generated the same sequence of pseudo-random numbers, you should always reseed the generator at the beginning of your code.
+.RE
+.PP
+.SH "Documentation in original file"
+.PP
+.PP
+This is the ``Mersenne Twister'' random number generator MT19937, which generates pseudorandom integers uniformly distributed in 0..(2^32 - 1) starting from any odd seed in 0..(2^32 - 1). This version is a recode by Shawn Cokus (Cokus@math.washington.edu) on March 8, 1998 of a version by Takuji Nishimura (who had suggestions from Topher Cooper and Marc Rieffel in July-August 1997).
+.PP
+Effectiveness of the recoding (on Goedel2.math.washington.edu, a DEC Alpha running OSF/1) using GCC -O3 as a compiler: before recoding: 51.6 sec. to generate 300 million random numbers; after recoding: 24.0 sec. for the same (i.e., 46.5% of original time), so speed is now about 12.5 million random number generations per second on this machine.
+.PP
+According to the URL  (and paraphrasing a bit in places), the Mersenne Twister is ``designed with consideration of the flaws of various existing generators,'' has a period of 2^19937 - 1, gives a sequence that is 623-dimensionally equidistributed, and ``has passed many std::stringent tests, including the die-hard test of G. Marsaglia and the load test of P. Hellekalek and S. Wegenkittl.'' It is efficient in memory usage (typically using 2506 to 5012 bytes of static data, depending on data type sizes, and the code is quite short as well). It generates random numbers in batches of 624 at a time, so the caching and pipelining of modern systems is exploited. It is also divide- and mod-free.
+.PP
+The code as Shawn received it included the following notice: \fCCopyright (C) 1997 Makoto Matsumoto and Takuji Nishimura. When you use this, send an e-mail to  with an appropriate reference to your work.\fP It would be nice to Cc:  and  when you write.
+.PP
+.SH "Portability"
+.PP
+.PP
+Note for people porting \fBEO\fP to other platforms: please make sure that the type uint32_t in the file \fBeoRng.h\fP is exactly 32 bits long. It may in principle be longer, but not shorter. If it is longer, file compatibility between \fBEO\fP on different platforms may be broken. 
+.PP
+Definition at line 103 of file eoRNG.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "eoRng::eoRng (uint32_t s)\fC [inline]\fP"
+.PP
+Constructor. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIs\fP Random seed; if you want another seed, use reseed.
+.RE
+.PP
+\fBSee also:\fP
+.RS 4
+\fBreseed\fP for details on usage of the seeding value. 
+.RE
+.PP
+
+.PP
+Definition at line 113 of file eoRNG.h.
+.PP
+References K, and state.
+.SS "eoRng::eoRng (const \fBeoRng\fP &)\fC [private]\fP"
+.PP
+Copy constructor. 
+.PP
+Private copy ctor and assignment operator to make sure that nobody accidentally copies the random number generator. If you want similar RNG's, make two RNG's and initialize them with the same seed.
+.PP
+As it cannot be called, we do not provide an implementation. 
+.SH "Member Function Documentation"
+.PP 
+.SS "void eoRng::reseed (uint32_t s)\fC [inline]\fP"
+.PP
+Re-initializes the Random Number Generator. 
+.PP
+WARNING: Jeroen Eggermont  noticed that initialize does not differentiate between odd and even numbers, therefore the argument to reseed is now doubled before being passed on.
+.PP
+Manually divide the seed by 2 if you want to re-run old runs
+.PP
+\fBVersion:\fP
+.RS 4
+MS. 5 Oct. 2001 
+.RE
+.PP
+
+.PP
+Definition at line 135 of file eoRNG.h.
+.SS "void eoRng::oldReseed (uint32_t s)\fC [inline]\fP"
+.PP
+Re-initializes the Random Number Generator. 
+.PP
+This is the traditional seeding procedure. This version is deprecated and only provided for compatibility with old code. In new projects you should use reseed.
+.PP
+\fBSee also:\fP
+.RS 4
+\fBreseed\fP for details on usage of the seeding value.
+.RE
+.PP
+\fBVersion:\fP
+.RS 4
+old version (deprecated) 
+.RE
+.PP
+
+.PP
+Definition at line 150 of file eoRNG.h.
+.SS "template int eoRng::roulette_wheel (const std::vector< TYPE > & vec, TYPE total = \fC0\fP)\fC [inline]\fP"
+.PP
+roulette_wheel(vec, total = 0) does a roulette wheel selection on the input std::vector vec. 
+.PP
+If the total is not supplied, it is calculated. It returns an integer denoting the selected argument. 
+.PP
+Definition at line 225 of file eoRNG.h.
+.PP
+References uniform().
+.PP
+Referenced by eoPropCombinedQuadOp< EOT >::operator()(), eoPropCombinedBinOp< EOT >::operator()(), eoPropCombinedMonOp< EOT >::operator()(), and eoCombinedInit< EOT >::operator()().
+.SS "template const TYPE& eoRng::choice (const std::vector< TYPE > & vec) const\fC [inline]\fP"
+.PP
+Randomly select element from vector. 
+.PP
+\fBReturns:\fP
+.RS 4
+Uniformly chosen element from the vector. 
+.RE
+.PP
+
+.PP
+Definition at line 247 of file eoRNG.h.
+.PP
+References random().
+.SS "template TYPE& eoRng::choice (std::vector< TYPE > & vec)\fC [inline]\fP"
+.PP
+Randomly select element from vector. 
+.PP
+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
+.PP
+Provide a version returning a non-const element reference.
+.PP
+\fBReturns:\fP
+.RS 4
+Uniformly chosen element from the vector.
+.RE
+.PP
+\fBWarning:\fP
+.RS 4
+Changing the return value does alter the vector. 
+.RE
+.PP
+
+.PP
+Definition at line 262 of file eoRNG.h.
+.PP
+References random().
+.SS "void eoRng::printOn (std::ostream & _os) const\fC [inline, virtual]\fP"
+.PP
+Write object. 
+.PP
+It's called printOn since it prints the object on a stream. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_os\fP A std::ostream. 
+.RE
+.PP
+
+.PP
+Implements \fBeoPrintable\fP.
+.PP
+Definition at line 266 of file eoRNG.h.
+.PP
+References state.
+.SS "void eoRng::readFrom (std::istream & _is)\fC [inline, virtual]\fP"
+.PP
+Read object. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_is\fP A std::istream. 
+.RE
+.PP
+\fBExceptions:\fP
+.RS 4
+\fIruntime_std::exception\fP If a valid object can't be read. 
+.RE
+.PP
+
+.PP
+Implements \fBeoPersistent\fP.
+.PP
+Definition at line 277 of file eoRNG.h.
+.PP
+References state.
+.SS "std::string eoRng::className (void) const\fC [inline, virtual]\fP"
+.PP
+Return the class id. 
+.PP
+This should be redefined in each class. Only 'leaf' classes can be non-virtual.
+.PP
+Maarten: removed the default implementation as this proved to be too error-prone: I found several classes that had a typo in className (like classname), which would print \fBeoObject\fP instead of their own. Having it pure will force the implementor to provide a name. 
+.PP
+Implements \fBeoObject\fP.
+.PP
+Definition at line 293 of file eoRNG.h.
+.SS "\fBeoRng\fP& eoRng::operator= (const \fBeoRng\fP &)\fC [private]\fP"
+.PP
+Assignmant operator. 
+.PP
+\fBSee also:\fP
+.RS 4
+Copy constructor \fBeoRng(const eoRng&)\fP. 
+.RE
+.PP
+
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoRouletteWorthSelect.3 b/trunk/paradiseo-eo/doc/man/man3/eoRouletteWorthSelect.3
new file mode 100644
index 000000000..44ca18140
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoRouletteWorthSelect.3
@@ -0,0 +1,56 @@
+.TH "eoRouletteWorthSelect" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoRouletteWorthSelect \- An instance of eoSelectPerf2Worth that does selection from the Worthes using a ...  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoSelectFromWorth< EOT, WorthT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef std::vector< WorthT >::iterator \fBworthIterator\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoRouletteWorthSelect\fP (\fBeoPerf2Worth\fP< \fBEOT\fP, WorthT > &_perf2Worth)"
+.br
+.ti -1c
+.RI "virtual void \fBsetup\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIvirtual function to setup some population stats (for instance eoProportional can benefit greatly from this) \fP"
+.ti -1c
+.RI "virtual const \fBEOT\fP & \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBtotal\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoRouletteWorthSelect< EOT, WorthT >"
+An instance of eoSelectPerf2Worth that does selection from the Worthes using a ... 
+
+roulette wheel selection, yes! 
+.PP
+Definition at line 167 of file eoSelectFromWorth.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSGA.3 b/trunk/paradiseo-eo/doc/man/man3/eoSGA.3
new file mode 100644
index 000000000..f48192210
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSGA.3
@@ -0,0 +1,64 @@
+.TH "eoSGA" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSGA \- The Simple Genetic Algorithm, following Holland and Goldberg.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoAlgo< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSGA\fP (\fBeoSelectOne\fP< \fBEOT\fP > &_select, \fBeoQuadOp\fP< \fBEOT\fP > &_cross, float _crate, \fBeoMonOp\fP< \fBEOT\fP > &_mutate, float _mrate, \fBeoEvalFunc\fP< \fBEOT\fP > &_eval, \fBeoContinue\fP< \fBEOT\fP > &_cont)"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoContinue\fP< \fBEOT\fP > & \fBcont\fP"
+.br
+.ti -1c
+.RI "\fBeoInvalidateMonOp\fP< \fBEOT\fP > \fBmutate\fP"
+.br
+.RI "\fI\fBeoInvalidateMonOp\fP invalidates the embedded operator \fP"
+.ti -1c
+.RI "float \fBmutationRate\fP"
+.br
+.ti -1c
+.RI "\fBeoInvalidateQuadOp\fP< \fBEOT\fP > \fBcross\fP"
+.br
+.ti -1c
+.RI "float \fBcrossoverRate\fP"
+.br
+.ti -1c
+.RI "\fBeoSelectPerc\fP< \fBEOT\fP > \fBselect\fP"
+.br
+.ti -1c
+.RI "\fBeoEvalFunc\fP< \fBEOT\fP > & \fBeval\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSGA< EOT >"
+The Simple Genetic Algorithm, following Holland and Goldberg. 
+
+Needs a selector (class \fBeoSelectOne\fP) a crossover (eoQuad, i.e. a 2->2 operator) and a mutation with their respective rates, of course an evaluation function (\fBeoEvalFunc\fP) and a continuator (\fBeoContinue\fP) which gives the stopping criterion. Performs full generational replacement. 
+.PP
+Definition at line 49 of file eoSGA.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSGAGenOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoSGAGenOp.3
new file mode 100644
index 000000000..abeac1fc3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSGAGenOp.3
@@ -0,0 +1,71 @@
+.TH "eoSGAGenOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSGAGenOp \- *************************************************************************** eoSGAGenOp (for Simple GA) mimicks the usual crossover with proba pCross + mutation with proba pMut inside an eoGeneralOp It does it exactly as class \fBeoSGATransform\fP, i.e.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoGenOp< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSGAGenOp\fP (\fBeoQuadOp\fP< \fBEOT\fP > &_cross, double _pCross, \fBeoMonOp\fP< \fBEOT\fP > &_mut, double _pMut)"
+.br
+.RI "\fICtor from crossover (with proba) and mutation (with proba) Builds the sequential op that first applies a proportional choice between the crossover and nothing (cloning), then the mutation. \fP"
+.ti -1c
+.RI "virtual void \fBapply\fP (\fBeoPopulator\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIdo the job: delegate to op \fP"
+.ti -1c
+.RI "virtual unsigned \fBmax_production\fP (void)"
+.br
+.RI "\fIinherited from \fBeoGenOp\fP \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoQuadOp\fP< \fBEOT\fP > & \fBcross\fP"
+.br
+.ti -1c
+.RI "double \fBpCross\fP"
+.br
+.ti -1c
+.RI "\fBeoMonOp\fP< \fBEOT\fP > & \fBmut\fP"
+.br
+.ti -1c
+.RI "double \fBpMut\fP"
+.br
+.ti -1c
+.RI "\fBeoProportionalOp\fP< \fBEOT\fP > \fBpropOp\fP"
+.br
+.ti -1c
+.RI "\fBeoQuadCloneOp\fP< \fBEOT\fP > \fBquadClone\fP"
+.br
+.ti -1c
+.RI "\fBeoSequentialOp\fP< \fBEOT\fP > \fBop\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSGAGenOp< EOT >"
+*************************************************************************** eoSGAGenOp (for Simple GA) mimicks the usual crossover with proba pCross + mutation with proba pMut inside an eoGeneralOp It does it exactly as class \fBeoSGATransform\fP, i.e. 
+
+only accepts quadratic crossover and unary mutation It was introduced for didactic reasons, but seems to be popular :-) 
+.PP
+Definition at line 44 of file eoSGAGenOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSGATransform.3 b/trunk/paradiseo-eo/doc/man/man3/eoSGATransform.3
new file mode 100644
index 000000000..87fa9f775
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSGATransform.3
@@ -0,0 +1,73 @@
+.TH "eoSGATransform" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSGATransform \- eoSGATransform: transforms a population using genetic operators.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoTransform< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSGATransform\fP (\fBeoQuadOp\fP< \fBEOT\fP > &_cross, double _cProba, \fBeoMonOp\fP< \fBEOT\fP > &_mutate, double _mProba)"
+.br
+.RI "\fIDefault constructor. \fP"
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fITransforms a population. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoInvalidateQuadOp\fP< \fBEOT\fP > \fBcross\fP"
+.br
+.ti -1c
+.RI "double \fBcrossoverProba\fP"
+.br
+.ti -1c
+.RI "\fBeoInvalidateMonOp\fP< \fBEOT\fP > \fBmutate\fP"
+.br
+.ti -1c
+.RI "double \fBmutationProba\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSGATransform< EOT >"
+eoSGATransform: transforms a population using genetic operators. 
+
+It does it exactly as class \fBeoSGA\fP, i.e. only accepts quadratic crossover and unary mutation It is here mainly for tutorial reasons 
+.PP
+Definition at line 45 of file eoSGATransform.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template void \fBeoSGATransform\fP< \fBEOT\fP >::operator() (\fBeoPop\fP< \fBEOT\fP > & _pop)\fC [inline, virtual]\fP"
+.PP
+Transforms a population. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIpop\fP The population to be transformed. 
+.RE
+.PP
+
+.PP
+Implements \fBeoUF< eoPop< EOT > &, void >\fP.
+.PP
+Definition at line 62 of file eoSGATransform.h.
+.PP
+References eoRng::flip().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSSGADetTournamentReplacement.3 b/trunk/paradiseo-eo/doc/man/man3/eoSSGADetTournamentReplacement.3
new file mode 100644
index 000000000..667fd4585
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSSGADetTournamentReplacement.3
@@ -0,0 +1,44 @@
+.TH "eoSSGADetTournamentReplacement" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSSGADetTournamentReplacement \- SSGA deterministic tournament replacement.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoReduceMerge< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSSGADetTournamentReplacement\fP (unsigned _t_size)"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoDetTournamentTruncate\fP< \fBEOT\fP > \fBtruncate\fP"
+.br
+.ti -1c
+.RI "\fBeoPlus\fP< \fBEOT\fP > \fBplus\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSSGADetTournamentReplacement< EOT >"
+SSGA deterministic tournament replacement. 
+
+Is an \fBeoReduceMerge\fP. 
+.PP
+Definition at line 91 of file eoReduceMerge.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSSGAStochTournamentReplacement.3 b/trunk/paradiseo-eo/doc/man/man3/eoSSGAStochTournamentReplacement.3
new file mode 100644
index 000000000..8f8e91f4f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSSGAStochTournamentReplacement.3
@@ -0,0 +1,44 @@
+.TH "eoSSGAStochTournamentReplacement" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSSGAStochTournamentReplacement \- SSGA stochastic tournament replacement.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoReduceMerge< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSSGAStochTournamentReplacement\fP (double _t_rate)"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoStochTournamentTruncate\fP< \fBEOT\fP > \fBtruncate\fP"
+.br
+.ti -1c
+.RI "\fBeoPlus\fP< \fBEOT\fP > \fBplus\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSSGAStochTournamentReplacement< EOT >"
+SSGA stochastic tournament replacement. 
+
+Is an \fBeoReduceMerge\fP. It much cleaner to insert directly the offspring in the parent population, but it is NOT equivalent in case of more than 1 offspring as already replaced could be removed , which is not possible in the \fBeoReduceMerge\fP So what the heck ! 
+.PP
+Definition at line 108 of file eoReduceMerge.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSSGAWorseReplacement.3 b/trunk/paradiseo-eo/doc/man/man3/eoSSGAWorseReplacement.3
new file mode 100644
index 000000000..dc8bdc4af
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSSGAWorseReplacement.3
@@ -0,0 +1,37 @@
+.TH "eoSSGAWorseReplacement" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSSGAWorseReplacement \- SSGA replace worst.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoReduceMerge< EOT >< EOT >\fP.
+.PP
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoLinearTruncate\fP< \fBEOT\fP > \fBtruncate\fP"
+.br
+.ti -1c
+.RI "\fBeoPlus\fP< \fBEOT\fP > \fBplus\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSSGAWorseReplacement< EOT >"
+SSGA replace worst. 
+
+Is an \fBeoReduceMerge\fP. 
+.PP
+Definition at line 77 of file eoReduceMerge.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSTLBF.3 b/trunk/paradiseo-eo/doc/man/man3/eoSTLBF.3
new file mode 100644
index 000000000..39cd642c1
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSTLBF.3
@@ -0,0 +1,44 @@
+.TH "eoSTLBF" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSTLBF \- Generic set of classes that wrap an \fBeoF\fP, \fBeoUF\fP or \fBeoBF\fP so that they have the copy semantics the STL functions usually require (i.e.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSTLBF\fP (\fBeoUF\fP< A1, R > &_f)"
+.br
+.ti -1c
+.RI "R \fBoperator()\fP (A1 a1, A2 a2)"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoBF\fP< A1, A2, R > & \fBf\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSTLBF< A1, A2, R >"
+Generic set of classes that wrap an \fBeoF\fP, \fBeoUF\fP or \fBeoBF\fP so that they have the copy semantics the STL functions usually require (i.e. 
+
+they can be passed by value, rather than the \fBEO\fP standard pass by reference).
+.PP
+The family consists of \fBeoSTLF\fP, \fBeoSTLUF\fP, eoSTLBF that modify \fBeoF\fP, \fBeoUF\fP and \fBeoBF\fP respectively 
+.PP
+Definition at line 101 of file eoSTLFunctor.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSTLF.3 b/trunk/paradiseo-eo/doc/man/man3/eoSTLF.3
new file mode 100644
index 000000000..0d525a6b7
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSTLF.3
@@ -0,0 +1,51 @@
+.TH "eoSTLF" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSTLF \- Generic set of classes that wrap an \fBeoF\fP, \fBeoUF\fP or \fBeoBF\fP so that they have the copy semantics the STL functions usually require (i.e.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef R \fBresult_type\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSTLF\fP (\fBeoF\fP< R > &_f)"
+.br
+.ti -1c
+.RI "R \fBoperator()\fP (void)"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoF\fP< R > & \fBf\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSTLF< R >"
+Generic set of classes that wrap an \fBeoF\fP, \fBeoUF\fP or \fBeoBF\fP so that they have the copy semantics the STL functions usually require (i.e. 
+
+they can be passed by value, rather than the \fBEO\fP standard pass by reference).
+.PP
+The family consists of eoSTLF, \fBeoSTLUF\fP, \fBeoSTLBF\fP that modify \fBeoF\fP, \fBeoUF\fP and \fBeoBF\fP respectively 
+.PP
+Definition at line 41 of file eoSTLFunctor.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSTLUF.3 b/trunk/paradiseo-eo/doc/man/man3/eoSTLUF.3
new file mode 100644
index 000000000..587365c9d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSTLUF.3
@@ -0,0 +1,44 @@
+.TH "eoSTLUF" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSTLUF \- Generic set of classes that wrap an \fBeoF\fP, \fBeoUF\fP or \fBeoBF\fP so that they have the copy semantics the STL functions usually require (i.e.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSTLUF\fP (\fBeoUF\fP< A1, R > &_f)"
+.br
+.ti -1c
+.RI "R \fBoperator()\fP (A1 a)"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoUF\fP< A1, R > & \fBf\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSTLUF< A1, R >"
+Generic set of classes that wrap an \fBeoF\fP, \fBeoUF\fP or \fBeoBF\fP so that they have the copy semantics the STL functions usually require (i.e. 
+
+they can be passed by value, rather than the \fBEO\fP standard pass by reference).
+.PP
+The family consists of \fBeoSTLF\fP, eoSTLUF, \fBeoSTLBF\fP that modify \fBeoF\fP, \fBeoUF\fP and \fBeoBF\fP respectively 
+.PP
+Definition at line 78 of file eoSTLFunctor.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoScalarFitness.3 b/trunk/paradiseo-eo/doc/man/man3/eoScalarFitness.3
new file mode 100644
index 000000000..901791e07
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoScalarFitness.3
@@ -0,0 +1,66 @@
+.TH "eoScalarFitness" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoScalarFitness \- eoScalarFitness >: Wraps a scalar fitness values such as a double or int, with the option of maximizing (using less) or minimizing (using greater)  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoScalarFitness\fP (const \fBeoScalarFitness\fP &other)"
+.br
+.ti -1c
+.RI "\fBeoScalarFitness\fP (const ScalarType &v)"
+.br
+.ti -1c
+.RI "\fBeoScalarFitness\fP & \fBoperator=\fP (const \fBeoScalarFitness\fP &other)"
+.br
+.ti -1c
+.RI "\fBeoScalarFitness\fP & \fBoperator=\fP (const ScalarType &v)"
+.br
+.ti -1c
+.RI "\fBoperator ScalarType\fP (void) const "
+.br
+.ti -1c
+.RI "bool \fBoperator<\fP (const \fBeoScalarFitness\fP &other) const "
+.br
+.RI "\fIComparison, using less by default. \fP"
+.ti -1c
+.RI "bool \fBoperator>\fP (const \fBeoScalarFitness\fP< ScalarType, Compare > &y) const "
+.br
+.ti -1c
+.RI "bool \fBoperator<=\fP (const \fBeoScalarFitness\fP< ScalarType, Compare > &y) const "
+.br
+.ti -1c
+.RI "bool \fBoperator>=\fP (const \fBeoScalarFitness\fP< ScalarType, Compare > &y) const "
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "ScalarType \fBvalue\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoScalarFitness< ScalarType, Compare >"
+eoScalarFitness >: Wraps a scalar fitness values such as a double or int, with the option of maximizing (using less) or minimizing (using greater) 
+
+It overrides \fBoperator<()\fP to use the Compare template argument
+.PP
+Suitable constructors and assignments and casts are defined to work with this quantity as if it were a ScalarType. 
+.PP
+Definition at line 43 of file eoScalarFitness.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoScalarFitnessAssembled.3 b/trunk/paradiseo-eo/doc/man/man3/eoScalarFitnessAssembled.3
new file mode 100644
index 000000000..fed14116a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoScalarFitnessAssembled.3
@@ -0,0 +1,134 @@
+.TH "eoScalarFitnessAssembled" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoScalarFitnessAssembled \- Implements fitness as std::vector, storing all values that might occur during fitness assembly.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef std::vector< ScalarType > \fBbaseVector\fP"
+.br
+.ti -1c
+.RI "typedef baseVector::size_type \fBsize_type\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoScalarFitnessAssembled\fP (size_type _n, const ScalarType &_val, const std::string &_descr='Unnamed variable')"
+.br
+.ti -1c
+.RI "\fBeoScalarFitnessAssembled\fP (const \fBeoScalarFitnessAssembled\fP &other)"
+.br
+.ti -1c
+.RI "\fBeoScalarFitnessAssembled\fP & \fBoperator=\fP (const \fBeoScalarFitnessAssembled\fP &other)"
+.br
+.ti -1c
+.RI "\fBeoScalarFitnessAssembled\fP (const ScalarType &v)"
+.br
+.ti -1c
+.RI "\fBeoScalarFitnessAssembled\fP & \fBoperator=\fP (const ScalarType &v)"
+.br
+.ti -1c
+.RI "void \fBpush_back\fP (const ScalarType &_val)"
+.br
+.RI "\fIOverload \fBpush_back()\fP. \fP"
+.ti -1c
+.RI "void \fBpush_back\fP (const ScalarType &_val, const std::string &_descr)"
+.br
+.RI "\fIOverload \fBpush_back()\fP. \fP"
+.ti -1c
+.RI "void \fBresize\fP (size_type _n, const ScalarType &_val=ScalarType(), const std::string &_descr='Unnamed variable')"
+.br
+.RI "\fIOverload \fBresize()\fP. \fP"
+.ti -1c
+.RI "void \fBsetDescription\fP (size_type _idx, std::string _descr)"
+.br
+.RI "\fISet description. \fP"
+.ti -1c
+.RI "std::string \fBgetDescription\fP (size_type _idx)"
+.br
+.RI "\fIGet description. \fP"
+.ti -1c
+.RI "std::vector< std::string > \fBgetDescriptionVector\fP ()"
+.br
+.RI "\fIGet vector with descriptions. \fP"
+.ti -1c
+.RI "\fBoperator ScalarType\fP (void) const "
+.br
+.ti -1c
+.RI "void \fBprintAll\fP (std::ostream &os) const "
+.br
+.RI "\fIPrint term values and descriptions. \fP"
+.ti -1c
+.RI "bool \fBoperator<\fP (const \fBeoScalarFitnessAssembled\fP &other) const "
+.br
+.ti -1c
+.RI "bool \fBoperator>\fP (const \fBeoScalarFitnessAssembled\fP< ScalarType, Compare, FitnessTraits > &y) const "
+.br
+.ti -1c
+.RI "bool \fBoperator<=\fP (const \fBeoScalarFitnessAssembled\fP< ScalarType, Compare, FitnessTraits > &y) const "
+.br
+.ti -1c
+.RI "bool \fBoperator>=\fP (const \fBeoScalarFitnessAssembled\fP< ScalarType, Compare, FitnessTraits > &y) const "
+.br
+.in -1c
+.SS "Public Attributes"
+
+.in +1c
+.ti -1c
+.RI "bool \fBfeasible\fP"
+.br
+.RI "\fICan be specified anywhere in fitness evaluation as an indicator if the individual is in some feasible range. \fP"
+.ti -1c
+.RI "bool \fBfailed\fP"
+.br
+.RI "\fICan be specified anywhere in fitness evaluation as an indicator if the evaluation of the individual failed. \fP"
+.ti -1c
+.RI "std::string \fBmsg\fP"
+.br
+.RI "\fICan be specified anywhere in fitness evaluation. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits >"
+Implements fitness as std::vector, storing all values that might occur during fitness assembly. 
+
+Properties:
+.IP "\(bu" 2
+Wraps a scalar fitness values such as a double or int, with the option of maximizing (using less) or minimizing (using greater).
+.IP "\(bu" 2
+Stores all kinda different values met during fitness assembly, to be defined in \fBeoEvalFunc\fP.
+.IP "\(bu" 2
+It overrides operator<() to use the Compare template argument.
+.IP "\(bu" 2
+Suitable constructors and assignments and casts are defined to work with this quantity as if it were a ScalarType.
+.IP "\(bu" 2
+Global fitness value is stored as first element in the vector 
+.PP
+
+.PP
+Definition at line 88 of file eoScalarFitnessAssembled.h.
+.SH "Member Data Documentation"
+.PP 
+.SS "template std::string \fBeoScalarFitnessAssembled\fP< ScalarType, Compare, FitnessTraits >::\fBmsg\fP"
+.PP
+Can be specified anywhere in fitness evaluation. 
+.PP
+Typically used to store some sort of error messages, if evaluation of individual failed. 
+.PP
+Definition at line 195 of file eoScalarFitnessAssembled.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoScalarFitnessAssembledTraits.3 b/trunk/paradiseo-eo/doc/man/man3/eoScalarFitnessAssembledTraits.3
new file mode 100644
index 000000000..569e184a3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoScalarFitnessAssembledTraits.3
@@ -0,0 +1,60 @@
+.TH "eoScalarFitnessAssembledTraits" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoScalarFitnessAssembledTraits \- Defines properties of \fBeoScalarFitnessAssembled\fP.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef std::vector< std::string >::size_type \fBsize_type\fP"
+.br
+.in -1c
+.SS "Static Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "void \fBsetDescription\fP (size_type _idx, std::string _descr)"
+.br
+.ti -1c
+.RI "std::string \fBgetDescription\fP (size_type _idx)"
+.br
+.ti -1c
+.RI "void \fBresize\fP (size_type _n, const std::string &_descr)"
+.br
+.ti -1c
+.RI "size_type \fBsize\fP ()"
+.br
+.ti -1c
+.RI "std::vector< std::string > \fBgetDescriptionVector\fP ()"
+.br
+.in -1c
+.SS "Static Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "std::vector< std::string > \fBTermDescriptions\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+Defines properties of \fBeoScalarFitnessAssembled\fP. 
+
+Properties that are hold in this traits class:
+.IP "\(bu" 2
+std::vector to hold descriptions of the different fitness terms 
+.PP
+
+.PP
+Definition at line 43 of file eoScalarFitnessAssembled.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoScalarFitnessStat.3 b/trunk/paradiseo-eo/doc/man/man3/eoScalarFitnessStat.3
new file mode 100644
index 000000000..e323dbe20
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoScalarFitnessStat.3
@@ -0,0 +1,43 @@
+.TH "eoScalarFitnessStat" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoScalarFitnessStat \- The fitnesses of a whole population, as a std::vector.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoSortedStat< EOT, std::vector< double > >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoScalarFitnessStat\fP (std::string _description='FitnessES', eoRealVectorBounds &_bounds=eoDummyVectorNoBounds)"
+.br
+.ti -1c
+.RI "virtual void \fBoperator()\fP (const std::vector< const \fBEOT\fP * > &_popPters)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoRealBounds\fP & \fBrange\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoScalarFitnessStat< EOT, FitT >"
+The fitnesses of a whole population, as a std::vector. 
+.PP
+Definition at line 37 of file eoScalarFitnessStat.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSecondMomentStats.3 b/trunk/paradiseo-eo/doc/man/man3/eoSecondMomentStats.3
new file mode 100644
index 000000000..02aeb9b7d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSecondMomentStats.3
@@ -0,0 +1,58 @@
+.TH "eoSecondMomentStats" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSecondMomentStats \- Average fitness + Std.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoStat< EOT, std::pair< double, double > >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::Fitness \fBfitness_type\fP"
+.br
+.ti -1c
+.RI "typedef std::pair< double, double > \fBSquarePair\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSecondMomentStats\fP (std::string _description='Average & Stdev')"
+.br
+.ti -1c
+.RI "virtual void \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.in -1c
+.SS "Static Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "SquarePair \fBsumOfSquares\fP (SquarePair _sq, const \fBEOT\fP &_eo)"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSecondMomentStats< EOT >"
+Average fitness + Std. 
+
+dev. of a population, fitness needs to be scalar. 
+.PP
+Definition at line 168 of file eoStat.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSegmentCrossover.3 b/trunk/paradiseo-eo/doc/man/man3/eoSegmentCrossover.3
new file mode 100644
index 000000000..5196b90eb
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSegmentCrossover.3
@@ -0,0 +1,108 @@
+.TH "eoSegmentCrossover" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSegmentCrossover \- eoSegmentCrossover --> uniform choice in segment == arithmetical with same value along all coordinates  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoQuadOp< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSegmentCrossover\fP (const double &_alpha=0.0)"
+.br
+.RI "\fI(Default) Constructor. \fP"
+.ti -1c
+.RI "\fBeoSegmentCrossover\fP (\fBeoRealVectorBounds\fP &_bounds, const double &_alpha=0.0)"
+.br
+.RI "\fIConstructor with bounds. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIThe class name. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eo1, \fBEOT\fP &_eo2)"
+.br
+.RI "\fIsegment crossover - modifies both parents \fP"
+.in -1c
+.SS "Protected Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoRealVectorBounds\fP & \fBbounds\fP"
+.br
+.ti -1c
+.RI "double \fBalpha\fP"
+.br
+.ti -1c
+.RI "double \fBrange\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSegmentCrossover< EOT >"
+eoSegmentCrossover --> uniform choice in segment == arithmetical with same value along all coordinates 
+.PP
+Definition at line 247 of file eoRealOp.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoSegmentCrossover\fP< \fBEOT\fP >::\fBeoSegmentCrossover\fP (const double & _alpha = \fC0.0\fP)\fC [inline]\fP"
+.PP
+(Default) Constructor. 
+.PP
+The bounds are initialized with the global object that says: no bounds.
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_alphaMin\fP the amount of exploration OUTSIDE the parents as in BLX-alpha notation (Eshelman and Schaffer) 0 == contractive application Must be positive 
+.RE
+.PP
+
+.PP
+Definition at line 259 of file eoRealOp.h.
+.SS "template \fBeoSegmentCrossover\fP< \fBEOT\fP >::\fBeoSegmentCrossover\fP (\fBeoRealVectorBounds\fP & _bounds, const double & _alpha = \fC0.0\fP)\fC [inline]\fP"
+.PP
+Constructor with bounds. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_bounds\fP an \fBeoRealVectorBounds\fP that contains the bounds 
+.br
+\fI_alphaMin\fP the amount of exploration OUTSIDE the parents as in BLX-alpha notation (Eshelman and Schaffer) 0 == contractive application Must be positive 
+.RE
+.PP
+
+.PP
+Definition at line 270 of file eoRealOp.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template bool \fBeoSegmentCrossover\fP< \fBEOT\fP >::operator() (\fBEOT\fP & _eo1, \fBEOT\fP & _eo2)\fC [inline, virtual]\fP"
+.PP
+segment crossover - modifies both parents 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_eo1\fP The first parent 
+.br
+\fI_eo2\fP The first parent 
+.RE
+.PP
+
+.PP
+Implements \fBeoBF< EOT &, EOT &, bool >\fP.
+.PP
+Definition at line 282 of file eoRealOp.h.
+.PP
+References eoRealBaseVectorBounds::isMaxBounded(), eoRealBaseVectorBounds::isMinBounded(), eoRealBaseVectorBounds::maximum(), eoRealBaseVectorBounds::minimum(), and eoRng::uniform().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSelBinGenOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoSelBinGenOp.3
new file mode 100644
index 000000000..9815440a6
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSelBinGenOp.3
@@ -0,0 +1,53 @@
+.TH "eoSelBinGenOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSelBinGenOp \- wrapper for \fBeoBinOp\fP with a selector  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoGenOp< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSelBinGenOp\fP (\fBeoBinOp\fP< \fBEOT\fP > &_op, \fBeoSelectOne\fP< \fBEOT\fP > &_sel)"
+.br
+.ti -1c
+.RI "unsigned \fBmax_production\fP (void)"
+.br
+.RI "\fIMax production is used to reserve space for all elements that are used by the operator, not setting it properly can result in a crash. \fP"
+.ti -1c
+.RI "void \fBapply\fP (\fBeoPopulator\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIthe function that will do the work \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoBinOp\fP< \fBEOT\fP > & \fBop\fP"
+.br
+.ti -1c
+.RI "\fBeoSelectOne\fP< \fBEOT\fP > & \fBsel\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSelBinGenOp< EOT >"
+wrapper for \fBeoBinOp\fP with a selector 
+.PP
+Definition at line 133 of file eoGenOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSelect.3 b/trunk/paradiseo-eo/doc/man/man3/eoSelect.3
new file mode 100644
index 000000000..545e54ab9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSelect.3
@@ -0,0 +1,29 @@
+.TH "eoSelect" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSelect \- eoSelect selects a number of individuals from the first argument and puts it in the second.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoBF< const eoPop< EOT > &, eoPop< EOT > &, void >\fP.
+.PP
+Inherited by \fBeoDetSelect< EOT >\fP, eoEasyEA< EOT >::eoDummySelect, \fBeoSelectMany< EOT >\fP, \fBeoSelectNumber< EOT >\fP, \fBeoSelectPerc< EOT >\fP, \fBeoTruncatedSelectMany< EOT >\fP, and \fBeoTruncSelect< EOT >\fP.
+.PP
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSelect< EOT >"
+eoSelect selects a number of individuals from the first argument and puts it in the second. 
+
+To emphasize that it should not try to enlarge the population, the second argument is an eoPopRange, a simple struct that holds a begin and end iterator to the population 
+.PP
+Definition at line 40 of file eoSelect.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSelectFactory.3 b/trunk/paradiseo-eo/doc/man/man3/eoSelectFactory.3
new file mode 100644
index 000000000..aa0d8ba4e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSelectFactory.3
@@ -0,0 +1,81 @@
+.TH "eoSelectFactory" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSelectFactory \- \fBEO\fP Factory.An instance of the factory class to create selectors, that is, \fBeoSelect\fP objects.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoFactory< eoSelect< EOT > >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual \fBeoSelect\fP< \fBEOT\fP > * \fBmake\fP (std::istream &_is)"
+.br
+.RI "\fIAnother factory methods: creates an object from an std::istream, reading from it whatever is needed to create the object. \fP"
+.in -1c
+.PP
+.RI "\fBctors and dtors\fP"
+.br
+
+.in +1c
+.in +1c
+.ti -1c
+.RI "\fBeoSelectFactory\fP ()"
+.br
+.RI "\fIconstructor \fP"
+.ti -1c
+.RI "virtual \fB~eoSelectFactory\fP ()"
+.br
+.RI "\fIdestructor \fP"
+.in -1c
+.in -1c
+.PP
+.RI "\fBeoObject methods\fP"
+.br
+
+.in +1c
+.in +1c
+.ti -1c
+.RI "void \fBprintOn\fP (std::ostream &_os) const "
+.br
+.ti -1c
+.RI "void \fBreadFrom\fP (std::istream &_is)"
+.br
+.in -1c
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSelectFactory< EOT >"
+\fBEO\fP Factory.An instance of the factory class to create selectors, that is, \fBeoSelect\fP objects. 
+
+\fBSee also:\fP
+.RS 4
+\fBeoSelect\fP 
+.RE
+.PP
+
+.PP
+Definition at line 39 of file eoSelectFactory.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template virtual \fBeoSelect\fP<\fBEOT\fP>* \fBeoSelectFactory\fP< \fBEOT\fP >::make (std::istream & _is)\fC [inline, virtual]\fP"
+.PP
+Another factory methods: creates an object from an std::istream, reading from it whatever is needed to create the object. 
+.PP
+Usually, the format for the std::istream will be\\ objectType parameter1 parameter2 ... parametern\\
+.PP
+Implements \fBeoFactory< eoSelect< EOT > >\fP.
+.PP
+Definition at line 56 of file eoSelectFactory.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSelectFromWorth.3 b/trunk/paradiseo-eo/doc/man/man3/eoSelectFromWorth.3
new file mode 100644
index 000000000..4d1e44d8a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSelectFromWorth.3
@@ -0,0 +1,61 @@
+.TH "eoSelectFromWorth" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSelectFromWorth \- selects one element from a population (is an \fBeoSelectOne\fP) but the selection is based on a std::vector of Worth that is different from the fitnesses (e.g.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoSelectOne< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSelectFromWorth\fP (\fBeoPerf2Worth\fP< \fBEOT\fP, WorthType > &_perf2Worth)"
+.br
+.ti -1c
+.RI "virtual void \fBsetup\fP (const \fBeoPop\fP< \fBEOT\fP > &pop)"
+.br
+.RI "\fIvirtual function to setup some population stats (for instance eoProportional can benefit greatly from this) \fP"
+.in -1c
+.SS "Protected Member Functions"
+
+.in +1c
+.ti -1c
+.RI "void \fBcheck_sync\fP (unsigned index, const \fBEOT\fP &_eo)"
+.br
+.in -1c
+.SS "Protected Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoPerf2Worth\fP< \fBEOT\fP, WorthType > & \fBperf2Worth\fP"
+.br
+.ti -1c
+.RI "std::vector< typename EOT::Fitness > \fBfitness\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSelectFromWorth< EOT, WorthType >"
+selects one element from a population (is an \fBeoSelectOne\fP) but the selection is based on a std::vector of Worth that is different from the fitnesses (e.g. 
+
+\fBEO\fP fitness is what Koza terms 'raw fitness', Worth is what the selection is based upon).
+.PP
+see class \fBeoPerf2Worth\fP: an \fBeoStat\fP that transforms fitnesses into Worthes
+.PP
+Note: Worthes will not always be doubles - see some multi-objective techniques where it is a std::pair of doubles ...
+.PP
+It has to have a < operator it you want to call an existing selector (see selector.h) - but of course you can write the whole thing ... 
+.PP
+Definition at line 51 of file eoSelectFromWorth.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSelectMany.3 b/trunk/paradiseo-eo/doc/man/man3/eoSelectMany.3
new file mode 100644
index 000000000..6e8425732
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSelectMany.3
@@ -0,0 +1,74 @@
+.TH "eoSelectMany" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSelectMany \- eoSelectMany selects many individuals using \fBeoSelectOne\fP as it's mechanism.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoSelect< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSelectMany\fP (\fBeoSelectOne\fP< \fBEOT\fP > &_select, double _rate, bool _interpret_as_rate=true)"
+.br
+.RI "\fIinit \fP"
+.ti -1c
+.RI "\fBeoSelectMany\fP (\fBeoSelectOne\fP< \fBEOT\fP > &_select, \fBeoHowMany\fP _howMany)"
+.br
+.ti -1c
+.RI "virtual void \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_source, \fBeoPop\fP< \fBEOT\fP > &_dest)"
+.br
+.RI "\fIThe implementation repeatidly selects an individual. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSelectOne\fP< \fBEOT\fP > & \fBselect\fP"
+.br
+.ti -1c
+.RI "\fBeoHowMany\fP \fBhowMany\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSelectMany< EOT >"
+eoSelectMany selects many individuals using \fBeoSelectOne\fP as it's mechanism. 
+
+Therefore eoSelectMany needs an \fBeoSelectOne\fP in its ctor
+.PP
+It will use an eoHowMnay to determine the number of guys to select, and push them to the back of the destination population. 
+.PP
+Definition at line 45 of file eoSelectMany.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template virtual void \fBeoSelectMany\fP< \fBEOT\fP >::operator() (const \fBeoPop\fP< \fBEOT\fP > & _source, \fBeoPop\fP< \fBEOT\fP > & _dest)\fC [inline, virtual]\fP"
+.PP
+The implementation repeatidly selects an individual. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_source\fP the source population 
+.br
+\fI_dest\fP the resulting population (size of this population is the number of times \fBeoSelectOne\fP is called. It empties the destination and adds the selection into it) 
+.RE
+.PP
+
+.PP
+Implements \fBeoBF< const eoPop< EOT > &, eoPop< EOT > &, void >\fP.
+.PP
+Definition at line 63 of file eoSelectMany.h.
+.PP
+References eoSelectOne< EOT, WorthT >::setup().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSelectNumber.3 b/trunk/paradiseo-eo/doc/man/man3/eoSelectNumber.3
new file mode 100644
index 000000000..92515da48
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSelectNumber.3
@@ -0,0 +1,71 @@
+.TH "eoSelectNumber" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSelectNumber \- eoSelectNumber selects many individuals using \fBeoSelectOne\fP as it's mechanism.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoSelect< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSelectNumber\fP (\fBeoSelectOne\fP< \fBEOT\fP > &_select, unsigned _nb_to_select=1)"
+.br
+.RI "\fIinit \fP"
+.ti -1c
+.RI "virtual void \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_source, \fBeoPop\fP< \fBEOT\fP > &_dest)"
+.br
+.RI "\fIThe implementation repeatidly selects an individual. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSelectOne\fP< \fBEOT\fP > & \fBselect\fP"
+.br
+.ti -1c
+.RI "unsigned \fBnb_to_select\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSelectNumber< EOT >"
+eoSelectNumber selects many individuals using \fBeoSelectOne\fP as it's mechanism. 
+
+Therefore eoSelectNumber needs an \fBeoSelectOne\fP in its ctor
+.PP
+It will select a fixed number of individuals and pushes them to the back of the destination population. 
+.PP
+Definition at line 42 of file eoSelectNumber.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template virtual void \fBeoSelectNumber\fP< \fBEOT\fP >::operator() (const \fBeoPop\fP< \fBEOT\fP > & _source, \fBeoPop\fP< \fBEOT\fP > & _dest)\fC [inline, virtual]\fP"
+.PP
+The implementation repeatidly selects an individual. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_source\fP the source population 
+.br
+\fI_dest\fP the resulting population (size of this population is the number of times \fBeoSelectOne\fP is called. It empties the destination and adds the selection into it) 
+.RE
+.PP
+
+.PP
+Implements \fBeoBF< const eoPop< EOT > &, eoPop< EOT > &, void >\fP.
+.PP
+Definition at line 55 of file eoSelectNumber.h.
+.PP
+References eoSelectOne< EOT, WorthT >::setup().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSelectOne.3 b/trunk/paradiseo-eo/doc/man/man3/eoSelectOne.3
new file mode 100644
index 000000000..e07a9bc46
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSelectOne.3
@@ -0,0 +1,42 @@
+.TH "eoSelectOne" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSelectOne \- eoSelectOne selects only one element from a whole population.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoUF< const eoPop< EOT > &, const EOT & >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual void \fBsetup\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIvirtual function to setup some population stats (for instance eoProportional can benefit greatly from this) \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSelectOne< EOT, WorthT >"
+eoSelectOne selects only one element from a whole population. 
+
+Most selection techniques are simply repeated applications of eoSelectOne.
+.PP
+\fBSee also:\fP
+.RS 4
+\fBeoSelectMany\fP, eoSelectRandom, eoDetTournament, eoStochTournament, eoProportional 
+.RE
+.PP
+
+.PP
+Definition at line 45 of file eoSelectOne.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSelectPerc.3 b/trunk/paradiseo-eo/doc/man/man3/eoSelectPerc.3
new file mode 100644
index 000000000..14673937b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSelectPerc.3
@@ -0,0 +1,71 @@
+.TH "eoSelectPerc" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSelectPerc \- eoSelectPerc selects many individuals using \fBeoSelectOne\fP as it's mechanism.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoSelect< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSelectPerc\fP (\fBeoSelectOne\fP< \fBEOT\fP > &_select, float _rate=1.0)"
+.br
+.RI "\fIinit \fP"
+.ti -1c
+.RI "virtual void \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_source, \fBeoPop\fP< \fBEOT\fP > &_dest)"
+.br
+.RI "\fIThe implementation selects a percentage. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSelectOne\fP< \fBEOT\fP > & \fBselect\fP"
+.br
+.ti -1c
+.RI "float \fBrate\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSelectPerc< EOT >"
+eoSelectPerc selects many individuals using \fBeoSelectOne\fP as it's mechanism. 
+
+Therefore eoSelectPerc needs an \fBeoSelectOne\fP in its ctor
+.PP
+It will select floor(rate*pop.size()) individuals and pushes them to the back of the destination population. 
+.PP
+Definition at line 42 of file eoSelectPerc.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template virtual void \fBeoSelectPerc\fP< \fBEOT\fP >::operator() (const \fBeoPop\fP< \fBEOT\fP > & _source, \fBeoPop\fP< \fBEOT\fP > & _dest)\fC [inline, virtual]\fP"
+.PP
+The implementation selects a percentage. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_source\fP the source population 
+.br
+\fI_dest\fP the resulting population (size of this population is the number of times \fBeoSelectOne\fP is called. It empties the destination and adds the selection into it) 
+.RE
+.PP
+
+.PP
+Implements \fBeoBF< const eoPop< EOT > &, eoPop< EOT > &, void >\fP.
+.PP
+Definition at line 55 of file eoSelectPerc.h.
+.PP
+References eoSelectOne< EOT, WorthT >::setup().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSelectTransform.3 b/trunk/paradiseo-eo/doc/man/man3/eoSelectTransform.3
new file mode 100644
index 000000000..b013b8e12
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSelectTransform.3
@@ -0,0 +1,48 @@
+.TH "eoSelectTransform" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSelectTransform \- Embedded select, followed by an embedded transform.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoBreed< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSelectTransform\fP (\fBeoSelect\fP< \fBEOT\fP > &_select, \fBeoTransform\fP< \fBEOT\fP > &_transform)"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_parents, \fBeoPop\fP< \fBEOT\fP > &_offspring)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSelect\fP< \fBEOT\fP > & \fBselect\fP"
+.br
+.ti -1c
+.RI "\fBeoTransform\fP< \fBEOT\fP > & \fBtransform\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSelectTransform< EOT >"
+Embedded select, followed by an embedded transform. 
+
+Special breeder that is just an application of an embedded select, followed by an embedded transform 
+.PP
+Definition at line 57 of file eoBreed.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSelectivePopulator.3 b/trunk/paradiseo-eo/doc/man/man3/eoSelectivePopulator.3
new file mode 100644
index 000000000..ef51d7ec1
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSelectivePopulator.3
@@ -0,0 +1,45 @@
+.TH "eoSelectivePopulator" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSelectivePopulator \- SelectivePopulator an eoPoplator that uses an \fBeoSelectOne\fP to select guys.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoPopulator< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSelectivePopulator\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop, \fBeoPop\fP< \fBEOT\fP > &_dest, \fBeoSelectOne\fP< \fBEOT\fP > &_sel)"
+.br
+.ti -1c
+.RI "const \fBEOT\fP & \fBselect\fP ()"
+.br
+.RI "\fIthe select method actually selects one guy from the src pop \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSelectOne\fP< \fBEOT\fP > & \fBsel\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSelectivePopulator< EOT >"
+SelectivePopulator an eoPoplator that uses an \fBeoSelectOne\fP to select guys. 
+
+Supposedly, it is passed the initial population. 
+.PP
+Definition at line 184 of file eoPopulator.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSeqPopulator.3 b/trunk/paradiseo-eo/doc/man/man3/eoSeqPopulator.3
new file mode 100644
index 000000000..35f524c0b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSeqPopulator.3
@@ -0,0 +1,43 @@
+.TH "eoSeqPopulator" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSeqPopulator \- SeqPopulator: an \fBeoPopulator\fP that sequentially goes through the population is supposed to be used after a batch select of a whole bunch or genitors.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoPopulator< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSeqPopulator\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop, \fBeoPop\fP< \fBEOT\fP > &_dest)"
+.br
+.ti -1c
+.RI "const \fBEOT\fP & \fBselect\fP (void)"
+.br
+.RI "\fIthe select method simply returns next individual in the src pop \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBcurrent\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSeqPopulator< EOT >"
+SeqPopulator: an \fBeoPopulator\fP that sequentially goes through the population is supposed to be used after a batch select of a whole bunch or genitors. 
+.PP
+Definition at line 152 of file eoPopulator.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSequentialOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoSequentialOp.3
new file mode 100644
index 000000000..40ffee48d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSequentialOp.3
@@ -0,0 +1,53 @@
+.TH "eoSequentialOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSequentialOp \- Sequential selection: note the mark, rewind, unmark cycle here operators are repeatedly applied on the same individual(s) not all too elegant, but it sort of works...  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoOpContainer< EOT >< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef unsigned \fBposition_type\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "void \fBapply\fP (\fBeoPopulator\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIthe function that will do the work \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "std::vector< size_t > \fBto_apply\fP"
+.br
+.ti -1c
+.RI "std::vector< size_t > \fBproduction\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSequentialOp< EOT >"
+Sequential selection: note the mark, rewind, unmark cycle here operators are repeatedly applied on the same individual(s) not all too elegant, but it sort of works... 
+.PP
+Definition at line 88 of file eoOpContainer.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSequentialSelect.3 b/trunk/paradiseo-eo/doc/man/man3/eoSequentialSelect.3
new file mode 100644
index 000000000..687b4154f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSequentialSelect.3
@@ -0,0 +1,58 @@
+.TH "eoSequentialSelect" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSequentialSelect \- All Individuals in order.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoSelectOne< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSequentialSelect\fP (bool _ordered=true)"
+.br
+.RI "\fICtor: sets the current pter to numeric_limits::max() so init will take place first time not very elegant, maybe ... \fP"
+.ti -1c
+.RI "void \fBsetup\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIvirtual function to setup some population stats (for instance eoProportional can benefit greatly from this) \fP"
+.ti -1c
+.RI "virtual const \fBEOT\fP & \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "bool \fBordered\fP"
+.br
+.ti -1c
+.RI "unsigned \fBcurrent\fP"
+.br
+.ti -1c
+.RI "std::vector< const \fBEOT\fP * > \fBeoPters\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSequentialSelect< EOT >"
+All Individuals in order. 
+
+Looping back to the beginning when exhausted, can be from best to worse, or in random order.
+.PP
+It is the \fBeoSelectOne\fP equivalent of \fBeoDetSelect\fP - though \fBeoDetSelect\fP always returns individuals from best to worst 
+.PP
+Definition at line 52 of file eoSequentialSelect.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSharing.3 b/trunk/paradiseo-eo/doc/man/man3/eoSharing.3
new file mode 100644
index 000000000..a9391ca69
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSharing.3
@@ -0,0 +1,46 @@
+.TH "eoSharing" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSharing \- Sharing is a perf2worth class that implements Goldberg and Richardson's basic sharing see \fBeoSharingSelect\fP for how to use it and test/t-eoSharing.cpp for a sample use of both.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoPerf2Worth< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSharing\fP (double _nicheSize, \fBeoDistance\fP< \fBEOT\fP > &_dist)"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIComputes shared fitnesses. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBnicheSize\fP"
+.br
+.ti -1c
+.RI "\fBeoDistance\fP< \fBEOT\fP > & \fBdist\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSharing< EOT >"
+Sharing is a perf2worth class that implements Goldberg and Richardson's basic sharing see \fBeoSharingSelect\fP for how to use it and test/t-eoSharing.cpp for a sample use of both. 
+.PP
+Definition at line 79 of file eoSharing.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSharingSelect.3 b/trunk/paradiseo-eo/doc/man/man3/eoSharingSelect.3
new file mode 100644
index 000000000..8433a2a9b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSharingSelect.3
@@ -0,0 +1,56 @@
+.TH "eoSharingSelect" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSharingSelect \- eoSharingSelect: select an individual by roulette wheel on its SHARED fitness.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoRouletteWorthSelect< EOT, double >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSharingSelect\fP (double _sigma, \fBeoDistance\fP< \fBEOT\fP > &_dist)"
+.br
+.RI "\fICtor:. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSharing\fP< \fBEOT\fP > \fBsharing\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSharingSelect< EOT >"
+eoSharingSelect: select an individual by roulette wheel on its SHARED fitness. 
+
+It is an \fBeoRouletteWorthSelect\fP, i.e. a selector using a std::vector of worthes rather than the raw fitness (see \fBeoSelectFromWorth.h\fP) It uses an internal \fBeoSharing\fP object which is an \fBeoPerf2Worth\fP 
+.PP
+Definition at line 43 of file eoSharingSelect.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoSharingSelect\fP< \fBEOT\fP >::\fBeoSharingSelect\fP (double _sigma, \fBeoDistance\fP< \fBEOT\fP > & _dist)\fC [inline]\fP"
+.PP
+Ctor:. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_s\fP the sigma_share 
+.RE
+.PP
+
+.PP
+Definition at line 49 of file eoSharingSelect.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSimpleEDA.3 b/trunk/paradiseo-eo/doc/man/man3/eoSimpleEDA.3
new file mode 100644
index 000000000..472867860
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSimpleEDA.3
@@ -0,0 +1,64 @@
+.TH "eoSimpleEDA" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSimpleEDA \- eoSimpleEDA: a very simple Estimation of Distribution Algorithm  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoEDA< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSimpleEDA\fP (\fBeoDistribUpdater\fP< \fBEOT\fP > &_update, \fBeoEvalFunc\fP< \fBEOT\fP > &_eval, unsigned _popSize, \fBeoContinue\fP< \fBEOT\fP > &_continuator)"
+.br
+.RI "\fICtor from an \fBeoDistribUpdater\fP ... \fP"
+.ti -1c
+.RI "virtual void \fBoperator()\fP (\fBeoDistribution\fP< \fBEOT\fP > &_distrib)"
+.br
+.RI "\fIThe algorithm: generate pop from distrib, evaluate pop, update distrib. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoDistribUpdater\fP< \fBEOT\fP > & \fBupdate\fP"
+.br
+.ti -1c
+.RI "\fBeoEvalFunc\fP< \fBEOT\fP > & \fBeval\fP"
+.br
+.ti -1c
+.RI "unsigned \fBpopSize\fP"
+.br
+.ti -1c
+.RI "\fBeoContinue\fP< \fBEOT\fP > & \fBcontinuator\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSimpleEDA< EOT >"
+eoSimpleEDA: a very simple Estimation of Distribution Algorithm 
+
+The algorithm that evolves a probability distribution on the spaces of populations with the loop generate a population from the current distribution evaluate that population update the distribution 
+.PP
+Definition at line 46 of file eoSimpleEDA.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoSimpleEDA\fP< \fBEOT\fP >::\fBeoSimpleEDA\fP (\fBeoDistribUpdater\fP< \fBEOT\fP > & _update, \fBeoEvalFunc\fP< \fBEOT\fP > & _eval, unsigned _popSize, \fBeoContinue\fP< \fBEOT\fP > & _continuator)\fC [inline]\fP"
+.PP
+Ctor from an \fBeoDistribUpdater\fP ... 
+.PP
+plus an eoEval and \fBeoContinue\fP of course 
+.PP
+Definition at line 53 of file eoSimpleEDA.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSortedPopStat.3 b/trunk/paradiseo-eo/doc/man/man3/eoSortedPopStat.3
new file mode 100644
index 000000000..f6705b34e
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSortedPopStat.3
@@ -0,0 +1,72 @@
+.TH "eoSortedPopStat" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSortedPopStat \- Thanks to MS/VC++, \fBeoParam\fP mechanism is unable to handle std::vectors of stats.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoSortedStat< EOT, std::string >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSortedPopStat\fP (unsigned _howMany=0, std::string _desc='')"
+.br
+.RI "\fIdefault Ctor, void std::string by default, as it appears on the description line once at beginning of evolution. \fP"
+.ti -1c
+.RI "void \fBoperator()\fP (const std::vector< const \fBEOT\fP * > &_pop)"
+.br
+.RI "\fIFills the \fBvalue()\fP of the \fBeoParam\fP with the dump of the population. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBcombien\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSortedPopStat< EOT >"
+Thanks to MS/VC++, \fBeoParam\fP mechanism is unable to handle std::vectors of stats. 
+
+This snippet is a workaround: This class will 'print' a whole population into a std::string - that you can later send to any stream This is the Sorted version - see eoPopString for the plain version
+.PP
+Note: this Stat should probably be used only within eoStdOutMonitor, and not inside an \fBeoFileMonitor\fP, as the \fBeoState\fP construct will work much better there. 
+.PP
+Definition at line 96 of file eoPopStat.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoSortedPopStat\fP< \fBEOT\fP >::\fBeoSortedPopStat\fP (unsigned _howMany = \fC0\fP, std::string _desc = \fC''\fP)\fC [inline]\fP"
+.PP
+default Ctor, void std::string by default, as it appears on the description line once at beginning of evolution. 
+.PP
+and is meaningless there _howMany defaults to 0, that is, the whole population 
+.PP
+Definition at line 107 of file eoPopStat.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template void \fBeoSortedPopStat\fP< \fBEOT\fP >::operator() (const std::vector< const \fBEOT\fP * > & _pop)\fC [inline, virtual]\fP"
+.PP
+Fills the \fBvalue()\fP of the \fBeoParam\fP with the dump of the population. 
+.PP
+Adds a 
+.br
+ before so it does not get mixed up with the rest of the stats that are written by the monitor it is probably used from. 
+.PP
+Implements \fBeoUF< const std::vector< const EOT * > &, void >\fP.
+.PP
+Definition at line 116 of file eoPopStat.h.
+.PP
+References eoValueParam< std::string >::value().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSortedStat.3 b/trunk/paradiseo-eo/doc/man/man3/eoSortedStat.3
new file mode 100644
index 000000000..1e5956812
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSortedStat.3
@@ -0,0 +1,35 @@
+.TH "eoSortedStat" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSortedStat \- The actual class that will be used as base for all statistics that need to be calculated over the sorted population It's an \fBeoSortedStatBase\fP AND an \fBeoValueParam\fP so it can be used in Monitors.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoSortedStatBase< EOT >< EOT >\fP, and \fBeoValueParam< ParamType >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSortedStat\fP (ParamType _value, std::string _desc)"
+.br
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSortedStat< EOT, ParamType >"
+The actual class that will be used as base for all statistics that need to be calculated over the sorted population It's an \fBeoSortedStatBase\fP AND an \fBeoValueParam\fP so it can be used in Monitors. 
+.PP
+Definition at line 89 of file eoStat.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSortedStatBase.3 b/trunk/paradiseo-eo/doc/man/man3/eoSortedStatBase.3
new file mode 100644
index 000000000..cde6bb089
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSortedStatBase.3
@@ -0,0 +1,37 @@
+.TH "eoSortedStatBase" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSortedStatBase \- Base class for statistics calculated over a sorted snapshot of the population.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoUF< const std::vector< const EOT * > &, void >\fP.
+.PP
+Inherited by \fBeoSortedStat< EOT, ParamType >\fP, \fBeoSortedStat< EOT, EOT::Fitness >\fP, \fBeoSortedStat< EOT, std::string >\fP, \fBeoSortedStat< EOT, std::vector< double > >\fP, \fBeoSortedStat< EOT, std::vector< FitT > >\fP, and \fBeoSortedStat< EOT, std::vector< PartFitT > >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual void \fBlastCall\fP (const std::vector< const \fBEOT\fP * > &)"
+.br
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSortedStatBase< EOT >"
+Base class for statistics calculated over a sorted snapshot of the population. 
+.PP
+Definition at line 76 of file eoStat.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoStBranchMutation.3 b/trunk/paradiseo-eo/doc/man/man3/eoStBranchMutation.3
new file mode 100644
index 000000000..467e6f26d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoStBranchMutation.3
@@ -0,0 +1,94 @@
+.TH "eoStBranchMutation" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoStBranchMutation \- eoStBranchMutation --> replace a strongly typed subtree with a randomly created strongly typed subtree  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< eoParseTree< FType, Node > >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef \fBeoParseTree\fP< FType, Node > \fBEoType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoStBranchMutation\fP (\fBeoInit\fP< \fBEoType\fP > &_init, unsigned _max_length)"
+.br
+.RI "\fIConstructor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIthe class name \fP"
+.ti -1c
+.RI "virtual \fB~eoStBranchMutation\fP ()"
+.br
+.RI "\fIDtor. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEoType\fP &_eo1)"
+.br
+.RI "\fIMutate an individual. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBmax_length\fP"
+.br
+.ti -1c
+.RI "\fBeoInit\fP< \fBEoType\fP > & \fBinitializer\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoStBranchMutation< FType, Node >"
+eoStBranchMutation --> replace a strongly typed subtree with a randomly created strongly typed subtree 
+.PP
+Definition at line 130 of file eoStParseTreeOp.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoStBranchMutation\fP< FType, Node >::\fBeoStBranchMutation\fP (\fBeoInit\fP< \fBEoType\fP > & _init, unsigned _max_length)\fC [inline]\fP"
+.PP
+Constructor. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_init\fP An instantiation of eoGpDepthInitializer 
+.br
+\fI_max_length\fP the maximum size of an individual 
+.RE
+.PP
+
+.PP
+Definition at line 140 of file eoStParseTreeOp.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template bool \fBeoStBranchMutation\fP< FType, Node >::operator() (\fBEoType\fP & _eo1)\fC [inline]\fP"
+.PP
+Mutate an individual. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_eo1\fP The individual that is to be changed 
+.RE
+.PP
+
+.PP
+Definition at line 154 of file eoStParseTreeOp.h.
+.PP
+References eoRng::random().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoStHoistMutation.3 b/trunk/paradiseo-eo/doc/man/man3/eoStHoistMutation.3
new file mode 100644
index 000000000..d380f7346
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoStHoistMutation.3
@@ -0,0 +1,94 @@
+.TH "eoStHoistMutation" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoStHoistMutation \- eoStHoistMutation --> replace the individual with one of its strongly typed subtree's  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< eoParseTree< FType, Node > >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef \fBeoParseTree\fP< FType, Node > \fBEoType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoStHoistMutation\fP (\fBeoInit\fP< \fBEoType\fP > &_init, unsigned _max_length)"
+.br
+.RI "\fIConstructor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIthe class name \fP"
+.ti -1c
+.RI "virtual \fB~eoStHoistMutation\fP ()"
+.br
+.RI "\fIDtor. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEoType\fP &_eo1)"
+.br
+.RI "\fIMutate an individual. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBmax_length\fP"
+.br
+.ti -1c
+.RI "\fBeoInit\fP< \fBEoType\fP > & \fBinitializer\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoStHoistMutation< FType, Node >"
+eoStHoistMutation --> replace the individual with one of its strongly typed subtree's 
+.PP
+Definition at line 258 of file eoStParseTreeOp.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoStHoistMutation\fP< FType, Node >::\fBeoStHoistMutation\fP (\fBeoInit\fP< \fBEoType\fP > & _init, unsigned _max_length)\fC [inline]\fP"
+.PP
+Constructor. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_init\fP An instantiation of eoStDepthInit 
+.br
+\fI_max_length\fP the maximum size of an individual 
+.RE
+.PP
+
+.PP
+Definition at line 268 of file eoStParseTreeOp.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template bool \fBeoStHoistMutation\fP< FType, Node >::operator() (\fBEoType\fP & _eo1)\fC [inline]\fP"
+.PP
+Mutate an individual. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_eo1\fP The individual that is to be changed 
+.RE
+.PP
+
+.PP
+Definition at line 282 of file eoStParseTreeOp.h.
+.PP
+References eoRng::random().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoStParseTreeDepthInit.3 b/trunk/paradiseo-eo/doc/man/man3/eoStParseTreeDepthInit.3
new file mode 100644
index 000000000..fa64e1ea9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoStParseTreeDepthInit.3
@@ -0,0 +1,103 @@
+.TH "eoStParseTreeDepthInit" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoStParseTreeDepthInit \- eoStParseTreeDepthInit : the initializer class for strongly typed tree-based genetic programming  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoInit< eoParseTree< FType, Node > >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef \fBeoParseTree\fP< FType, Node > \fBEoType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoStParseTreeDepthInit\fP (unsigned _max_depth, const std::vector< Node > &_node, const int &_return_type, bool _grow=true)"
+.br
+.RI "\fIConstructor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIMy class name. \fP"
+.ti -1c
+.RI "void \fBoperator()\fP (\fBEoType\fP &_tree)"
+.br
+.RI "\fIinitialize a tree \fP"
+.in -1c
+.SS "Private Member Functions"
+
+.in +1c
+.ti -1c
+.RI "bool \fBgenerate\fP (std::list< Node > &sequence, int the_max, int request_type)"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBmax_depth\fP"
+.br
+.ti -1c
+.RI "map< int, map< int, std::vector< Node > > > \fBnode\fP"
+.br
+.ti -1c
+.RI "int \fBreturn_type\fP"
+.br
+.ti -1c
+.RI "bool \fBgrow\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoStParseTreeDepthInit< FType, Node >"
+eoStParseTreeDepthInit : the initializer class for strongly typed tree-based genetic programming 
+.PP
+Definition at line 61 of file eoStParseTreeDepthInit.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoStParseTreeDepthInit\fP< FType, Node >::\fBeoStParseTreeDepthInit\fP (unsigned _max_depth, const std::vector< Node > & _node, const int & _return_type, bool _grow = \fCtrue\fP)\fC [inline]\fP"
+.PP
+Constructor. 
+.PP
+_max_depth The maximum depth of a tree 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_initializor\fP A std::vector containing the possible nodes 
+.br
+\fI_grow\fP False results in a full tree, True result is a randomly grown tree 
+.RE
+.PP
+
+.PP
+Definition at line 73 of file eoStParseTreeDepthInit.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template void \fBeoStParseTreeDepthInit\fP< FType, Node >::operator() (\fBEoType\fP & _tree)\fC [inline]\fP"
+.PP
+initialize a tree 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_tree\fP : the tree to be initialized 
+.RE
+.PP
+
+.PP
+Definition at line 125 of file eoStParseTreeDepthInit.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoStPointMutation.3 b/trunk/paradiseo-eo/doc/man/man3/eoStPointMutation.3
new file mode 100644
index 000000000..aec6c102a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoStPointMutation.3
@@ -0,0 +1,89 @@
+.TH "eoStPointMutation" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoStPointMutation \- eoStPointMutation --> replace a Node with a Node of the same arity and type  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< eoParseTree< FType, Node > >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef \fBeoParseTree\fP< FType, Node > \fBEoType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoStPointMutation\fP (std::vector< Node > &_node)"
+.br
+.RI "\fIConstructor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIthe class name \fP"
+.ti -1c
+.RI "virtual \fB~eoStPointMutation\fP ()"
+.br
+.RI "\fIDtor. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEoType\fP &_eo1)"
+.br
+.RI "\fIMutate an individual. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "map< int, map< int, std::vector< Node > > > \fBnode\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoStPointMutation< FType, Node >"
+eoStPointMutation --> replace a Node with a Node of the same arity and type 
+.PP
+Definition at line 195 of file eoStParseTreeOp.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoStPointMutation\fP< FType, Node >::\fBeoStPointMutation\fP (std::vector< Node > & _node)\fC [inline]\fP"
+.PP
+Constructor. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_initializor\fP The std::vector of Nodes given to the eoGpDepthInitializer 
+.RE
+.PP
+
+.PP
+Definition at line 205 of file eoStParseTreeOp.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template bool \fBeoStPointMutation\fP< FType, Node >::operator() (\fBEoType\fP & _eo1)\fC [inline]\fP"
+.PP
+Mutate an individual. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_eo1\fP The individual that is to be changed 
+.RE
+.PP
+
+.PP
+Definition at line 234 of file eoStParseTreeOp.h.
+.PP
+References eoRng::random().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoStSubtreeXOver.3 b/trunk/paradiseo-eo/doc/man/man3/eoStSubtreeXOver.3
new file mode 100644
index 000000000..f0ef6ab65
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoStSubtreeXOver.3
@@ -0,0 +1,73 @@
+.TH "eoStSubtreeXOver" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoStSubtreeXOver \- eoStSubtreeXOver --> subtree xover for strongly typed tree-based genetic programming  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoQuadOp< eoParseTree< FType, Node > >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef \fBeoParseTree\fP< FType, Node > \fBEoType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoStSubtreeXOver\fP (unsigned _max_length)"
+.br
+.RI "\fIConstructor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIthe ckassname \fP"
+.ti -1c
+.RI "virtual \fB~eoStSubtreeXOver\fP ()"
+.br
+.RI "\fIDtor. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEoType\fP &_eo1, \fBEoType\fP &_eo2)"
+.br
+.RI "\fIPerform crossover on two individuals param _eo1 The first parent individual param _eo2 The second parent individual. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBmax_length\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoStSubtreeXOver< FType, Node >"
+eoStSubtreeXOver --> subtree xover for strongly typed tree-based genetic programming 
+.PP
+Definition at line 56 of file eoStParseTreeOp.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoStSubtreeXOver\fP< FType, Node >::\fBeoStSubtreeXOver\fP (unsigned _max_length)\fC [inline]\fP"
+.PP
+Constructor. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_max_length\fP the maximum size of an individual 
+.RE
+.PP
+
+.PP
+Definition at line 64 of file eoStParseTreeOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoStat.3 b/trunk/paradiseo-eo/doc/man/man3/eoStat.3
new file mode 100644
index 000000000..30bcce04c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoStat.3
@@ -0,0 +1,35 @@
+.TH "eoStat" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoStat \- The actual class that will be used as base for all statistics that need to be calculated over the (unsorted) population It is an \fBeoStatBase\fP AND an \fBeoValueParam\fP so it can be used in Monitors.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoValueParam< T >\fP, and \fBeoStatBase< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoStat\fP (T _value, std::string _description)"
+.br
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoStat< EOT, T >"
+The actual class that will be used as base for all statistics that need to be calculated over the (unsorted) population It is an \fBeoStatBase\fP AND an \fBeoValueParam\fP so it can be used in Monitors. 
+.PP
+Definition at line 58 of file eoStat.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoStatBase.3 b/trunk/paradiseo-eo/doc/man/man3/eoStatBase.3
new file mode 100644
index 000000000..cf9a79480
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoStatBase.3
@@ -0,0 +1,39 @@
+.TH "eoStatBase" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoStatBase \- Base class for all statistics that need to be calculated over the (unsorted) population (I guess it is not really necessary? MS.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoUF< const eoPop< EOT > &, void >\fP.
+.PP
+Inherited by \fBeoStat< EOT, T >\fP, \fBeoStat< EOT, double >\fP, \fBeoStat< EOT, EOT::Fitness >\fP, \fBeoStat< EOT, std::pair< double, double > >\fP, and \fBeoStat< EOT, std::string >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual void \fBlastCall\fP (const \fBeoPop\fP< \fBEOT\fP > &)"
+.br
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoStatBase< EOT >"
+Base class for all statistics that need to be calculated over the (unsorted) population (I guess it is not really necessary? MS. 
+
+Depstd::ends, there might be reasons to have a stat that is not an \fBeoValueParam\fP, but maybe I'm just kidding myself, MK) 
+.PP
+Definition at line 45 of file eoStat.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoState.3 b/trunk/paradiseo-eo/doc/man/man3/eoState.3
new file mode 100644
index 000000000..886f957c3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoState.3
@@ -0,0 +1,154 @@
+.TH "eoState" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoState \- eoState can be used to register derivants of \fBeoPersistent\fP.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoFunctorStore\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "void \fBregisterObject\fP (\fBeoPersistent\fP ®istrant)"
+.br
+.RI "\fIObject registration function, note that it does not take ownership! \fP"
+.ti -1c
+.RI "template T & \fBtakeOwnership\fP (const T &persistent)"
+.br
+.RI "\fICopies the object (MUST be derived from \fBeoPersistent\fP) and returns a reference to the owned object. \fP"
+.ti -1c
+.RI "std::string \fBgetCommentString\fP (void) const "
+.br
+.ti -1c
+.RI "void \fBload\fP (const std::string &_filename)"
+.br
+.RI "\fIReads the file specified. \fP"
+.ti -1c
+.RI "void \fBload\fP (std::istream &is)"
+.br
+.RI "\fIReads the file specified. \fP"
+.ti -1c
+.RI "void \fBsave\fP (const std::string &_filename) const "
+.br
+.RI "\fISaves the state in file specified. \fP"
+.ti -1c
+.RI "void \fBsave\fP (std::ostream &os) const "
+.br
+.RI "\fISaves the state in file specified. \fP"
+.in -1c
+.SS "Private Types"
+
+.in +1c
+.ti -1c
+.RI "typedef std::map< std::string, \fBeoPersistent\fP * > \fBObjectMap\fP"
+.br
+.in -1c
+.SS "Private Member Functions"
+
+.in +1c
+.ti -1c
+.RI "std::string \fBcreateObjectName\fP (\fBeoObject\fP *obj)"
+.br
+.ti -1c
+.RI "\fBeoState\fP (const \fBeoState\fP &)"
+.br
+.ti -1c
+.RI "\fBeoState\fP & \fBoperator=\fP (const \fBeoState\fP &)"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "ObjectMap \fBobjectMap\fP"
+.br
+.ti -1c
+.RI "std::vector< ObjectMap::iterator > \fBcreationOrder\fP"
+.br
+.ti -1c
+.RI "std::vector< \fBeoPersistent\fP * > \fBownedObjects\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+eoState can be used to register derivants of \fBeoPersistent\fP. 
+
+It will then in turn implement the persistence framework through members load and save, that will call readFrom and printOn for the registrated objects.
+.PP
+It is derived from \fBeoFunctorStore\fP, so that it also serves as a place where all those nifty eo functors can be stored. This is useful in the case you want to use one of the make_* functions. These functions generally take as their last argument an \fBeoFunctorStore\fP (or a state) which is used to hold all dynamically generated data. Note however, that unlike with \fBeoPersistent\fP derived classes, \fBeoFunctorBase\fP derived classes are not saved or loaded. To govern the creation of functors, command-line parameters (which can be stored) are needed. 
+.PP
+Definition at line 54 of file eoState.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template T& eoState::takeOwnership (const T & persistent)\fC [inline]\fP"
+.PP
+Copies the object (MUST be derived from \fBeoPersistent\fP) and returns a reference to the owned object. 
+.PP
+Note: it does not register the object, this must be done afterwards! 
+.PP
+Definition at line 73 of file eoState.h.
+.SS "void eoState::load (const std::string & _filename)"
+.PP
+Reads the file specified. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_filename\fP the name of the file to load from 
+.RE
+.PP
+
+.PP
+Definition at line 74 of file eoState.cpp.
+.SS "void eoState::load (std::istream & is)"
+.PP
+Reads the file specified. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIis\fP the stream to load from 
+.RE
+.PP
+
+.PP
+Definition at line 87 of file eoState.cpp.
+.PP
+References eoPersistent::readFrom().
+.SS "void eoState::save (const std::string & _filename) const"
+.PP
+Saves the state in file specified. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_filename\fP the name of the file to save into 
+.RE
+.PP
+
+.PP
+Definition at line 148 of file eoState.cpp.
+.PP
+Referenced by eoTimedStateSaver::operator()().
+.SS "void eoState::save (std::ostream & os) const"
+.PP
+Saves the state in file specified. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIos\fP the stream to save into 
+.RE
+.PP
+
+.PP
+Definition at line 161 of file eoState.cpp.
+.PP
+References eoPrintable::printOn().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoState_loading_error.3 b/trunk/paradiseo-eo/doc/man/man3/eoState_loading_error.3
new file mode 100644
index 000000000..79b3c8c66
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoState_loading_error.3
@@ -0,0 +1,28 @@
+.TH "eoState::loading_error" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoState::loading_error \- Loading error thrown when nothing seems to work.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBloading_error\fP (std::string huh='Error while loading')"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+Loading error thrown when nothing seems to work. 
+.PP
+Definition at line 83 of file eoState.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoStdoutMonitor.3 b/trunk/paradiseo-eo/doc/man/man3/eoStdoutMonitor.3
new file mode 100644
index 000000000..dfc377566
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoStdoutMonitor.3
@@ -0,0 +1,50 @@
+.TH "eoStdoutMonitor" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoStdoutMonitor \- Prints statistics to stdout.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonitor\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoStdoutMonitor\fP (bool _verbose=true, std::string _delim='\\t')"
+.br
+.ti -1c
+.RI "\fBeoMonitor\fP & \fBoperator()\fP (void)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "bool \fBverbose\fP"
+.br
+.ti -1c
+.RI "std::string \fBdelim\fP"
+.br
+.ti -1c
+.RI "bool \fBfirsttime\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+Prints statistics to stdout. 
+.PP
+Definition at line 38 of file eoStdoutMonitor.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSteadyFitContinue.3 b/trunk/paradiseo-eo/doc/man/man3/eoSteadyFitContinue.3
new file mode 100644
index 000000000..341aaf441
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSteadyFitContinue.3
@@ -0,0 +1,102 @@
+.TH "eoSteadyFitContinue" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSteadyFitContinue \- A continuator: does a minimum number of generations, then stops whenever a given number of generations takes place without improvement.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoContinue< EOT >< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::Fitness \fBFitness\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSteadyFitContinue\fP (unsigned long _minGens, unsigned long _steadyGens)"
+.br
+.RI "\fICtor for setting a. \fP"
+.ti -1c
+.RI "\fBeoSteadyFitContinue\fP (unsigned long _minGens, unsigned long _steadyGen, unsigned long &_currentGen)"
+.br
+.RI "\fICtor for enabling the save/load the no. of generations counted. \fP"
+.ti -1c
+.RI "virtual bool \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_vEO)"
+.br
+.RI "\fIReturns false when a certain number of generations is reached withtout improvement. \fP"
+.ti -1c
+.RI "virtual void \fBtotalGenerations\fP (unsigned long _mg, unsigned long _sg)"
+.br
+.RI "\fISets the parameters (minimum nb of gen. \fP"
+.ti -1c
+.RI "virtual void \fBreset\fP ()"
+.br
+.RI "\fIResets the state after it's been reached. \fP"
+.ti -1c
+.RI "virtual unsigned long \fBminGenerations\fP ()"
+.br
+.RI "\fIaccessors \fP"
+.ti -1c
+.RI "virtual unsigned long \fBsteadyGenerations\fP ()"
+.br
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned long \fBrepMinGenerations\fP"
+.br
+.ti -1c
+.RI "unsigned long \fBrepSteadyGenerations\fP"
+.br
+.ti -1c
+.RI "bool \fBsteadyState\fP"
+.br
+.ti -1c
+.RI "unsigned long \fBthisGenerationPlaceHolder\fP"
+.br
+.ti -1c
+.RI "unsigned long & \fBthisGeneration\fP"
+.br
+.ti -1c
+.RI "unsigned int \fBlastImprovement\fP"
+.br
+.ti -1c
+.RI "Fitness \fBbestSoFar\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSteadyFitContinue< EOT >"
+A continuator: does a minimum number of generations, then stops whenever a given number of generations takes place without improvement. 
+.PP
+Definition at line 35 of file eoSteadyFitContinue.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template virtual void \fBeoSteadyFitContinue\fP< \fBEOT\fP >::totalGenerations (unsigned long _mg, unsigned long _sg)\fC [inline, virtual]\fP"
+.PP
+Sets the parameters (minimum nb of gen. 
+.PP
++ steady nb of gen.) and sets the current generation to 0 (the begin) 
+.PP
+Definition at line 84 of file eoSteadyFitContinue.h.
+.PP
+References eoSteadyFitContinue< EOT >::reset().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoStochTournamentSelect.3 b/trunk/paradiseo-eo/doc/man/man3/eoStochTournamentSelect.3
new file mode 100644
index 000000000..94d3a3e69
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoStochTournamentSelect.3
@@ -0,0 +1,43 @@
+.TH "eoStochTournamentSelect" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoStochTournamentSelect \- eoStochTournamentSelect: a selection method that selects ONE individual by binary stochastic tournament -MS- 24/10/99  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoSelectOne< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoStochTournamentSelect\fP (double _Trate=1.0)"
+.br
+.ti -1c
+.RI "virtual const \fBEOT\fP & \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &pop)"
+.br
+.RI "\fIPerform the stochastic tournament. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBTrate\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoStochTournamentSelect< EOT >"
+eoStochTournamentSelect: a selection method that selects ONE individual by binary stochastic tournament -MS- 24/10/99 
+.PP
+Definition at line 42 of file eoStochTournamentSelect.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoStochTournamentTruncate.3 b/trunk/paradiseo-eo/doc/man/man3/eoStochTournamentTruncate.3
new file mode 100644
index 000000000..25b428f38
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoStochTournamentTruncate.3
@@ -0,0 +1,45 @@
+.TH "eoStochTournamentTruncate" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoStochTournamentTruncate \- a truncate class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoReduce< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoStochTournamentTruncate\fP (double _t_rate)"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_newgen, unsigned _newsize)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBt_rate\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoStochTournamentTruncate< EOT >"
+a truncate class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g. 
+
+see \fBeoSSGAStochTournamentReplacement\fP) 
+.PP
+Definition at line 236 of file eoReduce.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoStochTournamentTruncateSplit.3 b/trunk/paradiseo-eo/doc/man/man3/eoStochTournamentTruncateSplit.3
new file mode 100644
index 000000000..f803be7e3
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoStochTournamentTruncateSplit.3
@@ -0,0 +1,52 @@
+.TH "eoStochTournamentTruncateSplit" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoStochTournamentTruncateSplit \- a ReduceSplit class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoReduce< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoStochTournamentTruncateSplit\fP (double _t_rate, \fBeoHowMany\fP _howMany, bool _returnEliminated=false)"
+.br
+.RI "\fICtor: must provide amount of reduction, and whether or not you need to return the eliminated guys. \fP"
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_newgen, \fBeoPop\fP< \fBEOT\fP > &_eliminated)"
+.br
+.RI "\fIPerforms repeated inverse_stochastic_tournament on the pop. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBt_rate\fP"
+.br
+.ti -1c
+.RI "\fBeoHowMany\fP \fBhowMany\fP"
+.br
+.ti -1c
+.RI "bool \fBreturnEliminated\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoStochTournamentTruncateSplit< EOT >"
+a ReduceSplit class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g. 
+
+see \fBeoSSGAStochTournamentReplacement\fP) 
+.PP
+Definition at line 256 of file eoReduceSplit.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoStochTournamentWorthSelect.3 b/trunk/paradiseo-eo/doc/man/man3/eoStochTournamentWorthSelect.3
new file mode 100644
index 000000000..b154f1553
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoStochTournamentWorthSelect.3
@@ -0,0 +1,52 @@
+.TH "eoStochTournamentWorthSelect" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoStochTournamentWorthSelect \- An instance of eoSelectPerf2Worth that does selection from the Worthes using a ...  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoSelectFromWorth< EOT, WorthT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef std::vector< WorthT >::iterator \fBworthIterator\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoStochTournamentWorthSelect\fP (\fBeoPerf2Worth\fP< \fBEOT\fP, WorthT > &_perf2Worth, double _tRate)"
+.br
+.ti -1c
+.RI "virtual const \fBEOT\fP & \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBtRate\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoStochTournamentWorthSelect< EOT, WorthT >"
+An instance of eoSelectPerf2Worth that does selection from the Worthes using a ... 
+
+stochastic tournament, yes! 
+.PP
+Definition at line 128 of file eoSelectFromWorth.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoStochasticUniversalSelect.3 b/trunk/paradiseo-eo/doc/man/man3/eoStochasticUniversalSelect.3
new file mode 100644
index 000000000..172eb73a8
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoStochasticUniversalSelect.3
@@ -0,0 +1,55 @@
+.TH "eoStochasticUniversalSelect" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoStochasticUniversalSelect \- eoStochasticUniversalSelect: select an individual proportional to her stored fitness value, but in contrast with eoStochasticUniversalSelect, get rid of most finite sampling effects by doing all selections in one go, using a single random number.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoSelectOne< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoStochasticUniversalSelect\fP (const \fBeoPop\fP< \fBEOT\fP > &pop=\fBeoPop\fP< \fBEOT\fP >())"
+.br
+.RI "\fISanity check. \fP"
+.ti -1c
+.RI "void \fBsetup\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIvirtual function to setup some population stats (for instance eoProportional can benefit greatly from this) \fP"
+.ti -1c
+.RI "const \fBEOT\fP & \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIdo the selection, \fP"
+.in -1c
+.SS "Private Types"
+
+.in +1c
+.ti -1c
+.RI "typedef std::vector< unsigned > \fBIndexVec\fP"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "IndexVec \fBindices\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoStochasticUniversalSelect< EOT >"
+eoStochasticUniversalSelect: select an individual proportional to her stored fitness value, but in contrast with eoStochasticUniversalSelect, get rid of most finite sampling effects by doing all selections in one go, using a single random number. 
+.PP
+Definition at line 44 of file eoStochasticUniversalSelect.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoString.3 b/trunk/paradiseo-eo/doc/man/man3/eoString.3
new file mode 100644
index 000000000..3453d77aa
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoString.3
@@ -0,0 +1,85 @@
+.TH "eoString" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoString \- Adaptor that turns an STL std::string into an \fBEO\fP.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBEO< fitnessT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef char \fBType\fP"
+.br
+.ti -1c
+.RI "typedef char \fBAtomType\fP"
+.br
+.ti -1c
+.RI "typedef std::string \fBContainerType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.PP
+.RI "\fB\fP"
+.br
+
+.in +1c
+.in +1c
+.ti -1c
+.RI "\fBeoString\fP (const std::string &_str='')"
+.br
+.RI "\fIctor \fP"
+.ti -1c
+.RI "virtual void \fBprintOn\fP (std::ostream &os) const "
+.br
+.RI "\fIprinting... \fP"
+.in -1c
+.in -1c
+.PP
+.RI "\fBMethods from eoObject\fP"
+.br
+readFrom and printOn are directly inherited from eo1d 
+.PP
+.in +1c
+.in +1c
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIInherited from \fBeoObject\fP. \fP"
+.in -1c
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoString< fitnessT >"
+Adaptor that turns an STL std::string into an \fBEO\fP. 
+.PP
+Definition at line 42 of file eoString.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template virtual std::string \fBeoString\fP< fitnessT >::className (void) const\fC [inline, virtual]\fP"
+.PP
+Inherited from \fBeoObject\fP. 
+.PP
+\fBSee also:\fP
+.RS 4
+\fBeoObject\fP 
+.RE
+.PP
+
+.PP
+Reimplemented from \fBEO< fitnessT >\fP.
+.PP
+Definition at line 74 of file eoString.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSubtreeXOver.3 b/trunk/paradiseo-eo/doc/man/man3/eoSubtreeXOver.3
new file mode 100644
index 000000000..26050a3d8
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSubtreeXOver.3
@@ -0,0 +1,73 @@
+.TH "eoSubtreeXOver" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSubtreeXOver \- eoSubtreeXOver --> subtree xover  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoQuadOp< eoParseTree< FType, Node > >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef \fBeoParseTree\fP< FType, Node > \fBEoType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSubtreeXOver\fP (unsigned _max_length)"
+.br
+.RI "\fIConstructor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIthe ckassname \fP"
+.ti -1c
+.RI "virtual \fB~eoSubtreeXOver\fP ()"
+.br
+.RI "\fIDtor. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEoType\fP &_eo1, \fBEoType\fP &_eo2)"
+.br
+.RI "\fIPerform crossover on two individuals param _eo1 The first parent individual param _eo2 The second parent individual. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBmax_length\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSubtreeXOver< FType, Node >"
+eoSubtreeXOver --> subtree xover 
+.PP
+Definition at line 42 of file eoParseTreeOp.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoSubtreeXOver\fP< FType, Node >::\fBeoSubtreeXOver\fP (unsigned _max_length)\fC [inline]\fP"
+.PP
+Constructor. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_max_length\fP the maximum size of an individual 
+.RE
+.PP
+
+.PP
+Definition at line 50 of file eoParseTreeOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSurviveAndDie.3 b/trunk/paradiseo-eo/doc/man/man3/eoSurviveAndDie.3
new file mode 100644
index 000000000..784317014
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSurviveAndDie.3
@@ -0,0 +1,44 @@
+.TH "eoSurviveAndDie" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSurviveAndDie \- eoSurviveAndDie A pure abstract class, to store the howmany's  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoBF< eoPop< EOT > &, eoPop< EOT > &, void >\fP.
+.PP
+Inherited by \fBeoDeterministicSurviveAndDie< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSurviveAndDie\fP (double _survive, double _die, bool _interpret_as_rate=true)"
+.br
+.in -1c
+.SS "Protected Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoHowMany\fP \fBhowmanySurvive\fP"
+.br
+.ti -1c
+.RI "\fBeoHowMany\fP \fBhowmanyDie\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSurviveAndDie< EOT >"
+eoSurviveAndDie A pure abstract class, to store the howmany's 
+.PP
+Definition at line 53 of file eoSurviveAndDie.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoSymInit.3 b/trunk/paradiseo-eo/doc/man/man3/eoSymInit.3
new file mode 100644
index 000000000..258957182
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoSymInit.3
@@ -0,0 +1,60 @@
+.TH "eoSymInit" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoSymInit \- Default initializer, Koza style.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoInit< EoType >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSymInit\fP (TreeBuilder &_builder)"
+.br
+.RI "\fIBy default build ramped half and half with max depth 6. \fP"
+.ti -1c
+.RI "\fBeoSymInit\fP (TreeBuilder &_builder, double &_grow_prob, unsigned &_max_depth)"
+.br
+.RI "\fIControl the grow_prob and max_depth externally. \fP"
+.ti -1c
+.RI "void \fBoperator()\fP (\fBEoType\fP &tree)"
+.br
+.RI "\fIbuild the tree \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "TreeBuilder & \fBbuilder\fP"
+.br
+.ti -1c
+.RI "double \fBown_grow_prob\fP"
+.br
+.ti -1c
+.RI "unsigned \fBown_max_depth\fP"
+.br
+.ti -1c
+.RI "double & \fBgrow_prob\fP"
+.br
+.ti -1c
+.RI "unsigned & \fBmax_depth\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoSymInit< EoType >"
+Default initializer, Koza style. 
+.PP
+Definition at line 26 of file eoSymInit.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoTimeCounter.3 b/trunk/paradiseo-eo/doc/man/man3/eoTimeCounter.3
new file mode 100644
index 000000000..9a02e02b4
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoTimeCounter.3
@@ -0,0 +1,38 @@
+.TH "eoTimeCounter" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoTimeCounter \- An \fBeoStat\fP that simply gives the user time since first generation It has to be tempatized by EOT because it must be an \fBeoStat\fP.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoUpdater\fP, and \fBeoValueParam< double >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual void \fBoperator()\fP ()"
+.br
+.RI "\fIsimply stores the time spent in process in its \fBvalue()\fP \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "clock_t \fButime\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+An \fBeoStat\fP that simply gives the user time since first generation It has to be tempatized by EOT because it must be an \fBeoStat\fP. 
+.PP
+Definition at line 38 of file eoTimeCounter.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoTimeVaryingLoopEval.3 b/trunk/paradiseo-eo/doc/man/man3/eoTimeVaryingLoopEval.3
new file mode 100644
index 000000000..d23e62b41
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoTimeVaryingLoopEval.3
@@ -0,0 +1,44 @@
+.TH "eoTimeVaryingLoopEval" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoTimeVaryingLoopEval \- \fBeoPopLoopEval\fP: an instance of \fBeoPopEvalFunc\fP that simply applies a private \fBeoEvalFunc\fP to all offspring AND ALL PARENTS as the fitness is supposed here to vary  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoPopEvalFunc< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoTimeVaryingLoopEval\fP (\fBeoEvalFunc\fP< \fBEOT\fP > &_eval)"
+.br
+.RI "\fICtor: set value of embedded \fBeoEvalFunc\fP. \fP"
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_parents, \fBeoPop\fP< \fBEOT\fP > &_offspring)"
+.br
+.RI "\fIDo the job: simple loop over the offspring. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoEvalFunc\fP< \fBEOT\fP > & \fBeval\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoTimeVaryingLoopEval< EOT >"
+\fBeoPopLoopEval\fP: an instance of \fBeoPopEvalFunc\fP that simply applies a private \fBeoEvalFunc\fP to all offspring AND ALL PARENTS as the fitness is supposed here to vary 
+.PP
+Definition at line 84 of file eoPopEvalFunc.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoTimedDynUpdate.3 b/trunk/paradiseo-eo/doc/man/man3/eoTimedDynUpdate.3
new file mode 100644
index 000000000..51471c88d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoTimedDynUpdate.3
@@ -0,0 +1,47 @@
+.TH "eoTimedDynUpdate" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoTimedDynUpdate \- An \fBeoUpdater\fP to update an \fBeoUpdatable\fP object every given time interval.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoDynUpdater\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoTimedDynUpdate\fP (\fBeoUpdatable\fP &_toUpdate, time_t _interval)"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (void)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "const time_t \fBinterval\fP"
+.br
+.ti -1c
+.RI "time_t \fBlast_time\fP"
+.br
+.ti -1c
+.RI "const time_t \fBfirst_time\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+An \fBeoUpdater\fP to update an \fBeoUpdatable\fP object every given time interval. 
+.PP
+Definition at line 67 of file eoUpdatable.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoTimedMonitor.3 b/trunk/paradiseo-eo/doc/man/man3/eoTimedMonitor.3
new file mode 100644
index 000000000..aa72f041f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoTimedMonitor.3
@@ -0,0 +1,53 @@
+.TH "eoTimedMonitor" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoTimedMonitor \- Holds a collection of monitors and only fires them when a time limit has been reached.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonitor\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoTimedMonitor\fP (int seconds_)"
+.br
+.ti -1c
+.RI "\fBeoMonitor\fP & \fBoperator()\fP (void)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.ti -1c
+.RI "void \fBadd\fP (\fBeoMonitor\fP &mon)"
+.br
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "clock_t \fBlast_tick\fP"
+.br
+.ti -1c
+.RI "int \fBseconds\fP"
+.br
+.ti -1c
+.RI "std::vector< \fBeoMonitor\fP * > \fBmonitors\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+Holds a collection of monitors and only fires them when a time limit has been reached. 
+.PP
+Definition at line 40 of file eoTimedMonitor.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoTimedStateSaver.3 b/trunk/paradiseo-eo/doc/man/man3/eoTimedStateSaver.3
new file mode 100644
index 000000000..f9561a5a2
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoTimedStateSaver.3
@@ -0,0 +1,59 @@
+.TH "eoTimedStateSaver" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoTimedStateSaver \- an \fBeoUpdater\fP that saves a state every given time interval  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoUpdater\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoTimedStateSaver\fP (time_t _interval, const \fBeoState\fP &_state, std::string _prefix='state', std::string _extension='sav')"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (void)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "const \fBeoState\fP & \fBstate\fP"
+.br
+.ti -1c
+.RI "const time_t \fBinterval\fP"
+.br
+.ti -1c
+.RI "time_t \fBlast_time\fP"
+.br
+.ti -1c
+.RI "const time_t \fBfirst_time\fP"
+.br
+.ti -1c
+.RI "const std::string \fBprefix\fP"
+.br
+.ti -1c
+.RI "const std::string \fBextension\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+an \fBeoUpdater\fP that saves a state every given time interval 
+.PP
+Definition at line 104 of file eoUpdater.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoTransform.3 b/trunk/paradiseo-eo/doc/man/man3/eoTransform.3
new file mode 100644
index 000000000..6a97896e0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoTransform.3
@@ -0,0 +1,27 @@
+.TH "eoTransform" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoTransform \- eoTransform transforms a population by applying genetic operators on it.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoUF< eoPop< EOT > &, void >\fP.
+.PP
+Inherited by \fBeoDynSGATransform< EOT >\fP, eoEasyEA< EOT >::eoDummyTransform, and \fBeoSGATransform< EOT >\fP.
+.PP
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoTransform< EOT >"
+eoTransform transforms a population by applying genetic operators on it. 
+.PP
+Definition at line 38 of file eoTransform.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoTruncSelect.3 b/trunk/paradiseo-eo/doc/man/man3/eoTruncSelect.3
new file mode 100644
index 000000000..329397abf
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoTruncSelect.3
@@ -0,0 +1,69 @@
+.TH "eoTruncSelect" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoTruncSelect \- eoTruncSelect selects individuals after truncating the population using \fBeoSelectOne\fP as it's mechanism.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoSelect< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoTruncSelect\fP (\fBeoSelectOne\fP< \fBEOT\fP > &_select, \fBeoHowMany\fP _howMany)"
+.br
+.RI "\fICtor: from an \fBeoSelect\fP (and an eoMany to tell how many are kept for selectino. \fP"
+.ti -1c
+.RI "virtual void \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_source, \fBeoPop\fP< \fBEOT\fP > &_dest)"
+.br
+.RI "\fIThe implementation repeatidly selects an individual. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSelectOne\fP< \fBEOT\fP > & \fBselect\fP"
+.br
+.ti -1c
+.RI "\fBeoHowMany\fP \fBhowMany\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoTruncSelect< EOT >"
+eoTruncSelect selects individuals after truncating the population using \fBeoSelectOne\fP as it's mechanism. 
+
+Therefore \fBeoSelectMany\fP needs an \fBeoSelectOne\fP in its ctor It will use an eoHowMnay to determine the number of guys to keep, 
+.PP
+Definition at line 43 of file eoTruncSelect.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template virtual void \fBeoTruncSelect\fP< \fBEOT\fP >::operator() (const \fBeoPop\fP< \fBEOT\fP > & _source, \fBeoPop\fP< \fBEOT\fP > & _dest)\fC [inline, virtual]\fP"
+.PP
+The implementation repeatidly selects an individual. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_source\fP the source population 
+.br
+\fI_dest\fP the resulting population (size of this population is the number of times \fBeoSelectOne\fP is called. It empties the destination and adds the selection into it) 
+.RE
+.PP
+
+.PP
+Implements \fBeoBF< const eoPop< EOT > &, eoPop< EOT > &, void >\fP.
+.PP
+Definition at line 56 of file eoTruncSelect.h.
+.PP
+References eoSelectOne< EOT, WorthT >::setup().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoTruncate.3 b/trunk/paradiseo-eo/doc/man/man3/eoTruncate.3
new file mode 100644
index 000000000..d5fb341c2
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoTruncate.3
@@ -0,0 +1,33 @@
+.TH "eoTruncate" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoTruncate \- truncation method using sort  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoReduce< EOT >< EOT >\fP.
+.PP
+.SS "Private Member Functions"
+
+.in +1c
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_newgen, unsigned _newsize)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoTruncate< EOT >"
+truncation method using sort 
+.PP
+Definition at line 49 of file eoReduce.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoTruncateSplit.3 b/trunk/paradiseo-eo/doc/man/man3/eoTruncateSplit.3
new file mode 100644
index 000000000..eb0d25c2c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoTruncateSplit.3
@@ -0,0 +1,47 @@
+.TH "eoTruncateSplit" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoTruncateSplit \- deterministic truncation method using sort  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoReduceSplit< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoTruncateSplit\fP (\fBeoHowMany\fP _howMany, bool _returnEliminated=false)"
+.br
+.RI "\fICtor: must provide amount of reduction, and whether or not you need to return the eliminated guys. \fP"
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_newgen, \fBeoPop\fP< \fBEOT\fP > &_eliminated)"
+.br
+.RI "\fIdo the jonb \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoHowMany\fP \fBhowMany\fP"
+.br
+.ti -1c
+.RI "bool \fBreturnEliminated\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoTruncateSplit< EOT >"
+deterministic truncation method using sort 
+.PP
+Definition at line 47 of file eoReduceSplit.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoTruncatedSelectMany.3 b/trunk/paradiseo-eo/doc/man/man3/eoTruncatedSelectMany.3
new file mode 100644
index 000000000..edf573b1b
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoTruncatedSelectMany.3
@@ -0,0 +1,83 @@
+.TH "eoTruncatedSelectMany" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoTruncatedSelectMany \- eoTruncatedSelectMany selects many individuals using \fBeoSelectOne\fP as it's mechanism.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoSelect< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoTruncatedSelectMany\fP (\fBeoSelectOne\fP< \fBEOT\fP > &_select, double _rateGenitors, double _rateFertile, bool _interpret_as_rateG=true, bool _interpret_as_rateF=true)"
+.br
+.RI "\fICtor. \fP"
+.ti -1c
+.RI "\fBeoTruncatedSelectMany\fP (\fBeoSelectOne\fP< \fBEOT\fP > &_select, \fBeoHowMany\fP _howManyGenitors, \fBeoHowMany\fP _howManyFertile)"
+.br
+.ti -1c
+.RI "virtual void \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_source, \fBeoPop\fP< \fBEOT\fP > &_dest)"
+.br
+.RI "\fIThe implementation repeatidly selects an individual. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSelectOne\fP< \fBEOT\fP > & \fBselect\fP"
+.br
+.ti -1c
+.RI "\fBeoHowMany\fP \fBhowManyGenitors\fP"
+.br
+.ti -1c
+.RI "\fBeoHowMany\fP \fBhowManyFertile\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoTruncatedSelectMany< EOT >"
+eoTruncatedSelectMany selects many individuals using \fBeoSelectOne\fP as it's mechanism. 
+
+Therefore \fBeoSelectMany\fP needs an \fBeoSelectOne\fP in its ctor
+.PP
+It will use an eoHowMnay to determine the number of guys to select, and push them to the back of the destination population.
+.PP
+And it will only perform selection from the top guys in the population.
+.PP
+It is NOT a special case of \fBeoSelectMany\fP because it needs to SORT the population to discard the worst guys before doing the selection
+.PP
+However, the same result can be obtained by embedding an \fBeoTruncatedSelectOne\fP into an \fBeoSelectMany\fP ... 
+.PP
+Definition at line 53 of file eoTruncatedSelectMany.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template virtual void \fBeoTruncatedSelectMany\fP< \fBEOT\fP >::operator() (const \fBeoPop\fP< \fBEOT\fP > & _source, \fBeoPop\fP< \fBEOT\fP > & _dest)\fC [inline, virtual]\fP"
+.PP
+The implementation repeatidly selects an individual. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_source\fP the source population 
+.br
+\fI_dest\fP the resulting population (size of this population is the number of times \fBeoSelectOne\fP is called. It empties the destination and adds the selection into it) 
+.RE
+.PP
+
+.PP
+Implements \fBeoBF< const eoPop< EOT > &, eoPop< EOT > &, void >\fP.
+.PP
+Definition at line 77 of file eoTruncatedSelectMany.h.
+.PP
+References eoSelectOne< EOT, WorthT >::setup(), eoPop< EOT >::shuffle(), and eoPop< EOT >::sort().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoTruncatedSelectOne.3 b/trunk/paradiseo-eo/doc/man/man3/eoTruncatedSelectOne.3
new file mode 100644
index 000000000..edbc19558
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoTruncatedSelectOne.3
@@ -0,0 +1,83 @@
+.TH "eoTruncatedSelectOne" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoTruncatedSelectOne \- eoTruncatedSelectOne selects one individual using \fBeoSelectOne\fP as it's mechanism.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoSelectOne< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoTruncatedSelectOne\fP (\fBeoSelectOne\fP< \fBEOT\fP > &_select, double _rateFertile, bool _interpret_as_rateF=true)"
+.br
+.RI "\fICtor from rate and bool. \fP"
+.ti -1c
+.RI "\fBeoTruncatedSelectOne\fP (\fBeoSelectOne\fP< \fBEOT\fP > &_select, \fBeoHowMany\fP _howManyFertile)"
+.br
+.RI "\fICtor with \fBeoHowMany\fP. \fP"
+.ti -1c
+.RI "void \fBsetup\fP (const \fBeoPop\fP< \fBEOT\fP > &_source)"
+.br
+.RI "\fIsetup procedures: fills the temporary population with the fertile guys \fP"
+.ti -1c
+.RI "const \fBEOT\fP & \fBoperator()\fP (const \fBeoPop\fP< \fBEOT\fP > &_pop)"
+.br
+.RI "\fIThe implementation selects an individual from the fertile pop. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoSelectOne\fP< \fBEOT\fP > & \fBselect\fP"
+.br
+.ti -1c
+.RI "\fBeoHowMany\fP \fBhowManyFertile\fP"
+.br
+.ti -1c
+.RI "\fBeoPop\fP< \fBEOT\fP > \fBtmpPop\fP"
+.br
+.ti -1c
+.RI "\fBeoPop\fP< \fBEOT\fP > & \fBactualPop\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoTruncatedSelectOne< EOT >"
+eoTruncatedSelectOne selects one individual using \fBeoSelectOne\fP as it's mechanism. 
+
+Therefore eoTruncatedSelectOne needs an \fBeoSelectOne\fP in its ctor
+.PP
+It will perform selection only from the top guys in the population. 
+.PP
+Definition at line 45 of file eoTruncatedSelectOne.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template const \fBEOT\fP& \fBeoTruncatedSelectOne\fP< \fBEOT\fP >::operator() (const \fBeoPop\fP< \fBEOT\fP > & _pop)\fC [inline, virtual]\fP"
+.PP
+The implementation selects an individual from the fertile pop. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_source\fP the source population 
+.br
+\fI_dest\fP the selected guy 
+.RE
+.PP
+
+.PP
+Implements \fBeoUF< const eoPop< EOT > &, const EOT & >\fP.
+.PP
+Definition at line 98 of file eoTruncatedSelectOne.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoUBitXover.3 b/trunk/paradiseo-eo/doc/man/man3/eoUBitXover.3
new file mode 100644
index 000000000..918e6995c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoUBitXover.3
@@ -0,0 +1,66 @@
+.TH "eoUBitXover" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoUBitXover \- eoUBitXover --> classic Uniform crossover  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoQuadOp< Chrom >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoUBitXover\fP (const float &_preference=0.5)"
+.br
+.RI "\fI(Default) Constructor. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIThe class name. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (Chrom &chrom1, Chrom &chrom2)"
+.br
+.RI "\fIUniform crossover for binary chromosomes. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "float \fBpreference\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoUBitXover< Chrom >"
+eoUBitXover --> classic Uniform crossover 
+.PP
+Definition at line 274 of file eoBitOp.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template bool \fBeoUBitXover\fP< Chrom >::operator() (Chrom & chrom1, Chrom & chrom2)\fC [inline, virtual]\fP"
+.PP
+Uniform crossover for binary chromosomes. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIchrom1\fP The first chromosome. 
+.br
+\fIchrom2\fP The first chromosome. ::runtime_error if sizes don't match 
+.RE
+.PP
+
+.PP
+Implements \fBeoBF< Chrom &, Chrom &, bool >\fP.
+.PP
+Definition at line 292 of file eoBitOp.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoUF.3 b/trunk/paradiseo-eo/doc/man/man3/eoUF.3
new file mode 100644
index 000000000..9614ad21c
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoUF.3
@@ -0,0 +1,49 @@
+.TH "eoUF" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoUF \- Basic Unary Functor.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoFunctorBase\fP.
+.PP
+Inherited by \fBeoPerf2Worth< Dummy >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual \fB~eoUF\fP ()"
+.br
+.RI "\fIvirtual dtor here so there is no need to define it in derived classes \fP"
+.ti -1c
+.RI "virtual R \fBoperator()\fP (A1)=0"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Static Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoFunctorBase::unary_function_tag\fP \fBfunctor_category\fP ()"
+.br
+.RI "\fItag to identify a procedure in compile time function selection functor_category \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoUF< A1, R >"
+Basic Unary Functor. 
+
+Derive from this class when defining any unary function. First template argument is the first_argument_type, second result_type. Argument and result types can be any type including void for result_type 
+.PP
+Definition at line 108 of file eoFunctor.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoUnaryFunctorCounter.3 b/trunk/paradiseo-eo/doc/man/man3/eoUnaryFunctorCounter.3
new file mode 100644
index 000000000..8109b99f5
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoUnaryFunctorCounter.3
@@ -0,0 +1,70 @@
+.TH "eoUnaryFunctorCounter" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoUnaryFunctorCounter \- Generic counter class that counts the number of times a unary function is used.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoValueParam< unsigned long >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoUnaryFunctorCounter\fP (UnaryFunctor &_func, std::string _name='uf_counter')"
+.br
+.ti -1c
+.RI "UnaryFunctor::result_type \fBoperator()\fP (typename UnaryFunctor::first_argument_type _arg1)"
+.br
+.RI "\fICalls the embedded function and increments the counter. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "UnaryFunctor & \fBfunc\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoUnaryFunctorCounter< UnaryFunctor >"
+Generic counter class that counts the number of times a unary function is used. 
+
+Add a unary function through its ctor and use this class instead of it.
+.PP
+It is derived from \fBeoValueParam\fP so you can add it to a monitor.
+.PP
+Example: suppose you have an \fBeoEvalFunc\fP called myeval, to count the number of evaluations, just define:
+.PP
+eoUnaryFunctorCounter evalCounter(myeval);
+.PP
+and use evalCounter now instead of myeval. 
+.PP
+Definition at line 95 of file eoCounter.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template UnaryFunctor::result_type \fBeoUnaryFunctorCounter\fP< UnaryFunctor >::operator() (typename UnaryFunctor::first_argument_type _arg1)\fC [inline]\fP"
+.PP
+Calls the embedded function and increments the counter. 
+.PP
+Note for MSVC users, if this code does not compile, you are quite likely trying to count a function that has a non-void return type. Don't look at us, look at the MSVC builders. Code like 'return void;' is perfectly legal according to the ANSI standard, but the guys at Microsoft didn't get to implementing it yet.
+.PP
+We had two choices: assuming (and compiling ) code that returns void or code that returns non-void. Given that in \fBEO\fP most functors return void, it was chosen to support void.
+.PP
+But also please let me know if you have a compiler that defines _MSC_VER (lot's of windows compilers do), but is quite capable of compiling return void; type of code. We'll try to change the signature then.
+.PP
+You happy GNU (and other compiler) users will not have a problem with this. 
+.PP
+Definition at line 118 of file eoCounter.h.
+.PP
+References eoValueParam< unsigned long >::value().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoUniformAtomExchange.3 b/trunk/paradiseo-eo/doc/man/man3/eoUniformAtomExchange.3
new file mode 100644
index 000000000..ab8637c10
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoUniformAtomExchange.3
@@ -0,0 +1,54 @@
+.TH "eoUniformAtomExchange" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoUniformAtomExchange \- Uniform crossover - well, not really, efficient for FixedLength.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoAtomExchange< Atom >< Atom >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoUniformAtomExchange\fP (double _rate=0.5)"
+.br
+.ti -1c
+.RI "void \fBrandomize\fP (unsigned _size1, unsigned _size2)"
+.br
+.RI "\fIrandomize: fill the mask: the exchange will be simulated first to see if sizes are OK, so it must be repeatable : the mask has to be a private data, cannot be computed on the fly \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (unsigned _i, Atom &)"
+.br
+.RI "\fIthe operator() simply returns the mask booleans in turn \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIinherited \fBclassName()\fP \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "double \fBrate\fP"
+.br
+.ti -1c
+.RI "std::vector< bool > \fBmask\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoUniformAtomExchange< Atom >"
+Uniform crossover - well, not really, efficient for FixedLength. 
+.PP
+Definition at line 52 of file eoVariableLengthCrossover.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoUniformGeneChooser.3 b/trunk/paradiseo-eo/doc/man/man3/eoUniformGeneChooser.3
new file mode 100644
index 000000000..780ee9cc0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoUniformGeneChooser.3
@@ -0,0 +1,36 @@
+.TH "eoUniformGeneChooser" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoUniformGeneChooser \- Uniform choice of gene to delete.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoGeneDelChooser< EOT >< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBoperator()\fP (\fBEOT\fP &_eo)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoUniformGeneChooser< EOT >"
+Uniform choice of gene to delete. 
+.PP
+Definition at line 94 of file eoVariableLengthMutation.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoUniformGenerator.3 b/trunk/paradiseo-eo/doc/man/man3/eoUniformGenerator.3
new file mode 100644
index 000000000..6270a2b7f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoUniformGenerator.3
@@ -0,0 +1,62 @@
+.TH "eoUniformGenerator" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoUniformGenerator \- The class eoUniform can be used in the STL generate function to easily generate random floats and doubles.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoRndGenerator< T >< T >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoUniformGenerator\fP (T _max=T(1.0), \fBeoRng\fP &_rng=rng)"
+.br
+.ti -1c
+.RI "\fBeoUniformGenerator\fP (T _min, T _max, \fBeoRng\fP &_rng=rng)"
+.br
+.ti -1c
+.RI "T \fBoperator()\fP (void)"
+.br
+.RI "\fIGenerates the number, uses a static_cast to get the right behaviour for ints and unsigneds. \fP"
+.ti -1c
+.RI "template<> bool \fBoperator()\fP (void)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "T \fBminim\fP"
+.br
+.ti -1c
+.RI "T \fBrange\fP"
+.br
+.ti -1c
+.RI "\fBeoRng\fP & \fBuniform\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoUniformGenerator< T >"
+The class eoUniform can be used in the STL generate function to easily generate random floats and doubles. 
+
+It can also be used for ints and unsigneds by virtue of the static_cast in the generator function.
+.PP
+Also present is a specialization for boolean, that will ignore the minima and maxima that are possibly set and will return an unbiased flip of a coin. For a biased flip, use the eoBoolean
+.PP
+either in [0, _max) if only 1 value (_max) is given (or none, as _max defaults to 1.0) or in [_min,_max) if 2 values are given (_min, _max) 
+.PP
+Definition at line 66 of file eoRndGenerators.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoUniformInit.3 b/trunk/paradiseo-eo/doc/man/man3/eoUniformInit.3
new file mode 100644
index 000000000..303fee85f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoUniformInit.3
@@ -0,0 +1,67 @@
+.TH "eoUniformInit" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoUniformInit \- The class eoUniformInit can be used in the STL apply function to easily randomize floats and doubles.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoInit< T >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoUniformInit\fP (T _max=T(1.0), \fBeoRng\fP &_rng=rng)"
+.br
+.RI "\fICtor with only a max bound. \fP"
+.ti -1c
+.RI "\fBeoUniformInit\fP (\fBeoRealBounds\fP &_bound, \fBeoRng\fP &_rng=rng)"
+.br
+.RI "\fICtor with an eoRealBound. \fP"
+.ti -1c
+.RI "\fBeoUniformInit\fP (T _min, T _max, \fBeoRng\fP &_rng=rng)"
+.br
+.RI "\fICtor with explicit min and max. \fP"
+.ti -1c
+.RI "void \fBoperator()\fP (T &_t)"
+.br
+.RI "\fIGenerates the number, uses a static_cast to get the right behaviour for ints and unsigneds. \fP"
+.ti -1c
+.RI "template<> void \fBoperator()\fP (bool &_b)"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "T \fBminim\fP"
+.br
+.ti -1c
+.RI "T \fBrange\fP"
+.br
+.ti -1c
+.RI "\fBeoRng\fP & \fBuniform\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoUniformInit< T >"
+The class eoUniformInit can be used in the STL apply function to easily randomize floats and doubles. 
+
+It can also be used for ints and unsigneds by virtue of the static_cast
+.PP
+Also present is a specialization for boolean, that will ignore the minima and maxima that are possibly set and will return an unbiased flip of a coin. For a biased flip, use the eoBoolean
+.PP
+either in [0, _max) if only 1 value (_max) is given (or none, as _max defaults to 1.0) or in [_min,_max) if 2 values are given (_min, _max) 
+.PP
+Definition at line 62 of file eoUniformInit.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoUniformMutation.3 b/trunk/paradiseo-eo/doc/man/man3/eoUniformMutation.3
new file mode 100644
index 000000000..9eff16ade
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoUniformMutation.3
@@ -0,0 +1,133 @@
+.TH "eoUniformMutation" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoUniformMutation \- eoUniformMutation --> changes all values of the std::vector by uniform choice with range epsilon with probability p_change per variable  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoUniformMutation\fP (const double &_epsilon, const double &_p_change=1.0)"
+.br
+.RI "\fIConstructor without bounds == unbounded variables :-) not very clean, but who's doing unbounded optimization anyway? and it's there mostly for backward compatibility. \fP"
+.ti -1c
+.RI "\fBeoUniformMutation\fP (\fBeoRealVectorBounds\fP &_bounds, const double &_epsilon, const double &_p_change=1.0)"
+.br
+.RI "\fIConstructor with bounds. \fP"
+.ti -1c
+.RI "\fBeoUniformMutation\fP (\fBeoRealVectorBounds\fP &_bounds, const std::vector< double > &_epsilon, const std::vector< double > &_p_change)"
+.br
+.RI "\fIConstructor with bounds. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIThe class name. \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eo)"
+.br
+.RI "\fIDo it! \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "bool \fBhomogeneous\fP"
+.br
+.ti -1c
+.RI "\fBeoRealVectorBounds\fP & \fBbounds\fP"
+.br
+.ti -1c
+.RI "std::vector< double > \fBepsilon\fP"
+.br
+.ti -1c
+.RI "std::vector< double > \fBp_change\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoUniformMutation< EOT >"
+eoUniformMutation --> changes all values of the std::vector by uniform choice with range epsilon with probability p_change per variable 
+.PP
+Definition at line 45 of file eoRealOp.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoUniformMutation\fP< \fBEOT\fP >::\fBeoUniformMutation\fP (const double & _epsilon, const double & _p_change = \fC1.0\fP)\fC [inline]\fP"
+.PP
+Constructor without bounds == unbounded variables :-) not very clean, but who's doing unbounded optimization anyway? and it's there mostly for backward compatibility. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_epsilon\fP the range for uniform nutation 
+.br
+\fI_p_change\fP the probability to change a given coordinate 
+.RE
+.PP
+
+.PP
+Definition at line 56 of file eoRealOp.h.
+.SS "template \fBeoUniformMutation\fP< \fBEOT\fP >::\fBeoUniformMutation\fP (\fBeoRealVectorBounds\fP & _bounds, const double & _epsilon, const double & _p_change = \fC1.0\fP)\fC [inline]\fP"
+.PP
+Constructor with bounds. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_bounds\fP an \fBeoRealVectorBounds\fP that contains the bounds 
+.br
+\fI_epsilon\fP the range for uniform mutation - a double to be scaled 
+.br
+\fI_p_change\fP the one probability to change all coordinates 
+.RE
+.PP
+
+.PP
+Definition at line 66 of file eoRealOp.h.
+.PP
+References eoRealBaseVectorBounds::isBounded(), and eoRealBaseVectorBounds::range().
+.SS "template \fBeoUniformMutation\fP< \fBEOT\fP >::\fBeoUniformMutation\fP (\fBeoRealVectorBounds\fP & _bounds, const std::vector< double > & _epsilon, const std::vector< double > & _p_change)\fC [inline]\fP"
+.PP
+Constructor with bounds. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_bounds\fP an \fBeoRealVectorBounds\fP that contains the bounds 
+.br
+\fI_epsilon\fP the VECTOR of ranges for uniform mutation 
+.br
+\fI_p_change\fP the VECTOR of probabilities for each coordinates 
+.RE
+.PP
+
+.PP
+Definition at line 83 of file eoRealOp.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template bool \fBeoUniformMutation\fP< \fBEOT\fP >::operator() (\fBEOT\fP & _eo)\fC [inline, virtual]\fP"
+.PP
+Do it! 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_eo\fP The indi undergoing the mutation 
+.RE
+.PP
+
+.PP
+Implements \fBeoUF< EOT &, bool >\fP.
+.PP
+Definition at line 96 of file eoRealOp.h.
+.PP
+References eoRng::flip(), eoRealBaseVectorBounds::isMaxBounded(), eoRealBaseVectorBounds::isMinBounded(), eoRealBaseVectorBounds::maximum(), eoRealBaseVectorBounds::minimum(), and eoRng::uniform().
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoUpdatable.3 b/trunk/paradiseo-eo/doc/man/man3/eoUpdatable.3
new file mode 100644
index 000000000..46aae7cce
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoUpdatable.3
@@ -0,0 +1,34 @@
+.TH "eoUpdatable" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoUpdatable \- eoUpdatable is a generic class for adding updatation to an existing class Just says it has an update() method  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherited by \fBeoOneFifthMutation< EOT >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual \fB~eoUpdatable\fP ()"
+.br
+.RI "\fIVirtual destructor. \fP"
+.ti -1c
+.RI "virtual void \fBupdate\fP ()=0"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+eoUpdatable is a generic class for adding updatation to an existing class Just says it has an update() method 
+.PP
+Definition at line 36 of file eoUpdatable.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoUpdater.3 b/trunk/paradiseo-eo/doc/man/man3/eoUpdater.3
new file mode 100644
index 000000000..09abe422d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoUpdater.3
@@ -0,0 +1,37 @@
+.TH "eoUpdater" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoUpdater \- eoUpdater is a generic procudere for updating whatever you want.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoF< void >\fP.
+.PP
+Inherited by \fBeoCountedStateSaver\fP, \fBeoDynUpdater\fP, \fBeoIncrementor< T >\fP, \fBeoIncrementorParam< T >\fP, \fBeoTimeCounter\fP, and \fBeoTimedStateSaver\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "virtual void \fBlastCall\fP ()"
+.br
+.ti -1c
+.RI "virtual std::string \fBclassName\fP (void) const "
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+eoUpdater is a generic procudere for updating whatever you want. 
+
+Yet again an empty name 
+.PP
+Definition at line 39 of file eoUpdater.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoValueParam.3 b/trunk/paradiseo-eo/doc/man/man3/eoValueParam.3
new file mode 100644
index 000000000..f3bbab356
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoValueParam.3
@@ -0,0 +1,118 @@
+.TH "eoValueParam" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoValueParam \- eoValueParam: templatized derivation of \fBeoParam\fP.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoParam\fP.
+.PP
+Inherited by \fBeoPerf2Worth< EOT, EOT::Fitness >\fP, and \fBeoPerf2Worth< EOT, WorthType >\fP.
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoValueParam\fP (void)"
+.br
+.RI "\fIConstruct a Param. \fP"
+.ti -1c
+.RI "\fBeoValueParam\fP (ValueType _defaultValue, std::string _longName, std::string _description='No description', char _shortHand=0, bool _required=false)"
+.br
+.RI "\fIConstruct a Param. \fP"
+.ti -1c
+.RI "ValueType & \fBvalue\fP ()"
+.br
+.RI "\fIParameter value. \fP"
+.ti -1c
+.RI "const ValueType & \fBvalue\fP () const "
+.br
+.RI "\fIParameter value. \fP"
+.ti -1c
+.RI "std::string \fBgetValue\fP (void) const "
+.br
+.RI "\fIPure virtual function to get the value out. \fP"
+.ti -1c
+.RI "void \fBsetValue\fP (const std::string &_value)"
+.br
+.RI "\fIPure virtual function to set the value. \fP"
+.in -1c
+.SS "Protected Attributes"
+
+.in +1c
+.ti -1c
+.RI "ValueType \fBrepValue\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoValueParam< ValueType >"
+eoValueParam: templatized derivation of \fBeoParam\fP. 
+
+Can be used to contain any scalar value type. It makes use of std::strstream to get and set values. This should be changed to std::stringstream when that class is available in g++.
+.PP
+Note also that there is a template specialization for std::pair and for std::vector. These stream their contents delimited with whitespace. 
+.PP
+Definition at line 136 of file eoParam.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoValueParam\fP< ValueType >::\fBeoValueParam\fP (ValueType _defaultValue, std::string _longName, std::string _description = \fC'No description'\fP, char _shortHand = \fC0\fP, bool _required = \fCfalse\fP)\fC [inline]\fP"
+.PP
+Construct a Param. 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_defaultValue\fP The default value 
+.br
+\fI_longName\fP Long name of the argument 
+.br
+\fI_description\fP Description of the parameter. What is useful for. 
+.br
+\fI_shortName\fP Short name of the argument (Optional) 
+.br
+\fI_required\fP If it is a necessary parameter or not 
+.RE
+.PP
+
+.PP
+Definition at line 151 of file eoParam.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template ValueType& \fBeoValueParam\fP< ValueType >::value ()\fC [inline]\fP"
+.PP
+Parameter value. 
+.PP
+\fBReturns:\fP
+.RS 4
+parameter value 
+.RE
+.PP
+
+.PP
+Definition at line 166 of file eoParam.h.
+.PP
+Referenced by eoNoPerf2Worth< EOT >::operator()(), eoFileSnapshot::operator()(), eoFDCStat< EOT >::operator()(), and eoParser::setStopOnUnknownParam().
+.SS "template const ValueType& \fBeoValueParam\fP< ValueType >::value () const\fC [inline]\fP"
+.PP
+Parameter value. 
+.PP
+This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
+.PP
+\fBReturns:\fP
+.RS 4
+parameter value 
+.RE
+.PP
+
+.PP
+Definition at line 175 of file eoParam.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoVariableParetoTraits.3 b/trunk/paradiseo-eo/doc/man/man3/eoVariableParetoTraits.3
new file mode 100644
index 000000000..0d7649d4d
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoVariableParetoTraits.3
@@ -0,0 +1,48 @@
+.TH "eoVariableParetoTraits" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoVariableParetoTraits \- eoVariableParetoTraits : an \fBeoParetoFitnessTraits\fP whose characteristics can be set at run-time (nb objectives and min/max's) Why bother? For didactical purposes (and EASEA implementation :-)  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoParetoFitnessTraits\fP.
+.PP
+.SS "Static Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "void \fBsetUp\fP (unsigned _n, std::vector< bool > &_b)"
+.br
+.RI "\fIsetting the static stuff \fP"
+.ti -1c
+.RI "unsigned \fBnObjectives\fP ()"
+.br
+.RI "\fIthe accessors \fP"
+.ti -1c
+.RI "bool \fBmaximizing\fP (unsigned _i)"
+.br
+.in -1c
+.SS "Static Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBnObj\fP"
+.br
+.ti -1c
+.RI "std::vector< bool > \fBbObj\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+eoVariableParetoTraits : an \fBeoParetoFitnessTraits\fP whose characteristics can be set at run-time (nb objectives and min/max's) Why bother? For didactical purposes (and EASEA implementation :-) 
+.PP
+Definition at line 56 of file eoParetoFitness.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoVector.3 b/trunk/paradiseo-eo/doc/man/man3/eoVector.3
new file mode 100644
index 000000000..66a3f1bfd
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoVector.3
@@ -0,0 +1,80 @@
+.TH "eoVector" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoVector \- Base class for fixed length chromosomes, just derives from \fBEO\fP and std::vector and redirects the smaller than operator to EO (fitness based comparison).  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBEO< FitT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef GeneType \fBAtomType\fP"
+.br
+.ti -1c
+.RI "typedef std::vector< GeneType > \fBContainerType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoVector\fP (unsigned size=0, GeneType value=GeneType())"
+.br
+.RI "\fIdefault constructor \fP"
+.ti -1c
+.RI "template \fBeoVector\fP (const \fBeoVector\fP< OtherFitnessType, GeneType > &_vec)"
+.br
+.RI "\fIcopy ctor abstracting from the FitT \fP"
+.ti -1c
+.RI "void \fBvalue\fP (const std::vector< GeneType > &_v)"
+.br
+.ti -1c
+.RI "bool \fBoperator<\fP (const \fBeoVector\fP< \fBFitT\fP, GeneType > &_eo) const "
+.br
+.RI "\fIto avoid conflicts between EO::operator< and std::vector::operator< \fP"
+.ti -1c
+.RI "virtual void \fBprintOn\fP (std::ostream &os) const "
+.br
+.RI "\fIprinting... \fP"
+.ti -1c
+.RI "virtual void \fBreadFrom\fP (std::istream &is)"
+.br
+.RI "\fIreading... \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoVector< FitT, GeneType >"
+Base class for fixed length chromosomes, just derives from \fBEO\fP and std::vector and redirects the smaller than operator to EO (fitness based comparison). 
+
+GeneType must have the following methods: void ctor (needed for the std::vector<>), copy ctor, 
+.PP
+Definition at line 46 of file eoVector.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoVector\fP< \fBFitT\fP, GeneType >::\fBeoVector\fP (unsigned size = \fC0\fP, GeneType value = \fCGeneType()\fP)\fC [inline]\fP"
+.PP
+default constructor 
+.PP
+\fBParameters:\fP
+.RS 4
+\fIsize\fP Length of vector (default is 0) 
+.br
+\fIvalue\fP Initial value of all elements (default is default value of type GeneType) 
+.RE
+.PP
+
+.PP
+Definition at line 65 of file eoVector.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoVlAddMutation.3 b/trunk/paradiseo-eo/doc/man/man3/eoVlAddMutation.3
new file mode 100644
index 000000000..9a4527392
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoVlAddMutation.3
@@ -0,0 +1,74 @@
+.TH "eoVlAddMutation" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoVlAddMutation \- Addition of a gene Is inserted at a random position - so can be applied to both order-dependent and order-independent.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::AtomType \fBAtomType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoVlAddMutation\fP (unsigned _nMax, \fBeoInit\fP< AtomType > &_atomInit)"
+.br
+.RI "\fIdefault ctor \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eo)"
+.br
+.RI "\fIoperator: actually adds an Atom \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIinherited className \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBnMax\fP"
+.br
+.ti -1c
+.RI "\fBeoInit\fP< AtomType > & \fBatomInit\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoVlAddMutation< EOT >"
+Addition of a gene Is inserted at a random position - so can be applied to both order-dependent and order-independent. 
+.PP
+Definition at line 48 of file eoVariableLengthMutation.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoVlAddMutation\fP< \fBEOT\fP >::\fBeoVlAddMutation\fP (unsigned _nMax, \fBeoInit\fP< AtomType > & _atomInit)\fC [inline]\fP"
+.PP
+default ctor 
+.PP
+\fBParameters:\fP
+.RS 4
+\fInMax\fP max number of atoms 
+.br
+\fI_atomInit\fP an Atom initializer 
+.RE
+.PP
+
+.PP
+Definition at line 59 of file eoVariableLengthMutation.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoVlAtomExchangeQuadOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoVlAtomExchangeQuadOp.3
new file mode 100644
index 000000000..d42fd57a6
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoVlAtomExchangeQuadOp.3
@@ -0,0 +1,61 @@
+.TH "eoVlAtomExchangeQuadOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoVlAtomExchangeQuadOp \- Exchange Crossover using an AtomExchange.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoQuadOp< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::AtomType \fBAtomType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoVlAtomExchangeQuadOp\fP (unsigned _Min, unsigned _Max, \fBeoAtomExchange\fP< AtomType > &_atomExchange)"
+.br
+.RI "\fIdefault ctor: requires bounds on number of genes + a rate \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eo1, \fBEOT\fP &_eo2)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.RI "\fIthe inherited className \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBMin\fP"
+.br
+.ti -1c
+.RI "unsigned \fBMax\fP"
+.br
+.ti -1c
+.RI "\fBeoAtomExchange\fP< AtomType > & \fBatomExchange\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoVlAtomExchangeQuadOp< EOT >"
+Exchange Crossover using an AtomExchange. 
+.PP
+Definition at line 89 of file eoVariableLengthCrossover.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoVlDelMutation.3 b/trunk/paradiseo-eo/doc/man/man3/eoVlDelMutation.3
new file mode 100644
index 000000000..190a0eccc
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoVlDelMutation.3
@@ -0,0 +1,108 @@
+.TH "eoVlDelMutation" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoVlDelMutation \- Deletion of a gene By default at a random position, but a 'chooser' can be specified can of course be applied to both order-dependent and order-independent.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoMonOp< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::AtomType \fBAtomType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoVlDelMutation\fP (unsigned _nMin, \fBeoGeneDelChooser\fP< \fBEOT\fP > &_chooser)"
+.br
+.RI "\fIctor with an external gene chooser \fP"
+.ti -1c
+.RI "\fBeoVlDelMutation\fP (unsigned _nMin)"
+.br
+.RI "\fIctor with uniform gene chooser - the default \fP"
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eo)"
+.br
+.RI "\fIDo the job (delete one gene). \fP"
+.ti -1c
+.RI "virtual std::string \fBclassName\fP () const "
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBnMin\fP"
+.br
+.ti -1c
+.RI "\fBeoUniformGeneChooser\fP< \fBEOT\fP > \fBuChooser\fP"
+.br
+.ti -1c
+.RI "\fBeoGeneDelChooser\fP< \fBEOT\fP > & \fBchooser\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoVlDelMutation< EOT >"
+Deletion of a gene By default at a random position, but a 'chooser' can be specified can of course be applied to both order-dependent and order-independent. 
+.PP
+Definition at line 110 of file eoVariableLengthMutation.h.
+.SH "Constructor & Destructor Documentation"
+.PP 
+.SS "template \fBeoVlDelMutation\fP< \fBEOT\fP >::\fBeoVlDelMutation\fP (unsigned _nMin, \fBeoGeneDelChooser\fP< \fBEOT\fP > & _chooser)\fC [inline]\fP"
+.PP
+ctor with an external gene chooser 
+.PP
+\fBParameters:\fP
+.RS 4
+\fInMin\fP min number of atoms to leave in the individual 
+.br
+\fI_geneChooser\fP an eoGeneCHooser to choose which one to delete 
+.RE
+.PP
+
+.PP
+Definition at line 121 of file eoVariableLengthMutation.h.
+.SS "template \fBeoVlDelMutation\fP< \fBEOT\fP >::\fBeoVlDelMutation\fP (unsigned _nMin)\fC [inline]\fP"
+.PP
+ctor with uniform gene chooser - the default 
+.PP
+\fBParameters:\fP
+.RS 4
+\fInMin\fP min number of atoms to leave in the individual 
+.RE
+.PP
+
+.PP
+Definition at line 128 of file eoVariableLengthMutation.h.
+.SH "Member Function Documentation"
+.PP 
+.SS "template bool \fBeoVlDelMutation\fP< \fBEOT\fP >::operator() (\fBEOT\fP & _eo)\fC [inline, virtual]\fP"
+.PP
+Do the job (delete one gene). 
+.PP
+\fBParameters:\fP
+.RS 4
+\fI_eo\fP the \fBEO\fP to mutate 
+.RE
+.PP
+
+.PP
+Implements \fBeoUF< EOT &, bool >\fP.
+.PP
+Definition at line 134 of file eoVariableLengthMutation.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoVlUniformBinOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoVlUniformBinOp.3
new file mode 100644
index 000000000..691ea5c88
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoVlUniformBinOp.3
@@ -0,0 +1,58 @@
+.TH "eoVlUniformBinOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoVlUniformBinOp \- Direct Uniform Exchange of genes for Variable Length, BINARY version.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoBinOp< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::AtomType \fBAtomType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoVlUniformBinOp\fP (unsigned _Min, unsigned _Max, double _rate=0.5)"
+.br
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eo1, const \fBEOT\fP &_eo2)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBMin\fP"
+.br
+.ti -1c
+.RI "unsigned \fBMax\fP"
+.br
+.ti -1c
+.RI "double \fBrate\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoVlUniformBinOp< EOT >"
+Direct Uniform Exchange of genes for Variable Length, BINARY version. 
+
+A very primitive version, that does no verification at all!!! NEEDS to be improved - but no time now :-((( Especially, if both guys have maximal size, it will take some time to generate even 1 offspring that is not oversized!!! Also, we should first check for identical atoms, and copy them to the offspring, and only after that exchange the other ones (Radcliffe's RRR). 
+.PP
+Definition at line 280 of file eoVariableLengthCrossover.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoVlUniformQuadOp.3 b/trunk/paradiseo-eo/doc/man/man3/eoVlUniformQuadOp.3
new file mode 100644
index 000000000..b1e748273
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoVlUniformQuadOp.3
@@ -0,0 +1,58 @@
+.TH "eoVlUniformQuadOp" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoVlUniformQuadOp \- Direct Uniform Exchange of genes (obsolete, already :-) stays there for historical reasons.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoQuadOp< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::AtomType \fBAtomType\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoVlUniformQuadOp\fP (unsigned _Min, unsigned _Max, double _rate=0.5)"
+.br
+.ti -1c
+.RI "bool \fBoperator()\fP (\fBEOT\fP &_eo1, \fBEOT\fP &_eo2)"
+.br
+.RI "\fIThe pure virtual function that needs to be implemented by the subclass. \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "unsigned \fBMin\fP"
+.br
+.ti -1c
+.RI "unsigned \fBMax\fP"
+.br
+.ti -1c
+.RI "double \fBrate\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoVlUniformQuadOp< EOT >"
+Direct Uniform Exchange of genes (obsolete, already :-) stays there for historical reasons. 
+
+A very primitive version, that does no verification at all!!! NEEDS to be improved - but no time now :-((( Especially, if both guys have maximal size, it will take a lot of time to generate 2 offspring that both are not oversized!!! Also, we should first check for identical atoms, and copy them to the offspring, and only after that exchange the other ones (Radcliffe's RRR). 
+.PP
+Definition at line 219 of file eoVariableLengthCrossover.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/eoWeakElitistReplacement.3 b/trunk/paradiseo-eo/doc/man/man3/eoWeakElitistReplacement.3
new file mode 100644
index 000000000..f0440bc12
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/eoWeakElitistReplacement.3
@@ -0,0 +1,52 @@
+.TH "eoWeakElitistReplacement" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+eoWeakElitistReplacement \- eoWeakElitistReplacement: a wrapper for other replacement procedures.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+Inherits \fBeoReplacement< EOT >< EOT >\fP.
+.PP
+.SS "Public Types"
+
+.in +1c
+.ti -1c
+.RI "typedef EOT::Fitness \fBFitness\fP"
+.br
+.in -1c
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBeoWeakElitistReplacement\fP (\fBeoReplacement\fP< \fBEOT\fP > &_replace)"
+.br
+.ti -1c
+.RI "void \fBoperator()\fP (\fBeoPop\fP< \fBEOT\fP > &_pop, \fBeoPop\fP< \fBEOT\fP > &_offspring)"
+.br
+.RI "\fIdo replacement \fP"
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "\fBeoReplacement\fP< \fBEOT\fP > & \fBreplace\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class eoWeakElitistReplacement< EOT >"
+eoWeakElitistReplacement: a wrapper for other replacement procedures. 
+
+Copies in the new pop the best individual from the old pop, AFTER normal replacement, if the best of the new pop is worse than the best of the old pop. Removes the worse individual from the new pop. This could be changed by adding a selector there... 
+.PP
+Definition at line 102 of file eoReplacement.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/gp_parse_tree.3 b/trunk/paradiseo-eo/doc/man/man3/gp_parse_tree.3
new file mode 100644
index 000000000..f9ef57f99
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/gp_parse_tree.3
@@ -0,0 +1,175 @@
+.TH "gp_parse_tree" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+gp_parse_tree \- Parse_tree and subtree classes (c) copyright Maarten Keijzer 1999, 2000.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+.SS "Classes"
+
+.in +1c
+.ti -1c
+.RI "class \fBgp_parse_tree::MemPool\fP"
+.br
+.RI "\fIPool allocator for the subtree and parse tree classes (homebrew and not compliant to ANSI allocator requirements) (c) copyright Maarten Keijzer 1999, 2000. \fP"
+.ti -1c
+.RI "struct \fBgp_parse_tree::MemPool::Link\fP"
+.br
+.ti -1c
+.RI "struct \fBgp_parse_tree::MemPool::Chunk\fP"
+.br
+.ti -1c
+.RI "class \fBgp_parse_tree::Node_alloc< T >\fP"
+.br
+.ti -1c
+.RI "class \fBgp_parse_tree::Standard_alloc< T >\fP"
+.br
+.ti -1c
+.RI "class \fBgp_parse_tree::Standard_Node_alloc< T >\fP"
+.br
+.ti -1c
+.RI "class \fBgp_parse_tree::Tree_alloc< T >\fP"
+.br
+.ti -1c
+.RI "class \fBgp_parse_tree::parse_tree< T >\fP"
+.br
+.ti -1c
+.RI "class \fBgp_parse_tree::parse_tree< T >::subtree\fP"
+.br
+.ti -1c
+.RI "class \fBgp_parse_tree::parse_tree< T >::base_iterator\fP"
+.br
+.ti -1c
+.RI "class \fBgp_parse_tree::parse_tree< T >::iterator\fP"
+.br
+.ti -1c
+.RI "class \fBgp_parse_tree::parse_tree< T >::embedded_iterator\fP"
+.br
+.ti -1c
+.RI "class \fBgp_parse_tree::parse_tree< T >::base_const_iterator\fP"
+.br
+.ti -1c
+.RI "class \fBgp_parse_tree::parse_tree< T >::const_iterator\fP"
+.br
+.ti -1c
+.RI "class \fBgp_parse_tree::parse_tree< T >::embedded_const_iterator\fP"
+.br
+.in -1c
+.SS "Functions"
+
+.in +1c
+.ti -1c
+.RI "template void \fBdo_the_swap\fP (T &a, T &b)"
+.br
+.RI "\fIThis ones defined because gcc does not always implement namespaces. \fP"
+.in -1c
+.SH "Detailed Description"
+.PP 
+Parse_tree and subtree classes (c) copyright Maarten Keijzer 1999, 2000. 
+
+Permission to copy, use, modify, sell and distribute this software is granted provided this copyright notice appears in all copies. This software is provided 'as is' without express or implied warranty, and with no claim as to its suitability for any purpose.
+.PP
+Permission to modify the code and to distribute modified code is granted, provided the above notices as well as this one are retained, and a notice that the code was modified is included with the above copyright notice.
+.PP
+Usage information.
+.PP
+class Node (your node in the tree) must have the following implemented:
+.PP
+Arity ******
+.PP
+int arity(void) const
+.PP
+Note: the default constructor of a Node should provide a Node with arity 0!
+.PP
+Evaluation ******
+.PP
+A parse_tree is evaluated through one of it's apply() members:
+.PP
+1) parse_tree::apply(RetVal)
+.PP
+is the simplest evaluation, it will call
+.PP
+RetVal Node::operator()(RetVal, subtree::const_iterator)
+.PP
+(Unfortunately the first RetVal argument is mandatory (although you might not need it. This is because MSVC does not support member template functions properly. If it cannot deduce the template arguments (as is the case in templatizing over return value) you are not allowed to specify them. calling tree.apply() would result in a syntax error. That is why you have to call tree.apply(double()) instead.)
+.PP
+2) parse_tree::apply(RetVal v, It values)
+.PP
+will call:
+.PP
+RetVal Node::operator()(RetVal, subtree<... , It values)
+.PP
+where It is whatever type you desire (most of the time this will be a std::vector containing the values of your variables);
+.PP
+3) parse_tree::apply(RetVal, It values, It2 moreValues)
+.PP
+will call:
+.PP
+RetVal Node::operator()(RetVal, subtree<... , It values, It2 moreValues)
+.PP
+although I do not see the immediate use of this, however...
+.PP
+4) parse_tree::apply(RetVal, It values, It2 args, It3 adfs)
+.PP
+that calls:
+.PP
+RetVal Node::operator()(subtree<... , It values, It2 args, It3 adfs)
+.PP
+can be useful for implementing adfs.
+.PP
+In general it is a good idea to leave the specifics of the arguments open so that different ways of evaluation remain possible. Implement the simplest eval as:
+.PP
+template  RetVal operator()(RetVal dummy, It begin) const
+.PP
+Internal Structure ******
+.PP
+A parse_tree has two template arguments: the Node and the ReturnValue produced by evaluating the node. The structure of the tree is defined through a subtree class that has the same two template arguments.
+.PP
+The nodes are stored in a tree like :
+.PP
+node4 / \\ node3 node2 / \\ node1 node0
+.PP
+where nodes 2 and 4 have arity 2 and nodes 0,1 and 3 arity 0 (terminals)
+.PP
+The nodes are subtrees, containing the structure of the tree, together with its size and depth. They contain a Node, the user defined template argument. To access these nodes from a subtree, use operator-> or operator*.
+.PP
+The numbers behind the nodes define a reverse-polish or postfix traversel through the tree. The parse_tree defines iterators on the tree such that
+.PP
+tree.begin() points at the subtree at node0 and tree.back() returns the subtree at node4, the complete tree
+.PP
+Likewise operator[] is defined on the tree, such that:
+.PP
+tree[0] will return the subtree at node0, while tree[2] will return the subtree at node2
+.PP
+Assigments of subtrees is protected so that the code:
+.PP
+tree[2] = tree[0];
+.PP
+will not crash and result in a tree structured as:
+.PP
+node4 / \\ node3 node0
+.PP
+Note that the rank numbers no longer specify their place in the tree:
+.PP
+tree[0] still points at node0, but tree[1] now points to node3 and tree[2] points at the root node4
+.PP
+Embedded iterators are implemented to iterate over nodes rather than subtrees. So an easy way to copy your tree to a std::vector is:
+.PP
+std::vector vec(tree.size()); copy(tree.ebegin(), tree.eend(), vec.begin());
+.PP
+You can also copy it to an std::ostream_iterator with this technique, given that your Node implements an appropriate operator<<. Reinitializing a tree with the std::vector is also simple:
+.PP
+tree.clear(); copy(vec.begin(), vec.end(), back_inserter(tree));
+.PP
+or from an std::istream:
+.PP
+copy(std::istream_iterator(my_stream), std::istream_iterator(), back_inserter(tree));
+.PP
+Note that the back_inserter must be used as there is no resize member in the parse_tree. back_inserter will use the push_back member from the parse_tree 
+.PP
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/gp_parse_tree_MemPool.3 b/trunk/paradiseo-eo/doc/man/man3/gp_parse_tree_MemPool.3
new file mode 100644
index 000000000..e7825cdaa
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/gp_parse_tree_MemPool.3
@@ -0,0 +1,58 @@
+.TH "gp_parse_tree::MemPool" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+gp_parse_tree::MemPool \- Pool allocator for the subtree and parse tree classes (homebrew and not compliant to ANSI allocator requirements) (c) copyright Maarten Keijzer 1999, 2000.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBMemPool\fP (unsigned int sz)"
+.br
+.ti -1c
+.RI "void * \fBallocate\fP ()"
+.br
+.ti -1c
+.RI "void \fBdeallocate\fP (void *b)"
+.br
+.in -1c
+.SS "Private Member Functions"
+
+.in +1c
+.ti -1c
+.RI "void \fBgrow\fP ()"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "Chunk * \fBchunks\fP"
+.br
+.ti -1c
+.RI "const unsigned int \fBesize\fP"
+.br
+.ti -1c
+.RI "Link * \fBhead\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+Pool allocator for the subtree and parse tree classes (homebrew and not compliant to ANSI allocator requirements) (c) copyright Maarten Keijzer 1999, 2000. 
+
+Permission to copy, use, modify, sell and distribute this software is granted provided this copyright notice appears in all copies. This software is provided 'as is' without express or implied warranty, and with no claim as to its suitability for any purpose.
+.PP
+Permission to modify the code and to distribute modified code is granted, provided the above notices are retained, and a notice that the code was modified is included with the above copyright notice. 
+.PP
+Definition at line 185 of file parse_tree.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/negexp_generator.3 b/trunk/paradiseo-eo/doc/man/man3/negexp_generator.3
new file mode 100644
index 000000000..ebca3f6f9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/negexp_generator.3
@@ -0,0 +1,45 @@
+.TH "negexp_generator" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+negexp_generator \- The class negexp_generator can be used in the STL generate function to easily generate negative exponential distributed floats and doubles.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBnegexp_generator\fP (T _mean=1.0, \fBeoRng\fP &_rng=rng)"
+.br
+.ti -1c
+.RI "T \fBoperator()\fP (void)"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "T \fBmean\fP"
+.br
+.ti -1c
+.RI "\fBeoRng\fP & \fBnegexp\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class negexp_generator< T >"
+The class negexp_generator can be used in the STL generate function to easily generate negative exponential distributed floats and doubles. 
+
+The user can supply a mean. 
+.PP
+Definition at line 156 of file rnd_generators.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/normal_generator.3 b/trunk/paradiseo-eo/doc/man/man3/normal_generator.3
new file mode 100644
index 000000000..e5d81097a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/normal_generator.3
@@ -0,0 +1,45 @@
+.TH "normal_generator" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+normal_generator \- The class normal_generator can be used in the STL generate function to easily generate gaussian distributed floats and doubles.  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBnormal_generator\fP (T _stdev=T(1.0), \fBeoRng\fP &_rng=rng)"
+.br
+.ti -1c
+.RI "T \fBoperator()\fP (void)"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "T \fBstdev\fP"
+.br
+.ti -1c
+.RI "\fBeoRng\fP & \fBnormal\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class normal_generator< T >"
+The class normal_generator can be used in the STL generate function to easily generate gaussian distributed floats and doubles. 
+
+The user can supply a standard deviation which defaults to 1. 
+.PP
+Definition at line 139 of file rnd_generators.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/random_generator.3 b/trunk/paradiseo-eo/doc/man/man3/random_generator.3
new file mode 100644
index 000000000..5eceacdc0
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/random_generator.3
@@ -0,0 +1,52 @@
+.TH "random_generator" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+random_generator \- The class random_generator can be used in the STL generate function to easily generate random ints either between [0, _max) if only one value (_max) is given to the ctor or in [_min,_max) if 2 values are given (_min, _max).  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBrandom_generator\fP (T _max, \fBeoRng\fP &_rng=rng)"
+.br
+.ti -1c
+.RI "\fBrandom_generator\fP (T _min, T _max, \fBeoRng\fP &_rng=rng)"
+.br
+.ti -1c
+.RI "T \fBoperator()\fP (void)"
+.br
+.ti -1c
+.RI "template<> bool \fBoperator()\fP (void)"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "T \fBminim\fP"
+.br
+.ti -1c
+.RI "T \fBrange\fP"
+.br
+.ti -1c
+.RI "\fBeoRng\fP & \fBrandom\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class random_generator< T >"
+The class random_generator can be used in the STL generate function to easily generate random ints either between [0, _max) if only one value (_max) is given to the ctor or in [_min,_max) if 2 values are given (_min, _max). 
+.PP
+Definition at line 87 of file rnd_generators.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/related.3 b/trunk/paradiseo-eo/doc/man/man3/related.3
new file mode 100644
index 000000000..b822bb7db
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/related.3
@@ -0,0 +1,8 @@
+.TH "related" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+related \- .SH "ParadisEO"
+.PP
+.PP
+\fCParadisEO\fP is a project to extend \fBEO\fP to make use of dedicated parallel or distributed computing environments by \fCSébastien Cahon\fP. 
diff --git a/trunk/paradiseo-eo/doc/man/man3/todo.3 b/trunk/paradiseo-eo/doc/man/man3/todo.3
new file mode 100644
index 000000000..52e71d23a
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/todo.3
@@ -0,0 +1,15 @@
+.TH "todo" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+todo \- Todo List
+ 
+.IP "\fBClass \fBeoDominanceMap< EoType >\fP \fP" 1c
+make it an \fBeoStat\fP? 
+.PP
+.PP
+ 
+.IP "\fBMember \fBeoEsChromInit::create_self_adapt\fP(eoEsStdev< FitT > &result) \fP" 1c
+Should we scale sigmas to the corresponding object variable range? 
+.PP
+
diff --git a/trunk/paradiseo-eo/doc/man/man3/uniform_generator.3 b/trunk/paradiseo-eo/doc/man/man3/uniform_generator.3
new file mode 100644
index 000000000..893b688e9
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/uniform_generator.3
@@ -0,0 +1,49 @@
+.TH "uniform_generator" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+uniform_generator \- The class uniform_generator can be used in the STL generate function to easily generate random floats and doubles either in [0, _max) if only 1 value (_max) is given (or none, as _max defaults to 1.0) or in [_min,_max) if 2 values are given (_min, _max).  
+
+.PP
+.SH SYNOPSIS
+.br
+.PP
+\fC#include \fP
+.PP
+.SS "Public Member Functions"
+
+.in +1c
+.ti -1c
+.RI "\fBuniform_generator\fP (T _max=T(1.0), \fBeoRng\fP &_rng=rng)"
+.br
+.ti -1c
+.RI "\fBuniform_generator\fP (T _min, T _max, \fBeoRng\fP &_rng=rng)"
+.br
+.ti -1c
+.RI "T \fBoperator()\fP (void)"
+.br
+.in -1c
+.SS "Private Attributes"
+
+.in +1c
+.ti -1c
+.RI "T \fBminim\fP"
+.br
+.ti -1c
+.RI "T \fBrange\fP"
+.br
+.ti -1c
+.RI "\fBeoRng\fP & \fBuniform\fP"
+.br
+.in -1c
+.SH "Detailed Description"
+.PP 
+
+.SS "template class uniform_generator< T >"
+The class uniform_generator can be used in the STL generate function to easily generate random floats and doubles either in [0, _max) if only 1 value (_max) is given (or none, as _max defaults to 1.0) or in [_min,_max) if 2 values are given (_min, _max). 
+.PP
+Definition at line 44 of file rnd_generators.h.
+
+.SH "Author"
+.PP 
+Generated automatically by Doxygen for EO from the source code.
diff --git a/trunk/paradiseo-eo/doc/man/man3/webpages.3 b/trunk/paradiseo-eo/doc/man/man3/webpages.3
new file mode 100644
index 000000000..8b079736f
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/man/man3/webpages.3
@@ -0,0 +1,17 @@
+.TH "webpages" 3 "19 Oct 2006" "Version 0.9.4-cvs" "EO" \" -*- nroff -*-
+.ad l
+.nh
+.SH NAME
+webpages \- Related webpages
+.IP "\(bu" 2
+\fBEO\fP \fChomepage\fP
+.IP "\(bu" 2
+\fBEO\fP \fCTutorial\fP.
+.IP "\(bu" 2
+SourceForge \fCproject page\fP
+.IP "\(bu" 2
+\fCREADME\fP
+.IP "\(bu" 2
+\fCNEWS\fP 
+.PP
+
diff --git a/trunk/paradiseo-eo/doc/publications.html b/trunk/paradiseo-eo/doc/publications.html
new file mode 100644
index 000000000..ac200f3d1
--- /dev/null
+++ b/trunk/paradiseo-eo/doc/publications.html
@@ -0,0 +1,77 @@
+
+
+  
+    
+    
+    
+    
+    
+    EO Evolutionary Computation Framework
+    
+  
+  
+    
    
+      
    List of publications using EO
    
+    
    
+    
+      
+        
+          
+        
+        
+          
+        
+      
+    
    
+            
    
+              M.
+                Keijzer, J.J. Merelo, G. Romero, G., M. Schoenauer "Evolving
+                objects: A general purpose evolutionary computation
+                library", Art. Evol., 231-242 (2002).
+            
    
+          
    
+            
    
+              J.J. Gilijamse, J.
+                Küpper, S. Hoekstra, S.Y.T. van de Meerakker, G. Meijer:
+                "Optimizing the Stark-decelerator beamline for the trapping of
+                cold molecules using evolutionary strategies", arXiv,
+                physics/0603108 (2006)
+            
    
+          
    
+    
    
+      
    maartenkeijzer@users.sourceforge.net
+        - merelo@users.sourceforge.net
+        - evomarc@users.sourceforge.net
+      
    
+      
    
+        Hosted by:
    SF logo
+      
    
+    
    
+    
    
+      
+        Valid HTML 4.01 Transitional
+      
    
+      Please send publications that belong on this page and general comments on
+      this webpage to
+      the EO
+      mailing list.
+    
    
+  
+
+
+
+
+
+
+
diff --git a/trunk/paradiseo-eo/doc/sflogo-hammer1.jpg b/trunk/paradiseo-eo/doc/sflogo-hammer1.jpg
new file mode 100644
index 0000000000000000000000000000000000000000..a7e2f00f482a7a9c2c8692cb198d91fb0a4ff0e7
GIT binary patch
literal 4793
zcmbW4c|6qLyTCuP3|YsL-4IeJAwtZgWKAO3mx{7wUq%`x%93qD*2)lBvP||R*&Az%
zol%$}yD<~P6lU&xf4}>>_w~Ae-Fu(&I_IDBoO7P{>v^7Yo>Q{QO{EFj(M(gs_01m=G8&A|oOu
zDG7l<1cXn@os^Q3kb+44vk4PpDTock!_LklB?uOj`acW369BUV7C-_s(@EeMn28z8
zMDGP40Kmk`^e+MaQ<#o1voNe==Qz&EP-x%-jxjMaA7j|h0AOfGGUfpmFe|@|sy>^5
zYq0RwE=i^?N}v9LG-xi-?NJpHet|M)87%=0z=SovQ}d42_IU
zOmA7=wz0LdcW`sR|G>l3%R4wEGz=d8DB|g}*tqzF=ZWbVFEg{Ub8_?E78SoMDJ?61
zUt3q-(Ad=6(%RkA`x)EUKQK5tHa;;qH9dpF6Bd_#Ew8Mut&@N6>{9mjsek_d!^H$J
z{~L=j{u}InaDf?I#~5y50sX_pbPUeu%wQH)8C5oZeM`{YK!KBL(d>d((h6(3IAqnW
zNJ965MvkA5yMUJ`|AY1~vi}`e%>Rq*zrg;R3kPs9GclaU3pQYbo;w>o78guOrL?XV&`;0@_p!f^EDO
za>F{%icVnOd1eLGwigD}s6UNKnm{daTaIjInD*5|gsD!UW0V>?z>J~;i3QY-9?(6A>!@C(xlDARK%2>z-h#%etzU>^!7Xo24l%99iXMekjKIvAJa1
z(nC4R71}3hIUgjRWO{*ke@SL09D=Ph&~oFe>@!Bd16W|K7RM0
zg4)!h*MlA0>?DQX;pmbev{=kcR8sr}H}azDN^stMJ^m~o{=A3F@-HmJXlY46OyS~*
zpDG`>NvV@6q!lctIG|O+)bS2dPWUZaG;ZpM0-*y!E*kHA{stZuEt5V^#{XJvI{(UZ
zOWq3csw~ay#Z?l|jE=x-RL=+Ud@@vms)P-bl9)Uc4MY1`hhy&jDLhW>=Qtwby_8pVhwfKOE^cIS)v1qOVEq2{Ew~i
zZA2K1_T3M$7n_-Ge%?)F5gWTTqluVp7`%yZBC5JH|4-EDuKbI0sMabBHDdAm@6l85j^6$YZF$;XP>u0C_r;^55BRh=rMD)eP&CHrJ}+j>yjnisCq
zF59Y-&ndBwypAyE;
zo!vwXO+0zzw&y(yzTj-}_S8
zl|?^HYm_c#Ke3C>_;$l*XcsMpP$jEGQ^b$Na6<-@U}x!u))tN+=YXDj*_WcFo{rn}
z#bQp0VY8Kt1J231(SgY0V07)JYwh|3b0bry%!Zr-W$iu(B}J@tGkNcmTB_L6V&3WV
z9;q9croB|MDrDyuFD)^qoZ3$0=0#N_!R2nd?5ItdFi?R)`r}YSs|AGWVe;|gXtjo<%c5!f
zC^5;=_;>GF+zoaf2_ES6Nc`*k2rXKymbkE*AxJ(;k+zJNYY(ox_-O=NK
zG-?xGg@mk6>VTdl&z%|BYVegTP8fs^XS2VH8_%@P7;gs3VaRI5xH|YklFBjUgLQ{Y
zY*LX+_lL{hjX$)1<@qk@s159`T1-a&{&`7+4%7}Uc1;<>R{pxo4LOx=_O2ryV=|>t
zHI8&ZTd9&XY=h?2l`RWLb*ZgO$&LyfT^h;?H^UZ0ktbrx0z2gc)1GcSxN;!O7w7<=
z=NR>sDQPP;;dY+Vbd~Su8R5GMZ=U9h%ckz~;O6@YloOl>Huh=BDGoby;F^gu8VeIT
z)EzyHES?Qt?A*`ZKQ*W7Qx5vcZ}<1Nmc29N!~_Iyxgg0IR-edppf`z^v+JEn>3ZXx87H|>rT00dX+v=?
z6%El})C8jhLm&+{=xY5!%?emTN4+jA2=A+mlM%<6-qV%fIxpi0g7(7oJd&k;(7sN(
zddUv*+53Gv7`RE@cBT3goS_zRG^NR2+n^!-zP$jJ?}O}04Kt$p(wWfVYcLwWvqIOH
z7nUMNI+ni=MIE=72iZMm{X}8EfjMq
zkA_PQo4;=VA;jH`m}UWYZMeK5VQ!i$?Ri}cS}m_~=<^Sn()7KUy=>sTpE6G*YK(+`
zGbf2twRMHdf1-HT_EW3;vaY}QT`lfSv}(&3liW~np4!F4r_2U$*hSS$t?lh
ze_IBtsmI)Tk!{;y-0!?Nf*6brzUGbqzwz6WYnH$9M`DL|V5$EZ_BPF%diSV0-yp&AiCoI2?{hJgxA0
zfxXCs39S(Q#AIc(G3vs`9DhCOA;||vLzOuV)f+Uz$tJR9FW`SXzs?3}@9BBFD^=9R
zP|-qP+HCSA8_BolFvV+WvsixPlgToMOt(%$1B7m+TdX;|eqP;6@1GojSjSbrs^quN8;V6Alnh%*ftC9k-O|(^7Ucd4+m1=
zzIsNM^%Omwv4F=h-d}`iLVO){lywhO&3rXXw49N#6O_gbpX#|EXAbn*%j5%!6gVZ^
z7ovo|@CtY}wx4iir}A@t+^|Wt41@=YmtBke{NzVLmOSbqlMR%O+SB6#u5U5-CK8nX
zP}s7Jp?ykE1m7p~6$c6HJsuak(9&*52YMu#du-r;Co4!zy(MgxN>&#lV2mQGR;Z6|4JsfUo%Ga+q-)R&52z!TR3rj-}aGm)k^Jc
z!xO)?9?ZW+BtEt&O=z=x2T9qR)Bc`3rDHy*3^zaRt~gxi{Nz3hU@c{YxzO)=e^&>R
z&}#S;6ZPH7D}wUn%QN0moUX8DosmR7JVWX`bA{jbScxJe*#+D{qD;l7&)ZK>+(M@L
zz13vf?z%g%Di$%Xocg%UNA>TFQkvXsv!-tP)bQ)+%Vo?9Xc<$`>bRhU~v)NiV-fwIdQ@YXf
zm+3{`zYG3Z$39B%RQ5@qCU8;IvhqSc4?9LbzME6B<&kb6KK6KV(_dq)!<0~5R<0Kk
zRew$VUW>n^r%oj5sYX)s*+pLNml*V&XXrlBk_IK*MR&w!@>Q&q%D9H(n^WRGRVt=W
zGGT4T=R82f7Ve$XvM&nYOH;3Zct%LRE4H1=8&MzT@YF5(bmMWxRFf73GvfG-Yc+xn
zJS%D%!8h8uCuuoJ&PZhGnNSomT=@^ZNUU?wl{u#xo}awvZIEva5VfQif^n^PS;iVy
zaf4HeR4%)3_Xh6O7>Tgre9Er!T^_)7gphxtq~cms1lBc2ywx1MG>7+tTVj`FS6*hM
zvazW%F3o0<&t?S1L#7XhyA`c{A3X7c-LYR{FdP7M7$uypt+@wjqxXgUr=x0gpkN|P
zlAIMlZdwRp->dW?=w&^38hxX2>xMh3NEftlGepVj9KsC$>P)`;94h2hbf0!tRS{{?
zbbc8k9BvU7jMhV9+k@($7e4^dhO*ANY#;OySFl4CO@nMPHZJWv&
zxiK21(@{%Sa~i2L`amu1Yz&6C!ES^a3&rg_#<+L(TlA+ekt$Y3;XXjSfdD-iqV}&%7QhbjkiK
zFx>_sEzj-u*w{9;cEmp{$&&uUGNzJ~yEzw+Yqh5O->G>iB}c-J&3+LgIC%8UAHRON
zon(F}y0O%s?zS`Qd^R2niQU)QsicTsL9SF4!2U98xYnbB(diYFeFe^k7shOa?-C$f
z0x<#d5>pA`zj50J6I_}nd>?&N@#46D*oko%)wL&$S%Wrl$%$)|gp9ow8d>$tUs=Jl
zy*JVJ=qg-f7gGf>B>i@Ze6v(%Ukl2zV;fjieLY@|-xA$>Xy+KQeI0qU
zZAck09cbw5N(nWkK8B}Y4=V~;qR1aDU5ZN98XH9qbngbQ)>~;W5s9vI9dq7Q<@&69
z=)n7dE%2}
zhB)+PcRO4fXzmT*y)ohKdnxZs-HJ+d2S+|fKIXt(L`OY9r=LP&T7FvK^HV}w
zvP7;*;lt3w!Or9tVX1ldWoh<_xmVOiO@Cb}F4z`!>qT58Ir~}0Hc-Z)(XK(X>l{Zu
z&&S(&!{ffHeHid~LqOqj9f_{v+s#qy*bI>ZH07SP1R|0{)1UZ_`(;e
zqOh*J7;fQ|h&G-obPs0Dp3r07(2?wIBW#naC;tqygQ-`jZ^*g3<)&Tvah}_&N%5*f
z0jR9{(XSCCSDwz=@`Nn;n)(W5baw`E&i4AtN9o39$5hjv05s$qI2~Zxs@_zl4FouH
zZJipMRY3hhV_WUpnD1a(ai{M|uf#I{wY`S_#IL8QX3Z8no-tX$`84GI@Xuj#4#h>H
z+-@YD)z?rwxy&HWK(^hkP_ko2<4uw0+FiZ2s*{>SZUWKy9Mb{n<9_@Sq^LVO$7hEQ
eEE~R&k8kUapj&9xAtKBs|CFDng0ONzc}mw

literal 0
HcmV?d00001

diff --git a/trunk/paradiseo-eo/gp/CVS/Entries b/trunk/paradiseo-eo/gp/CVS/Entries
new file mode 100644
index 000000000..178481050
--- /dev/null
+++ b/trunk/paradiseo-eo/gp/CVS/Entries
@@ -0,0 +1 @@
+D
diff --git a/trunk/paradiseo-eo/gp/CVS/Repository b/trunk/paradiseo-eo/gp/CVS/Repository
new file mode 100644
index 000000000..a04226f40
--- /dev/null
+++ b/trunk/paradiseo-eo/gp/CVS/Repository
@@ -0,0 +1 @@
+eo/gp
diff --git a/trunk/paradiseo-eo/gp/CVS/Root b/trunk/paradiseo-eo/gp/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/gp/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/src/.cvsignore b/trunk/paradiseo-eo/src/.cvsignore
new file mode 100644
index 000000000..69fb0bd82
--- /dev/null
+++ b/trunk/paradiseo-eo/src/.cvsignore
@@ -0,0 +1,6 @@
+*.lo
+*.la
+.deps
+.libs
+Makefile
+Makefile.in
diff --git a/trunk/paradiseo-eo/src/CVS/Entries b/trunk/paradiseo-eo/src/CVS/Entries
new file mode 100644
index 000000000..c44bfce1c
--- /dev/null
+++ b/trunk/paradiseo-eo/src/CVS/Entries
@@ -0,0 +1,108 @@
+/.cvsignore/1.1.1.1/Fri Jan 29 12:23:53 1999//
+/EO.h/1.26/Thu Feb 27 19:26:10 2003//
+/Makefile.am/1.59/Thu Mar 23 10:15:17 2006//
+/apply.h/1.4/Thu Feb 27 19:26:11 2003//
+/eo/1.57/Tue Feb 28 14:40:37 2006//
+/eoAlgo.h/1.5/Thu Dec 23 17:26:38 2004//
+/eoBreed.h/1.4/Wed Oct  5 22:08:29 2005//
+/eoCellularEasyEA.h/1.1/Thu Apr 25 14:06:43 2002//
+/eoCloneOps.h/1.2/Thu Feb 27 19:26:09 2003//
+/eoCombinedContinue.h/1.6/Tue Jun 15 07:28:54 2004//
+/eoCombinedInit.h/1.2/Sat Aug 28 14:03:34 2004//
+/eoContinue.h/1.4/Fri Dec  9 17:45:56 2005//
+/eoCounter.h/1.4/Wed Feb 14 10:35:25 2001//
+/eoCtrlCContinue.cpp/1.4/Fri Feb 28 16:49:13 2003//
+/eoCtrlCContinue.h/1.6/Tue Jun 15 07:28:54 2004//
+/eoDetSelect.h/1.5/Sun Mar  2 11:29:01 2003//
+/eoDetTournamentSelect.h/1.7/Thu Feb 27 19:26:01 2003//
+/eoDistribUpdater.h/1.2/Sat Nov 10 09:02:17 2001//
+/eoDistribution.h/1.1/Thu Nov  8 07:40:27 2001//
+/eoDominanceMap.h/1.10/Thu Dec 23 15:40:44 2004//
+/eoEDA.h/1.1/Mon Jun  9 06:17:26 2003//
+/eoEasyEA.h/1.23/Wed Oct  5 22:08:29 2005//
+/eoEvalContinue.h/1.3/Tue Jun 15 07:28:54 2004//
+/eoEvalFunc.h/1.16/Mon Jul 12 09:16:41 2004//
+/eoEvalFuncCounter.h/1.1/Tue Apr 24 04:56:12 2001//
+/eoEvalFuncPtr.h/1.7/Sat Nov 17 07:22:31 2001//
+/eoFactory.h/1.4/Thu Feb 27 19:25:59 2003//
+/eoFitContinue.h/1.4/Tue Jun 15 07:28:54 2004//
+/eoFitnessScalingSelect.h/1.2/Fri Feb 16 08:21:25 2001//
+/eoFlOrBinOp.h/1.1/Sat Aug  2 06:42:33 2003//
+/eoFlOrMonOp.h/1.2/Mon Mar 14 21:00:00 2005//
+/eoFlOrQuadOp.h/1.1/Sat Aug  2 06:42:33 2003//
+/eoFunctor.h/1.7/Wed Dec  1 09:22:48 2004//
+/eoFunctorStore.cpp/1.5/Wed Dec  7 15:51:32 2005//
+/eoFunctorStore.h/1.7/Wed Dec  7 15:40:23 2005//
+/eoG3Replacement.h/1.2/Thu Feb 27 19:25:59 2003//
+/eoGenContinue.h/1.10/Fri Dec  9 17:49:43 2005//
+/eoGenOp.h/1.11/Tue Aug 10 17:19:46 2004//
+/eoGeneralBreeder.h/1.7/Thu Feb 27 19:25:59 2003//
+/eoInit.h/1.16/Wed Dec  1 09:19:47 2004//
+/eoInvalidateOps.h/1.3/Thu Feb 15 04:47:18 2001//
+/eoLinearFitScaling.h/1.7/Mon Mar 27 18:55:19 2006//
+/eoMGGReplacement.h/1.4/Sun Mar  2 11:26:45 2003//
+/eoMerge.h/1.12/Thu Feb 27 19:25:58 2003//
+/eoMergeReduce.h/1.2/Fri Jan  5 05:42:08 2001//
+/eoNDSorting.h/1.20/Mon Mar 27 18:55:19 2006//
+/eoObject.h/1.15/Thu Feb 27 19:25:58 2003//
+/eoOneToOneBreeder.h/1.3/Thu Feb 27 19:25:57 2003//
+/eoOp.h/1.29/Tue Aug 10 17:19:46 2004//
+/eoOpContainer.h/1.10/Mon Mar 27 18:55:19 2006//
+/eoOpSelMason.h/1.5/Thu Feb 27 19:25:55 2003//
+/eoParetoConstraintFitness.h/1.3/Fri Apr 18 13:32:39 2003//
+/eoParetoFitness.cpp/1.2/Mon Feb  4 13:16:50 2002//
+/eoParetoFitness.h/1.10/Thu Feb 27 19:25:54 2003//
+/eoParetoRanking.h/1.5/Mon Mar 27 18:55:19 2006//
+/eoPerf2Worth.h/1.10/Mon Mar 27 18:55:19 2006//
+/eoPeriodicContinue.h/1.1/Tue Feb 28 14:39:45 2006//
+/eoPersistent.cpp/1.9/Thu Feb 27 19:25:53 2003//
+/eoPersistent.h/1.8/Thu Feb 27 19:25:53 2003//
+/eoPop.h/1.40/Thu Dec 23 10:14:42 2004//
+/eoPopAlgo.h/1.1/Wed Mar 27 17:28:04 2002//
+/eoPopEvalFunc.h/1.2/Tue Sep  4 06:50:42 2001//
+/eoPopulator.h/1.9/Mon Sep  5 16:47:53 2005//
+/eoPrintable.cpp/1.3/Thu Feb 27 19:25:52 2003//
+/eoPrintable.h/1.6/Thu Feb 27 19:25:52 2003//
+/eoPropGAGenOp.h/1.1/Sat May  7 15:43:29 2005//
+/eoProportionalCombinedOp.h/1.8/Tue Aug 10 17:19:46 2004//
+/eoProportionalSelect.h/1.4/Wed Jun  4 09:33:27 2003//
+/eoRandomSelect.h/1.12/Mon Jun 17 09:18:37 2002//
+/eoRanking.h/1.9/Mon Mar 27 18:55:19 2006//
+/eoRankingSelect.h/1.4/Thu Feb 27 19:25:52 2003//
+/eoReduce.h/1.11/Thu Feb 27 19:25:52 2003//
+/eoReduceMerge.h/1.1/Tue Dec 19 18:41:19 2000//
+/eoReduceMergeReduce.h/1.3/Thu Feb 27 19:25:52 2003//
+/eoReduceSplit.h/1.4/Mon Jan  2 14:09:22 2006//
+/eoReplacement.h/1.5/Tue Aug 10 17:19:46 2004//
+/eoSGA.h/1.11/Thu Dec 23 17:26:38 2004//
+/eoSGAGenOp.h/1.3/Thu Feb 27 19:25:51 2003//
+/eoSGATransform.h/1.8/Tue Aug 10 17:19:46 2004//
+/eoSTLFunctor.h/1.2/Wed Mar 21 12:10:13 2001//
+/eoScalarFitness.h/1.7/Sat Feb 17 10:51:31 2001//
+/eoScalarFitnessAssembled.cpp/1.1/Wed Apr  2 21:08:13 2003//
+/eoScalarFitnessAssembled.h/1.11/Thu Dec 23 15:29:06 2004//
+/eoSelect.h/1.2/Mon Oct  9 16:13:19 2000//
+/eoSelectFactory.h/1.4/Thu Feb 27 19:25:52 2003//
+/eoSelectFromWorth.h/1.9/Thu Dec 23 15:29:06 2004//
+/eoSelectMany.h/1.2/Mon May  7 07:13:36 2001//
+/eoSelectNumber.h/1.1/Tue Dec 19 18:41:19 2000//
+/eoSelectOne.h/1.4/Sat Nov 10 09:02:17 2001//
+/eoSelectPerc.h/1.3/Fri Dec  1 15:46:07 2000//
+/eoSequentialSelect.h/1.4/Mon Oct  3 12:54:45 2005//
+/eoSharing.h/1.6/Mon Mar 27 18:55:19 2006//
+/eoSharingSelect.h/1.2/Sat Aug 28 16:26:03 2004//
+/eoSimpleEDA.h/1.1/Mon Jun  9 06:17:26 2003//
+/eoSteadyFitContinue.h/1.5/Tue Aug 10 17:19:46 2004//
+/eoStochTournamentSelect.h/1.5/Thu Feb 27 19:25:48 2003//
+/eoStochasticUniversalSelect.h/1.3/Thu Dec 23 17:22:52 2004//
+/eoSurviveAndDie.h/1.3/Thu Dec 23 15:29:06 2004//
+/eoTransform.h/1.2/Mon Oct  9 16:13:19 2000//
+/eoTruncSelect.h/1.2/Sun Jan  5 16:31:47 2003//
+/eoTruncatedSelectMany.h/1.2/Thu Feb 27 19:25:48 2003//
+/eoTruncatedSelectOne.h/1.2/Mon Jun 17 09:19:17 2002//
+/eoVariableLengthCrossover.h/1.14/Fri Oct  7 08:27:59 2005//
+/eoVariableLengthMutation.h/1.10/Wed Sep 28 21:49:26 2005//
+/eoVector.h/1.17/Thu Oct  6 17:22:40 2005//
+/es.h/1.8/Tue Jul 29 05:33:58 2003//
+/ga.h/1.3/Sat Sep  8 05:58:13 2001//
+D
diff --git a/trunk/paradiseo-eo/src/CVS/Entries.Log b/trunk/paradiseo-eo/src/CVS/Entries.Log
new file mode 100644
index 000000000..f887436e7
--- /dev/null
+++ b/trunk/paradiseo-eo/src/CVS/Entries.Log
@@ -0,0 +1,10 @@
+A D/MGE////
+A D/do////
+A D/es////
+A D/ga////
+A D/gp////
+A D/obsolete////
+A D/other////
+A D/paradisEO////
+A D/pyeo////
+A D/utils////
diff --git a/trunk/paradiseo-eo/src/CVS/Repository b/trunk/paradiseo-eo/src/CVS/Repository
new file mode 100644
index 000000000..01fe86b2a
--- /dev/null
+++ b/trunk/paradiseo-eo/src/CVS/Repository
@@ -0,0 +1 @@
+eo/src
diff --git a/trunk/paradiseo-eo/src/CVS/Root b/trunk/paradiseo-eo/src/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/src/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/src/EO.h b/trunk/paradiseo-eo/src/EO.h
new file mode 100644
index 000000000..fae793ae7
--- /dev/null
+++ b/trunk/paradiseo-eo/src/EO.h
@@ -0,0 +1,152 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// EO.h
+// (c) GeNeura Team 1998
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef EO_H
+#define EO_H
+
+//-----------------------------------------------------------------------------
+
+#include        // std::runtime_error
+#include       // eoObject
+#include   // eoPersistent
+
+//-----------------------------------------------------------------------------
+/** EO is a base class for evolvable objects, that is, the subjects of
+    evolution. EOs have only got a fitness, which at the same time needs to be
+    only an object with the operation less than (<) defined. Fitness says how
+    good is the object; evolution or change of these objects is left to the
+    genetic operators. A fitness less than another means a worse fitness, in
+    whatever the context; thus, fitness is always maximized; although it can
+    be minimized with a proper definition of the < operator. The fitness
+    object must have, besides an void ctor, a copy ctor.
+*/
+template class EO: public eoObject, public eoPersistent
+{
+public:
+  typedef F Fitness;
+
+  /** Default constructor.
+      Fitness must have a ctor which takes 0 as a value; we can not use void
+      ctors here since default types like float have no void initializer.
+      VC++ allows it, but gcc does not
+  */
+  EO(): repFitness(Fitness()), invalidFitness(true) {}
+
+  /// Virtual dtor
+  virtual ~EO() {};
+
+  /// Return fitness value.
+  Fitness fitness() const {
+    if (invalid())
+      throw std::runtime_error("invalid fitness");
+    return repFitness;
+  }
+
+  // Set fitness as invalid.
+  void invalidate() { invalidFitness = true; }
+
+  /** Set fitness. At the same time, validates it.
+   *  @param _fitness New fitness value.
+   */
+  void fitness(const Fitness& _fitness)
+  {
+    repFitness = _fitness;
+    invalidFitness = false;
+  }
+
+  /** Return true If fitness value is invalid, false otherwise.
+   *  @return true If fitness is invalid.
+   */
+  bool invalid() const { return invalidFitness; }
+
+  /** Returns true if
+      @return true if the fitness is higher
+  */
+  bool operator<(const EO& _eo2) const { return fitness() < _eo2.fitness(); }
+  bool operator>(const EO& _eo2) const { return !(fitness() <= _eo2.fitness()); }
+
+  /// Methods inherited from eoObject
+  //@{
+
+  /** Return the class id.
+   *  @return the class name as a std::string
+   */
+  virtual std::string className() const { return "EO"; }
+
+  /**
+   * Read object.\\
+   * Calls base class, just in case that one had something to do.
+   * The read and print methods should be compatible and have the same format.
+   * In principle, format is "plain": they just print a number
+   * @param _is a std::istream.
+   * @throw runtime_std::exception If a valid object can't be read.
+   */
+  virtual void readFrom(std::istream& _is) {
+     
+        // the new version of the reafFrom function.
+        // It can distinguish between valid and invalid fitness values. 
+        std::string fitness_str;
+        int pos = _is.tellg();
+	_is >> fitness_str;
+
+	if (fitness_str == "INVALID")
+	{
+		invalidFitness = true;
+	}
+	else
+	{
+		invalidFitness = false;
+		_is.seekg(pos); // rewind
+		_is >> repFitness;
+	}
+  }
+
+  /**
+   * Write object. Called printOn since it prints the object _on_ a stream.
+   * @param _os A std::ostream.
+   */
+  virtual void printOn(std::ostream& _os) const {
+
+
+    // the latest version of the code. Very similar to the old code
+    if (invalid()) {
+  	_os << "INVALID ";
+    }
+    else
+    {
+ 	_os << repFitness << ' ';
+    }
+	      
+  }
+
+  //@}
+
+private:
+  Fitness repFitness;   // value of fitness for this chromosome
+  bool invalidFitness;  // true if the value of fitness is invalid
+};
+
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/trunk/paradiseo-eo/src/MGE/CVS/Entries b/trunk/paradiseo-eo/src/MGE/CVS/Entries
new file mode 100644
index 000000000..178481050
--- /dev/null
+++ b/trunk/paradiseo-eo/src/MGE/CVS/Entries
@@ -0,0 +1 @@
+D
diff --git a/trunk/paradiseo-eo/src/MGE/CVS/Repository b/trunk/paradiseo-eo/src/MGE/CVS/Repository
new file mode 100644
index 000000000..e53666068
--- /dev/null
+++ b/trunk/paradiseo-eo/src/MGE/CVS/Repository
@@ -0,0 +1 @@
+eo/src/MGE
diff --git a/trunk/paradiseo-eo/src/MGE/CVS/Root b/trunk/paradiseo-eo/src/MGE/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/src/MGE/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/src/Makefile.am b/trunk/paradiseo-eo/src/Makefile.am
new file mode 100644
index 000000000..11d00f934
--- /dev/null
+++ b/trunk/paradiseo-eo/src/Makefile.am
@@ -0,0 +1,116 @@
+# Makefile.am for eo/src
+
+SUBDIRS 		= es ga gp do utils other
+
+lib_LIBRARIES 		= libeo.a
+
+libeo_a_SOURCES 	= eoFunctorStore.cpp \
+			eoPersistent.cpp \
+			eoPrintable.cpp \
+			eoCtrlCContinue.cpp \
+			eoParetoFitness.cpp \
+			eoScalarFitnessAssembled.cpp  
+
+
+pkginclude_HEADERS 	= eo \
+			EO.h \
+			apply.h \
+			eoAlgo.h \
+			eoBreed.h \
+			eoCellularEasyEA.h \
+			eoCloneOps.h \
+			eoCombinedContinue.h \
+			eoCombinedInit.h \
+			eoContinue.h \
+			eoCounter.h \
+			eoCtrlCContinue.h \
+			eoDetSelect.h \
+			eoDetTournamentSelect.h \
+			eoDistribUpdater.h \
+			eoDistribution.h \
+			eoDominanceMap.h \
+			eoEDA.h \
+			eoEasyEA.h \
+			eoEvalContinue.h \
+			eoEvalFunc.h \
+			eoEvalFuncCounter.h \
+			eoEvalFuncPtr.h \
+			eoFactory.h \
+			eoFitContinue.h \
+			eoFitnessScalingSelect.h \
+			eoFlOrBinOp.h \
+			eoFlOrMonOp.h \
+			eoFlOrQuadOp.h \
+			eoFunctor.h \
+			eoFunctorStore.h \
+			eoG3Replacement.h \
+			eoGenContinue.h \
+			eoGenOp.h \
+			eoGeneralBreeder.h \
+			eoInit.h \
+			eoInvalidateOps.h \
+			eoLinearFitScaling.h \
+			eoMGGReplacement.h \
+			eoMerge.h \
+			eoMergeReduce.h \
+			eoNDSorting.h \
+			eoObject.h \
+			eoOneToOneBreeder.h \
+			eoOp.h \
+			eoOpContainer.h \
+			eoOpSelMason.h \
+			eoParetoConstraintFitness.h \
+			eoParetoFitness.h \
+			eoParetoRanking.h \
+			eoPerf2Worth.h \
+			eoPeriodicContinue.h \
+			eoPersistent.h \
+			eoPop.h \
+			eoPopAlgo.h \
+			eoPopEvalFunc.h \
+			eoPopulator.h \
+			eoPrintable.h \
+			eoPropGAGenOp.h \
+			eoProportionalCombinedOp.h \
+			eoProportionalSelect.h \
+			eoRandomSelect.h \
+			eoRanking.h \
+			eoRankingSelect.h \
+			eoReduce.h \
+			eoReduceMerge.h \
+			eoReduceMergeReduce.h \
+			eoReduceSplit.h \
+			eoReplacement.h \
+			eoSGA.h \
+			eoSGAGenOp.h \
+			eoSGATransform.h \
+			eoSTLFunctor.h \
+			eoScalarFitness.h \
+			eoScalarFitnessAssembled.cpp \
+			eoScalarFitnessAssembled.h \
+			eoSelect.h \
+			eoSelectFactory.h \
+			eoSelectFromWorth.h \
+			eoSelectMany.h \
+			eoSelectNumber.h \
+			eoSelectOne.h \
+			eoSelectPerc.h \
+			eoSequentialSelect.h \
+			eoSharing.h \
+			eoSharingSelect.h \
+			eoSimpleEDA.h \
+			eoSteadyFitContinue.h \
+			eoStochTournamentSelect.h \
+			eoStochasticUniversalSelect.h \
+			eoSurviveAndDie.h \
+			eoTransform.h \
+			eoTruncSelect.h \
+			eoTruncatedSelectMany.h \
+			eoTruncatedSelectOne.h \
+			eoVariableLengthCrossover.h \
+			eoVariableLengthMutation.h \
+			eoVector.h \
+			es.h \
+			ga.h
+
+AM_CXXFLAGS		= -I$(top_srcdir)/src
diff --git a/trunk/paradiseo-eo/src/apply.h b/trunk/paradiseo-eo/src/apply.h
new file mode 100644
index 000000000..54cf162ee
--- /dev/null
+++ b/trunk/paradiseo-eo/src/apply.h
@@ -0,0 +1,44 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoApply.h
+// (c) Maarten Keijzer 2000
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _apply_h
+#define _apply_h
+
+#include 
+#include 
+
+/**
+  Applies a unary function to a std::vector of things.
+*/
+template 
+void apply(eoUF& _proc, std::vector& _pop)
+{
+    for (unsigned i = 0; i < _pop.size(); ++i)
+    {
+        _proc(_pop[i]);
+    }
+}
+
+#endif
diff --git a/trunk/paradiseo-eo/src/do/.cvsignore b/trunk/paradiseo-eo/src/do/.cvsignore
new file mode 100644
index 000000000..70845e08e
--- /dev/null
+++ b/trunk/paradiseo-eo/src/do/.cvsignore
@@ -0,0 +1 @@
+Makefile.in
diff --git a/trunk/paradiseo-eo/src/do/CVS/Entries b/trunk/paradiseo-eo/src/do/CVS/Entries
new file mode 100644
index 000000000..1f51be412
--- /dev/null
+++ b/trunk/paradiseo-eo/src/do/CVS/Entries
@@ -0,0 +1,16 @@
+/.cvsignore/1.1/Fri Sep 17 17:00:04 2004//
+/Makefile.am/1.3/Wed Sep 22 18:18:30 2004//
+/Readme/1.2/Tue Sep  4 06:35:58 2001//
+/make_algo_easea.h/1.2/Thu Feb 27 19:25:26 2003//
+/make_algo_pareto.h/1.3/Mon Apr  4 20:41:05 2005//
+/make_algo_scalar.h/1.15/Tue Sep 28 17:13:34 2004//
+/make_checkpoint.h/1.13/Wed Oct  5 21:34:19 2005//
+/make_checkpoint_FDC.h/1.3/Thu Feb 27 19:25:25 2003//
+/make_checkpoint_assembled.h/1.4/Wed Oct  5 21:34:19 2005//
+/make_checkpoint_pareto.h/1.10/Mon Oct 10 13:34:21 2005//
+/make_continue.h/1.8/Mon Sep 12 17:53:25 2005//
+/make_continue_pareto.h/1.2/Thu Feb 27 19:25:25 2003//
+/make_general_replacement.h/1.4/Sun Apr 27 06:08:11 2003//
+/make_pop.h/1.8/Mon Sep 26 10:18:15 2005//
+/make_run.h/1.1/Tue Apr 24 04:52:04 2001//
+D
diff --git a/trunk/paradiseo-eo/src/do/CVS/Repository b/trunk/paradiseo-eo/src/do/CVS/Repository
new file mode 100644
index 000000000..4808f0a4a
--- /dev/null
+++ b/trunk/paradiseo-eo/src/do/CVS/Repository
@@ -0,0 +1 @@
+eo/src/do
diff --git a/trunk/paradiseo-eo/src/do/CVS/Root b/trunk/paradiseo-eo/src/do/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/src/do/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/src/do/Makefile.am b/trunk/paradiseo-eo/src/do/Makefile.am
new file mode 100644
index 000000000..3ec747297
--- /dev/null
+++ b/trunk/paradiseo-eo/src/do/Makefile.am
@@ -0,0 +1,15 @@
+pkginclude_HEADERS	= make_algo_easea.h \
+			make_algo_pareto.h \
+			make_algo_scalar.h \
+			make_checkpoint.h \
+			make_checkpoint_FDC.h \
+			make_checkpoint_assembled.h \
+			make_checkpoint_pareto.h \
+			make_continue.h \
+			make_continue_pareto.h \
+			make_general_replacement.h \
+			make_pop.h \
+			make_run.h
+
+
+EXTRA_DIST		= Readme
diff --git a/trunk/paradiseo-eo/src/do/Readme b/trunk/paradiseo-eo/src/do/Readme
new file mode 100644
index 000000000..cd3e5acd5
--- /dev/null
+++ b/trunk/paradiseo-eo/src/do/Readme
@@ -0,0 +1,36 @@
+This directory contains templatized code that is supposed to be
+instanciated and compiled in an actual library for every type of EOT
+
+The user can then modify and recompile only the part he/she wishes to
+change (as in any library!).
+
+See in EO src/ga dir the corresponding .cpp files, that simply instanciate
+the functions here for eoBit AND eoBit
+and in EO test dir the t-eoGA.cpp file that is a sample program that uses
+the whole facility.
+
+All make_XXX.h file define some parser-based constructions of basic 
+Evolutionary Algorithms components, using state-based memory management
+(see in src/utils dir, or read the tutorial).
+
+In this src/do dir, the following ***representation indedendent*** code 
+is defined
+
+make_algo_scalar.h     The selection/replacement for scalar fitnesses
+make_checkpoint.h      The output facilities
+make_continue.h        The stpping criteria
+make_pop.h             Init of the population (from an EOT initializer)
+make_run.h             Run the algorithm
+
+See also (NOW MOVED TO util DIR, as it was useful everywhere)
+make_help.cpp          Help on demand (+ status file) 
+
+Note:
+-----
+two additional make_XXX.h files need to be defined for each representation
+
+make_genotype.h        Builds an initializer for the corresponding EOType
+make_op.h              Builds a general Operator to be used in the algo
+
+MS, April 23, 2001
+    July 23, 2001
diff --git a/trunk/paradiseo-eo/src/do/make_algo_easea.h b/trunk/paradiseo-eo/src/do/make_algo_easea.h
new file mode 100644
index 000000000..cbcb9960a
--- /dev/null
+++ b/trunk/paradiseo-eo/src/do/make_algo_easea.h
@@ -0,0 +1,368 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_algo_easea.h
+// (c) Marc Schoenauer and Pierre Collet, 2002
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Pierre.Collet@polytechnique.fr
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _make_algo_easea_h
+#define _make_algo_easea_h
+
+#include      // for eo_is_a_rate
+// everything tha's needed for the algorithms - SCALAR fitness
+
+// Selection
+// the eoSelectOne's
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+// #include     included in all others
+
+// Breeders
+#include 
+
+// Replacement
+#include "make_general_replacement.h"
+#include "eoMGGReplacement.h"
+#include "eoG3Replacement.h"
+
+
+// Algorithm (only this one needed)
+#include 
+
+  // also need the parser and param includes
+#include 
+#include 
+
+
+/*
+ * This function builds the algorithm (i.e. selection and replacement)
+ *      from existing continue (or checkpoint) and operators
+ *
+ * It uses a parser (to get user parameters) and a state (to store the memory)
+ * the last argument is an individual, needed for 2 reasons
+ *     it disambiguates the call after instanciations
+ *     some operator might need some private information about the indis
+ *
+ * This is why the template is the complete EOT even though only the fitness
+ * is actually templatized here
+*/
+
+template 
+eoAlgo & do_make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc& _eval, eoContinue& _continue, eoGenOp& _op)
+{
+  // the selection
+  eoValueParam& selectionParam = _parser.createParam(eoParamParamType("DetTour(2)"), "selection", "Selection: Roulette, Ranking(p,e), DetTour(T), StochTour(t), Sequential(ordered/unordered) or EliteSequentialSelect", 'S', "Evolution Engine");
+
+  eoParamParamType & ppSelect = selectionParam.value(); // std::pair >
+
+  eoSelectOne* select ;
+  if (ppSelect.first == std::string("DetTour")) 
+  {
+    unsigned detSize;
+
+    if (!ppSelect.second.size())   // no parameter added
+      {
+	std::cerr << "WARNING, no parameter passed to DetTour, using 2" << std::endl;
+	detSize = 2;
+	// put back 2 in parameter for consistency (and status file)
+	ppSelect.second.push_back(std::string("2"));
+      }
+    else	  // parameter passed by user as DetTour(T)
+      detSize = atoi(ppSelect.second[0].c_str());
+    select = new eoDetTournamentSelect(detSize);
+  }
+  else if (ppSelect.first == std::string("StochTour"))
+    {
+      double p;
+      if (!ppSelect.second.size())   // no parameter added
+	{
+	  std::cerr << "WARNING, no parameter passed to StochTour, using 1" << std::endl;
+	  p = 1;
+	  // put back p in parameter for consistency (and status file)
+	  ppSelect.second.push_back(std::string("1"));
+	}
+      else	  // parameter passed by user as DetTour(T)
+	p = atof(ppSelect.second[0].c_str());
+      
+      select = new eoStochTournamentSelect(p);
+    }
+  else if (ppSelect.first == std::string("Ranking"))
+    {
+      double p,e;
+      if (ppSelect.second.size()==2)   // 2 parameters: pressure and exponent
+	{
+	  p = atof(ppSelect.second[0].c_str());
+	  e = atof(ppSelect.second[1].c_str());
+	}
+      else if (ppSelect.second.size()==1)   // 1 parameter: pressure 
+	{
+	  std::cerr << "WARNING, no exponent to Ranking, using 1" << std::endl;
+	  e = 1;
+	  ppSelect.second.push_back(std::string("1"));
+	  p = atof(ppSelect.second[0].c_str());
+	}
+      else // no parameters ... or garbage
+	{
+	  std::cerr << "WARNING, no parameter to Ranking, using (2,1)" << std::endl;
+	  p=2;
+	  e=1;
+	  // put back in parameter for consistency (and status file)
+	  ppSelect.second.resize(2); // just in case
+	  ppSelect.second[0] = (std::string("2"));
+	  ppSelect.second[1] = (std::string("1"));
+	}
+      // check for authorized values
+      // pressure in (0,1]
+      if ( (p<=1) || (p>2) )
+	{
+	  std::cerr << "WARNING, selective pressure must be in (1,2] in Ranking, using 2\n";
+	  p=2;
+	  ppSelect.second[0] = (std::string("2"));
+	}
+      // exponent >0
+      if (e<=0)
+	{
+	  std::cerr << "WARNING, exponent must be positive in Ranking, using 1\n";
+	  e=1;
+	  ppSelect.second[1] = (std::string("1"));
+	}
+      // now we're OK
+      eoPerf2Worth & p2w = _state.storeFunctor( new eoRanking(p,e) );
+      select = new eoRouletteWorthSelect(p2w);
+    }
+  else if (ppSelect.first == std::string("Sequential")) // one after the other
+    {
+      bool b;
+      if (ppSelect.second.size() == 0)   // no argument -> default = ordered
+	{
+	  b=true;
+	  // put back in parameter for consistency (and status file)
+	  ppSelect.second.push_back(std::string("ordered"));
+	}
+      else
+	b = !(ppSelect.second[0] == std::string("unordered"));
+      select = new eoSequentialSelect(b);
+    }
+  else if (ppSelect.first == std::string("EliteSequential")) // Best first, one after the other in random order afterwards
+    {
+      select = new eoEliteSequentialSelect;
+    }
+  else if (ppSelect.first == std::string("Roulette")) // no argument (yet)
+    {
+      select = new eoProportionalSelect;
+    }
+  else if (ppSelect.first == std::string("Random")) // no argument
+    {
+      select = new eoRandomSelect;
+    }
+  else
+    {
+      std::string stmp = std::string("Invalid selection: ") + ppSelect.first;
+      throw std::runtime_error(stmp.c_str());
+    }
+
+  _state.storeFunctor(select);
+
+  // the number of offspring 
+    eoValueParam& offspringRateParam =  _parser.createParam(eoHowMany(1.0), "nbOffspring", "Nb of offspring (percentage or absolute)", 'O', "Evolution Engine");
+
+  /////////////////////////////////////////////////////
+  // the replacement
+  /////////////////////////////////////////////////////
+
+  /** Replacement type - high level: predefined replacements
+   * ESComma : 
+   *          elite = 0
+   *          surviveParents=0 (no reduce)
+   *          surviveOffspring=100% (no reduce)
+   *          reduceFinal = Deterministic
+   *
+   * ESPlus : idem, except for
+   *          surviveParents = 100%
+   *
+   * GGA : generational GA - idem ESComma except for
+   *          offspringRate = 100%
+   *          all reducers are unused
+   * 
+   * SSGA(T/t) : Steady-State GA  
+   *               surviveParents = 1.0 - offspringRate
+   *               reduceFinal = DetTour(T>1) ou StochTour(0.5 * ptReplace;
+
+  // first, separate G3 and MGG
+  // maybe one day we have a common class - but is it really necessary???
+  if (replacementParam.first == std::string("G3"))
+    {
+    // reduce the parents: by default, survive parents = -2 === 2 parents die
+    eoHowMany surviveParents =  _parser.createParam(eoHowMany(-2,false), "surviveParents", "Nb of surviving parents (percentage or absolute)", '\0', "Evolution Engine / Replacement").value();
+    // at the moment, this is the only argument
+    ptReplace = new eoG3Replacement(-surviveParents);    // must receive nb of eliminated parets!
+    _state.storeFunctor(ptReplace);
+    }
+  else  if (replacementParam.first == std::string("MGG"))
+    {
+      float t;
+      unsigned tSize;
+    // reduce the parents: by default, survive parents = -2 === 2 parents die
+    eoHowMany surviveParents =  _parser.createParam(eoHowMany(-2,false), "surviveParents", "Nb of surviving parents (percentage or absolute)", '\0', "Evolution Engine / Replacement").value();
+    // the tournament size
+    if (!replacementParam.second.size())   // no parameter added
+      {
+	std::cerr << "WARNING, no parameter passed to MGG replacement, using 2" << std::endl;
+	tSize = 2;
+	// put back 2 in parameter for consistency (and status file)
+	replacementParam.second.push_back(std::string("2"));
+      }
+    else
+      {
+	t = atof(replacementParam.second[0].c_str());
+	if (t>=2)
+	  {			   // build the appropriate deafult value
+	    tSize = unsigned(t);
+	  }
+	else
+	  {
+	    throw std::runtime_error("Sorry, only deterministic tournament available at the moment");
+	  }
+      }
+    ptReplace = new eoMGGReplacement(-surviveParents, tSize);    
+    _state.storeFunctor(ptReplace);
+    }
+  else {   // until the end of what was the only loop/switch
+    
+  // the default deafult values
+  eoHowMany elite (0.0);
+  bool strongElitism (false);
+  eoHowMany surviveParents (0.0);
+  eoParamParamType reduceParentType ("Deterministic");
+  eoHowMany surviveOffspring (1.0);
+  eoParamParamType reduceOffspringType ("Deterministic");
+  eoParamParamType reduceFinalType ("Deterministic");
+
+  // depending on the value entered by the user, change some of the above
+  double t;
+
+  // ---------- General
+  if (replacementParam.first == std::string("General"))
+  {
+    ;				   // defaults OK
+  }
+  // ---------- ESComma
+  else if (replacementParam.first == std::string("ESComma"))
+  {
+    ;				   // OK too
+  }
+  // ---------- ESPlus
+  else if (replacementParam.first == std::string("ESPlus"))
+  {
+    surviveParents = eoHowMany(1.0);
+  }
+  // ---------- Generational
+  else if (replacementParam.first == std::string("Generational"))
+  {
+    ;			     // OK too (we should check nb of offspring)
+  }
+  // ---------- EP
+  else if (replacementParam.first == std::string("EP"))
+  {
+    if (!replacementParam.second.size())   // no parameter added
+      {
+	std::cerr << "WARNING, no parameter passed to EP replacement, using 6" << std::endl;
+	// put back 6 in parameter for consistency (and status file)
+	replacementParam.second.push_back(std::string("6"));
+      }
+    // by coincidence, the syntax for the EP reducer is the same than here:
+    reduceFinalType = replacementParam;
+    surviveParents = eoHowMany(1.0);
+  }
+  // ---------- SSGA
+  else if (replacementParam.first == std::string("SSGA"))
+  {
+    if (!replacementParam.second.size())   // no parameter added
+      {
+	std::cerr << "WARNING, no parameter passed to SSGA replacement, using 2" << std::endl;
+	// put back 2 in parameter for consistency (and status file)
+	replacementParam.second.push_back(std::string("2"));
+	reduceParentType = eoParamParamType(std::string("DetTour(2)"));
+      }
+    else
+      {
+	t = atof(replacementParam.second[0].c_str());
+	if (t>=2)
+	  {			   // build the appropriate deafult value
+	    reduceParentType = eoParamParamType(std::string("DetTour(") + replacementParam.second[0].c_str() + ")");
+	  }
+	else   // check for [0.5,1] will be made in make_general_replacement
+	  {			   // build the appropriate deafult value
+	    reduceParentType = eoParamParamType(std::string("StochTour(") + replacementParam.second[0].c_str() + ")");
+	  }
+      }
+    // 
+    surviveParents = eoHowMany(-1);
+    surviveOffspring = eoHowMany(1);
+  }
+  else		       // no replacement recognized
+    {
+      throw std::runtime_error("Invalid replacement type " + replacementParam.first);
+    }
+
+  ptReplace = & make_general_replacement(
+     _parser, _state, elite, strongElitism, surviveParents, reduceParentType, surviveOffspring, reduceOffspringType, reduceFinalType);
+
+  } // end of the ugly construct due to G3 and MGG - totaly heterogeneous at the moment
+
+
+  ///////////////////////////////
+  // the general breeder
+  ///////////////////////////////
+  eoGeneralBreeder *breed = 
+    new eoGeneralBreeder(*select, _op, offspringRateParam.value());
+  _state.storeFunctor(breed);
+
+  ///////////////////////////////
+  // now the eoEasyEA
+  ///////////////////////////////
+  eoAlgo *algo = new eoEasyEA(_continue, _eval, *breed, *ptReplace);
+  _state.storeFunctor(algo);
+  // that's it!
+  return *algo;
+}
+
+#endif
diff --git a/trunk/paradiseo-eo/src/do/make_algo_pareto.h b/trunk/paradiseo-eo/src/do/make_algo_pareto.h
new file mode 100644
index 000000000..6231e4fee
--- /dev/null
+++ b/trunk/paradiseo-eo/src/do/make_algo_pareto.h
@@ -0,0 +1,203 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_algo_pareto.h
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2002
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@inria.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _make_algo_pareto_h
+#define _make_algo_pareto_h
+
+#include "utils/eoData.h"     // for eo_is_a_rate
+// everything tha's needed for the algorithms - SCALAR fitness
+
+// Selection
+// the eoSelectOne's
+#include "eoSelectFromWorth.h"
+#include "eoNDSorting.h"
+
+// Breeders
+#include "eoGeneralBreeder.h"
+
+// Replacement - at the moment limited to eoNDPlusReplacement, locally defined
+#include "eoReplacement.h"
+
+template 
+class eoNDPlusReplacement : public eoReplacement
+{
+public:
+  eoNDPlusReplacement(eoPerf2Worth& _perf2worth) : perf2worth(_perf2worth) {}
+
+  struct WorthPair : public std::pair
+  {
+    bool operator<(const WorthPair& other) const { return other.first < this->first; }
+  };
+
+  void operator()(eoPop& _parents, eoPop& _offspring)
+  {
+    unsigned sz = _parents.size();
+    _parents.reserve(_parents.size() + _offspring.size());
+    copy(_offspring.begin(), _offspring.end(), back_inserter(_parents));
+
+    // calculate worths
+    perf2worth(_parents);
+    perf2worth.sort_pop(_parents);
+    perf2worth.resize(_parents, sz);
+
+    _offspring.clear();
+  }
+
+private :
+  eoPerf2Worth& perf2worth;
+};
+
+
+// Algorithm (only this one needed)
+#include "eoEasyEA.h"
+
+  // also need the parser and param includes
+#include "utils/eoParser.h"
+#include "utils/eoState.h"
+
+
+/*
+ * This function builds the algorithm (i.e. selection and replacement)
+ *      from existing continue (or checkpoint) and operators
+ *
+ * It uses a parser (to get user parameters) and a state (to store the memory)
+ * the last argument is an individual, needed for 2 reasons
+ *     it disambiguates the call after instanciations
+ *     some operator might need some private information about the indis
+ *
+ * This is why the template is the complete EOT even though only the fitness
+ * is actually templatized here
+*/
+
+template 
+eoAlgo & do_make_algo_pareto(eoParser& _parser, eoState& _state, eoEvalFunc& _eval, eoContinue& _continue, eoGenOp& _op)
+{
+  // the selection
+  std::string & selStr = _parser.createParam(std::string("NSGA-II"), "selCrit", "Pareto Selection Criterion: NSGA, NSGA-II, ParetoRanking", 'S', "Evolution Engine").value();
+  double nicheSize = _parser.createParam(1.0, "nicheSize", "Size of niche for NSGA-I", '\0', "Evolution Engine").value();
+  eoPerf2Worth *p2w;
+  if ( (selStr == std::string("NSGA")) || (selStr == std::string("NSGA-I") ) )
+    p2w = new eoNDSorting_I(nicheSize);
+  else   if (selStr == std::string("NSGA-II"))
+    p2w = new eoNDSorting_II();
+  else   if (selStr == std::string("ParetoRanking"))
+    {
+      eoDominanceMap&  dominance = _state.storeFunctor(new eoDominanceMap);
+    p2w = new eoParetoRanking(dominance);
+    }
+
+  _state.storeFunctor(p2w);
+
+  // now the selector (from p2w) - cut-and-pasted from make_algo_scalar!
+  // only all classes are now ...FromWorth ...
+  // only the ranking is not re-implemented (yet?)
+  eoValueParam& selectionParam = _parser.createParam(eoParamParamType("DetTour(2)"), "selection", "Selection: Roulette, DetTour(T), StochTour(t) or Random", 'S', "Evolution Engine");
+
+  eoParamParamType & ppSelect = selectionParam.value(); // std::pair >
+
+  eoSelectOne* select ;
+  if (ppSelect.first == std::string("DetTour")) 
+  {
+    unsigned detSize;
+
+    if (!ppSelect.second.size())   // no parameter added
+      {
+	std::cerr << "WARNING, no parameter passed to DetTour, using 2" << std::endl;
+	detSize = 2;
+	// put back 2 in parameter for consistency (and status file)
+	ppSelect.second.push_back(std::string("2"));
+      }
+    else	  // parameter passed by user as DetTour(T)
+      detSize = atoi(ppSelect.second[0].c_str());
+    select = new eoDetTournamentWorthSelect(*p2w, detSize);
+  }
+  else if (ppSelect.first == std::string("StochTour"))
+    {
+      double p;
+      if (!ppSelect.second.size())   // no parameter added
+	{
+	  std::cerr << "WARNING, no parameter passed to StochTour, using 1" << std::endl;
+	  p = 1;
+	  // put back p in parameter for consistency (and status file)
+	  ppSelect.second.push_back(std::string("1"));
+	}
+      else	  // parameter passed by user as DetTour(T)
+	p = atof(ppSelect.second[0].c_str());
+      
+      select = new eoStochTournamentWorthSelect(*p2w, p);
+    }
+//   else if (ppSelect.first == std::string("Sequential")) // one after the other
+//     {
+//       bool b;
+//       if (ppSelect.second.size() == 0)   // no argument -> default = ordered
+// 	{
+// 	  b=true;
+// 	  // put back in parameter for consistency (and status file)
+// 	  ppSelect.second.push_back(std::string("ordered"));
+// 	}
+//       else
+// 	b = !(ppSelect.second[0] == std::string("unordered"));
+//       select = new eoSequentialWorthSelect(b);
+//     }
+  else if (ppSelect.first == std::string("Roulette")) // no argument (yet)
+    {
+      select = new eoRouletteWorthSelect(*p2w);
+    }
+  else if (ppSelect.first == std::string("Random")) // no argument, no perf2Worth
+    {
+      select = new eoRandomSelect;
+    }
+  else
+    {
+      std::string stmp = std::string("Invalid selection: ") + ppSelect.first;
+      throw std::runtime_error(stmp.c_str());
+    }
+
+  _state.storeFunctor(select);
+
+
+  // the number of offspring 
+    eoValueParam& offspringRateParam =  _parser.createParam(eoHowMany(1.0), "nbOffspring", "Nb of offspring (percentage or absolute)", 'O', "Evolution Engine");
+
+  // the replacement
+    // actually limited to eoNDPlusReplacement
+  eoReplacement & replace = _state.storeFunctor(
+           new eoNDPlusReplacement(*p2w)
+	   );
+
+  // the general breeder
+  eoGeneralBreeder *breed = 
+    new eoGeneralBreeder(*select, _op, offspringRateParam.value());
+  _state.storeFunctor(breed);
+
+  // now the eoEasyEA
+  eoAlgo *algo = new eoEasyEA(_continue, _eval, *breed, replace);
+  _state.storeFunctor(algo);
+  // that's it!
+  return *algo;
+}
+
+#endif
diff --git a/trunk/paradiseo-eo/src/do/make_algo_scalar.h b/trunk/paradiseo-eo/src/do/make_algo_scalar.h
new file mode 100644
index 000000000..7dfebe3a0
--- /dev/null
+++ b/trunk/paradiseo-eo/src/do/make_algo_scalar.h
@@ -0,0 +1,311 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_algo_scalar.h
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _make_algo_scalar_h
+#define _make_algo_scalar_h
+
+#include      // for eo_is_a_rate
+// everything tha's needed for the algorithms - SCALAR fitness
+
+// Selection
+// the eoSelectOne's
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+
+// Breeders
+#include 
+
+// Replacement
+// #include 
+#include 
+#include 
+#include 
+
+// distance
+#include 
+
+// Algorithm (only this one needed)
+#include 
+
+  // also need the parser and param includes
+#include 
+#include 
+
+
+/*
+ * This function builds the algorithm (i.e. selection and replacement)
+ *      from existing continue (or checkpoint) and operators
+ *
+ * It uses a parser (to get user parameters) and a state (to store the memory)
+ * the last argument is an individual, needed for 2 reasons
+ *     it disambiguates the call after instanciations
+ *     some operator might need some private information about the indis
+ *
+ * This is why the template is the complete EOT even though only the fitness
+ * is actually templatized here
+*/
+
+
+template 
+eoAlgo & do_make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc& _eval, eoContinue& _continue, eoGenOp& _op, eoDistance * _dist = NULL)
+{
+  // the selection : help and comment depend on whether or not a distance is passed
+  std::string comment;
+  if (_dist == NULL)
+    comment = "Selection: DetTour(T), StochTour(t), Roulette, Ranking(p,e) or Sequential(ordered/unordered)";
+      else
+	comment = "Selection: DetTour(T), StochTour(t), Roulette, Ranking(p,e), Sharing(sigma_share) or Sequential(ordered/unordered)";
+
+  eoValueParam& selectionParam = _parser.createParam(eoParamParamType("DetTour(2)"), "selection", comment, 'S', "Evolution Engine");
+
+  eoParamParamType & ppSelect = selectionParam.value(); // std::pair >
+
+  eoSelectOne* select ;
+  if (ppSelect.first == std::string("DetTour")) 
+  {
+    unsigned detSize;
+
+    if (!ppSelect.second.size())   // no parameter added
+      {
+	std::cerr << "WARNING, no parameter passed to DetTour, using 2" << std::endl;
+	detSize = 2;
+	// put back 2 in parameter for consistency (and status file)
+	ppSelect.second.push_back(std::string("2"));
+      }
+    else	  // parameter passed by user as DetTour(T)
+      detSize = atoi(ppSelect.second[0].c_str());
+    select = new eoDetTournamentSelect(detSize);
+  }
+  else if (ppSelect.first == std::string("Sharing")) 
+  {
+    double nicheSize;
+
+    if (!ppSelect.second.size())   // no parameter added
+      {
+	std::cerr << "WARNING, no parameter passed to Sharing, using 0.5" << std::endl;
+	nicheSize = 0.5;
+	// put back 2 in parameter for consistency (and status file)
+	ppSelect.second.push_back(std::string("0.5"));
+      }
+    else	  // parameter passed by user as DetTour(T)
+      nicheSize = atof(ppSelect.second[0].c_str());
+    if (_dist == NULL)		   // no distance
+          throw std::runtime_error("You didn't specify a distance when calling make_algo_scalar and using sharing");
+    select = new eoSharingSelect(nicheSize, *_dist);
+  }
+  else if (ppSelect.first == std::string("StochTour"))
+    {
+      double p;
+      if (!ppSelect.second.size())   // no parameter added
+	{
+	  std::cerr << "WARNING, no parameter passed to StochTour, using 1" << std::endl;
+	  p = 1;
+	  // put back p in parameter for consistency (and status file)
+	  ppSelect.second.push_back(std::string("1"));
+	}
+      else	  // parameter passed by user as DetTour(T)
+	p = atof(ppSelect.second[0].c_str());
+      
+      select = new eoStochTournamentSelect(p);
+    }
+  else if (ppSelect.first == std::string("Ranking"))
+    {
+      double p,e;
+      if (ppSelect.second.size()==2)   // 2 parameters: pressure and exponent
+	{
+	  p = atof(ppSelect.second[0].c_str());
+	  e = atof(ppSelect.second[1].c_str());
+	}
+      else if (ppSelect.second.size()==1)   // 1 parameter: pressure 
+	{
+	  std::cerr << "WARNING, no exponent to Ranking, using 1" << std::endl;
+	  e = 1;
+	  ppSelect.second.push_back(std::string("1"));
+	  p = atof(ppSelect.second[0].c_str());
+	}
+      else // no parameters ... or garbage
+	{
+	  std::cerr << "WARNING, no parameter to Ranking, using (2,1)" << std::endl;
+	  p=2;
+	  e=1;
+	  // put back in parameter for consistency (and status file)
+	  ppSelect.second.resize(2); // just in case
+	  ppSelect.second[0] = (std::string("2"));
+	  ppSelect.second[1] = (std::string("1"));
+	}
+      // check for authorized values
+      // pressure in (0,1]
+      if ( (p<=1) || (p>2) )
+	{
+	  std::cerr << "WARNING, selective pressure must be in (0,1] in Ranking, using 2\n";
+	  p=2;
+	  ppSelect.second[0] = (std::string("2"));
+	}
+      // exponent >0
+      if (e<=0)
+	{
+	  std::cerr << "WARNING, exponent must be positive in Ranking, using 1\n";
+	  e=1;
+	  ppSelect.second[1] = (std::string("1"));
+	}
+      // now we're OK
+      eoPerf2Worth & p2w = _state.storeFunctor( new eoRanking(p,e) );
+      select = new eoRouletteWorthSelect(p2w);
+    }
+  else if (ppSelect.first == std::string("Sequential")) // one after the other
+    {
+      bool b;
+      if (ppSelect.second.size() == 0)   // no argument -> default = ordered
+	{
+	  b=true;
+	  // put back in parameter for consistency (and status file)
+	  ppSelect.second.push_back(std::string("ordered"));
+	}
+      else
+	b = !(ppSelect.second[0] == std::string("unordered"));
+      select = new eoSequentialSelect(b);
+    }
+  else if (ppSelect.first == std::string("Roulette")) // no argument (yet)
+    {
+      select = new eoProportionalSelect;
+    }
+  else if (ppSelect.first == std::string("Random")) // no argument
+    {
+      select = new eoRandomSelect;
+    }
+  else
+    {
+      std::string stmp = std::string("Invalid selection: ") + ppSelect.first;
+      throw std::runtime_error(stmp.c_str());
+    }
+
+  _state.storeFunctor(select);
+
+  // the number of offspring 
+    eoValueParam& offspringRateParam =  _parser.createParam(eoHowMany(1.0), "nbOffspring", "Nb of offspring (percentage or absolute)", 'O', "Evolution Engine");
+
+  // the replacement
+  eoValueParam& replacementParam = _parser.createParam(eoParamParamType("Comma"), "replacement", "Replacement: Comma, Plus or EPTour(T), SSGAWorst, SSGADet(T), SSGAStoch(t)", 'R', "Evolution Engine");
+
+  eoParamParamType & ppReplace = replacementParam.value(); // std::pair >
+
+  eoReplacement* replace ;
+  if (ppReplace.first == std::string("Comma")) // Comma == generational
+  {
+    replace = new eoCommaReplacement;
+  }
+  else if (ppReplace.first == std::string("Plus"))
+    {
+      replace = new eoPlusReplacement;
+    }
+  else if (ppReplace.first == std::string("EPTour"))
+    {
+      unsigned detSize;
+      
+      if (!ppReplace.second.size())   // no parameter added
+	{
+	  std::cerr << "WARNING, no parameter passed to EPTour, using 6" << std::endl;
+	  detSize = 6;
+	  // put back in parameter for consistency (and status file)
+	  ppReplace.second.push_back(std::string("6"));
+	}
+      else	  // parameter passed by user as EPTour(T)
+	detSize = atoi(ppSelect.second[0].c_str());
+
+      replace = new eoEPReplacement(detSize);
+    }
+  else if (ppReplace.first == std::string("SSGAWorst"))
+    {
+      replace = new eoSSGAWorseReplacement;
+    }
+  else if (ppReplace.first == std::string("SSGADet"))
+    {
+      unsigned detSize;
+      
+      if (!ppReplace.second.size())   // no parameter added
+	{
+	  std::cerr << "WARNING, no parameter passed to SSGADet, using 2" << std::endl;
+	  detSize = 2;
+	  // put back in parameter for consistency (and status file)
+	  ppReplace.second.push_back(std::string("2"));
+	}
+      else	  // parameter passed by user as SSGADet(T)
+	detSize = atoi(ppSelect.second[0].c_str());
+      
+      replace = new eoSSGADetTournamentReplacement(detSize);
+    }
+  else if (ppReplace.first == std::string("SSGAStoch"))
+    {
+      double p;
+      if (!ppReplace.second.size())   // no parameter added
+	{
+	  std::cerr << "WARNING, no parameter passed to SSGAStoch, using 1" << std::endl;
+	  p = 1;
+	  // put back in parameter for consistency (and status file)
+	  ppReplace.second.push_back(std::string("1"));
+	}
+      else	  // parameter passed by user as SSGADet(T)
+	p = atof(ppSelect.second[0].c_str());
+      
+      replace = new eoSSGAStochTournamentReplacement(p);
+    }
+  else
+    {
+      std::string stmp = std::string("Invalid replacement: ") + ppReplace.first;
+      throw std::runtime_error(stmp.c_str());
+    }
+
+  _state.storeFunctor(replace);
+
+  // adding weak elitism
+  eoValueParam& weakElitismParam =  _parser.createParam(false, "weakElitism", "Old best parent replaces new worst offspring *if necessary*", 'w', "Evolution Engine");
+  if (weakElitismParam.value())
+    {
+      eoReplacement *replaceTmp = replace;
+      replace = new eoWeakElitistReplacement(*replaceTmp);
+      _state.storeFunctor(replace);
+    }      
+
+  // the general breeder
+  eoGeneralBreeder *breed = 
+    new eoGeneralBreeder(*select, _op, offspringRateParam.value());
+  _state.storeFunctor(breed);
+
+  // now the eoEasyEA
+  eoAlgo *algo = new eoEasyEA(_continue, _eval, *breed, *replace);
+  _state.storeFunctor(algo);
+  // that's it!
+  return *algo;
+}
+
+#endif
diff --git a/trunk/paradiseo-eo/src/do/make_checkpoint.h b/trunk/paradiseo-eo/src/do/make_checkpoint.h
new file mode 100644
index 000000000..93488ac8b
--- /dev/null
+++ b/trunk/paradiseo-eo/src/do/make_checkpoint.h
@@ -0,0 +1,291 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_checkpoint.h
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2000
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _make_checkpoint_h
+#define _make_checkpoint_h
+
+#include 
+#include  // for minimizing_fitness()
+#include 
+#include 
+#include 
+
+// at the moment, in utils/make_help.cpp
+// this should become some eoUtils.cpp with corresponding eoUtils.h
+bool testDirRes(std::string _dirName, bool _erase);
+/////////////////// The checkpoint and other I/O //////////////
+
+
+template 
+eoCheckPoint& do_make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter& _eval, eoContinue& _continue)
+{
+  // first, create a checkpoint from the eoContinue
+  eoCheckPoint *checkpoint = new eoCheckPoint(_continue);
+  _state.storeFunctor(checkpoint);
+
+  ///////////////////
+  // Counters
+  //////////////////
+  // is nb Eval to be used as counter?
+  eoValueParam& useEvalParam = _parser.createParam(true, "useEval", "Use nb of eval. as counter (vs nb of gen.)", '\0', "Output");
+  eoValueParam& useTimeParam = _parser.createParam(true, "useTime", "Display time (s) every generation", '\0', "Output");
+
+  // if we want the time, we need an eoTimeCounter
+  eoTimeCounter * tCounter = NULL;
+
+  // Create anyway a generation-counter
+  // Recent change (03/2002): it is now an eoIncrementorParam, both
+  // a parameter AND updater so you can store it into the eoState
+  eoIncrementorParam *generationCounter = new eoIncrementorParam("Gen.");
+  // store it in the state
+  _state.storeFunctor(generationCounter);
+  // And add it to the checkpoint,
+  checkpoint->add(*generationCounter);
+
+    // dir for DISK output
+    eoValueParam& dirNameParam =  _parser.createParam(std::string("Res"), "resDir", "Directory to store DISK outputs", '\0', "Output - Disk");
+    // shoudl we empty it if exists
+    eoValueParam& eraseParam = _parser.createParam(true, "eraseDir", "erase files in dirName if any", '\0', "Output - Disk");
+    bool dirOK = false;		   // not tested yet
+
+    /////////////////////////////////////////
+    // now some statistics on the population:
+    /////////////////////////////////////////
+    /**
+     * existing stats as of today, April 10. 2001
+     *
+     * eoBestFitnessStat : best value in pop - type EOT::Fitness
+     * eoAverageStat     : average value in pop - type EOT::Fitness
+     * eoSecondMomentStat: average + stdev - type std::pair
+     * eoSortedPopStat   : whole population - type std::string (!!)
+     * eoScalarFitnessStat: the fitnesses - type std::vector
+     */
+
+    // Best fitness in population
+    //---------------------------
+    eoValueParam& printBestParam = _parser.createParam(true, "printBestStat", "Print Best/avg/stdev every gen.", '\0', "Output");
+    eoValueParam& plotBestParam = _parser.createParam(false, "plotBestStat", "Plot Best/avg Stat", '\0', "Output - Graphical");
+    eoValueParam& fileBestParam = _parser.createParam(false, "fileBestStat", "Output bes/avg/std to file", '\0', "Output - Disk");
+
+    eoBestFitnessStat *bestStat = NULL;
+    if ( printBestParam.value() || plotBestParam.value() || fileBestParam.value() )
+      // we need the bestStat for at least one of the 3 above
+      {
+	bestStat = new eoBestFitnessStat;
+	// store it
+	_state.storeFunctor(bestStat);
+	// add it to the checkpoint
+	checkpoint->add(*bestStat);
+      }
+
+    // Average fitness alone
+    //----------------------
+    eoAverageStat *averageStat = NULL; // do we need averageStat?
+    if ( plotBestParam.value() ) // we need it for gnuplot output
+      {
+	averageStat = new eoAverageStat;
+	// store it
+	_state.storeFunctor(averageStat);
+	// add it to the checkpoint
+	checkpoint->add(*averageStat);
+      }
+
+    // Second moment stats: average and stdev
+    //---------------------------------------
+    eoSecondMomentStats *secondStat = NULL;
+    if ( printBestParam.value() ) // we need it for sreen output
+      {
+	secondStat = new eoSecondMomentStats;
+	// store it
+	_state.storeFunctor(secondStat);
+	// add it to the checkpoint
+	checkpoint->add(*secondStat);
+      }
+
+
+    // Dump of the whole population
+    //-----------------------------
+    eoSortedPopStat *popStat = NULL;
+    eoValueParam& printPopParam = _parser.createParam(false, "printPop", "Print sorted pop. every gen.", '\0', "Output");
+    if ( printPopParam.value() ) // we do want pop dump
+      {
+	  popStat = new eoSortedPopStat;
+	// store it
+	_state.storeFunctor(popStat);
+	// add it to the checkpoint
+	checkpoint->add(*popStat);
+      }
+
+
+    // do we wnat some histogram of fitnesses snpashots?
+    eoValueParam plotHistogramParam = _parser.createParam(false, "plotHisto", "Plot histogram of fitnesses", '\0', "Output - Graphical");
+
+    ///////////////
+    // The monitors
+    ///////////////
+    // do we want an eoStdoutMonitor?
+    bool needStdoutMonitor = printBestParam.value()
+	|| printPopParam.value() ;
+
+    // The Stdout monitor will print parameters to the screen ...
+    if ( needStdoutMonitor )
+      {
+	eoStdoutMonitor *monitor = new eoStdoutMonitor(false);
+	_state.storeFunctor(monitor);
+
+	// when called by the checkpoint (i.e. at every generation)
+	checkpoint->add(*monitor);
+
+	// the monitor will output a series of parameters: add them
+	monitor->add(*generationCounter);
+	if (useEvalParam.value()) // we want nb of evaluations
+	      monitor->add(_eval);
+	if (useTimeParam.value()) // we want time
+	  {
+	    tCounter = new eoTimeCounter;
+	    _state.storeFunctor(tCounter);
+	    checkpoint->add(*tCounter);
+	    monitor->add(*tCounter);
+	  }
+	if (printBestParam.value())
+	    {
+		monitor->add(*bestStat);
+		monitor->add(*secondStat);
+	    }
+	if ( printPopParam.value())
+	  monitor->add(*popStat);
+      }
+
+    // first handle the dir test - if we need at least one file
+    if ( ( fileBestParam.value() || plotBestParam.value() ||
+	   plotHistogramParam.value() )
+	 && !dirOK )		   // just in case we add something before
+      dirOK = testDirRes(dirNameParam.value(), eraseParam.value()); // TRUE
+
+    if (fileBestParam.value())    // A file monitor for best & secondMoment
+      {
+#ifdef _MSVC
+	std::string stmp = dirNameParam.value() + "\best.xg";
+#else
+	std::string stmp = dirNameParam.value() + "/best.xg";
+#endif
+	eoFileMonitor *fileMonitor = new eoFileMonitor(stmp);
+	// save and give to checkpoint
+	_state.storeFunctor(fileMonitor);
+	checkpoint->add(*fileMonitor);
+	// and feed with some statistics
+	fileMonitor->add(*generationCounter);
+	fileMonitor->add(_eval);
+	if (tCounter)		   // we want the time as well
+	  {
+	    //	    std::cout << "On met timecounter\n";
+	    fileMonitor->add(*tCounter);
+	  }
+	fileMonitor->add(*bestStat);
+	fileMonitor->add(*secondStat);
+      }
+
+    if (plotBestParam.value())    // an eoGnuplot1DMonitor for best & average
+      {
+	std::string stmp = dirNameParam.value() + "/gnu_best.xg";
+	eoGnuplot1DMonitor *gnuMonitor = new eoGnuplot1DMonitor(stmp,minimizing_fitness());
+	// save and give to checkpoint
+	_state.storeFunctor(gnuMonitor);
+	checkpoint->add(*gnuMonitor);
+	// and feed with some statistics
+	if (useEvalParam.value())  // do we want eval as X coordinate
+	  gnuMonitor->add(_eval);
+	else if (tCounter)	   // or time?
+	  gnuMonitor->add(*tCounter);
+	else			   // default: generation
+	  gnuMonitor->add(*generationCounter);
+	gnuMonitor->add(*bestStat);
+	gnuMonitor->add(*averageStat);
+      }
+
+    // historgram?
+    if (plotHistogramParam.value()) // want to see how the fitness is spread?
+      {
+	eoScalarFitnessStat *fitStat = new eoScalarFitnessStat;
+	_state.storeFunctor(fitStat);
+	checkpoint->add(*fitStat);
+	// a gnuplot-based monitor for snapshots: needs a dir name
+	eoGnuplot1DSnapshot *fitSnapshot = new eoGnuplot1DSnapshot(dirNameParam.value());
+	_state.storeFunctor(fitSnapshot);
+	// add any stat that is a std::vector to it
+	fitSnapshot->add(*fitStat);
+	// and of course add it to the checkpoint
+	checkpoint->add(*fitSnapshot);
+      }
+
+    //////////////////////////////////
+    // State savers
+    //////////////////////////////
+
+    // feed the state to state savers
+    // save state every N  generation
+    eoValueParam& saveFrequencyParam = _parser.createParam(unsigned(0), "saveFrequency", "Save every F generation (0 = only final state, absent = never)", '\0', "Persistence" );
+
+    if (_parser.isItThere(saveFrequencyParam))
+    {
+      // first make sure dirName is OK
+      if (! dirOK )
+	dirOK = testDirRes(dirNameParam.value(), eraseParam.value()); // TRUE
+
+      unsigned freq = (saveFrequencyParam.value()>0 ? saveFrequencyParam.value() : UINT_MAX );
+#ifdef _MSVC
+      std::string stmp = dirNameParam.value() + "\generations";
+#else
+      std::string stmp = dirNameParam.value() + "/generations";
+#endif
+      eoCountedStateSaver *stateSaver1 = new eoCountedStateSaver(freq, _state, stmp);
+      _state.storeFunctor(stateSaver1);
+    checkpoint->add(*stateSaver1);
+    }
+
+    // save state every T seconds
+    eoValueParam& saveTimeIntervalParam = _parser.createParam(unsigned(0), "saveTimeInterval", "Save every T seconds (0 or absent = never)", '\0',"Persistence" );
+    if (_parser.isItThere(saveTimeIntervalParam) && saveTimeIntervalParam.value()>0)
+    {
+      // first make sure dirName is OK
+      if (! dirOK )
+	dirOK = testDirRes(dirNameParam.value(), eraseParam.value()); // TRUE
+
+#ifdef _MSVC
+      std::string stmp = dirNameParam.value() + "\time";
+#else
+      std::string stmp = dirNameParam.value() + "/time";
+#endif
+      eoTimedStateSaver *stateSaver2 = new eoTimedStateSaver(saveTimeIntervalParam.value(), _state, stmp);
+      _state.storeFunctor(stateSaver2);
+      checkpoint->add(*stateSaver2);
+    }
+
+    // and that's it for the (control and) output
+    return *checkpoint;
+}
+
+#endif
diff --git a/trunk/paradiseo-eo/src/do/make_checkpoint_FDC.h b/trunk/paradiseo-eo/src/do/make_checkpoint_FDC.h
new file mode 100644
index 000000000..d198c9dd7
--- /dev/null
+++ b/trunk/paradiseo-eo/src/do/make_checkpoint_FDC.h
@@ -0,0 +1,298 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_checkpoint.h
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2000
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _make_checkpoint_h
+#define _make_checkpoint_h
+
+#include 
+#include  // for minimizing_fitness()
+#include 
+#include 
+#include 
+
+// at the moment, in utils/make_help.cpp
+// this should become some eoUtils.cpp with corresponding eoUtils.h
+bool testDirRes(std::string _dirName, bool _erase);
+/////////////////// The checkpoint and other I/O //////////////
+
+
+template 
+eoCheckPoint& do_make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter& _eval, eoContinue& _continue)
+{
+  // first, create a checkpoint from the eoContinue
+  eoCheckPoint *checkpoint = new eoCheckPoint(_continue);
+  _state.storeFunctor(checkpoint);
+
+  ///////////////////
+  // Counters
+  //////////////////
+  // is nb Eval to be used as counter?
+  eoValueParam& useEvalParam = _parser.createParam(true, "useEval", "Use nb of eval. as counter (vs nb of gen.)", '\0', "Output");
+
+    // Create anyway a generation-counter parameter
+    eoValueParam *generationCounter = new eoValueParam(0, "Gen.");
+    // Create an incrementor (sub-class of eoUpdater).
+    eoIncrementor* increment = new eoIncrementor(generationCounter->value());
+    // Add it to the checkpoint, 
+    checkpoint->add(*increment);
+    // and store it in the state
+    _state.storeFunctor(increment);
+
+    // dir for DISK output
+    eoValueParam& dirNameParam =  _parser.createParam(std::string("Res"), "resDir", "Directory to store DISK outputs", '\0', "Output - Disk");
+    // shoudl we empty it if exists
+    eoValueParam& eraseParam = _parser.createParam(false, "eraseDir", "erase files in dirName if any", '\0', "Output - Disk");
+    bool dirOK = false;		   // not tested yet
+
+    /////////////////////////////////////////
+    // now some statistics on the population:
+    /////////////////////////////////////////
+    /**
+     * existing stats as of today, April 10. 2001
+     *
+     * eoBestFitnessStat : best value in pop - type EOT::Fitness
+     * eoAverageStat     : average value in pop - type EOT::Fitness
+     * eoSecondMomentStat: average + stdev - type std::pair
+     * eoSortedPopStat   : whole population - type std::string (!!)
+     * eoScalarFitnessStat: the fitnesses - type std::vector
+     * eoDFCSTat         : FDC wrt best in pop or absolute best - type double
+     *                     requires an eoDistance. See eoFDCStat.h
+     *                     also computes all elements for the FDC scatter plot
+     */
+
+    // Best fitness in population
+    //---------------------------
+    eoValueParam& printBestParam = _parser.createParam(true, "printBestStat", "Print Best/avg/stdev every gen.", '\0', "Output");
+    eoValueParam& plotBestParam = _parser.createParam(false, "plotBestStat", "Plot Best/avg Stat", '\0', "Output - Graphical");
+    eoValueParam& fileBestParam = _parser.createParam(false, "fileBestStat", "Output bes/avg/std to file", '\0', "Output - Disk");
+
+    eoBestFitnessStat *bestStat = NULL;
+    if ( printBestParam.value() || plotBestParam.value() || fileBestParam.value() ) 
+      // we need the bestStat for at least one of the 3 above
+      {
+	bestStat = new eoBestFitnessStat;
+	// store it
+	_state.storeFunctor(bestStat);
+	// add it to the checkpoint
+	checkpoint->add(*bestStat);
+      }
+
+    // Average fitness alone
+    //----------------------
+    eoAverageStat *averageStat = NULL; // do we need averageStat?
+    if ( plotBestParam.value() ) // we need it for gnuplot output
+      {
+	averageStat = new eoAverageStat;
+	// store it
+	_state.storeFunctor(averageStat);
+	// add it to the checkpoint
+	checkpoint->add(*averageStat);
+      }
+
+    // Second moment stats: average and stdev
+    //---------------------------------------
+    eoSecondMomentStats *secondStat = NULL;
+    if ( printBestParam.value() ) // we need it for sreen output
+      {
+	secondStat = new eoSecondMomentStats;
+	// store it
+	_state.storeFunctor(secondStat);
+	// add it to the checkpoint
+	checkpoint->add(*secondStat);
+      }
+
+
+    // Dump of the whole population
+    //-----------------------------
+    eoSortedPopStat *popStat = NULL;
+    eoValueParam& printPopParam = _parser.createParam(false, "printPop", "Print sorted pop. every gen.", '\0', "Output");
+    if ( printPopParam.value() ) // we do want pop dump
+      {
+	  popStat = new eoSortedPopStat("Dump of whole population");
+	// store it
+	_state.storeFunctor(popStat);
+	// add it to the checkpoint
+	checkpoint->add(*popStat);
+      }
+
+
+    // the Fitness Distance Correlation
+    //---------------------------------
+    eoValueParam& printFDCParam = _parser.createParam(true, "printFDC", "Print FDC coeff. every gen.", '\0', "Output");
+    eoValueParam& plotFDCParam = _parser.createParam(false, "plotFDCStat", "Plot FDC scatter plot", '\0', "Output - Graphical");
+
+    eoFDCStat *fdcStat = NULL;
+    if ( printFDCParam.value() || plotFDCParam.value() ) // we need FDCStat
+      {
+	// need first an object to compute the distances - here Hamming dist.
+	eoQuadDistance *dist = new eoQuadDistance;
+	_state.storeFunctor(dist);
+	fdcStat = new eoFDCStat(*dist);
+	// storeFunctor it
+	_state.storeFunctor(fdcStat);
+	// add it to the checkpoint
+	checkpoint->add(*fdcStat);
+      }
+
+    // do we wnat some histogram of fitnesses snpashots?
+    eoValueParam plotHistogramParam = _parser.createParam(false, "plotHisto", "Plot histogram of fitnesses", '\0', "Output - Graphical");
+
+    ///////////////
+    // The monitors
+    ///////////////
+    // do we want an eoStdoutMonitor?
+    bool needStdoutMonitor = printBestParam.value() || printFDCParam.value() 
+	|| printPopParam.value() ;
+
+    // The Stdout monitor will print parameters to the screen ...  
+    if ( needStdoutMonitor ) 
+      {
+	eoStdoutMonitor *monitor = new eoStdoutMonitor(false);
+	_state.storeFunctor(monitor);
+
+	// when called by the checkpoint (i.e. at every generation)
+	checkpoint->add(*monitor);
+
+	// the monitor will output a series of parameters: add them
+	monitor->add(*generationCounter);
+	if (useEvalParam.value()) // we want nb of evaluations
+	      monitor->add(_eval);
+	if (printBestParam.value())
+	    {
+		monitor->add(*bestStat);
+		monitor->add(*secondStat);
+	    }
+	if (printFDCParam.value())
+	  monitor->add(*fdcStat);
+	if ( printPopParam.value())
+	  monitor->add(*popStat);
+      }
+
+    // first handle the dir test - if we need at least one file
+    if ( ( fileBestParam.value() || plotBestParam.value() || 
+	   plotFDCParam.value() || plotHistogramParam.value() )
+	 && !dirOK )		   // just in case we add something before
+      dirOK = testDirRes(dirNameParam.value(), eraseParam.value()); // TRUE
+
+    if (fileBestParam.value())    // A file monitor for best & secondMoment
+      {
+	std::string stmp = dirNameParam.value() + "/best.xg";
+	eoFileMonitor *fileMonitor = new eoFileMonitor(stmp);
+	// save and give to checkpoint
+	_state.storeFunctor(fileMonitor);
+	checkpoint->add(*fileMonitor);
+	// and feed with some statistics
+	fileMonitor->add(*generationCounter);
+	fileMonitor->add(_eval);
+	fileMonitor->add(*bestStat); 
+	fileMonitor->add(*secondStat);
+      }
+
+    if (plotBestParam.value())    // an eoGnuplot1DMonitor for best & average
+      {
+	std::string stmp = dirNameParam.value() + "_gnu_best.xg";
+	eoGnuplot1DMonitor *gnuMonitor = new eoGnuplot1DMonitor(stmp,minimizing_fitness());
+	// save and give to checkpoint
+	_state.storeFunctor(gnuMonitor);
+	checkpoint->add(*gnuMonitor);
+	// and feed with some statistics
+	if (useEvalParam.value())
+	  gnuMonitor->add(_eval);
+	else
+	  gnuMonitor->add(*generationCounter);
+	gnuMonitor->add(*bestStat);
+	gnuMonitor->add(*averageStat);
+      }
+
+    if (plotFDCParam.value())    // a specific plot monitor for FDC
+      {
+	// first into a file (it adds everything ti itself
+	eoFDCFileSnapshot *fdcFileSnapshot = new eoFDCFileSnapshot(*fdcStat, dirNameParam.value());
+	_state.storeFunctor(fdcFileSnapshot);
+	// then to a Gnuplot monitor
+	eoGnuplot1DSnapshot *fdcGnuplot = new eoGnuplot1DSnapshot(*fdcFileSnapshot);
+	_state.storeFunctor(fdcGnuplot);
+	
+	// and of course add them to the checkPoint
+	checkpoint->add(*fdcFileSnapshot);
+	checkpoint->add(*fdcGnuplot);
+      }
+
+    // historgram?
+    if (plotHistogramParam.value()) // want to see how the fitness is spread?
+      {
+	eoScalarFitnessStat *fitStat = new eoScalarFitnessStat;
+	_state.storeFunctor(fitStat);
+	checkpoint->add(*fitStat);
+	// a gnuplot-based monitor for snapshots: needs a dir name
+	eoGnuplot1DSnapshot *fitSnapshot = new eoGnuplot1DSnapshot(dirNameParam.value());
+	_state.storeFunctor(fitSnapshot);
+	// add any stat that is a std::vector to it
+	fitSnapshot->add(*fitStat);
+	// and of course add it to the checkpoint
+	checkpoint->add(*fitSnapshot);
+      }
+
+    //////////////////////////////////
+    // State savers
+    //////////////////////////////
+
+    // feed the state to state savers
+    // save state every N  generation
+    eoValueParam& saveFrequencyParam = _parser.createParam(unsigned(0), "saveFrequency", "Save every F generation (0 = only final state, absent = never)", '\0', "Persistence" );
+
+    if (_parser.isItThere(saveFrequencyParam))
+    {
+      // first make sure dirName is OK
+      if (! dirOK )
+	dirOK = testDirRes(dirNameParam.value(), eraseParam.value()); // TRUE
+
+      unsigned freq = (saveFrequencyParam.value()>0 ? saveFrequencyParam.value() : UINT_MAX );
+      std::string stmp = dirNameParam.value() + "/generations";
+      eoCountedStateSaver *stateSaver1 = new eoCountedStateSaver(freq, _state, stmp); 
+      _state.storeFunctor(stateSaver1);
+    checkpoint->add(*stateSaver1);
+    }
+
+    // save state every T seconds 
+    eoValueParam& saveTimeIntervalParam = _parser.createParam(unsigned(0), "saveTimeInterval", "Save every T seconds (0 or absent = never)", '\0',"Persistence" );
+    if (_parser.isItThere(saveTimeIntervalParam) && saveTimeIntervalParam.value()>0)
+    {
+      // first make sure dirName is OK
+      if (! dirOK )
+	dirOK = testDirRes(dirNameParam.value(), eraseParam.value()); // TRUE
+
+      std::string stmp = dirNameParam.value() + "/time";
+      eoTimedStateSaver *stateSaver2 = new eoTimedStateSaver(saveTimeIntervalParam.value(), _state, stmp); 
+      _state.storeFunctor(stateSaver2);
+      checkpoint->add(*stateSaver2);
+    }
+
+    // and that's it for the (control and) output
+    return *checkpoint;
+}
+
+#endif
diff --git a/trunk/paradiseo-eo/src/do/make_checkpoint_assembled.h b/trunk/paradiseo-eo/src/do/make_checkpoint_assembled.h
new file mode 100644
index 000000000..c28cd0663
--- /dev/null
+++ b/trunk/paradiseo-eo/src/do/make_checkpoint_assembled.h
@@ -0,0 +1,202 @@
+ /* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- */
+
+//-----------------------------------------------------------------------------
+// make_checkpoint_assembled.h
+// Marc Wintermantel & Oliver Koenig
+// IMES-ST@ETHZ.CH
+// March 2003
+
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@inria.fr
+             mak@dhi.dk
+*/
+//-----------------------------------------------------------------------------
+
+#ifndef _make_checkpoint_assembled_h
+#define _make_checkpoint_assembled_h
+
+#include 
+#include 
+
+#include 
+#include 
+#include 
+#include 
+#include 
+
+// at the moment, in utils/make_help.cpp
+// this should become some eoUtils.cpp with corresponding eoUtils.h
+bool testDirRes(std::string _dirName, bool _erase);
+/////////////////// The checkpoint and other I/O //////////////
+
+/** Of course, Fitness needs to be an eoScalarFitnessAssembled!!! */
+template 
+eoCheckPoint& do_make_checkpoint_assembled(eoParser& _parser, eoState& _state, eoEvalFuncCounter& _eval, eoContinue& _continue)
+{
+
+    // SOME PARSER PARAMETERS
+    // ----------------------
+    std::string dirName = _parser.getORcreateParam(std::string("Res"), "resDir",
+                                                   "Directory to store DISK outputs",
+                                                   '\0', "Output").value();
+    bool erase = _parser.getORcreateParam(true, "eraseDir",
+                                          "Erase files in dirName if any",
+                                          '\0', "Output").value();
+    bool gnuplots = _parser.getORcreateParam(true, "plots",
+                                             "Plot stuff using GnuPlot",
+                                             '\0', "Output").value();
+    bool printFile = _parser.getORcreateParam(true, "printFile",
+                                              "Print statistics file",
+                                              '\0', "Output").value();
+
+  eoValueParam& saveFrequencyParam
+      = _parser.getORcreateParam(unsigned(0), "saveFrequency",
+                                 "Save every F generation (0 = only final state, absent = never)",
+                                 '\0', "Persistence" );
+
+  testDirRes(dirName, erase); // TRUE
+
+  // CREATE CHECKPOINT FROM eoContinue
+  // ---------------------------------
+  eoCheckPoint *checkpoint = new eoCheckPoint(_continue);
+  _state.storeFunctor(checkpoint);
+
+  // GENERATIONS
+  // -----------
+  eoIncrementorParam *generationCounter = new eoIncrementorParam("Gen.");
+  _state.storeFunctor(generationCounter);
+  checkpoint->add(*generationCounter);
+
+  // TIME
+  // ----
+  eoTimeCounter * tCounter = NULL;
+  tCounter = new eoTimeCounter;
+  _state.storeFunctor(tCounter);
+  checkpoint->add(*tCounter);
+
+  // ACCESS DESCRIPTIONS OF TERMS OF FITNESS CLASS
+  // ---------------------------------------------
+  // define a temporary fitness instance
+  typedef typename EOT::Fitness Fit;
+  Fit fit;
+  std::vector fitness_descriptions = fit.getDescriptionVector();
+  unsigned nTerms = fitness_descriptions.size();
+
+  // STAT VALUES OF A POPULATION
+  // ---------------------------
+
+  // average vals
+  std::vector* > avgvals( nTerms );
+  for (unsigned i=0; i < nTerms; ++i){
+    std::string descr = "Avg. of " + fitness_descriptions[i];
+    avgvals[i] = new eoAssembledFitnessAverageStat(i, descr);
+    _state.storeFunctor( avgvals[i] );
+    checkpoint->add( *avgvals[i] );
+  }
+
+  // best vals
+  std::vector* > bestvals( nTerms );
+  for (unsigned j=0; j < nTerms; ++j){
+    std::string descr = fitness_descriptions[j] + " of best ind.";
+    bestvals[j] = new eoAssembledFitnessBestStat(j, descr);
+    _state.storeFunctor( bestvals[j] );
+    checkpoint->add( *bestvals[j] );
+  }
+
+  // STDOUT
+  // ------
+  eoStdoutMonitor *monitor = new eoStdoutMonitor(false);
+  _state.storeFunctor(monitor);
+  checkpoint->add(*monitor);
+  monitor->add(*generationCounter);
+  monitor->add(_eval);
+  monitor->add(*tCounter);
+
+  // Add best fitness
+  monitor->add( *bestvals[0] );
+
+  // Add all average vals
+  for (unsigned l=0; l < nTerms; ++l)
+    monitor->add( *avgvals[l] );
+
+  // GNUPLOT
+  // -------
+  if (gnuplots ){
+    std::string stmp;
+
+    // Histogramm of the different fitness vals
+    eoScalarFitnessStat *fitStat = new eoScalarFitnessStat;
+    _state.storeFunctor(fitStat);
+    checkpoint->add(*fitStat);
+    // a gnuplot-based monitor for snapshots: needs a dir name
+    eoGnuplot1DSnapshot *fitSnapshot = new eoGnuplot1DSnapshot(dirName);
+    _state.storeFunctor(fitSnapshot);
+    // add any stat that is a vector to it
+    fitSnapshot->add(*fitStat);
+    // and of course add it to the checkpoint
+    checkpoint->add(*fitSnapshot);
+
+    std::vector gnumonitors(nTerms, NULL );
+    for (unsigned k=0; k < nTerms; ++k){
+      stmp = dirName + "/gnuplot_" + fitness_descriptions[k] + ".xg";
+      gnumonitors[k] = new eoGnuplot1DMonitor(stmp,true);
+      _state.storeFunctor(gnumonitors[k]);
+      checkpoint->add(*gnumonitors[k]);
+      gnumonitors[k]->add(*generationCounter);
+      gnumonitors[k]->add(*bestvals[k]);
+      gnumonitors[k]->add(*avgvals[k]);
+    }
+
+  }
+
+  // WRITE STUFF TO FILE
+  // -------------------
+  if( printFile ){
+    std::string stmp2 = dirName + "/eoStatistics.sav";
+    eoFileMonitor *fileMonitor = new eoFileMonitor(stmp2);
+    _state.storeFunctor(fileMonitor);
+    checkpoint->add(*fileMonitor);
+    fileMonitor->add(*generationCounter);
+    fileMonitor->add(_eval);
+    fileMonitor->add(*tCounter);
+
+    for (unsigned i=0; i < nTerms; ++i){
+      fileMonitor->add(*bestvals[i]);
+      fileMonitor->add(*avgvals[i]);
+    }
+
+  }
+
+  // STATE SAVER
+  // -----------
+  // feed the state to state savers
+
+  if (_parser.isItThere(saveFrequencyParam)) {
+
+    unsigned freq = (saveFrequencyParam.value() > 0 ? saveFrequencyParam.value() : UINT_MAX );
+    std::string stmp = dirName + "/generations";
+    eoCountedStateSaver *stateSaver1 = new eoCountedStateSaver(freq, _state, stmp);
+    _state.storeFunctor(stateSaver1);
+    checkpoint->add(*stateSaver1);
+  }
+
+  // and that's it for the (control and) output
+  return *checkpoint;
+}
+
+#endif
diff --git a/trunk/paradiseo-eo/src/do/make_checkpoint_pareto.h b/trunk/paradiseo-eo/src/do/make_checkpoint_pareto.h
new file mode 100644
index 000000000..715f395a3
--- /dev/null
+++ b/trunk/paradiseo-eo/src/do/make_checkpoint_pareto.h
@@ -0,0 +1,247 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_checkpoint_pareto.h
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2000
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@inria.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _make_checkpoint_pareto_h
+#define _make_checkpoint_pareto_h
+
+#include 
+#include 
+
+#include "EO.h"
+#include "eoParetoFitness.h"
+#include "eoEvalFuncCounter.h"
+#include "utils/checkpointing"
+#include "utils/selectors.h"
+
+// at the moment, in utils/make_help.cpp
+// this should become some eoUtils.cpp with corresponding eoUtils.h
+bool testDirRes(std::string _dirName, bool _erase);
+/////////////////// The checkpoint and other I/O //////////////
+
+/** Of course, Fitness needs to be an eoParetoFitness!!!
+ */
+template 
+eoCheckPoint& do_make_checkpoint_pareto(eoParser& _parser, eoState& _state,
+                                             eoEvalFuncCounter& _eval, eoContinue& _continue)
+{
+    // first, create a checkpoint from the eoContinue - and store in _state
+    eoCheckPoint & checkpoint = _state.storeFunctor(new eoCheckPoint(_continue));
+
+    /////// get number of obectives from Fitness - not very elegant
+    typedef typename EOT::Fitness Fit;
+    Fit fit;
+    unsigned nObj = fit.size();
+
+    ///////////////////
+    // Counters
+    //////////////////
+    // is nb Eval to be used as counter?
+    bool useEval = _parser.getORcreateParam(true, "useEval",
+                                            "Use nb of eval. as counter (vs nb of gen.)",
+                                            '\0', "Output").value();
+
+    // Create anyway a generation-counter parameter WARNING: not stored anywhere!!!
+    eoValueParam *generationCounter = new eoValueParam(0, "Gen.");
+    // Create an incrementor (sub-class of eoUpdater).
+    eoIncrementor & increment =
+      _state.storeFunctor(new eoIncrementor(generationCounter->value()) );
+    // Add it to the checkpoint,
+    checkpoint.add(increment);
+
+    // dir for DISK output
+    std::string & dirName =  _parser.getORcreateParam(std::string("Res"), "resDir",
+                                                      "Directory to store DISK outputs",
+                                                      '\0', "Output - Disk").value();
+    // shoudl we empty it if exists
+    eoValueParam& eraseParam = _parser.getORcreateParam(true, "eraseDir",
+                                                              "erase files in dirName if any",
+                                                              '\0', "Output - Disk");
+    bool dirOK = false;		   // not tested yet
+
+    /////////////////////////////////////////
+    // now some statistics on the population:
+    /////////////////////////////////////////
+    /**
+     * existing stats for Pareto as of today, Jan. 31. 2002
+     *
+     * eoSortedPopStat   : whole population - type std::string (!!)
+     */
+
+    eoValueParam& fPlotParam
+        = _parser.getORcreateParam(eoParamParamType("1(0,1)"), "frontFileFrequency",
+      "File save frequency in objective spaces (std::pairs of comma-separated objectives " \
+      "in 1 single parentheses std::pair)",
+                                   '\0', "Output - Disk");
+
+    bool boolGnuplot = _parser.getORcreateParam(false, "plotFront",
+                                                "Objective plots (requires corresponding files " \
+                                                "- see frontFileFrequency",
+                                                '\0', "Output - Graphical").value();
+
+    eoParamParamType & fPlot = fPlotParam.value(); // std::pair >
+    unsigned frequency = atoi(fPlot.first.c_str());
+    if (frequency)		   // something to plot
+    {
+      unsigned nbPlot = fPlot.second.size();
+      if ( nbPlot % 2 )		   // odd!
+	throw std::runtime_error("Odd number of front description in make_checkpoint_pareto");
+
+      // only create the necessary stats
+      std::vector bStat(nObj, false); // track of who's already there
+      std::vector* > theStats(nObj);
+
+      // first create the stats
+      for (unsigned i=0; i* fStat;
+	  if (!bStat[obj1]) {		   // not already there: create it
+	      std::ostringstream os;
+	      os << "Obj. " << obj1 << std::ends;
+	      fStat = new eoMOFitnessStat(obj1, os.str().c_str());
+	      _state.storeFunctor(fStat);
+	      bStat[obj1]=true;
+	      theStats[obj1]=fStat;
+	      checkpoint.add(*fStat);
+          }
+	  if (!bStat[obj2]) {		   // not already there: create it
+	      std::ostringstream os;
+	      os << "Obj. " << obj2 << std::ends;
+	      fStat = new eoMOFitnessStat(obj2, os.str().c_str());
+	      _state.storeFunctor(fStat);
+	      bStat[obj2]=true;
+	      theStats[obj2]=fStat;
+	      checkpoint.add(*fStat);
+          }
+
+	  // then the fileSnapshots
+          std::ostringstream os;
+	  os << "Front." << obj1 << "." << obj2 << "." << std::ends;
+	  eoFileSnapshot& snapshot = _state.storeFunctor(
+              new eoFileSnapshot(dirName, frequency, os.str().c_str()));
+	  checkpoint.add(snapshot);
+
+	  snapshot.add(*theStats[obj1]);
+	  snapshot.add(*theStats[obj2]);
+
+	  // and create the gnuplotter from the fileSnapshot
+	  if(boolGnuplot)
+	    {
+	      eoGnuplot1DSnapshot & plotSnapshot = _state.storeFunctor(new
+		    eoGnuplot1DSnapshot(snapshot));
+	      plotSnapshot.setPointSize(3);
+	      checkpoint.add(plotSnapshot);
+	    }
+	}
+    }
+    // Dump of the whole population
+    //-----------------------------
+    bool printPop = _parser.getORcreateParam(false, "printPop",
+                                             "Print sorted pop. every gen.",
+                                             '\0', "Output").value();
+    eoSortedPopStat * popStat;
+    if ( printPop ) // we do want pop dump
+      {
+	std::cout << "On cree printpop\n";
+	popStat = & _state.storeFunctor(new eoSortedPopStat);
+	// add it to the checkpoint
+	checkpoint.add(*popStat);
+      }
+
+    ///////////////
+    // The monitors
+    ///////////////
+    // do we want an eoStdoutMonitor?
+    bool needStdoutMonitor = printPop ;	// only this one at the moment
+
+    // The Stdout monitor will print parameters to the screen ...
+    if ( needStdoutMonitor )
+      {
+	eoStdoutMonitor & monitor = _state.storeFunctor(new eoStdoutMonitor(false));
+
+	// when called by the checkpoint (i.e. at every generation)
+	checkpoint.add(monitor);
+
+	// the monitor will output a series of parameters: add them
+	monitor.add(*generationCounter);
+	if (useEval) // we want nb of evaluations
+	  monitor.add(_eval);
+	if ( printPop)
+	  monitor.add(*popStat);
+      }
+
+
+    //////////////////////////////////
+    // State savers
+    //////////////////////////////
+
+    // feed the state to state savers
+    // save state every N  generation
+    eoValueParam& saveFrequencyParam = _parser.createParam(unsigned(0), "saveFrequency", "Save every F generation (0 = only final state, absent = never)", '\0', "Persistence" );
+
+    if (_parser.isItThere(saveFrequencyParam))
+    {
+      // first make sure dirName is OK
+      if (! dirOK )
+	dirOK = testDirRes(dirName, eraseParam.value()); // TRUE
+
+      unsigned freq = (saveFrequencyParam.value()>0 ? saveFrequencyParam.value() : UINT_MAX );
+#ifdef _MSVC
+      std::string stmp = dirName + "\generations";
+#else
+      std::string stmp = dirName + "/generations";
+#endif
+      eoCountedStateSaver *stateSaver1 = new eoCountedStateSaver(freq, _state, stmp);
+      _state.storeFunctor(stateSaver1);
+    checkpoint.add(*stateSaver1);
+    }
+
+    // save state every T seconds
+    eoValueParam& saveTimeIntervalParam
+        = _parser.getORcreateParam(unsigned(0), "saveTimeInterval",
+                                   "Save every T seconds (0 or absent = never)", '\0',"Persistence" );
+    if (_parser.isItThere(saveTimeIntervalParam) && saveTimeIntervalParam.value()>0)
+    {
+      // first make sure dirName is OK
+      if (! dirOK )
+	dirOK = testDirRes(dirName, eraseParam.value()); // TRUE
+
+#ifdef _MSVC
+      std::string stmp = dirName + "\time";
+#else
+      std::string stmp = dirName + "/time";
+#endif
+      eoTimedStateSaver *stateSaver2 = new eoTimedStateSaver(saveTimeIntervalParam.value(), _state, stmp);
+      _state.storeFunctor(stateSaver2);
+      checkpoint.add(*stateSaver2);
+    }
+
+    // and that's it for the (control and) output
+    return checkpoint;
+}
+
+#endif
diff --git a/trunk/paradiseo-eo/src/do/make_continue.h b/trunk/paradiseo-eo/src/do/make_continue.h
new file mode 100644
index 000000000..7dbce4a2a
--- /dev/null
+++ b/trunk/paradiseo-eo/src/do/make_continue.h
@@ -0,0 +1,160 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_continue.h
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2000
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _make_continue_h
+#define _make_continue_h
+
+/*
+Contains the templatized version of parser-based choice of stopping criterion
+It can then be instantiated, and compiled on its own for a given EOType
+(see e.g. in dir ga, ga.cpp)
+*/
+
+// Continuators - all include eoContinue.h
+#include 
+#include 
+#include 
+#include 
+#include 
+#ifndef _MSC_VER
+#include   // CtrlC handling (using 2 global variables!)
+#endif
+
+  // also need the parser and param includes
+#include 
+#include 
+
+
+/////////////////// the stopping criterion ////////////////
+template 
+eoCombinedContinue * make_combinedContinue(eoCombinedContinue *_combined, eoContinue *_cont)
+{
+  if (_combined)		   // already exists
+    _combined->add(*_cont);
+  else
+    _combined = new eoCombinedContinue(*_cont);
+  return _combined;
+}
+
+template 
+eoContinue & do_make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter & _eval)
+{
+  //////////// Stopping criterion ///////////////////
+  // the combined continue - to be filled
+  eoCombinedContinue *continuator = NULL;
+
+  // for each possible criterion, check if wanted, otherwise do nothing
+
+  // First the eoGenContinue - need a default value so you can run blind
+  // but we also need to be able to avoid it <--> 0
+  eoValueParam& maxGenParam = _parser.getORcreateParam(unsigned(100), "maxGen", "Maximum number of generations () = none)",'G',"Stopping criterion");
+
+    if (maxGenParam.value()) // positive: -> define and store
+      {
+	eoGenContinue *genCont = new eoGenContinue(maxGenParam.value());
+	_state.storeFunctor(genCont);
+	// and "add" to combined
+	continuator = make_combinedContinue(continuator, genCont);
+      }
+
+  // the steadyGen continue - only if user imput
+  eoValueParam& steadyGenParam = _parser.createParam(unsigned(100), "steadyGen", "Number of generations with no improvement",'s', "Stopping criterion");
+  eoValueParam& minGenParam = _parser.createParam(unsigned(0), "minGen", "Minimum number of generations",'g', "Stopping criterion");
+    if (_parser.isItThere(steadyGenParam))
+      {
+	eoSteadyFitContinue *steadyCont = new eoSteadyFitContinue
+	  (minGenParam.value(), steadyGenParam.value());
+	// store
+	_state.storeFunctor(steadyCont);
+	// add to combinedContinue
+	continuator = make_combinedContinue(continuator, steadyCont);
+      }
+
+  // Same thing with Eval - but here default value is 0
+  eoValueParam& maxEvalParam
+      = _parser.getORcreateParam((unsigned long)0, "maxEval",
+                                 "Maximum number of evaluations (0 = none)",
+                                 'E', "Stopping criterion");
+
+    if (maxEvalParam.value()) // positive: -> define and store
+      {
+	eoEvalContinue *evalCont = new eoEvalContinue(_eval, maxEvalParam.value());
+	_state.storeFunctor(evalCont);
+	// and "add" to combined
+	continuator = make_combinedContinue(continuator, evalCont);
+      }
+    /*
+  // the steadyEval continue - only if user imput
+  eoValueParam& steadyGenParam = _parser.createParam(unsigned(100), "steadyGen", "Number of generations with no improvement",'s', "Stopping criterion");
+  eoValueParam& minGenParam = _parser.createParam(unsigned(0), "minGen", "Minimum number of generations",'g', "Stopping criterion");
+    if (_parser.isItThere(steadyGenParam))
+      {
+	eoSteadyGenContinue *steadyCont = new eoSteadyFitContinue
+	  (minGenParam.value(), steadyGenParam.value());
+	// store
+	_state.storeFunctor(steadyCont);
+	// add to combinedContinue
+	continuator = make_combinedContinue(continuator, steadyCont);
+      }
+    */
+    // the target fitness
+    eoFitContinue *fitCont;
+    eoValueParam& targetFitnessParam = _parser.createParam(double(0.0), "targetFitness", "Stop when fitness reaches",'T', "Stopping criterion");
+    if (_parser.isItThere(targetFitnessParam))
+      {
+	fitCont = new eoFitContinue
+	  (targetFitnessParam.value());
+	// store
+	_state.storeFunctor(fitCont);
+	// add to combinedContinue
+	continuator = make_combinedContinue(continuator, fitCont);
+      }
+
+#ifndef _MSC_VER
+    // the CtrlC interception (Linux only I'm afraid)
+    eoCtrlCContinue *ctrlCCont;
+    eoValueParam& ctrlCParam = _parser.createParam(false, "CtrlC", "Terminate current generation upon Ctrl C",'C', "Stopping criterion");
+    if (ctrlCParam.value())
+      {
+	ctrlCCont = new eoCtrlCContinue;
+	// store
+	_state.storeFunctor(ctrlCCont);
+	// add to combinedContinue
+	continuator = make_combinedContinue(continuator, ctrlCCont);
+      }
+#endif
+
+    // now check that there is at least one!
+    if (!continuator)
+      throw std::runtime_error("You MUST provide a stopping criterion");
+  // OK, it's there: store in the eoState
+  _state.storeFunctor(continuator);
+
+  // and return
+    return *continuator;
+}
+
+#endif
diff --git a/trunk/paradiseo-eo/src/do/make_continue_pareto.h b/trunk/paradiseo-eo/src/do/make_continue_pareto.h
new file mode 100644
index 000000000..364f60574
--- /dev/null
+++ b/trunk/paradiseo-eo/src/do/make_continue_pareto.h
@@ -0,0 +1,108 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_continue_pareto.h
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2000
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@inria.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _make_continue_pareto_h
+#define _make_continue_pareto_h
+
+/*
+Contains the templatized version of parser-based choice of stopping criterion
+for Pareto optimization (e.g. no "... without improvement" criterion
+It can then be instantiated, and compiled on its own for a given EOType
+(see e.g. in dir ga, ga.cpp)
+*/
+
+// Continuators - all include eoContinue.h
+#include 
+#include 
+#include 
+#include 
+#ifndef _MSC_VER
+#include   // CtrlC handling (using 2 global variables!)
+#endif
+
+  // also need the parser and param includes
+#include 
+#include 
+
+
+/////////////////// helper function ////////////////
+template 
+eoCombinedContinue * make_combinedContinue(eoCombinedContinue *_combined, eoContinue *_cont)
+{
+  if (_combined)		   // already exists
+    _combined->add(*_cont);
+  else
+    _combined = new eoCombinedContinue(*_cont);
+  return _combined;
+}
+
+///////////// The make_continue function
+template 
+eoContinue & do_make_continue_pareto(eoParser& _parser, eoState& _state, eoEvalFuncCounter & _eval)
+{
+  //////////// Stopping criterion ///////////////////
+  // the combined continue - to be filled
+  eoCombinedContinue *continuator = NULL;
+
+  // for each possible criterion, check if wanted, otherwise do nothing
+
+  // First the eoGenContinue - need a default value so you can run blind
+  // but we also need to be able to avoid it <--> 0
+  eoValueParam& maxGenParam = _parser.createParam(unsigned(100), "maxGen", "Maximum number of generations () = none)",'G',"Stopping criterion");
+
+    if (maxGenParam.value()) // positive: -> define and store
+      {
+	eoGenContinue *genCont = new eoGenContinue(maxGenParam.value());
+	_state.storeFunctor(genCont);
+	// and "add" to combined
+	continuator = make_combinedContinue(continuator, genCont);
+      }
+
+#ifndef _MSC_VER
+    // the CtrlC interception (Linux only I'm afraid)
+    eoCtrlCContinue *ctrlCCont;
+    eoValueParam& ctrlCParam = _parser.createParam(true, "CtrlC", "Terminate current generation upon Ctrl C",'C', "Stopping criterion");
+    if (_parser.isItThere(ctrlCParam))
+      {
+	ctrlCCont = new eoCtrlCContinue;
+	// store
+	_state.storeFunctor(ctrlCCont);
+	// add to combinedContinue
+	continuator = make_combinedContinue(continuator, ctrlCCont);
+      }
+#endif
+
+    // now check that there is at least one!
+    if (!continuator)
+      throw std::runtime_error("You MUST provide a stopping criterion");
+  // OK, it's there: store in the eoState
+  _state.storeFunctor(continuator);
+
+  // and return
+    return *continuator;
+}
+
+#endif
diff --git a/trunk/paradiseo-eo/src/do/make_general_replacement.h b/trunk/paradiseo-eo/src/do/make_general_replacement.h
new file mode 100644
index 000000000..dfefb649b
--- /dev/null
+++ b/trunk/paradiseo-eo/src/do/make_general_replacement.h
@@ -0,0 +1,181 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_general_replacement.h
+// (c) Marc Schoenauer and Pierre Collet, 2002
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _make_general_replacement_h
+#define _make_general_replacement_h
+
+#include      // for eo_is_a_rate
+
+// Replacement
+#include 
+
+// also need the parser and param includes
+#include 
+#include 
+
+
+/** a helper function that decodes a parameter read by the parser into an
+ * eoReduce & (allocates the pointer and stores it into an eoState)
+ */
+template 
+eoReduce & decode_reduce(eoParamParamType & _ppReduce, eoState & _state)
+{
+  unsigned int detSize;
+  eoReduce * ptReduce;
+
+  // ---------- Deterministic
+  if ( (_ppReduce.first == std::string("Deterministic")) || 
+       (_ppReduce.first == std::string("Sequential")) 
+       )
+  {
+    ptReduce = new eoTruncate;
+  }
+  // ---------- EP
+  else if (_ppReduce.first == std::string("EP"))
+  {
+    if (!_ppReduce.second.size())   // no parameter added
+    {
+      std::cerr << "WARNING, no parameter passed to EP, using 6" << std::endl;
+      detSize = 6;
+      // put back 6 in parameter for consistency (and status file)
+      _ppReduce.second.push_back(std::string("6"));
+    }
+    else	  // parameter passed by user as EP(T)
+      detSize = atoi(_ppReduce.second[0].c_str());
+    ptReduce = new eoEPReduce(detSize);
+  }
+  // ---------- DetTour
+  else if (_ppReduce.first == std::string("DetTour"))
+  {
+    if (!_ppReduce.second.size())   // no parameter added
+      {
+	std::cerr << "WARNING, no parameter passed to DetTour, using 2" << std::endl;
+	detSize = 2;
+	// put back 2 in parameter for consistency (and status file)
+	_ppReduce.second.push_back(std::string("2"));
+      }
+    else	  // parameter passed by user as DetTour(T)
+      detSize = atoi(_ppReduce.second[0].c_str());
+    ptReduce = new eoDetTournamentTruncate(detSize);
+  }
+  else if (_ppReduce.first == std::string("StochTour"))
+    {
+      double p;
+      if (!_ppReduce.second.size())   // no parameter added
+	{
+	  std::cerr << "WARNING, no parameter passed to StochTour, using 1" << std::endl;
+	  p = 1;
+	  // put back p in parameter for consistency (and status file)
+	  _ppReduce.second.push_back(std::string("1"));
+	}
+      else	  // parameter passed by user as DetTour(T)
+	{
+	  p = atof(_ppReduce.second[0].c_str());
+	  if ( (p<=0.5) || (p>1) )
+	    throw std::runtime_error("Stochastic tournament size should be in [0.5,1]");
+	}
+      
+      ptReduce = new eoStochTournamentTruncate(p);
+    }
+  else if ( (_ppReduce.first == std::string("Uniform")) || 
+	    (_ppReduce.first == std::string("Random"))
+	    )
+    {
+      ptReduce = new eoRandomReduce;
+    }
+  else // no known reduction entered
+    {
+      throw std::runtime_error("Unknown reducer: " + _ppReduce.first);
+    }
+  // all done, stores and return a reference
+  _state.storeFunctor(ptReduce);
+  return (*ptReduce);
+}
+
+/** Helper function that creates a replacement from the class 
+ * eoReduceMergeReduce using 6 parameters 
+ *      (after the usual eoState and eoParser)
+ * 
+ *  eoHowMany _elite              the number of elite parents (0 = no elitism)
+ *       see below
+ *  bool _strongElitism           if elite > 0, std::string elitism or weak elitism
+ *       strong = elite parents survive, whatever the offspring
+ *       weak - elite patents compete AFTER replacement with best offspring
+ *  eoHowMany _surviveParents     number of parents after parents recuction
+ *  eoParamParamType & _reduceParentType      how the parents are reduced
+ *  eoHowMany _surviveOffspring   number of offspring after offspring recuction
+ *  eoParamParamType & _reduceOffspringType   how the offspring are reduced
+ *  eoParamParamType & _reduceFinalType       how the final population is reduced to initial population size
+ */
+
+template 
+eoReplacement & make_general_replacement(
+    eoParser& _parser, eoState& _state, 
+    eoHowMany _elite = eoHowMany(0), 
+    bool _strongElitism = false,
+    eoHowMany _surviveParents = eoHowMany(0.0),
+    eoParamParamType & _reduceParentType = eoParamParamType("Deterministic"),
+    eoHowMany _surviveOffspring = eoHowMany(1.0),
+    eoParamParamType & _reduceOffspringType = eoParamParamType("Deterministic"),
+    eoParamParamType & _reduceFinalType  = eoParamParamType("Deterministic")
+	)
+{
+  /////////////////////////////////////////////////////
+  // the replacement
+  /////////////////////////////////////////////////////
+
+  // Elitism
+    eoHowMany elite =  _parser.createParam(_elite, "elite", "Nb of elite parents (percentage or absolute)", '\0', "Evolution Engine / Replacement").value();
+
+    bool strongElitism = _parser.createParam(_strongElitism,"eliteType", "Strong (true) or weak (false) elitism (set elite to 0 for none)", '\0', "Evolution Engine / Replacement").value();
+
+  // reduce the parents
+    eoHowMany surviveParents =  _parser.createParam(_surviveParents, "surviveParents", "Nb of surviving parents (percentage or absolute)", '\0', "Evolution Engine / Replacement").value();
+  
+  eoParamParamType & reduceParentType = _parser.createParam(_reduceParentType, "reduceParents", "Parents reducer: Deterministic, EP(T), DetTour(T), StochTour(t), Uniform", '\0', "Evolution Engine / Replacement").value();
+
+  eoReduce & reduceParent = decode_reduce(reduceParentType, _state);
+
+  // reduce the offspring
+    eoHowMany surviveOffspring =  _parser.createParam(_surviveOffspring, "surviveOffspring", "Nb of surviving offspring (percentage or absolute)", '\0', "Evolution Engine / Replacement").value();
+  
+  eoParamParamType & reduceOffspringType = _parser.createParam(_reduceOffspringType, "reduceOffspring", "Offspring reducer: Deterministic, EP(T), DetTour(T), StochTour(t), Uniform", '\0', "Evolution Engine / Replacement").value();
+
+  eoReduce & reduceOffspring = decode_reduce(reduceOffspringType, _state);
+
+  eoParamParamType & reduceFinalType = _parser.createParam(_reduceFinalType, "reduceFinal", "Final reducer: Deterministic, EP(T), DetTour(T), StochTour(t), Uniform", '\0', "Evolution Engine / Replacement").value();
+
+  eoReduce & reduceFinal = decode_reduce(reduceFinalType, _state);
+
+  // now the replacement itself
+  eoReduceMergeReduce *ptReplace = new eoReduceMergeReduce(elite, strongElitism, surviveParents, reduceParent, surviveOffspring, reduceOffspring, reduceFinal);
+  _state.storeFunctor(ptReplace);
+
+  // that's it!
+  return *ptReplace;
+}
+
+#endif
diff --git a/trunk/paradiseo-eo/src/do/make_pop.h b/trunk/paradiseo-eo/src/do/make_pop.h
new file mode 100644
index 000000000..0fe927a56
--- /dev/null
+++ b/trunk/paradiseo-eo/src/do/make_pop.h
@@ -0,0 +1,108 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_pop.h
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _make_pop_h
+#define _make_pop_h
+
+#include   // for time(0) for random seeding
+#include 
+#include 
+#include 
+#include 
+#include 
+
+
+///////////////////////////////// INIT POP ///////////////////////////////
+/**
+ * Templatized version of parser-based construct of the population
+ * + other initializations that are NOT representation-dependent.
+ *
+ * It must then be instantiated, and compiled on its own for a given EOType
+ * (see e.g. ga.h and ga.pp in dir ga)
+*/
+
+
+template 
+eoPop&  do_make_pop(eoParser & _parser, eoState& _state, eoInit & _init)
+{
+  // random seed
+    eoValueParam& seedParam = _parser.createParam(uint32_t(0), "seed", "Random number seed", 'S');
+    if (seedParam.value() == 0)
+	seedParam.value() = time(0);
+    eoValueParam& popSize = _parser.createParam(unsigned(20), "popSize", "Population Size", 'P', "Evolution Engine");
+
+  // Either load or initialize
+  // create an empty pop and let the state handle the memory
+  eoPop& pop = _state.takeOwnership(eoPop());
+
+  eoValueParam& loadNameParam = _parser.createParam(std::string(""), "Load","A save file to restart from",'L', "Persistence" );
+  eoValueParam & recomputeFitnessParam = _parser.createParam(false, "recomputeFitness", "Recompute the fitness after re-loading the pop.?", 'r',  "Persistence" );
+
+  if (loadNameParam.value() != "") // something to load
+    {
+      // create another state for reading
+      eoState inState;		// a state for loading - WITHOUT the parser
+      // register the rng and the pop in the state, so they can be loaded,
+      // and the present run will be the exact continuation of the saved run
+      // eventually with different parameters
+      inState.registerObject(pop);
+      inState.registerObject(rng);
+      inState.load(loadNameParam.value()); //  load the pop and the rng
+      // the fitness is read in the file:
+      // do only evaluate the pop if the fitness has changed
+      if (recomputeFitnessParam.value())
+	{
+	  for (unsigned i=0; i popSize.value())
+	{
+	  std::cerr << "WARNING, Load file contained too many individuals. Only the best will be retained" << std::endl;
+	  pop.resize(popSize.value());
+	}
+    }
+  else				// nothing loaded from a file
+    {
+      rng.reseed(seedParam.value());
+    }
+
+  if (pop.size() < popSize.value()) // missing some guys
+    {
+      // Init pop from the randomizer: need to use the append function
+      pop.append(popSize.value(), _init);
+    }
+
+  // for future stateSave, register the algorithm into the state
+  _state.registerObject(_parser);
+  _state.registerObject(pop);
+  _state.registerObject(rng);
+
+  return pop;
+}
+
+#endif
diff --git a/trunk/paradiseo-eo/src/do/make_run.h b/trunk/paradiseo-eo/src/do/make_run.h
new file mode 100644
index 000000000..64e3fa333
--- /dev/null
+++ b/trunk/paradiseo-eo/src/do/make_run.h
@@ -0,0 +1,45 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_run.h
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _make_run_h
+#define _make_run_h
+
+// Algorithm (only this one needed)
+#include 
+
+/*
+ * A trivial function - only here to allow instanciation with a give EOType
+ *      and separate compilation - see in ga dir, make_run_ga
+ *
+*/
+
+template 
+void do_run(eoAlgo& _algo, eoPop& _pop)
+{
+  _algo(_pop);
+}
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eo b/trunk/paradiseo-eo/src/eo
new file mode 100644
index 000000000..3f5be5994
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eo
@@ -0,0 +1,154 @@
+//-----------------------------------------------------------------------------
+// eo
+// (c) GeNeura Team 1998 - 2000
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+#ifndef _eo_
+#define _eo_
+
+#ifdef HAVE_CONFIG_H
+#include 
+#endif
+
+// general purpose
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+
+#include 
+#include 
+#include 
+
+// eo's
+#include 
+
+#include 
+
+#include 
+#include 
+#include 
+
+// the variation operators
+#include 
+#include 
+#include 
+#include 
+// combinations of simple eoOps (eoMonOp and eoQuadOp)
+#include 
+// didactic (mimics SGA-like variation into an eoGenOp)
+// calls crossover and mutation sequentially, 
+// with their respective mutation rates
+#include 
+// its dual: crossover, mutation (and copy) - proportional choice
+// w.r.t. given relative weights
+#include 
+
+// population
+#include 
+
+// Evaluation functions (all include eoEvalFunc.h)
+#include 
+#include 
+
+// Continuators - all include eoContinue.h
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#ifndef _MSC_VER
+#include   // CtrlC handling (using 2 global variables!)
+#endif
+// Selection
+// the eoSelectOne's
+#include 
+#include 
+#include 
+#include 
+#include  // also contains eoLinearFitScaling.h
+#include 
+#include 
+#include 
+// Embedding truncation selection 
+#include 
+
+// the batch selection - from an eoSelectOne
+#include 
+#include 
+#include 
+#include 
+
+// other batch selections
+// DetSelect can also be obtained as eoSequentialSelect, an eoSelectOne
+// (using setup and an index)
+#include 
+
+// Breeders
+#include 	// applies one eoGenOp, stop on offspring count
+// #include 	// parent + SINGLE offspring compete (e.g. DE) - not ready yet...
+
+// Replacement
+// #include 
+#include 
+#include 
+#include 
+
+// a simple transformer
+#include 
+
+// Perf2Worth stuff - includes eoSelectFromWorth.h
+#include 
+#include 
+
+// Algorithms
+#include 
+#include 
+// #include    removed for a while - until eoGenOp is done
+
+// Utils
+#include 
+#include  // includes eoRealBounds.h
+#include         // no eoIntVectorBounds
+
+// aliens
+#include 
+#include 
+
+
+//-----------------------------------------------------------------------------
+// to be continued ...
+//-----------------------------------------------------------------------------
+
+//-----------------------------------------------------------------------------
+
+#endif 
+
+// Local Variables:
+// mode: C++
+// End:
diff --git a/trunk/paradiseo-eo/src/eoAlgo.h b/trunk/paradiseo-eo/src/eoAlgo.h
new file mode 100644
index 000000000..9e168cda2
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoAlgo.h
@@ -0,0 +1,43 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoAlgo.h
+// (c) GeNeura Team, 1998
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _EOALGO_H
+#define _EOALGO_H
+
+#include                    // for population
+#include 
+
+/**
+    This is a generic class for population-transforming algorithms. There
+    is only one operator defined, which takes a population and does stuff to
+    it. It needn't be a complete algorithm, can be also a step of an
+    algorithm. This class just gives a common interface to linear
+    population-transforming algorithms.
+*/
+template< class EOT >
+class eoAlgo : public eoUF&, void>
+{};
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoBreed.h b/trunk/paradiseo-eo/src/eoBreed.h
new file mode 100644
index 000000000..c62cb213d
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoBreed.h
@@ -0,0 +1,75 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eoBreed.h
+   (c) Maarten Keijzer, GeNeura Team, 2000
+
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+   Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoBreed_h
+#define _eoBreed_h
+
+
+//-----------------------------------------------------------------------------
+#include 
+#include 
+#include 
+#include 
+//-----------------------------------------------------------------------------
+
+/** Breeding: combination of selecting and transforming a population
+
+Breeding is thought of a combination of selecting and transforming a
+population. For efficiency reasons you might want to build your own
+eoBreed derived class rather than relying on a seperate select and
+transform function.
+
+@see eoSelect, eoTransform, eoSelectTransform
+*/
+template
+class eoBreed : public eoBF&, eoPop&, void>
+{};
+
+
+
+/** Embedded select, followed by an embedded transform
+
+Special breeder that is just an application of an embedded select,
+followed by an embedded transform
+*/
+template 
+class eoSelectTransform : public eoBreed
+{
+    public:
+        eoSelectTransform(eoSelect& _select, eoTransform& _transform) :
+        select(_select), transform(_transform)
+        {}
+
+        void operator()(const eoPop& _parents, eoPop& _offspring)
+        {
+            select(_parents, _offspring);
+            transform(_offspring);
+        }
+
+    private :
+        eoSelect& select;
+        eoTransform& transform;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoCellularEasyEA.h b/trunk/paradiseo-eo/src/eoCellularEasyEA.h
new file mode 100644
index 000000000..5369feb22
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoCellularEasyEA.h
@@ -0,0 +1,161 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+// "eoCellularEasyEA.h"
+
+// (c) OPAC Team, LIFL, 2002
+
+/* This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+   
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+   
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA
+   
+   Contact: cahon@lifl.fr
+*/
+
+#ifndef eoCellularEasyEA_h
+#define eoCellularEasyEA_h
+
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+
+/**
+   The abstract cellular easy algorithm. 
+ */
+
+template  class eoCellularEasyEA : public eoAlgo  {
+  
+public :
+  
+  /**
+     Two constructors
+   */
+
+  eoCellularEasyEA (eoContinue  & _cont, // Stop. criterion
+		    eoEvalFunc  & _eval, // Evaluation function
+		    eoSelectOne  & _sel_neigh, // To choose a partner
+		    eoBinOp  & _cross, // Cross-over operator
+		    eoMonOp  & _mut, // Mutation operator
+		    eoSelectOne  & _sel_repl /* Which to keep between the new
+						     child and the old individual ? */
+		    ) :
+    cont (_cont),
+    eval (_eval),
+    popEval (_eval),
+    sel_neigh (_sel_neigh),
+    cross (_cross),
+    mut (_mut),
+    sel_child (eoSelectFirstOne ()),
+    sel_repl (_sel_repl) {
+    
+  }
+  
+  eoCellularEasyEA (eoContinue  & _cont,
+		    eoEvalFunc  & _eval,
+		    eoSelectOne  & _sel_neigh,
+		    eoQuadOp  & _cross,
+		    eoMonOp  & _mut,
+		    eoSelectOne  & _sel_child, /* To choose one from
+						       the both children */
+		    eoSelectOne  & _sel_repl
+		    ) :
+    cont (_cont),
+    eval (_eval),
+    popEval (_eval),
+    sel_neigh (_sel_neigh),
+    cross (_cross),
+    mut (_mut),
+    sel_child (_sel_child),
+    sel_repl (_sel_repl) {
+    
+  }
+
+  /**
+     For a given population.
+   */
+
+  void operator () (eoPop  & pop) {
+    
+    do {
+      
+      for (unsigned i = 0 ; i < pop.size () ; i ++) {
+	
+	// Who are neighbouring to the current individual ?
+	eoPop  neigh = neighbours (pop, i) ;
+	
+	// To select a partner
+	EOT part, old_sol = pop [i] ;
+	part = sel_neigh (neigh) ;
+
+	// To perform cross-over
+	cross (pop [i], part) ;
+
+	// To perform mutation
+	mut (pop [i]) ;
+	mut (part) ;
+	
+	pop [i].invalidate () ;
+	part.invalidate () ;
+	eval (pop [i]) ;
+	eval (part) ;
+
+	// To choose one of the two children ...
+	eoPop  pop_loc ;
+	pop_loc.push_back (pop [i]) ;
+	pop_loc.push_back (part) ;
+
+	pop [i] = sel_child (pop_loc) ;
+
+	// To choose only one between the new made child and the old individual
+	pop_loc.clear () ;
+	pop_loc.push_back (pop [i]) ;
+	
+	pop_loc.push_back (old_sol) ;
+	
+	pop [i] = sel_repl (pop_loc) ;	
+      }
+      
+    } while (cont (pop)) ;
+  }
+
+protected :
+  
+  virtual eoPop  neighbours (const eoPop  & pop, int rank) = 0 ;
+
+private :
+  
+  eoContinue  & cont ;
+  eoEvalFunc  & eval ;
+  eoPopLoopEval  popEval ;
+  eoSelectOne  & sel_neigh ;
+  eoBF  & cross ;
+  eoMonOp  & mut ;
+  eoSelectOne  & sel_child ;
+  eoSelectOne  & sel_repl ;
+  
+  class eoSelectFirstOne : public eoSelectOne  {
+    
+  public :
+    
+    const EOT & operator () (const eoPop  & pop) {
+      
+      return pop [0] ; 
+    }
+    
+  } ; 
+  
+} ;
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoCloneOps.h b/trunk/paradiseo-eo/src/eoCloneOps.h
new file mode 100644
index 000000000..de4ad74a9
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoCloneOps.h
@@ -0,0 +1,79 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+//-----------------------------------------------------------------------------
+// eoCloneOps.h
+// (c) GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+    CVS Info: $Date: 2003/02/27 19:26:09 $ $Header: /cvsroot/eodev/eo/src/eoCloneOps.h,v 1.2 2003/02/27 19:26:09 okoenig Exp $ $Author: okoenig $ 
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoCloneOps_H
+#define _eoCloneOps_H
+
+#include 
+
+/**
+ * The different null-variation operators (i.e. they do nothing)
+ * 
+ * eoQuadCloneOp at least is useful to emulate the standard 
+ *               crossover(pCross) + mutation(pMut) 
+ *               within the eoGenOp framework
+ * eoMonCloneOp will probably be useful as the copy operator
+ * eoBinCloneOp will certainly never been used - but let's be complete :-)
+ */
+
+/**
+Mon clone: one argument
+*/
+template 
+class eoMonCloneOp: public eoMonOp
+{
+public:
+  /// Ctor
+  eoMonCloneOp() : eoMonOp() {}
+  virtual std::string className() const {return "eoMonCloneOp";}
+  virtual bool operator()(EOT&){return false;}
+};
+
+
+/** Binary clone: two operands, only the first could be modified
+ */
+template
+class eoBinCloneOp: public eoBinOp
+{
+public:
+  /// Ctor
+  eoBinCloneOp() : eoBinOp() {}
+  virtual std::string className() const {return "eoBinCloneOp";}
+  virtual bool operator()(EOT&, const EOT&){return false;}
+};
+
+/** Quad clone: two operands, both could be modified - but are not!
+*/
+template
+class eoQuadCloneOp: public eoQuadOp
+{
+public:
+  /// Ctor
+  eoQuadCloneOp():eoQuadOp() {}
+  virtual std::string className() const {return "eoQuadCloneOp";}
+virtual bool operator()(EOT& , EOT& ) {return false;}
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/eoCombinedContinue.h b/trunk/paradiseo-eo/src/eoCombinedContinue.h
new file mode 100644
index 000000000..ec644521d
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoCombinedContinue.h
@@ -0,0 +1,92 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoCombinedContinue.h
+// (c) Maarten Keijzer, GeNeura Team, 1999, 2000
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoCombinedContinue_h
+#define _eoCombinedContinue_h
+
+#include 
+
+/** 
+    Combined continuators - logical AND:
+  Continues until one of the embedded continuators says halt!
+
+20/11/00 MS: Changed the 2-continuator construct to a std::vector >
+             to be consistent with other Combined constructs
+             and allow to easily handle more than 2 continuators
+
+02/2003 Ramón Casero Cañas - added the removeLast() method 
+*/
+
+template< class EOT>
+class eoCombinedContinue: public eoContinue {
+public:
+
+  /// Define Fitness
+  typedef typename EOT::Fitness FitnessType;
+
+  /// Ctor, make sure that at least on continuator is present
+  eoCombinedContinue( eoContinue& _cont)
+    : eoContinue ()
+  {
+    continuators.push_back(&_cont);
+  }
+
+  /// Ctor - for historical reasons ... should disspear some day
+  eoCombinedContinue( eoContinue& _cont1, eoContinue& _cont2)
+    : eoContinue ()
+  {
+    continuators.push_back(&_cont1);
+    continuators.push_back(&_cont2);
+  }
+
+  void add(eoContinue & _cont)
+  {
+    continuators.push_back(&_cont);
+  }
+
+  ///////////// RAMON'S CODE ///////////////
+  void removeLast(void)
+  {
+    continuators.pop_back();
+  }
+  ///////////// RAMON'S CODE (end) ///////////////
+
+
+  /** Returns false when one of the embedded continuators say so (logical and)
+   */
+  virtual bool operator() ( const eoPop& _pop )
+  {
+    for (unsigned i = 0; i < continuators.size(); ++i)
+      if ( !(*continuators[i])(_pop) ) return false;
+    return true;
+  }
+
+  virtual std::string className(void) const { return "eoCombinedContinue"; }
+
+private:
+  std::vector*>    continuators;
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/eoCombinedInit.h b/trunk/paradiseo-eo/src/eoCombinedInit.h
new file mode 100644
index 000000000..3d2441322
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoCombinedInit.h
@@ -0,0 +1,89 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoCombinedInit.h
+// (c) Maarten Keijzer, GeNeura Team, Marc Schoenauer 2004
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@inria.fr
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoCombinedInit_h
+#define _eoCombinedInit_h
+
+#include 
+
+/** 
+    Combined INIT: a proportional recombination of eoInit objects
+*/
+
+template< class EOT>
+class eoCombinedInit: public eoInit {
+public:
+
+  /** Ctor, make sure that at least one eoInit is present */
+  eoCombinedInit( eoInit& _init, double _rate)
+    : eoInit ()
+  {
+    initializers.push_back(&_init);
+    rates.push_back(_rate);
+  }
+
+  /** The usual method to add objects to the combination
+   * note the _verbose parameter, that allows to print what's
+   * inside the combination with scaled rates
+   */
+  void add(eoInit & _init, double _rate, bool _verbose=false)
+  {
+    initializers.push_back(&_init);
+    rates.push_back(_rate);
+    // compute the relative rates in percent - to warn the user!
+    if (_verbose)
+      printOn(std::cout);
+  }
+
+  /** outputs the operators and percentages */
+  virtual void printOn(std::ostream & _os)
+  {
+    double total = 0;
+    unsigned i;
+    for (i=0; iclassName() << " with rate " << 100*rates[i]/total << " %\n";
+  }
+
+  /** Performs the init: chooses among all initializers
+   * using roulette wheel on the rates
+   */
+  virtual void operator() ( EOT & _eo )
+  {
+    unsigned what = rng.roulette_wheel(rates); // choose one op
+    (*initializers[what])(_eo);		   // apply it
+    return;
+  }
+
+  virtual std::string className(void) const { return "eoCombinedInit"; }
+
+private:
+std::vector*> initializers;
+std::vector rates;
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/eoContinue.h b/trunk/paradiseo-eo/src/eoContinue.h
new file mode 100644
index 000000000..d3b45f366
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoContinue.h
@@ -0,0 +1,54 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoContinue.h
+// (c) Maarten Keijzer, Geneura Team, 1999, 2000
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoContinue_h
+#define _eoContinue_h
+
+#include 
+#include 
+#include 
+
+/** Termination condition for the genetic algorithm
+ * Takes the population as input, returns true for continue,
+ * false for termination 
+ */
+template< class EOT>
+class eoContinue : public eoUF&, bool>, public eoPersistent 
+{
+public:
+  virtual std::string className(void) const { return "eoContinue"; }
+
+  void readFrom (std :: istream & __is) {
+    
+    /* It should be implemented by subclasses ! */
+  }
+  
+  void printOn (std :: ostream & __os) const {
+    
+    /* It should be implemented by subclasses ! */
+  }
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/eoCounter.h b/trunk/paradiseo-eo/src/eoCounter.h
new file mode 100644
index 000000000..05e08b21a
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoCounter.h
@@ -0,0 +1,219 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoCounter.h
+// (c) Maarten Keijzer 2000
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoCounter_h
+#define _eoCounter_h
+
+#include 
+#include 
+#include 
+
+/**
+	Generic counter class that counts the number of times
+	a procedure is used. Add a procedure through its ctor and
+	use this class instead of it.
+
+    It is derived from eoValueParam so you can add it to a monitor.
+*/
+template 
+class eoProcedureCounter : public Procedure, public eoValueParam
+{
+    public:
+
+        eoProcedureCounter(Procedure& _proc, std::string _name = "proc_counter") 
+            : eoValueParam(0, _name), proc(_proc) {}
+
+        /** Calls the embedded function and increments the counter
+        
+          Note for MSVC users, if this code does not compile, you are quite
+          likely trying to count a function that has a non-void return type.
+          Don't look at us, look at the MSVC builders. Code like "return void;"
+          is perfectly legal according to the ANSI standard, but the guys at
+          Microsoft didn't get to implementing it yet. 
+          
+          We had two choices: assuming (and compiling ) code that returns void or code that returns non-void.
+          Given that in EO most functors return void, it was chosen to support void.
+
+          But also please let me know if you have a compiler that defines _MSC_VER (lot's of windows compilers do), but is quite 
+          capable of compiling return void; type of code. We'll try to change the signature then.
+
+          You happy GNU (and other compiler) users will not have a problem with this..
+        */
+        typename Procedure::result_type operator()(void)
+        {
+            value()++;
+#ifdef _MSC_VER
+            proc();
+#else
+            return proc();
+#endif
+        }
+
+    private :
+
+        Procedure& proc;
+};
+
+/**
+	Generic counter class that counts the number of times
+	a unary function is used. Add a unary function through its ctor and
+	use this class instead of it.
+    
+    It is derived from eoValueParam so you can add it to a monitor.
+
+    Example: suppose you have an eoEvalFunc called myeval, to count the 
+    number of evaluations, just define:
+
+  eoUnaryFunctorCounter evalCounter(myeval);
+
+  and use evalCounter now instead of myeval. 
+*/
+
+template 
+class eoUnaryFunctorCounter : public UnaryFunctor, public eoValueParam
+{
+    public:
+        eoUnaryFunctorCounter(UnaryFunctor& _func, std::string _name = "uf_counter") 
+            : eoValueParam(0, _name), func(_func) {}
+        
+        /** Calls the embedded function and increments the counter
+        
+          Note for MSVC users, if this code does not compile, you are quite
+          likely trying to count a function that has a non-void return type.
+          Don't look at us, look at the MSVC builders. Code like "return void;"
+          is perfectly legal according to the ANSI standard, but the guys at
+          Microsoft didn't get to implementing it yet. 
+          
+          We had two choices: assuming (and compiling ) code that returns void or code that returns non-void.
+          Given that in EO most functors return void, it was chosen to support void.
+
+          But also please let me know if you have a compiler that defines _MSC_VER (lot's of windows compilers do), but is quite 
+          capable of compiling return void; type of code. We'll try to change the signature then.
+
+          You happy GNU (and other compiler) users will not have a problem with this.
+        */
+        typename UnaryFunctor::result_type operator()
+            (typename UnaryFunctor::first_argument_type _arg1)
+        {
+            value()++;
+#ifdef _MSC_VER
+            func(_arg1);
+#else
+            return func(_arg1);
+#endif
+        }
+
+    private :
+
+        UnaryFunctor& func;
+};
+
+/**
+	Generic counter class that counts the number of times
+	a binary function is used. Add a binary function through its ctor and
+	use this class instead of it.
+    
+    It is derived from eoValueParam so you can add it to a monitor.
+
+*/
+template 
+class eoBinaryFunctorCounter : public BinaryFunctor, public eoValueParam
+{
+    public:
+        eoBinaryFunctorCounter(BinaryFunctor& _func, std::string _name = "proc_counter") 
+            : eoValueParam(0, _name), func(_func) {}
+
+        /** Calls the embedded function and increments the counter
+        
+          Note for MSVC users, if this code does not compile, you are quite
+          likely trying to count a function that has a non-void return type.
+          Don't look at us, look at the MSVC builders. Code like "return void;"
+          is perfectly legal according to the ANSI standard, but the guys at
+          Microsoft didn't get to implementing it yet. 
+          
+          We had two choices: assuming (and compiling ) code that returns void or code that returns non-void.
+          Given that in EO most functors return void, it was chosen to support void.
+
+
+          But also please let me know if you have a compiler that defines _MSC_VER (lot's of windows compilers do), but is quite 
+          capable of compiling return void; type of code. We'll try to change the signature then.
+          
+          You happy GNU (and other compiler) users will not have a problem with this.
+        */
+        typename BinaryFunctor::result_type operator()
+            (typename BinaryFunctor::first_argument_type _arg1, 
+             typename BinaryFunctor::second_argument_type _arg2)
+        {
+            value()++;
+#ifdef _MSC_VER
+            func(_arg1, _arg2);
+#else
+            return func(_arg1, _arg2);
+#endif
+  }
+
+    private :
+
+        BinaryFunctor& func;
+};
+
+/** make_counter: overloaded function to make a counter out of a function
+
+    how it works...
+
+    by using the xxx_function_tag structure defined in eoFunctionBase, you 
+    can easily create a counter from a general class (say eoEval), by
+    simply stating:
+
+    eoEval& myCounted = make_counter(functor_category(myEval), myEval, store)
+
+    @see eoFunctorBase, functor_category, eoFunctorStore
+
+*/
+template 
+eoProcedureCounter& make_counter(eoFunctorBase::procedure_tag, Procedure& _proc, eoFunctorStore& store, std::string _name = "proc_counter")
+{
+    eoProcedureCounter* result = new eoProcedureCounter(_proc, _name);
+    store.storeFunctor(result);
+    return *result;
+}
+
+template 
+eoUnaryFunctorCounter& make_counter(eoFunctorBase::unary_function_tag, UnaryFunctor& _proc, eoFunctorStore& store, std::string _name = "uf_counter")
+{
+    eoUnaryFunctorCounter* result = new eoUnaryFunctorCounter(_proc, _name);
+    store.storeFunctor(result);
+    return *result;
+}
+
+template 
+eoBinaryFunctorCounter& make_counter(eoFunctorBase::binary_function_tag, BinaryFunctor& _proc, eoFunctorStore& store, std::string _name = "uf_counter")
+{
+    eoBinaryFunctorCounter* result = new eoBinaryFunctorCounter(_proc, _name);
+    store.storeFunctor(result);
+    return *result;
+}
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoCtrlCContinue.cpp b/trunk/paradiseo-eo/src/eoCtrlCContinue.cpp
new file mode 100644
index 000000000..deec41765
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoCtrlCContinue.cpp
@@ -0,0 +1,50 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+ 
+//-----------------------------------------------------------------------------
+// eoCtrlCContinue.cpp
+// (c) EEAAX 1996 - GeNeura Team, 1998 - Maarten Keijzer 2000 
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+ 
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+ 
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ 
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+*/
+//-----------------------------------------------------------------------------
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+#include 
+#include 
+
+// --- Global variables - but don't know what else to do - MS ---
+bool     arret_demande = false;
+bool     existCtrlCContinue = false;
+
+//
+// The signal handler - installed in the eoCtrlCContinue Ctor
+//
+void signal_handler( int sig )
+// ---------------------------
+{
+    // --- On veut la paix, jusqu'a la fin ---
+    signal( SIGINT, SIG_IGN );
+    signal( SIGQUIT, SIG_IGN );
+    std::cerr << "Ctrl C entered ... closing down" << std::endl ;
+    arret_demande = true;
+}
+
diff --git a/trunk/paradiseo-eo/src/eoCtrlCContinue.h b/trunk/paradiseo-eo/src/eoCtrlCContinue.h
new file mode 100644
index 000000000..f524fc97d
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoCtrlCContinue.h
@@ -0,0 +1,76 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+ 
+//-----------------------------------------------------------------------------
+// eoCtrlCContinue.h
+// (c) EEAAX 1996 - GeNeura Team, 1998 - Maarten Keijzer 2000 
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+ 
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+ 
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ 
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+*/
+//-----------------------------------------------------------------------------
+// the same thing can probably be done in MS environement, but I hoave no way
+// to test it so at the moment it is commented out when in MSVC
+#ifndef _MSC_VER
+
+#ifndef eoCtrlCContinue_h
+#define eoCtrlCContinue_h
+
+#include 
+#include 
+
+extern bool arret_demande, existCtrlCContinue;
+
+extern void signal_handler( int sig );
+
+
+/**
+    Ctrl C handling: this eoContinue tells whether the user pressed Ctrl C
+*/
+template< class EOT>
+class eoCtrlCContinue: public eoContinue
+{
+public:
+ 
+  /// Ctor : installs the signal handler
+  eoCtrlCContinue()
+  {
+    // First checks that no other eoCtrlCContinue does exist
+    if (existCtrlCContinue)
+      throw std::runtime_error("A signal handler for Ctrl C is already defined!\n");
+    signal( SIGINT, signal_handler );
+    signal( SIGQUIT, signal_handler );
+    existCtrlCContinue = true;
+  }
+ 
+  /** Returns false when Ctrl C has been typed in
+         * reached */
+  virtual bool operator() ( const eoPop& _vEO ) 
+  {
+    if (arret_demande)
+      return false;
+    return true;
+  }
+
+  virtual std::string className(void) const { return "eoCtrlCContinue"; }
+};
+
+
+#endif
+
+#endif
+ // of MSVC comment-out
diff --git a/trunk/paradiseo-eo/src/eoDetSelect.h b/trunk/paradiseo-eo/src/eoDetSelect.h
new file mode 100644
index 000000000..312053cbb
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoDetSelect.h
@@ -0,0 +1,83 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eoDetSelect.h 
+   (c) Marc Schoenauer, Maarten Keijzer, GeNeura Team, 2000
+ 
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoDetSelect_h
+#define _eoDetSelect_h
+
+
+//-----------------------------------------------------------------------------
+#include 
+#include 
+#include 
+//-----------------------------------------------------------------------------
+
+/** eoDetSelect selects many individuals determinisctically
+*/
+template
+class eoDetSelect : public eoSelect
+{
+ public:
+     /// init
+     eoDetSelect(double _rate = 1.0, bool _interpret_as_rate = true)
+         : howMany(_rate, _interpret_as_rate)  {}
+
+     /**
+     @param _source the source population
+     @param _dest  the resulting population (size of this population is 
+         given by the HowMany data
+         It empties the destination and adds the selection into it)
+     */
+  virtual void operator()(const eoPop& _source, eoPop& _dest)
+  {
+    unsigned int pSize = _source.size();
+    size_t target = howMany(pSize);
+
+    _dest.resize(target);
+
+    unsigned remain = target % pSize;
+    unsigned entireCopy = target / pSize;
+    typename eoPop::iterator it = _dest.begin();
+    
+    if (target >= pSize)
+      {
+	for (unsigned i=0; i  // 
+#include      // accumulate
+
+#include 
+#include 
+#include 
+
+//-----------------------------------------------------------------------------
+/** eoDetTournamentSelect: a selection method that selects ONE individual by
+ deterministic tournament 
+ -MS- 24/10/99 */
+//-----------------------------------------------------------------------------
+
+template  class eoDetTournamentSelect: public eoSelectOne
+{
+ public:
+  /* (Default) Constructor - 
+     @param _tSize tournament size
+  */
+  eoDetTournamentSelect(unsigned _tSize = 2 ):eoSelectOne(), tSize(_tSize) {
+    // consistency check
+    if (tSize < 2) {
+      std::cout << "Warning, Tournament size should be >= 2\nAdjusted to 2\n";
+      tSize = 2;
+    }
+  }
+  
+  /* Perform deterministic tournament calling the appropriate fn 
+     see selectors.h
+  */
+  virtual const EOT& operator()(const eoPop& _pop) 
+  {
+      return deterministic_tournament(_pop, tSize);
+  }
+  
+ private:
+  unsigned tSize;
+};
+
+//-----------------------------------------------------------------------------
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/eoDistribUpdater.h b/trunk/paradiseo-eo/src/eoDistribUpdater.h
new file mode 100644
index 000000000..1749994fe
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoDistribUpdater.h
@@ -0,0 +1,50 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoDistribUpdater.h
+// (c) Marc Schoenauer, Maarten Keijzer, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoDistribUpdater_H
+#define _eoDistribUpdater_H
+
+#include 
+
+#include 
+#include 
+
+/**
+ * Base class for Distribution Evolution Algorithms within EO: 
+ *    the update rule of distribution
+ *
+ * It takes one distribution and updates it according to one population
+ *
+*/
+
+template 
+class eoDistribUpdater :  
+  public eoBF &, eoPop &, void>
+{
+public:
+  virtual void operator()(eoDistribution &, eoPop &)=0;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoDistribution.h b/trunk/paradiseo-eo/src/eoDistribution.h
new file mode 100644
index 000000000..9facd9160
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoDistribution.h
@@ -0,0 +1,52 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoDistribution.h
+// (c) Marc Schoenauer, Maarten Keijzer, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoDistribution_H
+#define _eoDistribution_H
+
+#include 
+
+#include 
+#include 
+
+/**
+ * Abstract class for Distribution Evolution Algorithms within EO:
+ *    the distribution itself
+ *
+ * It basically IS AN eoInit -  operator()(EOT &) generates new indis
+ *
+ * The instances will probably be eoValueParam of some kind
+ *    see eoPBILDistrib.h
+*/
+
+template 
+class eoDistribution :  public eoInit, 
+			public eoPersistent, public eoObject
+{
+public:
+  virtual void operator()(EOT &) = 0; // DO NOT FORGET TO INVALIDATE the EOT
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoDominanceMap.h b/trunk/paradiseo-eo/src/eoDominanceMap.h
new file mode 100644
index 000000000..ead931963
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoDominanceMap.h
@@ -0,0 +1,162 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eoDominanceMap.h
+   (c) Maarten Keijzer, Marc Schoenauer, 2001
+
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoDominanceMap_h
+#define eoDominanceMap_h
+
+#include 
+#include 
+
+/**
+  eoDominanceMap, utility class to calculate and maintain a map (std::vector >) of pareto dominance statistics.
+
+  It is set up such that
+
+  if map[i][j] == true
+  then i dominates j
+
+  The dominance map can be used to perform pareto ranking (eoParetoRanking) or non dominated sorting.
+  For the latter, the remove() member function might come in handy.
+
+  \todo make it an eoStat?
+*/
+template 
+class eoDominanceMap : public eoUF&, void>, public std::vector >
+{
+public:
+
+    /** Clears the map */
+    void clear() {
+        std::vector >::clear();
+        fitness.clear();
+    }
+
+  /**
+    Update or create the dominance map
+  */
+  void operator()(const eoPop& _pop)
+  {
+    setup(_pop);
+    return;
+  }
+
+  /**
+    Removes the domination info for a given individual, thus nothing dominates it and it dominates nothing.
+  */
+  void remove(unsigned i)
+  {
+    for (unsigned j = 0; j < size(); ++j)
+    {
+      operator[](i)[j] = false; // clear row
+      operator[](j)[i] = false; // clear col
+    }
+  }
+
+  /**
+    Create domination matrix from scratch. Complexity O(N^2)
+  */
+  void setup(const eoPop& _pop)
+  {
+    fitness.resize(_pop.size());
+    resize(_pop.size());
+
+    for (unsigned i = 0; i < _pop.size(); ++i)
+    {
+      fitness[i] = _pop[i].fitness();
+      operator[](i).resize(_pop.size(), false);
+
+      for (unsigned j = 0; j < i; ++j)
+      {
+        if (_pop[i].fitness().dominates(_pop[j].fitness()))
+        {
+          operator[](i)[j] = true;
+          operator[](j)[i] = false;
+        }
+        else if (_pop[j].fitness().dominates(_pop[i].fitness()))
+        {
+          operator[](i)[j] = false;
+          operator[](j)[i] = true;
+        }
+        else
+        {
+          operator[](i)[j] = false;
+          operator[](j)[i] = false;
+        }
+      }
+    }
+  }
+
+  /**
+    For all elements, returns the no. of elements that dominate the element
+    Thus: lower is better (and 0 is the front).
+    It returns a std::vector cuz that
+    makes subsequent manipulation that much easier
+  */
+  std::vector sum_dominators() const
+  {
+    std::vector result(size(), 0.0);
+
+    for (unsigned i = 0; i < size(); ++i)
+    {
+      for (unsigned j = 0; j < size(); ++j)
+      {
+        if (operator[](i)[j]) // i dominates j
+          result[j]++;
+      }
+    }
+
+    return result;
+  }
+
+  /**
+    For all elements, returns the number of elements that the element dominates
+    Thus: higher is better
+    It returns a std::vector cuz that
+    makes subsequent manipulation that much easier
+  */
+  std::vector sum_dominants() const
+  {
+    std::vector result(size(), 0.0);
+
+    for (unsigned i = 0; i < size(); ++i)
+    {
+      for (unsigned j = 0; j < size(); ++j)
+      {
+        if (operator[](i)[j]) // i dominates j
+          result[i]++;
+      }
+    }
+
+    return result;
+  }
+
+  private :
+
+
+  std::vector fitness;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoEDA.h b/trunk/paradiseo-eo/src/eoEDA.h
new file mode 100644
index 000000000..490af15e6
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoEDA.h
@@ -0,0 +1,46 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoEDA.h
+// (c) Marc Schoenauer, Maarten Keijzer, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoEDA_h
+#define _eoEDA_h
+
+//-----------------------------------------------------------------------------
+
+#include 
+
+/** eoEDA: Estimation of Distribution Algorithm within EO
+ *  
+ *  The abstract class for algorithms that evolve a probability distribution 
+ *  on the spaces of populations rather than a population
+ *
+ * It IS NOT an eoAlgo, as it evolves a distribution, not a population
+*/
+
+template class eoEDA: public eoUF&, void>
+{
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/eoEasyEA.h b/trunk/paradiseo-eo/src/eoEasyEA.h
new file mode 100644
index 000000000..9dd28148b
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoEasyEA.h
@@ -0,0 +1,243 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoEasyEA.h
+// (c) GeNeura Team, 1998
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoEasyEA_h
+#define _eoEasyEA_h
+
+//-----------------------------------------------------------------------------
+
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+
+
+
+template  class eoIslandsEasyEA ;
+
+template  class eoDistEvalEasyEA ;
+
+/** An easy-to-use evolutionary algorithm; you can use any chromosome,
+    and any selection transformation, merging and evaluation
+    algorithms; you can even change in runtime parameters of those
+    sub-algorithms
+
+Change (MS, July 3. 2001):
+  Replaced the eoEvalFunc by an eoPopEvalFunc: this immediately
+  allows many useful constructs, such as co-evolution (e.g. game players),
+  parisian approach (the solution to the problem is the whole population)
+  or simple distribution of evaluations on a cluster.
+  In case an eoEvalFunc is passed, it is embedded on an eoPopLoopEval
+  This makes things a little uglier (required an additional "dummy" member
+
+Note: it looks ugly only because we wanted to authorize many different
+  constructors. Please only look at the operator() and there shall be light
+*/
+template class eoEasyEA: public eoAlgo {
+public:
+
+  /** Ctor taking a breed and merge */
+     eoEasyEA(
+         eoContinue& _continuator,
+         eoEvalFunc& _eval,
+         eoBreed& _breed,
+         eoReplacement& _replace
+     ) : continuator(_continuator),
+	 eval (_eval),
+	 loopEval(_eval),
+	 popEval(loopEval),
+	 selectTransform(dummySelect, dummyTransform),
+         breed(_breed),
+         mergeReduce(dummyMerge, dummyReduce),
+         replace(_replace)
+         {}
+
+  /*
+  eoEasyEA(eoContinue  & _continuator,
+	   eoPopEvalFunc  & _pop_eval,
+	   eoBreed  & _breed,
+	   eoReplacement  & _replace
+	   ) :
+    continuator (_continuator),
+    eval (dummyEval),
+    loopEval(dummyEval),
+    popEval (_pop_eval),
+    selectTransform (dummySelect, dummyTransform),
+    breed (_breed),
+    mergeReduce (dummyMerge, dummyReduce),
+    replace (_replace) {
+
+  }
+  */
+
+  /** NEW Ctor taking a breed and merge and an eoPopEval */
+     eoEasyEA(
+         eoContinue& _continuator,
+         eoPopEvalFunc& _eval,
+         eoBreed& _breed,
+         eoReplacement& _replace
+     ) : continuator(_continuator),
+	 eval (dummyEval),
+	 loopEval(dummyEval),
+         popEval(_eval),
+         selectTransform(dummySelect, dummyTransform),
+         breed(_breed),
+         mergeReduce(dummyMerge, dummyReduce),
+         replace(_replace)
+         {}
+
+  /// Ctor eoBreed, eoMerge and eoReduce.
+    eoEasyEA(
+         eoContinue& _continuator,
+         eoEvalFunc& _eval,
+         eoBreed& _breed,
+         eoMerge& _merge,
+         eoReduce& _reduce
+     ) : continuator(_continuator),
+	 eval (_eval),
+	 loopEval(_eval),
+	 popEval(loopEval),
+         selectTransform(dummySelect, dummyTransform),
+         breed(_breed),
+         mergeReduce(_merge, _reduce),
+         replace(mergeReduce)
+         {}
+
+  /// Ctor eoSelect, eoTransform, and eoReplacement
+    eoEasyEA(
+         eoContinue& _continuator,
+         eoEvalFunc& _eval,
+         eoSelect& _select,
+         eoTransform& _transform,
+         eoReplacement& _replace
+     ) : continuator(_continuator),
+	 eval (_eval),
+	 loopEval(_eval),
+	 popEval(loopEval),
+         selectTransform(_select, _transform),
+         breed(selectTransform),
+         mergeReduce(dummyMerge, dummyReduce),
+         replace(_replace)
+         {}
+
+    /// Ctor eoSelect, eoTransform, eoMerge and eoReduce.
+     eoEasyEA(
+         eoContinue& _continuator,
+         eoEvalFunc& _eval,
+         eoSelect& _select,
+         eoTransform& _transform,
+         eoMerge&     _merge,
+         eoReduce&    _reduce
+     ) : continuator(_continuator),
+	 eval (_eval),
+	 loopEval(_eval),
+	 popEval(loopEval),
+         selectTransform(_select, _transform),
+         breed(selectTransform),
+         mergeReduce(_merge, _reduce),
+         replace(mergeReduce)
+         {}
+
+
+
+
+  /// Apply a few generation of evolution to the population.
+  virtual void operator()(eoPop& _pop)
+  {
+    eoPop offspring, empty_pop;
+    popEval(empty_pop, _pop); // A first eval of pop.
+    do
+    {
+      try
+      {
+         unsigned pSize = _pop.size();
+         offspring.clear(); // new offspring
+
+         breed(_pop, offspring);
+
+         popEval(_pop, offspring); // eval of parents + offspring if necessary
+
+         replace(_pop, offspring); // after replace, the new pop. is in _pop
+
+         if (pSize > _pop.size())
+             throw std::runtime_error("Population shrinking!");
+         else if (pSize < _pop.size())
+             throw std::runtime_error("Population growing!");
+
+      }
+      catch (std::exception& e)
+      {
+	    std::string s = e.what();
+	    s.append( " in eoEasyEA");
+	    throw std::runtime_error( s );
+      }
+    } while ( continuator( _pop ) );
+  }
+
+protected :
+
+  // If selectTransform needs not be used, dummySelect and dummyTransform are used
+  // to instantiate it.
+  class eoDummySelect : public eoSelect
+     { public : void operator()(const eoPop&, eoPop&) {} } dummySelect;
+
+     class eoDummyTransform : public eoTransform
+     { public : void operator()(eoPop&) {} } dummyTransform;
+
+  class eoDummyEval : public eoEvalFunc
+  {public: void operator()(EOT &) {} } dummyEval;
+
+  eoContinue&          continuator;
+
+  eoEvalFunc  &        eval ;
+  eoPopLoopEval        loopEval;
+
+  eoPopEvalFunc&       popEval;
+
+  eoSelectTransform    selectTransform;
+  eoBreed&             breed;
+
+  // If mergeReduce needs not be used, dummyMerge and dummyReduce are used
+  // to instantiate it.
+  eoNoElitism          dummyMerge;
+  eoTruncate           dummyReduce;
+
+  eoMergeReduce        mergeReduce;
+  eoReplacement&       replace;
+
+  // Friend classes
+  friend class eoIslandsEasyEA  ;
+  friend class eoDistEvalEasyEA  ;
+};
+
+//-----------------------------------------------------------------------------
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/eoEvalContinue.h b/trunk/paradiseo-eo/src/eoEvalContinue.h
new file mode 100644
index 000000000..b13ef90be
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoEvalContinue.h
@@ -0,0 +1,68 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoEvalContinue.h
+// (c) GeNeura Team, 1999, Marc Schoenauer 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoEvalContinue_h
+#define _eoEvalContinue_h
+
+#include 
+#include 
+
+/** 
+ * Continues until a number of evaluations has been made
+*/
+template< class EOT>
+class eoEvalContinue: public eoContinue
+{
+public:
+  /// Ctor 
+  eoEvalContinue( eoEvalFuncCounter & _eval, unsigned long _totalEval)
+	  : eval(_eval), repTotalEvaluations( _totalEval ) {
+    std::cout << "Ctor de eoEvalFuncCounter avec total = " << repTotalEvaluations << std::endl;
+};
+  
+  /** Returns false when a certain number of evaluations has been done
+   */
+  virtual bool operator() ( const eoPop& _vEO ) {
+    if (eval.value() >= repTotalEvaluations) 
+      {
+	std::cout << "STOP in eoEvalContinue: Reached maximum number of evaluations [" << repTotalEvaluations << "]\n";
+	return false;
+      }
+    return true;
+  }
+  
+  /** Returns the number of generations to reach*/
+  virtual unsigned long totalEvaluations( ) 
+  {  
+    return repTotalEvaluations; 
+  };
+  
+  virtual std::string className(void) const { return "eoEvalContinue"; }
+private:
+  eoEvalFuncCounter & eval;
+  unsigned long repTotalEvaluations;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoEvalFunc.h b/trunk/paradiseo-eo/src/eoEvalFunc.h
new file mode 100644
index 000000000..3dfaeba07
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoEvalFunc.h
@@ -0,0 +1,49 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoEvalFunc.h
+// (c) GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoEvalFunc_H
+#define eoEvalFunc_H
+
+#include 
+
+/** Evaluate: takes one EO and sets its "fitness" property
+ * returning this fitness also. That is why EOT is passed by
+ * non-const reference: it must be altered within evaluate.\\
+
+ The requirements on the types with which this class is to be
+ instantiated with are null, or else, they depend on the particular
+ class it's going to be applied to; EO does not impose any requirement 
+ on it. If you subclass this abstract class, and use it to evaluate an 
+ EO, the requirements on this EO will depend on the evaluator.
+ */
+
+template class eoEvalFunc : public eoUF
+{
+    public :
+        typedef EOT EOType;
+
+	typedef typename EOT::Fitness EOFitT;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoEvalFuncCounter.h b/trunk/paradiseo-eo/src/eoEvalFuncCounter.h
new file mode 100644
index 000000000..fb28de59f
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoEvalFuncCounter.h
@@ -0,0 +1,56 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoEvalFuncCounter.h
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2000
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoEvalFuncCounter_H
+#define eoEvalFuncCounter_H
+
+#include 
+#include 
+
+/** 
+Counts the number of evaluations actually performed, thus checks first
+if it has to evaluate.. etc.
+*/
+template class eoEvalFuncCounter : public eoEvalFunc, public eoValueParam
+{
+    public :
+        eoEvalFuncCounter(eoEvalFunc& _func, std::string _name = "Eval. ") 
+            : eoValueParam(0, _name), func(_func) {}
+
+        virtual void operator()(EOT& _eo)
+        {
+            if (_eo.invalid())
+            {
+                value()++;
+                func(_eo);
+            }
+        }
+
+    private :
+        eoEvalFunc& func;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoEvalFuncPtr.h b/trunk/paradiseo-eo/src/eoEvalFuncPtr.h
new file mode 100644
index 000000000..fd98e4e34
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoEvalFuncPtr.h
@@ -0,0 +1,66 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+-----------------------------------------------------------------------------
+    eoEvalFuncPtr.h
+      Converts a classical C fitness evaluation function into a fitness
+      evaluation object
+
+    (c) GeNeura Team, 2000
+ 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef EOEVALFUNCPTR_H
+#define EOEVALFUNCPTR_H
+
+#include 
+
+/** EOEvalFuncPtr: This class
+ * takes an existing function pointer and converts it into a evaluation
+ * function class. That way, old style C or C++ functions can be adapted to EO
+ * function classes.
+ */
+#ifdef _MSC_VER
+template< class EOT, class FitT = EOT::Fitness, class FunctionArg = const EOT& >
+#else
+template< class EOT, class FitT = typename EOT::Fitness, class FunctionArg = const EOT& >
+#endif
+struct eoEvalFuncPtr: public eoEvalFunc {
+
+  /** Applies the function to the chromosome and sets the fitness of the
+      Chrom. Thus, the evaluation function need not be worried about that.
+      @param _eval pointer to the evaluation function, takes a EOT as an
+                   argument and returns the fitness
+      @return the evaluated fitness for that object.
+  */
+  eoEvalFuncPtr( FitT (* _eval)( FunctionArg ) )
+    : eoEvalFunc(), evalFunc( _eval ) {};
+  
+  /// Effectively applies the evaluation function to an EO 
+  virtual void operator() ( EOT & _eo ) 
+  {
+    if (_eo.invalid())
+        _eo.fitness((*evalFunc)( _eo ));
+  };
+    
+  private:
+    FitT (* evalFunc )( FunctionArg );
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/eoFactory.h b/trunk/paradiseo-eo/src/eoFactory.h
new file mode 100644
index 000000000..13864f030
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoFactory.h
@@ -0,0 +1,72 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoFactory.h
+// (c) GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _EOFACTORY_H
+#define _EOFACTORY_H
+
+//-----------------------------------------------------------------------------
+#include 
+
+//-----------------------------------------------------------------------------
+
+/** EO Factory. A factory is used to create other objects. In particular,
+it can be used so that objects of that kind can´t be created in any other
+way. It should be instantiated with anything that needs a factory, like selectors
+or whatever; but the instance class should be the parent class from which all the
+object that are going to be created descend. This class basically defines an interface,
+as usual. The base factory class for each hierarchy should be redefined every time a new
+object is added to the hierarchy, which is not too good, but in any case, some code would
+have to be modified*/
+template
+class eoFactory: public eoObject {
+	
+public:
+	
+	/// @name ctors and dtors
+	//{@
+	/// constructor
+	eoFactory( ) {}
+	
+	/// destructor
+	virtual ~eoFactory() {}
+	//@}
+
+	/** Another factory methods: creates an object from an std::istream, reading from
+	it whatever is needed to create the object. Usually, the format for the std::istream will be\\
+	objectType parameter1 parameter2 ... parametern\\
+	*/
+	virtual EOClass* make(std::istream& _is) = 0;
+
+	///@name eoObject methods
+	//@{
+	/** Return the class id */
+	virtual std::string className() const { return "eoFactory"; }
+
+	/** Read and print are left without implementation */
+	//@}
+	
+};
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoFitContinue.h b/trunk/paradiseo-eo/src/eoFitContinue.h
new file mode 100644
index 000000000..4d594c3dd
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoFitContinue.h
@@ -0,0 +1,66 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoFitContinue.h
+// (c) Maarten Keijzer, GeNeura Team, 1999, 2000
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoFitContinue_h
+#define _eoFitContinue_h
+
+#include 
+
+/** 
+Fitness continuation: 
+
+  Continues until the maximum fitness level is reached.
+*/
+template< class EOT>
+class eoFitContinue: public eoContinue {
+public:
+
+    /// Define Fitness
+    typedef typename EOT::Fitness FitnessType;
+
+	/// Ctor
+    eoFitContinue( const FitnessType _maximum)
+		: eoContinue (), maximum( _maximum ) {};
+
+	/** Returns false when a fitness criterium is
+	* reached. Assumes pop is not sorted! */
+	virtual bool operator() ( const eoPop& _pop ) 
+    {
+    FitnessType bestCurrentFitness = _pop.nth_element_fitness(0);
+    if (bestCurrentFitness >= maximum) 
+      {
+	std::cout << "STOP in eoFitContinue: Best fitness has reached " << 
+	  bestCurrentFitness << "\n";
+	return false;
+      }
+    return true;
+    }
+
+  virtual std::string className(void) const { return "eoFitContinue"; }
+private:
+	FitnessType maximum;
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/eoFitnessScalingSelect.h b/trunk/paradiseo-eo/src/eoFitnessScalingSelect.h
new file mode 100644
index 000000000..0b3ec273a
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoFitnessScalingSelect.h
@@ -0,0 +1,54 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoFitnessScalingSelect.h
+// (c) GeNeura Team, 1998, Maarten Keijzer 2000, Marc Schoenauer 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoFitnessScalingSelect_h
+#define eoFitnessScalingSelect_h
+
+//-----------------------------------------------------------------------------
+
+#include 
+#include 
+
+/** eoFitnessScalingSelect: select an individual proportional to the 
+ *  linearly scaled fitness that is computed by the private
+ *  eoLinearFitScaling object
+*/
+template  
+class eoFitnessScalingSelect:  public eoRouletteWorthSelect 
+{
+public:
+  /** Ctor:
+   *  @param _p the selective pressure, should be in [1,2] (2 is the default)
+   */
+  eoFitnessScalingSelect(double _p = 2.0): 
+    eoRouletteWorthSelect(scaling), scaling(_p) {}
+
+private :
+  eoLinearFitScaling scaling;	   // derived from eoPerf2Worth
+};
+
+#endif 
+
diff --git a/trunk/paradiseo-eo/src/eoFlOrBinOp.h b/trunk/paradiseo-eo/src/eoFlOrBinOp.h
new file mode 100644
index 000000000..124ca4fd4
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoFlOrBinOp.h
@@ -0,0 +1,219 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoFlOrBinOp.h
+// (c) Marc Schoenauer - Maarten Keijzer 2000-2003
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@inria.fr
+             mkeijzer@cs.vu.nl
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoFlOrBinOp_h
+#define _eoFlOrBinOp_h
+
+#include 
+#include 
+
+/** Generic eoBinOps on fixed length genotypes.
+ *  Contains exchange crossovers (1pt and uniform)
+ *      and crossovers that applies an Atom crossover 
+ *          to all components with given rate, or
+ *          to a fixed prescribed nb of components
+ *
+ * Example: the standard bitstring 1-point and uniform crossovers 
+ *          could be implemented as resp. eoFlOr1ptBinOp and eoFlOrUniformBinOp
+*/
+
+//////////////////////////////////////////////////////////////////////
+//                eoFlOrAllAtomBinOp
+//////////////////////////////////////////////////////////////////////
+/** Bin Crossover using an Atom Crossover
+ *  that is applied to a ALL components with given rate
+ */
+template 
+class eoFlOrAllAtomBinOp : public eoBinOp
+{
+public :
+
+  typedef typename EOT::AtomType AtomType;
+
+  /** default ctor: requires an Atom BinOp */
+  eoFlOrAllAtomBinOp( eoBinOp& _op, float _rate = 1.0):
+    op(_op), rate( _rate ) {}
+
+  /** applies Atom crossover to ALL components with given rate */
+  bool operator()(EOT & _eo1, const EOT & _eo2)
+  {
+    if (_eo1.size() != _eo2.size())
+      {
+	string s = "Operand size don't match in " + className();
+	throw runtime_error(s);
+      }
+    bool changed = false;
+    for ( unsigned i = 0; i < _eo1.size(); i++ ) {
+      if ( rng.flip( rate ) ) {
+	bool changedHere = op( _eo1[i], _eo2[i] );
+	changed |= changedHere;
+      }
+    }
+    return changed;
+  }
+
+  /** inherited className()*/
+  virtual string className() const { return "eoFlOrAllAtomBinOp"; }
+
+private:
+  double rate;
+  eoBinOp & op;
+};
+
+//////////////////////////////////////////////////////////////////////
+//                 eoFlOrKAtomBinOp
+//////////////////////////////////////////////////////////////////////
+/** Bin Crossover using an Atom Crossover
+ *  that is applied to a FIXED NB of components
+ */
+template 
+class eoFlOrKAtomBinOp : public eoBinOp
+{
+public :
+
+  typedef typename EOT::AtomType AtomType;
+
+  /** default ctor: requires an Atom BinOp and an unsigned */
+  eoFlOrAtomBinOp( eoBinOp& _op, unsigned _k = 1):
+    op(_op), k( _k ) {}
+
+  /** applies the Atom BinOp to some components */
+  bool operator()(EOT & _eo1, const EOT & _eo2)
+  {
+    if (_eo1.size() != _eo2.size())
+      {
+	string s = "Operand size don't match in " + className();
+	throw runtime_error(s);
+      }
+
+    bool changed = false;
+    for ( unsigned i = 0; i < k; i++ ) // TODO: check that we don't do twice the same
+      {
+	unsigned where = eo::rng.random(_eo1.size());
+	bool changedHere = op( _eo1[where], _eo2[where] );
+	changed |= changedHere;
+      }
+    return changed;
+  }
+
+  /** inherited className()*/
+  virtual string className() const { return "eoFlOrKAtomBinOp"; }
+
+private:
+  unsigned k;
+  eoBinOp & op;
+};
+
+
+//////////////////////////////////////////////////////////////////////
+//                        eoFlOrUniformBinOp
+//////////////////////////////////////////////////////////////////////
+
+/** The uniform crossover - exchanges atoms uniformly ! */
+template 
+class eoFlOrUniformBinOp : public eoBinOp
+{
+public :
+
+  typedef typename EOT::AtomType AtomType;
+
+  /** default ctor: requires a rate - 0.5 by default */
+  eoFlOrUniformBinOp(double _rate=0.5) : eoBinOp(_size),
+    rate(_rate) {}
+
+  /** excahnges atoms at given rate */
+  bool operator()(EOT & _eo1, const EOT & _eo2)
+  {
+    unsigned i;
+    Atom tmp;
+    if (_eo1.size() != _eo2.size())
+      {
+	string s = "Operand size don't match in " + className();
+	throw runtime_error(s);
+  }
+    bool hasChanged = false;
+    for (unsigned i=0; i<_eo1.size(); i++)
+      {
+	if ( (_eo1[i]!=_eo2[i]) && (eo::rng.filp(rate)) )
+	{
+	  _eo1[i] = _eo2[i];
+	  hasChanged = true;
+	}
+      }
+    return hasChanged;
+  }
+
+  /** inherited className()*/
+  virtual string className() const { return "eoFlOrUniformBinOp"; }
+
+private:
+  double rate;
+};
+
+//////////////////////////////////////////////////////////////////////
+//                        eoFlOr1ptBinOp
+//////////////////////////////////////////////////////////////////////
+
+/** The 1pt  crossover (just in case someone wants it some day!) */
+template 
+class eoFlOr1ptBinOp : public eoBinOp
+{
+public :
+
+  typedef typename EOT::AtomType AtomType;
+
+  /** default ctor: no argument */
+  eoVlUniformBinOp() {}
+
+  /** exchanges first and second parts of the vectors of Atoms */
+  bool operator()(EOT & _eo1, EOT & _eo2)
+  {
+    unsigned i;
+    Atom tmp;
+    if (_eo1.size() != _eo2.size())
+      {
+	string s = "Operand size don't match in " + className();
+	throw runtime_error(s);
+  }
+    bool hasChanged = false;
+    unsigned where = eo::rng.random(_eo1.size()-1);
+    for (unsigned i=where+1; i<_eo1.size(); i++)
+      {
+	if ( (_eo1[i]!=_eo2[i]) )
+	{
+	  _eo1[i] = _eo2[i];
+	  hasChanged = true;
+	}
+      }
+    return hasChanged;
+  }
+
+  /** inherited className()*/
+  virtual string className() const { return "eoFlOr1ptBinOp"; }
+
+};
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoFlOrMonOp.h b/trunk/paradiseo-eo/src/eoFlOrMonOp.h
new file mode 100644
index 000000000..4b56cb515
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoFlOrMonOp.h
@@ -0,0 +1,118 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoFlOrMonOp.h
+// (c) Marc Schoenauer - Maarten Keijzer 2000-2003
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@polytechnique.fr
+             mkeijzer@cs.vu.nl
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoFlOrMonOp_h
+#define _eoFlOrMonOp_h
+
+#include 
+#include 
+#include 
+
+/** Base classes for generic mutations on fixed length chromosomes.
+ *  COntains 2 classes that both use an atomic mutation
+ *      eoFlOrAllMutation applies the atom mutation to all components with given rate
+ *      eoFlOrKMutation applies the atom mutation to a fixed nb of components
+ *
+ * Remark: the standard bit-flip mutation is an eoFlOrAllMutation 
+ *                      with atom mutation == bitflipping
+ */
+
+/** applies an atomic mutation to all the components with a given rate
+ */
+template 
+class eoFlOrAllMutation : public eoMonOp
+{
+public :
+
+  typedef typename EOT::AtomType AtomType;
+
+  /** default ctor: requires an Atom mutation and a rate */
+  eoFlOrAllMutation(eoMonOp & _atomMutation, double _rate=1.0) :
+    atomMutation(_atomMutation), rate(_rate) {}
+
+  /** applies the atom mutation to all components with given rate */
+  bool operator()(EOT & _eo)
+  {
+    bool modified=false;
+    for (unsigned i=0; i<_eo.size(); i++)
+      if (eo::rng.flip(rate))
+	if (atomMutation(_eo[i]))
+	  modified = true;
+
+    return modified;
+  }
+
+  /** inherited className() */
+  virtual std::string className() const 
+  { 
+    return "eoFlOrAllMutation(" + atomMutation.className() + ")";
+  }
+
+private:
+  eoMonOp & atomMutation; // the atom mutation
+  double rate;			   // the mutation rate PER ATOM
+};
+
+/** Applies an atomic mutation to a fixed
+    number of components (1 by default)
+ */
+template 
+class eoFlOrKMutation : public eoMonOp
+{
+public :
+
+  typedef typename EOT::AtomType AtomType;
+
+  /** default ctor: requires an Atom mutation */
+  eoFlOrKMutation(eoMonOp & _atomMutation, unsigned _nb=1) :
+    nb(_nb), atomMutation(_atomMutation) {}
+
+
+  /** applies the atom mutation to K randomly selected components */
+  bool operator()(EOT & _eo)
+  {
+    bool modified=false;
+    for (unsigned k=0; k & atomMutation; // the atom mutation
+};
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoFlOrQuadOp.h b/trunk/paradiseo-eo/src/eoFlOrQuadOp.h
new file mode 100644
index 000000000..1ad873c48
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoFlOrQuadOp.h
@@ -0,0 +1,213 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoFlOrQuadOp.h
+// (c) Marc Schoenauer - Maarten Keijzer 2000-2003
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@polytechnique.fr
+             mkeijzer@cs.vu.nl
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoFlOrQuadOp_h
+#define _eoFlOrQuadOp_h
+
+#include 
+#include 
+
+/** Generic eoQuadOps on fixed length genotypes.
+ *  Contains exchange crossovers (1pt and uniform)
+ *      and crossovers that applies an Atom crossover 
+ *          to all components with given rate, or
+ *          to a fixed prescribed nb of components
+*/
+
+//////////////////////////////////////////////////////////////////////
+//                        eoFlOrAllAtomQuadOp
+//////////////////////////////////////////////////////////////////////
+
+/** Quad Crossover using an Atom Crossover
+ */
+template 
+class eoFlOrAllAtomQuadOp : public eoQuadOp
+{
+public :
+
+  typedef typename EOT::AtomType AtomType;
+
+  /** default ctor: requires an Atom QuadOp */
+  eoFlOrAllAtomQuadOp( eoQuadOp& _op, double _rate = 1):
+    op(_op), rate( _rate ) {}
+
+  /** applies Atom crossover to ALL components with given rate */
+  bool operator()(EOT & _eo1, EOT & _eo2)
+  {
+    bool changed = false;
+    for ( unsigned i = 0; i < _eo1.size(); i++ ) {
+      if ( rng.flip( rate ) ) {
+	bool changedHere = op( _eo1[i], _eo2[i] );
+	changed |= changedHere;
+      }
+    }
+    return changed;
+  }
+
+  /** inherited className()*/
+  virtual string className() const { return "eoFlOrAllAtomQuadOp"; }
+
+private:
+  double rate;
+  eoQuadOp & op;
+};
+
+//////////////////////////////////////////////////////////////////////
+//                        eoFlOrKAtomQuadOp
+//////////////////////////////////////////////////////////////////////
+/** Quad Crossover using an Atom Crossover
+ *  that is applied to a FIXED NB of components
+ */
+template 
+class eoFlOrKAtomQuadOp : public eoQuadOp
+{
+public :
+
+  typedef typename EOT::AtomType AtomType;
+
+  /** default ctor: requires an Atom QuadOp and an unsigned */
+  eoFlOrAtomQuadOp( eoQuadOp& _op, unsigned _k = 1):
+    op(_op), k( _k ) {}
+
+  /** applies the Atom QuadOp to some components */
+  bool operator()(EOT & _eo1, const EOT & _eo2)
+  {
+    if (_eo1.size() != _eo2.size())
+      {
+	string s = "Operand size don't match in " + className();
+	throw runtime_error(s);
+      }
+
+    bool changed = false;
+    for ( unsigned i = 0; i < k; i++ ) // TODO: check that we don't do twice the same
+      {
+	unsigned where = eo::rng.random(_eo1.size());
+	bool changedHere = op( _eo1[where], _eo2[where] );
+	changed |= changedHere;
+      }
+    return changed;
+  }
+
+  /** inherited className()*/
+  virtual string className() const { return "eoFlOrKAtomQuadOp"; }
+
+private:
+  unsigned k;
+  eoQuadOp & op;
+};
+
+
+//////////////////////////////////////////////////////////////////////
+//                        eoFlOrUniformQuadOp
+//////////////////////////////////////////////////////////////////////
+/** The uniform crossover - exchanges atoms uniformly ! */
+template 
+class eoFlOrUniformQuadOp : public eoQuadOp
+{
+public :
+
+  typedef typename EOT::AtomType AtomType;
+
+  /** default ctor: requires a rate - 0.5 by default */
+  eoVlUniformQuadOp(double _rate=0.5) : eoQuadOp(_size),
+    rate(_rate) {}
+
+  /** excahnges atoms at given rate */
+  bool operator()(EOT & _eo1, EOT & _eo2)
+  {
+    unsigned i;
+    Atom tmp;
+    if (_eo1.size() != _eo2.size())
+      {
+	string s = "Operand size don't match in " + className();
+	throw runtime_error(s);
+  }
+    bool hasChanged = false;
+    for (unsigned i=0; i<_eo1.size(); i++)
+      {
+	if ( (_eo1[i]!=_eo2[i]) && (eo::rng.filp(rate)) )
+	{
+	  tmp = _eo1[i];
+	  _eo1[i] = _eo2[i];
+	  _eo2[i] = tmp;
+	  hasChanged = true;
+	}
+      }
+    return hasChanged;
+  }
+
+  /** inherited className()*/
+  virtual string className() const { return "eoFlOrUniformQuadOp"; }
+
+private:
+  double rate;
+};
+
+//////////////////////////////////////////////////////////////////////
+//                        eoFlOr1ptQuadOp
+//////////////////////////////////////////////////////////////////////
+/** The 1pt  crossover (just in case someone wants it some day!) */
+template 
+class eoFlOr1ptQuadOp : public eoQuadOp
+{
+public :
+
+  typedef typename EOT::AtomType AtomType;
+
+  /** default ctor: no argument */
+  eoVlUniformQuadOp() {}
+
+  /** exchanges first and second parts of the vectors of Atoms */
+  bool operator()(EOT & _eo1, EOT & _eo2)
+  {
+    unsigned i;
+    Atom tmp;
+    if (_eo1.size() != _eo2.size())
+      {
+	string s = "Operand size don't match in " + className();
+	throw runtime_error(s);
+  }
+    bool hasChanged = false;
+    unsigned where = eo::rng.random(_eo1.size()-1);
+    for (unsigned i=where+1; i<_eo1.size(); i++)
+      {
+	if ( (_eo1[i]!=_eo2[i]) )
+	{
+	  tmp = _eo1[i];
+	  _eo1[i] = _eo2[i];
+	  _eo2[i] = tmp;
+	  hasChanged = true;
+	}
+      }
+    return hasChanged;
+  }
+
+  /** inherited className()*/
+  virtual string className() const { return "eoFlOr1ptQuadOp"; }
+
+};
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoFunctor.h b/trunk/paradiseo-eo/src/eoFunctor.h
new file mode 100644
index 000000000..426cd3ce3
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoFunctor.h
@@ -0,0 +1,177 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoFunctor.h
+// (c) Maarten Keijzer 2000
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             mak@dhi.dk
+    CVS Info: $Date: 2004/12/01 09:22:48 $ $Header: /cvsroot/eodev/eo/src/eoFunctor.h,v 1.7 2004/12/01 09:22:48 evomarc Exp $ $Author: evomarc $ 
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoFunctor_h
+#define _eoFunctor_h
+
+#include 
+
+/** Base class for functors to get a nice hierarchy diagram
+
+    That's actually quite an understatement as it does quite a bit more than
+    just that. By having all functors derive from the same base class, we can
+    do some memory management that would otherwise be very hard.
+
+    The memory management base class is called eoFunctorStore, and it supports
+    a member add() to add a pointer to a functor. When the functorStore is
+    destroyed, it will delete all those pointers. So beware: do not delete
+    the functorStore before you are done with anything that might have been allocated.
+
+    @see eoFunctorStore
+
+*/
+class eoFunctorBase
+{
+public :
+    /// virtual dtor here so there is no need to define it in derived classes
+    virtual ~eoFunctorBase() {}
+
+    /// tag to identify a procedure in compile time function selection @see functor_category
+    struct procedure_tag {};
+    /// tag to identify a unary function in compile time function selection @see functor_category
+    struct unary_function_tag {};
+    /// tag to identify a binary function in compile time function selection @see functor_category
+    struct binary_function_tag {};
+};
+
+/**
+    Basic Function. Derive from this class when defining
+    any procedure. It defines a result_type that can be used
+    to determine the return type
+    Argument and result types can be any type including void for
+    result_type
+**/
+template 
+class eoF : public eoFunctorBase
+{
+public :
+
+    /// virtual dtor here so there is no need to define it in derived classes
+    virtual ~eoF() {}
+
+  /// the return type - probably useless ....
+    typedef R result_type;
+
+    /// The pure virtual function that needs to be implemented by the subclass
+    virtual R operator()() = 0;
+
+    /// tag to identify a procedure in compile time function selection @see functor_category
+    static eoFunctorBase::procedure_tag functor_category()
+    {
+	return eoFunctorBase::procedure_tag();
+    }
+};
+
+/**
+    Overloaded function that can help in the compile time detection 
+    of the type of functor we are dealing with
+
+    @see eoCounter, make_counter
+*/
+template
+eoFunctorBase::procedure_tag functor_category(const eoF&)
+{
+    return eoFunctorBase::procedure_tag();
+}
+
+/** 
+    Basic Unary Functor. Derive from this class when defining 
+    any unary function. First template argument is the first_argument_type,
+    second result_type.
+    Argument and result types can be any type including void for
+    result_type
+**/
+template 
+class eoUF : public eoFunctorBase, public std::unary_function
+{
+public :
+
+    /// virtual dtor here so there is no need to define it in derived classes
+    virtual ~eoUF() {}
+
+    /// The pure virtual function that needs to be implemented by the subclass
+    virtual R operator()(A1) = 0;
+
+    /// tag to identify a procedure in compile time function selection @see functor_category
+    static eoFunctorBase::unary_function_tag functor_category()
+    {
+	return eoFunctorBase::unary_function_tag();
+    }
+};
+
+/**
+    Overloaded function that can help in the compile time detection 
+    of the type of functor we are dealing with
+    @see eoCounter, make_counter
+*/
+template
+eoFunctorBase::unary_function_tag functor_category(const eoUF&)
+{
+    return eoFunctorBase::unary_function_tag();
+}
+
+
+/** 
+    Basic Binary Functor. Derive from this class when defining 
+    any binary function. First template argument is result_type, second
+    is first_argument_type, third is second_argument_type.
+    Argument and result types can be any type including void for
+    result_type
+**/
+template 
+class eoBF : public eoFunctorBase, public std::binary_function
+{
+public :
+        /// virtual dtor here so there is no need to define it in derived classes
+    virtual ~eoBF() {}
+    
+    //typedef R result_type;
+    //typedef A1 first_argument_type;
+    //typedef A2 second_argument_type;
+
+    /// The pure virtual function that needs to be implemented by the subclass
+    virtual R operator()(A1, A2) = 0;
+
+    /// tag to identify a procedure in compile time function selection @see functor_category
+    static eoFunctorBase::binary_function_tag functor_category()
+    {
+	return eoFunctorBase::binary_function_tag();
+    }
+};
+
+/**
+    Overloaded function that can help in the compile time detection 
+    of the type of functor we are dealing with
+    @see eoCounter, make_counter
+*/
+template
+eoFunctorBase::binary_function_tag functor_category(const eoBF&)
+{
+    return eoFunctorBase::binary_function_tag();
+}
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoFunctorStore.cpp b/trunk/paradiseo-eo/src/eoFunctorStore.cpp
new file mode 100644
index 000000000..cb8d1a574
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoFunctorStore.cpp
@@ -0,0 +1,16 @@
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif
+
+#include 
+#include 
+
+
+/// clears the memory
+eoFunctorStore::~eoFunctorStore()
+{
+    for(size_t i = 0; i < vec.size(); ++i) {
+        delete vec[i];
+    }
+}
diff --git a/trunk/paradiseo-eo/src/eoFunctorStore.h b/trunk/paradiseo-eo/src/eoFunctorStore.h
new file mode 100644
index 000000000..02855b47b
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoFunctorStore.h
@@ -0,0 +1,70 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoFunctorStore.h
+// (c) Maarten Keijzer 2000, GeNeura Team, 2000
+/*
+  This library is free software; you can redistribute it and/or
+  modify it under the terms of the GNU Lesser General Public
+  License as published by the Free Software Foundation; either
+  version 2 of the License, or (at your option) any later version.
+
+  This library is distributed in the hope that it will be useful,
+  but WITHOUT ANY WARRANTY; without even the implied warranty of
+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+  Lesser General Public License for more details.
+
+  You should have received a copy of the GNU Lesser General Public
+  License along with this library; if not, write to the Free Software
+  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+  Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+  Marc.Schoenauer@polytechnique.fr
+  mak@dhi.dk
+*/
+//-----------------------------------------------------------------------------
+
+#ifndef _eoFunctorStore_h
+#define _eoFunctorStore_h
+
+#include 
+
+class eoFunctorBase;
+
+/**
+   eoFunctorStore is a class that stores functors that are allocated on the
+   heap. This class can be used in factories to store allocated memory for
+   dynamically created functors.
+*/
+class eoFunctorStore
+{
+public:
+
+    /// Default Ctor
+    eoFunctorStore() {}
+
+    // virtual destructor so we don't need to define it in derived classes
+    virtual ~eoFunctorStore();
+
+    /// Add an eoFunctorBase to the store
+    template 
+    Functor& storeFunctor(Functor* r)
+        {
+            // If the compiler complains about the following line,
+            // check if you really are giving it a pointer to an
+            // eoFunctorBase derived object
+            vec.push_back(r);
+            return *r;
+        }
+
+private :
+
+    /// no copying allowed
+    eoFunctorStore(const eoFunctorStore&);
+
+    /// no copying allowed
+    eoFunctorStore operator=(const eoFunctorStore&);
+    std::vector vec;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoG3Replacement.h b/trunk/paradiseo-eo/src/eoG3Replacement.h
new file mode 100644
index 000000000..7e7950f78
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoG3Replacement.h
@@ -0,0 +1,86 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eoG3Replacement.h 
+   (c) Maarten Keijzer, Marc Schoenauer, 2002
+ 
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@inria.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoG3Replacement_h
+#define _eoG3Replacement_h
+
+
+//-----------------------------------------------------------------------------
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+//-----------------------------------------------------------------------------
+
+/**
+eoG3Replacement is an eoReplacement:
+- no strong elitism (is suppposed to be within a steady-state engine)
+- choose N (2) parents RANDOMLY - remove them from the parent population
+- merge offspring and the N removed parents
+- select best N of this merged population
+- put them back into parent population
+
+*/
+
+template 
+class eoG3Replacement : public eoReplacement
+{
+public:
+  eoG3Replacement(eoHowMany _howManyEliminatedParents = eoHowMany(2, false)) :
+    // split truncates the parents and returns eliminated parents
+    split(_howManyEliminatedParents, true), 
+    // reduce truncates the offpsring and does not return eliminated guys
+    reduce(-_howManyEliminatedParents, false) 
+  {}
+    
+    void operator()(eoPop & _parents, eoPop & _offspring)
+    {
+      eoPop temp;
+      split(_parents, temp);
+      unsigned toKeep = temp.size(); // how many to keep from merged populations
+      // merge temp into offspring
+      plus(temp, _offspring);	   // add temp to _offspring (a little inconsistent!)
+      
+      // reduce merged
+      reduce(_offspring, temp);	   // temp dummy arg. will not be modified
+      // minimla check:
+      if (_offspring.size() != toKeep)
+	{
+	  std::cerr << "Les tailles " << _offspring.size() << " " << toKeep << std::endl;
+	throw std::runtime_error("eoG3Replacement: wrong number of remaining offspring");
+	}
+      // and put back into _parents
+      plus(_offspring, _parents);      
+    }
+
+private:
+  eoLinearTruncateSplit split; // few parents to truncate -> linear 
+  eoTruncateSplit reduce;	   // supposedly many offspring to truncate
+  eoPlus plus;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoGenContinue.h b/trunk/paradiseo-eo/src/eoGenContinue.h
new file mode 100644
index 000000000..7d24e2438
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoGenContinue.h
@@ -0,0 +1,103 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoGenContinue.h
+// (c) GeNeura Team, 1999
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoGenContinue_h
+#define _eoGenContinue_h
+
+#include 
+#include 
+/** 
+    Generational continuator: continues until a number of generations is reached
+*/
+template< class EOT>
+class eoGenContinue: public eoContinue, public eoValueParam
+{
+public:
+
+  /// Ctor for setting a
+  eoGenContinue( unsigned long _totalGens)
+	  : eoValueParam(0, "Generations", "Generations"),
+	    repTotalGenerations( _totalGens ), 
+	    thisGenerationPlaceHolder(0),
+	    thisGeneration(thisGenerationPlaceHolder), verbose(true) {};
+  
+  /// Ctor for enabling the save/load the no. of generations counted
+  eoGenContinue( unsigned long _totalGens, unsigned long& _currentGen)
+	  : eoValueParam(0, "Generations", "Generations"),
+	    repTotalGenerations( _totalGens ), 
+	    thisGenerationPlaceHolder(0),
+	    thisGeneration(_currentGen), verbose(true){};
+  
+  /** Returns false when a certain number of generations is
+	 * reached */
+  virtual bool operator() ( const eoPop& _vEO ) {
+    thisGeneration++;
+    value() = thisGeneration;
+    //	  std::cout << " [" << thisGeneration << "] ";
+    if (thisGeneration >= repTotalGenerations) 
+      {
+	  if (verbose)
+	    std::cout << "STOP in eoGenContinue: Reached maximum number of generations [" << thisGeneration << "/" << repTotalGenerations << "]\n";
+	return false;
+      }
+    return true;
+  }
+  
+  /** Sets the number of generations to reach 
+	    and sets the current generation to 0 (the begin)*/
+  virtual void totalGenerations( unsigned long _tg ) { 
+	  repTotalGenerations = _tg; 
+	  thisGeneration = 0;
+	};
+  
+  /** Returns the number of generations to reach*/
+  virtual unsigned long totalGenerations( ) 
+  {  
+    return repTotalGenerations; 
+  };
+    
+  
+  virtual std::string className(void) const { return "eoGenContinue"; }
+
+  void readFrom (std :: istream & __is) {
+    
+    __is >> thisGeneration; /* Loading the number of generations counted */
+  }
+  
+  void printOn (std :: ostream & __os) const {
+    
+    __os << thisGeneration << std :: endl; /* Saving the number of generations counted */   
+  }
+
+private:
+  unsigned long repTotalGenerations;
+  unsigned long thisGenerationPlaceHolder;
+  unsigned long& thisGeneration;
+  
+public:
+  bool verbose; // allows to turn off annoying message to cout
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/eoGenOp.h b/trunk/paradiseo-eo/src/eoGenOp.h
new file mode 100644
index 000000000..f2bea9c58
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoGenOp.h
@@ -0,0 +1,224 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoGenOp.h
+// (c) Maarten Keijzer and Marc Schoenauer, 2001
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: mak@dhi.dk
+             Marc.Schoenauer@polytechnique.fr
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoGenOp_H
+#define _eoGenOp_H
+
+#include 
+#include 
+#include 
+#include 
+
+/** @name General variation operators
+
+a class that allows to use i->j operators for any i and j
+thanks to the friend class eoPopulator
+
+@author Maarten Keijzer
+@version 0.0
+*/
+
+//@{
+
+/** The base class for General Operators
+Subclass this operator is you want to define an operator that falls
+outside of the eoMonOp, eoBinOp, eoQuadOp classification. The argument
+the operator will receive is an eoPopulator, which is a wrapper around
+the original population, is an instantiation of the next population and
+has often a selection function embedded in it to select new individuals.
+
+Note that the actual work is performed in the apply function.
+AND that the apply function is responsible for invalidating 
+the object if necessary
+ */
+template 
+class eoGenOp : public eoOp, public eoUF &, void>
+{
+  public :
+  /// Ctor that honors its superclass
+  eoGenOp(): eoOp( eoOp::general ) {}
+
+  /** Max production is used to reserve space for all elements that are used by the operator,
+      not setting it properly can result in a crash
+  */
+  virtual unsigned max_production(void) = 0;
+
+  virtual std::string className() const = 0;
+    void operator()(eoPopulator& _pop)
+    {
+    _pop.reserve(max_production());
+      apply(_pop);
+    }
+
+
+  protected :
+  /** the function that will do the work
+   */
+    virtual void apply(eoPopulator& _pop) = 0;
+};
+
+
+/** Wrapper for eoMonOp */
+template 
+class eoMonGenOp : public eoGenOp
+{
+   public:
+    eoMonGenOp(eoMonOp& _op) : op(_op) {}
+
+    unsigned max_production(void) { return 1; }
+
+    void apply(eoPopulator& _it)
+    {
+      if (op(*_it))
+        (*_it).invalidate();  // look how simple
+
+    }
+  virtual std::string className() const {return op.className();}
+   private :
+    eoMonOp& op;
+};
+
+/** Wrapper for binop: here we use select method of eoPopulator
+ *  but we could also have an embedded selector to select the second parent
+ */
+template 
+class eoBinGenOp : public eoGenOp
+{
+   public:
+    eoBinGenOp(eoBinOp& _op) : op(_op) {}
+
+    unsigned max_production(void) { return 1; } 
+
+  /** do the work: get 2 individuals from the population, modifies
+      only one (it's a eoBinOp) 
+      */
+    void apply(eoPopulator& _pop)
+    {
+      EOT& a = *_pop;
+      const EOT& b = _pop.select();
+
+      if (op(a, b))
+        a.invalidate();
+    }
+  virtual std::string className() const {return op.className();}
+
+   private :
+    eoBinOp& op;
+};
+
+/** wrapper for eoBinOp with a selector */
+template 
+class eoSelBinGenOp : public eoGenOp
+{
+   public:
+    eoSelBinGenOp(eoBinOp& _op, eoSelectOne& _sel) :
+      op(_op), sel(_sel) {}
+
+    unsigned max_production(void) { return 1; }
+
+    void apply(eoPopulator& _pop)
+    { // _pop.source() gets the original population, an eoVecOp can make use of this as well
+      if (op(*_pop, sel(_pop.source())))
+        (*_pop).invalidate();
+    }
+  virtual std::string className() const {return op.className();}
+
+   private :
+    eoBinOp& op;
+    eoSelectOne& sel;
+};
+
+
+/** Wrapper for quadop: easy as pie
+ */
+template 
+class eoQuadGenOp : public eoGenOp
+{
+   public:
+    eoQuadGenOp(eoQuadOp& _op) : op(_op) {}
+
+    unsigned max_production(void) { return 2; }
+
+    void apply(eoPopulator& _pop)
+    {
+      EOT& a = *_pop;
+      EOT& b = *++_pop;	
+      
+      
+      if(op(a, b))
+      {
+        a.invalidate();
+        b.invalidate();
+      }
+
+   }
+  virtual std::string className() const {return op.className();}
+
+   private :
+    eoQuadOp& op;
+};
+
+    /**
+    Factory function for automagically creating references to an
+    eoGenOp object. Useful when you are too lazy to figure out
+    which wrapper belongs to which operator. The memory allocated
+    in the wrapper will be stored in a eoFunctorStore (eoState derives from this).
+    Therefore the memory will only be freed when the eoFunctorStore is deleted.
+    Make very sure that you are not using these wrappers after this happens.
+
+    You can use this function 'wrap_op' in the following way. Suppose you've
+    created an eoQuadOp called my_quad, and you want to feed it to an eoTransform
+    derived class that expects an eoGenOp. If you have an eoState lying around
+    (which is generally a good idea) you can say:
+
+    eoDerivedTransform trans(eoGenOp::wrap_op(my_quad, state), ...);
+
+    And as long as your state is not destroyed (by going out of scope for example,
+    your 'trans' functor will be usefull.
+
+    As a final note, you can also enter an eoGenOp as the argument. It will
+    not allocate memory then. This to make it even easier to use the wrap_op function.
+    For an example of how this is used, check the eoOpContainer class.
+
+    @see eoOpContainer
+    */
+    template 
+    eoGenOp& wrap_op(eoOp& _op, eoFunctorStore& _store)
+    {
+      switch(_op.getType())
+      {
+        case eoOp::unary     : return _store.storeFunctor(new eoMonGenOp(static_cast&>(_op)));
+        case eoOp::binary    : return _store.storeFunctor(new eoBinGenOp(static_cast&>(_op)));
+        case eoOp::quadratic : return _store.storeFunctor(new eoQuadGenOp(static_cast&>(_op)));
+        case eoOp::general   : return static_cast&>(_op);
+      }
+
+      assert(false);
+      return static_cast&>(_op);
+    }
+
+#endif
+
+//@}
diff --git a/trunk/paradiseo-eo/src/eoGeneralBreeder.h b/trunk/paradiseo-eo/src/eoGeneralBreeder.h
new file mode 100644
index 000000000..db46ab90a
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoGeneralBreeder.h
@@ -0,0 +1,106 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoGeneralBreeder.h 
+// (c) Maarten Keijzer and Marc Schoenauer, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: mkeijzer@dhi.dk
+             Marc.Schoenauer@polytechnique.fr
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoGeneralBreeder_h
+#define eoGeneralBreeder_h
+
+//-----------------------------------------------------------------------------
+
+/*****************************************************************************
+ * eoGeneralBreeder: transforms a population using the generalOp construct.
+ *****************************************************************************/
+
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+
+/**
+  Base class for breeders using generalized operators.
+*/
+template
+class eoGeneralBreeder: public eoBreed
+{
+ public:
+  /** Ctor:
+   *
+   * @param _select a selectoOne, to be used for all selections
+   * @param _op a general operator (will generally be an eoOpContainer)
+   * @param _rate               pour howMany, le nbre d'enfants a generer
+   * @param _interpret_as_rate  explanation
+   */
+  eoGeneralBreeder(
+          eoSelectOne& _select,
+          eoGenOp& _op,
+	        double  _rate=1.0,
+          bool _interpret_as_rate = true) :
+      select( _select ), op(_op),  howMany(_rate, _interpret_as_rate) {}
+
+  /** Ctor:
+   *
+   * @param _select a selectoOne, to be used for all selections
+   * @param _op a general operator (will generally be an eoOpContainer)
+   * @param _howMany an eoHowMany explanation
+   */
+  eoGeneralBreeder(
+          eoSelectOne& _select,
+          eoGenOp& _op,
+	  eoHowMany _howMany ) :
+      select( _select ), op(_op),  howMany(_howMany) {}
+
+  /** The breeder: simply calls the genOp on a selective populator!
+   *
+   * @param _parents the initial population
+   * @param _offspring the resulting population (content -if any- is lost)
+   */
+  void operator()(const eoPop& _parents, eoPop& _offspring)
+    {
+      unsigned target = howMany(_parents.size());
+
+      _offspring.clear();
+      eoSelectivePopulator it(_parents, _offspring, select);
+
+      while (_offspring.size() < target)
+	    {
+	      op(it);
+	      ++it;
+	    }
+
+      _offspring.resize(target);   // you might have generated a few more
+    }
+
+  /// The class name.
+  virtual std::string className() const { return "eoGeneralBreeder"; }
+
+ private:
+  eoSelectOne& select;
+  eoGenOp& op;
+  eoHowMany howMany;
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/eoInit.h b/trunk/paradiseo-eo/src/eoInit.h
new file mode 100644
index 000000000..0df3de354
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoInit.h
@@ -0,0 +1,172 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoInit.h
+// (c) Maarten Keijzer 2000, GeNeura Team, 2000
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoInit_H
+#define _eoInit_H
+
+#include 
+
+#include 
+#include 
+#include 
+
+/**
+	Base (name) class for Initialization of chromosomes, used in a population
+	contructor. It is derived from eoMonOp, so it can be used
+    inside the algorithm as well.
+
+	@see eoPop
+*/
+
+template 
+class eoInit : public eoUF
+{
+public:
+
+  /** className: Mandatory because of eoCombinedInit. 
+     SHould be pure virtual, but then we should go over the whole
+   * code to write the method for all derived classes ... MS 16/7/04 */
+  virtual std::string className(void) const { return "eoInit"; }
+};
+
+/** turning an eoInit into a generator 
+ * probably we should only use genrators - and suppress eoInit ???
+ * MS - July 2001
+ */
+template 
+class eoInitGenerator :  public eoF
+{
+public:
+
+  /** Ctor from a plain eoInit */
+  eoInitGenerator(eoInit & _init):init(_init) {}
+
+  virtual EOT operator()()
+    {
+      EOT p;
+      init(p);
+      return (p);
+    }
+private:
+  eoInit & init;
+};
+
+/**
+    Initializer for fixed length representations with a single type
+*/
+template 
+class eoInitFixedLength: public eoInit
+{
+    public:
+
+    typedef typename EOT::AtomType AtomType;
+
+        eoInitFixedLength(unsigned _combien, eoRndGenerator& _generator)
+            : combien(_combien), generator(_generator) {}
+
+        virtual void operator()(EOT& chrom)
+        {
+            chrom.resize(combien);
+            std::generate(chrom.begin(), chrom.end(), generator);
+            chrom.invalidate();
+        }
+
+    private :
+        unsigned combien;
+        /// generic wrapper for eoFunctor (s), to make them have the function-pointer style copy semantics
+        eoSTLF generator;
+};
+
+/**
+    Initializer for variable length representations with a single type
+*/
+template 
+class eoInitVariableLength: public eoInit
+{
+public:
+typedef typename EOT::AtomType AtomType; 
+
+//   /** Ctor from a generator */
+//   eoInitVariableLength(unsigned _minSize, unsigned _maxSize, eoF & _generator = Gen())
+//     : offset(_minSize), extent(_maxSize - _minSize), 
+// 			 repGenerator( eoInitGenerator(*(new eoInit)) ), 
+// 			 generator(_generator)
+//   {
+//     if (_minSize >= _maxSize)
+//       throw std::logic_error("eoInitVariableLength: minSize larger or equal to maxSize");
+//   }
+
+  /** Ctor from an eoInit */
+  eoInitVariableLength(unsigned _minSize, unsigned _maxSize, eoInit & _init)
+    : offset(_minSize), extent(_maxSize - _minSize), init(_init)
+  {
+    if (_minSize >= _maxSize)
+      throw std::logic_error("eoInitVariableLength: minSize larger or equal to maxSize");
+  }
+
+
+  virtual void operator()(EOT& _chrom)
+  {
+    _chrom.resize(offset + rng.random(extent));
+    typename std::vector::iterator it;
+    for (it=_chrom.begin(); it<_chrom.end(); it++)
+      init(*it);
+    _chrom.invalidate();
+  }
+
+  // accessor to the atom initializer (needed by operator constructs sometimes)
+  eoInit & atomInit() {return init;}
+
+private :
+  unsigned offset;
+  unsigned extent;
+  eoInit & init;
+};
+
+/**
+    eoInitAdaptor changes the place in the hierarchy
+    from eoInit to eoMonOp. This is mainly a type conversion,
+    nothing else
+    .
+    @see eoInit, eoMonOp
+*/
+template 
+class eoInitAdaptor : public eoMonOp
+{
+    public :
+        eoInitAdaptor(eoInit& _init) : init(_init) {}
+
+        bool operator()(EOT& _eot)
+        {
+            init(_eot);
+            return true;
+        }
+    private :
+
+        eoInit& init;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoInvalidateOps.h b/trunk/paradiseo-eo/src/eoInvalidateOps.h
new file mode 100644
index 000000000..4643c7270
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoInvalidateOps.h
@@ -0,0 +1,134 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoInvalidateOps.h
+// (c) Maarten Keijzer 2001
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoInvalidateOps_h
+#define _eoInvalidateOps_h
+
+#include 
+
+/**
+One of the invalidator operators. Use this one as a 'hat' on an operator
+that is defined to work on a generic datatype. This functor will then check
+the return type of the operator and invalidate the fitness of the individual.
+
+This functor is used in algorithms that work with straight eoMonOp, eoBinOp
+or eoQuadOp operators, for instance eoSGA. Note that eoGenOp derived operators
+generally do invalidate the fitness of the objects they have changed.
+
+Return value means "Has_Changed" and not "Needs_To_Be_Invalidated"
+as successive invalidation are not really a problem
+*/
+
+template 
+class eoInvalidateMonOp : public eoMonOp
+{
+  public:
+    eoInvalidateMonOp(eoMonOp& _op) : op(_op) {}
+
+    bool operator()(EOT& _eo)
+    {
+      if (op(_eo))
+      {
+        _eo.invalidate();
+        return true;
+      }
+
+      return false; 
+    }
+
+  private:
+    eoMonOp& op;
+};
+
+/**
+One of the invalidator operators. Use this one as a 'hat' on an operator
+that is defined to work on a generic datatype. This functor will then check
+the return type of the operator and invalidate the fitness of the individual.
+
+This functor is used in algorithms that work with straight eoMonOp, eoBinOp
+or eoQuadOp operators, for instance eoSGA. Note that eoGenOp derived operators
+generally do invalidate the fitness of the objects they have changed.
+
+Return value means "Has_Changed" and not "Needs_To_Be_Invalidated"
+as successive invalidation are not really a problem
+*/
+
+template 
+class eoInvalidateBinOp : public eoBinOp
+{
+  public:
+    eoInvalidateBinOp(eoBinOp& _op) : op(_op) {}
+
+    bool operator()(EOT& _eo, const EOT& _eo2)
+    {
+      if (op(_eo, _eo2))
+      {
+        _eo.invalidate();
+        return true;
+      }
+
+      return false;
+    }
+
+  private:
+    eoBinOp& op;
+};
+
+/**
+One of the invalidator operators. Use this one as a 'hat' on an operator
+that is defined to work on a generic datatype. This functor will then check
+the return type of the operator and invalidate the fitness of the individual.
+
+This functor is used in algorithms that work with straight eoMonOp, eoBinOp
+or eoQuadOp operators, for instance eoSGA. Note that eoGenOp derived operators
+generally do invalidate the fitness of the objects they have changed.
+
+Return value means "Has_Changed" and not "Needs_To_Be_Invalidated"
+as successive invalidation are not really a problem
+*/
+
+template 
+class eoInvalidateQuadOp : public eoQuadOp
+{
+  public:
+    eoInvalidateQuadOp(eoQuadOp& _op) : op(_op) {}
+
+    bool operator()(EOT& _eo1, EOT& _eo2)
+    {
+      if (op(_eo1, _eo2))
+      {
+        _eo1.invalidate();
+        _eo2.invalidate();
+        return true;
+      }
+      return false;
+    }
+
+  private:
+    eoQuadOp& op;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoLinearFitScaling.h b/trunk/paradiseo-eo/src/eoLinearFitScaling.h
new file mode 100644
index 000000000..e5f4c8192
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoLinearFitScaling.h
@@ -0,0 +1,92 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eoLinearFitScaling.h
+   (c) GeNeura Team, 1998, Maarten Keijzer, Marc Schoenauer, 2001
+
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoLinearFitScaling_h
+#define eoLinearFitScaling_h
+
+#include 
+#include 
+
+/** An instance of eoPerf2Worth
+ *  COmputes the linearly scaled fitnesses
+ *  with given selective pressure
+ *  Pselect(Best) == pressure/sizePop
+ *  Pselect(average) == 1.0/sizePop
+ *  truncate negative values to 0 -
+ *
+ * to be used within an eoSelectFromWorth object
+ */
+template 
+class eoLinearFitScaling : public eoPerf2Worth // false: do not cache fitness
+{
+public:
+
+    using eoPerf2Worth::value;
+
+    /* Ctor:
+       @param _p selective pressure (in (1,2])
+       @param _e exponent (1 == linear)
+    */
+    eoLinearFitScaling(double _p=2.0)
+        : pressure(_p) {}
+
+    /* COmputes the ranked fitness: fitnesses range in [m,M]
+       with m=2-pressure/popSize and M=pressure/popSize.
+       in between, the progression depends on exponent (linear if 1).
+    */
+    virtual void operator()(const eoPop& _pop) {
+        unsigned pSize =_pop.size();
+        // value() refers to the vector of worthes (we're in an eoParamvalue)
+        value().resize(pSize);
+
+        // best and worse fitnesses
+        double bestFitness = static_cast (_pop.best_element().fitness());
+        //    double worstFitness = static_cast (_pop.worse_element().fitness());
+
+        // average fitness
+        double sum=0.0;
+        unsigned i;
+        for (i=0; i(_pop[i].fitness());
+        double averageFitness = sum/pSize;
+
+        // the coefficients for linear scaling
+        double denom = pSize*(bestFitness - averageFitness);
+        double alpha = (pressure-1)/denom;
+        double beta = (bestFitness - pressure*averageFitness)/denom;
+
+        for (i=0; i
+#include 
+#include 
+#include 
+#include 
+#include 
+//-----------------------------------------------------------------------------
+
+/**
+eoMGGReplacement is an eoReplacement:
+- choose N (2) parents RANDOMLY - remove them from the parent population
+- select best offspring, add to parents
+- merge (other?) offspring and the N removed parents
+- select best N-1 of this merged population (detTournament only at the moment)
+- put them back into parent population
+
+*/
+
+template 
+class eoMGGReplacement : public eoReplacement
+{
+public:
+  eoMGGReplacement(eoHowMany _howManyEliminatedParents = eoHowMany(2, false),
+		   unsigned _tSize=2) :
+    // split truncates the parents and returns eliminated parents
+    split(_howManyEliminatedParents, true), 
+    tSize(_tSize)
+  {
+    if (tSize < 2)
+      { 
+	std::cout << "Warning, Size for eoDetTournamentTruncateSplit adjusted to 2\n";
+	tSize = 2;
+      }
+  }
+    
+    void operator()(eoPop & _parents, eoPop & _offspring)
+    {
+      eoPop temp;
+      split(_parents, temp);
+      unsigned toKeep = temp.size(); // how many to keep from merged populations
+      // minimal check
+      if (toKeep < 2)
+	throw std::runtime_error("Not enough parents killed in eoMGGReplacement");
+
+      // select best offspring
+      typename eoPop::iterator it = _offspring.it_best_element();
+      // add to parents
+      _parents.push_back(*it);
+      // remove from offspring
+      _offspring.erase(it);
+
+      // merge temp into offspring
+      plus(temp, _offspring);
+      
+      // repeatedly add selected offspring to parents
+      for (unsigned i=0; i split; // few parents to truncate -> linear 
+  eoPlus plus;
+  unsigned int tSize;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoMerge.h b/trunk/paradiseo-eo/src/eoMerge.h
new file mode 100644
index 000000000..defd1fc56
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoMerge.h
@@ -0,0 +1,134 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoMerge.h
+//   Base class for elitist-merging classes
+// (c) GeNeura Team, 1998
+/* 
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+   Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoMerge_h
+#define eoMerge_h
+
+//-----------------------------------------------------------------------------
+
+#include 
+
+// EO includes
+#include      // eoPop
+#include   // eoMerge
+
+/**
+ * eoMerge: Base class for elitist replacement algorithms. 
+ * Merges the old population (first argument), with the new generation
+ *
+ * Its signature is exactly
+ * that of the selection base eoSelect, but its purpose is to merge the 
+ * two populations into one (the second argument).
+ * Note that the algorithms assume that the second argument denotes the 
+ * next generation.
+*/
+
+template class eoMerge: public eoBF&, eoPop&, void>
+{};
+
+/**
+Straightforward elitism class, specify the number of individuals to copy
+into new geneneration or the rate w.r.t. pop size
+*/
+template  class eoElitism : public eoMerge
+{
+public :
+  eoElitism(double  _rate, bool _interpret_as_rate = true):
+    rate(0), combien(0)
+  {
+    if (_interpret_as_rate)
+      {
+	if ( (_rate<0) || (_rate>1) )
+	  throw std::logic_error("eoElitism: rate shoud be in [0,1]");
+	rate = _rate;
+      }
+    else
+      {
+	if (_rate<0)
+	  throw std::logic_error("Negative number of offspring in eoElitism!");
+	combien = (unsigned int)_rate;
+	if (combien != _rate)
+	  std::cout << "Warning: Number of guys to merge in eoElitism was rounded";
+      }
+  }
+  
+  void operator()(const eoPop& _pop, eoPop& _offspring)
+  {
+    if ((combien == 0) && (rate == 0.0))
+      return;
+    unsigned combienLocal;
+    if (combien == 0)	   // rate is specified
+      combienLocal = (unsigned int) (rate * _pop.size());
+    else
+      combienLocal = combien;
+    
+    if (combienLocal > _pop.size())
+      throw std::logic_error("Elite larger than population");
+    
+    std::vector result;
+    _pop.nth_element(combienLocal, result);
+    
+    for (size_t i = 0; i < result.size(); ++i)
+      {
+	_offspring.push_back(*result[i]);
+      }
+  }
+  
+private :
+  double rate;
+  unsigned combien;
+};
+
+/**
+No elite
+*/
+template  class eoNoElitism : public eoElitism
+{
+    public :
+        eoNoElitism() : eoElitism(0) {}
+};
+
+/**
+Very elitist class, copies entire population into next gen
+*/
+template  class eoPlus : public eoMerge
+{
+    public :
+        void operator()(const eoPop& _pop, eoPop& _offspring)
+        {
+            _offspring.reserve(_offspring.size() + _pop.size());
+
+            for (size_t i = 0; i < _pop.size(); ++i)
+            {
+                _offspring.push_back(_pop[i]);
+            }
+        }
+
+    private :
+};
+
+//-----------------------------------------------------------------------------
+
+#endif 
diff --git a/trunk/paradiseo-eo/src/eoMergeReduce.h b/trunk/paradiseo-eo/src/eoMergeReduce.h
new file mode 100644
index 000000000..f0c6a1b5a
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoMergeReduce.h
@@ -0,0 +1,115 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eoMergeReduce.h 
+   (c) Maarten Keijzer, GeNeura Team, 2000
+ 
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+   Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoMergeReduce_h
+#define _eoMergeReduce_h
+
+
+//-----------------------------------------------------------------------------
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+//-----------------------------------------------------------------------------
+/** 
+Replacement strategies that combine en eoMerge and an eoReduce.
+
+@classes: eoMergeReduce, the base (pure abstract) class
+          eoPlusReplacement the ES plus strategy
+	  eoCommaReplacement the ES comma strategy
+*/
+
+/**
+eoMergeReduce: abstract replacement strategy that is just an application of 
+an embedded merge, followed by an embedded reduce
+*/
+template 
+class eoMergeReduce : public eoReplacement
+{
+    public:
+        eoMergeReduce(eoMerge& _merge, eoReduce& _reduce) :
+        merge(_merge), reduce(_reduce)
+        {}
+
+        void operator()(eoPop& _parents, eoPop& _offspring)
+        {
+            merge(_parents, _offspring); // parents untouched, result in offspring
+            reduce(_offspring, _parents.size());
+	    _parents.swap(_offspring);
+        }
+
+    private :
+        eoMerge& merge;
+        eoReduce& reduce;
+};
+
+/**
+ES type of replacement strategy: first add parents to population, then truncate
+*/
+template 
+class eoPlusReplacement : public eoMergeReduce
+{
+    public :
+        eoPlusReplacement() : eoMergeReduce(plus, truncate) {}
+
+    private :
+        eoPlus plus;
+        eoTruncate truncate;
+};
+
+/**
+ES type of replacement strategy: ignore parents, truncate offspring
+*/
+template 
+class eoCommaReplacement : public eoMergeReduce
+{
+    public :
+        eoCommaReplacement() : eoMergeReduce(no_elite, truncate) {}
+
+    private :
+        eoNoElitism no_elite;
+        eoTruncate truncate;
+};
+
+/**
+EP type of replacement strategy: first add parents to population, 
+   then truncate using EP tournament
+*/
+template 
+class eoEPReplacement : public eoMergeReduce
+{
+public :
+  eoEPReplacement(int _tSize) : eoMergeReduce(plus, truncate), truncate(_tSize)
+    //  {truncate.setSize(_tSize);}
+  {}
+private :
+  eoPlus plus;
+  eoEPReduce truncate;
+};
+
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoNDSorting.h b/trunk/paradiseo-eo/src/eoNDSorting.h
new file mode 100644
index 000000000..bbeab38b2
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoNDSorting.h
@@ -0,0 +1,496 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eoNDSorting.h
+   (c) Maarten Keijzer, Marc Schoenauer, 2001
+
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoNDSorting_h
+#define eoNDSorting_h
+
+#include 
+#include 
+#include 
+#include 
+#include 
+
+/**
+  Non dominated sorting, it *is a* std::vector of doubles, the integer part is the rank (to which front it belongs),
+  the fractional part the niching penalty or distance penalty or whatever penalty you want to squeeze into
+  the bits.
+*/
+template 
+class eoNDSorting : public eoPerf2WorthCached
+{
+  public :
+
+    using eoPerf2WorthCached::value;
+      eoNDSorting(bool nasty_flag_ = false)
+          : nasty_declone_flag_that_only_is_implemented_for_two_objectives(nasty_flag_)
+        {}
+
+
+    eoNDSorting()
+        : nasty_declone_flag_that_only_is_implemented_for_two_objectives(false)
+        {}
+
+    /** Pure virtual function that calculates the 'distance' for each element in the current front
+        Implement to create your own nondominated sorting algorithm. The size of the returned std::vector
+        should be equal to the size of the current_front.
+    */
+    virtual std::vector niche_penalty(const std::vector& current_front, const eoPop& _pop) = 0;
+
+    void calculate_worths(const eoPop& _pop)
+    {
+	// resize the worths beforehand
+	value().resize(_pop.size());
+
+	typedef typename EOT::Fitness::fitness_traits traits;
+
+	switch (traits::nObjectives())
+	{
+	    case 1:
+		{
+		    one_objective(_pop);
+		    return;
+		}
+	    case 2:
+		{
+		    two_objectives(_pop);
+		    return;
+		}
+	    default :
+		{
+		    m_objectives(_pop);
+		}
+	}
+    }
+
+private :
+
+    /** used in fast nondominated sorting
+	DummyEO is just a storage place for fitnesses and
+	to store the original index
+    */
+    class DummyEO : public EO
+    {
+      public: unsigned index;
+    };
+
+    void one_objective(const eoPop& _pop)
+    {
+	unsigned i;
+	std::vector tmp_pop;
+        tmp_pop.resize(_pop.size());
+
+        // copy pop to dummy population (only need the fitnesses)
+        for (i = 0; i < _pop.size(); ++i)
+        {
+          tmp_pop[i].fitness(_pop[i].fitness());
+          tmp_pop[i].index = i;
+        }
+
+	std::sort(tmp_pop.begin(), tmp_pop.end(), std::greater());
+
+        for (i = 0; i < _pop.size(); ++i)
+        {
+          value()[tmp_pop[i].index] = _pop.size() - i; // set rank
+        }
+
+	// no point in calculcating niche penalty, as every distinct fitness value has a distinct rank
+    }
+
+    /**
+     * Optimization for two objectives. Makes the algorithm run in
+     * complexity O(n log n) where n is the population size
+     *
+     * This is the same complexity as for a single objective
+     * or truncation selection or sorting.
+     *
+     * It will perform a sort on the two objectives seperately,
+     * and from the information on the ranks of the individuals on
+     * these two objectives, the non-dominated sorting rank is determined.
+     * There are then three nlogn operations in place: one sort per objective,
+     * plus a binary search procedure to combine the information about the
+     * ranks.
+     *
+     * After that it is a simple exercise to calculate the distance
+     * penalty
+     */
+
+    void two_objectives(const eoPop& _pop)
+    {
+		unsigned i;
+	typedef typename EOT::Fitness::fitness_traits traits;
+	assert(traits::nObjectives() == 2);
+
+	std::vector sort1(_pop.size()); // index into population sorted on first objective
+
+	for (i = 0; i < _pop.size(); ++i)
+	{
+	    sort1[i] = i;
+	}
+
+	std::sort(sort1.begin(), sort1.end(), Sorter(_pop));
+
+	// Ok, now the meat of the algorithm
+
+	unsigned last_front = 0;
+
+	double max1 = -1e+20;
+	for (i = 0; i < _pop.size(); ++i)
+	{
+	    max1 = std::max(max1, _pop[i].fitness()[1]);
+	}
+
+	max1 = max1 + 1.0; // add a bit to it so that it is a real upperbound
+
+	unsigned prev_front = 0;
+	std::vector d;
+	d.resize(_pop.size(), max1); // initialize with the value max1 everywhere
+
+	std::vector > fronts(_pop.size()); // to store indices into the front
+
+	for (i = 0; i < _pop.size(); ++i)
+	{
+	    unsigned index = sort1[i];
+
+	    // check for clones and delete them
+	    if (0 && i > 0)
+	    {
+		unsigned prev = sort1[i-1];
+		if ( _pop[index].fitness() == _pop[prev].fitness())
+		{ // it's a clone, give it the worst rank!
+
+		    if (nasty_declone_flag_that_only_is_implemented_for_two_objectives)
+			//declone
+			fronts.back().push_back(index);
+		    else // assign it the rank of the previous
+		    	fronts[prev_front].push_back(index);
+		    continue;
+		}
+	    }
+
+	    double value2 = _pop[index].fitness()[1];
+
+	    if (traits::maximizing(1))
+		value2 = max1 - value2;
+
+	    // perform binary search using std::upper_bound, a log n operation for each member
+	    std::vector::iterator it =
+		std::upper_bound(d.begin(), d.begin() + last_front, value2);
+
+	    unsigned front = unsigned(it - d.begin());
+	    if (front == last_front) ++last_front;
+
+	    assert(it != d.end());
+
+	    *it = value2; //update d
+	    fronts[front].push_back(index); // add it to the front
+
+	    prev_front = front;
+	}
+
+	// ok, and finally the niche penalty
+
+	for (i = 0; i < fronts.size(); ++i)
+	{
+	    if (fronts[i].size() == 0) continue;
+
+	    // Now we have the indices to the current front in current_front, do the niching
+	    std::vector niche_count = niche_penalty(fronts[i], _pop);
+
+	    // Check whether the derived class was nice
+	    if (niche_count.size() != fronts[i].size())
+	    {
+	      throw std::logic_error("eoNDSorting: niche and front should have the same size");
+	    }
+
+	    double max_niche = *std::max_element(niche_count.begin(), niche_count.end());
+
+	    for (unsigned j = 0; j < fronts[i].size(); ++j)
+	    {
+	      value()[fronts[i][j]] = i + niche_count[j] / (max_niche + 1.); // divide by max_niche + 1 to ensure that this front does not overlap with the next
+	    }
+
+	}
+
+	// invert ranks to obtain a 'bigger is better' score
+	rank_to_worth();
+    }
+
+    class Sorter
+    {
+	public:
+	    Sorter(const eoPop& _pop) : pop(_pop) {}
+
+	    bool operator()(unsigned i, unsigned j) const
+	    {
+		typedef typename EOT::Fitness::fitness_traits traits;
+
+		double diff = pop[i].fitness()[0] - pop[j].fitness()[0];
+
+		if (fabs(diff) < traits::tol())
+		{
+		    diff = pop[i].fitness()[1] - pop[j].fitness()[1];
+
+		    if (fabs(diff) < traits::tol())
+			return false;
+
+		    if (traits::maximizing(1))
+			return diff > 0.;
+		    return diff < 0.;
+		}
+
+		if (traits::maximizing(0))
+		    return diff > 0.;
+		return diff < 0.;
+	    }
+
+	    const eoPop& pop;
+    };
+
+    void m_objectives(const eoPop& _pop)
+    {
+      unsigned i;
+
+      typedef typename EOT::Fitness::fitness_traits traits;
+
+      std::vector > S(_pop.size()); // which individuals does guy i dominate
+      std::vector n(_pop.size(), 0); // how many individuals dominate guy i
+
+      unsigned j;
+      for (i = 0; i < _pop.size(); ++i)
+      {
+        for (j = 0; j < _pop.size(); ++j)
+        {
+          if (_pop[i].fitness().dominates(_pop[j].fitness()))
+          { // i dominates j
+            S[i].push_back(j); // add j to i's domination std::list
+
+            //n[j]++; // as i dominates j
+          }
+          else if (_pop[j].fitness().dominates(_pop[i].fitness()))
+          { // j dominates i, increment count for i, add i to the domination std::list of j
+            n[i]++;
+
+            //S[j].push_back(i);
+          }
+        }
+      }
+
+      std::vector current_front;
+      current_front.reserve(_pop.size());
+
+      // get the first front out
+      for (i = 0; i < _pop.size(); ++i)
+      {
+        if (n[i] == 0)
+        {
+          current_front.push_back(i);
+        }
+      }
+
+      std::vector next_front;
+      next_front.reserve(_pop.size());
+
+      unsigned front_index = 0; // which front are we processing
+      while (!current_front.empty())
+      {
+        // Now we have the indices to the current front in current_front, do the niching
+        std::vector niche_count = niche_penalty(current_front, _pop);
+
+        // Check whether the derived class was nice
+        if (niche_count.size() != current_front.size())
+        {
+          throw std::logic_error("eoNDSorting: niche and front should have the same size");
+        }
+
+        double max_niche = *std::max_element(niche_count.begin(), niche_count.end());
+
+        for (i = 0; i < current_front.size(); ++i)
+        {
+          value()[current_front[i]] = front_index + niche_count[i] / (max_niche + 1.); // divide by max_niche + 1 to ensure that this front does not overlap with the next
+        }
+
+        // Calculate which individuals are in the next front;
+
+        for (i = 0; i < current_front.size(); ++i)
+        {
+          for (j = 0; j < S[current_front[i]].size(); ++j)
+          {
+            unsigned dominated_individual = S[current_front[i]][j];
+            n[dominated_individual]--; // As we remove individual i -- being part of the current front -- it no longer dominates j
+
+            if (n[dominated_individual] == 0) // it should be in the current front
+            {
+              next_front.push_back(dominated_individual);
+            }
+          }
+        }
+
+        front_index++; // go to the next front
+        swap(current_front, next_front); // make the next front current
+        next_front.clear(); // clear it for the next iteration
+      }
+
+      rank_to_worth();
+    }
+
+    void rank_to_worth()
+    {
+      // now all that's left to do is to transform lower rank into higher worth
+      double max_fitness = *std::max_element(value().begin(), value().end());
+
+      // but make sure it's an integer upper bound, so that all ranks inside the highest integer are the front
+      max_fitness = ceil(max_fitness);
+
+      for (unsigned i = 0; i < value().size(); ++i)
+      {
+        value()[i] = max_fitness - value()[i];
+      }
+
+    }
+    public : bool nasty_declone_flag_that_only_is_implemented_for_two_objectives;
+};
+
+/**
+  The original Non Dominated Sorting algorithm from Srinivas and Deb
+*/
+template 
+class eoNDSorting_I : public eoNDSorting
+{
+public :
+  eoNDSorting_I(double _nicheSize, bool nasty_flag_ = false) : eoNDSorting(nasty_flag_), nicheSize(_nicheSize) {}
+
+  std::vector niche_penalty(const std::vector& current_front, const eoPop& _pop)
+  {
+        std::vector niche_count(current_front.size(), 0.);
+
+        for (unsigned i = 0; i < current_front.size(); ++i)
+        { // calculate whether the other points lie within the nice
+          for (unsigned j = 0; j < current_front.size(); ++j)
+          {
+            if (i == j)
+              continue;
+
+            double dist = 0.0;
+
+            for (unsigned k = 0; k < _pop[current_front[j]].fitness().size(); ++k)
+            {
+              double d = _pop[current_front[i]].fitness()[k] - _pop[current_front[j]].fitness()[k];
+              dist += d*d;
+            }
+
+            if (dist < nicheSize)
+            {
+              niche_count[i] += 1.0 - pow(dist / nicheSize,2.);
+            }
+          }
+        }
+
+        return niche_count;
+  }
+
+  private :
+
+  double nicheSize;
+};
+
+/** @brief Fast Elitist Non-Dominant Sorting Genetic Algorithm
+
+  Adapted from Deb, Agrawal, Pratab and Meyarivan: A Fast Elitist
+  Non-Dominant Sorting Genetic Algorithm for MultiObjective
+  Optimization: NSGA-II KanGAL Report No. 200001
+
+  Note that this class does not do the sorting per se, but the sorting
+  of it worth_std::vector will give the right order
+
+  The crowding distance is calculated as the sum of the distances to
+  the nearest neighbours. As we need to return the penalty value, we
+  have to invert that and invert it again in the base class, but such
+  is life, sigh
+*/
+template 
+class eoNDSorting_II : public eoNDSorting
+{
+  public:
+
+    eoNDSorting_II(bool nasty_flag_ = false) : eoNDSorting(nasty_flag_) {}
+
+  typedef std::pair double_index_pair;
+
+  class compare_nodes
+  {
+  public :
+    bool operator()(const double_index_pair& a, const double_index_pair& b) const
+    {
+      return a.first < b.first;
+    }
+  };
+
+  /// _cf points into the elements that consist of the current front
+  std::vector niche_penalty(const std::vector& _cf, const eoPop& _pop)
+  {
+    typedef typename EOT::Fitness::fitness_traits traits;
+    unsigned i;
+    std::vector niche_count(_cf.size(), 0.);
+
+
+    unsigned nObjectives = traits::nObjectives(); //_pop[_cf[0]].fitness().size();
+
+    for (unsigned o = 0; o < nObjectives; ++o)
+    {
+
+      std::vector > performance(_cf.size());
+      for (i =0; i < _cf.size(); ++i)
+      {
+        performance[i].first = _pop[_cf[i]].fitness()[o];
+        performance[i].second = i;
+      }
+
+      std::sort(performance.begin(), performance.end(), compare_nodes()); // a lambda operator would've been nice here
+
+      std::vector nc(niche_count.size(), 0.0);
+
+      for (i = 1; i < _cf.size()-1; ++i)
+      { // and yet another level of indirection
+        nc[performance[i].second] = performance[i+1].first - performance[i-1].first;
+      }
+
+      double max_dist = *std::max_element(nc.begin(), nc.end());
+
+      // set boundary at max_dist + 1 (so it will get chosen over all the others
+      nc[performance[0].second] = max_dist + 1;
+      nc[performance.back().second] = max_dist + 1;
+
+      for (i = 0; i < nc.size(); ++i)
+      {
+        niche_count[i] = (max_dist + 1 - nc[i]);
+      }
+    }
+
+    return niche_count;
+  }
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoObject.h b/trunk/paradiseo-eo/src/eoObject.h
new file mode 100644
index 000000000..7f6039053
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoObject.h
@@ -0,0 +1,75 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoObject.h
+// (c) GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef EOOBJECT_H
+#define EOOBJECT_H
+
+//-----------------------------------------------------------------------------
+
+#include 	// For limits definition
+#include 		// std::istream, std::ostream
+#include 		// std::string
+
+#include 
+
+//-----------------------------------------------------------------------------
+// eoObject
+//-----------------------------------------------------------------------------
+/**
+eoObject used to be the base class for the whole hierarchy, but this has 
+changed. eoObject is used to define a name (#className#) 
+that is used when loading or saving the state. 
+
+Previously, this object also defined a print and read
+interface, but it´s been moved to eoPrintable and eoPersistent.
+
+It is recommended that you only derive from eoObject in concrete classes.
+Some parts of EO do not implement this yet, but that will change in the future.
+eoObject, together with eoPersistent and eoPrintable provide a simple persistence
+framework that is only needed when the classes have state that changes at runtime.
+
+  @see eoPersistent eoPrintable, eoState
+
+ */
+class eoObject
+{
+ public:
+  /// Virtual dtor. They are needed in virtual class hierarchies.
+  virtual ~eoObject() {}
+  
+  /** Return the class id. This should be redefined in each class. 
+  Only "leaf" classes can be non-virtual.
+
+  Maarten: removed the default implementation as this proved to 
+  be too error-prone: I found several classes that had a typo in 
+  className (like classname), which would print eoObject instead of
+  their own. Having it pure will force the implementor to provide a 
+  name.
+  */
+  virtual std::string className() const = 0; 
+
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/eoOneToOneBreeder.h b/trunk/paradiseo-eo/src/eoOneToOneBreeder.h
new file mode 100644
index 000000000..cd18edd19
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoOneToOneBreeder.h
@@ -0,0 +1,123 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoOneToOneBreeder.h 
+// (c) Maarten Keijzer and Marc Schoenauer, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: mkeijzer@dhi.dk
+             Marc.Schoenauer@polytechnique.fr
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoOneToOneBreeder_h
+#define eoOneToOneBreeder_h
+
+//-----------------------------------------------------------------------------
+
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+
+/*****************************************************************************
+ * eoOneToOneBreeder: transforms a population using 
+ *   - an operator that MODIFIES only one parent from the populator
+ *     (though it can use any number aside) and thus generates ONE offspring)
+ *   - a local replacement between the parent and its offspring
+ *
+ * Typically, Differential Evolution (Storn and Price 94) and Deb et al's 
+ *   G3 can be built on this
+ ****************************************************************************
+ */
+template
+class eoOneToOneBreeder: public eoBreed
+{
+ public:
+  /** Ctor:
+   * @param _op       a general operator (must MODIFY only ONE parent)
+   * @param _eval     an eoEvalFunc to evaluate the offspring 
+   * @param _select   a selectoOne, to be used for all selections [sequential]
+   * @param _pReplace probability that the best of parent/offspring wins [1]
+   * @param _howMany  eoHowMany offpsring to generate [100%]
+   */
+  eoOneToOneBreeder(
+          eoGenOp& _op,
+	  eoEvalFunc & _eval, 
+	  double _pReplace = 1.0,
+	  eoHowMany _howMany = eoHowMany(1.0) ) :
+      op(_op), eval(_eval), select( false ), 
+      pReplace(_pReplace), howMany(_howMany) {}
+
+
+  /** The breeder: iteratively calls the genOp ONCE on a selective populator
+   *   after having recorded the parent
+   *   Then does the replacement
+   *
+   * @param _parents the initial population
+   * @param _offspring the resulting population (content -if any- is lost)
+   */
+  void operator()(const eoPop& _parents, eoPop& _offspring)
+    {
+      unsigned target = howMany(_parents.size());
+      
+      _offspring.clear();
+      eoSelectivePopulator popit(_parents, _offspring, select);
+      
+      for (unsigned iParent=0; iParent leOffspring) // old parent better than offspring
+	    if (rng.uniform() < pReplace) // if probability
+	      leOffspring = theParent; // replace
+	  // finally, go to next guy to handle
+	  ++popit;
+	}
+    }
+
+  /// The class name.
+  virtual std::string className() const { return "eoOneToOneBreeder"; }
+
+ private:
+  eoGenOp& op;
+  eoEvalFunc & eval;
+  eoSequentialSelect select;
+  double pReplace;
+  eoHowMany howMany;
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/eoOp.h b/trunk/paradiseo-eo/src/eoOp.h
new file mode 100644
index 000000000..279d0fa58
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoOp.h
@@ -0,0 +1,170 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+//-----------------------------------------------------------------------------
+// eoOp.h
+// (c) GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+    CVS Info: $Date: 2004/08/10 17:19:46 $ $Header: /cvsroot/eodev/eo/src/eoOp.h,v 1.29 2004/08/10 17:19:46 jmerelo Exp $ $Author: jmerelo $ 
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoOp_H
+#define _eoOp_H
+
+#include 
+#include 
+#include 
+#include 
+/**
+\defgroup Operators
+Genetic Operators are used for various purposes
+*/
+
+/** @name Genetic operators
+
+What is a genetic algorithm without genetic operators?
+There is a genetic operator hierarchy, with eoOp as father and
+eoMonOp (monary or unary operator), eoBinOp and eoQuadOp (binary operators)
+and eoGenOp (any number of inputs and outputs, see eoGenOp.h)
+as subclasses.
+Nobody should subclass eoOp, you should subclass eoGenOp, eoBinOp, eoQuadOp
+or eoMonOp, those are the ones actually used here.
+
+#eoOp#s are only printable objects, so if you want to build them
+from a file, it has to be done in another class, namely factories.
+Each hierarchy of #eoOp#s should have its own factory, which know
+how to build them from a description in a file.
+
+@author GeNeura Team, Marten Keijzer and Marc Schoenauer
+@version 0.9
+@see eoGenOp.h eoOpFactory
+*/
+
+//@{
+
+/** Abstract data types for EO operators.
+  Genetic operators act on chromosomes, changing them.
+  The type to use them on is problem specific. If your genotype
+  is a std::vector, there are operators that work specifically
+  on std::vector, but you might also find that generic operators
+  working on std::vector are what you need.
+
+*/
+template
+class eoOp
+{
+public:
+  //@{
+  enum OpType { unary = 0, binary = 1, quadratic = 2, general = 3};
+  ///
+
+  /// Ctor
+  eoOp(OpType _type)
+    :opType( _type ) {};
+
+  /// Copy Ctor
+  eoOp( const eoOp& _eop )
+    :opType( _eop.opType ) {};
+
+  /// Needed virtual destructor
+  virtual ~eoOp(){};
+
+  /// getType: number of operands it takes and individuals it produces
+  OpType getType() const {return opType;};
+
+private:
+
+  /// OpType is the type of the operator: how many operands it takes and how many it produces
+  OpType opType;
+};
+
+/**
+eoMonOp is the monary operator: genetic operator that takes only one EO.
+When defining your own, make sure that you return a boolean value
+indicating that you have changed the content.
+*/
+template 
+class eoMonOp: public eoOp, public eoUF
+{
+public:
+  /// Ctor
+  eoMonOp()
+    : eoOp( eoOp::unary ) {};
+  virtual std::string className() const {return "eoMonOp";};
+};
+
+
+/** Binary genetic operator: subclasses eoOp, and defines basically the
+ *  operator() with two operands, only the first one can be modified
+When defining your own, make sure that you return a boolean value
+indicating that you have changed the content.
+ */
+template
+class eoBinOp: public eoOp, public eoBF
+{
+public:
+  /// Ctor
+  eoBinOp()
+      :eoOp( eoOp::binary ) {};
+  virtual std::string className() const {return "eoBinOp";};
+};
+
+/** Quad genetic operator: subclasses eoOp, and defines basically the
+    operator() with two operands, both can be modified.
+When defining your own, make sure that you return a boolean value
+indicating that you have changed the content.
+*/
+template
+class eoQuadOp: public eoOp, public eoBF {
+public:
+  /// Ctor
+  eoQuadOp()
+    :eoOp( eoOp::quadratic ) {};
+  virtual std::string className() const {return "eoQuadOp";};
+};
+
+/** Turning an eoQuadOp into an eoBinOp: simply don't touch the second arg!
+ */
+template 
+class eoQuad2BinOp: public eoBinOp
+{
+public:
+  /** Ctor
+   * @param _quadOp the eoQuadOp to be transformed
+   */
+  eoQuad2BinOp(eoQuadOp & _quadOp) : quadOp(_quadOp) {}
+
+  /** Operator() simply calls embedded quadOp operator() with dummy second arg
+   */
+  bool operator()(EOT & _eo1, const EOT & _eo2)
+  {
+    EOT eoTmp = _eo2;		   // a copy that can be modified
+    // if the embedded eoQuadOp is not symmetrical,
+    // the result might be biased - hence the flip ...
+    if (eo::rng.flip(0.5))
+      return quadOp(_eo1, eoTmp);	   // both are modified - that's all
+    else
+      return quadOp(eoTmp, _eo1);	   // both are modified - that's all
+  }
+
+private:
+  eoQuadOp & quadOp;
+};
+
+#endif
+
+//@}
diff --git a/trunk/paradiseo-eo/src/eoOpContainer.h b/trunk/paradiseo-eo/src/eoOpContainer.h
new file mode 100644
index 000000000..6a31ced9e
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoOpContainer.h
@@ -0,0 +1,159 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoOpContainer.h
+// (c) Maarten Keijzer and Marc Schoenauer, 2001
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: mkeijzer@dhi.dk
+             Marc.Schoenauer@polytechnique.fr
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoOpContainer_H
+#define _eoOpContainer_H
+
+#include 
+
+/** eoOpContainer is a base class for the sequential and proportional selectors
+ *  It takes care of wrapping the other operators,
+ *  and deleting stuff that it has allocated
+ *
+ * Warning: all operators are added together with a rate (double)
+ *          However, the meaning of this rate will be different in
+ *          the differnet instances of eoOpContainer:
+ *          an ***absolute*** probability in the sequential version, and
+ *          a ***relative*** weight in the proportional version
+ */
+template 
+class eoOpContainer : public eoGenOp
+{
+  public :
+  /** Ctor: nothing much to do */
+  eoOpContainer() : max_to_produce(0) {}
+
+  /** Dtor: delete all the GenOps created when wrapping simple ops
+   */
+  virtual ~eoOpContainer(void) {}
+
+  /** for memory management (doesn't have to be very precise */
+  virtual unsigned max_production(void)
+  {
+    return max_to_produce;
+  }
+
+  /**
+  Add an operator to the container, also give it a rate
+
+  (sidenote, it's much less hairy since I added the wrap_op is used)
+  */
+  void add(eoOp& _op, double _rate)
+  {
+    ops.push_back(&wrap_op(_op, store));
+    rates.push_back(_rate);
+    max_to_produce = std::max(max_to_produce,ops.back()->max_production());
+  }
+
+  virtual std::string className() const = 0;
+
+  protected :
+
+  std::vector rates;
+  std::vector*> ops;
+
+  private :
+  eoFunctorStore store;
+  unsigned max_to_produce;
+};
+
+/** Sequential selection:
+ *  note the mark, rewind, unmark cycle
+ *  here operators are repeatedly applied on the same individual(s)
+ *  not all too elegant, but it sort of works...
+ */
+template 
+class eoSequentialOp : public eoOpContainer
+{
+public:
+
+    using eoOpContainer::ops;
+    using eoOpContainer::rates;
+
+    typedef unsigned position_type;
+
+
+    void apply(eoPopulator& _pop) {
+        position_type pos = _pop.tellp();
+        for (size_t i = 0; i < rates.size(); ++i) {
+            _pop.seekp(pos);
+            do {
+                if (eo::rng.flip(rates[i])) {
+                    //            try
+                    //            {
+                    // apply it to all the guys in the todo std::list
+                    (*ops[i])(_pop);
+                    //            }
+                    // check for out of individuals and do nothing with that...
+                    //            catch(eoPopulator::OutOfIndividuals&)
+                    //	      {
+                    //		std::cout << "Warning: not enough individuals to handle\n";
+                    //		return ;
+                    //	      }
+                }
+
+                if (!_pop.exhausted())
+                    ++_pop;
+            }
+            while (!_pop.exhausted());
+        }
+    }
+    virtual std::string className() const {return "SequentialOp";}
+
+private:
+
+    std::vector to_apply;
+    std::vector production;
+};
+
+
+
+/** The proportional versions: easy! */
+template 
+class eoProportionalOp : public eoOpContainer
+{
+public:
+
+    using eoOpContainer< EOT >::ops;
+    using eoOpContainer< EOT >::rates;
+
+    void apply(eoPopulator& _pop)
+    {
+      unsigned i = eo::rng.roulette_wheel(rates);
+
+      try
+      {
+        (*ops[i])(_pop);
+	++_pop;
+      }
+      catch( typename eoPopulator::OutOfIndividuals&)
+      {}
+    }
+  virtual std::string className() const {return "ProportionalOp";}
+};
+
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/eoOpSelMason.h b/trunk/paradiseo-eo/src/eoOpSelMason.h
new file mode 100644
index 000000000..6c1d80924
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoOpSelMason.h
@@ -0,0 +1,109 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoOpSelMason.h
+// (c) GeNeura Team, 1999
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _EOOPSELMASON_H
+#define _EOOPSELMASON_H
+
+//-----------------------------------------------------------------------------
+#include 
+#include 	// for eoFactory and eoOpFactory
+
+#include 
+
+//-----------------------------------------------------------------------------
+
+/** EO Mason, or builder, for operator selectors. A builder must allocate memory
+to the objects it builds, and then deallocate it when it gets out of scope*/
+template
+class eoOpSelMason: public eoFactory > {
+	
+public:
+	typedef std::vector* > vOpP;
+	typedef map*, vOpP > MEV;
+
+	/// @name ctors and dtors
+	//{@
+	/// constructor
+	eoOpSelMason( eoOpFactory& _opFact): operatorFactory( _opFact ) {};
+	
+	/// destructor
+	virtual ~eoOpSelMason() {};
+	//@}
+
+	/** Factory methods: creates an object from an std::istream, reading from
+	it whatever is needed to create the object. The format is
+	opSelClassName\\
+	rate 1 operator1\\
+	rate 2 operator2\\
+	...\\
+	Stores all operators built in a database (#allocMap#), so that somebody 
+	can destroy them later. The Mason is in charge or destroying the operators,
+	since the built object can´t do it itself. The objects built must be destroyed
+	from outside, using the #destroy# method
+	*/
+	virtual eoOpSelector* make(std::istream& _is) {
+
+		std::string opSelName;
+		_is >> opSelName;
+		eoOpSelector* opSelectorP;
+		// Build the operator selector
+		if ( opSelName == "eoProportionalOpSel" ) {
+			opSelectorP = new eoProportionalOpSel();
+		}
+
+		// Temp std::vector for storing pointers
+		vOpP tmpPVec;
+		// read operator rate and name
+		while ( _is ) {
+			float rate;
+			_is >> rate;
+			if ( _is ) {
+				eoOp* op = operatorFactory.make( _is );	// This reads the rest of the line
+				// Add the operators to the selector, don´t pay attention to the IDs
+				opSelectorP->addOp( *op, rate );
+				// Keep it in the store, to destroy later
+				tmpPVec.push_back( op );
+			} // if
+		} // while
+
+		// Put it in the map
+		allocMap.insert( MEV::value_type( opSelectorP, tmpPVec ) );
+		
+		return opSelectorP;
+	};
+
+	///@name eoObject methods
+	//@{
+	/** Return the class id */
+	virtual std::string className() const { return "eoOpSelMason"; }
+
+	//@}
+	
+private:
+	map*,std::vector* > > allocMap;
+	eoOpFactory& operatorFactory;
+};
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoParetoConstraintFitness.h b/trunk/paradiseo-eo/src/eoParetoConstraintFitness.h
new file mode 100644
index 000000000..c33417ad4
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoParetoConstraintFitness.h
@@ -0,0 +1,229 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoParetoConstraintFitness.h
+// (c) Maarten Keijzer and Marc Schoenauer, 2001
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: mkeijzer@cs.vu.nl
+             Marc.Schoenauer@inria.fr
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoParetoConstraintFitness_h
+#define _eoParetoConstraintFitness_h
+
+#include 
+#include 
+#include 
+#include 
+
+#include 
+
+/**
+  eoParetoOneConstraintFitness class: 
+            std::vector of doubles + constraint value
+
+  Comparison (dominance) is done 
+          on pareto dominance for 2 feasible individuals, 
+	  one feasible individual always wins over an infeasible
+	  on constraint violations for  2 infeasible individuals
+
+  The template argument FitnessTraits defaults to
+  eoParetoFitnessTraits, which can be replaces at will by any other
+  class that implements the static functions defined therein. 
+
+  Note that the domninance defines a partial order, so that
+    !dominates(a,b) && !domaintes(b,a) does not neccessarily imply that (a==b)
+  The other way around does hold.
+
+  However, be careful that the comparison operators do define a total order
+  based on considering first objective, then in case of tie, second objective, etc
+
+  NOTE: in a hurry, I did not want to make it derive from eoParetoFitness  
+  (used cut-and-paste instead!) : I know it might be a good idea, but I'm 
+  not sure I see why at the moment (any hint someone?) 
+*/
+template 
+class eoParetoOneConstraintFitness : public std::vector
+{
+private: 
+  // this class implements only 1 inequality constraint 
+  //               (must ponder a bit for generality without huge overload)
+  double constraintValue;	   // inequality cstr - must be negative
+
+public :
+  typedef FitnessTraits fitness_traits;
+
+  eoParetoOneConstraintFitness(void) : std::vector(FitnessTraits::nObjectives(),0.0)  {}
+
+  // Ctr from a std::vector (size nObjectives+1)
+  eoParetoOneConstraintFitness(std::vector & _v) : 
+    std::vector(_v) 
+  {
+#ifndef NDEBUG
+    if (_v.size() != fitness_traits::nObjectives()+1)
+      throw std::runtime_error("Size error in Ctor of eoParetoOneConstraintFitness from std::vector");
+#endif
+    constraintValue = _v[fitness_traits::nObjectives()];
+    resize(fitness_traits::nObjectives());
+  }
+  
+  // Ctr from a std::vector and a value
+  eoParetoOneConstraintFitness(std::vector & _v, double _c) : 
+    std::vector(_v), constraintValue(_c) 
+  {
+#ifndef NDEBUG
+    if (_v.size() != fitness_traits::nObjectives())
+      throw std::runtime_error("Size error in Ctor of eoParetoOneConstraintFitness from std::vector and value");
+#endif
+  }
+  
+
+  /** access to the traits characteristics (so you don't have to write 
+   * a lot of typedef's around
+   */
+  static void setUp(unsigned _n, std::vector & _b) {FitnessTraits::setUp(_n, _b);}
+  static bool maximizing(unsigned _i) { return FitnessTraits::maximizing(_i);}
+
+  bool feasible() const { return constraintValue<=0;} 
+  double violation() const { return (feasible()?0.0:constraintValue);}
+  double ConstraintValue() const {return constraintValue;}
+  void ConstraintValue(double _c) {constraintValue=_c;}
+
+  /// Partial order based on Pareto-dominance
+  //bool operator<(const eoParetoFitness& _other) const
+  bool dominates(const eoParetoOneConstraintFitness& _other) const
+  {
+    bool dom = false;
+
+    double tol = FitnessTraits::tol();
+    const std::vector& performance = *this;
+    const std::vector& otherperformance = _other;
+
+    if (feasible() && _other.feasible())
+    // here both are feasible: do the "standard" domination
+      for (unsigned i = 0; i < FitnessTraits::nObjectives(); ++i)
+	{
+	  bool maxim = FitnessTraits::maximizing(i);
+	  double aval = maxim? performance[i] : -performance[i];
+	  double bval = maxim? otherperformance[i] : -otherperformance[i];
+	  
+	  if (fabs(aval - bval) > tol)
+	    {
+	      if (aval < bval)
+		{
+		  return false; // cannot dominate
+		}
+	      // else aval < bval
+	      dom = true; // for the moment: goto next objective
+	    }
+	  //else they're equal in this objective, goto next
+	}
+    else
+      {			   // one at least is not feasible
+	if (feasible())
+	  return true;		   // feasible wins
+	else if (_other.feasible())
+	  return false;		   // feasible wins
+	return (violation()<_other.violation()); // smallest violation wins
+      }
+
+    return dom;
+  }
+
+  /// compare *not* on dominance, but on the first, then the second, etc
+  bool operator<(const eoParetoOneConstraintFitness& _other) const
+  {
+    double tol = FitnessTraits::tol();
+    const std::vector& performance = *this;
+    const std::vector& otherperformance = _other;
+    for (unsigned i = 0; i < FitnessTraits::nObjectives(); ++i)
+    {
+      bool maxim = FitnessTraits::maximizing(i);
+      double aval = maxim? performance[i] : -performance[i];
+      double bval = maxim? otherperformance[i] : -otherperformance[i];
+
+      if (fabs(aval-bval) > tol)
+      {
+        if (aval < bval)
+          return true;
+
+        return false;
+      }
+    }
+
+    return false;
+  }
+
+  bool operator>(const eoParetoOneConstraintFitness& _other) const
+  {
+    return _other < *this;
+  }
+
+  bool operator<=(const eoParetoOneConstraintFitness& _other) const
+  {
+    return operator==(_other) || operator<(_other);
+  }
+
+  bool operator>=(const eoParetoOneConstraintFitness& _other) const
+  {
+    return _other <= *this;
+  }
+
+  bool operator==(const eoParetoOneConstraintFitness& _other) const
+  { // check if they're all within tolerance
+    for (unsigned i = 0; i < size(); ++i)
+    {
+      if (fabs(operator[](i) - _other[i]) > FitnessTraits::tol())
+      {
+        return false;
+      }
+    }
+    return true;
+  }
+
+  bool operator!=(const eoParetoOneConstraintFitness& _other) const
+  { return ! operator==(_other); }
+
+};
+
+template 
+std::ostream& operator<<(std::ostream& os, const eoParetoOneConstraintFitness& fitness)
+{
+  for (unsigned i = 0; i < fitness.size(); ++i)
+  {
+    os << fitness[i] << ' ';
+  }
+  os << fitness.ConstraintValue() << " " ;
+  return os;
+}
+
+template 
+std::istream& operator>>(std::istream& is, eoParetoOneConstraintFitness& fitness)
+{
+  fitness = eoParetoOneConstraintFitness();
+  for (unsigned i = 0; i < fitness.size(); ++i)
+  {
+    is >> fitness[i];
+  }
+  double r;
+  is >> r;
+  fitness.ConstraintValue(r);
+  return is;
+}
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoParetoFitness.cpp b/trunk/paradiseo-eo/src/eoParetoFitness.cpp
new file mode 100644
index 000000000..6de72db7c
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoParetoFitness.cpp
@@ -0,0 +1,38 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+ 
+//-----------------------------------------------------------------------------
+// eoPareto.cpp
+// (c) EEAAX,1996-GeNeura Team,1998-Maarten Keijzer,2000-Marc Schoenauer 2002
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+ 
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+ 
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ 
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@inria.fr
+             mak@dhi.dk
+*/
+//-----------------------------------------------------------------------------
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+#include "eoParetoFitness.h"
+
+
+// need to allocate the static variables of class eoVariableParetoTraits
+unsigned eoVariableParetoTraits::nObj;
+std::vector eoVariableParetoTraits::bObj;
+
+
diff --git a/trunk/paradiseo-eo/src/eoParetoFitness.h b/trunk/paradiseo-eo/src/eoParetoFitness.h
new file mode 100644
index 000000000..4634c9f4a
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoParetoFitness.h
@@ -0,0 +1,234 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoParetoFitness.h
+// (c) Maarten Keijzer and Marc Schoenauer, 2001
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: mak@dhi.dk
+             Marc.Schoenauer@inria.fr
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoParetoFitness_h
+#define _eoParetoFitness_h
+
+#include 
+#include 
+#include 
+#include 
+
+
+/**
+ * eoFitnessTraits: a traits class to specify 
+ *           the number of objectives and which one are maximizing or not
+ * See test/t-eoParetoFitness for its use. 
+ *
+ * If you define your own, make sure you make the functions static!
+*/
+class eoParetoFitnessTraits
+{
+  public :
+
+  static unsigned nObjectives()          { return 2; }
+  static double tol()               { return 1e-6; }
+  static bool maximizing(int which) { return true; } // by default: all are maximizing
+};
+
+/** 
+ * eoVariableParetoTraits : an eoParetoFitnessTraits whose characteristics 
+ *     can be set at run-time (nb objectives and min/max's)
+ * Why bother? For didactical purposes (and EASEA implementation :-)
+ */
+class eoVariableParetoTraits : public eoParetoFitnessTraits
+{
+public :
+  /** setting the static stuff */
+  static void setUp(unsigned _n, std::vector & _b)
+  {
+    // possible problems
+    if ( nObj && (nObj != _n) )	   // was already set to a different value
+      {
+	std::cout << "WARNING\n";
+	std::cout << "WARNING : you are changing the number of objectives\n";
+	std::cout << "WARNING : Make sure all existing objects are destroyed\n";
+	std::cout << "WARNING\n";
+      }
+    nObj=_n; 
+    bObj=_b;
+    if (nObj != bObj.size())
+      throw std::runtime_error("Number of objectives and min/max size don't match in VariableParetoTraits::setup");
+  }
+
+  /** the accessors */
+  static unsigned nObjectives()
+  { 
+#ifndef NDEBUG
+    if (!nObj)
+      throw std::runtime_error("Number of objectives not assigned in VariableParetoTraits");
+#endif
+    return nObj; 
+  }
+  static bool maximizing(unsigned _i) 
+  {
+#ifndef NDEBUG
+    if (_i >= bObj.size())
+      throw std::runtime_error("Wrong index in VariableParetoTraits");
+#endif
+    return bObj[_i]; 
+  }
+private:
+  static unsigned nObj;
+  static std::vector bObj;
+};
+
+/**
+  eoParetoFitness class: std::vector of doubles with overloaded comparison operators. Comparison is done
+  on pareto dominance. The template argument FitnessTraits defaults to eoParetoFitnessTraits, which
+  can be replaces at will by any other class that implements the static functions defined therein.
+
+  Note that the comparison defines a partial order, so that
+    !(a < b) && !(b 
+class eoParetoFitness : public std::vector
+{
+public :
+
+  typedef FitnessTraits fitness_traits;
+
+  eoParetoFitness(void) : std::vector(FitnessTraits::nObjectives(),0.0) {}
+
+  // Ctr from a std::vector
+  eoParetoFitness(std::vector & _v) : std::vector(_v) {}
+  
+
+  /** access to the traits characteristics (so you don't have to write 
+   * a lot of typedef's around
+   */
+  static void setUp(unsigned _n, std::vector & _b) {FitnessTraits::setUp(_n, _b);}
+  static bool maximizing(unsigned _i) { return FitnessTraits::maximizing(_i);}
+
+  /// Partial order based on Pareto-dominance
+  //bool operator<(const eoParetoFitness& _other) const
+  bool dominates(const eoParetoFitness& _other) const
+  {
+    bool dom = false;
+
+    double tol = FitnessTraits::tol();
+    const std::vector& performance = *this;
+    const std::vector& otherperformance = _other;
+
+    for (unsigned i = 0; i < FitnessTraits::nObjectives(); ++i)
+    {
+      bool maxim = FitnessTraits::maximizing(i);
+      double aval = maxim? performance[i] : -performance[i];
+      double bval = maxim? otherperformance[i] : -otherperformance[i];
+
+      if (fabs(aval - bval) > tol)
+      {
+        if (aval < bval)
+        {
+          return false; // cannot dominate
+        }
+        // else aval < bval
+        dom = true; // for the moment: goto next objective
+      }
+      //else they're equal in this objective, goto next
+    }
+
+    return dom;
+  }
+
+  /// compare *not* on dominance, but on the first, then the second, etc
+  bool operator<(const eoParetoFitness& _other) const
+  {
+    double tol = FitnessTraits::tol();
+    const std::vector& performance = *this;
+    const std::vector& otherperformance = _other;
+    for (unsigned i = 0; i < FitnessTraits::nObjectives(); ++i)
+    {
+      bool maxim = FitnessTraits::maximizing(i);
+      double aval = maxim? performance[i] : -performance[i];
+      double bval = maxim? otherperformance[i] : -otherperformance[i];
+
+      if (fabs(aval-bval) > tol)
+      {
+        if (aval < bval)
+          return true;
+
+        return false;
+      }
+    }
+
+    return false;
+  }
+
+  bool operator>(const eoParetoFitness& _other) const
+  {
+    return _other < *this;
+  }
+
+  bool operator<=(const eoParetoFitness& _other) const
+  {
+    return operator==(_other) || operator<(_other);
+  }
+
+  bool operator>=(const eoParetoFitness& _other) const
+  {
+    return _other <= *this;
+  }
+
+  bool operator==(const eoParetoFitness& _other) const
+  { // check if they're all within tolerance
+    for (unsigned i = 0; i < size(); ++i)
+    {
+      if (fabs(operator[](i) - _other[i]) > FitnessTraits::tol())
+      {
+        return false;
+      }
+    }
+    return true;
+  }
+
+  bool operator!=(const eoParetoFitness& _other) const
+  { return ! operator==(_other); }
+
+};
+
+template 
+std::ostream& operator<<(std::ostream& os, const eoParetoFitness& fitness)
+{
+  for (unsigned i = 0; i < fitness.size(); ++i)
+  {
+    os << fitness[i] << ' ';
+  }
+  return os;
+}
+
+template 
+std::istream& operator>>(std::istream& is, eoParetoFitness& fitness)
+{
+  fitness = eoParetoFitness();
+  for (unsigned i = 0; i < fitness.size(); ++i)
+  {
+    is >> fitness[i];
+  }
+  return is;
+}
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoParetoRanking.h b/trunk/paradiseo-eo/src/eoParetoRanking.h
new file mode 100644
index 000000000..cd54ff002
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoParetoRanking.h
@@ -0,0 +1,71 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eoParetoRanking.h
+   (c) Maarten Keijzer, Marc Schoenauer, 2001
+
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoParetoRanking_h
+#define eoParetoRanking_h
+
+#include 
+#include 
+
+/**
+  Straightforward pareto ranking. Every individual gets a rank according to the number
+  of elements it dominates. Note that without niching, this technique will usually not
+  find the whole front of non-dominated solutions, but will quite likely converge
+  on a single spot on the front.
+*/
+template 
+class eoParetoRanking : public eoPerf2WorthCached
+{
+public:
+
+    using eoPerf2WorthCached::value;
+
+    eoParetoRanking(eoDominanceMap& _dominanceMap)
+        : eoPerf2WorthCached(), dominanceMap(_dominanceMap)
+        {}
+
+    void calculate_worths(const eoPop& _pop)
+    {
+      dominanceMap(_pop);
+      value() = dominanceMap.sum_dominators(); // get rank: 0 means part of current front
+
+      // calculate maximum
+      double maxim = *std::max_element(value().begin(), value().end());
+
+      // higher is better, so invert the value
+      for (unsigned i = 0; i < value().size(); ++i)
+      {
+        value()[i] = maxim - value()[i];
+      }
+
+    }
+
+  private :
+
+  eoDominanceMap& dominanceMap;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoPerf2Worth.h b/trunk/paradiseo-eo/src/eoPerf2Worth.h
new file mode 100644
index 000000000..35d2f28e3
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoPerf2Worth.h
@@ -0,0 +1,247 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eoPerf2Worth.h
+   (c) Maarten Keijzer, Marc Schoenauer, 2001
+
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoPerf2Worth_h
+#define eoPerf2Worth_h
+
+#include 
+#include 
+#include 
+
+#include 
+#include 
+#include 
+
+/** @brief Base class to transform raw fitnesses into fitness for selection
+
+@see eoSelectFromWorth
+*/
+template 
+class eoPerf2Worth : public eoUF&, void>, public eoValueParam >
+{
+public:
+
+    using eoValueParam >::value;
+
+    /** @brief default constructor */
+    eoPerf2Worth(std::string _description = "Worths")
+        : eoValueParam >(std::vector(0), _description)
+        {}
+
+    /** Sort population according to worth, will keep the worths and
+        fitness_cache in sync with the population. */
+  virtual void sort_pop(eoPop& _pop)
+  { // start with a std::vector of indices
+      std::vector indices(_pop.size());
+
+    unsigned i;
+    for (i = 0; i < _pop.size();++i)
+    { // could use generate, but who cares
+      indices[i] = i;
+    }
+
+    std::sort(indices.begin(), indices.end(), compare_worth(value()));
+
+    eoPop      tmp_pop;
+    tmp_pop.resize(_pop.size());
+    std::vector  tmp_worths(value().size());
+
+    for (i = 0; i < _pop.size(); ++i)
+    {
+      tmp_pop[i] = _pop[indices[i]];
+      tmp_worths[i] = value()[indices[i]];
+    }
+
+    std::swap(_pop, tmp_pop);
+    std::swap(value(), tmp_worths);
+  }
+
+    /** helper class used to sort indices into populations/worths */
+    class compare_worth
+    {
+    public:
+
+        compare_worth(const std::vector& _worths) : worths(_worths) {}
+
+        bool operator()(unsigned a, unsigned b) const {
+            return worths[b] < worths[a]; // sort in descending (!) order
+        }
+
+    private:
+
+        const std::vector& worths;
+    };
+
+
+
+    virtual void resize(eoPop& _pop, unsigned sz) {
+        _pop.resize(sz);
+        value().resize(sz);
+    };
+
+};
+
+/**
+Perf2Worth with fitness cache
+*/
+template 
+class eoPerf2WorthCached : public eoPerf2Worth
+{
+public:
+
+    using eoPerf2Worth::value;
+
+    eoPerf2WorthCached(std::string _description = "Worths") : eoPerf2Worth(_description) {}
+
+
+  /**
+    Implementation of the operator(), updating a cache of fitnesses. Calls the virtual function
+    calculate_worths when one of the fitnesses has changed. It is not virtual, but derived classes
+    can remove the fitness caching trough the third template element
+  */
+  void operator()(const eoPop& _pop)
+  {
+    unsigned i;
+      if (fitness_cache.size() == _pop.size())
+      {
+        bool in_sync = true;
+        for (i = 0; i < _pop.size(); ++i)
+        {
+          if (fitness_cache[i] != _pop[i].fitness())
+          {
+            in_sync = false;
+            fitness_cache[i] = _pop[i].fitness();
+          }
+        }
+
+        if (in_sync)
+        { // worths are up to date
+          return;
+        }
+      }
+      else // just cache the fitness
+      {
+        fitness_cache.resize(_pop.size());
+        for (i = 0; i < _pop.size(); ++i)
+        {
+          fitness_cache[i] = _pop[i].fitness();
+        }
+      }
+
+    // call derived implementation of perf2worth mapping
+    calculate_worths(_pop);
+  }
+
+  /** The actual virtual function the derived classes should implement*/
+  virtual void calculate_worths(const eoPop& _pop) = 0;
+
+  /**
+  Sort population according to worth, will keep the worths and fitness_cache in sync with the population.
+  */
+  virtual void sort_pop(eoPop& _pop)
+  { // start with a std::vector of indices
+      std::vector indices(_pop.size());
+
+    unsigned i;
+    for (i = 0; i < _pop.size();++i)
+    { // could use generate, but who cares
+      indices[i] = i;
+    }
+
+    std::sort(indices.begin(), indices.end(), compare_worth(value()));
+
+    eoPop      tmp_pop;
+    tmp_pop.resize(_pop.size());
+    std::vector  tmp_worths(value().size());
+
+#ifdef _MSC_VER
+    std::vector tmp_cache(_pop.size());
+#else
+    std::vector tmp_cache(_pop.size());
+#endif
+    for (i = 0; i < _pop.size(); ++i)
+    {
+      tmp_pop[i] = _pop[indices[i]];
+      tmp_worths[i] = value()[indices[i]];
+
+      tmp_cache[i] = fitness_cache[indices[i]];
+    }
+
+    std::swap(_pop, tmp_pop);
+    std::swap(value(), tmp_worths);
+    std::swap(fitness_cache, tmp_cache);
+  }
+
+  /** helper class used to sort indices into populations/worths
+  */
+  class compare_worth
+  {
+  public :
+    compare_worth(const std::vector& _worths) : worths(_worths) {}
+
+    bool operator()(unsigned a, unsigned b) const
+    {
+      return worths[b] < worths[a]; // sort in descending (!) order
+    }
+
+  private :
+
+    const std::vector& worths;
+  };
+
+  virtual void resize(eoPop& _pop, unsigned sz)
+  {
+    _pop.resize(sz);
+    value().resize(sz);
+    fitness_cache.resize(sz);
+  }
+
+  private :
+  std::vector  fitness_cache;
+};
+
+
+
+/** A dummy perf2worth, just in case you need it */
+template 
+class eoNoPerf2Worth : public eoPerf2Worth
+{
+public:
+
+    using eoValueParam< EOT >::value;
+
+    // default behaviour, just copy fitnesses
+    void operator()(const eoPop& _pop) {
+        unsigned i;
+        value().resize(_pop.size());
+        for (i = 0; i < _pop.size(); ++i)
+            value()[i]=_pop[i];
+    }
+};
+
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoPeriodicContinue.h b/trunk/paradiseo-eo/src/eoPeriodicContinue.h
new file mode 100644
index 000000000..7b47af6ea
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoPeriodicContinue.h
@@ -0,0 +1,63 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+// "eoFreqContinue.h"
+
+// (c) OPAC Team, LIFL, Feb. 2006
+
+/* This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+   
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+   
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA
+   
+   Contact: cahon@lifl.fr  
+*/
+
+#ifndef __eoPeriodicContinue_h
+#define __eoPeriodicContinue_h
+
+#include 
+#include 
+
+template  class eoPeriodicContinue: public eoContinue  {
+
+public:
+  
+  /** Constructor. The period is given in parameter. */  
+  eoPeriodicContinue (unsigned __period, unsigned __init_counter = 0);
+
+  /** It returns 'true' only if the current number of generations modulo
+      the period doen't equal to zero. */  
+  bool operator () (const eoPop  & pop);
+    
+private:
+
+  unsigned period;
+  
+  unsigned counter;
+
+};
+
+template  
+eoPeriodicContinue  :: eoPeriodicContinue (unsigned __period, unsigned __init_counter
+						) : period (__period),
+						    counter (__init_counter) {
+
+}
+
+template  
+bool eoPeriodicContinue  :: operator () (const eoPop  & __pop) {
+    
+  return ((++ counter) % period) != 0 ;
+}
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/eoPersistent.cpp b/trunk/paradiseo-eo/src/eoPersistent.cpp
new file mode 100644
index 000000000..1c0c52ea7
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoPersistent.cpp
@@ -0,0 +1,15 @@
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+#include 
+
+//Implementation of these objects
+
+//-----------------------------------------------------------------------------
+
+std::istream & operator >> ( std::istream& _is, eoPersistent& _o ) {
+  _o.readFrom(_is);
+  return _is;
+};
diff --git a/trunk/paradiseo-eo/src/eoPersistent.h b/trunk/paradiseo-eo/src/eoPersistent.h
new file mode 100644
index 000000000..2d4c3eb1a
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoPersistent.h
@@ -0,0 +1,72 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+
+
+//-----------------------------------------------------------------------------
+
+// eoPersistent.h
+// (c) GeNeura Team, 1999
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef EOPERSISTENT_H
+#define EOPERSISTENT_H
+
+/// @name variables Some definitions of variables used throughout the program
+//@{
+/// max length to store stuff read
+const unsigned MAXLINELENGTH=1024;
+//@}
+
+//-----------------------------------------------------------------------------
+
+#include   // std::istream, std::ostream
+#include     // para std::string
+
+//-----------------------------------------------------------------------------
+#include "eoPrintable.h"
+
+//-----------------------------------------------------------------------------
+// eoPersistent
+//-----------------------------------------------------------------------------
+/**
+An persistent object that knows how to write (through functions inherited from
+#eoPrintable#) and read itself
+ */
+class eoPersistent: public eoPrintable
+{
+ public:
+  /// Virtual dtor. They are needed in virtual class hierarchies.
+  virtual ~eoPersistent() {}
+  
+  /**
+   * Read object.
+   * @param _is A std::istream.
+   * @throw runtime_std::exception If a valid object can't be read.
+   */
+  virtual void readFrom(std::istream& _is) = 0;
+  
+};
+
+//-----------------------------------------------------------------------------
+///Standard input for all objects in the EO hierarchy
+std::istream & operator >> ( std::istream& _is, eoPersistent& _o );
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/eoPop.h b/trunk/paradiseo-eo/src/eoPop.h
new file mode 100644
index 000000000..e9b2db95d
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoPop.h
@@ -0,0 +1,304 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoPop.h 
+// (c) GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _EOPOP_H
+#define _EOPOP_H
+
+#include 
+#include 
+#include  // needed for GCC 3.2
+#include 
+
+// EO includes
+#include  // for eoInit
+#include 
+#include 
+#include   // for shuffle method
+
+/** A std::vector of EO object, to be used in all algorithms 
+ *      (selectors, operators, replacements, ...).
+ *
+ * We have no idea if a population can be
+ * some other thing that a std::vector, but if somebody thinks of it, this concrete
+ * implementation can be moved to "generic" and an abstract Population 
+ * interface be provided.
+ *
+ * The template can be instantiated with anything that accepts a "size" 
+ * and eoInit derived object. in the ctor. 
+ * EOT must also have a copy ctor, since temporaries are created and then
+ * passed to the eoInit object
+ */
+
+template
+class eoPop: public std::vector, public eoObject, public eoPersistent 
+{
+
+ public:
+     
+     using std::vector::size;
+     using std::vector::resize;
+     using std::vector::operator[];
+     using std::vector::begin;
+     using std::vector::end;
+     
+     typedef typename EOT::Fitness Fitness;
+	/** Default ctor. Creates empty pop
+	*/
+	eoPop()	  : std::vector(), eoObject(), eoPersistent() {};
+	
+	/** Ctor for the initialization of chromosomes
+    
+	@param _popSize total population size
+	@param _chromInit Initialization routine, produces EO's, needs to be an eoInit 
+	*/
+    eoPop( unsigned _popSize, eoInit& _chromInit )
+      :std::vector() 
+    {
+        resize(_popSize);
+	  for ( unsigned i = 0; i < _popSize; i++ )
+      {
+	        _chromInit(operator[](i));
+	  }
+	};
+
+	/** appstd::ends random guys at end of pop.
+	    Can be used to initialize it pop is empty 
+    
+	@param _popSize total population size
+	@param _chromInit Initialization routine, produces EO's, needs to be an eoInit 
+	*/
+    void append( unsigned _newPopSize, eoInit& _chromInit )
+    {
+      unsigned oldSize = size();
+      if (_newPopSize < oldSize)
+	{
+	  throw std::runtime_error("New size smaller than old size in pop.append");
+	  return;
+	}
+      if (_newPopSize == oldSize)
+	return;
+      resize(_newPopSize);	   // adjust the size
+      for ( unsigned i = oldSize; i < _newPopSize; i++ )
+	{
+	  _chromInit(operator[](i));
+	}
+    };
+  
+  
+  /** Ctor from an std::istream; reads the population from a stream,
+      each element should be in different lines
+      @param _is the stream
+  */
+  eoPop( std::istream& _is ) :std::vector() {
+    readFrom( _is );
+  }
+  
+  /** Empty Dtor */
+	virtual ~eoPop() {};
+
+
+  /// helper struct for getting a pointer
+      struct Ref { const EOT* operator()(const EOT& eot) { return &eot;}};
+  /// helper struct for comparing on pointers
+      struct Cmp {
+          bool operator()(const EOT* a, const EOT* b) const
+            { return b->operator<(*a); }
+      };
+
+    /**
+    sort the population. Use this member to sort in order
+    of descending Fitness, so the first individual is the best!
+   */
+  void sort(void)
+  {
+      std::sort(begin(), end(), std::greater());
+  }
+
+  /** creates a std::vector pointing to the individuals in descending order */
+  void sort(std::vector& result) const
+  {
+      result.resize(size());
+
+      std::transform(begin(), end(), result.begin(), Ref());
+
+      std::sort(result.begin(), result.end(), Cmp());
+  }
+
+    /**
+    shuffle the population. Use this member to put the population
+    in random order
+   */
+  void shuffle(void)
+  {
+    UF_random_generator gen;
+      std::random_shuffle(begin(), end(), gen);
+  }
+
+  /** creates a std::vector pointing to the individuals in random order */
+  void shuffle(std::vector& result) const
+  {
+      result.resize(size());
+
+      std::transform(begin(), end(), result.begin(), Ref());
+
+      UF_random_generator gen;
+      std::random_shuffle(result.begin(), result.end(), gen);
+  }
+
+  /** returns an iterator to the best individual DOES NOT MOVE ANYBODY */
+  typename eoPop::iterator it_best_element() 
+  {
+    typename eoPop::iterator it = std::max_element(begin(), end());
+    return it;
+  }
+
+  /** returns an iterator to the best individual DOES NOT MOVE ANYBODY */
+  const EOT & best_element() const
+  {
+    typename eoPop::const_iterator it = std::max_element(begin(), end());
+    return (*it);
+  }
+
+  /** returns a const reference to the worse individual DOES NOT MOVE ANYBODY */
+  const EOT & worse_element() const
+  {
+    typename eoPop::const_iterator it = std::min_element(begin(), end());
+    return (*it);
+  }
+
+  /** returns an iterator to the worse individual DOES NOT MOVE ANYBODY */
+  typename eoPop::iterator it_worse_element()
+  {
+    typename eoPop::iterator it = std::min_element(begin(), end());
+    return it;
+  }
+
+  /**
+  slightly faster algorithm than sort to find all individuals that are better
+  than the nth individual. INDIVIDUALS ARE MOVED AROUND in the pop.
+  */
+  typename eoPop::iterator nth_element(int nth)
+  {
+      typename eoPop::iterator it = begin() + nth;
+      std::nth_element(begin(), it, end(), std::greater());
+      return it;
+  }
+
+  struct GetFitness { Fitness operator()(const EOT& _eo) const { return _eo.fitness(); } };
+  
+  /** returns the fitness of the nth element */
+  Fitness nth_element_fitness(int which) const
+  { // probably not the fastest way to do this, but what the heck
+      
+      std::vector fitness(size());
+      std::transform(begin(), end(), fitness.begin(), GetFitness());
+
+      typename std::vector::iterator it = fitness.begin() + which;
+      std::nth_element(fitness.begin(), it, fitness.end(), std::greater());
+      return *it;
+  }
+
+  /** const nth_element function, returns pointers to sorted individuals 
+   * up the the nth 
+   */
+  void nth_element(int which, std::vector& result) const
+  {
+
+      result.resize(size());
+      std::transform(begin(), end(), result.begin(), Ref());
+  
+      typename std::vector::iterator it  = result.begin() + which;
+
+      std::nth_element(result.begin(), it, result.end(), Cmp());
+  }
+
+  /** does STL swap with other pop */
+  void swap(eoPop& other)
+  {
+      std::swap(static_cast& >(*this), static_cast& >(other));
+  }
+  
+  /**
+   * Prints sorted pop but does NOT modify it!
+   *
+   * @param _os A std::ostream. 
+   */
+  virtual void sortedPrintOn(std::ostream& _os) const 
+  {
+    std::vector result;
+    sort(result);
+    _os << size() << '\n';
+    for (unsigned i = 0; i < size(); ++i)
+      {
+	_os << *result[i] << std::endl;
+      }
+  }
+
+  /**
+   * Write object. It's called printOn since it prints the object _on_ a stream.
+   * @param _os A std::ostream. 
+   */
+  virtual void printOn(std::ostream& _os) const 
+  {
+        _os << size() << '\n';
+        std::copy( begin(), end(), std::ostream_iterator( _os, "\n") );
+  }
+
+  /** @name Methods from eoObject	*/
+  //@{
+  /**
+   * Read object. The EOT class must have a ctor from a stream;
+   * @param _is A std::istream.   
+  */
+  virtual void readFrom(std::istream& _is) 
+  {
+    size_t sz;
+    _is >> sz;
+
+    resize(sz);
+
+    for (size_t i = 0; i < sz; ++i) {  
+        operator[](i).readFrom( _is );
+    }
+  }
+
+  /** Inherited from eoObject. Returns the class name.
+      @see eoObject
+  */
+  virtual std::string className() const {return "eoPop";};
+    //@}
+
+  virtual void invalidate()
+  {
+    for (unsigned i=0; ioperator[](i).invalidate();
+  }
+
+
+ protected:
+
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/eoPopAlgo.h b/trunk/paradiseo-eo/src/eoPopAlgo.h
new file mode 100644
index 000000000..3cf40d21e
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoPopAlgo.h
@@ -0,0 +1,17 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+#ifndef eoPopAlgo_h
+#define eoPopAlgo_h
+
+#include 
+#include 
+
+/**
+   For all "population transforming" algos ... 
+ */
+
+template  class eoPopAlgo : public eoUF  &, void> {
+    
+} ;
+	
+#endif
diff --git a/trunk/paradiseo-eo/src/eoPopEvalFunc.h b/trunk/paradiseo-eo/src/eoPopEvalFunc.h
new file mode 100644
index 000000000..e03279225
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoPopEvalFunc.h
@@ -0,0 +1,101 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+-----------------------------------------------------------------------------
+    eoPopEvalFunc.h
+    Abstract class for global evaluation of the population
+
+    (c) GeNeura Team, 2000
+ 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoPopEvalFunc_H
+#define eoPopEvalFunc_H
+
+#include 
+#include 
+
+/** eoPopEvalFunc: This abstract class is for GLOBAL evaluators 
+ *    of a population after variation.
+ *    It takes 2 populations (typically the parents and the offspring)
+ *    and is suppposed to evaluate them alltogether
+ *
+ *  Basic use: apply an embedded eoEvalFunc to the offspring 
+ *
+ *  Time-varying fitness: apply the embedded eoEvalFunc to both 
+ *     offspring and parents
+ *
+ *  Advanced uses: Co-evolution or "parisian" approach, or ...
+ *
+ *  Basic parallelization (synchronous standard evolution engine): 
+ *    call the slaves and wait for the results
+ */
+template
+class eoPopEvalFunc : public eoBF & , eoPop &, void> 
+{};
+
+/////////////////////////////////////////////////////////////
+//           eoPopLoopEval
+/////////////////////////////////////////////////////////////
+
+/** eoPopLoopEval: an instance of eoPopEvalFunc that simply applies 
+ *     a private eoEvalFunc to all offspring
+ */
+template
+class eoPopLoopEval : public eoPopEvalFunc {
+public:
+  /** Ctor: set value of embedded eoEvalFunc */
+  eoPopLoopEval(eoEvalFunc & _eval) : eval(_eval) {}
+
+  /** Do the job: simple loop over the offspring */
+  void operator()(eoPop & _parents, eoPop & _offspring)
+  {
+    apply(eval, _offspring);
+  }
+
+private:
+  eoEvalFunc & eval;
+};
+
+/////////////////////////////////////////////////////////////
+//           eoTimeVaryingLoopEval
+/////////////////////////////////////////////////////////////
+
+/** eoPopLoopEval: an instance of eoPopEvalFunc that simply applies 
+ *     a private eoEvalFunc to all offspring AND ALL PARENTS
+ *     as the fitness is supposed here to vary 
+ */
+template
+class eoTimeVaryingLoopEval : public eoPopEvalFunc {
+public:
+  /** Ctor: set value of embedded eoEvalFunc */
+  eoTimeVaryingLoopEval(eoEvalFunc & _eval) : eval(_eval) {}
+
+  /** Do the job: simple loop over the offspring */
+  void operator()(eoPop & _parents, eoPop & _offspring)
+  {
+    apply(eval, _parents);
+    apply(eval, _offspring);
+  }
+
+private:
+  eoEvalFunc & eval;
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/eoPopulator.h b/trunk/paradiseo-eo/src/eoPopulator.h
new file mode 100644
index 000000000..34b4f2360
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoPopulator.h
@@ -0,0 +1,208 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoPopulator.h
+// (c) Maarten Keijzer and Marc Schoenauer, 2001
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: mkeijzer@dhi.dk
+             Marc.Schoenauer@polytechnique.fr
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoPopulator_H
+#define _eoPopulator_H
+
+#include 
+#include 
+
+/** eoPopulator is a helper class for general operators eoGenOp
+    It is an eoPop but also behaves like an eoPop::iterator
+    as far as operator* and operator++ are concerned
+
+    See eoGenOp and eoOpContainer
+*/
+template 
+class eoPopulator
+{
+public :
+
+  eoPopulator(const eoPop& _src, eoPop& _dest) : dest(_dest), current(dest.end()), src(_src)
+  {
+    dest.reserve(src.size()); // we don't know this, but wth.
+    current = dest.end();
+  }
+
+    /** @brief Virtual Constructor */
+    virtual ~eoPopulator() {};
+
+  struct OutOfIndividuals {};
+
+  /** a populator behaves like an iterator. Hence the operator*
+   *      it returns the current individual -- eventually getting
+   *      a new one through the operator++ if at the end
+   */
+  EOT& operator*(void)
+  {
+    if (current == dest.end())
+      get_next(); // get a new individual
+
+    return *current;
+  }
+
+  /** only prefix increment defined
+     Does not add a new element when at the end, use operator* for that
+     If not on the end, increment the pointer to the next individual
+   */
+  eoPopulator& operator++()
+  {
+    if (current == dest.end())
+      { // keep the pointer there
+        return *this;
+      }
+    // else
+    ++current;
+    return *this;
+  }
+
+  /** mandatory for operators that generate more offspring than parents
+   *  if such a thing exists ?
+   */
+  void insert(const EOT& _eo)
+  { /* not really efficient, but its nice to have */
+    current = dest.insert(current, _eo);
+  }
+
+  /** just to make memory mangement more efficient
+   */
+  void reserve(int how_many)
+  {
+    size_t sz = current - dest.begin();
+    if (dest.capacity() < dest.size() + how_many)
+    {
+      dest.reserve(dest.size() + how_many);
+    }
+
+    current = dest.begin() + sz;
+  }
+
+  /** can be useful for operators with embedded selectors
+   *  e.g. your brain and my beauty -type
+   */
+  const eoPop& source(void) { return src; }
+
+  /** Get the offspring population.
+      Can be useful when you want to do some online niching kind of thing
+  */
+  eoPop& offspring(void)    { return dest; }
+
+  typedef unsigned position_type;
+
+  /** this is a direct access container: tell position */
+  position_type tellp()         { return current - dest.begin(); }
+  /** this is a direct access container: go to position */
+  void seekp(position_type pos) { current = dest.begin() + pos; }
+  /** no more individuals  */
+  bool exhausted(void)          { return current == dest.end(); }
+
+  /** the pure virtual selection method - will be instanciated in
+   *   eoSeqPopulator and eoSelectivePopulator
+   */
+  virtual const EOT& select() = 0;
+
+protected:
+    eoPop& dest;
+    typename eoPop::iterator current;
+    const eoPop& src;
+
+private:
+
+  void get_next() {
+    if(current == dest.end())
+      { // get new individual from derived class select()
+        dest.push_back(select());
+        current = dest.end();
+        --current;
+        return;
+      }
+    // else
+    ++current;
+    return;
+  }
+
+};
+
+
+/** SeqPopulator: an eoPopulator that sequentially goes through the
+    population is supposed to be used after a batch select of a whole
+    bunch or genitors
+*/
+template 
+class eoSeqPopulator : public eoPopulator
+{
+public:
+
+    using eoPopulator< EOT >::src;
+
+    eoSeqPopulator(const eoPop& _pop, eoPop& _dest) :
+        eoPopulator(_pop, _dest), current(0) {}
+
+    /** the select method simply returns next individual in the src pop */
+    const EOT& select(void) {
+        if(current >= eoPopulator< EOT >::src.size()) {
+            throw OutOfIndividuals();
+        }
+
+        const EOT& res = src[current++];
+        return res;
+    }
+
+
+private:
+
+    struct OutOfIndividuals {};
+
+    unsigned current;
+};
+
+
+/** SelectivePopulator an eoPoplator that uses an eoSelectOne to select guys.
+Supposedly, it is passed the initial population.
+ */
+template 
+class eoSelectivePopulator : public eoPopulator
+{
+public :
+
+    using eoPopulator< EOT >::src;
+
+    eoSelectivePopulator(const eoPop& _pop, eoPop& _dest, eoSelectOne& _sel)
+        : eoPopulator(_pop, _dest), sel(_sel)
+        { sel.setup(_pop); };
+
+    /** the select method actually selects one guy from the src pop */
+    const EOT& select() {
+        return sel(src);
+    }
+
+
+private:
+
+    eoSelectOne& sel;
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/eoPrintable.cpp b/trunk/paradiseo-eo/src/eoPrintable.cpp
new file mode 100644
index 000000000..c90e6424b
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoPrintable.cpp
@@ -0,0 +1,22 @@
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+//-----------------------------------------------------------------------------
+// eoPrintable.cpp
+//-----------------------------------------------------------------------------
+
+#include 
+
+//-----------------------------------------------------------------------------
+//Implementation of these objects
+//-----------------------------------------------------------------------------
+
+std::ostream & operator << ( std::ostream& _os, const eoPrintable& _o ) {
+	_o.printOn(_os);
+	return _os;
+};
+
+//-----------------------------------------------------------------------------
+
diff --git a/trunk/paradiseo-eo/src/eoPrintable.h b/trunk/paradiseo-eo/src/eoPrintable.h
new file mode 100644
index 000000000..256383dc6
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoPrintable.h
@@ -0,0 +1,61 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoPrintable.h
+// (c) GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef EOPRINTABLE_H
+#define EOPRINTABLE_H
+
+//-----------------------------------------------------------------------------
+
+#include   // std::istream, std::ostream
+#include  // para std::string
+
+//-----------------------------------------------------------------------------
+// eoPrintable
+//-----------------------------------------------------------------------------
+/**
+Base class for objects that can print themselves
+(#printOn#). Besides, this file defines the standard output for all the objects; 
+if the objects define printOn there's no need to define #operator <<#.\\
+This functionality was separated from eoObject, since it makes no sense to print
+some objects (for instance, a #eoFactory# or a random number generator.
+ */
+class eoPrintable
+{
+ public:
+  /// Virtual dtor. They are needed in virtual class hierarchies.
+  virtual ~eoPrintable() {}
+  
+  /**
+   * Write object. It's called printOn since it prints the object on a stream.
+   * @param _os A std::ostream.
+   */
+  virtual void printOn(std::ostream& _os) const = 0;
+};
+
+//-----------------------------------------------------------------------------
+///Standard output for all objects in the EO hierarchy
+std::ostream & operator << ( std::ostream& _os, const eoPrintable& _o );
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/eoPropGAGenOp.h b/trunk/paradiseo-eo/src/eoPropGAGenOp.h
new file mode 100644
index 000000000..e4305e29c
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoPropGAGenOp.h
@@ -0,0 +1,87 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoPropGAGenOp.h
+// (c) Marc.Schoenauer 2005
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@inria.fr
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoPropGAGenOp_h
+#define _eoPropGAGenOp_h
+
+#include "eoGenOp.h"
+#include "eoInvalidateOps.h"
+///////////////////////////////////////////////////////////////////////////////
+// class eoSGAGenOp
+///////////////////////////////////////////////////////////////////////////////
+
+/** ***************************************************************************
+ * eoPropGAGenOp (for Simple GA, but Proportional) 
+ * choice between Crossover, mutation or cloining 
+ * with respect to given relatve weights
+ *****************************************************************************/
+template 
+class eoPropGAGenOp : public eoGenOp
+{
+ public:
+    
+  /** Ctor from 
+   *   * weight of clone
+   *   * crossover (with weight)
+   *   * mutation (with weight)
+   */
+  eoPropGAGenOp(double _wClone, eoQuadOp& _cross, double _wCross, 
+		 eoMonOp& _mut, double _wMut)
+    : wClone(_wClone),
+      cross(_cross),
+      wCross(_wCross),
+      mut(_mut), 
+      wMut(_wMut) 
+  {
+    propOp.add(cross, wCross); // the crossover - with weight wCross
+    propOp.add(mut, wMut); // mutation with weight wMut
+    propOp.add(monClone, wClone);
+  }
+  
+  /** do the job: delegate to op */
+  virtual void apply(eoPopulator& _pop)
+  {
+    propOp.apply(_pop);
+  }
+
+  /** inherited from eoGenOp */
+  virtual unsigned max_production(void) {return 2;}
+
+  virtual std::string className() const {return "eoPropGAGenOp";}
+
+
+ private:
+  double wClone;
+  eoQuadOp ✗   // eoInvalidateXXX take the boolean output
+  double wCross;
+  eoMonOp & mut;      // of the XXX op and invalidate the EOT
+  double wMut;
+  eoProportionalOp propOp;
+  eoMonCloneOp monClone;
+};
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoProportionalCombinedOp.h b/trunk/paradiseo-eo/src/eoProportionalCombinedOp.h
new file mode 100644
index 000000000..8a30d368d
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoProportionalCombinedOp.h
@@ -0,0 +1,210 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+//-----------------------------------------------------------------------------
+// eoCombinedOp.h
+// (c) GeNeura Team, 1998, Marc Schoenauer, 2000
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoCombinedOp_H
+#define _eoCombinedOp_H
+
+#include 
+#include 
+#include 
+#include 
+#include 
+/**
+\defgroup PropCombinedOperators
+Combination of same-type Genetic Operators - Proportional choice
+*/
+
+/** @name PropCombined Genetic operators
+
+This files contains the classes eoPropCombinedXXXOp (XXX in {Mon, Bin, Quad})
+that allow to use more than a single operator of a specific class
+into an algorithm, chosing by a roulette wheel based on user-defined rates
+
+@author Marc Schoenauer
+@version 0.1
+*/
+
+
+//////////////////////////////////////////////////////
+//// combined MonOp
+//////////////////////////////////////////////////////
+
+/** eoMonOp is the monary operator: genetic operator that takes only one EO
+
+ * now accepts generic operators
+*/
+
+template 
+class eoPropCombinedMonOp: public eoMonOp
+{
+public:
+  /// Ctor from a "true" operator
+  eoPropCombinedMonOp(eoMonOp & _first, const double _rate)
+  {
+    ops.push_back(&_first);
+    rates.push_back(_rate);
+  }
+
+  virtual std::string className() const { return "eoPropCombinedMonOp"; }
+
+  virtual void add(eoMonOp & _op, const double _rate, bool _verbose=false)
+  {
+    ops.push_back(&_op);
+    rates.push_back(_rate);
+    // compute the relative rates in percent - to warn the user!
+    if (_verbose)
+      printOn(std::cout);
+  }
+
+  // outputs the operators and percentages
+  virtual void printOn(std::ostream & _os)
+  {
+    double total = 0;
+    unsigned i;
+    for (i=0; iclassName() << " with rate " << 100*rates[i]/total << " %\n";
+  }
+
+  virtual bool operator()(EOT & _indi)
+  {
+    unsigned what = rng.roulette_wheel(rates); // choose one op
+    return (*ops[what])(_indi);		   // apply it
+  }
+protected:
+std::vector*> ops;
+std::vector rates;
+};
+
+//////////////////////////////////////////////////////
+//// combined BinOp
+//////////////////////////////////////////////////////
+
+/** COmbined Binary genetic operator:
+ *  operator() has two operands, only the first one can be modified
+ */
+template 
+class eoPropCombinedBinOp: public eoBinOp
+{
+public:
+  /// Ctor
+  eoPropCombinedBinOp(eoBinOp & _first, const double _rate)
+  {
+    ops.push_back(&_first);
+    rates.push_back(_rate);
+  }
+
+virtual std::string className() const { return "eoPropCombinedBinOp"; }
+
+virtual void add(eoBinOp & _op, const double _rate, bool _verbose=false)
+  {
+    ops.push_back(&_op);
+    rates.push_back(_rate);
+    // compute the relative rates in percent - to warn the user!
+    if (_verbose)
+      {
+	double total = 0;
+	unsigned i;
+	for (i=0; iclassName() << " with rate " << 100*rates[i]/total << " %\n";
+      }
+  }
+
+  virtual void operator()(EOT & _indi1, const EOT & _indi2)
+  {
+    unsigned what = rng.roulette_wheel(rates); // choose one op index
+    return (*ops[what])(_indi1, _indi2);		   // apply it
+  }
+private:
+std::vector*> ops;
+std::vector rates;
+};
+
+
+//////////////////////////////////////////////////////
+//// combined QuadOp
+//////////////////////////////////////////////////////
+
+/** Quad genetic operator: subclasses eoOp, and defines basically the
+    operator() with two operands, both can be modified.
+*/
+/** Combined quad genetic operator:
+ *  operator() has two operands, both can be modified
+
+ * generic operators are now allowed: there are imbedded into
+ * the corresponding "true" operator
+ */
+template 
+class eoPropCombinedQuadOp: public eoQuadOp
+{
+public:
+  /// Ctor from a true operator
+  eoPropCombinedQuadOp(eoQuadOp & _first, const double _rate)
+  {
+    ops.push_back(&_first);
+    rates.push_back(_rate);
+  }
+
+virtual std::string className() const { return "eoPropCombinedQuadOp"; }
+
+  // addition of a true operator
+virtual void add(eoQuadOp & _op, const double _rate, bool _verbose=false)
+  {
+    ops.push_back(&_op);
+    rates.push_back(_rate);
+    // compute the relative rates in percent - to warn the user!
+    if (_verbose)
+      printOn(std::cout);
+  }
+
+  // outputs the operators and percentages
+  virtual void printOn(std::ostream & _os)
+  {
+    double total = 0;
+    unsigned i;
+    for (i=0; iclassName() << " with rate " << 100*rates[i]/total << " %\n";
+  }
+
+  virtual bool operator()(EOT & _indi1, EOT & _indi2)
+  {
+    unsigned what = rng.roulette_wheel(rates); // choose one op index
+    return (*ops[what])(_indi1, _indi2);		   // apply it
+  }
+private:
+std::vector*> ops;
+std::vector rates;
+};
+
+
+// for General Ops, it's another story - see eoOpCOntainer
+#endif
+
diff --git a/trunk/paradiseo-eo/src/eoProportionalSelect.h b/trunk/paradiseo-eo/src/eoProportionalSelect.h
new file mode 100755
index 000000000..8c01b7503
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoProportionalSelect.h
@@ -0,0 +1,85 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoProportionalSelect.h
+// (c) GeNeura Team, 1998 - EEAAX 1999, Maarten Keijzer 2000
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoProportionalSelect_h
+#define eoProportionalSelect_h
+
+//-----------------------------------------------------------------------------
+
+#include 
+#include 
+#include 
+#include 
+//-----------------------------------------------------------------------------
+/** eoProportionalSelect: select an individual proportional to her stored fitness
+    value 
+    
+    Changed the algorithm to make use of a cumulative array of fitness scores, 
+    This changes the algorithm from O(n) per call to  O(log n) per call. (MK)
+*/
+//-----------------------------------------------------------------------------
+
+template  class eoProportionalSelect: public eoSelectOne 
+{
+public:
+  /// Sanity check
+  eoProportionalSelect(const eoPop& pop = eoPop()) 
+  {
+    if (minimizing_fitness())
+      throw std::logic_error("eoProportionalSelect: minimizing fitness");
+  }
+
+  void setup(const eoPop& _pop)
+  {
+      if (_pop.size() == 0) return;
+      
+      cumulative.resize(_pop.size());
+      cumulative[0] = _pop[0].fitness();
+
+      for (unsigned i = 1; i < _pop.size(); ++i) 
+      {
+	  cumulative[i] = _pop[i].fitness() + cumulative[i-1];
+      }
+  }
+    
+  /** do the selection,  
+   */
+  const EOT& operator()(const eoPop& _pop) 
+  {
+      if (cumulative.size() == 0) setup(_pop);
+      
+      double fortune = rng.uniform() * cumulative.back(); 
+      typename FitVec::iterator result = std::upper_bound(cumulative.begin(), cumulative.end(), fortune);
+      return _pop[result - cumulative.begin()];
+  }
+
+private :
+
+  typedef std::vector FitVec;
+  FitVec cumulative;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoRandomSelect.h b/trunk/paradiseo-eo/src/eoRandomSelect.h
new file mode 100644
index 000000000..6569207b7
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoRandomSelect.h
@@ -0,0 +1,98 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoRandomSelect.h
+// (c) GeNeura Team, 1998 - EEAAX 1999, Maarten Keijzer 2000
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoRandomSelect_h
+#define eoRandomSelect_h
+
+//-----------------------------------------------------------------------------
+/** This file contains straightforward selectors:
+ * eoRandomSelect          returns an individual uniformly selected
+ * eoBestSelect            always return the best individual
+ * eoSequentialSelect      returns all individuals in turn
+ */
+
+#include 
+#include 
+
+//-----------------------------------------------------------------------------
+/** eoRandomSelect: a selection method that selects ONE individual randomly */
+//-----------------------------------------------------------------------------
+
+template  class eoRandomSelect: public eoSelectOne
+{
+ public:
+
+  /// not a big deal!!!
+  virtual const EOT& operator()(const eoPop& _pop)
+  {
+    return _pop[eo::rng.random(_pop.size())] ;
+  }
+};
+
+//-----------------------------------------------------------------------------
+/** eoBestSelect: a selection method that always return the best
+ *                (mainly for testing purposes) */
+//-----------------------------------------------------------------------------
+
+template  class eoBestSelect: public eoSelectOne
+{
+ public:
+
+  /// not a big deal!!!
+  virtual const EOT& operator()(const eoPop& _pop)
+  {
+    return _pop.best_element() ;
+  }
+};
+
+//-----------------------------------------------------------------------------
+/** eoNoSelect: returns all individual in order WITHOUT USING FITNESS!!!
+ *       looping back to the beginning when exhasuted
+ *
+ */
+//-----------------------------------------------------------------------------
+
+template  class eoNoSelect: public eoSelectOne
+{
+ public:
+  /** Ctor
+  */
+  eoNoSelect(): current(0) {}
+
+  virtual const EOT& operator()(const eoPop& _pop)
+  {
+    if (current >= _pop.size())
+      current=0;
+
+    current++;
+    return _pop[current-1] ;
+  }
+private:
+  unsigned current;
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/eoRanking.h b/trunk/paradiseo-eo/src/eoRanking.h
new file mode 100644
index 000000000..def90dd81
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoRanking.h
@@ -0,0 +1,110 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eoRanking.h
+   (c) Maarten Keijzer, Marc Schoenauer, 2001
+
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoRanking_h
+#define eoRanking_h
+
+#include 
+
+/** An instance of eoPerfFromWorth
+ *  COmputes the ranked fitness: fitnesses range in [m,M]
+ *  with m=2-pressure/popSize and M=pressure/popSize.
+ *  in between, the progression depstd::ends on exponent (linear if 1).
+ */
+template 
+class eoRanking : public eoPerf2Worth // false: do not cache fitness
+{
+public:
+
+    using eoPerf2Worth::value;
+
+  /* Ctor:
+   @param _p selective pressure (in (1,2]
+   @param _e exponent (1 == linear)
+  */
+  eoRanking(double _p=2.0, double _e=1.0):
+    pressure(_p), exponent(_e) {}
+
+  /* helper function: finds index in _pop of _eo, an EOT * */
+  int lookfor(const EOT *_eo, const eoPop& _pop)
+    {
+      typename eoPop::const_iterator it;
+      for (it=_pop.begin(); it<_pop.end(); it++)
+	{
+	  if (_eo == &(*it))
+	    return it-_pop.begin();
+	}
+      throw std::runtime_error("Not found in eoLinearRanking");
+    }
+
+  /* COmputes the ranked fitness: fitnesses range in [m,M]
+     with m=2-pressure/popSize and M=pressure/popSize.
+     in between, the progression depstd::ends on exponent (linear if 1).
+   */
+  virtual void operator()(const eoPop& _pop)
+    {
+      std::vector rank;
+      _pop.sort(rank);
+      unsigned pSize =_pop.size();
+      unsigned int pSizeMinusOne = pSize-1;
+
+      if (pSize <= 1)
+	throw std::runtime_error("Cannot do ranking with population of size <= 1");
+
+      // value() refers to the std::vector of worthes (we're in an eoParamvalue)
+      value().resize(pSize);
+
+      double beta = (2-pressure)/pSize;
+      if (exponent == 1.0)	   // no need for exponetial then
+	{
+	  double alpha = (2*pressure-2)/(pSize*pSizeMinusOne);
+	  for (unsigned i=0; i 1/[P(P-1)/2]
+	    }
+	}
+      else				   // exponent != 1
+	{
+	  double gamma = (2*pressure-2)/pSize;
+	  for (unsigned i=0; i
+#include 
+
+/** eoRankingSelect: select an individual by roulette wheel on its rank
+ *  is an eoRouletteWorthSelect, i.e. a selector using a std::vector of worthes
+ *  rather than the raw fitness (see eoSelectFromWorth.h)
+ *  uses an internal eoRanking object which is an eoPerf2Worth
+*/
+
+template  
+class eoRankingSelect: public eoRouletteWorthSelect 
+{
+public:
+  /** Ctor:
+   *  @param _p the selective pressure, should be in [1,2] (2 is the default)
+   *  @param _e exponent (1 == linear)
+   */
+  eoRankingSelect(double _p = 2.0, double _e=1.0): 
+    eoRouletteWorthSelect(ranking), ranking(_p, _e) {}
+
+private :
+  eoRanking ranking;	   // derived from eoPerf2Worth
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoReduce.h b/trunk/paradiseo-eo/src/eoReduce.h
new file mode 100644
index 000000000..53d8e427f
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoReduce.h
@@ -0,0 +1,288 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoReduce.h
+//   Base class for population-merging classes
+// (c) GeNeura Team, 1998
+/* 
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+   Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoReduce_h
+#define eoReduce_h
+
+//-----------------------------------------------------------------------------
+
+#include 
+
+// EO includes
+#include      // eoPop
+#include   // eoReduce
+#include 
+
+/**
+ * eoReduce: .reduce the new generation to the specified size
+   At the moment, limited to truncation - with 2 different methods,
+   one that sorts the whole population, and one that repeatidely kills 
+   the worst. Ideally, we should be able to choose at run-time!!!
+*/
+
+template class eoReduce: public eoBF&, unsigned, void>
+{};
+
+/** truncation method using sort */
+template  class eoTruncate : public eoReduce
+{
+    void operator()(eoPop& _newgen, unsigned _newsize)
+    {
+        if (_newgen.size() == _newsize)
+            return;
+	if (_newgen.size() < _newsize)
+	  throw std::logic_error("eoTruncate: Cannot truncate to a larger size!\n");
+
+        _newgen.nth_element(_newsize);
+        _newgen.resize(_newsize);
+    }
+};
+
+/** random truncation */
+template  class eoRandomReduce : public eoReduce
+{
+    void operator()(eoPop& _newgen, unsigned _newsize)
+    {
+        if (_newgen.size() == _newsize)
+            return;
+	if (_newgen.size() < _newsize)
+	  throw std::logic_error("eoRandomReduce: Cannot truncate to a larger size!\n");
+
+	// shuffle the population, then trucate
+	_newgen.shuffle();
+	_newgen.resize(_newsize);
+    }
+};
+
+/** 
+EP truncation method (some global stochastic tournament +  sort)
+Softer selective pressure than pure truncate
+*/
+template  class eoEPReduce : public eoReduce
+{
+public:
+typedef typename EOT::Fitness Fitness; 
+
+  eoEPReduce(unsigned _t_size  ):
+    t_size(_t_size)
+  {
+    if (t_size < 2)
+      { 
+	std::cout << "Warning: EP tournament size should be >= 2. Adjusted" << std::endl;
+	t_size = 2;
+      }
+  }
+
+  /// helper struct for comparing on std::pairs
+  // compares the scores
+  // uses the fitness if scores are equals ????
+  typedef std::pair::iterator>  EPpair;
+  struct Cmp {
+    bool operator()(const EPpair a, const EPpair b) const
+    { 
+      if (b.first == a.first)
+	return  (*b.second < *a.second);
+      return b.first < a.first; 
+    }
+  };
+  
+  
+  void operator()(eoPop& _newgen, unsigned _newsize)
+  {
+    unsigned int presentSize = _newgen.size();
+    
+    if (presentSize == _newsize)
+            return;
+	if (presentSize < _newsize)
+	  throw std::logic_error("eoTruncate: Cannot truncate to a larger size!\n");
+	std::vector scores(presentSize);
+	for (unsigned i=0; i competitor.fitness())
+		  scores[i].first += 1;
+		else if (fit == competitor.fitness())
+		  scores[i].first += 0.5;
+	      }
+	  }
+
+	// now we have the scores
+	typename std::vector::iterator it = scores.begin() + _newsize;
+        std::nth_element(scores.begin(), it, scores.end(), Cmp());
+	// sort(scores.begin(), scores.end(), Cmp());
+	unsigned j;
+// 	std::cout << "Les scores apres tri\n";
+// 	for (j=0; j tmPop;
+	for (j=0; j<_newsize; j++)
+	  {
+	    tmPop.push_back(*scores[j].second);
+	  }
+	_newgen.swap(tmPop);
+	// erase does not work, but I'm sure there is a way in STL to mark
+	// and later delete all inside a std::vector ??????
+	// this would avoid all copies here
+
+// 	it = scores.begin() + _newsize;
+// 	while (it < scores.end())
+// 	  _newgen.erase(it->second);
+    }
+private:
+  unsigned t_size;
+};
+
+/** a truncate class that does not sort, but repeatidely kills the worse.
+To be used in SSGA-like replacements (e.g. see eoSSGAWorseReplacement)
+*/
+template  
+class eoLinearTruncate : public eoReduce
+{
+  void operator()(eoPop& _newgen, unsigned _newsize)
+  {
+    unsigned oldSize = _newgen.size();
+    if (oldSize == _newsize)
+      return;
+    if (oldSize < _newsize)
+      throw std::logic_error("eoLinearTruncate: Cannot truncate to a larger size!\n");
+    for (unsigned i=0; i::iterator it = _newgen.it_worse_element();
+	_newgen.erase(it);	    
+      }
+  }
+};
+
+/** a truncate class based on a repeated deterministic (reverse!) tournament
+To be used in SSGA-like replacements (e.g. see eoSSGADetTournamentReplacement)
+*/
+template  
+class eoDetTournamentTruncate : public eoReduce
+{
+public:
+  eoDetTournamentTruncate(unsigned _t_size):
+    t_size(_t_size)
+  {
+    if (t_size < 2)
+      { 
+	std::cout << "Warning, Size for eoDetTournamentTruncate adjusted to 2\n";
+	t_size = 2;
+      }
+  }
+
+  void operator()(eoPop& _newgen, unsigned _newsize)
+  {
+    unsigned oldSize = _newgen.size();
+    if (_newsize == 0)
+      {
+	_newgen.resize(0);
+	return;
+      }
+    if (oldSize == _newsize)
+      return;
+    if (oldSize < _newsize)
+      throw std::logic_error("eoDetTournamentTruncate: Cannot truncate to a larger size!\n");
+
+    // Now OK to erase some losers
+    for (unsigned i=0; i(_newgen, t_size);
+	//OLDCODE _newgen.erase(&eo);
+	
+	// Jeroen Eggermont stdc++v3  patch
+	// in the new code from stdc++v3 an iterator from a container is no longer an pointer to T
+	// Because eo already contained a fuction using eoPop::iterator's we will use the following
+	
+	_newgen.erase( inverse_deterministic_tournament(_newgen.begin(), _newgen.end(), t_size) );
+	
+      }
+  }
+private:
+  unsigned t_size;
+};
+
+/** a truncate class based on a repeated deterministic (reverse!) tournament
+To be used in SSGA-like replacements (e.g. see eoSSGAStochTournamentReplacement)
+*/
+template  
+class eoStochTournamentTruncate : public eoReduce
+{
+public:
+  eoStochTournamentTruncate(double _t_rate):
+    t_rate(_t_rate)
+  {
+    if (t_rate <= 0.5)
+      { 
+	std::cout << "Warning, Rate for eoStochTournamentTruncate adjusted to 0.51\n";
+	t_rate = 0.51;
+      }
+    if (t_rate > 1)
+      {
+	std::cout << "Warning, Rate for eoStochTournamentTruncate adjusted to 1\n";
+	t_rate = 1;
+      }
+  }
+
+  void operator()(eoPop& _newgen, unsigned _newsize)
+  {
+    unsigned oldSize = _newgen.size();
+    if (_newsize == 0)
+      {
+	_newgen.resize(0);
+	return;
+      }
+    if (oldSize == _newsize)
+      return;
+    if (oldSize < _newsize)
+      throw std::logic_error("eoStochTournamentTruncate: Cannot truncate to a larger size!\n");
+    // Now OK to erase some losers
+    for (unsigned i=0; i(_newgen, t_rate);
+	//OLDCODE _newgen.erase(&eo);
+	
+	// Jeroen Eggermont stdc++v3  patch
+	// in the new code from stdc++v3 an iterator from a container is no longer an pointer to T
+	// Because eo already contained a fuction using eoPop::iterator's we will use the following
+	
+	_newgen.erase( inverse_stochastic_tournament(_newgen.begin(), _newgen.end(), t_rate) );
+	
+	
+      }
+  }
+
+private:
+  double t_rate;
+};
+
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoReduceMerge.h b/trunk/paradiseo-eo/src/eoReduceMerge.h
new file mode 100644
index 000000000..52088cd00
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoReduceMerge.h
@@ -0,0 +1,119 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eoReduceMerge.h 
+   (c) Maarten Keijzer, Marc Schoenauer, GeNeura Team, 2000
+ 
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoReduceMerge_h
+#define _eoReduceMerge_h
+
+
+//-----------------------------------------------------------------------------
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+//-----------------------------------------------------------------------------
+
+
+/** 
+eoReduceMerge: Replacement strategies that start by reducing the parents, 
+               then merge with the offspring
+
+This is the way to do SSGA: the offspring gets inserted in the population
+even if it is worse than anybody else.
+
+@classes: eoReduceMerge, eoSSGAWorseReplacement, 
+    eoSSGADetTournamentReplacement, eoSSGAStochTournamentReplacement
+*/
+
+template 
+class eoReduceMerge : public eoReplacement
+{
+    public:
+        eoReduceMerge(eoReduce& _reduce, eoMerge& _merge) :
+        reduce(_reduce), merge(_merge)
+        {}
+
+        void operator()(eoPop& _parents, eoPop& _offspring)
+        {
+	  if (_parents.size() < _offspring.size())
+	    throw std::logic_error("eoReduceMerge: More offspring than parents!\n");
+	  reduce(_parents, _parents.size() - _offspring.size()); 
+	  merge(_offspring, _parents);
+        }
+
+    private :
+        eoReduce& reduce;
+        eoMerge& merge;
+};
+
+/** 
+SSGA replace worst. Is an eoReduceMerge.
+*/
+template  
+class eoSSGAWorseReplacement : public eoReduceMerge
+{
+    public :
+        eoSSGAWorseReplacement() : eoReduceMerge(truncate, plus) {}
+
+    private :
+        eoLinearTruncate truncate;
+        eoPlus plus;
+};
+
+/** 
+SSGA deterministic tournament replacement. Is an eoReduceMerge.
+*/
+template  
+class eoSSGADetTournamentReplacement : public eoReduceMerge
+{
+    public :
+        eoSSGADetTournamentReplacement(unsigned _t_size) : 
+	  eoReduceMerge(truncate, plus), truncate(_t_size) {}
+
+    private :
+        eoDetTournamentTruncate truncate;
+        eoPlus plus;
+};
+
+/** SSGA stochastic tournament replacement. Is an eoReduceMerge.
+It much cleaner to insert directly the offspring in the parent population, 
+but it is NOT equivalent in case of more than 1 offspring as already 
+replaced could be removed , which is not possible in the eoReduceMerge 
+So what the heck ! */
+template  
+class eoSSGAStochTournamentReplacement : public eoReduceMerge
+{
+    public :
+        eoSSGAStochTournamentReplacement(double _t_rate) : 
+	  eoReduceMerge(truncate, plus), truncate(_t_rate) {}
+
+    private :
+        eoStochTournamentTruncate truncate;
+        eoPlus plus;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoReduceMergeReduce.h b/trunk/paradiseo-eo/src/eoReduceMergeReduce.h
new file mode 100644
index 000000000..05854ea76
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoReduceMergeReduce.h
@@ -0,0 +1,143 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eoReduceMergeReduce.h 
+   (c) Maarten Keijzer, Marc Schoenauer, 2002
+ 
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@inria.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoReduceMergeReduce_h
+#define _eoReduceMergeReduce_h
+
+
+//-----------------------------------------------------------------------------
+#include 
+#include 
+#include 
+#include 
+#include 
+//-----------------------------------------------------------------------------
+
+/**
+eoReduceMergeReduce is an eoReplacement:
+- saves possible elite parents
+- reduces rest of parents
+- reduces offspring
+- merges reduced populations
+- reduces resulting merged pop if necessary
+
+*/
+
+template 
+class eoReduceMergeReduce : public eoReplacement
+{
+public:
+  eoReduceMergeReduce(eoHowMany _howManyElite, 
+		      bool _strongElitism, 
+		      eoHowMany _howManyReducedParents,
+		      eoReduce & _reduceParents,
+		      eoHowMany _howManyReducedOffspring, 
+		      eoReduce & _reduceOffspring,
+		      eoReduce & _reduceFinal) :
+    howManyElite(_howManyElite),
+    strongElitism(_strongElitism),
+    howManyReducedParents(_howManyReducedParents),
+    howManyReducedOffspring (_howManyReducedOffspring),
+    reduceParents(_reduceParents),
+    reduceOffspring(_reduceOffspring),
+    reduceFinal(_reduceFinal)
+  {}
+    
+    void operator()(eoPop & _parents, eoPop & _offspring)
+    {
+      eoPop temp;
+      unsigned int finalPopSize = _parents.size();
+      unsigned int offSize = _offspring.size();
+
+      unsigned int elite = howManyElite(finalPopSize);
+      if (elite)		   // some parents MUST be saved somewhere
+	{
+	  temp.resize(elite);
+	  _parents.nth_element(elite);
+	  std::copy(_parents.begin(), _parents.begin()+elite, temp.begin());
+	  _parents.erase(_parents.begin(), _parents.begin()+elite);
+	}
+
+      // the reduce steps. First the parents
+      unsigned reducedParentSize = howManyReducedParents(_parents.size());
+      if (!reducedParentSize)
+	_parents.clear();
+      else if (reducedParentSize != _parents.size())
+	reduceParents(_parents, reducedParentSize);
+
+      // then the offspring
+      unsigned reducedOffspringSize = howManyReducedOffspring(offSize);
+      if (!reducedOffspringSize)
+	throw std::runtime_error("No offspring left after reduction!");
+      if (reducedOffspringSize != offSize) // need reduction
+	reduceOffspring(_offspring, reducedOffspringSize);
+
+      // now merge reduced populations
+      _parents.resize(reducedParentSize + _offspring.size());
+      std::copy(_offspring.begin(), _offspring.end(), 
+		_parents.begin()+reducedParentSize); 
+
+      // reduce the resulting population
+      // size depstd::ends on elitism
+      if (elite && strongElitism)
+	{
+	  if (_parents.size() != finalPopSize-elite)
+	    reduceFinal(_parents, finalPopSize-elite);
+	  // and put back the elite
+	  unsigned oldPSize = _parents.size();
+	  _parents.resize(_parents.size()+elite);
+	  std::copy(temp.begin(), temp.end(), _parents.begin()+oldPSize);
+	}
+      else	
+	{                   // only reduce final pop to right size
+	  if (_parents.size() != finalPopSize)
+	    reduceFinal(_parents, finalPopSize);
+	  if (elite)	   // then treat weak elitism
+	    {
+	      unsigned toSave = 0;
+	      _parents.sort();
+	      EOT & eoLimit = _parents[elite-1];
+	      unsigned index=0;
+	      while ( (temp[index++] > eoLimit) && (index < temp.size()) )
+		toSave++;
+	      if (toSave)
+		for (unsigned i=0; i weak estd::listism
+  eoHowMany howManyReducedParents; // if 0, no parent in final replacement
+  eoHowMany howManyReducedOffspring; // if 0, std::runtime_error
+  // the reducers
+  eoReduce & reduceParents;
+  eoReduce & reduceOffspring;
+  eoReduce & reduceFinal;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoReduceSplit.h b/trunk/paradiseo-eo/src/eoReduceSplit.h
new file mode 100644
index 000000000..62a6f142f
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoReduceSplit.h
@@ -0,0 +1,323 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoReduceSplit.h
+//   Base class for population-reducing classes - retaining the poor losers
+// (c) GeNeura Team, 1998, Marc Schoenauer, 2002
+/* 
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+   Contact: Marc.Schoenauer@inria.fr
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoReduceSplit_h
+#define eoReduceSplit_h
+
+//-----------------------------------------------------------------------------
+
+#include 
+
+// EO includes
+#include      // eoPop
+#include   // eoReduce
+#include 
+
+/**
+ * eoReduceSplit: reduce the pop to the specified size
+ *                  AND eventually returns the eliminated guys
+*/
+template class eoReduceSplit: public eoBF&, eoPop &, void >
+{};
+
+/** deterministic truncation method using sort */
+template  
+class eoTruncateSplit : public eoReduceSplit
+{
+public:
+  /** Ctor: must provide amount of reduction, 
+      and whether or not you need to return the eliminated guys
+  */
+  eoTruncateSplit(eoHowMany _howMany, bool _returnEliminated = false):
+    howMany(_howMany), returnEliminated(_returnEliminated) {}
+    
+  /** do the jonb */
+  void operator()(eoPop& _newgen, eoPop & _eliminated)
+  {
+    unsigned popSize = _newgen.size();
+    unsigned eliminated = howMany(popSize);
+    if (!eliminated)   // nothing to do
+      return ;
+    unsigned newsize = popSize - eliminated;
+    if (newsize < 0)
+      throw std::logic_error("eoTruncateSplit: Cannot truncate to a larger size!\n");
+    
+    _newgen.nth_element(newsize);
+
+    // save poor losers if necessary
+    if (returnEliminated)
+      for (unsigned i=0; i 
+class eoLinearTruncateSplit : public eoReduceSplit
+{
+public:
+  /** Ctor: must provide amount of reduction, 
+      and whether or not you need to return the eliminated guys
+  */
+  eoLinearTruncateSplit(eoHowMany _howMany, bool _returnEliminated = false):
+    howMany(_howMany), returnEliminated(_returnEliminated) {}
+    
+  /** do the job */
+  void operator()(eoPop& _newgen, eoPop & _eliminated)
+  {
+    unsigned popSize = _newgen.size();
+    unsigned eliminated = howMany(popSize);
+    if (!eliminated)   // nothing to do
+      return ;
+    unsigned newsize = popSize - eliminated;
+    if (newsize < 0)
+      throw std::logic_error("eoLinearTruncateSplit: Cannot truncate to a larger size!\n");
+
+    _eliminated.reserve(_eliminated.size()+eliminated); //in case not empty?
+    for (unsigned i=0; i::iterator it = _newgen.it_worse_element();
+	if (returnEliminated)
+	  _eliminated.push_back(*it);
+	_newgen.erase(it);	    
+      }
+  }
+
+private:
+  eoHowMany howMany;
+  bool returnEliminated;
+};
+
+/** random truncation - batch version */
+template  
+class eoRandomSplit : public eoReduceSplit
+{
+public:
+  /** Ctor: must provide amount of reduction, 
+      and whether or not you need to return the eliminated guys
+  */
+  eoRandomSplit(eoHowMany _howMany, bool _returnEliminated = false):
+    howMany(_howMany), returnEliminated(_returnEliminated) {}
+    
+  /** do the job */
+  void operator()(eoPop& _newgen, eoPop & _eliminated)
+  {
+    unsigned popSize = _newgen.size();
+    unsigned eliminated = howMany(popSize);
+    if (!eliminated)   // nothing to do
+      return ;
+    unsigned newsize = popSize - eliminated;
+    if (newsize < 0)
+      throw std::logic_error("eoRandomSplit: Cannot truncate to a larger size!\n");
+
+    _newgen.shuffle();
+
+    // save poor losers if necessary
+    if (returnEliminated)
+      for (unsigned i=0; i 
+class eoLinearRandomSplit : public eoReduceSplit
+{
+public:
+  /** Ctor: must provide amount of reduction, 
+      and whether or not you need to return the eliminated guys
+  */
+  eoLinearRandomSplit(eoHowMany _howMany, bool _returnEliminated = false):
+    howMany(_howMany), returnEliminated(_returnEliminated) {}
+    
+  /** do the job */
+  void operator()(eoPop& _newgen, eoPop & _eliminated)
+  {
+    unsigned popSize = _newgen.size();
+    unsigned eliminated = howMany(popSize);
+    if (!eliminated)   // nothing to do
+      return ;
+    unsigned newsize = popSize - eliminated;
+    if (newsize < 0)
+      throw std::logic_error("eoLinearRandomSplit: Cannot truncate to a larger size!\n");
+
+    _eliminated.reserve(_eliminated.size()+eliminated); //in case not empty?
+    for (unsigned i=0; i::iterator it = _newgen.begin()+loser;
+	if (returnEliminated)
+	  _eliminated.push_back(*it);
+	_newgen.erase(it);	    
+      }
+    return ;
+  }
+
+private:
+  eoHowMany howMany;
+  bool returnEliminated;
+};
+
+
+/** a ReduceSplit class based on a repeated deterministic (reverse!) tournament
+To be used in SSGA-like replacements (e.g. see eoSSGADetTournamentReplacement)
+*/
+template  
+class eoDetTournamentTruncateSplit : public eoReduceSplit
+{
+public:
+  /** Ctor: must provide amount of reduction, 
+      and whether or not you need to return the eliminated guys
+  */
+  eoDetTournamentTruncateSplit(unsigned _t_size, eoHowMany _howMany, 
+		      bool _returnEliminated = false):
+    t_size(_t_size), howMany(_howMany), 
+    returnEliminated(_returnEliminated) 
+  {
+    if (t_size < 2)
+      { 
+	std::cout << "Warning, Size for eoDetTournamentTruncateSplit adjusted to 2\n";
+	t_size = 2;
+      }
+  }
+
+  /** Performs repeated inverse_deterministic_tournament on the pop */
+  void operator()(eoPop& _newgen, eoPop & _eliminated)
+  // BUG???  void operator()(eoPop& _newgen, unsigned _newsize)
+  {
+    unsigned popSize = _newgen.size();
+    unsigned eliminated = howMany(popSize);
+    if (!eliminated)   // nothing to do
+      return ;
+    unsigned newsize = popSize - eliminated;
+    if (newsize < 0)
+      throw std::logic_error("eoDetTournamentTruncateSplit: Cannot truncate to a larger size!\n");
+
+
+    _eliminated.reserve(_eliminated.size()+eliminated); //in case not empty?
+    for (unsigned i=0; i::iterator it = inverse_deterministic_tournament(_newgen.begin(), _newgen.end(), t_size);
+	if (returnEliminated)
+	  _eliminated.push_back(*it);
+	_newgen.erase(it);
+      }
+  }
+
+private:
+  unsigned t_size;
+  eoHowMany howMany;
+  bool returnEliminated;
+};
+
+/** a ReduceSplit class based on a repeated deterministic (reverse!) tournament
+To be used in SSGA-like replacements (e.g. see eoSSGAStochTournamentReplacement)
+*/
+template  
+class eoStochTournamentTruncateSplit : public eoReduce
+{
+public:
+  /** Ctor: must provide amount of reduction, 
+      and whether or not you need to return the eliminated guys
+  */
+  eoStochTournamentTruncateSplit(double _t_rate, eoHowMany _howMany, 
+		      bool _returnEliminated = false):
+    t_rate(_t_rate), howMany(_howMany), 
+    returnEliminated(_returnEliminated) 
+  {
+    if (t_rate <= 0.5)
+      { 
+	std::cout << "Warning, Rate for eoStochTournamentTruncateSplit adjusted to 0.51\n";
+	t_rate = 0.51;
+      }
+    if (t_rate > 1)
+      {
+	std::cout << "Warning, Rate for eoStochTournamentTruncateSplit adjusted to 1\n";
+	t_rate = 1;
+      }
+  }
+
+  /** Performs repeated inverse_stochastic_tournament on the pop */
+  void operator()(eoPop& _newgen, eoPop & _eliminated)
+  //BUG???  void operator()(eoPop& _newgen, unsigned _newsize)
+  {
+    /* old version
+    if (!_eliminated.size())	   // nothing to do
+      return;
+    unsigned oldSize = _newgen.size();
+    unsigned newSize = oldSize - _eliminated.size();
+    unsigned eliminated = howMany(popSize);
+    if (newSize < 0)
+      throw std::logic_error("eoStochTournamentTruncateSplit: Cannot truncate to a larger size!\n");
+
+end of old version    */
+
+    unsigned popSize = _newgen.size();
+    unsigned eliminated = howMany(popSize);
+    if (!eliminated)   // nothing to do
+      return ;
+    unsigned newsize = popSize - eliminated;
+    if (newsize < 0)
+      throw std::logic_error("eoDetTournamentTruncateSplit: Cannot truncate to a larger size!\n");
+
+
+
+    _eliminated.reserve(_eliminated.size()+eliminated); //in case not empty?
+    for (unsigned i=0; i<_eliminated.size(); i++)
+      {
+	typename eoPop::iterator it = inverse_stochastic_tournament(_newgen.begin(), _newgen.end(), t_rate);
+	if (returnEliminated)
+	  _eliminated.push_back(*it);
+	_newgen.erase(it);
+      }
+  }
+
+
+private:
+  double t_rate;
+  eoHowMany howMany;
+  bool returnEliminated;
+};
+
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoReplacement.h b/trunk/paradiseo-eo/src/eoReplacement.h
new file mode 100644
index 000000000..364553729
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoReplacement.h
@@ -0,0 +1,128 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eoReplacement.h 
+   (c) Maarten Keijzer, Marc Schoenauer, GeNeura Team, 2000
+ 
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoReplacement_h
+#define _eoReplacement_h
+
+
+//-----------------------------------------------------------------------------
+#include 
+#include 
+#include 
+#include 
+#include 
+//-----------------------------------------------------------------------------
+
+/** 
+eoReplacement: the base class for all replacement functors.
+
+NOTE: 2 eoPop as arguments
+the resulting population should be in the first argument (replace
+parents by offspring)! The second argument can contain any rubbish 
+
+---
+The eoMergeReduce, combination of eoMerge and eoReduce, can be found 
+in file eoMergeReduce.h
+
+The eoReduceMergeReduce that reduces the parents and the offspring,
+merges the 2 reduced populations, and eventually reduces that final
+population, can be found in eoReduceMergeReduce.h
+
+LOG
+---
+Removed the const before first argument: though it makes too many classes 
+with the same interface, it allows to minimize the number of actual copies 
+by choosing the right destination
+I also removed the enforced "swap" in the eoEasyAlgo and hence the generational
+replacement gets a class of its own that only does the swap (instead of the 
+eoNoReplacement that did nothing, relying on the algo to swap popualtions).
+MS 12/12/2000
+
+  @see eoMerge, eoReduce, eoMergeReduce, eoReduceMerge 
+
+@classes eoReplacement,                    base (pure abstract) class
+         eoGenerationalReplacement,        as it says ...
+	 eoWeakElitistReplacement          a wrapper to add elitism
+
+*/
+
+
+//@{
+
+///
+template
+class eoReplacement : public eoBF&, eoPop&, void>
+{};
+
+/**
+generational replacement == swap populations
+*/
+template 
+class eoGenerationalReplacement : public eoReplacement
+{
+    public :
+  /// swap
+  void operator()(eoPop& _parents, eoPop& _offspring)
+  {
+    _parents.swap(_offspring);
+  }
+};
+
+/** 
+eoWeakElitistReplacement: a wrapper for other replacement procedures. 
+Copies in the new pop the best individual from the old pop, 
+AFTER normal replacement, if the best of the new pop is worse than the best 
+of the old pop. Removes the worse individual from the new pop.
+This could be changed by adding a selector there...
+*/
+template 
+class eoWeakElitistReplacement : public eoReplacement
+{
+public :
+  typedef typename EOT::Fitness Fitness;
+
+  // Ctor, takes an eoReplacement
+  eoWeakElitistReplacement(eoReplacement & _replace) :
+    replace(_replace) {}
+
+  /// do replacement
+  void operator()(eoPop& _pop, eoPop& _offspring)
+  {
+    const EOT & oldChamp = _pop.best_element();
+    replace(_pop, _offspring);	   // "normal" replacement, parents are the new
+    if (_pop.best_element() < oldChamp) // need to do something
+      {
+	typename eoPop::iterator itPoorGuy = _pop.it_worse_element();
+	(*itPoorGuy) = oldChamp;
+      }
+  }
+private:
+  eoReplacement & replace;
+};
+
+//@}
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoSGA.h b/trunk/paradiseo-eo/src/eoSGA.h
new file mode 100644
index 000000000..d160a3653
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoSGA.h
@@ -0,0 +1,120 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoSGA.h
+// (c) GeNeura Team, 2000 - EEAAX 1999 - Maarten Keijzer 2000
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoSGA_h
+#define _eoSGA_h
+
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+
+/** The Simple Genetic Algorithm, following Holland and Goldberg
+ *
+ * Needs a selector (class eoSelectOne) a crossover (eoQuad, i.e. a
+ * 2->2 operator) and a mutation with their respective rates, of
+ * course an evaluation function (eoEvalFunc) and a continuator
+ * (eoContinue) which gives the stopping criterion. Performs full
+ * generational replacement.
+ */
+
+template 
+class eoSGA : public eoAlgo
+{
+public :
+
+  // added this second ctor as I didn't like the ordering of the parameters
+  // in the one above. Any objection :-) MS
+  eoSGA(
+        eoSelectOne& _select,
+        eoQuadOp& _cross, float _crate,
+        eoMonOp& _mutate, float _mrate,
+        eoEvalFunc& _eval,
+	eoContinue& _cont)
+    : cont(_cont),
+          mutate(_mutate),
+          mutationRate(_mrate),
+          cross(_cross),
+          crossoverRate(_crate),
+          select(_select),
+          eval(_eval) {}
+
+  void operator()(eoPop& _pop)
+  {
+    eoPop offspring;
+
+    do
+      {
+	select(_pop, offspring);
+
+	unsigned i;
+
+	for (i=0; i<_pop.size()/2; i++)
+	  {
+	    if ( rng.flip(crossoverRate) )
+	    {
+		    // this crossover generates 2 offspring from two parents
+		    if (cross(offspring[2*i], offspring[2*i+1]))
+        {
+          offspring[2*i].invalidate();
+          offspring[2*i+1].invalidate();
+        }
+      }
+	  }
+
+	for (i=0; i < _pop.size(); i++)
+	  {
+	    if (rng.flip(mutationRate) )
+	    {
+		     if (mutate(offspring[i]))
+          offspring[i].invalidate();
+	    }
+	  }
+
+	_pop.swap(offspring);
+	apply(eval, _pop);
+
+      } while (cont(_pop));
+  }
+
+private :
+
+  eoContinue& cont;
+  /// eoInvalidateMonOp invalidates the embedded operator
+  eoInvalidateMonOp mutate;
+  float mutationRate;
+  // eoInvalidateQuadOp invalidates the embedded operator
+  eoInvalidateQuadOp cross;
+  float crossoverRate;
+  eoSelectPerc select;
+  eoEvalFunc& eval;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoSGAGenOp.h b/trunk/paradiseo-eo/src/eoSGAGenOp.h
new file mode 100644
index 000000000..a6533f072
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoSGAGenOp.h
@@ -0,0 +1,91 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoSGAGenOp.h
+// (c) Marc.Schoenauer 2002
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@inria.fr
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoSGAGenOp_h
+#define _eoSGAGenOp_h
+
+#include "eoGenOp.h"
+#include "eoInvalidateOps.h"
+///////////////////////////////////////////////////////////////////////////////
+// class eoSGAGenOp
+///////////////////////////////////////////////////////////////////////////////
+
+/** ***************************************************************************
+ * eoSGAGenOp (for Simple GA) mimicks the usual crossover with proba pCross + 
+ * mutation with proba pMut inside an eoGeneralOp
+ * It does it exactly as class eoSGATransform, i.e. only accepts 
+ *    quadratic crossover and unary mutation
+ * It was introduced for didactic reasons, but seems to be popular :-)
+ *****************************************************************************/
+template 
+class eoSGAGenOp : public eoGenOp
+{
+ public:
+    
+  /** Ctor from crossover (with proba) and mutation (with proba)
+   * Builds the sequential op that first applies a proportional choice
+   * between the crossover and nothing (cloning), then the mutation
+   */
+  eoSGAGenOp(eoQuadOp& _cross, double _pCross, 
+		 eoMonOp& _mut, double _pMut)
+    : cross(_cross),
+      pCross(_pCross),
+      mut(_mut), 
+      pMut(_pMut) 
+  {
+    // the crossover - with probability pCross
+    propOp.add(cross, pCross); // crossover, with proba pcross
+    propOp.add(quadClone, 1-pCross); // nothing, with proba 1-pcross
+    
+    // now the sequential
+    op.add(propOp, 1.0);	 // always do combined crossover
+    op.add(mut, pMut);     // then mutation, with proba pmut
+  }
+  
+  /** do the job: delegate to op */
+  virtual void apply(eoPopulator& _pop)
+  {
+    op.apply(_pop);
+  }
+
+  /** inherited from eoGenOp */
+  virtual unsigned max_production(void) {return 2;}
+
+  virtual std::string className() const {return "eoSGAGenOp";}
+
+
+ private:
+  eoQuadOp ✗   // eoInvalidateXXX take the boolean output
+  double pCross;
+  eoMonOp & mut;      // of the XXX op and invalidate the EOT
+  double pMut;
+  eoProportionalOp propOp;
+  eoQuadCloneOp quadClone;
+  eoSequentialOp op;
+};
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoSGATransform.h b/trunk/paradiseo-eo/src/eoSGATransform.h
new file mode 100644
index 000000000..e1e9c82f5
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoSGATransform.h
@@ -0,0 +1,164 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoSGA.h
+// (c) Marc.Schoenauer 2000 - Maarten Keijzer 2000
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoSGATransform_h
+#define _eoSGATransform_h
+
+#include 
+#include 
+
+///////////////////////////////////////////////////////////////////////////////
+// class eoSGATransform
+///////////////////////////////////////////////////////////////////////////////
+#include           // std::vector
+#include 
+#include 
+
+/** eoSGATransform: transforms a population using genetic operators.
+ * It does it exactly as class eoSGA, i.e. only accepts 
+ *    quadratic crossover and unary mutation
+ * It is here mainly for tutorial reasons
+*/
+template class eoSGATransform : public eoTransform
+{
+ public:
+    
+  /// Default constructor.
+  eoSGATransform(eoQuadOp& _cross, double _cProba, 
+		 eoMonOp& _mutate, double _mProba)
+    : cross(_cross),
+      crossoverProba(_cProba),
+      mutate(_mutate), 
+      mutationProba(_mProba) {}
+
+
+  /**
+   * Transforms a population.
+   * @param pop The population to be transformed.
+   */
+  void operator()(eoPop& _pop) 
+  {
+    unsigned i;
+	        
+    for (i=0; i<_pop.size()/2; i++) 
+      {
+	if ( rng.flip(crossoverProba) ) 
+	  {
+	    // this crossover generates 2 offspring from two parents
+	    cross(_pop[2*i], _pop[2*i+1]);
+	  }
+      }
+
+    for (i=0; i < _pop.size(); i++) 
+      {
+	if (rng.flip(mutationProba) ) 
+	  {
+	    mutate(_pop[i]);
+	  }
+	          
+      }
+  };
+    
+ private:
+  eoInvalidateQuadOp cross;
+  double crossoverProba;
+  eoInvalidateMonOp mutate;
+  double mutationProba;
+};
+
+/** eoDynSGATransform: transforms a population using genetic operators.
+ * It is the Dynamic version of the above eoSGATransform
+ *    i.e. the operators probabilities can be passed as an eoValueParam, 
+ *    and hence can be modified from outside
+ * It is here mainly for tutorial reasons
+ *****************************************************************************/
+template class eoDynSGATransform : public eoTransform
+{
+ public:
+    
+  /// Default constructor - receives values
+  eoDynSGATransform(eoQuadOp& _cross, double _cProba, 
+		 eoMonOp& _mutate, double _mProba)
+    : cross(_cross),
+      crossoverProbaHolder(_cProba), crossoverProba(crossoverProbaHolder),
+      mutate(_mutate), 
+      mutationProbaHolder(_mProba), mutationProba(mutationProbaHolder) {}
+
+  /// This constructor receives pointers
+  //  these will usually be some eoValueParam.value()
+  //  hence the ...Holder data will bever be used in this case
+  eoDynSGATransform(eoQuadOp& _cross, double* _cProbaRef, 
+		 eoMonOp& _mutate, double* _mProbaRef)
+    : cross(_cross),
+      crossoverProbaHolder(0), crossoverProba(*_cProbaRef),
+      mutate(_mutate), 
+      mutationProbaHolder(0), mutationProba(*_mProbaRef) {}
+
+
+  /**
+   * Transforms a population.
+   * @param pop The population to be transformed.
+   */
+  void operator()(eoPop& _pop) 
+  {
+    unsigned i;
+	        
+    for (i=0; i<_pop.size()/2; i++) 
+      {
+	if ( rng.flip(crossoverProba) ) 
+	  {
+	    // this crossover generates 2 offspring from two parents
+	    cross(_pop[2*i], _pop[2*i+1]);
+	  }
+      }
+
+    for (i=0; i < _pop.size(); i++) 
+      {
+	if (rng.flip(mutationProba) ) 
+	  {
+	    mutate(_pop[i]);
+	  }
+	          
+      }
+  };
+  // accessors - mainly for EASEA
+  double & PCrossHandle() { return crossoverProba;}    
+  double & PMutHandle() { return mutationProba;}
+
+private:
+  // difference with eoSGATransform: the operator probabilities 
+  // they can be passed by reference or by value.
+  // hence we need here to use a reference, and to eventually store a value
+  eoInvalidateQuadOp cross;
+  double crossoverProbaHolder;	// the value, used only if ctor gets a value
+  double& crossoverProba;       // the reference, to be used in operator()
+  eoInvalidateMonOp mutate;
+  double mutationProbaHolder;	// the value, used only if ctor gets a value
+  double& mutationProba;        // the reference, to be used in operator()
+};
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoSTLFunctor.h b/trunk/paradiseo-eo/src/eoSTLFunctor.h
new file mode 100644
index 000000000..74c206036
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoSTLFunctor.h
@@ -0,0 +1,118 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoSTLFunctor.h
+// (c) Maarten Keijzer 2001
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoSTLFunctor_H
+#define _eoSTLFunctor_H
+
+#include "eoFunctor.h"
+
+/**
+  Generic set of classes that wrap an eoF, eoUF or eoBF so that they have the
+  copy semantics the STL functions usually require (i.e. they can be passed
+  by value, rather than the EO standard pass by reference).
+
+  The family consists of eoSTLF, eoSTLUF, eoSTLBF that modify eoF, eoUF and eoBF
+  respectively
+*/
+template 
+class eoSTLF
+{
+  public:
+
+    typedef R result_type;
+
+    eoSTLF(eoF& _f) : f(_f) {}
+
+    R operator()(void)
+    {
+      return f();
+    }
+
+  private :
+
+  eoF& f;
+};
+
+#ifdef _MSVC
+/// specialization of void for MSVC users, unfortunately only works for eoF,
+/// as MSVC does not support partial specialization either
+template <>
+void eoSTLF::operator()(void)
+{
+  f();
+}
+#endif
+
+/**
+  Generic set of classes that wrap an eoF, eoUF or eoBF so that they have the
+  copy semantics the STL functions usually require (i.e. they can be passed
+  by value, rather than the EO standard pass by reference).
+
+  The family consists of eoSTLF, eoSTLUF, eoSTLBF that modify eoF, eoUF and eoBF
+  respectively
+*/
+template 
+class eoSTLUF : public std::unary_function
+{
+  public:
+    eoSTLUF(eoUF& _f) : f(_f) {}
+
+    R operator()(A1 a)
+    {
+      return f(a);
+    }
+
+  private:
+    eoUF& f;
+};
+
+/**
+  Generic set of classes that wrap an eoF, eoUF or eoBF so that they have the
+  copy semantics the STL functions usually require (i.e. they can be passed
+  by value, rather than the EO standard pass by reference).
+
+  The family consists of eoSTLF, eoSTLUF, eoSTLBF that modify eoF, eoUF and eoBF
+  respectively
+*/
+template 
+class eoSTLBF : public std::binary_function
+{
+  public:
+    eoSTLBF(eoUF& _f) : f(_f) {}
+
+    R operator()(A1 a1, A2 a2)
+    {
+      return f(a1, a2);
+    }
+
+  private:
+
+    eoBF& f;
+};
+
+// TODO: put automated wrappers here...
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoScalarFitness.h b/trunk/paradiseo-eo/src/eoScalarFitness.h
new file mode 100644
index 000000000..8402e1e99
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoScalarFitness.h
@@ -0,0 +1,99 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+  -----------------------------------------------------------------------------
+  eoScalarFitness.h
+
+ (c) Maarten Keijzer (mkeijzer@mad.scientist.com) and GeNeura Team, 1999, 2000
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+
+
+#ifndef eoScalarFitness_h
+#define eoScalarFitness_h
+
+#include 
+#include 
+
+/**
+ * eoScalarFitness >:
+ * Wraps a scalar fitness values such as a double or int, with the option of
+ * maximizing (using less) or minimizing (using greater)
+
+ * It overrides operator<() to use the Compare template argument
+ *
+ * Suitable constructors and assignments and casts are defined to work
+ * with this quantity as if it were a ScalarType.
+*/
+template 
+class eoScalarFitness
+{
+    public :
+
+    eoScalarFitness() : value() {}
+    eoScalarFitness(const eoScalarFitness& other) : value(other.value) {}
+    eoScalarFitness(const ScalarType& v) : value(v) {}
+
+    eoScalarFitness& operator=(const eoScalarFitness& other)
+    { value = other.value; return *this; }
+    eoScalarFitness& operator=(const ScalarType& v)
+    { value = v; return *this; }
+
+    operator ScalarType(void) const { return value; }
+
+    /// Comparison, using less by default
+    bool operator<(const eoScalarFitness& other) const
+    { return Compare()(value, other.value); }
+
+    // implementation of the other operators
+    bool operator>( const eoScalarFitness& y ) const  { return y < *this; }
+    // implementation of the other operators
+    bool operator<=( const eoScalarFitness& y ) const { return !(*this > y); }
+    // implementation of the other operators
+    bool operator>=(const eoScalarFitness& y ) const { return !(*this < y); }
+
+
+    private :
+        ScalarType value;
+};
+
+/**
+Typedefs for fitness comparison, Maximizing Fitness compares with less,
+and minimizing fitness compares with greater. This because we want ordinary
+fitness values (doubles) to be equivalent with Maximizing Fitness, and
+comparing with less is the default behaviour.
+*/
+typedef eoScalarFitness >    eoMaximizingFitness;
+typedef eoScalarFitness > eoMinimizingFitness;
+
+template 
+std::ostream& operator<<(std::ostream& os, const eoScalarFitness& f)
+{
+    os << (F) f;
+    return os;
+}
+
+template 
+std::istream& operator>>(std::istream& is, eoScalarFitness& f)
+{
+    F value;
+    is >> value;
+    f = value;
+    return is;
+}
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoScalarFitnessAssembled.cpp b/trunk/paradiseo-eo/src/eoScalarFitnessAssembled.cpp
new file mode 100644
index 000000000..a30289abc
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoScalarFitnessAssembled.cpp
@@ -0,0 +1,41 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+ 
+//-----------------------------------------------------------------------------
+// eoScalarFitnessAssembled.cpp
+// Marc Wintermantel & Oliver Koenig
+// IMES-ST@ETHZ.CH
+// March 2003
+
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+ 
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+ 
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ 
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@inria.fr
+             mak@dhi.dk
+*/
+//-----------------------------------------------------------------------------
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+#include "eoScalarFitnessAssembled.h"
+
+
+// need to allocate the static variables of class eoScalarFitnessAssembledTraits
+std::vector eoScalarFitnessAssembledTraits::TermDescriptions;
+
+
+
diff --git a/trunk/paradiseo-eo/src/eoScalarFitnessAssembled.h b/trunk/paradiseo-eo/src/eoScalarFitnessAssembled.h
new file mode 100644
index 000000000..8eacf0b24
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoScalarFitnessAssembled.h
@@ -0,0 +1,270 @@
+ /* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- */
+
+//-----------------------------------------------------------------------------
+// eoScalarFitnessAssembled.h
+// Marc Wintermantel & Oliver Koenig
+// IMES-ST@ETHZ.CH
+// March 2003
+
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@inria.fr
+             mak@dhi.dk
+*/
+//-----------------------------------------------------------------------------
+
+#ifndef eoScalarFitnessAssembled_h
+#define eoScalarFitnessAssembled_h
+
+#include 
+#include 
+#include 
+#include 
+#include 
+
+//! Defines properties of eoScalarFitnessAssembled.
+/*! Properties that are hold in this traits class:
+    - std::vector to hold descriptions of the different fitness terms
+*/
+class eoScalarFitnessAssembledTraits{
+
+public:
+
+  typedef std::vector::size_type size_type;
+
+  static void setDescription( size_type _idx, std::string _descr ) {
+    if ( _idx < TermDescriptions.size() )
+      TermDescriptions[_idx] = _descr;
+    else{
+      TermDescriptions.resize(_idx, "Unnamed variable" );
+      TermDescriptions[_idx] = _descr;
+    }
+  }
+
+  static std::string getDescription( size_type _idx) {
+    if ( _idx < TermDescriptions.size() )
+      return TermDescriptions[_idx ];
+    else
+      return "Unnamed Variable";
+  }
+
+  static void resize( size_type _n, const std::string& _descr) {
+    TermDescriptions.resize(_n, _descr);
+  }
+
+  static size_type size() { return TermDescriptions.size(); }
+
+  static std::vector getDescriptionVector() { return TermDescriptions; }
+
+private:
+  static std::vector TermDescriptions;
+};
+
+//! Implements fitness as std::vector, storing all values that might occur during fitness assembly
+/*! Properties:
+    - Wraps a scalar fitness values such as a double or int, with the option of
+      maximizing (using less) or minimizing (using greater).
+    - Stores all kinda different values met during fitness assembly, to be defined in eoEvalFunc.
+    - It overrides operator<() to use the Compare template argument.
+    - Suitable constructors and assignments and casts are defined to work
+      with this quantity as if it were a ScalarType.
+    - Global fitness value is stored as first element in the vector
+*/
+template 
+class eoScalarFitnessAssembled : public std::vector {
+
+public:
+
+    using std::vector< ScalarType >::empty;
+    using std::vector< ScalarType >::front;
+    using std::vector< ScalarType >::size;
+
+
+  typedef typename std::vector baseVector;
+  typedef typename baseVector::size_type size_type;
+
+  // Basic constructors and assignments
+  eoScalarFitnessAssembled()
+    : baseVector( FitnessTraits::size() ),
+      feasible(true), failed(false), msg("")
+  {}
+
+  eoScalarFitnessAssembled( size_type _n,
+			    const ScalarType& _val,
+			    const std::string& _descr="Unnamed variable" )
+    : baseVector(_n, _val),
+      feasible(true), failed(false), msg("")
+  {
+    if ( _n > FitnessTraits::size() )
+    FitnessTraits::resize(_n, _descr);
+  }
+
+  eoScalarFitnessAssembled( const eoScalarFitnessAssembled& other)
+    : baseVector( other ),
+      feasible(other.feasible),
+      failed(other.failed),
+      msg(other.msg)
+  {}
+
+  eoScalarFitnessAssembled& operator=( const eoScalarFitnessAssembled& other) {
+    baseVector::operator=( other );
+    feasible = other.feasible;
+    failed = other.failed;
+    msg = other.msg;
+    return *this;
+  }
+
+  // Constructors and assignments to work with scalar type
+  eoScalarFitnessAssembled( const ScalarType& v )
+    : baseVector( 1, v ),
+      feasible(true), failed(false), msg("")
+  {}
+
+  eoScalarFitnessAssembled& operator=( const ScalarType& v ) {
+
+      if( empty() )
+          push_back( v );
+      else
+          front() = v;
+      return *this;
+  }
+
+  //! Overload push_back()
+  void push_back(const ScalarType& _val ){
+    baseVector::push_back( _val );
+    if ( size() > FitnessTraits::size() )
+      FitnessTraits::setDescription( size()-1, "Unnamed variable");
+  }
+
+  //! Overload push_back()
+  void push_back(const ScalarType& _val, const std::string& _descr ){
+    baseVector::push_back( _val );
+    FitnessTraits::setDescription( size()-1, _descr );
+  }
+
+  //! Overload resize()
+  void resize( size_type _n, const ScalarType& _val = ScalarType(), const std::string& _descr = "Unnamed variable" ){
+    baseVector::resize(_n, _val);
+    FitnessTraits::resize(_n, _descr);
+  }
+
+  //! Set description
+  void setDescription( size_type _idx, std::string _descr ) {
+    FitnessTraits::setDescription( _idx, _descr );
+  }
+
+  //! Get description
+  std::string getDescription( size_type _idx ){ return FitnessTraits::getDescription( _idx ); }
+
+  //! Get vector with descriptions
+  std::vector getDescriptionVector() { return FitnessTraits::getDescriptionVector(); }
+
+  //! Feasibility boolean
+  /**
+   * Can be specified anywhere in fitness evaluation
+   * as an indicator if the individual is in some feasible range.
+   */
+  bool feasible;
+
+  //! Failed boolean
+  /**
+   * Can be specified anywhere in fitness evaluation
+   * as an indicator if the evaluation of the individual failed
+   */
+  bool failed;
+
+  //! Message
+  /**
+   * Can be specified anywhere in fitness evaluation.
+   * Typically used to store some sort of error messages, if evaluation of individual failed.
+   */
+  std::string msg;
+
+
+  // Scalar type access
+  operator ScalarType(void) const {
+    if ( empty() )
+      return 0.0;
+    else
+      return front();
+  }
+
+  //! Print term values and descriptions
+  void printAll(std::ostream& os) const {
+    for (size_type i=0; i < size(); ++i )
+      os << FitnessTraits::getDescription(i) << " = " << operator[](i) << " ";
+  }
+
+  // Comparison, using less by default
+  bool operator<(const eoScalarFitnessAssembled& other) const{
+    if ( empty() || other.empty() )
+      return false;
+    else
+      return Compare()( front() , other.front() );
+  }
+
+  // implementation of the other operators
+  bool operator>( const eoScalarFitnessAssembled& y ) const  { return y < *this; }
+
+  // implementation of the other operators
+  bool operator<=( const eoScalarFitnessAssembled& y ) const { return !(*this > y); }
+
+  // implementation of the other operators
+  bool operator>=(const eoScalarFitnessAssembled& y ) const { return !(*this < y); }
+
+};
+
+/**
+Typedefs for fitness comparison, Maximizing Fitness compares with less,
+and minimizing fitness compares with greater. This because we want ordinary
+fitness values (doubles) to be equivalent with Maximizing Fitness, and
+comparing with less is the default behaviour.
+*/
+typedef eoScalarFitnessAssembled, eoScalarFitnessAssembledTraits >    eoAssembledMaximizingFitness;
+typedef eoScalarFitnessAssembled, eoScalarFitnessAssembledTraits > eoAssembledMinimizingFitness;
+
+template 
+std::ostream& operator<<(std::ostream& os, const eoScalarFitnessAssembled& f)
+{
+  for (unsigned i=0; i < f.size(); ++i)
+    os << f[i] << " ";
+
+  os << f.feasible << " ";
+  os << f.failed << " ";
+
+  return os;
+}
+
+template 
+std::istream& operator>>(std::istream& is, eoScalarFitnessAssembled& f)
+{
+  for (unsigned i=0; i < f.size(); ++i){
+    F value;
+    is >> value;
+    f[i] = value;
+  }
+
+  is >> f.feasible;
+  is >> f.failed;
+
+  return is;
+}
+
+#endif
+
+
+
diff --git a/trunk/paradiseo-eo/src/eoSelect.h b/trunk/paradiseo-eo/src/eoSelect.h
new file mode 100644
index 000000000..90bfd7dc9
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoSelect.h
@@ -0,0 +1,43 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eoSelect.h 
+   (c) Maarten Keijzer, GeNeura Team, 2000
+ 
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+   Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoSelect_h
+#define _eoSelect_h
+
+
+//-----------------------------------------------------------------------------
+#include 
+//-----------------------------------------------------------------------------
+
+/** 
+eoSelect selects a number of individuals from the first argument and
+puts it in the second. To emphasize that it should not try to enlarge
+the population, the second argument is an eoPopRange, a simple struct
+that holds a begin and end iterator to the population
+*/
+template
+class eoSelect : public eoBF&, eoPop&, void>
+{};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoSelectFactory.h b/trunk/paradiseo-eo/src/eoSelectFactory.h
new file mode 100644
index 000000000..d94a0fa0f
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoSelectFactory.h
@@ -0,0 +1,89 @@
+// eoSelectFactory.h
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// EOFactory.h
+// (c) GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _EOSELECTFACTORY_H
+#define _EOSELECTFACTORY_H
+
+#include 
+#include 
+#include 
+
+//-----------------------------------------------------------------------------
+
+/** EO Factory.An instance of the factory class to create selectors, that is,
+eoSelect objects
+@see eoSelect*/
+template< class EOT>
+class eoSelectFactory: public eoFactory > {
+	
+public:
+	
+	/// @name ctors and dtors
+	//{@
+	/// constructor
+	eoSelectFactory( ) {}
+	
+	/// destructor
+	virtual ~eoSelectFactory() {}
+	//@}
+
+	/** Another factory methods: creates an object from an std::istream, reading from
+	it whatever is needed to create the object. Usually, the format for the std::istream will be\\
+	objectType parameter1 parameter2 ... parametern\\
+	*/
+	virtual eoSelect* make(std::istream& _is) {
+		eoSelect * selectPtr;
+		std::string objectTypeStr;
+		_is >> objectTypeStr;
+		// All selectors have a rate, the proportion of the original population
+		float rate;
+		_is >> rate;
+		if  ( objectTypeStr == "eoTournament") {
+			// another parameter is necessary
+			unsigned tSize;
+			_is >> tSize;
+			selectPtr = new eoTournament( rate, tSize );
+		} else 	{
+			if ( objectTypeStr == "eoRandomSelect" ) {
+				selectPtr = new eoRandomSelect( rate );
+			} else {
+						throw std::runtime_error( "Incorrect selector type" );
+			}
+		}
+		return selectPtr;
+	}
+
+	///@name eoObject methods
+	//@{
+	void printOn( std::ostream& _os ) const {};
+	void readFrom( std::istream& _is ){};
+
+	/** className is inherited */
+	//@}
+	
+};
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoSelectFromWorth.h b/trunk/paradiseo-eo/src/eoSelectFromWorth.h
new file mode 100644
index 000000000..4577b822a
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoSelectFromWorth.h
@@ -0,0 +1,224 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eoSelectFromWorth.h
+   (c) Maarten Keijzer, Marc Schoenauer, 2001
+
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoSelectFromWorth_h
+#define _eoSelectFromWorth_h
+
+#include 
+//-----------------------------------------------------------------------------
+#include 
+#include 
+#include 
+//-----------------------------------------------------------------------------
+
+/** selects one element from a population (is an eoSelectOne)
+but the selection is based on a std::vector of Worth that is different
+from the fitnesses (e.g. EO fitness is what Koza terms "raw fitness",
+Worth is what the selection is based upon).
+
+see class eoPerf2Worth: an eoStat that transforms fitnesses into Worthes
+
+Note: Worthes will not always be doubles - see some multi-objective
+techniques where it is a std::pair of doubles ...
+
+It has to have a < operator it you want to call an existing
+selector (see selector.h) - but of course you can write the whole
+thing ...
+*/
+template 
+class eoSelectFromWorth : public eoSelectOne
+{
+public:
+
+    /* Default ctor from an eoPerf2Worth object */
+    eoSelectFromWorth(eoPerf2Worth& _perf2Worth)
+        : perf2Worth(_perf2Worth)
+        {}
+
+    /* setup the worthes */
+    virtual void setup(const eoPop& pop) {
+        perf2Worth(pop);
+#ifndef NDEBUG
+        fitness.resize(pop.size());
+        for (unsigned i = 0; i < pop.size(); ++i) {
+            fitness[i] = pop[i].fitness();
+        }
+#endif
+    }
+
+
+protected:
+
+    eoPerf2Worth& perf2Worth;
+
+#ifndef NDEBUG
+    std::vector fitness;
+    void check_sync(unsigned index, const EOT& _eo) {
+        if (fitness[index] != _eo.fitness()) {
+            throw std::runtime_error("eoSelectFromWorth: fitnesses are not in sync");
+        }
+    }
+#endif
+};
+
+
+/** An instance of eoSelectPerf2Worth that does selection from the Worthes
+ *  using a ... determinisitic tournament, yes!
+ */
+template 
+class eoDetTournamentWorthSelect : public eoSelectFromWorth
+{
+public:
+
+    using eoSelectFromWorth::perf2Worth;
+
+    typedef typename std::vector::iterator worthIterator;
+
+    /* Default ctor from an eoPerf2Worth object +  tournament size */
+    eoDetTournamentWorthSelect(eoPerf2Worth& perf2Worth,
+                               unsigned _tSize)
+        : eoSelectFromWorth(perf2Worth), tSize(_tSize) {}
+
+    /* Perform deterministic tournament on worthes by calling the
+       appropriate fn see selectors.h */
+    virtual const EOT& operator()(const eoPop& pop) {
+        worthIterator it = deterministic_tournament(perf2Worth.value().begin(),
+                                                    perf2Worth.value().end(),
+                                                    tSize);
+        unsigned index = it - perf2Worth.value().begin();
+#ifndef NDEBUG
+        // check whether the stuff is still in sync
+        check_sync(index, pop[index]);
+#endif
+        return pop[index];
+    }
+
+
+private:
+
+    unsigned tSize;
+};
+
+/** An instance of eoSelectPerf2Worth that does selection from the Worthes
+ *  using a ... stochastic tournament, yes!
+ */
+template 
+class eoStochTournamentWorthSelect : public eoSelectFromWorth
+{
+public:
+
+    using eoSelectFromWorth::perf2Worth;
+
+    typedef typename std::vector::iterator worthIterator;
+
+    /* Default ctor from an eoPerf2Worth object +  tournament rate */
+    eoStochTournamentWorthSelect(eoPerf2Worth &_perf2Worth, double _tRate)
+        : eoSelectFromWorth(_perf2Worth), tRate(_tRate)
+        {}
+
+  /* Perform stochastic tournament on worthes
+     by calling the appropriate fn in selectors.h
+  */
+  virtual const EOT& operator()(const eoPop& _pop) {
+      worthIterator it = stochastic_tournament(perf2Worth.value().begin(),
+                                               perf2Worth.value().end(),
+                                               tRate);
+
+    unsigned index = it - perf2Worth.value().begin();
+
+#ifndef NDEBUG
+  // check whether the stuff is still in sync
+  check_sync(index, _pop[index]);
+#endif
+
+    return _pop[index];
+  }
+
+private:
+  double tRate;
+};
+
+/** An instance of eoSelectPerf2Worth that does selection from the Worthes
+ *  using a ... roulette wheel selection, yes!
+ */
+template 
+class eoRouletteWorthSelect : public eoSelectFromWorth
+{
+public:
+
+    using eoSelectFromWorth::perf2Worth;
+
+    typedef typename std::vector::iterator worthIterator;
+
+
+    /* Default ctor from an eoPerf2Worth object */
+    eoRouletteWorthSelect(eoPerf2Worth &_perf2Worth)
+        : eoSelectFromWorth(_perf2Worth)
+        {}
+
+  /* We have to override the default behavior to compute the total
+   * only once!
+   */
+  virtual void setup(const eoPop& _pop)
+  {
+    eoSelectFromWorth::setup(_pop);
+    total = 0.0;
+    for (worthIterator it = perf2Worth.value().begin();
+	 it& _pop) {
+ //     cout << "On affiche les worths\n";
+ //     for (unsigned i=0;
+ // 	 i
+#include 
+#include 
+#include 
+//-----------------------------------------------------------------------------
+
+/** eoSelectMany selects many individuals using eoSelectOne as it's 
+    mechanism. Therefore eoSelectMany needs an eoSelectOne in its ctor
+
+    It will use an eoHowMnay to determine the number of guys to select,
+     and push them to the back of the destination population.
+*/
+template
+class eoSelectMany : public eoSelect
+{
+ public:
+     /// init
+     eoSelectMany(eoSelectOne& _select, 
+		    double  _rate, bool _interpret_as_rate = true) 
+         : select(_select), howMany(_rate, _interpret_as_rate) {}
+
+     // Ctor with eoHowMany
+     eoSelectMany(eoSelectOne& _select, eoHowMany _howMany) 
+         : select(_select), howMany(_howMany) {}
+
+     /**
+     The implementation repeatidly selects an individual
+
+     @param _source the source population
+     @param _dest  the resulting population (size of this population is the number of times eoSelectOne is called. It empties the destination and adds the selection into it)
+     */
+  virtual void operator()(const eoPop& _source, eoPop& _dest)
+  {
+    unsigned target = howMany(_source.size());
+    
+    _dest.resize(target);
+    
+    select.setup(_source);
+    
+    for (size_t i = 0; i < _dest.size(); ++i)
+      _dest[i] = select(_source);
+  }
+  
+private :
+  eoSelectOne& select;
+  eoHowMany howMany;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoSelectNumber.h b/trunk/paradiseo-eo/src/eoSelectNumber.h
new file mode 100644
index 000000000..2b5d2a8cd
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoSelectNumber.h
@@ -0,0 +1,72 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eoSelectNumber.h 
+   (c) Maarten Keijzer, Marc Schoenauer, GeNeura Team, 2000
+ 
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+   Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoSelectNumber_h
+#define _eoSelectNumber_h
+
+
+//-----------------------------------------------------------------------------
+#include 
+#include 
+#include 
+//-----------------------------------------------------------------------------
+
+/** eoSelectNumber selects many individuals using eoSelectOne as it's 
+    mechanism. Therefore eoSelectNumber needs an eoSelectOne in its ctor
+
+    It will select a fixed number of individuals and pushes them to
+    the back of the destination population.
+*/
+template
+class eoSelectNumber : public eoSelect
+{
+ public:
+     /// init
+     eoSelectNumber(eoSelectOne& _select, unsigned _nb_to_select = 1) 
+         : select(_select), nb_to_select(_nb_to_select) {}
+
+     /**
+     The implementation repeatidly selects an individual
+
+     @param _source the source population
+     @param _dest  the resulting population (size of this population is the number of times eoSelectOne is called. It empties the destination and adds the selection into it)
+     */
+  virtual void operator()(const eoPop& _source, eoPop& _dest)
+  {
+    size_t target = static_cast(nb_to_select);
+    
+    _dest.resize(target);
+    
+    select.setup(_source);
+    
+    for (size_t i = 0; i < _dest.size(); ++i)
+      _dest[i] = select(_source);
+  }
+  
+private :
+  eoSelectOne& select;
+  unsigned nb_to_select;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoSelectOne.h b/trunk/paradiseo-eo/src/eoSelectOne.h
new file mode 100644
index 000000000..34b0782f3
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoSelectOne.h
@@ -0,0 +1,54 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eoSelectOne.h 
+   (c) Maarten Keijzer, GeNeura Team, 2000
+ 
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+   Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoSelectOne_h
+#define _eoSelectOne_h
+
+
+//-----------------------------------------------------------------------------
+#include 
+#include 
+//-----------------------------------------------------------------------------
+
+/** eoSelectOne selects only one element from a whole population.
+    Most selection techniques are simply repeated applications
+    of eoSelectOne.
+
+      @see eoSelectMany, eoSelectRandom, eoDetTournament, eoStochTournament, eoProportional
+*/
+#ifdef _MSC_VER
+template
+#else
+template
+#endif
+class eoSelectOne : public eoUF&, const EOT&>
+{
+    public :
+      /// virtual function to setup some population stats (for instance eoProportional can benefit greatly from this)
+      virtual void setup(const eoPop& _pop)
+      {}
+};
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoSelectPerc.h b/trunk/paradiseo-eo/src/eoSelectPerc.h
new file mode 100644
index 000000000..c0991d72b
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoSelectPerc.h
@@ -0,0 +1,72 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eoSelectPerc.h 
+   (c) Maarten Keijzer, GeNeura Team, 2000
+ 
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+   Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoSelectPerc_h
+#define _eoSelectPerc_h
+
+
+//-----------------------------------------------------------------------------
+#include 
+#include 
+#include 
+//-----------------------------------------------------------------------------
+
+/** eoSelectPerc selects many individuals using eoSelectOne as it's 
+    mechanism. Therefore eoSelectPerc needs an eoSelectOne in its ctor
+
+    It will select floor(rate*pop.size()) individuals and pushes them to
+    the back of the destination population.
+*/
+template
+class eoSelectPerc : public eoSelect
+{
+ public:
+     /// init
+     eoSelectPerc(eoSelectOne& _select, float _rate = 1.0) 
+         : select(_select), rate(_rate) {}
+
+     /**
+     The implementation selects a percentage 
+
+     @param _source the source population
+     @param _dest  the resulting population (size of this population is the number of times eoSelectOne is called. It empties the destination and adds the selection into it)
+     */
+  virtual void operator()(const eoPop& _source, eoPop& _dest)
+  {
+    size_t target = static_cast(floor(rate * _source.size()));
+    
+    _dest.resize(target);
+    
+    select.setup(_source);
+    
+    for (size_t i = 0; i < _dest.size(); ++i)
+      _dest[i] = select(_source);
+  }
+  
+private :
+  eoSelectOne& select;
+  float rate;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoSequentialSelect.h b/trunk/paradiseo-eo/src/eoSequentialSelect.h
new file mode 100644
index 000000000..9cbfbc401
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoSequentialSelect.h
@@ -0,0 +1,144 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoSequential.h
+// (c) GeNeura Team, 1998 - Maarten Keijzer 2000, Marc Schoenauer, 2002
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoSequential_h
+#define eoSequential_h
+
+#include 
+
+#include "utils/eoData.h"
+#include "utils/eoRNG.h"
+#include "eoSelectOne.h"
+
+/** Contains the following classes:
+ *  - eoSequentialSelect, returns all individuals one by one,
+ *    either sorted or shuffled
+ *  - eoEliteSequentialSelect, returns all indivisuals one by one
+ *    starting with best, continuing shuffled (see G3 engine)
+ */
+
+
+/** All Individuals in order
+
+Looping back to the beginning when exhausted, can be from best to
+worse, or in random order.
+
+It is the eoSelectOne equivalent of eoDetSelect - though eoDetSelect
+always returns individuals from best to worst
+*/
+template  class eoSequentialSelect: public eoSelectOne
+{
+ public:
+  /** Ctor: sets the current pter to numeric_limits::max() so init will take place first time
+      not very elegant, maybe ...
+  */
+  eoSequentialSelect(bool _ordered = true)
+  	: ordered(_ordered), current(std::numeric_limits::max()) {}
+
+  void setup(const eoPop& _pop)
+  {
+    eoPters.resize(_pop.size());
+    if (ordered)    // probably we could have a marker to avoid re-sorting
+	    _pop.sort(eoPters);
+    else
+      _pop.shuffle(eoPters);
+    current=0;
+  }
+
+  virtual const EOT& operator()(const eoPop& _pop)
+  {
+    if (current >= _pop.size())
+      setup(_pop);
+
+    unsigned eoN = current;
+    current++;
+    return *eoPters[eoN] ;
+  }
+private:
+  bool ordered;
+  unsigned current;
+  std::vector eoPters;
+};
+
+
+
+/** All Individuals in order
+
+The best individual first, then the others in sequence (random order).
+for G3 evolution engine, see Deb, Anad and Joshi, CEC 2002
+
+As eoSequentialSelect, it is an eoSelectOne to be used within the
+eoEaseyEA algo, but conceptually it should be a global eoSelect, as it
+selects a bunch of guys in one go (done in the setup function now)
+*/
+template  class eoEliteSequentialSelect: public eoSelectOne
+{
+ public:
+
+  /** Ctor: sets the current pter to numeric_limits::max() so init will take place first time
+      not very elegant, maybe ...
+  */
+  eoEliteSequentialSelect(): current(std::numeric_limits::max()) {}
+
+  void setup(const eoPop& _pop)
+  {
+    eoPters.resize(_pop.size());
+    _pop.shuffle(eoPters);
+    // now get the best
+    unsigned int ibest = 0;
+    const EOT * best = eoPters[0];
+    if (_pop.size() == 1)
+      throw std::runtime_error("Trying eoEliteSequentialSelect with only one individual!");
+    for (unsigned i=1; i<_pop.size(); i++)
+      if (*eoPters[i]>*best)
+	{
+	  ibest = i;
+	  best = eoPters[ibest];
+	}
+    // and put it upfront
+    const EOT *ptmp = eoPters[0];
+    eoPters[0]=best;
+    eoPters[ibest] = ptmp;
+    // exit after setting current
+    current=0;
+  }
+
+  virtual const EOT& operator()(const eoPop& _pop)
+  {
+    if (current >= _pop.size())
+      setup(_pop);
+
+    unsigned eoN = current;
+    current++;
+    return *eoPters[eoN] ;
+  }
+private:
+  unsigned current;
+  std::vector eoPters;
+};
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoSharing.h b/trunk/paradiseo-eo/src/eoSharing.h
new file mode 100644
index 000000000..bdc0bbd00
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoSharing.h
@@ -0,0 +1,137 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eoSharing.h
+   (c) Maarten Keijzer, Marc Schoenauer, 2001
+
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@inria.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoSharing_h
+#define eoSharing_h
+
+#include 
+#include 
+
+/** Sharing is a perf2worth class that implements
+ *  Goldberg and Richardson's basic sharing
+*/
+
+/** A helper class for Sharing - to  hold distances */
+  class dMatrix : public std::vector
+  {
+  public:
+    // Ctor : sets size
+    dMatrix(unsigned _s) : std::vector(_s*_s), rSize(_s) {}
+
+    /** simple accessor */
+    double operator()(unsigned _i, unsigned _j) const
+    {
+      return this->operator[](_i*rSize + _j);
+    }
+
+    /** reference - to set values */
+    double & operator()(unsigned _i, unsigned _j)
+    {
+      return this->operator[](_i*rSize + _j);
+    }
+
+    /** just in case */
+    void printOn(std::ostream & _os)
+    {
+      unsigned index=0;
+      for (unsigned i=0; ioperator[](index++) << " " ;
+	  _os << std::endl;
+	}
+      _os << std::endl;
+    }
+
+    private:
+      unsigned rSize;		   // row size (== number of columns!)
+  };
+
+
+/** Sharing is a perf2worth class that implements
+ *  Goldberg and Richardson's basic sharing
+ *  see eoSharingSelect for how to use it
+ * and test/t-eoSharing.cpp for a sample use of both
+*/
+template 
+class eoSharing : public eoPerf2Worth
+{
+public:
+
+    using eoPerf2Worth::value;
+
+
+  /* Ctor requires a distance - cannot have a default distance! */
+  eoSharing(double _nicheSize, eoDistance & _dist) : eoPerf2Worth("Sharing"),
+					     nicheSize(_nicheSize),
+					     dist(_dist)
+  {}
+
+  /** Computes shared fitnesses
+  */
+    void operator()(const eoPop& _pop)
+    {
+      unsigned i, j,
+	pSize=_pop.size();
+      if (pSize <= 1)
+	throw std::runtime_error("Apptempt to do sharing with population of size 1");
+      value().resize(pSize);
+      std::vector sim(pSize);	   // to hold the similarities
+      dMatrix distMatrix(pSize*(pSize-1)/2); // to hold the distances
+
+      // compute the similarities (wrong name for distMatrix, I know)
+      distMatrix(0,0)=1;
+      for (i=1; inicheSize ? 0 : 1-(d/nicheSize) );
+	    }
+	}
+
+      for (i=0; i & dist;	     // specific distance
+};
+
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoSharingSelect.h b/trunk/paradiseo-eo/src/eoSharingSelect.h
new file mode 100644
index 000000000..40825c971
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoSharingSelect.h
@@ -0,0 +1,56 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoSharingSelect.h
+// (c) GeNeura Team, 1998, Maarten Keijzer 2000, Marc Schoenauer 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoSharingSelect_h
+#define eoSharingSelect_h
+
+//-----------------------------------------------------------------------------
+
+#include 
+#include 
+
+/** eoSharingSelect: select an individual by roulette wheel 
+ * on its SHARED fitness. It is an eoRouletteWorthSelect, 
+ * i.e. a selector using a std::vector of worthes
+ * rather than the raw fitness (see eoSelectFromWorth.h)
+ * It uses an internal eoSharing object which is 
+ * an eoPerf2Worth
+*/
+
+template  
+class eoSharingSelect: public eoRouletteWorthSelect 
+{
+public:
+  /** Ctor:
+   *  @param _s the sigma_share
+   */
+  eoSharingSelect(double _sigma, eoDistance & _dist): 
+    eoRouletteWorthSelect(sharing), sharing(_sigma, _dist) {}
+
+private :
+  eoSharing sharing;	   // derived from eoPerf2Worth
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoSimpleEDA.h b/trunk/paradiseo-eo/src/eoSimpleEDA.h
new file mode 100644
index 000000000..1da9040ec
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoSimpleEDA.h
@@ -0,0 +1,105 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoSimpleEDA.h
+// (c) Marc Schoenauer, Maarten Keijzer, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoSimpleEDA_h
+#define _eoSimpleEDA_h
+
+//-----------------------------------------------------------------------------
+
+#include 
+#include 
+#include 
+#include 
+#include 
+
+/** eoSimpleEDA: a very simple Estimation of Distribution Algorithm
+ *  
+ *  The algorithm that evolves a probability distribution 
+ *  on the spaces of populations with the loop
+ *                 generate a population from the current distribution
+ *                 evaluate that population
+ *                 update the distribution
+*/
+
+template class eoSimpleEDA: public eoEDA
+{
+ public:
+
+  /** Ctor from an eoDistribUpdater
+   * ... plus an eoEval and eoContinue of course 
+   */
+  eoSimpleEDA(eoDistribUpdater& _update,
+	   eoEvalFunc& _eval,
+	   unsigned _popSize, 
+	   eoContinue& _continuator
+	   ) : 
+    update(_update),
+    eval(_eval),
+    popSize(_popSize),
+    continuator(_continuator)
+  {}
+
+  /** The algorithm: 
+   *    generate pop from distrib, 
+   *    evaluate pop, 
+   *    update distrib
+   */
+  virtual void operator()(eoDistribution& _distrib)
+  {
+    eoPop pop(popSize, _distrib);
+    do
+    {
+      try
+      {
+	apply(_distrib, pop); // re-init. of _pop from distrib
+
+	apply(eval, pop);     // eval of current population
+
+	update(_distrib, pop);     // updates distrib from _pop
+	
+      }
+      catch (std::exception& e)
+      {
+	    std::string s = e.what();
+	    s.append( " in eoSimpleEDA");
+	    throw std::runtime_error( s );
+      }
+    } while ( continuator( pop ) );
+  }
+
+ private:
+  eoDistribUpdater & update;
+
+  eoEvalFunc&          eval;
+  
+  unsigned                  popSize;
+
+  eoContinue&          continuator;
+};
+
+//-----------------------------------------------------------------------------
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/eoSteadyFitContinue.h b/trunk/paradiseo-eo/src/eoSteadyFitContinue.h
new file mode 100755
index 000000000..c9d8ca7ed
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoSteadyFitContinue.h
@@ -0,0 +1,114 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoSteadyFitContinue.h
+// (c) GeNeura Team, 1999, Marc Schoenauer, 2000
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoSteadyFitContinue_h
+#define _eoSteadyFitContinue_h
+
+#include 
+
+/** 
+    A continuator:  does a minimum number of generations, then
+    stops whenever a given number of generations takes place without improvement 
+*/
+template< class EOT>
+class eoSteadyFitContinue: public eoContinue
+{
+public:
+  typedef typename EOT::Fitness Fitness;
+
+  /// Ctor for setting a
+  eoSteadyFitContinue( unsigned long _minGens, unsigned long _steadyGens)
+    : repMinGenerations( _minGens ), repSteadyGenerations( _steadyGens),
+      steadyState(false), thisGenerationPlaceHolder(0),
+      thisGeneration(thisGenerationPlaceHolder){};
+	
+  /// Ctor for enabling the save/load the no. of generations counted
+  eoSteadyFitContinue( unsigned long _minGens, unsigned long _steadyGen,
+		 unsigned long& _currentGen)
+    : repMinGenerations( _minGens ), repSteadyGenerations( _steadyGen),
+      steadyState(_currentGen>_minGens), thisGenerationPlaceHolder(0),
+      thisGeneration(_currentGen){};
+
+  /** Returns false when a certain number of generations is
+   * reached withtout improvement */
+  virtual bool operator() ( const eoPop& _vEO ) {
+    thisGeneration++;
+    //	  std::cout << " [" << thisGeneration << "] ";
+    Fitness bestCurrentFitness = _vEO.nth_element_fitness(0);
+
+    if (steadyState) {	   // already after MinGenenerations
+      if (bestCurrentFitness > bestSoFar) {
+	bestSoFar = bestCurrentFitness;
+	lastImprovement = thisGeneration;
+      } else {
+	if (thisGeneration - lastImprovement > repSteadyGenerations) {
+	  std::cout << "STOP in eoSteadyFitContinue: Done " << repSteadyGenerations 
+	       << " generations without improvement\n";
+	  return false;
+	}
+      } 
+    } else {		   // not yet in steady state
+      if (thisGeneration > repMinGenerations) { // go to steady state
+	steadyState = true;
+	bestSoFar = bestCurrentFitness;
+	lastImprovement = thisGeneration;
+	std::cout << "eoSteadyFitContinue: Done the minimum number of generations\n";
+      }
+    }
+    return true;
+  }
+
+  /** Sets the parameters (minimum nb of gen. + steady nb of gen.) 
+      and sets the current generation to 0 (the begin)*/
+  virtual void totalGenerations( unsigned long _mg, unsigned long _sg ) { 
+    repMinGenerations = _mg; 
+    repSteadyGenerations = _sg;
+    reset();
+  };
+
+  /// Resets the state after it's been reached 
+  virtual void reset () {
+    steadyState=false;
+    thisGeneration = 0;
+  }
+
+  /** accessors*/
+  virtual unsigned long minGenerations( ) 
+  {  return repMinGenerations; 	};
+  virtual unsigned long steadyGenerations( ) 
+  {  return repSteadyGenerations; 	};
+    
+  virtual std::string className(void) const { return "eoSteadyFitContinue"; }
+private:
+  unsigned long repMinGenerations;
+  unsigned long  repSteadyGenerations;
+  bool steadyState;
+  unsigned long thisGenerationPlaceHolder;
+  unsigned long& thisGeneration;
+  unsigned int lastImprovement;
+  Fitness bestSoFar;
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/eoStochTournamentSelect.h b/trunk/paradiseo-eo/src/eoStochTournamentSelect.h
new file mode 100755
index 000000000..69f0376ee
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoStochTournamentSelect.h
@@ -0,0 +1,73 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoStochTournamentSelect.h
+// (c) GeNeura Team, 1998 - EEAAX 1999
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoStochTournamentSelect_h
+#define eoStochTournamentSelect_h
+
+//-----------------------------------------------------------------------------
+
+#include 
+#include            // accumulate
+#include      // eoSelectOne
+#include  // stochastic_tournament
+
+//-----------------------------------------------------------------------------
+/** eoStochTournamentSelect: a selection method that selects ONE individual by
+ binary stochastic tournament 
+ -MS- 24/10/99 */
+//-----------------------------------------------------------------------------
+
+template  class eoStochTournamentSelect: public eoSelectOne
+{
+ public:
+
+  ///
+  eoStochTournamentSelect(double _Trate = 1.0 ) : eoSelectOne(), Trate(_Trate) 
+  {
+    // consistency checks
+    if (Trate < 0.5) {
+      std::cerr << "Warning, Tournament rate should be > 0.5\nAdjusted to 0.55\n";
+      Trate = 0.55;
+    }
+    if (Trate > 1) {
+      std::cerr << "Warning, Tournament rate should be < 1\nAdjusted to 1\n";
+      Trate = 1;
+    }
+  }
+  
+  /** Perform the stochastic tournament  */
+  virtual const EOT& operator()(const eoPop& pop) 
+  {
+      return stochastic_tournament(pop, Trate);
+  }
+  
+private:
+  double Trate;
+};
+
+//-----------------------------------------------------------------------------
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/eoStochasticUniversalSelect.h b/trunk/paradiseo-eo/src/eoStochasticUniversalSelect.h
new file mode 100755
index 000000000..09864057f
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoStochasticUniversalSelect.h
@@ -0,0 +1,109 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoStochasticUniversalSelect.h
+// (c) Maarten Keijzer 2003
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@cs.vu.nl
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoStochasticUniversalSelect_h
+#define eoStochasticUniversalSelect_h
+
+//-----------------------------------------------------------------------------
+
+#include 
+#include 
+#include 
+#include 
+
+//-----------------------------------------------------------------------------
+/** eoStochasticUniversalSelect: select an individual proportional to her stored fitness
+    value, but in contrast with eoStochasticUniversalSelect, get rid of most finite sampling effects
+    by doing all selections in one go, using a single random number.
+*/
+//-----------------------------------------------------------------------------
+
+template  class eoStochasticUniversalSelect: public eoSelectOne
+{
+public:
+  /// Sanity check
+  eoStochasticUniversalSelect(const eoPop& pop = eoPop())
+  {
+    if (minimizing_fitness())
+      throw std::logic_error("eoStochasticUniversalSelect: minimizing fitness");
+  }
+
+  void setup(const eoPop& _pop)
+  {
+      if (_pop.size() == 0) return;
+
+      std::vector cumulative(_pop.size());
+
+      cumulative[0] = _pop[0].fitness();
+      for (unsigned i = 1; i < _pop.size(); ++i)
+      {
+	  cumulative[i] = _pop[i].fitness() + cumulative[i-1];
+      }
+
+      indices.reserve(_pop.size());
+      indices.resize(0);
+
+      double fortune = rng.uniform() * cumulative.back();
+      double step = cumulative.back() / double(_pop.size());
+
+      unsigned i = std::upper_bound(cumulative.begin(), cumulative.end(), fortune) - cumulative.begin();
+
+      while (indices.size() < _pop.size()) {
+
+	  while (cumulative[i] < fortune) {i++;} // linear search is good enough as we average one step each time
+
+	  indices.push_back(i);
+	  fortune += step;
+	  if (fortune >= cumulative.back()) { // start at the beginning
+	      fortune -= cumulative.back();
+	      i = 0;
+	  }
+      }
+      // shuffle
+      for (int i = indices.size() - 1; i > 0; --i) {
+	  int j = rng.random(i+1);
+	  std::swap(indices[i], indices[j]);
+      }
+  }
+
+  /** do the selection,
+   */
+  const EOT& operator()(const eoPop& _pop)
+  {
+      if (indices.empty()) setup(_pop);
+
+      unsigned index = indices.back();
+      indices.pop_back();
+      return _pop[index];
+  }
+
+private :
+
+  typedef std::vector IndexVec;
+  IndexVec indices;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoSurviveAndDie.h b/trunk/paradiseo-eo/src/eoSurviveAndDie.h
new file mode 100644
index 000000000..f99d646c4
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoSurviveAndDie.h
@@ -0,0 +1,191 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eoSurviveAndDie.h
+   (c) Maarten Keijzer, Marc Schoenauer, GeNeura Team, 2000
+
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoSurviveAndDie_h
+#define _eoSurviveAndDie_h
+
+
+//-----------------------------------------------------------------------------
+#include 
+#include 
+#include 
+#include 
+#include 
+//-----------------------------------------------------------------------------
+
+/**
+eoSurviveAndDie: takes a population (first argument),
+kills the ones that are to die,
+puts the ones that are to survive into the second argument
+removes them from the first pop argument
+
+@classes: eoSurviveAndDie, eoDeterministicSurviveAndDie,
+          eoDeterministicSaDReplacement
+*/
+
+/** eoSurviveAndDie
+A pure abstract class, to store the howmany's
+*/
+template 
+class eoSurviveAndDie : public eoBF &, eoPop &, void>
+{
+public:
+    eoSurviveAndDie(double _survive, double _die, bool _interpret_as_rate = true):
+	howmanySurvive(_survive, _interpret_as_rate),
+	howmanyDie(_die, _interpret_as_rate)
+    {}
+
+protected:
+    eoHowMany howmanySurvive;
+    eoHowMany howmanyDie;
+
+};
+
+/** An instance (theonly one as of today, Dec. 20, 2000) of an
+    eoSurviveAndDie, that does everything deterministically
+
+    Used in eoDeterministicSaDReplacement.
+*/
+template 
+class eoDeterministicSurviveAndDie : public eoSurviveAndDie
+{
+public:
+
+    using eoSurviveAndDie< EOT >::howmanyDie;
+    using eoSurviveAndDie< EOT >::howmanySurvive;
+
+    /** constructor */
+    eoDeterministicSurviveAndDie(double _survive, double _die, bool _interpret_as_rate = true)
+        : eoSurviveAndDie< EOT >(_survive, _die, _interpret_as_rate)
+    {}
+
+
+    void operator()(eoPop & _pop, eoPop & _luckyGuys)
+    {
+	unsigned pSize = _pop.size();
+	unsigned nbSurvive = howmanySurvive(pSize);
+	// first, save the best into _luckyGuys
+	if (nbSurvive)
+	    {
+		_pop.nth_element(nbSurvive);
+		// copy best
+		_luckyGuys.resize(nbSurvive);
+		std::copy(_pop.begin(), _pop.begin()+nbSurvive, _luckyGuys.begin());
+		// erase them from pop
+		_pop.erase(_pop.begin(), _pop.begin()+nbSurvive);
+	    }
+	unsigned nbRemaining = _pop.size();
+
+	// carefull, we can have a rate of 1 if we want to kill all remaining
+	unsigned nbDie = std::min(howmanyDie(pSize), pSize-nbSurvive);
+	if (nbDie > nbRemaining)
+	    throw std::logic_error("eoDeterministicSurviveAndDie: Too many to kill!\n");
+
+	if (!nbDie)
+	  {
+	    return;
+	  }
+	// else
+	// kill the worse nbDie
+	_pop.nth_element(nbRemaining-nbDie);
+	_pop.resize(nbRemaining-nbDie);
+    }
+
+};
+
+/**
+eoDeterministicSaDReplacement: replacement strategy that is just, in sequence
+  saves best and kill worse from parents
++ saves best and kill worse from offspring
++ merge remaining (neither save nor killed) parents and offspring
++ reduce that merged population
+= returns reduced pop + best parents + best offspring
+
+An obvious use is as strong elitist strategy,
+   i.e. preserving best parents, and reducing
+         (either offspring or parents+offspring)
+*/
+template 
+class eoDeterministicSaDReplacement : public eoReplacement
+{
+public:
+  /**  Constructor with reduce */
+  eoDeterministicSaDReplacement(eoReduce& _reduceGlobal,
+		 double _surviveParents, double _dieParents=0,
+		 double _surviveOffspring=0, double _dieOffspring=0,
+		 bool _interpret_as_rate = true ) :
+	reduceGlobal(_reduceGlobal),
+	sAdParents(_surviveParents, _dieParents, _interpret_as_rate),
+	sAdOffspring(_surviveOffspring, _dieOffspring, _interpret_as_rate)
+    {}
+
+  /**  Constructor with default truncate used as reduce */
+    eoDeterministicSaDReplacement(
+		 double _surviveParents, double _dieParents=0,
+		 double _surviveOffspring=0, double _dieOffspring=0,
+		 bool _interpret_as_rate = true ) :
+	reduceGlobal(truncate),
+	sAdParents(_surviveParents, _dieParents, _interpret_as_rate),
+	sAdOffspring(_surviveOffspring, _dieOffspring, _interpret_as_rate)
+    {}
+
+    void operator()(eoPop& _parents, eoPop& _offspring)
+    {
+	unsigned pSize = _parents.size(); // target number of individuals
+
+	eoPop luckyParents;       // to hold the absolute survivors
+	sAdParents(_parents, luckyParents);
+
+	eoPop luckyOffspring;       // to hold the absolute survivors
+	sAdOffspring(_offspring, luckyOffspring);
+
+	unsigned survivorSize = luckyOffspring.size() + luckyParents.size();
+	if (survivorSize > pSize)
+	    throw std::logic_error("eoGeneralReplacement: More survivors than parents!\n");
+
+	plus(_parents, _offspring); // all that remain in _offspring
+
+	reduceGlobal(_offspring, pSize - survivorSize);
+	plus(luckyParents, _offspring);
+	plus(luckyOffspring, _offspring);
+
+	_parents.swap(_offspring);
+
+    }
+
+private :
+  eoReduce& reduceGlobal;
+  eoDeterministicSurviveAndDie sAdParents;
+  eoDeterministicSurviveAndDie sAdOffspring;
+  // plus helper (could be replaced by operator+= ???)
+  eoPlus plus;
+  // the default reduce: deterministic truncation
+  eoTruncate truncate;
+};
+
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoTransform.h b/trunk/paradiseo-eo/src/eoTransform.h
new file mode 100644
index 000000000..40bc81383
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoTransform.h
@@ -0,0 +1,41 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eoTransform.h 
+   (c) Maarten Keijzer, GeNeura Team, 2000
+ 
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+   Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoTransform_h
+#define _eoTransform_h
+
+
+//-----------------------------------------------------------------------------
+#include 
+//-----------------------------------------------------------------------------
+
+/** 
+eoTransform transforms a population by applying genetic operators on
+it.
+*/
+template
+class eoTransform : public eoUF&, void>
+{};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoTruncSelect.h b/trunk/paradiseo-eo/src/eoTruncSelect.h
new file mode 100644
index 000000000..0c64e1622
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoTruncSelect.h
@@ -0,0 +1,73 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eoTruncSelect.h 
+   (c) Maarten Keijzer, Marc Schoenauer, GeNeura Team, 2002
+ 
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoTruncSelect_h
+#define _eoTruncSelect_h
+
+
+//-----------------------------------------------------------------------------
+#include 
+#include 
+#include 
+//-----------------------------------------------------------------------------
+
+/** eoTruncSelect selects individuals after truncating the population
+ * using eoSelectOne as it's mechanism. 
+ * Therefore eoSelectMany needs an eoSelectOne in its ctor
+ * It will use an eoHowMnay to determine the number of guys to keep,
+*/
+template
+class eoTruncSelect : public eoSelect
+{
+ public:
+  /** Ctor: from an eoSelect (and an eoMany to tell how many are kept for selectino */
+  eoTruncSelect(eoSelectOne& _select, eoHowMany _howMany) 
+    : select(_select), howMany(_howMany) {}
+  
+     /**
+     The implementation repeatidly selects an individual
+
+     @param _source the source population
+     @param _dest  the resulting population (size of this population is the number of times eoSelectOne is called. It empties the destination and adds the selection into it)
+     */
+  virtual void operator()(const eoPop& _source, eoPop& _dest)
+  {
+    unsigned target = howMany(_source.size());
+    
+    _dest.resize(target);
+    
+    select.setup(_source);
+    
+    for (size_t i = 0; i < _dest.size(); ++i)
+      _dest[i] = select(_source);
+  }
+  
+private :
+  eoSelectOne& select;
+  eoHowMany howMany;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoTruncatedSelectMany.h b/trunk/paradiseo-eo/src/eoTruncatedSelectMany.h
new file mode 100644
index 000000000..9cad8dbc4
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoTruncatedSelectMany.h
@@ -0,0 +1,117 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eoTruncatedSelectMany.h 
+   (c) Maarten Keijzer, Marc Schoenauer, GeNeura Team, 2002
+ 
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@inria.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoTruncatedSelectMany_h
+#define _eoTruncatedSelectMany_h
+
+
+//-----------------------------------------------------------------------------
+#include 
+#include 
+#include 
+#include 
+//-----------------------------------------------------------------------------
+
+/** eoTruncatedSelectMany selects many individuals using eoSelectOne as it's 
+    mechanism. Therefore eoSelectMany needs an eoSelectOne in its ctor
+
+    It will use an eoHowMnay to determine the number of guys to select,
+     and push them to the back of the destination population.
+
+     And it will only perform selection from the top guys in the population.
+
+     It is NOT a special case of eoSelectMany because it needs to SORT 
+     the population to discard the worst guys before doing the selection
+
+     However, the same result can be obtained by embedding an 
+     eoTruncatedSelectOne into an eoSelectMany ...
+*/
+template
+class eoTruncatedSelectMany : public eoSelect
+{
+ public:
+     /// Ctor
+     eoTruncatedSelectMany(eoSelectOne& _select, 
+		  double  _rateGenitors, double  _rateFertile, 
+		  bool _interpret_as_rateG = true, 
+		  bool _interpret_as_rateF = true)
+         : select(_select), 
+	   howManyGenitors(_rateGenitors, _interpret_as_rateG),
+	   howManyFertile(_rateFertile, _interpret_as_rateF) {}
+
+     // Ctor with eoHowManys
+     eoTruncatedSelectMany(eoSelectOne& _select, 
+		  eoHowMany _howManyGenitors, eoHowMany _howManyFertile) 
+         : select(_select), howManyGenitors(_howManyGenitors),
+	   howManyFertile(_howManyFertile) {}
+
+     /**
+     The implementation repeatidly selects an individual
+
+     @param _source the source population
+     @param _dest  the resulting population (size of this population is the number of times eoSelectOne is called. It empties the destination and adds the selection into it)
+     */
+  virtual void operator()(const eoPop& _source, eoPop& _dest)
+  {
+    unsigned target = howManyGenitors(_source.size());
+
+    _dest.resize(target);
+
+    unsigned nbFertile = howManyFertile(_source.size());
+
+    //revert to standard selection (see eoSelectMany) if no truncation
+    if (nbFertile == _source.size())
+      {
+	select.setup(_source);
+	
+	for (size_t i = 0; i < _dest.size(); ++i)
+	  _dest[i] = select(_source);
+      }
+    else
+      {
+    // at the moment, brute force (rush rush, no good)
+    // what we would need otherwise is a std::vector class
+    // and selectors that act on such a thing
+	eoPop tmpPop = _source; // hum hum, could be a pain in the ass
+
+	tmpPop.sort();		   // maybe we could only do partial sort?
+	tmpPop.resize(nbFertile);  // only the best guys here now
+	tmpPop.shuffle();	   // as some selectors are order-sensitive
+
+	select.setup(tmpPop);
+	
+	for (size_t i = 0; i < _dest.size(); ++i)
+	  _dest[i] = select(tmpPop);
+      }
+  }
+  
+private :
+  eoSelectOne& select;	   // selector for one guy
+  eoHowMany howManyGenitors;	   // number of guys to select
+  eoHowMany howManyFertile;	   // number of fertile guys
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoTruncatedSelectOne.h b/trunk/paradiseo-eo/src/eoTruncatedSelectOne.h
new file mode 100644
index 000000000..b65739c41
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoTruncatedSelectOne.h
@@ -0,0 +1,111 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eoTruncatedSelectOne.h 
+   (c) Maarten Keijzer, Marc Schoenauer, GeNeura Team, 2002
+ 
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@inria.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoTruncatedSelectOne_h
+#define _eoTruncatedSelectOne_h
+
+
+//-----------------------------------------------------------------------------
+#include 
+#include 
+#include 
+#include 
+//-----------------------------------------------------------------------------
+
+/** eoTruncatedSelectOne selects one individual using eoSelectOne as it's 
+    mechanism. Therefore eoTruncatedSelectOne needs an eoSelectOne in its ctor
+
+    It will perform selection only from the top guys in the population.
+
+*/
+template
+class eoTruncatedSelectOne : public eoSelectOne
+{
+public:
+  /** Ctor from rate and bool */
+  eoTruncatedSelectOne(eoSelectOne& _select, 
+		       double  _rateFertile, 
+		       bool _interpret_as_rateF = true)
+    : select(_select), 
+      howManyFertile(_rateFertile, _interpret_as_rateF),
+      tmpPop(), actualPop(tmpPop)
+  {}
+
+  /** Ctor with eoHowMany */
+  eoTruncatedSelectOne(eoSelectOne& _select, 
+			eoHowMany _howManyFertile) 
+    : select(_select), howManyFertile(_howManyFertile),
+    tmpPop(), actualPop(tmpPop)
+  {}
+
+
+  /** setup procedures: fills the temporary population with the fertile guys */
+  void setup(const eoPop& _source)
+  {
+    unsigned fertile = howManyFertile(_source.size());
+    if (fertile == _source.size())  // noting to do, all are fertile
+      {
+	actualPop = _source;
+      }
+    else
+      {
+	// copy only best ferile to actualPop
+	tmpPop.resize(fertile);
+	std::vector result;
+	_source.nth_element(fertile, result);
+	for (unsigned i=0; i& _pop) 
+  {
+    return select(actualPop);
+  }
+
+
+private :
+  eoSelectOne& select;	   // selector for one guy
+  eoHowMany howManyFertile;	   // number of fertile guys
+  eoPop tmpPop;		   // intermediate population - fertile guys
+  eoPop & actualPop;	   // to avoid copies when 100% fertility
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoVariableLengthCrossover.h b/trunk/paradiseo-eo/src/eoVariableLengthCrossover.h
new file mode 100644
index 000000000..1e0772da8
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoVariableLengthCrossover.h
@@ -0,0 +1,348 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoVariableLengthCrossover.h
+// (c) GeNeura Team, 2000 - EEAAX 1999 - Maarten Keijzer 2000
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@polytechnique.fr
+             mkeijzer@cs.vu.nl
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoVariableLengthCrossover_h
+#define _eoVariableLengthCrossover_h
+
+#include 
+#include 
+
+/**
+  Base classes for generic crossovers on variable length chromosomes.
+
+Basically, they exchange genes - we need some matching information to apply
+atom crossover
+*/
+
+/** A helper class for choosing which genes to exchange */
+template 
+class eoAtomExchange : public eoBF
+{
+public:
+  /** a function to initlialize - to be called before every crossover */
+  virtual void randomize(unsigned int, unsigned int){}
+  /** the inherited className() */
+  virtual std::string className() const=0;
+};
+
+/** Uniform crossover - well, not really, efficient for FixedLength */
+template 
+class eoUniformAtomExchange: public eoAtomExchange
+{
+public:
+    eoUniformAtomExchange(double _rate=0.5):rate(_rate){}
+
+  /** randomize: fill the mask: the exchange will be simulated first
+   * to see if sizes are OK, so it must be repeatable :
+   * the mask has to be a private data, cannot be computed on the fly
+   */
+  void randomize(unsigned _size1, unsigned _size2)
+  {
+    mask.resize(_size1 + _size2);
+    for (unsigned i=0; i<_size1+_size2; i++)
+	mask[i]=eo::rng.flip(rate);
+  }
+
+  /** the operator() simply returns the mask booleans in turn */
+    bool operator()(unsigned _i, Atom & )
+    {
+      return mask[_i];
+    }
+
+  /** inherited className() */
+  virtual std::string className() const {return "eoUniformAtomExchange";}
+
+private:
+  double rate;
+  std::vector mask;
+};
+
+/////////////////////////////////////////////////////////////////////
+//////    Now the operators themsleves
+/////////////////////////////////////////////////////////////////////
+
+/** Exchange Crossover using an AtomExchange
+ */
+template 
+class eoVlAtomExchangeQuadOp : public eoQuadOp
+{
+public :
+
+  typedef typename EOT::AtomType AtomType;
+
+  /** default ctor: requires bounds on number of genes + a rate */
+  eoVlAtomExchangeQuadOp(unsigned _Min, unsigned _Max,
+			 eoAtomExchange& _atomExchange):
+    Min(_Min), Max(_Max), atomExchange(_atomExchange) {}
+
+  bool operator()(EOT & _eo1, EOT & _eo2)
+  {
+    EOT tmp1, tmp2;		   // empty individuals
+    unsigned index=0;
+    // main loop: until sizes are OK, do only simulated exchange
+    unsigned i, i1, i2;
+    do {
+      // "initialize the AtomExchange
+      atomExchange.randomize(_eo1.size(), _eo2.size());
+      // simulate crossover
+      i1=i2=0;
+      for (i=0; i<_eo1.size(); i++)
+	{
+	  if (atomExchange(i, _eo1[i]))
+	    i1++;
+	  else
+	    i2++;
+	}
+      for (i=0; i<_eo2.size(); i++)
+	{
+	  if (atomExchange(i, _eo2[i]))
+	    i2++;
+	  else
+	    i1++;
+	}
+      index++;
+    } while ( ( (i1Max) || (i2>Max) )
+	      && (index<10000) );
+    if (index >= 10000)
+      {
+	std::cout << "Warning: impossible to generate individual of the right size in 10000 trials\n";
+	return false;
+      }
+  // here we know we have the right sizes: do the actual exchange
+      for (i=0; i<_eo1.size(); i++)
+	{
+	  if (atomExchange(i, _eo1[i]))
+	    tmp1.push_back(_eo1[i]);
+	  else
+	    tmp2.push_back(_eo1[i]);
+	}
+      for (i=0; i<_eo2.size(); i++)
+	{
+	  if (atomExchange(i, _eo2[i]))
+	    tmp2.push_back(_eo2[i]);
+	  else
+	    tmp1.push_back(_eo2[i]);
+	}
+      // and put everything back in place
+    _eo1.swap(tmp1);
+    _eo2.swap(tmp2);
+    return true;	 // should we test that? Yes, but no time now
+  }
+
+  /** the inherited className */
+  virtual std::string className() const
+  {
+      std::ostringstream os;
+      os << "eoVlAtomExchangeQuadOp(" << atomExchange.className() << ")";
+      return os.str();
+  }
+
+private:
+  unsigned Min, Max;
+  eoAtomExchange & atomExchange;
+};
+
+/** Crossover using an AtomCrossover. Probably irrelevant in Variable Length -
+    see eoFlOrBinOp.h and eoFlOrQuadOp.h for the similar Fixed Length operators
+ */
+template 
+class eoInnerExchangeQuadOp : public eoQuadOp
+{
+public :
+
+  typedef typename EOT::AtomType AtomType;
+
+  /** default ctor: requires bounds on number of genes + a rate */
+  eoInnerExchangeQuadOp( eoQuadOp& _op, float _rate = 0.5):
+    op(_op), rate( _rate ) {}
+
+  /** performs the Atom crossover */
+  bool operator()(EOT & _eo1, EOT & _eo2)
+  {
+    unsigned size1 = _eo1.size(), size2 = _eo2.size(), minsize = ( size1 > size2)?size2:size1;
+    bool changed = false;
+    for ( unsigned i = 0; i < minsize; i ++ ) {
+      if ( rng.flip( rate ) ) {
+	bool changedHere = op( _eo1[i], _eo2[i] );
+	changed |= changedHere;
+      }
+    }
+    return changed;	 // should we test that? Yes, but no time now
+  }
+
+  virtual std::string className() const
+  {
+    return "eoInnerExchangeQuadOp(" + op.className() + ")";
+  }
+
+private:
+  float rate;
+  eoQuadOp & op;
+};
+
+
+
+
+/** Direct Uniform Exchange of genes (obsolete, already :-) stays there for historical reasons
+
+A very primitive version, that does no verification at all!!!
+NEEDS to be improved - but no time now :-(((
+Especially, if both guys have maximal size, it will take a lot of time
+to generate 2 offspring that both are not oversized!!!
+Also, we should first check for identical atoms, and copy them to the
+offspring, and only after that exchange the other ones (Radcliffe's RRR).
+ */
+template 
+class eoVlUniformQuadOp : public eoQuadOp
+{
+public :
+
+  typedef typename EOT::AtomType AtomType;
+
+  // default ctor: requires bounds on number of genes + a rate
+  eoVlUniformQuadOp(unsigned _Min, unsigned _Max, double _rate=0.5) :
+    Min(_Min), Max(_Max), rate(_rate) {}
+
+  bool operator()(EOT & _eo1, EOT & _eo2)
+  {
+    unsigned i;
+    EOT tmp1, tmp2;
+    unsigned index=0;
+    do {
+      for (i=0; i<_eo1.size(); i++)
+	{
+	  if (eo::rng.flip(rate))
+	    tmp1.push_back(_eo1[i]);
+	  else
+	    tmp2.push_back(_eo1[i]);
+	  // here we should look for _eo1[i] inside _eo2 and erase it if found!
+	}
+      for (i=0; i<_eo2.size(); i++)
+	{
+	  if (eo::rng.flip(rate))
+	    tmp1.push_back(_eo2[i]);
+	  else
+	    tmp2.push_back(_eo2[i]);
+	}
+      index++;
+    } while ( ( (tmp1.size()Max) || (tmp2.size()>Max) )
+	      && (index<10000) );
+    if (index >= 10000)
+      {
+	std::cout << "Warning: impossible to generate individual of the right size in 10000 trials\n";
+	return false;
+      }
+
+    _eo1.swap(tmp1);
+    _eo2.swap(tmp2);
+    return true;		   // should we test that?
+  }
+private:
+  unsigned Min, Max;
+  double rate;
+};
+
+
+/** Direct Uniform Exchange of genes for Variable Length, BINARY version
+
+A very primitive version, that does no verification at all!!!
+NEEDS to be improved - but no time now :-(((
+Especially, if both guys have maximal size, it will take some time
+to generate even 1 offspring that is not oversized!!!
+Also, we should first check for identical atoms, and copy them to the
+offspring, and only after that exchange the other ones (Radcliffe's RRR).
+ */
+template 
+class eoVlUniformBinOp : public eoBinOp
+{
+public :
+
+  typedef typename EOT::AtomType AtomType;
+
+  // default ctor: requires bounds on number of genes + a rate
+  eoVlUniformBinOp(unsigned _Min, unsigned _Max, double _rate=0.5) :
+    Min(_Min), Max(_Max), rate(_rate) {}
+
+  bool operator()(EOT & _eo1, const EOT & _eo2)
+  {
+    unsigned i;
+    EOT tmp1;
+    bool tmpIsOne=true, tmpIsTwo=true;
+    unsigned index=0;
+    do {
+      for (i=0; i<_eo1.size(); i++)
+	{
+	  if (eo::rng.flip(rate))
+	    {
+	      tmp1.push_back(_eo1[i]);
+	      tmpIsTwo = false;
+	    }
+	  else
+	    tmpIsOne=false;
+	// we should look for _eo1[i] inside _eo2 and erase it there if found!
+	}
+      for (i=0; i<_eo2.size(); i++)
+	{
+	  if (! eo::rng.flip(rate))
+	    {
+	      tmp1.push_back(_eo2[i]);
+	      tmpIsOne = false;
+	    }
+	  else
+	    tmpIsTwo = false;
+	}
+      index++;
+    } while ( ( (tmp1.size()Max) )
+	      && (index<10000) );
+    // this while condition is not optimal, as it may take some time
+    if (index >= 10000)
+      {
+	std::cout << "Warning: impossible to generate individual of the right size in 10000 trials\n";
+	return false;
+      }
+
+    _eo1.swap(tmp1);
+    if (tmpIsTwo)
+      {
+	//	_eo1.fitness(_eo2.fitness());     NO FITNESS EXISTS HERE!
+	return false;
+      }
+    if (tmpIsOne)		   // already has the right fitness
+      {				   // WRONG: NO FITNESS EXISTS HERE!
+	return false;
+      }
+    return true;		   // there were some modifications...
+  }
+
+private:
+  unsigned Min, Max;
+  double rate;
+};
+
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoVariableLengthMutation.h b/trunk/paradiseo-eo/src/eoVariableLengthMutation.h
new file mode 100644
index 000000000..585fc3767
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoVariableLengthMutation.h
@@ -0,0 +1,158 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoVariableLengthMutation.h
+// (c) Marc Schoenauer 1999 - Maarten Keijzer 2000
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@polytechnique.fr
+             mkeijzer@cs.vu.nl
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoVariableLengthMutation_h
+#define _eoVariableLengthMutation_h
+
+#include 
+#include 
+#include 
+
+/**
+  Base classes for generic mutations on variable length chromosomes.
+  Contains addition and deletion of a gene
+
+  The generic mutations that apply a gene-level mutation to some genes
+  dont't modify the length, and so are NOT specific to variable-length
+  Hence they are in file eoFlOr MonOp.h file (FixedLengthOrdered mutations)
+*/
+
+
+/** Addition of a gene
+    Is inserted at a random position - so can be applied to both
+    order-dependent and order-independent
+ */
+template 
+class eoVlAddMutation : public eoMonOp
+{
+public :
+
+  typedef typename EOT::AtomType AtomType;
+
+  /** default ctor
+
+   * @param nMax      max number of atoms
+   * @param _atomInit an Atom initializer
+   */
+  eoVlAddMutation(unsigned _nMax, eoInit & _atomInit) :
+    nMax(_nMax), atomInit(_atomInit) {}
+
+  /** operator: actually adds an Atom */
+  bool operator()(EOT & _eo)
+  {
+    if (_eo.size() >= nMax)
+      return false;		   // unmodifed
+    AtomType atom;
+    atomInit(atom);
+    unsigned pos = rng.random(_eo.size()+1);
+    _eo.insert(_eo.begin()+pos, atom);
+    return true;
+  }
+
+  /** inherited className */
+  virtual std::string className() const { return "eoVlAddMutation"; }
+
+private:
+  unsigned nMax;
+  eoInit & atomInit;
+};
+
+
+/** A helper class for choosing which site to delete */
+template 
+class eoGeneDelChooser : public eoUF
+{
+public:
+  virtual std::string className() const =0;
+
+};
+
+/** Uniform choice of gene to delete */
+template 
+class eoUniformGeneChooser: public eoGeneDelChooser
+{
+public:
+    eoUniformGeneChooser(){}
+    unsigned operator()(EOT & _eo)
+    {
+	return eo::rng.random(_eo.size());
+    }
+  virtual std::string className() const { return "eoUniformGeneChooser"; }
+};
+
+/** Deletion of a gene
+    By default at a random position, but a "chooser" can be specified
+    can of course be applied to both order-dependent and order-independent
+ */
+template 
+class eoVlDelMutation : public eoMonOp
+{
+public :
+
+  typedef typename EOT::AtomType AtomType;
+
+  /** ctor with an external gene chooser
+
+   * @param nMin      min number of atoms to leave in the individual
+   * @param _geneChooser an eoGeneCHooser to choose which one to delete
+   */
+  eoVlDelMutation(unsigned _nMin, eoGeneDelChooser & _chooser) :
+    nMin(_nMin), uChooser(), chooser(_chooser) {}
+
+  /** ctor with uniform gene chooser - the default
+
+   * @param nMin      min number of atoms to leave in the individual
+   */
+  eoVlDelMutation(unsigned _nMin) :
+    nMin(_nMin), uChooser(), chooser(uChooser) {}
+
+  /** Do the job (delete one gene)
+   * @param _eo  the EO to mutate
+   */
+  bool operator()(EOT & _eo)
+  {
+    if (_eo.size() <= nMin)
+      return false;		   // unmodifed
+    unsigned pos = chooser(_eo);
+    _eo.erase(_eo.begin()+pos);
+    return true;
+  }
+
+  virtual std::string className() const
+  {
+    std::ostringstream os;
+    os << "eoVlDelMutation("< uChooser;
+    eoGeneDelChooser & chooser;
+};
+
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/eoVector.h b/trunk/paradiseo-eo/src/eoVector.h
new file mode 100644
index 000000000..e06ac1685
--- /dev/null
+++ b/trunk/paradiseo-eo/src/eoVector.h
@@ -0,0 +1,138 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoVector.h
+// (c) GeNeura Team, 2000 - EEAAX 1999 - Maarten Keijzer 2000
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+	     mak@dhi.dk
+
+    CVS Info: $Date: 2005/10/06 17:22:40 $ $Header: /cvsroot/eodev/eo/src/eoVector.h,v 1.17 2005/10/06 17:22:40 kuepper Exp $ $Author: kuepper $
+
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoVector_h
+#define _eoVector_h
+
+#include 
+#include 
+#include 
+
+/**
+
+  Base class for fixed length chromosomes, just derives from EO and std::vector and
+  redirects the smaller than operator to EO (fitness based comparison). GeneType
+  must have the following methods: void ctor (needed for the std::vector<>), copy ctor,
+
+
+*/
+template 
+class eoVector : public EO, public std::vector
+{
+public:
+
+    using EO::invalidate;
+    using std::vector::operator[];
+    using std::vector::begin;
+    using std::vector::end;
+    using std::vector::resize;
+    using std::vector::size;
+
+    typedef GeneType                AtomType;
+    typedef std::vector   ContainerType;
+
+    /** default constructor
+
+    @param size Length of vector (default is 0)
+    @param value Initial value of all elements (default is default value of type GeneType)
+    */
+    eoVector(unsigned size = 0, GeneType value = GeneType())
+        : EO(), std::vector(size, value)
+        {}
+
+    /// copy ctor abstracting from the FitT
+    template 
+    eoVector(const eoVector& _vec) : std::vector(_vec)
+    {}
+
+  // we can't have a Ctor from a std::vector, it would create ambiguity
+  //  with the copy Ctor
+  void value(const std::vector& _v)
+  {
+    if (_v.size() != size())	   // safety check
+      {
+	if (size())		   // NOT an initial empty std::vector
+	  std::cout << "Warning: Changing size in eoVector assignation"<::operator<
+    bool operator<(const eoVector& _eo) const
+    {
+        return EO::operator<(_eo);
+    }
+
+    /// printing...
+    virtual void printOn(std::ostream& os) const
+    {
+        EO::printOn(os);
+        os << ' ';
+
+        os << size() << ' ';
+
+        std::copy(begin(), end(), std::ostream_iterator(os, " "));
+    }
+
+    /// reading...
+    virtual void readFrom(std::istream& is)
+    {
+        EO::readFrom(is);
+
+        unsigned sz;
+        is >> sz;
+
+        resize(sz);
+        unsigned i;
+
+        for (i = 0; i < sz; ++i)
+        {
+            AtomType atom;
+            is >> atom;
+            operator[](i) = atom;
+        }
+    }
+};
+
+/// to avoid conflicts between EO::operator< and std::vector::operator<
+template 
+bool operator<(const eoVector& _eo1, const eoVector& _eo2)
+{
+    return _eo1.operator<(_eo2);
+}
+template 
+bool operator>(const eoVector& _eo1, const eoVector& _eo2)
+{
+    return _eo1.operator>(_eo2);
+}
+
+#endif
diff --git a/trunk/paradiseo-eo/src/es.h b/trunk/paradiseo-eo/src/es.h
new file mode 100644
index 000000000..17545f3e0
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es.h
@@ -0,0 +1,63 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// es.h
+// (c) GeNeura Team 1998 - Maarten Keijzer 2000 - Marc Schoenauer 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+	     todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+#ifndef _es_h
+#define _es_h
+
+// contains the include specific to real representations, i.e. in src/es dir
+//-----------------------------------------------------------------------------
+ 
+// the genotypes - from plain std::vector to full correlated mutation
+#include 
+#include 
+#include 
+#include 
+
+// the initialization
+#include 
+
+// general operators
+#include 
+#include 
+#include 	// for generic operators
+
+// SBX crossover (following Deb)
+#include 
+
+// ES specific operators
+#include  // Global ES Xover
+#include  // 2-parents ES Xover
+
+// the ES-mutations
+#include 
+#include 
+
+#endif
diff --git a/trunk/paradiseo-eo/src/es/.cvsignore b/trunk/paradiseo-eo/src/es/.cvsignore
new file mode 100644
index 000000000..69fb0bd82
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/.cvsignore
@@ -0,0 +1,6 @@
+*.lo
+*.la
+.deps
+.libs
+Makefile
+Makefile.in
diff --git a/trunk/paradiseo-eo/src/es/CMAParams.cpp b/trunk/paradiseo-eo/src/es/CMAParams.cpp
new file mode 100644
index 000000000..1ded097db
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/CMAParams.cpp
@@ -0,0 +1,234 @@
+
+/*
+ * C++ification of Nikolaus Hansen's original C-source code for the
+ * CMA-ES
+ *
+ * C++-ificiation performed by Maarten Keijzer (C) 2005. Licensed under
+ * the LGPL. Original copyright of Nikolaus Hansen can be found below
+ *
+ *
+ * 
+ */
+
+/* --------------------------------------------------------- */
+/* --------------------------------------------------------- */
+/* --- File: cmaes.c  -------- Author: Nikolaus Hansen   --- */
+/* --------------------------------------------------------- */
+/*
+ *      CMA-ES for non-linear function minimization.
+ *
+ *           Copyright (C) 1996, 2003  Nikolaus Hansen.
+ *           e-mail: hansen@bionik.tu-berlin.de
+ *
+ *           This library is free software; you can redistribute it and/or
+ *           modify it under the terms of the GNU Lesser General Public
+ *           License as published by the Free Software Foundation; either
+ *           version 2.1 of the License, or (at your option) any later
+ *           version (see http://www.gnu.org/copyleft/lesser.html).
+ *
+ *           This library is distributed in the hope that it will be useful,
+ *           but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *           MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ *           Lesser General Public License for more details.
+ * 
+ *                                                             */
+/* --- Changes : ---
+ *   03/03/21: argument const double *rgFunVal of
+ *   cmaes_ReestimateDistribution() was treated incorrectly.
+ *   03/03/29: restart via cmaes_resume_distribution() implemented.
+ *   03/03/30: Always max std dev / largest axis is printed first.
+ *   03/08/30: Damping is adjusted for large mueff.
+ *   03/10/30: Damping is adjusted for large mueff always.
+ *   04/04/22: Cumulation time and damping for step size adjusted.
+ *   No iniphase but conditional update of pc.
+ *   Version 2.23.
+ *                               */
+
+#include 
+#include 
+
+#include 
+
+using namespace std;
+
+namespace eo {
+
+CMAParams::CMAParams(eoParser& parser, unsigned dimensionality) {
+    
+    string section = "CMA parameters";
+    
+    n = parser.createParam(dimensionality, "dimensionality", "Dimensionality (N) of the problem", 'N', section, dimensionality == 0).value();
+    
+    maxgen = parser.createParam(
+	    1000,
+	    "max-gen",
+	    "Maximum number of generations that the system will run (needed for damping)",
+	    'M',
+	    section).value();
+    
+    
+    if (n == 0) {
+	return;
+    }
+    
+    defaults(n, maxgen);
+    
+    /* handle lambda */
+    lambda = parser.createParam(
+	    lambda,
+	    "lambda",
+	    "Number of offspring",
+	    'l',
+	    section).value();
+
+    if (lambda < 2) {
+	lambda = 4+(int)(3*log((double) n));
+	cerr << "Too small lambda specified, setting it to " << lambda << endl;
+    }
+    
+    /* handle mu */
+    mu = parser.createParam(
+	    mu,
+	    "mu",
+	    "Population size",
+	    'm',
+	    section).value();
+
+    if (mu >= lambda) {
+	mu = lambda/2;
+	cerr << "Mu set larger/equal to lambda, setting it to " << mu << endl;
+    }
+    
+    /* handle selection weights */
+    
+    int weight_type = parser.createParam(
+	    0,
+	    "weighting",
+	    "Weighting scheme (for 'selection'): 0 = logarithmic, 1 = equal, 2 = linear",
+	    'w',
+	    section).value();
+
+    switch (weight_type) {
+	case 1: 
+	    {
+		for (unsigned i = 0; i < weights.size(); ++i) {
+		    weights[i] = mu - i;
+		}
+	    }
+	case 2:
+	    {
+		weights = 1.;
+	    }
+	default : 
+	    {
+		for (unsigned i = 0; i < weights.size(); ++i) {
+		    weights[i] = log(mu+1.)-log(i+1.);
+		}
+	    }
+	
+    }
+
+    /* Normalize weights and set mu_eff */
+    double sumw = weights.sum();
+    mueff =  sumw * sumw / (weights * weights).sum();
+    weights /= sumw;
+    
+
+    /* most of the rest depends on mu_eff, so needs to be set again */
+    
+    /* set the others using Nikolaus logic. If you want to tweak, you can parameterize over these defaults */
+    mucov = mueff;
+    ccumsig = (mueff + 2.) / (n + mueff + 3.);
+    ccumcov = 4. / (n + 4);
+    
+    double t1 = 2. / ((n+1.4142)*(n+1.4142));
+    double t2 = (2.*mucov-1.) / ((n+2.)*(n+2.)+mucov);
+    t2 = (t2 > 1) ? 1 : t2;
+    t2 = (1./mucov) * t1 + (1.-1./mucov) * t2;
+    
+    ccov = t2;
+
+    damp = 1 + std::max(0.3,(1.-(double)n/(double)maxgen))
+	      * (1+2*std::max(0.,sqrt((mueff-1.)/(n+1.))-1)) /* limit sigma increase */
+	            / ccumsig;
+  
+    vector mins(1,0.0);
+    mins = parser.createParam(
+	    mins,
+	    "min-stdev",
+	    "Array of minimum stdevs, last one will apply for all remaining axes",
+	    0,
+	    section).value();
+    
+    if (mins.size() > n) mins.resize(n);
+
+    if (mins.size()) {
+	minStdevs = mins.back();
+	for (unsigned i = 0; i < mins.size(); ++i) {
+	    minStdevs[i] = mins[i];
+	}
+    }
+    
+    vector inits(1,0.3);
+    inits = parser.createParam(
+	    inits,
+	    "init-stdev",
+	    "Array of initial stdevs, last one will apply for all remaining axes",
+	    0,
+	    section).value();
+    
+    if (inits.size() > n) inits.resize(n);
+
+    if (inits.size()) {
+	initialStdevs = inits.back();
+	for (unsigned i = 0; i < inits.size(); ++i) {
+	    initialStdevs[i] = inits[i];
+	}
+    }
+    
+}
+
+void CMAParams::defaults(unsigned n_, unsigned maxgen_) {
+    n = n_;
+    maxgen = maxgen_;
+
+    lambda = 4+(int)(3*log((double) n));
+    mu = lambda / 2;
+    
+    weights.resize(mu);
+    
+    for (unsigned i = 0; i < weights.size(); ++i) {
+	weights[i] = log(mu+1.)-log(i+1.);
+    }
+    
+    /* Normalize weights and set mu_eff */
+    double sumw = weights.sum();
+    mueff =  sumw * sumw / (weights * weights).sum();
+    weights /= sumw;
+    
+    mucov = mueff;
+    ccumsig *= (mueff + 2.) / (n + mueff + 3.);
+    ccumcov = 4. / (n + 4);
+    
+    double t1 = 2. / ((n+1.4142)*(n+1.4142));
+    double t2 = (2.*mucov-1.) / ((n+2.)*(n+2.)+mucov);
+    t2 = (t2 > 1) ? 1 : t2;
+    t2 = (1./mucov) * t1 + (1.-1./mucov) * t2;
+    
+    ccov = t2;
+
+    damp = 1 + std::max(0.3,(1.-(double)n/maxgen))
+	      * (1+2*std::max(0.,sqrt((mueff-1.)/(n+1.))-1)) /* limit sigma increase */
+	            / ccumsig;
+
+    minStdevs.resize(n);
+    minStdevs = 0.0;
+    
+    initialStdevs.resize(n);
+    initialStdevs = 0.3;
+    
+
+}
+
+
+}// namespace eo
diff --git a/trunk/paradiseo-eo/src/es/CMAParams.h b/trunk/paradiseo-eo/src/es/CMAParams.h
new file mode 100644
index 000000000..f59d6c929
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/CMAParams.h
@@ -0,0 +1,52 @@
+/*
+ * C++ification of Nikolaus Hansen's original C-source code for the
+ * CMA-ES. 
+ *
+ * Copyright (C) 1996, 2003, Nikolaus Hansen
+ *	     (C) 2005, Maarten Keijzer
+ *
+ * License: LGPL 
+ * 
+ */
+
+#ifndef CMAPARAMS_H__
+#define CMAPARAMS_H__
+
+#include 
+
+class eoParser;
+namespace eo {
+
+class CMAParams {
+   
+    public:
+    
+    CMAParams() { /* Call this and all values need to be set by hand */ }
+    CMAParams(eoParser& parser, unsigned dimensionality = 0); // 0 dimensionality -> user needs to set it
+ 
+    void defaults(unsigned n_, unsigned maxgen_); /* apply all defaults using n and maxgen */
+    
+    unsigned n;
+    unsigned maxgen;
+   
+    unsigned lambda;          /* -> mu */
+    unsigned mu;              /* -> weights, lambda */
+    
+    std::valarray weights;     /* <- mu, -> mueff -> mucov -> ccov */
+    double mueff;	/* <- weights */
+    
+    double mucov;
+    
+    double damp;         /* <- ccumsig, maxeval, lambda */
+    double ccumsig;      /* -> damp, <- N */
+    double ccumcov;
+    double ccov;         /* <- mucov, N */
+
+    std::valarray minStdevs;     /* Minimum standard deviations per coordinate (default = 0.0) */
+    std::valarray initialStdevs; /* Initial standard deviations per coordinate (default = 0.3) */
+};
+
+} // namespace eo
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/es/CMAState.cpp b/trunk/paradiseo-eo/src/es/CMAState.cpp
new file mode 100644
index 000000000..f44fdf5d7
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/CMAState.cpp
@@ -0,0 +1,365 @@
+/*
+ * C++ification of Nikolaus Hansen's original C-source code for the
+ * CMA-ES
+ *
+ * C++-ificiation performed by Maarten Keijzer (C) 2005. Licensed under
+ * the LGPL. Original copyright of Nikolaus Hansen can be found below
+ *
+ *
+ * Some changes have been made to the original flow and logic of the
+ * algorithm:
+ *
+ *	- Numerical issues are now treated 'before' going into the eigenvector decomposition
+ *	    (this was done out of convenience)
+ *	- dMaxSignifiKond (smallest x such that x == x + 1.0) replaced by
+ *	  numeric_limits::epsilon() (smallest x such that 1.0 != 1.0 + x)
+ *	  
+ * 
+ */
+
+/* --------------------------------------------------------- */
+/* --------------------------------------------------------- */
+/* --- File: cmaes.c  -------- Author: Nikolaus Hansen   --- */
+/* --------------------------------------------------------- */
+/*
+ *      CMA-ES for non-linear function minimization.
+ *
+ *           Copyright (C) 1996, 2003  Nikolaus Hansen.
+ *           e-mail: hansen@bionik.tu-berlin.de
+ *
+ *           This library is free software; you can redistribute it and/or
+ *           modify it under the terms of the GNU Lesser General Public
+ *           License as published by the Free Software Foundation; either
+ *           version 2.1 of the License, or (at your option) any later
+ *           version (see http://www.gnu.org/copyleft/lesser.html).
+ *
+ *           This library is distributed in the hope that it will be useful,
+ *           but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *           MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ *           Lesser General Public License for more details.
+ * 
+ *                                                             */
+/* --- Changes : ---
+ *   03/03/21: argument const double *rgFunVal of
+ *   cmaes_ReestimateDistribution() was treated incorrectly.
+ *   03/03/29: restart via cmaes_resume_distribution() implemented.
+ *   03/03/30: Always max std dev / largest axis is printed first.
+ *   03/08/30: Damping is adjusted for large mueff.
+ *   03/10/30: Damping is adjusted for large mueff always.
+ *   04/04/22: Cumulation time and damping for step size adjusted.
+ *   No iniphase but conditional update of pc.
+ *   Version 2.23.
+ *                               */
+
+#include 
+#include 
+#include 
+#include 
+
+#include 
+
+#include 
+#include 
+#include 
+#include 
+
+using namespace std;
+
+namespace eo {
+    
+struct CMAStateImpl {
+    
+    CMAParams p;
+    
+    lower_triangular_matrix	C; // Covariance matrix
+    square_matrix		B; // Eigen vectors (in columns)
+    valarray		d; // eigen values (diagonal matrix)
+    valarray		pc; // Evolution path
+    valarray		ps; // Evolution path for stepsize;
+    
+    vector		mean; // current mean to sample around
+    double			sigma; // global step size
+   
+    unsigned			gen;
+    vector		fitnessHistory;
+    
+    
+    CMAStateImpl(const CMAParams& params_, const vector& m, double sigma_) :
+	p(params_),
+	C(p.n), B(p.n), d(p.n), pc(p.n), ps(p.n), mean(m), sigma(sigma_),
+	gen(0), fitnessHistory(3)
+    {
+	double trace = (p.initialStdevs * p.initialStdevs).sum();
+	/* Initialize covariance structure */
+	for (unsigned i = 0; i < p.n; ++i)
+	{
+	    B[i][i] = 1.;
+	    d[i] = p.initialStdevs[i] * sqrt(p.n / trace);
+	    C[i][i] = d[i] * d[i];
+	    pc[i] = 0.;
+	    ps[i] = 0.;
+	}
+	 
+    }
+
+    void sample(vector& v) {
+	unsigned n = p.n;
+	v.resize(n);
+	
+	vector tmp(n);
+	for (unsigned i = 0; i < n; ++i)
+	    tmp[i] = d[i] * rng.normal();
+	
+	/* add mutation (sigma * B * (D*z)) */
+	for (unsigned i = 0; i < n; ++i) {
+	    double sum = 0;
+	    for (unsigned j = 0; j < n; ++j) {
+		sum += B[i][j] * tmp[j];
+	    }
+	    v[i] = mean[i] + sigma * sum;
+	}
+    }
+    
+    void reestimate(const vector* >& pop, double muBest, double muWorst) {
+	
+	assert(pop.size() == p.mu);
+	
+	unsigned n = p.n;
+
+	fitnessHistory[gen % fitnessHistory.size()] = muBest; // needed for divergence check
+	
+	vector oldmean = mean;
+	valarray BDz(n);
+	
+	/* calculate xmean and rgBDz~N(0,C) */
+	for (unsigned i = 0; i < n; ++i) {
+	    mean[i] = 0.;
+	    for (unsigned j = 0; j < pop.size(); ++j) {
+		mean[i] += p.weights[j] * (*pop[j])[i]; 
+	    }
+	    BDz[i] = sqrt(p.mueff)*(mean[i] - oldmean[i])/sigma; 
+	}
+
+	vector tmp(n);
+	/* calculate z := D^(-1) * B^(-1) * rgBDz into rgdTmp */
+	for (unsigned i = 0; i < n; ++i) {
+	    double sum = 0.0;
+	    for (unsigned j = 0; j < n; ++j) {
+		sum += B[j][i] * BDz[j];
+	    }
+	    tmp[i] = sum / d[i];
+	}
+
+	/* cumulation for sigma (ps) using B*z */
+	for (unsigned i = 0; i < n; ++i) {
+	    double sum = 0.0;
+	    for (unsigned j = 0; j < n; ++j)
+		sum += B[i][j] * tmp[j];
+	    
+	    ps[i] = (1. - p.ccumsig) * ps[i] + sqrt(p.ccumsig * (2. - p.ccumsig)) * sum;
+	}
+
+	/* calculate norm(ps)^2 */
+	double psxps = (ps * ps).sum();
+
+	
+	double chiN =  sqrt((double) p.n) * (1. - 1./(4.*p.n) + 1./(21.*p.n*p.n));
+	/* cumulation for covariance matrix (pc) using B*D*z~N(0,C) */
+	double hsig = sqrt(psxps) / sqrt(1. - pow(1.-p.ccumsig, 2.*gen)) / chiN < 1.5 + 1./(p.n-0.5);
+	
+	pc = (1. - p.ccumcov) * pc + hsig * sqrt(p.ccumcov * (2. - p.ccumcov)) * BDz;
+	
+	/* stop initial phase (MK, this was not reachable in the org code, deleted) */
+
+	/* remove momentum in ps, if ps is large and fitness is getting worse */
+
+	if (gen >= fitnessHistory.size()) {
+
+	    // find direction from muBest and muWorst (muBest == muWorst handled seperately
+	    double direction = muBest < muWorst? -1.0 : 1.0;
+	    
+	    unsigned now = gen % fitnessHistory.size();
+	    unsigned prev = (gen-1) % fitnessHistory.size();
+	    unsigned prevprev = (gen-2) % fitnessHistory.size();
+
+	    bool fitnessWorsens = (muBest == muWorst) || // <- increase norm also when population has converged (this deviates from Hansen's scheme)
+			    ( (direction * fitnessHistory[now] < direction * fitnessHistory[prev])
+					    &&
+			      (direction * fitnessHistory[now] < direction * fitnessHistory[prevprev]));
+	
+	    if(psxps/p.n > 1.5 + 10.*sqrt(2./p.n) && fitnessWorsens) {
+		double tfac = sqrt((1 + std::max(0., log(psxps/p.n))) * p.n / psxps);
+		ps	    *= tfac;
+		psxps   *= tfac*tfac; 
+	    }
+	}
+
+	/* update of C  */
+	/* Adapt_C(t); not used anymore */
+	if (p.ccov != 0.) {
+	    //flgEigensysIsUptodate = 0;
+
+	    /* update covariance matrix */
+	    for (unsigned i = 0; i < n; ++i) {
+		vector::iterator c_row = C[i];
+		for (unsigned j = 0; j <= i; ++j) {
+		    c_row[j] = 
+				(1 - p.ccov) * c_row[j]
+					+
+				p.ccov * (1./p.mucov) * pc[i] * pc[j]
+					+
+				(1-hsig) * p.ccumcov * (2. - p.ccumcov) * c_row[j];
+		    
+		    /*C[i][j] = (1 - p.ccov) * C[i][j] 
+			+ sp.ccov * (1./sp.mucov) 
+			* (rgpc[i] * rgpc[j] 
+				+ (1-hsig)*sp.ccumcov*(2.-sp.ccumcov) * C[i][j]); */
+		    for (unsigned k = 0; k < p.mu; ++k) { /* additional rank mu update */
+			c_row[j] += p.ccov * (1-1./p.mucov) * p.weights[k]  
+			    * ( (*pop[k])[i] - oldmean[i])
+			    * ( (*pop[k])[j] - oldmean[j])
+			    / sigma / sigma;
+		    
+			   // * (rgrgx[index[k]][i] - rgxold[i]) 
+			   // * (rgrgx[index[k]][j] - rgxold[j])
+			   // / sigma / sigma; 
+		    }
+		}
+	    }
+	}
+
+	/* update of sigma */
+	sigma *= exp(((sqrt(psxps)/chiN)-1.)/p.damp);
+	/* calculate eigensystem, must be done by caller  */
+	//cmaes_UpdateEigensystem(0);
+
+	
+	/* treat minimal standard deviations and numeric problems 
+	 * Note that in contrast with the original code, some numerical issues are treated *before* we 
+	 * go into the eigenvalue calculation */
+	
+	treatNumericalIssues(muBest, muWorst);
+
+	gen++; // increase generation
+    }
+
+    void treatNumericalIssues(double best, double worst) {
+	
+	/* treat stdevs */
+	for (unsigned i = 0; i < p.n; ++i) {
+	    if (sigma * sqrt(C[i][i]) < p.minStdevs[i]) {
+		// increase stdev
+		sigma *= exp(0.05+1./p.damp);
+		break;
+	    }
+	}
+	
+	/* treat convergence */
+	if (best == worst) {
+	    sigma *= exp(0.2 + 1./p.damp);
+	}
+	
+	/* Jede Hauptachse i testen, ob x == x + 0.1 * sigma * rgD[i] * B[i] */
+	/* Test if all the means are not numerically out of whack with our coordinate system*/
+	for (unsigned axis = 0; axis < p.n; ++axis) {
+	    double fac = 0.1 * sigma * d[axis];
+	    unsigned coord;
+	    for (coord = 0; coord < p.n; ++coord) {
+		if (mean[coord] != mean[coord] + fac * B[coord][axis]) {
+		    break;
+		}
+	    }
+
+	    if (coord == p.n) { // means are way too big (little) for numerical accuraccy. Start rocking the craddle a bit more
+		sigma *= exp(0.2+1./p.damp);
+	    }
+	    
+	}
+	    
+	/* Testen ob eine Komponente des Objektparameters festhaengt */
+	/* Correct issues with scale between objective values and covariances */
+	bool theresAnIssue = false;
+
+	for (unsigned i = 0; i < p.n; ++i) {
+	    if (mean[i] == mean[i] + 0.2 * sigma * sqrt(C[i][i])) {
+		C[i][i] *= (1. + p.ccov);
+		theresAnIssue = true;
+	    }
+	}
+
+	if (theresAnIssue) {
+	    sigma *= exp(0.05 + 1./p.damp);
+	}
+    }
+
+    
+    bool updateEigenSystem(unsigned max_tries, unsigned max_iters) {
+
+	if (max_iters==0) max_iters = 30 * p.n;
+	
+	static double lastGoodMinimumEigenValue = 1.0;
+	
+	/* Try to get a valid calculation */
+	for (unsigned tries = 0; tries < max_tries; ++tries) {
+	     
+	    unsigned iters = eig( p.n, C, d, B, max_iters); 
+	    if (iters < max_iters) 
+	    { // all is well
+		
+		/* find largest/smallest eigenvalues */
+		double minEV = d.min(); 
+		double maxEV = d.max(); 
+
+		/* (MK Original comment was) :Limit Condition of C to dMaxSignifKond+1 
+		 * replaced dMaxSignifKond with 1./numeric_limits::epsilon()
+		 * */
+		if (maxEV * numeric_limits::epsilon() > minEV) {
+		    double tmp = maxEV * numeric_limits::epsilon() - minEV;
+		    minEV += tmp;
+		    for (unsigned i=0;i& initial_point, const double initial_sigma) 
+    : pimpl(new CMAStateImpl(params, initial_point, initial_sigma)) {}
+
+CMAState::~CMAState() { delete pimpl; }
+CMAState::CMAState(const CMAState& that) : pimpl(new CMAStateImpl(*that.pimpl )) {}
+CMAState& CMAState::operator=(const CMAState& that) { *pimpl = *that.pimpl; return *this; }
+
+void CMAState::sample(vector& v) const {  pimpl->sample(v); }
+
+void CMAState::reestimate(const vector* >& population, double muBest, double muWorst) { pimpl->reestimate(population, muBest, muWorst); }
+bool CMAState::updateEigenSystem(unsigned max_tries, unsigned max_iters) { return pimpl->updateEigenSystem(max_tries, max_iters); }
+
+
+} // namespace eo
+
diff --git a/trunk/paradiseo-eo/src/es/CMAState.h b/trunk/paradiseo-eo/src/es/CMAState.h
new file mode 100644
index 000000000..505a31b71
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/CMAState.h
@@ -0,0 +1,79 @@
+
+/*
+ * C++ification of Nikolaus Hansen's original C-source code for the
+ * CMA-ES. 
+ *
+ * Copyright (C) 1996, 2003, Nikolaus Hansen
+ *	     (C) 2005, Maarten Keijzer
+ *
+ * License: LGPL (see source file)
+ * 
+ */
+
+#ifndef CMASTATE_H_
+#define CMASTATE_H_
+
+#include 
+#include 
+
+namespace eo {
+    
+
+class CMAStateImpl;
+class CMAParams;
+class CMAState {
+    
+    CMAStateImpl* pimpl; /* pointer to implementation, hidden in source file */
+    
+    public:
+
+    CMAState(const CMAParams&, const std::vector& initial_point, const double initial_sigma = 1.0);
+    ~CMAState();
+    CMAState(const CMAState&);
+    CMAState& operator=(const CMAState&);
+
+    /**
+     *	sample a vector from the distribution
+     *
+     *	 If the sample is not to your liking (i.e., not within bounds)
+     *	 you can do one of two things:
+     *
+     *	 a) Call sample again
+     *	 b) multiply the entire vector with a number between -1 and 1
+     *	 
+     *	 Do not modify the sample in any other way as this will invalidate the 
+     *	 internal consistency of the system.
+     *
+     *	 A final approach is to copy the sample and modify the copy externally (in the evaluation function)
+     *	 and possibly add a penalty depending on the size of the modification.
+     *
+     */
+    void sample(std::vector& v) const;
+    
+    /**
+     * Reestimate covariance matrix and other internal parameters
+     * Does NOT update the eigen system (call that seperately)
+     *
+     * Needs a population of mu individuals, sorted on fitness, plus
+     *
+     * muBest:	 the best fitness in the population
+     * muWorst:  the worst fitness in the population
+     */
+    
+    void reestimate(const std::vector* >& sorted_population, double muBest, double muWorst);
+    
+    /** 
+     * call this function after reestimate in order to update the eigen system
+     * It is a seperate call to allow the user to periodically skip this expensive step
+     *
+     * max_iters = 0 implies 30 * N iterations
+     *
+     * If after max_tries still no numerically sound eigen system is constructed,
+     * the function returns false
+     */
+    bool updateEigenSystem(unsigned max_tries = 1, unsigned max_iters = 0);  
+};
+
+} // namespace eo
+
+#endif
diff --git a/trunk/paradiseo-eo/src/es/CVS/Entries b/trunk/paradiseo-eo/src/es/CVS/Entries
new file mode 100644
index 000000000..0bc339c14
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/CVS/Entries
@@ -0,0 +1,46 @@
+/.cvsignore/1.1/Mon Apr  3 09:32:06 2000//
+/CMAParams.cpp/1.3/Mon Mar  6 20:47:28 2006//
+/CMAParams.h/1.3/Mon Mar  6 20:47:28 2006//
+/CMAState.cpp/1.1/Fri Oct 14 15:33:32 2005//
+/CMAState.h/1.1/Fri Oct 14 15:33:32 2005//
+/Makefile.am/1.25/Fri Oct 14 15:33:32 2005//
+/eig.cpp/1.1/Fri Oct 14 15:33:32 2005//
+/eig.h/1.1/Fri Oct 14 15:33:32 2005//
+/eoCMABreed.h/1.2/Fri Oct 14 16:14:37 2005//
+/eoCMAInit.h/1.1/Fri Oct 14 15:33:32 2005//
+/eoEsChromInit.h/1.15/Mon Mar 27 18:55:19 2006//
+/eoEsFull.h/1.11/Mon Mar 27 18:55:19 2006//
+/eoEsGlobalXover.h/1.3/Tue Sep 27 21:54:05 2005//
+/eoEsMutate.h/1.12/Wed Sep 28 14:32:12 2005//
+/eoEsMutationInit.h/1.8/Wed Sep 28 21:56:51 2005//
+/eoEsSimple.h/1.7/Mon Oct 10 21:13:27 2005//
+/eoEsStandardXover.h/1.3/Thu Feb 27 19:25:05 2003//
+/eoEsStdev.h/1.12/Mon Mar 27 18:55:20 2006//
+/eoNormalMutation.h/1.10/Thu Dec 23 15:29:06 2004//
+/eoReal.h/1.6/Thu Feb 27 19:25:04 2003//
+/eoRealAtomXover.h/1.3/Thu Feb 27 19:25:03 2003//
+/eoRealInitBounded.h/1.4/Thu Feb 27 19:25:03 2003//
+/eoRealOp.h/1.19/Wed Dec  7 15:40:23 2005//
+/eoSBXcross.h/1.3/Wed Jun 23 23:19:17 2004//
+/make_algo_scalar_es.cpp/1.5/Fri Oct 14 15:33:32 2005//
+/make_algo_scalar_real.cpp/1.5/Tue May 25 08:03:29 2004//
+/make_checkpoint_es.cpp/1.3/Sat Nov 10 06:59:02 2001//
+/make_checkpoint_real.cpp/1.4/Sat Nov 10 06:59:02 2001//
+/make_continue_es.cpp/1.2/Sat Nov 10 06:59:02 2001//
+/make_continue_real.cpp/1.3/Sat Nov 10 06:59:02 2001//
+/make_es.h/1.4/Tue May 25 08:03:29 2004//
+/make_genotype_es.cpp/1.5/Mon Oct 10 21:59:57 2005//
+/make_genotype_real.cpp/1.7/Mon Sep 12 17:53:25 2005//
+/make_genotype_real.h/1.13/Wed Dec  7 15:40:23 2005//
+/make_op.h/1.5/Mon Sep 12 17:53:25 2005//
+/make_op_es.cpp/1.3/Sat Nov 10 06:59:02 2001//
+/make_op_es.h/1.9/Mon Oct 10 21:59:57 2005//
+/make_op_real.cpp/1.4/Sat Nov 10 06:59:02 2001//
+/make_op_real.h/1.8/Mon Sep 12 17:53:25 2005//
+/make_pop_es.cpp/1.2/Sat Nov 10 06:59:02 2001//
+/make_pop_real.cpp/1.3/Sat Nov 10 06:59:02 2001//
+/make_real.h/1.5/Tue May 25 08:03:29 2004//
+/make_run_es.cpp/1.2/Sat Nov 10 06:59:02 2001//
+/make_run_real.cpp/1.3/Sat Nov 10 06:59:02 2001//
+/matrices.h/1.1/Fri Oct 14 15:33:32 2005//
+D
diff --git a/trunk/paradiseo-eo/src/es/CVS/Repository b/trunk/paradiseo-eo/src/es/CVS/Repository
new file mode 100644
index 000000000..d3cc3d20f
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/CVS/Repository
@@ -0,0 +1 @@
+eo/src/es
diff --git a/trunk/paradiseo-eo/src/es/CVS/Root b/trunk/paradiseo-eo/src/es/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/src/es/Makefile.am b/trunk/paradiseo-eo/src/es/Makefile.am
new file mode 100644
index 000000000..6a4b827da
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/Makefile.am
@@ -0,0 +1,54 @@
+## Makefile.am for eo/src/es
+
+lib_LIBRARIES 		= libes.a libcma.a
+
+libes_a_SOURCES 	= make_algo_scalar_es.cpp \
+			make_algo_scalar_real.cpp \
+			make_checkpoint_es.cpp \
+			make_checkpoint_real.cpp \
+			make_continue_es.cpp \
+			make_continue_real.cpp \
+			make_genotype_es.cpp \
+			make_genotype_real.cpp \
+			make_op_es.cpp \
+			make_op_real.cpp \
+			make_pop_es.cpp \
+			make_pop_real.cpp \
+			make_run_es.cpp \
+			make_run_real.cpp
+
+esincludedir		= $(pkgincludedir)/es
+
+esinclude_HEADERS 	= eoEsChromInit.h \
+			eoEsFull.h \
+			eoEsGlobalXover.h \
+			eoEsMutate.h \
+			eoEsMutationInit.h \
+			eoEsSimple.h \
+			eoEsStandardXover.h \
+			eoEsStdev.h \
+			eoNormalMutation.h \
+			eoRealAtomXover.h \
+			eoReal.h \
+			eoRealInitBounded.h \
+			eoRealOp.h \
+			eoSBXcross.h \
+			make_es.h \
+			make_genotype_real.h \
+			make_op_es.h \
+			make_op.h \
+			make_op_real.h \
+			make_real.h
+
+libcma_a_SOURCES	= eig.cpp \
+			CMAState.cpp \
+			CMAParams.cpp
+
+cmaincludedir		= $(pkgincludedir)/es
+
+cmainclude_HEADERS	= eig.h \
+			CMAState.h \
+			matrices.h \
+			CMAParams.h 
+
+AM_CXXFLAGS		= -I$(top_srcdir)/src
diff --git a/trunk/paradiseo-eo/src/es/eig.cpp b/trunk/paradiseo-eo/src/es/eig.cpp
new file mode 100644
index 000000000..29998bcbb
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/eig.cpp
@@ -0,0 +1,259 @@
+
+/*
+ * C++ification of Nikolaus Hansen's original C-source code for the
+ * CMA-ES. These are the eigenvector calculations
+ *
+ * C++-ificiation performed by Maarten Keijzer (C) 2005. Licensed under
+ * the LGPL. Original copyright of Nikolaus Hansen can be found below
+ *
+ * This algorithm is held almost completely intact. Some other datatypes are used,
+ * but hardly any code has changed
+ * 
+ */
+
+/* --------------------------------------------------------- */
+/* --------------------------------------------------------- */
+/* --- File: cmaes.c  -------- Author: Nikolaus Hansen   --- */
+/* --------------------------------------------------------- */
+/*
+ *      CMA-ES for non-linear function minimization.
+ *
+ *           Copyright (C) 1996, 2003  Nikolaus Hansen.
+ *           e-mail: hansen@bionik.tu-berlin.de
+ *
+ *           This library is free software; you can redistribute it and/or
+ *           modify it under the terms of the GNU Lesser General Public
+ *           License as published by the Free Software Foundation; either
+ *           version 2.1 of the License, or (at your option) any later
+ *           version (see http://www.gnu.org/copyleft/lesser.html).
+ *
+ *           This library is distributed in the hope that it will be useful,
+ *           but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *           MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ *           Lesser General Public License for more details.
+ * 
+ *                                                             */
+/* --- Changes : ---
+ *   03/03/21: argument const double *rgFunVal of
+ *   cmaes_ReestimateDistribution() was treated incorrectly.
+ *   03/03/29: restart via cmaes_resume_distribution() implemented.
+ *   03/03/30: Always max std dev / largest axis is printed first.
+ *   03/08/30: Damping is adjusted for large mueff.
+ *   03/10/30: Damping is adjusted for large mueff always.
+ *   04/04/22: Cumulation time and damping for step size adjusted.
+ *   No iniphase but conditional update of pc.
+ *   Version 2.23.
+ *                               */
+#include "eig.h"
+
+using namespace std;
+
+/* ========================================================= */
+/* 
+   Householder Transformation einer symmetrischen Matrix
+   auf tridiagonale Form.
+   -> n             : Dimension
+   -> ma            : symmetrische nxn-Matrix
+   <- ma            : Transformationsmatrix (ist orthogonal): 
+                      Tridiag.-Matrix == <-ma * ->ma * (<-ma)^t
+   <- diag          : Diagonale der resultierenden Tridiagonalmatrix
+   <- neben[0..n-1] : Nebendiagonale (==1..n-1) der res. Tridiagonalmatrix
+
+   */
+static void 
+Householder( int N, square_matrix& ma, valarray& diag, double* neben)
+{
+  double epsilon; 
+  int i, j, k;
+  double h, sum, tmp, tmp2;
+
+  for (i = N-1; i > 0; --i)
+  {
+    h = 0.0;
+    if (i == 1)
+      neben[i] = ma[i][i-1];
+    else
+    {
+      for (k = i-1, epsilon = 0.0; k >= 0; --k)
+        epsilon += fabs(ma[i][k]);
+
+      if (epsilon == 0.0)
+        neben[i] = ma[i][i-1];
+      else
+      {
+        for(k = i-1, sum = 0.0; k >= 0; --k)
+	{ /* i-te Zeile von i-1 bis links normieren */
+          ma[i][k] /= epsilon;
+	  sum += ma[i][k]*ma[i][k];
+	} 
+	tmp = (ma[i][i-1] > 0) ? -sqrt(sum) : sqrt(sum);
+	neben[i] = epsilon*tmp;
+	h = sum - ma[i][i-1]*tmp;
+	ma[i][i-1] -= tmp;
+	for (j = 0, sum = 0.0; j < i; ++j)
+	{
+	  ma[j][i] = ma[i][j]/h;
+	  tmp = 0.0;
+	  for (k = j; k >= 0; --k)
+	    tmp += ma[j][k]*ma[i][k];
+	  for (k = j+1; k < i; ++k)
+	    tmp += ma[k][j]*ma[i][k];
+	  neben[j] = tmp/h;
+	  sum += neben[j] * ma[i][j];
+	} /* for j */
+	sum /= 2.*h;
+	for (j = 0; j < i; ++j)
+	{
+	  neben[j] -= ma[i][j]*sum;
+	  tmp = ma[i][j];
+	  tmp2 = neben[j];
+	  for (k = j; k >= 0; --k)
+	    ma[j][k] -= (tmp*neben[k] + tmp2*ma[i][k]);
+	} /* for j */
+      } /* else epsilon */
+    } /* else i == 1 */
+    diag[i] = h;
+  } /* for i */
+
+  diag[0] = 0.0;
+  neben[0] = 0.0;
+  
+  for (i = 0; i < N; ++i)
+  {
+    if(diag[i] != 0.0)
+      for (j = 0; j < i; ++j)
+      {
+	for (k = i-1, tmp = 0.0; k >= 0; --k)
+	  tmp += ma[i][k] * ma[k][j];
+        for (k = i-1; k >= 0; --k)
+	  ma[k][j] -= tmp*ma[k][i];
+      } /* for j   */
+    diag[i] = ma[i][i];
+    ma[i][i] = 1.0;
+    for (k = i-1; k >= 0; --k)
+      ma[k][i] = ma[i][k] = 0.0;
+  } /* for i */
+}
+
+/*
+  QL-Algorithmus mit implizitem Shift, zur Berechnung von Eigenwerten
+  und -vektoren einer symmetrischen Tridiagonalmatrix. 
+  -> n     : Dimension. 
+  -> diag        : Diagonale der Tridiagonalmatrix. 
+  -> neben[0..n-1] : Nebendiagonale (==0..n-2), n-1. Eintrag beliebig
+  -> mq    : Matrix output von Householder() 
+  -> maxIt : maximale Zahl der Iterationen 
+  <- diag  : Eigenwerte
+  <- neben : Garbage
+  <- mq    : k-te Spalte ist normalisierter Eigenvektor zu diag[k]
+
+  */
+
+static int 
+QLalgo( int N, valarray& diag, square_matrix& mq, 
+	int maxIter, double* neben)
+{
+  int i, j, k, kp1, l;
+  double tmp, diff, cneben, c1, c2, p;
+  int iter;
+
+  neben[N-1] = 0.0;
+  for (i = 0, iter = 0; i < N && iter < maxIter; ++i)
+    do /* while j != i */
+    {
+      for (j = i; j < N-1; ++j)
+      {
+	tmp = fabs(diag[j]) + fabs(diag[j+1]);
+	if (fabs(neben[j]) + tmp == tmp)
+	  break;
+      }
+      if (j != i)
+      {
+	if (++iter > maxIter) return maxIter-1;
+	diff = (diag[i+1]-diag[i])/neben[i]/2.0;
+	if (diff >= 0)
+	  diff = diag[j] - diag[i] + 
+	    neben[i] / (diff + sqrt(diff * diff + 1.0));
+	else
+	  diff = diag[j] - diag[i] + 
+	    neben[i] / (diff - sqrt(diff * diff + 1.0));
+	c2 = c1 = 1.0;
+	p = 0.0;
+	for (k = j-1; k >= i; --k)
+	{
+	  kp1 = k + 1;
+	  tmp = c2 * neben[k];
+	  cneben = c1 * neben[k];
+	  if (fabs(tmp) >= fabs(diff))
+	  {
+	    c1 = diff / tmp;
+	    c2 = 1. / sqrt(c1*c1 + 1.0);
+	    neben[kp1] = tmp / c2;
+	    c1 *= c2;
+	  }
+	  else
+	  {
+	    c2 = tmp / diff;
+	    c1 = 1. / sqrt(c2*c2 + 1.0);
+	    neben[kp1] = diff / c1;
+	    c2 *= c1;
+	  } /* else */
+	  tmp = (diag[k] - diag[kp1] + p) * c2 + 2.0 * c1 * cneben;
+	  diag[kp1] += tmp * c2 - p;
+	  p = tmp * c2;
+	  diff = tmp * c1 - cneben;
+	  for (l = N-1; l >= 0; --l) /* TF-Matrix Q */
+	  { 
+	    tmp = mq[l][kp1];
+	    mq[l][kp1] = c2 * mq[l][k] + c1 * tmp;
+	    mq[l][k] = c1 * mq[l][k] - c2 * tmp;
+	  } /* for l */
+	} /* for k */
+	diag[i] -= p;
+	neben[i] = diff;
+	neben[j] = 0.0;
+      } /* if */
+    } while (j != i);
+  return iter;
+} /* QLalgo() */
+
+/* ========================================================= */
+/* 
+   Calculating eigenvalues and vectors. 
+   Input: 
+     N: dimension.
+     C: lower_triangular NxN-matrix.
+     niter: number of maximal iterations for QL-Algorithm. 
+     rgtmp: N+1-dimensional vector for temporal use. 
+   Output: 
+     diag: N eigenvalues.
+     Q: Columns are normalized eigenvectors.
+     return: number of iterations in QL-Algorithm.
+ */
+
+namespace eo {
+int 
+eig( int N,  const lower_triangular_matrix& C, valarray& diag, square_matrix& Q, 
+       int niter)
+{
+  int ret;
+  int i, j;
+
+  if (niter == 0) niter = 30*N;
+
+  for (i=0; i < N; ++i)
+  {
+      vector::const_iterator row = C[i];
+      for (j = 0; j <= i; ++j)
+	  Q[i][j] = Q[j][i] = row[j];
+  }
+  
+  double* rgtmp = new double[N+1];
+  Householder( N, Q, diag, rgtmp);
+  ret = QLalgo( N, diag, Q, niter, rgtmp+1);
+  delete [] rgtmp;
+  
+  return ret;
+}  
+
+} // namespace eo
diff --git a/trunk/paradiseo-eo/src/es/eig.h b/trunk/paradiseo-eo/src/es/eig.h
new file mode 100644
index 000000000..02aa36e0d
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/eig.h
@@ -0,0 +1,25 @@
+#ifndef EIG_H__
+#define EIG_H__
+
+#include 
+#include 
+
+namespace eo {
+/* ========================================================= */
+/* 
+   Calculating eigenvalues and vectors. 
+   Input: 
+     N: dimension.
+     C: lower_triangular NxN-matrix.
+     niter: number of maximal iterations for QL-Algorithm. 
+   Output: 
+     diag: N eigenvalues.
+     Q: Columns are normalized eigenvectors.
+     return: number of iterations in QL-Algorithm.
+ */
+extern int eig( int N,  const lower_triangular_matrix& C, std::valarray& diag, square_matrix& Q, 
+       int niter = 0);
+
+} // namespace eo
+
+#endif
diff --git a/trunk/paradiseo-eo/src/es/eoCMABreed.h b/trunk/paradiseo-eo/src/es/eoCMABreed.h
new file mode 100644
index 000000000..c210d299e
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/eoCMABreed.h
@@ -0,0 +1,77 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; fill-column: 80; -*-
+
+//-----------------------------------------------------------------------------
+// eoCMABreed
+// (c) Maarten Keijzer 2005
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+ */
+//-----------------------------------------------------------------------------
+
+
+#ifndef _EOCMABREED_H
+#define _EOCMABREED_H
+
+#include 
+#include 
+#include 
+
+#include 
+
+/// TODO, handle bounds
+template 
+class eoCMABreed : public eoBreed< eoVector > {
+    
+    eo::CMAState& state;
+    unsigned lambda;
+    
+    typedef eoVector EOT;
+    
+    public:
+    eoCMABreed(eo::CMAState& state_, unsigned lambda_) : state(state_), lambda(lambda_) {}
+    
+    void operator()(const eoPop& parents, eoPop& offspring) {
+	
+	// two temporary arrays of pointers to store the sorted population
+	std::vector sorted(parents.size());
+	std::vector* > mu(parents.size());
+	
+	parents.sort(sorted);
+	for (unsigned i = 0; i < sorted.size(); ++i) {
+	    mu[i] = static_cast< const std::vector* >( sorted[i] );
+	}
+	
+	// learn
+	
+	state.reestimate(mu, sorted[0]->fitness(), sorted.back()->fitness());
+	
+	if (!state.updateEigenSystem(10)) {
+	    std::cerr << "No good eigensystem found" << std::endl;
+	}
+	
+	// generate
+	offspring.resize(lambda);
+
+	for (unsigned i = 0; i < lambda; ++i) {
+	    state.sample( static_cast< std::vector& >( offspring[i] ));
+	    offspring[i].invalidate();
+	}
+	
+    }
+};
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/es/eoCMAInit.h b/trunk/paradiseo-eo/src/es/eoCMAInit.h
new file mode 100644
index 000000000..b605cd990
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/eoCMAInit.h
@@ -0,0 +1,54 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; fill-column: 80; -*-
+
+//-----------------------------------------------------------------------------
+// eoCMAInit 
+// (c) Maarten Keijzer 2005
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             marc.schoenauer@polytechnique.fr
+                       http://eeaax.cmap.polytchnique.fr/
+ */
+//-----------------------------------------------------------------------------
+
+
+#ifndef _EOCMAINIT_H
+#define _EOCMAINIT_H
+
+#include 
+#include 
+#include 
+
+/// TODO, handle bounds
+template 
+class eoCMAInit : public eoInit< eoVector > {
+    
+    const eo::CMAState& state;
+
+    typedef eoVector EOT;
+    
+    public:
+    eoCMAInit(const eo::CMAState& state_) : state(state_) {}
+
+    
+    void operator()(EOT& v) {
+	state.sample(static_cast& >(v));
+	v.invalidate();
+    }
+};
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/es/eoEsChromInit.h b/trunk/paradiseo-eo/src/es/eoEsChromInit.h
new file mode 100644
index 000000000..aec08438b
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/eoEsChromInit.h
@@ -0,0 +1,202 @@
+//
+/* (c) Maarten Keijzer 2000, GeNeura Team, 1998 - EEAAX 1999
+
+This library is free software; you can redistribute it and/or modify it under
+the terms of the GNU Lesser General Public License as published by the Free
+Software Foundation; either version 2 of the License, or (at your option) any
+later version.
+
+This library is distributed in the hope that it will be useful, but WITHOUT ANY
+WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
+
+You should have received a copy of the GNU Lesser General Public License along
+with this library; if not, write to the Free Software Foundation, Inc., 59
+Temple Place, Suite 330, Boston, MA 02111-1307 USA
+
+Contact: http://eodev.sourceforge.net
+         todos@geneura.ugr.es, http://geneura.ugr.es
+         Marc.Schoenauer@polytechnique.fr
+         mak@dhi.dk
+ */
+
+
+#ifndef _eoEsChromInit_H
+#define _eoEsChromInit_H
+
+#include 
+#include 
+
+#include 
+#include 
+#include 
+#include 
+
+#ifndef M_PI
+#define M_PI 3.1415926535897932384626433832795
+#endif
+
+/** Random Es-chromosome initializer (therefore derived from eoInit)
+
+@ingroup EvolutionStrategies
+
+
+This class can initialize four types of real-valued genotypes thanks
+to tempate specialization of private method create:
+
+- eoReal          just an eoVector
+- eoEsSimple      + one self-adapting single sigma for all variables
+- eoEsStdev       a whole std::vector of self-adapting sigmas
+- eoEsFull        a full self-adapting correlation matrix
+
+@see eoReal eoEsSimple eoEsStdev eoEsFull eoInit
+*/
+template 
+class eoEsChromInit : public eoRealInitBounded
+{
+public:
+
+    using eoRealInitBounded::size;
+    using eoRealInitBounded::theBounds;
+
+    typedef typename EOT::Fitness FitT;
+
+    /** Constructor
+
+    @param _bounds bounds for uniform initialization
+    @param _sigma initial value for the stddev
+    @param _to_scale wether sigma should be multiplied by the range of each variable
+    added December 2004 - MS (together with the whole comment :-)
+    */
+    eoEsChromInit(eoRealVectorBounds& _bounds, double _sigma = 0.3, bool _to_scale=false)
+        : eoRealInitBounded(_bounds)
+        {
+            // a bit of pre-computations, to save time later (even if some are useless)
+            //
+            // first, in the case of one unique sigma
+            // sigma is scaled by the average range (if that means anything!)
+            if (_to_scale)
+            {
+                double scaleUnique = 0;
+                for (unsigned i=0; i _vecSigma)
+        : eoRealInitBounded(_bounds), uniqueSigma(_vecSigma[0]), vecSigma(_vecSigma)
+        {}
+
+
+    void operator()(EOT& _eo)
+        {
+            eoRealInitBounded::operator()(_eo);
+            create_self_adapt(_eo);
+            _eo.invalidate();
+        }
+
+
+private:
+
+    /** Create intializer
+
+    No adaptive mutation at all
+    */
+    void create_self_adapt(eoReal&)
+        {}
+
+
+
+    /** Create intializer
+
+    @overload
+
+    Adaptive mutation through a unique sigma
+    */
+    void create_self_adapt(eoEsSimple& result)
+        {
+            // pre-computed in the Ctor
+            result.stdev = uniqueSigma;
+        }
+
+
+
+    /** Create intializer
+
+    @overload
+
+    Adaptive mutation through a std::vector of sigmas
+
+    @todo Should we scale sigmas to the corresponding object variable range?
+    */
+    void create_self_adapt(eoEsStdev& result)
+        {
+            // pre-computed in the constructor
+            result.stdevs = vecSigma;
+        }
+
+
+
+    /** Create intializer
+
+    @overload
+
+    Adaptive mutation through a whole correlation matrix
+    */
+    void create_self_adapt(eoEsFull& result)
+        {
+            // first the stdevs (pre-computed in the Ctor)
+            result.stdevs = vecSigma;
+            unsigned int theSize = size();
+            // nb of rotation angles: N*(N-1)/2 (in general!)
+            result.correlations.resize(theSize*(theSize - 1) / 2);
+            for (unsigned i=0; i vecSigma;
+};
+
+#endif
+
+
+
+// Local Variables:
+// coding: iso-8859-1
+// mode:C++
+// c-file-style: "Stroustrup"
+// comment-column: 35
+// fill-column: 80
+// End:
diff --git a/trunk/paradiseo-eo/src/es/eoEsFull.h b/trunk/paradiseo-eo/src/es/eoEsFull.h
new file mode 100644
index 000000000..74920a5d3
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/eoEsFull.h
@@ -0,0 +1,85 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoEsFull.h
+// (c) GeNeura Team, 2000 - EEAAX 1999 - Maarten Keijzer 2000
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoEsFull_h
+#define _eoEsFull_h
+
+#include 
+
+/**
+\ingroup EvolutionStrategies
+
+  The most complex evolutionary strategy representation. Co-evolving mutation
+rates and correlated mutations.
+*/
+
+template 
+class eoEsFull : public eoVector
+{
+public:
+
+    using eoVector::size;
+
+
+    typedef double Type;
+
+    eoEsFull(void) : eoVector() {}
+
+    virtual std::string className(void) const { return "eoEsFull"; }
+
+    void printOn(std::ostream& os) const
+    {
+        eoVector::printOn(os);
+        os << ' ';
+        std::copy(stdevs.begin(), stdevs.end(), std::ostream_iterator(os, " "));
+        os << ' ';
+        std::copy(correlations.begin(), correlations.end(), std::ostream_iterator(os, " "));
+        os << ' ';
+    }
+
+    void readFrom(std::istream& is)
+    {
+        eoVector::readFrom(is);
+
+        stdevs.resize(size());
+
+        unsigned i;
+        for (i = 0; i < size(); ++i)
+            is >> stdevs[i];
+
+        correlations.resize(size()*(size() - 1) / 2);
+
+        for (i = 0; i < correlations.size(); ++i)
+            is >> correlations[i];
+    }
+
+    std::vector stdevs;
+    std::vector correlations;
+};
+
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/es/eoEsGlobalXover.h b/trunk/paradiseo-eo/src/es/eoEsGlobalXover.h
new file mode 100644
index 000000000..eb2b43308
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/eoEsGlobalXover.h
@@ -0,0 +1,149 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoEsGlobalXover.h : ES global crossover
+// (c) Marc Schoenauer 2001
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: marc.schoenauer@polytechnique.fr http://eeaax.cmap.polytchnique.fr/
+ */
+//-----------------------------------------------------------------------------
+
+
+#ifndef _eoEsGlobalXover_H
+#define _eoEsGlobalXover_H
+
+#include 
+
+#include 
+#include 
+#include 
+
+#include 
+// needs a selector - here random
+#include 
+
+/** Gloabl crossover operator for ES genotypes.
+  *  Uses some Atom crossovers to handle both the object variables
+  *  and the mutation strategy parameters
+  */
+template
+class eoEsGlobalXover: public eoGenOp
+{
+public:
+  typedef typename EOT::Fitness FitT;
+
+  /**
+   * (Default) Constructor.
+   */
+  eoEsGlobalXover(eoBinOp & _crossObj, eoBinOp & _crossMut) :
+    crossObj(_crossObj), crossMut(_crossMut) {}
+
+  /// The class name. Used to display statistics
+  virtual std::string className() const { return "eoEsGlobalXover"; }
+
+  /// The TOTAL number of offspring (here = nb of parents modified in place)
+  unsigned max_production(void) { return 1; }
+
+  /**
+   * modifies one parents in the populator
+   *     using 2 new parents for each component!
+   *
+   * @param _pop a POPULATOR (not a simple population)
+   */
+  void apply(eoPopulator& _plop)
+  {
+    // First, select as many parents as you will have offspring
+    EOT& parent = *_plop; // select the first parent
+
+    // first, the object variables
+    for (unsigned i=0; i used by _plop to get parents
+	const EOT& realParent1 = sel(_plop.source());
+	const EOT& realParent2 = sel(_plop.source());
+	parent[i] = realParent1[i];
+	crossObj(parent[i], realParent2[i]); // apply eoBinOp
+      }
+    // then the self-adaptation parameters
+    cross_self_adapt(parent, _plop.source());
+    // dont' forget to invalidate
+    parent.invalidate();
+  }
+
+private:
+
+  /** Method for cross self-adaptation parameters
+
+  Specialization for eoEsSimple.
+  */
+  void cross_self_adapt(eoEsSimple & _parent, const eoPop >& _pop)
+  {
+    const EOT& realParent1 = sel(_pop);
+    const EOT& realParent2 = sel(_pop);
+    _parent.stdev = realParent1.stdev;
+    crossMut(_parent.stdev, realParent2.stdev); // apply eoBinOp
+  }
+
+  /** Method for cross self-adaptation parameters
+
+  Specialization for eoEsStdev.
+  */
+  void cross_self_adapt(eoEsStdev & _parent, const eoPop >& _pop)
+  {
+    for (unsigned i=0; i<_parent.size(); i++)
+      {
+	const EOT& realParent1 = sel(_pop);
+	const EOT& realParent2 = sel(_pop);
+	_parent.stdevs[i] = realParent1.stdevs[i];
+	crossMut(_parent.stdevs[i], realParent2.stdevs[i]); // apply eoBinOp
+      }
+  }
+
+  /** Method for cross self-adaptation parameters
+
+  Specialization for eoEsFull.
+  */
+  void cross_self_adapt(eoEsFull & _parent, const eoPop >& _pop)
+  {
+    unsigned i;
+    // the StDev
+    for (i=0; i<_parent.size(); i++)
+      {
+	const EOT& realParent1 = sel(_pop);
+	const EOT& realParent2 = sel(_pop);
+	_parent.stdevs[i] = realParent1.stdevs[i];
+	crossMut(_parent.stdevs[i], realParent2.stdevs[i]); // apply eoBinOp
+      }
+    // the roataion angles
+    for (i=0; i<_parent.correlations.size(); i++)
+      {
+	const EOT& realParent1 = sel(_pop);
+	const EOT& realParent2 = sel(_pop);
+	_parent.correlations[i] = realParent1.correlations[i];
+	crossMut(_parent.correlations[i], realParent2.correlations[i]); // apply eoBinOp
+      }
+
+  }
+
+  // the data
+  eoRandomSelect sel;
+  eoBinOp & crossObj;
+  eoBinOp & crossMut;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/es/eoEsMutate.h b/trunk/paradiseo-eo/src/es/eoEsMutate.h
new file mode 100644
index 000000000..180b0f8ae
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/eoEsMutate.h
@@ -0,0 +1,286 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; fill-column: 80; -*-
+
+//-----------------------------------------------------------------------------
+// eoESMute.h : ES mutation
+// (c) Maarten Keijzer 2000 & GeNeura Team, 1998 for the EO part
+//     Th. Baeck 1994 and EEAAX 1999 for the ES part
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             marc.schoenauer@polytechnique.fr
+                       http://eeaax.cmap.polytchnique.fr/
+ */
+//-----------------------------------------------------------------------------
+
+
+#ifndef _EOESMUTATE_H
+#define _EOESMUTATE_H
+
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+
+#ifndef M_PI
+#define M_PI 3.1415926535897932384626433832795
+#endif
+
+/** ES-style mutation in the large
+
+@ingroup EvolutionStrategies
+
+Obviously, valid only for eoES*. It is currently valid for three types
+of ES chromosomes:
+- eoEsSimple:   Exactly one stdandard-deviation
+- eoEsStdev:    As many standard deviations as object variables
+- eoEsFull:     The whole guacemole: correlations, stdevs and object variables
+
+Each of these three variant has it's own operator() in eoEsMutate and
+intialization is also split into three cases (that share some commonalities)
+*/
+template 
+class eoEsMutate : public eoMonOp< EOT >
+{
+public:
+
+    /** Fitness-type */
+    typedef typename EOT::Fitness FitT;
+
+
+    /** Initialization.
+
+    @param _init Proxy class for initializating the three parameters
+                 eoEsMutate needs
+    @param _bounds Bounds for the objective variables
+    */
+    eoEsMutate(eoEsMutationInit& _init, eoRealVectorBounds& _bounds) : bounds(_bounds)
+    {
+        init(EOT(), _init); // initialize on actual type used
+    }
+
+
+    /** @brief Virtual Destructor */
+    virtual ~eoEsMutate() {};
+
+
+    /** Classname.
+
+    Inherited from eoObject @see eoObject
+
+    @return Name of class.
+    */
+    virtual std::string className() const {return "eoESMutate";};
+
+
+    /** Mutate eoEsSimple
+
+    @param _eo Individual to mutate.
+    */
+    virtual bool operator()( eoEsSimple& _eo)
+        {
+            _eo.stdev *= exp(TauLcl * rng.normal());
+            if (_eo.stdev < stdev_eps)
+	        _eo.stdev = stdev_eps;
+            // now apply to all
+            for (unsigned i = 0; i < _eo.size(); ++i)
+            {
+                _eo[i] += _eo.stdev * rng.normal();
+            }
+            bounds.foldsInBounds(_eo);
+            return true;
+        }
+
+
+    /** Standard mutation in ES
+
+    @overload
+
+    Standard mutation of object variables and standard deviations in ESs.
+
+    If there are fewer different standard deviations available than the
+    dimension of the objective function requires, the last standard deviation is
+    responsible for ALL remaining object variables.
+
+    @param _eo Individual to mutate.
+
+    @see
+    Schwefel 1977: Numerische Optimierung von Computer-Modellen mittels der
+    Evolutionsstrategie, pp. 165 ff.
+    */
+    virtual bool operator()( eoEsStdev& _eo )
+        {
+            double global = TauGlb * rng.normal();
+            for (unsigned i = 0; i < _eo.size(); i++)
+            {
+                double stdev = _eo.stdevs[i];
+                stdev *= exp( global + TauLcl * rng.normal() );
+                if (stdev < stdev_eps)
+                    stdev = stdev_eps;
+                _eo.stdevs[i] = stdev;
+                _eo[i] += stdev * rng.normal();
+            }
+            bounds.foldsInBounds(_eo);
+            return true;
+        }
+
+
+    /** Correlated mutations in ES
+
+    @overload
+
+    Mutation of object variables, standard deviations, and their correlations in
+    ESs.
+
+    @param _eo Individual to mutate.
+
+    @see
+    - H.-P. Schwefel: Internal Report of KFA Juelich, KFA-STE-IB-3/80, p. 43, 1980.
+    - G. Rudolph: Globale Optimierung mit parallelen Evolutionsstrategien,
+      Diploma Thesis, University of Dortmund, 1990.
+    */
+    virtual bool operator()( eoEsFull & _eo )
+    // Code originally from Thomas Bäck
+        {
+            // First: mutate standard deviations (as for eoEsStdev).
+            double global = TauGlb * rng.normal();
+            unsigned i;
+            for (i = 0; i < _eo.size(); i++)
+            {
+                double stdev = _eo.stdevs[i];
+                stdev *= exp( global + TauLcl*rng.normal() );
+                if (stdev < stdev_eps)
+                    stdev = stdev_eps;
+                _eo.stdevs[i] = stdev;
+            }
+            // Mutate rotation angles.
+            for (i = 0; i < _eo.correlations.size(); i++)
+            {
+                _eo.correlations[i] += TauBeta * rng.normal();
+                if ( fabs(_eo.correlations[i]) > M_PI )
+                {
+                    _eo.correlations[i] -= M_PI * (int) (_eo.correlations[i]/M_PI) ;
+                }
+            }
+            // Perform correlated mutations.
+            unsigned k, n1, n2;
+            double d1,d2, S, C;
+            std::vector VarStp(_eo.size());
+            for (i = 0; i < _eo.size(); i++)
+                VarStp[i] = _eo.stdevs[i] * rng.normal();
+            unsigned nq = _eo.correlations.size() - 1;
+            for (k = 0; k < _eo.size()-1; k++)
+            {
+                n1 = _eo.size() - k - 1;
+                n2 = _eo.size() - 1;
+                for (i = 0; i < k; i++)
+                {
+                    d1 = VarStp[n1];
+                    d2 = VarStp[n2];
+                    S  = sin( _eo.correlations[nq] );
+                    C  = cos( _eo.correlations[nq] );
+                    VarStp[n2] = d1 * S + d2 * C;
+                    VarStp[n1] = d1 * C - d2 * S;
+                    n2--;
+                    nq--;
+                }
+            }
+            for (i = 0; i < _eo.size(); i++)
+                _eo[i] += VarStp[i];
+            bounds.foldsInBounds(_eo);
+            return true;
+        }
+
+
+  private :
+
+    /** Initialization of simple ES */
+    void init(eoEsSimple, eoEsMutationInit& _init)
+    {
+        unsigned size = bounds.size();
+        TauLcl = _init.TauLcl();
+        TauLcl /= sqrt(2*(double) size);
+	std::cout << "Init: tau local " << TauLcl << std::endl;
+    }
+
+
+    /** Initialization of standard ES
+
+    @overload
+    */
+    void init(eoEsStdev, eoEsMutationInit& _init)
+    {
+        unsigned size = bounds.size();
+        TauLcl = _init.TauLcl();
+        TauGlb = _init.TauGlb();
+        // renormalization
+        TauLcl /= sqrt( 2.0 * sqrt(double(size)) );
+        TauGlb /= sqrt( 2.0 * double(size) );
+        std::cout << "Init: tau local " << TauLcl << " et global " << TauGlb << std::endl;
+    }
+
+
+    /** Initialization of full ES
+
+    @overload
+    */
+    void init(eoEsFull, eoEsMutationInit& _init)
+    {
+        init(eoEsStdev(), _init);
+        TauBeta = _init.TauBeta();
+        std::cout << "Init: tau local " << TauLcl << " et global " << TauGlb << std::endl;
+    }
+
+
+    /** Local factor for mutation of std deviations */
+    double TauLcl;
+
+    /** Global factor for mutation of std deviations */
+    double TauGlb;
+
+    /** Factor for mutation of correlation parameters */
+    double TauBeta;
+
+    /** Bounds of parameters */
+    eoRealVectorBounds& bounds;
+
+    /** Minimum stdev.
+
+    If you let the step-size go to 0, self-adaptation stops, therefore we give a
+    lower bound. The actual value used is somewhat arbitrary and the is no
+    theoretical reasoning known for it (Sep 2005).
+
+    The code that we have in EO is a port from a C code that Thomas Bäck kindly
+    donated to the community some years ago. It has been modified by Marc
+    Schoenauer for inclusion in EvolC, than by Maarten Keijzer into EO. The
+    exact value was adjusted based on practice.
+
+    Removing this doesn't work well, but it was never tried to figure out what
+    the best value would be.
+    */
+    static const double stdev_eps;
+};
+
+
+// Minimum value of stdevs, see declaration for details.
+template 
+const double eoEsMutate::stdev_eps = 1.0e-40;
+
+#endif
diff --git a/trunk/paradiseo-eo/src/es/eoEsMutationInit.h b/trunk/paradiseo-eo/src/es/eoEsMutationInit.h
new file mode 100644
index 000000000..43240362f
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/eoEsMutationInit.h
@@ -0,0 +1,121 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; fill-column: 80 -*-
+
+//-----------------------------------------------------------------------------
+// eoEsMutationInit.h
+// (c) GeNeura Team, 1998 - EEAAX 1999 - Maarten Keijzer 2000
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoEsMutationInit_h
+#define _eoEsMutationInit_h
+
+#include 
+
+/** Initialize Mutation operator
+
+@ingroup EvolutionStrategies
+
+Proxy class that is used for initializing the mutation operator. It provides an
+interface between eoEsMutate and the abstract parameterLoader. It also provides
+the names for the parameters in this class as virtual protected member
+functions.
+
+If you have more than a single ES in a project that need different names in the
+configuration files, you might consider overriding this class to change the
+names.
+
+@see eoEsMutate
+*/
+class eoEsMutationInit
+{
+public :
+
+    /** Constructor
+
+    @param _parser Parser to read parameters from.
+    @param _section Parser section for \tau-parameters.
+    */
+    eoEsMutationInit(eoParser& _parser,
+		     std::string _section="ES mutation parameters" ) :
+        parser(_parser), repSection(_section),
+        TauLclParam(0), TauGlbParam(0), TauBetaParam(0) {}
+
+    /** Virtual destructor */
+    virtual ~eoEsMutationInit() {}
+
+    /** local \tau */
+    double TauLcl(void)
+    {
+        if (TauLclParam == 0)
+        {
+            TauLclParam = &parser.getORcreateParam(1.0, TauLclName(),
+                                                   "Local Tau (before normalization)",
+                                                   TauLclShort(), section());
+        }
+        return TauLclParam->value();
+    }
+
+    /** global tau */
+    double TauGlb(void)
+    {
+        if (TauGlbParam == 0)
+        {
+            TauGlbParam = &parser.getORcreateParam(1.0, TauGlbName(),
+                                                   "Global Tau (before normalization)",
+                                                   TauGlbShort(), section());
+        }
+        return TauGlbParam->value();
+    }
+
+    /** correlation's tau */
+    double TauBeta(void)
+    {
+        if (TauBetaParam == 0)
+        {
+            TauBetaParam = &parser.getORcreateParam(0.0873, TauBetaName(),
+                                                    "Beta", TauBetaShort(), section());
+        }
+        return TauBetaParam->value();
+    }
+
+  protected :
+
+    virtual std::string section(void)                { return repSection; }
+
+    virtual std::string TauLclName(void) const       { return "TauLoc"; }
+    virtual char   TauLclShort(void) const           { return 'l'; }
+
+    virtual std::string TauGlbName(void) const       { return "TauGlob"; }
+    virtual char   TauGlbShort(void) const           { return 'g'; }
+
+    virtual std::string TauBetaName(void) const      { return "Beta"; }
+    virtual char   TauBetaShort(void) const          { return 'b'; }
+
+private:
+
+    eoParser& parser;
+    std::string repSection;
+    eoValueParam* TauLclParam;
+    eoValueParam* TauGlbParam;
+    eoValueParam* TauBetaParam;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/es/eoEsSimple.h b/trunk/paradiseo-eo/src/es/eoEsSimple.h
new file mode 100644
index 000000000..60c62c53d
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/eoEsSimple.h
@@ -0,0 +1,77 @@
+/* (c) GeNeura Team, 2000 - EEAAX 1999, Maarten Keijzer 2000
+
+This library is free software; you can redistribute it and/or modify it under
+the terms of the GNU Lesser General Public License as published by the Free
+Software Foundation; either version 2 of the License, or (at your option) any
+later version.
+
+This library is distributed in the hope that it will be useful, but WITHOUT ANY
+WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
+
+You should have received a copy of the GNU Lesser General Public License along
+with this library; if not, write to the Free Software Foundation, Inc., 59
+Temple Place, Suite 330, Boston, MA 02111-1307 USA
+
+Contact: http://eodev.sourceforge.net
+         todos@geneura.ugr.es, http://geneura.ugr.es
+         Marc.Schoenauer@polytechnique.fr
+         mak@dhi.dk
+ */
+
+
+#ifndef _eoEsSimple_h
+#define _eoEsSimple_h
+
+#include 
+#include 
+
+#include 
+
+/** Simple Evolution Strategy
+
+@ingroup EvolutionStrategies
+
+One of the more simple evolution strategies, sporting just a single stdeviation
+for the entire chromosome. For more advanced versions see also eoEsStdev
+eoEsFull
+
+@see eoEsStdev eoEsFull
+*/
+template 
+class eoEsSimple : public eoVector
+{
+public :
+
+    typedef double Type;
+
+    eoEsSimple() : eoVector() {}
+
+    virtual std::string className() const { return "eoEsSimple"; }
+
+    void printOn(std::ostream& os) const
+    {
+        eoVector::printOn(os);
+        os << ' ' << stdev << ' ';
+    }
+
+    void readFrom(std::istream& is)
+    {
+        eoVector::readFrom(is);
+        is >> stdev;
+    }
+
+    double stdev;
+};
+
+#endif
+
+
+
+// Local Variables:
+// coding: iso-8859-1
+// mode:C++
+// c-file-style: "Stroustrup"
+// comment-column: 35
+// fill-column: 80
+// End:
diff --git a/trunk/paradiseo-eo/src/es/eoEsStandardXover.h b/trunk/paradiseo-eo/src/es/eoEsStandardXover.h
new file mode 100644
index 000000000..b4cc11533
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/eoEsStandardXover.h
@@ -0,0 +1,120 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- 
+
+//-----------------------------------------------------------------------------
+// eoEsLocalXover.h : ES global crossover
+// (c) Marc Schoenauer 2001
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+ 
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+ 
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ 
+    Contact: marc.schoenauer@polytechnique.fr http://eeaax.cmap.polytchnique.fr/
+ */
+//-----------------------------------------------------------------------------
+
+
+#ifndef _eoEsLocalXover_H
+#define _eoEsLocalXover_H
+
+#include 
+
+#include 
+#include 
+#include 
+
+#include 
+// needs a selector - here random
+#include 
+
+/** Standard (i.e. eoBinOp) crossover operator for ES genotypes.
+ *  Uses some Atom crossovers to handle both the object variables
+ *  and the mutation strategy parameters
+ *  It is an  eoBinOp and has to be wrapped into an eoGenOp before being used
+ *  like the global version
+ */
+template 
+class eoEsStandardXover: public eoBinOp
+{
+public:
+  typedef typename EOT::Fitness FitT;
+
+  /**
+   * (Default) Constructor.
+   */
+  eoEsStandardXover(eoBinOp & _crossObj, eoBinOp & _crossMut) :
+    crossObj(_crossObj), crossMut(_crossMut) {}
+
+  /// The class name. Used to display statistics
+  virtual std::string className() const { return "eoEsStandardXover"; }
+
+  /**
+   * modifies one parents in the populator
+   *     using a second parent
+   */
+  bool operator()(EOT& _eo1, const EOT& _eo2)
+    {
+      bool bLoc=false;
+    // first, the object variables
+    for (unsigned i=0; i<_eo1.size(); i++)
+      {
+	bLoc |= crossObj(_eo1[i], _eo2[i]); // apply eoBinOp
+      }
+    // then the self-adaptation parameters
+    bLoc |= cross_self_adapt(_eo1, _eo2);
+    return bLoc;
+  }
+  
+private:
+
+  // the method to cross slef-adaptation parameters: need to specialize
+
+  bool cross_self_adapt(eoEsSimple & _parent1, const eoEsSimple & _parent2)
+  {
+    return crossMut(_parent1.stdev, _parent2.stdev); // apply eoBinOp
+  }
+
+  bool cross_self_adapt(eoEsStdev & _parent1, const eoEsStdev & _parent2)
+  {
+    bool bLoc=false;
+    for (unsigned i=0; i<_parent1.size(); i++)
+      {
+	bLoc |= crossMut(_parent1.stdevs[i], _parent2.stdevs[i]); // apply eoBinOp
+      }
+    return bLoc;
+  }
+
+  bool cross_self_adapt(eoEsFull & _parent1, const eoEsFull & _parent2)
+  {
+    bool bLoc=false;
+    unsigned i;
+    // the StDev
+    for (i=0; i<_parent1.size(); i++)
+      {
+	bLoc |= crossMut(_parent1.stdevs[i], _parent2.stdevs[i]); // apply eoBinOp
+      }
+    // the roataion angles
+    for (i=0; i<_parent1.correlations.size(); i++)
+      {
+	bLoc |= crossMut(_parent1.correlations[i], _parent2.correlations[i]); // apply eoBinOp
+      }
+    return bLoc;
+
+  }
+
+  // the data
+  eoRandomSelect sel;
+  eoBinOp & crossObj;
+  eoBinOp & crossMut;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/es/eoEsStdev.h b/trunk/paradiseo-eo/src/es/eoEsStdev.h
new file mode 100644
index 000000000..1fdd39c8a
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/eoEsStdev.h
@@ -0,0 +1,80 @@
+/* (c) GeNeura Team, 2000 - EEAAX 1999 - Maarten Keijzer 2000
+
+This library is free software; you can redistribute it and/or modify it under
+the terms of the GNU Lesser General Public License as published by the Free
+Software Foundation; either version 2 of the License, or (at your option) any
+later version.
+
+This library is distributed in the hope that it will be useful, but WITHOUT ANY
+WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
+
+You should have received a copy of the GNU Lesser General Public License along
+with this library; if not, write to the Free Software Foundation, Inc., 59
+Temple Place, Suite 330, Boston, MA 02111-1307 USA
+
+Contact: http://eodev.sourceforge.net
+         todos@geneura.ugr.es, http://geneura.ugr.es
+         Marc.Schoenauer@polytechnique.fr
+         mak@dhi.dk
+ */
+
+
+#ifndef _eoEsStdev_h
+#define _eoEsStdev_h
+
+#include 
+
+
+/** Evolutionary Strategy with a standard deviation per parameter
+
+@ingroup EvolutionStrategies
+
+Evolutionary strategie style representation, supporting co-evolving
+standard deviations.
+*/
+template 
+class eoEsStdev : public eoVector
+{
+public:
+
+    using eoVector::size;
+
+    typedef double Type;
+
+    eoEsStdev(void) : eoVector() {}
+
+    virtual std::string className(void) const { return "eoEsStdev"; }
+
+    void printOn(std::ostream& os) const
+    {
+        eoVector::printOn(os);
+        os << ' ';
+        std::copy(stdevs.begin(), stdevs.end(), std::ostream_iterator(os, " "));
+        os << ' ';
+    }
+
+    void readFrom(std::istream& is)
+    {
+        eoVector::readFrom(is);
+        stdevs.resize(size());
+        unsigned i;
+        for (i = 0; i < size(); ++i)
+            is >> stdevs[i];
+    }
+
+
+    std::vector stdevs;
+};
+
+#endif
+
+
+
+// Local Variables:
+// coding: iso-8859-1
+// mode:C++
+// c-file-style: "Stroustrup"
+// comment-column: 35
+// fill-column: 80
+// End:
diff --git a/trunk/paradiseo-eo/src/es/eoNormalMutation.h b/trunk/paradiseo-eo/src/es/eoNormalMutation.h
new file mode 100644
index 000000000..ba807b24b
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/eoNormalMutation.h
@@ -0,0 +1,276 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoNormalMutation.h
+// (c) EEAAX 2001 - Maarten Keijzer 2000
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoNormalMutation_h
+#define eoNormalMutation_h
+
+//-----------------------------------------------------------------------------
+
+#include     // swap_ranges
+#include 
+#include 
+#include 
+#include 
+#include 
+//-----------------------------------------------------------------------------
+
+/** Simple normal mutation of a std::vector of real values.
+ *  The stDev is fixed - but it is passed ans stored as a reference,
+ *  to enable dynamic mutations (see eoOenFithMutation below).
+ *
+ * As for the bounds, the values are here folded back into the bounds.
+ * The other possiblity would be to iterate until we fall inside the bounds -
+ *     but this sometimes takes a long time!!!
+ */
+
+template class eoNormalVecMutation: public eoMonOp
+{
+ public:
+  /**
+   * (Default) Constructor.
+   * The bounds are initialized with the global object that says: no bounds.
+   *
+   * @param _sigma the range for uniform nutation
+   * @param _p_change the probability to change a given coordinate
+   */
+  eoNormalVecMutation(double _sigma, const double& _p_change = 1.0):
+    sigma(_sigma), bounds(eoDummyVectorNoBounds), p_change(_p_change) {}
+
+  /**
+   * Constructor with bounds
+   * @param _bounds an eoRealVectorBounds that contains the bounds
+   * @param _sigma the range for uniform nutation
+   * @param _p_change the probability to change a given coordinate
+   *
+   * for each component, the sigma is scaled to the range of the bound, if bounded
+   */
+  eoNormalVecMutation(eoRealVectorBounds & _bounds,
+		    double _sigma, const double& _p_change = 1.0):
+    sigma(_bounds.size(), _sigma), bounds(_bounds), p_change(_p_change)
+  {
+    // scale to the range - if any
+    for (unsigned i=0; i sigma;
+  eoRealVectorBounds & bounds;
+  double p_change;
+};
+
+/** Simple normal mutation of a std::vector of real values.
+ *  The stDev is fixed - but it is passed ans stored as a reference,
+ *  to enable dynamic mutations (see eoOenFithMutation below).
+ *
+ * As for the bounds, the values are here folded back into the bounds.
+ * The other possiblity would be to iterate until we fall inside the bounds -
+ *     but this sometimes takes a long time!!!
+ */
+
+template class eoNormalMutation
+    : public eoMonOp
+{
+public:
+  /**
+   * (Default) Constructor.
+   * The bounds are initialized with the global object that says: no bounds.
+   *
+   * @param _sigma the range for uniform nutation
+   * @param _p_change the probability to change a given coordinate
+   */
+  eoNormalMutation(double & _sigma, const double& _p_change = 1.0):
+    sigma(_sigma), bounds(eoDummyVectorNoBounds), p_change(_p_change) {}
+
+  /**
+   * Constructor with bounds
+   * @param _bounds an eoRealVectorBounds that contains the bounds
+   * @param _sigma the range for uniform nutation
+   * @param _p_change the probability to change a given coordinate
+   */
+  eoNormalMutation(eoRealVectorBounds & _bounds,
+		    double _sigma, const double& _p_change = 1.0):
+    sigma(_sigma), bounds(_bounds), p_change(_p_change) {}
+
+  /** The class name */
+  virtual std::string className() const { return "eoNormalMutation"; }
+
+  /**
+   * Do it!
+   * @param _eo The cromosome undergoing the mutation
+   */
+  bool operator()(EOT& _eo)
+    {
+      bool hasChanged=false;
+      for (unsigned lieu=0; lieu<_eo.size(); lieu++)
+	{
+	  if (rng.flip(p_change))
+	    {
+	      _eo[lieu] += sigma*rng.normal();
+	      bounds.foldsInBounds(lieu, _eo[lieu]);
+	      hasChanged = true;
+	    }
+	}
+      return hasChanged;
+    }
+
+  /** Accessor to ref to sigma - for update and monitor */
+  double & Sigma() {return sigma;}
+
+private:
+  double & sigma;
+  eoRealVectorBounds & bounds;
+  double p_change;
+};
+
+/** the dynamic version: just say it is updatable -
+ *  and write the update() method!
+ *  here the 1 fifth rule: count the proportion of successful mutations, and
+ *  increase sigma if more than threshold (1/5 !)
+ */
+
+template class eoOneFifthMutation :
+  public eoNormalMutation, public eoUpdatable
+{
+public:
+
+    using eoNormalMutation< EOT >::Sigma;
+
+    typedef typename EOT::Fitness Fitness;
+
+  /**
+   * (Default) Constructor.
+   *
+   * @param eval the evaluation function, needed to recompute the fitmess
+   * @param _sigmaInit the initial value for uniform mutation
+   * @param _windowSize the size of the window for statistics
+   * @param _threshold the threshold (the 1/5 - 0.2)
+   * @param _updateFactor multiplicative update factor for sigma
+   */
+  eoOneFifthMutation(eoEvalFunc & _eval, double & _sigmaInit,
+		     unsigned _windowSize = 10, double _updateFactor=0.83,
+		     double _threshold=0.2):
+    eoNormalMutation(_sigmaInit), eval(_eval),
+    threshold(_threshold), updateFactor(_updateFactor),
+    nbMut(_windowSize, 0), nbSuccess(_windowSize, 0), genIndex(0)
+  {
+    // minimal check
+    if (updateFactor>=1)
+      throw std::runtime_error("Update factor must be < 1 in eoOneFifthMutation");
+  }
+
+  /** The class name */
+  virtual std::string className() const { return "eoOneFifthMutation"; }
+
+  /**
+   * Do it!
+   * calls the standard mutation, then checks for success and updates stats
+   *
+   * @param _eo The chromosome undergoing the mutation
+   */
+  bool operator()(EOT & _eo)
+    {
+      if (_eo.invalid())	   // due to some crossover???
+	eval(_eo);
+      Fitness oldFitness = _eo.fitness(); // save old fitness
+
+      // call standard operator - then count the successes
+      if (eoNormalMutation::operator()(_eo)) // _eo has been modified
+	{
+	  _eo.invalidate();	   // don't forget!!!
+	  nbMut[genIndex]++;
+	  eval(_eo);		   // compute fitness of offspring
+
+	  if (_eo.fitness() > oldFitness)
+	    nbSuccess[genIndex]++;	    // update counter
+	}
+      return false;		   // because eval has reset the validity flag
+    }
+
+  /** the method that will be called every generation
+   *  if the object is added to the checkpoint
+   */
+  void update()
+  {
+    unsigned totalMut = 0;
+    unsigned totalSuccess = 0;
+    // compute the average stats over the time window
+    for ( unsigned i=0; i threshold) {
+      Sigma() /= updateFactor;	   // increase sigma
+    }
+    else
+      {
+	Sigma() *= updateFactor;	   // decrease sigma
+      }
+    genIndex = (genIndex+1) % nbMut.size() ;
+    nbMut[genIndex] = nbSuccess[genIndex] = 0;
+
+  }
+
+private:
+  eoEvalFunc & eval;
+  double threshold;		   // 1/5 !
+  double updateFactor ;		   // the multiplicative factor
+  std::vector nbMut;	   // total number of mutations per gen
+  std::vector nbSuccess;	   // number of successful mutations per gen
+  unsigned genIndex ;		   // current index in std::vectors (circular)
+};
+
+
+//-----------------------------------------------------------------------------
+//@}
+#endif
+
diff --git a/trunk/paradiseo-eo/src/es/eoReal.h b/trunk/paradiseo-eo/src/es/eoReal.h
new file mode 100644
index 000000000..516395f15
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/eoReal.h
@@ -0,0 +1,58 @@
+/*
+   eoReal.h
+// (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@polytechnique.fr
+             todos@geneura.ugr.es, http://geneura.ugr.es 
+             mkeijzer@dhi.dk
+*/
+
+#ifndef eoReal_h
+#define eoReal_h
+
+//-----------------------------------------------------------------------------
+
+#include     // std::ostream, std::istream
+#include       // std::string
+
+#include 
+
+/** eoReal: implementation of simple real-valued chromosome.
+  * based on eoVector class
+*/
+template  class eoReal: public eoVector
+{
+ public:
+
+  /**
+   * (Default) Constructor.
+   * @param size Size of the std::vector
+   */
+  eoReal(unsigned size = 0, double value = 0.0):
+    eoVector(size, value) {}
+
+  /// My class name.
+  virtual std::string className() const
+    {
+      return "eoReal";
+    }
+
+};
+
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/trunk/paradiseo-eo/src/es/eoRealAtomXover.h b/trunk/paradiseo-eo/src/es/eoRealAtomXover.h
new file mode 100644
index 000000000..9380b443a
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/eoRealAtomXover.h
@@ -0,0 +1,94 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*- 
+
+//-----------------------------------------------------------------------------
+// eoRealAtomXover.h : helper classes for std::vector crossover
+// (c) Marc Schoenauer 2001
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+ 
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+ 
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ 
+    Contact: marc.schoenauer@polytechnique.fr http://eeaax.cmap.polytchnique.fr/
+ */
+//-----------------------------------------------------------------------------
+
+/** Some basic atomic crossovers for doubles
+ *
+ * Are used in all ES specifici crossovers
+ * and will be in more general stuff, using the generic crossovers
+ */
+
+#ifndef _eoRealAtomXover_H
+#define _eoRealAtomXover_H
+
+#include 
+
+#include 
+
+/** 
+  Discrete crossover == exchange of values
+*/
+class eoDoubleExchange: public eoBinOp
+{
+public:
+  /**
+   * (Default) Constructor.
+   */
+  eoDoubleExchange() {}
+
+  /// The class name. Used to display statistics
+  virtual std::string className() const { return "eoDoubleExchange"; }
+
+  /**
+     Exchanges or not the values
+   */
+  bool operator()(double& r1, const double& r2) 
+  {
+    if (eo::rng.flip())
+      if (r1 != r2)	   // if r1 == r2 you must return false
+	{
+	  r1 = r2;
+	  return true;
+	}
+    return false;
+  }
+  
+};
+
+/** 
+  Intermediate crossover == linear combination
+*/
+class eoDoubleIntermediate: public eoBinOp
+{
+public:
+  /**
+   * (Default) Constructor.
+   */
+  eoDoubleIntermediate() {}
+
+  /// The class name. Used to display statistics
+  virtual std::string className() const { return "eoDoubleIntermediate"; }
+
+  /**
+     Linear combination of both parents
+   */
+  bool operator()(double& r1, const double& r2) 
+  {
+    double alpha = eo::rng.uniform();
+    r1 = alpha * r2 + (1-alpha) * r1;
+    return true;
+  }
+  
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/es/eoRealInitBounded.h b/trunk/paradiseo-eo/src/es/eoRealInitBounded.h
new file mode 100644
index 000000000..b0f98ba6f
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/eoRealInitBounded.h
@@ -0,0 +1,68 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoRealInitBounded.h
+// (c) EEAAX 2000 - Maarten Keijzer 2000
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoRealInitBounded_h
+#define eoRealInitBounded_h
+
+//-----------------------------------------------------------------------------
+
+#include 
+#include 
+#include 
+#include 
+
+/** Simple initialization for any EOT that derives from std::vector 
+ *    uniformly in some bounds 
+ */
+template 
+class eoRealInitBounded : public eoInit
+{
+ public:
+  /** Ctor - from eoRealVectorBounds */
+  eoRealInitBounded(eoRealVectorBounds & _bounds):bounds(_bounds) 
+  {
+        if (!bounds.isBounded())
+      throw std::runtime_error("Needs bounded bounds to initialize a std::vector");
+  }
+
+  /** simply passes the argument to the uniform method of the bounds */
+  virtual void operator()(EOT & _eo)
+    {
+      bounds.uniform(_eo);  // resizes, and fills uniformly in bounds
+      _eo.invalidate();		   // was MISSING!!!!
+    }
+
+  /** accessor to the bounds */
+  virtual eoRealVectorBounds & theBounds() {return bounds;}
+  virtual unsigned size(){return bounds.size();}
+
+ private:
+  eoRealVectorBounds & bounds;
+};
+
+//-----------------------------------------------------------------------------
+//@}
+#endif 
+
diff --git a/trunk/paradiseo-eo/src/es/eoRealOp.h b/trunk/paradiseo-eo/src/es/eoRealOp.h
new file mode 100644
index 000000000..6fabf2f2a
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/eoRealOp.h
@@ -0,0 +1,504 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoRealOp.h
+// (c) Maarten Keijzer 2000 - Marc Schoenauer 2001
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoRealOp_h
+#define eoRealOp_h
+
+//-----------------------------------------------------------------------------
+
+#include     // swap_ranges
+#include 
+#include 
+#include 
+
+//-----------------------------------------------------------------------------
+
+/** eoUniformMutation --> changes all values of the std::vector
+                          by uniform choice with range epsilon
+                          with probability p_change per variable
+\class eoUniformMutation eoRealOp.h Tutorial/eoRealOp.h
+\ingroup parameteric
+*/
+
+template class eoUniformMutation: public eoMonOp
+{
+ public:
+  /**
+   * Constructor without bounds == unbounded variables :-)
+   * not very clean, but who's doing unbounded optimization anyway?
+   * and it's there mostly for backward compatibility
+   *
+   * @param _epsilon the range for uniform nutation
+   * @param _p_change the probability to change a given coordinate
+   */
+  eoUniformMutation(const double& _epsilon, const double& _p_change = 1.0):
+    homogeneous(true), bounds(eoDummyVectorNoBounds), epsilon(1, _epsilon),
+    p_change(1, _p_change) {}
+
+  /**
+   * Constructor with bounds
+   * @param _bounds an eoRealVectorBounds that contains the bounds
+   * @param _epsilon the range for uniform mutation - a double to be scaled
+   * @param _p_change the one probability to change all coordinates
+   */
+  eoUniformMutation(eoRealVectorBounds & _bounds,
+		    const double& _epsilon, const double& _p_change = 1.0):
+    homogeneous(false), bounds(_bounds), epsilon(_bounds.size(), _epsilon),
+    p_change(_bounds.size(), _p_change)
+  {
+    // scale to the range - if any
+    for (unsigned i=0; i& _epsilon,
+		    const std::vector& _p_change):
+    homogeneous(false), bounds(_bounds), epsilon(_epsilon),
+    p_change(_p_change) {}
+
+  /// The class name.
+  virtual std::string className() const { return "eoUniformMutation"; }
+
+  /**
+   * Do it!
+   * @param _eo The indi undergoing the mutation
+   */
+  bool operator()(EOT& _eo)
+    {
+      bool hasChanged=false;
+      if (homogeneous)		   // implies no bounds object
+	for (unsigned lieu=0; lieu<_eo.size(); lieu++)
+	  {
+	    if (rng.flip(p_change[0]))
+	      {
+		_eo[lieu] += 2*epsilon[0]*rng.uniform()-epsilon[0];
+		hasChanged = true;
+	      }
+	  }
+      else
+	{
+	  // sanity check ?
+	  if (_eo.size() != bounds.size())
+	    throw std::runtime_error("Invalid size of indi in eoUniformMutation");
+
+	  for (unsigned lieu=0; lieu<_eo.size(); lieu++)
+	    if (rng.flip(p_change[lieu]))
+	      {
+		// check the bounds
+		double emin = _eo[lieu]-epsilon[lieu];
+		double emax = _eo[lieu]+epsilon[lieu];
+		if (bounds.isMinBounded(lieu))
+		  emin = std::max(bounds.minimum(lieu), emin);
+		if (bounds.isMaxBounded(lieu))
+		  emax = std::min(bounds.maximum(lieu), emax);
+		_eo[lieu] = emin + (emax-emin)*rng.uniform();
+		hasChanged = true;
+	      }
+	}
+      return hasChanged;
+    }
+
+private:
+  bool homogeneous;   // == no bounds passed in the ctor
+  eoRealVectorBounds & bounds;
+  std::vector epsilon;	   // the ranges for mutation
+  std::vector p_change;	   // the proba that each variable is modified
+};
+
+/** eoDetUniformMutation --> changes exactly k values of the std::vector
+                          by uniform choice with range epsilon
+\class eoDetUniformMutation eoRealOp.h Tutorial/eoRealOp.h
+\ingroup parameteric
+*/
+
+template class eoDetUniformMutation: public eoMonOp
+{
+ public:
+  /**
+   * (Default) Constructor for homogeneous genotype
+   * it's there mostly for backward compatibility
+   *
+   * @param _epsilon the range for uniform nutation
+   * @param number of coordinate to modify
+   */
+  eoDetUniformMutation(const double& _epsilon, const unsigned& _no = 1):
+    homogeneous(true), bounds(eoDummyVectorNoBounds),
+    epsilon(1, _epsilon), no(_no) {}
+
+  /**
+   * Constructor with bounds
+   * @param _bounds an eoRealVectorBounds that contains the bounds
+   * @param _epsilon the range for uniform nutation (to be scaled if necessary)
+   * @param number of coordinate to modify
+   */
+  eoDetUniformMutation(eoRealVectorBounds & _bounds,
+		       const double& _epsilon, const unsigned& _no = 1):
+    homogeneous(false), bounds(_bounds),
+    epsilon(_bounds.size(), _epsilon), no(_no)
+  {
+    // scale to the range - if any
+    for (unsigned i=0; i& _epsilon,
+		       const unsigned& _no = 1):
+    homogeneous(false), bounds(_bounds), epsilon(_epsilon), no(_no)
+  {
+    // scale to the range - if any
+    for (unsigned i=0; i epsilon;	   // the ranges of mutation
+  unsigned no;
+};
+
+
+// two arithmetical crossovers
+
+/** eoSegmentCrossover --> uniform choice in segment
+                 == arithmetical with same value along all coordinates
+\class eoSegmentCrossover eoRealOp.h Tutorial/eoRealOp.h
+\ingroup parameteric
+*/
+
+template class eoSegmentCrossover: public eoQuadOp
+{
+ public:
+  /**
+   * (Default) Constructor.
+   * The bounds are initialized with the global object that says: no bounds.
+   *
+   * @param _alphaMin the amount of exploration OUTSIDE the parents
+   *               as in BLX-alpha notation (Eshelman and Schaffer)
+   *               0 == contractive application
+   *               Must be positive
+   */
+  eoSegmentCrossover(const double& _alpha = 0.0) :
+    bounds(eoDummyVectorNoBounds), alpha(_alpha), range(1+2*_alpha) {}
+
+  /**
+   * Constructor with bounds
+   * @param _bounds an eoRealVectorBounds that contains the bounds
+   * @param _alphaMin the amount of exploration OUTSIDE the parents
+   *               as in BLX-alpha notation (Eshelman and Schaffer)
+   *               0 == contractive application
+   *               Must be positive
+   */
+  eoSegmentCrossover(eoRealVectorBounds & _bounds,
+		     const double& _alpha = 0.0) :
+    bounds(_bounds), alpha(_alpha), range(1+2*_alpha) {}
+
+  /// The class name.
+  virtual std::string className() const { return "eoSegmentCrossover"; }
+
+  /**
+   * segment crossover - modifies both parents
+   * @param _eo1 The first parent
+   * @param _eo2 The first parent
+   */
+  bool operator()(EOT& _eo1, EOT& _eo2)
+    {
+      unsigned i;
+      double r1, r2, fact;
+      double alphaMin = -alpha;
+      double alphaMax = 1+alpha;
+      if (alpha == 0.0)		   // no check to perform
+	fact = -alpha + rng.uniform(range); // in [-alpha,1+alpha)
+      else			   // look for the bounds for fact
+	{
+	  for (i=0; i<_eo1.size(); i++)
+	    {
+	      r1=_eo1[i];
+	      r2=_eo2[i];
+	      if (r1 != r2) {	   // otherwise you'll get NAN's
+		double rmin = std::min(r1, r2);
+		double rmax = std::max(r1, r2);
+		double length = rmax - rmin;
+		if (bounds.isMinBounded(i))
+		  {
+		    alphaMin = std::max(alphaMin, (bounds.minimum(i)-rmin)/length);
+		    alphaMax = std::min(alphaMax, (rmax-bounds.minimum(i))/length);
+		  }
+		if (bounds.isMaxBounded(i))
+		  {
+		    alphaMax = std::min(alphaMax, (bounds.maximum(i)-rmin)/length);
+		    alphaMin = std::max(alphaMin, (rmax-bounds.maximum(i))/length);
+		  }
+	      }
+	    }
+	  fact = alphaMin + (alphaMax-alphaMin)*rng.uniform();
+	}
+
+      for (i=0; i<_eo1.size(); i++)
+	{
+	  r1=_eo1[i];
+	  r2=_eo2[i];
+	  _eo1[i] = fact * r1 + (1-fact) * r2;
+	  _eo2[i] = (1-fact) * r1 + fact * r2;
+	}
+      return true;	   // shoudl test if fact was 0 or 1 :-)))
+    }
+
+protected:
+  eoRealVectorBounds & bounds;
+  double alpha;
+  double range;			   // == 1+2*alpha
+};
+
+/** eoHypercubeCrossover --> uniform choice in hypercube
+                 == arithmetical with different values for each coordinate
+\class eoArithmeticCrossover eoRealOp.h Tutorial/eoRealOp.h
+\ingroup parameteric
+*/
+
+template class eoHypercubeCrossover: public eoQuadOp
+{
+ public:
+  /**
+   * (Default) Constructor.
+   * The bounds are initialized with the global object that says: no bounds.
+   *
+   * @param _alphaMin the amount of exploration OUTSIDE the parents
+   *               as in BLX-alpha notation (Eshelman and Schaffer)
+   *               0 == contractive application
+   *               Must be positive
+   */
+  eoHypercubeCrossover(const double& _alpha = 0.0):
+    bounds(eoDummyVectorNoBounds), alpha(_alpha), range(1+2*_alpha)
+  {
+    if (_alpha < 0)
+      throw std::runtime_error("BLX coefficient should be positive");
+  }
+
+  /**
+   * Constructor with bounds
+   * @param _bounds an eoRealVectorBounds that contains the bounds
+   * @param _alphaMin the amount of exploration OUTSIDE the parents
+   *               as in BLX-alpha notation (Eshelman and Schaffer)
+   *               0 == contractive application
+   *               Must be positive
+   */
+  eoHypercubeCrossover(eoRealVectorBounds & _bounds,
+			const double& _alpha = 0.0):
+    bounds(_bounds), alpha(_alpha), range(1+2*_alpha)
+  {
+    if (_alpha < 0)
+      throw std::runtime_error("BLX coefficient should be positive");
+  }
+
+  /// The class name.
+  virtual std::string className() const { return "eoHypercubeCrossover"; }
+
+  /**
+   * hypercube crossover - modifies both parents
+   * @param _eo1 The first parent
+   * @param _eo2 The first parent
+   */
+  bool operator()(EOT& _eo1, EOT& _eo2)
+    {
+      bool hasChanged = false;
+      unsigned i;
+      double r1, r2, fact;
+      if (alpha == 0.0)		   // no check to perform
+	  for (i=0; i<_eo1.size(); i++)
+	    {
+	      r1=_eo1[i];
+	      r2=_eo2[i];
+	      if (r1 != r2) {	   // otherwise do nothing
+		fact = rng.uniform(range);	 // in [0,1)
+		_eo1[i] = fact * r1 + (1-fact) * r2;
+		_eo2[i] = (1-fact) * r1 + fact * r2;
+		hasChanged = true; // forget (im)possible alpha=0
+	      }
+	    }
+      else	   // check the bounds
+	// do not try to get a bound on the linear factor, but rather
+	// on the object variables themselves
+	for (i=0; i<_eo1.size(); i++)
+	  {
+	    r1=_eo1[i];
+	    r2=_eo2[i];
+	    if (r1 != r2) {	   // otherwise do nothing
+	      double rmin = std::min(r1, r2);
+	      double rmax = std::max(r1, r2);
+
+	      // compute min and max for object variables
+	      double objMin = -alpha * rmax + (1+alpha) * rmin;
+	      double objMax = -alpha * rmin + (1+alpha) * rmax;
+
+	      // first find the limits on the alpha's
+	      if (bounds.isMinBounded(i))
+		{
+		  objMin = std::max(objMin, bounds.minimum(i));
+		}
+	      if (bounds.isMaxBounded(i))
+		{
+		  objMax = std::min(objMax, bounds.maximum(i));
+		}
+	      // then draw variables
+	      double median = (objMin+objMax)/2.0; // uniform within bounds
+	      // double median = (rmin+rmax)/2.0;  // Bounce on bounds
+	      double valMin = objMin + (median-objMin)*rng.uniform();
+	      double valMax = median + (objMax-median)*rng.uniform();
+	      // don't always put large value in _eo1 - or what?
+	      if (rng.flip(0.5))
+		{
+		  _eo1[i] = valMin;
+		  _eo2[i] = valMax;
+		}
+	      else
+		{
+		  _eo1[i] = valMax;
+		  _eo2[i] = valMin;
+		}
+	      // seomthing has changed
+	      hasChanged = true; // forget (im)possible alpha=0
+	    }
+	  }
+
+    return hasChanged;
+   }
+
+protected:
+  eoRealVectorBounds & bounds;
+  double alpha;
+  double range;			   // == 1+2*alphaMin
+};
+
+
+/** eoRealUxOver --> Uniform crossover, also termed intermediate crossover
+\class eoRealUxOver eoRealOp.h Tutorial/eoRealOp.h
+\ingroup parameteric
+*/
+
+template class eoRealUXover: public eoQuadOp
+{
+ public:
+  /**
+   * (Default) Constructor.
+   * @param _preference bias in the choice (usually, no bias == 0.5)
+   */
+  eoRealUXover(const float& _preference = 0.5): preference(_preference)
+    {
+      if ( (_preference <= 0.0) || (_preference >= 1.0) )
+	std::runtime_error("UxOver --> invalid preference");
+    }
+
+  /// The class name.
+  virtual std::string className() const { return "eoRealUXover"; }
+
+  /**
+   * Uniform crossover for real std::vectors
+   * @param _eo1 The first parent
+   * @param _eo2 The second parent
+   *    @std::runtime_error if sizes don't match
+   */
+  bool operator()(EOT& _eo1, EOT& _eo2)
+    {
+      if ( _eo1.size() != _eo2.size())
+	    std::runtime_error("UxOver --> chromosomes sizes don't match" );
+      bool changed = false;
+      for (unsigned int i=0; i<_eo1.size(); i++)
+	{
+	  if (rng.flip(preference))
+	    if (_eo1[i] != _eo2[i])
+	      {
+		double tmp = _eo1[i];
+	      _eo1[i]=_eo2[i];
+	      _eo2[i] = tmp;
+	      changed = true;
+	    }
+	}
+      return changed;
+    }
+    private:
+      float preference;
+};
+
+
+//-----------------------------------------------------------------------------
+//@}
+#endif
diff --git a/trunk/paradiseo-eo/src/es/eoSBXcross.h b/trunk/paradiseo-eo/src/es/eoSBXcross.h
new file mode 100644
index 000000000..34fa47944
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/eoSBXcross.h
@@ -0,0 +1,133 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoSBXcross.h
+// (c) Maarten Keijzer 2000 - Marc Schoenauer 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#include     // swap_ranges
+#include 
+#include 
+#include 
+#include 
+#include 
+
+
+
+template class eoSBXCrossover: public eoQuadOp
+{
+ public:
+  /****
+   * (Default) Constructor.
+   * The bounds are initialized with the global object that says: no bounds.
+   *
+   * 
+   */
+    eoSBXCrossover(const double& _eta = 1.0) :
+    bounds(eoDummyVectorNoBounds), eta(_eta), range(1) {}
+
+
+  //////////////////////////////////////////////
+
+  /**
+   * Constructor with bounds
+   * @param _bounds an eoRealVectorBounds that contains the bounds
+   * @param _alphaMin the amount of exploration OUTSIDE the parents 
+   *               as in BLX-alpha notation (Eshelman and Schaffer)
+   *               0 == contractive application
+   *               Must be positive
+   */
+
+
+
+     eoSBXCrossover(eoRealVectorBounds & _bounds, 
+   		     const double& _eta = 1.0) : 
+     bounds(_bounds), eta(_eta), range(1) {}
+
+  ///////////////////////////////////////////////
+
+  //////////////////////////////////////////////
+
+  /**
+   * Constructor from a parser. Will read from the argument parser
+   * eoRealVectorBounds that contains the bounds
+   * eta, the SBX parameter
+   */
+
+     eoSBXCrossover(eoParser & _parser) : 
+    // First, decide whether the objective variables are bounded
+    // Warning, must be the same keywords than other possible objectBounds elsewhere
+       bounds (_parser.getORcreateParam(eoDummyVectorNoBounds, "objectBounds", "Bounds for variables", 'B', "Variation Operators").value()) ,
+    // then get eta value
+       eta (_parser.getORcreateParam(1.0, "eta", "SBX eta parameter", '\0', "Variation Operators").value()) ,
+       range(1) {}
+    
+
+  /// The class name.
+  virtual std::string className() const { return "eoSBXCrossover"; }
+
+  /*****************************************
+   * SBX crossover - modifies both parents *
+   * @param _eo1 The first parent          *
+   * @param _eo2 The first parent          *    
+   *****************************************/
+  bool operator()(EOT& _eo1, EOT& _eo2)
+    {
+      unsigned i;
+      double r1, r2, beta;
+
+	for (i=0; i<_eo1.size(); i++)
+	  {
+      double u = rng.uniform(range) ;
+
+      if ( u <= 0.5 ) 
+	beta = exp( (1/(eta+1))*log(2*u));
+      else
+	beta = exp((1/(eta+1))*log(1/(2*(1-u))));
+
+
+	    
+	      r1=_eo1[i];
+	      r2=_eo2[i];   
+	      _eo1[i] =0.5*((1+beta)*r1+(1-beta)*r2);
+	      _eo2[i] =0.5*((1-beta)*r1+(1+beta)*r2);
+
+	
+	      if(!(bounds.isInBounds(i,_eo1[i])))
+		bounds.foldsInBounds(i,_eo1[i]);
+	      if(!(bounds.isInBounds(i,_eo2[i])))
+		bounds.foldsInBounds(i,_eo2[i]);
+
+
+
+	   }
+	return true;
+	}
+                  	   
+    
+
+protected:
+  eoRealVectorBounds & bounds;
+  double eta;
+  double range;			   // == 1
+};
+
+
diff --git a/trunk/paradiseo-eo/src/es/make_algo_scalar_es.cpp b/trunk/paradiseo-eo/src/es/make_algo_scalar_es.cpp
new file mode 100644
index 000000000..fa35cb36e
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/make_algo_scalar_es.cpp
@@ -0,0 +1,85 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_algo_scalar_es.cpp
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+/** This file contains ***INSTANCIATED DEFINITIONS*** of select/replace fns
+ * of the library for evolution of ***eoEs genotypes*** inside EO.
+ * It should be included in the file that calls any of the corresponding fns
+ * Compiling this file allows one to generate part of the library (i.e. object
+ * files that you just need to link with your own main and fitness code).
+ *
+ * The corresponding ***INSTANCIATED DECLARATIONS*** are contained 
+ *       in src/es/es.h
+ * while the TEMPLATIZED code is define in make_algo_scalar.h in the src/do dir
+ */
+
+// The templatized code
+#include 
+// the instanciating EOType(s)
+#include 	   // one Sigma per individual
+#include 	   // one sigmal per object variable
+#include 	   // full correlation matrix per indi
+
+/// The following function merely call the templatized do_* functions above
+
+// Algo
+///////
+eoAlgo >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc >& _eval, eoContinue >& _continue, eoGenOp >& _op, eoDistance >* _dist)
+{
+    return do_make_algo_scalar(_parser, _state, _eval, _continue, _op);
+}
+
+eoAlgo >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc >& _eval, eoContinue >& _continue, eoGenOp >& _op, eoDistance >* _dist)
+{
+  return do_make_algo_scalar(_parser, _state, _eval, _continue, _op);
+}
+
+//////////////
+eoAlgo >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc >& _eval, eoContinue >& _continue, eoGenOp >& _op, eoDistance >* _dist)
+{
+  return do_make_algo_scalar(_parser, _state, _eval, _continue, _op);
+}
+
+eoAlgo >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc >& _eval, eoContinue >& _continue, eoGenOp >& _op, eoDistance >* _dist)
+{
+  return do_make_algo_scalar(_parser, _state, _eval, _continue, _op);
+}
+
+///////////////
+eoAlgo >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc >& _eval, eoContinue >& _continue, eoGenOp >& _op, eoDistance >* _dist)
+{
+  return do_make_algo_scalar(_parser, _state, _eval, _continue, _op);
+}
+
+eoAlgo >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc >& _eval, eoContinue >& _continue, eoGenOp >& _op, eoDistance >* _dist)
+{
+  return do_make_algo_scalar(_parser, _state, _eval, _continue, _op);
+}
+
diff --git a/trunk/paradiseo-eo/src/es/make_algo_scalar_real.cpp b/trunk/paradiseo-eo/src/es/make_algo_scalar_real.cpp
new file mode 100644
index 000000000..91b5ccd13
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/make_algo_scalar_real.cpp
@@ -0,0 +1,61 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_algo_scalar_real.cpp
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+/** This file contains ***INSTANCIATED DEFINITIONS*** of select/replace fns
+ * of the library for evolution of ***eoReal*** inside EO.
+ * It should be included in the file that calls any of the corresponding fns
+ * Compiling this file allows one to generate part of the library (i.e. object
+ * files that you just need to link with your own main and fitness code).
+ *
+ * The corresponding ***INSTANCIATED DECLARATIONS*** are contained 
+ *       in src/es/real.h
+ * while the TEMPLATIZED code is define in make_algo_scalar.h in the src/do dir
+ */
+
+// The templatized code
+#include 
+// the instanciating EOType
+#include 
+
+/// The following function merely call the templatized do_* functions above
+
+// Algo
+///////
+eoAlgo >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc >& _eval, eoContinue >& _continue, eoGenOp >& _op, eoDistance >* _dist)
+{
+  return do_make_algo_scalar(_parser, _state, _eval, _continue, _op, _dist);
+}
+
+eoAlgo >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc >& _eval, eoContinue >& _continue, eoGenOp >& _op, eoDistance >* _dist)
+{
+  return do_make_algo_scalar(_parser, _state, _eval, _continue, _op, _dist);
+}
+
diff --git a/trunk/paradiseo-eo/src/es/make_checkpoint_es.cpp b/trunk/paradiseo-eo/src/es/make_checkpoint_es.cpp
new file mode 100644
index 000000000..dea658dcb
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/make_checkpoint_es.cpp
@@ -0,0 +1,83 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_checkpoint_es.cpp
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+/** This file contains ***INSTANCIATED DEFINITIONS*** of checkpoint fns
+ * of the library for evolution of ***ES genotypes*** inside EO.
+ * It should be included in the file that calls any of the corresponding fns
+ * Compiling this file allows one to generate part of the library (i.e. object
+ * files that you just need to link with your own main and fitness code).
+ *
+ * The corresponding ***INSTANCIATED DECLARATIONS*** are contained 
+ *       in src/es/es.h
+ * while the TEMPLATIZED code is define in make_checkpoint.h in the src/do dir
+ */
+
+// The templatized code
+#include 
+// the instanciating EOType(s)
+#include 	   // one Sigma per individual
+#include 	   // one sigmal per object variable
+#include 	   // full correlation matrix per indi
+
+/// The following function merely call the templatized do_* functions 
+
+// checkpoint
+/////////////
+eoCheckPoint >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter >& _eval, eoContinue >& _continue)
+{
+  return do_make_checkpoint(_parser, _state, _eval, _continue);
+}
+eoCheckPoint >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter >& _eval, eoContinue >& _continue) 
+{
+  return do_make_checkpoint(_parser, _state, _eval, _continue);
+}
+
+/////////////
+eoCheckPoint >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter >& _eval, eoContinue >& _continue)
+{
+  return do_make_checkpoint(_parser, _state, _eval, _continue);
+}
+eoCheckPoint >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter >& _eval, eoContinue >& _continue) 
+{
+  return do_make_checkpoint(_parser, _state, _eval, _continue);
+}
+
+/////////////
+eoCheckPoint >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter >& _eval, eoContinue >& _continue)
+{
+  return do_make_checkpoint(_parser, _state, _eval, _continue);
+}
+eoCheckPoint >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter >& _eval, eoContinue >& _continue) 
+{
+  return do_make_checkpoint(_parser, _state, _eval, _continue);
+}
+
+
diff --git a/trunk/paradiseo-eo/src/es/make_checkpoint_real.cpp b/trunk/paradiseo-eo/src/es/make_checkpoint_real.cpp
new file mode 100644
index 000000000..1995d78c1
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/make_checkpoint_real.cpp
@@ -0,0 +1,61 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_checkpoint_real.cpp
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+/** This file contains ***INSTANCIATED DEFINITIONS*** of checkpoint fns
+ * of the library for evolution of ***eoReal*** inside EO.
+ * It should be included in the file that calls any of the corresponding fns
+ * Compiling this file allows one to generate part of the library (i.e. object
+ * files that you just need to link with your own main and fitness code).
+ *
+ * The corresponding ***INSTANCIATED DECLARATIONS*** are contained 
+ *       in src/es/real.h
+ * while the TEMPLATIZED code is define in make_checkpoint.h in the src/do dir
+ */
+
+// The templatized code
+#include 
+// the instanciating EOType
+#include 
+
+/// The following function merely call the templatized do_* functions 
+
+// checkpoint
+/////////////
+eoCheckPoint >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter >& _eval, eoContinue >& _continue)
+{
+  return do_make_checkpoint(_parser, _state, _eval, _continue);
+}
+eoCheckPoint >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter >& _eval, eoContinue >& _continue) 
+{
+  return do_make_checkpoint(_parser, _state, _eval, _continue);
+}
+
+
diff --git a/trunk/paradiseo-eo/src/es/make_continue_es.cpp b/trunk/paradiseo-eo/src/es/make_continue_es.cpp
new file mode 100644
index 000000000..ca9d4fee3
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/make_continue_es.cpp
@@ -0,0 +1,83 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_continue_es.cpp
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+/** This file contains ***INSTANCIATED DEFINITIONS*** of continuator fns
+ * of the library for evolution of ***ES genotypes*** inside EO.
+ * It should be included in the file that calls any of the corresponding fns
+ * Compiling this file allows one to generate part of the library (i.e. object
+ * files that you just need to link with your own main and fitness code).
+ *
+ * The corresponding ***INSTANCIATED DECLARATIONS*** are contained 
+ *       in src/es/es.h
+ * while the TEMPLATIZED code is define in make_continue.h in the src/do dir
+ */
+
+// The templatized code
+#include 
+// the instanciating EOType(s)
+#include 	   // one Sigma per individual
+#include 	   // one sigmal per object variable
+#include 	   // full correlation matrix per indi
+
+/// The following function merely call the templatized do_* functions
+
+// continue
+///////////
+eoContinue >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter > & _eval)
+{
+  return do_make_continue(_parser, _state, _eval);
+}
+eoContinue >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter > & _eval)
+{
+  return do_make_continue(_parser, _state, _eval);
+}
+
+///////////
+eoContinue >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter > & _eval)
+{
+  return do_make_continue(_parser, _state, _eval);
+}
+eoContinue >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter > & _eval)
+{
+  return do_make_continue(_parser, _state, _eval);
+}
+
+///////////
+eoContinue >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter > & _eval)
+{
+  return do_make_continue(_parser, _state, _eval);
+}
+eoContinue >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter > & _eval)
+{
+  return do_make_continue(_parser, _state, _eval);
+}
+
+
diff --git a/trunk/paradiseo-eo/src/es/make_continue_real.cpp b/trunk/paradiseo-eo/src/es/make_continue_real.cpp
new file mode 100644
index 000000000..868e8eeca
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/make_continue_real.cpp
@@ -0,0 +1,61 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_continue_real.cpp
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+/** This file contains ***INSTANCIATED DEFINITIONS*** of continuator fns
+ * of the library for evolution of ***REAL vectors*** inside EO.
+ * It should be included in the file that calls any of the corresponding fns
+ * Compiling this file allows one to generate part of the library (i.e. object
+ * files that you just need to link with your own main and fitness code).
+ *
+ * The corresponding ***INSTANCIATED DECLARATIONS*** are contained 
+ *       in src/es/real.h
+ * while the TEMPLATIZED code is define in make_continue.h in the src/do dir
+ */
+
+// The templatized code
+#include 
+// the instanciating EOType
+#include 
+
+/// The following function merely call the templatized do_* functions
+
+// continue
+///////////
+eoContinue >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter > & _eval)
+{
+  return do_make_continue(_parser, _state, _eval);
+}
+eoContinue >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter > & _eval)
+{
+  return do_make_continue(_parser, _state, _eval);
+}
+
+
diff --git a/trunk/paradiseo-eo/src/es/make_es.h b/trunk/paradiseo-eo/src/es/make_es.h
new file mode 100644
index 000000000..3212f3916
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/make_es.h
@@ -0,0 +1,146 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// es.h
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+/** This file contains all ***INSTANCIATED*** declarations of all components 
+ * of the library for ***ES-like gnptype*** evolution inside EO.
+ * It should be included in the file that calls any of the corresponding fns
+ *
+ * The corresponding ***INSTANCIATED*** definitions are contained in 
+ * the different .cpp files in the src/es dir, 
+ * while the TEMPLATIZED code is define in the different make_XXX.h files
+ * either in hte src/do dir for representation independant functions, 
+ * or in the src/es dir for representation dependent stuff.
+ *
+ * See also real.h for the similar declarations of eoReal genotypes 
+ *   i.e. ***without*** mutation parameters attached to individuals
+ *
+ * Unlike most EO .h files, it does not (and should not) contain any code, 
+ * just declarations
+ */
+
+#ifndef es_h
+#define es_h
+
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+
+#include 	   // one Sigma per individual
+#include 	   // one sigmal per object variable
+#include 	   // full correlation matrix per indi
+
+// include all similar declaration for eoReal - i.e. real-valued genotyes
+// without self-adaptation
+#include 
+
+//Representation dependent - rewrite everything anew for each representation
+//////////////////////////
+// the genotypes 
+eoRealInitBounded > & make_genotype(eoParser& _parser, eoState& _state, eoEsSimple _eo);
+eoRealInitBounded > & make_genotype(eoParser& _parser, eoState& _state, eoEsSimple _eo);
+
+eoRealInitBounded > & make_genotype(eoParser& _parser, eoState& _state, eoEsStdev _eo);
+eoRealInitBounded > & make_genotype(eoParser& _parser, eoState& _state, eoEsStdev _eo);
+
+eoRealInitBounded > & make_genotype(eoParser& _parser, eoState& _state, eoEsFull _eo);
+eoRealInitBounded > & make_genotype(eoParser& _parser, eoState& _state, eoEsFull _eo);
+
+
+
+// the operators
+eoGenOp >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded >& _init);
+eoGenOp >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded >& _init);
+eoGenOp >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded >& _init);
+eoGenOp >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded >& _init);
+eoGenOp >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded >& _init);
+eoGenOp >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded >& _init);
+
+//Representation INdependent
+////////////////////////////
+// you don't need to modify that part even if you use your own representation
+
+// init pop
+eoPop >&  make_pop(eoParser& _parser, eoState& _state, eoInit >&);
+eoPop >&  make_pop(eoParser& _parser, eoState& _state, eoInit >&);
+
+eoPop >&  make_pop(eoParser& _parser, eoState& _state, eoInit >&);
+eoPop >&  make_pop(eoParser& _parser, eoState& _state, eoInit >&);
+
+eoPop >&  make_pop(eoParser& _parser, eoState& _state, eoInit >&);
+eoPop >&  make_pop(eoParser& _parser, eoState& _state, eoInit >&);
+
+// the continue's
+eoContinue >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter > & _eval);
+eoContinue >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter > & _eval);
+
+eoContinue >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter > & _eval);
+eoContinue >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter > & _eval);
+
+eoContinue >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter > & _eval);
+eoContinue >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter > & _eval);
+
+// the checkpoint
+eoCheckPoint >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter >& _eval, eoContinue >& _continue);
+eoCheckPoint >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter >& _eval, eoContinue >& _continue);
+
+eoCheckPoint >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter >& _eval, eoContinue >& _continue);
+eoCheckPoint >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter >& _eval, eoContinue >& _continue);
+
+eoCheckPoint >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter >& _eval, eoContinue >& _continue);
+eoCheckPoint >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter >& _eval, eoContinue >& _continue);
+
+
+// the algo
+eoAlgo >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc >& _eval, eoContinue >& _ccontinue, eoGenOp >& _op, eoDistance >* _dist = NULL);
+eoAlgo >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc >& _eval, eoContinue >& _ccontinue, eoGenOp >& _op, eoDistance >* _dist = NULL);
+
+eoAlgo >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc >& _eval, eoContinue >& _ccontinue, eoGenOp >& _op, eoDistance >* _dist = NULL);
+eoAlgo >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc >& _eval, eoContinue >& _ccontinue, eoGenOp >& _op, eoDistance >* _dist = NULL);
+
+eoAlgo >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc >& _eval, eoContinue >& _ccontinue, eoGenOp >& _op, eoDistance >* _dist = NULL);
+eoAlgo >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc >& _eval, eoContinue >& _ccontinue, eoGenOp >& _op, eoDistance >* _dist = NULL);
+
+// run
+void run_ea(eoAlgo >& _ga, eoPop >& _pop);
+void run_ea(eoAlgo >& _ga, eoPop >& _pop);
+
+void run_ea(eoAlgo >& _ga, eoPop >& _pop);
+void run_ea(eoAlgo >& _ga, eoPop >& _pop);
+
+void run_ea(eoAlgo >& _ga, eoPop >& _pop);
+void run_ea(eoAlgo >& _ga, eoPop >& _pop);
+
+// end of parameter input (+ .status + help)
+// that one is not templatized, but is here for completeness
+void make_help(eoParser & _parser);
+
+#endif
diff --git a/trunk/paradiseo-eo/src/es/make_genotype_es.cpp b/trunk/paradiseo-eo/src/es/make_genotype_es.cpp
new file mode 100644
index 000000000..41f764cdf
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/make_genotype_es.cpp
@@ -0,0 +1,121 @@
+/* (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+
+This library is free software; you can redistribute it and/or modify it under
+the terms of the GNU Lesser General Public License as published by the Free
+Software Foundation; either version 2 of the License, or (at your option) any
+later version.
+
+This library is distributed in the hope that it will be useful, but WITHOUT ANY
+WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
+
+You should have received a copy of the GNU Lesser General Public License along
+with this library; if not, write to the Free Software Foundation, Inc., 59
+Temple Place, Suite 330, Boston, MA 02111-1307 USA
+
+Contact: http://eodev.sourceforge.net
+         todos@geneura.ugr.es, http://geneura.ugr.es
+         Marc.Schoenauer@polytechnique.fr
+         mkeijzer@dhi.dk
+*/
+
+
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif
+
+
+/** Init functions
+
+This file contains ***INSTANCIATED DEFINITIONS*** of eoReal Init fns
+It should be included in the file that calls any of the corresponding
+fns Compiling this file allows one to generate part of the library
+(i.e. object files that you just need to link with your own main and
+fitness code).
+
+The corresponding ***INSTANCIATED DECLARATIONS*** are contained in
+src/es/make_real.h while the TEMPLATIZED code is define in
+make_genotype_real.h
+
+It is instanciated in src/es/make_genotype_real.cpp - and incorporated
+in the ga/libga.a
+
+It returns an eoInit that can later be used to initialize the
+population (see make_pop.h).
+
+It uses a parser (to get user parameters) and a state (to store the
+memory) the last argument is to disambiguate the call upon different
+instanciations.
+
+WARNING: that last argument will generally be the result of calling
+the default ctor of EOT, resulting in most cases in an EOT that is
+***not properly initialized***
+*/
+
+// the templatized code (same for real and es here)
+#include 
+
+
+/// The following function merely call the templatized do_* functions
+eoRealInitBounded >& make_genotype(eoParser& _parser,
+                                                      eoState& _state,
+                                                      eoEsSimple _eo)
+{
+    return do_make_genotype(_parser, _state, _eo);
+}
+
+
+
+eoRealInitBounded >& make_genotype(eoParser& _parser,
+                                                                   eoState& _state,
+                                                                   eoEsSimple _eo)
+{
+    return do_make_genotype(_parser, _state, _eo);
+}
+
+
+
+eoRealInitBounded >& make_genotype(eoParser& _parser,
+                                                     eoState& _state,
+                                                     eoEsStdev _eo)
+{
+    return do_make_genotype(_parser, _state, _eo);
+}
+
+
+
+eoRealInitBounded >& make_genotype(eoParser& _parser,
+                                                                  eoState& _state,
+                                                                  eoEsStdev _eo)
+{
+    return do_make_genotype(_parser, _state, _eo);
+}
+
+
+
+eoRealInitBounded > & make_genotype(eoParser& _parser,
+                                                     eoState& _state,
+                                                     eoEsFull _eo)
+{
+    return do_make_genotype(_parser, _state, _eo);
+}
+
+
+
+eoRealInitBounded >& make_genotype(eoParser& _parser,
+                                                                 eoState& _state,
+                                                                 eoEsFull _eo)
+{
+    return do_make_genotype(_parser, _state, _eo);
+}
+
+
+
+
+// Local Variables:
+// coding: iso-8859-1
+// c-file-style: "Stroustrup"
+// comment-column: 35
+// fill-column: 80
+// End:
diff --git a/trunk/paradiseo-eo/src/es/make_genotype_real.cpp b/trunk/paradiseo-eo/src/es/make_genotype_real.cpp
new file mode 100644
index 000000000..d5ad238d4
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/make_genotype_real.cpp
@@ -0,0 +1,73 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_genotype_real.cpp
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif
+
+/** This file contains ***INSTANCIATED DEFINITIONS*** of eoReal Init fns
+ * It should be included in the file that calls any of the corresponding fns
+ * Compiling this file allows one to generate part of the library (i.e. object
+ * files that you just need to link with your own main and fitness code).
+ *
+ * The corresponding ***INSTANCIATED DECLARATIONS*** are contained
+ *       in src/es/make_real.h
+ * while the TEMPLATIZED code is define in make_genotype_real.h
+ *
+ * It is instanciated in src/es/make_genotype_real.cpp -
+ * and incorporated in the ga/libga.a
+ *
+ * It returns an eoInit that can later be used to initialize
+ * the population (see make_pop.h).
+ *
+ * It uses a parser (to get user parameters) and a state (to store the memory)
+ * the last argument is to disambiguate the call upon different instanciations.
+ *
+ * WARNING: that last argument will generally be the result of calling
+ *          the default ctor of EOT, resulting in most cases in an EOT
+ *          that is ***not properly initialized***
+*/
+
+// the templatized code
+#include 
+
+/// The following functions merely call the templatized do_* functions
+eoRealInitBounded > & make_genotype(eoParser& _parser,
+                                                   eoState& _state,
+                                                   eoReal _eo)
+{
+    return do_make_genotype(_parser, _state, _eo);
+}
+
+
+
+eoRealInitBounded > & make_genotype(eoParser& _parser,
+                                                                eoState& _state,
+                                                                eoReal _eo)
+{
+    return do_make_genotype(_parser, _state, _eo);
+}
diff --git a/trunk/paradiseo-eo/src/es/make_genotype_real.h b/trunk/paradiseo-eo/src/es/make_genotype_real.h
new file mode 100644
index 000000000..a2077793e
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/make_genotype_real.h
@@ -0,0 +1,136 @@
+//-----------------------------------------------------------------------------
+/** (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+
+This library is free software; you can redistribute it and/or modify it under
+the terms of the GNU Lesser General Public License as published by the Free
+Software Foundation; either version 2 of the License, or (at your option) any
+later version.
+
+This library is distributed in the hope that it will be useful, but WITHOUT ANY
+WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
+
+You should have received a copy of the GNU Lesser General Public License along
+with this library; if not, write to the Free Software Foundation, Inc., 59
+Temple Place, Suite 330, Boston, MA 02111-1307 USA
+
+Contact: http://eodev.sourceforge.net
+         todos@geneura.ugr.es, http://geneura.ugr.es
+         Marc.Schoenauer@polytechnique.fr
+         mkeijzer@dhi.dk
+*/
+
+
+#ifndef EO_make_genotype_h
+#define EO_make_genotype_h
+
+#include 
+#include 
+#include 
+
+#include "es/eoReal.h"
+#include "es/eoEsChromInit.h"
+#include "utils/eoParser.h"
+#include "utils/eoRealVectorBounds.h"
+#include "utils/eoState.h"
+
+
+/** Initialize genotype
+
+This fuction does the initialization of what's needed for a particular genotype
+(here, std::vector == eoReal). It could be here tempatied only on the
+fitness, as it can be used to evolve bitstrings with any fitness. However, for
+consistency reasons, it was finally chosen, as in the rest of EO, to templatize
+by the full EOT, as this eventually allows to choose the type of genotype at run
+time (see in es dir)
+
+It is instanciated in src/es/make_genotyupe_real.cpp and incorporated in the
+src/es/libes.a
+
+It returns an eoInit tha can later be used to initialize the population
+(see make_pop.h).
+
+It uses a parser (to get user parameters) and a state (to store the memory) the
+last argument is to disambiguate the call upon different instanciations.
+
+WARNING: that last argument will generally be the result of calling the default
+ctor of EOT, resulting in most cases in an EOT that is ***not properly
+initialized***
+*/
+template 
+eoEsChromInit & do_make_genotype(eoParser& _parser, eoState& _state, EOT)
+{
+    // the fitness type
+    typedef typename EOT::Fitness FitT;
+    eoEsChromInit *init;
+
+    // for eoReal, only thing needed is the size - but might have been created elswhere ...
+    eoValueParam& vecSize
+        = _parser.getORcreateParam(unsigned(10), "vecSize",
+                                   "The number of variables ",
+                                   'n',"Genotype Initialization");
+    // to build an eoReal Initializer, we need bounds: [-1,1] by default
+    eoValueParam& boundsParam
+        = _parser.getORcreateParam(eoRealVectorBounds(vecSize.value(), -1, 1),
+                                   "initBounds",
+                                   "Bounds for initialization (MUST be bounded)",
+                                   'B', "Genotype Initialization");
+    // now some initial value for sigmas - even if useless?
+    // should be used in Normal mutation
+    eoValueParam& sigmaParam
+        = _parser.getORcreateParam(std::string("0.3"), "sigmaInit",
+                                   "Initial value for Sigmas (with a '%' -> scaled by the range of each variable)",
+				   's',"Genotype Initialization");
+    // check if there is a vecSigmaInit
+    eoParam *vecSigmaParam = _parser.getParamWithLongName("vecSigmaInit");
+    if(vecSigmaParam) {
+        eoValueParam >& vecSigmaParam
+            = _parser.getORcreateParam(std::vector(vecSize.value(), 0.3),
+                                       "vecSigmaInit", "Initial value for Sigma(s)",
+                                       'V',"Genotype Initialization");
+        init = new eoEsChromInit(boundsParam.value(), vecSigmaParam.value());
+    } else {
+        // now some initial value for sigmas - even if useless?
+        // should be used in Normal mutation
+        eoValueParam& sigmaParam
+            = _parser.getORcreateParam(std::string("0.3"), "sigmaInit",
+                                       "Initial value for Sigmas "
+                                       "(with '%' scaled by the range of each variable)",
+                                       's',"Genotype Initialization");
+        // check for %
+        bool to_scale = false;
+        size_t pos =  sigmaParam.value().find('%');
+        if(pos < sigmaParam.value().size())
+        {
+            //  found a % - use scaling and get rid of '%'
+            to_scale = true;
+            sigmaParam.value().resize(pos);
+        }
+        std::istringstream is(sigmaParam.value());
+        double sigma;
+        is >> sigma;
+        // minimum check
+        if(sigma < 0)
+            throw std::runtime_error("Negative sigma in make_genotype");
+        init = new eoEsChromInit(boundsParam.value(), sigma, to_scale);
+        // define parameter
+        _parser.getORcreateParam(std::vector(vecSize.value(), 0.3),
+                                 "vecSigmaInit", "Initial value for Sigma(s)",
+                                 'V',"Genotype Initialization");
+    }
+    // store in state
+    _state.storeFunctor(init);
+    return *init;
+}
+
+#endif // EO_make_genotype_h
+
+
+
+// Local Variables:
+// coding: iso-8859-1
+// mode:C++
+// c-file-style: "Stroustrup"
+// comment-column: 35
+// fill-column: 80
+// End:
diff --git a/trunk/paradiseo-eo/src/es/make_op.h b/trunk/paradiseo-eo/src/es/make_op.h
new file mode 100644
index 000000000..a19dc4b00
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/make_op.h
@@ -0,0 +1,294 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_op.h - the real-valued version
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _make_op_h
+#define _make_op_h
+
+// the operators
+#include 
+#include 
+#include 
+#include 
+// combinations of simple eoOps (eoMonOp and eoQuadOp)
+#include 
+
+// the specialized Real stuff
+#include 
+#include 
+#include 
+#include 
+  // also need the parser and param includes
+#include 
+#include 
+
+
+/*
+ * This function builds the operators that will be applied to the eoReal
+ *
+ * It uses a parser (to get user parameters) and a state (to store the memory)
+ * the last argument is an individual, needed for 2 reasons
+ *     it disambiguates the call after instanciations
+ *     some operator might need some private information about the indis
+ *
+ * This is why the template is the complete EOT even though only the fitness
+ * is actually templatized here: the following only applies to bitstrings
+ *
+ * Note : the last parameter is an eoInit: if some operator needs some info
+ *        about the gneotypes, the init has it all (e.g. bounds, ...)
+ *        Simply do
+ *        EOT myEO;
+ *        _init(myEO);
+ *        and myEO is then an ACTUAL object
+*/
+template 
+eoGenOp & do_make_op(eoParameterLoader& _parser, eoState& _state, eoInit& _init)
+{
+  // First, decide whether the objective variables are bounded
+  eoValueParam& boundsParam
+      = _parser.getORcreateParam(eoParamParamType("(0,1)"), "objectBounds",
+                                 "Bounds for variables (unbounded if absent)",
+                                 'B', "Genetic Operators");
+
+  // get initisalizer size == std::vector size
+  //  eoRealInitBounded * realInit = (eoRealInitBounded*)(&_init);
+  //  unsigned vecSize = realInit->theBounds().size();
+
+  // get std::vector size: safer???
+  EOT eoTmp;
+  _init(eoTmp);
+  unsigned vecSize = eoTmp.size();
+
+  // the bounds pointer
+  eoRealVectorBounds * ptBounds;
+  if (_parser.isItThere(boundsParam))	// otherwise, no bounds
+    {
+      /////Warning: this code should probably be replaced by creating
+      /////    some eoValueParam with specific implementation
+      ////     in eoParser.cpp. At the moemnt, it is there (cf also make_genotype
+      eoParamParamType & ppBounds = boundsParam.value(); // std::pair >
+      // transform into a std::vector
+      std::vector v;
+      std::vector::iterator it;
+      for (it=ppBounds.second.begin(); itc_str());
+	  double r;
+	  is >> r;
+	  v.push_back(r);
+	}
+      // now create the eoRealVectorBounds object
+      if (v.size() == 2) // a min and a max for all variables
+	ptBounds = new eoRealVectorBounds(vecSize, v[0], v[1]);
+      else				   // no time now
+	throw std::runtime_error("Sorry, only unique bounds for all variables implemented at the moment. Come back later");
+      // we need to give ownership of this pointer to somebody
+      /////////// end of temporary code
+    }
+  else			   // no param for bounds was given
+    ptBounds = new eoRealVectorNoBounds(vecSize); // DON'T USE eoDummyVectorNoBounds
+				   // as it does not have any dimension
+
+  // this is a temporary version(!),
+  // while Maarten codes the full tree-structured general operator input
+  // BTW we must leave that simple version available somehow, as it is the one
+  // that 90% people use!
+  eoValueParam& operatorParam
+      =  _parser.getORcreateParam(std::string("SGA"), "operator",
+                                  "Description of the operator (SGA only now)",
+                                  'o', "Genetic Operators");
+
+  if (operatorParam.value() != std::string("SGA"))
+    throw std::runtime_error("Sorry, only SGA-like operator available right now\n");
+
+    // now we read Pcross and Pmut,
+    // the relative weights for all crossovers -> proportional choice
+    // the relative weights for all mutations -> proportional choice
+    // and create the eoGenOp that is exactly
+    // crossover with pcross + mutation with pmut
+
+  eoValueParam& pCrossParam
+      = _parser.getORcreateParam(0.6, "pCross", "Probability of Crossover",
+                                 'C', "Genetic Operators" );
+  // minimum check
+  if ( (pCrossParam.value() < 0) || (pCrossParam.value() > 1) )
+    throw std::runtime_error("Invalid pCross");
+
+  eoValueParam& pMutParam
+      = _parser.getORcreateParam(0.1, "pMut", "Probability of Mutation",
+                                 'M', "Genetic Operators" );
+  // minimum check
+  if ( (pMutParam.value() < 0) || (pMutParam.value() > 1) )
+    throw std::runtime_error("Invalid pMut");
+
+    // the crossovers
+    /////////////////
+    // the parameters
+  eoValueParam& segmentRateParam
+      = _parser.getORcreateParam(double(1.0), "segmentRate",
+                                 "Relative rate for segment crossover",
+                                 's', "Genetic Operators" );
+  // minimum check
+  if ( (segmentRateParam.value() < 0) )
+    throw std::runtime_error("Invalid segmentRate");
+
+  eoValueParam& arithmeticRateParam
+      = _parser.getORcreateParam(double(2.0), "arithmeticRate",
+                                 "Relative rate for arithmetic crossover",
+                                 'A', "Genetic Operators" );
+  // minimum check
+  if ( (arithmeticRateParam.value() < 0) )
+    throw std::runtime_error("Invalid arithmeticRate");
+
+    // minimum check
+  bool bCross = true;
+  if (segmentRateParam.value()+arithmeticRateParam.value()==0)
+    {
+      std::cerr << "Warning: no crossover" << std::endl;
+      bCross = false;
+    }
+
+  // Create the CombinedQuadOp
+  eoPropCombinedQuadOp *ptCombinedQuadOp = NULL;
+  eoQuadOp *ptQuad = NULL;
+
+  if (bCross)
+    {
+      // segment crossover for bitstring - pass it the bounds
+      ptQuad = new eoSegmentCrossover(*ptBounds);
+      _state.storeFunctor(ptQuad);
+      ptCombinedQuadOp = new eoPropCombinedQuadOp(*ptQuad, segmentRateParam.value());
+
+	// arithmetic crossover
+      ptQuad = new eoArithmeticCrossover(*ptBounds);
+      _state.storeFunctor(ptQuad);
+      ptCombinedQuadOp->add(*ptQuad, arithmeticRateParam.value());
+
+      // don't forget to store the CombinedQuadOp
+      _state.storeFunctor(ptCombinedQuadOp);
+    }
+
+  // the mutations
+  /////////////////
+  // the parameters
+  eoValueParam & epsilonParam
+      = _parser.getORcreateParam(0.01, "epsilon", "Half-size of interval for Uniform Mutation",
+                                 'e', "Genetic Operators" );
+  // minimum check
+  if ( (epsilonParam.value() < 0) )
+    throw std::runtime_error("Invalid epsilon");
+
+  eoValueParam & uniformMutRateParam
+      = _parser.getORcreateParam(1.0, "uniformMutRate",
+                                 "Relative rate for uniform mutation", 'u', "Genetic Operators" );
+  // minimum check
+  if ( (uniformMutRateParam.value() < 0) )
+    throw std::runtime_error("Invalid uniformMutRate");
+
+  eoValueParam & detMutRateParam
+      = _parser.getORcreateParam(1.0, "detMutRate",
+                                 "Relative rate for deterministic uniform mutation",
+                                 'd', "Genetic Operators" );
+  // minimum check
+  if ( (detMutRateParam.value() < 0) )
+    throw std::runtime_error("Invalid detMutRate");
+
+  eoValueParam & normalMutRateParam
+      = _parser.getORcreateParam(1.0, "normalMutRate",
+                                 "Relative rate for Gaussian mutation",
+                                 'd', "Genetic Operators" );
+  // minimum check
+  if ( (normalMutRateParam.value() < 0) )
+    throw std::runtime_error("Invalid normalMutRate");
+  // and the sigma
+  eoValueParam & sigmaParam
+      = _parser.getORcreateParam(1.0, "sigma",
+                                 "Sigma (fixed) for Gaussian mutation",
+                                 'S', "Genetic Operators" );
+  // minimum check
+  if ( (sigmaParam.value() < 0) )
+    throw std::runtime_error("Invalid sigma");
+
+    // minimum check
+  bool bMut = true;
+  if (uniformMutRateParam.value()+detMutRateParam.value()+normalMutRateParam.value()==0)
+    {
+      std::cerr << "Warning: no mutation" << std::endl;
+      bMut = false;
+    }
+  if (!bCross && !bMut)
+    throw std::runtime_error("No operator called in SGA operator definition!!!");
+
+    // Create the CombinedMonOp
+  eoPropCombinedMonOp *ptCombinedMonOp = NULL;
+  eoMonOp *ptMon = NULL;
+
+  if (bMut)
+    {
+      // uniform mutation on all components:
+      // offspring(i) uniformly chosen in [parent(i)-epsilon, parent(i)+epsilon]
+      ptMon = new eoUniformMutation(*ptBounds, epsilonParam.value());
+      _state.storeFunctor(ptMon);
+      // create the CombinedMonOp
+      ptCombinedMonOp = new eoPropCombinedMonOp(*ptMon, uniformMutRateParam.value());
+
+	// mutate exactly 1 component (uniformly) per individual
+      ptMon = new eoDetUniformMutation(*ptBounds, epsilonParam.value());
+      _state.storeFunctor(ptMon);
+      ptCombinedMonOp->add(*ptMon, detMutRateParam.value());
+
+      // mutate all component using Gaussian mutation
+      ptMon = new eoNormalMutation(*ptBounds, sigmaParam.value());
+      _state.storeFunctor(ptMon);
+      ptCombinedMonOp->add(*ptMon, normalMutRateParam.value());
+      _state.storeFunctor(ptCombinedMonOp);
+    }
+
+  // now build the eoGenOp:
+  // to simulate SGA (crossover with proba pCross + mutation with proba pMut
+  // we must construct
+  //     a sequential combination of
+  //          with proba 1, a proportional combination of
+  //                        a QuadCopy and our crossover
+  //          with proba pMut, our mutation
+
+  // the crossover - with probability pCross
+  eoProportionalOp * cross = new eoProportionalOp ;
+  _state.storeFunctor(cross);
+  ptQuad = new eoQuadCloneOp;
+  _state.storeFunctor(ptQuad);
+  cross->add(*ptCombinedQuadOp, pCrossParam.value()); // user crossover
+  cross->add(*ptQuad, 1-pCrossParam.value()); // clone operator
+
+  // now the sequential
+  eoSequentialOp *op = new eoSequentialOp;
+  _state.storeFunctor(op);
+  op->add(*cross, 1.0);	 // always crossover (but clone with prob 1-pCross
+  op->add(*ptCombinedMonOp, pMutParam.value());
+
+  // that's it!
+  return *op;
+}
+#endif
diff --git a/trunk/paradiseo-eo/src/es/make_op_es.cpp b/trunk/paradiseo-eo/src/es/make_op_es.cpp
new file mode 100644
index 000000000..7f4635992
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/make_op_es.cpp
@@ -0,0 +1,80 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_op_real.cpp
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+/** This file contains ***INSTANCIATED DEFINITIONS*** of operators fns
+ * of the library for ***eoReal*** evolution inside EO.
+ * It should be included in the file that calls any of the corresponding fns
+ * Compiling this file allows one to generate part of the library (i.e. object
+ * files that you just need to link with your own main and fitness code).
+ *
+ * The corresponding ***INSTANCIATED DECLARATIONS*** are contained 
+ *       in es.h in src/es dir
+ * while the TEMPLATIZED code is define in make_op.h in the es dir
+ *
+ */
+
+// Templatized code
+#include 
+
+/// The following function merely call the templatized do_* functions above
+
+// operators
+////////////
+eoGenOp >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded >& _init)
+{
+  return do_make_op(_parser, _state, _init);
+}
+
+eoGenOp >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded >& _init)
+{
+  return do_make_op(_parser, _state, _init);
+}
+
+eoGenOp >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded >& _init)
+{
+  return do_make_op(_parser, _state, _init);
+}
+
+eoGenOp >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded >& _init)
+{
+  return do_make_op(_parser, _state, _init);
+}
+
+eoGenOp >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded >& _init)
+{
+  return do_make_op(_parser, _state, _init);
+}
+
+eoGenOp >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded >& _init)
+{
+  return do_make_op(_parser, _state, _init);
+}
+
diff --git a/trunk/paradiseo-eo/src/es/make_op_es.h b/trunk/paradiseo-eo/src/es/make_op_es.h
new file mode 100644
index 000000000..5fb15a056
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/make_op_es.h
@@ -0,0 +1,197 @@
+/* (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+
+This library is free software; you can redistribute it and/or modify it under
+the terms of the GNU Lesser General Public License as published by the Free
+Software Foundation; either version 2 of the License, or (at your option) any
+later version.
+
+This library is distributed in the hope that it will be useful, but WITHOUT ANY
+WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
+
+You should have received a copy of the GNU Lesser General Public License along
+with this library; if not, write to the Free Software Foundation, Inc., 59
+Temple Place, Suite 330, Boston, MA 02111-1307 USA
+
+Contact: http://eodev.sourceforge.net
+         todos@geneura.ugr.es, http://geneura.ugr.es
+         Marc.Schoenauer@polytechnique.fr
+         mkeijzer@dhi.dk
+ */
+
+
+#ifndef EO_make_op_h
+#define EO_make_op_h
+
+// the operators
+#include 
+#include 
+#include 
+#include 
+// combinations of simple eoOps (eoMonOp and eoQuadOp)
+#include 
+
+// the specialized Real stuff
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+  // also need the parser and param includes
+#include 
+#include 
+
+
+/*
+ * This function builds the operators that will be applied to the eoReal
+ *
+ * It uses a parser (to get user parameters) and a state (to store the memory)
+ * the last argument is an individual, needed for 2 reasons
+ *     it disambiguates the call after instanciations
+ *     some operator might need some private information about the indis
+ *
+ * This is why the template is the complete EOT even though only the fitness
+ * is actually templatized here: the following only applies to bitstrings
+ *
+ * Note : the last parameter is an eoInit: if some operator needs some info
+ *        about the gneotypes, the init has it all (e.g. bounds, ...)
+ *        Simply do
+ *        EOT myEO;
+ *        _init(myEO);
+ *        and myEO is then an ACTUAL object
+*/
+
+template 
+eoGenOp & do_make_op(eoParser& _parser, eoState& _state, eoRealInitBounded& _init)
+{
+  // get std::vector size
+  unsigned vecSize = _init.size();
+
+  // First, decide whether the objective variables are bounded
+  eoValueParam& boundsParam
+      = _parser.getORcreateParam(eoRealVectorBounds(vecSize,eoDummyRealNoBounds),
+                                 "objectBounds", "Bounds for variables",
+                                 'B', "Variation Operators");
+
+  std::cerr << boundsParam.value() << std::endl;
+
+    // now we read Pcross and Pmut,
+  eoValueParam& operatorParam
+      = _parser.getORcreateParam(std::string("SGA"), "operator",
+                                 "Description of the operator (SGA only now)",
+                                 'o', "Variation Operators");
+
+  if (operatorParam.value() != std::string("SGA"))
+    throw std::runtime_error("Sorry, only SGA-like operator available right now\n");
+
+    // now we read Pcross and Pmut,
+    // and create the eoGenOp that is exactly
+    // crossover with pcross + mutation with pmut
+
+  eoValueParam& pCrossParam
+      = _parser.getORcreateParam(1.0, "pCross", "Probability of Crossover",
+                                 'C', "Variation Operators" );
+  // minimum check
+  if ( (pCrossParam.value() < 0) || (pCrossParam.value() > 1) )
+    throw std::runtime_error("Invalid pCross");
+
+  eoValueParam& pMutParam
+      = _parser.getORcreateParam(1.0, "pMut", "Probability of Mutation",
+                                 'M', "Variation Operators" );
+  // minimum check
+  if ( (pMutParam.value() < 0) || (pMutParam.value() > 1) )
+    throw std::runtime_error("Invalid pMut");
+
+
+  // crossover
+  /////////////
+  // ES crossover
+  eoValueParam& crossTypeParam
+      = _parser.getORcreateParam(std::string("global"), "crossType",
+                                 "Type of ES recombination (global or standard)",
+                                 'C', "Variation Operators");
+
+  eoValueParam& crossObjParam
+      = _parser.getORcreateParam(std::string("discrete"), "crossObj",
+                                 "Recombination of object variables (discrete, intermediate or none)",
+                                 'O', "Variation Operators");
+  eoValueParam& crossStdevParam
+      = _parser.getORcreateParam(std::string("intermediate"), "crossStdev",
+                                 "Recombination of mutation strategy parameters "
+                                 "(intermediate, discrete or none)",
+                                 'S', "Variation Operators");
+
+  // The pointers: first the atom Xover
+  eoBinOp *ptObjAtomCross = NULL;
+  eoBinOp *ptStdevAtomCross = NULL;
+  // then the EOT-level one (need to be an eoGenOp as global Xover is
+  eoGenOp *ptCross;
+
+  // check for the atom Xovers
+  if (crossObjParam.value() == std::string("discrete"))
+    ptObjAtomCross = new eoDoubleExchange;
+  else if (crossObjParam.value() == std::string("intermediate"))
+    ptObjAtomCross = new eoDoubleIntermediate;
+  else if (crossObjParam.value() == std::string("none"))
+    ptObjAtomCross = new eoBinCloneOp;
+  else throw std::runtime_error("Invalid Object variable crossover type");
+
+  if (crossStdevParam.value() == std::string("discrete"))
+    ptStdevAtomCross = new eoDoubleExchange;
+  else if (crossStdevParam.value() == std::string("intermediate"))
+    ptStdevAtomCross = new eoDoubleIntermediate;
+  else if (crossStdevParam.value() == std::string("none"))
+    ptStdevAtomCross = new eoBinCloneOp;
+  else throw std::runtime_error("Invalid mutation strategy parameter crossover type");
+
+  // and build the indi Xover
+  if (crossTypeParam.value() == std::string("global"))
+    ptCross = new eoEsGlobalXover(*ptObjAtomCross, *ptStdevAtomCross);
+  else if (crossTypeParam.value() == std::string("standard"))
+    {	   // using a standard eoBinOp, but wrap it into an eoGenOp
+      eoBinOp & crossTmp = _state.storeFunctor(
+	     new eoEsStandardXover(*ptObjAtomCross, *ptStdevAtomCross)
+	     );
+      ptCross = new eoBinGenOp(crossTmp);
+    }
+  else throw std::runtime_error("Invalide Object variable crossover type");
+
+  // now that everything is OK, DON'T FORGET TO STORE MEMORY
+  _state.storeFunctor(ptObjAtomCross);
+  _state.storeFunctor(ptStdevAtomCross);
+  _state.storeFunctor(ptCross);
+
+  //  mutation
+  /////////////
+
+  // Ok, time to set up the self-adaptive mutation
+  // Proxy for the mutation parameters
+  eoEsMutationInit mutateInit(_parser, "Variation Operators");
+
+  eoEsMutate & mut =  _state.storeFunctor(
+      new eoEsMutate(mutateInit, boundsParam.value()));
+
+  // now the general op - a sequential application of crossover and mutatation
+  // no need to first have crossover combined with a clone as it is an
+  // eoBinOp and not an eoQuadOp as in SGA paradigm
+
+  eoSequentialOp & op = _state.storeFunctor(new eoSequentialOp);
+  op.add(*ptCross, pCrossParam.value());
+  op.add(mut, pMutParam.value());
+
+  // that's it!
+  return op;
+}
+#endif // EO_make_op_h
+
+
+
+// Local Variables:
+// coding: iso-8859-1
+// mode:C++
+// c-file-style: "Stroustrup"
+// comment-column: 35
+// fill-column: 80
+// End:
diff --git a/trunk/paradiseo-eo/src/es/make_op_real.cpp b/trunk/paradiseo-eo/src/es/make_op_real.cpp
new file mode 100644
index 000000000..19435831f
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/make_op_real.cpp
@@ -0,0 +1,59 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_op_real.cpp
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+/** This file contains ***INSTANCIATED DEFINITIONS*** of operators fns
+ * of the library for ***eoReal*** evolution inside EO.
+ * It should be included in the file that calls any of the corresponding fns
+ * Compiling this file allows one to generate part of the library (i.e. object
+ * files that you just need to link with your own main and fitness code).
+ *
+ * The corresponding ***INSTANCIATED DECLARATIONS*** are contained 
+ *       in es.h in src/es dir
+ * while the TEMPLATIZED code is define in make_op.h in the es dir
+ *
+ */
+
+// Templatized code
+#include 
+
+/// The following function merely call the templatized do_* functions above
+
+// oeprators
+////////////
+eoGenOp >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded >& _init)
+{
+  return do_make_op(_parser, _state, _init);
+}
+
+eoGenOp >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded >& _init)
+{
+  return do_make_op(_parser, _state, _init);
+}
diff --git a/trunk/paradiseo-eo/src/es/make_op_real.h b/trunk/paradiseo-eo/src/es/make_op_real.h
new file mode 100644
index 000000000..64f378837
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/make_op_real.h
@@ -0,0 +1,284 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_op.h - the real-valued version
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _make_op_h
+#define _make_op_h
+
+// the operators
+#include 
+#include 
+#include 
+#include 
+// combinations of simple eoOps (eoMonOp and eoQuadOp)
+#include 
+
+// the specialized Real stuff
+#include 
+#include 
+#include 
+#include 
+  // also need the parser and param includes
+#include 
+#include 
+
+
+/*
+ * This function builds the operators that will be applied to the eoReal
+ *
+ * It uses a parser (to get user parameters) and a state (to store the memory)
+ * the last argument is an individual, needed for 2 reasons
+ *     it disambiguates the call after instanciations
+ *     some operator might need some private information about the indis
+ *
+ * This is why the template is the complete EOT even though only the fitness
+ * is actually templatized here: the following only applies to bitstrings
+ *
+ * Note : the last parameter is an eoInit: if some operator needs some info
+ *        about the gneotypes, the init has it all (e.g. bounds, ...)
+ *        Simply do
+ *        EOT myEO;
+ *        _init(myEO);
+ *        and myEO is then an ACTUAL object
+*/
+
+template 
+eoGenOp & do_make_op(eoParser& _parser, eoState& _state, eoRealInitBounded& _init)
+{
+  // get std::vector size
+  unsigned vecSize = _init.size();
+
+  // First, decide whether the objective variables are bounded
+  eoValueParam& boundsParam
+      = _parser.getORcreateParam(eoRealVectorBounds(vecSize,eoDummyRealNoBounds), "objectBounds",
+                                 "Bounds for variables", 'B', "Variation Operators");
+
+  // this is a temporary version(!),
+  // while Maarten codes the full tree-structured general operator input
+  // BTW we must leave that simple version available somehow, as it is the one
+  // that 90% people use!
+  eoValueParam& operatorParam
+      = _parser.getORcreateParam(std::string("SGA"), "operator",
+                                 "Description of the operator (SGA only now)",
+                                 'o', "Variation Operators");
+
+  if (operatorParam.value() != std::string("SGA"))
+    throw std::runtime_error("Sorry, only SGA-like operator available right now\n");
+
+    // now we read Pcross and Pmut,
+    // the relative weights for all crossovers -> proportional choice
+    // the relative weights for all mutations -> proportional choice
+    // and create the eoGenOp that is exactly
+    // crossover with pcross + mutation with pmut
+
+  eoValueParam& pCrossParam
+      = _parser.getORcreateParam(0.6, "pCross",
+                                 "Probability of Crossover",
+                                 'C', "Variation Operators" );
+  // minimum check
+  if ( (pCrossParam.value() < 0) || (pCrossParam.value() > 1) )
+    throw std::runtime_error("Invalid pCross");
+
+  eoValueParam& pMutParam
+      = _parser.getORcreateParam(0.1, "pMut",
+                                 "Probability of Mutation",
+                                 'M', "Variation Operators" );
+  // minimum check
+  if ( (pMutParam.value() < 0) || (pMutParam.value() > 1) )
+    throw std::runtime_error("Invalid pMut");
+
+    // the crossovers
+    /////////////////
+    // the parameters
+  eoValueParam& alphaParam
+      = _parser.getORcreateParam(double(0.0), "alpha",
+                                 "Bound for factor of linear recombinations",
+                                 'a', "Variation Operators" );
+  // minimum check
+  if ( (alphaParam.value() < 0) )
+    throw std::runtime_error("Invalid BLX coefficient alpha");
+
+
+  eoValueParam& segmentRateParam
+      = _parser.getORcreateParam(double(1.0), "segmentRate",
+                                 "Relative rate for segment crossover",
+                                 's', "Variation Operators" );
+  // minimum check
+  if ( (segmentRateParam.value() < 0) )
+    throw std::runtime_error("Invalid segmentRate");
+
+  eoValueParam& hypercubeRateParam
+      = _parser.getORcreateParam(double(1.0), "hypercubeRate",
+                                 "Relative rate for hypercube crossover",
+                                 'A', "Variation Operators" );
+  // minimum check
+  if ( (hypercubeRateParam.value() < 0) )
+    throw std::runtime_error("Invalid hypercubeRate");
+
+  eoValueParam& uxoverRateParam
+      = _parser.getORcreateParam(double(1.0), "uxoverRate",
+                                 "Relative rate for uniform crossover",
+                                 'A', "Variation Operators" );
+  // minimum check
+  if ( (uxoverRateParam.value() < 0) )
+    throw std::runtime_error("Invalid uxoverRate");
+
+    // minimum check
+  bool bCross = true;
+  if (segmentRateParam.value()+hypercubeRateParam.value()+uxoverRateParam.value()==0)
+    {
+      std::cerr << "Warning: no crossover" << std::endl;
+      bCross = false;
+    }
+
+  // Create the CombinedQuadOp
+  eoPropCombinedQuadOp *ptCombinedQuadOp = NULL;
+  eoQuadOp *ptQuad = NULL;
+
+  if (bCross)
+    {
+      // segment crossover for bitstring - pass it the bounds
+      ptQuad = new eoSegmentCrossover(boundsParam.value(), alphaParam.value());
+      _state.storeFunctor(ptQuad);
+      ptCombinedQuadOp = new eoPropCombinedQuadOp(*ptQuad, segmentRateParam.value());
+
+	// hypercube crossover
+      ptQuad = new eoHypercubeCrossover(boundsParam.value(), alphaParam.value());
+      _state.storeFunctor(ptQuad);
+      ptCombinedQuadOp->add(*ptQuad, hypercubeRateParam.value());
+
+	// uniform crossover
+      ptQuad = new eoRealUXover();
+      _state.storeFunctor(ptQuad);
+      ptCombinedQuadOp->add(*ptQuad, uxoverRateParam.value());
+
+      // don't forget to store the CombinedQuadOp
+      _state.storeFunctor(ptCombinedQuadOp);
+    }
+
+  // the mutations
+  /////////////////
+  // the parameters
+  eoValueParam & epsilonParam
+      = _parser.getORcreateParam(0.01, "epsilon",
+                                 "Half-size of interval for Uniform Mutation",
+                                 'e', "Variation Operators" );
+  // minimum check
+  if ( (epsilonParam.value() < 0) )
+    throw std::runtime_error("Invalid epsilon");
+
+  eoValueParam & uniformMutRateParam
+      = _parser.getORcreateParam(1.0, "uniformMutRate",
+                                 "Relative rate for uniform mutation",
+                                 'u', "Variation Operators" );
+  // minimum check
+  if ( (uniformMutRateParam.value() < 0) )
+    throw std::runtime_error("Invalid uniformMutRate");
+
+  eoValueParam & detMutRateParam
+      = _parser.getORcreateParam(1.0, "detMutRate",
+                                 "Relative rate for deterministic uniform mutation",
+                                 'd', "Variation Operators" );
+  // minimum check
+  if ( (detMutRateParam.value() < 0) )
+    throw std::runtime_error("Invalid detMutRate");
+
+  eoValueParam & normalMutRateParam
+      = _parser.getORcreateParam(1.0, "normalMutRate",
+                                 "Relative rate for Gaussian mutation", 'd', "Variation Operators" );
+  // minimum check
+  if ( (normalMutRateParam.value() < 0) )
+    throw std::runtime_error("Invalid normalMutRate");
+
+  eoValueParam & sigmaParam
+      = _parser.getORcreateParam(0.3, "sigma",
+                                 "Sigma (fixed) for Gaussian mutation",
+                                 's', "Variation Operators" );
+
+  eoValueParam & pNormalParam
+      = _parser.getORcreateParam(1.0, "pNormal",
+                                 "Proba. to change each variable for Gaussian mutation",
+                                 's', "Variation Operators" );
+
+    // minimum check
+  bool bMut = true;
+  if (uniformMutRateParam.value()+detMutRateParam.value()+normalMutRateParam.value()==0)
+    {
+      std::cerr << "Warning: no mutation" << std::endl;
+      bMut = false;
+    }
+  if (!bCross && !bMut)
+    throw std::runtime_error("No operator called in SGA operator definition!!!");
+
+    // Create the CombinedMonOp
+  eoPropCombinedMonOp *ptCombinedMonOp = NULL;
+  eoMonOp *ptMon = NULL;
+
+  if (bMut)
+    {
+      // uniform mutation on all components:
+      // offspring(i) uniformly chosen in [parent(i)-epsilon, parent(i)+epsilon]
+      ptMon = new eoUniformMutation(boundsParam.value(), epsilonParam.value());
+      _state.storeFunctor(ptMon);
+      // create the CombinedMonOp
+      ptCombinedMonOp = new eoPropCombinedMonOp(*ptMon, uniformMutRateParam.value());
+
+	// mutate exactly 1 component (uniformly) per individual
+      ptMon = new eoDetUniformMutation(boundsParam.value(), epsilonParam.value());
+      _state.storeFunctor(ptMon);
+      ptCombinedMonOp->add(*ptMon, detMutRateParam.value());
+
+      // mutate all component using Gaussian mutation
+      ptMon = new eoNormalVecMutation(boundsParam.value(), sigmaParam.value(), pNormalParam.value());
+      _state.storeFunctor(ptMon);
+      ptCombinedMonOp->add(*ptMon, normalMutRateParam.value());
+      _state.storeFunctor(ptCombinedMonOp);
+    }
+
+  // now build the eoGenOp:
+  // to simulate SGA (crossover with proba pCross + mutation with proba pMut
+  // we must construct
+  //     a sequential combination of
+  //          with proba 1, a proportional combination of
+  //                        a QuadCopy and our crossover
+  //          with proba pMut, our mutation
+
+  // the crossover - with probability pCross
+  eoProportionalOp * cross = new eoProportionalOp ;
+  _state.storeFunctor(cross);
+  ptQuad = new eoQuadCloneOp;
+  _state.storeFunctor(ptQuad);
+  cross->add(*ptCombinedQuadOp, pCrossParam.value()); // user crossover
+  cross->add(*ptQuad, 1-pCrossParam.value()); // clone operator
+
+  // now the sequential
+  eoSequentialOp & op =  _state.storeFunctor(new eoSequentialOp);
+  op.add(*cross, 1.0);	 // always crossover (but clone with prob 1-pCross
+  op.add(*ptCombinedMonOp, pMutParam.value());
+
+  // that's it!
+  return op;
+}
+#endif
diff --git a/trunk/paradiseo-eo/src/es/make_pop_es.cpp b/trunk/paradiseo-eo/src/es/make_pop_es.cpp
new file mode 100644
index 000000000..4f77e2f58
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/make_pop_es.cpp
@@ -0,0 +1,86 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_pop_es.cpp
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+/** This file contains ***INSTANCIATED DEFINITIONS*** of pop. init. fns
+ * of the library for  evolution of ***ES genotypes*** indis inside EO.
+ * It should be included in the file that calls any of the corresponding fns
+ * Compiling this file allows one to generate part of the library (i.e. object
+ * files that you just need to link with your own main and fitness code).
+ *
+ * The corresponding ***INSTANCIATED DECLARATIONS*** are contained 
+ *       in src/es/es.h
+ * while the TEMPLATIZED code is define in make_pop.h in the src/do dir
+ */
+
+// The templatized code
+#include 
+// the instanciating EOType(s)
+#include 	   // one Sigma per individual
+#include 	   // one sigmal per object variable
+#include 	   // full correlation matrix per indi
+
+/// The following function merely call the templatized do_* functions above
+
+// Init POP
+///////////
+eoPop >&  make_pop(eoParser& _parser, eoState& _state, eoInit > & _init)
+{
+  return do_make_pop(_parser, _state, _init);
+}
+
+eoPop >&  make_pop(eoParser& _parser, eoState& _state, eoInit > & _init)
+{
+  return do_make_pop(_parser, _state, _init);
+}
+
+///////////
+eoPop >&  make_pop(eoParser& _parser, eoState& _state, eoInit > & _init)
+{
+  return do_make_pop(_parser, _state, _init);
+}
+
+eoPop >&  make_pop(eoParser& _parser, eoState& _state, eoInit > & _init)
+{
+  return do_make_pop(_parser, _state, _init);
+}
+
+///////////
+eoPop >&  make_pop(eoParser& _parser, eoState& _state, eoInit > & _init)
+{
+  return do_make_pop(_parser, _state, _init);
+}
+
+eoPop >&  make_pop(eoParser& _parser, eoState& _state, eoInit > & _init)
+{
+  return do_make_pop(_parser, _state, _init);
+}
+
+
diff --git a/trunk/paradiseo-eo/src/es/make_pop_real.cpp b/trunk/paradiseo-eo/src/es/make_pop_real.cpp
new file mode 100644
index 000000000..eaa75baab
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/make_pop_real.cpp
@@ -0,0 +1,62 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_pop_real.cpp
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+/** This file contains ***INSTANCIATED DEFINITIONS*** of pop. init. fns
+ * of the library for  evolution of ***eoReal*** indis inside EO.
+ * It should be included in the file that calls any of the corresponding fns
+ * Compiling this file allows one to generate part of the library (i.e. object
+ * files that you just need to link with your own main and fitness code).
+ *
+ * The corresponding ***INSTANCIATED DECLARATIONS*** are contained 
+ *       in src/es/real.h
+ * while the TEMPLATIZED code is define in make_pop.h in the src/do dir
+ */
+
+// The templatized code
+#include 
+// the instanciating EOType
+#include 
+
+/// The following function merely call the templatized do_* functions above
+
+// Init POP
+///////////
+eoPop >&  make_pop(eoParser& _parser, eoState& _state, eoInit > & _init)
+{
+  return do_make_pop(_parser, _state, _init);
+}
+
+eoPop >&  make_pop(eoParser& _parser, eoState& _state, eoInit > & _init)
+{
+  return do_make_pop(_parser, _state, _init);
+}
+
+
diff --git a/trunk/paradiseo-eo/src/es/make_real.h b/trunk/paradiseo-eo/src/es/make_real.h
new file mode 100644
index 000000000..594934ddf
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/make_real.h
@@ -0,0 +1,102 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// real.h
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+/** This file contains all ***INSTANCIATED*** declarations of all components 
+ * of the library for ***std::vector*** evolution inside EO.
+ * It should be included in the file that calls any of the corresponding fns
+ *
+ * The corresponding ***INSTANCIATED*** definitions are contained in 
+ * the different .cpp files in the src/es dir, 
+ * while the TEMPLATIZED code is define in the different make_XXX.h files
+ * either in hte src/do dir for representation independant functions, 
+ * or in the src/es dir for representation dependent stuff.
+ *
+ * See also es.h for the similar declarations of ES-like genotypes 
+ *   i.e. ***with*** mutation parameters attached to individuals
+ *
+ * Unlike most EO .h files, it does not (and should not) contain any code, 
+ * just declarations
+ */
+
+#ifndef real_h
+#define real_h
+
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+
+#include 
+#include 
+
+//Representation dependent - rewrite everything anew for each representation
+//////////////////////////
+
+// the genotypes 
+eoRealInitBounded > & make_genotype(eoParser& _parser, eoState& _state, eoReal _eo);
+eoRealInitBounded > & make_genotype(eoParser& _parser, eoState& _state, eoReal _eo);
+
+// the operators
+eoGenOp >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded >& _init);
+eoGenOp >&  make_op(eoParser& _parser, eoState& _state, eoRealInitBounded >& _init);
+
+//Representation INdependent
+////////////////////////////
+// you don't need to modify that part even if you use your own representation
+
+// init pop
+eoPop >&  make_pop(eoParser& _parser, eoState& _state, eoInit >&);
+eoPop >&  make_pop(eoParser& _parser, eoState& _state, eoInit >&);
+
+// the continue's
+eoContinue >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter > & _eval);
+eoContinue >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter > & _eval);
+
+// the checkpoint
+eoCheckPoint >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter >& _eval, eoContinue >& _continue);
+eoCheckPoint >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter >& _eval, eoContinue >& _continue);
+
+
+// the algo
+eoAlgo >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc >& _eval, eoContinue >& _ccontinue, eoGenOp >& _op, eoDistance >* _dist = NULL);
+
+eoAlgo >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc >& _eval, eoContinue >& _ccontinue, eoGenOp >& _op, eoDistance >* _dist = NULL);
+
+// run
+void run_ea(eoAlgo >& _ga, eoPop >& _pop);
+void run_ea(eoAlgo >& _ga, eoPop >& _pop);
+
+// end of parameter input (+ .status + help)
+// that one is not templatized
+// Because of that, the source is in src/utils dir
+void make_help(eoParser & _parser);
+
+#endif
diff --git a/trunk/paradiseo-eo/src/es/make_run_es.cpp b/trunk/paradiseo-eo/src/es/make_run_es.cpp
new file mode 100644
index 000000000..77a45a086
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/make_run_es.cpp
@@ -0,0 +1,87 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_run_es.cpp
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+/** This file contains ***INSTANCIATED DEFINITIONS*** of run funs
+ * of the library for evolution of  ***ES genotypes***  inside EO.
+ * It should be included in the file that calls any of the corresponding fns
+ * Compiling this file allows one to generate part of the library (i.e. object
+ * files that you just need to link with your own main and fitness code).
+ *
+ * The corresponding ***INSTANCIATED DECLARATIONS*** are contained 
+ *       in src/es/es.h
+ * while the TEMPLATIZED code is define in make_run.h in the src/do dir
+ */
+
+// The templatized code
+#include 
+// the instanciating EOType(s)
+#include 	   // one Sigma per individual
+#include 	   // one sigmal per object variable
+#include 	   // full correlation matrix per indi
+// the instanciating fitnesses
+#include 
+
+/// The following function merely call the templatized do_* functions above
+
+// run
+/////////
+void run_ea(eoAlgo >& _ga, eoPop >& _pop)
+{
+  do_run(_ga, _pop);
+}
+
+void run_ea(eoAlgo >& _ga, eoPop >& _pop)
+{
+  do_run(_ga, _pop);
+}
+
+/////////
+void run_ea(eoAlgo >& _ga, eoPop >& _pop)
+{
+  do_run(_ga, _pop);
+}
+
+void run_ea(eoAlgo >& _ga, eoPop >& _pop)
+{
+  do_run(_ga, _pop);
+}
+
+/////////
+void run_ea(eoAlgo >& _ga, eoPop >& _pop)
+{
+  do_run(_ga, _pop);
+}
+
+void run_ea(eoAlgo >& _ga, eoPop >& _pop)
+{
+  do_run(_ga, _pop);
+}
+
diff --git a/trunk/paradiseo-eo/src/es/make_run_real.cpp b/trunk/paradiseo-eo/src/es/make_run_real.cpp
new file mode 100644
index 000000000..ee10fd2a3
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/make_run_real.cpp
@@ -0,0 +1,63 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_run_real.cpp
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+/** This file contains ***INSTANCIATED DEFINITIONS*** of run funs
+ * of the library for evolution of  ***eoReal***  inside EO.
+ * It should be included in the file that calls any of the corresponding fns
+ * Compiling this file allows one to generate part of the library (i.e. object
+ * files that you just need to link with your own main and fitness code).
+ *
+ * The corresponding ***INSTANCIATED DECLARATIONS*** are contained 
+ *       in src/es/real.h
+ * while the TEMPLATIZED code is define in make_run.h in the src/do dir
+ */
+
+// The templatized code
+#include 
+// the instanciating EOType
+#include 
+// the instanciating fitnesses
+#include 
+
+/// The following function merely call the templatized do_* functions above
+
+// run
+/////////
+void run_ea(eoAlgo >& _ga, eoPop >& _pop)
+{
+  do_run(_ga, _pop);
+}
+
+void run_ea(eoAlgo >& _ga, eoPop >& _pop)
+{
+  do_run(_ga, _pop);
+}
+
diff --git a/trunk/paradiseo-eo/src/es/matrices.h b/trunk/paradiseo-eo/src/es/matrices.h
new file mode 100644
index 000000000..f30bd5c97
--- /dev/null
+++ b/trunk/paradiseo-eo/src/es/matrices.h
@@ -0,0 +1,42 @@
+#ifndef MATRICES_H
+#define MATRICES_H
+
+#include 
+
+class lower_triangular_matrix {
+
+    unsigned n;
+    std::vector data;
+
+    public:
+
+    lower_triangular_matrix(unsigned n_ = 0) : n(n_), data(n * (n+1) / 2) {};
+    
+    void resize(unsigned n_) {
+	n = n_;
+	data.resize(n*(n+1)/2);
+    }
+    
+    std::vector::iterator operator[](unsigned i) { return data.begin() + i * (i+1) / 2; }
+    std::vector::const_iterator operator[](unsigned i) const { return data.begin() + i*(i+1)/2; }
+};
+
+class square_matrix {
+    unsigned n;
+    std::vector data;
+
+    public:
+
+    square_matrix(unsigned n_ = 0) : n(n_), data(n * n) {};
+    
+    void resize(unsigned n_) {
+	n = n_;
+	data.resize(n*n);
+    }
+    
+    std::vector::iterator operator[](unsigned i) { return data.begin() + i * n; }
+    std::vector::const_iterator operator[](unsigned i) const { return data.begin() + i*n; }
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/ga.h b/trunk/paradiseo-eo/src/ga.h
new file mode 100644
index 000000000..87cc0e34c
--- /dev/null
+++ b/trunk/paradiseo-eo/src/ga.h
@@ -0,0 +1,42 @@
+//-----------------------------------------------------------------------------
+// ga.h
+// (c) GeNeura Team 1998 - 2000, Marc Schoenauer 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+ */
+//-----------------------------------------------------------------------------
+
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+#ifndef _ga_h
+#define _ga_h
+
+// all bitstring-specific files
+#include 
+
+// the operators
+#include 
+
+// #include  to be corrected - thanks someone!
+
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/trunk/paradiseo-eo/src/ga/.cvsignore b/trunk/paradiseo-eo/src/ga/.cvsignore
new file mode 100644
index 000000000..69fb0bd82
--- /dev/null
+++ b/trunk/paradiseo-eo/src/ga/.cvsignore
@@ -0,0 +1,6 @@
+*.lo
+*.la
+.deps
+.libs
+Makefile
+Makefile.in
diff --git a/trunk/paradiseo-eo/src/ga/CVS/Entries b/trunk/paradiseo-eo/src/ga/CVS/Entries
new file mode 100644
index 000000000..5e3b6a78c
--- /dev/null
+++ b/trunk/paradiseo-eo/src/ga/CVS/Entries
@@ -0,0 +1,23 @@
+/.cvsignore/1.1/Mon Apr  3 09:32:08 2000//
+/Makefile.am/1.13/Wed Sep 22 18:18:30 2004//
+/Readme/1.1/Tue Apr 24 04:52:04 2001//
+/eoBit.h/1.8/Wed Dec  7 15:40:23 2005//
+/eoBitOp.h/1.17/Fri Jun  6 10:29:13 2003//
+/eoBitOpFactory.h/1.5/Thu Feb 27 19:24:47 2003//
+/eoBoolFlip.h/1.1/Sat Aug  2 06:41:52 2003//
+/eoPBILAdditive.h/1.4/Thu Dec 23 15:29:06 2004//
+/eoPBILDistrib.h/1.3/Thu Feb 27 19:24:47 2003//
+/eoPBILOrg.h/1.4/Thu Dec 23 17:22:46 2004//
+/make_PBILdistrib.h/1.5/Mon Sep 26 10:18:15 2005//
+/make_PBILupdate.h/1.3/Thu Feb 27 19:24:45 2003//
+/make_algo_scalar_ga.cpp/1.5/Tue May 25 08:03:29 2004//
+/make_checkpoint_ga.cpp/1.3/Sat Nov 10 06:58:47 2001//
+/make_continue_ga.cpp/1.3/Sat Nov 10 06:58:47 2001//
+/make_ga.h/1.5/Tue May 25 08:03:30 2004//
+/make_genotype_ga.cpp/1.4/Sat Nov 10 06:58:47 2001//
+/make_genotype_ga.h/1.6/Fri Apr 26 02:39:10 2002//
+/make_op.h/1.5/Thu Feb 27 19:24:46 2003//
+/make_op_ga.cpp/1.3/Sat Nov 10 06:58:47 2001//
+/make_pop_ga.cpp/1.4/Sat Nov 10 06:58:47 2001//
+/make_run_ga.cpp/1.2/Sat Nov 10 06:58:47 2001//
+D
diff --git a/trunk/paradiseo-eo/src/ga/CVS/Repository b/trunk/paradiseo-eo/src/ga/CVS/Repository
new file mode 100644
index 000000000..41b26cb2f
--- /dev/null
+++ b/trunk/paradiseo-eo/src/ga/CVS/Repository
@@ -0,0 +1 @@
+eo/src/ga
diff --git a/trunk/paradiseo-eo/src/ga/CVS/Root b/trunk/paradiseo-eo/src/ga/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/src/ga/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/src/ga/Makefile.am b/trunk/paradiseo-eo/src/ga/Makefile.am
new file mode 100644
index 000000000..6429011eb
--- /dev/null
+++ b/trunk/paradiseo-eo/src/ga/Makefile.am
@@ -0,0 +1,32 @@
+###############################################################################
+##
+## Makefile.am for eo/src/ga
+##
+###############################################################################
+
+AM_CXXFLAGS		= -I$(top_builddir)/src  -I$(top_srcdir)/src
+
+lib_LIBRARIES 		= libga.a
+
+libga_a_SOURCES 	= make_algo_scalar_ga.cpp \
+			make_checkpoint_ga.cpp \
+			make_continue_ga.cpp \
+			make_genotype_ga.cpp \
+			make_op_ga.cpp \
+			make_pop_ga.cpp \
+			make_run_ga.cpp
+
+gaincludedir 		= $(pkgincludedir)/ga
+
+gainclude_HEADERS 	= eoBit.h \
+			eoBitOpFactory.h \
+			eoBitOp.h \
+			eoBoolFlip.h \
+			eoPBILAdditive.h \
+			eoPBILDistrib.h \
+			eoPBILOrg.h \
+			make_ga.h \
+			make_genotype_ga.h \
+			make_op.h \
+			make_PBILdistrib.h \
+			make_PBILupdate.h
diff --git a/trunk/paradiseo-eo/src/ga/Readme b/trunk/paradiseo-eo/src/ga/Readme
new file mode 100644
index 000000000..69d7d4660
--- /dev/null
+++ b/trunk/paradiseo-eo/src/ga/Readme
@@ -0,0 +1,21 @@
+This directory contains:
+
+- some standard EO source files, named eoXXXXX, that define objects 
+for the eoBit representation (bitstrings).
+
+- some make_XXX.cpp files that are instanciations for EO bitstrings
+(eoBit AND eoBit) of the tempatized code 
+that is defined in the EO src/do dir. 
+This MK's trick allows to actually compile all these bits in a library
+(eolibga.a) and to only recompile the bits you need for your own
+(bitstring!) application.
+@see src/do/make_XXX.h files, and test/t-eoGA.cpp for an example use.
+
+Note:
+Also are *defined* here two representation dependent make_XXX.h files
+(together with their instanciations in make_XXX.cpp), namely the ones
+that constructs the EOType initializer (make_genotype.h) and the one
+that buils up the operators (make_op.h).
+
+MS, April 23, 2001CVS
+
diff --git a/trunk/paradiseo-eo/src/ga/eoBit.h b/trunk/paradiseo-eo/src/ga/eoBit.h
new file mode 100644
index 000000000..7d8748935
--- /dev/null
+++ b/trunk/paradiseo-eo/src/ga/eoBit.h
@@ -0,0 +1,118 @@
+/*
+   eoBit.h
+   (c) GeNeura Team 1998, Marc Schoenauer 2000
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+*/
+
+/* MS, Nov. 23, 2000
+   Added the calls to base class I/O routines that print the fitness
+   Left printing/reading of the size of the bitstring,
+       for backward compatibility, and as it is a general practice in EO
+
+   MS, Feb. 7, 2001
+   replaced all ...Bin... names with ...Bit... names - for bitstring
+   as it was ambiguous with bin...ary things
+*/
+
+#ifndef eoBit_h
+#define eoBit_h
+
+//-----------------------------------------------------------------------------
+
+#include     // std::ostream, std::istream
+#include   // bind2nd
+#include       // std::string
+
+#include "eoVector.h"
+
+/** @defgroup bitstring
+
+Various functions for a bitstring representation
+*/
+
+/** Implementation of bitstring chromosome.
+
+@class eoBit eoBit.h ga/eoBit.h
+@ingroup bitstring
+
+Based on STL's std::vector specialization.
+*/
+template  class eoBit: public eoVector
+{
+public:
+
+    using eoVector< FitT, bool >::begin;
+    using eoVector< FitT, bool >::end;
+    using eoVector< FitT, bool >::resize;
+    using eoVector< FitT, bool >::size;
+
+  /**
+   * (Default) Constructor.
+   * @param size Size of the binary std::string.
+   */
+  eoBit(unsigned size = 0, bool value = false):
+    eoVector(size, value) {}
+
+  /// My class name.
+  virtual std::string className() const
+    {
+      return "eoBit";
+    }
+
+  /**
+   * To print me on a stream.
+   * @param os The std::ostream.
+   */
+  virtual void printOn(std::ostream& os) const
+    {
+      EO::printOn(os);
+      os << ' ';
+      os << size() << ' ';
+      std::copy(begin(), end(), std::ostream_iterator(os));
+    }
+
+  /**
+   * To read me from a stream.
+   * @param is The std::istream.
+   */
+  virtual void readFrom(std::istream& is)
+    {
+      EO::readFrom(is);
+      unsigned s;
+      is >> s;
+      std::string bits;
+      is >> bits;
+      if (is)
+	{
+	  resize(bits.size());
+	  std::transform(bits.begin(), bits.end(), begin(),
+		    std::bind2nd(std::equal_to(), '1'));
+	}
+    }
+};
+
+//-----------------------------------------------------------------------------
+
+#endif //eoBit_h
+
+
+// Local Variables:
+// mode: C++
+// c-file-style: "Stroustrup"
+// End:
diff --git a/trunk/paradiseo-eo/src/ga/eoBitOp.h b/trunk/paradiseo-eo/src/ga/eoBitOp.h
new file mode 100644
index 000000000..1d8c20cc3
--- /dev/null
+++ b/trunk/paradiseo-eo/src/ga/eoBitOp.h
@@ -0,0 +1,448 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoBitOp.h
+// (c) GeNeura Team, 2000 - EEAAX 2000 - Maarten Keijzer 2000
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+ CVS Info: $Date: 2003/06/06 10:29:13 $ $Header: /cvsroot/eodev/eo/src/ga/eoBitOp.h,v 1.17 2003/06/06 10:29:13 maartenkeijzer Exp $ $Author: maartenkeijzer $
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoBitOp_h
+#define eoBitOp_h
+
+//-----------------------------------------------------------------------------
+
+#include     // swap_ranges
+#include 
+#include        // eoMonOp
+#include 
+
+
+/** eoBitFlip --> changes 1 bit
+\class eoBitBitFlip eoBitOp.h ga/eoBitOp.h
+\ingroup bitstring
+*/
+
+template class eoOneBitFlip: public eoMonOp
+{
+ public:
+  /// The class name.
+  virtual std::string className() const { return "eoOneBitFlip"; }
+
+  /**
+   * Change one bit.
+   * @param chrom The cromosome which one bit is going to be changed.
+   */
+  bool operator()(Chrom& chrom)
+    {
+      unsigned i = eo::rng.random(chrom.size());
+      chrom[i] = (chrom[i]) ? false : true;
+      return true;
+    }
+};
+
+/** eoDetBitFlip --> changes exactly k bits
+\class eoDetBitFlip eoBitOp.h ga/eoBitOp.h
+\ingroup bitstring
+*/
+
+template class eoDetBitFlip: public eoMonOp
+{
+ public:
+  /**
+   * (Default) Constructor.
+   * @param _num_bit The number of bits to change
+   * default is one - equivalent to eoOneBitFlip then
+   */
+  eoDetBitFlip(const unsigned& _num_bit = 1): num_bit(_num_bit) {}
+
+  /// The class name.
+  virtual std::string className() const { return "eoDetBitFlip"; }
+
+  /**
+   * Change num_bit bits.
+   * @param chrom The cromosome which one bit is going to be changed.
+   */
+  bool operator()(Chrom& chrom)
+    {
+      // does not check for duplicate: if someone volunteers ....
+      for (unsigned k=0; k classical mutation
+\class eoBitMutation eoBitOp.h ga/eoBitOp.h
+\ingroup bitstring
+*/
+
+template class eoBitMutation: public eoMonOp
+{
+ public:
+  /**
+   * (Default) Constructor.
+   * @param _rate Rate of mutation.
+   */
+  eoBitMutation(const double& _rate = 0.01, bool _normalize=false): 
+    rate(_rate), normalize(_normalize) {}
+
+  /// The class name.
+  virtual std::string className() const { return "eoBitMutation"; }
+
+  /**
+   * Mutate a chromosome.
+   * @param chrom The chromosome to be mutated.
+   */
+  bool operator()(Chrom& chrom)
+    {
+      double actualRate = (normalize ? rate/chrom.size() : rate);
+      bool changed_something = false;
+      for (unsigned i = 0; i < chrom.size(); i++)
+	    if (eo::rng.flip(actualRate))
+        {
+	        chrom[i] = !chrom[i];
+            changed_something = true;
+        }
+
+        return changed_something;
+    }
+
+ private:
+  double rate;
+  bool normalize;		   // divide rate by chromSize
+};
+
+
+/** eoBitInversion: inverts the bits of the chromosome between an interval
+\class eoBitInversion eoBitOp.h ga/eoBitOp.h
+\ingroup bitstring
+*/
+
+template class eoBitInversion: public eoMonOp
+{
+ public:
+  /// The class name.
+  virtual std::string className() const { return "eoBitInversion"; }
+
+  /**
+   * Inverts a range of bits in a binary chromosome.
+   * @param chrom The chromosome whos bits are going to be inverted (a range).
+   */
+  bool operator()(Chrom& chrom)
+    {
+
+      unsigned u1 = eo::rng.random(chrom.size() + 1) , u2;
+      do u2 = eo::rng.random(chrom.size() + 1); while (u1 == u2);
+      unsigned r1 = std::min(u1, u2), r2 = std::max(u1, u2);
+
+      std::reverse(chrom.begin() + r1, chrom.begin() + r2);
+      return true;
+    }
+};
+
+
+/** eoBitNext --> next value when bitstring considered as binary value
+\class eoBitNext eoBitOp.h ga/eoBitOp.h
+\ingroup bitstring
+*/
+
+template class eoBitNext: public eoMonOp
+{
+ public:
+  /// The class name.
+  virtual std::string className() const { return "eoBitNext"; }
+
+  /**
+   * Change the bit std::string x to be x+1.
+   * @param chrom The chromosome to be added one.
+   */
+  bool operator()(Chrom& chrom)
+    {
+      for (int i = chrom.size() - 1; i >= 0; i--)
+	if (chrom[i])
+	  {
+	    chrom[i] = 0;
+	    continue;
+	  }
+	else
+	  {
+	    chrom[i] = 1;
+	    break;
+	  }
+
+    return true;
+    }
+};
+
+
+/** eoBitPrev --> previous value when bitstring treated as binary value
+\class eoBitPrev eoBitOp.h ga/eoBitOp.h
+\ingroup bitstring
+*/
+
+template class eoBitPrev: public eoMonOp
+{
+ public:
+  /// The class name.
+  virtual std::string className() const { return "eoBitPrev"; }
+
+  /**
+   * Change the bit std::string x to be x-1.
+   * @param chrom The chromosome to be substracted one.
+   */
+  bool operator()(Chrom& chrom)
+    {
+      for (int i = chrom.size() - 1; i >= 0; i--)
+	if (chrom[i])
+	  {
+	    chrom[i] = 0;
+	    break;
+	  }
+	else
+	  {
+	    chrom[i] = 1;
+	    continue;
+	  }
+
+    return true;
+    }
+};
+
+
+/** eo1PtBitXover --> classic 1-point crossover
+\class eo1PtBitCrossover eoBitOp.h ga/eoBitOp.h
+\ingroup bitstring
+*/
+
+template class eo1PtBitXover: public eoQuadOp
+{
+ public:
+  /// The class name.
+  virtual std::string className() const { return "eo1PtBitXover"; }
+
+  /**
+   * 1-point crossover for binary chromosomes.
+   * @param chrom1 The first chromosome.
+   * @param chrom2 The first chromosome.
+   */
+  bool operator()(Chrom& chrom1, Chrom& chrom2)
+    {
+      unsigned site = eo::rng.random(std::min(chrom1.size(), chrom2.size()));
+
+      if (!std::equal(chrom1.begin(), chrom1.begin()+site, chrom2.begin()))
+      {
+
+        std::swap_ranges(chrom1.begin(), chrom1.begin() + site, chrom2.begin());
+
+        return true;
+      }
+      return false;
+  }
+};
+
+
+/** eoUBitXover --> classic Uniform crossover
+\class eoUBitXover eoBitOp.h ga/eoBitOp.h
+\ingroup bitstring
+*/
+
+template class eoUBitXover: public eoQuadOp
+{
+ public:
+  /// (Default) Constructor.
+  eoUBitXover(const float& _preference = 0.5): preference(_preference)
+    {
+      if ( (_preference <= 0.0) || (_preference >= 1.0) )
+	std::runtime_error("UxOver --> invalid preference");
+    }
+  /// The class name.
+  virtual std::string className() const { return "eoUBitXover"; }
+
+  /**
+   * Uniform crossover for binary chromosomes.
+   * @param chrom1 The first chromosome.
+   * @param chrom2 The first chromosome.
+   *    @std::runtime_error if sizes don't match
+   */
+  bool operator()(Chrom& chrom1, Chrom& chrom2)
+    {
+      if ( chrom1.size() != chrom2.size())
+	    std::runtime_error("UxOver --> chromosomes sizes don't match" );
+      bool changed = false;
+      for (unsigned int i=0; i n-point crossover
+\class eoNPtsBitXover eoBitOp.h ga/eoBitOp.h
+\ingroup bitstring
+*/
+
+template class eoNPtsBitXover: public eoQuadOp
+{
+ public:
+  /// (Default) Constructor.
+  eoNPtsBitXover(const unsigned& _num_points = 2): num_points(_num_points)
+    {
+      if (num_points < 1)
+	std::runtime_error("NxOver --> invalid number of points");
+    }
+
+  /// The class name.
+  virtual std::string className() const { return "eoNPtsBitXover"; }
+
+  /**
+   * n-point crossover for binary chromosomes.
+   * @param chrom1 The first chromosome.
+   * @param chrom2 The first chromosome.
+   */
+  bool operator()(Chrom& chrom1, Chrom& chrom2)
+    {
+      unsigned max_size = std::min(chrom1.size(), chrom2.size());
+      unsigned max_points = std::min(max_size - 1, num_points);
+
+      std::vector points(max_size, false);
+
+      // select ranges of bits to swap
+      do {
+	unsigned bit = eo::rng.random(max_size) + 1;
+	if (points[bit])
+	  continue;
+	else
+	  {
+	    points[bit] = true;
+	    max_points--;
+	  }
+      } while (max_points);
+
+
+      // swap bits between chromosomes
+      bool change = false;
+      for (unsigned bit = 1; bit < points.size(); bit++)
+	{
+	  if (points[bit])
+	    change = !change;
+
+	  if (change)
+	  {
+	  	typename Chrom::AtomType tmp= chrom1[bit];
+		chrom1[bit] = chrom2[bit];
+		chrom2[bit] = tmp;
+	  }
+	}
+
+    return true;
+    }
+
+ private:
+  unsigned num_points;
+};
+
+
+
+/** eoBitGxOver --> Npts crossover when bistd::string considered
+                    as a std::string of binary-encoded genes (exchanges genes)
+Is anybody still using it apart from historians ??? :-)
+\class eoBitGxOver eoBitOp.h ga/eoBitOp.h
+\ingroup bitstring
+*/
+
+template class eoBitGxOver: public eoQuadOp
+{
+ public:
+  /// Constructor.
+  eoBitGxOver(const unsigned _gene_size, const unsigned _num_points = 2):
+    gene_size(_gene_size), num_points(_num_points)
+    {
+      if (gene_size < 1)
+	std::runtime_error("GxOver --> invalid gene size");
+      if (num_points < 1)
+	std::runtime_error("GxOver --> invalid number of points");
+    }
+
+  /// The class name
+  virtual std::string className() const { return "eoBitGxOver"; }
+
+  /**
+   * Gene crossover for binary chromosomes.
+   * @param chrom1 The first chromosome.
+   * @param chrom2 The first chromosome.
+   */
+  bool operator()(Chrom& chrom1, Chrom& chrom2)
+    {
+      unsigned max_genes = std::min(chrom1.size(), chrom2.size()) / gene_size;
+      unsigned cut_genes = std::min(max_genes, num_points);
+
+      std::vector points(max_genes, false);
+      
+      // selects genes to swap
+      do {
+	unsigned bit = eo::rng.random(max_genes); 
+	if (points[bit])
+	  continue;
+	else
+	  {
+	    points[bit] = true;
+	    cut_genes--;
+	  }
+      } while (cut_genes);
+      
+      // swaps genes
+      for (unsigned i = 0; i < points.size(); i++)
+	if (points[i])
+	  std::swap_ranges(chrom1.begin() + i * gene_size, 
+		      chrom1.begin() + i * gene_size + gene_size, 
+		      chrom2.begin() + i * gene_size);
+
+    return true;
+  }
+
+ private:
+  unsigned gene_size;
+  unsigned num_points;
+};
+
+
+
+//-----------------------------------------------------------------------------
+//@}
+#endif
+
diff --git a/trunk/paradiseo-eo/src/ga/eoBitOpFactory.h b/trunk/paradiseo-eo/src/ga/eoBitOpFactory.h
new file mode 100644
index 000000000..27394aef6
--- /dev/null
+++ b/trunk/paradiseo-eo/src/ga/eoBitOpFactory.h
@@ -0,0 +1,170 @@
+// eoBitOpFactory.h
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoOpFactory.h
+// (c) GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _EOBITOPFACTORY_H
+#define _EOBITOPFACTORY_H
+
+#include 
+#include 
+
+//-----------------------------------------------------------------------------
+
+/** EO Factory. An instance of the factory class to create operators that act
+on bitstring chromosomes. Only those chromosomes can instantiate the operators
+that are created here
+@see eoSelect*/
+template< class EOT>
+class eoBitOpFactory: public eoFactory  
+{
+	
+public:
+	
+	/// @name ctors and dtors
+	//{@
+	/// constructor
+	eoBitOpFactory( ) {};
+	
+	/// destructor
+	virtual ~eoBitOpFactory() {};
+	//@}
+
+	/** Another factory method: creates an object from an std::istream, reading from
+	it whatever is needed to create the object. Usually, the format for the std::istream will be\\
+	objectType parameter1 parameter2 ... parametern\\
+	If there are problems, an std::exception is raised; it should be caught at the
+	upper level, because it might be something for that level\\
+	At the same time, it catches std::exceptions thrown at a lower level, which will
+	indicate that whatever is in the stream is for this method to process
+	@param _is an stream from where a single line will be read
+	@throw runtime_std::exception if the object type is not known
+	*/
+	virtual eoOp* make(std::istream& _is) 
+    {
+		eoOp * opPtr = NULL;
+		try {
+			opPtr = eoFactory::make( _is );
+		} catch ( const std::string& objectTypeStr ) {
+			if ( objectTypeStr == "eoBinBitFlip" ) {
+				opPtr = new eoOneBitFlip( );
+			} 
+			// handles old operator names as well as new ones
+			if ( objectTypeStr == "eoOneBitFlip" ) {
+				opPtr = new eoOneBitFlip( );
+			} 
+
+			// Standard BitFilp Mutation
+			if ( objectTypeStr == "eoBinMutation" ) {
+				float rate;
+				_is >> rate;
+				opPtr = new eoBitMutation( rate );
+			} 
+			if ( objectTypeStr == "eoBitMutation" ) {
+				float rate;
+				_is >> rate;
+				opPtr = new eoBitMutation( rate );
+			} 
+
+			// Bit inversion
+			if ( objectTypeStr == "eoBinInversion" ) {
+				opPtr = new eoBitInversion( );
+			}
+			if ( objectTypeStr == "eoBitInversion" ) {
+				opPtr = new eoBitInversion( );
+			}
+
+			// Next binary value
+			if ( objectTypeStr == "eoBinNext" ) {
+				opPtr = new eoBitNext( );
+			}
+			if ( objectTypeStr == "eoBitNext" ) {
+				opPtr = new eoBitNext( );
+			}
+
+			// Previous binary value
+			if ( objectTypeStr == "eoBinPrev" ) {
+				opPtr = new eoBitPrev( );
+			}
+			if ( objectTypeStr == "eoBitPrev" ) {
+				opPtr = new eoBitPrev( );
+			}
+
+			// 1 point Xover
+			if ( objectTypeStr == "eoBinCrossover" ) {
+				opPtr = new eo1PtBitXover( );
+			}
+			if ( objectTypeStr == "eo1PtBitXover" ) {
+				opPtr = new eo1PtBitXover( );
+			}
+
+			// Npts Xover
+			if ( objectTypeStr == "eoBinNxOver" ) {
+				unsigned nPoints;
+				_is >> nPoints;
+				opPtr = new eoNPtsBitXover( nPoints );
+			}
+			if ( objectTypeStr == "eoNPtsBitXover" ) {
+				unsigned nPoints;
+				_is >> nPoints;
+				opPtr = new eoNPtsBitXover( nPoints );
+			}
+
+			// Gene Xover (obsolete)
+			if ( objectTypeStr == "eoBinGxOver" ) {
+				unsigned geneSize, nPoints;
+				_is >> geneSize >> nPoints;
+				opPtr = new eoBitGxOver( geneSize, nPoints );
+			}
+			if ( objectTypeStr == "eoBitGxOver" ) {
+				unsigned geneSize, nPoints;
+				_is >> geneSize >> nPoints;
+				opPtr = new eoBitGxOver( geneSize, nPoints );
+			}
+
+			// Uniform Xover
+			if ( objectTypeStr == "eoBinUxOver" ) {
+				float rate;
+				_is >> rate;
+				opPtr = new eoUBitXover( rate );
+			}
+			if ( objectTypeStr == "eoUBitXover" ) {
+				float rate;
+				_is >> rate;
+				opPtr = new eoUBitXover( rate );
+			}
+
+			// nothing read!
+			if ( !opPtr ) {	// to be caught by the upper level
+				throw objectTypeStr;
+			}
+		}
+		return opPtr;
+	};
+
+
+};
+
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/ga/eoBoolFlip.h b/trunk/paradiseo-eo/src/ga/eoBoolFlip.h
new file mode 100644
index 000000000..cf226ebac
--- /dev/null
+++ b/trunk/paradiseo-eo/src/ga/eoBoolFlip.h
@@ -0,0 +1,46 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoBoolFlip.h
+// (c) Marc Schoenauer, 2003
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@inria.fr
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoBoolFlip_h
+#define _eoBoolFlip_h
+
+#include 
+
+/** a simple boolean mutation - to be used in generic eoOp's
+ */
+class eoBoolFlip : public eoMonOp {
+public: 
+  /** simply flips the boolean argument */
+  bool operator()(bool & _b)
+  {
+    _b = !_b;
+    return true;
+  }
+
+  /** inherited className() */
+  virtual string className() const {return "boolFlip";}
+
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/ga/eoPBILAdditive.h b/trunk/paradiseo-eo/src/ga/eoPBILAdditive.h
new file mode 100644
index 000000000..bea4c5062
--- /dev/null
+++ b/trunk/paradiseo-eo/src/ga/eoPBILAdditive.h
@@ -0,0 +1,120 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoPBILAdditive.h
+// (c) Marc Schoenauer, Maarten Keijzer, 2001
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoPBILAdditive_H
+#define _eoPBILAdditive_H
+
+#include 
+#include 
+
+/**
+ * Distribution Class for PBIL algorithm
+ *      (Population-Based Incremental Learning, Baluja and Caruana 96)
+ *
+ * This class implements an extended update rule:
+ * in the original paper, the authors used
+ *
+ *  p(i)(t+1) = (1-LR)*p(i)(t) + LR*best(i)
+ *
+ * here the same formula is applied, with some of the best individuals
+ * and for some of the worst individuals (with different learning rates)
+*/
+
+template 
+class eoPBILAdditive :  public eoDistribUpdater
+{
+public:
+  /** Ctor with parameters
+   *  using the default values is equivalent to using eoPBILOrg
+   */
+  eoPBILAdditive(double _LRBest, unsigned _nbBest = 1,
+		double _tolerance=0.0,
+		double _LRWorst = 0.0, unsigned _nbWorst = 0 ) :
+    maxBound(1.0-_tolerance), minBound(_tolerance),
+    LR(0.0), nbBest(_nbBest), nbWorst(_nbWorst)
+  {
+    if (nbBest+nbWorst == 0)
+      throw std::runtime_error("Must update either from best or from worst in eoPBILAdditive");
+
+    if (_nbBest)
+      {
+	lrb = _LRBest/_nbBest;
+	LR += _LRBest;
+      }
+    else
+      lrb=0.0;			   // just in case
+    if (_nbWorst)
+      {
+	lrw = _LRWorst/_nbWorst;
+	LR += _LRWorst;
+      }
+    else
+      lrw=0.0;			   // just in case
+  }
+
+  /** Update the distribution from the current population */
+  virtual void operator()(eoDistribution & _distrib, eoPop& _pop)
+  {
+    eoPBILDistrib& distrib = dynamic_cast&>(_distrib);
+
+    std::vector & p = distrib.value();
+
+    unsigned i, popSize=_pop.size();
+    std::vector result;
+    _pop.sort(result);	  // is it necessary to sort the whole population?
+			 // but I'm soooooooo lazy !!!
+
+    for (unsigned g=0; g=popSize-nbWorst; i--)
+	    {
+	      const EOT & best = (*result[i]);
+	      if ( !best[g] )	   // if 0, increase proba
+		p[g] +=  lrw;
+	    }
+	// stay in [0,1] (possibly strictly due to tolerance)
+	p[g] = std::min(maxBound, p[g]);
+	p[g] = std::max(minBound, p[g]);
+      }
+  }
+
+private:
+  double maxBound, minBound;    // proba stay away from 0 and 1 by at least tolerance
+  double LR;           // learning rate
+  unsigned nbBest;     // number of Best individuals used for update
+  unsigned nbWorst;    // number of Worse individuals used for update
+  double lrb, lrw;     // "local" learning rates (see operator())
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/ga/eoPBILDistrib.h b/trunk/paradiseo-eo/src/ga/eoPBILDistrib.h
new file mode 100644
index 000000000..91720acb3
--- /dev/null
+++ b/trunk/paradiseo-eo/src/ga/eoPBILDistrib.h
@@ -0,0 +1,100 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoPBILDistrib.h
+// (c) Marc Schoenauer, 2001
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@inria.fr
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoPBILDistrib_H
+#define _eoPBILDistrib_H
+
+#include 
+
+/**
+ * Distribution Class for PBIL algorithm 
+ *      (Population-Based Incremental Learning, Baluja and Caruana 96)
+ *
+ * It encodes a univariate distribution on the space of bitstrings,
+ * i.e. one probability for each bit to be one
+ *
+ * It is an eoValueParam > : 
+ *    the std::vector stores the probabilities that each bit is 1
+ *
+ * It is still pure virtual, as the update method needs to be specified
+*/
+
+template 
+class eoPBILDistrib :  public eoDistribution, 
+		       public eoValueParam >
+{
+public:
+  /** Ctor with size of genomes, and update parameters */
+  eoPBILDistrib(unsigned _genomeSize) :
+    eoDistribution(), 
+    eoValueParam >(std::vector(_genomeSize, 0.5), "Distribution"),
+    genomeSize(_genomeSize)
+  {}
+
+  /** the randomizer of indis */
+  virtual void operator()(EOT & _eo)
+  {
+    _eo.resize(genomeSize);	   // just in case
+    for (unsigned i=0; i> sz;
+    
+    value().resize(sz);
+    unsigned i;
+    
+    for (i = 0; i < sz; ++i)
+      {
+	double atom;
+	is >> atom;
+	value()[i] = atom;
+      }
+  }
+
+  unsigned int size() {return genomeSize;}
+
+  virtual std::string className() const {return "eoPBILDistrib";};
+
+private:
+  unsigned genomeSize; // size of indis
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/ga/eoPBILOrg.h b/trunk/paradiseo-eo/src/ga/eoPBILOrg.h
new file mode 100644
index 000000000..80bf2d09c
--- /dev/null
+++ b/trunk/paradiseo-eo/src/ga/eoPBILOrg.h
@@ -0,0 +1,78 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoPBILOrg.h
+// (c) Marc Schoenauer, Maarten Keijzer, 2001
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoPBILOrg_H
+#define _eoPBILOrg_H
+
+#include 
+#include 
+
+/**
+ * Distribution Class for PBIL algorithm
+ *      (Population-Based Incremental Learning, Baluja and Caruana 95)
+ *
+ * This class implements the update rule from the original paper:
+ *
+ *  p(i)(t+1) = (1-LR)*p(i)(t) + LR*best(i)
+*/
+
+template 
+class eoPBILOrg :  public eoDistribUpdater
+{
+public:
+  /** Ctor with size of genomes, and update parameters */
+  eoPBILOrg(double _LR, double _tolerance=0.0 ) :
+    LR(_LR), maxBound(1.0-_tolerance), minBound(_tolerance)
+  {}
+
+
+  /** Update the distribution from the current population */
+  virtual void operator()(eoDistribution & _distrib, eoPop& _pop)
+  {
+    const EOT & best = _pop.best_element();
+    eoPBILDistrib& distrib = dynamic_cast&>(_distrib);
+
+    std::vector & p = distrib.value();
+
+    for (unsigned g=0; g		   // for time(0) for random seeding
+#include 
+#include 
+#include 
+#include 
+
+
+//////////////////////////DISTRIB CONSTRUCTION ///////////////////////////////
+/**
+ * Templatized version of parser-based construct of the distribution
+ * for PBIL distribution evolution algorithm
+ *
+ * It must then be instantiated, and compiled on its own for a given EOType
+ * (see test/t-eoPBIL.cpp
+ *
+ * Last argument is template-disambiguating
+*/
+
+
+template 
+eoPBILDistrib &  do_make_PBILdistrib(eoParser & _parser, eoState& _state, EOT)
+{
+  // First the random seed
+    eoValueParam& seedParam = _parser.createParam(uint32_t(0), "seed", "Random number seed", 'S');
+    if (seedParam.value() == 0)
+	seedParam.value() = time(0);
+
+    // chromosome size:
+    unsigned theSize;
+    // but it might have been already read in the definition fo the performance
+    eoParam* ptParam = _parser.getParamWithLongName(std::string("chromSize"));
+
+    if (!ptParam)			   // not already defined: read it here
+      {
+	theSize = _parser.createParam(unsigned(10), "chromSize", "The length of the bitstrings", 'n',"Problem").value();
+      }
+    else				   // it was read before, get its value
+      {
+	eoValueParam* ptChromSize = dynamic_cast*>(ptParam);
+	theSize = ptChromSize->value();
+      }
+
+    eoPBILDistrib * ptDistrib = new eoPBILDistrib(theSize);
+    _state.storeFunctor(ptDistrib);
+
+    // now the initialization: read a previously saved distribution, or random
+  eoValueParam& loadNameParam = _parser.createParam(std::string(""), "Load","A save file to restart from",'L', "Persistence" );
+  if (loadNameParam.value() != "") // something to load
+    {
+      // create another state for reading
+      eoState inState;		// a state for loading - WITHOUT the parser
+      // register the rng and the distribution in the state,
+      // so they can be loaded,
+      // and the present run will be the exact continuation of the saved run
+      // eventually with different parameters
+      inState.registerObject(*ptDistrib);
+      inState.registerObject(rng);
+      inState.load(loadNameParam.value()); //  load the distrib and the rng
+    }
+  else				// nothing loaded from a file
+    {
+      rng.reseed(seedParam.value());
+    }
+
+  // for future stateSave, register the algorithm into the state
+   _state.registerObject(_parser);
+   _state.registerObject(*ptDistrib);
+   _state.registerObject(rng);
+
+  return *ptDistrib;
+}
+
+#endif
diff --git a/trunk/paradiseo-eo/src/ga/make_PBILupdate.h b/trunk/paradiseo-eo/src/ga/make_PBILupdate.h
new file mode 100644
index 000000000..9b4ffd83c
--- /dev/null
+++ b/trunk/paradiseo-eo/src/ga/make_PBILupdate.h
@@ -0,0 +1,79 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_PBILupdate.h
+// (c) Marc Schoenauer, Maarten Keijzer, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _make_PBILupdate_h
+#define _make_PBILupdate_h
+
+#include 
+#include 
+#include 
+#include 
+
+
+///////CONSTRUCTION of PBIL distribution updaters/////////////////
+/**
+ * Templatized version of parser-based construct of the update rule for PBIL
+ * distributions (see eoPBILDistrib.h)
+ *
+ * It must then be instantiated, and compiled on its own for a given EOType
+ * (see  test/t-eoPBIL.cpp)
+ *
+ * Last argument is template-disambiguating
+*/
+
+
+template 
+eoDistribUpdater &  do_make_PBILupdate(eoParser & _parser, eoState& _state, EOT)
+{
+  // ast the moment, a single update rule is available 
+  // but at some point we'll have to choose among different rules
+
+    std::string UType = _parser.createParam(std::string("PBIL"), "updateRule", "Type of update rule (only PBIL additive at the moment)", 'U', "Algorithm").value();
+
+  unsigned nbBest = _parser.createParam(unsigned(1), "nbBest", "Number of good guys to update from", 'B', "Algorithm").value();
+    double LRBest = _parser.createParam(0.1, "LRBest", "Learning Rate (from best guys)", 'L', "Algorithm").value();
+  unsigned nbWorst = _parser.createParam(unsigned(0), "nbWorst", "Number of bad guys to update from", 'W', "Algorithm").value();
+    double LRWorst = _parser.createParam(0.01, "LRWorst", "Learning Rate (from best guys)", 'L', "Algorithm").value();
+    double tolerance = _parser.createParam(0.0, "tolerance", "Keeping away from 0 and 1", 't', "Algorithm").value();
+
+    // a pointer to choose among several possible types
+  eoDistribUpdater * ptUpdate; 
+
+  if (UType == std::string("PBIL"))
+    {
+    if ( (nbWorst == 0) && (nbBest == 1) )
+      ptUpdate = new eoPBILOrg(LRBest, tolerance);
+    else
+      ptUpdate = new eoPBILAdditive(LRBest, nbBest, tolerance, LRWorst, nbWorst);
+    }
+  else
+    throw std::runtime_error("Only PBIL additive update rule available at the moment");
+
+  // done: don't forget to store the allocated pointers
+  _state.storeFunctor(ptUpdate); 
+  return *ptUpdate;
+}
+
+#endif
diff --git a/trunk/paradiseo-eo/src/ga/make_algo_scalar_ga.cpp b/trunk/paradiseo-eo/src/ga/make_algo_scalar_ga.cpp
new file mode 100644
index 000000000..aa9b2e051
--- /dev/null
+++ b/trunk/paradiseo-eo/src/ga/make_algo_scalar_ga.cpp
@@ -0,0 +1,64 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_algo_scalar_ga.cpp
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+/** This file contains all ***INSTANCIATED DEFINITIONS*** of pop. init.
+ * of the library for ***BISTRING*** evolution inside EO.
+ * It should be included in the file that calls any of the corresponding fns
+ * Compiling this file allows one to generate part of the library (i.e. object
+ * files that you just need to link with your own main and fitness code).
+ *
+ * The corresponding ***INSTANCIATED DECLARATIONS*** are contained 
+ *       in src/ga/ga.h
+ * while the TEMPLATIZED code is define in make_algo_scalar.h in the src/do dir
+ *
+ * Unlike most EO .h files, it does not (and should not) contain any code, 
+ * just declarations
+ */
+
+// The templatized code
+#include 
+// the instanciating EOType
+#include 
+
+/// The following function merely call the templatized do_* functions above
+
+// Algo
+///////
+eoAlgo >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc >& _eval, eoContinue >& _continue, eoGenOp >& _op, eoDistance >* _dist)
+{
+  return do_make_algo_scalar(_parser, _state, _eval, _continue, _op, _dist);
+}
+
+eoAlgo >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc >& _eval, eoContinue >& _continue, eoGenOp >& _op, eoDistance >* _dist)
+{
+  return do_make_algo_scalar(_parser, _state, _eval, _continue, _op, _dist);
+}
+
diff --git a/trunk/paradiseo-eo/src/ga/make_checkpoint_ga.cpp b/trunk/paradiseo-eo/src/ga/make_checkpoint_ga.cpp
new file mode 100644
index 000000000..f7da6d4a8
--- /dev/null
+++ b/trunk/paradiseo-eo/src/ga/make_checkpoint_ga.cpp
@@ -0,0 +1,64 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_checkpoint_ga.cpp
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+/** This file contains all ***INSTANCIATED DEFINITIONS*** of operators
+ * of the library for ***BISTRING*** evolution inside EO.
+ * It should be included in the file that calls any of the corresponding fns
+ * Compiling this file allows one to generate part of the library (i.e. object
+ * files that you just need to link with your own main and fitness code).
+ *
+ * The corresponding ***INSTANCIATED DECLARATIONS*** are contained 
+ *       in make_checkpoint_ga.h
+ * while the TEMPLATIZED code is define in make_checkpoint.h in the do dir
+ *
+ * Unlike most EO .h files, it does not (and should not) contain any code, 
+ * just declarations
+ */
+
+// The templatized code
+#include 
+// the instanciating EOType
+#include 
+
+/// The following function merely call the templatized do_* functions 
+
+// checkpoint
+/////////////
+eoCheckPoint >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter >& _eval, eoContinue >& _continue)
+{
+  return do_make_checkpoint(_parser, _state, _eval, _continue);
+}
+eoCheckPoint >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter >& _eval, eoContinue >& _continue) 
+{
+  return do_make_checkpoint(_parser, _state, _eval, _continue);
+}
+
+
diff --git a/trunk/paradiseo-eo/src/ga/make_continue_ga.cpp b/trunk/paradiseo-eo/src/ga/make_continue_ga.cpp
new file mode 100644
index 000000000..e2dbb35a8
--- /dev/null
+++ b/trunk/paradiseo-eo/src/ga/make_continue_ga.cpp
@@ -0,0 +1,64 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_continue_ga.cpp
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+/** This file contains all ***INSTANCIATED DEFINITIONS*** of operators
+ * of the library for ***BISTRING*** evolution inside EO.
+ * It should be included in the file that calls any of the corresponding fns
+ * Compiling this file allows one to generate part of the library (i.e. object
+ * files that you just need to link with your own main and fitness code).
+ *
+ * The corresponding ***INSTANCIATED DECLARATIONS*** are contained 
+ *       in ga.h
+ * while the TEMPLATIZED code is define in make_contninue.h in the src/do dir
+ *
+ * Unlike most EO .h files, it does not (and should not) contain any code, 
+ * just declarations
+ */
+
+// The templatized code
+#include 
+// the instanciating EOType
+#include 
+
+/// The following function merely call the templatized do_* functions above
+
+// continue
+///////////
+eoContinue >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter > & _eval)
+{
+  return do_make_continue(_parser, _state, _eval);
+}
+eoContinue >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter > & _eval)
+{
+  return do_make_continue(_parser, _state, _eval);
+}
+
+
diff --git a/trunk/paradiseo-eo/src/ga/make_ga.h b/trunk/paradiseo-eo/src/ga/make_ga.h
new file mode 100644
index 000000000..ee75b8134
--- /dev/null
+++ b/trunk/paradiseo-eo/src/ga/make_ga.h
@@ -0,0 +1,94 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// ga.h
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+/** This file contains all ***INSTANCIATED*** declarations of all components 
+ * of the library for ***BISTRING*** evolution inside EO.
+ * It should be included in the file that calls any of the corresponding fns
+ *
+ * The corresponding ***INSTANCIATED*** definitions are contained in ga.cpp
+ * while the TEMPLATIZED code is define in the different makeXXX.h files
+ *
+ * Unlike most EO .h files, it does not (and should not) contain any code, 
+ * just declarations
+ */
+
+#ifndef ga_h
+#define ga_h
+
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+
+#include 
+
+//Representation dependent - rewrite everything anew for each representation
+//////////////////////////
+
+// the genotypes 
+eoInit > & make_genotype(eoParser& _parser, eoState& _state, eoBit _eo);
+  eoInit > & make_genotype(eoParser& _parser, eoState& _state, eoBit _eo);
+
+// the operators
+eoGenOp >&  make_op(eoParser& _parser, eoState& _state, eoInit >& _init);
+eoGenOp >&  make_op(eoParser& _parser, eoState& _state, eoInit >& _init);
+
+//Representation INdependent
+////////////////////////////
+// if you use your own representation, simply change the types of templates
+
+// init pop
+eoPop >&  make_pop(eoParser& _parser, eoState& _state, eoInit >&);
+eoPop >&  make_pop(eoParser& _parser, eoState& _state, eoInit >&);
+
+// the continue's
+eoContinue >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter > & _eval);
+eoContinue >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter > & _eval);
+
+// the checkpoint
+eoCheckPoint >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter >& _eval, eoContinue >& _continue);
+eoCheckPoint >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter >& _eval, eoContinue >& _continue);
+
+
+// the algo
+eoAlgo >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc >& _eval, eoContinue >& _ccontinue, eoGenOp >& _op, eoDistance >* _dist = NULL);
+
+eoAlgo >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc >& _eval, eoContinue >& _ccontinue, eoGenOp >& _op, eoDistance >* _dist = NULL);
+
+// run
+void run_ea(eoAlgo >& _ga, eoPop >& _pop);
+void run_ea(eoAlgo >& _ga, eoPop >& _pop);
+
+// end of parameter input (+ .status + help)
+// that one is not templatized
+// Because of that, the source is in src/utils dir
+void make_help(eoParser & _parser);
+
+#endif
diff --git a/trunk/paradiseo-eo/src/ga/make_genotype_ga.cpp b/trunk/paradiseo-eo/src/ga/make_genotype_ga.cpp
new file mode 100644
index 000000000..873093dce
--- /dev/null
+++ b/trunk/paradiseo-eo/src/ga/make_genotype_ga.cpp
@@ -0,0 +1,55 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_genotype_ga.cpp
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+/** This file contains all ***INSTANCIATED DEFINITIONS*** of operators
+ * of the library for ***BISTRING*** evolution inside EO.
+ * It should be included in the file that calls any of the corresponding fns
+ * Compiling this file allows one to generate part of the library (i.e. object
+ * files that you just need to link with your own main and fitness code).
+ *
+ * The corresponding ***INSTANCIATED DECLARATIONS*** are contained 
+ *       in ga.h in src/ga dir 
+ * while the TEMPLATIZED code is define in make_genotype_ga.h
+ */
+
+// the templatized code
+#include 
+
+/// The following function merely call the templatized do_* functions above
+
+eoInit > & make_genotype(eoParser& _parser, eoState& _state, eoBit _eo)
+{
+  return do_make_genotype(_parser, _state, _eo);
+}
+eoInit > & make_genotype(eoParser& _parser, eoState& _state, eoBit _eo)
+{
+  return do_make_genotype(_parser, _state, _eo);
+}
diff --git a/trunk/paradiseo-eo/src/ga/make_genotype_ga.h b/trunk/paradiseo-eo/src/ga/make_genotype_ga.h
new file mode 100644
index 000000000..1ea3e1104
--- /dev/null
+++ b/trunk/paradiseo-eo/src/ga/make_genotype_ga.h
@@ -0,0 +1,77 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_genotype.h
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _make_genotype_h
+#define _make_genotype_h
+
+#include 
+#include 
+  // also need the parser and param includes
+#include 
+#include 
+
+
+/////////////////// the bitstring ////////////////
+/*
+ * This fuction does the initialization of what's needed for a particular 
+ * genotype (here, bitstrings).
+ * It could be here tempatied only on the fitness, as it can be used to evolve 
+ * bitstrings with any fitness.
+ * However, for consistency reasons, it was finally chosen, as in 
+ * the rest of EO, to templatize by the full EOT, as this eventually 
+ * allows to choose the type of genotype at run time (see in es dir)
+ *
+ * It is instanciated in ga/ga.cpp - and incorporated in the ga/libga.a
+ *
+ * It returns an eoInit > tha can later be used to initialize 
+ * the population (see make_pop.h).
+ *
+ * It uses a parser (to get user parameters) and a state (to store the memory)
+ * the last argument is to disambiguate the call upon different instanciations.
+ *
+ * WARNING: that last argument will generally be the result of calling 
+ *          the default ctor of EOT, resulting in most cases in an EOT 
+ *          that is ***not properly initialized***
+*/
+
+template 
+eoInit & do_make_genotype(eoParser& _parser, eoState& _state, EOT)
+{
+  // for bitstring, only thing needed is the size
+  // but it might have been already read in the definition fo the performance
+  unsigned theSize = _parser.getORcreateParam(unsigned(10), "chromSize", "The length of the bitstrings", 'n',"Problem").value();
+
+  // Then we can built a bitstring random initializer
+  // based on boolean_generator class (see utils/rnd_generator.h)
+  eoBooleanGenerator * gen = new eoBooleanGenerator;
+  _state.storeFunctor(gen);
+  eoInitFixedLength* init = new eoInitFixedLength(theSize, *gen);
+  // store in state
+  _state.storeFunctor(init);
+  return *init;
+}
+
+#endif
diff --git a/trunk/paradiseo-eo/src/ga/make_op.h b/trunk/paradiseo-eo/src/ga/make_op.h
new file mode 100644
index 000000000..85af41ffb
--- /dev/null
+++ b/trunk/paradiseo-eo/src/ga/make_op.h
@@ -0,0 +1,211 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_op.h
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _make_op_h
+#define _make_op_h
+
+// the operators
+#include 
+#include 
+#include 
+#include 
+// combinations of simple eoOps (eoMonOp and eoQuadOp)
+#include 
+
+// the specialized GA stuff
+#include 
+#include 
+  // also need the parser and param includes
+#include 
+#include 
+
+
+/////////////////// bitstring operators ///////////////
+// canonical (crossover + mutation) only at the moment //
+
+/*
+ * This function builds the operators that will be applied to the bitstrings
+ *
+ * It uses a parser (to get user parameters) and a state (to store the memory)
+ * the last argument is an individual, needed for 2 reasons
+ *     it disambiguates the call after instanciations
+ *     some operator might need some private information about the indis
+ *
+ * This is why the template is the complete EOT even though only the fitness
+ * is actually templatized here: the following only applies to bitstrings
+ *
+ * Note : the last parameter is an eoInit: if some operator needs some info 
+ *        about the gneotypes, the init has it all (e.g. bounds, ...)
+ *        Simply do 
+ *        EOT myEO;
+ *        _init(myEO);
+ *        and myEO is then an ACTUAL object
+*/
+
+template 
+eoGenOp & do_make_op(eoParser& _parser, eoState& _state, eoInit& _init)
+{
+  // this is a temporary version, while Maarten codes the full tree-structured
+  // general operator input
+  // BTW we must leave that simple version available somehow, as it is the one
+  // that 90% people use!
+    eoValueParam& operatorParam =  _parser.createParam(std::string("SGA"), "operator", "Description of the operator (SGA only now)", 'o', "Variation Operators");
+
+    if (operatorParam.value() != std::string("SGA"))
+	throw std::runtime_error("Only SGA-like operator available right now\n");
+
+    // now we read Pcross and Pmut, 
+    // the relative weights for all crossovers -> proportional choice
+    // the relative weights for all mutations -> proportional choice
+    // and create the eoGenOp that is exactly 
+    // crossover with pcross + mutation with pmut
+
+    eoValueParam& pCrossParam = _parser.createParam(0.6, "pCross", "Probability of Crossover", 'C', "Variation Operators" );
+    // minimum check
+    if ( (pCrossParam.value() < 0) || (pCrossParam.value() > 1) )
+      throw std::runtime_error("Invalid pCross");
+
+    eoValueParam& pMutParam = _parser.createParam(0.1, "pMut", "Probability of Mutation", 'M', "Variation Operators" );
+    // minimum check
+    if ( (pMutParam.value() < 0) || (pMutParam.value() > 1) )
+      throw std::runtime_error("Invalid pMut");
+
+    // the crossovers
+    /////////////////
+    // the parameters
+    eoValueParam& onePointRateParam = _parser.createParam(double(1.0), "onePointRate", "Relative rate for one point crossover", '1', "Variation Operators" );
+    // minimum check
+    if ( (onePointRateParam.value() < 0) )
+      throw std::runtime_error("Invalid onePointRate");
+
+    eoValueParam& twoPointsRateParam = _parser.createParam(double(1.0), "twoPointRate", "Relative rate for two point crossover", '2', "Variation Operators" );
+    // minimum check
+    if ( (twoPointsRateParam.value() < 0) )
+      throw std::runtime_error("Invalid twoPointsRate");
+
+    eoValueParam& uRateParam = _parser.createParam(double(2.0), "uRate", "Relative rate for uniform crossover", 'U', "Variation Operators" );
+    // minimum check
+    if ( (uRateParam.value() < 0) )
+      throw std::runtime_error("Invalid uRate");
+
+    // minimum check
+    bool bCross = true;
+    if (onePointRateParam.value()+twoPointsRateParam.value()+uRateParam.value()==0)
+      {
+	std::cerr << "Warning: no crossover" << std::endl;
+	bCross = false;
+      }
+    
+    // Create the CombinedQuadOp
+    eoPropCombinedQuadOp *ptCombinedQuadOp = NULL;
+    eoQuadOp *ptQuad = NULL;
+    // 1-point crossover for bitstring
+    ptQuad = new eo1PtBitXover;
+    _state.storeFunctor(ptQuad);
+    ptCombinedQuadOp = new eoPropCombinedQuadOp(*ptQuad, onePointRateParam.value());
+    
+    // uniform crossover for bitstring
+    ptQuad = new eoUBitXover;
+    _state.storeFunctor(ptQuad);
+    ptCombinedQuadOp->add(*ptQuad, uRateParam.value());
+    
+    // 2-points xover
+    ptQuad = new eoNPtsBitXover;
+    _state.storeFunctor(ptQuad);
+    ptCombinedQuadOp->add(*ptQuad, twoPointsRateParam.value());
+
+    // don't forget to store the CombinedQuadOp
+    _state.storeFunctor(ptCombinedQuadOp);
+
+    // the mutations
+    /////////////////
+    // the parameters
+    eoValueParam & pMutPerBitParam = _parser.createParam(0.01, "pMutPerBit", "Probability of flipping 1 bit in bit-flip mutation", 'b', "Variation Operators" );
+    // minimum check
+    if ( (pMutPerBitParam.value() < 0) || (pMutPerBitParam.value() > 0.5) )
+      throw std::runtime_error("Invalid pMutPerBit");
+
+    eoValueParam & bitFlipRateParam = _parser.createParam(0.01, "bitFlipRate", "Relative rate for bit-flip mutation", 's', "Variation Operators" );
+    // minimum check
+    if ( (bitFlipRateParam.value() < 0) )
+      throw std::runtime_error("Invalid bitFlipRate");
+      
+    eoValueParam & oneBitRateParam = _parser.createParam(0.01, "oneBitRate", "Relative rate for deterministic bit-flip mutation", 'd', "Variation Operators" );
+    // minimum check
+    if ( (oneBitRateParam.value() < 0) )
+      throw std::runtime_error("Invalid oneBitRate");
+
+    // minimum check
+    bool bMut = true;
+    if (bitFlipRateParam.value()+oneBitRateParam.value()==0)
+      {
+	std::cerr << "Warning: no mutation" << std::endl;
+	bMut = false;
+      }
+    
+    // Create the CombinedMonOp
+    eoPropCombinedMonOp *ptCombinedMonOp = NULL;
+    eoMonOp *ptMon = NULL;
+
+  // standard bit-flip mutation for bitstring
+  ptMon = new eoBitMutation(pMutPerBitParam.value());
+  _state.storeFunctor(ptMon);
+  // create the CombinedMonOp
+  ptCombinedMonOp = new eoPropCombinedMonOp(*ptMon, bitFlipRateParam.value());
+
+  // mutate exactly 1 bit per individual
+  ptMon = new eoDetBitFlip; 
+  _state.storeFunctor(ptMon);
+  ptCombinedMonOp->add(*ptMon, oneBitRateParam.value());
+
+  _state.storeFunctor(ptCombinedMonOp);
+
+  // now build the eoGenOp:
+  // to simulate SGA (crossover with proba pCross + mutation with proba pMut
+  // we must construct
+  //     a sequential combination of
+  //          with proba 1, a proportional combination of 
+  //                        a QuadCopy and our crossover
+  //          with proba pMut, our mutation
+
+  // the crossover - with probability pCross
+  eoProportionalOp * cross = new eoProportionalOp ;
+  _state.storeFunctor(cross);
+  ptQuad = new eoQuadCloneOp;
+  _state.storeFunctor(ptQuad);
+  cross->add(*ptCombinedQuadOp, pCrossParam.value()); // user crossover
+  cross->add(*ptQuad, 1-pCrossParam.value()); // clone operator
+
+  // now the sequential
+  eoSequentialOp *op = new eoSequentialOp;
+  _state.storeFunctor(op);
+  op->add(*cross, 1.0);	 // always crossover (but clone with prob 1-pCross
+  op->add(*ptCombinedMonOp, pMutParam.value());
+
+  // that's it!
+  return *op;
+}
+#endif
diff --git a/trunk/paradiseo-eo/src/ga/make_op_ga.cpp b/trunk/paradiseo-eo/src/ga/make_op_ga.cpp
new file mode 100644
index 000000000..8bed5a66a
--- /dev/null
+++ b/trunk/paradiseo-eo/src/ga/make_op_ga.cpp
@@ -0,0 +1,62 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_op_ga.cpp
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+/** This file contains all ***INSTANCIATED DEFINITIONS*** of operators
+ * of the library for ***BISTRING*** evolution inside EO.
+ * It should be included in the file that calls any of the corresponding fns
+ * Compiling this file allows one to generate part of the library (i.e. object
+ * files that you just need to link with your own main and fitness code).
+ *
+ * The corresponding ***INSTANCIATED DECLARATIONS*** are contained 
+ *       in make_op_ga.h
+ * while the TEMPLATIZED code is define in make_op.h in the ga dir
+ *
+ * Unlike most EO .h files, it does not (and should not) contain any code, 
+ * just declarations
+ */
+
+// Templatized code
+#include 
+
+/// The following function merely call the templatized do_* functions above
+
+// oeprators
+////////////
+eoGenOp >&  make_op(eoParser& _parser, eoState& _state, eoInit >& _init)
+{
+  return do_make_op(_parser, _state, _init);
+}
+
+eoGenOp >&  make_op(eoParser& _parser, eoState& _state, eoInit >& _init)
+{
+  return do_make_op(_parser, _state, _init);
+}
+
diff --git a/trunk/paradiseo-eo/src/ga/make_pop_ga.cpp b/trunk/paradiseo-eo/src/ga/make_pop_ga.cpp
new file mode 100644
index 000000000..2ab0b5cde
--- /dev/null
+++ b/trunk/paradiseo-eo/src/ga/make_pop_ga.cpp
@@ -0,0 +1,63 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_pop_ga.cpp
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+/** This file contains all ***INSTANCIATED DEFINITIONS*** of population init
+ * of the library for ***BISTRING*** evolution inside EO.
+ * It should be included in the file that calls any of the corresponding fns
+ * Compiling this file allows one to generate part of the library (i.e. object
+ * files that you just need to link with your own main and fitness code).
+ *
+ * The corresponding ***INSTANCIATED DECLARATIONS*** are contained 
+ *       in ga/make_ga.h
+ * while the TEMPLATIZED code is define in make_pop.h in the src/do dir
+ *
+ */
+
+// The templatized code
+#include 
+// the instanciating EOType
+#include 
+
+/// The following function merely call the templatized do_* functions above
+
+// Init POP
+///////////
+eoPop >&  make_pop(eoParser& _parser, eoState& _state, eoInit > & _init)
+{
+  return do_make_pop(_parser, _state, _init);
+}
+
+eoPop >&  make_pop(eoParser& _parser, eoState& _state, eoInit > & _init)
+{
+  return do_make_pop(_parser, _state, _init);
+}
+
+
diff --git a/trunk/paradiseo-eo/src/ga/make_run_ga.cpp b/trunk/paradiseo-eo/src/ga/make_run_ga.cpp
new file mode 100644
index 000000000..afdab3d9a
--- /dev/null
+++ b/trunk/paradiseo-eo/src/ga/make_run_ga.cpp
@@ -0,0 +1,66 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_run_ga.cpp
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+/** This file contains all ***INSTANCIATED DEFINITIONS*** of operators
+ * of the library for ***BISTRING*** evolution inside EO.
+ * It should be included in the file that calls any of the corresponding fns
+ * Compiling this file allows one to generate part of the library (i.e. object
+ * files that you just need to link with your own main and fitness code).
+ *
+ * The corresponding ***INSTANCIATED DECLARATIONS*** are contained 
+ *       in make_run_ga.h
+ * while the TEMPLATIZED code is define in make_run.h in the do dir
+ *
+ * Unlike most EO .h files, it does not (and should not) contain any code, 
+ * just declarations
+ */
+
+// The templatized code
+#include 
+// the instanciating EOType
+#include 
+// the instanciating fitnesses
+#include 
+
+/// The following function merely call the templatized do_* functions above
+
+// run
+/////////
+void run_ea(eoAlgo >& _ga, eoPop >& _pop)
+{
+  do_run(_ga, _pop);
+}
+
+void run_ea(eoAlgo >& _ga, eoPop >& _pop)
+{
+  do_run(_ga, _pop);
+}
+
diff --git a/trunk/paradiseo-eo/src/gp/.cvsignore b/trunk/paradiseo-eo/src/gp/.cvsignore
new file mode 100644
index 000000000..69fb0bd82
--- /dev/null
+++ b/trunk/paradiseo-eo/src/gp/.cvsignore
@@ -0,0 +1,6 @@
+*.lo
+*.la
+.deps
+.libs
+Makefile
+Makefile.in
diff --git a/trunk/paradiseo-eo/src/gp/CVS/Entries b/trunk/paradiseo-eo/src/gp/CVS/Entries
new file mode 100644
index 000000000..3431927f7
--- /dev/null
+++ b/trunk/paradiseo-eo/src/gp/CVS/Entries
@@ -0,0 +1,10 @@
+/.cvsignore/1.1/Mon Apr  3 09:32:08 2000//
+/Makefile.am/1.5/Wed Sep 22 18:18:30 2004//
+/eoParseTree.h/1.25/Mon Mar 27 18:55:20 2006//
+/eoParseTreeDepthInit.h/1.9/Wed Nov 26 11:15:59 2003//
+/eoParseTreeOp.h/1.4/Thu Feb 27 19:24:31 2003//
+/eoStParseTreeDepthInit.h/1.4/Thu Feb 27 19:24:31 2003//
+/eoStParseTreeOp.h/1.2/Thu Feb 27 19:24:31 2003//
+/node_pool.h/1.4/Tue Mar 25 10:46:08 2003//
+/parse_tree.h/1.8/Thu Dec 23 15:29:06 2004//
+D
diff --git a/trunk/paradiseo-eo/src/gp/CVS/Repository b/trunk/paradiseo-eo/src/gp/CVS/Repository
new file mode 100644
index 000000000..5cc3cda1d
--- /dev/null
+++ b/trunk/paradiseo-eo/src/gp/CVS/Repository
@@ -0,0 +1 @@
+eo/src/gp
diff --git a/trunk/paradiseo-eo/src/gp/CVS/Root b/trunk/paradiseo-eo/src/gp/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/src/gp/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/src/gp/Makefile.am b/trunk/paradiseo-eo/src/gp/Makefile.am
new file mode 100644
index 000000000..9ebcdd237
--- /dev/null
+++ b/trunk/paradiseo-eo/src/gp/Makefile.am
@@ -0,0 +1,11 @@
+## Makefile.am for eo/src/gp
+
+gpincludedir 		= $(pkgincludedir)/gp
+
+gpinclude_HEADERS	= eoParseTreeDepthInit.h \
+			eoParseTree.h \
+			eoParseTreeOp.h \
+			eoStParseTreeDepthInit.h \
+			eoStParseTreeOp.h \
+			node_pool.h \
+			parse_tree.h
diff --git a/trunk/paradiseo-eo/src/gp/eoParseTree.h b/trunk/paradiseo-eo/src/gp/eoParseTree.h
new file mode 100644
index 000000000..ca8530d67
--- /dev/null
+++ b/trunk/paradiseo-eo/src/gp/eoParseTree.h
@@ -0,0 +1,189 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoParseTree.h : eoParseTree class (for Tree-based Genetic Programming)
+// (c) Maarten Keijzer 2000
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+    	     mak@dhi.dk
+
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoParseTree_h
+#define eoParseTree_h
+
+#include 
+#include 
+
+#include 
+#include 
+#include 
+#include 
+
+using namespace gp_parse_tree;
+
+/** @defgroup ParseTree
+
+Various functions for tree-based Genetic Programming
+*/
+
+
+
+/** Implementation of parse-tree for genetic programming
+
+@class eoParseTree eoParseTree.h gp/eoParseTree.h
+
+@ingroup ParseTree
+*/
+template 
+class eoParseTree : public EO, public parse_tree
+{
+public:
+
+    using parse_tree::back;
+    using parse_tree::ebegin;
+    using parse_tree::eend;
+    using parse_tree::size;
+
+
+    typedef typename parse_tree::subtree Subtree;
+
+    /* For Compatibility with the intel C++ compiler for Linux 5.x */
+    typedef Node reference;
+    typedef const reference const_reference;
+
+    /**
+     * Default Constructor
+     */
+    eoParseTree(void)  {}
+
+    /**
+     * Copy Constructor
+     * @param tree The tree to copy
+     */
+    eoParseTree(const parse_tree& tree)  : parse_tree(tree) {}
+
+//    eoParseTree(const eoParseTree& tree) :  parse_tree(tree) {}
+    /**
+     * To prune me to a certain size
+     * @param _size My maximum size
+     */
+    virtual void pruneTree(unsigned _size)
+    {
+        if (_size < 1)
+            return;
+
+        while (size() > _size)
+        {
+            back() = operator[](size()-2);
+        }
+    }
+
+    /**
+     * To read me from a stream
+     * @param is The std::istream
+     */
+
+    eoParseTree(std::istream& is) : EO(), parse_tree()
+    {
+        readFrom(is);
+    }
+
+    /// My class name
+    std::string className(void) const { return "eoParseTree"; }
+
+    /**
+     * To print me on a stream
+     * @param os The std::ostream
+     */
+    void printOn(std::ostream& os) const
+    {
+	EO::printOn(os);
+        os << ' ';
+
+        os << size() << ' ';
+
+        std::copy(ebegin(), eend(), std::ostream_iterator(os, " "));
+    }
+
+    /**
+     * To read me from a stream
+     * @param is The std::istream
+     */
+    void readFrom(std::istream& is)
+    {
+
+
+    	EO::readFrom(is);
+
+        unsigned sz;
+        is >> sz;
+
+
+	std::vector v(sz);
+
+        unsigned i;
+
+        for (i = 0; i < sz; ++i)
+        {
+            Node node;
+            is >> node;
+            v[i] = node;
+        }
+	parse_tree tmp(v.begin(), v.end());
+	swap(tmp);
+
+	/*
+	 * old code which caused problems for paradisEO
+	 *
+	 * this can be removed once it has proved itself
+	EO::readFrom(is);
+
+	// even older code
+	FType fit;
+        is >> fit;
+
+        fitness(fit);
+
+
+        std::copy(std::istream_iterator(is), std::istream_iterator(), back_inserter(*this));
+	*/
+    }
+};
+
+// friend function to print eoParseTree
+template 
+std::ostream& operator<<(std::ostream& os, const eoParseTree& eot)
+{
+    eot.printOn(os);
+    return os;
+}
+
+// friend function to read eoParseTree
+template 
+std::istream& operator>>(std::istream& is, eoParseTree& eot)
+{
+    eot.readFrom(is);
+    return is;
+}
+
+// for backward compatibility
+#include 
+#include 
+
+#endif
diff --git a/trunk/paradiseo-eo/src/gp/eoParseTreeDepthInit.h b/trunk/paradiseo-eo/src/gp/eoParseTreeDepthInit.h
new file mode 100644
index 000000000..2f41c2fb9
--- /dev/null
+++ b/trunk/paradiseo-eo/src/gp/eoParseTreeDepthInit.h
@@ -0,0 +1,218 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+ 
+//-----------------------------------------------------------------------------
+// eoParseTreeDepthInit.h : initializor for eoParseTree class
+// (c) Maarten Keijzer 2000  Jeroen Eggermont 2002
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+ 
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+ 
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ 
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+    	     mak@dhi.dk 
+	     jeggermo@liacs.nl
+            
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoParseTreeDepthInit_h
+#define eoParseTreeDepthInit_h
+
+#include 
+#include 
+#include 
+#include 
+#include 
+
+using namespace gp_parse_tree;
+
+/** eoParseTreeDepthInit : the initializer class for eoParseTree
+\class eoParseTreeDepthInit eoParseTreeDepthInit.h gp/eoParseTreeDepthInit.h
+\ingroup ParseTree
+*/
+
+// eoGpDepthInitializer is defined for backward compatibility
+#define eoGpDepthInitializer eoParseTreeDepthInit
+
+template 
+class eoParseTreeDepthInit : public eoInit< eoParseTree >
+{
+    protected:
+	// a binary predicate for sorting
+	// hopefully this will work with M$VC++ 6.0
+	struct lt_arity:public std::binary_function
+	{
+		bool operator()(const Node &_node1, const Node &_node2) { return (_node1.arity() < _node2.arity());};
+	};
+
+    public :
+
+    typedef eoParseTree EoType;
+    
+    /**
+     * Constructor
+     * @parm _max_depth The maximum depth of a tree
+     * @param _initializor A std::vector containing the possible nodes
+     * @param _grow False results in a full tree, True result is a randomly grown tree
+     * @param _ramped_half_and_half True results in Ramped Half and Half Initialization
+     */
+	eoParseTreeDepthInit(
+        unsigned _max_depth,
+	const std::vector& _initializor,
+        bool _grow = true,
+	bool _ramped_half_and_half = false)
+            :
+            eoInit(),
+			max_depth(_max_depth),
+			initializor(_initializor),
+			grow(_grow),
+			ramped_half_and_half(_ramped_half_and_half),
+			current_depth(_max_depth)
+    {
+      if(initializor.empty())
+      {
+        throw std::logic_error("eoParseTreeDepthInit: uhm, wouldn't you rather give a non-empty set of Nodes?");
+      }
+      // lets sort the initializor std::vector according to  arity (so we can be sure the terminals are in front)
+      // we use stable_sort so that if element i was in front of element j and they have the same arity i remains in front of j
+      stable_sort(initializor.begin(), initializor.end(), lt_arity());
+    }
+        /// My class name
+	virtual std::string className() const { return "eoParseTreeDepthInit"; };
+
+    /**initialize a tree
+     * @param _tree : the tree to be initialized
+     */
+    void operator()(EoType& _tree)
+	{
+        std::list sequence;
+        generate(sequence, current_depth);
+
+        parse_tree tmp(sequence.begin(), sequence.end());
+        _tree.swap(tmp);
+	
+	if(ramped_half_and_half)
+	{
+		if(grow)
+		{
+			if (current_depth > 2)
+				current_depth--;
+			else
+				current_depth = max_depth;	
+		}
+		// change the grow method from 'grow' to 'full' or from 'full' to 'grow'
+		grow = !grow;
+	};
+	
+	}
+   private :
+    void generate(std::list& sequence, int the_max, int last_terminal = -1)
+    {
+	    if (last_terminal == -1)
+	    { // check where the last terminal in the sequence resides
+            typename std::vector::iterator it;
+		    for (it = initializor.begin(); it != initializor.end(); ++it)
+		    {
+			    if (it->arity() > 0)
+				    break;
+		    }
+		
+		    last_terminal = it - initializor.begin();
+	    }
+
+	    if (the_max == 1)
+	    { // generate terminals only
+		    typename std::vector::iterator it = initializor.begin() + rng.random(last_terminal);
+		    it->randomize();
+		    sequence.push_front(*it);
+		    return;
+	    }
+	
+	    typename std::vector::iterator what_it;
+
+	    if (grow)
+	    {
+		    what_it = initializor.begin() + rng.random(initializor.size());
+	    }
+	    else // full
+	    {
+		    what_it = initializor.begin() + last_terminal + rng.random(initializor.size() - last_terminal);
+	    }
+
+        what_it->randomize();
+
+	    sequence.push_front(*what_it);
+
+	    for (int i = 0; i < what_it->arity(); ++i)
+		    generate(sequence, the_max - 1, last_terminal);
+    }
+
+
+
+	unsigned max_depth; 
+    	std::vector initializor;
+	bool grow;
+	bool ramped_half_and_half;
+	unsigned current_depth;
+};
+
+/**
+     * A template function for ramped half and half initialization of an eoParseTree population
+     * @param pop the population to be created
+     * @param population_size the size of the population to be created
+     * @param init_max_depth the initial maximum tree depth
+     * @param initializor A std::vector containing the possible nodes
+     
+     \ingroup ParseTree
+     */
+template 
+void  eoInitRampedHalfAndHalf(eoPop< eoParseTree > &pop, unsigned int population_size, unsigned int init_max_depth, std::vector &initializor)
+{
+	typedef eoParseTree EoType;
+	typedef eoPop< EoType > Pop;
+	
+	unsigned int M = init_max_depth - 1;
+	unsigned int part_pop_size = population_size / (2*M);
+	unsigned int m=0;
+
+	std::cerr << "EO WARNING: Ramped Half and Half Initialization is now supported by eoParseTreeDepthInit." << std::endl;
+	std::cerr << "            This function is now obsolete and might be removed in the future so you should"<< std::endl;
+	std::cerr << "            update your code to use: " << std::endl << std::endl;
+	std::cerr << "            eoParseTreeDepthInit( _max_depth, _initializer, bool _grow, bool _ramped_half_and_half)" << std::endl << std::endl;
+	
+	pop.clear();
+	
+	// initialize with Depth's (D) -> 2
+	for(m=init_max_depth; m >= 2; m--)
+	{
+		eoParseTreeDepthInit grow_initializer(m, initializor, true);
+		Pop grow(part_pop_size, grow_initializer);
+		pop.insert(pop.begin(), grow.begin(), grow.end());
+		
+		eoParseTreeDepthInit full_initializer(m, initializor, false);
+		Pop full(part_pop_size, full_initializer);
+		pop.insert(pop.begin(), full.begin(), full.end());
+	}	
+	
+	bool g = true;
+	while (pop.size() < population_size)
+	{
+		eoParseTreeDepthInit initializer(init_max_depth, initializor, g);
+		Pop p(1, initializer);
+		pop.insert(pop.begin(), p.begin(), p.end());
+		g= !g;
+	}
+}
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/gp/eoParseTreeOp.h b/trunk/paradiseo-eo/src/gp/eoParseTreeOp.h
new file mode 100644
index 000000000..1cc91a733
--- /dev/null
+++ b/trunk/paradiseo-eo/src/gp/eoParseTreeOp.h
@@ -0,0 +1,380 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+ 
+//-----------------------------------------------------------------------------
+// eoParseTreeOp.h : crossover and mutation operator for  the eoParseTree class
+// (c) Maarten Keijzer 2000  for eoSubtreeXOver, eoBranchMutation
+// (c) Jeroen Eggermont 2001 for other mutation operators
+
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+ 
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+ 
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ 
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+    	     mak@dhi.dk 
+             jeggermo@liacs.nl
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoParseTreeOp_h
+#define eoParseTreeOp_h
+
+#include 
+#include 
+
+#include 
+
+/** eoSubtreeXOver --> subtree xover 
+\class eoSubtreeXOver eoParseTreeOp.h gp/eoParseTreeOp.h 
+\ingroup ParseTree
+*/
+template
+class eoSubtreeXOver: public eoQuadOp< eoParseTree > {
+public:
+
+  typedef eoParseTree EoType;
+  /**
+   * Constructor
+   * @param _max_length the maximum size of an individual
+   */
+  eoSubtreeXOver( unsigned _max_length)
+    : eoQuadOp(), max_length(_max_length) {};
+
+  /// the ckassname
+  virtual std::string className() const { return "eoSubtreeXOver"; };
+
+  /// Dtor
+  virtual ~eoSubtreeXOver () {};
+
+  /**
+   * Perform crossover on two individuals
+   * param _eo1 The first parent individual
+   * param _eo2 The second parent individual
+   */
+  bool operator()(EoType & _eo1, EoType & _eo2 )
+  {
+	  int i = rng.random(_eo1.size());
+	  int j = rng.random(_eo2.size());
+
+	  typename parse_tree::subtree tmp = _eo1[i];
+	  _eo1[i] = _eo2[j]; // insert subtree
+	  _eo2[j] = tmp;
+
+	  _eo1.pruneTree(max_length);
+	  _eo2.pruneTree(max_length);
+	  
+    return true;
+  }
+ private:
+  unsigned max_length;
+};
+
+/** eoBranchMutation --> replace a subtree with a randomly created subtree 
+\class eoBranchMutation eoParseTreeOp.h gp/eoParseTreeOp.h
+\ingroup ParseTree
+ */
+template
+class eoBranchMutation: public eoMonOp< eoParseTree >
+{
+public:
+
+  typedef eoParseTree EoType;
+  /**
+   * Constructor
+   * @param _init An instantiation of eoGpDepthInitializer
+   * @param _max_length the maximum size of an individual
+   */
+  eoBranchMutation(eoInit& _init, unsigned _max_length)
+    : eoMonOp(), max_length(_max_length), initializer(_init)
+  {};
+  
+  /// the class name
+  virtual std::string className() const { return "eoBranchMutation"; };
+
+  /// Dtor
+  virtual ~eoBranchMutation() {};
+  
+  /**
+   * Mutate an individual
+   * @param _eo1 The individual that is to be changed
+   */
+  bool operator()(EoType& _eo1 )
+  {
+	  int i = rng.random(_eo1.size());
+
+      EoType eo2;
+      initializer(eo2);
+
+	  int j = rng.random(eo2.size());
+
+	  _eo1[i] = eo2[j]; // insert subtree
+
+	  _eo1.pruneTree(max_length);
+
+    return true;
+  }
+
+private :
+
+  unsigned max_length;
+  eoInit& initializer;
+};
+
+// Additional Mutation operators from 
+// TITLE:"Genetic Programming~An Introduction"
+// AUTHORS: Banzhaf, Nordin, Keller, Francone
+// ISBN: 3-920993-58-6
+// ISBN: 1-55860-510-X
+//
+// For the eoParseTree class
+
+/** eoPointMutation --> replace a Node with a Node of the same arity 
+\class eoPointMutation eoParseTreeOp.h gp/eoParseTreeOp.h	
+\ingroup ParseTree
+*/
+
+template
+class eoPointMutation: public eoMonOp< eoParseTree >
+{
+public:
+
+  typedef eoParseTree EoType;
+
+  /**
+   * Constructor
+   * @param _initializor The std::vector of Nodes given to the eoGpDepthInitializer
+   */
+  eoPointMutation( std::vector& _initializor)
+    : eoMonOp(), initializor(_initializor)
+  {};
+  
+  /// the class name
+  virtual std::string className() const { return "eoPointMutation"; };
+
+  /// Dtor
+  virtual ~eoPointMutation() {};
+
+  /**
+   * Mutate an individual
+   * @param _eo1 The individual that is to be changed
+   */
+  bool operator()(EoType& _eo1 )
+  {
+  	// select a random node i that is to be mutated
+	int i = rng.random(_eo1.size());
+	// request the arity of the node that is to be replaced
+	int arity = _eo1[i].arity();
+	
+	int j=0;
+	
+	do
+	{
+		j = rng.random(initializor.size());
+		
+	}while ((initializor[j].arity() != arity));
+	
+	_eo1[i] = initializor[j];
+	
+      	
+	
+    	return true;
+  }
+
+private :
+	std::vector& initializor;
+
+};
+
+/** eoExpansionMutation --> replace a terminal with a randomly created subtree 
+\class eoExpansionMutation eoParseTreeOp.h gp/eoParseTreeOp.h
+\ingroup ParseTree
+ */
+
+template
+class eoExpansionMutation: public eoMonOp< eoParseTree >
+{
+public:
+
+  typedef eoParseTree EoType;
+  
+  /**
+   * Constructor
+   * @param _init An instantiation of eoGpDepthInitializer
+   * @param _max_length the maximum size of an individual
+   */
+  eoExpansionMutation(eoInit& _init, unsigned _max_length)
+    : eoMonOp(), max_length(_max_length), initializer(_init)
+  {};
+  
+  /// The class name
+  virtual std::string className() const { return "eoExpansionMutation"; };
+
+  /// Dtor
+  virtual ~eoExpansionMutation() {};
+  /**
+   * Mutate an individual
+   * @param _eo1 The individual that is to be changed
+   */
+  bool operator()(EoType& _eo1 )
+  {
+	  int i = rng.random(_eo1.size());
+	  // look for a terminal
+          while (_eo1[i].arity() != 0)
+	  {
+	  	i= rng.random(_eo1.size());
+	  };
+	  
+	  // create a new tree to
+      	  EoType eo2;
+	  // make sure we get a tree with more than just a terminal
+	  do
+	  {
+      	  	initializer(eo2);
+	  }while(eo2.size() == 1);	
+	  
+	  int j = rng.random(eo2.size());
+	  // make sure we select a subtree (and not a terminal)
+	  while((eo2[j].arity() == 0))
+	  {
+	  	j = rng.random(eo2.size());
+	  };
+	  
+
+	  _eo1[i] = eo2[j]; // insert subtree
+
+	  _eo1.pruneTree(max_length);
+	  
+    return true;
+  }
+
+private :
+
+  unsigned max_length;
+  eoInit& initializer;
+};
+
+/** eoCollapseSubtree -->  replace a subtree with a randomly chosen terminal
+\class eoCollapseSubtreeMutation eoParseTreeOp.h gp/eoParseTreeOp.h
+\ingroup ParseTree
+ */
+
+template
+class eoCollapseSubtreeMutation: public eoMonOp< eoParseTree >
+{
+public:
+
+  typedef eoParseTree EoType;
+  /**
+   * Constructor
+   * @param _init An instantiation of eoGpDepthInitializer
+   * @param _max_length the maximum size of an individual
+   */
+  eoCollapseSubtreeMutation(eoInit& _init, unsigned _max_length)
+    : eoMonOp(), max_length(_max_length), initializer(_init)
+  {};
+
+  /// The class name
+  virtual std::string className() const { return "eoCollapseSubtreeMutation"; };
+
+  /// Dtor
+  virtual ~eoCollapseSubtreeMutation() {};
+  /**
+   * Mutate an individual
+   * @param _eo1 The individual that is to be changed
+   */
+  bool operator()(EoType& _eo1 )
+  {
+	  int i = rng.random(_eo1.size());
+	  // look for a subtree
+          while ((_eo1[i].arity() == 0) && (_eo1.size() > 1))
+	  {
+	  	i= rng.random(_eo1.size());
+	  };
+	
+	  // create a new tree to
+      	  EoType eo2;
+      	  initializer(eo2);
+	  
+	  int j = rng.random(eo2.size());
+	  // make sure we select a subtree (and not a terminal)
+	  while(eo2[j].arity() != 0)
+	  {
+	  	j = rng.random(eo2.size());
+	  };
+
+	  _eo1[i] = eo2[j]; // insert subtree
+	  
+	  // we don't have to prune because the subtree is always smaller
+	  _eo1.pruneTree(max_length);
+	
+    return true;
+  }
+
+private :
+
+  unsigned max_length;
+  eoInit& initializer;
+};
+
+
+/** eoHoistMutation -->  replace the individual with one of its subtree's 
+\class eoHoistMutation eoParseTreeOp.h gp/eoParseTreeOp.h
+\ingroup ParseTree
+ */
+ 
+template
+class eoHoistMutation: public eoMonOp< eoParseTree >
+{
+public:
+
+  typedef eoParseTree EoType;
+  /**
+   * Constructor
+   * @param none
+   */
+  eoHoistMutation()
+    : eoMonOp()
+  {};
+  
+  /// The class name
+  virtual std::string className() const { return "eoHoistMutation"; };
+
+  /// Dtor
+  virtual ~eoHoistMutation() {};
+  /**
+   * Mutate an individual
+   * @param _eo1 The individual that is to be changed
+   */
+  bool operator()(EoType& _eo1 )
+  {
+	
+	  
+	  // select a hoist point
+	  int i = rng.random(_eo1.size());
+      	  // and create a new tree
+	  EoType eo2(_eo1[i]);
+	  
+	  // we don't have to prune because the new tree is always smaller
+	  //_eo1.pruneTree(max_length);
+	  
+	  _eo1 = eo2;
+
+    return true;
+  }
+
+private :
+
+};
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/gp/eoStParseTreeDepthInit.h b/trunk/paradiseo-eo/src/gp/eoStParseTreeDepthInit.h
new file mode 100644
index 000000000..3dac6f134
--- /dev/null
+++ b/trunk/paradiseo-eo/src/gp/eoStParseTreeDepthInit.h
@@ -0,0 +1,190 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+ 
+//-----------------------------------------------------------------------------
+// eoStParseTreeDepthInit.h : initializor strongly type GP
+// (c) Jeroen Eggermont 2001
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+ 
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+ 
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ 
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+    	     jeggermo@liacs.nl
+            
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoStParseTreeDepthInit_h
+#define eoStParseTreeDepthInit_h
+
+#include 
+#include 
+#include 
+#include 
+
+
+using namespace gp_parse_tree;
+
+#define TERMINAL 0
+
+#define NONTERMINAL 4
+#define ALL 5
+
+ /**
+\defgroup StParseTree
+
+  Various functions for strongly typed tree-based Genetic Programming.
+  The StParseTree functions use the same eoParseTree class for the
+  individual but now each node class must have two additional functions.
+  \li int type(void) which returns the return type of the node
+  \li int type(int child) which returns the required type for child 0, 1 or 2
+  
+  Pruning strongly typed trees is not possible at the moment.
+*/
+
+/** eoStParseTreeDepthInit : the initializer class for strongly typed tree-based genetic programming
+\class eoStParseTreeDepthInit eoStParseTreeDepthInit.h gp/eoStParseTreeDepthInit.h
+\ingroup StParseTree
+*/
+
+template 
+class eoStParseTreeDepthInit : public eoInit< eoParseTree >
+{
+    public :
+
+    typedef eoParseTree EoType;
+    
+    /**
+     * Constructor
+     * @parm _max_depth The maximum depth of a tree
+     * @param _initializor A std::vector containing the possible nodes
+     * @param _grow False results in a full tree, True result is a randomly grown tree
+     */
+	eoStParseTreeDepthInit(
+        unsigned _max_depth,
+		const std::vector& _node,
+		const int& _return_type,
+        bool _grow = true)
+            :
+            eoInit(),
+			max_depth(_max_depth),
+			return_type(_return_type),
+			grow(_grow)
+    {
+      if(_node.empty())
+      {
+        throw std::logic_error("eoStParseTreeDepthInit: uhm, wouldn't you rather give a non-empty set of Nodes?");
+      }
+      
+      
+      unsigned int i=0;
+      int arity=0;
+      int type=0;
+      std::vector node_std::vector;
+      for(i=0; i < _node.size(); i++)
+      {
+      	arity = _node[i].arity();
+	type = _node[i].type();
+	if(arity==0)
+	{
+		node_std::vector = node[type][TERMINAL];
+		node_std::vector.push_back(_node[i]);
+		node[type][TERMINAL]= node_std::vector;
+	}	
+	else	
+	//if (arity != 0) // non-terminal
+	{
+		node_std::vector = node[type][NONTERMINAL];
+		node_std::vector.push_back(_node[i]);
+		node[type][NONTERMINAL] = node_std::vector;
+	}
+	node_std::vector = node[type][ALL];
+	node_std::vector.push_back(_node[i]);
+	node[type][ALL] = node_std::vector;
+		
+      }
+      
+
+    }
+        /// My class name
+	virtual std::string className() const { return "eoStParseTreeDepthInit"; };
+
+    /**initialize a tree
+     * @param _tree : the tree to be initialized
+     */
+    void operator()(EoType& _tree)
+	{
+        	std::list sequence;
+		bool good_tree = false;
+		do 
+		{
+			sequence.clear();
+        		good_tree = generate(sequence, max_depth, return_type);
+		}while (!good_tree);	
+
+        	parse_tree tmp(sequence.begin(), sequence.end());
+        	_tree.swap(tmp);
+	}
+   private :
+    bool generate(std::list& sequence, int the_max, int request_type)
+    {
+	    
+	    int selected=0;
+	    bool ok = true;
+	    
+	    if (the_max == 1)
+	    { // generate terminals only
+	    	if( node[request_type][TERMINAL].empty() ) // no possible terminal node of this type
+	    		return false; // we have an invalid tree
+	    	else
+	    	{	
+	      		selected = rng.random((node[request_type][TERMINAL]).size());
+	      		sequence.push_front(node[request_type][TERMINAL][selected]);
+	      		return true;
+		}	
+	      
+	    }
+	    
+	    int arity=0;
+	    if (grow)
+	    {
+	    	selected = rng.random((node[request_type][ALL]).size());
+		arity = node[request_type][ALL][selected].arity();
+		sequence.push_front(node[request_type][ALL][selected]);
+		for (int i = 0; i < arity; ++i)
+		    ok &= generate(sequence, the_max - 1, node[request_type][ALL][selected].type(i));
+	    }
+	    else // full
+	    {
+	    	 selected = rng.random((node[request_type][NONTERMINAL]).size());
+		 arity = node[request_type][NONTERMINAL][selected].arity();
+		 sequence.push_front(node[request_type][NONTERMINAL][selected]);
+		 for (int i = 0; i < arity; ++i)
+		     ok &=generate(sequence, the_max - 1, node[request_type][NONTERMINAL][selected].type(i));
+	    }
+	    
+	    return ok;
+	    
+    }
+
+
+
+     
+	unsigned max_depth; 
+	map < int, map < int, std::vector > > node;
+
+        int return_type;
+	bool grow;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/gp/eoStParseTreeOp.h b/trunk/paradiseo-eo/src/gp/eoStParseTreeOp.h
new file mode 100644
index 000000000..28bd3ff83
--- /dev/null
+++ b/trunk/paradiseo-eo/src/gp/eoStParseTreeOp.h
@@ -0,0 +1,315 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+ 
+//-----------------------------------------------------------------------------
+// eoStParseTreeOp.h : crossover and mutation operators for  the strongly typed GP
+// (c) Jeroen Eggermont 2001 for other mutation operators
+
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+ 
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+ 
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ 
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+    	     mak@dhi.dk 
+             jeggermo@liacs.nl
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoStParseTreeOp_h
+#define eoStParseTreeOp_h
+
+#include 
+#include 
+#include 
+#include 
+
+#include 
+
+// a help function
+template 
+void get_possible_nodes(const EOT &_eo, std::vector &possible_nodes, const int type)
+{
+	int n=0;
+	possible_nodes.clear();
+	// collect the possible crossover points in _eo (nodes with the same type)
+	for(n=0; n < _eo.size(); n++)
+		if (type == _eo[n]->type())
+			possible_nodes.push_back(n);
+}	
+
+
+/** eoStSubtreeXOver --> subtree xover for strongly typed tree-based genetic programming
+\class eoStSubtreeXOver eoStParseTreeOp.h gp/eoStParseTreeOp.h 
+\ingroup StParseTree
+*/
+template
+class eoStSubtreeXOver: public eoQuadOp< eoParseTree > {
+public:
+
+  typedef eoParseTree EoType;
+  /**
+   * Constructor
+   * @param _max_length the maximum size of an individual
+   */
+  eoStSubtreeXOver( unsigned _max_length)
+    : eoQuadOp(), max_length(_max_length) {};
+
+  /// the ckassname
+  virtual std::string className() const { return "eoStSubtreeXOver"; };
+
+  /// Dtor
+  virtual ~eoStSubtreeXOver () {};
+
+  /**
+   * Perform crossover on two individuals
+   * param _eo1 The first parent individual
+   * param _eo2 The second parent individual
+   */
+  bool operator()(EoType & _eo1, EoType & _eo2 )
+  {
+	  int i = 0;
+	  std::vector nodes;
+	  int n = 0;
+	  int type = 0;
+	  int j = 0;
+	  set test;
+	  do
+	  {
+		do // select a random node in _eo1 as crossover point, and check if we didn't try it already
+		{
+			i = rng.random(_eo1.size());
+		}while(test.count(i) > 0);
+		
+		test.insert(i);
+		
+		type = _eo1[i]->type();
+		
+		get_possible_nodes(_eo2, nodes, type);
+		
+	 }while(nodes.empty() && (test.size() < _eo1.size()));	
+	 
+	 if (nodes.empty()) // we failed to select a crossover point but tried all points (test.size() == _eo1.size()).
+	 	return true;  // should this be false ??
+
+	 // we did find at least one possible crossover point in _eo2
+	 	
+	 n = rng.random(nodes.size());
+	 j = nodes[n];
+	   
+	 parse_tree::subtree tmp = _eo1[i];
+	 _eo1[i] = _eo2[j]; // insert subtree
+	 _eo2[j] = tmp;
+
+	 // we can't prune anymore
+	 /*	
+         _eo1.pruneTree(max_length);
+         _eo2.pruneTree(max_length);
+	 */
+	 
+	 return true;
+  }
+ private:
+  unsigned max_length;
+};
+
+/** eoStBranchMutation --> replace a strongly typed subtree with a randomly created strongly typed subtree 
+\class eoStBranchMutation eoStParseTreeOp.h gp/eoStParseTreeOp.h
+\ingroup StParseTree
+ */
+template
+class eoStBranchMutation: public eoMonOp< eoParseTree >
+{
+public:
+
+  typedef eoParseTree EoType;
+  /**
+   * Constructor
+   * @param _init An instantiation of eoGpDepthInitializer
+   * @param _max_length the maximum size of an individual
+   */
+  eoStBranchMutation(eoInit& _init, unsigned _max_length)
+    : eoMonOp(), max_length(_max_length), initializer(_init)
+  {};
+  
+  /// the class name
+  virtual std::string className() const { return "eoStBranchMutation"; };
+
+  /// Dtor
+  virtual ~eoStBranchMutation() {};
+  
+  /**
+   * Mutate an individual
+   * @param _eo1 The individual that is to be changed
+   */
+  bool operator()(EoType& _eo1 )
+  {
+	  int i = rng.random(_eo1.size());
+	  std::vector nodes;
+	  int type = _eo1[i]->type();
+	  int j=0;
+	  int n=0;
+
+      	  EoType eo2;
+	  
+	  do
+	  {
+		initializer(eo2);
+		get_possible_nodes(eo2, nodes, type);
+	  }while (nodes.empty());	
+
+	  n = rng.random(nodes.size());
+	  j = nodes[n];
+	  
+	  _eo1[i] = eo2[j]; // insert subtree
+	  
+	  // no more pruning
+	  /*
+	  _eo1.pruneTree(max_length);
+	  */
+
+    return true;
+  }
+
+private :
+
+  unsigned max_length;
+  eoInit& initializer;
+};
+
+
+/** eoStPointMutation --> replace a Node with a Node of the same arity and type
+\class eoStPointMutation eoStParseTreeOp.h gp/eoStParseTreeOp.h
+\ingroup StParseTree
+ */
+template
+class eoStPointMutation: public eoMonOp< eoParseTree >
+{
+public:
+
+  typedef eoParseTree EoType;
+
+  /**
+   * Constructor
+   * @param _initializor The std::vector of Nodes given to the eoGpDepthInitializer
+   */
+  eoStPointMutation( std::vector& _node)
+    : eoMonOp()
+  {
+  	unsigned int i=0;
+        int arity=0;
+        int type=0;
+        std::vector node_std::vector;
+        for(i=0; i < _node.size(); i++)
+        {
+        	arity = _node[i].arity();
+		type = _node[i].type();
+		
+			node_std::vector = node[type][arity];
+			node_std::vector.push_back(_node[i]);
+			node[type][arity]= node_std::vector;
+		
+        };
+  };
+  
+  /// the class name
+  virtual std::string className() const { return "eoStPointMutation"; };
+
+  /// Dtor
+  virtual ~eoStPointMutation() {};
+
+  /**
+   * Mutate an individual
+   * @param _eo1 The individual that is to be changed
+   */
+  bool operator()(EoType& _eo1 )
+  {
+  	// select a random node i that is to be mutated
+	int i = rng.random(_eo1.size());
+	int arity = _eo1[i].arity();
+	int type = _eo1[i]->type();
+	int j = rng.random(node[type][arity].size());
+
+	
+	_eo1[i] = node[type][arity][j];
+    	return true;
+  }
+
+private :
+	
+	map < int, map < int, std::vector > > node;
+};
+
+ 
+ /** eoStHoistMutation -->  replace the individual with one of its strongly typed subtree's 
+\class eoStHoistMutation eoStParseTreeOp.h gp/eoStParseTreeOp.h
+\ingroup StParseTree
+ */
+template
+class eoStHoistMutation: public eoMonOp< eoParseTree >
+{
+public:
+
+  typedef eoParseTree EoType;
+  /**
+   * Constructor
+   * @param _init An instantiation of eoStDepthInit
+   * @param _max_length the maximum size of an individual
+   */
+  eoStHoistMutation(eoInit& _init, unsigned _max_length)
+    : eoMonOp(), max_length(_max_length), initializer(_init)
+  {};
+  
+  /// the class name
+  virtual std::string className() const { return "eoStHoistMutation"; };
+
+  /// Dtor
+  virtual ~eoStHoistMutation() {};
+  
+  /**
+   * Mutate an individual
+   * @param _eo1 The individual that is to be changed
+   */
+  bool operator()(EoType& _eo1 )
+  {
+
+	  std::vector nodes;
+	  // get the type of the current tree
+	  int type = _eo1[ _eo1.size() - 1 ]->type();
+
+      	
+	  
+	  do
+	  {
+		initializer(eo2);
+		get_possible_nodes(eo2, nodes, type);
+	  }while (nodes.empty());	
+	  
+	  // select a subtree-node to replace the current tree
+	  int n = rng.random(nodes.size());
+	  int i = nodes[n];
+	  
+	  EoType eo2(_eo1[i]);
+	  
+	  _eo1 = eo2;
+
+          return true;
+  }
+
+private :
+
+  unsigned max_length;
+  eoInit& initializer;
+};
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/gp/node_pool.h b/trunk/paradiseo-eo/src/gp/node_pool.h
new file mode 100644
index 000000000..e3b41b8ac
--- /dev/null
+++ b/trunk/paradiseo-eo/src/gp/node_pool.h
@@ -0,0 +1,313 @@
+/**
+
+ *	Pool allocator for the subtree and parse tree classes (homebrew and not compliant to ANSI allocator requirements)
+ *  (c) copyright Maarten Keijzer 1999, 2000 
+
+ * Permission to copy, use,  modify, sell and distribute this software is granted provided 
+ * this copyright notice appears in all copies. This software is provided "as is" without
+ * express or implied warranty, and with no claim as to its suitability for
+ * any purpose.
+ 
+ * Permission to modify the code and to distribute modified code is granted,
+ * provided the above notices are retained, and a notice that the code was
+ * modified is included with the above copyright notice.
+
+
+*/
+
+#ifndef node_pool_h
+#define node_pool_h
+
+class MemPool
+{
+public :
+    
+    MemPool(unsigned int sz) : esize(sznext;
+            delete p;
+        }
+    }
+    
+    void* allocate()
+    {
+        if (head == 0) grow();
+        Link* p = head;
+        head = p->next;
+        return static_cast(p);
+    }
+
+    void deallocate(void* b)
+    {
+        Link* p = static_cast(b);
+        p->next = head;
+        head = p;
+    }
+
+private :
+
+    void grow()
+    {
+        Chunk* n = new Chunk;
+        n->next = chunks;
+        chunks = n;
+
+        const int nelem = Chunk::size/esize;
+        char* start = n->mem;
+        char* last  = &start[(nelem-1)*esize];
+        for (char* p = start; p < last; p += esize)
+        {
+            reinterpret_cast(p)->next = 
+                reinterpret_cast(p + esize);
+        }
+        
+        reinterpret_cast(last)->next = 0;
+        head = reinterpret_cast(start);
+    }
+
+    struct Link
+    {
+        Link* next;
+    };
+
+    struct Chunk
+    {
+        enum {size = 8 * 1024 - 16};
+        Chunk* next;
+        char mem[size];
+    };
+
+    Chunk* chunks;
+    const unsigned int esize;
+    Link* head;
+};
+
+template
+class Node_alloc
+{
+public :
+    
+    T* allocate(void) 
+    {
+        T* t = static_cast(mem.allocate());
+        t = new  (t) T;
+        return t;
+    }
+    
+    T* construct(const T& org) 
+    {
+        T* t = static_cast(mem.allocate());
+        t = new  (t) T(org);
+        return t;
+    }
+
+    void deallocate(T* t)
+    {
+        t->~T(); // call destructor
+        mem.deallocate(static_cast(t));
+    }
+
+private :
+    static MemPool mem;
+};
+
+
+template  
+class Standard_alloc
+{
+public :
+    Standard_alloc() {}
+
+    T* allocate(size_t arity = 1)
+    {
+        if (arity == 0)
+            return 0;
+
+        return new T [arity];
+    }
+    
+    T* construct(size_t arity, T* org)
+    {
+        if (arity == 0)
+            return 0;
+
+        T* t = new T [arity];
+
+        for (int i = 0; i < arity; ++i)
+        {
+            t = T(org[i]);
+        }
+    }
+
+    void deallocate(T* t, size_t arity = 1)
+    {
+        if (arity == 0)
+            return ;
+
+        delete [] t;
+    }
+
+};
+
+template  
+class Standard_Node_alloc
+{
+public :
+    Standard_Node_alloc() {}
+
+    T* allocate(void)
+    {
+        return new T;// [arity];
+    }
+
+    T* construct(const T& org)
+    {
+        return new T(org);
+    }
+
+    void deallocate(T* t)
+    {
+        delete t;
+    }
+
+};
+
+template 
+class Tree_alloc
+{
+public :
+    Tree_alloc() {}
+
+    T* allocate(size_t arity)
+    {
+        T* t;
+
+        switch(arity)
+        {
+
+        case 0 : return 0;
+        case 1 :
+            {
+                t = static_cast(mem1.allocate());
+                new (t) T;
+                break;
+            }
+        case 2 :
+            {
+                t = static_cast(mem2.allocate());
+                new (t) T;
+                new (&t[1]) T;
+                break;
+            }
+        case 3 :
+            {
+                t = static_cast(mem3.allocate());
+                new (t) T;
+                new (&t[1]) T;
+                new (&t[2]) T;
+                break;
+            }
+        default :
+            {
+                return new T[arity];
+            }
+        }
+
+        return t;
+     }
+
+    T* construct(size_t arity, T* org)
+    {
+        T* t;
+
+        switch(arity)
+        {
+
+        case 0 : return 0;
+        case 1 :
+            {
+                t = static_cast(mem1.allocate());
+                new (t) T(*org);
+                break;
+            }
+        case 2 :
+            {
+                t = static_cast(mem2.allocate());
+                new (t) T(*org);
+                new (&t[1]) T(org[1]);
+                break;
+            }
+        case 3 :
+            {
+                t = static_cast(mem3.allocate());
+                new (t) T(*org);
+                new (&t[1]) T(org[1]);
+                new (&t[1]) T(org[2]);
+                break;
+            }
+        default :
+            {
+                t = new T[arity]; // does call default ctor
+                for (int i = 0; i < arity; ++i)
+                {
+                    t[i] = T(org[i]); // constructs now
+                }
+            }
+        }
+
+        return t;
+     }
+
+
+
+    void deallocate(T* t, size_t arity)
+    {
+        switch(arity)
+        {
+        case 0: return;
+        case 3 : 
+            {
+                t[2].~T(); t[1].~T(); t[0].~T();
+                mem3.deallocate(static_cast(t));
+                return;
+            }
+        case 2 : 
+            {
+                t[1].~T(); t[0].~T();
+                mem2.deallocate(static_cast(t));
+                return;
+            }
+        case 1 : 
+            {
+                t[0].~T();
+                mem1.deallocate(static_cast(t));
+                return;
+            }
+        default :
+            {
+                delete [] t;
+                return;
+            }
+        }
+    }
+    
+
+private :
+    static MemPool mem1;
+    static MemPool mem2;
+    static MemPool mem3;
+};
+
+// static (non thread_safe) memory pools
+template  MemPool Node_alloc::mem  = sizeof(T);
+
+template  MemPool Tree_alloc::mem1 = sizeof(T);
+template  MemPool Tree_alloc::mem2 = sizeof(T) * 2;
+template  MemPool Tree_alloc::mem3 = sizeof(T) * 3;
+
+#endif
diff --git a/trunk/paradiseo-eo/src/gp/parse_tree.h b/trunk/paradiseo-eo/src/gp/parse_tree.h
new file mode 100644
index 000000000..e18d00c9e
--- /dev/null
+++ b/trunk/paradiseo-eo/src/gp/parse_tree.h
@@ -0,0 +1,999 @@
+#ifndef PARSE_TREE_HH
+#define PARSE_TREE_HH
+
+/**
+
+ *	Parse_tree and subtree classes
+ *  (c) copyright Maarten Keijzer 1999, 2000
+
+ * Permission to copy, use,  modify, sell and distribute this software is granted provided
+ * this copyright notice appears in all copies. This software is provided "as is" without
+ * express or implied warranty, and with no claim as to its suitability for
+ * any purpose.
+
+ * Permission to modify the code and to distribute modified code is granted,
+ * provided the above notices as well as this one are retained, and a notice that the code was
+ * modified is included with the above copyright notice.
+
+
+
+  Usage information.
+
+  class Node (your node in the tree) must have the following implemented:
+
+  ******      Arity      ******
+
+	int arity(void) const
+
+	Note:	the default constructor of a Node should provide a
+			Node with arity 0!
+
+  ******    Evaluation   ******
+
+  A parse_tree is evaluated through one of it's apply() members:
+
+	1) parse_tree::apply(RetVal)
+
+	   is the simplest evaluation, it will call
+
+	   RetVal Node::operator()(RetVal, subtree::const_iterator)
+
+       (Unfortunately the first RetVal argument is mandatory (although you
+       might not need it. This is because MSVC does not support member template
+       functions properly. If it cannot deduce the template arguments (as is
+       the case in templatizing over return value) you are not allowed to
+       specify them. calling tree.apply() would result in a syntax
+       error. That is why you have to call tree.apply(double()) instead.)
+
+
+	2) parse_tree::apply(RetVal v, It values)
+
+       will call:
+
+       RetVal Node::operator()(RetVal, subtree<... , It values)
+
+       where It is whatever type you desire (most of the time
+	   this will be a std::vector containing the values of your
+	   variables);
+
+	3) parse_tree::apply(RetVal, It values, It2 moreValues)
+
+       will call:
+
+       RetVal Node::operator()(RetVal, subtree<... , It values, It2 moreValues)
+
+	   although I do not see the immediate use of this, however...
+
+	4) parse_tree::apply(RetVal, It values, It2 args, It3 adfs)
+
+		that calls:
+
+       RetVal Node::operator()(subtree<... , It values, It2 args, It3 adfs)
+
+		can be useful for implementing adfs.
+
+
+	In general it is a good idea to leave the specifics of the
+	arguments open so that different ways of evaluation remain
+	possible. Implement the simplest eval as:
+
+	template 
+		RetVal operator()(RetVal dummy, It begin) const
+
+  ******	Internal Structure    ******
+
+  A parse_tree has two template arguments: the Node and the ReturnValue
+  produced by evaluating the node. The structure of the tree is defined
+  through a subtree class that has the same two template arguments.
+
+  The nodes are stored in a tree like :
+
+			node4
+			/  \
+		 node3 node2
+		        / \
+            node1 node0
+
+  where nodes 2 and 4 have arity 2 and nodes 0,1 and 3 arity 0 (terminals)
+
+  The nodes are subtrees, containing the structure of the tree, together
+  with its size and depth. They contain a Node, the user defined template
+  argument. To access these nodes from a subtree, use operator-> or operator*.
+
+  The numbers behind the nodes define a reverse-polish or postfix
+  traversel through the tree. The parse_tree defines iterators
+  on the tree such that
+
+  tree.begin() points at the subtree at node0 and
+  tree.back()  returns the subtree at node4, the complete tree
+
+  Likewise operator[] is defined on the tree, such that:
+
+  tree[0] will return the subtree at node0, while
+  tree[2] will return the subtree at node2
+
+  Assigments of subtrees is protected so that the code:
+
+  tree[2] = tree[0];
+
+  will not crash and result in a tree structured as:
+
+		node4
+		/  \
+	 node3 node0
+
+  Note that the rank numbers no longer specify their place in the tree:
+
+  tree[0] still points at node0, but
+  tree[1] now points to node3 and
+  tree[2] points at the root node4
+
+  Embedded iterators are implemented to iterate over nodes rather
+  than subtrees. So an easy way to copy your tree to a std::vector is:
+
+  std::vector vec(tree.size());
+  copy(tree.ebegin(), tree.eend(), vec.begin());
+
+  You can also copy it to an std::ostream_iterator with this
+  technique, given that your Node implements an appropriate
+  operator<<. Reinitializing a tree with the std::vector is also
+  simple:
+
+  tree.clear();
+  copy(vec.begin(), vec.end(), back_inserter(tree));
+
+  or from an std::istream:
+
+  copy(std::istream_iterator(my_stream), std::istream_iterator(), back_inserter(tree));
+
+  Note that the back_inserter must be used as there is no
+  resize member in the parse_tree. back_inserter will use
+  the push_back member from the parse_tree
+
+*/
+
+#include 
+#include  // for swap
+
+#ifdef _MSC_VER
+#pragma warning(disable : 4786) // disable this nagging warning about the limitations of the mirkosoft debugger
+#endif
+
+namespace gp_parse_tree
+{
+
+#include "node_pool.h"
+
+/// This ones defined because gcc does not always implement namespaces
+template 
+inline void do_the_swap(T& a, T& b)
+{
+  T tmp = a;
+  a = b;
+  b = tmp;
+}
+
+template  class parse_tree
+{
+  public :
+
+
+class subtree
+{
+
+/*
+    a bit nasty way to use a pool allocator (which would otherwise use slooow new and delete)
+    TODO: use the std::allocator interface
+*/
+
+#if (defined(__GNUC__) || defined(_MSC_VER)) && !(defined(_MT) || defined(MACOSX) || defined(__APPLE__)) // not multithreaded (or MACOSX - J. Eggermont)
+    Node_alloc         node_allocator;
+    Tree_alloc   tree_allocator;
+#else
+    Standard_Node_alloc    node_allocator;
+    Standard_alloc   tree_allocator;
+#endif
+
+public :
+
+    typedef subtree* iterator;
+    typedef const subtree* const_iterator;
+
+	/* Constructors, assignments */
+
+    subtree(void) : content(node_allocator.allocate()), args(0), parent(0), _cumulative_size(0), _depth(0), _size(1)
+			{}
+    subtree(const subtree& s)
+        : content(node_allocator.allocate()),
+          args(0),
+          parent(0),
+          _cumulative_size(1),
+          _depth(1),
+          _size(1)
+    {
+        copy(s);
+    }
+
+    subtree(const T& t) : content(node_allocator.allocate()), args(0), parent(0), _cumulative_size(0), _depth(0), _size(1)
+			{ copy(t); }
+
+    template 
+        subtree(It b, It e) : content(node_allocator.allocate()), args(0), parent(0), _cumulative_size(0), _depth(0), _size(1)
+    { // initialize in prefix order for efficiency reasons
+        init(b, --e);
+    }
+
+    virtual ~subtree(void)    { tree_allocator.deallocate(args, arity()); node_allocator.deallocate(content); }
+
+    subtree& operator=(const subtree& s)
+	{
+	    if (s.get_root() == get_root())
+        { // from the same tree, maybe a child. Don't take any chances
+            subtree anotherS = s;
+            return copy(anotherS);
+        }
+
+		copy(s);
+        updateAfterInsert();
+        return *this;
+	}
+
+    subtree& operator=(const T& t)       { copy(t); updateAfterInsert(); return *this; }
+
+	/* Access to the nodes */
+
+    T&       operator*(void)             { return *content; }
+    const T& operator*(void) const       { return *content; }
+    T*       operator->(void)            { return content; }
+    const T* operator->(void) const      { return content; }
+
+	/* Equality, inequality check, Node needs to implement operator== */
+
+	bool operator==(const subtree& other) const
+	{
+		if (! (*content == *other.content))
+			return false;
+
+		for (int i = 0; i < arity(); i++)
+		{
+			if (!(args[i] == other.args[i]))
+				return false;
+		}
+
+		return true;
+	}
+
+	bool operator !=(const subtree& other) const
+	{
+		return !operator==(other);
+	}
+
+	/* Arity */
+    int arity(void) const                { return content->arity(); }
+
+	/* Evaluation with an increasing amount of user defined arguments */
+	template 
+	void apply(RetVal& v) const				 { (*content)(v, begin()); }
+
+	template 
+	void apply(RetVal& v, It values) const
+    {
+        (*content)(v, begin(), values);
+    }
+
+    template 
+    void apply_mem_func(RetVal& v, It misc, void (T::* f)(RetVal&, typename subtree::iterator, It))
+    {
+        (content->*f)(v, begin(), misc);
+    }
+
+
+/*	template 
+	void apply(RetVal& v, It values, It2 moreValues) const
+		{ (*content)(v, begin(), values, moreValues); }
+
+	template 
+	void apply(RetVal& v, It values, It2 moreValues, It3 evenMoreValues) const
+		{ (*content)(v, begin(), values, moreValues, evenMoreValues); }
+*/
+
+    template 
+    void find_nodes(std::vector& result, Pred& p)
+    {
+        if (p(*content))
+        {
+            result.push_back(this);
+        }
+
+        for (int i = 0; i < arity(); ++i)
+        {
+            args[i].find_nodes(result, p);
+        }
+    }
+
+    template 
+    void find_nodes(std::vector& result, Pred& p) const
+    {
+        if (p(*content))
+        {
+            result.push_back(this);
+        }
+
+        for (int i = 0; i < arity(); ++i)
+        {
+            args[i].find_nodes(result, p);
+        }
+    }
+
+	/* Iterators */
+
+    iterator begin(void)              { return args; }
+    const_iterator begin(void) const  { return args; }
+
+    iterator end(void)                { return args + arity(); }
+    const_iterator end(void) const    { return args + arity(); }
+
+	subtree& operator[](int i)		  { return *(begin() + i); }
+	const subtree& operator[](int i) const { return *(begin() + i); }
+
+	/* Some statistics */
+
+    size_t size(void) const { return _size; }
+
+    size_t cumulative_size(void) const { return _cumulative_size; }
+    size_t depth(void) const           { return _depth; }
+
+    const subtree& select_cumulative(size_t which) const
+    { return imp_select_cumulative(which); }
+
+    subtree& select_cumulative(size_t which)
+    { return const_cast(imp_select_cumulative(which)); }
+
+    subtree& get_node(size_t which)
+    { return const_cast(imp_get_node(which));}
+    const subtree& get_node(size_t which) const
+    { return imp_get_node(which); }
+
+    subtree*       get_parent(void)        { return parent; }
+    const subtree* get_parent(void) const  { return parent; }
+
+	void clear(void)
+	{ tree_allocator.deallocate(args, arity()); args = 0; *content = T(); parent = 0; _cumulative_size = 0; _depth = 0; _size = 0; }
+
+	void swap(subtree& y)
+	{
+        do_the_swap(content, y.content);
+        do_the_swap(args, y.args);
+
+        adopt();
+        y.adopt();
+
+        do_the_swap(parent, y.parent);
+
+        do_the_swap(_cumulative_size, y._cumulative_size);
+        do_the_swap(_depth, y._depth);
+        do_the_swap(_size, y._size);
+		updateAfterInsert();
+	}
+
+protected :
+
+	virtual void updateAfterInsert(void)
+    {
+        _depth = 0;
+        _size = 1;
+        _cumulative_size = 0;
+
+        for (iterator it = begin(); it != end(); ++it)
+        {
+            _size += it->size();
+            _cumulative_size += it->_cumulative_size;
+            _depth = it->_depth > _depth? it->_depth: _depth;
+        }
+        _cumulative_size += _size;
+        _depth++;
+
+        if (parent)
+            parent->updateAfterInsert();
+    }
+
+private :
+
+    const subtree& imp_select_cumulative(size_t which) const
+    {
+        if (which >= (_cumulative_size - size()))
+            return *this;
+        // else
+
+        for (int i = arity() - 1; i >= 0; --i)
+		{
+            if (which < args[i]._cumulative_size)
+                return args[i].imp_select_cumulative(which);
+            which -= args[i]._cumulative_size;
+        }
+
+        return *this; // error!
+    }
+
+    const subtree& imp_get_node(size_t which) const
+    {
+        if (which == size() - 1)
+            return *this;
+
+        for (int i = arity() - 1; i >= 0; --i)
+		{
+            unsigned c_size = args[i].size();
+            if (which < c_size)
+                return args[i].imp_get_node(which);
+            which -= c_size;
+        }
+
+        return *this; // error!
+    }
+
+    const subtree* get_root(void) const
+    {
+        if (parent == 0)
+            return this;
+        // else
+
+        return parent->get_root();
+    }
+    subtree& copy(const subtree& s)
+    {
+		int old_arity = arity();
+
+		int new_arity = s.arity();
+
+		if (new_arity != old_arity)
+		{
+			tree_allocator.deallocate(args, old_arity);
+
+            args = tree_allocator.allocate(new_arity);
+		}
+
+		switch(new_arity)
+		{
+		case 3 : args[2].copy(s.args[2]); args[2].parent = this; // no break!
+		case 2 : args[1].copy(s.args[1]); args[1].parent = this;
+		case 1 : args[0].copy(s.args[0]); args[0].parent = this;
+		case 0 : break;
+		default :
+			{
+				for (int i = 0; i < new_arity; ++i)
+				{
+					args[i].copy(s.args[i]);
+                    args[i].parent = this;
+				}
+			}
+		}
+
+		*content = *s.content;
+        _size = s._size;
+        _depth = s._depth;
+        _cumulative_size = s._cumulative_size;
+
+        return *this;
+    }
+
+    subtree& copy(const T& t)
+    {
+        int oldArity = arity();
+
+		if (content != &t)
+            *content = t;
+		else
+			oldArity = -1;
+
+		int ar = arity();
+
+		if (ar != oldArity)
+		{
+            if (oldArity != -1)
+			    tree_allocator.deallocate(args, oldArity);
+
+            args = tree_allocator.allocate(ar);
+
+            //if (ar > 0)
+			//	args = new subtree [ar];
+			//else
+			//	args = 0;
+		}
+
+        adopt();
+        updateAfterInsert();
+		return *this;
+    }
+
+	void disown(void)
+	{
+		switch(arity())
+		{
+		case 3 : args[2].parent = 0; // no break!
+		case 2 : args[1].parent = 0;
+		case 1 : args[0].parent = 0; break;
+		case 0 : break;
+		default :
+			{
+				for (iterator it = begin(); it != end(); ++it)
+				{
+					it->parent = 0;
+				}
+			}
+		}
+
+	}
+
+    void adopt(void)
+    {
+		switch(arity())
+		{
+		case 3 : args[2].parent = this; // no break!
+		case 2 : args[1].parent = this;
+		case 1 : args[0].parent = this; break;
+		case 0 : break;
+		default :
+			{
+				for (iterator it = begin(); it != end(); ++it)
+				{
+					it->parent = this;
+				}
+			}
+		}
+    }
+
+    template 
+    void init(It b, It& last)
+    {
+        *this = *last;
+
+#ifndef NDEBUG
+        if (last == b && arity() > 0)
+        {
+            throw "subtree::init()";
+        }
+#endif
+
+        for (int i = 0; i < arity(); ++i)
+        {
+            args[i].parent = 0;
+            args[i].init(b, --last);
+            args[i].parent = this;
+        }
+
+        updateAfterInsert();
+    }
+
+    T* content;
+    subtree*			args;
+    subtree*			parent;
+
+	size_t _cumulative_size;
+    size_t _depth;
+    size_t _size;
+};
+
+// Continuing with parse_tree
+
+    typedef T value_type;
+
+	/* Constructors and Assignments */
+
+    parse_tree(void) : _root(), pushed() {}
+    parse_tree(const parse_tree& org) : _root(org._root), pushed(org.pushed) { }
+    parse_tree(const subtree& sub) : _root(sub), pushed() { }
+
+    template 
+        parse_tree(It b, It e) : _root(b, e), pushed() {}
+
+    virtual ~parse_tree(void) {}
+
+    parse_tree& operator=(const parse_tree& org) { return copy(org); }
+	parse_tree& operator=(const subtree& sub)
+		{ return copy(sub); }
+
+
+	/* Equality and inequality */
+
+	bool operator==(const parse_tree& other) const
+	{ return _root == other._root; }
+
+	bool operator !=(const parse_tree& other) const
+	{ return !operator==(other); }
+
+	/* Simple tree statistics */
+
+    size_t size(void) const  { return _root.size(); }
+	size_t depth(void) const { return _root.depth(); }
+    void clear(void)        { _root.clear(); pushed.resize(0); }
+
+	/* Evaluation (application), with an increasing number of user defined arguments */
+
+	template 
+	void apply(RetVal& v) const
+		{ _root.apply(v); }
+
+	template 
+		void apply(RetVal& v, It varValues) const
+		{ _root.apply(v, varValues); }
+
+    template 
+        void apply_mem_func(RetVal& v, It misc, void (T::* f)(RetVal&, typename subtree::iterator, It))
+    {
+        _root.apply_mem_func(v, misc, f);
+    }
+
+	//template 
+	//	void apply(RetVal& v, It varValues, It2 moreValues) const
+	//	{ _root.apply(v, varValues, moreValues); }
+
+	//template 
+	//	void apply(RetVal& v, It varValues, It2 moreValues, It3 evenMoreValues) const
+	//	{ _root.apply(v, varValues, moreValues, evenMoreValues); }
+
+    template 
+    void find_nodes(std::vector& result, Pred& p)
+    {
+        _root.find_nodes(result, p);
+    }
+
+    template 
+    void find_nodes(std::vector& result, Pred& p) const
+    {
+        _root.find_nodes(p);
+    }
+
+	/* Customized Swap */
+	void swap(parse_tree& other)
+	{
+		do_the_swap(pushed, other.pushed);
+		_root.swap(other._root);
+	}
+
+	/* Definitions of the iterators */
+
+    class base_iterator
+    {
+    public :
+
+        base_iterator() {}
+        base_iterator(subtree* n)  { node = n; }
+
+        base_iterator& operator=(const base_iterator& org)
+        { node = org.node; return *this; }
+
+        bool operator==(const base_iterator& org) const
+        { return node == org.node; }
+        bool operator!=(const base_iterator& org) const
+        { return !operator==(org); }
+
+		base_iterator operator+(size_t n) const
+		{
+			base_iterator tmp = *this;
+
+			for(;n != 0; --n)
+			{
+				++tmp;
+			}
+
+			return tmp;
+		}
+
+		base_iterator& operator++(void)
+        {
+            subtree* parent = node->get_parent();
+
+            if (parent == 0)
+            {
+                node = 0;
+                return *this;
+            }
+            // else
+	    typename subtree::iterator it;
+            for (it = parent->begin(); it != parent->end(); ++it)
+            {
+                if (node == &(*it))
+                    break;
+            }
+
+            if (it == parent->begin())
+                node = parent;
+            else
+            {
+                node = &(--it)->get_node(0);
+            }
+
+            return *this;
+        }
+
+        base_iterator operator++(int)
+        {
+            base_iterator tmp = *this;
+            operator++();
+            return tmp;
+        }
+
+    protected :
+        subtree* node;
+    };
+
+    class iterator : public base_iterator
+    {
+    public:
+
+        using base_iterator::node;
+
+        typedef std::forward_iterator_tag iterator_category;
+        typedef subtree value_type;
+        typedef size_t distance_type;
+        typedef size_t difference_type;
+        typedef subtree* pointer;
+        typedef subtree& reference;
+
+        iterator() : base_iterator() {}
+        iterator(subtree* n): base_iterator(n)  {}
+        iterator& operator=(const iterator& org)
+        { base_iterator::operator=(org); return *this; }
+
+        subtree& operator*(void)  { return *node; }
+        subtree* operator->(void) { return node; }
+    };
+
+
+
+    class embedded_iterator : public base_iterator
+    {
+    public:
+
+        using base_iterator::node;
+
+        typedef std::forward_iterator_tag iterator_category;
+        typedef T value_type;
+        typedef size_t distance_type;
+        typedef size_t difference_type;
+        typedef T* pointer;
+        typedef T& reference;
+
+        embedded_iterator() : base_iterator() {}
+        embedded_iterator(subtree* n): base_iterator(n)  {}
+        embedded_iterator& operator=(const embedded_iterator& org)
+        { base_iterator::operator=(org); return *this; }
+
+        T&  operator*(void)  { return **node; }
+        T* operator->(void) { return &**node; }
+    };
+
+    class base_const_iterator
+    {
+    public:
+
+        base_const_iterator() {}
+        base_const_iterator(const subtree* n)  { node = n; }
+
+        base_const_iterator& operator=(const base_const_iterator& org)
+        { node = org.node; return *this; }
+
+        bool operator==(const base_const_iterator& org) const
+        { return node == org.node; }
+        bool operator!=(const base_const_iterator& org) const
+        { return !operator==(org); }
+
+        base_const_iterator& operator++(void)
+        {
+            const subtree* parent = node->get_parent();
+
+            if (parent == 0)
+            {
+                node = 0;
+                return *this;
+            }
+            // else
+	    typename subtree::const_iterator it;
+
+            for (it = parent->begin(); it != parent->end(); ++it)
+            {
+                if (node == &(*it))
+                    break;
+            }
+
+            if (it == parent->begin())
+                node = parent;
+            else
+                node = &(--it)->get_node(0);
+            return *this;
+        }
+
+        base_const_iterator operator++(int)
+        {
+            base_const_iterator tmp = *this;
+            operator++();
+            return tmp;
+        }
+
+    protected :
+
+        const subtree* node;
+    };
+
+    class const_iterator : public base_const_iterator
+    {
+    public:
+
+        using base_iterator::node;
+
+        typedef std::forward_iterator_tag iterator_category;
+        typedef const subtree value_type;
+        typedef size_t distance_type;
+        typedef size_t difference_type;
+        typedef const subtree* pointer;
+        typedef const subtree& reference;
+
+        const_iterator() : base_const_iterator() {}
+        const_iterator(const subtree* n): base_const_iterator(n)  {}
+        const_iterator& operator=(const const_iterator& org)
+        { base_const_iterator::operator=(org); return *this; }
+
+        const subtree& operator*(void)  { return *node; }
+        const subtree* operator->(void) { return node; }
+    };
+
+    class embedded_const_iterator : public base_const_iterator
+    {
+    public:
+
+        using base_const_iterator::node;
+
+		typedef std::forward_iterator_tag iterator_category;
+		typedef const T value_type;
+		typedef size_t distance_type;
+		typedef size_t difference_type;
+		typedef const T* pointer;
+		typedef const T& reference;
+
+        embedded_const_iterator() : base_const_iterator() {}
+        embedded_const_iterator(const subtree* n): base_const_iterator(n)  {}
+        embedded_const_iterator& operator=(const embedded_const_iterator& org)
+        { base_const_iterator::operator=(org); return *this; }
+
+		embedded_const_iterator operator+(size_t n) const
+		{
+			embedded_const_iterator tmp = *this;
+
+			for(;n != 0; --n)
+			{
+				++tmp;
+			}
+
+			return tmp;
+		}
+
+        const T&  operator*(void)  const { return **node; }
+        const T*  operator->(void) const { return node->operator->(); }
+    };
+
+	/* Iterator access */
+
+    iterator begin(void)            { return iterator(&operator[](0)); }
+    const_iterator begin(void) const { return const_iterator(&operator[](0)); }
+    iterator end(void)               { return iterator(0); }
+    const_iterator end(void) const   { return const_iterator(0);}
+
+    embedded_iterator       ebegin(void)       { return embedded_iterator(&operator[](0)); }
+    embedded_const_iterator ebegin(void) const { return embedded_const_iterator(&operator[](0)); }
+    embedded_iterator       eend(void)         { return embedded_iterator(0); }
+    embedded_const_iterator eend(void) const   { return embedded_const_iterator(0);}
+
+    bool empty(void) const { return size() == 0; }
+    bool valid(void) const { return pushed.empty(); }
+
+	/* push_back */
+
+	void push_back(const parse_tree& tree)
+	{
+		if (!empty())
+			pushed.push_back(_root);
+
+		_root = tree.back();
+	}
+
+    void push_back(const T& t)
+    {
+        if (!empty())
+            pushed.push_back(_root);
+
+		_root = t;
+
+        for (typename subtree::iterator it = _root.begin(); it != _root.end(); it++)
+        {
+			*it = pushed.back();
+            pushed.pop_back();
+        }
+
+    }
+
+	/* Access to subtrees */
+
+    subtree& back(void)              { return _root; }
+    const subtree& back(void) const  { return _root; }
+    subtree& root(void)              { return _root; }
+    const subtree& root(void) const  { return _root; }
+
+    subtree& front(void)              { return _root[0]; }
+    const subtree& front(void) const  { return _root[0]; }
+
+    subtree& operator[](size_t i)
+    { return const_cast(_root.get_node(i)); }
+    const subtree& operator[](size_t i) const
+    { return _root.get_node(i); }
+
+    subtree& get_cumulative(size_t i)
+    { return const_cast(_root.get_cumulative(i)); }
+    const subtree& get_cumulative(size_t i) const
+    { return get_cumulative(i); }
+
+    private :
+
+    parse_tree& copy(const parse_tree& org)
+    {
+        _root = org._root;
+        pushed = org.pushed;
+
+        return *this;
+    }
+
+	parse_tree& copy(const subtree& sub)
+    { _root = sub; pushed.resize(0); return *this; }
+
+    subtree _root;
+    std::vector pushed;
+}; // end class parse_tree
+
+
+} // end namespace gp_parse_tree
+
+namespace std
+{ // for use with stlport on MSVC
+
+template  inline
+std::forward_iterator_tag iterator_category(typename gp_parse_tree::parse_tree::embedded_iterator)
+{
+	return std::forward_iterator_tag();
+}
+
+template  inline
+ptrdiff_t*  distance_type(typename gp_parse_tree::parse_tree::embedded_iterator)
+{
+	return 0;
+}
+
+template  inline
+std::forward_iterator_tag iterator_category(typename gp_parse_tree::parse_tree::iterator)
+{
+	return std::forward_iterator_tag();
+}
+
+template  inline
+ptrdiff_t*  distance_type(typename gp_parse_tree::parse_tree::iterator)
+{
+	return 0;
+}
+
+/* Put customized swaps also in std...
+
+template inline
+void swap(gp_parse_tree::parse_tree& a, gp_parse_tree::parse_tree& b)
+{
+    a.swap(b);
+}
+
+template inline
+void iter_swap(std::vector >::iterator a, std::vector > b)
+{
+    a->swap(*b);
+}*/
+
+
+} // namespace std
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/obsolete/.cvsignore b/trunk/paradiseo-eo/src/obsolete/.cvsignore
new file mode 100644
index 000000000..69fb0bd82
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/.cvsignore
@@ -0,0 +1,6 @@
+*.lo
+*.la
+.deps
+.libs
+Makefile
+Makefile.in
diff --git a/trunk/paradiseo-eo/src/obsolete/CVS/Entries b/trunk/paradiseo-eo/src/obsolete/CVS/Entries
new file mode 100644
index 000000000..45cd4316c
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/CVS/Entries
@@ -0,0 +1,80 @@
+/.cvsignore/1.1/Mon Apr  3 09:32:08 2000//
+/Makefile.am/1.2/Sun Jan 28 07:00:41 2001//
+/eo1d.h/1.2/Thu Feb 27 19:24:15 2003//
+/eo1dWDistance.h/1.2/Thu Feb 27 19:24:15 2003//
+/eo2d.h/1.2/Thu Feb 27 19:24:15 2003//
+/eo2dVector.h/1.2/Thu Feb 27 19:24:15 2003//
+/eoAtomBitFlip.h/1.2/Thu Feb 27 19:24:15 2003//
+/eoAtomCreep.h/1.2/Thu Feb 27 19:24:15 2003//
+/eoAtomRandom.h/1.2/Thu Feb 27 19:24:15 2003//
+/eoBackInserter.h/1.2/Thu Feb 27 19:24:15 2003//
+/eoBin.h/1.2/Thu Feb 27 19:24:15 2003//
+/eoBreeder.h/1.2/Thu Feb 27 19:24:15 2003//
+/eoCopyElite.h/1.2/Thu Feb 27 19:24:15 2003//
+/eoDEA.h/1.1/Mon Jun  9 06:06:13 2003//
+/eoDetTournament.h/1.2/Thu Feb 27 19:24:15 2003//
+/eoDetTournamentIndiSelector.h/1.1/Thu Aug 10 14:18:31 2000//
+/eoDetTournamentInserter.h/1.2/Thu Feb 27 19:24:15 2003//
+/eoDistance.h/1.2/Thu Feb 27 19:24:14 2003//
+/eoDup.h/1.2/Thu Feb 27 19:24:14 2003//
+/eoES.h/1.2/Thu Feb 27 19:24:14 2003//
+/eoESChrom.h/1.2/Thu Feb 27 19:24:14 2003//
+/eoESFullChrom.h/1.2/Thu Feb 27 19:24:14 2003//
+/eoESFullMut.h/1.2/Thu Feb 27 19:24:14 2003//
+/eoEsObjectiveBounds.h/1.2/Thu Feb 27 19:24:14 2003//
+/eoEvalFuncPtrCnt.h/1.1/Thu Aug 10 14:18:31 2000//
+/eoEvolutionStrategy.h/1.1/Fri Feb  9 05:10:25 2001//
+/eoFitTerm.h/1.1/Thu Aug 10 14:18:31 2000//
+/eoFitness.h/1.1/Thu Aug 10 14:18:31 2000//
+/eoGOpBreeder.h/1.2/Thu Feb 27 19:24:14 2003//
+/eoGOpSelector.h/1.2/Thu Feb 27 19:24:14 2003//
+/eoGenTerm.h/1.2/Thu Feb 27 19:24:14 2003//
+/eoGeneration.h/1.2/Thu Feb 27 19:24:14 2003//
+/eoGenericBinOp.h/1.2/Thu Feb 27 19:24:14 2003//
+/eoGenericMonOp.h/1.2/Thu Feb 27 19:24:14 2003//
+/eoGenericQuadOp.h/1.2/Thu Feb 27 19:24:14 2003//
+/eoID.h/1.2/Thu Feb 27 19:24:14 2003//
+/eoInclusion.h/1.2/Thu Feb 27 19:24:14 2003//
+/eoIndiSelector.h/1.1/Fri Feb  9 05:09:26 2001//
+/eoInplaceTransform.h/1.2/Thu Feb 27 19:24:14 2003//
+/eoInserter.h/1.1/Fri Feb  9 05:09:26 2001//
+/eoInsertion.h/1.2/Thu Feb 27 19:24:14 2003//
+/eoKill.h/1.2/Thu Feb 27 19:24:14 2003//
+/eoLottery.h/1.2/Thu Feb 27 19:24:14 2003//
+/eoMutation.h/1.2/Thu Feb 27 19:24:14 2003//
+/eoNegExp.h/1.1/Thu Aug 10 14:18:32 2000//
+/eoNonUniform.h/1.1/Thu Aug 10 14:18:32 2000//
+/eoNormal.h/1.1/Thu Aug 10 14:18:32 2000//
+/eoOpFactory.h/1.2/Thu Feb 27 19:24:14 2003//
+/eoOpSelector.h/1.2/Thu Feb 27 19:24:14 2003//
+/eoParser.h/1.2/Thu Feb 27 19:24:13 2003//
+/eoParserUtils.cpp/1.2/Thu Mar 30 14:20:24 2000//
+/eoParserUtils.h/1.3/Thu Mar 30 17:11:19 2000//
+/eoPopOps.h/1.2/Thu Feb 27 19:24:13 2003//
+/eoProblem.h/1.1/Wed Mar 22 14:21:02 2000//
+/eoProportional.h/1.2/Thu Feb 27 19:24:13 2003//
+/eoProportionalGOpSel.h/1.2/Thu Feb 27 19:24:13 2003//
+/eoProportionalOpSel.h/1.2/Thu Feb 27 19:24:13 2003//
+/eoRandomBreed.h/1.2/Thu Feb 27 19:24:13 2003//
+/eoRandomIndiSelector.h/1.1/Thu Aug 10 14:18:32 2000//
+/eoRandomSelect.h/1.2/Thu Feb 27 19:24:13 2003//
+/eoRank.h/1.2/Thu Feb 27 19:24:13 2003//
+/eoScheme.h/1.2/Thu Feb 27 19:24:13 2003//
+/eoSelectRandom.h/1.1/Fri Jan  5 05:42:08 2001//
+/eoSequentialGOpSel.h/1.1/Fri Feb  9 05:09:26 2001//
+/eoSimpleDEA.h/1.1/Mon Jun  9 06:06:13 2003//
+/eoSteadyStateEA.h/1.2/Thu Feb 27 19:24:12 2003//
+/eoSteadyStateInserter.h/1.1/Fri Feb  9 05:09:26 2001//
+/eoSteadyStateTransform.h/1.1/Fri Feb  9 05:09:26 2001//
+/eoStochTournament.h/1.2/Thu Feb 27 19:24:12 2003//
+/eoStochTournamentInserter.h/1.2/Thu Feb 27 19:24:12 2003//
+/eoStringMutation.h/1.2/Thu Feb 27 19:24:12 2003//
+/eoTerm.h/1.1/Thu Aug 10 14:18:32 2000//
+/eoTournament.h/1.2/Thu Feb 27 19:24:12 2003//
+/eoTranspose.h/1.2/Thu Feb 27 19:24:12 2003//
+/eoUniformXOver.h/1.2/Thu Feb 27 19:24:12 2003//
+/eoVector.h/1.2/Thu Feb 27 19:24:12 2003//
+/eoWrappedOps.h/1.2/Thu Feb 27 19:24:12 2003//
+/eoXOver2.h/1.2/Thu Feb 27 19:24:11 2003//
+/evolution_strategies/1.1/Sun Jan 28 07:00:41 2001//
+D
diff --git a/trunk/paradiseo-eo/src/obsolete/CVS/Repository b/trunk/paradiseo-eo/src/obsolete/CVS/Repository
new file mode 100644
index 000000000..23c7835c3
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/CVS/Repository
@@ -0,0 +1 @@
+eo/src/obsolete
diff --git a/trunk/paradiseo-eo/src/obsolete/CVS/Root b/trunk/paradiseo-eo/src/obsolete/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/src/obsolete/Makefile.am b/trunk/paradiseo-eo/src/obsolete/Makefile.am
new file mode 100644
index 000000000..1a94e144a
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/Makefile.am
@@ -0,0 +1,14 @@
+###############################################################################
+##
+## Makefile.am for eo/src/obsolete
+##
+###############################################################################
+
+INCLUDES = -I$(top_builddir)/src
+
+lib_LIBRARIES = libeoobsolete.a
+libeoobsolete_a_SOURCES = eoParserUtils.cpp
+
+libeoobsoleteincdir = $(includedir)/eo/obsolete
+libeoobsoleteinc_HEADERS = eo1d.h eo1dWDistance.h eo2d.h eo2dVector.h eoAtomBitFlip.h eoAtomCreep.h eoAtomMutation.h eoAtomMutator.h eoAtomRandom.h eoBin.h eoBreeder.h eoCopyElite.h eoDetTournament.h eoDetTournamentIndiSelector.h eoDistance.h eoDup.h eoES.h eoESChrom.h eoESFullChrom.h eoESFullMut.h eoEsObjectiveBounds.h eoEvalFuncPtrCnt.h eoFitTerm.h eoFitness.h eoGenTerm.h eoGeneration.h eoID.h eoInclusion.h eoInsertion.h eoKill.h eoLottery.h eoMutation.h eoNegExp.h eoNonUniform.h eoNormal.h eoParser.h eoParserUtils.h eoPopOps.h eoProblem.h eoProportional.h eoRandomBreed.h eoRandomIndiSelector.h eoRandomSelect.h eoRank.h eoRnd.h eoScheme.h eoSelectRandom.h eoStochTournament.h eoStringMutation.h eoTerm.h eoTournament.h eoTranspose.h eoUniform.h eoUniformXOver.h eoVector.h eoXOver2.h  
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eo1d.h b/trunk/paradiseo-eo/src/obsolete/eo1d.h
new file mode 100644
index 000000000..73e83ea05
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eo1d.h
@@ -0,0 +1,199 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eo1d.h 
+       Serial EO.
+
+   (c) GeNeura Team, 1998
+ 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _EO1D_H
+#define _EO1D_H
+
+#include 				// for std::ostream
+
+// EO Includes
+#include 
+#include 
+
+using namespace std;
+
+/** @name eo1d class 
+ * Randomly accesible  evolvable object with one dimension, with variable
+ * length. Use this if you want to evolve "linear" things, like bitstrings, 
+ * or floating-point arrays. If you don't, subclass directly from EO
+ * @see EO
+ * @author GeNeura
+ * @version 0.2
+ */
+
+//@{
+/** 
+@deprecated {eo1d} eo1d
+\deprecated
+*/
+
+/**  
+
+  eo1d: Base class for "chromosomes" with a single dimension
+#T# is the type it will be instantiated with; this type must have, at
+least, a copy ctor, assignment operators, 
+
+  \deprecated 
+  As eo1d provides a so-called 'fat' interface, it might be wiser to
+  use eoFixedLength or eoVariableLength instead, that derive from
+  std::vector and std::list respectively and (important) redirect the less than
+  comparison operator to EO rather than the STL variants.
+ 
+   @see eoFixedLength eoVariableLength
+*/
+template
+class eo1d: public EO< fitnessT > {
+public:
+
+  /// Declaration to make it accessible from subclasses
+  typedef T Type;
+
+  /** Can be used as default ctor; should be called from derived
+      classes. Fitness should be  at birth
+  */
+  eo1d()
+    :EO ( ) {};
+
+  /** Ctor using a random number generator and with an specified size
+      @param _rndGen Random number generator
+      @param _size lineal dimension of the eo1d
+      @param _ID An ID std::string, preferably unique
+  */
+  eo1d( unsigned _size, eoRnd& _rndGen, const std::string& _ID = "");
+
+ /** Ctor from a std::istream. It just passes the stream to EO, subclasses should
+     have to implement this.
+     @param _is the input stream
+ */ 
+  eo1d( std::istream& _is): EO(){ readFrom(is); }
+
+  /// Copy ctor
+  eo1d( const eo1d& _eo )
+    :EO ( _eo ) {};
+
+  /// Assignment operator
+  const eo1d& operator= ( const eo1d& _eo ) {
+	  EO::operator = ( _eo );
+	  return *this;
+  }
+
+  /// Needed virtual dtor
+  virtual ~eo1d(){};
+
+  /** Reads and returns a copy of the gene in position _i
+      This implies that T must have a copy ctor .
+      @param _i index of the gene, which is the minimal unit. Must be
+      an unsigned less than #length()#  
+      @return what's inside the gene, with the correct type
+	  @std::exception out_of_range if _i > size()
+    */
+  virtual T getGene( unsigned _i ) const = 0;
+
+  /** Overwrites the gene placed in position _i with a
+   * new value. This means that the assignment operator
+   * for T must be defined .
+   @param _i index
+   @return what's inside the gene, with the correct type
+   @std::exception out_of_range if _i > size()
+  */
+  virtual void setGene( unsigned _i, const T& _value ) = 0;
+
+  /** Inserts a gene, moving the rest to the right. If
+   * _i = length(), it should insert it at the end.
+   * Obviously, changes length 
+   @param _i index
+   @param _val new value
+  */
+  virtual void insertGene( unsigned _i, T _val ) = 0;
+
+  /** Eliminates the gene at position _i; all the other genes will
+      be shifted left
+      @param _i index of the gene that is going to be modified.
+  */
+  virtual void deleteGene( unsigned _i ) = 0;
+
+  /// Returns the number of genes in the eo1d
+  virtual unsigned length() const = 0;
+
+  /// @name Methods from eoObject
+  //@{
+  /**
+   * Read object. Theoretically, the length is known in advance. All objects
+   * Should call base class
+   * @param _s A std::istream.
+   * @throw runtime_std::exception If a valid object can't be read.
+   */
+  virtual void readFrom(std::istream& _s) {
+
+    for ( unsigned i = 0; i < length(); i ++ ) {
+      T tmp;
+      _s >> tmp;
+      setGene( i, tmp );
+    }
+    // there is no way of distinguishing fitness from the object, so
+    // it's skipped
+  }
+
+  /** Print itself: inherited from eoObject implementation. 
+      Instance from base classes are processed in
+      base classes, so you don´t have to worry about, for instance, fitness.
+  @param _s the std::ostream in which things are written*/
+  virtual void printOn( std::ostream& _s ) const{
+    for ( unsigned i = 0; i < length(); i ++ ) {
+      _s << getGene( i ) << " ";
+    }
+  }
+
+  /** Inherited from eoObject 
+      @see eoObject
+  */
+  std::string className() const {return "eo1d";};
+
+  //@}
+
+};
+
+//@}
+
+
+// --------------- Implementations --------------------------
+
+/* Ctor using a random number generator and with an specified size
+   @param _rndGen Random number generator
+   @param _size lineal dimension of the eo1d
+   @param _ID An ID std::string, preferably unique
+*/
+template< class T, class fitnessT>
+eo1d::eo1d( unsigned _size, eoRnd& _rndGen,
+				    const std::string& _ID )
+	:EO ( _ID ) {
+  for ( unsigned i = 0; i < _size; i ++ ) {
+    insertGene( i, _rndGen() );
+  }
+};
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/obsolete/eo1dWDistance.h b/trunk/paradiseo-eo/src/obsolete/eo1dWDistance.h
new file mode 100644
index 000000000..2019e95c7
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eo1dWDistance.h
@@ -0,0 +1,136 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eo1dWDistance.h 
+       Serial EO with distances. Acts as a wrapper for normal eo1ds
+
+   (c) GeNeura Team, 1998
+ 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _EO1DWDISTANCE_H
+#define _EO1DWDISTANCE_H
+
+#include 				// for std::ostream
+
+// EO Includes
+#include 
+#include 
+
+using namespace std;
+
+/** eo1dWDistance: wraps around eo1ds and adds the possibility of computing distances
+around them.
+*/
+template
+class eo1dWDistance: 
+  public eo1d< T,fitnessT >, 
+  public eoDistance > {
+public:
+
+  /** Can be used as default ctor; should be called from derived
+      classes. Fitness should be  at birth
+  */
+  eo1dWDistance( eo1d& _eo)
+    :eo1d (), eoDistance< eo1d >(), innereo1d( _eo ) {};
+
+  /// Needed virtual dtor
+  virtual ~eo1dWDistance(){};
+
+  /** Reads and returns a copy of the gene in position _i
+      This implies that T must have a copy ctor .
+      @param _i index of the gene, which is the minimal unit. Must be
+      an unsigned less than #length()#  
+      @return what's inside the gene, with the correct type
+	  @std::exception out_of_range if _i > size()
+    */
+  virtual T getGene( unsigned _i ) const {
+    return innereo1d.getGene( _i );
+  };
+
+  /** Overwrites the gene placed in position _i with a
+   * new value. This means that the assignment operator
+   * for T must be defined .
+   @param _i index
+   @return what's inside the gene, with the correct type
+   @std::exception out_of_range if _i > size()
+  */
+  virtual void setGene( unsigned _i, const T& _value ) {
+    innereo1d.setGene( _i, _value);
+  };
+
+  /** Inserts a gene, moving the rest to the right. If
+   * _i = length(), it should insert it at the end.
+   * Obviously, changes length 
+   @param _i index
+   @param _val new value
+  */
+  virtual void insertGene( unsigned _i, T _val )  {
+    innereo1d.insertGene( _i, _val);
+  }
+
+  /** Eliminates the gene at position _i; all the other genes will
+      be shifted left
+      @param _i index of the gene that is going to be modified.
+  */
+  virtual void deleteGene( unsigned _i ) {
+    innereo1d.deleteGene( _i );
+  }
+
+  /// Returns the number of genes in the eo1d
+  virtual unsigned length() const {
+    return innereo1d.length();
+  }
+
+  /// Returns the distance from this EO to the other
+  virtual double distance( const eo1d& _eo ) const {
+    double tmp = 0;
+    // Which one is shorter
+    unsigned len = (innereo1d.length() < _eo.length()) ? _eo.length():innereo1d.length();
+
+    // Compute over the whole length. If it does not exists, it counts as 0
+    for ( unsigned i = 0; i < len; i ++ ) {
+      T val1, val2;
+      val1 = ( i > innereo1d.length())?0:innereo1d.getGene(i);
+      val2 = ( i > _eo.length() )?0:_eo.getGene(i);
+      double diff = val1 - val2;
+      tmp += diff*diff;
+    }
+    return tmp;
+  }
+
+  /** Inherited from eoObject 
+      @see eoObject
+  */
+  std::string className() const {return "eo1dWDistance";};
+
+  //@}
+
+private:
+  ///Private ctor. Do not use
+  eo1dWDistance() {};
+
+  
+  eo1d& innereo1d;
+};
+
+//@}
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/obsolete/eo2d.h b/trunk/paradiseo-eo/src/obsolete/eo2d.h
new file mode 100644
index 000000000..c8d082197
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eo2d.h
@@ -0,0 +1,242 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+/*
+-----------------------------------------------------------------------------
+File............: eo2d.h
+Author..........: Geneura Team (this file: Victor Rivas, vrivas@ujaen.es)
+Date............: 21-Sep-1999, at Fac. of Sciences, Univ. of Granada (Spain)
+Description.....: Implementation of a 2-dimensional chromosome.
+
+  ================  Modif. 1  ================
+  Author........:
+  Date..........:
+  Description...:
+
+-----------------------------------------------------------------------------
+*/
+//-----------------------------------------------------------------------------
+// eo2d.h 
+// (c) GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _EO2D_H
+#define _EO2D_H
+
+#include 				// for std::ostream
+#include 
+
+// EO Includes
+#include 
+#include 
+
+using namespace std;
+
+/** @name eo2d class 
+* Randomly accesible  evolvable object with two dimension, with
+variable length each of them.  
+* Use this if you want to evolve "two-dimensional" things, like bit arrays, or
+floating-point arrays. If you don't, subclass directly from EO
+* @see EO
+* @author GeNeura
+* @version 0.2
+*/
+
+//@{
+
+/** eo2d: Base class for "chromosomes" with a double dimension
+#T# is the type it will be instantiated with; this type must have, at
+least, a copy ctor, assignment operators, 
+*/
+template
+class eo2d: public EO< fitnessT > {
+public:
+
+  /// Declaration to make it accessible from subclasses
+  typedef T Type;
+
+  /** Can be used as default ctor; should be called from derived
+      classes. Fitness should be  at birth
+  */
+  eo2d()
+    :EO ( ) {};
+
+  /** Ctor using a random number generator and with an specified size
+      @param _rows Initial number of rows
+      @param _columns Initial number of columns
+      @param _rndGen Random "T-type" generator
+      @param _ID An ID std::string, preferably unique
+  */
+  eo2d( const unsigned _rows, 
+	const unsigned _columns,
+	eoRnd& _rndGen, 
+	const std::string& _ID = "");
+
+ /** Ctor from an std::istream. It just passes the stream to EO, subclasses should
+     have to implement this.
+     @param _is the input stream
+ */ 
+  eo2d( std::istream& _is): EO( _is ){};
+
+  /// Copy ctor
+  eo2d( const eo2d& _eo )
+    :EO ( _eo ) {};
+
+  /// Assignment operator
+  const eo2d& operator= ( const eo2d& _eo ) {
+	  EO::operator = ( _eo );
+	  return *this;
+  }
+
+  /// Needed virtual dtor
+  virtual ~eo2d(){};
+
+  /** Reads and returns a copy of the gene in position _r,_c.\
+      This implies that T must have a copy ctor .
+      @param _r Index for rows. Must be an unsigned less than #numOfRows()#  
+      @param _c Index for columns. Must be an unsigned less than #numOfCols()#
+      @return what's inside the gene, with the correct type
+      @std::exception out_of_range if _r >=numOfRows()
+      @std::exception out_of_range if _c >=numOfCols()
+    */
+  virtual T getGene( const unsigned _r,
+		     const unsigned _j ) const = 0;
+
+  /** Overwrites the gene placed in position _r,_c with a
+   * new value. This means that the assignment operator
+   * for T must be defined .
+   @param _r Index for rows. Must be an unsigned less than #numOfRows()#  
+   @param _c Index for columns. Must be an unsigned less than #numOfCols()#
+   @return what's inside the gene, with the correct type
+   @std::exception out_of_range if _r >=numOfRows()
+   @std::exception out_of_range if _c >=numOfCols()
+  */
+  virtual void setGene( const unsigned _r, 
+			const unsigned _c, 
+			const T& _value ) = 0;
+
+  /** Inserts a row, moving the rest to the bottom. 
+   * If _r = numOfRows(), it insert it at the end.
+   * Obviously, changes number of rows. 
+   @param _r Position where the new row will be inserted.
+   @param _val Vector containing the new values to be inserted.
+   @std::exception invalid_argument If _val has not numOfCols() components.
+   @std::exception out_of_range If _r is greater than numOfRows()
+  */
+  virtual void insertRow( const unsigned _r, 
+			  const std::vector& _val ) = 0;
+
+  /** Eliminates the row at position _r; all the other genes will
+      be shifted up.
+      @param _r Number of he row to be deleted.
+      @std::exception out_of_range if _r >=numOfRows()
+  */
+  virtual void deleteRow( const unsigned _r ) = 0;
+
+  /** Inserts a column, moving the rest to the right. 
+   * If _c = numOfCols(), it insert it at the end.
+   * Obviously, changes number of cols. 
+   @param _r Position where the new column will be inserted.
+   @param _val Vector containing the new values to be inserted.
+   @std::exception invalid_argument if _val has not numOfRows() components.
+  */
+  virtual void insertCol( const unsigned _c, 
+			  const std::vector& _val ) = 0;
+
+  /** Eliminates the column at position _c; all the other columns will
+      be shifted left.
+      @param _c Number of he column to be deleted.
+      @std::exception out_of_range if _c >=numOfCols()
+  */
+  virtual void deleteCol( const unsigned _c ) = 0;
+  
+  /// Returns the number of rows in the eo2d
+  virtual unsigned numOfRows() const = 0;
+
+  /// Returns the number of columns in the eo2d
+  virtual unsigned numOfCols() const = 0;
+
+  /// @name Methods from eoObject
+  //@{
+  /**
+   * Read object. Theoretically, the length is known in advance. All objects
+   * Should call base class
+   * @param _s A std::istream.
+   * @throw runtime_std::exception If a valid object can't be read.
+   */
+  virtual void readFrom(std::istream& _s) {
+
+    for ( unsigned r = 0; r < numOfRows(); ++r ) {
+      for ( unsigned c = 0; c < numOfCols(); ++c ) {
+	T tmp;
+	_s >> tmp;
+	setGene( r, c, tmp );
+      }
+    }
+    // there is no way of distinguishing fitness from the object, so
+    // it's skipped
+  }
+
+  /** Print itself: inherited from eoObject implementation. 
+      Instance from base classes are processed in
+      base classes, so you don´t have to worry about, for instance, fitness.
+  @param _s the std::ostream in which things are written*/
+  virtual void printOn( std::ostream& _s ) const{
+    for ( unsigned r = 0; r < numOfRows(); ++r ) {
+      for ( unsigned c = 0; c < numOfCols(); ++c ) {
+	_s << getGene( r,c ) << " ";
+      }
+    }
+  }
+
+  /** Inherited from eoObject 
+      @see eoObject
+  */
+  std::string className() const {return "eo2d";};
+
+  //@}
+
+};
+
+//@}
+
+
+// --------------- Implementations --------------------------
+
+/** Ctor using a random number generator and with an specified size
+    @param _rows Initial number of rows
+    @param _columns Initial number of columns
+    @param _rndGen Random "T-type" generator
+    @param _ID An ID std::string, preferably unique
+*/
+template< class T, class fitnessT>
+eo2d::eo2d( const unsigned _rows, 
+				    const unsigned _columns,
+				    eoRnd& _rndGen, 
+				    const std::string& _ID = "")
+  :EO ( _ID ) {
+  for ( unsigned r = 0; r < _rows; ++r ) {
+    for ( unsigned c = 0; c < _cols; ++c ) {
+      insertGene( r, c, _rndGen() );
+    }
+  }
+};
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/obsolete/eo2dVector.h b/trunk/paradiseo-eo/src/obsolete/eo2dVector.h
new file mode 100644
index 000000000..ec5833681
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eo2dVector.h
@@ -0,0 +1,334 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+/*
+-----------------------------------------------------------------------------
+File............: eo2dVector.h
+Author..........: Geneura Team (this file: Victor Rivas, vrivas@ujaen.es)
+Date............: 29-Sep-1999, at Fac. of Sciences, Univ. of Granada (Spain)
+Description.....: Implementation of a 2-dimensional chromosome usign STL 
+                  std::vectors.
+
+  ================  Modif. 1  ================
+  Author........:
+  Date..........:
+  Description...:
+
+QUEDA: Operador de asignación, lectura desde std::istream, escritura a std::ostream
+-----------------------------------------------------------------------------
+*/
+//-----------------------------------------------------------------------------
+// eo2dVector.h
+// (c) GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+
+#ifndef _eo2dVector_H
+#define _eo2dVector_H
+
+// STL libraries
+#include 		// For std::vector
+#include 
+#include 
+#include 
+
+#include 
+#include 
+
+/** Adaptor that turns an STL std::vector of vectror into an EO
+    with the same gene type as the type with which
+    the std::vector of std::vector has been instantiated.
+*/
+template 
+class eo2dVector: public eo2d, public std::vector< std::vector > {
+public:
+  typedef T Type ;
+  
+  /** @name Canonical part of the objects: several ctors, copy ctor, \
+   * dtor and assignment operator.
+   */
+  //@{
+  
+  /** Ctor. 
+      @param _rows Number of rows.
+      @param _cols Number of columns.
+      @param _val Common initial value
+  */
+  eo2dVector( const unsigned _rows = 0, 
+	      const unsigned _cols = 0, 
+	      T _val = T() )
+    : eo2d(), std::vector< std::vector >( _rows, std::vector( _cols, _val ) ){};
+  
+  /** Ctor using a random number generator.
+      @param _rows Number of rows.
+      @param _cols Number of columns.
+      @param _rnd A random "T-type" generator, which returns a random value each time it´s called.
+  */
+  eo2dVector( const unsigned _rows, 
+	      const unsigned _cols, 
+	      eoRnd& _rnd );
+  
+  /** Ctor from a std::istream. The T class should accept reading from a std::istream. It doesn't read fitness,
+      which is supposed to be dynamic and dependent on environment. 
+      @param _is the input stream; should have all values in a single line, separated by whitespace
+  */
+  //eo2dVector( std::istream& _is);
+  
+  
+  /// copy ctor
+  eo2dVector( const eo2dVector & _eo )
+    : eo2d( _eo ), std::vector< std::vector >( _eo ){ };
+  
+  /// Assignment operator
+  /*
+    const eo2dVector& operator =( const eo2dVector & _eo ) {
+    if ( this != &_eo ){
+    eo2d::operator=( _eo );
+    std::vector<  >::operator=( _eo );
+    }
+    return *this;
+    }
+  */
+  /// dtor
+  virtual ~eo2dVector() {};
+  
+  //@}
+  /** Reads and returns a copy of the gene in position _r,_c.\
+      This implies that T must have a copy ctor .
+      @param _r Index for rows. Must be an unsigned less than #numOfRows()#  
+      @param _c Index for columns. Must be an unsigned less than #numOfCols()#
+      @return what's inside the gene, with the correct type
+      @std::exception out_of_range if _r >=numOfRows()
+      @std::exception out_of_range if _c >=numOfCols()
+  */
+  virtual T getGene( const unsigned _r,
+		     const unsigned _c ) const {
+    if ( _r >= numOfRows() ) {
+      std::ostrstream msg;
+      msg << "ERROR in eo2dVector::getGene: row out of range. " 
+	  << "It should be <" << numOfRows() << '\0' << std::endl;
+      throw out_of_range( msg.str() );
+    }
+    if ( _c >= numOfCols() ) {
+      std::ostrstream msg;
+      msg << "ERROR in eo2dVector::getGene: column out of range. " 
+	  << "It should be <" << numOfCols() << '\0' << std::endl;
+      throw out_of_range( msg.str() );
+    }
+    return (*this)[_r][_c];
+  };
+  /** Overwrites the gene placed in position _r,_c with a
+   * new value. This means that the assignment operator
+   * for T must be defined .
+   @param _r Index for rows. Must be an unsigned less than #numOfRows()#  
+   @param _c Index for columns. Must be an unsigned less than #numOfCols()#
+   @return what's inside the gene, with the correct type
+   @std::exception out_of_range if _r >=numOfRows()
+   @std::exception out_of_range if _c >=numOfCols()
+  */
+  virtual void setGene( const unsigned _r, 
+			const unsigned _c, 
+			const T& _value ) {
+    if ( _r >= numOfRows() ) {
+      std::ostrstream msg;
+      msg << "ERROR in eo2dVector::setGene: row out of range. " 
+	  << "It should be <" << numOfRows() << '\0' << std::endl;
+      throw out_of_range( msg.str() );
+    }
+    if ( _c >= numOfCols() ) {
+      std::ostrstream msg;
+      msg << "ERROR in eo2dVector::setGene: column out of range. " 
+	  << "It should be <" << numOfCols() << '\0' << std::endl;
+      throw out_of_range( msg.str() );
+    }
+    (*this)[_r][_c]=_value;
+  };
+  
+  
+  
+  /** Inserts a row, moving the rest to the bottom. 
+   * If _r = numOfRows(), it insert it at the end.
+   * Obviously, changes number of rows. 
+   @param _r Position where the new row will be inserted.
+   @param _val Vector containing the new values to be inserted.
+   @std::exception invalid_argument If _val has not numOfCols() components.
+   @std::exception out_of_range If _r is greater than numOfRows()
+  */
+  virtual void insertRow( const unsigned _r, 
+			  const std::vector& _val ) {
+    // Test errors.
+    if ( _r > numOfRows() ) {
+      std::ostrstream msg;
+      msg << "ERROR in eo2dVector::insertRow: row out of range. " 
+	  << "It should be <=" << numOfRows() << '\0' << std::endl;
+      throw out_of_range( msg.str() );
+    }    
+    if ( _val.size() != numOfCols() ) {
+      std::ostrstream msg;
+      msg << "ERROR in eo2dVector::insertRow: "
+	  << "Incorrect number of values to be added. " 
+	  << "It should be ==" << numOfCols() << '\0' << std::endl;
+      throw invalid_argument( msg.str() );
+    }
+    
+    // Insert the row.
+    std::vector< std::vector >::iterator ite = begin()+_r;
+    insert( ite, _val );
+  };
+  
+  /** Eliminates the row at position _r; all the other genes will
+      be shifted up.
+      @param _r Number of he row to be deleted.
+      @std::exception out_of_range if _r >=numOfRows()
+  */
+  virtual void deleteRow( const unsigned _r ) {
+    // Test error.
+    if ( _r >= numOfRows() ) {
+      std::ostrstream msg;
+      msg << "ERROR in eo2dVector::deleteRow: "
+	  << "Row out of range. "
+	  << "It should be <" << numOfRows() << '\0' << std::endl;
+      throw out_of_range( msg.str() );
+    }    
+    // Delete row.
+    std::vector< std::vector >::iterator ite = this->begin()+_r;
+    this->erase( ite );
+  };
+  
+  /** Inserts a column, moving the rest to the right. 
+   * If _c = numOfCols(), it insert it at the end.
+   * Obviously, changes number of cols. 
+   @param _r Position where the new column will be inserted.
+   @param _val Vector containing the new values to be inserted.
+   @std::exception invalid_argument if _val has not numOfRows() components.
+  */
+  virtual void insertCol( const unsigned _c, 
+			  const std::vector& _val ) {
+    // Test errors.
+    if ( _c > numOfCols() ) {
+      std::ostrstream msg;
+      msg << "ERROR in eo2dVector::insertCol: "
+	  << "Column out of range. "
+	  << "It should be >=" << numOfCols() << '\0' << std::endl;
+      throw out_of_range( msg.str() );
+    }    
+    if ( _val.size() != numOfRows() ) {
+      std::ostrstream msg;
+      msg << "ERROR in eo2dVector::insertCol: "
+	  << "Incorrect number of values to be added. "
+	  << "It should be ==" << numOfRows() << '\0' << std::endl;
+      throw invalid_argument( msg.str() );
+    }
+    
+    // Insert column.
+    for( unsigned r=0; r >::iterator it1 = begin()+r;
+      std::vector::iterator it2 = (*it1).begin()+_c;
+      (*it1).insert( it2, _val[r] );
+    };
+  }
+  
+  /** Eliminates the column at position _c; all the other columns will
+      be shifted left.
+      @param _c Number of he column to be deleted.
+      @std::exception out_of_range if _c >=numOfCols()
+  */
+  virtual void deleteCol( const unsigned _c ) {
+    // Test error.
+    if ( _c >= numOfCols() ) {
+      std::ostrstream msg;
+      msg << "ERROR in eo2dVector::deleteCol: "
+	  << "Column out of range. "
+	  << "It should be <" << numOfCols() << '\0' << std::endl;
+      throw out_of_range( msg.str() );
+    }    
+    // Delete columns.
+    for( unsigned r=0; r >::iterator it1 = begin()+r;
+      std::vector::iterator it2 = (*it1).begin()+_c;
+      (*it1).erase( it2 );
+    }
+  };
+  
+  /// Returns the number of rows in the eo2d
+  virtual unsigned numOfRows() const {
+    return size();
+  };
+  
+  /// Returns the number of columns in the eo2d
+  virtual unsigned numOfCols() const {
+    return begin()->size();
+  };
+  
+  
+  /** @name Methods from eoObject
+      readFrom and printOn are directly inherited from eo1d
+  */
+  //@{
+  /** Inherited from eoObject 
+      @see eoObject
+  */
+  std::string className() const {return "eo2dVector";};
+  //@}
+  
+};
+
+
+//____________________________ Some method implementation ____________________
+
+// Ctors_______________________________________________________________________
+//_____________________________________________________________________________
+template 
+eo2dVector::eo2dVector( const unsigned _rows, 
+				    const unsigned _cols, 
+				    eoRnd& _rnd )
+  : eo2d(), std::vector< std::vector >( _rows, std::vector( _cols, T() ) ){ 
+  for ( std::vector< std::vector >::iterator i = begin(); i != end(); ++i ) {
+    for( std::vector::iterator j=(*i).begin(); j!= (*i).end(); ++j ) {
+      *j = _rnd();
+    }
+  }
+};
+
+//_____________________________________________________________________________
+/*template 
+eoVector::eoVector( std::istream& _is)
+  : eo1d(), std::vector( ){ 
+  while (_is ) {
+    T tmp;
+    _is >> tmp;
+    push_back( tmp );
+  }
+
+};
+*/
+
+//_____________________________________________________________________________
+template 
+std::ostream& operator<<( std::ostream& _os, const eo2dVector& _eo) {
+  for( unsigned i=0; i<_eo.numOfRows(); ++i ) {
+    for( unsigned j=0; j<_eo.numOfCols(); ++j ) {
+      _os << _eo.getGene( i,j ) << " ";
+    }
+    _os << std::endl;
+  }
+  return _os;
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoAtomBitFlip.h b/trunk/paradiseo-eo/src/obsolete/eoAtomBitFlip.h
new file mode 100644
index 000000000..be1a1be5f
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoAtomBitFlip.h
@@ -0,0 +1,58 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoAtomBitFlip.h
+//   Increments or decrements by one a single element
+// (c) GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+#ifndef _EOATOMBITFLIP_H
+#define _EOATOMBITFLIP_H
+
+/** Flips a single bit
+*/
+template 
+class eoAtomBitFlip: public eoAtomMutator {
+public:
+
+  /// 
+  eoAtomBitFlip() {};
+  
+  ///
+  virtual ~eoAtomBitFlip() {};
+  
+  ///
+  virtual void operator()( T& _val ) const {
+    _val = !val;
+  }
+  
+  /** @name Methods from eoObject
+  */  
+  //@{
+  /** Inherited from eoObject 
+      @see eoObject
+  */
+  std::string className() const {return "eoAtomBitFlip";};
+  //@}
+
+};
+
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoAtomCreep.h b/trunk/paradiseo-eo/src/obsolete/eoAtomCreep.h
new file mode 100644
index 000000000..8c293208a
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoAtomCreep.h
@@ -0,0 +1,66 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoAtomCreep.h
+//   Increments or decrements by one a single element
+// (c) GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+#ifndef _EOATOMCREEP_H
+#define _EOATOMCREEP_H
+
+#include 
+#include 
+
+/** With uniform probability, decrements or increments by one the value.
+    The value type must admit post increment and decrement.
+*/
+template 
+class eoAtomCreep: public eoAtomMutator {
+public:
+
+  /// 
+  eoAtomCreep() {};
+  
+  ///
+  virtual ~eoAtomCreep() {};
+  
+  ///
+  virtual void operator()( T& _val ) const {
+    if ( rng.flip( 0.5 ) ) {
+      _val++;
+    } else {
+      _val--;
+    }
+  }
+  
+  /** @name Methods from eoObject
+  */  
+  //@{
+  /** Inherited from eoObject 
+      @see eoObject
+  */
+  virtual std::string className() const {return "eoAtomCreep";};
+  //@}
+
+};
+
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoAtomRandom.h b/trunk/paradiseo-eo/src/obsolete/eoAtomRandom.h
new file mode 100644
index 000000000..1cc846ee0
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoAtomRandom.h
@@ -0,0 +1,64 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+-----------------------------------------------------------------------------
+ eoAtomRandom.h
+   Increments or decrements by one a single element
+ (c) GeNeura Team, 1998
+ 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _EOATOMRANDOM_H
+#define _EOATOMRANDOM_H
+
+#include 
+
+/** Modifies using a random number generator, that is entered in the ctor.
+    The RNG must return positive or negative numbers, whatever.
+*/
+template 
+class eoAtomRandom: public eoAtomMutator {
+public:
+
+  /// 
+  eoAtomRandom( eoRnd& _rng): rnd( _rng ) {};
+  
+  ///
+  virtual ~eoAtomRandom() {};
+  
+  /// Adds the value generated by the RNG to the former value
+  virtual void operator()( T& _val ) const {
+    _val += rnd();
+  }
+  
+  /** @name Methods from eoObject
+  */  
+  //@{
+  /** Inherited from eoObject 
+      @see eoObject
+  */
+  std::string className() const {return "eoAtomRandom";};
+  //@}
+
+private:
+  eoRnd& rnd;
+
+};
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/obsolete/eoBackInserter.h b/trunk/paradiseo-eo/src/obsolete/eoBackInserter.h
new file mode 100644
index 000000000..24bdad380
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoBackInserter.h
@@ -0,0 +1,56 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+  -----------------------------------------------------------------------------
+  eoInserter.h
+    Abstract population insertion operator, which is used by the eoGeneralOps
+    to insert the results in the (intermediate) population. This file also
+    contains the definitions of a derived classes that implements a back inserter,
+    probably the only efficient inserter for populations of type std::vector.
+
+ (c) Maarten Keijzer (mkeijzer@mad.scientist.com) and GeNeura Team, 1999, 2000
+ 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+
+#ifndef eoBackInserter_h
+#define eoBackInserter_h
+
+#include 
+
+/**
+\ingroup inserters
+ * eoBackInserter: Interface class that enables an operator to insert
+    new individuals at the back of the new population.
+*/
+template 
+class eoBackInserter : public eoPopInserter 
+{
+    public :
+
+    eoBackInserter(void) : eoPopInserter() {}
+        
+    eoInserter& operator()(const EOT& _eot)
+    {
+        pop().push_back(_eot);
+        return *this;
+    }
+
+    std::string className(void) const { return "eoBackInserter"; }
+
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/obsolete/eoBin.h b/trunk/paradiseo-eo/src/obsolete/eoBin.h
new file mode 100644
index 000000000..86dc8e7a9
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoBin.h
@@ -0,0 +1,89 @@
+/*
+   eoBin.h
+   (c) GeNeura Team 1998
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+*/
+
+#ifndef eoBin_h
+#define eoBin_h
+
+//-----------------------------------------------------------------------------
+
+#include     // std::ostream, std::istream
+#include   // bind2nd
+#include       // std::string
+
+#include 
+
+/**
+\defgroup bitstring
+
+  Various functions for a bitstring representation
+*/
+
+/** eoBin: implementation of binary chromosome.                               
+\class eoBin eoBin.h ga/eoBin.h
+\ingroup bitstring
+  * based on STL's bit_std::vector (std::vector).                                 
+*/
+template  class eoBin: public eoFixedLength
+{
+ public:
+
+  /**
+   * (Default) Constructor.
+   * @param size Size of the binary std::string.
+   */
+  eoBin(unsigned size = 0, bool value = false): 
+    eoVector(size, value) {}
+      
+  /// My class name.
+  std::string className() const 
+    { 
+      return "eoBin"; 
+    }
+  
+  /**
+   * To print me on a stream.
+   * @param os The std::ostream.
+   */
+  void printOn(std::ostream& os) const
+    {
+      copy(begin(), end(), std::ostream_iterator(os));
+    }
+  
+  /**
+   * To read me from a stream.
+   * @param is The std::istream.
+   */
+  void readFrom(std::istream& is)
+    {
+      std::string bits;
+      is >> bits;
+      if (is)
+	{
+	  resize(bits.size());
+	  transform(bits.begin(), bits.end(), begin(), 
+		    bind2nd(equal_to(), '1'));
+	}
+    }
+};
+
+//-----------------------------------------------------------------------------
+
+#endif eoBin_h
diff --git a/trunk/paradiseo-eo/src/obsolete/eoBreeder.h b/trunk/paradiseo-eo/src/obsolete/eoBreeder.h
new file mode 100644
index 000000000..7d8dd9bca
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoBreeder.h
@@ -0,0 +1,116 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoBreeder.h
+//   Takes two populations and mixes them
+// (c) GeNeura Team, 1998
+/* 
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+   Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoBreeder_h
+#define eoBreeder_h
+
+//-----------------------------------------------------------------------------
+
+#include           // std::vector
+#include 
+#include           // eoOp, eoMonOp, eoBinOp
+#include          // eoPop
+#include   // eoOpSelector
+
+#include 
+
+#include 
+#include 
+
+using namespace std;
+
+/*****************************************************************************
+ * eoBreeder: transforms a population using genetic operators.               *
+ * For every operator there is a rated to be applyed.                        *
+ *****************************************************************************/
+
+template class eoBreeder: public eoTransform
+//eoUnaryFunctor&>
+{
+ public:
+  /// Default constructor.
+  eoBreeder( eoOpSelector& _opSel): opSel( _opSel ) {}
+  
+  /// Destructor.
+  virtual ~eoBreeder() {}
+
+  /**
+   * Transforms a population.
+   * @param pop The population to be transformed.
+   */
+  void operator()(eoPop& pop) 
+    {
+      size_t orgsize = pop.size();
+
+      for (unsigned i = 0; i < pop.size(); i++) 
+      {
+	     eoOp* op = opSel.Op();
+	switch (op->getType()) 
+    {
+    case eoOp::unary:
+	  {
+	    eoMonOp* monop = static_cast* >(op);
+	    (*monop)( pop[i] );
+	    break;
+	  }
+	case eoOp::binary:
+	  {
+	    eoBinOp* binop = static_cast* >(op);
+	    (*binop)(pop[i], pop[ rng.random(pop.size()) ] );
+	    break;
+	  }
+	case eoOp::quadratic:
+	  {
+	    eoQuadraticOp* Qop = static_cast* >(op);
+	    
+	    (*Qop)(pop[i], pop[ rng.random(pop.size()) ] );
+	    break;
+      }
+    case eoOp::general :
+      {
+        eoGeneralOp* Gop = static_cast* >(op);
+
+        eoRandomIndiSelector selector;
+        eoBackInserter   inserter;
+
+        (*Gop)(selector.bind(pop, orgsize).bias(i), inserter.bind(pop));
+	    break;
+	  }
+	}
+      }
+    };
+  
+  /// The class name.
+  std::string className() const { return "eoBreeder"; }
+  
+ private:
+  eoOpSelector& opSel;
+  
+};
+
+//-----------------------------------------------------------------------------
+
+#endif eoBreeder_h
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoCopyElite.h b/trunk/paradiseo-eo/src/obsolete/eoCopyElite.h
new file mode 100644
index 000000000..19dafcff9
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoCopyElite.h
@@ -0,0 +1,110 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoCopyElite.h
+//   Base class for elitist-merging classes
+// (c) GeNeura Team, 1998
+/* 
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+   Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoCopyElite_h
+#define eoCopyElite_h
+
+//-----------------------------------------------------------------------------
+
+// EO includes
+#include      // eoPop
+#include   // eoCopyElite
+
+/**
+ * eoCopyElite: Base class for elitist replacement algorithms. 
+ * Merges the old population (first argument), with the new generation
+ *
+ * Its signature is exactly
+ * that of the selection base eoSelect, but its purpose is to merge the 
+ * two populations into one (the second argument).
+ * Note that the algorithms assume that the second argument denotes the 
+ * next generation.
+*/
+
+template class eoCopyElite: public eoBinaryFunctor&, eoPop&>
+{};
+
+/**
+Straightforward elitism class, specify the number of individuals to copy
+into new geneneration
+*/
+template  class eoElitism : public eoCopyElite
+{
+    public :
+        eoElitism(unsigned _howmany) : howmany(_howmany) {}
+
+        void operator()(const eoPop& _pop, eoPop& offspring)
+        {
+            if (howmany == 0)
+                return;
+
+            if (howmany > _pop.size())
+                throw logical_error("Elite larger than population");
+
+            std::vector result;
+            _pop.nth_element(howmany, result);
+
+            for (int i = 0; i < result.size(); ++i)
+            {
+                offspring.push_back(*result[i]);
+            }
+        }
+
+    private :
+        unsigned howmany;
+};
+
+/**
+No elite
+*/
+template  class eoNoElitism : public eoElitism
+{
+    public :
+        eoNoElitism() : eoElitism(0) {}
+}
+
+/**
+Very elitist class, copies entire population into next gen
+*/
+template  class eoPlus : public eoCopyElite
+{
+    public :
+        void operator()(const eoPop& _pop, eoPop& offspring)
+        {
+            offspring.reserve(offspring.size() + _pop.size());
+
+            for (int i = 0; i < _pop.size(); ++i)
+            {
+                offspring.push_back(*result[i]);
+            }
+        }
+
+    private :
+        unsigned howmany;
+};
+
+//-----------------------------------------------------------------------------
+
+#endif 
diff --git a/trunk/paradiseo-eo/src/obsolete/eoDEA.h b/trunk/paradiseo-eo/src/obsolete/eoDEA.h
new file mode 100644
index 000000000..bb717ae1b
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoDEA.h
@@ -0,0 +1,46 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoDEA.h
+// (c) Marc Schoenauer, Maarten Keijzer, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoDEA_h
+#define _eoDEA_h
+
+//-----------------------------------------------------------------------------
+
+#include 
+
+/** eoDEA: Distribution Evolution Algorithm within EO
+ *  
+ *  The abstract class for algorithms that evolve a probability distribution 
+ *  on the spaces of populations rather than a population
+ *
+ * It IS NOT an eoAlgo, as it evolves a distribution, not a population
+*/
+
+template class eoDEA: public eoUF&, void>
+{
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoDetTournament.h b/trunk/paradiseo-eo/src/obsolete/eoDetTournament.h
new file mode 100644
index 000000000..2bd15b9d3
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoDetTournament.h
@@ -0,0 +1,69 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoDetTournament.h
+// (c) GeNeura Team, 1998 - EEAAX 1999
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoDetTournament_h
+#define eoDetTournament_h
+
+//-----------------------------------------------------------------------------
+
+#include   // 
+#include      // accumulate
+
+#include 
+#include 
+#include 
+
+//-----------------------------------------------------------------------------
+/** eoDetTournament: a selection method that selects ONE individual by
+ deterministic tournament 
+ -MS- 24/10/99 */
+//-----------------------------------------------------------------------------
+
+template  class eoDetTournament: public eoSelectOne
+{
+ public:
+  /// (Default) Constructor.
+  eoDetTournament(unsigned _Tsize = 2 ):eoSelectOne(), Tsize(_Tsize) {
+    // consistency check
+    if (Tsize < 2) {
+      std::cout << "Warning, Tournament size should be >= 2\nAdjusted\n";
+      Tsize = 2;
+    }
+  }
+  
+  /// Perform deterministic tournament
+  virtual const EOT& operator()(const eoPop& pop) 
+  {
+    return deterministic_tournament(pop, Tsize);
+  }
+  
+ private:
+  unsigned Tsize;
+};
+
+//-----------------------------------------------------------------------------
+
+#endif eoDetTournament_h
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoDetTournamentIndiSelector.h b/trunk/paradiseo-eo/src/obsolete/eoDetTournamentIndiSelector.h
new file mode 100644
index 000000000..75d36c219
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoDetTournamentIndiSelector.h
@@ -0,0 +1,58 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+  -----------------------------------------------------------------------------
+  eoDetTournamentIndiSelector.h
+
+ (c) Maarten Keijzer (mkeijzer@mad.scientist.com) and GeNeura Team, 1999, 2000
+ 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+
+#ifndef eoDetTournamentIndiSelector_h
+#define eoDetTournamentIndiSelector_h
+
+#include "eoIndiSelector.h"
+#include "utils/selectors.h"
+
+
+/**
+\ingroup selectors
+  * eoDetTournamentIndiSelector: selects children through a deterministic_tournament
+*/
+template 
+class eoDetTournamentIndiSelector : public eoPopIndiSelector
+{
+    public :
+
+    eoDetTournamentIndiSelector(int _tournamentSize) 
+            : eoPopIndiSelector(),
+              tournamentSize(_tournamentSize) 
+              {}
+    
+    virtual ~eoDetTournamentIndiSelector(void) {}
+
+    const EOT& do_select(void) 
+    {
+        return *deterministic_tournament(begin(), end(), tournamentSize);
+    }
+
+    private :
+
+        int tournamentSize;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/obsolete/eoDetTournamentInserter.h b/trunk/paradiseo-eo/src/obsolete/eoDetTournamentInserter.h
new file mode 100644
index 000000000..9077aece6
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoDetTournamentInserter.h
@@ -0,0 +1,70 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+  -----------------------------------------------------------------------------
+  eoDetTournamentInserter.h
+    Concrete steady state inserter. It is initialized with a population and 
+    inserts individuals in the population based on an inverse deterministic 
+    tournament
+
+ (c) Maarten Keijzer (mkeijzer@mad.scientist.com) and GeNeura Team, 1999, 2000
+ 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+
+#ifndef eoDetTournamentInserter_h
+#define eoDetTournamentInserter_h
+
+
+#include 
+#include 
+
+/**
+ * eoDetTournamentInserter: Uses an inverse deterministic tournament to figure
+ * out who gets overridden by the new individual. It resets the fitness of the
+ * individual.
+*/
+template 
+class eoDetTournamentInserter : public eoSteadyStateInserter 
+{
+public :
+  
+  eoDetTournamentInserter(eoEvalFunc& _eval, unsigned _t_size): 
+    eoSteadyStateInserter(_eval), 
+    t_size(_t_size)
+  {
+    if (t_size < 2)
+      { // warning, error?
+	t_size = 2;
+      }
+  }
+  
+  eoInserter& operator()(const EOT& _eot)
+  {
+    EOT& eo = inverse_deterministic_tournament(pop(), t_size);
+    eo = _eot; // overwrite loser of tournament
+    
+    eval(eo); // Evaluate after insert
+    return *this;
+  }
+  
+  std::string className(void) const { return "eoDetTournamentInserter"; }
+  
+private :
+  unsigned t_size;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/obsolete/eoDistance.h b/trunk/paradiseo-eo/src/obsolete/eoDistance.h
new file mode 100644
index 000000000..5f3c333e6
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoDistance.h
@@ -0,0 +1,63 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+    -----------------------------------------------------------------------------
+    eoObject.h
+      This is the base class for most objects in EO. It basically defines an interf
+    face for giving names to classes.
+
+    (c) GeNeura Team, 1998, 1999, 2000
+ 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+*/
+//-----------------------------------------------------------------------------
+
+#ifndef EODISTANCE_H
+#define EODISTANCE_H
+
+//-----------------------------------------------------------------------------
+
+using namespace std;
+
+//-----------------------------------------------------------------------------
+// eoDistance
+//-----------------------------------------------------------------------------
+/** Defines an interface for measuring distances between evolving objects */
+template 
+class eoDistance {
+ public:
+  
+  /// Default Constructor.
+  eoDistance() {}
+
+  /// Copy constructor.
+  eoDistance( const eoDistance& ) {}
+
+  /// Virtual dtor. They are needed in virtual class hierarchies.
+  virtual ~eoDistance() {}
+  
+
+  /** Return the distance from the object with this interface to other
+      object of the same type.
+  */
+  virtual double distance( const EOT& ) const = 0;
+
+  /// Returns classname
+  virtual std::string className() const { return "eoDistance"; }
+
+};
+
+#endif EOOBJECT_H
diff --git a/trunk/paradiseo-eo/src/obsolete/eoDup.h b/trunk/paradiseo-eo/src/obsolete/eoDup.h
new file mode 100644
index 000000000..67e4a8639
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoDup.h
@@ -0,0 +1,70 @@
+// eoDup.h
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoKill.h
+// (c) GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _EODUP_h
+#define _EODUP_h
+
+#include 
+
+#include 
+
+/// Dup or duplicate: duplicates a gene in a chromosome
+template 
+class eoDup: public eoMonOp >  {
+public:
+	///
+	eoDup( )
+		: eoMonOp< EOT >( ){};
+
+	/// needed virtual dtor
+	virtual ~eoDup() {};
+
+	///
+	virtual void operator()(eoVariableLength& _eo ) const 
+    {
+		unsigned pos = rng.random(_eo.size());
+        eoVariableLength::iterator it = begin();
+
+        while (pos--) {++it;}
+
+        _eo.insert(it, 1, *it);
+	
+        _eo.invalidate();
+    }
+
+
+	/** @name Methods from eoObject
+	readFrom and printOn are directly inherited from eoOp
+	*/
+	//@{
+	/** Inherited from eoObject 
+		  @see eoObject
+	*/
+	virtual std::string className() const {return "eoDup";};
+    //@}
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoES.h b/trunk/paradiseo-eo/src/obsolete/eoES.h
new file mode 100644
index 000000000..9f4051f85
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoES.h
@@ -0,0 +1,164 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoESChrom.h
+// (c) GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+
+#ifndef _eoESCHROM_H
+#define _eoESCHROM_H
+
+// STL libraries
+#include 		// For std::vector<>
+#include 
+#include 
+#include 		// for std::ostream
+
+// EO includes
+#include 
+
+/**@name Chromosomes for evolution strategies
+Each chromosome in an evolution strategies is composed of a std::vector of floating point
+values plus a std::vector of sigmas, that are added to them during mutation
+*/ 
+//@{
+
+/**
+\class eoESValue
+
+*/
+template 
+struct eoESValue
+{
+    T value;
+    
+    /**
+        The gene has a mutate member because this particular gaussian mutation 
+        is paradigmatic for an evolution strategy. 
+    */
+    void mutate(double sigma, T minimum = T(), T maximum = T())
+    {
+        value += rng.normal(0.0, sigma);
+
+        if (minimum > value)
+            value = minimum;
+        if (value > maximum)
+            value = maximum;
+    }
+};
+
+/** 
+\class eoESGene eoESGene.h es/eoESGene.h
+Each gene in an Evolution Strategies is composed of a value plus an standard
+deviation, sigma, used for mutation*/
+template 
+struct eoESGene : public eoESValue
+{
+    double sigma;
+
+	eoESGene( double _val = 0, double _sigma = 1.0 ): eoESValue( _val ), sigma( _sigma ) {};
+
+    /**
+        The gene has a mutate member because the sigma member implies
+        that the updating routine should use a normal distribution
+    */
+    void mutate(T minimum, T maximum)
+    {
+        mutate(sigma, minimum, maximum);
+    }
+};
+
+/// Tricky operator to avoid errors in some VC++ systems, namely VC 5.0 SP3
+bool operator < ( eoESGene _e1, eoESGene _e2 ) {
+	return _e1.val < _e2.val;
+}
+
+/// Tricky operator to avoid errors in some VC++ systems
+bool operator == ( eoESGene _e1, eoESGene _e2 ) {
+	return ( _e1.val == _e2.val ) && ( _e1.sigma == _e2.sigma ) ;
+}
+
+///
+std::ostream & operator << ( std::ostream& _s, const eoESGene& _e ) {
+	_s << _e.val << ", " << _e.sigma << " | ";
+	return _s;
+}
+
+/// Dummy >>
+std::istream & operator >> ( std::istream& _s, const eoESGene& _e ) {
+	_s >> _e.val;
+	_s >> _e.sigma;
+	return _s;
+}
+
+
+/** Basic chromosome for evolution strategies (ES), as defined by Rechenberg and
+Schwefel. Each chromosomes is composed of "genes"; each one of then is an eoESGene
+@see eoESGene
+*/
+template 
+class eoESChrom: public eoVector {	
+public:
+	/// Basic ctor
+	eoESChrom( ):eoVector() {};
+
+	/** Ctor using a couple of random number generators
+	@param _size Lineal length of the object
+	@param _rnd a random number generator, which returns a random value each time it´s called.
+	@param _rndS another one, for the sigma
+	*/
+	eoESChrom( unsigned _size, eoRnd& _rnd, eoRnd& _rndS  )
+		: eoVector( _size ){ 
+		for ( iterator i = begin(); i != end(); i ++ ) {
+			i->val = _rnd();
+			i->sigma = _rndS();
+		}
+	};
+
+	/// Copy ctor
+	eoESChrom( const eoESChrom& _eoes): eoVector( _eoes ) {};
+
+	/// Assignment operator
+	const eoESChrom& operator =( const eoESChrom & _eoes ) {
+		if ( this != &_eoes ){
+			eoVector::operator=( _eoes );
+		}
+		return *this;
+	}
+
+	///
+	~eoESChrom() {};
+
+	/** @name Methods from eoObject
+	readFrom and printOn are directly inherited from eo1d
+	*/
+	//@{
+	/** Inherited from eoObject 
+		  @see eoObject
+	*/
+	std::string className() const {return "eoESChrom";};
+    //@}
+
+};
+
+//@}
+#endif
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoESChrom.h b/trunk/paradiseo-eo/src/obsolete/eoESChrom.h
new file mode 100644
index 000000000..1ad0bcf41
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoESChrom.h
@@ -0,0 +1,164 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoESChrom.h
+// (c) GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+
+#ifndef _eoESCHROM_H
+#define _eoESCHROM_H
+
+// STL libraries
+#include 		// For std::vector<>
+#include 
+#include 
+#include 		// for std::ostream
+
+// EO includes
+#include 
+
+/**@name Chromosomes for evolution strategies
+Each chromosome in an evolution strategies is composed of a std::vector of floating point
+values plus a std::vector of sigmas, that are added to them during mutation
+*/ 
+//@{
+
+/**
+\class eoESValue
+
+*/
+template 
+struct eoESValue
+{
+    T value;
+    
+    /**
+        The gene has a mutate member because this particular gaussian mutation 
+        is paradigmatic for an evolution strategy. 
+    */
+    void mutate(double sigma, T minimum, T maximum)
+    {
+        value += rng.normal(0.0, sigma);
+
+        if (minimum > value)
+            value = minimum;
+        if (value > maximum)
+            value = maximum;
+    }
+};
+
+/** 
+\class eoESGene eoESGene.h es/eoESGene.h
+Each gene in an Evolution Strategies is composed of a value plus an standard
+deviation, sigma, used for mutation*/
+template 
+struct eoESGene : public eoESValue
+{
+    double sigma;
+
+	eoESGene( double _val = 0, double _sigma = 1.0 ): eoESValue( _val ), sigma( _sigma ) {};
+
+    /**
+        The gene has a mutate member because the sigma member implies
+        that the updating routine should use a normal distribution
+    */
+    void mutate(T minimum, T maximum)
+    {
+        mutate(sigma, minimum, maximum);
+    }
+};
+
+/// Tricky operator to avoid errors in some VC++ systems, namely VC 5.0 SP3
+bool operator < ( eoESGene _e1, eoESGene _e2 ) {
+	return _e1.val < _e2.val;
+}
+
+/// Tricky operator to avoid errors in some VC++ systems
+bool operator == ( eoESGene _e1, eoESGene _e2 ) {
+	return ( _e1.val == _e2.val ) && ( _e1.sigma == _e2.sigma ) ;
+}
+
+///
+std::ostream & operator << ( std::ostream& _s, const eoESGene& _e ) {
+	_s << _e.val << ", " << _e.sigma << " | ";
+	return _s;
+}
+
+/// Dummy >>
+std::istream & operator >> ( std::istream& _s, const eoESGene& _e ) {
+	_s >> _e.val;
+	_s >> _e.sigma;
+	return _s;
+}
+
+
+/** Basic chromosome for evolution strategies (ES), as defined by Rechenberg and
+Schwefel. Each chromosomes is composed of "genes"; each one of then is an eoESGene
+@see eoESGene
+*/
+template 
+class eoESChrom: public eoVector {	
+public:
+	/// Basic ctor
+	eoESChrom( ):eoVector() {};
+
+	/** Ctor using a couple of random number generators
+	@param _size Lineal length of the object
+	@param _rnd a random number generator, which returns a random value each time it´s called.
+	@param _rndS another one, for the sigma
+	*/
+	eoESChrom( unsigned _size, eoRnd& _rnd, eoRnd& _rndS  )
+		: eoVector( _size ){ 
+		for ( iterator i = begin(); i != end(); i ++ ) {
+			i->val = _rnd();
+			i->sigma = _rndS();
+		}
+	};
+
+	/// Copy ctor
+	eoESChrom( const eoESChrom& _eoes): eoVector( _eoes ) {};
+
+	/// Assignment operator
+	const eoESChrom& operator =( const eoESChrom & _eoes ) {
+		if ( this != &_eoes ){
+			eoVector::operator=( _eoes );
+		}
+		return *this;
+	}
+
+	///
+	~eoESChrom() {};
+
+	/** @name Methods from eoObject
+	readFrom and printOn are directly inherited from eo1d
+	*/
+	//@{
+	/** Inherited from eoObject 
+		  @see eoObject
+	*/
+	std::string className() const {return "eoESChrom";};
+    //@}
+
+};
+
+//@}
+#endif
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoESFullChrom.h b/trunk/paradiseo-eo/src/obsolete/eoESFullChrom.h
new file mode 100644
index 000000000..e00914b5d
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoESFullChrom.h
@@ -0,0 +1,267 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoESInd.h
+// (c) GeNeura Team, 1998 - EEAAX 1999
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _EOESFULLCHROM_H
+#define _EOESFULLCHROM_H
+
+// STL libraries
+#include 		// For std::vector<>
+#include 
+#include 
+#include 		// for std::ostream
+
+// EO includes
+#include 
+#include 
+/**@name Chromosomes for evolution strategies
+Each chromosome in an evolution strategies is composed of a std::vector of floating point
+values plus a std::vector of sigmas, that are added to them during mutation and a std::vector of correlations
+*/ 
+//@{
+
+
+/**@name individuals for evolution strategies  -MS- 22/10/99
+Each individual in an evolution strategy is composed of 
+   a std::vector of floating point values 
+   a std::vector of std deviations
+   a std::vector of rotation angles (for correlated mutations)
+
+These individuals CANNOT BE IMPLEMENTED as std::vectors of anything 
+      at least in the case of correlated mutations
+*/ 
+//@{
+
+template 
+class eoESFullChrom  : public eoVector {	
+    public:
+/// constructor
+    eoESFullChrom(  unsigned _num_genes = 1, 
+	      unsigned _num_sigma = 1, unsigned _num_correl = 0,
+	      bool _verbose = false,  
+	      double _ObjMin = 0, double _ObjMax = 1, 
+	      double _StdDevInit = 0.3 ):
+    eoVector(_num_genes),
+    //    ObjVar( _num_genes ), now an eoVector
+    StdDev( _num_sigma ), 
+    CorCff( _num_correl ),
+    verbose( _verbose ),
+    ObjMin( _ObjMin ),
+    ObjMax(_ObjMax ),
+    StdDevInit( _StdDevInit ) 
+    { // check consistency
+    }
+  
+	
+  /* And now the useful constructor: from a parser (should be in the
+     factory, if such a thing exists one day for eoESFullChrom 
+   */
+  eoESFullChrom(eoParser & parser) : StdDev(0), CorCff(0) {
+    parser.AddTitle("Description of ES individuals");
+    int num_genes, num_sigma;
+    bool correlated_mutations;
+    try {
+      num_genes = parser.getInt("-Io", "--NbObjVar", "2", 
+				 "Number of Object Variables" );
+      num_sigma = parser.getInt("-Is", "--NbSigma", "1", 
+				 "Number of Standard Deviations" );
+      correlated_mutations = parser.getBool("-Ic", "--Correlated", 
+				  "Correlated mutation?" );
+      ObjMin = parser.getFloat("-Im", "--min", "0", 
+			      "Minimum value for object variables" );
+      ObjMax = parser.getFloat("-IM", "--max", "1", 
+			      "Maximum value for object variables" );
+      StdDevInit = parser.getFloat("-II", "--SigmaInit", "0.3", 
+			       "Initial value for std. dev. (scaled by range)" );
+      verbose = parser.getBool("-Iv", "--verbose",
+		"Verbose std::listing of ES individuals (mutation parameters");
+    }
+    catch (std::exception & e)
+      {
+	std::cout << e.what() << std::endl;
+	parser.printHelp();
+	exit(1);
+      }
+
+    // consistency tests
+    if (! num_sigma) {		   // no std dev??? EXCEPTION
+      throw invalid_argument( "No standard deviation: choose another representation please" );
+    }
+    if (num_sigma > num_genes) {
+      std::cout << "WARNING, Number of Standard Deviations > Number of Object Variables\nAdjusted!\n";
+      num_sigma = num_genes;
+      // modify the Param value - so .status is OK
+      std::ostrstream sloc;
+      sloc << num_genes;
+      parser.setParamValue("--NbSigma", sloc.str());
+    }
+    // adjust the sizes!!!
+    resize(num_genes);
+    if (num_sigma)
+      StdDev.resize(num_sigma);
+    if (correlated_mutations) {
+      if (num_sigma < num_genes) {
+	std::cout << "WARNING less Std Dev. than number of variables + Correlated mutations\n";
+	std::cout << "Though possible, this is a strange setting" << std::endl;
+      }
+      // nb of rotation angles: N*(N-1)/2 (in general!)
+      CorCff.resize ( (2*num_genes - num_sigma)*(num_sigma - 1) / 2 );
+    }
+  };
+
+
+  /// Operator =
+  const eoESFullChrom& operator = ( const eoESFullChrom& _eo ) {
+    if ( this  != &_eo ) {
+      // Change EO part
+      eoVector::operator = (_eo);
+      
+      // Change this part
+      //	      ObjVar = _eo.ObjVar;
+      StdDev = _eo.StdDev;
+      CorCff = _eo.CorCff;
+      verbose =  _eo.verbose;
+      ObjMin = _eo.ObjMin;
+      ObjMax = _eo.ObjMax;
+      StdDevInit = _eo.StdDevInit;
+    }
+    return *this;
+  }
+
+  /// destructor
+  virtual ~eoESFullChrom() {}
+  
+  /// 
+  double getStdDev( unsigned _i ) const {
+    if ( _i >= length() ) 
+      throw out_of_range( "out_of_range when reading StdDev");
+    return StdDev[ _i ];
+  }
+
+  ///
+  void setStdDev( unsigned _i, double _val ) {
+    if ( _i < length() ) {
+      StdDev[_i] = _val;
+    } else 
+      throw out_of_range( "out_of_range when writing StdDev");
+  }
+  
+  /// 
+  double getCorCff( unsigned _i ) const {
+    if ( _i >= length() ) 
+      throw out_of_range( "out_of_range when reading CorCff");
+    return CorCff[ _i ];
+  }
+
+  ///
+  void setCorCff( unsigned _i, double _val ) {
+    if ( _i < length() ) {
+      CorCff[_i] = _val;
+    } else 
+      throw out_of_range( "out_of_range when writing CorCff");
+  }
+  
+  ///
+  void insertGene( unsigned _i, double _val ) {
+      throw FixedLengthChromosome();
+  };
+  
+  ///
+  void deleteGene( unsigned _i ) {
+      throw FixedLengthChromosome();
+  };
+  
+  ///
+    unsigned length() const { return size();}/* formerly ObjVar.size() */
+    unsigned StdDevLength() const { return StdDev.size();}
+    unsigned CorCffLength() const { return CorCff.size();}
+
+
+  /** Print itself: inherited from eoObject implementation. 
+      Instance from base classes are processed in
+      base classes, so you don´t have to worry about, for instance, fitness.
+  @param _s the std::ostream in which things are written*/
+  virtual void printOn( std::ostream& _s ) const{
+      copy( begin(), end(), std::ostream_iterator( _s, " ") );
+      // The formatting instructinos shoudl be left to the caller
+      //      _s << "\n";       
+      if (verbose) {
+	  _s << "\n\tStd Dev. " ;
+	  copy( StdDev.begin(), StdDev.end(), std::ostream_iterator( _s, " ") );
+	  if (CorCff.size()) {
+	      _s << "\n\t";
+	      copy( CorCff.begin(), CorCff.end(), std::ostream_iterator( _s, " ") );
+	  }
+      }
+  };
+
+  /** This std::exception should be thrown when trying to insert or delete a gene
+  in a fixed length chromosome  
+  */
+  class FixedLengthChromosome : public std::exception {
+
+  public:
+    /**
+       * Constructor
+       */
+    FixedLengthChromosome()
+	: std::exception() { };
+
+    ~FixedLengthChromosome() {};
+  };
+  
+  // accessors
+  double getObjMin() const {return ObjMin;}
+  double getObjMax() const {return ObjMax;}
+  double getStdDevInit () const {return StdDevInit;}
+
+  /** Inherited from eoObject 
+      @see eoObject
+  */
+  virtual std::string className() const {return "eoESFullChrom";};
+
+private:
+    //	std::vector	    ObjVar;	/* object variable std::vector */
+// or shoudl the class be subclass of EOVector ???
+
+	std::vector	    StdDev;	/* standard deviation std::vector */
+	std::vector	    CorCff;	/* correlation coefficient std::vector */
+
+    bool verbose;		/* Print std deviations or not */
+
+  /** the range is used for mutation AND random initialization, 
+     * while the StdDevInit is used only for random initialization
+     * this in a little inconsistent!
+     */
+    double ObjMin, ObjMax;	/* Range for Object variables */
+    double StdDevInit;		/* Initial value of Standard Deviations */
+
+};
+
+
+
+
+#endif
+
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoESFullMut.h b/trunk/paradiseo-eo/src/obsolete/eoESFullMut.h
new file mode 100644
index 000000000..9d967c7af
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoESFullMut.h
@@ -0,0 +1,261 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+ 
+//-----------------------------------------------------------------------------
+// eoESMute.h : ES mutation
+// (c) Maarten Keijzer 2000 & GeNeura Team, 1998 for the EO part
+//     Th. Baeck 1994 and EEAAX 1999 for the ES part
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+ 
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+ 
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ 
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             marc.schoenauer@polytechnique.fr 
+                       http://eeaax.cmap.polytchnique.fr/
+ */
+//-----------------------------------------------------------------------------
+
+
+#ifndef _EOESMUT_H
+#define _EOESMUT_H
+
+#include 
+#include 
+#include 		// for exp
+
+#include 
+#include 
+#include 
+
+#ifndef M_PI
+#define M_PI 3.1415926535897932384626433832795
+#endif
+
+/** ES-style mutation in the large: Obviously, valid only for eoES*
+
+  It is currently valid for three types of ES chromosomes:
+
+  eoEsSimple:   only 1 std deviation
+  eoEsStdev:    as many standard deviations as object variables
+  eoEsFull:     The whole guacemole: correlations, stdevs and object variables
+
+  Each of these three variant has it's own operator() in eoEsMutate
+*/
+
+template 
+class eoESMutate: public eoMonOp< EOT > {
+public:
+
+    typedef EOT::Fitness FitT;
+
+    /** Initialization
+        parameters:
+
+        @param _init    proxy class for initializating the three parameters eoEsMutate needs
+        @param _bounds  the bounds for the objective variables
+    */
+    eoESMutate(eoESMutationInit& _init, eoESObjectiveBounds& _bounds) : bounds(_bounds)
+    {
+        unsigned size = bounds.chromSize();
+
+        if (eoEsInfo::single_stdev)
+        {
+            TauLcl = _init.TauLcl();
+            TauLcl /= sqrt((double) size);
+        }
+        else
+        {
+            TauLcl = _init.TauLcl();
+            TauGlb = _init.TauGlb();
+
+            // renormalization
+	        TauLcl /= sqrt( 2.0 * sqrt( (double)size ) );
+	        TauGlb /= sqrt( 2.0 * ( (double) size ) );
+	    
+            if (eoEsInfo::has_correlation) 
+            { // Correlated Mutations
+	            TauBeta = _init.TauBeta();
+	        }
+        }
+    }
+
+    /// needed virtual dtor
+    virtual ~eoESMutate() {};
+    
+  /** Inherited from eoObject 
+      @see eoObject
+  */
+  virtual std::string className() const {return "eoESMutate";};
+  
+  /**
+    Mutate eoEsSimple
+  */
+  virtual void operator()( eoEsSimple& _eo) const
+  {
+      _eo.stdev *= exp(TauLcl * rng.normal());	
+
+      if (_eo.stdev < eoEsInfo::stdev_eps)
+	        _eo.stdev = eoEsInfo::stdev_eps;
+      
+      // now apply to all
+
+      for (unsigned i = 0; i < _eo.size(); ++i)
+      {
+          _eo[i] += _eo.stdev * rng.normal();
+      }
+
+      keepInBounds(_eo);
+  }
+  
+  /// mutations - standard and correlated
+  //  ========= 
+  /*
+   *	Standard mutation of object variables and standard 	
+   *	deviations in ESs. 
+   *	If there are fewer different standard deviations available 
+   *	than the dimension of the objective function requires, the 
+   * 	last standard deviation is responsible for ALL remaining
+   *	object variables.
+   *	Schwefel 1977: Numerische Optimierung von Computer-Modellen
+   *	mittels der Evolutionsstrategie, pp. 165 ff.
+   */
+
+  virtual void operator()( eoESStdev& _eo ) const 
+  {
+    double global = exp(TauGlb * rng.normal());
+    for (unsigned i = 0; i < _eo.size(); i++) 
+      {
+	    double stdev = _eo.stdevs[i];
+	    stdev *= global * exp(TauLcl * rng.normal());	
+
+	    if (stdev < eoEsInfo::stdev_eps)
+	        stdev = eoEsInfo::stdev_eps;
+
+	    _eo.stdevs[i] = stdev; 
+	    _eo[i] += stdev * rng.normal();
+      }
+
+    keepInBounds(_eo);
+  }
+
+  /*
+   *	Correlated mutations in ESs, according to the following
+   *	sources:
+   *	H.-P. Schwefel: Internal Report of KFA Juelich, KFA-STE-IB-3/80
+   *	p. 43, 1980
+   *	G. Rudolph: Globale Optimierung mit parallelen Evolutions-
+   *	strategien, Diploma Thesis, University of Dortmund, 1990
+   */
+  
+  // Code from Thomas Baeck 
+  
+  virtual void operator()( eoEsFull & _eo ) const 
+  {
+
+    /*
+     *	First: mutate standard deviations (as above).
+     */
+    
+    double global = exp(TauGlb * rng.normal());
+    for (unsigned i = 0; i < _eo.size(); i++) 
+    {
+	    double stdev = _eo.stdevs[i];
+	    stdev *= global * exp(TauLcl * rng.normal());	
+
+	    if (stdev < eoEsInfo::stdev_eps)
+	        stdev = eoEsInfo::stdev_eps;
+
+	    _eo.stdevs[i] = stdev; 
+    }
+
+    
+    /*
+     *	Mutate rotation angles.
+     */
+    
+    for (i = 0; i < _eo.correlations.size(); i++) 
+    {
+      _eo.correlations[i] += TauBeta * rng.normal(); 
+      if ( fabs(_eo.correlations[i]) > M_PI ) 
+      {
+	    _eo.correlations[i] -= M_PI * (int) (_eo.correlations[i]/M_PI) ;
+      }
+    }
+    
+    /*
+     *	Perform correlated mutations.
+     */
+    unsigned i,k;
+
+    std::vector VarStp(_eo.size());
+    for (i = 0; i < _eo.size(); i++) 
+      VarStp[i] = _eo.stdevs[i] * rng.normal();
+
+    unsigned nq = _eo.correlations.size() - 1;
+
+    for (k = 0; k < _eo.size()-1; k++) 
+    {
+      n1 = _eo.size() - k - 1;
+      n2 = _eo.size() - 1;
+      
+      for (i = 0; i < k; i++) 
+      {
+	    d1 = VarStp[n1];
+	    d2 = VarStp[n2];
+	    S  = sin( _eo.correlations[nq] );
+	    C  = cos( _eo.correlations[nq] );
+	    VarStp[n2] = d1 * S + d2 * C;
+	    VarStp[n1] = d1 * C - d2 * S;
+	    n2--;
+	    nq--;
+      }
+    }
+    
+    for (i = 0; i < _eo.size(); i++) 
+      _eo[i] += VarStp[i];
+
+    keepInBounds(_eo);
+  }
+
+  void keepInBounds(EOT& _eo) const
+  {
+      for (unsigned i = 0; i < _eo.size(); ++i)
+      {
+          if (_eo[i] < bounds.minimum(i))
+              _eo[i] = bounds.minimum(i);
+          else if (_eo[i] > bounds.maximum(i))
+              _eo[i] = bounds.maximum(i);
+      }
+  }
+
+  private :
+  // the data 
+  //=========
+  double TauLcl;	/* Local factor for mutation of std deviations */
+  double TauGlb;	/* Global factor for mutation of std deviations */
+  double TauBeta;	/* Factor for mutation of correlation parameters  */
+
+  eoESObjectiveBounds& bounds;
+};
+
+/*
+ *	Correlated mutations in ESs, according to the following
+ *	sources:
+ *	H.-P. Schwefel: Internal Report of KFA Juelich, KFA-STE-IB-3/80
+ *	p. 43, 1980
+ *	G. Rudolph: Globale Optimierung mit parallelen Evolutions-
+ *	strategien, Diploma Thesis, University of Dortmund, 1990
+ */
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoEsObjectiveBounds.h b/trunk/paradiseo-eo/src/obsolete/eoEsObjectiveBounds.h
new file mode 100644
index 000000000..4a25aa30b
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoEsObjectiveBounds.h
@@ -0,0 +1,81 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoEsObjectiveBounds.h
+// (c) Maarten Keijzer 2000, GeNeura Team, 1998 - EEAAX 1999
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoEsObjectiveBounds_h
+#define _eoEsObjectiveBounds_h
+
+/**
+\defgroup EvolutionStrategies
+
+  Various classes for the initialization and mutation of real valued std::vectors.
+
+  Supports simple mutations and various more adaptable mutations, including
+  correlated mutations.
+
+*/
+
+
+/**
+\class eoEsObjectiveBounds eoEsObjectiveBounds.h es/eoEsObjectiveBounds.h
+\ingroup EvolutionStrategies
+
+    Defines the minima and maxima of the object variables. Needed by eoEsChromInit
+    and eoEsMutate
+
+    @see eoEsChromInit eoEsMutate
+*/
+class eoEsObjectiveBounds
+{
+    public :
+        
+        /** 
+        Objective bounds for a global minimum and maximum
+        */
+        eoEsObjectiveBounds(int _nGenes, double _min, double _max) : repMinimum(_nGenes), repMaximum(_nGenes)
+        {
+            std::fill(repMinimum.begin(), repMinimum.end(), _min);
+            std::fill(repMaximum.begin(), repMaximum.end(), _max);
+        }
+
+        /** 
+        Objective bounds for a per gene minimum and maximum
+        */
+        eoEsObjectiveBounds(const std::vector& _min, const std::vector& _max)
+            : repMinimum(_min), repMaximum(_max) {}
+
+        typedef double doubleype;
+
+        double minimum(size_t i) { return repMinimum[i]; }
+        double maximum(size_t i) { return repMaximum[i]; }
+
+        unsigned chromSize(void) const { return repMinimum.size(); }
+
+    private :
+        std::vector repMinimum;
+        std::vector repMaximum;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/obsolete/eoEvalFuncPtrCnt.h b/trunk/paradiseo-eo/src/obsolete/eoEvalFuncPtrCnt.h
new file mode 100644
index 000000000..ffa998590
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoEvalFuncPtrCnt.h
@@ -0,0 +1,62 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+-----------------------------------------------------------------------------
+    eoEvalFuncPtrCnt.h
+      Same as eoEvalFuncPtr, but counts the number of evaluations
+
+    (c) GeNeura Team, 2000
+ 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef EOEVALFUNCPTRCNT_H
+#define EOEVALFUNCPTRCNT_H
+
+#include 
+
+/** EOEvalFuncCntPtr: This class
+ * takes an existing function pointer and converts it into a evaluation
+ * function class. That way, old style C or C++ functions can be adapted to EO
+ * function classes.
+ */
+template< class EOT >
+struct eoEvalFuncPtrCnt: public eoEvalFuncPtr {
+
+  /** Applies the function to the chromosome and sets the fitness of the
+      Chrom. Thus, the evaluation function need not be worried about that.
+      @param _eval pointer to the evaluation function, takes a EOT as an
+                   argument and returns the fitness
+      @return the evaluated fitness for that object.
+  */
+  eoEvalFuncPtrCnt( EOFitT (* _eval)( const EOT& ) )
+    : eoEvalFuncPtr( _eval ), numOfEvaluations( 0 )  {};
+  
+  /// Effectively applies the evaluation function to an EO 
+  virtual void operator() ( EOT & _eo ) const {
+     eoEvalFuncPtr::operator()( _eo );
+    numOfEvaluations++;
+  };
+
+  ///
+  unsigned getNumOfEvaluations() const { return numOfEvaluations; };
+  
+private:
+  mutable unsigned numOfEvaluations;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/obsolete/eoEvolutionStrategy.h b/trunk/paradiseo-eo/src/obsolete/eoEvolutionStrategy.h
new file mode 100644
index 000000000..b863ae8a4
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoEvolutionStrategy.h
@@ -0,0 +1,101 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoEvolutionStrategy.h
+// (c) Maarten Keijzer 2000, GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoEvolutionStrategy_h
+#define _eoEvolutionStrategy_h
+
+//-----------------------------------------------------------------------------
+
+#include 
+#include 
+/** eoEvolutionStrategy:
+*/
+
+template 
+class eoEvolutionStrategy: public eoAlgo
+{
+ public:
+     struct plus_strategy{};
+     struct comma_strategy{};
+
+     eoEvolutionStrategy(
+         eoContinue& _continuator,
+         eoEvalFunc& _eval, 
+         eoGOpSelector&  _opSel,
+         float _lambdaRate,
+         comma_strategy)
+         :  selectPerc(randomSelect, _lambdaRate),
+            transform(_opSel),
+            easyEA(_continuator, _eval, selectPerc, transform, noElitism, truncate) 
+     {}
+
+     eoEvolutionStrategy(
+         eoContinue& _continuator,
+         eoEvalFunc& _eval, 
+         eoGOpSelector&  _opSel,
+         float _lambdaRate,
+         plus_strategy)
+         :  selectPerc(randomSelect, _lambdaRate),
+            transform(_opSel),
+            easyEA(_continuator, _eval, selectPerc, transform, plus, truncate) 
+     {}
+
+
+  /// Apply a few generation of evolution to the population.
+  virtual void operator()(eoPop& _pop) 
+  {
+      easyEA(_pop);
+  }
+  
+ private:
+
+     eoPlus    plus;
+     eoNoElitism noElitism;
+     eoTruncate truncate;
+     eoRandomSelect randomSelect;
+     eoSelectPerc selectPerc;
+     eoInplaceTransform2 transform;
+
+     /// easyEA is contained rather than a base because of member initialization order!
+     eoEasyEA easyEA;
+};
+
+template 
+eoEvolutionStrategy make_es(eoContinue& _continuator,
+         eoEvalFunc& _eval, 
+         eoGOpSelector&  _opSel,
+         float _lambdaRate,
+         bool _comma)
+
+{
+    if (_comma)
+        return eoEvolutionStrategy(_continuator, _eval, _opSel, _lambdaRate, eoEvolutionStrategy::comma_strategy());
+    //else
+    return eoEvolutionStrategy(_continuator, _eval, _opSel, _lambdaRate, eoEvolutionStrategy::plus_strategy());
+}
+
+//-----------------------------------------------------------------------------
+
+#endif eoSelectTransformReduce_h
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoFitTerm.h b/trunk/paradiseo-eo/src/obsolete/eoFitTerm.h
new file mode 100644
index 000000000..4dded6092
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoFitTerm.h
@@ -0,0 +1,59 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoGenTerm.h
+// (c) GeNeura Team, 1999
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _EOFITTERM_H
+#define _EOFITTERM_H
+
+#include 
+
+
+/** 
+Fitness continuation: 
+
+  Continues until the maximum fitness level is reached.
+*/
+template< class EOT>
+class eoFitContinue: public eoContinue {
+public:
+
+    /// Define Fitness
+    typedef typename EOT::Fitness FitnessType;
+
+	/// Ctor
+    eoFitContinue( const FitnessType _maximum)
+		: eoContinuator (), maximum( _maximum ) {};
+
+	/** Returns false when a fitness criterium is
+	* reached, assumes sorted population */
+	virtual bool operator() ( const eoPop& _vEO ) 
+    {
+	  return (bestFitness < maximum);
+	}
+
+private:
+	FitnessType maximum;
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoFitness.h b/trunk/paradiseo-eo/src/obsolete/eoFitness.h
new file mode 100644
index 000000000..c1e03fc33
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoFitness.h
@@ -0,0 +1,57 @@
+// eoFitness.h
+//-----------------------------------------------------------------------------
+// eoFitness.cpp
+// (c) GeNeura Team 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef EOFITNESS_H
+#define EOFITNESS_H
+
+//-----------------------------------------------------------------------------
+/**
+\deprecated This class will dissapear in time, use eoScalarFitness instead
+*/
+class eoFitness: public eoPersistent
+{
+ public:
+  virtual operator float() const = 0;
+  
+  virtual bool operator<(const eoFitness& other) const = 0;
+  
+  virtual bool operator>(const eoFitness& other) const
+    {
+      return !(*this < other || *this == other);
+    }
+  
+  virtual bool operator==(const eoFitness& other) const
+    {
+      return !(other < *this || *this < other);
+    }
+
+  virtual bool operator!=(const eoFitness& other) const
+    {
+      return other < *this || *this < other;
+    }
+};
+
+//-----------------------------------------------------------------------------
+
+#endif EOFITNESS_H
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoGOpBreeder.h b/trunk/paradiseo-eo/src/obsolete/eoGOpBreeder.h
new file mode 100644
index 000000000..0b8c76f65
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoGOpBreeder.h
@@ -0,0 +1,62 @@
+//-----------------------------------------------------------------------------
+// eoBreeder.h
+//-----------------------------------------------------------------------------
+
+#ifndef eoGopBreeder_h
+#define eoGopBreeder_h
+
+//-----------------------------------------------------------------------------
+
+/*****************************************************************************
+ * eoBreeder: transforms a population using genetic operators.               *
+ * For every operator there is a rated to be applyed.                        *
+ *****************************************************************************/
+
+#include 
+#include 
+#include 
+#include 
+#include 
+
+/**
+  Base class for breeders using generalized operators, I'm not sure if we
+  will maintain the generalized operators in their current form, so
+  it might change.
+*/
+template 
+class eoGOpBreeder: public eoUF&, void>
+{
+ public:
+  /// Default constructor.
+  eoGOpBreeder( eoGOpSelector& _opSel,
+                    eoSelectOneIndiSelector& _selector) 
+                    : opSel( _opSel ), selector(_selector) 
+        {}
+  
+  /**
+   * Enlarges the population.
+   * @param pop The population to be transformed.
+   */
+  void operator()(eoPop& _pop) 
+    {  
+      unsigned size = _pop.size();
+      
+      for (unsigned i = 0; i < size; i++) 
+	{ // and the one liner
+	  opSel.selectOp()(selector.bind(_pop,size).bias(i), inserter.bind(_pop));
+	}
+    }
+  
+  /// The class name.
+  std::string className() const { return "eoGOpBreeder"; }
+  
+ private:
+  eoGOpSelector&            opSel;
+  eoSelectOneIndiSelector&     selector;
+  
+  // the inserter can be local as there's no point in changing it from the outside
+  eoBackInserter     inserter;
+};
+
+#endif eoBreeder_h
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoGOpSelector.h b/trunk/paradiseo-eo/src/obsolete/eoGOpSelector.h
new file mode 100644
index 000000000..279d709b7
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoGOpSelector.h
@@ -0,0 +1,181 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+    -----------------------------------------------------------------------------
+    eoGOpSelector.h
+      Base class for generalized (n-inputs, n-outputs) operator selectors.
+      Includes code and variables that contain operators and rates.
+      Also included eoProportionalGOpSelector and eoSequentialGOpSelector, that offer
+      a few concrete implementations.
+
+    (c) Maarten Keijzer, GeNeura Team 1998, 1999, 2000
+ 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+*/
+
+#ifndef eoGOpSelector_h
+#define eoGOpSelector_h
+
+//-----------------------------------------------------------------------------
+
+#include 
+#include "eoOpSelector.h"
+#include "eoWrappedOps.h" // for eoCombinedOp
+#include 
+
+using namespace std;
+
+/** Base class for alternative selectors, which use the generalized operator
+    interface. eoGOpBreeders expects this class */
+template
+class eoGOpSelector: public eoOpSelector, public std::vector*>
+{
+public:
+
+  typedef eoOpSelector::ID ID;
+
+  /// Dtor
+  virtual ~eoGOpSelector() {
+    for ( std::list< eoGeneralOp* >::iterator i= ownOpList.begin();
+	  i != ownOpList.end(); i++ ) {
+      delete *i;
+    }
+  }
+  
+  /* 
+     Add any kind of operator to the operator mix, 
+     @param _op      operator, one of eoMonOp, eoBinOp, eoQuadraticOp or eoGeneralOp
+     @param _rate    the rate at which it should be applied, it should be a probability
+                    
+  */
+  virtual ID addOp( eoOp& _op, float _rate ); 
+  // implementation can be found below
+  
+  /** Retrieve the operator using its integer handle
+      @param _id The id number. Should be a valid id, or an std::exception 
+      will be thrown
+      @return a reference of the operator corresponding to that id.
+  */
+  virtual eoOp& getOp( ID _id )
+  {
+    return *operator[](_id);
+  }
+  
+  ///
+  virtual void deleteOp( ID _id );
+  // implemented below
+  
+  ///
+  virtual eoOp* Op()
+  {
+    return &selectOp();
+  }
+
+  /// Select an operator from the operators present here
+  virtual eoGeneralOp& selectOp() = 0;
+
+  ///
+  virtual std::string className() const { return "eoGOpSelector"; };
+
+  ///
+  void printOn(std::ostream& _os) const {}
+  //  _os << className().c_str() << std::endl; 
+  //  for ( unsigned i=0; i!= rates.size(); i++ ) {
+  //    _os << *(operator[](i))  << "\t" << rates[i] << std::endl;
+  //  }
+  //}
+
+
+  const std::vector& getRates(void) const { return rates; }
+
+private :
+  std::vector rates;
+  std::list< eoGeneralOp* > ownOpList;
+};
+
+/* Implementation of longish functions defined above */
+
+template 
+inline eoOpSelector::ID eoGOpSelector::addOp( eoOp& _op, 
+							float _arg )
+{
+  eoGeneralOp* op; 
+  
+  if (_op.getType() == eoOp::general) 
+    {
+      op = static_cast*>(&_op);
+    }
+  else
+    {
+      // if it's not a general op, it's a "old" op; create a wrapped op from it
+      // and keep it on a std::list to delete them afterwards
+      // will use auto_ptr when they're readily available
+      
+     switch(_op.getType())
+	{
+	case eoOp::unary :
+	  op=  new eoWrappedMonOp(static_cast&>(_op));
+	  break;
+	case eoOp::binary :
+	  op =  new eoWrappedBinOp(static_cast&>(_op));
+	  break;
+	case eoOp::quadratic :
+	  op =  new eoWrappedQuadraticOp(static_cast&>(_op));
+	  break;
+	case eoOp::general : break; // cannot happen, but gcc issued a warning
+	}
+      ownOpList.push_back( op );
+    }
+  
+  // Now 'op' is a general operator, either because '_op' was one or 
+  // because we wrapped it in an appropriate wrapper in the code above.
+
+  typename eoGOpSelector::iterator result = find(begin(), end(), (eoGeneralOp*) 0); // search for nullpointer
+	  
+  if (result == end())
+    {
+      push_back(op);
+      rates.push_back(_arg);
+      return size();
+    }
+  // else
+    
+  *result = op;
+  ID id = result - begin();
+  rates[id] = _arg;
+  return id;
+}
+
+template 
+inline void  eoGOpSelector::deleteOp( ID _id )
+{
+  eoGeneralOp* op = operator[](_id);
+
+  operator[](_id) = 0; 
+  rates[_id] = 0.0;
+    
+  // check opstd::list and clear it there too.
+  
+  std::list< eoGeneralOp* >::iterator it = find(ownOpList.begin(), ownOpList.end(), op);
+
+  if(it != ownOpList.end())
+    {
+      ownOpList.erase(it);
+    }
+}
+  
+#endif eoGOpSelector_h
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoGenTerm.h b/trunk/paradiseo-eo/src/obsolete/eoGenTerm.h
new file mode 100644
index 000000000..615ab90b2
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoGenTerm.h
@@ -0,0 +1,68 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoGenTerm.h
+// (c) GeNeura Team, 1999
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _EOGENTERM_H
+#define _EOGENTERM_H
+
+#include 
+
+/** Generational continuator: continues until a number of generations is reached
+*/
+template< class EOT>
+class eoGenContinue: public eoContinue {
+public:
+
+	/// Ctors/dtors
+	eoGenContinue( unsigned _totalGens)
+	  : repTotalGenerations( _totalGens ), 
+	  thisGeneration(0){};
+
+	/** Returns false when a certain number of generations is
+	* reached */
+	virtual bool operator() ( const eoPop& _vEO ) {
+	  thisGeneration++;
+	  //	  std::cout << " [" << thisGeneration << "] ";
+	  return (thisGeneration < repTotalGenerations) ; // for the postincrement
+	}
+
+	/** Sets the number of generations to reach 
+	    and sets the current generation to 0 (the begin)*/
+	virtual void totalGenerations( unsigned _tg ) { 
+	  repTotalGenerations = _tg; 
+	  //	  thisGeneration = 0;
+	};
+
+	/** Returns the number of generations to reach*/
+	virtual unsigned totalGenerations( ) {  
+	  return repTotalGenerations; 
+	};
+
+    std::string className(void) const { return "eoGenTerm"; }
+    
+private:
+	unsigned repTotalGenerations, thisGeneration;
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoGeneration.h b/trunk/paradiseo-eo/src/obsolete/eoGeneration.h
new file mode 100644
index 000000000..282de928b
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoGeneration.h
@@ -0,0 +1,85 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoOp.h
+// (c) GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoGeneration_h
+#define eoGeneration_h
+
+//-----------------------------------------------------------------------------
+#include      // eoPop
+#include  
+#include   // eoSelect, eoTranform, eoMerge
+
+//-----------------------------------------------------------------------------
+
+/** eoGeneration
+ * Single step of a evolutionary algorithm. Applies selection, then genetic
+ * operators, replaces using a replacement policy, and finally evaluates the
+ * new ones */
+template class eoGeneration: public eoAlgo
+{
+ public:
+  /// Constructor.
+  eoGeneration(eoSelect&    _select, 
+	       eoBreeder&  _breeder, 
+	       eoBinPopOp&     _replace,
+	       eoEvalFunc& _evaluator):
+    select(_select), transform(_transform), 
+    replace(_replace), evaluator( _evaluator) {};
+
+  /// Copy Constructor.
+  eoGeneration(eoGeneration& _gen):
+    select(_gen.select), transform(_gen.transform), 
+    replace(_gen.replace), evaluator( _gen.evaluator ) {};
+
+
+  /// Apply one generation of evolution to the population.
+  virtual void operator()(eoPop& pop) {
+      eoPop breeders;
+      try {
+	select(pop, breeders);
+	transform(breeders);
+	eoPop::iterator i;
+	// Can't use foreach here since foreach takes the 
+	// parameter by reference
+	for ( i = breeders.begin(); i != breeders.end(); i++)
+	  evaluator(*i);
+	replace(breeders, pop);
+      }  catch ( std::exception& e ) {
+	throw std::runtime_error( e.what() );
+      }
+    }
+  
+  /// Class name.
+  std::string className() const { return "eoGeneration"; }
+  
+ private:
+  eoBinPopOp& select;
+  eoMonPopOp& transform;
+  eoBinPopOp& replace;
+  eoEvalFunc& evaluator;
+};
+
+//-----------------------------------------------------------------------------
+
+#endif eoGeneration_h
diff --git a/trunk/paradiseo-eo/src/obsolete/eoGenericBinOp.h b/trunk/paradiseo-eo/src/obsolete/eoGenericBinOp.h
new file mode 100644
index 000000000..7c06546a6
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoGenericBinOp.h
@@ -0,0 +1,75 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoGenericBinOp.h
+// (c) GeNeura Team, 2000 - EEAAX 1999 - Maarten Keijzer 2000
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoGenericBinOp_h
+#define _eoGenericBinOp_h
+
+#include 
+
+/** Contains base classes for generic binary operators for eoFixedLength 
+    and eoVariableLength (They also derive from the eoOp) as well as 
+    the corresponding converters to actual Ops.
+*/
+
+/** eoGenericBinOp is the generic binary operator:
+it takes two arguments, modifies the first one, and returns a boolean 
+indicating if the argument has actually been modified
+*/
+
+template 
+class eoGenericBinOp: public eoOp, public eoBF
+{
+public:
+  /// Ctor
+  eoGenericBinOp()
+    : eoOp( eoOp::binary ) {};
+  virtual std::string className() const {return "eoGenericBinOp";};
+};
+
+/** Converter from eoGenericBinOp to eoBinOp 
+    the only thinig to do is to transform the boolean into invalidation
+*/
+
+template 
+class eoGeneric2TrueBinOp: public eoBinOp
+{
+public:
+  /// Ctor
+  eoGeneric2TrueBinOp(eoGenericBinOp & _binOp)
+    : binOp( _binOp ) {};
+  virtual std::string className() const {return "eoGeneric2TrueBinOp";}
+
+  virtual void operator()(EOT & _eo1, const EOT & _eo2)
+    {
+      if (binOp(_eo1, _eo2))
+	  _eo1.invalidate();
+    }
+  
+ private:
+  eoGenericBinOp & binOp;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/obsolete/eoGenericMonOp.h b/trunk/paradiseo-eo/src/obsolete/eoGenericMonOp.h
new file mode 100644
index 000000000..f090d1fa5
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoGenericMonOp.h
@@ -0,0 +1,75 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoGenericMonOp.h
+// (c) GeNeura Team, 2000 - EEAAX 1999 - Maarten Keijzer 2000
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoGenericMonOp_h
+#define _eoGenericMonOp_h
+
+#include 
+
+/** Contains base classes for generic operators for eoFixedLength 
+    and eoVariableLength (They also derive from the eoOp) as well as 
+    the corresponding converters to actual Ops.
+*/
+
+/** eoGenericMonOp is the generic unary operator:
+it takes one argument, and returns a boolean indicating if the argument 
+has been modified
+*/
+
+template 
+class eoGenericMonOp: public eoOp, public eoUF
+{
+public:
+  /// Ctor
+  eoGenericMonOp()
+    : eoOp( eoOp::unary ) {};
+  virtual std::string className() const {return "eoGenericMonOp";};
+};
+
+/** COnverter from eoGenericMonOp to eoMonOp 
+    the only thinig to do is to transform the boolean into invalidation
+*/
+
+template 
+class eoGeneric2TrueMonOp: public eoMonOp
+{
+public:
+  /// Ctor
+  eoGeneric2TrueMonOp(eoGenericMonOp & _monOp)
+    : monOp( _monOp ) {};
+  virtual std::string className() const {return "eoGeneric2trueMonOp";}
+
+  virtual void operator()(EOT & _eo)
+    {
+      if (monOp(_eo))
+	  _eo.invalidate();
+    }
+  
+ private:
+  eoGenericMonOp & monOp;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/obsolete/eoGenericQuadOp.h b/trunk/paradiseo-eo/src/obsolete/eoGenericQuadOp.h
new file mode 100644
index 000000000..35455cfbd
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoGenericQuadOp.h
@@ -0,0 +1,83 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoGenericQuadOp.h
+// (c) GeNeura Team, 2000 - EEAAX 1999 - Maarten Keijzer 2000
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoGenericQuadOp_h
+#define _eoGenericQuadOp_h
+
+#include 
+
+/** Contains base classes for generic quadratic operators for eoFixedLength 
+    and eoVariableLength (They also derive from the eoOp) as well as 
+    the corresponding converters to actual Ops.
+*/
+
+/** eoGenericQuadOp is the generic quadratic operator:
+it takes two arguments, modifies the first one, and returns a boolean 
+indicating if the arguments have actually been modified
+
+WARNING: even if only 1 argument is modified, it should return true, 
+         and both fitnesses will be invalidated. It is assumed that 
+	 quadratic operators do some exchange of genetic material, so 
+	 if one is modified, the other is, too!
+*/
+
+template 
+class eoGenericQuadOp: public eoOp, public eoBF
+{
+public:
+  /// Ctor
+  eoGenericQuadOp()
+    : eoOp( eoOp::quadratic ) {};
+  virtual std::string className() const {return "eoGenericQuadOp";};
+};
+
+/** Converter from eoGenericQuadOp to eoQuadOp 
+    the only thinig to do is to transform the boolean into invalidation
+*/
+
+template 
+class eoGeneric2TrueQuadOp: public eoQuadOp
+{
+public:
+  /// Ctor
+  eoGeneric2TrueQuadOp(eoGenericQuadOp & _quadOp)
+    : quadOp( _quadOp ) {};
+  virtual std::string className() const {return "eoGeneric2TrueQuadOp";}
+
+  virtual void operator()(EOT & _eo1, EOT & _eo2)
+    {
+      if (quadOp(_eo1, _eo2))
+	{
+	  _eo1.invalidate();
+	  _eo2.invalidate();
+	}
+    }
+  
+ private:
+  eoGenericQuadOp & quadOp;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/obsolete/eoID.h b/trunk/paradiseo-eo/src/obsolete/eoID.h
new file mode 100644
index 000000000..5763b11ba
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoID.h
@@ -0,0 +1,110 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoID.h
+// (c) GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef EOID_H
+#define EOID_H
+
+//-----------------------------------------------------------------------------
+
+#include   // std::istream, std::ostream
+#include  // for std::string
+
+using namespace std;
+
+//-----------------------------------------------------------------------------
+// eoID
+//-----------------------------------------------------------------------------
+
+/** eoID is a template class that adds an ID to an object.\\
+Requisites for template instantiation are that the object must admit a default ctor 
+and a copy ctor. The Object must be an eoObject, thus, it must have its methods: className,
+printOn, readFrom, that is why we don´t subclass eoObject to avoid multiple inheritance.\\
+IDs can be used to count objects of a a kind, or track them, or whatever.
+@see eoObject
+*/
+template 
+class eoID: public Object
+{
+ public:
+	/// Main ctor from an already built Object.
+	eoID( const Object& _o): Object( _o ), thisID(globalID++) {};
+
+	/// Copy constructor.
+	eoID( const eoID& _id): Object( _id ), thisID(globalID++ ) {};
+
+  /// Virtual dtor. They are needed in virtual class hierarchies
+  virtual ~eoID() {};
+  
+
+  ///returns the age of the object
+  unsigned long ID() const {return thisID;}
+
+  	/** @name Methods from eoObject
+	readFrom and printOn are directly inherited from eo1d
+	*/
+	//@{
+  /** Return the class id. This should be redefined in each class; but 
+  it's got code as an example of implementation. Only "leaf" classes
+  can be non-virtual.
+  */
+  virtual std::string className() const { return std::string("[eoID]")+Object::className(); };
+
+  /**
+   * Read object.
+   * @param _is A std::istream.
+   * @throw runtime_std::exception If a valid object can't be read.
+   */
+  virtual void readFrom(std::istream& _is) {
+	  Object::readFrom( _is );
+	  _is >> thisID;
+  }
+
+  
+  /**
+   * Write object. It's called printOn since it prints the object _on_ a stream.
+   * @param _os A std::ostream.
+   */
+  virtual void printOn(std::ostream& _os) const{
+	  Object::printOn( _os );
+	  _os << thisID;
+  }
+//@}
+  
+ private:
+
+	 /** Default Constructor. \\
+	 It´s private so that it is not used anywhere; the right way of using this object
+	 is to create an Object and passing it to an aged by means of the copy ctor; that way
+	 it´s turned into an Aged object*/
+	 eoID(): Object(), thisID( globalID++ ) {};
+
+	 unsigned long thisID;
+	 static unsigned long globalID;
+};
+
+template< class Object>
+unsigned long eoID< Object >::globalID = 0;
+
+#endif EOID_H
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoInclusion.h b/trunk/paradiseo-eo/src/obsolete/eoInclusion.h
new file mode 100644
index 000000000..5e752a15a
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoInclusion.h
@@ -0,0 +1,64 @@
+//-----------------------------------------------------------------------------
+// eoInclusion.h
+//-----------------------------------------------------------------------------
+
+#ifndef eoInclusion_h
+#define eoInclusion_h
+
+//-----------------------------------------------------------------------------
+
+#include 
+
+// EO includes
+#include     
+#include 
+
+/*****************************************************************************
+ * eoInclusion: A replacement algorithm.                                     *
+ * Creates a new population by selecting the best individuals from the       *
+ * breeders and original populations                                         *
+ *****************************************************************************/
+
+template class eoInclusion: public eoMerge
+{
+ public:
+  /// (Default) Constructor.
+  eoInclusion(const float& _rate = 1.0): eoMerge( _rate ) {}
+
+  /// Ctor from std::istream
+  eoInclusion( std::istream& _is): eoBinPopOp( _is ) {};
+
+  /// Dtor
+  virtual ~eoInclusion() {};
+
+  /**
+   * Creates a new population based on breeders and original populations.
+   * @param breeders The population of breeders.
+   * @param pop The original population.
+   */
+  void operator()(eoPop& breeders, eoPop& pop)
+    {
+      unsigned target = min(static_cast(pop.size() * rate()), 
+			    pop.size() + breeders.size());
+      
+      copy(breeders.begin(), breeders.end(), 
+	   back_insert_iterator >(pop));
+      partial_sort(pop.begin(), pop.begin() + target, pop.end(),
+		   greater());
+      pop.erase(pop.begin() + target, pop.end());
+    }
+
+  /** @name Methods from eoObject	*/
+  //@{
+  /** readFrom and printOn inherited from eoMerge */
+  
+  /** Inherited from eoObject. Returns the class name.
+      @see eoObject
+  */
+  virtual std::string className() const {return "eoInclusion";};
+  //@}
+};
+
+//-----------------------------------------------------------------------------
+
+#endif eoInclusion_h
diff --git a/trunk/paradiseo-eo/src/obsolete/eoIndiSelector.h b/trunk/paradiseo-eo/src/obsolete/eoIndiSelector.h
new file mode 100644
index 000000000..ea4fc34c0
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoIndiSelector.h
@@ -0,0 +1,160 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+  -----------------------------------------------------------------------------
+  eoIndiSelector.h
+    Abstract selection operator, which is used by the eoGeneralOps
+    to obtain individuals from a source population. It also gives a 
+    direct descended eoPopIndiSelector that can be used to 
+    initialize objects with an eoPop. For most uses use eoPopIndividualSelector
+    rather than eoIndividualSelector to derive from.
+
+ (c) Maarten Keijzer (mkeijzer@mad.scientist.com) and GeNeura Team, 1999, 2000
+ 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+
+#ifndef eoIndiSelector_h
+#define eoIndiSelector_h
+
+#include 
+
+/**
+ * eoIndividualSelector: This class defines the interface. This
+ * interface is used by the eoGeneralOp to get new individuals
+ * from a pop, a subpop or a remote pop
+ * for convenience when implementing an nary operator a size() and operator[]
+ * need to be implemented.
+*/
+
+template 
+class eoIndiSelector : public eoF
+{
+public :
+
+    eoIndiSelector() {}
+
+    virtual ~eoIndiSelector(void) {}
+
+    /**
+        return the number of individuals that can be selected by an nary operator (through operator[] below)
+    */
+    virtual size_t size(void) const = 0;
+
+    /**
+        return the specified individual, the size_t argument should be between 0 and eoIndiSelector::size()
+    */
+    virtual const EOT& operator[](size_t i) const = 0;
+};
+
+
+#include 
+
+/**
+ * eoSelectOneAdaptor: Adaptor class for dispensing individuals.
+
+    It produces the eoIndiSelector interface and an eoSelectOne implementation
+    This class can then be used for general operators
+
+    various useful things can be done with this class:
+        you can specify how many of the population can ever be dispensed to the
+        operators, but you can also specify a preference to the first guy being
+        dispensed. This is useful if you want to perform the operator on a specific
+        individual.
+
+  @see eoSelectOne, eoIndiSelector
+*/
+template 
+class eoSelectOneIndiSelector : public eoIndiSelector
+{
+    public :
+        eoSelectOneIndiSelector(eoSelectOne& _select) : pop(0), last(0), firstChoice(-1), secondChoice(-1), select(_select) {}
+                
+        struct eoUnitializedException{};
+
+        /** Initialization function, binds the population to the selector, can also
+            be used to specify an optional end 
+        */
+        eoSelectOneIndiSelector& bind(const eoPop& _pop, int _end = -1)
+        {
+            pop = &_pop;
+            last = _end;
+
+            if (last < 0 || last > (int) pop->size())
+            {
+                last = pop->size();
+            }
+            
+            select.setup(*pop);
+
+            return *this;
+        }
+
+        /** Bias function to bias the selection function to select specific individuals
+            first before applying a selection algorithm defined in derived classes
+        */
+        eoSelectOneIndiSelector& bias(int _first, int _second = -1)
+        {
+            firstChoice  = _first;
+            secondChoice = _second;
+            return *this;
+        }
+
+
+        size_t size(void) const { valid(); return last; }
+        const EOT& operator[](size_t _i) const { valid(); return pop->operator[](_i); }
+
+        eoPop::const_iterator begin(void) const { valid(); return pop->begin(); }
+        eoPop::const_iterator end(void)   const { valid(); return pop->end(); }
+
+        /// operator() does the work. Note that it is not virtual. It calls do_select that needs to be implemented by the derived classes
+        const EOT& operator()(void)
+        {
+            valid();
+            if (firstChoice < 0 || firstChoice >= last)
+            {
+                // see if we have a second choice
+                if (secondChoice < 0 || secondChoice >= last)
+                {
+                    return select(*pop); // let the embedded selector figure out what to do
+                }
+                    
+                const EOT& result = pop->operator[](secondChoice);
+                secondChoice = -1;
+                return result;
+            }
+                        
+            const EOT& result = pop->operator[](firstChoice);
+            firstChoice = -1;
+            return result;
+        }
+
+    private :
+
+        void valid(void) const
+        {
+            if (pop == 0)
+                throw eoUnitializedException();
+        }
+  
+        const eoPop* pop; // need a pointer as this the pop argument can be re-instated
+        int   last;
+        int   firstChoice;
+        int   secondChoice;
+        eoSelectOne& select;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/obsolete/eoInplaceTransform.h b/trunk/paradiseo-eo/src/obsolete/eoInplaceTransform.h
new file mode 100644
index 000000000..a2785506b
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoInplaceTransform.h
@@ -0,0 +1,193 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoInplaceTransform.h
+// (c) GeNeura Team, 1998
+/* 
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+   Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoInplaceTransform_h
+#define eoInplaceTransform_h
+
+//-----------------------------------------------------------------------------
+
+#include           // std::vector
+#include 
+#include           // eoOp, eoMonOp, eoBinOp
+#include          // eoPop
+#include   // eoOpSelector
+#include 
+#include 
+#include 
+
+/*****************************************************************************
+ * eoInplaceTransform1: transforms a population using genetic operators.               *
+ * It does it in an SGA like manner                                 
+ *****************************************************************************/
+template class eoInplaceTransform1 : public eoTransform
+{
+ public:
+    
+  /// Default constructor.
+  eoInplaceTransform1( eoOpSelector& _opSel): opSel( _opSel ), select(defaultSelect) {}
+  eoInplaceTransform1( eoOpSelector& _opSel, eoSelectOne& _select)
+      : opSel(_opSel), select(_select) {}
+  /**
+   * Transforms a population.
+   * @param pop The population to be transformed.
+   */
+  void operator()(eoPop& pop) 
+    {
+      // copy the guys in a newpop
+      // because otherwise eoSelectRandom might select freshly created individuals
+      eoPop newpop;
+      newpop.reserve(pop.size());
+
+      // Set up general op helper classes
+      eoSelectOneIndiSelector inplace(select);
+      eoBackInserter inserter;
+
+      // set up selection routine
+      select.setup(pop);
+
+      for (unsigned i = 0; i < pop.size(); i++) 
+      {
+	     eoOp* op = opSel.Op();
+	
+         switch (op->getType()) 
+        {
+            case eoOp::unary:
+	        {
+	        eoMonOp* monop = static_cast* >(op);
+	        newpop.push_back(pop[i]);
+            (*monop)( newpop.back() );
+	        break;
+	    }
+	    case eoOp::binary:
+	    {
+	        eoBinOp* binop = static_cast* >(op);
+	        newpop.push_back(pop[i]);
+            (*binop)(newpop[i], select(pop));
+	        break;
+	    }
+	    case eoOp::quadratic:
+	    {
+
+	        eoQuadraticOp* Qop = static_cast* >(op);
+	    
+            newpop.push_back(pop[i]);
+            Chrom& indy1 = newpop.back();
+            
+            if (++i == pop.size())
+                newpop.push_back(select(pop));
+            else
+                newpop.push_back(pop[i]);
+
+	        (*Qop)(indy1, newpop.back() );
+	        break;
+        }
+        case eoOp::general :
+        {
+            eoGeneralOp* Gop = static_cast* >(op);
+        
+            inplace.bind(pop);
+            inplace.bias(i,i + 1);
+
+            inserter.bind(newpop);
+            unsigned orgsize = newpop.size();
+            (*Gop)(inplace, inserter);
+            unsigned diff = newpop.size() - orgsize;
+            i = i + (diff-1);
+	        break;
+	    }
+	}
+         pop.swap(newpop); // overwrite existing pop
+      }
+    };
+    
+ private:
+  eoOpSelector& opSel;
+  eoRandomSelect defaultSelect;
+  eoSelectOne&  select;
+  
+};
+
+#include 
+
+/*****************************************************************************
+ * eoInplaceTransform2: transforms a population using general genetic operators.               *
+ * It does it in an SGA like manner                                 
+ *****************************************************************************/
+template class eoInplaceTransform2 : public eoTransform
+{
+ public:
+    
+  /// Default constructor.
+  eoInplaceTransform2( eoGOpSelector& _opSel): opSel( _opSel ), select(defaultSelect) {}
+  eoInplaceTransform2( eoGOpSelector& _opSel, eoSelectOne& _select)
+      : opSel(_opSel), select(_select) {}
+  /**
+   * Transforms a population.
+   * @param pop The population to be transformed.
+   */
+  void operator()(eoPop& pop) 
+    {
+      // copy the guys in a newpop
+      // because otherwise eoSelectRandom might select freshly created individuals
+      eoPop newpop;
+      newpop.reserve(pop.size());
+
+      // Set up general op helper classes
+      eoSelectOneIndiSelector inplace(select);
+      eoBackInserter inserter;
+
+      // set up selection routine
+      select.setup(pop);
+
+      for (unsigned i = 0; i < pop.size(); i++) 
+      {
+            eoGeneralOp& Gop = opSel.selectOp();
+        
+            inplace.bind(pop);
+            inplace.bias(i,i + 1);
+
+            inserter.bind(newpop);
+            unsigned orgsize = newpop.size();
+            Gop(inplace, inserter);
+            
+            // see how many have been inserted and add that to i (minus one ofcourse)
+            unsigned diff = newpop.size() - orgsize;
+            i = i + (diff-1);
+	   }
+       
+      pop.swap(newpop); // overwrite existing pop
+    }
+    
+ private:
+  eoGOpSelector& opSel;
+  eoRandomSelect defaultSelect;
+  eoSelectOne&  select;
+  
+};
+
+
+//-----------------------------------------------------------------------------
+
+#endif eoBreeder_h
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoInserter.h b/trunk/paradiseo-eo/src/obsolete/eoInserter.h
new file mode 100644
index 000000000..f498cd610
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoInserter.h
@@ -0,0 +1,93 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+  -----------------------------------------------------------------------------
+  eoInserter.h
+    Abstract population insertion operator, which is used by the eoGeneralOps
+    to insert the results in the (intermediate) population. It also contains
+    a direct descended eoPopInserter that defines a convenient inbetween class
+    for working with eoPop. The user will most likely derive from eoPopInserter
+    rather than eoInserter.
+
+ (c) Maarten Keijzer (mak@dhi.dk) and GeNeura Team, 1999, 2000
+ 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+
+#ifndef eoInserter_h
+#define eoInserter_h
+
+#include 
+#include 
+
+ /**
+ * eoInserter: Interface class that enables an operator to insert
+    new individuals into the (intermediate) population for example. 
+*/
+template 
+class eoInserter  : public eoUF&>
+{
+    public :
+        virtual ~eoInserter() {}
+
+        struct eoInserterException{};
+};
+
+/**
+ * eoPopInserter: In-between class that defines an initialization
+ * of the eoIndividualInserter. 
+*/
+template 
+class eoPopInserter : public eoInserter 
+{
+    public :
+    
+    eoPopInserter(void) : eoInserter(), thePop(0) {}
+
+    /// Binds the population to this class. This is an initialization routine used by breeders
+    eoInserter& bind(eoPop& _pop)
+    {
+        thePop = &_pop;
+        return *this;
+    }
+
+    protected :
+        
+    eoPop& pop(void) const { valid(); return *thePop; }
+
+    private :
+    
+    void valid(void) const
+    {
+        if (thePop == 0)
+            throw eoInserterException();
+    }
+
+    // Need a pointer as the inserter should be able to bind to different populations.
+    // This is caused by the 'one template parameter only' convention in EO.
+        
+    eoPop* thePop; 
+    
+    // If eoGOpBreeder could be templatized over the inserter and the selector,
+    // the pop could be a ref as this class could be created every time it is applied
+    // and subsequently would get the population through the constructor
+
+};
+
+
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoInsertion.h b/trunk/paradiseo-eo/src/obsolete/eoInsertion.h
new file mode 100644
index 000000000..26774f67f
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoInsertion.h
@@ -0,0 +1,96 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoInsertion.h
+//   Inserts new members into the population
+// (c) GeNeura Team, 1998
+/* 
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+   Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoInsertion_h
+#define eoInsertion_h
+
+//-----------------------------------------------------------------------------
+
+#include 
+
+// EO includes
+#include      // eoPop
+#include   // eoMerge
+
+/******************************************************************************
+ * eoInsertion: A replacement algorithm.
+ * Creates a new population with all the breeders and the best individuals 
+ * from the original population.
+ *****************************************************************************/
+
+template class eoInsertion: public eoBinaryFunctor&, const eoPop&>
+{
+ public:
+  /// (Default) Constructor.
+  eoInsertion(const float& _rate = 1.0): eoMerge( _rate ) {}
+
+  /// Ctor from std::istream
+  eoInsertion( std::istream& _is): eoBinPopOp( _is ) {};
+
+  /// Dtor
+  virtual ~eoInsertion() {};
+
+  /**
+   * Creates a new population based on breeders and original populations.
+   * @param breeders The population of breeders. Should be sorted to work correctly
+   * @param pop The original population.
+   */
+  void operator()( eoPop& _breeders, const eoPop& _pop)
+    {
+      unsigned target = static_cast((_pop.size() * rate()));
+      
+      _pop.swap(_breeders);
+      
+      if (target < _pop.size())
+	{
+	  partial_sort(_pop.begin(), _pop.begin() + target, _pop.end(), 
+		       greater());
+	  _pop.erase(_pop.begin() + target, _pop.end());
+	}
+      else
+	{
+	  target = min(target - _pop.size(), _breeders.size());
+	  partial_sort(_breeders.begin(), _breeders.begin() + target, 
+		       _breeders.end(), greater());
+	  copy(_breeders.begin(), _breeders.begin() + target,
+	       back_insert_iterator >(_pop));
+	}
+    };
+
+  /** @name Methods from eoObject	*/
+  //@{
+  /** readFrom and printOn inherited from eoMerge */
+
+  /** Inherited from eoObject. Returns the class name.
+      @see eoObject
+  */
+  virtual std::string className() const {return "eoInsertion";};
+  //@}
+
+};
+
+//-----------------------------------------------------------------------------
+
+#endif eoInsertion_h
diff --git a/trunk/paradiseo-eo/src/obsolete/eoKill.h b/trunk/paradiseo-eo/src/obsolete/eoKill.h
new file mode 100644
index 000000000..e7ec85a57
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoKill.h
@@ -0,0 +1,62 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoKill.h
+// (c) GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _EOKILL_h
+#define _EOKILL_h
+
+#include 
+
+#include 
+
+/// Kill eliminates a gen in a chromosome
+template 
+class eoKill: public eoMonOp  {
+public:
+	///
+	eoKill( )
+		: eoMonOp< EOT >(){};
+
+	/// needed virtual dtor
+	virtual ~eoKill() {};
+
+	///
+	virtual void operator()( EOT& _eo ) const 
+    {
+	  unsigned pos = rng.random(_eo.length()); 
+	  _eo.deleteGene( pos );
+	}
+
+	/** @name Methods from eoObject
+	readFrom and printOn are directly inherited from eoOp
+	*/
+	//@{
+	/** Inherited from eoObject 
+		  @see eoObject
+	*/
+	virtual std::string className() const {return "eoKill";};
+    //@}
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoLottery.h b/trunk/paradiseo-eo/src/obsolete/eoLottery.h
new file mode 100644
index 000000000..39ca87230
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoLottery.h
@@ -0,0 +1,105 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoLottery.h
+//   Implements the lottery procedure for selection
+// (c) GeNeura Team, 1998 - Marc Schoenauer, 2000
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoLottery_h
+#define eoLottery_h
+
+//-----------------------------------------------------------------------------
+
+#include           // std::logic_error
+#include   // sum_fitness
+#include 
+
+// #include   // 
+// #include      // accumulate
+// #include           // eoPop eoSelect MINFLOAT
+
+
+//-----------------------------------------------------------------------------
+/** eoLottery: a selection method. Puts into the output a group of individuals 
+    selected using lottery; individuals with higher probability will have more
+    chances of being selected.
+    Requires EOT::Fitness to be float castable
+*/
+//-----------------------------------------------------------------------------
+
+template class eoLottery: public eoBinaryFunctor&, eoPop& >
+{
+ public:
+  /// (Default) Constructor.
+  eoLottery(const float& _rate = 1.0): eoBinPopOp(), rate_(_rate) 
+  {
+      if (minimizing_fitness())
+      {
+	throw std::logic_error("eoLottery: minimizing fitness");
+      }
+  }
+  
+  /** actually selects individuals from pop and pushes them back them into breeders
+   *  until breeders has the right size: rate*pop.size()
+   *  BUT what happens if breeders is already too big?
+   * Too big for what?
+   */
+  void operator()(const eoPop& pop, eoPop& breeders) 
+    {
+      size_t target = static_cast(rate_ * pop.size());
+
+      /* Gustavo: uncomment this if it must be here
+      // test of consistency
+      if (breeders.size() >= target) {
+	  throw("Problem in eoLottery: already too many offspring");
+	  }
+      
+      double total;
+      
+      try
+      {
+          total = sum_fitness (pop);
+      }
+      catch (eoNegativeFitnessException&)
+      { // say where it occured...
+          throw eoNegativeFitnessException(*this);
+      }
+      */
+      
+      double total = sum_fitness (pop);
+
+      // selection of chromosomes
+      while (breeders.size() < target) 
+      {
+	    breeders.push_back(roulette_wheel(pop, total));
+      }
+    }
+
+  double rate(void) const { return rate_; }
+  
+ private:
+  double rate_;  // selection rate
+};
+
+//-----------------------------------------------------------------------------
+
+#endif eoLottery_h
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoMutation.h b/trunk/paradiseo-eo/src/obsolete/eoMutation.h
new file mode 100644
index 000000000..f3225fffb
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoMutation.h
@@ -0,0 +1,90 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoMutation.h
+// (c) GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+#ifndef _EOMUTATION_H
+#define _EOMUTATION_H
+
+#include 
+// EO includes
+#include 
+
+/** Generic Mutation of an EO. 
+    This is a virtual class, just to establish the interface for the ctor. 
+    Mutation is usually type-specific
+*/
+
+template 
+class eoMutation: public eoMonOp {
+public:
+  
+  ///
+  eoMutation(const double _rate=0.0) : eoMonOp< EOT >(), rate(_rate) {};
+  
+  ///
+  virtual ~eoMutation() {};
+  
+  ///
+  virtual void operator()( EOT& _eo ) const {
+    typename EOT::iterator i;
+    for ( i = _eo.begin(); i != _eo.end(); i ++ )
+      applyAt( _eo, *i );
+  }
+  
+  /// To print me on a stream.
+  /// @param os The std::ostream.
+  void printOn(std::ostream& os) const {
+    os << rate ;
+  }
+  
+  /// To read me from a stream.
+  /// @param is The std::istream.
+  void readFrom(std::istream& is) {
+    is >> rate ;
+  }
+      
+  /** @name Methods from eoObject
+  */  
+  //@{
+  /** Inherited from eoObject 
+      @see eoObject
+  */
+  std::string className() const {return "eoMutation";};
+  //@}
+
+protected:
+  double rate;  
+  
+private:  
+#ifdef _MSC_VER
+  typedef EOT::Type Type;
+#else
+  typedef typename EOT::Type Type;
+#endif
+  
+  /// applies operator to one gene in the EO. It is empty, so each descent class must define it.
+  virtual void applyAt( EOT& _eo, unsigned _i ) const = 0 ;
+};
+
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoNegExp.h b/trunk/paradiseo-eo/src/obsolete/eoNegExp.h
new file mode 100644
index 000000000..3d6be5e28
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoNegExp.h
@@ -0,0 +1,67 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+-----------------------------------------------------------------------------
+ eoNegExp.h
+ (c) GeNeura Team, 1998
+ 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _EONEGEXP_H
+#define _EONEGEXP_H
+
+//-----------------------------------------------------------------------------
+
+#include 
+
+#include  // for base class
+#include  // for base class
+
+//-----------------------------------------------------------------------------
+// Class eoNegExp
+//-----------------------------------------------------------------------------
+
+/// Generates random numbers using a negative exponential distribution
+template
+class eoNegExp: public eoRnd
+{
+ public:
+  /**
+   * Default constructor.
+   * @param _mean  Distribution mean
+   */
+  eoNegExp(T _mean): eoRnd(), mean(_mean) {};
+
+  /**
+   * Copy constructor.
+   * @param _rnd the copyee
+   */
+  eoNegExp( const eoNegExp& _rnd): eoRnd( _rnd), mean(_rnd.mean) {};
+  
+  /// Returns an uniform dandom number over the interval [min, max).
+  virtual T operator()() { 
+    return T( -mean*log((double)rng.rand() / rng.rand_max())); }
+  
+ private:
+  T mean;
+};
+
+//-----------------------------------------------------------------------------
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoNonUniform.h b/trunk/paradiseo-eo/src/obsolete/eoNonUniform.h
new file mode 100644
index 000000000..b5065d21d
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoNonUniform.h
@@ -0,0 +1,87 @@
+//-----------------------------------------------------------------------------
+// eoNonUniform.h
+//-----------------------------------------------------------------------------
+
+#ifndef EONONUNIFORM_H
+#define EONONUNIFORM_H
+
+//-----------------------------------------------------------------------------
+
+#include   // pow
+
+//-----------------------------------------------------------------------------
+// eoNonUniform
+//-----------------------------------------------------------------------------
+
+class eoNonUniform
+{
+public:
+  eoNonUniform(const unsigned _num_step):
+    step_value(0), num_step_value(_num_step) {}
+  
+  void reset() { step_value = 0; }
+  
+  const unsigned& step() const { return step_value; }
+  const unsigned& num_step() const { return num_step_value; }
+  
+  operator int() const { return step_value < num_step_value; }
+  
+  void operator++() { ++step_value; }
+  void operator++(int) { ++step_value; }
+  
+private:
+  unsigned step_value, num_step_value;
+};
+
+//-----------------------------------------------------------------------------
+// eoLinear
+//-----------------------------------------------------------------------------
+
+class eoLinear
+{
+public:
+  eoLinear(const double        _first, 
+	   const double        _last, 
+	   const eoNonUniform& _non_uniform):
+    first(_first), 
+    diff((_last - _first) / (_non_uniform.num_step() - 1)), 
+    non_uniform(_non_uniform) {}
+  
+  double operator()() const
+  {
+    return first + diff * non_uniform.step();
+  }
+  
+private:
+  double              first, diff;
+  const eoNonUniform& non_uniform;
+};
+
+//-----------------------------------------------------------------------------
+// eoNegExp2
+//-----------------------------------------------------------------------------
+
+class eoNegExp2
+{
+ public:
+  eoNegExp2(const double        _r,
+	    const double        _b,
+	    const eoNonUniform& _non_uniform):
+    r(_r), b(_b), 
+    non_uniform(_non_uniform) {}
+  
+  double operator()() const
+    {
+      return 1.0 - pow(r, pow(1.0 - (double)non_uniform.step() / 
+			      non_uniform.num_step(), b));
+    }
+  
+ private:
+  double              r, b;
+  const eoNonUniform& non_uniform;
+};
+
+//-----------------------------------------------------------------------------
+
+#endif NON_UNIFORM_HH
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoNormal.h b/trunk/paradiseo-eo/src/obsolete/eoNormal.h
new file mode 100644
index 000000000..09a75d7f5
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoNormal.h
@@ -0,0 +1,89 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoNormal.h
+// (c) GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _EONORMAL_H
+#define _EONORMAL_H
+
+//-----------------------------------------------------------------------------
+
+#include 
+#include  // for base class
+#include  // for random number generator
+
+//-----------------------------------------------------------------------------
+// Class eoNormal
+//-----------------------------------------------------------------------------
+
+/// Generates random number using a normal distribution
+template
+class eoNormal: public eoRnd
+{
+ public:
+  /**
+   * Default constructor.
+   * @param _mean  Dsitribution mean
+   * @param _sd    Standard Deviation
+   */
+  eoNormal(T _mean, T _sd)
+    : eoRnd(), mean(_mean), sd(_sd), phase(false) {}
+
+  /**
+   * Copy constructor.
+   * @param _rnd the other one
+   */
+  eoNormal( const eoNormal& _rnd )
+    : eoRnd( _rnd), mean(_rnd.mean), sd(_rnd.sd), phase(false) {}
+  
+  /** Returns an uniform random number over the interval [min, max).
+      @return an uniform random number over the interval [min, max).
+   */
+  virtual T operator()() {
+    if (phase) { // Already have one stored up.
+      phase = false;
+      return T ( (sqRatio * q * sd) + mean );
+    }
+
+    double p, v;
+    do {
+      p = ((double)rng.rand() / rng.rand_max())*2-1;
+      q = ((double)rng.rand() / rng.rand_max())*2-1;
+      v = p*p + q*q;
+    } while(v > 1.0 || v <0.25);
+
+    sqRatio = sqrt(-2*log((double)rand() / rng.rand_max()) / v);
+    phase = true;
+    return T( (sqRatio * p * sd) + mean );
+  };
+
+ private:
+  T mean;
+  T sd;
+  bool phase;
+  double sqRatio, q;
+};
+
+//-----------------------------------------------------------------------------
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoOpFactory.h b/trunk/paradiseo-eo/src/obsolete/eoOpFactory.h
new file mode 100644
index 000000000..2d835d999
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoOpFactory.h
@@ -0,0 +1,87 @@
+// eoOpFactory.h
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoMonOpFactory.h
+// (c) GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _EOOPFACTORY_H
+#define _EOOPFACTORY_H
+
+#include 
+#include 
+#include 
+#include 
+#include 
+
+//-----------------------------------------------------------------------------
+
+/** EO Factory. An instance of the factory class to create monary operators.
+@see eoSelect*/
+template< class EOT>
+class eoOpFactory: public eoFactory< eoOp >  {
+	
+public:
+	
+	/// @name ctors and dtors
+	//{@
+	/// constructor
+	eoOpFactory( ) {}
+	
+	/// destructor
+	virtual ~eoOpFactory() {}
+	//@}
+
+	/** Another factory method: creates an object from an std::istream, reading from
+	it whatever is needed to create the object. Usually, the format for the std::istream will be\\
+	objectType parameter1 parameter2 ... parametern\\
+	If there are problems, an std::exception is raised; it should be caught at the
+	upper level, because it might be something for that level
+	@param _is an stream from where a single line will be read
+	@throw runtime_std::exception if the object type is not known
+	*/
+	virtual eoOp* make(std::istream& _is) {
+		eoOp * opPtr = NULL;
+		std::string objectTypeStr;
+		_is >> objectTypeStr;
+		if  ( objectTypeStr == "eoDup") {
+		  opPtr = new eoDup();
+		} 
+		if ( objectTypeStr == "eoKill" ) {
+		  opPtr = new eoKill( );
+		} 
+		if ( objectTypeStr == "eoTranspose" ) {
+		  opPtr = new eoTranspose( );
+		} 
+		if ( objectTypeStr == "eoXOver2" ) {
+		  opPtr = new eoXOver2( );
+		} 
+		if ( !opPtr ) {
+		  throw objectTypeStr;
+		}
+		return opPtr;
+	};
+
+
+};
+
+
+#endif _EOOPFACTORY_H
diff --git a/trunk/paradiseo-eo/src/obsolete/eoOpSelector.h b/trunk/paradiseo-eo/src/obsolete/eoOpSelector.h
new file mode 100644
index 000000000..d15f620c9
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoOpSelector.h
@@ -0,0 +1,94 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+    -----------------------------------------------------------------------------
+    eoOpSelector.h
+      Base class for operator selectors, which return 1 operator according
+      to some criterium
+
+    (c) GeNeura Team 1998, 1999, 2000
+ 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+*/
+
+//-----------------------------------------------------------------------------
+
+#ifndef EOOPSELECTOR_H
+#define EOOPSELECTOR_H
+
+//-----------------------------------------------------------------------------
+
+#include   // std::runtime_error 
+
+#include 
+#include 
+#include 
+
+//-----------------------------------------------------------------------------
+/** An operator selector is an object that contains a set of EO operators,
+and selects one based on whatever criteria. It will be used in the breeder objects.\\
+This class is basically a generic interface for operator selection
+*/
+template
+class eoOpSelector: public eoObject, public eoPrintable
+{
+public:
+  
+    // Need virtual destructor for derived classes
+    virtual ~eoOpSelector() {}
+
+  /// type of IDs assigned to each operators, used to handle them
+  typedef unsigned ID;
+  
+  /** add an operator to the operator set
+      @param _op a genetic operator, that will be applied in some way
+      @param _arg the operator rate, usually, or any other argument to the operator
+      @return an ID that will be used to identify the operator
+  */
+  virtual ID addOp( eoOp& _op, float _arg ) = 0;
+  
+  /** Gets a non-const reference to an operator, so that it can be changed, 
+      modified or whatever 
+      @param _id  a previously assigned ID
+      @throw runtime_std::exception if the ID does not exist*/
+  virtual eoOp& getOp( ID _id ) = 0;
+  
+  /** Remove an operator from the operator set
+      @param _id a previously assigned ID
+      @throw runtime_std::exception if the ID does not exist
+  */
+  virtual void deleteOp( ID _id ) = 0;
+  
+  /// Returns a genetic operator according to the established criteria
+  virtual eoOp* Op() = 0;
+  
+  /// Methods inherited from eoObject
+  //@{
+  
+  /** Return the class id. 
+      @return the class name as a std::string
+  */
+  virtual std::string className() const { return "eoOpSelector"; };
+  
+  /**
+   * Read object and print objects are left for subclasses to define.
+   */
+  //@}
+};
+
+//-----------------------------------------------------------------------------
+
+#endif EO_H
diff --git a/trunk/paradiseo-eo/src/obsolete/eoParser.h b/trunk/paradiseo-eo/src/obsolete/eoParser.h
new file mode 100644
index 000000000..fb837370f
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoParser.h
@@ -0,0 +1,838 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+/* eoParser.h
+  some classes to parser either the command line or a parameter file
+
+ (c) Marc Schoenauer and Geneura team, 1999
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _PARSER_H
+#define _PARSER_H
+
+#include  // for strcasecmp ... maybe there's a c++ way of doing it?
+                    // Yep there is, but needs either a simple functor for the equal function
+                    // or a hand-rolled std::string template class (this isn't that horrible as 
+                    // it sounds, it just means a new std::string_traits class with two changed
+                    // function definitions. (Maarten)
+#ifdef _MSC_VER
+#define strcasecmp(a,b) _strnicmp(a,b,strlen(a))
+#endif
+
+// STL includes
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+
+// include for std::exceptions
+#include  // std::logic_error
+
+//-----------------------------------------------------------------------------
+// Class Param
+//-----------------------------------------------------------------------------
+
+/**
+ * A param repesents an argument that can be passed to a program in the command line
+ */
+class Param {
+public:
+  
+  /**
+   * Type of params
+   */
+  enum valueType { INT, UL, FLOAT, STRING, BOOL, ARRAY, TITLE };
+  
+  /**
+   * Construct an Param.
+   * @param _shortName     Short name of the argument
+   * @param _longName      Long name of the argument
+   * @param _default       The default value
+   * @param _valueType     Type of the parameter ("integer","unsigned long", "float","char", "bool" and so on)
+   * @param _description   Description of the parameter. What is useful for.
+   * @param _required      If it is a necessary parameter or not
+   */
+  Param (std::string _shortName="-h", std::string _longName="--help", 
+	 std::string _default = "", valueType _valType= STRING,
+	 std::string _description="Shows this help", 
+	 bool _required=false )
+    : repShortName(_shortName), repLongName(_longName), 
+    repDescription(_description ), repEnv(""), repDefault(_default),
+    repValue(_default), repValType( _valType), 
+    repRequired( _required), repChanged(false) {
+    
+    const char *c = repLongName.c_str();
+    for(unsigned i=0; i getArray  (const std::string& _shortName, const std::string& _longName, 
+			    const std::string& _default = "", 
+			    const std::string& _description="", bool _required=false) {
+    Param param ( _shortName, _longName, _default, Param::ARRAY, _description, _required );
+    parse( param );
+    params.push_back( param );
+
+    istrstream is(param.value().c_str());
+    std::vector retValue;
+    std::string tmpStr;
+
+    is >> tmpStr;
+    while(is){
+      retValue.push_back(tmpStr);
+      is >> tmpStr;
+    }
+    return retValue;
+  };
+  
+  /**
+   * Gets the int value of a param given the full description of the parameter
+   * @param         see above
+   * @std::exception     BadType if the param's value isn't a correct int
+   */
+
+  int getInt  (const std::string& _shortName, const std::string& _longName, 
+	       const std::string& _default = "", 
+	       const std::string& _description="", bool _required=false) {
+    Param param ( _shortName, _longName, _default, Param::INT, _description, _required );
+    parse( param );
+    params.push_back( param );
+
+    // now gets the value
+    istrstream is( param.value().c_str());
+    int retValue;
+    is >> retValue;
+    
+    if (!is) {
+      throw Parser::BadType(param.longName().c_str(), param.value().c_str(), "float");
+      return 0;
+    } else {
+      return retValue;
+    }
+  };
+
+  /**
+   * Gets the unsigned lon value of a param given ...
+   * @param         see above
+   * @std::exception     BadType if the param's value isn't a correct unsigned long
+   */
+
+  int getUnsignedLong  (const std::string& _shortName, const std::string& _longName, 
+			const std::string& _default = "", 
+			const std::string& _description="", bool _required=false) {
+    Param param ( _shortName, _longName, _default, Param::UL, _description, _required );
+    parse( param );
+    params.push_back( param );
+
+    // now gets the value
+    istrstream is( param.value().c_str());
+    unsigned long retValue;
+    is >> retValue;
+    
+    if (!is) {
+      throw Parser::BadType(param.longName().c_str(), param.value().c_str(), "float");
+      return 0;
+    } else {
+      return retValue;
+    }
+  };
+
+  /**
+   * Gets the float value of a param given the  description of the parameter
+   * @param         see above
+   * @std::exception     BadType if the param's value isn't a correct int
+   */
+
+  float getFloat  (const std::string& _shortName, const std::string& _longName, 
+		   const std::string& _default = "", 
+		   const std::string& _description="", bool _required=false) {
+    Param param ( _shortName, _longName, _default, Param::FLOAT, _description, _required );
+    parse( param );
+    params.push_back( param );
+
+    // now gets the value
+    istrstream is( param.value().c_str());
+    float retValue;
+    is >> retValue;
+    
+    if (!is) {
+      throw Parser::BadType(param.longName().c_str(), param.value().c_str(), "float");
+      return 0;
+    } else {
+      return retValue;
+    }
+  };
+
+
+  std::string parse_std::string (std::istream & _is) {
+    std::string paramValue;
+    _is >> paramValue;
+    //if the first character of the std::string or array is not a " => just one word or array-element.
+    if( paramValue[0] != '\"' ) 
+      return paramValue;
+
+    if( paramValue[1] == '\"' ) // the empty std::string
+      return "" ;
+
+    //else => read until the next " (the end of the std::string).
+    const char *c = paramValue.c_str();
+    std::string tmpStr = c+1;// skip the "
+    if (tmpStr[tmpStr.length()-1] == '\"') { // one word only
+      //tmpStr[tmpStr.length()-1] = '\0';
+      tmpStr.erase( &tmpStr[tmpStr.length()-1] );
+      return tmpStr;
+    }
+
+    bool stop = false;
+    while (_is && !stop) {
+      _is >> paramValue;
+      // test last character of paramValue for "
+      if (paramValue[paramValue.length()-1] == '\"') {
+	paramValue.erase( ¶mValue[paramValue.length()-1] );
+	//paramValue[paramValue.length()-1] = '\0';
+	stop = true;
+      }
+      tmpStr = tmpStr + " " + paramValue ;
+    }
+    return tmpStr;
+  };
+
+
+  void parse (Param & param) {
+    int i;
+    std::string tmpStr, ReadStr, FirstWord;
+
+    // FIRST: look if the associated environment variables have any value, to use them.
+    if( getenv( param.environment().c_str() ) ) {
+      //std::cout <<"\t\t ENV param:  ,"<shortName()<<",  ,"<environment().c_str())<> tmpStr;
+	if (  ( !strcmp(tmpStr.c_str(), param.shortName().c_str()) ) ||
+	      ( !strcasecmp(tmpStr.c_str(), param.longName().c_str()) )
+	      ) {		   // found the keyword
+				  
+	  Param::valueType tmp = param.valType();
+	  switch ( tmp ) {
+	  case Param::TITLE:
+	    std::cerr << "Error, we should not be there" << std::endl;
+	    exit(1);
+	    break;
+	  case Param::BOOL : 
+	    param.value("true" );
+	    break;
+					  
+	  case Param::INT:  
+	  case Param::UL:  
+	  case Param::FLOAT: 
+	    is >> tmpStr;
+	    param.value(tmpStr);
+	    break;
+					  
+	  case Param::STRING:
+	    tmpStr = parse_std::string(is);
+	    param.value(tmpStr);
+	    break;
+					  
+	  case Param::ARRAY:
+	    ReadStr = parse_std::string(is);
+	    if ( ReadStr != "<" ) {  // no "<" ">" --> a single std::string in the array
+	      param.value(ReadStr);
+	      break;
+	    }
+	    // read next word - and keep it in case of <> mismatch
+	    FirstWord = parse_std::string(is);
+	    // test for empty array
+	    if (FirstWord == ">") {
+	      param.value("");
+	      break;
+	    }
+	    // else, read all words until ">"
+	    tmpStr = FirstWord;
+	    ReadStr = parse_std::string(is);
+	    while ( is && (ReadStr != ">") ) {
+	      tmpStr = tmpStr + " " + ReadStr;
+	      ReadStr = parse_std::string(is);
+	    } 
+					  
+	    if (!is) {	   // there was a "<" without the corresponding ">"
+	      throw Parser::BadArrayParam( param.longName(), FirstWord );
+	      param.value(FirstWord); // assume unique std::string
+	    }
+	    else
+	      param.value(tmpStr);
+	    break;
+	  }
+	}
+      }
+    }
+		  
+		  
+    // LAST (highest priority) parse the command line arguments
+    for (i=1 ; i" --> a single std::string in the array
+	      param.value(ReadStr);
+	    }else{
+	      // read next word - and keep it in case of <> mismatch
+	      FirstWord = parse_argv[i++];
+							  
+	      // test for empty array
+	      if (FirstWord == ">") {
+		param.value("");
+	      }else{
+		// else, read all words until ">"
+		tmpStr = FirstWord;
+		ReadStr = parse_argv[i++];
+		while ( (i=parse_argc) && (ReadStr != ">") ) {	   // there was a "<" without the corresponding ">"
+		  throw Parser::BadArrayParam( param.longName(), FirstWord );
+		  param.value(FirstWord); // assume unique std::string
+		}else{
+		  param.value(tmpStr);
+		}
+	      }
+	    }
+	  }
+	}
+	break;
+      }
+			  
+    //MS after trying all possibilities, and if the value has not changed 
+    // though the parameter was required, protest!
+    if (param.required() && !param.changed())
+      throw Parser::MissingReqParam(param.shortName());
+			  
+  };
+  
+  /**
+   * Sets a new value for a param given its short name or its long name.
+   * @param _name  One of the names of the param.
+   * @param _value Value to be assigned.
+   * @std::exception UnknownArg if the param doesn't exist
+   * @std::exception MissingVal if the param hasn't got a value
+   */
+  Param::valueType setParamValue (const std::string& _name, const char* _value){
+    std::vector::iterator pos;
+    
+    for (pos=params.begin() ; pos!=params.end() ; pos++)
+      if (pos->shortName()==_name || pos->longName()==_name)
+	break;
+    
+    // if found ...
+    if (pos!=params.end()) {
+      switch ( pos->valType() ) {
+      case Param::TITLE:
+	std::cerr << "Error, we should not be there" << std::endl;
+	exit(1);
+	break;
+      case Param::BOOL :
+	pos->value("true");
+	break;
+      case Param::ARRAY :
+      case Param::INT: 
+      case Param::UL: 
+      case Param::FLOAT: 
+      case Param::STRING: 
+	if (_value != NULL){
+	  pos->value(_value);
+	}else{
+	  throw Parser::MissingVal(_name);
+	  return Param::BOOL;
+	}
+	break;
+      } // switch
+      
+      return pos->valType();
+      
+    }else{
+      throw Parser::UnknownArg(_name);
+      return Param::BOOL;
+    }
+  };
+
+  /// the output method - generate the .status file (unless other name is given)
+  friend std::ostream & operator<< ( std::ostream & os, Parser & _parser )
+  {
+    std::vector::iterator p;     
+    //print every param with its value
+    for ( p=_parser.params.begin(); p!=_parser.params.end(); p++ ) {
+      switch ( p->valType() ) {
+      case Param::BOOL :
+	if( p->value() == (std::string) "true")
+	  os << p->longName();
+	else
+	  os << "#" << p->longName() ; // so the name of the bool is commented out
+	break;
+	
+      case Param::INT: 
+      case Param::UL:  
+      case Param::FLOAT: 
+	os << p->longName()<<"  "<value();
+	break;
+	
+      case Param::ARRAY :
+	os << p->longName() << "   < " << p->value().c_str() << " >" ;
+	break;
+      case Param::STRING: 
+	os << p->longName()<<"   \""<value().c_str()<<"\" ";
+	break;
+      case Param::TITLE:
+	os << std::endl;	  // Title is in the description below
+	break;
+      } // switch
+      os << "\t    #" << p->shortName() << " : " << p->description();
+      if (p->valType() != Param::TITLE)
+	os << " [" << p->defValue() << "]" ;
+      os << std::endl;
+    }
+    return os;
+  };
+  
+  /**
+   * Prints out the std::list of parameters in the output file (if specified)
+   */
+  void outputParam(std::string _OutputFile="")
+  {
+    if (_OutputFile == "") {
+      _OutputFile = parse_argv[0];
+      _OutputFile += ".status";
+    }
+    
+    std::ofstream os(_OutputFile.c_str()); 
+    os << "Parameters used by \"" << programName << "\" ("
+       << programDescription << ")" << std::endl << std::endl;
+    os << *this;
+  };
+  
+  /**
+   * Prints an automatic help in the standard output using the information
+   * provided by parameters
+   */
+  void printHelp() {
+    std::vector::iterator p;
+    //    unsigned i;
+    
+    // print program name and description
+    std::cout << this->programName <<": "<valType() != Param::TITLE ) {
+    // 	if( p->valType() != Param::BOOL ){
+    // 	  std::cout << ( (!p->required())?"[":"");
+    // 	  std::cout <shortName()<<" value"<required())?"]":"")<<" ";
+    // 	}else{
+    // 	  std::cout << "["<shortName()<<"] ";
+    // 	}
+    //       } // for p
+    std::cout << "Where:"<valType() != Param::TITLE ) {
+	// Victor: 04-Jan-2000
+	// Modified because the - and -- prefixes are not needed.
+	/*
+	std::cout << "-" << p->shortName()
+	     <<", --"<longName()<<":\t"
+	     <description()<shortName()
+	     <<", " << p->longName()<<":\t"
+	     <description()<valType() ) {
+	case Param::INT: std::cout <<"Integer"; break;
+	case Param::UL: std::cout <<"Unsigned Long Integer"; break;
+	case Param::FLOAT: std::cout <<"Float"; break;
+	case Param::STRING: std::cout <<"String"; break;
+	case Param::ARRAY: std::cout <<"An array of std::strings, enclosed within < >"; break;
+	case Param::BOOL: std::cout << "Flag"; break;
+	case Param::TITLE: break;
+	} // switch
+	if(p->valType() == Param::BOOL)
+	  std::cout << ") True if present" << std::endl;
+	else
+	  std::cout<<") "<<( (p->required())?"Required":"Optional" )<<". By default: "<defValue()<description() << std::endl;
+      }
+    } // for p
+    std::cout << std::endl;
+  };
+  
+  /**
+   * This class managges unknown argument std::exceptions.
+   */
+  class UnknownArg : public std::logic_error {
+  public:
+    
+    /**
+     * Constructor
+     * @param _arg std::string to be shown when the std::exception occurs
+     */
+    UnknownArg( const std::string& _arg): std::logic_error( "Invalid argument: "+_arg ) { };
+  };
+  
+  /**
+   * This class managges bad param types.
+   */
+  class BadType : public std::logic_error {
+  public:
+    
+    /**
+     * Constructor
+     * @param _param The param
+     * @param _value The value of the param
+     */
+    BadType(const std::string& _param, const std::string& _value, const std::string& _correctType)
+      : std::logic_error("The value '" + _value + "' assigned to the argument " + _param + " isn't a correct "+_correctType) { };
+  };
+  
+  /**
+   * This class managges std::exceptions produced when there isn't a value for a parameter.
+   */
+  class MissingVal : public std::logic_error {
+  public:
+    
+    /**
+     * Constructor
+     * @param _param The param
+     */
+    MissingVal(const std::string& _param) : std::logic_error("Missing value for parameter " + _param) {};
+  };
+  
+  /**
+   * This class managges std::exceptions produced when the user forgot a required parameter.
+   */
+  class MissingReqParam : public std::logic_error {
+  public:
+    
+    /**
+     * Constructor
+     * @param _shortName The param's short name
+     */
+    MissingReqParam(const std::string& _shortName) : std::logic_error("Missing required parameter " + _shortName) {};
+  };
+  
+  /**
+   * This class managges std::exceptions du to < without a > in array value
+   */
+  class BadArrayParam : public std::logic_error {
+  public:
+    
+    /**
+     * Constructor
+     * @param _param The param
+     * @param _first_word The first word read after the "<"
+     */
+    BadArrayParam(const std::string& _param, const std::string &_first_word) : 
+      std::logic_error("Array parameter " + _param + ": No matching > ("  + _first_word 
+		 + "... )") {};
+  };
+
+  void createParamFile( std::ostream& _os ) {
+    std::vector::iterator p;
+    for ( p=params.begin(); p!=params.end(); p++ ) {
+      switch( p->valType() ) {
+      case Param::TITLE: 
+	_os << std::endl << "# -- ";
+	break;
+      case Param::BOOL: 
+	_os << ((p->value()=="true" )?"":"#") 
+	    << p->longName();
+	break;
+      case Param::STRING: 
+	_os << p->longName()<<"\t\""<value()<<"\"";
+	break;
+      case Param::ARRAY: 
+	_os << p->longName()<<"\t< "<value()<<" >";
+	break;
+      default:
+	_os << p->longName()<<"\t"<value();
+	break;
+      } // switch
+      _os << "\t #" << p->description() << std::endl; 
+    }
+  }
+private:
+  std::vector params;
+  std::string programName; 
+  std::string programDescription;
+  int parse_argc;
+  char **parse_argv;
+  std::string InputFileName;
+  
+};
+
+
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/obsolete/eoParserUtils.cpp b/trunk/paradiseo-eo/src/obsolete/eoParserUtils.cpp
new file mode 100644
index 000000000..dea8ed096
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoParserUtils.cpp
@@ -0,0 +1,35 @@
+// See eoParserUtils.h
+
+#include 
+#include 
+/// Reproducible random seed
+
+// For the Mersenne-Twister used in EO, the entire rng needs to be saved
+
+//----------------------------------
+void InitRandom( Parser & parser) {
+//----------------------------------
+  unsigned long _seed;
+  try {
+    _seed = parser.getUnsignedLong("-S", "--seed", "0", 
+				   "Seed for Random number generator" );
+  }
+  catch (logic_error & e)
+    {
+      cout << e.what() << endl;
+      parser.printHelp();
+      exit(1);
+    }
+
+  if (_seed == 0) {		   // use clock to get a "random" seed
+    _seed = (unsigned long)( time( 0 ) );
+    ostrstream s;
+    s << _seed;
+    parser.setParamValue("--seed", s.str());	   // so it will be printed out in the status file, and canbe later re-used to re-run EXACTLY the same run
+  }
+  //#error This does not work: load and save the entire state of the rng object.
+  rng.reseed(_seed);
+
+  return;
+}
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoParserUtils.h b/trunk/paradiseo-eo/src/obsolete/eoParserUtils.h
new file mode 100644
index 000000000..742c4b58c
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoParserUtils.h
@@ -0,0 +1,24 @@
+/*-------------------------------------------------------
+File..........: eoParserUtils.h
+Author........: Geneura Team, Marc Shoenauer 
+                (this file: Victor Rivas, vrivas@ujaen.es)
+Date..........: 17-Dec-1999
+Description...: Some useful things that use eoParser.
+Modifications.:
+------------------- 1 -------------------
+ Author.......:
+ Date.........:
+ Description..: 
+*/
+
+#ifndef EO_PARSER_UTILS
+#define EO_PARSER_UTILS
+
+#include "../utils/eoRNG.h"
+#include "eoParser.h"
+/// Reproducible random seed
+
+//----------------------------------
+void InitRandom( Parser & parser);
+//----------------------------------
+#endif
diff --git a/trunk/paradiseo-eo/src/obsolete/eoPopOps.h b/trunk/paradiseo-eo/src/obsolete/eoPopOps.h
new file mode 100644
index 000000000..bd1dbf687
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoPopOps.h
@@ -0,0 +1,142 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eoPopOps.h 
+   (c) GeNeura Team, 1998
+ 
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+   Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _EOPOPOPS_H
+#define _EOPOPOPS_H
+
+using namespace std;
+
+/**
+@author Geneura Team
+@version 0.0
+
+@version 0.1 : -MS- 22/10/99
+    added the added the derived class eoSelectOne for which you only have
+          to define the selection of 1 individual 
+          (e.g. for tournament, age selection in SSGA, ...)
+    added at the BASE level (after all it's themost frequen case)
+          the pure virtual operator that selects one single individual:
+          EOT eoSelect::operator ( const eoPop& _parents, 
+				        const EOT& _first = 0)
+    added the optional second parameter to transform::operator()
+*/
+
+//-----------------------------------------------------------------------------
+#include 
+
+//-----------------------------------------------------------------------------
+/** eoTransform is a class that transforms or does something on a population.
+ */
+template
+class eoMonPopOp: public eoObject{
+
+ public:
+  /** ctor */
+  eoMonPopOp() {};	
+  
+  /// Dtor
+  virtual ~eoMonPopOp(){};
+  
+  /// Pure virtual transformation function. Does something on the population
+  virtual void operator () ( eoPop& _pop ) = 0;
+  
+  /** @name Methods from eoObject	*/
+  //@{
+  /** readFrom and printOn are not overriden
+   */
+  /** Inherited from eoObject. Returns the class name.
+      @see eoObject
+  */
+  virtual std::string className() const {return "eoMonPopOp";};
+  //@}
+  
+};
+
+//-----------------------------------------------------------------------------
+
+/** eoSelect usually takes elements from one population, with or without transformation, and transfers them to the other population */
+template
+class eoBinPopOp: public eoObject{
+
+ public:
+  /** ctor
+   */
+  eoBinPopOp() {};	
+
+  /// Dtor
+  virtual ~eoBinPopOp(){};
+
+  /** Pure virtual transformation function. Extracts something from the parents,
+      and transfers it to the siblings
+      @param _parents the initial generation. Will be kept constant
+      @param _siblings the created offspring. Will be usually an empty population
+  */
+  virtual void operator () (eoPop& _parents, eoPop& _siblings ) = 0;
+
+  /** @name Methods from eoObject	*/
+  //@{
+  /** readFrom and printOn are not overriden
+   */
+  /** Inherited from eoObject. Returns the class name.
+      @see eoObject
+  */
+  virtual std::string className() const {return "eoBinPopOp";};
+  //@}
+
+};
+
+//-----------------------------------------------------------------------------
+
+/** eoSelectone selects only one element from a whole population. Usually used to 
+    select mates*/
+template
+class eoSelectOne: public eoObject{
+
+ public:
+  /** ctor
+   */
+  eoSelectOne() {};	
+
+  /// Dtor
+  virtual ~eoSelectOne(){};
+
+  /** Pure virtual transformation function. Extracts something from the parents,
+      and transfers it to the siblings
+      @param _parents the initial generation. Will be kept constant
+      @param _siblings the created offspring. Will be usually an empty population
+  */
+  virtual const EOT& operator () ( const eoPop& _parents ) = 0;
+
+  /** @name Methods from eoObject	*/
+  //@{
+  /** readFrom and printOn are not overriden
+   */
+  /** Inherited from eoObject. Returns the class name.
+      @see eoObject
+  */
+  virtual std::string className() const {return "eoSelectOne";};
+  //@}
+
+};
+#endif
diff --git a/trunk/paradiseo-eo/src/obsolete/eoProblem.h b/trunk/paradiseo-eo/src/obsolete/eoProblem.h
new file mode 100644
index 000000000..5c219123e
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoProblem.h
@@ -0,0 +1,45 @@
+//-----------------------------------------------------------------------------
+
+// eoProblem.h
+
+// (c) GeNeura Team 1998
+
+/* 
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef EOPROBLEM_H
+#define EOPROBLEM_H
+
+//-----------------------------------------------------------------------------
+
+template class Problem
+{
+ public:
+  typedef T Chrom;
+  typedef typename T::Gene Gene;
+  typedef typename T::Fitness Fitness;
+  
+  virtual Fitness operator()(const Chrom& chrom) = 0;
+};
+
+//-----------------------------------------------------------------------------
+
+#endif EOPROBLEM_H
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoProportional.h b/trunk/paradiseo-eo/src/obsolete/eoProportional.h
new file mode 100644
index 000000000..7116e7863
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoProportional.h
@@ -0,0 +1,71 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoProportional.h
+// (c) GeNeura Team, 1998 - EEAAX 1999, Maarten Keijzer 2000
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoProportional_h
+#define eoProportional_h
+
+//-----------------------------------------------------------------------------
+
+#include 
+#include 
+#include 
+
+//-----------------------------------------------------------------------------
+/** eoProportional: select an individual proportional to her stored fitness
+    value 
+
+*/
+//-----------------------------------------------------------------------------
+
+template  class eoProportional: public eoSelectOne 
+{
+public:
+  /// Sanity check
+  eoProportional(const eoPop& pop = eoPop()): 
+    total((pop.size() == 0) ? -1.0 : sum_fitness(pop))
+  {
+    if (minimizing_fitness())
+      throw std::logic_error("eoProportional: minimizing fitness");
+  }
+
+  void setup(const eoPop& _pop)
+  {
+    total = sum_fitness(_pop);
+  }
+    
+  /** do the selection, call roulette_wheel. 
+   */
+  const EOT& operator()(const eoPop& _pop) 
+  {
+    return roulette_wheel(_pop, total) ;
+  }
+
+private :
+  typename EOT::Fitness total;
+};
+
+#endif 
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoProportionalGOpSel.h b/trunk/paradiseo-eo/src/obsolete/eoProportionalGOpSel.h
new file mode 100644
index 000000000..a52bac60f
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoProportionalGOpSel.h
@@ -0,0 +1,51 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+    -----------------------------------------------------------------------------
+    eoProportionalGOpSel.h
+      Proportional operator selector, selects operators proportionally to its rate
+
+    (c) Maarten Keijzer, GeNeura Team 1998, 1999, 2000
+ 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+*/
+
+#ifndef eoProportionalGOpSel_h
+#define eoProportionalGOpSel_h
+
+//-----------------------------------------------------------------------------
+
+#include   // eoOpSelector
+
+template  
+class eoProportionalGOpSel : public eoGOpSelector
+{
+public :
+  eoProportionalGOpSel() : eoGOpSelector() {}
+  
+  /** Returns the operator proportionally selected */
+  virtual eoGeneralOp& selectOp()
+    {
+      unsigned what = rng.roulette_wheel(getRates());
+      return *operator[](what);
+    }
+
+   ///
+  virtual std::string className() const { return "eoGOpSelector"; };
+
+};
+
+#endif eoProportionalGOpSel_h
diff --git a/trunk/paradiseo-eo/src/obsolete/eoProportionalOpSel.h b/trunk/paradiseo-eo/src/obsolete/eoProportionalOpSel.h
new file mode 100644
index 000000000..72c17dc2c
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoProportionalOpSel.h
@@ -0,0 +1,158 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+
+
+//-----------------------------------------------------------------------------
+
+// eoProportionalOpSel.h
+
+// (c) GeNeura Team 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef EOPROPORTIONALOPSEL_H
+#define EOPROPORTIONALOPSEL_H
+
+//-----------------------------------------------------------------------------
+
+#include   // std::runtime_error
+#include    // greater 
+#include 
+
+// Includes from EO
+#include 
+#include 
+#include 
+
+//-----------------------------------------------------------------------------
+/** This class selects operators according to probability. All operator percentages
+should add up to one; if not, an std::exception will be raised.\\
+Operators are represented as std::pairs (proportion,operator)
+*/
+template
+class eoProportionalOpSel: public eoOpSelector, 
+	public  multimap*,greater >
+{
+public:
+
+  typedef multimap*,greater > MMF;
+
+  /// default ctor
+  eoProportionalOpSel()
+    : eoOpSelector(), MMF(), opID(1) {};
+
+  /// virtual dtor
+  virtual ~eoProportionalOpSel() {};
+
+  /** Gets a non-const reference to an operator, so that it can be changed, 
+    modified or whatever 
+    @param _id  a previously assigned ID
+    @throw std::runtime_error if the ID does not exist*/
+ 
+  virtual eoOp& getOp( ID _id ) {
+     MMF::iterator i=begin();
+     ID j = 1;
+     while ( (i++!=end()) &&  (j++ != _id) );
+     if ( i == end() ) 
+       throw std::runtime_error( "No such id in eoProportionalOpSel::op\n" );
+     return *(i->second);
+	 //return i->second;
+  }
+
+  /** add an operator to the operator set
+	@param _op a genetic operator, that will be applied in some way
+	@param _arg an argument to the operator, usually operator rate
+	@return an ID that will be used to identify the operator
+	*/
+  virtual ID addOp( eoOp& _op, float _arg ) {
+    insert( MMF::value_type( _arg,&             _op ) );
+    return opID++;
+  }	
+
+  /** Remove an operator from the operator set
+    @param _id a previously assigned ID
+    @throw std::runtime_error if the ID does not exist
+    */
+  virtual void deleteOp( ID _id ) {
+    unsigned j;
+    MMF::iterator i;
+    for ( i=begin(), j=1; i!=end(); i++,j++ ) {
+      if( j == _id ) 
+	erase( i );
+      return;
+    }
+    if ( i == end() ) 
+      throw std::runtime_error( "No such id in eoProportionalOpSel::op\n" );
+  };
+
+  /// Returns a genetic operator according to the established criteria
+  virtual eoOp* Op() {
+    // Check that all add up to one
+    float acc = 0;
+    MMF::iterator i;
+    unsigned j;
+    for ( i=begin(), j=1; i!=end(); i++,j++ ) {
+      acc +=i->first;
+    }
+    if ( acc != 1.0 )
+      throw std::runtime_error( "Operator rates added up different from 1.0" );
+	
+    // If here, operators ordered by rate and no problem
+    float aRnd = rng.uniform();
+    i=begin();
+    acc = 0;
+    do {
+      acc += i->first;
+    } while ( (acc <= aRnd ) && (i++!=end() ) );
+	if ( i == end() )
+		throw std::runtime_error( "Operator not found in eoProportionalOpSelector" );
+	return i->second;
+	//return i->second;
+  }
+
+    /// Methods inherited from eoObject
+    //@{
+
+    /** Return the class id. 
+      @return the class name as a std::string
+      */
+    virtual std::string className() const { return "eoProportionalOpSel"; };
+
+    /** Print itself: inherited from eoObject implementation. Declared virtual so that 
+      it can be reimplemented anywhere. Instance from base classes are processed in
+      base classes, so you don´t have to worry about, for instance, fitness.
+      @param _s the std::ostream in which things are written*/
+    virtual void printOn( std::ostream& _s ) const{
+		_s << className().c_str() << std::endl;
+		for ( MMF::const_iterator i=begin(); i!=end(); i++ ) {
+			_s << i->first << "\t" << *(i->second )<< std::endl;
+		}
+    }
+
+
+    //@}
+
+  private:
+    ID opID;
+  };
+
+  //-----------------------------------------------------------------------------
+
+#endif EO_H
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoRandomBreed.h b/trunk/paradiseo-eo/src/obsolete/eoRandomBreed.h
new file mode 100644
index 000000000..61b76e08d
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoRandomBreed.h
@@ -0,0 +1,200 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoRandomBreed.h
+// (c) GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _EORANDOMBREED_H
+#define _EORANDOMBREED_H
+
+#include 
+
+/** Takes those on the selection std::list and creates a std::list of new individuals
+ * Destroys the genetic pool */
+template
+class EORandomBreed: public EOBreeder{
+public:
+
+  typedef std::vector< EOOp * > vecOpT;
+
+  /// Ctor
+  EORandomBreed():vecOp() {};
+
+  /** Copy ctor
+   * Needs a copy ctor for the EO operators */
+  EORandomBreed( const EORandomBreed&  _rndBreeder)
+    :vecOp() {
+      copy( _rndBreeder.vecOp.begin(), _rndBreeder.vecOp.end(), 
+	    vecOp.begin() );
+  };
+
+  /// Dtor
+  virtual ~EORandomBreed() {};
+
+  /// Adds a genetic operator to the Breeder with a rate
+  virtual void addOp( EOOp* _eop )  {	
+    vecOp.push_back( _eop);
+  };
+
+  /// Takes the operator pointed to from the operator std::list
+  virtual void deleteOp( const EOOp* _eop);
+
+  /** Takes the genetic pool, and returns next generation, destroying the
+   * genetic pool container
+   * Non-const because it might order the operator std::vector. In this case, 
+   * it mates all members of the population randomly */
+  virtual void operator() ( EOPop< EOT >& _ptVeo );
+
+// I don´t like this, but I need it for the RandomBreedLog
+protected:
+  vecOpT vecOp;
+
+};
+
+
+//_________________________ IMPLEMENTATIONS _____________________________
+
+template< class EOT>
+void EORandomBreed::deleteOp( const EOOp* _eop)  {
+    vecOpT::iterator i;
+    for ( i = vecOp.begin(); i != vecOp.end(); i++ ) {
+		if ( *i == _eop ) {
+			vecOp.erase( i );
+		}
+    }
+}
+
+//________________________________________________________________________
+template
+void EORandomBreed::operator() ( EOPop< EOT >& _ptVeo )  { 
+	
+    unsigned select= _ptVeo.size(); // New population same size than old
+    sort( vecOp.begin(), vecOp.end(), SortEOpPt() );
+	
+    unsigned i;
+    float totalPriority = 0;
+    for ( i = 0; i < vecOp.size(); i ++ ) {
+      totalPriority += vecOp[i]->Priority();
+    }
+    
+    unsigned inLen = _ptVeo.size(); // size of in subPop
+    for ( i = 0; i < select; i ++ ) {
+      // Create an alias of a random input EO with copy ctor
+      EOT& newEO = _ptVeo[ i ];
+      
+      // Choose operator
+      float randomDraw = totalPriority *(rand() % 1000) /1000.0;
+      vecOpT::const_iterator j;
+      float accumulated = 0;
+      for ( j = vecOp.begin(); 
+	    ( j != vecOp.end() ) && ( accumulated < randomDraw); 
+	    j ++ ) {
+	accumulated+= (*j)->Priority(); // the priority
+      }
+      
+      if ( j != vecOp.begin() ) 
+	j--;			// previous one
+      EOOp* thisOp = *j;
+      
+      if (thisOp->readArity() == unary ) {
+	MonOp* mopPt = dynamic_cast< MonOp* > ( thisOp );
+	(*mopPt)( newEO );
+      } else {
+	unsigned chosenMatch = rand() % inLen;
+	BinOp* bopPt = dynamic_cast< BinOp* > ( thisOp );
+	(*bopPt)( newEO, _ptVeo[chosenMatch] );
+      }
+      
+    }	
+}
+
+#include 		// For factory
+
+/** Exactly as RandomBreed, except that uses  factories*/
+template
+class EORandomBreedLog: public EORandomBreed{
+public:
+
+  typedef std::vector< EOOp * > vecOpT;
+
+  /// Ctor
+  EORandomBreedLog( EOFactory & _eof ):EORandomBreed(), factory( _eof ) {};
+
+  /** Copy ctor
+   * Needs a copy ctor for the EO operators */
+  EORandomBreedLog( const EORandomBreedLog&  _rndBreeder)
+	  :EORandomBreed( _rndBreeder ), factory( _rndBreeder.factory) {};
+
+  /// Dtor
+  virtual ~EORandomBreedLog() {};
+
+  /** Takes the genetic pool, and returns next generation, destroying the
+  * genetic pool container
+  * Non-const because it might order the operator std::vector. In this case, it mates
+  * all population randomly */
+  virtual void operator() ( EOPop< EOT >& _ptVeo )  { 
+	  
+	  unsigned select= _ptVeo.size(); // New population same size than old	  
+	  sort( vecOp.begin(), vecOp.end(), SortEOpPt() );
+	  
+	  unsigned i;
+	  float totalPriority = 0;
+	  for ( i = 0; i < vecOp.size(); i ++ ) {
+		  totalPriority += vecOp[i]->Priority();
+	  }
+	  
+	  unsigned inLen = _ptVeo.size(); // size of in subPop
+	  for ( i = 0; i < select; i ++ ) {
+		  // Create a copy of a random input EO with copy ctor
+		  EOT* newEO = factory.make( _ptVeo[ i ] );
+		  
+		  // Choose operator
+		  float randomDraw = totalPriority *(rand() % 1000) /1000.0;
+		  vecOpT::const_iterator j;
+		  float accumulated = 0;
+		  for ( j = vecOp.begin(); 
+		  ( j != vecOp.end() ) && ( accumulated < randomDraw); 
+		  j ++ ) {
+			  accumulated+= (*j)->Priority(); // the priority
+		  }
+		  
+		  if ( j != vecOp.begin() ) 
+			  j--;			// previous one
+		  EOOp* thisOp = *j;
+		  
+		  if (thisOp->readArity() == unary ) {
+			  MonOp* mopPt = dynamic_cast< MonOp* > ( thisOp );
+			  (*mopPt)( *newEO );
+		  } else {
+			  unsigned chosenMatch = rand() % inLen;
+			  BinOp* bopPt = dynamic_cast< BinOp* > ( thisOp );
+			  (*bopPt)( *newEO, _ptVeo[chosenMatch] );
+		  }
+		  
+	  }
+
+  };
+private:
+  EOFactory& factory;
+ 
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/obsolete/eoRandomIndiSelector.h b/trunk/paradiseo-eo/src/obsolete/eoRandomIndiSelector.h
new file mode 100644
index 000000000..990c6c4ad
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoRandomIndiSelector.h
@@ -0,0 +1,53 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+  -----------------------------------------------------------------------------
+  eoRandomIndiSelector.h
+    Selects individuals at random.
+
+ (c) Maarten Keijzer (mkeijzer@mad.scientist.com) and GeNeura Team, 1999, 2000
+ 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+
+#ifndef eoRandomIndiSelector_h
+#define eoRandomIndiSelector_h
+
+#include 
+
+/**
+\ingroup selectors
+ * eoRandomSelector: just selects a random child
+*/
+template 
+class eoRandomIndiSelector : public eoPopIndiSelector
+{
+    public :
+
+    eoRandomIndiSelector(void) : eoPopIndiSelector() {}
+    virtual ~eoRandomIndiSelector(void) {}
+
+    /// very complex function that returns just an individual
+    const EOT& do_select(void) 
+    {
+        return operator[](rng.random(size()));
+    }
+
+};
+
+#endif
+
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoRandomSelect.h b/trunk/paradiseo-eo/src/obsolete/eoRandomSelect.h
new file mode 100644
index 000000000..26faa9eae
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoRandomSelect.h
@@ -0,0 +1,130 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+
+
+//-----------------------------------------------------------------------------
+// eoRandomSelect.h
+
+// (c) GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef EORANDOMSELECT_H
+#define EORANDOMSELECT_H
+
+//-----------------------------------------------------------------------------
+
+#include 
+#include     // for accumulate
+
+#include 
+
+#include 
+#include 
+
+//-----------------------------------------------------------------------------
+
+/** 
+ * eoRandomSelect: an selection operator, which selects randomly a percentage
+
+ of the initial population.
+ */
+template class eoRandomSelect: public eoBinPopOp
+{
+ public:
+  ///
+  eoRandomSelect(const float& _percent = 0.4): 
+    eoBinPopOp(), repRate(_percent) {};
+  
+  ///
+  virtual ~eoRandomSelect() {};
+  
+  /// Takes a percentage of the population randomly, and transfers it to siblings
+  virtual void operator() ( eoPop& _parents, eoPop& _siblings )  {
+    // generates random numbers
+    unsigned num_chroms = (unsigned)(repRate * _parents.size());
+
+    // selection of chromosomes
+    do {
+      _siblings.push_back(_parents[rng.random(_parents.size())]);
+    } while (_siblings.size() < num_chroms);
+  }
+
+
+
+    /// @name Methods from eoObject
+
+  //@{
+
+  /**
+
+   * Read object. Reads the percentage
+
+   * Should call base class, just in case.
+
+   * @param _s A std::istream.
+
+   */
+
+  virtual void readFrom(std::istream& _s) {
+
+	_s >> repRate;
+
+  }
+
+
+
+  /** Print itself: inherited from eoObject implementation. Declared virtual so that 
+
+      it can be reimplemented anywhere. Instance from base classes are processed in
+
+	  base classes, so you don´t have to worry about, for instance, fitness.
+
+  @param _s the std::ostream in which things are written*/
+
+  virtual void printOn( std::ostream& _s ) const{
+
+	_s << repRate;
+
+  }
+
+
+
+  /** Inherited from eoObject 
+
+      @see eoObject
+
+  */
+
+  std::string className() const {return "eoRandomSelect";};
+
+
+
+  //@}
+
+
+
+
+ private:
+  float repRate;
+};
+
+//-----------------------------------------------------------------------------
+
+#endif EOGSRANDOMSELECT_H
diff --git a/trunk/paradiseo-eo/src/obsolete/eoRank.h b/trunk/paradiseo-eo/src/obsolete/eoRank.h
new file mode 100644
index 000000000..588fb1dab
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoRank.h
@@ -0,0 +1,140 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+
+
+//-----------------------------------------------------------------------------
+
+// eoRank.h
+
+// (c) GeNeura Team 1999
+
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+
+
+#ifndef _eoRank_H
+
+#define _eoRank_H
+
+
+#include 
+
+#include 
+
+
+/**
+ * Takes those on the selection std::list and creates a std::list of new individuals
+ * Destroys the genetic pool. There's no requisite on EOT, other than the 
+ * genetic operators can be instantiated with it, so it fully depstd::ends on 
+ * the genetic operators used. If generic genetic operators are used, then 
+ * EOT must be an EO 
+ */
+
+template
+class eoRank: public eoSelect, public eoObject, public eoPrintable
+{
+ public:
+  
+  /// Ctor
+  eoRank( unsigned _newPopSize, eoOpSelector& _opSelector)
+	  :eoSelect(), opSelector( _opSelector ), repNewPopSize( _newPopSize ) {};
+    
+  /// Dtor
+  virtual ~eoRank() {};
+  
+  /** Takes the genetic pool, and returns next generation, destroying the
+   * genetic pool container
+   * Non-const because it might order the operator std::vector*/
+  virtual void operator() (	const eoPop< EOT >& _ptVeo, 
+
+							eoPop< EOT >& _siblings  ) const { 
+    
+    unsigned inLen = _ptVeo.size(); // size of subPop
+    if ( !inLen ) 
+      throw std::runtime_error( "zero population in eoRank");
+
+    for ( unsigned i = 0; i < repNewPopSize; i ++ ) {
+      // Create a copy of a random input EO with copy ctor. The members of the
+		// population will be selected by rank, with a certain probability of
+		// being selected several times if the new population is bigger than the
+		// old
+
+		EOT newEO =  _ptVeo[ i%inLen ];
+    
+		// Choose operator
+		
+        const eoOp& thisOp = opSelector.Op();
+		if ( thisOp.readArity() == unary ) {
+			const eoMonOp& mopPt = dynamic_cast< const eoMonOp& > ( thisOp );
+			mopPt( newEO );
+		} else {
+			const eoBinOp& bopPt = dynamic_cast< const eoBinOp& > ( thisOp );
+
+			EOT mate =  _ptVeo[ rng.random(inLen) ];
+			bopPt( newEO, mate );
+		}      
+		
+
+		_siblings.push_back( newEO );
+    }
+  };
+
+  /** This is a _new_ function, non defined in the parent class
+   * It´s used to set the selection rate */
+  void select( unsigned _select ) {
+    repNewPopSize = _select;
+  }
+
+
+  
+
+      /// Methods inherited from eoObject
+
+    //@{
+
+
+
+    /** Return the class id. 
+
+      @return the class name as a std::string
+
+      */
+
+    virtual std::string className() const { return "eoRank"; };
+
+    virtual void printOn( std::ostream& _s ) const
+    {
+  		_s << repNewPopSize;
+    };
+
+
+
+
+
+    //@}
+
+
+private:
+  eoOpSelector & opSelector;
+  unsigned repNewPopSize;
+  
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/obsolete/eoScheme.h b/trunk/paradiseo-eo/src/obsolete/eoScheme.h
new file mode 100644
index 000000000..a66695b0f
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoScheme.h
@@ -0,0 +1,360 @@
+// eoScheme.h
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoScheme.h 
+// (c) GeNeura Team, 1998 - EEAAX 1999
+/* 
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+   Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _EOSCHEME_H
+#define _EOSCHEME_H
+
+using namespace std;
+
+/**
+@author Geneura Team -- EEAAX 99
+@version 0.0
+                   Evolution scheme
+
+
+ It seems to me that some important conceptual object is missing
+   (and God knows I hate turning everything into objects!
+
+ So here is the evolution scheme: 
+
+ regroups selection (nb of offspring to generate AND selection method
+ and replacement (from parents + offspring)
+
+ allows to include elitism, eugenism of the worst, ... more easily
+
+ a generation is then simply an evolution scheme and some operators
+ and a full algo is a generation + a termination condition
+
+ this is mainly a container class
+*/
+
+//-----------------------------------------------------------------------------
+
+#include 
+#include "eoStochTournament.h"
+#include "eoDetTournament.h"
+#include "eoLottery.h"
+#include "eoUniformSelect.h"
+#include "eoInclusion.h"
+#include "eoESReplace.h"
+#include "eoEPTournament.h"
+
+/** eoScheme is a class that does more sophisticated evolution that eoEasyEA
+ */
+template
+class eoScheme: public eoAlgo{
+
+ public:
+  
+  // Dtor
+  virtual ~eoScheme() {};
+
+  // copy ctor is impossible because of pointers to pure virual types.
+  // any idea???? --- leave the default copy ctor -- JJ
+
+  /** the Parser-based constructor
+   these switch cases could be turned into as many subclasses 
+   - but how do you return the subclass to the caller of the constructor???
+  */
+  eoScheme(Parser & parser) {
+    // read the popsize 
+    parser.AddTitle("Description of evolution");
+    std::string Evol;
+    std::string SelectString;
+    // temporary
+    float rate_offspring;
+    
+    try {
+      Evol = parser.getString("-EE", "--evolution", "GGA", 
+			      "Evolution scheme (GGA, SSGA, ESPlus, ESComma, EP, General)" );
+      popsize = parser.getInt("-EP", "--population", "10", 
+			      "Population size" );
+    }
+    catch (std::exception & e)
+      {
+	std::cout << e.what() << std::endl;
+	parser.printHelp();
+	exit(1);
+      }
+    // now the big switch
+    if (! strcasecmp(Evol.c_str(), "GGA") ) {
+      // GGA parameters: popsize, selection method (and its parameters) 
+      nb_offspring = 0;
+      rate_offspring = 1.0;	// generational replacement: #offspring=popsize
+      try { 
+	//      parser.AddTitle("GGA Parameters");
+	SelectString = parser.getString("-ES", "--selection", "Tournament", 
+					"Selection method (Roulette, tournament)" );
+	if (! strcasecmp(SelectString.c_str(), "roulette") ) {
+	  ptselect = new eoLottery ();
+	  ptselect_mate = new eoLottery ();
+	} 
+	if (! strcasecmp(SelectString.c_str(), "tournament") ) {
+	  float rate = parser.getFloat("-Et", "--TselectSize", "2", 
+				       "Tournament size or rate" );
+	  if (rate < 0.5)
+	    throw out_of_range("Invalid tournament rate");
+	  else if ( rate < 1 ) {     // binary stochastic tournament
+	    ptselect = new eoStochTournament(rate); 
+	    ptselect_mate = new eoStochTournament(rate); 
+	  } else { // determeinistic tournament of size (int)rate
+	    ptselect = new eoDetTournament((int)rate);
+	    ptselect_mate = new eoDetTournament((int)rate);
+	  }
+	}
+	// end choice of selection
+	ptreplace = new eoInclusion();
+	// put here the choice of elitism
+      } 
+      catch (std::exception & e)
+	{
+	  std::cout << e.what() << std::endl;
+	  parser.printHelp();
+	  exit(1);
+	}
+    }  // end of GGA	
+    
+    // SSGA - standard, one offspring only at the moment
+    if (! strcasecmp(Evol.c_str(), "SSGA") ) {
+      // SSGA parameters: popsize, selection tournament size
+      // the replacement is limited to repace_worst, though
+      // it could be easy to add the anti-tournament replacement method
+      nb_offspring = 1;
+      // NOTE: of course it's a bit of a waste to use the standard loop
+      // for one single offspring ...
+      try { 
+	//      parser.AddTitle("SSGA Parameters");
+	float _rate = parser.getFloat("-ET", "--TSelectSize", "2", 
+				      "Selection tournament size" );
+	if ( _rate < 1 ) {     // binary stochastic tournament
+	  ptselect = new eoStochTournament(_rate); 
+	  ptselect_mate = new eoStochTournament(_rate); 
+	} else { // determeinistic tournament of size (int)rate
+	  ptselect = new eoDetTournament((int)_rate);
+	  ptselect_mate = new eoDetTournament((int)_rate);
+	}
+      }
+      catch (std::exception & e)
+	{
+	  std::cout << e.what() << std::endl;
+	  parser.printHelp();
+	  exit(1);
+	}
+      // end choice of selection
+      ptreplace = new eoInclusion();
+      // put here the choice of elitism
+    }  // end of SSGA	
+    
+    if (! strcasecmp(Evol.c_str(), "ESPlus") ) {
+      // ES evolution parameters: lambda = _nb_offspring
+      
+      try { 
+	//      parser.AddTitle("ES Scheme parameters");
+	nb_offspring = parser.getInt("-EL", "--lambda", "50", 
+				     "Lambda" );
+	ptselect = new eoUniformSelect();
+	ptselect_mate = new eoUniformSelect();
+	ptreplace =  new eoESPlus();
+      } 
+      catch (std::exception & e)
+	{
+	  std::cout << e.what() << std::endl;
+	  parser.printHelp();
+	  exit(1);
+	}
+    }  // end of ESPlus
+    
+    if (! strcasecmp(Evol.c_str(), "ESComma") ) {
+      // ES evolution parameters: lambda = _nb_offspring
+      
+      try { 
+	//      parser.AddTitle("ES Scheme parameters");
+	nb_offspring = parser.getInt("-EL", "--lambda", "50", 
+				     "Lambda" );
+	ptselect =  new eoUniformSelect();
+	ptselect_mate =  new eoUniformSelect();
+	ptreplace = new eoESComma();
+      } 
+      catch (std::exception & e)
+	{
+	  std::cout << e.what() << std::endl;
+	  parser.printHelp();
+	  exit(1);
+	}
+    }  // end of ESCOmma
+    
+    if (! strcasecmp(Evol.c_str(), "EP") ) {
+      // EP evoltion scheme: only the EP-tournament replacement size is neede
+      
+      try { 
+	//      parser.AddTitle("EP Scheme parameters");
+	nb_offspring = popsize;
+	ptselect =  new eoCopySelect;		/* no selection */
+	ptselect_mate =  new eoUniformSelect();
+				/* What, crossover in EP :-) */
+	unsigned tsize = parser.getInt("-ET", "--TournamentSize", "6", 
+				       "Size of stocahstic replacement tournament" );
+	ptreplace = new eoEPTournament(tsize);
+      } 
+      catch (std::exception & e)
+	{
+	  std::cout << e.what() << std::endl;
+	  parser.printHelp();
+	  exit(1);
+	}
+    }  // end of EP
+    
+    
+    // everyting is read: now the consistency checks and other preliminary steps
+    nb_offspring = (nb_offspring ? nb_offspring : 
+		    (int) (rate_offspring * popsize) );
+    if (!nb_offspring)
+      nb_offspring = 1;		/* al least one offspring */
+    
+  }
+  
+  
+  // accessors
+  unsigned PopSize(){return popsize;}
+  unsigned NbOffspring(){return nb_offspring ;}
+  eoSelect* PtSelect(){return ptselect;}
+  eoSelect* PtSelectMate(){return ptselect_mate;}
+  eoMerge* PtMerge() {return ptreplace;}
+  // NOTE: need pointers otherwise you have many warnings when initializing  
+
+  /** @name Methods from eoObject	*/
+  //@{
+  /** Inherited from eoObject. Returns the class name.
+      @see eoObject
+  */
+  std::string className() const {return "eoScheme";};
+  //@}
+ private:
+  unsigned popsize;		/* but should it be here ??? */
+  unsigned nb_offspring;	/* to generate through selection+operators */
+
+  // these are provisional for later use
+
+  //  float rate_offspring;		/* or rate */
+  //  unsigned nb_survive;		/* the best guys that are transmitted anyway */
+  //  float rate_survive;		/* or rate */
+  //  unsigned nb_die;	  /* the worst guys that do not enev enter selection */
+  //  float rate_die;		/* or rate */
+
+  eoSelect *    ptselect;
+  eoSelect*    ptselect_mate;
+  eoMerge*     ptreplace;
+  bool elitism;	     /* put back old best in the new population if necessary */
+};
+/* examples:
+   for most populat schemes, nb_survive = nb_die = 0
+   in GGA and EP, nb_offspring = pop.size()
+   in ES, nb_offspring = lambda
+   in SSGA, nb_offspring = 1 (usually)
+
+   elitism can be used anywhere - though stupid in ES, EP and SSGA who are 
+        estd::list by definition
+*/
+
+#endif _EOSCHEME_H
+
+/* 
+  /////////////////////////////////
+  /// Applies one generation of evolution to the population.
+  virtual void operator()(eoPop& pop) {
+    // Determine the number of offspring to create
+    // either prescribed, or given as a rate
+    unsigned nb_off_local = (nb_offspring ? nb_offspring : 
+			 (int) rint (rate_offspring * pop.size()) );
+    nb_off_local = (nb_off_local ? nb_off_local : 1);   // in case it is rounded to 0!
+      
+    // the worst die immediately
+    unsigned nb_die_local = (nb_die ? nb_die : 
+			 (int) rint (rate_die * pop.size()) );
+    // and the best will survive without selection
+    unsigned nb_survive_local = (nb_survive ? nb_survive : 
+			 (int) rint (rate_survive * pop.size()) );
+
+    // before selection, erase the one to die
+    // sort old pop - just in case!
+    sort(pop.begin(), pop.end(), greater());
+    Fitness oldBest = pop[0].fitness();    // store for elitism
+    eoPop fertilepop = pop;
+    if (nb_die_local)
+	erase(fertilepop.end()-nb_die_local, fertilepop.end());
+    
+    eoPop offspring;    // = select(fertilepop, nb_off_local);
+    select(fertilepop, offspring, nb_off_local);
+
+    // now apply the operators to offspring
+    for (unsigned i=0; i* op = seqselop.Op(&id);
+      while (op) {		   // NULL if no more operator
+	EOT mate;
+	if (op->readArity() == binary) // can eventually be skipped 
+	  mate = select_mate(pop, tmp);	// though useless ig mutation
+	else
+	  mate = tmp;	   // assumed: mate will not be used!
+	std::cout << op->className() << " for offspring " << i << std::endl;
+	tmp = (*op)( tmp, mate, pop );  
+	op = seqselop.Op(&id);
+      }
+      offspring[i]=tmp;		//* where it belongs
+    }
+    
+    eoPop::iterator i;
+    // Can't use foreach here since foreach takes the 
+    // parameter by reference
+    for ( i = offspring.begin(); i != offspring.end(); i++)
+      evaluator(*i);
+
+    //XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
+    // not exact - later!!!
+    // -MS-
+
+      // first, copy the ones that need to survive
+      // assumed: pop is still sorted!
+      eoPop finalPop;
+    // and the best survive without selection
+      if (nb_survive_local) {
+	  finalPop.resize(nb_survive_local);
+	  copy( finalPop.begin(), fertilepop.begin(), 
+	        fertilepop.begin()+nb_survive_local );
+      }
+
+    // now call the replacement method
+    replace(finalPop, tmpPop);
+
+    // handle elitlism
+    sort(finalPop.begin(), finalPop.end(), greater());
+    if (elitism) {
+	if ( finalPop[0].fitness() < oldBest ) // best fitness has decreased!
+	    copy(finalPop.end()-1, pop[0]);
+    }
+    //    return finalPop;
+  }
+*/
diff --git a/trunk/paradiseo-eo/src/obsolete/eoSelectRandom.h b/trunk/paradiseo-eo/src/obsolete/eoSelectRandom.h
new file mode 100644
index 000000000..84ea72f81
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoSelectRandom.h
@@ -0,0 +1,52 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoSelectRandom.h
+// (c) GeNeura Team, 1998 - EEAAX 1999, Maarten Keijzer 2000
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoSelectRandom_h
+#define eoSelectRandom_h
+
+//-----------------------------------------------------------------------------
+
+#include 
+#include 
+
+//-----------------------------------------------------------------------------
+/** eoSelectRandom: a selection method that selects ONE individual randomly
+ -MS- 22/10/99 */
+//-----------------------------------------------------------------------------
+
+template  class eoSelectRandom: public eoSelectOne 
+{
+ public:
+  
+  /// not a big deal!!!
+  virtual const EOT& operator()(const eoPop& pop) 
+  {
+    return pop[rng.random(pop.size())] ;
+  }
+};
+
+#endif eoSelectRandom_h
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoSequentialGOpSel.h b/trunk/paradiseo-eo/src/obsolete/eoSequentialGOpSel.h
new file mode 100644
index 000000000..63acac43b
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoSequentialGOpSel.h
@@ -0,0 +1,55 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+    -----------------------------------------------------------------------------
+    eoSequentialGOpSel.h
+      Sequential Generalized Operator Selector.
+
+    (c) Maarten Keijzer (mkeijzer@mad.scientist.com), GeNeura Team 1998, 1999, 2000
+ 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+*/
+
+#ifndef eoSequentialGOpSel_h
+#define eoSequentialGOpSel_h
+
+//-----------------------------------------------------------------------------
+
+#include 
+/** eoSequentialGOpSel: return a sequence of
+    operations to be applied one after the other. The order of the 
+    operators is significant. If for instance you first add a 
+    quadratic operator and then a mutation operator, 
+
+  @see eoGeneralOp, eoCombinedOp
+*/
+template  
+class eoSequentialGOpSel : public eoGOpSelector
+{
+public :
+    
+  virtual eoGeneralOp& selectOp()
+  {    
+    return combined.bind(*this, getRates());
+  }		
+  
+private :
+  
+  eoCombinedOp combined;
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoSimpleDEA.h b/trunk/paradiseo-eo/src/obsolete/eoSimpleDEA.h
new file mode 100644
index 000000000..3eef44c79
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoSimpleDEA.h
@@ -0,0 +1,105 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoSimpleDEA.h
+// (c) Marc Schoenauer, Maarten Keijzer, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoSimpleDEA_h
+#define _eoSimpleDEA_h
+
+//-----------------------------------------------------------------------------
+
+#include 
+#include 
+#include 
+#include 
+#include 
+
+/** eoSimpleDEA: a very simple Distribution Evolution Algorithm
+ *  
+ *  The algorithm that evolves a probability distribution 
+ *  on the spaces of populations with the loop
+ *                 generate a population from the current distribution
+ *                 evaluate that population
+ *                 update the distribution
+*/
+
+template class eoSimpleDEA: public eoDEA
+{
+ public:
+
+  /** Ctor from an eoDistribUpdater
+   * ... plus an eoEval and eoContinue of course 
+   */
+  eoSimpleDEA(eoDistribUpdater& _update,
+	   eoEvalFunc& _eval,
+	   unsigned _popSize, 
+	   eoContinue& _continuator
+	   ) : 
+    update(_update),
+    eval(_eval),
+    popSize(_popSize),
+    continuator(_continuator)
+  {}
+
+  /** The algorithm: 
+   *    generate pop from distrib, 
+   *    evaluate pop, 
+   *    update distrib
+   */
+  virtual void operator()(eoDistribution& _distrib)
+  {
+    eoPop pop(popSize, _distrib);
+    do
+    {
+      try
+      {
+	apply(_distrib, pop); // re-init. of _pop from distrib
+
+	apply(eval, pop);     // eval of current population
+
+	update(_distrib, pop);     // updates distrib from _pop
+	
+      }
+      catch (std::exception& e)
+      {
+	    std::string s = e.what();
+	    s.append( " in eoSimpleDEA");
+	    throw std::runtime_error( s );
+      }
+    } while ( continuator( pop ) );
+  }
+
+ private:
+  eoDistribUpdater & update;
+
+  eoEvalFunc&          eval;
+  
+  unsigned                  popSize;
+
+  eoContinue&          continuator;
+};
+
+//-----------------------------------------------------------------------------
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoSteadyStateEA.h b/trunk/paradiseo-eo/src/obsolete/eoSteadyStateEA.h
new file mode 100644
index 000000000..caa9ebedd
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoSteadyStateEA.h
@@ -0,0 +1,84 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoSteadyStateEA.h
+// (c) GeNeura Team, 2000
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoSteadyStateEA_h
+#define _eoSteadyStateEA_h
+
+//-----------------------------------------------------------------------------
+
+#include 
+#include      
+
+/** EOSteadyStateEA:
+    An easy-to-use evolutionary algorithm, just supply
+    a general operator selector, a selector for choosing the ones
+    to reproduce and an eoSteadyStateInserter that takes care of evaluating
+    and inserter the guy/girl in the steady state population.
+*/
+template class eoSteadyStateEA: public eoAlgo
+{
+ public:
+  /// Constructor.
+  eoSteadyStateEA(
+      eoGOpSelector& _opSelector, 
+      eoSelectOne& _selector,
+      eoSteadyStateInserter& _inserter, 
+      eoContinue&     _continuator,
+      unsigned _steps = 0 )   
+      : step(_opSelector, _selector, _inserter, _steps), 
+        continuator( _continuator)
+        {};
+
+  /// Constructor from an already created generation
+  eoSteadyStateEA(eoSteadyStateTransform& _gen,
+	   eoContinue&     _continuator):
+    step(_gen), 
+    continuator( _continuator){};
+  
+  /// Apply one generation of evolution to the population.
+  virtual void operator()(eoPop& pop) {
+    do {
+      try
+	{
+	  step(pop);
+	}
+    catch (std::exception& e)
+	{
+	  std::string s = e.what();
+	  s.append( " in eoSteadyStateEA ");
+	  throw std::runtime_error( s );
+	}
+    } while ( continuator( pop ) );
+  
+  }
+    
+ private:
+  eoSteadyStateTransform  step;
+  eoContinue& continuator;
+};
+
+//-----------------------------------------------------------------------------
+
+#endif eoEasyEA_h
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoSteadyStateInserter.h b/trunk/paradiseo-eo/src/obsolete/eoSteadyStateInserter.h
new file mode 100644
index 000000000..57fd187e4
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoSteadyStateInserter.h
@@ -0,0 +1,53 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+  -----------------------------------------------------------------------------
+  eoSteadyStateInserter.h
+    Still abstract population insertion operator that is initialized with
+    and eoEvalFunc object to be able to evaluate individuals before inserting
+    them.
+
+ (c) Maarten Keijzer (mak@dhi.dk) and GeNeura Team, 1999, 2000
+ 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+
+#ifndef eoSteadyStateInserter_h
+#define eoSteadyStateInserter_h
+
+
+#include 
+#include 
+
+/**
+ * eoSteadyStateInserter: Interface class that enables an operator to update
+ * a population with a new individual... it contains an eoEvalFunc derived object to 
+ * make sure that every individual is evaluated before it is inserted
+*/
+template 
+class eoSteadyStateInserter : public eoPopInserter 
+{
+public :
+    eoSteadyStateInserter(eoEvalFunc& _eval): 
+    eoPopInserter(), 
+    eval(_eval) {}
+  
+protected :
+    eoEvalFunc& eval;
+};
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/obsolete/eoSteadyStateTransform.h b/trunk/paradiseo-eo/src/obsolete/eoSteadyStateTransform.h
new file mode 100644
index 000000000..890920a77
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoSteadyStateTransform.h
@@ -0,0 +1,88 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoSteadyStateTransform.h
+// (c) Maarten Keijzer 2000, GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoSteadyStateTransform_h
+#define eoSteadyStateTransform_h
+
+//-----------------------------------------------------------------------------
+
+#include      // eoPop
+#include  
+
+#include 
+#include 
+#include 
+
+//-----------------------------------------------------------------------------
+
+/** eoSteadyStateTransform
+ * Single step of a steady state evolutionary algorithm. 
+ * Proceeds by updating one individual at a time, by first selecting parents, 
+ * creating one or more children and subsequently overwrite (a) bad individual(s)
+*/
+template class eoSteadyStateTransform: public eoTransform
+{
+ public:
+  /// Constructor.
+  eoSteadyStateTransform(
+      eoGOpSelector& _opSelector, 
+      eoSelectOne& _selector,
+      eoSteadyStateInserter& _inserter, 
+      unsigned _steps = 0) :
+            opSelector(_opSelector), 
+            selector(_selector), 
+            inserter(_inserter) , 
+            steps(_steps) {};
+
+
+  /// Apply one generation of evolution to the population.
+  virtual void operator()(eoPop& pop) 
+  {
+      unsigned nSteps = steps;
+      if (nSteps == 0)
+      {
+          nSteps = pop.size(); // make a 'generation equivalent'
+      }
+
+      for (unsigned i = 0; i < nSteps; ++i)
+      {
+         selector.bind(pop);
+         inserter.bind(pop);
+
+         opSelector.selectOp()(selector, inserter);
+      }
+
+  }
+  
+ private:
+  eoGOpSelector&         opSelector;
+  eoSelectOneIndiSelector  selector;
+  eoSteadyStateInserter& inserter;
+  unsigned steps;
+};
+
+//-----------------------------------------------------------------------------
+
+#endif eoGeneration_h
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoStochTournament.h b/trunk/paradiseo-eo/src/obsolete/eoStochTournament.h
new file mode 100644
index 000000000..5569ce624
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoStochTournament.h
@@ -0,0 +1,69 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoStochTournament.h
+// (c) GeNeura Team, 1998 - EEAAX 1999
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoStochTournament_h
+#define eoStochTournament_h
+
+//-----------------------------------------------------------------------------
+
+#include 
+#include            // accumulate
+#include      // eoSelectOne
+#include  // stochastic_tournament
+
+//-----------------------------------------------------------------------------
+/** eoStochTournament: a selection method that selects ONE individual by
+ binary stochastic tournament 
+ -MS- 24/10/99 */
+//-----------------------------------------------------------------------------
+
+template  class eoStochTournament: public eoSelectOne
+{
+ public:
+
+  ///
+  eoStochTournament(float _Trate = 1.0 ) : eoSelectOne(), Trate(_Trate) 
+  {
+    // consistency check
+    if (Trate < 0.5) {
+      std::cerr << "Warning, Tournament rate should be > 0.5\nAdjusted to 0.55\n";
+      Trate = 0.55;
+    }
+  }
+  
+  /** Perform the stochastic tournament  */
+  virtual const EOT& operator()(const eoPop& pop) 
+  {
+      return stochastic_tournament(pop, Trate);
+  }
+  
+private:
+  float Trate;
+};
+
+//-----------------------------------------------------------------------------
+
+#endif eoDetTournament_h
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoStochTournamentInserter.h b/trunk/paradiseo-eo/src/obsolete/eoStochTournamentInserter.h
new file mode 100644
index 000000000..3856aeccb
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoStochTournamentInserter.h
@@ -0,0 +1,75 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+  -----------------------------------------------------------------------------
+  eoStochTournamentInserter.h
+    Concrete steady state inserter. It is initialized with a population and 
+    inserts individuals in the population based on an inverse stochastic
+    tournament
+
+ (c) Maarten Keijzer (mkeijzer@mad.scientist.com) and GeNeura Team, 1999, 2000
+ 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+
+#ifndef eoStochTournamentInserter_h
+#define eoStochTournamentInserter_h
+
+
+#include 
+#include 
+
+/**
+\ingroup inserters
+ * eoStochTournamentInserter: Uses an inverse stochastic tournament to figure
+ * out who gets overridden by the new individual. It resets the fitness of the
+ * individual.
+*/
+template 
+class eoStochTournamentInserter : public eoSteadyStateInserter 
+{
+public :
+  
+  eoStochTournamentInserter(eoEvalFunc& _eval, double _t_rate): 
+    eoSteadyStateInserter(_eval), t_rate(_t_rate)
+  {
+    if (t_rate < 0.5)
+      { // warning, error?
+	t_rate = 0.55;
+      }
+
+    if (t_rate >= 1.0)
+      {
+	t_rate = 0.99; // 1.0 would mean deterministic tournament
+      }
+  }
+        
+  eoInserter& operator()(const EOT& _eot)
+  {
+    EOT& eo = inverse_stochastic_tournament(pop(), t_rate);
+    eo = _eot; // overwrite loser of tournament
+        
+    eo.invalidate();
+    return *this;
+  }
+
+  std::string className(void) const { return "eoStochTournamentInserter"; }
+
+private :
+  double t_rate;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/obsolete/eoStringMutation.h b/trunk/paradiseo-eo/src/obsolete/eoStringMutation.h
new file mode 100644
index 000000000..1612da4a9
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoStringMutation.h
@@ -0,0 +1,77 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoStringMutation.h
+// (c) GeNeura Team, 1999
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _EOSTRINGMUTATION_H
+#define _EOSRTINGMUTATION_H
+
+#include 
+// EO includes
+#include 
+#include 
+#include 
+
+/** Mutation of an eoString.
+    The eoString's genes are changed by adding or substracting 1 to 
+*/
+
+template 
+class eoStringMutation: public eoMutation {
+ public:
+  
+  ///
+  eoStringMutation(const double _rate=0.0) : eoMutation< EOT >(_rate) {};
+  
+  ///
+  virtual ~eoStringMutation() {};
+  
+  /** @name Methods from eoObject
+  */
+  //@{
+  /** Inherited from eoObject 
+      @see eoObject
+  */
+  std::string className() const {return "eoStringMutation";};
+  //@}
+  
+  
+ private:
+  
+#ifdef _MSC_VER
+  typedef EOT::Type Type;
+#else
+  typedef typename EOT::Type Type;
+#endif
+  
+  /// applies operator to one gene in the EO. It increments or decrements the value of that gene by one.
+  virtual void applyAt( EOT& _eo, unsigned _i ) const {
+    if( rate < uniform() ) {
+      _eo.gene(_i) += ( rng.flip(0.5))? (1) : (-1) ;
+    }
+  }
+
+};
+
+//-----------------------------------------------------------------------------
+
+#endif
diff --git a/trunk/paradiseo-eo/src/obsolete/eoTerm.h b/trunk/paradiseo-eo/src/obsolete/eoTerm.h
new file mode 100644
index 000000000..198cb939b
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoTerm.h
@@ -0,0 +1,56 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoTerm.h
+// (c) GeNeura Team, 1999, 2000
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _EOTERM_H
+#define _EOTERM_H
+
+//#include 
+
+// forward definition for fast(er) compilation
+template  class eoPop;
+
+
+/** Termination condition for the genetic algorithm
+ * Takes the population as input, returns true for continue,
+ * false for termination (although this begs the question why this
+ * terminator is not called a continuator)
+ * 
+ */
+template< class EOT>
+class eoTerm : public eoObject {
+public:
+
+	/// Ctors/dtors
+	virtual ~eoTerm() {};
+
+	/** Returns false if the training has to stop, true if it
+	 continues \\
+	 It is non-const since it might change the internal state
+	    of the object, for instance, updating local data.
+	*/
+	virtual bool operator() ( const eoPop< EOT >& _pop ) = 0 ;
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoTournament.h b/trunk/paradiseo-eo/src/obsolete/eoTournament.h
new file mode 100644
index 000000000..01dc4619e
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoTournament.h
@@ -0,0 +1,157 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+
+
+//-----------------------------------------------------------------------------
+
+// eoTournament.h
+
+// (c) GeNeura Team, 1998
+
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+
+
+#ifndef _EOGSTOURN_H
+#define _EOGSTOURN_H
+
+
+//-----------------------------------------------------------------------------
+
+
+#include 
+#include 
+
+
+//-----------------------------------------------------------------------------
+
+
+/** Selects those who are going to reproduce using Tournament selection: 
+
+	a subset of the population of size tournamentSize is chosen, 
+
+	and the best is selected for the new population .
+@author JJ Merelo, 1998
+*/
+template
+class eoTournament:public eoBinPopOp{
+public:
+
+  /// Proportion of guys that are going to be eliminated
+  eoTournament( float _perc, unsigned _tSize): 
+    eoBinPopOp(), perc( _perc), repTournamentSize(_tSize){};
+
+  /// Virtual dtor
+  ~eoTournament(){};
+
+  /// Set tourn size
+  void tournamentSize( unsigned _size ) { repTournamentSize = _size; };
+
+  /** 
+   * Selects from the initial pop using tournament selection, and copies it
+
+   * to the other population.
+   */
+  virtual void operator() ( eoPop& _vEO, eoPop& _aVEO)  {
+    
+    unsigned thisSize = _vEO.size();
+    
+    // Build std::vector
+    for ( unsigned j = 0; j < thisSize*perc; j ++ ) {
+      // Randomly select a tournamentSize set, and choose the best
+      eoPop veoTournament;
+
+      for ( unsigned k = 0; k < repTournamentSize; k++ ) {
+	unsigned chosen = rng.random(thisSize); 
+	EOT newEO =  _vEO[chosen];
+	veoTournament.push_back( newEO );
+      }
+      
+      eoPop::const_iterator best = std::max_element(veoTournament.begin(),
+						    veoTournament.end());
+      if (best == veoTournament.end()) {
+	throw std::runtime_error("error in void eoTournament::operator(eoPop&, eoPop&)");
+      }
+      
+      // The best individual is chosen for the new population
+      _aVEO.push_back( *best ); 
+    }
+  };
+  
+
+  /// @name Methods from eoObject
+
+  //@{
+
+  /**
+
+   * Read object. Reads the percentage
+
+   * Should call base class, just in case.
+
+   * @param _s A std::istream.
+
+   */
+
+  virtual void readFrom(std::istream& _s) {
+
+	_s >> perc >> repTournamentSize;
+
+  }
+
+
+
+  /** Print itself: inherited from eoObject implementation. Declared virtual so that 
+
+      it can be reimplemented anywhere. Instance from base classes are processed in
+
+	  base classes, so you don´t have to worry about, for instance, fitness.
+
+  @param _s the std::ostream in which things are written*/
+
+  virtual void printOn( std::ostream& _s ) const{
+
+	_s << perc << std::endl << repTournamentSize << std::endl;
+
+  }
+
+
+
+  /** Inherited from eoObject 
+
+      @see eoObject
+
+  */
+
+  std::string className() const {return "eoTournament";};
+
+
+
+  //@}
+
+
+ private:
+
+	 float perc;
+  unsigned repTournamentSize;
+  
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/obsolete/eoTranspose.h b/trunk/paradiseo-eo/src/obsolete/eoTranspose.h
new file mode 100644
index 000000000..51671830a
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoTranspose.h
@@ -0,0 +1,94 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoTranspose.h
+// (c) GeNeura Team, 1998 Maarten Keijzer 2000
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _EOTRANSPOSE_h
+#define _EOTRANSPOSE_h
+
+#include 
+#include 
+
+#include 
+#include 
+#include 
+#include 
+/** 
+Transposition operator: interchanges the position of two genes
+of an EO. 
+*/
+template 
+class eoTranspose: public eoMonOp  
+{
+public:
+  
+  // Specialization for a std::vector
+  void operator()(eoFixedLength& _eo )
+  {
+    unsigned pos1 = rng.random(_eo.size()),
+    pos2 = rng.random(_eo.size());
+  
+    if (pos1 != pos2)
+        swap(_eo[pos1], _eo[pos2]);
+
+    if (_eo[pos1] != _eo[pos2])
+        _eo.invalidate();
+  }
+
+  // Specialization for a std::list
+  void operator()(eoVariableLength& _eo )
+  {
+    unsigned pos1 = rng.random(_eo.size()),
+    pos2 = rng.random(_eo.size());
+  
+    if (pos1 == pos2)
+        return;
+
+    if (pos1 > pos2)
+        swap(pos1,pos2);
+
+    pos2 -= pos1;
+    
+    typename EOT::iterator it1 = _eo.begin();
+
+    while (pos1--) {it1++;}
+
+    typename EOT::iterator it2 = it1;
+    
+    while (pos2--) {it2++;}
+
+    swap(*it1, *it2);
+
+    if (*it1 != *it2)
+        _eo.invalidate();
+  }
+  
+  /** Inherited from eoObject 
+      @see eoObject
+  */
+  virtual std::string className() const {return "eoTranspose";};
+  //@}
+    
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoUniformXOver.h b/trunk/paradiseo-eo/src/obsolete/eoUniformXOver.h
new file mode 100644
index 000000000..76623a0ec
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoUniformXOver.h
@@ -0,0 +1,176 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+
+
+//-----------------------------------------------------------------------------
+
+// eoUniformXOver.h
+
+// (c) GeNeura Team, 1998
+
+/* 
+
+    This library is free software; you can redistribute it and/or
+
+    modify it under the terms of the GNU Lesser General Public
+
+    License as published by the Free Software Foundation; either
+
+    version 2 of the License, or (at your option) any later version.
+
+
+
+    This library is distributed in the hope that it will be useful,
+
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+
+    Lesser General Public License for more details.
+
+
+
+    You should have received a copy of the GNU Lesser General Public
+
+    License along with this library; if not, write to the Free Software
+
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+
+ */
+
+//-----------------------------------------------------------------------------
+
+
+
+#ifndef _EOUNIFORMXOVER_h
+
+#define _EOUNIFORMXOVER_h
+
+
+
+
+
+// for swap
+
+#if defined( __BORLANDC__ )
+
+#include 
+
+#else
+
+#include 
+
+#endif
+
+
+
+// EO includes
+
+#include 
+
+#include 
+
+
+
+//-----------------------------------------------------------------------------
+
+/** 
+
+ * EOUniformCrossover: operator for binary chromosomes
+
+ * implementation of uniform crossover for EO
+
+ * swaps ranges of bits between the parents
+
+ */
+
+//-----------------------------------------------------------------------------
+
+
+
+template 
+
+class eoUniformXOver: public eoQuadraticOp< EOT >
+
+{
+
+ public:
+
+
+
+  ///
+
+  eoUniformXOver( float _rate = 0.5 ): 
+
+    eoQuadraticOp< EOT > (  ), rate( _rate ) {
+
+    if (rate < 0 || rate > 1)
+
+      std::runtime_error("UxOver --> invalid rate");
+
+  }
+
+  
+
+  
+
+  ///
+
+  void operator() ( EOT& chrom1, EOT& chrom2 ) const {
+
+    unsigned end = min(chrom1.length(),chrom2.length()) - 1;
+
+    // select bits to change
+
+    // aply changes
+
+    for (unsigned bit = 0; bit < end; bit++)
+
+      if (rng.flip(rate))
+
+	swap(chrom1[ bit], chrom2[ bit]);
+
+  }
+
+
+
+  /** @name Methods from eoObject
+
+      readFrom and printOn are directly inherited from eoOp
+
+  */
+
+  //@{
+
+  /** Inherited from eoObject 
+
+      @see eoObject
+
+  */
+
+  std::string className() const {return "eoUniformXOver";};
+
+  //@}
+
+
+
+private:
+
+  float rate; /// rate of uniform crossover
+
+};
+
+
+
+//-----------------------------------------------------------------------------
+
+
+
+
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoVector.h b/trunk/paradiseo-eo/src/obsolete/eoVector.h
new file mode 100644
index 000000000..315683f57
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoVector.h
@@ -0,0 +1,170 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+   -----------------------------------------------------------------------------
+   eoVector.h
+       Turns an STL std::vector into an EO
+   (c) GeNeura Team, 1998
+ 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+*/
+
+//-----------------------------------------------------------------------------
+
+#ifndef _eoVector_H
+#define _eoVector_H
+
+// STL libraries
+#include 		// For std::vector
+#include 
+#include 
+
+#include 
+#include 
+
+/** Adaptor that turns an STL std::vector into an EO
+ with the same gene type as the type with which
+ the std::vector has been instantiated
+*/
+template 
+class eoVector: public eo1d, public std::vector {
+public:
+  typedef T Type ;
+  
+  /// Canonical part of the objects: several ctors, copy ctor, dtor and assignment operator
+  //@{
+  
+  /** Ctor. 
+      @param _size Lineal length of the object
+      @param _val Common initial value
+  */
+  eoVector( unsigned _size = 0, T _val = 0)
+    : eo1d(), std::vector( _size, _val ){ };
+  
+  /** Ctor using a random number generator
+      @param _size Lineal length of the object
+      @param _rnd a random number generator, which returns a random value each time it´s called
+  */
+  eoVector( unsigned _size, eoRnd& _rnd );
+
+  /** Ctor from a std::istream. The T class should accept reading from a std::istream. It doesn't read fitness,
+which is supposed to be dynamic and dependent on environment. 
+      @param _is the input stream; should have all values in a single line, separated by whitespace
+  */
+  eoVector( std::istream& _is);
+  
+
+  /// copy ctor
+  eoVector( const eoVector & _eo )
+    : eo1d( _eo ), std::vector( _eo ){ };
+  
+  /// Assignment operator
+  const eoVector& operator =( const eoVector & _eo ) {
+    if ( this != &_eo ){
+      eo1d::operator=( _eo );
+      std::vector::operator=( _eo );
+    }
+    return *this;
+  }
+  
+  /// dtor
+  virtual ~eoVector() {};
+  
+  //@}
+  
+  /** methods that implement the eo1d protocol
+      @std::exception out_of_range if _i is larger than EO´s size
+  */
+  virtual T getGene( unsigned _i ) const {
+    if ( _i >= length() ) 
+      throw out_of_range( "out_of_range when reading gene");
+    return (*this)[_i];
+  };
+  
+  /** methods that implement the eo1d protocol
+      @std::exception out_of_range if _i is larger than EO´s size
+  */
+  virtual void setGene( unsigned _i, const T& _value ) {
+    if ( _i >= size() )
+      throw out_of_range( "out_of_range when writing a gene");
+    (*this)[_i] = _value;
+  };
+  
+  /** methods that implement the eo1d protocol
+      @std::exception out_of_range if _i is larger than EO´s size
+  */
+  virtual void insertGene( unsigned _i, T _val ) {
+    if (_i <= size() ) {
+      std::vector::iterator i = begin()+_i;
+      insert( i, _val );
+    } else {
+      throw out_of_range( "out_of_range when inserting a gene");
+    }
+  };
+
+  /** Eliminates the gene at position _i
+      @std::exception out_of_range if _i is larger than EO´s size
+  */
+  virtual void deleteGene( unsigned _i ) { 
+    if (_i < this->size() ) {
+      std::vector::iterator i = this->begin()+_i;
+      this->erase( i );
+    } else {
+      throw out_of_range( "out_of_range when deleting a gene");
+    };
+  };
+
+  /// methods that implement the EO protocol
+  virtual unsigned length() const { return this->size(); };
+
+  /** @name Methods from eoObject
+      readFrom and printOn are directly inherited from eo1d
+  */
+  //@{
+  /** Inherited from eoObject 
+      @see eoObject
+  */
+  std::string className() const {return "eoVector";};
+  //@}
+	
+};
+
+
+//____________________________ Some method implementation _______________________
+
+// Ctors______________________________________________________________________________
+//____________________________________________________________________________________
+template 
+eoVector::eoVector( unsigned _size, eoRnd& _rnd )
+  : eo1d(), std::vector( _size ){ 
+  for ( iterator i = begin(); i != end(); i ++ ) {
+    *i = _rnd();
+  }
+};
+
+//____________________________________________________________________________________
+template 
+eoVector::eoVector( std::istream& _is)
+  : eo1d(), std::vector( ){ 
+  while (_is ) {
+    T tmp;
+    _is >> tmp;
+    push_back( tmp );
+  }
+
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/obsolete/eoWrappedOps.h b/trunk/paradiseo-eo/src/obsolete/eoWrappedOps.h
new file mode 100644
index 000000000..805bb29e7
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoWrappedOps.h
@@ -0,0 +1,200 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+  -----------------------------------------------------------------------------
+  eoWrappedOps.h
+    Derived from the General genetic operator, which can be used to wrap any unary or binary
+    operator. File also contains the eoCombinedOp, needed by the eoSequentialGOpSelector
+
+ (c) Maarten Keijzer (mak@dhi.dk) and GeNeura Team, 1999, 2000
+ 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+
+//-----------------------------------------------------------------------------
+
+#ifndef eoWrappedOps_h
+#define eoWrappedOps_h
+
+//-----------------------------------------------------------------------------
+
+#include           // eoOp, eoMonOp, eoBinOp
+#include 
+
+using namespace std;
+
+/// Wraps monary operators
+template 
+class eoWrappedMonOp : public eoGeneralOp
+{
+public :
+  ///
+  eoWrappedMonOp(eoMonOp& _op) : eoGeneralOp(), op(_op) {};
+
+  ///
+  virtual ~eoWrappedMonOp() {}
+
+  /// Instantiates the abstract method
+  void operator()( eoIndiSelector& _in, 
+			   eoInserter& _out) 
+  {
+    EOT result = _in();
+    op( result );
+    _out(result);
+  }
+  
+private :
+  eoMonOp& op;
+};
+
+
+/// Wraps binary operators
+template 
+class eoWrappedBinOp : public eoGeneralOp
+{
+public :
+  ///
+  eoWrappedBinOp(eoBinOp& _op) : eoGeneralOp(), op(_op) {}
+
+  ///
+  virtual ~eoWrappedBinOp() {}
+
+  /// Instantiates the abstract method. EOT should have copy ctor.
+  void operator()(eoIndiSelector& _in, 
+			   eoInserter& _out) 
+  {
+    EOT out1 = _in();
+    const EOT& out2 = _in();
+    op(out1, out2);
+    _out(out1);
+  }
+
+private :
+	eoBinOp& op;
+};
+
+/// Wraps Quadratic operators
+template 
+class eoWrappedQuadraticOp : public eoGeneralOp
+{
+public :
+  ///
+  eoWrappedQuadraticOp(eoQuadraticOp& _op) : eoGeneralOp(), op(_op) {}
+
+  ///
+  virtual ~eoWrappedQuadraticOp() {}
+
+  /// Instantiates the abstract method. EOT should have copy ctor.
+  void operator()(eoIndiSelector& _in, 
+			   eoInserter& _out) 
+  {
+    EOT out1 = _in();
+    EOT out2 = _in();
+    op(out1, out2);
+    _out(out1)(out2);
+  }
+  
+private :
+	eoQuadraticOp& op;
+};
+
+#include 
+
+template  
+class eoCombinedOp : public eoGeneralOp
+{
+    public :
+    eoCombinedOp& bind(const std::vector*>& _ops, const std::vector& _rates)
+    { 
+        ops = &_ops;
+        rates = &_rates;
+        return *this;
+    }
+
+    class eoDelayedSelector : public eoIndiSelector
+    {
+    public :
+        eoDelayedSelector(eoIndiSelector& _select, const eoPop& _pop) : select(_select), pop(_pop), it(pop.begin()) {}
+    
+        unsigned size()                 const { return select.size();}
+        const EOT& operator[](size_t i) const { return select[i]; }
+
+        /// will first dispense all previously selected individuals before returning new ones
+        const EOT& operator()(void)
+        {
+            if (it == pop.end())
+            {
+                return select();
+            }
+            // else
+            return *it++;
+        }
+
+        eoPop::const_iterator get_it(void) const { return it; }
+    private :
+        eoIndiSelector& select;
+        const eoPop& pop;
+        eoPop::const_iterator it;
+    };
+
+  /** Applies all ops in the combined op
+        It first applies the 
+  */
+  void operator()( eoIndiSelector& _in, 
+			   eoInserter& _out ) 
+  {
+        eoPop intermediate;
+        eoPop next;
+        unsigned i;
+
+        for (i = 0; i < ops->size(); ++i)
+        {
+            eoDelayedSelector delay(_in, intermediate);
+            inserter.bind(next);
+
+            unsigned counter = 0;
+
+            // apply operators until we have as many outputs as inputs
+            do
+            {
+                if (rng.flip(rates->operator[](i))) // should this flip be here?
+                    (*ops->operator[](i))(delay, inserter);
+
+                counter++;
+                if (counter > 1000) 
+                {
+                    throw std::logic_error("eoCombinedOp: no termination after 1000 tries, did you forget to insert individuals in your eoGeneralOp?");
+                }
+            }
+            while (next.size() < intermediate.size());
+
+            intermediate.swap(next);
+            next.resize(0);
+        }
+        
+        // after last swap, results can be found in intermediate
+        for (i = 0; i < intermediate.size(); ++i)
+            _out(intermediate[i]);
+  }
+
+    private :
+        const std::vector*>* ops;
+        const std::vector* rates;
+        eoBackInserter inserter;
+};
+
+#endif 
+
diff --git a/trunk/paradiseo-eo/src/obsolete/eoXOver2.h b/trunk/paradiseo-eo/src/obsolete/eoXOver2.h
new file mode 100644
index 000000000..d1f538526
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/eoXOver2.h
@@ -0,0 +1,107 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoXOver2.h
+// (c) GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _EOXOVER2_h
+#define _EOXOVER2_h
+
+
+// for swap
+#if defined( __BORLANDC__ )
+#include 
+#else
+#include 
+#endif
+
+// EO includes
+#include 
+#include 
+
+/** 2-point crossover: takes the genes in the central section of two EOs
+and interchanges it
+*/
+template 
+class eoXOver2: public eoQuadraticOp {
+public:
+	///
+	eoXOver2() 
+	  : eoQuadraticOp< EOT >(){};
+
+	///
+	virtual ~eoXOver2() {};
+
+	///
+	virtual void operator()( EOT& _eo1, 
+				 EOT& _eo2 ) const {
+	  unsigned len1 = _eo1.length(), len2 = _eo2.length(), 
+	    len= (len1 > len2)?len2:len1;
+
+      unsigned pos1 = rng.random(len), pos2 = rng.random(len) ;
+	  
+	  applyAt( _eo1, _eo2, pos1, pos2 );
+	  
+	}
+
+	/** @name Methods from eoObject
+	readFrom and printOn are directly inherited from eoOp
+	*/
+	//@{
+	/** Inherited from eoObject 
+		  @see eoObject
+	*/
+	std::string className() const {return "eoXOver2";};
+    //@}
+
+private:
+
+#ifdef _MSC_VER
+	typedef EOT::Type Type;
+#else
+	typedef typename EOT::Type Type;
+#endif
+
+	/// applies operator to one gene in the EO
+	virtual void applyAt( EOT& _eo, EOT& _eo2, 
+			      unsigned _i, unsigned _j = 0) const {
+	  
+	  if ( _j < _i )
+	    swap( _i, _j );
+
+	  unsigned len1 = _eo.length(), len2 = _eo2.length(), 
+	    len= (len1 > len2)?len2:len1;
+
+	  if ( (_j > len) || (_i> len ) ) 
+	    throw std::runtime_error( "xOver2: applying xOver past boundaries");
+	  
+	  for (  unsigned i = _i; i < _j; i++ ) {
+	    Type tmp = _eo.gene( i );
+	    _eo.gene( i ) = _eo2.gene( i );
+	    _eo2.gene( i ) = tmp ;
+	  }
+	  
+	}
+
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/obsolete/evolution_strategies b/trunk/paradiseo-eo/src/obsolete/evolution_strategies
new file mode 100644
index 000000000..d1c729ba9
--- /dev/null
+++ b/trunk/paradiseo-eo/src/obsolete/evolution_strategies
@@ -0,0 +1,15 @@
+#ifndef _eoEs_h
+#define _eoEs_h
+
+#include 
+#include 
+#include 
+#include 
+
+#include 
+#include 
+
+#include 
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/other/.cvsignore b/trunk/paradiseo-eo/src/other/.cvsignore
new file mode 100644
index 000000000..69fb0bd82
--- /dev/null
+++ b/trunk/paradiseo-eo/src/other/.cvsignore
@@ -0,0 +1,6 @@
+*.lo
+*.la
+.deps
+.libs
+Makefile
+Makefile.in
diff --git a/trunk/paradiseo-eo/src/other/CVS/Entries b/trunk/paradiseo-eo/src/other/CVS/Entries
new file mode 100644
index 000000000..fd98d7205
--- /dev/null
+++ b/trunk/paradiseo-eo/src/other/CVS/Entries
@@ -0,0 +1,7 @@
+/.cvsignore/1.1/Mon Apr  3 09:32:08 2000//
+/Makefile.am/1.6/Wed Sep 22 18:18:30 2004//
+/eoExternalEO.h/1.9/Thu Dec 23 15:29:06 2004//
+/eoExternalOpFunctions.h/1.5/Fri Mar  9 14:13:28 2001//
+/eoString.h/1.7/Thu Dec 23 15:29:06 2004//
+/external_eo/1.1/Thu May 25 07:18:25 2000//
+D
diff --git a/trunk/paradiseo-eo/src/other/CVS/Repository b/trunk/paradiseo-eo/src/other/CVS/Repository
new file mode 100644
index 000000000..8a5191557
--- /dev/null
+++ b/trunk/paradiseo-eo/src/other/CVS/Repository
@@ -0,0 +1 @@
+eo/src/other
diff --git a/trunk/paradiseo-eo/src/other/CVS/Root b/trunk/paradiseo-eo/src/other/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/src/other/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/src/other/Makefile.am b/trunk/paradiseo-eo/src/other/Makefile.am
new file mode 100644
index 000000000..074966a36
--- /dev/null
+++ b/trunk/paradiseo-eo/src/other/Makefile.am
@@ -0,0 +1,11 @@
+## Makefile.am for eo/src/other
+
+
+AM_CXXFLAGS 		= -I$(top_builddir)/src
+
+otherincludedir 	= $(pkgincludedir)/other
+
+otherinclude_HEADERS 	= eoExternalEO.h \
+			eoString.h \
+			external_eo \
+			eoExternalOpFunctions.h
diff --git a/trunk/paradiseo-eo/src/other/eoExternalEO.h b/trunk/paradiseo-eo/src/other/eoExternalEO.h
new file mode 100644
index 000000000..e2e2b2da6
--- /dev/null
+++ b/trunk/paradiseo-eo/src/other/eoExternalEO.h
@@ -0,0 +1,93 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+  -----------------------------------------------------------------------------
+  eoExternalEO.h
+        Definition of an object that allows an external struct to be inserted in EO
+
+ (c) Maarten Keijzer (mkeijzer@mad.scientist.com) and GeNeura Team, 1999, 2000
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+
+#ifndef eoExternalEO_h
+#define eoExternalEO_h
+
+#include  // EO
+
+/**
+ * Definition of an object that allows an external struct
+ * to be inserted in EO. This struct or class can be of any
+ * form, the only thing this class does is attach a fitness
+ * value to it and makes it the appropriate type (derives it from EO).
+*/
+
+template 
+class eoExternalEO : public EO, virtual public External
+{
+public :
+
+    eoExternalEO(void)
+        : EO(), External()
+        {}
+
+    /** Init externalEo with the struct itself and set fitness to zero */
+    eoExternalEO(const External& ext)
+        : EO(), External(ext)
+        {}
+
+    eoExternalEO(std::istream& is, const External& ext)
+        : EO(), External(ext)
+        { readFrom(is); }
+
+  /**
+   * Read object, the external struct needs to have an operator>> defined
+   */
+  virtual void readFrom(std::istream& _is)
+  {
+      EO::readFrom(_is);
+    _is >> static_cast(*this);
+  }
+
+  /**
+   * Write object. Called printOn since it prints the object _on_ a stream.
+   * @param _os A std::ostream.
+   */
+  virtual void printOn(std::ostream& _os) const
+  {
+      EO::printOn(_os);
+      _os << static_cast(*this);
+  }
+
+};
+
+/// To remove ambiguities between EO and External, streaming operators are defined yet again
+template 
+std::ostream& operator<<(std::ostream& os, const eoExternalEO& eo)
+{
+    eo.printOn(os);
+    return os;
+}
+
+/// To remove ambiguities between EO and External, streaming operators are defined yet again
+template 
+std::istream& operator>>(std::istream& is, eoExternalEO& eo)
+{
+    eo.readFrom(is);
+    return is;
+}
+
+#endif
diff --git a/trunk/paradiseo-eo/src/other/eoExternalOpFunctions.h b/trunk/paradiseo-eo/src/other/eoExternalOpFunctions.h
new file mode 100644
index 000000000..a96991e71
--- /dev/null
+++ b/trunk/paradiseo-eo/src/other/eoExternalOpFunctions.h
@@ -0,0 +1,170 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+  -----------------------------------------------------------------------------
+  eoExternalOpFunc.h
+        Defines eoExternalInitOpFunc, eoExternalMonOpFunc, eoExternalBinOpFunc, eoExternalQuadOpFunc
+        that are used to wrap a function pointer to externally defined initialization
+        and 'genetic' operators
+
+ (c) Maarten Keijzer (mkeijzer@mad.scientist.com) and GeNeura Team, 1999, 2000
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+
+#ifndef eoExternalOpFunc_h
+#define eoExternalOpFunc_h
+
+#include 
+#include 
+#include 
+#include 
+
+/**
+    Initialization of external struct, ctor expects a function of the following
+    signature:
+
+    External func();
+
+  Where External is the user defined struct or class
+*/
+template  >
+class eoExternalInit : public eoInit
+{
+
+public :
+
+    eoExternalInit(External (*_init)(void)) : init(_init) {}
+
+
+    void operator()(ExternalEO& _eo)
+    {
+        _eo.External::operator=( (*init)() );
+        _eo.invalidate();
+    }
+
+private :
+
+    External (*init)(void);
+};
+
+/**
+    Evaluation of external struct, ctor expects a function of the following
+    signature:
+
+    Fit func(External&);
+
+  Where External is the user defined struct or class and Fit the fitness type
+*/
+template  >
+class eoExternalEvalFunc : public eoEvalFunc
+{
+    public :
+
+    eoExternalEvalFunc(F (*_eval)(const External&)) : eval(_eval) {}
+
+    void operator()(ExternalEO& eo)
+    {
+        if (eo.invalid())
+            eo.fitness( (*eval)(eo) );
+    }
+
+    private :
+
+    F (*eval)(const External&);
+};
+
+/**
+    Mutation of external struct, ctor expects a function of the following
+    signature:
+
+    bool func(External&);
+
+
+  Where External is the user defined struct or class.
+  The function should return true when it changed something, false otherwise
+*/
+
+template  >
+class eoExternalMonOp : public eoMonOp
+{
+    public :
+
+    eoExternalMonOp(bool (*_mutate)(External&)) : mutate(_mutate) {}
+
+    bool operator()(ExternalEO& eo)
+    {
+        return (*mutate)(eo);
+    }
+
+    private :
+
+    bool (*mutate)(External&);
+};
+
+/**
+    Crossover of external struct, ctor expects a function of the following
+    signature:
+
+    bool func(External&, const External&);
+
+  Where External is the user defined struct or class
+  The function should return true when it changed something, false otherwise
+*/
+template  >
+class eoExternalBinOp : public eoBinOp
+{
+    public :
+
+    eoExternalBinOp(bool (*_binop)(External&, const External&)) : binop(_binop) {}
+
+    bool operator()(ExternalEO& eo1, const ExternalEO& eo2)
+    {
+        return (*binop)(eo1, eo2);
+    }
+
+    private :
+
+    bool (*binop)(External&, const External&);
+};
+
+/**
+    Crossover of external struct, ctor expects a function of the following
+    signature:
+
+    bool func(External&, External&);
+
+  Where External is the user defined struct or class
+  The function should return true when it changed something, false otherwise
+*/
+template  >
+class eoExternalQuadOp : public eoQuadOp
+{
+    public :
+
+    eoExternalQuadOp(bool (*_quadop)(External&, External&)) : quadop(_quadop) {}
+
+    bool operator()(ExternalEO& eo1, ExternalEO& eo2)
+    {
+        return (*quadop)(eo1, eo2);
+    }
+
+    private :
+
+    bool (*quadop)(External&, External&);
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/other/eoString.h b/trunk/paradiseo-eo/src/other/eoString.h
new file mode 100644
index 000000000..e2aee7584
--- /dev/null
+++ b/trunk/paradiseo-eo/src/other/eoString.h
@@ -0,0 +1,81 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoString.h
+// (c) GeNeura Team, 1998
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoString_H
+#define _eoString_H
+
+// STL libraries
+#include 
+#include 
+#include 
+
+
+#include 
+
+//-----------------------------------------------------------------------------
+// eoString
+//-----------------------------------------------------------------------------
+
+/** Adaptor that turns an STL std::string into an EO */
+template 
+class eoString: public EO, public std::string
+{
+public:
+
+    typedef char Type;
+    typedef char AtomType;
+    typedef std::string   ContainerType;
+
+
+  /// Canonical part of the objects: several ctors, copy ctor, dtor and assignment operator
+  //@{
+  /// ctor
+  eoString( const std::string& _str ="" )
+    : std::string( _str ) {};
+
+  /// printing...
+  virtual void printOn(std::ostream& os) const
+  {
+    EO::printOn(os);
+    os << ' ';
+
+    os << size() << ' ' << substr() << std::endl;
+
+  }
+
+  /** @name Methods from eoObject
+      readFrom and printOn are directly inherited from eo1d
+  */
+  //@{
+  /** Inherited from eoObject
+      @see eoObject
+  */
+  virtual std::string className() const {return "eoString";};
+  //@}
+
+
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/other/external_eo b/trunk/paradiseo-eo/src/other/external_eo
new file mode 100644
index 000000000..aeaaaab6b
--- /dev/null
+++ b/trunk/paradiseo-eo/src/other/external_eo
@@ -0,0 +1,2 @@
+#include 
+#include 
diff --git a/trunk/paradiseo-eo/src/paradisEO/CVS/Entries b/trunk/paradiseo-eo/src/paradisEO/CVS/Entries
new file mode 100644
index 000000000..178481050
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/CVS/Entries
@@ -0,0 +1 @@
+D
diff --git a/trunk/paradiseo-eo/src/paradisEO/CVS/Entries.Log b/trunk/paradiseo-eo/src/paradisEO/CVS/Entries.Log
new file mode 100644
index 000000000..27de4d83f
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/CVS/Entries.Log
@@ -0,0 +1,3 @@
+A D/comm////
+A D/eval////
+A D/island////
diff --git a/trunk/paradiseo-eo/src/paradisEO/CVS/Repository b/trunk/paradiseo-eo/src/paradisEO/CVS/Repository
new file mode 100644
index 000000000..4866299e5
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/CVS/Repository
@@ -0,0 +1 @@
+eo/src/paradisEO
diff --git a/trunk/paradiseo-eo/src/paradisEO/CVS/Root b/trunk/paradiseo-eo/src/paradisEO/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/src/paradisEO/comm/CVS/Entries b/trunk/paradiseo-eo/src/paradisEO/comm/CVS/Entries
new file mode 100644
index 000000000..178481050
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/comm/CVS/Entries
@@ -0,0 +1 @@
+D
diff --git a/trunk/paradiseo-eo/src/paradisEO/comm/CVS/Entries.Log b/trunk/paradiseo-eo/src/paradisEO/comm/CVS/Entries.Log
new file mode 100644
index 000000000..9e493f721
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/comm/CVS/Entries.Log
@@ -0,0 +1 @@
+A D/messages////
diff --git a/trunk/paradiseo-eo/src/paradisEO/comm/CVS/Repository b/trunk/paradiseo-eo/src/paradisEO/comm/CVS/Repository
new file mode 100644
index 000000000..c8299cb70
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/comm/CVS/Repository
@@ -0,0 +1 @@
+eo/src/paradisEO/comm
diff --git a/trunk/paradiseo-eo/src/paradisEO/comm/CVS/Root b/trunk/paradiseo-eo/src/paradisEO/comm/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/comm/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/src/paradisEO/comm/messages/CVS/Entries b/trunk/paradiseo-eo/src/paradisEO/comm/messages/CVS/Entries
new file mode 100644
index 000000000..178481050
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/comm/messages/CVS/Entries
@@ -0,0 +1 @@
+D
diff --git a/trunk/paradiseo-eo/src/paradisEO/comm/messages/CVS/Entries.Log b/trunk/paradiseo-eo/src/paradisEO/comm/messages/CVS/Entries.Log
new file mode 100644
index 000000000..bea84217a
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/comm/messages/CVS/Entries.Log
@@ -0,0 +1,2 @@
+A D/from////
+A D/to////
diff --git a/trunk/paradiseo-eo/src/paradisEO/comm/messages/CVS/Repository b/trunk/paradiseo-eo/src/paradisEO/comm/messages/CVS/Repository
new file mode 100644
index 000000000..c3345c02a
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/comm/messages/CVS/Repository
@@ -0,0 +1 @@
+eo/src/paradisEO/comm/messages
diff --git a/trunk/paradiseo-eo/src/paradisEO/comm/messages/CVS/Root b/trunk/paradiseo-eo/src/paradisEO/comm/messages/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/comm/messages/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/src/paradisEO/comm/messages/from/CVS/Entries b/trunk/paradiseo-eo/src/paradisEO/comm/messages/from/CVS/Entries
new file mode 100644
index 000000000..178481050
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/comm/messages/from/CVS/Entries
@@ -0,0 +1 @@
+D
diff --git a/trunk/paradiseo-eo/src/paradisEO/comm/messages/from/CVS/Repository b/trunk/paradiseo-eo/src/paradisEO/comm/messages/from/CVS/Repository
new file mode 100644
index 000000000..1591cc6fc
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/comm/messages/from/CVS/Repository
@@ -0,0 +1 @@
+eo/src/paradisEO/comm/messages/from
diff --git a/trunk/paradiseo-eo/src/paradisEO/comm/messages/from/CVS/Root b/trunk/paradiseo-eo/src/paradisEO/comm/messages/from/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/comm/messages/from/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/src/paradisEO/comm/messages/to/CVS/Entries b/trunk/paradiseo-eo/src/paradisEO/comm/messages/to/CVS/Entries
new file mode 100644
index 000000000..178481050
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/comm/messages/to/CVS/Entries
@@ -0,0 +1 @@
+D
diff --git a/trunk/paradiseo-eo/src/paradisEO/comm/messages/to/CVS/Repository b/trunk/paradiseo-eo/src/paradisEO/comm/messages/to/CVS/Repository
new file mode 100644
index 000000000..a2c48bfa7
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/comm/messages/to/CVS/Repository
@@ -0,0 +1 @@
+eo/src/paradisEO/comm/messages/to
diff --git a/trunk/paradiseo-eo/src/paradisEO/comm/messages/to/CVS/Root b/trunk/paradiseo-eo/src/paradisEO/comm/messages/to/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/comm/messages/to/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/src/paradisEO/eval/CVS/Entries b/trunk/paradiseo-eo/src/paradisEO/eval/CVS/Entries
new file mode 100644
index 000000000..178481050
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/eval/CVS/Entries
@@ -0,0 +1 @@
+D
diff --git a/trunk/paradiseo-eo/src/paradisEO/eval/CVS/Repository b/trunk/paradiseo-eo/src/paradisEO/eval/CVS/Repository
new file mode 100644
index 000000000..4be4fbdac
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/eval/CVS/Repository
@@ -0,0 +1 @@
+eo/src/paradisEO/eval
diff --git a/trunk/paradiseo-eo/src/paradisEO/eval/CVS/Root b/trunk/paradiseo-eo/src/paradisEO/eval/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/eval/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/src/paradisEO/island/CVS/Entries b/trunk/paradiseo-eo/src/paradisEO/island/CVS/Entries
new file mode 100644
index 000000000..178481050
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/island/CVS/Entries
@@ -0,0 +1 @@
+D
diff --git a/trunk/paradiseo-eo/src/paradisEO/island/CVS/Entries.Log b/trunk/paradiseo-eo/src/paradisEO/island/CVS/Entries.Log
new file mode 100644
index 000000000..d16b38f32
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/island/CVS/Entries.Log
@@ -0,0 +1 @@
+A D/topologies////
diff --git a/trunk/paradiseo-eo/src/paradisEO/island/CVS/Repository b/trunk/paradiseo-eo/src/paradisEO/island/CVS/Repository
new file mode 100644
index 000000000..e7fdabfd3
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/island/CVS/Repository
@@ -0,0 +1 @@
+eo/src/paradisEO/island
diff --git a/trunk/paradiseo-eo/src/paradisEO/island/CVS/Root b/trunk/paradiseo-eo/src/paradisEO/island/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/island/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/src/paradisEO/island/topologies/CVS/Entries b/trunk/paradiseo-eo/src/paradisEO/island/topologies/CVS/Entries
new file mode 100644
index 000000000..178481050
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/island/topologies/CVS/Entries
@@ -0,0 +1 @@
+D
diff --git a/trunk/paradiseo-eo/src/paradisEO/island/topologies/CVS/Repository b/trunk/paradiseo-eo/src/paradisEO/island/topologies/CVS/Repository
new file mode 100644
index 000000000..c7bf0e3e7
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/island/topologies/CVS/Repository
@@ -0,0 +1 @@
+eo/src/paradisEO/island/topologies
diff --git a/trunk/paradiseo-eo/src/paradisEO/island/topologies/CVS/Root b/trunk/paradiseo-eo/src/paradisEO/island/topologies/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/src/paradisEO/island/topologies/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/src/pyeo/AUTHORS b/trunk/paradiseo-eo/src/pyeo/AUTHORS
new file mode 100644
index 000000000..e1d909968
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/AUTHORS
@@ -0,0 +1,3 @@
+
+Maarten Keijzer (mkeijzer@cs.vu.nl)
+
diff --git a/trunk/paradiseo-eo/src/pyeo/BUILDING b/trunk/paradiseo-eo/src/pyeo/BUILDING
new file mode 100644
index 000000000..3db7de1b7
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/BUILDING
@@ -0,0 +1,174 @@
+
+
+To build PyEO, a number of steps are neccessary. PyEO depends on Boost.Python v2,
+which in turn expects the presence of python2.2. As we can't expect people to have 
+this installed some instructions are in order to help people build PyEO.so 
+
+First of all, currently Windows is not supported. I don't develop on windows and 
+don't have access to a compiler on it. 
+
+PyEO has been developed on Debian, using gcc 2.95-4.
+
+My primary platform is debian, so the default Makefile provides for that. Below you
+will also find instructions for rpm-based distributions. As far as I know this includes
+RedHat, Mandrake, Suse, Yellowdog, and probably a lot more. If I recall correctly, the RPM
+format is the LSB default.
+
+===== Building PyEO on Debian =====
+
+Point your /etc/apt/sources.list to the unstable distribution (if it's not there already),
+and install:
+
+for Python:
+
+$ apt-get install python2.2
+$ apt-get install python2.2-dev
+
+It might also be a good idea to install the numeric library
+
+$ apt-get install python2.2-numeric
+
+
+For Boost.Python:
+
+$ apt-get install libboost-python1.29.0
+$ apt-get install libboost-python-dev
+
+If all goes well, this will also install libstlport. If it doesn't,
+
+$ apt-get install libstlport4.5
+
+and maybe
+
+$ apt-get install libstlport4.5-dev 
+
+but I'm not sure about the latter.
+
+Now you can type
+
+$ make
+
+And after (a long) wait, a file called PyEO.so will be produced. 
+
+===== Building PyEO on an RPM-based Distro =====
+
+The following recipe has only been tested on a RedHat 7.1 installation, on other
+systems some stuff might be different.
+
+== Getting Python2.2 ==
+
+If you don't have python2.2 installed (newer distro's install this by default),
+you can either install it from a binary specifically build for your distro, or
+you can build it from source by going to:
+
+http://www.python.org/2.2.1/rpms.html
+
+and getting the source by clicking the link to python2-2.2.1-2.src.rpm
+
+This actually links to:
+
+http://www.python.org/ftp/python/2.2.1/rpms/python2-2.2.1-2.src.rpm
+
+for your convenience I mirrored this file at:
+
+http://www.cs.vu.nl/~mkeijzer/PyEO/python2-2.2.1-2.src.rpm
+
+by usuing the command:
+
+$ rpm --rebuild python2-2.2.1-2.src.rpm
+
+or  with newer versions of rpm
+
+$ rpmbuild python2-2.2.1-2.src.rpm
+
+It will build a binary rpm for your computer. On this Redhat 7.1 box it put the 
+RPMS it build in
+
+/usr/src/redhat/RPMS/i386/
+
+The ones you need to install are:
+
+python2-2.2.1-2.i386.rpm
+python2-devel-2.2.1-2.i386.rpm
+
+But you might want to install the rest as well.
+
+== Getting Boost.Python ==
+
+First of all, do a quick check. At the prompt type:
+
+$ python
+
+If you see something like:
+
+Python 2.2.2 (#4, Oct 15 2002, 04:21:28)
+[GCC 2.95.4 20011002 (Debian prerelease)] on linux2
+Type "help", "copyright", "credits" or "license" for more information.
+
+(don't mind the second line, It's the version info we're interested in)
+
+You're set to go. Unfortunately, on this Redhat 7.1 box I tested things on, /usr/bin/python
+insisted on pointing to /usr/bin/python1.5 . Unfortunately, the boost source rpm depends
+on python to provide 2.2. If this is the case on your machine as well, there are two
+possible fixes (of which one I tested).
+
+/usr/bin/python is a symlink, let it point to /usr/bin/python2.2 (this one I tested)
+
+DON'T forget to repoint /usr/bin/python to /usr/bin/python1.5 after you build the boost libraries: Redhat tools
+depend on this!
+
+or
+
+alias python=/usr/bin/python2.2 (which would be better if it works, but untested.)
+
+So given that you are in a shell that uses python2.2 if you issue 
+the command 'python', get two boost source rpms at:
+
+http://www.starostik.de/malte/boost/
+
+namely
+
+boost-jam-3.1.3-1.src.rpm
+boost-1.29.0-2.src.rpm
+
+Which I also mirrored at
+
+http://www.cs.vu.nl/~mkeijzer/PyEO/boost-jam-3.1.3-1.src.rpm
+http://www.cs.vu.nl/~mkeijzer/PyEO/boost-1.29.0-2.src.rpm
+
+First build and install jam using either rpm --rebuild or rpmbuild.
+
+The file you have to install is:
+
+boost-jam-3.1.3-1.i386.rpm
+
+This is the 'make' replacement that is used by boost.
+
+Next, build boost-1.29.0.src.rpm using 'rpm --rebuild' or 'rpmbuild'
+
+The only rpm's that this procedure produces that you need to install is:
+
+boost-python-1.29.0-2.i386.rpm
+boost-python-devel-1.29.0-2.i386.rpm
+
+
+When installing boost-python-devel, I got a dependency problem with libpython-dev,
+this was probably caused by the same problem I had with python2.2, python1.5. I ignored
+it by using:
+
+$ rpm -i --nodep boost-python-devel-1.29.0-2.i386.rpm
+
+and you're all set to type
+
+$ make -fMakefile.rpm
+
+in the PyEO build directory
+
+==== Testing PyEO==========
+
+After building go to the test directory and type
+
+$ ./run_tests.sh
+
+If you don't see errors, all is well and you're ready to go
+
diff --git a/trunk/paradiseo-eo/src/pyeo/COPYING b/trunk/paradiseo-eo/src/pyeo/COPYING
new file mode 100644
index 000000000..d60c31a97
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/COPYING
@@ -0,0 +1,340 @@
+		    GNU GENERAL PUBLIC LICENSE
+		       Version 2, June 1991
+
+ Copyright (C) 1989, 1991 Free Software Foundation, Inc.
+     59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+			    Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users.  This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it.  (Some other Free Software Foundation software is covered by
+the GNU Library General Public License instead.)  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+this service if you wish), that you receive source code or can get it
+if you want it, that you can change the software or use pieces of it
+in new free programs; and that you know you can do these things.
+
+  To protect your rights, we need to make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have.  You must make sure that they, too, receive or can get the
+source code.  And you must show them these terms so they know their
+rights.
+
+  We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+  Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software.  If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+
+  Finally, any free program is threatened constantly by software
+patents.  We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary.  To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+		    GNU GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License.  The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language.  (Hereinafter, translation is included without limitation in
+the term "modification".)  Each licensee is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+  1. You may copy and distribute verbatim copies of the Program's
+source code as you receive it, in any medium, provided that you
+conspicuously and appropriately publish on each copy an appropriate
+copyright notice and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+
+  2. You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) You must cause the modified files to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    b) You must cause any work that you distribute or publish, that in
+    whole or in part contains or is derived from the Program or any
+    part thereof, to be licensed as a whole at no charge to all third
+    parties under the terms of this License.
+
+    c) If the modified program normally reads commands interactively
+    when run, you must cause it, when started running for such
+    interactive use in the most ordinary way, to print or display an
+    announcement including an appropriate copyright notice and a
+    notice that there is no warranty (or else, saying that you provide
+    a warranty) and that users may redistribute the program under
+    these conditions, and telling the user how to view a copy of this
+    License.  (Exception: if the Program itself is interactive but
+    does not normally print such an announcement, your work based on
+    the Program is not required to print an announcement.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+    a) Accompany it with the complete corresponding machine-readable
+    source code, which must be distributed under the terms of Sections
+    1 and 2 above on a medium customarily used for software interchange; or,
+
+    b) Accompany it with a written offer, valid for at least three
+    years, to give any third party, for a charge no more than your
+    cost of physically performing source distribution, a complete
+    machine-readable copy of the corresponding source code, to be
+    distributed under the terms of Sections 1 and 2 above on a medium
+    customarily used for software interchange; or,
+
+    c) Accompany it with the information you received as to the offer
+    to distribute corresponding source code.  (This alternative is
+    allowed only for noncommercial distribution and only if you
+    received the program in object code or executable form with such
+    an offer, in accord with Subsection b above.)
+
+The source code for a work means the preferred form of the work for
+making modifications to it.  For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable.  However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  4. You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License.  Any attempt
+otherwise to copy, modify, sublicense or distribute the Program is
+void, and will automatically terminate your rights under this License.
+However, parties who have received copies, or rights, from you under
+this License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+  5. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Program or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+  6. Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+  7. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  8. If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded.  In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+  9. The Free Software Foundation may publish revised and/or new versions
+of the General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Program
+specifies a version number of this License which applies to it and "any
+later version", you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation.  If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+  10. If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission.  For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this.  Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+
+			    NO WARRANTY
+
+  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
+FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
+OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
+PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
+OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
+TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
+PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
+REPAIR OR CORRECTION.
+
+  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
+INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
+OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
+TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
+YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
+PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGES.
+
+		     END OF TERMS AND CONDITIONS
+
+	    How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    
+    Copyright (C)   
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+    Gnomovision version 69, Copyright (C) year  name of author
+    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, the commands you use may
+be called something other than `show w' and `show c'; they could even be
+mouse-clicks or menu items--whatever suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+  `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+  , 1 April 1989
+  Ty Coon, President of Vice
+
+This General Public License does not permit incorporating your program into
+proprietary programs.  If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library.  If this is what you want to do, use the GNU Library General
+Public License instead of this License.
diff --git a/trunk/paradiseo-eo/src/pyeo/CVS/Entries b/trunk/paradiseo-eo/src/pyeo/CVS/Entries
new file mode 100644
index 000000000..6d94fedbe
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/CVS/Entries
@@ -0,0 +1,28 @@
+/AUTHORS/1.1/Sun Jan  5 16:31:49 2003//
+/BUILDING/1.1/Tue Jan  7 10:49:55 2003//
+/COPYING/1.1/Sun Jan  5 16:31:49 2003//
+/Makefile/1.10/Mon Jan 23 15:12:49 2006//
+/Makefile.rpm/1.2/Fri Jan 10 15:40:57 2003//
+/NEWS/1.1/Sun Jan  5 16:31:49 2003//
+/PyEO.cpp/1.8/Wed Sep 28 21:49:26 2005//
+/PyEO.h/1.7/Tue Mar 18 16:34:50 2003//
+/README/1.2/Tue Jan  7 10:50:23 2003//
+/abstract1.cpp/1.4/Mon Jun  9 06:25:11 2003//
+/algos.cpp/1.4/Tue Mar 18 16:34:52 2003//
+/breeders.cpp/1.4/Tue Mar 18 16:34:54 2003//
+/continuators.cpp/1.5/Tue Mar 18 16:34:54 2003//
+/def_abstract_functor.h/1.3/Tue Jan 14 09:37:37 2003//
+/geneticOps.cpp/1.4/Tue Mar 18 16:34:55 2003//
+/mergers.cpp/1.3/Tue Mar 18 16:34:57 2003//
+/monitors.cpp/1.4/Tue Mar 18 16:35:02 2003//
+/perf2worth.cpp/1.5/Tue Mar 18 16:35:04 2003//
+/pickle.h/1.7/Wed Sep 28 21:49:26 2005//
+/random_numbers.cpp/1.8/Mon Jan 23 15:12:49 2006//
+/reduce.cpp/1.3/Tue Mar 18 16:35:08 2003//
+/replacement.cpp/1.4/Tue Mar 18 16:35:08 2003//
+/selectOne.cpp/1.4/Tue Mar 18 16:35:09 2003//
+/selectors.cpp/1.4/Tue Mar 18 16:35:09 2003//
+/statistics.cpp/1.3/Tue Mar 18 16:35:09 2003//
+/valueParam.cpp/1.8/Mon Jan 23 15:12:49 2006//
+/valueParam.h/1.2/Mon Jan 23 15:12:49 2006//
+D
diff --git a/trunk/paradiseo-eo/src/pyeo/CVS/Entries.Log b/trunk/paradiseo-eo/src/pyeo/CVS/Entries.Log
new file mode 100644
index 000000000..592fe7c46
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/CVS/Entries.Log
@@ -0,0 +1,2 @@
+A D/PyEO////
+A D/test////
diff --git a/trunk/paradiseo-eo/src/pyeo/CVS/Repository b/trunk/paradiseo-eo/src/pyeo/CVS/Repository
new file mode 100644
index 000000000..31819e321
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/CVS/Repository
@@ -0,0 +1 @@
+eo/src/pyeo
diff --git a/trunk/paradiseo-eo/src/pyeo/CVS/Root b/trunk/paradiseo-eo/src/pyeo/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/src/pyeo/Makefile b/trunk/paradiseo-eo/src/pyeo/Makefile
new file mode 100644
index 000000000..5b1f208c3
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/Makefile
@@ -0,0 +1,36 @@
+# Note for however is foolish enough to attempt to build this thing
+#
+# You need: 
+# Python 2.2
+# Boost.Python v2
+#
+
+CXX = g++ 
+CXXFLAGS = -DHAVE_SSTREAM
+CPPFLAGS = -Wall -O2 #-g #-O2
+LDFLAGS = 
+COMPILE = $(CXX) $(CXXFLAGS) $(CPPFLAGS) -c
+LINK = $(CXX) $(CXXFLAGS) $(CPPFLAGS) $(LDFLAGS) 
+INC=-I/usr/include/python2.4 -I.. -I../.. -ftemplate-depth-50 
+
+OBJECTS=eoFunctorStore.o PyEO.o abstract1.o algos.o \
+	random_numbers.o geneticOps.o selectOne.o continuators.o\
+	reduce.o replacement.o selectors.o breeders.o\
+	mergers.o valueParam.o perf2worth.o monitors.o\
+	statistics.o
+
+all: PyEO/PyEO.so
+
+clean:
+	rm PyEO/*.so *.o test/*.pyc
+
+PyEO/PyEO.so: $(OBJECTS)
+	$(LINK) -o PyEO/PyEO.so $(OBJECTS) -lboost_python -lpython2.4 -shared #-lstlport
+
+eoFunctorStore.o: ../eoFunctorStore.h ../eoFunctorStore.cpp
+	$(COMPILE) -o eoFunctorStore.o ../eoFunctorStore.cpp $(INC)
+
+%.o:%.cpp PyEO.h def_abstract_functor.h 
+	$(COMPILE) $< $(INC)
+
+
diff --git a/trunk/paradiseo-eo/src/pyeo/Makefile.rpm b/trunk/paradiseo-eo/src/pyeo/Makefile.rpm
new file mode 100644
index 000000000..dccf30eed
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/Makefile.rpm
@@ -0,0 +1,31 @@
+# Makefile for people that build boost using the rpm-recipe
+
+CXX = g++ #-3.2
+CXXFLAGS = #-g #-DNDEBUG
+CPPFLAGS = -Wall -O2
+LDFLAGS = -L/usr/lib/python2.2/config/
+COMPILE = $(CXX) $(CXXFLAGS) $(CPPFLAGS) -c
+LINK = $(CXX) $(CXXFLAGS) $(CPPFLAGS) $(LDFLAGS) 
+INC=-I/usr/include/python2.2 -I/usr/include/stlport -I.. -ftemplate-depth-50
+
+OBJECTS=eoFunctorStore.o PyEO.o abstract1.o algos.o \
+	random_numbers.o geneticOps.o selectOne.o continuators.o\
+	reduce.o replacement.o selectors.o breeders.o\
+	mergers.o valueParam.o perf2worth.o monitors.o\
+	statistics.o
+
+all: PyEO.so
+
+clean:
+	rm *.so *.o test/*.pyc
+
+PyEO.so: $(OBJECTS)
+	$(LINK) -o PyEO.so $(OBJECTS) -lboost_python -lpython2.2 -shared #-lstlport
+
+eoFunctorStore.o: ../eoFunctorStore.h ../eoFunctorStore.cpp
+	$(COMPILE) -o eoFunctorStore.o ../eoFunctorStore.cpp $(INC)
+
+%.o:%.cpp PyEO.h def_abstract_functor.h 
+	$(COMPILE) $< $(INC)
+
+
diff --git a/trunk/paradiseo-eo/src/pyeo/NEWS b/trunk/paradiseo-eo/src/pyeo/NEWS
new file mode 100644
index 000000000..e69de29bb
diff --git a/trunk/paradiseo-eo/src/pyeo/PyEO.cpp b/trunk/paradiseo-eo/src/pyeo/PyEO.cpp
new file mode 100644
index 000000000..a6828f039
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/PyEO.cpp
@@ -0,0 +1,230 @@
+/*
+    PyEO
+
+    Copyright (C) 2003 Maarten Keijzer
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+*/
+
+#include 
+
+#include "PyEO.h"
+#include 
+
+
+using namespace std;
+//using namespace boost::python;
+
+// static member, needs to be instantiated somewhere
+std::vector PyFitness::objective_info;
+
+bool PyFitness::dominates(const PyFitness& oth) const
+{
+    bool dom = false;
+
+    for (unsigned i = 0; i < nObjectives(); ++i)
+    {
+      int objective = objective_info[i];
+
+      if (objective == 0) // ignore
+	  continue;
+
+      bool maxim = objective > 0;
+
+      double aval = maxim? (*this)[i] : -(*this)[i];
+      double bval = maxim? oth[i] : -oth[i];
+
+      if (fabs(aval - bval) > tol())
+      {
+        if (aval < bval)
+        {
+          return false; // cannot dominate
+        }
+        // else aval < bval
+        dom = true; // for the moment: goto next objective
+      }
+      //else they're equal in this objective, goto next
+    }
+
+    return dom;
+}
+
+bool dominates(const PyEO& a, const PyEO& b)
+{
+    return PyFitness(a.fitness()).dominates(b.fitness());
+}
+
+ostream& operator<<(ostream& os, const PyEO& _eo)
+{
+    os << _eo.to_string();
+    return os;
+}
+
+struct pyPop_pickle_suite : boost::python::pickle_suite
+{
+    static boost::python::tuple getstate(const eoPop& _pop)
+    {
+	boost::python::list entries;
+	for (unsigned i = 0; i != _pop.size(); ++i)
+	    entries.append( PyEO_pickle_suite::getstate(_pop[i]) );
+
+	return boost::python::make_tuple(boost::python::object(_pop.size()), entries);
+    }
+
+    static void setstate( eoPop& _pop, boost::python::tuple pickled)
+    {
+	int sz = boost::python::extract(pickled[0]);
+	boost::python::list entries = boost::python::list(pickled[1]);
+	_pop.resize(sz);
+	for (unsigned i = 0; i != _pop.size(); ++i)
+	{
+	    PyEO_pickle_suite::setstate(_pop[i], boost::python::tuple(entries[i]) );
+	}
+    }
+};
+
+
+template 
+boost::python::str to_string(T& _p)
+{
+    std::ostringstream os;
+    _p.printOn(os);
+    return boost::python::str(os.str().c_str());
+}
+
+void pop_sort(eoPop& pop) { pop.sort(); }
+void pop_shuffle(eoPop& pop) { pop.shuffle(); }
+
+void translate_index_error(index_error const& e)
+{
+        PyErr_SetString(PyExc_IndexError, e.what.c_str());
+}
+
+PyEO& pop_getitem(eoPop& pop, boost::python::object key)
+{
+    boost::python::extract x(key);
+    if (!x.check())
+	throw index_error("Slicing not allowed");
+
+    int i = x();
+
+    if (static_cast(i) >= pop.size())
+    {
+	throw index_error("Index out of bounds");
+    }
+    return pop[i];
+}
+
+void pop_setitem(eoPop& pop, boost::python::object key, PyEO& value)
+{
+    boost::python::extract x(key);
+    if (!x.check())
+	throw index_error("Slicing not allowed");
+
+    int i = x();
+
+    if (static_cast(i) >= pop.size())
+    {
+	throw index_error("Index out of bounds");
+    }
+
+    pop[i] = value;
+}
+
+void pop_push_back(eoPop& pop, PyEO& p) { pop.push_back(p); }
+void pop_resize(   eoPop& pop, unsigned i) { pop.resize(i); }
+
+extern void abstract1();
+extern void algos();
+extern void random_numbers();
+extern void geneticOps();
+extern void selectOne();
+extern void continuators();
+extern void reduce();
+extern void replacement();
+extern void selectors();
+extern void breeders();
+extern void mergers();
+extern void valueParam();
+extern void perf2worth();
+extern void monitors();
+extern void statistics();
+
+BOOST_PYTHON_MODULE(PyEO)
+{
+    using namespace boost::python;
+
+    boost::python::register_exception_translator(&translate_index_error);
+
+    boost::python::class_("EO")
+	.add_property("fitness", &PyEO::getFitness, &PyEO::setFitness)
+	.add_property("genome", &PyEO::getGenome, &PyEO::setGenome)
+	.def_pickle(PyEO_pickle_suite())
+	.def("invalidate", &PyEO::invalidate)
+	.def("invalid", &PyEO::invalid)
+	.def("__str__", &PyEO::to_string)
+	;
+
+    boost::python::class_ >("eoPop", init<>() )
+	.def( init< unsigned, eoInit& >()[with_custodian_and_ward<1,3>()] )
+	.def("append", &eoPop::append)
+	.def("__str__", to_string >)
+	.def("__len__", &eoPop::size)
+	.def("sort",    pop_sort )
+	.def("shuffle", pop_shuffle)
+	.def("__getitem__", pop_getitem, return_internal_reference<>() )
+	.def("__setitem__", pop_setitem)
+	.def("best", &eoPop::best_element, return_internal_reference<>() )
+	.def("push_back", pop_push_back)
+	.def("resize",    pop_resize)
+	.def_pickle(pyPop_pickle_suite())
+	;
+
+
+    // Other definitions in different compilation units,
+    // this to avoid having g++ to choke on the load
+    random_numbers();
+    valueParam();
+    abstract1();
+    geneticOps();
+    selectOne();
+    selectors();
+    perf2worth();
+    monitors();
+    statistics();
+    continuators();
+    reduce();
+    replacement();
+    breeders();
+    mergers();
+    algos();
+
+    // The traits class
+    class_("PyFitness");
+
+	def("nObjectives", &PyFitness::nObjectives);
+	def("tol", &PyFitness::tol);
+	def("maximizing", &PyFitness::maximizing);
+	def("setObjectivesSize", &PyFitness::setObjectivesSize);
+	def("setObjectivesValue", &PyFitness::setObjectivesValue);
+	def("dominates", dominates);
+}
+
+
+// to avoid having to build with libeo.a
+ostream & operator << ( ostream& _os, const eoPrintable& _o ) {
+            _o.printOn(_os);
+	            return _os;
+};
diff --git a/trunk/paradiseo-eo/src/pyeo/PyEO.h b/trunk/paradiseo-eo/src/pyeo/PyEO.h
new file mode 100644
index 000000000..6cf3c003c
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/PyEO.h
@@ -0,0 +1,156 @@
+/*
+    PyEO
+    
+    Copyright (C) 2003 Maarten Keijzer
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+*/
+
+#ifndef PYEO_H
+#define PYEO_H
+
+
+#include 
+#include 
+#include 
+#include 
+
+#include 
+struct index_error : public std::exception { 
+    index_error(std::string w) : what(w) {}; 
+    virtual ~index_error() throw() {}
+    std::string what; 
+};
+
+class PyFitness : public boost::python::object
+{
+    public :
+    
+    typedef PyFitness fitness_traits; // it's its own traits class :-)
+	
+    PyFitness() : boost::python::object() {}
+    
+    template 
+    PyFitness(const T& o) : boost::python::object(o) {}
+    
+    static unsigned nObjectives() { return objective_info.size(); }
+    static double tol() { return 1e-6; }
+    static bool maximizing(int which) { return objective_info[which] > 0; }
+    
+    static void setObjectivesSize(int sz) { objective_info.resize(sz, 0); }
+    static void setObjectivesValue(unsigned which, int value)
+    {
+	if (which >= objective_info.size())
+	{
+	    throw index_error("Too few elements allocated, resize objectives first");
+	}
+
+	objective_info[which] = value;
+    }
+    
+    static std::vector objective_info;
+    
+    bool dominates(const PyFitness& oth) const;
+    
+    double operator[](int i) const 
+    { 
+	boost::python::extract x(object::operator[](i)); 
+    
+	if (!x.check())
+	    throw std::runtime_error("PyFitness: does not contain doubles");
+	return x();
+    }
+ 
+    bool operator<(const PyFitness& other) const 
+    { 
+	if (objective_info.size() == 0)
+	{
+	    const object& self = *this;
+	    const object& oth = other;
+	    return self < oth;
+	}
+	// otherwise use objective_info
+    
+	for (unsigned i = 0; i < objective_info.size(); ++i)
+	{
+	    double a = objective_info[i] * operator[](i);
+	    double b = objective_info[i] * other[i];
+
+	    if ( fabs(a - b) > tol())
+	    {
+		if (a < b)
+		    return true;
+		return false;
+	    }
+	}
+
+	return false;
+    }
+    
+    bool operator>(const PyFitness& other) const 
+    { 
+	return other.operator<(*this);
+    }
+    
+    void printOn(std::ostream& os) const { const boost::python::object& o = *this; boost::python::api::operator<<(os,o); }
+    friend std::ostream& operator<<(std::ostream& os, const PyFitness& p) { p.printOn(os); return os;  }
+    friend std::istream& operator>>(std::istream& is, PyFitness& p) { boost::python::object o; is >> o; p = o; return is; }
+};
+
+struct PyEO : public EO< PyFitness  >
+{  
+    typedef PyFitness Fitness;
+    
+    boost::python::object getFitness() const { return invalid()? Fitness(): fitness(); }
+    void setFitness(boost::python::object f) { if (f == Fitness()) invalidate(); else fitness(f); }
+
+    boost::python::object getGenome() const { return genome; }
+    void setGenome(boost::python::object g) { genome = g; }
+    boost::python::object genome;
+    
+    std::string to_string() const
+    {
+	std::string result;
+	result += boost::python::extract(boost::python::str(getFitness()));
+	result += ' ';
+	result += boost::python::extract(boost::python::str(genome));
+	return result;
+    }
+
+    bool operator<(const PyEO& other) const { return EO::operator<(other); }
+    bool operator>(const PyEO& other) const { return EO::operator>(other); }
+
+};
+
+std::ostream& operator<<(std::ostream& os, const PyEO& _eo);
+
+struct PyEO_pickle_suite : boost::python::pickle_suite
+{
+    typedef PyEO::Fitness Fitness;
+    
+    static
+    boost::python::tuple getstate(const PyEO& _eo)
+    {
+	return boost::python::make_tuple(_eo.getFitness(), _eo.genome);
+    }
+    static
+    void setstate(PyEO& _eo, boost::python::tuple pickled)
+    {
+	_eo.setFitness( Fitness(pickled[0]) );
+	_eo.genome = pickled[1];
+    }
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/pyeo/PyEO/CVS/Entries b/trunk/paradiseo-eo/src/pyeo/PyEO/CVS/Entries
new file mode 100644
index 000000000..0118ae6c4
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/PyEO/CVS/Entries
@@ -0,0 +1,2 @@
+/__init__.py/1.2/Wed Mar 19 10:16:56 2003//
+D
diff --git a/trunk/paradiseo-eo/src/pyeo/PyEO/CVS/Repository b/trunk/paradiseo-eo/src/pyeo/PyEO/CVS/Repository
new file mode 100644
index 000000000..8ea8e34db
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/PyEO/CVS/Repository
@@ -0,0 +1 @@
+eo/src/pyeo/PyEO
diff --git a/trunk/paradiseo-eo/src/pyeo/PyEO/CVS/Root b/trunk/paradiseo-eo/src/pyeo/PyEO/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/PyEO/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/src/pyeo/PyEO/__init__.py b/trunk/paradiseo-eo/src/pyeo/PyEO/__init__.py
new file mode 100644
index 000000000..cc6795425
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/PyEO/__init__.py
@@ -0,0 +1,87 @@
+
+from PyEO import *
+
+try:
+    import Gnuplot
+except ImportError:
+    print "Python support for Gnuplot not found"
+else:
+
+    class eoGnuplot1DMonitor(eoMonitor):
+	def __init__(self):
+	    eoMonitor.__init__(self)
+	    self.values = []
+	    self.indices = []
+	    self.g = Gnuplot.Gnuplot()
+	    self.g.reset();
+	    
+	    
+	def handleParam(self, i, param):
+	    param = float(param)
+
+	    while len(self.values) <= i:
+		self.values.append( [] )
+
+	    self.values[i].append(param)
+	    
+	def __call__(self):
+	     
+	    l = len(self)
+
+	    if l > 3 or l == 0:
+		print 'Can only handle 1 to 3 params currently'
+	   
+	    i = 0
+	    for param in self:
+		self.handleParam(i,param)
+		i += 1
+	    
+	    self.indices.append( len(self.indices) )
+
+
+	    data1 = Gnuplot.Data(self.indices, self.values[0], with = 'lines')
+	    
+	    if l == 1:
+		self.g.plot(data1)
+	    else:
+		data2 = Gnuplot.Data(self.indices, self.values[1], with = 'lines')
+
+		if l == 2:
+		    self.g.plot(data1, data2)
+		else:
+		    data3 = Gnuplot.Data(self.indices, self.values[2], with = 'lines')
+
+		    self.g.plot(data1, data2, data3)
+
+def SeperatedVolumeMonitor(eoMonitor):
+    def __init__(self, file):
+	eoMonitor.__init__(self)
+	self.file = file
+	self.initialized = None;
+
+    def __call__(self):
+	pass
+
+class eoStat(eoStatBase, eoValueParam):
+    def __init__(self):
+	eoStatBase.__init__(self)
+	eoValueParam.__init__(self)
+    
+class eoSortedStat(eoSortedStatBase, eoValueParam):
+    def __init__(self):
+	eoSortedStatBase.__init__(self)
+	eoValueParam.__init__(self)
+
+class eoAverageStat(eoStat):
+    def __call__(self, pop):
+	sum = 0.0;
+	for indy in pop:
+	    sum += indy.fitness
+
+	sum /= len(pop)
+	self.object = sum
+
+class eoBestFitnessStat(eoSortedStat):
+
+    def __call__(self, pop):
+	self.object = pop[0].fitness
diff --git a/trunk/paradiseo-eo/src/pyeo/README b/trunk/paradiseo-eo/src/pyeo/README
new file mode 100644
index 000000000..072fe3ad2
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/README
@@ -0,0 +1,4 @@
+
+See BUILDING for details on how to build this thing
+
+
diff --git a/trunk/paradiseo-eo/src/pyeo/abstract1.cpp b/trunk/paradiseo-eo/src/pyeo/abstract1.cpp
new file mode 100644
index 000000000..e8e847772
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/abstract1.cpp
@@ -0,0 +1,46 @@
+/*
+    PyEO
+    
+    Copyright (C) 2003 Maarten Keijzer
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+*/
+
+#include 
+#include 
+#include 
+#include 
+#include 
+
+#include "PyEO.h"
+#include "def_abstract_functor.h"
+
+using namespace boost::python;
+
+void abstract1()
+{
+    /* Abstract Classes: overrideble from python */
+    def_abstract_functor >("eoEvalFunc");
+    def_abstract_functor >("eoInit");
+  
+    def_abstract_functor >("eoTransform");
+    
+    class_, bases > >("eoSGATransform",
+	    init< eoQuadOp&, double,
+		  eoMonOp&, double>())
+	.def("__call__", &eoSGATransform::operator());
+    
+    def_abstract_functor >("eoPopEvalFunc");
+}  
diff --git a/trunk/paradiseo-eo/src/pyeo/algos.cpp b/trunk/paradiseo-eo/src/pyeo/algos.cpp
new file mode 100644
index 000000000..12feaf196
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/algos.cpp
@@ -0,0 +1,106 @@
+/*
+    PyEO
+    
+    Copyright (C) 2003 Maarten Keijzer
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+*/
+
+#include 
+#include 
+#include 
+#include 
+
+#include "PyEO.h"
+#include "def_abstract_functor.h"
+
+using namespace boost::python;
+
+void algos()
+{
+    def_abstract_functor >("eoAlgo");
+    
+    /* Algorithms */
+    class_, bases >, boost::noncopyable>("eoSGA", 
+	    init&, 
+	    eoQuadOp&, float,
+	    eoMonOp&, float,
+	    eoEvalFunc&, 
+	    eoContinue&>()
+	    [
+	    with_custodian_and_ward<1,2,
+		with_custodian_and_ward<1,3,
+		    with_custodian_and_ward<1,5,
+			with_custodian_and_ward<1,7,
+			    with_custodian_and_ward<1,8>
+			>
+		    >
+		>
+	    >()
+	    ])
+	.def("__call__", &eoSGA::operator())
+	;
+   
+    class_, bases > >("eoEasyEA",
+	      init<
+		eoContinue&,
+		eoEvalFunc&,
+		eoBreed&,
+		eoReplacement& >() )
+	.def( init<
+		eoContinue&,
+		eoPopEvalFunc&,
+		eoBreed&,
+		eoReplacement&>() )
+	.def( init<
+		eoContinue&,
+		eoEvalFunc&,
+		eoBreed&,
+		eoMerge&,
+		eoReduce& >() )
+	.def( init<
+		eoContinue&,
+		eoEvalFunc&,
+		eoSelect&,
+		eoTransform&,
+		eoReplacement&>())
+	.def( init<
+		eoContinue&,
+	        eoEvalFunc&,
+	        eoSelect&,
+	        eoTransform&,
+	        eoMerge&,
+		eoReduce&>())
+	.def("__call__", &eoEasyEA::operator())
+	;
+   
+    /*
+    class_, bases< eoAlgo > >("eoCellularEasyEA", 
+	    init<   eoContinue&,
+		    eoEvalFunc&,
+		    eoSelectOne&,
+		    eoBinOp&,
+		    eoMonOp&,
+		    eoSelectOne&>())
+	.def(
+	    init<   eoContinue&,
+		    eoEvalFunc&,
+		    eoSelectOne&,
+		    eoQuadOp&,
+		    eoMonOp&,
+		    eoSelectOne&>())
+	;
+    */
+}
diff --git a/trunk/paradiseo-eo/src/pyeo/breeders.cpp b/trunk/paradiseo-eo/src/pyeo/breeders.cpp
new file mode 100644
index 000000000..30cf0994c
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/breeders.cpp
@@ -0,0 +1,51 @@
+/*
+    PyEO
+    
+    Copyright (C) 2003 Maarten Keijzer
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+*/
+
+#include 
+#include 
+#include 
+
+#include "PyEO.h"
+#include "def_abstract_functor.h"
+
+using namespace boost::python;
+
+#define DEF3(x, i1, i2) class_, bases > >(#x, \
+	init()[with_custodian_and_ward<1,2,with_custodian_and_ward<1,3> >()])\
+	.def("__call__", &eoBreed::operator())
+
+void breeders()
+{
+    def_abstract_functor >("eoBreed");
+
+    DEF3(eoSelectTransform, eoSelect&, eoTransform&);
+
+    DEF3(eoGeneralBreeder, eoSelectOne&, eoGenOp&)
+	.def( init&, eoGenOp&, double>()[WC2])
+	.def( init&, eoGenOp&, double, bool>()[WC2] )
+	.def( init&, eoGenOp&, eoHowMany>() );
+
+
+    DEF3(eoOneToOneBreeder, eoGenOp&, eoEvalFunc&)
+	.def( init&, eoEvalFunc&, double>()[WC2] )
+	.def( init&, eoEvalFunc&, double, eoHowMany>()[WC2] );
+
+}
+
diff --git a/trunk/paradiseo-eo/src/pyeo/continuators.cpp b/trunk/paradiseo-eo/src/pyeo/continuators.cpp
new file mode 100644
index 000000000..4f1a76c50
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/continuators.cpp
@@ -0,0 +1,90 @@
+/*
+    PyEO
+    
+    Copyright (C) 2003 Maarten Keijzer
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+*/
+
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+
+#include "PyEO.h"
+#include "def_abstract_functor.h"
+
+using namespace boost::python;
+
+#define DEF(x) class_, bases > >(#x).def("__call__", &eoContinue::operator())
+#define DEF2(x, i1) class_, bases > >(#x, init() ).def("__call__", &eoContinue::operator())
+#define DEF3(x, i1, i2) class_, bases > >(#x, init() ).def("__call__", &eoContinue::operator())
+
+void add_checkpoint();
+
+void continuators()
+{
+    /* Counters, wrappers etc */
+    
+    class_, bases > >("eoEvalFuncCounter",
+	    init< eoEvalFunc&, std::string>())
+	.def("__call__", &eoEvalFuncCounter::operator())
+	;
+    /* Continuators */
+    def_abstract_functor >("eoContinue"); 
+	
+    class_, bases >, boost::noncopyable >("eoGenContinue", init() )
+	.def("__call__", &eoGenContinue::operator())
+	;
+  
+    class_, bases > >("eoCombinedContinue", init&>()[WC1])
+	.def( init&, eoContinue& >()[WC2] )
+	.def("add", &eoCombinedContinue::add, WC1)
+	.def("__call__", &eoCombinedContinue::operator())
+	;
+   
+    class_, bases > >("eoEvalContinue", 
+	    init&, unsigned long>()[WC1])
+	.def("__call__", &eoEvalContinue::operator())
+	;
+
+    DEF2(eoFitContinue, object); // object is the fitness type
+
+    DEF3(eoSteadyFitContinue, unsigned long, unsigned long);
+
+    add_checkpoint();
+}
+
+void addContinue(eoCheckPoint& c, eoContinue& cc) { c.add(cc); }
+void addMonitor(eoCheckPoint& c, eoMonitor& m) { c.add(m);}
+void addStat(eoCheckPoint& c, eoStatBase& s) { c.add(s);}
+void addSortedStat(eoCheckPoint& c, eoSortedStatBase& s) { c.add(s);}
+
+void add_checkpoint()
+{
+    class_, bases< eoContinue > >("eoCheckPoint",
+	    
+	    init&> ()[with_custodian_and_ward<1,2>()]
+	    ) 
+	.def("add", addContinue, with_custodian_and_ward<1,2>() )
+	.def("add", addMonitor, with_custodian_and_ward<1,2>() )
+	.def("add", addStat, with_custodian_and_ward<1,2>())
+	.def("add", addSortedStat, with_custodian_and_ward<1,2>()) 
+	.def("__call__", &eoCheckPoint::operator())
+	;
+}
diff --git a/trunk/paradiseo-eo/src/pyeo/def_abstract_functor.h b/trunk/paradiseo-eo/src/pyeo/def_abstract_functor.h
new file mode 100644
index 000000000..7324dc481
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/def_abstract_functor.h
@@ -0,0 +1,139 @@
+/*
+    PyEO
+    
+    Copyright (C) 2003 Maarten Keijzer
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+*/
+
+#ifndef MAKE_ABSTRACT_FUNCTOR_H
+#define MAKE_ABSTRACT_FUNCTOR_H
+
+#include 
+
+// DEFINES for call 
+#define WC1 boost::python::with_custodian_and_ward<1,2>()
+#define WC2 boost::python::with_custodian_and_ward<1,2, with_custodian_and_ward<1,3> >()
+
+namespace eoutils {
+
+using namespace boost::python;
+    
+template 
+class ProcWrapper : public Proc
+{
+    public:
+    PyObject* self;
+    ProcWrapper(PyObject* s) : self(s) {}
+
+    typename Proc::result_type operator()(void)
+    {
+	return boost::python::call_method(self, "__call__");
+    }
+};
+
+template 
+void make_abstract_functor(std::string name, typename eoFunctorBase::procedure_tag)
+{
+    typedef ProcWrapper Wrapper;
+    boost::python::class_(name.c_str(), boost::python::init<>() )
+	.def("__call__", &Wrapper::operator());
+}
+
+template 
+void make_abstract_functor_ref(std::string name, typename eoFunctorBase::procedure_tag)
+{
+    typedef ProcWrapper Wrapper;
+    boost::python::class_(name.c_str(), boost::python::init<>() )
+	.def("__call__", &Wrapper::operator(), boost::python::return_internal_reference<>());
+}
+
+template 
+class UnaryWrapper : public Unary
+{
+    public:
+    PyObject* self;
+    UnaryWrapper(PyObject* s) : self(s) {}
+
+    typename Unary::result_type operator()(typename Unary::argument_type a) 
+    { 
+	return boost::python::call_method(self, "__call__", boost::ref(a) ); 
+    }
+};
+
+template 
+void make_abstract_functor(std::string name, typename eoFunctorBase::unary_function_tag)
+{
+    typedef UnaryWrapper Wrapper;
+
+    boost::python::class_(name.c_str(), boost::python::init<>() )
+	.def("__call__", &Wrapper::operator())
+	;
+}
+
+template 
+void make_abstract_functor_ref(std::string name, typename eoFunctorBase::unary_function_tag)
+{
+    typedef UnaryWrapper Wrapper;
+
+    boost::python::class_(name.c_str(), boost::python::init<>() )
+	.def("__call__", &Wrapper::operator(), boost::python::return_internal_reference<>() )
+	;
+}
+
+template 
+class BinaryWrapper : public Binary
+{
+    public:
+    PyObject* self;
+    BinaryWrapper(PyObject* s) : self(s) {}
+    typename Binary::result_type operator()(typename Binary::first_argument_type a1, typename Binary::second_argument_type a2)
+    {
+	return boost::python::call_method<
+	    typename Binary::result_type>(self, "__call__", boost::ref(a1), boost::ref(a2) );
+    }
+};
+
+template 
+void make_abstract_functor(std::string name, typename eoFunctorBase::binary_function_tag)
+{
+    typedef BinaryWrapper Wrapper;
+    boost::python::class_(name.c_str(), boost::python::init<>() )
+	.def("__call__", &Wrapper::operator());
+}
+
+template 
+void make_abstract_functor_ref(std::string name, typename eoFunctorBase::binary_function_tag)
+{
+    typedef BinaryWrapper Wrapper;
+    boost::python::class_(name.c_str(), boost::python::init<>() )
+	.def("__call__", &Wrapper::operator(), boost::python::return_internal_reference<>() );
+}
+
+}// namespace eoutils
+
+template 
+void def_abstract_functor(std::string name)
+{
+    eoutils::make_abstract_functor(name, Functor::functor_category());
+}
+
+template 
+void def_abstract_functor_ref(std::string name)
+{
+    eoutils::make_abstract_functor_ref(name, Functor::functor_category());
+}
+
+#endif
diff --git a/trunk/paradiseo-eo/src/pyeo/geneticOps.cpp b/trunk/paradiseo-eo/src/pyeo/geneticOps.cpp
new file mode 100644
index 000000000..2665837b2
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/geneticOps.cpp
@@ -0,0 +1,158 @@
+/*
+    PyEO
+    
+    Copyright (C) 2003 Maarten Keijzer
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+*/
+
+#include 
+#include 
+#include 
+#include 
+#include 
+
+#include "PyEO.h"
+#include "def_abstract_functor.h"
+
+using namespace boost::python;
+
+class GenOpWrapper : public eoGenOp
+{
+    public:
+
+    PyObject* self;
+    GenOpWrapper(PyObject* p) : self(p) {}
+    unsigned max_production(void)
+    {
+	return call_method(self,"max_production");
+    }
+    std::string className() const
+    {
+	return "GenOpDerivative"; // never saw the use of className anyway
+    }
+    
+    void apply(eoPopulator& populator )
+    {
+	boost::python::call_method(self,"apply", boost::ref( populator ) );
+    }
+};
+
+class PopulatorWrapper : public eoPopulator
+{
+public:
+    PyObject* self;
+    PopulatorWrapper(PyObject* p, const eoPop& src, eoPop& dest) 
+	: eoPopulator(src, dest), self(p) 
+	{
+	    //throw std::runtime_error("abstract base class");
+	}
+    
+    const PyEO& select()
+    {
+	return call_method(self,"select");
+    }
+};
+
+class MonOpWrapper : public eoMonOp
+{
+public:
+    PyObject* self;
+    MonOpWrapper(PyObject* p) : self(p) {}
+    bool operator()(PyEO& _eo)
+    { return boost::python::call_method(self, "__call__", boost::ref( _eo )); }
+};
+class BinOpWrapper : public eoBinOp
+{
+public:
+    PyObject* self;
+    BinOpWrapper(PyObject* p) : self(p) {}
+    bool operator()(PyEO& _eo, const PyEO& _eo2)
+    { return boost::python::call_method(self, "__call__", boost::ref( _eo ), boost::ref(_eo2)); }
+};
+class QuadOpWrapper : public eoQuadOp
+{
+public:
+    PyObject* self;
+    QuadOpWrapper(PyObject* p) : self(p) {}
+    bool operator()(PyEO& _eo, PyEO& _eo2)
+    { return boost::python::call_method(self, "__call__", boost::ref( _eo ), boost::ref(_eo2)); }
+};
+
+void geneticOps()
+{
+    class_, PopulatorWrapper, boost::noncopyable>
+	("eoPopulator", init&, eoPop&>() )
+	.def("select", &PopulatorWrapper::select,  return_internal_reference<>() )
+	.def("get", &eoPopulator::operator*, return_internal_reference<>() )
+	.def("next", &eoPopulator::operator++, return_internal_reference<>() )
+	.def("insert", &eoPopulator::insert)
+	.def("reserve", &eoPopulator::reserve)
+	.def("source", &eoPopulator::source, return_internal_reference<>() )
+	.def("offspring", &eoPopulator::offspring, return_internal_reference<>() )
+	.def("tellp", &eoPopulator::tellp)
+	.def("seekp", &eoPopulator::seekp)
+	.def("exhausted", &eoPopulator::exhausted)
+	;
+
+    class_, bases > >
+	("eoSeqPopulator", init&, eoPop&>() )
+	.def("select", &eoSeqPopulator::select, return_internal_reference<>() )
+	;
+    
+    class_, bases > >
+	("eoSelectivePopulator", init&, eoPop&, eoSelectOne& >() )
+	.def("select", &eoSeqPopulator::select, return_internal_reference<>() )
+	;
+    enum_::OpType>("OpType")
+	.value("unary", eoOp::unary)
+	.value("binary", eoOp::binary)
+	.value("quadratic", eoOp::quadratic)
+	.value("general", eoOp::general)
+	;
+   
+    class_ >("eoOp", init::OpType>())
+	.def("getType", &eoOp::getType);
+    
+    class_, MonOpWrapper, bases >, boost::noncopyable>("eoMonOp", init<>())
+	.def("__call__", &MonOpWrapper::operator(), "an example docstring");
+    class_, BinOpWrapper, bases >, boost::noncopyable>("eoBinOp", init<>())
+	.def("__call__", &BinOpWrapper::operator());
+    class_, QuadOpWrapper, bases >, boost::noncopyable>("eoQuadOp", init<>())
+	.def("__call__", &QuadOpWrapper::operator());
+    
+    class_, GenOpWrapper, bases >, boost::noncopyable>("eoGenOp", init<>())
+	.def("max_production", &GenOpWrapper::max_production)
+	.def("className", &GenOpWrapper::className)
+	.def("apply", &GenOpWrapper::apply)
+	.def("__call__", &eoGenOp::operator())
+	;
+    
+    class_, bases >, boost::noncopyable>("eoSequentialOp", init<>())
+	.def("add", &eoSequentialOp::add, WC1)
+	.def("apply", &eoSequentialOp::apply)
+	;
+   
+    class_, bases >, boost::noncopyable>("eoProportionalOp", init<>())
+	.def("add", &eoProportionalOp::add, WC1)
+	.def("apply", &eoProportionalOp::apply)
+	;
+    
+    /* Cloning */
+    class_, bases > >("eoMonCloneOp").def("__call__", &eoMonCloneOp::operator());
+    class_, bases > >("eoBinCloneOp").def("__call__", &eoBinCloneOp::operator());
+    class_, bases > >("eoQuadCloneOp").def("__call__", &eoQuadCloneOp::operator());
+
+}
diff --git a/trunk/paradiseo-eo/src/pyeo/mergers.cpp b/trunk/paradiseo-eo/src/pyeo/mergers.cpp
new file mode 100644
index 000000000..fd2b34110
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/mergers.cpp
@@ -0,0 +1,41 @@
+/*
+    PyEO
+    
+    Copyright (C) 2003 Maarten Keijzer
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+*/
+
+#include 
+#include "PyEO.h"
+#include "def_abstract_functor.h"
+
+using namespace boost::python;
+
+#define DEF(x) class_, bases > >(#x).def("__call__", &eoMerge::operator())
+#define DEF2(x, i1) class_, bases > >(#x, init() ).def("__call__", &eoMerge::operator())
+#define DEF3(x, i1, i2) class_, bases > >(#x, init() ).def("__call__", &eoMerge::operator())
+
+void mergers()
+{
+    def_abstract_functor >("eoMerge");
+    
+    DEF2(eoElitism, double)
+	.def( init() );
+    DEF(eoNoElitism);
+    DEF(eoPlus);
+
+}
+
diff --git a/trunk/paradiseo-eo/src/pyeo/monitors.cpp b/trunk/paradiseo-eo/src/pyeo/monitors.cpp
new file mode 100644
index 000000000..8215128d7
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/monitors.cpp
@@ -0,0 +1,72 @@
+/*
+    PyEO
+    
+    Copyright (C) 2003 Maarten Keijzer
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+*/
+
+#include 
+#include 
+#include "PyEO.h"
+
+using namespace boost::python;
+
+class MonitorWrapper : public eoMonitor
+{
+    public:
+	PyObject* self;
+	list objects;
+	
+	MonitorWrapper(PyObject* p) :self(p) {}
+
+	eoMonitor& operator()()
+	{
+	    call_method(self, "__call__");
+	    return *this;
+	}
+
+	std::string getString(int i)
+	{
+	    if (static_cast(i) >= vec.size())
+	    {
+		throw index_error("Index out of bounds");
+	    }
+	    
+	    return vec[i]->getValue();
+	}
+
+	unsigned size() { return vec.size(); }
+};
+
+void monitors()
+{
+    /** 
+     * Change of interface: I encountered some difficulties with 
+     * transferring eoParams from and to Python, so now we can
+     * only get at the strings contained in the eoParams.
+     * sorry
+     */
+    
+    class_("eoMonitor", init<>())
+	.def("lastCall", &eoMonitor::lastCall)
+	.def("add", &eoMonitor::add)
+	.def("__call__", &MonitorWrapper::operator(), return_internal_reference<1>() )
+	.def("__getitem__", &MonitorWrapper::getString, 
+		"Returns the string value of the indexed Parameter")	
+	.def("__len__", &MonitorWrapper::size)
+	;
+}
+
diff --git a/trunk/paradiseo-eo/src/pyeo/perf2worth.cpp b/trunk/paradiseo-eo/src/pyeo/perf2worth.cpp
new file mode 100644
index 000000000..3ca13996d
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/perf2worth.cpp
@@ -0,0 +1,88 @@
+/*
+    PyEO
+    
+    Copyright (C) 2003 Maarten Keijzer
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+*/
+#include 
+
+#include "PyEO.h"
+
+using namespace boost::python;
+
+struct Perf2WorthWrapper : public eoPerf2Worth
+{
+    PyObject* self;
+    Perf2WorthWrapper(PyObject* p) : self(p) {}
+
+    void operator()( const eoPop& pop)
+    {
+	call_method(self, "__call__", boost::ref(pop));
+    }
+    
+};
+
+numeric::array get_worths(eoPerf2Worth& p)
+{
+    std::vector& worths = p.value();
+    list result;
+	
+    for (unsigned i = 0; i < worths.size(); ++i)
+	result.append(worths[i]);
+    
+    return numeric::array(result);
+}
+
+struct CachedPerf2WorthWrapper : public eoPerf2WorthCached
+{
+    PyObject* self;
+    CachedPerf2WorthWrapper(PyObject* p) : self(p) {}
+
+    void calculate_worths(const eoPop& pop)
+    {
+	call_method(self, "calculate_worths", boost::ref(pop));
+    }
+};
+
+void perf2worth() 
+{
+    //numeric::array::set_module_and_type("Numeric", "ArrayType");
+    
+    class_<
+	eoPerf2Worth, 
+	Perf2WorthWrapper,
+	bases< eoValueParam > >,
+	boost::noncopyable>("eoPerf2Worth", init<>())
+	
+	    .def("__call__", &Perf2WorthWrapper::operator())
+	    .def("sort_pop", &eoPerf2Worth::sort_pop)
+	   //.def("value", get_worths)
+	;
+
+    class_, CachedPerf2WorthWrapper, bases >, boost::noncopyable>
+	("eoPerf2WorthCached", init<>())
+	.def("__call__", &eoPerf2WorthCached::operator())
+	.def("calculate_worths", &CachedPerf2WorthWrapper::calculate_worths)
+	;
+    
+    //class_, bases > >("eoNoPerf2Worth")
+//	.def("__call__", &eoNoPerf2Worth::operator());
+	
+    class_, bases > >("eoNDSorting_II")
+	.def("calculate_worths", &eoNDSorting_II::calculate_worths);
+}
+
+
diff --git a/trunk/paradiseo-eo/src/pyeo/pickle.h b/trunk/paradiseo-eo/src/pyeo/pickle.h
new file mode 100644
index 000000000..c4219016c
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/pickle.h
@@ -0,0 +1,69 @@
+/*
+    PyEO
+
+    Copyright (C) 2003 Maarten Keijzer
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+*/
+
+#ifndef PICKLE_H
+#define PICKLE_h
+
+#include 
+
+#include 
+#include 
+/** Implements pickle support for eoPersistent derivatives */
+
+
+template 
+struct T_pickle_suite : boost::python::pickle_suite
+{
+    static
+    std::string print_to_string(const T& t)
+    {
+	std::ostringstream os;
+	t.printOn(os);
+	os << std::ends;
+	return os.str();
+    }
+
+    static
+    boost::python::tuple getstate(const T& t)
+    {
+	std::string s = print_to_string(t);
+	return boost::python::make_tuple( boost::python::str(s));
+    }
+
+    static
+    void setstate(T& t, boost::python::tuple pickled)
+    {
+	std::string s = boost::python::extract(pickled[0]);
+	std::istringstream is(s);
+	t.readFrom(is);
+    }
+};
+
+/** Defines persistency through pickle support by using std::strings
+ * so while we're at it, we will .def("__str__") as well
+ */
+template 
+boost::python::class_& pickle(boost::python::class_& c)
+{
+    return c.def_pickle(T_pickle_suite())
+	.def("__str__", T_pickle_suite::print_to_string);
+}
+
+#endif
diff --git a/trunk/paradiseo-eo/src/pyeo/random_numbers.cpp b/trunk/paradiseo-eo/src/pyeo/random_numbers.cpp
new file mode 100644
index 000000000..100ac38e0
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/random_numbers.cpp
@@ -0,0 +1,107 @@
+/*
+    PyEO
+
+    Copyright (C) 2003 Maarten Keijzer
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+*/
+
+#include 
+#include 
+
+using namespace boost::python;
+
+#include 
+#include 
+
+using namespace boost::python;
+
+namespace eo
+{
+    eoRng rng(time(0));
+}
+
+eoRng& get_rng() { return rng; }
+double normal(eoRng& rng) { return rng.normal(); }
+
+std::string rng_to_string(const eoRng& _rng)
+{
+    std::ostringstream os;
+    _rng.printOn(os);
+    os << std::ends;
+    return os.str();
+}
+
+
+void rng_from_string(eoRng& _rng, std::string s)
+{
+    std::istringstream is(s);
+    _rng.readFrom(is);
+}
+
+struct RNG_pickle_suite : boost::python::pickle_suite
+{
+    static
+    boost::python::tuple getstate(const eoRng& _rng)
+    {
+	return boost::python::make_tuple(str(rng_to_string(_rng)));
+    }
+    static
+    void setstate(eoRng& _rng, boost::python::tuple pickled)
+    {
+	std::string state = extract(pickled[0]);
+	rng_from_string(_rng, state);
+    }
+};
+
+int spin(eoRng& _rng, numeric::array values, double total)
+{
+   if (total == 0.0)
+   {
+	unsigned sz = len(values);
+	for (unsigned i = 0; i < sz; ++i)
+	{
+	    total += extract(values[i]); //extract?
+	}
+   }
+
+   double chance = _rng.uniform() * total;
+
+   int i = 0;
+   while (chance >= 0.0)
+       chance -= extract(values[i++]);
+
+   return --i;
+}
+
+void random_numbers()
+{
+    class_("eoRng", init())
+	.def("flip", &eoRng::flip)
+	.def("random", &eoRng::random)
+	.def("rand", &eoRng::rand)
+	.def("rand_max", &eoRng::rand_max)
+	.def("reseed", &eoRng::reseed)
+	.def("uniform", &eoRng::uniform)
+	.def("normal", normal)
+	.def("negexp", &eoRng::negexp)
+	.def("to_string", rng_to_string)
+	.def("from_string", rng_from_string)
+	.def("roulette_wheel", spin)
+	.def_pickle(RNG_pickle_suite())
+	;
+
+    def("rng", get_rng, return_value_policy());
+}
diff --git a/trunk/paradiseo-eo/src/pyeo/reduce.cpp b/trunk/paradiseo-eo/src/pyeo/reduce.cpp
new file mode 100644
index 000000000..a23c15cd5
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/reduce.cpp
@@ -0,0 +1,65 @@
+/*
+    PyEO
+    
+    Copyright (C) 2003 Maarten Keijzer
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+*/
+
+#include 
+
+#include "PyEO.h"
+
+using namespace boost::python;
+
+// unfortunately have to define it specially
+class eoReduceWrapper : public eoReduce
+{
+    public:
+    PyObject* self;
+    eoReduceWrapper(PyObject* s) : self(s) {}
+    void operator()(eoPop& pop, unsigned i)
+    {
+	boost::python::call_method(self, "__call__", pop, i );
+    }
+};
+
+void reduce()
+{
+    
+    // ref trick in def_abstract_functor does not work for unsigned int :-(
+    class_, eoReduceWrapper, boost::noncopyable>("eoReduce", init<>())
+	.def("__call__", &eoReduceWrapper::operator());
+
+    class_, bases > >("eoTruncate", init<>() )
+	.def("__call__", &eoReduce::operator())
+	;
+    class_, bases > >("eoRandomReduce")
+	.def("__call__", &eoReduce::operator())
+	;
+    class_, bases > >("eoEPReduce", init())
+	.def("__call__", &eoReduce::operator())
+	;
+    class_, bases > >("eoLinearTruncate")
+	.def("__call__", &eoReduce::operator())
+	;
+    class_, bases > >("eoDetTournamentTruncate", init())
+	.def("__call__", &eoReduce::operator())
+	;
+    class_, bases > >("eoStochTournamentTruncate", init())
+	.def("__call__", &eoReduce::operator())
+	;
+}
+
diff --git a/trunk/paradiseo-eo/src/pyeo/replacement.cpp b/trunk/paradiseo-eo/src/pyeo/replacement.cpp
new file mode 100644
index 000000000..9867a113f
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/replacement.cpp
@@ -0,0 +1,72 @@
+/*
+    PyEO
+    
+    Copyright (C) 2003 Maarten Keijzer
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+*/
+
+#include 
+#include 
+#include 
+#include 
+#include 
+
+#include "PyEO.h"
+#include "def_abstract_functor.h"
+
+using namespace boost::python;
+
+#define DEF(x) class_, bases > >(#x).def("__call__", &eoReplacement::operator())
+#define DEF2(x, i1) class_, bases > >(#x, init() ).def("__call__", &eoReplacement::operator())
+#define DEF3(x, i1, i2) class_, bases > >(#x, \
+	init() [WC2])\
+    .def("__call__", &eoReplacement::operator())
+
+void replacement()
+{
+    def_abstract_functor >("eoReplacement");
+
+    // eoReplacement.h
+    DEF(eoGenerationalReplacement); 
+    
+    class_, bases > > 
+	("eoWeakElitistReplacement",
+	 init< eoReplacement& >()[WC1]);
+    
+    // eoMergeReduce.h
+    DEF3(eoMergeReduce, eoMerge&, eoReduce& );
+    DEF(eoPlusReplacement);
+    DEF(eoCommaReplacement);
+    DEF2(eoEPReplacement, unsigned);
+
+    // eoReduceMerge.h
+    DEF3(eoReduceMerge, eoReduce&, eoMerge& );
+    DEF(eoSSGAWorseReplacement);
+    DEF2(eoSSGADetTournamentReplacement, unsigned);
+    DEF2(eoSSGAStochTournamentReplacement, double);
+
+    // eoReduceMergeReduce.h
+    //class_, bases > >("eoReplacement",
+//	    init&, 
+//		 eoHowMany, eoReduce&, eoReduce&>())
+//	.def("__call__", &eoReplacement::operator());
+	    
+    //eoMGGReplacement
+    DEF(eoMGGReplacement)
+	.def( init() )
+	.def( init() );
+}
+
diff --git a/trunk/paradiseo-eo/src/pyeo/selectOne.cpp b/trunk/paradiseo-eo/src/pyeo/selectOne.cpp
new file mode 100644
index 000000000..554a6e36a
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/selectOne.cpp
@@ -0,0 +1,107 @@
+/*
+    PyEO
+    
+    Copyright (C) 2003 Maarten Keijzer
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+*/
+
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+
+#include "PyEO.h"
+#include "pickle.h"
+#include "def_abstract_functor.h"
+
+using namespace boost::python;
+
+class eoSelectOneWrapper : public eoSelectOne
+{
+    public:
+    PyObject* self;
+    eoSelectOneWrapper(PyObject* p) : self(p) {}
+    const PyEO& operator()(const eoPop& pop) 
+    {
+	return boost::python::call_method< const PyEO& >(self, "__call__", boost::ref(pop));
+    }
+};
+
+template 
+void add_select(std::string name)
+{
+    class_ > >(name.c_str(), init<>() )
+	.def("__call__", &Select::operator(), return_internal_reference<>() )
+	;
+}
+
+template 
+void add_select(std::string name, Init init)
+{
+    class_ > >(name.c_str(), init)
+	.def("__call__", &Select::operator(), return_internal_reference<>() )
+	;
+}
+    
+template 
+void add_select(std::string name, Init1 init1, Init2 init2)
+{
+    class_ > >(name.c_str(), init1)
+	.def( init2 )
+	.def("__call__", &Select::operator(), return_internal_reference<>() )
+	.def("setup", &Select::setup);
+}
+
+void selectOne()
+{
+    /* Concrete classes */
+   
+    pickle(class_("eoHowMany", init<>())
+	.def( init() )
+	.def( init() )
+	.def( init() )
+	.def("__call__", &eoHowMany::operator())
+	.def("__neg__", &eoHowMany::operator-)
+	  ); 
+    
+    class_, eoSelectOneWrapper, boost::noncopyable>("eoSelectOne", init<>())
+	.def("__call__", &eoSelectOneWrapper::operator(), return_internal_reference<>() )
+	.def("setup", &eoSelectOne::setup);
+    
+    /* SelectOne derived classes */
+    
+    add_select >("eoDetTournamentSelect", init<>(), init() );
+    add_select >("eoStochTournamentSelect", init<>(), init() );
+    add_select  >("eoTruncatedSelectOne", 
+	    init&, double>()[WC1], init&, eoHowMany >()[WC1] );
+    
+    // eoProportionalSelect is not feasible to implement at this point as fitness is not recognizable as a float
+    // use eoDetTournament instead: with a t-size of 2 it is equivalent to eoProportional with linear scaling
+    //add_select >("eoProportionalSelect", init&>() );
+    
+    add_select >("eoRandomSelect");
+    add_select >("eoBestSelect");
+    add_select >("eoNoSelect");
+    
+    add_select >("eoSequentialSelect", init<>(), init());
+    add_select >("eoEliteSequentialSelect");
+    /*
+     * eoSelectFromWorth.h:class eoSelectFromWorth : public eoSelectOne
+    
+    */
+}
diff --git a/trunk/paradiseo-eo/src/pyeo/selectors.cpp b/trunk/paradiseo-eo/src/pyeo/selectors.cpp
new file mode 100644
index 000000000..ba8d405d6
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/selectors.cpp
@@ -0,0 +1,61 @@
+/*
+    PyEO
+    
+    Copyright (C) 2003 Maarten Keijzer
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+*/
+
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+
+#include "PyEO.h"
+#include "def_abstract_functor.h"
+
+using namespace boost::python;
+
+#define DEF(x) class_, bases > >(#x).def("__call__", &eoSelect::operator())
+#define DEF2(x, i1) class_, bases > >(#x, init()[WC1] ).def("__call__", &eoSelect::operator())
+#define DEF3(x, i1, i2) class_, bases > >(#x, init()[WC1] ).def("__call__", &eoSelect::operator())
+
+void selectors()
+{
+    def_abstract_functor >("eoSelect");
+
+    DEF(eoDetSelect).def( init() ).def( init() );
+    DEF3(eoSelectMany, eoSelectOne&, double)
+	.def( init< eoSelectOne&, double, bool>()[WC1] )
+	.def( init< eoSelectOne&, eoHowMany>()[WC1] );
+
+    DEF2(eoSelectNumber, eoSelectOne&)
+	.def( init< eoSelectOne&, unsigned>()[WC1]);
+
+    DEF2(eoSelectPerc, eoSelectOne&)
+	.def( init&, float>()[WC1] );
+
+    DEF3(eoTruncSelect, eoSelectOne&, eoHowMany);
+
+    class_, bases > >("eoTruncatedSelectMany",
+	    init&, double, double>()[WC1])
+	.def(init&, double, double, bool> ()[WC1])
+	.def(init&, double, double, bool, bool> ()[WC1])
+	.def(init&, eoHowMany, eoHowMany> ()[WC1]);
+	
+}
diff --git a/trunk/paradiseo-eo/src/pyeo/statistics.cpp b/trunk/paradiseo-eo/src/pyeo/statistics.cpp
new file mode 100644
index 000000000..9c436ba52
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/statistics.cpp
@@ -0,0 +1,61 @@
+#include 
+
+#include "PyEO.h"
+#include "valueParam.h"
+
+using namespace boost::python;
+
+class StatBaseWrapper : public eoStatBase 
+{
+    public:
+    PyObject* self;
+    StatBaseWrapper(PyObject* p) : self(p) {}
+
+    void operator()(const eoPop& pop)
+    {
+	call_method(self, "__call__", boost::ref(pop));
+    }
+};
+
+class SortedStatBaseWrapper : public eoSortedStatBase 
+{
+    public:
+    PyObject* self;
+    SortedStatBaseWrapper(PyObject* p) : self(p) {}
+
+    void operator()(const std::vector& pop)
+    {
+	call_method(self, "__call__", boost::ref(pop));
+    }
+};
+
+typedef std::vector eoPopView;
+
+const PyEO& popview_getitem(const std::vector& pop, int it) 
+{ 
+    unsigned item = unsigned(it);
+    if (item > pop.size())
+	throw index_error("too much");
+	    
+    return *pop[item]; 
+}
+
+void statistics()
+{
+    class_, StatBaseWrapper, boost::noncopyable>
+	("eoStatBase", init<>())
+	.def("lastCall", &eoStatBase::lastCall)
+	.def("__call__", &StatBaseWrapper::operator())
+	;
+
+    class_< eoPopView >("eoPopView")
+	.def("__getitem__", popview_getitem, return_internal_reference<>() )
+	.def("__len__", &eoPopView::size)
+	;
+    
+    class_, SortedStatBaseWrapper, boost::noncopyable>
+	("eoSortedStatBase", init<>())
+	.def("lastCall", &eoSortedStatBase::lastCall)
+	.def("__call__", &SortedStatBaseWrapper::operator())
+	;
+}
diff --git a/trunk/paradiseo-eo/src/pyeo/test/CVS/Entries b/trunk/paradiseo-eo/src/pyeo/test/CVS/Entries
new file mode 100644
index 000000000..67a67d2e9
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/test/CVS/Entries
@@ -0,0 +1,11 @@
+/maxone.py/1.3/Fri Jan 10 15:41:15 2003//
+/run_tests.sh/1.2/Fri Jan 10 15:41:16 2003//
+/test_breeders.py/1.4/Tue Mar 18 16:35:27 2003//
+/test_mo.py/1.4/Tue Jan 14 09:37:45 2003//
+/test_pickling.py/1.4/Fri Mar 21 02:39:09 2003//
+/test_populator.py/1.2/Fri Jan 10 15:41:17 2003//
+/test_reduce.py/1.2/Fri Jan 10 15:41:17 2003//
+/test_selectone.py/1.2/Fri Jan 10 15:41:17 2003//
+/test_sga.py/1.2/Fri Jan 10 15:41:17 2003//
+/test_transform.py/1.1/Wed Jan 21 19:57:18 2004//
+D
diff --git a/trunk/paradiseo-eo/src/pyeo/test/CVS/Repository b/trunk/paradiseo-eo/src/pyeo/test/CVS/Repository
new file mode 100644
index 000000000..8490b4240
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/test/CVS/Repository
@@ -0,0 +1 @@
+eo/src/pyeo/test
diff --git a/trunk/paradiseo-eo/src/pyeo/test/CVS/Root b/trunk/paradiseo-eo/src/pyeo/test/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/test/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/src/pyeo/test/maxone.py b/trunk/paradiseo-eo/src/pyeo/test/maxone.py
new file mode 100644
index 000000000..c2b6a0cf9
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/test/maxone.py
@@ -0,0 +1,91 @@
+
+import sys
+sys.path.append('..')
+
+print 'importing pyeo'
+from PyEO import *
+print 'done'
+
+from copy import copy
+
+class MinimFit(float):
+    def __cmp__(self, other):
+	if other == None: # I seem to be getting None's, don't know why
+	    return 1
+	return float.__cmp__(other, self)
+    
+class EvalFunc(eoEvalFunc):
+    def __call__(self, eo):
+	eo.fitness = reduce(lambda x,y: x+y, eo.genome, 0)
+	
+class MinEvalFunc(eoEvalFunc):
+    def __call__(self, eo):
+	f = reduce(lambda x,y: x+y, eo.genome, 0 )
+	eo.fitness = MinimFit(f)
+
+class Init(eoInit):
+    def __init__(self, genome_length = 10):
+	eoInit.__init__(self)
+	self.length = genome_length
+    def __call__(self, eo):
+	eo.genome = [rng().flip(0.5) for x in range(self.length)]
+	
+class Mutate(eoMonOp):
+    def __call__(self, eo):
+	eo.genome = copy(eo.genome)
+
+	prob = 1. / len(eo.genome)
+	for i in range(len(eo.genome)):
+	    if rng().flip(0.5):
+		eo.genome[i] = 1-eo.genome[i];
+	return 1 
+
+class Crossover(eoQuadOp):
+    def __call__(self, eo1, eo2):
+	eo1.genome = copy(eo1.genome);
+	eo2.genome = copy(eo2.genome);
+
+	point = rng().random( len(eo1.genome) );
+
+	eo1.genome[:point] = eo2.genome[:point];
+	eo2.genome[point:] = eo1.genome[point:];
+	
+	return 1
+
+evaluate = EvalFunc()
+init = Init(3)
+mutate = Mutate()
+xover = Crossover()
+
+if __name__ == '__main__':
+    
+    eo = EO()
+    eo1 = EO()
+    
+    init(eo1)
+    init(eo)
+    evaluate(eo)
+    print eo
+    
+    for i in range(10):
+	xover(eo, eo1)
+	mutate(eo)
+	
+	evaluate(eo)
+	print eo, eo1
+  
+    print
+    print
+    print
+    
+    pop = eoPop(1, init)
+    
+    pop[0] = eo;
+
+    mutate(pop[0])
+    pop[0].invalidate()
+    evaluate(pop[0])
+    
+    print pop[0], eo
+     
+
diff --git a/trunk/paradiseo-eo/src/pyeo/test/run_tests.sh b/trunk/paradiseo-eo/src/pyeo/test/run_tests.sh
new file mode 100755
index 000000000..f3901050c
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/test/run_tests.sh
@@ -0,0 +1,9 @@
+#!/bin/sh
+
+for i in *.py
+do
+    python $i > /dev/null
+
+done
+
+
diff --git a/trunk/paradiseo-eo/src/pyeo/test/test_breeders.py b/trunk/paradiseo-eo/src/pyeo/test/test_breeders.py
new file mode 100644
index 000000000..5d3fc7601
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/test/test_breeders.py
@@ -0,0 +1,33 @@
+from maxone import *
+import unittest
+	
+class TestBreeders(unittest.TestCase):
+    
+    def runtest(self, breed):
+	
+	pop = eoPop(50, Init(20))
+	evaluate = EvalFunc()
+	print 'HERE'	
+	for indy in pop: evaluate(indy)
+	newpop = eoPop();
+
+	breed(pop,newpop)
+	
+	print pop.best()
+	for indy in newpop: evaluate(indy)
+	print newpop.best()
+
+    def testGeneralBreeder(self):
+	seq = eoSequentialOp();
+	seq.add(Crossover(), 0.7)
+	seq.add(Mutate(), 0.1)
+
+	breed = eoGeneralBreeder(eoDetTournamentSelect(3), seq)
+	self.runtest(breed)
+
+def suite():
+    return unittest.makeSuite(TestSGA,'test')
+
+
+if __name__=='__main__':
+    unittest.main()
diff --git a/trunk/paradiseo-eo/src/pyeo/test/test_mo.py b/trunk/paradiseo-eo/src/pyeo/test/test_mo.py
new file mode 100644
index 000000000..ac8472903
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/test/test_mo.py
@@ -0,0 +1,176 @@
+from maxone import *
+from math import exp
+import unittest
+
+
+class MyInit(eoInit):
+    def __call__(self, eo):
+	eo.genome = [rng().normal(), rng().normal(), rng().normal()];
+
+class MyMutate(eoMonOp):
+    def __call__(self, eo):
+	
+	std = 0.05
+	eo.genome = copy(eo.genome)
+	
+	eo.genome[0] += rng().normal() * std
+	eo.genome[1] += rng().normal() * std
+	eo.genome[2] += rng().normal() * std	
+	return 1
+
+class AnEval(eoEvalFunc):
+    def __init__(self):
+	eoEvalFunc.__init__(self)
+	
+	setObjectivesSize(2);
+	setObjectivesValue(0,1);
+	setObjectivesValue(1,1);
+    
+    def __call__(self, eo):
+	x = abs(eo.genome[0])
+	y = abs(eo.genome[1])
+	z = abs(eo.genome[2])
+	
+	eo.fitness = [ x / (x+y+z), y /(x+y+z) ]
+
+import Gnuplot
+
+g = Gnuplot.Gnuplot()
+g.reset()
+
+def do_plot(pop):
+    l1 = []
+    l2 = []
+
+    for indy in pop:
+	l1.append(indy.fitness[0])
+	l2.append(indy.fitness[1])
+
+    d = Gnuplot.Data(l1,l2, with = 'points')
+    
+    d2 = Gnuplot.Data([0,1],[1,0], with='lines')
+    
+    g.plot(d,d2)
+
+
+
+class NSGA_II(eoAlgo):
+    def __init__(self, ngens):
+	
+	self.cont = eoGenContinue(ngens);
+	
+	self.selectOne = eoDetTournamentSelect(2);
+	self.evaluate = AnEval()
+	self.mutate = MyMutate()
+	self.init = MyInit()
+	
+	self.seq = eoProportionalOp()
+	self.seq.add(self.mutate, 1.0)
+    	
+	self.perf2worth = eoNDSorting_II()
+	
+    def __call__(self, pop):
+	
+	sz = len(pop)
+	i = 0
+	while self.cont(pop):
+	    newpop = eoPop()	
+	    populator = eoSelectivePopulator(pop, newpop, self.selectOne);
+
+	    while len(newpop) < sz:
+		self.seq(populator)
+	
+	    for indy in newpop: 
+		self.evaluate(indy)
+		pop.push_back(indy)
+
+	    self.perf2worth(pop)
+	    self.perf2worth.sort_pop(pop)
+	    
+	    #print pop[0].fitness, pop[0].genome
+	    pop.resize(sz)
+	    
+	    #worth = self.perf2worth.getValue()
+	    #print worth[0], worth[sz-1]
+	    
+	    i += 1
+	    if i%100 == 0:
+		pass 
+		do_plot(pop)
+	    
+	worths = self.perf2worth.getValue()
+	
+	w0 = int(worths[0]-0.001)
+	
+	for i in range(len(pop)):
+	    if worths[i] <= w0:
+		break;
+
+	    print pop[i].genome
+	    print pop[i].fitness
+	
+	
+class TestNSGA_II(unittest.TestCase):
+    
+    def testIndividuals(self):
+	setObjectivesSize(2);
+	setObjectivesValue(0,1);
+	setObjectivesValue(1,1);
+
+	eo1 = EO();
+	eo2 = EO();
+
+	eo1.fitness = [0,1];
+	eo2.fitness = [1,1];
+
+	self.failUnlessEqual(dominates(eo1, eo2), 0)
+	self.failUnlessEqual(dominates(eo2, eo1), 1)
+	self.failUnlessEqual(dominates(eo2, eo2), 0)
+
+	setObjectivesValue(0,-1)
+	setObjectivesValue(1,-1);
+
+	self.failUnlessEqual(dominates(eo1, eo2), 1)
+	self.failUnlessEqual(dominates(eo2, eo1), 0)
+	self.failUnlessEqual(dominates(eo2, eo2), 0)
+   
+    def testNDSorting(self):
+	setObjectivesSize(2);
+	setObjectivesValue(0,-1)
+	setObjectivesValue(1,-1);
+	
+	pop = eoPop()
+	pop.resize(6)
+
+	pop[5].fitness = [0.15,0.87]
+	pop[4].fitness = [0.1,0.9]
+	pop[3].fitness = [0,1];
+	pop[2].fitness = [1,0];
+	pop[1].fitness = [1,1];
+	pop[0].fitness = [2,1];
+
+	srt = eoNDSorting_II()
+
+	srt(pop)
+	srt.sort_pop(pop)
+
+	for indy in pop:
+	    print indy.fitness
+
+	
+	worths = srt.getValue()
+	print worths
+	print type(worths)
+
+    def testNSGA_II(self):
+	
+	evaluate = AnEval();
+	pop = eoPop(25, MyInit())
+	for indy in pop: evaluate(indy)
+	
+	nsga = NSGA_II(50)
+
+	nsga(pop)
+	
+if __name__=='__main__':
+    unittest.main()
diff --git a/trunk/paradiseo-eo/src/pyeo/test/test_pickling.py b/trunk/paradiseo-eo/src/pyeo/test/test_pickling.py
new file mode 100644
index 000000000..161668bb3
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/test/test_pickling.py
@@ -0,0 +1,100 @@
+from maxone import *
+import unittest
+import cPickle
+import tempfile
+import os
+
+class TestPickling(unittest.TestCase):
+   
+    def do_pickle(self, object):
+    
+	filename = tempfile.mktemp()
+	file = open(filename, 'wb')
+	pickler = cPickle.Pickler(file)
+
+	pickler.dump(object);
+	del pickler
+	file.close()
+	
+	file = open(filename)
+	
+	unpickler = cPickle.Unpickler(file)
+
+	object2 = unpickler.load()
+
+	del unpickler
+	file.close()
+	os.remove(filename)
+
+	return object2
+
+    def testInvalidEO(self):
+	
+	eo = EO();
+	eo.genome = [1,2,3];
+	
+	eo2 = self.do_pickle(eo)
+	self.failUnlessEqual( str(eo), str(eo2) )
+
+    def testValidEO(self):
+	
+	eo = EO();
+	eo.genome = [1,2,3];
+	eo.fitness = 10
+
+	eo2 = self.do_pickle(eo)
+
+	self.failUnlessEqual( str(eo), str(eo2) )
+    
+    def testPop(self):
+	
+	pop = eoPop(40, init)
+	for indy in pop: 
+	    evaluate(indy)
+
+	pop2 = self.do_pickle(pop)
+	
+	self.failUnlessEqual( str(pop), str(pop2) )
+
+    def testHowMany(self):
+	
+	howmany = eoHowMany(0.8);
+	howmany2 = self.do_pickle(howmany)
+
+	self.failUnlessEqual(howmany(10), howmany2(10))
+	self.failUnlessEqual( str(howmany), str(howmany) )
+
+    def testRNG(self):
+	
+	for i in range(10):
+	    rng().rand()
+	
+	rng2 = self.do_pickle(rng())
+	
+	for i in range(100):
+	    a = rng().rand()
+	    b = rng2.rand()
+	    self.failUnlessEqual(a,b)
+
+    def vParam(self,v):
+	
+	v2 = self.do_pickle(v);
+	self.failUnlessEqual(v.value, v2.value)
+	
+    def testValueParam(self):
+	import Numeric
+	
+	self.vParam(eoValueParamInt(42,'int'))	
+	self.vParam(eoValueParamFloat(4.2,'float'))
+	
+	v = eoValueParamVec()
+	v.value = Numeric.arange(10)
+	self.vParam(v)	
+
+	v = eoValueParamPair()
+	v.value = (0.3,0.5)
+	self.vParam(v)
+
+
+if __name__=='__main__':
+    unittest.main()
diff --git a/trunk/paradiseo-eo/src/pyeo/test/test_populator.py b/trunk/paradiseo-eo/src/pyeo/test/test_populator.py
new file mode 100644
index 000000000..a6743fda4
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/test/test_populator.py
@@ -0,0 +1,86 @@
+print 'importing maxone'
+from maxone import *
+print 'done'
+import unittest
+
+class Mut(Mutate):
+    def __init__(self):
+	Mutate.__init__(self)
+	self.cnt = 0;
+    def __call__(self, eo):
+	self.cnt += 1;
+	return Mutate.__call__(self, eo)
+
+class Xover(Crossover):
+    def __init__(self):
+	Crossover.__init__(self)
+	self.cnt = 0;
+    def __call__(self, eo1, eo2):
+	self.cnt += 1;
+	return Crossover.__call__(self, eo1, eo2)
+
+class TestPopulator(unittest.TestCase):
+    
+    def make_pop(self):
+	pop = eoPop(20, init)
+	for indy in pop: evaluate(indy)
+	return pop
+	
+    def test_sequential(self):
+	pop = self.make_pop()
+	populator = eoSeqPopulator(pop, pop)
+	
+	print populator.get()
+	print populator.get()
+    
+    def test_selective(self):
+	sel = eoDetTournamentSelect(2)
+	pop = self.make_pop()
+
+	populator = eoSelectivePopulator(pop, pop, sel)
+	
+	print populator.get()
+	print populator.get()
+
+    def runOpContainer(self, opcontainer):
+    	
+	mutate = Mut()
+	xover = Xover()
+	
+	print 'making seq'
+	seq = opcontainer()
+	
+	print "xovertype", xover.getType()
+	print "mutationtype", mutate.getType()
+
+	seq.add(mutate, 0.4)
+	seq.add(xover, 0.8)
+
+	pop = self.make_pop();
+	offspring = eoPop()
+	
+	sel = eoDetTournamentSelect(2)
+    
+	print "making populator"
+	populator = eoSelectivePopulator(pop, offspring, sel)
+	print 'made'
+	
+	for i in xrange(1000):
+	    seq(populator)
+	
+	print mutate.cnt
+	print xover.cnt
+
+
+    def test_sequentialOp(self):
+	print '*'*20, "SequentialOp", '*'*20	
+	self.runOpContainer(eoSequentialOp)
+	
+    def test_proportionalOp(self):
+	print '*'*20, "ProportionalOp", '*'*20	
+	self.runOpContainer(eoProportionalOp)
+
+
+
+if __name__=='__main__':
+    unittest.main()
diff --git a/trunk/paradiseo-eo/src/pyeo/test/test_reduce.py b/trunk/paradiseo-eo/src/pyeo/test/test_reduce.py
new file mode 100644
index 000000000..2ca99dc5b
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/test/test_reduce.py
@@ -0,0 +1,34 @@
+from maxone import *
+import unittest
+
+class TestReduce(unittest.TestCase):
+    
+    def run_test(self, ReduceClass, Arg = None):
+	pop = eoPop(10, init)
+	for indy in pop: evaluate(indy)
+	
+	if Arg:
+	    red = ReduceClass(Arg)
+	else:
+	    red = ReduceClass()
+
+	red(pop, 5);
+
+	self.failUnlessEqual( len(pop), 5) 
+    
+    def test_eoTruncate(self):
+	self.run_test(eoTruncate)
+    def test_eoRandomeReduce(self):
+	self.run_test(eoRandomReduce)
+    def test_eoEPRReduce(self):
+	self.run_test(eoEPReduce, 2)
+    def test_eoLinearTruncate(self):
+	self.run_test(eoLinearTruncate)
+    def test_eoDetTournamentTruncate(self):
+	self.run_test(eoDetTournamentTruncate, 2)
+    def test_eoStochTournamentTruncate(self):
+	self.run_test(eoStochTournamentTruncate, 0.9)
+	
+												 
+if __name__=='__main__':
+    unittest.main()
diff --git a/trunk/paradiseo-eo/src/pyeo/test/test_selectone.py b/trunk/paradiseo-eo/src/pyeo/test/test_selectone.py
new file mode 100644
index 000000000..1a25bc7fe
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/test/test_selectone.py
@@ -0,0 +1,66 @@
+from maxone import *
+import unittest
+
+class Init(eoInit):
+    def __call__(self, eo):
+	pass
+
+class TestSGA(unittest.TestCase):
+
+    def __init__(self, a):
+	unittest.TestCase.__init__(self, a)	
+	self.pop = eoPop(4, Init())
+
+	for i in range(len(self.pop)):
+	   self.pop[i].fitness = i; 
+	
+
+    def do_test(self, selectOne):
+	
+	print '*'*20, "Testing", str(selectOne.__class__), '*'*20
+	selection = [0. for i in range(len(self.pop))]
+
+	nTries = 500
+	for i in range(nTries):
+	    selection[ selectOne(self.pop).fitness ] += 1
+	
+	for i in range(len(self.pop)):
+	    print i, selection[i], selection[i] / nTries
+	
+	return selection, nTries
+    
+    def test_eoDetTournamenSelect(self):
+	
+	selectOne = eoDetTournamentSelect(2)
+	self.do_test(selectOne)
+    
+    def test_eoRandomSelect(self):
+	selectOne = eoRandomSelect()
+	self.do_test(selectOne)
+
+    def test_eoBestSelect(self):
+	selectOne = eoBestSelect()
+	(sel, nTries) = self.do_test(selectOne)
+
+	self.failUnlessEqual(sel[0], 0);
+	self.failUnlessEqual(sel[-1], nTries);
+
+    def test_eoNoSelect(self):
+	selectOne = eoNoSelect()
+	self.do_test(selectOne)
+
+    def test_eoStochTournament(self):
+	selectOne = eoStochTournamentSelect(0.75)
+	self.do_test(selectOne)
+
+    def test_eoSequentialSelect(self):
+	selectOne = eoSequentialSelect();
+	self.do_test(selectOne)
+	
+    def test_eoEliteSequentialSelect(self):
+	selectOne = eoEliteSequentialSelect();
+	self.do_test(selectOne)
+	
+
+if __name__=='__main__':
+    unittest.main()
diff --git a/trunk/paradiseo-eo/src/pyeo/test/test_sga.py b/trunk/paradiseo-eo/src/pyeo/test/test_sga.py
new file mode 100644
index 000000000..b84afe752
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/test/test_sga.py
@@ -0,0 +1,44 @@
+from maxone import *
+import unittest
+
+class TestSGA(unittest.TestCase):
+    
+    def dotestSGA(self, evaluate):
+	init = Init(20)
+	mutate = Mutate()
+	xover = Crossover()
+
+	pop = eoPop(50, init)
+	for indy in pop: evaluate(indy)
+
+	select = eoDetTournamentSelect(3);
+	cont1 = eoGenContinue(20);
+	
+	cont = eoCheckPoint(cont1)
+	
+	mon = eoGnuplot1DMonitor()
+	
+	avg = eoAverageStat()
+	bst = eoBestFitnessStat()
+	mon.add(avg)
+	mon.add(bst)
+	
+	# add it to the checkpoint
+	cont.add(avg)
+	#cont.add(mon)
+	cont.add(bst)
+	
+	sga = eoSGA(select, xover, 0.6, mutate, 0.4, evaluate, cont);
+
+	sga(pop)
+
+	print pop.best()
+    def testSGA_Max(self):
+	evaluate = EvalFunc()
+	self.dotestSGA(evaluate)
+    def testSGA_Min(self):
+	evaluate = MinEvalFunc()
+	self.dotestSGA(evaluate)
+
+if __name__=='__main__':
+    unittest.main()
diff --git a/trunk/paradiseo-eo/src/pyeo/test/test_transform.py b/trunk/paradiseo-eo/src/pyeo/test/test_transform.py
new file mode 100644
index 000000000..67d892e68
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/test/test_transform.py
@@ -0,0 +1,61 @@
+"""Test script for the eoSGATranform class"""
+
+from copy import deepcopy
+from PyEO import * 
+from maxone import *
+
+pop = eoPop()
+for i in range(10):
+	eo = EO()
+	init(eo)
+	evaluate(eo)
+	pop.push_back(eo)
+
+transform = eoSGATransform(xover, 0.8, mutate, 0.2)
+
+def test1(pop, transform):
+	pop = deepcopy(pop)
+	print "test 1"
+	print "Initial population:"
+	print pop
+
+	transform(pop)
+
+	print "GM pop:"
+	print pop
+
+def test2(pop, transform):
+	pop = deepcopy(pop)
+
+	print "test 2"
+	print "Initial population"
+	print pop
+
+	checkpoint = eoCheckPoint(eoGenContinue(50)) 
+	select = eoSelectNumber(eoDetTournamentSelect(3), 10)
+	replace = eoGenerationalReplacement()
+	
+	algo = eoEasyEA(checkpoint, evaluate, select, transform, replace)
+	algo(pop)
+
+	print "Evoluated pop:"
+	print pop
+
+if __name__ == "__main__":
+	try:
+		test1(pop, transform)
+	except:
+		import sys
+		print
+		print "Caught an exception:"
+		print sys.exc_type, sys.exc_value
+		print
+
+	try:
+		test2(pop, transform)
+	except:
+		import sys
+ 		print
+		print "Caught an exception:"
+		print sys.exc_type, sys.exc_value
+		print
diff --git a/trunk/paradiseo-eo/src/pyeo/valueParam.cpp b/trunk/paradiseo-eo/src/pyeo/valueParam.cpp
new file mode 100644
index 000000000..606251802
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/valueParam.cpp
@@ -0,0 +1,194 @@
+/*
+    PyEO
+    
+    Copyright (C) 2003 Maarten Keijzer
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+*/
+
+#include 
+#include 
+
+// Here's 'len'. Why? dunno
+#include "valueParam.h"
+#include 
+
+using namespace boost::python;
+
+class ParamWrapper : public eoParam
+{
+public:
+    PyObject* self;
+    ParamWrapper(PyObject* p) : self(p) {}
+    ParamWrapper(PyObject* p,
+	std::string a,
+	std::string b,
+	std::string c,
+	char d,
+	bool e) : eoParam(a,b,c,d,e), self(p) {}
+
+    
+    std::string getValue() const
+    {
+	return call_method(self, "getValueAsString");
+    }
+
+    void setValue(const std::string& s)
+    {
+	call_method(self, "setValueAsString", s);
+    }
+	
+};
+
+template 
+struct ValueParam_pickle_suite : boost::python::pickle_suite
+{
+    static
+    boost::python::tuple getstate(const eoValueParam& _param)
+    {
+	str v(_param.getValue());
+	str d(_param.description());
+	str def(_param.defValue());
+	str l(_param.longName());
+	object s(_param.shortName());
+	object r(_param.required());	
+	return make_tuple(v,d,def,l,s,r);
+    }
+    static
+    void setstate(eoValueParam& _param, boost::python::tuple pickled)
+    {
+	std::string v = extract(pickled[0]);
+	std::string d = extract(pickled[1]);
+	std::string def = extract(pickled[2]);
+	std::string l = extract(pickled[3]);
+	char s = extract(pickled[4]);
+	bool r = extract(pickled[5]);
+
+	_param = eoValueParam(T(), l, d, s, r);
+	_param.defValue(d);
+	_param.setValue(v);
+    }
+};
+
+template 
+U getv(const eoValueParam& v)    { return v.value(); }
+
+template 
+void setv(eoValueParam& v, U val) { v.value() = val; }
+
+template <>
+numeric::array getv< std::vector, numeric::array >
+    (const eoValueParam< std::vector >& param)
+{
+    const std::vector& v = param.value();
+    list result;
+
+    for (unsigned i =0; i < v.size(); ++i)
+	result.append(v[i]);
+    
+    return numeric::array(result);
+}
+
+template <>
+void setv< std::vector, numeric::array >
+    (eoValueParam< std::vector >& param, numeric::array val)
+{
+    std::vector& v = param.value();
+    v.resize( boost::python::len(val) );
+    for (unsigned i = 0; i < v.size(); ++i)
+    {
+	extract x(val[i]);
+	if (!x.check())
+	    throw std::runtime_error("double expected");
+	
+	v[i] = x();
+    }
+}
+
+template <>
+tuple getv, tuple >
+    (const eoValueParam< std::pair >& p)
+{
+    return make_tuple(p.value().first, p.value().second);
+}
+
+template <>
+void setv< std::pair, tuple >
+    (eoValueParam< std::pair >& p, tuple val)
+{
+    extract first(val[0]);
+    extract second(val[1]);
+
+    if (!first.check())
+	throw std::runtime_error("doubles expected");
+    if (!second.check())
+	throw std::runtime_error("doubles expected");
+
+    p.value().first = first();
+    p.value().second = second();
+}
+
+template 
+void define_valueParam(std::string prefix)
+{
+    std::string name = "eoValueParam";
+    name += prefix;
+    
+    class_, bases >(name.c_str(), init<>())
+	.def(init())
+	.def(init())
+	.def(init())
+	.def(init())
+	.def("getValueAsString", &eoValueParam::getValue)
+	.def("__str__", &eoValueParam::getValue)
+	.def("setValueAsString", &eoValueParam::setValue)
+	.def("getValue", getv)
+	.def("setValue", setv)
+	.add_property("value", getv, setv)
+	.def_pickle(ValueParam_pickle_suite())
+	;
+}
+
+void valueParam()
+{
+    class_("eoParam", init<>())
+	.def(init< std::string, std::string, std::string, char, bool>())
+	.def("getValueAsString", &ParamWrapper::getValue)
+	.def("setValueAsString", &ParamWrapper::setValue)
+	.def("longName", &eoParam::longName, return_value_policy())
+	//.def("defValue", &eoParam::defValue, return_value_policy())
+	.def("description", &eoParam::description, return_value_policy())
+	.def("shortName", &eoParam::shortName)
+	.def("required", &eoParam::required)
+	;
+    
+    define_valueParam("Int");
+    define_valueParam("Float");
+    define_valueParam, numeric::array >("Vec");
+    define_valueParam< std::pair, tuple >("Pair");
+    //define_valueParam< object, object >("Py");
+
+    class_ >("eoValueParam", init<>())
+	//.def(init())
+	//.def(init())
+	//.def(init())
+	.def(init())
+	.def("getValueAsString", &ValueParam::getValue)
+	.def("__str__", &ValueParam::getValue)
+	.def("setValueAsString", &ValueParam::setValue)
+	.add_property("object", &ValueParam::getObj, &ValueParam::setObj)
+	;
+}
+
diff --git a/trunk/paradiseo-eo/src/pyeo/valueParam.h b/trunk/paradiseo-eo/src/pyeo/valueParam.h
new file mode 100644
index 000000000..783f2fc13
--- /dev/null
+++ b/trunk/paradiseo-eo/src/pyeo/valueParam.h
@@ -0,0 +1,43 @@
+#ifndef VALUEPARAM_H
+#define VALUEPARAM_H
+
+#include 
+#include 
+
+class ValueParam : public eoParam // ValueParam containing python object
+{
+    boost::python::object obj;
+    
+    public:
+    
+    ValueParam() : eoParam(), obj() {}
+    
+    ValueParam(boost::python::object o, 
+	    std::string longName, 
+	    std::string d = "No Description",
+	    char s = 0,
+	    bool r = false) : eoParam(longName, "", d, s, r) 
+	    {
+		std::cerr << "HI" << std::endl;
+		obj = o;
+		eoParam::defValue(getValue());
+	    }
+
+    
+    std::string getValue() const
+    {
+	boost::python::str s = boost::python::str(obj);
+	return std::string(boost::python::extract(s));
+    }
+
+    void setValue(const std::string& v)
+    {
+	std::cerr << "not implemented yet" << std::endl;
+    }
+
+    boost::python::object getObj() const { return obj;}
+    void setObj(boost::python::object o) { obj = o; }
+    
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/utils/.cvsignore b/trunk/paradiseo-eo/src/utils/.cvsignore
new file mode 100644
index 000000000..69fb0bd82
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/.cvsignore
@@ -0,0 +1,6 @@
+*.lo
+*.la
+.deps
+.libs
+Makefile
+Makefile.in
diff --git a/trunk/paradiseo-eo/src/utils/CVS/Entries b/trunk/paradiseo-eo/src/utils/CVS/Entries
new file mode 100644
index 000000000..a6271e213
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/CVS/Entries
@@ -0,0 +1,52 @@
+/.cvsignore/1.1/Mon Apr  3 09:32:09 2000//
+/Makefile.am/1.23/Sun Oct  2 21:42:08 2005//
+/checkpointing/1.13/Sat Apr  5 13:41:43 2003//
+/compatibility.h/1.8/Tue Mar 18 09:40:36 2003//
+/eoAssembledFitnessStat.h/1.5/Mon Mar 27 18:55:20 2006//
+/eoCheckPoint.h/1.12/Tue Jun 15 07:04:12 2004//
+/eoData.cpp/1.2/Mon Oct  3 12:54:45 2005//
+/eoData.h/1.10/Wed Oct  5 21:48:01 2005//
+/eoDistance.h/1.4/Tue May 25 08:03:30 2004//
+/eoFDCStat.h/1.7/Mon Mar 27 18:55:20 2006//
+/eoFileMonitor.cpp/1.7/Wed Nov 19 13:29:15 2003//
+/eoFileMonitor.h/1.14/Sun Oct  2 21:42:08 2005//
+/eoFileSnapshot.h/1.12/Wed Sep 28 21:49:26 2005//
+/eoGnuplot.cpp/1.2/Wed Oct  5 21:34:19 2005//
+/eoGnuplot.h/1.15/Sun Oct  2 21:57:43 2005//
+/eoGnuplot1DMonitor.cpp/1.3/Tue Nov  8 11:34:12 2005//
+/eoGnuplot1DMonitor.h/1.18/Tue Nov  8 11:34:12 2005//
+/eoGnuplot1DSnapshot.cpp/1.2/Wed Oct  5 21:34:19 2005//
+/eoGnuplot1DSnapshot.h/1.19/Mon Oct 10 13:33:13 2005//
+/eoHowMany.h/1.16/Wed Sep 28 21:49:26 2005//
+/eoIntBounds.cpp/1.3/Wed Sep 28 21:49:26 2005//
+/eoIntBounds.h/1.4/Mon Dec 27 07:33:03 2004//
+/eoMOFitnessStat.h/1.5/Mon Mar 27 18:55:20 2006//
+/eoMonitor.h/1.11/Tue Jun 15 07:09:57 2004//
+/eoParam.h/1.28/Wed Sep 28 21:49:26 2005//
+/eoParser.cpp/1.28/Wed Sep 28 21:49:26 2005//
+/eoParser.h/1.19/Mon Oct 10 21:42:31 2005//
+/eoPopStat.h/1.13/Mon Mar 27 18:55:20 2006//
+/eoRNG.cpp/1.8/Sun Mar 26 10:04:01 2006//
+/eoRNG.h/1.25/Sun Mar 26 10:04:01 2006//
+/eoRealBounds.cpp/1.10/Wed Sep 28 21:49:26 2005//
+/eoRealBounds.h/1.8/Mon Dec 27 07:33:03 2004//
+/eoRealVectorBounds.h/1.4/Thu Feb 27 19:21:17 2003//
+/eoRndGenerators.h/1.6/Fri May 16 14:28:52 2003//
+/eoScalarFitnessStat.h/1.6/Mon Mar 27 18:55:20 2006//
+/eoStat.h/1.25/Mon Mar 27 18:55:20 2006//
+/eoState.cpp/1.11/Wed Sep 28 21:49:26 2005//
+/eoState.h/1.8/Mon Oct  8 09:13:16 2001//
+/eoStdoutMonitor.cpp/1.4/Sat Nov 10 06:58:29 2001//
+/eoStdoutMonitor.h/1.4/Tue Jun 15 07:09:57 2004//
+/eoTimeCounter.h/1.2/Fri Apr 12 15:13:45 2002//
+/eoTimedMonitor.h/1.1/Fri Oct 14 15:33:16 2005//
+/eoUniformInit.h/1.3/Fri May 16 14:28:52 2003//
+/eoUpdatable.h/1.2/Mon Sep  5 16:47:53 2005//
+/eoUpdater.cpp/1.6/Wed Sep 28 21:49:26 2005//
+/eoUpdater.h/1.13/Mon Mar 27 18:55:20 2006//
+/make_help.cpp/1.6/Sat Feb  2 05:59:05 2002//
+/pipecom.cpp/1.2/Wed Oct  5 21:40:53 2005//
+/pipecom.h/1.4/Sun Oct  2 21:42:08 2005//
+/rnd_generators.h/1.11/Mon Sep 26 10:18:15 2005//
+/selectors.h/1.13/Tue Nov  8 11:31:01 2005//
+D
diff --git a/trunk/paradiseo-eo/src/utils/CVS/Repository b/trunk/paradiseo-eo/src/utils/CVS/Repository
new file mode 100644
index 000000000..524e60258
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/CVS/Repository
@@ -0,0 +1 @@
+eo/src/utils
diff --git a/trunk/paradiseo-eo/src/utils/CVS/Root b/trunk/paradiseo-eo/src/utils/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/src/utils/Makefile.am b/trunk/paradiseo-eo/src/utils/Makefile.am
new file mode 100644
index 000000000..18c8b1ae2
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/Makefile.am
@@ -0,0 +1,57 @@
+## Makefile.am for eo/src/utils
+
+lib_LIBRARIES 		= libeoutils.a
+
+libeoutils_a_SOURCES 	= eoData.cpp \
+			eoFileMonitor.cpp \
+			eoGnuplot.cpp \
+			eoGnuplot1DMonitor.cpp \
+			eoGnuplot1DSnapshot.cpp \
+			eoIntBounds.cpp \
+			eoParser.cpp \
+			eoRealBounds.cpp \
+			eoRNG.cpp \
+			eoState.cpp \
+			eoStdoutMonitor.cpp \
+			eoUpdater.cpp \
+			make_help.cpp \
+			pipecom.cpp
+
+utilsincludedir		= $(pkgincludedir)/utils
+
+utilsinclude_HEADERS 	= checkpointing \
+			compatibility.h \
+			eoAssembledFitnessStat.h \
+			eoCheckPoint.h \
+			eoData.h \
+			eoDistance.h \
+			eoFDCStat.h \
+			eoFileMonitor.h \
+			eoFileSnapshot.h \
+			eoGnuplot.h \
+			eoGnuplot1DMonitor.h \
+			eoGnuplot1DSnapshot.h \
+			eoHowMany.h \
+			eoMOFitnessStat.h \
+			eoMonitor.h \
+			eoParam.h \
+			eoParser.h \
+			eoPopStat.h \
+			eoRNG.h \
+			eoRealBounds.h \
+			eoIntBounds.h \
+			eoRealVectorBounds.h \
+			eoRndGenerators.h \
+			eoScalarFitnessStat.h \
+			eoStat.h \
+			eoState.h \
+			eoStdoutMonitor.h \
+			eoTimeCounter.h \
+			eoUniformInit.h \
+			eoUpdatable.h \
+			eoUpdater.h \
+			pipecom.h \
+			rnd_generators.h \
+			selectors.h
+
+AM_CXXFLAGS 		= -I$(top_srcdir)/src -DGNUPLOT_PROGRAM=\"@GNUPLOT@\"
diff --git a/trunk/paradiseo-eo/src/utils/checkpointing b/trunk/paradiseo-eo/src/utils/checkpointing
new file mode 100644
index 000000000..e2b7ce425
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/checkpointing
@@ -0,0 +1,21 @@
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#ifndef _MSC_VER
+#include 
+#include 
+#endif
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+
+// and make_help - any better suggestion to include it?
+void make_help(eoParser & _parser);
diff --git a/trunk/paradiseo-eo/src/utils/compatibility.h b/trunk/paradiseo-eo/src/utils/compatibility.h
new file mode 100644
index 000000000..af20a7920
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/compatibility.h
@@ -0,0 +1,82 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+  -----------------------------------------------------------------------------
+  compatibility.h
+      File to store some compiler specific stuff in. Currently handles, or 
+      least tries to handle the min() max() problems when using MSVC
+
+
+ (c) Maarten Keijzer (mak@dhi.dk) and GeNeura Team, 1999, 2000
+ 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+
+#ifndef COMPAT_H
+#define COMPAT_H
+
+#include 
+#include 
+
+#ifdef __GNUC__
+#if __GNUC__ < 3
+	// check for stdlibc++v3 which does have ios_base
+	#ifndef _CPP_BITS_IOSBASE_H 
+	typedef ios ios_base; // not currently defined in GCC
+	#endif
+#endif
+#endif
+
+#if defined(_MSC_VER) && (_MSC_VER < 1300)
+/* 
+Maarten: added this code here because Mirkosoft has the
+nasty habit of #define min and max in stdlib.h (and windows.h)
+I'm trying to undo this horrible macro magic (microsoft yet macrohard)
+here. Sure hope it works
+Olivier: this has been removed in .NET :) One step more standard...
+*/
+#pragma warning(disable:4786)
+
+#include 
+
+#ifdef min
+#undef min
+#undef max // as they come in std::pairs
+#endif
+
+// add min and max to std...
+namespace std
+{
+    template  const T& min(const T& a, const T& b)
+    {
+        if(a < b)
+            return a;
+        // else
+        return b;
+    }
+    
+    template  const T& max(const T& a, const T& b)
+    {
+        if(a > b)
+            return a;
+        // else
+        return b;
+    }
+}
+
+#endif
+        // _MSC_VER
+#endif 
diff --git a/trunk/paradiseo-eo/src/utils/eoAssembledFitnessStat.h b/trunk/paradiseo-eo/src/utils/eoAssembledFitnessStat.h
new file mode 100644
index 000000000..5dd96c674
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoAssembledFitnessStat.h
@@ -0,0 +1,112 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoAssembledFitnessStat.h
+// Marc Wintermantel & Oliver Koenig
+// IMES-ST@ETHZ.CH
+// April 2003
+
+//-----------------------------------------------------------------------------
+// eoStat.h
+// (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoAssembledFitnessStat_h
+#define _eoAssembledFitnessStat_h
+
+#include 
+#include 
+
+/**
+   Average fitness values of a population, where the fitness is
+   of type eoScalarAssembledFitness. Specify in the constructor,
+   for which fitness term (index) the average should be evaluated.
+   Only values of object where the failed boolean = false is set are counted.
+*/
+template 
+class eoAssembledFitnessAverageStat : public eoStat
+{
+public :
+
+    using eoStat::value;
+
+    typedef typename EOT::Fitness Fitness;
+
+
+    eoAssembledFitnessAverageStat(unsigned _whichTerm=0, std::string _description = "Average Fitness")
+        : eoStat(Fitness(), _description), whichFitnessTerm(_whichTerm)
+        {}
+
+
+    virtual void operator()(const eoPop& _pop) {
+        if( whichFitnessTerm >= _pop[0].fitness().size() )
+            throw std::logic_error("Fitness term requested out of range");
+
+    double result =0.0;
+    unsigned count = 0;
+    for (typename eoPop::const_iterator it = _pop.begin(); it != _pop.end(); ++it){
+      if ( it->fitness().failed == false ){
+        result+= it->fitness()[whichFitnessTerm];
+        ++count;
+      }
+    }
+
+    value() = result / (double) count;
+  }
+
+private:
+  // Store an index of the fitness term to be evaluated in eoScalarFitnessAssembled
+  unsigned whichFitnessTerm;
+};
+
+/**
+   Fitness values of best individuum in a population, where the fitness is
+   of type eoScalarAssembledFitness. Specify in the constructor,
+   for which fitness term (index) the value should be evaluated.
+*/
+template 
+class eoAssembledFitnessBestStat : public eoStat
+{
+public:
+
+    using eoStat::value;
+
+    typedef typename EOT::Fitness Fitness;
+
+    eoAssembledFitnessBestStat(unsigned _whichTerm=0, std::string _description = "Best Fitness")
+        : eoStat(Fitness(), _description), whichFitnessTerm(_whichTerm)
+        {}
+
+    virtual void operator()(const eoPop& _pop) {
+        if( whichFitnessTerm >= _pop[0].fitness().size() )
+            throw std::logic_error("Fitness term requested out of range");
+
+        value() = _pop.best_element().fitness()[whichFitnessTerm];
+    }
+
+private:
+
+    // Store an index of the fitness term to be evaluated in eoScalarFitnessAssembled
+    unsigned whichFitnessTerm;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/utils/eoCheckPoint.h b/trunk/paradiseo-eo/src/utils/eoCheckPoint.h
new file mode 100644
index 000000000..849a5b0ee
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoCheckPoint.h
@@ -0,0 +1,163 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoCheckPoint.h
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2000
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoCheckPoint_h
+#define _eoCheckPoint_h
+
+#include 
+#include 
+#include 
+#include 
+
+/** eoCheckPoint is a container class.
+    It contains std::vectors of (pointers to) 
+             eoContinue    (modif. MS July 16. 2002)
+             eoStats, eoUpdater and eoMonitor
+    it is an eoContinue, so its operator() will be called every generation - 
+             and will return the contained-combined-eoContinue result
+    but before that it will call in turn every single 
+             {statistics, updaters, monitors} that it has been given,
+    and after that, if stopping, all lastCall methods of the above.
+*/
+template 
+class eoCheckPoint : public eoContinue
+{
+public :
+
+    eoCheckPoint(eoContinue& _cont) 
+  {
+    continuators.push_back(&_cont);
+  }
+
+    bool operator()(const eoPop& _pop);
+
+    void add(eoContinue& _cont) { continuators.push_back(&_cont); }
+    void add(eoSortedStatBase& _stat) { sorted.push_back(&_stat); }
+    void add(eoStatBase& _stat) { stats.push_back(&_stat); }
+    void add(eoMonitor& _mon)        { monitors.push_back(&_mon); }
+    void add(eoUpdater& _upd)        { updaters.push_back(&_upd); }
+
+    virtual std::string className(void) const { return "eoCheckPoint"; }
+    std::string allClassNames() const ;
+
+private :
+
+  std::vector*>    continuators;
+    std::vector*>    sorted;
+    std::vector*>    stats;
+    std::vector monitors;
+    std::vector updaters;
+};
+
+template 
+bool eoCheckPoint::operator()(const eoPop& _pop)
+{
+    unsigned i;
+
+    std::vector sorted_pop;
+    if (!sorted.empty())
+    {
+      _pop.sort(sorted_pop);
+
+      for (i = 0; i < sorted.size(); ++i)
+      {
+        (*sorted[i])(sorted_pop);
+      }
+    }
+
+    for (i = 0; i < stats.size(); ++i)
+        (*stats[i])(_pop);
+
+    for (i = 0; i < updaters.size(); ++i)
+        (*updaters[i])();
+
+    for (i = 0; i < monitors.size(); ++i)
+        (*monitors[i])();
+
+    bool bContinue = true;
+    for (i = 0; i < continuators.size(); ++i)
+      if ( !(*continuators[i])(_pop) ) 
+	bContinue = false;
+
+    if (! bContinue)	   // we're going to stop: lastCall, gentlemen
+      {
+	if (!sorted.empty())
+	  {
+	    for (i = 0; i < sorted.size(); ++i)
+	      {
+		sorted[i]->lastCall(sorted_pop);
+	      }
+	  }
+	for (i = 0; i < stats.size(); ++i)
+	  stats[i]->lastCall(_pop);
+
+	for (i = 0; i < updaters.size(); ++i)
+	  updaters[i]->lastCall();
+
+	for (i = 0; i < monitors.size(); ++i)
+	  monitors[i]->lastCall();
+      }
+    return bContinue;
+}
+
+/** returns a string with all className() 
+ *  of data separated with "\n" (for debugging)
+ */
+template 
+std::string eoCheckPoint::allClassNames() const
+{
+    unsigned i;
+    std::string s = "\n" + className() + "\n";
+
+    s += "Sorted Stats\n";
+    for (i = 0; i < sorted.size(); ++i)
+        s += sorted[i]->className() + "\n";
+    s += "\n";
+
+    s += "Stats\n";
+    for (i = 0; i < stats.size(); ++i)
+        s += stats[i]->className() + "\n";
+    s += "\n";
+
+    s += "Updaters\n";
+    for (i = 0; i < updaters.size(); ++i)
+        s += updaters[i]->className() + "\n";
+    s += "\n";
+
+    s += "Monitors\n";
+    for (i = 0; i < monitors.size(); ++i)
+        s += monitors[i]->className() + "\n";
+    s += "\n";
+
+    s += "Continuators\n";
+    for (i = 0; i < continuators.size(); ++i)
+        s += continuators[i]->className() + "\n";
+    s += "\n";
+
+    return s;
+}
+
+#endif
diff --git a/trunk/paradiseo-eo/src/utils/eoData.cpp b/trunk/paradiseo-eo/src/utils/eoData.cpp
new file mode 100644
index 000000000..7e4457075
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoData.cpp
@@ -0,0 +1,11 @@
+// Copyright (C) 2005 Jochen Küpper 
+
+
+#include "eoData.h"
+
+
+
+// Local Variables:
+// c-file-style: "Stroustrup"
+// fill-column: 80
+// End:
diff --git a/trunk/paradiseo-eo/src/utils/eoData.h b/trunk/paradiseo-eo/src/utils/eoData.h
new file mode 100644
index 000000000..b5e11bac1
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoData.h
@@ -0,0 +1,52 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+-----------------------------------------------------------------------------
+    eoData.h
+
+    (c) GeNeura Team & Maarten Keijzer, 1998, 1999, 2000
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+
+#ifndef EODATA_H
+#define EODATA_H
+
+#ifndef _MSC_VER
+#include 
+#define _isnan isnan
+#endif
+
+
+//-----------------------------------------------------------------------------
+// some defines to make things easier to get at first sight
+
+// tuning the amount of output using a boolean argument:
+// true should always mean more output
+#define eo_verbose true
+#define eo_no_verbose false
+// to be used in selection / replacement procedures to indicate whether
+// the argument (rate, a double) shoudl be treated as a rate (number=rate*popSize)
+// or as an absolute integer (number=rate regardless of popsize).
+// the default value shoudl ALWAYS be true (eo_as_a_rate).
+//
+// this construct is mandatory because in some cases you might not know the
+// population size that will enter the replacement for instance - so you
+// cannot simply have a pre-computed (double) rate of 1/popSize
+#define eo_is_a_rate true
+#define eo_is_an_integer false
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/utils/eoDistance.h b/trunk/paradiseo-eo/src/utils/eoDistance.h
new file mode 100644
index 000000000..26ef0ea6f
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoDistance.h
@@ -0,0 +1,98 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoDistance.h
+// (c) GeNeura Team, 1998, Marc Schoenauer 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoDistance_H
+#define _eoDistance_H
+
+#include 
+/** 
+    This is a generic class for distance functors:
+    takes 2 things ane returns a double
+*/
+template< class EOT >
+class eoDistance : public eoBF
+{};
+
+
+/** 
+    This is a generic class for Euclidain distance (L2 norm) computation: 
+    assumes the 2 things are std::vectors of something that is double-castable
+*/
+template< class EOT >
+class eoQuadDistance : public eoDistance
+{
+public:
+  double operator()(const EOT & _v1, const EOT & _v2)
+  {
+     double sum=0.0;
+    for (unsigned i=0; i<_v1.size(); i++)
+      {
+	double r = static_cast (_v1[i]) - static_cast (_v2[i]);
+	sum += r*r;
+      }
+    return sqrt(sum);
+  }
+};
+
+/** 
+    This is a generic class for L1 distance computation: 
+    assumes the 2 things are std::vectors of something 
+    that is double-castable
+    For bitstrings, this is the Hamming distance
+*/
+template< class EOT >
+class eoHammingDistance : public eoDistance
+{
+public:
+  double operator()(const EOT & _v1, const EOT & _v2)
+  {
+     double sum=0.0;
+    for (unsigned i=0; i<_v1.size(); i++)
+      {
+	double r = static_cast (_v1[i]) - static_cast (_v2[i]);
+	sum += fabs(r);
+      }
+    return sum;
+  }
+};
+
+/* this distance measures the difference in fitness 
+ * I am not sure it can be of any use, though ... 
+ * except for some testing
+ */
+template< class EOT >
+class eoFitnessDistance : public eoDistance
+{
+public:
+  double operator()(const EOT & _v1, const EOT & _v2)
+  {
+    double d = _v1.fitness() - _v2.fitness();
+    return sqrt(d*d);
+  }
+};
+
+
+	
+#endif
diff --git a/trunk/paradiseo-eo/src/utils/eoFDCStat.h b/trunk/paradiseo-eo/src/utils/eoFDCStat.h
new file mode 100644
index 000000000..0d2dda730
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoFDCStat.h
@@ -0,0 +1,139 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoFDCStat.h
+// (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000, 2001
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoFDCStat_h
+#define _eoFDCStat_h
+
+#include 
+#include 
+#include 
+
+/**
+    The FDC computation - stores the values into eoValueParam
+so they can be snapshot by some eoGnuplotSnapshot ...
+*/
+template 
+class eoFDCStat : public eoStat
+{
+public:
+
+    using eoStat::value;
+
+    /** Ctor without the optimum */
+  eoFDCStat(eoDistance & _dist, std::string _description = "FDC") :
+      eoStat(0, _description), dist(_dist), boolOpt(false) {}
+
+  /** Ctor with the optimum
+   */
+  eoFDCStat(eoDistance & _dist, EOT & _theBest,
+	    std::string _description = "FDC") :
+    eoStat(0, _description), dist(_dist),
+    theBest(_theBest), boolOpt(true) {}
+
+  /** Compute the FDC - either from best in pop, or from absolute best
+   *  if it was passed in the constructor
+   */
+    virtual void operator()(const eoPop& _pop)
+    {
+      unsigned i;
+      if (!boolOpt)		   // take the local best
+	theBest = _pop.best_element();
+      unsigned int pSize = _pop.size();
+      distToBest.value().resize(pSize);
+      fitnesses.value().resize(pSize);
+      double sumFit = 0.0, sumDist = 0.0;
+      for (i=0; i >
+   */
+  const eoValueParam > & theDist()
+  { return distToBest; }
+  const eoValueParam > & theFit()
+  { return fitnesses; }
+
+
+private:
+  eoDistance & dist;
+  EOT theBest;
+  bool boolOpt;			   // whether the best is known or not
+  eoValueParam > distToBest;
+  eoValueParam > fitnesses;
+};
+
+/** Specific class for FDCStat monitoring:
+ *  As I failed to have FDC stat as an eoStat, this is the trick
+ *  to put the 2 eoParam > into a monitor
+ *  This class does nothing else.
+ */
+template 
+class eoFDCFileSnapshot : public eoFileSnapshot	// is an eoMonitor
+{
+public:
+  /** Ctor: in addition to the parameters of the ctor of an eoFileSnapshot
+            we need here an eoFDCStat. The 2 std::vectors (distances to optimum
+	    and fitnesses) are added to the monitor so they can be processed
+            later to a file - and eventually by gnuplot
+  */
+  eoFDCFileSnapshot(eoFDCStat & _FDCstat,
+		    std::string _dirname = "tmpFDC", unsigned _frequency = 1,
+		    std::string _filename = "FDC", std::string _delim = " "):
+    eoFileSnapshot(_dirname, _frequency, _filename, _delim),
+    FDCstat(_FDCstat)
+  {
+    eoFileSnapshot::add(FDCstat.theDist());
+    eoFileSnapshot::add(FDCstat.theFit());
+  }
+
+  /** just to be sure the add method is not called further
+   */
+  virtual void add(const eoParam& _param)
+    { throw std::runtime_error("eoFDCFileSnapshot::add(). Trying to add stats to an eoFDCFileSnapshot"); }
+
+private:
+  eoFDCStat & FDCstat;
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/src/utils/eoFileMonitor.cpp b/trunk/paradiseo-eo/src/utils/eoFileMonitor.cpp
new file mode 100644
index 000000000..1b42bbd84
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoFileMonitor.cpp
@@ -0,0 +1,77 @@
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+#include 
+#include 
+#include 
+
+#include 
+#include 
+#include 
+
+using namespace std;
+
+void eoFileMonitor::printHeader(std::ostream& os)
+{
+    iterator it = vec.begin();
+
+    os << (*it)->longName();
+
+    ++it;
+
+    for (; it != vec.end(); ++it)
+    {
+        os << delim.c_str() << (*it)->longName();
+    }
+    os << '\n';
+}
+
+void eoFileMonitor::printHeader()
+{
+    // create file
+    ofstream os(filename.c_str()); 
+
+    if (!os)
+    {
+        string str = "eoFileMonitor: Could not open " + filename;
+        throw runtime_error(str);
+    }
+    
+    printHeader(os);
+}
+
+eoMonitor& eoFileMonitor::operator()(void)
+{
+    ofstream os(filename.c_str(), ios_base::app);
+
+    if (!os)
+    {
+        string str = "eoFileMonitor: Could not append to " + filename;
+        throw runtime_error(str);
+    }
+
+    if (firstcall && !keep && header ){
+      printHeader();
+      firstcall = false;
+    }
+    
+    return operator()(os);
+}
+
+eoMonitor& eoFileMonitor::operator()(std::ostream& os)
+{
+    iterator it = vec.begin();
+
+    os << (*it)->getValue();
+    
+    for(++it; it != vec.end(); ++it)
+    {
+        os << delim.c_str() << (*it)->getValue();
+    }
+
+    os << '\n';
+    return *this;
+}
+
diff --git a/trunk/paradiseo-eo/src/utils/eoFileMonitor.h b/trunk/paradiseo-eo/src/utils/eoFileMonitor.h
new file mode 100644
index 000000000..545c51984
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoFileMonitor.h
@@ -0,0 +1,78 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoFileMonitor.h
+// (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef EO_eoFileMonitor_h
+#define EO_eoFileMonitor_h
+
+#include 
+#include 
+#include 
+
+#include "utils/eoMonitor.h"
+#include "eoObject.h"
+
+/** Prints statistics to file
+
+Modified the default behavior, so that it erases existing files. Can
+be modified in the ctor.
+
+@version MS 25/11/00
+*/
+class eoFileMonitor : public eoMonitor
+{
+public :
+
+  eoFileMonitor(std::string _filename, std::string _delim = " ", bool _keep = false, bool _header=false)
+    : filename(_filename), delim(_delim), keep(_keep), header(_header), firstcall(true)
+  {
+    if (! _keep) {
+      std::ofstream os(filename.c_str());
+      if (!os){
+	std::string str = "eoFileMonitor: Could not open " + filename;
+	throw std::runtime_error(str);
+      }
+    }
+  }
+
+  virtual eoMonitor& operator()(void);
+
+  virtual eoMonitor& operator()(std::ostream& os);
+
+  void printHeader(void);
+  virtual void printHeader(std::ostream& os);
+
+  virtual std::string getFileName() { return filename;}
+
+private :
+  std::string filename;
+  std::string delim;
+  bool keep;			   // should we append or create a new file
+  bool header;                     // printing header at begin of file?
+  bool firstcall;
+
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/utils/eoFileSnapshot.h b/trunk/paradiseo-eo/src/utils/eoFileSnapshot.h
new file mode 100644
index 000000000..5dff408af
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoFileSnapshot.h
@@ -0,0 +1,190 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoFileSnapshot.h
+// (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2001
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoFileSnapshot_h
+#define _eoFileSnapshot_h
+
+#include 
+#include 
+#include 
+#include 
+#include 
+
+
+/**
+    Prints snapshots of fitnesses to a (new) file every N generations
+
+Assumes that the parameters that are passed to the monitor
+(method add in eoMonitor.h) are eoValueParam > of same size.
+
+A dir is created and one file per snapshot is created there -
+so you can later generate a movie!
+
+TODO: The counter is handled internally, but this should be changed
+so that you can pass e.g. an evalcounter (minor)
+
+I failed to templatize everything so that it can handle eoParam >
+for any type T, simply calling their getValue method ...
+*/
+
+class eoFileSnapshot : public eoMonitor
+{
+public :
+  typedef std::vector vDouble;
+  typedef eoValueParam > vDoubleParam;
+
+  eoFileSnapshot(std::string _dirname, unsigned _frequency = 1, std::string _filename = "gen",
+	      std::string _delim = " ", unsigned _counter = 0, bool _rmFiles = true):
+    dirname(_dirname), frequency(_frequency),
+    filename(_filename), delim(_delim), counter(_counter), boolChanged(true)
+  {
+    std::string s = "test -d " + dirname;
+
+    int res = system(s.c_str());
+    // test for (unlikely) errors
+    if ( (res==-1) || (res==127) )
+      throw std::runtime_error("Problem executing test of dir in eoFileSnapshot");
+    // now make sure there is a dir without any genXXX file in it
+    if (res)                    // no dir present
+      {
+	s = std::string("mkdir ")+dirname;
+      }
+    else if (!res && _rmFiles)
+      {
+	s = std::string("/bin/rm ")+dirname+ "/" + filename + "*";
+      }
+    else
+      s = " ";
+
+    system(s.c_str());
+    // all done
+  }
+
+  /** accessor: has something changed (for gnuplot subclass)
+   */
+  virtual bool hasChanged() {return boolChanged;}
+
+  /** accessor to the counter: needed by the gnuplot subclass
+   */
+  unsigned getCounter() {return counter;}
+
+  /** accessor to the current filename: needed by the gnuplot subclass
+   */
+  std::string getFileName() {return currentFileName;}
+
+  /** sets the current filename depending on the counter
+   */
+  void setCurrentFileName()
+  {
+      std::ostringstream oscount;
+      oscount << counter;
+      currentFileName = dirname + "/" + filename + oscount.str();
+  }
+
+  /** The operator(void): opens the std::ostream and calls the write method
+   */
+  eoMonitor& operator()(void)
+  {
+    if (counter % frequency)
+      {
+	boolChanged = false;  // subclass with gnuplot will do nothing
+	counter++;
+	return (*this);
+      }
+    counter++;
+    boolChanged = true;
+    setCurrentFileName();
+    std::ofstream os(currentFileName.c_str());
+
+    if (!os)
+      {
+        std::string str = "eoFileSnapshot: Could not open " + currentFileName;
+        throw std::runtime_error(str);
+      }
+
+    return operator()(os);
+  }
+
+  /** The operator(): write on an std::ostream
+   */
+  eoMonitor& operator()(std::ostream& _os)
+  {
+    const eoValueParam >  * ptParam =
+      static_cast >* >(vec[0]);
+
+    const std::vector  v = ptParam->value();
+    if (vec.size() == 1)	   // only one std::vector: -> add number in front
+      {
+	for (unsigned k=0; k > vv(vec.size());
+	vv[0]=v;
+	for (unsigned i=1; i >* >(vec[1]);
+	    vv[i] = ptParam->value();
+	    if (vv[i].size() != v.size())
+	      throw std::runtime_error("Dimension error in eoSnapshotMonitor");
+	  }
+	for (unsigned k=0; k >*>(&_param))
+    {
+      throw std::logic_error(std::string("eoFileSnapshot: I can only monitor std::vectors of doubles, sorry. The offending parameter name = ") + _param.longName());
+    }
+    eoMonitor::add(_param);
+  }
+
+private :
+  std::string dirname;
+  unsigned frequency;
+  std::string filename;
+  std::string delim;
+  unsigned int counter;
+  std::string currentFileName;
+  bool boolChanged;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/utils/eoGnuplot.cpp b/trunk/paradiseo-eo/src/utils/eoGnuplot.cpp
new file mode 100644
index 000000000..55bca8d18
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoGnuplot.cpp
@@ -0,0 +1,98 @@
+//-----------------------------------------------------------------------------
+// (c) Marc Schoenauer, 2001
+// Copyright (C) 2005 Jochen Küpper
+/*
+   This library is free software; you can redistribute it and/or modify it under
+   the terms of the GNU Lesser General Public License as published by the Free
+   Software Foundation; either version 2 of the License, or (at your option) any
+   later version.
+
+   This library is distributed in the hope that it will be useful, but WITHOUT
+   ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
+   FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more
+   details.
+
+   You should have received a copy of the GNU Lesser General Public License
+   along with this library; if not, write to the Free Software Foundation, Inc.,
+   59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+
+   Contact: Marc.Schoenauer@polytechnique.fr
+ */
+//-----------------------------------------------------------------------------
+
+#ifdef HAVE_CONFIG_H
+#include 
+#endif
+
+#include 
+#include 
+
+#include "eoGnuplot.h"
+
+
+unsigned eoGnuplot::numWindow=0;
+
+
+
+eoGnuplot::eoGnuplot(std::string _title, std::string _extra)
+    : firstTime(true)
+{
+    initGnuPlot(_title, _extra);
+}
+
+
+
+eoGnuplot::~eoGnuplot()
+{
+#ifdef HAVE_GNUPLOT
+    if( gpCom ) {
+        PipeComSend( gpCom, "quit\n" );
+        PipeComClose( gpCom );
+        gpCom =NULL;
+    }
+#endif
+}
+
+
+
+void eoGnuplot::gnuplotCommand(const char *_command)
+{
+#ifdef HAVE_GNUPLOT
+    if(gpCom) {
+        PipeComSend( gpCom, _command );
+        PipeComSend( gpCom, "\n" );
+    }
+#endif
+}
+
+
+
+void eoGnuplot::initGnuPlot(std::string _title, std::string _extra)
+{
+#ifdef HAVE_GNUPLOT
+    std::ostringstream os;
+    os << "250x150-0+" << 170 * numWindow++;
+    char *args[6];
+    args[0] = strdup( GNUPLOT_PROGRAM );
+    args[1] = strdup( "-geometry" );
+    args[2] = strdup( os.str().c_str());
+    args[3] = strdup( "-title" );
+    args[4] = strdup( _title.c_str() );
+    args[5] = 0;
+    gpCom = PipeComOpenArgv( GNUPLOT_PROGRAM, args );
+    if(! gpCom )
+        throw std::runtime_error("Cannot spawn gnuplot\n");
+    else {
+        PipeComSend( gpCom, "set grid\n" );
+        PipeComSend( gpCom, _extra.c_str() );
+        PipeComSend( gpCom, "\n" );
+    }
+#endif
+}
+
+
+
+// Local Variables:
+// c-file-style: "Stroustrup"
+// fill-column: 80
+// End:
diff --git a/trunk/paradiseo-eo/src/utils/eoGnuplot.h b/trunk/paradiseo-eo/src/utils/eoGnuplot.h
new file mode 100644
index 000000000..e057900a5
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoGnuplot.h
@@ -0,0 +1,99 @@
+//-----------------------------------------------------------------------------
+// eoGnuplot1DMonitor.h
+// (c) Marc Schoenauer, 2001
+/*
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+   Contact: Marc.Schoenauer@polytechnique.fr
+ */
+//-----------------------------------------------------------------------------
+#ifndef EO_eoGnuplot_H
+#define EO_eoGnuplot_H
+
+#include 
+
+#include "pipecom.h"
+
+
+/** Base class for calls to gnuplot
+
+This class is the abstract class that will be used by further gnuplot
+calls to plots what is already written by some eoMonitor into a file
+
+@author Marc Schoenauer
+@version 0.0 (2001)
+*/
+class eoGnuplot
+{
+public:
+
+    /** Open pipe to Gnuplot.
+
+    @param _title Title for gnuplot window.
+    @param _extra Extra parameters to gnuplot (default ).
+    */
+    eoGnuplot(std::string _title, std::string _extra = std::string(""));
+
+    /** Destructor
+
+    Close the gnuplot windows if pipe was correctly opened
+    */
+    virtual ~eoGnuplot();
+
+    /** Class name */
+    virtual std::string className() const
+        { return "eoGnuplot"; }
+
+    /** Send command to gnuplot */
+    void gnuplotCommand(const char * _command);
+
+    /** Send command to gnuplot
+
+    @overload
+    */
+    void gnuplotCommand(std::string _command)
+        { gnuplotCommand(_command.c_str()); }
+
+
+protected:
+
+    /** Initialize gnuplot
+
+    @param _title Title for gnuplot window.
+    @param _extra Extra parameters to gnuplot.
+    */
+    void initGnuPlot(std::string _title, std::string _extra);
+
+    /** The stats might be unknown in Ctor */
+    bool firstTime;
+
+    /** Communication with gnuplot OK */
+    PCom *gpCom;
+
+    /** Internal counter for gnuplot windows */
+    static unsigned numWindow;
+};
+
+
+#endif // EO_eoGnuplot_H
+
+
+
+// Local Variables:
+// c-file-style: "Stroustrup"
+// comment-column: 35
+// fill-column: 80
+// mode: C++
+// End:
diff --git a/trunk/paradiseo-eo/src/utils/eoGnuplot1DMonitor.cpp b/trunk/paradiseo-eo/src/utils/eoGnuplot1DMonitor.cpp
new file mode 100644
index 000000000..c0cff842c
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoGnuplot1DMonitor.cpp
@@ -0,0 +1,85 @@
+//-----------------------------------------------------------------------------
+// eoGnuplot1DMonitor.h
+// (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000
+/*
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+   Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+
+#ifdef HAVE_CONFIG_H
+#include 
+#endif
+
+#include 
+
+#include "utils/eoGnuplot1DMonitor.h"
+#include "utils/eoParam.h"
+
+
+eoMonitor& eoGnuplot1DMonitor::operator() (void)
+{
+    // update file using the eoFileMonitor
+    eoFileMonitor::operator()();
+#ifdef HAVE_GNUPLOT
+    // sends plot order to gnuplot
+    // assumes successive plots will have same nb of columns!!!
+    if (firstTime)
+    {
+        FirstPlot();
+        firstTime = false;
+    }
+    else
+    {
+        if( gpCom ) {
+            PipeComSend( gpCom, "replot\n" );
+        }
+    }
+#endif
+    return *this;
+}
+
+
+
+void eoGnuplot1DMonitor::FirstPlot()
+{
+    if (this->vec.size() < 2)
+    {
+        throw std::runtime_error("Must have some stats to plot!\n");
+    }
+#ifdef HAVE_GNUPLOT
+    std::ostringstream os;
+    os << "plot";
+    for (unsigned i=1; ivec.size(); i++) {
+        os << " '" << getFileName().c_str() <<
+            "' using 1:" << i+1 << " title '" << (this->vec[i])->longName() << "' with lines" ;
+        if (ivec.size()-1)
+            os << ", ";
+    }
+    os << '\n';
+    PipeComSend( gpCom, os.str().c_str());
+#endif
+}
+
+
+
+// Local Variables:
+// c-file-style: "Stroustrup"
+// fill-column: 80
+// End:
diff --git a/trunk/paradiseo-eo/src/utils/eoGnuplot1DMonitor.h b/trunk/paradiseo-eo/src/utils/eoGnuplot1DMonitor.h
new file mode 100644
index 000000000..523e875c5
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoGnuplot1DMonitor.h
@@ -0,0 +1,83 @@
+//-----------------------------------------------------------------------------
+// eoGnuplot1DMonitor.h
+// (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000
+/*
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+   Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+#ifndef EO_eoGnuplot1DMonitor_H
+#define EO_eoGnuplot1DMonitor_H
+
+#include 
+#include 
+
+#include "eoObject.h"
+#include "utils/eoFileMonitor.h"
+#include "utils/eoGnuplot.h"
+#include "utils/pipecom.h"
+
+/** Plot eoStat
+
+@author Marc Schoenauer
+@version 0.0 (2000)
+
+This class plots through gnuplot the eoStat given as argument
+
+eoGnuplot1DMonitor plots stats through gnuplot
+
+Assumes that the same file is appened every so and so, and replots it
+everytime
+*/
+class eoGnuplot1DMonitor : public eoFileMonitor, public eoGnuplot
+{
+public:
+
+  // this "using" directive generates a compiler internal error in GCC 4.0.0 ...
+  // it's been removed, and the only call to vec was replaced by this->vec in eoGnuplot1DMonitor.cpp
+  //    using eoMonitor::vec;
+
+    /** Constructor */
+    eoGnuplot1DMonitor(std::string _filename, bool _top=false) :
+        eoFileMonitor(_filename, " "),
+        eoGnuplot(_filename,(_top?"":"set key bottom"))
+        {}
+
+    /** Destructor */
+    virtual ~eoGnuplot1DMonitor(){}
+
+    virtual eoMonitor& operator()();
+
+    virtual void FirstPlot();
+
+    /** Class name */
+    virtual std::string className() const
+        { return "eoGnuplot1DMonitor"; }
+};
+
+
+#endif // EO_eoGnuplot1DMonitor_H
+
+
+
+// Local Variables:
+// c-file-style: "Stroustrup"
+// comment-column: 35
+// fill-column: 80
+// mode: C++
+// End:
diff --git a/trunk/paradiseo-eo/src/utils/eoGnuplot1DSnapshot.cpp b/trunk/paradiseo-eo/src/utils/eoGnuplot1DSnapshot.cpp
new file mode 100644
index 000000000..e8fb8e8cf
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoGnuplot1DSnapshot.cpp
@@ -0,0 +1,32 @@
+#ifdef HAVE_CONFIG_H
+#include 
+#endif
+
+#include "eoGnuplot1DSnapshot.h"
+
+
+
+eoMonitor& eoGnuplot1DSnapshot::operator()()
+{
+    // update file using the eoFileMonitor method
+    eoFileSnapshot::operator()();
+
+#ifdef HAVE_GNUPLOT
+    // sends plot order to gnuplot
+    std::ostringstream os;
+    os << "set title 'Gen. " << getCounter() << "'; plot '"
+        // mk: had to use getFilename().c_str(),
+        // because it seems the string(stream) lib is screwed in gcc3.2
+       << getFileName().c_str() << "' notitle with points ps " << pointSize
+       << std::endl;
+    PipeComSend(gpCom, os.str().c_str());
+#endif
+    return *this;
+}
+
+
+
+// Local Variables:
+// c-file-style: "Stroustrup"
+// fill-column: 80
+// End:
diff --git a/trunk/paradiseo-eo/src/utils/eoGnuplot1DSnapshot.h b/trunk/paradiseo-eo/src/utils/eoGnuplot1DSnapshot.h
new file mode 100644
index 000000000..f004a56e4
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoGnuplot1DSnapshot.h
@@ -0,0 +1,119 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoGnuplot1DSnapshot.h
+// (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000
+/*
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+   Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@inria.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+
+#ifndef EO_eoGnuplot1DSnapshot_H
+#define EO_eoGnuplot1DSnapshot_H
+
+#include 
+#include 
+#include 
+
+#include 
+#include "eoRealVectorBounds.h"
+#include 
+#include 
+#include 
+
+/** Plot stats through gnuplot
+
+@author Marc Schoenauer 2000
+@version 0.0
+
+This class plots through gnuplot the eoStat given as argument
+
+Assumes that the same file is re-written every so and so, and plots it
+from scratch everytime it's called
+ */
+class eoGnuplot1DSnapshot: public eoFileSnapshot, public eoGnuplot
+{
+ public:
+    // Ctor
+  eoGnuplot1DSnapshot(std::string _dirname, unsigned _frequency = 1,
+                      std::string _filename = "gen", std::string _delim = " ",
+                      unsigned _counter = 0, bool _rmFiles = true) :
+      eoFileSnapshot(_dirname, _frequency, _filename, _delim, _counter, _rmFiles),
+      eoGnuplot(_filename,"set data style points"),
+      pointSize(5)
+  {}
+
+    // Ctor
+  eoGnuplot1DSnapshot(std::string _dirname,  eoRealVectorBounds & _bounds,
+		       unsigned _frequency = 1, std::string _filename = "gen",
+		       std::string _delim = " ", unsigned _counter = 0, bool _rmFiles = true ) :
+      eoFileSnapshot(_dirname, _frequency, _filename, _delim, _counter, _rmFiles),
+      eoGnuplot(_filename,"set data style points"),
+      pointSize(5)
+  {
+    handleBounds(_bounds);
+  }
+    // Ctor
+  eoGnuplot1DSnapshot(eoFileSnapshot & _fSnapshot) :
+      eoFileSnapshot(_fSnapshot),
+      eoGnuplot(_fSnapshot.baseFileName(),"set data style points"),
+      pointSize(5)
+  {}
+
+    // Ctor with range
+  eoGnuplot1DSnapshot(eoFileSnapshot & _fSnapshot, eoRealVectorBounds & _bounds) :
+      eoFileSnapshot(_fSnapshot),
+      eoGnuplot(_fSnapshot.baseFileName(),"set data style points"),
+      pointSize(5)
+  {
+    handleBounds(_bounds);
+  }
+
+  // Dtor
+  virtual ~eoGnuplot1DSnapshot(){}
+
+  virtual eoMonitor& operator()();
+
+  /// Class name.
+  virtual std::string className() const { return "eoGnuplot1DSnapshot"; }
+
+  virtual void handleBounds(eoRealVectorBounds & _bounds)
+  {
+      std::ostringstream os;
+      os << "set autoscale\nset yrange [" ;
+      if (_bounds.isMinBounded(0))
+          os << _bounds.minimum(0);
+      os << ":" ;
+      if (_bounds.isMaxBounded(0))
+          os << _bounds.maximum(0);
+      os << "]\n";
+      gnuplotCommand(os.str());
+  }
+
+  void setPointSize(unsigned  _pointSize)
+  { pointSize = _pointSize; }
+
+protected:
+
+    unsigned pointSize;
+};
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/utils/eoHowMany.h b/trunk/paradiseo-eo/src/utils/eoHowMany.h
new file mode 100644
index 000000000..39faa8b98
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoHowMany.h
@@ -0,0 +1,192 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoHowMany_h.h
+//   Base class for choosing a number of guys to apply something from a popsize
+// (c) Marc Schoenauer, 2000
+/*
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2 of the License, or (at your option) any later version.
+
+   This library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with this library; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+   Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoHowMany_h
+#define eoHowMany_h
+
+/** A helper class, to determine a number of individuals from another one
+ *  Typically, is used in selection / replacement procedures, e.g.
+ *             the number of offspring from the number of parents, or
+ *             the number of survivors for an eoReduce functor, ...
+ *
+ * Such construct is very useful because in some cases you might not know the
+ * population size that will enter the replacement. For instance, you
+ * cannot simply have a pre-computed (double) rate of 1/popSize
+ * if you want to select or kill just 1 guy. Using an eoHowMany
+ * allows one to modify the population size without touching anything else.
+ *
+ * There are 4 possible way to compute the return value from the argument:
+ *    - an absolute POSITIVE integer  --> return it (regardless of popsize)
+ *    - a POSITIVE rate               -->  return rate*popSize
+ *    - an absolute NEGATIVE integer  --> return popsize-rate (if positive)
+ *    - a NEGATIVE rate in [-1,0]     --> store and use 1-|rate| (positive)
+ * Note that a negative rate should be have been necessary because a rate is
+ * relative, but it is there for consistency reasons - and because it
+ * is needed in eoG3Replacement
+ *
+ * It has 2 private members, a double and an integer to cover all cases
+ *
+ * Example use: in eoGeneralBreeder.h
+ * Example reading from parser: in
+ *         do/make_algo_scalar.h line 141
+
+ * MS 10/04/2002:
+ *    Added the possibility to have a negative number -
+ *        when treated as a number: returns then (size - combien)
+ *    Should not modify anything when a positive number is passed in the ctor
+ *
+ * MS 20/06/2002:
+ *    Added the negative rate and the operator-() (for
+ *    eoG3Repalcement)
+ *
+ * It is an eoPersistent because we need to be able to use eoParamValue
+ */
+
+#include 
+
+class eoHowMany : public eoPersistent
+{
+public:
+  /** Original Ctor from direct rate + bool
+      @param rate    the rate, OR the integer to store, depending on 2nd arg.
+      @param _interpret_as_rate to tell whether the rate actually is a rate
+  */
+  eoHowMany(double  _rate = 0.0, bool _interpret_as_rate = true):
+    rate(_rate), combien(0)
+  {
+    if (_interpret_as_rate)
+      {
+	if (_rate<0)
+	  {
+	    rate = 1.0+_rate;
+	    if (rate < 0)	   // was < -1
+	      throw std::logic_error("rate<-1 in eoHowMany!");
+	  }
+      }
+    else
+      {
+	rate = 0.0;		   // just in case, but shoud be unused
+	combien = int(_rate);	   // negative values are allowed here
+	if (combien != _rate)
+	  std::cerr << "Warning: Number was rounded in eoHowMany";
+      }
+  }
+
+  /** Ctor from an int - both from int and unsigned int are needed
+   *     to avoid ambiguity with the Ctor from a double */
+  eoHowMany(int _combien) : rate(0.0), combien(_combien) {}
+
+  /** Ctor from an unsigned int - both from int and unsigned int are needed
+   *     to avoid ambiguity with the Ctor from a double */
+  eoHowMany(unsigned int _combien) : rate(0.0), combien(_combien) {}
+
+  /// Virtual dtor. They are needed in virtual class hierarchies.
+  virtual ~eoHowMany() {}
+
+  /** Does what it was designed for
+   *  - combien==0 : return rate*_size
+   *  - else
+   *    - combien>0 : return combien (regardless of _size)
+   *    - combien<0 : return _size-|combien|
+   */
+  unsigned int operator()(unsigned int _size)
+  {
+    if (combien == 0)
+      {
+	return (unsigned int) (rate * _size);
+      }
+    if (combien < 0)
+      {
+	unsigned int combloc = -combien;
+	if (_size> value;
+    readFrom(value);
+    return;
+  }
+
+  void readFrom(std::string _value)
+  {
+    // check for %
+    bool interpret_as_rate = false;   // == no %
+    size_t pos =  _value.find('%');
+    if (pos < _value.size())  //  found a %
+      {
+	interpret_as_rate = true;
+	_value.resize(pos);	   // get rid of %
+      }
+
+    std::istringstream is(_value);
+    is >> rate;
+    // now store
+    if (interpret_as_rate)
+      {
+	combien = 0;
+	rate /= 100.0;
+      }
+    else
+      combien = int(rate);	   // and rate will not be used
+
+    // minimal check
+    if ( rate < 0.0 )
+      throw std::runtime_error("Negative rate read in eoHowMany::readFrom");
+  }
+
+  /** The unary - operator: reverses the computation */
+  eoHowMany operator-()
+  {
+    if (!combien)		   // only rate is used
+      rate = 1.0-rate;
+    else
+      combien = -combien;
+    return (*this);
+  }
+
+private :
+  double rate;
+  int combien;
+};
+
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/utils/eoIntBounds.cpp b/trunk/paradiseo-eo/src/utils/eoIntBounds.cpp
new file mode 100644
index 000000000..59350240b
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoIntBounds.cpp
@@ -0,0 +1,98 @@
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif
+
+#ifdef HAVE_CONFIG_H
+#include 
+#endif
+
+#include 
+#include 
+
+#include "eoIntBounds.h"
+
+
+// the global dummy bounds
+// (used for unbounded variables when bounds are required)
+eoIntNoBounds eoDummyIntNoBounds;
+
+///////////// helper read functions defined in eoRealBounds.cpp
+extern bool remove_leading(std::string & _s, const std::string _delim);
+extern double read_double(std::string _s);
+extern long int read_int(std::string _s);
+
+
+/** the constructor for eoGeneralIntBound - from a string
+ */
+eoIntBounds* eoGeneralIntBounds::getBoundsFromString(std::string _value)
+{
+  // now read
+  std::string delim(",; ");
+  std::string beginOrClose("[(])");
+  if (!remove_leading(_value, delim)) // only delimiters were left
+    throw std::runtime_error("Syntax error in eoGeneralIntBounds Ctor");
+
+  // look for opening char
+  size_t posDeb = _value.find_first_of(beginOrClose);	// allow ]a,b]
+  if (posDeb >= _value.size())	// nothing left to read
+    throw std::runtime_error("Syntax error in eoGeneralIntBounds Ctor");
+
+  // ending char: next {}() after posDeb
+  size_t posFin = _value.find_first_of(beginOrClose,posDeb+1);
+  if (posFin >= _value.size())	// not found
+    throw std::runtime_error("Syntax error in eoGeneralIntBounds Ctor");
+
+  // the bounds
+  std::string sBounds = _value.substr(posDeb+1, posFin-posDeb-1);
+  // and remove from original string
+  _value = _value.substr(posFin+1);
+
+  remove_leading(sBounds, delim);
+  size_t posDelim = sBounds.find_first_of(delim);
+  if (posDelim >= sBounds.size())
+    throw std::runtime_error("Syntax error in eoGeneralIntBounds Ctor");
+
+      bool minBounded=false, maxBounded=false;
+      long int minBound=0, maxBound=0;
+
+      // min bound
+      std::string sMinBounds = sBounds.substr(0,posDelim);
+
+      if ( (sMinBounds != std::string("-inf")) &&
+	   (sMinBounds != std::string("-infinity"))
+	   )
+	{
+	  minBounded = true;
+	  minBound = read_int(sMinBounds);
+	}
+
+      // max bound
+      size_t posEndDelim = sBounds.find_first_not_of(delim,posDelim);
+
+      std::string sMaxBounds = sBounds.substr(posEndDelim);
+
+      if ( (sMaxBounds != std::string("+inf")) &&
+	   (sMaxBounds != std::string("+infinity"))
+	   )
+	{
+	  maxBounded = true;
+	  maxBound = read_int(sMaxBounds);
+	}
+
+      // now create the embedded eoIntBounds object
+      eoIntBounds * locBound;
+      if (minBounded && maxBounded)
+	{
+	  if (maxBound <= minBound)
+	    throw std::runtime_error("Syntax error in eoGeneralIntBounds Ctor");
+	  locBound = new eoIntInterval(minBound, maxBound);
+	}
+      else if (!minBounded && !maxBounded)	// no bound at all
+	locBound = new eoIntNoBounds;
+      else if (!minBounded && maxBounded)
+	locBound = new eoIntAboveBound(maxBound);
+      else if (minBounded && !maxBounded)
+	locBound = new eoIntBelowBound(minBound);
+      return locBound;
+}
diff --git a/trunk/paradiseo-eo/src/utils/eoIntBounds.h b/trunk/paradiseo-eo/src/utils/eoIntBounds.h
new file mode 100644
index 000000000..59c98c03f
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoIntBounds.h
@@ -0,0 +1,692 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoIntBounds.h
+// (c) Marc Schoenauer 2001, Maarten Keijzer 2000, GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoIntBounds_h
+#define _eoIntBounds_h
+
+#include 		   // std::exceptions!
+#include 
+
+/**
+\defgroup EvolutionStrategies
+
+*/
+
+
+/**
+\class eoIntBounds eoIntBounds.h es/eoIntBounds.h
+\ingroup EvolutionStrategies
+
+    Defines bound classes for real numbers.
+
+Scalar type:
+------------
+Basic class is eoIntBounds, a pure virtual.
+
+The following pure virtual methods are to be used in mutations:
+- void foldsInBounds(long int &) that folds any value that falls out of 
+  the bounds back into the bounds, by bouncing on the limit (if any)
+- bool isInBounds(long int) that simply says whether or not the argument 
+  is in the bounds
+- void truncate(long int &) that set the argument to the bound value it
+it exceeds it
+
+So mutation can choose 
+- iterate trying until they fall in bounds, 
+- only try once and "restd::pair" by using the foldsInBounds method
+- only try once and restd::pair using the truncate method (will create a
+  huge bias toward the bound if the soluiton is not far from the bounds)
+
+There is also a uniform() method that generates a uniform value 
+(if possible, i.e. if bounded) in the interval.
+
+Derived class are 
+eoIntInterval that holds a minimum and maximum value, 
+eoIntNoBounds the "unbounded bounds" (-infinity, +infinity)
+eoIntBelowBound the half-bounded interval [min, +infinity)
+eoIntAboveBound the   half-bounded interval (-infinity, max]
+
+THis file also contains the declaration of *the* global object that
+is the unbounded bound
+*/
+class eoIntBounds : public eoPersistent
+{ 
+public:
+  virtual ~eoIntBounds(){}
+
+  /** Self-Test: true if ***both*** a min and a max
+   */
+  virtual bool isBounded(void) const  = 0;
+
+  /** Self-Test: true if no min ***and*** no max
+   *        hence no further need to test/truncate/fold anything
+   */
+  virtual bool hasNoBoundAtAll(void) const  = 0;
+
+  /** Self-Test: bounded from below???
+   */
+  virtual bool isMinBounded(void) const = 0;
+
+  /** Self-Test: bounded from above???
+   */
+  virtual bool isMaxBounded(void) const = 0;
+
+  /** Test on a value: is it in bounds?
+   */
+  virtual bool isInBounds(double)  const = 0;
+
+  /** Put value back into bounds - by folding back and forth
+   */
+  virtual void foldsInBounds(double &)  const = 0;
+
+  /** foldsInBounds for ints: 
+   * call the method for double and convert back */
+  virtual void foldsInBounds(long int & i)  const
+  {
+    double r = double(i);
+    foldsInBounds(r);
+    i = (long int)(r);
+  }
+
+  /** Put value back into bounds - by truncating to a boundary value
+   */
+  virtual void truncate(double &)  const = 0;
+
+  /** truncate for ints: call the method for double and convert back
+   */
+  virtual void truncate(long int & i)  const 
+  {
+    double r = double(i);
+    truncate(r);
+    i = (long int)(r);
+  }
+
+  /** get minimum value 
+   *  @std::exception if does not exist
+   */  
+  virtual long int minimum()  const = 0 ;
+  /** get maximum value
+   *  @std::exception if does not exist
+   */  
+  virtual long int maximum()  const = 0 ;
+  /** get range
+   *  @std::exception if unbounded
+   */  
+  virtual long int range()  const = 0;
+
+  /** random generator of uniform numbers in bounds
+   * uses same naming convention than eo::rng
+   * @std::exception if unbounded
+   */
+  virtual double uniform(eoRng & _rng = eo::rng)  const = 0;
+  virtual long int random(eoRng & _rng = eo::rng)  const = 0;
+
+  /** for memory managements - ugly */
+  virtual eoIntBounds * dup()  const = 0;
+};
+
+/** A default class for unbounded variables
+ */
+class eoIntNoBounds : public eoIntBounds
+{
+public:
+  virtual ~eoIntNoBounds(){}
+
+  virtual bool isBounded(void)  const {return false;}
+  virtual bool hasNoBoundAtAll(void) const  {return true;}
+  virtual bool isMinBounded(void)  const {return false;}
+  virtual bool isMaxBounded(void)  const {return false;}
+  virtual void foldsInBounds(double &)  const {return;}
+  virtual void truncate(double &)  const {return;}
+  virtual bool isInBounds(double)  const {return true;}
+
+  virtual long int minimum() const
+  {
+    throw std::logic_error("Trying to get minimum of unbounded eoIntBounds");
+  }
+  virtual long int maximum() const 
+  {
+    throw std::logic_error("Trying to get maximum of unbounded eoIntBounds");
+  }
+  virtual long int range() const 
+  {
+    throw std::logic_error("Trying to get range of unbounded eoIntBounds");
+  }
+
+  virtual double uniform(eoRng & _rng = eo::rng) const 
+  {
+    throw std::logic_error("Trying to generate uniform values in unbounded eoIntBounds");
+  }
+  virtual long int random(eoRng & _rng = eo::rng) const 
+  {
+    throw std::logic_error("Trying to generate uniform values in unbounded eoIntBounds");
+  }
+
+  // methods from eoPersistent
+  /**
+   * Read object.
+   * @param _is A std::istream.
+   * but reading should not be done here, because of bound problems
+   * see eoIntVectorBounds
+   */
+  virtual void readFrom(std::istream& _is) 
+  {
+    throw std::runtime_error("Should not use eoIntBounds::readFrom");
+  }
+
+  /**
+   * Write object. It's called printOn since it prints the object on a stream.
+   * @param _os A std::ostream.
+   */
+  virtual void printOn(std::ostream& _os) const
+  {
+    _os << "[-inf,+inf]";
+  }
+
+  /** for memory managements - ugly */
+  virtual eoIntBounds * dup() const 
+  {
+    return new eoIntNoBounds(*this);
+  }
+
+};
+
+// one object for all - see eoIntBounds.cpp
+extern eoIntNoBounds eoDummyIntNoBounds;
+
+/**
+ * fully bounded eoIntBound == interval
+ */
+class eoIntInterval : public eoIntBounds
+{
+public :
+  virtual ~eoIntInterval(){}
+  
+  /** 
+      Simple bounds = minimum and maximum (allowed)
+  */
+  eoIntInterval(long int _min=0, long int _max=1) : 
+    repMinimum(_min), repMaximum(_max), repRange(_max-_min) 
+  {
+    if (repRange<=0)
+      throw std::logic_error("Void range in eoIntBounds");
+  }
+
+  // accessors  
+  virtual long int minimum() const { return repMinimum; }
+  virtual long int maximum() const { return repMaximum; }
+  virtual long int range()  const { return repRange; }
+
+  // description
+  virtual bool isBounded(void)  const {return true;}
+  virtual bool hasNoBoundAtAll(void)  const {return false;}
+  virtual bool isMinBounded(void)  const {return true;}
+  virtual bool isMaxBounded(void)  const {return true;}
+
+  virtual double uniform(eoRng & _rng = eo::rng) const 
+  {
+    return repMinimum + _rng.uniform(repRange);
+  }  
+
+  virtual long int random(eoRng & _rng = eo::rng) const 
+  {
+    return repMinimum + _rng.random(repRange);
+  }  
+
+  // says if a given double is within the bounds
+  virtual bool isInBounds(double _r) const 
+  {
+    if (_r < repMinimum)
+      return false;
+    if (_r > repMaximum)
+      return false;
+    return true;
+  }
+
+  // folds a value into bounds
+  virtual void foldsInBounds(double &  _r) const 
+  {
+    long iloc;
+    double dlargloc = 2 * range() ;
+
+    if (fabs(_r) > 1.0E9)		// iloc too large!
+      {
+	_r = uniform();
+	return;
+      }
+
+    if ( (_r > maximum()) )
+      {
+	iloc = (long) ( (_r-minimum()) / dlargloc ) ;
+	_r -= dlargloc * iloc ;
+	if ( _r > maximum() )
+	  _r = 2*maximum() - _r ;
+      }
+    
+    if (_r < minimum()) 
+      {
+	iloc = (long) ( (maximum()-_r) / dlargloc ) ;
+	_r += dlargloc * iloc ;
+	if (_r < minimum())
+	  _r = 2*minimum() - _r ;
+      }
+  }    
+
+  // truncates to the bounds
+  virtual void truncate(double & _r) const 
+  {
+    if (_r < repMinimum)
+      _r = repMinimum;
+    else if (_r > repMaximum)
+      _r = repMaximum;
+    return;
+  }
+
+  // methods from eoPersistent
+  /**
+   * Read object.
+   * @param _is A std::istream.
+   * but reading should not be done here, because of bound problems
+   * see eoIntVectorBounds
+   */
+  virtual void readFrom(std::istream& _is) 
+  {
+    throw std::runtime_error("Should not use eoIntInterval::readFrom");
+  }
+
+  /**
+   * Write object. It's called printOn since it prints the object on a stream.
+   * @param _os A std::ostream.
+   */
+  virtual void printOn(std::ostream& _os) const
+  {
+    _os << "[" << repMinimum << "," << repMaximum << "]";
+  }
+
+  /** for memory managements - ugly */
+  virtual eoIntBounds * dup() const 
+  {
+    return new eoIntInterval(*this);
+  }
+
+private :
+  long int repMinimum;
+  long int repMaximum;
+  long int repRange;			   // to minimize operations ???
+};
+
+/**
+ * an eoIntBound bounded from below only
+ */
+class eoIntBelowBound : public eoIntBounds
+{
+public :
+  virtual ~eoIntBelowBound(){}  
+  /** 
+      Simple bounds = minimum
+  */
+  eoIntBelowBound(long int _min=0) : 
+    repMinimum(_min)
+  {}
+
+  // accessors  
+  virtual long int minimum() const { return repMinimum; }
+
+  virtual long int maximum() const 
+  {
+    throw std::logic_error("Trying to get maximum of eoIntBelowBound");
+  }
+  virtual long int range() const 
+  {
+    throw std::logic_error("Trying to get range of eoIntBelowBound");
+  }
+
+  virtual double uniform(eoRng & _rng = eo::rng) const 
+  {
+    throw std::logic_error("Trying to generate uniform values in eoIntBelowBound");
+  }
+  virtual long int random(eoRng & _rng = eo::rng) const 
+  {
+    throw std::logic_error("Trying to generate uniform values in eoIntBelowBound");
+  }
+
+  // description
+  virtual bool isBounded(void)  const {return false;}
+  virtual bool hasNoBoundAtAll(void)  const {return false;}
+  virtual bool isMinBounded(void)  const {return true;}
+  virtual bool isMaxBounded(void) const  {return false;}
+
+  // says if a given double is within the bounds
+  virtual bool isInBounds(double _r) const 
+  {
+    if (_r < repMinimum)
+      return false;
+    return true;
+  }
+
+  // folds a value into bounds
+  virtual void foldsInBounds(double &  _r) const 
+  {
+    // easy as a pie: symmetry w.r.t. minimum
+    if (_r < repMinimum)	   // nothing to do otherwise
+      _r = 2*repMinimum - _r;
+    return ;
+  }    
+
+  // truncates to the bounds
+  virtual void truncate(double & _r) const 
+  {
+    if (_r < repMinimum)
+      _r = repMinimum;
+    return;
+  }
+
+  // methods from eoPersistent
+  /**
+   * Read object.
+   * @param _is A std::istream.
+   * but reading should not be done here, because of bound problems
+   * see eoIntVectorBounds
+   */
+  virtual void readFrom(std::istream& _is) 
+  {
+    throw std::runtime_error("Should not use eoIntBelowBound::readFrom");
+  }
+
+  /**
+   * Write object. It's called printOn since it prints the object on a stream.
+   * @param _os A std::ostream.
+   */
+  virtual void printOn(std::ostream& _os) const
+  {
+    _os << "[" << repMinimum << ",+inf]";
+  }
+
+  /** for memory managements - ugly */
+  virtual eoIntBounds * dup() const 
+  {
+    return new eoIntBelowBound(*this);
+  }
+
+private :
+  long int repMinimum;
+};
+
+/**
+An eoIntBound bounded from above only
+*/
+class eoIntAboveBound : public eoIntBounds
+{
+public :
+  virtual ~eoIntAboveBound(){}
+  
+  /** 
+      Simple bounds = minimum
+  */
+  eoIntAboveBound(long int _max=0) : 
+    repMaximum(_max)
+  {}
+
+  // accessors  
+  virtual long int maximum() const  { return repMaximum; }
+
+  virtual long int minimum() const 
+  {
+    throw std::logic_error("Trying to get minimum of eoIntAboveBound");
+  }
+  virtual long int range() const 
+  {
+    throw std::logic_error("Trying to get range of eoIntAboveBound");
+  }
+
+  virtual double uniform(eoRng & _rng = eo::rng) const 
+  {
+    throw std::logic_error("Trying to generate uniform values in eoIntAboveBound");
+  }
+  virtual long int random(eoRng & _rng = eo::rng) const 
+  {
+    throw std::logic_error("Trying to generate uniform values in eoIntAboveBound");
+  }
+
+  // description
+  virtual bool isBounded(void)  const {return false;}
+  virtual bool hasNoBoundAtAll(void)  const {return false;}
+  virtual bool isMinBounded(void)  const {return false;}
+  virtual bool isMaxBounded(void)  const {return true;}
+
+  // says if a given double is within the bounds
+  virtual bool isInBounds(double _r) const 
+  {
+    if (_r > repMaximum)
+      return false;
+    return true;
+  }
+
+  // folds a value into bounds
+  virtual void foldsInBounds(double &  _r) const 
+  {
+    // easy as a pie: symmetry w.r.t. maximum
+    if (_r > repMaximum)	   // nothing to do otherwise
+      _r = 2*repMaximum - _r;
+    return ;
+  }    
+
+  // truncates to the bounds
+  virtual void truncate(double & _r) const 
+  {
+    if (_r > repMaximum)
+      _r = repMaximum;
+    return;
+  }
+
+  // methods from eoPersistent
+  /**
+   * Read object.
+   * @param _is A std::istream.
+   * but reading should not be done here, because of bound problems
+   * see eoIntVectorBounds
+   */
+  virtual void readFrom(std::istream& _is) 
+  {
+    throw std::runtime_error("Should not use eoIntAboveBound::readFrom");
+  }
+
+  /**
+   * Write object. It's called printOn since it prints the object on a stream.
+   * @param _os A std::ostream.
+   */
+  virtual void printOn(std::ostream& _os) const
+  {
+    _os << "[-inf," << repMaximum << "]";
+  }
+
+  /** for memory managements - ugly */
+  virtual eoIntBounds * dup() const 
+  {
+    return new eoIntAboveBound(*this);
+  }
+
+private :
+  long int repMaximum;
+};
+
+//////////////////////// tentative for a general BOUND class that is constructed from a string
+
+/** A class that encapsulate all possible eoIntBounds.
+ *  Mandatory in order to read through the parser
+ */
+class eoGeneralIntBounds : public eoIntBounds
+{
+public:
+  /** Ctor: from a string, chooses the type of bound */
+  eoGeneralIntBounds(std::string _s = "[-infinity,+infinity]")
+  {
+    repBound = getBoundsFromString(_s);
+  }
+
+  /** Need a Cpy Ctor because we are allocating memory */
+  eoGeneralIntBounds(const eoGeneralIntBounds & _b) : eoIntBounds(_b)
+  {
+    // replicate the embedded bound (I'm pretty sure there is another
+    // way to do that !!!
+
+    bool minBounded = _b.isMinBounded();
+    bool maxBounded = _b.isMaxBounded();
+    long int minimum, maximum;
+    const eoIntBounds & bb = _b.theBounds();
+    if (minBounded) minimum = bb.minimum();
+    if (maxBounded) maximum = bb.maximum();
+
+      if (minBounded && maxBounded)
+	repBound = new eoIntInterval(minimum, maximum);
+      else if (!minBounded && !maxBounded)	// no bound at all
+	repBound = new eoIntNoBounds;
+      else if (!minBounded && maxBounded)
+	repBound = new eoIntAboveBound(maximum);
+      else if (minBounded && !maxBounded)
+	repBound = new eoIntBelowBound(minimum);
+  }
+
+  eoGeneralIntBounds& operator=(const eoGeneralIntBounds& _b)
+  {
+    // replicate the embedded bound (I'm pretty sure there is another
+    // way to do that !!!
+
+    bool minBounded = _b.isMinBounded();
+    bool maxBounded = _b.isMaxBounded();
+    long int minimum, maximum;
+    const eoIntBounds & bb = _b.theBounds();
+    if (minBounded) minimum = bb.minimum();
+    if (maxBounded) maximum = bb.maximum();
+
+    // first delete the embedded bounds if necessary
+    if (repBound)
+      delete repBound;
+    // now reallocate
+      if (minBounded && maxBounded)
+	repBound = new eoIntInterval(minimum, maximum);
+      else if (!minBounded && !maxBounded)	// no bound at all
+	repBound = new eoIntNoBounds;
+      else if (!minBounded && maxBounded)
+	repBound = new eoIntAboveBound(maximum);
+      else if (minBounded && !maxBounded)
+	repBound = new eoIntBelowBound(minimum);
+      return (*this);
+  }
+
+
+  /** Need a Dtor because we allocate an actual bound  */
+  ~eoGeneralIntBounds()
+  {
+    delete repBound;
+  }
+
+  ///// and now all methods from the embedded bounds
+  /** Self-Test: true if ***both*** a min and a max
+   */
+  virtual bool isBounded(void)  const {return repBound->isBounded();}
+
+  /** Self-Test: true if no min ***and*** no max
+   *        hence no further need to test/truncate/fold anything
+   */
+  virtual bool hasNoBoundAtAll(void)  const {return repBound->hasNoBoundAtAll();}
+
+  /** Self-Test: bounded from below???
+   */
+  virtual bool isMinBounded(void)  const {return repBound->isMinBounded();}
+
+  /** Self-Test: bounded from above???
+   */
+  virtual bool isMaxBounded(void) const {return repBound->isMaxBounded();}
+
+  /** Test on a value: is it in bounds?
+   */
+  virtual bool isInBounds(double _x)  const {return repBound->isInBounds(_x);}
+
+  /** Put value back into bounds - by folding back and forth
+   */
+  virtual void foldsInBounds(double & _x) const {return repBound->foldsInBounds(_x);}
+
+  /** Put value back into bounds - by truncating to a boundary value
+   */
+  virtual void truncate(double & _x)  const {return repBound->truncate(_x);}
+
+  /** get minimum value 
+   *  @std::exception if does not exist
+   */  
+  virtual long int minimum()  const {return repBound->minimum();}
+  /** get maximum value
+   *  @std::exception if does not exist
+   */  
+  virtual long int maximum() const {return repBound->maximum();}
+  /** get range
+   *  @std::exception if unbounded
+   */  
+  virtual long int range()  const {return repBound->range();}
+
+  /** random generator of uniform doubles in bounds
+   * @std::exception if unbounded
+   */
+  virtual double uniform(eoRng & _rng = eo::rng)  const {return repBound->uniform();}
+
+  /** random generator of uniform ints in bounds
+   * @std::exception if unbounded
+   */
+  virtual long int random(eoRng & _rng = eo::rng)  const {return repBound->random();}
+
+  /** for memory managements - ugly */
+  virtual eoIntBounds * dup() const  {return repBound->dup();}
+
+  /** for efficiency, it's better to use the embedded boud directly */
+  const eoIntBounds & theBounds()  const { return *repBound;} 
+
+  /** don't forget the printOn method - 
+   * again that of the embedded bound
+   */
+  virtual void printOn(std::ostream& _os) const
+  {
+    repBound->printOn(_os);
+  }
+
+  /** no readFrom ??? Have to check that later */
+  virtual void readFrom(std::istream& _is) 
+  {
+    std::string s;
+    _is >> s;
+    if (repBound)
+      delete repBound;
+    repBound = getBoundsFromString(s);
+  }
+
+private:
+  // reading from a string
+  eoIntBounds * getBoundsFromString(std::string);
+
+  eoIntBounds * repBound;
+};
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/utils/eoMOFitnessStat.h b/trunk/paradiseo-eo/src/utils/eoMOFitnessStat.h
new file mode 100644
index 000000000..bb95acbe9
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoMOFitnessStat.h
@@ -0,0 +1,91 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoFitnessStat.h
+// (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000, 2001
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoFitnessStat_h
+#define _eoFitnessStat_h
+
+#include 
+
+/**
+    The fitnesses of a whole population, as a vector
+*/
+template 
+class eoFitnessStat : public eoSortedStat >
+{
+public :
+
+    using eoSortedStat >::value;
+
+    eoFitnessStat(std::string _description = "AllFitnesses") :
+      eoSortedStat >(std::vector(0), _description) {}
+
+    virtual void operator()(const std::vector& _popPters)
+    {
+      value().resize(_popPters.size());
+      for (unsigned i=0; i<_popPters.size(); i++)
+        value()[i] = _popPters[i]->fitness();
+    }
+};
+
+
+/** For multi-objective fitness, we need to translate a stat >
+    into a vector, so each objective gets a seperate stat
+*/
+#ifdef _MSC_VER
+// The follownig is needed to avoid some bug in Visual Studio 6.0
+typedef double PartFitDefault;
+template 
+class eoMOFitnessStat : public eoSortedStat >
+#else
+template 
+class eoMOFitnessStat : public eoSortedStat >
+#endif
+
+{
+public:
+
+    using eoSortedStat >::value;
+
+  /** Ctor: say what component you want
+   */
+  eoMOFitnessStat(unsigned _objective, std::string _description = "MO-Fitness") :
+    eoSortedStat >(std::vector(0), _description),
+    objective(_objective) {}
+
+    virtual void operator()(const std::vector& _popPters)
+    {
+      value().resize(_popPters.size());
+
+      for (unsigned i=0; i<_popPters.size(); i++)
+      {
+        value()[i] = _popPters[i]->fitness()[objective];
+      }
+    }
+private:
+  unsigned int objective;		   // The objective we're storing
+
+};
+#endif
diff --git a/trunk/paradiseo-eo/src/utils/eoMonitor.h b/trunk/paradiseo-eo/src/utils/eoMonitor.h
new file mode 100644
index 000000000..e7191f63c
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoMonitor.h
@@ -0,0 +1,65 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoMonitor.h
+// (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+CVS Info: $Date: 2004/06/15 07:09:57 $ $Header: /cvsroot/eodev/eo/src/utils/eoMonitor.h,v 1.11 2004/06/15 07:09:57 evomarc Exp $ $Author: evomarc $ 
+
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoMonitor_h
+#define _eoMonitor_h
+
+
+#include 
+
+#include 
+
+class eoParam;
+
+/**
+    The abstract monitor class is a std::vector of parameter pointers. Use
+    either push_back a pointer or add a reference to a parameter.
+    Derived classes will then implement the operator()(void) which
+    will stream or pipe the current values of the parameters to wherever you
+    want it streamed or piped to.
+*/
+class eoMonitor : public eoF
+{
+public :
+
+  virtual void lastCall() {}
+
+  /**
+    Adds a parameter to the monitor. It is virtual so you can do some type checking
+    in derived classes if you must.
+  */
+  virtual void add(const eoParam& _param) { vec.push_back(&_param); }
+
+  virtual std::string className(void) const { return "eoMonitor"; }
+
+protected :
+    typedef std::vector::iterator iterator;
+    std::vector vec;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/utils/eoParam.h b/trunk/paradiseo-eo/src/utils/eoParam.h
new file mode 100644
index 000000000..5bf1dd0a4
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoParam.h
@@ -0,0 +1,441 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoParam.h
+// (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000
+/*
+  This library is free software; you can redistribute it and/or
+  modify it under the terms of the GNU Lesser General Public
+  License as published by the Free Software Foundation; either
+  version 2 of the License, or (at your option) any later version.
+
+  This library is distributed in the hope that it will be useful,
+  but WITHOUT ANY WARRANTY; without even the implied warranty of
+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+  Lesser General Public License for more details.
+
+  You should have received a copy of the GNU Lesser General Public
+  License along with this library; if not, write to the Free Software
+  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+  Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+  Marc.Schoenauer@polytechnique.fr
+  mkeijzer@dhi.dk
+*/
+//-----------------------------------------------------------------------------
+
+#ifndef eoParam_h
+#define eoParam_h
+
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+
+
+/**
+   eoParam: Base class for monitoring and parsing parameters
+*/
+class eoParam
+{
+public:
+
+    /** Empty constructor - called from outside any parser */
+    eoParam ()
+        : repLongName(""), repDefault(""), repDescription(""),
+          repShortHand(0), repRequired(false)
+        {}
+
+    /** Construct a Param.
+     *
+     * @param _longName      Long name of the argument
+     * @param _default       The default value
+     * @param _description   Description of the parameter. What is useful for.
+     * @param _shortName     Short name of the argument (Optional)
+     * @param _required      If it is a necessary parameter or not
+     */
+    eoParam (std::string _longName, std::string _default,
+             std::string _description, char _shortName = 0, bool _required = false)
+        : repLongName(_longName), repDefault(_default),
+          repDescription(_description ),
+          repShortHand(_shortName), repRequired( _required)
+        {}
+
+    /**
+     * Virtual destructor is needed.
+     */
+    virtual ~eoParam () {};
+
+    /**
+     * Pure virtual function to get the value out.
+     */
+    virtual std::string getValue () const = 0;
+
+    /**
+     * Pure virtual function to set the value
+     */
+    virtual void setValue(const std::string& _value)   = 0 ;
+
+    /**
+     * Returns the short name.
+     */
+    char shortName() const { return repShortHand; };
+
+    /**
+     * Returns the long name.
+     */
+    const std::string& longName() const { return repLongName; };
+
+    /**
+     * Returns the description of the argument
+     */
+    const std::string& description() const { return repDescription; };
+
+    /**
+     * Returns the default value of the argument
+     */
+    const std::string& defValue() const { return repDefault; };
+
+    /**
+     * Sets the default value of the argument,
+     */
+    void defValue( const std::string& str ) { repDefault = str; };
+
+    /**
+     * ALlows to change the name (see the prefix in eoParser.h)
+     */
+    void setLongName(std::string _longName) { repLongName = _longName;}
+
+    /**
+     * Returns if required or not.
+     */
+    bool required() const { return repRequired; };
+
+private:
+    std::string repLongName;
+    std::string repDefault;
+    std::string repDescription;
+    char repShortHand;
+    bool repRequired;
+};
+
+
+
+/**
+   eoValueParam: templatized derivation of eoParam. Can be used to contain
+   any scalar value type. It makes use of std::strstream to get and set values. This
+   should be changed to std::stringstream when that class is available in g++.
+
+   Note also that there is a template specialization for std::pair and
+   for std::vector. These stream their contents delimited with whitespace.
+*/
+template 
+class eoValueParam : public eoParam
+{
+public :
+
+    /** Construct a Param. */
+    eoValueParam(void) : eoParam() {}
+
+    /** Construct a Param.
+     *
+     * @param _defaultValue       The default value
+     * @param _longName           Long name of the argument
+     * @param _description        Description of the parameter. What is useful for.
+     * @param _shortName          Short name of the argument (Optional)
+     * @param _required           If it is a necessary parameter or not
+     */
+    eoValueParam(ValueType _defaultValue,
+                 std::string _longName,
+                 std::string _description = "No description",
+                 char _shortHand = 0,
+                 bool _required = false)
+        : eoParam(_longName, "", _description, _shortHand, _required),
+          repValue(_defaultValue)
+        {
+            eoParam::defValue(getValue());
+        }
+
+    /** Parameter value
+
+    @return parameter value
+    */
+    ValueType& value()
+        { return repValue; }
+
+    /** Parameter value
+
+    @overload
+
+    @return parameter value
+    */
+    const ValueType& value() const
+        { return repValue; }
+
+
+    std::string getValue(void) const
+        {
+            std::ostringstream os;
+            os << repValue;
+            return os.str();
+        }
+
+
+    void setValue(const std::string& _value)
+        {
+            std::istringstream is(_value);
+            is >> repValue;
+        }
+
+protected:
+
+    ValueType repValue;
+};
+
+/*
+  Specialization for std::string
+*/
+template <>
+inline std::string eoValueParam::getValue() const
+{
+    return repValue;
+}
+
+
+template <>
+inline void eoValueParam::setValue(const std::string& _value)
+{
+    if (_value.empty())
+    {
+        repValue = true;
+        return;
+    }
+    std::istringstream is(_value);
+    is >> repValue;
+}
+
+
+/// Because MSVC does not support partial specialization, the std::pair is a double, not a T
+template <>
+inline std::string eoValueParam >::getValue(void) const
+{
+    // use own buffer as MSVC's buffer leaks!
+    std::ostringstream os;
+    os << repValue.first << ' ' << repValue.second;
+    return os.str();
+}
+
+/// Because MSVC does not support partial specialization, the std::pair is a double, not a T
+template <>
+inline void eoValueParam >::setValue(const std::string& _value)
+{
+    std::istringstream is(_value);
+    is >> repValue.first;
+    is >> repValue.second;
+}
+
+// The std::vector >
+//////////////////////////////////
+/// Because MSVC does not support partial specialization, the std::vector is a std::vector of doubles, not a T
+template <>
+inline std::string eoValueParam > >::getValue(void) const
+{
+    std::ostringstream os;
+    os << repValue.size() << ' ';
+    for (unsigned i = 0; i < repValue.size(); ++i)
+    {
+        os << repValue[i].size() << ' ';
+        std::copy(repValue[i].begin(), repValue[i].end(), std::ostream_iterator(os, " "));
+    }
+    return os.str();
+}
+
+/// Because MSVC does not support partial specialization, the std::vector is a std::vector of doubles, not a T
+template <>
+inline void eoValueParam > >::setValue(const std::string& _value)
+{
+    std::istringstream is(_value);
+    unsigned i,j,sz;
+    is >> sz;
+    repValue.resize(sz);
+
+    for (i = 0; i < repValue.size(); ++i)
+    {
+        unsigned sz2;
+        is >> sz2;
+        repValue[i].resize(sz2);
+        for (j = 0; j < sz2; ++j)
+        {
+            is >> repValue[i][j];
+        }
+    }
+}
+
+// The std::vector
+//////////////////////////////////
+/// Because MSVC does not support partial specialization, the std::vector is a double, not a T
+template <>
+inline std::string eoValueParam >::getValue(void) const
+{
+    std::ostringstream os;
+    os << repValue.size() << ' ';
+    std::copy(repValue.begin(), repValue.end(), std::ostream_iterator(os, " "));
+    return os.str();
+}
+
+/// Because MSVC does not support partial specialization, the std::vector is a double, not a T
+template <>
+inline void eoValueParam >::setValue(const std::string& _value)
+{
+    std::istringstream is(_value);
+    unsigned sz;
+    is >> sz;
+    repValue.resize(sz);
+    std::copy(std::istream_iterator(is), std::istream_iterator(), repValue.begin());
+}
+
+// The std::vector
+//////////////////////////////////
+/// Because MSVC does not support partial specialization, the std::vector is a eoMinimizingFitness, not a T
+template <>
+inline std::string eoValueParam >::getValue(void) const
+{
+    std::ostringstream os;
+    os << repValue.size() << ' ';
+    std::copy(repValue.begin(), repValue.end(), std::ostream_iterator(os, " "));
+    return os.str();
+}
+
+/// Because MSVC does not support partial specialization, the std::vector is a eoMinimizingFitness, not a T
+// NOTE: g++ doesn support it either!!!
+template <>
+inline void eoValueParam >::setValue(const std::string& _value)
+{
+    std::istringstream is(_value);
+    unsigned sz;
+    is >> sz;
+    repValue.resize(sz);
+    std::copy(std::istream_iterator(is), std::istream_iterator(), repValue.begin());
+}
+
+// The std::vector
+//////////////////////////////////
+template <>
+inline std::string eoValueParam >::getValue(void) const
+{
+    throw std::runtime_error("I cannot getValue for a std::vector");
+    return std::string("");
+}
+
+template <>
+inline void eoValueParam >::setValue(const std::string&)
+{
+    throw std::runtime_error("I cannot setValue for a std::vector");
+    return;
+}
+
+/*template 
+  class eoContainerParam : public eoParam
+  {
+  public :
+  eoContainerParam (ContainerType& value, std::string _shortName, std::string _longName,
+  std::string _default,
+  std::string _description,
+  bool _required,
+  bool _change )
+  : value(_value), eoParam(_shortName, _longName, _description, _default, _required, _change)
+  {}
+
+
+  //  void setValue(const std::string & _value)
+  // {
+  //     std::istd::stringstream is(_value);
+  //    copy(std::istream_iterator(is), std::istream_iterator(), back_inserter(value));
+  // }
+
+  private :
+  ContainerType& value;
+  };*/
+
+/**
+ * Another helper class for parsing parameters like
+ * Keyword(arg1, arg2, ...)
+ *
+ * It is basically a std::pair >
+ *       first std::string is keyword
+ *       the std::vector contains all arguments (as std::strings)
+ * See make_algo.h
+ */
+
+class eoParamParamType : public std::pair >
+{
+public:
+    eoParamParamType(std::string _value)
+        {
+            readFrom(_value);
+        }
+
+    std::ostream & printOn(std::ostream & _os) const
+        {
+            _os << first;
+            unsigned narg = second.size();
+            if (!narg)
+                return _os;
+
+            // Here, we do have args
+            _os << "(";
+            if (narg == 1)	   // 1 arg only
+            {
+                _os << second[0] << ")" ;
+                return _os;
+            }
+            // and here more than 1 arg
+            for (unsigned i=0; i> value;
+            readFrom(value);
+            return _is;
+        }
+
+    void readFrom(std::string &  _value)
+        {
+            second.resize(0);		   // just in case
+            size_t pos = _value.find('(');
+            if (pos >= _value.size())	   // no arguments
+            {
+                first = _value;
+                return;
+            }
+            // so here we do have arguments
+            std::string t = _value.substr(pos+1);// the arguments
+            _value.resize(pos);
+            first = _value;    // done for the keyword (NOTE: may be empty std::string!)
+
+            // now all arguments
+            std::string delim(" (),");
+            while ( (pos=t.find_first_not_of(delim)) < t.size())
+            {
+                size_t posEnd = t.find_first_of(delim, pos);
+                std::string u = t.substr(pos,posEnd);//(t, pos);
+                /*u.resize(posEnd - pos);*/
+                second.push_back(u);
+                t = t.substr(posEnd+1);
+            }
+        }
+};
+
+// at the moment, the following are defined in eoParser.cpp
+std::ostream & operator<<(std::ostream & _os, const eoParamParamType & _rate);
+std::istream & operator>>(std::istream & _is,  eoParamParamType & _rate);
+
+#endif
diff --git a/trunk/paradiseo-eo/src/utils/eoParser.cpp b/trunk/paradiseo-eo/src/utils/eoParser.cpp
new file mode 100644
index 000000000..ccf9dd611
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoParser.cpp
@@ -0,0 +1,413 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoParser.cpp
+// (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@inria.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifdef _MSC_VER
+#pragma warning(disable:4786)
+#endif
+
+#include 
+#include 
+#include 
+#include 
+
+#include 
+
+#include 
+
+using namespace std;
+
+void eoWarning(std::string str)
+{
+    cout << str << '\n';
+}
+
+std::ostream& printSectionHeader(std::ostream& os, std::string section)
+{
+    if (section == "")
+        section = "General";
+
+    os << '\n' << setw(10) << "######    " << setw(20) << section << setw(10) << "    ######\n";
+    return os;
+}
+
+eoParameterLoader::~eoParameterLoader()
+{
+    for (unsigned i = 0; i < ownedParams.size(); ++i)
+    {
+        delete ownedParams[i];
+    }
+}
+
+
+eoParser::eoParser ( unsigned _argc, char **_argv , string _programDescription,
+                     string _lFileParamName, char _shortHand) :
+    programName(_argv[0]),
+    programDescription( _programDescription),
+    needHelp(false, "help", "Prints this message", 'h'),
+    stopOnUnknownParam(true, "stopOnUnknownParam", "Stop if unkown param entered", '\0')
+{
+    // need to process the param file first
+    // if we want command-line to have highest priority
+    unsigned i;
+    for (i = 1; i < _argc; ++i)
+    {
+	if(_argv[i][0] == '@')
+        { // read response file
+	    char *pts = _argv[i]+1; // yes a char*, sorry :-)
+	    ifstream ifs (pts);
+	    ifs.peek(); // check if it exists
+	    if (!ifs)
+            {
+		string msg = string("Could not open response file: ") + pts;
+		throw runtime_error(msg);
+            }
+	    // read  - will be overwritten by command-line
+	    readFrom(ifs);
+	    break; // stop reading command line args for '@'
+        }
+    }
+    // now read arguments on command-line
+    stringstream stream;
+    for (i = 1; i < _argc; ++i)
+    {
+        stream << _argv[i] << '\n';
+    }
+    readFrom(stream);
+    processParam(needHelp);
+    processParam(stopOnUnknownParam);
+}
+
+
+
+eoParam * eoParser::getParamWithLongName(const std::string& _name) const
+{
+    typedef std::multimap MultiMapType;
+    typedef MultiMapType::const_iterator iter;
+    std::string search(prefix+_name);
+    for(iter p = params.begin(); p != params.end(); ++p)
+        if(p->second->longName() == search)
+            return p->second;
+    return 0;
+}
+
+
+
+void eoParser::processParam(eoParam& param, std::string section)
+{
+    // this param enters the parser: add the prefix to the long name
+    if (prefix != "")
+    {
+	param.setLongName(prefix+param.longName());
+	section = prefix + section;  // and to section
+    }
+    doRegisterParam(param); // plainly register it
+    params.insert(make_pair(section, ¶m));
+}
+
+void eoParser::doRegisterParam(eoParam& param) const
+{
+    if (param.required() && !isItThere(param))
+    {
+        string msg = "Required parameter: " + param.longName() + " missing";
+        messages.push_back(msg);
+    }
+    pair value = getValue(param);
+    if (value.first)
+    {
+        param.setValue(value.second);
+    }
+}
+
+pair eoParser::getValue(eoParam& _param) const
+{
+    pair result(false, "");
+
+    if (_param.shortName() != 0)
+    {
+        map::const_iterator it = shortNameMap.find(_param.shortName());
+        if (it != shortNameMap.end())
+        {
+            result.second = it->second;
+            result.first = true;
+            return result;
+        }
+    }
+    map::const_iterator it = longNameMap.find(_param.longName());
+    if (it != longNameMap.end())
+    {
+        result.second = it->second;
+        result.first = true;
+        return result;
+    }
+    // else (TODO: check environment, just long names)
+    return result;
+}
+
+void eoParser::updateParameters() const
+{
+ typedef MultiMapType::const_iterator It;
+
+  for (It p = params.begin(); p != params.end(); ++p)
+  {
+        doRegisterParam(*p->second);
+  }
+}
+
+void eoParser::readFrom(istream& is)
+{
+    string str;
+    // we must avoid processing \section{xxx} if xxx is NOT "Parser"
+    bool processing = true;
+    while (is >> str)
+    {
+        if (str.find(string("\\section{"))==0) // found section begin
+            processing = (str.find(string("Parser"))= 3)
+                                value = string(str.begin() + 3, str.end());
+			}
+                        else
+			{
+                            value = string(str.begin() + 2, str.end());
+			}
+		    }
+
+                    shortNameMap[str[1]] = value;
+		}
+	    }
+	}
+    }
+
+    updateParameters();
+}
+
+void eoParser::printOn(ostream& os) const
+{
+    typedef MultiMapType::const_iterator It;
+
+    It p = params.begin();
+
+    std::string section = p->first;
+
+    printSectionHeader(os, section);
+    //print every param with its value
+    for (; p != params.end(); ++p)
+      {
+        std::string newSection = p->first;
+
+        if (newSection != section)
+        {
+            section = newSection;
+            printSectionHeader(os, section);
+        }
+
+        eoParam* param = p->second;
+
+	if (!isItThere(*param))  // comment out the ones not set by the user
+	  os << "# ";
+
+        string str = "--" + param->longName() + "=" + param->getValue();
+
+        os.setf(ios_base::left, ios_base::adjustfield);
+        os << setw(40) << str;
+
+        os << setw(0) << " # ";
+        if (param->shortName())
+            os << '-' << param->shortName() << " : ";
+        os << param->description();
+
+        if (param->required())
+        {
+            os << " REQUIRED ";
+        }
+
+        os  << '\n';
+    }
+}
+
+void eoParser::printHelp(ostream& os)
+{
+    if (needHelp.value() == false && !messages.empty())
+    {
+        std::copy(messages.begin(), messages.end(), ostream_iterator(os, "\n"));
+        messages.clear();
+        return;
+    }
+
+    // print program name and description
+    os << this->programName <<": "<< programDescription << "\n\n";
+
+    // print the usage when calling the program from the command line
+    os << "Usage: "<< programName<<" [Options]\n";
+    // only short usage!
+    os << "Options of the form \"-f[=Value]\" or \"--Name[=value]\"" << endl;
+
+    os << "Where:"<first;
+
+    printSectionHeader(os, section);
+
+    //print every param with its value
+    for (; p != params.end(); ++p)
+    {
+        std::string newSection = p->first;
+
+        if (newSection != section)
+        {
+            section = newSection;
+            printSectionHeader(os, section);
+        }
+
+        if (p->second->shortName())
+	        os << "-" << p->second->shortName() << ", ";
+
+        os << "--" <second->longName() <<":\t"
+	     << p->second->description() ;
+
+	  os << "\n" << setw(20) << ( (p->second->required())?"Required":"Optional" );
+      os <<". By default: "<second->defValue() << '\n';
+    } // for p
+
+    os << "\n@param_file \t defines a file where the parameters are stored\n";
+    os << '\n';
+
+}
+
+bool eoParser::userNeedsHelp(void)
+{
+  /*
+     check whether there are long or short names entered
+     without a corresponding parameter
+  */
+  // first, check if we want to check that !
+  if (stopOnUnknownParam.value())
+    {
+      for (LongNameMapType::const_iterator lIt = longNameMap.begin(); lIt != longNameMap.end(); ++lIt)
+	{
+	  string entry = lIt->first;
+
+	  MultiMapType::const_iterator it;
+
+	  for (it = params.begin(); it != params.end(); ++it)
+	    {
+	      if (entry == it->second->longName())
+		{
+		  break;
+		}
+	    }
+
+	  if (it == params.end())
+	    {
+	      string msg = "Unknown parameter: --" + entry + " entered, type -h or --help to see available parameters";
+	      messages.push_back(msg);
+	    }
+	}
+
+      for (ShortNameMapType::const_iterator sIt = shortNameMap.begin(); sIt != shortNameMap.end(); ++sIt)
+	{
+	  char entry = sIt->first;
+
+	  MultiMapType::const_iterator it;
+
+	  for (it = params.begin(); it != params.end(); ++it)
+	    {
+	      if (entry == it->second->shortName())
+		{
+		  break;
+		}
+	    }
+
+	  if (it == params.end())
+	    {
+	      string entryString(1, entry);
+	      string msg = "Unknown parameter: -" + entryString + " entered, type -h or --help to see available parameters";
+	      messages.push_back(msg);
+	    }
+	}
+    }
+  return needHelp.value() || !messages.empty();
+}
+
+///////////////// I put these here at the moment
+ostream & operator<<(ostream & _os, const eoParamParamType & _rate)
+{
+  _rate.printOn(_os);
+  return _os;
+}
+
+istream & operator>>(istream & _is,  eoParamParamType & _rate)
+{
+  _rate.readFrom(_is);
+  return _is;
+}
+
diff --git a/trunk/paradiseo-eo/src/utils/eoParser.h b/trunk/paradiseo-eo/src/utils/eoParser.h
new file mode 100644
index 000000000..1f69f3100
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoParser.h
@@ -0,0 +1,287 @@
+/* (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000
+
+This library is free software; you can redistribute it and/or modify it under
+the terms of the GNU Lesser General Public License as published by the Free
+Software Foundation; either version 2 of the License, or (at your option) any
+later version.
+
+This library is distributed in the hope that it will be useful, but WITHOUT ANY
+WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
+
+You should have received a copy of the GNU Lesser General Public License along
+with this library; if not, write to the Free Software Foundation, Inc., 59
+Temple Place, Suite 330, Boston, MA 02111-1307 USA
+
+Contact: http://eodev.sourceforge.net
+         todos@geneura.ugr.es, http://geneura.ugr.es
+         Marc.Schoenauer@polytechnique.fr
+         mkeijzer@dhi.dk
+*/
+
+
+#ifndef EO_PARSER_H
+#define EO_PARSER_H
+
+#include 
+#include 
+#include 
+
+#include "eoParam.h"
+#include "eoObject.h"
+#include "eoPersistent.h"
+
+/** Parameter saving and loading
+
+eoParameterLoader is an abstract class that can be used as a base for your own
+parameter loading and saving. The command line parser eoParser is derived from
+this class.
+*/
+class eoParameterLoader
+{
+public :
+
+    /** Need a virtual destructor */
+    virtual ~eoParameterLoader();
+
+    /** Register a parameter and set its value if it is known
+
+    @param param      the parameter to process
+    @param section    the section where this parameter belongs
+    */
+    virtual void processParam(eoParam& param, std::string section = "") = 0;
+
+    /**
+     * checks if _param has been actually entered
+     */
+    virtual bool isItThere(eoParam& _param) const = 0;
+
+    /**
+     * Construct a Param and sets its value. The loader will own the memory thus created
+     *
+     * @param _defaultValue       The default value
+     * @param _longName           Long name of the argument
+     * @param _description        Description of the parameter. What is useful for.
+     * @param _shortName          Short name of the argument (Optional)
+     * @param _section            Name of the section where the parameter belongs
+     * @param _required           If it is a necessary parameter or not
+     */
+    template 
+    eoValueParam& createParam(ValueType _defaultValue,
+                                         std::string _longName,
+                                         std::string _description,
+                                         char _shortHand = 0,
+                                         std::string _section = "",
+                                         bool _required = false)
+        {
+            eoValueParam* p = new eoValueParam(_defaultValue,
+                                                                     _longName,
+                                                                     _description,
+                                                                     _shortHand,
+                                                                     _required);
+            ownedParams.push_back(p);
+            processParam(*p, _section);
+            return *p;
+        }
+
+
+private :
+
+    std::vector ownedParams;
+};
+
+
+
+/**
+    eoParser: command line parser and configuration file reader
+    This class is persistent, so it can be stored and reloaded to restore
+    parameter settings.
+*/
+class eoParser : public eoParameterLoader, public eoObject, public eoPersistent
+{
+
+public:
+
+  /**
+   * Constructor
+   * a complete constructor that reads the command line an optionally reads
+   * a configuration file.
+
+   *
+   * myEo --param-file=param.rc     will then load using the parameter file param.rc
+   *
+   * @param _argc                   command line arguments count
+   * @param _argv                   command line parameters
+   * @param  _programDescription    Description of the work the program does
+   * @param _lFileParamName         Name of the parameter specifying the configuration file (--param-file)
+   * @param _shortHand              Single charachter shorthand for specifying the configuration file
+   */
+  eoParser ( unsigned _argc, char **_argv , std::string _programDescription = "",
+	   std::string _lFileParamName = "param-file", char _shortHand = 'p');
+
+  /**
+    Processes the parameter and puts it in the appropriate section for readability
+  */
+  void processParam(eoParam& param, std::string section = "");
+
+  void readFrom(std::istream& is);
+
+  void printOn(std::ostream& os) const;
+
+  /// className for readibility
+  std::string className(void) const { return "Parser"; }
+
+  /// true if the user made an error or asked for help
+  bool userNeedsHelp(void);
+  /**
+   * Prints an automatic help in the specified output using the information
+   * provided by parameters
+   */
+  void printHelp(std::ostream& os);
+
+  std::string ProgramName() { return programName; }
+
+    /** Has param been entered by user?
+
+    Checks if _param has been actually entered by the user
+    */
+    virtual bool isItThere(eoParam& _param) const
+        { return getValue(_param).first; }
+
+    /**
+     * get a handle on a param from its longName
+     *
+     * if not found, returns 0 (null pointer :-)
+     *
+     * Not very clean (requires hard-coding of the long name twice!)
+     * but very useful in many occasions...
+     */
+    eoParam * getParamWithLongName(const std::string& _name) const;
+
+
+
+    /** Get or create parameter
+
+    It seems finally that the easiest use of the above method is
+    through the following, whose interface is similar to that of the
+    widely-used createParam.
+
+    For some (probably very stupid) reason, I failed to put it in the
+    .cpp. Any hint???
+    */
+    template 
+    eoValueParam& getORcreateParam(ValueType _defaultValue,
+                                              std::string _longName,
+                                              std::string _description,
+                                              char _shortHand = 0,
+                                              std::string _section = "",
+                                              bool _required = false)
+        {
+            eoParam* ptParam = getParamWithLongName(_longName);
+            if (ptParam) {
+                // found
+                eoValueParam* ptTypedParam =
+                    dynamic_cast*>(ptParam);
+                return *ptTypedParam;
+            }
+            // not found -> create it
+            return createParam (_defaultValue, _longName, _description,
+                                _shortHand, _section, _required);
+        }
+
+
+
+    /** Set parameter value or create parameter
+
+    This makes sure that the specified parameter has the given value.
+    If the parameter does not exist yet, it is created.
+
+    This requires that operator<< is defined for ValueType.
+
+
+    @param _defaultValue Default value.
+    @param _longName     Long name of the argument.
+    @param _description  Description of the parameter.
+    @param _shortName    Short name of the argument (Optional)
+    @param _section      Name of the section where the parameter belongs.
+    @param _required     Is the parameter mandatory?
+    @return Corresponding parameter.
+    */
+    template 
+    eoValueParam& setORcreateParam(ValueType _defaultValue,
+                                              std::string _longName,
+                                              std::string _description,
+                                              char _shortHand = 0,
+                                              std::string _section = "",
+                                              bool _required = false)
+        {
+            eoValueParam& param = createParam(_defaultValue, _longName, _description,
+                                                         _shortHand, _section, _required);
+            std::ostringstream os;
+            os << _defaultValue;
+            if(isItThere(param)) {
+                param.setValue(os.str());
+            } else {
+                longNameMap[_longName] = os.str();
+                shortNameMap[_shortHand] = os.str();
+            }
+            return param;
+        }
+
+
+
+    /** accessors to the stopOnUnknownParam value */
+    void setStopOnUnknownParam(bool _b) {stopOnUnknownParam.value()=_b;}
+    bool getStopOnUnknownParam() {return stopOnUnknownParam.value();}
+
+    /** Prefix handling */
+    void setPrefix(const std:: string & _prefix) {prefix = _prefix;}
+
+  void resetPrefix() {prefix = "";}
+
+  std::string getPrefix() {return prefix;}
+
+private:
+
+  void doRegisterParam(eoParam& param) const;
+
+  std::pair getValue(eoParam& _param) const;
+
+  void updateParameters() const;
+
+  typedef std::multimap MultiMapType;
+
+  // used to store all parameters that are processed
+  MultiMapType params;
+
+  std::string programName;
+  std::string programDescription;
+
+  typedef std::map ShortNameMapType;
+  ShortNameMapType shortNameMap;
+
+  typedef std::map LongNameMapType;
+  LongNameMapType longNameMap;
+
+  eoValueParam   needHelp;
+  eoValueParam   stopOnUnknownParam;
+
+  mutable std::vector messages;
+
+  std::string prefix;   // used for all created params - in processParam
+
+};
+
+
+
+#endif //  EO_PARSER_H
+
+
+
+// Local Variables:
+// coding: iso-8859-1
+// mode:C++
+// c-file-style: "Stroustrup"
+// comment-column: 35
+// fill-column: 80
+// End:
diff --git a/trunk/paradiseo-eo/src/utils/eoPopStat.h b/trunk/paradiseo-eo/src/utils/eoPopStat.h
new file mode 100644
index 000000000..65bdf44e6
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoPopStat.h
@@ -0,0 +1,133 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoPopStat.h
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+/** WARNING: this file contains 2 classes:
+
+eoPopString and eoSortedPopString
+
+that transform the population into a std::string
+that can be used to dump to the screen
+*/
+
+#ifndef _eoPopStat_h
+#define _eoPopStat_h
+
+#include 
+
+
+/** Thanks to MS/VC++, eoParam mechanism is unable to handle std::vectors of stats.
+This snippet is a workaround:
+This class will "print" a whole population into a std::string - that you can later
+send to any stream
+This is the plain version - see eoPopString for the Sorted version
+
+Note: this Stat should probably be used only within eoStdOutMonitor, and not
+inside an eoFileMonitor, as the eoState construct will work much better there.
+*/
+template 
+class eoPopStat : public eoStat
+{
+public:
+
+    using eoStat::value;
+
+  /** default Ctor, void std::string by default, as it appears
+      on the description line once at beginning of evolution. and
+      is meaningless there. _howMany defaults to 0, that is, the whole
+	  population*/
+   eoPopStat(unsigned _howMany = 0, std::string _desc ="")
+	 : eoStat("", _desc), combien( _howMany) {}
+
+/** Fills the value() of the eoParam with the dump of the population.
+Adds a \n before so it does not get mixed up with the rest of the stats
+that are written by the monitor it is probably used from.
+*/
+void operator()(const eoPop& _pop)
+{
+  value() = "\n# ====== pop dump =====\n";
+  unsigned howmany=combien?combien:_pop.size();
+  for (unsigned i = 0; i < howmany; ++i)
+  {
+      std::ostringstream os;
+      os << _pop[i] << std::endl;
+
+      // paranoid:
+      value() += os.str();
+  }
+}
+
+private:
+  unsigned combien;
+};
+
+/** Thanks to MS/VC++, eoParam mechanism is unable to handle std::vectors of stats.
+This snippet is a workaround:
+This class will "print" a whole population into a std::string - that you can later
+send to any stream
+This is the Sorted version - see eoPopString for the plain version
+
+Note: this Stat should probably be used only within eoStdOutMonitor, and not
+inside an eoFileMonitor, as the eoState construct will work much better there.
+*/
+template 
+class eoSortedPopStat : public eoSortedStat
+{
+public:
+
+    using eoSortedStat::value;
+
+    /** default Ctor, void std::string by default, as it appears on
+        the description line once at beginning of evolution. and is
+        meaningless there _howMany defaults to 0, that is, the whole
+        population
+    */
+    eoSortedPopStat(unsigned _howMany = 0, std::string _desc ="")
+        : eoSortedStat("", _desc) , combien( _howMany)
+        {}
+
+    /** Fills the value() of the eoParam with the dump of the
+        population. Adds a \n before so it does not get mixed up with
+        the rest of the stats that are written by the monitor it is
+        probably used from.
+    */
+    void operator()(const std::vector& _pop)
+        {
+    value() = "";		   // empty
+    unsigned howMany=combien?combien:_pop.size();
+    for (unsigned i = 0; i < howMany; ++i)
+      {
+	std::ostringstream os;
+	os << *_pop[i] << std::endl;
+
+	// paranoid:
+	value() += os.str();
+      }
+  }
+private:
+  unsigned combien;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/utils/eoRNG.cpp b/trunk/paradiseo-eo/src/utils/eoRNG.cpp
new file mode 100644
index 000000000..17159bfca
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoRNG.cpp
@@ -0,0 +1,14 @@
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif
+
+#include 
+#include "eoRNG.h"
+
+namespace eo
+{
+    /// The Global random number generator.
+    eoRng rng(time(0));
+}
+
diff --git a/trunk/paradiseo-eo/src/utils/eoRNG.h b/trunk/paradiseo-eo/src/utils/eoRNG.h
new file mode 100644
index 000000000..ae5797c16
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoRNG.h
@@ -0,0 +1,533 @@
+/** Random number generator adapted from (see comments below)
+
+The random number generator is modified into a class
+by Maarten Keijzer (mak@dhi.dk). Also added the Box-Muller
+transformation to generate normal deviates.
+
+This library is free software; you can redistribute it and/or
+modify it under the terms of the GNU Lesser General Public
+License as published by the Free Software Foundation; either
+version 2 of the License, or (at your option) any later version.
+
+This library is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+Lesser General Public License for more details.
+
+You should have received a copy of the GNU Lesser General Public
+License along with this library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+*/
+
+#ifndef EO_RANDOM_NUMBER_GENERATOR
+#define EO_RANDOM_NUMBER_GENERATOR
+
+// uint32_t is an unsigned integer type capable of holding 32 bits.
+//
+// In the applicatione here exactly 32 but should typically be fastest, but 64
+// might be better on an Alpha with GCC at -O3 optimization so try your options
+// and see what's best for you.
+//
+// The C99-standard defines uint32_t to be declared in stdint.h, but some
+// systmes don't have that and implement it in inttypes.h.
+#if (! defined __sun)
+#include 
+#else
+#include 
+#endif
+
+#include 
+#include "eoPersistent.h"
+#include "eoObject.h"
+
+/** Random Number Generator
+
+@class eoRng eoRNG.h utils/eoRNG.h
+
+eoRng is a persistent class that uses the ``Mersenne Twister'' random
+number generator MT19937 for generating random numbers. The various
+member functions implement useful functions for evolutionary
+algorithms. Included are: rand(), random(), flip() and normal().
+
+EO provides a global random number generator rng that is seeded by the
+current UNIX time at program start. Moreover some global convenience functions
+are provided that use the global random number generator: random,
+normal.
+
+@warning If you want to repeatedly generated the same sequence of pseudo-random
+numbers, you should always reseed the generator at the beginning of your code.
+
+
+
+
    Documentation in original file
    
+
+This is the ``Mersenne Twister'' random number generator MT19937, which
+generates pseudorandom integers uniformly distributed in 0..(2^32 - 1) starting
+from any odd seed in 0..(2^32 - 1). This version is a recode by Shawn Cokus
+(Cokus@math.washington.edu) on March 8, 1998 of a version by Takuji Nishimura
+(who had suggestions from Topher Cooper and Marc Rieffel in July-August 1997).
+
+Effectiveness of the recoding (on Goedel2.math.washington.edu, a DEC Alpha
+running OSF/1) using GCC -O3 as a compiler: before recoding: 51.6 sec. to
+generate 300 million random numbers; after recoding: 24.0 sec. for the same
+(i.e., 46.5% of original time), so speed is now about 12.5 million random number
+generations per second on this machine.
+
+According to the URL  (and
+paraphrasing a bit in places), the Mersenne Twister is ``designed with
+consideration of the flaws of various existing generators,'' has a period of
+2^19937 - 1, gives a sequence that is 623-dimensionally equidistributed, and
+``has passed many std::stringent tests, including the die-hard test of G.
+Marsaglia and the load test of P. Hellekalek and S. Wegenkittl.'' It is
+efficient in memory usage (typically using 2506 to 5012 bytes of static data,
+depending on data type sizes, and the code is quite short as well). It generates
+random numbers in batches of 624 at a time, so the caching and pipelining of
+modern systems is exploited. It is also divide- and mod-free.
+
+The code as Shawn received it included the following notice: Copyright (C)
+1997 Makoto Matsumoto and Takuji Nishimura. When you use this, send an e-mail to
+ with an appropriate reference to your work. It
+would be nice to Cc:  and
+ when you write.
+
+
+
    Portability
    
+
+Note for people porting EO to other platforms: please make sure that the type
+uint32_t in the file eoRng.h is exactly 32 bits long. It may in principle be
+longer, but not shorter. If it is longer, file compatibility between EO on
+different platforms may be broken.
+*/
+class eoRng : public eoObject, public eoPersistent
+{
+public :
+
+    /** Constructor
+
+    @param s Random seed; if you want another seed, use reseed.
+
+    @see reseed for details on usage of the seeding value.
+    */
+    eoRng(uint32_t s)
+        : state(0), next(0), left(-1), cached(false), N(624), M(397), K(0x9908B0DFU)
+        {
+            state = new uint32_t[N+1];
+            initialize(2*s);
+        }
+
+    ~eoRng(void)
+        {
+            delete [] state;
+        }
+
+    /** Re-initializes the Random Number Generator.
+
+    WARNING: Jeroen Eggermont  noticed that initialize does
+    not differentiate between odd and even numbers, therefore the argument to
+    reseed is now doubled before being passed on.
+
+    Manually divide the seed by 2 if you want to re-run old runs
+
+    @version MS. 5 Oct. 2001
+    */
+    void reseed(uint32_t s)
+        {
+            initialize(2*s);
+        }
+
+    /** Re-initializes the Random Number Generator
+
+    This is the traditional seeding procedure. This version is deprecated and
+    only provided for compatibility with old code. In new projects you should
+    use reseed.
+
+    @see reseed for details on usage of the seeding value.
+
+    @version old version (deprecated)
+    */
+    void oldReseed(uint32_t s)
+        {
+            initialize(s);
+        }
+
+    /**
+    uniform(m = 1.0) returns a random double in the range [0, m)
+    */
+    double uniform(double m = 1.0)
+        { // random number between [0, m]
+            return m * double(rand()) / double(1.0 + rand_max());
+        }
+
+    /**
+    random() returns a random integer in the range [0, m)
+    */
+    uint32_t random(uint32_t m)
+        {
+            return uint32_t(uniform() * double(m));
+        }
+
+    /**
+    flip() tosses a biased coin such that flip(x/100.0) will
+    returns true x% of the time
+    */
+    bool flip(float bias=0.5)
+        {
+            return uniform() < bias;
+        }
+
+    /**
+    normal() zero mean gaussian deviate with standard deviation of 1
+    */
+    double normal(void);        // gaussian mutation, stdev 1
+
+    /**
+    normal(stdev) zero mean gaussian deviate with user defined standard deviation
+    */
+    double normal(double stdev)
+        {
+            return stdev * normal();
+        }
+
+    /**
+    normal(mean, stdev) user defined mean gaussian deviate with user defined standard deviation
+    */
+    double normal(double mean, double stdev)
+        {
+            return mean + normal(stdev);
+        }
+
+    /**
+    Generates random numbers using a negative exponential distribution
+    */
+    double negexp(double mean)
+        {
+            return ( -mean*log((double)rand() / rand_max()));
+        }
+
+    /**
+    rand() returns a random number in the range [0, rand_max)
+    */
+    uint32_t rand();
+
+    /**
+    rand_max() the maximum returned by rand()
+    */
+    uint32_t rand_max(void) const { return uint32_t(0xffffffff); }
+
+    /**
+    roulette_wheel(vec, total = 0) does a roulette wheel selection
+    on the input std::vector vec. If the total is not supplied, it is
+    calculated. It returns an integer denoting the selected argument.
+    */
+    template 
+    int roulette_wheel(const std::vector& vec, TYPE total = 0)
+        {
+            if (total == 0)
+            { // count
+                for (unsigned    i = 0; i < vec.size(); ++i)
+                    total += vec[i];
+            }
+            double fortune = uniform() * total;
+            int i = 0;
+            while (fortune > 0)
+            {
+                fortune -= vec[i++];
+            }
+            return --i;
+        }
+
+
+    /** Randomly select element from vector.
+
+    @return Uniformly chosen element from the vector.
+    */
+    template 
+    const TYPE& choice(const std::vector& vec) const
+        { return vec[random(vec.size())]; }
+
+
+    /** Randomly select element from vector.
+
+    @overload
+
+    Provide a version returning a non-const element reference.
+
+    @return Uniformly chosen element from the vector.
+
+    @warning Changing the return value does alter the vector.
+    */
+    template 
+    TYPE& choice(std::vector& vec)
+        { return vec[random(vec.size())]; }
+
+    ///
+    void printOn(std::ostream& _os) const
+        {
+            for (int i = 0; i < N; ++i)
+            {
+                _os << state[i] << ' ';
+            }
+            _os << int(next - state) << ' ';
+            _os << left << ' ' << cached << ' ' << cacheValue;
+        }
+
+    ///
+    void readFrom(std::istream& _is)
+        {
+            for (int i = 0; i < N; ++i)
+            {
+                _is >> state[i];
+            }
+
+            int n;
+            _is >> n;
+            next = state + n;
+
+            _is >> left;
+            _is >> cached;
+            _is >> cacheValue;
+        }
+
+    std::string className(void) const { return "Mersenne-Twister"; }
+
+private:
+
+    uint32_t restart(void);
+
+
+    /* @brief Initialize state
+
+    We initialize state[0..(N-1)] via the generator
+
+    x_new = (69069 * x_old) mod 2^32
+
+    from Line 15 of Table 1, p. 106, Sec. 3.3.4 of Knuth's _The Art of Computer
+    Programming_, Volume 2, 3rd ed.
+
+    Notes (SJC): I do not know what the initial state requirements of the
+    Mersenne Twister are, but it seems this seeding generator could be better.
+    It achieves the maximum period for its modulus (2^30) iff x_initial is odd
+    (p. 20-21, Sec. 3.2.1.2, Knuth); if x_initial can be even, you have
+    sequences like 0, 0, 0, ...; 2^31, 2^31, 2^31, ...; 2^30, 2^30, 2^30, ...;
+    2^29, 2^29 + 2^31, 2^29, 2^29 + 2^31, ..., etc. so I force seed to be odd
+    below.
+
+    Even if x_initial is odd, if x_initial is 1 mod 4 then
+
+    the          lowest bit of x is always 1,
+    the  next-to-lowest bit of x is always 0,
+    the 2nd-from-lowest bit of x alternates      ... 0 1 0 1 0 1 0 1 ... ,
+    the 3rd-from-lowest bit of x 4-cycles        ... 0 1 1 0 0 1 1 0 ... ,
+    the 4th-from-lowest bit of x has the 8-cycle ... 0 0 0 1 1 1 1 0 ... ,
+    ...
+
+    and if x_initial is 3 mod 4 then
+
+    the          lowest bit of x is always 1,
+    the  next-to-lowest bit of x is always 1,
+    the 2nd-from-lowest bit of x alternates      ... 0 1 0 1 0 1 0 1 ... ,
+    the 3rd-from-lowest bit of x 4-cycles        ... 0 0 1 1 0 0 1 1 ... ,
+    the 4th-from-lowest bit of x has the 8-cycle ... 0 0 1 1 1 1 0 0 ... ,
+    ...
+
+    The generator's potency (min. s>=0 with (69069-1)^s = 0 mod 2^32) is 16,
+    which seems to be alright by p. 25, Sec. 3.2.1.3 of Knuth. It also does well
+    in the dimension 2..5 spectral tests, but it could be better in dimension 6
+    (Line 15, Table 1, p. 106, Sec. 3.3.4, Knuth).
+
+    Note that the random number user does not see the values generated here
+    directly since restart() will always munge them first, so maybe none of all
+    of this matters. In fact, the seed values made here could even be
+    extra-special desirable if the Mersenne Twister theory says so-- that's why
+    the only change I made is to restrict to odd seeds.
+    */
+    void initialize(uint32_t seed);
+
+    /** @brief Array for the state */
+    uint32_t* state;
+
+    uint32_t* next;
+
+    int left;
+
+    // for normal distribution
+    bool cached;
+
+    float cacheValue;
+
+    const int N;
+
+    const int M;
+
+    /** @brief Magic constant */
+    const uint32_t K;
+
+
+    /** @brief Copy constructor
+
+    Private copy ctor and assignment operator to make sure that nobody
+    accidentally copies the random number generator. If you want similar RNG's,
+    make two RNG's and initialize them with the same seed.
+
+    As it cannot be called, we do not provide an implementation.
+    */
+    eoRng(const eoRng&);
+
+    /** @brief Assignmant operator
+
+    @see Copy constructor eoRng(const eoRng&).
+    */
+    eoRng& operator=(const eoRng&);
+};
+
+
+
+namespace eo
+{
+    /** The one and only global eoRng object */
+    extern eoRng rng;
+}
+using eo::rng;
+
+
+
+
+
+// Implementation of some eoRng members.... Don't mind the mess, it does work.
+
+
+#define hiBit(u)       ((u) & 0x80000000U)   // mask all but highest   bit of u
+#define loBit(u)       ((u) & 0x00000001U)   // mask all but lowest    bit of u
+#define loBits(u)      ((u) & 0x7FFFFFFFU)   // mask     the highest   bit of u
+#define mixBits(u, v)  (hiBit(u)|loBits(v))  // move hi bit of u to hi bit of v
+
+inline void eoRng::initialize(uint32_t seed)
+{
+    left = -1;
+
+    register uint32_t x = (seed | 1U) & 0xFFFFFFFFU, *s = state;
+    register int    j;
+
+    for(left=0, *s++=x, j=N; --j;
+        *s++ = (x*=69069U) & 0xFFFFFFFFU);
+}
+
+
+
+inline uint32_t eoRng::restart(void)
+{
+    register uint32_t *p0=state, *p2=state+2, *pM=state+M, s0, s1;
+    register int    j;
+
+    left=N-1, next=state+1;
+
+    for(s0=state[0], s1=state[1], j=N-M+1; --j; s0=s1, s1=*p2++)
+        *p0++ = *pM++ ^ (mixBits(s0, s1) >> 1) ^ (loBit(s1) ? K : 0U);
+
+    for(pM=state, j=M; --j; s0=s1, s1=*p2++)
+        *p0++ = *pM++ ^ (mixBits(s0, s1) >> 1) ^ (loBit(s1) ? K : 0U);
+
+    s1=state[0], *p0 = *pM ^ (mixBits(s0, s1) >> 1) ^ (loBit(s1) ? K : 0U);
+    s1 ^= (s1 >> 11);
+    s1 ^= (s1 <<  7) & 0x9D2C5680U;
+    s1 ^= (s1 << 15) & 0xEFC60000U;
+    return(s1 ^ (s1 >> 18));
+}
+
+
+
+inline uint32_t eoRng::rand(void)
+{
+
+    uint32_t y;
+
+    if(--left < 0)
+        return(restart());
+
+    y  = *next++;
+    y ^= (y >> 11);
+    y ^= (y <<  7) & 0x9D2C5680U;
+    y ^= (y << 15) & 0xEFC60000U;
+    return(y ^ (y >> 18));
+}
+
+
+
+inline double eoRng::normal(void)
+{
+    if (cached)
+    {
+        cached = false;
+        return cacheValue;
+    }
+
+    float rSquare, factor, var1, var2;
+
+    do
+    {
+        var1 = 2.0 * uniform() - 1.0;
+        var2 = 2.0 * uniform() - 1.0;
+
+        rSquare = var1 * var1 + var2 * var2;
+    }
+    while (rSquare >= 1.0 || rSquare == 0.0);
+
+    factor = sqrt(-2.0 * log(rSquare) / rSquare);
+
+    cacheValue = var1 * factor;
+    cached = true;
+
+    return (var2 * factor);
+}
+
+
+
+namespace eo {
+    // a few convenience functions for generating numbers
+
+    /** @brief Random function
+
+    Templatized random function, returns a random double in the range [0, max).
+
+    @param max Maximum for distribution
+
+    It works with most basic types such as:
+    - char
+    - int
+    - unsigned
+    - float
+    - double
+    */
+    template 
+    inline T random(const T& max) {
+        return static_cast(rng.uniform() * max); }
+
+    /** @brief Random function
+
+    Templatized random function, returns a random double in the range [min, max).
+
+    @param min Minimum for distribution
+    @param max Maximum for distribution
+
+    @see random(const T& max)
+    */
+    template 
+    inline T random(const T& min, const T& max) {
+        return static_cast(rng.uniform() * (max-min)) + min; }
+
+    /** Normal distribution */
+    inline double normal() { return rng.normal(); }
+}
+
+
+#endif
+
+
+// Local Variables:
+// coding: iso-8859-1
+// mode: C++
+// c-file-style: "Stroustrup"
+// fill-column: 80
+// End:
diff --git a/trunk/paradiseo-eo/src/utils/eoRealBounds.cpp b/trunk/paradiseo-eo/src/utils/eoRealBounds.cpp
new file mode 100644
index 000000000..c090edb01
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoRealBounds.cpp
@@ -0,0 +1,259 @@
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif
+
+#ifdef HAVE_CONFIG_H
+#include 
+#endif
+
+#include 
+#include 
+
+#include "eoRealBounds.h"
+#include "eoRealVectorBounds.h"
+
+
+// the global dummy bounds
+// (used for unbounded variables when bounds are required)
+eoRealNoBounds eoDummyRealNoBounds;
+eoRealVectorNoBounds eoDummyVectorNoBounds(0);
+
+///////////// helper read functions - could be somewhere else
+
+// removes leading delimiters - return false if nothing else left
+bool remove_leading(std::string & _s, const std::string _delim)
+{
+  size_t posDebToken = _s.find_first_not_of(_delim);
+  if (posDebToken >= _s.size())
+    return false;
+  _s = _s.substr(posDebToken);
+  return true;
+}
+
+double read_double(std::string _s)
+{
+    std::istringstream is(_s);
+  double r;
+  is >> r;
+  return r;
+}
+
+long int read_int(std::string _s)
+{
+    std::istringstream is(_s);
+  long int i;
+  is >> i;
+  return i;
+}
+
+// need to rewrite copy ctor and assignement operator because of ownedBounds
+eoRealVectorBounds::eoRealVectorBounds(const eoRealVectorBounds & _b):
+  eoRealBaseVectorBounds(_b)
+{
+  factor = _b.factor;
+  ownedBounds = _b.ownedBounds;
+  // duplicate all pointers!
+  if (ownedBounds.size()>0)
+    for (unsigned i=0; idup();
+}
+
+
+// the readFrom method of eoRealVectorNoBounds:
+// only calls the readFrom(string) - for param reading
+void eoRealVectorBounds::readFrom(std::istream& _is)
+{
+  std::string value;
+  _is >> value;
+  readFrom(value);
+  return;
+}
+
+void eoRealVectorBounds::readFrom(std::string _value)
+{
+  // keep track of old size - to adjust in the end
+  unsigned oldSize = size();
+  // clean-up before filling in
+  if (ownedBounds.size()>0)
+    for (unsigned i = 0; i < ownedBounds.size(); ++i)
+      {
+	delete ownedBounds[i];
+      }
+  ownedBounds.resize(0);
+  factor.resize(0);
+  resize(0);
+
+  // now read
+  std::string delim(",; ");
+  while (_value.size()>0)
+    {
+      if (!remove_leading(_value, delim)) // only delimiters were left
+	break;
+      // look for opening char
+      size_t posDeb = _value.find_first_of("[(");
+      if (posDeb >= _value.size())	// nothing left to read (though probably a syntax error there)
+	{
+	  break;
+	}
+      // ending char
+      std::string closeChar = (_value[posDeb] == '(' ? std::string(")") : std::string("]") );
+
+      size_t posFin = _value.find_first_of(std::string(closeChar));
+      if (posFin >= _value.size())
+	throw std::runtime_error("Syntax error when reading bounds");
+
+  // y a-t-il un nbre devant
+      unsigned count = 1;
+      if (posDeb > 0)			// something before opening
+	{
+	  std::string sCount = _value.substr(0, posDeb);
+	  count = read_int(sCount);
+	  if (count <= 0)
+	    throw std::runtime_error("Syntax error when reading bounds");
+	}
+
+      // the bounds
+      std::string sBounds = _value.substr(posDeb+1, posFin-posDeb-1);
+      // and remove from original string
+      _value = _value.substr(posFin+1);
+
+      remove_leading(sBounds, delim);
+      size_t posDelim = sBounds.find_first_of(delim);
+      if (posDelim >= sBounds.size())
+	throw std::runtime_error("Syntax error when reading bounds");
+
+      bool minBounded=false, maxBounded=false;
+      double minBound=0, maxBound=0;
+
+      // min bound
+      std::string sMinBounds = sBounds.substr(0,posDelim);
+      if (sMinBounds != std::string("-inf"))
+	{
+	  minBounded = true;
+	  minBound = read_double(sMinBounds);
+	}
+
+      // max bound
+      size_t posEndDelim = sBounds.find_first_not_of(delim,posDelim);
+
+      std::string sMaxBounds = sBounds.substr(posEndDelim);
+      if (sMaxBounds != std::string("+inf"))
+	{
+	  maxBounded = true;
+	  maxBound = read_double(sMaxBounds);
+	}
+
+      // now create the eoRealBounds objects
+      eoRealBounds *ptBounds;
+      if (minBounded && maxBounded)
+	ptBounds = new eoRealInterval(minBound, maxBound);
+      else if (!minBounded && !maxBounded)	// no bound at all
+	ptBounds = new eoRealNoBounds;
+      else if (!minBounded && maxBounded)
+	ptBounds = new eoRealAboveBound(maxBound);
+      else if (minBounded && !maxBounded)
+	ptBounds = new eoRealBelowBound(minBound);
+      // store it for memory management
+      ownedBounds.push_back(ptBounds);
+      // push the count
+      factor.push_back(count);
+      // and add count of it to the actual bounds
+      for (unsigned i=0; i 1 already!)
+      factor[factor.size()-1] += missing;
+    }
+}
+
+/** the constructor for eoGeneralRealBound - from a string
+ *  very similar to the eoRealVectorBounds::readFrom above
+ *  but was written much later so the readFrom does not call this one
+ *  as it should do
+ */
+eoRealBounds* eoGeneralRealBounds::getBoundsFromString(std::string _value)
+{
+  // now read
+  std::string delim(",; ");
+  std::string beginOrClose("[(])");
+  if (!remove_leading(_value, delim)) // only delimiters were left
+    throw std::runtime_error("Syntax error in eoGeneralRealBounds Ctor");
+
+  // look for opening char
+  size_t posDeb = _value.find_first_of(beginOrClose);	// allow ]a,b]
+  if (posDeb >= _value.size())	// nothing left to read
+    throw std::runtime_error("Syntax error in eoGeneralRealBounds Ctor");
+
+  // ending char: next {}() after posDeb
+  size_t posFin = _value.find_first_of(beginOrClose,posDeb+1);
+  if (posFin >= _value.size())	// not found
+    throw std::runtime_error("Syntax error in eoGeneralRealBounds Ctor");
+
+  // the bounds
+  std::string sBounds = _value.substr(posDeb+1, posFin-posDeb-1);
+  // and remove from original string
+  _value = _value.substr(posFin+1);
+
+  remove_leading(sBounds, delim);
+  size_t posDelim = sBounds.find_first_of(delim);
+  if (posDelim >= sBounds.size())
+    throw std::runtime_error("Syntax error in eoGeneralRealBounds Ctor");
+
+      bool minBounded=false, maxBounded=false;
+      double minBound=0, maxBound=0;
+
+      // min bound
+      std::string sMinBounds = sBounds.substr(0,posDelim);
+
+      if ( (sMinBounds != std::string("-inf")) &&
+	   (sMinBounds != std::string("-infinity"))
+	   )
+	{
+	  minBounded = true;
+	  minBound = read_double(sMinBounds);
+	}
+
+      // max bound
+      size_t posEndDelim = sBounds.find_first_not_of(delim,posDelim);
+
+      std::string sMaxBounds = sBounds.substr(posEndDelim);
+
+      if ( (sMaxBounds != std::string("+inf")) &&
+	   (sMaxBounds != std::string("+infinity"))
+	   )
+	{
+	  maxBounded = true;
+	  maxBound = read_double(sMaxBounds);
+	}
+
+      // now create the embedded eoRealBounds object
+      eoRealBounds * locBound;
+      if (minBounded && maxBounded)
+	{
+	  if (maxBound <= minBound)
+	    throw std::runtime_error("Syntax error in eoGeneralRealBounds Ctor");
+	  locBound = new eoRealInterval(minBound, maxBound);
+	}
+      else if (!minBounded && !maxBounded)	// no bound at all
+	locBound = new eoRealNoBounds;
+      else if (!minBounded && maxBounded)
+	locBound = new eoRealAboveBound(maxBound);
+      else if (minBounded && !maxBounded)
+	locBound = new eoRealBelowBound(minBound);
+      return locBound;
+}
diff --git a/trunk/paradiseo-eo/src/utils/eoRealBounds.h b/trunk/paradiseo-eo/src/utils/eoRealBounds.h
new file mode 100644
index 000000000..12cb7b46a
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoRealBounds.h
@@ -0,0 +1,652 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoRealBounds.h
+// (c) Marc Schoenauer 2001, Maarten Keijzer 2000, GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoRealBounds_h
+#define _eoRealBounds_h
+
+#include 		   // std::exceptions!
+#include 
+
+/**
+\defgroup EvolutionStrategies
+
+*/
+
+
+/**
+\class eoRealBounds eoRealBounds.h es/eoRealBounds.h
+\ingroup EvolutionStrategies
+
+    Defines bound classes for real numbers.
+
+Scalar type:
+------------
+Basic class is eoRealBounds, a pure virtual.
+
+The following pure virtual methods are to be used in mutations:
+- void foldsInBounds(double &) that folds any value that falls out of 
+  the bounds back into the bounds, by bouncing on the limit (if any)
+- bool isInBounds(double) that simply says whether or not the argument 
+  is in the bounds
+- void truncate(double &) that set the argument to the bound value it
+it exceeds it
+
+So mutation can choose 
+- iterate trying until they fall in bounds, 
+- only try once and "restd::pair" by using the foldsInBounds method
+- only try once and restd::pair using the truncate method (will create a
+  huge bias toward the bound if the soluiton is not far from the bounds)
+
+There is also a uniform() method that generates a uniform value 
+(if possible, i.e. if bounded) in the interval.
+
+Derived class are 
+eoRealInterval that holds a minimum and maximum value, 
+eoRealNoBounds the "unbounded bounds" (-infinity, +infinity)
+eoRealBelowBound the half-bounded interval [min, +infinity)
+eoRealAboveBound the   half-bounded interval (-infinity, max]
+
+THis file also contains the declaration of *the* global object that
+is the unbounded bound
+*/
+class eoRealBounds : public eoPersistent
+{ 
+public:
+  virtual ~eoRealBounds(){}
+
+  /** Self-Test: true if ***both*** a min and a max
+   */
+  virtual bool isBounded(void) const  = 0;
+
+  /** Self-Test: true if no min ***and*** no max
+   *        hence no further need to test/truncate/fold anything
+   */
+  virtual bool hasNoBoundAtAll(void) const  = 0;
+
+  /** Self-Test: bounded from below???
+   */
+  virtual bool isMinBounded(void) const = 0;
+
+  /** Self-Test: bounded from above???
+   */
+  virtual bool isMaxBounded(void) const = 0;
+
+  /** Test on a value: is it in bounds?
+   */
+  virtual bool isInBounds(double)  const = 0;
+
+  /** Put value back into bounds - by folding back and forth
+   */
+  virtual void foldsInBounds(double &)  const = 0;
+
+  /** Put value back into bounds - by truncating to a boundary value
+   */
+  virtual void truncate(double &)  const = 0;
+
+  /** get minimum value 
+   *  @std::exception if does not exist
+   */  
+  virtual double minimum()  const = 0 ;
+  /** get maximum value
+   *  @std::exception if does not exist
+   */  
+  virtual double maximum()  const = 0 ;
+  /** get range
+   *  @std::exception if unbounded
+   */  
+  virtual double range()  const = 0;
+
+  /** random generator of uniform numbers in bounds
+   * @std::exception if unbounded
+   */
+  virtual double uniform(eoRng & _rng = eo::rng)  const = 0;
+
+  /** for memory managements - ugly */
+  virtual eoRealBounds * dup()  const = 0;
+};
+
+/** A default class for unbounded variables
+ */
+class eoRealNoBounds : public eoRealBounds
+{
+public:
+  virtual ~eoRealNoBounds(){}
+
+  virtual bool isBounded(void)  const {return false;}
+  virtual bool hasNoBoundAtAll(void) const  {return true;}
+  virtual bool isMinBounded(void)  const {return false;}
+  virtual bool isMaxBounded(void)  const {return false;}
+  virtual void foldsInBounds(double &)  const {return;}
+  virtual void truncate(double &)  const {return;}
+  virtual bool isInBounds(double)  const {return true;}
+
+  virtual double minimum() const
+  {
+    throw std::logic_error("Trying to get minimum of unbounded eoRealBounds");
+  }
+  virtual double maximum() const 
+  {
+    throw std::logic_error("Trying to get maximum of unbounded eoRealBounds");
+  }
+  virtual double range() const 
+  {
+    throw std::logic_error("Trying to get range of unbounded eoRealBounds");
+  }
+
+  virtual double uniform(eoRng & _rng = eo::rng) const 
+  {
+    throw std::logic_error("Trying to generate uniform values in unbounded eoRealBounds");
+  }
+
+  // methods from eoPersistent
+  /**
+   * Read object.
+   * @param _is A std::istream.
+   * but reading should not be done here, because of bound problems
+   * see eoRealVectorBounds
+   */
+  virtual void readFrom(std::istream& _is) 
+  {
+    throw std::runtime_error("Should not use eoRealBounds::readFrom");
+  }
+
+  /**
+   * Write object. It's called printOn since it prints the object on a stream.
+   * @param _os A std::ostream.
+   */
+  virtual void printOn(std::ostream& _os) const
+  {
+    _os << "[-inf,+inf]";
+  }
+
+  /** for memory managements - ugly */
+  virtual eoRealBounds * dup() const 
+  {
+    return new eoRealNoBounds(*this);
+  }
+
+};
+
+// one object for all - see eoRealBounds.cpp
+extern eoRealNoBounds eoDummyRealNoBounds;
+
+/**
+ * fully bounded eoRealBound == interval
+ */
+class eoRealInterval : public eoRealBounds
+{
+public :
+  virtual ~eoRealInterval(){}
+  
+  /** 
+      Simple bounds = minimum and maximum (allowed)
+  */
+  eoRealInterval(double _min=0, double _max=1) : 
+    repMinimum(_min), repMaximum(_max), repRange(_max-_min) 
+  {
+    if (repRange<=0)
+      throw std::logic_error("Void range in eoRealBounds");
+  }
+
+  // accessors  
+  virtual double minimum() const { return repMinimum; }
+  virtual double maximum() const { return repMaximum; }
+  virtual double range()  const { return repRange; }
+
+  // description
+  virtual bool isBounded(void)  const {return true;}
+  virtual bool hasNoBoundAtAll(void)  const {return false;}
+  virtual bool isMinBounded(void)  const {return true;}
+  virtual bool isMaxBounded(void)  const {return true;}
+
+  virtual double uniform(eoRng & _rng = eo::rng) const 
+  {
+    return repMinimum + _rng.uniform(repRange);
+  }  
+
+  // says if a given double is within the bounds
+  virtual bool isInBounds(double _r) const 
+  {
+    if (_r < repMinimum)
+      return false;
+    if (_r > repMaximum)
+      return false;
+    return true;
+  }
+
+  // folds a value into bounds
+  virtual void foldsInBounds(double &  _r) const 
+  {
+    long iloc;
+    double dlargloc = 2 * range() ;
+
+    if (fabs(_r) > 1.0E9)		// iloc too large!
+      {
+	_r = uniform();
+	return;
+      }
+
+    if ( (_r > maximum()) )
+      {
+	iloc = (long) ( (_r-minimum()) / dlargloc ) ;
+	_r -= dlargloc * iloc ;
+	if ( _r > maximum() )
+	  _r = 2*maximum() - _r ;
+      }
+    
+    if (_r < minimum()) 
+      {
+	iloc = (long) ( (maximum()-_r) / dlargloc ) ;
+	_r += dlargloc * iloc ;
+	if (_r < minimum())
+	  _r = 2*minimum() - _r ;
+      }
+  }    
+
+  // truncates to the bounds
+  virtual void truncate(double & _r) const 
+  {
+    if (_r < repMinimum)
+      _r = repMinimum;
+    else if (_r > repMaximum)
+      _r = repMaximum;
+    return;
+  }
+
+  // methods from eoPersistent
+  /**
+   * Read object.
+   * @param _is A std::istream.
+   * but reading should not be done here, because of bound problems
+   * see eoRealVectorBounds
+   */
+  virtual void readFrom(std::istream& _is) 
+  {
+    throw std::runtime_error("Should not use eoRealInterval::readFrom");
+  }
+
+  /**
+   * Write object. It's called printOn since it prints the object on a stream.
+   * @param _os A std::ostream.
+   */
+  virtual void printOn(std::ostream& _os) const
+  {
+    _os << "[" << repMinimum << "," << repMaximum << "]";
+  }
+
+  /** for memory managements - ugly */
+  virtual eoRealBounds * dup() const 
+  {
+    return new eoRealInterval(*this);
+  }
+
+private :
+  double repMinimum;
+  double repMaximum;
+  double repRange;			   // to minimize operations ???
+};
+
+/**
+ * an eoRealBound bounded from below only
+ */
+class eoRealBelowBound : public eoRealBounds
+{
+public :
+  virtual ~eoRealBelowBound(){}  
+  /** 
+      Simple bounds = minimum
+  */
+  eoRealBelowBound(double _min=0) : 
+    repMinimum(_min)
+  {}
+
+  // accessors  
+  virtual double minimum() const { return repMinimum; }
+
+  virtual double maximum() const 
+  {
+    throw std::logic_error("Trying to get maximum of eoRealBelowBound");
+  }
+  virtual double range() const 
+  {
+    throw std::logic_error("Trying to get range of eoRealBelowBound");
+  }
+
+  // random generators
+  virtual double uniform(eoRng & _rng = eo::rng) const 
+  {
+    throw std::logic_error("Trying to generate uniform values in eoRealBelowBound");
+  }
+
+  // description
+  virtual bool isBounded(void)  const {return false;}
+  virtual bool hasNoBoundAtAll(void)  const {return false;}
+  virtual bool isMinBounded(void)  const {return true;}
+  virtual bool isMaxBounded(void) const  {return false;}
+
+  // says if a given double is within the bounds
+  virtual bool isInBounds(double _r) const 
+  {
+    if (_r < repMinimum)
+      return false;
+    return true;
+  }
+
+  // folds a value into bounds
+  virtual void foldsInBounds(double &  _r) const 
+  {
+    // easy as a pie: symmetry w.r.t. minimum
+    if (_r < repMinimum)	   // nothing to do otherwise
+      _r = 2*repMinimum - _r;
+    return ;
+  }    
+
+  // truncates to the bounds
+  virtual void truncate(double & _r) const 
+  {
+    if (_r < repMinimum)
+      _r = repMinimum;
+    return;
+  }
+
+  // methods from eoPersistent
+  /**
+   * Read object.
+   * @param _is A std::istream.
+   * but reading should not be done here, because of bound problems
+   * see eoRealVectorBounds
+   */
+  virtual void readFrom(std::istream& _is) 
+  {
+    throw std::runtime_error("Should not use eoRealBelowBound::readFrom");
+  }
+
+  /**
+   * Write object. It's called printOn since it prints the object on a stream.
+   * @param _os A std::ostream.
+   */
+  virtual void printOn(std::ostream& _os) const
+  {
+    _os << "[" << repMinimum << ",+inf]";
+  }
+
+  /** for memory managements - ugly */
+  virtual eoRealBounds * dup() const 
+  {
+    return new eoRealBelowBound(*this);
+  }
+
+private :
+  double repMinimum;
+};
+
+/**
+An eoRealBound bounded from above only
+*/
+class eoRealAboveBound : public eoRealBounds
+{
+public :
+  virtual ~eoRealAboveBound(){}
+  
+  /** 
+      Simple bounds = minimum
+  */
+  eoRealAboveBound(double _max=0) : 
+    repMaximum(_max)
+  {}
+
+  // accessors  
+  virtual double maximum() const  { return repMaximum; }
+
+  virtual double minimum() const 
+  {
+    throw std::logic_error("Trying to get minimum of eoRealAboveBound");
+  }
+  virtual double range() const 
+  {
+    throw std::logic_error("Trying to get range of eoRealAboveBound");
+  }
+
+  // random generators
+  virtual double uniform(eoRng & _rng = eo::rng) const 
+  {
+    throw std::logic_error("Trying to generate uniform values in eoRealAboveBound");
+  }
+
+  // description
+  virtual bool isBounded(void)  const {return false;}
+  virtual bool hasNoBoundAtAll(void)  const {return false;}
+  virtual bool isMinBounded(void)  const {return false;}
+  virtual bool isMaxBounded(void)  const {return true;}
+
+  // says if a given double is within the bounds
+  virtual bool isInBounds(double _r) const 
+  {
+    if (_r > repMaximum)
+      return false;
+    return true;
+  }
+
+  // folds a value into bounds
+  virtual void foldsInBounds(double &  _r) const 
+  {
+    // easy as a pie: symmetry w.r.t. maximum
+    if (_r > repMaximum)	   // nothing to do otherwise
+      _r = 2*repMaximum - _r;
+    return ;
+  }    
+
+  // truncates to the bounds
+  virtual void truncate(double & _r) const 
+  {
+    if (_r > repMaximum)
+      _r = repMaximum;
+    return;
+  }
+
+  // methods from eoPersistent
+  /**
+   * Read object.
+   * @param _is A std::istream.
+   * but reading should not be done here, because of bound problems
+   * see eoRealVectorBounds
+   */
+  virtual void readFrom(std::istream& _is) 
+  {
+    throw std::runtime_error("Should not use eoRealAboveBound::readFrom");
+  }
+
+  /**
+   * Write object. It's called printOn since it prints the object on a stream.
+   * @param _os A std::ostream.
+   */
+  virtual void printOn(std::ostream& _os) const
+  {
+    _os << "[-inf," << repMaximum << "]";
+  }
+
+  /** for memory managements - ugly */
+  virtual eoRealBounds * dup() const 
+  {
+    return new eoRealAboveBound(*this);
+  }
+
+private :
+  double repMaximum;
+};
+
+//////////////////////// tentative for a general BOUND class that is constructed from a string
+
+/** A class that encapsulate all possible eoIntBounds.
+ *  Mandatory in order to read through the parser
+ */
+class eoGeneralRealBounds : public eoRealBounds
+{
+public:
+  /** Ctor: from a string, chooses the type of bound */
+  eoGeneralRealBounds(std::string _s = "[-infinity,+infinity]")
+  {
+    repBound = getBoundsFromString(_s);
+  }
+
+  /** Need a Cpy Ctor because we are allocating memory */
+  eoGeneralRealBounds(const eoGeneralRealBounds & _b):eoRealBounds(_b)
+  {
+    // replicate the embedded bound (I'm pretty sure there is another
+    // way to do that !!!
+
+    bool minBounded = _b.isMinBounded();
+    bool maxBounded = _b.isMaxBounded();
+    double minimum, maximum;
+    const eoRealBounds & bb = _b.theBounds();
+    if (minBounded) minimum = bb.minimum();
+    if (maxBounded) maximum = bb.maximum();
+
+      if (minBounded && maxBounded)
+	repBound = new eoRealInterval(minimum, maximum);
+      else if (!minBounded && !maxBounded)	// no bound at all
+	repBound = new eoRealNoBounds;
+      else if (!minBounded && maxBounded)
+	repBound = new eoRealAboveBound(maximum);
+      else if (minBounded && !maxBounded)
+	repBound = new eoRealBelowBound(minimum);
+  }
+
+  eoGeneralRealBounds& operator=(const eoGeneralRealBounds& _b)
+  {
+    // replicate the embedded bound (I'm pretty sure there is another
+    // way to do that !!!
+
+    bool minBounded = _b.isMinBounded();
+    bool maxBounded = _b.isMaxBounded();
+    double minimum, maximum;
+    const eoRealBounds & bb = _b.theBounds();
+    if (minBounded) minimum = bb.minimum();
+    if (maxBounded) maximum = bb.maximum();
+
+    // first delete the embedded bounds if necessary
+    if (repBound)
+      delete repBound;
+    // now reallocate
+      if (minBounded && maxBounded)
+	repBound = new eoRealInterval(minimum, maximum);
+      else if (!minBounded && !maxBounded)	// no bound at all
+	repBound = new eoRealNoBounds;
+      else if (!minBounded && maxBounded)
+	repBound = new eoRealAboveBound(maximum);
+      else if (minBounded && !maxBounded)
+	repBound = new eoRealBelowBound(minimum);
+      return (*this);
+  }
+
+
+  /** Need a Dtor because we allocate an actual bound  */
+  ~eoGeneralRealBounds()
+  {
+    delete repBound;
+  }
+
+  ///// and now all methods from the embedded bounds
+  /** Self-Test: true if ***both*** a min and a max
+   */
+  virtual bool isBounded(void)  const {return repBound->isBounded();}
+
+  /** Self-Test: true if no min ***and*** no max
+   *        hence no further need to test/truncate/fold anything
+   */
+  virtual bool hasNoBoundAtAll(void)  const {return repBound->hasNoBoundAtAll();}
+
+  /** Self-Test: bounded from below???
+   */
+  virtual bool isMinBounded(void)  const {return repBound->isMinBounded();}
+
+  /** Self-Test: bounded from above???
+   */
+  virtual bool isMaxBounded(void) const {return repBound->isMaxBounded();}
+
+  /** Test on a value: is it in bounds?
+   */
+  virtual bool isInBounds(double _x)  const {return repBound->isInBounds(_x);}
+
+  /** Put value back into bounds - by folding back and forth
+   */
+  virtual void foldsInBounds(double & _x) const {return repBound->foldsInBounds(_x);}
+
+  /** Put value back into bounds - by truncating to a boundary value
+   */
+  virtual void truncate(double & _x)  const {return repBound->truncate(_x);}
+
+  /** get minimum value 
+   *  @std::exception if does not exist
+   */  
+  virtual double minimum()  const {return repBound->minimum();}
+  /** get maximum value
+   *  @std::exception if does not exist
+   */  
+  virtual double maximum() const {return repBound->maximum();}
+  /** get range
+   *  @std::exception if unbounded
+   */  
+  virtual double range()  const {return repBound->range();}
+
+  /** random generator of uniform numbers in bounds
+   * @std::exception if unbounded
+   */
+  virtual double uniform(eoRng & _rng = eo::rng)  const {return repBound->uniform();}
+
+  /** for memory managements - ugly */
+  virtual eoRealBounds * dup() const  {return repBound->dup();}
+
+  /** for efficiency, it's better to use the embedded boud directly */
+  const eoRealBounds & theBounds()  const { return *repBound;} 
+
+  /** don't forget the printOn method - 
+   * again that of the embedded bound
+   */
+  virtual void printOn(std::ostream& _os) const
+  {
+    repBound->printOn(_os);
+  }
+
+  /** no readFrom ??? Have to check that later */
+  virtual void readFrom(std::istream& _is) 
+  {
+    std::string s;
+    _is >> s;
+    if (repBound)
+      delete repBound;
+    repBound = getBoundsFromString(s);
+  }
+
+private:
+  // reading from a string
+  eoRealBounds * getBoundsFromString(std::string);
+
+  eoRealBounds * repBound;
+};
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/utils/eoRealVectorBounds.h b/trunk/paradiseo-eo/src/utils/eoRealVectorBounds.h
new file mode 100644
index 000000000..11144b390
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoRealVectorBounds.h
@@ -0,0 +1,421 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoRealVectorBounds.h
+// (c) Marc Schoenauer 2001, Maarten Keijzer 2000, GeNeura Team, 1998
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mak@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoRealVectorBounds_h
+#define _eoRealVectorBounds_h
+
+#include 		   // std::exceptions!
+#include 
+#include 
+
+/**
+\defgroup EvolutionStrategies
+
+*/
+
+
+/**
+Vector type for bounds (see eoRealBounds.h for scalar types)
+------------
+Class eoRealVectorBounds implements the std::vectorized version: 
+it is basically a std::vector of eoRealBounds * and forwards all request
+to the elements of the std::vector.
+
+This file also contains the global variables and eoDummyVectorNoBounds 
+that are used as defaults in ctors (i.e. when no
+bounds are given, it is assumed unbounded values)
+
+THe 2 main classes defined here are 
+
+eoRealBaseVectorBounds, base class that handles all useful functions
+eoRealVectorBounds which derives from the preceding *and* eoPersistent
+  and also has a mechanism for memory handling of the pointers 
+  it has to allocate
+*/
+class eoRealBaseVectorBounds : public std::vector
+{ 
+public:
+  // virtual desctructor (to avoid warning?)
+  virtual ~eoRealBaseVectorBounds(){}
+
+  /** Default Ctor. 
+   */
+  eoRealBaseVectorBounds() : std::vector(0) {}
+
+  /** Ctor: same bounds for everybody, given as an eoRealBounds
+  */
+  eoRealBaseVectorBounds(unsigned _dim, eoRealBounds & _bounds) : 
+    std::vector(_dim, &_bounds)
+  {}
+  
+  /** Ctor, particular case of dim-2
+   */
+  eoRealBaseVectorBounds(eoRealBounds & _xbounds, eoRealBounds & _ybounds) : 
+    std::vector(0)
+  {
+	push_back( &_xbounds);
+	push_back( &_ybounds);
+  }
+  
+  /** test: is i_th component bounded
+   */
+  virtual bool isBounded(unsigned _i) 
+  { 
+    return (*this)[_i]->isBounded();
+  }
+ 
+  /** test: bounded iff all are bounded
+   */
+  virtual bool isBounded(void) 
+  {
+    for (unsigned i=0; iisBounded())
+	return false;
+    return true;
+  }
+
+  /** Self-test: true iff i_th component has no bounds at all
+   */
+  virtual bool hasNoBoundAtAll(unsigned _i) 
+  { 
+    return (*this)[_i]->hasNoBoundAtAll();
+  }
+ 
+  /** Self-test: true iff all components have no bound at all
+   */
+  virtual bool hasNoBoundAtAll(void) 
+  {
+    for (unsigned i=0; ihasNoBoundAtAll())
+	return false;
+    return true;
+  }
+
+  virtual bool isMinBounded(unsigned _i) 
+  { return (*this)[_i]->isMinBounded();} ;
+
+  virtual bool isMaxBounded(unsigned _i) 
+  { return (*this)[_i]->isMaxBounded();} ;
+
+  /** Folds a real value back into the bounds - i_th component
+   */
+  virtual void foldsInBounds(unsigned _i, double & _r)
+  {
+    (*this)[_i]->foldsInBounds(_r);
+  }
+
+  /** Folds all variables of a std::vector of real values into the bounds
+   */
+  virtual void foldsInBounds(std::vector & _v)
+  {
+   for (unsigned i=0; ifoldsInBounds(_v[i]);
+     }    
+  }
+
+  /** Truncates a real value to the bounds - i_th component
+   */
+  virtual void truncate(unsigned _i, double & _r)
+  {
+    (*this)[_i]->truncate(_r);
+  }
+
+  /** truncates all variables of a std::vector of real values to the bounds
+   */
+  virtual void truncate(std::vector & _v)
+  {
+   for (unsigned i=0; itruncate(_v[i]);
+     }    
+  }
+
+  /** test: is i_th component within the bounds?
+   */
+  virtual bool isInBounds(unsigned _i, double _r)
+  { return (*this)[_i]->isInBounds(_r); }
+
+  /** test: are ALL components within the bounds?
+   */
+  virtual bool isInBounds(std::vector _v)
+  {
+    for (unsigned i=0; iminimum();}
+  virtual double maximum(unsigned _i) {return (*this)[_i]->maximum();}
+  virtual double range(unsigned _i) {return (*this)[_i]->range();}
+
+  /** Computes the average range
+   *  An std::exception will be raised if one of the component is unbounded
+   */
+  virtual double averageRange() 
+  {
+    double r=0.0;
+    for (unsigned i=0; iuniform();
+    return r;
+  }
+
+  /** fills a std::vector with uniformly chosen variables in bounds
+   *  An std::exception will be raised if one of the component is unbounded
+   */
+  void uniform(std::vector & _v, eoRng & _rng = eo::rng)
+  {
+    _v.resize(size());
+    for (unsigned i=0; iprintOn(_os);
+	_os << ";";
+      }
+  }
+};
+
+////////////////////////////////////////////////////////////////////
+/** Now a derived class, for parser reading
+ * It holds some of the bounds (and destroy them when dying)
+ */
+class eoRealVectorBounds : public eoRealBaseVectorBounds, public eoPersistent
+{
+public:
+  /** Default Ctor will call base class default ctor
+   */
+  eoRealVectorBounds():eoRealBaseVectorBounds() {}
+
+  /** Ctor: same bounds for everybody, given as an eoRealBounds
+  */
+  eoRealVectorBounds(unsigned _dim, eoRealBounds & _bounds) : 
+    eoRealBaseVectorBounds(_dim, _bounds), factor(1,_dim), ownedBounds(0)
+  {}
+  
+  /** Ctor, particular case of dim-2
+   */
+  eoRealVectorBounds(eoRealBounds & _xbounds, eoRealBounds & _ybounds) : 
+    eoRealBaseVectorBounds(_xbounds, _ybounds), factor(2,1), ownedBounds(0)
+  {}
+  
+  /** Simple bounds = minimum and maximum (allowed)
+  */
+  eoRealVectorBounds(unsigned _dim, double _min, double _max) : 
+    eoRealBaseVectorBounds(), factor(1, _dim), ownedBounds(0)
+  {
+    if (_max-_min<=0)
+      throw std::logic_error("Void range in eoRealVectorBounds");
+    eoRealBounds *ptBounds = new eoRealInterval(_min, _max);
+    // handle memory once
+    ownedBounds.push_back(ptBounds);
+    // same bound for everyone
+    for (unsigned int i=0; i<_dim; i++)
+      push_back(ptBounds);
+  }
+
+  /** Ctor: different bounds for different variables, std::vectors of double
+   */
+  eoRealVectorBounds(std::vector _min, std::vector _max) : 
+    factor(_min.size(), 1), ownedBounds(0)
+  {
+    if (_max.size() != _min.size())
+      throw std::logic_error("Dimensions don't match in eoRealVectorBounds");
+    // the bounds
+    eoRealBounds *ptBounds;
+    for (unsigned i=0; i<_min.size(); i++)
+      {
+	ptBounds = new eoRealInterval(_min[i], _max[i]);
+	ownedBounds.push_back(ptBounds);
+	push_back(ptBounds);
+      }
+  }
+
+  /** Ctor from a std::string
+   * and don't worry, the readFrom(std::string) starts by setting everything to 0!
+  */
+  eoRealVectorBounds(std::string _s) : eoRealBaseVectorBounds()
+  {
+    readFrom(_s);
+  }
+
+  /** Dtor: destroy all ownedBounds - BUG ???*/
+  virtual ~eoRealVectorBounds()
+  {
+//     std::cout << "Dtor, avec size = " << ownedBounds.size() << std::endl;
+//     for (unsigned i = 0; i < ownedBounds.size(); ++i)
+//     {
+//         delete ownedBounds[i];
+//     }
+}
+
+
+  // methods from eoPersistent
+  /**
+   * Read object from a stream
+   * only calls the readFrom(std::string) - for param reading
+   * @param _is A std::istream.
+   */
+  virtual void readFrom(std::istream& _is) ;
+
+  /**
+   * Read object from a std::string
+   * @param _is A std::istream.
+   */
+  virtual void readFrom(std::string _s) ;
+
+  /** overload printOn method to save space */
+  virtual void printOn(std::ostream& _os) const
+  {
+    if (factor[0]>1)
+      _os << factor[0] ;
+    operator[](0)->printOn(_os);
+
+    // other bounds
+    unsigned int index=factor[0];
+    if (factor.size()>1)
+      for (unsigned i=1; i 1)
+	    _os << factor[i];
+	  operator[](index)->printOn(_os);
+	  index += factor[i];
+	}
+  }
+
+  /** Eventually increases the size by duplicating last bound */
+  void adjust_size(unsigned _dim);
+
+  /** need to rewrite copy ctor and assignement operator 
+   *  because of ownedBounds */
+  eoRealVectorBounds(const eoRealVectorBounds &);
+
+private:// WARNING: there is no reason for both std::vector below 
+        //to be synchronized in any manner
+  std::vector factor;	   // std::list of nb of "grouped" bounds
+  std::vector ownedBounds; 
+// keep this one private
+  eoRealVectorBounds& operator=(const eoRealVectorBounds&);
+  };
+
+//////////////////////////////////////////////////////////////
+/** the dummy unbounded eoRealVectorBounds: usefull if you don't need bounds!
+ * everything is inlined.
+ * Warning: we do need this class, and not only a std::vector
+ */
+class eoRealVectorNoBounds: public eoRealVectorBounds
+{ 
+public:
+  // virtual desctructor (to avoid warning?)
+  virtual ~eoRealVectorNoBounds(){}
+
+  /** 
+   * Ctor: nothing to do, but beware of dimension: call base class ctor
+   */
+  eoRealVectorNoBounds(unsigned _dim) : 
+    eoRealVectorBounds( (_dim?_dim:1), eoDummyRealNoBounds)
+  {}
+
+  
+  virtual bool isBounded(unsigned)  {return false;}
+  virtual bool isBounded(void)   {return false;}
+
+  virtual bool hasNoBoundAtAll(unsigned)  {return true;}
+  virtual bool hasNoBoundAtAll(void)  {return true;}
+
+  virtual bool isMinBounded(unsigned)   {return false;}
+  virtual bool isMaxBounded(unsigned)   {return false;}
+
+  virtual void foldsInBounds(unsigned, double &) {return;}
+  virtual void foldsInBounds(std::vector &) {return;}
+
+  virtual void truncate(unsigned, double &) {return;}
+  virtual void truncate(std::vector &) {return;}
+
+  virtual bool isInBounds(unsigned, double) {return true;}
+  virtual bool isInBounds(std::vector) {return true;}
+
+  // accessors  
+  virtual double minimum(unsigned)
+  {
+    throw std::logic_error("Trying to get minimum of eoRealVectorNoBounds");
+  }
+  virtual double maximum(unsigned)
+  {
+    throw std::logic_error("Trying to get maximum of eoRealVectorNoBounds");
+  }
+  virtual double range(unsigned)
+  {
+    throw std::logic_error("Trying to get range of eoRealVectorNoBounds");
+  }
+
+  virtual double averageRange() 
+  {
+    throw std::logic_error("Trying to get average range of eoRealVectorNoBounds");
+  }
+
+  // random generators
+  virtual double uniform(unsigned, eoRng & _rng = eo::rng)
+  {
+    throw std::logic_error("No uniform distribution on eoRealVectorNoBounds");
+  }
+
+  // fills a std::vector with uniformly chosen variables in bounds
+  void uniform(std::vector &, eoRng & _rng = eo::rng)
+  {
+    throw std::logic_error("No uniform distribution on eoRealVectorNoBounds");
+  }
+
+};
+
+
+
+// one object for all - see eoRealBounds.cpp
+extern eoRealVectorNoBounds eoDummyVectorNoBounds;
+#endif
diff --git a/trunk/paradiseo-eo/src/utils/eoRndGenerators.h b/trunk/paradiseo-eo/src/utils/eoRndGenerators.h
new file mode 100644
index 000000000..e851bb027
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoRndGenerators.h
@@ -0,0 +1,149 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+  -----------------------------------------------------------------------------
+  eoRndGenerators.h
+
+  mimics the rnd_generator.h by putting the generators in the EO-hierarchy
+
+ (c) Maarten Keijzer (mak@dhi.dk) and GeNeura Team, 1999, 2000
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+
+//-----------------------------------------------------------------------------
+
+#ifndef eoRndGenerators_h
+#define eoRndGenerators_h
+
+#include "eoRNG.h"
+#include 
+#include 
+
+using eo::rng;
+
+/**
+  By popular demand re-introducing a base class for a family of
+  random number generators. Derived members of this class are useful
+  to initialize fixed/variable length genotypes that have an 'atomic' type
+  in an indepent way (thus without employing any knowledge about the problem domain).
+
+  See derived classes eoUniformGenerator, eoBooleanGenerator, eoNormalGenerator and eoNegExpGenerator
+*/
+template 
+class eoRndGenerator : public eoF
+{
+  typedef T AtomType;
+};
+
+/**
+   The class eoUniform can be used in the STL generate function
+   to easily generate random floats and doubles. It can also
+   be used for ints and unsigneds by virtue of the static_cast
+   in the generator function.
+
+   Also present is a specialization for boolean, that will
+   ignore the minima and maxima that are possibly set and will
+   return an unbiased flip of a coin. For a biased flip, use the eoBoolean
+
+   either in [0, _max) if only 1 value (_max) is given
+                       (or none, as _max defaults to 1.0)
+   or in [_min,_max) if 2 values are given (_min, _max)
+*/
+template  class eoUniformGenerator : public eoRndGenerator
+{
+  // added new ctor with 2 params, and modified the data to minim and range
+  // (was maxim only). MS 3/11/2000
+  public :
+    eoUniformGenerator(T _max = T(1.0), eoRng& _rng = rng) :
+      minim(T(0.0)), range(_max), uniform(_rng) {}
+    eoUniformGenerator(T _min, T _max, eoRng& _rng = rng) :
+      minim(_min), range(_max-_min), uniform(_rng)
+  {
+    if (_min>_max)
+      throw std::logic_error("Min is greater than Max in uniform_generator");
+  }
+
+  /**
+  Generates the number, uses a static_cast to get the right behaviour
+  for ints and unsigneds
+  */
+  T operator()(void) { return minim+static_cast(uniform.uniform(range)); }
+
+private :
+  T minim;
+  T range;
+  eoRng& uniform;
+};
+
+
+/// Specialization for bool, does an unbiased coin flip
+template <>
+inline bool eoUniformGenerator::operator()(void)
+{
+    return uniform.flip(0.5);
+}
+
+/**
+   The class eoBooleanGenerator can be used in the STL generate function
+   to easily generate random booleans with a specified bias
+*/
+class eoBooleanGenerator : public eoRndGenerator
+{
+  public :
+  eoBooleanGenerator(float _bias = 0.5, eoRng& _rng = rng) : bias(_bias), gen(_rng) {}
+
+  bool operator()(void) { return gen.flip(bias); }
+  private :
+  float bias;
+  eoRng& gen;
+};
+
+/**
+   The class normal_generator can be used in the STL generate function
+   to easily generate gaussian distributed floats and doubles. The user
+   can supply a standard deviation which defaults to 1.
+*/
+template  class eoNormalGenerator : public eoRndGenerator
+{
+  public :
+    eoNormalGenerator(T _stdev = T(1.0), eoRng& _rng = rng) : stdev(_stdev), normal(_rng) {}
+
+  T operator()(void) { return (T) normal.normal(stdev); }
+
+  private :
+    T stdev;
+  eoRng& normal;
+};
+
+/**
+   The class negexp_generator can be used in the STL generate function
+   to easily generate negative exponential distributed floats and doubles. The user
+   can supply a mean.
+*/
+template  class eoNegExpGenerator : public eoRndGenerator
+{
+  public :
+    eoNegExpGenerator(T _mean = 1.0, eoRng& _rng = rng) : mean(_mean), negexp(_rng) {}
+
+  T operator()(void) { return (T) negexp.negexp(mean); }
+
+  private :
+    T mean;
+  eoRng& negexp;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/utils/eoScalarFitnessStat.h b/trunk/paradiseo-eo/src/utils/eoScalarFitnessStat.h
new file mode 100644
index 000000000..b7c820d33
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoScalarFitnessStat.h
@@ -0,0 +1,63 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoScalarFitnessStat.h
+// (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000, 2001
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoScalarFitnessStat_h
+#define _eoScalarFitnessStat_h
+
+#include 
+#include 
+
+/**
+    The fitnesses of a whole population, as a std::vector
+*/
+template 
+class eoScalarFitnessStat : public eoSortedStat >
+{
+public:
+
+    using eoSortedStat >::value;
+
+    eoScalarFitnessStat(std::string _description = "FitnessES",
+                        eoRealVectorBounds & _bounds = eoDummyVectorNoBounds)
+        : eoSortedStat >(std::vector(0), _description),
+          range(*_bounds[0])
+        {}
+
+  virtual void operator()(const std::vector& _popPters)
+    {
+      value().resize(_popPters.size());
+      for (unsigned i=0; i<_popPters.size(); i++)
+	{
+	  value()[i] = _popPters[i]->fitness();
+	  range.truncate(value()[i]);
+	}
+    }
+
+private :
+  eoRealBounds & range;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/utils/eoStat.h b/trunk/paradiseo-eo/src/utils/eoStat.h
new file mode 100644
index 000000000..87706386d
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoStat.h
@@ -0,0 +1,443 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoStat.h
+// (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoStat_h
+#define _eoStat_h
+
+#include  // accumulate
+
+#include 
+#include 
+#include 
+#include 
+
+/**
+  Base class for all statistics that need to be calculated
+  over the (unsorted) population
+  (I guess it is not really necessary? MS.
+  Depstd::ends, there might be reasons to have a stat that is not an eoValueParam,
+  but maybe I'm just kidding myself, MK)
+*/
+template 
+class eoStatBase : public eoUF&, void>
+{
+public:
+  virtual void lastCall(const eoPop&) {}
+  virtual std::string className(void) const { return "eoStatBase"; }
+};
+
+/**
+  The actual class that will be used as base for all statistics
+  that need to be calculated over the (unsorted) population
+  It is an eoStatBase AND an eoValueParam so it can be used in Monitors.
+*/
+template 
+class eoStat : public eoValueParam, public eoStatBase
+{
+public:
+
+    eoStat(T _value, std::string _description)
+        : eoValueParam(_value, _description)
+        {}
+
+    virtual std::string className(void) const
+        { return "eoStat"; }
+};
+
+
+
+/**
+  Base class for statistics calculated over a sorted snapshot of the population
+*/
+template 
+class eoSortedStatBase : public eoUF&, void>
+{
+public:
+  virtual void lastCall(const std::vector&) {}
+  virtual std::string className(void) const { return "eoSortedStatBase"; }
+};
+
+/**
+  The actual class that will be used as base for all statistics
+  that need to be calculated over the sorted population
+  It's an eoSortedStatBase AND an eoValueParam so it can be used in Monitors.
+*/
+template 
+class eoSortedStat : public eoSortedStatBase, public eoValueParam
+{
+public :
+  eoSortedStat(ParamType _value, std::string _desc) : eoValueParam(_value, _desc) {}
+  virtual std::string className(void) const { return "eoSortedStat"; }
+};
+
+/**
+   Average fitness of a population. Fitness can be:
+   - double
+   - eoMinimizingFitness or eoMaximizingFitness
+   - eoParetoFitness:
+     The average of each objective is evaluated.
+
+   ( For eoScalarFitnessAssembled user eoAssembledFitnessStat classes.)
+*/
+#ifdef _MSC_VER
+template  class eoAverageStat : public eoStat
+#else
+template  class eoAverageStat : public eoStat
+#endif
+{
+public :
+
+    using eoStat::value;
+
+    typedef typename EOT::Fitness Fitness;
+
+    eoAverageStat(std::string _description = "Average Fitness")
+      : eoStat(Fitness(), _description) {}
+
+    static Fitness sumFitness(double _sum, const EOT& _eot){
+        _sum += _eot.fitness();
+        return _sum;
+    }
+
+    eoAverageStat(double _value, std::string _desc) : eoStat(_value, _desc) {}
+
+    virtual void operator()(const eoPop& _pop){
+      doit(_pop, Fitness()); // specializations for scalar and std::vector
+    }
+
+  virtual std::string className(void) const { return "eoAverageStat"; }
+
+private :
+
+    // Specialization for pareto fitness
+    template 
+    void doit(const eoPop& _pop, eoParetoFitness)
+    {
+      value().clear();
+      value().resize(_pop[0].fitness().size(), 0.0);
+
+      for (unsigned o = 0; o < value().size(); ++o)
+      {
+        for (unsigned i = 0; i < _pop.size(); ++i)
+        {
+          value()[o] += _pop[i].fitness()[o];
+        }
+
+        value()[o] /= _pop.size();
+      }
+    }
+
+    // Default behavior
+    template 
+    void doit(const eoPop& _pop, T)
+    {
+        Fitness v = std::accumulate(_pop.begin(), _pop.end(), Fitness(0.0), eoAverageStat::sumFitness);
+
+        value() = v / _pop.size();
+    }
+
+};
+
+/**
+    Average fitness + Std. dev. of a population, fitness needs to be scalar.
+*/
+template 
+class eoSecondMomentStats : public eoStat >
+{
+public :
+
+    using eoStat >::value;
+
+    typedef typename EOT::Fitness fitness_type;
+
+    typedef std::pair SquarePair;
+
+    eoSecondMomentStats(std::string _description = "Average & Stdev")
+        : eoStat(std::make_pair(0.0,0.0), _description)
+        {}
+
+    static SquarePair sumOfSquares(SquarePair _sq, const EOT& _eo)
+    {
+        double fitness = _eo.fitness();
+
+        _sq.first += fitness;
+        _sq.second += fitness * fitness;
+        return _sq;
+    }
+
+    virtual void operator()(const eoPop& _pop)
+    {
+        SquarePair result = std::accumulate(_pop.begin(), _pop.end(), std::make_pair(0.0, 0.0), eoSecondMomentStats::sumOfSquares);
+
+        double n = _pop.size();
+        value().first = result.first / n; // average
+        value().second = sqrt( (result.second - n * value().first * value().first) / (n - 1.0)); // stdev
+    }
+
+  virtual std::string className(void) const { return "eoSecondMomentStats"; }
+};
+
+/**
+    The n_th element fitness in the population (see eoBestFitnessStat)
+*/
+#ifdef _MSC_VER
+template 
+class eoNthElementFitnessStat : public eoSortedStat
+#else
+template 
+class eoNthElementFitnessStat : public eoSortedStat
+#endif
+{
+public :
+    using eoSortedStat::value;
+
+    typedef typename EOT::Fitness Fitness;
+
+    eoNthElementFitnessStat(unsigned _whichElement, std::string _description = "nth element fitness")
+      : eoSortedStat(Fitness(), _description), whichElement(_whichElement) {}
+
+    virtual void operator()(const std::vector& _pop)
+    {
+        if (whichElement > _pop.size())
+            throw std::logic_error("fitness requested of element outside of pop");
+
+        doit(_pop, Fitness());
+    }
+
+  virtual std::string className(void) const { return "eoNthElementFitnessStat"; }
+private :
+
+    struct CmpFitness
+    {
+      CmpFitness(unsigned _whichElement, bool _maxim) : whichElement(_whichElement), maxim(_maxim) {}
+
+      bool operator()(const EOT* a, const EOT* b)
+      {
+        if (maxim)
+          return a->fitness()[whichElement] > b->fitness()[whichElement];
+
+        return a->fitness()[whichElement] < b->fitness()[whichElement];
+      }
+
+      unsigned whichElement;
+      bool maxim;
+    };
+
+    // Specialization for eoParetoFitness
+    template 
+    void doit(const eoPop& _pop, eoParetoFitness)
+    {
+      typedef typename EOT::Fitness::fitness_traits traits;
+
+      value().resize(traits::nObjectives());
+
+      // copy of pointers, what the heck
+      std::vector tmp_pop = _pop;
+
+      for (unsigned o = 0; o < value().size(); ++o)
+      {
+        typename std::vector::iterator nth = tmp_pop.begin() + whichElement;
+        std::nth_element(tmp_pop.begin(), nth, tmp_pop.end(), CmpFitness(o, traits::maximizing(o)));
+        value()[o] = (*nth)->fitness()[o];
+      }
+    }
+
+    // for everything else
+    template 
+    void doit(const std::vector& _pop, T)
+    {
+      value() = _pop[whichElement]->fitness();
+    }
+
+    unsigned whichElement;
+};
+
+/* Actually, you shouldn't need to sort the population to get the best fitness
+   MS - 17/11/00
+
+   But then again, if another stat needs sorted fitness anyway, getting the best
+   out would be very fast.
+   MK - 09/01/03
+
+template 
+class eoBestFitnessStat : public eoStat
+{
+public :
+    typedef typename EOT::Fitness Fitness;
+
+    eoBestFitnessStat(std::string _description = "Best Fitness") :
+      eoStat(Fitness(), _description) {}
+
+    virtual void operator()(const eoPop& _pop)
+    {
+        value() = _pop.nth_element_fitness(0);
+    }
+
+};
+*/
+
+/**
+   Best fitness of a population. Fitness can be:
+   - double
+   - eoMinimizingFitness or eoMaximizingFitness
+   - eoParetoFitness:
+
+   ( For eoScalarFitnessAssembled look at eoAssembledFitnessStat )
+*/
+
+#ifdef _MSC_VER
+template 
+class eoBestFitnessStat : public eoStat
+#else
+template 
+class eoBestFitnessStat : public eoStat
+#endif
+{
+public:
+
+    using eoStat::value;
+
+    typedef typename EOT::Fitness Fitness;
+
+    eoBestFitnessStat(std::string _description = "Best ")
+        : eoStat(Fitness(), _description)
+        {}
+
+    void operator()(const eoPop& _pop) {
+        doit(_pop, Fitness() ); // specializations for scalar and std::vector
+    }
+
+    virtual std::string className(void) const { return "eoBestFitnessStat"; }
+
+
+private :
+
+    struct CmpFitness
+    {
+      CmpFitness(unsigned _which, bool _maxim) : which(_which), maxim(_maxim) {}
+
+      bool operator()(const EOT& a, const EOT& b)
+      {
+        if (maxim)
+          return a.fitness()[which] < b.fitness()[which];
+
+        return a.fitness()[which] > b.fitness()[which];
+      }
+
+      unsigned which;
+      bool maxim;
+    };
+
+    // Specialization for pareto fitness
+    template 
+    void doit(const eoPop& _pop, eoParetoFitness)
+    {
+      typedef typename EOT::Fitness::fitness_traits traits;
+      value().resize(traits::nObjectives());
+
+      for (unsigned o = 0; o < traits::nObjectives(); ++o)
+      {
+        typename eoPop::const_iterator it = std::max_element(_pop.begin(), _pop.end(), CmpFitness(o, traits::maximizing(o)));
+        value()[o] = it->fitness()[o];
+      }
+    }
+
+    // default
+    template
+    void doit(const eoPop& _pop, T)
+    { // find the largest elements
+      value() = _pop.best_element().fitness();
+    }
+
+};
+
+template 
+class eoDistanceStat : public eoStat
+{
+public:
+
+    using eoDistanceStat< EOT >::value;
+
+    eoDistanceStat(std::string _name = "distance")
+        : eoStat(0.0, _name)
+        {}
+
+    template 
+    double distance(T a, T b)
+    {
+        T res = a-b;
+        return res < 0? -res : res;
+    }
+
+    double distance(bool a, bool b)
+    {
+        return (a==b)? 0 : 1;
+    }
+
+    void operator()(const eoPop& _pop)
+    {
+        double& v = value();
+        v = 0.0;
+
+        for (unsigned i = 0; i < _pop.size(); ++i)
+        {
+            for (unsigned j = 0; j < _pop.size(); ++j)
+            {
+                for (unsigned k = 0; k < _pop[i].size(); ++k)
+                {
+                    v += distance(_pop[i][k], _pop[j][k]);
+                }
+            }
+        }
+
+        double sz = _pop.size();
+        v /= sz * sz * _pop[0].size();
+    }
+  virtual std::string className(void) const { return "eoDistanceStat"; }
+
+};
+
+
+
+/*
+template 
+class eoStdevStat : public eoStat
+{
+public :
+    typedef typename eoSecondMomentStats::SquarePair SquarePair;
+
+    eoStdevStat(std::string _description = "Stdev") : eoStat(0.0, _description) {}
+
+    virtual void operator()(const eoPop& _pop)
+    {
+        SquarePair result = std::accumulate(pop.begin(), pop.end(), std::make_pair(0.0, 0.0), eoSecondMomentStats::sumOfSquares);
+
+        double n = pop.size();
+        value() = sqrt( (result.second - (result.first / n)) / (n - 1.0)); // stdev
+    }
+};
+*/
+#endif
diff --git a/trunk/paradiseo-eo/src/utils/eoState.cpp b/trunk/paradiseo-eo/src/utils/eoState.cpp
new file mode 100644
index 000000000..c5997fe19
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoState.cpp
@@ -0,0 +1,195 @@
+#ifdef _MSC_VER
+#pragma warning(disable:4786)
+#endif
+
+#ifdef HAVE_CONFIG_H
+#include 
+#endif
+
+#include 
+#include 
+#include 
+
+#include "eoState.h"
+#include "eoObject.h"
+#include "eoPersistent.h"
+
+using namespace std;
+
+
+
+void removeComment(string& str, string comment)
+{
+    string::size_type pos = str.find(comment);
+
+    if (pos != string::npos)
+    {
+        str.erase(pos, str.size());
+    }
+}
+
+bool is_section(const string& str, string& name)
+{
+    string::size_type pos = str.find("\\section{");
+
+    if (pos == string::npos)
+        return false;
+    //else
+
+    string::size_type end = str.find("}");
+
+    if (end == string::npos)
+        return false;
+    // else
+
+    name = str.substr(pos + 9, end-9);
+
+    return true;
+}
+
+eoState::~eoState(void)
+{
+    for (unsigned i = 0; i < ownedObjects.size(); ++i)
+    {
+        delete ownedObjects[i];
+    }
+}
+
+void eoState::registerObject(eoPersistent& registrant)
+{
+    string name = createObjectName(dynamic_cast(®istrant));
+
+    pair res = objectMap.insert(make_pair(name, ®istrant));
+
+    if (res.second == true)
+    {
+        creationOrder.push_back(res.first);
+    }
+    else
+    {
+        throw logic_error("Interval error: object already present in the state");
+    }
+}
+
+void eoState::load(const string& _filename)
+{
+    ifstream is (_filename.c_str());
+
+    if (!is)
+    {
+        string str = "Could not open file " + _filename;
+        throw runtime_error(str);
+    }
+
+    load(is);
+}
+
+void eoState::load(std::istream& is)
+{
+    string str;
+    string name;
+
+    getline(is, str);
+
+    if (is.fail())
+    {
+        string str = "Error while reading stream";
+        throw runtime_error(str);
+    }
+
+    while(! is.eof())
+    { // parse section header
+        if (is_section(str, name))
+        {
+            string fullString;
+            ObjectMap::iterator it = objectMap.find(name);
+
+            if (it == objectMap.end())
+            { // ignore
+                while (getline(is, str))
+                {
+                    if (is_section(str, name))
+                        break;
+                }
+            }
+            else
+            {
+
+                eoPersistent* object = it->second;
+
+                // now we have the object, get lines, remove comments etc.
+
+                string fullstring;
+
+                while (getline(is, str))
+                {
+		  if (is.eof())
+		    throw runtime_error("No section in load file");
+		  if (is_section(str, name))
+		    break;
+
+                    removeComment(str, getCommentString());
+                    fullstring += str + "\n";
+                }
+		istringstream the_stream(fullstring);
+                object->readFrom(the_stream);
+            }
+        }
+	else // if (is_section(str, name)) - what if file empty
+	  {
+	    getline(is, str);	// try next line!
+	    //	    if (is.eof())
+	    //	      throw runtime_error("No section in load file");
+	  }
+    }
+
+}
+
+void eoState::save(const string& filename) const
+{ // saves in order of insertion
+    ofstream os(filename.c_str());
+
+    if (!os)
+    {
+        string msg = "Could not open file: " + filename + " for writing!";
+        throw runtime_error(msg);
+    }
+
+    save(os);
+}
+
+void eoState::save(std::ostream& os) const
+{ // saves in order of insertion
+    for (vector::const_iterator it = creationOrder.begin(); it != creationOrder.end(); ++it)
+    {
+        os << "\\section{" << (*it)->first << "}\n";
+        (*it)->second->printOn(os);
+        os << '\n';
+    }
+}
+
+string eoState::createObjectName(eoObject* obj)
+{
+    if (obj == 0)
+    {
+	ostringstream os;
+        os << objectMap.size();
+        return os.str();
+    }
+    // else
+
+    string name = obj->className();
+    ObjectMap::const_iterator it = objectMap.find(name);
+
+    unsigned count = 1;
+    while (it != objectMap.end())
+    {
+	ostringstream os;
+        os << obj->className().c_str() << count++;
+        name = os.str();
+        it = objectMap.find(name);
+    }
+
+    return name;
+}
+
diff --git a/trunk/paradiseo-eo/src/utils/eoState.h b/trunk/paradiseo-eo/src/utils/eoState.h
new file mode 100644
index 000000000..42fb30006
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoState.h
@@ -0,0 +1,135 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoState.h
+// (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef eoState_h
+#define eoState_h
+
+#include 
+#include 
+#include 
+#include 
+
+#include 
+
+class eoObject;
+class eoPersistent;
+
+/**
+ eoState can be used to register derivants of eoPersistent. It will
+ then in turn implement the persistence framework through members load
+ and save, that will call readFrom and printOn for the registrated objects.
+
+ It is derived from eoFunctorStore, so that it also serves as a place where
+ all those nifty eo functors can be stored. This is useful in the case you
+ want to use one of the make_* functions. These functions generally take as their
+ last argument an eoFunctorStore (or a state) which is used to hold all dynamically
+ generated data. Note however, that unlike with eoPersistent derived classes, eoFunctorBase
+ derived classes are not saved or loaded. To govern the creation of functors,
+ command-line parameters (which can be stored) are needed.
+
+*/
+class eoState : public eoFunctorStore
+{
+public :
+
+    eoState(void) {}
+
+    ~eoState(void);
+
+    /**
+    * Object registration function, note that it does not take ownership!
+    */
+    void registerObject(eoPersistent& registrant);
+
+    /**
+    * Copies the object (MUST be derived from eoPersistent)
+    * and returns a reference to the owned object.
+    * Note: it does not register the object, this must be done afterwards!
+    */
+    template 
+    T&   takeOwnership(const T& persistent)
+    {
+        // If the compiler budges here, T is not a subclass of eoPersistent
+        ownedObjects.push_back(new T(persistent));
+        return static_cast(*ownedObjects.back());
+    }
+
+    /**
+    * Loading error thrown when nothing seems to work.
+    */
+    struct loading_error : public std::runtime_error
+    {
+        loading_error(std::string huh = "Error while loading") : std::runtime_error(huh) {}
+    };
+
+    std::string getCommentString(void) const { return "#"; }
+
+    /**
+    * Reads the file specified
+    *
+    *   @param _filename    the name of the file to load from
+    */
+    void load(const std::string& _filename);
+
+    /**
+    * Reads the file specified
+    *
+    *   @param is    the stream to load from
+    */
+    void load(std::istream& is);
+
+    /**
+    * Saves the state in file specified
+    *
+    *   @param _filename    the name of the file to save into
+    */
+    void save(const std::string& _filename) const;
+
+    /**
+    * Saves the state in file specified
+    *
+    *   @param os       the stream to save into
+    */
+    void save(std::ostream& os) const;
+
+private :
+    std::string createObjectName(eoObject* obj);
+
+    // first is Persistent, second is the raw data associated with it.
+    typedef std::map ObjectMap;
+
+    ObjectMap objectMap;
+
+    std::vector creationOrder;
+    std::vector ownedObjects;
+
+    // private copy and assignment as eoState is supposed to be unique
+    eoState(const eoState&);
+    eoState& operator=(const eoState&);
+
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/utils/eoStdoutMonitor.cpp b/trunk/paradiseo-eo/src/utils/eoStdoutMonitor.cpp
new file mode 100644
index 000000000..8120f516b
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoStdoutMonitor.cpp
@@ -0,0 +1,55 @@
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+#include 
+#include 
+#include 
+
+#include 
+#include 
+#include 
+
+using namespace std;
+
+eoMonitor& eoStdoutMonitor::operator()(void)
+{
+    if (!cout)
+    {
+        string str = "eoStdoutMonitor: Could not write to cout";
+        throw runtime_error(str);
+    }
+    if (firsttime)
+    {
+      if (verbose)
+        cout << "First Generation" << endl;
+      else
+	{
+	  for(iterator it = vec.begin(); it != vec.end(); ++it)
+	    {
+	      cout << (*it)->longName() << delim;
+	    }
+	  cout << endl;
+	}
+        firsttime = false;
+    }
+    // ok, now the real saving. write out
+    if (verbose)
+      {
+      for(iterator it = vec.begin(); it != vec.end(); ++it)
+	{
+	  cout << (*it)->longName() << ": " << (*it)->getValue() << '\n';
+	}
+      cout << "\n****** End of Generation ******\n" << endl;
+      }
+    else			// a one-liner
+      {
+	for(iterator it = vec.begin(); it != vec.end(); ++it)
+	  {
+	    cout << (*it)->getValue() << delim;
+	  }
+	cout << endl;
+      }
+    return *this;
+}
diff --git a/trunk/paradiseo-eo/src/utils/eoStdoutMonitor.h b/trunk/paradiseo-eo/src/utils/eoStdoutMonitor.h
new file mode 100644
index 000000000..43335a574
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoStdoutMonitor.h
@@ -0,0 +1,52 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoStdoutMonitor.h
+// (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2000
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoStdoutMonitor_h
+#define _eoStdoutMonitor_h
+
+#include 
+
+#include 
+#include 
+
+/**
+    Prints statistics to stdout
+*/
+class eoStdoutMonitor : public eoMonitor
+{
+public :
+    eoStdoutMonitor(bool _verbose=true, std::string _delim = "\t") : 
+      verbose(_verbose), delim(_delim), firsttime(true) {}
+    eoMonitor& operator()(void);
+
+  virtual std::string className(void) const { return "eoStdoutMonitor"; }
+private :
+  bool verbose;
+  std::string delim;
+  bool firsttime;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/utils/eoTimeCounter.h b/trunk/paradiseo-eo/src/utils/eoTimeCounter.h
new file mode 100644
index 000000000..0ff34ecca
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoTimeCounter.h
@@ -0,0 +1,65 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoTimeCounter.h
+// (c) Marc Schoenauer, Maarten Keijzer, and GeNeura Team, 2002
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@inria.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoTimeCounter_h
+#define _eoTimeCounter_h
+
+#include 
+#include 
+
+
+/**
+    An eoStat that simply gives the user time since first generation
+    It has to be tempatized by EOT because it must be an eoStat
+*/
+class eoTimeCounter : public eoUpdater, public eoValueParam
+{
+public:
+  eoTimeCounter() : eoValueParam(0.0, "Time") // : firstTime(true)  
+  {}
+
+  /** simply stores the time spent in process in its value() */    
+  virtual void operator()()
+  {
+    // ask for system time
+    utime = clock();
+//     if (firstTime)	/* first generation */
+//       {
+// 	firstTime=false;
+// 	firstUtime = tmsStruct.tms_utime;
+//       }
+    // store elapsed user time
+//     value(tmsStruct.tms_utime - firstUtime);
+    value()=double(utime)/CLOCKS_PER_SEC;
+  }
+  
+private:
+//   bool firstTime;
+//   clock_t firstUtime;
+  clock_t utime;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/utils/eoTimedMonitor.h b/trunk/paradiseo-eo/src/utils/eoTimedMonitor.h
new file mode 100644
index 000000000..f4454bc8b
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoTimedMonitor.h
@@ -0,0 +1,76 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoTimedMonitor.h
+// (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2005
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoTimedMonitor_h
+#define _eoTimedMonitor_h
+
+#include 
+
+#include 
+#include 
+#include 
+
+/**
+    Holds a collection of monitors and only fires them when a time limit
+    has been reached
+*/
+class eoTimedMonitor : public eoMonitor
+{
+public :
+    eoTimedMonitor(int seconds_) : seconds(seconds_), last_tick(0) {}
+    
+    eoMonitor& operator()(void) {
+	bool monitor = false;
+	if (last_tick == 0) {
+	    monitor = true;
+	    last_tick = clock();
+	}
+
+	clock_t tick = clock();
+
+	if ( (tick-last_tick) >= seconds * CLOCKS_PER_SEC) {
+	    monitor = true;
+	}
+
+	if (monitor) {
+	    for (unsigned i = 0; i < monitors.size(); ++i) {
+		(*monitors[i])();
+	    }
+	    last_tick = clock();
+	}
+	return *this;
+    }
+
+    void add(eoMonitor& mon) { monitors.push_back(&mon); }
+    
+  virtual std::string className(void) const { return "eoTimedMonitor"; }
+private :
+  clock_t last_tick;
+  int seconds;
+  std::vector monitors;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/utils/eoUniformInit.h b/trunk/paradiseo-eo/src/utils/eoUniformInit.h
new file mode 100644
index 000000000..7960339f7
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoUniformInit.h
@@ -0,0 +1,155 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+  -----------------------------------------------------------------------------
+  eoUniformInit.h
+
+ (c) Maarten Keijzer, GeNeura Team, Marc Schoenauer, 1999 - 2002
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@inria.fr
+ */
+
+//-----------------------------------------------------------------------------
+/** Copied from the eoRndGenerators to have objects deriving from eoInit 
+ * As the whole initialization mechanism in EO is based on eoInit rather than 
+ * eoRndGenerators, we might as well have these directly written without
+ * overhead
+
+@classes:  
+  eoUniformInit     uniform initialization for doubles, floats, ints, ...
+  eoBooleanInit     biased init for booleans
+  eoNormalInit      normal intialization for doubles and floats
+  eoNegExpInit      negative exponential distributions    "
+*/
+
+#ifndef eoUniformInit_h
+#define eoUniformInit_h
+
+#include "eoRNG.h"
+#include "eoInit.h"
+#include "eoRealBounds.h"
+#include 
+
+using eo::rng;
+
+/**
+   The class eoUniformInit can be used in the STL apply function
+   to easily randomize floats and doubles. It can also
+   be used for ints and unsigneds by virtue of the static_cast
+
+   Also present is a specialization for boolean, that will
+   ignore the minima and maxima that are possibly set and will
+   return an unbiased flip of a coin. For a biased flip, use the eoBoolean
+
+   either in [0, _max) if only 1 value (_max) is given
+                       (or none, as _max defaults to 1.0)
+   or in [_min,_max) if 2 values are given (_min, _max)
+*/
+template  class eoUniformInit : public eoInit
+{
+  public :
+  /** Ctor with only a max bound */
+  eoUniformInit(T _max = T(1.0), eoRng& _rng = rng) :
+    minim(T(0.0)), range(_max), uniform(_rng) 
+  {}
+  
+  /** Ctor with an eoRealBound */
+  eoUniformInit(eoRealBounds & _bound, eoRng& _rng = rng) :
+    minim(_bound.minimum()), range(_bound.range()), uniform(_rng)
+  {}
+  
+  /** Ctor with explicit min and max */
+  eoUniformInit(T _min, T _max, eoRng& _rng = rng) :
+    minim(_min), range(_max-_min), uniform(_rng)
+  {
+    if (_min>_max)
+      throw std::logic_error("Min is greater than Max in uniform_generator");
+  }
+  
+  /**
+     Generates the number, uses a static_cast to get the right behaviour
+     for ints and unsigneds
+  */
+  void operator()(T & _t) 
+  { 
+    _t = minim+static_cast(uniform.uniform(range)); 
+  }
+
+private :
+  T minim;
+  T range;
+  eoRng& uniform;
+};
+
+
+/** Specialization for bool, does an unbiased coin flip */
+template <>
+inline void eoUniformInit::operator()(bool & _b)
+{
+    _b = uniform.flip(0.5);
+}
+
+/**
+   The class eoBooleanInit can be used in the STL apply function
+   to easily generate random booleans with a specified bias
+*/
+class eoBooleanInit : public eoInit
+{
+  public :
+  eoBooleanInit(float _bias = 0.5, eoRng& _rng = rng) : bias(_bias), gen(_rng) {}
+
+  void operator()(bool & _b) { _b = gen.flip(bias); }
+  private :
+  float bias;
+  eoRng& gen;
+};
+
+/**
+   The class normal_generator can be used in the STL generate function
+   to easily generate gaussian distributed floats and doubles. The user
+   can supply a standard deviation which defaults to 1.
+*/
+template  class eoNormalInit : public eoInit
+{
+  public :
+    eoNormalInit(T _stdev = T(1.0), eoRng& _rng = rng) : stdev(_stdev), normal(_rng) {}
+
+  void operator()(T & _t) { _t = (T) normal.normal(stdev); }
+
+  private :
+    T stdev;
+  eoRng& normal;
+};
+
+/**
+   The class negexp_generator can be used in the STL generate function
+   to easily generate negative exponential distributed floats and doubles. The user
+   can supply a mean.
+*/
+template  class eoNegExpInit : public eoInit
+{
+  public :
+    eoNegExpInit(T _mean = 1.0, eoRng& _rng = rng) : mean(_mean), negexp(_rng) {}
+
+  void operator()(T & _t) { _t = (T) negexp.negexp(mean); }
+
+  private :
+    T mean;
+  eoRng& negexp;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/utils/eoUpdatable.h b/trunk/paradiseo-eo/src/utils/eoUpdatable.h
new file mode 100644
index 000000000..7c53143ca
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoUpdatable.h
@@ -0,0 +1,111 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoUpdatable.h
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2000
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoUpdatable_h
+#define _eoUpdatable_h
+
+#include 
+
+/**
+    eoUpdatable is a generic class for adding updatation to an existing class
+    Just says it has an update() method
+*/
+class eoUpdatable
+{
+public:
+
+    /** @brief Virtual destructor */
+    virtual ~eoUpdatable() {};
+
+    virtual void update() = 0;
+};
+
+
+
+/**
+   A base class to actually update an eoUpdatable object
+*/
+class eoDynUpdater : public eoUpdater
+{public :
+    eoDynUpdater(eoUpdatable & _toUpdate) : toUpdate(_toUpdate) {};
+
+    virtual void operator()()
+    {
+        toUpdate.update();
+    }
+
+private:
+    eoUpdatable& toUpdate;
+};
+
+/**
+   An eoUpdater to update an eoUpdatable object every given time interval
+*/
+class eoTimedDynUpdate : public eoDynUpdater
+{
+public :
+    eoTimedDynUpdate(eoUpdatable & _toUpdate, time_t _interval) :
+    eoDynUpdater(_toUpdate),
+        interval(_interval), last_time(time(0)), first_time(time(0)) {}
+
+    void operator()(void)
+      {
+	time_t now = time(0);
+
+	if (now >= last_time + interval)
+	  {
+	    last_time = now;
+	    eoDynUpdater::operator() ();
+	  }
+      }
+private :
+    const time_t interval;
+    time_t last_time;
+    const time_t first_time;
+};
+
+/**
+   An eoUpdater to update an eoUpdatable object every given tic
+*/
+class eoCountedDynUpdate : public eoDynUpdater
+{
+public :
+    eoCountedDynUpdate(eoUpdatable & _toUpdate, unsigned _interval)
+        : eoDynUpdater(_toUpdate), interval(_interval), counter(0) {}
+
+    void operator()(void)
+      {
+	if (++counter % interval == 0)
+	  {
+	    eoDynUpdater::operator() ();
+	  }
+      }
+private :
+    const unsigned interval;
+    unsigned counter;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/utils/eoUpdater.cpp b/trunk/paradiseo-eo/src/utils/eoUpdater.cpp
new file mode 100644
index 000000000..fa6ca109c
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoUpdater.cpp
@@ -0,0 +1,48 @@
+#ifdef _MSC_VER
+#pragma warning(disable:4786)
+#endif
+
+#ifdef HAVE_CONFIG_H
+#include 
+#endif
+
+#include 
+
+#include 
+#include 
+
+using namespace std;
+
+void eoTimedStateSaver::operator()(void)
+{
+    time_t now = time(0);
+
+    if (now >= last_time + interval)
+    {
+        last_time = now;
+	ostringstream os;
+        os << prefix << (now - first_time) << '.' << extension;
+        state.save(os.str());
+    }
+}
+
+void eoCountedStateSaver::doItNow(void)
+{
+	ostringstream os;
+        os << prefix << counter << '.' << extension;
+        state.save(os.str());
+}
+
+void eoCountedStateSaver::operator()(void)
+{
+    if (++counter % interval == 0)
+      doItNow();
+}
+
+void eoCountedStateSaver::lastCall(void)
+{
+    if (saveOnLastCall)
+      doItNow();
+}
+
+
diff --git a/trunk/paradiseo-eo/src/utils/eoUpdater.h b/trunk/paradiseo-eo/src/utils/eoUpdater.h
new file mode 100644
index 000000000..f8597c14c
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/eoUpdater.h
@@ -0,0 +1,157 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoUpdater.h
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2000
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _eoUpdater_h
+#define _eoUpdater_h
+
+#include 
+#include 
+#include 
+#include 
+
+/**
+    eoUpdater is a generic procudere for updating whatever you want.
+    Yet again an empty name
+*/
+class eoUpdater : public eoF
+{
+public:
+  virtual void lastCall() {}
+  virtual std::string className(void) const { return "eoUpdater"; }
+};
+
+/**
+   an eoUpdater that simply increments a counter
+*/
+template 
+class eoIncrementor : public eoUpdater
+{public :
+  /** Default Ctor - requires a reference to the thing to increment */
+    eoIncrementor(T& _counter, T _stepsize = 1) : counter(_counter), stepsize(_stepsize) {}
+
+  /** Simply increments */
+    virtual void operator()()
+    {
+        counter += stepsize;
+    }
+
+  virtual std::string className(void) const { return "eoIncrementor"; }
+private:
+    T& counter;
+    T stepsize;
+};
+
+/** an eoUpdater that is an eoValueParam (and thus OWNS its counter)
+ *  Mandatory for generation counter in make_checkpoint
+*/
+template 
+class eoIncrementorParam : public eoUpdater, public eoValueParam
+{
+public:
+
+    using eoValueParam::value;
+
+  /** Default Ctor : a name and optionally an increment*/
+  eoIncrementorParam( std::string _name, T _stepsize = 1) :
+    eoValueParam(T(0), _name), stepsize(_stepsize) {}
+
+  /** Ctor with a name and non-zero initial value
+   *  and mandatory stepSize to remove ambiguity
+   */
+  eoIncrementorParam( std::string _name, T _countValue, T _stepsize) :
+    eoValueParam(_countValue, _name), stepsize(_stepsize) {}
+
+  /** Simply increments */
+  virtual void operator()()
+  {
+      value() += stepsize;
+  }
+
+  virtual std::string className(void) const { return "eoIncrementorParam"; }
+
+private:
+  T stepsize;
+};
+
+#include 
+
+/**
+   an eoUpdater that saves a state every given time interval
+*/
+class eoTimedStateSaver : public eoUpdater
+{
+public :
+    eoTimedStateSaver(time_t _interval, const eoState& _state, std::string _prefix = "state", std::string _extension = "sav") : state(_state),
+        interval(_interval), last_time(time(0)), first_time(time(0)),
+    prefix(_prefix), extension(_extension) {}
+
+    void operator()(void);
+
+  virtual std::string className(void) const { return "eoTimedStateSaver"; }
+private :
+    const eoState& state;
+
+    const time_t interval;
+    time_t last_time;
+    const time_t first_time;
+    const std::string prefix;
+    const std::string extension;
+};
+
+/**
+   an eoUpdater that saves a state every given generations
+*/
+class eoCountedStateSaver : public eoUpdater
+{
+public :
+    eoCountedStateSaver(unsigned _interval, const eoState& _state, std::string _prefix, bool _saveOnLastCall, std::string _extension = "sav", unsigned _counter = 0)
+      : state(_state), interval(_interval), counter(_counter),
+      saveOnLastCall(_saveOnLastCall),
+      prefix(_prefix), extension(_extension) {}
+
+    eoCountedStateSaver(unsigned _interval, const eoState& _state, std::string _prefix = "state", std::string _extension = "sav", unsigned _counter = 0)
+      : state(_state), interval(_interval), counter(_counter),
+	saveOnLastCall(true),
+	prefix(_prefix), extension(_extension) {}
+
+    virtual void lastCall(void);
+    void operator()(void);
+
+  virtual std::string className(void) const { return "eoCountedStateSaver"; }
+private :
+    void doItNow(void);
+
+    const eoState& state;
+    const unsigned interval;
+    unsigned counter;
+    bool saveOnLastCall;
+
+    const std::string prefix;
+    const std::string extension;
+};
+
+
+#endif
diff --git a/trunk/paradiseo-eo/src/utils/make_help.cpp b/trunk/paradiseo-eo/src/utils/make_help.cpp
new file mode 100644
index 000000000..1d7b2e5c2
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/make_help.cpp
@@ -0,0 +1,109 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_help.h
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+#ifdef _MSC_VER
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif 
+
+#include 
+#include 
+#include 
+
+using namespace std;
+
+/** Generation of the status file, and output of the help message if needed
+ *
+ * MUST be called after ALL parameters have been read in order to list them
+ *
+ * Warning: this is a plain .cpp file and shoudl NOT be included anywhere, 
+ * but compiled separately and stored in a library.
+ *
+ * It is declared in all make_xxx.h files in representation-dependent dirs
+ * but it is NOT representation-dependent itself - that's why it's in utils
+ */
+void make_help(eoParser & _parser)
+{
+    // name of the "status" file where all actual parameter values will be saved
+    string str_status = _parser.ProgramName() + ".status"; // default value
+    eoValueParam& statusParam = _parser.createParam(str_status, "status","Status file",'\0', "Persistence" );
+
+    // dump status file BEFORE help, so the user gets a chance to use it:
+    // it's probably the case where she/he needs it most!!!
+    // Only help parameter will not be in status file - but who cares???
+    if (statusParam.value() != "")
+      {
+	ofstream os(statusParam.value().c_str());
+	os << _parser;		// and you can use that file as parameter file
+      }
+   // do the following AFTER ALL PARAMETERS HAVE BEEN PROCESSED
+   // i.e. in case you need parameters somewhere else, postpone these
+    if (_parser.userNeedsHelp())
+      {
+        _parser.printHelp(cout);
+	cout << "You can use an edited copy of file " << statusParam.value() 
+	     << " as parameter file" << endl;
+        exit(1);
+      }
+}
+
+/** test a dir. 
+ *  Creates it if does not exist
+ *  If exists, throws an exception or erase everything there, 
+ *     depending on last parameter
+ *
+ * Always return true (for code easy writing on the other side :-)
+ */
+bool testDirRes(std::string _dirName, bool _erase=true)
+{
+  string s = "test -d " + _dirName;
+  int res = system(s.c_str());
+  // test for (unlikely) errors
+  if ( (res==-1) || (res==127) )
+    {
+      s = "Problem executing test of dir " + _dirName;
+      throw runtime_error(s);
+    }
+  // now make sure there is a dir without any file in it - or quit
+  if (res)                    // no dir present
+    {
+      s = string("mkdir ")+ _dirName;
+      system(s.c_str());
+      return true;
+    }
+  //  else
+  if (_erase)			   // OK to erase
+    {
+      s = string("/bin/rm ")+ _dirName + "/*";
+      system(s.c_str());
+      return true;
+    }
+  //else
+  // WARNING: bug if dir exists and is empty; this says it is not!
+  // shoudl use scandir instead - no time now :-(((    MS Aug. 01
+  s = "Dir " + _dirName + " is not empty";
+  throw runtime_error(s);
+  return true;
+}
diff --git a/trunk/paradiseo-eo/src/utils/pipecom.cpp b/trunk/paradiseo-eo/src/utils/pipecom.cpp
new file mode 100644
index 000000000..e331eb578
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/pipecom.cpp
@@ -0,0 +1,172 @@
+/* ----------------------------------------------------------------------
+ * Where........: CMAP - Polytechnique
+ * File.........: pipecom.c
+ * Author.......: Bertrand Lamy (Equipe genetique)
+ * Created......: Mon Mar 13 13:50:11 1995
+ * Description..: Communication par pipe bidirectionnel avec un autre process
+ * ----------------------------------------------------------------------
+ */
+
+// MSC equivalent must be written and tested or some #idef instructions added
+// with a clear message at compile time that this is for Unix only ???
+
+#ifdef HAVE_CONFIG_H
+#include 
+#endif
+
+#include 
+#include 
+#include 
+#include 
+#include 
+
+#include "pipecom.h"
+
+
+
+int Check( PCom *com )
+{
+    if( ! com ) {
+	fprintf( stderr, "PipeCom: Null pointer.\n" );
+	fflush( stderr );
+	return 0;
+    }
+    if( kill( com->pid, 0 ) != 0 ) {
+	fprintf( stderr, "PipeCom: process doesn't exists.\n" );
+	fflush( stderr );
+	return 0;
+    }
+    return 1;
+}
+
+
+PCom * PipeComOpen( char *prog )
+{
+    char	*args[2];
+    args[0] = prog;
+    args[1] = NULL;
+    return PipeComOpenArgv( prog, args );
+}
+
+
+PCom * PipeComOpenArgv( char *prog, char *argv[] )
+{
+    int		toFils[2];
+    int		toPere[2];
+    int		sonPid;
+    PCom	* ret = NULL;
+
+    if( pipe( toFils ) < 0 ) {
+	perror( "PipeComOpen: Creating pipes" );
+	return ret;
+    }
+    if( pipe( toPere ) < 0 ) {
+	perror( "PipeComOpen: Creating pipes" );
+	return ret;
+    }
+
+    switch( (sonPid = vfork()) ) {
+    case -1:
+	perror("PipeComOpen: fork failed" );
+	return ret;
+	break;
+
+    case 0:
+	/* --- Here's the son --- */
+	/* --- replace old stdin --- */
+	if( dup2( toFils[0], fileno(stdin) ) < 0 ) {
+	    perror( "PipeComOpen(son): could not connect" );
+	    exit( -1 );
+	    /* --- AVOIR: kill my father --- */
+	}
+	if( dup2( toPere[1], fileno(stdout) ) < 0 ) {
+	    perror( "PipeComOpen(son): could not connect" );
+	    exit( -1 );
+	}
+	if( execvp( prog, argv ) < 0 ) {
+	    perror( prog );
+	    perror( "PipeComOpen: can't exec" );
+	    exit(1);
+	}
+	break;
+    default:
+	ret = (PCom *) malloc( sizeof(PCom) );
+	if( ! ret )
+	    return NULL;
+
+	ret->fWrit = (FILE *)fdopen( toFils[1], "w" );
+	ret->fRead = (FILE *)fdopen( toPere[0], "r" );
+	ret->pid = sonPid;
+    }
+    return ret;
+}
+
+
+int PipeComSend( PCom *to, const char *line )
+{
+    int	nb = 0;
+    if( ! Check(to ) )
+	return nb;
+    nb = fprintf( to->fWrit, line );
+    fflush( to->fWrit );
+    return nb;
+}
+
+
+int PipeComSendn( PCom *to, const char *data, int n )
+{
+    int	nb = 0;
+    if( ! Check(to) )
+	return nb;
+
+    nb = fwrite( data, 1, n, to->fWrit );
+    fflush( to->fWrit );
+    return nb;
+}
+
+
+int PipeComReceive( PCom *from, char *data, int max )
+{
+    if( ! Check(from) )
+	return 0;
+    if( ! data ) {
+      fprintf( stderr, "PipeComReceive: Invalid data pointer\n" );
+      fflush( stderr );
+      return 0;
+    }
+    if( fgets( data, max, from->fRead ) )
+	return strlen(data);
+    return 0;
+}
+
+
+
+int PipeComClose( PCom *to )
+{
+    if( ! Check(to) )
+	return 0;
+    fclose( to->fRead );
+    fclose( to->fWrit );
+    free( to );
+    return 1;
+}
+
+
+
+int PipeComWaitFor( PCom *from, char *what )
+{
+    char	buffer[256];
+    do {
+	if( ! PipeComReceive( from, buffer, 256 ) )
+	    return 0;
+    } while( strcmp( buffer, what ) );
+    return 1;
+}
+
+
+
+// Local Variables:
+// coding: iso-8859-1
+// c-file-style: "Stroustrup"
+// fill-column: 80
+// End:
diff --git a/trunk/paradiseo-eo/src/utils/pipecom.h b/trunk/paradiseo-eo/src/utils/pipecom.h
new file mode 100644
index 000000000..56b031708
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/pipecom.h
@@ -0,0 +1,47 @@
+/* ----------------------------------------------------------------------
+ * Where........: CMAP - Polytechnique
+ * File.........: pipecom.h
+ * Author.......: Bertrand Lamy (EEAAX)
+ * Created......: Thu Mar  9 17:21:15 1995
+ * Description..: Pipe communication with a process
+ * ----------------------------------------------------------------------
+ */
+
+// This file cannot be used from C any more due to some const additions.
+// However, if you remove the const, it should work in C as well.
+
+#ifndef EO_PIPECOM_H
+#define EO_PIPECOM_H
+
+#include 
+
+
+typedef struct PipeCommunication {
+    FILE	*fWrit;
+    FILE	*fRead;
+    int		pid;
+} PCom;
+
+
+extern PCom *PipeComOpen( char *prog );
+extern PCom *PipeComOpenArgv( char *prog, char *argv[] );
+
+extern int PipeComSend( PCom *to, const char *line );
+extern int PipeComSendn( PCom *to, const char *data, int n );
+
+extern int PipeComReceive( PCom *from, char *data, int max );
+
+extern int PipeComClose( PCom *to );
+extern int PipeComWaitFor( PCom *from, char *what );
+
+
+#endif // EO_PIPECOM_H
+
+
+
+// Local Variables:
+// coding: iso-8859-1
+// mode: C++
+// c-file-style: "Stroustrup"
+// fill-column: 80
+// End:
diff --git a/trunk/paradiseo-eo/src/utils/rnd_generators.h b/trunk/paradiseo-eo/src/utils/rnd_generators.h
new file mode 100644
index 000000000..a85283211
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/rnd_generators.h
@@ -0,0 +1,168 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+  -----------------------------------------------------------------------------
+  rnd_generators.h
+    Some utility functors for generating random generators:
+        uniform_generator : generates uniform floats or doubles
+        random_generator  : generates unsigneds, ints etc.
+        normal_generator  : normally distributed floats or doubles
+
+ (c) Maarten Keijzer (mak@dhi.dk) and GeNeura Team, 1999, 2000
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+
+//-----------------------------------------------------------------------------
+
+#ifndef eoRND_GENERATORS_H
+#define eoRND_GENERATORS_H
+
+#include "eoRNG.h"
+#include 
+
+/**
+   The class uniform_generator can be used in the STL generate function
+   to easily generate random floats and doubles
+   either in [0, _max) if only 1 value (_max) is given
+                       (or none, as _max defaults to 1.0)
+   or in [_min,_max) if 2 values are given (_min, _max)
+*/
+template  class uniform_generator
+{
+  // added new ctor with 2 params, and modified the data to minim and range
+  // (was maxim only). MS 3/11/2000
+  public :
+    uniform_generator(T _max = T(1.0), eoRng& _rng = rng) :
+      minim(T(0.0)), range(_max), uniform(_rng) {}
+    uniform_generator(T _min, T _max, eoRng& _rng = rng) :
+      minim(_min), range(_max-_min), uniform(_rng)
+  {
+    if (_min>_max)
+      throw std::logic_error("Min is greater than Max in uniform_generator");
+  }
+
+  T operator()(void) { return minim+static_cast(uniform.uniform(range)); }
+
+private :
+  T minim;
+  T range;
+  eoRng& uniform;
+};
+
+/**
+   The class boolean_generator can be used in the STL generate function
+   to easily generate random booleans with a specified bias
+*/
+class boolean_generator
+{
+  public :
+    boolean_generator(float _bias = 0.5, eoRng& _rng = rng) : bias(_bias), gen(_rng) {}
+
+  bool operator()(void) { return gen.flip(bias); }
+  private :
+  float bias;
+  eoRng& gen;
+};
+
+/**
+   The class random_generator can be used in the STL generate function
+   to easily generate random ints
+   either between [0, _max) if only one value (_max) is given to the ctor
+   or in [_min,_max) if 2 values are given (_min, _max)
+*/
+template  class random_generator
+{
+  public :
+  // added new ctor with 2 params, and modified the data to minim and range
+  // (was maxim only). MS 3/11/2000
+    random_generator(T _max, eoRng& _rng = rng) :
+      minim(T(0.0)), range(_max), random(_rng) {}
+    random_generator(T _min, T _max, eoRng& _rng = rng) :
+      minim(_min), range(_max-_min), random(_rng)
+  {
+    if (_min>_max)
+      throw std::logic_error("Min is greater than Max in random_generator");
+  }
+
+  T operator()(void) { return (T) (minim + random.random(range)); }
+
+private :
+  T minim;
+  T range;
+  eoRng& random;
+};
+
+/// Specialization for bool
+template <>
+inline bool random_generator::operator()(void)
+{
+    return random.flip(0.5);
+}
+
+/**
+   Another class random_generator that can be used in the STL random_shuffle
+   function (see eoPop::shuffle): its operator() takes an unsigned argument m
+   and  must return an unsigned uniformly distributed in [0,m}
+*/
+template  class UF_random_generator
+{
+  public :
+    UF_random_generator(eoRng& _rng = rng) :
+      random(_rng) {}
+
+  T operator()(T _t) { return (T) (random.random(_t)); }
+
+private :
+  eoRng& random;
+};
+
+
+/**
+   The class normal_generator can be used in the STL generate function
+   to easily generate gaussian distributed floats and doubles. The user
+   can supply a standard deviation which defaults to 1.
+*/
+template  class normal_generator
+{
+  public :
+    normal_generator(T _stdev = T(1.0), eoRng& _rng = rng) : stdev(_stdev), normal(_rng) {}
+
+  T operator()(void) { return (T) normal.normal(stdev); }
+
+  private :
+    T stdev;
+  eoRng& normal;
+};
+
+/**
+   The class negexp_generator can be used in the STL generate function
+   to easily generate negative exponential distributed floats and doubles. The user
+   can supply a mean.
+*/
+template  class negexp_generator
+{
+  public :
+    negexp_generator(T _mean = 1.0, eoRng& _rng = rng) : mean(_mean), negexp(_rng) {}
+
+  T operator()(void) { return (T) negexp.negexp(mean); }
+
+  private :
+    T mean;
+  eoRng& negexp;
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/src/utils/selectors.h b/trunk/paradiseo-eo/src/utils/selectors.h
new file mode 100644
index 000000000..86f2a0a6d
--- /dev/null
+++ b/trunk/paradiseo-eo/src/utils/selectors.h
@@ -0,0 +1,338 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+  -----------------------------------------------------------------------------
+  selectors.h
+    A bunch of useful selector functions. They generally have three forms:
+
+    template 
+    It select(It begin, It end, params, eoRng& gen = rng);
+
+    template 
+    const EOT& select(const eoPop& pop, params, eoRng& gen = rng);
+
+    template 
+    EOT& select(eoPop& pop, params, eoRng& gen = rng);
+
+    where select is one of: roulette_wheel, deterministic_tournament
+    and stochastic_tournament (at the moment).
+
+ (c) Maarten Keijzer (mak@dhi.dk) and GeNeura Team, 1999, 2000
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+ */
+
+#ifndef SELECT__H
+#define SELECT__H
+
+#include 
+
+#include "eoRNG.h"
+#include 
+/**
+\defgroup selectors
+*/
+
+template 
+bool minimizing_fitness()
+{
+    EOT eo1; // Assuming people don't do anything fancy in the default constructor!
+    EOT eo2;
+
+    /* Dear user, when the two line below do not compile you are most
+       likely not working with scalar fitness values. In that case we're sorry
+       but you cannot use lottery or roulette_wheel selection...
+    */
+
+#ifdef _MSC_VER
+    eo1.fitness( EOT::Fitness(0.0) );
+    eo2.fitness( EOT::Fitness(1.0) );
+#else
+    eo1.fitness( typename EOT::Fitness(0.0) ); // tried to cast it to an EOT::Fitness, but for some reason GNU barfs on this
+    eo2.fitness( typename EOT::Fitness(1.0) );
+#endif
+
+    return eo2 < eo1; // check whether we have a minimizing fitness
+}
+
+inline double scale_fitness(const std::pair& _minmax, double _value)
+{
+    if (_minmax.first == _minmax.second)
+    {
+        return 0.0; // no differences in fitness, population converged!
+    }
+    // else
+
+    return (_value - _minmax.first) / (_minmax.second - _minmax.first);
+}
+
+template 
+double sum_fitness(It begin, It end)
+{
+    double sum = 0.0;
+
+    for (; begin != end; ++begin)
+    {
+        double v = static_cast(begin->fitness());
+        if (v < 0.0)
+            throw std::logic_error("sum_fitness: negative fitness value encountered");
+        sum += v;
+    }
+
+    return sum;
+}
+
+template 
+double sum_fitness(const eoPop& _pop)
+{
+    return sum_fitness(_pop.begin(), _pop.end());
+}
+
+template 
+double sum_fitness(const eoPop& _pop, std::pair& _minmax)
+{
+    double rawTotal, scaledTotal;
+
+    typename eoPop::const_iterator it = _pop.begin();
+
+    _minmax.first = it->fitness();
+    _minmax.second = it++->fitness();
+
+    for(; it != _pop.end(); ++it)
+    {
+        double v = static_cast(it->fitness());
+
+        _minmax.first = std::min(_minmax.first, v);
+        _minmax.second = std::max(_minmax.second, v);
+
+        rawTotal += v;
+    }
+
+    if (minimizing_fitness())
+    {
+        std::swap(_minmax.first, _minmax.second);
+    }
+
+    scaledTotal = 0.0;
+
+    // unfortunately a second loop is neccessary to scale the fitness
+    for (it = _pop.begin(); it != _pop.end(); ++it)
+    {
+        double v = scale_fitness(_minmax, static_cast(it->fitness()));
+
+        scaledTotal += v;
+    }
+
+    return scaledTotal;
+}
+
+template 
+It roulette_wheel(It _begin, It _end, double total, eoRng& _gen = rng)
+{
+
+    float roulette = _gen.uniform(total);
+
+    if (roulette == 0.0)	   // covers the case where total==0.0
+      return _begin + _gen.random(_end - _begin); // uniform choice
+
+    It i = _begin;
+
+    while (roulette > 0.0)
+    {
+	    roulette -= static_cast(*(i++));
+    }
+
+    return --i;
+}
+
+template 
+const EOT& roulette_wheel(const eoPop& _pop, double total, eoRng& _gen = rng)
+{
+    float roulette = _gen.uniform(total);
+
+    if (roulette == 0.0)	   // covers the case where total==0.0
+      return _pop[_gen.random(_pop.size())]; // uniform choice
+
+    typename eoPop::const_iterator i = _pop.begin();
+
+    while (roulette > 0.0)
+    {
+	    roulette -= static_cast((i++)->fitness());
+    }
+
+    return *--i;
+}
+
+template 
+EOT& roulette_wheel(eoPop& _pop, double total, eoRng& _gen = rng)
+{
+    float roulette = _gen.uniform(total);
+
+    if (roulette == 0.0)	   // covers the case where total==0.0
+      return _pop[_gen.random(_pop.size())]; // uniform choice
+
+    typename eoPop::iterator i = _pop.begin();
+
+    while (roulette > 0.0)
+    {
+	    roulette -= static_cast((i++)->fitness());
+    }
+
+    return *--i;
+}
+
+template 
+It deterministic_tournament(It _begin, It _end, unsigned _t_size, eoRng& _gen = rng)
+{
+    It best = _begin + _gen.random(_end - _begin);
+
+    for (unsigned i = 0; i < _t_size - 1; ++i)
+    {
+        It competitor = _begin + _gen.random(_end - _begin);
+
+        if (*best < *competitor)
+	{
+            best = competitor;
+        }
+    }
+
+    return best;
+}
+
+template 
+const EOT& deterministic_tournament(const eoPop& _pop, unsigned _t_size, eoRng& _gen = rng)
+{
+    return *deterministic_tournament(_pop.begin(), _pop.end(), _t_size, _gen);
+}
+
+template 
+EOT& deterministic_tournament(eoPop& _pop, unsigned _t_size, eoRng& _gen = rng)
+{
+    return *deterministic_tournament(_pop.begin(), _pop.end(), _t_size, _gen);
+}
+
+template 
+It inverse_deterministic_tournament(It _begin, It _end, unsigned _t_size, eoRng& _gen = rng)
+{
+    It worst = _begin + _gen.random(_end - _begin);
+
+    for (unsigned i = 1; i < _t_size; ++i)
+    {
+        It competitor = _begin + _gen.random(_end - _begin);
+
+        if (competitor == worst)
+        {
+            --i;
+            continue; // try again
+        }
+
+        if (*competitor < *worst)
+        {
+            worst = competitor;
+        }
+    }
+
+    return worst;
+}
+
+template 
+const EOT& inverse_deterministic_tournament(const eoPop& _pop, unsigned _t_size, eoRng& _gen = rng)
+{
+    return *inverse_deterministic_tournament(_pop.begin(), _pop.end(), _t_size, _gen);
+}
+
+template 
+EOT& inverse_deterministic_tournament(eoPop& _pop, unsigned _t_size, eoRng& _gen = rng)
+{
+    return *inverse_deterministic_tournament(_pop.begin(), _pop.end(), _t_size, _gen);
+}
+
+template 
+It stochastic_tournament(It _begin, It _end, double _t_rate, eoRng& _gen = rng)
+{
+  It i1 = _begin + _gen.random(_end - _begin);
+  It i2 = _begin + _gen.random(_end - _begin);
+
+  bool return_better = _gen.flip(_t_rate);
+
+  if (*i1 < *i2)
+  {
+      if (return_better) return i2;
+      // else
+
+      return i1;
+   }
+    else
+    {
+      if (return_better) return i1;
+      // else
+    }
+    // else
+
+    return i2;
+}
+
+template 
+const EOT& stochastic_tournament(const eoPop& _pop, double _t_rate, eoRng& _gen = rng)
+{
+    return *stochastic_tournament(_pop.begin(), _pop.end(), _t_rate, _gen);
+}
+
+template 
+EOT& stochastic_tournament(eoPop& _pop, double _t_rate, eoRng& _gen = rng)
+{
+    return *stochastic_tournament(_pop.begin(), _pop.end(), _t_rate, _gen);
+}
+
+template 
+It inverse_stochastic_tournament(It _begin, It _end, double _t_rate, eoRng& _gen = rng)
+{
+  It i1 = _begin + _gen.random(_end - _begin);
+  It i2 = _begin + _gen.random(_end - _begin);
+
+  bool return_worse = _gen.flip(_t_rate);
+
+  if (*i1 < *i2)
+  {
+      if (return_worse) return i1;
+      // else
+
+      return i2;
+   }
+    else
+    {
+      if (return_worse) return i2;
+      // else
+    }
+    // else
+
+    return i1;
+}
+
+template 
+const EOT& inverse_stochastic_tournament(const eoPop& _pop, double _t_rate, eoRng& _gen = rng)
+{
+    return *inverse_stochastic_tournament(_pop.begin(), _pop.end(), _t_rate, _gen);
+}
+
+template 
+EOT& inverse_stochastic_tournament(eoPop& _pop, double _t_rate, eoRng& _gen = rng)
+{
+    return *inverse_stochastic_tournament(_pop.begin(), _pop.end(), _t_rate, _gen);
+}
+
+
+#endif
diff --git a/trunk/paradiseo-eo/test/.cvsignore b/trunk/paradiseo-eo/test/.cvsignore
new file mode 100644
index 000000000..3e646c1f4
--- /dev/null
+++ b/trunk/paradiseo-eo/test/.cvsignore
@@ -0,0 +1,29 @@
+*.o
+*.csv
+*.sav
+.deps
+Makefile
+Makefile.in
+t-eo
+t-eobin
+t-eobreeder
+t-eofitness
+t-eoinclusion
+t-eoinsertion
+t-eolottery
+t-eoproblem
+t-eogeneration
+t-eoNonUniform
+t-eo2dVector
+t-eoEasyEA
+t-eoUniform
+t-eoRandom
+t-eoCheckpointing
+t-eoVector
+t-eoAtomOps
+t-selectOne
+t-eoStateAndParser
+t-eoGOpSel
+t-eoExternalEO
+t-eoESFull
+t-eoSymreg
diff --git a/trunk/paradiseo-eo/test/CVS/Entries b/trunk/paradiseo-eo/test/CVS/Entries
new file mode 100644
index 000000000..04e970a4d
--- /dev/null
+++ b/trunk/paradiseo-eo/test/CVS/Entries
@@ -0,0 +1,53 @@
+/.cvsignore/1.13/Mon Nov  6 12:37:58 2000//
+/Makefile.am/1.70/Wed Dec  7 15:51:32 2005//
+/RoyalRoad.h/1.3/Thu Jun 21 12:03:17 2001//
+/binary_value.h/1.5/Sat Nov 17 07:54:12 2001//
+/fitness_traits.cpp/1.4/Thu Feb 27 19:20:30 2003//
+/real_value.h/1.8/Mon May 21 04:10:55 2001//
+/run_tests/1.5/Wed Nov  7 15:23:24 2001//
+/t-MGE-control.cpp/1.7/Thu Oct  6 17:22:40 2005//
+/t-MGE.cpp/1.8/Thu Oct  6 17:22:40 2005//
+/t-MGE1bit.cpp/1.8/Thu Oct  6 17:22:40 2005//
+/t-eo.cpp/1.4/Thu Feb 27 19:20:29 2003//
+/t-eo2dVector.cc/1.1/Fri Oct  1 16:36:04 1999//
+/t-eoAtomOps.cpp/1.4/Thu Feb 27 19:20:29 2003//
+/t-eoBaseFunctions.cpp/1.3/Thu Feb 27 19:20:29 2003//
+/t-eoCMAES.cpp/1.2/Sun Mar 26 13:33:25 2006//
+/t-eoCheckpointing.cpp/1.8/Mon Sep 26 10:18:15 2005//
+/t-eoESAll.cpp/1.7/Mon Oct 10 21:42:31 2005//
+/t-eoESFull.cpp/1.14/Mon Sep 26 10:18:15 2005//
+/t-eoESOps.cpp/1.3/Thu Feb 27 19:20:28 2003//
+/t-eoEasyEA.cpp/1.6/Thu Feb 27 19:20:28 2003//
+/t-eoExternalEO.cpp/1.6/Thu Feb 27 19:20:28 2003//
+/t-eoFitnessAssembled.cpp/1.1/Wed Apr  2 21:10:26 2003//
+/t-eoFitnessAssembledEA.cpp/1.2/Mon Sep 20 14:11:23 2004//
+/t-eoFunctor.cpp/1.2/Wed Aug 23 12:03:01 2000//
+/t-eoGA.cpp/1.8/Thu Feb 27 19:20:28 2003//
+/t-eoGOpSel.cpp/1.8/Thu Feb 27 19:20:27 2003//
+/t-eoGenOp.cpp/1.12/Wed Sep 28 21:49:26 2005//
+/t-eoNonUniform.cpp/1.3/Thu Feb 27 19:20:26 2003//
+/t-eoPBIL.cpp/1.7/Wed Oct  5 21:34:19 2005//
+/t-eoPareto.cpp/1.15/Wed Oct  5 21:34:19 2005//
+/t-eoParetoFitness.cpp/1.8/Wed Sep 29 18:37:20 2004//
+/t-eoRandom.cpp/1.13/Thu Feb 27 19:20:24 2003//
+/t-eoReal.cpp/1.6/Thu Feb 27 19:20:24 2003//
+/t-eoReplacement.cpp/1.6/Thu Feb 27 19:20:23 2003//
+/t-eoRoulette.cpp/1.1/Wed Jun  4 09:34:26 2003//
+/t-eoSSGA.cpp/1.4/Thu Feb 27 19:20:22 2003//
+/t-eoSelect.cpp/1.12/Mon Sep 26 10:18:15 2005//
+/t-eoSharing.cpp/1.4/Wed Sep 28 21:49:26 2005//
+/t-eoStateAndParser.cpp/1.9/Mon Sep 26 10:18:15 2005//
+/t-eoSymreg.cpp/1.15/Thu Feb 27 19:20:22 2003//
+/t-eoUniform.cpp/1.3/Thu Feb 27 19:20:22 2003//
+/t-eoVector.cpp/1.7/Wed Sep 28 21:49:26 2005//
+/t-eoVirus.cpp/1.5/Tue Sep 21 10:23:32 2004//
+/t-eobin.cpp/1.21/Wed Sep 28 21:49:26 2005//
+/t-eobreeder.cpp/1.13/Thu Feb 27 19:20:29 2003//
+/t-eofitness.cpp/1.7/Thu Feb 27 19:20:28 2003//
+/t-eogeneration.cpp/1.7/Thu Feb 27 19:20:27 2003//
+/t-eoinclusion.cpp/1.8/Thu Feb 27 19:20:27 2003//
+/t-eoinsertion.cpp/1.6/Thu Feb 27 19:20:26 2003//
+/t-eolottery.cpp/1.5/Thu Feb 27 19:20:26 2003//
+/t-eoproblem.cpp/1.4/Thu Feb 27 19:20:25 2003//
+/t-selectOne.cpp/1.6/Thu Feb 27 19:20:20 2003//
+D
diff --git a/trunk/paradiseo-eo/test/CVS/Repository b/trunk/paradiseo-eo/test/CVS/Repository
new file mode 100644
index 000000000..593d883dd
--- /dev/null
+++ b/trunk/paradiseo-eo/test/CVS/Repository
@@ -0,0 +1 @@
+eo/test
diff --git a/trunk/paradiseo-eo/test/CVS/Root b/trunk/paradiseo-eo/test/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/test/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/test/Makefile.am b/trunk/paradiseo-eo/test/Makefile.am
new file mode 100644
index 000000000..65b881653
--- /dev/null
+++ b/trunk/paradiseo-eo/test/Makefile.am
@@ -0,0 +1,93 @@
+###############################################################################
+##
+## Makefile.am for eo/test
+##
+###############################################################################
+
+LIBEO				= $(top_builddir)/src/libeo.a
+LIBEOUTILS			= $(top_builddir)/src/utils/libeoutils.a
+LIBES				= $(top_builddir)/src/es/libes.a
+LIBGA				= $(top_builddir)/src/ga/libga.a
+LIBCMA				= $(top_builddir)/src/es/libcma.a
+
+# PLEASE don't break the line (see create_batch.sh)
+check_PROGRAMS 			= t-eoParetoFitness \
+				t-eoPareto \
+				t-eofitness \
+				t-eoRandom \
+				t-eobin \
+				t-eoVirus \
+				t-MGE \
+				t-MGE1bit \
+				t-MGE-control \
+				t-eoStateAndParser \
+				t-eoCheckpointing \
+				t-eoSSGA \
+				t-eoExternalEO \
+				t-eoSymreg \
+				t-eo \
+				t-eoReplacement \
+				t-eoSelect \
+				t-eoGenOp \
+				t-eoGA \
+				t-eoReal \
+				t-eoVector \
+				t-eoESAll \
+				t-eoPBIL \
+				t-eoFitnessAssembled \
+				t-eoFitnessAssembledEA \
+				t-eoRoulette \
+				t-eoSharing \
+				t-eoCMAES
+
+
+TESTS				= $(check_PROGRAMS) \
+				run_tests # This script can be used to check command-line arguments
+
+noinst_HEADERS			= binary_value.h real_value.h RoyalRoad.h
+
+
+DEPS	 			= $(LIBGA) $(LIBES) $(LIBCMA) $(LIBEOUTILS) $(LIBEO) 
+INCLUDES			= -I$(top_srcdir)/src -I$(srcdir)/../src 
+LIBS	 			= $(DEPS)
+
+CLEANFILES 			= monitor.csv t-eoRandom.out
+EXTRA_DIST			= run_tests
+
+# extra flags for specific targets
+t_eoVirus_CXXFLAGS		= $(AM_CXXFLAGS) -I$(top_srcdir)/contrib
+t_MGE_CXXFLAGS 			= -I$(top_srcdir)/contrib/MGE
+t_MGE1bit_CXXFLAGS 		= -I$(top_srcdir)/contrib/MGE
+t_MGE_control_CXXFLAGS 		= -I$(top_srcdir)/contrib/MGE
+
+# Specify source-files,
+# otherwise automake/make looks for C sources
+#
+t_eoRandom_SOURCES 		= t-eoRandom.cpp
+t_eofitness_SOURCES 		= t-eofitness.cpp
+t_eoFitnessAssembledEA_SOURCES 	= t-eoFitnessAssembledEA.cpp
+t_eobin_SOURCES 		= t-eobin.cpp
+t_eoVirus_SOURCES 		= t-eoVirus.cpp
+t_MGE1bit_SOURCES 		= t-MGE1bit.cpp
+t_MGE_SOURCES 			= t-MGE.cpp
+t_MGE_control_SOURCES 		= t-MGE-control.cpp
+t_eoStateAndParser_SOURCES 	= t-eoStateAndParser.cpp
+t_eoCheckpointing_SOURCES 	= t-eoCheckpointing.cpp
+t_eoReplacement_SOURCES 	= t-eoReplacement.cpp
+t_eoSelect_SOURCES 		= t-eoSelect.cpp
+t_eoExternalEO_SOURCES 		= t-eoExternalEO.cpp
+t_eoSymreg_SOURCES 		= t-eoSymreg.cpp
+t_eo_SOURCES 			= t-eo.cpp
+t_eoGenOp_SOURCES 		= t-eoGenOp.cpp
+t_eoVector_SOURCES 		= t-eoVector.cpp
+t_eoGA_SOURCES 			= t-eoGA.cpp
+t_eoReal_SOURCES 		= t-eoReal.cpp
+t_eoESAll_SOURCES 		= t-eoESAll.cpp
+t_eoSSGA_SOURCES 		= t-eoSSGA.cpp
+t_eoPareto_SOURCES 		= t-eoPareto.cpp 
+t_eoParetoFitness_SOURCES 	= t-eoParetoFitness.cpp 
+t_eoPBIL_SOURCES 		= t-eoPBIL.cpp 
+t_eoFitnessAssembled_SOURCES 	= t-eoFitnessAssembled.cpp 
+t_eoRoulette_SOURCES 		= t-eoRoulette.cpp
+t_eoSharing_SOURCES 		= t-eoSharing.cpp
+t_eoCMAES_SOURCES		= t-eoCMAES.cpp
diff --git a/trunk/paradiseo-eo/test/RoyalRoad.h b/trunk/paradiseo-eo/test/RoyalRoad.h
new file mode 100644
index 000000000..461e825f5
--- /dev/null
+++ b/trunk/paradiseo-eo/test/RoyalRoad.h
@@ -0,0 +1,60 @@
+/*
+   RoyalRoad.h
+   -- Implementation of the Royal Road function for any length and block size
+   (c) GeNeura Team 2001, Marc Schoenauer 2000
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+CVS Info: $Date: 2001/06/21 12:03:17 $ $Header: /cvsroot/eodev/eo/test/RoyalRoad.h,v 1.3 2001/06/21 12:03:17 jmerelo Exp $ $Author: jmerelo $
+*/
+
+#ifndef RoyalRoad_h
+#define RoyalRoad_h
+
+template
+class RoyalRoad: public eoEvalFunc {
+
+ public:
+
+  typedef typename EOT::Fitness FitT;
+
+  /// Ctor: takes a length, and divides that length in equal parts
+  RoyalRoad( unsigned _div ): eoEvalFunc(), div( _div ) {};
+
+  // Applies the function
+  virtual void operator() ( EOT & _eo )  {
+	FitT fitness = 0;
+    if (_eo.invalid()) {
+	  for ( unsigned i = 0; i < _eo.size()/div; i ++ ) {
+		bool block = true;
+		for ( unsigned j = 0; j < div; j ++ ) {
+		  block &= _eo[i*div+j];
+		}
+		if (block) {
+		  fitness += div;
+		}
+	  }
+	  _eo.fitness( fitness );
+	}
+  };
+	
+  private:
+	unsigned div;
+
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/test/binary_value.h b/trunk/paradiseo-eo/test/binary_value.h
new file mode 100644
index 000000000..793e9de62
--- /dev/null
+++ b/trunk/paradiseo-eo/test/binary_value.h
@@ -0,0 +1,16 @@
+#include 
+
+//-----------------------------------------------------------------------------
+
+/** Just the simple function that takes binary value of a chromosome and sets
+    the fitnes.
+    @param _chrom A binary chromosome 
+*/
+
+template  double binary_value(const Chrom& _chrom)
+{
+    double sum = 0.0;
+    for (unsigned i=0; i<_chrom.size(); i++)
+	sum += _chrom[i];
+    return sum;
+}
diff --git a/trunk/paradiseo-eo/test/fitness_traits.cpp b/trunk/paradiseo-eo/test/fitness_traits.cpp
new file mode 100644
index 000000000..19edb27a4
--- /dev/null
+++ b/trunk/paradiseo-eo/test/fitness_traits.cpp
@@ -0,0 +1,433 @@
+#include  // for pair
+#include 
+#include 
+#include 
+#include 
+#include  // for exp
+
+using namespace std;
+
+/* fitness_traits.h */
+
+// default traits: defaults to a double that needs to be maximized
+template 
+struct fitness_traits
+{
+  // Needs mapping can be used to figure out whether you need to do fitness scaling (or not)
+  const static bool needs_mapping               = false;
+
+  // storage_type: what to store next to the genotype
+  typedef T storage_type;
+
+  // performance_type: what the eoEvalFunc calculates
+  typedef T performance_type;
+
+  // worth_type: what the scaling function does
+  typedef T worth_type;
+
+  // access_performance: how to get from what is stored to a mutable performance
+  static performance_type& access_performance(storage_type& a) { return a; }
+
+  // access_worth: how to get from what is stored to a mutable worth
+  static worth_type&       access_worth(storage_type& a)       { return a; }
+
+  // get_performance: from storage_type to a performance figure
+  static performance_type  get_performance(storage_type a) { return a; }
+
+  // get_worth: from storage_type to a worth figure
+  static worth_type        get_worth(storage_type a)       { return a; }
+
+  // get the fitness out of the individual
+  template 
+  static worth_type    get_fitness(const EOT& _eo)       { return _eo.performance(); }
+
+  // compare the two individuals
+  template 
+  static bool is_better(const EOT& _eo1, const EOT& _eo2)
+  {
+    return _eo1.performance() > _eo2.performance();
+  }
+};
+
+struct minimization {};
+struct maximization {};
+
+struct fitness_traits : public fitness_traits
+{
+  // for minimization, invert the is_better
+  template 
+  static bool is_better(const EOT& _eo1, const EOT& _eo2)
+  {
+    return _eo1.performance() < _eo2.performance();
+  }
+};
+
+// for maximization, just take the default behaviour
+struct fitness_traits : public fitness_traits {};
+
+// forward declaration
+//template  class eoPop;
+//template  class EO;
+
+// unfortunately, partial template specialization is not approved by Microsoft (though ANSI says it's ok)
+// Probably need some macro-magic to make this work (MicroSoft == MacroHard)
+// A pair class: first == performance, second == worth, redefine all types, data and functions
+template 
+struct fitness_traits< pair >
+{
+  typedef pair storage_type;
+  typedef Performance performance_type;
+  typedef Worth       worth_type;
+
+  const static bool needs_mapping = true;
+
+  static performance_type& access_performance(storage_type& a)     { return a.first; }
+  static worth_type&       access_worth(storage_type& a)           { return a.second; }
+
+  static performance_type get_performance(const storage_type& a)     { return a.first; }
+  static worth_type       get_worth(const storage_type& a)           { return a.second; }
+
+  // This function calls _eo.worth() which in turn checks the fitness flag and calls get_worth above
+  // The compiler should be able to inline all these calls and come up with a very compact solution
+  template 
+  static worth_type    get_fitness(const EOT& _eo) { return _eo.worth(); }
+
+  template 
+  static bool is_better(const EOT& _eo1, const EOT& _eo2)
+  {
+    return _eo1.worth() > _eo2.worth();
+  }
+};
+
+/* end fitness_traits.h */
+
+/* EO.h 
+
+The Fitness template argument is there for backward compatibility reasons
+
+*/
+
+template  >
+class EO
+{
+public :
+
+  typedef Traits                            fitness_traits;
+  typedef typename Traits::storage_type     storage_type;
+  typedef typename Traits::performance_type performance_type;
+  typedef typename Traits::worth_type       worth_type;
+
+  EO() : valid_performance(false), valid_worth(false), rep_fitness() {}
+
+  // for backwards compatibility
+  void fitness(performance_type perf)
+  {
+    performance(perf);
+  }
+
+  void performance(performance_type perf)
+  {
+    valid_performance = true;
+    Traits::access_performance(rep_fitness) = perf;
+  }
+
+  performance_type performance(void) const
+  {
+    if(!valid_performance) throw runtime_error("no performance");
+    return Traits::get_performance(rep_fitness);
+  }
+
+  void worth(worth_type worth)
+  {
+    valid_worth = true;
+    Traits::access_worth(rep_fitness) = worth;
+  }
+
+  worth_type worth(void) const
+  {
+    if(!valid_worth)  throw runtime_error("no worth");
+    if(!Traits::needs_mapping)  throw runtime_error("no mapping");
+    return Traits::get_worth(rep_fitness);
+  }
+
+  worth_type fitness(void) const
+  {
+    return Traits::get_fitness(*this);
+  }
+
+  void invalidate(void)
+  {
+    valid_performance = false;
+    valid_worth = false;
+  }
+
+  void invalidate_worth(void)
+  {
+    valid_worth = false;
+  }
+
+  bool operator<(const EO& other) const
+  {
+    return !Traits::is_better(other, *this);
+  }
+
+  bool operator>(const EO& other) const
+  {
+    return Traits::is_better(other, *this);
+  }
+
+  private :
+
+  bool valid_performance;
+  bool valid_worth;
+  storage_type rep_fitness;
+};
+
+/* end EO.h */
+
+/* eoPerf2Worth.h */
+
+// get the name known
+template  class eoPop;
+
+template 
+void exponential_scaling(eoPop& _pop)
+{
+    for (unsigned i = 0; i < _pop.size(); ++i)
+    { // change minimimization into maximization
+      _pop[i].worth(exp(-_pop[i].performance()));
+    }
+}
+
+template 
+class eoPerf2Worth /* : public eoUF&, void> */
+{
+public :
+  virtual void operator()(eoPop& _pop)
+  {
+    return exponential_scaling(_pop);
+  }
+};
+
+/* end eoPerf2Worth.h */
+
+
+/* eoPop.h */
+
+template 
+class eoPop : public vector
+{
+public :
+
+  typedef typename EOT::fitness_traits fitness_traits;
+
+  eoPop(void) : p2w(0) {}
+
+  void sort()
+  {
+    scale(); // get the worths up to date
+
+    std::sort(begin(), end(), greater());
+  }
+
+  void scale()
+  {
+    if (p2w)
+    {
+      if (!fitness_traits::needs_mapping)
+      {
+        throw runtime_error("eoPop: no scaling needed, yet a scaling function is defined");
+      }
+
+      (*p2w)(*this);
+    }
+    else if (fitness_traits::needs_mapping)
+    {
+      throw runtime_error("eoPop: no scaling function attached to the population, while one was certainly called for");
+    }
+  }
+
+  void setPerf2Worth(eoPerf2Worth& _p2w)
+  {
+    p2w = &_p2w;
+  }
+
+  void setPerf2Worth(eoPerf2Worth* _p2w)
+  {
+    p2w = _p2w;
+  }
+
+  eoPerf2Worth* getPerf2Worth() { return p2w; }
+
+  void swap(eoPop& other)
+  {
+    vector::swap(other);
+    eoPerf2Worth* tmp = p2w;
+    p2w = other.p2w;
+    other.p2w = tmp;
+  }
+
+private :
+
+  // a pointer as it can be emtpy
+  eoPerf2Worth* p2w;
+};
+
+// need this one to be able to swap the members as well...
+template 
+void swap(eoPop& _p1, eoPop& _p2)
+{
+  _p1.swap(_p2);
+}
+
+/* end eoPop.h */
+
+/* main and test */
+
+template 
+void algo(eoPop& _pop)
+{
+  eoPop offspring;                          // how to get the scaling info into this guy??
+  offspring.setPerf2Worth(_pop.getPerf2Worth()); // like this!
+
+  std::copy(_pop.begin(), _pop.end(), back_inserter(offspring));
+
+  offspring.sort(); // should call scale
+
+  swap(_pop, offspring);
+}
+
+void minimization_test()
+{
+  typedef EO eo_type;
+
+  eo_type eo1;
+  eo_type eo2;
+
+  eo1.performance(1.0);
+  eo2.performance(2.0);
+
+  std::cout << "With minimizing fitness" << std::endl;
+  std::cout << eo1.fitness() << " < " << eo2.fitness() << " returns " << (eo1 < eo2) << std::endl;
+  std::cout << eo2.fitness() << " < " << eo1.fitness() << " returns " << (eo2 < eo1) << std::endl;
+}
+
+void the_main()
+{
+  typedef EO simple_eo;
+  typedef EO > scaled_eo;
+
+  simple_eo eo1;
+  simple_eo eo3;
+
+/* First test some simple comparisons */
+
+  eo1.fitness(10); // could also use performance()
+  eo3.fitness(5);
+
+  std::cout << eo1.fitness() << std::endl;
+  std::cout << eo3.fitness() << std::endl;
+
+  std::cout << "eo1 < eo3 = " << (eo1 < eo3) << std::endl;
+
+
+  scaled_eo eo2;
+  scaled_eo eo4;
+  eo2.performance(10);
+  eo4.performance(8);
+
+/* Now test if the worth gets accessed and if the flag protects it */
+
+  try
+  {
+    std::cout << eo2.fitness() << std::endl;
+    std::cout << "did not throw" << std::endl;
+    assert(false); // should throw
+  }
+  catch(std::exception& e)
+  {
+    std::cout << "Fitness threw exception, as it should" << std::endl;
+    std::cout << e.what() << std::endl;
+  }
+
+/* Set the worth and all is well (this is normally done by some perf2worth functor */
+
+  eo2.worth(3);
+  eo4.worth(5);
+
+  std::cout << "with maximization " << std::endl;
+  std::cout << eo2.fitness() << std::endl;
+  std::cout << eo4.fitness() << std::endl;
+  std::cout << eo2.fitness() << " < " << eo4.fitness() << " returns " << (eo2 < eo4) << std::endl;
+
+/* Test the minimization of fitness */
+  minimization_test();
+
+
+/* Populations */
+
+// test pop without scaling, should have no overhead save for a single empty pointer in pop
+  eoPop pop0;
+  pop0.resize(1);
+  pop0[0].fitness(1);
+
+  algo(pop0);
+
+  std::cout << pop0[0].fitness() << std::endl;
+
+  assert(pop0[0].fitness() == 1);
+
+/* test pop with scaling */
+
+  eoPerf2Worth perf2worth;
+  eoPop pop1;
+
+  pop1.resize(1);
+
+  pop1[0].fitness(1.0); // emulate evaluation
+
+    // at this point getting the fitness should throw
+  try
+  {
+    std::cout << pop1[0].fitness() << std::endl;
+    std::cout << "did not throw" << std::endl;
+    assert(false); // should throw
+  }
+  catch(std::exception& e)
+  {
+    std::cout << "Fitness threw exception, as it should" << std::endl;
+    std::cout << e.what() << std::endl;
+  }
+
+  // at this point trying to scale should throw
+  try
+  {
+    algo(pop1); // should complain that it cannot scale
+    assert(false); // so it would never get here
+  }
+  catch(std::exception& e)
+  { // but rather ends here
+    std::cout << e.what() << std::endl;
+  }
+
+  // ok, now set the scaling
+  pop1.setPerf2Worth(perf2worth);
+
+  algo(pop1);
+
+  std::cout << "the fitness has been transformed from " << pop1[0].performance() << " to exp(-1) = " << pop1[0].fitness() << std::endl;
+}
+
+int main()
+{
+  try
+  {
+    the_main();
+  }
+  catch(std::exception& e)
+  {
+    std::cout << e.what() << std::endl;
+  }
+}
+
+
diff --git a/trunk/paradiseo-eo/test/real_value.h b/trunk/paradiseo-eo/test/real_value.h
new file mode 100644
index 000000000..8bedd6b9d
--- /dev/null
+++ b/trunk/paradiseo-eo/test/real_value.h
@@ -0,0 +1,19 @@
+#include 
+//-----------------------------------------------------------------------------
+
+
+/** Just a simple function that takes an eoEsBase and sets the fitnes 
+    to sphere 
+    @param _ind  vector
+*/
+
+double real_value(const std::vector& _ind)
+{
+  double sum = 0;
+  for (unsigned i = 0; i < _ind.size(); i++)
+      sum += _ind[i] * _ind[i];
+  return sum/_ind.size();
+}
+
+
+
diff --git a/trunk/paradiseo-eo/test/run_tests b/trunk/paradiseo-eo/test/run_tests
new file mode 100755
index 000000000..ebaec0af7
--- /dev/null
+++ b/trunk/paradiseo-eo/test/run_tests
@@ -0,0 +1,9 @@
+#!/bin/sh
+
+echo "Testing -h"
+./t-eoCheckpointing -h 
+
+echo "Finished"
+
+#TODO test if an error occured
+echo "Ok"
diff --git a/trunk/paradiseo-eo/test/t-MGE-control.cpp b/trunk/paradiseo-eo/test/t-MGE-control.cpp
new file mode 100644
index 000000000..240dd3688
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-MGE-control.cpp
@@ -0,0 +1,104 @@
+//-----------------------------------------------------------------------------
+// t-eoMGE.cpp
+//-----------------------------------------------------------------------------
+
+#ifdef HAVE_CONFIG_H
+#include 
+#endif
+
+#ifndef __GNUG__
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif // __GNUG__
+
+#include "eo"
+#include "ga/eoBitOp.h"
+
+#include "RoyalRoad.h"
+
+// Viri
+#include "VirusOp.h"
+#include "eoVirus.h"
+#include "eoInitVirus.h"
+
+//-----------------------------------------------------------------------------
+
+typedef eoVirus Chrom;
+
+//-----------------------------------------------------------------------------
+
+int main()
+{
+  const unsigned POP_SIZE = 10, CHROM_SIZE = 12;
+  unsigned i;
+  eoBooleanGenerator gen;
+
+  // the populations:
+  eoPop pop;
+
+  // Evaluation
+  RoyalRoad rr( 8 );
+  eoEvalFuncCounter eval( rr );
+
+  eoInitVirus random(CHROM_SIZE, gen);
+  for (i = 0; i < POP_SIZE; ++i) {
+      Chrom chrom;
+      random(chrom);
+      eval(chrom);
+      pop.push_back(chrom);
+  }
+
+  std::cout << "population:" << std::endl;
+  for (i = 0; i < pop.size(); ++i)
+    std::cout << "\t" << pop[i] << " " << pop[i].fitness() << std::endl;
+
+  // selection
+  eoStochTournamentSelect lottery(0.9 );
+
+  // breeder
+  eoOneBitFlip vm;
+  eoUBitXover xover;
+  eoProportionalOp propSel;
+  eoGeneralBreeder breeder( lottery, propSel );
+  propSel.add(vm, 0.2);
+  propSel.add(xover, 0.8);
+
+  // Replace a single one
+  eoCommaReplacement replace;
+
+  // Terminators
+  eoGenContinue continuator1(10);
+  eoFitContinue continuator2(CHROM_SIZE);
+  eoCombinedContinue continuator(continuator1, continuator2);
+  eoCheckPoint checkpoint(continuator);
+  eoStdoutMonitor monitor;
+  checkpoint.add(monitor);
+  eoSecondMomentStats stats;
+  eoPopStat dumper( 10 );
+  monitor.add(stats);
+  checkpoint.add(dumper);
+  checkpoint.add(stats);
+
+  // GA generation
+  eoEasyEA ea(checkpoint, eval,  breeder, replace );
+
+  // evolution
+  try
+    {
+      ea(pop);
+    }
+  catch (std::exception& e)
+    {
+	std::cout << "exception: " << e.what() << std::endl;;
+	exit(EXIT_FAILURE);
+    }
+
+  std::cout << "pop" << std::endl;
+  for (i = 0; i < pop.size(); ++i)
+    std::cout << "\t" <<  pop[i] << " " << pop[i].fitness() << std::endl;
+
+  std::cout << "\n --> Number of Evaluations = " << eval.getValue() << std::endl;
+  return 0;
+}
+
+//-----------------------------------------------------------------------------
diff --git a/trunk/paradiseo-eo/test/t-MGE.cpp b/trunk/paradiseo-eo/test/t-MGE.cpp
new file mode 100644
index 000000000..a122b5e70
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-MGE.cpp
@@ -0,0 +1,108 @@
+//-----------------------------------------------------------------------------
+// t-eoMGE.cpp
+//-----------------------------------------------------------------------------
+
+#ifdef HAVE_CONFIG_H
+#include 
+#endif
+
+#ifndef __GNUG__
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif // __GNUG__
+
+#include 
+#include 
+
+#include "RoyalRoad.h"
+
+// Viri
+#include "VirusOp.h"
+#include "eoVirus.h"
+#include "eoInitVirus.h"
+
+//-----------------------------------------------------------------------------
+
+typedef eoVirus Chrom;
+
+//-----------------------------------------------------------------------------
+
+int main()
+{
+  const unsigned POP_SIZE = 10, CHROM_SIZE = 12;
+  unsigned i;
+  eoBooleanGenerator gen;
+
+  // the populations:
+  eoPop pop;
+
+  // Evaluation
+  RoyalRoad rr( 8 );
+  eoEvalFuncCounter eval( rr );
+
+  eoInitVirus random(CHROM_SIZE, gen);
+  for (i = 0; i < POP_SIZE; ++i) {
+      Chrom chrom;
+      random(chrom);
+      eval(chrom);
+      pop.push_back(chrom);
+  }
+
+  std::cout << "population:" << std::endl;
+  for (i = 0; i < pop.size(); ++i)
+    std::cout << "\t" << pop[i] << " " << pop[i].fitness() << std::endl;
+
+  // selection
+  eoStochTournamentSelect lottery(0.9 );
+
+  // breeder
+  VirusMutation vm;
+  VirusTransmission vt;
+  VirusBitFlip vf;
+  eoUBitXover xover;
+  eoProportionalOp propSel;
+  eoGeneralBreeder breeder( lottery, propSel );
+  propSel.add(vm, 0.1);
+  propSel.add(vf, 0.05);
+  propSel.add(vt, 0.05);
+  propSel.add(xover, 0.8);
+
+  // Replace a single one
+  eoCommaReplacement replace;
+
+  // Terminators
+  eoGenContinue continuator1(10);
+  eoFitContinue continuator2(CHROM_SIZE);
+  eoCombinedContinue continuator(continuator1, continuator2);
+  eoCheckPoint checkpoint(continuator);
+  eoStdoutMonitor monitor;
+  checkpoint.add(monitor);
+  eoSecondMomentStats stats;
+  eoPopStat dumper( 10 );
+  monitor.add(stats);
+  checkpoint.add(dumper);
+  checkpoint.add(stats);
+
+  // GA generation
+  eoEasyEA ea(checkpoint, eval,  breeder, replace );
+
+  // evolution
+  try
+    {
+      ea(pop);
+    }
+  catch (std::exception& e)
+    {
+	std::cout << "exception: " << e.what() << std::endl;;
+	exit(EXIT_FAILURE);
+    }
+
+  std::cout << "pop" << std::endl;
+  for (i = 0; i < pop.size(); ++i)
+    std::cout << "\t" <<  pop[i] << " " << pop[i].fitness() << std::endl;
+
+  std::cout << "\n --> Number of Evaluations = " << eval.getValue() << std::endl;
+  return 0;
+}
+
+//-----------------------------------------------------------------------------
diff --git a/trunk/paradiseo-eo/test/t-MGE1bit.cpp b/trunk/paradiseo-eo/test/t-MGE1bit.cpp
new file mode 100644
index 000000000..781f5c74e
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-MGE1bit.cpp
@@ -0,0 +1,111 @@
+//-----------------------------------------------------------------------------
+// t-eoMGE.cpp
+//-----------------------------------------------------------------------------
+
+#ifdef HAVE_CONFIG_H
+#include 
+#endif
+
+#ifndef __GNUG__
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif // __GNUG__
+
+#include "eo"
+#include "ga/eoBitOp.h"
+#include "RoyalRoad.h"
+
+// Viri
+#include "VirusOp.h"
+#include "eoVirus.h"
+#include "eoInitVirus.h"
+
+//-----------------------------------------------------------------------------
+
+typedef eoVirus Chrom;
+
+//-----------------------------------------------------------------------------
+
+int main()
+{
+  const unsigned POP_SIZE = 10, CHROM_SIZE = 12;
+  unsigned i;
+  eoBooleanGenerator gen;
+
+  // the populations:
+  eoPop pop;
+
+  // Evaluation
+  RoyalRoad rr( 8 );
+  eoEvalFuncCounter eval( rr );
+
+  eoInitVirus1bit random(CHROM_SIZE, gen);
+  for (i = 0; i < POP_SIZE; ++i) {
+      Chrom chrom;
+      random(chrom);
+      eval(chrom);
+      pop.push_back(chrom);
+  }
+
+  std::cout << "population:" << std::endl;
+  for (i = 0; i < pop.size(); ++i)
+    std::cout << "\t" << pop[i] << " " << pop[i].fitness() << std::endl;
+
+  // selection
+  eoStochTournamentSelect lottery(0.9 );
+
+  // breeder
+  VirusShiftMutation vm;
+  VirusTransmission vt;
+  VirusBitFlip vf;
+  eoUBitXover xover;
+  eoProportionalOp propSel;
+  eoGeneralBreeder breeder( lottery, propSel );
+  propSel.add(vm, 0.8);
+  propSel.add(vf, 0.05);
+  propSel.add(vt, 0.05);
+  propSel.add(xover, 0.1);
+
+  // Replace a single one
+  eoCommaReplacement replace;
+
+  // Terminators
+  eoGenContinue continuator1(10);
+  eoFitContinue continuator2(CHROM_SIZE);
+  eoCombinedContinue continuator(continuator1, continuator2);
+  eoCheckPoint checkpoint(continuator);
+  eoStdoutMonitor monitor;
+  checkpoint.add(monitor);
+  eoSecondMomentStats stats;
+  eoPopStat dumper( 10 );
+  monitor.add(stats);
+  checkpoint.add(dumper);
+  checkpoint.add(stats);
+
+  // GA generation
+  eoEasyEA ea(checkpoint, eval, breeder, replace);
+
+  // evolution
+  try {
+      ea(pop);
+  } catch (std::exception& e) {
+      std::cerr << "exception: " << e.what() << std::endl;;
+      exit(EXIT_FAILURE);
+  }
+
+  std::cout << "pop" << std::endl;
+  for (i = 0; i < pop.size(); ++i)
+      std::cout << "\t" <<  pop[i] << " " << pop[i].fitness() << std::endl;
+
+  std::cout << "\n --> Number of Evaluations = " << eval.getValue() << std::endl;
+  return EXIT_SUCCESS;
+}
+
+//-----------------------------------------------------------------------------
+
+
+
+// Local Variables:
+// mode: C++
+// c-file-style: "Stroustrup"
+// End:
diff --git a/trunk/paradiseo-eo/test/t-eo.cpp b/trunk/paradiseo-eo/test/t-eo.cpp
new file mode 100644
index 000000000..aea451c34
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eo.cpp
@@ -0,0 +1,23 @@
+//-----------------------------------------------------------------------------
+// t-eo.cpp
+//-----------------------------------------------------------------------------
+
+#include   // EO
+
+//-----------------------------------------------------------------------------
+
+typedef EO Chrom;
+
+//-----------------------------------------------------------------------------
+
+int main()
+{
+  Chrom chrom1, chrom2;
+
+  std::cout << "chrom1 = " << chrom1 << std::endl
+       << "chrom2 = " << chrom2 << std::endl;
+
+  return 0;
+}
+
+//-----------------------------------------------------------------------------
diff --git a/trunk/paradiseo-eo/test/t-eo2dVector.cc b/trunk/paradiseo-eo/test/t-eo2dVector.cc
new file mode 100644
index 000000000..bce0e82be
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eo2dVector.cc
@@ -0,0 +1,220 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+/*
+-----------------------------------------------------------------------------
+File............: t-eo2dVector.cc
+Author..........: Geneura Team (this file: Victor Rivas, vrivas@ujaen.es)
+Date............: 01-Oct-1999, at Fac. of Sciences, Univ. of Granada (Spain)
+Description.....: Test for 2 dimensional eoVector.
+
+  ================  Modif. 1  ================
+  Author........:
+  Date..........:
+  Description...:
+
+-----------------------------------------------------------------------------
+*/
+
+#include 
+#include   // eo2dVector
+#include   // Random generator
+
+//-----------------------------------------------------------------------------
+
+typedef unsigned T;
+typedef double fitnessT;
+typedef eo2dVector C;
+
+//-----------------------------------------------------------------------------
+
+main()
+{
+  {
+    C c1;
+    cout << "Default constructor: " << endl
+	 << c1 << endl;
+  }
+  {
+    C c1( 5,6,1 );
+    cout << "Default constructor with values: " << endl
+	 << c1 << endl;
+    
+  }
+  {
+    eoUniform aleat( 1,10 );
+    C c1( 5,6, aleat );
+    cout << "Random constructor: " << endl
+	 << c1 << endl;
+    
+  }
+  {
+    C c1( 3,4,1 ), c2( c1 );
+    cout << "Copy constructor: " << endl
+	 << "Original chromosome: " << endl
+	 << c1 << endl
+	 << "Copy chromosome: " << endl
+	 << c2 << endl;
+  }
+
+  eoUniform aleat( 1,10 );
+  C c1( 3,4,aleat );
+
+  cout << "-----------------------------------------------------" << endl
+       << "Since now on all the operations are applied to " << endl
+       << c1
+       << "-----------------------------------------------------" << endl;
+  {
+    cout << "getGene(2,2): "
+	 << c1.getGene(2,2) << endl;
+  }
+  {
+    c1.setGene( 2,2,300 );
+    cout << "setGene(2,2,300): " << endl
+	 << c1 << endl;
+  }
+  {
+    unsigned u1=0, u3=333, u5=555;
+    vector v1( 4,u1 ), v2( 4,u3 ), v3( 4,u5 );
+    c1.insertRow( 0,v1 );
+    c1.insertRow( 3,v2 );
+    c1.insertRow( 5,v3 );
+    cout << "Insert rows at positions 0, 3 and 5: " << endl
+	 << c1 << endl;
+  }
+  {
+    c1.deleteRow( 5 );
+    c1.deleteRow( 3 );
+    c1.deleteRow( 0 );
+    cout << "Delete rows at positions 5, 3 and 0: " << endl
+	 << c1 << endl;
+  }
+  {
+    unsigned u1=0, u3=333, u6=666;
+    vector v1( 3,u1 ), v2( 3,u3 ), v3( 3,u6 );
+    c1.insertCol( 0,v1 );
+    c1.insertCol( 3,v2 );
+    c1.insertCol( 6,v3 );
+    cout << "Insert columns at positions 0, 3 and 6: " << endl
+	 << c1 << endl;
+  }
+  {
+    c1.deleteCol( 6 );
+    c1.deleteCol( 3 );
+    c1.deleteCol( 0 );
+    cout << "Delete columns at positions 6, 3 and 0: " << endl
+	 << c1 << endl;
+  }
+  {
+    cout << "Number of Rows: " << endl
+	 << c1.numOfRows() << endl;
+  }
+  {
+    cout << "Number of Columns: " << endl
+	 << c1.numOfCols() << endl;
+  }
+  
+  {
+    cout << "Class Name: " << endl
+	 << c1.className() << endl;
+  }
+  
+
+  cout << "-----------------------------------------------------" << endl
+       << "Catching exceptions: " << endl
+       << c1
+       << "-----------------------------------------------------" << endl;
+  {
+    cout << "* Trying getGene(10,1): " << endl;
+    try {
+      c1.getGene( 10,1 );
+    } catch (exception& e ) {
+      cerr << e.what() << endl;
+    }
+  }
+  {
+    cout << "* Trying getGene(1,10): " << endl;
+    try {
+      c1.getGene( 1,10) ;
+    } catch (exception& e ) {
+      cerr << e.what() << endl;
+    }
+  }
+  {
+    cout << "* Trying setGene( 10,1,999 ): " << endl;
+    try {
+      c1.setGene( 10,1,999 );
+    } catch (exception& e ) {
+      cerr << e.what() << endl;
+    }
+  }
+  {
+    cout << "* Trying setGene( 1,10,999 ): " << endl;
+    try {
+      c1.setGene( 1,10,999 );
+    } catch (exception& e ) {
+      cerr << e.what() << endl;
+    }
+  }
+  {
+    unsigned u1=111;
+    vector v1( 4, u1 );
+    cout << "* Trying insertRow( 10, v1 ): " << endl;
+    try {
+      c1.insertRow( 10,v1 );
+    } catch (exception& e ) {
+      cerr << e.what() << endl;
+    }
+  }
+  {
+    unsigned u1=111;
+    vector v1( 5, u1 );
+    cout << "* Trying insertRow( 1, v1 ) with v1.size()=5: " << endl;
+    try {
+      c1.insertRow( 1,v1 );
+    } catch (exception& e ) {
+      cerr << e.what() << endl;
+    }
+  }
+
+  {
+    cout << "* Trying deleteRow( 10 ): " << endl;
+    try {
+      c1.deleteRow( 10 );
+    } catch (exception& e ) {
+      cerr << e.what() << endl;
+    }
+  }
+
+  {
+    unsigned u1=111;
+    vector v1( 3, u1 );
+    cout << "* Trying insertCol( 10,v1 ): " << endl;
+    try {
+      c1.insertCol( 10,v1 );
+    } catch (exception& e ) {
+      cerr << e.what() << endl;
+    }
+  }
+
+  {
+    unsigned u1=111;
+    vector v1( 5, u1 );
+    cout << "* Trying insertCol( 1,v1 ) with v1.size()=5: " << endl;
+    try {
+      c1.insertCol( 1,v1 );
+    } catch (exception& e ) {
+      cerr << e.what() << endl;
+    }
+  }
+
+  {
+    cout << "* Trying deleteCol( 10 ): " << endl;
+    try {
+      c1.deleteCol( 10 );
+    } catch (exception& e ) {
+      cerr << e.what() << endl;
+    }
+  }
+
+}
+
+//-----------------------------------------------------------------------------
diff --git a/trunk/paradiseo-eo/test/t-eoAtomOps.cpp b/trunk/paradiseo-eo/test/t-eoAtomOps.cpp
new file mode 100644
index 000000000..d1c70de74
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoAtomOps.cpp
@@ -0,0 +1,66 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+    t-eoAtomOps.cpp
+      Program that tests the atomic operator classes
+
+    (c) GeNeura Team, 1999 
+ 
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ 
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+            
+*/
+
+//-----------------------------------------------------------------------------// 
+
+#ifdef _MSC_VER
+#pragma warning(disable:4786)
+#endif 
+
+#include 
+#include 
+#include 
+
+using namespace std;
+
+// Operators we are going to test
+#include 
+#include 
+#include 
+#include 
+
+// Several EOs
+#include 
+
+// RNGs
+#include 
+
+main(int argc, char *argv[]) {
+  eoString aString("123456");
+  eoAtomCreep creeper;
+  eoAtomMutation< eoString > mutator( creeper, 0.5 );
+
+  eoNegExp charNE( 2 );
+  eoAtomRandom randomer( charNE );
+  eoAtomMutation<  eoString > mutator2 ( randomer, 0.5 );
+
+  std::cout << "Before aString " << aString << std::endl;
+  mutator( aString);
+  std::cout << " after mutator " << aString << std::endl;
+  mutator2( aString);
+  std::cout << " after mutator2 " << aString << std::endl;;
+  return 0; // to avoid VC++ complaints
+}
+
diff --git a/trunk/paradiseo-eo/test/t-eoBaseFunctions.cpp b/trunk/paradiseo-eo/test/t-eoBaseFunctions.cpp
new file mode 100644
index 000000000..6f6745ac7
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoBaseFunctions.cpp
@@ -0,0 +1,26 @@
+
+#include 
+
+#include 
+
+using namespace std;
+
+struct eo1 : public eoF
+{
+    void operator()(void) {}
+};
+
+struct eo2 : public eoF
+{
+    int operator()(void) { return 1; }
+};
+
+int main()
+{
+    eo1 _1; _1();
+    eo2 _2; 
+    int i = _2();
+
+    std::cout << i << '\n';
+    return i;
+}
diff --git a/trunk/paradiseo-eo/test/t-eoCMAES.cpp b/trunk/paradiseo-eo/test/t-eoCMAES.cpp
new file mode 100644
index 000000000..365275443
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoCMAES.cpp
@@ -0,0 +1,128 @@
+
+#include 
+
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+
+#include 
+#include 
+#include 
+#include 
+#include 
+
+#include 
+#include 
+
+#include 
+#include 
+#include 
+#include 
+
+using namespace eo;
+using namespace std;
+
+typedef eoMinimizingFitness FitT;
+typedef eoVector EoType;
+
+double sqr(double x) { return x*x; }
+
+eoValueParam evals(0,"Function Evals","Number of Evaluations");
+
+double f_sphere(const vector& values) {
+    double sum = 0.0;
+    for (unsigned i = 0; i < values.size(); ++i) {
+	sum += values[i] * values[i];
+    }
+    ++evals.value();
+    return sum;
+}
+
+double f_rosen(const vector& x) {
+    double sum =0.0;
+    
+    for (int i = 0; i < x.size()-1; ++i) {
+	sum += 100 * sqr(sqr(x[i])-x[i+1]) + sqr(1.-x[i]);
+    }
+    ++evals.value();
+    return sum;
+}
+
+
+
+int main(int argc, char* argv[]) {
+    
+    // make sure we have a dimensionality parameter (for testing) 
+    char** rargv = new char*[argc+1];
+    rargv[0] = argv[0];
+    rargv[1] = "-N10";
+    for (int i = 2; i < argc; ++i) {
+	rargv[i] = argv[i-1];
+    }
+    
+    eoParser parser(argc+1, rargv);
+    
+    CMAParams params(parser);
+
+    vector initial_point(params.n, 0.0);
+    
+    CMAState state(params, initial_point);
+    
+    if (parser.userNeedsHelp())
+    {
+	parser.printHelp(std::cout);
+	return 1;
+    }
+
+    eoCMAInit init(state);
+    
+    eoPop pop(params.mu, init);
+    
+    eoEvalFuncPtr&> eval(  f_rosen );
+    
+    eoCMABreed breed(state, params.lambda);
+
+    for (unsigned i = 0; i < pop.size(); ++i) {
+	eval(pop[i]);
+    }
+    
+    eoCommaReplacement comma;
+     
+    eoGenContinue gen(params.maxgen);
+    eoFitContinue fit(1e-10);
+
+    eoCheckPoint checkpoint(gen);
+    checkpoint.add(fit);
+   
+    eoBestFitnessStat stat;
+
+    eoStdoutMonitor mon;
+    mon.add(stat);
+    mon.add(evals);
+    
+    eoTimedMonitor timed(1);// 1 seconds
+    timed.add(mon); // wrap it
+    
+    checkpoint.add(timed);
+    checkpoint.add(stat);
+    
+    eoEasyEA algo(
+	    checkpoint,
+	    eval,
+	    breed,
+	    comma);
+    
+    
+    algo(pop);
+    pop.sort();
+    
+    cout << pop[0] << endl; 
+    cout << "Fitness achieved = " << pop[0].fitness() << endl;
+    cout << "Function evaluations = " << evals.value() << endl;
+}
+
+
+
diff --git a/trunk/paradiseo-eo/test/t-eoCheckpointing.cpp b/trunk/paradiseo-eo/test/t-eoCheckpointing.cpp
new file mode 100644
index 000000000..11d5d5932
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoCheckpointing.cpp
@@ -0,0 +1,183 @@
+//-----------------------------------------------------------------------------
+
+// to avoid long name warnings
+#ifdef _MSC_VER
+#pragma warning(disable:4786)
+#endif
+
+#include   // runtime_error
+
+//-----------------------------------------------------------------------------
+// tt.cpp:
+//
+//-----------------------------------------------------------------------------
+
+
+// general
+#include 		// Random number generators
+#include 
+#include 
+#include 
+#include 
+//-----------------------------------------------------------------------------
+
+// include package checkpointing
+#include 
+
+struct Dummy : public EO
+{
+    typedef double Type;
+};
+
+
+struct eoDummyPop : public eoPop
+{
+public :
+    eoDummyPop(int s = 2) { resize(s); }
+};
+
+//-----------------------------------------------------------------------------
+
+int the_main(int argc, char **argv)
+{ // ok, we have a command line parser and a state
+
+    typedef eoBit Chrom;
+
+    eoParser parser(argc, argv);
+
+    // Define Parameters
+    eoValueParam rate(0.01, "mutationRatePerBit", "Initial value for mutation rate per bit");
+    eoValueParam factor(0.99, "mutationFactor", "Decrease factor for mutation rate");
+    eoValueParam seed(time(0), "seed", "Random number seed");
+    eoValueParam load_name("", "Load","Load",'L');
+    eoValueParam save_name("", "Save","Save",'S');
+
+    // Register them
+    parser.processParam(rate,       "Genetic Operators");
+    parser.processParam(factor,     "Genetic Operators");
+    parser.processParam(load_name,  "Persistence");
+    parser.processParam(save_name,  "Persistence");
+    parser.processParam(seed,       "Rng seeding");
+
+   eoState state;
+   state.registerObject(parser);
+
+   if (load_name.value() != "")
+   { // load the parser. This is only neccessary when the user wants to
+     // be able to change the parameters in the state file by hand.
+       state.load(load_name.value()); // load the parser
+   }
+
+    // Create the algorithm here
+    typedef Dummy EoType;
+
+    eoDummyPop pop;
+
+    eoGenContinue genTerm(5); // run for 5 generations
+
+    eoCheckPoint checkpoint(genTerm);
+    // The algorithm will now quit after five generations
+
+    // Create a counter parameter
+    eoValueParam generationCounter(0, "Generation");
+
+    // Create an incrementor (wich is an eoUpdater). Note that the
+    // Parameter's value is passed by reference, so every time the incrementer increments,
+    // the data in generationCounter will change.
+    eoIncrementor increment(generationCounter.value());
+
+    // Add it to the checkpoint, this will result in the counter being incremented every generation
+    checkpoint.add(increment);
+
+    // The file monitor will print parameters to a comma seperated file
+    eoFileMonitor monitor("monitor.csv");
+
+    // the checkpoint mechanism can handle multiple monitors
+    checkpoint.add(monitor);
+
+    // the monitor can monitor parameters such as the generationCounter
+    monitor.add(generationCounter);
+
+    // Second moment stats: average and stdev
+    eoSecondMomentStats stats;
+
+    // Add it to the checkpoint to get it called at the appropriate time
+    checkpoint.add(stats);
+
+    // Add it to the monitor to get it written to the file
+    monitor.add(stats);
+
+    // save state every third generation
+    eoCountedStateSaver stateSaver1(3, state, "generation");
+    // save state every 2 seconds
+    eoTimedStateSaver   stateSaver2(2, state, "time");
+
+    // And add the two savers to the checkpoint
+    checkpoint.add(stateSaver1);
+    checkpoint.add(stateSaver2);
+
+    // Register the algorithm
+    state.registerObject(rng);
+    state.registerObject(pop);
+
+    if (parser.userNeedsHelp())
+    {
+        parser.printHelp(std::cout);
+        return 0;
+    }
+
+    // Either load or initialize
+    if (load_name.value() != "")
+    {
+        state.load(load_name.value()); // load the rest
+    }
+    else
+    {
+        // else
+
+        // initialize rng and population
+
+        rng.reseed(seed.value());
+
+        pop.resize(2);
+
+        pop[0].fitness(1);
+        pop[1].fitness(2);
+    }
+
+    while(checkpoint(pop))
+    {
+        pop[0].fitness(pop[0].fitness() + 1);
+
+        time_t now = time(0);
+
+        while (time(0) == now) {} // wait a second to test timed saver
+
+        std::cout << "gen " << generationCounter.value() << std::endl;
+    }
+
+    // run the algorithm
+
+    // Save when needed
+    if (save_name.value() != "")
+    {
+        std::string file_name = save_name.value();
+        save_name.value() = ""; // so that it does not appear in the parser section of the state file
+        state.save(file_name);
+    }
+
+    return 1;
+}
+
+int main(int argc, char **argv)
+{
+    try
+    {
+        the_main(argc, argv);
+    }
+    catch(std::exception& e)
+    {
+        std::cout << "Exception: " << e.what() << std::endl;
+    }
+
+}
diff --git a/trunk/paradiseo-eo/test/t-eoESAll.cpp b/trunk/paradiseo-eo/test/t-eoESAll.cpp
new file mode 100644
index 000000000..079494042
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoESAll.cpp
@@ -0,0 +1,150 @@
+// Program to test several EO-ES features
+
+#ifdef _MSC_VER
+#pragma warning(disable:4786)
+#endif
+
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+
+#ifdef _MSC_VER
+  #include 
+#endif
+
+using namespace std;
+
+#include 
+
+// representation specific
+#include 
+
+#include "real_value.h"		// the sphere fitness
+
+// Now the main
+///////////////
+typedef eoMinimizingFitness  FitT;
+
+template 
+void runAlgorithm(EOT, eoParser& _parser, eoState& _state);
+
+int main_function(int argc, char *argv[])
+{
+    // Create the command-line parser
+    eoParser parser(argc, argv);  // for user-parameter reading
+    eoState state;    // keeps all things allocated
+    eoValueParam& simpleParam = parser.getORcreateParam(true, "Isotropic",
+                                                              "Isotropic self-adaptive mutation",
+                                                              'i', "ES mutation");
+    eoValueParam& stdevsParam = parser.getORcreateParam(false, "Stdev",
+                                                              "One self-adaptive stDev per variable",
+                                                              's', "ES mutation");
+    eoValueParam& corrParam = parser.getORcreateParam(false, "Correl",
+                                                            "Use correlated mutations",
+                                                            'c', "ES mutation");
+    // Run the appropriate algorithm
+    if (simpleParam.value() == false)
+    {
+        std::cout << "Using eoReal" << std::endl;
+        runAlgorithm(eoReal(), parser, state);
+    }
+    else if (stdevsParam.value() == false)
+    {
+        std::cout << "Using eoEsSimple" << std::endl;
+        runAlgorithm(eoEsSimple(), parser, state);
+    }
+    else if (corrParam.value() == false)
+    {
+        std::cout << "Using eoEsStdev" << std::endl;
+        runAlgorithm(eoEsStdev(), parser, state);
+    }
+    else
+    {
+        std::cout << "Using eoEsFull" << std::endl;
+        runAlgorithm(eoEsFull(), parser, state);
+    }
+    return 0;
+}
+
+
+
+// A main that catches the exceptions
+int main(int argc, char **argv)
+{
+#ifdef _MSC_VER
+    // rng.reseed(42);
+    int flag = _CrtSetDbgFlag(_CRTDBG_LEAK_CHECK_DF);
+    flag |= _CRTDBG_LEAK_CHECK_DF;
+    _CrtSetDbgFlag(flag);
+    // _CrtSetBreakAlloc(100);
+#endif
+    try
+    {
+        main_function(argc, argv);
+    }
+    catch(std::exception& e)
+    {
+        std::cout << "Exception: " << e.what() << '\n';
+    }
+}
+
+
+
+/** The templatized main (sort of)
+
+quite similar to the main of other genotypes (e.g. t-eoReal and t-eoGA
+in test dir)
+*/
+template 
+void runAlgorithm(EOT, eoParser& _parser, eoState& _state)
+{
+    typedef typename EOT::Fitness FitT;
+
+    ///// FIRST, problem or representation dependent stuff
+    //////////////////////////////////////////////////////
+
+    // The evaluation fn - encapsulated into an eval counter for output
+    eoEvalFuncPtr&> mainEval( real_value );
+    eoEvalFuncCounter eval(mainEval);
+
+    // the genotype - through a genotype initializer
+    eoRealInitBounded& init = make_genotype(_parser, _state, EOT());
+
+    // Build the variation operator (any seq/prop construct)
+    eoGenOp& op = make_op(_parser, _state, init);
+
+    //// Now the representation-independent things
+    //////////////////////////////////////////////
+
+    // initialize the population - and evaluate
+    // yes, this is representation indepedent once you have an eoInit
+    eoPop& pop = make_pop(_parser, _state, init);
+    apply(eval, pop);
+
+    // stopping criteria
+    eoContinue & term = make_continue(_parser, _state, eval);
+    // output
+    eoCheckPoint & checkpoint = make_checkpoint(_parser, _state, eval, term);
+    // algorithm (need the operator!)
+    eoAlgo& ga = make_algo_scalar(_parser, _state, eval, checkpoint, op);
+
+    ///// End of construction of the algorith
+    /////////////////////////////////////////
+    // to be called AFTER all parameters have been read!!!
+    make_help(_parser);
+
+    //// GO
+    ///////
+    std::cout << "Initial Population\n";
+    pop.sortedPrintOn(std::cout);
+    std::cout << std::endl;
+
+    run_ea(ga, pop); // run the ga
+
+    std::cout << "Final Population\n";
+    pop.sortedPrintOn(std::cout);
+    std::cout << std::endl;
+}
diff --git a/trunk/paradiseo-eo/test/t-eoESFull.cpp b/trunk/paradiseo-eo/test/t-eoESFull.cpp
new file mode 100644
index 000000000..7a217b586
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoESFull.cpp
@@ -0,0 +1,180 @@
+// Program to test several EO-ES features
+
+#ifdef _MSC_VER
+#pragma warning(disable:4786)
+#endif
+
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+
+using namespace std;
+
+#include 
+
+// representation specific
+#include 
+
+#include "real_value.h"		// the sphere fitness
+
+// Now the main
+///////////////
+typedef eoMinimizingFitness  FitT;
+
+template 
+void runAlgorithm(EOT, eoParser& _parser, eoState& _state, eoRealVectorBounds& _bounds, eoValueParam _load_name);
+
+int main_function(int argc, char *argv[])
+{
+  // Create the command-line parser
+  eoParser parser( argc, argv, "Basic EA for vector with adaptive mutations");
+
+  // Define Parameters and load them
+  eoValueParam& seed        = parser.createParam(static_cast(time(0)),
+                                                           "seed", "Random number seed");
+  eoValueParam& load_name   = parser.createParam(string(), "Load","Load a state file",'L');
+  eoValueParam& save_name   = parser.createParam(string(), "Save","Saves a state file",'S');
+  eoValueParam&   stdevs      = parser.createParam(false, "Stdev", "Use adaptive mutation rates", 's');
+  eoValueParam&   corr        = parser.createParam(false, "Correl", "Use correlated mutations", 'c');
+  eoValueParam& chromSize = parser.createParam(unsigned(50), "ChromSize", "Number of chromosomes", 'n');
+  eoValueParam& minimum     = parser.createParam(-1.0, "Min", "Minimum for Objective Variables", 'l');
+  eoValueParam& maximum     = parser.createParam(1.0, "Max", "Maximum for Objective Variables", 'h');
+
+  eoState state;
+    state.registerObject(parser);
+    rng.reseed(seed.value());
+
+   if (!load_name.value().empty())
+   { // load the parser. This is only neccessary when the user wants to
+     // be able to change the parameters in the state file by hand
+     // Note that only parameters inserted in the parser at this point
+     // will be loaded!.
+       state.load(load_name.value()); // load the parser
+   }
+
+    state.registerObject(rng);
+
+    eoRealVectorBounds bounds(chromSize.value(), minimum.value(), maximum.value());
+
+    // Run the appropriate algorithm
+    if (stdevs.value() == false && corr.value() == false)
+    {
+        runAlgorithm(eoEsSimple() ,parser, state, bounds, load_name);
+    }
+    else if (corr.value() == true)
+    {
+        runAlgorithm(eoEsFull(),parser, state, bounds, load_name);
+    }
+    else
+    {
+        runAlgorithm(eoEsStdev(), parser, state, bounds, load_name);
+    }
+
+    // and save
+    if (!save_name.value().empty())
+    {
+        string file_name = save_name.value();
+        save_name.value() = ""; // so that it does not appear in the parser section of the state file
+        state.save(file_name);
+    }
+
+	return 0;
+}
+
+// A main that catches the exceptions
+
+int main(int argc, char **argv)
+{
+#ifdef _MSC_VER
+  //  rng.reseed(42);
+    int flag = _CrtSetDbgFlag(_CRTDBG_LEAK_CHECK_DF);
+     flag |= _CRTDBG_LEAK_CHECK_DF;
+    _CrtSetDbgFlag(flag);
+//   _CrtSetBreakAlloc(100);
+#endif
+
+    try
+    {
+        main_function(argc, argv);
+    }
+    catch(std::exception& e)
+    {
+        std::cout << "Exception: " << e.what() << '\n';
+    }
+
+    return 1;
+}
+
+template 
+void runAlgorithm(EOT, eoParser& _parser, eoState& _state, eoRealVectorBounds& _bounds, eoValueParam _load_name)
+{
+    // evaluation
+    eoEvalFuncPtr&> eval(  real_value );
+
+    // population parameters, unfortunately these can not be altered in the state file
+    eoValueParam mu = _parser.createParam(unsigned(7), "mu","Size of the population");
+    eoValueParamlambda_rate = _parser.createParam(double(7.0), "lambda_rate", "Factor of children to produce");
+
+    if (lambda_rate.value() < 1.0f)
+    {
+        throw logic_error("lambda_rate must be larger than 1 in a comma strategy");
+    }
+
+    // Initialization
+    eoEsChromInit init(_bounds);
+
+    // State takes ownership of pop because it needs to save it in caller
+    eoPop& pop = _state.takeOwnership(eoPop(mu.value(), init));
+
+    _state.registerObject(pop);
+
+    if (!_load_name.value().empty())
+    { // The real loading happens here when all objects are registered
+       _state.load(_load_name.value()); // load all and everything
+    }
+    else
+    {
+        // evaluate initial population
+        apply(eval, pop);
+    }
+
+    // Ok, time to set up the algorithm
+    // Proxy for the mutation parameters
+    eoEsMutationInit mutateInit(_parser);
+
+    eoEsMutate mutate(mutateInit, _bounds);
+
+    // monitoring, statistics etc.
+    eoAverageStat average;
+    eoStdoutMonitor monitor;
+
+    monitor.add(average);
+
+    eoGenContinue cnt(100);
+    eoCheckPoint checkpoint(cnt);
+    checkpoint.add(monitor);
+    checkpoint.add(average);
+
+    // only mutation (== with rate 1.0)
+    eoMonGenOp op(mutate);
+
+    // the selection: sequential selection
+    eoSequentialSelect select;
+    // the general breeder (lambda is a rate -> true)
+    eoGeneralBreeder breed(select, op, lambda_rate.value(), true);
+
+    // the replacement - hard-coded Comma replacement
+    eoCommaReplacement replace;
+
+    // now the eoEasyEA
+    eoEasyEA es(checkpoint, eval, breed, replace);
+
+    es(pop);
+
+    pop.sort();
+    std::cout << "Final population\n" << pop << std::endl;
+
+}
diff --git a/trunk/paradiseo-eo/test/t-eoESOps.cpp b/trunk/paradiseo-eo/test/t-eoESOps.cpp
new file mode 100644
index 000000000..d583ada6d
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoESOps.cpp
@@ -0,0 +1,116 @@
+// Program to test several EO-ES features
+
+#ifdef _MSC_VER
+#pragma warning(disable:4786)
+#endif 
+
+#include 
+#include 
+#include 
+
+using namespace std;
+
+// general
+#include             // though contained in all others!
+// evolution specific
+#include 
+//#include 
+//#include 
+// representation specific
+
+#include             // though contained in following
+//#include 
+#include 
+//#include 
+// this fitness
+#include "real_value.h"		// the sphere fitness
+
+// Now the main 
+/////////////// 
+typedef eoESFullChrom Ind;
+  
+main(int argc, char *argv[]) {
+  unsigned mu, lambda;
+  bool comma;
+
+  // Create the command-line parser
+  Parser parser( argc, argv, "Basic EA for vector with adaptive mutations");
+
+  //reproducible random seed - thanks, Maarten
+  InitRandom(parser);
+
+  // a first Ind, reading its parameters from the parser
+  // will be used later to inialize the whole population
+  Ind FirstEO(parser);
+
+  // Evaluation
+  // here we should call some  parser-based constructor, 
+  // as many evaluation function need parameters
+  // and also have some preliminary stuffs to do
+  eoEvalFuncPtr eval(  real_value );
+
+ // recombination and mutation operators, reading their parameters from the parser
+  eoESMutate MyMut(parser, 
+			  FirstEO.StdDevLength(), FirstEO.size(), 
+			  FirstEO.CorCffLength() );
+
+  std::cout << "First EO " << FirstEO << std::endl;
+  MyMut(FirstEO);
+  std::cout << "First EO mutated" << FirstEO << std::endl;
+
+  /*
+  // Evolution and population parameters
+  eoScheme the_scheme(parser);
+
+  // recombination and mutation operators, reading their parameters from the parser
+  eoESReco MyReco(parser, FirstEO);
+  eoESMutate MyMut(parser, FirstEO);
+
+  // termination conditions read by the parser
+  eoTermVector the_terms(parser);
+  
+  // Initialization of the population
+  // shoudl be called using the parser, in case you want to read from file(s)
+  eoESRandomize randomize;	// an eoESInd randomnizer
+  eoPop pop(the_scheme.PopSize(), FirstEO, randomize); 
+  // eval(pop);    // shoudl we call it from inside the constructor???
+
+  // ALL parmeters have been read: write them out
+  //  Writing the parameters on arv[0].status 
+  // but of course this can be modified - see the example parser.cpp
+  parser.outputParam();
+  // except the help parameter???
+  if( parser.getBool("-h" , "--help" , "Shows this help")) {
+    parser.printHelp();
+    exit(1);
+  }
+
+  unsigned i, iind;
+
+
+    std::cout << "Initial population: \n" << std::endl;
+    for (i = 0; i < pop.size(); ++i) {
+      eval(pop[i]);
+      std::cout << pop[i].fitness() << "\t" << pop[i] << std::endl;
+    }
+
+  // the Operators
+  eoSequentialOpHolder  seqholder;
+  //  seqholder.addOp(MyReco, 1.0);
+  seqholder.addOp(MyMut, 1.0);
+
+  // One generation
+  eoEvolStep evol_scheme(the_scheme, seqholder, eval);
+  
+  // the algorithm: 
+  eoFullEA ea(evol_scheme, the_terms);
+
+  ea(pop);
+  
+    std::cout << "Final population: \n" << std::endl;
+  for (i = 0; i < pop.size(); ++i)
+    std::cout << pop[i].fitness() << "\t" << pop[i] << std::endl;
+  return 0;
+  */
+}
+
diff --git a/trunk/paradiseo-eo/test/t-eoEasyEA.cpp b/trunk/paradiseo-eo/test/t-eoEasyEA.cpp
new file mode 100644
index 000000000..1b201cfad
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoEasyEA.cpp
@@ -0,0 +1,84 @@
+//-----------------------------------------------------------------------------
+// t-eoEasyEA.cpp
+//-----------------------------------------------------------------------------
+
+#ifndef __GNUG__
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif // __GNUG__
+
+#include 
+
+#include "binary_value.h"
+
+//-----------------------------------------------------------------------------
+
+typedef eoBin Chrom;
+
+//-----------------------------------------------------------------------------
+
+main()
+{
+  const unsigned POP_SIZE = 8, CHROM_SIZE = 16;
+  unsigned i;
+
+// a chromosome randomizer
+  eoBinRandom random;
+// the populations: 
+  eoPop pop; 
+
+   // Evaluation
+  eoEvalFuncPtr eval(  binary_value );
+ 
+  for (i = 0; i < POP_SIZE; ++i)
+    {
+      Chrom chrom(CHROM_SIZE);
+      random(chrom);
+      eval(chrom);
+      pop.push_back(chrom);
+    }
+  
+  std::cout << "population:" << std::endl;
+  for (i = 0; i < pop.size(); ++i)
+    std::cout << "\t" << pop[i] << " " << pop[i].fitness() << std::endl;
+
+  
+  // selection
+  eoLottery lottery;
+
+  // breeder
+  eoBinBitFlip bitflip;
+  eoBinCrossover xover;
+  eoProportionalOpSel propSel;
+  eoBreeder breeder( propSel );
+  propSel.addOp(bitflip, 0.25);
+  propSel.addOp(xover, 0.75);
+  
+  // replacement
+  eoInclusion inclusion;
+
+  // Terminators
+  eoFitTerm term( pow(2.0, CHROM_SIZE), 1 );
+
+  // GA generation
+  eoEasyEA ea(lottery, breeder, inclusion, eval, term);
+
+  // evolution
+  try
+    {
+      ea(pop);
+    }
+  catch (std::exception& e)
+    {
+	std::cout << "exception: " << e.what() << std::endl;;
+	exit(EXIT_FAILURE);
+    }
+  
+  std::cout << "pop" << std::endl;
+  for (i = 0; i < pop.size(); ++i)
+    std::cout << "\t" <<  pop[i] << " " << pop[i].fitness() << std::endl;
+  
+  return 0;
+}
+
+//-----------------------------------------------------------------------------
diff --git a/trunk/paradiseo-eo/test/t-eoExternalEO.cpp b/trunk/paradiseo-eo/test/t-eoExternalEO.cpp
new file mode 100644
index 000000000..f8f71c93f
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoExternalEO.cpp
@@ -0,0 +1,132 @@
+// to avoid long name warnings
+#ifdef _MSC_VER
+#pragma warning(disable:4786)
+#endif
+
+#include 
+#include   // runtime_error 
+
+#include 
+#include 
+#include 
+
+using namespace std;
+
+struct UserDefStruct
+{
+    int a;
+    float b;
+    double c;
+    enum Enum { just, another, test } d;
+};
+
+std::ostream& operator<<(std::ostream& os, const UserDefStruct& str)
+{
+    return os << str.a << ' ' << str.b << ' ' << str.c << ' ' << static_cast(str.d) << ' ';
+}
+
+istream& operator>>(istream& is, UserDefStruct& str)
+{
+    is >> str.a;
+    is >> str.b;
+    is >> str.c;
+    int i;
+    is >> i;
+    str.d = static_cast(i);
+
+    return is;
+}
+
+
+UserDefStruct RandomStruct()
+{
+    std::cout << "RandomStruct\n";
+
+    UserDefStruct result;
+
+    result.a = rng.random(5);
+    result.b = rng.uniform();
+    result.c = rng.uniform();
+    result.d = UserDefStruct::another;
+
+    return result;
+}
+
+// reading and writing
+
+
+bool UserDefMutate(UserDefStruct& a)
+{
+    std::cout << "UserDefMutate\n";
+    a = RandomStruct(); // just for testing
+
+    if (rng.flip(0.1f))
+        a.d = UserDefStruct::test;
+    else
+        a.d = UserDefStruct::another;
+    return true;
+}
+
+bool UserDefBinCrossover(UserDefStruct& a, const UserDefStruct& b)
+{
+    std::cout << "UserDefBinCrossover\n";
+
+    if (rng.flip(0.5))
+        a.a = b.a;
+    if (rng.flip(0.5))
+        a.b = b.b;
+    if (rng.flip(0.5))
+        a.c = b.c;
+    if (rng.flip(0.5))
+        a.d = b.d;
+    return true;
+}
+
+bool UserDefQuadCrossover(UserDefStruct& a, UserDefStruct& b)
+{
+    std::cout << "UserDefQuadCrossover\n";
+    if (rng.flip(0.5))
+        swap(a.a, b.a);
+    if (rng.flip(0.5))
+        swap(a.b, b.b);
+    if (rng.flip(0.5))
+        swap(a.c, b.c);
+    if (rng.flip(0.5))
+        swap(a.d, b.d);
+
+    return true;
+}
+
+float UserDefEvalFunc(const UserDefStruct& a)
+{
+    std::cout << "UserDefEvalFunc\n";
+    return a.b;
+}
+
+int main()
+{
+    typedef UserDefStruct External;
+    typedef float FitnessType;
+    typedef eoExternalEO EoType;
+
+    eoExternalInit init(RandomStruct);
+    eoExternalMonOp mutate(UserDefMutate);
+    eoExternalBinOp cross1(UserDefBinCrossover);
+    eoExternalQuadOp cross2(UserDefQuadCrossover);
+
+    // eoExternalEvalFunc   eval(UserDefEvalFunc);
+
+    EoType eo1;
+    init(eo1);
+    EoType eo2;
+    init(eo2);
+
+    std::cout << "before mutation " << eo1 << '\n';
+    mutate(eo1);
+    std::cout << "after mutation " << eo1 << '\n';
+    cross1(eo1, eo2);
+    std::cout << "after crossover " << eo1 << '\n';
+
+    cross2(eo1,eo2);
+
+};
diff --git a/trunk/paradiseo-eo/test/t-eoFitnessAssembled.cpp b/trunk/paradiseo-eo/test/t-eoFitnessAssembled.cpp
new file mode 100644
index 000000000..5a492aedf
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoFitnessAssembled.cpp
@@ -0,0 +1,105 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+ 
+//-----------------------------------------------------------------------------
+// t-eoFitnessAssembled.cpp
+// Marc Wintermantel & Oliver Koenig
+// IMES-ST@ETHZ.CH
+// March 2003
+
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+ 
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+ 
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ 
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@inria.fr
+             mak@dhi.dk
+*/
+//-----------------------------------------------------------------------------
+#include 
+#include 
+
+#include "eoScalarFitnessAssembled.h"
+
+void test_eoScalarFitnessAssembledClass(){
+  
+  // Create instances
+  eoAssembledMinimizingFitness A,B,C(5, 1.3, "C value");
+
+  // Add some values to them
+  A.push_back( 5.6, "first value"  );
+  A.push_back( 3.2, "second value" );
+  A.push_back( 2.6, "third value" );
+
+  B.push_back( 1.2 );
+  B.push_back( 3.2 );
+  B.push_back( 5.2 );
+
+  B.setDescription( 1, "B descr" );
+
+  std::cout << "Created instances A,B and C, added some vals; testing << operator " << std::endl;
+  std::cout << "A= " << A << std::endl;
+  std::cout << "B= " << B << std::endl;
+  std::cout << "C= " << C << std::endl;
+  std::cout << "Printing values and descriptions: " << std::endl;
+  std::cout << "A: "; A.printAll( std::cout ); std::cout << std::endl;
+  std::cout << "B: "; B.printAll( std::cout ); std::cout << std::endl; 
+  std::cout << "C: "; C.printAll( std::cout ); std::cout << std::endl;
+  
+  A.resize(8, 100.3, "A resized");
+  std::cout << "Resized A: "; A.printAll( std::cout ); std::cout << std::endl;
+
+  std::cout << "Access fitness values of A and B: " << "f(A)= " << (double) A << " f(B)= " << (double) B << std::endl;
+
+  // Testing constructors and assignments
+  eoAssembledMinimizingFitness D(A) ,E(3.2);
+  std::cout << "D(A) = " << D << "\t" << "E(3.2)= " << E << std::endl;
+  eoAssembledMinimizingFitness F,G;
+  F=A;
+  G= 7.5;
+  std::cout << "F = A : " << F << "\t G = 7.5 : " << G << std::endl;
+ 
+  // Comparing...
+  std::cout << "AB: " << (A>B) << std::endl;
+  std::cout << "A<=B: " << (A<=B) << std::endl;
+  std::cout << "A>=B: " << (A>=B) << std::endl;
+
+}
+
+
+
+int main(){
+  
+  std::cout << "-----------------------------------" << std::endl;
+  std::cout << "START t-eoFitnessAssembled" << std::endl;
+
+  try{
+    // Test the fitness class itself
+    test_eoScalarFitnessAssembledClass();
+    
+    
+
+  }
+  catch(std::exception& e){
+    std::cout << e.what() << std::endl;
+    return 1;
+  }
+
+  std::cout << "END  t-eoFitnessAssembled" << std::endl;
+  std::cout << "----------------------------------" << std::endl;
+
+  return 0;
+
+}
+
diff --git a/trunk/paradiseo-eo/test/t-eoFitnessAssembledEA.cpp b/trunk/paradiseo-eo/test/t-eoFitnessAssembledEA.cpp
new file mode 100644
index 000000000..6369ac579
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoFitnessAssembledEA.cpp
@@ -0,0 +1,174 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+ 
+//-----------------------------------------------------------------------------
+// t-eoFitnessAssembledEA.cpp
+// Marc Wintermantel & Oliver Koenig
+// IMES-ST@ETHZ.CH
+// March 2003
+
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+ 
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+ 
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ 
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@inria.fr
+             mak@dhi.dk
+*/
+//-----------------------------------------------------------------------------
+#ifdef HAVE_CONFIG_H
+#include 
+#endif
+
+#include 
+#include 
+
+// General eo includes
+#include 
+#include 	// The real bounds (not yet in general eo include)
+
+// Representation dependent includes and typedefs
+#include 			// Definition of representation
+#include 	// Uniformly initializes real vector in bounds
+#include 		// Initialization of a genotype
+#include 		        // Base class for fitness evaluation 
+#include 		// Variation operators using standard Real operators
+#include      // The fitness class
+typedef eoReal Indi;
+
+// Representation independent modules
+#include 		// Initialization of population
+#include 		// The stopping criterion
+#include 	// Outputs (stats, population dumps, ...)
+#include 	// Evolution engine (selection and replacement)
+#include 		// simple call to the algo.stays there for consistency reasons 
+
+// Define a fitness class
+template 
+class eoAssembledEvalFunc : public eoEvalFunc{
+public:
+  // Constructor defining number and descriptions of fitness terms
+  eoAssembledEvalFunc() {
+    
+    // Define a temporary fitness object to have access to its static traits
+    typename EOT::Fitness tmpfit(3, 0.0);    
+    tmpfit.setDescription(0,"Fitness");
+    tmpfit.setDescription(1,"Some Value");
+    tmpfit.setDescription(2,"Other Value");
+
+  }
+
+  void operator()(EOT& _eo){
+
+    // Define temporary fitness object 
+    // (automatically gets initialized with size given in constructor)
+    typename EOT::Fitness tmpfit;
+    
+    // Eval some dummy fitness
+    double sum1=0.0, sum2=0.0;
+    for (unsigned i=0; i < _eo.size(); ++i){
+      sum1 += _eo[i]*_eo[i];
+      sum2 += fabs(_eo[i]) + fabs(_eo[i]);
+    }
+    
+    // Store some fitness terms
+    tmpfit[1]= sum1;
+    tmpfit[2]= sum2;
+    
+    // Store the fitness
+    tmpfit = (sum1 + sum2)/_eo.size();
+
+    // Pass it
+    _eo.fitness( tmpfit );
+  
+  }
+};
+
+// checks for help demand, and writes the status file and make_help; in libutils
+void make_help(eoParser & _parser);
+
+// now use all of the above, + representation dependent things
+int main(int argc, char* argv[]){
+  
+  std::cout << "-----------------------------------" << std::endl;
+  std::cout << "START t-eoFitnessAssembledEA" << std::endl;
+
+  try{
+
+    // Parser & State
+    eoParser parser(argc, argv);  // for user-parameter reading    
+    eoState state;    // keeps all things allocated
+
+    ////
+    // A) Representation dependent stuff
+    ////
+
+    // The fitness
+    eoAssembledEvalFunc plainEval;
+    // turn that object into an evaluation counter
+    eoEvalFuncCounter eval(plainEval);
+
+    // The genotype
+    eoRealInitBounded& init = do_make_genotype(parser, state, Indi() );
+    
+    // The variation operators
+    eoGenOp& op = do_make_op(parser, state, init);
+
+    ////
+    // B) Create representation independent stuff
+    ////
+
+    // initialize the population
+    // yes, this is representation indepedent once you have an eoInit
+    eoPop& pop   = do_make_pop(parser, state, init);
+
+    // stopping criteria
+    eoContinue & term = do_make_continue(parser, state, eval);
+    // output
+    eoCheckPoint & checkpoint = do_make_checkpoint_assembled(parser, state, eval, term);
+    // algorithm (need the operator!)
+    eoAlgo& ga = do_make_algo_scalar(parser, state, eval, checkpoint, op);
+
+
+    make_help(parser);	// To be called after all parameters have been read !
+
+    ////
+    // C) Run the algorithm
+    ////
+
+    // evaluate intial population AFTER help and status in case it takes time
+    apply(eval, pop);
+    // if you want to print it out
+    std::cout << "Initial Population\n";
+    pop.sortedPrintOn(std::cout);
+    std::cout << std::endl;
+
+    do_run(ga, pop); // run the ga
+
+    std::cout << "Final Population\n";
+    pop.sortedPrintOn(std::cout);
+    std::cout << std::endl;
+    
+  }
+  catch(std::exception& e)
+    {
+      std::cout << e.what() << std::endl;
+      return 1;
+    }
+
+  std::cout << "-----------------------------------" << std::endl;
+  std::cout << "END t-eoFitnessAssembledEA" << std::endl;
+
+  return 0;
+
+}
diff --git a/trunk/paradiseo-eo/test/t-eoFunctor.cpp b/trunk/paradiseo-eo/test/t-eoFunctor.cpp
new file mode 100644
index 000000000..27ccf995d
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoFunctor.cpp
@@ -0,0 +1,49 @@
+
+#include 
+#include 
+
+void f(eoInit& func)
+{
+    int i;
+    func(i);
+}
+
+class Tester : public eoInit
+{
+public :
+    void operator()(int& i)
+    {
+        i=1;
+    }
+};
+
+#include 
+#include 
+#include 
+
+using namespace std;
+
+int main(void)
+{
+    Tester test;
+
+    eoFunctorStore store;
+
+    /// make a counter and store it in 'store'
+    eoInit& cntr = make_counter(functor_category(test), test, store);
+
+    eoUnaryFunctorCounter > cntr2(test);
+
+    f(cntr);
+    f(cntr2);
+    f(cntr2);
+    f(test);
+
+    typedef eoVariableLength EoType;
+    EoType eo;
+
+    eo.push_back(1);
+    eo.push_back(2);
+
+    return 1;
+}
\ No newline at end of file
diff --git a/trunk/paradiseo-eo/test/t-eoGA.cpp b/trunk/paradiseo-eo/test/t-eoGA.cpp
new file mode 100644
index 000000000..effac3b03
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoGA.cpp
@@ -0,0 +1,72 @@
+#include 
+
+#include 
+#include 
+#include "binary_value.h"
+#include 
+
+using namespace std;
+
+int main(int argc, char* argv[])
+{
+
+  try
+  {
+  typedef eoBit EOT;
+
+  eoParser parser(argc, argv);  // for user-parameter reading
+
+  eoState state;    // keeps all things allocated
+
+  ///// FIRST, problem or representation dependent stuff
+  //////////////////////////////////////////////////////
+
+  // The evaluation fn - encapsulated into an eval counter for output 
+  eoEvalFuncPtr mainEval( binary_value );
+  eoEvalFuncCounter eval(mainEval);
+
+  // the genotype - through a genotype initializer
+  eoInit& init = make_genotype(parser, state, EOT());
+
+  // Build the variation operator (any seq/prop construct)
+  eoGenOp& op = make_op(parser, state, init);
+
+  //// Now the representation-independent things
+  //////////////////////////////////////////////
+
+  // initialize the population - and evaluate
+  // yes, this is representation indepedent once you have an eoInit
+  eoPop& pop   = make_pop(parser, state, init);
+
+  // stopping criteria
+  eoContinue & term = make_continue(parser, state, eval);
+  // output
+  eoCheckPoint & checkpoint = make_checkpoint(parser, state, eval, term);
+  // algorithm (need the operator!)
+  eoAlgo& ga = make_algo_scalar(parser, state, eval, checkpoint, op);
+
+  ///// End of construction of the algorith
+  /////////////////////////////////////////
+  // to be called AFTER all parameters have been read!!!
+  make_help(parser);
+
+  //// GO
+  ///////
+  // evaluate intial population AFTER help and status in case it takes time
+  apply(eval, pop);
+  // print it out
+  std::cout << "Initial Population\n";
+  pop.sortedPrintOn(std::cout);
+  std::cout << std::endl;
+
+  run_ea(ga, pop); // run the ga
+
+  std::cout << "Final Population\n";
+  pop.sortedPrintOn(std::cout);
+  std::cout << std::endl;
+  }
+  catch(std::exception& e)
+  {
+    std::cout << e.what() << std::endl;
+  }
+}
diff --git a/trunk/paradiseo-eo/test/t-eoGOpSel.cpp b/trunk/paradiseo-eo/test/t-eoGOpSel.cpp
new file mode 100644
index 000000000..2606bab69
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoGOpSel.cpp
@@ -0,0 +1,131 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+    t-eoGOpSel.cpp
+      Testing proportional operator selectors
+
+    (c) Maarten Keijzer and GeNeura Team, 2000 
+ 
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ 
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+            
+*/
+
+//-----------------------------------------------------------------------------// 
+
+#ifndef __GNUG__
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif // __GNUG__
+
+#include 
+
+#include   // eoBin, eoPop, eoBreeder
+#include 
+#include 
+#include 
+#include 
+#include 
+
+#include 
+#include 
+#include 
+
+#include 
+
+#include 
+#include 
+
+// Fitness evaluation
+#include "binary_value.h"
+
+//-----------------------------------------------------------------------------
+
+typedef eoBin Chrom;
+
+//-----------------------------------------------------------------------------
+
+main()
+{
+  rng.reseed(42); // reproducible random seed
+
+  const unsigned POP_SIZE = 8, CHROM_SIZE = 4;
+  unsigned i;
+
+  eoBinRandom random;
+  eoPop pop; 
+  
+  for (i = 0; i < POP_SIZE; ++i)
+    {
+      Chrom chrom(CHROM_SIZE);
+      random(chrom);
+      chrom.fitness(binary_value(chrom));
+      pop.push_back(chrom);
+    }
+  
+  std::cout << "population:" << std::endl;
+  for (i = 0; i < pop.size(); ++i)
+    std::cout << pop[i] << " " << pop[i].fitness() << std::endl;
+
+  eoBinBitFlip bitflip;
+  eoBinCrossover xover;
+  
+  eoEvalFuncPtr eval(binary_value);
+
+  //Create the proportional operator selector and add the 
+  // two operators creatd above to it.
+
+  eoProportionalGOpSel propSel;
+  eoSequentialGOpSel    seqSel;
+
+  propSel.addOp(bitflip, 0.5);
+  propSel.addOp(xover, 0.5);
+  
+  // seqSel selects operator in sequence, creating a combined operator
+  // add a bitflip, an xover and another bitflip
+  seqSel.addOp(bitflip, 0.25);
+  seqSel.addOp(xover, 0.5);
+  seqSel.addOp(bitflip, 0.25);
+
+
+  eoRandomIndiSelector         selector1;
+  eoDetTournamentIndiSelector  selector2(2);
+
+  eoBackInserter inserter1;
+  eoDetTournamentInserter inserter2(eval, 2);
+  eoStochTournamentInserter inserter3(eval, 0.9f);
+
+  eoGOpBreeder breeder1(propSel, selector1);
+  eoGOpBreeder breeder2(seqSel, selector1);
+  eoGOpBreeder breeder3(propSel, selector2);
+  eoGOpBreeder breeder4(seqSel, selector2);
+
+  // test the breeders
+
+  breeder1(pop);
+  breeder2(pop);
+  breeder3(pop);
+  breeder4(pop);
+
+  eoState state;
+
+  state.registerObject(pop);
+
+  state.save(std::std::cout);
+    
+  return 0;
+}
+
+//-----------------------------------------------------------------------------
diff --git a/trunk/paradiseo-eo/test/t-eoGenOp.cpp b/trunk/paradiseo-eo/test/t-eoGenOp.cpp
new file mode 100644
index 000000000..45a790db8
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoGenOp.cpp
@@ -0,0 +1,428 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// eoGenOp.cpp
+// (c) Maarten Keijzer and Marc Schoenauer, 2001
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: mkeijzer@dhi.dk
+             Marc.Schoenauer@polytechnique.fr
+ */
+//-----------------------------------------------------------------------------
+
+/**  test program for the general operator - millenium version!
+ * uses dummy individuals
+ */
+
+#include 
+
+#include 
+#include 
+#include 
+
+struct Dummy : public EO
+{
+  typedef double Type;
+  Dummy(std::string _s="") : s(_s) {}
+
+  void printOn(std::ostream & _os) const
+  {
+    EO::printOn(_os);
+    _os << " - " << s ;
+  }
+
+  std::string s;
+};
+
+typedef Dummy EOT;
+
+unsigned int pSize;	 // global to be used as marker in the fitness
+
+// DEFINITIONS of the eoOps
+class monop : public eoMonOp
+{
+  public :
+  monop(char * _sig){sig=_sig;}
+    bool operator()(EOT& _eo)
+    {
+      _eo.s = sig + "(" + _eo.s + ")";
+      _eo.fitness(_eo.fitness()+pSize);
+      return false;
+    }
+  std::string className() const {return sig;}
+    private:
+    std::string sig;
+};
+
+class binop: public eoBinOp
+{
+  public :
+    bool operator()(EOT& _eo1, const EOT& _eo2)
+    {
+      _eo1.s = "bin(" + _eo1.s + "," + _eo2.s + ")";
+      double f= (_eo1.fitness()+_eo2.fitness()) * pSize;
+      _eo1.fitness(_eo1.fitness()+f);
+      return false;
+    }
+  std::string className() const {return "binop";}
+};
+
+class quadop: public eoQuadOp
+{
+  public :
+  std::string className() const {return "quadop";}
+    bool operator()(EOT& a, EOT& b)
+    {
+      EOT oi = a;
+      EOT oj = b;
+
+      a.s = "quad1(" + oi.s + "," + oj.s + ")";
+      b.s = "quad2(" + oj.s + "," + oi.s + ")";
+      double f= (a.fitness()+b.fitness()+2*pSize) * pSize;
+      a.fitness(a.fitness()+f);
+      b.fitness(b.fitness()+f);
+      return false;
+    }
+};
+// an eoQuadOp that does nothing
+class quadClone: public eoQuadOp
+{
+  public :
+  std::string className() const {return "quadclone";}
+    bool operator()(EOT& , EOT& ) {return false;}
+};
+
+// User defined General Operator... adapted from Marc's example
+
+class one2threeOp : public eoGenOp // :-)
+{
+  public:
+    unsigned max_production(void) { return 3; }
+
+    void apply(eoPopulator& _plop)
+    {
+      EOT& eo = *_plop; // select the guy
+
+      ++_plop; // advance
+      _plop.insert("v(" + eo.s + ", 1)");
+      ++_plop;
+      _plop.insert("v(" + eo.s + ", 2)");
+      eo.s  =  "v(" + eo.s + ", 0)"; // only now change the thing
+      // oh right, and invalidate fitnesses
+    }
+  virtual std::string className() const {return "one2threeOp";}
+};
+
+
+class two2oneOp : public eoGenOp // :-)
+{
+  public:
+    unsigned max_production(void) { return 1; }
+
+    void apply(eoPopulator& _plop)
+    {
+      EOT& eo = *_plop; // select the guy
+      const EOT& eo2 = _plop.select();
+      eo.s  =  "221(" + eo.s + ", " + eo2.s + ")";
+      // oh right, and invalidate fitnesses
+    }
+  virtual std::string className() const {return "two2oneOp";}
+};
+
+class three2threeOp : public eoGenOp // :-)
+{
+  public:
+    unsigned max_production(void) { return 3; }
+
+    void apply(eoPopulator& _plop)
+    {
+      EOT& eo1 = *_plop; // select 1st guy
+      EOT& eo2 = *++_plop; // select 2nd guy
+      EOT& eo3 = *++_plop; // select 3rd guy
+      EOT a = eo1;
+      EOT b = eo2;
+      EOT c = eo3;
+      std::cout << "les selectionnes: a=" << a << " et b=" << b << " et c=" << c << std::endl;
+      eo1.s  =  "323-1(" + a.s + ", " + b.s + ", " + c.s + ")";
+      eo2.s  =  "323-2(" + a.s + ", " + b.s + ", " + c.s + ")";
+      eo3.s  =  "323-3(" + a.s + ", " + b.s + ", " + c.s + ")";
+      // oh right, and invalidate fitnesses
+      std::cout << "les enfants: a=" << eo1 << " et b=" << eo2 << " et c=" << eo3 << std::endl;
+    }
+  virtual std::string className() const {return "three2threeOp";}
+};
+
+
+// dummy intialization. Re-init if no pSize, resize first if pSize
+void init(eoPop & _pop, unsigned _pSize)
+{
+  if (_pSize)
+    {
+      _pop.resize(_pSize);
+    }
+  else
+    {
+      throw std::runtime_error("init pop with 0 size");
+    }
+  for (unsigned i=0; i<_pSize; i++)
+    {
+	std::ostringstream os;
+      os << i << std::ends;
+      _pop[i] = Dummy(os.str());
+      _pop[i].fitness(i);
+    }
+}
+
+// ok, now for the real work
+int the_main(int argc, char **argv)
+{
+
+  eoParser parser(argc, argv);
+  eoValueParam parentSizeParam = parser.createParam(unsigned(10), "parentSize", "Parent size",'P');
+    pSize = parentSizeParam.value(); // global variable
+
+    eoValueParam seedParam(time(0), "seed", "Random number seed", 'S');
+    parser.processParam( seedParam );
+    eo::rng.reseed(seedParam.value());
+
+   // do the following AFTER ALL PARAMETERS HAVE BEEN PROCESSED
+   // i.e. in case you need parameters somewhere else, postpone these
+    if (parser.userNeedsHelp())
+      {
+        parser.printHelp(std::cout);
+        exit(1);
+      }
+
+  ////////////////////////////////// define operators
+  monop mon("mon1");
+  monop clone("clone");
+  binop bin;
+  quadop quad;
+  quadClone quadclone;
+
+  // our own operator
+  one2threeOp o2t;
+  two2oneOp t2o;
+  three2threeOp t2t;
+
+
+  // a selector
+  eoDetTournamentSelect select;
+  // and a recognizable selector for testing the inbedded selector mechanism
+  eoBestSelect selectBest;
+
+  // proportional selection between quad and bin
+  // so we either do a quad or a bin
+  eoProportionalOp pOp;
+  pOp.add(quad, 0.1);
+  pOp.add(bin, 0.1);
+
+  // sequential selection between pOp and mon
+  eoSequentialOp sOp;
+  sOp.add(pOp, 0.9);
+  sOp.add(mon, 0.1);
+
+  // with one2three op
+  eoSequentialOp sOp2;
+  sOp2.add(o2t, 1);
+  //  sOp2.add(quad, 1);
+
+  // with three2three op
+  eoSequentialOp sOp3;
+  sOp3.add(t2t, 1);
+
+//   eoSequentialOp sOp3;
+//   sOp3.add(t2o, 1);
+//   sOp3.add(bin, 1);
+//   sOp3.add(quad, 1);
+  // try adding quads and bins to see what results you'll get
+
+  // now a sequential selection that is a simple "addition"
+  eoSequentialOp sOpQuadPlusMon;
+  sOpQuadPlusMon.add(quad, 1);
+  sOpQuadPlusMon.add(mon, 1);
+
+  // this corresponds
+  eoProportionalOp pOpSAGLike;
+  pOpSAGLike.add(sOpQuadPlusMon, 0.24);
+  pOpSAGLike.add(quad, 0.56);
+  pOpSAGLike.add(mon, 0.06);
+  pOpSAGLike.add(clone, 0.14);
+
+  // init
+  eoPop pop;
+  eoPop offspring;
+
+  init(pop, pSize);
+// sort pop so seqPopulator is identical to SelectPopulator(SequentialSelect)
+  pop.sort();
+  std::cout << "Population initiale\n" << pop << std::endl;
+
+  // To simulate SGA: first a prop between quadOp and quadClone
+  eoProportionalOp pSGAOp;
+  pSGAOp.add(quad, 0.8);
+  pSGAOp.add(quadclone, 0.2);
+  // sequential selection between pSGAOp and mon
+  eoSequentialOp virtualSGA;
+  virtualSGA.add(pSGAOp, 1.0);
+  virtualSGA.add(mon, 0.3);
+
+  eoSeqPopulator popit(pop, offspring);  // no selection, a copy of pop
+
+  // until we filled a new population
+  try
+    {
+     while (offspring.size() < pop.size())
+	   {
+	     virtualSGA(popit);
+	     std::cout << "SeqPopulator boucle et incremente\n";
+       ++popit;
+	   }
+    }
+  catch(eoPopulator::OutOfIndividuals&)
+    {
+      std::cout << "Warning: not enough individuals to handle\n";
+    }
+
+
+  std::swap(pop, offspring);
+  offspring.clear();
+
+  // ok, now print
+  std::cout << "Apres virtualSGA \n" << pop << std::endl;
+  init(pop, pSize);
+
+  std::cout << "=========================================================\n";
+  std::cout << "Now the eoSelectPopulator version !" << std::endl;
+
+  eoSequentialSelect seqSelect;
+  //   select.init(); should be sorted out: is it the setup method???
+  eoSelectivePopulator it_step3(pop, offspring, seqSelect);
+
+  while (offspring.size() < 2*pop.size())
+  {
+    virtualSGA(it_step3);
+	     std::cout << "SelectPopulator boucle et incremente\n";
+    ++it_step3;
+  }
+
+  std::swap(pop, offspring);
+  offspring.clear();
+
+    // ok, now print
+  std::cout << "Apres SGA-like eoSelectivePopulator\n" << pop << std::endl;
+
+  std::cout << "=========================================================\n";
+  std::cout << "Now the pure addition !" << std::endl;
+
+  init(pop, pSize);
+  eoSelectivePopulator it_step4(pop, offspring, seqSelect);
+  while (offspring.size() < 2*pop.size())
+  {
+    sOpQuadPlusMon(it_step4);
+    ++it_step4;
+  }
+
+  std::swap(pop, offspring);
+  offspring.clear();
+
+    // ok, now print
+  std::cout << "Apres Quad+Mon ds un eoSelectivePopulator\n" << pop << std::endl;
+
+  // On teste 1->3
+  init(pop, pSize);
+  eoSelectivePopulator it_step5(pop, offspring, seqSelect);
+  while (offspring.size() < 2*pop.size())
+  {
+    sOp2(it_step5);
+    ++it_step5;
+  }
+
+  std::swap(pop, offspring);
+  offspring.clear();
+
+    // ok, now print
+  std::cout << "Apres 1->3 seul ds un eoSelectivePopulator\n" << pop << std::endl;
+
+  // On teste 3->3
+  init(pop, pSize);
+  eoSelectivePopulator it_step6(pop, offspring, seqSelect);
+  while (offspring.size() < 2*pop.size())
+  {
+    sOp3(it_step6);
+    ++it_step6;
+  }
+
+  std::swap(pop, offspring);
+  offspring.clear();
+
+    // ok, now print
+  std::cout << "Apres 3->3 seul ds un eoSelectivePopulator\n" << pop << std::endl;
+
+
+  return 1;
+}
+
+int main(int argc, char **argv)
+{
+    try
+    {
+        the_main(argc, argv);
+    }
+    catch(std::exception& e)
+    {
+        std::cout << "Exception: " << e.what() << std::endl;
+    }
+
+}
+
+/*
+If you want to build an SGA, you will need a copying quad op:
+
+class quadclone : ...
+{
+  operator(EOT& a, EOT& b)
+  {
+    // do nothing
+  }
+
+}
+
+Then the SGA operator will look like:
+
+quadop quad;
+guadclone clone;
+
+ProportionalGenOp pOp;
+pOp.add(quad, 0.8);
+pOp.add(clone, 0.2); // so 80% xover rate
+
+SequentialGenOp sOp;
+sOp.add(pOp, 1,0); // always try a xover (clone 20%)
+sOp.add(mut, 0.1); // low mutation rate
+
+will result in an algorithm with:
+
+p_xover = 0.8
+p_mut   = 0.1;
+
+p_reproduction = 0.2 * 0.9 = 0.18
+
+this does not add up to 1 because xover and mutation can be applied to a single indi
+
+So what do you think?
+
+*/
diff --git a/trunk/paradiseo-eo/test/t-eoNonUniform.cpp b/trunk/paradiseo-eo/test/t-eoNonUniform.cpp
new file mode 100644
index 000000000..3a59bc8c2
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoNonUniform.cpp
@@ -0,0 +1,31 @@
+//-----------------------------------------------------------------------------
+// t-eoNonUniform.cc
+//-----------------------------------------------------------------------------
+
+#include       
+#include 
+
+//-----------------------------------------------------------------------------
+
+main()
+{
+  eoNonUniform nu(1000);
+
+  std::cout << "----------------------------------------------------------" << std::endl
+       << "nu.step() = " << nu.step()
+       << "\t nu.num_step() = " << nu.num_step() << std::endl
+       << "----------------------------------------------------------" << std::endl;
+  
+  eoLinear l1(0, 1, nu), l2(1, 0, nu);
+  eoNegExp2 n1(0.1, 8, nu), n2(0.75, 3, nu);
+  
+  for (; nu; ++nu)
+    {      
+      std::cout << nu.step() 
+	   << "\t" << l1() << "\t" << l2()
+	   << "\t" << n1() << "\t" << n2()  
+	   << std::endl;
+    }
+}
+
+//-----------------------------------------------------------------------------
diff --git a/trunk/paradiseo-eo/test/t-eoPBIL.cpp b/trunk/paradiseo-eo/test/t-eoPBIL.cpp
new file mode 100644
index 000000000..b7f39c7b5
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoPBIL.cpp
@@ -0,0 +1,141 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// t-eoPBIL.cpp
+// (c) Marc Schoenauer, 2001
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: Marc.Schoenauer@inria.fr
+ */
+//-----------------------------------------------------------------------------
+
+/** test program for PBIL algorithm */
+
+#include 
+#include 
+#include 
+#include "binary_value.h"
+#include 
+#include 
+#include 
+#include 
+#include 
+
+using namespace std;
+
+typedef eoBit Indi;
+
+// instanciating the outside subroutine that creates the distribution
+#include "ga/make_PBILdistrib.h"
+eoPBILDistrib & make_PBILdistrib(eoParser& _parser, eoState&_state, Indi _eo)
+{
+  return do_make_PBILdistrib(_parser, _state, _eo);
+}
+
+// instanciating the outside subroutine that creates the update rule
+#include "ga/make_PBILupdate.h"
+eoDistribUpdater & make_PBILupdate(eoParser& _parser, eoState&_state, Indi _eo)
+{
+  return do_make_PBILupdate(_parser, _state, _eo);
+}
+
+
+int main(int argc, char* argv[])
+{
+
+  try
+  {
+  eoParser parser(argc, argv);  // for user-parameter reading
+
+  eoState state;    // keeps all things allocated
+
+  ///// FIRST, problem or representation dependent stuff
+  //////////////////////////////////////////////////////
+
+  // The evaluation fn - encapsulated into an eval counter for output
+  eoEvalFuncPtr mainEval( binary_value);
+  eoEvalFuncCounter eval(mainEval);
+
+  // COnstruction of the distribution
+  eoPBILDistrib & distrib = make_PBILdistrib(parser, state, Indi());
+  // and the update rule
+  eoDistribUpdater & update = make_PBILupdate(parser, state, Indi());
+
+  //// Now the representation-independent things
+  //////////////////////////////////////////////
+
+  // stopping criteria
+  eoContinue & term = make_continue(parser, state, eval);
+  // output
+  eoCheckPoint & checkpoint = make_checkpoint(parser, state, eval, term);
+
+  // add a graphical output for the distribution
+  // first, get the direname from the parser
+  //    it has been enetered in make_checkoint
+
+  eoParam* ptParam = parser.getParamWithLongName(string("resDir"));
+  eoValueParam* ptDirNameParam = dynamic_cast*>(ptParam);
+  if (!ptDirNameParam)	// not found
+    throw runtime_error("Parameter resDir not found where it was supposed to be");
+
+  // now create the snapshot monitor
+  eoValueParam& plotDistribParam = parser.getORcreateParam(false, "plotDistrib",
+                                                                 "Plot Distribution", '\0',
+                                                                 "Output - Graphical");
+    if (plotDistribParam.value())
+      {
+	unsigned frequency=1;		// frequency of plots updates
+	eoGnuplot1DSnapshot *distribSnapshot = new eoGnuplot1DSnapshot(ptDirNameParam->value(),
+                                                                       frequency, "distrib");
+	state.storeFunctor(distribSnapshot);
+	// add the distribution (it is an eoValueParam >)
+	distribSnapshot->add(distrib);
+	// and of course add it to the checkpoint
+	checkpoint.add(*distribSnapshot);
+      }
+
+  // the algorithm: EDA
+    // don't know where else to put the population size!
+  unsigned popSize = parser.getORcreateParam(unsigned(100), "popSize",
+                                             "Population Size", 'P', "Algorithm").value();
+  eoSimpleEDA eda(update, eval, popSize, checkpoint);
+
+  ///// End of construction of the algorith
+  /////////////////////////////////////////
+  // to be called AFTER all parameters have been read!!!
+  make_help(parser);
+
+  //// GO
+  ///////
+
+  eda(distrib); // run the eda
+
+  std::cout << "Final Distribution\n";
+  distrib.printOn(std::cout);
+  std::cout << std::endl;
+
+  // wait - for graphical output
+    if (plotDistribParam.value())
+      {
+	string foo;
+	cin >> foo;
+      }
+  }
+  catch(std::exception& e)
+  {
+    std::cout << e.what() << std::endl;
+  }
+}
diff --git a/trunk/paradiseo-eo/test/t-eoPareto.cpp b/trunk/paradiseo-eo/test/t-eoPareto.cpp
new file mode 100644
index 000000000..f98a0d966
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoPareto.cpp
@@ -0,0 +1,248 @@
+
+#include 
+
+//#include 
+#include 
+#include 
+
+using namespace std;
+
+// Look: overloading the maximization without overhead (thing can be inlined)
+class MinimizingFitnessTraits : public eoParetoFitnessTraits
+{
+  public :
+  static bool maximizing(int) { return false; }
+};
+
+typedef eoParetoFitness fitness_type;
+
+const unsigned chromsize=3;
+const double minval = -5;
+const double maxval = 5;
+
+struct eoDouble : public EO
+{
+  double value[chromsize];
+};
+
+class Mutate : public eoMonOp
+{
+  bool operator()(eoDouble& _eo)
+  {
+    for (unsigned i = 0; i < chromsize; ++i)
+    {
+      if (rng.flip(1./chromsize))
+        _eo.value[i] += rng.normal() * 0.1 * _eo.value[i];
+
+      if (_eo.value[i] < minval)
+        _eo.value[i] = minval;
+      else if (_eo.value[i] > maxval)
+        _eo.value[i] = maxval;
+    }
+
+    return true;
+  }
+};
+
+class Eval : public eoEvalFunc
+{
+  void operator()(eoDouble& _eo)
+  {
+    vector x(_eo.value, _eo.value + chromsize);
+    fitness_type f;
+
+    for (unsigned i = 0; i < chromsize; ++i)
+    {
+      if (i < chromsize-1)
+      {
+        f[0] += -10.0 * exp(-0.2 * sqrt(x[i]*x[i] + x[i+1]*x[i+1]));
+      }
+
+      f[1] += pow(fabs(x[i]), 0.8) + 5 * pow(sin(x[i]),3.);
+    }
+
+    _eo.fitness(f);
+  }
+};
+
+class Init : public eoInit
+{
+  void operator()(eoDouble& _eo)
+  {
+    _eo.value[0] = rng.uniform();
+
+    double range = maxval - minval;
+
+    for (unsigned i = 1; i < chromsize; ++i)
+      _eo.value[i] = rng.uniform() * range + minval;
+    _eo.invalidate();
+  }
+};
+
+/** @brief An elitist non-dominated sorted replacement scheme.
+
+Trying out an elitist non-dominated sorted replacement scheme.
+*/
+template 
+class eoNDPlusReplacement : public eoReplacement
+{
+public:
+
+    // using eoNDPlusReplacement< EOT, WorthT >::first;
+
+    eoNDPlusReplacement(eoPerf2Worth& _perf2worth)
+        : perf2worth(_perf2worth)
+        {}
+
+    struct WorthPair : public pair
+    {
+        bool operator<(const WorthPair& other) const
+            { return other.first < this->first; }
+    };
+
+
+  void operator()(eoPop& _parents, eoPop& _offspring)
+  {
+    unsigned sz = _parents.size();
+    _parents.reserve(_parents.size() + _offspring.size());
+    std::copy(_offspring.begin(), _offspring.end(), back_inserter(_parents));
+
+    // calculate worths
+    perf2worth(_parents);
+    perf2worth.sort_pop(_parents);
+    perf2worth.resize(_parents, sz);
+
+    _offspring.clear();
+  }
+
+private :
+    eoPerf2Worth& perf2worth;
+};
+
+template 
+eoPerf2Worth& make_perf2worth(eoParser& parser, eoState& state)
+{
+
+  unsigned what = parser.createParam(unsigned(1), "perf2worth", "worth mapping indicator : \n\t \
+                  0: non_dominated sorting \n\t\
+                  1: non_dominated sorting 2 \n\t\
+                  2: simple ranking \n\t", 'w').value();
+
+  switch (what)
+  {
+    case 1 : return state.storeFunctor(new eoNDSorting_II());
+    case 2 :
+    {
+      eoDominanceMap&  dominance = state.storeFunctor(new eoDominanceMap);
+      return state.storeFunctor(new eoParetoRanking(dominance));
+    }
+  }
+  //default
+
+  if (what > 2)
+  {
+    std::cout << "Warning, need an integer < 3 for perf2worth" << std::endl;
+    // should actually set parser flag, but I don't care
+  }
+
+  return state.storeFunctor(new eoNDSorting_I(0.5));
+}
+
+template 
+eoSelectOne& make_selector(eoParser& parser, eoState& state, eoPerf2Worth& perf2worth)
+{
+  unsigned tournamentsize = parser.createParam(unsigned(2), "tournament_size", "Tournament Size", 't').value();
+  double stochtour = parser.createParam(unsigned(0.95), "tournament_prob", "Probability in stochastic tournament").value();
+
+  switch (parser.createParam(unsigned(0), "selector", "Which selector (too lazy to explain: use the source)", 's').value())
+  {
+    case 1 : return state.storeFunctor(new eoStochTournamentWorthSelect(perf2worth, stochtour));
+    case 2 : return state.storeFunctor(new eoRouletteWorthSelect(perf2worth));
+    case 3 : return state.storeFunctor(new eoRandomSelect);
+  }
+  // default
+
+  return state.storeFunctor(new eoDetTournamentWorthSelect(perf2worth, tournamentsize));
+}
+
+// Test pareto dominance and perf2worth, and while you're at it, test the eoGnuPlot monitor as well
+void the_main(int argc, char* argv[])
+{
+  Init init;
+  Eval eval;
+  Mutate mutate;
+
+  eoParser parser(argc, argv);
+  eoState state;
+
+  unsigned num_gen  = parser.createParam(unsigned(50), "num_gen", "number of generations to run", 'g').value();
+  unsigned pop_size = parser.createParam(unsigned(100), "pop_size", "population size", 'p').value();
+  eoPop pop(pop_size, init);
+
+  // Look, a factory function
+  eoPerf2Worth& perf2worth = make_perf2worth(parser, state);
+
+  // Look: another factory function, now for selection
+  eoSelectOne& select = make_selector(parser, state, perf2worth);
+
+  // One general operator
+  eoProportionalOp opsel;
+  opsel.add(mutate, 1.0);
+
+  // the breeder
+  eoGeneralBreeder breeder(select, opsel);
+
+  // replacement
+  eoNDPlusReplacement replace(perf2worth);
+
+  unsigned long generation = 0;
+  eoGenContinue gen(num_gen, generation);
+  eoCheckPoint cp(gen);
+
+  eoMOFitnessStat fitness0(0, "FirstObjective");
+  eoMOFitnessStat fitness1(1, "SecondObjective");
+
+  cp.add(fitness0);
+  cp.add(fitness1);
+
+  eoGnuplot1DSnapshot snapshot("pareto");
+  //snapshot.with(eoGnuplot::Points(3));
+
+  cp.add(snapshot);
+
+  snapshot.add(fitness0);
+  snapshot.add(fitness1);
+
+  // the algo
+  eoEasyEA ea(cp, eval, breeder, replace);
+
+  if (parser.userNeedsHelp())
+  {
+    parser.printHelp(std::cout);
+    return;
+  }
+
+  apply(eval, pop);
+  ea(pop);
+}
+
+
+int main(int argc, char* argv[])
+{
+  try
+  {
+    the_main(argc, argv);
+  }
+  catch (std::exception& e)
+  {
+    std::cout << "Exception thrown: " << e.what() << std::endl;
+    throw e; // make sure it does not pass the test
+  }
+}
+
+
+
+// Local Variables:
+// mode: C++
+// c-file-style: "Stroustrup"
+// End:
diff --git a/trunk/paradiseo-eo/test/t-eoParetoFitness.cpp b/trunk/paradiseo-eo/test/t-eoParetoFitness.cpp
new file mode 100644
index 000000000..bd5d0d2bd
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoParetoFitness.cpp
@@ -0,0 +1,196 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// t-eoParetoFitness.cpp
+// (c) Maarten Keijzer
+/*
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: mak@dhi.dk
+
+30/01/02 - MS - Added the eoVariableParetoTraits - and the compare Fn
+ */
+//-----------------------------------------------------------------------------
+
+#include 
+#include 
+
+#include "eoParetoFitness.h"
+
+using namespace std;
+
+/** test program for Pareto Fitness */
+
+class MinimizingTraits : public eoParetoFitnessTraits
+{
+public :
+
+  static bool maximizing(int) { return false; }
+};
+
+template 
+void compare(F & _eo1, F & _eo2)
+{
+  if (_eo1.dominates(_eo2))
+    std::cout << _eo1 << " dominates " << _eo2 << std::endl;
+  else if (_eo2.dominates(_eo1))
+    std::cout << _eo2 << " dominates " << _eo1 << std::endl;
+  else
+    std::cout << "None of " << _eo1 << " and " << _eo2 << "dominates the other" << std::endl;
+  return;
+}
+
+int main()
+{
+  typedef eoParetoFitness<> MaxFitness;
+  typedef eoParetoFitness MinFitness;
+
+  typedef eoParetoFitness VarFitness;
+
+  try{
+
+  MaxFitness f0;
+  f0[0] = 0.0;
+  f0[1] = 1.0;
+
+  MaxFitness f1;
+  f1[0] = 1.0;
+  f1[1] = 0.0;
+
+  MaxFitness f2;
+  f2[0] = 0.0;
+  f2[1] = 0.5;
+
+  // now f0 should dominate f2;
+
+  if (!f0.dominates(f2))
+  {
+    std::cout << f2 << " not dominated by " << f0;
+    throw;
+  }
+
+  // f0 and f1 should not dominate each other
+
+  if (f0.dominates(f1) || f1.dominates(f0))
+  {
+    std::cout << f0 << " and " << f1 << " dominate";
+    throw;
+  }
+
+  if (! (f0 == f0))
+  {
+    std::cout << "f0 == f0 failed" << std::endl;
+    throw;
+  }
+
+  // test ctors and such
+  MaxFitness f3 = f0;
+  f3[0] += 1e-9;
+
+  // test tolerance
+  assert(f3 == f0);
+
+  MinFitness m0;
+  MinFitness m1;
+  MinFitness m2;
+  MinFitness m3;
+
+  m0[0] = 0.0;
+  m0[1] = 1.0;
+
+  m1[0] = 1.0;
+  m1[1] = 0.0;
+
+  m2[0] = 0.0;
+  m2[1] = 0.5;
+
+  m3[0] = 0.5;
+  m3[1] = 0.5;
+
+  //m2 should dominate m0
+  assert(m2.dominates(m0));
+
+  assert(!m1.dominates(m0));
+  assert(!m0.dominates(m1));
+  assert(!m0.dominates(m2)); // (m2 < m0));
+  assert(m2.dominates(m3)); //m3 < m2);
+  assert(!m3.dominates(m2)); // (m2 < m3));
+  assert(m2.dominates(m3)); //m2 > m3);
+
+
+  //////////////////////////////////////////
+  // now the run-time set-able number of objectives
+  ////////////////////////////////////////////
+
+  std::cout << "On y va" << std::endl;
+
+
+  // setup fitness WARNING do not try to allocate any EO before that (runtime error)
+  vector b(2, true);
+  b[0]=true; 
+  b[1]=false;
+  VarFitness::setUp(2, b);
+  std::cout << "\nMAXimizing on Obj 0 and MINimizing on Obj 1\n";
+
+  VarFitness mv0;
+  VarFitness mv1;
+  VarFitness mv2;
+  VarFitness mv3;
+
+  mv0[0] = 0.0;
+  mv0[1] = 1.0;
+
+  mv1[0] = 1.0;
+  mv1[1] = 0.0;
+
+  mv2[0] = 0.0;
+  mv2[1] = 0.5;
+
+  mv3[0] = 0.5;
+  mv3[1] = 0.5;
+
+  compare (mv0,mv1);
+  compare (mv0,mv2);
+  compare (mv0,mv3);
+  compare (mv1,mv2);
+  compare (mv1,mv3);
+  compare (mv2,mv3);
+
+  std::cout << "\nChanging now the min <-> max\n";
+  b[0]=false; 
+  b[1]=true;
+  VarFitness::setUp(2, b);
+  std::cout << "\nMINimizing on Obj 0 and MAXimizing on Obj 1\n";
+  compare (mv0,mv1);
+  compare (mv0,mv2);
+  compare (mv0,mv3);
+  compare (mv1,mv2);
+  compare (mv1,mv3);
+  compare (mv2,mv3);
+
+  std::cout << "\nTesting WARNING\n";
+  b.resize(3);
+  b[0]=false; 
+  b[1]=true;
+  b[2]=true;
+  VarFitness::setUp(3, b);
+
+  }
+  catch(std::exception& e)
+  {
+    std::cout << e.what() << std::endl;
+  }
+
+}
diff --git a/trunk/paradiseo-eo/test/t-eoRandom.cpp b/trunk/paradiseo-eo/test/t-eoRandom.cpp
new file mode 100644
index 000000000..14a2803bf
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoRandom.cpp
@@ -0,0 +1,66 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+    t-eoRandom.cpp
+      Test program for random generator
+
+    (c) GeNeura Team, 1999
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+
+*/
+
+/**
+CVS Info: $Date: 2003/02/27 19:20:24 $  $Author: okoenig $ $Revision: 1.13 $
+*/
+
+//-----------------------------------------------------------------------------
+
+#include    // cout
+#include   // ostrstream, istrstream
+#include          // eoBin
+//#include 
+//#include 
+
+//-----------------------------------------------------------------------------
+
+int main() {
+  eoUniformGenerator u1(-2.5,3.5);
+  eoUniformGenerator u2(0.003, 0.05 );
+  eoUniformGenerator u3( 10000U, 10000000U);
+
+  try
+  { // throws an error
+    eoUniformGenerator utest( 10000000U, 10000U);
+    throw; // if this succeeds something is wrong, make sure that that is noticed
+  }
+  catch (std::logic_error& e)
+  {
+    std::cout << e.what() << std::endl;
+  }
+
+  std::ofstream os("t-eoRandom.out");
+
+  for ( unsigned i = 0; i < 100; i ++)
+  {
+    os << u1() << "\t" << u2() << "\t" << u3() << std::endl;
+  }
+
+  return 0; // to avoid VC++ complaints
+
+}
+
+//-----------------------------------------------------------------------------
diff --git a/trunk/paradiseo-eo/test/t-eoReal.cpp b/trunk/paradiseo-eo/test/t-eoReal.cpp
new file mode 100644
index 000000000..851e19829
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoReal.cpp
@@ -0,0 +1,72 @@
+#include 
+
+#include 
+#include "real_value.h"
+#include 
+
+using namespace std;
+
+int main(int argc, char* argv[])
+{
+
+  try
+  {
+  typedef eoReal EOT;
+
+  eoParser parser(argc, argv);  // for user-parameter reading
+
+  eoState state;    // keeps all things allocated
+
+  ///// FIRST, problem or representation dependent stuff
+  //////////////////////////////////////////////////////
+
+  // The evaluation fn - encapsulated into an eval counter for output 
+  eoEvalFuncPtr&> 
+               mainEval( real_value );
+  eoEvalFuncCounter eval(mainEval);
+
+  // the genotype - through a genotype initializer
+  eoRealInitBounded& init = make_genotype(parser, state, EOT());
+
+  // Build the variation operator (any seq/prop construct)
+  eoGenOp& op = make_op(parser, state, init);
+
+  //// Now the representation-independent things
+  //////////////////////////////////////////////
+
+  // initialize the population - and evaluate
+  // yes, this is representation indepedent once you have an eoInit
+  eoPop& pop   = make_pop(parser, state, init);
+
+  // stopping criteria
+  eoContinue & term = make_continue(parser, state, eval);
+  // output
+  eoCheckPoint & checkpoint = make_checkpoint(parser, state, eval, term);
+  // algorithm (need the operator!)
+  eoAlgo& ea = make_algo_scalar(parser, state, eval, checkpoint, op);
+
+  ///// End of construction of the algorith
+  /////////////////////////////////////////
+  // to be called AFTER all parameters have been read!!!
+  make_help(parser);
+
+  //// GO
+  ///////
+  // evaluate intial population AFTER help and status in case it takes time
+  apply(eval, pop);
+  // print it out
+  std::cout << "Initial Population\n";
+  pop.sortedPrintOn(std::cout);
+  std::cout << std::endl;
+
+  run_ea(ea, pop); // run the ea
+
+  std::cout << "Final Population\n";
+  pop.sortedPrintOn(std::cout);
+  std::cout << std::endl;
+  }
+  catch(std::exception& e)
+  {
+    std::cout << e.what() << std::endl;
+  }
+}
diff --git a/trunk/paradiseo-eo/test/t-eoReplacement.cpp b/trunk/paradiseo-eo/test/t-eoReplacement.cpp
new file mode 100644
index 000000000..a0f024060
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoReplacement.cpp
@@ -0,0 +1,223 @@
+//-----------------------------------------------------------------------------
+
+// to avoid long name warnings
+#ifdef _MSC_VER
+#pragma warning(disable:4786)
+#endif
+
+#include   // runtime_error 
+
+//-----------------------------------------------------------------------------
+// tt.cpp: 
+//
+//-----------------------------------------------------------------------------
+
+
+// general
+#include 
+//-----------------------------------------------------------------------------
+
+struct Dummy : public EO
+{
+    typedef double Type;
+  void printOn(std::ostream & _os) const
+  {
+      _os << " - ";
+      EO::printOn(_os);
+  }
+};
+
+
+struct eoDummyPop : public eoPop
+{
+public :
+    eoDummyPop(int s=0) { resize(s); }
+};
+
+//-----------------------------------------------------------------------------
+
+int the_main(int argc, char **argv)
+{ 
+  eoParser parser(argc, argv);
+  eoValueParam parentSizeParam(10, "parentSize", "Parent size",'P');
+  parser.processParam( parentSizeParam );
+    unsigned int pSize = parentSizeParam.value();
+
+  eoValueParam offsrpringSizeParam(10, "offsrpringSize", "Offsrpring size",'O');
+  parser.processParam( offsrpringSizeParam );
+    unsigned int oSize = offsrpringSizeParam.value();
+
+  eoValueParam tournamentSizeParam(2, "tournamentSize", "Deterministic tournament size",'T');
+  parser.processParam( tournamentSizeParam );
+    unsigned int tSize = tournamentSizeParam.value();
+
+  eoValueParam tournamentRateParam(0.75, "tournamentRate", "Stochastic tournament rate",'R');
+  parser.processParam( tournamentRateParam );
+    double tRate = tournamentRateParam.value();
+
+  eoValueParam sParentsElitismRateParam(0.1, "sParentsElitismRateParam", "Strong elitism rate for parents",'E');
+  parser.processParam( sParentsElitismRateParam );
+    double sParentsElitismRate = sParentsElitismRateParam.value();
+
+  eoValueParam sParentsEugenismRateParam(0, "sParentsEugenismRateParam", "Strong Eugenism rate",'e');
+  parser.processParam( sParentsEugenismRateParam );
+    double sParentsEugenismRate = sParentsEugenismRateParam.value();
+
+  eoValueParam sOffspringElitismRateParam(0, "sOffspringElitismRateParam", "Strong elitism rate for parents",'E');
+  parser.processParam( sOffspringElitismRateParam );
+    double sOffspringElitismRate = sOffspringElitismRateParam.value();
+
+  eoValueParam sOffspringEugenismRateParam(0, "sOffspringEugenismRateParam", "Strong Eugenism rate",'e');
+  parser.processParam( sOffspringEugenismRateParam );
+    double sOffspringEugenismRate = sOffspringEugenismRateParam.value();
+
+    if (parser.userNeedsHelp())
+      {
+        parser.printHelp(std::cout);
+        exit(1);
+      }
+
+    unsigned i;
+
+    std::cout << "Testing the replacements\nParents SIze = " << pSize 
+	 << " and offspring size = " << oSize << std::endl;
+
+    rng.reseed(42);
+
+
+    eoDummyPop orgParents(pSize);
+    eoDummyPop orgOffspring(oSize);
+
+    // initialize so we can recognize them later!
+    for (i=0; i genReplace;
+    eoPlusReplacement plusReplace;
+    eoEPReplacement epReplace(tSize);
+    eoCommaReplacement commaReplace;
+    eoWeakElitistReplacement weakElitistReplace(commaReplace);
+    // the SSGA replacements
+    eoSSGAWorseReplacement ssgaWorseReplace;
+    eoSSGADetTournamentReplacement ssgaDTReplace(tSize);
+    eoSSGAStochTournamentReplacement ssgaDSReplace(tRate);
+
+    // here we go
+    // Generational
+    parents = orgParents;
+    offspring = orgOffspring;
+
+    std::cout << "eoGenerationalReplacement\n";
+    std::cout << "=========================\n";
+    genReplace(parents, offspring);
+std::cout << "Parents (originally odd)\n" << parents << "\n And offsprings (orogonally even\n" << offspring << std::endl;
+
+    // Plus
+    parents = orgParents;
+    offspring = orgOffspring;
+
+    std::cout << "eoPlusReplacement\n";
+    std::cout << "=================\n";
+    plusReplace(parents, offspring);
+std::cout << "Parents (originally odd)\n" << parents << "\n And offsprings (originally even)\n" << offspring << std::endl;
+
+    // EP (proche d'un PLUS
+    parents = orgParents;
+    offspring = orgOffspring;
+
+    std::cout << "eoEPReplacement\n";
+    std::cout << "===============\n";
+    epReplace(parents, offspring);
+std::cout << "Parents (originally odd)\n" << parents << "\n And offsprings (originally even)\n" << offspring << std::endl;
+
+    // Comma
+    parents = orgParents;
+    offspring = orgOffspring;
+
+    if (parents.size() > offspring.size() )
+	std::cout << "Skipping Comma Replacement, more parents than offspring\n";
+    else
+      {
+	std::cout << "eoCommaReplacement\n";
+	std::cout << "==================\n";
+	commaReplace(parents, offspring);
+	std::cout << "Parents (originally odd)\n" << parents << "\n And offsprings (originally even)\n" << offspring << std::endl;
+
+	// Comma with weak elitism
+	parents = orgParents;
+	offspring = orgOffspring;
+
+	std::cout << "The same, with WEAK elitism\n";
+	std::cout << "===========================\n";
+	weakElitistReplace(parents, offspring);
+	std::cout << "Parents (originally odd)\n" << parents << "\n And offsprings (originally even)\n" << offspring << std::endl;
+      }
+
+	// preparing SSGA replace worse
+	parents = orgParents;
+	offspring = orgOffspring;
+
+    if (parents.size() < offspring.size() )
+	std::cout << "Skipping all SSGA Replacements, more offspring than parents\n";
+    else
+      {
+	std::cout << "SSGA replace worse\n";
+	std::cout << "==================\n";
+	ssgaWorseReplace(parents, offspring);
+	std::cout << "Parents (originally odd)\n" << parents << "\n And offsprings (originally even)\n" << offspring << std::endl;
+
+    // SSGA deterministic tournament
+	parents = orgParents;
+	offspring = orgOffspring;
+
+	std::cout << "SSGA deterministic tournament\n";
+	std::cout << "=============================\n";
+	ssgaDTReplace(parents, offspring);
+	std::cout << "Parents (originally odd)\n" << parents << "\n And offsprings (originally even)\n" << offspring << std::endl;
+
+    // SSGA stochastic tournament
+	parents = orgParents;
+	offspring = orgOffspring;
+
+	std::cout << "SSGA stochastic tournament\n";
+	std::cout << "==========================\n";
+	ssgaDTReplace(parents, offspring);
+	std::cout << "Parents (originally odd)\n" << parents << "\n And offsprings (originally even)\n" << offspring << std::endl;
+      }
+
+    // the general replacement
+    eoDeterministicSaDReplacement sAdReplace(sParentsElitismRate, sParentsEugenismRate, sOffspringElitismRate, sOffspringEugenismRate);// 10% parents survive
+
+    parents = orgParents;
+    offspring = orgOffspring;
+
+    std::cout << "General - strong elitism\n";
+    std::cout << "========================\n";
+    sAdReplace(parents, offspring);
+    std::cout << "Parents (originally odd)\n" << parents << "\n And offsprings (originally even)\n" << offspring << std::endl;
+
+
+    return 1;
+}
+
+int main(int argc, char **argv)
+{
+    try
+    {
+        the_main(argc, argv);
+    }
+    catch(std::exception& e)
+    {
+        std::cout << "Exception: " << e.what() << std::endl;
+    }
+
+}
diff --git a/trunk/paradiseo-eo/test/t-eoRoulette.cpp b/trunk/paradiseo-eo/test/t-eoRoulette.cpp
new file mode 100644
index 000000000..5c350122c
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoRoulette.cpp
@@ -0,0 +1,68 @@
+
+#include 
+#include 
+#include 
+#include 
+
+class TestEO : public EO { public: unsigned index; };
+
+using namespace std;
+
+template 
+int test_select()
+{
+    vector probs(4);
+    probs[0] = 0.1;
+    probs[1] = 0.4;
+    probs[2] = 0.2;
+    probs[3] = 0.3;
+
+    vector counts(4,0.0);
+
+    // setup population
+    eoPop pop;
+    for (unsigned i = 0; i < probs.size(); ++i)
+    {
+	pop.push_back( TestEO());
+	pop.back().fitness( probs[i] * 2.1232 ); // some number to check scaling
+	pop.back().index = i;
+    }
+
+    Select select;
+    
+    unsigned ndraws = 10000;
+    
+    for (unsigned i = 0; i < ndraws; ++i)
+    {
+	const TestEO& eo = select(pop);
+	
+	counts[eo.index]++;
+    }
+
+    cout << "Threshold = " << 1./sqrt(double(ndraws)) << endl;
+    
+    for (unsigned i = 0; i < 4; ++i)
+    {
+	cout << counts[i]/ndraws << ' ';
+    
+	double c = counts[i]/ndraws;
+
+	if (fabs(c - probs[i]) > 1./sqrt((double)ndraws)) {
+	    cout << "ERROR" << endl;
+	    return 1;
+	}
+    }
+   
+    cout << endl;
+    return 0;
+}
+
+int main()
+{
+    rng.reseed(44);
+
+    if (test_select >()) return 1;
+    
+    return test_select >();
+}
+
diff --git a/trunk/paradiseo-eo/test/t-eoSSGA.cpp b/trunk/paradiseo-eo/test/t-eoSSGA.cpp
new file mode 100644
index 000000000..d1c467e5a
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoSSGA.cpp
@@ -0,0 +1,117 @@
+#include 
+
+// tests a Steady State GA
+
+// Needed to define this breeder, maybe make it a breeder
+template 
+class eoBreedOne : public eoBreed
+{
+public :
+  eoBreedOne(eoSelectOne& _select, eoGenOp& _op) : select(_select), op(_op) {}
+
+  void operator()(const eoPop& _src, eoPop& _dest)
+  {
+    _dest.clear();
+    eoSelectivePopulator pop(_src, _dest, select);
+    op(pop);
+  }
+
+private :
+  eoSelectOne& select;
+  eoGenOp& op;
+};
+
+typedef eoMinimizingFitness FitnessType;
+typedef eoVector EoType;
+
+template 
+class eoMyEval : public eoEvalFunc
+{
+  public :
+
+  void operator()(EOT& _eo)
+  {
+    _eo.fitness(*std::max_element(_eo.begin(), _eo.end()));
+  }
+};
+
+template 
+class Xover : public eoBinOp
+{
+  bool operator()(EOT& _eo, const EOT& _eo2)
+  {
+    unsigned point = rng.random(_eo.size());
+    std::copy(_eo2.begin() + point, _eo2.end(), _eo.begin() + point);
+    return true;
+  }
+};
+
+template 
+class Mutate : public eoMonOp
+{
+  bool operator()(EOT& _eo)
+  {
+    unsigned point = rng.random(_eo.size());
+    _eo[point] = rng.random(1024);
+    return true;
+  }
+};
+
+
+int main()
+{
+  int pop_size = 10;
+
+  eoGenContinue cnt(10);
+  eoCheckPoint cp(cnt);
+
+
+  Xover xover;
+  Mutate mutate;
+
+  eoProportionalOp opsel;
+
+  opsel.add(xover, 0.8);
+  opsel.add(mutate, 0.2);
+
+
+  eoDetTournamentSelect selector(3);
+  eoBreedOne breed(selector, opsel);
+
+  // Replace a single one
+  eoSSGAWorseReplacement replace;
+
+
+//  eoRandomSelect selector;
+//  eoGeneralBreeder breed(selector, opsel);
+//  eoPlusReplacement replace;
+
+
+  eoMyEval eval;
+
+  eoEasyEA algo(cp, eval, breed, replace);
+
+  eoUniformGenerator unif(0,1024);
+  eoInitFixedLength init(20, unif);
+
+  eoPop pop(pop_size, init);
+
+  // evaluate
+  apply(eval, pop);
+
+  eoBestFitnessStat  best("Best_Fitness");
+	eoAverageStat avg("Avg_Fitness");
+  eoStdoutMonitor mon;
+
+  cp.add(best);
+  cp.add(avg);
+
+//  cp.add(mon);
+
+  mon.add(best);
+  mon.add(avg);
+
+  // and run
+  algo(pop);
+
+}
diff --git a/trunk/paradiseo-eo/test/t-eoSelect.cpp b/trunk/paradiseo-eo/test/t-eoSelect.cpp
new file mode 100644
index 000000000..30fb00085
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoSelect.cpp
@@ -0,0 +1,224 @@
+//-----------------------------------------------------------------------------
+
+// to avoid long name warnings
+#ifdef _MSC_VER
+#pragma warning(disable:4786)
+#endif
+
+#include   // runtime_error
+
+// general
+#include 
+
+//-----------------------------------------------------------------------------
+
+struct Dummy : public EO
+{
+    typedef double Type;
+  void printOn(std::ostream & _os) const
+  {
+      _os << " - ";
+      EO::printOn(_os);
+  }
+};
+
+bool operator==(const Dummy & _d1, const Dummy & _d2)
+{
+  return _d1.fitness() == _d2.fitness();
+}
+
+struct eoDummyPop : public eoPop
+{
+public :
+    eoDummyPop(int s=0) { resize(s); }
+};
+
+// helper - DOES NOT WORK if different individuals have same fitness!!!
+template 
+unsigned isInPop(EOT & _indi, eoPop & _pop)
+{
+  for (unsigned i=0; i<_pop.size(); i++)
+    if (_pop[i] == _indi)
+      return i;
+  return _pop.size();
+}
+
+unsigned int pSize;		// global variable, bouh!
+std::string fitnessType;		// yes, a global variable :-)
+eoDummyPop parentsOrg;
+
+template 
+void testSelectMany(eoSelect & _select, std::string _name)
+{
+    unsigned i;
+  std::cout << "\n\n" << fitnessType + _name << std::endl;
+  std::cout << "===============\n";
+
+    eoDummyPop parents(parentsOrg);
+    eoDummyPop offspring(0);
+
+    // do the selection
+    _select(parents, offspring);
+
+    // compute stats
+    std::vector nb(parents.size(), 0);
+    for (i=0; i(offspring[i], parents);
+	if (trouve == parents.size()) // pas trouve
+	  throw std::runtime_error("Pas trouve ds parents");
+	nb[trouve]++;
+       }
+    // dump to file so you can plot using gnuplot - dir name is hardcoded!
+    std::string fName = "ResSelect/" + fitnessType + _name + ".select";
+    std::ofstream os(fName.c_str());
+    for (i=0; i " << ( (double)nb[i])/offspring.size() << std::endl;
+	os << i << " " << ( (double)nb[i])/offspring.size() << std::endl;
+      }
+
+}
+
+template 
+void testSelectOne(eoSelectOne & _select, eoHowMany & _offspringRate,
+		   eoHowMany & _fertileRate, std::string _name)
+{
+  eoTruncatedSelectOne truncSelect(_select, _fertileRate);
+  eoSelectMany percSelect(truncSelect, _offspringRate);
+  testSelectMany(percSelect, _name);
+}
+
+
+//-----------------------------------------------------------------------------
+
+int the_main(int argc, char **argv)
+{
+  eoParser parser(argc, argv);
+  eoValueParam parentSizeParam = parser.createParam(unsigned(10), "parentSize", "Parent size",'P');
+    pSize = parentSizeParam.value(); // global variable
+
+//   eoValueParam offsrpringRateParam = parser.createParam(1.0, "offsrpringRate", "Offsrpring rate",'O');
+//     double oRate = offsrpringRateParam.value();
+  eoValueParam offsrpringRateParam = parser.createParam(eoHowMany(1.0), "offsrpringRate", "Offsrpring rate (% or absolute)",'O');
+    eoHowMany oRate = offsrpringRateParam.value();
+
+  eoValueParam fertileRateParam = parser.createParam(eoHowMany(1.0), "fertileRate", "Fertility rate (% or absolute)",'F');
+    eoHowMany fRate = fertileRateParam.value();
+
+eoValueParam tournamentSizeParam = parser.createParam(unsigned(2), "tournamentSize", "Deterministic tournament size",'T');
+    unsigned int tSize = tournamentSizeParam.value();
+
+  eoValueParam tournamentRateParam = parser.createParam(1.0, "tournamentRate", "Stochastic tournament rate",'t');
+    double tRate = tournamentRateParam.value();
+
+  eoValueParam rankingPressureParam = parser.createParam(2.0, "rankingPressure", "Selective pressure for the ranking selection",'p');
+    double rankingPressure = rankingPressureParam.value();
+
+  eoValueParam rankingExponentParam = parser.createParam(1.0, "rankingExponent", "Exponent for the ranking selection",'e');
+    double rankingExponent = rankingExponentParam.value();
+
+  eoValueParam fitTypeParam = parser.createParam(std::string("linear"), "fitType", "Type of fitness (linear, exp, log, super",'f');
+    fitnessType = fitTypeParam.value();
+
+    if (parser.userNeedsHelp())
+      {
+        parser.printHelp(std::cout);
+        exit(0);
+      }
+
+    // hard-coded directory name ...
+    system("mkdir ResSelect");
+    std::cout << "Testing the Selections\nParents size = " << pSize
+	 << ", offspring rate = " << oRate;
+    std::cout << " and putting rsulting files in dir ResSelect" << std::endl;
+
+    // initialize parent population
+    parentsOrg.resize(pSize);
+    if (fitnessType == std::string("linear"))
+      for (unsigned i=0; i& seedParam = parser.createParam(uint32_t(0), "seed",
+                                                           "Random number seed", 'S');
+    if (seedParam.value() == 0)
+	seedParam.value() = time(0);
+    rng.reseed(seedParam.value());
+
+    char fileName[1024];
+
+// the selection procedures under test
+    //    eoDetSelect detSelect(oRate);
+    //    testSelectMany(detSelect, "detSelect");
+
+    // Roulette
+     eoProportionalSelect propSelect;
+     testSelectOne(propSelect, oRate, fRate, "PropSelect");
+
+    // Linear ranking using the perf2Worth construct
+    eoRankingSelect newRankingSelect(rankingPressure);
+    sprintf(fileName,"LinRank_%g",rankingPressure);
+    testSelectOne(newRankingSelect, oRate, fRate, fileName);
+
+    // Exponential ranking using the perf2Worth construct
+    std::cout << "rankingExponent " << rankingExponent << std::endl;
+    eoRankingSelect expRankingSelect(rankingPressure,rankingExponent);
+    sprintf(fileName,"ExpRank_%g_%g",rankingPressure, rankingExponent);
+    testSelectOne(expRankingSelect, oRate, fRate, fileName);
+
+    // Det tournament
+    eoDetTournamentSelect detTourSelect(tSize);
+    sprintf(fileName,"DetTour_%d",tSize);
+    testSelectOne(detTourSelect, oRate, fRate, fileName);
+
+    // Stoch tournament
+    eoStochTournamentSelect stochTourSelect(tRate);
+    sprintf(fileName,"StochTour_%g",tRate);
+    testSelectOne(stochTourSelect, oRate, fRate, fileName);
+
+    // Fitness scaling
+    eoFitnessScalingSelect newFitScaleSelect(rankingPressure);
+    sprintf(fileName,"LinFitScale_%g",rankingPressure);
+    testSelectOne(newFitScaleSelect, oRate, fRate, fileName);
+
+    // Sequential selections
+    eoSequentialSelect seqSel(false);
+    strcpy(fileName,"Sequential");
+    testSelectOne(seqSel, oRate, fRate, fileName);
+
+    eoEliteSequentialSelect eliteSeqSel;
+    strcpy(fileName,"EliteSequential");
+    testSelectOne(eliteSeqSel, oRate, fRate, fileName);
+
+    return 1;
+}
+
+int main(int argc, char **argv)
+{
+    try
+    {
+        the_main(argc, argv);
+    }
+    catch(std::exception& e)
+    {
+        std::cout << "Exception: " << e.what() << std::endl;
+        return 1;
+    }
+}
diff --git a/trunk/paradiseo-eo/test/t-eoSharing.cpp b/trunk/paradiseo-eo/test/t-eoSharing.cpp
new file mode 100644
index 000000000..a68820bed
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoSharing.cpp
@@ -0,0 +1,240 @@
+#ifdef HAVE_CONFIG_H
+#include 
+#endif
+
+// to avoid long name warnings
+#ifdef _MSC_VER
+#pragma warning(disable:4786)
+#endif
+
+#include 
+#include 
+#include 
+#include 
+
+// general
+#include 
+#include 
+
+//-----------------------------------------------------------------------------
+
+struct Dummy : public EO
+{
+    typedef double Type;
+  void printOn(std::ostream & _os) const
+  {
+      EO::printOn(_os);
+      std::cout << " " << xdist ;
+  }
+  double xdist;
+};
+
+class
+eoDummyDistance : public eoDistance
+{
+  double operator()(const Dummy & _v1, const Dummy & _v2)
+  {
+    double r= _v1.xdist - _v2.xdist;
+    return sqrt(r*r);
+  }
+};
+
+
+bool operator==(const Dummy & _d1, const Dummy & _d2)
+{
+  return _d1.fitness() == _d2.fitness();
+}
+
+struct eoDummyPop : public eoPop
+{
+public :
+    eoDummyPop(int s=0) { resize(s); }
+};
+
+// helper - DOES NOT WORK if different individuals have same fitness!!!
+template 
+unsigned isInPop(EOT & _indi, eoPop & _pop)
+{
+  for (unsigned i=0; i<_pop.size(); i++)
+    if (_pop[i] == _indi)
+      return i;
+  return _pop.size();
+}
+
+unsigned int pSize;		// global variable, bouh!
+std::string fitnessType;		// yes, a global variable :-)
+eoDummyPop parentsOrg;
+
+template 
+void testSelectMany(eoSelect & _select, std::string _name)
+{
+    unsigned i;
+  std::cout << "\n\n" << fitnessType + _name << std::endl;
+  std::cout << "===============\n";
+
+    eoDummyPop parents(parentsOrg);
+    eoDummyPop offspring(0);
+
+    // do the selection
+    _select(parents, offspring);
+
+    //    cout << "Pop offspring \n" << offspring << endl;
+
+    // compute stats
+    std::vector nb(parents.size(), 0);
+    for (i=0; i(offspring[i], parents);
+	if (trouve == parents.size()) // pas trouve
+	  throw std::runtime_error("Pas trouve ds parents");
+	nb[trouve]++;
+       }
+    // dump to file so you can plot using gnuplot - dir name is hardcoded!
+    std::string fName = "ResSelect/" + fitnessType + _name + ".select";
+    std::ofstream os(fName.c_str());
+    for (i=0; i " << ( (double)nb[i])/offspring.size() << std::endl;
+	os << i << " " << ( (double)nb[i])/offspring.size() << std::endl;
+      }
+
+}
+
+template 
+void testSelectOne(eoSelectOne & _select, eoHowMany & _offspringRate,
+		   eoHowMany & _fertileRate, std::string _name)
+{
+  eoTruncatedSelectOne truncSelect(_select, _fertileRate);
+  eoSelectMany percSelect(truncSelect, _offspringRate);
+  testSelectMany(percSelect, _name);
+}
+
+
+//-----------------------------------------------------------------------------
+
+int the_main(int argc, char **argv)
+{
+  eoParser parser(argc, argv);
+
+  // random seed
+    eoValueParam& seedParam = parser.createParam(uint32_t(0), "seed", "Random number seed", 'S');
+    if (seedParam.value() == 0)
+	seedParam.value() = time(0);
+    rng.reseed(seedParam.value());
+
+
+  // pSize global variable !
+  eoValueParam pSizeParam = parser.createParam(unsigned(10), "parentSize", "Parent size",'P');
+  pSize = pSizeParam.value();
+
+  eoHowMany oRate = parser.createParam(eoHowMany(1.0), "offsrpringRate", "Offsrpring rate (% or absolute)",'O').value();
+
+  eoHowMany fRate = parser.createParam(eoHowMany(1.0), "fertileRate", "Fertility rate (% or absolute)",'F').value();
+
+
+  double nicheSize = parser.createParam(0.1, "nicheSize", "Paramter Sigma for Sharing",'\0').value();
+
+  eoParamParamType & peakParam = parser.createParam(eoParamParamType("2(1,2)"), "peaks", "Description of the peaks: N(nb1,nb2,...,nbN)", 'p').value();
+
+  // the number of peaks: first item of the paramparam
+  unsigned peakNumber = atoi(peakParam.first.c_str());
+  if (peakNumber < 2)
+      {
+	std::cerr << "WARNING, nb of peaks must be larger than 2, using 2" << std::endl;
+	peakNumber = 2;
+      }
+
+  std::vector nbIndiPerPeak(peakNumber);
+  unsigned i, sum=0;
+
+  // the second item is a vector containing all values
+  if (!peakParam.second.size())   // no other parameter : equal peaks
+      {
+	std::cerr << "WARNING, no nb of indis per peaks, using equal nbs" << std::endl;
+	for (i=0; i detSelect(oRate);
+    //    testSelectMany(detSelect, "detSelect");
+
+    // Sharing using the perf2Worth construct
+    // need a distance for that
+    eoDummyDistance dist;
+    eoSharingSelect newSharingSelect(nicheSize, dist);
+    sprintf(fileName,"Niche_%g",nicheSize);
+    testSelectOne(newSharingSelect, oRate, fRate, fileName);
+
+    return 1;
+}
+
+int main(int argc, char **argv)
+{
+    try
+    {
+        the_main(argc, argv);
+    }
+    catch(std::exception& e)
+    {
+        std::cout << "Exception: " << e.what() << std::endl;
+        return 1;
+    }
+}
diff --git a/trunk/paradiseo-eo/test/t-eoStateAndParser.cpp b/trunk/paradiseo-eo/test/t-eoStateAndParser.cpp
new file mode 100644
index 000000000..80551279c
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoStateAndParser.cpp
@@ -0,0 +1,139 @@
+//-----------------------------------------------------------------------------
+
+// to avoid long name warnings
+#ifdef _MSC_VER
+#pragma warning(disable:4786)
+#endif
+
+#include   // runtime_error
+
+//-----------------------------------------------------------------------------
+// tt.cpp:
+//
+//-----------------------------------------------------------------------------
+
+
+// general
+#include 		// Random number generators
+#include 
+#include 
+#include 
+
+//-----------------------------------------------------------------------------
+
+// include package checkpointing
+#include 
+// and provisions for Bounds reading
+#include 
+
+struct Dummy : public EO
+{
+    typedef double Type;
+};
+
+
+//-----------------------------------------------------------------------------
+
+int the_main(int argc, char **argv)
+{ // ok, we have a command line parser and a state
+
+    typedef eoBit Chrom;
+
+    eoParser parser(argc, argv);
+
+    // Define Parameters
+    eoValueParam dimParam((unsigned int)(5), "dimension", "dimension");
+    eoValueParam rate(0.01, "mutationRatePerBit", "Initial value for mutation rate per bit");
+    eoValueParam factor(0.99, "mutationFactor", "Decrease factor for mutation rate");
+    eoValueParam seed(time(0), "seed", "Random number seed");
+    // test if user entered or if default value used
+    if (parser.isItThere(seed))
+      std::cout << "YES\n";
+    else
+      std::cout << "NO\n";
+
+    eoValueParam load_name("", "Load","Load",'L');
+    eoValueParam save_name("", "Save","Save",'S');
+
+
+    // Register them
+    parser.processParam(dimParam,   "Genetic Operators");
+    parser.processParam(rate,       "Genetic Operators");
+    parser.processParam(factor,     "Genetic Operators");
+    parser.processParam(load_name,  "Persistence");
+    parser.processParam(save_name,  "Persistence");
+    parser.processParam(seed,       "Rng seeding");
+
+    // a bound param (need dim)
+    eoValueParam boundParam(eoRealVectorBounds(dimParam.value(),eoDummyRealNoBounds), "bounds","bounds",'b');
+
+    parser.processParam(boundParam, "Genetic Operators");
+
+    std::cout << "Bounds: " << boundParam.value() << std::endl;
+
+   eoState state;
+   state.registerObject(parser);
+
+
+   if (load_name.value() != "")
+   { // load the parser. This is only neccessary when the user wants to
+     // be able to change the parameters in the state file by hand.
+       state.load(load_name.value()); // load the parser
+   }
+
+    // Create the algorithm here
+
+    // Register the algorithm
+    state.registerObject(rng);
+    //state.registerObject(pop);
+
+    if (parser.userNeedsHelp())
+    {
+        parser.printHelp(std::cout);
+        return 0;
+    }
+
+    // Either load or initialize
+    if (load_name.value() != "")
+    {
+        state.load(load_name.value()); // load the rest
+    }
+    else
+    {
+        // else
+
+        // initialize rng and population
+
+        rng.reseed(seed.value());
+    }
+
+    // run the algorithm
+
+    // Save when needed
+    if (save_name.value() != "")
+    {
+        std::string file_name = save_name.value();
+        save_name.value() = ""; // so that it does not appear in the parser section of the state file
+        state.save(file_name);
+    }
+
+    for (int i = 0; i < 100; ++i)
+        rng.rand();
+
+    std::cout << "a random number is " << rng.random(1024) << std::endl;;
+
+    return 1;
+}
+
+int main(int argc, char **argv)
+{
+    try
+    {
+        the_main(argc, argv);
+    }
+    catch(std::exception& e)
+    {
+        std::cout << "Exception: " << e.what() << std::endl;
+    }
+
+}
diff --git a/trunk/paradiseo-eo/test/t-eoSymreg.cpp b/trunk/paradiseo-eo/test/t-eoSymreg.cpp
new file mode 100644
index 000000000..f83f3aaa4
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoSymreg.cpp
@@ -0,0 +1,295 @@
+#ifdef _MSC_VER
+#pragma warning(disable:4786)
+#endif
+
+#include 
+#include 
+
+using namespace gp_parse_tree;
+using namespace std;
+
+//-----------------------------------------------------------------------------
+
+class SymregNode
+{
+public :
+
+	enum Operator {X = 'x', Plus = '+', Min = '-', Mult = '*', PDiv = '/'};
+
+	SymregNode(void)				{ init(); }
+	SymregNode(Operator _op)		{ op = _op; }
+	virtual ~SymregNode(void)			{}
+
+	// arity function, need this function!
+	int arity(void) const      { return op == X? 0 : 2; }
+
+    void randomize(void) {}
+    
+	// evaluation function, single case, using first argument to give value of variable
+	template 
+	void operator()(double& result, Children args, double var) const
+	{
+        double r1, r2;
+
+        if (arity() == 2)
+        {
+            args[0].apply(r1, var);
+            args[1].apply(r2, var);
+        }
+
+		switch (op)
+		{
+		case Plus : result = r1 + r2; break;
+		case Min  : result = r1 - r2; break;
+		case Mult : result = r1 * r2; break;
+		case PDiv : 
+			{
+				if (r2 == 0.0)
+					result = 1.0; // protection a la Koza, realistic implementations should maybe throw an exception
+                else
+				    result = r1 / r2;
+                break;
+			}
+
+		case X    : result = var; break;
+		}
+
+	}
+
+    /// 'Pretty' print to ostream function
+    template 
+        void operator()(string& result, Children args) const
+    {
+        static const string lb = "(";
+        static const string rb = ")";
+        char opStr[4] = "   ";
+        opStr[1] = op;
+        
+	    if (arity() == 0)
+		{
+            result = "x";
+            return;
+        }
+        // else
+        string r1;
+        args[0].apply(r1);
+        result = lb + r1;
+        result += opStr; 
+        args[1].apply(r1);
+        result += r1 + rb;
+    }
+
+    Operator getOp(void) const { return op; }    
+
+protected :
+
+	void init(void)					{ op = X; }
+
+private :
+
+	Operator op; // the type of node
+};
+
+/// initializor
+static SymregNode init_sequence[5] = {SymregNode::X, SymregNode::Plus, SymregNode::Min, SymregNode::Mult, SymregNode::PDiv}; // needed for intialization
+
+// MSVC does not recognize the lt_arity in eoParseTreeDepthInit
+// without this specialization ...
+// 2 months later, it seems it does not accept this definition ...
+// but dies accept the lt_arity in eoParseTreeDepthInit
+// !!!
+// #ifdef _MSC_VER 
+// template <>
+// bool lt_arity(const SymregNode &node1, const SymregNode &node2) 
+// {
+//      	return (node1.arity() < node2.arity());
+// }
+// #endif
+
+//-----------------------------------------------------------
+// saving, loading
+
+std::ostream& operator<<(std::ostream& os, const SymregNode& eot)
+{
+    os << static_cast(eot.getOp());
+    return os;
+}
+
+std::istream& operator>>(std::istream& is, SymregNode& eot)
+{
+    char type;
+    type = (char) is.get();
+    eot = SymregNode(static_cast(type));
+    return is;
+}
+
+
+//-----------------------------------------------------------------------------
+/** Implementation of a function evaluation object. */
+
+double targetFunction(double x)
+{ 
+	return x * x * x * x - x * x * x + x * x * x - x * x + x - 10; 
+}
+
+// parameters controlling the sampling of points
+const double xbegin = -10.0f;
+const double xend   = 10.0f;
+const double xstep  = 1.3f; 
+
+template  struct RMS: public eoEvalFunc< eoParseTree > 
+{
+public :
+
+    typedef eoParseTree EoType;
+
+    typedef eoParseTree argument_type;
+    typedef double                   fitness_type;
+
+	RMS(void) : eoEvalFunc()
+	{
+		int n = int( (xend - xbegin) / xstep);
+		
+		inputs.resize(n);
+		target.resize(n);
+
+		int i = 0;
+
+    	for (double x = xbegin; x < xend && i < n; ++i, x+=xstep)
+		{
+			target[i] = targetFunction(x);
+			inputs[i] = x;
+		}
+	}
+
+    ~RMS() {}
+    
+	void operator()( EoType & _eo )  
+	{
+		vector outputs;
+		outputs.resize(inputs.size());
+		
+        double fitness = 0.0;
+        
+	for (unsigned i = 0; i < inputs.size(); ++i)
+        {
+		    _eo.apply(outputs[i], inputs[i]);
+	        fitness += (outputs[i] - target[i]) * (outputs[i] - target[i]);
+        }
+		
+        fitness /= (double) target.size();
+        fitness = sqrt(fitness);
+			
+		if (fitness > 1e+20)
+			fitness = 1e+20;
+
+		_eo.fitness(fitness);
+	}
+
+private :
+	vector inputs;
+	vector target;
+};
+
+template 
+void print_best(eoPop& pop)
+{
+    std::cout << std::endl;
+    FitnessType best = pop[0].fitness();
+    int index = 0;
+
+    for (unsigned i = 1; i < pop.size(); ++i)
+    {
+        if (best < pop[i].fitness())
+        {
+            best = pop[i].fitness();
+            index = i;
+        }
+    }
+    
+    std::cout << "\t";
+        
+    string str;
+    pop[index].apply(str);
+    
+    std::cout << str.c_str();
+    std::cout << std::endl << "RMS Error = " << pop[index].fitness() << std::endl;
+}
+
+int main()
+{
+    typedef eoMinimizingFitness FitnessType;
+    typedef SymregNode GpNode;
+
+    typedef eoParseTree EoType;
+    typedef eoPop Pop;	
+
+    const int MaxSize = 100;
+    const int nGenerations = 10; // only a test, so few generations
+
+    // Initializor sequence, contains the allowable nodes
+    vector init(init_sequence, init_sequence + 5);
+
+    // Depth Initializor, defaults to grow method.
+    eoGpDepthInitializer initializer(10, init);
+    
+    // Root Mean Squared Error Measure
+    RMS              eval;
+
+    Pop pop(50, initializer);
+
+    apply(eval, pop);
+
+    eoSubtreeXOver   xover(MaxSize);
+    eoBranchMutation mutation(initializer, MaxSize);
+
+    // The operators are  encapsulated into an eoTRansform object, 
+    // that performs sequentially crossover and mutation
+    eoSGATransform transform(xover, 0.75, mutation, 0.25);
+
+    // The robust tournament selection
+    eoDetTournamentSelect selectOne(2);   // tSize in [2,POPSIZE]
+    // is now encapsulated in a eoSelectMany: 2 at a time -> SteadyState
+    eoSelectMany select(selectOne,2, eo_is_an_integer);    
+  
+    // and the Steady-State replacement
+    eoSSGAWorseReplacement replace;
+  
+    // Terminators
+    eoGenContinue term(nGenerations);
+
+    eoCheckPoint checkPoint(term);
+
+    eoAverageStat     avg;
+    eoBestFitnessStat best;
+    eoStdoutMonitor monitor;
+
+    checkPoint.add(monitor);
+    checkPoint.add(avg);
+    checkPoint.add(best);
+
+    monitor.add(avg);
+    monitor.add(best);
+
+    // GP generation
+    eoEasyEA gp(checkPoint, eval, select, transform, replace);
+
+    std::cout << "Initialization done" << std::endl;
+
+    print_best(pop);
+
+    try
+    {
+      gp(pop);
+    }
+    catch (std::exception& e)
+    {
+	    std::cout << "exception: " << e.what() << std::endl;;
+	    exit(EXIT_FAILURE);
+    }
+
+    print_best(pop);
+
+}
+
+
diff --git a/trunk/paradiseo-eo/test/t-eoUniform.cpp b/trunk/paradiseo-eo/test/t-eoUniform.cpp
new file mode 100644
index 000000000..04c23e5ca
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoUniform.cpp
@@ -0,0 +1,22 @@
+//-----------------------------------------------------------------------------
+// t-eouniform
+//-----------------------------------------------------------------------------
+
+#include    // std::cout
+#include   // ostrstream, istrstream
+#include          // eoBin
+
+//-----------------------------------------------------------------------------
+
+main() {
+  eoUniform u1(-2.5,3.5);
+  eoUniform u2(0.003, 0 );
+  eoUniform u3( 10000U, 10000000U);
+  std::cout << "u1\t\tu2\t\tu3" << std::endl;
+  for ( unsigned i = 0; i < 100; i ++) {
+    std::cout << u1() << "\t" << u2() << "\t" << u3() << std::endl;
+  }
+    
+}
+
+//-----------------------------------------------------------------------------
diff --git a/trunk/paradiseo-eo/test/t-eoVector.cpp b/trunk/paradiseo-eo/test/t-eoVector.cpp
new file mode 100644
index 000000000..768178c3f
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoVector.cpp
@@ -0,0 +1,74 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+    t-eoVector.cpp
+      This program tests vector-like chromosomes
+    (c) GeNeura Team, 1999, 2000
+
+    Modified by Maarten Keijzer 2001
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+
+*/
+//-----------------------------------------------------------------------------
+#ifdef HAVE_CONFIG_H
+#include 
+#endif
+
+#include 
+#include 
+
+#include 
+#include          // eoVector
+#include 
+#include 
+
+//-----------------------------------------------------------------------------
+
+typedef eoVector Chrom1;
+typedef eoVector Chrom2;
+
+//-----------------------------------------------------------------------------
+
+int main()
+{
+  const unsigned SIZE = 4;
+
+  // check if the appropriate ctor gets called
+  Chrom1 chrom(SIZE, 5);
+
+  for (unsigned i = 0; i < chrom.size(); ++i)
+  {
+    assert(chrom[i] == 5);
+  }
+
+  eoUniformGenerator uniform(-1,1);
+  eoInitFixedLength init(SIZE, uniform);
+
+  init(chrom);
+
+  std::cout << chrom << std::endl;
+
+  Chrom2 chrom2(chrom);
+
+  std::cout << chrom2 << std::endl;
+
+//  eoInitVariableLength initvar(
+
+  return 0;
+}
+
+//-----------------------------------------------------------------------------
diff --git a/trunk/paradiseo-eo/test/t-eoVirus.cpp b/trunk/paradiseo-eo/test/t-eoVirus.cpp
new file mode 100644
index 000000000..347a78963
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoVirus.cpp
@@ -0,0 +1,77 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+    t-eoVirus.cpp
+      This program tests the the binary cromosomes and several genetic operators
+    (c) GeNeura Team, 1999
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+
+*/
+//-----------------------------------------------------------------------------
+
+#include    // std::cout
+#include          // general EO
+#include "MGE/VirusOp.h"
+#include "MGE/eoVirus.h"
+#include "MGE/eoInitVirus.h"
+#include 
+
+#include "binary_value.h"
+
+//-----------------------------------------------------------------------------
+
+typedef eoVirus Chrom;
+
+//-----------------------------------------------------------------------------
+
+int main()
+{
+  const unsigned SIZE = 8;
+  eoBooleanGenerator gen;
+  eo::rng.reseed( time( 0 ) );
+
+  Chrom chrom(SIZE), chrom2(SIZE);
+  chrom.fitness(binary_value(chrom)); chrom2.fitness(binary_value(chrom2));
+  std::cout << chrom << std::endl;
+  std::cout << chrom2 << std::endl;
+
+  // Virus Mutation
+  VirusBitFlip vf;
+  unsigned i;
+  for ( i = 0; i < 10; i++ ) {
+	vf( chrom );
+	std::cout << chrom << std::endl;
+  }
+
+  // Chrom Mutation
+  std::cout << "Chrom mutation--------" << std::endl;
+  VirusMutation vm;
+  for ( i = 0; i < 10; i++ ) {
+	vm( chrom );
+	std::cout << chrom << std::endl;
+  }
+
+  // Chrom Transmision
+  std::cout << "Chrom transmission--------" << std::endl;
+  VirusTransmission vt; 
+  vt( chrom2, chrom );
+  std::cout << chrom2 << std::endl;
+
+  return 0;
+
+}
+
diff --git a/trunk/paradiseo-eo/test/t-eobin.cpp b/trunk/paradiseo-eo/test/t-eobin.cpp
new file mode 100644
index 000000000..7c27e001f
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eobin.cpp
@@ -0,0 +1,218 @@
+/* -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+    t-eobin.cpp
+      This program tests the the binary cromosomes and several genetic operators
+    (c) GeNeura Team, 1999
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+
+*/
+//-----------------------------------------------------------------------------
+#ifdef HAVE_CONFIG_H
+#include 
+#endif
+
+#include    // std::cout
+#include 
+
+#include          // general EO
+#include 	      // bitstring representation & operators
+#include 
+#include "binary_value.h"
+
+//-----------------------------------------------------------------------------
+
+typedef eoBit Chrom;
+
+//-----------------------------------------------------------------------------
+
+void main_function()
+{
+  const unsigned SIZE = 8;
+  unsigned i, j;
+  eoBooleanGenerator gen;
+
+  Chrom chrom(SIZE), chrom2;
+  chrom.fitness(binary_value(chrom)); chrom2.fitness(binary_value(chrom2));
+
+  std::cout << "chrom:  " << chrom << std::endl;
+  chrom[0] = chrom[SIZE - 1] = true; chrom.fitness(binary_value(chrom));
+  std::cout << "chrom:  " << chrom << std::endl;
+  chrom[0] = chrom[SIZE - 1] = false; chrom.fitness(binary_value(chrom));
+  std::cout << "chrom:  " << chrom << std::endl;
+  chrom[0] = chrom[SIZE - 1] = true; chrom.fitness(binary_value(chrom));
+
+  std::cout << "chrom.className() = " << chrom.className() << std::endl;
+
+  std::cout << "chrom:  " << chrom << std::endl
+       << "chrom2: " << chrom2 << std::endl;
+
+  std::ostringstream os;
+  os << chrom;
+  std::istringstream is(os.str());
+  is >> chrom2; chrom.fitness(binary_value(chrom2));
+
+  std::cout << "\nTesting reading, writing\n";
+  std::cout << "chrom:  " << chrom << "\nchrom2: " << chrom2 << '\n';
+
+  std::fill(chrom.begin(), chrom.end(), false);
+  std::cout << "--------------------------------------------------"
+       << std::endl << "eoMonOp's aplied to .......... " << chrom << std::endl;
+
+  eoInitFixedLength
+      random(chrom.size(), gen);
+
+  random(chrom); chrom.fitness(binary_value(chrom));
+  std::cout << "after eoBinRandom ............ " << chrom << std::endl;
+
+  eoOneBitFlip bitflip;
+  bitflip(chrom); chrom.fitness(binary_value(chrom));
+  std::cout << "after eoBitFlip .............. " << chrom << std::endl;
+
+  eoBitMutation mutation(0.5);
+  mutation(chrom); chrom.fitness(binary_value(chrom));
+  std::cout << "after eoBinMutation(0.5) ..... " << chrom << std::endl;
+
+  eoBitInversion inversion;
+  inversion(chrom); chrom.fitness(binary_value(chrom));
+  std::cout << "after eoBinInversion ......... " << chrom << std::endl;
+
+  eoBitNext next;
+  next(chrom); chrom.fitness(binary_value(chrom));
+  std::cout << "after eoBinNext .............. " << chrom << std::endl;
+
+  eoBitPrev prev;
+  prev(chrom); chrom.fitness(binary_value(chrom));
+  std::cout << "after eoBinPrev .............. " << chrom << std::endl;
+
+  std::fill(chrom.begin(), chrom.end(), false); chrom.fitness(binary_value(chrom));
+  std::fill(chrom2.begin(), chrom2.end(), true); chrom2.fitness(binary_value(chrom2));
+  std::cout << "--------------------------------------------------"
+       << std::endl << "eoBinOp's aplied to ... "
+       << chrom << " " << chrom2 << std::endl;
+
+  eo1PtBitXover xover;
+  std::fill(chrom.begin(), chrom.end(), false);
+  std::fill(chrom2.begin(), chrom2.end(), true);
+  xover(chrom, chrom2);
+  chrom.fitness(binary_value(chrom)); chrom2.fitness(binary_value(chrom2));
+  std::cout << "eoBinCrossover ........ " << chrom << " " << chrom2 << std::endl;
+
+  for (i = 1; i < SIZE; i++)
+    {
+      eoNPtsBitXover nxover(i);
+      std::fill(chrom.begin(), chrom.end(), false);
+      std::fill(chrom2.begin(), chrom2.end(), true);
+      nxover(chrom, chrom2);
+      chrom.fitness(binary_value(chrom)); chrom2.fitness(binary_value(chrom2));
+      std::cout << "eoBinNxOver(" << i << ") ........ "
+	   << chrom << " " << chrom2 << std::endl;
+    }
+
+  for (i = 1; i < SIZE / 2; i++)
+    for (j = 1; j < SIZE / 2; j++)
+      {
+	eoBitGxOver gxover(i, j);
+	std::fill(chrom.begin(), chrom.end(), false);
+	std::fill(chrom2.begin(), chrom2.end(), true);
+	gxover(chrom, chrom2);
+	chrom.fitness(binary_value(chrom)); chrom2.fitness(binary_value(chrom2));
+	std::cout  << "eoBinGxOver(" << i << ", " << j << ") ..... "
+	      << chrom << " " << chrom2 << std::endl;
+      }
+
+    // test SGA algorithm
+    eoGenContinue continuator1(50);
+    eoFitContinue continuator2(65535.f);
+
+    eoCombinedContinue continuator(continuator1, continuator2);
+
+    eoCheckPoint checkpoint(continuator);
+
+    eoStdoutMonitor monitor;
+
+    checkpoint.add(monitor);
+
+    eoSecondMomentStats stats;
+
+    monitor.add(stats);
+    checkpoint.add(stats);
+
+    eoProportionalSelect select;
+    eoEvalFuncPtr  eval(binary_value);
+
+    eoSGA sga(select, xover, 0.8f, bitflip, 0.1f, eval, checkpoint);
+
+    eoInitFixedLength init(16, gen);
+    eoPop pop(100, init);
+
+    apply(eval, pop);
+
+    sga(pop);
+
+    pop.sort();
+
+    std::cout << "Population " << pop << std::endl;
+
+    std::cout << "\nBest: " << pop[0].fitness() << '\n';
+
+  /*
+
+    Commented this out, waiting for a definite decision what to do with the mOp's
+
+    // Check multiOps
+    eoMultiMonOp mOp( &next );
+    mOp.adOp( &bitflip );
+    std::cout << "before multiMonOp............  " << chrom << std::endl;
+    mOp( chrom );
+    std::cout << "after multiMonOp .............. " << chrom << std::endl;
+
+    eoBinGxOver gxover(2, 4);
+    eoMultiBinOp mbOp( &gxover );
+    mOp.adOp( &bitflip );
+    std::cout << "before multiBinOp............  " << chrom << " " << chrom2 << std::endl;
+    mbOp( chrom, chrom2 );
+    std::cout << "after multiBinOp .............. " << chrom << " " << chrom2 <
+#endif
+
+int main()
+{
+#ifdef _MSC_VER
+  //  rng.reseed(42);
+    int flag = _CrtSetDbgFlag(_CRTDBG_LEAK_CHECK_DF);
+     flag |= _CRTDBG_LEAK_CHECK_DF;
+    _CrtSetDbgFlag(flag);
+//   _CrtSetBreakAlloc(100);
+#endif
+
+    try
+    {
+        main_function();
+    }
+    catch(std::exception& e)
+    {
+        std::cout << "Exception: " << e.what() << '\n';
+    }
+
+}
diff --git a/trunk/paradiseo-eo/test/t-eobreeder.cpp b/trunk/paradiseo-eo/test/t-eobreeder.cpp
new file mode 100644
index 000000000..3127bd4e3
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eobreeder.cpp
@@ -0,0 +1,87 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// t-eobreeder.cpp
+//   This program test the breeder object
+// (c) GeNeura Team, 1998 
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+            
+*/
+//-----------------------------------------------------------------------------
+
+#ifndef __GNUG__
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif // __GNUG__
+
+#include   // eoBin, eoPop, eoBreeder
+#include 
+#include 
+#include 
+#include 
+
+//-----------------------------------------------------------------------------
+
+typedef eoBin Chrom;
+
+#include "binary_value.h"
+
+//-----------------------------------------------------------------------------
+
+main()
+{
+  const unsigned POP_SIZE = 8, CHROM_SIZE = 4;
+  unsigned i;
+
+  eoBinRandom random;
+  eoPop pop; 
+
+  BinaryValue eval;
+  
+  for (i = 0; i < POP_SIZE; ++i)
+    {
+      Chrom chrom(CHROM_SIZE);
+      random(chrom);
+      eval(chrom);
+      pop.push_back(chrom);
+    }
+  
+  std::cout << "population:" << std::endl;
+  for (i = 0; i < pop.size(); ++i)
+    std::cout << pop[i] << " " << pop[i].fitness() << std::endl;
+
+  eoBinBitFlip bitflip;
+  eoBinCrossover xover;
+  eoProportionalOpSel propSel;
+  eoBreeder breeder( propSel );
+  propSel.addOp(bitflip, 0.25);
+  propSel.addOp(xover, 0.75);
+
+  breeder(pop);
+
+  // reevaluation of fitness 
+  for_each(pop.begin(), pop.end(), BinaryValue());
+
+  std::cout << "new population:" << std::endl;
+  for (i = 0; i < pop.size(); ++i)
+    std::cout << pop[i] << " " << pop[i].fitness() << std::endl;
+
+  return 0;
+}
+
+//-----------------------------------------------------------------------------
diff --git a/trunk/paradiseo-eo/test/t-eofitness.cpp b/trunk/paradiseo-eo/test/t-eofitness.cpp
new file mode 100644
index 000000000..1999e9fd5
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eofitness.cpp
@@ -0,0 +1,90 @@
+//-----------------------------------------------------------------------------
+// t-eofitness.cpp
+// (c) GeNeura Team 1998
+//-----------------------------------------------------------------------------
+
+#include     // time
+#include   // srand, rand
+#include   // std::cout
+
+#include 
+
+using namespace std;
+
+//-----------------------------------------------------------------------------
+
+template 
+int test_fitness(Fitness a, Fitness b)
+{
+//  srand(time(0));
+
+//  Fitness a = aval; //static_cast(rand()) / RAND_MAX; 
+//  Fitness b = bval; //static_cast(rand()) / RAND_MAX;
+
+  std::cout.precision(2);
+  
+  unsigned repeat = 2;
+  while (repeat--)
+    {
+      std::cout << "------------------------------------------------------" << std::endl;
+      std::cout << "testing <    ";
+      if (a < b)
+	std::cout << a << " < " << b << "  is true" << std::endl;
+      else
+	std::cout << a << " < " << b << "  is false" <    ";
+      if (a > b)
+	std::cout << a << " > " << b << "  is true" << std::endl;
+      else
+	std::cout << a << " > " << b << "  is false" <
+#include 
+
+#include "binary_value.h"
+
+//-----------------------------------------------------------------------------
+
+typedef eoBin Chrom;
+
+//-----------------------------------------------------------------------------
+
+main()
+{
+  const unsigned POP_SIZE = 8, CHROM_SIZE = 16;
+  unsigned i;
+
+  eoBinRandom random;
+  eoPop pop; 
+
+  // Evaluation
+  eoEvalFuncPtr eval( binary_value );
+
+  for (i = 0; i < POP_SIZE; ++i)
+    {
+      Chrom chrom(CHROM_SIZE);
+      random(chrom);
+      eval(chrom);
+      pop.push_back(chrom);
+    }
+  
+  std::cout << "population:" << std::endl;
+  for (i = 0; i < pop.size(); ++i)
+    std::cout << "\t" << pop[i] << " " << pop[i].fitness() << std::endl;
+
+  
+  // selection
+  eoLottery lottery;
+
+  // breeder
+  eoBinBitFlip bitflip;
+  eoBinCrossover xover;
+  eoProportionalOpSel propSel;
+  eoBreeder breeder( propSel );
+  propSel.addOp(bitflip, 0.25);
+  propSel.addOp(xover, 0.75);
+  
+  // replacement
+  eoInclusion inclusion;
+
+  
+
+  // GA generation
+  eoGeneration generation(lottery, breeder, inclusion, eval);
+
+  // evolution
+  unsigned g = 0;
+  do {
+    try
+      {
+	generation(pop);
+      }
+    catch (std::exception& e)
+      {
+	std::cout << "exception: " << e.what() << std::endl;;
+	exit(EXIT_FAILURE);
+      }
+    
+    std::cout << "pop[" << ++g << "]" << std::endl;
+    for (i = 0; i < pop.size(); ++i)
+      std::cout << "\t" <<  pop[i] << " " << pop[i].fitness() << std::endl;
+    
+  } while (pop[0].fitness() < pow(2.0, CHROM_SIZE) - 1);
+
+  // Try again, with a "counted" evaluation function
+  // GA generation
+  // Evaluation
+  eoEvalFuncPtrCnt eval2( binary_value );
+  eoPop pop2; 
+  
+  for (i = 0; i < POP_SIZE; ++i)
+    {
+      Chrom chrom(CHROM_SIZE);
+      random(chrom);
+      binary_value(chrom);
+      eval2(chrom);
+      pop2.push_back(chrom);
+    }
+  eoGeneration generation2(lottery, breeder, inclusion, eval2);
+  
+  // evolution
+  do {
+    try
+      {
+	generation2(pop2);
+      }
+    catch (std::exception& e)
+      {
+	std::cout << "exception: " << e.what() << std::endl;;
+	exit(EXIT_FAILURE);
+      }
+    
+    std::cout << "pop[" << ++g << "]" << std::endl;
+    for (i = 0; i < pop2.size(); ++i)
+      std::cout << "\t" <<  pop2[i] << " " << pop[i].fitness() << std::endl;
+    
+  } while (pop2[0].fitness() < pow(2.0, CHROM_SIZE) - 1);
+
+  std::cout << "Number of evaluations " << eval2.getNumOfEvaluations() << std::endl;
+  return 0;
+}
+
+//-----------------------------------------------------------------------------
diff --git a/trunk/paradiseo-eo/test/t-eoinclusion.cpp b/trunk/paradiseo-eo/test/t-eoinclusion.cpp
new file mode 100644
index 000000000..217f2eff0
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoinclusion.cpp
@@ -0,0 +1,97 @@
+//-----------------------------------------------------------------------------
+// t-eoinclusion.cpp
+//-----------------------------------------------------------------------------
+
+#include 
+#include 
+#include 
+
+//-----------------------------------------------------------------------------
+
+typedef eoBin Chrom;
+
+#include "binary_value.h"
+
+//-----------------------------------------------------------------------------
+
+main()
+{
+  const unsigned CHROM_SIZE = 4;
+
+  eoBinRandom random;
+  BinaryValue eval;
+
+  for (unsigned POP_SIZE = 4; POP_SIZE <=6; POP_SIZE++)
+    {
+      eoPop pop; 
+      unsigned i;
+      for ( i = 0; i < POP_SIZE; i++)
+	    {
+	      Chrom chrom(CHROM_SIZE);
+	      random(chrom);
+	      eval(chrom);
+	      pop.push_back(chrom);
+	    }
+      
+      for (unsigned POP2_SIZE = 4; POP2_SIZE <=6; POP2_SIZE++)
+	{
+	  eoPop pop2, pop3, pop4, pop5;
+	 	
+	  for (i = 0; i < POP2_SIZE; i++)
+	    {
+	      Chrom chrom(CHROM_SIZE);
+	      random(chrom);
+	      eval(chrom);
+	      pop2.push_back(chrom);
+	    }
+	
+	  std::cout << "--------------------------------------------------" << std::endl
+	       << "breeders \tpop" << std::endl
+	       << "--------------------------------------------------" << std::endl;
+	  for (i = 0; i < max(pop.size(), pop2.size()); i++)
+	    {	  
+	      if (pop.size() > i) 
+		std::cout << pop[i] << " " << pop[i].fitness() << "   \t";
+	      else
+		std::cout << "\t\t";
+	      if (pop2.size() > i)
+		std::cout << pop2[i] << " " << pop2[i].fitness();
+	      std::cout << std::endl;
+	    }
+	
+	  eoInclusion inclusion(0.75);
+	  pop3 = pop2;
+	  inclusion(pop, pop3); 
+	  
+	  eoInclusion inclusion2; 
+	  pop4 = pop2;
+	  inclusion2(pop, pop4); 
+	  
+	  eoInclusion inclusion3(1.5);
+	  pop5 = pop2;
+	  inclusion3(pop, pop5); 
+	  
+	  std::cout << std::endl
+	       << "0.75 \t\t1.0 \t\t1.5" << std::endl
+	       << "---- \t\t--- \t\t---" << std::endl;
+	  for (i = 0; i < pop5.size(); i++)
+	    {
+	      if (pop3.size() > i)
+		std::cout << pop3[i] << " " << pop3[i].fitness() << "   \t";
+	      else
+		std::cout << " \t\t";
+	      if (pop4.size() > i)
+		std::cout << pop4[i] << " " << pop4[i].fitness() << "   \t";
+	      else
+		std::cout << " \t\t";
+	      if (pop5.size() > i)
+		std::cout << pop5[i] << " " << pop5[i].fitness();
+	      std::cout << std::endl;
+	    }
+	}
+    }
+  
+  return 0;
+}
+
+//-----------------------------------------------------------------------------
diff --git a/trunk/paradiseo-eo/test/t-eoinsertion.cpp b/trunk/paradiseo-eo/test/t-eoinsertion.cpp
new file mode 100644
index 000000000..051ca8211
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoinsertion.cpp
@@ -0,0 +1,108 @@
+//-----------------------------------------------------------------------------
+// t-eoinsertion.cpp
+//-----------------------------------------------------------------------------
+
+#include   // eoBin, eoPop, eoInsertion
+
+//-----------------------------------------------------------------------------
+
+typedef eoBin Chrom;
+
+//-----------------------------------------------------------------------------
+
+void binary_value(Chrom& chrom)
+{
+  float sum = 0;
+  for (unsigned i = 0; i < chrom.size(); i++)
+    if (chrom[i])
+      sum += pow(2, chrom.size() - i - 1);
+  chrom.fitness(sum);
+}
+
+//-----------------------------------------------------------------------------
+
+main()
+{
+  const unsigned CHROM_SIZE = 4;
+  unsigned i;
+ 
+  eoBinRandom random;
+
+  for (unsigned POP_SIZE = 4; POP_SIZE <=6; POP_SIZE++)
+    {
+      eoPop pop; 
+      
+      for (i = 0; i < POP_SIZE; i++)
+	    {
+	      Chrom chrom(CHROM_SIZE);
+	      random(chrom);
+	      binary_value(chrom);
+	      pop.push_back(chrom);
+	    }
+      
+      for (unsigned POP2_SIZE = 4; POP2_SIZE <=6; POP2_SIZE++)
+	{
+	  eoPop pop2, pop3, pop4, pop5, popx;
+	 	
+	  for (i = 0; i < POP2_SIZE; i++)
+	    {
+	      Chrom chrom(CHROM_SIZE);
+	      random(chrom);
+	      binary_value(chrom);
+	      pop2.push_back(chrom);
+	    }
+	
+	  std::cout << "--------------------------------------------------" << std::endl
+	       << "breeders \tpop" << std::endl
+	       << "--------------------------------------------------" << std::endl;
+	  for (i = 0; i < max(pop.size(), pop2.size()); i++)
+	    {	  
+	      if (pop.size() > i) 
+		std::cout << pop[i] << " " << pop[i].fitness() << "   \t";
+	      else
+		std::cout << "\t\t";
+	      if (pop2.size() > i)
+		std::cout << pop2[i] << " " << pop2[i].fitness();
+	      std::cout << std::endl;
+	    }
+	
+	  eoInsertion insertion(0.75);
+	  popx = pop;
+	  pop3 = pop2;
+	  insertion(popx, pop3);
+	  
+	  eoInsertion insertion2;
+	  popx = pop; 
+	  pop4 = pop2;
+	  insertion2(popx, pop4); 
+	  
+	  eoInsertion insertion3(1.5);
+	  popx = pop;
+	  pop5 = pop2;
+	  insertion3(popx, pop5); 
+	  
+	  std::cout << std::endl
+	       << "0.75 \t\t1.0 \t\t1.5" << std::endl
+	       << "---- \t\t--- \t\t---" << std::endl;
+	  for (i = 0; i < pop5.size(); i++)
+	    {
+	      if (pop3.size() > i)
+		std::cout << pop3[i] << " " << pop3[i].fitness() << "   \t";
+	      else
+		std::cout << " \t\t";
+	      if (pop4.size() > i)
+		std::cout << pop4[i] << " " << pop4[i].fitness() << "   \t";
+	      else
+		std::cout << " \t\t";
+	      if (pop5.size() > i)
+		std::cout << pop5[i] << " " << pop5[i].fitness();
+	      std::cout << std::endl;
+	    }
+	}
+    }
+  
+  return 0;
+}
+
+//-----------------------------------------------------------------------------
+
diff --git a/trunk/paradiseo-eo/test/t-eolottery.cpp b/trunk/paradiseo-eo/test/t-eolottery.cpp
new file mode 100644
index 000000000..e03926380
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eolottery.cpp
@@ -0,0 +1,54 @@
+//-----------------------------------------------------------------------------
+// t-eolottery.cpp
+//-----------------------------------------------------------------------------
+
+#include   // eoBin, eoPop, eoLottery
+
+//-----------------------------------------------------------------------------
+
+typedef eoBin Chrom;
+
+void binary_value(Chrom& chrom)
+{
+  float sum = 0; 
+  for (unsigned i = 0; i < chrom.size(); i++)
+    if (chrom[i])
+      sum += pow(2, i);
+  chrom.fitness(sum);
+}
+
+//-----------------------------------------------------------------------------
+
+main()
+{
+  const unsigned POP_SIZE = 8, CHROM_SIZE = 4;
+
+  eoPop pop, pop2;
+  eoBinRandom random;
+  unsigned i;
+
+  for (i = 0; i < POP_SIZE; i++)
+    {
+      Chrom chrom(CHROM_SIZE);
+      random(chrom);
+      binary_value(chrom);
+      pop.push_back(chrom);
+    }
+  
+  std::cout << "original population:" << std::endl;
+  sort(pop.begin(), pop.end());
+  for (i = 0; i < pop.size(); i++)
+    std::cout << pop[i] << "  " << pop[i].fitness() << std::endl;
+  
+  eoLottery lottery;
+  lottery(pop, pop2); 
+
+  std::cout << "selected by lottery population:" << std::endl;
+  sort(pop2.begin(), pop2.end());
+  for (i = 0; i < pop2.size(); i++)
+    std::cout << pop2[i] << "  " << pop2[i].fitness() << std::endl;
+
+  return 0;
+}
+
+//-----------------------------------------------------------------------------
diff --git a/trunk/paradiseo-eo/test/t-eoproblem.cpp b/trunk/paradiseo-eo/test/t-eoproblem.cpp
new file mode 100644
index 000000000..066efb62f
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-eoproblem.cpp
@@ -0,0 +1,55 @@
+//-----------------------------------------------------------------------------
+// t-eoproblem.cpp
+// (c) GeNeura Team 1998
+//-----------------------------------------------------------------------------
+
+#include     // time
+#include     // fabs
+#include   // std::cout
+#include         // eoVector, eoProblem
+
+//-----------------------------------------------------------------------------
+
+typedef eoVector Chrom;
+
+//-----------------------------------------------------------------------------
+
+std::ostream& operator<<(std::ostream& os, const Chrom& chrom)
+{
+  copy(chrom.begin(), chrom.end(), std::ostream_iterator(os));
+  return os;
+}
+
+//-----------------------------------------------------------------------------
+
+class Easy//: public eoProblem
+{
+public:
+  static const unsigned size;
+  
+  float operator()(const Chrom& chrom)
+    {
+      return 1.0 / (fabs(chrom[0]) + 1.0);
+    }
+};
+const unsigned Easy::size = 1;
+
+//-----------------------------------------------------------------------------
+
+int main()
+{
+  Easy easy;
+  Chrom chrom(Easy::size);
+  
+  srand(time(0));
+  
+  chrom[0] = ((float)rand()) / ((float)RAND_MAX);
+  chrom.fitness(easy(chrom));
+  
+  std::cout << "chrom = " << chrom << std::endl
+       << "chrom.fitness() = " << chrom.fitness() << std::endl;
+
+  return 0;
+}
+
+//-----------------------------------------------------------------------------
diff --git a/trunk/paradiseo-eo/test/t-selectOne.cpp b/trunk/paradiseo-eo/test/t-selectOne.cpp
new file mode 100644
index 000000000..e401188eb
--- /dev/null
+++ b/trunk/paradiseo-eo/test/t-selectOne.cpp
@@ -0,0 +1,88 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// t-selectOne.cpp
+//   This program test the breeder object
+// (c) GeNeura Team, 1998 
+/* 
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+            
+*/
+//-----------------------------------------------------------------------------
+
+#ifndef __GNUG__
+// to avoid long name warnings
+#pragma warning(disable:4786)
+#endif // __GNUG__
+
+#include   // eoBin, eoPop, eoBreeder
+#include 
+#include 
+
+#include 
+#include 
+#include 
+
+
+//-----------------------------------------------------------------------------
+
+typedef eoBin Chrom;
+
+#include "binary_value.h"
+
+//-----------------------------------------------------------------------------
+
+main()
+{
+  const unsigned POP_SIZE = 8, CHROM_SIZE = 4;
+  unsigned i;
+
+  eoBinRandom random;
+  eoPop pop; 
+
+  // Create the population
+  for (i = 0; i < POP_SIZE; ++i) {
+    Chrom chrom(CHROM_SIZE);
+    random(chrom);
+    BinaryValue()(chrom);
+    pop.push_back(chrom);
+  }
+  
+  // print population
+  std::cout << "population:" << std::endl;
+  for (i = 0; i < pop.size(); ++i)
+    std::cout << pop[i] << " " << pop[i].fitness() << std::endl;
+
+  // Declare 1-selectors
+  eoUniformSelect uSelect;
+
+  Chrom aChrom;
+  aChrom = uSelect( pop );
+  std::cout << "Uniform Select " << aChrom << " " << aChrom.fitness() << std::endl;
+
+  eoStochTournament sSelect(0.7);
+  aChrom = sSelect( pop );
+  std::cout << "Stochastic Tournament " << aChrom << " " << aChrom.fitness() << std::endl;
+
+  eoDetTournament dSelect(3);
+  aChrom = dSelect( pop );
+  std::cout << "Deterministic Tournament " << aChrom << " " << aChrom.fitness() << std::endl;
+
+  return 0;
+}
+
+//-----------------------------------------------------------------------------
diff --git a/trunk/paradiseo-eo/tutorial/.cvsignore b/trunk/paradiseo-eo/tutorial/.cvsignore
new file mode 100644
index 000000000..70845e08e
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/.cvsignore
@@ -0,0 +1 @@
+Makefile.in
diff --git a/trunk/paradiseo-eo/tutorial/CVS/Entries b/trunk/paradiseo-eo/tutorial/CVS/Entries
new file mode 100644
index 000000000..debcc0bf3
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/CVS/Entries
@@ -0,0 +1,6 @@
+/.cvsignore/1.1/Fri Sep 17 16:53:15 2004//
+/Makefile.am/1.3/Tue Feb 22 14:12:19 2005//
+/Makefile.simple/1.1/Fri Sep 17 15:20:15 2004//
+/README/1.4/Tue Dec 19 18:18:08 2000//
+/index.html/1.3/Thu Jan  4 15:23:14 2001//
+D
diff --git a/trunk/paradiseo-eo/tutorial/CVS/Entries.Log b/trunk/paradiseo-eo/tutorial/CVS/Entries.Log
new file mode 100644
index 000000000..ff2744c3c
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/CVS/Entries.Log
@@ -0,0 +1,10 @@
+A D/Lesson1////
+A D/Lesson2////
+A D/Lesson3////
+A D/Lesson4////
+A D/Lesson5////
+A D/ParadisEO////
+A D/Templates////
+A D/examples////
+A D/html////
+A D/pdf////
diff --git a/trunk/paradiseo-eo/tutorial/CVS/Repository b/trunk/paradiseo-eo/tutorial/CVS/Repository
new file mode 100644
index 000000000..0ba75763d
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/CVS/Repository
@@ -0,0 +1 @@
+eo/tutorial
diff --git a/trunk/paradiseo-eo/tutorial/CVS/Root b/trunk/paradiseo-eo/tutorial/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/tutorial/Lesson1/.cvsignore b/trunk/paradiseo-eo/tutorial/Lesson1/.cvsignore
new file mode 100644
index 000000000..70845e08e
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson1/.cvsignore
@@ -0,0 +1 @@
+Makefile.in
diff --git a/trunk/paradiseo-eo/tutorial/Lesson1/CVS/Entries b/trunk/paradiseo-eo/tutorial/Lesson1/CVS/Entries
new file mode 100644
index 000000000..0d1fe924e
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson1/CVS/Entries
@@ -0,0 +1,7 @@
+/.cvsignore/1.1/Fri Sep 17 16:53:14 2004//
+/FirstBitGA.cpp/1.10/Wed Sep 28 21:49:26 2005//
+/FirstRealGA.cpp/1.9/Wed Sep 28 21:49:26 2005//
+/Makefile.am/1.2/Wed Sep 22 18:18:30 2004//
+/Makefile.simple/1.1/Fri Sep 17 15:20:17 2004//
+/exercise1.3.cpp/1.7/Wed Sep 28 21:49:26 2005//
+D
diff --git a/trunk/paradiseo-eo/tutorial/Lesson1/CVS/Repository b/trunk/paradiseo-eo/tutorial/Lesson1/CVS/Repository
new file mode 100644
index 000000000..e47e5f49b
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson1/CVS/Repository
@@ -0,0 +1 @@
+eo/tutorial/Lesson1
diff --git a/trunk/paradiseo-eo/tutorial/Lesson1/CVS/Root b/trunk/paradiseo-eo/tutorial/Lesson1/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson1/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/tutorial/Lesson1/FirstBitGA.cpp b/trunk/paradiseo-eo/tutorial/Lesson1/FirstBitGA.cpp
new file mode 100644
index 000000000..ac53607ae
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson1/FirstBitGA.cpp
@@ -0,0 +1,167 @@
+//-----------------------------------------------------------------------------
+// FirstBitGA.cpp
+//-----------------------------------------------------------------------------
+//*
+// An instance of a VERY simple Bitstring Genetic Algorithm
+//
+//-----------------------------------------------------------------------------
+
+#ifdef HAVE_CONFIG_H
+#include 
+#endif
+
+#include 
+#include 
+
+#include 
+#include 
+
+// Use functions from namespace std
+using namespace std;
+
+// REPRESENTATION
+//-----------------------------------------------------------------------------
+// define your individuals
+typedef eoBit Indi;     // A bitstring with fitness double
+
+// EVAL
+//-----------------------------------------------------------------------------
+// a simple fitness function that computes the number of ones of a bitstring
+//  @param _indi A biststring individual
+
+double binary_value(const Indi & _indi)
+{
+  double sum = 0;
+  for (unsigned i = 0; i < _indi.size(); i++)
+    sum += _indi[i];
+  return sum;
+}
+// GENERAL
+//-----------------------------------------------------------------------------
+void main_function(int argc, char **argv)
+{
+// PARAMETRES
+  // all parameters are hard-coded!
+  const unsigned int SEED = 42;      // seed for random number generator
+  const unsigned int T_SIZE = 3;     // size for tournament selection
+  const unsigned int VEC_SIZE = 16;   // Number of bits in genotypes
+  const unsigned int POP_SIZE = 100;  // Size of population
+  const unsigned int MAX_GEN = 400;  // Maximum number of generation before STOP
+  const float CROSS_RATE = 0.8;      // Crossover rate
+  const double P_MUT_PER_BIT = 0.01; // probability of bit-flip mutation
+  const float MUT_RATE = 1.0;        // mutation rate
+
+// GENERAL
+  //////////////////////////
+  //  Random seed
+  //////////////////////////
+  //reproducible random seed: if you don't change SEED above,
+  // you'll aways get the same result, NOT a random run
+  rng.reseed(SEED);
+
+// EVAL
+  /////////////////////////////
+  // Fitness function
+  ////////////////////////////
+  // Evaluation: from a plain C++ fn to an EvalFunc Object
+  eoEvalFuncPtr eval(  binary_value );
+
+// INIT
+  ////////////////////////////////
+  // Initilisation of population
+  ////////////////////////////////
+
+  // declare the population
+  eoPop pop;
+  // fill it!
+  for (unsigned int igeno=0; igeno select(T_SIZE);  // T_SIZE in [2,POP_SIZE]
+
+// REPLACE
+  // The simple GA evolution engine uses generational replacement
+  // so no replacement procedure is needed
+
+// OPERATORS
+  //////////////////////////////////////
+  // The variation operators
+  //////////////////////////////////////
+// CROSSOVER
+  // 1-point crossover for bitstring
+  eo1PtBitXover xover;
+// MUTATION
+  // standard bit-flip mutation for bitstring
+  eoBitMutation  mutation(P_MUT_PER_BIT);
+
+// STOP
+// CHECKPOINT
+  //////////////////////////////////////
+  // termination condition
+  /////////////////////////////////////
+  // stop after MAX_GEN generations
+  eoGenContinue continuator(MAX_GEN);
+
+// GENERATION
+  /////////////////////////////////////////
+  // the algorithm
+  ////////////////////////////////////////
+  // standard Generational GA requires as parameters
+  // selection, evaluation, crossover and mutation, stopping criterion
+
+
+  eoSGA gga(select, xover, CROSS_RATE, mutation, MUT_RATE,
+                  eval, continuator);
+
+  // Apply algo to pop - that's it!
+  gga(pop);
+
+// OUTPUT
+  // Print (sorted) intial population
+  pop.sort();
+  cout << "FINAL Population\n" << pop << endl;
+// GENERAL
+}
+ // A main that catches the exceptions
+
+int main(int argc, char **argv)
+{
+
+    try
+    {
+        main_function(argc, argv);
+    }
+    catch(exception& e)
+    {
+        cout << "Exception: " << e.what() << '\n';
+    }
+
+    return 1;
+}
diff --git a/trunk/paradiseo-eo/tutorial/Lesson1/FirstRealGA.cpp b/trunk/paradiseo-eo/tutorial/Lesson1/FirstRealGA.cpp
new file mode 100644
index 000000000..09db59e61
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson1/FirstRealGA.cpp
@@ -0,0 +1,162 @@
+//-----------------------------------------------------------------------------
+// FirstRealGA.cpp
+//-----------------------------------------------------------------------------
+//*
+// An instance of a VERY simple Real-coded Genetic Algorithm
+//
+//-----------------------------------------------------------------------------
+#ifdef HAVE_CONFIG_H
+#include 
+#endif
+
+#include 
+#include 
+#include 
+
+#include 
+#include 
+
+// Use functions from namespace std
+using namespace std;
+
+// REPRESENTATION
+//-----------------------------------------------------------------------------
+// define your individuals
+ typedef eoReal Indi;
+
+// EVAL
+//-----------------------------------------------------------------------------
+// a simple fitness function that computes the euclidian norm of a real vector
+//    @param _indi A real-valued individual
+
+double real_value(const Indi & _indi)
+{
+  double sum = 0;
+  for (unsigned i = 0; i < _indi.size(); i++)
+      sum += _indi[i]*_indi[i];
+  return (-sum);            // maximizing only
+}
+// GENERAL
+//-----------------------------------------------------------------------------
+void main_function(int argc, char **argv)
+{
+// PARAMETRES
+  // all parameters are hard-coded!
+  const unsigned int SEED = 42; // seed for random number generator
+  const unsigned int VEC_SIZE = 8; // Number of object variables in genotypes
+  const unsigned int POP_SIZE = 20; // Size of population
+  const unsigned int T_SIZE = 3; // size for tournament selection
+  const unsigned int MAX_GEN = 500; // Maximum number of generation before STOP
+  const float CROSS_RATE = 0.8; // Crossover rate
+  const double EPSILON = 0.01;  // range for real uniform mutation
+  const float MUT_RATE = 0.5;   // mutation rate
+
+// GENERAL
+  //////////////////////////
+  //  Random seed
+  //////////////////////////
+  //reproducible random seed: if you don't change SEED above,
+  // you'll aways get the same result, NOT a random run
+  rng.reseed(SEED);
+
+// EVAL
+  /////////////////////////////
+  // Fitness function
+  ////////////////////////////
+  // Evaluation: from a plain C++ fn to an EvalFunc Object
+  eoEvalFuncPtr eval(  real_value );
+
+// INIT
+  ////////////////////////////////
+  // Initilisation of population
+  ////////////////////////////////
+
+  // declare the population
+  eoPop pop;
+  // fill it!
+  for (unsigned int igeno=0; igeno select(T_SIZE);       // T_SIZE in [2,POP_SIZE]
+
+// REPLACE
+  // eoSGA uses generational replacement by default
+  // so no replacement procedure has to be given
+
+// OPERATORS
+  //////////////////////////////////////
+  // The variation operators
+  //////////////////////////////////////
+// CROSSOVER
+  // offspring(i) is a linear combination of parent(i)
+  eoSegmentCrossover xover;
+// MUTATION
+  // offspring(i) uniformly chosen in [parent(i)-epsilon, parent(i)+epsilon]
+  eoUniformMutation  mutation(EPSILON);
+
+// STOP
+// CHECKPOINT
+  //////////////////////////////////////
+  // termination condition
+  /////////////////////////////////////
+  // stop after MAX_GEN generations
+  eoGenContinue continuator(MAX_GEN);
+
+// GENERATION
+  /////////////////////////////////////////
+  // the algorithm
+  ////////////////////////////////////////
+  // standard Generational GA requires
+  // selection, evaluation, crossover and mutation, stopping criterion
+
+
+  eoSGA gga(select, xover, CROSS_RATE, mutation, MUT_RATE,
+                   eval, continuator);
+
+  // Apply algo to pop - that's it!
+  gga(pop);
+
+// OUTPUT
+  // Print (sorted) intial population
+  pop.sort();
+  cout << "FINAL Population\n" << pop << endl;
+// GENERAL
+}
+
+// A main that catches the exceptions
+
+int main(int argc, char **argv)
+{
+    try
+    {
+        main_function(argc, argv);
+    }
+    catch(exception& e)
+    {
+        cout << "Exception: " << e.what() << '\n';
+    }
+
+    return 1;
+}
diff --git a/trunk/paradiseo-eo/tutorial/Lesson1/Makefile.am b/trunk/paradiseo-eo/tutorial/Lesson1/Makefile.am
new file mode 100644
index 000000000..d74f07337
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson1/Makefile.am
@@ -0,0 +1,16 @@
+
+noinst_PROGRAMS		= FirstBitGA FirstRealGA exercise1.3
+
+FirstBitGA_SOURCES	= FirstBitGA.cpp
+
+FirstRealGA_SOURCES	= FirstRealGA.cpp
+
+exercise1_3_SOURCES	= exercise1.3.cpp
+
+
+LDADD			= -L$(top_builddir)/src -L$(top_builddir)/src/ga -L$(top_builddir)/src/utils
+
+LIBS			=  -lga -leoutils -leo
+
+INCLUDES		= -I$(top_srcdir)/src
+
diff --git a/trunk/paradiseo-eo/tutorial/Lesson1/Makefile.simple b/trunk/paradiseo-eo/tutorial/Lesson1/Makefile.simple
new file mode 100644
index 000000000..093ca8525
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson1/Makefile.simple
@@ -0,0 +1,25 @@
+# if you use this Makefile as a starting point for another application
+# you might need to modify the following
+DIR_EO = ../../src
+
+.SUFFIXES: .cpp
+
+# Warning: $(CXX) in Linux (RedHat and Mandrake at least) is g++
+# However, if you are using this Makefile within xemacs, 
+# and have problems with the interpretation of the output (and its colors)
+# then you should use c++ instead (make CXX=c++ will do)
+
+.cpp: ; $(CXX)  -DPACKAGE=\"eo\" -DVERSION=\"0.9.3\" -I. -I$(DIR_EO) -Wall -g -pg  -o $@  $*.cpp $(DIR_EO)/utils/libeoutils.a $(DIR_EO)/libeo.a 
+
+.cpp.o: ; $(CXX) -DPACKAGE=\"eo\" -DVERSION=\"0.9.3\" -I. -I$(DIR_EO) -Wall -g -c -pg $*.cpp
+
+firstGA = FirstRealGA FirstBitGA
+
+ALL = $(firstGA) exercise1.3
+
+lesson1 : $(firstGA)
+
+all : $(ALL)
+
+clean : 
+	@/bin/rm $(ALL) *.o *~
diff --git a/trunk/paradiseo-eo/tutorial/Lesson1/exercise1.3.cpp b/trunk/paradiseo-eo/tutorial/Lesson1/exercise1.3.cpp
new file mode 100644
index 000000000..abd62a0b9
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson1/exercise1.3.cpp
@@ -0,0 +1,162 @@
+#ifdef HAVE_CONFIG_H
+#include 
+#endif
+
+//-----------------------------------------------------------------------------
+// FirstBitGA.cpp
+//-----------------------------------------------------------------------------
+//*
+// An instance of a VERY simple Bitstring Genetic Algorithm
+//
+//-----------------------------------------------------------------------------
+// standard includes
+#include 
+#include 
+
+// the general include for eo
+#include 
+
+//-----------------------------------------------------------------------------
+// Include the corresponding file
+#include 	         // bitstring representation & operators
+// define your individuals
+typedef eoBit Indi;	// A bitstring with fitness double
+
+using namespace std;
+
+//-----------------------------------------------------------------------------
+/** a simple fitness function that computes the number of ones of a bitstring
+    @param _indi A biststring individual
+*/
+
+double binary_value(const Indi & _indi)
+{
+  double sum = 0;
+  for (unsigned i = 0; i < _indi.size(); i++)
+    sum += _indi[i];
+  return sum;
+}
+
+//-----------------------------------------------------------------------------
+
+void main_function(int argc, char **argv)
+{
+  const unsigned int SEED = 42;	// seed for random number generator
+  const unsigned int VEC_SIZE = 8; // Number of bits in genotypes
+  const unsigned int POP_SIZE = 20; // Size of population
+  const unsigned int MAX_GEN = 500; // Maximum number of generation before STOP
+  const float CROSS_RATE = 0.8;	// Crossover rate
+  const double P_MUT_PER_BIT = 0.01;	// probability of bit-flip mutation
+  const float MUT_RATE = 1.0;	// mutation rate
+
+  //////////////////////////
+  //  Random seed
+  //////////////////////////
+  //reproducible random seed: if you don't change SEED above,
+  // you'll aways get the same result, NOT a random run
+  rng.reseed(SEED);
+
+  /////////////////////////////
+  // Fitness function
+  ////////////////////////////
+  // Evaluation: from a plain C++ fn to an EvalFunc Object
+  eoEvalFuncPtr eval(  binary_value );
+
+  ////////////////////////////////
+  // Initilisation of population
+  ////////////////////////////////
+
+  // declare the population
+  eoPop pop;
+  // fill it!
+  for (unsigned int igeno=0; igeno select;
+
+  // could also use stochastic binary tournament selection
+  //
+  //  const double RATE = 0.75;
+  //  eoStochTournamentSelect select(RATE);     // RATE in ]0.5,1]
+  // The robust tournament selection
+  const unsigned int T_SIZE = 3; // size for tournament selection
+  eoDetTournamentSelect select(T_SIZE);       // T_SIZE in [2,POP_SIZE]
+
+  // and of course the random selection
+  // eoRandomSelect select;
+
+  // The simple GA evolution engine uses generational replacement
+  // so no replacement procedure is needed
+
+  //////////////////////////////////////
+  // termination condition
+  /////////////////////////////////////
+  // stop after MAX_GEN generations
+  eoGenContinue continuator(MAX_GEN);
+
+
+  //////////////////////////////////////
+  // The variation operators
+  //////////////////////////////////////
+  // standard bit-flip mutation for bitstring
+  eoBitMutation  mutation(P_MUT_PER_BIT);
+  // 1-point mutation for bitstring
+  eo1PtBitXover xover;
+
+  /////////////////////////////////////////
+  // the algorithm
+  ////////////////////////////////////////
+  // standard Generational GA requires as parameters
+  // selection, evaluation, crossover and mutation, stopping criterion
+
+
+  eoSGA gga(select, xover, CROSS_RATE, mutation, MUT_RATE,
+  		   eval, continuator);
+
+  // Apply algo to pop - that's it!
+  gga(pop);
+
+  // Print (sorted) intial population
+  pop.sort();
+  cout << "FINAL Population\n" << pop << endl;
+}
+
+// A main that catches the exceptions
+
+int main(int argc, char **argv)
+{
+
+    try
+    {
+        main_function(argc, argv);
+    }
+    catch(exception& e)
+    {
+        cout << "Exception: " << e.what() << '\n';
+    }
+
+    return 1;
+}
diff --git a/trunk/paradiseo-eo/tutorial/Lesson2/.cvsignore b/trunk/paradiseo-eo/tutorial/Lesson2/.cvsignore
new file mode 100644
index 000000000..70845e08e
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson2/.cvsignore
@@ -0,0 +1 @@
+Makefile.in
diff --git a/trunk/paradiseo-eo/tutorial/Lesson2/CVS/Entries b/trunk/paradiseo-eo/tutorial/Lesson2/CVS/Entries
new file mode 100644
index 000000000..42b9146d4
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson2/CVS/Entries
@@ -0,0 +1,9 @@
+/.cvsignore/1.1/Fri Sep 17 16:53:14 2004//
+/FirstBitEA.cpp/1.11/Wed Sep 28 21:49:26 2005//
+/FirstRealEA.cpp/1.14/Wed Sep 28 21:49:26 2005//
+/Makefile.am/1.3/Sun Oct  2 21:42:08 2005//
+/Makefile.simple/1.1/Fri Sep 17 15:20:18 2004//
+/binary_value.h/1.2/Thu Feb 27 19:19:51 2003//
+/exercise2.3.cpp/1.8/Wed Sep 28 21:49:26 2005//
+/real_value.h/1.3/Tue Feb 27 05:09:09 2001//
+D
diff --git a/trunk/paradiseo-eo/tutorial/Lesson2/CVS/Repository b/trunk/paradiseo-eo/tutorial/Lesson2/CVS/Repository
new file mode 100644
index 000000000..9e14e730f
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson2/CVS/Repository
@@ -0,0 +1 @@
+eo/tutorial/Lesson2
diff --git a/trunk/paradiseo-eo/tutorial/Lesson2/CVS/Root b/trunk/paradiseo-eo/tutorial/Lesson2/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson2/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/tutorial/Lesson2/FirstBitEA.cpp b/trunk/paradiseo-eo/tutorial/Lesson2/FirstBitEA.cpp
new file mode 100644
index 000000000..13da78957
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson2/FirstBitEA.cpp
@@ -0,0 +1,193 @@
+//-----------------------------------------------------------------------------
+// FirstBitEA.cpp
+//-----------------------------------------------------------------------------
+//*
+// Still an instance of a VERY simple Bitstring Genetic Algorithm
+// (see FirstBitGA.cpp) but now with  Breeder - and Combined Ops
+//
+//-----------------------------------------------------------------------------
+#ifdef HAVE_CONFIG_H
+#include 
+#endif
+
+// standard includes
+#include   // runtime_error
+#include    // cout
+
+// the general include for eo
+#include 
+#include 
+
+// Use functions from namespace std
+using namespace std;
+
+// REPRESENTATION
+//-----------------------------------------------------------------------------
+// define your individuals
+typedef eoBit Indi;	// A bitstring with fitness double
+
+// EVALFUNC
+//-----------------------------------------------------------------------------
+// a simple fitness function that computes the number of ones of a bitstring
+// Now in a separate file, and declared as binary_value(const vector &)
+
+#include "binary_value.h"
+
+// GENERAL
+//-----------------------------------------------------------------------------
+
+void main_function(int argc, char **argv)
+{
+// PARAMETRES
+  const unsigned int SEED = 42;	// seed for random number generator
+  const unsigned int T_SIZE = 3; // size for tournament selection
+  const unsigned int VEC_SIZE = 8; // Number of bits in genotypes
+  const unsigned int POP_SIZE = 20; // Size of population
+
+  const unsigned int MAX_GEN = 500; // Maximum number of generation before STOP
+  const unsigned int MIN_GEN = 10;  // Minimum number of generation before ...
+  const unsigned int STEADY_GEN = 50; // stop after STEADY_GEN gen. without improvelent
+
+  const double P_CROSS = 0.8;	// Crossover probability
+  const double P_MUT = 1.0;	// mutation probability
+
+  const double P_MUT_PER_BIT = 0.01;	// internal probability for bit-flip mutation
+  // some parameters for chosing among different operators
+  const double onePointRate = 0.5;     // rate for 1-pt Xover
+  const double twoPointsRate = 0.5;     // rate for 2-pt Xover
+  const double URate = 0.5;            // rate for Uniform Xover
+  const double bitFlipRate = 0.5;      // rate for bit-flip mutation
+  const double oneBitRate = 0.5;       // rate for one-bit mutation
+
+// GENERAL
+  //////////////////////////
+  //  Random seed
+  //////////////////////////
+  //reproducible random seed: if you don't change SEED above,
+  // you'll aways get the same result, NOT a random run
+  rng.reseed(SEED);
+
+// EVAL
+  /////////////////////////////
+  // Fitness function
+  ////////////////////////////
+  // Evaluation: from a plain C++ fn to an EvalFunc Object
+  // you need to give the full description of the function
+  eoEvalFuncPtr& > eval(  binary_value );
+
+// INIT
+  ////////////////////////////////
+  // Initilisation of population
+  ////////////////////////////////
+
+  // based on boolean_generator class (see utils/eoRndGenerators.h)
+  eoUniformGenerator uGen;
+  eoInitFixedLength random(VEC_SIZE, uGen);
+  // Initialization of the population
+  eoPop pop(POP_SIZE, random);
+
+  // and evaluate it in one loop
+  apply(eval, pop);	// STL syntax
+
+// OUTPUT
+  // sort pop before printing it!
+  pop.sort();
+  // Print (sorted) intial population (raw printout)
+  cout << "Initial Population" << endl;
+  cout << pop;
+
+// ENGINE
+  /////////////////////////////////////
+  // selection and replacement
+  ////////////////////////////////////
+// SELECT
+  // The robust tournament selection
+  eoDetTournamentSelect selectOne(T_SIZE);       // T_SIZE in [2,POP_SIZE]
+  // is now encapsulated in a eoSelectPerc (entage)
+  eoSelectPerc select(selectOne);// by default rate==1
+
+// REPLACE
+  // And we now have the full slection/replacement - though with
+  // no replacement (== generational replacement) at the moment :-)
+  eoGenerationalReplacement replace;
+
+// OPERATORS
+  //////////////////////////////////////
+  // The variation operators
+  //////////////////////////////////////
+// CROSSOVER
+  // 1-point crossover for bitstring
+  eo1PtBitXover xover1;
+  // uniform crossover for bitstring
+  eoUBitXover xoverU;
+  // 2-pots xover
+  eoNPtsBitXover xover2(2);
+  // Combine them with relative rates
+  eoPropCombinedQuadOp xover(xover1, onePointRate);
+  xover.add(xoverU, URate);
+  xover.add(xover2, twoPointsRate, true);
+
+// MUTATION
+  // standard bit-flip mutation for bitstring
+  eoBitMutation  mutationBitFlip(P_MUT_PER_BIT);
+  // mutate exactly 1 bit per individual
+  eoDetBitFlip mutationOneBit;
+  // Combine them with relative rates
+  eoPropCombinedMonOp mutation(mutationBitFlip, bitFlipRate);
+  mutation.add(mutationOneBit, oneBitRate, true);
+
+  // The operators are  encapsulated into an eoTRansform object
+  eoSGATransform transform(xover, P_CROSS, mutation, P_MUT);
+
+// STOP
+// CHECKPOINT
+  //////////////////////////////////////
+  // termination conditions: use more than one
+  /////////////////////////////////////
+  // stop after MAX_GEN generations
+  eoGenContinue genCont(MAX_GEN);
+  // do MIN_GEN gen., then stop after STEADY_GEN gen. without improvement
+  eoSteadyFitContinue steadyCont(MIN_GEN, STEADY_GEN);
+  // stop when fitness reaches a target (here VEC_SIZE)
+  eoFitContinue fitCont(VEC_SIZE);
+  // do stop when one of the above says so
+  eoCombinedContinue continuator(genCont);
+  continuator.add(steadyCont);
+  continuator.add(fitCont);
+
+// GENERATION
+  /////////////////////////////////////////
+  // the algorithm
+  ////////////////////////////////////////
+
+  // Easy EA requires
+  // selection, transformation, eval, replacement, and stopping criterion
+  eoEasyEA gga(continuator, eval, select, transform, replace);
+
+  // Apply algo to pop - that's it!
+  cout << "\n        Here we go\n\n";
+  gga(pop);
+
+// OUTPUT
+  // Print (sorted) intial population
+  pop.sort();
+  cout << "FINAL Population\n" << pop << endl;
+// GENERAL
+}
+
+// A main that catches the exceptions
+
+int main(int argc, char **argv)
+{
+
+    try
+    {
+        main_function(argc, argv);
+    }
+    catch(exception& e)
+    {
+        cout << "Exception: " << e.what() << '\n';
+    }
+
+    return 1;
+}
diff --git a/trunk/paradiseo-eo/tutorial/Lesson2/FirstRealEA.cpp b/trunk/paradiseo-eo/tutorial/Lesson2/FirstRealEA.cpp
new file mode 100644
index 000000000..8901c3818
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson2/FirstRealEA.cpp
@@ -0,0 +1,192 @@
+//-----------------------------------------------------------------------------
+// FirstRealEA.cpp
+//-----------------------------------------------------------------------------
+//*
+// Still an instance of a VERY simple Real-coded  Genetic Algorithm
+// (see FirstBitGA.cpp) but now with  Breeder - and Combined Ops
+//
+//-----------------------------------------------------------------------------
+#ifdef HAVE_CONFIG_H
+#include 
+#endif
+
+// standard includes
+#include   // runtime_error
+#include    // cout
+
+// the general include for eo
+#include 
+#include 
+
+// REPRESENTATION
+//-----------------------------------------------------------------------------
+// define your individuals
+typedef eoReal Indi;
+
+// Use functions from namespace std
+using namespace std;
+
+// EVALFUNC
+//-----------------------------------------------------------------------------
+// a simple fitness function that computes the euclidian norm of a real vector
+// Now in a separate file, and declared as binary_value(const vector &)
+
+#include "real_value.h"
+
+// GENERAL
+//-----------------------------------------------------------------------------
+
+void main_function(int argc, char **argv)
+{
+// PARAMETRES
+  const unsigned int SEED = 42;	// seed for random number generator
+  const unsigned int T_SIZE = 3; // size for tournament selection
+  const unsigned int VEC_SIZE = 8; // Number of object variables in genotypes
+  const unsigned int POP_SIZE = 20; // Size of population
+
+  const unsigned int MAX_GEN = 500; // Maximum number of generation before STOP
+  const unsigned int MIN_GEN = 10;  // Minimum number of generation before ...
+  const unsigned int STEADY_GEN = 50; // stop after STEADY_GEN gen. without improvelent
+
+  const float P_CROSS = 0.8;	// Crossover probability
+  const float P_MUT = 0.5;	// mutation probability
+
+  const double EPSILON = 0.01;	// range for real uniform mutation
+  double SIGMA = 0.3;       	// std dev. for normal mutation
+  // some parameters for chosing among different operators
+  const double hypercubeRate = 0.5;     // relative weight for hypercube Xover
+  const double segmentRate = 0.5;  // relative weight for segment Xover
+  const double uniformMutRate = 0.5;  // relative weight for uniform mutation
+  const double detMutRate = 0.5;      // relative weight for det-uniform mutation
+  const double normalMutRate = 0.5;   // relative weight for normal mutation
+
+// GENERAL
+  //////////////////////////
+  //  Random seed
+  //////////////////////////
+  //reproducible random seed: if you don't change SEED above,
+  // you'll aways get the same result, NOT a random run
+  rng.reseed(SEED);
+
+// EVAL
+  /////////////////////////////
+  // Fitness function
+  ////////////////////////////
+  // Evaluation: from a plain C++ fn to an EvalFunc Object
+  // you need to give the full description of the function
+  eoEvalFuncPtr& > eval(  real_value );
+
+// INIT
+  ////////////////////////////////
+  // Initilisation of population
+  ////////////////////////////////
+  // based on a uniform generator
+  eoUniformGenerator uGen(-1.0, 1.0);
+  eoInitFixedLength random(VEC_SIZE, uGen);
+   // Initialization of the population
+  eoPop pop(POP_SIZE, random);
+
+  // and evaluate it in one loop
+  apply(eval, pop);	// STL syntax
+
+// OUTPUT
+  // sort pop before printing it!
+  pop.sort();
+  // Print (sorted) intial population (raw printout)
+  cout << "Initial Population" << endl;
+  cout << pop;
+
+// ENGINE
+  /////////////////////////////////////
+  // selection and replacement
+  ////////////////////////////////////
+// SELECT
+  // The robust tournament selection
+  eoDetTournamentSelect selectOne(T_SIZE);
+  // is now encapsulated in a eoSelectPerc (entage)
+  eoSelectPerc select(selectOne);// by default rate==1
+
+// REPLACE
+  // And we now have the full slection/replacement - though with
+  // no replacement (== generational replacement) at the moment :-)
+  eoGenerationalReplacement replace;
+
+// OPERATORS
+  //////////////////////////////////////
+  // The variation operators
+  //////////////////////////////////////
+// CROSSOVER
+  // uniform chooce on segment made by the parents
+  eoSegmentCrossover xoverS;
+  // uniform choice in hypercube built by the parents
+  eoHypercubeCrossover xoverA;
+  // Combine them with relative weights
+  eoPropCombinedQuadOp xover(xoverS, segmentRate);
+  xover.add(xoverA, hypercubeRate, true);
+
+// MUTATION
+  // offspring(i) uniformly chosen in [parent(i)-epsilon, parent(i)+epsilon]
+  eoUniformMutation  mutationU(EPSILON);
+  // k (=1) coordinates of parents are uniformly modified
+  eoDetUniformMutation  mutationD(EPSILON);
+  // all coordinates of parents are normally modified (stDev SIGMA)
+  eoNormalMutation  mutationN(SIGMA);
+  // Combine them with relative weights
+  eoPropCombinedMonOp mutation(mutationU, uniformMutRate);
+  mutation.add(mutationD, detMutRate);
+  mutation.add(mutationN, normalMutRate, true);
+
+// STOP
+// CHECKPOINT
+  //////////////////////////////////////
+  // termination conditions: use more than one
+  /////////////////////////////////////
+  // stop after MAX_GEN generations
+  eoGenContinue genCont(MAX_GEN);
+  // do MIN_GEN gen., then stop after STEADY_GEN gen. without improvement
+  eoSteadyFitContinue steadyCont(MIN_GEN, STEADY_GEN);
+  // stop when fitness reaches a target (here VEC_SIZE)
+  eoFitContinue fitCont(0);
+  // do stop when one of the above says so
+  eoCombinedContinue continuator(genCont);
+  continuator.add(steadyCont);
+  continuator.add(fitCont);
+
+  // The operators are  encapsulated into an eoTRansform object
+  eoSGATransform transform(xover, P_CROSS, mutation, P_MUT);
+
+// GENERATION
+  /////////////////////////////////////////
+  // the algorithm
+  ////////////////////////////////////////
+
+  // Easy EA requires
+  // selection, transformation, eval, replacement, and stopping criterion
+  eoEasyEA gga(continuator, eval, select, transform, replace);
+
+  // Apply algo to pop - that's it!
+  cout << "\n        Here we go\n\n";
+  gga(pop);
+
+// OUTPUT
+  // Print (sorted) intial population
+  pop.sort();
+  cout << "FINAL Population\n" << pop << endl;
+// GENERAL
+}
+
+// A main that catches the exceptions
+
+int main(int argc, char **argv)
+{
+    try
+    {
+        main_function(argc, argv);
+    }
+    catch(exception& e)
+    {
+        cout << "Exception: " << e.what() << '\n';
+    }
+
+    return 1;
+}
diff --git a/trunk/paradiseo-eo/tutorial/Lesson2/Makefile.am b/trunk/paradiseo-eo/tutorial/Lesson2/Makefile.am
new file mode 100644
index 000000000..44abb144c
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson2/Makefile.am
@@ -0,0 +1,23 @@
+
+noinst_PROGRAMS		= FirstBitEA FirstRealEA exercise2.3
+
+
+FirstBitEA_SOURCES	= FirstBitEA.cpp
+
+FirstRealEA_SOURCES	= FirstRealEA.cpp
+
+exercise2_3_SOURCES	= exercise2.3.cpp
+
+
+noinst_HEADERS		= binary_value.h \
+			real_value.h
+
+extra_DIST		= Makefile.simple
+
+
+LDADD			= -L$(top_builddir)/src -L$(top_builddir)/src/ga -L$(top_builddir)/src/utils
+
+LIBS			=  -lga -leo -leoutils
+
+INCLUDES		= -I$(top_srcdir)/src
+
diff --git a/trunk/paradiseo-eo/tutorial/Lesson2/Makefile.simple b/trunk/paradiseo-eo/tutorial/Lesson2/Makefile.simple
new file mode 100644
index 000000000..1aec17105
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson2/Makefile.simple
@@ -0,0 +1,34 @@
+### This Makefile is part of the tutorial of the EO library
+# Unlike other Makefiles in EO, it is not using the automake/autoconf 
+# so that it stays easy to understant (you are in the tutorial, remember!)
+# MS, Oct. 2002
+
+# if you use this Makefile as a starting point for another application
+# you might need to modify the following
+DIR_EO = ../../src
+
+.SUFFIXES: .cpp
+
+# Warning: $(CXX) in Linux (RedHat and Mandrake at least) is g++
+# However, if you are using this Makefile within xemacs, 
+# and have problems with the interpretation of the output (and its colors)
+# then you should use c++ instead (make CXX=c++ will do)
+
+.cpp: ; $(CXX)  -DPACKAGE=\"eo\" -DVERSION=\"0.9.3\" -I. -I$(DIR_EO) -Wall -g -pg  -o $@  $*.cpp $(DIR_EO)/utils/libeoutils.a $(DIR_EO)/libeo.a 
+
+.cpp.o: ; $(CXX) -DPACKAGE=\"eo\" -DVERSION=\"0.9.3\" -I. -I$(DIR_EO) -Wall -g -c -pg $*.cpp
+
+firstEA = FirstRealEA FirstBitEA
+
+ALL = $(firstEA) exercise2.3
+
+lesson2 : $(firstEA)
+
+all : $(ALL)
+
+clean : 
+	@/bin/rm $(ALL) *.o *~
+
+FirstRealEA : real_value.h
+
+FirstBitEA : binary_value.h
diff --git a/trunk/paradiseo-eo/tutorial/Lesson2/binary_value.h b/trunk/paradiseo-eo/tutorial/Lesson2/binary_value.h
new file mode 100644
index 000000000..f2f5d6ca1
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson2/binary_value.h
@@ -0,0 +1,17 @@
+#include 
+
+//-----------------------------------------------------------------------------
+
+/** Just a simple function that takes binary value of a chromosome and sets
+    the fitnes.
+    @param _chrom A binary chromosome 
+*/
+// INIT
+double binary_value(const std::vector& _chrom)
+{
+  double sum = 0;
+  for (unsigned i = 0; i < _chrom.size(); i++)
+    sum += _chrom[i];
+  return sum;
+}
+
diff --git a/trunk/paradiseo-eo/tutorial/Lesson2/exercise2.3.cpp b/trunk/paradiseo-eo/tutorial/Lesson2/exercise2.3.cpp
new file mode 100644
index 000000000..dc39e5d9f
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson2/exercise2.3.cpp
@@ -0,0 +1,197 @@
+//-----------------------------------------------------------------------------
+// FirstBitEA.cpp
+//-----------------------------------------------------------------------------
+//*
+// Still an instance of a VERY simple Bitstring Genetic Algorithm
+// (see FirstBitGA.cpp) but now with  Breeder - and Combined Ops
+//
+//-----------------------------------------------------------------------------
+#ifdef HAVE_CONFIG_H
+#include 
+#endif
+
+// standard includes
+#include   // runtime_error
+#include    // cout
+
+// the general include for eo
+#include 
+
+// REPRESENTATION
+//-----------------------------------------------------------------------------
+// Include the corresponding file
+#include 	         // bitstring representation & operators
+// define your individuals
+typedef eoBit Indi;	// A bitstring with fitness double
+
+// EVAL
+//-----------------------------------------------------------------------------
+// a simple fitness function that computes the number of ones of a bitstring
+// Now in a separate file, and declared as binary_value(const vector &)
+
+#include "binary_value.h"
+
+// GENERAL
+//-----------------------------------------------------------------------------
+
+using namespace std;
+
+void main_function(int argc, char **argv)
+{
+// PARAMETRES
+  const unsigned int SEED = 42;	// seed for random number generator
+  const unsigned int T_SIZE = 3; // size for tournament selection
+  const unsigned int VEC_SIZE = 20; // Number of bits in genotypes
+  const unsigned int POP_SIZE = 20; // Size of population
+
+  const unsigned int MAX_GEN = 500; // Maximum number of generation before STOP
+  const unsigned int MIN_GEN = 10;  // Minimum number of generation before ...
+  const unsigned int STEADY_GEN = 50; // stop after STEADY_GEN gen. without improvelent
+
+  const double P_CROSS = 0.8;	// Crossover probability
+  const double P_MUT = 1.0;	// mutation probability
+
+  const double P_MUT_PER_BIT = 0.01;	// internal probability for bit-flip mutation
+  // some parameters for chosing among different operators
+  const double onePointRate = 0.5;     // rate for 1-pt Xover
+  const double twoPointsRate = 0.5;     // rate for 2-pt Xover
+  const double URate = 0.5;            // rate for Uniform Xover
+  const double bitFlipRate = 0.5;      // rate for bit-flip mutation
+  const double oneBitRate = 0.5;       // rate for one-bit mutation
+
+// GENERAL
+  //////////////////////////
+  //  Random seed
+  //////////////////////////
+  //reproducible random seed: if you don't change SEED above,
+  // you'll aways get the same result, NOT a random run
+  rng.reseed(SEED);
+
+// EVAL
+  /////////////////////////////
+  // Fitness function
+  ////////////////////////////
+  // Evaluation: from a plain C++ fn to an EvalFunc Object
+  // you need to give the full description of the function
+  eoEvalFuncPtr& > eval(  binary_value );
+
+// INIT
+  ////////////////////////////////
+  // Initilisation of population
+  ////////////////////////////////
+
+  // based on boolean_generator class (see utils/rnd_generator.h)
+  eoUniformGenerator uGen;
+  eoInitFixedLength random(VEC_SIZE, uGen);
+  // Initialization of the population
+  eoPop pop(POP_SIZE, random);
+
+  // and evaluate it in one loop
+  apply(eval, pop);	// STL syntax
+
+// OUTPUT
+  // sort pop before printing it!
+  pop.sort();
+  // Print (sorted) intial population (raw printout)
+  cout << "Initial Population" << endl;
+  cout << pop;
+
+// ENGINE
+  /////////////////////////////////////
+  // selection and replacement
+  ////////////////////////////////////
+// SELECT
+  // The robust tournament selection
+  eoDetTournamentSelect selectOne(T_SIZE);       // T_SIZE in [2,POP_SIZE]
+  // solution solution solution solution solution solution solution
+  // modify the nb offspring / rate in the constructor. 2 ways:
+  // second arg treated as integer
+  eoSelectMany select(selectOne,2, eo_is_an_integer);
+  // second arg treated as a rate (default behavior)
+  //  eoSelectMany select(selectOne,0.1);
+
+// REPLACE
+  // solution solution solution solution solution solution solution
+  // eoCommaReplacement keeps the best among offspring
+  // eoPlusReplacement keeps the best among parents + offspring
+  //  eoCommaReplacement replace;
+  eoPlusReplacement replace;
+
+// OPERATORS
+  //////////////////////////////////////
+  // The variation operators
+  //////////////////////////////////////
+// CROSSOVER
+  // 1-point crossover for bitstring
+  eo1PtBitXover xover1;
+  // uniform crossover for bitstring
+  eoUBitXover xoverU;
+  // 2-pots xover
+  eoNPtsBitXover xover2(2);
+  // Combine them with relative rates
+  eoPropCombinedQuadOp xover(xover1, onePointRate);
+  xover.add(xoverU, URate);
+  xover.add(xover2, twoPointsRate, true);
+
+// MUTATION
+  // standard bit-flip mutation for bitstring
+  eoBitMutation  mutationBitFlip(P_MUT_PER_BIT);
+  // mutate exactly 1 bit per individual
+  eoDetBitFlip mutationOneBit;
+  // Combine them with relative rates
+  eoPropCombinedMonOp mutation(mutationBitFlip, bitFlipRate);
+  mutation.add(mutationOneBit, oneBitRate, true);
+
+  // The operators are  encapsulated into an eoTRansform object
+  eoSGATransform transform(xover, P_CROSS, mutation, P_MUT);
+
+// STOP
+// CHECKPOINT
+  //////////////////////////////////////
+  // termination conditions: use more than one
+  /////////////////////////////////////
+  // stop after MAX_GEN generations
+  eoGenContinue genCont(MAX_GEN);
+  // do MIN_GEN gen., then stop after STEADY_GEN gen. without improvement
+  eoSteadyFitContinue steadyCont(MIN_GEN, STEADY_GEN);
+  // stop when fitness reaches a target (here VEC_SIZE)
+  eoFitContinue fitCont(VEC_SIZE);
+  // do stop when one of the above says so
+  eoCombinedContinue continuator(genCont);
+  continuator.add(steadyCont);
+  continuator.add(fitCont);
+
+// GENERATION
+  /////////////////////////////////////////
+  // the algorithm
+  ////////////////////////////////////////
+
+  // Easy EA requires
+  // selection, transformation, eval, replacement, and stopping criterion
+  eoEasyEA gga(continuator, eval, select, transform, replace);
+
+  // Apply algo to pop - that's it!
+  gga(pop);
+
+// OUTPUT
+  // Print (sorted) intial population
+  pop.sort();
+  cout << "FINAL Population\n" << pop << endl;
+// GENERAL
+}
+
+// A main that catches the exceptions
+
+int main(int argc, char **argv)
+{
+    try
+    {
+        main_function(argc, argv);
+    }
+    catch(exception& e)
+    {
+        cout << "Exception: " << e.what() << '\n';
+    }
+
+    return 1;
+}
diff --git a/trunk/paradiseo-eo/tutorial/Lesson2/real_value.h b/trunk/paradiseo-eo/tutorial/Lesson2/real_value.h
new file mode 100644
index 000000000..cc32e633f
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson2/real_value.h
@@ -0,0 +1,20 @@
+#include 
+//-----------------------------------------------------------------------------
+/** Just a simple function that takes an vector and sets the fitnes 
+    to the sphere function. Please use doubles not float!!!
+    @param _ind A floatingpoint vector 
+*/
+
+// INIT
+double real_value(const std::vector& _ind)
+{
+  double sum = 0;
+  for (unsigned i = 0; i < _ind.size(); i++)
+      {
+	  sum += _ind[i] * _ind[i];
+      }
+  return -sum;
+}
+
+
+
diff --git a/trunk/paradiseo-eo/tutorial/Lesson3/.cvsignore b/trunk/paradiseo-eo/tutorial/Lesson3/.cvsignore
new file mode 100644
index 000000000..70845e08e
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson3/.cvsignore
@@ -0,0 +1 @@
+Makefile.in
diff --git a/trunk/paradiseo-eo/tutorial/Lesson3/CVS/Entries b/trunk/paradiseo-eo/tutorial/Lesson3/CVS/Entries
new file mode 100644
index 000000000..125db17d2
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson3/CVS/Entries
@@ -0,0 +1,9 @@
+/.cvsignore/1.1/Fri Sep 17 16:53:13 2004//
+/Makefile.am/1.5/Wed Dec  7 15:51:32 2005//
+/Makefile.simple/1.1/Fri Sep 17 15:20:18 2004//
+/SecondBitEA.cpp/1.17/Wed Sep 28 21:49:26 2005//
+/SecondRealEA.cpp/1.4/Wed Sep 28 21:49:26 2005//
+/binary_value.h/1.2/Thu Feb 27 19:19:40 2003//
+/exercise3.1.cpp/1.19/Wed Sep 28 21:49:26 2005//
+/real_value.h/1.1/Wed May 22 02:13:06 2002//
+D
diff --git a/trunk/paradiseo-eo/tutorial/Lesson3/CVS/Repository b/trunk/paradiseo-eo/tutorial/Lesson3/CVS/Repository
new file mode 100644
index 000000000..125e4ffb8
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson3/CVS/Repository
@@ -0,0 +1 @@
+eo/tutorial/Lesson3
diff --git a/trunk/paradiseo-eo/tutorial/Lesson3/CVS/Root b/trunk/paradiseo-eo/tutorial/Lesson3/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson3/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/tutorial/Lesson3/Makefile.am b/trunk/paradiseo-eo/tutorial/Lesson3/Makefile.am
new file mode 100644
index 000000000..50f53cd8b
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson3/Makefile.am
@@ -0,0 +1,22 @@
+
+noinst_PROGRAMS		= SecondBitEA SecondRealEA exercise3.1
+
+
+SecondBitEA_SOURCES	= SecondBitEA.cpp
+
+SecondRealEA_SOURCES	= SecondRealEA.cpp
+
+exercise3_1_SOURCES	= exercise3.1.cpp
+
+
+noinst_HEADERS		= binary_value.h \
+			real_value.h
+
+extra_DIST		= Makefile.simple
+
+
+LDADD			= -L$(top_builddir)/src -L$(top_builddir)/src/ga -L$(top_builddir)/src/utils
+
+LIBS			=  -lga -leoutils -leo
+
+INCLUDES		= -I$(top_srcdir)/src
diff --git a/trunk/paradiseo-eo/tutorial/Lesson3/Makefile.simple b/trunk/paradiseo-eo/tutorial/Lesson3/Makefile.simple
new file mode 100644
index 000000000..186791f26
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson3/Makefile.simple
@@ -0,0 +1,33 @@
+### This Makefile is part of the tutorial of the EO library
+# Unlike other Makefiles in EO, it is not using the automake/autoconf 
+# so that it stays easy to understant (you are in the tutorial, remember!)
+# MS, Oct. 2002
+
+# if you use this Makefile as a starting point for another application
+# you might need to modify the following
+DIR_EO = ../../src
+
+.SUFFIXES: .cpp
+
+# Warning: $(CXX) in Linux (RedHat and Mandrake at least) is g++
+# However, if you are using this Makefile within xemacs, 
+# and have problems with the interpretation of the output (and its colors)
+# then you should use c++ instead (make CXX=c++ will do)
+
+.cpp: ; $(CXX)  -DPACKAGE=\"eo\" -DVERSION=\"0.9.3\" -I. -I$(DIR_EO) -Wall -g -pg  -o $@  $*.cpp $(DIR_EO)/utils/libeoutils.a $(DIR_EO)/libeo.a 
+
+.cpp.o: ; $(CXX) -DPACKAGE=\"eo\" -DVERSION=\"0.9.3\" -I. -I$(DIR_EO) -Wall -g -c -pg $*.cpp
+
+secondEA = SecondBitEA SecondRealEA
+
+ALL = $(secondEA) exercise3.1
+
+lesson3 : $(secondEA)
+
+all : $(ALL)
+
+SecondBitEA : binary_value.h
+SecondRealEA : real_value.h
+
+clean : 
+	@/bin/rm $(ALL) *.o *.sav *.xg *.status *~
diff --git a/trunk/paradiseo-eo/tutorial/Lesson3/SecondBitEA.cpp b/trunk/paradiseo-eo/tutorial/Lesson3/SecondBitEA.cpp
new file mode 100644
index 000000000..0507bc5c3
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson3/SecondBitEA.cpp
@@ -0,0 +1,348 @@
+//-----------------------------------------------------------------------------
+// SecondGA.cpp
+//-----------------------------------------------------------------------------
+//*
+// Same code than FirstBitEA as far as Evolutionary Computation is concerned
+// but now you learn to enter the parameters in a more flexible way
+// and to twidle the output to your preferences!
+//-----------------------------------------------------------------------------
+#ifdef HAVE_CONFIG_H
+#include 
+#endif
+
+// standard includes
+#include 
+#include    // cout
+#include   // runtime_error
+
+// the general include for eo
+#include 
+#include 
+
+// Use functions from namespace std
+using namespace std;
+
+// EVAL
+#include "binary_value.h"
+
+// REPRESENTATION
+//-----------------------------------------------------------------------------
+// define your genotype and fitness types
+typedef eoBit Indi;
+
+// the main_function: nothing changed(!), except variable initialization
+void main_function(int argc, char **argv)
+{
+// PARAMETRES
+//-----------------------------------------------------------------------------
+// instead of having all values of useful parameters as constants, read them:
+// either on the command line (--option=value or -o=value)
+//     or in a parameter file (same syntax, order independent,
+//                             # = usual comment character
+//     or in the environment (TODO)
+
+  // First define a parser from the command-line arguments
+    eoParser parser(argc, argv);
+
+    // For each parameter, define Parameter, read it through the parser,
+    // and assign the value to the variable
+
+    eoValueParam seedParam(time(0), "seed", "Random number seed", 'S');
+    parser.processParam( seedParam );
+    unsigned seed = seedParam.value();
+
+   // description of genotype
+    eoValueParam vecSizeParam(8, "vecSize", "Genotype size",'V');
+    parser.processParam( vecSizeParam, "Representation" );
+    unsigned vecSize = vecSizeParam.value();
+
+   // parameters for evolution engine
+    eoValueParam popSizeParam(10, "popSize", "Population size",'P');
+    parser.processParam( popSizeParam, "Evolution engine" );
+    unsigned popSize = popSizeParam.value();
+
+    eoValueParam tSizeParam(10, "tSize", "Tournament size",'T');
+    parser.processParam( tSizeParam, "Evolution Engine" );
+    unsigned tSize = tSizeParam.value();
+
+   // init and stop
+    eoValueParam loadNameParam("", "Load","A save file to restart from",'L');
+    parser.processParam( loadNameParam, "Persistence" );
+    string loadName = loadNameParam.value();
+
+    eoValueParam maxGenParam(100, "maxGen", "Maximum number of generations",'G');
+    parser.processParam( maxGenParam, "Stopping criterion" );
+    unsigned maxGen = maxGenParam.value();
+
+    eoValueParam minGenParam(100, "minGen", "Minimum number of generations",'g');
+    parser.processParam( minGenParam, "Stopping criterion" );
+    unsigned minGen = minGenParam.value();
+
+    eoValueParam steadyGenParam(100, "steadyGen", "Number of generations with no improvement",'s');
+    parser.processParam( steadyGenParam, "Stopping criterion" );
+    unsigned steadyGen = steadyGenParam.value();
+
+   // operators probabilities at the algorithm level
+    eoValueParam pCrossParam(0.6, "pCross", "Probability of Crossover", 'C');
+    parser.processParam( pCrossParam, "Genetic Operators" );
+    double pCross = pCrossParam.value();
+
+    eoValueParam pMutParam(0.1, "pMut", "Probability of Mutation", 'M');
+    parser.processParam( pMutParam, "Genetic Operators" );
+    double pMut = pMutParam.value();
+
+   // relative rates for crossovers
+    eoValueParam onePointRateParam(1, "onePointRate", "Relative rate for one point crossover", '1');
+    parser.processParam( onePointRateParam, "Genetic Operators" );
+    double onePointRate = onePointRateParam.value();
+
+    eoValueParam twoPointsRateParam(1, "twoPointRate", "Relative rate for two point crossover", '2');
+    parser.processParam( twoPointsRateParam, "Genetic Operators" );
+    double twoPointsRate = twoPointsRateParam.value();
+
+    eoValueParam uRateParam(2, "uRate", "Relative rate for uniform crossover", 'U');
+    parser.processParam( uRateParam, "Genetic Operators" );
+    double URate =  uRateParam.value();
+
+   // relative rates and private parameters for mutations;
+    eoValueParam pMutPerBitParam(0.01, "pMutPerBit", "Probability of flipping 1 bit in bit-flip mutation", 'b');
+    parser.processParam( pMutPerBitParam, "Genetic Operators" );
+    double pMutPerBit = pMutPerBitParam.value();
+
+    eoValueParam bitFlipRateParam(0.01, "bitFlipRate", "Relative rate for bit-flip mutation", 'B');
+    parser.processParam( bitFlipRateParam, "Genetic Operators" );
+    double bitFlipRate =  bitFlipRateParam.value();
+
+    eoValueParam oneBitRateParam(0.01, "oneBitRate", "Relative rate for deterministic bit-flip mutation", 'D');
+    parser.processParam( oneBitRateParam, "Genetic Operators" );
+    double oneBitRate = oneBitRateParam.value();
+
+    // the name of the "status" file where all actual parameter values will be saved
+    string str_status = parser.ProgramName() + ".status"; // default value
+    eoValueParam statusParam(str_status.c_str(), "status","Status file",'S');
+    parser.processParam( statusParam, "Persistence" );
+
+   // do the following AFTER ALL PARAMETERS HAVE BEEN PROCESSED
+   // i.e. in case you need parameters somewhere else, postpone these
+    if (parser.userNeedsHelp())
+      {
+        parser.printHelp(cout);
+        exit(1);
+      }
+    if (statusParam.value() != "")
+      {
+	ofstream os(statusParam.value().c_str());
+	os << parser;		// and you can use that file as parameter file
+      }
+
+// EVAL
+  /////////////////////////////
+  // Fitness function
+  ////////////////////////////
+  // Evaluation: from a plain C++ fn to an EvalFunc Object ...
+  eoEvalFuncPtr& > plainEval( binary_value );
+  // ... to an object that counts the nb of actual evaluations
+  eoEvalFuncCounter eval(plainEval);
+
+// INIT
+  ////////////////////////////////
+  // Initilisation of population
+  ////////////////////////////////
+  // Either load or initialize
+  // create an empty pop
+  eoPop pop;
+  // create a state for reading
+  eoState inState;		// a state for loading - WITHOUT the parser
+  // register the rng and the pop in the state, so they can be loaded,
+  // and the present run will be the exact conitnuation of the saved run
+  // eventually with different parameters
+  inState.registerObject(rng);
+  inState.registerObject(pop);
+
+  if (loadName != "")
+    {
+      inState.load(loadName); //  load the pop and the rng
+      // the fitness is read in the file:
+      // do only evaluate the pop if the fitness has changed
+    }
+  else
+    {
+      rng.reseed(seed);
+      // a Indi random initializer
+      // based on boolean_generator class (see utils/rnd_generator.h)
+      eoUniformGenerator uGen;
+      eoInitFixedLength random(vecSize, uGen);
+
+      // Init pop from the randomizer: need to use the append function
+      pop.append(popSize, random);
+      // and evaluate pop (STL syntax)
+      apply(eval, pop);
+    } // end of initializatio of the population
+
+// OUTPUT
+  // sort pop for pretty printout
+  pop.sort();
+  // Print (sorted) intial population (raw printout)
+  cout << "Initial Population" << endl << pop << endl;
+
+// ENGINE
+  /////////////////////////////////////
+  // selection and replacement
+  ////////////////////////////////////
+// SELECT
+  // The robust tournament selection
+  eoDetTournamentSelect selectOne(tSize);       // tSize in [2,POPSIZE]
+  // is now encapsulated in a eoSelectPerc (stands for Percentage)
+  eoSelectPerc select(selectOne);
+
+// REPLACE
+  // And we now have the full slection/replacement - though with
+  // the same generational replacement at the moment :-)
+  eoGenerationalReplacement replace;
+
+// OPERATORS
+  //////////////////////////////////////
+  // The variation operators
+  //////////////////////////////////////
+// CROSSOVER
+  // 1-point crossover for bitstring
+  eo1PtBitXover xover1;
+  // uniform crossover for bitstring
+  eoUBitXover xoverU;
+  // 2-pots xover
+  eoNPtsBitXover xover2(2);
+  // Combine them with relative rates
+  eoPropCombinedQuadOp xover(xover1, onePointRate);
+  xover.add(xoverU, URate);
+  xover.add(xover2, twoPointsRate, true);
+
+// MUTATION
+  // standard bit-flip mutation for bitstring
+  eoBitMutation  mutationBitFlip(pMutPerBit);
+  // mutate exactly 1 bit per individual
+  eoDetBitFlip mutationOneBit;
+  // Combine them with relative rates
+  eoPropCombinedMonOp mutation(mutationBitFlip, bitFlipRate);
+  mutation.add(mutationOneBit, oneBitRate, true);
+
+  // The operators are  encapsulated into an eoTRansform object
+  eoSGATransform transform(xover, pCross, mutation, pMut);
+
+// STOP
+  //////////////////////////////////////
+  // termination condition see FirstBitEA.cpp
+  /////////////////////////////////////
+  eoGenContinue genCont(maxGen);
+  eoSteadyFitContinue steadyCont(minGen, steadyGen);
+  eoFitContinue fitCont(vecSize);
+  eoCombinedContinue continuator(genCont);
+  continuator.add(steadyCont);
+  continuator.add(fitCont);
+
+
+// CHECKPOINT
+  // but now you want to make many different things every generation
+  // (e.g. statistics, plots, ...).
+  // the class eoCheckPoint is dedicated to just that:
+
+  // Declare a checkpoint (from a continuator: an eoCheckPoint
+  // IS AN eoContinue and will be called in the loop of all algorithms)
+  eoCheckPoint checkpoint(continuator);
+
+    // Create a counter parameter
+    eoValueParam generationCounter(0, "Gen.");
+
+    // Create an incrementor (sub-class of eoUpdater). Note that the
+    // parameter's value is passed by reference,
+    // so every time the incrementer is updated (every generation),
+    // the data in generationCounter will change.
+    eoIncrementor increment(generationCounter.value());
+
+    // Add it to the checkpoint,
+    // so the counter is updated (here, incremented) every generation
+    checkpoint.add(increment);
+
+    // now some statistics on the population:
+    // Best fitness in population
+    eoBestFitnessStat bestStat;
+    // Second moment stats: average and stdev
+    eoSecondMomentStats SecondStat;
+
+    // Add them to the checkpoint to get them called at the appropriate time
+    checkpoint.add(bestStat);
+    checkpoint.add(SecondStat);
+
+    // The Stdout monitor will print parameters to the screen ...
+    eoStdoutMonitor monitor(false);
+
+    // when called by the checkpoint (i.e. at every generation)
+    checkpoint.add(monitor);
+
+    // the monitor will output a series of parameters: add them
+    monitor.add(generationCounter);
+    monitor.add(eval);		// because now eval is an eoEvalFuncCounter!
+    monitor.add(bestStat);
+    monitor.add(SecondStat);
+
+    // A file monitor: will print parameters to ... a File, yes, you got it!
+    eoFileMonitor fileMonitor("stats.xg", " ");
+
+    // the checkpoint mechanism can handle multiple monitors
+    checkpoint.add(fileMonitor);
+
+    // the fileMonitor can monitor parameters, too, but you must tell it!
+    fileMonitor.add(generationCounter);
+    fileMonitor.add(bestStat);
+    fileMonitor.add(SecondStat);
+
+    // Last type of item the eoCheckpoint can handle: state savers:
+    eoState outState;
+    // Register the algorithm into the state (so it has something to save!!)
+    outState.registerObject(parser);
+    outState.registerObject(pop);
+    outState.registerObject(rng);
+
+    // and feed the state to state savers
+    // save state every 100th  generation
+    eoCountedStateSaver stateSaver1(20, outState, "generation");
+    // save state every 1 seconds
+    eoTimedStateSaver   stateSaver2(1, outState, "time");
+
+    // Don't forget to add the two savers to the checkpoint
+    checkpoint.add(stateSaver1);
+    checkpoint.add(stateSaver2);
+    // and that's it for the (control and) output
+
+// GENERATION
+  /////////////////////////////////////////
+  // the algorithm
+  ////////////////////////////////////////
+
+  // Easy EA requires
+  // stopping criterion, eval, selection, transformation, replacement
+  eoEasyEA gga(checkpoint, eval, select, transform, replace);
+
+  // Apply algo to pop - that's it!
+  gga(pop);
+
+// OUTPUT
+  // Print (sorted) intial population
+  pop.sort();
+  cout << "FINAL Population\n" << pop << endl;
+// GENERAL
+}
+
+// A main that catches the exceptions
+int main(int argc, char **argv)
+{
+    try
+    {
+        main_function(argc, argv);
+    }
+    catch(exception& e)
+    {
+        cout << "Exception: " << e.what() << '\n';
+    }
+
+    return 1;
+}
diff --git a/trunk/paradiseo-eo/tutorial/Lesson3/SecondRealEA.cpp b/trunk/paradiseo-eo/tutorial/Lesson3/SecondRealEA.cpp
new file mode 100644
index 000000000..2ae69fd81
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson3/SecondRealEA.cpp
@@ -0,0 +1,329 @@
+//-----------------------------------------------------------------------------
+// SecondRealEA.cpp
+//-----------------------------------------------------------------------------
+//*
+// Same code than FirstBitEA as far as Evolutionary Computation is concerned
+// but now you learn to enter the parameters in a more flexible way
+// (also slightly different than in SecondBitEA.cpp)
+// and to twidle the output to your preferences (as in SecondBitEA.cpp)
+//
+//-----------------------------------------------------------------------------
+#ifdef HAVE_CONFIG_H
+#include 
+#endif
+
+// standard includes
+#include 
+#include    // cout
+#include   // runtime_error
+
+// the general include for eo
+#include 
+#include 
+
+// REPRESENTATION
+//-----------------------------------------------------------------------------
+// define your individuals
+typedef eoReal Indi;
+
+// Use functions from namespace std
+using namespace std;
+
+// EVALFUNC
+//-----------------------------------------------------------------------------
+// a simple fitness function that computes the euclidian norm of a real vector
+// Now in a separate file, and declared as binary_value(const vector &)
+
+#include "real_value.h"
+
+// GENERAL
+//-----------------------------------------------------------------------------
+
+void main_function(int argc, char **argv)
+{
+// PARAMETRES
+//-----------------------------------------------------------------------------
+// instead of having all values of useful parameters as constants, read them:
+// either on the command line (--option=value or -o=value)
+//     or in a parameter file (same syntax, order independent,
+//                             # = usual comment character
+//     or in the environment (TODO)
+
+  // First define a parser from the command-line arguments
+  eoParser parser(argc, argv);
+
+  // For each parameter, you can in on single line
+  // define the parameter, read it through the parser, and assign it
+
+  unsigned seed = parser.createParam(unsigned(time(0)), "seed", "Random number seed", 'S').value(); // will be in default section General
+
+  // description of genotype
+  unsigned vecSize = parser.createParam(unsigned(8), "vecSize", "Genotype size",'V', "Representation" ).value();
+
+   // parameters for evolution engine
+    unsigned popSize = parser.createParam(unsigned(10), "popSize", "Population size",'P', "Evolution engine" ).value();
+
+    unsigned tSize = parser.createParam(unsigned(2), "tSize", "Tournament size",'T', "Evolution Engine" ).value();
+
+   // init and stop
+    string loadName = parser.createParam(string(""), "Load","A save file to restart from",'L', "Persistence" ).value();
+
+    unsigned maxGen = parser.createParam(unsigned(100), "maxGen", "Maximum number of generations",'G', "Stopping criterion" ).value();
+
+    unsigned minGen = parser.createParam(unsigned(100), "minGen", "Minimum number of generations",'g', "Stopping criterion" ).value();
+
+    unsigned steadyGen = parser.createParam(unsigned(100), "steadyGen", "Number of generations with no improvement",'s', "Stopping criterion" ).value();
+
+   // operators probabilities at the algorithm level
+    double pCross = parser.createParam(double(0.6), "pCross", "Probability of Crossover", 'C', "Genetic Operators" ).value();
+
+    double pMut = parser.createParam(double(0.1), "pMut", "Probability of Mutation", 'M', "Genetic Operators" ).value();
+
+   // relative rates for crossovers
+    double hypercubeRate = parser.createParam(double(1), "hypercubeRate", "Relative rate for hypercube crossover", '\0', "Genetic Operators" ).value();
+
+    double segmentRate = parser.createParam(double(1), "segmentRate", "Relative rate for segment crossover", '\0', "Genetic Operators" ).value();
+
+    // internal parameters for the mutations
+    double EPSILON = parser.createParam(double(0.01), "EPSILON", "Width for uniform mutation", '\0', "Genetic Operators" ).value();
+
+    double SIGMA = parser.createParam(double(0.3), "SIGMA", "Sigma for normal mutation", '\0', "Genetic Operators" ).value();
+
+   // relative rates for mutations
+    double uniformMutRate = parser.createParam(double(1), "uniformMutRate", "Relative rate for uniform mutation", '\0', "Genetic Operators" ).value();
+
+    double detMutRate = parser.createParam(double(1), "detMutRate", "Relative rate for det-uniform mutation", '\0', "Genetic Operators" ).value();
+
+    double normalMutRate = parser.createParam(double(1), "normalMutRate", "Relative rate for normal mutation", '\0', "Genetic Operators" ).value();
+
+    // the name of the "status" file where all actual parameter values will be saved
+    string str_status = parser.ProgramName() + ".status"; // default value
+    string statusName = parser.createParam(str_status, "status","Status file",'S', "Persistence" ).value();
+
+   // do the following AFTER ALL PARAMETERS HAVE BEEN PROCESSED
+   // i.e. in case you need parameters somewhere else, postpone these
+    if (parser.userNeedsHelp())
+      {
+        parser.printHelp(cout);
+        exit(1);
+      }
+    if (statusName != "")
+      {
+	ofstream os(statusName.c_str());
+	os << parser;		// and you can use that file as parameter file
+      }
+
+// EVAL
+  /////////////////////////////
+  // Fitness function
+  ////////////////////////////
+  // Evaluation: from a plain C++ fn to an EvalFunc Object
+  // you need to give the full description of the function
+  eoEvalFuncPtr& > plainEval(  real_value );
+  // ... to an object that counts the nb of actual evaluations
+  eoEvalFuncCounter eval(plainEval);
+
+// INIT
+  ////////////////////////////////
+  // Initilisation of population
+  ////////////////////////////////
+  // Either load or initialize
+  // create an empty pop
+  eoPop pop;
+  // create a state for reading
+  eoState inState;		// a state for loading - WITHOUT the parser
+  // register the rng and the pop in the state, so they can be loaded,
+  // and the present run will be the exact conitnuation of the saved run
+  // eventually with different parameters
+  inState.registerObject(rng);
+  inState.registerObject(pop);
+
+  if (loadName != "")
+    {
+      inState.load(loadName); //  load the pop and the rng
+      // the fitness is read in the file:
+      // do only evaluate the pop if the fitness has changed
+    }
+  else
+    {
+      rng.reseed(seed);
+      // a Indi random initializer
+      // based on boolean_generator class (see utils/rnd_generator.h)
+      eoUniformGenerator uGen(-1.0, 1.0);
+      eoInitFixedLength random(vecSize, uGen);
+
+      // Init pop from the randomizer: need to use the append function
+      pop.append(popSize, random);
+      // and evaluate pop (STL syntax)
+      apply(eval, pop);
+    } // end of initializatio of the population
+
+// OUTPUT
+  // sort pop before printing it!
+  pop.sort();
+  // Print (sorted) intial population (raw printout)
+  cout << "Initial Population" << endl;
+  cout << pop;
+
+// ENGINE
+  /////////////////////////////////////
+  // selection and replacement
+  ////////////////////////////////////
+// SELECT
+  // The robust tournament selection
+  eoDetTournamentSelect selectOne(tSize);
+  // is now encapsulated in a eoSelectPerc (entage)
+  eoSelectPerc select(selectOne);// by default rate==1
+
+// REPLACE
+  // And we now have the full slection/replacement - though with
+  // no replacement (== generational replacement) at the moment :-)
+  eoGenerationalReplacement replace;
+
+// OPERATORS
+  //////////////////////////////////////
+  // The variation operators
+  //////////////////////////////////////
+// CROSSOVER
+  // uniform chooce on segment made by the parents
+  eoSegmentCrossover xoverS;
+  // uniform choice in hypercube built by the parents
+  eoHypercubeCrossover xoverA;
+  // Combine them with relative weights
+  eoPropCombinedQuadOp xover(xoverS, segmentRate);
+  xover.add(xoverA, hypercubeRate, true);
+
+// MUTATION
+  // offspring(i) uniformly chosen in [parent(i)-epsilon, parent(i)+epsilon]
+  eoUniformMutation  mutationU(EPSILON);
+  // k (=1) coordinates of parents are uniformly modified
+  eoDetUniformMutation  mutationD(EPSILON);
+  // all coordinates of parents are normally modified (stDev SIGMA)
+  eoNormalMutation  mutationN(SIGMA);
+  // Combine them with relative weights
+  eoPropCombinedMonOp mutation(mutationU, uniformMutRate);
+  mutation.add(mutationD, detMutRate);
+  mutation.add(mutationN, normalMutRate, true);
+
+  // The operators are  encapsulated into an eoTRansform object
+  eoSGATransform transform(xover, pCross, mutation, pMut);
+
+// STOP
+  //////////////////////////////////////
+  // termination condition see FirstBitEA.cpp
+  /////////////////////////////////////
+  eoGenContinue genCont(maxGen);
+  eoSteadyFitContinue steadyCont(minGen, steadyGen);
+  eoFitContinue fitCont(0);
+  eoCombinedContinue continuator(genCont);
+  continuator.add(steadyCont);
+  continuator.add(fitCont);
+
+
+// CHECKPOINT
+  // but now you want to make many different things every generation
+  // (e.g. statistics, plots, ...).
+  // the class eoCheckPoint is dedicated to just that:
+
+  // Declare a checkpoint (from a continuator: an eoCheckPoint
+  // IS AN eoContinue and will be called in the loop of all algorithms)
+  eoCheckPoint checkpoint(continuator);
+
+    // Create a counter parameter
+    eoValueParam generationCounter(0, "Gen.");
+
+    // Create an incrementor (sub-class of eoUpdater). Note that the
+    // parameter's value is passed by reference,
+    // so every time the incrementer is updated (every generation),
+    // the data in generationCounter will change.
+    eoIncrementor increment(generationCounter.value());
+
+    // Add it to the checkpoint,
+    // so the counter is updated (here, incremented) every generation
+    checkpoint.add(increment);
+
+    // now some statistics on the population:
+    // Best fitness in population
+    eoBestFitnessStat bestStat;
+    // Second moment stats: average and stdev
+    eoSecondMomentStats SecondStat;
+
+    // Add them to the checkpoint to get them called at the appropriate time
+    checkpoint.add(bestStat);
+    checkpoint.add(SecondStat);
+
+    // The Stdout monitor will print parameters to the screen ...
+    eoStdoutMonitor monitor(false);
+
+    // when called by the checkpoint (i.e. at every generation)
+    checkpoint.add(monitor);
+
+    // the monitor will output a series of parameters: add them
+    monitor.add(generationCounter);
+    monitor.add(eval);		// because now eval is an eoEvalFuncCounter!
+    monitor.add(bestStat);
+    monitor.add(SecondStat);
+
+    // A file monitor: will print parameters to ... a File, yes, you got it!
+    eoFileMonitor fileMonitor("stats.xg", " ");
+
+    // the checkpoint mechanism can handle multiple monitors
+    checkpoint.add(fileMonitor);
+
+    // the fileMonitor can monitor parameters, too, but you must tell it!
+    fileMonitor.add(generationCounter);
+    fileMonitor.add(bestStat);
+    fileMonitor.add(SecondStat);
+
+    // Last type of item the eoCheckpoint can handle: state savers:
+    eoState outState;
+    // Register the algorithm into the state (so it has something to save!!)
+    outState.registerObject(parser);
+    outState.registerObject(pop);
+    outState.registerObject(rng);
+
+    // and feed the state to state savers
+    // save state every 100th  generation
+    eoCountedStateSaver stateSaver1(20, outState, "generation");
+    // save state every 1 seconds
+    eoTimedStateSaver   stateSaver2(1, outState, "time");
+
+    // Don't forget to add the two savers to the checkpoint
+    checkpoint.add(stateSaver1);
+    checkpoint.add(stateSaver2);
+    // and that's it for the (control and) output
+
+// GENERATION
+  /////////////////////////////////////////
+  // the algorithm
+  ////////////////////////////////////////
+
+  // Easy EA requires
+  // stopping criterion, eval, selection, transformation, replacement
+  eoEasyEA gga(checkpoint, eval, select, transform, replace);
+
+  // Apply algo to pop - that's it!
+  gga(pop);
+
+// OUTPUT
+  // Print (sorted) intial population
+  pop.sort();
+  cout << "FINAL Population\n" << pop << endl;
+// GENERAL
+}
+
+// A main that catches the exceptions
+
+int main(int argc, char **argv)
+{
+    try
+    {
+        main_function(argc, argv);
+    }
+    catch(exception& e)
+    {
+        cout << "Exception: " << e.what() << '\n';
+    }
+
+    return 1;
+}
diff --git a/trunk/paradiseo-eo/tutorial/Lesson3/binary_value.h b/trunk/paradiseo-eo/tutorial/Lesson3/binary_value.h
new file mode 100644
index 000000000..f2f5d6ca1
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson3/binary_value.h
@@ -0,0 +1,17 @@
+#include 
+
+//-----------------------------------------------------------------------------
+
+/** Just a simple function that takes binary value of a chromosome and sets
+    the fitnes.
+    @param _chrom A binary chromosome 
+*/
+// INIT
+double binary_value(const std::vector& _chrom)
+{
+  double sum = 0;
+  for (unsigned i = 0; i < _chrom.size(); i++)
+    sum += _chrom[i];
+  return sum;
+}
+
diff --git a/trunk/paradiseo-eo/tutorial/Lesson3/exercise3.1.cpp b/trunk/paradiseo-eo/tutorial/Lesson3/exercise3.1.cpp
new file mode 100644
index 000000000..50531e094
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson3/exercise3.1.cpp
@@ -0,0 +1,404 @@
+//-----------------------------------------------------------------------------
+// SecondBitGA.cpp
+//-----------------------------------------------------------------------------
+//*
+// Same code than FirstBitEA as far as Evolutionary Computation is concerned
+// but now you learn to enter the parameters in a more flexible way
+// and to twidle the output to your preferences!
+//-----------------------------------------------------------------------------
+#ifdef HAVE_CONFIG_H
+#include 
+#endif
+
+// standard includes
+#include 
+#include    // cout
+#include   // runtime_error
+
+// the general include for eo
+#include 
+
+// EVAL
+#include "binary_value.h"
+
+// REPRESENTATION
+//-----------------------------------------------------------------------------
+// Include the corresponding file
+#include 	         // bitstring representation & operators
+// define your genotype and fitness types
+typedef eoBit Indi;
+
+using namespace std;
+
+// the main_function: nothing changed(!), except variable initialization
+void main_function(int argc, char **argv)
+{
+// PARAMETRES
+//-----------------------------------------------------------------------------
+// instead of having all values of useful parameters as constants, read them:
+// either on the command line (--option=value or -o=value)
+//     or in a parameter file (same syntax, order independent,
+//                             # = usual comment character
+//     or in the environment (TODO)
+
+  // First define a parser from the command-line arguments
+    eoParser parser(argc, argv);
+
+    // For each parameter, define Parameter, read it through the parser,
+    // and assign the value to the variable
+
+    eoValueParam seedParam(time(0), "seed", "Random number seed", 'S');
+    parser.processParam( seedParam );
+    unsigned seed = seedParam.value();
+
+   // description of genotype
+    eoValueParam vecSizeParam(100, "vecSize", "Genotype size",'V');
+    parser.processParam( vecSizeParam, "Representation" );
+    unsigned vecSize = vecSizeParam.value();
+
+   // parameters for evolution engine
+    eoValueParam popSizeParam(100, "popSize", "Population size",'P');
+    parser.processParam( popSizeParam, "Evolution engine" );
+    unsigned popSize = popSizeParam.value();
+
+    eoValueParam tSizeParam(10, "tSize", "Tournament size",'T');
+    parser.processParam( tSizeParam, "Evolution Engine" );
+    unsigned tSize = tSizeParam.value();
+
+   // init and stop
+    eoValueParam loadNameParam("", "Load","A save file to restart from",'L');
+    parser.processParam( loadNameParam, "Persistence" );
+    string loadName = loadNameParam.value();
+
+    eoValueParam maxGenParam(500, "maxGen", "Maximum number of generations",'G');
+    parser.processParam( maxGenParam, "Stopping criterion" );
+    unsigned maxGen = maxGenParam.value();
+
+    eoValueParam minGenParam(500, "minGen", "Minimum number of generations",'g');
+    parser.processParam( minGenParam, "Stopping criterion" );
+    unsigned minGen = minGenParam.value();
+
+    eoValueParam steadyGenParam(100, "steadyGen", "Number of generations with no improvement",'s');
+    parser.processParam( steadyGenParam, "Stopping criterion" );
+    unsigned steadyGen = steadyGenParam.value();
+
+   // operators probabilities at the algorithm level
+    eoValueParam pCrossParam(0.6, "pCross", "Probability of Crossover", 'C');
+    parser.processParam( pCrossParam, "Genetic Operators" );
+    double pCross = pCrossParam.value();
+
+    eoValueParam pMutParam(0.1, "pMut", "Probability of Mutation", 'M');
+    parser.processParam( pMutParam, "Genetic Operators" );
+    double pMut = pMutParam.value();
+
+   // relative rates for crossovers
+    eoValueParam onePointRateParam(1, "onePointRate", "Relative rate for one point crossover", '1');
+    parser.processParam( onePointRateParam, "Genetic Operators" );
+    double onePointRate = onePointRateParam.value();
+
+    eoValueParam twoPointsRateParam(1, "twoPointRate", "Relative rate for two point crossover", '2');
+    parser.processParam( twoPointsRateParam, "Genetic Operators" );
+    double twoPointsRate = twoPointsRateParam.value();
+
+    eoValueParam uRateParam(2, "uRate", "Relative rate for uniform crossover", 'U');
+    parser.processParam( uRateParam, "Genetic Operators" );
+    double URate =  uRateParam.value();
+
+   // relative rates and private parameters for mutations;
+    eoValueParam pMutPerBitParam(0.01, "pMutPerBit", "Probability of flipping 1 bit in bit-flip mutation", 'b');
+    parser.processParam( pMutPerBitParam, "Genetic Operators" );
+    double pMutPerBit = pMutPerBitParam.value();
+
+    eoValueParam bitFlipRateParam(0.01, "bitFlipRate", "Relative rate for bit-flip mutation", 'B');
+    parser.processParam( bitFlipRateParam, "Genetic Operators" );
+    double bitFlipRate =  bitFlipRateParam.value();
+
+    eoValueParam oneBitRateParam(0.01, "oneBitRate", "Relative rate for deterministic bit-flip mutation", 'D');
+    parser.processParam( oneBitRateParam, "Genetic Operators" );
+    double oneBitRate = oneBitRateParam.value();
+
+    // the name of the "status" file where all actual parameter values will be saved
+    string str_status = parser.ProgramName() + ".status"; // default value
+    eoValueParam statusParam(str_status.c_str(), "status","Status file",'S');
+    parser.processParam( statusParam, "Persistence" );
+
+   // do the following AFTER ALL PARAMETERS HAVE BEEN PROCESSED
+   // i.e. in case you need parameters somewhere else, postpone these
+    if (parser.userNeedsHelp())
+      {
+        parser.printHelp(cout);
+        exit(1);
+      }
+    if (statusParam.value() != "")
+      {
+	ofstream os(statusParam.value().c_str());
+	os << parser;		// and you can use that file as parameter file
+      }
+
+// EVAL
+  /////////////////////////////
+  // Fitness function
+  ////////////////////////////
+  // Evaluation: from a plain C++ fn to an EvalFunc Object ...
+  eoEvalFuncPtr& > plainEval( binary_value );
+  // ... to an object that counts the nb of actual evaluations
+  eoEvalFuncCounter eval(plainEval);
+
+// INIT
+  ////////////////////////////////
+  // Initilisation of population
+  ////////////////////////////////
+  // Either load or initialize
+  // create an empty pop
+  eoPop pop;
+  // create a state for reading
+  eoState inState;		// a state for loading - WITHOUT the parser
+  // register the rng and the pop in the state, so they can be loaded,
+  // and the present run will be the exact conitnuation of the saved run
+  // eventually with different parameters
+  inState.registerObject(rng);
+  inState.registerObject(pop);
+
+  if (loadName != "")
+    {
+      inState.load(loadName); //  load the pop and the rng
+      // the fitness is read in the file:
+      // do only evaluate the pop if the fitness has changed
+    }
+  else
+    {
+      rng.reseed(seed);
+      // a Indi random initializer
+      // based on boolean_generator class (see utils/rnd_generator.h)
+      eoUniformGenerator uGen;
+      eoInitFixedLength random(vecSize, uGen);
+
+      // Init pop from the randomizer: need to use the append function
+      pop.append(popSize, random);
+      // and evaluate pop (STL syntax)
+      apply(eval, pop);
+    } // end of initializatio of the population
+
+// OUTPUT
+  // sort pop for pretty printout
+  //   pop.sort();
+  // Print (sorted) intial population (raw printout)
+  cout << "Initial Population" << endl << pop ;
+  cout << "and best is " << pop.best_element() << "\n\n";
+  cout << "and worse is " << pop.worse_element() << "\n\n";
+// ENGINE
+  /////////////////////////////////////
+  // selection and replacement
+  ////////////////////////////////////
+// SELECT
+  // The robust tournament selection
+  eoDetTournamentSelect selectOne(tSize);       // tSize in [2,POPSIZE]
+  // is now encapsulated in a eoSelectPerc (entage)
+  eoSelectPerc select(selectOne);// by default rate==1
+
+// REPLACE
+  // And we now have the full slection/replacement - though with
+  // generational replacement at the moment :-)
+  eoGenerationalReplacement replace;
+  // want to add (weak) elitism? easy!
+  // rename the eoGenerationalReplacement replace_main,
+  // then encapsulate it in the elitist replacement
+  //  eoWeakElitistReplacement replace(replace_main);
+
+// OPERATORS
+  //////////////////////////////////////
+  // The variation operators
+  //////////////////////////////////////
+// CROSSOVER
+  // 1-point crossover for bitstring
+  eo1PtBitXover xover1;
+  // uniform crossover for bitstring
+  eoUBitXover xoverU;
+  // 2-pots xover
+  eoNPtsBitXover xover2(2);
+  // Combine them with relative rates
+  eoPropCombinedQuadOp xover(xover1, onePointRate);
+  xover.add(xoverU, URate);
+  xover.add(xover2, twoPointsRate, true);
+
+// MUTATION
+  // standard bit-flip mutation for bitstring
+  eoBitMutation  mutationBitFlip(pMutPerBit);
+  // mutate exactly 1 bit per individual
+  eoDetBitFlip mutationOneBit;
+  // Combine them with relative rates
+  eoPropCombinedMonOp mutation(mutationBitFlip, bitFlipRate);
+  mutation.add(mutationOneBit, oneBitRate, true);
+
+  // The operators are  encapsulated into an eoTRansform object
+  eoSGATransform transform(xover, pCross, mutation, pMut);
+
+// STOP
+  //////////////////////////////////////
+  // termination condition see FirstBitEA.cpp
+  /////////////////////////////////////
+  eoGenContinue genCont(maxGen);
+  eoSteadyFitContinue steadyCont(minGen, steadyGen);
+  // eoFitContinue fitCont(vecSize);   // remove if minimizing :-)
+  eoCombinedContinue continuator(genCont);
+  continuator.add(steadyCont);
+  //  continuator.add(fitCont);
+  // Ctrl C signal handling: don't know if that works in MSC ...
+#ifndef _MSC_VER
+  eoCtrlCContinue ctrlC;
+  continuator.add(ctrlC);
+#endif
+
+// CHECKPOINT
+  // but now you want to make many different things every generation
+  // (e.g. statistics, plots, ...).
+  // the class eoCheckPoint is dedicated to just that:
+
+  // Declare a checkpoint (from a continuator: an eoCheckPoint
+  // IS AN eoContinue and will be called in the loop of all algorithms)
+  eoCheckPoint checkpoint(continuator);
+
+    // Create a counter parameter
+    eoValueParam generationCounter(0, "Gen.");
+
+    // Create an incrementor (sub-class of eoUpdater). Note that the
+    // parameter's value is passed by reference,
+    // so every time the incrementer is updated (every generation),
+    // the data in generationCounter will change.
+    eoIncrementor increment(generationCounter.value());
+
+    // Add it to the checkpoint,
+    // so the counter is updated (here, incremented) every generation
+    checkpoint.add(increment);
+
+    // now some statistics on the population:
+    // Best fitness in population
+    eoBestFitnessStat bestStat;
+    eoAverageStat averageStat;
+    // Second moment stats: average and stdev
+    eoSecondMomentStats SecondStat;
+    // the Fitness Distance Correlation
+    // need first an object to compute the distances
+    eoQuadDistance dist;	// Hamming distance
+    eoFDCStat fdcStat(dist);
+
+    // Add them to the checkpoint to get them called at the appropriate time
+    checkpoint.add(bestStat);
+    checkpoint.add(averageStat);
+    checkpoint.add(SecondStat);
+    checkpoint.add(fdcStat);
+
+    // The Stdout monitor will print parameters to the screen ...
+    eoStdoutMonitor monitor(false);
+
+    // when called by the checkpoint (i.e. at every generation)
+    checkpoint.add(monitor);
+
+    // the monitor will output a series of parameters: add them
+    monitor.add(generationCounter);
+    monitor.add(eval);		// because now eval is an eoEvalFuncCounter!
+    monitor.add(bestStat);
+    monitor.add(SecondStat);
+    monitor.add(fdcStat);
+
+    // test de eoPopStat and/or eoSortedPopStat.
+    // Dumps the whole pop every 10 gen.
+    //    eoSortedPopStat popStat(10, "Dump of whole population");
+//     eoPopStat popStat(10, "Dump of whole population");
+//     checkpoint.add(popStat);
+//     monitor.add(popStat);
+
+    // A file monitor: will print parameters to ... a File, yes, you got it!
+    eoFileMonitor fileMonitor("stats.xg", " ");
+
+    // the checkpoint mechanism can handle monitors
+    checkpoint.add(fileMonitor);
+
+    // the fileMonitor can monitor parameters, too, but you must tell it!
+    fileMonitor.add(generationCounter);
+    fileMonitor.add(bestStat);
+    fileMonitor.add(SecondStat);
+
+#ifndef _MSC_VER
+    // and an eoGnuplot1DMonitor will 1-print to a file, and 2- plot on screen
+    eoGnuplot1DMonitor gnuMonitor("best_average.xg",minimizing_fitness());
+    // the checkpoint mechanism can handle multiple monitors
+    checkpoint.add(gnuMonitor);
+    // the gnuMonitor can monitor parameters, too, but you must tell it!
+    gnuMonitor.add(eval);
+    gnuMonitor.add(bestStat);
+    gnuMonitor.add(averageStat);
+
+    // send a scaling command to gnuplot
+    gnuMonitor.gnuplotCommand("set yrange [0:500]");
+
+    // a specific plot monitor for FDC
+    // first into a file (it adds everything ti itself
+    eoFDCFileSnapshot fdcFileSnapshot(fdcStat);
+    // then to a Gnuplot monitor
+    eoGnuplot1DSnapshot fdcGnuplot(fdcFileSnapshot);
+    // and of coruse add them to the checkPoint
+    checkpoint.add(fdcFileSnapshot);
+    checkpoint.add(fdcGnuplot);
+
+    // want to see how the fitness is spread?
+    eoScalarFitnessStat fitStat;
+    checkpoint.add(fitStat);
+    // a gnuplot-based monitor for snapshots: needs a dir name
+    // where to store the files
+    eoGnuplot1DSnapshot fitSnapshot("Fitnesses");
+    // add any stat that is a vector to it
+    fitSnapshot.add(fitStat);
+    // and of course add it to the checkpoint
+    checkpoint.add(fitSnapshot);
+#endif
+    // Last type of item the eoCheckpoint can handle: state savers:
+    eoState outState;
+    // Register the algorithm into the state (so it has something to save!!)
+    outState.registerObject(rng);
+    outState.registerObject(pop);
+
+    // and feed the state to state savers
+    // save state every 100th  generation
+    eoCountedStateSaver stateSaver1(100, outState, "generation");
+    // save state every 1 seconds
+    eoTimedStateSaver   stateSaver2(1, outState, "time");
+
+    // Don't forget to add the two savers to the checkpoint
+    checkpoint.add(stateSaver1);
+    checkpoint.add(stateSaver2);
+    // and that's it for the (control and) output
+
+// GENERATION
+  /////////////////////////////////////////
+  // the algorithm
+  ////////////////////////////////////////
+
+  // Easy EA requires
+  // selection, transformation, eval, replacement, and stopping criterion
+  eoEasyEA gga(checkpoint, eval, select, transform, replace);
+
+  // Apply algo to pop - that's it!
+  gga(pop);
+
+// OUTPUT
+  // Print (sorted) intial population
+  pop.sort();
+  cout << "FINAL Population\n" << pop << endl;
+// GENERAL
+}
+
+// A main that catches the exceptions
+int main(int argc, char **argv)
+{
+    try
+    {
+        main_function(argc, argv);
+    }
+    catch(exception& e)
+    {
+        cout << "Exception: " << e.what() << '\n';
+    }
+
+    return 1;
+}
diff --git a/trunk/paradiseo-eo/tutorial/Lesson3/real_value.h b/trunk/paradiseo-eo/tutorial/Lesson3/real_value.h
new file mode 100644
index 000000000..7fe002b63
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson3/real_value.h
@@ -0,0 +1,20 @@
+#include 
+//-----------------------------------------------------------------------------
+/** Just a simple function that takes an vector and sets the fitnes 
+    to the sphere function. Please use doubles not float!!!
+    @param _ind A floatingpoint vector 
+*/
+
+// INIT
+double real_value(const std::vector& _ind)
+{
+  double sum = 0;
+  for (unsigned i = 0; i < _ind.size(); i++)
+      {
+	  sum += _ind[i] * _ind[i];
+      }
+  return sum;
+}
+
+
+
diff --git a/trunk/paradiseo-eo/tutorial/Lesson4/.cvsignore b/trunk/paradiseo-eo/tutorial/Lesson4/.cvsignore
new file mode 100644
index 000000000..70845e08e
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson4/.cvsignore
@@ -0,0 +1 @@
+Makefile.in
diff --git a/trunk/paradiseo-eo/tutorial/Lesson4/BitEA.cpp b/trunk/paradiseo-eo/tutorial/Lesson4/BitEA.cpp
new file mode 100644
index 000000000..fd6f1fbda
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson4/BitEA.cpp
@@ -0,0 +1,95 @@
+#include 
+
+#include 
+#include 
+
+// EVAL
+#include "binary_value.h"
+
+// GENERAL
+using namespace std;
+
+int main(int argc, char* argv[])
+{     
+
+  try
+  {
+// REPRESENTATION
+//-----------------------------------------------------------------------------
+// define your genotype and fitness types
+  typedef eoBit EOT;
+
+// PARAMETRES
+  eoParser parser(argc, argv);  // for user-parameter reading
+
+// GENERAL
+  eoState state;    // keeps all things allocated
+
+  ///// FIRST, problem or representation dependent stuff
+  //////////////////////////////////////////////////////
+
+// EVAL
+  // The evaluation fn - encapsulated into an eval counter for output 
+  eoEvalFuncPtr mainEval( binary_value );
+  eoEvalFuncCounter eval(mainEval);
+
+// REPRESENTATION
+  // the genotype - through a genotype initializer
+  eoInit& init = make_genotype(parser, state, EOT());
+
+  // if you want to do sharing, you'll need a distance.
+  // here Hamming distance 
+  eoHammingDistance dist;
+
+// OPERATORS
+  // Build the variation operator (any seq/prop construct)
+  eoGenOp& op = make_op(parser, state, init);
+
+// GENERAL
+  //// Now the representation-independent things
+  //////////////////////////////////////////////
+
+  // initialize the population - and evaluate
+  // yes, this is representation indepedent once you have an eoInit
+  eoPop& pop   = make_pop(parser, state, init);
+
+// STOP
+  // stopping criteria
+  eoContinue & term = make_continue(parser, state, eval);
+  // output
+  eoCheckPoint & checkpoint = make_checkpoint(parser, state, eval, term);
+// GENERATION
+  // algorithm (need the operator!)
+  eoAlgo& ga = make_algo_scalar(parser, state, eval, checkpoint, op, &dist);
+
+  ///// End of construction of the algorith
+  /////////////////////////////////////////
+// PARAMETRES
+  // to be called AFTER all parameters have been read!!!
+  make_help(parser);
+
+  //// GO
+  ///////
+// EVAL
+  // evaluate intial population AFTER help and status in case it takes time
+  apply(eval, pop);
+// STOP
+  // print it out (sort witout modifying) 
+  cout << "Initial Population\n";
+  pop.sortedPrintOn(cout);
+  cout << endl;
+
+// GENERATION
+  run_ea(ga, pop); // run the ga
+// STOP
+  // print it out (sort witout modifying) 
+  cout << "Final Population\n";
+  pop.sortedPrintOn(cout);
+  cout << endl;
+// GENERAL
+  }
+  catch(exception& e)
+  {
+    cout << e.what() << endl;
+  }
+}
diff --git a/trunk/paradiseo-eo/tutorial/Lesson4/CVS/Entries b/trunk/paradiseo-eo/tutorial/Lesson4/CVS/Entries
new file mode 100644
index 000000000..75441eb91
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson4/CVS/Entries
@@ -0,0 +1,11 @@
+/.cvsignore/1.1/Fri Sep 17 16:53:13 2004//
+/BitEA.cpp/1.4/Tue May 25 08:03:30 2004//
+/ESEA.cpp/1.4/Thu Jan 17 17:51:58 2002//
+/ESEA.param/1.1/Mon Dec 27 07:59:58 2004//
+/Makefile.am/1.4/Wed Sep 28 21:49:25 2005//
+/Makefile.simple/1.1/Fri Sep 17 15:20:18 2004//
+/RealEA.cpp/1.2/Thu Jan 17 17:51:58 2002//
+/RealEA.param/1.1/Mon Dec 27 07:59:58 2004//
+/binary_value.h/1.3/Tue May 25 08:03:30 2004//
+/real_value.h/1.1/Thu May  3 13:06:34 2001//
+D
diff --git a/trunk/paradiseo-eo/tutorial/Lesson4/CVS/Repository b/trunk/paradiseo-eo/tutorial/Lesson4/CVS/Repository
new file mode 100644
index 000000000..1e57ae6eb
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson4/CVS/Repository
@@ -0,0 +1 @@
+eo/tutorial/Lesson4
diff --git a/trunk/paradiseo-eo/tutorial/Lesson4/CVS/Root b/trunk/paradiseo-eo/tutorial/Lesson4/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson4/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/tutorial/Lesson4/ESEA.cpp b/trunk/paradiseo-eo/tutorial/Lesson4/ESEA.cpp
new file mode 100644
index 000000000..1c1bd30cf
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson4/ESEA.cpp
@@ -0,0 +1,137 @@
+// Program to test several EO-ES features
+
+#ifdef _MSC_VER
+#pragma warning(disable:4786)
+#endif
+
+#include 
+#include 
+#include 
+#include 
+#include 
+#include 
+
+using namespace std;
+
+#include 
+
+// representation specific
+#include 
+
+#include "real_value.h"		// the sphere fitness
+
+// Now the main 
+/////////////// 
+typedef eoMinimizingFitness  FitT;
+
+template 
+void runAlgorithm(EOT, eoParser& _parser, eoState& _state);
+  
+int main_function(int argc, char *argv[]) 
+{
+  // Create the command-line parser
+  eoParser parser(argc, argv);  // for user-parameter reading
+
+  eoState state;    // keeps all things allocated
+
+
+  eoValueParam& simpleParam = parser.createParam(true, "Isotropic", "Isotropic self-adaptive mutation", 'i', "ES mutation");
+  eoValueParam& stdevsParam = parser.createParam(false, "Stdev", "One self-adaptive stDev per variable", 's', "ES mutation");
+  eoValueParam& corrParam = parser.createParam(false, "Correl", "Use correlated mutations", 'c', "ES mutation");
+
+    // Run the appropriate algorithm
+    if (simpleParam.value() == false)
+    {
+      cout << "Using eoReal" << endl;
+      runAlgorithm(eoReal(), parser, state);
+    }
+    else if (stdevsParam.value() == false)
+    {
+      cout << "Using eoEsSimple" << endl;
+      runAlgorithm(eoEsSimple(), parser, state);
+    }
+    else if (corrParam.value() == false)
+    {
+      cout << "Using eoEsStdev" << endl;
+      runAlgorithm(eoEsStdev(), parser, state);
+    }
+    else 
+    {
+      cout << "Using eoEsFull" << endl;
+      runAlgorithm(eoEsFull(), parser, state);
+    }
+
+	return 0;  
+}
+
+// A main that catches the exceptions
+ 
+int main(int argc, char **argv)
+{
+    try
+    {
+        main_function(argc, argv);
+    }
+    catch(exception& e)
+    {
+        cout << "Exception: " << e.what() << '\n';
+    }
+ 
+    return 1;
+}
+
+/** The templatized main (sort of)
+ *  quite similar to the main of other genotypes 
+ *  (e.g. t-eoReal and t-eoGA in test dir)
+ */
+template 
+void runAlgorithm(EOT, eoParser& _parser, eoState& _state)
+{
+  typedef typename EOT::Fitness FitT;
+
+  ///// FIRST, problem or representation dependent stuff
+  //////////////////////////////////////////////////////
+
+  // The evaluation fn - encapsulated into an eval counter for output 
+  eoEvalFuncPtr&> 
+               mainEval( real_value );
+  eoEvalFuncCounter eval(mainEval);
+
+  // the genotype - through a genotype initializer
+  eoRealInitBounded& init = make_genotype(_parser, _state, EOT());
+
+  // Build the variation operator (any seq/prop construct)
+  eoGenOp& op = make_op(_parser, _state, init);
+
+  //// Now the representation-independent things
+  //////////////////////////////////////////////
+
+  // initialize the population - and evaluate
+  // yes, this is representation indepedent once you have an eoInit
+  eoPop& pop   = make_pop(_parser, _state, init);
+  apply(eval, pop);
+
+  // stopping criteria
+  eoContinue & term = make_continue(_parser, _state, eval);
+  // output
+  eoCheckPoint & checkpoint = make_checkpoint(_parser, _state, eval, term);
+  // algorithm (need the operator!)
+  eoAlgo& ga = make_algo_scalar(_parser, _state, eval, checkpoint, op);
+
+  ///// End of construction of the algorith
+  /////////////////////////////////////////
+  // to be called AFTER all parameters have been read!!!
+  make_help(_parser);
+
+  //// GO
+  ///////
+  cout << "Initial Population\n";
+  pop.sortedPrintOn(cout);
+  cout << endl;
+
+  run_ea(ga, pop); // run the ga
+
+  cout << "Final Population\n";
+  pop.sortedPrintOn(cout);
+  cout << endl;
+}
diff --git a/trunk/paradiseo-eo/tutorial/Lesson4/ESEA.param b/trunk/paradiseo-eo/tutorial/Lesson4/ESEA.param
new file mode 100644
index 000000000..06df5c738
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson4/ESEA.param
@@ -0,0 +1,62 @@
+
+######                 General    ######
+# --help=0                                 # -h : Prints this message
+# --stopOnUnknownParam=1                   # Stop if unkown param entered
+# --seed=1104133126                        # -S : Random number seed
+
+######    ES mutation             ######
+# --Isotropic=1                            # -i : Isotropic self-adaptive mutation
+# --Stdev=0                                # -s : One self-adaptive stDev per variable
+# --Correl=0                               # -c : Use correlated mutations
+
+######    Evolution Engine        ######
+--popSize=1                             # -P : Population Size
+--selection=Sequential                   # -S : Selection: DetTour(T), StochTour(t), Roulette, Ranking(p,e) or Sequential(ordered/unordered)
+--nbOffspring=700%                       # -O : Nb of offspring (percentage or absolute)
+--replacement=Comma                      # -R : Replacement: Comma, Plus or EPTour(T), SSGAWorst, SSGADet(T), SSGAStoch(t)
+--weakElitism=0                          # -w : Old best parent replaces new worst offspring *if necessary*
+
+######    Genotype Initialization    ######
+# --vecSize=10                             # -n : The number of variables 
+# --initBounds=10[-1,1]                    # -B : Bounds for initialization (MUST be bounded)
+--sigmaInit=0.3%                          # -s : Initial value for Sigmas (with a '%' -> scaled by the range of each variable)
+
+######    Output                  ######
+# --useEval=1                              # Use nb of eval. as counter (vs nb of gen.)
+# --useTime=1                              # Display time (s) every generation
+# --printBestStat=1                        # Print Best/avg/stdev every gen.
+# --printPop=0                             # Print sorted pop. every gen.
+
+######    Output - Disk           ######
+# --resDir=Res                             # Directory to store DISK outputs
+# --eraseDir=1                             # erase files in dirName if any
+# --fileBestStat=0                         # Output bes/avg/std to file
+
+######    Output - Graphical      ######
+# --plotBestStat=0                         # Plot Best/avg Stat
+# --plotHisto=0                            # Plot histogram of fitnesses
+
+######    Persistence             ######
+# --Load=                                  # -L : A save file to restart from
+# --recomputeFitness=0                     # -r : Recompute the fitness after re-loading the pop.?
+# --saveFrequency=0                        # Save every F generation (0 = only final state, absent = never)
+# --saveTimeInterval=0                     # Save every T seconds (0 or absent = never)
+# --status=t-eoESAll.status                # Status file
+
+######    Stopping criterion      ######
+# --maxGen=100                             # -G : Maximum number of generations () = none)
+# --steadyGen=100                          # -s : Number of generations with no improvement
+# --minGen=0                               # -g : Minimum number of generations
+# --maxEval=0                              # -E : Maximum number of evaluations (0 = none)
+# --targetFitness=0                        # -T : Stop when fitness reaches
+# --CtrlC=0                                # -C : Terminate current generation upon Ctrl C
+
+######    Variation Operators     ######
+# --objectBounds=10[-inf,+inf]             # -B : Bounds for variables
+# --operator=SGA                           # -o : Description of the operator (SGA only now)
+# --pCross=1                               # -C : Probability of Crossover
+# --pMut=1                                 # -M : Probability of Mutation
+# --crossType=global                       # -C : Type of ES recombination (global or standard)
+# --crossObj=discrete                      # -O : Recombination of object variables (discrete, intermediate or none)
+# --crossStdev=intermediate                # -S : Recombination of mutation strategy parameters (intermediate, discrete or none)
+# --TauLoc=1                               # -l : Local Tau (before normalization)
diff --git a/trunk/paradiseo-eo/tutorial/Lesson4/Makefile.am b/trunk/paradiseo-eo/tutorial/Lesson4/Makefile.am
new file mode 100644
index 000000000..7b1c2dcce
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson4/Makefile.am
@@ -0,0 +1,26 @@
+noinst_PROGRAMS		= BitEA RealEA ESEA
+
+
+BitEA_SOURCES		= BitEA.cpp
+
+RealEA_SOURCES		= RealEA.cpp
+
+ESEA_SOURCES		= ESEA.cpp
+
+
+noinst_HEADERS		= binary_value.h \
+			real_value.h
+
+extra_DIST		= Makefile.simple
+
+
+AM_CXXFLAGS		= -I$(top_srcdir)/src
+
+LIBEO			= $(top_builddir)/src/libeo.a
+LIBES			= $(top_builddir)/src/es/libes.a
+LIBGA			= $(top_builddir)/src/ga/libga.a
+LIBUTILS		= $(top_builddir)/src/utils/libeoutils.a
+
+DEPS			= $(LIBEO) $(LIBUTILS) $(LIBES) $(LIBGA)
+
+LIBS			= $(LIBES) $(LIBGA) $(LIBEO) $(LIBUTILS)
diff --git a/trunk/paradiseo-eo/tutorial/Lesson4/Makefile.simple b/trunk/paradiseo-eo/tutorial/Lesson4/Makefile.simple
new file mode 100644
index 000000000..75bd41dd4
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson4/Makefile.simple
@@ -0,0 +1,33 @@
+### This Makefile is part of the tutorial of the EO library
+# Unlike other Makefiles in EO, it is not using the automake/autoconf 
+# so that it stays easy to understant (you are in the tutorial, remember!)
+# MS, Oct. 2002
+
+# if you use this Makefile as a starting point for another application
+# you might need to modify the following
+DIR_EO = ../../src
+
+.SUFFIXES: .cpp
+
+# Warning: $(CXX) in Linux (RedHat and Mandrake at least) is g++
+# However, if you are using this Makefile within xemacs, 
+# and have problems with the interpretation of the output (and its colors)
+# then you should use c++ instead (make CXX=c++ will do)
+
+.cpp: ; $(CXX)  -DPACKAGE=\"eo\" -DVERSION=\"0.9.3\" -I. -I$(DIR_EO) -Wall -g -o $@  $*.cpp $(DIR_EO)/utils/libeoutils.a $(DIR_EO)/libeo.a 
+
+.cpp.o: ; $(CXX) -DPACKAGE=\"eo\" -DVERSION=\"0.9.3\" -I. -I$(DIR_EO) -Wall -g -c $*.cpp
+
+ALL = BitEA RealEA ESEA
+
+all : $(ALL)
+
+BitEA : BitEA.o ; 
+	$(CXX)  -DPACKAGE=\"eo\" -DVERSION=\"0.9.2\" -Wall -g  -o $@  $<  $(DIR_EO)/ga/libga.a $(DIR_EO)/utils/libeoutils.a $(DIR_EO)/libeo.a 
+
+RealEA : RealEA.o ; $(CXX)  -DPACKAGE=\"eo\" -DVERSION=\"0.9.2\" -Wall -g  -o $@  $< $(DIR_EO)/es/libes.a $(DIR_EO)/utils/libeoutils.a $(DIR_EO)/libeo.a
+
+ESEA : ESEA.o ; $(CXX)  -DPACKAGE=\"eo\" -DVERSION=\"0.9.2\" -Wall -g  -o $@  $< $(DIR_EO)/es/libes.a $(DIR_EO)/utils/libeoutils.a $(DIR_EO)/libeo.a
+
+clean : 
+	@/bin/rm $(ALL) *.o *.sav *.xg *.status *~
diff --git a/trunk/paradiseo-eo/tutorial/Lesson4/RealEA.cpp b/trunk/paradiseo-eo/tutorial/Lesson4/RealEA.cpp
new file mode 100644
index 000000000..8002136c0
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson4/RealEA.cpp
@@ -0,0 +1,72 @@
+#include 
+
+#include 
+#include "real_value.h"
+#include 
+
+using namespace std;
+
+int main(int argc, char* argv[])
+{
+
+  try
+  {
+  typedef eoReal EOT;
+
+  eoParser parser(argc, argv);  // for user-parameter reading
+
+  eoState state;    // keeps all things allocated
+
+  ///// FIRST, problem or representation dependent stuff
+  //////////////////////////////////////////////////////
+
+  // The evaluation fn - encapsulated into an eval counter for output 
+  eoEvalFuncPtr&> 
+               mainEval( real_value );
+  eoEvalFuncCounter eval(mainEval);
+
+  // the genotype - through a genotype initializer
+  eoRealInitBounded& init = make_genotype(parser, state, EOT());
+
+  // Build the variation operator (any seq/prop construct)
+  eoGenOp& op = make_op(parser, state, init);
+
+  //// Now the representation-independent things
+  //////////////////////////////////////////////
+
+  // initialize the population - and evaluate
+  // yes, this is representation indepedent once you have an eoInit
+  eoPop& pop   = make_pop(parser, state, init);
+
+  // stopping criteria
+  eoContinue & term = make_continue(parser, state, eval);
+  // output
+  eoCheckPoint & checkpoint = make_checkpoint(parser, state, eval, term);
+  // algorithm (need the operator!)
+  eoAlgo& ea = make_algo_scalar(parser, state, eval, checkpoint, op);
+
+  ///// End of construction of the algorith
+  /////////////////////////////////////////
+  // to be called AFTER all parameters have been read!!!
+  make_help(parser);
+
+  //// GO
+  ///////
+  // evaluate intial population AFTER help and status in case it takes time
+  apply(eval, pop);
+  // print it out
+  cout << "Initial Population\n";
+  pop.sortedPrintOn(cout);
+  cout << endl;
+
+  run_ea(ea, pop); // run the ea
+
+  cout << "Final Population\n";
+  pop.sortedPrintOn(cout);
+  cout << endl;
+  }
+  catch(exception& e)
+  {
+    cout << e.what() << endl;
+  }
+}
diff --git a/trunk/paradiseo-eo/tutorial/Lesson4/RealEA.param b/trunk/paradiseo-eo/tutorial/Lesson4/RealEA.param
new file mode 100644
index 000000000..dba2db343
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson4/RealEA.param
@@ -0,0 +1,57 @@
+
+######                 General    ######
+# --help=0                                 # -h : Prints this message
+# --stopOnUnknownParam=1                   # Stop if unkown param entered
+# --seed=1104133126                        # -S : Random number seed
+
+######    Evolution Engine        ######
+--popSize=10                             # -P : Population Size
+--selection=Sequential                   # -S : Selection: DetTour(T), StochTour(t), Roulette, Ranking(p,e) or Sequential(ordered/unordered)
+--nbOffspring=700%                       # -O : Nb of offspring (percentage or absolute)
+--replacement=Plus                      # -R : Replacement: Comma, Plus or EPTour(T), SSGAWorst, SSGADet(T), SSGAStoch(t)
+--weakElitism=0                          # -w : Old best parent replaces new worst offspring *if necessary*
+
+######    Genotype Initialization    ######
+# --vecSize=10                             # -n : The number of variables 
+# --initBounds=10[-1,1]                    # -B : Bounds for initialization (MUST be bounded)
+--sigmaInit=0.3%                          # -s : Initial value for Sigmas (with a '%' -> scaled by the range of each variable)
+
+######    Output                  ######
+# --useEval=1                              # Use nb of eval. as counter (vs nb of gen.)
+# --useTime=1                              # Display time (s) every generation
+# --printBestStat=1                        # Print Best/avg/stdev every gen.
+# --printPop=0                             # Print sorted pop. every gen.
+
+######    Output - Disk           ######
+# --resDir=Res                             # Directory to store DISK outputs
+# --eraseDir=1                             # erase files in dirName if any
+# --fileBestStat=0                         # Output bes/avg/std to file
+
+######    Output - Graphical      ######
+# --plotBestStat=0                         # Plot Best/avg Stat
+# --plotHisto=0                            # Plot histogram of fitnesses
+
+######    Persistence             ######
+# --Load=                                  # -L : A save file to restart from
+# --recomputeFitness=0                     # -r : Recompute the fitness after re-loading the pop.?
+# --saveFrequency=0                        # Save every F generation (0 = only final state, absent = never)
+# --saveTimeInterval=0                     # Save every T seconds (0 or absent = never)
+# --status=t-eoESAll.status                # Status file
+
+######    Stopping criterion      ######
+# --maxGen=100                             # -G : Maximum number of generations () = none)
+# --steadyGen=100                          # -s : Number of generations with no improvement
+# --minGen=0                               # -g : Minimum number of generations
+# --maxEval=0                              # -E : Maximum number of evaluations (0 = none)
+# --targetFitness=0                        # -T : Stop when fitness reaches
+# --CtrlC=0                                # -C : Terminate current generation upon Ctrl C
+
+######    Variation Operators     ######
+# --objectBounds=10[-inf,+inf]             # -B : Bounds for variables
+# --operator=SGA                           # -o : Description of the operator (SGA only now)
+# --pCross=1                               # -C : Probability of Crossover
+# --pMut=1                                 # -M : Probability of Mutation
+# --crossType=global                       # -C : Type of ES recombination (global or standard)
+# --crossObj=discrete                      # -O : Recombination of object variables (discrete, intermediate or none)
+# --crossStdev=intermediate                # -S : Recombination of mutation strategy parameters (intermediate, discrete or none)
+# --TauLoc=1                               # -l : Local Tau (before normalization)
diff --git a/trunk/paradiseo-eo/tutorial/Lesson4/binary_value.h b/trunk/paradiseo-eo/tutorial/Lesson4/binary_value.h
new file mode 100644
index 000000000..188835fca
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson4/binary_value.h
@@ -0,0 +1,25 @@
+#include 
+
+//-----------------------------------------------------------------------------
+
+/** Just a simple function that takes binary value of a chromosome and sets
+    the fitnes.
+    @param _chrom A binary chromosome 
+*/
+
+template  double binary_value(const Chrom& _chrom)
+{
+  double sum = 0;
+  for (unsigned i = 0; i < _chrom.size(); i++)
+    if (_chrom[i])
+	sum += _chrom[i];
+  return sum;
+}
+
+struct BinaryValue
+{
+  template  void operator()(Chrom& _chrom)
+  {
+    _chrom.fitness(binary_value(_chrom));
+  }
+};
diff --git a/trunk/paradiseo-eo/tutorial/Lesson4/real_value.h b/trunk/paradiseo-eo/tutorial/Lesson4/real_value.h
new file mode 100644
index 000000000..8f3a0df59
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson4/real_value.h
@@ -0,0 +1,19 @@
+#include 
+//-----------------------------------------------------------------------------
+
+
+/** Just a simple function that takes an eoEsBase and sets the fitnes 
+    to sphere 
+    @param _ind  vector
+*/
+
+double real_value(const std::vector& _ind)
+{
+  double sum = 0;
+  for (unsigned i = 0; i < _ind.size(); i++)
+      sum += _ind[i] * _ind[i];
+  return sqrt(sum);
+}
+
+
+
diff --git a/trunk/paradiseo-eo/tutorial/Lesson5/.cvsignore b/trunk/paradiseo-eo/tutorial/Lesson5/.cvsignore
new file mode 100644
index 000000000..70845e08e
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson5/.cvsignore
@@ -0,0 +1 @@
+Makefile.in
diff --git a/trunk/paradiseo-eo/tutorial/Lesson5/CVS/Entries b/trunk/paradiseo-eo/tutorial/Lesson5/CVS/Entries
new file mode 100644
index 000000000..cc1c584ae
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson5/CVS/Entries
@@ -0,0 +1,14 @@
+/.cvsignore/1.1/Fri Sep 17 16:53:10 2004//
+/Makefile.am/1.4/Wed Sep 28 21:49:25 2005//
+/Makefile.simple/1.1/Fri Sep 17 15:20:18 2004//
+/OneMaxEA.cpp/1.1/Wed May  8 06:44:04 2002//
+/OneMaxLibEA.cpp/1.1/Wed May  8 06:44:04 2002//
+/eoOneMax.h/1.1/Wed May  8 06:44:04 2002//
+/eoOneMaxEvalFunc.h/1.1/Wed May  8 06:44:04 2002//
+/eoOneMaxInit.h/1.1/Wed May  8 06:44:04 2002//
+/eoOneMaxMutation.h/1.3/Mon Oct  3 09:47:06 2005//
+/eoOneMaxQuadCrossover.h/1.2/Mon Oct  3 09:47:06 2005//
+/make_OneMax.cpp/1.1/Wed May  8 06:44:04 2002//
+/make_genotype_OneMax.h/1.1/Wed May  8 06:44:04 2002//
+/make_op_OneMax.h/1.1/Wed May  8 06:44:04 2002//
+D
diff --git a/trunk/paradiseo-eo/tutorial/Lesson5/CVS/Repository b/trunk/paradiseo-eo/tutorial/Lesson5/CVS/Repository
new file mode 100644
index 000000000..b734b7655
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson5/CVS/Repository
@@ -0,0 +1 @@
+eo/tutorial/Lesson5
diff --git a/trunk/paradiseo-eo/tutorial/Lesson5/CVS/Root b/trunk/paradiseo-eo/tutorial/Lesson5/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson5/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/tutorial/Lesson5/Makefile.am b/trunk/paradiseo-eo/tutorial/Lesson5/Makefile.am
new file mode 100644
index 000000000..110cfb087
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson5/Makefile.am
@@ -0,0 +1,28 @@
+
+noinst_PROGRAMS		= OneMaxEA OneMaxLibEA
+
+OneMaxEA_SOURCES	= OneMaxEA.cpp
+
+OneMaxLibEA_SOURCES	= OneMaxLibEA.cpp make_OneMax.cpp
+
+
+noinst_HEADERS		= eoOneMax.h \
+			eoOneMaxEvalFunc.h \
+			eoOneMaxInit.h \
+			eoOneMaxMutation.h \
+			eoOneMaxQuadCrossover.h \
+			make_genotype_OneMax.h \
+			make_op_OneMax.h
+
+extra_DIST		= Makefile.simple
+
+AM_CXXFLAGS		= -I$(top_srcdir)/src
+
+LIBEO			= $(top_builddir)/src/libeo.a
+LIBES			= $(top_builddir)/src/es/libes.a
+LIBGA			= $(top_builddir)/src/ga/libga.a
+LIBUTILS		= $(top_builddir)/src/utils/libeoutils.a
+
+DEPS			= $(LIBEO) $(LIBUTILS) $(LIBES) $(LIBGA)
+
+LIBS			= $(LIBES) $(LIBGA) $(LIBEO) $(LIBUTILS)
diff --git a/trunk/paradiseo-eo/tutorial/Lesson5/Makefile.simple b/trunk/paradiseo-eo/tutorial/Lesson5/Makefile.simple
new file mode 100644
index 000000000..bb865c104
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson5/Makefile.simple
@@ -0,0 +1,56 @@
+### This Makefile is part of the tutorial of the EO library
+# Unlike other Makefiles in EO, it is not using the automake/autoconf 
+# so that it stays easy to understant (you are in the tutorial, remember!)
+# MS, Oct. 2002
+
+# if you use this Makefile as a starting point for another application
+# you might need to modify the following
+DIR_EO = ../../src
+
+.SUFFIXES: .cpp
+
+# Warning: $(CXX) in Linux (RedHat and Mandrake at least) is g++
+# However, if you are using this Makefile within xemacs, 
+# and have problems with the interpretation of the output (and its colors)
+# then you should use c++ instead (make CXX=c++ will do)
+
+.cpp: ; $(CXX)  -DPACKAGE=\"eo\" -DVERSION=\"0.9.3\" -I. -I$(DIR_EO) -Wall -g -o $@  $*.cpp $(DIR_EO)/utils/libeoutils.a $(DIR_EO)/libeo.a 
+
+.cpp.o: ; $(CXX) -DPACKAGE=\"eo\" -DVERSION=\"0.9.3\" -I. -I$(DIR_EO) -Wall -g -c $*.cpp
+
+# local sources
+COMMON_SOURCES =    eoOneMax.h \
+   eoOneMaxEvalFunc.h \
+   eoOneMaxInit.h \
+   eoOneMaxMutation.h \
+   eoOneMaxQuadCrossover.h \
+   make_genotype_OneMax.h \
+   make_op_OneMax.h
+
+NO_LIB_SOURCES = OneMaxEA.cpp
+
+LIB_SOURCES = OneMaxLibEA.cpp make_OneMax.cpp
+
+
+SOURCES = $(COMMON_SOURCES) OneMaxEA.cpp OneMaxLibEA.cpp make_OneMax.cpp
+
+LIB_EO = $(DIR_EO)/utils/libeoutils.a $(DIR_EO)/libeo.a
+
+ALL = OneMaxEA OneMaxLibEA
+
+OneMaxEA : OneMaxEA.o
+	$(CXX) -g -o $@ OneMaxEA.o $(DIR_EO)/utils/libeoutils.a $(DIR_EO)/libeo.a -lm 
+
+OneMaxLibEA : OneMaxLibEA.o make_OneMax.o
+	$(CXX) -g -o $@ OneMaxLibEA.o make_OneMax.o $(DIR_EO)/utils/libeoutils.a $(DIR_EO)/libeo.a -lm
+
+tar : ; tar czvf OneMax.tgz *.h *.cpp Makefile
+
+all : $(ALL)
+
+clean : ; /bin/rm  *.o $(ALL)
+
+########## local dependencies
+OneMaxEA.o : $(COMMON_SOURCES) OneMaxEA.cpp
+OneMaxLibEA.o : $(COMMON_SOURCES) OneMaxLibEA.cpp
+make_OneMax.o : make_OneMax.cpp eoOneMax.h 
diff --git a/trunk/paradiseo-eo/tutorial/Lesson5/OneMaxEA.cpp b/trunk/paradiseo-eo/tutorial/Lesson5/OneMaxEA.cpp
new file mode 100644
index 000000000..1f3470f33
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson5/OneMaxEA.cpp
@@ -0,0 +1,188 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+The above line is usefulin Emacs-like editors
+ */
+
+/*
+Template for creating a new representation in EO
+================================================
+
+This is the template main file.
+It includes all other files that have been generated by the script create.sh
+so it is the only file to compile.
+
+In case you want to build up a separate library for your new Evolving Object,
+you'll need some work - follow what's done in the src/ga dir, used in the
+main file BitEA in tutorial/Lesson4 dir.
+Or you can wait until we do it :-)
+*/
+
+// Miscilaneous include and declaration 
+#include 
+using namespace std;
+
+// eo general include
+#include "eo"
+// the real bounds (not yet in general eo include)
+#include "utils/eoRealVectorBounds.h"
+
+// include here whatever specific files for your representation
+// Basically, this should include at least the following
+
+/** definition of representation: 
+ * class eoOneMax MUST derive from EO for some fitness
+ */
+#include "eoOneMax.h"
+
+/** definition of initilizqtion: 
+ * class eoOneMaxInit MUST derive from eoInit
+ */
+#include "eoOneMaxInit.h"
+
+/** definition of evaluation: 
+ * class eoOneMaxEvalFunc MUST derive from eoEvalFunc
+ * and should test for validity before doing any computation
+ * see tutorial/Templates/evalFunc.tmpl
+ */
+#include "eoOneMaxEvalFunc.h"
+
+// GENOTYPE   eoOneMax ***MUST*** be templatized over the fitness
+
+//*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
+// START fitness type: double or eoMaximizingFitness if you are maximizing
+//                     eoMinimizingFitness if you are minimizing
+typedef eoMaximizingFitness MyFitT ;	// type of fitness 
+// END fitness type
+//*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
+
+// Then define your EO objects using that fitness type
+typedef eoOneMax Indi;      // ***MUST*** derive from EO 
+
+// create an initializer
+#include "make_genotype_OneMax.h"
+eoInit & make_genotype(eoParser& _parser, eoState&_state, Indi _eo)
+{
+  return do_make_genotype(_parser, _state, _eo);
+} 
+
+// and the variation operaotrs
+#include "make_op_OneMax.h"
+eoGenOp&  make_op(eoParser& _parser, eoState& _state, eoInit& _init)
+{
+  return do_make_op(_parser, _state, _init);
+}
+
+// Use existing modules to define representation independent routines
+// These are parser-based definitions of objects
+
+// how to initialize the population 
+// it IS representation independent if an eoInit is given
+#include 
+eoPop&  make_pop(eoParser& _parser, eoState& _state, eoInit & _init)
+{
+  return do_make_pop(_parser, _state, _init);
+}
+
+// the stopping criterion
+#include 
+eoContinue& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter & _eval)
+{
+  return do_make_continue(_parser, _state, _eval);
+}
+
+// outputs (stats, population dumps, ...)
+#include 
+eoCheckPoint& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter& _eval, eoContinue& _continue) 
+{
+  return do_make_checkpoint(_parser, _state, _eval, _continue);
+}
+
+// evolution engine (selection and replacement)
+#include 
+eoAlgo&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc& _eval, eoContinue& _continue, eoGenOp& _op)
+{
+  return do_make_algo_scalar(_parser, _state, _eval, _continue, _op);
+}
+
+// simple call to the algo. stays there for consistency reasons 
+// no template for that one
+#include 
+// the instanciating fitnesses
+#include 
+void run_ea(eoAlgo& _ga, eoPop& _pop)
+{
+  do_run(_ga, _pop);
+}
+
+// checks for help demand, and writes the status file
+// and make_help; in libutils
+void make_help(eoParser & _parser);
+
+// now use all of the above, + representation dependent things
+int main(int argc, char* argv[])
+{
+
+  try
+  {
+  eoParser parser(argc, argv);  // for user-parameter reading
+
+  eoState state;    // keeps all things allocated
+
+    // The fitness
+    //////////////
+   eoOneMaxEvalFunc plainEval/* (varType  _anyVariable) */;
+   // turn that object into an evaluation counter
+   eoEvalFuncCounter eval(plainEval);
+
+  // the genotype - through a genotype initializer
+  eoInit& init = make_genotype(parser, state, Indi());
+
+  // Build the variation operator (any seq/prop construct)
+  eoGenOp& op = make_op(parser, state, init);
+
+
+  //// Now the representation-independent things 
+  //
+  // YOU SHOULD NOT NEED TO MODIFY ANYTHING BEYOND THIS POINT
+  // unless you want to add specific statistics to the checkpoint
+  //////////////////////////////////////////////
+
+  // initialize the population
+  // yes, this is representation indepedent once you have an eoInit
+  eoPop& pop   = make_pop(parser, state, init);
+
+  // stopping criteria
+  eoContinue & term = make_continue(parser, state, eval);
+  // output
+  eoCheckPoint & checkpoint = make_checkpoint(parser, state, eval, term);
+  // algorithm (need the operator!)
+  eoAlgo& ga = make_algo_scalar(parser, state, eval, checkpoint, op);
+
+  ///// End of construction of the algorithm
+
+  /////////////////////////////////////////
+  // to be called AFTER all parameters have been read!!!
+  make_help(parser);
+
+  //// GO
+  ///////
+  // evaluate intial population AFTER help and status in case it takes time
+  apply(eval, pop);
+  // if you want to print it out
+   cout << "Initial Population\n";
+   pop.sortedPrintOn(cout);
+   cout << endl;
+
+  run_ea(ga, pop); // run the ga
+
+  cout << "Final Population\n";
+  pop.sortedPrintOn(cout);
+  cout << endl;
+
+  }
+  catch(exception& e)
+  {
+    cout << e.what() << endl;
+  }
+  return 0;
+}
diff --git a/trunk/paradiseo-eo/tutorial/Lesson5/OneMaxLibEA.cpp b/trunk/paradiseo-eo/tutorial/Lesson5/OneMaxLibEA.cpp
new file mode 100644
index 000000000..42d25f923
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson5/OneMaxLibEA.cpp
@@ -0,0 +1,162 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+The above line is usefulin Emacs-like editors
+ */
+
+/*
+Template for creating a new representation in EO
+================================================
+
+This is the template main file for compiling after creating a
+library. 
+See make_OneMax.cpp file.
+*/
+
+// Miscilaneous include and declaration 
+#include 
+using namespace std;
+
+// eo general include
+#include "eo"
+// the real bounds (not yet in general eo include)
+#include "utils/eoRealVectorBounds.h"
+
+// include here whatever specific files for your representation
+// Basically, this should include at least the following
+
+/** definition of representation: 
+ * class eoOneMax MUST derive from EO for some fitness
+ */
+#include "eoOneMax.h"
+
+/** definition of initilizqtion: 
+ * class eoOneMaxInit MUST derive from eoInit
+ */
+#include "eoOneMaxInit.h"
+
+/** definition of evaluation: 
+ * class eoOneMaxEvalFunc MUST derive from eoEvalFunc
+ * and should test for validity before doing any computation
+ * see tutorial/Templates/evalFunc.tmpl
+ */
+#include "eoOneMaxEvalFunc.h"
+
+// GENOTYPE   eoOneMax ***MUST*** be templatized over the fitness
+
+//
+// START fitness type: double or eoMaximizingFitness if you are maximizing
+//                     eoMinimizingFitness if you are minimizing
+typedef eoMinimizingFitness MyFitT ;	// type of fitness 
+// END fitness type
+//
+
+// Then define your EO objects using that fitness type
+typedef eoOneMax Indi;      // ***MUST*** derive from EO 
+
+// create an initializer - done here and NOT in make_OneMax.cpp
+// because it is NOT representation independent
+#include "make_genotype_OneMax.h"
+eoInit & make_genotype(eoParser& _parser, eoState&_state, Indi _eo)
+{
+  return do_make_genotype(_parser, _state, _eo);
+} 
+
+// same thing for the variation operaotrs
+#include "make_op_OneMax.h"
+eoGenOp&  make_op(eoParser& _parser, eoState& _state, eoInit& _init)
+{
+  return do_make_op(_parser, _state, _init);
+}
+
+// The representation independent routines are simply declared here
+
+// how to initialize the population 
+// it IS representation independent if an eoInit is given
+eoPop&  make_pop(eoParser& _parser, eoState& _state, eoInit & _init);
+
+// the stopping criterion
+eoContinue& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter & _eval);
+
+// outputs (stats, population dumps, ...)
+eoCheckPoint& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter& _eval, eoContinue& _continue);
+
+// evolution engine (selection and replacement)
+eoAlgo&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc& _eval, eoContinue& _continue, eoGenOp& _op);
+
+// simple call to the algo. stays there for consistency reasons 
+// no template for that one
+void run_ea(eoAlgo& _ga, eoPop& _pop);
+
+// checks for help demand, and writes the status file
+// and make_help; in libutils - just a declaration, code in libeoutils.a
+void make_help(eoParser & _parser);
+
+// now use all of the above, + representation dependent things
+// from here on, no difference with eoOneMax.cpp
+int main(int argc, char* argv[])
+{
+
+  try
+  {
+  eoParser parser(argc, argv);  // for user-parameter reading
+
+  eoState state;    // keeps all things allocated
+
+    // The fitness
+    //////////////
+   eoOneMaxEvalFunc plainEval/* (varType  _anyVariable) */;
+   // turn that object into an evaluation counter
+   eoEvalFuncCounter eval(plainEval);
+
+  // the genotype - through a genotype initializer
+  eoInit& init = make_genotype(parser, state, Indi());
+
+  // Build the variation operator (any seq/prop construct)
+  eoGenOp& op = make_op(parser, state, init);
+
+
+  //// Now the representation-independent things 
+  //
+  // YOU SHOULD NOT NEED TO MODIFY ANYTHING BEYOND THIS POINT
+  // unless you want to add specific statistics to the checkpoint
+  //////////////////////////////////////////////
+
+  // initialize the population
+  // yes, this is representation indepedent once you have an eoInit
+  eoPop& pop   = make_pop(parser, state, init);
+
+  // stopping criteria
+  eoContinue & term = make_continue(parser, state, eval);
+  // output
+  eoCheckPoint & checkpoint = make_checkpoint(parser, state, eval, term);
+  // algorithm (need the operator!)
+  eoAlgo& ga = make_algo_scalar(parser, state, eval, checkpoint, op);
+
+  ///// End of construction of the algorithm
+
+  /////////////////////////////////////////
+  // to be called AFTER all parameters have been read!!!
+  make_help(parser);
+
+  //// GO
+  ///////
+  // evaluate intial population AFTER help and status in case it takes time
+  apply(eval, pop);
+  // if you want to print it out
+   cout << "Initial Population\n";
+   pop.sortedPrintOn(cout);
+   cout << endl;
+
+  run_ea(ga, pop); // run the ga
+
+  cout << "Final Population\n";
+  pop.sortedPrintOn(cout);
+  cout << endl;
+
+  }
+  catch(exception& e)
+  {
+    cout << e.what() << endl;
+  }
+  return 0;
+}
diff --git a/trunk/paradiseo-eo/tutorial/Lesson5/eoOneMax.h b/trunk/paradiseo-eo/tutorial/Lesson5/eoOneMax.h
new file mode 100644
index 000000000..a85bb89f7
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson5/eoOneMax.h
@@ -0,0 +1,111 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+The above line is usefulin Emacs-like editors
+ */
+
+/*
+Template for creating a new representation in EO
+================================================
+*/
+
+#ifndef _eoOneMax_h
+#define _eoOneMax_h
+
+/** 
+ *  Always write a comment in this format before class definition
+ *  if you want the class to be documented by Doxygen
+
+ * Note that you MUST derive your structure from EO
+ * but you MAY use some other already prepared class in the hierarchy
+ * like eoVector for instance, if you handle a vector of something....
+
+ * If you create a structure from scratch,
+ * the only thing you need to provide are 
+ *        a default constructor
+ *        IO routines printOn and readFrom
+ *
+ * Note that operator<< and operator>> are defined at EO level
+ * using these routines
+ */
+template< class FitT>
+class eoOneMax: public EO {
+public:
+  /** Ctor: you MUST provide a default ctor.
+   * though such individuals will generally be processed 
+   * by some eoInit object
+   */
+  eoOneMax() 
+  { 
+    // START Code of default Ctor of an eoOneMax object
+    // END   Code of default Ctor of an eoOneMax object
+  }
+
+  virtual ~eoOneMax()
+  {
+    // START Code of Destructor of an eoEASEAGenome object
+    // END   Code of Destructor of an eoEASEAGenome object
+  }
+
+  virtual string className() const { return "eoOneMax"; }
+
+  /** printing... */
+    void printOn(ostream& _os) const
+    {
+      // First write the fitness
+      EO::printOn(_os);
+      _os << ' ';
+    // START Code of default output 
+
+	/** HINTS
+	 * in EO we systematically write the sizes of things before the things
+	 * so readFrom is easier to code (see below)
+	 */
+      _os << b.size() << ' ' ;
+      for (unsigned i=0; i::readFrom(_is);
+    // START Code of input
+
+    /** HINTS
+     * remember the eoOneMax object will come from the default ctor
+     * this is why having the sizes written out is useful
+     */
+    unsigned s;
+    _is >> s;
+    b.resize(s);
+    for (unsigned i=0; i> bTmp;
+	b[i] = bTmp;
+      }			
+    // END   Code of input
+  }
+
+  // accessing and setting values
+  void setB(vector & _b)
+  {
+    b=_b;
+  }
+  const vector & B()
+  {
+    return b;
+  }
+
+private:			   // put all data here
+    // START Private data of an eoOneMax object
+  std::vector b;
+    // END   Private data of an eoOneMax object
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/tutorial/Lesson5/eoOneMaxEvalFunc.h b/trunk/paradiseo-eo/tutorial/Lesson5/eoOneMaxEvalFunc.h
new file mode 100644
index 000000000..b7f187462
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson5/eoOneMaxEvalFunc.h
@@ -0,0 +1,68 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+ 
+The above line is usefulin Emacs-like editors
+ */
+ 
+/*
+Template for evaluator in EO, a functor that computes the fitness of an EO
+==========================================================================
+*/
+ 
+#ifndef _eoOneMaxEvalFunc_h
+#define _eoOneMaxEvalFunc_h
+
+// include whatever general include you need
+#include 
+#include 
+
+// include the base definition of eoEvalFunc
+#include "eoEvalFunc.h"
+
+/** 
+  Always write a comment in this format before class definition
+  if you want the class to be documented by Doxygen
+*/
+template 
+class eoOneMaxEvalFunc : public eoEvalFunc
+{
+public:
+	/// Ctor - no requirement
+// START eventually add or modify the anyVariable argument
+  eoOneMaxEvalFunc()
+  //  eoOneMaxEvalFunc( varType  _anyVariable) : anyVariable(_anyVariable) 
+// END eventually add or modify the anyVariable argument
+  {
+    // START Code of Ctor of an eoOneMaxEvalFunc object
+    // END   Code of Ctor of an eoOneMaxEvalFunc object
+  }
+
+  /** Actually compute the fitness
+   *
+   * @param EOT & _eo the EO object to evaluate
+   *                  it should stay templatized to be usable 
+   *                  with any fitness type
+   */
+  void operator()(EOT & _eo)
+  {
+    // test for invalid to avoid recomputing fitness of unmodified individuals
+    if (_eo.invalid())
+      {
+	double fit;		   // to hold fitness value
+    // START Code of computation of fitness of the eoOneMax object
+	const vector & b = _eo.B();
+	fit = 0;
+	for (unsigned i=0; i
+
+/** 
+ *  Always write a comment in this format before class definition
+ *  if you want the class to be documented by Doxygen
+ *
+ * There is NO ASSUMPTION on the class GenoypeT.
+ * In particular, it does not need to derive from EO (e.g. to initialize 
+ *    atoms of an eoVector you will need an eoInit)
+ */
+template 
+class eoOneMaxInit: public eoInit {
+public:
+	/// Ctor - no requirement
+// START eventually add or modify the anyVariable argument
+//  eoOneMaxInit()
+    eoOneMaxInit( unsigned  _vecSize) : vecSize(_vecSize) 
+// END eventually add or modify the anyVariable argument
+  {
+    // START Code of Ctor of an eoOneMaxInit object
+    // END   Code of Ctor of an eoOneMaxInit object
+  }
+
+
+  /** initialize a genotype
+   *
+   * @param _genotype  generally a genotype that has been default-constructed
+   *                   whatever it contains will be lost
+   */
+  void operator()(GenotypeT & _genotype)
+  {
+    // START Code of random initialization of an eoOneMax object
+    vector b(vecSize);
+    for (unsigned i=0; i
+
+/**
+ *  Always write a comment in this format before class definition
+ *  if you want the class to be documented by Doxygen
+ *
+ * THere is NO ASSUMPTION on the class GenoypeT.
+ * In particular, it does not need to derive from EO
+ */
+template
+class eoOneMaxMutation: public eoMonOp
+{
+public:
+    /**
+     * Ctor - no requirement
+     */
+    // START eventually add or modify the anyVariable argument
+    eoOneMaxMutation()
+    //  eoOneMaxMutation( varType  _anyVariable) : anyVariable(_anyVariable)
+    // END eventually add or modify the anyVariable argument
+        {
+            // START Code of Ctor of an eoOneMaxEvalFunc object
+            // END   Code of Ctor of an eoOneMaxEvalFunc object
+        }
+
+    /// The class name. Used to display statistics
+    string className() const { return "eoOneMaxMutation"; }
+
+    /**
+     * modifies the parent
+     * @param _genotype The parent genotype (will be modified)
+     */
+    bool operator()(GenotypeT & _genotype)
+        {
+            bool isModified(true);
+            // START code for mutation of the _genotype object
+
+            /** Requirement
+             * if (_genotype has been modified)
+             *     isModified = true;
+             * else
+             *     isModified = false;
+             */
+            return isModified;
+            // END code for mutation of the _genotype object
+        }
+
+private:
+// START Private data of an eoOneMaxMutation object
+    //  varType anyVariable;		   // for example ...
+// END   Private data of an eoOneMaxMutation object
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/tutorial/Lesson5/eoOneMaxQuadCrossover.h b/trunk/paradiseo-eo/tutorial/Lesson5/eoOneMaxQuadCrossover.h
new file mode 100644
index 000000000..5a201bd08
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson5/eoOneMaxQuadCrossover.h
@@ -0,0 +1,70 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+The above line is usefulin Emacs-like editors
+*/
+
+/*
+Template for simple quadratic crossover operators
+=================================================
+
+Quadratic crossover operators modify the both genotypes
+*/
+
+#ifndef eoOneMaxQuadCrossover_H
+#define eoOneMaxQuadCrossover_H
+
+#include 
+
+/**
+ *  Always write a comment in this format before class definition
+ *  if you want the class to be documented by Doxygen
+ *
+ * THere is NO ASSUMPTION on the class GenoypeT.
+ * In particular, it does not need to derive from EO
+ */
+template
+class eoOneMaxQuadCrossover: public eoQuadOp
+{
+public:
+    /**
+     * Ctor - no requirement
+     */
+// START eventually add or modify the anyVariable argument
+    eoOneMaxQuadCrossover()
+    //  eoOneMaxQuadCrossover( varType  _anyVariable) : anyVariable(_anyVariable)
+    // END eventually add or modify the anyVariable argument
+        {
+            // START Code of Ctor of an eoOneMaxEvalFunc object
+            // END   Code of Ctor of an eoOneMaxEvalFunc object
+        }
+
+    /// The class name. Used to display statistics
+    string className() const { return "eoOneMaxQuadCrossover"; }
+
+    /**
+     * eoQuad crossover - modifies both parents
+     * @param _genotype1 The first parent
+     * @param _genotype2 The second parent
+     */
+    bool operator()(GenotypeT& _genotype1, GenotypeT & _genotype2)
+        {
+            bool oneAtLeastIsModified(true);
+            // START code for crossover of _genotype1 and _genotype2 objects
+
+            /** Requirement
+             * if (at least one genotype has been modified) // no way to distinguish
+             *     oneAtLeastIsModified = true;
+             * else
+             *     oneAtLeastIsModified = false;
+             */
+            return oneAtLeastIsModified;
+            // END code for crossover of _genotype1 and _genotype2 objects
+        }
+
+private:
+// START Private data of an eoOneMaxQuadCrossover object
+    //  varType anyVariable;		   // for example ...
+// END   Private data of an eoOneMaxQuadCrossover object
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/tutorial/Lesson5/make_OneMax.cpp b/trunk/paradiseo-eo/tutorial/Lesson5/make_OneMax.cpp
new file mode 100644
index 000000000..29fa78e6d
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson5/make_OneMax.cpp
@@ -0,0 +1,129 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+The above line is usefulin Emacs-like editors
+ */
+
+/*
+Template for creating a new representation in EO
+================================================
+
+This is the template file that llows separate compilation of
+everything that is representation independant (evolution engine and
+general output) for an Evolutionary Algorithm with scalar fitness.
+
+It includes of course the definition of the genotype (eoOneMax.h) and
+is written like the make_xxx.cpp files in dirs src/ga (for bitstrings)
+and src/es (for real vectors).
+
+*/
+
+// Miscilaneous include and declaration 
+#include 
+using namespace std;
+
+// eo general include
+#include "eo"
+// the real bounds (not yet in general eo include)
+#include "utils/eoRealVectorBounds.h"
+
+// include here whatever specific files for your representation
+// Basically, this should include at least the following
+
+/** definition of representation: 
+ * class eoOneMax MUST derive from EO for some fitness
+ */
+#include "eoOneMax.h"
+
+// create an initializer: this is NOT representation-independent
+// and will be done in the main file
+// However, should you decide to freeze that part, you could use the
+// following (and remove it from the main file, of course!!!)
+//------------------------------------------------------------------
+// #include "make_genotype_OneMax.h"
+// eoInit> & make_genotype(eoParser& _parser, eoState&_state, eoOneMax _eo)
+// {
+//   return do_make_genotype(_parser, _state, _eo);
+// } 
+
+// eoInit> & make_genotype(eoParser& _parser, eoState&_state, eoOneMax _eo)
+// {
+//   return do_make_genotype(_parser, _state, _eo);
+// } 
+
+// same thing for the variation operaotrs
+//---------------------------------------
+// #include "make_op_OneMax.h"
+// eoGenOp>&  make_op(eoParser& _parser, eoState& _state, eoInit>& _init)
+// {
+//   return do_make_op(_parser, _state, _init);
+// }
+
+// eoGenOp>&  make_op(eoParser& _parser, eoState& _state, eoInit>& _init)
+// {
+//   return do_make_op(_parser, _state, _init);
+// }
+
+// The following modules use ***representation independent*** routines
+
+// how to initialize the population 
+// it IS representation independent if an eoInit is given
+#include 
+eoPop >&  make_pop(eoParser& _parser, eoState& _state, eoInit > & _init)
+{
+  return do_make_pop(_parser, _state, _init);
+}
+
+eoPop >&  make_pop(eoParser& _parser, eoState& _state, eoInit > & _init)
+{
+  return do_make_pop(_parser, _state, _init);
+}
+
+// the stopping criterion
+#include 
+eoContinue >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter > & _eval)
+{
+  return do_make_continue(_parser, _state, _eval);
+}
+
+eoContinue >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter > & _eval)
+{
+  return do_make_continue(_parser, _state, _eval);
+}
+
+// outputs (stats, population dumps, ...)
+#include 
+eoCheckPoint >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter >& _eval, eoContinue >& _continue) 
+{
+  return do_make_checkpoint(_parser, _state, _eval, _continue);
+}
+
+eoCheckPoint >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter >& _eval, eoContinue >& _continue) 
+{
+  return do_make_checkpoint(_parser, _state, _eval, _continue);
+}
+
+// evolution engine (selection and replacement)
+#include 
+eoAlgo >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc >& _eval, eoContinue >& _continue, eoGenOp >& _op)
+{
+  return do_make_algo_scalar(_parser, _state, _eval, _continue, _op);
+}
+
+eoAlgo >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc >& _eval, eoContinue >& _continue, eoGenOp >& _op)
+{
+  return do_make_algo_scalar(_parser, _state, _eval, _continue, _op);
+}
+
+// simple call to the algo. stays there for consistency reasons 
+// no template for that one
+#include 
+void run_ea(eoAlgo >& _ga, eoPop >& _pop)
+{
+  do_run(_ga, _pop);
+}
+
+void run_ea(eoAlgo >& _ga, eoPop >& _pop)
+{
+  do_run(_ga, _pop);
+}
+
diff --git a/trunk/paradiseo-eo/tutorial/Lesson5/make_genotype_OneMax.h b/trunk/paradiseo-eo/tutorial/Lesson5/make_genotype_OneMax.h
new file mode 100644
index 000000000..52ff9ebf5
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson5/make_genotype_OneMax.h
@@ -0,0 +1,75 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_genotype.h
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _make_genotype_h
+#define _make_genotype_h
+
+#include 
+#include 
+  // also need the parser and param includes
+#include 
+#include 
+
+
+/*
+ * This fuction does the create an eoInit
+ *
+ * It could be here tempatized only on the fitness, as it can be used 
+ * to evolve structures with any fitness.
+ * However, for consistency reasons, it was finally chosen, as in 
+ * the rest of EO, to templatize by the full EOT, as this eventually 
+ * allows to choose the type of genotype at run time (see in es dir)
+ *
+ * It returns an eoInit that can later be used to initialize 
+ * the population (see make_pop.h).
+ *
+ * It uses a parser (to get user parameters) and a state (to store the memory)
+ * the last argument is to disambiguate the call upon different instanciations.
+ *
+ * WARNING: that last argument will generally be the result of calling 
+ *          the default ctor of EOT, resulting in most cases in an EOT 
+ *          that is ***not properly initialized***
+*/
+
+template 
+eoInit & do_make_genotype(eoParameterLoader& _parser, eoState& _state, EOT)
+{
+  // read any useful parameter here from the parser 
+  // the param itself will belong to the parser (as far as memory is concerned)
+
+  //    paramType & param = _parser.createParam(deafultValue, "Keyword", "Comment to appear in help and status", 'c',"Section of status file").value();
+
+  unsigned vecSize = _parser.createParam(unsigned(8), "VecSize", "Size of the bitstrings", 'v',"Representation").value();
+
+  // Then built the initializer - a pointer, stored in the eoState
+  eoInit* init = new eoOneMaxInit(vecSize);
+  // store in state
+  _state.storeFunctor(init);
+  // and return a reference
+  return *init;
+}
+
+#endif
diff --git a/trunk/paradiseo-eo/tutorial/Lesson5/make_op_OneMax.h b/trunk/paradiseo-eo/tutorial/Lesson5/make_op_OneMax.h
new file mode 100644
index 000000000..d19c89301
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Lesson5/make_op_OneMax.h
@@ -0,0 +1,210 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_op_OneMax.h
+// (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _make_op_OneMax_h
+#define _make_op_OneMax_h
+
+// the operators
+#include 
+#include 
+#include 
+#include 
+// combinations of simple eoOps (eoMonOp and eoQuadOp)
+#include 
+
+/** definition of mutation: 
+ * class eoOneMaxMonop MUST derive from eoMonOp
+ */
+#include "eoOneMaxMutation.h"
+
+/** definition of crossover (either as eoBinOp (2->1) or eoQuadOp (2->2): 
+ * class eoOneMaxBinCrossover MUST derive from eoBinOp
+ * OR 
+ * class eoOneMaxQuadCrossover MUST derive from eoQuadOp
+ */
+// #include "eoOneMaxBinOp.h"
+// OR
+#include "eoOneMaxQuadCrossover.h"
+
+  // also need the parser and state includes
+#include 
+#include 
+
+
+/////////////////// variation operators ///////////////
+// canonical (crossover + mutation) only at the moment //
+
+/*
+ * This function builds the operators that will be applied to the eoOneMax
+ *
+ * It uses a parser (to get user parameters), a state (to store the memory)
+ *    the last parameter is an eoInit: if some operator needs some info 
+ *    about the genotypes, the init has it all (e.g. bounds, ...)
+ *    Simply do 
+ *        EOT myEO;
+ *        _init(myEO);
+ *    and myEO is then an ACTUAL object
+ *
+ * As usual, the template is the complete EOT even though only the fitness
+ * is actually templatized here: the following only applies to eoOneMax
+*/
+
+template 
+eoGenOp & do_make_op(eoParameterLoader& _parser, eoState& _state, eoInit& _init)
+{
+  // this is a temporary version, while Maarten codes the full tree-structured
+  // general operator input
+  // BTW we must leave that simple version available somehow, as it is the one
+  // that 90% people use!
+
+
+    /////////////////////////////
+    // Variation operators
+    ////////////////////////////
+    // read crossover and mutations, combine each in a proportional Op
+    // and create the eoGenOp that calls crossover at rate pCross 
+    // then mutation with rate pMut
+
+    // the crossovers
+    /////////////////
+
+    // here we can have eoQuadOp (2->2) only - no time for the eoBinOp case
+
+    // you can have more than one - combined in a proportional way
+    
+    // first, define the crossover objects and read their rates from the parser
+    
+    // A first crossover   
+    eoQuadOp *cross = new eoOneMaxQuadCrossover /* (varType  _anyVariable) */;
+    // store in the state
+    _state.storeFunctor(cross);
+
+  // read its relative rate in the combination
+    double cross1Rate = _parser.createParam(1.0, "cross1Rate", "Relative rate for crossover 1", '1', "Variation Operators").value();
+
+  // and create the combined operator with this one
+  eoPropCombinedQuadOp *propXover = 
+    new eoPropCombinedQuadOp(*cross, cross1Rate);
+  // and of course stor it in the state
+    _state.storeFunctor(propXover);
+
+
+    // Optional: A second(and third, and ...)  crossover   
+    //   of course you must create the corresponding classes
+    // and all ***MUST*** derive from eoQuadOp
+
+  /* Uncomment if necessary - and replicate as many time as you need
+      cross = new eoOneMaxSecondCrossover(varType  _anyVariable); 
+      _state.storeFunctor(cross);
+      double cross2Rate = _parser.createParam(1.0, "cross2Rate", "Relative rate for crossover 2", '2', "Variation Operators").value(); 
+      propXover.add(*cross, cross2Rate); 
+  */
+  // if you want some gentle output, the last one shoudl be like
+  //  propXover.add(*cross, crossXXXRate, true);
+
+
+  // the mutation: same story
+  ////////////////
+  // you can have more than one - combined in a proportional way
+
+  // for each mutation, 
+  // - define the mutator object
+  // - read its rate from the parser
+  // - add it to the proportional combination
+
+  // a first mutation  
+  eoMonOp *mut = new eoOneMaxMutation/* (varType  _anyVariable) */;
+  _state.storeFunctor(mut);
+  // its relative rate in the combination
+  double mut1Rate = _parser.createParam(1.0, "mut1Rate", "Relative rate for mutation 1", '1', "Variation Operators").value();
+  // and the creation of the combined operator with this one
+  eoPropCombinedMonOp *propMutation = new eoPropCombinedMonOp(*mut, mut1Rate);
+  _state.storeFunctor(propMutation);
+
+    // Optional: A second(and third, and ...)  mutation with their rates
+    //   of course you must create the corresponding classes
+    // and all ***MUST*** derive from eoMonOp
+
+  /* Uncomment if necessary - and replicate as many time as you need
+      mut = new eoOneMaxSecondMutation(varType  _anyVariable);
+      _state.storeFunctor(mut);
+      double mut2Rate = _parser.createParam(1.0, "mut2Rate", "Relative rate for mutation 2", '2', "Variation Operators").value(); 
+       propMutation.add(*mut, mut2Rate); 
+  */
+  // if you want some gentle output, the last one shoudl be like
+  //  propMutation.add(*mut, mutXXXRate, true);
+
+  // end of crossover and mutation definitions
+  ////////////////////////////////////////////
+
+// END Modify definitions of objects by eventually add parameters
+//*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
+
+// from now on, you do not need to modify anything
+// though you CAN add things to the checkpointing (see tutorial)
+
+  // now build the eoGenOp:
+  // to simulate SGA (crossover with proba pCross + mutation with proba pMut
+  // we must construct
+  //     a sequential combination of
+  //          with proba 1, a proportional combination of 
+  //                        a QuadCopy and our crossover
+  //          with proba pMut, our mutation
+
+  // but of course you're free to use any smart combination you could think of
+  // especially, if you have to use eoBinOp rather than eoQuad Op youùll have
+  // to modify that part
+
+  // First read the individual level parameters
+    eoValueParam& pCrossParam = _parser.createParam(0.6, "pCross", "Probability of Crossover", 'C', "Variation Operators" );
+    // minimum check
+    if ( (pCrossParam.value() < 0) || (pCrossParam.value() > 1) )
+      throw runtime_error("Invalid pCross");
+
+    eoValueParam& pMutParam = _parser.createParam(0.1, "pMut", "Probability of Mutation", 'M', "Variation Operators" );
+    // minimum check
+    if ( (pMutParam.value() < 0) || (pMutParam.value() > 1) )
+      throw runtime_error("Invalid pMut");
+
+
+  // the crossover - with probability pCross
+  eoProportionalOp * propOp = new eoProportionalOp ;
+  _state.storeFunctor(propOp);
+  eoQuadOp *ptQuad = new eoQuadCloneOp;
+  _state.storeFunctor(ptQuad);
+  propOp->add(*propXover, pCrossParam.value()); // crossover, with proba pcross
+  propOp->add(*ptQuad, 1-pCrossParam.value()); // nothing, with proba 1-pcross
+
+  // now the sequential
+  eoSequentialOp *op = new eoSequentialOp;
+  _state.storeFunctor(op);
+  op->add(*propOp, 1.0);	 // always do combined crossover
+  op->add(*propMutation, pMutParam.value()); // then mutation, with proba pmut
+
+  // that's it - return a reference
+  return *op;
+}
+#endif
diff --git a/trunk/paradiseo-eo/tutorial/Makefile.am b/trunk/paradiseo-eo/tutorial/Makefile.am
new file mode 100644
index 000000000..66ed8252c
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Makefile.am
@@ -0,0 +1,2 @@
+SUBDIRS = Lesson1 Lesson2 Lesson3 Lesson4 Lesson5
+
diff --git a/trunk/paradiseo-eo/tutorial/Makefile.simple b/trunk/paradiseo-eo/tutorial/Makefile.simple
new file mode 100644
index 000000000..61396d3c2
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Makefile.simple
@@ -0,0 +1,29 @@
+SUBDIRS = Lesson1 Lesson2 Lesson3 Lesson4 Lesson5
+
+all:
+	for i in $(SUBDIRS); do cd $$i && $(MAKE) all; cd ..; done
+
+lesson1 : 
+	cd Lesson1; make
+
+lesson2 : 
+	cd Lesson2; make
+
+lesson3 : 
+	cd Lesson3; make
+
+lesson4 : 
+	cd Lesson4; make
+
+lesson5 : 
+	cd Lesson5; make
+
+#empty dist and distdir to let top-level 'make' do its job
+dist :
+
+distdir :
+
+check :
+
+clean:
+	for i in $(SUBDIRS); do cd $$i && $(MAKE) clean; cd ..; done
diff --git a/trunk/paradiseo-eo/tutorial/ParadisEO/CVS/Entries b/trunk/paradiseo-eo/tutorial/ParadisEO/CVS/Entries
new file mode 100644
index 000000000..178481050
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/ParadisEO/CVS/Entries
@@ -0,0 +1 @@
+D
diff --git a/trunk/paradiseo-eo/tutorial/ParadisEO/CVS/Entries.Log b/trunk/paradiseo-eo/tutorial/ParadisEO/CVS/Entries.Log
new file mode 100644
index 000000000..6dfb6ceae
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/ParadisEO/CVS/Entries.Log
@@ -0,0 +1,3 @@
+A D/Lesson1////
+A D/Lesson2////
+A D/Lesson3////
diff --git a/trunk/paradiseo-eo/tutorial/ParadisEO/CVS/Repository b/trunk/paradiseo-eo/tutorial/ParadisEO/CVS/Repository
new file mode 100644
index 000000000..928556620
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/ParadisEO/CVS/Repository
@@ -0,0 +1 @@
+eo/tutorial/ParadisEO
diff --git a/trunk/paradiseo-eo/tutorial/ParadisEO/CVS/Root b/trunk/paradiseo-eo/tutorial/ParadisEO/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/ParadisEO/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/tutorial/ParadisEO/Lesson1/CVS/Entries b/trunk/paradiseo-eo/tutorial/ParadisEO/Lesson1/CVS/Entries
new file mode 100644
index 000000000..178481050
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/ParadisEO/Lesson1/CVS/Entries
@@ -0,0 +1 @@
+D
diff --git a/trunk/paradiseo-eo/tutorial/ParadisEO/Lesson1/CVS/Repository b/trunk/paradiseo-eo/tutorial/ParadisEO/Lesson1/CVS/Repository
new file mode 100644
index 000000000..26082a117
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/ParadisEO/Lesson1/CVS/Repository
@@ -0,0 +1 @@
+eo/tutorial/ParadisEO/Lesson1
diff --git a/trunk/paradiseo-eo/tutorial/ParadisEO/Lesson1/CVS/Root b/trunk/paradiseo-eo/tutorial/ParadisEO/Lesson1/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/ParadisEO/Lesson1/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/tutorial/ParadisEO/Lesson2/CVS/Entries b/trunk/paradiseo-eo/tutorial/ParadisEO/Lesson2/CVS/Entries
new file mode 100644
index 000000000..178481050
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/ParadisEO/Lesson2/CVS/Entries
@@ -0,0 +1 @@
+D
diff --git a/trunk/paradiseo-eo/tutorial/ParadisEO/Lesson2/CVS/Repository b/trunk/paradiseo-eo/tutorial/ParadisEO/Lesson2/CVS/Repository
new file mode 100644
index 000000000..4be211061
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/ParadisEO/Lesson2/CVS/Repository
@@ -0,0 +1 @@
+eo/tutorial/ParadisEO/Lesson2
diff --git a/trunk/paradiseo-eo/tutorial/ParadisEO/Lesson2/CVS/Root b/trunk/paradiseo-eo/tutorial/ParadisEO/Lesson2/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/ParadisEO/Lesson2/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/tutorial/ParadisEO/Lesson3/CVS/Entries b/trunk/paradiseo-eo/tutorial/ParadisEO/Lesson3/CVS/Entries
new file mode 100644
index 000000000..178481050
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/ParadisEO/Lesson3/CVS/Entries
@@ -0,0 +1 @@
+D
diff --git a/trunk/paradiseo-eo/tutorial/ParadisEO/Lesson3/CVS/Repository b/trunk/paradiseo-eo/tutorial/ParadisEO/Lesson3/CVS/Repository
new file mode 100644
index 000000000..214585d9f
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/ParadisEO/Lesson3/CVS/Repository
@@ -0,0 +1 @@
+eo/tutorial/ParadisEO/Lesson3
diff --git a/trunk/paradiseo-eo/tutorial/ParadisEO/Lesson3/CVS/Root b/trunk/paradiseo-eo/tutorial/ParadisEO/Lesson3/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/ParadisEO/Lesson3/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/tutorial/README b/trunk/paradiseo-eo/tutorial/README
new file mode 100644
index 000000000..aecd143e2
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/README
@@ -0,0 +1,13 @@
+Eo Tutorial - corresponding to EO version 0.9.1+
+
+To start the tutorial, read index.html in your favorite browser.
+
+Many things are missing, including many solutions for the exercises, 
+the introduction to EC and most of the Component-based pages.
+More important, all examples of this tutorial have only been tested 
+on a Linux computer, and the Makefile will not work with MS-Windows 
+systems. Any help is welcome!
+
+Be patient ... 
+evoMarc
+
diff --git a/trunk/paradiseo-eo/tutorial/Templates/CVS/Entries b/trunk/paradiseo-eo/tutorial/Templates/CVS/Entries
new file mode 100644
index 000000000..789a4c4b7
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Templates/CVS/Entries
@@ -0,0 +1,24 @@
+/EO.tpl/1.1/Fri Aug 23 16:02:02 2002//
+/MakeSimple.tmpl/1.2/Tue May 25 07:57:52 2004//
+/Makefile.tmpl/1.6/Wed Oct 23 04:42:07 2002//
+/MyStructEA.cpp/1.5/Wed May  1 04:04:15 2002//
+/MyStructLibEA.cpp/1.1/Wed May  8 06:47:50 2002//
+/MyStructSEA.cpp/1.4/Wed Oct  5 21:34:19 2005//
+/README/1.4/Tue May 25 07:57:52 2004//
+/binCrossover.tmpl/1.3/Tue Sep  4 08:35:22 2001//
+/continue.tmpl/1.2/Tue Sep  4 08:35:22 2001//
+/create.sh/1.4/Wed May  8 06:47:50 2002//
+/createSimple/1.2/Tue May 25 07:57:52 2004//
+/eoMyStruct.tmpl/1.4/Sat Mar 22 06:39:21 2003//
+/evalFunc.tmpl/1.2/Thu Oct  4 20:12:19 2001//
+/init.tmpl/1.2/Sat Nov 10 06:32:05 2001//
+/lessOffspringExternalSelectorGenOp.tmpl/1.3/Tue Sep  4 08:35:22 2001//
+/lessOffspringSameSelectorGenOp.tmpl/1.3/Tue Sep  4 08:35:22 2001//
+/make_MyStruct.cpp/1.1/Wed May  8 06:47:50 2002//
+/make_genotype_MyStruct.h/1.2/Fri May  3 05:12:32 2002//
+/make_op_MyStruct.h/1.1/Thu Oct  4 20:12:19 2001//
+/moreOffspringGenOp.tmpl/1.3/Tue Sep  4 08:35:22 2001//
+/mutation.tmpl/1.6/Mon Sep 24 05:59:13 2001//
+/quadCrossover.tmpl/1.5/Sat Jun 21 06:34:00 2003//
+/stat.tmpl/1.2/Thu Feb 10 09:57:28 2005//
+D
diff --git a/trunk/paradiseo-eo/tutorial/Templates/CVS/Repository b/trunk/paradiseo-eo/tutorial/Templates/CVS/Repository
new file mode 100644
index 000000000..4996367c2
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Templates/CVS/Repository
@@ -0,0 +1 @@
+eo/tutorial/Templates
diff --git a/trunk/paradiseo-eo/tutorial/Templates/CVS/Root b/trunk/paradiseo-eo/tutorial/Templates/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Templates/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/tutorial/Templates/EO.tpl b/trunk/paradiseo-eo/tutorial/Templates/EO.tpl
new file mode 100644
index 000000000..438a442ca
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Templates/EO.tpl
@@ -0,0 +1,938 @@
+\TEMPLATE_START// -*- mode: c++; c-indent-level: 2; c++-member-init-indent: 8; comment-column: 35; -*-
+//
+// (The above line is useful in Emacs-like editors)
+//
+//*************************************
+//                                         
+//  EASEA.cpp
+//                                         
+//  C++ file generated by AESAE-EO v0.7
+//                                         
+//*************************************
+//
+//
+// Main file for creating a new representation in EO
+// =================================================
+// 
+// This main file includes all other files that have been generated by the
+// script create.sh, so it is the only file to compile.
+// 
+// In case you want to build up a separate library for your new Evolving Object,
+// you'll need some work - follow what's done in the src/ga dir, used in the
+// main file BitEA in tutorial/Lesson4 dir.
+// Or you can wait until we do it :-)
+
+// Miscellany includes and declarations
+#include 
+using namespace std;
+
+// eo general include
+#include "eo"
+// real bounds (not yet in general eo include)
+#include "utils/eoRealVectorBounds.h"
+
+unsigned  *pCurrentGeneration;
+unsigned  *pEZ_NB_GEN;
+double EZ_MUT_PROB, EZ_XOVER_PROB, EZ_REPL_PERC=0.0;
+int EZ_NB_GEN, EZ_POP_SIZE;
+unsigned long EZ_NB_EVALUATIONS=0L;
+
+inline int random(int b1=0, int b2=1){
+  return rng.random(b2-b1)+b1;
+}
+inline double random(double b1=0, double b2=1){
+  return rng.uniform(b2-b1)+b1;
+}
+inline float random(float b1=0, float b2=1){
+  return rng.uniform(b2-b1)+b1;
+}
+
+\ANALYSE_PARAMETERS
+\INSERT_USER_DECLARATIONS
+\INSERT_INITIALISATION_FUNCTION 
+
+// include here whatever specific files for your representation
+// Basically, this should include at least the following
+
+/** definition of representation: 
+ * class EASEAGenome MUST derive from EO for some fitness
+ */
+#include "EASEAGenome.h"
+
+// GENOTYPE   EASEAGenome ***MUST*** be templatized over the fitness
+
+//*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
+// START fitness type: double or eoMaximizingFitness if you are maximizing
+//                     eoMinimizingFitness if you are minimizing
+typedef \MINIMAXI MyFitT ;  // type of fitness 
+// END fitness type
+//*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
+
+// Then define your EO objects using that fitness type
+typedef EASEAGenome Indi;      // ***MUST*** derive from EO 
+
+\INSERT_USER_FUNCTIONS
+
+/** definition of evaluation: 
+ * class EASEAEvalFunc MUST derive from eoEvalFunc
+ * and should test for validity before doing any computation
+ * see tutorial/Templates/evalFunc.tmpl
+ */
+#include "EASEAEvalFunc.h"
+
+/** definition of initialization: 
+ * class EASEAGenomeInit MUST derive from eoInit
+ */
+#include "EASEAInit.h"
+
+/** include all files defining variation operator classes
+ */
+#include "EASEAMutation.h"
+#include "EASEAQuadCrossover.h"
+
+// Use existing modules to define representation independent routines
+// These are parser-based definitions of objects
+
+// how to initialize the population 
+// it IS representation independent if an eoInit is given
+#include 
+eoPop&  make_pop(eoParser& _parser, eoState& _state, eoInit & _init){
+  return do_make_pop(_parser, _state, _init);
+}
+
+// the stopping criterion
+#include "do/make_continue.h"
+eoContinue& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter & _eval){
+  return do_make_continue(_parser, _state, _eval);
+}
+
+// outputs (stats, population dumps, ...)
+#include 
+eoCheckPoint& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter& _eval, eoContinue& _continue) {
+  return do_make_checkpoint(_parser, _state, _eval, _continue);
+}
+
+// evolution engine (selection and replacement)
+#include 
+eoAlgo&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc& _eval, eoContinue& _continue, eoGenOp& _op){
+  return do_make_algo_scalar(_parser, _state, _eval, _continue, _op);
+}
+
+// simple call to the algo. stays there for consistency reasons 
+// no template for that one
+#include 
+// the instanciating fitnesses
+#include 
+void run_ea(eoAlgo& _ga, eoPop& _pop){
+  do_run(_ga, _pop);
+}
+
+// checks for help demand, and writes the status file
+// and make_help; in libutils
+void make_help(eoParser & _parser);
+
+// now use all of the above, + representation dependent things
+int main(int argc, char* argv[]){
+
+try  {
+\INSERT_INIT_FCT_CALL
+
+  eoParser parser(argc, argv);  // for user-parameter reading
+
+  eoState state;    // keeps all things allocated
+
+    // The fitness
+    //////////////
+   EASEAEvalFunc plainEval/* (varType  _anyVariable) */;
+   // turn that object into an evaluation counter
+   eoEvalFuncCounter eval(plainEval);
+
+   // a genotype initializer
+   EASEAInit init;
+   // or, if you need some parameters, you might as well 
+   // - write a constructor of the eoMyStructInit that uses a parser
+   // - call it from here:
+   //        eoEASEAInit init(parser);
+    
+    
+   // Build the variation operator (any seq/prop construct)
+   // here, a simple example with only 1 crossover (2->2, a QuadOp) and
+   // one mutation, is given.
+   // Hints to have choice among multiple crossovers and mutations are given
+
+   // A (first) crossover (possibly use the parser in its Ctor)
+   EASEAQuadCrossover cross /* (eoParser parser) */;
+    
+   // IF MORE THAN ONE:
+
+    // read its relative rate in the combination
+// double cross1Rate = parser.createParam(1.0, "cross1Rate", "Relative rate for crossover 1", '1', "Variation Operators").value();
+
+    // create the combined operator with the first one (rename it cross1 !!!)
+// eoPropCombinedQuadOp cross(cross1, cross1Rate);
+
+    // and as many as you want the following way:
+    // 1- write the new class by mimicking eoEASEAQuadCrossover.h
+    // 2- include that file here together with eoEASEAQuadCrossover above
+    // 3- uncomment and duplicate the following lines:
+    //
+// eoEASEASecondCrossover cross2(eoParser parser); 
+// double cross2Rate = parser.createParam(1.0, "cross2Rate", "Relative rate for crossover 2", '2', "Variation Operators").value(); 
+// cross.add(cross2, cross2Rate); 
+
+  // NOTE: if you want some gentle output, the last one shoudl be like
+  //  cross.add(cross, crossXXXRate, true);
+
+    /////////////// Same thing for MUTATION
+
+   // a (first) mutation   (possibly use the parser in its Ctor)
+   EASEAMutation mut /* (eoParser parser) */;
+
+    // IF MORE THAN ONE:
+
+    // read its relative rate in the combination
+// double mut1Rate = parser.createParam(1.0, "mut1Rate", "Relative rate for mutation 1", '1', "Variation Operators").value();
+
+    // create the combined operator with the first one (rename it cross1 !!!)
+// eoPropCombinedMonOp mut(mut1, mut1Rate);
+
+    // and as many as you want the following way:
+    // 1- write the new class by mimicking eoEASEAMutation.h
+    // 2- include that file here together with eoEASEAMutation above
+    // 3- uncomment and duplicate the following lines:
+    //
+// eoEASEASecondMutation mut2(eoParser parser); 
+// double mut2Rate = parser.createParam(1.0, "mut2Rate", "Relative rate for mutation 2", '2', "Variation Operators").value(); 
+// mut.add(mut2, mut2Rate); 
+
+  // NOTE: if you want some gentle output, the last one shoudl be like
+  //  mut.add(mut, mutXXXRate, true);
+
+  // now encapsulate your crossover(s) and mutation(s) into an eoGeneralOp
+  // so you can fully benefit of the existing evolution engines
+
+  // First read the individual level parameters
+    double pCross = parser.createParam(0.6, "pCross", "Probability of Crossover", 'C', "Variation Operators" ).value();
+    // minimum check
+    if ( (pCross < 0) || (pCross > 1) )
+      throw runtime_error("Invalid pCross");
+
+    double pMut = parser.createParam(0.1, "pMut", "Probability of Mutation", 'M', "Variation Operators" ).value();
+    // minimum check
+    if ( (pMut < 0) || (pMut > 1) )
+      throw runtime_error("Invalid pMut");
+
+    // now create the generalOp
+    eoSGAGenOp op(cross, pCross, mut, pMut);
+
+
+
+  //// Now the representation-independent things 
+  //
+  // YOU SHOULD NOT NEED TO MODIFY ANYTHING BEYOND THIS POINT
+  // unless you want to add specific statistics to the checkpoint
+  //////////////////////////////////////////////
+
+  // initialize the population
+  // yes, this is representation indepedent once you have an eoInit
+  eoPop& pop   = make_pop(parser, state, init);
+  // give popSize to AESAE control
+  EZ_POP_SIZE = pop.size();
+
+  // stopping criteria
+  eoContinue & term = make_continue(parser, state, eval);
+  // output
+  eoCheckPoint & checkpoint = make_checkpoint(parser, state, eval, term);
+  // algorithm (need the operator!)
+  eoAlgo& ga = make_algo_scalar(parser, state, eval, checkpoint, op);
+
+  ///// End of construction of the algorithm
+
+  /////////////////////////////////////////
+  // to be called AFTER all parameters have been read!!!
+  make_help(parser);
+
+  //// GO
+  ///////
+  // evaluate intial population AFTER help and status in case it takes time
+  apply(eval, pop);
+  // if you want to print it out
+//   cout << "Initial Population\n";
+//   pop.sortedPrintOn(cout);
+//   cout << endl;
+
+  run_ea(ga, pop); // run the ga
+
+  cout << "Best individual in final population\n";
+  cout << pop.best_element() << endl;
+
+  }
+  catch(exception& e)
+  {
+    cout << e.what() << endl;
+  }
+  return 0;
+}
+
+\START_EO_GENOME_H_TPL// -*- mode: c++; c-indent-level: 2; c++-member-init-indent: 8; comment-column: 35; -*-
+//
+// (The above line is useful in Emacs-like editors)
+//
+//*************************************
+//                                         
+//  EASEAGenome.h
+//                                         
+//  C++ file generated by AESAE-EO v0.7
+//                                         
+//*************************************
+//
+
+#ifndef _EASEAGenome_h
+#define _EASEAGenome_h
+
+/** 
+ *  Always write a comment in this format before class definition
+ *  if you want the class to be documented by Doxygen
+
+ * Note that you MUST derive your structure from EO
+ * but you MAY use some other already prepared class in the hierarchy
+ * like eoVector for instance, if you handle a vector of something....
+
+ * If you create a structure from scratch,
+ * the only thing you need to provide are 
+ *        a default constructor
+ *        IO routines printOn and readFrom
+ *
+ * Note that operator<< and operator>> are defined at EO level
+ * using these routines
+ */
+\ANALYSE_USER_CLASSES
+\INSERT_USER_CLASSES
+
+template< class FitT>
+class EASEAGenome: public EO {
+public:
+  /** Ctor: you MUST provide a default ctor.
+   * though such individuals will generally be processed 
+   * by some eoInit object
+   */
+  EASEAGenome() : EO()
+  { 
+    // START Code of default Ctor of an EASEAGenome object
+\GENOME_CTOR 
+    // END   Code of default Ctor of an EASEAGenome object
+  }
+
+  EASEAGenome(const EASEAGenome & arg) : EO()
+  { 
+\GENOME_CTOR
+    copy(arg); 
+  }
+
+  virtual ~EASEAGenome()
+  {
+    // START Code of Destructor of an EASEAGenome object
+   \GENOME_DTOR 
+    // END   Code of Destructor of an EASEAGenome object
+  }
+
+  virtual string className() const { return "EASEAGenome"; }
+
+  EASEAGenome& operator=(const EASEAGenome & arg) { 
+    copy(arg); 
+    return *this;
+  }
+  
+  void copy(const EASEAGenome& genome) 
+  {
+    if(&genome != this){
+      \GENOME_DTOR
+      \COPY_CTOR  
+      if (genome.invalid()) {	   // copying an invalid genome
+	fitness(FitT());	   // put a valid value (i.e. non NAN)
+	invalidate();		   // but INVALIDATE the genome
+      }
+      else
+	fitness(genome.fitness());
+    }
+  }
+  
+  bool operator==(const EASEAGenome & genome) const { 
+    \EQUAL
+      return true;
+  }
+
+  bool operator!=(const EASEAGenome & genome) const {
+    return !(*this==genome);
+  }
+
+  /** printing... */
+    void printOn(ostream& os) const
+    {
+      // First write the fitness
+        EO::printOn(os);
+        os << ' ';
+    // START Code of default output 
+
+  /** HINTS
+   * in EO we systematically write the sizes of things before the things
+   * so readFrom is easier to code (see below)
+   */
+\INSERT_DISPLAY
+\WRITE
+    // END   Code of default output
+    }
+
+  /** reading... 
+   * of course, your readFrom must be able to read what printOn writes!!!
+   */
+    void readFrom(istream& is)
+      {
+  // of course you should read the fitness first!
+  EO::readFrom(is);
+    // START Code of input
+
+  /** HINTS
+   * remember the EASEAGenome object will come from the default ctor
+   * this is why having the sizes written out is useful
+   */
+\READ
+    // END   Code of input
+      }
+
+  //private:         // put all data here - no privacy in EASEA
+    // START Private data of an EASEAGenome object
+\INSERT_GENOME
+    // END   Private data of an EASEAGenome object
+};
+#endif
+
+\START_EO_EVAL_TPL// -*- mode: c++; c-indent-level: 2; c++-member-init-indent: 8; comment-column: 35; -*-
+//
+// (The above line is useful in Emacs-like editors)
+//
+//*************************************
+//                                         
+//  EASEAEvalFunc.h
+//                                         
+//  C++ file generated by AESAE-EO v0.7
+//                                         
+//*************************************
+//
+
+/*
+Evaluator in EO: a functor that computes the fitness of an EO
+=============================================================
+*/
+ 
+#ifndef _EASEAEvalFunc_h
+#define _EASEAEvalFunc_h
+
+// include whatever general include you need
+#include 
+#include 
+
+// include the base definition of eoEvalFunc
+#include "eoEvalFunc.h"
+
+/** 
+  Always write a comment in this format before class definition
+  if you want the class to be documented by Doxygen
+*/
+template 
+class EASEAEvalFunc : public eoEvalFunc
+{
+public:
+  /// Ctor - no requirement
+// START eventually add or modify the anyVariable argument
+  EASEAEvalFunc()
+  //  EASEAEvalFunc( varType  _anyVariable) : anyVariable(_anyVariable) 
+// END eventually add or modify the anyVariable argument
+  {
+    // START Code of Ctor of an EASEAEvalFunc object
+    // END   Code of Ctor of an EASEAEvalFunc object
+  }
+
+  /** Actually compute the fitness
+   *
+   * @param EOT & _eo the EO object to evaluate
+   *                  it should stay templatized to be usable 
+   *                  with any fitness type
+   */
+  void operator()(EOT & genome)
+  {
+    // test for invalid to avoid recomputing fitness of unmodified individuals
+    if (genome.invalid())
+      {
+    // START Code of computation of fitness of the EASEA object
+\INSERT_EVALUATOR
+    // END   Code of computation of fitness of the EASEA object
+      }
+  }
+
+private:
+// START Private data of an EASEAEvalFunc object
+  //  varType anyVariable;       // for example ...
+// END   Private data of an EASEAEvalFunc object
+};
+
+
+#endif
+
+\START_EO_INITER_TPL// -*- mode: c++; c-indent-level: 2; c++-member-init-indent: 8; comment-column: 35; -*-
+//
+// (The above line is useful in Emacs-like editors)
+//
+//*************************************
+//                                         
+//  EASEAInit.h
+//                                         
+//  C++ file generated by AESAE-EO v0.7
+//                                         
+//*************************************
+//
+
+/*
+objects initialization in EO
+============================
+*/
+
+#ifndef _EASEAInit_h
+#define _EASEAInit_h
+
+// include the base definition of eoInit
+#include 
+
+/** 
+ *  Always write a comment in this format before class definition
+ *  if you want the class to be documented by Doxygen
+ *
+ * There is NO ASSUMPTION on the class GenoypeT.
+ * In particular, it does not need to derive from EO (e.g. to initialize 
+ *    atoms of an eoVector you will need an eoInit)
+ */
+template 
+class EASEAInit: public eoInit {
+public:
+  /// Ctor - no requirement
+// START eventually add or modify the anyVariable argument
+  EASEAInit()
+  //  EASEAInit( varType & _anyVariable) : anyVariable(_anyVariable) 
+// END eventually add or modify the anyVariable argument
+  {
+    // START Code of Ctor of an EASEAInit object
+    // END   Code of Ctor of an EASEAInit object
+  }
+
+
+  /** initialize a genotype
+   *
+   * @param _genotype  generally a genotype that has been default-constructed
+   *                   whatever it contains will be lost
+   */
+  void operator()(GenotypeT & _genotype)
+  {
+    // START Code of random initialization of an EASEAGenome object
+\INSERT_EO_INITIALISER
+    // END   Code of random initialization of an EASEAGenome object
+    _genotype.invalidate();    // IMPORTANT in case the _genotype is old
+  }
+
+private:
+// START Private data of an EASEAInit object
+  //  varType & anyVariable;       // for example ...
+// END   Private data of an EASEAInit object
+};
+
+#endif
+
+
+\START_EO_MUT_TPL// -*- mode: c++; c-indent-level: 2; c++-member-init-indent: 8; comment-column: 35; -*-
+//
+// (The above line is useful in Emacs-like editors)
+//
+//*************************************
+//                                         
+//  EASEAMutation.h
+//                                         
+//  C++ file generated by AESAE-EO v0.7
+//                                         
+//*************************************
+//
+
+/*
+simple mutation operators
+=========================
+*/
+
+#ifndef EASEAMutation_H
+#define EASEAMutation_H
+
+
+#include 
+
+/** 
+ *  Always write a comment in this format before class definition
+ *  if you want the class to be documented by Doxygen
+ *
+ * THere is NO ASSUMPTION on the class GenoypeT.
+ * In particular, it does not need to derive from EO
+ */
+template 
+class EASEAMutation: public eoMonOp
+{
+public:
+  /**
+   * Ctor - no requirement
+   */
+// START eventually add or modify the anyVariable argument
+  EASEAMutation()
+  //  EASEAMutation( varType  _anyVariable) : anyVariable(_anyVariable) 
+// END eventually add or modify the anyVariable argument
+  {
+    // START Code of Ctor of an EASEAMutation object
+    // END   Code of Ctor of an EASEAMutation object
+  }
+
+  /// The class name. Used to display statistics
+  string className() const { return "EASEAMutation"; }
+
+  /**
+   * modifies the parent
+   * @param _genotype The parent genotype (will be modified)
+   */
+  bool operator()(GenotypeT & _genotype) 
+  {
+    // START code for mutation of the _genotype object
+\INSERT_MUTATOR
+    // END code for mutation of the _genotype object
+
+private:
+// START Private data of an EASEAMutation object
+  //  varType anyVariable;       // for example ...
+// END   Private data of an EASEAMutation object
+};
+
+#endif
+
+\START_EO_QUAD_XOVER_TPL// -*- mode: c++; c-indent-level: 2; c++-member-init-indent: 8; comment-column: 35; -*-
+//
+// (The above line is useful in Emacs-like editors)
+//
+//*************************************
+//                                         
+//  EASEAQuadCrossover.h
+//                                         
+//  C++ file generated by AESAE-EO v0.7
+//                                         
+//*************************************
+//
+
+/*
+Template for simple quadratic crossover operators
+=================================================
+
+Quadratic crossover operators modify both genotypes
+*/
+
+#ifndef EASEAQuadCrossover_H
+#define EASEAQuadCrossover_H
+
+#include 
+
+/** 
+ *  Always write a comment in this format before class definition
+ *  if you want the class to be documented by Doxygen
+ *
+ * THere is NO ASSUMPTION on the class GenoypeT.
+ * In particular, it does not need to derive from EO
+ */
+template 
+class EASEAQuadCrossover: public eoQuadOp
+{
+public:
+  /**
+   * Ctor - no requirement
+   */
+// START eventually add or modify the anyVariable argument
+  EASEAQuadCrossover()
+  //  EASEAQuadCrossover( varType  _anyVariable) : anyVariable(_anyVariable) 
+// END eventually add or modify the anyVariable argument
+  {
+    // START Code of Ctor of an EASEAQuadCrossover object
+    // END   Code of Ctor of an EASEAQuadCrossover object
+  }
+
+  /// The class name. Used to display statistics
+  string className() const { return "EASEAQuadCrossover"; }
+
+  /**
+   * eoQuad crossover - modifies both genotypes
+   */
+  bool operator()(GenotypeT& child1, GenotypeT & child2) 
+  {
+      GenotypeT parent1(child1);
+      GenotypeT parent2(child2);
+    
+    // START code for crossover of child1 and child2 objects
+\INSERT_CROSSOVER
+    return (parent1!=child1)||(parent2!=child2);
+    // END code for crossover of child1 and child2 objects
+  }
+
+private:
+// START Private data of an EASEAQuadCrossover object
+  //  varType anyVariable;       // for example ...
+// END   Private data of an EASEAQuadCrossover object
+};
+
+#endif
+
+\START_EO_CONTINUE_TPL// -*- mode: c++; c-indent-level: 2; c++-member-init-indent: 8; comment-column: 35; -*-
+//
+// (The above line is useful in Emacs-like editors)
+//
+//*************************************
+//                                         
+//  EASEA_make_continue.h
+//                                         
+//  C++ file generated by AESAE-EO v0.7
+//                                         
+//*************************************
+//
+
+#ifndef _make_continue_h
+#define _make_continue_h
+
+/*
+Contains the templatized version of parser-based choice of stopping criterion
+It can then be instantiated, and compiled on its own for a given EOType
+(see e.g. in dir ga, ga.cpp)
+*/
+
+// Continuators - all include eoContinue.h
+#include 
+#include 
+#include 
+#include 
+#include 
+#ifndef _MSC_VER
+#include   // CtrlC handling (using 2 global variables!)
+#endif
+
+  // also need the parser and param includes
+#include 
+#include 
+
+
+/////////////////// the stopping criterion ////////////////
+template 
+eoCombinedContinue * make_combinedContinue(eoCombinedContinue *_combined, eoContinue *_cont)
+{
+  if (_combined)       // already exists
+    _combined->add(*_cont);
+  else
+    _combined = new eoCombinedContinue(*_cont);
+  return _combined;
+}
+
+template 
+eoContinue & do_make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter & _eval)
+{
+  //////////// Stopping criterion ///////////////////
+  // the combined continue - to be filled
+  eoCombinedContinue *continuator = NULL;
+
+  // for each possible criterion, check if wanted, otherwise do nothing
+
+  // First the eoGenContinue - need a default value so you can run blind
+  // but we also need to be able to avoid it <--> 0
+  eoValueParam& maxGenParam = _parser.createParam(\NB_GEN, "maxGen", "Maximum number of generations () = none)",'G',"Stopping criterion");
+  // and give control to EASEA
+    EZ_NB_GEN = maxGenParam.value();
+    pEZ_NB_GEN = & maxGenParam.value();
+
+    // do not test for positivity in EASEA
+    //    if (maxGenParam.value()) // positive: -> define and store
+    //      {
+  eoGenContinue *genCont = new eoGenContinue(maxGenParam.value());
+  _state.storeFunctor(genCont);
+  // and "add" to combined
+  continuator = make_combinedContinue(continuator, genCont);
+  //      }
+
+  // the steadyGen continue - only if user imput
+  eoValueParam& steadyGenParam = _parser.createParam(unsigned(100), "steadyGen", "Number of generations with no improvement",'s', "Stopping criterion");
+  eoValueParam& minGenParam = _parser.createParam(unsigned(0), "minGen", "Minimum number of generations",'g', "Stopping criterion");
+    if (_parser.isItThere(steadyGenParam))
+      {
+  eoSteadyFitContinue *steadyCont = new eoSteadyFitContinue
+    (minGenParam.value(), steadyGenParam.value());
+  // store
+  _state.storeFunctor(steadyCont);
+  // add to combinedContinue
+  continuator = make_combinedContinue(continuator, steadyCont);
+      }
+
+  // Same thing with Eval - but here default value is 0
+  eoValueParam& maxEvalParam = _parser.createParam((unsigned long)0, "maxEval", "Maximum number of evaluations (0 = none)",'E',"Stopping criterion");
+
+    if (maxEvalParam.value()) // positive: -> define and store
+      {
+  eoEvalContinue *evalCont = new eoEvalContinue(_eval, maxEvalParam.value());
+  _state.storeFunctor(evalCont);
+  // and "add" to combined
+  continuator = make_combinedContinue(continuator, evalCont);
+      }
+    /*
+  // the steadyEval continue - only if user imput
+  eoValueParam& steadyGenParam = _parser.createParam(unsigned(100), "steadyGen", "Number of generations with no improvement",'s', "Stopping criterion");
+  eoValueParam& minGenParam = _parser.createParam(unsigned(0), "minGen", "Minimum number of generations",'g', "Stopping criterion");
+    if (_parser.isItThere(steadyGenParam))
+      {
+  eoSteadyGenContinue *steadyCont = new eoSteadyFitContinue
+    (minGenParam.value(), steadyGenParam.value());
+  // store
+  _state.storeFunctor(steadyCont);
+  // add to combinedContinue
+  continuator = make_combinedContinue(continuator, steadyCont);
+      }
+    */
+    // the target fitness
+    eoFitContinue *fitCont;
+    eoValueParam& targetFitnessParam = _parser.createParam(double(0.0), "targetFitness", "Stop when fitness reaches",'T', "Stopping criterion");
+    if (_parser.isItThere(targetFitnessParam))
+      {
+  fitCont = new eoFitContinue
+    (targetFitnessParam.value());
+  // store
+  _state.storeFunctor(fitCont);
+  // add to combinedContinue
+  continuator = make_combinedContinue(continuator, fitCont);
+      }
+
+#ifndef _MSC_VER
+    // the CtrlC interception (Linux only I'm afraid)
+    eoCtrlCContinue *ctrlCCont;
+    eoValueParam& ctrlCParam = _parser.createParam(false, "CtrlC", "Terminate current generation upon Ctrl C",'C', "Stopping criterion");
+    if (_parser.isItThere(ctrlCParam))
+      {
+  ctrlCCont = new eoCtrlCContinue;
+  // store
+  _state.storeFunctor(ctrlCCont);
+  // add to combinedContinue
+  continuator = make_combinedContinue(continuator, ctrlCCont);
+      }
+#endif
+
+    // now check that there is at least one!
+    if (!continuator)
+      throw runtime_error("You MUST provide a stopping criterion");
+  // OK, it's there: store in the eoState
+  _state.storeFunctor(continuator);
+
+  // and return
+    return *continuator;
+}
+
+#endif
+
+\START_EO_PARAM_TPL#*************************************
+#                                         
+#  EASEA.prm
+#                                         
+#  Parameter file generated by AESAE-EO v0.7
+#                                         
+#*************************************
+######    General    ######
+# --help=0 # -h : Prints this message
+# --stopOnUnknownParam=1 # Stop if unknown param entered
+--seed=0   # -S : Random number seed
+
+######    Evolution Engine    ######
+--popSize=\POP_SIZE # -P : Population Size
+--selection=\SELECTOR\SELECT_PRM # -S : Selection: Roulette, Ranking(p,e), DetTour(T), StochTour(t) or Sequential(ordered/unordered)
+--nbOffspring=\OFF_SIZE # -O : Nb of offspring (percentage or absolute)
+--replacement=General # Type of replacement: Generational, ESComma, ESPlus, SSGA(T), EP(T)
+
+######    Evolution Engine / Replacement    ######
+--elite=\ELITE_SIZE  # Nb of elite parents (percentage or absolute)
+--eliteType=\ELITISM # Strong (true) or weak (false) elitism (set elite to 0 for none)
+--surviveParents=\SURV_PAR_SIZE # Nb of surviving parents (percentage or absolute)
+--reduceParents=\RED_PAR\RED_PAR_PRM # Parents reducer: Deterministic, EP(T), DetTour(T), StochTour(t), Uniform
+--surviveOffspring=\SURV_OFF_SIZE  # Nb of surviving offspring (percentage or absolute)
+--reduceOffspring=\RED_OFF\RED_OFF_PRM # Offspring reducer: Deterministic, EP(T), DetTour(T), StochTour(t), Uniform
+--reduceFinal=\RED_FINAL\RED_FINAL_PRM # Final reducer: Deterministic, EP(T), DetTour(T), StochTour(t), Uniform
+
+######    Output    ######
+# --useEval=1 # Use nb of eval. as counter (vs nb of gen.)
+# --useTime=1 # Display time (s) every generation
+# --printBestStat=1 # Print Best/avg/stdev every gen.
+# --printPop=0 # Print sorted pop. every gen.
+
+######    Output - Disk    ######
+# --resDir=Res # Directory to store DISK outputs
+# --eraseDir=1 # erase files in dirName if any
+# --fileBestStat=0 # Output bes/avg/std to file
+
+######    Output - Graphical    ######
+# --plotBestStat=0 # Plot Best/avg Stat
+# --plotHisto=0 # Plot histogram of fitnesses
+
+######    Persistence    ######
+# --Load= # -L : A save file to restart from
+# --recomputeFitness=0 # -r : Recompute the fitness after re-loading the pop.?
+# --saveFrequency=0 # Save every F generation (0 = only final state, absent = never)
+# --saveTimeInterval=0 # Save every T seconds (0 or absent = never)
+# --status=OneMaxGenomeEA.status # Status file
+
+######    Stopping criterion    ######
+# --maxGen=100 # -G : Maximum number of generations () = none)
+# --steadyGen=100 # -s : Number of generations with no improvement
+# --minGen=0 # -g : Minimum number of generations
+# --maxEval=0 # -E : Maximum number of evaluations (0 = none)
+# --targetFitness=0 # -T : Stop when fitness reaches
+# --CtrlC=0 # -C : Terminate current generation upon Ctrl C
+
+######    Variation Operators    ######
+# --cross1Rate=1 # -1 : Relative rate for crossover 1
+# --mut1Rate=1 # -1 : Relative rate for mutation 1
+--pCross=\XOVER_PROB # -C : Probability of Crossover
+--pMut=\MUT_PROB # -M : Probability of Mutation
+
+\START_EO_MAKEFILE_TPL#*************************************
+#                                         
+#  EASEA.mak
+#                                         
+#  Makefile generated by AESAE-EO v0.7
+#                                         
+#*************************************
+
+# sample makefile for building an EA evolving a new genotype
+
+DIR_EO = \EO_DIR
+
+.cpp: ; c++  -DPACKAGE=\"eo\" -I. -I$(DIR_EO)/src -Wall -g  -o $@  $*.cpp $(DIR_EO)/src/libeo.a $(DIR_EO)/src/utils/libeoutils.a
+
+.cpp.o: ; c++ -DPACKAGE=\"eo\" -I. -I\EO_DIR/src -Wall -g -c $*.cpp
+
+LIB_EO = $(DIR_EO)/src/utils/libeoutils.a $(DIR_EO)/src/libeo.a
+
+SOURCES = EASEA.cpp \
+  EASEAEvalFunc.h \
+  EASEAGenome.h \
+  EASEAInit.h \
+  EASEAMutation.h \
+  EASEAQuadCrossover.h \
+  $(LIB_EO)
+
+ALL = EASEA
+
+EASEA : $(SOURCES)
+	c++ -g -I. -I$(DIR_EO)/src -o $@ EASEA.cpp $(LIB_EO) -lm 
+
+all : $(ALL)
+
+clean : ; /bin/rm  *.o $(ALL)
+
+\TEMPLATE_END
diff --git a/trunk/paradiseo-eo/tutorial/Templates/MakeSimple.tmpl b/trunk/paradiseo-eo/tutorial/Templates/MakeSimple.tmpl
new file mode 100644
index 000000000..85ddd69d6
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Templates/MakeSimple.tmpl
@@ -0,0 +1,28 @@
+# sample makefile for building an EA evolving a new genotype
+
+# START eventually modify the name of EO dir
+DIR_EO = ../../src
+# END eventually modify the name of EO dir
+LIB_EO = $(DIR_EO)/utils/libeoutils.a $(DIR_EO)/libeo.a
+
+.cpp: ; c++  -DPACKAGE=\"eo\" -DVERSION=\"0.9.3\" -I. -I$(DIR_EO) -Wall -Wno-deprecated -g  -o $@  $*.cpp $(LIB_EO)
+
+.cpp.o: ; c++ -DPACKAGE=\"eo\" -DVERSION=\"0.9.3\" -I. -I$(DIR_EO) -Wall -Wno-deprecated -g -c $*.cpp
+
+# local sources
+SOURCES = MyStructEA.cpp \
+   eoMyStruct.h \
+   eoMyStructEvalFunc.h \
+   eoMyStructInit.h \
+   eoMyStructMutation.h \
+   eoMyStructQuadCrossover.h
+
+MyStructEA : MyStructEA.cpp
+	c++ -I. -I$(DIR_EO) -Wno-deprecated -g -o $@ MyStructEA.cpp $(LIB_EO) -lm 
+
+tar : ; tar czvf MyStruct.tgz *.h *.cpp Makefile
+
+clean : ; /bin/rm  *.o MyStructEA
+
+########## local dependencies
+MyStructEA : $(SOURCES) 
diff --git a/trunk/paradiseo-eo/tutorial/Templates/Makefile.tmpl b/trunk/paradiseo-eo/tutorial/Templates/Makefile.tmpl
new file mode 100644
index 000000000..722a78dcc
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Templates/Makefile.tmpl
@@ -0,0 +1,48 @@
+# sample makefile for building an EA evolving a new genotype
+
+# START eventually modify the name of EO dir
+DIR_EO = ../../src
+# END eventually modify the name of EO dir
+
+# eo libs
+LIB_EO = $(DIR_EO)/utils/libeoutils.a $(DIR_EO)/libeo.a
+
+# implicit compile rules
+.SUFFIXES: .cpp
+.cpp: ; $(CXX)  -DPACKAGE=\"eo\" -DVERSION=\"0.9.3\" -I. -I$(DIR_EO) -Wall -g  -o $@  $*.cpp $(LIB_EO)
+
+.cpp.o: ; $(CXX) -DPACKAGE=\"eo\" -DVERSION=\"0.9.3\" -I. -I$(DIR_EO) -Wall -g -c $*.cpp
+
+# local sources
+COMMON_SOURCES =    eoMyStruct.h \
+   eoMyStructEvalFunc.h \
+   eoMyStructInit.h \
+   eoMyStructMutation.h \
+   eoMyStructQuadCrossover.h \
+   make_genotype_MyStruct.h \
+   make_op_MyStruct.h
+
+NO_LIB_SOURCES = MyStructEA.cpp
+
+LIB_SOURCES = MyStructLibEA.cpp make_MyStruct.cpp
+
+SOURCES = $(COMMON_SOURCES) MyStructEA.cpp MyStructLibEA.cpp make_MyStruct.cpp
+
+ALL = MyStructEA MyStructLibEA
+
+MyStructEA : MyStructEA.cpp
+	$(CXX) -I. -I$(DIR_EO) -g -o $@ MyStructEA.cpp $(LIB_EO) -lm 
+
+MyStructLibEA : MyStructLibEA.o make_MyStruct.o
+	$(CXX) -g -o $@ MyStructLibEA.o make_MyStruct.o $(LIB_EO) -lm
+
+tar : ; tar czvf MyStruct.tgz *.h *.cpp Makefile
+
+all : $(ALL)
+
+clean : ; /bin/rm  *.o $(ALL)
+
+########## local dependencies
+MyStructEA.cpp : $(COMMON_SOURCES) 
+MyStructLibEA.o : $(COMMON_SOURCES) MyStructLibEA.cpp
+make_MyStruct.o : make_MyStruct.cpp eoMyStruct.h 
diff --git a/trunk/paradiseo-eo/tutorial/Templates/MyStructEA.cpp b/trunk/paradiseo-eo/tutorial/Templates/MyStructEA.cpp
new file mode 100644
index 000000000..6b904a189
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Templates/MyStructEA.cpp
@@ -0,0 +1,188 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+The above line is usefulin Emacs-like editors
+ */
+
+/*
+Template for creating a new representation in EO
+================================================
+
+This is the template main file.
+It includes all other files that have been generated by the script create.sh
+so it is the only file to compile.
+
+In case you want to build up a separate library for your new Evolving Object,
+you'll need some work - follow what's done in the src/ga dir, used in the
+main file BitEA in tutorial/Lesson4 dir.
+Or you can wait until we do it :-)
+*/
+
+// Miscilaneous include and declaration 
+#include 
+using namespace std;
+
+// eo general include
+#include "eo"
+// the real bounds (not yet in general eo include)
+#include "utils/eoRealVectorBounds.h"
+
+// include here whatever specific files for your representation
+// Basically, this should include at least the following
+
+/** definition of representation: 
+ * class eoMyStruct MUST derive from EO for some fitness
+ */
+#include "eoMyStruct.h"
+
+/** definition of initilizqtion: 
+ * class eoMyStructInit MUST derive from eoInit
+ */
+#include "eoMyStructInit.h"
+
+/** definition of evaluation: 
+ * class eoMyStructEvalFunc MUST derive from eoEvalFunc
+ * and should test for validity before doing any computation
+ * see tutorial/Templates/evalFunc.tmpl
+ */
+#include "eoMyStructEvalFunc.h"
+
+// GENOTYPE   eoMyStruct ***MUST*** be templatized over the fitness
+
+//*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
+// START fitness type: double or eoMaximizingFitness if you are maximizing
+//                     eoMinimizingFitness if you are minimizing
+typedef eoMinimizingFitness MyFitT ;	// type of fitness 
+// END fitness type
+//*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
+
+// Then define your EO objects using that fitness type
+typedef eoMyStruct Indi;      // ***MUST*** derive from EO 
+
+// create an initializer
+#include "make_genotype_MyStruct.h"
+eoInit & make_genotype(eoParser& _parser, eoState&_state, Indi _eo)
+{
+  return do_make_genotype(_parser, _state, _eo);
+} 
+
+// and the variation operaotrs
+#include "make_op_MyStruct.h"
+eoGenOp&  make_op(eoParser& _parser, eoState& _state, eoInit& _init)
+{
+  return do_make_op(_parser, _state, _init);
+}
+
+// Use existing modules to define representation independent routines
+// These are parser-based definitions of objects
+
+// how to initialize the population 
+// it IS representation independent if an eoInit is given
+#include 
+eoPop&  make_pop(eoParser& _parser, eoState& _state, eoInit & _init)
+{
+  return do_make_pop(_parser, _state, _init);
+}
+
+// the stopping criterion
+#include 
+eoContinue& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter & _eval)
+{
+  return do_make_continue(_parser, _state, _eval);
+}
+
+// outputs (stats, population dumps, ...)
+#include 
+eoCheckPoint& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter& _eval, eoContinue& _continue) 
+{
+  return do_make_checkpoint(_parser, _state, _eval, _continue);
+}
+
+// evolution engine (selection and replacement)
+#include 
+eoAlgo&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc& _eval, eoContinue& _continue, eoGenOp& _op)
+{
+  return do_make_algo_scalar(_parser, _state, _eval, _continue, _op);
+}
+
+// simple call to the algo. stays there for consistency reasons 
+// no template for that one
+#include 
+// the instanciating fitnesses
+#include 
+void run_ea(eoAlgo& _ga, eoPop& _pop)
+{
+  do_run(_ga, _pop);
+}
+
+// checks for help demand, and writes the status file
+// and make_help; in libutils
+void make_help(eoParser & _parser);
+
+// now use all of the above, + representation dependent things
+int main(int argc, char* argv[])
+{
+
+  try
+  {
+  eoParser parser(argc, argv);  // for user-parameter reading
+
+  eoState state;    // keeps all things allocated
+
+    // The fitness
+    //////////////
+   eoMyStructEvalFunc plainEval/* (varType  _anyVariable) */;
+   // turn that object into an evaluation counter
+   eoEvalFuncCounter eval(plainEval);
+
+  // the genotype - through a genotype initializer
+  eoInit& init = make_genotype(parser, state, Indi());
+
+  // Build the variation operator (any seq/prop construct)
+  eoGenOp& op = make_op(parser, state, init);
+
+
+  //// Now the representation-independent things 
+  //
+  // YOU SHOULD NOT NEED TO MODIFY ANYTHING BEYOND THIS POINT
+  // unless you want to add specific statistics to the checkpoint
+  //////////////////////////////////////////////
+
+  // initialize the population
+  // yes, this is representation indepedent once you have an eoInit
+  eoPop& pop   = make_pop(parser, state, init);
+
+  // stopping criteria
+  eoContinue & term = make_continue(parser, state, eval);
+  // output
+  eoCheckPoint & checkpoint = make_checkpoint(parser, state, eval, term);
+  // algorithm (need the operator!)
+  eoAlgo& ga = make_algo_scalar(parser, state, eval, checkpoint, op);
+
+  ///// End of construction of the algorithm
+
+  /////////////////////////////////////////
+  // to be called AFTER all parameters have been read!!!
+  make_help(parser);
+
+  //// GO
+  ///////
+  // evaluate intial population AFTER help and status in case it takes time
+  apply(eval, pop);
+  // if you want to print it out
+//   cout << "Initial Population\n";
+//   pop.sortedPrintOn(cout);
+//   cout << endl;
+
+  run_ea(ga, pop); // run the ga
+
+  cout << "Final Population\n";
+  pop.sortedPrintOn(cout);
+  cout << endl;
+
+  }
+  catch(exception& e)
+  {
+    cout << e.what() << endl;
+  }
+  return 0;
+}
diff --git a/trunk/paradiseo-eo/tutorial/Templates/MyStructLibEA.cpp b/trunk/paradiseo-eo/tutorial/Templates/MyStructLibEA.cpp
new file mode 100644
index 000000000..24fed341d
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Templates/MyStructLibEA.cpp
@@ -0,0 +1,162 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+The above line is usefulin Emacs-like editors
+ */
+
+/*
+Template for creating a new representation in EO
+================================================
+
+This is the template main file for compiling after creating a
+"library", i.e. putting everything but the fitness in a separate file 
+(make_MyStruct.cpp) and compiling it once and for all.
+*/
+
+// Miscilaneous include and declaration 
+#include 
+using namespace std;
+
+// eo general include
+#include "eo"
+// the real bounds (not yet in general eo include)
+#include "utils/eoRealVectorBounds.h"
+
+// include here whatever specific files for your representation
+// Basically, this should include at least the following
+
+/** definition of representation: 
+ * class eoMyStruct MUST derive from EO for some fitness
+ */
+#include "eoMyStruct.h"
+
+/** definition of initilizqtion: 
+ * class eoMyStructInit MUST derive from eoInit
+ */
+#include "eoMyStructInit.h"
+
+/** definition of evaluation: 
+ * class eoMyStructEvalFunc MUST derive from eoEvalFunc
+ * and should test for validity before doing any computation
+ * see tutorial/Templates/evalFunc.tmpl
+ */
+#include "eoMyStructEvalFunc.h"
+
+// GENOTYPE   eoMyStruct ***MUST*** be templatized over the fitness
+
+//
+// START fitness type: double or eoMaximizingFitness if you are maximizing
+//                     eoMinimizingFitness if you are minimizing
+typedef eoMinimizingFitness MyFitT ;	// type of fitness 
+// END fitness type
+//
+
+// Then define your EO objects using that fitness type
+typedef eoMyStruct Indi;      // ***MUST*** derive from EO 
+
+// create an initializer - done here and NOT in make_MyStruct.cpp
+// because it is NOT representation independent
+#include "make_genotype_MyStruct.h"
+eoInit & make_genotype(eoParser& _parser, eoState&_state, Indi _eo)
+{
+  return do_make_genotype(_parser, _state, _eo);
+} 
+
+// same thing for the variation operaotrs
+#include "make_op_MyStruct.h"
+eoGenOp&  make_op(eoParser& _parser, eoState& _state, eoInit& _init)
+{
+  return do_make_op(_parser, _state, _init);
+}
+
+// The representation independent routines are simply declared here
+
+// how to initialize the population 
+// it IS representation independent if an eoInit is given
+eoPop&  make_pop(eoParser& _parser, eoState& _state, eoInit & _init);
+
+// the stopping criterion
+eoContinue& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter & _eval);
+
+// outputs (stats, population dumps, ...)
+eoCheckPoint& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter& _eval, eoContinue& _continue);
+
+// evolution engine (selection and replacement)
+eoAlgo&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc& _eval, eoContinue& _continue, eoGenOp& _op);
+
+// simple call to the algo. stays there for consistency reasons 
+// no template for that one
+void run_ea(eoAlgo& _ga, eoPop& _pop);
+
+// checks for help demand, and writes the status file
+// and make_help; in libutils - just a declaration, code in libeoutils.a
+void make_help(eoParser & _parser);
+
+// now use all of the above, + representation dependent things
+// from here on, no difference with eoMyStruct.cpp
+int main(int argc, char* argv[])
+{
+
+  try
+  {
+  eoParser parser(argc, argv);  // for user-parameter reading
+
+  eoState state;    // keeps all things allocated
+
+    // The fitness
+    //////////////
+   eoMyStructEvalFunc plainEval/* (varType  _anyVariable) */;
+   // turn that object into an evaluation counter
+   eoEvalFuncCounter eval(plainEval);
+
+  // the genotype - through a genotype initializer
+  eoInit& init = make_genotype(parser, state, Indi());
+
+  // Build the variation operator (any seq/prop construct)
+  eoGenOp& op = make_op(parser, state, init);
+
+
+  //// Now the representation-independent things 
+  //
+  // YOU SHOULD NOT NEED TO MODIFY ANYTHING BEYOND THIS POINT
+  // unless you want to add specific statistics to the checkpoint
+  //////////////////////////////////////////////
+
+  // initialize the population
+  // yes, this is representation indepedent once you have an eoInit
+  eoPop& pop   = make_pop(parser, state, init);
+
+  // stopping criteria
+  eoContinue & term = make_continue(parser, state, eval);
+  // output
+  eoCheckPoint & checkpoint = make_checkpoint(parser, state, eval, term);
+  // algorithm (need the operator!)
+  eoAlgo& ga = make_algo_scalar(parser, state, eval, checkpoint, op);
+
+  ///// End of construction of the algorithm
+
+  /////////////////////////////////////////
+  // to be called AFTER all parameters have been read!!!
+  make_help(parser);
+
+  //// GO
+  ///////
+  // evaluate intial population AFTER help and status in case it takes time
+  apply(eval, pop);
+  // if you want to print it out
+   cout << "Initial Population\n";
+   pop.sortedPrintOn(cout);
+   cout << endl;
+
+  run_ea(ga, pop); // run the ga
+
+  cout << "Final Population\n";
+  pop.sortedPrintOn(cout);
+  cout << endl;
+
+  }
+  catch(exception& e)
+  {
+    cout << e.what() << endl;
+  }
+  return 0;
+}
diff --git a/trunk/paradiseo-eo/tutorial/Templates/MyStructSEA.cpp b/trunk/paradiseo-eo/tutorial/Templates/MyStructSEA.cpp
new file mode 100644
index 000000000..0f18519a3
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Templates/MyStructSEA.cpp
@@ -0,0 +1,350 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+The above line is usefulin Emacs-like editors
+ */
+
+/*
+Template for creating a new representation in EO
+================================================
+
+This is the template main file.
+It includes all other files that have been generated by the script create.sh
+so it is the only file to compile.
+
+In case you want to build up a separate library for your new Evolving Object,
+you'll need some work - follow what's done in the src/ga dir, used in the
+main file BitEA in tutorial/Lesson4 dir.
+Or you can wait until we do it :-)
+*/
+
+// Miscilaneous include and declaration
+#include 
+using namespace std;
+
+// eo general include
+#include "eo"
+// the real bounds (not yet in general eo include)
+#include "utils/eoRealVectorBounds.h"
+
+// include here whatever specific files for your representation
+// Basically, this should include at least the following
+
+/** definition of representation:
+ * class eoMyStruct MUST derive from EO for some fitness
+ */
+#include "eoMyStruct.h"
+
+/** definition of initilizqtion:
+ * class eoMyStructInit MUST derive from eoInit
+ */
+#include "eoMyStructInit.h"
+
+/** definition of evaluation:
+ * class eoMyStructEvalFunc MUST derive from eoEvalFunc
+ * and should test for validity before doing any computation
+ * see tutorial/Templates/evalFunc.tmpl
+ */
+#include "eoMyStructEvalFunc.h"
+
+/** definitions of operators: write as many classes as types of operators
+ * and include them here. In this simple example,
+ * one crossover (2->2) and one mutation (1->1) operators are used
+ */
+#include "eoMyStructQuadCrossover.h"
+#include "eoMyStructMutation.h"
+
+/* and (possibly) your personal statistics */
+#include "eoMyStructStat.h"
+
+// GENOTYPE   eoMyStruct ***MUST*** be templatized over the fitness
+
+//*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
+// START fitness type: double or eoMaximizingFitness if you are maximizing
+//                     eoMinimizingFitness if you are minimizing
+typedef eoMinimizingFitness MyFitT ;	// type of fitness
+// END fitness type
+//*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
+
+// Then define your EO objects using that fitness type
+typedef eoMyStruct Indi;      // ***MUST*** derive from EO
+
+
+// Use existing modules to define representation independent routines
+
+// how to initialize the population
+// it IS representation independent if an eoInit is given
+#include 
+eoPop&  make_pop(eoParser& _parser, eoState& _state, eoInit & _init)
+{
+  return do_make_pop(_parser, _state, _init);
+}
+
+// the stopping criterion
+#include 
+eoContinue& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter & _eval)
+{
+  return do_make_continue(_parser, _state, _eval);
+}
+
+// outputs (stats, population dumps, ...)
+#include 
+eoCheckPoint& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter& _eval, eoContinue& _continue)
+{
+  return do_make_checkpoint(_parser, _state, _eval, _continue);
+}
+
+// evolution engine (selection and replacement)
+#include 
+eoAlgo&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc& _eval, eoContinue& _continue, eoGenOp& _op, eoDistance *_dist = NULL)
+{
+  return do_make_algo_scalar(_parser, _state, _eval, _continue, _op, _dist);
+}
+
+// simple call to the algo. stays there for consistency reasons
+// no template for that one
+#include 
+// the instanciating fitnesses
+#include 
+void run_ea(eoAlgo& _ga, eoPop& _pop)
+{
+  do_run(_ga, _pop);
+}
+
+// checks for help demand, and writes the status file
+// and make_help; in libutils
+void make_help(eoParser & _parser);
+
+// now use all of the above, + representation dependent things
+int main(int argc, char* argv[])
+{
+try
+  {
+    eoParser parser(argc, argv);  // for user-parameter reading
+
+    eoState state;    // keeps all things allocated
+
+    // The fitness
+    //////////////
+    eoMyStructEvalFunc plainEval/* (varType  _anyVariable) */;
+    // turn that object into an evaluation counter
+    eoEvalFuncCounter eval(plainEval);
+
+    // a genotype initializer
+    eoMyStructInit init;
+    // or, if you need some parameters, you might as well
+    // - write a constructor of the eoMyStructInit that uses a parser
+    // - call it from here:
+    //        eoMyStructInit init(parser);
+
+    // if you want to do sharing, you'll need a distance.
+    // see file utils/eoDistance.h
+    //
+    // IF you representation has an operator[]() double-castable,
+    // then you can use for instance the quadratic distance (L2 norm)
+    //    eoQuadDistance dist;
+    // or the Hamming distance (L1 norm)
+    // eoHammingDistance dist;
+
+
+    // Build the variation operator (any seq/prop construct)
+    // here, a simple example with only 1 crossover (2->2, a QuadOp) and
+    // one mutation, is given.
+    // Hints to have choice among multiple crossovers and mutations are given
+
+    // A (first) crossover (possibly use the parser in its Ctor)
+    eoMyStructQuadCrossover cross /* (eoParser parser) */;
+
+    // IF MORE THAN ONE:
+
+    // read its relative rate in the combination
+// double cross1Rate = parser.createParam(1.0, "cross1Rate", "Relative rate for crossover 1", '1', "Variation Operators").value();
+
+    // create the combined operator with the first one (rename it cross1 !!!)
+// eoPropCombinedQuadOp cross(cross1, cross1Rate);
+
+    // and as many as you want the following way:
+    // 1- write the new class by mimicking eoMyStructQuadCrossover.h
+    // 2- include that file here together with eoMyStructQuadCrossover above
+    // 3- uncomment and duplicate the following lines:
+    //
+// eoMyStructSecondCrossover cross2(eoParser parser);
+// double cross2Rate = parser.createParam(1.0, "cross2Rate", "Relative rate for crossover 2", '2', "Variation Operators").value();
+// cross.add(cross2, cross2Rate);
+
+  // NOTE: if you want some gentle output, the last one shoudl be like
+  //  cross.add(cross, crossXXXRate, true);
+
+    /////////////// Same thing for MUTATION
+
+  // a (first) mutation   (possibly use the parser in its Ctor)
+  eoMyStructMutation mut /* (parser) */;
+
+    // IF MORE THAN ONE:
+
+    // read its relative rate in the combination
+// double mut1Rate = parser.createParam(1.0, "mut1Rate", "Relative rate for mutation 1", '1', "Variation Operators").value();
+
+    // create the combined operator with the first one (rename it cross1 !!!)
+// eoPropCombinedMonOp mut(mut1, mut1Rate);
+
+    // and as many as you want the following way:
+    // 1- write the new class by mimicking eoMyStructMutation.h
+    // 2- include that file here together with eoMyStructMutation above
+    // 3- uncomment and duplicate the following lines:
+    //
+// eoMyStructSecondMutation mut2(eoParser parser);
+// double mut2Rate = parser.createParam(1.0, "mut2Rate", "Relative rate for mutation 2", '2', "Variation Operators").value();
+// mut.add(mut2, mut2Rate);
+
+  // NOTE: if you want some gentle output, the last one shoudl be like
+  //  mut.add(mut, mutXXXRate, true);
+
+  // now encapsulate your crossover(s) and mutation(s) into an eoGeneralOp
+  // so you can fully benefit of the existing evolution engines
+
+  // First read the individual level parameters
+    double pCross = parser.createParam(0.6, "pCross", "Probability of Crossover", 'C', "Variation Operators" ).value();
+    // minimum check
+    if ( (pCross < 0) || (pCross > 1) )
+      throw runtime_error("Invalid pCross");
+
+    double pMut = parser.createParam(0.1, "pMut", "Probability of Mutation", 'M', "Variation Operators" ).value();
+    // minimum check
+    if ( (pMut < 0) || (pMut > 1) )
+      throw runtime_error("Invalid pMut");
+
+    // now create the generalOp
+    eoSGAGenOp op(cross, pCross, mut, pMut);
+
+
+    //// Now some representation-independent things
+    //
+    // You do not need to modify anything beyond this point
+    // unless you want to add specific statistics to the checkpoint
+    // in which case you should uncomment the corresponding block
+    // and possibly modify the parameters in the stat object creation
+    //////////////////////////////////////////////
+
+  // initialize the population
+  // yes, this is representation indepedent once you have an eoInit
+  eoPop& pop   = make_pop(parser, state, init);
+
+  // stopping criteria
+  eoContinue & term = make_continue(parser, state, eval);
+  // output
+  eoCheckPoint & checkpoint = make_checkpoint(parser, state, eval, term);
+
+
+  // UNCOMMENT the following commented block if you want to add you stats
+
+  // if uncommented, it is assumed that you will want to print some stat.
+  // if not, then the following objects will be created uselessly - but what the heck!
+
+  eoMyStructStat   myStat;       // or maybe myStat(parser);
+  checkpoint.add(myStat);
+  // This one is probably redundant with the one in make_checkpoint, but w.t.h.
+  eoIncrementorParam generationCounter("Gen.");
+  checkpoint.add(generationCounter);
+  // need to get the name of the redDir param (if any)
+  std::string dirName =  parser.getORcreateParam(std::string("Res"), "resDir", "Directory to store DISK outputs", '\0', "Output - Disk").value() + "/";
+
+
+  // those need to be pointers because of the if's
+  eoStdoutMonitor *myStdOutMonitor;
+  eoFileMonitor   *myFileMonitor;
+#ifdef HAVE_GNUPLOT
+  eoGnuplot1DMonitor *myGnuMonitor;
+#endif
+
+  // now check how you want to output the stat:
+  bool printMyStructStat = parser.createParam(false, "coutMyStructStat", "Prints my stat to screen, one line per generation", '\0', "My application").value();
+  bool fileMyStructStat = parser.createParam(false, "fileMyStructStat", "Saves my stat to file (in resDir", '\0', "My application").value();
+  bool plotMyStructStat = parser.createParam(false, "plotMyStructStat", "On-line plots my stat using gnuplot", '\0', "My application").value();
+
+  // should we write it on StdOut ?
+  if (printMyStructStat)
+    {
+      myStdOutMonitor = new eoStdoutMonitor(false);
+      // don't forget to store the memory in the state
+      state.storeFunctor(myStdOutMonitor);
+      // and of course to add the monitor to the checkpoint
+      checkpoint.add(*myStdOutMonitor);
+      // and the different fields to the monitor
+      myStdOutMonitor->add(generationCounter);
+      myStdOutMonitor->add(eval);
+      myStdOutMonitor->add(myStat);
+    }
+
+  // first check the directory (and creates it if not exists already):
+  if (fileMyStructStat || plotMyStructStat)
+      if (! testDirRes(dirName, true) )
+	throw runtime_error("Problem with resDir");
+
+  // should we write it to a file ?
+  if (fileMyStructStat)
+    {
+      // the file name is hard-coded - of course you can read
+      // a string parameter in the parser if you prefer
+      myFileMonitor = new eoFileMonitor(dirName + "myStat.xg");
+      // don't forget to store the memory in the state
+      state.storeFunctor(myFileMonitor);
+      // and of course to add the monitor to the checkpoint
+      checkpoint.add(*myFileMonitor);
+      // and the different fields to the monitor
+      myFileMonitor->add(generationCounter);
+      myFileMonitor->add(eval);
+      myFileMonitor->add(myStat);
+    }
+
+#ifdef HAVE_GNUPLOT
+  // should we PLOT it on StdOut ? (one dot per generation, incremental plot)
+  if (plotMyStructStat)
+    {
+      myGnuMonitor = new eoGnuplot1DMonitor(dirName+"plot_myStat.xg",minimizing_fitness());
+      // NOTE: you cand send commands to gnuplot at any time with the method
+      // myGnuMonitor->gnuplotCommand(string)
+      // par exemple, gnuplotCommand("set logscale y")
+
+      // don't forget to store the memory in the state
+      state.storeFunctor(myGnuMonitor);
+      // and of course to add the monitor to the checkpoint
+      checkpoint.add(*myGnuMonitor);
+      // and the different fields to the monitor (X = eval, Y = myStat)
+      myGnuMonitor->add(eval);
+      myGnuMonitor->add(myStat);
+    }
+#endif
+
+  // algorithm (need the operator!)
+  eoAlgo& ga = make_algo_scalar(parser, state, eval, checkpoint, op);
+  // and the distance if you want to do sharing
+  // eoAlgo& ga = make_algo_scalar(parser, state, eval, checkpoint, op, &dist);
+
+  ///// End of construction of the algorithm
+
+  /////////////////////////////////////////
+  // to be called AFTER all parameters have been read!!!
+  make_help(parser);
+
+  //// GO
+  ///////
+  // evaluate intial population AFTER help and status in case it takes time
+  apply(eval, pop);
+  // if you want to print it out
+//   cout << "Initial Population\n";
+//   pop.sortedPrintOn(cout);
+//   cout << endl;
+
+  run_ea(ga, pop); // run the ga
+
+  cout << "Final Population\n";
+  pop.sortedPrintOn(cout);
+  cout << endl;
+
+  }
+  catch(exception& e)
+  {
+    cout << e.what() << endl;
+  }
+  return 0;
+}
diff --git a/trunk/paradiseo-eo/tutorial/Templates/README b/trunk/paradiseo-eo/tutorial/Templates/README
new file mode 100644
index 000000000..d0904df8d
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Templates/README
@@ -0,0 +1,149 @@
+Quick NOTE: This version of README is obsolete (May 25, 2004)
+In particular, a simpler version of the algorithm can be generated
+using the script 
+                   createSimple
+
+with the same syntax. It is also more powerful, allowing for instance
+to create you own statistics on the population, saving it in a file
+and/or plotting on on-line during the run (see eoStat.tmpl).
+More details some day, when I have some time ...
+
+============= Old README (most is still accurate, though) ==========
+
+This directory contains sample files that should make it easy to
+create an EO algorithm to evolve any type of structure 
+(EO comes with two examples, bitstrings and vector of real variables,
+so you'll need this as soon as you want to evolve something else).
+
+At the moment, only algorithms involving a scalar fitness (double)
+are implemented (see test dir for Pareto optimization of multiple-
+objective fitness - or be patient :-)
+
+This file will help you to build the same algorithm than the ones 
+in the Lesson4 of the tutorial, but with YOUR genotype instead of
+bitstrings or vector. More details in Lesson5 of the tutorial.
+
+It is assumed in the following that you have read the first part of
+the tutorial (Lessons 1 to 4).
+
+Creating the algorithm for your genotype
+----------------------------------------
+In what follows, we will suppose that you want to evolve some data
+structure, and that you have enough programming skills to be able to
+write C code for its random initilialization, its crossover, its
+mutation and the computation of its fitness.
+
+The helper script * create.sh * will create for you the files you need
+from the samples in tutorial/Templates dir, and all you'll have to do
+is to include the actual code where indicated in those files (between
+keywords START and END). 
+
+First, let's choose a name: let's call the new EO class eoAppli.
+All newly created classes will be named eoAppliXXX (in the file
+eoAppliXXX)
+
+1- cd to the tutorial dir
+
+2- create the directory for your application (let's assume you call it
+APPLICATION): type in
+
+            mkdir APPLICATION
+
+3- go to the Templates dir 
+
+            cd Templates
+
+and run the helper script create.sh with the following arguments 
+
+            ./create.sh Appli ../APPLICATION
+
+4- cd to the APPLICATION dir (cd ../APPLICATION). 
+You should see there the following files:
+   AppliEA.cpp            the main file, includes all other, to be compiled
+   Makefile               with default target eoAppliEA
+   eoAppli.h              class eoAppli, FitT = template fitness
+   eoAppliEvalFunc.h      class for the computation of fotness
+   eoAppliInit.h          class for genotype initlialization
+   eoAppliMutation.h      class for mutation 
+   eoAppliQuadCrossover.h class for (quadratic) crossover
+   make_genotype_Appli.h  helper function that create the initializer
+   make_op_Appli.h        helper function that creates the variatin operators
+
+Note: You can go directly to step 6 and 7: you'll get a lot of
+warnings, but will be able to run an EA that does nothing!
+
+5- Edit those files to suit your needs. The minimal addition you'll need
+to make are
+   in eoAppli.h              define your genotype
+   in eoAppliInit.h          define the initialization of one genotype
+   in eoAppliMutation.h      define the mutation of one genotype
+   in eoAppliQuadCrossover.h define the crossover of 2 genotypes
+
+HINT: look for keywords START and END and modify code in between.
+
+6- Compile eoAppliEA.cpp. If your APPLICATION dir is in the tutorial
+dir, you don't need to modify Makefile. Just type in
+
+               % make
+
+7- Run the resulting program:
+
+               % eoAppliEA
+
+The default output is one line per generation with the generation
+number, the number of evaluations performed, the best and average
+fitnesses in the population.
+The algorithm stops by default after 100 generations.
+
+8- Customize the parameters: copy eoAppliEA.status into
+e.g. eoAppliEA.param, edit eoAppliEA.param (uncomment the lines you
+want to become active), and run
+
+               % eoAppliEA @eoAppliEA.param
+
+(see the Lesson 5 of the tutorial for more details now).
+
+HINTS
+-----
+
+1- If some new classes you create require some user parameter, you can
+either read them in the file where they are created (e.g.
+make_op_Appli.h for variation operators), or pass the eoParser to the
+constructor of the class, and read the parameter from the parser.
+
+2- If you stick to privacy for the data in your EO class, you will
+probably need to write accessors to those data, as well as some public
+methods to modify them, as soon as some other methods need them too.
+
+3- The sample make_op_Appli.h supposes that you ony have one crossover
+and one mutation operator. However, the code for multiple operators is
+there: you can have for instance 2 crossover operators, and choose
+among them according to relative weights (proportional choice) - same
+for mutation. Look at the operator section in eoAppliEA.cpp In
+particular, the user parameters cross1Rate and mut1Rate are totally
+useless for a single operator.
+
+To add another operator, you have to create another class by mimicking
+what has been done for the first operator.
+For instance, let's suppose you want to create another mutation.
+
+* duplicate the code for eoAppliMutation class 
+* in the second version, change the class name (eoAppliMutation) into
+another name (let's say eoAppliBetterMutation) - you must change the
+name in the class declaration, in the constructor and in the
+className() method.
+* in the new eoAppliBetterMutation class, change the code for the
+operator() - and eventually the code for the constructor.
+* in the make_op_Appli.h file, in the mutation section, uncomment the 
+lines 
+      mut = new eoAppliSecondMutation(varType  _anyVariable);
+      _state.storeFunctor(mut);
+      double mut2Rate = _parser.createParam(1.0, "mut2Rate", "Relative rate for mutation 2", '2', "Variation Operators").value(); 
+       propMutation.add(*mut, mut2Rate); 
+
+and change the name of the class from eoAppliSecondMutation to your
+name eoAppliBetterMutation (you can also change the keyword from
+mut2Rate to something more meaningful like BetterMutationRate).
+You're done!
+
+In case of problem: Marc.Schoenauer@inria.fr
diff --git a/trunk/paradiseo-eo/tutorial/Templates/binCrossover.tmpl b/trunk/paradiseo-eo/tutorial/Templates/binCrossover.tmpl
new file mode 100644
index 000000000..5adabe688
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Templates/binCrossover.tmpl
@@ -0,0 +1,70 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+The above line is useful in Emacs-like editors
+ */
+
+/*
+Template for simple binary crossover operators
+==============================================
+
+Binary crossover operators modify the first genotype only, 
+based on the second 
+*/
+
+#ifndef eoMyStructBinCrossover_H
+#define eoMyStructBinCrossover_H
+
+#include 
+
+/** 
+ *  Always write a comment in this format before class definition
+ *  if you want the class to be documented by Doxygen
+ *
+ * THere is NO ASSUMPTION on the class GenoypeT.
+ * In particular, it does not need to derive from EO
+ */
+template 
+class eoMyStructBinCrossover: public eoBinOp
+{
+public:
+  /**
+   * Ctor - no requirement
+   */
+// START eventually add or modify the anyVariable argument
+  eoMyStructBinCrossover() 
+  //  eoMyStructBinCrossover( varType  _anyVariable) : anyVariable(_anyVariable) 
+// END eventually add or modify the anyVariable argument
+  {
+    // START Code of Ctor of an eoMyStructEvalFunc object
+    // END   Code of Ctor of an eoMyStructEvalFunc object
+  }
+
+  /// The class name. Used to display statistics
+  string className() const { return "eoMyStructBinCrossover"; }
+
+  /**
+   * binCrossover - modifies first genotype only
+   * @param _genotype1 The first genotype
+   * @param _genotype2 The second genotype - const
+   */
+  bool operator()(GenotypeT & _genotype1, const GenotypeT & _genotype2) 
+  {
+    // START code for crossover of _genotype1 and _genotype2 objects
+
+       /** Requirement
+	* if _genotype1 has been modified
+	*     return true;
+	* otherwise
+	*     return false;
+	*/
+
+    // END code for crossover of _genotype1 and _genotype2 objects
+  }
+
+private:
+// START Private data of an eoMyStructBinCrossover object
+  //  varType anyVariable;		   // for example ...
+// END   Private data of an eoMyStructBinCrossover object
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/tutorial/Templates/continue.tmpl b/trunk/paradiseo-eo/tutorial/Templates/continue.tmpl
new file mode 100644
index 000000000..2ec5a7be8
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Templates/continue.tmpl
@@ -0,0 +1,65 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+The above line is usefulin Emacs-like editors
+ */
+
+/*
+Template for continuator in EO, i.e. stopping conditions for EO algorithms
+==========================================================================
+*/
+
+#ifndef _eoMyStructContinue_h
+#define _eoMyStructContinue_h
+
+// include the base definition of eoContinue
+#include 
+
+/** 
+ *  Always write a comment in this format before class definition
+ *  if you want the class to be documented by Doxygen
+ *
+ * ATTENTION, class EOT *must* derive from EO, as operator() will 
+ * be called with an eoPop
+ */
+template< class EOT>
+class eoMyStructContinue: public eoContinue {
+public:
+  /**
+   * Ctor - no requirement
+   */
+// START eventually add or modify the anyVariable argument
+  eoMyStructContinue()
+  //  eoMyStructBinCrossover( varType  _anyVariable) : anyVariable(_anyVariable) 
+// END eventually add or modify the anyVariable argument
+  {
+    // START Code of Ctor of an eoMyStructEvalFunc object
+    // END   Code of Ctor of an eoMyStructEvalFunc object
+  }
+
+
+  /** Returns false when you want to stop
+   *
+   * @param _pop an eoPop
+   */
+  virtual bool operator() ( const eoPop& _pop ) 
+    {
+      bool stopCondition ; // to store the stopping condition
+    // START Code of computation of stopping condition
+	// stopCondition = blablabla
+    // END   Code of computation of stopping condition
+      if (stopCondition) // the algo will stop upon return FALSE
+	{
+	  cout << "STOP in eoMyStructContinue \n";
+	  return false;
+	}
+      return true;		   // == do not stop
+    }
+
+private:
+// START Private data of an eoMyStructContinue object
+  //  varType anyVariable;		   // for example ...
+// END   Private data of an eoMyStructContinue object
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/tutorial/Templates/create.sh b/trunk/paradiseo-eo/tutorial/Templates/create.sh
new file mode 100755
index 000000000..25aa1bd3d
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Templates/create.sh
@@ -0,0 +1,62 @@
+#! /bin/tcsh -f
+if ($PWD:t != Templates) then
+    echo You must be in the Template dir to run that script
+    exit
+endif
+
+if ($#argv < 1) then
+    echo "Usage $0 ApplicationName [TargetDirName]"
+    echo "    will create ../TargetDirName if necessary"
+    echo "    (default dir name = ApplicationName)," 
+    echo "    and will put there all files that are strictly necessary"
+    echo "    to compile and run you Application from there"
+    exit
+endif
+
+echo " "   # we're going to do something
+
+if ($#argv == 1) then
+    set TargetDir = ../$1
+else
+    set TargetDir = ../$2
+endif
+
+if (! -e $TargetDir) then
+    mkdir $TargetDir
+endif
+
+if ( (-f $TargetDir/eo$1.h) || (-f $TargetDir/eo$1Init.h) || (-f $TargetDir/eo$1EvalFunc.h) || (-f $TargetDir/eo$1Mutation.h) || (-f $TargetDir/eo$1QuadCrossover.h) || (-f $TargetDir/$1EA.cpp) || (-f $TargetDir/make_genotype_$1.h) || (-f $TargetDir/make_op_$1.h) ) then
+    echo WARNING: some files already exist there. 
+    echo -n "Overwrite ALL (yes/no)? "
+    set REP = $<
+    if ($REP != "yes") then
+       echo Nothing done!
+       exit
+    endif
+endif
+
+if (-f $TargetDir/Makefile) then
+    echo A Makefile already exists there.
+    echo I'm creating Makefile.$1. You'll have to merge them both, 
+    echo OR to call make -f Makefile.$1
+    set MakeName = Makefile.$1
+else
+    set MakeName = Makefile
+endif
+
+echo Creating source files for application $1 in $TargetDir/
+
+sed s/MyStruct/$1/g eoMyStruct.tmpl > $TargetDir/eo$1.h
+sed s/MyStruct/$1/g init.tmpl > $TargetDir/eo$1Init.h
+sed s/MyStruct/$1/g evalFunc.tmpl > $TargetDir/eo$1EvalFunc.h
+sed s/MyStruct/$1/g mutation.tmpl > $TargetDir/eo$1Mutation.h
+sed s/MyStruct/$1/g quadCrossover.tmpl > $TargetDir/eo$1QuadCrossover.h
+sed s/MyStruct/$1/g MyStructEA.cpp > $TargetDir/$1EA.cpp
+sed s/MyStruct/$1/g make_genotype_MyStruct.h > $TargetDir/make_genotype_$1.h
+sed s/MyStruct/$1/g make_op_MyStruct.h > $TargetDir/make_op_$1.h
+sed s/MyStruct/$1/g make_MyStruct.cpp > $TargetDir/make_$1.cpp
+sed s/MyStruct/$1/g MyStructLibEA.cpp > $TargetDir/$1LibEA.cpp
+sed s/MyStruct/$1/g Makefile.tmpl > $TargetDir/$MakeName
+
+echo Done!
+
diff --git a/trunk/paradiseo-eo/tutorial/Templates/createSimple b/trunk/paradiseo-eo/tutorial/Templates/createSimple
new file mode 100755
index 000000000..9d7184754
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Templates/createSimple
@@ -0,0 +1,59 @@
+#! /bin/tcsh -f
+if ($PWD:t != Templates) then
+    echo You must be in the Template dir to run that script
+    exit
+endif
+
+if ($#argv < 1) then
+    echo "Usage $0 ApplicationName [TargetDirName]"
+    echo "    will create ../TargetDirName if necessary"
+    echo "    (default dir name = ApplicationName)," 
+    echo "    and will put there all files that are strictly necessary"
+    echo "    to compile and run you Application from there"
+    exit
+endif
+
+echo " "   # we're going to do something
+
+if ($#argv == 1) then
+    set TargetDir = ../$1
+else
+    set TargetDir = ../$2
+endif
+
+if (! -e $TargetDir) then
+    mkdir $TargetDir
+endif
+
+if ( (-f $TargetDir/eo$1.h) || (-f $TargetDir/eo$1Init.h) || (-f $TargetDir/eo$1EvalFunc.h) || (-f $TargetDir/eo$1Mutation.h) || (-f $TargetDir/eo$1QuadCrossover.h) || (-f $TargetDir/$1EA.cpp) || (-f $TargetDir/make_genotype_$1.h) || (-f $TargetDir/make_op_$1.h) ) then
+    echo WARNING: some files already exist there. 
+    echo -n "Overwrite ALL (yes/no)? "
+    set REP = $<
+    if ($REP != "yes") then
+       echo Nothing done!
+       exit
+    endif
+endif
+
+if (-f $TargetDir/Makefile) then
+    echo A Makefile already exists there.
+    echo "I'm creating Makefile.$1. You'll have to merge them both," 
+    echo OR to call make -f Makefile.$1
+    set MakeName = Makefile.$1
+else
+    set MakeName = Makefile
+endif
+
+echo Creating source files for application $1 in $TargetDir/
+
+sed s/MyStruct/$1/g eoMyStruct.tmpl > $TargetDir/eo$1.h
+sed s/MyStruct/$1/g init.tmpl > $TargetDir/eo$1Init.h
+sed s/MyStruct/$1/g stat.tmpl > $TargetDir/eo$1Stat.h
+sed s/MyStruct/$1/g evalFunc.tmpl > $TargetDir/eo$1EvalFunc.h
+sed s/MyStruct/$1/g mutation.tmpl > $TargetDir/eo$1Mutation.h
+sed s/MyStruct/$1/g quadCrossover.tmpl > $TargetDir/eo$1QuadCrossover.h
+sed s/MyStruct/$1/g MyStructSEA.cpp > $TargetDir/$1EA.cpp
+sed s/MyStruct/$1/g MakeSimple.tmpl > $TargetDir/$MakeName
+
+echo Done!
+
diff --git a/trunk/paradiseo-eo/tutorial/Templates/eoMyStruct.tmpl b/trunk/paradiseo-eo/tutorial/Templates/eoMyStruct.tmpl
new file mode 100644
index 000000000..ddf4e0089
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Templates/eoMyStruct.tmpl
@@ -0,0 +1,118 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+The above line is usefulin Emacs-like editors
+ */
+
+/*
+Template for creating a new representation in EO
+================================================
+
+Mandatory:
+- a default constructor (constructor without any argument)
+- the I/O functions (readFrom and printOn)
+
+However, if you are using dynamic memory, there are 2 places
+to allocate it: the default constructor (if possible?), or, more in
+the EO spirit, the eoInit object, that you will need to write anyway
+(template file init.tmpl). 
+
+But remember that a COPY CONSTRUCTOR will be used in many places in EO,
+so make sure that the default copy constructor works, or, even better,
+do write your own if in doubt. 
+And of course write the corresponding destructor!
+
+*/
+
+#ifndef _eoMyStruct_h
+#define _eoMyStruct_h
+
+/** 
+ *  Always write a comment in this format before class definition
+ *  if you want the class to be documented by Doxygen
+
+ * Note that you MUST derive your structure from EO
+ * but you MAY use some other already prepared class in the hierarchy
+ * like eoVector for instance, if you handle a vector of something....
+
+ * If you create a structure from scratch,
+ * the only thing you need to provide are 
+ *        a default constructor
+ *        IO routines printOn and readFrom
+ *
+ * Note that operator<< and operator>> are defined at EO level
+ * using these routines
+ */
+template< class FitT>
+class eoMyStruct: public EO {
+public:
+  /** Ctor: you MUST provide a default ctor.
+   * though such individuals will generally be processed 
+   * by some eoInit object
+   */
+  eoMyStruct() 
+  { 
+    // START Code of default Ctor of an eoMyStruct object
+    // END   Code of default Ctor of an eoMyStruct object
+  }
+
+  /** Copy Ctor: you MUST provide a copy ctor if the default
+   * one is not what you want
+   * If this is the case, uncomment and fill the following
+   */
+  /*
+  eoMyStruct(const eoMyStruct &) 
+  {  
+    // START Code of copy Ctor of an eoMyStruct object
+    // END   Code of copy Ctor of an eoMyStruct object
+  } 
+  */
+
+
+  virtual ~eoMyStruct()
+  {
+    // START Code of Destructor of an eoEASEAGenome object
+    // END   Code of Destructor of an eoEASEAGenome object
+  }
+
+  virtual string className() const { return "eoMyStruct"; }
+
+  /** printing... */
+    void printOn(ostream& os) const
+    {
+      // First write the fitness
+      EO::printOn(os);
+      os << ' ';
+    // START Code of default output 
+
+	/** HINTS
+	 * in EO we systematically write the sizes of things before the things
+	 * so readFrom is easier to code (see below)
+	 */
+
+    // END   Code of default output
+    }
+
+  /** reading... 
+   * of course, your readFrom must be able to read what printOn writes!!!
+   */
+    void readFrom(istream& is)
+      {
+	// of course you should read the fitness first!
+	EO::readFrom(is);
+    // START Code of input
+
+	/** HINTS
+	 * remember the eoMyStruct object will come from the default ctor
+	 * this is why having the sizes written out is useful
+	 */
+
+    // END   Code of input
+      }
+
+private:			   // put all data here
+    // START Private data of an eoMyStruct object
+    // END   Private data of an eoMyStruct object
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/tutorial/Templates/evalFunc.tmpl b/trunk/paradiseo-eo/tutorial/Templates/evalFunc.tmpl
new file mode 100644
index 000000000..b8c9f1ed7
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Templates/evalFunc.tmpl
@@ -0,0 +1,65 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+ 
+The above line is usefulin Emacs-like editors
+ */
+ 
+/*
+Template for evaluator in EO, a functor that computes the fitness of an EO
+==========================================================================
+*/
+ 
+#ifndef _eoMyStructEvalFunc_h
+#define _eoMyStructEvalFunc_h
+
+// include whatever general include you need
+#include 
+#include 
+
+// include the base definition of eoEvalFunc
+#include "eoEvalFunc.h"
+
+/** 
+  Always write a comment in this format before class definition
+  if you want the class to be documented by Doxygen
+*/
+template 
+class eoMyStructEvalFunc : public eoEvalFunc
+{
+public:
+	/// Ctor - no requirement
+// START eventually add or modify the anyVariable argument
+  eoMyStructEvalFunc()
+  //  eoMyStructEvalFunc( varType  _anyVariable) : anyVariable(_anyVariable) 
+// END eventually add or modify the anyVariable argument
+  {
+    // START Code of Ctor of an eoMyStructEvalFunc object
+    // END   Code of Ctor of an eoMyStructEvalFunc object
+  }
+
+  /** Actually compute the fitness
+   *
+   * @param EOT & _eo the EO object to evaluate
+   *                  it should stay templatized to be usable 
+   *                  with any fitness type
+   */
+  void operator()(EOT & _eo)
+  {
+    // test for invalid to avoid recomputing fitness of unmodified individuals
+    if (_eo.invalid())
+      {
+	double fit;		   // to hold fitness value
+    // START Code of computation of fitness of the eoMyStruct object
+	// fit = blablabla
+    // END   Code of computation of fitness of the eoMyStruct object
+	_eo.fitness(fit);
+      }
+  }
+
+private:
+// START Private data of an eoMyStructEvalFunc object
+  //  varType anyVariable;		   // for example ...
+// END   Private data of an eoMyStructEvalFunc object
+};
+
+
+#endif
diff --git a/trunk/paradiseo-eo/tutorial/Templates/init.tmpl b/trunk/paradiseo-eo/tutorial/Templates/init.tmpl
new file mode 100644
index 000000000..f3c0fbd94
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Templates/init.tmpl
@@ -0,0 +1,58 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+The above line is usefulin Emacs-like editors
+ */
+
+/*
+Template for EO objects initialization in EO
+============================================
+*/
+
+#ifndef _eoMyStructInit_h
+#define _eoMyStructInit_h
+
+// include the base definition of eoInit
+#include 
+
+/** 
+ *  Always write a comment in this format before class definition
+ *  if you want the class to be documented by Doxygen
+ *
+ * There is NO ASSUMPTION on the class GenoypeT.
+ * In particular, it does not need to derive from EO (e.g. to initialize 
+ *    atoms of an eoVector you will need an eoInit)
+ */
+template 
+class eoMyStructInit: public eoInit {
+public:
+	/// Ctor - no requirement
+// START eventually add or modify the anyVariable argument
+  eoMyStructInit()
+  //  eoMyStructInit( varType  _anyVariable) : anyVariable(_anyVariable) 
+// END eventually add or modify the anyVariable argument
+  {
+    // START Code of Ctor of an eoMyStructInit object
+    // END   Code of Ctor of an eoMyStructInit object
+  }
+
+
+  /** initialize a genotype
+   *
+   * @param _genotype  generally a genotype that has been default-constructed
+   *                   whatever it contains will be lost
+   */
+  void operator()(GenotypeT & _genotype)
+  {
+    // START Code of random initialization of an eoMyStruct object
+    // END   Code of random initialization of an eoMyStruct object
+    _genotype.invalidate();	   // IMPORTANT in case the _genotype is old
+  }
+
+private:
+// START Private data of an eoMyStructInit object
+  //  varType anyVariable;		   // for example ...
+// END   Private data of an eoMyStructInit object
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/tutorial/Templates/lessOffspringExternalSelectorGenOp.tmpl b/trunk/paradiseo-eo/tutorial/Templates/lessOffspringExternalSelectorGenOp.tmpl
new file mode 100644
index 000000000..9a0c3c426
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Templates/lessOffspringExternalSelectorGenOp.tmpl
@@ -0,0 +1,81 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+The above line is usefulin Emacs-like editors
+ */
+
+/*
+Template for general operators
+===============================
+i.e. that takes any number of parents and generates any number of offspring
+
+a GenOp that creates less offspring than there are parents
+
+Second version, get parents  using an external eoSelectOne 
+*/
+
+#ifndef eoLessOffspringExternalSelectorGenOp_H
+#define eoLessOffspringExternalSelectorGenOp_H
+
+#include 
+
+/** 
+ *  Always write a comment in this format before class definition
+ *  if you want the class to be documented by Doxygen
+ *
+ * ATTENTION, class EOT *must* derive from EO, as method invalidate() 
+ * must be called if the genotypes of the indis is modified
+ */
+template 
+class eoLessOffspringExternalSelectorGenOp: public eoGenOp
+{
+public:
+  /**
+   * (Default) Constructor.
+   */
+  eoLessOffspringExternalSelectorGenOp(eoSelectOne & _sel, paramType _anyParameter) : 
+    sel(_sel), anyParameter(_anyParameter) {}
+
+  /// The class name. Used to display statistics
+  string className() const { return "eoLessOffspringExternalSelectorGenOp"; }
+
+  /// The TOTAL number of offspring (here = nb of parents modified in place)
+  unsigned max_production(void) { return NbLeftParents; }
+
+  /**
+   * eoShrinkGen operator - modifies some parents in the populator
+   *     using extra "parents" selected from an external selector
+   *
+   * @param _pop a POPULATOR (not a simple population)
+   */
+    void apply(eoPopulator& _plop)
+    {
+     // First, select as many parents as you will have offspring
+      EOT& parent1 = *_plop; // select the first parent
+      ++_plop;          // advance once for each selected parents
+      ...
+      EOT& parentN = *_plop; // say you want N offspring
+
+      // get extra parents - use private selector
+      // _plop.source() is the eoPop used by _plop to get parents
+      // WARNING: you are not allowed to modify them (mandatory "const")
+      const EOT& parentN+1 = sel(_plop.source());  
+      ... 
+      const EOT& parentN+K = sel(_plop.source());  
+
+      // modify (in place) the "true" parents 
+      // (i.e. parent1, ..., parentsN)
+      ...
+
+      // invalidate fitnesses of modified parents
+      parent1.invalidate();
+      ...
+      parentN.invalidate();
+    }
+
+
+private:
+	eoSelectOne & sel;
+  paramType anyParameter
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/tutorial/Templates/lessOffspringSameSelectorGenOp.tmpl b/trunk/paradiseo-eo/tutorial/Templates/lessOffspringSameSelectorGenOp.tmpl
new file mode 100644
index 000000000..c0790f93c
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Templates/lessOffspringSameSelectorGenOp.tmpl
@@ -0,0 +1,76 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+The above line is usefulin Emacs-like editors
+ */
+
+/*
+Template for general operators
+===============================
+i.e. that takes any number of parents and generates any number of offspring
+
+a GenOp that creates less offspring than there are parents
+
+First version, get parents from populator using the imbedded select() method
+*/
+
+#ifndef eoLessOffspringSameSelectorGenOp_H
+#define eoLessOffspringSameSelectorGenOp_H
+
+#include 
+
+/** 
+ *  Always write a comment in this format before class definition
+ *  if you want the class to be documented by Doxygen
+ *
+ * ATTENTION, class EOT *must* derive from EO, as method invalidate() 
+ * must be called if the genotypes of the indis is modified
+ */
+template 
+class eoLessOffspringSameSelectorGenOp: public eoGenOp
+{
+public:
+  /**
+   * (Default) Constructor.
+   */
+  eoLessOffspringSameSelectorGenOp(paramType _anyParameter) : 
+    anyParameter(_anyParameter) {}
+
+  /// The class name. Used to display statistics
+  string className() const { return "eoLessOffspringSameSelectorGenOp"; }
+
+  /// The TOTAL number of offspring (here = nb of remaining modified parents)
+  unsigned max_production(void) { return NbLeftParents; }
+
+  /**
+   * eoLesOffspringSameSelectorGenOp operator - 
+   *        gets extra parents from the populator
+   *
+   * @param _pop a POPULATOR (not a simple population)
+   */
+    void apply(eoPopulator& _plop)
+    {
+     // First, select as many parents as you will have offspring
+      EOT& parent1 = *_plop; // select the first parent
+      ++_plop;          // advance once for each selected parents
+      ...
+      EOT& parentN = *_plop; // say you want N offspring
+
+      // Now select extra parents from the populator
+      EOT& parentN+1 = _plop.select();
+      ...
+      EOT& parentN+K = _plop.select();
+
+      // modify the first N parents
+      ...
+
+      // oh right, and invalidate their fitnesses
+      parent1.invalidate();
+      ...
+      parentN.invalidate();
+    }
+
+private:
+  paramType anyParameter
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/tutorial/Templates/make_MyStruct.cpp b/trunk/paradiseo-eo/tutorial/Templates/make_MyStruct.cpp
new file mode 100644
index 000000000..fff16f4a6
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Templates/make_MyStruct.cpp
@@ -0,0 +1,129 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+The above line is usefulin Emacs-like editors
+ */
+
+/*
+Template for creating a new representation in EO
+================================================
+
+This is the template file that allows separate compilation of
+everything that is representation independant (evolution engine and
+general output) for an Evolutionary Algorithm with scalar fitness.
+
+It includes of course the definition of the genotype (eoMyStruct.h) and
+is written like the make_xxx.cpp files in dirs src/ga (for bitstrings)
+and src/es (for real vectors).
+
+*/
+
+// Miscilaneous include and declaration 
+#include 
+using namespace std;
+
+// eo general include
+#include "eo"
+// the real bounds (not yet in general eo include)
+#include "utils/eoRealVectorBounds.h"
+
+// include here whatever specific files for your representation
+// Basically, this should include at least the following
+
+/** definition of representation: 
+ * class eoMyStruct MUST derive from EO for some fitness
+ */
+#include "eoMyStruct.h"
+
+// create an initializer: this is NOT representation-independent
+// and will be done in the main file
+// However, should you decide to freeze that part, you could use the
+// following (and remove it from the main file, of course!!!)
+//------------------------------------------------------------------
+// #include "make_genotype_MyStruct.h"
+// eoInit> & make_genotype(eoParser& _parser, eoState&_state, eoMyStruct _eo)
+// {
+//   return do_make_genotype(_parser, _state, _eo);
+// } 
+
+// eoInit> & make_genotype(eoParser& _parser, eoState&_state, eoMyStruct _eo)
+// {
+//   return do_make_genotype(_parser, _state, _eo);
+// } 
+
+// same thing for the variation operaotrs
+//---------------------------------------
+// #include "make_op_MyStruct.h"
+// eoGenOp>&  make_op(eoParser& _parser, eoState& _state, eoInit>& _init)
+// {
+//   return do_make_op(_parser, _state, _init);
+// }
+
+// eoGenOp>&  make_op(eoParser& _parser, eoState& _state, eoInit>& _init)
+// {
+//   return do_make_op(_parser, _state, _init);
+// }
+
+// The following modules use ***representation independent*** routines
+
+// how to initialize the population 
+// it IS representation independent if an eoInit is given
+#include 
+eoPop >&  make_pop(eoParser& _parser, eoState& _state, eoInit > & _init)
+{
+  return do_make_pop(_parser, _state, _init);
+}
+
+eoPop >&  make_pop(eoParser& _parser, eoState& _state, eoInit > & _init)
+{
+  return do_make_pop(_parser, _state, _init);
+}
+
+// the stopping criterion
+#include 
+eoContinue >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter > & _eval)
+{
+  return do_make_continue(_parser, _state, _eval);
+}
+
+eoContinue >& make_continue(eoParser& _parser, eoState& _state, eoEvalFuncCounter > & _eval)
+{
+  return do_make_continue(_parser, _state, _eval);
+}
+
+// outputs (stats, population dumps, ...)
+#include 
+eoCheckPoint >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter >& _eval, eoContinue >& _continue) 
+{
+  return do_make_checkpoint(_parser, _state, _eval, _continue);
+}
+
+eoCheckPoint >& make_checkpoint(eoParser& _parser, eoState& _state, eoEvalFuncCounter >& _eval, eoContinue >& _continue) 
+{
+  return do_make_checkpoint(_parser, _state, _eval, _continue);
+}
+
+// evolution engine (selection and replacement)
+#include 
+eoAlgo >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc >& _eval, eoContinue >& _continue, eoGenOp >& _op)
+{
+  return do_make_algo_scalar(_parser, _state, _eval, _continue, _op);
+}
+
+eoAlgo >&  make_algo_scalar(eoParser& _parser, eoState& _state, eoEvalFunc >& _eval, eoContinue >& _continue, eoGenOp >& _op)
+{
+  return do_make_algo_scalar(_parser, _state, _eval, _continue, _op);
+}
+
+// simple call to the algo. stays there for consistency reasons 
+// no template for that one
+#include 
+void run_ea(eoAlgo >& _ga, eoPop >& _pop)
+{
+  do_run(_ga, _pop);
+}
+
+void run_ea(eoAlgo >& _ga, eoPop >& _pop)
+{
+  do_run(_ga, _pop);
+}
+
diff --git a/trunk/paradiseo-eo/tutorial/Templates/make_genotype_MyStruct.h b/trunk/paradiseo-eo/tutorial/Templates/make_genotype_MyStruct.h
new file mode 100644
index 000000000..9892583b4
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Templates/make_genotype_MyStruct.h
@@ -0,0 +1,73 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_genotype.h
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _make_genotype_h
+#define _make_genotype_h
+
+#include 
+#include 
+  // also need the parser and param includes
+#include 
+#include 
+
+
+/*
+ * This fuction does the create an eoInit
+ *
+ * It could be here tempatized only on the fitness, as it can be used 
+ * to evolve structures with any fitness.
+ * However, for consistency reasons, it was finally chosen, as in 
+ * the rest of EO, to templatize by the full EOT, as this eventually 
+ * allows to choose the type of genotype at run time (see in es dir)
+ *
+ * It returns an eoInit that can later be used to initialize 
+ * the population (see make_pop.h).
+ *
+ * It uses a parser (to get user parameters) and a state (to store the memory)
+ * the last argument is to disambiguate the call upon different instanciations.
+ *
+ * WARNING: that last argument will generally be the result of calling 
+ *          the default ctor of EOT, resulting in most cases in an EOT 
+ *          that is ***not properly initialized***
+*/
+
+template 
+eoInit & do_make_genotype(eoParser& _parser, eoState& _state, EOT)
+{
+  // read any useful parameter here from the parser 
+  // the param itself will belong to the parser (as far as memory is concerned)
+
+  //    paramType & param = _parser.createParam(deafultValue, "Keyword", "Comment to appear in help and status", 'c',"Section of status file").value();
+
+  // Then built the initializer - a pointer, stored in the eoState
+  eoInit* init = new eoMyStructInit /* ( param ) */ ;
+  // store in state
+  _state.storeFunctor(init);
+  // and return a reference
+  return *init;
+}
+
+#endif
diff --git a/trunk/paradiseo-eo/tutorial/Templates/make_op_MyStruct.h b/trunk/paradiseo-eo/tutorial/Templates/make_op_MyStruct.h
new file mode 100644
index 000000000..8b43d17bb
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Templates/make_op_MyStruct.h
@@ -0,0 +1,210 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// make_op_MyStruct.h
+// (c) Marc Schoenauer, Maarten Keijzer and GeNeura Team, 2001
+/* 
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+    Contact: todos@geneura.ugr.es, http://geneura.ugr.es
+             Marc.Schoenauer@polytechnique.fr
+             mkeijzer@dhi.dk
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef _make_op_MyStruct_h
+#define _make_op_MyStruct_h
+
+// the operators
+#include 
+#include 
+#include 
+#include 
+// combinations of simple eoOps (eoMonOp and eoQuadOp)
+#include 
+
+/** definition of mutation: 
+ * class eoMyStructMonop MUST derive from eoMonOp
+ */
+#include "eoMyStructMutation.h"
+
+/** definition of crossover (either as eoBinOp (2->1) or eoQuadOp (2->2): 
+ * class eoMyStructBinCrossover MUST derive from eoBinOp
+ * OR 
+ * class eoMyStructQuadCrossover MUST derive from eoQuadOp
+ */
+// #include "eoMyStructBinOp.h"
+// OR
+#include "eoMyStructQuadCrossover.h"
+
+  // also need the parser and state includes
+#include 
+#include 
+
+
+/////////////////// variation operators ///////////////
+// canonical (crossover + mutation) only at the moment //
+
+/*
+ * This function builds the operators that will be applied to the eoMyStruct
+ *
+ * It uses a parser (to get user parameters), a state (to store the memory)
+ *    the last parameter is an eoInit: if some operator needs some info 
+ *    about the genotypes, the init has it all (e.g. bounds, ...)
+ *    Simply do 
+ *        EOT myEO;
+ *        _init(myEO);
+ *    and myEO is then an ACTUAL object
+ *
+ * As usual, the template is the complete EOT even though only the fitness
+ * is actually templatized here: the following only applies to eoMyStruct
+*/
+
+template 
+eoGenOp & do_make_op(eoParameterLoader& _parser, eoState& _state, eoInit& _init)
+{
+  // this is a temporary version, while Maarten codes the full tree-structured
+  // general operator input
+  // BTW we must leave that simple version available somehow, as it is the one
+  // that 90% people use!
+
+
+    /////////////////////////////
+    // Variation operators
+    ////////////////////////////
+    // read crossover and mutations, combine each in a proportional Op
+    // and create the eoGenOp that calls crossover at rate pCross 
+    // then mutation with rate pMut
+
+    // the crossovers
+    /////////////////
+
+    // here we can have eoQuadOp (2->2) only - no time for the eoBinOp case
+
+    // you can have more than one - combined in a proportional way
+    
+    // first, define the crossover objects and read their rates from the parser
+    
+    // A first crossover   
+    eoQuadOp *cross = new eoMyStructQuadCrossover /* (varType  _anyVariable) */;
+    // store in the state
+    _state.storeFunctor(cross);
+
+  // read its relative rate in the combination
+    double cross1Rate = _parser.createParam(1.0, "cross1Rate", "Relative rate for crossover 1", '1', "Variation Operators").value();
+
+  // and create the combined operator with this one
+  eoPropCombinedQuadOp *propXover = 
+    new eoPropCombinedQuadOp(*cross, cross1Rate);
+  // and of course stor it in the state
+    _state.storeFunctor(propXover);
+
+
+    // Optional: A second(and third, and ...)  crossover   
+    //   of course you must create the corresponding classes
+    // and all ***MUST*** derive from eoQuadOp
+
+  /* Uncomment if necessary - and replicate as many time as you need
+      cross = new eoMyStructSecondCrossover(varType  _anyVariable); 
+      _state.storeFunctor(cross);
+      double cross2Rate = _parser.createParam(1.0, "cross2Rate", "Relative rate for crossover 2", '2', "Variation Operators").value(); 
+      propXover.add(*cross, cross2Rate); 
+  */
+  // if you want some gentle output, the last one shoudl be like
+  //  propXover.add(*cross, crossXXXRate, true);
+
+
+  // the mutation: same story
+  ////////////////
+  // you can have more than one - combined in a proportional way
+
+  // for each mutation, 
+  // - define the mutator object
+  // - read its rate from the parser
+  // - add it to the proportional combination
+
+  // a first mutation  
+  eoMonOp *mut = new eoMyStructMutation/* (varType  _anyVariable) */;
+  _state.storeFunctor(mut);
+  // its relative rate in the combination
+  double mut1Rate = _parser.createParam(1.0, "mut1Rate", "Relative rate for mutation 1", '1', "Variation Operators").value();
+  // and the creation of the combined operator with this one
+  eoPropCombinedMonOp *propMutation = new eoPropCombinedMonOp(*mut, mut1Rate);
+  _state.storeFunctor(propMutation);
+
+    // Optional: A second(and third, and ...)  mutation with their rates
+    //   of course you must create the corresponding classes
+    // and all ***MUST*** derive from eoMonOp
+
+  /* Uncomment if necessary - and replicate as many time as you need
+      mut = new eoMyStructSecondMutation(varType  _anyVariable);
+      _state.storeFunctor(mut);
+      double mut2Rate = _parser.createParam(1.0, "mut2Rate", "Relative rate for mutation 2", '2', "Variation Operators").value(); 
+       propMutation.add(*mut, mut2Rate); 
+  */
+  // if you want some gentle output, the last one shoudl be like
+  //  propMutation.add(*mut, mutXXXRate, true);
+
+  // end of crossover and mutation definitions
+  ////////////////////////////////////////////
+
+// END Modify definitions of objects by eventually add parameters
+//*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
+
+// from now on, you do not need to modify anything
+// though you CAN add things to the checkpointing (see tutorial)
+
+  // now build the eoGenOp:
+  // to simulate SGA (crossover with proba pCross + mutation with proba pMut
+  // we must construct
+  //     a sequential combination of
+  //          with proba 1, a proportional combination of 
+  //                        a QuadCopy and our crossover
+  //          with proba pMut, our mutation
+
+  // but of course you're free to use any smart combination you could think of
+  // especially, if you have to use eoBinOp rather than eoQuad Op youùll have
+  // to modify that part
+
+  // First read the individual level parameters
+    eoValueParam& pCrossParam = _parser.createParam(0.6, "pCross", "Probability of Crossover", 'C', "Variation Operators" );
+    // minimum check
+    if ( (pCrossParam.value() < 0) || (pCrossParam.value() > 1) )
+      throw runtime_error("Invalid pCross");
+
+    eoValueParam& pMutParam = _parser.createParam(0.1, "pMut", "Probability of Mutation", 'M', "Variation Operators" );
+    // minimum check
+    if ( (pMutParam.value() < 0) || (pMutParam.value() > 1) )
+      throw runtime_error("Invalid pMut");
+
+
+  // the crossover - with probability pCross
+  eoProportionalOp * propOp = new eoProportionalOp ;
+  _state.storeFunctor(propOp);
+  eoQuadOp *ptQuad = new eoQuadCloneOp;
+  _state.storeFunctor(ptQuad);
+  propOp->add(*propXover, pCrossParam.value()); // crossover, with proba pcross
+  propOp->add(*ptQuad, 1-pCrossParam.value()); // nothing, with proba 1-pcross
+
+  // now the sequential
+  eoSequentialOp *op = new eoSequentialOp;
+  _state.storeFunctor(op);
+  op->add(*propOp, 1.0);	 // always do combined crossover
+  op->add(*propMutation, pMutParam.value()); // then mutation, with proba pmut
+
+  // that's it - return a reference
+  return *op;
+}
+#endif
diff --git a/trunk/paradiseo-eo/tutorial/Templates/moreOffspringGenOp.tmpl b/trunk/paradiseo-eo/tutorial/Templates/moreOffspringGenOp.tmpl
new file mode 100644
index 000000000..c8644276a
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Templates/moreOffspringGenOp.tmpl
@@ -0,0 +1,77 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+The above line is usefulin Emacs-like editors
+ */
+
+/*
+Template for general operators
+===============================
+i.e. that takes any number of parents and generates any number of offspring
+
+Here, a GenOp that creates more (or same number of) offspring 
+than there are parents
+*/
+
+#ifndef eoMoreOffspringGenOp_H
+#define eoMoreOffspringGenOp_H
+
+#include 
+
+/** 
+ *  Always write a comment in this format before class definition
+ *  if you want the class to be documented by Doxygen
+ *
+ * ATTENTION, class EOT *must* derive from EO, as method invalidate() 
+ * must be called if the genotypes of the indis is modified
+ */
+template 
+class eoMoreOffspringGenOp: public eoGenOp
+{
+public:
+  /**
+   * (Default) Constructor.
+   */
+  eoMoreOffspringGenOp(paramType _anyParameter) : 
+    anyParameter(_anyParameter) {}
+
+  /// The class name. Used to display statistics
+  string className() const { return "eoMoreOffspringGenOp"; }
+
+  /// The TOTAL number of offspring (including modified parents)
+  unsigned max_production(void) { return NbOffspring; }
+
+  /**
+   * eoMoreOffspringGenOp operator - eventually modifies the parents
+   *     BUT does generate more offspring
+   *
+   * @param _pop a POPULATOR (not a simple population)
+   */
+    void apply(eoPopulator& _plop)
+    {
+      EOT& parent1 = *_plop; // select the first parent
+      ++_plop;          // advance once for each selected parents
+      ...
+      EOT& parentN = *_plop; // select the last parent
+                 // don't advance after the last one: _plop always
+                 // points to the last that has already been treated
+
+      // apply operator to the parents (modifying them AND generating
+      // new individuals ofs1, ofs2, ..., ofsN 
+      ++_plop;          // advance before each insertion
+      _plop.insert(ofs1);
+      ...
+      ++_plop;          // advance before each insertion
+      _plop.insert(ofsN); 
+
+      // oh right, and invalidate fitnesses of modified parents
+      parent1.invalidate();
+      ...
+      parentN.invalidate();
+    }
+
+
+private:
+  paramType anyParameter
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/tutorial/Templates/mutation.tmpl b/trunk/paradiseo-eo/tutorial/Templates/mutation.tmpl
new file mode 100644
index 000000000..befbcea93
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Templates/mutation.tmpl
@@ -0,0 +1,68 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+The above line is useful in Emacs-like editors
+ */
+
+/*
+Template for simple mutation operators
+======================================
+*/
+
+#ifndef eoMyStructMutation_H
+#define eoMyStructMutation_H
+
+
+#include 
+
+/** 
+ *  Always write a comment in this format before class definition
+ *  if you want the class to be documented by Doxygen
+ *
+ * THere is NO ASSUMPTION on the class GenoypeT.
+ * In particular, it does not need to derive from EO
+ */
+template 
+class eoMyStructMutation: public eoMonOp
+{
+public:
+  /**
+   * Ctor - no requirement
+   */
+// START eventually add or modify the anyVariable argument
+  eoMyStructMutation()
+  //  eoMyStructMutation( varType  _anyVariable) : anyVariable(_anyVariable) 
+// END eventually add or modify the anyVariable argument
+  {
+    // START Code of Ctor of an eoMyStructEvalFunc object
+    // END   Code of Ctor of an eoMyStructEvalFunc object
+  }
+
+  /// The class name. Used to display statistics
+  string className() const { return "eoMyStructMutation"; }
+
+  /**
+   * modifies the parent
+   * @param _genotype The parent genotype (will be modified)
+   */
+  bool operator()(GenotypeT & _genotype) 
+  {
+    bool isModified;
+    // START code for mutation of the _genotype object
+
+       /** Requirement
+	* if (_genotype has been modified)
+	*     isModified = true;
+	* else
+	*     isModified = false;
+	*/
+    return isModified;
+    // END code for mutation of the _genotype object
+  }
+
+private:
+// START Private data of an eoMyStructMutation object
+  //  varType anyVariable;		   // for example ...
+// END   Private data of an eoMyStructMutation object
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/tutorial/Templates/quadCrossover.tmpl b/trunk/paradiseo-eo/tutorial/Templates/quadCrossover.tmpl
new file mode 100644
index 000000000..c3b92ca55
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Templates/quadCrossover.tmpl
@@ -0,0 +1,71 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+The above line is usefulin Emacs-like editors
+ */
+
+/*
+Template for simple quadratic crossover operators
+=================================================
+
+Quadratic crossover operators modify the both genotypes
+*/
+
+#ifndef eoMyStructQuadCrossover_H
+#define eoMyStructQuadCrossover_H
+
+#include 
+
+/** 
+ *  Always write a comment in this format before class definition
+ *  if you want the class to be documented by Doxygen
+ *
+ * THere is NO ASSUMPTION on the class GenoypeT.
+ * In particular, it does not need to derive from EO
+ */
+template 
+class eoMyStructQuadCrossover: public eoQuadOp
+{
+public:
+  /**
+   * Ctor - no requirement
+   */
+// START eventually add or modify the anyVariable argument
+  eoMyStructQuadCrossover()
+  //  eoMyStructQuadCrossover( varType  _anyVariable) : anyVariable(_anyVariable) 
+// END eventually add or modify the anyVariable argument
+  {
+    // START Code of Ctor of an eoMyStructEvalFunc object
+    // END   Code of Ctor of an eoMyStructEvalFunc object
+  }
+
+  /// The class name. Used to display statistics
+  string className() const { return "eoMyStructQuadCrossover"; }
+
+  /**
+   * eoQuad crossover - _genotype1 and _genotype2 are the (future)
+   *       offspring, i.e. _copies_ of the parents, to be modified
+   * @param _genotype1 The first parent
+   * @param _genotype2 The second parent
+   */
+  bool operator()(GenotypeT& _genotype1, GenotypeT & _genotype2) 
+  {
+    bool oneAtLeastIsModified;
+    // START code for crossover of _genotype1 and _genotype2 objects
+
+       /** Requirement
+	* if (at least one genotype has been modified) // no way to distinguish
+	*     oneAtLeastIsModified = true;
+	* else
+	*     oneAtLeastIsModified = false;
+	*/
+    return oneAtLeastIsModified;
+    // END code for crossover of _genotype1 and _genotype2 objects
+  }
+
+private:
+// START Private data of an eoMyStructQuadCrossover object
+  //  varType anyVariable;		   // for example ...
+// END   Private data of an eoMyStructQuadCrossover object
+};
+
+#endif
diff --git a/trunk/paradiseo-eo/tutorial/Templates/stat.tmpl b/trunk/paradiseo-eo/tutorial/Templates/stat.tmpl
new file mode 100644
index 000000000..792c05730
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/Templates/stat.tmpl
@@ -0,0 +1,64 @@
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+The above line is usefulin Emacs-like editors
+ */
+
+/*
+Template for computing statistics on eoPop
+============================================
+*/
+
+#ifndef _eoMyStructStat_h
+#define _eoMyStructStat_h
+
+// include the base definition of eoInit
+#include 
+
+/** 
+ *  Always write a comment in this format before class definition
+ *  if you want the class to be documented by Doxygen
+ *
+ * ASSUMPTION on the class GenoypeT: 
+ *             it needs to derive from EO (i.e. has a Fitness).
+ *
+ * It is assumed that you want to compute a double. 
+ * In case you want something else, then your stat should derive from 
+ *                      eoStat
+ *  where class T is the class of the computed statistics
+ */
+template 
+class eoMyStructStat : public eoStat
+{
+public :
+    typedef typename EOT::Fitness Fitness;
+
+// START eventually add or modify the anyVariable argument
+  /** Ctor - you change the default name of course. 
+   * @param
+   *  _description : inherited from eoValueParam (eoStat is an  from eoVapueParam)
+   */
+  eoMyStructStat(std::string _description = "eoMyStructStat ") :
+    eoStat(0.0, _description)
+// END eventually add or modify the anyVariable argument
+  {
+    // START Code of Ctor of an eoMonReelStat object
+    // END   Code of Ctor of an eoMonReelStat object
+  }
+
+    void operator()(const eoPop& _pop){
+      double tmpStat;
+    // START Code for computing the statistics - in tmpStat
+      // tmpStat = blablabla
+    // END   Code for computing the statistics
+      eoStat::value() = tmpStat;      // store the stat in the eoParam value() field
+    }
+
+  virtual std::string className(void) const { return "eoMyStructStat"; }
+private :
+// START Private data of an eoMyStructStat object
+  //  varType anyVariable;		   // for example ...
+// END   Private data of an eoMyStructStat object
+};
+
+#endif
+
diff --git a/trunk/paradiseo-eo/tutorial/examples/CVS/Entries b/trunk/paradiseo-eo/tutorial/examples/CVS/Entries
new file mode 100644
index 000000000..178481050
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/examples/CVS/Entries
@@ -0,0 +1 @@
+D
diff --git a/trunk/paradiseo-eo/tutorial/examples/CVS/Repository b/trunk/paradiseo-eo/tutorial/examples/CVS/Repository
new file mode 100644
index 000000000..ca9657d23
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/examples/CVS/Repository
@@ -0,0 +1 @@
+eo/tutorial/examples
diff --git a/trunk/paradiseo-eo/tutorial/examples/CVS/Root b/trunk/paradiseo-eo/tutorial/examples/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/examples/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/tutorial/html/BitEA.html b/trunk/paradiseo-eo/tutorial/html/BitEA.html
new file mode 100644
index 000000000..7d75bec5b
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/BitEA.html
@@ -0,0 +1,261 @@
+
+
+
+   
+   
+   BitEA.cpp
+
+
+Back to Lesson 4 - Tutorial
+main page - Top-Down page - Bottom-up
+page - Programming hints - EO
+documentation
+
    
+
    
+
    
+
    
+BitEA.cpp
    
+Click on the figure to see the corresponding code.
    
+In the code, the colors are meaningfull
    
+The actual code is in boldface and the comment in normal face.
+
    
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
     
+
+
+
+
+
+
    
+#include <iostream>
    
+#include <ga/make_ga.h>
    
+#include <apply.h>
    
+    
+
    
+
+
+
+
+
    
+
+#include "binary_value.h"
    
+    
+
    
+
+
+
+
+
    
+
+using namespace std;
    
+int main(int argc, char* argv[])
    
+{
    
+   try
    
+   {
    
+    
+
    
+
+
+
+
+
    
+
+//-----------------------------------------------------------------------------
    
+// define your genotype and fitness types
    
+   typedef eoBit<double> EOT;
    
+    
+
    
+
+
+
+
+
    
+
+   eoParser parser(argc, argv);   // for user-parameter reading
    
+    
+
    
+
+
+
+
+
    
+
+   eoState state;       // keeps all things allocated
    
+   ///// FIRST, problem or representation dependent stuff
    
+   //////////////////////////////////////////////////////
    
+    
+
    
+
+
+
+
+
    
+
+   // The evaluation fn - encapsulated into an eval counter for output 
    
+   eoEvalFuncPtr<EOT, float> mainEval( binary_value<EOT> );
    
+   eoEvalFuncCounter<EOT> eval(mainEval);
    
+    
+
    
+
+
+
+
+
    
+
+   // the genotype - through a genotype initializer
    
+   eoInit<EOT>& init = make_genotype(parser, state, EOT());
    
+    
+
    
+
+
+
+
+
    
+
+   // Build the variation operator (any seq/prop construct)
    
+   eoGenOp<EOT>& op = make_op(parser, state, init);
    
+    
+
    
+
+
+
+
+
    
+
+   //// Now the representation-independent things
    
+   //////////////////////////////////////////////
    
+   // initialize the population - and evaluate
    
+   // yes, this is representation indepedent once you have an eoInit
    
+   eoPop<EOT>& pop     = make_pop(parser, state, init);
    
+    
+
    
+
+
+
+
+
    
+
+   // stopping criteria
    
+   eoContinue<EOT> & term = make_continue(parser, state, eval);
    
+   // output
    
+   eoCheckPoint<EOT> & checkpoint = make_checkpoint(parser, state, eval, term);
    
+    
+
    
+
+
+
+
+
    
+
+   // algorithm (need the operator!)
    
+   eoAlgo<EOT>& ga = make_algo_scalar(parser, state, eval, checkpoint, op);
    
+   ///// End of construction of the algorith
    
+   /////////////////////////////////////////
    
+    
+
    
+
+
+
+
+
    
+
+   // to be called AFTER all parameters have been read!!!
    
+   make_help(parser);
    
+   //// GO
    
+   ///////
    
+    
+
    
+
+
+
+
+
    
+
+   // evaluate intial population AFTER help and status in case it takes time
    
+   apply(eval, pop);
    
+    
+
    
+
+
+
+
+
    
+
+   // print it out (sort witout modifying) 
    
+   cout << "Initial Population\n";
    
+   pop.sortedPrintOn(cout);
    
+   cout << endl;
    
+    
+
    
+
+
+
+
+
    
+
+   run_ea(ga, pop); // run the ga
    
+    
+
    
+
+
+
+
+
    
+
+   // print it out (sort witout modifying) 
    
+   cout << "Final Population\n";
    
+   pop.sortedPrintOn(cout);
    
+   cout << endl;
    
+    
+
    
+
+
+
+
+
    
+
+   }
    
+   catch(exception& e)
    
+   {
    
+       cout << e.what() << endl;
    
+   }
    
+}
    
+
    
+
    Back to Lesson 4 - Tutorial
+main page - Top-Down page - Bottom-up
+page - Programming hints - EO
+documentation
+
    
+
    
+Marc Schoenauer
    
+
    Last
+modified: Wed Mar  6 05:40:27 2002
+
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/CVS/Entries b/trunk/paradiseo-eo/tutorial/html/CVS/Entries
new file mode 100644
index 000000000..a1da78d94
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/CVS/Entries
@@ -0,0 +1,45 @@
+/BitEA.html/1.1/Mon Apr  8 18:03:35 2002//
+/EA_tutorial.jpg/1.2/Mon Apr 30 09:26:37 2001//
+/FirstBitEA.html/1.11/Mon Apr  8 18:04:31 2002//
+/FirstBitGA.html/1.7/Mon Apr  8 18:04:31 2002//
+/FirstRealEA.html/1.12/Mon Apr  8 18:04:32 2002//
+/FirstRealGA.html/1.10/Mon Apr  8 18:04:32 2002//
+/Firstmerge.html/1.7/Mon Apr  8 18:04:31 2002//
+/NoWay.html/1.5/Mon Apr  8 18:04:32 2002//
+/OneMaxEA.html/1.1/Wed May  8 06:50:58 2002//
+/SecondBitEA.html/1.16/Mon Dec  9 06:19:56 2002//
+/SecondRealEA.html/1.2/Wed May  8 06:50:58 2002//
+/beige009.jpg/1.1/Wed Nov 29 18:19:56 2000//
+/binary_value.html/1.4/Mon Apr  8 18:04:31 2002//
+/debut.html/1.3/Tue Dec 19 10:17:39 2000//
+/eoBottomUp.html/1.6/Mon Apr  8 18:04:31 2002//
+/eoCheckPoint.html/1.5/Mon Apr  8 18:04:31 2002//
+/eoEngine.html/1.14/Wed May  8 06:50:58 2002//
+/eoEval.html/1.4/Mon Apr  8 18:04:31 2002//
+/eoGeneration.html/1.2/Mon Apr  8 18:04:31 2002//
+/eoInit.html/1.4/Mon Apr  8 18:04:31 2002//
+/eoIo.html/1.2/Mon Apr  8 18:04:31 2002//
+/eoLesson1.html/1.14/Mon Apr  8 18:04:31 2002//
+/eoLesson2.html/1.17/Wed May  8 06:50:58 2002//
+/eoLesson3.html/1.13/Sun Apr 28 05:04:24 2002//
+/eoLesson4.html/1.10/Mon Dec 27 09:08:44 2004//
+/eoLesson5.html/1.3/Wed May 26 09:00:26 2004//
+/eoOneMax.html/1.1/Wed May  8 06:50:58 2002//
+/eoOneMaxEvalFunc.html/1.1/Wed May  8 06:50:58 2002//
+/eoOneMaxInit.html/1.1/Wed May  8 06:50:58 2002//
+/eoOneMaxMutation.html/1.1/Wed May  8 06:50:58 2002//
+/eoOneMaxQuadCrossover.html/1.1/Wed May  8 06:50:58 2002//
+/eoOneMax_complete.html/1.1/Wed May  8 06:50:58 2002//
+/eoOperators.html/1.10/Fri Mar 15 06:28:25 2002//
+/eoOutput.html/1.2/Mon Apr  8 18:04:31 2002//
+/eoProgramming.html/1.16/Mon Dec 27 09:08:44 2004//
+/eoRepresentation.html/1.2/Mon Apr  8 18:04:31 2002//
+/eoSGA.html/1.4/Mon Apr  8 18:04:31 2002//
+/eoSelect.html/1.2/Mon Apr  8 18:04:31 2002//
+/eoStop.html/1.2/Mon Apr  8 18:04:31 2002//
+/eoTopDown.html/1.10/Thu Sep 18 15:09:34 2003//
+/eoTutorial.html/1.26/Wed Feb 22 04:53:20 2006//
+/make_genotype_OneMax.html/1.1/Wed May  8 06:50:58 2002//
+/make_op_OneMax.html/1.1/Wed May  8 06:50:58 2002//
+/real_value.html/1.4/Mon Apr  8 18:04:32 2002//
+D
diff --git a/trunk/paradiseo-eo/tutorial/html/CVS/Repository b/trunk/paradiseo-eo/tutorial/html/CVS/Repository
new file mode 100644
index 000000000..c2f77cfc2
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/CVS/Repository
@@ -0,0 +1 @@
+eo/tutorial/html
diff --git a/trunk/paradiseo-eo/tutorial/html/CVS/Root b/trunk/paradiseo-eo/tutorial/html/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/tutorial/html/EA_tutorial.jpg b/trunk/paradiseo-eo/tutorial/html/EA_tutorial.jpg
new file mode 100644
index 0000000000000000000000000000000000000000..11c0695fcc7c2badccdfc5d121b7ee3eaf39d04a
GIT binary patch
literal 177758
zcmeFZ2~-p5x;7d`ML>+mC?M%p5gDT*B7>=|G|);zL_iRPh%_P~;)Dc=DP^A1Eh6mz
zX+?~P7?sHZi6jBGq9QU0v}96IhNem-l%`VrpZomlziaPv&${RC|EzQGU3crMWe7EV
z-#b3<^SoyUG974ZdAG^N6H3e^&qO
zvl_FOk!I`7($JeVBPLNuq*-(S?cSvS`DfN_jX87YY0lTu)&VEfFCxvJrJ*rg=%
zbLN1vPk`T(=IG5`{Qa6u^Yr~AHJ2SSSbOT%OY@g+zTINDy$f04xaV-1mbQ_x$r4k`
zl~${)ZPq!hci!OQ>hXi8m-mlbwgv2K%GU#_@Pd6jpq>iV79y84F3yZ7!3MdH@B_P;)U^0K?9x3B-zz@SX7
zc=Pt%$omhY=*Lf=r4AOCo-;>dj^?+0&6=GI4h_9I
zbH86RZ}BF7&B#Og%hsNnZ?O5-OSfCJmOE}o4EG%F(l%PLPG*UI+uGlD_Mh8W+CR0k
z|FyCIV_$=$1sbz}@-*~F5Q!jGUCtx@f9DXa#DjikX18IJ+fI9{?1;|L=Z%yCyCz-vL#r09CKS_|dA?m7jAf%5@*SDK#}jU7
zauFUcOI+~bG%Vai&TL-9?wTP*x3H|e^U$5o?7X7g`Q+lCgFfBwt&+Z1#06!Vi|jjk
z=f4#1bqUvAedOt-FufwN!g}|eaeGq?f6}0DCyHA0it)mIqx8IaVu4(H!;RsT^~Tv)
zyuO%O;AuCHvZgx1z;PGXCS;#~>$?F5GqPrYGcTugZ%EUL1rKamB2ky}#GFTOu%Fn`
zY3iRZ3zn^eGL^|QBqVKyw43Flu54Zj$Ip<2^g~kmEux=M4`o2It4RY*lM{TiSQUE>
z#v=?S$2TI$#Nskr6-9mqTw98JV!yt@-DXG`@vRhnsGgv}qS*5kp$dG3ZGvynEQyyA
z@cj%)W_1^_dIiVx2f0ED((O7voUH6GtWyh2@PHYTcCyj}1J`Kzm8d!BRv7akmf=5s
zWG@9Pa*}g$xq~w#vOrcx4D&MYSwit_+h=gn#N@<=0Ie)SQ^|F%|2kq6*<3Y4TK1$|
zGA0QkIvZlt)l=jt4-V8z@4AjrMQ0w?U=lZVe;;*%X*Daov3G`4|K(w0KQ^K@Wd{Ge
z<7=m~v`28~-Vx4(V7zlmUo4qgJ~f<&=e!_{2P9x2I_gs>Re2UWr{;r|ZfrkA6RE=4
zJ;b6JQr5Zty`KaPO$odStXu670XALKgNJ2=lAE)fDUmQSWdSMGwgJLvQggDKOHelbZ4&qEl~=`
zeoAHBJhazrl>5=HYJzw;#TZxZg$D)OW=Me>KB)t3{w1YP5S6ur4SMj8qsWPyoE!}80RKd-AYC>
zaep~qFOH%0=K=RHMOb+Jqw__%avz9-|BxMK;f`7jmwahA`k9>Nh#%WBRi%i^%+juR
z_x;IexqZ!!B8Vz{w{9s*U`+I;iM@&(F0L`zo*8}4-!8O^>);1X>WHB%Dml6Y|doE?SZ|CK;>^aTP5^t_C&E2{H;Lb1I
zZ-jZPexLpSXQwLnxil>Z&ICp}GZ>J9J^^V3;zYS^YaR+X*mFd632XH?Oz?b>a
zjkx~1F_mrGc@Dljn2Thv7GmB2)^L=sZwl1c1Vap?W-BILC_zqR8Y+)(AZJkLbLT><
zoQf>eST94oXEjzp&A!_dzC>0t@vuQZk4e|}x?!Ku-j{&{RRuha1t+-dXxY*7vfb{O
z=K?z{f0a60xb?UDCUm1UA?7=5b@E%7!A0$nBk7HeL5O?oBkaE6?}}4T$GWRZ`zw5$
zD)NO=%bbqeCfY7%jyRa|(yLlijK|xBuYKfPv0(PT(CjwBJRCxe#ganCAdD0t~Skt4^eWNVmqD@Ij}>*~-eAD$md4*a-ly~gO`#|OKV8wwaY@>`5of(Ifb
z)6eipEN1-m^?t=Db3oS2ACKLA``&?hmGFLq5m>$b%&6yUkL+71G0LCsCTo%-^V<*Z
zb##~^1=rAZ9|bXOmsfm_SFglU(QLVKev>geBsZS$LAqPG3!9cEq0S2X#%y=@7MDODZ+?ZSUNH(^Q)1Qv1o=qAz?2p
z9}}Ig`RpIg+Wo?bitVMpqDncU84_jmIFT>y%yUi1#;IJRF(ZpPXmeu?Ed1DmZ&Ag=
z8@c498B#9S0+Rj)BjHo(-=R280jNGK?jhMq9#DHV#*pz^DYIF-QC=2%6%Hf(N7R9|
zcxZu0u?FdACFWzvG8nTGw7e%An8gZT5Q`&k#8Yb9^O{beiGM+$OkAt-^)7H5c*2O?
za|Eka9+@Gf?{e3XOF)5V3hk3*Sgb%L;}=xqvBB*8Bt8Y-j0U$uoJGw19hjz!kweiv
z8Xn);#Y}I7YC&v}NZWozqjn-OCt0>qt!4uzwT-qKbTI7CEkP9v7Lup8J>GR@Lo5;z
zMA0OY^~>Mg63W>%Ud_hj1;uNh?%RVDZ+nhVf?DP8yK71#m!E!vS;N(5n8^+`o6Eya
zs#|FmM*^`;SnBEaNA%Hn!khl}1_QY(_;Uv+cm$ws3Ih)Mt@J{Cp>zQP>eHTY4&Dg7
z^~>K*RM2RL)qI-UC^QG!OD>ur)zxID+X>>_!gXY&d2B~!h0wU%mMb%#AvH9LB&W_F
zZC;I?U#EM3qQeT|$jIZmh?{J60l1t{vF
zn=+{h^=^}7Fz$rUkn)qlHD%-d46V-sW7Zb5UD%l;SWH{PbPmBTRY~Az5MsOp7Ho6Y
zVT>o|W^$3k+;O!6%9DUvJBOg)8`Zz8qnoo8!U@s%uBoy})c@;(Z
zOE<9*XZC>-@)V6ScGw$rluc$iK(UDh7Urn)N%vrc=UIzYDI_@*O0zZ7R#`K3=w6ni
z&i4BGZ?PtOSN3q0*;1XB?bT@=Hj0OJ*1K<=iHkmZt7NTZhN$=H>LzD%3&*TAfo#6e
zX@k$oOHxkbZ+m~k4MVYg(ZBs+Xu}8*$sBExuU_lxxO4noY2WuA)RxH6H$AHjnR_>w
z+q1go3Rgdh!km|6f922al^&poP5{09&d?>gATyc^TO`qj;uzVKI|NVV$pW=Lp#?Hn
zo8%6=26gks?B(#_)iH4>l-5L7bY|UVd7;x;2UrjYs5k_2%peBjs+>WS&%VpHA^4$yQf+Nw`}~JF0Wb9S;30M
zfap~#)a7h*X7wYlPku;~>qv{>Rk4hcMXVex*MFJhtH-wJM0s-WyrZdQjMiyjHtlj<
zAEjL7OlXgwwe7I>&1MbO&uEO0K15OS)miSFr0`&WE7Y)(uQJB>_R%z$lZu-DQ_YJ$
z+``S#>|A#@r1@*NqVE*Q61TBU#)UNN_kGh5##p-y%5WUBaJ`MGP;M9|NWG3b_QMGa
z=@YxW7Mon$Rki2ctuJg(n|0rtuh-Nt?X8wucN(UP1B!NPQ-aF<{Wd&ZNpTh_J`TED
zZHgYCYxT))%%#s|3L4N5lRfCmilXzvw=5?clYQP=XWw>-gT?aLz&7ccz=~oKdCK}t
z;3du@nd2WTV~Sr$S!BAvP1A6HGpV=0pMvQ3?YOEOV7iaunaIKRXoBt
z5x0as{q3|i7Q9BVn3Z?~{|iv>PWJ0z7j-c#y-6&|RvyOgseEHQuMmCEQdTtJ0e7n}
zS*lBq^0OJW?I8W^6AXL`?rpY>H!Yp8RoSwZVwxbd&XA0!IH$O}cq#}&Tt!TqiUMN3
z7NN)7tO~>~r~)u!IW)0!fc^M9FRv*D#Ed|!LuK=UMgWL24Ff?U5{uAwF*hfI@`7f~+KJF7
zY^zsR9I3#@M37+;tdBcj(Wpj)OOv(i@Qt5ih3gy_cv+Nb{}%V5OB6ZcSF_*3Qn4C&
zjF@cj=l!~^>202@X{C09kNHYQfeeq)ev84gPRt*v`>^}YPpnws23EIWW@T1&hM1S#
zB8&05xqMdsSx9F=w*4ayvQO5n=_>cc`O?E*aW`|L;NK43gwhV*pmr52JH6Cb2@B!{
z%}`xgPZ`)?Tz6hL!C#l?6Fjg;z4cRYfI+&JJK*Gc6ddzk&OoUp=8$}P@q}f@D=Hft%qxvzv
z`8#xEA{=!C$imbT^ZuRv^0;@dd%zWDu<{r60>Bf}@ngs|uCGC8Y4P?^7SX<=6fltO
zAna2RAI3m(JH?c+!@65KRhwCHz%kNgl6hFZ{Azt_ELtk%w=Z?{SC=+@f7L37t+%UH
z4gp{Q&U&DLi(E_Fsip(WNnz+nevJD5%B;lA+D>DxcQ>5a9+G$Te5Pqg9MdjJ+7MPQ^J}@A4T~U}VT-pW<5VnC9+v-g9sA1+>7T&fE&oi6pmffV
z+I^QRsJK2?!Nv8xcVXcwFFZzlM-W39N>)HE9L$P0;V7LU4S6f;(ct_hUsV#bJB%y0
z6KKNwsM+=keimfzege6m^hd~?W?N<+oOc#pfFHWba#UYxvY{
zdb6~p##lZ%aSoWq7GPm-+0TdV)lE<=KM#ZkRyfE`o3SYHzzl)*R4U_Ce}w&gOn}e>
zQDr9TA)~a0>1qanl)blefUMl#H^rdD9dl%Qc%zaG!M;f?)($M$s*SOj{fe+e-|{j9
zaX(gFkgwVklg=xV8?x4~4{_SAA9yg(aDiEyth%>#8?U74vPs-d%iF8lyJTD5)XL7^
zx_Wmn%USdS32;59r0N!wGkjLIdh2IAjXoI^89e&snCXW70+qLBZcU-E`*DQl0!s_?
zw`~DW-yih#v#4sBs_NRcG$4bygWEOqHAJ14)QN53Lva%@q0h&5eq-_L8qR?-RqM4N
z3z98*(d0YA?x57_!~2+4KYWDWoQFHenfKe3{CtocS7J%zOxy>APknieQh?i0^iPNw
z&l$Ms2&z(0CpLl{*2*Z5P=L#)%Ntu0QWcE_EJrydhh}$Pr_+#G?1x1npJb4*Q*#$~
zVMpGu4p$FL>u;gyAn(d_}AV;q5P?`)K=Gq+chA;c$Ivi=a}R%n=P5w
z*RlCN`Xbycr*iYF5S4b)UAOP6wB7H5keC+neC@Ud{aIHV;0gGQE3_oa@~-G`f+X>Iy}6Q?@Xj+?%1FxJSp^f>#f
zzo#MUJ#xy^VB4(!@LtPGIcAlb-_!!*=yH%D@b1hNKA*mhm5qyfe35vN^|D
zF)F)tH+SU-JR#hj~)tX
zS{JkbBM<65k>lJNjTjawp+Yi6xK3-_k5+Nbi68Iy(>71Fmw4
z4c2S{M<(V;?u=v<6Iz8TD?AKis2IdIln?z3Wx~b@aD0@s6ydfp@+*F7Ku(ml(Mb_(
z(eU^ExU)>Xhk(q(W4}&|;yd#ZPnjTl@M?v8UlUcX3kxIk`o?g&`a$yw;t8nC62}`=
zZfrm*_>xb8yR*&MubNkNH!s3X0MML=C-e*Uanp>rb^P4=W8ExG6~yvS_gCjOFTg&@
zBzf+s=9?J{;-_hby-m(l&6g6ABU4gjocVYh>MdO8l>VfWF*>%oE!8h2;2qQM{yLY-
zgNb8nJ9n6!{_wF^+5CL#bH~`Ls>;G=3Xd_W!y^?GV|wv+`@6&Zjuqz_K^(IC)@#MP
zddevA#>^*LS4$`B4L<>RYRmchJ5)PEA{N5jPyuxNAoSUBhVAS0IxN%+0uvy$Ti%
zp?1>|WFVD{dBbDGqH{Mc>_UT!ul%uj1mMMgu*0h^wAp^Kdk_0vJY)IvqshuYzTb|V
zxm)6OC1r1Mneztgs_w%<);$GrJNu#x{pdF7LEnv71c?J;t)G`&_cFJ&-p+M$aq_#K
z@rSw1wfjld&l!L5XF$MRfjwW>P=QahRtFRL-mIJ;}D+^H}rFF2aivp%Y~8#
z;|V?zrd-b5*?`qrWrB($i&%$Eq@JLpok7NJgbQ^GLqtL
zhp4)*Vvh~>SbW#(MAfl5=f~K(@bJ^C@{2)LH}dKxUA(k=-lKM->n;|bIkPL$BKBFE
z-kFl^&ySdP2g*vix5piR7%VpUe&6PRQyhsJL
zQLtDl7Q{s!!5Tnre}RP@AW~p!rlo{2xd`2F4{V5`B3BX@ww{}&u|J5_k4Dja)xBWHfEWi
zrA5Rn;&1DXqvVGg~FTp+1xfr@)yiaqnhWhd5v4qmrfR#-Xg%j1dkNq60*V#P
z!fNHor;^-!*H0>UA>lwLNrjY_L8H^n_AlNQi;wMyuGT12L^TxOJ1`?J5`c%d?a_Ako5_uZS0dS;QjzP%Tm-$y4+lz^SoljBGl)DK$|x
zR2D%w<$Bb$rY(12^ZB0#&xD>RNPZbw|8nP$-DQJm7z?IM{RNHz(Hf8$SP9Skg2t*U
zyJv%2oSr#Q3U2iFDjZgB&!1dkx#Dx|#<_N%Ru@znm#mck5mvCF$p8K^)*X)ahR4Uw
zgyn}`?f#Y;zW^8fhlK7SYs*!qgE+c$C-BJcrNE9-%E{P~BkB_A1#bO^V6!QHZWp|7
z7XYC11sM&ai@!j7OQ2d_Ykf_{i3Z|?7s9x4F#f^P>tDAH0vDI7$=KUpqI$U+0l~Hq6wJPe6;l9-PnAJ+Za!um`;OYlt
z_*|_|CxQnKHwC${Kb6}YFh4!5z3OuF(XYEN=dB|BXAk~6E}@;Q(#L_3r=>F!l^@ic
zW+PT4sO@MHWg6(FEZT|HOQf0otuv$o#*zs(nMG3nLaboMd-t*YXvUSo!mL@
zVe2^xiW%M*+_rEfJT5W8LCVbVQPS1t9Uz%0)-M-~>vUq90T#)Ck>7yyy-^DmvysqO
z2gu#w1@J8@B>Q%krK$jeFWX^8E+}0pyL~Womwm+i?PC8bXYHU>FBB0vt#lA>>UYbL
z&lQ{c#apjhX?kUv2CWJDRBl|cnP>DfqY<;p5Jrv2_mY?Tm9Y#H7e?6yY4@713c8eq
z>Wlt}X50W2rt~|cE;5^WF>owuElx8dd);)@7n?8176mGbOz|#t4HPLDgq80B*Zct1
zCtfmYHN|iaO;_EB>#6ntpZuA7n<`!|V+>v=pFDo7A_^I6p)JEwYlxv?YmRIL*H=lK
z0H+WiC70ywAXfJ1E1Jttif=D_38tNxOIwFbiaA4#_dy=B#CQrmW(~~Vou*Recd^$q
zedML%9W$f_#WK!-h%lt&;MS2Uf0kW0?g;=_aC^i`AX_4_C}K@FO^;}|n2!ymAd|qL
zGREjw_%-Gc1+^uWfdvk>pM>_oM)-cv1Y-{fDxiOow?qD^p3nQ$Pmqw-Ux1Fo|LPWQIY9qHs%66qwpo;0yqjy*W
z&Fw)Yu07RV{50{2D7~U~5B;>N(~(uO)m@iz#PU0)UwjudXY2L`-RiM9c-BlaVEHp!
zdDX#CyWHZnqmMAHd2JUNa>(+)goEKe$l)b8$y7$JVfcr609|eI<7*jLewSf
z^{fa~GBK;7Oh-=7IZ7>He}_$|d|RcHm=)*I`zBxGoTepm@?xgG_cTU
zekrMKAFtpsbqS*nYxkM*Cw%3F%K?ktkGQqcC`e~cJ#{cZRC?<@*O)7w4u*BvbH^;4
zvD-4P1u+QMN&Y((*%o-`r&_JeSItHRcbQwHht}OLxosF3ptDumFgEJ!`kTSe#s#-+
zdid@PrTtHqEFLANnx@AWVPCo4f2=zAr|&6IP>Y%lA}p^oYE=|!a=mA4_xpfM*Uv``
zf0M6007nux`>S)RK+hpKPI}12A|}6vHdl-^M~A(y|5B*(WD6l9K^!L^zRjKRk3_pc
z)aD4{6HgM~sd?Ta$OubU9>FrL9#Mzf9)ZYyl#Fd+c|={u7rhX~sm
zQ8&=TEI}7eKcd+J&+PW@Zl>TarJm|5EJ!}NAe{JvaZm8ysmB(EWyf{8u6vMaZA!A6
zs9nFHt*v}<;5C0?Z`FA9p0&qA;_6m6ZM3uB+MVSQtdaSo_NR3`p~2z(eHNr9Z*sI#
zT%=9ZsvXxpa`z#(TNR(?Z-3-hWTu-|6Z|T;?Pr67CCDoW!*cDK<7cov4Pj}Ik6c_a
zdeDNB{pmUk!d5FcpMe0rVvwSc;EPAL0@?1}M`?gWRJ{+wYwuvzh(I>ket|r&JggRN
zpRiZCv!A#opOnZB6t6sWo#+`}^^&%Tcm``U1%PC<0L$O5u5@=vU6_le;Pj+qq+c3w
zTLI@=EI}tHcvG6Kf&o~073)T=q~r+=WLkLvvy?LiXAcP(brNA&z&6xsyh5=wO3Iy3
zBS5P~fO~!pkzeBub?O^OCvzyZ{o}?eP<;unVs56`m=89g(4{JW>2pdn9o^0}miy(a
ze*7?Opa#HalieDM?@RUn(Wftb+!x8Y5?+806|{Eb~d|8Hl0
zBhP;ACaR5b2db(>Aman{X#^hlZI%=?cf9o272qQ}vswIRE!-nwLJ-D
zCj}`aoT%<0a5bV<;)?gA5WzM+!67)}rm{J=ICUifEzExi=`&jgdoZYDMm9X}r
zF6d+){;feC(88@t6av1GBG@%U`fpTf(Q%iBL8of`9xhmiBpp0by?tT1?UM9B+s$={
z46A$6_`eE^mKCy!9){k{>-uZ;?(5NC#JqqEi+~HDW}f|4ggoC;8eEYpinKaebFwV%
zR*BsKw^`;Jk2CX_OBB?{5vx*4?vq^j^dXn-Zq(o0Li1NAu0k
zKq$U&ULsOUXh(xOo2{;-QMjO*Z3(4)$J&kElRex64|Ix;NeqbZSpk?r)~U;cl|^WV
zM6bzK^&|5D7z9{3Ey^!E(%K9rWs|PG?_)176~l|&ovwysrOGNS@g_4yHZp-88zHp9
zfCq!{sr5lB!K~m3Gc>eAc?LOZ#L&VmK@psQZA4(9U^d$Y-+?g3TVxC^%u&Y3JDLE?
z-_@!ju|z2cWJ+&QGO_Xn?xXsF<%S3{M=(VtE2^(w#yd%Mg7bfghZ-eg&j0s&U6g+^
zCZlzSSq&L$3@S6zDgwyCI{6j3WsE3ycf)G`)-Ex9Ri%l4iv7->Ala|(y8C&QP#
zL8U9~{aW$MTa)7<=k;3x0&OGXci(=+3g0RSuFBw<-0)nGupoSYUV*htLJqFlxhGOY
zx99)*E+n^EgD<>SNWa|qZv6!n3E!-~)ND^YhYbV=;6cha6W?~1Sil6+4Q-OzL?SNq>tGSI2#K;q_SgogdV$R!AHE?84K8E_!8s>pjY^4
za4YD^B%^!igN`kIl=@@bmc&<`%4~!;0T`RPi_|>w#73k;ncV|RubyS-3S_~!8&qr2
zi1dR@yvTi%$_b+aA0;=NFfX*CAD}uoFX_Y)LaQHnARKl>D!FY5drx=^%Wc#(`hEzJ
zFH6*q189~b?bIY*39kJ2!kjxDw|)tMWBuZG9$R+SR%iP|)(^JPSiwBX=&v=KAI9C=
zxc@$r<=_)c&N(`IaP*S5Ra=1grU7T+p8l@Ml;{u>J8FHUlY6zHhgo_}E@Es0_&HGtKhgROau}Te!HLdRg!kM*hMX(Dzkm2!7_~
z&yel_@^Jl5b{B0C7OV2dZYo*?#^Y?`ILUk|TAGa~A@R~+F=N6kQ8%vK8O4t`6n$;X
zPYRGh=KDhNVMBBzZAesZi#&)kwWx}^2^wAZ43X*afSa(;H$@c;@)J@93!f7G>dLx~
zNz88oUjyphtW0^Ln=(ZG8)z-IxLOs@kXCdPAuRhosGh|DZ3$=5H5OIQz(TnH_R_*`
z?82X>c%t|xL-)o!Fp0KCy!ouYl`M1-FRv=EI_GK?a`nfDWwDA|I}cFHDH@rqM*FfA
zC03=o4U86Zq!zYsd+wAwiQk_2K9A?E@ykIk(=xk+T?wr4Ro&8}rJOtbfHfT-3z9cF
zGhLY%D^^u`ditmMg;d?p1!If+9B2cmlTZFf2MtEOvp_oi4y)qBt+PNEpdI=dgQb)&
z7JT+&b*Yl0hx-EVpMm>Fto}qBdNV`f!GCp&8L$J%XEOOKsK)+*A+BRqh+yOwR$#wC
zeiDNf+&iFEO2#?Cf}e>Fm3IySO0vIFiB)`)6mG&txLfdMY3=w~7@dBgHu(1}zk1mQ
zevHRl^37C-U5&PCiIQ{cZF6`gESw?jI(*YdazQQ3cKRYneKv8O&9Jko7e|duQ4^k>
z-z#Y%o_=k2s&x+~oWB-d_%!&3;Nu$c;i2N`UCqK@|NW}ref$yzVvHj
zp-IIbj=7#KJ(6N{o5up&$=ss|WkRKL^gx
zmMLqACz7QHh!sQF^rKMYG|n)of>hK9)*7^QoT1vtv{LR;R}fl6A3;Hs
z4^$BIlYBC-DFLmJo~=-%9IY{HW3K@gC6=U_dUk?1w>Z|qwtJlAiO4%1H8k5^@bB8&
zYu{|WDWR&R;sb4yiVnAY565>7y#%Z8KPlKhIjEte-&LQ+bt0=*=?lG!bE0+t|xzxk&S&g)^iCk7StDc%LEm)sY2@
zxtYYVWkI$lqD5=A9XSf}hD4_$=V8GsJ?+H7@|U?23#Le&PF;!!nBA7Qg8(l6!?HcGw6
zTNQ}~&9(@1l30uB5T4(>@WU_(*&$HCOO__f`K?^zQHpLIP}(597<8G>LeiV?
z9r}2SJb|j9h&FmCZ>i5Gz|u=#hJd{)3M}37&#h^!!L84&qm>b;)-_YC*#nSb0Y6I3NWh}x&F@Sb<(DiT&HKcwB
z^z+LM$pDObaiDo%z=SfOqade)SHS3lDjAeM#m_J;6;CdFe;jTXWP%gf8u2x9-v~M|
zOFcM-Zh>in%&Y6Z=^7JmEB~&vbyyFL9#6LA#Vzhk;xl0}@jWsvq%X#;Q8h%&zo!a~
z4W)}X`MxR!PDT4CRNqh$EaSCvbD?_gR(_hPcP_D*37m{8q-Q{N&W}3h6CDcS?&
zSfoS7ZGqCKn>ExG?kTXsK0r2^C&M!3aIS?d3d$`Cw)L}QNqo6x58L>3bzxGOXSsa2
z=FTCq`H04N)TU}{YoGjRMj4c{y(GnUGUw2XAC^l+kbz|DVx%%&`5!BT!6yogO<
zB_Uq>k`Q3gXxxMn(cxG%?lInq%1?JxQ(xskc-^n+wXVZqL55DW@g0Yn#+N8FF
z)Jso1sZfSKq}0Og93U}r(X@uiA8J^gkQwAVfkWZ*WXLbn^*b9D5&%C
zcy#WsXkWf;!dN`4g?S=6ezkXyXK!0OGbW23#3smIU&_6KE~*YT+hTL5Euf&HOn60I
z7Kf#DNeW~A++SQ#U->>_b$aH8p0DFyY+neOp*p&*>kc}FRk`c#^xC=LgJ{tIQf}sn
zyNf}~sOQGRvaP?R1YYB94p_y@ofkLH
zIix&_OctzDJ4$0XPLvEmZ3ud-P~J(29dvGi$zy~yI=2jrVyzpiaTscE@7@#0ONd|qC>FQc2iZb{~$}bS?0g;8OG6WgErZJr`Vf{tTZAw9F
zzgccmkm?7f6S0&zxfA15G3oNeaUzLIe$Upsjf_hc;*OOcOd~2}0+Z1A;qUw0cgkxV
z!*3()*~iJ)F@75dJ1)W9<5e+AI=};ofWo*04xs-9;NIGtR`>vjewxJMNi2+koP&iD
z@MF44lQ7B#W&dXZ_9HCwnjwMZ2`hjgV*y_4#4Rc4F`II#Ug!E+YLYzmiLL4Y@KLXe
zahoM$wQ*BHTT-1}dP=_ZtvwTMzHv#2yYmYDC+expDlNgdX%SW$aii+_3~AKVuP1z!
zD#)*F!^e+4b9Wp%yR1>h5z+_y6^-LQAOQpTnD!C_V+vft)T51p&?SIOorqK|CcxE8
z*zQ&kJ$~ZhV4#$d-)l
z*fAKKPNTfSqJBW8Z^12eLF7b~^6(5P+ktsOJnVpKin+PXRPf|ZxWxrugH8wa6RVk%
zt*{Qw9S;Y*dBzNBTOWJHd%;}VaxAeef}%d-4qa!a^|w2_CJLzoM|L8{EgSVk+(lOr
zZVuZB-+Tv4Ms|$JU_elS=q}Ct`V_8B#tnQxy64wV0x+XIiKPG_qN%RHPpAUo1{+(r
z^RP)}6x!JWQ^-GrPuFi%en|F
zZUK8STG*L=RB(X+(7Ht%mR^I+*}Cj@%6xYKzvr%3Ul<-yT49%DiG>ymXk6nnF*Tz`!W?KMNES%OmPW*K>`pRd*j`O3jpiNCLlhw@ArxOuj`
zGkv-{mROE$kwe(>!p64O6lGE$E0WiOm_3THPge?%PSFxpunf}0Ql-tAu_+3j4qwf{
z`}a`qq9#Z|&&g|Ehpx|#LD%=oUh~tN&6)H!y6Y#sfs*~(X(c1aXuk$;%8alr3=DF_big;2Pf|l*v&ao}7+t*wD
zw1RRY)X)D(xz3!??x4d1!hF%k9aZ#f-i{l#haam#k48WG9Jzxvy5?O;+`4S4g1(4(vn|}MH8icmF}Yj
zG5#(6U&SMS<}ptycR1vq=51ee!FPL>?&j@cN|11?exg;T>*;a_|4jG1CYf(wAg#vF
z(CX12&kZU~M;$6{iqqnPc!f#J&7IpQx5(qCWY3}qZQzia8pJcUbr-%#!PknVAfrBR
z;S7IJDp}(jL1zkD=&f?cI@&;39LWan)TB2XB35m$gH^^q)pog4s{*Q*!$-d4C=x?E)!)(YUY@CCk-~6IRHBZyC`Gj-@Un`Y3f!
z2F-31MlQfDKkddmZ-8Xj+J#$Hzdvu>M!wC|9)@ON-h|O`qaqOtCQM`hY?=!~^Xs?I
zo?Q_T)=d0kZyUY(N#pB4Z<0**$_+_p@8c14EA(wG`208bdb;ydXB6
zT~D6F((kr+n$*V<6(dFNE}#&TPM(^29p(G-D0Oyx!~#^pNm5ZXu?zC)R%#CU3iE<5
zDrhqu!Of1SLWbF53s7XI9oz>Y+bG#zt;Vy!%ydI7k}v9K0GeBr5Tlrv&ST~)z~{t5
z!VrKKLE*@zZk&$B08~KcAv{jZ%bV;aV1&!UroZ_+R$z}4-+*~x2j(WDXoLU9A;sp^
zwSX#9mx9=P-fPbUI^JI$A<@fKz6ve+gR!b=)srg#!HwD+x!8Q$XI&NbhJE+~%dKZd
z!tBaCm%KexT<#H(IEwA3-fn#vEWP%)<;gmQ-^I9qq{#W|h=u?^TV3jHuwfoVZu&`5
z?>ufVn>1xkJ|c9mSqd{wVS_1UTvN4TjA7oqlntg=8{vtiS3ni5!*tvX1l7(xWs5Y5
zhv#8rq|>uc($028WAa&aFfW%3(0QSb$hCB0BWfFfz+%pPW`)%GUHkZvYE~qgjV~G@
zbXtL{9H-~dmJJh+ffqp18mN|j3edgVnf;HNY3geLiD}9j$3JN1fWmPO{v%d~s9GXc
zfJe6qaxCVdng#A#`yqpDfmj!!gNE$@neLAk+BG?V4XAOwu#Iy6>t#lGoiD7)8lg0YV3M>k+AG*kq7RG#H
z16BMW(U6&2$2AOR?Z>o{~&E4RYr}HBDjQ!vzaW+@c6f&n
zyc(>!Z4k;~S^Yk?Hr}Y=JbZH9%9npq>p3-`dj9)?+WXdf{;=*&Z@(g&?|JPV`qppF
zmdcLy9z}G5OKf*xLx%DFd!y2x(Vp`iLjhGTR(5B1J=^Nbb4Xlx{mGwSKLu6UPHsQ&
zG3M`Cv%YLmp}tD9op7xMz|^CK(Ej93LEeq1Y+Ib6_?I`G#~AvTi5GW^2|ZXVp~vzg
z`6l5&m9+B(9dh}Seo|i`*d+X
zc)2>R9=Y}O;~x*!6j|JOyLH33U~c}lkOF({GsF+QaHL>hIvl9GRFy#6Fa{y#u)XBD
zm`D|@tX1D|B4bI#l_tZU1-rcprS>rlmGZJl~Sd$@Y(BAIsnH+
z6P;)O;QF_G92%{2q5Z#q_c{Oh%`caa`e)v9Fu-){
z?Hk3PP8=&ME2_cBuWyu$ASJ7z{U#%3%8p`L^LXkfs(mxx=NC?Xxvi+USUkB%Hm>H@
zzE$|G;8@)T@!(Cv&-YH0DvvS7za%`KGN;%#S9=tH)K@Ci7ii`HVN-cnt?+(-yIJBQ
z)>idZfwW9g+bP!d2vYOF1T(DvO(+Om0ZmLH%cVRqCu`WU9`$a0xVIw&c`iUY0A&X+
zXo*ivSXWK~J~YYbV>zxblAbM^l7+Jbd^t>X%|ckDg-0bnHL=Rtax!`55{KH&6(y{`0;0|MHQ4`N;pJ
zkG$~>R+_1~NfK-e+|aEk0)Rk^o3$GOrF1Sf^b`#`
zbnmRA@o!P_A5-^7xaox%=hcjV5Eer5IegcWxK!7`4==ObC6*gD>(xaWG+V8C`pHhQ
zBy7#I+64z+qdRRkwdfF62_~Syv?Nzt$X5v_`w6)Dz_HWQaVnTxE@vP+q}lp
zz<*cvB7aW<(tmKwQh=GFFrXgqyh?PvBzt-|Is5Yoo$&})>d
ze<|u}KfL|Y)-uy=UvDnlRrkSjv);S27TZhh_LRJ}vWjnbJ@Ban^T|e?#`f4o<5RZ{
z<91X-HHxUt9XDQYJ^eOoigc|d7t-r2SIST3mKpF_nxw+
z;6+mbX&};WLO^6mtbxe2BOi5b7~_xA;E!S7rd_^5B@e9wiaD;)WD4^2G(bc?6#O%n
zSPeqU2Rt&B`ZY2Ud}jaupD#gxWj@=+Z3Xbs9|Ck6zprATu(}MJE*1aK3V~%e#HT;y
zTH(R4_QC+7LjXRN1^+3MEOvff^PC-7_+O;-=1BEnE6H*N$3
zo~OunTnb@|GNdiNu#)-|(uw5S;=w|20z=oLqU2g*w52K39F!2Fmr@&gxfkTD1#I3=
zcuoXp{HM2$w@`=rP1;XAzH)@S3@`3g+SF^A|BHQ0P6H1157v1B$|u_aD4;V6Af4GY
z03T4qOwkS~bT?QMt*ueRQ<6%GJaT!9oC4^QiY4S9*E9j7J_V1Ws8}jQrE(z`g6+DA
ztkYfqd7Na2x&@q+g7?&sxCP&)y#`j&ZVg1dpbkgOgJ0Kto93_<{L<~9?EutM0>~RO
zV0y{LAi7xm1(sxgn|8Sap%f(53`kUGT!i}su^8o5xV
zhw1@BHKE^lOA>(k*ZYr7-1`%rJ1McTahOBG03qKC`n*
zwY;U?DBkn&&EcFN=Y~Jyv&4C&Lji5U7S#n2wz3ZZ1=G34Z5E)#kh}oVg(DMmp31t-
z7imk82(2->h+#T)NVG-35lu9)5>0QB(=ZX?mm^-*9t-J$|Fc28eYLqxf-m!Qr1|r^
zXk#@)P@lOSziFaK3woyOiUbv2gd;*MtdWb-s^(cLb$CRuW+&%IT&VHJA8*FAJoQwg
z;tyT>@nCdh54z_nJ?ZzTU%;Uzj-%cRONlH^yaZ_<#B_+2GW1F)_)OPrG$)PbE*!c+
zeKT(0`{T_2H~w&U!gW6*@?5$#ctrQOe@wDQZz{$B9hiE*^MXSoWftLub)}tRO&^99
zei=(QH$;!7EAditF)E1GTSF>&lqyQj_!WFy~2ehhKV~H>-L=>R7tuO(R9q87v
ztY`M-sDY&doNXger-l~55(qpK9byIW2USoxq?p|a;skLQu#1pdTnH@T_En_J2AIKB
z0^*veo;B4Ei`y8JPh8Z0h>(x}bRXFNbH5mI1b?US2AI20U4&tw?-ygF(fKy7NC
zHd#E2eWLBD3_z(WGqg(rM7~-wOydas3U6#8JRM->HO&uJSAUw;@qLQv_I~=mcCz<>M-w;->YK(hKTD2C4@<0
zfvsJLY*iMGcD&Y?*Pz5~40jbSu{XM3kX+w+-AZu(RDe<^i%#htg3wk3#8gH|v^!`g
z1k1fs)}17eNQMVo;3MhqeXh|Ilaa@PB@HMtM!I{0@C^S6QLqVL(0t!7RLd4dLg*#9
zJ~N;VD(ARse`B}FwdXGaT91uZfJLh-fS*Z$|Gr{r^jT~#(lJi`M~=o)5dkVScw7@<
z%hV$Qhp-Z1feiq}@A!a-lQ#^_E0@k>8O8v`CcOv=waIY_bKf
z((DEKhXet~CzY(HPN#vbY4TX}v$yslS^>Cog!=$#51YxX%0mbc-QufRqnl7i34~oks{e-c
zKzekr)udubaR6sdfJU7{4NRja`*R;$=jr%8AZ`kRF8w;8H!~4HG21Kp1M`@dtv!}GW
z_a_ARvEdxAi&{XLNb?Q@FqL)HDRKq)>0TvBI-RA(%_J
zS9C7FsD#q!E6CT!xy@q3Hv)d-1zrjPW-smuy+UZbE=knY4!h0$FtxTQeK
zpB~9wr7ee|S)dci9IZ*K-3{tVGOVLFIB*0uW2x@aHr;0TDdW!34k{p1=9bt2#&mY^
zh$lulOKiFkMJ_~BKBT<p6Qlz?brsY%X@gDw7oFvQq51i(#$e!%hRYGo
z*77F8?SJ5@5w%Xo
zlN#RFQ>P&yj+R2*r6%&1wF6uOTg;9g32o^;k>IgW9V#0J&19fa%n(of*Bs;gf2rvS
z&N$wlfYAMtxzdpk;$c+;TnryQ6B_(pmyivUEBIefQsNO!Fk(z><`VSKg
zUfMFPNSip$icygJ%o*dEed5xRkRnMy20_VOXBy&?=WQn)h&trD?IDvA5x6A$
z$jW1jGakZ=P%@yNJrfkdjQPTp#$9zEDpwDz_H8ja*Z7{C)n_qG2ZH(tf)9jnjy`mKFLa^Lg!+cOExCRzFI;tKMoZi2qq^#5|Z@
z*1y4W@A{%o71uQ@6fg8&Jm773et*fs0I4E0?D_{+nrKG3>+?5K#hNk0^JSaQiZVp5
zJEd>b`K?bP8}n8_KjC{ufj+n%&N!GX?P}Qb{<`+EdDgb^4OR`W0Oxh}^N@QPC$5(r
zZg5%k+rxI>(6Hl}p5MbyK=~$##fqpUyWRfwh^)AUpYiDme@(ovZFSOQM#ic(H#IDx
zIXcmoVDyWM=0EngjdyiWw+nu3FZ+EkhS-W(?#jyS$336L?)@uxQ{|gedAmMLsvA2$
z?Cx}Or!HV$^J}#|LSOlD&-zE1S^D+l+={mM?Y39%-VEO1-tcei=udCq^KVT&^cgyr
z_Pah#$NX-OocOuc;fmtkUzs<5tq&VaeS!bBVV3XJ_7^Lz{dwtA?JD0ZhZc`EFRZ6I
zdrVIe1*ETA{lUD$-sFX)&aNjRvvlX&k?Cg@Z1{Y#J-Pj(yx(TwmR+ZguM^P#1@NPE
z&bjQZ4g0as=C_AMv%RoWVy_U7<>PANOzAHjpSpqID?V1#2Ul_&b<{a$_k)=3
zjMA7_3n1x&=)NC1kn*u(y+&h;V9CsBttlNZvs*{#_8spZ3H&ZUJBT%%`=ZA(d3t~A
zDq*4B^?3D#NI5uEbdzYCr+{JM1XGwzF(q5fuij`dzYT%_EA|-E%rx3kKKDa*fS+z5
zSrM^!{`{2qz~YAqs~OfMb%CMfNVZm8{9#b
zZoUQwzC6~NC1e$aVa}FwHu=W{oDZLS+bQ6$Vox8xi#Oc@TgsZ|%@wUL`gLO1X7KU8
z`D?W~e@1hiJ1f+Gw$;kgLfzY7g>zNSJMGQeJ3tRmH!N|+JfzJ1k2O9iXSCM}qGS=B
zF5Mp=bRdeL%a4{E)HwXnNko@LsGbQ=BMWNdZiA>UI-2!Zo%=
zb)N2o#>KNk+)~Oae{;M9mQ?*&H~=r|P_LJ7&zz9$skuK;%5~8WYK(ILN*sZjJC00{
zy#?c}(H0RLee!3do7pQE0ftL9($SoX9tUV~3XSo&g?pqr3rgyfUF-dDNt>goeWeSw=40II+rG#{tEj6O}j`>3oXYxLB|zgjgOeV9>S
zXeAm~FQ8PqoESD;-up3#`(%}XYsvGc-vXHl-@7^9h7Cotx
z>Y1gCag(WvirI&Py_Y)FJreUUJ?Zg=V`BwT@#M8xg|WZCv{l{iqZsaG+lVLw!&%k~
zn%E~B@N+TSPFd~>S$pN!(S%E{0`JJ9d>ULjNN{zxI1)W7(ur%I!y)*LEp=jLNc=
z*rf-8AMy`21gBO+Md#+323D$`Eiqr7!ugxF_hRxa}bzN+u?(7hbzE`&~X?i3pB>yavl&-B$a9PdFsC)
zGKKk-kq%Gl(?A!r5Y&f8FtaIeoYV!`yl98^zRlR=S6B+oueFgsaU1kP9>!z$oW9drO=3qv$KJ
zJ&#LqUf{#pj&bjiXOonFxYGl2_+!MkY1yu4Kso#v`3?Y{uS>p7v%(xeJt5+?K>)a~
zZrQjGbeKYHWRlRG|FU5AI%F#R)sKfvT2lUtaNgMZ?7P8RBVmPXHi!MDDu%AOTXw6R
zzJeXm(Ca*s@Z0cPpgPE_^}~dI@3|g*|^n?Ri+w`S@+4^`{VZLGl%cJ
zTWpuRrzZ2_n&*4;DRV=q#vaDJ*s#qaJC0s`*hqU;WNX$oR~naYpB;6|`gva9p5Jx}
zUH4?I`lvbj;_(Ldi|uIOIr9}d>HfmBf|nj^0+0BZU%%s5X1yDG$YomWNeS7qdUt`_
z+M~{qug;BZ*`wYF3W%X=|N0M%Ghl#m&M79K38~_#OqK$01d5CXSiu}l^c%uT&Pd@>
zwL-BoVTcD{nUZMDGA_v777|P#g<({Hejf1pwbofK>J0{3=lM4H6U97A(*iuWPOzA^
zK`BeiJydW84!eQ33@}H_6oU`zKg9={v`Lzb{gz(wd%Ag%$ZcU#5wGFEJ})=+k$qdA
zc>#f0X={NSUfd>3l}M`X%jRxmT~mfk-rnS4SL8KwNo+{7b76LykhUen$?ExSeY111
z;cl+9*r4Bh>$c@Bv0JinyU)5O+X6wuujl$|Gd-p{D1-0^FqFg{fEmDnPO%tE@IruD
zG_z&^?o+!~G(~-%w;OaVfutfhB1Gdis?Bp?k7>y`T@CJ(Y9MwvL&Es3Cg=0K`ay6vee0fBz~2
z{41SZWFI~N6nlKBfNz^fMS1Lt8kWL115wPt!>|<^ePvuP%>u27sAu9~l<#T#_&Juu
z3OPtYB94YAtC-3JpSSr^%MukLTQN$CRN@Nq**H`R#{d8adEs&X^VUznKRi7{K7V^v
zy&S=~1xFbr$F!_c81Vr0^FHkfoO&mLr43UsRAar5Y%o75_@zbzNW(EOkc`zUQeFnI
zn73W6J^)qv{6NEmCE*;vt7N*9`p~ptW*@wS12&273Q~7Ex`JE)Vy_rtITk?tAec*E
z2_NA2XuOieMx!{$p633*h80UQz+yZhoA5HtZerI|4i#Q=mMhalal1%RzDX@c)tQ5^
zBtpK_Tf-XQCn1Wz!F4}!XTXxBfJl!dhgyU6*9Vg@_@j(;*ohkY`?V#%BZi<~;(P
zTCu>b-0!P{SlTKm8VGB`(%tMcTRtNSM|6Inwgza6$lMNHHI?RLdj|hOlG~
zDph)^E$hcB+1`qyUaB`5*i8
z{~7!8SxC-lK5dOhs4t@pNF$sE`mUYj4!wJ67VWs)d#E&+?=Dp4DWSp%wNU->$t(&kI(%_{3fh7H6DLcF#2h3pXQ{MWq0JHm
z1xtims7o~dU}BhXv;otRv$E(G?D-oZa*o2VmOBfB&qGm^-p$Q_L&=NEdBO6|LM6myw3e6iHUiF-F5p5^A8;BG3Ie+4SxNFDSfd0+QMtJ
zHo)Xak1kBVJb%MwCO_Z7BrAW@h1bo;1iN2EmUhkibyxGSe67h78slTrKkN*ze|XJo
zaZuI$PQ+-hfCv7NI<1zakY&P^K94n2ZWo05Ly64qNehkzX4$~#t!Q9Q7n_oA9x+o8
zxd5)TOyvIXh@TaJ=#5j&IH9m9$Q|bck#9>pQ@$}k(Is_Ak?F*aw50SK-lKny+Sj1&
zA745uBQohuprA;H<@cyyDhY;J?$PE}$-quT{a8If$NT
z+N8VU@44-dCXzs(lrceO{+JF@Na+9vcii^8^%TV~M>apRq>^kraUIiOv2
zxy-zCQmeL?QO`x?w{GU0vCb}PKWEdG#aIxQc5|D5#}+GvA|o)p@U&*OmD};Wz)f1=
z{D{~!4_YYqCtWEjTEcd(R0rzW=C$419$YW6E=!zTqP%~uZ>hJjt-&3|=W~00{KRoA
z8NDa#?asZl>|B}0^z;UY?y)r4XEx}hzRbc`i9i&0R_umOs34^%4XFws429|-j4!29
zaF+n>bp(*IQBP{R5!W7Vsn7Fj3W_@qroU~*C)68X*XriDg%+V*3T;aYkoLwc<)GUV
zXgaL35gA1GvVhP+DQ@G{McZ_XZPe5xb|+(L6buFprVQLlhtRi_Lf^xn7ovH9HQJ^L
zBioo2HNT4OI9s&0X~Ec9avrxQo)3zQXJzPiN)`~ShZ4mz$u`mnt5K~$uPIsS)a-j}6@_u3;o(g&SeY}W^0RUY=v?SECZz3Kewm%VvgJ@*u*mw8`~
z>ARMDYN#_K3!>V+s<2%jBlo0Ipkm)w_(0Vr&lnt}Gm@Nv1g{m#*k?sEx%04Pa22th=pAyk1*s
zUpo&)K)zB2tRVA=_P%N*BP(>ZwgQR1Q@d9)3$C-Lg@?;qdPGVW$;LQe?TuLG`QDoP
zrS>c!h0@AhaQGzoI@Ixv)4nrJBn7{A!%`|TVox8iesN-ANjS%>_}%th4UAlasNFkL
z52j)|`reoG>;c@g=|G6ZwrtA{&vX5s+$vt(B7lngjhir?=Ir5O4xPhFlGcD_kU;T2{U+14qn_P-CU`75r;!H6C3
zG}KW0m=il7(r3eU+&Ms0!_bVJ^G?~a7;kFGeFYTkb@3_wSsNnHc56!G>`<~6j2N$v
z_e@e~b$+U-?QqVE@UN|Et9;_t`C)SMgWh3_Y>ta^uu0_&W_-n|QZzo?KgjPv0(j#Q
z(6k)~>-HEtD;fcT9P2jatN?vnDKljQ_qAex%8O?b7O=ik^iQN2ED5_6_2_3L1`{Vn
zKs>UmBBZtK=#2+e{I5;g+XZ+^f(B%ab+2U=NWEQzx)r4UfXUJXydFc)>#m?k;NA)~
zKS>$U#NvfIX@BSF%)bhxPKjN>jh+N8AHgg>RnNGNZi>SNgd>mw3K$4zqUz#tb^UsH
z1W?xv@K9O5Z?OVywg}2EH<<@fvd>o2BHZjf)JK
z?96(QbwR|UAVsB(!&3GnYyuc-C*>`3@tTIq<}T>`L^K$5n?MR?6nz#NkVGtv`<<|;
z>H>r>-VvXW%i*?jg}T|tPnNB2JT;sU>b?skKqcC_rk@$+KyJll;{
z3NpE4iDGN}bRX%O`E4lxIOG*LFgnRS+Hh9PwhGk~E72KC%Nw(*3YnuZq+Am^cb
z_L&$!gC0*&!s=z`s8tZL08D$ysb}iLhYn9#5-Y)!yhM~q&hApS7)K-B{Y%@v@F_#o
zUh;>I@p&E^$IY#kFU_SYYIvKI#%A@6>dXRniS5erd)d3)vR5B+ir)C8!{Y!{O9m&BT0jPWnLx;bOpU84&4F0&$sxJ>OEAYZlAA(IlMJUk(SnJr!l=Hdk_
zm?}ffDg4Y+q}*5qX|_cg13&od_%;4gjsX@i%DjOGY;8XZ9bon7HnQdn8^M(ksyHw-
zxs`pkvCpTX)Bf%$L?yfXkKgq!CKYe(lMBX+AMifx+Bm7<)@`Aet2Ba#0@}J!c
ze`&TMZqjFh4v*(u&l7XQvl_
zp=QEplD0r|^s|OVE)e~ly}s(xDL%dxs)7~N*KkFG-{;TT{1S&f9c7hge$M?l|HGN9
zoh?3XrJWm`=LPKiZG%OIL}K-Gs%4%sH9GzFgWUcmMtRNS4rlMjORXE#Y8h^(K{#_fW
z0sQ#Nu~7k<&VEdKPLVkq9JNfBNY!Kun(DchU58?ccEtCK;QC5zMFWZ8P!nE3UCXWvn*BWkAS
z9_l7ykJ#&5KdUHBI70V3H-4Wplg3?MT;^iBID}Rn+aB=5?O2&-=GlvvmhCthaIScF
z*`5?#{{pvcY;nAAUOczLzDS8Ie0F4FV&~q-nv0da0jY#lQB=^We9P+c>IXaGq!Z@O
zVxBZ!%^!G4@h#8suSO@jX=Y}9fl+R=D!?2UhxBpEEU7T^QEc9Iw_h#_dlR*GQ0~W33o@8UfQoiIGf_?oq%@Vo|^
zAMcQljUtn0;ltq3!7ubR`lOxLr{5*bCYgJ0hi5im=CK*V(CeQ|drwtt=dQYZ?4FH&
z($mdZOEljlKC3Xi8va^>w#?sO;bS~`_jFEp&noYRuMvyoYna{+57ZfX&_PcF^a|V6
znRg>kcjslQ;J3m(gDE8e3%$ELW7l4JbZKoZ9#vKDdVS^*ahcD|uh-O%w72b`pIZ{S
zPTHHXvSg|e7`v@sm+O*7L}J@y@=;{=7si4DwP
zV^l%gIu(NC@-k_W8*g7ceNdstoI5PG@}e;{A74c!42}~TI}go4^*pUepbE+p
z_Bf3JPZ!2*5iDpC+zHgC!wNI}F_07%t^2D@G_yvi
z@&jSiHf;`aprwbUHm^k+Yc$({9ob0NCtu|vsw=-7ieT
z)-O4o{(`*F9~)H_8Q_~-I8&G2xki1$_k{G}$+`y~dVce7&NcP%C-0&i#|#W^UZmYO
zV0%r5pn^=A4Q443n_yjuoE^Yri^AxwaAtFFrb{>SQW-
zPtz+AFtG7ty}2P4mj*}fbC-68x-h#3|CD9GD0rIq>XuAI-Yc30(I(YH1*0cNlJAZhHdYOsVI+gCz_kwo0ArDt~yHk
zBZsUQ=N@}+mYV&SN~#uUkkR$OaWj0>;W3v
zC4tX}uF8a_MbO*DZZh)7S;QY-9W+!OipUpQ#J%68c$PQjDvNfpCNq?$DyC01Yg#~op
zOs^kwvfd-yTn)`hthWVB^(*q@9S`njS??}U;Fmcbei_&W$u7(S^I?m#&6*Y(`tEvP
z;&W
zN?5<8aOlENS699{YV@RR>nz@F+-2uOd=n8p1f#wJ+`1W(>t!X7^rEGXqLVTFiFKA)VB
zXuSip`KMTOd-uJKhK=L`C9{rSgUD|~Gq}s~0a6cyU^Dy$TeL#>@H`4>1f&q-nKPs4
zvs>Ztto0-E7Q%+rWA=0px#F6_UN8XI-=YR69KQ+RoAe{%Rd2bkjlfQ-EA9I@gbD*e
zoRk-Fi=a&$=TOt6hn!DL;&1221o^ubDp$Y%^m1)?FT3>Gcjp^B3$BLmUKeWFVyw=m
z(xnIeu^z95`#%m54WDX
z(-l~1WH#X_d6icbAn`A-ePnp-%e_b2xI02h`P;vXqRoT$kQxrp`EjUS$6|Z6;x6
zUx=DXq1nX3fs(N-AZ)jBtd7wS^@K9d2MI={8rK#LBY0DSW*g3vyGZ81hojvOp<;fF
z5;P$Mc}d48P(w-dFX%>~N?W@O<3AjmPpAQ1t_Msy5~N
zf%4WD<$iUq*)K#H#{(zMULQKXCpcMjZMQPsq$;G@wrHHNht?~FX|GTd(Hx9^x}Fx6
zJqT}mmD}HJ=snz%;!vtk?C?EX(RV5I&42l?#uIK
ziWUl9y>BLMBZjEEa0^WDrw-a2Sn1yK{qUn-ZlX1Hy$LBYo_UjJYuAqIn#04_83A&};TrM-MB&DJ8H_?_mJGO9U9ZWjSby=8vGIqB~uVJ`n_0o<)
z*Wyc2j~1u-iM9YmtR1Z-vtKQFdp{t64%km(@b#&G03EO)eFQ`<i
z!q=%&z0^8pQ_YXSJC5c73Epa9JtdR7s1i>M8_>o{pvoutDVo25OjZq#E_Q}yM#&a(
zts?t>!23XG$0L7eqd~K-!ip9i)1a23&DIu*qJb77+L9Uj#G~GC8eHDNK@{&CRSVf?
zS@>r0nkWsBA7g;1ke4C`BSYP9yp6#xC=0>R8=$hxVlzj%dt}Q;$d!Ab!?hX85v@&&
zCcNpB7x+cNttRDx2<|pgg%HbsnPT&tT@Unh?+_3e#4~*}9(-Ex~Y)2x%S_
zbQmYkU&`3rr6R2kBL-pWHIZ_r)2hu*?UP_06Ns7`2|JnzIvCqe*KQoT0PC?P__kU
zlj00Wp=e$wgD+9PnvB^v-&Sjs$H!4_kW5
zqPD89+=}_E@Zi@_IWl~m`Qx@G9lsQ%*sX2kw0=8nLR)mas$xQ
zRYxIa$YBJx^pd{w7yycKcD4HjOUQNHhENE*4fxtTIg?nKLtk_smkvNP*&2oAIS26%
z?4&w!CV(zmene$Fx-~9h;@JS*XnrbQ{RFdYWF$h1VnEzhG9WIKWj5`}%=+m=cG2ss
zC7Vmpuf=8ie2$+j*mc?Dc)oq%={C-%jB`Vc4)~?xzBzUfr1NWmh4qQ&huiCYs!d)8
zp1b+xhGLF?c6@9(Bk|rT^vm$wpPoH8w6q|s@vUCDqAxLEMpP?qS4=)-iec!)C~A-=
z%pB#cxB+I1L787zvv7AQ-5LRDDyZoGUul#jU#AYlS)8x-)K&m37?6+rAW%7Ltk@pv
z8(@~N2J09WtM=R8r21zwaQIg7WlQ;Bb0Zbv+f#BG+)-
zF^7~`5sx&$dr;YC6v^aR3fW<{ViQhu(o;)m4KQi9zD+Z878rBDc%!p7I19nwLHNlA
zAk%<6m7PUEC@2@`b3q5~!a;niWVyxiH*tEKo(Ml#gNuJV#?STy)va2N4S=+Hr%yvD`%%YUwdvvYLV@rkuda@
z{5_?#;W)=iaiCW_zHL{%XVNcuuFqe`(FD33R;5k@RzA1N{Rb|{->&&m^wLw<@iT58
zyY}Q(QkfU1c%QZnEn3|lt?tv9kwr~YAQ`U&1k~fy|Gcyc94u}XUn;|`Ar&}4GfII}
z>~zhs5MnW&qFK$>QICLZVs$Y22AL;bH3eqhACo?2@+0MpOn7c=ivcGA%>itA&fYeH
z1u9kKDl{i)oS7ABh4(0BJm~vc9r->RpY~Xa87|n3#hpdg!3PB2k$s3hB9{p=5Ofzq
zAFlHN>-jsmQhSHyf(izxO{`zdAu-VFXT_o=a#1pT&;g+7hMa>+#til~MI7P8;EjSr
z_29rY&PHr7x%SKeNRcFv{(iLPSHfG)n2B2|vIhabtu6)wqTls}J2ux^`2BXPT=#V6
zI)kC-m+n|!xVigy%9gYpyRZHJ_HfI>(XMi#g{qLZ^Vz+!_Sn__Sx}^pYsB2l>2BG}
zf?Rn%ff>8xxvaTu1v>(^?N+3!`F*>S)C)m`5+(RgEBa}miCWE2StvM`KD#
zU8t3_Dm04$e5F^$wGSkMruGypbtgQ#xGOn9c&N+-kX*-j&^+44+uYadppx4&O2dImQ
zU$nXO8DQ)EOrMQExf?0g%dAJh=wv*gv3HcappDp}`P;Dh%6n*S{OyOQ9?i^2i`7$|
z=-O)ZZ&6)2F4)`cBva!-KKm325LF~v1*^B>dKi#vSMAe8_u+a^nG4~=%()zPB^b>q
zplpS2;KAyXZ^Y0`rMs+mdD~9RqG>b%1+h;csAdf+?5~ONptgqGi6m#19y>SyWt|gS
zjpRFDjPD-)O=xY928hoMH;d1fw=0$-SJ}0t%IyTEZJI}S9M;rFJnEd|v&@-vNS37i2)Eg(SQFUpY
zIo8@zC_*%w+h#f_fzFxIi;D0=BlXataRvG?&wb(Yd^C5LH}kMqT-%y(xm60ZMwhdSlRphOxV{
z2Xkm>R>v@W$=4l7rSt5y??VBRBx)Frez@0?d|msQ-e&m+^}glkX_T*Cp}i*7C!3+~
zNqugsDN9OCHm5#(Q@Ns)bE5oV=XjP^U?;GVKpH;x^AKd_v||o!(*VTQ(y(kHbK0eEdmyl>^>iH>CuJr&`5a}+A8x-WD=-2xPW<$UIIA?FqSjtXm8Lq0Ti02wp7;;4m%ER*508{aasXq1L=mQ<`1Uk
zyyn`0AE&7Ks>dxV1mBD(s30`E_6$U>D@j18N`^O)FTt-6QA}_j){w8Yg-{HC9()iN
z)eF!oDYAQ82ALh^|Y62W3_zLtci+dM>0|H89-#|VWJPX#(<{n
zp%4(ZG0Qvs!4DV1xIc_Ofes2j=uZ_TlkNjF7pc@C?5KD;K5h(M4ThV+
z>gPF)&@{Rmv8s!6TC)ZB_IaSqK^%OO}5+J$`ZHd{0@b;zU|+lwk0)JT=BoW;|lkT($Iwl&Fk^pdVEFZxrb)CBI)%l
zDe9d<>)r282gG*hq@+?!X#P>nb3a`t4I`vqMUTL=spfCfb_bJ2HQH7I9xcLmLpTdj
zT!H1qvI+`eBbzLQ(Ce_I=-aeh0CwsMN#{41j_SSU&<>3yu^tarW?9OSEcgiDjN1cO
z27r+X0SZPwha0S$r$QSm&U*lYwcmvxrac1RJ}-9a4#2+?gd>G83|5Ct
z^$UPDZ6T@82Y3E?8>|3NzVQ*{23+PXq&%mNk6ZEUGFd&|O-w@{_6f+%r}m
zw2@4gI~bC!TpOTfdVKMSXZGHm?2JVXn|Gt1igbb&K8Xu53^{%AT(r_6Ba0>K_gAFX
zw=7-q4503gm*Y$D>`#GKVfhXeTFiz6_bSSC(u9V#-u1i6EM8n+#?+@BIj-ka`?0M-
zIef_X<@;^u##}#kFye0WdFr7q#sj&t^`s;8#aCX<@UW%3;WNVu({Rd~{sl(h6?m9H9
zB{_C4*Dwm1%~=GN?c)S-4jJE#D5BwaR^TjyeUbv!KUG7T@JQV<&6=r(0nqOR-kZ}z
zSPQ;_O;QXG?4!OkmN5HT)XliD257y??t2kN4hrKs5MBDPde79GFL^S>lZ$4ZHJ{N=
zEGyt7XbWP-H%2IyI7UufWCzQ~n?_}tGn_dOu$O{Sp#sUsH^L({cAQ|`v4kBhfdQ5u
zon^_uW3lOqI8}kh{;NnLT0-{0Xy6W(T7x%h=wC#hq<*t}O&`8MiNR`0(#*T>wiAScXUUxfMv7BKo)De7+LC+5Ia
z5fV{fv$_&zYL;_;#1LL>_#MI!3#exrvU$FYdBhKRVw_xn2Z&A3!KYy43UgF30P$D~
zmidTVSG}w!$@g(PXS%$Er8nfpEm1h$g6o{bU%*J&9J08Euw!Y!qwQjXr;Ey9DR}O6
zyOBdwJOCL7XU+BBw}q3CG-MFb1z(lGQ6xL4mX#3TIi0nNVpa|J5}w*ywcwo2OxLE^
z0;M>a+M%O%ubh?4tOB#JXTn&LqSTbU!#NHVJ3cp1D|A#Uc^-938{L@r@%6YB648(o
zERME=d~>$rdJ%Gm9zDSu0N?{la5f#T^95WB29K&6%f};G$x!(iVTJJem*QK_X!ekA
z1*jLWZoQ5Jamh5x0fAXG*A7n-5)1L|)uE2y0+}2){32@XiN_V-0;Nv{N>RKMNEtl{
zNL+CspX8-@XAPwz6+b6<8iwtVRGD77KCB60(h3>+x)0J`-$2oZ=VjX&UFPe3QmlNN
zYPX*>1u}}CGfwBPTM{Qwhr6{8xduo(3aqd2S$y?*|ME*C%7PTBx8B^7WdX+88=tMb
zDV~9xmjf$umB$yC?t#5Fys*M^wC4XEv-}$VZFwVMkJqFf`Aa|l`f?eA|OTtiYPHlMfxVC
z(kKWiM2vJsdQl)kfRrLeqz_6+BA`HIMIX6Bew4Afkwr}jR0O*bDp-u*N3)i!kG^yu(Qcp=$f>_x8s
z#%L`Lk>fdauKbXT*31Y+sD8`6$S^qjgs!{UUM8=`;?*>Ds#awE5s}+`;A(!sarUsp
zkOLajvdjQuNBb*NIpLXqc55ZMw^&a`Z?h-qBZnp^nGSkL&_mKskKw#4VG={A-4kq8
z5DG7~mUBha#jL5@@N5@$1wfhb$Tn^yOzi}Oo^rU3N6T<9A=yccI=K`E
zN~*)hq%st-yd8aC=tz*mUf3wb@||lJcRho*51vCSgDxrj^0uvxBtBb8NrrekURSrN
zfQ(BM%X5X!eEf~HwHAq51;OrwNrCtntWTT3j2x6J3HkGhR5T+JzmnvHL`p)TcCRS1
zHo^rZHeA{+4hi2c{~lytUxllq_~Egbv|q_4{bUg2wI6oS#QVicoYFLbh&(Z{hv?2X%$P|#IQi6x&Yp=kOfrtxZWfa*AkOmwJ
z!O0XiPAij!BnCYJl?LJRAygA}a;Ha5**c3{h+A=9oKbwQttO?+-=oqhU?rg7y^AC9D+8g88`8^tA^#3fy3J5Qb-|k=E%wf?
zLxWv?)d6}q%X0sQbxRk-77Bc5-s$fhpbCHQZRl(GdPSrfAQY2`2>dA@c2FlBSQgQa
zB#e9&zn9VE`s6>rUDk9(ZZ0JuX(AL0Ur+CP=g;&5;w5{f;k6>Ra8v2*xRne^Z
zPj{PM0Sasc#kvR(3_A_{VcE~Hqusb`#d^q|@ihpShZ@DE$%-b0)l
zX?v1)tIvr;F4vH4l(jBu|w4q=K=&*bZez7W!Op;o?K7E8PO
z8<`Dk{j7MsVLWc4K+`XI6_CNB-bEUL5F22%
zQQ?Ozn5FOVksar!|9}^!#dnaF@j!V$XJH{s>nmGGZlZ`=h8gusV(VflHvj~5xG(Ms
z)Oucvl{*y4rm$(kee@>rol$w%4k&7Ijy)Cw6g!p)_4;q5f367b;*JdfwVWl3*#qgu
zzkk2{U~D5BK)nKR?Z<(XB}2M)t?U&2IrX1es%?H5jQ4m~`3!gIW!Ur=g}#2dt8TnZ
zz>ty0RnW>Hl7d2^bf__ZZW&boN{+W%j6_th?Aqs(@!DW#1|mt+j`@uEwk?POADb@U
z3vz;M0x(X_Li98Ld1iII8zO{DnQ|}%*Fec7rV4p_L}Z;PHvmK5-uFI{$=Oo^bHs}F
zuF=;;!#pFfzjrxokkyl{?vugv)HX4T!hFCIzAk^pQU2PAP62oWj;-&?mnrcb$~C2G
zd$6lW2VlK?FluZ*;c|VeQ3obr;`k!U~{rx=tFOM}te_DM1{CpSjrJFH7#J%!r$H|zvQ=7UDx#VrTD^hW<
z3hQ|}wsc?rgp3G$!KWImk^L)@gx#u-Ax~%
z%GajAC>NM=xt=@1;WNc&2CcZ9gFKv6wT>5>k{-)mWh4ZtjGkpcwMOrkARK>3E}y~)
z;cvSsn1Uasg~Ol5CicEV?tblrT+yRg!Te
zMB-vO%~wC{=)RFZFWgDIc;i7qx#ztI?>l97i<90w2i+GHCtGZ~eQBA%>E=#9Gjn=-
zc}8#D8UOYvo4454V+yI&F2zQAzBg!#JGQ;r>3y#D+M`>6>Vf)dN(ZuaOkSA$3~hwM
zxriZHCY<6xTjundqTE4Zr`Dd|`Rdnd_GM2S!7Tq8FkkBITL*_9&A
zL|sFxlkgI|aIkeN$_)VIF$)LC6%#?kDc2E!
zba$2XI2@lU{M5FNh;>KI%04_1XNX>Ky+rqK!qZ*MZd5#6+&uBm&&~VQ
z{p&@8rZ3crj8ElEyfei!nMXxB$_Lb36uqw*^FHo(yn7?J%*4dK%o*qY{U7IF)+u*9
zKC;@}Q4>Y!Jg0$CanCz(i!N@Nw^~vUyKvtKWt|?=&fj&sIGWP=qH(>qsi!!{_;s$m
zgVIV@6!1C%!<^5G3RvC}?{P@6vL{#`32_Bt7^ToeF1lt|c>CcjRA-df@||dmg@rSS
z)?zID1+PM0jZE|MJ26TmRYY$x0;(53jHRprYQ4W8JTX>*sM9g7KP1KRA&qfj2H%lB
zwyb4)^_=u)5n8I6A-)fu{2Ym|XD~y4ph_YE8UXmUvUtJSe2EqDZg-I11eg^vI54)8
z)usDd-jMZzi4my>rFK_w}
ztN5Q^P`_`DPER)4l$mvC@s1sVwaL>v
zu=$v5XyWF$p$OZJO~S7tZw4l^Nuqfsfn(I=fNFY#V8N-M?yt#e%3z_Ds)joXQj()$
z>y)dTJ~;hTlj=V|KNd1OD7MYkd+{a2UViWAfnQ4OxFQvwR
z^YmP_aWZ{o-jirSeEt4q8$XKBOb
z?p7k4N{{ft>vGr6PRIYRl~p541rbC&w}zVqVi_oTd<#|F4}Mii+Bj&1OLI_{6|{Iv
zjI^OavrrSj(3KE|K%a49q7^SL5RD-z?RI;BYBJN`nu%TcmiW|pn1sDB(HnDIgzLoV
zwhLU9HQUi)@?P!=sSf};|B&0sZb?Ic#2BcGHbA4(^0ms~q$>hDvS7SEm}v9B!RQX%ynvD6JlS7Qk%e`4(nMhE{9#9ryu4OErWOMXd~S^lgJ
ze>Ax8f9kXP=dHqiOeJ80=ySE9?SbM*m)-Aan-c6D(4A+tYgw=9dhS(nAjjb4c!gIy
z*qh6!Db0I=ZXUd55?UW|;^WEaV)T@HxxMd>R->%m1*pV5;r7YRu4=&zc2>JCJS0#$
z2V+Cr&JUC(r)R4vB$lKsv6tPBZ!je!Xmk{@2318ru{phJ_C0&FNA8Lef@Cl(Y=SF0
zfgh=DtD`qRXS_3mMuzwOxngkYBm}UgKUWy)2mHC>6xfCdvN)2q`nQ!ZM!p6G1}sVj
zcsD$d*IWbYQbN$eln7iE=5Rs+5?tW$RC4qZsLOyT0(t~>YzHYDhE4+i(KWOXJr)n7
zc;F<^_5!wL>zntW4rdt%z}CnUWra(!LlsO^Qu@`h?6z?
zm;7V>^@Tmvt}ZtZ4;&G*OOR6LQqtm78L!txr$=jROOcTNsme(HhsY>-ufJIbe}`U=
z4b{9d?^JAac~3Es^wZ{)VuRJG#rka;$1?4sy?5F87xycrbxzdWvOlY-nRlxB6h`mn
zw3aT@=%vLvhI;?CuAz3{tccxpzFvtjN6S~+3>+<_8N2zPOLB=bc~umlUjC-@#LSyc
z&oW>Am9&{5&fA-u-MIM5@%9rA)jXMV2t3uySHC(YECAYlmv7>L&Tt4UyPt=t&pM#l
zZ%Nk-FZfBjI|(A(3m1dIUT1|BEXYftG3e_mFj%t^HL%G*a0)2`ju+!)`?2*<4R%U#
zxf4XA6iEH^a46#ay*|USk1?VB)7jH*ZGOdUpEnOfnj4-5WEmZ+$s6-|Lkpj))_0Db
z?Frv@Ox5-{e>F<|0&v}EkAY&s>HGN!Zk}u0tM4KOYb^H`d3iP7=!<=K3Z;e|=y0ja3!p0gxdJn-uNw^n%wF6xo7mhvdZxnR%>33^
zlaQgc4d!PSbp1BKQ}F@2yN1dg?}y)dT~TYz*9hs-3S?t@You1UP90~bk~9Tu4sU@(
z-*{KxGud#%mwEESq$|hK+ehofu3Mpwcf51gdQpa;+6NOfC#3^j!xQQ36$(feqoow>m*374DJq&N>)J}p$z
zvXoGgvFe$EBUDV!Z0Mc+{>e@z!+G28>tw>C`KU0<$|+Y(MYqX2M`}i%L#Lf235uy%
zM-(<5bf_$t_TD8D8Eh&ByItDdFX59T>4PBwiktYJnLpF=-Lo+$<36$b_?UvJ_i!yi
z$#aL*Io#R@C(4}Pe}UipxdOnMI#O4OrhL3@4cKEd*?1Wn}c=C{!i#Mv@_nNw$on>dv;=g4#crd6yUEQsKjF#AI4(`#lOV2u|ZMMl7MT$AfyUg{stsCZU2lJ!4VN
zOx)ZmtGL%Uf$Vw!l<&jD=+5mZ$!<)FW^^Q8-E#C(Y(m02KhLH%aAO|-0<8ohA49`?
zI9&~`lSQ5ShV>$Il|atB05H-~qV;1(vO=%&$AM9AMh8_(YNAn4d&oShlm(`+vh;LM
z=}P!Mgn*R&0awhGwPSg9%OH0m9-J&N0JHb($5Iu+cb`@~GyB;i&=xLD^#{zxT
zW^U*DBQ2Fy&!$z%(^#i`$_`itdw!mqR>)wB>N-yDlsenRp2$B*ypflH%lvrK6ssZ%
z4El{v&Ux$eD0-^MF1t*tTm6F%vtey)$V={!`k8%)dEphm6|1Z67E!Xzi4>L|NGWIa)Q|78gd!N~TfwbFn{7HdG
zNaYL)U;-;6xvJzXpz~>sG@ACDA7#c2UN;E%p?mOaNSdeHY++2IRa96zV1CH*?{xe`R(QdM0aB4gg$!4BI$F*@k^)A
zS$`e?#VYz3O}<%}C|6v47ua~03eGkQ_CB?3+iKL!$W$S15kbs%X5#!-S=IZY-!nX9
z`Cr%?AE0`T6#l#2n8bWYX|Z~xTi*_nA|XNW&Xu1ert!i6>koQE=WxaUklkyuBfmkz
zNAP1edGZukrxUBo2(iJ2A18&wYTcmq+CXXtn(5C<#M!bUp?nkZ{#XaP-aQFc>nz>^
zbGryv$QU@UP$Q4?b&fevbdX7;*&(HF{OAp=wJ}q_=06$%RJ2V{>_`G!g1T`yIjf%_G`r4KvE8p?kb-LK%!;Hhm
zMZx1n51QYumj*Y@8*`7$TC+U5!1I(){U3YIjRbzx`pju~oUyIF|0Ue~q|@Q`
zS}p!dRZCyfihCyF-$9SU=E~4>9uhR^d)dvCNV$N@QN<)V{E*l#k~$(uaWQ4H_>BgA
zR@2_$Xy}|_JJ2wC6H_|Fl*Np$tE^@pM
zMI~JLIS!}83EF=@koyiO{Vd5#qxiGGWZTBhX55xq-PdYS5m7q&j*lD;{q?orNmi`F
zV*;v*vl)pl4~Y~+T{Jk~hLY@SEP1~N;HQfB8wk7rw%RBwEE1c%2w3GH-s2GSrkUss
z^-6^akqNSshOZ}qD6K=lB?q0{*K-bfQrQlRcF_+yir0U6$WY}~4ATn|95j0tURg6e
z%d_u)&LoH2I=Q=obSbgt!KpWS;i)fchy}O1b+EK_cJ#3q#akwcGd&+|2hE?{SB>d9
zdEs1)N0O2tf>%4*;LK8S$ujmU_VcWNG&|y$Wn*p+Kh!$rb=)n&gQOGxzu#17vfr|8
zOAF&oY`mP){6u2zKh&_J=t9)*Z@0JnbZlmPTfinuSL#}65WKH9J175%@AYkk^oX^w
z+xC!k8#S!CYoDmWZTrr0fLdk2TluyO&%`4cK9Al+eIlXn&iY;aDY`7Lwdz>-#d}}l
z$(utxlqWmw%I;^xg@@lg!1>;lC)DQ;_Y145tE#K#=7baV_4QZHA_D?WmtN&?IBSNC
zw+koIJdJ-&-g=CmZgotM<)h;BkCk86>%#Obn+$a!u~OmSwOYl`gPjv1+a%rTjF>q8
z`ve?1PjEUEnd2HhKYg__bPBWY0OfkwyT^`ZNXrrFbYyJ1!jJg{x
z`Y2}Gzo;7@4-9-;9~E=qK}7zrU2!=S{hqbD7WW{+FF(GP8AgZ&z&P
zvW1OZKtWW4dzSV&+N!aLU4BtB
zBp?39sJcL2%oQ;axgG$A
zdnqr!8WxLhAY%ZKqUAiV#B0EG1KAw33J?
zr)o}!DGlKTNx5@J1H0hA4Cz)aC%E3^Kd7VD*zcFySwOkrut*_={Npi_C)`9KK|E&%
z8>trzWq+Z}ZL)NWZ^vuM?eL_-NZ|w
z;G)@l|B~?vdcJh;{Y!T-8{EJh<=3r@hdNQCLYGqKMdC4*MluWcCg68>kK~
z)REX7oG#e6w-XD(A(Hp7)R`~Cc|Arb
z<%r;50e63cEbl*v8vlD0XmMM^dMJExMB*Nd3zts?Z0d>I@dy5T5R)qh`^XKxw3>b9~ou111wfodLtdO~TN_0f})Dn~GMk
zVym{p@!imO^cGtIO7(a|@OJ|(7@nRM(7~MrXbq@&ZQIr$*$?DZZ(z>=PHjFvr5%qL
zJI!VA7D^CE0N_B<_6d|0$pk5+5g(jhg1VrUBsauOfak<}A%hrDc;A4Wk_Z$42@o-A
z$2T-3+WWw%0OX~lo*{2VsGT!b3G9LYSMBSnQZHq#2ac_4+7pxx*ydWPFNSF**ZZOG
zwLRo19O(J#t`hq#(5E5S-uwNuxx*GO^7ulYpQk6}?|H29IdXn%>BXJF1P0gSx%ZT3
zJaSNcUUuyv&{>0!r;-p7p-_;*B5-;HVc_syAvGGd54{)3@ncex(TZ{nlJ$U9kI(|B
z*!54$Z;*q8NRzyiWDLG}tJBdpqzj^(?QPp+cjd-N3=6-h{sP(X^b^8W&n48la4H)m
z-SAbcEh__scsjCqx`TaHZZEqpHx9?w5QHH2SCSkVB&om_?HW|j7Yq3Ns_1O)1`?J}
zNn)(Wp5Eswe%gQ>k6uoc&=isZAW8DiQbi$RLnN_^SlW(OcQBD|r37Uh7_isjQ`SO$
z3~lmvKsC06yb+n7pmZ^=q3csp`IAeo_4HAWx_C`{?c8Vi)y=zw~1HE
zpeQ!Pv_9e@bWN`JmtGdkzCu!hT?GnPrD_ul)Q533I6e^+I-T6%=_Ha755GQqh=WaO
zvEWfrfF7fF=1Z0Wb4lZRSXkKy&Yt|RNLu*Cxax+ita^>thg1>i6yaN1xpA
zBIe
zejVH%Mq;|uUj63O-*g
z8DGPgD-+P?pv&W+VhLC*fOTRbi6m{5zW{$@!cRM?9P~N>+lGW|)Y7De;I8W^1;6W8^HLb+60mi$6>~>!
z=TDQj?1<3a*?gh-@$LS}$>}NaTZ_*6efgM2oe4OCkW8Q3muxmm9-e_lK_D}P9eg_m
zfaJeHOEpN!gOL4JvD1R_RZpao6|+^XFS6w!-MNtUY~izpRy`Wkwu
z*UlkL?EtWd5nxi$3S@PXHaK*XLrC8tuAoy`;R^z
zy%mF%g$G&{rx)v%;_QEx@~Vw*
z-$m&nfHV0F56-D|R+L06j00Ia<=fwDHbDK&_gN=ftA#)C&MZkS^UreepgET59g#i2gZ-h3s8S*Us!)r)-{jXPS0{|pIi7NoJe+bS`Ycn`aRhJtOx$?Cr5b$9{(;4<*`~Yrdu)RoAxCv0}B@=Y%
z#sJR+i3lBNHPVGaJ}m1_1EJt36KH%iwgUR-6B-LbwharhB0qk1xx`ui
z61XXVNRWh*Jpip=s6_b+2Looz0YkNTn4VNXJTi+cC>2z#5e
zIyn*Q20)tHx70Hyysz9z1*c=|em8fu?j_xyDseh4WhReL#pE6d)+kdvwea%X8_|!+
zAsG#aJE}r)nocSQshRqdxl6m~D+qU!^&Mmda`cSDcY{`p6iAh<
zH}eES9Vp+=Qk@hjcI5xNLN2UFYA$
z)5*SIPF4q|F}u3>CN4=XHJyFc{yqZtGHtB~l0bJo-Y@Wr*oEN3{72u4OwZGjRZ|L8j^|`IY>#5|;4gb?{f-`UV)}yC6)=6vnbQkeo$9
z-M3+Mx4yQFvd;_;J|%?cC%!DZYOf;sUYa0cr^t5^w_#CIWjLjsu1{Kn;ArGtAZPH7
zhaUk^0{e>n_m;99{o-s9L8x$#%!XiJ)HQ9V4oW(HeG7z5NZ`Zznf8mox%M*s`B5QwY6F=U5*~Dwsjpl+UfbApfcDhWKBoThm#n}!`6Gzu)AeM
zh#-^r)}E#-KAxwC+_V%SoxpG`{l<;X6C!WZu8NUVza(tf0pb~-x+4d~k6wPHX{*QB
zoI>sFcyW)Icf3sX+QVTE%kI226d$d!s+P;4W#J$k9j7;*Tcckru
zE&FK5*#0*_pm;&@eJIIVmd!X#Rg@2No0^19CCjO$GTHVc8up;9ChhJA2&sjLHrG={
z{9&G@ZzZFU^|~go$(jU_k&EnZ8;Y0$TA+jy%s6pxcd?CVxZM!^2d5HnX>C@^MQK3#
zwUFIxfPNqyWGvT{of!X(yJJi@Khm*k-@Qx4JKTN3U(*~nR?1G+o4wF~buIc_rAupI
zoUO!|wW};`XhebjZA4=y;RZ4(h%X0TcC@TF)e5WgARfJ!$0peB}
z3377)SD>D?nLX_zMM~_EeE$3#{wwXjb=CjPn?=jJ-29O9VE)$0)H@ZaE?P@*rMHbcY+uIQYjK;Z^gLG4VCLp^N91GV>5^+2{Ni4X=lL77
z1J^9p?xqDzRUgRJzEEcVQ%v02bNn^YYblw*)soeK5TcqfKZZUA4g|oeR&s@ee)oVG
zVpI$di|n^Q_y9U72VLE#(qsU;`{4qxirfMiIW3rFZ-h0V`9Mvs!uTEvlj8bF0R+(5
z$pY3ph+nX#Yz3VSR4y=`XgCK?9$5l*=orKwkV_(3w=v~vk;~kK4n@A+L5U_PYu&WO
z&2iC0i|1hV^E8oa9t2V|MPd68V6B=A58BG;4p;|jy||6b
zi3$652N)<0*I}dBWJ08@>{f#7f-FH3A{@P&ZuWs){XgC8zFF`!=bR)Cq@yBS1}TJJ
z4V1j>nzCC0CfI1=!~S+|Jp*6`V;vk;wp>4ae9apvN^qQ{3{UgtlkC+9e6G?M$qIpX
zQ22W>sDMa~0!m`bzAD3MapUbM67_gr;H{TGDC{cJwoO)2%r4#Z?TwGA`L244six192BR
za#$JwlScVnPXG=A~1XBSXWHm(Ma=v3U*av_W@sAc|@bYl#e2Xk(8HUGn
zK%?<_3^*GgEg?Igi6U+t_+o5Mzj(Rd^ctnBO($^?lsca|rJ&;0UjA2p-Rh&h^o34P9b>xT}Tb10d!wT%gV
zJ_pr)W{36=!em94-!~2Jl(TsfDq<8r_xysaPFyc5dC1@y0CSU;OMG;_oWp3$0lr*q
zdx0SP7C`MG4j*5DPX8bu5D~6{75Y7FEj0)>Xj@p!Qj%|AfTbKd4$kuq+frF(GdMfq
z$uIM%W7tR>M|)PTiq$|OS>u}}IANtE94C7!V5|oJ)(CvN_^ddpwfHhYh|^f^h`_7_
zCZznm^H?A`%u|A?;-E=@FBD)$Up8jd3|dl8+UUQdCDj4%dZs&-nrBjEhaN(^qDvF_XHNRBp7pXV51ls9a-;s$qO|n
zNB>t`YR`Ygpi(}qH6~dwv%m7B*B4@fzxjR#Iw}@|kxLg^8_q_~3nRwmZ{j!qYXSUg
z0sLzR_}32bzkdWgZ&M+uAPMkZcad))Ea!GHM1jP5WV&mqDVw~FbOdSOQ&osGxeAc=
z*|N{eTa@2L(L~0&ny{zf{Hr9B-;a&7HOPui&`#(5HtN4$(vPX?J9Kei=a-%JB?pxq
z^YoJ(&bnBdbmSVxIKK+a`PjXaVmWEz@;un{{KZE09sG$YmsboP~1CT^s!7UTcxI_s0XTuboUczT03A-%U4O@qa&7
zUT;RA3A3@nj2`wXqT{DepDvs|`|u&jsuUL!6Jwuc{#8@0=ac$Kv{n*N`+X+EU*@5QAV=vmuRH@KCAuf_0@B#;X@W>
z0~#J|apkeIFOw%%HGJ^)YY$mwVDHMAzD10FcI?|=d2qFJ2oal7<5}*f=F*_+=KP{9
z$m7-hE!hStE-mlhR=lD67daXG6y%rV_P%;>ul&@vGDCH(E-w~;BIkth3q|8W-=jI3
zjmz$Zu4xEUCp^O=n0aB+a^o~*4#Q(p?0(G^r38zhH0TV_h;@X=vnCjs`c`lzd3zhI
z&_z|2zaF=T^RuO)m~;%L#hQmr!>)wFD5+FMx^(}21kWnC=I3Dg+VUwwkxTsblIQ#p
z*<&baT;(Qv+#VoX5nv1+HX(om)hjM?WX|DF3>dM~C`AdOvO*d#sCDZfyL7eZ`E`dL
zg?uR>3$)K;>ltE77j^^^+r6J2jL
zw#QA&-y&B4vgw1?GnaF#k(0xq5pg}qMS@Lg0L5D52>e)&sUv}3=RfrQH9gJlI+o{0n!JEn=D<%U+zW#OANu`PoK
z%HP)#szz%>+JWIJ8@1%NKEgjGrh`$(bqc(Y(fR7_pdhW&vGPW>hfCh2;_kq{S9PIg2kd)xb(@^;KNmYV7|B^*WWBmR$i`+Y
zZ;$Li1~28Zs_X4fE!)dx{o-#{cMX;DiIbvJm6mBygmCS)YJPZJlIY7yX*(+kKRT$u_phA)TA-P1zwhq5o|OU4arZtvIa?HCSoi!d1M9JaX3st|*JY{g
z%DR_sZR&4jP;$4`yopIi)t+(FJ&SvGM<+LA=itoAM@UOk^6n$+jZkUTo@M@z)2-mg
z+CJfamA=)0Y2tM!!oAGpX3ibjHc@rqsmG}<#Re8H&HC?n8@V@HtNE&4^A6E+v8Xf#
zLUkeP8U-%9oR9wqGJ-jZJ?Pq8@xMOI&;hRjg2Q2jmv^1(S=|xD2^^Wx&Zd-)1l>E|
zE-tb@_GU*_T-0v9Yd}Wjrm07*jW-1DEp7b|wOw__Dlaq|SJHgTw69k>-uvj2IF;lQ
zlWX@|KJnFd7fi3^%b7Q2!FN6k)7%?OGxB09I;>1yVS8-cY@T1R?3)I(&uV*Hpu7p{
z8py9?Q)nU7Nos~$550EfE6DYz=~U^c-|rqlAcnPN$&_O-(j8sU=YF=F`5gLy%LO6q
za?tt$hXrdhoX1{LB>e*vBkM#UL@zYO^8AT0@~ij_Sa?qA{pX6Q7p>o?V;f^AOWIR-
zBnV)alO?j08^9ZyY6jj#2H|^7F$8kIekS#cDslzXKg0O6KUeJWhC1ruY1yi_A0gf-
zQVtrdb1$ym2%VWmf3bSWfS-b5TF*fV%J9z>B@TW7#*~7X*aX0Aa&=k?_Jg5lB`{KB
zcj4q`0NDH=FZ0V*yJaOFNMdN6jlmNWAtE+xaN^%M&?w0+azx*>Dn#DLHsZ%QZOamkZr
z=LEn$3UtJ%XXJ#Yck*}bz8Zb4M!mu}=j1z1M!AX2{l)O(*5$*=?Yy1QIp=N#?$NM_
z@XFRsGF7>Aqc$hkxXZchZq%NE_0Kd4FnQo!1}Z@we1;}+pUJQH
zr)S$Q_hjh-KW3oYngV>sW;>P`*$(KB^0oc;>H-tMFIeESlUg(he8##lk`27^iBoFT
z7p17+;iGW&mCCYd@x#KXi&US!K;m1*ceg#W*0EM5vR-GtJKWdJd%!PuETws7lxxTF
zJlCGhji|qK!&4j=aX?ykgS08zCwJ;gNOEuO+aJPHlAL_CNGyev?!F{H$A@|YS>|qb
zkFuN&v|d~vVd|b0Q9u9OGdjP^8V%zZqYoD(A;NIUKZ2l+gM5ZEGLM%y32#e&!O5Bh
z6yWR(W@QZ}vw>nQ7=ywQIRucFeW)`C_@h;9rMUdM{3v+V(Hy@oE`;;?(jo=b_6(fEwDAeT~_pdgOY
zLkZI}OK6a>s>@%tG=M!X;jjeF8SpDW0+RLSnYWdurl#6F@}Djw1V?gFbn7O1?WToD=y-!##az7
zN`SeDNWZ$uA4w7TR)!|<8<0?|reu<};COXmxBeP=C;YH(qB@2t{}G0g;)2k#5(;9(
zog2O&s{!c4?>iX0%_4lVG@dRi6~C0#8p+>^SiqzkY?0TTy8T&&pt4#o^#hU6{$;7w
zHQZD>NrpcNe!I7WF`5q$7)m%gWOCU@@$*^6`epbGAgVVRpiVO~4w@l=)b=_6pzPM{
z?d>I%V&bQOgh3lRm_Wc6NF)(WjQS#0J4p{vJk)r%LBxpP{DNzZZJM5H(+q~H_!sD8
zLX}^utlFKBeil1Hh3bN)#Vi2wTwVrwQo6`GqHz!gjai8Qph{v``s=}~esUGS{m>_{
z8s+^WJgDHVhMj=c!j{&B#Y-rlj}PwKQ^Cui2>_Tg9|O?jlDrr6oS^||@;v}e(11Y0
zx(F(|*fZ?0Es&6{OWX_MB;+SjXw?OV{+I;UMP42p&@~7U!t}4~!7o_kV2hdT_FuS>
z__`R|@ZewH`d@SXpI+gn2o4T-hFe{ke(3vb+uWFg4m-iCKC*$(|dezRiI~cbdq?~ZajXbtz%$??w%`_9|anGn6k3(l-S8w$A$N$L#-K8nj9Fr@5
z6!{5LfcFDMEES=IJifBpVI&_&Kd+VLOO;@=A?_T^W`zr?fw^;1o
z{q(y6nwsv**OGJ!rrkx9*#*Ws^gt^GAkKQdCu&5?_HTGwA%z-4~D*xD+~
zIL+o)_Wr;;>Uup!{X=b2%abN?)XJbYEgmJO+qS)a*!J!&G2?K5+&lfRe>67&U&zW)
z=7aFB_){&(JF;v4eOr_qb+3v4x_4>zVDkzWNW1*59NbD2j-w
zbh=&NT5a?EMd1^UvsGN|L%J}8NJu?DSGj|2v5vCm+56F!3MbRvUAM_*%9mdj8F$AJ
zb$ud^mZqm?-t;Q9?Fekx7;5BxH@iXon?Mu~q>jf#DST`;*Gu-h)g>LETqc%)=z3@E-rqeRk7x&b@aI&
z9(MEvGnm5U0BNI^{pCn)KhuQo+WX7Lnq&Jw8nAiLJMhEBxU5WT?Vz&B?gq%DmN97c
z{P(1&ALXxa^9rVBUoiy>F37i|#m-*Jm#@uw#_B@
zpA%ubtz+8WFRf$paRtdJ_gr_Bz18Zh?DhAzC1cZe<-)`x
zd(6IDJJRKuv`%A3Om$+CNrGnDRLNV?X{2w0dqrPae~;+V;8g$A;9Tr>Ebetx2xBmA
zpRasxVNOGXYhj_X1KJ4pXdupHdLT|miBNaUZJmYN1Gmu7_|JH$ebWR^wieQ0z=tO0
zCkOPB96JbYwASbgW`3-^;!o9
zRNmf;+J>TY%)7qLzUn+x?n0DK)^WLel*b)s&NqFN$$J{V+;cfa3au4kz
zJjMx--TlPp&p_KYE}RW3xM1ySR;TrH&xL@ElZh{3qPcdNx)u&YeDSG*yl^vb%Qf#`
zitp6+IhtK>b~(&zneLct+LGk3bs~EU|Lm4LyZRaa&bLA9^?OVv3|BqqFI{Wv5a#bw
z{z9?W=bo&z+A~sRO+W3>tlt!r0YZsVUwtJ6NUE%ipepY8WXV=U1OdQIfgUd3lN|7^
z%2JO!?bI?jSFb}=@*jI1Z`fLu-^lrCNmh@sFue1m)7XCzI$~VCV7?=oB2_XAZ`ZiXmKh?Bzk
zgjCK~slgLNG5v=m(E5~L9U(tk850IQ*dHm5QgR>o)PL#z?Mv2F!zTfl>ys@#=8x_b
zrv&C_krXDlsY~jtWKtZj+Mr9@kX67vIaqD*ShD?PWBf%(oP0Yb>FFCQ;&u#ubL~*<
z(~Nz-OrffC$OVEKq1phqn|3*N$Ve&eWvSxllaVKA2bFA_UwF&z>t}_(+K^?feg1vb
z+dCJ&Oiczh?7FillmCL){LAer*Y>zwTKKA8M#*u>y)ke1sA~Cp*FfH{EOeWcfeLAL
zdQzYdrfTvv%|+c;eZe%MrG?4FHelxF`8|padKdxfiZF`z^u}|6Xitsi)p^coUQQ@Cc6QCP7dXkZ+ZYv1>MWnzVxnP
zPGv^lNYq$;V(U=dR*~VS{0d^;!jXY$J%LYi|Dw*`N~J$s$ASZJgss=D2dy^6^u9Hc
z(RCZGG>z&m#EQJGwP8+A)mZY3BcDIldO_oy&-(-T0wM9b?&?TFK$hvm6S%sTD&1~)1xd0Ftt2G35x&jfYr%(_m%
zHd52vb!455gXW=YuM+`FAoUp^kPr1c%Aj)qvl_)({m&}4@!iY+_IIonG*O9e1XPF#
z%nBr7f}YKYWQ-=ZL!0b1B?N$KZf`j*KwoP!2Oan{CRNRTnN$yqQ9+3pxL6i%2F@rg
z3RT2fc9$J0P;US+T~p-M@r00G6)QA5)&{>S;iJEw^%q|cTXs+ndcEjc
zt<1%em#CBW|>|=K#pKYK_!v>MAuGzVBY&0^0r=at^fE-BCAt)0UxUcGT?vGpP2vJa)nck}}1or}rtVMDCIKwlM)6s?xmuyKOx
zuMhHvOA~V}Yl901U(OGe?5!U4B7xFwOo5r$L7BpX53SP2O-=crwwGnx)U
zB0m=#nva7_K*~mHmnKMxXC?*cgG-{oO=agU0XN1APyw*`lc#c%P$-dhJpu7#jsrpq
zGn|ib^v!m9!9i3^}3dEZy&H$fhZswyTv%lhXG^hm+*nNM+BUen*yq*
zfa47S{2#PYTr=?QB+TyWjVt?Z^v7AyH3eTfEd&Q$rgMw#$P-G-D30@BsiSIH@|27k
z#zEZT`
zV=&7AP6X%jWPl!QT95pTA;hNRnkDk2DqzK!g5H6v$Lc1Ob`fN*l0n%_*$(_>bGoVA
z0PxTQ*;u7S4-|%^$5Wj+V6KUa_-EZORF*p_-u5e#YXWU67q`H@ogC;dkXDEL1;^b6
z>k5GNrxLYG3S#l>1iI{%Mv?=d2Bk5fu8pK;Xk#F==oCucynEUm&Sd{6etIMY?>R;7
zu$vGQrV>KMw-=~hk|{1{`8SQ&Lj0|X%^NrZj}QIz;K-l3s{UJoZ|Y(~kobpI-$Dmx
zvEaGbW|6vxlBNo{&@+mXM%
zbD(=bA19dtCjTplGhjBOuY>6g2p}MGRWg{|jYuG@EmYvePFm|gEum}z61af{F58kP
zFbx&pfWtC~?FJo%gHfA;008Z-0w$y@GV@GrBv?rlaO)NbQ&bJICb&P^66p<)Ho!b~
zfJL+$ST+Ajlf~|#o+CR6?UFi_mk>~|WPi2GtpD->Tw^ktxwPC@}!V3oF$GC)N)W)eaEwH+jMfEmj%LeC49vCBuJAzHUjXwIJlwHL_*xRj;LS;w3y
zLqDcxcPKHluB@a|bTXe~*Ta~MHWZ(*eI7*2+f>bKS+t20ul+YZY5&Cs%`a7R_V$P7
zqrb0-^PZY4*;0Ap6Yppq+#ejTf7Ve_AOB#q{P+mr&ivr~V0F=^I89ePd2|r6GtK}h
z3QN=sP7|RUoI;^|Uy?4Uw9WKo>I@zUXP_>0#ESM()(x6If9EP4-E
zU$#63aujInPD|tLccQ2hzPGV#PYGr?^2O>Ubj@n++NXF-r4U5EZ&*du09lr`p157;`M+#+{{Pp^
z|A%Yl3TQ766Lko(lELYnEl5ASfzL>3+az?*O#}suVT-#+i`>(E=WdxWer
z!`Xq{w}Boq_{D_dgT||JxUOr8`2*ptA78fx-+D9h*>}-&F^u?V;jyo+>9s@IH4DqZ
zWrS-=x@u>NPjPM)=^Xy82LOKxcb*1r(tAB&bwd75*|&_yvV_eFGQOIbth03s_t`-Q
z6fZX_g@4;WTzt{?;?A<>8Lw-?V;Tg1?ZzBwH!(9
z*3x_%gH!M?#<8wlZK#=V^#>pghCQ0!(`VDr@idX|@k~W6Icf7`msNVwSo6(`oM`EG
zycQ{Bu7@HA;^UT@#DuQal%_KOiTRSfZyBrpR_>6ba^Rk6d&nr?cEr^G7-4Dom{r8n
zZ{LQOjhZ4ZJREG=oPZT9sNzf{(v&w6L-C`wQ!&D0k|Eyb#s7@eNRzam*S!k|fZF7q
z^aDf2k^F|XR99&2`nM0Qx8_)fJX!`8B>K#Jyi)jNa(D7@L5G>xpP_BgbIv5|(C!Z1
z4XdX&>%M>9Q*+8NKv&Ab{$Nd7`OflGcUPCcN5eb3y8qF0mH`8NOP?NB8ATh*Dq$5{#XBcb<)`{q>NzM>O0*vZK{Zas0Z!lf3o
zp+Iy5iWW!#nZVeKVUah88lo!L%~Hz|IzAC2J#|Sk43^wc$dg8;zn%+Q6AZkkb~(iJ
zs2Jy=n$<{kp>p&`-N{J`EwF6dJM5Z&-oyJ3!EY$*nQ+JW5%n+=+3JJb8MW9QBv5p
z>V<-WmLIhb%Eh$MTDmrtc4d5d8ZWo7AEX8rP%DtoGeXA^_SKv3{KHKA!mf=sG3ygT)Ya7)
z@+>-Gal_(|7Y%PsjjY^9W8UMA4;scW<*A`yuRL1qJ>PtFvi6zy=Ec!#o`N?IHtNL!
zT0w}9)#N;A+6$@mzE(#gKOXPKXNvD-mKG*ZrS5s;s4JKoQV8jIg=3K}*%t1dFW#7R
z4LcPnmc|W6MLy~=<=Yb;V$Hdt-s>vTb0XD((KlZ%T8CYx?>yh6_hF)VD}H}f2Ky{2
zC)wKUqH)5FJ5i*4E6
zGBt5aE;&!!*%+z9`cYf@Z0SdATAL#=T8ESRt>W)OfjVi2Yh(T8i$+LB8$A-r!#&PwIIo}4JA3AuhLveC+v<_gO#H=No-y-)`U?kUZ-Jo-1x{VLl1h>BC9;v+eN>
z-!dwydovi(Jlx!LEF
zgsNWr)a_oL+h>uflEUt)*^*R|M#|8qw`lEr?UKo^-Yb33W!9@GM02cs--{D&^*c38
zVbv6^$G1P`>5rdu+GaAB6{kZC`m615ttc=$TIrSK(1`S1V>7)avPv1r#~kajx#Ri1r^wn5k)GSWNY0l@gCqFfY2#6&
zvcb>BD`PA>*0qE;&mO$9yJ)(iMcU#5jinly`TlJhH{1Mdl&lk(5L3~u^S-Ht#&bO6
zzoQofb`pA*%vZwBiY)nsd8_o~nrt>?tYDbuEp{@kdeE#-Yt7-NPmN&FZ?n
z{II|;A~G~_>Cm&j%TEiATLc6wRfc>&AJoQoQZ2TBX;A#qlxy9ZtvV7eb<6~KZt9Jc
z(S3@JG=BPLohce3;g<+J#-yu27LkHuxwtOWcCst-0@(A?pwOhH^HA~U(ga?OIhVG4
zFcT_ugZfh_niGrir(iT24Nk2WESSL@=}(j9sn!O(l{AkZS^2%JtCO)QpG7fI=HG-M
zG)oa;ER8`jGt{NI8GjqL8bAxy0l&#G$hC8lo@v~;xS|vupoDnNw5vSt&>FUOOemfA
z*>*FIC-YkSSi_UiOO5TQ6GOFTs>UJpgN=)!8E??LkW?u2IaT=^*xrHu70gjGP1WV7
z+|+Ivf2-rjJs8tRBOr%iOc!A%keQ!HVvKS#=}$-LP$)ZB3Nh$bV_sj?YeF2~+%EGr
zqop-gRav1k0%fE~){>^41QsstCfOft|x?UZZf0cj|VF
zN}MBR2Apc3JuI~vJU-8pz!56#y{_x0t_;jj`dG)EM
zIny~negpE9(mhAEflriw^u|7j7pFfYZ3aVm4C=K2{}}1-#Cj%P0;)R0Y7w}rEp7W~
zkzWcPU^?V#A
z!*jH9ej7CV)uU-xBo)hhf5fnH_|_Z$V-bD#ZCh@*4qd{MFuQMc+>qfjQ`~o#--QP>*IUuZu***{2kAk~_ZUZT^mA@*!&a^I4^;vjLu&z0R+H
zt9&x;4fXt1{3x)3?@OGpS)a}dI-peACsi@@{B4zWLVMB3sS_kG_wt=1g5i1lWYXZb
zANu*l6=9RzMV2|YA9;rtCiLDD#4lSe$V?p;-3yQ+->(YONhIi#%2FJ2rgXCT7cKXz
zM64DW8_4Cb0^uiywz458)nhpZQkh+&^fcDFy77#tDjWG!hP`WfK=L)$WFNB%C$|OH
zJE2nc2OSaDr1>{j7LNVi`>3s=$A{#f8Cz3u
zegLDpKpCVp_oguGMV>r7a+-PpwH_dNT@9mTFj(HYc3omY?NS2Sz%K(V0eC3K&qeGT
z8Hfw5xup}o#6bLTG62GR0QF0h58aH=r*^sHMEW=+fL7nXB=_I_3EfeZ?Hb8GqKP#f
z;G5B2Yg^(XAa}fM!8Hp?ddG!^cB2XO5o*I%TBJDr9wnByd-efK23T>V7h?kgD8xvX
zwS&#XZ$eqSMuB8(LBbk8*U_>}p^FP>;vljA>sIFXpR+;0Iv~r!OOk%(rnY!4Et#o6
z#O^2iBbgu(lLEr%On?y~Xt&UlvEA6+;#RU1bZO4D0amWzMw-v)b}rt}{ha{0F~|Sn
zb7L~drz3Y!)S5FoG!btM+ZNd*H`etO7f7r5Ijz2g#GGOHpq6*>iO9ZGk-U%~{sWke
zqY<(26i9Lfpp2_yJl8xEYZ5+fh=k7ICQ)p{zyI6*U&i}^BKUd078vNK6)F8dsoT|#
ze*S~TO7QLZ5l&X{SK)gm0OTxY6}Iu%kWQD?Z-SCr978-Sdrl4Ly{*bkI
zCHWw1F2b0N0z11ZE+N&(0dS0hUk#JqqM$A$lCY2hpl8Rez4Q#M)
zl;}b$J(!7pL9;kZavso9VXKIVU0XYD%9AUf6HVo`ABWQpNdO&RGy+0cUco036qC|SQC{P(w
zNOb8wrx*D2L#dD3C|YHo_|me?qI{LAIBYCgZ+4pk!zV9}UopFb-6wU=kfUVBHiF}R
zD=|^A+p?^)lc#GN7&S;=U3_7;7*!*Ev!~70(k$B3>EYgX4ad_jbHc38Lx=|^|AI6)
z8T_(>@ERF|fT6_3EO8Y%Ug$|06Z8%MIzR=k(Q_#n8WP+>PSHg>#CJigIe{k>#X@as
zKBmA}dlz{J@NC5Fki2Aq7=}<@U4-Xv=e4Mqy|-T80!Ph(ppr
zfSKA?U_KJsL)(6ZaRWThE<_X=i>$#IuHQfFv~V+gTsBo2;P*R0;!1zYmD~&(y76^1
zkI-pkcNC!twGd3N#J}(c?YYw
z<{+%ar?`W8YKv1t?9t*=`etWgt)5Ev`eB11hMng1ZjYMP)y$N=DLVb8bdQ_}pPhx)
z$G^Usqyxxy823LaI!C|k1tk&Dk6k7TPmq|M)W=)W%+P7*&Ez1V8?_V9jL4nv?4~y6
zcDLgMp2$(*(M7Zj;H85YFj^Kt&RPz`!Y_?8LkXLxoo96$U?#XB!Ne3Q+7!P@GDFpY{Xu9Q?2K7)y)reQs!qMD-}lWK-*7
z%C4;?lTTq%+Jb99@@E4?oXIa0s)kzEwloR!Yb;0fd&=#dv#o<|Gg*up;YIhu?yMkf
zS5%ziIo$xS7ttYYPwvhRzG~RS+h%sq&#svi<9~mG$F9$$bmEsv!Q_CKpDnbogXRK;C5I^8R7J|KWS6%T4U#!uQp#uiPJLV`>Bm9N#H48~
zvYv;z9-xVQpJCiU*I_c6GO0-=YMC};7|A}#OZ4_xaiPcnOb|B-!;uCMXQiUfrGfo$
z<{|diVbK90O7!ah^8$Kfgc@h*1q5zZH*GSsM}_*>f326fg@oY|b0Q_{9U$fmh#wSg
z?}IS@ZFTjK%F0CDTq8
ztuf)12a1)_a`Z`QJo;UiQ}(J!3)PdC+Dw9TUr~9#vcFWkc+sm~aBi2&!D4-y_a%!3
z_eIO?6-Uoi@b%B}vnmP){2r%-xwQ7{Tc0-Rz6Y`}U_~Y!^OJoL>L=fayGLCw0i$Ec
znTqJ2$66vr!rdY#1h7K0De7Xdd!J*ZgM7iZ7;dgAV#D2hPv}e;1uuYEFin;67OSMC
zIz%Q4^(5mo>2K)CEdufgKqDJ$hvp#jZv6OHe&omAr3v_|m>fam;x~)-k1)^TW1b)d
zLJ~0Yf?PnxOnu2y;YGxt>j$2li|Dkln8403V-Od#B1_&5Q8Sp~E0YZ~y1g`YU}bZQ
zDfJn+TIMEd?QRnnGA}Z3P`+pCU|H_7o1U|8Mx
z)c9zu!r$Jt+sVvdEpK#3jlSvEjHY^vPqT-T6iqTnsrN@ol~3Q9_<
zTrI;BkLYl?FKW0yAb4?A@V_
z;#tqCCR~)eFi?Yu)aQ6L{OGX6jumKTKF7c7oEG!vZMmc5bZI{iwQvzWfhST7<4uT+y>(hsiyuUz>U}lZ+jrl6#hziQK%~*=C-MR
z0H7ZmRJno&DjX>>4aV8Rk-+p2o%{^P^(PU&{lWyD*jXl+Dmy0#gBHQ=~ANxTDBkoXCE?F|R2pC(y
zE<%WB1jVhqUTt#}H%h)KsrZf#b;ob*m@
zWa7r^V+E_yT!|L>6a+^8a@{;m>h$hLc<&9J_oF3a`2+rwuOq4F7h05kQh=sxV&Pik
z5$+N%R5cgmLock=deA<1h4yL{Iex8XZQjZv4~K2%EPl4f2hiuB)*kM^94
z8iw6SQ~S8G1#dqly^x4=$CB{7Z;ooov4~wR|mvUiK1rc}v*sPb^P7d-OVDsl#YcqKKfm`HWy5
zek*cyjO%gZ!ek1ATZQ>0JDPRXLw+H>$}fO<MB}qZJ?~cpC)bR9+rnpF2PqnrJ&-_YJ1J9LUpg%C648@;Isykr(bYdAE(FUKBi0BD4M$
zYfGx2Z;RT>!Q4^3f!yc^5kFKiOso83S(ei`c}6>gfErx?Al&0xM_!yD;$HPJWd85?5pa|@?4oQ!zC+qvmFMZc+=mUZe9X2B0T!cVy_u;~
zjno~8?nxTE1P5c%MZsL=#&@JXo>EP1ZcrGvU282gz0I>KLPe_lLLvE@q-JAm>zkWp
z;aaIPn8{ogMGvV7gHqjYKmQW(V=k52BEr-F8Wd<66h*ofuft=W#!$B{6ut^jfT})e
z?XDX#^)`DHNpEPaYaR0Y-kO&uDh$r4$VXfE&1ooEj=$0!h25YREID`HevTJgSLsB)
zeqo+!v`5nXpv$9j^B3g{M;+e20f?{2EI_B{W1Be}mHNdnBzE69lOoyQvOb=lI9}nI
zADI0&99??PS>S!iKq{-(J|B#Jt%K7G8U-Y4w?|@ETXICG(2Z2(4H0`*6hBcnnnlM#
zCf%*g**r~c0-RG^<{R##oUHZm$Li+-o|T+>00`pn<)$?bCGeRC2RK(m@lGzV7WPdsUQ>=^GkY8HRr2+e8@sa#X=n~cy{G0f8&{n3|g;gTI{dFO!X
z?IieMm)%XbQWY1X!WNqeSC`64d-=-&gEVtFqO8SijuooF`j%PLlcE^E)?!)Xh+F(%
zSx1fgD7IO^UN7sOc55wVRjs|MrM-Mzn|06?IL1S#dYk#eKkH686BH*T6W45ClHCVu
z$l77N6%{fDTIOU0HzUFPc7^WgEu$iIDEC=ph>)G%fgQcrrj{A@XL#(@5;Tl04(5tI
z*~$g6%|oQv6Y!aq(FX%RI4H`1*8ZnZNjYrZL){><<)V{4sItJz+lxfU!=9<4h?>Rd
zfUwqo_mSY4ew23j)vLGmmRG#zR9lnmU9-ekfmBeOO50JPttbxSWGsm+Tel<|VHGAE%DfPc$M8jK
zm2DMVz-y?(B^!M}68_T7_$+d$c>jHR&#>78uCMsu&ZQ*~GGQB7I)C-;;G4_Q70Gmm
zMI|i*H3?8^`;H79vfsbe$Y>i
zeKVp8@j@BjK{LjZf56&*K)hFs!4W&5uK!RQb6HNoRj4tPaKp3i>jUAX`!OE_e7@Iz
zhk9p?W2!z9Q<)lMrASD~XR!V4o-2b+wm$`Mk0ig&mlzE$*R~xHGkC-u7d%=`TMBC*
z>@B+T{+GF4Ej?yO!`oW}G4I37G$ReGm)o2x%U@ToMzaZxDrpo=Kg87;c?vOsOVUQ*
z!10)5Vh{g9{txu#X(d8*ZyoVLq27s33?})6rizY~g?FHvM#v5cVAR}Ga=7`eQR554
z7zM#SuAz-Zr@rE%d+pOuN4GqC5}ELr?iBO!m_qf(6Uc>^Wx*R^>O8K~rM=p$
zTAh-x%)UBRzha-A6*CvOQQjT@sULq8f;N0m$g7*Uq8FmC`a0a=w5{y%dBENC&$A@8
zZL&=F>tV+%bZfK6>}pg
zx3j|nMzi{rk?=W>x-srh+bJ%+G2-t=ajerxqt%F`#7Ev$?~RK8l38tUZuWh)&nU)9
zJRjnvKc1RQ_i$(KDtLC>I?i%iT(7d
zv+P%u-%Ig^71v*UwHQqay~8s|u)&rb%JUp7G$=<=p$tlla$JyfeQqt9KBH1-gkQ*f~5_!Yu9_m(+Ni_g=Mj6~(P5RWg
z_aU00Co)+rmP|q9H$ijZk59)we*V_KY;`=Dv8!X~8`{b}^Gw^IsRL2Y?^E>q_++Jz
zt}h=AysnxZ4j(SJ4p81n4p7smOxazoH=U#ZSBnY5>3*Kl9?6z+2A0~^6D0_|N22Ck
z-W+_rlmFa6aezfG!b7=~lIok7q-Nzl!+A1d{oU&42vIKR?&xwB_>-qq%})sL}`~C%Cr9-pkPv!
zKkE&`ubZTIR%>CDu6J?|w)w}My-X@H);`F#LFHFd-0>=|=FiDJ&IPRf-S%eXfN?b3
z(U9);p){a;=V+NGv#@3ECNW63N+4c@21BKZs%&bx?~
z!Yt3M29!KCk|8pRU@qe3>GuG$+fD?WAv?a3SH4%`WT+ps=fLrD5(oPtx{|%L2+8mh
z;Ho(WhL`|RS)~2UoBmn1&#kLZ{hr&KuUP>YY=8Lho$2VJH~9vd#}tyn4EOpxIFX~E
z(-$_BXDiFl>H0VkUX#|t*GbN|+W+c+7o)}fNbyc?9h9OXqgXHkEu1MoRCv3>=S$vc
z+fW_lMP8^!i=p0-tJ|Z&B&?CR6nN-y02bH4%mvmv_BdJ5*?+MjVj31b1e8k{L5TP!
zR(*l0)L|G-ks9gvl@!Y@qBcHECXXo-q$!&LnMo0OHHmQ8%*I?cCj}?d6jKL(@F8T7
z{izR;#9ki$Z_vcyX6j2c5E*z#5QNAH?I_QgAj|Q(Pr-5ofcFbnxhVvNatOUNz-L~+
zN>iX5Kv-@NF_CQhC&-uEC3F*oLk|mh2|gq<)OKWTW~6*9qb*qX#tM;q8uV~S%)Or6
z=HDK0Q}!V$Y@gbv(Yzj{p$t(riHc%?p>wY@*=?1E7#1w|!qI}0
zz|!4X32@do{s1=TRZxrIuDBGt4vFOklyhm5vqLi;%s^q(C$x$wH4EJUj+Qs9F_q*!
z@E!S2(|cjU?^kd;_f~e8!>Gj1)}9YYnOz)J5e}5Gtw^p7fC@APjnKVI=>4octi2x#d52#e|enK%8juJDkU38IHq
zK=PbW{16w4Nz5mxoA#&B>WJ4nqjzGuoJ4sbNE3kPtPQ8sV(;l+ufE?vv)dkh!#~@#j
z*3cr_?#T;XHh@m(
zWj(A^^0-0yBfXVzd0S@(y4;@g76OCqSL^cj@%QJ=S%{|8SjM3n_OhbE&N8al$SYg*x{C$OEa9|EzPg?nf$dyaMss
z{Wi=;B?|(Qz1c6-unZ~{P!ZO5Lo0*FiWDmrH7GA+pNOf(u;atMe=*T}M16ajOTgjWZ
zWN%)Y=r9qJ9V18Z$mQvNpl4BVlK0>;GG{87kOSccLAk>e!S~Q)aWfC78^KV~DmMqc
zPNE{hK%=El=?ryQMQBEOJ*|wC@-aD_dO}bB+cq<}!5cDX6P5j(e7UhbRk>+Dit{t8
z$exk-lW+ss1&P^`*h~#UWpSD~%TnO>gI|dwl)nk`%uqd*{*Fd3^f*!$zka9=IBnXEI#!
zPM*6k!s?glTMcjMJ`+=~_{jN@wZrYiGc``mZ2PQFO~+g+bZ%6notbqnwy4mRIuRZ_
zmyz@|NbeM7kQCZoq6BvoM^}@q*wbh@54G~U
zuIaMy>1rGnO`aSC&n20mCVg2{d5JM;$fpT<-=D_7YWk9V?MIeGa@+n
zVh&^#g{4r7|B?{m_=HsfJ5t+fq=AJj-5cD-8@#RQn*R?HdYA$8}2ss!I
z^@A)3Qot8pL!vuCkq5p>KL4y^-{4{xoW;38XsGF3qQlqv1hycRU0sNk40mXcFheqPRYhLnc57D{Sj(}fnOf37
z5}j1aU#789(gu>w_L}0=`al5_kqT=_2qRAL~YSzeU
zgQTh+lUwBvwF?z0Ui57p&O)0$Q2lZkJuK^EoTpqBUF+l38Bx7(+4xz-0%eO_WJ2wD
z>(qDZc58*`kTDk|(;+N)=(8vY8uK7-pZ~Ie2I|{uSD#X&9{PzKhwI_b?cDn&0It6K
z7&b1B2;N-QVF=YcGi*&wDa#+-2q%7ua*U0vypVr&$cD-T8zU-wGhlMJF%!48X-L!y
zPQgwMGn~iI$dUI2f#M=xK|#h9ap^1~2i@oF-O}S7jb@RQy
zjy_s6pi?8mv9}518Ynh%kt+S+-BCl_$N`HrH@WBi-)}>x#6e
zw;=yEfSyZWT1Q$GqG!x=a9sUCCfA-a$=QT^%;a7c83Pq$Dhr2rP1;shfOY8x#wCxy
zZhei?i>ovH@Ba*?p2}~(DMfq@eV6}nc2@9IInH6?i%|caWNI=V9kf)B_7>3GCH-#_
zS_FH8zjM+u3sYr{13=8zmG5zJ-`iVcVIx#<-_ilCp(!DuN{9-~_`zxVK@$W}S94cm
z4}tCFr>I2VJ^AKK?!v>AVWtK%6hDdQ<1GbK5-j45E&32d;x#?
z%IYiaH;DA=MuLa1hX|kclXnh-;HK6U!9HY+j}|G+ao1Rk
zaT`7mK=+R`xm(h37YKmBqJ;}VWl$flEUlK2&jMpyqUt31{M#7fW(3bYt)(JILa_vZop0wFAX@6cAT;%HaP>8n&VNO*icoGM^(<~=q4{FhlP|5=Or%ymk1`NBW9Id{1?kCUXtPeXd!dcjLYI6_rE_$@mS}gv38^
zutxezjjzICJ2|JXH384q&h#Y@wIsUqy=)6h%U>}OkimJf!
z1hVf=ONu=C5TYxTAqjcZ&IHe1S`!{%${{rhT>>?HF69XMBHWx?Ls}y5MsQrhqztGh
zO9*Et#SD4IqSm#D6d3~V`+}$;tkwm2vhk=y>C=z7>)36J(`ryi1DH5WVzN~P3d@Zc
zWDjFWS%8x}J0#hGjPV2wp+Z{{Ur>t#!y5v`WwrfGRBUKG~`j3EkELM{w^*%#lE-L68R9b){ST@;RFj4EVRQx+8!PQcNr5d^z~f
zx)Besj%)r|cZDti2KP#MiTVl>f=2XPmcThhdQDP+7wMv*O6u$#fT4rRmwg5Ob8nOH
zKBpO+mV7Ov@uQP-#R+1euFE9VQ`~Sqp8%d$HHq2+u93Kmndw&wpFRNFfvb@;*}cNXZwLqV
z9FIo~wme@Z{09!EWm%g+SA~Mh5TS=4{YeW8VbZM+Lu;Lu=2-v&UB7B0I1H#b%#`U(
zh;J1szK7YkIWrbWq>$bjsxq>|_v~5Lz
zpEt|ucI*Q*)|UO8U355x@8%x)fJ?3u;*E4eAHC^m5t<0Q_ZfTREaP{!b2L0R2T^rO1Z
z1v_0`(+;RP=_X)E>3pudi;M~eOXQaCB?R;K12X({n1f`uU+@0j*6=&Pt;VGy!Zl}a
zlTS=SW8H5ai6x;Lb}f0QH|F1Cj_G7{GLgThW9%fm|BuIf`)Qk?~oylaq+!)z-V%WnaiF+Eagp0iTp6x2(sg;WMg-VTo7&EznL(d|Dm4G
zcAdebu0{~nlcPtftxfpZ1g_JwD#wQ+<6$y}H$@vqHRI}-OBJ=EV8j(X87z)ejTs?h
z68F5uPH+wh;{op)eVDU!lTI0;H85FeY6gVF0suF7^K!3GOCczLO~{CIj45cF8j&@W
zn;|+poGUV)!QIf(A2VH8YKN!;*?x<{ok5m6vI4yRMHzAwb?#8Yc~b&(f&gh
zR}=KVE{*M<_D!h55AS-?_(XW*eS7<`))mZ0zfM_rIe$-Z3w>Uo=9rvcP(I-k)*5m@
zERsGyd6gC^SDZo%43+lvp78db+H+OVoZk%hZfa_j@0H!&bMtswMy1i%>~tz94!l$r
zbxM~FBHA$F=*bc}B)MvQo`7Qb44r9cfFyYpoQP|wtolEvye^F97xoJBrk|Aj0$-{+
zlC*}YogaNo<$b@x+5D;?;d@F@QlI_|J)OR%e!P&hDI?qBiF2Oq;enjprQw&$Eeo>z
zi+1T9e%+<_x0se>VTI$9Q9HQ5`30*raLENK-M9V@=SB1?+&j}X+{OK>|MZ0XF)#87
zE4dqYB0O#sTRZK}RwI#3qm;^>Zi)8*^R8j6;`dBJ2I9)c>|9_C<`P;i)I
z$715&Uu4BsFR0*&+uyhcPtNE%EZlwPs4xHE_Xh!4rN_$Z
zWsFN@k4Rb8-pVug$hN!!>leA{AHz(X$oiXgG)3)`JsZ^5uyLwb+bCVl(1K
z!Z^dIWYMPT3!{a}(~Pi3{tNPppBZS;9-phZGgFy|e}!I|PwUlz#amCtsW{!y$t=v1
zHsu46_=$t`vRkvE<(dAi;^)YkTvt%kFd|rPx
zAeWmVRh#IY%yh{PD5nBq^`Bml{)2M2
zzYk0G-y&sL9s&FAp913+`lo)LRlCaR+iq=dKh!mkUdbl<4)KPnYeY8suS?&FskT?D
z8QT{;s$37$=r`4wU3O~JJC+?DF!J<7lhm<*H+Me0pr4A@^X|646#d(M=wt6;M{8sM
z>z&Xgg3bDT_ymDn*LT1|R2tL+jR#K!&6>##U{sq$sMRtZ`T
zEDlO!e^BWsrY0_wqk=?mb9>d9+YppQ`OHMlK$-|Xe2{V?6hOv~HwVU5nt;mE;!HNW90%Ba#PIzJ}
zK8~L*9xC;r%~En_Fxx?tkCo6*bg&t)+HF_C*9x~%L$`MaEcAlMyVb(=JLE>$9$Dv#X6HRJ
zyLlCr1HT2lY%6GR*LEtiG63cu6?bPE^u3jpEwT#IAHfCN-gNwL?7ewZQ`y%oYL%sk
zG!aD*5K@*6N*7QNq)Vx#CXDr&
zICoHdbX=)@e*O3Q%uLn^{dj9M(XI(
z6VgWVRgWCUGjY9(JbXU3uB5a^@}sm4B)+&byLeDID0)tT_Wl!MHty+=I?G$OEwIc(
zVtwnckhMJ{H3pXZXT5KRS9^9wE3nN&eM3z@_$?dS$8Ti%p&`5|4vv6S5pev%Kk7FE
z;lg91vm=ctLAaZ*-KyIS^cAG{wei4U_xzGNMwC@1I>PASK7J!@!U-}7E+4KS1NjH63e}1aa-KYOEbWV?3P~2(w4`OdbkAkaa
zMD6#xyNM|*%2YvSQ@uZS(!>OL)!15e{_j_LO}my+0hJ-{K~w8utoLhXQ{z4TvUs~1
z4R+iOdNu6bt)8%Ouc|Y?>_&qVUu$olSsBLjMntmcQ^&siN*
znNwplZvPGZKgla<5&g}Ru_&qA;>9P)=Z9T~77^}PgOyI7_<~UJ_sEC?!d{_nr=QlS
zfaX1{-C=qRo8Bf<<>7n2>SU#lkM|Uuh1&6erV@=EqYUGYAv#nTB=rdkU$`G#$SPpW
z#D??npG^%EelvuV*jtZFDf;uIczE3=nlbEA(+=PJJsHzBo*t+Bp8KjQci3
zU6f`eEow47wp37@^E*zp@H-~6fhJIoo;yPjiFF%p8T;u_z9UxS#Gy+C19{AFtL4yw
zDDz63T$nj3^?=x?x#P(2XX!4RG2_JegoAHHQ(0+**-VSmW8qh?9vIu-{&b|x3o%68
z2U=vvkX0v^kl3
zb`uMqOYdG}^MOFPpd#p=+fk(`A!@U4MWw&dP@As`&Vf^G2VYa)pv|}GJ5tP?c
zUb)n+cOCn#AVb)?V8MzwR^lMd*bh$!iVq?Ev@OhEXjA>Oy%J?P*K83Pekvr0m|$|V
znUC%C_3D-!qf0PDq)4$P($}E~hl7CbIb=x?9$MtP(M{HR7|ImZMY0yS(p}Z}O!PfF
zbjW|%Mc0G~rvVsugs-WyFy|7M&Vf%itT1;@OajMKQvhueXmX+{Nn71WapB$XUEF#T{=o~qBZvh=G43X`uyjJ9G&66Ytq}40_gZ4*suIHZD3B}zls47!`Qm#rI&OBFH-F;-(wOZ%c!zv51IWowt
zBM5#Ma**u`fTBj1)*1sJyH{i_h`#F0qh?v_!dxCs5zO}~uSGL<5>rI2aO|HF9Wbg%
zn0!1lEplobCPnh7iBsWO#lp?@iQQ9-+n5fsmGz^r1)HgW>^aFlY#A@qB1}e#?4=Au
z9>6q?*xCDl9YRT$926UdqU+ZMla+gq50GmvsLwkk<&NAT86v#;=AA(OnLvO
zUxUA^2Abe=H}f=P&F%DK-7WJDy5{Zl%+fx7zU7iXDr9f}ZW~p#s*tCF6Xr*qSRBLB
ztmc&TO2LVRazSo9@HKaIqMzF6d}eN#d%Q5tweny{l~Xy;t2U=}elLl90It*lYYe4R
z0~-<#a-kU$*ff|&O>3fkgT0JP@iPPyA5D;CCnz%
zZp^P>h7`=&F7{%#N}PpVbKEYfs>B0k2#1mFN|44ZmTKIN`>}4cV>h6{Yf-BZ4qgeU
zJ|8E`3u%Ib!gOFNpDoPq^`i8k6_#6pOvFB*c1{XrJ`rlKxo>bbLKZ09AoEjZuC;M3
zkWea%`(@h~gd(C!+zpMu*q8?pEuLq-adYQJ}0+4*kL!PQC;(`
zM|Z;w*6}<_I#wY#m%%sO!
zi1^nT|El>vT7O^cabeAsJ5T#x%XaJ}ADjnRE|rFC-^)~B0`Yq#)a19rq7$`4
zBz>`yBoM2-*0E;>8EL}rHNj1N1Rb`dX_3iTn+kF)rOP~NwCSnXZ~|U*9EwIOEvvSY
zD}@YpoO@jl`rK2Eej&$)|_^QOa>MZvX^k5^*-s)AY=0aJeCmd{>=%aeH
zoRL8~P)k)I(pekyRK52P+l4Z>Bky0Q!4p*w5AR>>
z!umPlsX<`k>|T}d5~*Ke8^`#b`j%Jt5u-z&G>;}`37JWp+|J!fxF=@D#owUa12s`vn}{{vxFO{_gl?xNJL
zKgUe|z~T3@30Zlx%@TzzZEWp?|_k}m%hgHnLX+3klD9#
zvpF&3!_-c!+^PgK`^!k%jS3TL1{23gh^@lKm%=Wdp+H33B){-<$$lP3F?4FII3}9M
zyc1_#G48(OvdBxaej3@y+{B5f2#uT1Dt)vZM=s=B9rBHIf|I6}X1*P{%1
zPns0g?CSiT!;@~E_H3&sG8j>BZDZHk{OL0T5z*xJd_-$pf(fh9A027UOV%DEosFiQ
z8g6)NVN;*tFcc-$$KaYjT5|&EUY&u#GR3+aOmN8}Z4H~;cjxjGe<^Ye$+mZI$BrO{ksOOQtu{PM;(vqDdj
znYV)8Svj-LFQfI3nBTnT2?{QKf47`+<%wZV;MFTa3*$UC1WEf3|ocm90s6V&2mJ+0(a
z6W7s~q!R@mZq&u)7nGkL=)=wFx>csuxGQ=2d=49}^m-)N^Ua#j2
z$&aGTfS>Y}*5Wlx(wJkWVinq40Cs1>kXhRB>`m@Y;ky~0j-y%%j2ZsgQ2E&3iveC3}dOqMhB>%
zHcO)ZPeZg@VE(VusttT~TeD;zAe>MU&Ia~5bCo7w!so2V!G~r(Ug6f;NDg8N$X|oj
z9PmE95}mIOYPHtArjq?w=r;=M1em!*tuh3Hb0qyP#dY4xq>sSm@o@j!FYOGIwUqI~
z>G6dQWU6LOpdA6>Wq<+JZ8*s1&71MRt~U>G1Yf=|lE!H(W+h?V!j;`?lrZPQ<@A4p
zfu#Wu7yI9BE=d)H9{%6;q4|aX^`ZawSe5>N{Z99F?2@QJGM!e~ZuOX7Yb1bwv72#+
zlPU46g1LMfHucWTVW3Qb<*7owx8_DZWA^|GDAT8qp5er*mCqrA3|-#JLG_%6g&8@&&@~G}dLlsIuJLf6
zj$_CJ&YypoC7$42ncGZ*L;r%iMMW
zkx;LkP*&99;nsqL9P{v`yy7eC*S(iSd1DvPSA?o=G)jJ(V*U2hdh5f=$k@td_p85G
z`z)(x&W}p}?tV`&2yVH1-s^4bVmA#qK@P(a0DMZ}Lcc8|yFp=IeJ=X~@^%m%K3}qQ
ziPm3$K8kK$Qblm08_WmN`@`bkQ_n^kXibv|&4P@%1Ld0%`s
zx^FOwi<%0>C_F5GymF(}FY~I&wgxM_2V|PsXmx4DrT``1GH$8;hzn=C*1kS4+GZb}
z@F=7sD6r7(NR7>O;6&PdR)K51yneNwrj6q%!xW<6fp=bvrN=w
z;?4XZ{N$T}Y#wo;-bo#m#e@9s@&i{|_8XKfs0
z7BIs{AI~+5U0=Gz#HEPH_rmj@jed?5=n)Rp4K_TB9{{Y;)eklS!4W#E6_rlKhi%I}
zS;c1BM@A|Svv%B>amp#ka9W-|_m1UnM3mUeYsn~pL0Kb{{Wc1>S&o&dY`)IGlyb$z
zGPTiaC)_z!(ZM5DJA=J}uIHR69ZrByT`>jJ)J6?^yKegs~P*9Zd~uP
zt}O4S;6YPZd|?IsV<NQc+jNsnHLJCfmE~{BgNuMC3{rHy&C%f26PAT9LMs
zVa9lU;a%|s=7E0rbOv;faA#6=r~grjYF&5G7lUt&4P!^WqMz7l{@T@;QF+Q3f|qa#
zr`60ZU4z?>?`)52iG38LWvuXRL5tUs_Rr!di#2Ea-AlL#lz)8HZYX-lYwpzp
zOpd^FN6cG_?9aPY13Ku5k;3aaPk&g{eqn#SvMWzD+X44tPVonNH|fkD!8u2L=qcA)
zDjn&!UL3ukuV;YIo4xi&oW}(%b)|BL{N@^YD|N!|jG}$cs%g<-ElwG8XYZX+b`SZu
z?~L-rZ!Y>wd;3lMc+Plt#)QOt*EH_dY-D5AIM5($aGrj1Qm4)Nq_M+bzw({I7aB*+
z>+Z^ba*GaeV%V0ek1UOqc@-_Wmb)oc+Scg&ey!4>`~+QgxJV;|cVO;tv)ZA;(;4Mz
zV0-lG+a661b-Wv6Z&DSqTrg_o*iB(I!T|C-g}TLra$hsQd|Ro_THDt9_Z6+fxVo9Q
z%WlssDRcAU<7E^Pw>fl20K4l&dpj~TLLQISntV^@#xI@&ofF#2Pdd7@%dkDqH+HxZ
z--Si3xRetD&D+$va%~
zI45$ikMnweTzPX)Dh38fghF
zaQ;HuN9nY~{{5D`7qpkYn)G&RQ$B-nf%XId`}VTXvSqfJ+h9EJ&1K$lypPo$$X!9l
zMW5E;kD#+&1Eysk3&ptDCkiwt&%L!ONs95fLG
zI1XvIm)M`(h-oe9JCBS;n@s%X^E9tfzXJ_#?^~Gp!0FUdYIxRAqFd-)O;EV}+GpCQ
z^M`+pMR^{0!jZ42JEM1{&gO^eGTlu!zGn!xAV!yblgna0G2*$0>`>*Ynj=5AU{jvd
z(cKknGv!Teub1XKU#ml9>LC8+)Yw4P#3?$@%G7GQY^
zl&+sBtO)UsU@(*}ImCpjnLH;-ASjRQp%tF{uUH;v*4~apR4{CAlQbRKoiAz@aYdi$
zQcHa{2DEZt3d<@yB)Upk?OSqi(3tvz?utpGH~=sQ69!%$kE2XIesj_<
z#m_{D1+7|pVctKR>_*53iJ@!kadrI%V_p{seCD2|8!9{AywrXcACCD+xV7-1O$>4A
z+nMEWIfC^klS`s;_ha5mV@BR1OF?F&j^e$Vp=K|m55K;}xMv%+H0D@j)wbNGuYK^u
zkh9C1p9PLASF8I@i@kDLv#Z?n+SrtxfnV}b*P6_mf>UGhTb#P)jAE~>_zO{bU9_%HD29#M4A(n1H)LO=IY69r
zV}&?GW81^#raV!Y73N}VOV*G@dbP)ar^GSkf`yqw*FK)DdE@>US`mARa2vZFL`|+T
zX@3RG=Q3Iu`QHWKYa(R3Kj&5PjbagZd4}4p-jN!=JsJA8X0|PVjhCIuF#L?v
zo{|jJIAt6eiE_1VddJ|P;Q&Gw_ftGgg}KJbpnMUy1KeRNXex2OAz2K9VRwqEFZ_`m
zXT?q1x!66Gv{0TvshRMF>0Zp&j|oAei>=J8_g3GoTxfh+clX1F=JCsDhx!rBYEAf>
zcK_zAmqxpb_5AEp`UC4nzOaJsd^DLDn&s#i1`-M>1aP%77TGuP~S=aBpSaUYl$4bx2HY(V>k63kd
z{-RSbeGqR%ih^b5n0H#=XFi5?MK|FzC~;N&bclHgmDgW$DO}Fw14Fy5Ze$oYL~`cg
z>q6%Q%{N*z1?;K(=~dp)_jfE%tCQ;DSBN6H2Ms+&j&uprdzh*cZ{g{lDat+Ry@ZNM
zO7ItM7_?By1F|OP-ZzE^bhmaqonKNN`)vswJZel?<*a_n!VBbrvu373=OWL|`KOfM
zef4nnI9+yO*Gt2w%CoocM(g(6iZ*gCw)oJKUalCcE&i)#IR59B;9r-aSNqL+;d?2p
z;MzW+M-gTl54K5-XxW%-Jkhu3LS09gng3DC<{-SM%
zo~29ociM|;&i1bg18^-=H}s!zfU;ff;kOi5p8K%;VW?ZaIk}7;s`7fqBUDB8xAw;Q
zTtRW)c|vqZG~vL%gdl(8$WxUo-o2#Xg*aX4ROq<8}(_>H7#&x?&vEf-GczeK^wI7}^4a
z_m#5k&kSZ%u@cXl7ZsW_=f#)jp^mDxwUD_F@L#Y~=38q-@i;;8_BH#_j_yDax324BFq<-w$XoBm
zWyVpvX{tmj+g&}VHl)KBfiC;uKC7G5Lm
zh%a{N>TcTh^RNIJyWhwT{NqZOTyj@X&e8(fJy(4w_guW0D|?8pbM;x7gRLyCq$~<=
za^T_Y+~Eh;{(citaxE{uIM_!nz581FK*hp|Xmc~mQ{8++&qG)>J5~9|CI0DUdOyu4
zZ!{?yzWlyoF3{3A3>1rf?mP(!;((D+yUlc>OlOBCRNR(V5T5&Y!SVdCFiKTdS(l!A
zaLz%Nx=-P3KGR93>+@>kU!Iaa|e9I7!
z6Hi)*+Td@X{A~aS>5*PY3e+uhGg_
z-Z^+2QKBVwC?Zqvu2})5le`HB)2#tHl+_wkEG-r`vzQvjG`PA!1GQ%+AyKd>@Y~r6
zj1Yi$g!`6&hMF+xkU_9#Sw>OcW-}zQs
z>@a?kBH*MT-+(T-qj2cssya7K0GzNvX~1Y8dY@#19ILlSJ-Jv4c5)}+egb#xOKY$;
zdevWS><4QgyBXjCqz~`AfBcvM^%xUUdQp7(}x@|y9+x1~6b_$4GxXwwv
zks||f;H}0e1hLGmj((o5uS(yW&1)O~!HfLAOUM3)zsC538D32B1uU6Bu@7i$PmR^^
z7`upJU;=EN0mrbtwwA}1t+Z}^RwmIA`jtHh^D-aBA1=k@4zn@gM1DiK!z+{%f{Iq2>(<7H7!clZTix
zt7J4F*LH$-f)d;)_FTe3Wz5+UKRI|2dWIZ}5&iY`^5gj>HGqf5l$P?T@IA?mc4SIy
zBhf*n;DrZ-s-otUOW;W{>*_z@r>53K_r$gmbS(^`4oU_*ZUbf?gF#-+0wUG7Vu_eJ
z8fy(6;7~_k
zilXg(Ct@UlY3+QQ+_mB(dD<9EsiIts_w%0LF5xaCrjy(}WLR$Cg+ND)dUxU3a|4x^
z|7@yjPf7JTi4ss&QPuGT)Q5K;D39>M?bhXjFP5h(`&XHKLuh=go!0R8MsoaWJ98B9
zZUxxs4PD`8Q7()P08~Ci3k4Q2wVN@;IS*E;CMXm>K=@v45?5HrY&rvUZ@`C9{!Do&nS+W}JC)hkW}zzC&ukg`0T~;oG;pTeXQf~5VPGOw@&i_d
z8D^!8D91>4^>niN&y*b=TRoF8L&Yu0WoG5Hfx+YjlT?jhLg|=a-amf
z8MKOrvXHrR>0)nRWLP)C!JOK>*msROkq}19KmKU#Gfuz>>nD}s3#IrTvBd}Olz;3~
zt8)C$fivG+YYLX;u3DbrZ=(Rrc6f
zU3=shH&B4o$55JZ80BI}dK;&76~U~}f*LQY5w0BZAAT89CP
zOBJS9Q@RMC#YHSb4pB52l%|eB07fP9#wF)1&q!-{V5VPF+Vi`rsOg#X;lFET{*SMp
z%?6NMQayH+;m=pyaaxQQZ(g36?vk`x(pFR@r>K?jWZaJB>tYNHrmH_Qf(0k6OH0HU
z!sjbYF>VzF9|@KeGP-DDEV#o5){u5nktu_@0wn?)u_6g7m`>(ySir-g?9m3`P4pzc
zb8U*kQ_1HOrgw>&gh9o#Tx!W4p}Qb+jkm)7@y{F<1~UZ4^;q7qlXif1ZyK5EMbuux;(V
zF$hgS7wy=;FVywDan33eeECqcUxfBroFAyRkUEPar#^5GyDxxtkg(&G1SlW+UB!jC
zPpHNG>Z5-T9P#m}9WA%eQ~zw5K)Z=%(DQ?T|Fg-1$yZLWoBlvdan7FvA_+W3O*}T_
z#b^2T$#_aN2vbv(=1=Z?8G$ZD?&X1?Yzc-!(CPTbl57xZED+iGS!NbRjyY#axsnd{
z80c=OJrn#DUgGG8cI*w2@puEI|4d
zo=}GDmg!=^cZuM<>8ho$EX0{V0BMyNF;0ZEKdLri{NdJfk?nt&7o5~syw^wQSb60}
zaQ?`%l3m+){dnE#!}0ZtUCUHu-VJ<
zWdCcDF5Rx0nC@0L_z7;NHu$})jU9Th%SW0wWDwlmepfDbMoz+hy&8tL5;sMI$o)l8Tif)qx>Ec
z^1)tpK|1+uK_>onujKiX8)sHdCq>|LU0)t;Jr+SXIODFGfne&dW$4Ve=tXZI%F(@8
zMKj}MK>Nt0Jj3N8zLg4vc1@+wFE*<4%
z%i)8b`LA=_IWb;)BPgK>3~%A%G!f-VNA-f_lyIgD#B}>1f%rK6ILRgeP;SsHkiAKh
zDGe)?(&9(&o;6aNxR+_cqhR}cy_~wTaiyS<1;$@y_C9O6WzzAqT}VhJxubu@(3|4J
ze6QOdW5;EVrSZARQ?Hv^{s@cN@CsE|_-kZ=S!fex<&Nww1@GQvUFL>Uef~6*^}5oN
zU!s~(-MhEKKd?yZKge1v+W(vXVg9IPzEYgp`@r9LA2tRDmV{as-;b^iLX96TVp52O3~eJ)_%`;82GI9;Kz`XL&%7!^>Jhpa$TP!@Q}%L
zn_&bb>S*(!CG-T@pb>=Ia=WE(eq%)+Ed09W6}KkMU<`Zb-&kZND;DYU506)-^}#WB
zj=kDP9Vxxt%Ri=L_@e64^*%L>3gz;}F1J~0%d#%Bj@{kHx$<4Q-L5of$*DU1!LsQd
z+wHrBM7`rmVjHKN!!P*Cx^_x8MNUPLmXAHSq4(QZ=+yiIis(7;jwVF?^xAT|I0&dj
zccimhZ`^x8Ymg?oKfS5{iLvX=Way=#*wVH^iBWY(-Zj0-s!%t8$M7?;U2kt>^O>ly
z7>qxC`M2ZM@(PiWr85UMf>W>5c`Fi=B8af#h
zet;SKJ4|~{I_;M%_YIqP;dscMN*&^rbgR-#-qrn#!O@<9Po;6KY?*{Bez!?7yEr+D%al7w|T$daY6qFtDak2jYSAduKi`I}YI5>w+)G~qtAu+&rF!B;dA)^~D
zFS#(@X2Pq9=Lc0n>n=i-uYbb+k?g5lKG+t+zqf%w+T&C
zLFcGrl#fp3hBboXFCOZ(6@ualNc+L|Qt&=<%{&^AnABo^S`=a7TCOmF$@dkZSJ%GO
zQYQkCpVn5Ht4#PbbM6o`gaMaQo=|vOMw$F@2ps1&lAm#(Vich@na8Nvmp3dDk3Ql6
z>-I*&SG?RbXT8l_Pl$cZ5z0G*2
zfvo>^f>*#v!pd8}6(0!ULcha>ooI*(PBvDLP+?r;-i1zK1`6FJhqSPROrA3d)a6M*
zq0C0CK-(W&b&M!xbqxZRloKCd%uu8cSJ;IK+lt7XZ952G}rm+0yqyT<0?cu_1B#s1NO2ah3#N_uhAp>F}1aA27Dvot%Jk$25Nix?{R
zD>3x3uF|U~pLB!ULQ+H@x-OP^J)nbRklGaW5E`PV<)Kii)u+V{?dL8g=@3I^W7vPs
zsPn-5%plZtJ8Uk3JY;skdVd<}6iXUJ1W><{n=5wC$|LP!1$4bUy#$}s?FORgl}n*r
z3J#fidp~gB1-nW?%QeIT1)m2ODwuL}<}lJDG)AK=O~KXX3eL|>Ghi>QN($HqqD2-h
z8GTiH*LV#+C$XQU!Zz>0MMfyVA9M@S
zgRjTjvHV8J?4fBQ`$$R%d4f5UQWUvA{#94t?_L
z5?SGQ*59YIT2)!TKWxEIo$c>cPg(W-dgvhAOL_P-ipnZ8n3;mFlM&o|jJzf*)s1)T
z1S6|5)?0{?A|jO6EZ%v!0M#At%nQCnxx`4;G8N(k`=Q?1#bgFq-(=!%`qqEcn?d399FAo7dC|~3*|M6m6bod-$b6l{Mtf}zIL4W=;#1Et#l`2-)f*k
zv>|M8wAwX+oVT+k&X~8yy%J~mxN@k>ZI7474|&eK_>GtNWFL(A7lLjNZ+{7#ey69W
z$eN+!s>3__9?S5hguH$}&gQ)vzHMX@67IPFx
zcqL$z1BTviVs|0NL}&Jl62yHDZW?$+X*?g3dL$g8&yAfla{;tcsUI6=mr(Pem1
zm;!dlXFfv(w#ICmdP^R~YhnY}QYgC!0=+20)@3cF(KgM%YKeS{H0Of{LGjX3`Ev<2
zm09Z;bxaG(?rAGgRJ%o2^Ea!DsC4U)`zDp$m$|h{tk>C>b3__&SmdFHzWpTXF0_~=
zj1g@|DHOn^8OetT-{6d0N-a?uBS~Ix5mUFDKYto^(0gK`E_ZuWNAvGG=*9wu04F{_
zL1EcRi-8rdqR>WUn)WBK24=!%0ZR#|^_IdKgd4B`A#Ju+mKcg-fV>)oWy2=`sysFZ
z#B&X{DSi?!Pu7y=1M2%9pwa;^OtKd?BfIbY8xMQr(h44OT-#D?!-gbE(n3lYW6Jw9
z5G4gdZX|tp9(Z0;d4wbqh*kCTGu1qAiWWd3I!!2n=oH#sWIy>OQ#~3@_1giVlOI{S
zi!Wn4Imzn4$rMUPq23`{LgugJ@8IckZ~~7o(YM}7fRDJZ0#k+lxn>sQ79JIayA!cQ
z)5He7#rJaSn|txMXH*6y`jGZqFbfUh8>=wULz;}8Eg&Ck71|`Wd6$EQc7r~*CyFz@
zzXvgZOgkCrXc-V=&qz*>lYe+et6#j`CIivg___xd%Xu~KDI$_;S7Vu1sB)+!hnlS7dSXyRjJG%X)13jk}yvje0Fz@Uhk9okLN*mL?dXu>1Fh^JD+kqe${6
zOa*c67wI3?yNEKg>uiD&J=GYmAPEx6^k8n4d^>8rmpCjU!kRpHcprqC!=xbF!)CTh
zZSRFL)vdo!4!Oj(lc5cx3aB9P&tZ6Te8-Dfef?^C*IYd<;w+XK|)bXJO1&Jd9UDou$EUUZ$(HvjQ3R3|4xx
z1Jq-z;5mE}9(sILu`#erVgWacFA?Kk!2XZmUe;2=eTf@zvIYxvMj1F&+dqQHningb
za{adP#@!XRAFH-sD2mm|)r5>hj!6avPBp1Dm|!*DlNbD5uR^M#D%;!~SDP#IVO&zB
zTP8uV#mV)_wNmp>CDHs}mR+xUUfI3JxwO~TBg5?n+nms!p-_*O{?sEnE|=S`{!~G3
z`nM)Zn^f~mabJH{ON9HK^H(ST;i&zv8D
z3>khSQjC^(tbHv63;-Jj7u&uC$P}1Wv=iz>e8~8+upn>^4EyRSC20K{deRxmKj1#
z^D~CmV<7h)kUUCIJn0cj6lfvG5xP++*gc?XO7q(}3X)}74@E(u0cLmSi>wdA`cR(e
zqcfDW#vag`W_Nr)$ZWDSdH|PT)L(;6t%+B^*`9S_n#i_!~tn1;D`EdZZ{KHlW%mPkS?7&V<@C9JSkQHsGdI4~PMNd4T-*pKg_Z
zIVJ);o$TFGkOZ#|V=r^1&ND|Dk5>NXOwS<~+(pCSNW35|qkP5@``R9@BR|D*q<8Ak
z(w`oYZ}Lnf#W)4*>g+WF(hwW+Ay@z+>j{uGHeC36b!Kzj7YUNxyO8Y|9uz2u$b%&cLYZXJ
z!C49lUIR)g^+Hs#F;{bCqqmEx;SF1K`W>iy1}9Vy*FM>adjHu}!~h+HLtpvBkZtuB
zQ2!;~GLVD^fPmjB&3p_5c;i`MCdUkzlUrz+9va7Q&P0pkUZVgVK`FA
zj?=!`u|HI{`m!IY(080LaIQKf*bm3o6f_Ij=2i>*Sbm@QAkB;aAwPBCJ{hK2gVJcLqzxSYlFrV)ojnT935e
zW#-9u2XQFpE!5)B9J<-13dhovVy}ruR@)u++}Tx=#3oabF>dp`G^K|Dx-YZt-JA)!
z=mormPnhB$vNQ%P111B>`p8podTg-a@3$&2Wqbd3lGnuEbS14cl{@EnGAI#%`j(QdIIP>ya
zDjK?o-$5P+SJM%@nG^xLgYY-o+o>OkD13wm9lfMf@uDn9TcW>)lHlO(GKo5n
zcN1pwgIBwtT}}|5y$z86Fw|_K4KIv%h#*gFwy71W-nrU{O?B7W(=tR>Bb7ctMky-D
zP9hUg%#_l=_xKYGdZt+KC$5X4q`$SH|3o-5m~jFn7@sm@HU6(cgk&Ur(B=*~UjThq
zAZ)_@Mq)IFN-rSSi!VylAyn39quIB1tc{djX1cX39KoAF
zDMfR3Xs3&1PSN^%T^+2toWjeU3m(<(*#N}AqH?F)%j1dVxXB*W-yf_^`&!~RKZoBe
zsP$;bc^mTf9+Y_mF?yc%RY5
z-b?f8jI@;Z^#68qxDuwF_}<=FSl4w##oa4M#D&fQ`=vLh>7G_aF$K4u0Nh}U-dzh_
zn~|%Zq*exxi+@sCqfi2a>i$Yzem}M8BajXetbjy92gl-0qPx}IQ#%ez&=8l+RRwGN
z1k)b|R!)?LHGt7Ef9=@*Rk~QCTb&_MR%HYB0-^$*OaIkcWeM!?{5z79LJZ%a6uTM&
z(Y;;^q6GmsAo&k9(OhxAhRhFkBFoRpSOuHe!Ov~Q9Rl2j?TY2TX2C3tt5r({N38DKQR
zu(FnFu|j=6LaNvC>~f+8dqxpjxXDRljaJ&3vU?1RE%lDIj+S9Vl$Uyy_==j3f4N^i
z;I47jz<62b_w=0kzn&h%1RUU8GqddK%E)TGa#ll=cF9t||N5J=YCo?ylpJlseX@8J
zU~2oQc4z78HA|y=V|2X6&AhGcL@-!Ktkm<>!%iYf(#8%IO6O0^U)JEmI6*q({3Cpm
zM@h!-!OmtMr$8C+@X8Gg#mglYwV+<12(^*z%}}!^@^;t~+yxCHd0JroJ>*aw`;Zb0
z)0{sx#AjObS61EY-Ykh|_^$>$A9MfNB>suhMMGp=DMo1MLbz&AKG;`R*91y@)VC6U
z_$CzT4o8B$_b2>JXuw~4u5QD!4@OkB7V}V3*@)cl@fgrQP@k6gzT}T%j3|Q(5HM)%YD-V^Hg2iJYZKPbGYzMcZHb$V!V@#dy1~T*5aK;1^
z*)|NBifW;kpak9I2W!u{Co{uPNnFSYjV4_hkJk0|o)wkxDc=(5PNS9<(e!uC=xq{L
z=;O)P4K(F2;Ur8EpF+zo`|b5iR*7H*MBFVlacCqT=o(I1ST_H|gLu>YPM@NzSwKji
z!T^496qj2S`mjiY=D#ddmAf{oXKuL}m?VlkS+R2#m4$7T
z5zvLsVuGlMb|!gl7MBGeLi8Q<4pq?A?esk=p8H*TU!NH)aJL<`{03tB!U;l7H}JT?
z@TwVmJ0XoP;N-fML>^)`$Oxoh1%UN(D*>5cYFX=qMv&}<>umgl25+4jh1pER@fay2
zS^if!NsYO2iOM4HYNGJfKbtPJL1*jv3flYvAS>w6_G}2aC{j?QT~Eg>W9PyWp;*29
z&~e&q%02&tqKKiq{U|X#sfu
zoh1vSTb#1chhFV{LJ=w`x3^t?v)lGnGWH!I-!BWLdC$Lg1(nA5Epi^-fNj;T1_M`~
zM?to(M^vO4
z>7CdS1R?^07?T+tK|#m}QUoL_A_8K@f(RT42=be3-#FyM*B7OuI`vaH0+om?hvj5`_BBX7an-GI*#j*h5RtZI)
z-BW6h2FI&I@K#Ok9Mf&zefCd#3LZ_+HXJyNO4
z0>k%Hp$_Lt^i*UIg@{=oq(aQ%GEYcYxcR%jf=fTpO#pG~Av)^76V(pVR3uF`e<_QF
z2H#E;G!0DB)jD`L)YvQ}E@0WhQ`6wzE~L!XG#}%kj@sFLBi3Gu)59JNupTq1R%~n5
zikC?qQfo9ue*O_nn8Z+a=8~4bIz~r#MC&!fzJ>1Hzna46!Tl?mmwOGArt0o^Cz*-
z#GTJ6*@JTSy`LfZV!S8utkG25c*n&|CUCt*wN;=;i{3Y~P}lU`+>PZwe+cL+3%oi0BLCL&1_zPh#t>@t&?@WS}z~6VZz_6)jX?
zTIMx^2b~faL*mbm@je`st1|^JapE`~=7=dXU!6rfPosUW*v^
z6+hx)Bn|6C%1nmOVeXCH*weSaHw6aD$%syR#+0aAQ|hoHP*x0SSVljCA$k)
ztJ>Es>ojHZRjJycf^S8z+qcvk{8@m)^M~e!V9Z$142lRg40JgN0=C`fq6fJ{tMIey
z)er#rK+>GH6Z+h>QfoTz%9X@biFsXJ+0M?+i!Qt$AAcV%YieprTYKSDUe3FHxfY9a
zthUCUz2Kz`O^N+w%f}6g;^-B=McR4t7fNXl}1Mc_)E|%tae%y46>GCY{;pZgx@se*-
z&z~&6)>L+5SjuF#Z@n4MU)1w=MN?#fi~nP#!oNCir=Y<-kEZiB@i$6dQbjbgOLz(T
zXzi=~2%3CRKspmcz5YZZ*9vL!O{W?n6Xyx??eZ8a9%(TjBvkf_3F`9P1oO8`-v%b%g
zIsn$QIsm50xBF7?N(%8b8lpf4gHoYJo9v|`U#ptOw(J&aPWfHIz9+TEMdS+AIf}
zAnN^ZfyVX$O%r7$YcXmsqXDHQFwZ&|$QAEGN@}I3*H^
z%ln(5h=`lAHgUsYewp(814ceoPmY*#W+H26YmWRgt1hMODL9=~&(|&4Nee9`hT0b#GaPM77?w-1ISp@rKiF8gQY4A&DL}}jK8mZ_CozuhG
z@Z$4>X%;b6eu|+J|EMqrR!&_n-uH0ZuhWKSssj13!K*|q22t~p(#uPNI^jvTh*c|V
zbN-nX^yz9-#pb+c_Ya1e+opG|e%Vzf{49^u1pm>pzO7b^H9$AqCAo0p@Qvz#kODtb
z+xQ@{S|@ey>Yasl_uG4Fvopqa)KCv1HJuZ$uMSmy>-rX>UWEfQ1I%uxL8NLK`Y9Q9
zlO0M|TjG5@tz^Ii;5+qTM8yWbPYO`iAJ~ed0N%p)U@dNEOFW=_+j+p1n1=+UU_;hZ
zRybhp%)vY~7x+f;y!z)gtP7ryNux7SmRy^cEbXWLTesq$StZ@ZGEcD}g9rb}%_0&7
zd#xqIkeJtKR}X?@nI=DaLKv;5siz)*7NR{OqCOS}C@so%V#99DWwsSYM+=a2S&FcG
zlUShD0H^^lLrm9Z>qcW6QIg_T(lJRIZf*6xBo^c&bKh!Cv+dauVv{{6>Vu_l)I5P?
zH|Y0Ea@bbvXLM8k0`@EVJ>V|4B3%lpm^VaJd7)j`aZuL21Hv>&D3~uelub>bXYd!n
z;~&8ASbNq=&GqS;MnU#!mgy`0BFwCz7juB)6xw;oHH;u$CH|Ph0;>E=G@(J#j4;+2l?vf;qel~DRzCNA?c3r@m1GP=NDg;AD(eQ
zIG?BfnYBpzt%NEEfMD}98pZ=&zLf|ddR>$|N&O70-2Beh(EBLhmyY7j0JHoz-c3bZ
z)doyGRXchHY?2lt!AwMvz{Xs_ha#q@eBo+YiC6$8fL^FhLBbSor-8waW6WoF((TyJ
z*hW4KSd~UUA@%{V@6?HMc25aaAEV0%wybTMa(8N;6#-aHt!Qi=npDo(&`Z{W?St-@
zjFIxC;7G=EhpwoufQt`RLc;^9`58c>a*T4B*>q}qKVdKMZl6P*4sRErs_
z<#Fv#0s*e}Cl^+W`Odw#9m)|u(nzu~=Nc9h;dKZMS+jTnEqy?VT`gnevFuI3qdbKx
ztPO&0a}8s?5_YDtlsXYL3HQ3HKyd2Ds6X<>Z
zj2x)Sw13dAULxKf
zT;*NVy0>m&7n5swCLL(kzxN`O4BkJ`ClR(EgPC8^*iEE1*vIU`0?xemWMZ)bFR$#pZ~2e
z@ZI>3OL6kS3y&J}t+qv*T{|=t@#8=VRgZMH?3|Z}?V67(dJawFCKIcY7T@o4|N1#~
zQ`?c9my%pq&LoZ&W{(3qF1y47C<-0!!gaoaJ8|q@Gcw%{w67JNn6caU2@q*qOiOdF
z0&Pyc!}=8+u09|DM)u4xk|_q1$`IdB`0h11m53dKo7+i5$t~t_&F}YLk^|yx`mH?E
z%!PbQSdzXJ-3)6nhgBs#6jP{88;Yk5y5YK+YM%rtkt(~+GbV#nUnPJGM%#J7oJN#h
zmq`nMW6~9sQ?Uq5#+{r}#vppCK-3hDRB7?iWF>EQ!f}BPbw71MJbjjX^#o0uwI2yA
zxrG`>y)Z6um0=59_a1TDcmGYS)y0;z^L8GJ$td^Lhh2r_WN-AUEo0K_HggNy?F|rt
z4K{OaJlKYZ+rnfatzS*>yaC_U)wCkhfY8d7J=a1a^50ZW?b`C{{Nfq~LD>t+J9XlWxv6Er4jV8!G97VD*3kCLP9Uy{SB
z+MK1i(8dE|gN8C@US00-8=0}AKo#V&PshMDWzM&`n`
z8Of#(^F$+-D0GvVAn`}n%cRzPcUGc?H(i@VjhlY0R!F8Im2?w~g79nN;XL`5c4)9m
z&dp*OE1}uGzeg~MxDk{MY_%&3Kn8$z7WfeH{&1Y)0)Lls$s1V=m*&a7PR7BhxoGfK
zG?_7pri#A~=pgeV&noJQKe-r7>Ju#2bk%Q*Ha3V%uO~;j8qV%=RyzaEAX5+Q3ovX_N
zf~vwM{H|8Fg;j36b9nWi#ala`c+P)saVI(Ict~j+@AqS2U*#a1-3YG1I0JR^Z3F02
zw`x(oCM!u
z&qJbp?3eVtPi#3+OOQYViHpz^
z{;1E2K+9CMcKB0sDSU@wGQk_hiQt_}+een-&(&es?4_x92XNDAk?pEZd^LEbS`K;#
zF&Amp{{X|3;;Mv(2#UCN-cXV3Zn{!B$N`@G+*BjsG_~P*LFFLY+)lhtd4kw0-+be>
z(+1Zn80pg4GtgkON{n_^v#3aErQP|yo>%0shewz~CAFT{xlHCvgvi)$y#H*T%8$BE(`p9q9
zoT}5U|ICW{wLT9X75!ZGd;!_>nu8xR;r!B2I%4Rh@GEz$Z{4lTPs=acsyLulgNQtx@6|pfSlL^qnr<3AI0-1pD?WhIp?N%aIO3gAmMtIs(`|p!NZ%6<`DP
zs-gB_Ip}=mqOH7Vj0N}~f(H9Z8d9$uZKu7q{z=2bBHm)6V_#iN1QDrn;z}@_VKfpJ{)`3Y9H8HXqK$w&+
zCJi=q$t&|(wA5BOfM)-bWkozOlbCj*5!;3>CN@Yr2pIy~Fi*rj9g11sp>9~dD>bQ0hqWVK_GElUlfU9!R)P6RCihP8(HpmVY0|5X
z+ly@iyiLavFP^#>zc*~4+=;MutvldIL&iDZo~(Pu+#-K>GF(veDtR>`>dVu-+Y)l!
z+u~XH!2nSGI7Ay0fcn~
zU0n7ddLfwnw+Yu7REIEWs{QD7B=FN_^aNZlujv#DhVdL7gYx8
zsT81L(Ex=^W8rO71GW`C-p&ZzreXEg_{+e++F;wjy7#2N}R8*!BcR%C(mKgh6%zSfd?EFynt}!kK}q5$
zFzRiP_6%{pxEy~fg@L7;iyF7$7UWllmCRqnk=}sLW9$(Gu!RK?4*UY2JFCvB^YOPwXxkE9+
zd!twM0r9mE7$n*Z3!pmU`Mr`d*A*>7K;5nYcf%aO8n0z-yrSB#sQ?8pY&i@{G(=1b
z-HAxrsU|=K*jBHDVuRY=9cJx7?1dx)(03w|O=mQ)mx3i*4#{q^y-~{)SfI4ep~g^$
z1j^>tNYY@UJZutt_FV1nIds0Do-lO@4pR~)zrYg3^0&2cpmerU
zxh3B^8WqwUwnqzmWunyd6#!?XO1hZFp<9xT_)EYSh1i4GuiryY_8*|y&S@tVQ0McP
zqhH#;d5Rf>!$9zu+DXXf&(>VSjj)K8-ebJMB01h{p5-AOEW&kWYU4+AU|w4CD$)XG
zkq~+GMy4l~Y6tdn>=l1PH;#?^8=;ac#tc(v|28r9eiX?a8Gq#@ng)NNp01biqOXit%V8G$~d#>`xqu
zR87KP(lL8j6#l3V)&r%gOxcGwp5Ra-0*X={N&V@$d2W{?oMy{0aLoBu(O3JOa3J>4W?P~F7
z5R(-`ta;hBsQylWI8%-=Z^ay$JZ`P!Z<|-@=~SE3*>c0ea?hHtv4VMkihU0}AQ#tZ
zt7H#6qEGf9G}Ug+om!9?3l<*mu0xXE#^QMg;C(#
zvROvALWf(Wvy(~r6gSvDPY_#60P2u&FoTXBj#V(y?8vCK0^$cbDkPgYba$d6;gcj
zXzc`j%nN*a6t<1YH%k=MYi{+ib|KPs!TkZuQOaT4Xf8Y^&11i&&*RT$Spl?i1O5VP
zVsJ2jm;n~EoZ`WLZs(0~PxDP^uv?g>q+xo#M84GtgqFVv>Yj6B%9&bWXpw?2XI%9t
zxg?)@u$I7F)oSO6Hp@=%EeFw{DF8^Pk`$!Lst+Nh{`q(AKWkk5wNjPuYV=E~+Yiwd
z=7j9>O*Uh%-nWZfzwwv9s>~OGn8GE$%&&Z%{N6>DRoQr0mFQvC;(dL$lJtoDkUEt0VgYKqzGnFJsV
zmZ%20dN6DG0P81t?O@3cu%G*|pEZ{bl2dL2Hro7Jidj5meFG4-QmXcV7mu^HgREJ*
zbHok)(oRSlSqU$w2guowp5jYBrp1sMn75YT)JL#(4zv$i2)3t)-A(aVhvLt8&4hN+
zu)WGcQ$w-w1(xDCz0MbN2faX0I$K9`ld=pDnHCISDPY%~dMSF*>^5GV>2!u*A0zwY
zFvvuqGi;)DZ2`T>rM{BsE9QG4+&up3gxP8p367h5cay25qJ7H(GEgA^1W82VX9PLX
z&gh;R)@;p{WJxa3nDs*(OjKoPcoY&dSQQ6T>H)|_VCJb#Y0~(5ti6E36{Y}Fa7fyT
z(5#l=3cQ~PDyr$2`3*YLXQD0Q=aew24z-?Q$9pZL4^H5^o7HxB4|@?H%h#q87h-WK
zx3GgKO}Q8j9c`t9c>4f!W`u|qgZWNzxeat}=77o*EMX$EUTH4mrBTfKYgvTqLG;Kc
zRSl}VK0z@;QnIjBH$=+vbU8hZLL9>vYclrU-St~fRYn0h#EI|r=Y~doJ7a5qoy?B?
zUQwZRZS(Z}VyDd!rboVc?ffOfsywLig!kc&-U8<4gVk9p`&xw;)@Ft1UaIV0J;>H}
zEj!b;-}0`Wb+K?ebAItH9Qvv2wzoM8TW9R*r3hr3GZ`TWxcqt&vg8I8OGwQF)6s7anepc0f>4oVNk>VGPQTY7orwV<)e1{55n4_|Brr_cOyS)m(O@$
z!qK4oeZLnkyFUMvH|w|jt2SkhHGRcf)qX{O3Fj&UdHoxW@^3eXCYx@p5*qL5J+L{r
zGT_zCv7U^pHrE}y`->AwUp4-G+tIPu(f2=Y$g>wNpdO@g)(Rj{Q5>vPorS5dF#?{h
z_GWDWnHdRmlogjj!hF=S0_^M+P=_*kFPS9ffTFKl?-f<;`>)@bBzd
zL}UV#A)y$M&I8Jc*?N4rbPxXgpIKKdKrhB$fp`}V^2m(!_?kr3Wx%yES8L-7cSYhW
zq`Fl34ya=eZ@!nNj$$*U0plxtsrz|DzTcA{nEH({IR<~h7YcHz_d^Q+iNsB|AAq$+
zj43G^e1&?Cy#fpP{*AYQ-|9QV2H3`GI)^Hc1Ubza^oL~VFFFql8CxZme*1I3I1J=z
zVaDL^rk&JpopGG8SkQ#~Y!vx%`(~3_|IV+lr@ZD)>|*T{-~sHvr1tq|)_5sWoEk@8
z!Ily~?iDogG?(M1tpAyH`&38ByEwterO%h#h+TVf3s^>s$u6*~w@yq6g?DZ@fEGfiSFpX8!
zsGj;D=FCTIvo8J4{xf*uIrr;H%&my)
z)Eh^fD6}jKYVlg)UdPP0DZw_a>J|CwIPgyre;RUqB$n3!FL5;Jj_Z!8fM~v5e&VSp
zr#g#-e`cKnXD67t07Q_xarXpXlTV&}gSN^{a~Zce019T%#>|*$<%8D5X|X8Gu3->Y4i%sO>6_=hMSJINd{NpI{Ew+n)1)idYvPVaC0HP
zdW>(22&Q7yKjPh#A9}ELi884vlh8>dd>T|n8){gnqkQK$@!RLDuglmu`<+ttapO=Rgdp}>(
zVjAA@Oa6&PWjvkTzs|(UXSVI~W{#u!aaj*0=Pfngq!+~3GR!XjyiBOxW+UHtS=3uz
zvfrZRuIboHMP?vp=v`vFM0>
z8;uAuN&hm;wV!Q+chDOv+qed3upD%E*|Hqb&Qr=Mx9#W^csLS%{!qa)#ty>Hz0q?T
zUh!9lGlPNdvFR>s4(vJ6`Tw}WckNBRO+MxRn(1j1Kprn($F3dUUTEL$6jbph&TdEb
z9tVB`tJo$s$R)|^n>gKdY%Aqqi#xH7Ust$^Y&sp7C-%hHn8k!G|7P`kYq{ir2HLNa<$;!)Gyce>8_Ay@jt8z3sknAE44ko-dS8*SsPOJcU
z6xT6U(DV*a4JkUzFP&7w29n7Ex&?a?IQNn4W!FxHy=0}pd9vr%<+~z9mpSdH1Pize
z26v%NlJNQ$Ni&}mNiL}g0a`w&z3MGkTRQl;5cX31k8k#qGl;PmTq0Vn!8rJjzjP4D
zjebJnLMeI!AexXG#!D@5EA}7W_L#{hp@4w-Rx+!jP)H7BU(s>GoVT0hJPXY6Axy||
zC*(vso}=ZQwC|Ws8`^vyThfAG|5wBGuLQQ+9m)isQt!MNs3J9cy(_m>Bc=s;^8@z|I66IB(ovJmOtH(41)g_qI$xSELH>a_d%4pV*u&amS
z1_`esj1J!956BhO9(Z|4XHsGtz6dGduopwS6HfB0ztRvbe15%}jsn|IrzE|eP%uE^
zu)o_Lbgvk1Y8Bk)O*PA>Qd)TnDfZ|zl<{&yW*Y^Sthe
z(vEt+$~?);Q+&b(KE#&B#OZpCTikKBiyEegV;uZ0*qPeTu;!VY2b-P|rG`QUQaFq@
zs0G4(x%zlKv8g$|WxaZBIDoQ2vfj3s@6`3ZNLZP}2M(wQAH0M2eP_Wj7#Sl=@1Yx%
z&Lq{|0jk`yhhh%a3r(lL^k7&qgXJLu?a=)LLm@bTG}X~xf?lL@aa~ijJ;p>+)QM1A
z05uUfXT4qML3dIv5BB5fAD}i9TZwt4-e{*B2x>;x4`6!gJt#p4`eJ-fw*<(Kp_k;>
ztidsm>f_JpdYGP!p*2AVG#a@M5+(vQPS&1!nib}Ta0-*Tmf(_Mw4ad?J+F6)tcCdR01aTAc0mKX^5y|U*0vWE
z7lb0QZ7
zo3Jc}1ASTg&#b%lA3m_osQtk;pi=iphnK1&Mpb2+B5K@sdhDV;oG8VdK`i>E6ZAy3
zEU(6bU$p2znkV)u^E5tqVgF{t6J$$Zj&m+~(;f6^FzlH}UVjHP^q+h(ozvoWE8cEV
ziF(UP?a7B~7nY7Dk3R?Ccn36>$p#?!9gvlX=-cU~zvJqEsL`c{QiYr3kV!l8y
ziO9t^fnN7<>JY^l34QV%)Q=XZiNko?9@VZj{m-6Br5|cJ+F7E?v-RoM8(xQ93SzcQL|%NCMt5YE
zUEc6vczMCHC~pU15i?!h$XK)oa-tL);AE+pKk
z$5H(JZshqO)~54&&0;gM!p^<_MWm?zd!Z~!lBs!9?U_Z;@GO0pSC^G6OTGGgwfy`$
zmlHuDRefdAx*my*8SR^1cMr60KbmDuy!5gI%S6;NLK~3V1@u4?XueBFPk}wO0L_+M
z&U+Amx9BMj#PuGV))^bhSAFSESvzpS(`rR6NwhOL)i@9_&%k!d-};K!V5W_t*5Jd)
zD!8IvMm1s*{QD??TrDRJ27|U}xJ1?q&29lEbM6{6;ux1R6qknqh^GiF6brrMZz~m
zUP&7`$wjR7Eg+7rlVq?$PTg2>=3V50ek*Z)^zxpD?q!-QQ{OhXOdl?1mcH)_Hv4Up
zM`@iRHF8`1nZ2o`fVy6HuHLwv-DreF{K(_aEx1YPv(CUY#ixyZEe=5Q_Qr4<@^tyV
zCoc-Gu|W?H$&l&$OV-=J8D#5<4<(-7+m3r5v?B-}@+p=LD1@#hxhQa>+oefugU=0v
ztJ2Fj9q)Gf5cAjMo@?uJZg2515-bQR3trK61dH}RzvsYy%lBHM+#sQhdAwf1E&4^%Xyg;Y7@Bv5+cJs?^s@sX7e)b%(S@oFTc(#+0Eo}kc-b|7GF&bh&d7!xTfLW`8C+k
zg+1OO(Z1OQ@6f7=`|Y8%CLjw;hynG4TI$(v5N7;XbqBz0X{SJm5p*|9
z)xgankZhEGmb|VF)Lao9sGWuXL0NPUfhIqlP}^eus6QxOM7yD2IzTq~D6W{M!+yah
zAb(fFZo(ATw~)92rlloMZ1DXBF+ZKmAdC^@giO17S?z1fex{aZV1X*
zS0TBDnt*lj;6g}T2_i7AbT-8je+kXwFJ{d`yUWouQYJv)u@Pf5T|TXkf_@-#k;eB&
z_--@VXne%-A;J|(OhC@tR0k$6Y;JnR`x)6^P|4)}+;f-gn9Q5cEFJ0+zD$guiWoQl
znHBDK(EGMLr}9jV74usN(y*H8RJ|tC5#8pZwWcz=d!-zWbQJ}MQwZU#9gd0z5$jSZ
z#OJ1)Hu04lK@~vW*9W{!a|-bw)Ny6UMbiJ0X7wbl)MPc^*<5^uqW=
zJAd6kGS>|KA~)x^1poqCQ&k
zlZ1Ut#s;y*?8JxIUP?_?S?HDOl|eUarYf_!!||3TDkKz*97v-XyHGzw!@ynr!9LxXqN7em}AcG
zz!j;CFJ1hiky=nUVO5DO3uf7JM5Wf~R(ovKdd57ID&|{0LItq&b0_|jV8#U~yMmIk
z6t1O!RQ&Y!>6u`h|7&Qh6F1}n$nMXF-^u$}1pA~&%(lDizvY-gkdDi-r_;`N4q_{c
z&~bI^mnB2iSE^5)A}-hrSYMO{i4(S&kHj`>gP5m&x#IImwo5yx=~WHI5-W`9`0ZI~
z*oFO9|U+>y$1s3ipeo>iSmd08ETVM;^
zhFyLT@3Tz*=9u!b>l&04k!9Aj*!wJif&xwJ78Y*}zN!p;a>3g)sw%7~uV|gf#
zq`K+4LomP{U8Rg`ljcZa9}>E}5;Kcbk_vDtBurKkxnK$}g^a%}wL^%LVmK~TbA`W%
z{Tyl-nCc*JfIa=6z@e43cn{I&X1^frHG2sibLuA(t3RB~;vlQ!vAm3A%^@@N3}V!|
zwGO3!CBTnWyTGNt0<{?e;u%fVi^ly|T)mvKn)SmgmOUH>f-DZp6qd-$MUr{=3u$ve
za|dD8fk*wB>J8Wu^dYRRa_eV%hJH*sm+6VRmcX=o@Oc`JQ$;4)y&
zdcJBHt7VZ=DqoA?$FEop^6bwRf4h`#S=!5xH8!4#bhsP)sv*g-V|4rDSJ=9;)SJGm
z;!lzv@ozX+UeMcr_U_HxXPrO4Ncv1OIFQ0}mD31JH@^ULk$03;=;fmBBfE1(FK<0`
z$iniF%b~mFrGNi@JfzU{!uW}sg+tb-!UvseWVw_qfiFBEd=u!K-HH&+x*TiUnGrs;4+%ox}d6^#<
z5I?#d9JjdGC){nyl#P<4q3tV0hK0Y>IQEuDUX?HtRJ*|kply%Sn)D;$-sUVjF9
zn&z(hq!kGcH~^>G96g|1Xg2OK#=FM@uqZ55Feasl))urJE^3#~#vJS?KWWY?1q75U
z9C3p2$BJv#vXCz#0NK&-Hbgu9nDeHedngX^(QYq47d(1$msdHwlUdTCIBMC*;Ei+h~$9}
zH3D$Q(2e8(1$A<|k;zeb4grOdXw3Ch3#25Vetcsn1`OKl5J;zGLSW2gjUz4
zriJuL#zN+WVV_2XQY0^k38E4jxw_21N5Oc3{~BbI`ICAt0i6MCCwKHHg#Ds|;B@>I
zps#?GN*4^jsQYKuZ;V#S8QyE@{U8AU;cxK{7+5K3&LhHb%Ta}7GEad1{5KB#vTz-&
zjhkqHZe9?x=244z+p*AOQG=@mnFl0ne|_BoCJuGgFJvjfWKuhIT`TlmU)}5?s2nOLCy7IICSngd{p^-
zb!Sjzo^ZcKe!aP6Zx`~wCcv>cdIL=_I=!-BNAIs*#{WUxl6Mwj2(($-0IkgkwC3pI
z`lt)h5=^?Pgw4ST41?7ofp)Nbs*>}0+LW~ozFP(lZ`E+2eZ#celU&jCoK7GISl)df
zu(SWtTu-)eFYp;|rRuPfE6^CxNk%T)@&jK>lSg?3N<;tCi~j@Iv~*QFC@jLGs(AQ4
zIH%Xa)sbs!Zn9URB)}w{9E~ZdDgog_M)B
z%Gb3$5cnJ2XN6iDW>$%9jIQTg56zH%n`)g&((Qd0NE_UH^dx%nLNN5WeS3}1$&MPw
z-`=NV>s|?VPg`Rl8h*ofm>LZI5K{-sWTYt_IVtN=9EgVOnM5H}@6nmh3Qz<8*R}z7
zKy9gep+QeolIC}cId%%+vVUm&Z`c*sl537?()FC>fkD+;$t9D
zEHd4Sa1DMb%P)=bZdlD<0w>#ey2O{HZnE?ruU^ND2eY!BUb!?{H7>rgqc$(ZIlKK;
zH8uvw@t3I#=@3W7166IZ7`7q~4#=e)M082Xls1TG8&D!F@=unu&qjB4)wlgyFbl>MbPA&
zBxDZxVkUcgL;~2Kce<3MDHI$K5LgDFVX~GZtuvoG13KDxQ^smna9*lrHpI#8g_1cR
zRP=h<Qcq_
z;D*%Cz)Jov+)pi_!Z4LhRRU_kWRJWX(04Zt0&`4IZ^5<$TfIs;`09Hgu0@###ju}l
z1>fPQIz?^W27$2_D?U&UA(A}meHU<^j31+n@3A=OQ2WJ#w&)MXP;p2#53bpqSFPJv
zMOiF!Jj`1`C0sn^U3{RgG8c#wN0A-+v+ND&!$IfYhB>||zTQQ#ke_^=AA9o6_BM}D
z$`fximz3M$TCQ6vaTC5T?Wj3vdP{lO-LYTTQ=VO!FW#H_#IiT}Dq?dn7kcUm1}K=|
zZ+P|ZuYvvE%tyXVUQxrhr3j~`#0DsXN(5EXogTIzp01MhuYf(z2=;CD
z1ytB4_U*?*&oLi&_6r&WVq4M|#v
z0f+?$1o0U})mgL*81gVdeK{9P2UJ^qyhC%Y2sas3O{+Z9zy|Nf0$#A+DtTtmK43vS92ktj`*&)*bZA-?hlEWc^4iz+s=cs%8!uaG!PY}J$p%`vdLL3cRe744mOV-X
zbMd35$G5PJumGU2{QVWA)u-D
zcndQ4EAZ#u9(T_mE9isX1FB>gntZEvAEW31MCwEpDs3NnUkQptVUQJcfXXq-tDW-!
z*aT(ZBJNTp(7dZDm_xXv$twJ&)_dpH^;A69}Hx^WreQSDX1mR
zNJQYLtWX;tW1X4eo%;=2UzP4kqlaa!CFA1W>U9Ix66(Lks5YUWkVvIev;h+Htf2i=
zOZ*Qu1%}$Cw)oQl(9}<{WBH<6ku^H*Qmt`UXb*sVVHzzPnu~>*r&rwHwN%t}nKs2$
z|I{cErAErl#f(hQk!ZauAzG_ZQ|iQuRa?Z20HnIYNgxMwM-7Lvh@=Xef&e5L2RO79
zxF=h}CW6_(&w21^NGRs2$REk6z*wU{vWciRZV0$mboe1_XGQ82RR*GsInaP}K7_`o
z=xXz9fxMp%>V5yeapbj`%#-0K-4RxRF#OKXi^{@`7ud`5*WBre-*L<=CDeU%W1)o2$D?~T<
z>g}V?uX($_IneWoq>t7sOaY7_$+ffS$Bjo&b9wXWJ1tu9(pIVo+Yk)nsDN^#7q#>>
zUW@FM-jiU))2*d;4`0kMI3xP#PGSaYv0OUjsd|L;m%(M?h)TeDL?T}G2%$MFL-hvc
zdIe$f@tEL$gYGu#esTa6P0wR!V>c!l{j*1Fp$=(=G()UeoTj=4fZ(HYh_r
zDw1%D@;YKKI#q6{ip=(c45z%H9QbqDrtAlhb#4{i^=ZA63&Frwrz9pJtVWH6=zCE7
zjIYL*hZzS&HCDGEuQ49!5A;IC(p)Cpbc#vOU)``LOTjn$^KkLub$5TdBD-fnrf56-
znVz>xdb89WdZA
zcjS4A<{>C8lo}z#Gc7SUG>^CUP@Blkinn&3enb|OXv)jpj(r2v!0R{1&5!dAy_%kE
zw5F|>)IDx`Sm;nxbK^$2S4hTKNQPrjl}>O~;LRQKAmc!{4EZwUNE^`otcr`r{)!zay_6q2;_g`rhhV!10b;cN}3U0!DrtJ~{pvTCF0f&OwYFvP>~
z>T=7?9xx6(>zuzem&l-0tP_VVb5L(e6u_mZ-*78s9X_aOgp!xSNC?(W-Hq~^eYHA{-LxEsmil}4Sa_r+N
zsyU0sxvz@uD&ju4OOd=z-Sqm%k@sCiuR(?8U1`^a5s7;J4^J7l_h@*cZ{Ws0R_#NG
z*m55HTji9&UGT7{pSeoRJEZyD9=wGs3>AR?-#IyA(@z;JYx}-4Ijm|A{B0kl@5@{hilw~s
z6pU~A`mmN&J!`sq>O?Jz(lRpC?D0j_$bjP4|Asv7ILRuNh^5Bz$tNZE|5E+$FR7kh6S)l}B4jap?XB4CQXCsiV%w2Jgb@~Q=>2q{GR
zCWS~ZBAo;YNtFVjrxXFDi;5U&BTZ-&i6k`AMroxHNDxpO*#V4O($u#+_kO?cJ>xy!
z9ruiJ#xOG2W3zYmUTe)c*PPFMo>!5c%lC+Z|GlOG;{RzDd_Z00mXNjUxv?E^yrKVU
zi#b1SepN^sIYH7kxYBYWo9E-c+7bqKF7?mU^0uEKCj{s!u5IpIUvER4Zxh0P%WWyTfJB)u`O9NdobmmZk^
zT72!Bt?s<_$sdV8_~U!hOPrEH7+??htrehf&#
z@U{2ZKEcd*!B^(Wz*=P#mKf^tm6y|kP;CvQ^sEZJxmFr|6Y&NPR-9%&+V=~>x2Lbr
z0OKdj&x<$kj7P7oifOf#lXye~sD(SMPvmqEp*$kv6uH6l1^5Q*iPfz;=gDj2DOcXm
zD4J~yX^{m7=$9eabf8G{FR*nHMpXFE^@o(#>d#FQM(t_>k%G
z*~!tD!pEOa|BoT~A4Bl}7ehd8KJ@6twYUJ!{O8mk^5?D@&YXya`l%O%;cNCXU2g87;#djQQD!J`GxPGt{?yRrv((5tmMW&U)c19
zx=FOk<_DfZpJ`!=_9IvQ8qXfc)gOxQ3obh&Gxv;ho`eaYj#E2OF%&jju4ihH8)8sqI+ZwW@n9+BGBV>%g7fNjkt*H@((&qyqre0N!kf9PvuUzbGxjNLv=|y%u3uI#
zvq9YJ6ErmYFaP?cJLXgmj``(mysj!LiG7P5n;1su+DZy7QpnC~>%AUg%(I>4<{UZFx;E;rP@
zg68BxtGI~0>bm*PN)cxRC^7vt4mFAf>JrQxHc-U*kA!y0S)ToNLViBSpRb=IyxE;l
zrQs#T(>>os7}&=^B>DVETD7yfC9K_j|MK?re1DF&lRMX?xNL$xvGeqk;1aEom@u@%
zH@&d^?t0Y^a)0?N?Csc(Z<`)Ex-;8Zd&)N=ajxvv6XZG`z6imT<`KG=eY)>Vcq{;~
z-V*!Wt8XVu+?jQLxcZ5^kFbv4G>=_;xrqv;n>8%HTmk-}ViWj>3;*m;qrRTPqapd+
zftL&9n<&lT*kF{aX_L#0%G(DmjV(8=^CZ&aICW=zOOzcir@2jB&a!s3aoLgeJWY3H
zQ>~Si?Br;Mh|c6ZakOBp4>ak*X29$+TeK*R{O(+SSULc1Or&mx_}v@vo8re
z3PAw8nmzG?7b|)XP_3XaBi@wSrXoznz}{pHyc5XTQUEC%2nXmuyJ|8>x&(D`i2dBu7t-ooFZxe-vT~bOG>`7zTU3q6fgE
z|Ll;gI2pk|=|S`-h7iVQ)naB>>9V0BX)gNvi9d;Yw#Nl}*mS4wGE=wtW`sdN!%DBW
zO$K9P$~9wRpY?!AR6oy3BeDT65t|IVijIh;pr*eF1KdiH^2Pi_rKg*onaw)*R^CFk
zN(}*19l5ayT@G6#Q0;QacV@jA0I=7SvHj5ShlsaJO(|^}nEc7ejqVN;pqbLr*TZ6O
z>94g_+XB62J7UluLTcTIZlUcLn>0bq&3WF<22rnQL`ZEjU!hMB4vq^n0SMhyBreSP
zLWSMv3Qs@~na|hcT@@As&N*Vhf1o$QIN`~3-yD%*U^f{+0vU&)ZYCO{3Vel4>~PS!
zJMStmD&N(;28eWWh2?xKK4P3$C$Oi&wjE$AO9cdO+ACP7mY{DB=AI$X79>TFgH4=h
zKm+7c6Q??6r3g%IfdMPq3aqe1C%|Jw1QVFa4`#lCwl9~N*
zoE0{>uMhe2c*BS7B|~jA=?##Qp&f=Bb;M
zKGsz?ZpG4v?Qugx^lqD(@#U=+i*Nb>$kM>W-(ywCK#J-b@wjyMhi?fKLp`9oI-Ijo
z)LJA$o|>6j9!VfKd}!h&BPRI<=ZPc4i$T=hj|S)SbHa!WE3kh~
zBF>Q~&|veBl+Fza2Xc#b=z#T!S$-@p2w)x#&K!h8dCF+^b$lEbBiK)t#2*6{qkndE
zA*Tomkl{p|36ZHI6yq!5nmEK1W7gzOCRtvj|B0+DI0?~tw?^8KlW^(TTkTl?H)~F8
zL_1441jH2!qj<5ob<#FE^$R+=?HD&ZtyQ)f_hbcBNylOa0L+0G@axfnx1tI
zU87iza4%jH*~;L|?m?eV7jl2XF>ggZSJp@AUvZHDkM8wrRynD2aVs+D(vcNQwq&80
zxl_lbXC}*x8q?gEkgVGihuDAZSZ2&|xvHhpd*Evg288nB!K*7RV@KvDzsS?VLe!5dn&?CMc{*HR&;
zqRO)9c`Rc=*~-6U{$bvNx%>RlJIwjotfIhkcMt!u(YjCDxS!jc_GQTqk<{)#aTTF>
z&yRbrpyAm&l!BskTE{5mROZ?4O|SG{2H--YWXIcclQ*U-`nVHM0<$~E9^UHPSk=%~O|Q0<0+EMM%o;xok$6uau}(W=#>Vm_
zCbdmsg;>9oN(ETgcm`Uf1|`kTmWFk@Sj@Zq>?eV;SF)u28M|Di_{OTDA8U+d2S@K*!v*
zxDu5bq&%tk%0Yudxxs|tuMRN}b<0b1g
zd+XKuWY%%)XSx1Ly=SfYNpg-paSKWE_lea(lip+Le&x%P0mbngdk1etW@GGEUSq6>
zsD5{5B`z&N+q$Va&w^&}fJA&$`TRmZDGd{&k@;wOvamz1VWo%77O4o%fdzgWSnIEX
z-_bIHUBG)PcF^VVCZPV63v9DBoox(EwdX35i^Yivt@t3LkX)k4j}=^K)A?t|Y0)@e
z{huA%yXX@l!erca(4#G&=R4eKnefkiL
zvzdl#xJ{nZy|GuEdUM~vFKTK>MkAC`o1M}q>7CB)zRMRf&oZ9um+gE*B}FkARly@=
z7fjSFw8HIxf>g@p&Hud_OY2YfcuN@z7aZSR{luOlWq5ulrW$i9O*Cd7=y;xH~iPsbF+HSzsObcy{`vdQEA}gHRV<}AiO;>WXkj%Nc87yQUER--BqwgD&8NcY>KMJ(=0yFjK;^MO
z4b-8Xo&gR`P@RS9pRLtAdXK(Xj96;JH&t98RG$mCR~
zb&gR;Ovm)J+>kGqAD+8wv7pp4QdGLf=2LHEhF_d9+1on8BQ|sGYRpHxNoCOFY*I|&
z)L|2;{o`1bqv_r^CyGL(KPgUX)K&+7HG6(ZFII6o^!@3l%)kh#jme(CC5&RI`v*0<
zJ6tPO`Lv!0x<}Sdbx+;?YhRwdYo#CU-9(+RG+ADlXmq~!h7l0wV&PlscK*t>`&qJ5
zDV2YA%|&dLv&1qP<5gTYl*8U@$p^`rmFG-84j!YpWZpOynGy1aYU6xpyo|N??)!7j
z+DfAom%9b!4iTxKwD3G?mz?9j{^KLR>*WA#I!wR1L-FW=uciZ9t+fLx(-U5OfpJ$^
zsz#}626H82i~E23+l#3uQ(>oCk*{bvcDt&{^=HrDHm5xG@@2Xu!=mD&tlx!Fz*sVR|u2j(YESUA$9Bo-K>tM(f74&
ziafzb6ASY%v}m(dziF*mw45O8E-ldwwe?$CS{fE;>t!_<>r3xeuvf=o-XrRMUT4$X{3r4xOqnB{{$JW^
zPvspq?hCodiz$zskG#TC%vrn`7wSYY`*NjwXBv}#rt@v}>dQurG7njbODve4vcFeq
zoIRJjx5vlmCCXX_muA%J=_6EWSPJ-7I?!jLtPOUK^3#{)Ts0r!db@qNh;;lh1#*Sk
zvX2zmF8zYpCyKCO`9y$3VYTTJCa>GEE%=w_hDJr}tEKfV$;VSPOJtmLnRCQ2um-FwP7osbkn_oGV9+7V%8K9D9DB)t1Sf+fcP35J^$bzzoPR#!8
z?}o5vP|ndSI}Pve$JQlFwm%KtF6;L>%$3Sc)?3$;#oU?fa~}C1eyQN*^s;Gw=ugW{
zGT+8rn)>9fN2Ml4zI+^OW%hH#ZVY3>K^w*5j%-X*#GS-3@|l$mv~w4=vbxwC0^O%i
zohmOFFQs?Bp;*>v^d<(ZxE5Q=Eng(rC`zPsjVG&0oE@V&Uc5$8ls~K!z2p*t8azzf
zbN1&^|)QSGa(1@Mh?Ymy~^D6ZM7F9!A3@*`{^LBK(&9&t9
zZXA#EcCmQe&~j#?K>QTOeYo;mgV(2v6qmha9u60mlslatx;jGqR(xkTOenVqBlaBL;qH@B354}`{@xK`N!LEi4_b9k&(7W8nr
zkDHM9z-Xrz^kX>P_DYZk7)Bjs8R7F)JNhj8ALhOt!1?jbBvL9#{k6t{>De;SSjf|{
zELV)Q$Ip3+dYuJQ!jXVZwM@CSR^L`vtm!p
zeZC&fPV_UCWG{Nbq)UNbD&f5bGVBccx;Bi7P0Jvz2fJdW@fZaBTkB5Vn!~(Ee)caS
zTSJHx`p?a7>lsl6rrbafPLNi}D`wCY1ASK`w
zhZNib8q({No+tTeCI)ueMhf;n4_vJUMBAs@)Xlcn_X$Akl<3F1G(=>(3aPK(ie@VX
zU>BU|=RJaE%Rq=J+VO1I^}EJYBJTglKvlJZ-L`cyc>T#UpjPzp8hRXo06$;$pdl7O
zhzrGuE(F(24EzPO=%B&E?acbWxP@faL7z<^aUg@hL~dvk{Xw1yj69eS$|ih!VyA=<
zJo+AkYM{youryEwdj7}%ifbeoijkMfJ5B>BSYnmGZUpt
zRs!r%E2u}lnIqO{0EFS&_&Y>4ITHlIGNLL0b&>q<(lz~?f4_|t9JT*I+&~B`>A_)Q
ztKjRR*_e-@CFc{lt~(JlxWm!2E3L<&anM&ak$x7~Z7h$jY0D>2p>>gTX6)}^V%ohz
zUmf|3W_!bmBI)`6`tcFfLE%CLWml0ZuKu4L4_|>jHwyjFjz?b)02nqJOy4anq5C)N
z06?pXibUQ2L3;(5f$iFu-_up5NBNS(*TuqoAy|`pVg;AS*T9;SGvpxzzdUae*tf|M
z8Bc*!hWHl!9p!5*nRcBFt}ryq7vtp(qjZHNh`0#H%u(Ur=>FgpFp*F-{_-CKbz6DgG+>1-(!77Tn2@lnq}hd<}X@k$hLe&?I6)qyjXQ-vHw#
zKaBRz7AG>~p-=R2Tr8U^&_vcN03W%RzDBUg<_WQE&?utv`60MW{-1>R<?y8Q>LVPvV@4Oee`?2MU}`wE)$R%2@=aU2FbP_Dh2GnWeh{RAgq`P*
z$!&Yz;Ez3kfm&ix!%N+BLjwJ<4+#Zv2TH;%TnrUcVRF(EM76F)s32LKM#%7|r#zDt9UexOXb)
z%^w-OW^q+aJn_{+tL>?X5@f0oYK9gvT941xV=xkrwD{xVbC+FmgWo0|>Xj)zM_^;g
z=q9mM@KC&mTqGD*l8*^o4H%)x4L0{dLevm&2O~02$ZD@(E6t{Hyf%p3=<@aykN#hW
zQNUmA5mC&T>#E)#Z}?QR=_z$?u*-@QaK&5dn&-JSrHGFvag+`Wh$F-ZhD1ML3MK#r
z;xLCK(43t_zC%K_C~RoyOd&f_W|O$O`EJ9yg}Z`TAfp;u%5&+b+EIA*_MmwoZ-soIA&tORNT
z$x(Ti0?(BM=3MMv5KSi5>QteBfmrD)kfO>0$~|!qCXpiI>?N0$<5&_-eG$rSV#-;s
z>rqYOS~mx#Bd1xq)hS&UnB3i%jB=a2sJ~tMH|SNq3mKU=h^+jzFm7NMT8`*%2p?Kv
zglCx1rBJbeGV~nRY_*Jin1B|jw2Y#(5MBBb&hX!Q(cYSz{G_eobKXYt9W%Q}z93S}
z+6*B1uCfY&C1}gT$gQ}{C_u@nRGbX6(~|NLO{y`lI!t&^R|Wu$)EQHFo{ias-wSxZ
zD6Ya{kjFu!Vb$9}1lJE;e?bWX^mFo7M{r-kO$3f*xN#0EwbgLmiOnKe+E6&?lqO5J
zO}qz_`Fu9hm)n%~i*PqEC5BL}NPhe~>n#jm9>DTkAimWH6Izxr3)Rp+06!>hD@a97
zV4)1q!Y}}Cp(wb8{(fAR_-zmIv8zc1p`TbE(86X(;Lskz5|LPlNCs$t&I*3@Q5dz7
zg(ZH6mVh5(A8gA8e7S=ClUg%>ncioE8=f&Szcdm9q!ZRTG`&(9+Z%}8=y4Z&CJ*^FH!H)
zO6uF_Cv{v|Ioxxs=zvkt@qT(~6ymY%kBe$2(%I9Bk`V}ThWTf`%D)5LclPPHu)V@%
z0Qaqhm3BsRxFN3fh1lPV_me}}+A_9^jQhVq?mif%l^%EBS!V0Wzmjc}^1@*<|CoRP
z*8&(*F#r(Pa|=1-&QHVuDk6l~kd*^k3NAs|6v8jCD#)%k+K)33GTv|$vkqS3rNUU#
zWV-YgYbV}_)FJwH#Dq$EKKtiZxE!wO>>C;~rAcJS)gQ|bu87a>Bq!Z4CG#CYz^qG<
z2_mao8RCB%YIu*~fry@0%?j8RqSK=gHT%;00gq{+aoI?zOJ#Z@*O24_;_ai#{6Jw{XWl?uUYe1F(~Hr_$A5*lqFyI9*+@
zUpYuAPV?zQrOeTdGfM)`R|Fl%N1{XRI3=lfy_iGf{5lsgZGE>@Us7TJ6UVf&=$K4iHcN2VBXIzmqR3k_lhMz`!Sl1Iz3LDE+lSB+b|U
z9D2+{c!%hZmI<|NN@=y`8;Mv2fHK5H=m5He$79}y&UG_0o!rN0#TS-6*Dx-lwBzei
ztoWzPH!@c@XRxy~7?aV3k)dfXy8}bV$ykYbGU;A$fb-#NdHxPZM@jZsfJEkpY5jX_C~g5?FManrO}M{gzlbnVGGHr9&nMhi=K-R8fI}m`kg8j#~SgFJ&L^6s9t;|z8){)BuGgxsRcuJy_
z;Q0L1?9FGmWM6i1c*l$~G}y%PQ+vLietEn#9GtQv4yki`YNp5mg~!G&_LwiUP>k#v~M`o9X#L;vg$98f7b8e%!iv#+M`s<#~9
z&k7&06;2L)0*xG^eV@=!ExN7^n2KREJ3QfqNP)#8{)N&9n+=K6d<@@@ZzodFo@f9e
z9NR<$qN_v_79^Yx&?kwZqUkZzKRb@`9lo-Ph}mjl8J!FAE7y`^?*9>a!|jTKs`jAn
zg4=?mhGM6N!F+buY2!|(&Zn2S78rTvj?&EDC@qZg-*cJ;9P_kfLusG80mQRpNiMva
zE}JrEwSQn^`eri1p#6g~Py0ZBDdvZpTyj>cEiS_SYCW4aJW8Ph5AsAR3PK4>5T)8EolY@?-rc0ut(6Ya#)~nwc=gv!is3;0LIiO=V=NEHUX41PvGo
zC{fpAENGPj60bC5-=Ne>y;sak8(qv)XoL6J@6ir*WT%oohvC&ldY;(xyfH@a`-Pye
zKhAt3BSkFw4_3M>rl2re2H656JN0Mx;J-gM-dN8Tsldm&EC-%shQ-7ugg>4NA?$w}
zqx#PHwPB3iSg~t%Bv)oQ;f}>^i}|z)th3Zut(ks(_e0NVHRL-cru!
zHP^uzm93m}k?PFW;b@V{C71O3bp73C1B;xxHe5
zptjXLvzxmQWcvc_Ir~(la+sNs?$8XHw9E-@mBL?yXb(G-Z7?Z4$97??%I-Y}qpoQ*
z5H*eFjk%YI4iWkQaU7fPD|$<>zYIp9gP3I{*#PX`O*~d`nXCP$NJ(G=XoX~%kwP;FU;@ag
z$OcSTc)B9F&VRg{u67zCp5b<{xpEMIdp`xHaL8%T2gcWqv9ou8A}S_HV8UkY7GQwt
z4Hh&#kvqdMY*7|n7VlTF>|xdkw(UT6(}sJZUxmW#J8_)N`jdv-OCZBco(1rtP5h{3
zG*V;)@0^RxZW9kC*4tCs!}q{;T?%yQnZPz?Udig$Nq7r4>j;t3+BCEiTaWSV60n_Z
z3Jv+^xwa{^)0gs^7@?QB2LTZt*&EKEqqom0!^i&x$Ic@XLGXui19H6b+XOy8}m(km*IT+fe2RcZZ4G|K{-v;CJnJL%qU)RYpL*&?4
zTt_VDh6)LJuBor-rMSvZs_Yq0XS)Mz{ByZx@~y}#K6W`D+++96Z(x4J-TE1xRmCVX
z?%^+NQ-6*yaK)ruvv4p&-1Ef|j`l|Wv*YPFFqOf-_tfIezIj_coEPq#2MpUpUep*p
zn4C&f-r59DItpdaW3spGPlN1=_(QllVUC!113zi3Qnr*NIFDu@;+iqS*W6mQwX?U#
zif}qmbBD{>L^&3blc39)$>gkrX)k?mYUWT8&XS5^5i_{YX@5XBl>4r_M}q>S|zKn6c;ew
zAyS5HZc{?GyAx4P>@YNs*+H*Iu1?IOR}t`ebRhk&|JZRlF)dwhe&^Q{H)Ifh0L=@T
zxZ|h5v(=)s9}q)=6tVASl;5_E#t3sCe3}gy+5+t!ES{Yk{*zfSj>JoV#W`z%orL{d
zpxBUTrOg$~HXcA*bGu$}z+P2yj7C-tnzSA#tv3{Fcit!|do(=*r=K4-#A~xd2dtQ`
zB^zVCD@-3`b7R`!hA@k@Ha|^n{Vk)_^`v_IcUHooJg5AwytrIjJ@%CsI;<#_HvL64
zV!m&
zuQkRNy?MRS?8rggu`t`^?`|lwINBOLfN~tHeV5U6nEA&w99|)g;dQp?+Ob}v5R2W|
zn+*RJEBAZs=KPzr?%8{6xu-eWX?P;vN)QB={}}!xys+?XXNCWgy!ZCYjHtQ-#mh(@+F^@nNM<&b;!)1|X86MB!0K>P%ir>eK
zO;`A2Wd*H+F|!oQ+LAJ2TEA%xeIzh}0`fWU6>WwDM-^{I4``p|s%NF|t_4iYvA2G?
z#V}P+i2ZwV0=}fwAb~3#Dz!Ta;8YXYyem*3*i#681q}hSuh#bx8LsSN*LK2ptWPK#
z{bz$AAkI*)`34XovLMv1+mgVpktJ8q{xs3(n;2xnryHb+2Ym0Une*{+Tp((YXO-ts
z>uwXDR(b1n-TBgEZUq+p9%|0EdJu)wYF3uF^tLjy+9mF)T>!GB+<_=(FT?4`XY-x2DUmb5Zgua4R15(Rh
zxw_pN2jJsZ=nA5vg3FCS!r@;%$nMz`(Xk<*BGlcfp)eM}B{SF6yuno2SJMCp9?nA=
zm29#)oPYAH=qJ;cF`@Hl@lIgquygmH3xb_XIEtwxaP<|@w7
zvxp(#$k|!^5v~R;0g;Rse*}8YANkDN!heC-FqzyiP}X|m;*7$WAfBVEN|#<l-!Spw$X0Qv)0;=|QHXOw)p0CZ!u$WOm_zUC
zT1U1#4P|g?th4myn|9Tf{fp1_()Ztm<45#hUiBj6>^<@*Ufhh9f~Q|TU0
z*2wi3EuV8a!I{x0^3$_>^h`8%^Xba4$oh5EUU!GMoJHEh3)On{#;*co%k1(eowFq5
z?POOUEFJ1HpwxX>3VRwA71=vYeTDz^ai}Rsul$I29uJQp%Y9OCU5C0a7(?AxGl)^`E7uF>+}EqQVjOndGYGGXPDNpYL%G@)xUC{Z
z6=FI~x(2q_7uc51dYlff_6a@$?{pkOq$!@XESo8|D)jSL&t^^;%6cu!esXPu-mk=l
zMLdn)no)rkx_M~wgCMZ^W1LtZ{t-9noI!p^u$>T)R}(;XCoqS19HYDHW1G+OOt`nP
zA7F4nY_mp&&(NP4W8gFBkH>|%e!}{Hc4*Lj0oM%qHg6UN>ATba?7)6M_7U*^6V3@#
z^|s9eOwrpek~cUDJV@Xgd6YLH-h|
z+TLoY=Mo5#1JxxOi%M$rl&C9Bs9s8upQxlskzH9q^O0wBO|B`SB(@tR^tW@>OcmT<
zPTlHmtWWV34eXyRs}{`BuBVRGU(_aZJ(|zSKN}s>$nV#19tCTIZ~{kh;<7TMS7!IY
z<6Ya~Bn^aWsHIQwV?a)TioIb&_P?B8JAvlW*0xlRO-|cJwCxNIF75Wc!H6>!{91vd
zI=_T($JD&XJ?Fav!`JpRTr8h+I$G9lF{k9)nMAA^%lZweTYBK6XSas`HGySTmkI%1I
zR(j1;RmNSLOuXKAJ@AG5lIQ*NU1!IFf2-oyzW>(!LxM)DP5(Fv@0rm(%$CpRZ1xsm
zn7Dq{i4y;gi}iZi8TV~uQ{h{?vifxX(2cMHJy6oRhXx}h>yNc_O8+A5^)-4v(P?Sk
z|06paYs_hVl+CO8u~<8s*8o+DrBiGrpR)aJ@W*|gNJv}&R1;Zy={!?SL|V1YV|CZ8
z;vn{P`6!O{!&_CaCa5i)Yv>5K@FeW9jP0D+&cMeY(@~45S}r)yB#RMd$8lKF!NKu!
z?=SSOxVAPx)Z}PgPrDP^UJb2v!^VfMvY&Bk1iqYX((@>0xjiSHu7KR-^B%@_sA#9t
z=&Cqbj-2a}lUg&aVfeHDH3xI!=ho1DToeUkZ#u|3e&Wn~J3qia=3M=CECRM=-1b_I
zy^Zr@zV%-D-DfJ)%<<#%5U=I2$&8!cr)Hgs!xEbyZ0}F`wcf_H@6YTUtUEHGf=R?5
ze&F?TF^Qdx2x^LaH8$iOY-vzP@#?v|iX!qPk|CD*2ZSK-H
zAH}374T;J-Tq(WF=7p9(XnnKoK+mzZ8(yJzEAHK&k9^*et3tc@X|61}&uBZ6IaKaZ
zBm0A=Z2nsyc_V4rG0qq(vCQ&QbC4d!p-dgqnSXH2!{tZxOtSX|Y3Pl~a?WqJs;o1^
zWu|dNyCGJZp`YT7fZH*Zo^ZFr*cX-xZv4XVgT}_@theh|)*IFo;tPelR8Ch6loogJ?+hR%L;vE`B=lG_Tp}vnkHC~@AewKwxYJ0frWkZC|
ztNkr4*}X09ejA^)?O*u+eKe4b+#CGWR54FO3Hp*bll#-yr1xk^`jaWIPmSX;-hC0_
zz9`ck{UX`Er`R52mo>G>p7`sZtHzHhZhMezR)vexCRu$E_mK$y7Hfh`MIFjaCSs77
z+;iC9M;{_;aPw5PJGk;!E^?#IS4eeM``JZ48gk~uUHJ=m$Mn~MiTxXsErW)~=e@8=
zJf&Xea!y1{B~x87wFIHhV9Dxy+lSWeTS!TkIr4j+YkG(8(T2r^v~rKOy(NboGK1Lc
z!HE*9b}ca{V$VTe$SL8pvt@6HA(x?q0`1h8z7{=WlJ9Z1
z?&{V?m72;EiR*edFex;7dqVHTeZ8y3AD`TLm*4?N*M7>afvL
z=4fWc#C7$h`d1OVG~{|VZWyW;omS1~v^>n_IHWD)@T|dzZ>^!2<=z?vw^i%lc)jBk7lr6&xQb?r@u$m|bWdek
zhR`Ing61HCGzY7Mqn{c@2lWl?`^@7lF|T8#9=}p7$KN65SQ2U)?qk
zrqxv&Ejn9oG?D(&LA5X_Ad~k+e4Mc<*gw)L&%wxruFp$_+YVj55(9WdLTC1akUEE<
zQd874NljgN8xv0=V_v@fBf0Nlg54R~+qDL2{8&D^z__~SwTI1M*nz+8N^;kM0!oy}uHvE3`IG$p(1
zQUpFUZzKzy64gIt(AlS0!ihp76#V8{itzKzeS0e{qYpdx*Via=T9L^`CzCpD4cb|H
zb2Dl+mGgDyT1eufT>nnxQ)Lcv8_PXI4Bw|NPs-U3ZB2Qoqxm1Kx{szs-VI{cHmlt4
zlDQUBp)-+efNH4K$+JQqhHZZzU&Tv6QC-@dB?coVbOpT2aJ0VnmvEWo?I+}eq`0Rm
z+xmld3#=DLo;%)jGk#a&vK(*m<#_z3%gr?UpITMdXGXbbkG2Lb0;sn1B~%276u5yY
zSHYI|=aB8ABYIzUw>90I43~rnCqgkU%|j2k3KfeIW3*83Q}L>vw|AHN`YV*_#$Ll|
zwqK`T;u|KS48w$lH@5SNKLn|qNB=Q$nSW4ts;{pBTQ@@oeRl6pE)0I}vm=2%yQz`r
z_s8Ap3mrxq`1($m<_*zXzo(P!@qy?Z9gJdeXq4JBy9JC~l?7r?Wt`+E26Z#
zT#oa_%sX_NGrDLhZoZ2s*F3-aR;xf^vGWiGi@y7aokYP(oi-^?6ZL0FcV2w53<)CS
zxJrm%r3>3*8fwoIDp*$vb_q>i5(i8;NyoU?xGImqj$nY?%UedIFKMdC=D
zI0q0wzmLWQwlt1p<@<;I0dghW*5%UO>mi<`RqXE$XOkL6q)NOe}gEI
zF>0dj!a+!cS~|b{ldDc+C52_DG!$#_&d}DJI@%76&E4wIzDBDXF?m~s9roqZz4@I$`VTISYxn@x7v`tYfr8#MDmFYZN-J=)s_8j
zDV9oZ0jMMOc#xCIAGAo4d_+R{hRoN-gmz1N{`g6cEbY4dPUntWhLz3}#YyYYPQCEk
z0-$40m^L;zHaTv`9ee0k&aCV%`=;`;59{q?
z8|qu?4M^mA%BE~7Q(hsVXz!QLr^{e#VE>9s
z6E~~4dZomeTT@0k85S0yUOF=|8$7A^)ogpOG0C~`oF_fv?e{DtB7wr+`LDOe=*Bp7
zsHl6WDw;)0AP;O<4f78DvMI>63fCTZzwm8nb!yS-k7rPJl5u6&Dc1S#c4x)j2T>o=
z*r;Mq7#LPQwPz{CbNOe_DO>r~A9V}w2`Y2*&<337sYdsm35$v!Ssf#|Tj^1+x%)IGrPK)(E&d4c*~r5T;}rDm@jo!-rcdM^W~
z66^VA7L@x|N89@({$!%GJaUiVpLNfN_!@n>gv-hww|Ze?akEnhWvi2g@6Vx+F)MJT43Nhcqi&rD?9|vlD!@WtyKl@?`cgwJXHy@I(?ZcdP2x(e
z>(kGbd_J?*Hc;84UPj>^FjXn;EYVwPZMnnYoc%cK*s=un8JfT&8GcHEr+rhN=rCIKVSKp5oEM5Y1
zA<}d7HRM`0{2R(pNafA08LnYgrL_6Bd|MXZl}DOt>*0|bg%qLYnol@+NyP8pv+i*06p47qtKcx~`xSsOqwXVK0ao8y
z_}3#M6l6C7j@$5*#1>Bc^@2$
zVhetY%*QBm&}n$zKdE;s?y_C=xH~%>wC1aJNnTaKq4cgbuac!YerIpreLC9hyZom2
z2>jf#^i8z-abxZJ2WR^8Ez2@%o7BTz_*^T~+zO#lm8pO$O?s|DoZ6
z+_+P}U)@)ID(w(;n5A^+QQD6G%tsfb)4Rwta<`P(yjd2=4{FXCGC;iKgMh0a;-!&_
zR$7F&Rt9kFV>>RoV^+LPT;K%JlTFrCnaFzAP9lJ-u`NML;cf67i*#d*Qr*X1m&MI9
zGv^B5d;W{NlueL@Pj}NF$iu>@(r=(*xK>*Z-l;Cz4govRgAhO9wZSx`bTuI-iMt7=
z#BdR)Ce-DTLH4eUe*p%9l`kGj;)XHFf9+=o82y>21Hc^Vc0foahNopZGfetUDDja*#nI~5$?
zz?Ck_wWK4u-ID|VWPAwK?dBLQ-|OF2x?+zvkyO8Nhr!eyj2L=&XufW>8?iSgLJ5Tm
zbjp!()atX7-AR7rvNZ=n-MC{TQjUl<$=xp#Fl9C<)*0q&+q`&|Tzhm|2
zb)#MA(g8+I`s=q|pZJXRkDt=QBJ0U!hWc%_o;mq>q*~a&fO~3zuCTZPPWqD_9-sdX
zTbNJsyGrzTD$LKDb*J|9^d)c8UH@lL{!0esb-kLH*yBvrvT1L`qqNGZo0&CwrGh9`%)k%Dryd|{Bi@m
zmcYLl0-D-E-BQ#~202pz|3SG%KrGPdepfV3lm?cT?T8ORL%4{$IFGpM{oPg=
za_C@DFzf&nV=uE~j68)DZ_^Uiw}UyAh(7~_=OP6=!Gx*;)ePF#HOHsl&5Mx2HzEM?
zEzvaB8?=kdfn!d5Z-F(qagsIn9{AM^tTTW%^-oGi`N^a6j`2O&fXO`vpyByRCRvKP#M_%#A9AO;abh=W$>IbekVQwXSK
zfPah#(7I3NyAeA;G9b|6iK2|7NSEdYN9=y@r|3&T2D@ybQY(ns#I;k2Y%~{}1keFM!kP;F
zSQudRPs)c1-Qe(fB7EM;2=GA=83MR^I4>Y>mN#Qd>Il5o>Z7Wd-s#I#!rLewNYrI0
zAM{Nn(UbciT#AEIhC1pL?#7+4-YV_0Y%(7mfGLWQ;TWhgIL$f8EQVh#JZ)eop4NVC
z!4g*x4M&-DISCgLI(^*eWv9-Ct=hBfke-%vFD>tCNY6@ayLwU5T4U#kKZ5rO?2u6j;G%d^H`=~_RNkE7m
zIF+xU@+7yy%`4POX}sa(g|5$s8%_`%n}^6}xcW6DjyiJdN_6etjIlhdL(-MY7rj;7
z3UbP9!W>ZC+%q3$VZl%x?6nT*J!hzTSCxPWE1Vt!F*!d3aZ;WDac*^yyVO)4Xi-YY^Wr
zQ@}h;FEsB1@xZYlHW=PAhy{t&cZIxj5|^_aJ#fFAYF_Hx1aUGZati!4r`HvGUs?M8
zVD>Uyi?$Cz!4t|>aBh&K7(P3X{*~Yz2cC2oTlBdpffs84d}i<(hNDhI
zpgcibsP|VmFM`n{AT9y2qY0|0;mtYvf9NfQ4m5-P2>d4mc)KwmDaa@5nSwrbdS@8;
z*<*O#pPRH(ujIu*2aooIA1(zCL9F
ztqAkTIi=K6N7gpDq>`eCR!8>sW1VV}(p%4y1>SuIiNS5>6IDCd9jh&Qkm2K2_g*e9
z+<_k()%yb#LvZ0o#}i*)I3mxoWbF;5?R}Ooz*)Aq7zYiL#5=q4cCZ}48Aq$-b8v8PW5?#746+r1eAzZctz;#^80frQ?eYUfdmLgj$rgqz|m
z_uJrzfO2b9uP>1)GQ^WnlWV6}7EzG2lZAoC_&2G>GAsEgpqM{Ng!%+rEijOQF{Xf<
zyK!gQCWlV60X1FWH(NR^TGQ?%3l~1}_=B3zs4S|44)zK22$xl^P;xh?K5@*gXep;j
z^dr1k@snzt-E@}N)YT&h0bg^O8Tk^uMQ!nd!YMQn=L+?7nQR&RjL#CGcCx3favrpM
z{6U!yxNtE@BBz+XkPjo;RM-!fDAcStpyoxvMaEEV2^DB*l)O4=tcx
z#0Ey#b`J45bx{RwX;neTib51SY8;9}#q(_;b6y1@!F<2kh1ua%4a=>6o7C|i_-9s>
zN>aT-CdaLhTOYqBoXWIGn+qy)4PrjbKmDmJQJi9*6??$Z)?YZCFeVSEq5UytT?;RD
zsL(Rct5jVMkRUF#D!_eDCxbP&UaU6u
zQ9b|fn(@&R-uNoDA!-gE*YbNT{y%Ij`t)6{9h@V@!`lm#tY?s)RE%Gw12SCL5N_Wa
zvnV0pVkMKl?)|x`TWw#3w|bh+QD*%BOwsYcR;^ZS5qXP#3&}?
z5)va_d8{C0wKXZLochdF{Y1#C%p)8Qhx~&Xa?T*{BtFLyB?JDKc`rRAReWM*3UyBt
z%!JO2b*Q#J9s6gfgT4`P^4O6Ok-^*lQ+dhGEQvfgQ
zbo&xyHK{lv%6bF`)E*oWj8+I;8SDE6l3mNYifXzmv4_kH9(83txcgzKOL>B|&2!GB
zCPhhl;QzBsbQ#$%VH(3*_sdE$op@$cys85nJHVaBGrOt4yUP;fk5@T_l3=J6*|xgA
z?C(iV7EpB>EWhR7k8eq~%DXyQ*qEL!OOJXqLJWjK?9*U-`5aJm;J$+pGviz*9xAZ}uZ`?Hk3A^y
zaqw*wsJ0jp{3x-9OvbB+tNki%Zql~2*y>*{4DEuS2Yy^N@rI>du6NJ~0U`Rw&HC%9FzlttB*5;EBqym+1ga!iIyvWnuxoQ-qG64AO;YZ>RK
z!Ft*@%GRza{fC3t^ytdDQZ93um`lUc#tRf_Q?zcJ#uzW|#z`l_l|03Xtwy;{&PyXNTCr$>%B)0gnN<4bZE#RnICZf~fulYN8aQLkas7
z+OM+w5HD2WN6*$Kr}{m-9KAd;X
zL3Y>8Ms0=0vOm}Fi-K0N&u%)@7u>(Rhzf3G92-n4GY=Yi|M=mEW4#|=GNm{=eDai4
z$z}7-TftZO3xv#R8i>JD){*+ZRfQT$p{VgS(59X4z8JWwQ
zwo2kMWSa6Acuf4oH!d%*1*#Hi+xifU5;wk1IxJ;=J7;9J;btXrfY;J2+timwKgiXm
zI`^w|sJ3t-#1I&V)vsi64Z$ZT3+N~!X=vgtsiYKr8F2-!Mu*!*Pn}h4vgb`xV1aG
zd|A%wVFfPYO22zn<|cgo+fuJg<3RsvKi{YsRD3Aw;*Pk_39*A>i`VuYaqZ4G{Oa=x
z6Z1M_KE9|hKX5PRvM_qqQ{ARH<=oZiqx#h@1A^#xQI0hu*Nua9o|V5Ll`^w-E|=NR
z^=8e23OGqqmJHv1Gy+n)()ZO6l3`P07fy+VYM~#_Zz|4|_{0m1Se6hc
z-^uo$V9Cs4nc^tb4?d@`r;JTA7u|t17gNmW0#gF53o;1p4VOVAF})kDPGJg1&$lX33%l
zAw!76j5_W#deQa-z--YRv-Khrw6B|`V;oQOXs5`O!zQv&pdAube{3ej;ICRWh3H=VcOWd
zcj1}9><)3X*2RdUWGr=$jlsi#>z_mm)x(8}*r%m+C(17sxCYnToqZTJrXvpju3=ZL
zPv0AM4tAeKP~?>=f&(YNFDdRU9Ix%EW*Q(NE_fA1ml3SrbG`#YXFK|Iqe8EPM46m<
zR%T+DR~2@>O7RV-ZbX;=ccqsJN}M)
z;Gck2Js7e3u1daw9L9^cfQe~O07-h&Cgh?wW5Gnm*l((V5;_#b`zB;|mD%Z|CQV*J
z^!)k#2tju6eSwr?gxEr_o)|CMt+1Sisq3d*oR-#8T6@9*fy6+vzkp>l(C#5ai{HM#
zCVrWMB-WB9N2|oX(`eK4Y68q_f&3B}ve=>elL!2_z-%*KlP5k)=f8Xe1JCT>PPQR0
z!5Z}84XBQz?fa)+T6Ln=(&N}y+r}6;2P8m7?DFvzu(rd0Bs=!$i9i@$&)o>NQ$Y=-
z#~)Z?1r|R^?ah$Z{V@OD<>asWh73+-SKKlFP$qgM-#$F=uU#QI!)0L)E3;}dIqY}5
zi0bSzEkljKnNUe2))E&IWv7+{R%iZe^&8VEk0Xw1n&0;C9Lz#1=ht78!WVV|^OB%v
zNoP+NJ*2R9`~^y28_8VsqXj1mAFm~o+1M|49}*ur27gil=3i$pJ^{6nYN{;8xl?Mz
zOPRPe)Ng^2Se0Z0M@E<5ehiFm!sQik^fWV1r4BdNAXbe~R>L$Wi>}W#hKIzMOl)YX
zSaC62a2}NHPJm`HZ@C!;id~F0Y}j?0x=h6MY)16q2}LL@QfYWXRULRel`YkP3!ejE
z*t*$k((dwU-X$48_IY52p=lNZqfcgEcDm`w4NkY;I4RH6I*QuG
zVRWC^5tDel>cF!Pqbyy!^~3aZ|2yZt>h)+#T;>E_t;53vCb5f@%IVBNj7owLfX
z{LN3-`bBvk`-P_`1MY7y-wL$BBSGcYsXvjo+yj{WkP03=&ZW9BaphA-QIUW?sn1Lp+wetdJ(
z!IU9*#Ug^WZHiNKtGar-b~xll0Bh~;PDypwVD)!{UA|R*t*wF9g4bf4Q)kLi{hifU
zDssBKb%Dm*3mRVYYMEW_`hu5dELyXxkH_2jgh*ybtBd0%XnU`3GJBY5amunN!gI7J
zEI|1n7okC8ixr9hYKZbWZL>-Q(&Cf!c%{{}F-Xv3s0YBU;-FzqiJiz8iHGphSInQqU@HGouxvBAYZjf$pC1Amilt0Oqi13tJDaUi_93*4U>6dN4g=`E}>LjA*SaT
zm+CNN;U4{DJ*jxAvg*UC=xTEF#hvZ8l5p)4y^+AF>mT6Dw2c#PBN)iSRYu4SWTrpF
zWHAw&<4MyFM_v_1XP&A7q&C!!u8{()=fiIMlQt|Pj4@;8UAcsyBS|r}H_F7msywx=
z%G*%zuuumNH5QLO|5PVMl^%cn;QHyJM+jq6m_Y+E=!NlK9j9H#C=1R_${-FN0^UZM
z^o`Ac^BB{C)>ENjsgS4L?E44u6SR_n#ESd$Nvv;jI+vge%K+7#C()1!xSRU
z_dZDaqLAxwy5c7!0BjKw2e#Q;B|C&?sN9qlI4ddu;jf$pPU*pw2nOoO{>Rp>%#lOikh=$JoP}6;H>mCk6aNNBZWJGngLoX7$
zi_&r#Bk%qaa(_7PLU-#uv*J}5VUSuE=Oc7kIS|!j-{m)*|GHq;xR%{W!bn#foNuoW
z4%-0WD=JBNKP>jtYiOD>A`WUB!d8k{)c_mvWv^3p@>gUIn7Jz6c5EdiRWU50-wawM6A;*De*osPmqdSUFJ-(C{0XD`iZ2J#HcNBdJ0Oo
z0ba4s+R|clFOWSb6lj)6b{wCJeUuejP|Fmi7#e2q-#xnDP-Ht$!Jpu|`N_R9sT0~!IK3DQw^P9`ht%6)u$8Wpq
zX!fOAdym)cwX);a{knm>J@cfU3|%uE{7&AeI7S<#ZC6%pR+hA*ru(h{lhn;$tue~f
z!dKFy`}5YC{!dYy?mkfa@d*e7oAzUf#%lU_9Ndb~GrIpkDG{JPF-X@1*%G|p`>I+sOJ7H+Au2&*o72d%!hLSeDH{i|G#
z@%x1_vCDyqP!4Glo!R6LN<*vBvm6}?Nl+S8!J#mOZt{xwy9wuY7Ko8JvXk&u+VAU90;r*}`_}%BrqRDmFG+nf$dPCdIvM@iz44wU6DNidN~0kUrTb
z&xcbU(1!4h>_t;CeWFUj%b|j-cpVqcRK!-m_zp|AL7ZV(s$h(@6T;+iH7G-ToEyxL
z0;o5Sh+2LPpZrs{s~rwMcOO2Z9eiXMF*ca`K9`6pWh}-k4u#DUp`S&W#Kt}l#^cy)
zM5;+P_!bXK9=8Wiqc%k#SU9*GafhuzS`?_d2{m@I)L@3#y6$Yfu^?fA81vG%)Yy#ATDFKJuJD^%XXGq?N;+yDFl}nF1NlBm|zWyH&0tF
zHhf`iz`eKetujNFlLQl^RfJ_uSJXZT50uORLU>iw9c2KeBinJd1Bkj94SThN9OQyZ
zk7Ge$ETYFPwIPxG**ms;CU?27;Vl5r;q)VlAWpTiSh^6D`bBSXZXT+NR6a&hq;ySW
zTNC^{#FW!zq5>S~T6U7Ku8QwSZmOr#JBfbK6YzTEV`JNfKrO!w%6cYwn;r;z%EFHf
zHk+GcbRyqUL=t0U>+038_f_kcU$#8e`MqLQEr)lCGnslwc^`>^P{LJWCt+eKf(MV?
zqhRDw5Pne`>XT}7GVmlaqc~aow16B4E|yJ`El5NZcAIQ%#K6)6djQj_iKuI2c3hM!
zzJO*zwR>XeCL3AFv1`f~ODw(51zzLWIeEcadpGrHx}{cTcSqL-$xYhe+@^;~?X|~>
zjnx?yQIvd|HHb=nJwes$?V=?dRH|3gyPRUZ7Aw0>am22)9j^*)(N~3It1bKVbL&0V
zG&pcFS(i3KYToLcGHF_MdKEehHxszoKspWh|Yu!R;
zyA4n2!Sn}|B!v$_8xB8Mj5eZ>B5=E9={W!gIv^t#JV<+K3z!+x#Y9tTifly=#MHs5
z`7=*7CaVMuGAB?+&bz&74SS|4m!RMv+CHG7vT2{NR8`4IDt%R3OW_E^f-@GB`;~!s~Oz|yu
z8&9}ETs+d&V(Kdl{Iz(yp=+dztHM>yY@n~6cd|Jl{Y)yGz}YYzt{9ATRZ-S
z)~(%HdtH)lIo+uI04Ns~zQ+81`fIvz(NSXAj8kKi(mN2P@
zhgx_K`N0bQ?kEcSs4V_UbDtjNwV(}?r*@gP6%eTUnDm3S?=ku87UK@)rP8Hr>OPrO
z5X?xv54_fZT3bwaIt^ZGN+jgv-+6=yOUU=lx~3700}~Z7VLcZFH}qm{i?kJ-78%WIR|?P>IA|UL8z_I9}}}Fjk`NfB)%WVKF!+oMQ-a@8D=>pe4W+lKI0n{Kxv4wh2#zX*V$ZZVSMjYp<
z0S+18Ly-V-e*Oqlb%`goE>Ugd=~H+LPsvN(??7LKjQlJ^Av@VjJk+ejgn}e7TlInk
zEW5tCco{3p!AS6r?c0*2OW@K;RTr_Pxa8~GyNm&fq6(`5DlqYyP@!N??6$P8*MW(b
z#64!=JQk$=IdIAIcJjhb|Al*?Exle>c@qoHrmyCE7==dy5%e>?UiVCWHQ&qSCGW(5
zH}-85@M@3~%wXWX*NC8@LWIm0%zxj+Q=
z2+K6$l=q~9{vg(ZZQQCF5+L+R&O9!WtoU9vq6zeiI0_$CpUPeVD*3~Jn!|%`)Ba@Z
zQUOq-d13lhGx#XMa!jYF09fg%CY`|tZl+pKV_>gXaPu(2DU50WZY2Lr;=TTNjULtm
zJS$$>hwMD_UtArkk~(k@{X~x=02TuHF4Z+v{gcMX_fdK+vX!sqZYMaey}iG_y^a$0
zS97;+E--gn0Otj=m8IAA^#S1SCbMjiyITS>BjWuo%2{qyE%*N~t&6JRc5K#{QNuIj
zm)$q>S|2rkdD7T=;i4C9sB}e6d2m5-B-oYkp}glKus7`FnbxE#i4$ku;cNorT;R1b
zhw$1}ZHd+{1*I>m#i$`|GK>h`(mFum`D!uh^wnZC9>$9;
zprSEw9XO0;FEblHd;%wc6|fkU@g6o49b_-qZ0~ir+J903j7Vxfsy;@Iy;i2~_#1x4le5rL
z)d)TGllOn~-YSR-LyCRW02nXn+e8_Xh0`f83!`f85a2Szbm#kL%9
z9eAVa&ZA=nX22Ig0N$uldUO&yb_JD*Zt@hM3(S`C+ILR3z>H`K`P*5X-WcK|7Uj^_
z;~WwFv6D@hO;Z%!QK+~%@h&wUrcZD32m>|=9v!&d4H2$YexI^`=kq$*f+Q~zj
zhCzY5UH%f+NFGflu_AM-FMTaMvpaTl-_vM%_~4$gu3>Ju4dr?byQCkS#MWHx*;UI5
z@uH@bxVW<-1iyH>g7$`G{`gjxNShk{fZ`yX%8TcObk!wJS-}NRNjGhq?AN0E9yPO=
zx=AEtgu7)ftbQir^QHq!As3Y1-D5cWRW*5xl6jUhL5_ecYbi0(^llzHgc<`RM(BB5
zEYu^+R%!T@&k>DOo1+qpaXa7~Qpz;?ifWC_{$|aThj{)X4uu+rv(Vp!PD~NqTd!{A
z?M)vg9`}v7fzuPe;psEFkDnQj-fa>Ud*H0CWVXBXKeuBIy_`mjb-ey_uiWO$m5L-A
zo9i*(L9vJ?|7MVbCbRcUF2y29lReicIMFa%e%L24|Bw5g2KT*gWhPxOavdyk=}##)
zso9n3qN2mCDs`sfdx{7Ufi0<E2@A5vbv)QdO2|St^>o(q@_9`gilEo>
zdgUJ&UIJ((smuqKQ5jnord&p-2Us=$jMA7l<8=B2M-8@H*UV1_U%~uiM^5tz4sHR*
z);aOhNQcOWk4C5$$kL-62?5dnDqcgkpbgR7!Q-8ZA1V5Q%38emKoq=+X3(r4H4sz9
zrZUfkfm(QLD0~p~ZrYan1n&ObEL|Cq@qlXB015}O_3&8*Xr`vk_bvRn98OSA!Wk*o
z+<6k)`NqlRvA1=_j>i{vCP~g!c#qGx&|{9$M5SfuXrb#{Ow3W=s)bM32-kB-p(%t*
zE;!)S^7oB%hXRy^&9d7A6$>sI+6&fw^VrW1|6LO-;chKou=X;zSe#P8u-X}p>0Qbe
zL0;&~M3Z;$Og$0--;{BBcpFuCKx$9}i^>G?zd_Z8i1`bMDYPQ7%A{=@4^14UYjV{n
z`W!3p=bzmlBN>j$k+YGU6iG8QoUFXV@;dFr@7VTuaO^tw^DVC^v_e+-O)hy
zZSNEDOY_5zp(84Fwh#n-ZpWPmCEr1dX8+-M@65y=^ctu7L>x&mY0lx~@FlVv3pgv?
zoYkII;fcf(jaq3TCv1nS!^Ufd-@LVcZ00*1Wgr-3ZO`&OT5R)Rt9BkIFU!`V;l}MK
z6wuNOiHNf`Ugp$E8qV&1(h?hHQg<-y#?^+$xkoE1oR56@ca1z8^x;v8t;lx}W?=;q
z1pzRpPV_(L#>pYqFK~PBOq@GU
z4f>rRzjfpNQ}zdq9UPKch9DNk+OJ)I$mFD@nzo19Rl$&te|eU`ufWXU_^spvMLQ1Y
z`n2{M{@Qn^7c#-tesiUF58{s9PArKAD8G);f0ByL)iNryaONnVy^~dk3S9iJBsZJX
zwk+c@+)cDjXVxb8+#S^`Zz(w&{T%%|-uk(8|h
zmi7c(Vb!e(#tPI=!!aFmKk{)u)z_xrFF3rURAl
zpGZo;0(#IV>B+$-e(hE@pL!x=9zw4@i!w^W8{%{lXtsmx-~2Fz>Q|{H0xp8r!(k*v
zvSdo?Gv+5Co>Hdi{AyvNl%q@eeY;WKYQ{n8-xPF~p@qA~&0lN>`3D@K)3rfQv-FB=
z^g6{cSydXpRUM*Wx!ybZlIZn$RhO5#
zBUEn*{<2gY#Xcv=Yn5ddGpZ;L!pq{O2LLX1iw&|{0T3S!1`UzEbO~<)-OVzC{ZpW@
zf7gVV&~RAsUfF}+J^D`eS%=(9T}%~{B3XaV^$#*KoFm5B6S
z@2?b8(JuK$+FqrkxHK0H8r2KC%uP
z>K?0hd)yk9dhH_VvddwY=dSjaPSz)^a`~eL5dkTtzuL6yxfh)yeCLuaF{D=L7W4$x
z=D)CwE!tJ&VBr&1)G#OvxP4cJAEw6;)mwX>smTkV)-G}Z?JI7*G;xnS5jF66X(Pp<
zdo-PgG6q}RqmpzUD5Wzy@cQlH5==IblS$i&>4M
zGSldcF|H<4aq2Zt>4WM;IXEOh7e!u1Oe~JR9X$JM#A#FG9
z%|fzI#1>Tevp2HLjqPZJQg7XieA15NwcfkL$Sq@Q@zz5}TOt|PXbabQHZ%i}$5_!U
z5&gj*AQ8|o%#hcDb0!t4@`bln!wwAZOarK(-oyI<1GjzcnwNx
zdai0a;_4G}o98E4)sixQvAl8G
z^lYzdi5K)OWjo*G55ho_?Jez2i=7#(6@pmD5AExsE!I_Jcc&f)N4c#H#nfBxT}GwN
zQ-(~#t|gbi?dCmV&`
zT$#9vE2+QX;WH|5kYqgXE@V_qH=Fb|ogT0S0Y=0hmH1yO4mi8cD
z{P0+T^=N>KlX2(axD)WYvq`fNpRPU*jpzPWyd_KBZj(&|zw+nhM=V1zl6$u5dTi5a
zokC5u627BNZ~(Wqq(9`yy7)tZv4`qU8mZfD&^HXy?~48i_h2f*Ok8R-Kiva-Yewg@
ztsa0#BkjQJs+M2kI
z0QPKH{8hWpWJB1tgKmsq%Dcob2@wz{bFtk?eDTMG{_|>`yzz`q(YLsLh!;EyeUfmx
zl5GKaifkT@+5;apDuT8ih4))!s*K@%0T7ChT9;sE#ZZ0sfolsy4RHDtf8Ult>gGf-
z+4RF|=4Uhe->{@=_-QOWj2pf4wT*SvibJ8B&xi+;z
zt`7A_Xr>F5!85{Iuq+r7D*?(BCPxe`k1tW3L3GxETLrJqBCXBAWrL{gps05~4PYlTH@5y<=UwU{qoFpV`$BAbd8DvmK%y
zT-|w)R3N_1*xf}iEdb2s+Xubd9^7F+s`sCBx!n-VVfcrfhi}A=zX;mEvT3%KSc`4F
zQAg_%cXW|%oKDw@dpvnFE9P4CZc0sS+PlDjvnhu7#*`;+!05A~+QQz-SgUGR_q(Qs
zq7TDeejOmus|qs+h(>4P>{T7AZtLgk2Cz$p6uqAP8C0^M(^BS+2DUwrJ^n#iPy23;
z4fcJjpzpP@G_t2>2|ar{Nu(X!4v~fKo;_`7q4t>>F}DV1)T}Hn;t=6*{-nFSM0yxW
zF}%kRD*^}5het8XFXMxhMt2%PKK=LXXocN_{QD>HO@^ZvwS^1
zSdq*39uFw@+IXkjjQU$%{?6JU5-%aPAc8kO{f&
zf`$wA)CRJ)Kk87Kn{Jgx)T`Uu4&+rqRk?tEPyYsx5hPY!s9gL;+)jifE6JnT(Rx;A
z7JNAobIy2m$2@ljF)`=PqsKBM-XG&YaNL-&IRlUeB_Yjhlb1Df89~rH))PrVoWKjZ
z#}?ZXw1LcAcadT(tod`hGS?}boJThkMJO{qa}42lu}-UdAOBFh44r|EF8^SuJ&bIU
zZ5hR1^-Wmi7J*qPoe%`yFpTW3gz;U!C!Bdpa<=@TO*RBn$R2`X7ITY^?
z;Yy@TBQS^4!}?*cU0rg4d4(xsi|Lt81>ON;P4m6zES_PzRW0{-3CHwM+uU4~gDj}3
zj#e}f@o}1EROC8P?0ayq_F(k9Us}Ua)>c&Sj#pXREkz~zhnjwoW>-cAWNo+EEj(0n
z)qwI&EZT6i$V>0fhaW4#bsj#>#po8uL+UVgVt?(ts$~|isngZ?PoaI`w!o@<<_{^p
zb=5<@z+q1W*uQ|M9IL=j61#bgEY$CzRxg6
zei})0x9Y^LhZ{&>G^vviT}6;Ezak&{%gUb-ry;Bt)=G>rMF?y`zvu!O(o?v@M7h6`
zh0~|?v2-6RXhl#Tzj*cFRO7oOpc(!j_>O9BK1#;R1AOXccakvJ%^BHl={N#N1;#jyeq;8wKKg(P_r!(5Rt;oi&v%lv=bxaDx
z@4j1U^
zv`e$-am>eQ=Q<(X2!Rle^{t@)9*ZiOS7=Ce3fKJ`3
z;D6UF>f?3j@V3C!m&774)`-7E+c$5vv{-SMx>w2KZbl-8z#M+xxK$^+QIvu8pB5P*
z>-(E9+EmYhCH%=-;R>?(Ya|eU35kTGrAKyAQ=q+foQPU*dY7+v-0Gu)=5uD02KKwh
zEl#l|`v-vyg-d(4y~z>#t)@ZCAGKyQy;oeq0&AMF2hTe`xo#0-^ZWb6eQfTrX@-qXSn|br>~I~QFvn3MJ8cSUkYe*n%$tXtzR_!liy%d?`7hq
z>Nd2p48Hb1K3xE9{NFX7z~@u^)F)u8)C12D(K~sGyj(i;8fanA1ned!HsZ)$z>Dz{
zRUM+&_>K4zujvb%O&^HR7?Cv69x6vqj`=E3SMP$|tC(JDB!2jJ&FeOhbj86XFZ-hv
zmLfEUQQQ8UgQMH
z;>YQvNY4eF9`LPS%HY1FSAY@Yd6W`Jd^qoCESx9G`+8z*Myi+pIr4O0Nt0?+{_CF(
zybAyu=1e^oLF|9mVDL?l1y641C4bubnXM(>gIKMCt>ysnnZtC6rIO6<;%FH^RDsrc
z&H+{bOsny}i~h<(k|h%9wL%R|`sl%~SAw~&8C!sbuR20n8l(dQ5POg=E0u4=)Os_K9w0kj)vF^L(}9%b~d^pnI{h}{EUG~oaVVHI|XWy
zbYIEf`_cJID1CzSnZEco8f-19_xlgKluU2c1P&KY8=`{}N(=%Wa8qR96G(VC5kF4n
z(;Eqwc`dZ>XQxwMo)pu(eL-kUIx%G!Y
z?v7FX(j8dqKmX?Duj!aXW&Oh9Z}GGh0I?IF6#@8D6-7^+cBL=a6fLI5WSzcA(^vYh
z_L;)bo^yB^iq_gE8Ozcfr-LF@SWZt!eVtdvtyWc}q&GJ&Dl?ePUpDuRs{Y4PLbu?N
zcXZW&0|c5IR{|qSdV0x|WC!A50HdYHPbVkks?MHCht_X~A*QPS}0
z%J#^z-bp&?!oFWjMb8%hT{E^6ONI&mt|?(pQgnz4jmis=FcNt65?g>;+_J6);QuVQ|nBQ
zi5y!73VQB=52
z1|F;WJxA|2MF&bFj+uXJ4A-Zu!_;jA0L&E~r(cAA5i0g2UFj|^CQhBdI
zOwJ-2rfC+03&R+KXBhs*{mzUQxG#
zIovlOQpV9<;0;wf-m3aRXR8}OiI$8NVztXZv`lT05xR-FbY0qJAS5O^b@^W6`Ms4g
z&u-u|1EH_BZ-%PGLFJMqJrRkEfz$+ekZg3a>}02^($P6i$p@0@vwc~-hM=dARDKig
zQv}Xd-+fRnGZxP3!YGEg!KI}H-&*-f&nNBFLhcVi)caI7Xqani6Tyqwy1Lxi_?w$BWyZA;$M;
zdxpR(VojbQ^`|z7x#$46?nJ$2VqRE@0GzGpD8%&XF!r0f@Y7>s&Gamh9E8~0cY<+r=?X8<+)fy16@+?qZIye1s4>G9o1L?=~9x&3RjN6sFL
zC&Lm;y%kgrv8AemlMgysEW`uHQ-mU0N1E`kb>Ai4FN^dJk#-tU4fgJGBQKhR0U+V1
z19gkC-2Su3kizK1xhh#{wK0ix6uC%Tl}{y+IJ0A1(_H>PK4F5e!OuJo7&Ob*?}F)&
z6s+V$2k6%x`2}SaZQC6Bk(J=(K1o#%*&LvCOZ;_kiWt9cj)?lq$vGyn%E4Zc)plGH
z&Ak+tdCie9>fy8TU6TlRlPrQ|)ZhFTFPJPqh$xV$t?N|YZ8tAZiZX(e@2OsdrDst$
zf!CxC(5EZ#-y!=@LX;(Jb>Ny9cP*YXJ4#>QymRY*C40FZFXq;l&#uN_t~(pr?m(83
zwR_@gN%Ds9#D2;?PlD-1l*|}VAnt;`3cWKJIXvA2qiZREnzA0kix~m}qr`FtTp|@|
zlDOZEQ8z(hSbOdHcl%B5Dh*fm9lX-7#pE?{bF#gr-tmWPj
ztk3kG;(djYra{FUxG3Xb!>p{m&n%vd-G<;Ow8XUfKv`I76(Azi8Tn^c`xTnm?CMth
z>|1%L*>%6vh47(XtGh6gkb8!^RlK0%dFup)WcLCdWcg?D--E_T9!smg8b~2_#OxY>
z+9c;ezI#c_tsx&W%3eunv@IjV=~SnX_`cbLul&#
zV6+K976UY$rccdi;2@hSPIeGC&j@*_@Gq;~3|zgK4Igg0v2)9(W`g$1`yY6xL>J5d
zN=@E*8MczU1LcA5X#@C2=u5Ocs$q6h>*78Rm8z_uS%y%(pU8STmnKPIIdrnM5!e29
zy4VMc>}rBjphodQkY(dD-0bVc%(ZAON``P3Nu)`QjIW`Fw95+qX{JjFI&UYyG!+@y
zqGT<6rjPfE84H!N+}DR?QS3_Eizp4?&S^dI!R*1)!s~&OCO-R&ZG-=Q{p;$CCs*~~=4~QpRU7@eR8HUkb5X}G|Q+k*U
zilq21dcMd2fPxrVO9mu80=>;*gHbQM8P1gIsAN$i#caztkyd;*9CJ+Oc}4X-)wKkS
zjGc8i_u~yBhEi?M@ZrB#v1wXCw&vGkKDFyu85g%-X?FW^N-y(dq}JYx*~NPGUdW*E(bWHDI?RsIUW-piqjXl{p+Qn|{zWwi<9zVKGp&NSdlxSGEVz+yP
z!~^suV|E3mcTZtULI%zfj3eewhtHaADtSS-;O?NN0eX@C
zYn6s>9fDDUIw*mhEoxj^_#`7uYqu^OR>aP+jgja|9SJ!9@GjF67tNL=t(TWk
zYa)=-u=h0E984Li^daY*G_p1cw{EzK%WZ*L^RV$~0bBj$G=8kFfZa%6+$K|#gP3rI
zhR}xY!srKZyxeb)X6GRz9D61sFln3SxlUs=ECo#f%1;H}VzAsEW7o@wg#IS>cZsWh
zKx?H9lg+hHDq;Q5KFscz?gWLM||&(6FbR>LTl
zd%ld~?WU>Ds9yJquA3!SZ?s>_jLl)4dPoszQ5c3Dlz$Anq>m7Na4WFNNA2hhYz2<$
z1idN%v$s*^Eg%vkkjEQ4MkhsARnEvSP)Xr3N|VwnFM-`5;Qd9+0U{ctp7X&%ya|{?
zhdyfe
zOYD-WDv2tJiZyRrJK@{b(psye5yVolZzaOFb`pCniK3`VERhoFdEPny{C+cM=FD%-
znREU)=MQGgnUpH_DG8-lHDgtXwjURCI^)uo9fC++@`+opLkw0HNV~_H{riC%X6I)qULQ|
zUET02X#&^@YSGG=3a+M{4@BeNcl>@{OH-s3g7U2!eUx-IJw}t_5hsL8dso^0ET-rBR)sR
z1Jt|zaPf^d2iGDU4|4!PlqlDZaCBFz;_bM3a=2PvJ~r&VZ<{#NIDXNeA8Chh>{imj
zCp-zEh&t9%+}*J~elKe_%)4VHgco
z1Dz$uF3iolY#IS6`HdGF$vYm5(W8_5tM1_RV(8=k!S2_fU&c)qisnyor4Vz1OuY>a
zhA%7b@Kxkd<{zD~i%gRkW4Xv^Mm=D1tcEUOhjxyj=#Y5OY<(v>NmjJQbwM`SWhLf~
z^BDLdAVp^$%aNrQNURx)|APhVc;MOGZVf*7r|{G5UYpYqtj~w9!LA1?+=)54fA$FW
z?Y1-QYozcAGUO#pZh|Y%#`ORp7%WF%%aNP>$yVk!Cb(xKPcpJd?YyS+`9HoQVG3+$
zAp)je(A^Z8GJhLj|C+?W88M`&MH6{|^RJBV_^Tc1ABR2)KF72J3`>Vd5UJ<^^wj)$
zjv-KK01Av8D<%)wM6~^JTI{@#f3WO}e5LUgJ-W$MGi{GF6f@8Jh#g<)+kU!D*(cNZ
z47)X|WOWz;i0ov(`rxXw+zdBN?r&(r7(kAiYjtas+-Dkik{?bYL$1F4wYUV)>Dx{L
ztI)h&#PJ*{8T)LHdEBHwP3hKuzzisgjgw=kOD_}@ee_Nt(Hd&5F0@JcCb5&{7Zbik
z%X_0*6a@k@rD8SNZAXAuD_E0a_J=X9YjRGN-nfjCQT;s8*U(!j;57-8jZ=+hKWp>M
zf3W3$vl-YtixGPBHNYOfA-qsIrOL`<>OHTO1!BS(pm%A&)Q3OcuP3F6PI1&J7sdci
z-_SWA6hN6-^zj0QiNk0xaA5O>%Mkr%7A-0S%Ya}w!Ze5=yJt~1tC*uQ!Rc``+Gqho!xIrfYlkbhDnf&~W@LxyDJ
z7$KEfNCn}a%nFzkmM*)V
zA-CAm37^`e^Q1+ZADBc&0Ll$QG5eK&M~kvMXK1>u0Ih^iXo_-&QIObTibu6WnLIHq
z*O_)*F9C5SMt4EcSEP&~aM14~Qrw#89+@M6RAL&-kA0I7x+s>$*uKlu>zI$vKf<>0
zjABp#M4ritr4#sRn}4@x(0t+I0QU_?%j%rHNy@HkEI~9CQ`i>L8eIh$d{Fd2v+^n
zsiHahdKUW5_%tDzjEd-#wH`4Q-B;!y|5uRc|N60T!&%c%
zJbQ?)^%WHa3?>2GTN|v?B!niEsD*-?Q3z7NVtb*(L$R|!CmElDHXMW;E*F6rt6DwR
zkQZ`RKRSEV?`*ZSor_^we7xv^rv%*CY*N!u&oqqz`KMkaR*go&
z>F2Pe|Z2r$p$uq{K+)GT`)>iWF;WF+|&GoFn&Zg(Kb(C{{A9_UI3}a)v=sunq
zVIGCn<*SWePoKsx&j!qGQm^H9mLfwIHbGahz1bn2de$N{{CRX0I-|kO4EEhz)E27*
zwHf$OWScM9rZUPM{-QOlW+4&QJzNQD8C0`P7X=)I06}yOW@T3ckkUf0Fv>LYnakTL-)&9>5
zfzGKHJ*t9R32-l$mN$7I`_*BRO2up77&97W`zUrLWQ2lerfV6Z?u7+}K8lGgwyPZPuLZD~-sDh4YBLQ%$ugLnTIe
z10T$TPS?3kW&Tt(xy{H2ws2naSm37pKOM$%&u9pJpWd8o0TQJsKuX-Yj%wV;Do~i;
zko7(=f3tF!FQn)F?i;!J!OnxNNYe2*ET+;TZA{f#8xLrtXgW37;gtp>t20G}-E}iS
zN$BmL0T~8cRBJ_JA;Z4v$)<+$MlSPih1O6cty<#BGeH6Q)J>NYfL(2v#uE;z6v
z+C8hbTQ;krinvCXwm9>ud-?FU+~@B4UuEPpx*sqkdZT;9pLb0F`XNCS{Euo0WK9vQ
zfQVHdEs%Gz0Pn1Tp4My2D-q|_d8Fd{tDL|+#~o+xGudv&dc3Z$u_nH8WZT$q(WpEp
zyE4eMEuMD^8lz&ysfl@*ZF<(xK;ZzNM9f(Q?#v#xHm#QLJuN$oq)}c!wMi@|j_v@OKO2^l+Mn>4%v+(yH
zl4!do5?_ol^oaH&t94wXiI%J7it#^*{C3i$wdTJ%jD7$0*Zj1M-0vfI&AAkA|CA8NLhTt01^_4x
zAzL{{$9+|7V?j_?z!9t9m09gMDs0d~i$(OXh5EQRlV)xd)MAz(`N}m)4l!%vA2OgI
zt_@l;${Z6v9<}HsTbC)&(i4tSC@A%
z0Qcv&QR@&Di?gd_y-n-lqLZqzVxj3%2I|A;aYk%>0=YdNK>iP&s)02ps@EJ5_^IzhU$OeH>n9sO&(II(QYT
zH^??mx%=7^^$~Mn^V7xOsdm9%*Qe*&9m;{;o9&_
zSX*$ZjfBXZ#`cy`VqdGHHMfWQlX#$-Xa3LQjAyxXSR;L5z~h{9m^=8PCm>%xa{(H+
z(!2fPUg~=dFAdL)P0Kga2kLM?^O>Nh+w*H&%DPPNbcDaxkFdib#L&;QnVU0*u(2rI
zC)U@w&i1NrE8ptJqYB1aD|OpQ(+AOzxd;>QO-bNgd-&heC1^xlv!!cRRovY2FSTV~
z!-(d0R|wwCPLngFpfCX}XFPMOUs$0rsgreE?oo!Cy7QkJB#s($f^((vm=8>s+s7qy
zr@0j11qCQ=#I}LMobokE2q*e5l{C2B*1<|+?AOdfH0TkYA)-+Q%ky_L+|UiWx-q!ngb6ghph77Q>v1I
zwEIw|0q3kur;dQOjL{yV}WuR!6uNK&Z>;tGpK8p!mwDCyyK#2bfMEebD|@)04X8frhb&@
zr!rgNzxmTSCZPMAji`<2ay~sQ-!Q_`61CLa+MFq6dHYdgwo-mOE43B42S*l!BUiw@
zi|zy>81T10tF?d=-%gAk_$QFD1cx?+e(?Z(@Sy{E|A8#0@$ohnsZ8^weq2{l8nI}`
zxYQ~S<7}OLM)Jb#kq&wK6J2(xmtwGSz-<{IDabc=RvA}O;UQ2SJu0ZTVoMI{!3zy7
zvn^VZ{+p9YMKk~22044VJzi^KI+Y8Jd4f&qS7O?lUy|L+jXg4*CAR-JohR)-pGNloowJM$M_!Kq
zvBj~7KhW!vG#g3~1JXSWrZq5q!YkJ5-%RTv0i~ezIJ%x=!y3{HE${_~)n+zpruzJS
zxyj$6Qs>|QkG{+`ZHSPMjAZR=5-D3IjdpPEiOf$|BayqGMhRZcuk{Nf-l_e#@It%+
zb^nFpyMO(AgmgwsRr2^!&q_n28IO2uteY3&frmvdG$hrY_Je7ERnULk?Rt*g6RO*p
zR2fmDgHmQv9w;viEkxIxiW3qCIZ2-Gq!MhcU-m88;)tCOG<&o63j`nTo@ouSX{00V
z4rlXttva!4NkIBTZfD-&AV#=~>%c3-JxS%tR+1tHo|@#(kivI+k|@rUO7LA*ZIQy>x|b3$w)2qt?uW
z!WXDb<%uF&%pDto^|cqQbR;DRrxB{#hbDf%7o!>l7k=4It2rg@4Vke6v`X|q$W|f5
zoe9!_0fk^8T4JAJ&^P5+1ieulY0{H#!thQ4A7#3lF@_QV=tSF%Ux#7Ln>C8Uwtz7W4r411WvrseV<)kH*6Iq{l?|icIDu{DfwesN%R09crBO~
zwP*#WnWTA*snN#d8k(32I4{Q5zsMvQt(Z
z0hTJ}#5X2M;8htdUj-p(-oRe)a>q}?CmTS?r07GZk-(VpeMWTaM|WVhVditTL%nRu
zuE52ejc`b!*i*LmU*na*hdgA5M0{Ua~6zRALuZ|)7
z2$Ez~AHR44<6l9p>E!C`C>vA6+rT`xXj$oa`>SuglXCOGX0lqbd^-#Z_U%ZfW5Rv~Jgz9Ew=sw>
zRo~eL>#%$E6+RIU5&vR-rT#hIi=BJoB3)A-8-o*d6iVz}d!S@bzES7ua;{ElJuFkD
zjbDGc525^E5mqZ@+hGArv)+|8LJtCJ;Mwu9{(i;)Er4#6^^$Y_Ju+XG`6y$7XIzcA
z{_kMOxwP}MFm_Joeq2HDezp}5Yge=8gvW@pcJ|4psr*N=-@}h%2e|ckw>3bop)+Te
zhm{ULbDegunb3qI3njQX#yq~9K8G4yKJ>pNBlwa8GA(|+escq+LY0rByDN-%P>V!d
zeP6q+I%t{t?_Y%ZGbTQVM*mUEd;nj6w!g8L+!9#9rf<QSgHsS}|U47v;d=hlk-_)#ZjCIYPEr
zKHGl>{IZtO&(;ZolrNU56gYDS(!G_I8qVER_g`a&U&C*;|83VwE&IiHm`c%v{GWoOQJBRr7vKCbB
z3+l-WQLX4FRZ~$Cbfxn1NPAWQOtwYf@rUAT@iq_H@1PiqwWBcmuKa)<_)wyy!!FeafOqd)d3MPnlyJGkKD}Ub=oJUz
z$Jp*FAf_fq(OHZ(0__`HaPGp$qw$|RzjpY)$N{1_0U;7(YLDfZAC2*~sk;QDH9LLX
z>(8c96=`F`K7ZNKkXevy9QqT`EJ#*YymG+bL>0e*R{FR{02hTs;IL
z4tHT&tEL^DI*gkjg*(&)KAynfNgsXonx6KkI({dInWRKZ`vTm|Wa7M-5BEwvWn74V
z-T3qvAZrd0)JSfTBYdCkXS&T^&W5nMV|6mf)L~aN5^{W9x9r5bqA9mOtBK8Z)Sxfy
zz7vZtKQGc;`C~fnua06}+Dt@X+57ocT~pztdvSoOY(fXPH*D8nyfSVHZ&7hZBsNmV
z;$PkOYX{k~=dqZ6t^M>sRDU!G>q6E16)hHfCkk+Kbo)ZD7QNbt1?w7k1+$+OE76#4
zJ8L7|gSp=y;79QIh->-#_VRzo3w4}<)3T_`3UL4kllzWdbzQpwEd9e|K
zKJTNOnLV>Q?lKf_XIKBycI+{s1yO{&cGDBjhS7-2A~(YaaIVPpqBT(I?;{VV;94wM
zA>;FixnpUL4JkfbzM$PsV_Xn`pbH@Kg+^ZY4sO~On2qji3au*K_NX8A7*j8FziHPp
zu5)-D>xuW((;Y_Cg@+b9ro9W4H`&cJsFM|a`$(Ad$SEaClG1e}PuZSeE?5Yb5tsg(
z+?|4l0yu0NC{-&gLq#9qsYzW^sV=C^V6;MZU7U3lc{7(jk-boln`-$`;TgzofIgO`
z?-__XMdDFm5X_o0z{YUb;}BH>T=bNn3Rc-R!(zh;SdNBo0{kuBQn^edO-l998=nY;?^WEsdy>uW^^Jdx@q$XKiFZN?wbJBnP}6rVopVxghT|E+$jMVh)mPLtRTPA$P3gfoAVugj9ypEFBJ+~ezdVCKc7UN
z^AjTkmaaJvg2E!`S1&(9``ExzHPQ-`KdxS>myOvwuRPJ|y}Ovwsr;Zyzv)#6AWB*-
zs=0%tc3Nn?KO{&{G9}LzTI;J=z#a*a@C$3DmD+vGf)=O>jhSm0pU*Erd)cpPk4@|J
zU`~dkvZ?q*PbIqeCxXf=vUT~IrL=R;_I&5F>3^~ru8ifut-92vjI7UL>VZtj&AWA&
zU2%3S;9q?_#3w}gLrwcQPt4D$CF1y*6+25}_U|LMu_5cq6&F@^Fg%^Cxl8PuLMb2W
zYuJz|rrcs?>q0^cyu{7<`#j@0`XLGi4B?D6`R>`cP5S_hZluNq%5LGw@oC0an9IED
z`s2O%fSU`3we0FprtYF^eWo}A#FimlkH7tzSB-F@+OMK@cdlZ;wRi5T&KB%ak6?y}
zq|1<>u!c@?y*Mrb%oAD}X~y75g}c_*RWn4}6CLJnxnH{TWLK*FEaEA`@r_k^p8LfY
zb0=*(Eqx!36#wha@%fxkmAM;r#`MJ>Qe+E@S~s2Z5TV7ds|)LkN`Pu$Zv~{whUE22
zUHJY(hW=a6ZKM;@IVtb4y3Ct0`2k)~HA6PuX)GoMaHuL}!{quhKySYq^9Td7(M<*u
zr-nq|t~5-fCG~68^lc$0OB;P-Pr)vIDiZJ0FV$kVJJgL3A;NkIk)UxvhVr0t+H>J>
zGfrc4g8-Ie&C1RULPA3XK&^wLKPT?@#MLZ&)OYhJ*;jt~4I)A@12FpoDu|P0%*UcX1<(j|
zl&7ax(4S3>ahscbs$_sR6K^-&Sx>!cQ+BE;&S{-8uyhLQA`wZ7uMRAO3-5}nye)^G
zigSwWE=!67=-=?uc$*lQWF-LppB~Ms#$R8SxHFRP4cBoBZ`AgVDN5*CYO#Egao$+!
z;JR6+2yX&ig8sBu#Tq5){7m-Lx?^spN)~|3C)N%KZ*oQ4*rW3hcH&{}f!>T7Fo6no
zr~Ap00#>s#af0uRDpSfiHjC00LlFPdsG@sGeq!8p^QL%mwpZLc-L|xnsO<4C+!FRh
z+JGTIF68KZbV35d5r6Q9J*0xK)A;?gq@|pwo*6%uGt`4i7ULZnC^TaI@XGklbYyrL
z;>Nb!?aJc(lQp}Wu}yOV8qu;BiJ!Eaqy1NNjy0#NXg9naH
z*p0(_dpqg-Gk=Y!ZD{*R&Ju_Rw=Y&x2(NBETMvvfE-HhRAhRf4k=HXHoi~jAyuhpw
z^>pP;EPIYU<+iBuCRI<^HV^twobeEIca(HY995)2j{gYIm`Y-DgW2@Z1Te>64P}>!8nIJ-Z74i
z$K?*{Uun|5dZse5!;2ku-|LF5b5hJwY}^UaFeMMk_bagM+iPh@I`tz@oLkh|Pv$X~
zHmg(kXwK_dqfFNvA<+VVWh&^i%|)|miYMtSZ>`geq(mGN-YWlX49}?UVGd(N)4b@8M|eUao7oWb$pn
z_?N*0{0`K|oI8u{r`IJzd(?z_Br9?`CE#&|}_cQIyjeY{a2LZ@ylm5uArFBw!3Gc!cFt;BTiz8vh8;r!7g~x>}Hi
z@J)q(Yt<(qGZ8#ssLIrzfp2-oLVRc@#2`K$275X~`2jvsmbT2$OW=qc+;%^#A?;Tt
z?4Tv0hmBPk#LQ_-@qRf-p`LbpL|unqr1r#$JQTm{8ZlI3)IGHm(VX!qXQlO1b*6xT
zs?CVHdh`*KuH%$l$V*D3EJb@meG}R^vdmD(VY*t6V&m=n&+3eQbKtpGJFI0W`HQLyC&6TU(*x!i_}HK#K3ON5FVuivn7hV)mRDc)`&eGZ@0MD}
zDlK5GLquQcdws(v#a%|QLyO+
zm4T|p(taOm-lZ>RY;Cb(`f>4Xh`pBeAaz8)gGSszN!XT_-NfF
zS%BpwU7N>a+rl1-DAb$ecrC!$j*fO~bC+vcj8*DpDt%ZERUGBlemCznGrZ$>RO{m%
z#%gEWuh{`*1ZTKi(#(XEBt=HVr_xS_GXf5C4UdIgQhv@a_*Uy
z5PvN0B`zWEX<>rBQ9Z9?%|
z&NX@p^=$h`ykBoW&N&{)Sb;IS@m?pMe{*B|-hd=L>alO768fX{shpcph%g0wJTq9=
z0q$dE(PQOz1r}lc0|=#;6+gG{UHg4x&66&w1vDI5DJHi7-69dX=oMJT)0WOY>A!oF
z?S@)2oS}UH$4>6f7u(*#Sggvw29+b67XsdDARLcEM3h=g5!AHUSjKdnkc&Z`Yd_;$
z9E@fc-&(6Q(vPl^hnkKJDkc;7g1)F6NIa70N7od+9qa70A>E5r=KA(G{TZ(F@fF><
zMI#VUYj_+t@{{nf?$f7{7L$cms|s)G4}x~YLGvzS;`y%chN^9|pMoV``<)b|@!-~8
zjnh{*p}&~wH8iPq;pnle$Tszc5u(2^K+ODePCAHW*HHq?ld>Jvp4D7`HvVjn7towS
zEl&{BnU`IHn&ICi)5pa|rShx?ybeAjCFNh}tc5y+!4xzyRrj0;5?fX)Q-WxhS_x{e
z$_UP(LRCH;t|OTaxO22(EkfLRBzG-Ih>;JgH}yKd1byM|0TUz$tAM@Jj14}~6^KC*
z46CAlm!;)ayJ`=pNU?&~Y@pPt-$&kZwfv591eifL|Ec#s?^obyt+Jo@!r@)$IDRjl
z7rO(R>^=+1m5PwVKWPDK0al0J3iDrer?BTd^A;
zu{bmp#D8mU0Tj3hinJb<&d(S7(DBxfs7ib87mBvgmh>6)k6*#>wjb(EO}iqp(8yFn
zOT$WyAABlT!RS*~^489`zK!;)N&W)Z>&|_eeOqqw5Z@U53mewe$~RHoYYkzvsu3Kf
zi>A3#Mg65f>|_Ulfx+5yWBPb--8N}SljM2vd_BO&B_3vK
zZqR?u-)m^DA5&nk2#X&w!@XGe50g`Q3I}$dCDG=OWdL*VSpJ1AtlPD3yS=b!xcJ1e~c#QPUEM4mgK+
zcfmjGubz`pkZ7sExMid6Sbr41fZ=^)+;P7UhAOq~_r0I5DsFi+4h}~dELMdCOj^7>
gWhSYOwCw^qz>&iH7i>(=9{K-2|JR
+
+
+   
+   
+   FirstBitEA.cpp
+   
+
+
+Back to Lesson 2 - Tutorial
+main page - Algorithm-Based - Component-Based
+page - Programming hints - EO
+documentation
+
    
+
    
+
    
+
    
+FirstBitEA.cpp
    
+Click on the figure to see the corresponding code.
    
+In the code, the colors are meaningfull
    
+The actual code is in boldface and the comment in normal face.
+
    
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
     
+
+
+
+
+
+
    
+//-----------------------------------------------------------------------------
    
+// FirstBitEA.cpp
    
+//-----------------------------------------------------------------------------
    
+//*
    
+// Still an instance of a VERY simple Bitstring Genetic Algorithm 
    
+// (see FirstBitGA.cpp) but now with   Breeder - and Combined Ops
    
+//
    
+//-----------------------------------------------------------------------------
    
+// standard includes
    
+#include <stdexcept>   // runtime_error 
    
+#include <iostream>     // cout
    
+#include <strstream>   // ostrstream, istrstream
    
+// the general include for eo
    
+#include <eo>
    
+    
+
    
+
+
+
+
+
    
+
+#include <ga.h>
    
+//-----------------------------------------------------------------------------
    
+// define your individuals
    
+typedef eoBit<double> Indi;	// A bitstring with fitness double
    
+    
+
    
+
+
+
+
+
    
+
+//-----------------------------------------------------------------------------
    
+// a simple fitness function that computes the number of ones of a bitstring
    
+// Now in a separate file, and declared as binary_value(const vector<bool> &)
    
+#include "binary_value.h"
    
+    
+
    
+
+
+
+
+
    
+
+//-----------------------------------------------------------------------------
    
+void main_function(int argc, char **argv)
    
+{
    
+    
+
    
+
+
+
+
+
    
+
+   const unsigned int SEED = 42;	// seed for random number generator
    
+   const unsigned int T_SIZE = 3; // size for tournament selection
    
+   const unsigned int VEC_SIZE = 8; // Number of bits in genotypes
    
+   const unsigned int POP_SIZE = 20; // Size of population
    
+   const unsigned int MAX_GEN = 500; // Maximum number of generation before STOP
    
+   const float CROSS_RATE = 0.8;	// Crossover rate
    
+   const double P_MUT_PER_BIT = 0.01;	// probability of bit-flip mutation
    
+   const float MUT_RATE = 1.0;	// mutation rate
    
+   // some parameters for chosing among different operators
    
+   const double onePointRate = 0.5;         // rate for 1-pt Xover
    
+   const double twoPointsRate = 0.5;         // rate for 2-pt Xover
    
+   const double URate = 0.5;                       // rate for Uniform Xover
    
+   const double bitFlipRate = 0.5;           // rate for bit-flip mutation
    
+   const double oneBitRate = 0.5;             // rate for one-bit mutation
    
+    
+
    
+
+
+
+
+
    
+
+   //////////////////////////
    
+   //   Random seed
    
+   //////////////////////////
    
+   //reproducible random seed: if you don't change SEED above, 
    
+   // you'll aways get the same result, NOT a random run
    
+   rng.reseed(SEED);
    
+    
+
    
+
+
+
+
+
    
+
+   /////////////////////////////
    
+   // Fitness function
    
+   ////////////////////////////
    
+   // Evaluation: from a plain C++ fn to an EvalFunc Object
    
+   // you need to give the full description of the function
    
+   eoEvalFuncPtr<Indi, double, const vector<bool>& > eval(   binary_value );
    
+    
+
    
+
+
+
+
+
    
+
+   ////////////////////////////////
    
+   // Initilisation of population
    
+   ////////////////////////////////
    
+   // based on eoUniformGenerator class (see utils/eoRndGenerators.h)
    
+   eoUniformGenerator<bool> uGen;
    
+   eoInitFixedLength<Indi> random(VEC_SIZE, uGen);
    
+   // Initialization of the population
    
+   eoPop<Indi> pop(POP_SIZE, random);
    
+   // and evaluate it in one line
    
+   apply<Indi>(eval, pop);	// STL syntax
    
+    
+
    
+
+
+
+
+
    
+
+   // sort pop before printing it!
    
+   pop.sort();
    
+   // Print (sorted) intial population (raw printout)
    
+   cout << "Initial Population" << endl;
    
+   cout << pop;
    
+    
+
    
+
+
+
+
+
    
+
+   /////////////////////////////////////
    
+   // selection and replacement
    
+   ////////////////////////////////////
    
+    
+
    
+
+
+
+
+
    
+
+   // The robust tournament selection
    
+   eoDetTournamentSelect<Indi> selectOne(T_SIZE);             // T_SIZE in [2,POP_SIZE]
    
+
+   // is now encapsulated in a eoSelectPerc (entage)
    
+   eoSelectPerc<Indi> select(selectOne);// by default rate==1
    
+    
+
    
+
+
+
+
+
    
+
+   // And we now have the full slection/replacement - though with 
    
+   // no replacement (== generational replacement) at the moment :-)
    
+   eoNoReplacement<Indi> replace; 
    
+    
+
    
+
+
+
+
+
    
+
+   //////////////////////////////////////
    
+   // The variation operators
    
+   //////////////////////////////////////
    
+    
+
    
+
+
+
+
+
    
+
+   // 1-point crossover for bitstring
    
+   eo1PtBitXover<Indi> xover1;
    
+   // uniform crossover for bitstring
    
+   eoUBitXover<Indi> xoverU;
    
+   // 2-pots xover
    
+   eoNPtsBitXover<Indi> xover2(2);
    
+   // Combine them with relative rates
    
+   eoPropCombinedQuadOp<Indi> xover(xover1, onePointRate);
    
+   xover.add(xoverU, URate);
    
+   xover.add(xover2, twoPointsRate, true);
    
+    
+
    
+
+
+
+
+
    
+
+   
    
+   // standard bit-flip mutation for bitstring
    
+   eoBitMutation<Indi>   mutationBitFlip(P_MUT_PER_BIT);
    
+   // mutate exactly 1 bit per individual
    
+   eoDetBitFlip<Indi> mutationOneBit; 
    
+   // Combine them with relative rates
    
+   eoPropCombinedMonOp<Indi> mutation(mutationBitFlip, bitFlipRate);
    
+   mutation.add(mutationOneBit, oneBitRate, true);
    
+   
    
+
+   // The operators are   encapsulated into an eoTRansform object
    
+   eoSGATransform<Indi> transform(xover, CROSS_RATE, mutation, MUT_RATE);
    
+    
+
    
+
+
+
+
+
    
+
+
+
    
+
+
+
+
+
    
+
+   //////////////////////////////////////
    
+   // termination conditions: use more than one
    
+   /////////////////////////////////////
    
+   // stop after MAX_GEN generations
    
+   eoGenContinue<Indi> genCont(MAX_GEN);
    
+   // do MIN_GEN gen., then stop after STEADY_GEN gen. without improvement
    
+   eoSteadyFitContinue<Indi> steadyCont(MIN_GEN, STEADY_GEN);
    
+   // stop when fitness reaches a target (here VEC_SIZE)
    
+   eoFitContinue<Indi> fitCont(0);
    
+   // do stop when one of the above says so
    
+   eoCombinedContinue<Indi> continuator(genCont);
    
+   continuator.add(steadyCont);
    
+   continuator.add(fitCont);
    
+    
+
    
+
+
+
+
+
    
+
+   /////////////////////////////////////////
    
+   // the algorithm
    
+   ////////////////////////////////////////
    
+   // Easy EA requires 
    
+   // selection, transformation, eval, replacement, and stopping criterion
    
+   eoEasyEA<Indi> gga(continuator, eval, select, transform, replace);
    
+   // Apply algo to pop - that's it!
    
+   gga(pop);
    
+   
    
+    
+
    
+
+
+
+
+
    
+
+   // Print (sorted) intial population
    
+   pop.sort();
    
+   cout << "FINAL Population\n" << pop << endl;
    
+    
+
    
+
+
+
+
+
    
+
+}
    
+// A main that catches the exceptions
    
+int main(int argc, char **argv)
    
+{
    
+#ifdef _MSC_VER
    
+   //   rng.reseed(42);
    
+       int flag = _CrtSetDbgFlag(_CRTDBG_LEAK_CHECK_DF);
    
+         flag |= _CRTDBG_LEAK_CHECK_DF;
    
+       _CrtSetDbgFlag(flag);
    
+//     _CrtSetBreakAlloc(100);
    
+#endif
    
+       try
    
+       {
    
+               main_function(argc, argv);
    
+       }
    
+       catch(exception& e)
    
+       {
    
+               cout << "Exception: " << e.what() << '\n';
    
+       }
    
+       return 1;
    
+}
    
+
    
+
    Back to Lesson 2 - Tutorial
+main page - Algorithm-Based - Component-Based
+page - Programming hints - EO
+documentation
+
    
+
    
+Marc Schoenauer
    
+
    Last
+modified: Sun Nov 19 22:26:27 2000
+
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/FirstBitGA.html b/trunk/paradiseo-eo/tutorial/html/FirstBitGA.html
new file mode 100644
index 000000000..d3012829a
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/FirstBitGA.html
@@ -0,0 +1,312 @@
+
+
+
+   
+   
+   FirstBitGA.html
+
+
+
+Back to Lesson 1 - Tutorial
+main page - Algorithm-Based - Component-Based
+page - Programming hints - EO
+documentation
+
    
+
    
+
    
+
    
+Code for FirstBitGA
    
+Click on the figure to see the corresponding code.
+
    In the code, the colors are meaningfull
+
    The actual code is in boldface and the comment in normal face.
+
    
+
    
+
+
+
+
+
    //-----------------------------------------------------------------------------
+
    // FirstBitGA.cpp
+
    //-----------------------------------------------------------------------------
+
    //*
+
    // An instance of a VERY simple Bitstring
+Genetic Algorithm
+
    //
+
    //-----------------------------------------------------------------------------
+
    // standard includes
+
    #include <stdexcept>  // runtime_error 
+
    #include <iostream>   
+// cout
+
    #include <strstream>  // ostrstream,
+istrstream
+
    // the general include for eo
+
    #include <eo>
    
+
+
+
+
+
+
    #include <ga.h>
    
+//-----------------------------------------------------------------------------
+
    // define your individuals
+
    typedef eoBit<double> Indi;       
+// A bitstring with fitness double
    
+
+
+
+
+
+
    //-----------------------------------------------------------------------------
+
    // a simple fitness function that computes
+the number of ones of a bitstring
+
    //  @param _indi A biststring individual
+
    double binary_value(const
+Indi & _indi)
+
    {
+
     double sum = 0;
+
     for (unsigned i = 0; i < _indi.size();
+i++)
+
         sum += _indi[i];
+
     return sum;
+
    }
    
+
+
+
+
+
+
    //-----------------------------------------------------------------------------
+
    void main_function(int argc, char **argv)
+
    {
    
+
+
+
+
+
+
     // all parameters are hard-coded!
+
     const unsigned int SEED = 42;         
+// seed for random number generator
+
     const unsigned int T_SIZE = 3;       
+// size for tournament selection
+
     const unsigned int VEC_SIZE = 8;   
+// Number of bits in genotypes
+
     const unsigned int POP_SIZE = 20; 
+// Size of population
+
     const unsigned int MAX_GEN = 100; 
+// Maximum number of generation before STOP
+
     const float CROSS_RATE = 0.8;         
+// Crossover rate
+
     const double P_MUT_PER_BIT = 0.01;
+// probability of bit-flip mutation
+
     const float MUT_RATE = 1.0;             
+// mutation rate
    
+
+
+
+
+
+
     //////////////////////////
+
     //  Random seed
+
     //////////////////////////
+
     //reproducible random seed:
+if you don't change SEED above, 
+
     // you'll aways get the same
+result, NOT a random run
+
     rng.reseed(SEED);
    
+
+
+
+
+
+
     /////////////////////////////
+
     // Fitness function
+
     ////////////////////////////
+
     // Evaluation: from a plain
+C++ fn to an EvalFunc Object
+
     eoEvalFuncPtr<Indi> eval( 
+binary_value );
    
+
+
+
+
+
+
     ////////////////////////////////
+
     // Initilisation of population
+
     ////////////////////////////////
+
     // declare the population
+
     eoPop<Indi> pop;
+
     // fill it!
+
     for (unsigned int igeno=0; igeno<POP_SIZE;
+igeno++)
+
         {
+
            
+Indi v;                   
+// void individual, to be filled
+
            
+for (unsigned ivar=0; ivar<VEC_SIZE; ivar++)
+
                
+{
+
                    
+bool r = rng.flip(); // new value, random in {0,1}
+
                    
+v.push_back(r);          //
+append that random value to v
+
                
+}
+
            
+eval(v);                               
+// evaluate it
+
            
+pop.push_back(v);             
+// and put it in the population
+
         }
    
+
+
+
+
+
+
     // sort pop before printing
+it!
+
     pop.sort();
+
     // Print (sorted) intial population
+(raw printout)
+
     cout << "Initial Population"
+<< endl;
+
     cout << pop;
    
+
+
+
+
+
+
     /////////////////////////////////////
+
     // selection and replacement
+
     ////////////////////////////////////
    
+
+
+
+
+
+
     // The robust tournament selection
+
     eoDetTournamentSelect<Indi> select(T_SIZE); 
+// T_SIZE in [2,POP_SIZE]
    
+
+
+
+
+
+
     // The simple GA evolution engine
+uses generational replacement
+
     // so no replacement procedure
+is needed
    
+
+
+
+
+
+
    
+
+
+
+
+
+
     //////////////////////////////////////
+
     // The variation operators
+
     //////////////////////////////////////
    
+
+
+
+
+
+
     // 1-point crossover for bitstring
+
     eo1PtBitXover<Indi> xover;
    
+
+
+
+
+
+
    
+
     // standard bit-flip mutation
+for bitstring
+
     eoBitMutation<Indi>  mutation(P_MUT_PER_BIT);
    
+
+
+
+
+
+
     //////////////////////////////////////
+
     // termination condition
+
     /////////////////////////////////////
+
     // stop after MAX_GEN generations
+
     eoGenContinue<Indi> continuator(MAX_GEN);
+
     
    
+
+
+
+
+
+
     /////////////////////////////////////////
+
     // the algorithm
+
     ////////////////////////////////////////
+
     // standard Generational GA
+requires as parameters
+
     // selection, evaluation, crossover
+and mutation, stopping criterion
+
     eoSGA<Indi> gga(select, xover,
+CROSS_RATE, mutation, MUT_RATE, 
+
                                    
+eval, continuator);
+
     // Apply algo to pop - that's
+it!
+
     gga(pop);
+
     
    
+
+
+
+
+
+
     // Print (sorted) intial population
+
     pop.sort();
+
     cout << "FINAL Population\n"
+<< pop << endl;
    
+
+
+
+
+
+
    }
+
    // A main that catches the exceptions
+
    int main(int argc, char **argv)
+
    {
+
    #ifdef _MSC_VER
+
     //  rng.reseed(42);
+
         int flag = _CrtSetDbgFlag(_CRTDBG_LEAK_CHECK_DF);
+
           flag
+|= _CRTDBG_LEAK_CHECK_DF;
+
         _CrtSetDbgFlag(flag);
+
    //    _CrtSetBreakAlloc(100);
+
    #endif
+
         try
+
         {
+
                
+main_function(argc, argv);
+
         }
+
         catch(exception&
+e)
+
         {
+
                
+cout << "Exception: " << e.what() << '\n';
+
         }
+
         return 1;
+
    }
    
+
+
    Back to Lesson 1 - Tutorial
+main page - Algorithm-Based - Component-Based
+page - Programming hints - EO
+documentation
+
    
+
    
+Marc Schoenauer
    
+
+
    Last modified: Sun Nov
+19 08:31:26 2000
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/FirstRealEA.html b/trunk/paradiseo-eo/tutorial/html/FirstRealEA.html
new file mode 100644
index 000000000..ad60c2c22
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/FirstRealEA.html
@@ -0,0 +1,354 @@
+
+
+
+   
+   
+   FirstRealEA.cpp
+
+
+Back to Lesson 2 - Tutorial
+main page - Algorithm-Based - Component-Based
+page - Programming hints - EO
+documentation
+
    
+
    
+
    
+
    
+FirstRealEA.cpp
    
+Click on the figure to see the corresponding code.
+
    In the code, the colors are meaningfull
+
    The actual code is in boldface and the comment in normal face.
+
    
+
    
+
+
+
+
+
    //-----------------------------------------------------------------------------
+
    // FirstRealEA.cpp
+
    //-----------------------------------------------------------------------------
+
    //*
+
    // Still an instance of a VERY simple Real-coded 
+Genetic Algorithm 
+
    // (see FirstBitGA.cpp) but now with 
+Breeder - and Combined Ops
+
    //
+
    //-----------------------------------------------------------------------------
+
    // standard includes
+
    #include <stdexcept>  // runtime_error 
+
    #include <iostream>   
+// cout
+
    #include <strstream>  // ostrstream,
+istrstream
+
    // the general include for eo
+
    #include <eo>
    
+
+
+
+
+
+
    #include <es.h>
    
+//-----------------------------------------------------------------------------
+
    // define your individuals
+
    typedef eoReal<double> Indi; 
    
+
+
+
+
+
+
    //-----------------------------------------------------------------------------
+
    // a simple fitness function that computes
+the euclidian norm of a real vector
+
    // Now in a separate file, and declared as
+binary_value(const vector<bool> &)
+
    #include "real_value.h"
    
+
+
+
+
+
+
    //-----------------------------------------------------------------------------
+
    void main_function(int argc, char **argv)
+
    {
    
+
+
+
+
+
+
     const unsigned int SEED = 42; //
+seed for random number generator
+
     const unsigned int T_SIZE = 3; //
+size for tournament selection
+
     const unsigned int VEC_SIZE = 8;
+// Number of object variables in genotypes
+
     const unsigned int POP_SIZE = 20;
+// Size of population
+
     const unsigned int MAX_GEN = 500;
+// Maximum number of generation before STOP
+
     const unsigned int MIN_GEN = 10; 
+// Minimum number of generation before ...
+
     const unsigned int STEADY_GEN =
+50; // stop after STEADY_GEN gen. without improvelent
+
     const float P_CROSS = 0.8; //
+Crossover probability
+
     const float P_MUT = 0.5; //
+mutation probability
+
     const double EPSILON = 0.01; //
+range for real uniform mutation
+
           double
+SIGMA = 0.3;        // std dev.
+for normal mutation
+
     // some parameters for chosing
+among different operators
+
     const double hypercubeRate = 0.5;   
+// relative weight for hypercube Xover
+
     const double segmentRate = 0.5;
+// relative weight for segment Xover
+
     const double uniformMutRate = 0.5;
+// relative weight for uniform mutation
+
     const double detMutRate = 0.5;    
+// relative weight for det-uniform mutation
+
     const double normalMutRate = 0.5; 
+// relative weight for normal mutation
    
+
+
+
+
+
+
     //////////////////////////
+
     //  Random seed
+
     //////////////////////////
+
     //reproducible random seed:
+if you don't change SEED above, 
+
     // you'll aways get the same
+result, NOT a random run
+
     rng.reseed(SEED);
    
+
+
+
+
+
+
     /////////////////////////////
+
     // Fitness function
+
     ////////////////////////////
+
     // Evaluation: from a plain
+C++ fn to an EvalFunc Object
+
     // you need to give the full
+description of the function
+
     eoEvalFuncPtr<Indi, double, const
+vector<double>& > eval(  real_value );
    
+
+
+
+
+
+
     ////////////////////////////////
+
     // Initilisation of population
+
     ////////////////////////////////
+
     // based on a uniform generator
+
     eoInitFixedLength<Indi, uniform_generator<double>
+>
+
            
+random(VEC_SIZE, uniform_generator<double>(-1.0, 1.0));
+
       // Initialization of
+the population
+
     eoPop<Indi> pop(POP_SIZE, random);
+
     // and evaluate it in one loop
+
     apply<Indi>(eval, pop); //
+STL syntax
    
+
+
+
+
+
+
     // sort pop before printing
+it!
+
     pop.sort();
+
     // Print (sorted) intial population
+(raw printout)
+
     cout << "Initial Population"
+<< endl;
+
     cout << pop;
    
+
+
+
+
+
+
     /////////////////////////////////////
+
     // selection and replacement
+
     ////////////////////////////////////
    
+
+
+
+
+
+
     // The robust tournament selection
+
     eoDetTournamentSelect<Indi> selectOne(T_SIZE);
+
     //
+is now encapsulated in a eoSelectPerc (entage)
+
     eoSelectPerc<Indi> select(selectOne);//
+by default rate==1
    
+
+
+
+
+
+
     // And we now have the full
+slection/replacement - though with 
+
     // no replacement (== generational
+replacement) at the moment :-)
+
     eoNoReplacement<Indi> replace; 
    
+
+
+
+
+
+
     //////////////////////////////////////
+
     // The variation operators
+
     //////////////////////////////////////
    
+
+
+
+
+
+
     // uniform chooce on segment
+made by the parents
+
     eoSegmentCrossover<Indi> xoverS;
+
     // uniform choice in hypercube
+built by the parents
+
     eoHypercubeCrossover<Indi> xoverA;
+
     // Combine them with relative
+weights
+
     eoPropCombinedQuadOp<Indi> xover(xoverS,
+segmentRate);
+
     xover.add(xoverA, hypercubeRate,
+true);
    
+
+
+
+
+
+
    
+
     // offspring(i) uniformly chosen
+in [parent(i)-epsilon, parent(i)+epsilon]
+
     eoUniformMutation<Indi> 
+mutationU(EPSILON); 
+
     // k (=1) coordinates of parents
+are uniformly modified
+
     eoDetUniformMutation<Indi> 
+mutationD(EPSILON); 
+
     // all coordinates of parents are normally
+modified (stDev SIGMA)
+
     eoNormalMutation<Indi> 
+mutationN(SIGMA); 
+
     // Combine them with relative
+weights
+
     eoPropCombinedMonOp<Indi> mutation(mutationU,
+uniformMutRate);
+
     mutation.add(mutationD, detMutRate);
+
     mutation.add(mutationN, normalMutRate,
+true);
+
     // The operators are  encapsulated
+into an eoTRansform object
+
     eoSGATransform<Indi> transform(xover,
+P_CROSS, mutation, P_MUT);
    
+
+
+
+
+
+
    
+
+
+
+
+
+
     //////////////////////////////////////
+
     // termination conditions: use
+more than one
+
     /////////////////////////////////////
+
     // stop after MAX_GEN generations
+
     eoGenContinue<Indi> genCont(MAX_GEN);
+
     // do MIN_GEN gen., then stop
+after STEADY_GEN gen. without improvement
+
     eoSteadyFitContinue<Indi> steadyCont(MIN_GEN,
+STEADY_GEN);
+
     // stop when fitness reaches
+a target (here VEC_SIZE)
+
     eoFitContinue<Indi> fitCont(0);
+
     // do stop when one of the above
+says so
+
     eoCombinedContinue<Indi> continuator(genCont);
+
     continuator.add(steadyCont);
+
     continuator.add(fitCont);
    
+
+
+
+
+
+
     /////////////////////////////////////////
+
     // the algorithm
+
     ////////////////////////////////////////
+
     // Easy EA requires 
+
     // selection, transformation,
+eval, replacement, and stopping criterion
+
     eoEasyEA<Indi> gga(continuator,
+eval, select, transform, replace);
+
     // Apply algo to pop - that's
+it!
+
     cout << "\n             
+Here we go\n\n";
+
     gga(pop);
+
     
    
+
+
+
+
+
+
     // Print (sorted) intial population
+
     pop.sort();
+
     cout << "FINAL Population\n"
+<< pop << endl;
    
+
+
+
+
+
+
    }
+
    // A main that catches the exceptions
+
    int main(int argc, char **argv)
+
    {
+
    #ifdef _MSC_VER
+
     //  rng.reseed(42);
+
         int flag = _CrtSetDbgFlag(_CRTDBG_LEAK_CHECK_DF);
+
           flag
+|= _CRTDBG_LEAK_CHECK_DF;
+
         _CrtSetDbgFlag(flag);
+
    //    _CrtSetBreakAlloc(100);
+
    #endif
+
         try
+
         {
+
                
+main_function(argc, argv);
+
         }
+
         catch(exception&
+e)
+
         {
+
                
+cout << "Exception: " << e.what() << '\n';
+
         }
+
         return 1;
+
    }
    
+
+
    Back to Lesson 2 - Tutorial
+main page - Algorithm-Based - Component-Based
+page - Programming hints - EO
+documentation
+
    
+
    
+Marc Schoenauer
    
+
+
    Last modified: Wed Nov
+29 07:38:36 2000
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/FirstRealGA.html b/trunk/paradiseo-eo/tutorial/html/FirstRealGA.html
new file mode 100644
index 000000000..f228adfac
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/FirstRealGA.html
@@ -0,0 +1,350 @@
+
+
+
+   
+   
+   FirstRealGA.html
+   
+
+
+Back to Lesson 1 - Tutorial
+main page - Algorithm-Based - Component-Based
+page - Programming hints - EO
+documentation
+
    
+
    
+
    
+
    
+Code for FirstRealGA
    
+Click on the figure to see the corresponding code.
    
+In the code, the colors are meaningfull
    
+The actual code is in boldface and the comment in normal face.
+
    
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
     
+
+
+
+
+
+
    
+//-----------------------------------------------------------------------------
    
+// FirstRealGA.cpp
    
+//-----------------------------------------------------------------------------
    
+//*
    
+// An instance of a VERY simple Real-coded Genetic Algorithm
    
+//
    
+//-----------------------------------------------------------------------------
    
+// standard includes
    
+#include <stdexcept>   // runtime_error 
    
+#include <iostream>     // cout
    
+#include <strstream>   // ostrstream, istrstream
    
+// the general include for eo
    
+#include <eo>
    
+    
+
    
+
+
+
+
+
    
+
+#include <es.h>
    
+//-----------------------------------------------------------------------------
    
+// define your individuals
    
+ typedef eoReal<double> Indi;
    
+    
+
    
+
+
+
+
+
    
+
+//-----------------------------------------------------------------------------
    
+// a simple fitness function that computes the euclidian norm of a real vector
    
+//       @param _indi A real-valued individual 
    
+
+double real_value(const Indi & _indi)
    
+{
    
+   double sum = 0;
    
+   for (unsigned i = 0; i < _indi.size(); i++)
    
+           sum += _indi[i]*_indi[i];
    
+   return (-sum);                       // maximizing only
    
+}
    
+    
+
    
+
+
+
+
+
    
+
+//-----------------------------------------------------------------------------
    
+void main_function(int argc, char **argv)
    
+{
    
+    
+
    
+
+
+
+
+
    
+
+   // all parameters are hard-coded!
    
+   const unsigned int SEED = 42; // seed for random number generator
    
+   const unsigned int VEC_SIZE = 8; // Number of object variables in genotypes
    
+   const unsigned int POP_SIZE = 20; // Size of population
    
+   const unsigned int T_SIZE = 3; // size for tournament selection
    
+   const unsigned int MAX_GEN = 500; // Maximum number of generation before STOP
    
+   const float CROSS_RATE = 0.8; // Crossover rate
    
+   const double EPSILON = 0.01;   // range for real uniform mutation
    
+   const float MUT_RATE = 0.5;     // mutation rate
    
+    
+
    
+
+
+
+
+
    
+
+
+   //////////////////////////
    
+   //   Random seed
    
+   //////////////////////////
    
+   //reproducible random seed: if you don't change SEED above, 
    
+   // you'll aways get the same result, NOT a random run
    
+   rng.reseed(SEED);
    
+    
+
    
+
+
+
+
+
    
+
+   /////////////////////////////
    
+   // Fitness function
    
+   ////////////////////////////
    
+   // Evaluation: from a plain C++ fn to an EvalFunc Object
    
+   eoEvalFuncPtr<Indi> eval(   real_value );
    
+    
+
    
+
+
+
+
+
    
+
+   ////////////////////////////////
    
+   // Initilisation of population
    
+   ////////////////////////////////
    
+   // declare the population
    
+   eoPop<Indi> pop;
    
+   // fill it!
    
+   for (unsigned int igeno=0; igeno<POP_SIZE; igeno++)
    
+       {
    
+           Indi v;                   // void individual, to be filled
    
+           for (unsigned ivar=0; ivar<VEC_SIZE; ivar++)
    
+               {
    
+                   double r = 2*rng.uniform() - 1; // new value, random in [-1,1)
    
+                   v.push_back(r);             // append that random value to v
    
+               }
    
+           eval(v);                                   // evaluate it
    
+           pop.push_back(v);                 // and put it in the population
    
+       }
    
+    
+
    
+
+
+
+
+
    
+
+   // sort pop before printing it!
    
+   pop.sort();
    
+   // Print (sorted) intial population (raw printout)
    
+   cout << "Initial Population" << endl;
    
+   cout << pop;
    
+    
+
    
+
+
+
+
+
    
+
+   /////////////////////////////////////
    
+   // selection and replacement
    
+   ////////////////////////////////////
    
+    
+
    
+
+
+
+
+
    
+
+   // The robust tournament selection
    
+   eoDetTournamentSelect<Indi> select(T_SIZE);             // T_SIZE in [2,POP_SIZE]
    
+    
+
    
+
+
+
+
+
    
+
+   // eoSGA uses generational replacement by default
    
+   // so no replacement procedure has to be given
    
+    
+
    
+
+
+
+
+
    
+
+
+
    
+
+
+
+
+
    
+
+   //////////////////////////////////////
    
+   // termination condition
    
+   /////////////////////////////////////
    
+   // stop after MAX_GEN generations
    
+   eoGenContinue<Indi> continuator(MAX_GEN);
    
+   
    
+    
+
    
+
+
+
+
+
    
+
+   //////////////////////////////////////
    
+   // The variation operators
    
+   //////////////////////////////////////
    
+    
+
    
+
+
+
+
+
    
+
+   // offspring(i) uniformly chosen in [parent(i)-epsilon, parent(i)+epsilon]
    
+   eoUniformMutation<Indi>   mutation(EPSILON); 
    
+    
+
    
+
+
+
+
+
    
+
+   // offspring(i) is a linear combination of parent(i)
    
+   eoSegmentCrossover<Indi> xover;
    
+    
+
    
+
+
+
+
+
    
+
+   /////////////////////////////////////////
    
+   // the algorithm
    
+   ////////////////////////////////////////
    
+   // standard Generational GA requires
    
+   // selection, evaluation, crossover and mutation, stopping criterion
    
+ 
    
+   eoSGA<Indi> gga(select, xover, CROSS_RATE, mutation, MUT_RATE, 
    
+                                     eval, continuator);
    
+   // Apply algo to pop - that's it!
    
+   gga(pop);
    
+   
    
+    
+
    
+
+
+
+
+
    
+
+   // Print (sorted) intial population
    
+   pop.sort();
    
+   cout << "FINAL Population\n" << pop << endl;
    
+    
+
    
+
+
+
+
+
    
+
+}
    
+// A main that catches the exceptions
    
+int main(int argc, char **argv)
    
+{
    
+#ifdef _MSC_VER
    
+   //   rng.reseed(42);
    
+       int flag = _CrtSetDbgFlag(_CRTDBG_LEAK_CHECK_DF);
    
+         flag |= _CRTDBG_LEAK_CHECK_DF;
    
+       _CrtSetDbgFlag(flag);
    
+//     _CrtSetBreakAlloc(100);
    
+#endif
    
+       try
    
+       {
    
+               main_function(argc, argv);
    
+       }
    
+       catch(exception& e)
    
+       {
    
+               cout << "Exception: " << e.what() << '\n';
    
+       }
    
+       return 1;
    
+}
    
+
    
+
    Back to Lesson 1 - Tutorial
+main page - Algorithm-Based - Component-Based
+page - Programming hints - EO
+documentation
+
    
+
    
+Marc Schoenauer
    
+
    Last
+modified: Sun Nov 19 08:31:29 2000
+
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/Firstmerge.html b/trunk/paradiseo-eo/tutorial/html/Firstmerge.html
new file mode 100644
index 000000000..2c4e7b9c5
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/Firstmerge.html
@@ -0,0 +1,286 @@
+
+
+
+   
+   
+   Differences
+
+
+Back to Lesson 1 -
+Tutorial
+main page -
+Algorithm-Based - Component-Based
+page - Programming hints - EO
+documentation
+
    
+
    
+
    
+
    
+FirstBitGA and FirstRealGA: differences
    
+Below is a comparison of the codes for both algorithms (comments have been
+removed).
+
    Warning: the pink
+background here denotes the differences, not the section  of
+the algorithm, which is only recalled by the color of the text!
+
    These differences are limited to
+
      
+
    • 
+the declaration of the type of the genotypes,
      • 
+
+
    • 
+the fitness function (what did you expect
+:-),
      • 
+
+
    • 
+the initialization (and if you look carefully,
+you'll find out that only a small part of the initialization is different,
+as both genotypes are eoFixedLength objects) and of course
      • 
+
+
    • 
+the choice of variation operators (including
+the parameter for the mutation).
      • 
+
    
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    #include
+<stdexcept >
+
    #include <iostream>
+
    #include <strstream>
+
    #include <eo>    		#include
+<stdexcept >
+
    #include <iostream>
+
    #include <strstream>
+
    #include <eo>
    #include <es.h>
     
+typedef eoReal<double> Indi;    		#include <ga.h>
     
+typedef eoBit<double> Indi;
    double
+real_value(const Indi & _indi)
+
    {
+
      double
+sum = 0;
+
      for (unsigned
+i = 0; i < _indi.size(); i++)
+
         
+sum += _indi[i]*_indi[i];
+
      return
+(-sum);   // maximizing
+
    }    		double
+binary_value(const Indi & _indi)
+
    {
+
      double
+sum = 0;
+
      for (unsigned
+i = 0; i < _indi.size(); i++)
+
         
+sum += _indi[i];
+
      return
+(sum);
+
    }
    void
+main_function(int argc, char **argv)
+
    {
+
    const unsigned
+int SEED = 42;
+
    const unsigned
+int VEC_SIZE = 8;
+
    const unsigned
+int POP_SIZE = 20;
+
    const unsigned
+int T_SIZE = 3;
+
    const unsigned
+int MAX_GEN = 500;
+
    const float
+CROSS_RATE = 0.8;
+
    const float
+MUT_RATE = 0.5;    		void
+main_function(int argc, char **argv)
+
    {
+
    const unsigned
+int SEED = 42;
+
    const unsigned
+int VEC_SIZE = 8;
+
    const unsigned
+int POP_SIZE = 20;
+
    const unsigned
+int T_SIZE = 3;
+
    const unsigned
+int MAX_GEN = 500;
+
    const float
+CROSS_RATE = 0.8;
+
    const float
+MUT_RATE = 0.5;
    const
+double EPSILON = 0.01;const
+double P_MUT_PER_BIT = 0.01;
    eoEvalFuncPtr<Indi>
+eval(real_value);eoEvalFuncPtr<Indi>
+eval(binary_value);
    eoPop<Indi>
+pop;
+
    for (unsigned
+int igeno=0; igeno<POP_SIZE; igeno++)
+
      {
+
       
+Indi v;
+
       
+for (unsigned ivar=0; ivar<VEC_SIZE; ivar++)
+
         
+{    		eoPop<Indi>
+pop;
+
    for (unsigned
+int igeno=0; igeno<POP_SIZE; igeno++)
+
      {
+
       
+Indi v;
+
       
+for (unsigned ivar=0; ivar<VEC_SIZE; ivar++)
+
         
+{
           
+double r = 2*rng.uniform() - 1;       
+bool r = rng.flip(); 
           
+v.push_back(r); //
+
         
+}
+
       
+eval(v);
+
       
+pop.push_back(v);
+
      }
+
    pop.sort();
+
    cout <<
+"Initial Population" << endl;
+
    cout <<
+pop;
+
    eoDetTournament<Indi>
+select(T_SIZE);
+
    eoGenContinue<Indi>
+continuator(MAX_GEN);    		       
+v.push_back(r); //
+
         
+}
+
       
+eval(v);
+
       
+pop.push_back(v);
+
      }
+
    pop.sort();
+
    cout <<
+"Initial Population" << endl;
+
    cout <<
+pop;
+
    eoDetTournament<Indi>
+select(T_SIZE);
+
    eoGenContinue<Indi>
+continuator(MAX_GEN);
    eoUniformMutation<Indi> 
+mutation(EPSILON);
+
    eoSegmentCrossover<Indi>
+xover;    		eoBitMutation<Indi> 
+mutation(P_MUT_PER_BIT);
+
    eo1PtBitXover<Indi>
+xover;
    
+eoSGA<Indi>
+gga(select, xover, CROSS_RATE,
+
                   
+mutation, MUT_RATE, eval, continuator);
+
    gga(pop);
+
    pop.sort();
+
    cout <<
+"FINAL Population\n" << pop << endl;
+
    }
+
    int main(int
+argc, char **argv)
+
    {
+
    ... [technical
+code removed]
+
    }    		
+eoSGA<Indi>
+gga(select, xover, CROSS_RATE,
+
                   
+mutation, MUT_RATE, eval, continuator);
+
    gga(pop);
+
    pop.sort();
+
    cout <<
+"FINAL Population\n" << pop << endl;
+
    }
+
    int main(int
+argc, char **argv)
+
    {
+
    [... technical
+code removed ]
+
    }
    
+
+
    Back to Lesson 1 -
+Tutorial
+main page -
+Algorithm-Based - Component-Based
+page - Programming hints - EO
+documentation
+
    
+
    
+
    
+Marc Schoenauer
    
+
+
    Last
+modified: Tue Nov 7 07:49:47 CET 2000
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/NoWay.html b/trunk/paradiseo-eo/tutorial/html/NoWay.html
new file mode 100644
index 000000000..74d7204cc
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/NoWay.html
@@ -0,0 +1,77 @@
+
+
+
+   
+   
+   Tutorial: Solutions
+
+
+Tutorial main page -
+Algorithm-Based
+- Component-Based - Programming
+hints -EO
+documentation
+
    
+
    
+
    
+
    
+Tutorial:
    
+
+
    Solutions of exercises
    
+
+
    No, we won't
+provide
+any
+hypertext link directly to the correct code, so you get a chance
+to find out the solution by yourself without immediately going there 
+:-)))
+
    What you should do:
+
      
+
    • 
+copy the code of an example onto another name (e.g. mytest.cpp)
      • 
+
+
    • 
+edit and modify mytest.cpp
+according to the corresponding instructions of the exercise
      • 
+
+
    • 
+compile mytest.cpp by typing
+make
+mytest at system prompt, and you will hopefully get an
+executable file named mytest
+(for Unix systems: if eventually someone tells me how to do that in Windows,
+apart that you'll probably end up with an executable file named mytest.exe...).
      • 
+
    
+
+
    
+
    What you may do later:
+
    All solutions to exercises are in the same
+sub-dir of the Tutorial directory than the example files (i.e.
+Lesson1 for Lesson1, yes!) and are named exerciseN.p.cpp
+where N is the lesson number and p the exercise number. Hence you may browse
+through the code, eventually modifying it, and then simply type, in the
+corresponding directory,
+
    ... % make exerciseN.p
+
    which will compile file exerciseN.p.cpp
+into executable exerciseN.p
+(for Unix systems: if eventually someone tells me how to do that in Windows,
+you'll probably end up with an executable file named exerciseN.p.exe).
+
    
+
    
+
    What you may not do:
+
    Complain that it does not work under Windows :-)
    
+
+
    Tutorial main page -
+Algorithm-Based
+- Component-Based - Programming
+hints - EO
+documentation
+
    
+
    
+
    
+Marc Schoenauer
    
+
+
    Last
+modified: Fri Nov 3 18:49:12 CET 2000
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/OneMaxEA.html b/trunk/paradiseo-eo/tutorial/html/OneMaxEA.html
new file mode 100644
index 000000000..47102a452
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/OneMaxEA.html
@@ -0,0 +1,360 @@
+
+
+
+   
+   
+   Templates/OneMaxEA.cpp
+
+
+Back to Lesson 5 - Tutorial
+main page - Top-Down page - Bottom-up
+page - Programming hints - EO
+documentation
+
    
+
    
+
    
+
    
+Templates/OneMaxEA.cpp
    
+The places where you have to put some code are on pink
+background.. Only the the character
+colors have the usual meaning.
+
    
+
+
+
+
+
    /** -*- mode: c++; c-indent-level:
+4; c++-member-init-indent: 8; comment-column: 35; -*-
+
    The above line is usefulin Emacs-like editors
+
    */
+
    /*
+
    Template for creating a new representation
+in EO
+
    ================================================
+
    This is the template main file.
+
    It includes all other files that have been
+generated by the script create.sh
+
    so it is the only file to compile.
+
    In case you want to build up a separate library
+for your new Evolving Object,
+
    you'll need some work - follow what's done
+in the src/ga dir, used in the
+
    main file BitEA in tutorial/Lesson4 dir.
+
    Or you can wait until we do it :-)
+
    */
+
    // Miscilaneous include and declaration 
+
    #include <iostream>
+
    using namespace std;
+
    // eo general include
+
    #include "eo"
+
    // the real bounds (not yet in general eo
+include)
+
    #include "utils/eoRealVectorBounds.h"
+
    // include here whatever specific files for
+your representation
+
    // Basically, this should include at least
+the following
+
    /** definition of representation: 
+
    * class eoOneMax MUST derive from EO<FitT>
+for some fitness
+
    */
    
+
+
+
+
+
+
    #include "eoOneMax.h"
+
    /** definition of initilizqtion: 
+
    * class eoOneMaxInit MUST derive from eoInit<eoOneMax>
+
    */
    
+
+
+
+
+
+
    #include "eoOneMaxInit.h"
+
    /** definition of evaluation: 
+
    * class eoOneMaxEvalFunc MUST derive from
+eoEvalFunc<eoOneMax>
+
    * and should test for validity before doing
+any computation
+
    * see tutorial/Templates/evalFunc.tmpl
+
    */
    
+
+
+
+
+
+
    #include "eoOneMaxEvalFunc.h"
+
    // GENOTYPE    eoOneMax ***MUST***
+be templatized over the fitness
    
+
+
+
+
+
+
    // START fitness type: double or eoMaximizingFitness
+if you are maximizing
+
    //                                       
+eoMinimizingFitness if you are minimizing
+
    typedef eoMinimizingFitness MyFitT ; //
+type of fitness 
+
    // END fitness type
    
+
+
+
+
+
+
    
+
+
+
+
+
+
    // Then define your EO objects using that
+fitness type
+
    typedef eoOneMax<MyFitT> Indi;          
+// ***MUST*** derive from EO 
    
+
+
+
+
+
+
    // create an initializer
+
    #include "make_genotype_OneMax.h"
+
    eoInit<Indi> & make_genotype(eoParser&
+_parser, eoState&_state, Indi _eo)
+
    {
+
     return do_make_genotype(_parser,
+_state, _eo);
+
    } 
    
+
+
+
+
+
+
    // and the variation operaotrs
+
    #include "make_op_OneMax.h"
+
    eoGenOp<Indi>&  make_op(eoParser&
+_parser, eoState& _state, eoInit<Indi>& _init)
+
    {
+
     return do_make_op(_parser, _state,
+_init);
+
    }
    
+
+
+
+
+
+
    // Use existing modules to define representation
+independent routines
+
    // These are parser-based definitions of
+objects
+
    // how to initialize the population 
+
    // it IS representation independent if an
+eoInit is given
+
    #include <do/make_pop.h>
+
    eoPop<Indi >&  make_pop(eoParser&
+_parser, eoState& _state, eoInit<Indi> & _init)
+
    {
+
     return do_make_pop(_parser, _state,
+_init);
+
    }
    
+
+
+
+
+
+
    // the stopping criterion
+
    #include <do/make_continue.h>
+
    eoContinue<Indi>& make_continue(eoParser&
+_parser, eoState& _state, eoEvalFuncCounter<Indi> & _eval)
+
    {
+
     return do_make_continue(_parser,
+_state, _eval);
+
    }
    
+
+
+
+
+
+
    // outputs (stats, population dumps, ...)
+
    #include <do/make_checkpoint.h>
+
    eoCheckPoint<Indi>& make_checkpoint(eoParser&
+_parser, eoState& _state, eoEvalFuncCounter<Indi>& _eval, eoContinue<Indi>&
+_continue) 
+
    {
+
     return do_make_checkpoint(_parser,
+_state, _eval, _continue);
+
    }
    
+
+
+
+
+
+
    // evolution engine (selection and replacement)
+
    #include <do/make_algo_scalar.h>
+
    eoAlgo<Indi>&  make_algo_scalar(eoParser&
+_parser, eoState& _state, eoEvalFunc<Indi>& _eval, eoContinue<Indi>&
+_continue, eoGenOp<Indi>& _op)
+
    {
+
     return do_make_algo_scalar(_parser,
+_state, _eval, _continue, _op);
+
    }
    
+
+
+
+
+
+
    // simple call to the algo. stays there for
+consistency reasons 
+
    // no template for that one
+
    #include <do/make_run.h>
+
    // the instanciating fitnesses
+
    #include <eoScalarFitness.h>
+
    void run_ea(eoAlgo<Indi>& _ga,
+eoPop<Indi>& _pop)
+
    {
+
     do_run(_ga, _pop);
+
    }
+
    // checks for help demand, and writes the
+status file
+
    // and make_help; in libutils
+
    void make_help(eoParser & _parser);
+
    // now use all of the above, + representation
+dependent things
+
    int main(int argc, char* argv[])
+
    {
+
     try
+
     {
+
     eoParser parser(argc, argv);  
+// for user-parameter reading
+
     eoState state;      
+// keeps all things allocated
    
+
+
+
+
+
+
          //
+The fitness
+
          //////////////
+
       eoOneMaxEvalFunc<Indi>
+plainEval /* (varType  _anyVariable) */;;
+
        // turn that object
+into an evaluation counter
+
       eoEvalFuncCounter<Indi>
+eval(plainEval);
    
+
+
+
+
+
+
      // the genotype - through a
+genotype initializer
+
     eoInit<Indi>& init = make_genotype(parser,
+state, Indi());
    
+
+
+
+
+
+
      // Build the variation operator
+(any seq/prop construct)
+
     eoGenOp<Indi>& op = make_op(parser,
+state, init);
+
      //// Now the representation-independent
+things 
+
      //
+
      // YOU SHOULD NOT NEED TO MODIFY
+ANYTHING BEYOND THIS POINT
+
      // unless you want to add specific
+statistics to the checkpoint
+
      //////////////////////////////////////////////
    
+
+
+
+
+
+
      // initialize the population
+
      // yes, this is representation
+indepedent once you have an eoInit
+
     eoPop<Indi>& pop   
+= make_pop(parser, state, init);
    
+
+
+
+
+
+
      // stopping criteria
+
     eoContinue<Indi> & term =
+make_continue(parser, state, eval);
    
+
+
+
+
+
+
      // output
+
     eoCheckPoint<Indi> & checkpoint
+= make_checkpoint(parser, state, eval, term);
    
+
+
+
+
+
+
      // algorithm (need the operator!)
+
     eoAlgo<Indi>& ga = make_algo_scalar(parser,
+state, eval, checkpoint, op);
+
      ///// End of construction of
+the algorithm
+
      /////////////////////////////////////////
+
      // to be called AFTER all parameters
+have been read!!!
+
     make_help(parser);
+
      //// GO
+
      ///////
    
+
+
+
+
+
+
      // evaluate intial population
+AFTER help and status in case it takes time
+
     apply<Indi>(eval, pop);
+
      // if you want to print it
+out
+
    //    cout << "Initial
+Population\n";
+
    //    pop.sortedPrintOn(cout);
+
    //    cout << endl;
    
+
+
+
+
+
+
     run_ea(ga, pop); // run the
+ga
+
     cout << "Final Population\n";
+
     pop.sortedPrintOn(cout);
+
     cout << endl;
+
     }
+
     catch(exception& e)
+
     {
+
         cout <<
+e.what() << endl;
+
     }
+
     return 0;
+
    }
    
+
+
    Back to Lesson 5 - Tutorial
+main page - Top-Down page - Bottom-up
+page - Programming hints - EO
+documentation
+
    
+
    
+Marc Schoenauer
    
+
+
    Last modified: Sat May
+4 07:37:41 2002
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/SecondBitEA.html b/trunk/paradiseo-eo/tutorial/html/SecondBitEA.html
new file mode 100644
index 000000000..ea043f026
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/SecondBitEA.html
@@ -0,0 +1,569 @@
+
+
+
+   
+   
+   SecondBitEA.cpp
+
+
+
+Back to Lesson 3 - Tutorial
+main page - Algorithm-Based - Component-Based
+-
+Programming
+hints - EO
+documentation
+
    
+
    
+
    
+
    
+SecondBitEA.cpp
    
+Click on the figure to see the corresponding code.
+
    In the code, the colors are meaningfull
+
    The actual code is in boldface and the comment in normal face.
+
    For this particular program, as all new lines are concerned with program
+parameter input and information output, the font
+color for program-parameter-related sections will refer
+to the section where the parameters are used whereas the background
+color will remain blue.
+
    
+
    
+
+
+
+
+
    //-----------------------------------------------------------------------------
+
    // SecondGA.cpp
+
    //-----------------------------------------------------------------------------
+
    //*
+
    // Same code than FirstBitEA as far as Evolutionary
+Computation is concerned
+
    // but now you learn to enter the parameters
+in a more flexible way
+
    // and to twidle the output to your preferences!
+
    //-----------------------------------------------------------------------------
+
    // standard includes
+
    #include <stdexcept>  // runtime_error 
+
    #include <iostream>   //
+cout
+
    #include <strstream>  // ostrstream,
+istrstream
+
    #include <fstream>
+
    // the general include for eo
+
    #include <eo>
    
+
+
+
+
+
+
    // a simple fitness function that computes
+the number of ones of a bitstring
+
    #include "binary_value.h"
    
+
+
+
+
+
+
    //-----------------------------------------------------------------------------
+
    // define your genotype and fitness types
+
    typedef eoBit<double> Indi;
    
+
+
+
+
+
+
    // the main_function: nothing changed(!),
+except variable initialization
+
    void main_function(int argc, char **argv)
+
    {
    
+
+
+
+
+
+
+
+
+
+
    //-----------------------------------------------------------------------------
+
    // instead of having all values of useful
+parameters as constants, read them:
+
    // either on the command line (--option=value
+or -o=value)
+
    //       
+or in a parameter file (same syntax, order independent, 
+
    //                                   
+# = usual comment character 
+
    //       
+or in the environment (TODO)
+
    // First define a parser from the command-line
+arguments
+
    eoParser
+parser(argc, argv);
+
    // For each parameter, define Parameter, read
+it through the parser,
+
    // and assign the value to the variable
+
    
+
    eoValueParam<uint32> seedParam(time(0),
+"seed", "Random number seed", 'S');
+
    parser.processParam(
+seedParam );
+
    unsigned seed
+= seedParam.value();
+
    // decription
+of genotype
+
    eoValueParam<unsigned int>& vecSizeParam(8,
+"vecSize", "Genotype size",'V');
+
    parser.processParam( vecSizeParam, "Representation"
+);
+
    unsigned vecSize = vecSizeParam.value();
+
    // parameters for evolution engine
+
    eoValueParam<unsigned int>& popSizeParam(10,
+"popSize", "Population size",'P');
+
    parser.processParam( popSizeParam, "Evolution
+engine" );
+
    unsigned popSize = popSizeParam.value();
+
    eoValueParam<unsigned int>& tSizeParam(10,
+"tSize", "Tournament size",'T');
+
    parser.processParam( seedParam );
+
    unsigned tSize = tSizeParam.value();
+
    
+
       // init and stop
+
    eoValueParam<string> loadNameParam("",
+"Load","A save file to restart from",'L');
+
    parser.processParam( loadNameParam, "Persistence"
+);
+
    string loadName = loadNameParam.value();
+
    eoValueParam<unsigned int> maxGenParam(100,
+"maxGen", "Maximum number of generations",'G');
+
    parser.processParam( maxGenParam, "Stopping
+criterion" );
+
    unsigned maxGen = maxGenParam.value();
+
    eoValueParam<unsigned int> minGenParam(100,
+"minGen", "Minimum number of generations",'g');
+
    parser.processParam( minGenParam, "Stopping
+criterion" );
+
    unsigned minGen = minGenParam.value();
+
    eoValueParam<unsigned int> steadyGenParam(100,
+"steadyGen", "Number of generations with no improvement",'s');
+
    parser.processParam( steadyGenParam, "Stopping
+criterion" );
+
    unsigned steadyGen = steadyGenParam.value();
+
    // operators probabilities at the algorithm
+level
+
    eoValueParam<double> pCrossParam(0.6,
+"pCross", "Probability of Crossover", 'C'); 
+
    parser.processParam( pCrossParam, "Genetic
+Operators" );
+
    double pCross = pCrossParam.value();
+
    eoValueParam<double> pMutParam(0.1,
+"pMut", "Probability of Mutation", 'M');
+
    parser.processParam( pMutParam, "Genetic
+Operators" );
+
    double pMut = pMutParam.value();
+
    // relative rates for crossovers
+
    eoValueParam<double> onePointRateParam(1,
+"onePointRate", "Relative rate for one point crossover", '1');
+
    parser.processParam( onePointRateParam,
+"Genetic Operators" );
+
    double onePointRate = onePointRateParam.value();
+
    eoValueParam<double> twoPointsRateParam(1,
+"twoPointRate", "Relative rate for two point crossover", '2');
+
    parser.processParam( twoPointsRateParam,
+"Genetic Operators" );
+
    double twoPointsRate = twoPointsRateParam.value();
+
    eoValueParam<double> uRateParam(2, "uRate",
+"Relative rate for uniform crossover", 'U');
+
    parser.processParam( uRateParam, "Genetic
+Operators" );
+
    double URate =  uRateParam.value();
+
    // relative rates and private parameters for
+mutations;
+
    eoValueParam<double> pMutPerBitParam(0.01,
+"pMutPerBit", "Probability of flipping 1 bit in bit-flip mutation", 'b');
+
    parser.processParam( pMutPerBitParam,
+"Genetic Operators" );
+
    double pMutPerBit = pMutPerBitParam.value();
+
    eoValueParam<double> bitFlipRateParam(0.01,
+"bitFlipRate", "Relative rate for bit-flip mutation", 'B');
+
    parser.processParam( bitFlipRateParam,
+"Genetic Operators" );
+
    double bitFlipRate =  bitFlipRateParam.value();
+
    eoValueParam<double> oneBitRateParam(0.01,
+"oneBitRate", "Relative rate for deterministic bit-flip mutation", 'D');
+
    parser.processParam( oneBitRateParam,
+"Genetic Operators" );
+
    double oneBitRate = oneBitRateParam.value();
+
    // the name of the "status" file where all
+actual parameter values will be saved
+
    string str_status = parser.ProgramName()
++ ".status"; // default value
+
    eoValueParam<string> statusParam(str_status.c_str(),
+"status","Status file",'S');
+
    parser.processParam( statusParam, "Persistence"
+);
+
    // do the following AFTER ALL PARAMETERS HAVE
+BEEN PROCESSED
+
    // i.e. in case you need parameters somewhere
+else, postpone these
+
    if (parser.userNeedsHelp())
+
       {
+
          parser.printHelp(cout);
+
          exit(1);
+
       }
+
    if (statusParam.value() != "")
+
       {
+
          ofstream
+os(statusParam.value().c_str());
+
          os <<
+parser; // and you can use that file as parameter file
+
       }
    
+
+
+
+
+
+
     /////////////////////////////
+
     // Fitness function
+
     ////////////////////////////
+
     // Evaluation: from a plain
+C++ fn to an EvalFunc Object ...
+
     eoEvalFuncPtr<Indi, double, const
+vector<bool>& > plainEval( binary_value );
+
    // ... to an object
+that counts the nb of actual evaluations
+
     eoEvalFuncCounter<Indi> eval(plainEval);
    
+
+
+
+
+
+
     ////////////////////////////////
+
     // Initilisation of population
+
     ////////////////////////////////
+
     // Either load or initialize
+
     // create an empty pop
+
     eoPop<Indi> pop;
+
     // create a state for reading
+
     eoState inState; // a state
+for loading - WITHOUT the parser
+
    // register the rng
+and the pop in the state, so they can be loaded,
+
     // and the present run will
+be the exact conitnuation of the saved run
+
     // eventually with different
+parameters
+
     inState.registerObject(rng);
+
     inState.registerObject(pop);
+
    if (load_name
+!= "")
+
         {
+
            
+inState.load(load_name); //  load the pop and the rng
+
           //
+the fitness is read in the file: 
+
           //
+do only evaluate the pop if the fitness has changed
+
         }
+
     else
+
         {
+
            
+rng.reseed(seed);
+
           //
+a Indi random initializer
+
           //
+based on eoUniformGenerator class (see utils/eoRndGenerators.h)
+
           eoUniformGenerator<bool>
+uGen;
+
           eoInitFixedLength<Indi>
+random(vecSize, uGen);
+
           //
+Init pop from the randomizer: need to use the append function
+
            
+pop.append(popSize, random); 
+
           //
+and evaluate pop (STL syntax) 
+
            
+apply<Indi>(eval, pop);
+
         } // end
+of initialization of the population
    
+
+
+
+
+
+
     // sort pop for pretty printout
+
     pop.sort();
+
     // Print (sorted) intial population
+(raw printout)
+
     cout << "Initial Population"
+<< endl << pop << endl;
    
+
+
+
+
+
+
     /////////////////////////////////////
+
     // selection and replacement
+
     ////////////////////////////////////
    
+
+
+
+
+
+
     // The robust tournament selection
+
     eoDetTournamentSelect<Indi> selectOne(tSize);      
+// tSize in [2,POPSIZE]
+
     // is now encapsulated in a
+eoSelectPerc (entage)
+
     eoSelectPerc<Indi> select(selectOne);
+
     // or eoSelectPerc<Indi> select(selectOne,
+rate); 
+
     // but by default rate==1
    
+
+
+
+
+
+
     // And we now have the full
+slection/replacement - though with 
+
     // the same generational replacement
+at the moment :-)
+
     eoGenerationalReplacement<Indi>
+replace; 
    
+
+
+
+
+
+
     //////////////////////////////////////
+
     // The variation operators
+
     //////////////////////////////////////
    
+
+
+
+
+
+
     // 1-point crossover for bitstring
+
     eo1PtBitXover<Indi> xover1;
+
     // uniform crossover for bitstring
+
     eoUBitXover<Indi> xoverU;
+
     // 2-pots xover
+
     eoNPtsBitXover<Indi> xover2(2);
+
     // Combine them with relative
+rates
+
     eoPropCombinedQuadOp<Indi> xover(xover1,
+onePointRate);
+
     xover.add(xoverU, URate);
+
     xover.add(xover2, twoPointsRate,
+true);
    
+
+
+
+
+
+
     // standard bit-flip mutation
+for bitstring
+
     eoBitMutation<Indi>  mutationBitFlip(pMutPerBit);
+
     // mutate exactly 1 bit per
+individual
+
     eoDetBitFlip<Indi> mutationOneBit; 
+
     // Combine them with relative
+rates
+
     eoPropCombinedMonOp<Indi> mutation(mutationBitFlip,
+bitFlipRate);
+
     mutation.add(mutationOneBit, oneBitRate,
+true);
+
     // The operators are  encapsulated
+into an eoTRansform object
+
     eoSGATransform<Indi> transform(xover,
+pCross, mutation, pMut);
    
+
+
+
+
+
+
     //////////////////////////////////////
+
     // termination condition see
+FirstBitEA.cpp
+
     /////////////////////////////////////
+
     eoGenContinue<Indi> genCont(maxGen);
+
     eoSteadyFitContinue<Indi> steadyCont(minGen,
+steadyGen);
+
     eoFitContinue<Indi> fitCont(vecSize);
+
     eoCombinedContinue<Indi> continuator(genCont);
+
     continuator.add(steadyCont);
+
     continuator.add(fitCont);
    
+
+
+
+
+
+
     // but now you want to make
+many different things every generation 
+
     // (e.g. statistics, plots,
+...).
+
     // the class eoCheckPoint is
+dedicated to just that:
+
     // Declare a checkpoint (from
+a continuator: an eoCheckPoint 
+
     // IS AN eoContinue and will
+be called in the loop of all algorithms)
+
     eoCheckPoint<Indi> checkpoint(continuator);
+
      //
+Create a counter parameter
+
         eoValueParam<unsigned>
+generationCounter(0, "Gen.");
+
       //
+Create an incrementor (sub-class of eoUpdater). Note that the 
+
         // parameter's
+value is passed by reference, 
+
         // so every
+time the incrementer is updated (every generation),
+
         // the data
+in generationCounter will change.
+
         eoIncrementor<unsigned>
+increment(generationCounter.value());
+
      //
+Add it to the checkpoint, 
+
         // so the
+counter is updated (here, incremented) every generation
+
         checkpoint.add(increment);
+
      //
+now some statistics on the population:
+
         // Best fitness
+in population
+
         eoBestFitnessStat<Indi>
+bestStat;
+
         // Second
+moment stats: average and stdev
+
         eoSecondMomentStats<Indi>
+SecondStat;
+
       //
+Add them to the checkpoint to get them called at the appropriate time
+
         checkpoint.add(bestStat);
+
         checkpoint.add(SecondStat);
+
         // The Stdout
+monitor will print parameters to the screen ...
+
        
+eoStdoutMonitor monitor(false);
+
         // when called
+by the checkpoint (i.e. at every generation)
+
        
+checkpoint.add(monitor);
+
         // the monitor
+will output a series of parameters: add them 
+
        
+monitor.add(generationCounter);
+
         monitor.add(eval);
+//
+because now eval is an eoEvalFuncCounter!
+
         monitor.add(bestStat);
+
         monitor.add(SecondStat);
+
         // A file
+monitor: will print parameters to ... a File, yes, you got it!
+
         eoFileMonitor
+fileMonitor("stats.xg", " ");
+
         // the checkpoint
+mechanism can handle multiple monitors
+
         checkpoint.add(fileMonitor);
+
         // the fileMonitor
+can monitor parameters, too, but you must tell it!
+
         fileMonitor.add(generationCounter);
+
         fileMonitor.add(bestStat);
+
         fileMonitor.add(SecondStat);
+
         // Last type
+of item the eoCheckpoint can handle: state savers:
+
        
+eoState outState;
+
         // Register
+the algorithm into the state
+
        
+outState.registerObject(parser);
+
         outState.registerObject(pop);
+
         outState.registerObject(rng);
+
         // and feed
+the state to state savers
+
    // save
+state every 100th  generation
+
         eoCountedStateSaver
+stateSaver1(100, outState, "generation"); 
+
         // save state
+every 1 seconds 
+
         eoTimedStateSaver   
+stateSaver2(1, outState, "time"); 
+
      //
+Don't forget to add the two savers to the checkpoint
+
         checkpoint.add(stateSaver1);
+
         checkpoint.add(stateSaver2);
+
         // and that's
+it for the (control and) output
    
+
+
+
+
+
+
     /////////////////////////////////////////
+
     // the algorithm
+
     ////////////////////////////////////////
+
     // Easy EA requires 
+
     // stopping criterion, eval, selection,
+transformation, replacement
+
     eoEasyEA<Indi> gga(checkpoint,
+eval, select, transform, replace);
+
     // Apply algo to pop - that's
+it!
+
     gga(pop);
    
+
+
+
+
+
+
     // Print (sorted) final population
+
     pop.sort();
+
     cout << "FINAL Population\n"
+<< pop << endl;
    
+
+
+
+
+
+
    }
+
    // A main that catches the exceptions
+
    int main(int argc, char **argv)
+
    {
+
    #ifdef _MSC_VER
+
         int flag = _CrtSetDbgFlag(_CRTDBG_LEAK_CHECK_DF);
+
           flag
+|= _CRTDBG_LEAK_CHECK_DF;
+
         _CrtSetDbgFlag(flag);
+
    //    _CrtSetBreakAlloc(100);
+
    #endif
+
         try
+
         {
+
                
+main_function(argc, argv);
+
         }
+
         catch(exception&
+e)
+
         {
+
                
+cout << "Exception: " << e.what() << '\n';
+
         }
+
         return 1;
+
    }
    
+
+
    Back to Lesson 3 - Tutorial
+main page - Algorithm-Based - Component-Based
+-
+Programming
+hints - EO
+documentation
+
    
+
    
+Marc Schoenauer
    
+
+
    Last modified: Sun Nov
+26 09:31:04 2000
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/SecondRealEA.html b/trunk/paradiseo-eo/tutorial/html/SecondRealEA.html
new file mode 100644
index 000000000..7882e7bad
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/SecondRealEA.html
@@ -0,0 +1,468 @@
+
+
+
+   
+   
+   SecondRealEA
+
+
+Back to Lesson 3 - Tutorial
+main page - Top-Down page - Bottom-up
+page - Programming hints - EO
+documentation
+
    
+
    
+
    
+
    
+SecondRealEA
    
+Click on the figure to see the corresponding code.
    
+In the code, the colors are meaningfull
    
+The actual code is in boldface and the comment in normal face.
+
    
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
     
+
+
+
+
+
+
    
+//-----------------------------------------------------------------------------
    
+// SecondRealEA.cpp
    
+//-----------------------------------------------------------------------------
    
+//*
    
+// Same code than FirstBitEA as far as Evolutionary Computation is concerned
    
+// but now you learn to enter the parameters in a more flexible way
    
+// (also slightly different than in SecondBitEA.cpp)
    
+// and to twidle the output to your preferences (as in SecondBitEA.cpp)
    
+//
    
+//-----------------------------------------------------------------------------
    
+// standard includes
    
+#include <stdexcept>   // runtime_error 
    
+#include <iostream>     // cout
    
+#include <strstream>   // ostrstream, istrstream
    
+// the general include for eo
    
+#include <eo>
    
+#include <es.h>
    
+    
+
    
+
+
+
+
+
    
+
+//-----------------------------------------------------------------------------
    
+// define your individuals
    
+typedef eoReal<eoMinimizingFitness> Indi;	
    
+    
+
    
+
+
+
+
+
    
+
+//-----------------------------------------------------------------------------
    
+// a simple fitness function that computes the euclidian norm of a real vector
    
+// Now in a separate file, and declared as binary_value(const vector<bool> &)
    
+#include "real_value.h"
    
+    
+
    
+
+
+
+
+
    
+
+//-----------------------------------------------------------------------------
    
+void main_function(int argc, char **argv)
    
+{
    
+    
+
    
+
+
+
+
+
    
+
+//-----------------------------------------------------------------------------
    
+// instead of having all values of useful parameters as constants, read them:
    
+// either on the command line (--option=value or -o=value)
    
+//         or in a parameter file (same syntax, order independent, 
    
+//                                                         # = usual comment character 
    
+//         or in the environment (TODO)
    
+   // First define a parser from the command-line arguments
    
+   eoParser parser(argc, argv);
    
+   
    
+   // For each parameter, you can in on single line
    
+   // define the parameter, read it through the parser, and assign it
    
+   
    
+
+   unsigned seed = parser.createParam(unsigned(time(0)), "seed", "Random number seed", 'S').value(); // will be in default section General
    
+   
    
+   // description of genotype
    
+   unsigned vecSize = parser.createParam(unsigned(8), "vecSize", "Genotype size",'V', "Representation" ).value();
    
+     // parameters for evolution engine
    
+       unsigned popSize = parser.createParam(unsigned(10), "popSize", "Population size",'P', "Evolution engine" ).value();
    
+       unsigned tSize = parser.createParam(unsigned(2), "tSize", "Tournament size",'T', "Evolution Engine" ).value();
    
+     // init and stop
    
+       string loadName = parser.createParam(string(""), "Load","A save file to restart from",'L', "Persistence" ).value();
    
+ 
    
+       unsigned maxGen = parser.createParam(unsigned(100), "maxGen", "Maximum number of generations",'G', "Stopping criterion" ).value();
    
+       unsigned minGen = parser.createParam(unsigned(100), "minGen", "Minimum number of generations",'g', "Stopping criterion" ).value();
    
+       unsigned steadyGen = parser.createParam(unsigned(100), "steadyGen", "Number of generations with no improvement",'s', "Stopping criterion" ).value();
    
+     // operators probabilities at the algorithm level
    
+       double pCross = parser.createParam(double(0.6), "pCross", "Probability of Crossover", 'C', "Genetic Operators" ).value();
    
+       double pMut = parser.createParam(double(0.1), "pMut", "Probability of Mutation", 'M', "Genetic Operators" ).value();
    
+     // relative rates for crossovers
    
+       double hypercubeRate = parser.createParam(double(1), "hypercubeRate", "Relative rate for hypercube crossover", '\0', "Genetic Operators" ).value();
    
+       double segmentRate = parser.createParam(double(1), "segmentRate", "Relative rate for segment crossover", '\0', "Genetic Operators" ).value();
    
+       // internal parameters for the mutations
    
+       double EPSILON = parser.createParam(double(0.01), "EPSILON", "Width for uniform mutation", '\0', "Genetic Operators" ).value();
    
+       
    
+       double SIGMA = parser.createParam(double(0.3), "SIGMA", "Sigma for normal mutation", '\0', "Genetic Operators" ).value();
    
+     // relative rates for mutations
    
+       double uniformMutRate = parser.createParam(double(1), "uniformMutRate", "Relative rate for uniform mutation", '\0', "Genetic Operators" ).value();
    
+       double detMutRate = parser.createParam(double(1), "detMutRate", "Relative rate for det-uniform mutation", '\0', "Genetic Operators" ).value();
    
+       double normalMutRate = parser.createParam(double(1), "normalMutRate", "Relative rate for normal mutation", '\0', "Genetic Operators" ).value();
    
+       // the name of the "status" file where all actual parameter values will be saved 
    
+       string str_status = parser.ProgramName() + ".status"; // default value
    
+       string statusName = parser.createParam(str_status, "status","Status file",'S', "Persistence" ).value();
    
+     // do the following AFTER ALL PARAMETERS HAVE BEEN PROCESSED
    
+     // i.e. in case you need parameters somewhere else, postpone these
    
+       if (parser.userNeedsHelp())
    
+           {
    
+               parser.printHelp(cout);
    
+               exit(1);
    
+           }
    
+       if (statusName != "")
    
+           {
    
+ofstream os(statusName.c_str());
    
+os << parser;		// and you can use that file as parameter file
    
+           }
    
+    
+
    
+
+
+
+
+
    
+
+   /////////////////////////////
    
+   // Fitness function
    
+   ////////////////////////////
    
+   // Evaluation: from a plain C++ fn to an EvalFunc Object
    
+   // you need to give the full description of the function
    
+   eoEvalFuncPtr<Indi, double, const vector<double>& > plainEval(   real_value );
    
+   // ... to an object that counts the nb of actual evaluations
    
+   eoEvalFuncCounter<Indi> eval(plainEval);
    
+    
+
    
+
+
+
+
+
    
+
+   ////////////////////////////////
    
+   // Initilisation of population
    
+   ////////////////////////////////
    
+   // Either load or initialize
    
+   // create an empty pop
    
+   eoPop<Indi> pop;
    
+   // create a state for reading
    
+   eoState inState;		// a state for loading - WITHOUT the parser
    
+   // register the rng and the pop in the state, so they can be loaded,
    
+   // and the present run will be the exact conitnuation of the saved run
    
+   // eventually with different parameters
    
+   inState.registerObject(rng);
    
+   inState.registerObject(pop);
    
+       
    
+   if (loadName != "")
    
+       {
    
+           inState.load(loadName); //   load the pop and the rng
    
+           // the fitness is read in the file: 
    
+           // do only evaluate the pop if the fitness has changed
    
+       }
    
+   else
    
+       {
    
+           rng.reseed(seed);
    
+           // a Indi random initializer
    
+           // based on boolean_generator class (see utils/rnd_generator.h)
    
+           eoUniformGenerator<double> uGen(-1.0, 1.0);
    
+           eoInitFixedLength<Indi> random(vecSize, uGen);
    
+           // Init pop from the randomizer: need to use the append function
    
+           pop.append(popSize, random);           
    
+           // and evaluate pop (STL syntax)       
    
+           apply<Indi>(eval, pop);
    
+       } // end of initializatio of the population
    
+    
+
    
+
+
+
+
+
    
+
+   // sort pop before printing it!
    
+   pop.sort();
    
+   // Print (sorted) intial population (raw printout)
    
+   cout << "Initial Population" << endl;
    
+   cout << pop;
    
+    
+
    
+
+
+
+
+
    
+
+   /////////////////////////////////////
    
+   // selection and replacement
    
+   ////////////////////////////////////
    
+    
+
    
+
+
+
+
+
    
+
+   // The robust tournament selection
    
+   eoDetTournamentSelect<Indi> selectOne(tSize);
    
+   // is now encapsulated in a eoSelectPerc (entage)
    
+   eoSelectPerc<Indi> select(selectOne);// by default rate==1
    
+    
+
    
+
+
+
+
+
    
+
+   // And we now have the full slection/replacement - though with 
    
+   // no replacement (== generational replacement) at the moment :-)
    
+   eoGenerationalReplacement<Indi> replace; 
    
+    
+
    
+
+
+
+
+
    
+
+   //////////////////////////////////////
    
+   // The variation operators
    
+   //////////////////////////////////////
    
+    
+
    
+
+
+
+
+
    
+
+   // uniform chooce on segment made by the parents
    
+   eoSegmentCrossover<Indi> xoverS;
    
+   // uniform choice in hypercube built by the parents
    
+   eoHypercubeCrossover<Indi> xoverA;
    
+   // Combine them with relative weights
    
+   eoPropCombinedQuadOp<Indi> xover(xoverS, segmentRate);
    
+   xover.add(xoverA, hypercubeRate, true);
    
+    
+
    
+
+
+
+
+
    
+
+   // offspring(i) uniformly chosen in [parent(i)-epsilon, parent(i)+epsilon]
    
+   eoUniformMutation<Indi>   mutationU(EPSILON); 
    
+   // k (=1) coordinates of parents are uniformly modified
    
+   eoDetUniformMutation<Indi>   mutationD(EPSILON); 
    
+   // all coordinates of parents are normally modified (stDev SIGMA)
    
+   eoNormalMutation<Indi>   mutationN(SIGMA); 
    
+   // Combine them with relative weights
    
+   eoPropCombinedMonOp<Indi> mutation(mutationU, uniformMutRate);
    
+   mutation.add(mutationD, detMutRate);
    
+   mutation.add(mutationN, normalMutRate, true);
    
+   // The operators are   encapsulated into an eoTRansform object
    
+   eoSGATransform<Indi> transform(xover, pCross, mutation, pMut);
    
+    
+
    
+
+
+
+
+
    
+
+   //////////////////////////////////////
    
+   // termination condition see FirstBitEA.cpp
    
+   /////////////////////////////////////
    
+   eoGenContinue<Indi> genCont(maxGen);
    
+   eoSteadyFitContinue<Indi> steadyCont(minGen, steadyGen);
    
+   eoFitContinue<Indi> fitCont(0);
    
+   eoCombinedContinue<Indi> continuator(genCont);
    
+   continuator.add(steadyCont);
    
+   continuator.add(fitCont);
    
+   
    
+   
    
+    
+
    
+
+
+
+
+
    
+
+   // but now you want to make many different things every generation 
    
+   // (e.g. statistics, plots, ...).
    
+   // the class eoCheckPoint is dedicated to just that:
    
+   // Declare a checkpoint (from a continuator: an eoCheckPoint 
    
+   // IS AN eoContinue and will be called in the loop of all algorithms)
    
+   eoCheckPoint<Indi> checkpoint(continuator);
    
+   
    
+       // Create a counter parameter
    
+       eoValueParam<unsigned> generationCounter(0, "Gen.");
    
+       
    
+       // Create an incrementor (sub-class of eoUpdater). Note that the 
    
+       // parameter's value is passed by reference, 
    
+       // so every time the incrementer is updated (every generation),
    
+       // the data in generationCounter will change.
    
+       eoIncrementor<unsigned> increment(generationCounter.value());
    
+       // Add it to the checkpoint, 
    
+       // so the counter is updated (here, incremented) every generation
    
+       checkpoint.add(increment);
    
+       // now some statistics on the population:
    
+       // Best fitness in population
    
+       eoBestFitnessStat<Indi> bestStat;
    
+       // Second moment stats: average and stdev
    
+       eoSecondMomentStats<Indi> SecondStat;
    
+       // Add them to the checkpoint to get them called at the appropriate time
    
+       checkpoint.add(bestStat);
    
+       checkpoint.add(SecondStat);
    
+       // The Stdout monitor will print parameters to the screen ...
    
+       eoStdoutMonitor monitor(false);
    
+         
    
+       // when called by the checkpoint (i.e. at every generation)
    
+       checkpoint.add(monitor);
    
+       // the monitor will output a series of parameters: add them 
    
+       monitor.add(generationCounter);
    
+       monitor.add(eval);		// because now eval is an eoEvalFuncCounter!
    
+       monitor.add(bestStat);
    
+       monitor.add(SecondStat);
    
+       // A file monitor: will print parameters to ... a File, yes, you got it!
    
+       eoFileMonitor fileMonitor("stats.xg", " ");
    
+         
    
+       // the checkpoint mechanism can handle multiple monitors
    
+       checkpoint.add(fileMonitor);
    
+       // the fileMonitor can monitor parameters, too, but you must tell it!
    
+       fileMonitor.add(generationCounter);
    
+       fileMonitor.add(bestStat);
    
+       fileMonitor.add(SecondStat);
    
+       // Last type of item the eoCheckpoint can handle: state savers:
    
+       eoState outState;
    
+       // Register the algorithm into the state (so it has something to save!!)
    
+       outState.registerObject(parser);
    
+       outState.registerObject(pop);
    
+       outState.registerObject(rng);
    
+       // and feed the state to state savers
    
+       // save state every 100th   generation
    
+       eoCountedStateSaver stateSaver1(20, outState, "generation"); 
    
+       // save state every 1 seconds 
    
+       eoTimedStateSaver     stateSaver2(1, outState, "time"); 
    
+       // Don't forget to add the two savers to the checkpoint
    
+       checkpoint.add(stateSaver1);
    
+       checkpoint.add(stateSaver2);
    
+       // and that's it for the (control and) output
    
+    
+
    
+
+
+
+
+
    
+
+   /////////////////////////////////////////
    
+   // the algorithm
    
+   ////////////////////////////////////////
    
+   // Easy EA requires 
    
+   // stopping criterion, eval, selection, transformation, replacement
    
+   eoEasyEA<Indi> gga(checkpoint, eval, select, transform, replace);
    
+   // Apply algo to pop - that's it!
    
+   gga(pop);
    
+   
    
+    
+
    
+
+
+
+
+
    
+
+   // Print (sorted) intial population
    
+   pop.sort();
    
+   cout << "FINAL Population\n" << pop << endl;
    
+    
+
    
+
+
+
+
+
    
+
+}
    
+// A main that catches the exceptions
    
+int main(int argc, char **argv)
    
+{
    
+       try
    
+       {
    
+               main_function(argc, argv);
    
+       }
    
+       catch(exception& e)
    
+       {
    
+               cout << "Exception: " << e.what() << '\n';
    
+       }
    
+       return 1;
    
+}
    
+
    
+
    Back to Lesson 3 - Tutorial
+main page - Top-Down page - Bottom-up
+page - Programming hints - EO
+documentation
+
    
+
    
+Marc Schoenauer
    
+
    Last
+modified: Sun Apr 28 06:42:44 2002
+
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/beige009.jpg b/trunk/paradiseo-eo/tutorial/html/beige009.jpg
new file mode 100644
index 0000000000000000000000000000000000000000..594c01d8e1b01adbdd88852e6c591f789cf21d6e
GIT binary patch
literal 6643
zcmbtYcU05KxBn(VAWA}2S$av}7gvf@=~YMoi3Z;;3+Re~BnC;468Hg2m7>x@7U>{H
zu;C)oi}a>~KoAfTq)8D&mxw^}qWj8u@4R=;JLla$?wor+cV<5Gz2`e~XL#ehX+X@u
z4r2#^z#z~`&`AK`u|az0@T4G8Af7~4($&-kPFrKnLfF7}5&IqifB=5%-|Y`<>pKJp
z|ImE(-KQ@0!#d25{ae64BES4F(16y}t9-y~smy`P+9vwac0^Ioe-(&QD
zcr^ag^JC1fd>a7BeCGe7K$gD4|0Bfv|6t$e7WkVP7y$ED0l1Yn>532F9nGH(#G3@-
z0TE$gVW_YO6e=QqxR?|i
z4ww3_;8K5g5&ypoz-tA>g@In67XnfNz~Uf?IEdE?vf%SO1o|O-s^0~|Prtw+K_Ox2
z;UoOy{#OtLfFb`5iUA-25Ckj$J|rY4d${Tc12h3M(mJ{5R&S$KC|H!sDG@aGEU7l^Md!8_WMBw$A|xA)@SoYd*eGmS*%3hJUU+e?bfTPx<-yL#vwnU
z_PK(xcBGf1S^RF`e5N}&=uIkH-D=ZW4s9~w*(AP;!`)O3dOjK9mYKV;eW!;koR<11
zZhVb+5q_{KRV&lIXfdK%OWMNW`ol}y^i7WwPFPC5G1;}XgdY4-7|ta_?{K+W<5B-a
zp9{c`z*>4`4*KpC3Me=~Fw(-ad@|PM=!SKUHuqcchcWJfCv`+Zbc>7F2$1L9pUhrD
zpN31@QQ@g_@eKFWQL6m=Vh0DGqiurymEH;T1tDRLLvc%)_s%Xi1wK>|M|CKOw3!PP
zNZ@KGU1f9S;IUF3wtH1V9Pd(i0J2=LB8+Nr0yi3Nb0lw%Ma3~(?ksC;C39c77tWd7
zD|CzOJANTZW6IR)Aldj;cT9pk6y=^|{DS;>?iG36Da*dg(rt-~foxq-ou?1`#g6^N
z{Utie2dUMZXqOhVg`4!0X*FwldCfG^kiZmwmF!g&7$i?$<{%z$8e<`eWc_$rJcaC)
z1|X8A#0K%u=4#JD!*zPIE+!+vHP
zks@}{LYD`eQ5j^EMU`B^UDmny1icW7LIu<_!NU8iAHekAA8IMZ>=t9rX&!v_3wu+R
zaN1H$l&s37I{1DXUN|r-H^s!}S*?0mnx&<2F}9uNKn^TIFbhm49&?PPC4kre4~`Wf=Kl0vBV6+35}pGtl*
zdY7t-%dTsB?J8#qzlqctw1kjNLj}4|j9EtMy`h%OpcM{;5QZ1}^{QfDaRrvBIr@78
z6{4F_YkhBw!@MFQMhs2+e5WoX%solUXiLZ8WjwK4<`8S{Pl&Olm0xui{f6p=sq7c5>j^@@GCzGTrdIy|
zA^(vp`*5=C&3Y?$~YO3Q{$exa(+_Wb|x=^WzKj~_Ugf_<}Z#(LATAOW!gvZ)t
z`KlbOCOKA5J{gR|HQTR^FW6v*l&uC>$~DIJa`=L^^72W~Y$rvuM310h)hFtom3^bw
z0Pe^nz0JQRKPWnb2!F6h7?pCwm{{(7wM#~wc?Vf#dM(wc?_vCW5?sg4m7)aV2ZlH+
zP$o#GL3Q~U2jdh(nDj~fNEg*fR_-7RF-VIFpOj0~N`Lz7fb+0_#wsS8a-pcK#W)RF
z(Eh9u_Z0>#m=a(Pp;29U!`q@IA&LPq9iHg%R!{a=ZQ>41R?s&P^UanA%x6}Y;|0rJ
zL&v%-2l^g7+Zhhp_2N(=Wf<5Fsb{h(z25nkYQr_W=yX!Zxzon{zF-O_uo{zcKQ#rdXti
zXf&yVBR%Gjh)MX_7sVK-+qoN{GOkvGyNFFrjd`+hbbcrIP7EoG`%xOfCMHwnU%Tj6p0p)rpWf9PHsYW$E`5KK7kWQGB2<^|6IkrX?~W{#TgA
z7ZfTkM9k6Kuzody=D0#3VeWU{D4p@oGVR?TG=dgraK0(t~reE;SgF
z!a*LO%wK)37HM%WJoVG1`(^&`Et*2D11Q}l>0W!9j$S88A#Xj6>GaAm`3AyN=pOZ)
zG8&@qhu<_~BNiO!?bic!1#<
zh;g)c;tkOuVoRO+_KGGa+uX)7J^9wk#M~4Dv0z{@?%c$lrkA>3^Qxj=WUkZQu#wN1
z_`}j(j%ea-p~$|tkOPU?4-(!yzz3;gey5F~xuF!p19H^00u!4PNui%JukXC>jG2s|
zTq(e$c0^NY6XSMydB1&z)63GFu9vsb_nqi|#I*WYdvZn?p7~Y7)Co^LCXjf|O@7*h
zmMi>CgC$qDZt+;E)@xn1uD}X{Z9ZktLY4U-Kz&}FIcF>c>I^OY0va|K)I-gb+ItPG
zNev)mgQc4ZC9;rU{vVf?xq(2qmcFYU5rN2@Ke)P!{WHE
zFW`%p^_#W?9#(&;AM9i5b2!+>t*1(GD0e>pXO&AB(n7{P8m&y?ayEYbF!Gt2p?ri?
z_Grd8m5Y0=OBtGS)kCv-7$?U|49PW9Js$ASC?|1v%xq4hhw`&IPCZVkHes)^Zk>9U
z^h{5@BE+oSuDwl_iG^ijN}Y$T$m`k%!2WmcAJ-{R4#~oW{xQm-E2fv
zqEyZjbKwJ_0_zFw(kz=K#eCanIxN-XNt2kpc*$Xp(J}E)1#j1aPVz<^0?gE9f!c>
z#$OsE$m)|@PJ(l64mQ9jdVJp6K2*LkW`O>$+!K0=Ouw?CL
zJWd@H9ps3XKxYgVYMe6N>r6t=Y9w7RytfWHN6mWv*HG8TvdswU`#P&itbbpdu5xSY
zOq=@4ip$Accq*0VE>pG(4(NnX(^#~MV`|PcXWsiggJ^X3pNUhD3m7JBuc4poa
z_@SW(0*rWuaayfhP
z;KIxoiOVUhofMqQDbK(v|GC~A#_W>AVu$w|ir?1y`R#n~44Vvu_P_P7vz(Q(}1ZuDLp(-6@@P|HBd={~lSSSgg!(-Kx-SRXsk;0Z8+-(D^5tACh`D`#Y-S`a$ev0
z=b~cvlybXjKk}3+CM;n`_4hVicVe=LDS56WLp$=VKnSREwkUuytm!4xhdd$2@>8A?
zGdf$NkUT>6B`a#k!A+@@xAG
z8NmZXt-lBj1qP!~$pW9IOsJtYDzA-HYT)R#OZ4WoqPiTW?5R^h+sEY2Mi^_Ptoi_~vY{?T`_fD$&}byBVfz^3y;pt8??nHnc7H
zpT}a?1T8U+x8*K^;*0LiV-@p!O>4VQ0bFe4Q^@aZRF%I>^bnK&AiQ_N2EB&z8!L!#
zu&VHUrfp*TDvUf*>(XIwAw?^hW_f_j+DTQcGWy_Pm;icTDt8PL$$U6bFjb*w
zD?V=55*zcJDMs0WL>Js->KS9z<7stM)5vFOtRW>)PuN`7qhsSkb?LGL`45^`$9$_+
z5G$J)r{=Qc)V-jhTtWoL^g3qT9E2
zK&PIh$TYM)lE1|-f(ExGT?J*VSaXxpxiD+D;ZY7q-9K$OJzUthbSHJ%q$!7gO__OT
z1@nUp%;#PMU$K|@S{fW2t61OI2tyw}OM1xm5Y3pIr~WB*nyn?O-JPy2`;sGYIBq&3t1gB~n?C#{b~0TpnAjlgHuOUkj%c_h=eN_7zmv6nLsv2+V%Ay3x#qqSl5(i{#v-EBHkSQX
zETYuh)1)?|{#kVRH6Nu7u>lkDzdqFKx_dzbeb&rUV~|=pKp6R8&3yo$FH;)A=;;kPr~A}UuOm0oVv4)Hx}9%O
zwI`V9iq)KLyEjMLyAUEaJsLBA*uf*ADrSFr{otJvM|41P92PZjp2&V;rCF$iPlBoi
z1+0$HipSiyJ3|$E*3qZRLq@Cg51Pygj!AbdNmo;S%nzn3(kKMR+QB@n9^Qo3dd>$!d%P-uU=9bYs?KuRCSJEll0EUs8QS_;b)9
zEwb)aR$25=SwG?w{CSz3-q#f|spPO>D?D2gYQ`OOTc{I#a9DNB_^wU3;Bwg})luDb
z2L!Z@yrZ)duA{9*adRu!PG$rn6r6
z_-N#Hjt^Q*|AU(iYlZH|_3PD1Y9b1i2wxGUHwFz7Y(v(uqM_O$8B_Wa;f}8B;iI%ccajx-hR1
z0`4k&`$zr9R?~DheWLxruH`_*)AcB{DP4-2Jz1Pkh%qh=PK`eE$JTa8(R9|H&`U-w
zdcrQA{-A3>VYKbDobydJs*{AppEcf({8bcnH@MI~q2+Yh-4}28yXwn~%kp#%w66-f
zlf{7)#U{Zh$j)`q%js|eV`_m*A+;e<_xcaDJ%bb!^MH{upU%uCFb@#?WPN5QI{+`)
zss=b{s>oND74#3|a77nG>~_{DCU)r=8c#!cfSRO#=?mHBo^<`9TVWIv=bu04|!=r|z!g_ZU4duey*c7lodkjSwPH9lS?{QWy>9zyH%&AUxrD
zhmWO@)9TIKImw)4)`Q_vO=8Ol3%tecdF88Y>$dF
zh%ChT*0UDT+~JTWiwVP1%}mR8=1mXO+imn2>&6l^%oJxHd8G!PikmTxI^jyZB!v!H7VW{MIrE5h^>O$8h1
z52_@!5*s_xKEHCf9#}a0L5ptJg5VdijBW9{YaFn>03Ms+^wXu;O(YL!{CR;+6ImOc
zX5TfsPx*x@C+(ej`kAg#(+uLJf)X@bHL=|!
z@rsK6BPV=PZ0EIwV!f@77yhKLuFfCCg?OstcK4V9wu*vEXhSyUM|j=bvc{mkxm#_Y
zoHXTboUNfMcQ&>v{MwJdhs9pv`Bk7}^T%1G>Vg7oB=UP-
H-ur(A-Dy?`

literal 0
HcmV?d00001

diff --git a/trunk/paradiseo-eo/tutorial/html/binary_value.html b/trunk/paradiseo-eo/tutorial/html/binary_value.html
new file mode 100644
index 000000000..45f3e35a1
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/binary_value.html
@@ -0,0 +1,57 @@
+
+
+
+   
+   
+   binary_value.h
+
+
+Back to Lesson 2 - Tutorial
+main page - Algorithm-Based - Component-Based
+page - Programming hints - EO
+documentation
+
    
+
    
+
    
+
    
+binary_value.h
    
+
+
+
+
+
+
    #include <eo>
+
    //-----------------------------------------------------------------------------
+
    /** Just a simple function that takes binary
+value of a chromosome and sets
+
         the fitnes.
+
         @param _chrom A
+binary chromosome 
+
    */
    
+
+
+
+
+
+
    double binary_value(const vector<bool>&
+_chrom)
+
    {
+
     double sum = 0;
+
     for (unsigned i = 0; i < _chrom.size();
+i++)
+
         sum += _chrom[i];
+
     return sum;
+
    }
    
+
+
    Back to Lesson 2 - Tutorial
+main page - Algorithm-Based - Component-Based
+page - Programming hints - EO
+documentation
+
    
+
    
+Marc Schoenauer
    
+
+
    Last modified: Wed Nov
+29 09:03:09 2000
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/debut.html b/trunk/paradiseo-eo/tutorial/html/debut.html
new file mode 100644
index 000000000..2c6c8d305
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/debut.html
@@ -0,0 +1,21 @@
+
+
+  
+    TITRE
+  
+
+ 
+Tutorial main page -
+Algorithm-Based
+page - Component-Based - Programming
+hints - EO documentation
+
    
+
    
+
+
+
    
+    
    TITRE
    
+
    
+
+
+
    
diff --git a/trunk/paradiseo-eo/tutorial/html/eoBottomUp.html b/trunk/paradiseo-eo/tutorial/html/eoBottomUp.html
new file mode 100644
index 000000000..b35d40262
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/eoBottomUp.html
@@ -0,0 +1,77 @@
+
+
+
+   
+   
+   EO - The Component-Based approach
+
+
+Tutorial main page -
+Algorithm-Based
+ - Component-Based - Programming
+hints - EO documentation
+
    
+
    
+
    
+
    
+EO - Component-Based approach
    
+
+

    Congratulations - You have chosen the component-based approach! 
+From here you will be allowed to browse into the different components of
+an Evolutionary Algorithm, and to see how to program your favorite using
+the EO library.
+
+
    
+Table of Content
    
+
+
    
+
    
+
+
    Yes, this is the table of content of this part
+of the EO tutorial. If you don't already know what this symbolic
+      representation of an EA means, you should try here. Otherwise, click on the figure
+to go directly to the corresponding section of the tutorial.
+
    
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    
+
    
+
    Tutorial main page - Algorithm-Based
+ - Component-Based - Programming
+hints - EO documentation
+
    
+
    
+
    
+Marc Schoenauer
    
+
+
    Last
+modified: Mon Oct 30 07:28:36 CET 2000
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/eoCheckPoint.html b/trunk/paradiseo-eo/tutorial/html/eoCheckPoint.html
new file mode 100644
index 000000000..3b905eed6
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/eoCheckPoint.html
@@ -0,0 +1,150 @@
+
+
+
+   
+   
+   Variation Operators
+
+
+General: Algorithm-Based
+- Component-Based - Programming
+hints - EO
+documentation
+
    
+
    
+
    Local: Introduction
+- Continuators - Combined
+continuators - Checkpoints - Statistics
+- Monitors - Updaters
+
    
+
    
+
    
+
    
+CheckPointing
    
+What
+is Checkpointing about?
+
    Evolutionary Algorithms are almost all timely ticked, the basic time
+unit being what is called a generation. EO checkpointing mechanism allow
+you to program things that you want to be done at the end of every generation.
+This includes deciding to stop, outputing some statistics on the current
+state of the algorithm,  updating some dynamical variables of your
+algorithm, saving the population to disk, ...
+
    EO classes described in this page:
+
      
+
    • 
+Base classes: eoCheckPoint, eoContinue,
+eoStat, eoSortedStat, eoMonitor, eoUpdater
      • 
+
+
    • 
+Derived classes: eoCombinedContinue,
      • 
+
+
    • 
+Related classes: eoGnuPlot1DMonitor,
+eoGnuPlot1DSnapshotMonitor,
      • 
+
    
+
+
     
+
    
+
    Continuators:
+
    Continuators are functors that compute stopping critera. They receive
+a population and return a boolean value which is set to false only when
+some stopping vriterion is met. All algorithms in EO have a loop that goes
+do{...}while(continuator(pop)which
+means that the algorithm stops only when the continuator returns false.
+
    Interface:  The abstract class
+for computing stopping conditions is eoContinue,
+and the interface for its operator() is
+
                              
+
+bool operator()(const eoPop<EOT>&
+)
+
    which you could have guessed from the inheritance
+diagram for class eoContinue, as
+you see there that eoContinue derives
+from class eoUF<const eoPop<EOT>&,
+bool>.
+
    Using a continuator:
+
    You can find an first example of using a continuator in the code for
+FirstBitEA
+ior more sophisticated continue conditions in  Lesson2.
+
    If you want to find out how it is used inside an algorithm, go and
+see for instance in eoSGA, the simplest EA within EO.
+
    Writing a
+continuator:
+
    There are only two things to modify in the template
+class definitions provided (apart from the name of the class you are
+creating!)
+
      
+
    • 
+The constructor, where you pass to the object
+any useful parameter (see the private data at end of class definition).
      • 
+
+
    • 
+The operator() method, which performs the
+computation of the actual test using the population plus any other parameter
+passed at construct time. Don't forget to returnfalse
+when the stopping criterion is met!
      • 
+
    
+Existing continuators:
+Of
+course you can find out all existing (non-virtual!) subclasses of eoContinue
+by looking at its  inheritance
+diagram. But you might find it more convenient to have them listed
+here:
+
      
+
    • 
+
      • 
+
    
+
+

    
+
    Combining
+continuators:
+
    
+
    CheckPoints:
+
    Interface:
+
    Using a checkpoint: An eoCheckPoint
+being an eoContinue, its usage is exactly the same. However, an eoCheckPoint
+will actually do many more things than an eoContinue before returning its
+boolean result as an eoContinue.
+
    Writing a
+checkpoint:
+
    This is something you should never have to do. However, should you
+feel you have to do it, please do - and send us both the reasons that lead
+you to that (what is it you couldn't do with existing eoCheckPoint), and
+the resulting code, of course.
+
    
+
    Statistics:
+
    Interface:
+
    Using statistics:
+
    Writing a statitic:
+
    
+
    Monitors:
+
    Interface:
+
    Using monitors:
+
    Writing a monitor:
+
    
+
    Updater:
+
    Interface:
+
    Using updaters:
+
    Writing an updater:
+
     
+
    
+
    Local: Introduction
+- Continuators - Combined
+continuators - Checkpoints - Statistics
+- Monitors - Updaters
+
    
+
    General: Algorithm-Based
+- Component-Based - Programming
+hints -EO
+documentation
+
    
+
    
+
    
+Marc Schoenauer
    
+
+
    Last
+modified: Fri Dec. 8 2000 
+
     
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/eoEngine.html b/trunk/paradiseo-eo/tutorial/html/eoEngine.html
new file mode 100644
index 000000000..367c94177
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/eoEngine.html
@@ -0,0 +1,778 @@
+
+
+
+   
+   
+   Genetic Engine
+
+
+General: Algorithm-Based
+- Component-Based - Programming
+hints - EO
+documentation
+
    Local:     Introduction 
+- Selection - Replacement
+- General Replacement - Popular
+evolution engines - Tournaments - Merge
+- Reduce - HowMany - SurviveAndDie
+
    
+
    
+
    
+Evolution Engine
    
+
+
    
+
    Evolution
+Engines
+
    The term evolution engine denotes
+the different parts of an Evolutionary Algorithm that simulate the Darwinism:
+
    
+
    The fittest individuals are more likely to
+reproduce and survive.
    
+
+
    Darwinism takes place in two different phases of an EA, though in many
+popular
+variants, only one phase is activated.
+
    Selection is the Darwinistic choice of parents
+that will be allowed to reproduce.
+
    Replacement takes place after reproduction,
+and is the Darwinistic choice of those individuals that will survive,
+i.e. become the parents of the next generation.
+
    Both selection and replacement will be discussed in turn, before some
+helper classes that are used within selection and replacement procedures
+are presented.
+
    
+
    Selection
+
    The very beginning of the generation loop is the selection phase, where
+some individuals from the population are chosen to become the parents,
+to be later modified by the variation operators and become the offspring.
+This is the first step of the artificial Darwinism,
+where the fittest individuals are allowed to reproduce.
+
    Conceptually, there are two distinct ways to choose the lucky ones:
+one by one from the very same population (i.e. with replacement), which
+means that at the extreme the same individual can be chosen every time;
+or as a whole, in some sort of batch procedure. Of course, repeated selection
+of one individual results in a batch selection!
+
    There are hence two basic EO classes for selection: eoSelectOne
+and eoSelect, with different interfaces.
+
    
+
    
+
    eoSelectOne: The
+interface
+
    The abstract class for selection of a single individual from a population
+is eoSelectOne, and the interface for its
+operator()
+is
+
    
+
    const EOT & operator()(const eoPop<EOT>&
+_parents)
    
+
+
    which you could have guessed from the inheritance tree for class eoSelectOne.,
+as you see there that eoSelectOne derives
+from class eoUF<const eoPop<EOT>&,
+const EOT&>.
+
    This means that it takes 1 population
+(without the right to modify it - see the const
+keyword in argument) and returns a const reference to an individual (again,
+the const keyword ensures
+that nothing will happen to the individual in the population - remember
+it returns a reference).
+
    
+
    
+
    eoSelectOne: Instances
+
      
+
    • 
+eoDetTournamentSelect uses
+the (deterministic) tournament to choose one
+individual. Its constructor has one parameter, the tournament size (integer
+>= 2).
      • 
+
+
    • 
+eoStochTournamentSelect uses
+the binary stochastic tournament to choose
+one individual. Its constructor has one parameter, the tournament rate
+(real in [0.5,1]).
      • 
+
+
    • 
+ eoProportionalSelect
+is the original roulette wheel selection:
+each parent is selected with a probability proportional to its fitness.
      • 
+
+
    • 
+eoRandomSelect is the random
+selection and should give bad results! At the moment, it selects one individual
+uniformly, but it would be easy to use any probability distribution.
      • 
+
    
+
+
    
+
    eoSelect: The
+interface
+
    The abstract class for batch selection of a  whole set of individuals
+from a population is eoSelect, and the interface
+for its
+operator() is
+
    
+
    void operator()(const eoPop<EOT>&
+_source, eoPop<EOT>& _dest)
    
+
+
    which you could have guessed from the inheritance tree for class eoSelect.,
+as you see there that eoSelect derives from
+class
+eoBF<const eoPop<EOT>&, eoPop<EOT>&, void>.
+
    This means that it takes 2 populations,
+and fills the second one with individuals from the first one without modifying
+it (see the const keyword).
+This raises two questions:
+
      
+
    • 
+How does it know how many individuals to select?
      • 
+
+
    • 
+How to use repeated selection of one individual (see above the eoSelectOne
+class)?
      • 
+
    
+
+
    
+
    eoSelect: HowMany
+
    There are two ways an  can derive the number of individuals it
+has to select: either it is a fixed number, or it is some percentage of
+the source population size (any positive real number). In both case, this
+must be passed to the constructor. In most instances, however, the constructor
+will accept a real number (double) and a boolean indicating whether this
+real number should be used as an absolute integer or as a rate, thanks
+to the eoHowMany class.
+
    Note: an eoSelect
+can select more individuals than there are in the original population.
+It is the job of the replacement to ensure
+that the population size does not grow along the generations.
+
    
+
    eoSelectMany: Encapsulating
+eoSelectOne
+
    It is clear that repeated selection of a single individual is a way
+to do batch selection. This is why it is possible to encapsulate an object
+of class eoSelectOne into an object of class
+eoSelect
+using the class eoSelectMany. Class eoSelectMany
+is derived from class eoSelect and takes in
+its constructor an eoSelectOne (plus the number
+of individuals it should select, according to the eoHowMany
+paradigm).
+
    Note: some procedures for selecting
+a single individual require some pre-processing of the whole population
+that takes place before any selection, and will be repeated identically
+for every individual. The encapsulation of an  into an  allows
+to call such technical processing only once through the use of method setup
+of class . This method does nothing by default, but is mandatory
+
    
+
    
+
    eoSelect: Other
+instances
+
      
+
    • 
+eoDetSelect selects individuals
+deterministically,
+i.e. starting from the best ones down to the worse ones. If the total number
+to select is less than the size of the source populations, the best individuals
+are selected once. If more individuals are needed after reaching the bottom
+of the population, then the selection starts again at top. It the total
+number required is N times that of the source size, all individuals are
+selected exactly N times.
      • 
+
    
+No other instances of eoSelect that are not
+encapsualtions of eoSelectOne procedures are
+avaiable as of today (Jan. 4 2001).
+
    
+
    
+
    Replacement
+
    The replacement phase takes place after the birth
+of all offspring through variation operators. This is the second
+step of the artificial Darwinism, where the
+fittest
+individuals are allowed to survive.
+
    It can also be viewed on the algorithmic side as closing the generation
+loop, i.e. building the population that will be the initial population
+of next generation. That population will be built
+upon the old parents and the new-born offspring. In all algorithms
+that come up with EO, the population size
+is supposed to be constant from one generation
+to the next one - though nothing stops you from writing an algorithm with
+varying population size.
+
    
+
    
+
    Replacement: The
+interface
+
    The abstract class for replacement procedures is the functor class
+eoReplacement,
+and the interface for its operator()
+is
+
    
+
    void operator()(eoPop<EOT>& _parents,
+eoPop<EOT>& _offspring)
    
+
+
    which you could have guessed from the inheritance tree for class eoReplacement.,
+as you see there that eoReplacement derives
+from class eoBF<eoPop<EOT>&, eoPop<EOT>&,
+void>.
+
    This means that it takes 2 populations
+(called, for obvious anthropomorphic reasons, _parents and _offspring :-)
+and is free to modify both, but the resulting population should be placed
+in the first argument (usually called_parents) to close the loop and go
+to next generation.
+
    
+
    
+
    Replacement: Instances
+
      
+
    • 
+eoGenerationalReplacement This
+is the most straightforward replacement, called generational
+replacement: all offspring replace all parents (used in Holland's
+and Goldberg's traditional GAs).  It takes no argument, and supposes
+that offspring and parents are of the same size (but does not check!).
      • 
+
+
       
+
    • 
+eoMergeReduce
+This is one the basic types of replacement in EO. It has two major steps,
+merging
+both populations of parents and offspring, and reducing
+this big population to the right size. It contains
+two objects of respective types eoMerge
+and eoReduce
+and you can probably guess what each of them actually does :-)
      • 
+
+
       
+
       
+
       
+
       
+
      Available instances of eoMergeReduce replacement
+include
+
        
+
      • 
+eoCommaReplacement, one of
+the two standard strategies in Evolution Strategies,
+selects
+the best offspring. It is an
+eoMergeReduce(eoNoElitism,
+eoTruncate).
        • 
+
+
      • 
+eoPlusReplacement, the other
+standard Evolution Startegies replacement,
+where the best from offspring+parents
+become the next generation. It is an eoMergeReduce(eoPlus,
+eoTruncate).
        • 
+
+
      • 
+eoEPReplacement, used in the
+Evolutionary Programming historical algorithm, does an EP stochastic
+tournament among parents + offspring. It is an eoMergeReduce(eoPlus,
+eoEPReduce) and its constructor requires as argument T,
+the size of the tournament (unsigned int).
        • 
+
      
+
+
    • 
+eoReduceMerge is another important
+type of eoReplacement: the parents are first reduced, and then merged with
+the offspring. Note that the parent population is reduced of the exact
+number of offspring.
      • 
+
+
      Though not mandatory, it is implicitely assumed that few offspring
+have been generated. Hence, all derived replacement procedures of class
+eoReduceMerge
+are termed eoSSGAxxx, as they
+are the ones to use in SteadyState Genetic Algorithm engine. This gives
+the following instances of eoReduceMerge:
+
        
+
      • 
+ eoSSGAWorseReplacement
+in which the worse parents are killed and replaced by all offsprings (no
+additional argument needed);
        • 
+
+
      • 
+eoSSGADetTournamentReplacement
+in which parents to be killed are chosen by a (reverse) determinitic tournament.
+Additional parameter (in the constructor) is the tournament size, an unsigned
+int.
        • 
+
+
      • 
+eoSSGAStochTournamentReplacement
+in which parents to be killed are chosen by a (reverse) stochastic tournament.
+Additional parameter (in the constructor) is the tournament rate, a double.
        • 
+
      
+
+
    • 
+eoSurviveAndDie
+replacement strategies are a generalization of both the above that allows
+strong elitist and eugenism in both the parent population and the offspring
+population. The eoSurviveAndDie
+building block takes one population, kills the worse and moves the best
+to some safe place.  The corresponding replacements apply an eoSurviveAndDie
+to the parents, another one to the offspring, and finally merges the remaining
+parents and offspring before reducing the resulting population to the right
+size. Available instances of eoSurviveAndDieReplacement
+are limited todayto the eoDeterministicSaDReplacement,
+the  that uses a deterministic MergeReduce.
      • 
+
+
       
+
       
+
       
+
       
+
      Note: The basic use (and initial
+motivation) for eoSurviveAndDie
+takes 2 arguments, an eoMergeReduce and a number of surviving parents.
+It starts by copying the best parents to the new populations, then merges
+the remaining parents with the offspring before reducing to the number
+of remaining seats in the new population.
    
+
+
    
+
    Replacement: Adding
+(weak) elitism
+
    You can add what is called weak elitism
+to any replacement by encapsulating it into an eoWeakElitismReplacement
+object. Weak elitism ensures that the overall best
+fitness in the population will never decrease:
+if the best fitness in the new population is less than the best fitness
+of the parent population, then the best parent is added back to the new
+population, replacing the worse.
+
    Within EO, this is very easy to add:
+
    First, declare your replacement functor (here, generational, but it
+can be any replacement object):
+
    eoGenerationalReplacement<Indi> genReplace;
+
    Then wrap the weak elitism around it:
+
    eoWeakElitismReplacement<Indi> replace(genReplace);
+
    and use now replace as your replacement procedure within your algorithm.
+
    Note: of course, adding weak elitism to
+an elitist replacement makes no sense - but will not harm either :-)
+
    
+
    
+
    Replacement: Test
+file
+
    The file t-eoReplacement
+in the test directory implements all
+above replacement procedures within a very simple and easy-to-monitor Dummy
+EO class.
+
    
+
    
+
    General
+Replacement: eoReduceMergeReduce
+
    In an attempt to unify all the well-known replacements, plus most of
+the less-known-though-often-used, the eoReduceMergeReduce
+replacement has been designed, and supersedes all of the above instances.
+
    It allows to implement strong elistism
+(i.e. some parents survive, whatever their fitness and that of the offspring),
+as well as multiple weak elistism (the best parents are put back in the
+next population if they outperform the best offspring).
+
    Basically, an eoReduceMergeReduce
+starts by eventually preserving the (strong) elite parents, proceeds by
+reducing both the parent and offspring populations, merges those populations,
+and eventually reduces the resulting populations (augmented with the elite
+parents) to the right size. Last, the weak elitism is taken care of if
+necessary.
+
    The following image, taken from the graphical interface of EASEA, somehow
+demonstrates the different parameters of an eoReduceMergeReduce.
+
    
+
    
+
    eoReduceMergeReduce: The 
+interface
+
    Of course the interface is that of eoReplacement. Let's concentrate
+on the constructor.
+
    The constructor takes 6 arguments:
+
      
+
    1. 
+eoHowMany elite determines
+the number of parents to be treated as elite (actual behavior determined
+by next parameter) using the eoHowMany behavior.
      2. 
+
+
    2. 
+bool strongElitism tells whether
+the elite above corresponds to strong (true) or false(weak) elitism.
      3. 
+
+
      Note: the case of no elitism is
+obtained by setting elite to 0
+
    3. 
+eoHowMany reducedParents gives
+the number of parents remaining after reducing them
      4. 
+
+
      Note: 0 means that no parent survive
+(except the possible elite), as in eoCommaReplacement
+
                 
+-1 is used inside eoSSGAReplacements
+(one parent is killed to make room for the newborn)
+
    4. 
+eoReduce<EOT> & reduceParents
+indicates how the parents will be reduced (see available
+instances).
      5. 
+
+
    5. 
+eoHowMany reducedOffspring gives
+the number of offspring remaining after reducing them
      6. 
+
+
      Note: 0 is impossible (no evolution!!!)
+
    6. 
+eoReduce<EOT> & reduceOffspring
+indicates how the offspring will be reduced (see available
+instances).
      7. 
+
+
    7. 
+eoReduce<EOT> & reduceFinal
+indicates how the merged reduced-parents/reduced-offspring will be reduced
+(see available instances).
      8. 
+
+
      Note: the number of individuals
+remaining after that reduction is of course the original size of the population.
    
+All popular evolution engines use some replacement procedure that can be
+viewed as an instance of an eoReduceMergeReduce.
+
    Moreover, a parser-based input
+of a general  is proposed in file do/make_checkpoint.h.
+
    
+
    
+
    Popular
+evolution engines
+
    The most popular evolution engines are listed below, together with the
+way to use them in EO. If you don't find your particuler algorithm, please
+send it to us, and we might include it here! In the following, P will denote
+the number of individuals in the initial population.
+
      
+
    • 
+Generational Genetic Algorihtm:
+popularized by Holland (75) and Goldberg (89), it uses
      • 
+
+
      Number of offspring: 
+P
+
      Selection: Proportional
+(the historical roulette wheel) when maximizing
+a positive scalar fitness, ranking or
+tournament (stochatic or deterministic) in all cases.
+
      Replacement: Generational.
+
      Remark: You could
+use also the eoCommaReplacement,
+with exactly the same result as there are as many offspring as we need
+indiviudals in the next population. And using the eoSSGAWorseReplacement
+would also give the same result, but would be very inefficient!
+
      You can also add weak
+elitism to preserve the best individual.
+
    • 
+Steady-State Genetic Algorithm:
+widely used in GA/GP community
      • 
+
+
      Number of offspring: 
+small (historically, 1)
+
      Selection: tournament
+(you can use ranking or proportional, but it will be rather inefficient).
+
      Replacement: An
+eoSSGAxxxReplacement.
+
      Remark: You can
+also use the eoPlusReplacement, but you divert from the original SSGA
+
    • 
+(MU+Lambda)-Evolution Strategy:
+The elitist ES strategy (Rechenberg 71 and Schwefel 81)
      • 
+
+
      Number of offspring: 
+Any
+
      Selection: eoDetSelect
+(batch deterministic).
+
      Replacement: eoPlusReplacement
+
      Remark: You could
+also use eoEPReplacement, to smoothen the selective pressure during replacement,
+thus getting close to EP evolution engine
+
    • 
+(MU,Lambda)-Evolution Strategy:
+The non-elitist ES strategy
      • 
+
+
      Number of offspring: 
+> P
+
      Selection: eoDetSelect
+(batch deterministic).
+
      Replacement: eoCommaReplacement
+
      Remark: You can
+also add weak elitism to preserve the best individual
+- though you'd probably use the plus strategy if you want (strong) elitism.
+
    • 
+Evolutionary Programming:
+The historical method of L. Fogel (65)
      • 
+
+
      Number of offspring: 
+P
+
      Selection: eoDetSelect
+(batch deterministic). Every individual reproduces exactly once.
+
      Replacement: eoEPReplacement,
+though one historical replacement was the determnistic replacement - i.e.
+in EO the eoPlusReplacement).
+
      Remark: Close to
+an (P+P)-ES
+
    • 
+You name it :-):
+you can of course choose whatever combination you like - respecting a few
+constraints and common-sense remarks. For instance, eoProportionalSelect
+should be used only when maximizing a positive fitness, eoCommaReplacement
+requires more offspring than parents, and, over all, existing EO algorithms
+wirk with fixed size population - and it is your responsability to use
+a cmbinatino of selection/replacement that fulfills this requirement (or
+to create your own eoAlgo that handles varying size populations).
      • 
+
    
+
+
    
+
    Tournaments
+
    Tournaments are an easy and quick way to select
+individuals within a population based on simple comparisons. Though usually
+based on fitness comparisons, they can use any comparison operator.
+
    In EO, there are two variants of tournaments used to select one single
+individual, namely Deterministic Tournament
+and Stochastic Tournament,
+that are used in selection and in replacement procedures, and a global
+tournament-based selection of a whole bunch of individuals, the EP
+Tournament. Though the single-selection tournaments can
+be repeated to select more than one individual, and the batch tournament
+selection can be used to select a single individual, both uses are probably
+a waste of CPU time.
+
      
+
    • 
+Deterministic
+Tournament of size T returns the best of T uniformly chosen
+individuals in the population. Its size T should be an integer >= 2. It
+is implemented in the eoDetTournamentSelect
+class, a sub-class of eoSelectOne, as well as in the eoDetTournamentTruncate
+class that repeatidly removes from the population the "winner" of the inverse
+tournament.  These objects use the C++ function determinitic_tournament
+in  selectors.h.
      • 
+
+
    • 
+Stochastic Tournament
+of rate R first choses two individuals from the population, and selects
+the best one with probability R (the worse one with probability 1-R). Real
+parameter R should be in [0.5,1]. It is implemented in the eoStochTournamentSelect
+class, a sub-class of eoSelectOne, as well as in the eoStochTournamentTruncate
+class that repeatidly removes from the population the "winner" of the inverse
+tournament.  These objects use the C++ function determinitic_tournament
+in  selectors.h.
      • 
+
+
      Note: A stochastic tournament with
+rate 1.0 is strictly identical to a deterministic tournament of size 2.
+
    • 
+EP Tournament
+of size T is a global tournament: it works by assigning a score to all
+individuals in the population the following way: starting with a score
+of 0, each individual I is "opposed" T times to a uniformly chosen individual.
+Everytime I wins, its score in incremented by 1 (and by 0.5 for every draw).
+The individuals are then selected deterministically based on their scores
+from that procedure. The EP Tournament
+is implemented in the  eoEPReduce
+truncation method used in the eoEPReplacement
+procedure.
      • 
+
+
      Note: whereas both the determinitic
+and the stochastic tournament select one individual, the EP tournament
+is designed for batch selection. Of course it could be used to select a
+single individual, but at a rather high computational cost.
    
+
+

    
+
    
+
    Merging
+populations
+
    In replacement procedures, one frequently needs to merge two populations
+(computed form old parents and new-born offspring). Classes derived from
+the abstract class eoMerge are written for that purpose.
+
    
+
    
+
    eoMerge: interface
+
    The abstract class for merging procedures is the functor class
+eoMerge,
+and the interface for its operator()
+is
+
    
+
    void operator()(const eoPop<EOT>&
+_parents, eoPop<EOT>& _offspring)
    
+
+
    which you could have guessed from the inheritance tree for class eoMerge,
+as you see there that eoMerge derives from
+
    class eoBF<const eoPop<EOT>&, eoPop<EOT>&,
+void>.
+
    This means that it takes 2 populations
+and modifies the seond one by adding some individuals from the first one
+(which is supposed to remain constant).
+
    
+
    
+
    eoMerge: instances
+
    Available instances of eoMerge objects
+are eoPlus, that simply adds
+the parents to the offspring, or eoElitism,
+that adds only some of the (best) parents to the offspring. A special case
+of eoElistism is eoNoElitism,
+an eoMerge that does nothing.
+
    
+
    
+
    Reducing
+populations
+
    The other useful component of replacement procedures, eoReduce,
+kills
+some individuals from a given population.
+
    
+
    
+
    eoReduce: interface
+
    The abstract class for reducing procedures is the functor class
+eoReduce,
+and the interface for its operator()
+is
+
    
+
    void operator()(eoPop<EOT>& _parents,
+unsigned int new_size)
    
+
+
    which you could have guessed from the inheritance tree for class eoReduce,
+as you see there that eoReduce derives from
+
    class eoBF<eoPop<EOT>&, unsigned
+int, void>.
+
    An eoReduce shoud take a
+population and shrink it to the required size.
+
    
+
    
+
    eoReduce: instances
+
    Available instances of eoReduce are
+
      
+
    • 
+eoTruncate, deterministically
+kills the worse individuals, keeping only the required number. It starts
+by sorting teh populations, and hence does modify
+its order.
      • 
+
+
    • 
+eoLinearTruncate, deterministically
+kills the worse individuals, keeping only the required number. It does
+so by repeatedly removing the worsr individual. Hence does not
+modify its order, but takes longer time than eoTruncate
+in case of many offspring.
      • 
+
+
    • 
+eoEPReduce, uses the EP
+stochastic tournament to reduce the population. It requires an additinal
+argument, the tournament size.
      • 
+
+
    • 
+eoDetTournamentTruncate uses
+inverse deterministic tournament to repeatidly kill one individual until
+the propoer size is reached. As eoLinearTruncate,
+it might take some time in the case of many offspring. It requires the
+size of the tournament (unsigned int)
+as parameter in the constructor (default is 2).
      • 
+
+
    • 
+eoStochTournamentruncate 
+uses inverse stochastic tournament to repeatidly kill individuals from
+the population. It requires the rate of the tournament (double)
+as parameter in the constructor (default is 0.75).
      • 
+
    
+
+
    
+
    eoHowMany:
+Choosing a number of individuals
+
    Many classes in selection/replacement procedures will handle a number
+of individuals that may either be fixed or be related to some argument-population
+size.
+
    Of course, it is possible to write different classes that will only
+differ by the way they compute the number of individuals they have to treat,
+as it is done for selectors with the two classes eoSelectPerc
+and eoSelectNumber (it could also have been
+possible to have some pure abstrat class and implement the computation
+of the number of individuals to treat in some derived classes).
+
    However, the class eoHowMany
+allows one to handle in a single class three different behaviors when given
+a poopulatio size as argument:
+
      
+
    • 
+return a given rate of the argument population size
      • 
+
+
    • 
+return an absolute (unsigned) integer, whatever the argument population
+size
      • 
+
+
    • 
+return the argument population size minus a given number
      • 
+
    
+
+
    
+
    eoHowMany: interface
+
    The class interface for its operator()
+is
+
    
+
    unsigned int operator()(unsigned int _pop_size)
    
+
+
    which you could have guessed from the inheritance tree for class eoHowMany,
+as you see there that eoHowMany
+derives from
+
    class eoUF<unsigned int, unsigned int>.
+
    It has 3 possible constructors, that determine its behavior:
+
      
+
    • 
+eoHowMany(double _rate, bool _interpret_as_rate
+= true) where _rate
+is by default the fixed rate of behavior 1 above. However, if the boolean
+second argument is false, the rate is transformed into a positive integer,
+and is used for behavior 2 above
      • 
+
+
    • 
+eoHowMany(int _combien): if
+_combien
+is positive, it is the absolute number of behavior 2 above, and if _combien
+is negative, its absolute value is used to decrease the argument population
+in behavior 3 above
      • 
+
+
    • 
+eoHowMany(unsigned int _combien):
+_combien
+(positive!)  is the absolute number of behavior 2 above. Note
+that this constructor is mandatory to avoid ambiguity, as an unsigned int
+can be casted to either an int or a double.
      • 
+
    
+It is used in eoSelectMany (which supersedes
+eoSelectPerc
+and eoSelectNumber, but they are left there
+for tutorial reasons!) as well as in many truncation
+methods, and it is used a lot in the eoGeneralReplacement construct.
+
    
+
    
+
    Survive and
+Die
+
    This class is highly politically incorrect: it implements strong elitism
+and eugenism :-)
+
    It starts by killing the worse individuals from the source argument,
+then appends the best ones to the destination argument and removes them
+from the source argument. It is used in eoSurviveAndDieReplacement,
+where the same dest is used successively for the parents and the offspring.
+
    eoSurviveAndDie: interface
+
    The class interface for its operator()
+is
+
    
+
    void operator()(eoPop<EOT>& _source,
+eoPop<EOT>& _dest)
    
+
+
    which you could have guessed from the inheritance tree for class eoSurviveAndDie,
+as you see there that eoSurviveAndDie
+derives from class eoBF<eoPop<EOT>&,
+eoPop<EOT>&, void>.
+
    Its constructor takes 3 argumenrts:
+
    
+
    eoHowMany(double _survive, double _die,
+bool _interpret_as_rate = true)
    
+
+
    to indicate how many (or what proportion, according to _interpret_as_rate)
+of the source should be copied to the dest population, and how many (or
+what proportion, according to _interpret_as_rate) 
+should be erased from the source.
+
    
+
    Local: Introduction 
+- Selection - Replacement
+- General Replacement - Popular
+evolution engines - Tournaments - Merge
+- Reduce - HowMany - SurviveAndDie
+
    
+
    
+
    General: Algorithm-Based
+- Component-Based - Programming
+hints - EO
+documentation
+
    
+
    
+Marc Schoenauer
    
+
+
    Last
+modified: Tue. Jan. 9 2001 
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/eoEval.html b/trunk/paradiseo-eo/tutorial/html/eoEval.html
new file mode 100644
index 000000000..4a90ac330
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/eoEval.html
@@ -0,0 +1,34 @@
+
+
+  
+    Evaluation
+  
+
+ 
+Tutorial main page -
+Algorithm-Based
+page - Component-Based - Programming
+hints - EO documentation
+
    
+
    
+
+
    
+    
    Evaluation
    
+
    
+
+
+
+
    
+
    
+Tutorial main page -
+Algorithm-Based
+page - Component-Based - Programming
+hints - EO documentation
+    
    
+    
    Marc Schoenauer
    
+
+
+Last modified: Mon Nov  6 10:54:33 CET 2000
+
+  
+
diff --git a/trunk/paradiseo-eo/tutorial/html/eoGeneration.html b/trunk/paradiseo-eo/tutorial/html/eoGeneration.html
new file mode 100644
index 000000000..39cfe3da0
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/eoGeneration.html
@@ -0,0 +1,19 @@
+
+
+  
+    Generation
+  
+
+  
+    
    Generation
    
+
+
+
+    
    
+    
    Marc Schoenauer
    
+
+
+Last modified: Mon Oct 30 19:29:29 CET 2000
+
+  
+
diff --git a/trunk/paradiseo-eo/tutorial/html/eoInit.html b/trunk/paradiseo-eo/tutorial/html/eoInit.html
new file mode 100644
index 000000000..3a4df155c
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/eoInit.html
@@ -0,0 +1,36 @@
+
+
+  
+    Initialization
+  
+ 
+Tutorial main page -
+Algorithm-Based
+page - Component-Based - Programming
+hints - EO documentation
+
    
+
    
+
+
+
    
+
    
+Initialization
    
+
+
+
+
+
+
    
+
    
+Tutorial main page - Algorithm-Based
+page - Component-Based - Programming
+hints - EO documentation
+
    
+
    
+Marc Schoenauer
    
+
+
+Last modified: Mon Nov  6 11:25:18 CET 2000
+
+  
+
diff --git a/trunk/paradiseo-eo/tutorial/html/eoIo.html b/trunk/paradiseo-eo/tutorial/html/eoIo.html
new file mode 100644
index 000000000..14e0d37c1
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/eoIo.html
@@ -0,0 +1,25 @@
+
+
+  
+    Input / Output
+  
+
+  
+    
    Input / Output
    
+
+
    
+
+
    Stopping criteria
    
+
+
    
+
+
    Displaying statistics
    
+
+    
    
+    
    Marc Schoenauer
    
+
+
+Last modified: Tue Oct 31 18:32:22 CET 2000
+
+  
+
diff --git a/trunk/paradiseo-eo/tutorial/html/eoLesson1.html b/trunk/paradiseo-eo/tutorial/html/eoLesson1.html
new file mode 100644
index 000000000..f88921015
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/eoLesson1.html
@@ -0,0 +1,440 @@
+
+
+
+   
+   
+   Tutorial: Lesson 1
+
+
+Lesson 2 -
+Tutorial
+main page -
+Algorithm-Based - Component-Based
+- Programming hints -EO
+documentation
+
    
+
    
+
    
+
    
+Tutorial: Lesson 1
    
+This lesson will let you
+
      
+
    • 
+run your first Evolutionary Algorithm written within
+EO Library, choosing between evolving bitstrings,
+or evolving vectors of real numbers,
      • 
+
+
    • 
+browse through the code of these algorithms, or
      • 
+
+
    • 
+follow the guided tour.
      • 
+
    
+Later you will be asked to
+
      
+
    • 
+write your own fitness function,
      • 
+
+
    • 
+check that EO let you separate the representation
+from the evolution engine.
      • 
+
+
    • 
+use different kinds of selection
+procedures in the framework of a generational GA evolution
+engine,
      • 
+
    
+
+
    
+
+
    I want to run
+an Evolutionary Algorithm
+now
    
+You can choose to run a standard bitstring Genetic
+Algorithm (as defined in Goldberg's book) or a standard real-valued
+genetic algorithm, as proposed in Micahlewicz's book.
+
    If you have not already done what was recommended in the Tutorial
+main page , do it NOW. Then go
+to the Lesson1 sub-dir of the tutorial dir, and simply type at the system
+prompt
+
    (myname@myhost) EOdir/Tutorial/Lesson1 % FirstRealGA
+
    or
+
    (myname@myhost) EOdir/Tutorial/Lesson1 % FirstBitGA
+
    and something should happen.
+
    
+What is happening?
    
+At the moment, the FirstBitGA maximizes the
+number of ones in the bitstring (also calls the OneMaxfunction,
+whose solution is, as you can guess,
+11111111),
+and the FirstRealGA is maximizing (the default
+action for EO is to maximize) the inverse of the sum (i.e. minimizing the
+sum) of the square of its variables (also called the sphere
+function, whose solution is ... all zeroes).
+
    And what you see on the screen when running one of these two programs
+is, in each case, the initial and final population of an Evolutionary run,
+one individual per line, its fitness first, then the number of items (bits
+or real numbers) of the genotype, and the genotype itself. The final population
+hopefully contains the solution in the discrete case, and is close to it
+in the continuous case.
+
    
+
    Browsing
+the code:
+
    Now you need to take a look at the program codes, either by browsing
+alone through the  sources for FirstBitGA
+and FirstRealGA, or by following the guided
+tour below. You might prefer to go directly to the exercises.
+
    
+
+
    Guided tour:
    
+
+
      
+
    • 
+General includes:Like
+all C-like code, the file starts with include directives (Bit
+- Real). Apart from standard includes,
+the specific file to include is eo:
+this is a file that contains the list of the all important representation-independent
+EO files.
      • 
+
+
       
+
    • 
+Representation:
+you then have to declare the type of individuals you will be handling.
+All evolution-related objects you will need are templatized w.r.t. the
+type of individuals.
      • 
+
+
+
+
    • 
+Fitness function:
+the code for the fitness function is included in the file. It must take
+as argument a reference to an individual (at the moment).
      • 
+
+
        
+
      • 
+Bit This function simply computes
+the number of ones of the bitstring (it's called the OneMax function).
+The optimum is of course the all-ones bitstring.
        • 
+
+
      • 
+Real This function simply computes
+the inverse of the sum of the squares of all variables (also called the
+sphere function). The optimum is of course the all-zeroes vector.
        • 
+
+
         
      
+
+
    • 
+Parameters:
+all parameters of the algorithm are declared here (Bit
+- Real), and their values and
+assigned. Of course, this means that you will need to recompile to change
+these values - see Lesson 3 to get rid of that heavy requirement.
      • 
+
+
       
+
    • 
+Random seeding:
+Random numbers play an important role in Evolutionary Algorithms. See in
+EO
+programming hints more details about how this is simulated in EO -
+but as far as you are concerned now, remember that the global
+Random Number Generator is called rng
+and should be used everywhere you need a realization of a random variable
+of known law. Moreover, this RNG requires a seed,
+which is set here (Bit - Real):
+every time you run the algorithm with the same
+seed, you will get the same
+result. Hence, to test the robustness of your
+algorithm, you should run it with different seeds. This is rather time
+consuming in the present programs, so we suggest that you wait until Lesson
+3 to do so.
      • 
+
+
       
+
    • 
+Fitness function encapsulation: EO
+is based on the notion of functors
+- hence you now need to encapsulate your fitness function into a functor
+object. This is what is done here (Bit
+- Real).
      • 
+
+
       
+
    • 
+Initialization:
+to initialize the population, first declare an empty object of class eoPop<Indi>,
+which is basically an STL vector<Indi>,
+then fill it with Indi's. And remember that
+v.push_back
+simply appends its argument at the end of STL
+vector v.
      • 
+
+
+
+
    • 
+Output: take
+a snapshot at the initial population (Bit
+- Real). Sort it first, so the best
+individuals are first, and display it. Note that an eoPop has a <<
+method, which means that a simple os
+<< pop streams the pop
+onto the ostream os.
+This is true for all objects of of class eoPrintable
+(most EO objects) through the method printOn
+(which is then called by the <<
+operator).
      • 
+
+
       
+
    • 
+Evolution engine:
+The selection/replacement mechanism (Bit
+- Real) is a simple generational
+GA here: a simple selector, and a generational replacement. The eoDetTournamentSelect
+has been chosen as a robust selection, and the generational replacement
+(all parents are replaced by the offspring) is hard-coded in the eoSGA
+algorithm.
      • 
+
+
       
+
    • 
+Variation operators:
+in the simple algorithm considered here, individuals undergo crossover
+and mutation.
+In EO, these operators are (functor)
+objects of class eoQuadOp
+(binary operator that modifies both its arguments) and eoMonOp
+(unary operator).  These operators are applied in turn to all selected
+parents, according to user-defined probabilities.  These probabilities
+are defined with all other parameters, and will
+be passed to the eoSGA algorithm. 
+For more details on these classes, go to the algorithm-based
+corresponding pages, or to their respective documentation pages.
      • 
+
+
       
+
        
+
      • 
+Bit The crossover eo1PtBitXover
+is the standard 1-point crossover, and eoBitMutation
+is the standard bit-flip mutation that randomly
+flips all bits with a given probability P_MUT_PER_BIT.
        • 
+
+
        Warning: the P_MUT_PER_BIT
+probability is an internal parameter of the
+eoBinMutation,
+it is NOT the probability of mutation
+at the individual level. EO corrects what can be viewed as an inconsistency
+in Holland's original work, further used in Goldberg's book by separating
+the probability of mutation for each individual (independent of the type
+of mutation that will be applied) from the probability of flipping each
+bit, which is specific of the bit-flip mutation.  Hence, to run the
+same algorithm as Goldberg's SGA, the mutation probability (at individual
+level) is 1, and the probability of flipping each bit is P_MUT_PER_BIT.
+
      • 
+Real The crossover eoSegmentCrossover
+is the standard segment crossover for real-valued
+vectors, that chooses a point randomly on the segment between both parents
+(also termed BLX-0). eoUniformMutation
+is the uniform mutation for real-valued vectors
+that chooses a new value for each variable uniformly on an interval centered
+on the parent value. The width of the interval is an internal
+parameter of the object, here called EPSILON.
        • 
+
+
         
      
+
+
    • 
+Stopping criterion:
+Specify a maximum number of generations
+to run (Bit - Real):
+the simplest of all stopping criteria at the moment, using an object of
+a sub-class of class eoContinue.
      • 
+
+
       
+
    • 
+The algorithm: the
+simple algorithm that is used here, called  eoSGA
+requires
+as parameters a selector,
+a crossover and
+the associated crossover rate,
+a mutation and
+the associated mutation rate,
+and a stopping criterion.
+Take a look at the corresponding
+constructor
+of the class eoSGA:
+it only initializes its private data
+with the parameters. Now look at the operator()
+method - the one that is called in the code for FirstBitGA
+or FirstRealGA - and you'll find
+out that is is as simple as it sounds.
      • 
+
+
       
+
    • 
+Output: After
+running the algorithm, output the sorted final population (Bit
+- Real) - and look at the best
+individual: this is the result of the algorithm.
      • 
+
+
       
+
    • 
+Main body: for
+technical reasons (intercepting the exceptions), we need a main like this
+one (Bit - Real).,
+and you should not touch it unless you know what you are doing. Simply
+note that this main calls the function main_function, which we have been
+discussing up to now!
      • 
+
    
+
+
    
+
+
    Exercise
+1: maximize your own function
    
+This is very easy - if your search space is that of bitstring or of unbounded
+real numbers.
+
      
+
    • 
+Go to the tutorial directory, and copy the
+program you want to modify onto mytest.cpp.
      • 
+
+
    • 
+Edit mytest.cpp
+with any text editor:
      • 
+
+
    • 
+Modify the fitness function itself (binary_value
+in FirstBitGA,real_value
+in  FirstRealGA)
      • 
+
+
    • 
+Compile the program by typing make
+mytest at system prompt
      • 
+
+
    • 
+Run the new program by entering the command
+mytest
+at system prompt.
      • 
+
    
+
+
    
+
+
    Exercise
+2: check the differences between both programs
    
+Go and take a look at the code for these programs (Bit
+- Real). Use the symbolic representation
+of an Evolutionary Algorithm (you should understand that figure now, otherwise
+go there and come back) to understand how each
+part of the EA is coded. Try to spot the differences between both codes:
+there are not so many!
+
    After you've tried that alone, take a look at the solution
+:-)
+
    
+
+
    Exercise
+3: change the selection procedure
    
+This is rather straightforward ... if you know what other types of selection
+are available!
+
    At the moment, let's only consider only the following simple ones:
+
      
+
    • 
+You already know the tournament selection
      • 
+
+
      Syntax:  eoDetTournamentSelect<Indi>
+select(T_SIZE);   // T_SIZE in [2,POP_SIZE)
+
    • 
+Try the well-known roulette wheel
      • 
+
+
       Syntax:    eoProportionalSelect<Indi>
+select;
+
    • 
+Or the stochastic binary tournament
      • 
+
+
      Syntax:  eoStochTournamentSelect<Indi>
+select(RATE);    
+// RATE in ]0.5,1]
+
    • 
+and of course the random selection should
+give bad results!
      • 
+
+
      Syntax:  eoRandomSelect<Indi>
+select;
    
+Note that all these classes of eoObjects are derived from the abstract
+class
+eoSelectOne.
+To find out exactly how each procedure selects the individuals, read the
+corresponding component-based page.
+
    
+
    Lessons learned:
+
      
+
    • 
+in EO, all actions are performed by functor
+objects (this section is the last time in this tutorial that there
+is a direct link to the EO Programming hints
+page - though the link at top and bottom of all pages will remain there).
      • 
+
+
    • 
+in EO, all object you will usually need to manipulate are templatized
+w.r.t. the type of the individual you are handling.
      • 
+
+
    • 
+The type of the individual is itself templatized
+w.r.t. the type of fitness (double by default).
      • 
+
+
    • 
+In EO (actually, in EC!) initialization and variation
+operators are representation-dependent, while
+the evolution engine is representation-independent
+(well, like any rule, this one does have some exceptions).
      • 
+
+
    • 
+Changing the fitness function, or the selection
+procedure inside the generational GA evolution engine is straightforward.
      • 
+
+
    • 
+remember, all solutions to exercises are in
+the same sub-dir of dir Tutorial than the lesson itself (see here).
      • 
+
    
+
+
    Lesson 2 -
+Tutorial
+main page -
+Algorithm-Based - Component-Based
+- Programming hints - EO
+documentation
+
    
+
    
+
    
+Marc Schoenauer
    
+
+
    Last
+modified: Fri Nov 3 18:49:12 CET 2000
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/eoLesson2.html b/trunk/paradiseo-eo/tutorial/html/eoLesson2.html
new file mode 100644
index 000000000..6b3cf4580
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/eoLesson2.html
@@ -0,0 +1,357 @@
+
+
+
+   
+   
+   Tutorial: Lesson 2
+
+
+
+Lesson 1 -
+Lesson
+3 -
+Main page -
+Algorithm-Based
+- Component-Based - Hints
+- EO
+documentation
+
    
+
    
+
    
+
    
+Tutorial Lesson 2: more encapsulations
    
+In this lesson, the same Evolutionary Algorithm will be rewritten in a
+much more general context.
+
    First, look at the changes that have been done
+to the algorithms. Then benefit from the new features by
+
      
+
    • 
+minimizing (and not only maximize) the fitness
      • 
+
+
    • 
+combining several
+operators of the same type
      • 
+
+
    • 
+combining several
+stopping criteria
      • 
+
+
    • 
+use alternate selection/replacement
+engines, deviating from the pure generational GA
      • 
+
    
+
+

    Again, two basic algorithms are provided, namely FirstBitEA
+and FirstRealEA.
+
    To compile and run them, go to the Lesson2
+sub-directory of the tutorial dir and simply type make.
+Both examples should get compiled, and you can then run them by calling
+their name from the system prompt.
+
    Note the slim difference in names, from GA
+to EA: the behavior of these  EAs is
+almost identical to that of their GA counterpart, at least with the default
+settings that are provided. But their potentialities for easy modifications
+are much larger, both in terms of variation operators
+and of evolution engine (i.e. selection/replacement
+mechanism). 
+
    Changes
+
    Browse through the code, and discover them one after the other:
+
      
+
    • 
+The fitness function
+now
+lies in a separate file
+(Bit
+- Real). But, more important, its
+argument is a vector<bool> or a vector<double>,
+and not an unknown type. This will allow to use the same file for any EO
+object that is a sub-class of the corresponding STL vector class.
      • 
+
+
       
+
       
+
      Note: Also,
+a non-templatized fitness can be compiled
+separately (not done here) into an object
+file once and for all (remember
+that templates forbid that).
+
       
+
    • 
+The encapsulation
+of
+the fitness (Bit
+- Real) looks more complicated: you
+have to declare 3 template arguments: the type of EO object it will be
+applied to, the return type and the type of argument the function actually
+requires.
      • 
+
+
       
+
       
+
      Note: In the
+previous files (Bit - Real)
+, the last 2 types were deduced from the first (2nd argument = fitness
+type of EO object, third = first).
+
       
+
    • 
+Both the above modifications makes it very easy to
+minimize
+rather than maximize a fitness function (see Exercise
+1).
      • 
+
+
       
+
    • 
+The initialization
+of the population is now encapsulatedinto
+a separate initializer (based
+on a boolean generator or a double-number
+generator -see random_generators.h)
+that is then used in the constructor of the population to build the individuals.
+You can also use different initializers and call them in turn through the
+call to pop.append() function
+(see Exercise 2).
      • 
+
+
       
+
       
+
      Note: Don't
+forget to evaluate the population:
+the eoPop has no idea of the eval function, so it has to be done from outside!!!
+
       
+
    • 
+You can now use
+different
+crossover
+and
+mutation
+operatorsin the same algorithm,
+choosing among them according to
+relative
+weights. The
+class eoPropCombinedxxxOp,
+where
+xxx is either Mon (for mutations, of class eoMonOp)
+or Quad (for crossovers, of class eoQuadOp),
+is derived from the corresponding eoxxxOp class. When applying the eoPropCombinedxxxOp,
+one of the eoxxxOp it contains is chosen by a roulette
+wheel, according to their respective rates, and is applied to the arguments.
+For more details on these classes, go to the algorithm-based
+corresponding pages, or to their respective documentation pages.
      • 
+
+
        
+
      • 
+Bit
        • 
+
+
        Three crossover
+operators are available: the one-point
+crossover is still there (class ), but now you also have the N-point
+crossover eoBinNxOver
+(the  number of points is 2 by default, but as always you can change
+that in the constructor), and the Uniform
+crossover eoBinUxOver
+(where you can eventually twidle the choice from one parent to the other
+by providing a probability in the constructore - defaulted to 0.5, which
+amounts to symmetrical choice).
+
        As for mutation
+operators, apart from the eoBinMutation
+(standard bitstring mutation flipping one bit with a given probability)
+you can also use the eoDetBitFlip
+that always filps the same number of bits (1 by default, but you can change
+that in the constructor), randomly chosen in the bitstring. Even though
+the average number of bits flipped is the same if the eoBinMutation
+is
+used with a rate of 1/N (N is the bitstring length) the
+behavior of these mutation can be very different
+on many problems.
+
      • 
+Real
        • 
+
+
        Two crossover
+operators are available: the eoSegmentCrossover
+chooses one point uniformly on the segment joining the parents, while the
+eoHypercubeCrossover
+performs a linear combination on each coordinate independently, which amount
+to choosing the offspring uniformly in the hypercube whose diagonal is
+the segment joining the parents.
+
        As for mutation
+operators, apart from the eoBinMutation
+(standard bitstring mutation flipping one bit with a given probability)
+you can also use the eoDetBitFlip
+that always filps the same number of bits (1 by default, but you can change
+that in the constructor), randomly chosen in the bitstring. And last but
+not least, the normal mutation eoNormMutation modifies all coordinates
+with a Gaussian noise, with standard deviation passed in the constructor.
      
+Note: A third optional argument in
+method add is a boolean (defaulted
+to false). When true, the actual rates for all operators are displayed
+on the screen as percentages: you don't have to input rates that sum up
+to 1, all rates are scaled anyway.
+
      Note: The
+operators have to be encapsulated into an eoTransform
+object (Bit - Real)
+to be passed to the eoEasyEA algorithm.
+The eoSGATransform is a simple
+eoTransform
+that does exactly the same thing than eoSGA:
+each pair from the selected parents undergoes the crossover
+operator with given probability, and all individuals (after crossover
+eventually) undergo mutation with given probability.
+The arguments to the eoSGATransform
+are an eoQuadOp with its probability
+and an eoMonOp with the associated
+probability.
+
       
+
    • 
+You can use combinations
+of
+several stopping criteria by using an object of the class eoCombinedContinue
+(Bit
+- Real). Initialize it with an object
+of class eoContinue, and
+add
+as many of other such objects as you wish. And as an eoCombinedContinue
+is
+an eoContinue,
+simply pass it to the algorithm (Bit
+- Real). To find out more, and
+to get the list and syntax of existing eoContinue subclasses, check out
+the corresponding component-based
+page.
      • 
+
+
       
+
    • 
+The
+full selection/replacement mechanism is
+now in place through the eoEasyEA
+algorithm.
      • 
+
+
      This means that you can use different selectors.
+which was already true in Lesson 1, but also different replacement
+strategies (see Exercise 3) whereas generational
+replacement was hard-coded in the algorithm eoSGA
+used in Lesson1.
+
      Beware that we have to encapsulate  (Bit
+- Real) the eoDetTournament,
+which is of class eoSelectOne (i.e. allows
+to select one individual from a population, its operator()
+returning a single individual) into an object of the eoSelectPerc
+(perc stands for percentage) which allows to select a ... percentage of
+a population (his operator() 
+returns a population). This was done internally in the  constructor
+of eoSGA  - see lesson1.
    
+
+
    Exercise
+1: minimizing
+
    Modify the algorithm so that it minimizes the
+fitness.
+
      
+
    • 
+For the bitstring case, you only have to modify the
+declaration
+of the representation, using eoMinimizingFitness
+instead of double.
+But is that really all? Give it a try, look at the output, and do it right
+the second time!!!
      • 
+
+
    • 
+For the real-valued problem, you also need to modify
+the file real_value.h so
+that it returns the sum of squares instead of its inverse. And again there
+is something else to modify...
      • 
+
    
+Exercise
+2: initialization
+
    Use different initializers: for instance, on
+the real-valued sphere function minimization, try to initialize half of
+the population in [-2,-1] and the other half in [1,2], with and without
+the segment and hypercube crossovers (and for large values of VEC_SIZE,
+the size of the vectors). Amazing, isn't it! Explain that result.
+
    Exercise
+3:  full selection/replacement
+
    You can now twiddle the number of offspring that
+will be generated from the parents. But of course you need to adjust the
+replacement to keep a constant population size.
+
      
+
    • 
+To modify the number
+of offspring, use the second argument of the
+encapsulator
+(Bit - Real)
+of the selector
+of class eoSelectOne
+into an eoSelectPerc object. For instance, try
      • 
+
+
                     
+eoSelectPerc<Indi> select(selectOne,2.0)
+
      to generate twice as many offspring as there
+are parents.
+
      You can also use the other encapsulator that
+takes as second argument an absolute number (e.g. if you want to generate
+2 offspring whatever the population size):
+
                     
+eoSelectNumber<Indi> select(selectOne,2)
+
      Or you can use the HowMany
+paradigm and the eoSelectMany to
+do either one depending on some command-line input (advanced).
+
    • 
+To keep a constant population
+size, you can use either the eoCommaReplacement
+class, or the eoPlusReplacement.
+The former selects the best offspring to replace the parents, the latter
+selects the best among parents+offspring. Of course you cannot use eoCommaReplacement
+if you have less offspring than parents!
      • 
+
+
      Now if you use eoSelectRandom
+as selector with a rate of
+lambda, you end up with exactly the (mu+lambda)
+or
+(mu,lambda) strategies from Evolution
+Strategies.
+
    • 
+Question: what do you
+get if you select 1 offspring only, and an eoPlusReplacement
+strategy? Yes, you get almost the replace_worst Steady-State GA, though
+rather inefficient, as you sort the population at every generation.
      • 
+
+
    • 
+Hint: there are a few
+Steady-State replacement strategies already there in EO. See the Replacement
+page.
      • 
+
    
+Remember: all solutions
+are in the same sub-directory of the Tutorial dir than the examples (i.e.
+here Lesson2), and are described here.
+
    
+
    
+
    Lessons learned:
+
      
+
    • 
+How to write a fitness function that only
+needs a genotype, not a full individual. Moreover you can compile it separately.
      • 
+
+
      How to initialize the population using
+random generators
+
    • 
+How to use other evolution engine than the
+simple generational GA.
      • 
+
+
    • 
+How to combine different objects of the same kind into a single object
+that you can use like a simple basic object (operators
+and stopping criteria here).
      • 
+
    
+
+
    Lesson 1 -
+Lesson
+3 -
+Main page -
+Algorithm-Based
+- Component-Based - Hints
+- EO
+documentation
+
    
+
    
+
    
+Marc Schoenauer
    
+
+
    Last
+modified: Fri Nov 3 18:49:12 CET 2000
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/eoLesson3.html b/trunk/paradiseo-eo/tutorial/html/eoLesson3.html
new file mode 100644
index 000000000..40c36e118
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/eoLesson3.html
@@ -0,0 +1,565 @@
+
+
+
+   
+   
+   Tutorial: Lesson 3
+
+
+Lesson 2 -
+Lesson
+4 -
+Main page -
+Algorithm-Based
+- Component-Based - Hints
+- EO
+documentation
+
    
+
    
+
    
+
    
+Tutorial Lesson 3: input/output
    
+In this lesson, you will still use the same Evolutionary Algorithm, BUT
+in a much more user-friendly way. You
+will discover how to
+
      
+
    • 
+input parameters on the command-line or from a text
+file
      • 
+
+
    • 
+save the population to disk, together with every part
+of the algorithm you could think of - so you can decide to reload
+everything later to continue the same run, eventually with different parameters.
      • 
+
+
    • 
+generate statistics on the populations, and output
+them to the screen, text or graphic, or to a file (or to any other
+device you might want to use).
      • 
+
    
+First, but you should now have done it without being told, go into the
+Lesson3
+sub-dir of the tutorial dir and type
+make.
+This will compile the SecondBitEA
+and SecondRealEA
+programs.
+
    You can then either
+
    
+
+

    
+
    
+
    Changes
+
    As already said, the behavior of the algorithm
+will be exactly the same as the previous one as far as optimization is
+concerned. Only the input (of algorithm parameters) and output (of program
+results) will be very different.
+
    Hence, the sections corresponding to the fitness
+function, the initialization, the
+variation
+operators, the evolution engine
+and the algorithm itself are
+almost identical (apart from variable name changes).
+
      
+
    • 
+Fitness function:
+there is an additional line
+after the encapsulation of our binary_function
+into an eoEvalFunc
+object, which again encapsulate the eoEvalFunc
+into an eoEvalFuncCounter.
+As its name says, this object will, in addition to computing the fitness,
+count the actual
+number of evaluations: the fitness of non-modified individuals is of course
+not recomputed - and this is taken care of by this object. Moreover, it
+can be later used for displays
+in eoMonitor objects, as done in the checkpoint
+section.
      • 
+
+
    • 
+The initialization
+section has been extended to account for the possibility to re-load
+a previously saved population. This is achieved
+through an eoState object, if the corresponding program
+parameter is set.
      • 
+
+
    • 
+The
+variation
+operators and the evolution engine 
+sections are similar to the ones in Lesson2
      • 
+
+
    • 
+The parameter
+section  is completely different from the previous one. All variables
+corresponding to program parameters
+are now read at run-time using an object of class eoParser.
      • 
+
+
    • 
+The stopping criterion
+section, has in fact now become the checkpoint section, as it involves
+much more than just stopping criteria. See all details in the eoCheckpoint
+paragraph below.
      • 
+
    
+
+
    eoParser:
+parameter input
+
    The first two examples of Lessons 1 and 2 had
+a very crude way to set parameter values: they were hard-coded, and you
+had to recompile the whole program to change a single value. We shall now
+see now to set parameter values in a flexible way (though we're still looking
+for volunteers to create a Graphical User Interface :-)
+
    Two base classes are used for that purpose:
+
      
+
    • 
+The eoValueParam
+class, templatized by the type of the variable
+you want to handle (i.e. iinteger,
+double, yourPrivateClass, ...). In
+this lesson, we will not go into details: e.g. we will not tell you that
+the
+eoValueParam
+is actually a templatized sub-class of abstract class eoParam (oops, I
+said it!), nor will we deal with parameters outside their use from an eoParser.
+See the parameter section of the Component-Based tutorial, or wait until
+lesson
+4).
      • 
+
+
    • 
+The eoParser
+class, whose only purpose is the input of parameters. Read its
+description if you are interested.
      • 
+
    
+
+
    eoParser:
+Modifying parameter values at run-time:
+
    Using an eoParser object, the parameter values
+are read, by order of priority
+
      
+
    1. 
+from the command-line
      2. 
+
+
    2. 
+from a text file
      3. 
+
+
    3. 
+from the environment (forthcoming, if somebody insists)
      4. 
+
+
    4. 
+from default values
      5. 
+
    
+The syntax of parameter reading is a keyword-based
+syntax, now traditional in the Unix world:
+
      
+
    • 
+in EO, each parameter is designated by a (long) keyword,
+and optionally by a short (1 character) keyword.
      • 
+
+
       
+
    • 
+the general syntax to modify parameter value at run-time is (either from
+the command-line or in a text file)
      • 
+
+
                  
+
+--longKeyword=value    
+or     -cvalue   
+if 'c' is the short keyword (though -c=value
+also works)
+
       
+
    • 
+so, after compiling the executable for Lesson 3 (make
+lesson3 at system prompt in Unix), you can try to type
+in
      • 
+
+
                   
+
+SecondBitEA
+
      and see the algorithm run as before (OneMax optimized on 8-bits bitstrings).
+But you can now type in
+
                   
+
+SecondBitEA --vecSize=100
+
      and see the output of the optimization of OneMax on 100-bit bitstrings.
+
       
+
    • 
+Take a look at all available parameters by typing in
      • 
+
+
                   
+
+SecondBitEA --help
+
      or by going into the code: all parameter inputs have been grouped in
+the
+read_param function.
+
       
+
    • 
+After running the algorithm, a new file has been created, named SecondBitEA.status:
+it contains the list of all actual parameters used, and can directly be
+used as parameter input file: change the file name (e.g. to SecondBitEA.param),
+edit it, change whichever parameter you want, and type in
      • 
+
+
                     
+SecondBitEA @SecondBitEA.param
+
      and you will see all values that you defined into the file taken into
+account.
+
       
+
    • 
+The priority remains to the command-line,
+so you can still override the values in the parameter file by giving a
+new value directly on the command-line.
      • 
+
    
+
+
    eoParser:
+Programming parameter input:
+
    The code of SeconBitEA provides examples of parameters reading. Lets
+take the example of the random number
+generator seed. 
+Of course, you first need to declare
+an eoParser object (it needs the standard argc and argv in its constructor).
+
      
+
    • 
+You must first declare a parameter
+of type uint32 (32-bits integer).
+The arguments are: default value, long keyword, comment (that will appear
+in the help message and in the output "status" file if any) and optional
+character keyword.
      • 
+
+
    • 
+Then you must pass it to the parser
+using the processParam method. The optional argument is a section name,
+that will be used to make the output of the parser look clean and ordered.
      • 
+
+
    • 
+Finally, you need to assign the
+value to the variable seed.
+Note that the value() method
+of eoParam returns a reference, so you can eventually modify its value
+somewhere else later (though of course this is not any useful for variable
+seed!).
      • 
+
    
+There is however another way to achieve the same result in less lines of
+code - with a different memory management. This is what is done in the
+code for eoRealEA. The same parameter for the random
+number generator seed
+is read, but in one single line of code. 
+The only difference is that now you cannot access the eoValueParam object
+itself - but this is not often necessary.
+
    Be careful to ensure that the type of the default value in the call
+to eoParameterLoader::createParam
+method as this is the only way the compiler can desambiguate the template
+(remember that eoParameterLoader is a
+base class for eoParser.
+
    
+
    
+
    eoState:
+saving and loadingYou might have
+noticed in the  read_param
+described above a new parameter
+named load_name.
+Now if you go to the init section of
+the code, you will see an alternative way of initializing
+the population: if load_name is an empty string,
+then we do as in the preceding example and use an eoInitFixedLength object.
+However, if a load_name name was entered, the population is read through
+the inState.load(load_name)
+instruction. Moreover, the comment says "Loading pop and
+rng".
+
    This is made possible using the eoState
+class. eoState
+objects maintain references to eoObjects
+that have both an input method (readFrom)
+and an output method (printOn),
+i.e. that derive from the base class eoPersistent.
+You must first register
+object into a state, and can then save them to a (text) file, and later
+read them from that file using the load
+method, as done here.
+
    Of course, you can call the save
+method for an eoState
+object anywhere in the code. But the checkpointing
+mechanism offers you better ways to do that - and it's so easy ....
+
    Note that an eoState alos has another use in EO whan it comes to memory
+management: it can be a repository of pointers that are not allocated within
+obects - allowing to delete them by simply deleting the eoState (see Lesson
+4).
+
    
+
    eoCheckpoint:
+every generation I'd like to ...
+
    The checkpointing mechanism is a very powerful
+construct to perform some systematic actions
+every generation - like saving things
+(using eoState objects described above), computing statistics
+on the population, updating
+dynamical parameters or displaying
+information.
+
    eoCheckpoint
+objects are eoContinue
+objects that contain pointers to different
+types of objects. When their operator()
+method is called (i.e. every generation in the examples up to now), they
+first call the operator()
+methods of all object they contain, and then return their result as an
+eoContinue
+object (i.e. should we continue or stop).
+
    Programming: To
+do something every generation, you simply need to add
+an object whose operator()
+does what you want to the eoState that you will use as continuator in the
+algorithm.
+
    
+
    eoCheckpoint:
+Stopping
+
    The eoContinue
+part of an eoCheckpoint
+is a single object, passed to the
+constructor. If you want more that one stopping criterion, use an eoCombinedContinue
+object as described in Lesson2.
+
    
+
    
+
    eoCheckpoint: Computing
+statistics
+
    Statistics are computed using eoStat
+objects, i.e. functor objects whose operator()
+receives as argument a reference to a population as argument, and can hence
+compute whatever is needed over that population. eoStat
+objects are templatized
+over the type of what they compute (e.g. double,
+or pair<double>,
+or ...). But looking at the inheritance
+diagram of the eoStat
+class, you find that eoStat
+objects are also eoValueParam
+objects. And this allows eoStat
+to be used within eoMonitor
+object, and hence displayed
+to the user!
+
    Statistics: Available
+instances
+
    Some widely used statistics are already available (and of course you
+can build you own!).
+
      
+
    • 
+eoBestFitnessStat returns
+the fitness value of the best individual in the population (of type FitnessType,
+whatever this is).
      • 
+
+
    • 
+eoAverageStat and eoSecondMomentStat
+respectively return the average (type double, assumes that FitnessType
+is castable to a double) and a pair made of the average and the standard
+deviation (type pair<double>)
+of the fitnesses in the populations.
      • 
+
+
    • 
+eoDiversityStat returns the
+diversity in the population: assuming that there is a distance function
+defined among individuals, it returns the average inter-individuals distance.
+See also Exercise 2.
      • 
+
    
+Statistics: Adding
+to the checkpoint
+
    To compute more statistics when your algorithm is running, simply declare
+the corresponding eoStat objects, and add
+them to the eoCheckpoint you
+use in the algorithm. But it hardly makes any sense if you don't monitor
+those statistics (i.e. either displaying them on the screen, or storing
+them into a file): see next section!
+
    Note: actually, there are 2 distinct
+classes that compute and give access to statistics: eoStatand
+eoSortedStat.
+As its name indicate, the latter is used whenever computing the statistics
+require a sorted population: not only this avoids to sort the population
+many times, but also it avoids changing the order of the population at
+all as eoSortedStat objects
+work on a temporary vector of fitnesses . But as
+far as their usage is concerned, its makes no difference.
+
    
+
    
+
    eoCheckpoint: Monitoring
+eoParameters
+
    The eoMonitor
+objects are used to display or store to a file a set of eoValueParam
+objects.
+
    Monitors: Available
+instances
+
    A few monitors are available in the EO distribution:
+
      
+
    • 
+eoStdoutMonitor displays its
+parameters in text format on the screen. The
+(optional) boolean value in the constructor modifies the output: when true
+(the default), verbose output is used, with one line per parameter. When
+false, parsimonious output displays one line for all parameters.
      • 
+
+
    • 
+eoFileMonitor writes its parameters
+in text format in a file. A file name is required
+in the constructor, and an optional separator character can be added (default
+is ' '). Note that the file is by default overwritten by next call to the
+same program, unless you pass "true" as third (optional) boolean parameter,
+which will result in appending to the file if it ever exists.
      • 
+
+
    • 
+eoGnuplot1DMonitor displays
+its parameters in graphical format on the screen
+by calling the gnuplot program,
+and as of today, only works in the Unix version of EO (as always, volunteers
+are welcome to port that to MS Windows). It takes an optional filename
+as input, as communication of data with gnuplot
+is done through a file. If no filename is provided, the file will be erased
+at the end of the run, while it is otherwise kept (though it will be overwritten
+by next call to the same program).
      • 
+
    
+
+

    Monitors: Adding
+to the checkpoint
+
    To display something while the algorithm is running, you need to declare
+an eoMonitor object, add
+some objects (that must be eoValueParam
+objects) to that monitor, and of course add
+the monitor to the eoCheckpoint
+you use in the algorithm.
+
    
+
    
+
    eoCheckpoint: Updating
+things
+
    The last type of objects that  eoCheckpoint
+can handle are eoUpdater
+objects. You should simply encapsulate in an eoUpdater
+anything you wish to do which does not fit into one of the above category.
+Note that their operator() method
+does not receive any argument.
+
    Updater: Available
+instances: A few updaters are available in the EO distribution:
+
      
+
    • 
+eoIncrementor A simple updater
+which maintains a counter (an eoValueParam
+that needs to be created beforehand, and passed in the constructor). It
+is incremented every time the operator()
+method is called (every generation at the moment). You can of course also
+give an increment in the constructor (1 by default).
      • 
+
+
    • 
+eoCountedStateSaver
+and eoTimedStateSaver can
+be used to save some existing eoState
+(see above) to a file regularly, either based on the
+generation count (e.g. every 4 generations) or based on the clock (e.g.
+every 5 seconds).
      • 
+
    
+Updater: Adding to
+the checkpoint
+
    A very simple example of using an eoUpdater
+is given in the code for SecondBitEA: First declare
+an eoValueParam object, then
+use
+it to construct an eoIncrementor
+that you must add to the eoCheckpoint
+in order to activate its update. You can then use the parameter for your
+purpose, for instance as a first coordinate for a monitor.
+
    Note also how to use the statesavers: first declare
+a state, then register
+whatever you think necessary to that state, then pass
+the state to some state-saver - and don't forget to add
+the statesavers to the current eoCheckpoint.
+
    
+
    
+
    Exercise 1:
+
      
+
    • 
+The code of SecondBitEA
+display things in the current window in text format. Replace the eoFileMonitor
+by an eoGnuplot1DMonitor
+and watch the graphical output (Unix
+systems with gnuplot
+installed only, sorry).
      • 
+
+
    • 
+Note that you must also replace the eoSecondMomentStat
+by an eoAverageStat,
+otherwise the standard deviations won't make any sense here.
      • 
+
+
    • 
+Please try to understand why the average is always
+0 before taking a look at the solution (file exercise1.cpp).
      • 
+
+
    • 
+Then run
      • 
+
+
               
+exercise1 --vecSize=1000 --maxGen=1000
+
      to get a chance to see something happening before
+the program ends!
    
+
+
    Exercise 2:
+
    Write the eoDiversityStat
+stat computation and test it. Thanks to send us the code!
+
    
+
    
+
    Exercise 3:
+
    Write the code for an eoGnuplotSecondStatMonitor
+that would display the eoSecondMomentStat
+(i.e. take into account the standard deviations and display them as error-bars.
+
    Again, send us the code afterwards, thanks :-)
+
    
+
    
+
    Lessons learned:
+
      
+
    • 
+Value of program parameters can be set at run-time
+using the eoParser class.
      • 
+
+
    • 
+Snapshots of the algorithms can easily
+be saved (and restored)
+thanks to the eoState class.
      • 
+
+
    • 
+The eoCheckpoint mechanism
+let you do things every generation
+without modifying existing algorithms, by simply writing the necessary
+code and encapsulating it into an object that eoCheckpoint
+is aware of, that are at the moment the following:
      • 
+
+
    • 
+computing statistics, displaying
+parameters
+(e.g. statistics),  saving the
+(eo)State
+of the program.
      • 
+
    
+In next lesson you will find out that many adaptive
+techniques (the state-of-the-art in Evolutionary Computation) can easily
+be programmed through the eoUpdater
+construct.
+
    
+
    Lesson 2 -
+Lesson
+4 -
+Main page -
+Algorithm-Based
+- Component-Based - Hints
+- EO
+documentation
+
    
+
    
+
    
+Marc Schoenauer
    
+
+
    Last
+modified: None of your business!
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/eoLesson4.html b/trunk/paradiseo-eo/tutorial/html/eoLesson4.html
new file mode 100644
index 000000000..0ddab737f
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/eoLesson4.html
@@ -0,0 +1,940 @@
+
+
+
+   
+   
+   Tutorial: Lesson 4
+
+
+Lesson 3 -
+Lesson
+5 -
+Main page -
+Algorithm-Based
+- Component-Based - Hints
+- EO
+documentation
+
    
+
    
+
    User's guide: General
+- Bitstring - Real - ES
+- Programmer's guide: General
+- Memory management - Parameters
+
    
+
    
+
    
+
    
+Tutorial Lesson 4: ready-to-use fully operational EA
    
+In this lesson, you will still use the same Evolutionary Algorithm. But
+this time you will have full control of all components
+from the command-line or a parameter file.
    
+You can even use the algorithm decribed here without any other knowledge
+of EO, just by writing your fitness function as a plain C++ function. 

    
+
+Contents
    
+
+
+
    
+
    
+
    User's
+guide
+
    As already said, the behavior of the algorithms
+will be exactly the same as the previous one as far as optimization is
+concerned. Only now you will be able to tune every component of the algorithms
+(except the type of genotype) using run-time parameters.
+
    Also, as in previous lessons, most of the code
+is representation-independent, i.e. is the same for both the binary genotypes
+and the real-valued genotypes. This small user's guide reflects that, but
+you can go directly to the binary or the real
+parts if you wish.
+
    Warning: this
+is a user guide, not a programming guide. In particular, the keywords
+of the parameters are not
+the names of
+the underlying classes (though they should be similar in most cases).
+
    User's guide:Parameter
+input The way to input parameters
+has already be described in Lesson
+3. To get a list of parameters, type the command with option --help
+(or -h): with both testBit and testReal this will result in
+
      
+
    • 
+Printing the list of keywords on the standard output
      • 
+
+
    • 
+Creating (or overwriting) a file name testBit.status
+or testReal.status that contains the list of all recognized parameters
+and has the format of an input parameter file.
      • 
+
    
+User's guide:The
+status file
+
    This file will always contain the list of the
+parameters that have been actually used by the last run of the program,
+however thay have been entered (try testBit
+-G1 and take a look a the
+status file). The parameters that are commented out (a # character comments
+out the rest of the line) in the file are those that were not specified
+by the user.
+
    On the status file, the parameters are organized
+in sections. Note, however, that this format is not mandatory in the param
+file, as only the keywords
+are processed.
+
    User's guide:Representation-independent
+parameters
+
    In what follows, the fixed font colored text
+is directly taken from the status file and is commented between the lines.
+The presentation follows the status file format - only two sections are
+representation-dependent (see the corresponding binary
+or real sections). All other sections are presented
+now:
+
    
+
    
+
    Section ######
+General ######
+
    # --help=0 # -h : Prints
+this message
+
    Boolean parameter of
+absolutely no interest: tells whether or not help was requested.
+
    # --seed=988700289 # -S :
+Random number seed
+
    Unsigned long parameter:
+the seed for the Random Number Generator
+If the parameter is absent, then time(0) is used, which indicates the number
+of seconds since Jan. 1 1980, is used ... and stored in the status file,
+of course, so you can repeat the same run by simply assigning that value
+again. There is no default value ("true" random
+seed).
+
    
+
    
+
    Section ######
+engine ######
+
    In this section, one chooses all components of
+the Evolution Engine (selection, replacemenet
+and the like).
+
    # --popSize=20 # -P : Population
+Size
+
    Integer parameter:
+the size of the population (constant along evolution). And yes, this is
+a representation independent parameter, as the population is created either
+from a file or using an eoInit object - and only that object is representation-dependent.
+
    # --selection=DetTour(2)
+# -S : Selection: Roulette, DetTour(T), StochTour(t) or Sequential(ordered/unordered)
+
    String parameter:
+Name of selection procedure. Availabable
+are the roulette wheel
+(name Roulette,
+fitness scaling coming soon); deterministic
+tournament (name DetTour
+with size - integer > 2 - in parentheses right after the name, use double
+quotes on the command line);  stochastic
+tournament (name StochTour
+with probability - float in [0.5, 1] - in parentheses); sequential
+(name
+Sequential,
+all individuals in turn), either from best to worst (option ordered
+in parentheses), or in random ordered (option unordered);
+and finally repeated independent uniform
+choices  (name Random).
+Default is DetTour(2).
+
    # --nbOffspring=100% # -O
+: Nb of offspring (percentage or absolute)
+
    Integer or real-valued parameter:
+this parameter indicates the amount of
+offspring that will be generated from
+the genitors every generation. However, this amount can be specified either
+relative
+to the population size, and it should then end with percent character (%),
+or as an absolute
+integer number (without the percent char).
+
    Indeed, you can either want, say 7 times more
+offspring than parents (a rather common situation in Evolution Strategies),
+in which case you give value 700% to nbOffspring
+parameter; or you might want a single offspring whatever the population
+size, like in Steady-State evolution engines, in which case you simply
+enter value 1. Default is 100%.
+
    # --replacement=Comma # -R
+: Replacement: Comma, Plus, EPTour(T), SSGAWorst, SSGADet(T), SSGAStoch(t)
+
    String parameter:
+Name of replacement procedure. Availabable are the ES
+plus and comma deterministic replacement
+strategies (named respectively Plus
+and  Comma);
+EP
+stochastic tournament (name EPTour
+with tournament size in parentheses); and the steady-state
+replacement
+procedures, at the moment only based on fitnesses, replacement being either
+deterministic
+(new born replace worst parent, name SSGAWorst), 
+or based on a tournament  (name SSGADet
+for deterministic tournament, size in parentheses, and SSGAStoch 
+for stochastic tournament, probability in parentheses). Default
+is Comma (which btw is also SGA generational
+replacement whenever there are as many offspring
+as parents).
+
    # --weakElitism=0 # -w :
+Old best parent replaces new worst offspring *if necessary*
+
    Boolean parameter:
+if true, weak elitism is added to the replacement procedure (i.e. if the
+best fitness among the offspring is less than the best fitness, the best
+parent replaces the worst offspring). Default
+is false.
+
    
+
    
+
    Section ######
+Output ######
+
    This first section on Output contains parameters
+related to screen text output.
+
    # --useEval=1 # Use nb of
+eval. as counter (vs nb of gen.)
+
    Boolean parameter:
+whether or not you want the nb of evluations to be displayed and used as
+counter in statistics outputs and plots. Default
+is true.
+
    # --printBestStat=1 # Print
+Best/avg/stdev every gen.
+
    Boolean parameter:
+toggles screen output of indicated statistics. Default
+is true.
+
    # --printPop=0 # Print sorted
+pop. every gen.
+
    Boolean parameter:
+adds a dump of the whole population to the screen every generation. Is
+likely to generate huge
+output! Default is false.
+
    # --printFDC=1 # Print FDC
+coeff. every gen.
+
    Boolean parameter:
+adds Fitness Distance Correlation to output every generation. Default
+is false.
+
    
+
    
+
    Section ######
+Output - Disk ######
+
    This second section on Output contains parameters
+related to DISK output.
+
    # --resDir=Res # Directory
+to store DISK outputs
+
    String parameter: All
+DISK
+output will be stored in a separate directory
+-this is its name. If the directory does not exist, it is created. Note
+that all graphical displays
+will use that directory for their temporary files. Also all
+job dump (see section Persistence
+below) store their files there too.
+
    # --eraseDir=0 # erase files
+in dirName if any
+
    Boolean parameter:
+in order not to mix up files from different runs, it is mandatory to ensure
+that the directory where all files will be stored is empty. However, if
+this parameter is not set and the directory already exists, an exception
+is thrown and the program stops. It it is set, all
+files in the result directory are erased.
+
    # --fileBestStat=0 # Output
+Best/avg/stdev to a file
+
    Boolean parameter:
+if present, the best, average and standard deviation statistics are stored
+in file resDir/best.xg.
+Each line contains the generation number, eventualy the evaluation count
+(depending on parameter useEval
+then the statistics. Default is false.
+
     
+
    
+
    
+
    Section ######
+Output - Graphical ######
+
    This last section on Output contains parameters
+related to graphical output (only available in Unix through gnuplot at
+the moment).
+
    # --plotBestStat=0 # Plot
+Best/avg Stat
+
    Boolean parameter:
+toggles gnuplot output of best and average plots (Linux only at the moment).
+Default
+is false.
+
    # --plotFDCStat=0 # Plot
+FDC scatter plot
+
    Boolean parameter:
+toggles the Fitness Distance Correlation plot (Fitness vs distance to best).
+Default
+is false.
+
    # --plotHisto=0 # Plot histogram
+of fitnesses
+
    Boolean parameter:
+if on, gnuplot is used to plot the sorted population (fitness vs rank).
+Gives a graphical idea of the diversity. Default
+is false.
+
    
+
    
+
    Section ######
+Persistence ######
+
    This section contains parameters handling job
+dump and restart mechanism.
+
    # --Load= # -L : A save file
+to restart from
+
    String parameter:
+if present, the initial population (and the RNG) is read from indicated
+file. That file must
+come from a previous save (or must be in same format!), i.e. must contain
+a popualtion, the RNG and all parameters. If no other parameter is modified,
+using a previously saved population and RNG will give exactly the same
+results than having run that previous run longer. And a way to be sure
+to re-use the same parameters is to ... use that very save file as parameter
+file, as it contains all actual parameters in the right format.
+
    Note that if not enough individuals are read,
+the remaining are randomly initialized. No
+default value.
+
    # --recomputeFitness=0 #
+-r : Recompute the fitness after re-loading the pop.?
+
    Boolean parameter:
+in case some individuals are read from a file, their fitness is read too.
+If this one is true, it is nevertheless recomputed. Default
+is false i.e. use fitnes that's in the file.
+
    # --saveFrequency=0 # Save
+every F generation (0 = only final state, absent = never)
+
    Integer parameter:
+interval between two dump to disk of the whole population (+RNG + parameters),
+in a file named genNN.sav in the dirRes
+directory, where NN is the generation number. If this prameter is present
+(even with 0 or negative value), the final population will always be saved,
+whatever the reason for stopping. Hence the only way to avoid all saves
+is to omit the parameter (there is no default
+value).
+
    # --saveTimeInterval=0 #
+Save every T seconds (0 or absent = never)
+
    Integer parameter:
+time interval between two population (+RNG + parameters) dumps to disks.
+Files are names timeNN.sav. See pervious parameter description for ore
+details. No default value.
+
    # --status=t-eoGA.status
+# Status file
+
    String parameter:
+name of the status file (that contains all parameters in the input format).
+There is no way to avoid creating that file except recompiling ... or giving
+the name /dev/null (Unix). Default value is ProgramName.status
+
    
+
    
+
    Section ######
+Stopping criterion ######
+
    This section allows to decide when the algorithm
+will stop.
+
    # --maxGen=100 # -G : Maximum
+number of generations (0 = none)
+
    Integer parameter: maximum number of generations.
+A value of 0 disables that stopping criterion. Default
+is 100.
+
    # --steadyGen=100 # -s :
+Number of generations with no improvement
+
    Integer parameter:
+stops whenever that number of generations is passed without any improvement
+of the best fitness in the population, provided the following minimum number
+of generations has been done. No default value.
+
    # --minGen=0 # -g : Minimum
+number of generations
+
    Integer parameter: the above steadyGen parameter
+starts its job only after that minimum nuber of generations is passed.
+No
+default value.
+
    # --maxEval=0 # -E : Maximum
+number of evaluations (0 = none)
+
    Integer parameter:
+maximum number of generations.
+No default
+value.
+
    # --targetFitness=0 # -T
+: Stop when fitness reaches
+
    Real-valued parameter:
+the algorithm stops whenever the best fitness reaches that target. No
+default value.
+
    # --CtrlC=0 # -C : Terminate
+current generation upon Ctrl C
+
    Boolean parameter:
+if true, Ctrl C only stops after the current generation as completed (eventually
+dumping population to a file if some saver is active). This very useful
+feature is only available in Unix at the moment. Default
+is false.
+
    
+
    
+
    User's guide:Bistring
+specific parameters
+
    The following describes the specific parameters that are available
+in program BitEA to evolve genotypes that are bitstrings.
+
    The two representation-dependent sections are concerned repectively
+with genotype initilization and variation operators.
+
    
+
    
+
    Section ######   
+Genotype Initialization    ######
+
    This section should allow input if all necessary
+parameters for genitype initialization
+
    # --ChromSize=10 # -n : The
+length of the bitstrings
+
    Integer parameter:
+The bitstring initilization only requires the length of the chromosome.
+
    
+
    
+
    Section ######   
+Variation Operators    ######
+
    This section allows to tune the way the variation
+operators will be applied to the individuals (in the strict limit of SGA
+model at the moment, see below).
+
    # --operator=SGA # -o : Description
+of the operator (SGA only now)
+
    String parameter:
+Describes the way the operators are applied. At the moment, only
+SGA is available. SGA sequentially
+applies a (quadratic) crossover operator with probability pCross
+and a mutation operator with probability  pMut.
+Both these operators can in turn be proportional
+combinations of simple operators of the
+same arity.
+
    # --pCross=0.6 # -C : Probability
+of Crossover
+
    Floating-point parameter:
+The probability that a given couple of selected genitors is applied the
+crossover operator. In SGA operator model, each couple of selected genitors
+is applied the crossover operator with that probability (and remains unchanged
+with probability 1-pCross.
+Whenever a couple undergoes crossover, a choice is made upon available
+crossover operators proportionaly to their
+relative rates (see below). Default
+is 0.6.
+
    # --pMut=0.1 # -M : Probability
+of Mutation
+
    Floating-point parameter:
+The probability that a given individual (resulting from a crossover or
+a non-crossover operation, see above) is applied the mutation operator.
+Whenever an individual undergoes mutation, a choice is made upon available
+mutation operators proportionaly to their
+relative rates (see below). Default
+is 0.1.
+
    # --onePointRate=1 # -1 :
+Relative rate for one point crossover
+
    Floating-point parameter:
+Rate of aplication of the 1-point crossover relatively
+to 2-point and uniform below (see pCross
+parameter). Default is 1.
+
    # --twoPointRate=1 # -2 :
+Relative rate for two point crossover
+
    Floating-point parameter:
+Rate of aplication of the 2-point crossover relatively
+to 1-point above and uniform below (see pCross
+parameter). Default is 1.
+
    # --uRate=2 # -U : Relative
+rate for uniform crossover
+
    Floating-point parameter:
+Rate of aplication of the 1-point crossover relatively
+to 1- and 2-point above (see pCross
+parameter). Default is 2.
+
    # --pMutPerBit=0.01 # -b
+: Probability of flipping 1 bit in bit-flip mutation
+
    Floating-point parameter:
+When bit-flip mutation
+is applied, each bit is flipped independently with probability  pMutPerBit.
+
    # --bitFlipRate=0.01 # -s
+: Relative rate for bit-flip mutation
+
    Floating-point parameter:
+Rate of aplication of the bit-flip mutation relatively
+to one-Bit mutation below (see pMut
+above). Default is 0.01
+(if all relative rates are equal, the choice is uniform among available
+operators).
+
    # --oneBitRate=0.01 # -d
+: Relative rate for deterministic bit-flip mutation
+
    Floating-point parameter:
+Rate of aplication of the one-bit mutation relatively
+to bit-flip mutation below (see pMut
+above). One-bit mutation flips one and only one bit, uniformly chosen in
+the individual. Default is 0.01
+(if all relative rates are equal, the choice is uniform among available
+operators).
+
     
+
    
+
    
+
    User's guide:Real-valued
+specific parameters
+
    
+To run your own real-valued application, write your fitness function
+(see real_value.h    ), 
+recompile, and run from the command line 
    
+
    RealEA @RealEA.param

    
+in order to use sensible parameters! (see Lesson 3 
+for details on the parameter file). 
+But remember that Self-adaptive ES will work much better!
+

    
+The following describes the specific parameters that are available
+in programs RealEA
+and ESEA
+to evolve genotypes that are vector<double>.
+
    RealEA
+implements what can be called a "real-coded GA", where everything is identical
+to the bitstring case above (except initialization and operators that are
+specific to vector<double> of course) and ESEA
+implements the full Evolution-Strategy self-adaptive mutation mechanism
+- together with specific ES crossover operators. The initialization section
+for both programs are identical, but the operator sections are totally
+different. See next paragraph for a description of ES
+specific parameters.
+
    
+
    
+
    Section ######   
+Genotype Initialization    ######
+
    This section should allow input if all necessary
+parameters for genitype initialization
+
    # --vecSize=10 # -n : The
+number of variables
+
    Integer parameter:
+The initilization requires the length of the vector<double>.
+
    # --initBounds=10[-1,1] #
+-B : Bounds for uniform initialization
+
    Bounds parameter:
+Bounds for uniform initialization of the real variables. The syntax for
+this parameter given in the objectBounds
+parameter description below. This argument is mandatory, furthermore the
+given bounds must be bounded.
+The
+default is [-1,1] for all variables.
+
    Note that this parameter is independent of the objectBounds
+parameter below.
+
    # --sigmaInit=0.3 # -s :
+Initial value for Sigma(s)
+
    Floating-point parameter:
+The initial value for all standard-deviation mutation strategy parameters.
+Useless when no self-adaptive mutation mechanism is used.
+
    
+
    
+
    Section ######   
+Variation Operators    ######
+
    This section allows to tune the way the variation
+operators will be applied to the individuals (in the strict limit of SGA
+model at the moment, see below).
+
    # --objectBounds=10[-inf,+inf]
+# -B : Bounds for variables
+
    Bounds parameter:
+Bounds for object variables. The syntax for this parameter is a succession
+of (optionally semi-colon separated) items of the form N[min,Max]where
+the optional integer N
+indicates how many variables have the given bounds. min
+and Max
+are either floating point numbers, or -inf
+(resp. +inf)
+to indicate unbounded direction. If not enough bounds are provided, the
+remaining variables will have the same bounds as the last bounds given.
+
    This argument is mandatory, and
+default
+is [-inf,+inf], i.e. unbounded variables.
+
    Examples:
+10[-1,1]is
+equivalent to simply [-1,1]
+or to the extended  [-1,1][-1,1][-1,1][-1,1][-1,1][-1,1][-1,1][-1,1][-1,1][-1,1].
+
    And [-1,1];2[0,1];[-inf,10]results
+in the first variable staying in [-1,1], the second and the third in [0,1]
+and all remaining variables below 10.
+
    # --operator=SGA # -o : Description
+of the operator (SGA only now)
+
    String parameter:
+Describes the way the operators are applied. At the moment, only
+SGA is available. SGA sequentially
+applies a (quadratic) crossover operator with probability pCross
+and a mutation operator with probability  pMut.
+Both these operators can in turn be proportional
+combinations of simple operators of the
+same arity.
+
    # --pCross=0.6 # -C : Probability
+of Crossover
+
    Floating-point parameter:
+The probability that a given couple of selected genitors is applied the
+crossover operator. In SGA operator model, each couple of selected genitors
+is applied the crossover operator with that probability (and remains unchanged
+with probability 1-pCross.
+Whenever a couple undergoes crossover, a choice is made upon available
+crossover operators proportionaly to their
+relative rates (see below). Default
+is 0.6.
+
    # --pMut=0.1 # -M : Probability
+of Mutation
+
    Floating-point parameter:
+The probability that a given individual (resulting from a crossover or
+a non-crossover operation, see above) is applied the mutation operator.
+Whenever an individual undergoes mutation, a choice is made upon available
+mutation operators proportionaly to their
+relative rates (see below). Default
+is 0.1.
+
    # --alpha=0 # -a : bound
+for combination factor in real crossover
+
    Floating-point parameter:
+Bound for the choices of linear combination factors in both crossover belows
+(similar to BLX-alpha notation). Default is
+0 (i.e. combination factor are chosen in [0,1]).
+
    # --segmentRate=1 # -s :
+Relative rate for segment crossover
+
    Floating-point parameter:
+Rate of application of the segment crossover relatively
+to hypercube and uniform crossovers (see pCross
+parameter). Segment crossover generates offspring uniformly on the segment
+joining both parents, i.e. constructs two linear combinations of the parents
+with a random number uniformly drawn in [alpha,1+alpha].
+Default
+is 1.
+
    # --hypercubeRate=1 # -A
+: Relative rate for hypercube crossover
+
    Floating-point parameter:
+Rate of application of the hypercube crossover relatively
+to segment and uniform crossovers (see pCross
+parameter). Hypercube crossover generates offspring uniformly on the hypercube
+whose diagonal is the segment joining both parents, i.e. by doing linear
+combinations of each variable independently (a random number in [alpha,1+alpha]
+is drawn anew for each variable). Default
+is 1.
+
    # --uxoverRate=1 # -A : Relative
+rate for uniform crossover
+
    Floating-point parameter:
+Rate of application of the segment crossover relatively
+to hypercube and segment crossovers (see pCross
+parameter). Uniform crossover simply exchanges values of variables, i.e.
+uniformly picks up two other summits of the hypercube defined by the parents.
+Default
+is 1.
+
    # --epsilon=0.01 # -e : Half-size
+of interval for Uniform Mutation
+
    Floating-point parameter:
+The uniform and deterministic-uniform mutations will choose values of variable
+X uniformly in [X-epsilon,
+X+epsilon].
+Default
+is 0.01.
+
    # --uniformMutRate=1 # -u
+: Relative rate for uniform mutation
+
    Floating-point parameter:
+Rate of aplication of the uniform mutation relatively
+to determinitic uniform and the normal mutations (see pMut
+above). Uniform mutation modifies all variables by choosing new values
+uniformly on an interval centered on the old value of width 2*epsilon
+(see above). Default is1.
+
    # --detMutRate=1 # -d : Relative
+rate for deterministic uniform mutation
+
    Floating-point parameter:
+Rate of aplication of the determinisitc-uniform mutation relatively
+to uniform and normal mutations (see pMut
+above). Deterministic-uniform mutation modifies one single variable uniformly
+based on epsilon epsilon.
+Default
+is1.
+
    # --normalMutRate=1 # -d
+: Relative rate for Gaussian mutation
+
    Floating-point parameter:
+Rate of aplication of the normal mutation relatively
+to two uniform mutations above (see pMut
+above). Default is1.
+
    # --sigma=0.3 # -s : Sigma
+(fixed) for Gaussian mutation
+
    Floating-point parameter:
+The value of standard deviation for Gaussian mutation - fixed along evolution
+(see the Evolution Strategy program below for self-adaptive mutations).
+
    
+
    
+
    User's guide:ES
+with self-adative mutation parameters
+
    
+To run your own SA-ES application, write your fitness function
+(see real_value.h    ), 
+recompile, and run from the command line 
    
+
    ESEA @ESEA.param

    
+in order to use sensible parameters! (see Lesson 3 
+for details on the parameter file). 
+

    
+The following describes the specific parameters for program ESEA,
+that implements the full Evolution-Strategy self-adaptive mutation mechanism
+- together with specific ES crossover operators. The initialization section
+is the same as the one for plain vector<double> above, so only the opeartor
+sections will be described here. A new section is now concerned with deciding
+what kind of self-adaptive mutation strategy will be applied - it has been
+separated from the other variation operators because it has consequences
+on the choice of the genotype.
+
    Warning: if you choose not to use
+any self-adaptive mechanism (i.e. setting all parameters of this section
+to false) you end up with ... an algorithm that is identical to RealEA
+above (try it and take alook at the status file).
+
    
+
    
+
    Section ######    
+ES mutation    ######
+
    This section allows to decide which type of self-adaptive
+mutation will be used. There are three available types: isotropic mutation,
+using one standard deviation for each individual, that will be applied
+to all variables; anisotropic mutation, where each individual carries as
+many standard deviations as it has variables; and correlated mutation where
+each individuals has its own full correlation matrix.
+
    # --Isotropic=1 # -i : Isotropic
+self-adaptive mutation
+
    Boolean parameter:
+If true, at least one self-adaptive parameter will be used for each individual.
+Default
+is true.
+
    # --Stdev=0 # -s : One self-adaptive
+stDev per variable
+
    Boolean parameter:
+If true, at least one self-adaptive parameter per variable will be used
+for each individual. Default is false.
+
    # --Correl=0 # -c : Use correlated
+mutations
+
    Boolean parameter:
+If true, full correalted self-adaptive mutation will be used for each individual.
+Default
+is false.
+
    Note: The
+default values result in an isotropic self-adaptive mutation to be chosen.
+
    
+
    
+
    Section ######   
+Variation Operators    ######
+
    Only the parameters that are specific to ESEA
+are presented here - the objectBounds,operator,pCross
+and pMut
+are exactly the same as for RealEA
+above.
+
    # --crossType=global # -C
+: Type of ES recombination (global or standard)
+
    String parameter: 
+Es crossover can involve only two parents - and it is then identical to
+the standard
+hypercube crossover describe for the RealEA
+parameters above. But new parents can also be chosen anew for each variable
+before doing the crossover for that variable - and this is called global
+recombination.
+
    # --crossObj=discrete # -O
+: Recombination of object variables (discrete or intermediate)
+
    String parameter: 
+There are two possible crossovers in plain ES. The discrete
+crossover simpy exchanges variables among the parents. It is similar to
+the plain uniform crossover for real variables. The  crossover performs
+a linear combination of parents;variables - it si similar to the hypercube
+crossover described for  with alpah parameter set to 0. This parameter
+allso to choose the type of crossover that will be applied to the object
+variables (i.e. the origianl variables
+of the problem). Default is discrete.
+
    # --crossStdev=intermediate
+# -S : Recombination of mutation strategy parameters (intermediate or discrete)
+
    String parameter: 
+This parameter allows to choose the type of crossover (see above) that
+will be applied to the mutation strategy
+parameters that are part of the genotype.
+Default
+is intermediate.
+
    # --TauLoc=1 # -l : Local
+Tau (before normalization)
+
    Floating-point parameter:
+The local factor for the mutation of the mutation strategy parameters (the
+only one used when a single standard deviation is used). Default
+is 1.
+
    # --TauGlob=1 # -g : Global
+Tau (before normalization)
+
    Floating-point parameter:
+The global factor for the mutation of the mutation strategy parameters
+(only useful when more than one standard deviation are used). Default
+is 1.
+
    # --Beta=0.0873 # -b : Beta
+
    Floating-point parameter:
+The factor for the mutation of the rotation angles in the case of the full
+correlated mutation. Default is 0.0873
+(following Schwefel).
+
    
+
    
+
    Programmer's
+guide
+
    At the moment, you will have to browse in the source (colored!) code
+(Bit - Real) almost by yourself, sorry.
+
    Note that the main file is now very slim, as it only contains calls
+to some make_xxx
+functions - these functions contain the actual code, very similar to the
+code of Lesson3, except for the memory management, performed through an
+eoState
+object (notice that all make_xxx
+calls have an eoState as second parameter).
+
    Programmer's guide: The
+make_xxx files
+
    Interface: all make_xxx
+files have as first two parameters an eoParser
+and an eoState.
+The eoParser
+is be used within all functions to parse the command-line and/or a parameter
+file in order to read any relevant user-parameter, while the eoState
+is used here to store all pointers to be allocated inside the function
+(see Programming hints for more
+detailed explanations).
+
    There are 2 types of make_xxx
+files: the ones that do depend on representation, defining the genotype
+and
+initialization
+(make_genotype_xxx,
+with xxx being the type of genotype) and variation operators (make_op_xxx),
+and the one that are truly representation-independent (make_pop,
+make_continue, make _checkpoint, make_algo and
+make_run).
+
    The former are located in the directory corresponding to the actual
+genotype (src/ga
+for eoBit, src/es
+for eoReal and all eoESxxx genotypes). The latter are in the directory
+src/do.
+
    If you take a close look at the code of make_continue
+for instance, you will first notice that ... the function declared there
+is called do_make_continue
+and is not the one you are calling in
+the main file, though it has the same parameters as arguments.
+
    The explanation lies within the file make_continue_xxx.cpp
+(with xxx = ga or real/es)which, as its color (and name)  should have
+told you about, are representation-dependent: in fact the make_continue_xxx.cpp
+files only instanciates the general <EOT> template into one of the possible
+template for eoBit or eoReal/eoES - and this trick allows to compile
+them separately!
+
    The other thing that you should notice is that the code there is very
+similar to the code that was in Lesson 3,  regarding parameter reading
+and type of object that are allocated - except for memory management. This
+goes for all make_xxx
+files - so the only thing you need to understand how it goes is to look
+at the memory management section.
+
    Pros: you don't have to handle a
+huge main function - and many of the make_xxx files can be directly used
+in different applications (this is called modularity
+:-)))
+
    More interesting, you can even compile
+the make_xxx
+files separately for a given target
+template, and link them e.g. with your fitness function when it is ready
+(remember that up to now you needed to compile everything altogether by
+including the code into your mail fine). Indeed, if you do a global make,
+you will notice that there are additional libraries compiled in src/ga
+and src/es
+...
+
    Cons: It makes the code a little
+more complex to understand, first because of the indirection needed for
+pre-compilation with a given template, and second because of the memory
+management that this imposes.
+
     
+
     
+
    Programmer's
+guide: Memory management
+
    As already said, all functions have an eoState
+as second argument - and that object is used to store the functor objects
+that were simply declared as variables of the main function up to now :
+see Programming hints for more
+detailed explanations and take a look at the code of make_continue
+for instance, you will see the implementation of the memory management
+in action.
+
    Programmer's
+guide: Memory management
+of eoParam objects
+
    It has been seen in Lesson 3 that parameters could be read from command-line
+and/or a parameter file using an eoParser
+object. However, the memory mangement problem also concerns EO parameter
+objects (eoParam):
+the way there are read in Lesson3
+makes them local variables of the function they are defined in.
+
    It is however possible to ask the eoParser
+to hold them, as done for instance in eoContinue for the maximum number
+of generations. Local declaration would amount to something like :
+
    eoValueParam<unsigned
+int>& maxGenParam(100, "maxGen", "Maximum number of generations ()
+= none)",'G');
+
     parser.processParam(
+maxGenParam, "Stopping criterion" );
+
     unsigned maxGen =
+maxGenParam.value();
+
    while if you want the parser to hold those eoParam objects, you will
+write something like
+
    eoValueParam<unsigned>&
+maxGenParam = _parser.createParam(unsigned(100), "maxGen", "Maximum number
+of generations () = none)",'G',"Stopping criterion");
+
    and then use maxGenParam.value()
+to get the value enterred by the user. In that case, you get a reference
+to an eoParam object that is hold by the eoParser - and deleted whith it.
+
    Note that there are two important differences
+between the arguments of the constructor of an eoParam object and the method
+createParam of an eoParser object: first, you need to provide the additional
+section parameter (used only when outputting the eoParser); second you
+must
+make sure that the first argument is of the correct type otherwise the
+compiler will complain.
+
    Note that if you don't later need the eoParam, but simply its value,
+you can even diretly write
+
    unsigned maxGen = _parser.createParam(unsigned(100),
+"maxGen", "Maximum number of generations () = none)",'G',"Stopping criterion").value();
+
    Getting parameter values in different
+functions:
+
    It is often useful (though probably very bad
+programming style :-))) to be able to get the value of a user-defined
+parameter in two different places of the code without passing it around
+through many levels of call. You can then use the alternate function getORcreateParam
+with exactly the same syntax than createParam.
+
    Be careful that the link between both parameters is made through their
+longmanes (second argument), and that you must so hard-code
+that name in two different places with of course exactly the same spelling!!!
+
    Examples can be found for instance
+in the make_genotype_xxx files, for the sizes of the genotypes: it is often
+the case that the definition of the optimization problem requires (or computes)
+such size. The idea is then that you either read or compute that size,
+then create a (dummy) parameter with the name that is used later in the
+make_genotype file. For instance, for bitstrings, the make_genotype_ga.h
+contains the following line defining the size of the bitstring
+
      unsigned theSize =
+_parser.getORcreateParam(unsigned(10), "chromSize", "The length of the
+bitstrings", 'n',"Problem").value();
+
    If you want to define that size earlier, you should write somewhere
+before
+
     
+
      unsigned requiredSize 
+= ... ;
+
     _parser.createParam(requiredSize,
+"chromSize", "The length of the bitstrings", 'n',"Problem");
+
    Of course, if that size is mandatory, you should NOT modify it at run-time
+by entering anther value !
+
    
+
    User's guide: General
+- Bitstring - Real - ES
+- Programmer's guide: General
+- Memory management - Parameters
+
    
+
    Lesson
+3 -
+Lesson 5 -
+Main
+page -
+Algorithm-Based - Component-Based
+- Hints - EO
+documentation
+
    
+
    
+
    
+Marc Schoenauer
    
+
+
    Last
+modified: None of your business!
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/eoLesson5.html b/trunk/paradiseo-eo/tutorial/html/eoLesson5.html
new file mode 100644
index 000000000..fcb025784
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/eoLesson5.html
@@ -0,0 +1,415 @@
+
+
+
+   
+   
+   Tutorial: Lesson 5
+
+
+Lesson 4 -
+Lesson
+6 -
+Main page -
+Algorithm-Based
+- Component-Based - Hints
+- EO
+documentation
+
    
+
    
+
    
+
    
+Tutorial Lesson 5: using your own genotype
    
+In this lesson, you will learn how to design and evolve your
+own genotype structure. Note that at the moment, only algorithms
+involving a scalar fitness (double) are implemented (see test dir for Pareto
+optimization of multiple-objective fitness - or be patient :-)
+
    The minimum code you'll have to write is first, of course, the code
+for the genotype structure. Then, the representation-dependent
+code: intialization procedure(s),
+variation
+operators (quadratic crossover, mutation operator), ... and evaluation
+function - and that's it : we have prepared some template files and
+the script create.sh that will take care of generating a few other files
+to make your application complete.
+
    In what follows, we will suppose that you want to evolve some data structure,
+and that you have enough programming skills to be able to write C code
+for its random initilialization, its crossover, its mutation and the computation
+of its fitness.
+
    The examples will be described supposing you want to evolve ... bitstings
+to solve the OneMax problem (oh no!!!).
+
    
+
+New May 2004 : A
+second script, createSimple,
+ was added some time ago, that generates much simpler
+set of files, and the stat.tmpl 
+file is now used to allow you to  
+compute and 
+print and 
+save-to-disk and 
+plot-on-line your 
+own statistics. 
+But you'll have to find out by yourself how those work, sorry, no
+time. It should be easy by just looking at the code (in main file, and
+in OneMaxEA.cpp 
+and the newly created 
+eoOneMaxStat.h.

    
+
+New May 2004 : In
+the same simplified main file (e.g. OneMaxEA.cpp after running 
+./createsimple OneMax in 
+dir .../eo/tutorial/Templates), you
+will also be able to use fitness sharing (together with roulette) as a
+possible selector.
+
+
+
    Using
+template files
+
    Follow this very simple procedure:
+
      
+
    • 
+choose a name for you application -
+here OneMax will be used
      • 
+
+
    • 
+go to the tutorial/Templates
+dir
      • 
+
+
             cd
+pathWhereEOisInstalled/tutorial/Templates
+
    • 
+run the create.sh script with
+argument OneMax and second optional argument  a directory name (suppose
+it's called APPLICATION here)
      • 
+
+
               
+./create.sh OneMax APPLICATION
+
      This will create a directory tutorial/APPLICATION
+
    • 
+Go to the APPLICATION directory
      • 
+
+
               
+cd ../APPLICATION
+
      You should see the following files:
+
          OneMaxEA.cpp          
+the main main file, includes all other, to be compiled
+
          Makefile              
+with default target eoOneMaxEA
+
          eoOneMax.h            
+class eoOneMax, the genotype
+
          eoOneMaxEvalFunc.h    
+
+class for the computation of fitness
+
          eoOneMaxInit.h        
+class for genotype initlialization
+
          eoOneMaxMutation.h    
+class for mutation
+
          eoOneMaxQuadCrossover.h
+class
+for (quadratic) crossover
+
          make_genotype_OneMax.h
+
+helper function that create the initializer
+
          make_op_OneMax.h      
+helper function that handles the rates of application of
+the variation operators
      
+    OneMaxLibEA.cpp       
+another main file, for separate compilation of representation-independent
+stuff
+
          make_OneMaxEA.cpp     
+the source for the representation-independent stuff
+
       
+
    • 
+Compile the whole application
      • 
+
+
              
+make
+
      and you should have no error there and see a new executable file named
+OneMaxEA.
+You can run it and ... it will do nothing (what did you expect???).
      
+
      
+
    • 
+Now you should go and edit the files. The minimal  changes that you
+will need are
      • 
+
+
         in eoOneMax.h              
+define your genotype
+
         in eoOneMaxInit.h          
+define the initialization of one genotype
+
         in eoOneMaxMutation.h      
+
+define the mutation of one genotype
+
         in eoOneMaxQuadCrossover.h 
+
+define the crossover of 2 genotypes
    
+Smooth application building:
+
      
+
    • 
+After editing a particular file, compile
+the whole thing immediately (by running make) and
+run the algorithm, to validate your code
      • 
+
+
    • 
+In each file, start by only adding code between keyword-pairs START
+and END
      • 
+
    
+We shall now take a look in turn at the 4 files mentionned above, then
+describe rapidly the other files, especially the main files.
+
    
+
    Genotype
+- and its pre-requisites: eoOneMax.h
+
    First thing is to write the code for the structure
+of the genotype. This is done by filling in the template file
+eoOneMax.h.
+There are 4 places that you should consider filling in:
+
      
+
    • 
+Of course, the data that will build up
+the genotype. The convention in EO is to have it at the end of the class
+definition, and as private data.
      • 
+
+
    • 
+The default constructor of an instance.
+Note that you must provide a default constructor,
+and that no other constructor will be called within EO code. you might
+think you need some other constructor to initialize problem-specific data.
+This should be rather done in the eoInit object used to randomly initialize
+all individuals, or in the eoEvalFunc object, used to compute the fitness.
      • 
+
+
    • 
+The printOn method, that writes the object
+to a stream. You must
+call the EO::printOn method that will take care of the fitness,
+and then write the specific code for your data structure.
      • 
+
+
    • 
+The readFrom method, that will read an
+object from a stream. Again, you should call the
+EO::readFrom method first to take care of the fitness.
      • 
+
+
      Also note that readFrom will be generally called from an object that
+will have been constructed through the default constructor. This is why
+the EO objects that we provide always start printing structures with their
+length...
    
+You can of course also add a destructor
+if needed, and any other helper method. For instance, you will probably
+consider adding accessors and setters
+for the private data - unless you prefer to make everything public :-(
+
    See now an example of a comple eoOneMax.h
+file. Note that this is the only "colored" completed file we will show,
+you will have to go to the .../tutorial/OneMax
+dir to browse all files at once.
+
    
+
    Initialization:
+
    Initializer: eoOneMaxInit.h
+
    You must provide an eoInit
+object for your genotype, that is an object that will randomize
+a genotype built by the default constructor of the EO class
+(here, an eoOneMax object) . Here you must at least fill the
+code for such randomization.
+
    But you might also need some parameters (e.g. the size of the bitstring
+in eoOneMax): you should then pass
+them through the constructor of the eoOneMaxInit class, and store
+it in its private data.
+
    And of course you might need to add a destructor (no example here)
+if you use complex data type in the object.
+
    Parameters: make_genotype_OneMax.h
+
    There is another file you will probably want to modify as far as initialization
+is concerned, that is make_genotype_OneMax.h.
+Such helper files are used for all components of advanced EO programs (see
+Lesson 4). The main reason for that is to allow separate compilation of
+such sub-components for known EO types, as this is done in the directories
+src/ga and src/es. But a useful consequence is to make your code modular.
+For instance, the make_genotype_OneMax.h
+file takes care of all the preparation of all data regarding the eoInit
+object - and returns to the main fonction a reference to an eoInit that
+will later be used to initialize the whole
+population in a representation-independent way.
+
    What you have to do in that file is to set values for all parameters
+needed by the eoOneMaxInit class, for instance by reading them from the
+parser: this allows later to modify them easily from the command-line.
+Note however that an alternative could be to pass the parser to the constructor
+of the eoOneMaxInit class, and to read all parameters there...
+
    Note: Remember that the make_xxx
+files were first introduced to allow the user to compile sepearately most
+of the code of standard Evolutionary Algorithm written in EO for bitstring
+and real vector representations (
+
    
+
    Evaluation:
+eoOneMaxEvalFunc.h
+
    The eoOneMaxEvalFunc is
+the object that will compute the fitness of an
+eoOneMax object. You have to fill in the code
+for the computation of the fitness value (there is no way that this
+can be done automatically :-) Note that this code must  be run only
+if the _eo.invalid() test
+returns true, to avoid computing the fitness of an object that has not 
+been modified and thus still holds a valid fitness value. After computing
+the fitness, store it into the object by calling the fitness(FitnessType)
+method.
+
    Should you need some specific data for that, the constructor
+of the object is the place to get such data, and you should, again,
+store it in some private data
+of the class.
+
    
+
    Variation
+Operators
+
    You can write as many crossover and mutation operators as you like.
+However, we only provide the template files for quadratic
+crossover and mutation, but
+you could then easily write the equivalent code for binary crossover, or
+general variation operator.
+
    Crossover: eoOneMaxQuadCrossover.h
+
    As usual, you must go and write the code
+for the operator() that will perform the crossover, possibly modifying
+both arguments. Don't forget to update the boolean
+parameter that will report whether the genotypes have been modified
+- allowing to recompute the fitness only of the ones that have actually
+been modified. You can also have parameters
+to the crossover by passing
+them to the constructor, ans storing them in the private
+data of the crossover object.
+
    Mutation: eoOneMaxMutation.h
+
    Here again, you must go and write the code for the operator() that
+will perform the mutation, eventually modifying its arguments. Don't forget
+to update the boolean parameter that
+will report whether the genotype has been modified - allowing to recompute
+the fitness only of the ones that have actually been modified. You can
+also have parameters to the mutation
+by passing them to the constructor,
+ans storing them in the private data
+of the mutation object.
+
    Parameters: make_op_OneMax.h
+
    First of all, if you intend to use only one
+crossover operator and one mutation
+operator, you have nothing to modify
+in make_op_OneMax function, except maybe
+reading user-defined parameters (copy the code from make_genotype_OneMax)
+and passing them to the appropriate
+operator constructor.
+
    As it is written now, it allows you enter a crossover probability Pcross
+and a mutation probability Pmut,
+and to build an eoGeneralOp that will call in sequence the eoOneMaxQuadCrossover
+that is defined above with probability Pcross
+and the eoOneMaxMutation also
+defined above with probability Pmut. 
+Beware that all allocated objects must be stored in the eoState otherwise
+you will run into trouble (see EO Memory
+Management explanations).
+
    However, everything is there (commented out) to allow you to use more
+than one crossover and one mutation
+- provided you write the code for them , of course.
+
    The code starts by defining an eoOneMaxQuadCrossoverobject,
+then reads some application rate that is totally useless if you have only
+one crossover, then creates an eoPropCombinedQuadOp
+with this simple oeprator. The same story repeats for the mutation. Finally,
+the eoGeneralOp
+is created from those combined operators and the individulal level probabilities
+Pcross
+and  Pmut.
+
    In order to add a second crossover operator for instance (called eoOneMaxSecondCrossover
+in the commented code) all you need to is
+
      
+
    • 
+Create the code for the new class  eoOneMaxSecondCrossover:
+simply copy the eoOneMaxQuadCrossover.h
+file into eoOneMaxSecondCrossover.h 
+and change all names eoOneMaxQuadCrossover
+to  eoOneMaxSecondCrossover (inlcluding
+after the #ifdef statement!!!);
      • 
+
+
    • 
+Uncomment the corresponding lines
+in make_op_OneMax.h, possibly adding user-defined parameter reading
      • 
+
+
    • 
+Repeat as many times as you have operators, using of course different names!
+The same recommendations hold for mutations.
      • 
+
    
+In case you have more than one operator of a kind, then of course the relative
+weights of application do make sense, allowing you to tune with command-line
+parameters the proportion with which each operator that will be applied.
+
    
+
    Main
+files: OneMaxEA.cpp
+and OneMaxLibEA.cpp
+
    As a start, you should only (eventually) modify in OneMaxEA.cpp
+the type of fitness you
+will be handling, namely double
+if you are maximizing, or eoMinimizingFitness
+if you are minimizing. Then running
+make will result in a perfectly
+valid executable named OneMaxEA.
+
    The skeleton of the main file here mimics that of the main file in
+Lesson4,
+and uses the make_xxx separate
+files construct: the part of an Evolutionary Algorithm related to the
+evolution
+engine is indepenent of the representation,
+and can be directly used ... provided it is compiled with the right template
+(remember everything in EO is templatized
+over the EO objects it handles.  Main file OneMaxEA.cpp
+is written so that it includes eveything - and thus everytime you run make
+(or make OneMaxEA), you compile
+the code for make_pop, make_continue and make_checkpoint that is defined
+in the .../src/do directory.
+
    The basic construct is (for instance to build the evolution engine)
+
     
+
+
+
+
+
    #include <do/make_algo_scalar.h>
+
    eoAlgo<Indi>&  make_algo_scalar(eoParser&
+_parser, eoState& _state, eoEvalFunc<Indi>& _eval, eoContinue<Indi>&
+_continue, eoGenOp<Indi>& _op)
+
    {
+
     return do_make_algo_scalar(_parser,
+_state, _eval, _continue, _op);
+
    }
    
+First, include the code (from the do directory). Then define the make_xxx
+function from the do_make_xxx function.
+
    Of course, such construct is stupid here, as you could perfectly call
+directly the do_make_xxx function in the main. However, if you ever want
+to do separate compilation of some parts, you will need such construct
+(see Lesson4) so we have kept it here for
+consistency reasons.
+
    Go in your application directory, and look at the differences between
+both files and you'll see how this is handled in both cases.
+
    Reducing compilation time:
+
    However, we also provide another main file (OneMaxLibEA.cpp)that
+only includes the code that is specific to your application, and is supposed
+to be linked with another object file that will contain the code that is
+representation independent (make_OneMax.cpp). 
+This is done by running make OneMaxLibEA
+on the command-line.
+
    For example, on a PentiumIII 400MHz with g++ 2.96, compiling OneMaxEA
+takes about 33s, compiling both make_OneMax.o
+and OneMaxLibEA takes about
+54s but compiling only OneMaxLibEA
+takes only 14s  make_OneMax.o
+is up-to-date ...
+
    Hints:
+
    While developping the genotype structure itself in file eoOneMax.h,
+you should use the OneMaxEA.cpp
+file. But after the eoOneMax.h
+file is frozen, you should use the eoOneMaxLibEA.cpp
+file. Of course, both  resulting programs are strictly identical!
+
    
+
    Lesson
+4 -
+Lesson 6 -
+Main
+page -
+Algorithm-Based - Component-Based
+- Hints - EO
+documentation
+
    
+
    
+
    
+Marc Schoenauer
    
+
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/eoOneMax.html b/trunk/paradiseo-eo/tutorial/html/eoOneMax.html
new file mode 100644
index 000000000..8f8cfb03e
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/eoOneMax.html
@@ -0,0 +1,209 @@
+
+
+
+   
+   
+   Templates/eoOneMax.h
+
+
+Back to Lesson 5 - Tutorial
+main page - Top-Down page - Bottom-up
+page - Programming hints - EO
+documentation
+
    
+
    
+
    
+
    
+Templates/eoOneMax.h
    
+The places where you have to put some code are on pink
+background.. Only the the character
+colors have the usual meaning.
+
    
+
+
+
+
+
    /** -*- mode: c++; c-indent-level:
+4; c++-member-init-indent: 8; comment-column: 35; -*-
+
    The above line is usefulin Emacs-like editors
+
    */
+
    /*
+
    Template for creating a new representation
+in EO
+
    ================================================
+
    */
+
    #ifndef _eoOneMax_h
+
    #define _eoOneMax_h
+
    /** 
+
    *  Always write a comment in this format
+before class definition
+
    *  if you want the class to be documented
+by Doxygen
+
    * Note that you MUST derive your structure
+from EO<fitT>
+
    * but you MAY use some other already prepared
+class in the hierarchy
+
    * like eoVector for instance, if you handle
+a vector of something....
+
    * If you create a structure from scratch,
+
    * the only thing you need to provide are 
+
    *             
+a default constructor
+
    *             
+IO routines printOn and readFrom
+
    *
+
    * Note that operator<< and operator>>
+are defined at EO level
+
    * using these routines
+
    */
    
+
+
+
+
+
+
    template< class FitT>
+
    class eoOneMax: public EO<FitT> {
+
    public:
+
      /** Ctor: you MUST provide
+a default ctor.
+
       * though such individuals will
+generally be processed 
+
       * by some eoInit object
+
       */
+
     eoOneMax() 
+
     { 
    
+
+
+
+
+
+
         
+// START Code of default Ctor of an eoOneMax object
+
          //
+END    Code of default Ctor of an eoOneMax object
    
+
+
+
+
+
+
     }
+
     virtual ~eoOneMax()
+
     {
    
+
+
+
+
+
+
         
+// START Code of Destructor of an eoEASEAGenome object
+
          //
+END    Code of Destructor of an eoEASEAGenome object
    
+
+
+
+
+
+
     }
+
     virtual string className() const
+{ return "eoOneMax"; }
+
     
    
+
+
+
+
+
+
      /** printing... */
+
     void printOn(ostream& os) const
+
     {
+
          //
+First write the fitness
+
         EO<FitT>::printOn(os);
+
         os << '
+';
    
+
+
+
+
+
+
         
+// START Code of default output 
+
    /** HINTS
+
    * in EO we systematically write the sizes
+of things before the things
+
    * so readFrom is easier to code (see below)
+
    */
+
          // END   
+Code of default output
    
+
+
+
+
+
+
         }
+
      /** reading... 
+
       * of course, your readFrom must
+be able to read what printOn writes!!!
+
       */
+
     void readFrom(istream& is)
+
     {
+
          //
+of course you should read the fitness first!
+
         EO<FitT>::readFrom(is);
    
+
+
+
+
+
+
         
+// START Code of input
+
    /** HINTS
+
    * remember the eoOneMax object will come
+from the default ctor
+
    * this is why having the sizes written out
+is useful
+
    */
+
          // END   
+Code of input
    
+
+
+
+
+
+
     }
+
     
    
+
+
+
+
+
+
    private:     //
+put all data here
    
+
+
+
+
+
+
          //
+START Private data of an eoOneMax object
+
          //
+END    Private data of an eoOneMax object
    
+
+
+
+
+
+
    };
+
    #endif
    
+
+
    Back to Lesson 5 - Tutorial
+main page - Top-Down page - Bottom-up
+page - Programming hints - EO
+documentation
+
    
+
    
+Marc Schoenauer
    
+
+
    Last modified: Fri May
+3 06:06:09 2002
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/eoOneMaxEvalFunc.html b/trunk/paradiseo-eo/tutorial/html/eoOneMaxEvalFunc.html
new file mode 100644
index 000000000..4d6eefbff
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/eoOneMaxEvalFunc.html
@@ -0,0 +1,160 @@
+
+
+
+   
+   
+   Templates/eoOneMaxEvalFunc.h
+
+
+Back to Lesson 5
+- Tutorial main page - Top-Down
+page - Bottom-up page - Programming
+hints - EO
+documentation
+
    
+
    
+
    
+
    
+Templates/eoOneMaxEvalFunc.h
    
+The places where you have to put some code are on pink
+background.. Only the the character
+colors have the usual meaning.
+
    
+
+
+
+
+
    /** -*- mode: c++; c-indent-level:
+4; c++-member-init-indent: 8; comment-column: 35; -*-
+
    The above line is usefulin Emacs-like editors
+
    */
+
    /*
+
    Template for evaluator in EO, a functor that
+computes the fitness of an EO
+
    ==========================================================================
+
    */
+
    #ifndef _eoOneMaxEvalFunc_h
+
    #define _eoOneMaxEvalFunc_h
+
    // include whatever general include you need
+
    #include <stdexcept>
+
    #include <fstream>
+
    // include the base definition of eoEvalFunc
+
    #include "eoEvalFunc.h"
+
    /** 
+
     Always write a comment in this format
+before class definition
+
     if you want the class to be documented
+by Doxygen
+
    */
    
+
+
+
+
+
+
    template <class EOT>
+
    class eoOneMaxEvalFunc : public eoEvalFunc<EOT>
+
    {
+
    public:
+
    /// Ctor - no requirement
    
+
+
+
+
+
+
    // START eventually
+add or modify the anyVariable argument
+
     eoOneMaxEvalFunc()
+
      //  eoOneMaxEvalFunc(
+varType  _anyVariable) : anyVariable(_anyVariable) 
+
    // END eventually add or modify the anyVariable
+argument
    
+
+
+
+
+
+
     {
    
+
+
+
+
+
+
          //
+START Code of Ctor of an eoOneMaxEvalFunc object
+
          //
+END    Code of Ctor of an eoOneMaxEvalFunc object
    
+
+
+
+
+
+
     }
+
      /** Actually compute the fitness
+
       *
+
       * @param EOT & _eo the EO
+object to evaluate
+
       *                                 
+it should stay templatized to be usable 
+
       *                                 
+with any fitness type
+
       */
+
     void operator()(EOT & _eo)
+
     {
+
          //
+test for invalid to avoid recomputing fitness of unmodified individuals
+
         if (_eo.invalid())
+
            
+{
+
    double fit;    
+// to hold fitness value
    
+
+
+
+
+
+
         
+// START Code of computation of fitness of the eoOneMax object
+
    // fit = blablabla
+
          //
+END    Code of computation of fitness of the eoOneMax object
    
+
+
+
+
+
+
    _eo.fitness(fit);
+
            
+}
+
     }
+
    private:
    
+
+
+
+
+
+
    // START Private data
+of an eoOneMaxEvalFunc object
+
      //  varType anyVariable;   
+// for example ...
+
    // END    Private data of
+an eoOneMaxEvalFunc object
    
+
+
+
+
+
+
    };
+
    #endif
    
+
+
    Back to Lesson 5 - Tutorial
+main page - Top-Down page - Bottom-up
+page - Programming hints - EO
+documentation
+
    
+
    
+Marc Schoenauer
    
+
+
    Last modified: Fri May
+3 06:14:25 2002
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/eoOneMaxInit.html b/trunk/paradiseo-eo/tutorial/html/eoOneMaxInit.html
new file mode 100644
index 000000000..07475be6f
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/eoOneMaxInit.html
@@ -0,0 +1,153 @@
+
+
+
+   
+   
+   Templates/eoOneMaxInit.h
+
+
+Back to Lesson 5 -
+Tutorial main page - Top-Down
+page - Bottom-up page - Programming
+hints - EO
+documentation
+
    
+
    
+
    
+
    
+Templates/eoOneMaxInit.h
    
+The places where you have to put some code are on pink
+background.. Only the the character
+colors have the usual meaning.
+
    
+
+
+
+
+
    /** -*- mode: c++; c-indent-level:
+4; c++-member-init-indent: 8; comment-column: 35; -*-
+
    The above line is usefulin Emacs-like editors
+
    */
+
    /*
+
    Template for EO objects initialization in
+EO
+
    ============================================
+
    */
+
    #ifndef _eoOneMaxInit_h
+
    #define _eoOneMaxInit_h
+
    // include the base definition of eoInit
+
    #include <eoInit.h>
+
    /** 
+
    *  Always write a comment in this format
+before class definition
+
    *  if you want the class to be documented
+by Doxygen
+
    *
+
    * There is NO ASSUMPTION on the class GenoypeT.
+
    * In particular, it does not need to derive
+from EO (e.g. to initialize 
+
    *      atoms of
+an eoVector you will need an eoInit<AtomType>)
+
    */
    
+
+
+
+
+
+
    template <class GenotypeT>
+
    class eoOneMaxInit: public eoInit<GenotypeT>
+{
+
    public:
+
    /// Ctor - no requirement
    
+
+
+
+
+
+
    // START eventually
+add or modify the anyVariable argument
+
     eoOneMaxInit()
+
      //  eoOneMaxInit( varType 
+_anyVariable) : anyVariable(_anyVariable) 
+
    // END eventually add or modify the anyVariable
+argument
    
+
+
+
+
+
+
     {
    
+
+
+
+
+
+
          //
+START Code of Ctor of an eoOneMaxInit object
+
          //
+END    Code of Ctor of an eoOneMaxInit object
    
+
+
+
+
+
+
     }
+
      /** initialize a genotype
+
       *
+
       * @param _genotype  generally
+a genotype that has been default-constructed
+
       *                                   
+whatever it contains will be lost
+
       */
+
     void operator()(GenotypeT &
+_genotype)
+
     {
    
+
+
+
+
+
+
         
+// START Code of random initialization of an eoOneMax object
+
          //
+END    Code of random initialization of an eoOneMax object
    
+
+
+
+
+
+
         _genotype.invalidate();    
+// IMPORTANT in case the _genotype is old
+
     }
+
    private:
    
+
+
+
+
+
+
    // START Private data
+of an eoOneMaxInit object
+
      //  varType anyVariable;   
+// for example ...
+
    // END    Private data of
+an eoOneMaxInit object
    
+
+
+
+
+
+
    };
+
    #endif
    
+
+
    Back to Lesson 5 - Tutorial
+main page - Top-Down page - Bottom-up
+page - Programming hints - EO
+documentation
+
    
+
    
+Marc Schoenauer
    
+
+
    Last modified: Fri May
+3 06:17:21 2002
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/eoOneMaxMutation.html b/trunk/paradiseo-eo/tutorial/html/eoOneMaxMutation.html
new file mode 100644
index 000000000..5181567ff
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/eoOneMaxMutation.html
@@ -0,0 +1,168 @@
+
+
+
+   
+   
+   eoOneMaxMutation.h
+
+
+Back to Lesson 5 - Tutorial
+main page - Top-Down page - Bottom-up
+page - Programming hints - EO
+documentation
+
    
+
    
+
    
+
    
+eoOneMaxMutation.h
    
+The places where you have to put some code are on pink background.
+Only the the character colors have the usual meaning.
+
     
+
+
+
+
+
+
    
+/** -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
    
+The above line is useful in Emacs-like editors
    
+ */
    
+/*
    
+Template for simple mutation operators
    
+======================================
    
+*/
    
+#ifndef eoOneMaxMutation_H
    
+#define eoOneMaxMutation_H
    
+#include <eoOp.h>
    
+/** 
    
+ *   Always write a comment in this format before class definition
    
+ *   if you want the class to be documented by Doxygen
    
+ *
    
+ * THere is NO ASSUMPTION on the class GenoypeT.
    
+ * In particular, it does not need to derive from EO
    
+ */
    
+    
+
    
+
+
+
+
+
    
+
+template<class GenotypeT> 
    
+class eoOneMaxMutation: public eoMonOp<GenotypeT>
    
+{
    
+public:
    
+   /**
    
+     * Ctor - no requirement
    
+     */
    
+    
+
    
+
+
+
+
+
    
+
+// START eventually add or modify the anyVariable argument
    
+   eoOneMaxMutation()
    
+   //   eoOneMaxMutation( varType   _anyVariable) : anyVariable(_anyVariable) 
    
+// END eventually add or modify the anyVariable argument
    
+    
+
    
+
+
+
+
+
    
+
+   {
    
+    
+
    
+
+
+
+
+
    
+
+       // START Code of Ctor of an eoOneMaxEvalFunc object
    
+       // END     Code of Ctor of an eoOneMaxEvalFunc object
    
+    
+
    
+
+
+
+
+
    
+
+   }
    
+   /// The class name. Used to display statistics
    
+   string className() const { return "eoOneMaxMutation"; }
    
+   /**
    
+     * modifies the parent
    
+     * @param _genotype The parent genotype (will be modified)
    
+     */
    
+   bool operator()(GenotypeT & _genotype) 
    
+   {
    
+       bool isModified;
    
+    
+
    
+
+
+
+
+
    
+
+       // START code for mutation of the _genotype object
    
+             /** Requirement
    
+* if (_genotype has been modified)
    
+*         isModified = true;
    
+* else
    
+*         isModified = false;
    
+*/
    
+       return isModified;
    
+       // END code for mutation of the _genotype object
    
+    
+
    
+
+
+
+
+
    
+
+   }
    
+private:
    
+    
+
    
+
+
+
+
+
    
+
+// START Private data of an eoOneMaxMutation object
    
+   //   varType anyVariable;		     // for example ...
    
+// END     Private data of an eoOneMaxMutation object
    
+    
+
    
+
+
+
+
+
    
+
+};
    
+#endif
    
+
    
+
    Back to Lesson 5 - Tutorial
+main page - Top-Down page - Bottom-up
+page - Programming hints - EO
+documentation
+
    
+
    
+Marc Schoenauer
    
+
    Last
+modified: Wed May  1 07:18:00 2002
+
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/eoOneMaxQuadCrossover.html b/trunk/paradiseo-eo/tutorial/html/eoOneMaxQuadCrossover.html
new file mode 100644
index 000000000..a91a653ea
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/eoOneMaxQuadCrossover.html
@@ -0,0 +1,168 @@
+
+
+
+   
+   
+   Templates/eoOneMaxQuadCrossover.h
+
+
+Back to Lesson
+5 - Tutorial main page - Top-Down
+page - Bottom-up page - Programming
+hints - EO
+documentation
+
    
+
    
+
    
+
    
+Templates/eoOneMaxQuadCrossover.h
    
+The places where you have to put some code are on pink
+background.. Only the the character
+colors have the usual meaning.
+
    
+
+
+
+
+
    /** -*- mode: c++; c-indent-level:
+4; c++-member-init-indent: 8; comment-column: 35; -*-
+
    The above line is usefulin Emacs-like editors
+
    */
+
    /*
+
    Template for simple quadratic crossover operators
+
    =================================================
+
    Quadratic crossover operators modify the
+both genotypes
+
    */
+
    #ifndef eoOneMaxQuadCrossover_H
+
    #define eoOneMaxQuadCrossover_H
+
    #include <eoOp.h>
+
    /** 
+
    *  Always write a comment in this format
+before class definition
+
    *  if you want the class to be documented
+by Doxygen
+
    *
+
    * THere is NO ASSUMPTION on the class GenoypeT.
+
    * In particular, it does not need to derive
+from EO
+
    */
    
+
+
+
+
+
+
    template<class GenotypeT> 
+
    class eoOneMaxQuadCrossover: public eoQuadOp<GenotypeT>
+
    {
+
    public:
+
      /**
+
       * Ctor - no requirement
+
       */
    
+
+
+
+
+
+
    // START eventually
+add or modify the anyVariable argument
+
     eoOneMaxQuadCrossover()
+
      //  eoOneMaxQuadCrossover(
+varType  _anyVariable) : anyVariable(_anyVariable) 
+
    // END eventually add or modify the anyVariable
+argument
    
+
+
+
+
+
+
     {
    
+
+
+
+
+
+
          //
+START Code of Ctor of an eoOneMaxEvalFunc object
+
          //
+END    Code of Ctor of an eoOneMaxEvalFunc object
    
+
+
+
+
+
+
     }
+
      /// The class name. Used to
+display statistics
+
     string className() const { return
+"eoOneMaxQuadCrossover"; }
+
      /**
+
       * eoQuad crossover - modifies
+both parents
+
       * @param _genotype1 The first
+parent
+
       * @param _genotype2 The second
+parent
+
       */
+
     bool operator()(GenotypeT& _genotype1,
+GenotypeT & _genotype2) 
+
     {
+
         bool oneAtLeastIsModified;
    
+
+
+
+
+
+
         
+// START code for crossover of _genotype1 and _genotype2 objects
+
               
+/** Requirement
+
    * if (at least one genotype has been modified)
+// no way to distinguish
+
    *       
+oneAtLeastIsModified = true;
+
    * else
+
    *       
+oneAtLeastIsModified = false;
+
    */
+
         return oneAtLeastIsModified;
+
          //
+END code for crossover of _genotype1 and _genotype2 objects
    
+
+
+
+
+
+
     }
+
    private:
    
+
+
+
+
+
+
    // START Private data
+of an eoOneMaxQuadCrossover object
+
      //  varType anyVariable;   
+// for example ...
+
    // END    Private data of
+an eoOneMaxQuadCrossover object
    
+
+
+
+
+
+
    };
+
    #endif
    
+
+
    Back to Lesson 5 - Tutorial
+main page - Top-Down page - Bottom-up
+page - Programming hints - EO
+documentation
+
    
+
    
+Marc Schoenauer
    
+
+
    Last modified: Fri May
+3 07:47:13 2002
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/eoOneMax_complete.html b/trunk/paradiseo-eo/tutorial/html/eoOneMax_complete.html
new file mode 100644
index 000000000..0c6c24680
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/eoOneMax_complete.html
@@ -0,0 +1,192 @@
+
+
+
+   
+   
+   Templates/eoOneMax_complete.h
+
+
+Back to Lesson 5
+- Tutorial main page - Top-Down
+page - Bottom-up page - Programming
+hints - EO
+documentation
+
    
+
    
+
    
+
    
+Templates/eoOneMax_complete.h
    
+The user-defined code is on pink background..
+Only the the character colors have the
+usual meaning.
+
    
+
+
+
+
+
    /** -*- mode: c++; c-indent-level:
+4; c++-member-init-indent: 8; comment-column: 35; -*-
+
    The above line is usefulin Emacs-like editors
+
    */
+
    /*
+
    Template for creating a new representation
+in EO
+
    ================================================
+
    */
+
    #ifndef _eoOneMax_h
+
    #define _eoOneMax_h
+
     
    
+
+
+
+
+
+
    /** 
+
    * A simple example class for bitstring (is
+NOT supposed to be used :-)
+
    */
    
+
+
+
+
+
+
    
+
+
+
+
+
+
    template< class FitT>
+
    class eoOneMax: public EO<FitT> {
+
    public:
+
      /** Deafult Ctor: nothing to
+be done */
+
     eoOneMax() {}
+
     virtual string className() const
+{ return "eoOneMax"; }
+
     
    
+
+
+
+
+
+
      /** printing... */
+
         void printOn(ostream&
+_os) const
+
         {
+
             
+// First write the fitness
+
            
+EO<FitT>::printOn(_os);
+
            
+_os << ' ';
    
+
+
+
+
+
+
            
+_os << b.size() << ' ' ;
+
            
+for (unsigned i=0; i<b.size(); i++)
+
                
+_os << b[i] << ' ' ;
    
+
+
+
+
+
+
         }
+
      /** reading... 
+
       * of course, your readFrom must
+be able to read what printOn writes!!!
+
       */
+
     void readFrom(istream& _is)
+
     {
+
          //
+of course you should read the fitness first!
+
         EO<FitT>::readFrom(_is);
    
+
+
+
+
+
+
         unsigned s;
+
         _is >> s;
+
         b.resize(s);
+
         for (unsigned
+i=0; i<s; i++)
+
            
+{
+
                
+bool bTmp;
+
                
+_is >> bTmp;
+
                
+b[i] = bTmp;
+
            
+} 
    
+
+
+
+
+
+
     }
    
+
+
+
+
+
+
    
+
+
+
+
+
+
      // brute setting (we could
+also have defined a Ctor from a vector<bool>)
+
     void setB(vector<bool> &
+_b)
+
     {
+
         b=_b;
+
     }
+
      // brute accessing (we could
+also define operator[] ...)
+
     const vector<bool> & B()
+
     {
+
         return b;
+
     }
    
+
+
+
+
+
+
    
+
    private:     //
+put all data here
    
+
+
+
+
+
+
     std::vector<bool> b;
    
+
+
+
+
+
+
    };
+
    #endif
    
+
+
    Back to Lesson 5 - Tutorial
+main page - Top-Down page - Bottom-up
+page - Programming hints - EO
+documentation
+
    
+
    
+Marc Schoenauer
    
+
+
    Last modified: Sat May
+4 06:02:46 2002
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/eoOperators.html b/trunk/paradiseo-eo/tutorial/html/eoOperators.html
new file mode 100644
index 000000000..4de7b40fd
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/eoOperators.html
@@ -0,0 +1,818 @@
+
+
+
+   
+   
+   Variation Operators
+
+
+General: Algorithm-Based
+- Component-Based - Programming
+hints - EO
+documentation
+
    
+
    
+
    Local: Introduction
+- Crossover - Mutation
+- Combinations - General
+Operators - Populators - General
+combinations- Advanced operators
+
    
+
    
+
    
+
    
+Variation Operators
    
+Variation
+Operators
+
    Variation operators modify the gnotype of individuals, or, equivalently,
+move them in the search space. In Evolutionary Algorithms, varitaion operators
+are almost always stochastic, i.e.
+they are based on random numbers, or equivalently, perform random modifications
+of their arguments. Variation operators are classified depending on the
+number of arguments they use and/or modify.
+
      
+
    • 
+Variation operators involving two individuals
+are called crossover operators. They can either
+modify one of the parents according to the material of the other parent,
+or modify both parents. In EO, the former are called Binary operators and
+the latter Quadratic operators.
      • 
+
+
    • 
+Variation operators involving one single individual
+are called mutation operators.
      • 
+
+
    • 
+Straightforward extensions of these simple operators allow to combine them:
+in
+proportional combinations, one operator
+is chosen among a given set of operators of same arity according to some
+weights.
      • 
+
+
    • 
+In EO you can also define and use variation operators that generate any
+number of offspring from any number of parents (sometimes termed orgy
+operators). They are called general operators.
      • 
+
+
    • 
+However, the interface of such operators was designed for their use inside
+general
+combinations: you can use proportional combination,
+in which one operator is chosen among a given set of operators of same
+arity according to some weights, as for simple operators except that operators
+of different arities can be mixed, but you can also use sequential
+combinations, where different operators  are applied in
+turn with given probability. But you can also embed any of such combinations
+at any depth.
      • 
+
+
    • 
+The price to pay for that is that you must use an instermediate class to
+access the individuals, the eoPopulator class.
      • 
+
+
    • 
+Thanks to that class, it also become easy to design advanced
+operators, such as crossover operators where the mate is chosen according
+to sexual preference rather than fitness-based
+preferences.
      • 
+
    
+Implementation
+
    The basic idea of EO variation operators is that they operate on genotypes
+only. Hence there should be generally no reference to anything related
+to the fitness within a variation operator. However, whenever the genotype
+of an individual has been modified, it will be necessary to recompute its
+fitness before any selection process. This is why all
+variation operator return a bool that indicates whether or not
+the genotype argument has been modified or not.
+
    EO classes for variation operators:
+
    
+
+
    Simple
+operators: Crossover
+
    The characteristic of crossover operators is that they involve two parents.
+However, there are crossover operators that generate two parents, and some
+that generate one parent only, and both types are available in EO. The
+former type (2 --> 2) is termed quadratic crossover operator, and is implemanted
+in the eoQuadOp class; the latter type
+(2 --> 1) is termed binary operator and is implemanted in class eoBinOp.
+Both classes are, as usual, templatized by the type of individual they
+can handle (see documentation for eoBinOp
+and eoQuadOp).
+
    Note: Whereas it is straightforward
+to create a binary crossover operator from a quadratic one (by discarding
+the changes on the second parent), the reverse might prove impossible (imagine
+a binary crossover that simply merges the parents material: there is no
+way to generate two new parents from that!).
+
    Interfaces:
+
    The general approach in EO about simple variation operators is to perform
+in-place
+modifications, i.e. modifying the arguments rather than generating
+new (modified) individuals. This results in the following interfaces for
+the functor objects eoBinOp and eoQuadOp:
+
    bool operator()(EOT & , const EOT &)        
+for eoBinOp (note the const)
+
    bool operator()(EOT & , EOT &
+)                      
+for eoQuadOp
+
    which you could have guessed from the inheritance diagrams up to the
+eoBF abstract class. You can also guess that only the first argument will
+be modified by an oeBin object, while both arguments will be modified by
+an eoQuad object.
+
    Using crossover operators:
+
    Directly applying crossover operators is straightforward from the interface
+above:
+
    eoBinOpDerivedClass<Indi> myBinOp(parameters);
+// 
+use constructor to pass
+
    eoQuadOpDerivedClass<Indi> myQuadOp(parameters);
+// 
+any useful argument
+
    Indi eo1= ..., eo2= ...;   //
+the candidates to crossover
+
    if (myBinOp(eo1, eo2))
+
       { ...              
+// eo1 has been modified, not eo2
+
       }
+
    else ...              
+// none has been modified
+
    if (myQuadOp(eo1, eo2))
+
       { ...              
+// both eo1 and eo2 have been modified
+
       }
+
    else ...              
+// none has been modified
+
    However, you will hardly have to actually apply operators to individuals,
+as operators are used within other classes, and are applied systematically
+to whole sets of individuals (e.g. that have already been selected, in
+standard generation-based evolutionary algorithms).
+
    Hence the way to use such operators will more likely ressemble this
+if you are using for instance an SGA. See also the different ways that
+are described below, encapsulating the operators into combined operators
+objects.
+
    Writing a crossover
+operator:
+
    There are three things to modify in the template class definitions
+provided in the Templates directory for both binary
+crossover and quadratic crossovers
+(apart from the name of the class you are creating!)
+
      
+
    • 
+The constructor, where you pass to the object
+any useful parameter (see the private data at end of class definition).
      • 
+
+
    • 
+The operator() method, which performs the
+actual crossover.
      • 
+
+
    • 
+The return value, that should be true
+as soon as at least one genotype has actually been modified. Otherwise,
+the lazy fitness evaluation procedure in
+EO might not know it should compute the fitness again and will keep the
+old value.
      • 
+
    
+
+
    Simple
+operators: Mutation
+
    Mutation operators modify one single individual. The corresponding
+EO class is called eoMonOp. and it
+si as usual templatized by the type of individual it can handle (see documentation
+for eoMonOp).
+
    Interfaces:
+
    The general approach in EO about simple variation operators is to perform
+in-place
+modifications, i.e. modifying the arguments rather than generating
+new (modified) individuals. This results in the following interface for
+the functor objects eoMonOp:
+
    bool operator()(EOT & )
+
    which you could have guessed from the inheritance diagrams up to the
+eoUF abstract class.
+
    Using mutation operators:
+
    Directly applying mutation operators is straightforward from the interface
+above:
+
    eoMonOpDerivedClass<Indi> myMutation(parameters);
+//pass parameters in constructor
+
    Indi eo = ...;          
+// eo is candidate to mutation
+
    if (myMutation(eo))
+
       { ...    //
+eo has been modified
+
       }
+
    else      //
+eo has not been modified
+
    However, you will hardly have to actually apply operators to individuals,
+as operators are used within other classes, and are applied systematically
+to whole sets of individuals (e.g. that have already been selected, in
+standard generational evolutionary algorithms).
+
    Hence the way to use such operators will more likely ressemble this
+if you are using for instance an SGA. See also the different ways that
+are described below, encapsulating the operators into combined operators
+objects.
+
    Writing a mutation
+operator:
+
    There are only two things to modify in the template
+class definitions provided in the Templates directory (apart from the
+name of the class you are creating!)
+
      
+
    • 
+The constructor, where you pass to the object
+any useful parameter (see the private data at end of class definition).
      • 
+
+
    • 
+The operator() method, which performs the
+actual crossover.
      • 
+
+
    • 
+The return value, that should be true
+as soon as the genotype has actually been modified.  Otherwise, the
+lazy
+fitness evaluation procedure in EO might not know it should compute
+the fitness again and will keep the old value.
      • 
+
    
+
+
    Combining
+simple operators: proportional combinations
+
    The best thing to do is to go to the Lesson2
+of the tutorial, where everything is explained. You will find out how you
+can use
+
    several mutations (respectiveley quadratic crossovers) as a single
+operator: every time the operator is called, one of the available operators
+is chosen by some roulette wheel selection using realtive weights.
+
    
+
    General
+Operators
+
    General operators in EO are variation operators that are neither simple
+mutations nor simple crossovers. They can involve any number of parents,
+and create any number of offspring. Moreover, they can make use of different
+ways to get the parents they will involve, e.g. they can use a different
+selector for each of the parents they need to select.
+
    The corresponding EO class is called eoGenOp.
+and it is as usual templatized by the type of individual it can handle
+(see documentation for eoGenOp
+:-)
+
    Interface:
+
    All the work a general operator is done within the apply()
+method. WHy not in the usual operator() method? Because some memory management
+are needed, that are performed in the base class itself - which then calls
+the virtual apply() method.
+The interface for a eoGenOp thus is
+not deducible from its inheritance diagram, and actually is
+
        void apply(eoPopulator<EOT>&
+_plop)
+
    As you can see,the interface for eoGenOp
+is based on that of another class, called eoPopulator.
+An
+eoPopulator
+is a population, but also behaves like
+an iterator over a population (hence
+the name, Population-Iterator). 
+However, please note that you should probably never use an eoGenOp alone,
+but rather through objects of type eoOpContainer.
+
    This results in the following general interface for an eoGenOp:
+It receives as argument an eoPopulator,
+gets the individuals it needs using the operator*,
+and must handle the positinning of the  using the ++operator
+method (Warning: the operator++
+method is not defined, as recommended by many good-programming-style books).
+
    bool apply()(eoPopulator&
+_pop)
+
    {
+
       EOT& parent1 = *_pop;
+//
+select the first parent
+
       ++_plop;   //
+advance once for each selected parents
+
       ...
+
       EOT& parentN = *_pop;
+//
+select the last parent
+
           //
+don't advance after the last one: _plop always
+
               
+// points to the last that has already been treated
+
    // do whatever the operator is supposed to
+do
+
    }
+
    Warning: as said above, an eoPopulator
+should always point to the last individual that has already been treated.
+This is because it is intended to be used within a loop that looks like
+(see e.g. eoBreeder
+class):
+
          eoSelectivePopulator<EOT>
+popit(_parents, _offspring, select);    // eoSelect
+is an eoSelectOne
+
          while (_offspring.size()
+< target)
+
             
+{
+
                  
+op(popit);
+
                 
+++it;
+
             
+}
+
    What happens next? Well, it all
+depends on how many parents and how many offspring your general op needs:
+
      
+
    • 
+If the number of generated offspring is equal
+to the number of parents, the operator simply needs to modify them (they
+are passed by reference, no useless copy takes place).
      • 
+
+
    • 
+If the operator produces more offspring than there
+were parents, it needs to insert them into the list using the insert
+method of the class eoPopulator as
+in the following:
      • 
+
+
       
+
       
+
      void apply()(eoPopulator&
+_pop)
+
      {
+
        // get the necessary number
+of parents (see above)
+
        ...
+
        // Now create any supplementary offspring
+
        EOT ofs1 = create_individual(...);
+
        ...
+
        EOT ofsK = create_individual(...);
+
        // advance and inserts offspring in
+_pop after parentN
+
        ++_pop;
+
        _pop.insert(ofs1);
+
        ...
+
        // invalidate the parents that
+have been modified
+
        parent1.invalidate();
+
        ...
+
        parentN.invalidate();
+
      }   // over
+
      Of course the size of the resulting population will grow - and you should
+have a replacement procedure that takes care of that.
+
       
+
    • 
+The case where more parents are needed than offspring
+will be created is a little more delicate: think about eoBinOp,
+and try to imagine the reasons why no crossover of that class are used
+in the first lessons of the tutorial, within the SGA framework.
      • 
+
+
      There are two possibilities:
+
        
+
      • 
+If you think "generational", the first idea is to get the parents from
+outside the curent list, so the total number of (intermediate) offspring
+is always equal to the initial population size. By chance, the eoPopulatorhas
+a handle on the initial population that was used to start the process,
+and you can access it from inside the GenOp method. For instance
        • 
+
+
         
+
         
+
        void apply()(eoPopulator&
+_pop)
+
        {
+
          // get as many parents as you
+will have offspring (see above)
+
          ...
+
          // get extra parents - use
+private selector
+
          const EOT& parentN+1 = select(_pop.source());
+
          ...
+
          const EOT& parentM = select(_pop.source());
+
          // do whatever needs to be done
+
          ...
+
          // and of course invalidate fitnesses
+of remaining modified parents
+
          parent1.invalidate();
+
          ...
+
          parentN.invalidate();
+
        }
+
        where select is any selector you like. Note the
+const: you are not allowed to modify an element of the original
+population (but you could of course have copied it!). As usual, the select
+selector was passed to the operator at construct time. This typically allows
+one to use a different selector for one parent and the others, as demonstrated
+here.
+
         
+
      • 
+If you don't care about the size of the offspring population (that is,
+if that size os controlled elsewhere, e.g. in some external loop), you
+can use the inbedded select method of the class eoPopulator.
+For instance
        • 
+
+
         
+
         
+
        void apply()(eoPopulator&
+_pop)
+
        {
+
          // get as many parents as you
+will have offspring (see above)
+
          ...
+
          // get extra parents - use
+populator selector
+
          const EOT& parentN+1 = _pop.select();
+
          ...
+
          const EOT& parentM = _pop.select();
+
          // do whatever needs to be done
+
          ...
+
          // and of course invalidate fitnesses
+of remaining modified parents
+
          parent1.invalidate();
+
          ...
+
          parentN.invalidate();
+
        }
      
+
    
+Warning: if you use operators that
+have different number of parents than offspring, you are deviating from
+the simple generational approach. Be careful to have the proper replacement
+procedure to take care of the population size: in most instances of algorithms
+that come within EO, this is enforced (an exception is thrown if population
+size varies from one genertaion to the other) but this might not be true
+for all forthcoming EO algorithms.
+
    Using general operators:
+
    Directly applying general operators to given individuals is impossible
+in EO, due to its interface. You need the help
+of an individual dispenser of class eoPopulator.
+But anyway general operators were thought to be used putely in eoOpContainer,
+as described below.
+
    Writing a general
+operator:
+
    There are many things to do to write a general operator - but the Templates
+directory contains some sample tempaltes files to help you. It all depends
+on whether you want more or less offspring than parents, and whetehr you
+want the same selector for every parent or more specialized selectors.
+
      
+
    • 
+It you want more (or as many) offspring than
+parents, you should use the moreOffspringGenOp.tmpl
+template - if you want to use the same selector for all parents, the one
+embedded in the argument eoPopulator.
+Otherwise, you'll have to write your own operator based on an external
+selector, as described in lessOffspringExternalSelectorGenOp.tmpl.
      • 
+
+
    • 
+If you decide to have more parents than offspring, you can decide either
+to get the extra parents using the eoPopulator 
+own selector (see lessOffspringSameSelectorGenOp.tmpl,
+or to use an external selector (passed at construct-time) as described
+in lessOffspringExternalSelectorGenOp.tmpl.
      • 
+
+
    • 
+Now you can modify the constructor, where
+you pass to the object any useful parameter (see private data at end of
+class definition). In case you need an external selector, you have to choose
+it (or write it!) - it should be an eoSelectOne
+object.
      • 
+
+
    • 
+Finally, write the core of the operator in method apply().
+Remember you must use the argument eoPopulator
+to
+access the members of the population in turn (method
+operator*),
+you may use the initial population (method source()),
+as well as the insert methods.
      • 
+
    
+
+
      Warning: in general operators,
+you must not forget to invalidate the
+fitness of any individual that has actually been modified. this implicitely
+implies that general operators can only be applied to EO object (i.e. objects
+with a fitness), and not to any type of structure.
+
      It you don't invalidate the individual, the lazy
+fitness evaluation procedure in EO will not know it should compute
+the fitness again and will keep the old obsolete value.
    
+
+
    The
+populators:
+
    As has been said above, an
+eoPopulator
+mainly behaves like an iterator over
+a population (hence the name, Population-Iterator).
+
    The basic
+interface of an eoPopulator
+(see also the documentation,
+of course) is the following:
+
      
+
    • 
+Individuals are accessed through the operator*;
      • 
+
+
    • 
+Basic iterator operations are available, like (pre)incrementation through
+operator++,
+position management through seekp
+(returns the current position) and tellp
+(go to a given position);
      • 
+
+
    • 
+Individuals can also be inserted at
+current position using the corresponding methods;
      • 
+
+
    • 
+last but not least, as the individuals are returned by reference, it is
+mandatory to ensure that they will not be moved around later: the memory
+management  routine reserve
+is called whenever there is a chance to add some individuals in the population
+- i.e. in the eoGenOp base class operator() method.
      • 
+
    
+Moreover, a public method termed select, 
+is used inside the object to get new parents for the following operator*,
+and its implementation distinguishes two types of eoPopulator:
+
      
+
    • 
+The eoSeqPopulator gets new parents
+from its source (the initial population). When the source is exhausted,
+an exception if thrown. The idea of such pooulator is to start from a population
+of already selected individuals.
      • 
+
+
      The programmer should hence be very careful that the number of available
+parents matches the requirements of the operators when using an eoSeqPopulator
+object.
+
    • 
+The eoSelectivePopulator , on the opposite,
+always gets new parents using its private eoSelectOne
+object (passed at construct time). Hence it can handle any number of parents
+at will. The idea of such populator is to handle the whole breeding
+process, i.e. selection and variation operators.
      • 
+
    
+An immediate consequence is that if you are not sure of the number of 
+parents you will need in some operators (e.g. because of some stochastic
+proportional selection ebtween operators that don't need the same number
+of parents, then you must use an eoSelectivePopulator
+to apply the variation operators to the population, and thus get exactly
+the number of offspring you want.
+
    Example: An eoSelectivePopulator
+is the main ingredient of the eoGeneralBreeder
+operator()
+method - a class that creates a population of offspring from the parents
+applying an eoGenOp (usually an eoOpContainer) to all selected parents
+in turn.
+
    
+
    General
+Operator Containers:
+
    General operators in EO are meant to be used withing eoOpContainer
+objects, that allow to combine them in a hierarchical and flexible way.
+There are two ways to do that: the proportional
+combination, similar to what has been described for simple operators
+above,
+and the sequential combination, which
+amounts to apply all operators in turn to a bunch of individuals, each
+operator being applied with a specific probability.
+
    Proportional combinations
+
    When called upon a population (through an eoPopulator
+object), an eoProportionalOpContainer
+enters the following loop:
+
    while there are individuals left in the list
+
      
+
    • 
+choose one of the included operators according to their relative rates
+(by some roulette wheel random choice)
      • 
+
+
    • 
+applies the chosen operator. The parents are dispensed to the operator
+from the list on demand.
      • 
+
+
    • 
+What happens next exactly depends on the type of operator, but basically,
+some of the parents get modified, some might get removed from the list
+and some new individual might get inserted on the list.
      • 
+
+
    • 
+updates the list pointer (if needed) to the individual following the ones
+that just have been modified/inserted/deleted.
      • 
+
    
+Sequential combinations
+
    When it is called upon a list of pending candidates, an
+eoSequentialOpContainer
+enters the following loop:
+
    mark the current position
+
    for all operators it contains,
+
      
+
    • 
+go to marked position
      • 
+
+
    • 
+until current end of population
+is reached do
      • 
+
+
        
+
      • 
+flip a coin according to the operator rate.
        • 
+
+
          
+
        • 
+If true, apply the operator to the parents. The current parents can be
+modified, or some can be deleted from the list, or some offspring can be
+inserted in the list.
          • 
+
+
        • 
+If false, move the pointer over the required number of parents (i.e. don't
+modify thoses parents)
          • 
+
        
+
+
      • 
+Next pending parent
        • 
+
      
+
+
    • 
+Next operator
      • 
+
    
+Warning: the way rate
+will be used is highly dependent on the type of eoOpContainer
+your are creating there:
+
      
+
    • 
+The rates for eoProportionalOpContainer
+will be used in a roulette wheel choice among all operators. They can take
+any value, the only important thing is their relative
+values.
      • 
+
+
    • 
+The "rates" for eoSequentialOpContainer actually
+are probabilities, i.e. they will be
+used in a coin-flipping to determine whether that particuler operator will
+be applied to the next candidates at hand. They should be in
+[0,1] (no error will happen if they are not, but the operator
+will be applied systematically - this is equivalent of a rate equal to
+1).
      • 
+
    
+Remark:The eoSGATransform presented in Lesson2
+can be viewed as a particular type of eoSequentialOpContainer.
+It was not coded that way in order to provide a gradual introduction to
+all concepts.
+
    Exercise: write the code to perform an
+eoSGA using the eoOpContainer constructs.
+
    Adding operators to a container:
+
    The way to add an operator to an eoOpContainer
+is the method
+add. It is similar
+to all other add methods in
+other Combined things in eo (as the simple eoProportionalCombinedXXXop
+described above, but also the eoCombinedContinue class or the eoCheckPoint
+class).
+
    The syntax is straightforward, and it works with any of the operator
+classes eoXXXOp, where XXX stands for
+Mon,
+Bin, Quad or
+Gen:
+
    someOperatorType<Indi> myOperator;
+
    eoYYYOpContainer<Indi> myOpContainer;
+
    myOpContainer.add(myOperator, rate); //
+rate: double whose meaning depends on YYY
+
    where YYY can be one of Proportional and Sequential. Note that before
+being added to the container, all simple operators are wrapped into the
+corresponding eoGenOp (see e.g. how an eoMonOpis
+wrapped into an eoMonGenOp- or
+how any operator
+is handled by calling the appropriate wrapper). In particular, the
+wrapper ensures that individuals who have been
+modified are invalidated.
+
    Containers,
+Selectors and Populators
+
    The way the eoOpContainer are applied
+on a population using an eoPopulator
+object. But, whereas the behavior of eoProportionalOpContainer
+does not depend on the type of eoPopulator,(one
+operator is chosen by roulette_wheel, and applied once before control is
+given back to the caller), the main loop in method operator()
+of
+class eoSequentialOpContainer
+iterates while (!_pop.exhausted())
+which is interpreted differently depending on the type
+of eoPopulator:
+
      
+
    • 
+if the argument is an eoSelectivePopulator,
+the default position of the eoPopulator, considered as a population iterator,
+is at end of population. Individuals are added upon demand of an operator,
+and in most cases all operators are applied once. This also depends, however,
+on the arities of all operators:
      • 
+
+
        
+
      • 
+Consider an eoSequentialOpContainer
+containing an eoQuadOp and an eoMonOp. The eoQuadOp first asks for two
+parents and modifies them. The eoMonOp is then called starting from the
+forst of thoses two modified individuals, and is hence applied twice, once
+on each parent.
        • 
+
+
      • 
+But consider now an eoSequentialOpContainer
+containing an eoGenOp that takes one
+parent and generates three offspring, followed by an eoQuadOp.
+The eoGenOp will call the selector
+to get the parent its need and will modify it and put 2 additional offspring
+at end of the population. The eoQuadOp
+will then be called on the first of the three outputs of the eoGenOp,
+and hence will act upon the frist two of them. But at that point, the populator
+iterator will point to the third of the individuals resulting from the
+eoGenOp,
+and the test _pop.exhausted()
+will return false, so the eoQuadOp
+will again be called. The second parent it needs will be given by a new
+call to the embedded eoSelectOne of
+the  and everything will go on smoothly, except that a total of 4
+offspring will have been generated by application of this particular eoSequentialOpContainer.
        • 
+
      
+
+
    • 
+if the argument is an eoSeqPopulator,
+the position of the iterator starts from the beginning of an existing population
+(the source populations), and hence when an  an eoSequentialOpContainer
+is called, it goes through the whole remaining of the population (the test
+_pop.exhausted()
+only returns true at end of the source population).
      • 
+
+
    • 
+From the above it is easy to see that passing an eoSeqPopulator
+to an eoProportionalOpContainer that
+contains an eoSequentialOpContainer,
+though not technically forbiddden, will most produce something  totally
+unpredictable, and hence should probably not be used without great care.
      • 
+
    
+
+
    Advanced
+general operators:
+
    It is sometimes useful to be able to use a selector from inside an operator
+(a typical example is when you want to implement sexual
+preferences, i.e. choose a mate for a first parent according
+to some characteritics of that first parent).
+
    This is made possible in EO because the general operators have a handle
+on the initial population through the method source()
+of the argument eoPopulator they work on. Their apply()
+method shoudl look like
+
    void apply()(eoPopulator&
+_pop)
+
    {
+
      EOT & eo1 = *_pop; // get
+(select if necessary) the first guy
+
      EOT maBlonde = findBlonde(_pop.source());
+//
+select mate
+
      // do whatever the operator is supposed
+to do, e.g
+
      cross(eo1, maBonde);      
+// cross is some embedded crossover
+
      ...
+
      // if you don't want to put maBlonde
+into the offspring,
+
      // stop here (and use a reference
+to maBlonde above). Otherwise
+
      maBonde.invalidate();
+
     ++_pop;    //
+advance
+
      _pop.insert(maBlonde);   
+// and insert it
+
    }
+
    Where does that findBlonde
+selector comes from? As usual, you have to attach it to the operator, 
+in its constructor for instance, which should give something like:
+
    sexualSelectorType<Indi>  findBlonde;
+
    sexualOperatorType<Indi> yourBrainAndMyBeauty(cross,
+findBlonde);
+
    
+
    Local: Introduction
+- Crossover - Mutation
+- Combinations - General
+Operators - Populators - General
+combinations- Advanced operators
+
    General: Algorithm-Based
+- Component-Based - Programming
+hints -EO
+documentation
+
    
+
    
+
    
+Marc Schoenauer
    
+
+
    Last
+modified: Sat. Feb. 17 2002 
+
     
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/eoOutput.html b/trunk/paradiseo-eo/tutorial/html/eoOutput.html
new file mode 100644
index 000000000..4e77cd2ea
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/eoOutput.html
@@ -0,0 +1,19 @@
+
+
+  
+    Output
+  
+
+  
+    
    Output
    
+
+
+
+    
    
+    
    Marc Schoenauer
    
+
+
+Last modified: Mon Oct 30 19:29:19 CET 2000
+
+  
+
diff --git a/trunk/paradiseo-eo/tutorial/html/eoProgramming.html b/trunk/paradiseo-eo/tutorial/html/eoProgramming.html
new file mode 100644
index 000000000..40ffcad37
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/eoProgramming.html
@@ -0,0 +1,498 @@
+
+
+
+   
+   
+   EO Programming guide
+
+
+General: Tutorial
+main page -
+Algorithm-Based - Component-Based
+- Programming hints - EO
+documentation
+
    
+
    Local: Templates
+-
+Functors -
+STL Library - Random
+numbers - EO programming style  - Memory
+management
+
    
+
    
+
    
+
    
+EO Programming guide
    
+
+
    
+
    Templates
+
    Most EO code is written using templates. This allows to write generic
+code, i.e. involving a class which doesn't have to be known when writing
+the code -- but only when compiling it. In some sense this is similar to
+naming variables in algebra: you can write a lot of equations involving
+some variable $x$ without knowing even it if will be an integer or a float
+(or a matrix or ...). The main basic type that is templatized in EO is
+the fitness: an EO object is some object which has a fitness of some type
+F that can be anything. The definition for that is (see EO.h)
+
    template<class F> class EO
+
    The idea is that, later in your code, you can define a class as follows
+(see for instance  eoBit.h).
+
    template<class F> class eoBit : public
+EO<F>
+
    { ... code for eoBit  };
+
    and then use it in your application as
+
    eoBit<double> myeoBit;
+
    declares an object of type eoBin which has as fitness a double.
+
    Whereas the advantages 
+are obvious (writing generic reusable code instead
+of having to rewrite the same pieces of code for different types), there
+are some drawbacks: 
+namely, it makes some of the compiler error messages
+hard to understand; and it forbids the compilation of most parts of EO
+into an object library file, as the actual types are not known in advance.
+
    
+
    
+
    Functors
+
    Though EO is a library, it contains almost no functions per se!
+
    EO mainly contains functors, that are objects which have a method called
+operator().
+Such objects are used  as if they were functions, but the big differences
+are that
+
      
+
    • 
+functors are functions with private data
      • 
+
+
    • 
+you can have different functors objects of the same class, i.e. you can
+use at the same time the same functionality with different parameters
      • 
+
+
    • 
+you can have a hierarchy of functors objects, which means that you have
+a hierarchy of functions with defaults behaviors and specialized sub-functions
      • 
+
+
    • 
+...
      • 
+
    
+Functors are so intimately linked to EO that a base class (eoFunctorBase)
+has been designed to hold all functors. This base class is itself divided
+into three derived class. These classes tell you immediately what kind
+of arguments the operator()
+method requires and what kind of result it produces. See EO
+conventions, and the inheritance
+diagram of class eoFunctorBase.  Also note that
+if you create new functors, you should also derive from one of these classes,
+as it is mandatory if you later use the EO memory management
+mechanism.
+
    For a more complete introduction to functors, with detailed discussion,
+go to the STL documentation
+- as STL also heavily relies on functors, and the eoFunctorBase paradigm
+is borrowed from there.
+
    Functors: Example:
+
    The following is a basic example of how to program and use a functor
+object: First code the class:
+
    class MyFunctor
+
    { ...
+
        void operator()(ArgType
+arg)
+
           {
+
               
+// do what you have to do
+
           }
+
    }; // end of class declaration
+
    Then use it  later in the code :
+
    ArgType myArgument;
+
    MyFunctor myFunctorInstance;   
+// myFunctorInstance is an object of class MyFUnctor ...
+
    myFunctorInstance(myArgument); 
+// calls operator() of myFunctorInstance acting on myArgument ...
+
     
+
    Functors: The
+three basic classes:
+
    Direct sub-classes of the root class , three classes
+are defined to differentiate functors by the number of argument required
+by their operator().
+These classes are templatized by the types of its arguments, and by its
+return type. Hence,
+
    from the inheritance diagram of any functor class
+in EO, you can immediately deduce the interface of their operator()
+method.
+
     
+
      
+
    • 
+eoF
+is for arity-zero functors, i.e.  their operator()
+method does not require any argument. It has a single template parameter,
+the return type of the operator()
+method. For instance,  eoMonitor 
+are eoF's
+that return an eoMonitor &.
      • 
+
+
    • 
+eoUF
+is for unary functors, i.e.  their operator()
+method requires one argument. It has two template parameters, the type
+of the argument and the return type of the operator()
+method. For instance,  eoMonOp's
+are eoUF's
+that take as argument an EOT &
+and return void
+.
      • 
+
+
    • 
+eoBF
+is for binary functors, i.e.  their operator()
+method requires two arguments. It has three template parameters, the types
+of the arguments and the return type of the operator()
+method. For instance,  eoBinOp's
+are eoBF's
+that take as arguments a const EOT
+& and an EOT
+&, and return void
+.
      • 
+
    
+Now go back to the inheritance
+diagram of class eoFunctorBase,
+and guess the interface for all functors!
+
    Note: for
+obvious simplicity reasons, we very often omit the reference to the operator(),
+e.g. when we say above:
+
      
+
    • 
+eoMonOp's
+are eoUF's
+that take as argument an EOT &
+and return void
      • 
+
    
+it actually means
+
      
+
    • 
+eoMonOp's
+are eoUF's,
+their operator()
+method takes as argument an EOT &
+and returns void.
      • 
+
    
+
+

    
+
    
+
    A very brief
+introduction to STL
+
    All EO heavily relies on STL, the Standard
+Template Library.
+
    But you don't have to know more than a few words
+of STL to use EO (like with "hello", "please" and "goodbye" you
+can survive in a foreign country :-) and even to contribute to new EO features.
+Moreover, while browsing through EO code, you will gradually learn how
+to use STL, especially if you check at the SGI
+STL Web site from time to time, where you can not only download STL,
+but also browse in the Programmer's guide  for isntance from the Table
+of Content.
+
    Anyway, you will only find here, in EO tutorial, the basics of STL that
+you will need to understand most of EO code - and to guess what the parts
+you don't understand are actually doing. Don't worry, I
+don't
+understand everything :-)
+
    STL provides the user with containers,
+iterators
+and algorithms. And you can access
+(almost) all containers content using (almost) all iterators, or apply
+(almost) all algorithms on (almost) all containers (of course the tricky
+part is to instanciate the "almost" in the previous sentence :-)
+
    STL: Containers
+
    Containers are high level data types used to hold simpler data - the
+most widely used example of a container is the vector
+construct.
+
    The use of STL containers relieve the user from memory management.
+
      
+
    • 
+vector The
+most widely used container is a one-dimensional array of items.
      • 
+
+
      Data manipulation: suppose v
+is an STL vector<AtomType>.
+Then
+
      v[i]
+is the ith element of v, as in standard C arrays
+
      v.size()
+is the number of elements of v
+
      v.push_back(atom)
+appends the atom
+at end of v,
+provided of course that atom
+is of type AtomType,
+the size is automatically increased...
+
      blabla insert, erase, ...
+
    • 
+list
+STL provides different types of list. The one used in EO is the simple
+linked list named ... list.
+As far as the user is concerned, simple lists are very similar to vectors,
+and the data manipulation listed above for vectors can be applied to list.
      • 
+
+
    • 
+pair
      • 
+
+
      This simple container allows you to hold two
+data types together. It is very handy for temporary data handling. Assuming
+p is a pair<AtomType1, AtomType2>,
+p.first
+and p.second 
+refer to the encapsulated data, of respective types AtomType1
+and
+AtomType2
+
    • 
+Blabla
      • 
+
    
+There are many other types of containers that are not used in EO and that
+we will not present here.
+
    STL: Iterators
+
    Iterators are accessors to the containers contents that provide unified
+access to different containers. They are very similar to pointers, i.e.
+you can increment them, compare them with one another, etc
+
    Some very useful iterators for vectors and lists are begin()
+and end(), that refer to the first
+and after-last items of a container. They allow loops to sweep all items
+contained in a container as follows:
+
    STLcontainer myContain;
+
    STLcontainer::iterator it;
+
    for (it=myContain.begin(); it!=myContain.end();
+it++)
+
    {
+
    // do what you have to do to
+(*it)
+the current item in the container
+
    }
+
    STL: Algorithms
+
    Algorithms are functions acting on containers - the most widely used
+example of a STL algorithm are the different sorting
+algorithms.
+
      
+
    • 
+sort, nth_element, are sorting
+algorithms used in EO
      • 
+
+
    • 
+copy is used to copy a range
+of data designated by iterators
      • 
+
+
    • 
+apply is used to perform the
+same operation to many items designated by a range of iterators
      • 
+
+
    • 
+Blabla - help wanted thanks...
      • 
+
    
+STL: Advantages
+
    The main and huge advantage of
+using STL is that it handles (almost all) memory mangement automatically.
+You can use any STL container the same way you would use a scalar basic
+C++ type. And it does it in a (supposededly) optimized way. Of course,
+the user is also responsible for performances: for instance, the insert()
+method will take more time for vectors than for linked lists, while on
+the opposite, the operator[] accessor will be faster for vectors. But both
+will work anyway.
+
    STL: Drawbacks
+
    The main drawback I see in using STL is that it makes it almost
+impossible
+to use a debugger normally: whereas access to data is made simple
+to the programmer, data structures are actually so complex, and debuggers
+so willing to display everything that you get lines of template instantiation
+when asking your debugger what is inside some container! For instance I
+could never visualize some
+v[i]
+with gbd, v
+being an STL vector!
+
    
+
    
+
    Random
+numbers
+
    Evolutionary Algorithms make intensive use of random numbers. Random
+numbers are simulated in computers by using pseudo-random
+number generators (RNGs for short), i.e. functions that return series of
+numbers who look random (w.r.t. some statistical criteria).
+
    To make sure the random number generator is as good as possible, and
+to ensure reproducibility of the results across different platforms, EO
+has its own RNG, the ``Mersenne Twister''
+random number generator MT19937 (thanks to Takuji
+Nishimura, see eoRNG.h
+comments).
+
    Though you can define and use as many RNGs as you wish in EO, the library
+also provides you with a global RNG termed eo::rng.
+Using that single RNG in all calls to random numbers allows one to be able
+to reproduce a given run:
+
      
+
    • 
+as strange as it seems for a random algorithm, it is mandatory for debugging
+purposes
      • 
+
+
    • 
+random numbers are computed starting from a seed - starting from the same
+seed will lead to the same series of pseudo-random numbers, and hence to
+the same results of the algorithms. All examples in this tutorial will
+use the RNG seeding procedure, see e.g. in Lesson1.
      • 
+
+
    • 
+to simulate "true" random runs, you can just seed the RNG with a machine-clock
+related number, e.g. calling time(0), as done for instance in Lesson3
+(and after).
      • 
+
    
+As RNGs produce, by definition, integers that are uniformly distributed
+between 0 and some maximal number, EO provides you with random numbers
+following different probability distribution
+(e.g. floating point following normal
+distribution). See the complete
+list of RNG primitives.
+
    EO also provides random_generators
+that can be used in STL call to generate series of random numbers, as in
+eoPop
+initializers.
+
    Note: the eo::
+prefix indicates that it is in a separate C++ namespace, to avoid collision
+with possible variables that would also be named rng in some other library.
+As early versions of EO (<= 9.1)  did not use a separate namespace
+for rng, the compiler directive using eo::rng in eoRNG.h allows you to
+use the name rng without the eo::
+prefix. However, the notation eo::rng
+should be preferred and might become mandatory some day.
+
    
+
    
+
    EO conventions
+and naming style
+
    A few naming conventions should help you to navigate more easily through
+EO:
+
      
+
    • 
+The name of local variables should start with a lower case letter. Capital
+letters should be used rather than underscore to separate words in names
+(e.g. popSize rather than
+pop_size).
      • 
+
+
    • 
+The name of the arguments to a function should start with an underscore,
+e.g.
      • 
+
+
                void
+myfunction(unsigned _popSize){...}
+
    • 
+The initialization parameters of constructors should be named from the
+names of the variables they are used to initialize, e.g.
      • 
+
+
       
+
       
+
       
+
       
+
      class eoMyClass
+
      {
+
      public:
+
        eoMyClass(unsigned _popSize):popSize(_popSize){...}
+
         ...
+
      private:
+
         unsigned popSize;
+
      };
+
    • 
+The names of classes should start with eo + an Uppercase letter (as eoMyClass
+above).
      • 
+
+
    • 
+The name of the EO template should be EOT. This allows quick understanding
+of the inheritance diagrams for functors. and immediate
+perception of the arguments and return types of the functors oeprator()
+method (as in eoMonOp
+or  eoBinOp).
      • 
+
+
       
+
    • 
+Blabla
      • 
+
    
+
+
    
+
    EO memory
+management
+
    Most of EO constructs are based on the encapsulation
+of objects into other objects, and the embedded objects are passed through
+the constructor of the embedding object.
+
    For instance, the construction of an algorithm requires a breeder (plus
+many other things of course), the construction of a breeder usually requires
+a selector, and in turn the construction of a selector requires some parameters.
+This gives something resembling the following
+
    eoTournamentSelection<EOT>  select(tSize);
+
    eoBreeder<EOT> breed(select);
+
    eoEasyAlgo<EOT> algo( ..., breed, ...);
+
    Such a practice is no problem when doing everything
+in a (large!) main function: all objects are local to that function,
+but when the end of the function is also the end of the program. For instance,
+all programs in Lesson1, Lesson2
+and Lesson3 of this tutorial are built that
+way.
+
    It is however a big problem when you want to outsource some code in
+other functions: indeed, the above sequence create objects that dissapear
+when exiting the function, and thus cannot be used outside their defining
+function.
+
    The solution is of course to use pointers,
+which gives something like
+
    eoTournamentSelection<EOT>  *ptSelect
+= new eoTournamentSelection<EOT>(tSize);
+
    eoBreeder<EOT> *ptBreed = new eoBreeder<EOT>(*ptSselect);
+
    eoEasyAlgo<EOT> *ptAlgo = new eoEasyAlgo<EOT>(
+..., *ptBreed, ...);
+
    and you can then use the dynamically allocated objects anywhere. But
+the trouble with such a construct is that after exiting the function where
+such objects are defined, you will never be able
+to free this allocated memory, should you not need the objects
+any nore. Whereas this is not in general a big problem (except of being
+a very bad practice that will make you a very naughty programmer :-), it
+will prevent any re-entrance of the resulting code, and for instance you
+will not be able to use an evolutionary algorithm within another loop of
+some outside code.
+
    The solution in EO us to use an eoFunctorStore
+object to store such nowhere-belonging pointers: whenever you allocate
+such a thing, store it into an eoState : deleting that state will delete
+all the stored pointers - one eoState is thus the only object you have
+to care of.
+
    The above pointer allocation sequence thus become
+
    eoTournamentSelection<EOT>  *ptSelect
+= new eoTournamentSelection<EOT>(tSize);
+
    state.storeFunctor(ptSelect);
+
    eoBreeder<EOT> *ptBreed = new eoBreeder<EOT>(*ptSelect);
+
    state.storeFunctor(ptBreed);
+
    eoEasyAlgo<EOT> *ptAlgo = new eoEasyAlgo<EOT>(
+..., *ptBreed, ...);
+
    state.storeFunctor(ptAlgo);
+
    or, even more quickly (though less readably)
+
    eoTournamentSelection<EOT>  *ptSelect
+=
+
                  
+state.storeFunctor(new eoTournamentSelection<EOT>(tSize));
+
    eoBreeder<EOT> *ptBreed =
+
                  
+state.storeFunctor(new eoBreeder<EOT>(*ptSelect));
+
    eoEasyAlgo<EOT> *ptAlgo =
+
                  
+state.storeFunctor(new eoEasyAlgo<EOT>( ..., *ptBreed, ...));
+
    In both the above code, state is an eoFunctorStore
+that is of course passed from outside the function
+- and it's called state because in most cases it will actually be an eoState.
+As its name says, an eoFunctorStore
+can store any object that is an (derives from) eoFunctorBase
+- hence all objects in EO that are used as functors should derive from
+either eoF, eoUF or eBF.
+
    Examples of such constructs are shown in the make_xxx files described
+in Lesson4.
+
    
+
    Local: Templates
+-
+Functors -
+STL Library - Random
+numbers - EO programming style  - Memory
+management
+
    
+
    
+
    General: Tutorial
+main page - Algorithm-Based - Component-Based
+- Programming hints - EO
+documentation
+
    
+
    
+
    Marc Schoenauer
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/eoRepresentation.html b/trunk/paradiseo-eo/tutorial/html/eoRepresentation.html
new file mode 100644
index 000000000..41a63f6df
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/eoRepresentation.html
@@ -0,0 +1,19 @@
+
+
+  
+    Representation
+  
+
+  
+    
    Representation
    
+
+
+
+    
    
+    
    Marc Schoenauer
    
+
+
+Last modified: Mon Oct 30 19:28:01 CET 2000
+
+  
+
diff --git a/trunk/paradiseo-eo/tutorial/html/eoSGA.html b/trunk/paradiseo-eo/tutorial/html/eoSGA.html
new file mode 100644
index 000000000..2e2428701
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/eoSGA.html
@@ -0,0 +1,157 @@
+
+
+
+   
+   
+   eoSGA.h
+
+
+Back to Lesson 1 - Tutorial
+main page - Algorithm-Based - Component-Based
+page - Programming hints - EO
+documentation
+
    
+
    
+
    
+
    
+eoSGA.h
    
+
+
+
+
+
+
    //-----------------------------------------------------------------------------
+
    // eoSGA.h
+
    //-----------------------------------------------------------------------------
+
    #ifndef _eoSGA_h
+
    #define _eoSGA_h
+
    #include <eoOp.h>
+
    #include <eoContinue.h>
+
    #include <eoPop.h>
+
    #include <eoSelectOne.h>
+
    #include <eoSelectPerc.h>
+
    #include <eoEvalFunc.h>
+
    #include <eoAlgo.h>
+
    #include <apply.h>
+
    /** The Simple Genetic Algorithm, following
+Holland and Goldberg 
+
    *  Needs a selector (class eoSelectOne)
+a crossover (eoQuadratic, 
+
    *      i.e. a 2->2
+operator) and a mutation with their respective rates, 
+
    *      of course
+an evaluation function (eoEvalFunc) and a continuator 
+
    *      (eoContinue)
+which gives the stopping criterion. Performs full
+
    *      generational
+replacement.
+
    */ 
+
    template <class EOT>
+
    class eoSGA : public eoAlgo<EOT>
+
    {
+
    public :
+
     // added this second ctor as
+I didn't like the ordering of the parameters
+
     // in the one above. Any objection
+:-) MS
+
    eoSGA(
+
           eoSelectOne<EOT>&
+_select,
+
           eoQuadraticOp<EOT>&
+_cross, float _crate,
+
           eoMonOp<EOT>&
+_mutate, float _mrate,
+
           eoEvalFunc<EOT>&
+_eval,
+
           eoContinue<EOT>&
+_cont)
+
         : cont(_cont), 
+
           mutate(_mutate), 
+
           mutationRate(_mrate),
+
           cross(_cross),
+
           crossoverRate(_crate),
+
           select(_select),
+
           eval(_eval)
+{}
    
+
+
+
+
+
+
     void operator()(eoPop<EOT>&
+_pop)
+
     {
+
        eoPop<EOT> offspring;
+
        do {
+
            
+select(_pop, offspring);
+
            
+unsigned i;
+
            
+for (i=0; i<_pop.size()/2; i++) 
+
                
+{   // generates 2 offspring from two parents
+
                    
+if ( rng.flip(crossoverRate) ) 
+
                      
+{ 
+
                          
+cross(offspring[2*i], offspring[2*i+1]);
+
                      
+}
+
                
+}
+
            
+for (i=0; i < _pop.size(); i++) 
+
                
+{
+
                    
+if (rng.flip(mutationRate) ) 
+
                        
+{
+
                            
+mutate(offspring[i]);
+
                        
+}
+
                
+}
+
            
+_pop.swap(offspring);
+
            
+apply<EOT>(eval, _pop);
+
         } while (cont(_pop));
+
     }
+
     
    
+
+
+
+
+
+
    private :
+
     eoContinue<EOT>& cont;
+
     eoMonOp<EOT>& mutate;
+
     float mutationRate;
+
     eoQuadraticOp<EOT>& cross;
+
     float crossoverRate;
+
     eoSelectPerc<EOT> select;
+
     eoEvalFunc<EOT>& eval;
    
+
+
+
+
+
+
    };
+
    #endif
    
+
+
    Back to Lesson 1 - Tutorial
+main page - Algorithm-Based - Component-Based
+page - Programming hints - EO
+documentation
+
    
+
    
+Marc Schoenauer
    
+
+
    Last modified: Sun Nov
+19 19:36:21 2000
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/eoSelect.html b/trunk/paradiseo-eo/tutorial/html/eoSelect.html
new file mode 100644
index 000000000..9de6bb612
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/eoSelect.html
@@ -0,0 +1,19 @@
+
+
+  
+    Selection
+  
+
+  
+    
    Selection
    
+
+
+
+    
    
+    
    Marc Schoenauer
    
+
+
+Last modified: Mon Oct 30 17:51:55 CET 2000
+
+  
+
diff --git a/trunk/paradiseo-eo/tutorial/html/eoStop.html b/trunk/paradiseo-eo/tutorial/html/eoStop.html
new file mode 100644
index 000000000..14e0d37c1
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/eoStop.html
@@ -0,0 +1,25 @@
+
+
+  
+    Input / Output
+  
+
+  
+    
    Input / Output
    
+
+
    
+
+
    Stopping criteria
    
+
+
    
+
+
    Displaying statistics
    
+
+    
    
+    
    Marc Schoenauer
    
+
+
+Last modified: Tue Oct 31 18:32:22 CET 2000
+
+  
+
diff --git a/trunk/paradiseo-eo/tutorial/html/eoTopDown.html b/trunk/paradiseo-eo/tutorial/html/eoTopDown.html
new file mode 100644
index 000000000..c9a668acb
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/eoTopDown.html
@@ -0,0 +1,120 @@
+
+
+
+   
+   
+   EO - The Algorithm-Based approach
+
+
+Tutorial main
+page
+-
+Algorithm-Based - Component-Based
+- Programming hints - EO
+documentation
+
    
+
    
+
    
+
    
+EO - The Algorithm-Based approach
    
+
+

    Congratulations - You have chosen the algorithm-based approach! 
+This means that you want to start from something that already works, and
+gradually learn about the more complex constructs. We have prepared a series
+of "lessons" for you.
+
      
+
    • 
+Lesson 1 - a gentle introduction to the EO
+way: your first steps into EO representations
+using a simple generational GA. Please, spend
+the necessary time on that one, since all basic constructs presented
+there are used throughout EO.
      • 
+
+
    • 
+Lesson 2 - encapsulate,
+encapsulate, and try more sophisticated selection/replacement
+mechanisms, as well as multiple  operators
      • 
+
+
    • 
+Lesson 3 - The same algorithms, but with improved
+input/outputs: user-friendly input (i.e. without
+the need to recompile!) of algorithm parameters,
+and checkpointing (display
+of on-line statistics, save
+and
+restore
+populations,
+restart stopped runs,
+...).
      • 
+
+
    • 
+Lesson 4 - The same algorithms - again! -
+but now fully operational: every component
+of the algorithm can be defined on the command-line,
+except the type of genotype; moreover, you now have a full library, i.e.
+everything except your fitness function is already
+compiled.
      • 
+
+
    • 
+Lesson 5 (new)
+- Use your own representation. Thanks
+to template files and a little script in Unix,
+or the Application template in MSVC++, you
+can easily define a new genotype and run an Evolutionary Algorithm that
+will intantly benefit from the power of all EO
+Evolution Engines (including easy user-parameter
+input presented in Lesson 4). You simply need to gradually fill
+in the shell-files that the script will generate for you.
      • 
+
+
    • 
+(new)  In parallel
+to those lessons :-), you now have access to a two lessons for ParadisEO,
+the parallel version of EO. There are
+no HTML files, but sample code (in dir tutorial/ParadisEO/LessonN),
+together with a PDF presentation
+- Thanks to Sébastien Cahon (LIFL,
+Lille)
      • 
+
    
+
+

    Current version (May. 5, 2002) stops here, but ...
+
    From there on, you don't need to follow the lesson order any more: you
+can go directly to any lesson and experiment. Of course, you will need
+to bring together the different pieces to write exactly what you want -
+but only because we had no idea of what you exactly want :-)
+
      
+
    • 
+Lesson 6 (forthcoming) - More about checkpointing:
+write your first adaptive mechanism,
+and find out how easy it is to update
+and monitor dynamic
+parameters
      • 
+
+
    • 
+Lesson 7 - More general operators:
+e.g. binary, n-ary, or even specific mate selection (your brain and my
+beauty)! Add your own to the basic algorithm using the template files.
      • 
+
+
    • 
+Lesson 8 - Use predefined generic representations.
+The eoFixedLength and eoVariableLength
+super classes allow quick definition of new genotypes that handle identical
+Atoms, together with generic variation operators.
      • 
+
    
+Of course, in each lesson, you have links to the corresponding Component-Based
+page. ( ... Well, to tell you the truth, as of today, this is not exactly
+true :-)
+
    
+
    
+
    Tutorial main page - Algorithm-Based
+- Component-Based - Programming
+hints - EO
+documentation
+
    
+
    
+
    
+Marc Schoenauer
    
+
+
    Last modified: Tue Dec 19
+2000 
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/eoTutorial.html b/trunk/paradiseo-eo/tutorial/html/eoTutorial.html
new file mode 100644
index 000000000..2986ce10a
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/eoTutorial.html
@@ -0,0 +1,271 @@
+
+
+
+   
+   
+   Tutorial EO
+
+
+Algorithm-Based - Component-Based
+- Programming hints - EO
+documentation
+
    
+
    Welcome to EO, the Evolving Objects library,
+and to
    
+
+
    
+
    
+EO Tutorial
    
+
+
    Version 0.98a - December 2004
+
    
+
+
      
+
    • New - 
+Well, in fact, nothing really new, 
+but some people advised us to announce from the very beginning that
+if you are looking for a ready-to-use
+(except for the fitness)  fully tunable Evolutionary
+Algorithm evolving real values or bitstring, you can 
+go directly to
+Lesson 4 after just reading
+this page, and maybe the Programming
+hints (link on top of each page too). 
      
+
+In fact, there is something new: EO's automatic configuration and
+build process has been cleaned up and upgraded. For consistency, the
+same automatically-built Makefiles have been created in the
+tutorial directories. The good-old manually-created files are
+still there, now named 
+Makefile.simple.
+Moreover, when you compile the whole library (typing make in the main EO dir), all lessons of the tutorial gets compiled, too.
+
      • 
+
      
+
+
      Version 0.98 - May 2004
      
+       
+
    • Lesson 5
+	  has been improved: some of 
+the empty template files in dir 
+.../eo/tutorial/Templates
+have been simplified, and file stat.tmpl
+has been added, allowing you to 
+compute and 
+print and 
+save-to-disk and 
+plot-on-line your 
+own statistics. 
+The magic script is now (see Lesson5) createSimple.
      
+
+The same simplified main file  in 
+dir .../eo/tutorial/Templates)
+also allows you to use 
+fitness sharing
+ (together with roulette wheel) as a possible selector.
      
+
+Unfortunately, the HTML file for Lesson5 and the corresponding
+html-ized code are not yet updated - time is missing
+(volunteers welcome).

      
+
      • 
+
+
      May 2002
      
+
    • 
+ParadisEO, the parallel
+version of EO, is available together with
+a PDF presentation
      • 
+
+
      
+Thanks to Sébastien
+Cahon (LIFL, Lille)
      
+
+
    
+
    
+
    Welcome to EO tutorial/on-line documentation.
    
+
    About this tutorial
    
+First, please note that this tutorial is not supposed
+to be printed and read off-line, as it takes full advantage
+of hyper-text links between the different parts, and with the technical
+documentation.
+This tutorial can be used in 2 different ways: algorithm-based and component-based.
+
      
+
    • 
+Algorithm-Based means you start from a very
+simple, ready-to-run algorithm, and gradually modify it, making
+it both more powerful and more complex.
      • 
+
+
    • 
+Component-Based means you start by examining
+the
+components of an EA one by one, down to
+the level of complexity you feel comfortable with, and then build the whole
+algorithm using those components you need (or the one you are mastering).
+Such approach might be viewed as going through a simplified user guide,
+too.
      • 
+
    
+However, it is strongly recommended
+that you take some time on the first lesson of the Algorithm-Based approach
+to get familiar with the basic concepts that are used throughout EO. Anyway,
+as of today, December 19, the Component-Based is only very sparsely written
+:-)
+
    
+
    Links and Related
+documents
+
      
+
    • 
+There are of course a few (very few) programming
+hints that you should know.
      • 
+
+
    • 
+THe EO documentation - automatically
+generated from the comments in the code - is very helpful to get an idea
+of the inheritance diagrams of EO classes,
+and to quickly reach some specific part of the code.
      • 
+
+
      The top page of each class documentation is for instance the inheritance
+diagram of the class, and you'll learn a lot by simply looking at it.
+
    • 
+For those who wish to get deeper in STL (Standard Template Library), you
+might visit the well documented SGI
+STL Web site. But don't forget you'll find the very basic minimum in
+EO programming hints.
      • 
+
+
    • 
+And, last but not least, we assume you know approximately that an Evolutionary
+Algorithm looks like this, but otherwise you can try this very
+brief introduction (not written yet, Jan. 2001, sorry).
      • 
+
    
+
+

    
+
    Colors and navigation:
+
    You will see this diagram in quite many places, as for instance at the
+top of all examples - usually it will be clickable and will help you navigate
+among the different parts of an EO program. See the brief
+introduction to Evolutionary Computation for a detailed explanation.
+
    
+
    
+
+
    But in the text itself, colors are important,
+as they will be used throughout this tutorial to clearly mark which part
+of the algorithm we are discussing. So please keep in mind that, whereas
+orange
+is for emphasis,
+
      
+
    • 
+Yellowish is for representation,
+i.e. the choice of the genotype
      • 
+
+
    • 
+Magenta is for the stochastic
+operators that are representation-dependent,
+i.e. initialisation and variation operators
+(crossover, mutation
+and the like).
      • 
+
+
    • 
+Green is for the implementation of Darwinism,
+i.e. the way the individuals are selected
+for reproduction and survive.
      • 
+
+
    • 
+Red is for evaluation, i.e. the computation
+of the fitness of all individuals
      • 
+
+
    • 
+Blue is for interactions of the user and the
+program, as for instance choice of stopping criterion,
+on-line display of nice statistics or initial
+choice
+of all program parameters.
      • 
+
+
    • 
+Brown is for everything that is NOT part of
+any of the above, i.e. random number generator, or basic C++/STL syntax
+.
      • 
+
+
    • 
+Note that pink will be used to describe the
+syntax of compile orders (i.e. at the operating system level, see e.g.
+below).
      • 
+
+
    • 
+Last, but not least, all
+links into EO documentation will use the Helvetica typeface, like this
+line you are now reading.
      • 
+
    
+
+
    This tutorial is
+not
+
      
+
    • 
+A course on Evolutionary Computation. You can find such things on the Internet,
+maybe you can start here.
      • 
+
+
    • 
+An interface that would allow you to build your Evolutionary Programs by
+a few clicks; such a thing does exist, is called EASEA,
+and is complementary to this tutorial as it helps the user to build some
+simple EO programs from simple description. But there are things that EASEA
+cannot do, and you will have to do it yourself and will need to increase
+your knowledge about EO for that - hence this tutorial.
      • 
+
+
    • 
+A coffee machine - though you might want to spend some time here when you're
+tired of everything else, to improve your knowledge of EO slowly and gradually
+rather than when you have something urgent to code :-)
      • 
+
    
+
+
    Before
+you start
+
    You should of course have downloaded and installed the whole EO
+library (how did you get this file if not???). 
+If you are using a recent version of EO (0.9.3+), all tutorial Lessons 
+should have been compiled when installing the library, and you can now 
+proceed with Lesson1. 
    
+
    Otherwise, we'll assume that you are now in the tutorial directory, and that
+your prompt looks something like
+
    (myname@myhost) EOdir/tutorial %
+
    so you should now type in
+
    make Lesson1
+
    and see something like
+
    (myname@myhost)
+EOdir/tutorial % make Lesson1
+
    c++ -DPACKAGE=\"eo\" -DVERSION=\"0.9.1\"
+-I. -I../../src -Wall -g -c FirstBitGA.cpp
+
    c++ -Wall -g -o FirstBitGA FirstBitGA.o
+../../src/libeo.a ../../src/utils/libeoutils.a
+
    c++ -DPACKAGE=\"eo\" -DVERSION=\"0.9.1\"
+-I. -I../../src -Wall -g -c FirstRealGA.cpp
+
    c++ -Wall -g -o FirstRealGA FirstRealGA.o
+../../src/libeo.a ../../src/utils/libeoutils.a
+
    and two now executable files should have appeared in the subdirectory
+Lesson1, namely FirstBitGA
+and FirstRealGA (see First
+lesson to know more about these two ready-to-run programs). If this
+doesn't work, please go back to the main EO directory and run the installation
+program.
+
    You should also test that you can access the EO documentation in the
+menu line below: you might not need to go there immediately, but just in
+case you make rapid progress ... This menu bar should be on all pages of
+this tutorial, allowing you to navigate easily.
+
    Last, but not least: EO is improving only  from the good will of
+contributors. This is also true for this tutorial: If you find anything
+that you think could be improved, you are welcome to e-mail
+me.
+
    
+
    Enjoy!
+
    Algorithm-Based
+- Component-Based - Programming
+hints - EO
+documentation
    
+
+
    
+
    
+Marc Schoenauer
    
+
+
    
+Last
+modified: Wed Feb 22 2006 
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/make_genotype_OneMax.html b/trunk/paradiseo-eo/tutorial/html/make_genotype_OneMax.html
new file mode 100644
index 000000000..3920e5548
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/make_genotype_OneMax.html
@@ -0,0 +1,160 @@
+
+
+
+   
+   
+   Templates/make_genotype_OneMax.h
+
+
+Back to Lesson 5 - Tutorial
+main page - Top-Down page - Bottom-up
+page - Programming hints - EO
+documentation
+
    
+
    
+
    
+
    
+Templates/make_genotype_OneMax.h
    
+The places where you have to put some code are on pink
+background..
+Only the the character colors have the usual meaning.
+
     
+
+
+
+
+
+
    
+
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
    
+
+//-----------------------------------------------------------------------------
    
+
+// make_genotype.h
    
+
+// (c) Maarten Keijzer, Marc Schoenauer and GeNeura Team, 2001
    
+
+/* 
    
+       This library is free software; you can redistribute it and/or
    
+       modify it under the terms of the GNU Lesser General Public
    
+       License as published by the Free Software Foundation; either
    
+       version 2 of the License, or (at your option) any later version.
    
+       This library is distributed in the hope that it will be useful,
    
+       but WITHOUT ANY WARRANTY; without even the implied warranty of
    
+       MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.   See the GNU
    
+       Lesser General Public License for more details.
    
+       You should have received a copy of the GNU Lesser General Public
    
+       License along with this library; if not, write to the Free Software
    
+       Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA   02111-1307   USA
    
+       Contact: todos@geneura.ugr.es, http://geneura.ugr.es
    
+                         Marc.Schoenauer@inria.fr
    
+                         mkeijzer@dhi.dk
    
+ */
    
+
+//-----------------------------------------------------------------------------
    
+#ifndef _make_genotype_h
    
+#define _make_genotype_h
    
+#include <eoOneMax.h>
    
+#include <eoOneMaxInit.h>
    
+   
+// also need the parser and param includes
    
+#include <utils/eoParser.h>
    
+#include <utils/eoState.h>
    
+
+/*
    
+ * This fuction does the create an eoInit<eoOneMax>
    
+ *
    
+ * It could be here tempatized only on the fitness, as it can be used 
    
+ * to evolve structures with any fitness.
    
+ * However, for consistency reasons, it was finally chosen, as in 
    
+ * the rest of EO, to templatize by the full EOT, as this eventually 
    
+ * allows to choose the type of genotype at run time (see in es dir)
    
+ *
    
+ * It returns an eoInit<EOT> that can later be used to initialize 
    
+ * the population (see make_pop.h).
    
+ *
    
+ * It uses a parser (to get user parameters) and a state (to store the memory)
    
+ * the last argument is to disambiguate the call upon different instanciations.
    
+ *
    
+ * WARNING: that last argument will generally be the result of calling 
    
+ *                   the default ctor of EOT, resulting in most cases in an EOT 
    
+ *                   that is ***not properly initialized***
    
+*/
    
+    
+
    
+
+
+
+
+
    
+
+template <class EOT>
    
+eoInit<EOT> & do_make_genotype(eoParser& _parser, eoState& _state, EOT)
    
+{
    
+    
+
    
+
+
+
+
+
    
+
+   
+// read any useful parameter here from the parser 
    
+   
+// the param itself will belong to the parser (as far as memory is concerned)
    
+   
+//       paramType & param = _parser.createParam(deafultValue, "Keyword", "Comment to appear in help and status", 'c',"Section of status file").value();
    
+    
+
    
+
+
+
+
+
    
+
+   
+// Then built the initializer - a pointer, stored in the eoState
    
+   eoInit<EOT>* init = new eoOneMaxInit<EOT> 
+/* ( param ) */ ; ;
    
+    
+
    
+
+
+
+
+
    
+
+   
+// Eventually by passing the parameters you need
    
+   //   eoInit<EOT>* init = new eoOneMaxInit<EOT> 
+/* ( param ) */ ; ;
    
+    
+
    
+
+
+
+
+
    
+
+   
+// store in state
    
+   _state.storeFunctor(init);
    
+   
+// and return a reference
    
+   return *init;
    
+}
    
+#endif
    
+
    
+
    Back to Lesson 5 - Tutorial
+main page - Top-Down page - Bottom-up
+page - Programming hints - EO
+documentation
+
    
+
    
+Marc Schoenauer
    
+
    Last
+modified: Fri May  3 07:10:52 2002
+
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/make_op_OneMax.html b/trunk/paradiseo-eo/tutorial/html/make_op_OneMax.html
new file mode 100644
index 000000000..a108fb14f
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/make_op_OneMax.html
@@ -0,0 +1,351 @@
+
+
+
+   
+   
+   Templates/make_op_OneMax.h
+
+
+Back to Lesson 5
+- Tutorial main page - Top-Down
+page - Bottom-up page - Programming
+hints - EO
+documentation
+
    
+
    
+
    
+
    
+Templates/make_op_OneMax.h
    
+The places where you have to put some code are on pink
+background.. Only the the character
+colors have the usual meaning.
+
    
+
+
+
+
+
    // -*- mode: c++; c-indent-level:
+4; c++-member-init-indent: 8; comment-column: 35; -*-
+
    //-----------------------------------------------------------------------------
+
    // make_op_OneMax.h
+
    // (c) Marc Schoenauer, Maarten Keijzer and
+GeNeura Team, 2001
+
    /* 
+
         This library is
+free software; you can redistribute it and/or
+
         modify it under
+the terms of the GNU Lesser General Public
+
         License as published
+by the Free Software Foundation; either
+
         version 2 of the
+License, or (at your option) any later version.
+
         This library is
+distributed in the hope that it will be useful,
+
         but WITHOUT ANY
+WARRANTY; without even the implied warranty of
+
         MERCHANTABILITY
+or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+
         Lesser General Public
+License for more details.
+
         You should have
+received a copy of the GNU Lesser General Public
+
         License along with
+this library; if not, write to the Free Software
+
         Foundation, Inc.,
+59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
         Contact: todos@geneura.ugr.es,
+http://geneura.ugr.es
+
                          
+Marc.Schoenauer@inria.fr
+
                          
+mkeijzer@dhi.dk
+
    */
+
    //-----------------------------------------------------------------------------
+
    #ifndef _make_op_OneMax_h
+
    #define _make_op_OneMax_h
+
    // the operators
+
    #include <eoOp.h>
+
    #include <eoGenOp.h>
+
    #include <eoCloneOps.h>
+
    #include <eoOpContainer.h>
+
    // combinations of simple eoOps (eoMonOp
+and eoQuadOp)
+
    #include <eoProportionalCombinedOp.h>
+
    /** definition of mutation: 
+
    * class eoOneMaxMonop MUST derive from eoMonOp<eoOneMax>
+
    */
+
    #include "eoOneMaxMutation.h"
+
    /** definition of crossover (either as eoBinOp
+(2->1) or eoQuadOp (2->2): 
+
    * class eoOneMaxBinCrossover MUST derive
+from eoBinOp<eoOneMax>
+
    * OR 
+
    * class eoOneMaxQuadCrossover MUST derive
+from eoQuadOp<eoOneMax>
+
    */
+
    // #include "eoOneMaxBinOp.h"
+
    // OR
+
    #include "eoOneMaxQuadCrossover.h"
+
      // also need the parser and
+state includes
+
    #include <utils/eoParser.h>
+
    #include <utils/eoState.h>
+
    /////////////////// variation operators ///////////////
+
    // canonical (crossover + mutation) only
+at the moment //
+
    /*
+
    * This function builds the operators that
+will be applied to the eoOneMax
+
    *
+
    * It uses a parser (to get user parameters),
+a state (to store the memory)
+
    *      the last
+parameter is an eoInit: if some operator needs some info 
+
    *      about the
+genotypes, the init has it all (e.g. bounds, ...)
+
    *      Simply do 
+
    *             
+EOT myEO;
+
    *             
+_init(myEO);
+
    *      and myEO
+is then an ACTUAL object
+
    *
+
    * As usual, the template is the complete
+EOT even though only the fitness
+
    * is actually templatized here: the following
+only applies to eoOneMax
+
    */
    
+
+
+
+
+
+
    template <class EOT>
+
    eoGenOp<EOT> & do_make_op(eoParameterLoader&
+_parser, eoState& _state, eoInit<EOT>& _init)
+
    {
+
      // this is a temporary version,
+while Maarten codes the full tree-structured
+
      // general operator input
+
      // BTW we must leave that simple
+version available somehow, as it is the one
+
      // that 90% people use!
+
          /////////////////////////////
+
          //
+Variation operators
+
          ////////////////////////////
+
          //
+read crossover and mutations, combine each in a proportional Op
+
          //
+and create the eoGenOp that calls crossover at rate pCross 
+
          //
+then mutation with rate pMut
+
          // the
+crossovers
+
          /////////////////
+
          // here
+we can have eoQuadOp (2->2) only - no time for the eoBinOp case
+
          // you
+can have more than one - combined in a proportional way
+
          // first,
+define the crossover objects and read their rates from the parser
+
          // A
+first crossover 
+
        
+eoQuadOp<Indi> *cross = new eoOneMaxQuadCrossover<Indi> /* (varType 
+_anyVariable) */;
+
          //
+store in the state
+
         _state.storeFunctor(cross);
+
      // read its relative rate in
+the combination
+
         double cross1Rate
+= _parser.createParam(1.0, "cross1Rate", "Relative rate for crossover 1",
+'1', "Variation Operators").value();
+
      // and create the combined operator
+with this one
+
     eoPropCombinedQuadOp<Indi> *propXover
+= 
+
         new eoPropCombinedQuadOp<Indi>(*cross,
+cross1Rate);
+
      // and of course stor it in
+the state
+
         _state.storeFunctor(propXover);
+
     
    
+
+
+
+
+
+
         
+// Optional: A second(and third, and ...)  crossover 
+
          //   
+of course you must create the corresponding classes
+
          //
+and all ***MUST*** derive from eoQuadOp<Indi>
+
      /* Uncomment if necessary -
+and replicate as many time as you need
+
            
+cross = new eoOneMaxSecondCrossover<Indi>(varType  _anyVariable); 
+
            
+_state.storeFunctor(cross);
+
            
+double cross2Rate = _parser.createParam(1.0, "cross2Rate", "Relative rate
+for crossover 2", '2', "Variation Operators").value(); 
+
            
+propXover.add(*cross, cross2Rate); 
+
     */
+
      // if you want some gentle
+output, the last one shoudl be like
+
      //  propXover.add(*cross,
+crossXXXRate, true);
+
     
    
+
+
+
+
+
+
    
+
      // the mutation: same story
+
      ////////////////
+
      // you can have more than one
+- combined in a proportional way
+
      // for each mutation, 
+
      // - define the mutator object
+
      // - read its rate from the
+parser
+
      // - add it to the proportional
+combination
+
      // a first mutation 
+
    eoMonOp<Indi>
+*mut = new eoOneMaxMutation<Indi> /* (varType 
+_anyVariable) */;
+
     _state.storeFunctor(mut);
+
      // its relative rate in the
+combination
+
     double mut1Rate = _parser.createParam(1.0,
+"mut1Rate", "Relative rate for mutation 1", '1', "Variation Operators").value();
+
      // and the creation of the
+combined operator with this one
+
     eoPropCombinedMonOp<Indi> *propMutation
+= new eoPropCombinedMonOp<Indi>(*mut, mut1Rate);
+
     _state.storeFunctor(propMutation);
+
     
    
+
+
+
+
+
+
         
+// Optional: A second(and third, and ...)  mutation with their rates
+
          //   
+of course you must create the corresponding classes
+
          //
+and all ***MUST*** derive from eoMonOp<Indi>
+
      /* Uncomment if necessary -
+and replicate as many time as you need
+
            
+mut = new eoOneMaxSecondMutation<Indi>(varType  _anyVariable);
+
            
+_state.storeFunctor(mut);
+
            
+double mut2Rate = _parser.createParam(1.0, "mut2Rate", "Relative rate for
+mutation 2", '2', "Variation Operators").value(); 
+
              
+propMutation.add(*mut, mut2Rate); 
+
     */
+
      // if you want some gentle
+output, the last one shoudl be like
+
      //  propMutation.add(*mut,
+mutXXXRate, true);
+
      // end of crossover and mutation
+definitions
+
     
    
+
+
+
+
+
+
    
+
    // from now on, you do not need to modify
+anything
+
    // though you CAN add things to the checkpointing
+(see tutorial)
+
      // now build the eoGenOp:
+
      // to simulate SGA (crossover
+with proba pCross + mutation with proba pMut
+
      // we must construct
+
      //       
+a sequential combination of
+
      //                 
+with proba 1, a proportional combination of 
+
      //                                             
+a QuadCopy and our crossover
+
      //                 
+with proba pMut, our mutation
+
      // but of course you're free
+to use any smart combination you could think of
+
      // especially, if you have
+to use eoBinOp rather than eoQuad Op youùll have
+
      // to modify that part
+
      //
+First read the individual level parameters
+
         eoValueParam<double>&
+pCrossParam = _parser.createParam(0.6, "pCross", "Probability of Crossover",
+'C', "Variation Operators" );
+
          //
+minimum check
+
         if ( (pCrossParam.value()
+< 0) || (pCrossParam.value() > 1) )
+
            
+throw runtime_error("Invalid pCross");
+
         eoValueParam<double>&
+pMutParam = _parser.createParam(0.1, "pMut", "Probability of Mutation",
+'M', "Variation Operators" );
+
          //
+minimum check
+
         if ( (pMutParam.value()
+< 0) || (pMutParam.value() > 1) )
+
            
+throw runtime_error("Invalid pMut");
+
      // the crossover - with probability
+pCross
+
     eoProportionalOp<Indi> * propOp
+= new eoProportionalOp<Indi> ;
+
     _state.storeFunctor(propOp);
+
     eoQuadOp<Indi> *ptQuad = new
+eoQuadCloneOp<Indi>;
+
     _state.storeFunctor(ptQuad);
+
     propOp->add(*propXover, pCrossParam.value());
+//
+crossover, with proba pcross
+
     propOp->add(*ptQuad, 1-pCrossParam.value());
+//
+nothing, with proba 1-pcross
+
      // now the sequential
+
     eoSequentialOp<Indi> *op = new
+eoSequentialOp<Indi>;
+
     _state.storeFunctor(op);
+
     op->add(*propOp, 1.0); // always
+do combined crossover
+
     op->add(*propMutation, pMutParam.value());
+//
+then mutation, with proba pmut
+
      // that's it - return a reference
+
     return *op;
+
    }
+
    #endif
    
+
+
    Back to Lesson 5 - Tutorial
+main page - Top-Down page - Bottom-up
+page - Programming hints - EO
+documentation
+
    
+
    
+Marc Schoenauer
    
+
+
    Last modified: Fri May
+3 08:06:20 2002
+
+
diff --git a/trunk/paradiseo-eo/tutorial/html/real_value.html b/trunk/paradiseo-eo/tutorial/html/real_value.html
new file mode 100644
index 000000000..a5ec17852
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/html/real_value.html
@@ -0,0 +1,56 @@
+
+
+
+   
+   
+   real_value.h
+
+
+Back to Lesson 2 - Tutorial
+main page - Algorithm-Based - Component-Based
+page - Programming hints -
+EO documentation
+
    
+
    
+
    
+
+
+
+
+
    #include <vector>
+
    //-----------------------------------------------------------------------------
+
    /** Just a simple function that takes an
+vector<double> and sets the fitnes 
+
         to the sphere function.
+Please use doubles not float!!!
+
         @param _ind A floatingpoint
+vector 
+
    */
    
+
+
+
+
+
+
    double real_value(const std::vector<double>&
+_ind)
+
    {
+
     double sum = 0;
+
     for (unsigned i = 0; i < _ind.size();
+i++)
+
            
+sum += _ind[i] * _ind[i];
+
     return -sum;
+
    }
    
+
+
    Back to Lesson 2 - Tutorial
+main page - Algorithm-Based - Component-Based
+page - Programming hints - EO
+documentation
+
    
+
    
+Marc Schoenauer
    
+
+
    Last modified: Wed Nov
+29 08:58:50 2000
+
+
diff --git a/trunk/paradiseo-eo/tutorial/index.html b/trunk/paradiseo-eo/tutorial/index.html
new file mode 100644
index 000000000..81b87972b
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/index.html
@@ -0,0 +1,26 @@
+
+
+
+   
+   
+   Tutorial EO
+
+
+
+
    
+
    
+
    
+EO Tutorial
    
+Welcome to EO - the Evolving Objects library.
+
    But you are not in the right place!
+
    You should better try to go to the html directory, for instance by
+clicking here.
+
    
+
    
+
    
+Marc Schoenauer
    
+
+
    Last
+modified: Fri Nov 28 CET 2000 
+
+
diff --git a/trunk/paradiseo-eo/tutorial/pdf/CVS/Entries b/trunk/paradiseo-eo/tutorial/pdf/CVS/Entries
new file mode 100644
index 000000000..76417eb98
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/pdf/CVS/Entries
@@ -0,0 +1,2 @@
+/paradiseoJet7.pdf/1.1/Wed May  8 06:31:18 2002//
+D
diff --git a/trunk/paradiseo-eo/tutorial/pdf/CVS/Repository b/trunk/paradiseo-eo/tutorial/pdf/CVS/Repository
new file mode 100644
index 000000000..44bc5bbaf
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/pdf/CVS/Repository
@@ -0,0 +1 @@
+eo/tutorial/pdf
diff --git a/trunk/paradiseo-eo/tutorial/pdf/CVS/Root b/trunk/paradiseo-eo/tutorial/pdf/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/tutorial/pdf/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/tutorial/pdf/paradiseoJet7.pdf b/trunk/paradiseo-eo/tutorial/pdf/paradiseoJet7.pdf
new file mode 100644
index 0000000000000000000000000000000000000000..b227633f314b7b2b36e9d5122b992ff201186743
GIT binary patch
literal 530785
zcmdSAbzD^2_diUhfJ*lmq}0GLFm!iGNOy@e3@r#EC@mn}AR!3SohscRC8=~HDgB%Q
zz4w0Zz2A7A=l9QVcrknLwbxmD?X}l>pFL-yZfAy&4*LJ{ad$Gez(Z)r1t`Js>jQ>@u4*7V
zJe*%77!UaGG%(jc`8c^afyp91e_qSU!_E0m8t*@8FeukQ_+Y&M&;`Q9^Di_Q?C;ld
zLjf)RrVBR|Fyr57P#!Lxf6}1;xR!^P=O27Luz!vL19Ni!T^fH^r}f1ewe6a0@g0&{VJ|Gt)BE^f}h&kdk)|J?>)ZVtd%|I>b8
zZoqB-M&r2hL72)~3Fho?yO6Urh8FO%OK`pqs&A`S`7+?S%2!sO)<2L4nK)H?0
zIfMitCKeE=IRwfJgIJiDnwgkF06W3V%uJx1yqp$Ln2J?&2wim#2Xhd+xG~(=#@-UpK*iY7+!@dhaOErg6wTqrW4L_&7N@I5{9-7#IqG41@_l6a=XJPi%NsQvWst2+#-6T)`X;H+OP&
zFg7)pvN5)F29!dG{0mm`UTOL_!~ShH2>Uvj+g(i$1UUTfsr^AzGIxi|n|oYCqC5gW
z5e^H?AIy7gR8EBR18q(KQm;xbATSZ_U&1)KfAK-D`?)xN4Z;PzUOx!Owd+ARua_9Y
zeck5%#mEhyCPE-L_ccE^^w%PD|8ik&*tKLR7;?o3{Urzr`PJsR7RUp>)|`jymjE8f
zwW?Rx35>wQecizWy}po#=UP=B-s=l_!Poq}2n+@I@esEVReKwAMPmoR9e?@7UseDH
zMyUL21=!U6KS1nA=&x9|O^Ptq($?
zGu+AC*cJ~*CdkCd$jHLTNVl!It2w=^t-0S9=}ZI+#UQ~5r@o=(yU*oEW`JJAy+?kR
zl8lUJPasO*?wrw1T+8AMoydQ-IS~ttm3nf#D*nDEm
zd_9T;q%STePrjouNJn1uWr2#?NgslE_JWKGcQ>I*Hz$9{zuqi+_YTjfB?YIFA|r^9
zf?Bf0QxwW4N{v*$)s`jpnm?doq^|M{TwFb?l?T=GYnJx5GotM6Xp)aQs>`(B3@H6C**6dT)$n
zoCj8+2(k>d0F`>H?9KJ%JvMT5e94C<1}ayFsKgTaf>S%1PqJ>x$Rn39^WweY+S!G3
z(3Be+=}b3sO!$e)KKILd>Bki1m$BSp2S%ojWxt_d(8F@${WclF3b@NbX?&tw>a1OI
z)Rc$PyPBpP+N^4YkDAnp3@ZHG47!i}_LOXV$_@Z3wT!;15
z^Z*D2K-k>O%2>?a9T1I(ac5369()mLEHe!A>abhcMY}IR(A%j
z`%i2}7y+?P>=Nd#R;K3CPR1U8Sw)215xu&IF^p|grNyr7r}@|lZmwc)1y~Kxg$>3H
z%m54mvvC0TP<;@)w6U$NG0?-w#tD4D|0oe!DH_9_tgfcQ1_5&dK*z=jMnE?k2N<#1
zY+T%kogW(yu;l=(#s&r>mYogEi?9_N2M+>UugAT%JD&cZu7^NPgwnvK6`1WWKSk^#
z{=~rl4(@>61Hh?zwVZ##9Xzf-dux+v
z4bwDfjmej;w95ozw01t#Gj?P4b{F$!Po4KpyO-H{j;ws#t1s4tFyh7F<_YQ5dPdJz
zkj{yMPxqI4KiO|9?bS6s_c~b>xIBN#=i%m9=WPLcVgQ$MQeC0iMyUxI7EAlGp8vD-hSM!ag?`aipdk;uJ
zPm}~OETw%1-HLE!OYc0^3GKseVpiIhBy3rsTC0lPcx3|**FcLJSHKBv3wk+cgG_Ox
zpT?pr{771hC57%V(@dI7Og_VhTUJl)R^Y(x5ZTguH!`wi?7C|e+&=1x$tSeWZD5H%
z4r;v7D0v6%uFXypAJfcW)G$8!q1q!iE^XV%?jG
z1unCJjq2YI(r%c3oWQ!*82ve!+c+Lk*}(c_L+*a#HCTo)aFVl$d7?pj9`
zYU8{@mV;qg6J$lQCl4BZusTmJhyfZ0=wMCKT;3+2D)m0flaDubza{wrx|=+xKe+!e
z=n378GU6G}s8^DNfnRa#1!eEk6_~6Rs{1>DGKzQ>9{prQsAJbWR!&ilrf;8zx3JYA
z8?r{hQh`kSK5Bv6C?4;pUW^U0xJ~n2y4GiUK0
z21h7$P>Dody~h@}K8vZ*>GWsG&e*V03Vui!IHYn2v6Lp0`&3Ll9fPDuCMRC=)lrqN
z(N&Kn_uIMF;=!9z`Wv}-W>4t&KRQqZWAZXZ0_}{cQyAq(-ACeJOoqig>`zY^-JbP@
zbG#39I$eHyBN0&jq=)@9Uohajib?Py`L$
z=f1`IVMMT&K?2bBo@2V1JekG4#?mRmVEP+nk&o3>2|GD;r*C;xzA%Q$EgVYVkv+Nh
zu*?jV%%Z^BMH$^p-j4M(#JD3&;v$OGxTBD*K~VSOYsw#k-pcCUMDlj`F+YON+;eIZmCBINMbNc*C)OS5$Hn>vQed0}
z@>&hKxA4cE@H}5K{y9zWbM|H=E={`Pf9?u+ulB-MAPoF2{R;^HbtC%UgYciX?ms~|
zG)}bWE$@xMBbQ*ED#$BdM=Dy=N6x;3`)lAK_^ja*hIp$DBOF1d+aJyrACUgUocXZ*
zVc#GQiOO_>6da54~98(Cr?WqC$Gzr!^`uZ%ScX!To#x_wV3%lDmchgNc_G(
zXdW-0)UyR`uai@$d{5OL{oZ9g?%3HdW#4c7Nkt999w%uA`3Zi9@$h)Rj@1Y<88mGEy`!TDZW0X={b|f@X`tem56#U1
zWSEU7CMOK(Q;xMT!Q)&-B%Gw2#>|vTy;yD=9b{Le7m8}a1mk*wfr8fFjz|H5-Q0JE
z7rTH#McI{Ir*`OD7H;2e9&1Og99v%Sx@l%1PH%|X2=m2p>-x{2
z4$6;c^DgBZ7KLrMa(t7xgYSi&ian@4;b`GKNM-U6jW@#a<#~bK_71Q4BA-=>1AU`V
z&6lHv%m``bCOw%rEwz}F2*6Wqyu{l=c2Xg&P7RQkQ;imK66Vp=nx}1GN*sNHy9)Jh
zxck^y4Fzv5k;Z|=-|>NNaGk)!N8q9A7Z0bRZiCf-M>XbU;1D
zs5^#CH^5Rurz7OPysbpV8TUn!O%AI0wLnTGo}a7GzY`VY{qV%tRSd@SwGG9-*{)@-
zD3ALYT#4E_($17~P#NG9ZSsb@o8@NiIR5xc8szUpS^2W2e!Q)&prn_n&v}?~kYIqU
z9B140`J2{!qm@E^#W~`hMIU(Xj0X25qbtzIKv4k;M!Pl(k>cF6RJHc>OGB>hypKMP
zOmsA`?^G&61;!cwX2o;slLPkWTV<%dBhKT`M<=aJ`7cTGzII?YkAyR{pp8#56uG(=
zAq{iUd)Z!MoTRb7-RqNWI(^12vXLS)omk7zGu@&7066%ln`{>yHfjp`-;!%p~strhnpV-41#Z;UCQ$~Sipr{xU#;Ok0oj%YJTnWnS=uAuzG|>??&%P!tv9vu|6S=y;ewATrphWU1C_}
z1lkwe(Br+40Kp(j@Or+9mm_&UJ2D1Rmow(nzu_3-r|%Vxad1KYf@6rCJc5k)#q!_d
z*uVXD4jpR=-h|%3m^=3feqYB?a$o+?6h4Bn>Hb~!!z&`&$ruRMLI
ziq3j@%9ZTg6W;fILKIum{aa~vO@x0q_Rzy;m%i5T&WV>w+2@pENjLEMEU-QOKx$HL
z=u@nC^aPkP%ZAI-#UdznkZx2KMIS17PgLKDZ!{*uf>3u=x8adv515~$YfF!DXG?D4
zbg0699Uo>PX=(JK5-oU-xkV`!qiT*%dU;9P!;p@t-l;CTMhw|*#$^nrJJs>DURGsd
z*J)a`9qpUX#Z1diql|uMX8^wfdX-e9PBj)U4
zSEhGdyxJC9*{0dPjcpF%%~sXvKUtRFp{6ODZ1kwvN;VC=*@sCLx*b=W%091c7fYYj
z^hI=t+`oq@f#mc{VD=!D)eVS$?&+xzQ*TIsNeQIZIh{J&*^MVuzPH2lPB#zxvBv;d
z{8cu_&vT10&&F8GYHf-QdskmL{k9WMPOFk^6(l}Ofo2JGbd;j%@z5@#EW5J-GXZsT
zve4}7=2{_at6Ckq7s@QNjH;CVS*k@_&CqD~ln9i9EzlF>{am9WV30M;0>3;99xK9-
zUpU0cPPAoYwg0Ld&9gdesPU3*Ui*<{0_(LJ<2dedwbeJ0vavK~(yJRM
zxnC3pH9YNVJ7((_D3a`67oT3dqwRp`7ixrreYdcJ=hgZRk+%%9mOQM_ukH9Ww9@A1
z`lgR+MPX!7V?@$eKFjMZY@o;w$1I;Mu4KHxr+rb3vDQ!Y{Ajo!ewr@uR0P%LS5S{pPjz!Y9(F
zH(@dDU5-4Hp3{}XVo&KQ0J
z4$mKebN$HRe*-wz0{;H%HFQ)ld;xj`ea<^2b5t8E_Omecy#gvw$NTR{vRec%oJvrl
zZ@207pzBirHiqSpM2^#0N29fNKr8Iyaem@+e*WYY`hu4+
zHTo)^%Gzm~ut8J9rRT`e!}P4hrl$7jzL=o|R6*5pf$n=%z;NTZssG-hPzQg|Z>Dd2(ROh@NWeym|jGN$PV&nZ)!vJ2TV7Z;_z-0?Kr
z0<0D~s>;LY(oNtgym|wF|F)JwiFcXO=h!wABYEFj^*#NQZ+9^)$|3P|%}PTF(@;m)
z?a8+xC6TSWQPZN!%&QT!qFdNCF}2z`GH%M4a?3LUVL>lzV;Z&T@5pCGqHHpzL<*$*
zl&m_28Z7+4cBU&1AJnFL;Q8n|by5I@kw?pse;+Z*`R6*p64iz;2c1&5rgeslK!CN>
z#aH)xHwI{uvM5SnmuA6pMC5~)!T`vUf5X)A9r~n))I^MCT`J?^;CMl@4zLYMA}Mbz
z0~BXz(mfjpt}PyB6+ZEFCdp5=s^b9Q5LsbCB6FpsmRt&o0j#*!j6dWtB?ViO|8cAB
zSjxcY=hBOF+2y;)btuebQf70N+7C8jG5lXPyvm}⪚5vqr
zBOUh~oU0%Ss2iY^iMo3~9EOY5?)E?O-F3l4`-$&2xfr`v`?U!AfR3lUHD~?My+=6(
zC&*>Uq(Zc1NNZ=E=zfZ5eNT|fcg2y`K^Da&5;KO?4V=7v^^p;a3OhpmOSa1PR7x^|
zCG>FHAjK$c?Pp!kD#^&fnn+7dEhi*vkbRqV_s$F6H%)-G*vZ$Dba2p_M70DoS}$rtYmp
zv8fA0{MN$in;S`mD3uV{NBkjJ^=`cejy)gSHy%6^EGOUTS;;QAUO>CWyPK@+@nY?G
zw-1kNqEGi89q72ux@%EPoj*dCU1l@LSuRxdV6Bm`vEr-%@ylA`IAt#6*E7|8o`rZy
zB%*A}vsua&4VjjyhsKijW-LhI7#qy3e7-m8N*$-gqIjsRBsR~O&ngX)iF`Wa!=u>MGHen-SVysDG#z4Dn%F)i-tBY8BT?P
zO->l}^wGaz&hLkSz*!@3+V=a&?$zVT{~hKa1pFOyUW|!`Q^Ibb4>Tx$b0G;}mdngD
zHH$$-<0?@1O{fv(U`epsQ)4l^^-=8EddsTG(f0Cu``*#K`xYfZ$?v`d4QrTpM?AvE^}X-dIcOFZ8xyE$d0Z(Ttw
zP(?dr44HnsX#@MYCB4iMx>Bp6x)nW;;K}yUc-48|c~^`nWx}M50hNif7JF0_F6;f-t=BL1Dy+HN`aJ0FjUjZu!(;@36Gk*bzkM?lcPP
zg)Hp}^DGlB%PI7B%|tS%9=u33`T>%YtZ|xJd~{0wr<_joIi%GZG~Ub4Lb(pIbB}B&
zdXU+W@rxGZ7oFBcaeyw@TV*wN
zus3HAeN|+&25TspJ%)f;KPvmX@$lmu5!7r;`nPn?K0j4iHI4Bqu_|?VEjqM^RAbYg
za)uq{Gj=<{R*9UAPc!HUQ0v4&TgRApQk>^i2r;?h=!*bncmNpSKcq~LJ-r@$%cVw)m-!y!MkcQa7_eXs7hg6?^@^Sin
zg327(y7cB;av29~eE#L>SLZvq4nxk1pd<|O{;=1nl(ioH2QZiD)CZW85K=EY-~I6i
zAMY75(7sL3G4sT8eu+j3V#`?BRU8aR|0p|1oDXH_%~+9=>(_!G=d6gStiD~raY>Rg
z9SnPuN_l5`FJM=+Hub9{+qRX{GRXg}400yI?EK7bsX*P@>0=R7tcYoO5=ss#p6>@uc2^=UWj6J9U3{Kpy_Z-QVy;tv-WVz
zS6d|=vEeYHss~8$&Z;g2r?(0&n~!a!eRxAKh3
zY}^;ug{hHa_HIe}!^2q)d0%VE8qDLIos&86&_~LJTZ=Rc$PXknz55rHRTfjNi0S+L2;ZJ<~-<}A-IR5QKAaqPI
ze1zjB+T1z6IM1N#seI2#QRZ9uDwln|S-El5Bz*?$%Ba
zCYl@1z%)T_eHTq|42{uW8
zl3n%>)_8W8@3DIox_d*_^1??8eqHF7SRD20azCZyVJ7MaX4t
zrD#kvmwHLROILPeGUt#OTzAl9bsiONs`JW@L%kI9S)L8YN=aW~%8(vAg%TgF`gNcm38Ddr&T%Dy+WiiqB#%h$bwfgRdq)(CVq^SMe5#s7hF}n4l&gB66
zn{rGiy0-+cTFhl(94=4YS9XW`(P~vsn|oJKAeFFtEEh5p>0N{5@AQ`V%&qP(
zhn7R$)(NXZ^Y*`m5)BL9X2n~@hf{hFGbbJ86W3c^#Y*NgtJkU@?enn(O*uZK
zYC?ycW|{e~Sy;Xq@8y+~3G=?=`4DcaV)bDqmTyc}GY5B21^%goxfV+HTo>-w7Tt$Q
zY)y@vo+T^?&4YV)?b@d}eSQeofv__q)!Lt#KP_SLqtjh-&mx1lXM@n(;xT7!J2cb&
zLjI?{#sY!fKQCgXTb!mi$GQXjl>$v{Rh+pS^J?gGi!_}lvJ)qZm!R)!5)HrTQL0ZA
z)Uc@a+NwKGVj)eRMV5+Y`@4A^)F{T+ngi{NBglHco_prP57?O>WWhhP+N(~+Fj86r2mlh|>1_l<8{=_4F
z-pg9eV%kDywZX5TMq`g;*yumsd5V8yIhla5a$N(p*vn0H%X36v?yypUWQ$d`O(=Tp
zk#2`Z)kLO_Z13Ag5~pirqm+WlvSQ_XmW8ietCPAJ9UDC{KP>GVl7z!(m27TJ78=Y|
z>0$-z+8x;bs8k~FW|cKfqwE?7{h
zDHS_Hj@b2iFe?NKVnw8!Ao2~th|^fa=_`Uk$=DW=;RGDLTbVm4nY*c|v5MK-m?^3Q
z{jxyXla;9`BK-)^5^;uXZuK~XF
zkcEgy=HUXeVXjIbMT;Al^k4t+em8y#;^IaKL0o$M4Y?AENFwA0jw57dS-+
zgSY{UL4gz@JSY!0i0dj7hXVuwviW#`EJ;KM50LD|4I~#KN+`gL$PeP?g@B;kfDXXP
zKMb%tVpzQ2V_%otK;j@bHx~$k7y~G|fx~YuAkpTk4kQ3^0tfj(*4oujh&nF>5Wx*}
za03ZV*Gz~x1G)fn(C>%9z|-FUDO7+-@!!q5gfW4_+NGj^~1u{gL@m#0nGEZK#(+gj&9m}d6U{mhD{
z>9E#DoP$Z*{^A_7d^3ifwZ}On6=suHINC5=RBLuBy$S7i@f4Ha+fL$vthIhLlRsq%
z3@S>p3jgHT3abZWRxi8}N;1w|w@93S8b8VJj8S%p=gi-G%n^aY!L!~)SwyJP^Xo9w9^zB5C+KF!r`H5ThO^Y&{;R*r?+#{Q_#H!dB*~@I|T*GWTg93UaCWmx#1vF0dGrcN$lrWUieN7RU!+M?A#@l|M{hn~#$|HKU
zo3Dc{;z-qjLFm`vXUB1ikw|9H=x+05viZRSOu7%l|p*B0@q!ysbbEv7{x=T4a~M;ewQQd>zg(sB5J
z1jsR+LII5#ePLk?&4>z@Xa&$y2Ko5WfJ8cKdX+}F55U^le8Xwq`tEBc5JL?;O1G$+#*&W6#__a@Ww0p0Bq@8?F-qXeLG9s#o*%byyE!3iBJ
zaY<>|iK0?T?0^^%y+)NI^!-7B(TVaF^F#C6=YmBhogfi&k=Ua;dZZRd#G2eiUpRe8
z==agjhU3->6)-DbGDcAQOL~+9l-+fpqYYX6Tn_2Bt#fReKcIq=rALi5%4=$`-O{t#
zVTn1LsY{d_NUzke7XM`vf0aY}8>+7N@W1m+|J?IlC5R%nBfuRK1Z?}*e{G2R8GF_k*r3P&9V7{v*f!Di0gj2>$_x;^MOE>Qct;zf-lZOCZV9
z_BxAJ9>fYr2Xbj$Z0(#8g8~@&SD3u~^|?R-q2K`foL}(yd&hIN=e|N_#QyY8Wd8ji
z<$pT%hFuBx`xD{hIDKVZ*v-K0y$4Sx1VYI^j7#&!gf>S*E-&9
znjl5xt9wEOXlYVYL$?YAJjr0pD57Yk8hKdvu^D{`o^e1Z9P`-hAd<}?zDz&?>O!hh
zCH8$Q+3Xn*>>KTur*dnBpOATAwUM)rQQeG_6AufA*w;p~xlCB&7S`RH;|cj#_sNYc
z^P$bw_fWjw`Q~7`lN)Up+`TCYDm~Ib=Fq_yKh4MDC7&zQA@(ysD}C}jYY}2O%`=+l>2X}sWk(vfUUT&Z3=jc*PpzQn
zpss`^-7+SWqB1GI(3*H@(RAtbu%$44Vm}sC|J8@cGLO)H=Gz8~yhg^aVn&fgiDH}K
zK?hNi%K(G3qdXPo0Zb(FL51>WISDeffs`stdwue8cm*?x$>{CbWkqBTMA@r&>tDI&Jy`C7Tun`P(*fcy8ZLe9&Cob`@K9rEEAa1NkgpH}+B-4DQH7#pb;lW{>W1cENlXaT84&xvm-I!n_A}+7
zj9)PJzjlcLir&99m-?0osqGcmL3s#Jw69rERt@R>wT8P=-|2Ihkd$U*ranW^n<>fX
z912iw!k4G8%ox*qycN_CjxqNN&<_*I2qV0j8EOA(jKy4AE)&u|2{Cd}MLyC1*F%(Q
zlEWb>>9C7|bN!djB^v0@Q-wLfWVFOso28La{HE7_waPV}L`ee}LqED~Y4M8PF
zR_RZqit;beeY_x&YAwFY
zS5i`HRNKzvv}qypem2d^_Zg+TfhQu+ebcg&61`{V+gmSg%1?MzI=Q1#XRdmDKZU&S
z+^lMS>h^4}lnj=J-#QlDz7dl9=-Y5+=Z4h;wN(cbHHZ1=w~&j2RK9!WtGCSCc550P
zTc-N9+`3zJQc~+r-8;d>%Mn$=y5&;T6Qx1P_jCmh(lgejbuA*ob6*H}@04$OM4ZuM
zS|7Ctg@H%N%BW14+7&PpdW+UmXkrhay6hi*m=G=-QB_o)X{!0zN)~PL(sqKeiR_+Y
znw5sCZVc+3TK_vI;Lp4AScAjjchGg7CV3`WG#v@`R64tyZ_OVscBU$AXaI5LD$}D?0&}a
zL9z6tRLJO6gi`^#hV-@k_c
zd=Ue9)*}kCFt%~NdS^`$k*tsSm8-4_yeMG?+~BO>!21P%{c(Nuj>fNB=>H&2S>+GO
z_6~nkl~sUIfFZ=BIYGcPF$-fC8#vI^5Lf+=w)%fIWz_%5EG~L=<25zDD%7s-z3ji<
z$P<-S`(rFIMG!!CvNg6r%t`+G{`}YJARe9kZ8HB?y!HaT5A*A_7hrAJ|6jf6a((uT
zcmwVK@T)4o#^W!J^81YXf7*H=o)-Rn;}IIC9C5!2uXTHmX^pB`F#Gbp5!nu(2pjBv
zxF6LGT9TxR1EfgF
zL*et2%Jbc`t?9T+JK=X`nbC3{-aQ*XhhdT;OZVsCG6&kOmAXD9RTiYWbJzfQ+~Z}e6>
zYxMT^IME^H`Nt6y68s=~RUelw79dT@%a
zZcyG0>LzQ~R8Y|}V{W&VPwEDPdBrUpO4j-}$U9-a*|OP=ntE7>x5Q=@jcv}pu|(gg
zm;8jvIl>0RN@Aq7&Qn-U63BIpPnt$V0G6Syi?~f8A92UUBmy
z-p+z6YV;8xKDX{+t?gCoY5ga>oi{nMLNh-wJZdSkC#96FcsTqZlPgS{wy~deGiq%Q
zZ;qC_KX?K67u+DR4_K?5KnQ-K3P!RQg>XeCX
zafyGU;Dn?r-uO6d>WM8O|H`EJU2=4&D+d}UF3;ETmVp741xhsAjp91Rgpal+nDgKR
ztg4`tEt2h|>dEnz_>&~9YQ+ts&leYjcG3LtV$UM5syb6Xd2g1k*lZawQ_p_1b;_-i
zTvxB^r0&7w4wyt!b_?-|n4u?F`f_}43hL1jW`h47upBx6vlo-}1a&DV^iWT^m9S@y
zFDZA7tKz{0lYz>e4X}X8K!Q5)*LIXb)85|mpWRV~1}J6XZ4X7ZX^krfQ5(EpOh^%Y
zp1DctR_m9##WrM{^>X_8hY{N>%yi+vkG5I4b**e=fwC_;^`FBhIYeil^@Y?u7RalZ
zz#Fm|&Pd9F7x;|HFJCOO+YM0HJA_OW)M~^L3)i*MKXm&zGJWv^cOkLpnSZVF*dsH+
z8Kq5wecAbwx+njTEbT0(s0S*
z)P?+%oW^G7MfGwC*9Vy&+Qn14#Rr{=3S1Mj0d*JMtE$%7(wiuCY;H8ubyJ{*`xW=|
zjgZ;cC@T^9UsN>DnY?vFTGumk0N*awZXwksatjHG^zG#%CD#l6Y%p5WF=ui=w3Nm&
z-a1mWO-8{i;I(>W**F>QW)Pf>bA=4s>3w^~s*c$X`1X?4@?HPew^rTm29T*oR$(Pz
z3BPxaZ0V5rX&j&xc-KENXy+3kHdF!r+FTGnQu<*rSppW$`*!VJ9WxHjTSQuSzNr9}
zLGqU_Y@B2XzE4)FdQZZoaU+AYJ_6UhvcXPP4MahW@UUMmtJGE{C3o-HWCHnRZo8EJ
zjK{_W#zO8;&@u`@5swt@7&UzPyzL1qCu0I3U1Xmm1|3(J!h58(5!DC?P&f7?=D0qWCh)O#{PM698s}c%fRNAgO
zVDD(W>6gIF5k0j86L{Ph^vDE0{gN#x=JQjM&VW)XcjwKtO^j|^m9Hl{GIH_;_1KSQ
zFzO^rBx2Sn0T)JQ^y_>?j3sDCni70N>28Wy9mzqIZ0B9NwybVVNem|40s}ZRr_4m{
zR_2;_WT}P03wgYzXsvb%RFC*B*N3mfBmD#xj>y*4%|HZJv0HpZ#ER@CbUw!=D1gch
zuQ7It)FM$LWiqkr*HzF+Ua8+Y$>>13_07+m`Jv1$L;UZqgBe)d)MmGAfbm&`^6nlK
zFX>m+%7``TyRfL@X`NLt+N+vJ4%<2s)fApvnMM}WUBq1IQx|!+s2b+%Tj1*omR28r
zxSaASz}-BEAi1059CYaFMvm;_BxTI9mF{EZJqbQz#;wOF{L?aV$Jm^%nEms4`
zBU<=cmhOLkzIhU@i{`dkVzBAf^KQ(zLos5ZkDxs3xRpAWy`s+pKYz@sdf1^UW=*A9
zCdZ@gxH|hQjjcAwLc)z|
z^NZLrQ^)b)HZ$*(eXhICMx2zC8&%U6zGYaR0p>u(Klpr>t-1W_oZ!#pW&E;&*_ZqHufDqqc?h-$lCPw-pI$3G0a~
zHH3@Xd4PCWQ`sm!Pdjp4E2j@<5h|T6U7@Gwo_74Mikp&~?irMyBq#o@VQz|10DU-l
ztH_cHQ@mKt>7jCR1xP4LAgr7lv-Z$P@N2l}flfr_V&q_DDh}zUL|Ic^D(AipKmEx1
zcNfkX``r3OTiB7)(`JE%{NxjM&(Z*C`pMEn8^LqwcN_{8rg9CVYODerBcu0vr{sJh
z^t~J?oHUdgl=v#A?6XS~pPb|Cd)WnvI}FvVm3)+5`dXT3-O#PiMEbJE70byZ-ug#m
z4at**H|yG-YaFBa;DfIOr;10DSR|%}M&f#>Fcv&py6
zy(W9tr|3^wh2d2_FMe1M5|w4HOBa*yk4Rg5>?^&yaX(^~pV;Z4-Q-Tsn|9DdP+*^x
z(~w<(a_@1tF0ozZ+wy|Y%zRABk)p&C)JNkCfhMDY#k3o01^Ko~_qeRwGW~*U2)$Ko
z{kKlVIEC-=Q%dyGXw)eT@us@7UU
z^XQnYJZ2M`auS@;ZK>VrJ)^I;Fdt-VT28N~Ccv*W`XonPBiT!QzOc!OBSW}W?K9x`
zftGarE!SSJNvAoZh3HZGLR&<(7GreJi;~4CqAaGabEAy+Yc)wzn4Kc6p^{Z;MAJWi
z%)ncPJ-Sm8+2j@9tsZ9OtUv2F$(jO2%?CyudM#8lVW6S^BOw8zZIb3vqEUgT2Aqy)!2?-#r>`&8$X^o3*%eE6
zYHTNTs&+~;Nj*+=yhvXN)N7vRB+LnySM8y$lr8H2gzB+f{Z)F26_`TZeFB!$AJ6^6
zDGgr*ht~~`J0?V7lJvW`h_>VD1e;T&CO};Ea!jDoCv&v58pKBz7qN!3bKnmtLFB=?
z>!M9~l`BvYkokG+Wj6)-p!`8-vl}=jGrBg4VQR4UMt=Xr3F&
zp0-g~kMxD#)gqH>j45yuw&lyKhHAN-zg-KoL7(CxY|H6Z?GaK*#nd&|w4Q!^X*N`L
z3s1d=aAwQLo9*IlLw@a2tjF-q+cBje)sanUjj>Ce5)C1)YmZ%%IU<}0?w+ROT2$f?
z0lUGMTNV%V*L0e6{K6vmW9Ep1?S(@4!fWj=y@(!glfYGm(Iq!dnDRV}l>~Lx!=G4`
z2Cqw~_VB4}VXl7($+s>u&zYj^1hs~0xY1}#U+^5-?wa(sg=9-zANV`w7@#*mabJ4NOJj{!lBdz&QD0K3R^!LG>}QD$2Oy}3Fs2$Dm)Hdha6E;TU8UxXB_6kL!x@tmqFdz
zg~9d`BlZGZi1>{%iS;YJoXLNE6tzCXrFJOADFf#3#H8a{$XxIQmL}SYfg;f|E;@=5
z7&c#bNf9?rFLNKj_LI5biu`#`+61Ogc&3aNbU)o%@v8Hxg#@_1DHY$I8WhZ{Mm{om
zx5OWna)#?>#_;})0c{X)vz9AT?yWaR%;zs-_j=v+
z`neSHuW?4SE+3hW`QJIca2%iPQ6LXtQ3Lawq!eCkTMCkuZ^?h1&u`+gvXH$h?XVD343f)dafI-Phdct`hPAcJNa<3d70DUyOp
zkC?+b<%eaISQKcd!ZP~MNA}n*Pm9`d6YOBeX4SAJ=?3-nmY3kun6_8Z)Y07d%KR08?7IMDYnioI-32H*!P&JTQkRf0QN`GI@eOwb*B(^T
z+&HP}*5_2CQ36)cG%{s2c*C=})f9Jv%icpZ!dy1RbK`8tbj%r9w?t!}diDDVJ-vnG
zNK;8|p6bSzfgX5@v1C=&Y4&Hf<&WO#TOA5+rIUjJPhd0%a~B`1pHD4JaI%x9?SEz3
z979g8FvvSF8hFI=WxwYwF==pKe9U9JlFPx`AxS@)qck)AGC39^04?GY>u7Aerl|;e
z72<-~VBr3Ps0hXb!|`X!iJG&o+f2=7c2CmB@K>8p$d}hs>r!#6S8C>gh-yofSLq4d
zic76a#;pQKs|l;B{gRArMOgiwDWm?qMQTY?Gm%?V3n*_1Czl`325)(C%w?{G=Opk<
zSFhYA<|+rkG%gb`RV`y})j`l%6dzB$TQ1hv#x1b3?_@mY2u9sQwK)F
znafcuQ_ixbn4|sfq7%;F^qM96seyZmct7HHJJyw=(;rYU;w8v6%uS~?z%5xFr%8z)
zc*asxDQD5;{rbim!D1i$^C9>*qv-rq{LKWO!Y}ZI(q$K<$4pf?_!yh5k0uzRNyeFT
zOkxAeW85h5G4wlQ6G~wK{A}DGlO)9ttS6mTq+#LjM6G02^6|S&vEHO`^{}`$kakF#
z|AT`^tjiw{ObYZkhl!_{Uzn)F*E0c=RWa6n^0KJyE6Q9)i}1`I^}iz=9An~fBPwMD
z`2q2Clfk+9=7&)iXeQTaO&
zJ#Vfo>k&)nJAh>d&q$HeVF-KC8BIxC?*WmP=+
zz8}v&Ax0i*@+uyc>5t!sJyuOeW6lIUXxjpwnEXK57aG<+9-z^!LQH2LAvokaRCW>T
z6=@9ZVbiT=mL{v3%jm)hZJG=tGhkrTGJ}c}3~IEx0na?Pl7BYvxez*w87CQUxbGeS
z3M2E43!1ll6gI?(-)59mP_8$I$2(7tzgyd(W4V0Sfq})|1ij;4xt}s{ZlXT~gya1U
zj~nfUzCXAcos91|Eo)7xqxrswpUva2Mze963o%D`JLbeeT-WV>7V(@;2x(<1a>W~>
zTWVsB4Lm${5&hZ;ThSgIkG{tH>KKQUmw+qFgT4r{dBNE*n*5faW&Vo8CfuqB*CZ-#KG1)Kluo{AgLz3ZQydW4gZ+a9Ns~5
zQJ&J_@Z_xJTit}1PD6mkJVz0Oc0X!X>lr22g|zMmQ(zDv16+-LoTGtmiX(kEp-j^b
zhTo#*$N>tgTDA^H8@vQNl`lmYfABwQbv8KJojsVL@SO67Y114bgd}!Pu2-8`4bu&?
z{tD=%2tXhI-rouKbgq*FbdWCo?>MKrI00Xa4Xu|YISPg97~6bG+`Zm#*FR2iP6h|3
zJ?#6=!NLqB@2wTN42w2kdTQM?y7&1xnBn$`yluQOt(wDtZs}@e-{VFSNZ%QKbQ)j_
zkwqZ6s928=G%h
z0H`(21_t{Lp{-%6D#KQ!n)3E5xy%)0?Gh6wB;VoaW&nJ6j@+NjOaGAQjQ;5LG4)<{
zNH!#917{vn-6~__A5QqQX1bsAI{DdVa9U6>m|GyK4%!x*6GU#mem&tlNf#EE5Ndg>
z!rkO+=W2v+cY$gzW-MYn(PnMSJy%jy4-h(TO{$HXeUmG$v3G8+Iso(z9@kXc-|3Uh
z*XHT$WSa4n8t`{auhP`x!EO)4!1U4d#`3fy+*0=)j3!8n9eTCr>@=+C;?Ra~cpIQ!
zsE)j!LQ8DA-+}b-mq}lV>!uf
z!l70l%MX(evq8HPpfD_bXWY@gZ~<9%3ST-7)!Fmy>#K`7#+B9KXkBr0CiAV1@divs
z&c5LD(Sy;&c)Px=lHjNiQn=Ra3sAuHybl)1zWyfXpIRC6=lo{d@K<&YCY6!_I0Rk}
zL*=>6LTAsu2K!Pry^PlMqSC%)lq;WXbMhK~6SsBCjOUt-#tFVlLWq3#GGIG830oBs
zrb<(sy7P-drRU^yRH9|-NE=+3OH>G2s7^LUcl#*A1_Gx2Fb(4YfjctBoY!d1K{kFH
zg3Q%wg2jfICKf(TSk^)9=EDrD70dSTA2xNhVs%S_4Y5u0gKKRtaGYJ`MtVAOx0J11
z_7vlG80-7uf$hxnK(OgFS
zle1&XJsQ9C)s4sAh%&9OJ#;PSAQ_*lgO5WZhO~;h(kLG=(tyMfW>wryqAI)8*SC5I
ze$@S^24$o2R0XIuS;dy=ATxhdUH&e`-nJPK`v=7=T0)nF&fI&l~o
z>9jQ+rHgOe$?9VO-0(;OK`>}hljg5+W}gKZ8-MhI9!E2f&!W^5BY7c9fXw4_F8
zEM^D^SPHtVYtDSsrB9aMC|^NoO6*TKR*$;Gz_rk>lrbuPTsf`VG`1_h3{$m%xn^9{
zc64uBidU|w=!vu0kkK3wp*SO#sBTW7v*Oc`i1}JY-RV>9+Lf~$wcPN%jxVy#yMgvF
zsNFt&Bb7GGg5XA%=gxZG?=Jl*`on!&{;1V*OhHGVFy?L7OXefDnj@0b3CbRyZoh7!
zNkXmmW+#fe$w#rb&%F~(JKgq9sflb#mPJ=HQI8h}<9#%onykYEjqcBPzT~70!Z6!C
zC0ElfiX<#%fl|ZWFLWU~r}ftoy>o}MU_ayuRcj|~nrBGdKdCjLG0^Vzk*${nhES@=
z#)A~YV02ABu8?$isM1%|c->fNeffBUZ2FUkK_C%B2MD|oBjSDdO+cvH)aY$lmAQ1M
z);m{?K`>0GvjY0q|CCfsGmb%^23sUzaJT`ex@`M-pT1kbIyNxG*5I^H`ZYJuO#e+V
z4G@3RQ`C*c+zA0fYnPJA3n;nUKIbyJQSE_BK9j5dfLH0$X`@FVHXDgY(`=WX0lhdx*
zwMnly{cH01Kw-77z>s*oZ@PT!XLBx0vZv*)^E{*)J#VnI$6Zlf7wF?;b8R)vA|j3E
zP+o`(4&Vw8UU7B<=sfXJ)N0Yz``Q_yDasA=L|`$c2+9r9G@ubpKpoAu9
z0F7q(rI_C0v(KAG?;PT#CK*y`dB{~%pGqgj!z*GWbUVyDj+%HA4JSoO|IMQfwZW_x
zfq=WmM#Y4lTJ3^}ikj6|wc3ZMz93Dr@bdBy3#kYM<0R~I7zA!s$-m!#md0tn0$R$V
zN6H(nR-6H-Fw3c(G0nc*@HDJg+b8Hn6DBqRCwq`)UJjiOOfGP{4vs_3G1_LRMB|-6
zr;(q0ov8hh8uDBTP+bsf8g#kgZil@GNyY@2TGPS$RE33+97;Kj=2%`+dNi_HZKF--
zam6S=4{N-3vj{eEw4gjW0bz6T0H*>bd2HLuHXblzlkFvv8Dy^t%dN}K15uStsY(Nj
zgueC0+dB8Ef)BTPd0b^|U}V50hPn^UC0sIWjy?18^V0L;>}|cUMQiw^bcm{c=)9^m
z-RMdhm9S!ylpBtQnd_bd=IY=dv(Snqtm^$n?z2~s@2N!;3kpWOFz~v@DR4A{NtRVZofLQsha{r>}Ee#
zqw`+}wA#}qv{wcR0Yxy$UYob0DLiR3nj=rw4do2(%xbk0BAD)NiDl*FU!6SeI%JjA
zYFXC@0pn9xZipSmaK$X8w%BKKj-cS1QU_>(afc=*g^3b6oy*A{!!jUT_B{fI{_jc3
z4VT7xsiq`=5%~Ly$z_3NcUXNq19bD~LV!5`*!C`H8=!Dll>PJj_1Wd1GxamS&&aV8&20;N~3Op2e)m|ZI
zknd1$L4cgq+?O?;s^Nq8T|$EfS>&p?d}rsH#&l#+6&>$wCQ2kfxLjK~V5rYQCLx%H
z^JGRt1n{kSl(e_MV!9q%e&`piq2r*#0p}~wEgZXEn~A3v%Zi3S(@3RFq^a?0w-U6=
z{T-HPDpRKJ?InI81n|BX3j|9h42?R0L_nAj$M*a#m@icw1wvn422u#IIB6i_iA%J0kcL*NC2J71j*dB$vABhliI!h&qbnuVMsY
zf^4Fwn%l4t;Tl^J38Ee3Lt%J<%158t?;9||JgN1;iSu9#=HSs{6zCr-8Fh!7f}A1L
zQGy^#lh!y;C5%;~4-pUW!78chB-x2|U2XOG#dJGz4jGuly8S=M`xr;*mV|0Ut;q9U
z^Rx&+dvS`B!fQ~YT#-tRw81tE%eA@Vb9pewP@H%AIFWN{F}0yTY4DtY1*X=ACnWM3
zkp~9=8p#N9w6+s(4jm{ct0nv`W=Ay;pc5q1Q(-3&$B3$uT+8@zQjF3kE2{;Tt?JpV
z0`27sXj|UhwPLEMoClBw|+iBMgQU|~XdiG?YlStOhg
zMKN80iz_nMQ-avZQb>Kc(1TJ0+$bycP0iltIH!%tZ9N0mlxquZZy%%&m!KYjIBc+^
zR!~IU9z?nn;n<%cvY`-&diHIX3<9=A9v$cJ7YqUs8Z`_xHT<36&C500oj=cR@(Rl0
z6WVgc0+O#LJ3BI`XPbY^xr2lu_EQ~g3!%{kQ|S%(S%S!;32W2I=6>zE^nK~nW?;v?
z%}Cv@-kDinbbGx2qvI~U#QnKjYGPEYV+PmtvazTBBUTSYpQWbC#m<+$a}D5Kjyx@~w}@O*wP=fjsAuW)LR{NwHA&77|u>HGT#z|=#ul5i;UpDWP
zpq;lb!?Lu2jQ6zIEkj)MOeqrM~mR~
zlC*hC)GNAyqjNX*`!f}HNQjgqN1Q`*77jfpTMfq!DH{%4MdM8`3hcudDw2srE+UJ-
zq3;<6BcCcW(s3x1qsgs;IXki7edcH>yoxwQMWUeM2pMOIy98r9zv)(W0d5MUe
zf~@~&R{hpu){n@Vnk&GH&a{CoGKm6_-p^i3{H+9LcmUt2u}>$C$C&?^6fU#!L^k&)
zo0&*&55zVb=a!`Y+OzBGA-o3+O1Fg7pRnzyfHXaksD+qr8$Fq0GcG;{vP&uMbvMJ;
z`i?B|Id;-jI1;a=(;rJY7_W<)`~9a-?fX!^sQm+3G~}*Z{>f)9_+lG%s2C+DIOLIO
z1){gLylT{TnNwW&ar6|Ay|h0rEy5jOLbri
z!(be?lSGKZ30URfJKy^1z-0L03LuS~Q2L$A=Ymttu6uvt_dsOXT-!Ej(fjFI9?Vp;
zj)`o#ZWUNLYT)Kxa0|@Iica-Jz(oIoA;PWWj5Wjb9MZH9gkXsI1UoeIbxf8hEQZ~f
zoO4bkZv=NuY3Vx*kp|UxB@&F#nq(5O6zLAdsfU+70}mavBGp}}QhV~$xU<*V$XcRH
zot^coQd;~Zzt^lSwt08}SZl)kpEsEH6Z?-KXHwiZmPOnGxIt%Gdp3L7UO09LRCh*I
z0_OOH?Pvyw#Jz412#MKH%|5zOhhIIR8yJ_2$t8KaoZ7TlyRtd$KL#cCEGe7OOhNqS
zZX$5#MnJtOA$;VYetdSZ_J)WSE3)br?C!tzN3A?6iqu2e!{vbE9rM3XT3dYV9)nw{aSzUN0cOurYSuWy!cyhA;&DZDGBV?M1
zg1Nlw`AV5G(RVj6!E(vH>%Rfr9nY#Vu7G8w$K;#3eT~;pYBQCmg1q(v(MC165+i#Z!}b
zMwKy{j^*=!lfjV04ZJzr-Bh&7R9p=NqnLGw&E7JYx+)PB>y^t0R6W|Prf
zFH;oCqc#*^p6Q_P@|baad+<0}{42Qt*XFDCUm?+d*Nq13h6Kob|NH)df7w0o@1*B{
z3pnzx4ETR&g0m9+o18a5ADoToudTkeUQilR#<`NKFE%Ngy@(|8HutQbR6w
zogL}txkhcvk)alfl+P!jNK+2WU$vHztpYtZUpb^rN8?Suyj=6J{9yet;o2-@WLWum
z+wsWB{2A((VxiAy;*;Sy5t>V~17ZS!Exu^zuU1H*u^@UJwOlw(m
zkq8;Tsy95;hxg{aNt1UiB&jT_oXAM6~tcQrF3#GW5+Sa}#
zLhWOtJiaEixGTf)aMo#`qo_1^)na@10gOW>_{=X5Aad@k@l>
zmn)>Gb&6+NO+OTe?dofXD|@5W4tGL(2T)rVxJ7LkOgAaRl%0MGO$T-q<8?!0C9o|H
zp1OPmYWC?JFyoMW?NxzraEP|CT|^1Ai!Ls(?)O>VC?6AUrKi0%tL~qx-thXM*0SQX
zuz%n+d^c7mxb9YPf9ERMO<0Fx_kXv|eeMf+yD%U_*&)2D#Ij5nL^}DxULUX`c2@TY
z9y<;dOWvXyYk!xyxp6t!j2dhAwf6lF610PSmRTgxW3xch`q`RSQX%Ies`j>?9<`F4
zh~1vFN}8SldsEJsX)ZHC;?pc74T5`}UoC7Vny!~qJbfCjyzs3R9p?lDLY}%3b!;_C
zoa674v->i>l;ilQx{>2SNG$I8B2wr@(*0hgd#aZ&;=HNV27Jjr4o{!0VB=_5kzn1i
z1EoK3@P*Pw0{(azWRJgD>A3nTAKFMZv9%du=#!SEXer2XGik3x4|emA`ukI=WOQvr
z99gc}Z8v@qt$Y`epns7JoC=}h^?B&GzHwhTnYk=|HFqel_q~&-@yic4OAoFw^%@-H
z@SU`tZcnfK=)x%GPq9-Wl-(>aa4h*U?YAo;OirOy$O&*wMpH=e;@gQ+yxrOT`Mki6
zn8fvLCF9pDYt+0md_LylWTP8r;WN4NdcR9MQ7NDLRV8b8K}<`8GG#Mie*8y0F?q%)
zTc29s8Uj?-W#`UDXk~Gtfjquj{%-x?Fa&&UG57AkrRcWeMpQg=9$GRljIJnt4ZhmD
z--ZXxV&21+hrosE<>kU`-g+5_oDVyFbXHay-p*Y;LMK5{C~_R;KGv@-*L`L0QqhP*
zq@lN_CKyqdHIJG}4{m#%
z)bX9Rs(0k+Vt@n$jP<5_#~<3BPxs=qum2TQ`*#}-E>;$Rir~Kq;QotE^?xf;jrm_m
zH2}8uPipNi*7bizr~Q*^`@cY^0enmTg--hyUxoiIo%Yvl7pUn6)bs;t`T;flfSP_l
zO+TQfA5hZ|sObmP^aE=80X6-Antnh{KcJ=`P}2{n=?B#G18VvKHT{5^en3q>pr#*C
z(+{ZW2h{WfYWe{+{eYT&KutfOrXNt#?>}q$6>6-@<1!)nY}Yt$uZ7tzwN%m*7osSR
zf2L7uA*?L~nM7&|%;;>k<*&U(A+kavaYa67L
zPpK{E%M+8q;Po(nOV?hY4n`KcvNDL`4q?p4vL536nx_>l%2>XzDyq1Qgwn4rWf70~
zgDn_YBw6jrqn64BiZn6;H_AJ=lo&2pt0=#L)yQxPB%+s=8w(Y*7>|*pr~FTG0Tc;Y
zB+3elWP=B0Zr2|2etOOL9kx>R=%Fz``LR~!dgwXl8!mxF2
zOu9EDJu*&nX!FI$NILr{6*P))lYw$KC5DrvSOJzs&VI9qd!$
zgx1|NvR#*LA^ikc1&D79qmJ!*i*n%G&-@*Q>00G}{IVK7l8S^m;23DbTcRE?s~3p9h5q?0=HvIe3@~
zW4E=`cCO^akn;R?qv{I%{H5LkZuRSI!?68pR26&W;~)X38X6r=mBjsCoU7IDr`ayf
z47Xo9%{vj_b>c-0@atJVKZ3-vIGoh^jHPIH77awnMr@*`EvKYLGP3X8pFjpVeHW;)
zw_nXaclY6k<|6Br$Z6~G39^LJfYdj@e`)+3+|&H@m+t@dgt_D
zUMUr85O4A)O$_=o2yt3X@UjW9MpphT00QypE!#rjzw%mtS)jiTt6WT60I92gs6rjD$sfrXuS%wUIkjO{;Tz>i-t~xUJJ7CcDFHKGx&8uhd41<
z`o5wvBkQvup)^7C6s)cW{DXS(v9Nz;c
z+TFvV3C=sLT(0)rSxxUWw~OLEx4JEo;Qkgi+N{m2j48(l-(43oPjS`TE7iWbm;DGV
zcDY7L@CFnHv~2$rp+HQC4|)1skUvx6bsR$+6n6IA=TB);b-`BeQe2yfPl|Yy#itIf
zAQL8m^><(Tw`}*Y3F`9>RYm{%O>1sbd97_Z@(&R2e-xI@fbPHFsm8u_pq1*LZ-$NN
zHgw6D1f$k3;WIB)UKhvL?Am)`{o_!WrxsASP+3FUsMxISH5bS6>TWeq3$rgJlzp)+
z2hwo`sTZ32s7FJc?O4wck8SD00ngZ@g&W?jA|ehb$4OHMo5r~_|6qVOy?lcjn`rEk
zDG2;H=tvp)dk9W_X!UI=?&1Ern2G%(Ta}FMqTxxU^MzJ0p1|mBzdvis(P^au16D65-UfZYIVEgx6TiTo#TG*pwFjI
z@czV2`0?)Y#|;|tBS@YTYag1xBS4^4m!QpnHZB?>mf_cvo9FWrMr=yAZdV8IpZ({%
z@i2|p?XH35ny#0Z!~GD{EV;#+)F>Sk`!?@47f%l_H#v2L3f=oi
zE0G>QXFgUijxZ!Db@Lrx=P&O{N)WGO2?cz-@9#SV1m0YJlO}EKH(^W&RXV>OZobA2
zV|IRIQ2P9?=S@G%$w=AYZGOo1JYfmhTkYy55cu<)qwvAE^>ICUxg2}_OUA&@+P`pO{Y=%oikD+FN(&r
zb#jYRdLaZ6->@<(olvUouAiwycT6M7^D(21j}L7FZuvGc3{;s=GV96b57enG70v5z
z&2N{7{fCdjhEr5*@ci&|@eU+ZaDi0)j}pj4o+LDIX`j%`tT<(76u*o1aMXT!%bKPV
z#v!Is#`ch?p!qZ_M*>ALa(7TZ5ddB*GO@#P-X4`T=qC{~$Q(R#0*z&=i8R#tISswn
z?HGB)NNbpBS&4&;4fJ!eC95CJk%||Eqy>8BmT24}9GT;ij&{x#wN(r3dsIDzyQAIu
zyzeutY{gj)5%Ev@-aAMf-TB&;*9-{z->uVBvPr#cq2Pr)j^0Q3uIWQc0#yy1*f=6z
zdKExZT*0y{0xN5FFE*+^{Rv#t+DBWFp@VDwy!6N&TiZGzv*uD?c9XGEB5k7?HxPzY
z$drRI#;^l5+CF?*?Ia%Lwc>Ed*wc6sD};8o^Ip$|Uu-_;6g>@=467)0)@MKc{f^ti
zx%BdTjpeen049Ck=4QdOk;HkHB`Zo0zuuPQ81&Rh`{zT>G5DjIm{b1&h<-AN<#M6>
zCR0LPMTJ0i{EetBA(m()N%Wp?b`t0YvjYfA)@D&(@fXL=B$n=r#QHkDm)VZzAJCQp
zHHJ|p3N6kTp6UZrj_>1zzJ3~tIi1Y=!j`1YX4f-)7ae{X?gI{2GmhFN!qOuRN+O>Q
z3d8s5lmkTEuoE5Hg$$uQn&yMo7ei5UQPG2Dt~|evt5(!c)*$e7pGD`-C
zVH4_a$YKXg<`5E~0(RI4AZ6X{*H~Vnj(-lD*TF#|@#nUzak)*Cnv!HH2f4(w3rN>U
zsLto5XFE>E8QVRJkF}f=EVQh@DH*q3iB;Ha>%KvDEs!QIgDMN%SR3Kfa(ZQWZ9C2<
zkW}Dif=pi{h+C3S!)VPUr0U{(uLo02RIeGp<#XntYiN=uB~F5C+2jOZO~sqfP?*m)
zf)DsWQt_2en8|iWutA7%U1k``yB(B=Y&d-4|ISTNr!wT&eb}V&AB<(I!p0!`NO8%%p-QM4_~2vH9kAu
zn#ZdWM9b1s9HtGNB%Z^TmP~ySMayj?hngzHdA*7mRZJwGn$a{718sr5bK_wlI85qg
zBPI&ekuFy;TiNBJ)f9$|pf;Hm!XmF(<}}vVBc@@I8CJOuM1as@G~CCYIDdAZ8_
z%7%@D1Sq;c8{f3zim^9DRO5b{Nlr?mB5{LM!AFy8)mRmep*L(;mRHddVU-&dd9&wn
z>M)b$h4+*b?PyK$#LbWe9uzIj#G&$oEhb1_KB~YRUMpZnc#ia0a1h?LG>_|8FfM(=y0G-^UhIY-Vq_aZY~x9
zD>hDPDZ!_vDyN0~t{5Yzx~M{TY0(|C6mcLGH32f;rb8hf9k;cJ1jY%2sCH^RoVl&Y
zDJ%kH4BPy>6WV9aC^~T$PnT-Loi6F(BQGYw026P8J#gW
z(^;7TpWMqhfKR&D%s9D#hMqjx#7uBuBDEf^9jrZCivSS_^*brp^HOznf%@z(opeKPz_*e|wwG;yGe)Hp;{|2;!u(Pk}}pAyiDDFj@p;;-!PA
zqdYUq1!RHuNoJ3{_+X4Y#r3PitD}FP3?P4*0+kaq3eqq5Davdg^)HzNl^~7n(VW|z
zKEkKJ1jl*{gqQqV)_G6fq;+us?RfA~7B~rnNCU^WACX7Kj=ahBm`bAhHs+3GH}lE6
zNO3O}uQ7QNV8aIXlpPS59sF8`&;g103K+vSPB9IFVlM7m979$`C$2tqzc14GW#sSZ
zWbD33!!7@`gul$F_~=RTGQHClq=C|>uQUOda8S8c*f^nD5ikizrK#w7;)fLlsrs8P
zPQFyN_R*9b(A8Ez0%n(WCF^I40LwK{V~c<)>qs6SVL-MZDgk4+NIf?lMG)l!(vIA
zU)H)AU{buA1vLmN`_5$LJ0U6wJtY&fjcet~3$BNHsfDmjsp;QX~zpN!A@jc{SwWfl+$$GMBC)^3ZHwt__dP
zj4nQ{T@IOcpXw3@8ylC$Ruzh+ZTkK;+GtBI_{ieOz+-@7HS)#l%o-2bb5w>bC{rgr
zM`$l@kID3L$4ZPJ0$sBm!E9!bc$9^u&$FT!q}r7qLMyIF><^e;bOikHv56tQq0BuJ
z1nk)DGCmAMZk}>`K}*5KZ2L+Wz5pZZliMT+9I~^ExvZtvkST4on+TW-hMnnI|9raL
zW^3~q57%4>h=jPm#XXO9F*1Z12o_GqH;x+R=`zDb*9Wf3if`1s&fZ__vdxF=y(U#Y
zo7j1fC#xdASFU?ofq%KqAtlC+GFYSf8iT7`<4T(`c52ND(ueeB;^A1J@rjg@Cf8!9
zCFPUZlK=#qis?Ga8xJ@r+7J$cg2b95D@=e|vzpYkKq&0bHiO6kY?TQjm!@w;cE)vn
ztyXBUj-<`yD#kuHr!nf~8WsA@(qJy!7UJIpsg{lm7$Ju%T9{<^!U*=14#<^EyV`R^
z`+h7tVKsM~-bL-lIPBF-FMmlYkQ|Y+55mE3MrdF7U7$52%#54Q64d-&3HS5*{m8U;
zWJgViD@kqXNJbiFIi*qjLGFogU@o?k+wZj~%r;LY7bkq{bQW0psUkG#;ps25?`VD=mzv18q7Cmwi4S&z^UqD1EUrpY;#myk
z(}H)Bk;K9Zd{6I23YC=OYa^%meCV!k-^blre%#(cJcEY2^?AuRt90pU$Bk?($TKI;
z#yxM7wl1?+)skx+4cPcOK
z%4fJ|&AyI1hfW$X6bt%m+Kau_6%TX%fRJ-p}qwg%hv{
z?k*I>%C|=xOqUNRy-*b+|4n`R^GwzmWA*1NB<=hce!|Q&drL$o5tH#5YVc5JouT8P
z`xb{*Yx5OueVSqDQ++2}m|)`4jSNM;AQ-Fl9te?IA}ncs11dASk3hU79~mA2i-qgF
zzGea){UG@OM$?=~onUF#RWzvn!rr|wM&%8w0iHuA?-}f_B9Seth^%M_3!PtxWQXCh
zQOA;10eEL<&t$pg2!xaT^y7(w*o3;DY=<*MGiQAcv6-`U;ChvvVFtd~^+c8?8qR0a
zlX1SuwA4xtn#-}7>JM@=!ev;_*Zc2ILF|Qz%YRBf4IRsD#TA18n>)5MjXoO_4U{Ap
zcau&uOP^;3dJE3}_D8OH7dmU%<>9>P%N=_(vD~KT&vk*ZrswM>SGq=(@sp^qj!}T{
zm^ijd#|Zxtr7%j(2+u*VSc+0Y8J;>KcGqEK9dn!9mpbRJfodU^e_?Z*VNh$A@?FnPJY7AHXu6bVT>MMxwmPTgz>CL
zENGI|Y+=B7f(^!R3+4;A+uDx}%|=pIf{RrIz4I3GIYb3hIQ;BDZv&iLs&SXqeN?fm
za&=b*uUFEB)@PRD1k_H-R7&TcZEckJ>R
zUM@#m**RF`lcaiwR&R#5)jU@S4KCd4m(`ba^B79DSxArsXAz!MG&=ZX&Jq3cc6Sna
z^PN3u{%NDwWGyHEx`RNvp1Bfj*YsEjaapsxwsdH6@*6HMm^&vdlv6crYSd(k@Ih9<ap)kNiMt?tVF2eNM^*eT?eX=J_%F4g!bWm3KJjW=y#kg?PYAxHAw(Iv3v$xE$*MXV?@stg|+4z1}$E*0mVtm6j;#^jIUGWkqW;JT
z7LsEuRE$}ojajNX$v6PW7{9?KDtwr~c#e({X}p+Opuw<~Xkp>7niMt#1(Vc$96?LShqfi(ffg^Zw|2=@ZoP(5;2ZW9dU?VL>!^V1!xBMWUrdPscCX
z_|MY`Q@+m`l8CO4g?e31{2}3%C9|cxBq`Wqn+gAY)oLZx_<_aRIF7dbr~4}r!YXF2
z-$mS>M`m#Hl|^1Od*XDr5&L-&3P_r`$a6O5JnF
zGja&j#{K@Xayu=TbfmO-W#Mr*PI^Kg9g?22`TYHm#pSb)JeD|SbTm$&3(mRoWLPp>
zEux)P;TA&Sr|RYy{s=?&?t(b_d<*ow7O#iT9K%h73}vg1-Uyk4f)$#86-W4$QfD`q
zU~j3~-xY`T{ULHCUU5&I_#-896hRe|{b8Chx^Hg$CseQcB{3US+;>B)z2rDXMmid5
zA3`{4+Hdv|?f!VlVHqx$x@@ICn^A44u2yacW}b$jZN543WO#WJ2KYts%v^(O{-Uez
ztep>9Ay$PSRPXEV_~7e87_E5Toar)vYrk*+ES1^W
z^Qr*H+E{2p*&?kg1t~PoiZQ&)W@*Hd!@hiTJArh5i#_(rY|ER^{IQyPcj0J66&l9|
z&zyFeO+^!7Hi}s4HX#$(uXGhkBl(DME-_F$^LC?}^9j7>TWzxMg>{X%LL$~!JC!JW
z9<@8x(WDGrpvg*)H-ZrTR;PP#w~#N5J~Pb1w>cVh>pr@?aBIiJEP|dYHq~d3i%9H4vwQst?vE3z6A0N>`dRYeJ}Wq4+Gs@Vwp6L7OAbElRlP1!&|#
z1gqBwy&udXBT|he1IWi4N?j?%*YTq7^G}tkJUKNBG6m(Wv-qr<57uzO?IKH=gT^98
zHwhR~l`6jZI{6shB1K42M+G);@triF3O9O@Hl4BRgyyMWQeI5)wI+l3Fk%lK7iNlU
zimmMNildsFeO1!m5_|3E`}THTV=%Uw&Mo9#pRXP?_6eH9-+Hn*)u@A52mTyyFVvWEBc9hx
zNsW}JzJjdGODrb$_=mBxJp3xWAvt~+ok0;rkxo@RflV0&_4w3B69M_Hf9h85VZP+Z
zEj)Prk7ffUS?BTgBTWn2(kn2q23d*Q1^c-RrXRl~S!TlX+He=k#VEV+XRQuz$H^iP
ztl(;y337@#E3m_o&F+q|{o9%dQdu;u`VW(@5YQ6Sk-lrmi5*)!!eb+hn00xH_kU>@7^x{{t6eNi=9s}*`=35
z39W7X=gjun@hQv4WBiJrXFFKaald>g#WtJQU9=SUmRO}UT6_&R9$1~G7GmyF1f_o&
z0z4ntrO&yt&gM9&3mH{{cz{~rTV{eKXXPMQF;>EQnQWp_yO%1W^ygNf%O*w)zBsDr
zU>Fs#bh`whyoM-n;>=Q)ZV^Z&_#+(4LTYe$Qt&W;tu?ZoP!^##->YlN5GB9gnUE!0
znLla8!q{tSHQA4p{j<7%nu66_m9_2y7Uvpnr>Emsel9D~Xfd-i4Ri8yijp*nmO0}`
zKMn0Z1$oH1oHoAC{R3eH`Ih1+IBckJ^G!@rgnre*Vt59)scYER=mv5Q(hytA-_wE>
zU~7M$kLC=-_X9-Aj8|AWvAM%TOscROdn#Ek!L)D5&}8BAO;IwM)rYcGaXsp>{?IZQ
z4eUIm+zK;!Sequ?lIml7YUYq~jN<5mpH`j21Qm=TZeUKh^2EI0b95hi6)q&J4BANJU!-iYYE;(4uzcJD^R{@brCoHk)e;+P2q?*tt#70kW>(=N
z>L!nh+*#6S&o7(8aW6Yk^7gQ4jrADw^m%mg7|t5Ot@?jxIKZKhuwO@JpA=E=OdQ&m
z=esf&%Hf^%DBYHTKEdp{(VPueKczp2LYp7AM~K2z(@G#XjJ2*(Hx4p2#&I%~58kvD
zgdN@XL>Y0~C|6=1s+G5Z`_fc)+o80@ZL+W*NOqr;B8YIyiNR9``@`Zf{g`LYhQH@P
zz+;=g6!)_dDbveIC3;0uC6J?1B8Df$NNdgn56N5W5Xr5x9VQD?!#jQaD)FkH-YpR$
zwEm#G;QXE>RT9ft=03kMb)Z?
zkPX&Kmh#CU9Us{MOxn+Bwzl970gh`V?sUW4EQbp`QV7S9{!}=!PznAOL7x7%bg#Nd
zTYYl|_Mcmt!esngR^hdB;zkX%nRAW&?g+x86qTULl1gePQ+kK0G!-J8d>nZZT`%ww
zK~%=}YBW}CT;XoJOv8C}5q&}t&sZ$LE3mP`JzB`estsSQJ=dSuJN(rpR@#N@>%{T_
zMx3`N(n-n5_>sLR?#8^Nuvs)@=q$ElSLHlsMH{~wsxc1ws2yE`#$5*&($$098|r)o
z(z2zX72h7#(y8_LtZwkrRC0B9JtJbHq3Q{-;oTi!RKYnWW=cnuJK!m5UGM|Py{5lI
z#NP0MN7^LC#?wVtiFt$jV4RlnKsJ@U@-aFH!q{JS8CZEMw+qHziM-W%kPvp
z!epK-gs9{?N@}@
zF~nK||5;}r`GZHC<$tD$c{+^U32H}mMdR)pXbDp8&x_+)5}@3fEPT2;=;>D@6TP8%
zOfv9IsS(3V_9%;GLw_bj1NpwkL>Uq5NAa*%j|}ASW&1`Lt*^Dop{1gU9if%XYcmDO
z$PsaWz0!Hp0{OZ8+uYQNqyW@@bFzQeOHyjrD{)D9oA=G)YTHAE9Fq75w|5l@;v6Z92|ITO#g3fmFpM{$-QZFX?B
z(jHz;p_GjoS`64sn)OXhYcO>tD6!ijBX!tYxQ4jQ((#B~J%q+@!#PDNz`zi;en~xd
z%g?`bf_X5!!)_0Sz4R7d$^_j{#EaPjD-rBYP|5X0!5unBD-rYrWC(s9ni9dz3TK!f
zs5s+e)QTb&9Arc687WNQs(#|4)jHch;ZUb{(5O(X1rXt#MyM5o*RkBkIyfNY13>8H
z13;&AuZn53DMi)>;^FapiUmQOc+ekBG``7s<%2bR-4rE(SWe>a9Yn5Iv5Yd&BzDqO
zjoSS>j4-($fZ6Z3RH(@^wvR@YKKvYEZLqM`*mPeR&bHn|?FjdSUxM|L*m@^=7nJfV
zOfV=nZlTFej}ptKJzTp`S(ZY$(SERsCoA!khq0ouR3_-()KGBZUCcwlRkyr~C3z#3*w1GvfNtnJ9x$v6h>-UvHaWWw`
zZ>P|`Ru^j6+>&te{d@jyhG~Ah-`9qcFCB-O3++t87OW5qoFG)POzk;k#=O#VzJHwS
zgcN0>v9t#KAP?s8UH8}yR!wo
z)SB4Zy(*QleF;_Qh_@Kud_zOByOi;HMtS_2a=r;0p%=%yLRTFX2XQ7ZK9BqZftI#(%idxglvE1BWx|TP9B?cS(p7x;$8Elg_a!#%WqfY@cpHN)gtf&(Cl4`iPjdu?Bg{S7?S^{%!Vufvi
zm#wxEzGfhSrf<4EIz#;-;yMYQjgdNfrs&{o#s=4{|Fpb%W%sQgg}p!nN}Qdh=bx*K
zAFCf&jH>aAMiK9T84F_uA4VCs6fh)YcaPr+%rEnv!T}X^cud1|Bj&3O|
z
zLf87>nr8s7Xp3GBQ_=N0e~@1w=X!zrGh>U+Cy({GoLC2GT&;E+qd*`ObPwS687U;T
zJJgLy%Dw73qS`tqO%jj7nDL~y?s6GcQ$pE&gIdpMr?}S@u?vM-X&b
znuqIQ`WW^@!CA;JsGMQc=~`66Q=<_ofmXp;N(VtD%
z1d!Pk_xhw{3%(52dq@Z=>>@>zj|X)0rVXO^)rF?Ca{eqS9c9AjnkkR;N$nG1Tp6Gs
zf7c%pvCZj?VW5B4A7BW}N$UmF`{tBig7>KgeBcxuy)%{c?lt#zvFPT}jOE7UpxQc)
zn0)VEGUgb1Plp_og6H97E?-0`
zS2;?YZG`8@MLwYGdW`78ahu!+XMW4RXgO*gCMOF_QRRdcPty+*+i5?Xd3Pxbm#HUl
z)|23+3m9?@WSR1QbA1lPJFQS=s8#X3%P6S&D&)ka+%z(X8>n-z++#?qR)<2V2MmO+fjo2zkkZ3Dh%-L-{
zk2*&&SRRL5%V7nbI-I!^NDIndew
zUD)X6-Aq2Xs+|?im6{qfu=L@b*V`|!k^2YogyC;1&Vf7F{g~tX1aO(=7Ux}xZKxa=8s5YV{VB*jY9%O)Y
z#>BW`cY)xj_$Am$Bhxs2IcWau>=?pCbMU+pNVNc#l%6Zwjm|_S{hlNd??6L|tL%G(
zUXo&qP;sUiv00O}Z^30w4IU)m0OR?abg>vM>c1)B-2doe1@B;eMLAHy!sUX5o&&D}
z@K>Ye{~@@UCGo}lpk@4v!d=ALFC+=aJ4pmyk4?IDM(TzrH>CB1gl`o?DYa|wOq+e(k8x6^Z?4>?CWgJ
zX|yAcV_7afn;AcbAYWa59pOK)WHEnAwrPRmX@uzy6
zik>a}{{u$%Ga^}JBKGD4<^LjM-a=gY$mIM?V2mu5wjVq)2F>P2G6DC3Y`kg9m+X_^
zFA=m@sj2&X|NnvUm^x=Pn7@c#sALMEAq%vtX$vvMq{CGjKo%1-k3yKkiY(b+1X$lq
z-n-RG{0|obi9!yKajPxG?Qrw_n44gkx=Y4oWiCH?yA3hz0y@anUR1@L`2fd=<&PIX
zu(xOaD}~080gu}$1VQ^J@lm4g>`q>bLSUPFK_M@VTSVQHK94GmncR@El#lp+ttBR6h?m2K^+Gf-@h8Q7DAU&H4LL?4yU-$Mz%6BDvrry~#BVb;_kG6bbb|BKMG^
zP>!KdG9>9ULD*-L|DmGifhL=D2UdLyna)WxUBn?0j~CG(L6_N&^<8lkF7FW&Gn~dM
zD}MFG2&O4B0wtGTpvZgwPI*^Q)k2^mS$0ljdaY83@t+=-)IhulwPfZ^zKWdplcG8~
zx>p$sXUmAGZXkg2`^2In$@!PBQE(n?49dRdHokKNejsJVdW}QLax!NLkIQIOC4w4j
ztZ|P{hZ$B3Mi{z7zvH<{Do;%fU1?}bGZkeG`HYb;bk9i2MNDFBg-60dE6?NJH0|u?
z&wXqHC1O)}#?1Lv)h5ncC{9KQ<_Tsq4)}$^VDQEFei7YJ3Wj7mW>{gsPh_sL{ENV<
z?(=!3|B64CszFZ80#G@KsN}xH$4*Q
zohcn{3RdxzU<+jE&W<&`cnqdaEiCs2*-?@_g)#mJY69|(uo6A(XZvd-bhW$ycO|TP
zz8o@V$9Z9taLNCcB%C9cICK@;jJ<;PW*Kb!NA$)(h^2RTK?bLnmC%@`R~fMm!r;#y
z3g7qQr!r!J;bGM~>%k;^FNcP}s;jPUn@GfP)+HKCYwk*ViW_W%YpeHZss>ks;Y;<>
zJO9Pwq}2||ITw5?A?c#ES;3W)U7topD
zU0!P*X5d-qBJxaCb72Ux*qA2lcid_%J%6ZH|K`M-)f=>6vZ0s%MF+85oVs!z<-T4u
z()CH^{^Q-68&Bb#&izCSho5LM95F)TM5IXXzYiiR^)h1jHoWH&?oY->_Xit!%gAid
z^RqsD=i*P5iz72=Xrlb$5grE}w1NG)_GMNnC~%*a?M0%b+flJ}UC2`v-oIpRz@S58
z+2?KiK76RNf$zq(z-}y?74{r62vI=l7a-SmkWh;7M1!g
zWN&1%RDFuD?d^cWs)lY=F;a9FA>K1%f_+V0N8HEuCh3@}_n&8NQcaD`jyB
zmR4gJ>=!aH5tpV1;MKLrzx+_45(YfdvP?~0A9`n4_JT+1A1;gTV$pG)6iqdCY_U_;
zit{BDMRnK*>BP(UjWjn0r(L4Yya!Ah&T^;#hcTNfR5Az7i7myz
zMIr119e@$k-faat@P3K6DBb7joO<-LtV5Ek3KU)mmE7<~%Akxs*yxZQ3>uVQM@IwfN)&S2}_KbATkz(
z%6yZS9P^hf+J+0zOw!-k1J$p6@dd9?#RfK7^`-(ee=1UH9Jnm6sKm3J#ou{Z{q4s4
z{pWLZV!lj%kEe>GJCe{02WGlIkvKIE
zydBEMEYxX|%@5dgHX6J3$)x_G$A_wLY^+u%3kjZjQ2{zfMziIBYOLtwoe7
zx2~WPO4yj$Ettof6$M
z_e5hMwB!(bToUyXaZEcMT{SP05N|~{NxiRbD~jgQ-^JZ87@AfEa#fr&>r)M@J!df|
z>!(Xl0wZ^!)>ZL9HOr=xYe!&&_xe_HOoW@?=}6%uih9X0B@DF9E~9Shb!SXxE}+F0I6Yg_r&G3ijwT5Yb#
zu@!{$s8a@~eec+p1ofEH^x<(e&v`rP>yOdM1P|#sQ#F4AyE0L3#Bl3dBB|os{R=+YSvcO7N=aVPA>qY(d7o#7
zC$WUu^4b8_sx77pL*djSE
z0!G=N%&qsFakSb|A)S&pHUg@6+D--pbM5Q^ykc^#H@j!pG)vTPY0zy
zeQ#UPR;-m@bSItDJALkftu4oKH
zZ{89QV-p-kT6v{OvX};^eNuBs~0Fxl!USl|X5@&?O
z=zAYCihG3HI`a)=zLOs!lJX>1jfZeV0L8F{hzS-yd9l>w>#ZGe(VxrXu)vrF6M`U&
z9?-iqb!l`iVFgoZEmetLpgBU)F+*{kqb=3S4hiIxs;S>0+{*rvJM&Ppk4AyEUU`f2
z`MG_z?Bd4@!IActo?KRld7(NTC6k|ss-|jk6Iim?uNXCB0vt$r<9Bb#$+;(@+&8a$
zVEPqw#?PupECpiT*`#_~Dt`anq?+#TkjUpx@$iI&-vBZD1F+41f`Q*yzb++(->3ml
z3TCBRMVqc*iu-f3pC|aztK1(YMwuG8f!f&|sQzgmZsN*>t2OTsP
z{u?wKVV~$=5x{Zxj4Pzr+^L&N<#-(VY}5x{KU>Afh$%AG0ey;(v4#GI8a-AJ9W4oi
zG80+5fVCI=bhU{9T~PhJiIEf9U5tyd4I1LX$1Po`7o$BIu(?kCZ~?yfPKcQbfMu52
zd_sJ!I`(Ai07>9Jwc}G9!cI>KN72jAV~uC|hcwGuQ}-5u&k<#>P+Y`7Qr0Sc8Quj}
zt^m(p_4?>m?rny@D!DK%fRIuqnz_Y2Q*?L7=wYoO;!ijS%=%a~TMgXF_qj%p3nkgz
zINVNzTJS=gTbHu#13jAeiZU;b`ZuOwnh=kldppSB{A}qFx&VCXPernIsfNz1gD<$t
zLY3BnbKKWf6%`u-Ycx<1do&f-UP5t^7H*;}iwC-7
z#6P641o?1o(k*QZRjJkzc+wJ4V#?ha5dn210ziBmWu%Ms-8YZ_)e9Vcc9b0*N_uJ?
z7GzxKpn&mg%`kwZT2>aza;0uRPp|Rw7N40MfpxwnoqAC48_%;yZ!jC;Dnq`G7Ga%j
zGW~}Qi$83@D7N3+LDktvo#`7uw^*Uo%H;uc;F6I^1WS&W67;{Ftw2${v5A@3+UKe+
zDHAJm9su$G9xUlg))5uxaZoknjRSGL3T0tM(Bkw=VE>Kt9~Lr=$PVied{Q}88OGX1
zSjw2tQ(1J@o1r_`Rf;MPwFxv}=)ZI9Y=xIzSXGvP+2o0tBNoqFF6WutH$H=Y__~hY
z9*xmbR(19u;QfVai9uMf9ARZgI6GTTiaLA{aVA+>sICVu*6EZ16WI=Y^Pa%3d)|QU
zRJ0LpEwN17dt8&9-jX=;
zX_l}gnacNu^^?S-Y(mIDP{-Q+zF3-YYpWn=Isd)`wyx}O<*i0oouo2yI0{PodntmR
zAPyO1X8q7&6(>xq5Bw&QRUw=*J$zm@iCp6iCX;@6ClUa`rt2p;KI5h^IU4Z_!4Z9c
z?*d6fRUN6>w-g2_qlBm7KS-xuoIGr_vdO-W-Z=3$SeQU~7m2sTLsK_Yybg@$Z5qjx
z!hdLw=M&>gBl-Fea3^YX$bz^c^U<&!`ch3_QBU^}5^K6v<5Rg~9Wxx(%c^W2^4t&k
zTjI=2IpYo;Vm=D=tmxuLpwX}4FcEctF~-;XqBz7YupNYpMvjTPJ_0fhXZy=ji^7Y>
znrS9LhAg^phQlT4{b%s^wdL80^HW!-+0NMIlpExzJj^04GS
z;zrLJ%*VK
zj%inKH57s$Ql7yhh2{l^-1?-EW@YwYNPPYJ<8VrdO$2%P$@Z$SZKa}LEA_htR__~M
z&(;y3=8%2Jvp4}eq)9d%DWXN;picGdFERlgK~zBaVY0YhN@^A+`1s!_aZ)%**!55o
zm56wbW8z0=rW4bpo>@ZSf-3GIY-?QLEgB~;J~%>C=mQFeN0PqQKR^BJ{$<~fao5F{
zh&kX@DWXI_@Xb5^Y`^G{6Y)X#W*Az0NuqVcY1x>&1N$Z3z|)WRG$5l
zDLk-Pw#-GI$;B#^%k~B*0Cbx~*4zx*yAFL+T43*%3(d@$d?BFpUED8FOa-9*4&W~f
zfgVZBoMbThVcnk0aR8zs2Ly1_e9!>Jk1zS(@6KR1X5_HgF)s)h#@~J%vzi4JZMlcQ
zMgx+>0qBsqv+P5Nam>7Pc}dGOm~c%u>E=1usoKQMu0iJU`eRPV65K!BaBM1X*oWc0
zzq9j#e9VTRXDbIxpCl09x)8a9PSkPR25kkNn#
zn9-84WF2vV9;Zb^-uPcX^k8Q#Vdr&BV*mZ?*Yk}aC}zplT;L5#HVy>Uibnyx%sG7}
z0~snzy%e)iKb`fTa{-}J>due%{YrO9Z|B4{R2YcaZIN0F-L>|&ch8Uh9gQrw-?^JX
z6JE=N@~7NLKKOJaa5sAa^Z3_OBYK6O`b{4>PLNgLi200>
za({vvJFV((qWGNOz(RM}E~_B@Ze(>^-)8F;Icl?~aB@RH3cZCc?yO+U5?#~(DK4g*
z(X^K$3bs)ct~OSTlf<;7w+OR-&hJq@x4z
zA*ziDCD}FvIpicEs!-BIng+3Ah;%xj~LtzyJvhJv#
zTs7NSDI9KVl%Y{h;mKoGeDd^+u@~&``CNu?8VyU`*<-cqq-h5ghH}4k-LNKzBw4<*
zrTKit=pwarY!i|otj6o*n*SM>h0X_o@;$6l6`kUqI-uOGYD`dUVY&nF+fR8<-yk>Z
zZVN5(S6{rCVmBq^FMG1)xpx&ZKF`7_t>;R(sJ4)ACS`@Z97^{hB4SJ{{Zwu)@73FXYc`j9dhPdV|CfgB_1
zCx1WcvlPZfP+;4gY%n?)O(%pAE;Y>l*){gM=qCw&Y_eG{C-sVzvojFeFVC1CfE;D<
z*DU4RF{?Y526Bi>B^S#=m*MAMoQl@M&-5&~RDX8}P4GzKC;|ufHj7KO>auKk$X`!M
zLbjR%!kaOB9xXudT#kIY%|z`^K!u$X^5OqWGMHXQ#yhj2%^JQr>rI%1kAG*w;}uT<
zEgWHqSXFm(fh_=NRj>Mb|Hj@(|eHIl7(l3w@1h
z=!{!rmXLBgfV5P3D8g-tvt_N=yo=K=bK@|z&o4N;M8ZpJMA+LIMsd=xqEm1=gx&Eh;NaJrkX96`Vl<>(CcLjAgq(|_*H>MBl?edSy>A8z_v
zG1cKpS?*i8-^5W84gh&KF%ts!q~Q&%Bz%H*TX5J^bs0q3K4`N=bbI=UdYn<61R9=j
zqc*8dhO21(SgmC4E}vyPCA-1EnJF2x)SkJqN8`*fR0cApx|tK`9o7AVn7+-KFX87s
zWP+Py@G3^W^xgIKq)quU3cQ5K1A$6CzRB!_YrYT6S`)b>;Kty&Q0;GHl={Yg2_&HI
z)xejUiOJK?wGp9fYu-@}G>7Q+_$jwpCTDPE*uJxd{L(~T#KXyUZQHk=GhvKMAnZVT
z-utW^3Sn*ADGBv1s^8z=;iKWtWlFgCE}x!{@O5p$wIx~8Mh`N{!aII58H+kIi5WVa
zoruoq&pWHs*=t6Ok;wN9P3zR#9rltY!1gJS_1^$bXz!ex_L4x>p62_%
zU`lMEqHiY3JWnXK_n9;J8RxlwqwG|oJ20e%?dn6iwOgQ;MkrqiL{M&NgQ)PA35qCQ
z?}LH?aFMims#1wZz{VUr%nMp2WOF=pFyX+C&M}%yM%PoS$6?{eV+EC?xi?X%6bi1|
zRnVB7>f+JQqoP+IMh=lUVT0W)##*TbMt78P9?!~qhUWKnqHQNxOC_XL9LQ|MXCKH`oPwIFU`
z!P}N|PQta~nCt4@pTmr-Y(}b<#PcsgEzcooC#^IzY)v7`E^>
z&uMK)j3c6Ar-bQnARoysI*B=wwhw=ncxDj!0CufeX`w%84mP8GQM6@;B^O#PkICQV
zP!})+q@8TwXWZJzlTjwmz-y{ybG%&Kj%iTSzet8^+o2dKD4M0c1|S}(?lzY8jj91K
z#ZpyB^QZf4zD_Dh1mhrY#<euE0XJ&%pm%k=#fRtDQ9HfbQ~&*WvD5oid}rT<^=6{g
zH7gz|L2*>Qr>JIg-j5Fn9=R<;6m3~pQ$8gvA=1ghxAz-P5*f8E5&^hJ4y4m~P3{Q|
zV-u)UOSg!1^@8E?CcW4CGv9wQ9KR*4aEa5{7aeWx!FObk2qt8b{#>lx&CLKzASq*BKZ-jpXH(YLwpOP
zHfY%F-JpafNj5OVPw^FiBhu+j?zzwpE=~O7%&Rp_WQebM5DPZfyq1la_0kvr4Gi*~
z_-G1){k!Sw$GZzi;XS)%%rBi^<+;+FtU3~)nZA37YGc21HY0+2$erzHVH&mDFn-5G
zg$mv@`vMxVW#S}fD!ZGT$LM*`B^(U{yP0Ak&2hAE2>9o~eVb>-OQoVPfbIC%G7jn-7fktQ
zeb{y<0h2#VV}et|L`GN9pIrU<^~=nk-+T|5TZypj_;mj{YjTeT3AWqe6ghvt-1YGb
zv8fjQb2NqW5D!VjViFN3L?G*(s@Q^&)0Rr~Bx$~&(j@E8B8n^%#ZAjd
z79nb@5Cn$FqPVlZAneN!{4q4
zYJoF}qrCq}wapv#G9X#I8F
zTKM&EX)ZCIvU;ugHxV|4=TX&}TqXlIS!)|01&u9%$7+4;aqsbLwPvhcQK1ua6iFh}-b>QCLZLAN(h~fy@PQ|%Y
zYtLA*tE4FeACVJSFW=zQNt
zXL}^NjHVnmL~oOIp1QmJJojyVv38kqOSQCVji+q$K^7bih#``5QWB&3QQeJsnPG!z
ziE=I!e7?-^enYFzVl;&9dSpod=d4XwZdX=X4>xw15EnE$Z5UEO*}=aG1*)$;Uz
zI>fP$a83l4ZNb#DSeq^)6cjX{#*9Ix7o@uU-Z?xh1GO-!D}Q3=Xip6)a`Ol!j5g*D
zjSU!1<1vH~2k%yz@iYrne+Sk_%~xF&7sKFzKP@PO#{@}j{T!L)^4IWr-0&*vQm7pk
z_Xm4_9@vml)m@PzU;IfuKR`9GkllwwEe{(H{O4?Hf=boE7C@?uliuFZVe-NI+_9zE
zIAlAh1v4hJlQ1&@
z_aZ_UrnYK=`yS`0F=j5@9qx5mkeiatY!l1?GahPZ2ZPhU$`TCf%f>f|VcN%m>B-5v
z3WWz&t6?k0F~Ky{7c)OYe-<5l^o+KusjMnEb-W#v!NtW^7JWOusua6tUXKkNNeXMF
z#|%@OUjq_SFF>^k%H6*-Y40G2F>J7K=6;c@n?7k%tf&U2><6BHmkF9C4^BScP%8qv
z81#sSpZla|L(&(qSM+V6!eNS4A%a#28b<~sA1Xo8$-fqftaBGCp#+#`5ci;^nH*H
zE9KrCzecPY=#i=jehwX3tO%}s`T-bNRexbt6a23-ENy3V
z%?}7PR|KaH`KkYra}~j;?z5j{-s1-cQZvFvQqL}`cmpaNvtg_fB{0rUCBQS*JMo`J
zYh!YvL@lRkK7qoqgERm^lO$-q<8(EKDYF
zUsLPJpXOo^ylP-+;S<%I4InKLhXhK#7zPZ~i`^pd-&;fa9><6bqW0D65b&xB_%Tw!
zh)OW9j1;;B)Y1+Y!KW-TaT~1HU{Ya}K_y|Nr-+`Qd839AUr@x7KtC|Jk32lE6UdVDCyGLsZzM3mgJ(u@F$12JKD>X;-iR@m>N?56CvJEr
z6MuRLCv(M%k3z{Jq-L`|dJQ~<_>33P*rKspsCS2o?9}}X#X=(&P(`lNN#l`>
z)9g@8MwfPNSl6M18w6KO)S0^^hy>x5G36zJZ-!jq=q{MdN!sSV#|*
zU%ZjAlH(5k4GiVQq%D@%ODLB052K<3jDD*mR?`(vdFQm7wYQx9(V<(fyt<~W70Y7Q
z-=BhQ%&?N~CoJ;pl5bo&;*5p(eB1N24)K}AD)ugTak)|yYem0e-@wEfeUE(4?jN=8
zD6Y~A7zW5%yq#G2qV#&5)7QhkmS-pT&Dph%1fg%{ua-@`dA}lRckZfYIztT`Qk|w)V6sz6tI)i)~Szo
zOiiVa$9}}hH;mhP03i+VY&Xrw`~H$O9Tchw3|4C`^aCB4;HBo8(w3BOeWGxq&>&SQV$^I?ZKFm?PU
zQWCkJNZf9EEl^@4i$R~aM)K*v13{S;}sn?4BIA#fMgfya;bX`*GDxrgiVSv@{jQAyn~?lQLG
zaj6G2s`Xs-&MA75jq!1D&cZm_y|kp-q7k;iz{py|eoymn)oD^5=wO2LVBAoqd9&g4
zOOI1~T&V_H)d6=Qz_xhfZ~#w7$i>>Qp9L(dikQe%PLbc*`S{$m%;Ia{Vl}IY9E*0H
zKG8&T1>yq3cj#Z6_i`{d{fra(FIq6+QPa`UjCPYHhgyWCqi}fM_
z^I?6Ri!2^GUbYlDUTsML;vwck7Ve_cEmeaH`()8QvJg+Xtt3`%nQ!G+(Df1Yxq1k}
z-*#5}nVQ(~Nxe$oY|I)eDLGud&DAFF{zq37*9X90ot#^WMa=Shs9nL=6-
z%x0e^yqVMc!GT!sYlR>koUw^|nZHsXE}m(;(FGak5~r4?pPy;d{QriGG4Kq#b3hFY
z_f;LnQLvmkibZ!79WZH3DgT~@xOss$&!lI6bPiubEDP&K|NjMtmzRN=A=$s5_8kuU
zPy6m*H)7x|@q4w#4S&)JH*Kf(lp$^D9hjE=wh9yy*VTfPaRefZbvFd`yQlJB!t_%?
zAjFV2sgg;(CSL1r#(+yf#}QlaI?6isjv?(J65rp_EAz<
z1GAm-`mkh0mL%WX%=*sb7>aJ)VqDPAsH9@So7q!byOanp-FtR$;ZC=}D?)`pqS>0y
zVWNmHX6+xJt;2{F2d5t$6^K(kL&*6rLbi&gbADmbP$(q4Tt;$WXvg|2#lz9kySY;E
zT<$m#mY1Z>#=I_sR4%ODfOdPusG`ym<3;x#zd_ALc!{mOM*(fx9bC;)h*wRY*N+05
zOama*Bo#F#FOb?h1sS&!NF_W
z|7_>9gc_c+s1JG3{2sxiN67p@Y_ehn9oQYSg6|8{QU;@(dX=A&k@#YNqYEen`wK7AS0#YKQSyU0W9$_
z9?>jeZ+`wX0{#(|WvZP!GS}nx;3Fp!>3CFl;x;PCTDWpj^PyNXLZdX`q^~}3`JMIj
zOSrR{rwov*V#;e)J-<5df)1740O}^frHcOySgmDApfw)EOwQ5lI2fA;K9>s1TEC=Z
z=@7rgHFAOY*-j48ubjfOiYyZUQHTOq0Lp%vr~O83o>6i$O%}bY*q}@BW!l{$dBm|{
z+6IkUKRmX1I(n=iwYr(pM3^{@Pryz2c7yyinSXu{c69a=2R;iMS2W}M-yw+dvE?0feG6Wpg
zc?(O$ob*qIx7xcYmO>nZaVz;e)c8-NA+gN~1~Y;%0uF&d^7CPIgPJp9jk~^$C)C*y
zAmcq)LG^pYQ{0pTk(Puuav8NvZvf~BMp;-!c&EWqT+m0OxW?XhJU(1WJ=2N#d^_;zdff2@~qix`ZWf1xdo{u5z2c%E3vMo3wCTxh6jU~|=$336$lV1rA`BXFler*d3TEcxqD
za^&FY?wgu%9-d{d-R3A&s!8KP`R@BkHe+IM0LKPqfotbiYIf%K0G8}c4HN9M0*
zrD$jtX2;)n*X36W-+Kb~_7U|LVLrSg>!5%P_)<&2+Ejz%CnT9CBVtoWj>Z
z^W(v$+zy)T8dX@_GjVCKBZ~O(BsH$3>Y+^IBmA1dE~wIw1rzARUofhQ}uW3
zr@+U8PIz(V+uD1p<2q1g{R8QcZNuAI#roGG@W_u`yC
zMB>n2WX^UN(K*_v2cxia5f5wo^0Ewd__`hW!l@C)^G!>ddGjv(A%?4&OPM%Kw6lhx
zOn(Dfy7z?U#5=Mo6Fpb_@nJIzpg0#x*TJB=u92G`$s}~xv@;ASFA9)wWK}XETIu>_
zl)y$6e|*^6yxJ*#sOBPo%Q`gt
z{|K>IKSFFQB7}L4y2!XJ*Ng?ZWxO7yEZOThn%xv60BtHXX+ENnu;uaubL>8WL04Ye
z`yTm(yRe%uW2g0SSD@u2MPzu5?sdKljpO4N97?whXuc2eMH3-m5tP1hy+QT`Ne9(>
zyI-7MSlU7jQ$tuERF90~pO^V_oEvl^DFs>9Pop7hHJs%pxO}*I$WY{ef9m}G{7v2V
zzWqMbN?0hDpIaaAVq-Ome|=*~y@#LxG(+P+e-=mkMomI;nF9czpAdlLI14asAqt&+ehGgH|hJsgLu3M%`f%b_<;Qn
z+CCkBoWTm|RWA}7^Ah@_NS1cr@kD4YBU^$6Ft+_uSXQ{)q;)|6OW-ndWc!#WGIJoL
zlIB>A`i`6Le&(|4YN?{QFo$J#zXN`&K8K}74G(cP+YVgl9
zmASbDbZn`Rep$h~nqStrF|*)K+BXJ%AkV#=H7&@lf>Nmu`o^-r1pu)5rm$ka%^_-PL8b6lu1h2SNM25m9GhFim{+^H;dX$`YP0Bz1xZ%$qP`&
z@S6uAJ8iHaNCN$-pg{mj`JQ3^HlM89#sgp<);FUULw!8!mZ!O@^HeFY1uwx!)41%Z9J;-jO|9|l7)sSuTQo2l6_inm2VIuArrxtt+AST0UEBRd
ziN?Y?_?xpUqsmul$J&|syh$}n95#>K^z#8c|1X*=M;wwO7{K;psD&|S{9tQsOSn5f
z?3m=5k@Kj^{?$^E4@d+CbgPPA$q`mCG|{?eP{X(B(L$+raU%c`(VkW-bxhC;CnX7j
zy`(KkOxKsbD4(Ofh!3BEz(JCp8I&b)Yc@wgMQP+#O@O4CCx=lI0?^8^prG+b%}I|c
z0EZ@l1oAtn!@Q#4FoFGH-X8S+#$$m_qKy(hLAm6Fty`v!Si4rS>7puRdC4TMekjlr
zP$icX=y8AG9-sjrDO|1@M3$Llm+ayk)Z!V0&P-Hv1}RY22tKl1y;ap)hx?UajVeVQ`W4s1W
z45@2I<1aG8NV9qJAD>$%pm7wG2T%+UxO*U@hnvKB9Swonv4&4>ecN_1@oB2Q%MF?X
z+-tHZNhowncRbWUi8*ae$nx@h6CkwaC3VRx!$?;kh~@EoukmNPKRsM&8Qa?3$`=2s
zM?_hXUBB4f{}u^Ff;R@36|J4}n2W@22iDNT%Nz^(7L2A3V)e0bhR{(X#J#5hn~p)1Uu5&>#{UwGvuTxVH
zqTKEQAhA^0E&=OyhG>I^<8T<9E*untigvA;jRRxo5uCvVsLm_K}JF0~RQxkX--AvGNfq=sFI*ASB
z|AfVynt%+NQY>>g)FZqWrsI!DG_%F$Bd&6z<;Xa@O~I=pBylLnG_~3K7#1;0bUbnGC`a92A#=dZ6tW-4?Xg(iEZ~b)
zi3cFwsmMJ?^X&fQH@;8fFW}&fI$0sxU_R7?ljTw2vTFyuK|Sy5^
zpT6>bso~BVSIgNZt-Eymf^K=^)O@8-T)bBW3JA4Z)f6B?NpYcE#gHW?;1^cYo0RH!hB#~_qr)uMbouQBgn05|Ee6HxK2jo~#=#c2%1$5Qv}
zZ8i?Kt_XD)qs^jhhT4;V3_BFHauLzK9M~ab>F^3(Cr#ISVmZSB_Jk^6P&)y?vXjaa
zYL{TKLT?)hnACS=0x>`rKW(33ede)Ei&ko<#<6WfWZIGIA#xg1m!7Rtrg=Z=DJAT>
ztPi5F8N{1Y#A?x$e-j*F-cj!RklWP0I-f+R3
zXf1TDIG;(q7@HgzE$}xy$AKgxV}H%V#wX+kQadqoVYj$=+wpDDDP{;sY<(H-0Liul
zzTR_g;5#P>MqgP%GHsESPQDh*`>uV}*8Tl1mpbnTIOPcd>=4?0Y
zG)KWDT?cnM*W2|EjVYev-n--sJLoYI>MI;lqs1!1Utx-_ls%W-5&!d=uh;)VHe0)L
z=u6&PzM(`|a>+UYr;C}Dp$*>Qm9><4sFJFp+w)^xH&p%^qtAgaMJLzj#s7+c8EZ$c
zt?6N52`jthYsFx>_f!%+_RHK+s9b#6X$C0!gs*lENE`@U5IRbpz&w
zadaOoFs39JDV^Emje31K8<~Q1V)-9BXGe=I7iomjenFh4n%L%Qh3%x{_&X*;t{#E^
z_uCSofPU}S+ufx34sY-CMIwblu0SVmw;sWc-D^f|YcBoe-cab4Ut7t=72S8D>AF|Z
zcd>Q#fR<}sZn0nY7Q^qZe=jc#_PzT2Z5W9vzqH!TwywZtH1iG|!EizfTX{%eAWr~!_KK!E$&??S
zgWQQQ%faLYqB8nuNgSo!(!~)kALmd0Q!J@9Y?TZYN#M>~;>bp|u^CP)?7Ns;c!7xd
z>(ZPGFCcLXx_$L)jGw_I_#th?{EtoDR;9n$*l{Ou<0;&~#F*Vjq*#nBU~tXWU6*vl
znANDP4;^6^#V%jiDat{%41k%#?@Sj_Gl%T8RxmRtV|+*KQ-KQ-!}0M;kp>N%f}88q
zoNA*8bQg0o^WuOh1|$KG28)zxi#-htpA+#$F_a3{Ds1P|`+4#C|C
z8r(PTuyF|P?iSoFK!UzI&vQRZ+K!>!)Mhc(x!|wntrbc
z3MJTfI_yqPa@u8I6cX@L;7}bQxZ~Y_{ObCBEneKQ@kj-&0LI?(bMvA8l&de4k{Ibv
zBfJA(tPCMw#Pb(JltQ4LkQGw1>aL=Frr2Qc?C=+I!Of6}dC@*#6k~&bM70-gv1IRw
zmS2D>d7YVdWv^WF_U`QmHvxrR&eYD_#e(!7f%!A^A5RcLDk3^nF^-}c
zx&PvZ_L#6+py-vt0QZvjBNGorYycq=33lf4?VHul<^phu_9PK%u1SeY>$t!2MjuNT
z0ZcEEUN0{vt0#l^BpXfkUA`|z{#{)*lm6bXN4L%Q_SO1+tJz)t-rlddy$LPD=U
z_wLVructOQGasD&u4X3LY&sy(7kYkZdcJ--Ur&9t6MA&IHXMB{+hyEyqBEr5QV_K7
z^0{Ac6MDV;`P3)$bhjNhKD|jolD&2Z6cBj*b=_M0e6SbBoYUpwE6~;M>-${e>+9?F
zBHQTyuv1n=5RkI6p7Nv9SM{mW*Vpqw6K6@WMs(gct|31v^Tq+;ut`Y)qRC!_zi60f
zW}Zk1?gn
zCK%VNYYT65?r1*?rCFa|qima&b?0=Kw(BZy?Ab82I|tyn^YD15?%s(5gF0lLV3W^n
zE)v(2E0On^ER*0(nNRnrhIPML5jw}&z*s8mW1omW3msd3X%%G+(|d~bSUDp~*>@vd
z-`F5)HQn5zUG}DMr)RVMwrtqT?trz)n*X?c6J!txpHf5mgUw1yB@5-0S#nOTsS1_JHf}&Lk
zMN2N00QS{GTF`%teAmeX+TNip)OpYcy95cGV%vutH!Z)7S<`CA0<4-TKCah$(5ltP
z5VKM{*54ps8&Gh`G)oh&S;kRH|9y=wTBShc9EO{*2@D(iv8N_aB)mwR
zK=zosv~+Y{+8Gf+^fP%J#ITO+LNX)(Cdz!!2BMMAkX>MP|$DQcv1Lre=%$sloS`7Yw^3zBCd4IJoBF
ztUlkfx~p3W+k&w5!0LJ10@z%k&|ceulD2-P`cUcM
zVZA_?RTkk*|B0wJ3;xo^W#k!~*}TjGmvX;F*@KroX1gh(c893ta-e!DmQY(im9l&9
z{Q65U;%-Kje-Kb{@so+bhQitBpVB)IZOyc;%)U?Fn#L7=`9anC40sC+*5@rmyf};r
zpM<6%5?q!@-PKb}@RW3X7xiD$}XhQyS
zhGzhM5SG6Or*XzEQx_{ud-cxH3bED6%9u&zk9ci0fen8*X
zJRl2-e|O|g7J{pm&SUlq@JA;<67kZM2+Ayr}?6f~0Z{ZaN%7
z#h});wh0UCJ50^@+e)CqG+vl16Dw}|7pueO@rPJR#DoaVUeLI38~AT3p^$ImJnc{F
zo3vDL@I1!OXh{R|FI?+>rNJYDY(WgkX&Qt;iY5pTE$D{@4p=d=(xhWhCQOLKP_o6y
zRlGT#SBYZ>l??;1SWx~{8U}!D(WG1E8bSx>4dqfK#6r3I5=8b7{V?FeyywTni)P4%
zah+)$GBAN>cTUPDutE~UhJ>f*^*!kpG0D3M1`S8kVx=@y2+SM$Xfo__M=E|1M)o%0
z=Vg2}r3FOYn?(m@{79sa*!&Z5m2jYzcw1aSP~_ggBax~gA-GvK!@={<#T(IpoR+#A
z{MA6mN&`Q}s1j{Q^N+%D3bnZ-x<~2ztSBS}$Q(534?mPl9MEyy;8Vq6r~?coBWaQT
z6b7k_N0fFM6(BJZbFS4u@lHZs4+E|IPYV!r8JPoy3If${QoIM!bZ1T68RV1_*^Y^p
zkpa48!%2oC4J&uVnEgT?jrKRO4A?dW(7=SeN$uW0wgl{OvLcZb$g)h@ux}Hkhsh`h
z3Pv@=VQ6*AKfBPeN-YD=^N)QK>dZa|%OZCrX%6DQ^-LRaQw|qR2;kqn$30OqAw{)J
zIp@X1l4q`^^!r^4339n39_F%2H32d~Dj&Z6LSHJ~h(VtC%Lt+B#ykRz6!ACzQ9ne0|X)
zs`Bko(J%gKhN2@-*K$|=y5?7ocy=3yO_u2#ap&ge#MkiEd)*w^S#^_+aJk0L{YN+DafiwGjlt@M3=IpD!BricT##ny;=d~
zK1o#cFqsgNawmb%C4n=7g}KH8M`hir*SZ1rzyW8aQBqcLoA0vBJ07aZP&((@oh3
zIA>z@U2WN{KW+G^=1+dOvToRyv}f4z+&lSn^X~$_JurLKg-BAZ)@9fTJWH0b$Tflz
zWh|&N^0Uk@kdLp)_{HgYJK#I1D|9IEHm%tg)n!;cqv(Oe(nTF+T90dcCHGhAGORmB
z^=NUzTHWBBJkzYN5?ZmXc9T!EypCBGP(IwQpgzjqufky)SKilJqbm5p-Szp+qCItM
zB9_-KJkB&y_oaOcHQ}%+eom;xR;W2FhzB;AbWC|FI2GZkIkgZ(+kVUn0*yqWa~~>O
z6do*ooMf*G)g}p=kavVb;dNg+e=EwEeVw1m%@s@-mjU`=Pdj=I#}g#EE-HE-H$I${5r3ILeHHs#bA>iT|KcbkdRNji#Ue@j*dp
z<2VDGX^*VD%9zNta3!)^erX!)S`E!3wbQhX
z&g(8?HLBOyl(W%x^i7w&n-8>AzmQAwSn!n@24;Q!iDV5n-@K$*??fHhDMj2SAC{A{
z-Rk97@*wGQMCgR2(~MoY;`r}a9W1-1!iMtbd;l!Ld{xH7+fPf>p+*a#H6*91kz*$B{l7d>imDXTK;@JHgwo>;
z)16}Qe88`Redg3$U6jryXWO2rdB29W=UF3vt?`7hsjgaQ{Uhje8|F=LOx?-NWl4qj
z;8(NsW+c#(RID`xcc5VzxlEQdWW-pL2C_%h#unnwVd;xB%-4^y(_Q}Zs85EdReT)l
zdH0MJK?>uz#c#^7ngr*hknLvNXxNm-O!z)`cOb4vlO|~_xOOiQvw(Kw*&wgtxHWSP
zcKBm|w0Lt4=K8Oz4VQi)&(W+5CRzEiqq~CQ6aPu0f;Es;0Lbc0ykP6{XLY@+^mKMT
zyL=5^`Fg`u`*Q0}GfLdi76hk?CD
zmu#dKtQcum9a%M&l3v4B0mnB?E#CZk3wa0f>Yxtu=1W$_V#yCh&n|7R*H(Ft@77!y
zs-szwjP7cT8YH0TAGeD2M+>+U->x|#6Fl3bORG*&(wVsz9z^KQ>DpdMxuYY>jVTE{
zJI*+o&pS3+?nCzlede3vb(!S$n{hnQUrm+PnUqV@W|H{;$UlW0WiQVtH%g~{B*iOD
zey92O&%M|^mCe~1jL-YnR@UpSt+0c0us|3eki=d
zs(72fmW_DT$
zKE?|}m9eW4A6CCeA66L_rOvl~oxdYLc#+?0f5Z(Xt}B&j?yV
z8wDyu_Elg|EP;M_WNh2?l4E)zEcT>FkMJO}cBCnOb~?M8Zm|)k#T$%$|ma?@cmFUL(N76Fs!b?^q>AS%9{50Te7*D7mbzn`o^bpGK=&m)6+
zPh*K$u}zRkF6iNcx=eZZH69GfdDfg#h(5aTS+=~N^ew1p9LwaS1IkIap}b*)B`8v#
zZZu1mMzq6J{y;wsE6#P8f2f_AF3mS9!_GeC(Q}bc;I!F1QfOYx4-Z3Q_Um=J8nr*C
zMqPdJXA&2ZqL*zV+$TMuG9Uzw`l1{w#sEN8C0f(TmyFVjn52LQOA;yHU+xTp}JGJhtizWAzLt1ig)_l`Z5y2n_K
z99^em+f!iq_`%)fpl9z6aID>>9S{@8_jL;^(q1r%Hx_93>WxXyf$gF+3oU;7KwIin
zqadJt5^H5v7kMJ4GRCWP4tp{e1+cC+EnXuSChd<_cPCa~f8n~by?&e=S2%7R3)hGJ
zVhfweUN!RIzZ|L~CO0;o(1_7k+VV0rmKz7T9H(bGshUF*h1f?eNcT5ej%R#FPzYb4^jm)XcbUA)at
zv$!C=3=P9|i{B-+O9m1s5U;*7Riddygtm>AqfcM&zL{gU~~kRoGd
zHZ$iG5vfIZM6MN8Ig_2v+V`ek?)+DWIs^{U;#m?rDrNdsqvxI5jN{wvewB374TqiB
zsKl|81Jcop%1C>$d3%1gKksj%QA$AF>johHKJjFOP4!NKRq6xZFf1k4ZvL(p=+Puu
zQsZZsrzRy5fXo7P_T>>%b@P9M&i03`$VR}97fCv8AF?rx8Rakce&m+Y7D0ZtZG{^2
zwP}IU7KnSJvVFe9tS3Zw6Y7fO&m<9`4{Mn!#qoC2KP&nX5px(+?Ctx=V0TBDE^Rz-
zije)Qxb^t6;#piux?(^6sA5Dbm(TH26Z0#|$mcb03Bas0v^c@SDCn;ir(Typo{;kN
zW*apVtw_8F)An4Zx|7x~u3fy(Jglmmfe?|)Q)jnT3ny;UX7lYnEzBn$ej>+LgF{pmvddRALxiA;NZ8(=**#UI1
zSz3#6JygaVGRwOO;Qp-7y-kuvEsn9Use9H*(nI}>RT9s5lfs9kmGWZ`RZ>gFLx5T%
zhh{fDz3z>i(wKGXe_C
zS^uYH>LlzXx?-c0(1x$>1Sl|i!zt-?JfP#}lwwgF2PL!}XI-9{fp7S26Pyx4+>c`4Y1GK3^-Ahe*zWfRkRTF
zUMTXbktb4O)*%Ev)_T|HvRec1&rz+@&q-X!ie6{Q@UD8VGp^ePQ{sz6>!6)g1=?9F
z@poP&3qiuN@8iaj|B8%z@&V4T&DJj@{R*{z9rdSe9p`NhRRSZOk9LMR_zSPUI$(x=
zR_B%9sxThB40F**o{cFv>lbTe66L6nJ3ETvtOZGJIaNbVYnJ`rYEc^quQUuQH2w=i8)CUm$w
zxoZTL*I_2pQQ&b-(8b~1_nXwahbeVot@@x8nS>}n-q^)E=u|LqOLEfqQH2Qx|7F!l|8RSHcZ$k$!Uv&MbBF}?y?aWX`qXlmZkUxbC`b{Y
z82{ec3ifoWl?Me#m*{uAV{N>UpZS{B!-71OVpXh7J~hFQo^aPE$9PBm-J@>K9j9Os
zrjnPI@?55QYbZVSE;`+t{2ZKcyCnWr{@51HK~PvaTR4C4q6uYe4c|I`=LnHQAv>?I
zJ)v5SK2d&>>&rJ^QYns~cAruq7N{2`z!b{dD$?tkm$_5=+%)=J)E!{Xsr59
zd?vb;Mn=hwMAN3aZ}Zv(Ii~QN(Xm;ZVJdf9=bI8mubiC^xeqf$BqW8KZz~Db1%Nya
z$Uql3U@=P(%b_-VYwn4%+NS{FgO;x~@zc-p#npCBO_jT#=n(QuwEo#X*#fPePL3v-
z&a|NW*dFDH+uiMMnD3MOlWU8U4oC}K*9e*r&9+!op3{?vV)FxQe&Ma4xX|o-RmHTT
ze2?SYzY`q;g(cRgih4B-6qB_zcYz-%y&@7NhaTgV1Oj!UT=%xCX?!Rj7BMGS_O!1Z
zXcv=8Ta)=vXh9V;yIwWOt;F9aLl}O2p9i+SJVKwFp1^olZC|qS*x@?LuOnep9ViS^
z4syV|6QeUN#IS5>pSnOSI)*PCgzEh8>+P+LJs^li}Ur
z`2^eEtdiiU5OSoJ>{Ce4_Phxe&A#xK|B_Y_@^o^!X>gyNgF~aN4-G?@!&Gr%J=fm7
zqrth5%_yriIj_895#=f%*OanC)W~bqJmtA!t#L@?k{F`UwP=@DPsUM+hNIdT|H+NgT!gETYs=0{zl(S{SJDjlK
z?8awjNS)pb3|-0DO(EiG6X24JC9kBdFw6%%Y0$wDW?2j*Q3PjfW)YI<;0qru@(&)3y
zi7$2euB~SMuQTqVU)?tq_FF7Q6m>q6#6E9($-d@RaYd3l!r2iq?9|RRN~+gfZbi{H
z`YQGGy0>F$XV_dTH&RTG30AzYK@dQnYzsGCaiyq}t|U^%a*@
zsMKJanIS~ysP00tXJ$_hDp`R#qVeAsJiVF;}(Ld^ydCUzo{rvnf9W?&3+kSg^
zq|ryIXU2y4xHseUhjI2VJ2erQK=@J0FW1$40}^i=_WX!@m0ib(p1061rbs#
zy_InmOmX4>ru(AI`%LC9$~6u2gVg>*@BAqDI045nk}sB^v3tsY?1TZ>?$dr@e@U+&$LH$Mn=|
z=0sK1EuGbCen#~MX_|%u03qhm5hzAq@c;-YyzEkcuAr61Yd?Zk%BDxoAFf`U2{M@F
z2xLjO0~j2I6>IwjJ!m4tCE{oI)6L3bF+j-&Zq_1ksXIhl50q%U5bHDuQm&E$Z)ssq
zltJc#*wf(w2HS0R9%PwgQ0k4ls}tqshVtkDI?a*1#*FB9>NO44p$Fx|78=l_HS0x)
zNy7zzlth&E`Ca^Sgp`p@FPj9=j!m(XOkt8cF9cYXodja2n9!64772UzB-l9hs6h|5
zczK*>u3={)C55^V%p{&Mt&jZT7vyK;$N#bMz!9zCo7yI(_Nw!!-gv1iWmv+FM+Pt$
z4l~m|0qxcPC)3c9RFlZkK+`1!pA<1mMhSIB0V3Xn-QrS^{b9a_A<#cx%Qk0~A|_?#
z&}r`HVMq^r1!zljdU<$(N_3hTXJUG3a-fGEElQoJyQ4PWOI{jWlCXir4zpa4KIqo#xQpMLmGYomIVNOcckxHK`0h>Fnrn-6p4^UcD9qRMY)#Rq
z0Bw)my_&AjF|WVuqo&`2w$~!kWT7s1XZ~&dMCuI
z;Y%1JsX_Nn^t>3bwRJ&fGBmG-Mff}wC7K@$&{hc;=(U$k45s5goYD{lT{ZW={@7VE
zS&aki`G3>UvtQ-J^j)mp+E{@|5LeNMiiC_(MZ&{2$b4=(?`hN;%(5|UsyBG;3`<34
z-eVPK#cf5$%zo_mW=3^H!BVI5_(9A-E*3E%vrKy2!z#jlPN+y4?pb3J?B*l1hxHCM
z}6uFq%~q2zr>xh?MLzrb+O}Q)z@b|xrNOs1G`pnaZ$1@qWl5pQhSKnqVQ`8NhMNX=BRhOU
zu1q2iq(PIFI81SOh|En3GJyheb_9J-*JRD_eU_w-K{GcRMr%;BSfveIVIG1r%zsiK
zox=~>x~&`&#cV;a+(6BjW56@QJV1zt+ir|wC3TR_E8lw4^W1=f`=_PA1vA{nX&5b%
zS1L3))>kav$Uz?AK58Mr#K$|sza`VWJ_kqJM)5~Z1==~R+K<)0JVYVr*z+diAs@2T`O
z7a>;AATXv_JMMipB~MXQg4D0o*LZ=@XBisBM&-&k@NJ#kV7RDU$^yJ$QEWZIy
z_qoTLyYP<8AZgHYuQmP#azA>}^*1afW_m}E#I8_Bt+E?0BC{If3K`$M-KQ_Gte
z%!jh?h%j+852koYqD9?UGVNCpB=c&@KX97rtq+#yn{Ik};=6&qty6UbIZ2UT$k
zc5Y#3ulJP$v7G~4U+-*{Fdpy1d=Ecaw>5{|+#{amH_@qgv^4d8j{=PCP^;fvjh|iZ
ztQM^2@5DJ)$xO`6yC+)`p4UOD7Y#SB5^Ly|8IC9t)Z!920?H~JmXoEv&IZ>B#i%n2
zF5e_Ic8)M9yCPoe1zGUS{ocr~&>wgneq$qy*UJ^Gd9UZcv^;yWqm8`d#W~o@s^604
z!Czs^|lKQ%yqw{i2^bucDHRwB0nwsQY
z*xlyj4b*ib`@<+!6EDsDpbPmkxj6cv2HAZL2$(m#Sk+^H5U2kMHv0p2{ehi$*tkF#
z)ISlZKa|%$5UBq*S+l<(wf_RvjPpOTW`FGbAF*cKppJhbdSKQJ%$k8&GcaogX3fB?
z8JIN#vu0q{49uE=Su-$e24>B`tQnX!1G8pe)(p&=fmt&!YX)Y`z^oaVH3PF|VAc%G
znt@p}Flz>8&A_Y~m^A~lX8(gVtI!y=TV+9OKcQdJ@eXH5$QOqc{xSd`NeJ0c>PPCh
z`#r?A$PfDYktvnaJcQK(H6$PbmGFGRNgCyd7+|Bo?~R&kz}`^r^kK>C4RitWy+>%z
z#9O#fct4?3ECNuQoGc^Iapg-d0bO41uPb8V&OB#GMqu9c)Y?m8akG<|_KPnx*
z;ar}bt5<|Ti1aM+6?nwV&E;kAB4B
zBuB81!7ykqA1w^b7J)hGNr8upTr9;>h9aNv8~C0pi68{6i0PH1fDy)sfktQ>91mo)
zR?>78QOej7geu}K`c!_2u`^`ydCWIK2%?I%TBUaXQ
zWk!X17Fw}+%|}n}e4!DD7ir(WTMlghwl;ZgXR$Ote>+|QM<7s$pDPH||^$@FzbG}MwgAC40xP=t}&$&VeIrPJoo!9G788$nm0$W!o;05iO+
zAo#4l;GB8YF0WtnLS?^ecSKX-H>m49{|V(E&oG%LxTA=5G+Na{kV
z4x8_L#F{BVm^T+*258bnAit-lgF3oB+dO%%p^7QSSLN_jh{vJ6mPgvQcVpJ7IYE16
zT%B^Vc;-;}U=udjXV-P)-qwzL!)(NjNMmIo{8CPu?NE3C+`M?KTtTL{Q%`@g2T@SP
zh;85h7ZlVVy5=tmisi$RVv-EwK6)SbYnuz6Dm_0;_L<
z)wjUvTVVAqu=*BQeG9C<1yMo
z(&BM2=hYXd48vNi^gJj?5TZo;tDcj7i1%n*Wm^f}@zH4bRP?5A%RuT?$`9WB0U!5;
z6VXO)o|84C_@yMm$x@ZMuro-xm4c#4?fA(}DA^xL;qy6kWoXH<4=m%~K^iHpeB3uo
zs9Q?&$JP8fLt(>BK@4$V^k5i0o+bS=MRWr+T?j7MXCg+GfXqQ%DXM%j>7zQ=p7Hj#AF
z^BzAN(Q1qMJuS~p&q=`@oMsw6AP&{bE
za1hMheq5T&-cTx}iNQ)KblegKV?h*9a<;(0p>!$q-tI?9${12}GHEp2GDDj|IKnPr
z2{@cRcc`A}L#QL21XSg2RVihGc-91p@T6q=FJj>iUd*si{3@5UOTt^e+DN#Cauo37
z>X_j)&cbNXUhz=V*}h_E8?97nui{=GSv$MNg?wAb&HUHsn*?jB@yuUfaVLD@WQV#r
zo~}+3%UHRlh8=qP7@Gn0%Lm#uZJdwvna{(5K54$K&pxnLBtjc&>t=pa9p%FLZ3g0j
zUr)`l$M>C~JI8$uzV$iYV6_c&L1+30iFRw0F1r5u!dx@d7!s$i{JCSI>Uvb@4@v-{m72G9nVL0q#(&3L=JTR{@5Ml`f3AxvfY;+T-Ym4LF%^0d(!3ME!sqN
z74CrDj@vrfi2VB`t~MpM)%N6J&gRqTPOzPbuGVWSvG;9fTxrKuY*gH9*0F7$
zkd$dzG&*i4n*;6|L;8G%q*dAqBwQcQE>*V2$`MK$;2Ce6w!bTJf1o8KLdQ8T7T`cl
zaze_G@$}lkv?A7NveCS?pC?@YaqOU5MNl#B-4wsZuu=4ual?p>Cii2}Q|&m5e9-9(
z%V+fGh$Ko-t`Pzf3~Q3*?FO%7^rY`rTf=p8c?Bm?86O!Ky&yA~8(e{GHH7rBsp3S2ON
zk8YK_!s3_uc^2@DIX;G4bpynH0CYMS4~b#h(p}E7H%L9#cAk|fI!)H@C5#JKx;v|>
z2r&#gF55P)qGGXk+vfna)!|fjO
zmLIU7(%Y4ZY!E^q^7X>1S+5F!f47K-o}ZZEidl>NUr@`g3kYK-bmKJ6Ip`EH88mbCfC5^8kk%IlWSmd4NR_q$u%&!
z1}4|QOs@Sqxt6T4YDXZ6?t7pyW{m!E?x$;U0O=P-`X~lc3Ig=Uy5YB}__FL$D5-@u
zyBGIro94w~v4$;0mg=tV>k3&SBmnhck5Pe{3`;4sPe&-Se@g6ggNXPko`oEia6cZ4
zG_-ysEXav6d#1!_Q(@^SIgYE1)kw@RGA-|9s1=H-(&^2tctu(lL##%*Ywk~LkId{p
zi9#H<(ybXXTse4Am5|6Z$`&BBnlfBSSFY9>18_?4
z@@7@nt#YDtxb3vs^_kBXtpl1XhiiZ^#+vr!e2?XT1$_s&jYyC6R+69C8H{wraQRaE
zHNWhhSJc~f8u>`L9*>;_x@@cM52}uZK4lu;K0nOP`&*{pY_n<#^n9w11kMeu?@5I$#D;g$2?9u(5sgt=khgY-k-rP
zNa;xE8^O2SD#^lbfk~dVW)WB
zjV4G$8mt3mOi!T|T<-zTe8H@3u4y^!5fwxB;Yo<7l1;PkRhaQch?C*on+6`@&Lcl{
zdaZv0{&W#|bn(6{k%kPmfRu$JLEV;Fnc{3Oul1kWj)F*;pso!ZqD{j-x3KGGj*Qfs
zV`$xpyLkE4NeGEOhP#o=T77Z_tv#bAGe7s8?wEutwTpOjkGPrp<7=77(EAP4G})mK
z2w@n}9J1f6DCXOoT~bJ19E0Q>K8+gDDXqLW(CwKg6Fkck`s_Z~Y&777+#^hutT7ag
zHqtL8GGY=Jqm`g;d{o=Kv4XZTtBNK2`Kf*RRoAZ+3r7k&C@lVGw6H=fhOs0<(w1YU
z7R9vV5SbWrYtGWn+_TfdbA?SJl*+c0-ob{y|2gpB2_g}LFe-Fe#u=3qHM&~kW-(P+
z-b%O&4sA6#O`IB9`XdZ%J8v?O))KR{(#4}m&^|Ub?)i60pc;Y@3sYk6doGewjBfdT
z>vzx0sjBxUzfUzxA3uCXxUPW6ihN=2nu)^ifU0Qo(RO{*sYCzOkA=~^c1+0=p5Nu~
zJ#M4XO_AyCGi=Q9fub-iMU_oQq1~b#(!baVlG?1<_C7I20$+tp^!on1VRH=)``2#1
zYm>b_d@t^JOL^P5gDg4=vLsK>PPgp0Bz=nbvIyuv!SP?;rO%p+!$q#PUD3lL_v!7f
z^An3HbI7{fC+*qxy)D($R%JLLRF={2d;49ny@GS?s3p?v#eLNg$y!a+updj#pAx$a
z=DM}gTfNM>Dc}CaN=rqTcxV07Q=2z#oT`Fm7F)^MBlw!sx}fW}#1OT=i$??^+z?7W
zM*LcIDIQnQT9Py&#_F1pg_ygy2U@#jg7cFb;w<1zB*(eZbucllC9DA;FD6b%jAUfD
zr+w!wD$QM}Hp&}xdxQ3Dw?{L~1PAQ|#1U>$2g$p^^AP<6%r_N9NaxS3LK>OJruVJR
z7=0!NX~9yUEW-}D@M_0%IU9GGCskwq9U^_HUp|FFK06A+L&rf~Bq7rLE;H5oX!#a{
zJ1GD}v>Lx2>9#?xym)w#|t+;Uh)
z_a+zn8l&z)u=NI)=`_<~f!4;swikv5F3oJkL$CeSFrFxXOzq|yOXt+u(%{q5ppGpy
zGy8J5XIxj6{l_2$4N3%AW*gJOldup2HTj6nNBc?Zd+3k>g~s&I&CAoeTrx|vVfEfn
zbmwLosxUgkAYj$dezY=OWW=;F2_KT(h)q*t`eb*3r^9vI$!+`N#cE?4CQR)+HBxd0
zLYNvS8s$TjF&{*k
z(g@tr2l@yE^E|}5jMC9LKCWU?flc1P36UXNyaqtG^eC|75Q8b#v6t7?Y_{E
z+~W}FW{{PZbRW#AqF9P9?Z4M*o5Pf}dsXmJ9;{~EQUta*ZzjT_swa|)o>`VoQ~Bmo
z!aPrJj&E@~WcAp}#MlLKU9TqNwF~&rRbK>fzOC+>{tl^Ah$3+&E2H!wH&)E(QO>Er
zeEGr$h2$N?ux$d3gt$nj`(~Z=Q~nnK`vfiZo)u&1(Ns{l589r^u}J0cg5FBa_ZP9e
ziO8qlcHeI`(@$v)pc4dKys+Q+uKO>4%V8$<89bLguRc`})L*?Rs+`)HdQ++vA{>@K
z`Wa~Ko}GU8jeVbd{gSR-mXZ9~m;1p!ZDdA|h8X;{Giph-6=gYfLn}`*E
z53gT^V^@oKxu`{ZW$u2n9bnA=zo2ga0GxlQ+Yc<99IXGsZvUA}_rE!I%kwvB`xkZl
zPXzZ5toonCZvW&E{x1=X=umOg0WjLb_>RC!PqSry9HynVC)u*-GZ@OFm?;ZZo$|s7`p{yw_xlRjNO8<
zTQGJD#%{sbEf~A~kJ#;|JpmWG-)5H)$tt9BN|&2-uEjKWXB#1YgFChZ>X`ud!pbLw
znFj`*)~EaX@pxS)%JbrocXat?+`D63Y@4~L9K}C9_K7XW+1XjkO@hiKwb^1~A3TJE
z(j~Q%LdiPyfmj%EAkg(p#>~RTRb@LEe^IVq-kCz{%7A3CFrOnsWjK7#2UPjio_WP!
z-!Q#y>6R~wNT+m|D-Wc1~G)N#9|KV;&is2ME{u&ey;%-^ZWvpjd()`t?;hc*>t`*LuHK`&i
zbUBW*>+WwxAe2aGCbnahUt!^fs71o6{^>%URGph>`D=EE*UCU@TbZTQK+sl_s94TY
zo>#>b_1(G*1(x3}h`W^sakrMe^J4P;>4Z`Prd(Zq{^}hsCouq$*jxYd;$opgb`C?`
z-nZ44By_2b$Dd%NB!VPU+g3HIH_ybM-AZ4SJ6;-JULF@Osy8}9mQaP-J-yYH^Jmqc
zM;1e{;OXZxU2nZQKDDeqbb5vK5v+MU;{jUU=l>k>--4mpT=@}%fMHX0KhJeC*ttRM
z-W)bwyMdbNr(utJd&|68CG=_0`ZbL{trZxc-lr~D$)&;XHJ@|U^dNxb^S!HUvCB~$
zdfxJNeJ&G-UaEpXP-nPxz7zW8Z8+aK9XxaMwG%nu6fk&9bsrgR_inligE}4+t>>1=
z&sg$HH9O|mg7;@mQgUPuh9AP%&}~0_{qxNyW$A@|-!_I8l7L`Zw{S*uBF@3JoFlw^
zf&%aJ)f?*HEln@-2NHPNjUO3nnZ7rYRN2SrSNV@1NnReZ(5=NkqA`(BMj*Z=6wB)2
z<_Hbb?jG-E=l8$yc$_P-UR}1nNhe_@MSB|!QD6us6|DUWIfL7crMHuZO%2Mwg|CNk
zV?8G{e?GtPiycJrPvZH9N1WJ{t3%o^E|5yIp614K9^!9B8Fl1mjU-8lI-VvDCPL~b
z$I49X_Aqdn|&Pyj!j!%fozdx0k07#U=L)|&+9StZb
z)Id>=zzBE;5)}0C=v!7YGjDGd{3Z{^zquptg;5C!#1*co#*`<+qj|bN%+V8usHdQ@
zE#Bt(r7*HHBE*edGRnq2fRrx!!G@xq%Q(I7eZEilQ85lY!EbT?IhykUC4ltFQg=4j
z7k%gl(lH;-G_{|fn(|(xz7j8et)#3T{Rn&S7!;{=N%(cGH?)E7hVfW-#iL@wN26Ur
zMJ2QP0cFB06(yTY``>Dz>vO
zea%no-PuAbZY~So44=P>EuJ&jKTFs>v}+tYjdJmzjCl?(godYELD>GDINF~sYNO2R3@tSw=Qy+sK5J)ADvS|Zh=xU
z2U$1os;RUKggK#Xc4u<6-9h!|36YqM8LLjO#qs(i{<-lS*Ek7lCg4GXKs#m*Av>lS
ze?efc$omI6jIzRF2@F|}!@U%x535L~N9j*8>ieF!*h&zXAG18K7q@AtJ!^+CEj16>
zsxmo=8RbqP6M4^nyN3jn+-@qrXQ3&MA=nV{QIFDp%G-^&lZ&9>J!R|YdbJbTZ(}=<
z2-LP=M0zt2$l&a~XFx7B84!%$DBRS*U{42asqZ_0hyW;
z0Xew3Som+px&uNX2!yP0@tKNJd;_A*;^uVQY{=vO6){}81Se<3lA#;+_M_^<^j1^Q
zP8DfG(e5BwBc(3)K
z&GM4IYx!uWmdHy5FMR$kIX)=qK;}?55+bd|B$pg%?6DB%i#H{VO{pf$LXud?HCp#`
zyZ!L_ZpuC-I0lN^q1XN4VV7^Hq9!5S{AAWjGg&MMeU~e74H-464!cnWPM^Muf#L*{
zF!$$|7Q&vM&9bKGGKA2LD}|4NsfQAzx!=;xUT
z$FJvv_a2y%O%lt4$5mH2*Xsm9s2Xo-lM<-iL~kO^1Kqg)xiGUG$Iz#N(IP2fNmakG2e?d3LkXoa!wsrxT6
z45GW}j@6vav(
zJn&4Dukrfz)G}n9O7@5Kcp{>Ia4Je+Q+XWQ_nABO-Z>o8T0W!+!v3;7k-q1NdQY0H
zPy%&Ch!15|+sGtWpz8n1Eo$(S^>FZ-|E<3e@6-EVu*!j5$jA>l&$CryCPD1ea|&8H
zZ``92OS44Svv2Mm#g!{RDbV>tPaQ#LaO8DJcs7+9{eSG;RZtyKqAp-GNFYFP3GNQT
z-6gnNa3^?hcMBHWHMmP~cL^Tc-QE3?Wc1vrQ|F#r^DtHYw7d6OtkvBcHZNcOe+4Y|
zKtD;Ap{#9n{8>h*8Os!1Hk|Kx>SWpTYkH87$rkZ{!ES#6&VRvf|61Pu->}=iMZg+<
zwz9X?H~ftMGMP@$%G}CU!CF_}@Xx6NBR(7ZpQ&_$3h!S|eg*0N&YYzacCr&yu+z2s
zGgb6uDm%k3?<SeA8^UfGUh;*1-Q8a^hJS7J>%;hUlOm?(c80buujVfgNXSs%%D@nx
zPSViQ*vuL
z0_+xGw*b2Z*e$?r0d@=t0R0J{a)Ex>L8b_=lEe`L4cRHT0Ov^Vdom|Gq4
zzpWo6iRX(HG|#3VMWM*briJ|-64JHX`fe%s)|weJLu?>1>HLQao~1<-6Z(+
z4W!J1Z%&}ts2Tyb5VxvJ(2tgNPzVNuxKP=+-5V}*ej
z?QJQ@DdN$E)*EPQifUK~#DlzDFM@%tC3vr|Wt1$%z(r`-RaPw8dhoiSFt{aYeB{R#e!kDBc+*EPNgO#HL3)
z)*us{3^z0N5Ya`C2h)=ZxAS|P0{e>)IdZ!wA4w^+48?b#3Q$++D2kx(1Nm>&4~^s%
zRx2V#dzH^4#HAW7zO8U6S0(+FJbh-e|B6e-3{NgwoNB~bkT@SkNz&aviu?mRC$ur&
zMIPBT)jM4!CD@Rt_Q#AFF0MhY*nJaIKI~cnlbIr(NO0q^RF$XYUS)3Iv2tlZ{i}5y
zc!&9bqLyz(JjQP?Mw9H)#l$2(@#$GO`j?(~*w{E2I?A^W;J(jGPgH#@7sZ%=|M_|q
zxuP77>`BdXV7-E^DWnET_>nU0i(tikEN6vP%_c2QlG`VfjUiJvXgKWQ%Tp4ZblBeM
z)ScdI$kl_v8ZO1>I1NV^jGS?Zg2__;spzCv?Dw67I^W>|`MsiGAg3q?M3i9y=
zORPzHE>SMfKV^V9;;}Cjx5g)5VYE11@_zcDn=ZTM&P?LVa6xuQurS%}qJnE7%)GDf
ze3J*KWeg=%UM`l{5JyMKT=8~eoQ!}`(s8_vQyS_=zxY5#*9CJliR%c7LBVFRw*;Ha%)>YvCYM8C
zYLC{F8_$aOTmO6sMcj~zx#OZ<@JS;!l+RM+N5WXW+1a7$+euDbBb+mR=TMlt<&L-a
z_ku(Pl%2Nr?q9mv(N=vQXzQ(f*Ue<(f+q6WKA-Px&V<-gOwmo2qDnPW2rF@d*_cG8
zHKRXzg2916-i6Nn-yH5YtokLe*qL7%#sBKE-ZT8&Wx>-aI$OU;ELmM+!(Z`@y0(Td
z_>7J1KTgB_Z>!(m|8aN!4h_ffPa5v`M*kxX_vhII8V=BKfQAD!9H8L<4F_mAK*IqV
z4$yFbh66Mlpy2=w2WU7z!vPu&&~Si;12i0<;Q$Q>XgEN_0U8d_aDavbG#sGe01XFd
zI6%YwqlSx7(X^UpL2;ihTUnX|t>~r;1`7cxnt*?&Y$y0Ib_?qBK*7Wl*^0iJPJ{$*?v2Q-qAcWjKcN#z9xlTXy;jPD!vJjUl
zX^>fNlvy#HV1DMSM7|`Oi1Jw317Cw62GtMjMB#U)kuYE_#ukX@)wJ8eM}bHt5yq4{}UTwCQvI~!Q!psysz=m1%&7@|Y~IeQ^8ivUiLp-6AQGbLb+~Y(jdOfV@6sXTNH$~%5!EJ7yD4ZJ(l|JN33v-m5!riqMt&x7H&H~h
zFml!9{@E4CG=ZdZ{+M7AL9FfyFk*hc30HRf6S2%Z9lsTKb$E;{Nove&yS1QV<0yiS
zOMFZ{u6r?j!=@yZC$cf{ey5h9Wp`DS^X1a-H*Sc}XgMdmZ806wbpjByCxLkJ0@Lrm
zeCYA%jng;|xxG(CQPDhAVR%+(a(@3@?&JyieQ>Z=xqOo*+WDsZ
zx~0Uis+vy*%{1SdkJz~I%_iLn9*TfEZ@i9eJ(U*CF>6`8_KLcvlq{BH0!$qvYE32K
zMObCh$##r=@O5Cf{Po=8H_|1CFwaJ(q3&-lXtE+%izlkC0H$Z2Ldti*R=wysGx*b<
zb-#FTST|g8Eb-9gH>1Prnm4;_(q;`tM&I5%nUgW|OWF7$W?LyFp()5Q=Xl&o?sHqk
zINzpCsfd-}nDQ*-nZlHmqyL~CwBoot5!D3Udc(JU)26Ln
zakp)~P&Or6;i3BOjkEU8h&zERnRjQ=1CL&ULlSSg!4(2aSsdpbJ|p(thut)3b1!{4
zlEznREIV{)=CEv3_5%|G4?x#Fato7=DdeiKKHqzM(6758
zRX#i%+GlE;zAow=LNs{i%cZRoLtEN?uA_Yq_w$3BsQnj&@*BvpJ59H{MwHsDQLJiN
z7%myA1I80KlYyQ)E7e!i?9rr2a1_T`~TVAs)W__9;x~qGv
z;pRzo9KJ#odfa+$#|(=uS44FZ-Hrdq?TcAJX|=HsTQnA{U;ptWm2TW`%~T9k)gP8g
z$IQu&oT`F48+_UN+LCT51E%J1d+;3h=UBPWPhKP$71cY2iwyFa-0|B!u?i~5S)KH&
zXV0ML<9F^}pDyC4-c6>%NX$OtQ@V3d2~rJ1%Gd1kniQ-P%qgWUaNTF@H9UK{u5x$c
z9et_g-A?(Ok~SJLa_toD;E)i(I4s(_z_jMAE#Fhua$m=VH%O`i-;(k=JC+U%ub^R9
z0*vJF$81O>N53Q~YCu%l2B8~1G6yk{W1+J{??kzue9_tk4-K>6V<6%rOTfnT(B6%G
zD|<@BmtvV$C94dd%EKffd*oKdQE-ZkvG633qd&<`ufR9=2-=|Ay1S_2ebUq@W?o%i
zMQF>tAW`?{%S)C_J7(v+NEx3^JLi5AV00pn;qpdE28TtIH%V~b-zG`)Zo1U}lQ-&u
z-m2wsP0^K80+`a&+Se_E4?l)YvWh6zJGzfd*da!Kt|S^m&YB8P;5tv~9v^hCw{#xO
z>b|z0;XVYdU6LWz%(?vZVZX}E&SX#X8PpCc7G+>ECh7xdx*mnlJL7x#wx-h@MCLk_
zDBSls(mkb7iCyv0`UF2)rMEl8{SdKo=&exe*2?LhW^luk9dN#O<#I2BCEmHRORT;r
zPyeYc`k*8E8dq5+TCGq-Eu?w+r+eHQ)P+_$iD%z06zH?O{2Tp!wzDir$ywwr0miEEf()3FYkX10slnx{W~DwOaJ#j#NxgGhYs-nJ{Irq
zd4YfV1YyO3L*r#4h-=}ykIyOgaN4+Yo{4oZPB{2z*@?rwap3UKl4mbL=CzEup`)zu
zf)(wfqh=N{ZZZe&^QQ}GpF&)op7!VWd#~}9YOGq_pLRW4Tg^v2U7vR^Yp<=!v_0n2
zT0LD|pI4{jJuP^7pD#AA4{sOaYisGY4{yup@Rn<~@w9m#?`j^;9*!2{pDlUsZO?QE
z?+Z3)HfPc9xhc^|G;BZkJ7@$k|Xt{S+xpKs3Ub04=i1L@LR
z-Q2lbo7~+W%iZ1GU7jSqd)}=Vlwy0w%`L{QwYV!hw79!F->IU{$dn6C0uT^@fB*yp
zARqt%0SE{{KmY;)5D5fGH}2;U8;}7Ozzna^CTA$6LLnZyFU7$Kmse-c4N*W;E-6
zYs3^n-FvdUtymEfkv7jAM-Vj8Jt(MLp%u6z_-TeQtzHxl%1_kDBDMWzb_6(~9Nsb?
z{rQf*DBIe-hC0LP&bn8SE2ohD#k&re$sSPoEu7uFpE_3hfld**)%IdrZf5IVUWduX
z^yht&YG-}CV6e^b*v2TNxTq>3cSr(D@#RPw{?4L!oPO&c{A|waUm+k6{#@L4xd%T)R;&}sI
ztIawnsH;BF3mVniwr5OVu&WQ=HHq-uPN00q;sCnps)G%5W`pGoNb#HlM|1{{LlCn<
z%7tJ8_@xcs3S|Cwf{A?STt4>$==eq`V~F{Mo^ZY?OV>ztg_mnwd0b~f&>jBS`-cC+
z_v%!n6b}m=M8mpen2rJhLGARR7B%m@$o(gsftMK+HOr{@;8{nd`hqK8J7oC1SKP6%
z11MgW>1k+3jK0bhoY`Y>2qL>;;8T_xqQ0H6trur?5(F+R|2cxdGL$B}w-VVb)CHgT_I>G+L8Mi>XJ4>+_>q?HWt+K6rLnA+T>5
zJzE`n1Ac;Yqt_VwHiQA+_WB^On2V@Pltdk@_HMq1?zu#ZREJnNrbbSnmNX1Cq_eVo
z@+-VPCB#22vwnc>b)=f3$w(}neB&~*bZF_4#-@mCke%6}>QvG2&E@3Hj%vw;7;lnO
zV?i8u*tqBzg?D|`ZkGg$v{t3fSyad&uD!sK+SnT8VzYDqR=-4zq?UZeu@)&Eg}S|j
z=ct5qsUXNy@~mnqqJD8zcEwb~tm+rmPMu;+GJ8eyo|@yygaEXPV_IaFh76@zwd?a9
zm!a0Aa;J>pZV|F?2{R_WdisJzxQwfds^-P7_1R@BP?N8kMJxrs%s9rwaBGeh&KKW1
z>#u(_Z!pgJxa0RNbEzcc@W@`kEqlkF5^AwZp4LtvBsfdSym8+zrPO4y9XG}
zyEaYzI|F`1)3wO={;qd4S|*ATNAn~>uM6f@R3JEPxj9rUqBz+!Lwvbb93lZ@VW7!g2|7I=j&V0wN}1LSEm!VN`xK
z_9=c8X76oGn2&?PsyxylKdEMV_Q=ji2_P@p1FMkmGeos|pHCSLZ
zxS=8Z<=F0eOT&t6*@g91xx1!Ox^FiGZBg2;RmUQwIZo*3eJZ
z1}ov^t3|06rHaE+WZQ0wbDRx
za7(Zf(F-=V67v<*585!OWwlse*)822@HKCG8=?i_1E$d7ALT*ItXR4V_B?H*u0wcS
z`2n3!wId{d4x(^j$xJZA_x7x^TB3&WY?giig1H?*WgQlm+>SYOUqDT0(%=kDD#dBA
z9@%OvsbAw~s!WrxLUe8Q2gle2eXCSb`@IVoINx^%qU}FeJ#$Eqak)iDWzOqB&T$fy~~nB8jVV%D72_%$gWyJ8^+maH!HTE
z_HBR-_kd(&EcQ#3QkSaOr!SKwVKTlZRJNn3Z!vf5KGCnC%tMG)b&thH6b6}RmA!mJ
ziG7!b<>)FbI4C8wce38)Srth7%kNp)PVUQJ<1My>Lxb)fOrL6lTufNf1Gxm^`(7d&
zbHNJqs~%H0;q!3tQ^RMIfIZ%gZKL0`eaZ9a0xoV6%1@0kaKgVWVWcFl<
zm)la^4FAdiv7#)(8bYedDV_EY-f^kl-6U{=sQI&GQSFUmH+8xj7}(OOmrLC&kn*pW
z=!i}`Spx<_jgFG|tU%s`AuEaYnz-;8c|EoT*EAV1Sqni?{0RDl?W7^(UuKi0ej%6l
z%|tXAiL&a0mgx}aZN$SP&ew`n$*wsFk2cOs(#2!y4>YIX$5%Un-@N>H7dTV8io#+A
zgh=vOjEva3wDwoEk)x;1KZ_DV&aZzE_=58~Eut**=XOYl8f?fwL5l-~M1kN;LzS2+
z9FbL
zV5s$t^)y57ZYdG$wDt5@{Hcgr;*omm)S$U6()=*te!I_5Ho95_XRv!x}GE
zrp)H<-}*k4t+a=vNk9WLj(=KNeAzdA2~9^{&G`;l{Q!fSTNcN)%N9=%K3wQ?$>2{c
zUcAh<$p|T{GXAIE|KD-0*qgf3_Cq4M7uG`F*s1JvkDTD~u7Gq^=NQL>XR|FFx3Kd(
zTuwJO?gvKTMbv69Js&^DFSl~L%`|hB52JNM_fA|+o=uO->?HY5O17Wf-Z{2#nzJE#
z>zaMr82E6CF-R@y$nyF;-L%hAT5Ro*n;`fnf^(*x`A8cD0jh?AwBwW?@$eFI6!arB
z{AYo}VyJrt0^`&`zk@|au_l)SJ)v5C3Fx&xDt{0f>-i_!-Tq$HvjgTxXm;W;jX3e{
zS@~V&_;<{pBXNlXtDnDrj)lm9v@TfpTZ8mA#Vo1Fta;$0WEaX)p~5+1oMu;%+rev}
zN|iEnq$)V{Nlz@&COVf!lw%1DDi}H}fx*YsPHWxQmDxNS7If~Sc{_AXEYe>d@!5$x
zxwCZ3T0&cwu^$Y^MK<{MBEA_ZPKhU|?Wj{=2pQYfJfmnzjC~b>x4n
z^`AO&`u{b&{#DK{{}MhcZ}q!8o&BXnoKDKnz*JYj$_ZcNWsn}9nVlJ*jfoLo^JPfT
z*2?A{#0K((WXNYQ`*(s`dL5hL5o^+ZO+uD#=~&w
zhV?_K29$4{$;oyt^;PQFLz%C)vN(!cwibPFUox~jDnxf=
zXLpU?xDsygZI-Zwia9brj#`i_f#0GvjfOF#JJ=%a|CnNi^Etx&m8tX=+P?53@7^b`
zdO^lO&4+NOxx;sHTMqb(OG||HhRZ7yv#!LBC`lzJ6IguTieS;`fr<%5Mn{es__!pl4BD;oHJJE9?M2GsC`MW`WGP
zGcQPp3CZF>55f4Fb#A78bX0Z&8^YqCyiqE#!$J=VfY$)L2H-USuK{=sz-s_r1MnJv
z*8sc*;57iR0eB6-YXDvY@EU;E0K5j^H2|*xcn!d70A2&|8i3aTyawPk0Ivaf{g3ea
zn~K`6K5~!gvYEUNQ0he2Q!#jO9uz^o#e5b82!9a%IMYCXp~APZ9FLc&?{KSP91T(Y
zyw|IZZ)VVmNoje8k=gooJIL&R0`um
z5{g4(D!jUfzNnA(^D4DBMr2187cg;p7TYH2OB8zxpXHXde@mszDp(y;|3{}uBfuD04vji(&ePr5SfgMkjcj6loienJah&nN?LGYJx
ziX$4%1VX}KO|ZT9oMOkvw5q+mIdZXfxW}Iz41Z*XPPhe^Y?BOo9n^-%^P|py5z92+
zK=q`2Gj6|q)?jE>iv7mIn#FK?+t_hB8k^0*#>W0LH+`6;WC=;q>sshKL+jW#!{drR
z76mrc(0r~927(VU)Q{LPUL}!bx{nbR-AyzY(?&w=hr2G;wrb@E_7zLTl?c1(;CMn{
z`@wn?h-arW;*i{wN}r>0mKoz{9C$GVLJdA0F%)nbYD+!bOOt69F3qM026Um*){zzLd
z?Ez=rX&<({04Jm&hgCv`JZq
z55(WO#gRXzuB^bY-6qz!AFvlmW*3}fgmDLY=LI9CnQomJ)Pl)4t`CmcR}!T$Jq
zqI+F=ZJobbUTWbvyl->MVzhei|HBjlc2gP;qX!{G@4>y|u9_}x!b}6bi^7%injS?4
za}v@5gf`qHPClZ}Qju;@Po?5`wvw{Zb_+G6sp~NjpX>_WZa~<V=Lz|0{XJF9mSX==VM
zC(ay)5*jZEiit!fkni4B&X_Cns%smOHCN-v5$KSA8g4X5Nn*Pxk#16U9Q0{44ujng
z6FD(EAX_0V8nabF3Alx>qK#6P2EH;EbpjV~{wevkE!E_tR)@ks)d&nb|JcUIE
zCa%+jd2bUnTG73El{)o%F$|L6%3~P$BIPz@B=h3m){@KEaoAa*ATSB`W(@mEChFI2;{Qy#iPKn+q@dx{dFxYRFjvV2}(=W
zJT85CFbvNd>2}>XTGF+p#)-O*jY*F$(*h)P!S*`GTbm_y9}eM4%pMCHp39ApJ}ObdkU&}Cwtv9{e|fXt
ziL7k&FJ#To(%{z#(=Yh;>)=043I5ka*8jB(WcpQ9|L>83O#dVUe{b}cNB!T*z!!q}
z>xzJGb|8`!kb!^<1Y{r}0|6Nb$Ur~_0x}Sgfq)DIWFQ~|0T~F$KtKipG7yk~fD8m=
zARq$)83@QgKn4Ob5Rid@3SCC^k{q-JWtew7Y77T)7WN|CUSi?
z;DO~hlX{539*K#zl#SueA7aKJK#Ix6elo}eGct^c&Q1S5DA0SK%c`RMjS)+cv?>~1
zR}0y&+WI!XY7JBJ(@PDyU7SpZuf966p`LtB80v_QJhCA@xox!0ZlBLFjzM*#Gepl<
zP;K_UE)ewzVdJ+bhD>s{KgmuJxA^2p(VRfv%*cMlp-uo3#-y=BrDCgD;e^7Zq5nRC
zYA}pqSY7V)ywfk3@Lm{Gie6sVycdnjgP#;sNDA>V${J2VNnUJUeW>U)UhA-=w4V4Pz399$v8cQXnbhBe4rU
zCSC3A_4-WZfv!}1!b5(=l@)V
zcusfXqa#<&`h@NS8kG#&3Y~5J;P&42azuTBvPgTxGyUC!O2(nToz`=FbW(=7;jU^$
zNg29liag6q$FNS6*u8QrnSRD}z)$sx$~yNPOYP{p$%VY9x8n6pFo}%ZbS?E8##uK$
z96_I)?%&TH!ezqYqdTCUbQzdN+NP~>hvi~@lTur#iFC2g@`&EvF?LGwd>lFVT
zXaAElWp6o(&eBvZ=%T5I_7|7)f|kaj<1VEu+UCWf$F)$r}w3xM{SgdwO3$e!FZq`5y0{%mK&S*WdTt(SHk^)HH_
zQ0c{NcpHw3_&BtGIGN?z;zG9MVRD@Gx^f2LA`!
zWlEVZmx()j_RW4pkCtN&>9vhRn0xo-TGadV(`#kzylHH{&qVf}gO!ws4p>j6nud)H
zMRGOsD*L(f(-vr&Xu6~o9Wr-{(DSOi@Yk1b^l$gB?5B9L$Q&N75viim)q38>w2_Gf
z6wmJp7J>zac6bPg)Nr2G%pWH?*b}6U3+;&0ar8#F*V`VDxjG#j@p`CJKL?U~)@dCy
z;I+^dse31wo($V4JY3XiWrM4C&2ll{8!zLgc&$gHx>3mDvQf>>`m1)xk&h%gWkGj4
zDvBrjq)}Yq_Y7`tHmE%vXnZ%t`}D?kZSQAT-a>dsHyriq4Ux|hkxA+{!GfufH8>js
zq3U4gAyXCAD`rFU5l1UhsC(<>6roy!A<1i)jFgq3Eo;5|kB|4OmfmnBUASz43{CTv
z5F$-WH2JShUBb0x29VZ}E_)vfZTYw)BPlUXVW)|3S#Ut9LHOCrh!7CV+Rh~_zQ%HI
z++MIxecRUf2gB#HOO-m#s89HMI9M;jj(mF_$lkM*M1M
zII?1KDOHhlSk4DK`piQDd5qcd@+QbDhmZGP2XF551Woa^eTPvRDdcP4eO*IoDV0VXy-YvFqS)WG=XZLmpyq8Wk>Jm
zRhadie6$F)y@6uIKtG3TKlz&3`w2|GMo<9+uUl4;1ni}I@G_9sH)4ICL2?+fY^Fm^
zhNjUWR{9zWxq>=Ht(#5K1yP{pSBDCWa8e4hz!DI&rd44(4TmGKZ(}dsET+1`N&$1Bbw(7*8}TE}2_iLy9Hhto*1
z0vRK6w%q~s_4jogh|IaI$#d74gx@M$bevFPU7iWdMB222!cdbV+Vg#LWB)kwxYfUv
zYbp5t?K9V0kV7GoHm=DHpR@H!pk-LgPESh1?o`HP#U+?j`~(yCO|D#g=UW7bV@Wv4
zkf6y#RpF5d1+0g$tg0PI1jjE`eRc`Cu6jHty*%$puS0w8HW$kbEVOE5Pr1270&yhu
zi{vErp??afJi6Zt>o~IUm(v-Ax$@f6
zSMb7uXXkr{V}-{QbJJ*91t=s^1RKzhD+=&3{&fROhGb?NBFvPSG)lUzS?q43;$eIu
zCC@*n^QYx9MRIbm;IZ`0tJyzEs1VM9gtsYiZ|v$QL?o0C1xJY^PWg<~tQaJ~2D6WG
zry%dCyA=fKmxmA{ue(ec@%N)7qUdi(U)w#|GulJMml*67(6^ekMW*vzqw7s_O_uQO
zbCo8h5;NZ_c!7d|eiDEFzh&reZ}MTFDMdar|-#Y~%{8X2->S`G@fkj)_GtVpa@DC>!V
zb1@*Kr}`Eb*I4jYS29)|d6!0_!Iy>zmfdoNfM)+Hi?#iZani83An~&16C$gTAuo^Dk&MZqvY`WagZ%8Dyn?Y>q7ttCqn2GIz{;9SB$5x{q`@U1}3
zq{GKnar+P>YKUy09OL2j6fbW!!1|C3+tkILtg-7*L*|P?{^Op4KuwCi<+R4f9Li1Dj{6YaRF5!XAQ|
z&O(po(zm=-1VcrSw@i-jS;DtVM}EkKu@_o(owiyom~EV(W>alJKR|kVhB$f}uPNKP
zeet5JTy!3%)p+(dXV|)xs}aK5VVrrt$m+)1WSl~g@}Y-soXr?tYg&&{qT4kmWVY(q
z>M2S4k#q4lPOlQB>d~d5xmlI_W3zPp_4VmmLMa=sZPpbpf3cq|Rmp8@{^gP0#$04?
zkb;D-#IO{7S?@4`Yv^~;MZ6d@7bn${>xs)f@PM{QN%W=D3NrZ3OzB1fs9i#>t+n9u
zY^hzn=ZhP$?QU&o=L?K|oB)F)WjD6ssam~uvUZr1;Y<~LPn=@z+BehTKRBN8Mri!{
zhF|YHE~RLgEb0s1Wos1Yzq>k3iqG4Al3Oe-u?r-tE{~J3us@bq-8KDi^m(C~seRt{
zhyLgqXxTFa2FSMdaPPm+W54LpFQdf%o}TgVa_O(7#Q$lzg8#LB_-}ZO`Tqxu{aNMT
z(LT)b&tUA=M*kx)_6NcNU=4%{A~~xD+=i#rP*YQrK`GUY0=`m+&)YAcHnqRP`Y*;^7jL_wPx3
zJe~6Hb7CK&yKmmP*~acalDM*pp}z-D@SDX#Z)-z(&@Gc7tx^>v>GTSuU`-P4Re3*5
zi#BF8cFN4j&VF=VN~<%wyL&54R~cq0Xph$EuL*JRHWeXjy`4|M99#?zm*~nQd;!Y*
zwPVe|YUh$j`Irvcy9fE=FOzF633RxFBfeJH{8wM~;Ghv-C(-nDqr_{!`51>nf*_){
zD~Fz5xDHMbsj3&I&(EhVuxo=akVM&n_fZzrUdz@diZ}pXw7g7Q>61xRo`J+X8^bRRH9~FO{kjulQ%RZzC!TVr)!Fl
zs9RNtU7OR$+??tj%^~zx3D9&?k`6q#adz%mAG588C)GWIF0lVDT4Rrp2v#rO(5+22
zLHO}g!&UqX2V(Pscvm
zBJ)kp=iY5$-I2|_U4vlhUHYys4AuSF!;sL5>q$xZW%-0hwWDe04j<#_rzk>c{3wF`
zz8{z5=|P+aq{i$|8hCgPq`Bpe=VEol=2lD5zPE@tJ*#l5yLV-~3tYriBqEt&v(HdT
z;;(0zo}&o7+WbB(^SD~LkzU-GdpH{V(?0TpH+i6-0mP#
zcjI{RBjmW-_a@u<@DtUYn)T$O*GuFjZx;ofb4+_Twf0^&sds~P<+&Enoy3!#;OE<)
zxl+QBZhO2hX>R#(0Z#Jj$tUqh*l0)AsW}LrYJUSV>9=mwcRDz(UCW)}R*^qKX-^ARfFdRF})#S)2da3ur;|5>J
zQJ`g;cuahWeL%MJz$Ip7)Tn7X`@s4-GdpH>F!$o;@iQ14NDp}F_P=0%zW~{9_Q%Tn
zV$l8?SoYVF;r}%D_upm4{Us;vPiWlV-Q53MW*qacqUC>2%`odf5y0OY{Z9xW^Pl2l
zfB*sn5Fmg60R#vjKmY*(2oOMk00IOMAb
zD4+Fqxh`4wyj*`mQ6NY}bqCxL^=7CzcLfryj;(wo=RI4(
zLzIGJhjx#z*2%)RqbSnrOZ0N&HB(+O0~L%_!<`XHnveqyVRJ-7#Mtj^1A;%$3=g7;
zO2-k5UjrvMn;|m;V~Sq`3P#sv$)ak-2_cSO6FM44#U_Nfy~GHX$D+kQE@_VWb^S3r
zTUzWTJPtZs(bGH-n!}?R9+9^17(_rco4IMp$aDluhG6LOcVwKjP3cQy+|W_#A(GR#
zQH65<6?gRujHs7ovhDbYsU|`Rx*BTX7_{6W5N8A8V4jhSef!v&hm6ln8E}`(+MGuE
zlyNVMEwS41#V3B_kT8)N?NtR07Xw8m2AbnqNDF0!QwM1f>Sco&58~@r^%XZKM6gTf
zjT?=ut`$!W3*6?@%XB;>Rl=QqMEzM`tCOmN39R%_jttjlT2)u;ZX*Q<((8N~!)lIk
zJl7vDgE=H1k4!|HuyaQ0EGlOXcU+t1ZM4d!=8dLr%>0E`_VT)UwLS(3nSM!bD?|C<
z)`dq~GM&gPo~!oKHk^|#ipi9(eQVgbP-bLRDFO1VM;&Viag%S|=81SW>t)M@mC1Q|
z4!Y?a-hTWMBeDU4e1K7@2kQ;_65F1qDNZ$I)MXi#@#yXP%)EPt!>xU@R`8t`b+=}7
zYZ*&#=UGMJ^;*kZX?IO2ugZPcjB@(45dCW$G;hI=Klm?r>_V`uC^^r1nK{)0wqs&T
zOO!SIeu|=MmoY=A5e&9KoWkzNLH=NSCP0v4dhnhgqE*i_e3yk?-jAPI!FB0;dsQ~u
zn7%w@>?z}hk3K$bmGjP}ziz9I3m0!+@cV)^Wfo68%t$u{&BQpCHGaCo!JBEX3-nI>
zvpg4#!--29C5wssPV!D}p><3>*y#{{u5a)kJ
zEVZkdz3cP*TG%IO2A%N9IQ#ql3hBs+mzUG^$vL%BilI%M;RK^GH2TvnJC9sKcHKvX
z9~>&-{SF|@w({F9Vpr^?+#J+<{!wWJ8fkQ<3=XCeJEO1RY^(yu()|`zpY{8$a`au9
zD&R#*J;u5$Nk^RY9Pj;RZ>$%3eI3v@#!+ldU8s7V?e|rTKXCD92D9UMbhK)B9eavZ
zyrmgq#1C=ZMBJK3$(|4;?xnG)&zbiTb>QE$d$qgkILoaVxQ=_>NQwKSQv}Y^_oGLy^4u~D67}Ec3*nSJB--eCp{R^V{i(zAC{CkEPJe{Jmwc$%A=t~diO9QB^uI)|`gZV5e*MXR7GSRQ8wd)!(J1qAyd~8GZ%m{hkU>rz)doW~guXdr@%)ea2^C`)8f@52dnnBBthc
zhPL>0BIYm8LC8?w%HZWuOBz}l+nL}q|LIr-bQ+-30G$TtG(e{TIt|cifKCH+8lckv
zod)PMK&JsZ4bW+TP6Korpwj@I2Iw?ErvW+*&}o2919Tdo(*T_Y=rlm50XhxPX@E}q
zN1bLDukk6j7vAf*Rr^${#{c^^mpqJj5B3Mx*YGSGSr;AV&5ID6vp91X+bY@XO~dGL
z`mJXsBH3eNF8ObAJPuD5T)XN_nOxMSuU4jrdZhGAIXr}YIU_Ixvr9dmlav;mUWP-H
zD}~ohGCL3kdZi#otcV@H>RdA@s%K}}Ss<@mZ>;C?8@DzwGZ#L~PkIZAItaxx
zzR5`#n!4X=Hpio1rO)<`_EEfD7x#`hSkL9FD%Iv-43E#1W)`6y8j4%J2e$$SLs;lXWz$@=_Q
z+&?|w4Fld;Sh|mFeviBLAc}sz4vhBKfn0*3`5i0>icp_I0XL41ff~6Of_Xm=@tv18
zWLFjLF(@tU@sdBtPn=bF)Hwe%c&JJ8ygfRyy`R2!dAQ$R@0H+~LfHML-|a+z(3Hum
z+`zThw2RWOxKc3C>{-9yaTyg+%lomVW#Q@Z=Adfc(NViO$28sZse8V0&}C;(5p(wA
zT+S$MJRL4=Eds(|O&~%%Yqe9>C9VgFQe~v&ZrFo58g&+%t#+{KkaPXR>gxK$>F#M>
z@Ah`y_WEvX#K^Pr!{$6*3-8lIZ{RVlHcy{TM@sQl%GCzV;OWUzzot&)zeW_e{k#gShyqceYk-q
z=M%%5fp5=}y{+LAreclq{F@?soAUVxn4K-}uP&D-yTh^4F)_S%a)o94?JPru>q&))
z)#iDYwFk^H9vgETsP>JiEx{H)#!Qx1%^uU?(On}+_+zn{Y3+-B)X-KPg@s|P?H{4$
zyQ9VF-)}5QF7w?g$WRb51kHfX@79uFsyRx0Cp@AzgpmqK<$dNjZdI9ltqM}!vYXN-
zQhY$?18Qz`j+y%44M$oD#vMc=W}-35S%^Z=0D;Ni4T&igX()n3)t6e#_>f=zwo^@Z
znDQqB6PjX${`V?hNc|*7X@{@(Z_7azTAM9I?@!1WTNZ=z@wG!d0y*aj72GIX9%yUP
zaB&@=a={)T@2p@WFOMyaCMU;IAq?3Qm}DLDrNFx5GnA`CG6wj`VQ8QN;fu~us9agR
zaRjaS$Rg>CYDq3Wm`7VaF~<%Zp)jf~CpL@v_&8K5N`u|KR;91Hh3#$0b(&_?MCXf(
zWqZ8{61(np#+In=EHJ!naZ
zd6CnYQf`oF9K<_q4&mlL)L$I5tJ7IZ+=f=0OOKlqYL&OBT&YWzAhloyC<-p9LHE9}
zY;aR0v3|7}-~GvR`h|c@r4b=9a(lOfV_OwQI|e;t*6Rp|ctrd_j`*?f>sRF_<`$C=
z1Q+u4i#J<0Y3n}70e*Qx>hTb3-raj9!}6epfzZtiR~upyp&dR)amvmnJ7cQX#X`nK
zXD8IvAsZd_qIq0IpJn2EIk_^Rk}E26I6{{~CF!5(0>@z|>GJypC6Q7LWzy{Slc=Ku
z+d0%Qq`}1ZCde|Vzj9rf&6g0i57;$p811VkH0FG`D>`%6U0zqClVx?LSz$tzP?Sbr
z#o@^`=tdEHo36${B93wnusp=c9st64=GQ
zez!?d6dI+dq*|z*tnZrK2k~kN_c8LEJH`+yA!W_7AxI@gnHuWBNgdT0`Ti}oGzX+=
znpPY7JUM?YD_`gib$E7q7(3)o+M|p*Tj1lhOK|pmg_%}FnJ64G(!`_YlZ`Ni-_*h=
z6lSLr^jV2acflJe&-3v7Av6#2TLv4B5)Zm}Yl!JNg$#`vH8o=(hK#*_?2vVeMK-?U
z4bDh0Mq$-_!%Cr3R6rdc#ivaIldBqXv`!3GVo^V%_VZ$LBPLp>Pc6zhbsRrUx`>+)
zrdYRseEnt>
zr+#KHIfg%7p1aNSqg($EJ8u~j$Kc~S`mQ+TdDEBW>?22FGnR?S6^63(
zpT=ewhL=?~u-BP{VcVXN|cauHnDA2
z(`sHtb=e*Lv({QwT>r>|6c3bugv9ycG>wjdX9hF&h^Shq4jO^zCo71I4^c=c4BbsZ
z6!K3pe-jm16k3Shd_QCo8-m%LF^0TpyRT#)g3jVF3g9hYrdjN8+>h4l9SMx9aP8;*$T|B*iHR(_2P7tHhT&S76tV*V22e%*-dwP9Z?yqnFZb>c
z{07S%{4*#X#9%#bjcn_~f-)9F_urg;P4YT|cAo$MVMpz_yl=7>497%VWZ-%J8!?!8
z1cdNj`$YTej{qotqR#+1P@!uU_CVVADqsQcIkqQ-pu4I6w*Bkh+TPprKWwtHSW~@t
z0DeC2m;RRx+pql&jQ1w^6P+KeawOsqu7P`=A^H&!Vbwr@`B4gSlcOUeM~G2gW~F_n
z{EuoKkuy{%&BPnw9FXzA{Pu~sARsQ_{Y1JDD*ZRmkRhPEyZa&VAY@mC6d+R?Cvm^Y
zNByh)XnJ%F-$o=7
z03d!DU@^?%hE)+CxY!H0Tw5KmVKoR<1i=pAD%lbDAV%
zWcWS7nu4#-nTd_XitUz(4UJ&SyZxBzmSB=2>v!m3_kCD}%14rf4gf(ls+oZkt)
zPmMf({rACx78)qK$!``r2kCW{y$r#}zm0>B>R`RCjg?jx%~
zdXR9d)LRuw=4H}+2BeJu2k_dkRiv~1a~@`*l>!eZg%sS6lkgynm&uuU)Cg)|&t
z(k4Jsr(AlI1cj=Z0SrRi6L!c6y$#z$i&zlJL~d6C{Ys96lqgsTXguL*YgiC2-7$4s
z01l{bPbi5eRP|mGBCO=~21zb}MF2Oz8LGRa8oy#Y?R{*4VBHLVyQ*V(d3N*=%r92O
z{pu8TJZbt?##l!j@IJ+bswWmKeVhaiAAbGKsPlLJOU%m{yXpSjgZ6*#CqyVAyDzx^
z@#G`=EkX51ybqDFrDfW&**{M{GxmEqlNPbx){srW|IR!t)*>PtE`Vl>J#xgqpLzsD
zzs7L?4dnNEAw)lp=qDm*_Zct}aPU5Bu8RC~++9Bd4&m*P@#46<{yqUVO?{c%vp=2m
ztO3v2r!>P!baMt;rRcMuGurCPr{0e{a)QdQ!#qgPc9FOmdB}Ja5b`SUn112HcFoAz
zO~`cF4IK)A9v_31Kw;#dNcKSensdioWV(UiS!B0zmEiA~u-!`)!-1%|H2rfnL?CVT7C8
zfuIgI>_b2LEL0It{#dljAt>I7^-t`m)r^%JFaz`TeF{0^Cg&{EHB3sRYd3cz~=E`?O{Ia0W
zLctC}NEAj^6a6whk$DkGda1!h4Y7G{Cqm?dk;n^0s%`{vC9?kFN%J#iO^?S+^<(S@sA!v346&05mdkK#-XB
zP(dh?E%Ojff^h3aIW!@Q8dG7Hdt>^Qz=6ZVc2fjdq4~LG2s6PeRZgd0K}l#c_rv>V
zaoE<6TUc?@Y+8@wGN!wI#_)1+a>s?iE?{SDKm_{?PM=>t$qFR?Qw937KuuENPMofo
zYX?f+h_9=*8vfdN@H-aXtbom;mzcpx!>elp`~giM5tW&Xh`?j-B{~G_VT;n;frJ+V
z)YrYRiH$ATUow*@x2e~-Nyw31)ZClyMMzubUJ8KL5k(PV!@e$>3IjdU6L{LnH-Hd2
zW|YhO-GfYRUXhofX%(G!38~~FS73}KprN?0%~BK%*$Yq-@11N`^gDZdFeV2%0yZC6+3>r(`dAQF%Xg5V
z-I;R~KiG^+&znJpsI>?qYTy{IN&+23+sZ-sHEwB~@g&Gu*h~b`JX5<%KqoYk!TFTJ
z&=UL$6@*h7H)20$QRMg+;*zgR^RZsm@D-)gnhh#{R+wh@(q*PLWzTK7TW{v5z
zpjw9J2RkCKqP#9hTyjr98Y8Sg43<71LtGNI(N;zx#TqkIQ)y=AIslBTUbVX{>c#rP
zp8clrRbPT)nu=k5_;;8pFEI8~Wg2q8CvNrfKs+1g)2?rWl7NU*t^xK>4dYOW3QX8o
zG^MgP_``oPp5ZNYu^cP;q1>Wf$D_QQ!VJgv)mA&b+;$DrBhL00X4q)49&G*z42aAz
zvjrYfICPc~Ok_gaMA0%@^end4;TnvWl~)^B;!_~;bpf%cV?oNdGu*jYxPMM&pO
z&B;?5f5J^gq3pq(;9kQMwk0$NIHQ%@{2ajxteb^~h8>}FpeWVzW4}KPal42+K9NIg
zre-t|fe(p!lJLX(*ZdO}a)#^nAq=;SZbAlAdQ?vasE0MqN*SHK*aUs&uKs4vvegMCI@V9qU2b5t*oh(O;*D2xw&4;sdi
zfDpTaZLIuyx4j$XjoM%`ec${_e7R!4IUiNqX3bSYv%jW#b?(4AVbgrAJ&syf&@{(b
z`H!+;5iZLshm__tEm_GA(xk5$_WqQ$1o|54P`50f5&iui2N9O5s46<>NV1GzEp~}}C#GIP-?au2#@C~x1It^f^02y(gDor1WvUY>F
zQ!?aQ^{GT7u+#(DkB=(wN&W5zqLCr;kN<0^xH5)C(k}V(eU?5fewL7`{3h>3*}=#X
zzjv=daWq(IBF8}3(iUVl&f?zRAS4>X(|5Bim0{jrhD%P=R&f0%bcQl$D=}H9Yh4#I
zd!ocC574cRnE#QDkR8EuRo>U2nJ`k1c{bzs_lMt70$W281DMHPsj`0~M%6bxSRvld
zW}!9w@XEnIlDaBpPOJ&NqN_9GSeTpzI8+Zwb~;i~yg{e7sbpO)Mkh9!t>+6YNWI4kVh{2Du-V64^WJSUcJAZ7Ilp@1IRRV
zyf6E1LuJvez|F~4vk+zc{xvRQ+3L-l#ofMHDNiTnSph!t4P%o&oKB$zGDuK35#ub%
z8dWx19?R0JU?H1l`)>O3$2OLuI_bdC4d1hW|
zm3#nn@sHyaDd`|i?&k`!wJ&g0cv!3pA@Qx2wB6@5G6Op3huQMQ%|iV`5rVKn`k@%-
zN$)e06>rio)gq5WlD*9AJ9Cv=B~x45}ReN
z^y4UK3d|~j>hjBkY$Wpq5Dc^u)Ult9)mGFIhZ6
zXC%FB$D1&Ei`SG_)R;1S)j0|U?Ij6!rdkgsefsVwMi?zrX_0=_Bba$_cvJu~m#?4)
zYu6>A5$U3dEPo!k
z-{%u!v6=9fdct)9Z`^2&soXH@Iw?E%%j
zPj^i0!f`#qq$W&__KOggm#d%gdq}EBTAjH-l||xGipX}i+chlBnF`mO8ftkI({2a~
zJGQN4ebqADWW7!IdC=_6tcnDjZP|>vKEd9mb0&113pAGNs8#*}>^`C6F8LO^34jRs
zQb8hOVYT~!_xcJ>A;W9;Cc)p|>C9EJns)p2@inmW@$s$B%~j$xwJ9x0$?HO3R$wA=eXz}^Cn^NyRmv(MeGs)R
zqdbf!D%taVJ1JcHNH?l}`gCX|B5Dtx7I*E2p`e%Z@b;!&@b+G@I}GH1;x94^%CKp4
z(`hsuI8^VU?R7>W>#S{iT76KxqyLQz9+afcr947d9P8vUJg4!OEL
z`TOm)v=O&2`o+mfGmajlZ8`GHBOkEJ4o#_mcf?UVMlBpbs&$OuF&a~48BzB9FjCa7
zY6lWGvr^*^MyA*Uac!W|1)0C!+Y3Dxd_7HTxx{|Sk4c1))Wc*TUz?{%59Ef;SZ5vJ
zJBWwySV=z?q@0v8frv0gF6Wa=$64i49_XM>KV~>%!PwU7+q6i8%Nq#Wx)z
zSNmq&*VX9OM^4O23uK{3h?y-_?4-ehWa6g!ge`kN)lCPXna4#zKEIOrulw*G+cG;{KCXYYa>3J4-3L+OhAh^r|-BqVUO+3
z@m|D)Y**{)@w_R4$pqe8B*j{+y!wO(tsP81nD%CXYZ!$>93>~XSOv~nf@3~D(XOd1
zaIZ8m0d6lfQ&XHEtE`_V3e*%!Yak=h$#*atG%yecX|^7DCNX1&OuoG});Nr9W1L|S
zl&W+>y?RbGY^D6<8Wtq=eZ|7OT%m*t5V>r$SvG{Hp5YtsCE*n#aAYX$ngt|7R(ra=#NwDSvj
zh9QHwfzBNs59joyeZP#9E!g{^ynf*h1zRmST!#!BG)vFX?2$j%YM_&I(KyBDE!=6_
zSLz_A!8X3rH4E(dAet5Gt$FKs;2W$PaaiC~cj)BW3!|G2GVLs4=^(0!bPP9+5)tuW
z^UGAq^9P^B@p>``VaJ_8=(mr|_Wp2MqS6k09D_62GV)Z*D?GuQ-$LxqF&xdlrQC8p^gUuqg`8c
z5Xuj*=*E|zGk8Ju&$-FN`(h5;1adB9cl1M>mP3LKjMS{+FeypTDnTv(z-bh+TEqWn
zzCANexDrwEvo?xg@)-(F^yV)f(OSB$ra@cDLJ-M^2qvG{3G{07+5*ei-U+;(^xAV*
zaK+sSS4o#7)c+nfPUIG-T7E)465Y=XB1PK@ygXiYcJg*Uoi0ZczCQn{Y2;@pKEdbLsIk2%eGIMP-|veeiHA@Elz6_UUyqn(cra{V}anV113y`~Lpw?Cs@p
znQ;B};r`&nQbLBuFO8M2n`B=%o1gdf_U`(5=OD8s9<-1_jY93F`#E4a+vdsZEdtU%
zb%t2CcI1|P>i8>N^^qK6627PX?|$oH!KOKpY6wP_`AZR3x)d`y{NHPjnx=K+nM;k
z>d{5jmmBm*pOl%f_EO~%%5O&wbfV8uQAu$2|ZNzI{I_lyTnK3bCDM-B%v>CN}rKrKI(t~UfRo1
zkU@FxYzFG-$(3x^Rsq0GsV1REcpkfI96(5ik@18)GP)vSULyw*W9;}Y@oL&}~
z^s@5Xp4CBkb;MuW2}~M{x5E1~xi&?Zj4gyRIj3`r)1!i@>eOf!{-ot1+`XUGNi4;&
z)N{=7MFYLr#Jw)V8E#22twQ5ET_UambpoIy$e`l3`SK22IOSz75!Eq
zY%-iZ&|3>d-+#b+>29)IHogmC>HAfP@s)yzr+nq&soLD^?<}pD(|!=XPafJqDJhMH
zX7;j3W{IhOHtL^MQ35Y5K;eH+Jw9~sb|F7-<&!1rLMXgJlvSFs7$R5CZf;li$*U+q
z)Z&~N)UPA1K8~SuSlq1fYC2i=h%?L;{&oi25vOso@Y5B)8EfTB)AG37k)nk%DeDYo
z7`nRES9qM8aj}HN!rd58zRcLoGKz!e$nr{)(t#mCr9`0io3|C@Rb-E#7vUiKSm(D4#4o!Atwcqjt2@okO{46!*mPateOqkFKsD0ZpVO?Bp(99r2wC4t<`q?&KnJy^jHS7#vDsbhh1WQ<=HlH
z6>i7*Z=MPvG!U(iihs~@`wVwX22t$X*5*^E@G!|JJc;JnrL%vSdBewX~L(!
zzAM3kBu6cKQlAu1R|UhBq`eI*v-)DT(xnzx}1vy94)Q!TX@
zb)bj=4x^3rl;=9&eB`tjufJg}O@JX7H9_lq-O1fdNGWavW2InnGz6n93lKxxu>To4
zUTzfZv1bX;*a`?mP3n3SSXPN6lZ5RBvM}z0h}80yA-=qgs_Q~1Uo$7t4TRIBr=GZ1
z0G#r&K;+Qm$aPIXaLmCyiUgB1#8yE|GBT~CCyG_S7Bdn}BoR^OPR^VLtrZHQ;z2Eq
zRvHT9B_TcD9WBgQjo^CYm37O!daf`>kj)vyM@;TqoL^!AjCE?Nkfpx>#=T8p!*BfI
z1m*tl?9rbgEuf6zB!k_|hbALbeljr5m%K17IJ|IMvq=n
z@cB9id|x|+0n%jgpqwvD6bmIU^#n9&*ljd=9OUML%Wspq{md4__w_q;aSr;AG(?lq
z1DrBN<)uJpwK>k3t^6N!PS;N;Q6Mz^loU*SB!Jp*@?-*h#FOzyuWy|vt9=kq;$Xeb
z+he=yeE2H@o!^X*(W@T`f9pQk>3Js1fltE({@e9DUvA?%Iq01zSqnx5irNvTjEwfEVfm<6
z?5I8!isoqSx`d(RKPGXPzhFsK+!mUkGj7BZ_(u$eN#So+sSq*1Smy~&YSk?GV&o@(
zISuLQGP`9$qUZt91RLjOql{a$&t@JphFUR|VI`5f-rHDg`U&$sto>BqjazmaXpc9N
z`VVLjS5dxz+%{*vN9N_ymYauu-^Yqc-n5B7p94#5e5IZGcLO+9r^N^{q4T~U3}M(x
zVIm$?V^&|%XR?^DR~3S2qcM#`!u#vxgTs$#O;qEl#}?e!WTy>G$&aSGwa+CgH*xIH
zGwLvw5%O@svicRa@C?dQ!xlJZn1^4d7exg~>howsDUZXpn+9|Q!=s;1uO=9Ydqyr5
zL(1+{&**@w$uaa|%)$#$V81ZnO*eYNqz5Tt1pl7oT7d0NfZi}mIu)Fb#9V0sbDskG
zPv)Z>98r=JG()1*#pgb@84)^1;&sv(ahUgI!}uwMxozALQV*oqPYx?og4FLCt$md_1_@c9QMAIF
z8m1=<1EY=6+4dSVdb-E
zM=OG{91>)@t-TL7i^=`D0bWX1X{IyrIP^^FGJChfsVSTUN&gVGtDt@H5BE&_s5A=5
zwa--&VL9;8b%hHH&cd@ZAK>W!BtY%5I5XQleE4Z@@mBKnD{P87b7>#F({)>{BRL3S
z7|U^p(U`$-VKP~ZtRquOY+pwgD+c>}oVY%FB{I%VX+
z5Vall@g!TB2(8jX>&Vz6gSo9T78e3K!Lca^Kf91|Xx`|%zd}sl`ZCp6@yzLhj383p
zyvGX^cR~1jGxICq<*@v$irjPJINRUcO
z@9QcfaR`saEsjbL7DW1ta9za1Akkt@`ME%?^3y1?4Oc~&1?gmln?-GflYgvvIsNjb
zs|k^#M>S5d>I`D!k`LKtj34wjkS!`Q#4)U-V_zPzLX=d-{hEy{@#Jj?qQ#NKGR1(I
zW2=dzrwDEW*1Q{fj+=8+{(ih2XSTJx%^*Cpn^p|LB?B!Yq7fh>yI42+sG3KU0mxzU
z1S8^5o3L3cAEIzk;|j^D56h<%n}ee0aBx<5t%oG!CuHtRkS$y4RD`kuXKz*YMsUdv
z4xK+48xrx8ql-i773S!J&r4vvLH@oFk({n-abWS9a7#afZ8GimW?l-HPJxy3j`5nNTFO%Ywf$6L>AqBvlM1x8m_SOX%CXJwUtETeAt`3If7IqZ_(fBO+*L6ezBlhC
zxE2%BO90A@HAszOukeL1K&V~!z};|AF59x-2AU$co*s%$6(&sE_nT%DtNbwHQ>Ce#
zhKcAtYC;za>++3yIvtP~G=mCHyL}9VZ5rwxK5Oq>*;8!C)mV!xTT`|R=)NF@SJKp5YC*3usHwS!%=1YSHL&G%ME!E*SZn7MzDeN@$+FhYFUN&OkQ5
zGx6zjn^2fIbJ@e`qT3f7)}ohR*{l@rKOnxHSOw{4fE_2A|qQEAcYh%UyRk*fS`)bD#Y|
zLkl9g7%y$Hr`-wSCMmYQwkA@(no8sDyKv1@_;?-`i&nK
z%-Acbd($)#j0l}D?}QfOTL<*c%&?x+SslyJEx#7lA=)X~Mx^7#IvENU7mmYOGvh9g
ze|c=g=))+T%Y<9b%+wV>$U5k!mD%4hkxU9fRG7oG+gft=V-j4=2Flxy$Y$Z(Y-Mz$
zLjBh@#*cs27@v1S^&9zrk_m>g`wTNW>1jU3@f;6
zw=S1Zob5(8Krn)Tg%ru=t@^y;aC}WVx(Wxs(W%+*cExKbvtdrItoQ<1q}96rXG`#!
zBlB>J{-DP|_8v?XSol@yZDViccyQrxo0sR=+PY>_@S~
z+i{c7x;Ov~Rk~H>?~4qJe=Rb`X|Mvc5LGW2fI=KrxomdrmG;;>tMYL2{`A*JI8|LZi2DCxg78pl>(K8OtC*
zI{c+193xR6B~S;Z*VqVC*VVCf!6se;ZU}?g%t-$vA(jr--#DaHW9ykuZy^=#g3Ka7
z0fV2{Ljac{$asp2wXGi+w*dxiiK;z99aKzAnSe#c40Q>MNScngNB;i%NlYx()ge;C
z*Ri7T=w=^DGkA2j^b9AV11RI#+y`1*p2JM-(|PGirOKJETEtjxGM+Dt!xjLgo7N^lH9AvnBF;
zDnKg(kmc!B(fU|YbbK3ngt}?-48k>OdclAeAZq*O1Rj@Sh*X_@*i^??U|)hh8h
z5+V#i((oo5xm0tjRnYz(;F^j)0fzM8jT0-DTb!A_LEmp^sFaV*Gm5o&ndHw$JO-|m
z!aTd_hppvm@cBd__8!1CfoeL9a&OJZZup+SJ%ghX(
zZaon3Nu-O9+gYnAm1j{NlgPJ60V!nmR88iWx^hHUMVXdI00Qn#>D0C3XrVr9)+l!x
zer<+3hXK>`sXgX*tFt`U`wSuHn4eL5{p=32eF!(p76_N3B?$%E>8^oB+_kz2`Dmoo0L;C
zCXh`_jXa)gB{wxZo&i;th2QGK8+w6UOlV^#+_U1y4{2PUcMkpT_12z
zF%}_A?1l4ZlH}BAE*7^S2xN@XlbeYHeDP7ZQ4w%&#pr$%nd&R06{m)L8|^V%Rch3*
zDwqG`VeHwik8qfa#DrnG?vHPa(y3_QC9IOYLlrZ&W>3X*l1L7luYW#8
zV7d|l_ML$!coed=_{-PDhg$oMTvbB1F
z_^rC^mQO4hw8gn?@s$Q7?9e_D>o=C+fu&F#X%jtz)
z9^Tb9KTlXxbi&Vr?g{DW>mgZc8XA&sbAIG-!pl1$+w^@eWjVZC>QveYUm5QDM`j^4gpqU=LLGpd>d9X@)A$$2pRw|bcf0G~6yS`~7
zPrNn1(G5kyeTV6s;YiRgD^9fs80Rt-{%lI2KX~;6)_?bASQrN1+qFCSkENCJK+mSby3%z|%Ep}6Y7{xt_aGTHbl2WRmSQo3;xT9_$nj9|ski}BC1g{U
z_H!Vr<>TiRPFm<1e7W(bR9I1u6NuLAcHQOF0Vua@8<{G{9}i#x-oTfm^@H1&6AfAW
z#HE;@sf7v>-(*Jg9rosvYpzyZ?$c5*3K>CB8IoTL)qW#6;)I{H!`H&`wAMx}M9v)t
zGpRrhm1T8*L-B8IW0Isxtt~#q4x$|Ot)B73XjpFgzN%Y|0%KMgw4;FyTuUnHu|L!L
zqb6Z$aJvT2Z*ZS(tH=BFyc1ou1_XLu^zW?$@0S;voSrU6tAJh?$K}DM*#f*i&8q}n
zu0dTr1HCRy6WeMne9xc~%s5B4sjt#an&j@D%&(>E1O(YHJA_qU-fuHc*=x^_GgWUb
z9d8#mdW2pW-+bWJrL!An1|^)=fNoEl$!ct(aO=Dthr7!*Q8nPlf`*|Fpl%9kNgLw_
zr?k&Xd(|@D4@O9=Af=(oKjTX&ey}w=IU%7@QfQh(iNYs5zE41&(pb_s!#!(X8Wz@=
z-3mALUEXg=zCI@u=!B*0kVgCQWWDNQGrsXlHeq4aa9J_ADaR<<3jK#+eIwJqml$AQ
zvk|@JPQ|VUaya?FK-KF^KrKESp~1+UBxxKG^m_xn-Zt;_Y;C<_*zV);1J9@=jZa-)
z*3~*aTyI`)?y|VJ-?IBkkMc>^J05nxXLeV!_Yh)E^ITea>N(DaO#oN1
zn=z{Dp?{0L6M|%%QPHF~TD170Tja7#GTLzwk}vI>)Wn+dBq`^Zsq3#H@tV4Y9N~%R
z8c7D5lHuR0Xl~Z8RzUkHug0bD?}uvONI@cKd~B_2yRia;Jn{9l9s7%4&DdNYEm0;(
zBx1{J&44<|#-`0wEKe4*i)CqxhqrWt55IZ|VvthbP*L3Eo0xffkF=^_>7iM5I^e5M
zCnXA!KFfJ(o7@N3Q7)7%*vTea&7Kd>l*sen9N-i&RU)2Ic7fCcG?)HQ%<6yb-G9yM
zEUav7-2Yaq|23TdJ^XG<|G!GD{%&Xg54Ad@vhur~o%6jN{~>4p-}9{h%j%B6sPuo_
zv;N-8e`V?aDY5@s(SP*x|F>uT-%W9Fv^O@eMu3$JjYyV{CTl|IKf9tn#OvZKd?VAx
zI{z%lz)cqAiw94Lk^cJzWLejg4-jWd7^>_PAGf%Qb)P%>RI*UU@EYd+`g*i{GYMO3!OKtJC|(kGIW*WN&K$fw$|OyOW32{4e#f51fObQU-?r1^ZnaI|?fm+=SK#?}
zGkSb#osckV<+hcN@9qAwrRZgECzvt2)5DXmv)$A4rP|Ze)BRPt!Ta$~X(g_2($Z?u
z7SQwSGtkr1?NJ?bQNCJa?!&YG;aUIitbcgcKRoLnp7jsU`iE!z!?XV3S^w~?e|XkE
zJnJ8x^$*YbhiCo6v;N^(|M0ATc-B8W>mQ!=56}9CXZ^#o{^42w@T`A$);~P!AD;CO
z&-#D$tXHTl+bnY-doHNitv7aQCW%U6_~wbFLxl4~m~n#LYB;G&{A8#kFJ63k#789m
zHI%DWtObDu2bi!sbpZUJ8u9o=dPg*jOzoI-hFCyAhHd!mwi()Y%%6<7VDpK;JjOM~
zD1=u=oqd;Ds5&>p2)W@HrL`ZUEgnMZtNIt9H0&`YB{rDH-J0)MzTk+G-D_-jjy%f*
zK5S@kKee1dZ3RGOx0F7x{k^_RtW(>V_LyQu$nP{HI(BM`0~`Ok4gaS&2lVwscVL%xzM5bYp)zZI~!
zNn^lb$pYx8{G}ltkI9I0EMKrie~HE+W4C)3+@WsEkime_?<_focHKI}5u=5lf%*Mp
zhWV`5mwN@4B^-C@n-EGSq%2$m1`ts{sdEIl7HoXA^XqzIbHOTjzcyZSSF#=En_td?
z94Z<6vAaJ_npfHR`xz>Kw*!w>X|xAu5L&X6i0vN1w^5(5ifUqHo1Z-g{4rvX$V
zJRCveN+ZJj*^;{UU3akli*CC|3$Vl81z}LP!~KURdWtw_k!I*_4?WBZYCFBZlLm#p
zmN{NHi9Y;}YQ=dS@(!m0Sfemd^%mO7S11eP{F^x1if&`~*^WQP)1d-;q)mWVMcOy^
zdC$ANXS|h!d3qMw+cb6*1xhwSjBX-56n
zI=vXeSwQsAP(WujaVER4U&cTu;VVkji!NC_=7q<)+bH?kH}4Gs^-R<)XuPN3q$(=%
zD@;wqM19wi8RLQDilc!*y8;GCeqERkkym3H{J>L56<7xO9tP&
z2Zf*1o0bTXA0q0r$i9lxj4{gWnoFYEvY1BlrrP$Yx{#uozc2=X&OOOwHYoA7mlXy?
zTB0}2F&*~0o0Um)R6pWzgzKANM+NP_>T!MNmiY|*oUY>XNcwQ<{?~i35jLf_~QwZ_t<52x(B82*VNy!
zn9xz0I}xVw`~;0h?pR1SgMR?|`2^7AtI_cqHdGnHE3a*ox!CB{nhw?Lgt$DOW%H*n
zYtCN0{AQej1Cf6CCfCvn-bcHEGlZhh9c=gCIv;+!Wm0gO!FuvCDy+%UzLM2fq1)bWC6x=8tH6
zW0%xaqc)MbAUfDL7$%SnVpYrk36k~~boxs~akDYA{F{^F`Zp)_|3;+!W!aS8c{L?t
z2U{omZ^jNp@Aw*{h^>{a{Z~7KZ^r*heq|xz;%5CPE2GF)*7pRAqJBgBO{c|GQidMjrp6&>2snf(A
z*Qsp_X>jOhKMA5*omwGpo04|naFMd1{*k$pQc$Z>WJHrCcA=(PcTy7WRNbE)6(9)+xge6$#Im&hE1V3rlnP_!w
zjikkReS`Y<4>A|3X`M0Ipdz7b*^*V;)40_<+a51)UUY@=$Z2c;;P+(NGKIY7Wf^Xr
zKBZY-*3SA@m24_Cch55NRJo+6R&LL8N^UX&*$|2a)zcq~BfZs*$X+XjUa55nBU%
z!n(pW5@ccXcGQI#>c_<)5uh!Uo;jD*R2p;(giuf&Y%qj~ff5_s3<41~Ev%tS_9Z-k
zP-faeNW5PAS2`&DqjGJv(p9IDuYgc6aCP$HQjtvIA*#c~%fE-P`<0k4#|lyKLiL?&
z;zDyOiOGU!#S_K&73Psyf=0r(UG1nW-*a8|kPuQ?07wl~%{Zhb;K#U0m`D7e{)G5Y
zOBg|@C-OU@2?dD8?v%(4!B`Lp5BOkiFyU4V`ud`VyfuG>ip>aGs!ae6qnXs+46NTA6-5x?s%LlabVQ6cN1B+*Xhp!3m+C%Mf==tl)mZrwTV_(Im1($Y-dPa-NDK8
zE^Ja}ww~@d>-s+btPd80YwQMjTSc9@j&#URuOSNkc93BOMqgNz9%|VhXcC``pY$Hj
z`e4~N98X+l&M&|Yfm`dQCuQ%6%A*)iF$D@zF7xpXEy#7Tb68H#O_yJRY~*YNv#Kzu
zG%lBq-ECn%M5dlLM2`94C=d0#vcHUxcnoDV7@ZYimRE8g1Er{c)GS_)>s}v;*S9s=
zV&ZMR6ceF1kLzBSFIC4}&HF_66K{9~nIw0}~hs)h!EGtoD9Ph)0-S9MT2Ebu!sI1I~3{zJIAr>z(8Jw){l3@NPd4#9DZ<{-fTrQhUeA--eXCP_8vOMhYy09hu_NWCVf-;@_P}Kb
zd6#gn=rszY-Ps4y6%MzdNJGSmcd!kc$2(w|0;w(Yk%Ghh%YLNy_h8&}gQgVb^5r1;
z;STP=qU+daUz{+xi*mf}{e5b^IKcnS|E8e}%W1@s>3FH}>u_sE%(z7d~#m
z-Q7L7I|O%kcXubay9bBh?jAf4+#wKLgG+$mFZrK)=A3iisi`}+W~%N~^@lEcukO88
z@5Qcy55Ibz?+CNDa|KyNu9f~vG6yevO!m_RU5?S;D?8NEF$6n@D3v_=7uH@v-tB&>
z2?*{`SORz!z_S3J1@J6@X8}A5;8_6A0(cg{vjCn2@GO950Xz%fSpd%hcox930GX9C3a4wKrd^uth-YcXn09KS&7^K0bQdH!ErzRQ8i#
zidfSt0waW?JC7IR9a24P;in98TskUb`7%p1N#046?-UR|O<+!l@yhneVb?S(5P_W*
zcZPd2b*5Iz&s$1|u~R2A4HqzN9H~U>oXLw8#+7DkBM~!jWm$T1+jxfU
z$9Tl6gcLv8wR~!+QW>N~_96AvS)?&WlO*fQSpVUfstw9!zukysq(`QXY{wl%|2^0&
zb{WEm%B+R2iQZ$5?nAi3zj8qaDblOa%M+B)$aWnf#iVCC=db=Y*Qm{lR#}xzCM*672(M
zi7NUI6uj;x7H#_IB3iuUSMYd^Gj|o;FB_I_-E=REjDqD$wM-5*>jow(S)AuJwQ$m|
zJl1u-x+lhUGMD!Hx|0W(7Flycqo`3v{*{csm!u~Gj8L*MUOHf2XSB*%6<1Uu`_HcB
zE{*+{${&XYjJwYkD<0c51sMo6I;&Ss(y%?bUzI{Iy6M;Vv4-ikaQXH9n$_mwn?_s-
zsXO|&YR%iC4_ZY}PNML5Zr+uua%!GKzxXNUwabeNslBFHm&3)bSiJu@nLIdVjy-Kz
zRTiLy1@)zJ{IVBB3(I4Oeh+sZs^Mm{narA9MJLQh6fzZ^RPCaahQtY7S2jxXy4s=R
zL&tSwx%wP$$cnhi`J{Zv{2=GVD#IO3?6;qG@TsEGNDio?I~*?W;#BIw(iU$gkKN~n
zUhaO`bzGjoe_wiLse5NGdEMboD(8hkUG!IDAqsBX*|E{QOcsbSg{A^vO
zf>8m3t}YiR-s{w0p3X5aYjWN}?j)NJk<$lx12d``hdbC2CPRj`RQbGvet(HirGA?g
z@_7h@&G{vrwyKf~oqr8MIQXSR8J)W{{+x_88$Yyoc%xWmbF9+^z9~5QH!?*hY(G>)
zA6-_zx~uY~^6wHo5!4A|cL@a|#w}_1&o;lnedpJ2`e2C%J>#tl;8nwHxaFBarnI|?
zSMuV}7}{4jOUw?<LY@)=JGa*=Pu|NzsA6{UXL3Btp9WP&l@8b)%d=RRGbNmT
zHq(sSZIw_W!{H|?P^N|TMU%dIJjJgCYnPo@=B=r(ouB0`R$a(LN6~!viA&4=S+Ac9
zL5O+Dub6|dE2Lnt#HEU$YjZWy#R&=xJ6letDL0C=8;h-z>fOy%0{xBxC7gbsWb8L(
z6BN{z?fJ<0goo}mI}U}_1-t3)|KVjD=z$Yf+V0krbyRQx}v@RHDowIqDg%7*xgx83jekp(UzHE%P
zBg9-OoZu}2kCD=HD<+AvUTs_n&>^c5nOfkRT``qN(M5DRtmGnTc*p|*2SIw_D*1Qp
z;UC5Jmp$a-`bR%0$KPv9|AT(g|0mPn-nijE>>>L<*+Y(hvxjdGk@Nq)xRm2>adrP4
z4)HCF@1KfG|61t($RYkCGY@cxfI|cvBH$3^PxXIE?L2h0(zG-AJ^5&wRQVSM*Ba2{
zEYjPYwGr@OF(j%B&VVMmF={7Of1h(d)NO*$ZQOA`)I?v(w#mcY(>y4oI9n-g_;YKy
zhTx1>Bt}>g#lsO5&-c2cq^5lX);SF_0+}@Qs=Pz|ex5XXt>y7Lg14WMnu0U+ffx^c
zyAQ}reQz(AqQ;Ua2(q%i;QrKY3Na-}J9O=Rn^a5dlr5)`&}36db#YF+S!Jw#QhcnS
z`nwaaE2H*y3&O`!97D*1@WMS9jZ-%1hB)!M+}(I7Gl90uB*yh=4-`9O6Ga#O$}?QasK-#iex)QlMjFt7oV%
zVB~QsO=Ve4nA71MNKxH!7>C=^&OuLpQ}FHN8rv0ChK9CGo+Is3IO7GQX)zXOiKb!9
zWmU6yviwQo$OsdcU_qH5l3)uW&(oWXx8E+7mC}xVT_K0TQcb}bM6e<6-cIHpg?JAo
zTK-FN>;~N|?BnSWXNFgktkz0)fF_%_**ga=NWC}Gy_VYNSlsr>-B_*bPZ!}7mQpl#H#S-TF
z6FFMHTJX5E19P<$i|C=1nk`bCm0S|e=Ls~r?!M2I-(bqah
zR7eZT`XSwS=m$OP#qH^brt=mjXF+W19;v)2Fc{pZM*FU
zBr-PXz*v=wZ{2*izOucYjvT&s|Dx+IGvk-bl(+vlWd7`XYsC^)OR=0cBunyS?E+0q
zaL07~IfRBT(8^ewd)~MnGyQyUg4OLhyQU-CD_mc2oT&2<9WUG29~4PfH@d(j0?NSP
zLY?}HkeXBIus|PwPejj4&0tOjbsJ#{dhCQz%Ji4gd`NdL`Lg5LWH+L4f&BGjj%#l@
zD2;Vh$1zspOp%2!b$F?Ey5QKg{n<{BMuOIQDI|Hn5u;>|HVN1T
z4qaAB)VL^BeFMk#DAaC5Ev+5cu8-)gN*e}PoqnxnZ)^1Pev(Myo}La&i|xd0-mgbh
z`a~_Otr|J_i+r@_)8QwF6G8e%q-V4-lZbLQ{tV(R(IDM$q5jfQ?au{5gbFq?mJc8Y
zmdrn29G^aW34UfJwzP9E5e$@<7>pIj|GD4#<5iPQUwj8TQq3Zrp%a`nZxwQTHm~Az=F*Lu0yW*7Az37#qMaM(QJPx_`
zUIcS?PV$`~GK15*)uHfGzgDt29RqoDT0gXxS)i|_$(^pY|Mo^jHMC6oXDa!@l%SsaV#
z&f06*b0ECy^6E5lbHuwzeoV_w0<~d#_I<`S&t$a*QRj_-i%(xSMyEz|3Tj9531%K~
z$<5D1n#x_t?5K*PhLV!KK9CnY_U9d|9IJ1c8$pca<&i6r;x6}+1?IkAmJ&a1v6xeY
zXGST{H8T@;snvdS8=s%q*?fQ!A0HmtMkLh#!PKFG9Bm%yeNpTiBv!^@0ftM`+}~@D
zmK6Q6WJ$te+C`~8WY82xbpiU*Lgc{+LypSW-DSFYt1n=4zva-J_h?^Qg41M;zN5XR
zi46XSZ@pG^?qak~$+9u`t9O)6x%Xz;rwS&Qcdvqu(U3(GYugIswI7pLlxp)G>NRxL
z;gqqgh2tLwDb6;~{fvd8m#N%ngIc4XJ62BzpXVN0Hu${5O`o@2EhcruE{(i?Z?EvXt+N8+!b~trV*{Ebx?p<*cE0^EzGwjSm}Jt^B#;mtEum0^Bv*51A&u^
z(R7$_LWEX!nCjBfWr8NChK-Azh_TW-waNswkywzfs_(Es6ZCuyIm8d4REvhsQXaGa
z)iWDvm&N#GH=x$gj>S1@9pHmg(p;S44xe>55pdEZ>`}I|*qDe1-{|}`mibqKfp3jf
z9x4ytPMML^l5dg2r=p6;m<@yC&si}uVh5peG
z`c{JH{RZGS1A5@k8y>3*zOl#*JyEA~-Wuu~zO4`HbGX-n^PJ(*k9bhhuiOSF?}>(<
z&FOBDaxxrR-~B=yop8Go=d&lwOZzeB;_`xF2(st7X#Vf;$v^n+kJ5WfHst(An=Z%S
zJ9hu4`N{viO_%v^;f;S4^8V-Y8vpbO|5X$IsWlc04E7JNx(@0P7-jExZrVtbyGYG*tWI`^60@Y&Apq(
zpFKd1bxj@Lqtyf}Q!%`mlB4
zA@0Mw#7NElxA#TZ!e%Rnfq}<+IUF~(Xendic#faa5C;~XyEXjIfPMG27U+nqreP?U
zXrl1QqCt4jS8E0q>P$3>#7S`|3f5TJD!@qsP7-jEfRhBAB;X_gCkZ%7z)1p55^$1$
zlLVY3;3NSj2{=i>Ndit1aFT$N1e_$`BmpN0I7z@s0#5Ruo#bZ?JBL*cv@
zh&7~_;^eKQLdT|};gH9M0XktKZmLV6CO$36EwBE=MT14?(m#11+PR>J2+!NG1VVhM
zHOe=Yd=g@jQF-Y0z>A^3!xXIX=L+Rt5zD}A{qjG0E7cv5h+x@KVoysVURLarKwdpX
zx!R8A*9?+`O;;X`?DL1?5D_|&A}Zs9m&QapMuH5^tqehm?jP8(r58+L$yAG6X(;0z
zK`o^3fW(h8(__>|t6s{Sr*UUELT`Ww1f@@!n=h0n!4n=7y4RkkF(r#AFpeQRh#E=*
zkuaylfjPo$2&wZbZ5V+b#ceteVG>FcUH@WcxrY9l~%)1uDP-il@E~Ya|i`tf|7v;56&YSC@(r?IOACG1v97CSiT9ifN;l5Xy
zM#tYEXc)uildFP4x9@-i*d8ArjV(Lt36Wt}JKZBJ`8!~_{Oq5a3mib8l$(j|(pEdJ
z7Byh-eTeYS{ha6HbQFn&a0xG_bVgh9>*wA@?*hIy8J+45jN}DMaXMyAZ?T%37=sRY
zbbC-ANbnTHmzucJ2gi1S+#14)iG@nr_6^>;TF||F5Xk+qi-3LsuwOB@nJ{dK4C;>J
z?WFF}f>nOyeC7xp!*h#fFq6t5qamvpXen{>{X{j99JlBMv%RmM@F2!H7ex67p$H4A
zlc$2aQoc@vMqn+*d%V=IETOxgUERZXICEHhxjtxw3XSpGbAhtHTk9!iSiBBmxt(*2QS#xo={%7{+OMVU%JKD
znkBP`TJt1{KR)~QnV_z-R2)~Xx2HTg_vn4$Cs-ciTwT3k`wYdVo%PAscM4UXdxfJY
zXzlE5!{LZV=d5KIt?0DyJy#u3*F#F!W1-8}aBr`bzOD6h_pEof;GKr-*_q8dp;WD?
z7s8gvC3@CV>$R;5TgSZ1n_s?oP5R5DF(f^+q)BE}hY3#vh+^&;V)Ba)2s?ozE%qP9
zkx3f4J$c{2C42O#S4OR6S0A0)w(`p*R#>G3PuqnONCrC93Ve5Rs^Uxtrr{;1IK3P=
zbL0%|bn7Wk6WRg^_U0OK400`i!~UGWz3}eJ1Doik#Xjm+kljVVVphd(rO$V%l7#2x
zKdX4E(o~>sjoR?X@1V)_aDuFl+}2*>OCau*u@`F39bktA-b>7~GqQ!vPRU>&Ylgg1
z1i1@xZpx^68qHofz3cqqQv4%}Fvq8`HBVgP;r?b^Ue7@Gd*ktuqc6v}Y$B4yL-`~M
zb60PVEW+|5992eqHKGBs)foWA7G!bBCfN@yMI(>?YFkh4AF3_5JFDYM2hQkhexB#$
zQ;EqcGt81ala%NzEz5CVOa3^2LQ-b;-nLz!D)o~o
zx3f<-VlI`T3QL$3yV-o6d-uCXd_0^e8J5!No@V|-Uv!%Q@n!JMOlowFF}2iPJcj6&
zgo`S?++KX*SfH*+NO)7D{aT$bz7^V9v6f+7v0WZ1Sm$i_c(QknQI
zrIF(;%kkg3qu(MM|0W9m^AwTuPm%V24@G4A7mE1TLjNa`jc-!)&l3UF(SGqwg#bka
zC?Y@+0g4Dv#CWzhmS_}+!HoFFCmIF5u}A7mt9&EKkb;qX^29g@4?n!9p^jBLOg4DF-$O6Iv&5{UJ=uR%aFIXBWtlxn8^nfj0l;2bG;=N
zKMyAbPyBU}5JO=J+5ocTsDv8@FNDcA8D9*Oen%EAfNvy3Ds8eSeO4_WH{wxX#cDz-apx;PY7
zpwWjY8u&ja!&D`sin|Q*U}#BsSE_IHGZ|qm{0(9Lxzd639f2K+5)=ubhyXwq
zxB1v&GZ=!hH;X7JK!#szciYD@sI4nqP8>HmXGjLoMrD$48P~-kZGm^>U`i5`TzY$!^rFdaY;v1r37F)uUC)a@XUJHbn8URV7^?gv>h9Ox<{1I=^^vofAtp_cU
z<|d7)r=TQDy;;PPE}amm*l~9&I9NQoH=H|im%V1T)dMz+=!0hS_Ny1Br}u;Z*h@d2q1!?Awp+
zID8t_ww?2y6DRz!nDocft~t{+{{%LUd0`@YOEx#BFcw;hebZn1URA^3TnYZ3CehK4
zf$`9S4cDC4e;~gwd(ABT?7;siM
z{_>9HrtD_0dLB@rixtsgw(sws_^Ga0|I%fBrcpX^CUJs%kinQFP%2seV8}}>-BT`r
zi9ocByjTJ%G<>DE^gk{pG>E{Wr_It#aJ960|*RT`g+07`G2K
z@^_`rMvd0y1rz3D3ztm-%#UnEg(kn21;`@}u}7H+iAV~Q#B`G+&yQe9H71U(A6`9E
zrnUlQ8u_w5c#C>#Y)p!Nj#Ql@Q4aH%|K-aU|8`?%WZMC<6GqcqyVz{bLg&N!4I(nHF$+KI3m;#unEWpQpV#y8atP3x{B
z$3x=TgvcaMwkm_y`Y}U(xGnM(%@E|eowV)$FUtP%NPmekR+hJPH8XqDKQB1{UJd*|
zEyV8qzm)*L2`i@mRBRpRzqK0wm&ewz|Em@Ir-tSKFt(2KZ-v8v6$7joU;Q%=V8s9{
z23Rq`iUC#(%xvd}xXT-0QzYFn)iO3jwQ4&4-<89puP!}~SiC~G6g|J=6
ziV&C)swfWyBOoYSfo8Nyk|+j<+wL<3Fzf`TD7J6w(+iZ5-qh{uwRT8~^ys9PB)ZuSvyRCiw;a~ag^d=sYG|MFt
zuwsA}1FRTe#Q-Y?STVqg0agsKVt^F`tQcU$04oMqF~EueRt&IWfE5F*7+}Q!D+X9G
zz={D@?4PYziiV5>{s+V_ceRHms6wnaHH^I%!btS^LP9~AtHwy$QZ2TYRkkU5WUm7B
zm|FBLyvr!?so^ItlKu-YWK@l)Qn@f#w;ab1@meTcff
z@!E_Qc^)V%IJkVS?T>R!uZ|7ZH)Fq!n_kWQ@9YD7ZnkjozXSw$`LQnq>xHnoS&tJeF+yI%*_sxtM#1^kJnB&<*f}Ib~{TjI3TU|Rx
zs=X#sh`%1#IX+M@I7pAbp38fEdA=Ta+PRcrwX3vhv_tO@)vRjq_V)7h^{>9jGFif^9wFJ&;juc?8!R_2qSGx-$+sY5O)(Fr&3^g%W9h-W
z#iz?}dG;);v^n-j;9U0;!FViV?%oFEBjsx!=-`gpNmGl`b7@X>RFK>g{;P~vazGn4
zm!+})?i5GGD+mJ8`p9za)Wvzd7sS@sn3?X?30xle+1j=UZYhcg5{;`M2(0V)jC*cDlNIuA5AFr0s0Wp0B-ht=jz3&uP&0v#|8y+9$yI77NvShZh
z-0|+tm%az({&PG6sfnDKmg{Jf(iZ!=qc6S(?HoBN>NjDsYzNbkXtoox^tNp99}otd
zE$jplo5lB6C@7&nNTvtj+a#NZ%3zm=Pw7C-v{bkV*7tubl&22ih{e{SLeXb(IuPHA
zC7PjkKdv%757}RKJ-M5kbG@J2wXH;G&vU5LHz5rL-?;IDo1lz*?;P>D%&(e-lL}+=AHHEb>l5iRs#VQ*aA$ZLR(oI^YcjcI`ay3UXmNSN&w-%-UyE+n1O6_xns@Gjon}1^S~p#?W+{t
z1_2)K(K)-yovH|(+-a3Zxp&KQyM8oh1nmlXrmxwg?ezLP*>^pcutn!`9@H8mBna=~(LFMs?8PT(4{2P9!8Fna`GuGI3V~aG-K|lHXl-L?El6@X*)M4OcRz_82
z;Ud_VC&P=6)FbaNuQ8oIlrB(@yiIyocBO^8I})LzXfX&E*H%{1o33b-qNa8sb#AP!
z7W$G+I$1#rzbK`os&@GHsWf7?D`@M2&J%^zAaSxaw^Y?&)K5vHbCd$sNzV?OaK|)J
z{@fV4FkOm`p@$*4?-^YIXQZVTnxLiz)6o#tQ~~$QJ(Q)UhFz6h__kOh1MV+ij5b=P~)sbLQJFByxd-rqoX7nj($_Ip5aO5
zzzEtUx>HB4v3%1f@Qafk>LOLHqMS92b5$A^FsqFucRNzSzl$X&5mBI-{T$b&N$I6T
zm0P6zzShFMGuqoU92OHwU2>L#zSDG=TQmN|s4o#4PR^1Ey7s^Tx-rcGt>NJQZvWPL
zg(&yT-zR&cdv!zKuPt}r>E(IPEr%*cjf=Y}3eJQV|K`~TFWkYw)Vt1uu|s%gUsrVti@kC1$G*()=yPN*tac2dmKMsF
ziN)Sq1H#hhOG~3)0{$TfUo*@E)(1+RjJ|vn48Fv~CR$_EE|dK8MDwS$NmwRe?aVeW_B*_
zfAHA9S3mzxLzE&26-b8xn#azbfeY)M*~@K`$H^20dE^
zkhckttFRDw-Yy$>TNhksH<_@OndY5SYJ_rUmIOX?6;^~!x+r(oK&56A!XQQ);v(Me
zu+c1WPjTPyAhcfy+4Jwqw~x%K7)i>BRy+iXK1UKthThLOcb-ePzs-lfyV95+{QP|S
zkgNmY@v~n4)MLDS$!J6_es>b7spx))pp>b3(hIR-$*OJ6u_yINu}!kX>+Ahk4wN8y
z>6Uu1b+KmFR-maaMQKe+6(-M=)TCOiJmOulsOVt|J{ZMLBEIWYf@-bk;n}@=q5##GSgkV%i%A_edcYgX?n{PvG
zDOGrLA;>=z<#CkZ?_jikX06eXNP(p%O-aT*exo5HcCSUq=5xl^aux`%f67>{Nkj@V4$?zN%qG0pD2yjKUoJxX0$Cs#
zG7SoCDI6kf%y$};I-6&V!OX}M7=&}dQ5y&gN@Wp4nRYu~a>qw*GqJuaULi*t{E*zK
zooR8k)s#Qu^}_yivPu~xD6_~o5%U@+getuaC+!|opt=^ME90UXAithL9t#c2Bu&EFUI
zE1odMM+K_F53FsnZ7%zoe`A}RM;OOh9!t)5f`ET?D|n3xna`Zir9TDna_nnrta#*n
zq_^Lnn0rvyT+Qv>(2)^V=+%Z>(ypeB9eRuef-h;}faIs(S2<~=esw3L48?ck1;lA^*gFrI5`
zxBt?zMz}T5cV+Mq6oklxH09s1Sbu=eUrB}U*|`2evHsqO`#+sx{jKiyKVNan^{4#z
zzo+7s^Is&^Ukm-&|F@m~4<#1Y-%59Z*g_z-5Qr_@d4B@~NGw2N0TK(4Sb)R=Bv$r8
zwm1J^|Fb(>Y`=;O8df{BqL)-q`8;}{^`8P0nNz$?Kv&i4~J4u?UQr~
z2@m|9d7cCAGJWXjzI%V(p{PynHrLa>??`>LW%>ss*hH|5(e|U^x2E{X*9kEdSgq$NGw2N0TK(4Sb)R=Bo-jC0Eq=iEI?ub5(|)6fW!hM79g?yMPg~_MeDbs
zeAzH?Vq6u`m%)|#KuZ$3Tp&kM-1n}Vx|_Kri|fW4k7_8O=em04c!`oe?QY!q^NgCa!28N
zT-AMjvSUmscY}24YOWM}J(jjyUj*FWw^<&{SJ?1c5`#ntcz#x#XBqH(Vh$3&XI9$A
z-N{-hcjB5EV{`8y+#4x}`qS!OyXLRcJg9b3ni(-{dmS6Iq6_S;STS
zD*g5M)offFW2h3->AooTQk9$4c$3*;N3hX^b}*Fg?8GfI&SDjNSxkoJF(MSZjaz80
z^0=Ym@F{C?@Rd~JME!!gr~LBrN8OqR>@$4SF>9ZgEy@+Te2gB3B7$p
zW_1V;1pmfb8Su(mcL*HTYBwvkT|vid)UUEOdbFC#`YoMM>3OxnCQz^Tw7R$*RnKGw
zPZ*M+hC{(5bK2>n^kW)jsBF8gI(pzza4N!T!u~6I;eW2k2VNxj>R%~uX*_nQ(iX($
zC(SqcPAe>j6YuO;y-av0oaa8>bK?s>IY0TPBR&Y{xGKhB{p!W~{jPZod{SmW_A6+-
z%Gut)TCxMt)#b_M*<&YFfZ&&>t8X3(J$_-UUmlK*EfmhnroX9beb?#lT;Cp`A>+8AMc>&j3h-bPW!VS!oz;iBI4_R6l{PBGDGQ2cAw&bw!a()_p
zH$1RYx#SQpNEqPt9C0fBs75P2@n&<$0CS
zi$}CUz!Yadw9(_`^>pzvQMse=`DUW~_vL*&)63(EU*ZCmLhklJo`B$B`&1qaD4#%n
zc>KBI1)BZS@#R!N@y>#i2C~Pz6MDApptW~@{f9tr|Kp%SEYs*uZJ0qe3b(;+#47%Z
z%YjqzRYDh>^h(wkH+hU54Mzz4B|w*$i;_{L#1N
zJ8W>3kcoV!i7MtY$|=il-kjSUGf{OiS{p;GhEn6^csk+lYMaV?i-qRIcgZ^1tmhXh
z>3W)pww@l)t%SL^=Yl^lY@w>icV3NPe-Ke0<`B4#^0Uiq{upkSM3>hnp9ht6Jc^TG
zNQSW1K22};Lvp(MCWH^kAl303g$q*%LQDTG^iCYNk|{EWSuUSxhItv$6=oR)7ps#z
zD_N~ro*SH1DbGC$3GGoPH|>a0=jLReso!m~Yg9Uzn#Zr^qt(^sb;GKN)p9!Yk%8p2NiN#nkZfSS&M#
z&u(Jd2Jf2=w_SN$o-@Wm7^2C#FsFg61%hh~NEUT8=8qtXwA!ZbPfA?}eK~GAuVT6(
zTlN2$!rXb@G4IQ&u*G>$d4T$fyXK2byd9(g;$xzmH3(B3Dep_4aq0J
zi!K>KjPFZ1VjwK04VRx9);2*C-=lZ;ru>DAP&&6qvF0KB-q-U*INp864Z1YJ-+~tI
zY0+IOxX5u3DkNqR=E~z~_C)W&^!hB*h=Ix{HI*<6wb;g1TW^2=li;BYH;WGww)4+l
z_I+qJ8KunndR-1)F4E={au%{v=SZW9gH^F}X${4W82L4&)Ev_#*W$|P2Qsxa$lBI-
zHS~mov(w~X3CF7aH7B>HOUS=676^ZwgpIH>`#oJUiaj(F#)kvx9W8>5Zuv-eC4z2g
zDb0yd9WzV)tCDl8^_I5I0Xfh-nRXC-vL2_;1ZkqBU~*D-D&OIKK^5HvUe)x8v?HD>
zIDM11X|vF5Y7V3uCma>sa%VEk)t937?^iXG)M{+Y=@Ybxy2BFicXs;@Ip$`Etn=0o
zoNOM!`OB;oqGj#;s(mDI@TEEMb|NFiP19N5!Z{^n7H0={$0-oi26=eQyPJ(f&=dyZ4ZlriHe6m)0#jPK~`M;2;0B$Zi4Nl
z#ht7ev*z%}iBf*GZaA`g!`vkiJ0`j%)*zzV9f9VwsJkZ;xDw6vQA`&R+`fQHBpB`-
zH8Xu_>qoMMQDkVyHOLb|dNF8^-OKF@O-^(VgJS2t62ATYjcpS>j*oqbU&Z6jB@x?T
z5o^V%()
zpg#tFv@j_pkJwH5G7Phe&f>m{IznTLTxSG>%+kttP?DfPR+*%mQ0fW?p7^n`F1A;$
zz_d?E;;ZB|Styw>L14}-4jCy!hZ%&kw0U;oP69D>9Y`i`y(s9zd^v${c;!*N+iled0!k?0GT)$HYVxwV9x%v1&QBMuZ0Gcn|i`812e?I;GqOq3=N=))1ZYmoFe78&9)^n0aRSXv4glGas-
z)Fg0g;xboBg24PwU(n`>HEGIxRXfRZXTSyb9_Rw|W~)w-={`!c0?uEI
zFGrEU>}**Z2$eK8_jaWM1pLEC^kUq4oCC{~BJAJjpv0vTY+0zz5bn}JILs8qL@AbP
zF2<$L2;tWfOj1H$oV=~MPh(P;+A$U3!dY2bWA}2>svb?5T9l0gD&}z2-90Ak5DP?g
z$jh?_C=yiRq-z2{D=)9Wkf(0z4kIMNl}q{jhL9=tUjdUUmTGJXzg_7TjK<3;QtpwX
za8$)zleLN|62Y7_`4LCS?y|U@Axe01GVK_nqAGbMP+FD{R&HtcS!FrLgBo3P3=B;O
zmV7~N8^QF=lk+p0p#1ofEg?+|*HE;il
z!19N<{gUIIn2IF0$N4f^*h#`RT5j$eA$1ZepXg7yt>L@YNab;5`(H$z*UD)N+VqVN
zqf;_e)TWq=Ae&Vi|VlHPO
z4l2Wnr9wQS7+1B5JS~pq#QpF#EDs52lG937;N!?CVR6O_EMY0b4HQL9$s$W24(63t
zK|l^A7>GC#;cSL3kq%O7(FsEqF{$8)%MMSD1
zl+BRxh9n&{B(&2uIeB+&@Dsn;F|h-@}_ytRSMYAw-D9QE%!#4rgSFMO{i4ZDEce$&Wj}Zk{J)ig2(A$!9w;4CfIt70Q6-_Ne
z3m~-%sHdY=<2w$jrs2{tEhz}QSemw#;F`WRayOA`!ZmI01%#G5!FnO(DkGL@M#FssC-}t*f_{%S7n(%Y`Zj
zEh~yVe}h${;(oVoRu=ukXmBX&g75G=>fA+g_of|`&%(Ppe
z59e)~8n9|d%Ru$WE%<8B6tHT~mbc@8slbg?(;u|DtQ1Fk#)_p$!b?vnPbXA;eif|R
za_#LG9IO(i?t1k0q6t#lFAml+$4A35C*uQ4lYC05ZbAN^Wdav}lbb?K5u`VQUN=M+h4yU?EUGeV=T*94D=F}P<3DBzc$p-IdCzu;Zs5CK@RB+
zTy;j-+rCs`Pe;+z2vx%S<7kt8!PiE4+k%4}NNth;(CUb{uTFzYn7Ww#+n0;Q=_{6g
z>1>^o2{PT=Q>+-xIoM5gJZ?MRDFl0?b8z>j))ShPVMPW{3TW&JStlB!aQL(
zcvO68AmkbcD_jJ;GCoi&bbA?2L|UjIaWQ<5^tP*ni&{?6Qv0UQJOX22h(SH>cUIj?
zJ!vdL+cv63Q|B`bq6Br=s-u`GXT|cba}KfG4&O%xNUo?KW8SbdBROJcz3)cE&Me4Gzm4a&{#?iU{)d}ad__|eHU)4
zE*FAJVm-*de9fkmWT4QPIzW1B&K;C1
zczD!i7DaKly~{^CASbZq-eDOq82Uj@8<+7;lh27At(C}yH7e6SUo_K|_`6>BNT?MN
z_xg7HF><8sqgD_Do{LERTJ;Z%y^v$1)*8wOc4l!h0^_71xH0SPE=rD0lM~6CaXN)Z
z9y=>-Bo`Ekqf8TMu}hM>)MF?EpLqf)aDT1SaI)G3$;aIpbff-X>1{_5;p^esnLmo|
zwA+w;_KPla9nohlh9aBs$frM2`O(wvB_O?eZB5%NzHOgF(Yc%bymD3|)=+s1yr
z4$SRFl6t*o_bL=gVn;-fvd6di3hgioiFkp?3N(2xYs@Z`CgBW+_Vh&n@XCW7Hw=c*3pS7{hC$l}s5)BynnildPf?xc&`>78u?_I0btOld#
zdEI7ILF&bW*mzV&=*mMHkGke3?WrwTap~2o_qIM1SGK&CAr{^@{=Z&-#!reS?%q4%
zO_Qh=Jg@Czq~#q#-#Z|}p=@l0h~4%#H2vy&WMViNsBC7>m^0ZVp&_ZNa~^KCT*S!k
z{-7b&jQb$fL*&!cVdXM)Po)(IH4cY2ev*KBy`NGait(v`-S&I%>Z`?NBEgHE=k4^=5+zaPC7h=&!|2>?^e*b$@C>R4ezqE~)6{PwyH|xwcrNe^vuPyiS
z^IJxLNf#>KLj4<>uy5uJpaQ#jx#b*mLd^*pB`aN}-dyqsH8*1rOO&N_BhvUANJHOD
z-$9>R63XSAt?fwuf9%~=a9vHBCTfAjOqRvW%*4@owec{+zJ9A~`%3QK<9={)=lK4tjP)pw@nzv->g2QtogbfwW5!{PE3(EdhykPv@+ggKi+gj?9emG;cX`mbg
z)J|Wn*QPTrzB`cWk|YJ%m#?bP(?~UYNKfN#hKvQm)xE?^%mhD6h-=f;T?Aaopq{$Z
zfd_Z~ocr+E)tn{rcmoJ`Psz4wvhaNqNWVp3>E4Hu-vx^`4?1CW9;5LrK#iSL>LqU
zzz7PkJ|t7#=Si(bv{RCBq_HyxRBg=!>tZ>iv|xs1wg4Vv6|QgOJI4Y!s9r3~Z{b*~
z8ry0)CgGL!??sj45muBV!))s$-VqovW)ijCHj@l7dOS8Q{x}W=^f`v;!ur442~=)d
z^Fo#!8EgrEJYrsw(a@r8an~FN+occAk3H2`rOffJ=3J1AEm-lMTjA&0wv-@*R9te|
zoS5J6x3EE;&rSUdNivq`C1TsRDU(W+|4pH^W4^4yc8bz_GgcyyVXow`ow7!OiK_Zr
zyJan{!_nn>XZqP!AQ_9#4i{M>o297k#qtL>>j;~Y?M)Z`98K!-@LD>CyNfkYh8!Y;*S$hpg@sfuLvIeKAkV_;ASOX
zgQ+$@`?dv?ueL9B`X;A;yo_RxiXr9FS~A@1=lsp@8@YS=o2QOJ;S?IZ%z?=nq7PqW
z=TMXQQ_lFo3xn_SyPRNVPRWOo9ZX;D4$#>lmm-kk-E6QDCteKs7AaN1pga(2bO`xe
zN?%wpQ00s`Pz+OJ!JteCd5SazNM%acoGSn@=ee>xtYzMK4%sU?MRAoNV+7UIKY
z!l!h=>swg
zJpoq|Dh{Un6R_q2Xt3D?VuU}>W{3dzF})(f%6r5Ywud?AxNX=s3|-O})(=F*%vi7w
z`$NfMA_yCq0)%n{3%DioDhP%i;4U<t3dOCB3`m$RU*R0DBPwnuwVa9#LJ(0WCkn1kZ8z
z2}XW}OW@B8v#w7WfDJ>-5k9n@H5CjJ^j)4zIB?1(825!G0;jG3Je>pNtZ@V2kjn6k
zm~!^9)^X_}XTR;~eu4z2-VOy}!%zX|2OLUhpB)IB?kvP?LI%9N5;2qDTn96_y9rcB!fsvnqaF<4m25f?$Z`zKqbug*m94D-xjd|Z&Xu`&&#WP*D>uk-v#N?$e
zKi|X!6#rTFx8;5DXW9XT{$k|n{hfKEZV}29{PhXU_v?2*L2;QTGHY&+H8|UPUtREa#-*Kiy9*)pqG*~0!
z?ndZl5pj3cUJENCi1?~FhDEFVBsggzjNFvFjUxDo?;A;Y#562|f$sZ#8e*{hQs0YG
z#+NGlHHScjIfMJ=@$e^U`gN6yoHe8mRA}ATFrRtB*jalT$&+YlT`nKH@%0$`gvpW)
z3yI%_sS=-i(;eA46#eF&+3u|{Yoeqqr8;ppyD75$p}
z8Q1;S8U@JUE~(VRxY1U?s%1L=+_`@62*Gz;Mz8)!5T5jA5jpw{*&mrlWQTUa0CWRmc^3N)c^djTe)o+O5*tOl2=|So*17bcQ6fy`RiC
z5Lf~oRS_!t1JBK&R*iYlhJP3){cKH`8
zPK$ogo9Utib$m#T76&~3I^5l-Vat?d&vYnf{dD!l;STv5Jfm3!dfa*+%7#oX6K^)Fc*9l-)h
zqUIW<7X^YNz6+
zz$$9d4`M0g-j;5$$?kUS@CRa~X@`6#_TY@k5rzh+w%i#CZ
z#{lc1{@|}tAygfv!(7n~@2>)lrMh?fh^5Lzt{xR41m)XR%bbsQu?IZG%-7#j2^9KdBl}c3Gmn;BCgkmk+97
zsj{`1sEe5nSBL!+`TGy6NOhSCeNR~{drw)gX0VD$s!XIBw0fTxN`)|?`do3k!9N}+
z(scdaKs`vX8kVSs8lFsjjw0RwqnJWn#d@$BHW{@d57$_IPAb*lPFL#}wSSO42FE)?
z1+m~8M+Gq_v}z4>*YPXAK3gE%pT*aR2djAbV5!#7bWtNF8>p1K`>P;K!Ix{&vP5lt
z`%oSxgQa?RW~x3%Vxm5Ww#(~DpQW!NLXsZoJNno3hJpGjdXB*=s~@|{boGMgLXSp@
zT8D}StIJZOe$K%4SO%V^XOHJXtKK0ihm14$t3+X$GS`7
z$5Oq5`Rl#lOx0J(>aM0n!rT3`9PY9)7Qma;%IU9S^TJ%Q{u@?ZED*Iq3hzVtCm-dK>z~4A>OsGx0dH0WjOtVi;7H#A$2lIUufo#=U%spi
z_<}~F8vATKXwE!zI->8drvvLMgT+#{g*1yxq^{!Co-|sZ?
zpKAmBDxK)7w+C_QtCU*@&!ss0IeyFE58ald&DCL=U#i2jGMqt!3^3?;yQql)?SVp{RQ{Fb
zSM(|S_c2Zb%#Mn^lNVG@{oUpZGOg(fx1H#~2!%7R8gx?hvZ8)h+)7Z;0d!Yo;SU7m
zAPm$Urdg>LH0+MhB6#Txw<$GNgGJ*b_3qGkQzrVEfoMd6DTA3M7Q`j_V+-vY>phAH
zs|5$K^Pc91%kQ+cMTDpZRdk$*RqNnH;^W!JA9tFo)SwwQPs(i5TF+7?z1LLmHjG*c
z-}QOtEMIa(nvQzMut{m1EFa8Pq-!=WF+8Wdk#@{Z)MrZ<{B>DTdW1)Ckzb&X?|HT|
zM883_L2hiq3@p=~*?31F)}NJnYjvd_$g`r7DnloMZsx6B`;*a&bMV@RNZ#@FE}&pf
z54x~eSKwFjM3ZdZf#0mygYH3II4;=}6Wtnpy?LLwH~YCt6)iS`WyN_{oVJqO_K5QJ
zU`FYiPq5gGJp=!;>o4DPw0dj7ON>`P1cp|%Q2L7OB*BN!BoP0On=_edD<%OtBuwbF
zz(%i^l+-gobvm^lyhBdWomP(w8*{Z<0|+7yZ()yq*r;OdjXED8TJ2rMFiVX{>2Yz)
zMI-trCA?^Ma<#Roh|jO`dgl4an6mFvl2V
z&eMUYfVOL-`iC@FhjfCHIKh&TxT|C57S`_uh{FZ=bfLq*2fMDaaeg|LZEoV+w#-p8
zVwNDT08f>&rVK7Qv)??;y*c{$#fAlX1r5t#uyq-)etFAxlS#|%5wj+W=C>cNwG}=N
zr_0%7H6^R8c9^yr$)$1dw{?a220q5%$$GT3(QR31k*2RviEGBe`w!SC-#5M$%!Cmm
zB3iJ@`K7G}7?ie)7h}48jJeM)PCH&tDj8;V1v3%+LB9h+lO}~y)V{3HCQ}~Uk*2qd
z0@JYk2tvr%EPm>M#0@en#21+RiF{msK)*5{s{PQPx1wD^=SY~uoT82N1oZQiod^ty
z5+tI%V3q-;H@JDN1!TUb8biLit?>G3CkMc7T^I(9As+3?X02<+P=9utU3zBZm?AmJH>+}dAR
z4&X;|)ihk-DEN#^!)NfOfzMV)MY+NrDxrow#3=0lSz6$M?=H70_NeezF72+17Ns+P
zvPcaA9dFE((oJ#fFvE&mD*St_!+F!0T+7A_jZJprWnT=+QfpTRhaEOHH-3&>{M&le
zN%2V!RpBQ>yLiIbK#B#Fob>_aTBbWp>(3_7_6(TdrHELXcXG?a^4P-gGKomXo-DZ81m;NLe48FWO(SPY9R>%U;wm~^2?MfVveeCLA*Dfu!H4YJeA&4Wv_
zP=)8lD^JyhV_#ve3VYO)w4>OH?{5bA857$-#_p>vvH(02cTXK6LxzkH-9*O8bwxaw
z$Wy!1K^cp3dXe1)D<4FmEqoiUntj0ISXc%f^j+EpaVdJ2nmKpw+FAm6OhppAjkG{<
z-e9=$yz(svUb=k&cG=l@BB6?hFwRm*);c1196H22?}jTJg`*0Tu!FSo&#~*a4NOb=
zu3s0VV74H1o7?uQ&fW1L$^5$BZZRLne2vYrCG&>|L}M4i?x`KsQ+VJ^ltytWB)9*}Xg7l#7<)S+~=A
z(GtY5Lq@DAHzrwdDQX7xIqSe%>e<-$Xv><$al&7ms`JxFX|Ke}W%tdH`{@eGy@*>E
z7rvwopK^*+D7#r4h??=(rz|JF##cSHw87kV5@oeQ#HWD<;_OCP95IGomhM%9H!&I(
zDKHq`U*H>dKu*?!q%q^O2|mSrO2DLc@1o4JBk=Ah3XOOa@`bNca0vUo9dkWfG^V87kl9Z7B!h<#_dmbgaL_dc@u%{r{H_1D2DKk#cGZ_K(w)B#dOC)DXR1@7I
zfPF0I6Sy&R!9rB)M}dJJ^X7#t5**nbpSxo#dFJkZMwGzU=aJWe;A?&ZoKu4{BQbw5uBdPXzB|2Wlxp|VYRVnXiov-%Tjw)Z;zi>CM
z+7;HOS-v9be6{^9Vn5w-T+=PFzg(MU)jpy_g&ES~3hn5TVs#bU^3ifP;Y7ppm~kGF
z>24Y6S@vNC`lHd0hZ-xSFW%7iJ>E0OFTd2`%4_DIryD4GQZj;#*{q9RV{1NssXok)
zX>BxapY-_RScs+U*o+flBbXTgxD%1uZLoAfXrSnMg0(VOlOSMR)&Uxk+ime2T!b#`
zIxm@%BbWrUf7PIqkl=b3`@;p)PR6rO{|UWhtPT{|Wfb?XrCr@)whlI}^;uXM995
z#Jx$sCUs+LPF|-SZN!?8ZCZ3*2c#r?VllHIYveoqBO+7NXei`fUUg<+tPX9d3jC!{CT$mJ~4xO13_@5Q^%h
z+Ym?8Qk`26zj&P%kBHKg0xPzc_mcz&?2;ssuhNz@1!`{`5i`~t3=R=u@3hD!1m|dQ
z_aLYcdMFu*au)}uxculBW-uL`4xw!szzVls^Zms`S!#@-HHRC{J_(&26ogFbdP^W%
zM(SQZ5~ns(UZN|0BM?nhXBL$n#~{S-wj?MJ*^CvI>%#YcusCP@(;`mI5M#_P`AJxT
zXDDX28VL#Yp^~io#p6Jbxnpe~Df-6z=|=eboWcuEU-t_r8l2J&Dpqq3CJTK~nk=(2
z^GDvsRYx3I0b4YO4KW|lnT@_Sx0!**fv>n<-`{#(d6^?^wHxAAgD_xdrb3w0k_rRu
z_LQ8V_LwL|TF`H8$cHg0{i>R)c%DJ^7zby-2uwx0JX<2y6Hdfw(;NAk=7g-`*Q3g>`?M~+iJkv({x0{UBg&d^wwBS^tVx!KHc6QN9wG`cYg$1X*tTW4sC&B>b$I6V7oqF
z7~elV@*J;~FKDNSC`%*vYIPkmZFpP7o7Yi$UKY2xlXY3<>fRA0E2=6`P^FBW7YBn{^&2kSat3tx^mT@&LKX!
z0uh3B382hIQo}6X{RzA>}q^=Qz?kwVrxd!chzy<4QRG
zjzlFR$Q6|e&^ID(ysi^tLNa|jkD~GCKJKMgt;4?{?b4sKq`~cXXS2sTek6@GE@f6S
zXe==-9pQfU?qD<}ckQR$R{%S|^hY7Yzk0@ec@}%QbECCHF)@ds#lylZTIfykW*q5Y
zR3<^ON$6+(9T0)$xm!O)Y-kip8+p~A_a4QP@4y*7#gcy`wNiU7S3flqjXvcA1`i@C
z`MmTWsI@;9>JOUYVr2zXT>K}cV*3}RLSRt#us0!OkT)*cm9$|3H2!NGaXY|*{!Ff{
z3>bp(Z>R>i01WZJjn@928t`;>e=U%U5%B1;CdL*9!glV2T7Y#i60&iz5puFJ6Y2n(
zL>%qx|88OCB4lSKWMgM1HaJCGG!Gd}1zJA&`Z
zF7a`TYoC7Sjy#tvl+nM1dA_}!tegxy5Ue-ab$Y!W`E+(#PxyR&Ke}sru&dJZUdih8
z`TF&JYa!XkMnK^GcJJZraV@#2iQ(Yvv5J9Uqw#=1PvG^b@%8%Ud@cFiR^Zw3+F<0l
zbeC?=k=lS}^9#RS=eLKoHi7rc+m{}Jm;0^gv8fFLf~?j1RzAM>-`6cguLpY}4B4IE
zy!bkQdU?H8dwF?zzDYOuJnfWL;`k*kuO)4FcqzSfczJm|sben6Rg264(Han~0nr)|
zt-=2y8v&vWH6U68qBS5|BOo_Iw>b_sr6sSCTc_teXb_ojzyneD);m7PFKHN~
zWijcJmQ@@Tz83m{pb_p>o0?kBLMQrF#PemnIHz5m@*-6di2}PM1!}dL@|nVM%3AAv
zm#zxQ^K8<|a4X`b)6Vr9gk_(AbJJ+xl_?r}UEYaA^+%pL3DfTJTH;gE=nWnWM+MuJ
z%h7}Z!lm!Q;}(w7w&ikTk5O6}wv7e#&hP&jjyX;0v)ixk0z^TE{wr%L5zHt8fR
z7H)ZdVJ&E0@-_kI&%#6bCggmn=c00pC5O+QCN0Cq^k4V?T8Vu44^cHFcB!&p8muAe
zQ#39n>{_T-cJ-A7Ng!GSqBS5|1EMt`S_7grAX)>WH6U68qBS5|1EMt`S_7grAX)>W
zH6U68qBS5|1ERHmM{5;ove5vv)_$T^-SnZvM6!Ss6&j3nJqLQy2DQRZ+f$+bRy>H-
zhIDD=$+7o85C_wg5pUIr1t7QWQA{B;Q*G+(gq5bUGik1se#hY9C?GNPW4drUn`6)5Tl
zo&qJO6vQ1gnSW`vtd{$Q=$0}rZEAvdBsE$zhIl;Sdrl=0X|R-PrWn8cJhCS|K1J7#
zP;LdF+q50+wO?NFBubd5yV+5g9~Td)c-mxFGqL_KA|F@Uq@QJLHzj3uFP
zG$_NbJ?j`qOh_q0VMBXKo@P`1am4SSN;vC6voe9bgIljX0bk@XRt#8hDBhLboAC85@Ycf
zfs;0~ZaIlK(1i>=c%U|+#?iIgf$s|2vrD%sK7VfY)mCMbo1mN39O{7xmH-!^76}`Ee7}XS_D}RBPT4vUb
ztU$JBPn=BcU(G#YHQ|_HNF~g@QPfE|GbrI!sx^J8S&rRpML@h3m13i~;a=rfTID!0
zyvRaxV+8q1!6&YW^S
zmCt+zP3vieOCQ20k#axGNo`w^laW(Cn_a1p_C&-~Dw{Vr<@a8Cd%KcuHhvL^!VXb`
zr+s@Dw_!Sb7+ssK|3Rm}QKR4^aAa#)mNfTzb;WvQ08c@odk9sQe*)hnH1qMjh=n;B
z8R>k;+F=dL3t=j{HApB+uIs>^IF^t&5U*|jSgJW&87ytR;&j~W>-?m*we>RvpLXgS
zSAhK`#G*1Lg38011`<+h`CS=vdLgV6U$091Pufj=Nt@{R2q(n`BX`=5Q63rHD^tM=
zIwO)PlmuM0*iNEkMwj>7GX--P!ZTs{LWww*@UqEh5YzIxkV~%V&5=`>up*>+8fVCL5bnOJ7Od
zD5rHsWrK@^Ze>f>?9SuX^6a|3!2!iC#v-R}0zv?nWh>-zUe{$fb0UqO1b;uNlk%UN(R`mwGYQk~f(
z^=jp|+T0`0*SgaLItTEbezXfZZd?M7T-ErAQMO_#_qoPKG>XAx5=h<
z+ZaLt1sPC~0R=xy8BmY`1=)Bt5ugC6N44y=+6&r-ic+oBc7Sdh
z`b}VD?a9q$afR4GqG@UqJOIThTB-BzKtR!P7%!gQG*x1_H^4GH!|h&5%Sul>GSckUDL7|BedmzFI(y3a2<@tH8pUj@us2AFj^
zhQDP=S4HP4HI-GzHqX#CPp+&|O+~HMjGQmUHLvD4D!%N*r*5(QDryB!-8t3b3Qc)W
zzuZ&BnT&pt2kql3b%LRCpj?=xy8BmY`1sPC~0R=xy8BmY`1sPC~
z0R=xy8Bmb@yCBO@(}>1pL-xMVn~L^LSh`?7^erS&DaUjdOUxF-C!jJtK&q=gFzWPCdh)Gy!Sy7QO`^g-6^SKDo7$1U4
zy5@yMDEGlaL_%y^sM+#JLdryKM%-Fu7mu5oxQ)rTO`~Bg2;TIyHT-1$NOhNroB9K+
z{bEHChDTTwBxijG
z$!9BP))+%@X&1uMsT%NWR9QMa=6-J1_9sM%c1QYf;Y&29ZHcL4@0p%3qugz-!-|0WHZ)ZPAK@-Gpif?pO&2f
zhu$AN#mKj<(Xihmy*>?g7qzs!rnm?)uV3s(XKTx;ZL9`9E}cAHSfs8X=_j@HHHV(aHJbAP}S-f43lv6Bh@cWzSdEH%3-OZx5r%I8e
z!D;fEr{bR%m%nx_HQGhd!7&EE8hHD@_j|k}vV&@Eb>L4DR71de&|VfNQciYsrt?30
zzP=H?Qr9zC0u7hMB@w2
zN^>ZOMl?)(8>(u(6h;umkj3|Y_HsXGRerVqc&0Z{Iaf2EOmPd6lOA=!;=qu~mhm*MG<`%A1Uk{CSAf4}uU4_o!jtk)9NNOdyPNc)2
z4EOre)o7`#%hc7F`R~+zK3M8{ol-TymPUXrBTMs;x=u`@xA6?P9J&tN83V!IM
zDort*l8<0vX1D$nFIb~Nolv%K&>K1-Uc90qk;X>%OIB5g8p)v?hzJ|p@5fnI-9?cO
zIWj#-+L0J(byA*Zp!W3rh(Jd#@_0S1W*b$!vsD`u@f1gOm|FHQ!wZg6wy-VelDJ>bP)bRw4M2OI(
zOH!YoMEz&+;f0yn*3TnDI-T5|-d=A9zmMPIwRrf
zP{O|i$|!78m59Ro;k3x0Qz($4(FB_e*6e9inEQODx%1#EzM>J?vcPDYmGm8)m6oGk
zNSd&2L>Ij-Be)u)SbatxQE%U|Ea&(c7aX8Ba7nq()>@=Q%AGLDxc$B8He|kARZ>g#?tbf%WX;yABI*|HRm}U~qR_>vtiK$g8
zzHbU6ZBN=YY!C7aB=e%&s37ZDGZsa%`F(F;?pV@xR%x}Q*tonnf*kW?s!Mwt0>*rv
zc*#(8O_;u({=(H{=Lxgy?5sVA*b{s6n5M+uvg(*Ybo5(9zLiO1sHBdc`X}SLeSE(vff#<@-NVA7y{#
zijx1O%lbG)g!V!jTT5ohV8u&h5(Uc6N@~>7Vn&WL`R2hG#0+~>T17wf6tbNkQP-!e(P}>
zDn#OdS;R*KEwe2wh94P0+(z+dVB3onYn%XuB}NuQSt;dwehuX7uQ1mkBQmiO6DFNF
z46hnrY0uLW*KwfBubii@sKk!gBQ_DYfxa0
z%)O*z$ivpnpyDpF*I2XEFY{6^KBA2o#7wo4#kB
zf4oRv4v+r0vp#F2W}kulv`
z{j$#Kr)}~>*8HpHZ1SOU1cJM5@{8O0=<9+d1BZ0{omUuzHhjjz+st`O8kP{It!Hx6
z^PS7R7o-o~_84p@@qXHeFO|2dBx4A)^^q&MbfdUaI5P<>_Xi{o5O9eE~5QSLN`yJRlfTkYQqTl#trY#h2%XxHadcL>F
zy7yXfq$!PLO3=9})2R^vLL843meiV%NztU2Vk*l!g&JWkPb)V}
zrFtgBDoNp)qTqA;$mbSMF_LL)p8dvq)N<9nt8khyI-2h7I7L<#c>*%|^tE_7pSray
zF13F93kpUZikG}|0DV}c<%CQti;buV)Lp*YS9C3tB#*X8dD>RA-V^XEil++8%2wl!
zsXIvq$K}9dtPmt10tF&aAOZy>di1h+LQg-p
zXlZPrEcE7QU6JBgVd>E3KCwA4iA41(Y1ckjIme>PQn`ILdYrBL4z-@e*FzoMFO@_-
zM*tg?RX&Q<4~ukQrudkv%)&w)uhoAX)hr&JhJe=GnUt#@NLI7JQtEVwU9Pl^tt0O%
z)|mF^$F%0q*jqN$;$Aif3q$52hJ!Mhg~Q3g)M5VKvkVr~a&7q;*TGfBtY71o)JQ
zZr$!x{QQ*9L8GEDQ0>-2!Z^&b;asO-1_pzJ8}D^k9K{;
zLC~R`5$YgceWAO2?NJF4;X;$ch_%`n?Y}6Iq2S#m&&Ug#^ER4!-ZwYs&x*>s4?dkG
z(G?IwKoqS#C2XhiirnUQ^s+yYme@ZRl(YD;O)AZXwNt|+B!_j}&9aWUU1+&e5hljzi@@I_*vhLm(B1pymdg{<4s;WVa4
z9KQagmla2+z3zo@S1#`2cP%W1N?zppF!3!dL=I_2f?S=4KM`a*$`s01ab~l`FY;U{
z>+3ad#g})l-&_dSm%Jzw>0Hb^Fv8SenKYitf@^}~Q5#y17tqiMpOADk*d9%1l=k5m
zdqn34`N7(RDScB!dtV!&7B?0UgQsNCkeX0*KH}^0CdM1~C{2NUgVYCSLPKtkh%^HU
zXMM;w-z!pE-$Vz|&lm^nY?p;+?Lsbb{L*IR70xZ`;AHca>bEDNuaU9NlBE{BY&ugW
z9fyw4RMcLf)Nr%k+%=;pV3pKT9X&GW9&&^$(V;Wcl*k8D3Onn|Z=P%TWO2)!jwIn}
zKI|-f4_+|m8mHsSG>0B!v|H_GwA-Z0MShtIzT+BC)0m6M#*5PyHrB9ZD)#!})Kdx{
z`4|>s4QsNFpYgO#m<$b{tf@!vZA3$sn7jp-c%K7|8Ou@1`7vSa+^rd1=$lG@6+b99
z62E~D5sReUSP30fV^-eJj0#MMRuxM*)O
z$}o=j5TQ-1tB~~6R`hC7f32W7VecgLJr@v>2Fx!@2E97H-3wh92kPmf%ad)YHH~ld
zq+8bKYtGF(PuWt~D7XbpEql2RE9RiHg|)!(9zduv23;mWKBdWI-=Dd6O*bV7b>+IM
zZ0O>`fd*j}`^1YZg3(@=No(=Z8ROMeoq3-imL9^sGL(mXgX`U)iMr&4-ChFYYT!Tw6q968VB97k+CO+i=^te{rSSEpV#t>9lD>^sG{E$LGmDx
zoiiF&4I?cK8ljXYsr=gIreQ5P%KT=;k8-NoN0e5wlYO-DTBp;m>kAE%
zECT6j5=v<#vJkR)iT;w7y1DkJQZ&_m4W5QgxVBp_MxmH;hsv^0%#m#}!bHDhQPn$l
zy79HG>ZQ)4iGi^eK3)C9z{*rw2RDnzkt{m*BID7vSC2Y^QvLBBUCk18c=2uZVw*2H
z-{%T6^{*;zF&*VAaUSJzRgR@C~%_1*{lTiJE0E@evK?qZ`UaFE2RKqq{vCD^y{E8&G71tkI
zDp2RnDu(4;=tF*Jcaf9CiPI3sMtj%U6KpW
znyA?7`x_s9aXT4fmWsIS@R5EPSPl_Bi{o-3%r$x{ioTl%@$nP2!fwjjFu1$YPDxo2
zHDn};)Be%ko-?QLuCX3E@8lTaQQ;k@tXAG{i=%`1f`JGw$^?2PoUM?-xvlE8`jcx2
z#k*{(PEBFZp&=#)b^pZC-!wnw>!xL4^Yv!?N5Z)c|5k|?r@d0f+H44KX#<*s}7(w}=x
zG1MvRgo*xwY-5zA^oHcqDO9$5R2FEM_0_ST)8WA}l(z-XZf%9mC@qy|EG23k63vLS
zZ?@GW#eLv^|Aa1}dAFS)pd)X;(b95VacNnu8u5At6&x=g!^i!a!Z(Kc>7C*i$SiY5
z#D8FB|KQ8N%`6+Be)c~TJh}c^gBwu8`oEQ#{r^_mX8aq?{uPA!zZ8}VsHFX06_(2U
zKRVfeD{RgnZei_g;z-CKZVjkGE^1Cs}%(^{Q3<8fos#i|NSfyTPfYsURpnsGhUuK%E2
zx8r)Kj=qp#m5sfpevn6YzFb`Ur)#O2z?8>#jNmx3r(+84rRw9j`h7i?88s3-=_K@u
z>_gmc?j%}`#nEa!z~^^$fvFlljHj;MCuD{$zy(9tNE{hndU^-;k#>EcF<#Q4^Dn@l
z8X9M;nRWO^n+nSFGnx%bBQ@h3lNlHSH9Q&r}7tgzw}p-zOx!zOOFn_vtadXekEb*up-Y};>mp647Z%yE6*(qAI-
z4wt*0X;r!!icO2G1B`P3Nw|P6lV5up4hCgBs!vHpo}GCtnu#X7@+%rf)7hz8WhC1W
zLFk}x3RR{WOj9M{Y|#~%Xr`dVI1cj;HPcfid1j`{48xvZD#Xd
zh*drZ*qqhX-Mqo?%Ud}1vpj?{3z;jcet}YorbH8!b>a=s-$yYKrQCjQQDeFSG%Aav
z8XFao1j11delUDyLv3g_Mq(DO@0TB@vS`lomqD)PD-TGO=t(G)d<+rFPbSarVZO5G
zOrJ(FO3P(SU9BDE$%_b;x<%vU9Z{s^j?JhFX&v`iV3zyNEIjF}(wMHfPo+SP+(6<*
zcauPg_8BdnsX;r9I1y#?Fn0*M`zQHuXtfDLT^?c)n*upB8*SZL7xRzr%zmsEhGKX!
zmU-~LWwVkDXGDwpge1ZVHB9#)){ZeSAjQ{0W~k^UfuE;F;!6U#`H$aFseG17sO|O`zAML!s>!c>O-PMxpH3vKuhoE#81S>xuM97+=I|l
zz5J-3kFv>OpQOkAjCr&74=~LF@;OLUR{79GTOZ&jjD7rJNR+rb7zz?cMpWa1CzRr-0fNMrGMJU
z1Sgu5hFzh5=0z6bc78tut(Qmdme=zizIxr%e<}51dgEPmQ9Xuz$PJ%bqOq7=?>W?)
zpN~W8)T+mfuX>J}fz3&?cWZyJwW)cQCp@~eY=7ajyMTj?X;)d-m7!S+?dXbc8?qMq
zbyEYU;@ogq`B7&y!zj_|l*j`0ORRlZpc<(K?Z>2)>V;|gzP)|t#>eWH>B?xyH3N7V
zx0#vBbmQ-`5}aBa^tPr|VO7p@S59wh%<06_D2G`HFOWOd_QyYz?Akq*;S`k;h|^G+
zjR!PrLTabyRD(}BBdDlpj)cAE#}A@!hMr!GIdy*AccFWTVbvv4@gOd+A=0@0c4fCy
zD$dL`92f7BSZ0tVal}V`fGNVnY(8OmxwE=D&@*vRf-lJ7?RFLAL-Z1w8K;cI(k%O}
zfE{K^gP!S+99keHHVE;PI~^W2vff{JRPQAJ>dnEiF3Z|fsU(a3LSX#k?^9uvem(qJrgv{%sxzwv5<1TkrJ
zXK_oBRY@aBCivD@3m%TSCabcF021SPH_`k_szzA&IhU(ugOg~T*wvc_dFw?ks;Lm3
zwG&&F*{C+FWH{~Tk#CLEm5B6J3~!(G^s?T)y`EgZ-4WAu#Ce%7g+M9|Ez{E-hdJ8w
z(Dk}vZX{xcOwiQ7n+MJNW-z9BCtgOMuU7Ni3m0^$6^@wY`Qxe~^UA)e8)977H09*o
z#vA6zm|6Cl?-*58k8nrSK2DxoAiO$}C`^|@-W^N4$hL86(X-d}8J&>e8)e#!ZV_Aj
zGNavaIq(Bg2fyvjv9=g_QFtAju#M`H)I?pD|(eAsl^jZxC4d`>T0o)-SwvfR9cd8(rB1kDM
zA|MDzDJd-?2>j0s!`y@zQE=ph@F*2on
zUul8c8aNzefy-9F-jeGOS#ti?+N;ps(yY{rJq2gi&-nM(PADf?o*ilRQQ>ze?J*Tz
z3KOyR;k6X&y<&=eNG;)@W^i*NLvb^jZKp-^e=kICJOP31-{zuG24cYiQLu
zth4#2@*po|9FLLbne-T~ydyW$$%gWTD^RFySEOxN8D~6RSG;tEILPdn5<69r6ZFwt
z{{-;?Da{!D>&mBP`Q!Raq-Bcxj#1~749S)2zUth?e$O${c{`tUT(HN+zm~FDtRg?u
zf_+v%uI<@{$?ne2h-D&$v3RM$<|HLqeewiMp&SRaHuXWrBNcA7T2|mhg#&
z<_`0$#9mC;2EYBim>_;&lOW=4
z>VgL^us^gHQwDgaJFqcR-Oa?+%MsWjsNw8pt^xao18gC5c5#)oGIplr;Q@Xs8Xx|p
zWo_naOSEw^^_$cf|Rp3SPhfn(yK+yhQ5-BKfB#}z&>R$FHP&*}!qiEYdO%&L)
z3cc)L4c|ZsLY$(CMDL+j)C2dzh4@E8h438~DhLc5ddl^eRCz$K-nnV{c=-SNz>n9%{KP^8ma6gEbmKSzxEjKMcAA}Ynu>UAnQ+|G!z~SG(Fdg~z|GdBCSpRk5uo`I?TS4uO&q+Y-%#Ioz#ID*ynzMhDE#jcq
ze>N1{hlc`!JQ9HN^8g>1j{imH?+LfIH+NAs_qYU*@4zANYHVk1dK3ryyKoQd(*Arn
zf`dbI28T=B#nc>_X99u(z*8lS9p%ieEv;Mu`QmWF?t}g992f-q32gqgbfE<{W5Xw&
zgap(Rn6TWizk+B%JiLOyGX&v`!4y{6*dCbwznQ%IoQOME+L^;UQ+GAD*MxtAH3v2v
zn}dNF4bu$d8NGiE!PRd!Ci8&-MMmsW1}Fq^14sWNpXNKPiKVKpMIq*OOkSK@yn?eC
zjrapW0}ehhK5x*qq6^$7qlPq<8gQ!O$*Rck)vj9+lgh*3GbcVL&rwBM#h59!7Zwj
zp_pVf_bix!9|hn05hO}2y74@R#L|ddHjnP-aOHCsQ7_10qlAK5j-B!&)zQMd_JkBg
z`DtsE?M^kjF&RqZLlh&G_A=r)nwYNimh!dX27fd|hmDrG?A3%b1bZ{13c+O%Kh
z`iy3}v9*o2qXk+OeD873(J&Kw6`YXwY1E#lfZ)1-C|?n^
z5uak4kKn4V{yNW<6=r*11A+s6JtI~xlHzP$NRU+=!Pr_oOwVM~P@CeI+(xR$+-;frT=vfRH}ShyROimKFbTM{R$Lg>U5&NpLS#~N-*
zmW?ROn-u2yxq99>mCb4{-v-IrP-2N`CyCRQEej<&n>x>>nT4UXBnou-=)c$@!M|wQc0~2rmv+;FIpo4JONuEvD{@X~&I`
zSN4PIj|N2vFj5x4b=gnNbI?l8s?ZQQlQ#Jk+1Xy*YO<{$JmxW@*@>lX%Lq5RvC7`E$-`yW~mG)Y-JBYon3t
zOT+gIR?5xJf0WmPTrQ}ocYlnN@W^nh@3P6*j+va`8tvy2m=!4LvfNh-ZJr@cUrswYjV
z&G#S`>zcli&NAe63q!1nmGRV+7D`nssqb=CsmI}H
z`jO2Dmx9e?1*af)nTMgZt*qNs`BZT0J7?z)oHraM)1b}s6EzCuW>6ubn}&YScaO{b
z#S-Gp{Mbz#x(%2DKMSMVC+%AGm8#tARv{H`z!BeVb$s1L`(Ebu*9%|QUK&H8T-`C%
zA@8s5eQU1m(;|cVWdw?VpJ!NTZBMwr$4k(DAR6E{%ub$?>F4e1+?LlR6ooMwFQM%I}skc09UTD56NXxV?OH`Qw+G0`pcXR)Tb|*mhGQ
zZ;Za;SZt==nwJ{(33ZR$XiN+9v(wIW``iZ+k(BOwr0=d`OPfaT28D>`pQswKX-<-n
zfL^DlxyANI*eNy+T8N)X?h&oZInUnOqaDgX+L(Nwp*HmP{TBJjY$MJV;XNn9Xkv~k
zL)N0gLRGzM#PXRed_(zBR>$7S2NVn6q5lv^F%&W~i!UijpfSl*bhE(LDV{H`;DdIn
zww+=fwKX{EqUy^uFnQZK@93Z&?qk_RGC4_7#2B74>!kFuDg^G795_!&W
z497Y`3@WiaV?Jk+mz^=Mkbeq#va4E|w?g%30*{q-FzO9fcm~Z%c%rsO;9%QhT9|C@`23D
zDdaIxNi%HEKG5}j;^k*xUVZ+Ew?=^%zwvkg!|z3Rl8e8w+6Q+c=zL~~XxFvHRS#Sb
zrSok5*O>%}1^
z5}~`Rl$*tr4JOt1j@`9CK3-IHn!cMlqUvo?w~=S*!#mVLO^vpa7iHsF+r(RBWp?kh
zXfK&iv$zz^m01J?$qdUAFg4`nILfW_V(Z%p$a{nl@sBGHTQo_lLffw&mu~PSd@d(<
zNx4Bz=eDQWGh+;gOj>g?@wU*$>$Dr5?vBMM)gd({A-k3
zrzMq7tp`a%3tuTFSMWKa(nJMmbSphrN<*s7U7~{W_A9yCQuU-lB#m8
zds^doMy68_OPDu=&KzBUF!SA-{oOM~uL(TUPGsS?G#i0>o^pg?k5fr2(+?>2NM0f&
zBijxTJYi0XrO|tWaEBnuifK~Nghea23~Y`8Emq9GZ*Fz(6po^%&6G9Ryqcc84IG^k
z*J$15%1F^@awe=x)grS+^3!qjj@K-yZ0NOYyjMToWmTwBe00q!ujk=CXZxW9)tGw_
zHM#+b{M(x2v&1$Z&c{C4D9jCK7vuSY-cIO+UFxc}>`D}z?hxdeZV1tuq4jgqW}!KgcOvu>=0hW@6DQPyWv&l35ZmPQQGA>v
z=}~)b9F=+}S4G}F1qd`T=wx&gLZ>)bPXOMS7t>dzF)>F+a!jtZ&rh{oE^Nw+bk%~}T
zT^sHWVC2cf4r_k1ZugcnI%bnY@;<&M>ujsM?nQbQU>UmJPIq0ZmEGv6V5JKY_yP0U
zp!G?7Or0B41}PoP6shd391L^`DsqZ?4y9&Bx1U!wCGw=}wL76v;pYWl*aT~=uRvnD
z{i8o#U00NRC>|f5OwTUBu)rXqzns^>z*EFmJz=ExO(R$^^!iw2M?!rK!Fux36
z$7sd(-STE@=Hbec8~GE8X`Fn^2TNwrn4R{L8!WS#XR>@PaHksP`xwE7;2d$`
z5tbo^mIepRIy$!q)ja#2g|<7-qSyT5eAdqFid&dAK1{tVY@^9{&NPskv2}WaStKmB
z%3*L^7PnVRZ*Vy-%zCJ0bIhM$YD{~3;4%<_WR3)_uxr3eh?vk{{35#)DHPBd?X00u;tWNRoy+d1_#CYv|(mq9`
zm38l(^c_k5oLi`5
z1-&lf=RUG&$kb>tPQlD8kIeGqYQc|qZd{t9WiAd0Bf>p3^kh)4kG-`H
z?JY`vY0es!9hQz*a6pZZa)*q|*U4#*QNJ^+NYI}u
z%7f1zs%zXE0d?}BJiqseE!UzTLhoBnx(*%IV#+AKf!F$WmF5-u5))zXC%ueIUK;uv
zF;CxpDqHU;)qb}c9YaFhccpEuI(_{C^)VGn57G%N)t)3uZA?vrn{_C!o#^UMQS2?%
z>EAlLWupE0UVVX6cc96g{;MP!#XYs}#Q7QICe6A6P2Xhi1vlcS?}&yDcYPZiXMWIn
z^=i(hvf*+Je!ij?YZ?E&jgFgk&|0r{m!4OtY}{eO+EgnY-mlBahBqZ|EJ?i|b>@O@
zTPBEZe|v3c8Xo*enDxq+MVjunVy^wS>I@dSePXgx#p!IpyG-B=!=fT1X&8<*5VOO*)yWw-U6F=H{a?n4O#g^4b*L)y7ZK$s%CXfdVMIk
z)?$OVg8PCwv@p%s0ekf3Sk&%~T@1RmyeHD~#9T7i-o5Cu=OT`sS;q4ol;0#`n4YQ}
zU6)zh``WkLaz>Dr;6?PYVw7aRu=Qm_91p_bcd8^0>2XNUKu8w7J>x?bx$Uh^f#YY@
zdu%qf(sL?tNfKB~BF}7nt{*v;e}0`&;!Y>{;j*{Owu{E`Vwz}-*NX9-wJsMHMXom<
zdtG0OsvlW_arK77*n6~Ywo>w~@CPOa}y
z&qqVD)Lwf=lwy&`rcz!{1*xE19*y1DOZFdy%JQL$TBJ9PUbOw&WyXA
zu@lFq*|6mlM~i+ofCYlhL7W*(f3D-PZ2MN0t|KZD)%6TViqYG);vuBN=$=wfTd9_-
zubsOaPTK1chiyTY8W#3Ztk^`HFHn0bz;i0xx1Nopg8)^CISucX0*@xDW*`@q8qPy$
z;T{9m)4XXh4T&>s)z`i2h22q}bDkGLdx0{6B9j<#r=G?Q*qn%4GH$l*Y|=XK7DZs3cS#Pz
zV>HU{`>6dc{dyQ$P4*LF6XCZqt&YF_fbQNI=)y+u;X30ZwUcbTPlk-^30#R^-B>*7
zj^b^oLvMtkIYCQ>bF&ev5SQ!upr>@5bjp}$B`yu>6(N)dE0=wV_HaBBdL*?cq?kUx
zBU3JAxM3EVZ$>$&ydf#Y7fCb)u0rJ-Wr}z%L#ZGkc*&H7gyi_mbka-gxx8=0AI4QH
zxIM4FH9J^(o?7We;HUg``z_AL48|-iNh{`~=$RlLMKSf3g=;q#O{%qv2H6SS1%zYt
z+xrV~?3lNsU8WKRw65Kaana?BY5%a{R8b|YiTRkMf3{yHifkyvY-Wva(1$pEoA{O`
z^I0-ql5}Hob4u#=DImC7~;apcSMb|3Np^LQPj#-q@T8-YcpHFi{nAlH*Qyr
zvXm3>3biz$y_uPXx=;F(#qeMpseiPM4b6iWvz5ZBvuAC1Vp`;j0$3Z}%y7+031m~5
zH$l3`d8Q+8<&xw}G76CCq_I6hdrRt^9~|0j-oZJ??|LrFWOe1Z_H#8w%FlGG(&2KU
zB2ny3LV;94IQ;d{>Xhy`tj>dGc@+bhw}?bu_*B+SeiRC)5&rn8Cqqw0D8kX%^)x5B
z1@z1P{I@b@_RU4uI3%2_m#WZbH@)%nML&&`QZ1Z&TEmD!XN)hd)s4nF=cLDKN6bU
zbn%7yMkJLw4KZl*QVt9=O1M3SeA1Rod%kjU^zm!Rxkih7Hq%*3s+S+q36U^OoqSlF
z;JPZqBo>C@cK6t40f*B9H*d*ZNh73T$}H$@VPNXNn$i2r^|j`?(Y;}pBt~-EIEa$O
zkdxn+y~Js+#j5Gfsu$t4?M0v6bBb~AIiB{2%^Nd&P0V4LE%m-gUijX{^jhcI^Tv!!
z-+FM_w&#ue8ws!W_kic;jl;)hFMeY2x%ou$NmJxK#arU+tTnWywD`|#??4CXIg`LY}t8D+l)ia5(!e(NEf7-vs7@^aXcFo-vdZZxqkMh~OHGkgmnzLL9}eB)AfEthF<^9~(*g373Y1C!6x<~O4bDn063
z?sw6YY_i+uDfKgqM-)s=1V3skSC_t;AJX6%JZp=8MJm>m$ve6zC@24l0aJDBnRyus
zh5N=bIo$q&!iAEYQufpuCl@qX5tFFBjZt%pk&z^0=_hYJ
zrJ^iDY8!PQ(>zo44#)fClES3-_4ARr(#snk>RK+$x4fCceXa{7OjdRBy?V()=ZS4e
z2+t=kAE7tNC6>k7@nXIt_BGw$?S;goCmL88_sI(voQ3RZls?!{w93(WFRby}AnVRIk$a)Sc~iEof~mRZPg>+Qab0TNJ}2t>;5N?Ym0>?S&8sWTuSmD-Q$?SlG;fANuPDG~yxxvvf{feSmYlXo%S&xTo&)gA%!}>`sNVr?4-MTq{)iut;
z%^Vl2vIx(Z-_PP5uAOVx(o|jdj_-00@0eY8-|nYsazCz(9IgDSlEp{wc0LzhZEnu@
zSu((>AZcHre5AACpTMawMIr3Y<%&Ke3&}2fb$TghMH}t&XJc&2cu%|f$DYsJjg8o+
ztYzPNF+O4Sl5Q1bs+P!odpm5RQ3hm7%+sQ^nKV3Q__1P5N#x}fFP``H
zXuhJ*F~6>=2lK;?MY7E@=RV0Vg_V?QQ)R5@vhEfSJmlU>4v|hGu{4p4f4w~+-a}20
zY?%}z8+^Gv^y-q7+!-O#n?-ZC)akTJbZo-D*`6$Tm=zLHC+Si6$!x6JezbCu?8f?H
zaK()0o!3`fpNhL1$ChWW^;U89SVF#aH#kt}-;0ZnZlvzIE7)9eYe!*P^s`?mGubK2
z$^7dXqFrN)IG8D?YV(PNWj}j<;Tz+wz1o>f%G;~UMe=#hB2LJt#q_W$
z$|92@qo3BqNH)oGok1gQzIKLF-0Xuva{5{Yx6Ag|ccOA#W_8CXM)sKXYRc_wPw|%p
zCp4gk?HVkT$M8OjF+TrY@R!>%o#)Sfe9nFk;*N%+*JwC!|5IgIW_RbD
z3%_$$P1(*K&2-5c*0-qU$>jL>qE!|=(sxxKa2e}}cLFmYYK
zwq`OaBs-jn0y9EdmI+tXPhhWe?~Tey?`!UAT%WQ9q-W^j)6crzY|+0ODr0qQOMp6C
zWJE}K>wMRPlCLLiQGvlAUOhL2;mQbC8mDJ-yr2R|150-JErHyw9TQTdw!p`5d?CXhtf76FyzOy
zjn+vGAZ_zZ=X$1{(yP2I$Ls0Gyz@vWYrl}1meue?`1
zrqG;~o<4a=FWb^)Wu{U!t@5(#uuMx{f0k~=!&DcV(17x;M4su6M8UPus_ELjy7znU
zmqz#Y*6L6&Q0lSnqLRkOK5kLxBCZIPj!!^25ga%7GB@r^fgtL#BwH#kkhc-0=&wP+
zHo!wU`&?V@`EsC&WttZ?3YB}o+3qbA;aI%-Yb$aaT_wcR7`{mYRM)P*Ohi=*5}Q`J
z@`4COih))-^d#%k=Eu$`$Ii+5y*JCsCN>{GL8Fa>Qql{gZ31-zsZg*3UXGggsW@@#
zBzl`IMJ&I{t{{ACW>1bXUb^Q&D65n7f`~h6Q-xoFNeLD)_Zh*^WMU8+t+)Y*E?-K<-|^3EWqYV*Vv7N;QK_hw^^(m
z-zg31eatsKnA)Oq;SzUX>g|QD*4MkSG&o~ePYqC{@GHm}FAY>iNN
zL`_3Xz}Cck#F7I73@r*7=~;XDdtdlfpH(l#@d#YIEJl;$LsIgTD)DZ;aCRPjQRc8e
zriZ1df5emNSeLnt03c~IF03NDzUla~cD}D$WYlJRt!8rf)#^@T8+Dmdi6m69_iJQK
zwr|YRfScSG?#JT%X*Wg~`8Ma;b`sXeQgHjFlf{^(IzqoXuY7D-R~vx7z=Za3rkp8l
zyVL_=bDPa=n!g4m#H8!M{o44l8RW2$+tLw5VV|uF?K9K2Jp42=Ye|5fnacPiw*hR0#x41^!%j(ngv{_c-*d1k1O@R9OzKr+u
zX%k%;ezWhZ&S}q@_J~fl-sjWGf7ayw_*6=^Vc{OddH?2?#;O~cO^kN}Gw!2nb$Ufl
z?(PN>si^LjrxG--qZxiJ5Xh+{S%*mTmpl~ADi&HVcbwQWB!oucHc0qTVSaO=;Bs&C
zpHv2NHe6jHU+%1}G(Vj^$$wqgA>%|&SZd+wkYVP!9&zxXs{;QFl-D82FiH37vmTFt
zuOd(0sCM2fFBN<84e|l|OvUCF>mp{^l>udPk2R+pwYaJW&_+K!%3j)yO4k9g+~+Rq
zQsEpWrI%v{%VqDr>4GNIc{HqznA=nHhGjkXjE?v)Rs0G2Q#IOq1<_XX&&=}=o8*URzi8j06HyS=HX
zlNB0M?Zao!_&Kkv7R1}S%=^C+KSMsNRAu9m@9Z>c%FPyKHi9x1&QS}N{;y|Fp#7V#kH;@NM>R0N~dg*)Em!%_64
zN-y-zP`+9&Fa?n-W~(?kgxR-jl#hf~*q14VN%0$4SmHdw{S+DP(~7@$WNK%PN+8XA+7I9hoEV2)B>(^6eFe~M*v(zZf1$up^3QoBFvS`R&@HI+DN`GOHU+p5v&5V)3
zPaDl5dpK(|*T&~BPnmcg%k;3UK8^iK`>M%UOJd!~vheb-E`9fuXnDwVg@RwkC_ahH
z*SoV^#hl+hZNw{2Tq(m}G^N?ud=4aSRys`$?XX^GO3h|3jzR<>P_N#5=`;db{tLNY
zrT6x_ZoFsiaMk-dC?@6-KXN52anj?401Y0Hw6W#5IQeulE#Qjy`+D>u8cGYt@Eh1O
z8hs9VN{<9%BGWFq-W%SCwDth}r@OY3S@X%|Twd{4wM(5wt`~OnZ{JxgJa%z$tJ!|b
z%cUPXywB0HAl3QpAg(``^LdY^2Z4CQRywi%o`#EEyzyg8n_lYv$@+R_j1MZj)?+v=
zRV|xkLlz@etMht8GAlmaY_HwKN_r%4C(}=TcaB=1-vk?#I+RCgJ
zlrN!q>W%S-d!N|cj#7!31aV1_hL3?DCsZYXW~A_Vy84qXTc;V
zBmc^E$~5dwS;cU(&70T`1_+^YTcR!B9P6?88mt@2d;yt{TI8n)l^ZM=q+nSai`zly
z3;|J*nTZx>%~?N2p#!g9jS9G{f1H&F)dz1p%dpy@IMMs8G{4lFc$Nl*w=4puK_@5a
z;u&xv6}U^~(njriC^;Z8TD6}YQ0DRkMiclbR7x~&=fA{h5HAgQD?des&mbM{Nn+`-
ziocG&+!uS>=q?8zMX*|gQ0CLf3%6Z;u7|xotEtPQ#vnl#R3uqQ*Ynh_jB1>!S=lA|
zR(e7vgpcnduLpkHInvy80){O*dNma$X9m?Y4eKdS3}~ocRXeum5LUV
zq?e3yidf=}oXK3Ai=Gf6v~Ibu!1ySI*nG`~4&wFOk7`E7St}(9)Fc=l^0Mir$x~wW
z4a#TSJ%#he>@|}}{-xlI^9JNsmp9+XJy|Ve3Fp{-_|T_bTv}YD-in>xGl*Jb`NAzK
zv`{J@@HP55=d-6mozbN_uFV`{3$YAfnW#FR5qVsiNV>12!_!c
zvrkb`AB^lg+p(?t#4pNoS^vr0j^9$QO;$wes+;qQdgV(sJm%&5+nZ^FTa3guW#3v0UvTwSEva$9X)U;mU_BPumjT>up*EnpmQ_k;iGsxcs$tI7DkNmA<>OI6rZ{
zlk={E;d7<&=?pE8#y#bLwv+a*D_@*fNi=q!v1RFs6`4kTJ;lZKTy~b(?Y>9k6yuVr
zquN&PhqZ4#p20B#QW`62o2H5`wY$xQW=bz}}{
zVvs&@@}eX+?gZqPgjEoJ_H)^B>X;yg6LiML@+(Q?r}J(_e0oW4?L6%sc$WLpXHu3#
zyR7YnGWFdA$kJRykCe4tM*3NEa@o)Kq{hIwt)<}nCKk_HOr5<;%Gf8K<5J$D(METXe_=gwls{BXXKch4cNYm
z3R_T{T2QP+{YFE`)aRq6VQ6#JPoSXSJt%H2Y5eM^M01x7>^@u!-b@LOpa2Y$3)ken
zg#|Xf1`YLWS$R_`7U_q?hg&Ixs@#@S)F)V}F_5L;jHz!B>a8|ESK}<_7BD9B*T5a)cBs~ckNy6##o@JeKQs!-gwES<+xaR*Qqk9`_WQWvy90u9k#nn
zc#fqj|~
zO!CI&`sB{wJdMzB537fPt@UHu+vNU}8p~SK4@Oyvaf_-V{Y0nyjO$5CP7_HlUnP7b
z$Gu~wRX96>c7H%CNrmX4k`^@;n}oCSRhRLRi`TuB;z~F_(zNyK3&m|1t#+Q|%Zi&~
zOP-ta@ue$jXUHj>4-$I`ez>>v-Y}0mkwP0_)$hY^;XNS!%p@^UuHmS5^U!LZAhZglF
zlWWpT;@0(`Rg72jtNl&ZM#>4Vm{uv>9L$Q-2m~K}@@wP55FW*nnGj91N5?{0S$wzs
zj8oOOgA4QG2zcdw83=cG_0xz~@HG;S>rUKcT@sXuOq1g1mQ9cFF|cMrmc=%v8=VBu
zJnBgrt_KL}-~?!6QyOzT4i@DOt=$;c)xMR42
z_z~~d3ir_C!c|Vl8G{O*k+?TlZ(@BzX>^piVs&Al4!`ag*<%*tNDSsN+@%gEiaJY>
zq$)<)^0l|oJDK-H2_7|huh8W3;x5#m2`JnOYOr8wb_y9IEHm4daserQ%kV_Kk@5M%
z&1%xFaoz4)7mmrD7JYfi?Mbsh5tY}>9lnguEXp@qFbT&|!tJi{XW}U^k<4I16!}%D
zj$v>UvJW3G?WSQLrFeNm>1O%~g)tTp2AasMDX^Esw%WP;@yi%u7-Cm#hU!R0nx`ve
z3{MC5cZGb242VxK#s~P&exu163u*B$C>XA9h4${
z88B$m-(*0(`bl8~cjU4fV>a!BY+j|id9k3sG!RrkU)2d*
z#TmZg!_v8of5y0D<))fKOU6r8s+UyY2b(ePV_2duxJR01#wRjO%dvYYdX{Va(sh;-O_Rp-93!gxxVv*M5Ptyt#@sg9p5|K534J`
zK!e^gX%AWU8TtaGn8YWvd&IFx_-~=J;6+Um+_d1(K6{45n-|;TE{jyzG0pT$dXIVh
z9{0Cl!?T0J7=6pUGP64COJ0?y!fr0{L7roI22ahb#6_u1T{Q{$*2T2Qg4LtaYR20W
zEpjPHL@S!@F3%Kc`Ww0i6biWqugt3B9nytol)VFz({N@^M#;Y-l8h5xGh5TaztTWB
z=)M8k4*F!l_&7evcv`Tnb4o)`q~bpN*oL!gmC&M)$DIc&xW1eU=!VTH6A6q=gjlV_
zw{$Pr(}EOv?Lcpylc{3fQ|%M}BF{&Dfo+`Ub%Q{5)@N5#-gF#>m>P-4J!mB-mc1(9
z?S_&*lP&16HWR}-ixpL;NGKm*L`K=QQCy|k{epm3J<3tlMR-hWm-588%j|UMYSrVU
zr|BOGiC1Ss*=kLmQaHGuhUUFH6U@I6ieTOpJ838Y=Ps;ydEf
z?KM5Rz34+eb64tF81%tK)%Xuk<9M~Ipl>*Y-()NO9VSL8rbZhq8(vIxzxM0kY&UEX
zvrLWY;C#@aq9jDdoKU4x%BA{Vj7+Am7Juc?AU^avJnSj1$Nt@QPi3|Bo$E6U0jJiUEfddpk#pJ70+
zj;NQN`9k_x{=tNAxf4bcd{w4CzS>R0CFAK#|=_6&pZG241$IDleZ
zg06$*TzW|~is@cblTl@xqfb0q)rpeyJ{uOrM{n>iUSC~wGzs0nYighiY0uiGU^yB7
z@GS8g2i*zY>I<(?2C+oCV9_CL83wzWXqY)KGFrxBAjsS10*oRu0|n&?ke~T{B&kFUNGvPqxdA
zgs}&(Wt_4gR9{Kf)!`XE)!L)EaN~jUt2^Q2p^C2qj6|&MExkXgC^Rfhw5~Df9sI0IxvzQd17_@pg@@*yq6HHQ&jO~&
zE(qQewcR7MZO&en5@saXYZQ5A5+T+1vOX=AP`PETEDYN|Qgb2Swp>J(AKmn6V7p6V
zAphe^mXHA<9y(1qbpBmwQ?&?l26C;eG&%*mvKAjL-H`?7ofPG`;hc_k+KAy*>(}l}
zGF7I5Pw8qK7$Qz$o#6z#vcy52RG_lQ+vzMeZH%o7<5jeAoi^9=*C!HdQopB~t^YgbMOqB`Na-?D$zo)YL@ibLmX<%47Iu(0=84OZ|`jKnOw6COrhgUeUkE(r_C_v^rTW>){{oJr=k&pLlV2qSy~o9mwJV&#j_&y
z*o&{XHp!f^XV0jgaEsiQLfMTF*uekjMA6guK9GBBk@RWdo%exXJg9w#Bj|2ILN}bH
zVwNSJGINOpi?r9Fdr{9aY|Kg;at(PHi=xHap5G&^!OZ_Gvt)`0t)0XuiWnYV3L!Jhe&G9&%B$WFC8uQG*
zNh&3K=2JF%Q)pqT=CCyOYrhbf}a^qx-)vrsP(@@op5`uXO?ayRi
zE{JYVESQz@uU&sT6)@Qo0>h-fl&y)6Uz)FO)>?F#jzf6w)#9hHfxj$3as#
z!Ny+M|6B}vS@@HFL1@QiK`8xbp1u3C1*m(nB!pf$tz)aNt4}au;LP68%F>zhT%{MJ
z(YuQCHTuC*{WX|vr`k^GULs$$%~w*`QBXK1muH#vCibqkjKXKRyrfGukM6E2uvXk1
zqQBS5H^@fT9$c(*-&~E+JYw#l%QGV#nW47pl70!>%DXCMAQ$-1WtIkN+
zJVAELy;l>;aP|X+^&NhRtlh>U2px}*4eJ-@8}+IjlFo{}pNw)g=<%Zyp3S^e*JmcE
zhMbBb2p)}iNN&=Cc~AZm(;L$3FI6k3*_7P|YwVJ;>_yXFKvsO`ueuJ_&OedcoBi@!
zUb#4eYqcR@%2(fHh{Z7>vKU5C*thH
zdPCkxVNv097VA$oyXen}XvmX{ARy%@4=3p!=Fu@y$9ji)-Ht=EVZl)!Pt*2Rpv3FM
zEWMzu6tpfqbN1})RvgawvkD3ag1Oe0{t>ZsXYF2klNLcgf(R^Qt0JTmjR`EZo5b?F
zZ=OyLb&rwr=Qt->5grmDP9|`NJcn)3adw2HpD3y2saxd&m(VEDwWm0wB6qM>Y70(0
zSA2Gjt6s6vC^j#)cJ+hO2AQy4_?MUOykbcDvTXQ0RlMsQMY}l*LzpG8V_QueZV3xR
zUHE+5+`AkXPBc6@Kinc^7*5{sQzAG){5D5g-z
zcMR_uI#T5oTdRK!;*ME}s_9>dTDW>1VzIQ9zgtsY&S$byza`$w=Nwe&UMZ41^oc}O
zhch5^ahP?{uRiX+<+GxaJqB_yq1tZ=dyhrxivw0JOhk9)6YY)^7B6pou`t;_qk4iI
z$5z1jm82tEaQR)SYk9;P+6t&3N;Kn0m7w@EZ0*yKdIl^OUon>5Jv=(}Z)4{!S_D`)
za%YNP=HXf9;l41)ae?pr-A)X%*6WHUZe~`3K8utvtNkdPciL)ZNgvdy@Cj
zIG(;Wjo`gGI_2_Vd~a`WK_J=15v^*tPyiK0lZIgPs9fTqmpL4+W&1@g5mxQ>t5Ps-
zSfSy5DHu@Chg1u8jt?jzI|t?#pat=Pd4YT)AMX$KV8~T?N9Phj0>ERD3h@r=PyZkh
zDj*0exBC_Cuo6N9?eKCpSfUeA$94_^qn!sR$pnF52~lqFev#hyT&Tv;g?NXVI0w`z
z0@bevm25~%9IBT6ZTb@oJOjB(O+yvr(8!HF{P|Qk4w!}XHVQg6*X%@^wOY*x$t`#E
zH+L_z2l~^!cwz7u3r)Z$t7LPQk>sd26-
zaZMvavWdDBB5%qfQ>+DK4aW19BDNcGr-ZMV$(ouZ_YHWMR5Jzv9y&c$s&)MY?bNJN
zNJ%oj8NqJU4h6o(?4!0a){iCowl)ORB9h_G;a@2eIjS3{X_`D?uF
zu@dea#}8A4bP2)@FSG*i2H77}p5jJnV71mfN=K1ObtR#0K;N9351t7olUf!abARq;#WQu6B3Dztj=?{;?PcC^M0X0*UXS7&PzH&=5rT4{Hv
zoja_ERK>)`+|<=YkChc(|L6*oIKp%amd*x-%@wZCs>aT+vPcl1=?NWC=TC=g4fUfjwV%Sb9Y!?{|K63*M6i)!^)i2)ZESvURrGryx+x+*25Zj
zyNk5Sp+5gk4v0PxMVkn*95qlN*eySjAWmy$ZEWdmY)=cdpf#qogPI!K(V7DT3)Uq-*$@F`EbDd5%sH}LmMFg
zEZ*<*XYqd*JAjA3S3d;5h#KaDt`Y1X1|a}ieir-BUDFED%0WG7&7kHkw1CQcK%H%A
zp$@>109E!t@v)_|wHfXC@ASdzvHw675f#b@^c}HB1izcqn-Jo{`VjJw?hL%U|>_qLH`JGA<5?uNPiz1sE4t$nG2iO?c9uEu(3ZvwAKy)k^u$)d>Gh);|%_YA_RsWC=NoFNEH1FQvZgc?~23s
zXV?lx#?}L2A<=RawjK>?ynlwIfGc!(NPx2?;6IT%Jqk&GF(lua=KV8J1vY>o^?wAY
z!f*Lgl@JoAwSb*Q@-vk1{u$H)&Mgu_M?fw7mLCZcclfzW$i6!L-3*2wu<;$e4n%@9
z21lW%oH_8~HmIe!0}MKUL@QvU9gL5^?Hd_654cC_`zYj;gxWh=18V2NIf5glK^fh!g16R++-GyZRh9%k4sbWx6p)iO
ziaYRe1!TGJPMZRMg_$ncJ?6m2^^mmw40eH)E_|dBCg4DLNYXkAc8?%c5g^S4APz=|
zIpF92Es2Ps`MXI9ER~Q*JOZTQxBNJuFp#!(u>%%F2z=PLmET2#nC^euKQc%kNDN6t
zuv?Do-vIzA2f*70wm`d?y1F@=!;vAB
zm^})!zpKN(wfL?F@H3?T-dOM;L-qmlNF5&q**|tn`)ezWSW*712$0bl0gT9UKMJj3
zlsKCkyFeXWU~1@k$g#Bc-nVAJWob@v&hNtcGtfntnZGmvA*#c&f#33@Cj7J-JGA=x
zGps#`O&kCiLNrJ{ABDA-%z;I?9k3vT3B|?K${av{*y{XOQ}eq-{tQ_E3hE$2CB
zL>CgUs?&0*0&6%`%fG@hI9wNjNef(}1@R(4k4qc~+W^r*E)}4Vz}O4w2Am_O1waQ7
z;8EItb*;0832-_c5VjGwgDvQQn4PgRa1;C=c?UE2iCDax0QA9*=`urH;RA7kfJ^Xp
zh)d_df}DcDe**BB9Z)=hL^+aEtn6kFJK+w9EkgFk3^?2MItw96orF$|Zn&
z;Ka6lZ3b2cdyz2f=_VYLIJKTKf-f@$(J9pkKRBVe%}2j1ApZ|kcKx(*LE!6tAAn%^`S&>mJOmtm_3F%Mc*3gShrD*nw%p->?Hadh-8Z
zba;Pe2fTmnU$6sH!@pq%b{HRwode(RA1m8YxCi1C;71-C0YUhsKLmX@H9h+f_-lF&@D!es
z0|xjoJ%0fwe0-1M2Fc6*t{w;0`!9QrhB{P2nU$BGTNN-(Lx>)(!{6k9ZK|jyQ3j3&^3&k(0;K%;!2Af7>Q=_^V}}7p@jK}VV+NdN3zr)}
zI!JI|RLFDV7w~n^>>@3~j0pVC;B}M?Adnv&PF_Af*rh*~0$k$`58jbdKo|`qDeP+=
zk`&--d-!2LX#xVm5#HB-qzPbN?w^b)k0AFy^St3x?J(^}3Ietp05CyFg4mzS$bx{)
zuEP)eNf7*q2O*^R-%JSz;FBXeNP?XIL>GR9=p#h{JM{NQ5g@St@Ja@bP`?!ctil}j
zAcXw>8xa6UJ#+H>;EOwL1@G!pv1F+iKf6{>g{ZG)5
zR{;DIJVFHj88rM6Kmseo9|ZyCKEi^-Ez)6qI9jX+FnJ&!abTf{_0Q2;BoA
z!~r^35B{|d+@GR{)_sVcep=@t9{ks`?qE5$?_B*R$^hr>Fylz;a>Rla$-*C=W^jr8
zy7hr;cWA;Qwf@oJMDF{*a{sC|jK^R0jaWken(`lU5~***g8SF4e{}1RTO$DJu%C>?
z_mAL&-1_gN_TyR;sWoE7|4Yi@y7)_}9mEHIMLAr7f8F|Ear=uAgRA|oTkq@kuPOi0
zTR`UfzWqU8Z3u`
zL=BQ2A3+TdHwah}0jVJnry$Tb58$ryL15H?fhDp4U{C*mnuErNso~`XtQsISWNMJ+
z#jmM>a0_sPfhqc(8VDbllNU%@{Q)%xjSo}91FZWXKo|{~8l-vlYif950R#x_Q!jrU(q=`F^GdY3?3H5sFg36U
z>tWgKuhD*|#Sk!Di(!uw0LBHv&;Okcz{UAfQebV72@&7~>?1NQFzfX@T6np^oIu)+
zR{+Av15gfpgN=?L>`haEQvV4l-WCpi5CZ|)3IG!dK?;Nq
z@Ie5L{(})ZXnB|t9syv{!1Lo6AtBxoq(HztoB$m00NxG{3}S$HZNZd|mWP**lUD$C
z;Sb39-uf^>5CF9xfad~?-XXXFb0fj%5hMYxsyZME26a5ZkRb?y{F!uMza&IIxBX
z$q6u!75^VsTt{TCjz~@bfzUsWL+o!KfK56eF#!fjv|yCM3bFS8-S@pSOpTCv+rqv{YU*ZsgIHhY>ZWbXB}AXe;oKaLMk9I|4;EhFifLh
zEAsy}?F|4iz}|0p*h{eN^B|
z`CDH0SDXJaFGpw?1VC@t?u38A3zF42YPReL1pi}Rj?ggJY=K44{{=5dX6q4k;XAVa1uIDA?kHCFgOmS%UvOjbo4)F<%rn=c#{8evixXp4+U!ujO+m$
za0lqf4Ho-%9>$Nu3(5nNxNoBN%_EX0gj{U}$n$XPEC1S*?$ZrEqRtBp-$ZWEC{FKzvbnK
z$pXB%`roS9?=b&hb1;IB-(Wuc&ch-(jM@jd1jqa%D#yU^=l`lTfcbxjX9#RRvWH)+
zG!P51?>pDQ2W1lf3BVn-m;`pj{4u)!Rrm!%cSKnh5H#FJal{64Frs`0{MYaO?8dKt
zM1yCJOjAQeYcCEf5u?<);NsO5uj>
z&_9U40fAkFkpvV07D0j=%)=oYLu2M&3g!i|b9FCp<)dBk`0Go7w
zP!6%L0Eg$>K_c|KY=Dp%EQs(|4bguQM1U<#e^__(@b0f9{+RL~z3sy;DnbXr2zeh6
zf1u~TfiHN=|5x3)^~iA?iTd5Z{D%P!7P4_*a=LEaEy!93)*4>ydM#*;v&ND4ff7eD
zk7-h%sP*O7pD!{at1}|9x~peu3`q|fPEKW2WMpLABeF(F&Ax;IsozGAo-&$3A%-f9
zr{1Zr<)~)VDt(#R#vJ^OXKx@Kr!ML)r*3Wu>j+C6@nWy6Cal6A5@BUd&D_B~qel0Z+b|emXpMF@@`uVv<_A
z>PhN!9cNfhda~YN%W}#YMT(U&(VFF?_b<&x7B3tYmC4OFE_fT&T~aCkTJQ06Vu-_&
zobzkhMM@MBWC**^3azeGWNNufr|C_dmb-MC<|K&#!bZAMwpp@ox>5?Nzixo7d#VDiMb}pnjgbr
zjHX&ChNqoTchHkBhRW|p#$`gSPuv;x2mKfp<3&JRj7FKZT};EdMN-6LcgFhx;$k$;
zwC!RV41iSBhdWOb2WMhT=iI=m6?M9bGn!v|vL;lc`OOvPXnyH~pIfUgy?<#on%^V!o}%{L
zbgK8L%Gd;DK|pCl?W8jHDRYa3T<_dlXJC@2c#VBIS8$2KsO8F?mMM3dhTLg7d#6>(
z9Un-FqE;z)TBY1+mGVueS-hQ=DW86-hN+qSoo4cPn#oU!ZZ>3bF6A$1RU%1a`g=Yr
zjM)Z&kAm@iD=tUsnj3|oVBB782alh
zn?!@>VbA)kbOKL1wh7h+_QyiLAjB$q$;zv^t+s@mv`de5$?jh7d`jp1JkGPG+Rxpf
zHu3w@+`*B0FNwxi0Pe+8B=oG6_H$%v8^B4Yx75-Pxna&~hhM0_i=by6lpOg@sU;>k
zO82Sta4*=K6_sb5ldaqk?jA$g7n&nZu9Jb6g?H96d(F4qhAj%{KCcu(c2(RVl=@YH
zgbMQn5>m7>YcRd`{*q<%jpm&lu6Ubg+kPt>DcY)iT_Z9PYTF`7OII^_l_oN8gJ98H
zjLhkCQp#FqTBxd9Ktti)rvOdg$|*=n&UtQ1{&q%#VsR4@))Rp9bS8BUS2-4wW>y2=
z#s!2n$=wevLQ}C^`)-q(cloU(>_OA=gs({^2DCZOBE@3fXSe^=DnbkDkr0x^!)nM6`>SXrRDU*LSJu2S?1R)WTG)3|*2CC(%r7|E
zszXX1V>+bTQ1bzYw1s)9Wdig=E?Hj>yzux7#IE8%lh8H-e%QxGGPDu9O3z6)@de;j
z0L`0mHO)7?6gx`v9Mz2YpRQq#w%C^dKwJDEc7vd3wEWKAfD4#VnWMSTTW#Ygc1(Tt
zB^BnH)8j?l0wPq*)ta6rBbmgA7P&zG}P6VX5l+gcu$
z)%6@qdJy|kl#q-RqSdnxF>g_E9pb?&K0^J&O4r}AyE-GM#+-3itM}BDT}|#T$0y
z*R&<)Gm6VhBLOKfy>rbqvKMB?V+)!iCP9K`psbEI3&1t@2Z2Wb-D7F3faf&VK!nyS
z73;OW)!Vw421LZ%p51W+09|V6alrimtZCd4gBYaW2GMj{&#VIKG`$9D#MG2tj20+!
zNZd4Ygj>+?(LJBW@e93xB1KMr#D%>M
zIc0JUj6|dYYUYBPATP1Eox?0l{q@0WtEn0Z32ZCjjZSMNGd>fY5LVKvp58%&Z|9Xy_El#xT(qD0dbV
z>4rkvn5O{c5=SPfHf;~LILP*p6`DYienac9!p$UUW{s7ew?wRXwW1hIMFlJs(_|)R
zBVZH%ccZ+6_WxJ8zw_-ZB1uS-fO%xgM2nsJ@H4A+^SIW7oPO89-Dx13(!Ewx%sUs(j7^T0tNTHKjvn@^-Ju+r6gZP=2L<&mX)&
z6zf3VG4?(Gt~tdtVb$MtiJDW~mlpb*NqxXB;goNYVVtG7^ZlGiCl|}W^r+55diFGa
zlVAkw3S|tP2-O7qs>W9(Zudo>t+l^Yz*m1WlB$~av(>kSY2VD0IP}+e`TC_Is-&8I
zj@#hhC}2$L-`t~c8_;9N9~xI(m7pROW|jJQ%JZ#YSI5?DE^h_9b5IVFw(?Q)kM>*8E0f2;TiHg;x$D#T6J~c_}xqx#G2We*O19097Ne+(;2lb(Ju6^Dy
z)f2JT=UrW4#+D1UbPeLe{1fkwdeDePDf8VYQ2kXT$JFG!G&t%
zHSe2C>3lLtVRT$3q=6?5MQnr%YW{rQCZ4J56sb^`w}1;}f(92^Q@3<+Sq@-WXS&eo
zoAA?~<`o_nWXQ?T`ok@(W(8RkeLfpBvX_0yCO2epnLpEOA){hT#YQ?`cvS4fhl1c;
zjf+rvwm=rjr43oA*SW?;GVW^BMs`79GUK8+t+&v7F~-=5
zcrChtio!Vy1GyR%EfLZm;{~HToY~hLkz|b5``E?>mSx&YLl&w&8C=K$>(@nGVCZGC
z*i!pyaSLwByUKcwg-xgH=qf!1i!Y)=Ifp@oXPkAcUAO!L6y-Yd+P6*H}@Jcrx%63Ke+JNIFLZgo&(fNDP#0&1jD7p%`jr8Hm+|;HXU#Z^H7A3y#{%?-np~aCC<;CyfX-
zG)l84!gnh}qh)T5oQW9T;VuM5ZB};+qJLPh%O+_zKq1ABP`X6*Noh*~G;-#ijr%kr
zSNN@qzLm)}b_U2PMBh@%%FH@i0HG?u^U)$QG$f|NZU#coYeCVO1{Bs5K`~OR0m`sD
zJiE)7;3%c2G1(MDYDITVm|rIwfLdXGn;G2#Ncs-u%_0RO0VHm{1mZy7iM1Hg$p#>d
znTR37?^*y!gSre5i4X~(Be%?EoE;>}zb>M!lMO(uH3DSBbpxQ0E&~dXl;6S7N7$lb
zNG^$936M@U0MWHJ0(6NhOXX!hrqiTkz;ARNOe0sMimav~uT&JPr>HU|x=oZnDZ|^i
ziyF~wb|Q6L6DhYQd_{gpR>dT^t%dQV8zms=s-!=&COT*eI7F}GS$dKKrN65d!R=6K
z;1tNsubeqh72P{wD4T^`@0#as;zZiPOfcPQisDw3T(t7g1{fJF=hu==#3x@1QuJ{R
z_J-8r;QU&$bMNWbLIO;3?mc{8jA&`nSa$UN7}ny=v&d1hr}4?x0vkIg
zm{YzW0IE-D+8Qa`dHOaAIks!ak|AQfHjJ4`zs678YAlGv-AW^lO#tr!JjP(J>J(2(
zB$%vWZ||-4R#Yj^&%~(Foca(Zcxs?)L5-+&
zawEerlZAPc*Rkt24O(xz42Rci?d)QrqcD_hFyHp9#LQMvwES(Oy)~RmJw+DT!_IZM
z;$fFdnJDlT=P3nK@RU;RvcPZhu{t%nq^vI;tZh_=hFV4lL4?R^W|OWvl7ohq
zD=*`7sYS}CU)u!?dQHlp@#fRtl`H5~F=d<=sTMX*P;E?u#zV?z=R0Qu`)z7Do3}Mokx(erP@lp45D$FlIc#`c!t5c4|ExE5a5*xypKVP5CW
z(}mZmv(YS8?N#%-VlvKF|0(ULv@(&q6jYTnuha8mUMFLhsSg>EWU_f(<7gxvwc>RR
zvMV`C20A$}mtO}r;JSDUw8Y|r^%)8eeD9vQIuWKBrkjcJ)&jxQRS#busbq7kbT`hEt1GSV}ULAE!wnWiQ
zQg<6Qimk31=1Gm)&1(HAq?8v+^CZ7DtCNE54PlmAAa8U_mxQY<&84edYJ{sGnUjgG
zPS0%>HlU@t07SV$N-U%m(b=p`T|UYvmXR|w6q9rg&Fd;7S#|b8bY&xHW|=m$sJ(-t
zEvn0^vYgc7qP?oa_<}lIwBehRvYFo))ZwDV7Uk7xyJ)qUEQ>OlIb19AG#e^4MvUz`
zJHxPi3lFO~L&$+Qvx|-_j`rqk&-LtV-M_`zUTd(kbu$)c8=lrMb5m8$KJ_9=1}}ys
z1-)?Ko%9S{m(L;5X=xZz8Ld^SMF4qX`sP95_ig24Gm~W)54ce
z0~;7OY6P9zo{{;yqj~7a`A;YDe1o4dvj&CCCbH90nD&7dcA3
zY!2OpxS(()@s^o2Gy~WU#A~mSI13GNyc!y*)m#ZpnOQ^AbC+&}<{}Hm@nvyCtH&q9
zjq!lAa3kpyB;C@y3&wEAVOD6az)hKX88;VMFlUgul9421x+e)xq#1IVAx_~@qKT`>
z_%yo)sFOBX{&Zhr!rVDSiYh&paKZ{e7(Y0LyW2^cWUYi|o@=0yHdz6jOI*0;RxzCZ
zrv-{g034j8u~!RwgjYsloLD?)uow`JGc;Dm?`BIuffe}Y7Ng$5{uobvPC5g
zcnJF_Rwj`O`Ji*KkPlbDGf%w;&n1pbZ~SLSNGU)d!r;gLGcC(Rl_8
zI@safwq$de6?2LKLrMmqT}j=iT`~jI609O$omm6Y(In23?BR?m$aV
zbvAm06f3XPuFA|BkO4vqDotwBG@qnXx|)V$PLZeasjpZAx+~&NbIFdxowV1~pnXi|
zpW2LJNL3?*i&C+M{8YnRuQMC;IZSQ8q(OIo65%P(CwWh#cx^MBc&hOSSl8_q3}Q_
zNc7dtR$GwN#C8t0JT=f#4R%dmh0LMOvz44x{M3*SL;=_1+sL^lzENE8q|sS*L*I5}
zCbX}=j=GIi(ga*{_?{Ya`lel%kP+^lhzC<+#p9+GQxWOX-g7;v7)z&(@f=Fve$FSQ
z6@1*n9M?jgb%OIpQ}1DWYRI{k^(tYX)tC#QtI&L6q)YPhHKC`hd0hZqCFiy`BL)G~
z(}DRK6>Chjel_S-Eke<no6D~frQ=-4fsHw)bzlN&r3szf(|*zdUVrAK
zmJwHs?DMGExuX_}j3vMK^nz^pE&i?rIHRUkbHiPF@y)2Y)s%+om-Nee=jf0RxMKzxds=;
zNq(}#DtVw8t|Kn$?YdLb10&)BNBlK@k}Ml9lLbOMsfLCwRK6NqcqOwz7fNC?dbT(o
z5;O30A;rh5jZ)$`Rp4-$Ce;06@Q@W7OB0vbGWt$Jspg_>!`^m7vc+poA+hl*_?s>A
zSww_p0NcZn^(%vjgeXH_r#!!+z>ca3j4E5{*pn4C<@`h>^>;Iw0?zFn9*sb>q-o{wJT;>!X-XP!klafu*XqO|omsO9
ziQW3dplq4UYiU5!(RqTq#fbe9an0AnNnnI9-=4gWm3d0@)EXYHp@`s^!_WXnQnj?#
zmtONllUa$;O!_d6ui@3eZ7~tmUdYc=tNcI(cK=L_KY8wfEgkH!fPT5@P$e)kV
zmzgzIBwvoyC#!&@inw#TB#rn0rRx+F68`|DOSiDCN>3^?YfwhHge`z#4t)zNl6XV1
zAt_t~)v9s<8&)#+A4)Cc3Z$GS*04-;M;lp^5j~+orsyJtdCZQKQYpBJirR9dKm*r!
z$mc2?@uO%3Ce3NGjMG%}ku#TMo)%V;Yo@=e@YHh1%6Sp0aUw!;UC&r@#5X}mtIx)c
z#67{tL)&bO2@5mLS4#J3bJaic^lM?qAJb9&(Riy^z3MW>&;i3k-y?-kA
z%>L!WYglCZyLns1r>s9TR194PTU}${xf_$y{Z0;;p1~38=N%-;F`$N_m^hF
z#~qha{@i?1VRB8^mvXfvPnxsO2EUaTF3&a!WW#>s>UyoDlU_$szBZENP3DBeDOc8v
zm6`R?putwC85`40H#1IK(BNh0?~X)6$d}9R4>pIAq&v_(QQ?A6Se1`IPp@IxQQ<-h
zAb5k>=p}uw2+P^5oikIm@US<;C(elV4))Z6LvSgglhd7SS8bXx>Wx98-WW7$FNrag
zt>CZKP7R~p7&MmN2&3K@R2jMHmGhoe%=UyHm8mHsUYw^}pof0$p4;;NhugOaBj=Z)
z;`FJPLG{j~EcLXf=U1X~^oPC@TglZVEtTUx_?37TUlh;NAyL8pgI|dkH*qB@<$v%i
zF`}t1Agk2aFP8ZcyJOf=Q)>#gMZ-b5Idt@N9|`&C1KPhoY7Cy
zll5zieySopX?A*lpHW-V`O=bzaFPHPDLyXso=-*epH<}^VA3I2hTpJJ(0tU{dX
zR6jJtdFfEuffev{3ZsYho|cbQ(xzHSTHz?9FliN|q3e|Re4eOODVP(HuhutP7p{^g
z>lMx&HOf~dLM@edRj5%lK$D;!a3ET+PZX9r&jex3YYxPM4O9W1r9N#K(ka*oa0);|
zn$b?0m8`de5+IiZa3TQ+=F*_9C4=a
zIYzr(PlPdH=X{X<^a5kK6KOvjCgQj?ub`0v+gUHG2%yZOPXcJtr1=MsZKL~JO8{jT
z+uHQFX)eJ*0_A0V4m-@dIB7{Xr&_5sySgSVWSz8DaY}U>%qyi)v}ec@v{c|^#phR_
z$5fU$lcrK_gDJhSy536Ck00k5&*(Y7mTbyzycY8QoEMcWi6kE$>KD&De10j}mfv_O
z`6BUpTckzQW84x`Di1%ulq|P5UP{~*O3`vX+{3rUC(A{?lI8fuYspC*^|lD>eB8Ep
zxe=G5l6~8Q{{%}(?Cv~;WrKd>U1?Al`F@YvmQW-Yw7V;q;by}8c1?PUB^yiXm*K8A
zai+PLPLxG0_nfrMbJ8-;sU(2UUWWWcjr+J@)%i57f13q2(-XNT{88x;d70-Iqe|bl
zi;=8rr}fd^^HE7xd8^K^MYXyDQ_7et<2b*6X*OJD;jAdLXufg5A(9f7B*s~S!joR~vd!6PFbiVViP{7q
zE80*^sW@A3AL1a1o=Jc5A~iv^C}#eB9#_j#E05;Cm+Icr
zfI_6DNRyT#O$#Bz=j4ud
z#&Z1z6vlKVh;oUKxF}23w;{I$^Pu{OnmXk&o^3+nP=`Cd(hhyK&mooP*Z5I+P=T$c
zK)HlyGq63|8Av=>4fnYUx(fC$lEb;Rg_(AZUXtkeJT8i&Hz#~v?PhMcjyf8j`8}kA
zswjGE4|u4gi`$4Ylz63HGPMnF(gNvPdXSBCRp*&0)bX{CsFpfU<{+w?Rv*N~T`ugR
zlC-AXZi5QByMisNQ9)Jc6A6HIwjhhvZKYlA0kWE;lY+4V6-A<-;HSlPQb`O|
z*m~1b)=7C5#WC$2_VVmhcq&xvq-*aLk|p)cS%He8CDf?M+L=X#{N22+G7VI1o>W7k
z3ACzrs*$Sbnv`!($_FQ9EAx?>v`nvHv*?9IbmLakjj@-atEBw|r@K
z+PUS~g?JX$9qJM7w=dv4QOWYRb6hQ}ND4>2W8so9`|S%mmI!k3+oi?ABG$ZWV7{$J
z&@$wP)*6x8uBViPG99|mL?iv@NyYDToq4({iIR6>%_}MBS>DCp84x(cr`!^Ij!Xy-IH6Y+#b1!3BQ3`DnTfy
z6t|RC_HkiY7W!JnGNm#jWVP18Oj--H^ph84m71rd>{2fl($_ZmOl~wQ3L5Ew9xY+n5b4w>+f#NVk02x%q@t>TVJ5
zsJmJ5-*zz#x4g78f1F=FRJj#1=Cl~KV*UY(d1T3DK11hsMopS0U(Alw%4DfOILeUD
zalM$@UOnv&`FLErt$C-}wcFDgMIF4jR0srM-sAAc7pk5@Es>H#HkGvVS{V#=fRQMQ
zr?A|Ay9v+jq^FScF;TU7RV*N}xf*Q^*wvWRO0aEsP0Lj%x3*y_t+vY(=RFU5aj%r>
zwN3Ee<3A82*UCZ9tw7fp()KpGHdid1q*yYWH~};?S;JoL*+h>iKUNS?>
z`B8J!oF8w{L>ep(ky2x@%{~HHjfZQUA#;6YsoGsYgPxxn4cbH8I761oC@ZN?04ia0
z(=yZEp`pW`SWgPxeXxK7^;H`jG<;*}?}oA}hmb0)a%@?Gvv^pR-aM(!
zy9}4N6>7M+*({-NdA8>Qc6R0aDZ6eU_lMrj&LQ08ZyPU$_qVCWy*&G@$4vF}<=KYh
z8z!GL3dWUyNwhnPhoEwx(D84jF+9(%Ig~UU4AyX}FPLed0Z%c^C8r2$m`ZuEhPldn
zEi5S;iJ1lz?rsgB%vDo~Bep|k;
z{0W6nkp#2Oxi94*n~-4aiX-=TUKN-PHC7SwtZY6tr8TC)aLfzuX
zqtN->gC76zbqJTkbRP7q);>Atq*txgMl+K+4|Ud{_nTIGMFQt?o@>m(%oWcAo;B$G
zrZpH1O4*S|afKn9+4yebFtNW
z(7oo}0KEt^wYN86DCH%MK4P3v8JS;wm(Z)K7;N(Y*NN!6=%2Q4EW+Qen5vMh2;d*Vy5z?PncD^;X0CMWHR;Spse&Om6^2zg-aTPFK3USuPlHjC^T}A)Dx6~
z6DT-W*Md@J)}ZVf`5ybZV5K@{QY&Sz-|wqS0yX@m?!LPQPb+
z>GZqC(&yF-c}9(?LVLo)#n(t5k?aTCv_iO{(~f#WjBNCZDAGRFpqz)iXfh=twuOq>
zk$P8K3LTm6*Ep&}iB5e!6vun5F)I6Z=A5J%H5SY{Dff$urC$ij5RvCRc6McLH)orp
z-Z0HhHx|MmlXWI}^c+6Iw-WnL>$=coPbbzWmz&^lLDgAH`}yKDZ<`gXeYVXuEpcqn
z@eV`uD%)%>KT0P#yVmwvMOK+qq0XpgB&SvCX|0M{_gZ*n@D=KgYBE$56(G)#-`N7B
zyeYy&Ain}oO@6ijsX;*GfPu?_*xQa8+I-EzaG<%s9f>Ve+&#mOOV-mWIx6!GC2>*1
zelHbw7CB3bQi)=mh^dTh!CG3xM0(2=ITHKS1VY$>(2|yI?)56BhyLV6nSnm^=i^^c
z9|O;_>SIuLL*yw{TD0~Ri8?1*bKj)PwNAeJQ@S;C$hhXd%%OU
z?VduXHs`1u=8V5{=SZGhWaD%Ft(>Fmv@!I0u_kIK_kQlhc_@7@xeRE$9l6<*l}_Aa
z(shS*ca_YO%^4!hzb90Hsa>CK(yHu=RI!*-&*w8V-z)P(XNcQQ*N5)sLMk~xX$?5a
zG_kV$tf(>lrQWxS8mpCNYRvn;pA%_?q?ByJWGT*L!O$^F0kLrJsG$rDg2Pg<2;aJ=B!Mg{#z`
zGfuZSN-bw)|B?r6I^
zO@Mg#Vv0TK6zFo#5{95UQ@34AV`I1?;ZZI4_Mxh!=Ag+8uC3i`iNZFyD-A|CXh&8-%o>}0t}PMi
zs$~y*EkNCCdj9G6tm$0(ofoZpaOt_5N}h+yw`zH=npg7HP&Iv7x70nXDx8svSy-9<
z^vYl1iKh=LPn=bXE%^Iz$akRDl6TkNU6<1nDpKmBrsTI*u*(LVIdW;n(xE97la5?L
zYK_SBo#olZIzYHIXPdA^L*?m+Pv0HxIM_S7gm$PC1<5naDxw
z1`efcK)-w_m&hf-HCKag>7(E5UdmJ=K_VM)>|5)KZU&419`_(RFr
zKIx0;l{MK^OspcEVj?%%OG1bw0TA~m)UT(t%2Ym-1ORjP7PRx~gIRw#Y?^@EY!rvv
zb9EAHxScAVu^g;CY?^-Cgj-6X;4bT7_kv?-qovTiwT}(!)7DO%l#6N~H5f$)noN?L
zm|2hSH@QzB)^s1YQu|FFHcje1PN5E)drq&DqlshHu(!8T`%NCqX;ekDK8mQ)kx1l=>u+(?6cTJk=vl>WR`%J
z36O&$>X#)z)l&@tUKR%sUV4@G+}_4W>06Bjrt!LnOt=86eHfv@hzsS31{a=9N1}!v
zGA@eiU<15#>M9A$qSBRLb_^cp{BHK^!A4;x5g^H{`)vs%yBIh|B<{1AbsA!P|
z%KKHQ@E(!{swnD0jS5xX3@VJd(G;|p7MUuP!*3#Jh1J=nAyOEAO}Caqs*ydvi{u$*
z(2EVb#V!iyo}dSUBWo3=Ln`XM0Jt7%O^V%yD>VT}+q(|y3vQoEypW-ru&$ZBKP2EU
z%L8Ii8F)P`n^1cX@Ao9L!}?!OGD5&L$+SlEIlyIslO}>$Rf&k5PtJH|K8&0
z^u$>_9y%1)YZzcMMOUCgb(~s9Er}>KDw0K8zb?uGL`X)(mg-Wo7xR@IFd5+&U|02~
zTr9E8Hj?@hw(&acCOZyl*xM8h^+t-;j3Bd(Azb;#7vJ8?+;46x)&vE_*Qtm!uahwY
z-KlV`xVef8p_t^w5-n!kL2a61BNTP}P*lxBsw(;XwkR2gR39O~XK{5#mv;^v?=5rCYws+v7evtvnLd~zh^(>?opW1kLQyl&WT@_3ZOSUNgxpKz_c+t2hc5zwLEE
z3%MST#o1ovv$KoBxCFUBXm<969kX>*sGD}Snk|cvd)=d+U7Vte`#o156>o%{U6}jQ
zy3f&C){wz@i{CEZ
z1bX>o3Y@DL*tTF6<*&%qfBl
z1#1^}Y3jcYH#*q>G)O+4JJPn;paIY*4UbRfXzVaAi2YsB5MEE91*Nr3h6z{huA(!Q
ze9%KlN8H3gDl`3S#=Dp_IrhLlL)vv8}$x^rvh9A!8K9weDcmyxrP{EbsKuv0?N7b
z@;a1z^RRZzoalv)G^JI1DPO=OR!70y1Nf8ML!;kqW<%$Zqn^yURl_Fk$ABE}!M-X&
zo*CzP$klN=cMRSF@?jV5GKJ}^KSo~cwf9tAre^olxU5|t_L`zL16P-6Nh9Be55hcx
z+i`a#509lXm80-P-l#yyur#<(Q`z9c8}^YwX$!YQNuu2b7pM;&7dv7(SE&@XVuy`v
zlSN5aF}P6YT8)b&`p=&YDVP*%f79BCVQRRevE;9iGjqYsvVbg!0?6I%*mWw2ax$`~
z9Pk>@1HZ0Z)vCoFRFgWWUUE<|e^9A;P#JVkb}LDwNq;Qow-9gHI1zPWqObR*PEu4o7O6<2QH)M0Rr*b>{
z!j7G-p*X0?vbbZ3))&`Z44lPv8(M2vznz%7sVuUWP$1+dKMF|itV-!H}&8~D&l$iz+9EQO~VXxX~fs%6L#WjrcB$t4XwC_JqAtunQLCZX`
zhDLyK?h;$fQ0V;mr?378+4<|geS81z^{Y33x_$od^8Xu^+0TFV>YMN1Nx<{}!2aL9
zyPXGW-eU_Je#g6RpMUn^oBQvW_iwLWen-LbK|@!W4`q&!&!)x(HRD@z{Wbem(;$&#
zNj3_R{POMhZ{Abs%RfJR@$Q~~A4=hf0m=CA+8`ycaYks_%0Z)w2dxS_eGMm)ac`#y
z^T}<#Tw|>oTGc?RwvyA_F-;p#k)*B`^{f=GcY@*aijClF0;OIUWlSo>OUY&q2CFt%
z%9k<&R0Nl5xodzj^0Wz*7IrCpsL$i{iR3^yx6y_Ve)jI|%kRIse|P)SPriEh_RAOV
zZ$EwY-TPOsUo%8Q$=g5t^uJ!cdHMD)-~HidKf|W~{{0`J>7V}R{g*Fz>i*5`FF*P9
zZ~ue8{O;BJ*Y~$S{p^#^Kl$`u|MOpdd;5n!{2~3un_l0(c=Pg>;rH)eefj
z@;`51|Ie#8-`xK8%m2qQ`HqL>^}l)h^3xaZdCjLEc6WCqC+?0rf)l&l|Gw)#xV!s+
zM}GP4{>A%OZ{LLHhLNtZ|F=9LK$Zo4_UW&F^Wsmsp0D}KXK(*<|L(K5uim`>nWfT7
zpLm{8|C{^wFJ8WQ{{of#`!C<8bNc(={5xm<{>?Y<|A^s@B$re4-Fx8r^UY5_`scrX
z`{JuV-M_#6^8TAwZ+`K?2e+?Y{^EoG8h>;5n{R)4|HoIq{`$-^+P58+Y1o
z_mJR1hS()%R~;(eGftH~dREIsX!U<*)DVzrMLcbHuWx>mhIV5w>b(4S
z`(_?X*YudNZaj!i>Bf#yJZQ(JPP7U$){m(o+Kr`zd^6<)Y`2p<4>Lv=5YbiK*d+R^8#{`hqaGs$dM7>-Kjz=Zb6h{>pF1AK
zjxclOh5otSom^O8pQCBCq=lQgjEQ#Y#zwzyyPp12ZZBm_R8upz?md*5(4h?Z}@LAkzIes=8Gi79W!Mv&_E5;io7
zedV6xRzNq#y~2KvI>!8-cl72FOUJyA+C9$?I>yAHa?hpoTr+my_c
zptWPi$)9uDB(1;
zWFGTA#>Ct-W5eA}%AoAnaSGq%c!ckccX#2tW89CPF)yPSOBvASyIdRL&l|aV(sJLz
zC%ySR%w!CD+0!%TWdLK7r&E0L$?ITXIdY?=JJbEKy9@h!?BaKi-Q>?8b5oL_{RZAQ
zM{E7@IE4Lx)^L6p9B{Q|y7aVuA7d%C!;XP0hpXX^KKpTO@MnSNMlbgnOBYSJZycmA
zts6Ufdck3LC&2>y97i>*?Lb{&cy9D(koO@~!gG5s-+1mQY5DfMY;S<&*m*sIn=pDW
z8yS<5F#o>E^9`O$_uRPerqn|>cJ%rNd4@aBvl;6>O)@qF+{1G`-{rZ~_RD;iOw<4~
zs*2}LNb{XIpX^*(i8#K-b3slsHhTWdSh@q#y)RWtxUr*`JpIzjxu6@2Dy<=IzYI&N6$Oaq;_6cVGI`I
z=i1m5`^E;HjzNYpH(efN;X~yQco~Df
z23GE*WwV{jCju-Jsm|d!l)W%EdR>KYq$Zv28&x2F#zro!ff!65G9M(Z2
z$2j*G_!Yb1Wz;}5qL+CxCWS+G9n{8s&=7S>0cKL0<2MG0OS|umQU&41
zB0Ur8j^9YF*4^9`>$YR)$^qu%F23*BN1lk@8DKt+kvGBb16>_c_}svPhUx7=80RkF
z4_!~9BW~{C?GNTgIgP5)cn-zRzi&t7Kp2bi7o)`cBZh95x?EZKc1H=!*s+dQo?)z$
zR3rBs6&qn}2r|BdxBIb)#p^Tt&F-ExCtrx>0?8g-B85HVW+@lEr?B6$yffsi~@8feR*T&*r
z3|9X>L|K3j77^&4d$GdWaFGStpo43CF6y>$4etx0ETRuG01G?r8`(hN8@LL>I#3S+
zUXBz#dmLcT#JN=Tgy$yj2N^n4A5Y``9Zo?vm(v?`QPjGF$8&!dY}kP&!okMDXb-%&
z-$gy5M-lTl=utxa+Isk;#|!BXK{tc@1$oqC9(lUL|L6T?R7^!#%UF=1sJ7lFW^U^F
zZRol0ju8hSA?!yF7W{s|JL6d7&s^pg=%8mA0as|Z0S7~*XEcyV8$$yJ64&)GqZfNR
z?ct{pmSg_ufgu_aRCIpOhd3q=+Y77Z$C{zSLvtV
zmtt+v4iz&m&$B(?IuxQ^I;_;TX;(%Lsgu)X+HA;7vG7
z!~1XzhcgYo53q=X+^-E^X;?43J*<}u1pmI_4n@|zZ@B9u71huw9_|1OtR%=hoIyc`
z;v5P3IAfBDWWRww(c_QP8}<^Z5NHj$}^+E4M*$cQA
zg~-z+V?p;pX$UqBLOGmY1W1Ghxe)e}@@2p0gD`E6XXHn~Gexjry)cRRjd+gm+yuUh
zMHl!uV}bADRtbEUvA}l+h%KxG{XVRN4G!yIlfpXCOaiW0Nc;wZ(BlvJ7RS=v+m@b(
zR08P68f!xp4QB!Q7QR7DIMDOhfCcdzpG%3w78YEp;khZ=9|N)?J{MxC16M-@K1qE+
z(9tRJ4?4}jowZ?)Agi!PxLLy<(W@owxdbQtzQLNpI&g~yUWW@ge1j^_I5%DMWpRp0
z?0NBkA0)sB$l-mcgkjH#O$1m_4+6|b@{av_VfX$U#FT;z!1Et;bapq;J!3)NfRhA%
zg?1YDZ6r+M@ggR%-=h(+;N=l+(O@TYWP-nmv9P}*>QH=N^mE~64SbS2vEw>Oe-1EX
za)xh+)5z@yA?qM7QEdaCWGvVfBaRSH2jmb0of@w|(B((sWu9KfE?pvRXcv|fS
z@w?Fng@-ZjuNZJ12N+iY7L1ZOCh7MA-khI=NK3ZW`zmSrO>8;WH;>6XYOy0C8=oARZPn
zFoF*clQYB;CfJ&XnXH?jt3X15#wWRY!Qq9m#&=nqe=g>4kVGbJeT0NgJOa%-=!v*2
z8}B1IAk2-vjESIi53drq1{z;ln1>G484ny_zu^c|9k6XX_>C(tw58hx#G#~~%eDLD1
zm+0v6eIZw9z?BhVhKxnL;8Km>h_)nNt{{8J_6dIZX~fy**C9eBj76XMgv#%E6R!2Z
zpC|PDfGY?!;6)M&{dW;%ac*iFZqFO&3-8-^!6u&eA)gg(xx`Wf-#9ej;}cu+VBFzxj2ITH_~NGR(9_(
z2*X?ql`t2jI>0=VoaetmUQ56gN>ZQ=LQ3I%Q`94n3c-&=#%G8}kxCMHEbiyPV@dUk
z=Z!-X_K3p}Z~#$;bzs8Axl_nx+Vfwa7s9Xs_qg!Fcga@?xFQcF;F+*rpk4gq0lq`@
zk?rA=VK3o-0ls4&WE9H?@|>~2C*k6eCXX>bL$!v_!NsDBJR2)7>?LDC2cg?(i2q`B
z2bdWPItUt9;GK*Ge>PfnkZ)K4f&Lf^eoUeUjrGR30dEVk43}HbHjiLij#MKvUVj@66=b~L`;FI)?4!jQ2FWBtdtQB-Uvi}0l
z!NnNP^nqZ9KQpK$;Y@>-;4fh;$OSxU@w+%$1OB8i!SPPI;srgM4tYUFfxWnIBUya@
zed5%LWAVGhaJ}A%G>T^nGc>+0>H=hkMVv}G<-JlSV%X{4K*fE{S75b2edMvoiuetbc~4icPQOQ_
zN(OocRYCq9?+A{$_ep)8m-|OjI{aQ9Ny_&)1-c+-$hHXkLAWBwb4-#TYpLM~`Y9>?
z!45!l2b|*43j0ebRFLs_JR*GP)M0H6KM0=9;O9bR2=sjHW8Mf-Fv0>m2>a1vvHCqC
zy)(kcY4y($)ATwGS&Tt%XDrB7(!PQ(60ceCixN@_vi8`>QAZkuvyUnj_Y%?ww1)d7
ztb>3+d@lN9kL2CN=U~PjSLpWve`C~hQ1wFYB^rO=_f&)g9g|R7IMZbG26;q=NU(*D
z6V6u;^FHS69QQG22lG7GE^v*YqaP`~iQkC6bvzG|{*Vg+rzpXm-{US0dL6EUV3QC5
zihKY{lr|6-Kpk_SXJ7#)3SOQ|{@R
zF&x$YyOKN|#zO3gxj`N=7V793J9-_CaPpnEIT`DH&XbIJzYk-B*LN91@$@iDB3>8^
zwgGc7#=~=1?O`n4Dr51C%P4-MvF8+shHpqEpZ`Xz?*{R~S0!Vf-;37n;|4P3V-t)G
zUZyY>@}wEV10CQC@c^C+xe%lQ+-Y_p07@NFYU@UbEx9i!4O!Z)bM4r6o%
z3}a+w#4#V!VMc>GZvP}^4T-@SN6+p(LEKBAf4tH0k%*Oi;+|N7|{AH95m7@fWz
z$CtYoq&|}6Cn9X7RH~;ic|MJ^k-TZ$cBw;!L

literal 0
HcmV?d00001

diff --git a/trunk/paradiseo-eo/win/.cvsignore b/trunk/paradiseo-eo/win/.cvsignore
new file mode 100644
index 000000000..880de1a77
--- /dev/null
+++ b/trunk/paradiseo-eo/win/.cvsignore
@@ -0,0 +1,7 @@
+*.lo
+*.la
+.deps
+.libs
+Makefile
+Makefile.in
+eo.dsw
diff --git a/trunk/paradiseo-eo/win/CVS/Entries b/trunk/paradiseo-eo/win/CVS/Entries
new file mode 100644
index 000000000..284e3451b
--- /dev/null
+++ b/trunk/paradiseo-eo/win/CVS/Entries
@@ -0,0 +1,61 @@
+/.cvsignore/1.2/Mon Jun 12 20:09:59 2000//
+/Makefile.am/1.7/Mon Sep 20 17:12:02 2004//
+/Readme/1.3/Thu Jan 17 15:21:43 2002//
+/all_lib.dsp/1.9/Mon Oct 14 16:16:01 2002//
+/all_tests.dsp/1.5/Mon Jun 10 14:10:33 2002//
+/all_tut.dsp/1.4/Mon Jun 10 14:10:34 2002//
+/create_all_dsp.sh/1.1/Sat Nov 17 08:13:55 2001//
+/create_dsp.sh/1.5/Thu Jan 17 15:21:43 2002//
+/create_tut.sh/1.2/Thu Jan 17 15:21:43 2002//
+/create_tut_para.sh/1.1/Fri Apr 12 14:13:08 2002//
+/eo.dsp/1.18/Thu Apr  3 16:51:46 2003//
+/eo.dsw/1.14/Thu Apr  3 16:51:45 2003//
+/eo.org/1.2/Sat Nov 17 08:13:55 2001//
+/es.dsp/1.6/Mon Oct 14 16:15:58 2002//
+/ga.dsp/1.6/Mon Oct 14 16:15:59 2002//
+/t_eo.dsp/1.6/Mon Jun 10 14:10:34 2002//
+/t_eobin.dsp/1.11/Mon Jun 10 14:10:34 2002//
+/t_eocheckpointing.dsp/1.6/Mon Jun 10 14:10:34 2002//
+/t_eoesall.dsp/1.5/Mon Jun 10 14:10:34 2002//
+/t_eoexternaleo.dsp/1.6/Mon Jun 10 14:10:34 2002//
+/t_eofitness.dsp/1.8/Mon Jun 10 14:10:34 2002//
+/t_eofitnessassembled.dsp/1.1/Thu Apr  3 16:51:47 2003//
+/t_eofitnessassembledea.dsp/1.1/Thu Apr  3 16:51:46 2003//
+/t_eoga.dsp/1.6/Mon Jun 10 14:10:34 2002//
+/t_eogenop.dsp/1.6/Mon Jun 10 14:10:34 2002//
+/t_eopareto.dsp/1.6/Mon Jun 10 14:10:34 2002//
+/t_eoparetofitness.dsp/1.6/Mon Jun 10 14:10:34 2002//
+/t_eopbil.dsp/1.6/Mon Jun 10 14:10:34 2002//
+/t_eorandom.dsp/1.6/Mon Jun 10 14:10:34 2002//
+/t_eoreal.dsp/1.5/Mon Jun 10 14:10:34 2002//
+/t_eoreplacement.dsp/1.6/Mon Jun 10 14:10:34 2002//
+/t_eoselect.dsp/1.6/Mon Jun 10 14:10:34 2002//
+/t_eossga.dsp/1.6/Mon Jun 10 14:10:34 2002//
+/t_eostateandparser.dsp/1.6/Mon Jun 10 14:10:34 2002//
+/t_eosymreg.dsp/1.6/Mon Jun 10 14:10:34 2002//
+/t_eovector.dsp/1.9/Mon Jun 10 14:10:34 2002//
+/t_eovirus.dsp/1.6/Mon Jun 10 14:10:34 2002//
+/t_mge-control.dsp/1.6/Mon Jun 10 14:10:35 2002//
+/t_mge.dsp/1.6/Mon Jun 10 14:10:35 2002//
+/t_mge1bit.dsp/1.6/Mon Jun 10 14:10:35 2002//
+/test_dsp.tmpl/1.4/Thu Jan 17 15:21:44 2002//
+/tut_1_bit.dsp/1.4/Mon Jun 10 14:10:35 2002//
+/tut_1_ex3.dsp/1.3/Mon Jun 10 14:10:35 2002//
+/tut_1_real.dsp/1.4/Mon Jun 10 14:10:35 2002//
+/tut_2_bit.dsp/1.3/Mon Jun 10 14:10:35 2002//
+/tut_2_ex3.dsp/1.3/Mon Jun 10 14:10:35 2002//
+/tut_2_real.dsp/1.3/Mon Jun 10 14:10:35 2002//
+/tut_3_bit.dsp/1.3/Mon Jun 10 14:10:35 2002//
+/tut_3_ex1.dsp/1.3/Mon Jun 10 14:10:35 2002//
+/tut_4_bit.dsp/1.3/Mon Jun 10 14:10:35 2002//
+/tut_4_es.dsp/1.3/Mon Jun 10 14:10:35 2002//
+/tut_4_real.dsp/1.3/Mon Jun 10 14:10:35 2002//
+/tut_N_XXX.tmpl/1.2/Thu Jan 17 15:21:44 2002//
+/tut_para1_full.dsp/1.1/Fri Apr 12 14:13:08 2002//
+/tut_para1_ring1.dsp/1.1/Fri Apr 12 14:13:08 2002//
+/tut_para1_ring2.dsp/1.1/Fri Apr 12 14:13:08 2002//
+/tut_para2_master.dsp/1.1/Fri Apr 12 14:13:08 2002//
+/tut_para2_slave.dsp/1.1/Fri Apr 12 14:13:08 2002//
+/tut_paraN_XXX.tmpl/1.1/Fri Apr 12 14:13:08 2002//
+/utils.dsp/1.6/Mon Oct 14 16:16:00 2002//
+D
diff --git a/trunk/paradiseo-eo/win/CVS/Entries.Log b/trunk/paradiseo-eo/win/CVS/Entries.Log
new file mode 100644
index 000000000..6e379144c
--- /dev/null
+++ b/trunk/paradiseo-eo/win/CVS/Entries.Log
@@ -0,0 +1 @@
+A D/lib////
diff --git a/trunk/paradiseo-eo/win/CVS/Repository b/trunk/paradiseo-eo/win/CVS/Repository
new file mode 100644
index 000000000..cfe5602db
--- /dev/null
+++ b/trunk/paradiseo-eo/win/CVS/Repository
@@ -0,0 +1 @@
+eo/win
diff --git a/trunk/paradiseo-eo/win/CVS/Root b/trunk/paradiseo-eo/win/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/win/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/win/Makefile.am b/trunk/paradiseo-eo/win/Makefile.am
new file mode 100644
index 000000000..88b4fcc2d
--- /dev/null
+++ b/trunk/paradiseo-eo/win/Makefile.am
@@ -0,0 +1 @@
+EXTRA_DIST		= eo.dsw eo.dsp
diff --git a/trunk/paradiseo-eo/win/Readme b/trunk/paradiseo-eo/win/Readme
new file mode 100644
index 000000000..d27614085
--- /dev/null
+++ b/trunk/paradiseo-eo/win/Readme
@@ -0,0 +1,20 @@
+This directory contains the project files for MSVC++ 
+They have been successfully tested with MSVC++ 6.0 
+on Windows NT.
+
+There is one main DSW project file: eo.dsw 
+It contains the description of the project with all compiler options. 
+
+There are several DSP files:
+
+eo.dsp     for the library in src
+utils.dsp  ...                src/utils 
+ga.dsp     ...                src/ga
+es.dsp     ...                src/es
+
+and one additional DSP file for each program in test dir.
+
+The libraries are created in src/win/lib directory.
+The objects and executable files are created in src/win/DEBUG
+directory.
+
diff --git a/trunk/paradiseo-eo/win/all_lib.dsp b/trunk/paradiseo-eo/win/all_lib.dsp
new file mode 100644
index 000000000..77b5f7e5b
--- /dev/null
+++ b/trunk/paradiseo-eo/win/all_lib.dsp
@@ -0,0 +1,112 @@
+# Microsoft Developer Studio Project File - Name="all_lib" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Static Library" 0x0104
+
+CFG=all_lib - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "all_lib.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "all_lib.mak" CFG="all_lib - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "all_lib - Win32 Release" (based on "Win32 (x86) Static Library")
+!MESSAGE "all_lib - Win32 Debug" (based on "Win32 (x86) Static Library")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "all_lib - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_MBCS" /D "_LIB" /YX /FD /c
+# ADD CPP /nologo /MT /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_MBCS" /D "_LIB" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LIB32=link.exe -lib
+# ADD BASE LIB32 /nologo
+# ADD LIB32 /nologo /out:"Release/eo_lib.lib"
+# Begin Custom Build - Installing $(InputPath) in lib directory
+TargetPath=.\Release\eo_lib.lib
+InputPath=.\Release\eo_lib.lib
+SOURCE="$(InputPath)"
+
+"lib\$(TargetPath)" : $(SOURCE) "$(INTDIR)" "$(OUTDIR)"
+	if not exist "lib" md "lib" 
+	copy "$(TargetPath)" "lib" 
+	
+# End Custom Build
+
+!ELSEIF  "$(CFG)" == "all_lib - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "Debug"
+# PROP BASE Intermediate_Dir "Debug"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_MBCS" /D "_LIB" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_MBCS" /D "_LIB" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LIB32=link.exe -lib
+# ADD BASE LIB32 /nologo
+# ADD LIB32 /nologo /out:"Debug/eo_libd.lib"
+# Begin Custom Build - Installing $(InputPath) in lib directory
+TargetPath=.\Debug\eo_libd.lib
+InputPath=.\Debug\eo_libd.lib
+SOURCE="$(InputPath)"
+
+"lib\$(TargetPath)" : $(SOURCE) "$(INTDIR)" "$(OUTDIR)"
+	if not exist "lib" md "lib" 
+	copy "$(TargetPath)" "lib" 
+	
+# End Custom Build
+
+!ENDIF 
+
+# Begin Target
+
+# Name "all_lib - Win32 Release"
+# Name "all_lib - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/all_tests.dsp b/trunk/paradiseo-eo/win/all_tests.dsp
new file mode 100644
index 000000000..d449eb7eb
--- /dev/null
+++ b/trunk/paradiseo-eo/win/all_tests.dsp
@@ -0,0 +1,96 @@
+# Microsoft Developer Studio Project File - Name="all_tests" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=all_tests - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "all_tests.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "all_tests.mak" CFG="all_tests - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "all_tests - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "all_tests - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "all_tests - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+
+!ELSEIF  "$(CFG)" == "all_tests - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "Debug"
+# PROP BASE Intermediate_Dir "Debug"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+
+!ENDIF 
+
+# Begin Target
+
+# Name "all_tests - Win32 Release"
+# Name "all_tests - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/all_tut.dsp b/trunk/paradiseo-eo/win/all_tut.dsp
new file mode 100644
index 000000000..4b39e1b4d
--- /dev/null
+++ b/trunk/paradiseo-eo/win/all_tut.dsp
@@ -0,0 +1,96 @@
+# Microsoft Developer Studio Project File - Name="all_tut" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=all_tut - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "all_tut.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "all_tut.mak" CFG="all_tut - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "all_tut - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "all_tut - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "all_tut - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+
+!ELSEIF  "$(CFG)" == "all_tut - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "Debug"
+# PROP BASE Intermediate_Dir "Debug"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+
+!ENDIF 
+
+# Begin Target
+
+# Name "all_tut - Win32 Release"
+# Name "all_tut - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/create_all_dsp.sh b/trunk/paradiseo-eo/win/create_all_dsp.sh
new file mode 100755
index 000000000..feed7bfb5
--- /dev/null
+++ b/trunk/paradiseo-eo/win/create_all_dsp.sh
@@ -0,0 +1,38 @@
+#! /bin/tcsh -f
+# 
+# script that generates the DSP files for all programs in test dir
+#
+# to add a new one, add the corresponding line:
+#
+# create_dsp SourceFileName dspFileName [optional additional library]
+#
+# don't use upper-case letters in the dspFileName
+
+# create a backup
+/bin/mv eo.dsw eo.dsw~
+# restore empty DSW
+cp eo.org eo.dsw
+# GO for all programs
+create_dsp.sh t-eoParetoFitness  t_eoparetofitness 
+create_dsp.sh t-eoPareto         t_eopareto 
+create_dsp.sh t-eofitness        t_eofitness 
+create_dsp.sh t-eoRandom         t_eorandom 
+create_dsp.sh t-eobin            t_eobin 
+create_dsp.sh t-eoVirus          t_eovirus 
+create_dsp.sh t-MGE              t_mge 
+create_dsp.sh t-MGE1bit          t_mge1bit 
+create_dsp.sh t-MGE-control      t_mge-control 
+create_dsp.sh t-eoStateAndParser t_eostateandparser 
+create_dsp.sh t-eoCheckpointing  t_eocheckpointing 
+create_dsp.sh t-eoSSGA           t_eossga 
+create_dsp.sh t-eoExternalEO     t_eoexternaleo 
+create_dsp.sh t-eoSymreg         t_eosymreg 
+create_dsp.sh t-eo               t_eo 
+create_dsp.sh t-eoReplacement    t_eoreplacement 
+create_dsp.sh t-eoSelect         t_eoselect 
+create_dsp.sh t-eoGenOp          t_eogenop 
+create_dsp.sh t-eoGA             t_eoga             ga
+create_dsp.sh t-eoReal           t_eoreal           es
+create_dsp.sh t-eoVector         t_eovector 
+create_dsp.sh t-eoESAll          t_eoesall          es
+create_dsp.sh t-eoPBIL           t_eopbil           ga
diff --git a/trunk/paradiseo-eo/win/create_dsp.sh b/trunk/paradiseo-eo/win/create_dsp.sh
new file mode 100755
index 000000000..78c3c2dea
--- /dev/null
+++ b/trunk/paradiseo-eo/win/create_dsp.sh
@@ -0,0 +1,37 @@
+#! /bin/tcsh -f
+
+if ($#argv < 2) then
+    echo Usage $0 SourceName TargetName
+    echo Example: $0 t-eoGA t_eoga ga
+    echo "    will create t_eoga.dsp that in turn is the Win project file"
+    echo "    that will create the executable t_eoga using source"
+    echo "    t-eoga.cpp in test dir"
+    exit
+endif
+echo "Creating $2.dsp"
+echo s/DIRNAME/$2/g  > toto.sed
+echo s/SOURCENAME/$1/g >> toto.sed
+
+sed -f toto.sed test_dsp.tmpl > $2.dsp
+/bin/rm toto.sed
+
+echo "Adding $2.dsp in the main eo.dsw project file"
+
+echo "" >> eo.dsw
+echo Project: \"$2\"=.\\\\$2.dsp - Package Owner=\<4\> >> eo.dsw
+echo "" >> eo.dsw
+echo Package=\<5\> >> eo.dsw
+echo '{{{' >> eo.dsw
+echo '}}}' >> eo.dsw
+echo "" >> eo.dsw
+echo Package=\<4\> >> eo.dsw
+echo '{{{' >> eo.dsw
+echo '}}}' >> eo.dsw
+echo "" >> eo.dsw
+echo '###############################################################################' >> eo.dsw
+
+echo "AND DON'T FORGET to add the 3 lines in eo.dsw"
+echo "   (too lazy to do it automatically)"
+echo "    Begin Project Dependency"
+echo "   " Project_Dep_Name $2
+echo "    End Project Dependency"
diff --git a/trunk/paradiseo-eo/win/create_tut.sh b/trunk/paradiseo-eo/win/create_tut.sh
new file mode 100755
index 000000000..c9737bd0f
--- /dev/null
+++ b/trunk/paradiseo-eo/win/create_tut.sh
@@ -0,0 +1,38 @@
+#! /bin/tcsh -f
+
+if ($#argv < 2) then
+    echo "Usage $0 LessonNumber NickName SourceName (no .cpp)"
+    echo Example: $0 1 bit FirstBitGA
+    echo "    will create the Win project file tut_1_bit.dsp"
+    echo "    that will create the executable tut_1_bit.exe using source"
+    echo "    FirstBitGA.cpp in tutorial/Lesson1 dir"
+    exit
+endif
+echo "Creating tut_{$1}_{$2}.dsp"
+echo s/tut_N_XXX/tut_{$1}_{$2}/g  > toto.sed
+echo s/LessonN/Lesson$1/g >> toto.sed
+echo s/SRCXXX/$3/g >> toto.sed
+
+sed -f toto.sed tut_N_XXX.tmpl > tut_{$1}_{$2}.dsp
+/bin/rm toto.sed
+
+echo "Adding tut_{$1}_{$2}.dsp in the main eo.dsw project file"
+
+echo "" >> eo.dsw
+echo Project: \"tut_{$1}_{$2}\"=.\\\\tut_{$1}_{$2}.dsp - Package Owner=\<4\> >> eo.dsw
+echo "" >> eo.dsw
+echo Package=\<5\> >> eo.dsw
+echo '{{{' >> eo.dsw
+echo '}}}' >> eo.dsw
+echo "" >> eo.dsw
+echo Package=\<4\> >> eo.dsw
+echo '{{{' >> eo.dsw
+echo '}}}' >> eo.dsw
+echo "" >> eo.dsw
+echo '###############################################################################' >> eo.dsw
+
+echo "AND DON'T FORGET to add the 3 lines in eo.dsw"
+echo "  (too lazy to do it automatically)"
+echo "    Begin Project Dependency"
+echo "   " Project_Dep_Name tut_{$1}_{$2}
+echo "    End Project Dependency"
diff --git a/trunk/paradiseo-eo/win/create_tut_para.sh b/trunk/paradiseo-eo/win/create_tut_para.sh
new file mode 100755
index 000000000..6e12d41e4
--- /dev/null
+++ b/trunk/paradiseo-eo/win/create_tut_para.sh
@@ -0,0 +1,38 @@
+#! /bin/tcsh -f
+
+if ($#argv < 2) then
+    echo "Usage $0 LessonNumber NickName SourceName (no .cpp)"
+    echo Example: $0 1 bit FirstBitGA
+    echo "    will create the Win project file tut_para1_bit.dsp"
+    echo "    that will create the executable tut_para1_full.exe using source"
+    echo "    IslandBitEA.cpp in tutorial/ParadisEO/Lesson1 dir"
+    exit
+endif
+echo "Creating tut_{$1}_{$2}.dsp"
+echo s/tut_N_XXX/tut_para{$1}_{$2}/g  > toto.sed
+echo s/LessonN/Lesson$1/g >> toto.sed
+echo s/SRCXXX/$3/g >> toto.sed
+
+sed -f toto.sed tut_paraN_XXX.tmpl > tut_para{$1}_{$2}.dsp
+/bin/rm toto.sed
+
+echo "Adding tut_{$1}_{$2}.dsp in the main eo.dsw project file"
+
+echo "" >> eo.dsw
+echo Project: \"tut_para{$1}_{$2}\"=.\\\\tut_para{$1}_{$2}.dsp - Package Owner=\<4\> >> eo.dsw
+echo "" >> eo.dsw
+echo Package=\<5\> >> eo.dsw
+echo '{{{' >> eo.dsw
+echo '}}}' >> eo.dsw
+echo "" >> eo.dsw
+echo Package=\<4\> >> eo.dsw
+echo '{{{' >> eo.dsw
+echo '}}}' >> eo.dsw
+echo "" >> eo.dsw
+echo '###############################################################################' >> eo.dsw
+
+echo "AND DON'T FORGET to add the 3 lines in eo.dsw"
+echo "  (too lazy to do it automatically)"
+echo "    Begin Project Dependency"
+echo "   " Project_Dep_Name tut_para{$1}_{$2}
+echo "    End Project Dependency"
diff --git a/trunk/paradiseo-eo/win/eo.dsp b/trunk/paradiseo-eo/win/eo.dsp
new file mode 100644
index 000000000..bac4ac287
--- /dev/null
+++ b/trunk/paradiseo-eo/win/eo.dsp
@@ -0,0 +1,126 @@
+# Microsoft Developer Studio Project File - Name="eo" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Static Library" 0x0104
+
+CFG=eo - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "eo.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "eo.mak" CFG="eo - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "eo - Win32 Release" (based on "Win32 (x86) Static Library")
+!MESSAGE "eo - Win32 Debug" (based on "Win32 (x86) Static Library")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "eo - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_MBCS" /D "_LIB" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_MBCS" /D "_LIB" /FD /c
+# SUBTRACT CPP /YX
+# ADD BASE RSC /l 0xc0a /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LIB32=link.exe -lib
+# ADD BASE LIB32 /nologo
+# ADD LIB32 /nologo
+
+!ELSEIF  "$(CFG)" == "eo - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "Debug"
+# PROP BASE Intermediate_Dir "Debugj"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_MBCS" /D "_LIB" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /W3 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_MBCS" /D "_LIB" /FD /GZ /c
+# SUBTRACT CPP /YX
+# ADD BASE RSC /l 0xc0a /d "_DEBUG"
+# ADD RSC /l 0xc0a /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LIB32=link.exe -lib
+# ADD BASE LIB32 /nologo
+# ADD LIB32 /nologo /out:"Debug\eod.lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "eo - Win32 Release"
+# Name "eo - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE=..\src\eoFunctorStore.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\eoParetoFitness.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\eoPersistent.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\eoPrintable.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\eoScalarFitnessAssembled.cpp
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# Begin Source File
+
+SOURCE=..\src\eoFunctorStore.H
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\eoPersistent.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\eoPrintable.h
+# End Source File
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/eo.dsw b/trunk/paradiseo-eo/win/eo.dsw
new file mode 100644
index 000000000..44eae5eea
--- /dev/null
+++ b/trunk/paradiseo-eo/win/eo.dsw
@@ -0,0 +1,728 @@
+Microsoft Developer Studio Workspace File, Format Version 6.00
+# WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE!
+
+###############################################################################
+
+Project: "all_lib"=.\all_lib.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+    Begin Project Dependency
+    Project_Dep_Name eo
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name es
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name ga
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name utils
+    End Project Dependency
+}}}
+
+###############################################################################
+
+Project: "all_tests"=.\all_tests.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+    Begin Project Dependency
+    Project_Dep_Name t_eo
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name t_eobin
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name t_eocheckpointing
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name t_eoesall
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name t_eoexternaleo
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name t_eofitness
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name t_eoga
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name t_eogenop
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name t_eopareto
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name t_eoparetofitness
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name t_eopbil
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name t_eorandom
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name t_eoreal
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name t_eoreplacement
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name t_eoselect
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name t_eossga
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name t_eostateandparser
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name t_eosymreg
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name t_eovector
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name t_eovirus
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name t_mge
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name t_mge-control
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name t_mge1bit
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name t_eofitnessassembledea
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name t_eofitnessassembled
+    End Project Dependency
+}}}
+
+###############################################################################
+
+Project: "all_tut"=.\all_tut.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+    Begin Project Dependency
+    Project_Dep_Name tut_1_bit
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name tut_1_real
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name tut_1_ex3
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name tut_2_bit
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name tut_2_real
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name tut_2_ex3
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name tut_3_bit
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name tut_3_ex1
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name tut_4_bit
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name tut_4_real
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name tut_4_es
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name tut_para1_full
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name tut_para1_ring1
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name tut_para1_ring2
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name tut_para2_master
+    End Project Dependency
+    Begin Project Dependency
+    Project_Dep_Name tut_para2_slave
+    End Project Dependency
+}}}
+
+###############################################################################
+
+Project: "eo"=.\eo.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "es"=.\es.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "ga"=.\ga.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "t_eo"=.\t_eo.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "t_eobin"=.\t_eobin.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "t_eocheckpointing"=.\t_eocheckpointing.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "t_eoesall"=.\t_eoesall.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "t_eoexternaleo"=.\t_eoexternaleo.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "t_eofitness"=.\t_eofitness.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "t_eofitnessassembled"=.\t_eofitnessassembled.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "t_eofitnessassembledea"=.\t_eofitnessassembledea.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "t_eoga"=.\t_eoga.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "t_eogenop"=.\t_eogenop.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "t_eopareto"=.\t_eopareto.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "t_eoparetofitness"=.\t_eoparetofitness.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "t_eopbil"=.\t_eopbil.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "t_eorandom"=.\t_eorandom.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "t_eoreal"=.\t_eoreal.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "t_eoreplacement"=.\t_eoreplacement.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "t_eoselect"=.\t_eoselect.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "t_eossga"=.\t_eossga.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "t_eostateandparser"=.\t_eostateandparser.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "t_eosymreg"=.\t_eosymreg.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "t_eovector"=.\t_eovector.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "t_eovirus"=.\t_eovirus.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "t_mge"=.\t_mge.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "t_mge-control"=".\t_mge-control.dsp" - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "t_mge1bit"=.\t_mge1bit.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "tut_1_bit"=.\tut_1_bit.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "tut_1_ex3"=.\tut_1_ex3.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "tut_1_real"=.\tut_1_real.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "tut_2_bit"=.\tut_2_bit.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "tut_2_ex3"=.\tut_2_ex3.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "tut_2_real"=.\tut_2_real.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "tut_3_bit"=.\tut_3_bit.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "tut_3_ex1"=.\tut_3_ex1.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "tut_4_bit"=.\tut_4_bit.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "tut_4_es"=.\tut_4_es.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "tut_4_real"=.\tut_4_real.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "tut_para1_full"=.\tut_para1_full.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "tut_para1_ring1"=.\tut_para1_ring1.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "tut_para1_ring2"=.\tut_para1_ring2.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "tut_para2_master"=.\tut_para2_master.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "tut_para2_slave"=.\tut_para2_slave.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "utils"=.\utils.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Global:
+
+Package=<5>
+{{{
+}}}
+
+Package=<3>
+{{{
+}}}
+
+###############################################################################
+
diff --git a/trunk/paradiseo-eo/win/eo.org b/trunk/paradiseo-eo/win/eo.org
new file mode 100644
index 000000000..f15aec656
--- /dev/null
+++ b/trunk/paradiseo-eo/win/eo.org
@@ -0,0 +1,65 @@
+Microsoft Developer Studio Workspace File, Format Version 6.00
+# WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE!
+
+###############################################################################
+
+Project: "eo"=.\eo.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "es"=.\es.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "ga"=.\ga.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "utils"=.\utils.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Global:
+
+Package=<5>
+{{{
+}}}
+
+Package=<3>
+{{{
+}}}
+
+###############################################################################
+
diff --git a/trunk/paradiseo-eo/win/es.dsp b/trunk/paradiseo-eo/win/es.dsp
new file mode 100644
index 000000000..9b7db13fe
--- /dev/null
+++ b/trunk/paradiseo-eo/win/es.dsp
@@ -0,0 +1,224 @@
+# Microsoft Developer Studio Project File - Name="es" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Static Library" 0x0104
+
+CFG=es - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "es.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "es.mak" CFG="es - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "es - Win32 Release" (based on "Win32 (x86) Static Library")
+!MESSAGE "es - Win32 Debug" (based on "Win32 (x86) Static Library")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "es - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_MBCS" /D "_LIB" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_MBCS" /D "_LIB" /D "NO_GNUPLOT" /YX /FD /Zm200 /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LIB32=link.exe -lib
+# ADD BASE LIB32 /nologo
+# ADD LIB32 /nologo
+
+!ELSEIF  "$(CFG)" == "es - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "Debug"
+# PROP BASE Intermediate_Dir "Debug"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_MBCS" /D "_LIB" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_MBCS" /D "_LIB" /D "NO_GNUPLOT" /YX /FD /GZ /Zm200 /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LIB32=link.exe -lib
+# ADD BASE LIB32 /nologo
+# ADD LIB32 /nologo /out:"Debug\esd.lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "es - Win32 Release"
+# Name "es - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE=..\src\es\make_algo_scalar_es.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\make_algo_scalar_real.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\make_checkpoint_es.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\make_checkpoint_real.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\make_continue_es.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\make_continue_real.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\make_genotype_es.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\make_genotype_real.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\make_op_es.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\make_op_real.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\make_pop_es.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\make_pop_real.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\make_run_es.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\make_run_real.cpp
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# Begin Source File
+
+SOURCE=..\src\es\eoEsChromInit.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\eoEsFull.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\eoEsGlobalXover.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\eoEsMutate.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\eoEsMutationInit.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\eoEsSimple.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\eoEsStandardXover.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\eoEsStdev.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\eoNormalMutation.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\eoReal.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\eoRealAtomXover.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\eoRealInitBounded.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\eoRealOp.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\make_es.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\make_genotype_real.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\make_op.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\make_op_es.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\make_op_real.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\es\make_real.h
+# End Source File
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/ga.dsp b/trunk/paradiseo-eo/win/ga.dsp
new file mode 100644
index 000000000..9ec1df2a3
--- /dev/null
+++ b/trunk/paradiseo-eo/win/ga.dsp
@@ -0,0 +1,144 @@
+# Microsoft Developer Studio Project File - Name="ga" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Static Library" 0x0104
+
+CFG=ga - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "ga.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "ga.mak" CFG="ga - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "ga - Win32 Release" (based on "Win32 (x86) Static Library")
+!MESSAGE "ga - Win32 Debug" (based on "Win32 (x86) Static Library")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "ga - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_MBCS" /D "_LIB" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_MBCS" /D "_LIB" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LIB32=link.exe -lib
+# ADD BASE LIB32 /nologo
+# ADD LIB32 /nologo
+
+!ELSEIF  "$(CFG)" == "ga - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "ga___Win32_Debug"
+# PROP BASE Intermediate_Dir "ga___Win32_Debug"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_MBCS" /D "_LIB" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_MBCS" /D "_LIB" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LIB32=link.exe -lib
+# ADD BASE LIB32 /nologo
+# ADD LIB32 /nologo /out:"Debug\gad.lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "ga - Win32 Release"
+# Name "ga - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE=..\src\ga\make_algo_scalar_ga.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\ga\make_checkpoint_ga.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\ga\make_continue_ga.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\ga\make_genotype_ga.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\ga\make_op_ga.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\ga\make_pop_ga.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\ga\make_run_ga.cpp
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# Begin Source File
+
+SOURCE=..\src\ga\eoBit.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\ga\eoBitOp.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\ga\eoBitOpFactory.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\ga\make_ga.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\ga\make_genotype_ga.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\ga\make_op.h
+# End Source File
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/lib/CVS/Entries b/trunk/paradiseo-eo/win/lib/CVS/Entries
new file mode 100644
index 000000000..2c252fe43
--- /dev/null
+++ b/trunk/paradiseo-eo/win/lib/CVS/Entries
@@ -0,0 +1,2 @@
+/Readme/1.1/Sat Nov 10 14:12:01 2001//
+D
diff --git a/trunk/paradiseo-eo/win/lib/CVS/Repository b/trunk/paradiseo-eo/win/lib/CVS/Repository
new file mode 100644
index 000000000..024acf401
--- /dev/null
+++ b/trunk/paradiseo-eo/win/lib/CVS/Repository
@@ -0,0 +1 @@
+eo/win/lib
diff --git a/trunk/paradiseo-eo/win/lib/CVS/Root b/trunk/paradiseo-eo/win/lib/CVS/Root
new file mode 100644
index 000000000..4cf4ab187
--- /dev/null
+++ b/trunk/paradiseo-eo/win/lib/CVS/Root
@@ -0,0 +1 @@
+:ext:evomarc@eodev.cvs.sourceforge.net:/cvsroot/eodev
diff --git a/trunk/paradiseo-eo/win/lib/Readme b/trunk/paradiseo-eo/win/lib/Readme
new file mode 100644
index 000000000..24086802f
--- /dev/null
+++ b/trunk/paradiseo-eo/win/lib/Readme
@@ -0,0 +1,4 @@
+Here will be copied the eo libraries.
+
+xx.lib are Release versions
+xxd.lib are Debug versions
\ No newline at end of file
diff --git a/trunk/paradiseo-eo/win/make_snapshot.out b/trunk/paradiseo-eo/win/make_snapshot.out
new file mode 100644
index 000000000..41313fd55
--- /dev/null
+++ b/trunk/paradiseo-eo/win/make_snapshot.out
@@ -0,0 +1,49 @@
+unix2dos: converting file all_lib.dsp to DOS format ...
+unix2dos: converting file all_tests.dsp to DOS format ...
+unix2dos: converting file all_tut.dsp to DOS format ...
+unix2dos: converting file eo.dsp to DOS format ...
+unix2dos: converting file es.dsp to DOS format ...
+unix2dos: converting file ga.dsp to DOS format ...
+unix2dos: converting file t_eobin.dsp to DOS format ...
+unix2dos: converting file t_eocheckpointing.dsp to DOS format ...
+unix2dos: converting file t_eo.dsp to DOS format ...
+unix2dos: converting file t_eoesall.dsp to DOS format ...
+unix2dos: converting file t_eoexternaleo.dsp to DOS format ...
+unix2dos: converting file t_eofitnessassembled.dsp to DOS format ...
+unix2dos: converting file t_eofitnessassembledea.dsp to DOS format ...
+unix2dos: converting file t_eofitness.dsp to DOS format ...
+unix2dos: converting file t_eoga.dsp to DOS format ...
+unix2dos: converting file t_eogenop.dsp to DOS format ...
+unix2dos: converting file t_eopareto.dsp to DOS format ...
+unix2dos: converting file t_eoparetofitness.dsp to DOS format ...
+unix2dos: converting file t_eopbil.dsp to DOS format ...
+unix2dos: converting file t_eorandom.dsp to DOS format ...
+unix2dos: converting file t_eoreal.dsp to DOS format ...
+unix2dos: converting file t_eoreplacement.dsp to DOS format ...
+unix2dos: converting file t_eoselect.dsp to DOS format ...
+unix2dos: converting file t_eossga.dsp to DOS format ...
+unix2dos: converting file t_eostateandparser.dsp to DOS format ...
+unix2dos: converting file t_eosymreg.dsp to DOS format ...
+unix2dos: converting file t_eovector.dsp to DOS format ...
+unix2dos: converting file t_eovirus.dsp to DOS format ...
+unix2dos: converting file t_mge1bit.dsp to DOS format ...
+unix2dos: converting file t_mge-control.dsp to DOS format ...
+unix2dos: converting file t_mge.dsp to DOS format ...
+unix2dos: converting file tut_1_bit.dsp to DOS format ...
+unix2dos: converting file tut_1_ex3.dsp to DOS format ...
+unix2dos: converting file tut_1_real.dsp to DOS format ...
+unix2dos: converting file tut_2_bit.dsp to DOS format ...
+unix2dos: converting file tut_2_ex3.dsp to DOS format ...
+unix2dos: converting file tut_2_real.dsp to DOS format ...
+unix2dos: converting file tut_3_bit.dsp to DOS format ...
+unix2dos: converting file tut_3_ex1.dsp to DOS format ...
+unix2dos: converting file tut_4_bit.dsp to DOS format ...
+unix2dos: converting file tut_4_es.dsp to DOS format ...
+unix2dos: converting file tut_4_real.dsp to DOS format ...
+unix2dos: converting file tut_para1_full.dsp to DOS format ...
+unix2dos: converting file tut_para1_ring1.dsp to DOS format ...
+unix2dos: converting file tut_para1_ring2.dsp to DOS format ...
+unix2dos: converting file tut_para2_master.dsp to DOS format ...
+unix2dos: converting file tut_para2_slave.dsp to DOS format ...
+unix2dos: converting file utils.dsp to DOS format ...
+unix2dos: converting file eo.dsw to DOS format ...
diff --git a/trunk/paradiseo-eo/win/t_eo.dsp b/trunk/paradiseo-eo/win/t_eo.dsp
new file mode 100644
index 000000000..8dc7f0dc8
--- /dev/null
+++ b/trunk/paradiseo-eo/win/t_eo.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="t_eo" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=t_eo - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eo.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eo.mak" CFG="t_eo - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "t_eo - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "t_eo - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "t_eo - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "t_eo - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "t_eo___Win32_Debug0"
+# PROP BASE Intermediate_Dir "t_eo___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "t_eo - Win32 Release"
+# Name "t_eo - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\test\t-eo.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/t_eobin.dsp b/trunk/paradiseo-eo/win/t_eobin.dsp
new file mode 100644
index 000000000..6df155e43
--- /dev/null
+++ b/trunk/paradiseo-eo/win/t_eobin.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="t_eobin" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=t_eobin - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eobin.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eobin.mak" CFG="t_eobin - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "t_eobin - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "t_eobin - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "t_eobin - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "t_eobin - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "t_eobin___Win32_Debug0"
+# PROP BASE Intermediate_Dir "t_eobin___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "t_eobin - Win32 Release"
+# Name "t_eobin - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\test\t-eobin.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/t_eocheckpointing.dsp b/trunk/paradiseo-eo/win/t_eocheckpointing.dsp
new file mode 100644
index 000000000..ad8097092
--- /dev/null
+++ b/trunk/paradiseo-eo/win/t_eocheckpointing.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="t_eocheckpointing" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=t_eocheckpointing - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eocheckpointing.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eocheckpointing.mak" CFG="t_eocheckpointing - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "t_eocheckpointing - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "t_eocheckpointing - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "t_eocheckpointing - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "t_eocheckpointing - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "t_eocheckpointing___Win32_Debug0"
+# PROP BASE Intermediate_Dir "t_eocheckpointing___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "t_eocheckpointing - Win32 Release"
+# Name "t_eocheckpointing - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\test\t-eoCheckpointing.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/t_eoesall.dsp b/trunk/paradiseo-eo/win/t_eoesall.dsp
new file mode 100644
index 000000000..d24a598bb
--- /dev/null
+++ b/trunk/paradiseo-eo/win/t_eoesall.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="t_eoesall" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=t_eoesall - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eoesall.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eoesall.mak" CFG="t_eoesall - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "t_eoesall - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "t_eoesall - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "t_eoesall - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "t_eoesall - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "t_eoesall___Win32_Debug0"
+# PROP BASE Intermediate_Dir "t_eoesall___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "t_eoesall - Win32 Release"
+# Name "t_eoesall - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\test\t-eoESAll.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/t_eoexternaleo.dsp b/trunk/paradiseo-eo/win/t_eoexternaleo.dsp
new file mode 100644
index 000000000..7b799731d
--- /dev/null
+++ b/trunk/paradiseo-eo/win/t_eoexternaleo.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="t_eoexternaleo" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=t_eoexternaleo - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eoexternaleo.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eoexternaleo.mak" CFG="t_eoexternaleo - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "t_eoexternaleo - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "t_eoexternaleo - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "t_eoexternaleo - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "t_eoexternaleo - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "t_eoexternaleo___Win32_Debug0"
+# PROP BASE Intermediate_Dir "t_eoexternaleo___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "t_eoexternaleo - Win32 Release"
+# Name "t_eoexternaleo - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\test\t-eoExternalEO.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/t_eofitness.dsp b/trunk/paradiseo-eo/win/t_eofitness.dsp
new file mode 100644
index 000000000..6b4d8977a
--- /dev/null
+++ b/trunk/paradiseo-eo/win/t_eofitness.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="t_eofitness" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=t_eofitness - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eofitness.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eofitness.mak" CFG="t_eofitness - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "t_eofitness - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "t_eofitness - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "t_eofitness - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "t_eofitness - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "t_eofitness___Win32_Debug0"
+# PROP BASE Intermediate_Dir "t_eofitness___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "t_eofitness - Win32 Release"
+# Name "t_eofitness - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\test\t-eofitness.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/t_eofitnessassembled.dsp b/trunk/paradiseo-eo/win/t_eofitnessassembled.dsp
new file mode 100644
index 000000000..91a6fe385
--- /dev/null
+++ b/trunk/paradiseo-eo/win/t_eofitnessassembled.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="t_eofitnessassembled" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=t_eofitnessassembled - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eofitnessassembled.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eofitnessassembled.mak" CFG="t_eofitnessassembled - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "t_eofitnessassembled - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "t_eofitnessassembled - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "t_eofitnessassembled - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "t_eofitnessassembled - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "t_eofitnessassembled___Win32_Debug0"
+# PROP BASE Intermediate_Dir "t_eofitnessassembled___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "t_eofitnessassembled - Win32 Release"
+# Name "t_eofitnessassembled - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\test\t-eoFitnessAssembled.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/t_eofitnessassembledea.dsp b/trunk/paradiseo-eo/win/t_eofitnessassembledea.dsp
new file mode 100644
index 000000000..b3270eb75
--- /dev/null
+++ b/trunk/paradiseo-eo/win/t_eofitnessassembledea.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="t_eofitnessassembledea" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=t_eofitnessassembledea - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eofitnessassembledea.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eofitnessassembledea.mak" CFG="t_eofitnessassembledea - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "t_eofitnessassembledea - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "t_eofitnessassembledea - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "t_eofitnessassembledea - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "t_eofitnessassembledea - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "t_eofitnessassembledea___Win32_Debug0"
+# PROP BASE Intermediate_Dir "t_eofitnessassembledea___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "t_eofitnessassembledea - Win32 Release"
+# Name "t_eofitnessassembledea - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\test\t-eoFitnessAssembledEA.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/t_eoga.dsp b/trunk/paradiseo-eo/win/t_eoga.dsp
new file mode 100644
index 000000000..a91e57bb2
--- /dev/null
+++ b/trunk/paradiseo-eo/win/t_eoga.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="t_eoga" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=t_eoga - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eoga.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eoga.mak" CFG="t_eoga - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "t_eoga - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "t_eoga - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "t_eoga - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "t_eoga - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "t_eoga___Win32_Debug0"
+# PROP BASE Intermediate_Dir "t_eoga___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "t_eoga - Win32 Release"
+# Name "t_eoga - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\test\t-eoGA.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/t_eogenop.dsp b/trunk/paradiseo-eo/win/t_eogenop.dsp
new file mode 100644
index 000000000..195dd79cd
--- /dev/null
+++ b/trunk/paradiseo-eo/win/t_eogenop.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="t_eogenop" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=t_eogenop - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eogenop.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eogenop.mak" CFG="t_eogenop - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "t_eogenop - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "t_eogenop - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "t_eogenop - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "t_eogenop - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "t_eogenop___Win32_Debug0"
+# PROP BASE Intermediate_Dir "t_eogenop___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "t_eogenop - Win32 Release"
+# Name "t_eogenop - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\test\t-eoGenOp.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/t_eopareto.dsp b/trunk/paradiseo-eo/win/t_eopareto.dsp
new file mode 100644
index 000000000..055b01655
--- /dev/null
+++ b/trunk/paradiseo-eo/win/t_eopareto.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="t_eopareto" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=t_eopareto - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eopareto.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eopareto.mak" CFG="t_eopareto - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "t_eopareto - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "t_eopareto - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "t_eopareto - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "t_eopareto - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "t_eopareto___Win32_Debug0"
+# PROP BASE Intermediate_Dir "t_eopareto___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "t_eopareto - Win32 Release"
+# Name "t_eopareto - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\test\t-eoPareto.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/t_eoparetofitness.dsp b/trunk/paradiseo-eo/win/t_eoparetofitness.dsp
new file mode 100644
index 000000000..9b692e3f8
--- /dev/null
+++ b/trunk/paradiseo-eo/win/t_eoparetofitness.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="t_eoparetofitness" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=t_eoparetofitness - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eoparetofitness.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eoparetofitness.mak" CFG="t_eoparetofitness - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "t_eoparetofitness - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "t_eoparetofitness - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "t_eoparetofitness - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "t_eoparetofitness - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "t_eoparetofitness___Win32_Debug0"
+# PROP BASE Intermediate_Dir "t_eoparetofitness___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "t_eoparetofitness - Win32 Release"
+# Name "t_eoparetofitness - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\test\t-eoParetoFitness.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/t_eopbil.dsp b/trunk/paradiseo-eo/win/t_eopbil.dsp
new file mode 100644
index 000000000..66668a092
--- /dev/null
+++ b/trunk/paradiseo-eo/win/t_eopbil.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="t_eopbil" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=t_eopbil - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eopbil.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eopbil.mak" CFG="t_eopbil - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "t_eopbil - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "t_eopbil - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "t_eopbil - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "t_eopbil - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "t_eopbil___Win32_Debug0"
+# PROP BASE Intermediate_Dir "t_eopbil___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "t_eopbil - Win32 Release"
+# Name "t_eopbil - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\test\t-eoPBIL.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/t_eorandom.dsp b/trunk/paradiseo-eo/win/t_eorandom.dsp
new file mode 100644
index 000000000..ea1270a0a
--- /dev/null
+++ b/trunk/paradiseo-eo/win/t_eorandom.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="t_eorandom" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=t_eorandom - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eorandom.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eorandom.mak" CFG="t_eorandom - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "t_eorandom - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "t_eorandom - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "t_eorandom - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "t_eorandom - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "t_eorandom___Win32_Debug0"
+# PROP BASE Intermediate_Dir "t_eorandom___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "t_eorandom - Win32 Release"
+# Name "t_eorandom - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\test\t-eoRandom.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/t_eoreal.dsp b/trunk/paradiseo-eo/win/t_eoreal.dsp
new file mode 100644
index 000000000..aacd816a8
--- /dev/null
+++ b/trunk/paradiseo-eo/win/t_eoreal.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="t_eoreal" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=t_eoreal - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eoreal.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eoreal.mak" CFG="t_eoreal - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "t_eoreal - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "t_eoreal - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "t_eoreal - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "t_eoreal - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "t_eoreal___Win32_Debug0"
+# PROP BASE Intermediate_Dir "t_eoreal___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "t_eoreal - Win32 Release"
+# Name "t_eoreal - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\test\t-eoReal.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/t_eoreplacement.dsp b/trunk/paradiseo-eo/win/t_eoreplacement.dsp
new file mode 100644
index 000000000..fa39a2b91
--- /dev/null
+++ b/trunk/paradiseo-eo/win/t_eoreplacement.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="t_eoreplacement" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=t_eoreplacement - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eoreplacement.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eoreplacement.mak" CFG="t_eoreplacement - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "t_eoreplacement - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "t_eoreplacement - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "t_eoreplacement - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "t_eoreplacement - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "t_eoreplacement___Win32_Debug0"
+# PROP BASE Intermediate_Dir "t_eoreplacement___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "t_eoreplacement - Win32 Release"
+# Name "t_eoreplacement - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\test\t-eoReplacement.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/t_eoselect.dsp b/trunk/paradiseo-eo/win/t_eoselect.dsp
new file mode 100644
index 000000000..4bc5d0745
--- /dev/null
+++ b/trunk/paradiseo-eo/win/t_eoselect.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="t_eoselect" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=t_eoselect - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eoselect.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eoselect.mak" CFG="t_eoselect - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "t_eoselect - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "t_eoselect - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "t_eoselect - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "t_eoselect - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "t_eoselect___Win32_Debug0"
+# PROP BASE Intermediate_Dir "t_eoselect___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "t_eoselect - Win32 Release"
+# Name "t_eoselect - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\test\t-eoSelect.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/t_eossga.dsp b/trunk/paradiseo-eo/win/t_eossga.dsp
new file mode 100644
index 000000000..41338b532
--- /dev/null
+++ b/trunk/paradiseo-eo/win/t_eossga.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="t_eossga" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=t_eossga - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eossga.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eossga.mak" CFG="t_eossga - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "t_eossga - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "t_eossga - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "t_eossga - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "t_eossga - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "t_eossga___Win32_Debug0"
+# PROP BASE Intermediate_Dir "t_eossga___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "t_eossga - Win32 Release"
+# Name "t_eossga - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\test\t-eoSSGA.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/t_eostateandparser.dsp b/trunk/paradiseo-eo/win/t_eostateandparser.dsp
new file mode 100644
index 000000000..7e627b581
--- /dev/null
+++ b/trunk/paradiseo-eo/win/t_eostateandparser.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="t_eostateandparser" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=t_eostateandparser - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eostateandparser.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eostateandparser.mak" CFG="t_eostateandparser - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "t_eostateandparser - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "t_eostateandparser - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "t_eostateandparser - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "t_eostateandparser - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "t_eostateandparser___Win32_Debug0"
+# PROP BASE Intermediate_Dir "t_eostateandparser___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "t_eostateandparser - Win32 Release"
+# Name "t_eostateandparser - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\test\t-eoStateAndParser.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/t_eosymreg.dsp b/trunk/paradiseo-eo/win/t_eosymreg.dsp
new file mode 100644
index 000000000..e09b99b58
--- /dev/null
+++ b/trunk/paradiseo-eo/win/t_eosymreg.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="t_eosymreg" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=t_eosymreg - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eosymreg.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eosymreg.mak" CFG="t_eosymreg - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "t_eosymreg - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "t_eosymreg - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "t_eosymreg - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "t_eosymreg - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "t_eosymreg___Win32_Debug0"
+# PROP BASE Intermediate_Dir "t_eosymreg___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "t_eosymreg - Win32 Release"
+# Name "t_eosymreg - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\test\t-eoSymreg.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/t_eovector.dsp b/trunk/paradiseo-eo/win/t_eovector.dsp
new file mode 100644
index 000000000..485637a92
--- /dev/null
+++ b/trunk/paradiseo-eo/win/t_eovector.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="t_eovector" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=t_eovector - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eovector.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eovector.mak" CFG="t_eovector - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "t_eovector - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "t_eovector - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "t_eovector - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "t_eovector - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "t_eovector___Win32_Debug0"
+# PROP BASE Intermediate_Dir "t_eovector___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "t_eovector - Win32 Release"
+# Name "t_eovector - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\test\t-eoVector.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/t_eovirus.dsp b/trunk/paradiseo-eo/win/t_eovirus.dsp
new file mode 100644
index 000000000..684cac054
--- /dev/null
+++ b/trunk/paradiseo-eo/win/t_eovirus.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="t_eovirus" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=t_eovirus - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eovirus.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "t_eovirus.mak" CFG="t_eovirus - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "t_eovirus - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "t_eovirus - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "t_eovirus - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "t_eovirus - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "t_eovirus___Win32_Debug0"
+# PROP BASE Intermediate_Dir "t_eovirus___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "t_eovirus - Win32 Release"
+# Name "t_eovirus - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\test\t-eoVirus.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/t_mge-control.dsp b/trunk/paradiseo-eo/win/t_mge-control.dsp
new file mode 100644
index 000000000..09888987d
--- /dev/null
+++ b/trunk/paradiseo-eo/win/t_mge-control.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="t_mge-control" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=t_mge-control - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "t_mge-control.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "t_mge-control.mak" CFG="t_mge-control - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "t_mge-control - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "t_mge-control - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "t_mge-control - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "t_mge-control - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "t_mge-control___Win32_Debug0"
+# PROP BASE Intermediate_Dir "t_mge-control___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "t_mge-control - Win32 Release"
+# Name "t_mge-control - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\test\t-MGE-control.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/t_mge.dsp b/trunk/paradiseo-eo/win/t_mge.dsp
new file mode 100644
index 000000000..aab3fb005
--- /dev/null
+++ b/trunk/paradiseo-eo/win/t_mge.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="t_mge" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=t_mge - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "t_mge.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "t_mge.mak" CFG="t_mge - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "t_mge - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "t_mge - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "t_mge - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "t_mge - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "t_mge___Win32_Debug0"
+# PROP BASE Intermediate_Dir "t_mge___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "t_mge - Win32 Release"
+# Name "t_mge - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\test\t-MGE.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/t_mge1bit.dsp b/trunk/paradiseo-eo/win/t_mge1bit.dsp
new file mode 100644
index 000000000..34ee75d88
--- /dev/null
+++ b/trunk/paradiseo-eo/win/t_mge1bit.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="t_mge1bit" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=t_mge1bit - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "t_mge1bit.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "t_mge1bit.mak" CFG="t_mge1bit - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "t_mge1bit - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "t_mge1bit - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "t_mge1bit - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "t_mge1bit - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "t_mge1bit___Win32_Debug0"
+# PROP BASE Intermediate_Dir "t_mge1bit___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "t_mge1bit - Win32 Release"
+# Name "t_mge1bit - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\test\t-MGE1bit.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/test_dsp.tmpl b/trunk/paradiseo-eo/win/test_dsp.tmpl
new file mode 100644
index 000000000..e7510a2b6
--- /dev/null
+++ b/trunk/paradiseo-eo/win/test_dsp.tmpl
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="DIRNAME" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=DIRNAME - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "DIRNAME.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "DIRNAME.mak" CFG="DIRNAME - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "DIRNAME - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "DIRNAME - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "DIRNAME - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release\obj"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 all_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "DIRNAME - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "Debug"
+# PROP BASE Intermediate_Dir "Debugj"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug\obj"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ  /c
+# ADD CPP /nologo /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ  /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 all_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "DIRNAME - Win32 Release"
+# Name "DIRNAME - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\test\SOURCENAME.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/tut_1_bit.dsp b/trunk/paradiseo-eo/win/tut_1_bit.dsp
new file mode 100644
index 000000000..5495dddef
--- /dev/null
+++ b/trunk/paradiseo-eo/win/tut_1_bit.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="tut_1_bit" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=tut_1_bit - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_1_bit.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_1_bit.mak" CFG="tut_1_bit - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "tut_1_bit - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "tut_1_bit - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "tut_1_bit - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "tut_1_bit - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "tut_1_bit___Win32_Debug0"
+# PROP BASE Intermediate_Dir "tut_1_bit___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "tut_1_bit - Win32 Release"
+# Name "tut_1_bit - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\tutorial\Lesson1\FirstBitGA.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/tut_1_ex3.dsp b/trunk/paradiseo-eo/win/tut_1_ex3.dsp
new file mode 100644
index 000000000..dcef19f39
--- /dev/null
+++ b/trunk/paradiseo-eo/win/tut_1_ex3.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="tut_1_ex3" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=tut_1_ex3 - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_1_ex3.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_1_ex3.mak" CFG="tut_1_ex3 - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "tut_1_ex3 - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "tut_1_ex3 - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "tut_1_ex3 - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "tut_1_ex3 - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "tut_1_ex3___Win32_Debug0"
+# PROP BASE Intermediate_Dir "tut_1_ex3___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "tut_1_ex3 - Win32 Release"
+# Name "tut_1_ex3 - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\tutorial\Lesson1\exercise1.3.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/tut_1_real.dsp b/trunk/paradiseo-eo/win/tut_1_real.dsp
new file mode 100644
index 000000000..673c66098
--- /dev/null
+++ b/trunk/paradiseo-eo/win/tut_1_real.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="tut_1_real" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=tut_1_real - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_1_real.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_1_real.mak" CFG="tut_1_real - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "tut_1_real - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "tut_1_real - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "tut_1_real - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "tut_1_real - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "tut_1_real___Win32_Debug0"
+# PROP BASE Intermediate_Dir "tut_1_real___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "tut_1_real - Win32 Release"
+# Name "tut_1_real - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\tutorial\Lesson1\FirstRealGA.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/tut_2_bit.dsp b/trunk/paradiseo-eo/win/tut_2_bit.dsp
new file mode 100644
index 000000000..860774bee
--- /dev/null
+++ b/trunk/paradiseo-eo/win/tut_2_bit.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="tut_2_bit" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=tut_2_bit - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_2_bit.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_2_bit.mak" CFG="tut_2_bit - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "tut_2_bit - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "tut_2_bit - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "tut_2_bit - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "tut_2_bit - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "tut_2_bit___Win32_Debug0"
+# PROP BASE Intermediate_Dir "tut_2_bit___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "tut_2_bit - Win32 Release"
+# Name "tut_2_bit - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\tutorial\Lesson2\FirstBitEA.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/tut_2_ex3.dsp b/trunk/paradiseo-eo/win/tut_2_ex3.dsp
new file mode 100644
index 000000000..12a0b59c5
--- /dev/null
+++ b/trunk/paradiseo-eo/win/tut_2_ex3.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="tut_2_ex3" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=tut_2_ex3 - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_2_ex3.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_2_ex3.mak" CFG="tut_2_ex3 - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "tut_2_ex3 - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "tut_2_ex3 - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "tut_2_ex3 - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "tut_2_ex3 - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "tut_2_ex3___Win32_Debug0"
+# PROP BASE Intermediate_Dir "tut_2_ex3___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "tut_2_ex3 - Win32 Release"
+# Name "tut_2_ex3 - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\tutorial\Lesson2\exercise2.3.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/tut_2_real.dsp b/trunk/paradiseo-eo/win/tut_2_real.dsp
new file mode 100644
index 000000000..786b21f0d
--- /dev/null
+++ b/trunk/paradiseo-eo/win/tut_2_real.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="tut_2_real" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=tut_2_real - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_2_real.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_2_real.mak" CFG="tut_2_real - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "tut_2_real - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "tut_2_real - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "tut_2_real - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "tut_2_real - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "tut_2_real___Win32_Debug0"
+# PROP BASE Intermediate_Dir "tut_2_real___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "tut_2_real - Win32 Release"
+# Name "tut_2_real - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\tutorial\Lesson2\FirstRealEA.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/tut_3_bit.dsp b/trunk/paradiseo-eo/win/tut_3_bit.dsp
new file mode 100644
index 000000000..ecbaad1c8
--- /dev/null
+++ b/trunk/paradiseo-eo/win/tut_3_bit.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="tut_3_bit" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=tut_3_bit - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_3_bit.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_3_bit.mak" CFG="tut_3_bit - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "tut_3_bit - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "tut_3_bit - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "tut_3_bit - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "tut_3_bit - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "tut_3_bit___Win32_Debug0"
+# PROP BASE Intermediate_Dir "tut_3_bit___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "tut_3_bit - Win32 Release"
+# Name "tut_3_bit - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\tutorial\Lesson3\SecondBitEA.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/tut_3_ex1.dsp b/trunk/paradiseo-eo/win/tut_3_ex1.dsp
new file mode 100644
index 000000000..e87fc7651
--- /dev/null
+++ b/trunk/paradiseo-eo/win/tut_3_ex1.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="tut_3_ex1" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=tut_3_ex1 - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_3_ex1.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_3_ex1.mak" CFG="tut_3_ex1 - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "tut_3_ex1 - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "tut_3_ex1 - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "tut_3_ex1 - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "tut_3_ex1 - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "tut_3_ex1___Win32_Debug0"
+# PROP BASE Intermediate_Dir "tut_3_ex1___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "tut_3_ex1 - Win32 Release"
+# Name "tut_3_ex1 - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\tutorial\Lesson3\exercise3.1.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/tut_4_bit.dsp b/trunk/paradiseo-eo/win/tut_4_bit.dsp
new file mode 100644
index 000000000..a7653e8eb
--- /dev/null
+++ b/trunk/paradiseo-eo/win/tut_4_bit.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="tut_4_bit" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=tut_4_bit - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_4_bit.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_4_bit.mak" CFG="tut_4_bit - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "tut_4_bit - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "tut_4_bit - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "tut_4_bit - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "tut_4_bit - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "tut_4_bit___Win32_Debug0"
+# PROP BASE Intermediate_Dir "tut_4_bit___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "tut_4_bit - Win32 Release"
+# Name "tut_4_bit - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\tutorial\Lesson4\BitEA.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/tut_4_es.dsp b/trunk/paradiseo-eo/win/tut_4_es.dsp
new file mode 100644
index 000000000..756e08493
--- /dev/null
+++ b/trunk/paradiseo-eo/win/tut_4_es.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="tut_4_es" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=tut_4_es - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_4_es.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_4_es.mak" CFG="tut_4_es - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "tut_4_es - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "tut_4_es - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "tut_4_es - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "tut_4_es - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "tut_4_es___Win32_Debug0"
+# PROP BASE Intermediate_Dir "tut_4_es___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "tut_4_es - Win32 Release"
+# Name "tut_4_es - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\tutorial\Lesson4\ESEA.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/tut_4_real.dsp b/trunk/paradiseo-eo/win/tut_4_real.dsp
new file mode 100644
index 000000000..f544ae8f7
--- /dev/null
+++ b/trunk/paradiseo-eo/win/tut_4_real.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="tut_4_real" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=tut_4_real - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_4_real.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_4_real.mak" CFG="tut_4_real - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "tut_4_real - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "tut_4_real - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "tut_4_real - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 eo_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "tut_4_real - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "tut_4_real___Win32_Debug0"
+# PROP BASE Intermediate_Dir "tut_4_real___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 eo_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "tut_4_real - Win32 Release"
+# Name "tut_4_real - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\tutorial\Lesson4\RealEA.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/tut_N_XXX.tmpl b/trunk/paradiseo-eo/win/tut_N_XXX.tmpl
new file mode 100644
index 000000000..0960e8bb7
--- /dev/null
+++ b/trunk/paradiseo-eo/win/tut_N_XXX.tmpl
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="tut_N_XXX" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=tut_N_XXX - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_N_XXX.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_N_XXX.mak" CFG="tut_N_XXX - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "tut_N_XXX - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "tut_N_XXX - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "tut_N_XXX - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 all_lib.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "tut_N_XXX - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "tut_N_XXX___Win32_Debug0"
+# PROP BASE Intermediate_Dir "tut_N_XXX___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ  /c
+# ADD CPP /nologo /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ  /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 all_libd.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "tut_N_XXX - Win32 Release"
+# Name "tut_N_XXX - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\tutorial\LessonN\SRCXXX.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/tut_para1_full.dsp b/trunk/paradiseo-eo/win/tut_para1_full.dsp
new file mode 100644
index 000000000..f68109e98
--- /dev/null
+++ b/trunk/paradiseo-eo/win/tut_para1_full.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="tut_para1_full" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=tut_para1_full - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_para1_full.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_para1_full.mak" CFG="tut_para1_full - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "tut_para1_full - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "tut_para1_full - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "tut_para1_full - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 all_lib.lib mpich.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "tut_para1_full - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "tut_para1_full___Win32_Debug0"
+# PROP BASE Intermediate_Dir "tut_para1_full___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ  /c
+# ADD CPP /nologo /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ  /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 all_libd.lib mpich.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "tut_para1_full - Win32 Release"
+# Name "tut_para1_full - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\tutorial\ParadisEO\Lesson1\IslandBitEA.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/tut_para1_ring1.dsp b/trunk/paradiseo-eo/win/tut_para1_ring1.dsp
new file mode 100644
index 000000000..cafff2d82
--- /dev/null
+++ b/trunk/paradiseo-eo/win/tut_para1_ring1.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="tut_para1_ring1" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=tut_para1_ring1 - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_para1_ring1.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_para1_ring1.mak" CFG="tut_para1_ring1 - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "tut_para1_ring1 - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "tut_para1_ring1 - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "tut_para1_ring1 - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 all_lib.lib mpich.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "tut_para1_ring1 - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "tut_para1_ring1___Win32_Debug0"
+# PROP BASE Intermediate_Dir "tut_para1_ring1___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ  /c
+# ADD CPP /nologo /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ  /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 all_libd.lib mpich.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "tut_para1_ring1 - Win32 Release"
+# Name "tut_para1_ring1 - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\tutorial\ParadisEO\Lesson1\IslandBitEA1.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/tut_para1_ring2.dsp b/trunk/paradiseo-eo/win/tut_para1_ring2.dsp
new file mode 100644
index 000000000..34edd821b
--- /dev/null
+++ b/trunk/paradiseo-eo/win/tut_para1_ring2.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="tut_para1_ring2" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=tut_para1_ring2 - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_para1_ring2.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_para1_ring2.mak" CFG="tut_para1_ring2 - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "tut_para1_ring2 - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "tut_para1_ring2 - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "tut_para1_ring2 - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 all_lib.lib mpich.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "tut_para1_ring2 - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "tut_para1_ring2___Win32_Debug0"
+# PROP BASE Intermediate_Dir "tut_para1_ring2___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ  /c
+# ADD CPP /nologo /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ  /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 all_libd.lib mpich.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "tut_para1_ring2 - Win32 Release"
+# Name "tut_para1_ring2 - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\tutorial\ParadisEO\Lesson1\IslandBitEA2.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/tut_para2_master.dsp b/trunk/paradiseo-eo/win/tut_para2_master.dsp
new file mode 100644
index 000000000..aa745fb63
--- /dev/null
+++ b/trunk/paradiseo-eo/win/tut_para2_master.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="tut_para2_master" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=tut_para2_master - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_para2_master.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_para2_master.mak" CFG="tut_para2_master - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "tut_para2_master - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "tut_para2_master - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "tut_para2_master - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 all_lib.lib mpich.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "tut_para2_master - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "tut_para2_master___Win32_Debug0"
+# PROP BASE Intermediate_Dir "tut_para2_master___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ  /c
+# ADD CPP /nologo /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ  /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 all_libd.lib mpich.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "tut_para2_master - Win32 Release"
+# Name "tut_para2_master - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\tutorial\ParadisEO\Lesson2\MasterDistEvalBitEA.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/tut_para2_slave.dsp b/trunk/paradiseo-eo/win/tut_para2_slave.dsp
new file mode 100644
index 000000000..1106761fd
--- /dev/null
+++ b/trunk/paradiseo-eo/win/tut_para2_slave.dsp
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="tut_para2_slave" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=tut_para2_slave - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_para2_slave.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_para2_slave.mak" CFG="tut_para2_slave - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "tut_para2_slave - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "tut_para2_slave - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "tut_para2_slave - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 all_lib.lib mpich.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "tut_para2_slave - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "tut_para2_slave___Win32_Debug0"
+# PROP BASE Intermediate_Dir "tut_para2_slave___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ  /c
+# ADD CPP /nologo /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ  /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 all_libd.lib mpich.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "tut_para2_slave - Win32 Release"
+# Name "tut_para2_slave - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\tutorial\ParadisEO\Lesson2\SlaveDistEvalBitEA.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/tut_paraN_XXX.tmpl b/trunk/paradiseo-eo/win/tut_paraN_XXX.tmpl
new file mode 100644
index 000000000..9616115da
--- /dev/null
+++ b/trunk/paradiseo-eo/win/tut_paraN_XXX.tmpl
@@ -0,0 +1,102 @@
+# Microsoft Developer Studio Project File - Name="tut_N_XXX" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=tut_N_XXX - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_N_XXX.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "tut_N_XXX.mak" CFG="tut_N_XXX - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "tut_N_XXX - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "tut_N_XXX - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "tut_N_XXX - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 all_lib.lib mpich.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /libpath:".\lib"
+
+!ELSEIF  "$(CFG)" == "tut_N_XXX - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "tut_N_XXX___Win32_Debug0"
+# PROP BASE Intermediate_Dir "tut_N_XXX___Win32_Debug0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ  /c
+# ADD CPP /nologo /w /W0 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "NO_GNUPLOT" /YX /FD /GZ  /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 all_libd.lib mpich.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /libpath:".\lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "tut_N_XXX - Win32 Release"
+# Name "tut_N_XXX - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE="..\tutorial\ParadisEO\LessonN\SRCXXX.cpp"
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/trunk/paradiseo-eo/win/utils.dsp b/trunk/paradiseo-eo/win/utils.dsp
new file mode 100644
index 000000000..2b23e4c74
--- /dev/null
+++ b/trunk/paradiseo-eo/win/utils.dsp
@@ -0,0 +1,240 @@
+# Microsoft Developer Studio Project File - Name="utils" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Static Library" 0x0104
+
+CFG=utils - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "utils.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "utils.mak" CFG="utils - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "utils - Win32 Release" (based on "Win32 (x86) Static Library")
+!MESSAGE "utils - Win32 Debug" (based on "Win32 (x86) Static Library")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "utils - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_MBCS" /D "_LIB" /YX /FD /c
+# ADD CPP /nologo /MT /w /W0 /GR /GX /O2 /I "..\src" /D "WIN32" /D "NDEBUG" /D "_MBCS" /D "_LIB" /YX /FD /c
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LIB32=link.exe -lib
+# ADD BASE LIB32 /nologo
+# ADD LIB32 /nologo
+
+!ELSEIF  "$(CFG)" == "utils - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "utils___Win32_Debug"
+# PROP BASE Intermediate_Dir "utils___Win32_Debug"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_MBCS" /D "_LIB" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /W3 /Gm /GR /GX /ZI /Od /I "..\src" /D "WIN32" /D "_DEBUG" /D "_MBCS" /D "_LIB" /YX /FD /GZ /c
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LIB32=link.exe -lib
+# ADD BASE LIB32 /nologo
+# ADD LIB32 /nologo /out:"Debug\utilsd.lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "utils - Win32 Release"
+# Name "utils - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE=..\src\utils\eoFileMonitor.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoParser.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoRealBounds.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoRNG.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoState.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoStdoutMonitor.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoUpdater.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\make_help.cpp
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# Begin Source File
+
+SOURCE=..\src\utils\compatibility.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoCheckPoint.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoData.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoDistance.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoFDCStat.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoFileMonitor.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoFileSnapshot.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoGnuplot.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoGnuplot1DMonitor.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoGnuplot1DSnapshot.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoHowMany.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoMOFitnessStat.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoMonitor.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoParam.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoParser.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoPopStat.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoRealBounds.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoRealVectorBounds.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoRndGenerators.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoRNG.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoScalarFitnessStat.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoStat.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoState.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoStdoutMonitor.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoUpdatable.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\eoUpdater.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\pipecom.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\rnd_generators.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\src\utils\selectors.h
+# End Source File
+# End Group
+# End Target
+# End Project

    dJ(!Wl(B-=yABNd6g19bn~8S#oWE%6+wc?Xng8)k
z^f!t9ndx`$9;2dY3Pl
zUyhgoL0fzFR({;U*NY_p{N-A~c_;KQLicYioh4Iz(a_5XTiAN?G2q+s6ZxJ+^fgH9
zF|OfD|NJLaE_`pqnLA>txK04+Mu%AIG+41Q191p9BY98)kfX_
z#Zd8vRwi3gXEgqIo%{d(Uwscg!eYSJ-ufWkiL-db;`KX@*yBTAskG)tESLOp#=Xln
z!pZWP4f#Cjh1@?>X{WE{4|Y-ddoQ=33)9)^BLqYLiDy;te*?QJKlC6xu3J{67nS0?
zg-?I?WM>?#*+Yc~amEil
zfa2yu_?$eQ$FNE~nv3+n`N*oX!8`v1QK#
zZLP`+Ig0UVwNHtcUPO0p%M(~X+ww=k;A1#ni`5^&`gR$(t-;VO;9lo3N>V%?-#e^a
zMJEJ(9ija#{HfN}(Oe`(eY&Rtt#F)Rdv)?F{4v%xW9oocpsj<^AmshgS>Ne0bE_}<
zE*h1&tjO{!cM5pl+$pTbZ*za5A!idWXfy_U`}j8jajtdRq;mmu&g>&k<^X&QKP1|U2D7aYYYCbtN&E-p@j8X
zcYWQzj@QGwab2OBCHf{hpgkTkY_1WkH_Ej0gwKlmjr`CFqKpr6g3x=Q?W(0;!+X$<
z#}W7QClmlI(pHQUfD+BGjzOnd>ykcL}&dya>r(qjHn^>f&YXlg&
zMvUozbol&j@9Vq6d;EU+hr;tt8}t3T`^PzX`{(t%yY&lWyN~EislVN;;Q0VM=b=Ab
z*N`_+m&thW7ge4zd(@+S56VZ(h>%~A4j?~bNL2e4W^7c{r*B4-J9C2C9o|*&f^P)F
zrhsQ7*j&)putD2*@m=KA(J#tEk?-dd`4~a_FBm_Aa`dZ;@1P78Y1gePg)Ek~#OTLs
zKk2=UVS#et_liCuk#>KqCHfFT`S5j2pFyi69mdjp(JJ}C#yQ#JVk<^5cyz`K1Z=Vf
z-nRzeDS#ozgM5y1JnWnFn}zxj3xj87oI`lGf#=P{KcqX3HP`0%Ccl6oOQN4G)FU5<
z_tKva(&1Z_K9`Z-ZCQSQ#mDkwwMV-eJm;BuZ@}k}kA6{y4DHaS8vO}fGR6Q!nm$|b
zyq^Cq+@CV0I-Z{}P4A=b8Pe1}!F&4utbFRAAbsjP>c?rvDL?4$IYw8oKVNF{M%1Uy
zn!$xgqkoidLQdu94arU5qacpYmG_Cux`yDI4aH7h;*i!K4wFq@b1Q{al>XGQu>BwT
z{Z3W+e%}k8X)<-R7yBRi6|~EkWf&*=x59JkNf3O)pckx`ej3X>J*|s_u9I|d+3h@<>|v4{e5t@`b8ZmJZGFFwEOTll@DJ+^zDu3
zj|z{nM+d52)j28j&ZOUr{{CpZGoafIN^ceY;@u5=7Ev|?eJRTGP>y^R`b)oYNdIww
z`r*2d*}~oR-oI?#A^(GZn2oDs)sW%v&JbzpMjABw57=;uU?byGAR7o@NXzN_C8t4t
z_#jXIK{r#qZbJcExgR>56?nG<82lgoxu8B{86!V*FsXZle)0|qF#OboZYKTJA)o&0
zP=C+M^*+~a$oCOHBL8)0x98`2?r|S0K7vdxjOVl)HTWIU&_4@*ccJrn^%T{=_92yz
zJFx3pDNTQCsLxoe26e8=Z#+-+=-;J1?xIdc8vPD_YnJdmf6w-3j5mF(1I}xQw8c3c
zs{HUJ#d{I7PkTx{=N&A{hc9;e_d);ZhY#hPudetH8-(_dPaQqIkM>EpZ`jCWa4m4>w>}{FKI#$x(yt%RGMlW9eB8rOw-x0h#!yG&
zYw?^uE|5?Ee@J(-^^f}0frVW(b=Cm8Zi9Tt6T?5?b~ZmKM?Znf*A!>;SDL=zQI0Yg
zv`0NTq=$9KbG#?)eB*A?<kf~Pub
zlA!ZMNteg<$FpKTK2Li}?_o-Z&SlV;PTEuR-FC!t;3U@^`sB7fMVv7nYQg&ITQmH}
znK$Y1VUPW;51(gFYpt*O&*!Mlj^byEPp(1Qcw>AI6wj7)LX6M
zlQrURlP3?J65~SN5d9%fhdUbbXy6IRbAcD395Q$)BUO`J;Pg8fS$PZdbS_VIKLCZ)(+EmsOaeGO8FZ8l_cYwb8J)v~|ktW}S
zzWN=C_yP2R`?uA_8He%caHd&cvcWm6nm5(x+0P1pY!kXb7oZ%GCeB8He
zkHmS6JelzgkZ16`qx`!6!=IMTsdzl>u}fWtIv6+Z{b=9gJJ>s=UyQM#Ua{c;-jnpw
z@ZZ0i`RPCS${3HT@8@?u_W<8lJvMybBIVJCMe=}e)dK}espBV9ZyY%Dpa@byvG=41R8Dr>tR?-Rbd-@~?=sA+*
z<9;yRySr?#ctva9cDQ=$9n_GzgvEA(QS@W)+p-%=6ZH{reOc7>j3ioKBR4{>+7
z+Hz{EXH!9szZ`8Sz7g<#`w#d$`)ozRyyKUGv{whdp7ava_2)R|TR0p2urgYUhAYtV
zeP~_Qt$q3(!W8>9@FHUNOukmn|6j$zy`v4=D@RP+`PLucQ^dw?e+<*vrlSP^uVdv_
z>z-om%rxEv;}`qJv;j;TEhzb&T;}q&klTh1v5jLz9t>N{QCqNX+|gxmM>eY~^Xtl(
z;+w3EN}Mvx*QUGq`$50lPrsGX{okVVSi0~EFORjc*LM70S>wQ)dNymSU$N`2qFsqL
z;Ja?pS;P3BQa|IP(AH9G17a@;*<7r5@|EDXZW73T?oH(i7_fq
zzgN$vi%yh3UQcPq#dOEGRcGc0E~IABmU7Hb{Kbli0oSKC|zuj}Y^$Jp7~K(ZC1
z-TR;%`dejVlnwhA^1%zy)(G#V4h$e|j==N#UMQO*lzQRuJ0q@
zFUYq+W}0NScE&>UH|`NZx3#YLv4t*W_`7hrA-aG$i~HX2
zXBv7?RdS1b&8^rc=~&`hd7i|1E6zW0?s@Mb_QB>h;?zFK~5P{;Ngn`8Trxu+Z$evj(hA;@>Tm1_sT4WiApFZVF9>7%wFp#KkkXH)SQ?7K0~w%^4_?A|0HMmEcQ#@
z3jv2NQ~ODG_xWX2j&~|J|1bYL(@7^IPm(M%<;xZS0)8|^l;a55E
zr)Xg`478x@aQ3x0{3E3)pRo5~O|&(7jIrk33Hs}2Jbq(3<5ckvwD-087(f4(6ywc#
zhP-uOJh!t5`W<}4rW#ZFg!XurDc16i%~`e-cRBMPWV#&j8b|a{`mbNrX3J{?UDq!Q
zoPTqB=BK!ahi%Dpu}p8lkX5XT}^gqB0wieDM8>42e
zST}SjgWt4qNbz!R(%xcY9A^#tpQZ5u{qs1d%1>)P|6d$x~Y9-NkNeR-Vw
zbO%Q}ggR@3I!`$3b1wy-McF%GmEBE|_DJAUlA{mB`~3ZN)@(grb;%|ebd3MiNBy_D
zpao|dZ;X4l799aGMt+Y*8`$|;ySk$Wp2VFY?*x&KJG#5Nu`gNZqsN^RaU1+y#NcrK
z`poZeQmjUvF~FB>73bVj!OLk5!|$kMNuX72#e0gULwfzA`R-DCl`m~FUg@n`3J%bI
zk@Qf=51`&4$<>qJ(m^+={1Dw2Xk1Y4LeZ8IWjaXvS_=Ktpq;u;#`9OiQRPDXh
z4A5xi)l4TIlCnUIA@6rF?)C0`8>)QXCn0|y-(w=~5qWdur!$kjTW2Ta
zhrfoozp0&h?Epdh$h+e?Wv+lcTN&)Ha&d1%`wirOGl=;`o2vwQzk;<=&;J9`^!s3N
zpvr|W5#F;PpZ6<(o9(3Mq`62B8>Te0-3|LI)BRkV|nOc*xJAvnQmhUNF56BCtoaNn@K0a?c&RfMFiZZ-3ZQ?
z&YQ@-A9D2I8|b$IhD*(CJ%TQ_
z?dQ;VPt1AvMp{RFk$fDZ9POlmBjG=Na~l)nZ~g`#aHI2OfVf-fqV-?e@@73hMRHE*
zDWN>|k(xpeDbw@Q{dwpe4Ii%j5ypd}-SG7u{%OuyO3%+aOYj_j-+4zU?QvO37d)W!
zg@*}}r-t59_=l*chlKY~52=~sJaGI)oxe&i9gq5WPMah2KgHMUpmt}h;_z^X?*L+)
zxWAx0<9gt|vvcHQeBRw$<=*{B(D$FxC!#a5-Pj8HLw4SS%qaATnr_VU>27BAAxbyb
zcvSWw$&1TtK91*Db1kn^xwS-3b+?6cZ0m=Sk2Tu*S3s=Ab^STlF7_F&UDQ8p7M`Pg
zKhdx9k!z{E-wlV-7Q)3y%fBksT{M=5{6RKbDPACw#Tli;bh2+{@~`aHaA!S`}s
z11)%DE}o-bymJGu$T-HRPv7>)_w#L;aSf1u#_$jCf96TGo8n;~s5I^O(eAXbly;d{
z`GxUH&-sxs{0_%GPm0f)_D_>NVZVy~v;3ISSsRD8ULmi|g%4Sw@66oSYPRx4D(CXq
ztmDB-_t?te$qv0gv@OEEN!uOM=UHFRL$4?H;jsUVIBKE4)9Y-NKXh3@&`gh|lk8#-
z^Y*CEgZK2)ewy@p+$Uakmf<^|Q=bR&nsG)~&>r=8>gea({GYy3RM
z&0`Q`_ZfeSblApI9|!F}G)DQ1nS|#L3y(751JaB;ZcucvqNihLCDfnVPW8XEa|z1P
z#uIur)W1Rc7jN&kT0Q@*tHb$#_@3WaS32}?7&i{}7LHRs<6q!C5&wdAv&|~{IF2WI
z!?RExdr9c;b~}jehwW9q{nu+N|Ip?d`HY2z^ljRg^4qlT^YJE|L4M+g
zZbBM+V?8|)LL2m1Hv
zlMa6s{A>q8%03s7pF7V$KVi^aPc{a~iWP(fFY0pp`s>KxZ{{K7)1#
z&E^>dw3KI#bt?DZVN*}PVps#AD@YrAq)8h<`*ct&_9tYO~)<*E`)Ug8Y
z1uq`9q)k-=|K$EbZ}PRR>nj3eeD{gfg7@d^0urSXGIDE!SheN68pK4bh-oavpR
z<83&Cy*tU4_hdWrpN_q}y|oD#zVkY0jU}FE@Nas4eha~{Vc^*m^YQ8m$Oj}ZfOe{4
z^Gb$-J-OLP)(;pi}?-R-0-W#y%p^~c9`1r`;RiujG%eR
zzvD#qFQaZK=JVk1m3G~c&^6FJ<2lcEfT5E~-AknJ--PdxjwNU(bt{qo$u#AMKMRkU
zn=N=i`L6RQokh@$j#>+OH{+?0rmi9IBw|KTPX_rx)2^Pvc646>JiEod2jw}}C^v7Y
z(mcE2?sQ}AeQ`&TblRxH20RM6*M)DQ9@0T0xYmI?)Y(EleHLKNr!!S&_ZtDfi}if@
zVeZ|RU&(z-$$td$&+Wp#Np1oD_|2Y5lRw0qhn!*e+nKL5+|Bi`v9`naAJ;DU9IoAF
zfM2WpRMD66vllD<+$w~U695N-zX`r3;sS-;OUMU;-yjXZ-1b_acEWC*`nJfg=W7si
z@8|l6RgyQD!g_hb?F2Vgf9l(5V}Ief9COKi2k-~sQ2t9>)(hJ`(Fo|Gkw&zuDY|X0
z=W(9q`5AM?IEt9NOM||@ta4B4{Sik(J`Yizw8YN8SxqU{J8cNCenWN?GNV|JT!)ww
zUuOw#$KXt8G@pG!UlTsHQ9kz!;AQCiC46d_0@%13qPHuaayk_ZY=K|KsUoK+GCxB
z%(Yy8n)So}JH-*&zl}8xQ5=B
zw;reTI>Pzz4WDA7(Eb^79C|3HisvbA>BV{#+bEOcn=E8S{BQ?L+aRpj#o+^OJ~023
z$Hsn(bQN9%4;%O)-PYKX039D{YPz``0q1$j5g<>X90BM5kQc
z-04o@dvs0*?(!Ut^Jw@yia694oTmD52gP$T%JX~-80X-KN9}u=&aI$RA&ZW9)V!Al
zJ>oeNW5Dwy#w5n#xRu$@ioMBHr76QkxsY>)52c7t9e4RW&w+kXFAwL8h(jH5rOBIs
z9+5XeIi6dPzPmTy6Mi+*UKMfN!yiuQ*~i{P{v5o^zUQ)j($yR*`YnBN>^Tub+-2zb
z7tK_jdk^-aZ?9AOmtKTPU%H#~gJ(Xf{Lo*%;sd3*_dp++xPkRfeOIGTyCz>nicM~|
zYmc!`X&K|eF?WrY6^yta5icTq;03OP4QAj(_(LEr0Jj(q3Nj7i0@8sCqyu=*Plkh-
z>xd(=!Z4*NA4GoOM%!jkdFSw3Q#uYEK7mF`ah*W&CQHZg;IZwy<}h?8;!s$+Z-
z4hG*8XItvqV$V!x&-pCBh<}H$3FTQ4dt<~dfB$op|MV_E;97Mo@)gGLxnhok{)Mjo
zo+~In*@#}FG~-&M+y@&W4L-;Do|>8i7SUr&IzKM2)SWhPB5;gyLg37nn){^p7W#dceJI^}yx{%63r^O#uJp{UO4p-TCchhueC$ab}I!7t~rtyq;eu2*K
zXw(C)PX0mlpR=`$^t4Gze_?YBT&is%81`eKw;6YQ`|hge5r_AROO@tX4Y(HeRuS*h
z{Z?cX?7KlXiKBQA?KNvjpGyIXR^k&1~4~`HRf5Z#x4tg{QDfidMUPb
zvi%cZq;nqT^1u&OuFoBUj2VplL*7vO&JKbT18OZ~4~S<@=eNJ?J1{p(pACpPU-}uP
zDGNh>$hhj+k|BS08#k06^`pwuUqAB6FaICf-UMFrvHTxDBumb-g+j%#OK3KONir)k
z%rJwj$C)|L%$%I9bIy#h#Dw%EDoWYqh)vukd)i{mi>an6vG-XMAnK^A10=k;CJkba>LH
z0qYLQ>m#4;>V(gN+9Q50(gvP%6!1pi2fqi5eO%N7Yrkq=azA2U@=gf$6YX{}hT4xI
zul4(Tpz+D4pe<@^tXJ;kLLTBV-M5bW&FSokvnJiQi~D0NM|(fgG>+L9{vMy_S4-qHflKHAy+pN+<_&9rZT;#@(?7{Ur2&;uqvUK>9P<
zYhr%M51>El$47TW`Op)QzQ=jS`{J0-xG$4%3FYx74>$_xZO_~Mp#9(7!NadPu9ZBs
zrDbyPJ|Bs-27b1ot>DL=bXmC58t_BBx$S4PjdUgGRQ2VsQxI=H67FQ3l8?GQmV6c9
zJJ&4okJQ(-Z0$lP#XduKMcl9@;6*Ig_1_qS`hK3SZulBJkjAFZ&hXq^bF3hrOR}4N
z@f~(uD;ljMTw>69x-_OAalGYs!10|n8-UvPJo6Ejoc4!(C=Yt_AD-pq>&%y(nC6Ci
z3-wc9j{L74i1Zs~b4L3y%o+C_&UD&7VJ;^d4%h;8=!t;%&bh^R;&ptNzWvD`;5+sx
z_3YT2nseGtfW91U=Mm0mp5@?mzOp;QkZI5+0^dW{-qJEH*2adhHt=SBtOfV)fjvNe
z80)#XCb$+LLqGbHtjo`Aq~|(c4{P9Kh{yN9U+#|r-^0&@+n!?$G}xZ!)&Tine3vZ*
z*8=vU)&l)8U=4Kp8Rc`2H9%Vk*!PJ3yX9rH1N*;WE#S=OTEN_VsDtgVENd;yi!*=z
z-@UwswE(`EbfE6TqrQeUfPKt0uw{$e4i@L$!Z!C43UiM+)|t+^{|M$hKldiz+nnu@
z58h;B!8L&Mah&h%WH-w-F=_ak(EG{K*L-&;mRplOOnO5bIB*A}sg1^i{6jX!^QJSd
zyz^mzW|Q&{hAWd?PUw0utYz8_VJ*KK?UEgK_o+#p8sJjNVu(|*2Kdekbm7D=2=kp6go!^e=cFynE@lwrKo?6LG3IQx(OdXVUGc{=
zS;qzIBOc$Wt3~=`dv(9Zzh-lSIiz364YT{F(gjk6fwzRm{21x5|0tWl-AC%k5I)W6
zKHryXA`Qlewxk#b+Kd8{_R@W3Ka0wTx3gY5i(KY!b7Fh>LdK_iBO&8T@=5M#>_y2b
z&Kbq@nO&{n3+yf8W$i(Px%U8xX92m_0B`d>QGU>Afke9r-yS}XNdZ4Yk|I$Fi)hVf%_=m!MUhA
z6+ts6T*kIy{Zh_?wzJKEe=!~rZGB)LuY-5^QFp_gcncd2vNeQp5&a%@INfdS!kele
zx{_(qJ7}tx^`Xz-xh2Yh4ROets7utkqYOi51?E3wjKXzxRt;OjVegf6v`uxhSc{?!
zsFOuFbh62xxz6&UPE|V8(48i|cj!iKk2&vdW1!zQRi{mXqAc9$M+xX;tO{Psf#
zn@!szfM^?SgaB!ygEd2$DR5-mUr%zS)CSDUcI$ZFTYS&fPTh@R*8M@lz1}9-v01#^
z&{#X5gV7xDoW`1x?uB>t5srIE^0(}F(=kVJA1Uc3-*7rpx>Z=NOqtkoUl4F03b){>0uQvV*ZvSbsqf$yVg
zQ3fX2m)=)?auepS)ndTc@R*KET=x8yU`fl6&Airg4Wbf0CnxKEdC~#5$ra
z70&bUMdm(gutzD+0i=A|`=m0gJ??uCxPkd?O=JHEPuy?-!dR25{)u&0F8Y?kw4cx8
z_v)_uGT!l@(I=2GlRree+Q##nmx;1s-#X4Qe#L2gj&GD}b(TY?)tElp@0PyWV)a{}
z(2udl6AH&zT=krPdR$KK)B3EP?HK3B3}0Jb*ug~JB&#gQlO&t7I^DOQjgx*`88{0=
z*2Va+fnogmzR&HqY)P!%a_H!4@ji@wm;AT*+uzsldi0itwcBZC-5JK11r1!ix*u%<
zz474NfYHa0uU3BaG~@ieQJhP>=LGnd%_A-3R^b;i`C$xyht@8)y>`4LJ8a_Pw}M7`
z&Uh}2FXz?ASpNOo$BVTG`+z>+057~H>P7qGysF4vGroz=vijYYA@Jh(Um>smE_eAp
zvNY0*j{F#=^>a#x?bn&H~`kc$TIWNl7quCO!W1NcLmgLn0HiuL`f
z^9{9o9e)`;nCKe$mAvf%uTy)3eg|z#!cLKXx-f=u2ip3fHx<|p>Tj^8NoU%40`JhK
z1?{1~8I&deF}!;MI+6Z%K^IgFq+AB}+`7m7@kg1yviX3+f$bgM
z;k-oU#qS`Dwe;d$jIVC{qQmXHp6Yy)X#hurPapYdss7f>)xAxEDePH@O1ZaQ?xJ&-SFKfKA^euL%g0l)L!J}i7r!+59;Vf|O2IFF
zMfUlzK5bv7`~2TK5P8uSt$B`}<0`dF{t#+Q{d~1H>09x4b;=T!XYr25oxbonkKeRe
zj{cChZt|PwvBle%98c(HvZs~*JFCZK1|Md<>E0my0-;~GY{0y-_hoxS_Qv0oO-Grz
z-!9XSc*;Zrx5Zs-%j@z2kI(;>4A9!1cyiJr-hcN+XL}51dAvEHcWN@a2jzzhl5>5h
z(}hVFDj#Libv_ihDtu*B!$$`9SEQ}}>?Do_-^K`^C#5erZZCxolhWHaGEI5X9S--u
z*WpF~arjOfVfB>H5VHIzLvK(LPsLj$rSCWntPK9t^R*kk!nkbqLga@$>vs$JyY-%>
zgvp1R-p7)UIQixO&lj1lyswv4{?S)F{NyJIlW(T{RSR+?P=Cg`RWP|^@hq-qTkWRIY*~<$ma~po^+_^`HJxpUbf!qWk2J7nEkFU
z*fyofpK;l5$P7jw!ZhXk)*!45nr;F#-Gz=n^oDfxT|XDB-168-Ov}D}YeW7nJ#n$;
zFZlT2*oFM3_`A}bYu}rGK3SUDt{X-9n1jIo%)89r2g7&Go!*|-Hyo~etHT{1b2xb)
zhX+6Cu-EIAU$D~I|MvLve6N+xf6K#{_}rAP|DcC&n&a^1^Blg=8_@Zz$b_I6h1IuBg!v9lTZ7Wo>gF7olN9v1ZG5g+yMw*gqX+a2Fk@A{#K
ze}9d`KSsR|-{RpXVn4ifCd0K4e#Bwv2#0I$)8NT2n9^g{wjejJcK*a3Ox0r$${O+@*ib@`6*
zhu5<{zvqK6eQq1HJq1XeB=|+j;C258Vco~zeIJCWvjn7k2axwM0C^uH=7D8^24r4a
z)4(JAz7l?eX5gJC%y-D=Ylqvsd;otqfA0MQe`h*R;LcTUM4Z#^*>A`xX+IAdHhd2!
zJ5Bl+1~1s)OBijWyl6$%<9DcWjvw$AGc56tFo$)AYl;!O~K*WHD9W1Ie={yCZD
zwZ0O#YNKlzF5PT6NOUUh6E?gxnZxx*p2GA_`(hp^xEwCw{wcn&O+Gsr;VMhPp|j=f5%u;uW#icZ~BeBw#KE11N`PVLi*tRjh_di
z$&{wD{XC|r@Qx_@60}(@e51+#t?0Dc;54SM-RaHw(KI%cg+Rox{-4$iO4{wX_
z7=usxdC&O6{+i-5+81jfd?Q*P#5YJjV);sI?H2ja$DrqG-A=!-+^~(Y-+K4T#&~2J
z7~f(qxj#POF8brMb%FCmvLVTY&fJ#um;dqw!X&eq_l;;5>J1;cLtFcz{qkzR;;C&cs4r{Shsz1@7n
z2Juf0vE0gPH#5F6>LiEcb+LBiEtBdo+b}-u_s|EsJP2pedi(HujW$yV%QsM7FP7wZ
zA89Gk2N&*|5~slKF=XxukCX2QPSsn%#Hs%iynb8Y4cI?kHH!7RUa&3X^1$=-O9wwb
zAy;?Yy9Lf~lgoqVpRxoHa!lR>hur}2J?xAqXa9KMb@jt=8RRsZJphQYC#?a<`)3%_
zz-KOVUYTiJCILICoLt|}1;@1+eiPmsj*EuN>`-T{(L7F)Zo<~t^8dDW+8SM(?Pb4K
z{-gJAm31QyYxUPV#BcbIr_9l8#&$&<&R*(S03|b~t^)X-wi&k84n{iIj#1BvISDyQ
zg?F8>ws^-$_z^S`^^K6vQ@@Y52&ODSeuQaPfbYCZ1X~-uv%$3$xQ}@Pudeb{g2GNKHPyapbw-CmF0&&`x}fl
zhW?9ZH}nf!I~Y6O3Bnj1d^x`--R~ES=Yl+H{@(#n$2H$%xcYUYDVpd$=*tr{7wZI+
zE`@jYybnp2!f!U;c=J?m(a}~F?ddnV6?ldC1asDEG&}4iXd8-l^4XkE&h1#CljhwL^nrGvkdyPy2g1LxdGYftzaRWu^!dyG7Jte;$Gfj6i~9(W
zXX%Dm8wa6Gtc9e*!~2r)?w;RcN8jT8w)D2fmG2-AcmUp$u(EI=NZ;8I@t&E`I
z{rwi}GsY+MpvfMZw&XY~_B<~72wQ8?fjHN>{xODE8Vv>*w2tE{oNFuI!+1aEVQWm>
z1Kxl%B_MI=hrM3Wl*KZL=L~mX&XlHs?u>726Y%}8Z_VOxMu+~*_J#Zr(nr?@MmGWv
z73JR7?&$GvJMC58`67nP7jNqDQafi*m)ajX@bYsZ3;$I0Zgj|)
z^Kwv?$+mKiZT(}sf3}2Wl;fS^O1wLq-Wk@r!ttIk`?dZ#%u~C=aS6*g%H{y`wQ(1r
z-ean*(C29v+ZbaFB;V`k=YO64s+{pDeq-CB?<|Y!7#WZQsi7(@h
zudO}ztB!M=_Z_fyiHB?qq1VxU6xl}c41+E5E0?ivi5|V=3D#Y{@+S_jd6M7tW^=lu
zFIi&PFI0Y2^K{bd=&sj6V;Nst+2=B&|Dh)fpLL}%h7&Ni;oHjJHbZ|8HoC%bmfJ4b
znyNv5Yr+)p(eLg;SZZ@RuyoM#43~Gb^Bwbl$_Wl1{T5-;pXiOgEvI^X=oH*%rJaQ#
z+aZl;^YaGMVLbQs{Zad|?>`%V;W=BQeqJFz&nx7ko>sbUoQ1N@wn;u*272>F4ix_@&=C
ze9!lP`DCL9u+HxBaP^DlFt&C6
zI_kU;FW(|p?(gwe-sey@omVgM@Gn0Hi1gR48SrY4|J6XiUpTz}>j8fq@Na;6s|a@S
zA%9QrkKg>Tr@N)(@V0J;p_}t}1kj(mPDecI58vml4;Yg5c?KIE#-=`eDVK@rk`CbF$C*&~^e&+~JFWj|)?FH$*g
z4**?HKEU8?#Dj()kk~&)gK20{nfgWf0urOIwr(d_VaWf
zS>2(0K}dh0H1`-JxuI<%@oopL+b~rvaiq$)Toi;qlWiaj5r^XI|;yJ$?R4d$oFa
zuVVp`pKn_k{Ex@$4HCXXj`;m-ed2uF@8|w~f8XP!18rQ<-q6pL_=XhloAf&!F|HkF
zA|1-<9P8=heo=a3M|xBG)+K%uX)%9i+dN=Bo!#%{(AU4k|J%cSZyouhm*P7b_1hRkm47)5Zhky}868{oVs#1W(|yH>|67jkn#nrS#q)
zAkLf>?*;^KmGp-zd%X0BrEhpx`b5e$LElTSxV4QZ^6TBYF|T`iz5#`J>Tm($t*!F5
z`}+57PXt6c(o0fChWEAk?j7P~lRwe-RXOz0S=08GvY~bSLD05dYN5Doo}-}?8E
zWtYEou7^)G`W)r)Eh*Ih?K?gGyMA7jzq`GM!-mP<3PinUZ0hl6e97V23mnQ%iuBIs
zf8OISSQQZEQx9$MzaB5U67nr*f6$HTeLLx^e-`sXz6R;Y2cFzg{+;0olovV&`681%
zTXt;aKYiKjyT1nz?I(?feD@pPKzY17i0~updie3_4#i`Kf8p|zr+fUG>88;$Mt;3q5@KuOIdAaVMqx@_Gm(-K(2<{Hq5$e9h5V#{
z@5<-yKsm@yzlrD@HTK9Oq6NT~7+mf_@!uMS+_xkw`7W%*2ED!JIc()?^iQSL$
z_!)j~R*HV3Wna;4=N0Ogokj1Fo{#T>p+3G*1Ao%8zmVPRkndaRKg5Gn7VqTw7r*FG
zcVguqx@f<##L7WEON?$qf5U#L@)bMRF#pH?!Qt^v|GI4w(uduW%fu1>+OD3CdK{E<
z;%**3@mCIub|PQD+T%~Y$Kf|ifG9_A1b)l*6XyLiJO3~~d@~T=zl)%y`|h^^(Y`Z$
zUsuk2$irt{=1^}6QpSV)wCTls$wu({0i;8`d>3B-D#B>@ulqbd-(y4i8|*v-yzv>2
zzbX2a>|C7QtH|Dk{!dWu?W=kEJ7+r79W&X(g#NIi_qcv<`wRX0qwRZxFL*w_&4lp%
zfA#nW46h;l=bZpi&qHm17zg@VMEI#gJp6R*Bigqi{j>Xe{BsuqBK-XB0dMp8u?2yw
zVma0F+74y^^Wn0G*RXMf+(q_4@*%nI+x}g?BscgV!jR=qmj@Z0?(S{4nWx)$YQP5o
z@qH6NuOttsZu+=?-^}nbWI>z#(BT$udHPTJK5)B0=)$(P^9}9#^g>TZTTz7NCw0uF
z9zSk|L;A|a_o6+M-mIlv6WYJs-kx6e@A4rx;ckx~$?j>Vzx($|hF8%30~}vg4|IG~
z4LM&`_E85ro~U+g=jrvfrtGHpmJ-_AY4ZeFkN)$GFoYLGzl(Pxdu+YnyX>xd&hhel
z{rq#A3-q&ZSC8-C!Xfog$TzT!hleaZ!V8`LSf>3J{Rtuc5?cp=^iu|Sg74Gn*VgcI
zb$9cBuJrIpcR4&|(DQvO((&CtCqun0sLUw8K-e6VsX<_eL
zz0cMO$_xA4s_fSOG}+6$-|3|4gN|pa4=wR{*|j|y{gscxkpER>?-qAmUH^}MzkV9>
zqaUvuoezB^?KV+=*u_aFA%7gQ8?Cjx$$D!meInr30U=YC9i8OSE8BSh9RS~=gN%0-
zONa2PPA|ES2IQl!Sm^j(+-58n+so+wJnZ980kK3
z#a9uc)s(#y#vzYCT8zciA(_
zE~aQVPWy1=4_lY?X7AyC{?+9B_sfgCykk~(DEr7`9iJpS$us?Yt9}1}J>9uO4yk{_
zI$G*@P4`%8KR5;7F(2nG2E;h=y;Y>U;4dEjk?#xX7W|FMjgt?Mn(laC9`o{Zrwer-
zsrHLay_{e40HUACj??xJ>eXAavg`ci4v5G2{@U=FL7P9o8~mKC-SD=D@Sw<92C~tLoi&$%AiS=-+j3LGoG3Wg&NI@bQl@<)wgto#c#^8=@S^4JH4R4};J{x-SFBfh5;E
zeRHpu@;t;-o(Cwoo#b_r%SrC`vx7XJ`C^^!M2p8o>k_+wEi}a}f
zpq&B1$4j0=xedaS(?}je`3uUY{Keo>(%@8>AryMM8)6hjmmiQ*ZFajqk9G9v%#N;pPsg(mn%NGfe%JH@xgi{
zZdrWqqE;_YJ}nmS=r!!m1DESGke-s(U*R#FB&i#^L%)>893#hcB
z?~>BAk9e6^9h)l);}d0-=`Ry~TyrOut@mcV4(y|*zE6x-gKhD}`>@P(S3PXU^;SbI
ze1e%Rh1)3k+_--s&<-IRq74S$=voQoVH{}R3L1!ZG=Q{)0SsRiZZD4Ups!HOZP@5$
zwyda+wnNTS>WyRB1=)HjOMgXr0pr2*UU~}P_lENoVcol(y&A`W+C*&Np
z!`t|s?{3Ierhz8`&+_}vFpb-QVB9`vvMWH^Yyi?W191OqJU;G{r*W1KZR*~Uu4wN`
zT{hMc#{xQC>3~T)qi;o@+oDlLbAHdx6s$Yx%nI}9x+s)G9Tdi91?O>{mcu%w?gsI^
zqXsythy8Hf2f|uovMZ%-1M!KbdePHU29J2k#sMiC2b8bxKkww};!d^G9QaOIFXl)-
zz|;EbW_sCORh!COkuUCGCmMq?RK!zOinCiX&A8X>vPIw!$qeOFTy}zi>s@vQJSG{F
zWJ5etvA%UiQbvO?WhsD^2>^zTncsauIXXkgOB>$BoWy#~Y~wzWz4LU_1g1&vH<9PW
zIvKpv<74m0Rw4OXiTggTyVl;o`k+o&bt3$?pb3Rjq&o_H={{F-^CKFKGEj^!WtxDL
z>7llK*8svHAJ;wo;52lV#I6TR@Y=d
zlYa-=4xsJQrOVF)*8t9S`M}Zsqb?MEr0xrlIurDTI*D8#N$X<#wJzhnmVAiFmRd3<
zqXlFyto0|HV0c9RbsVg70qv%a*~SXKS83mo%|p5;81vxrF-x1r*CuZ%b4+xPFzE-w
zr;hj;?PZ?ll*yp3Sl5m(K-Y@>u}i{j|-*
zdXujiosE<|pv|;d01V#V{Z#;e7j@ax38PKY?Xhj(ov5Qi8_CmP{ltBwBqOJ680&~K
zV8C-;VjoBc1?|IgFV45}@y=V@ci|+?cjeZ|2YPmbr%5;==x?K^l7CP2Q|Fn^sTlLB
zbX=i3$>tljuz`EouGoL_k6~@mS!Tb*bFjT}7Pqu)9dsS`t?Z+9eoI!TJ8Go!u!iqA
z6aCY9jrmx6F2m)I{e=Bawo{^MNDm?%?{WbyX!mrSSK#3jmwNbTOB@D1&|M4JbfkMS
z>p5+oY%M4|!F=w`jW%C(H#!nmCDwU-@!3{5jcVGZWvvS@#MH-{5h_mzd4>7C-4B#?(9Br
z9;fKHl~wpne+5R{gYKmLF6sz*uHXhUkM?-_KCp8OZRLGfw3T&db@{zi
zlXszA^uLNZqCZsN7~U5Fq`zdt^%yt4yXHKWr$<>#Z*lk@c{zr>JLmE4&(Z3^8Fb8v
zfZ$+1xKd**F)jak{+q
z+N(XxdkZ+Po7&dHHlB2go##$3>Rf5PrR4c<`MpEwSZ=?}!=%ZOUpg21uR=NEgJf$@
ze{}1@wtj8TM;m+OlWje1=+W-D-_iQsYfP7HC`bI5bU;O0`O1}^U-wPKCnp`zX8yfsOTXSsk8gX-VS|l4>fQWC!~>s6cO)Bm
z>5h^uytN!??{C*7No&HCKmc{_`?>v6BX)L^@ga-_SGuR!q`
zIuD1g_wpn^5N)-{X&t|F2c3{?+DUU^JifJ|=hJzbbYHu8ylmRVCnsIlE&l!Ne>+@y
zutVv_c!pyfi#F`U&4{PXxcoa_QQd+Ki)I$q9-&xbUyw@Ae{H@FUJk
zA*_2;D}IsnCt7$UogDcX;Ckug)-*m3;jMzd89T|#85_De$t#kM?jiq9o&mU=HsLtm
zcW^mV`E&33_lY6LkZrj9;!&4}`gUF7>Et&;Iz9RyM0v6i-+f(AHXGg+=;mazExtVNwUud$
zje2N{4S1U4$MR`5?iPN~q4-G23MB_B>K4zla~Sz#gMI$79+u8gKEW>hgvZMlsQA-M
zeE*hZn|hkN|knnUrV$p`Bg#DfMLf0}=9uz5y%Wb0hy3zN>(
z*SX$AO1|Ba4mRqQE>^x?$rGdA&-;E)w#-2n53^wonRF%TaJTjL(xw^ZNSE7tr1yt>
zD|E}!>5BJW==-WNOqUySN7*hP@h308sMD3rvTT*9zxbvaPPvr+6_jt-YP!4s$D3`Xy2#=%-j(eg>o*MUG
zD@i9jALSzdy@p3o-XC^#D7ouHZ62mAFup%^h=&_&fe|lT;OB4i@8Lfn$pc5yDTjRO
z{cU=844Yo?D3udfe)8ofTVBb5Wy@QX2g_DhdI#y8Fe`81HudRaEQlr@6)k-S1Sxblr$^g$?FT-n|p_*1Vx>9~*aaM9*gx^CIl>i%=l
zrnaa9?=$)y<34nbmpkNiY?6a7OGh5}tE)#j{;yIF3^_o9EiA$p`}#|^u#yx1%;g^G
z4NuAu;5XihM{@WEn^&~|rXP6w!?*V^9sEc(uy@b$eE0m=p=@Gl3yXP|
zJVQEq*}^^)?S5#9=acR}*}nQYk!)Sx_?M@X4qtD~HQ20zpOo%iwyLW=!+i3~S}Xbf
zO}c&QAL!!@auwR58eHo6n%bb^yY9oU^N6Qg_d18~YZCz7_$OZRba9V9vk`d9;~Q*L
z!FzAE$m2J!I+U%dYy`IU@lUn^vQd@Xv8gR8+Q08?FHg1tvOSfL@uICMZA>w~vN4q{
zfow`8pE|tF%av_G(WW5TiW*&n@?>Lh=1QLLOvjHdkHmM{ilV)=4aIoG+kwe8l)46_
zyYhL@e|4LeOIuImYp_8uThIS^y6`)k^hdJgym>$WE}Mk#?OBt}rfd`VzK69rXQOHU
zH)tyc*%;q=2j3q4)6!jHzL5$3E#z7*zl3})bXNYhC1g2q&QytCu#diX5&PwGLC9)e
zF#7}a`vS8eh2JCk?SpOf^Uor@GXB8x9J&I(RerG%!;GW<6O1GMpIAE3()WGd)2+D^
z(^V$gnGd;8r{l`XGdnU|d%$TJ%4DeTxBQULq~DNB$ZyFR#xGbKA(N&*F0|)(U#s%V
zRcSXK6ld!d&O20pV`n(}a*EZDzVZEWA7l65VlpMj@8riz{w_P;X8N*xveD1bgltUd
zQwa7~^hE@@8s9>}7&rL4#28Omf^u-yJY~EA#)x(|fb@HWwREh}M%HJ@A|IRyh(2xR
zc&~Kp&lz^#N}zYyM!<$PBFr{I{>L_+5x$oYulHND4%lYU!}1e%zVRDqb3@x9gPh{@
zpSK-&oNdQCXWOwJ*mm@RZATx%?;X$NXMcn;VSjwQwcW}+g&zANYdh3W0P<|6xT?Sa1z
z%EOAk(N3-@lXE}dWybiqPcD-opdRvWHn#upFz=6I48k9}m9KAH@3hMVt;YMAfT8oT
zJ|*2;QJ*3`0rf#Bn|A`d&zZav{hzV~ZSb}1Ys2Mx{u}Ed)-Kz`-&TgLFY6!1GW@7D
zk3&C_eh79!@?9@G?Bws@YL;0(c5jE`Mc+Pw;i8ZG>gD4ZUw!D$gh}`OsVx|`w$?)D
z#&*#j8Do(2zvy?5(?#spiA%G5$saJvNWZhW%51;JL3g)1^GW8JeA;~ESjLw|ecR!7
z_c`4COouZ!b-4ea!$TsSWO|ZW$*+QBRDU1k>HiVsNtX2TYaTCI4{f#3X4zLo|Kv+Y
zYpb&Q$;?;Ts?DM9;l{gZl`k8f#CkjPA%|Blb$HjQ4#kr^b~eM+)pv0C3EMxwTcTA(
zdmdr?5b>fdkNK5{^=^P@7ttV_Z_n>~124TNp!Xgx?DFr|`gqoE-_yg%ClTI2_=o9O
zAkTg?*6k;sVpuxN@(J@1hRvS*gZ=4cmf?Q$&{pbN+OSU!LOk$V;XR|8=(DkxvfSiP
zF#LVh;*F--3$s~nOUsTetyi?+H*EY~xPx(}6)Z1s$A%j^{FJZz(zZ^Emi9cr#@27mmzn{5|$Detl!=-k1
z0RLa@{iy!(c!Z&^7VmI}(-GA>*YNlkeB7&l`L*Z!+W;W&$7U}$+|qaw&;#53o8N0Y
zy$J|hcxuJJ|DfdG6TX3MX!!mqQ;vl_74}rs51hh0>CP#2YUm^V#G=i58#KN7`N5Wy
zry(u!FfH1V(xQ(IX|nPR?|B_IH?T(teN%}(VQ_xk{v6`%&WN2^o3@mmu`$M43;A^N
zaltbTw9AV3;5+74J_96|;vH$!%e%d3qxk+QOOSr;mg>%ivvHo!_@l!ceQnA=uC>$m
z;)n5FzkU75C#Ku4+y2Hr4u8Jx7fyP>l|3(Yg8AQm?zyhe=opkAdPA-=`sfBtOTDV6
zl@C{2Psx|K_Entcvh7K}#M3&+pX)kPU}yfi<3+1qxViYdI%NskXMM!H1s%ir;5m%8
z&~Cx{mYvPAS!G-G){E?y*k;UE*daBx)%uF|eb~>HhO>0zFL@oIFS5Clf3xzNfzPY|
z!!)(MoOic*ksh!d^5sg%N3B1y?V;{o_E$ggv%LJ6;V7(|%6kqkvw6Z^BtM>;4Le`jMAt6(!iH9%n+SVuGTFztWEEpfY
z8#zy*`_cVXjzw;*xW6`=bByumL)hlZI@b}Vw^wp+uH^m3{r~;j_sK|msTi+)33=~q
zTR-*=-ZOxncnmxHY#-sA
zf5^^N@Nc9Y!1FMTjS>8nhTgt3>l+AT@A8fz;1BNdu=XqQFxCNmIH6DSH6-6Y#68)5
zuH1MY^NZHk{;uA76XUCo7;S)k6}YGRuJesG-H{HvFqR4~Nb29slv*l5f=@<>-bXfINqw{?4`8VK=
zVc)RVhsA+Uc=+4i@8foHc*bFXp!NP}lWi2?(}rEoAx7Ly!iz=h}S;E2~*wFs7@0&%?4s+;548_qzlTbzbcJe6l_K
z{A!5D-qGAXWq22B{A(96eeJEtWPI)P
zse~;pUxY8yefhifr)M&4YuMH6?daAg?JU4N|J`|o)^~p7>E2sR=)N*BzMH;m@$lg`CP@GD8vwB;(|w`;MHqDS11I_SqWy;O*#|D>_wsrt
z0Aj3VH?gCwJDi`zJI=B%?V0ZBd++xAVUJTj$KsLi2giH-&kcW|++R4JFJEWvLHK%0
zhkbe18-Pf!djc!lTw@NU_x_~wG)WIVYZd0N>@&sF9r(0E@_5Kcy)R&oode+gzTNNN
z>9-kpmhXLI&+6Uvi)}3+e92f(m+sEmc%q!!7CF4r&KH#T))gLp>k)@<|D4e8cmZ#$
z^feF5m(a&2BaF4fHHh!K{TN~3-@SZoRl8pG^k1}jM7lE$_wX6#d%ClYUO~QJuHo>`
z8v&8-p(P&XJLOp0;uY7i{R+IHdlKti>S5ib+^)`iwF$Ev?(gd_-Jkg4FFbv3n}63^
ziPB%l_r*z$&ueEl@|?Ac?A$>8*P1K1hP=x6KI-K?YC!U282g~Rs^`Ty6ZpgZ$pDXRa5BrUZM%!Z&Ie8u
zXQS@FB|3BOt@u6paFSkF=lZ!_{yp@YhO08$RrFQo0qvu0{P3MJ^$#&$Wu-wt$ieUX
z8=-yIIAp(9WvVrSae17TsO2c;_iC9ys+1G*u{^dxzC+}@`CpImoA6RqKE!l3>D`3b
zFYHs?Nilgy>*eP&e>!h;e@o@-T$thKZmDkg5@R5{zkm6@6`xoZ{ullh-lmUA>_G30b8Gi>{!F3DBb?f=7m-v~%wg1-h(H7*}?Y`_c@u;Q8Sub1G5#KEZZjwD%
z*!6I&1rMt`W68Ep@*(MS!rz1Z4Cvi*)~$Ot#2q+S=o10``Hr>C);IXdm;S|emmZ0;
zBT1|cIM!Wq7MMXU)_c<-~-=wNL{dv9dKLaJdfM)IENj!
zH~d`ice)^x%gOxmxYXaCTbcRFVH26%wZj^Z`;=C}hykGTvB9^!Q@K(HQIF*LN6qY5c8DjIr(>J=1~j=qL4`Xb1J5fEPGj?z{@t63j{3>ypdn{j@|_`P@gU2YNmoqW&Bw|il4
zrF*R*$4K}t>;MzbpnGh>N5Vr1&ukX&9AKPe3$M4hWy>yE17#|(agYtJY-@u@_A?i6
zp5ASE1GIA7$&(-7{jVLyJLh_fA>jkv$I!hC(Om~V&V0!Szve(bvFPIpI9IyPxF=Y8tj+W3+zk7a
zVe%l_hhvUrI^UA)y^|gHqbw)sw&b&EBztS>=uzHT&v`!CRdap9r<3fDL-&>Jh;<%p
zG@tn@@?|Wa!;}2HbRS4q6S8+baW_xjU>}M#BA-C?m5Mc?JExLA$(~WVv7(*foMTvS
zRX%iRPYAkz_Jb%-c0AIl%jb=JNs10y`%;$ED4zn32w8hAbni9UeaT0R?6qib1sYvz
zPWDpi{KwluaWA|~|MS3SfeWg-=N-16EiIpFY5n25Y)@<4XG%WbB-`g(6If5eH_!XJ
zb-DxdN}uhhL%zMV_a#4!v$`yMb@|u|9Y;BQX;n7ybE7iG_(ja8?s3n2h3%^x_MXGV
zJ2|}dFo*Qzi}`*02@gLL{DFM!%ExZZdy?a}KF#z=A0m6zgRb@XW1n>xdJ@N*826R$
zX1sJV?!N%>Kb-6FoCm|%7_*Q$XL!!{j%3I!Eo(tO;y5PxxRb4d_U%aTe*WkytS|Ym
zh<8Af5AZu;d?;tdI+c&!`N6N>3h8!DfswYcY$Yy?6sYIruue8U!o=Pb`Y>n~`e
zkU2{R?EQ>y;VaPhE7p7X*tD}v{z#;2@%Jcj?gXy#_YN?}lC?>e{O6rG2Gzbb9S&^c
zP`pR@b&=jpd&b%=IXn9hG{5yhx+0yEwKxMvFMMhm%7-j`$x=XHuVvlqh;`00Jm}Km
zZxAgdU
zlTLaR*9Spo!Z$AQ&d^InuNiIV>%s3%Vjs3FWqfJH*$#DwvbMj6sr$v7u%GNf80k6B
z7}K%7U;X_!#Ou!Co@aQzeIIhj_i~V4cMoa1hV-N}vA!4IiF9qSy{mZolV5VEvzzbH
zApief;PKR_BL7bw_VDGmJN)_f4k;7GyLO~o;eYZr<2{j{@1R0XaEI~82n&bseHWCk
z_fy_k;^mNc1l>mcH0F8@TVDqKjB-{6oARcdme{@Gcr2pte%wOKfd71L&mwR|C
z<9~oBua3<;8Y3
zp!_3jToA8!K$iHprnep`qs9A|Ki?PWa=NQ{d(!WRBcAWVqP!c<@p5mR1?Ft_7p!Jat
z@L=OVu%{1kd|8=yzL&Qk%9Vc@>g$p2$eaE9*Q5S#`FvJRy}{$p+Q1?8$FRdCpM>`n
zX#a`+#T&NCmgK@)kRI)dJM5LK4@MaE6lpfes_(kX%a?zD`t3(QA9cRH^4O>S`(uHl
z9yjJ3-ye58Q+fPc50eK*y>WiIJ_TAQ&S->rM+LZ?
z`t?o2rWdw)e5(`n$wvK*iAWFIgR`#&MEdV<9Iz7*>Hc>vAnbi8XU4evXm5m3{>7&P
zVqC7WaRt1_&$H?;Z}RVV{Kz5gLQpPgi*dnMqdiYA!grMaw9OZ6p5lF6x7UJQ0Bz9t@A>!J)1mx_&vDwk*88T%
zOLsxJLN(sV1*Cjo)0Udxq`R>7w_VtCqg_va6Jc8u
zkQd931?5P#cYcC+^pXA>py!~h%y5JC|qdh_B5xg&Jhb=DpM%#IvgTQZ`OUxl{9a@ne^k~G{@9bSy%ty~{
z_>Qyhqqe4;w<=w4bb#V4KhDY+Ki#RYay+h#??ywc2dH}yA8D!RtOz?nryEDby#}Lc
zmEYHpm$jkC$2sopz65dJF3IIw&*ioonH?hf$hvH;;{J~OiG-a^Df~QY-qRa4yhDQV
z*4~Rf)6#UWzms@Fto`_1?K_%znKpd~z94=#JcHk1M`gc7H}QAa+i<<}t&hB-zG=9;$qlpNHi?{*&!YKBD-J70xaBB^xk$342w(z>?3-
z8uKL|PH|T)+ZP*$-og61Ms}y@ux(kM`;)hK+pT`=75Qf1p4u+A#wOekOum=$8EoZhkAQm!qOT
zEe>dw|Jev(&_=S!dG1wyr=PxG|B&Bw2eGvEnFvE}z;y&Z^UJ^SFyA%J_&>+JZE*()
zWB2m?ET^*4ZcJaP8Q+Pq*w^S&(Cc9{L0_D9
z62rA`-{tVxFA);o-uf^6#+gyPQxm+F*Nry3@f`CczsMbTGaq&9o7{`vSoa;fGfm}(
zXE9to*XqSOe!_KBv{N9@jd^(PF?@p#hw>JbPg);s4jWRxw`O+&r?bp-@8lbIc$u^>
z01d~o{VXaS`8K~1pYhzRBCL7PS%|v$4fb8!msndv-~c2m_vKc-!*etllnY(!KXb7;ENK+vk=K
z`t0~tTJ$=?Ser_tyI?6T_A2EI&;{@KJ1-~h?XnK~%R>8q_b|VCId+bsewK|nYADh<`Gzvu9hM;yvW)=hIfET32}MEVyD
z?_!VhP6O~Z<#NDX;oEJ*cVFaND*29jh~;Fyq4x9ej3oho<52JZN~b4ZOh@nK-{lKQ
zK8oafD7}Yr8Pg5(@gtu+dbi|rhEuV>rvK8ReA>u|jeOP=eb1zKG3`u8{*m6hl#k!<
ze%jL&eZa_vwtT%j)aL2_kG@zkUn_4ie|j%*eDG@HFZ6i%E-Csfk#7>cyU}x?r(c%u
zkdsV)iF4yrqgepubNdG8Nr(CH&^sFP(IKB458vYX_0C-Q*hueT=pBr;cVfB`-@TCU
zisCyJ^XxnZo{`T8y&IN%KR8Y4_Gq9x^^RBa-C+6*-OwJXQEJHk>vxUPd~~ISr>7kMj!4BOctz<`XpEIimqFK06qHZTK2E^6@i9{8l+;
z>lsuu{83>(i>e~wK-X8fG51!E9G{&Cf`T&%lp4a`Xa(zDLQg8HKa~jKGy`jgn
zF>JlVWqy_K{4~Df{EWGiT}ozG0y-mXS6W)u%VZeTli}RZxfZev@wr8N(ZpXC`QHY6
z9q^m~n(Td--c`Q8gm<5axq8ZIY~X46vf|ufO!RgD?QgJe#W&yMJfpv-iG8m*qg)kZ
zrn!?3n;R}pW9KqdTWhOe{(b_O$@7!%AM(3xExLPF``#a!Kl4Li@~DM~1J6zRc0=$9
zpJf{76VZ0^e`wpKFC#u=P}F}}-H>k{yDQUkFS9I5vr0?rzb7$XbEv&hk==^MCUn%Y
z``}&=dMMc+1+U396Z@6FgXXp0ZX@nEMfTzrpMO6^va6Ps>2U`Q>+V6{KTcEHeVw^%
zx7#P;`#-iq7;7qQfRpXq<~Mr(XrB!nFy<0Zr!_~}5#nWIcX*$t7rn3dQ{qlc@?)KJ
zm>aRYa_l?jWgx>`f6(J)n^*rP%S}4KpwV6D2Ye#F;kLhfI^q}Lf8iI}^cf!P;rGf)
z>pLuc3lOxcY|&;rE*7tuWQ>2_$S7R-T!6({-pEBnJwb#9{;qRomkJZGa7xJ
zhpDqbJnvZn%4YE^cBW%5hV5c{D>LZ~oVF7`>i0D5%z|u#dU)`|pZy{0C{f=H*~?x#
zAPj!u-eVoUU_6NB!JUV=uk1d+vF_xrc>62x9c4+!uKSJ+a(>J!d0LZo|AXmup7=S3
zx+R~d4{*%y)gNQJG*2OycO4MMA-%r?8!6cx&{s3owsaJ-iBg;7)Av}zOXx#`KP22;
z3Ld`n2a_M*yKJc>AC^sCgD+aFW%-Pi4_DDN@|~)?fDQN?V?jUYfX~}_qnz;JnQZ2C
z*2_m@j8XETAp1$`C^pX4T*G_JSc|`Xl;yh~4*Is&?W_a751($rl|H6eQ}nH6^A0+Q
z{CX>XgLZoJ6J8E|Ev(s6yJ}~~Te|!m4wow!54i!(&*PY<^s)aslwL@7R2tj3FRr`z
zZtH+CIqs{>r*|2W4QuifdlSB6eQ{l3EMIosF42#oqvTIi_G;%EEeAXhcR59CB)T&2
zzv!1_f2FsV*Z4E@``L&w6WuvvdkE|EoR=KZZ<>uIY{_IZDmvf{!(~{nfpgQ{RpG{<
zxzbxkI_HZ%M0MWlEtRz=u-s%rDPNL$uOnosnQwtb-qz%osWqb$Pe9?0Kg#DSxKw2-VGfnGd8xzWRn`{|t2M8~%-Xg#9
zrHb>?rFE|KJmfF1ey00a$PQ2b8*B2@N56WQudvUQpE>S-^)>c=CC(JxC1$$=*KjR;
z><|o(g`G^b*bv-7}SLbHnFYZgrFM9m-yN>r*@||FS%*
zaOM>4w`uQ+GfI4#Y(@EI2;#rG)XO===u3pK=fm5)eChwsa@kkytfM^s?Drgs
z@6|n?OBZ`Q`5DwleiSflL0Vd7W^XCU?ou?_8!o>|`t9Q0Ts`Ea#8ud%dhc5_oBXp8
z$AgyB+XZ^hkaw#P->~O!fBuPov&~6n5PMB`-pUglC#O3K+FM6`nE8^AgcFx~n0FC?
zvm5Rp;7r#WQIbLEuAuhN^Ht9;I_kwy47=PKYg~Iueg&nYkk4}2vX39*`961t!-jh<
zC`We^MVH0d=IIjP`(O%LXl1_x@G}f&4km$P|4r6}5
z+mPEU;@5-6sOcTu4;{kv=?;VVclo59?KmjCTPxqOT$5OHKYrTt>r9M0j&|lGzIoM^
znMQn^fa_!MVY4
zWO~EkloR+p(N9}W_3&=raLBjBFfV`m6~l>MigB;~xXgH?eOu#Q8Tkc}A7P%^NfwIp
zK5PznW(V!cxu+}yb4UMrc3!X2qPs-8N0sQYJ+ENBdT-9}uFICo|8R$0}@yE5Irp*-5CVyrIu
z7SmR4|EtH-78CsnUy5#nh%jyatW50ZU;G9T`{2JW!?C#1^~M)KeoFg-wecHsU+hz>
zo%KosJLCh-Wtd|d^d{G2(Z(!jD7~$h@Qi5Gz!RcTMWc!LrtQ!Jj;~vVTZJ=;<3Jba
zy$hBJd6jSuaSO&tI7M;_;S}+5aSo?7$32g|FS(QUvfkEKcHKD3Q*CH&*t@76eP7$5zydbF?92hOW_
z?%T{hvb`3@>1!l3w%_PJ;*2jNV4wZoEA=Vx6#JY2W#i?`0Z_O4c)q}_4E#{
z=r8dWqGJN5Q)U@&C&~wIWu0eP{;)R^Mf=4XJoUaFZn6DPRtL?4gT{PW6W8RS8
za=hb=X8g>d)IYtCF)R&z=Ggwn7=({1u8+305Qn*?e9>@A{yWwOedBmO_ls;}Xa1f|
z9tznN<)GkeUJ2S`^VJw%+I%}e&^DBNf>xn?6Jg3Xv0uYaL-OfF`6S}mHsB`S83v@B
z5PPMdw|9FK*`b(?v&rkQhbWf=er=G)A>7~>)p$6RNm-%t022QKCLe15U!?(l9p;~-
zSsccP;{^E|?*ssH9AHnAvt!BT59b@tFFQv}Kl2kn=TH52KHknwrCAfdac0HYo_MC%
z!^N{c$@r2C-|l^Fj52Vpw7=^xd?H&N!ig;{pUL=Ly*C&4&=Zc3Y*6w7;R@OqU_7J;
z(;aI1IDp=gZO3<>EePwKD#<~}S7JR$-XL0+I()>_4i4w5Xk7LkzSQrwvmW0i{|>*Y
znH=2ui*sFm+jPDV4`aQGX5}3eg!OI>-jaRcEp6A9Qa=JhASt1kUuagB@@06FzqAJKD-N8;%0a67S7P
z{#X&;PTNn6fAG_`cFPx=Tnl>S{hS82wOiW!X~a35S-!)0?&@Td!F&LJIAa&QLs+}V
z&KQp?Z|=CSw&`72+^R-ffmYh=C8j5?-F^{&SEl|ZOSi~rfbucc1~0F)=^Xy9bh?a#
zZQaxOZP1EO4**(Ufj`zXz5(r@b#aQTe0Y2QuJujiH%nK&x!cpd>b>vx%u{Rs0>4?h(#O1gm3HT^S>C%>dwKt`
z`lHR`KFZ(a6;4liTc6#Ban=4av$(5&&fk^t*Z7TXIn~NW`_6JYgmHJi=;_{eJY;dD
zFK@^^m0MrqH;XG@Q(;`Sc3z6B?)*K*)%I*naiu9f*R}f(;Wy@8=X3mBy~1g4TPM}e
z+!J}QW)4+7_0N_EEkpR_AL@Pkbno5UHLq`=XU~Nloiq9;Oc)l`GPk>9
zaIoIjzNou>p{H&C5)!xf^|O$TI!3ivrYZIA-4_mZ40ZMOPM9!vL0{iseITE=v)qGlkFzbnhY?3;9VgR?nIPBfu*)dcfXq#-Kots&W{zCt*8e-P6-VPrz
zO;+QecZ{{ld>(i0?HaNf&jnK}mAeaRqM2i2q*8{R>%H{>%t|&4$~9kK3hm9$^$u+o
zYTGfoJiFf0-;E(?*7sO;s480kUh>}4+6Ov%I}x9%oG`&-ViFg&&udqjERlCO%_$dZ%`G^>p+
zKCJFkKo7pM1gpQRr`|aW+qFKcgI%B3H842TK7{D3087(8Xo=bfEmgGNRuJ>=-iO7}
zhjD8R7YgX{RMGZPEwkJEyXGF+jWQQ@4WZlf>qD%gWe{DSi#7m*c>+)28S6G`vlb34
z>RMEv*xNa!3pp3`9cF#P?^NZWr)bBTXz%Qb0qgg?a}0fcVFo&~L)$dN3|qGC(brjD
zo)tK_keS;Tx2J{BvU|N}4mK=WH8jxGJAcB2egMp5))vNl^N$!auAQwIn%Rd`@3(I;
z4gHp;fT%h~=W7IV8LZDnf2P#?hZblf&l(yYpKDI;6lw3YeC@g2Jt|*(-`oYW`>>>e
zfqRFv$YQZK*(8HQ$k0BNa-_wZU-#&MmhCJ{pH<*{AlJ}BX}$qCkhTbBPv3hQkjLmP
z+xA+nxxVi3vp+9vw3o`i`=u5`+96~_~OsC8HGjq
zan{ONJ5SuV4{LR=I0X%YX8U0K{PvFa!z@|*K$b2>i`%Ae0BF@JpVTpk
z#^R71n%vRdoz=?(Y;OA;B#9>E7j+lTm-^Hx6AfL>QXngUG41vC&i0O!Ijz?P9k#`b
z>(pZdKQmKqRCk^@8zVnxv=wX2g|kZ8@gb#4^=5Ok^F$o7PM2XM`MZ!C=UyWzhIBi$
zO`S1&`Su1z-dm1Asefr9rl+f;+bZnn@9)kIlfm?@P#Mpr)YIj!*w3`au6xf6qw?z>
z3k|_$-SsTJjLq6?$ETfp9AqYGI0YSdw5PMr$kjBhOg?R(uLnyszxlnUdH7(fa%e%W
zwn<&RF(W8B-!{+*y+&W8@fqO4tO~f#zJ~(%vtKS%b0+BpY+0ot69I&R1o-n~S_5Z23MA+B+_Uc>MT^|~%bCwI6
zcp$#{L^t2dd)evU*WI~SeXyP*?go12r-@2CmT6IC@BFklQo2s#QkVcc9&^^QczBwQ
z(PJ_s!nE&SF$%1AE}UE6y*@A>NY;KDJ!){qym^C0ljK^$`1T%43ruT?yaxl@q@|WC
zE^A#bpH{$L^^R_zkUjb)^)2k}9GozrYjD?I|DDU)(cQj?+);aPU;7-U)P(0wq2|T0
zu>6pt(veDQT9{f^q|F9$1vRv3dz+%vHDwYdAd9l9aWUra)4mQ%);RKo?&b?>y7Yz@kzcwUy@w`p&FF%?@)22|
zJT{N>jXKCsIRy*B^{^1g85qnLVX}uDcaH)Lxi<QYezzk&~G@(AN+821R#t`?
z8y2lfS@R=^c37#2ZfztZEf;CtLgPh|SynI>Af@V{cF>d5W#*h4pFr*;Ix8wvuIN7t
zY!Dze7GT7hh9b{d&%}8-)B!qa!i1x(ClSguBVqz&7@nTl*S`>wD-(o(J~%YjW_^gn
zcDCda=K@*zg)F({h@8{=`ue95oine3`P}W@NYh?NqSV5)uu#HqT-cut!*J2k_3%7mx-dytT^R=|C|~Lt8&t=)2Beb
zFwix}h~{39@3Xp&$f$z;_Bric5LOfm#?wN8!QB$^%*AjJ@XKcpq}{dt*(K;EvAkDwfFF=7QltK^+;D)1Rx3C>EdVLw%6e
zLiB^l>i{wc{)(Gs@7#i6N)y_e^e57at@6>SkMicVaVSS9H{Sy!dA|Z1rU_|N%e0Ah
zC>9o6UQAZTZgLdrAPuMYb#&%faEwPskHrJa*av3x9ZS%TGs
zO_9%nIq@$Ib=j)UojJmcM~oiVp4$YN{@ptkzpvcQrrpl&o(6?i$FM>SnNNc%p{eRY
zg%~n#pNCY@*4(=HrVK~wku~4B-ukqzc|$pIp=*?~K|zz}S&Cw#4a3ct^F^?5BMJ@r
z_?fk3Q@qE_A=9UYYNg(n52spt+xv%H#gnRDTlM)+
za`tDU`7H62Sw^h&&Trp!*DN^%mUdcMbUTiWuHq~x6Ij5*fIc`=I65*3Qg2p*cd65e
z$vvjnaoQ-gwPTL*u!h=AnA=2bYjcCA!!QA9F6U4)IgVA8%hojr3`s^XC%nO7IV`J@e8`Fa
zA*Uz`YAh4}8l)7)WH)3QNjB0X^Y{!wp$IY4MdsWx&MAnhSf?^H5k(Bk6U}@-K?L&*
zmqRqk>3n0uGz^zM7^#O|<+h^hK6BS#vpF1I#I~##h_7hJ0qcNl
z@pknh#Rvu*dD_6xA+0e;8RxMn6jFwH-7q6oex_AqJ}7F8eVg8>&huRHEp&a_$(C(e
z*W!Ao=UHwJf@RLLjKc~91!`PS-v9}zrr4~jHzjJY1<8>JyYwCAijCr)fZjW=(AXwh
z(kV;5FMg&KQ^;fpu%HGlMC5V~SA^2&XXoC9{oQ>-qo>U3?dTs|&_`pEVUekv`H|et
zo5K{BE2vpwb#~hHc{}xtk)#k&Cg-6{TQr3jyIsS>XcWTm@%IuA
zZKti3i4F7AmQ%Xk6PCkvWF2P*B5$tp+yJ5hP+sJl(1gaJ&)GtZ#T!*VGxyL++?HCr(Hc>aQ)i@Zq|{(f3IhlZ4~8HRvS-}r@O=lC&l44xS?^Pb2`1zG!PrcgU??W5
zTJixbGJf~5B+f7aLxwe*jihBBwm4Hq2Vry5+u1SDNj5&Ka?nf-_@O;x-2HPKW^m9A
zY#P$jz{ZEhQfM%2p1|o)(w0vz-aKQ3H}W18au&;4Mj0erqITf$*&Pcf)rT^nLVeK3
zUwZKzIhJK=GJB2LK+ssTcJA(*)6pFQ5D2OAO`FeexxrKKa+#JJt)bP!%F8zJ)IqYi
zKF}^4HIdo8_Kwbu{*1UnA#;rt&JB1cw_`qgvlTQvU!I_wI#X5&Q)l*fbY=EDuz_x{
zK{#x5%hVYZB8K47hYKcIzM*V@EP{fF@;ewl*X-G9w%N61CX2G_8wO
zvfP`?R4|r-W#l?v9|~eln2ent7MpdxK9q<%A-8<*>qD7EY(cK1C9iIQ5AH;1%Qm=0
zck{*i3Sa)7H`d|n+lPS#V-j&T4i0tAoz*d=K?v7i;EASYDPc(tB4M~dE@!=iCdWOD
zW(2Bryx~fQZNkZYi>OS%Nw&xb+$N4%Fc%LE$Jh
z1S-|EBj7xpm-N{f#!Q}^<;W@ul-NM*r`(NolIEM-*WC@CydD}iEz$q8;rrYu2d4OL
z0pGB4t#b?Na}TA`7F!nfxtUxUn$)?6x+%L)1nr(D*Sou+EgujD#G=Bn)7716XXZwV
z_Id-}95CS)8OP;bzvLmcUMKbSb=%#ZW@~B=zGZiOY(a?tvRw5JGx;pYp)3nN6b1X~
zY{3ei(Vr+@sIKx6X`R_Zh5~C|o(4W*%vh?gkU`TnVS?)s@)}~x+AtX#!QeDs{mzSL
z@McF79c40SguT*AjNF)-C_pq_F<3e%Mj>u*&$|BvmhN3jv|^!L+7@zZn=-
zp|Q8^Ft==<-@yVIW&~oI6g$7;(@bK!r3ER*c!uFq)xrrD7^VT`gTU^cn|4s+?zHr{h8K8}sSy-1Y+8pk2_#fTautcQ_x)^D6fV&<
zsbw^Kg6n3Dm)RO89E*i)Jvvx7rEQaP#&DvWU0cgzK5J4#S=r^aCS{HuV?91Nt3<(iZ;YI_qk8um9kE7-euRs@HyeZySa8Dp0&7B%o9)`8spqGpwi
zw-s4n^;lu!6`^KXx3?K@%FD8VBInw)2)3R4tE-#}Gs!R1IW@~Y-o*31qJ!e`ij5r>
zZPP5@SnIPXyNBOWVFCPN(^R;M(&Pl&&c?v6R-_9Z3+fQLVCV{r&{agqsvM2KJO@e{J_M8t!p4&O(%uzrE3<
zuu%t|pa_-PZOVRb>TB@(B~9
zV_)8~MsIKIde%DEd^ySldAf|oAZvj=M~o}!nqs0+<3`lhr8_MuV8rfklbW2@qK`C~
zBNj6bL{N-k?h-?$YFlPI#Bt0!=kK6ZtXs=sonvjw09lP6#+Mk$Kx~QXGhC5zp1p(`0H!kFv#^mZ@S%eL%x1bwtV^ZFED^NKRYDVv~@_kL<>>!_ZO^ktVsOIUPZE9&PVw
z&xUspL|!q6%@3(up2*%JKY9yYMuVJsFl6h86yzto>mK>I96!#^YGlhF7i0&p
ze(>e}bC2W9Sf#mBqVd|*vWghXJ&z*rKMe44mTk+*J!ZTuD`d@%2@?q0J;7yV9X;N*
zyh%hUs~8Qg((?dcEu!0=xY%`=RUQR2X9UKEwaN_R=PfZMVZ|EoW#_Rup*d5I%}d6MIcx}s=cZX&S(!8$
z0#bm(Y(3m;BQw2VA+*>CGmmEVaeY`(GKnbiHEvO1BATWLr5`HVdTz4noC2#4(mrfi
zN8o|2-=rtZ3?U}eM>cP@P;5QQmzutbApr(3Y3$K(4kk48O^JQ3a#`xn9D@2CMT4d?
z876|(k?d4%B7x$(8AS)R_)upZY6)gB6*@xA+TEbyPRSE)Gi|}h*`TP3@|ofPG54mu
zbskBYsD27B49tf+H5igwO?VoxW!YVra>=k<-Sds0#3PAgZq3C@eVE^VpC^`#$jo@p
zc`3OE7hTmQz9%DckBp4v$;l8Q4cY1uW{0vE+$c`OB9r@~hVY-{D7uoNT+si>mh0G6yMf#wFZTy=q)JdCz%0
z<05L|>D`~~j0dJy3uym&+>etRx9^DfD$3Dgxc!ZxfGZ&uWv=`m7!92;t#Y8C%o!rS8skQ&UN{T$Oq@UOA{3rC%`ahGZv=AO)4|7m0}!0=@@
z>lcw!F%9`=Ve?@P3ie(?e47EUNQ#zX6BMKxtk3Yj85vpb$sd`oR{dHvr-SMc3Hoz;3(6T{i4&sc=kRoTPMSwl+IAJc_Vu@tg*K;AT>-KvX`h(M{)UJKex5p{3a(
z*yR<=uglZK=&>=*_Zvkl%y|(#tvZ){I|((Ul!Ek)5<&jvPgXn$UR*pr38qis>XbCb
z+nKd`(5Vd2S1dqYVMcVmzJ19Q?i&R}TE#yP80{^!hzb{=b-7VKN)q{Ug~0qv06IbW
zT>|Ax>I|B%As-p`&TEIF(jH=pO5;d^7XxBYG`a!tMFkB{?^E#j3N}bh!M@=g
zGO7(gzcz(!p9MHylrI4J^ha*YgvmEiU||bbpH#yMEX+eUCl}YawKyIwMq&u)?donR*Wmp9}{Xzuhpv*qOJ=CT%g#ZMCVHviM}So+LN3g
zr-8L_4LTpitCQTgYp83KG0$lwAV9zjqE28Hf^qM&k@=(viyYfEufLyNOCz>n^zq8)
ztjz-!JIFFx;T|$ZR*g+q-hvLq=OIU!juO7`WPt?)e2p!j6izSd)jql%s;u)fi=EF_(&y9Vgv!q6xz+@Hd|ta^N_$zrnL
zr5pTU$W(LsUBnW@0F6h7Ca1V*{hXQDK`BAjDsRKjb#LFGo#_SN^Xfvw)3#f=_-qry
zy&I5yTyF7K^m+vF<2Czo^MRm#t>&-xb}u5M2_j#Ue|JnjQ^t;tB-|4bs4o{@4@($-
z#|QX7$>wgE_3YK>!u^G%(;{@*cw`?EYQoRhM-NaWLC+y@)90ffFr^n~|HPd@tz&hk
zkLAW8#S95RN6$BfMD;}*2?eMHnmqa2pN;V6RV!mif7-h8)dqh6Q&5}~77^t$KH&J3
z3w{aHFR7TY7=-CzI$EJr&z6g%V06?ah*iZQomyak|2zojugykByJR(C{rGPN3)C>f
z9G8hpV4HUmbjAmm4sw-S3>On=vRnMMkI5V_DMGpm^=~#>)U?mLR_BX%hAJa%abLF~
z%2eA1c;=u%tW#DVS7{n){JsSK$K!y4yv2edPyOs}w}gbIMES0fBa9)9{Q_o|Z>X?-
zMf8Z0_F0L-Alv2Htb`7j`h$9B^uM%t8ou9;8mL{|2p<9hIBnMf&`(3?4KWaR)*bkN
zXv83f#mR;+Ru8rfFstHY?s3!EyMg^9esgf9Mba?>_3g7jdt}k;Ouqa@5P1WMM2=
zm6COt+jDK_p0t`ZQuqi?VeWu5MP!Hk`ZzN)FOOMldwF4z|skDA(CbQUDWR&Es
z@ez!N&jJSoy2#I0cPHn{koK}}T3WQIt^gPh{bUA#2NmSO>j|((4ZXl{00rmIJ~c9l
zC>}rnX@IwKw9zguZKtKF)@N!4|I>JG3;YrzT2$U433m3gl*rqP=s>Y(xr$%r#y2$n^zEGM!!2anC9>zL~rv;lvP@Z(xGk(EQYD
zQXu)^q@BK|$`?TWV%>TofoJ%)-Xg(3(h{(a0@N?mJkrGqEOZM=Nq9G-PFfOzXjp4J
z>&OIF;U>UV9cXb^UgbR0K*zE@IYn{r>HPEhWUgDHJztXK`6qqUa
z0F8>$OE7(mtiTwy9FAfev2(bJXFRn-1?aN}>~NwPG@tnG_2laU*{A27^$e`=__!_O
z9Gou6(*f8HFn2#wTj-w$YEJ8>GVlnS2%}b$UkqAn6VsUVEl3f63lM#YgF^VNg5EPV
zF77!q`W}y^3Vn}Qj8W+V_+H#H<$Bi2izFOW17hZt89q?rm_wdd1}#4*UQKKZ+!8A)$gsaO3yd=Zz
zfwNEPbo5f|bEPh~aHqlLl+h+qu)C!3O7kJxC^*v~n6h&Q+-T4(0_@4o{N_9H;e8X)
z{BI3mFOPRh3v4Z)K=#n0oM80T9{*aSeioTWK2%>f@Vo}J7Y%5?jlgjeM<~D^*E;BC
zA_dp8w-p5G4}g5KiD8|cQ6_k?!wGu!?pBz`pG8^95hPwP(nJcUzl+k2xcBi
z&oEIxVzX~S+T#cu9w?F>@%AA7&!uVw(BmgHzs((!5*Vb7c1#KIHxr*1O1mI8=R6Wo
zm8yMrul;1DB3umnU?+?s7-^9Y}kEGy!EOw5ImLd2`np={X!dA|96R
z+{44C^vu)=X-RRLm_?LP!Sp~-)28Goyy_rF6qk`0T!kw$sJf)9g5my`0zSuVZp3Nf
zS&tNqKk&cMO$@Fob1$o7=+!E
zC%jt904I2*(J}7Rwb+!$veC!}PBsgDcrcSgXgS)JST>!TaAz|PEHn+=32W6;>K
z5cxWa-Y`ttVf3DI#deB2djRIs0lwyeUQ$!^msE5{BNvW0J|r
zx6<>1(gQ*xMBN%8g@>o4#}1(D`=XL5z>ScUz{ojfjMzsn28qgD{K#8xJMlMg3IXI%Ks;
z@HcbmF6t+OwFqkb$K?HVdY!efv!d~b&$*C69kSkEY1~!!fsv+2s&SHN(_BW_drk>L
zi)f%dhOI+t2lc#m_eJtp+)X?ODtB>ES-=h9_B`UJxMa83ABn)x&>haSQO^`yC<1YX
zg`(T=Ly5E}3!jpx!`mAN=EF|xJ;8zd?yJ4_uJzu3A$k=&z`FqX1ORLbx9DZNhDw-k
zyBgy!xp(`3g>G(?0gZvBP(PHcNZ-C1d8!u)j(7E)gYQz);!(HVrm1q}Fax0m4!)VD
zt1dm^{l~5?Dy+>wI~GPUca#eNUq5tlPA{SFap=tPjepU|Q)2J66*ah(m88i=*+a!H
zkPD5G%GJj`+7nC}D^gg&?6ZYP9%&vu05`8g%j4@h$B2GBzWwdwdOLI;
zod(|%Gj9*Wr~ph07<$b{|NjdpJ+90eL+^((b7^8e0mIk%D!P={FW^r}o%%X3^SE&z
z2BK$tBvu*&S$f)bW9hwgb+z+as?|XqT$1jWk@R5Dmp_}61tCcHcn~KN#;&Qkh|!ku
zo0At;EVvs_-jlMb(7C?boyj6UFtDcdwb&qYzlpV2$*HhxC8f|YGTv;=CZYNzjNY7s
z@muSpR}bAnP2|RitHOxr%W~+v#4CTE*mY~gScVTXqv(y1VOtRM&?2k|dvKI!aGRS=
zj)u4w`6jn}tun>FX5+aJeYT(r0s1WE1|+;Bsyk8^bCm%pZr05dIy^9QG@;^i8$fAO
zW;_54@owJ*6EFf$p5F}?f^A1<7Q_}^l{OeDgG0FB!p8TI%cVu~k9lf=5~KW(yh~55zP(ot;K#2d|Istp#*EiAX3MGd((98kosDWBVY*
z>;CK+22tmGSXpb>$Diqz23jHr-Ri)!yh`YHd$s4su~%1)qn$
zevhY><$t1$4L^@N2){L7TOA;i9&b)zJ86x>vd>HTxGXjmrENm1OHyA-`rfWl@ZgTR
z#4A6z&Yf@Wphx{CudNkqleQ-mrcbvfM+>OYCm-x;>6zWMzGjt=7@A`?6FPv=hymIs
zPO6{%vxsYuCrw)4=q5Aw?1<2o(}(Hv8-2Z_=Wh+qJTHyqH&_
zZ!tNkue#}Nu##rSeuk-fnqG34hKaknr|X=v-LQ7ch9~
zJ|op8cgCEdxxl2=J;C6)394`RA`ITJV#Y{=qa(lA^~1;-XJ)Kn
zC0}1&*>zMmZBB$on?l-RQZkQHjLa+^Ycu!Ihm3<4ji2G~Qk~+Bw~LU=?=1DqTYn9c
zV3T_0!f*Bs$pLO43HIw4Zw*|h)>B$-ON~yP8Q=?tL=zjGk$1I-7fx;h7G4kn*$t}-
z3^(QcwT)dDWuQutwToIL2^&BjFD59C7ddGn?>LBlJM>ES0OpK5+zQTNNoYi@JVG0!
zLpCf{x6>hVdkB#59oDl@PmgsVow7gTagx>OcxbXmOJMMR|9Ap)RXp(6YV;qinvAHL
z2w@s%e=XC-ib3Ic?yy*=*BGi@NO{u4&U64OZ6=}ec*39>sE4#mr~X(^4$~b`%H`mV
zxwwD>D?h0B1wY;+hlmND00L}(6~OitGM>cR{|FeoQd7Bhd^|lr0`||b@$js1M#BYm
z@%ux*`3T^@cPB^#vB%;CYB;Ewfw@HILzE^g5b>%EgzEwv?~4;29SmeKXVdD;vg
zByFPPBF3Er9SDF@9uyScif^}(jkkrZjN(G252?su?7+(IZ?S#8iaQJDgH1Lco6TiX
zj4%S24`_;xq?aG>Oyj17AeBx|-Chjn5a~<<(z|_kb9UXI7vUSpC#F;?Gut~<&{)Ub
zlkJ+p^rS7Fyn~R$AqMdATZc#c=fQKq2<;H`O2QVcWFtZim!}RSc{;N~pguWHCrlrt
z6vLi04cIh@iayxzu;!#Sdk%%iUEC(!X(%_PSs{P4M#`*VMH@}-#e|s0@PMw8_h;`R
z94GT48YO{KItq)Rd7ag^f0%6^>IcE+K|lD|-9;=Y3zyBYwKOtl=ydqbmdJ;W2C2$W
ziG*n5V^y{}py$%QB@J;rv#rFaCCVNRh`e&80ObzQ4%bOWgGyJ)2%4v#7hv&xVKs2P
zhKd(`V*nB)Ffi9D6ujWT!#LS-I|e+DA@?KKN#2rcvbXt+GOUM%z}PDF?gbWJs{jRa
zDxZGe`vJ3&5%2W#CnMZ#u1aXTaZX|AHb6SR{tVdJ&IcD2To>flvHFZR&UU+y2>W5n
zBhCWoc!)LOlb;I;F>)xa45N(Vn!z)u3!oeCs?d;UqXcDOM^)d?D_UxQAjN+y(
zNr3-$#t7<09YJaTC@2}d141_;jP>+aWNVfeUhYpvW^G%tHn35Ju_5WxY~NN}L(Rgv
zmM_iNXFr_$-kIM>J6)S|cm-ZA`HMbll*c
zbYD6Qp*vr*Ln9>LfWCKKe-gmZago+I)7*rC5(1+sF9uGBK!_XWV)B3NQ)A%Rbn>IE
z{m|;IG)=D)1ueP5f@d_d#ZZ~mOCy}~x8So4)K2LHi%#usM@PR5l)q?vUbehZxlNQ^
z8yLMMA8Iz8^(_zKpMYtnO)_LWYZRN)h3aXzcZF+b2z4E_9fJ&)M|Fg_lS3rMcZh`P
zPGQ`qhjpYw2@twK0X;ptxx~FW25^R`E2z->#AO??HM2bmPxEh%Ko{|kZSR4U+L_7?<-YKok+&_7l%<
zR+s;7bvAmQ;kE(VcRtkFoD_0(K~%jtyzS)L;IngQzRf}Uv36}5m;aRe|)2z
zUxkQrcL4{fNyJZ9cy9^lKKnvT
zdq+siWQXvqfL6MLyF(?nh_SgmJ-IoRu*%gJ97!=y!s7_IgtX~X3yzL{KDqzfyK}J!
z#h{k(b@G;pj+@u!+V`m1Oh@n&P6^5*=(kQWxtW>|ih@oEeN2
zxvl~NkJgES5`yUG?Nm9+@m0>Kco+(v)}7$*9!AcyByz&5Q5sS36yQ$ou*bC9Um-EC
z#p?!+9VVW;c}odCbvG2L5%KbbR?r2d*1KUz*cy?Xf?Wj3)%nh3)C}lOz~(f)uWhIv
z9gk?HQ_4zRRxH#Lj)PdU;!IhF!)slY#}R1bhtBr;az?!)x|fxa6IP{;zLB8oIj^tJ
z2gpMqZ-ow-{q41cx2vIHQ7
zSuqoLXod)JH1#3ujp)bpH9D~kH%}-dWb$WtU*19To8x+T-f;+utc+2jMW8Xk@{L5q
z@eD0Kca2Q(mff-r4FMcBH+0_<2&sp7$(*804W8ExW=q^C!~{G1me=$1v+$e0y!sVd
z7+}&)v`%PW4x&eER{^3|a9)PdYnz3v^r$SX?ZYXm6>GA-sw~~w#JSz2ec2kNyl`K4
z)HQ!=W80Vv)l=Rsfap!J@$as-f$6En{PN@G-7n(91%$>mEsrgAwcxrN;aQBKOL%=?)y27&GR7R}j
z2DrzYLc)9IGKQPVvN~-6BxMz(Ay2B>K`#Pd@)Ykb&WWQff{z21lkxlrVT}W{UT!EQ
z0_b9xlM2mW9Az)*>%8gl!tKs52%BiZ46>J4FT(4EDA*3MhZb#aVaXE!+!m$21~%_4
z=-lavka~|-_lB3LNpngP7D)?=wN@mwztu~APIWBt0Y7X`3z-9OUyES)C!;zf?d{D+
zc<{=FvmKA`OU2{6crTghip6*Fe$FfxlstQ3UW)=H@A%e2<7a$0g6_eF3C|GMDL|`)
zLHn{$fd~%?2!TVYQNafYG31{MQqCsc%7q?-|DEzUd%z?VP2Gr^C4ym~E_A7B5W
z*`#Ryf4jZ9zj0d4O!w6`_1D1$69Go2dA@!he)|I7Xw
z_5oW6?F1Iu-Dr8wI9Dt#Hd*OOon@|QhJRcl-v*f#n&l$;bN@*?)Tj6qV{styawRyP
zguNg+g-sc6loh9a?hsvPijk+36g|f^LY{0{YMDya%y&#+)I=Gx;z<*P(E{v*aN_3b
zvMt(?_!&TXPbH+B85Apk@}99X8b$#Vzh)tG6na@-4W7WGz?}c?V_c17r^amyo!j!e
zRI>v-Pnwq!H&)Q>3%FWoEMdPELG)VC_n27GyS9Y~>=X!`;r>x0S1~@1pL225LF9gw
zS<6fDRcc;!9Xd`cnz{ds%`EQU!>7iuluyb<7f|Q76IqP~(a0Ca>zQC1v5(oq{xBrE
zCjz@FBirAI;Q{}y@)so8RV3g~W*HWxP$Nf{*07^f?`7~0jjToDKR
zlx>J=R=B)?(!1Skeh~?M?Y|X0I5=Ry2B>+u=&^<3a@iP5Yq_uV*$HAMrC@8nrAXV$
zW*#1Js8G>zk$sV;5#4OfNukigc@0)WtU#|V?K23Yr6$tWjfHt&C(ixxPOCgLPshP}5&T)RP(!VZn!FX`|q(
z+6}QsC%wj!#;lEBr1l|vwP^pojMyA8%C;}#?{Q`{ZWAY1Zo~AE&9Jb_i+k)aZ0M>L
zvJQWEoooaoTm!}Tj4B9Kw6og_q1oUK+_H)k+K?h7G4TDf$ZmJy~s|
z-*y>-Phik#P3=@Yp&4YDY;|s;7I74=_gPjL5`gmw;3to
zPP6SYLn$8-0?N7t6ckuuEDjI&=?311Zj81;=w%!{h%I#ukdX^KegS9Nc$#cmTHylC
z9nNP6x}P&?DY2e$HFl0*+yowgtH-TBIVss*^JR|Xk9DQ+t>$|Z6g{@moN6ViUfVW;
zttXZOMb?{c`~BY7vM*l#@U?gmbY77(0Lzp(62=CjZ9QBb8@m%Mk1c*oBL^(#3Yo_<
zxBWpLG{4U)8ibF(zQF1`WLqE*8
znpeG#pqXZkaSGHO?)PQyeFlf|PkD~UMaA$q446RYKnZMZVEm4e;cV75wY7E}*jg%0
zzcKi_L&sCCF(<5g_1!{fW5IS54_TF;+wd<#|!>d7m
zFtw`B+{Q}EcK-gUz0Tg>mX2>M(v9ecQj^9pSok~)n2MUm9lI4kPcx`{3_Xw}Oue>(
zZVN2E94U>MMRc{=%!nSMJC9jmU;Oj%86rZPEFIwUB(ie&77bX0)T6<+G8+_2xc6Fw
z(V&eqd2KTe!yIsbbBRkL!e6-BQu77`JYQWoM=Ynj4)ypBDjPkpz7?arwV481F!jn^
zb1Qz6`}Rs*lBI)FrzXEUE)zs34kyq%1vvfd1q^P#%ByE-aBxHI-#yaS-%u|t7!@CP
zGm}WpH+Ow(2;bB-)B(Jg;1UVzpo#(E3%hA?VuH=36mbAH803kqT-=87(5#uo``|`AsEWn9w5(TLdL?wAn2b#Sb*Y5%vtX&lMvS+
z>b+#P0;tP^3a9Fp#2rNgW~O0St1$Ut=)apBr7J?Z#OgA
z!0iGuU59(OS!QoBvPe9MRxYr#riz<)$vKMNm%UiaoEOH9gA8b9xxmRA7s5@D=giaU
z+aQ4FIV$QaDN)7HA=bk%(mEs&oc
zh;5gsXIMI%?p<~dEUe9WI>N7s?Td~xy&Q#kbSYzQ8#A7V!AtyqvTeq1F?^|I>Y4M&
zPDj~D&2=+=+s%>7k5tja8#g@1Bw?JU0ZP)Ur|(>pTY02#T(SuJb=?G5vb*eZ>MK3n
z0^Zv|m~c^)ykXn<5b_c!)0A{UwCNl^09bxxMm$_EtIOo(v)j8_yJ6^NG$oV^dGY|{
ztaqus$Vd03l|2Vrm*~vndD`{tzyvhsZj8PYDAq?F*b;3n=b4df&;6=o#$?H9#4?;2
z>im!2SF#^gUv}Ko4Lx}a63Mv^@ICxsSNB3(uqqnL5+O;X-
z6r{UN=^a|-9K?@OYQoa47WAO*73*OP^N$XYm)Zb9$Y@8M!Wdu=e?TABVB?|tLE)P1
z-v1l*_^;L`ZW2%g79MjIbLqjB@`dQ>pfJPC(b3C`YtNr7(k8DlO9%MBcNdySqSX~a
z)+ne=B6J=VMAT77Y54AK6ek(;R>%mklRIIZO^3@6H^J&K0d8eZwD>yOb@Q4)z;(S0
z@PpMVonah^z;Zig-g^zHSAe{zFU5;w=sX?u#-y$?Xsu=*!uF2iYCD=k-(B6P1xcH>
zr;NTnZzwKHOZc(N$sp-$RUT~%9nOV_{!CgPW^8gqX=q$05$ptlj)6D#;%b|B?3
z@K6R){vXqh>H`sXV~iUDef0m|p`i5A$tiQL-w^)rUvci{);r)GpbxDo+FwwxJ2r)F
zTUBi_{wV-?@S$xY(F-CIGp2z@S|M=kQ-z8S7wP;VIf;?y!9;SDGvgVG5pv(54qS0e
zRy_;AMMFdvJ^G!A4<}XwAd#qtb3?^nZA_h<8o7-ag`k!c+rc+u**36J>^s8axiBUi
z34$v=UY*CRv4#>uFWtfBz$ljz8Xc8d)??`TvFUy~tgISDFA~A#*eS2e0;u5q?~f53
zfIW}J^3Jw#83M0-?6o2tdo40j#Gu2rYFwc0xd$y_?b(l!nxi9@}ikpeul{0@Y`N)Mbi7?iVLm*@vT1n5?3E_
zi|~8(T13yknD8l}B7DX*04I@S>(L6j8*EQpgP6aJv}eF42?cclb?*x?tBFlUtvRbZ
zEl&_w$h$VX37bC$rcXu&OI^98J5gJ^i(q^VfD?2ANJyCp9vqEq0evs8;J@bhx$&T-
zayJ=I()F(+uB`?Yi==0Q1O8*7f7xh2I{ddYnk0KeM^{>H3I@qq0D8A}jJ0+q4j3NW
zWG9;CzIN1ogR`Aus+6{q{(jDbomD2Q%93@2eVvUXFS@38*Zk2;Mh5dm--9zV>Ec+=
z=Q|`xp=#|!L|}A%hvnbhEG{h*vwxChJAit
z627GDu=|u*`qXoJfA%{9m-G>>jt#&|=vuhC5!DR`|J~-gL;Oytd#bi6IrguMjFeND
zDs7BaTrrYffcZkJOlS81(wDaP5PvUqb~<0_icKnp#iqu4(`5rJY&AbVZNo$hVdDYu
zrf>bt-&)rbD;zToz)y`$#%U#ZUm6EHpw?mdp>?87bO}78VAZ3(Lfu2kMiV#%qX#1R
z`7)U}#fWKRC0Ezduzb-N5oM6!2U;M|L@e@0%GktZi^I%jNsN84woL3~9q5k|J;|(z
zbj&%O1XB9NaK_u~QTuWyS|qbJKSxEN^|;yzG8Lsp`g02dg+0>O_jV04%7`|ud_|c?VZgq27N=$&zIWLxDBmo
z+mbwi$Jh9^2u}IZx2?eK^F0YWfv>Ef!AZuuZ39B%T%<_zqoemX5*zR?p3fBQJWm?1
z1uS#e(P7WM6zKA}Bo>4cvBCOFTq5c=#R?%RTxN7-?FeK%s%lE4?%gF*LDpC=RWJ{JRh
z>h{9aK1hB`&bDIitKXo6rQg>Uc%ddDCQeHRIpMkd*gZ!i3
zy6b(g4R%i+%F#|Iz`e&Kn%-FA1UaePwffEuO?zXB-)Ng&KtQl(YhtXo0qn_1K7EzpRCxJKGT{tg_1Z%_Ue2EY_ixD313G~3;vRpy>?5EYjYmICDXE7B--
zYl6<>R-C^^JC_0VcqD*w5#nKVeV_Kv47*Ri^M%XMXP)k0E(FuSuX8LLpG^ShDK5*`
zm#5#J>65u@@T^cpuo$sj(wMe%4?u%3e!m+&rWggN9`;oO)qAVupdC4=UJBy*d~7}9
z)VY>FUe-E=jPPbnsJXja)ry%;f%no8RuMCJK4p@U5m3ynLu~QCQUw0pD-P&3OSI0blCeEH@
z&HZ?@`Sq(kIV#s|7q0YckoeBPw)i`g&S)IDY?Lx
z!L>CLpI}%oTw@nDzxGj4{Xlhgvr;cp7S7Q%)KUQm<3rxg)k*jCrF_8HdhBf
z;$C|9(p{2E7S{vZ8zgy30^;cb)m0>bd$(tR`96F9hd{R}1fPE@5-JBJfsp|&GfUv|Opk?zTpM*_z8
z@lk`~8&ZLDU>dSkM;N}LbfE5`Z2U1Lxe~FHNxL6T5}Y3X#)o38r1XXWgz~Qnr;onB
z;R&s7D=FbF)IFfHS(py$vVTo&_Z&@Nq9QT;F9{07ayPMF;Qhr6jHDcK$rEn|7PkQ<
z4TsddrG7gS-yyvcOj|pZRGBy2bNJ%QU(tqxeclrSe6JfQr(6W$qv`Tzq9+&H8Hh!*
z+kzq_x%JXqv&gWm%&=o#f*81q7VkfyT7X15Obd$N{xPAu@aMZl^FC=-py@qlFvXj@
zE<0}>>ArM}kb2U-ZBTl$?I`SJx~xOY0T}yjMT8-KAAh!OFB9441oewa6MI_rOu^>h
zkaN0lZycCK9*?TrB|EN2T^$Oa$7@FZTe_qvI$PlM=q^;MW>MoVPQ+VKCv-k?;zm2c
zcL4M=1ISPB;A!84}rF@%21*bwnRgSXTgDIaR6
zDq8&bInf`2m3nSglOG;B`52haMJYl4a5iWwAIN(DImgl*6CTb(uEVF+R-AA1Q0)t>
znl6#f!{!MxK2VDz^lYEomt6_RG=gVt|El12x2^s~4o{wNugPE}-#i@SC%?;>ti#9i
zfrfj{!XF;S;qZ{+m#v8Omua~y_TfM<{wm82B%~N>q+MpGX=5Tm$8H7jmM-%
z^Q$1MW|s59(00EBHwVk~k?mn1Ib)#Kpy>JA;3JA&gp8A+hkh5!?mz&15j)LONNUIG
zyj?nGcwC`uji%?+^9UTu!O{~7qh*qPL9`82Jt-M+&P7l5W#Sq2{PpQ6@{oUp5l*Nq
zR2euO@^vIdnJxreOzzzm;nL!ZsjkjlJP>^j#{L03FQ@5qDuPX<#24)Lzm%btaA4WP
zcRzpJ+=#Rk7L`hQ@Ps=LFbZeX+0YaO-D=jRb%0U93(Bl05iQ`BC*yzIpW!qx$^{fX
zuImVc)#2vy@t2{;j-j}E5-}3>Cn
zmeg4g#wlS}-<_R3cy19~Izn>w9IBgO-lPxRT0*=S}9`i;yL*&t+%X=_i
z+WByG^9Kqw>sK*eFKClvFoJ1N<_jm01XY+1d>kh<;6PTR#YXs+mfD06H_KY^5NBVj
z%rO-~2#ehkAxDXU1wO4pgujoMrc>sHDvn)ezS{Hqjhl)EPt;=u*lP_RDEhnqgw=;H
zpOwRMs*n5?n0hitLgLQwv{kp_>M4;Asrm)x2jE!!;FhjhE%>wHa7GW*#VrS%Gng*I
zY`n_F+wbnr&vpNx^n3g<*1}N{w<9I6IUw1%Ehu_&_GCYuR?s==ifZ8f(%Y#Ohl2|T
zAnZOx*}Rq9-!T@GDWXhuL_N;w7Cb#E&!f9{JFwsV7vW>BiERV1FSh^~TODVwJAYv~
zuXn%
zx%lYhE%T<{-5p55_E%AoO2_T>$-B*7hn4r}(!b-g>2xr7ZPe}i=zBmkT<^VhJiLb>
zLftKZ*AB$Znuc`5R5&AJaB
zor_>-U2-CRI((ja2jsyWEQ^Ps=rz}Z-sZUx^k3119!xI?8k(LEwZDRJz}BO;#vL)E
z^F1T$Vcpt%xd3HS_{9~D)6La=B!KyZUvz+m5`|&(i*a5~n!>zVI7F)*r+Hz4k{)1Z
zISaN*z#W^1tc{Sh;_I|9a9NOa_Rq%EOTr>rwB1kk52zYnAN*zSr!_u1hvo{0o!Gxr
zcyq$jpKZp)@L&Snh9g_fGLoK3{hku~&Wxfb^C^|_XRUt`kw_Yl*>u=MzW8WJ9{}{C
zA^451gf#$p!mo>j?@aPG0#sgD<2D~B=@8R!PsQHIQV{J!VDsAI%l3HASN^;8_O?dP
zL+Q?*|KNx0;5R5(V;}|;z3#H+>zGalMicazfM1-XV6;CESkKqQHgjC8{5}kAFkZn3cmN&{NvJK
z;^4tC=PDQ88-_>x4V3PTO~*pCiS)6_U)-eprauugFIMsdoyT>w5aF?epqD{z#D|1D
z8$QYuiw=`xTQ6lyS@C}?z(0wEF>!%Ig(0(V0Ke9Ww{2n~l
z;p}zs9G{7}*S1H--HQgzaC_`)_b^opEs*HMAT2@nve4TFZBkPaNcPP+xt92%KL9+9yur(#5IfU%mlx_vxU0c?FlX{K?pTzT5&HV#zye
z>xk;e=YaL4D@*6r^@SU_c?aoSkfOH`kTJ=vpqyh;U>W!?Y3EW>wdl5R8!v$M(Hque
z>*~uMP%m5_`zqDwZG-PqXKz%f9%C^s>%eL+3g<2I1=nNtr95N$^z!U{P-6A@*!!rv2HFo)H(xZ5v7_1N
zfaU%JF25J|!w665<5<@1+!>i{U5yi`ljqvTJ!{PvLC}pllNmi8EOlmR%fJF@PWC|k
zFd8*8*dyF`K8HCh%;rM7zBuvKls!V2!(tJi%ou#bHt2YqT&9CjR>jP~E7#zy>JMwd_fl4=I4kHkX}T7551QBvZ;#4y
z`m;^65O(l;RD(5=z~ci{*%~#iE`mVy6+0@q*Pyiq$ewh!yYQ2E#@9>pNqUcDV7nFK
zWd7PZA{<+szjVvTqIJj_ianF!BaC7_d9qs)lCJIKA01h5j`bEH*dX>a!WzK{8Z*JM
zqqRO->%aJrCH*H+xt6jUVvm=o)ra;q{pTRil?*#Iba#jsR4jmdktoT69llzfa;wk#H*hQziyGykmEh@um_;LiX9xDJwTOEY`KTA=>R^>?^S20*m%GKd8iu97qi2A89%iGf
z0kgWu2YK)CNuD8K=K&mPICQ2kab0e16BgzFhBT`E=3P#|5>VuMXC(cRpWt3{A=Qp
zoHf!V!Ph%FS^~+VmlwPTkUVuXsTrfIp~T7K{lWqAWcs?pzXQli2j3^-ZZs@+6)zldRjy)vEn19onWAzI@)rBOnoF?772q3nPUz4?)a~(b&iC6cYJ(&ri*@I94NY&jcTiqCGH?)_p
z&ZJtH(@u@%KvXcvTzgbQNfva3p*Vv|ZC4jNxj8I}3U(JCIB<
z8MWYhiF)Z$Z^qrFXYvBLom7dqnT|s(WS03b%Ccxk@v%+kGP7hIF`kefDk6`LEZApa
z!@b`LK)LnL^rhhNwoFWTDj1K3b2px#PTYgtrHd&Tgg1XOaDaU9;-6TpK_rdvKXcbd
z%B1>QK0j`o4@SFd%h!0&Ci^hZyWkMf(9J}qL0ZXru?G9jb>r0%%~A0>XNYOEJI9l2doz?{PrVutFBTWrH%VPK8sY3v
z&=c%v?(&1+@i535&8{0^7cibIl&{tW_`TPIw{^?I;;8_Xr+$l+Z>P3u3{FUttx3)_
zB81o5(n-eg&xXg_WL!L|4J%>t)Hl#WG2ThK*N{bO3p>T3H$n
z5+L9S>f6x~?_+JTN*aOwoB;9&t%uHZPER}B#lF_Sqgcr&2k
z;ew=F?Ai^c+O>p+_avb1#@|lxlnTjTy`FxNAt12bn-=Qio-)`?aq&!ZzZL&Zx?_1H
zVj39C1)fi$g5Vm+eCYm|cjBsZUs!Co+kx-eL@z_$HPiTjR->MyW5MieQp(DR33M*-
zTT->=OzBd9ZbQCnVmPPNjGoFaxu&(Vq2JxSY0C$&ASZa<`gbiP_JSVuu5REN`g!)&
zK~SuQw7(I-Xff@s7*XcVUt=mh9Sd*K5q-J>6faLsj=J=9U5KZFt@=4_2;9*vecjXu
zdAZL~q(;Dt+1?PRNi#Ntx&4)y2|!bz;lZROXn42x7XZQ2f>6jE4v)SLjWkclHr35e
zqsbuv(JXMn>19k$aZ;nGW&Z_y7*w?@SBCAtiBYIK^K}5&aV~Nb*K`t_~yA}c!X$>
zmvCdoc%gtR1rZRzDQsi6D+%cY7fZNTG^Nc3go;4}0I~*r4LO0N!nz$RussUpcXs`pAo%ebhc-`hovK5J12b1ZGDLMh@Bm{yA|Km^e6+fB55#gy5iVMUKO_pW7uw^t*PxO#SXD+BDG?1}YaDm?K~#ri`L>Yh`XZ3uNLK(O?X
zNhSaz_U_AeP&$E`nhtO9b&YHs9?X&E@H4;cv|-aViX}KY0h%&Rj;A$7m6cqcy}!D-
zP!Gd6q?*HaS{Xh-+U30!tyIJSEcO=iFOvdFqSCb#k#bfhggV&jhi_~>v&LG`Or3On
z_?$M*KDCXfZ~tW_v;AkhVoQ#eQ0zjl6GSeGO~qmpt!o%$Zn>wz6%mVyOh_ZBHmJt3
z(;jIWj?Ut(<>U;!*;dFqMFNzF#iD@3_Br}o(vdm5^4sw;@*GegQH3UnAaGk=akc7{
zG_p#@1wz7wTnR)jzAI1~8|5AU{+#lIp1Yt2uD@BAL?fis@-!Yv4
zV)>FNBie#7+`nkYW5I$6R_-6sknS#xKw7kd<>6y?jV$LN?E3ra*6z#hm~O11b&8?S
z+lX^&9=822ssETCM%ri3A9+HDQ>z20;P7mp9x9TC19)_$?_}~sB!bkRyy_1Ds(bvD
zXA?QVqh-KBChOZ!F7`pu$VeQ?84s!a0ARTlmR!D)`WT1~x(F*Lrz1kmf5Cf~Dp(Nj
z!9T{4M}0ZITF&BevoK8B!@_ZUHiY(a9UMF+ED&sC2rC|nudjHUw?7~f}!4&9Jd96BES)ya3Ze=}aG~C?9gMIE!
zJ4jMc!QID=o}cV@1OXJ4JriAX4f9$~U=#E`YeT+M!
z#DK+dag%hft=&BMk}_%RrffbPC}srWiV2xN_I=dRxLyRrme(8Qh>(PFo@s|HhI?P`
zM=dNTW0e&FJrx5vaa$M;tHB>X!fL>F8;|+2!$#xs9`T=2S|V_&N?zD#xrvll8FbbE
zbYi!YRxCsY{6pZk9d)i+zdQix?Kf4*0}#@MS3j{zjT*2Bgrd#^MZE(zfXBrqZgB|y
zDR{w`Uf<{TpYnWN71Pif_I44QPGGebg9FGQ#}yPk+kYYBq)z%0rw%t)^XE(Nv}DCe
zI+h*laFiKP9UORQOZKZ*3G~+=)^JUR3z)rb*q^4h*n6r7D?$)-Z7c
zWL@ZCsTly0?&;FYS)Ybjhk6B(j>nz;%RK^?Fs_4y*qi432qpUH2+v~PN359q#k+-P
zWJ&l-l>cf^{!Mq;n$VDu9R_JKKj>Avwb^ds!yrj2jFGAszJMr*WPPWie6U49nP?QX
z!sD~zv>!G-avkk3#-R5WCDAbQsN6=$`TmcUZ#>;^ed0+f-9zKPi%|>kDzS&DcK3t*5qsNUnZ~UWIN$%=$H;z=H@l
z#OrbEq_kqu{jb;XFlOtJS5g4VF#ypQ$6&;7R5cP^>)Pi5(xH!cxSUTW2isa9XL|2M
z7#?)2<*n}lfldtQx~$DMBVSf!a!uHB0_K$W0B45)bOA`_%XjsmFje9UTly69^7G%)
zzE$YC1}@nq@8`dL6PtU$r%Q8%n`94DcXxGna&F=d8f&=3;rOl5>Lik^fT=5l+%k_O
z;zlI8QU+oA%ODGD3{3DxN5q(;HFI-wb9J+)p47dcHt+G0!R5P6U>V$s>j-EDPM{Pz
z>YP^Lwg_%VeOB#}GWcDN=|R8Gv|&!Z`&
z_0+4YigV7o%=w^6M+6(fL1t0kd#^WaAqs79MxVnB
z4TyB91s^Up$nt4E>el5nPMBJpt}Mr$mEZ+Zy2Tdj9XE>Mei_;`15{>4Vt
z>VjL%6ir^r^T@25Hd928G663H7n&3^ln}sssM%)z)EM7%VX_!qw?8n$nn~~Y
zpHy1By7EywEms3NCn`C`xVY)MtqJyLO5n~*sUt6QtEE39j}$n|7R<);
zt_3iKr<`uZ3+l<1@}8ygfjs4tDw9uzm+Pj(Ct^D5r3u}*Kkp|pyBtusz(Jcbz!Mx>
z@>eV`$(cb){pKLd0R`n!c)J7-cSsRhGfFP-Zc-O{L4funi%NC(`4~SOajs*SLk#Kx
zAJffod-BkWOl;!5bs6*Lt5gIrjI%jlk!pxM6>@oX
zY65Z@VNUP8YF3j5thC@{LtD%k`Fs)pU7I4B2|eIIb(T@9>OvB6g3BlO7*5=3+?Qh6l3jzy)l3VjQL$RnT`ewmBd8DZDPB_l3dJ%eO%{6Y>Z(7(e8
zcjGpMulCxPHAXdXSMtup5R-$rhaoP*wz?QGk7t&fB|-+KytMio&%U7
zPu`sXy!w>m>9h&1np51W{1Yl$u0`?cc=Ox^UB}rDQ4pwgPP-PwPHXZf8`sa_5P{Q{
z>}0w^1PE>2f7zqpU9~wQEN8H4aUPt%^wa-{71L;a4Lc1CfG{tu0j$I016B`c5TygF
z)*3QB`lNlOu@MUrPheQpfkG3TCx$Z{Ax+Vv@v;xeisKR)kGEHsT7{fC9poKW6CMQhb3uG^9q1iS
z%eFsvW8Zn)lc)s_YsXGwPVxM2_c
zzLs(IKPoC4PA*F%lW?!uKU!gp_i5$Y1fsYZUbzjR6~Z#oNlFr8BoVmK=FGd&h5JQK
z$BgO`NYGA|6HAO5Wu$qu$PBscVvw;X;9FD25dB@4+J;-_x9biDFRk1O_>PU5KDJ&N
zR~$OHKxLj#LKvC{hvFHcCpLN^SiOo9P+qVx?npHKWR+x>y}BuA&>kgLhGe<
z`uPZZ9kWjd+H<)^Z6OVT1%u>HH^@8+jkTzHM8o?{eL17a3^5W=LoWX?p_gu*9e|zy
z7Ij}*GZ!HB+Q?Yk?7_Dlcw1eOEr|Aj$I<1l)Ul9flI(;k^tbM0qTvli5f0WN;7x`*5U~sn8vMUbEF2_b
zXThl!F3aq`j5SkmD;gW4x7bAPUSmc9V(C+QE=}Yje7a|5($bo_lmg7VH}Oi=abwkh
z^;#3{%ha$AVK3j~!3h^Q0f(A%+0hhU*D`cevXFPA(gNp{s~;KA64V3i`7(<;o`-SE
zg-6%rX#~k6XuVdEQ_yrR1gs^3z0Ke!E55s`X`r_UlVzhHV(45xkXt$3qsv#TILehUdcCe*1(`24s-f@=&1&+E-TNfmJTya<
zRXR(dYpWf3eeYb;Rq7#LppSe>}TFQQc62^)#@)Sddt(tsFA1gc4v$!X}!l
zktAI&izU?m0pNK_e>Q``S`59mcB31rwJH2>HK8
za0afRzJU}E9B_vp?mni9tyI5g8D`U#T!O`;8j$`B3$>u#Q5fKI?v^h~a29sy1Y-OZ
zRpXCANOiRW`3~rD)$#3F2(~7;X(yb#=~L9p9EKS*FCpagNer3LcXrrO(lE_{d#eER
zVw{x$BW70M=COk^wJ2X~0#CQ_D4TR1b_jPEU)rF!pWh#!oSs~#MOk6zNwnd}fsdhg
z;vKaYaCvc*ywXGs*Mv|!K=IOed^R>-3!qpn=M*@v(dpjRO+BICZ3E0}#;--(JeL%&
zD)hWqbX!34xb6)B&*J2Q%yLo58rKIXsef;j2+UA#4&?6*mUail2$Go&*MK
zRa>qQet(kr`2c~ZqUPC)_T^4KT>#dT%pwc94;e3===LHbDqYcX`DKzb{F6vhnxlCY
zV4@AnPUt+2QRbs61|HT6Y(e8
zYn{>n`2uk-2SIszQtFt`-n;%fkrW(v@vB-=j6ielhjM~IskWz_J}PI2dQiU94MR(q
z+C!rAb6mzZZ#0&F+nRo7McYI1!@`b}#_{%|1;-Z%c946S3I|l&0QAZYsBayM7sB=p
zHI6ZhZu}AzjtOwW6fEX%8mDNf~9puMd>w`Q$@-^&J!RVaL#m-&!`yTSN9y1V*i1OJ)+@0kDjNI>|Q
zt?>2bDLl~hwTK8rU7z;BnQiu(bSjWNSt%KiQ7(vHs{y@VIY56hZLHLjqDtl_B=
z;`1Tdlqh9G`syR|uVAZcQs)|Iz8BA(Oo6mCQPnsZxK;%d_>=f@axmPZ-RON!zI-HJ
zsvE7v{#}fu{e`CYsy}KnGK*`Xy4Mg36!{A$on!-3=9E@jFomyIn=Bl?O
zl92#Kv4e)raWl1aii+Z{^Bask>Qm_u$}!K_;R`mh&j`$?9=f@L%laQ6P`dn%cGgMA
z)@K0x3Feb#YcvA}25=GK?@I}I2Ew20va%Sum9sX;Eu>r3JwXlpxkvbO!2*l5FpwOM
zWpF>kn3%6`iF%k1O!I-@jr;`9(45BcSAC}JRvExbhu9eEKCp<7ib_V7b0B^MyRYT8FK{;|tm0xZjx^d;iiG_y#V;s_b?Tg9!MY*eYK#|BLs9A%1`oIf8-17uP>z^<$^tYLaES`;$f7{
z<>@lb{+B$0rs(Gp)Q^$j?5;3MVb!yU*%wfx4CqG#PX1eX4B^GqKp3LY;Ls5276n}I
z+{1lZ?x>#pbaHWxm#{~5?50J&(vfk2n)JwsA2*5mmd%1b3Rp5LV!G_j~e
z)*^m2JtAE+V_%Moe9vUwTD!YIZ>2ewN?{fe=WG|KPwNP$51Bhw>hKpKGv
zBY()YXM)Q+)3=C(#*?ks%IfJ8N>r3jfl<3?o;W%n$m}dxgAMrjF^wgli6dlfhkYm8
zNa^@5_e-kjUL)0UsP84BzqAmaDs%_~k|KRPYN(i)eZ?WXyuSuwpSIEn$HHh3789nB
zajZjBDyv(>?sIJ6Y;gq}|C1dhv71=OdU-O+ar}?(2s9^B?dO{f{40I>#(xPIdjvr3
z1o{&lC&hlKFc{A}jgpWpUY=YEm`gSt!e6hcDHCkITIlP+V?1b5n?pe`M9M_tEUFT3Orb9v&{;<|M9alS`tz
zLeX^ba7t6n4O$Q#2+`ovdkusfR=YX5A$jKsEO;n}BpgVp9GZVh{}B4^Xn#~qeA7k{
z80uY`7TLKx%?#|1bu2^ui3TjCn}0*6J~=eTPJtuL@2{_I)oOVf+p$>}7O0Ypz5%q%
z$cnR1;BQe62MqtiZm{rNa$iol)fj(I9?^t%@|Jl{crwIn_vi#a$9Ml>tniV%9f;!c
zztgYkJ*WWy)r`Iy@b7y<`!R#HW!An%ZXzx`YhnMi5rogP+pLP&X2wt8eI{hx%hf1M
z8d5NJFF7Srm5S=m!9ze%X#xPuRn7o^%{}yRz=40j
zU8jmlYrgyFvg1muZ7#5rUg1PymdWvrn#b-&x(xYucX5q7c59#;bPA|H_Hf`(q8&{v
zB3eEN$I)#6p9}M+h(nQecSjJwKB`g@B|CJ#dzOmfn1KCq7hu}gMGHH!{<9I%#vh9|
zr{P&>z(ZmFXj$(`HF_s%EP?*?xv>f4FAyZKL+A=%eqt|Z7(dBMn{NH>=KAiV_LrKz
z7#ni!xcc92@VwM!qrav8gOx1JJu>W2_aqD6v<+Xq2;F}7@%ZlQ9x9<=PyGga&Bwf)
zm$>=zOwAft`Qj8IApJuDz(Jn9gAkxA|Kwa-vpOC|S}PnVYLrFSR`i)J6bfqfrL=yE
zL!~+4#d|(H>@?nIUT!@#bS{hZk~lOzANY?`2s_Q484(sk9AMT#scySjtgWm9@e(@N?P^MXf9V
zliWxG!=4mom&NC&N1p-aj-}IyCq7Z3XpTeZ1e%F3l7$;l8+M(D^=3^Y%P&*o>{g>h
zSx*>I{X_;m6zNYJf%{w!@h9uEi_%<1_@nAjJ3z7Y@IoQ%(e3GG3b6$&K6|@R`?-=gBOXV&NuHP
z=DigVP&>LR6;I6=3YJe86RNGrD-xai*9pGpXM|k+&gSYjA`$Q-AXOaOAz;V^Ns}C
zWXe15msv;oFo-{GG<8rJdA^|=j|dG7fH6j#+5V)iBl#YnZ3(`z|v$Z_vQwnUCyrw!JlBQST}_q+L!f1@>MGnCOQCCHv3`8yd-}
zmq96b+2r)Am`YX2%9m5PZo-h*HKxdJABH!xuzP>sh?#}g&ZCk2>B?JY&x
zOy7RjiPI@%n0CH#ic<+UQEip0^elspemC1|_(tOa3(aVL>g{E4Y)f5Tf1
zo0~-)L|CxgF)ciXBiOBg72tP1+7Z&z`bJxbNAl>}WULQ{^A1>oOg*E461am9`#e-L
z9R^ej>4?a=#NdUi>&}rB((cJ|x+7_@jvTyy66{^u`N~@DtHnO%VqmX2qjDP}f!&L4
zYS}h21^V5a`*-iKmpYOX0WVg)26_d>+y9Nrme$ca(Iej#-6)aoaJUDDtD6hC@wvyW
zR8B0?3D>>BXq~hAG+t^AAGdnxng9?LW;)rgQz0pNew#u$0F~LV}Q;la}KHS-(*D)b5=(*Uh!s{lP|UVdtG&D
zNQO$ZS#BZlsp`rvSqRXwxSh|ZD%&>S>$ClBU{IO|YA#(TqY-_x2Uxt2xTrVZn@f`z
z>z(h;fTwG6d*Ct#W9G$BFp_ca;OXSDma>3(?rBuS0pe_Q)r&oiC#HucYc3fC1swGJ
zo<@MweU4g_NNj5tW+{sN+q1EDD3kCXEBegPfa=D?7F!(}F`AI*ioJby*?u>wbjwu}p>tSeYd(qsz@E|`Kv@v$xOE!<+4
z8c%FimvMTQOkB9(`(E+FF_V|l!kaQN$*V)h?^9vusJpN=2)2nSkY#kyL
z0AitpvT~IjZxCmf_ca_5=vq{xt@fnNSlAE38*UPLc#JHN4;C8~P;%hXA+}b-g=mrm
zhBZJ|JU)n_sdpzIw%Bl-rC3&BSTJf0FCsbVwRdeZq~KpTQWET_`3ZW2O
z<~GQLb?9{qqX&4qao}3(3kbXD!UG`cEP5=_0yEB|`gMifB>VVc7`QYH27@jZye)7A
zxoaX^{2u=bVYs>JD~8&hfJ2io{q8}SbuHMuI#D}6_dgFFA5%;sum;b=-Jjz{S3KMh
zjnW>Z$WISG?-YX;dEQQIu=J9|y&4@ojR2wQHb{(tE}-hj@eDYH|4c)*aYVb}+A3xU
z2Dnok{CEcoMp~IL00HP5GbHiu-1P~ej!QB}#&a~Tf99*8{CY1>Da18jIM4(_DQ9a$
zI5<+>)LkOY0mH7Xhqjsi6u7#?%{3NI4=-+g@P3x6*M
z>=Iy|ddLP2tNXmfbr-f>SO*>9u647AuLJ7Y)ja_4JidC-bgU_$$OuAM=H&<5dD8hk
z@_^HxFmykhgrU33aM4+7N7Rnd{l~g3aRMEyVZW-fg
z+n>y0&~$&d9*eTDJ7v8&wVML-1w;yyvU>Qs-qYTwrW#W#|3oM|N%xYw9*_2&fOfRR
zMnhWaS1AxvCYTO&4z~Xj5bjz#{yd;N&gG&2d~0xbZ9ZcpkY~0U?Jk=A0MNTk1Us@K
z+m)lvT(=qf&gCu|ivJJ+uk8#H@V|k0mnvHWe8)7q%NFjE|4Mb>hK{5os0I#tn%2?h
zK;b2AT>1#X{B{8YFR5v~X!?Oyogs3;>`pq>SQ8HALfWzrC$dYYbTZu>X`hRnOc21uzvFbG4)4|9)|D_Ysx+_n%&U{p}C0{PXdleLp?~L=)isa4;c}?7!V2)x|=;
zzIgP_8B9T^4}`jV`t;GoIo3S?|CID8U~+Jo(^M(lS9CdiQS0SAUQz&kzv7j;$E0gt
zYdkuk%z$ju1DG*b#=|WjQQz*2q$tR-`3KUzm_o
zG~opUsgrotrXz)DE_<;5!qMxx6P4_jk?fvOmqU`xL?RKEb1j-}t|=;rD3SI^>}G{&
zC+m=QeJ$S-RP2(XS23aqAeid@I`N7`m7=5j&$zUgaw+ggM#8(($bR9xke^Xha3HXa
zlCGfIH-@l;vP1tK3(6nLvW}%f2m74H?>CYlEOD{v)**y(dnnqo|ALdG9(=!ksq3G0
zYEFar>PuR>!g0Hb+oH1=r`$NrbABkmi$6iS>u{Fdcxeh;RVEtMw^KCeu|P)#Gxrl|
zbhK8W-*jMBusnR?=>}EcxiEvWv9^Kx0!e}q8!qXMK`AT_WFzSmcaA-~!#C>1fqACs
zHW=mXEytOvVG`c_MfxX#C&GaZ4?WTs?7F_Y{>OsGNqTtiENY@p+Su8ILqR+ui&!Fv
zDLcDZ1%LOHRxN42dONBAja5#^xx~a1=5AWe%aC`^B#yI)6-UJ5^p#Cubhk&eQ>}yF
z2#)%C9T;=CCJ72Fx`}YG4~0eoStco%2u!91E){||MNhGRRKq~ogm{-U6GS{0M27+@
z+Y_O)hEP|M90*p?a_})bm13D^sj)9-SBA11r|5c!0xlZ9FEA*D^8?DcyE-=mX>X*UkVS+Px}?^WpF@WjE*}kk%?p!LtP&
zPje`u{|PX5g6R`6uYv~=f3k60d>;K;G;LovXnqAwa)VZS^;*I7^t-W{$K&8J^#P4V
z?ZRAz!eUVW1BoZg2*%VZ4yj}+mwfSM1mkL7M!6&AsGS@Ty?Xei=P6JhgvT;&=(Fc_=)}yFP2bAusZ1>zk&mD;)M^)#
zC!!LuCoP$5XT^`@_ykQH9BZ)h4*daB9kiX*?8{K`VzcxzsB{iyq+*wSPYq6Di!7LFEW~9jmmjPv%znh5l0?EzD+*CgP&{nB$#i6tZgZ{ZpHdvH2eqR!
z7}kk++5uJgw|R&T4!D$42#5-UVTWn}gzWKBMjyywH3VUlJg^PxQ&?ePjRmjKQ#=U!
z0VHDpHcR+PHB@r+Oi>N|AO>=B*okgOF=YV?x@6wNB=fF3+fg!PX~YGfnj8{PHB0X7If+r0b5kay<2ss|OU=ncq@G_;^&Q!c>R
ziOAxVgY55EmE#x~^<3G3++aa9Y-1A4r4_PYZOJg+h^ZKDqm{TS{S-^-Ozpq;-$KE@
zgC+gHW1lnhjWH{5`aa^f<3szXUq{}LY8bntBRCd*gcC*0*E{j-=xb^U=c5kv&g
z8mGDoH&_3@Ir&9H3GR}0V6{*3H;^A|Xu;j=jZ9#8CJM(d%^1G`aVO|O|8}0h?TXMm
z&`vOS8ksjh++F@~5{Yx5LY8imHqD`_zJeL!PMf*~!p<$Y6AWDjuA^9RL#^uPiWRcx
zIBS;MYxNnxtO;llpT1Dl>4A*DVq6DMJIw|ej0}+b*tcDxf*BCT;h``zVinzPXmGcS
z(@}QYkh050qxvR}cI2|5#6@eSlR*W^aCQ<3Z?xGioj3GYbLD=DXsCa1Kf)TH!0b{Z
zT9_)84{>^{qdT0H+o9|XO3r09?lYMC#$T)=8AR&~>7QH1GJYL!aqdsfc~$oAxk;sf
zu;Zi*OgbDNj5>oDBVKOeH6Z(xAa?2OYi%Nq92V#wG>M;IL4?zSuG0>GHCjb%I=jJO
z$~BlWwSzzVwI;0=A#3h~#jQb1yVGL^`G|MHqH18+Z~(ia$u#rF+LTy?*>11T+zFOl
z8~MeERSSPm@&UjO^><%_Lk(q@g90W*J2Lx`D0a=<;A6i4Zzlq?hPRv0@xuHN
z5c@U@V(VVSv^zQy?7F|gV29lnA+v}A-vM#wz)vn8ZO(oAB-{IR!|RE7icA1PY;cQew&k
zldg1Cwpm>AS7KgW?fhaxYffEB+|9mecOyj3T_vFtj}U}>BdvPPsIr+n06<)`bKn7D{+&uMuZy@v=(9O;8-Fr
zH4e8fH(m))Cgawnf)g?wom&l)PXD=jBbsk^$_)>7n2xj2J^Sb3*!7M;U!ymu(;dEJ
z>b4__Wsfcv0G{kSHDhhXMZKFk`N&ymvLJfr=5ciuX6`Zesact!#I2H3Z)EP;F?J*4
zxb&o3hGb-tS23!GncMuUv~hRUL%&QJ>BP0ueg;XIwk;De(575SHk_A48M}vq+I4f_
zqc3+xcy+tRcVq4IuM~?n2WfdCwEl+c0Li$wFct`#ys0_IZ-<=oFH$-_`y5<`h7NRI
zDU_hRpjh=oVe5ve-WHJ1j~(jvt(1o2i=5uWE@j7zn@u}LMe;ijiIFzm2i!sZtlxw*
zZje_upeC%vf3I$LDW?C7k_pR>I;vE>2X+b6E*FMD)}mX4KRV&=1piknZO(+$4i;^}
zynbq=EGnTGVtG@xE#m;(wZXcNwuKuq>*7Wr1M)5%gRR>hZsT{wxfd``kyiRW*u$lNHfbZ^a
zZZ?-;e}Pu7KWV=Ohd32KyF|YAV(FaG1R`E^q>UCn;p-W7q?-fQo2EHp!GTEN>jDs*
zWjnMwD|CJMTXeO}64$x#xcx1q34w>rJ=CZsG_~9oSUO{6k=S!>k}WrZ)A?OH%GUsO
zymmwkM+r?QS1+10kHwS_98+}1R-`(cZ5FR!>eleDQR|GcBi2>>&mu^!ZXEw7=?tHW
zT!#@$n02zW(%&&YL-dMGzAO%pFKGaFM@O%&I&BvNzVw)Z&bYInC-DAK;P9gAMr@Ue
zwBbjXbFY_C>24C>EKJ@~d^e6A#>2|qgW~U-&FSsGZqAc1kzcJPR9H|P!7UK$8kaSE
z$h}|;4DPQi*AE|lKy=5;22N+&o8&?d%
zKe`U3;2b3`k?n3gIIqc^8rm*0Rxvau3E(a_U%z*Nb~18AvIG9-yPLCXVygBe*0ZGR
zMJNwZ>JpYa#i2*_w88c>IDy->3P6CNOkj2))pi2fd2o&#!+~Tc)phA*9t+K>efk3UAKl-J6W#?!;k6h8e$!UZv#z)qh3DG(@Nkf)w};FCl$&+b*BYhDZE#
z6HY4DRRY*0jZYEmDwoJrfZ1sZ&fo7ozB-q5L0g18##Ubk6CSFs@i^-+Xn(he>-7u~
zBrfJ585H3#z~nuE6)CC9_AaZ&GzQt99Q7}4hK7)=HdDS_HHgcsvdQdibeO#4yLyy!
zUFwSnV!%$3-6JD#WsWAT%dqVlM{Qz_c*h=oOS2{owt&0aiCG6f@L5~xZQV8=D>xW6
z<-cfn)!Iwy9oJr~2Lu?wh&z%F!_Ut0=x@_X;adrsjCRMZ)#2f_`MX$xzY9j6f`SKX
zI^GxN@M3cTbMcjWy`ssVk9@}fIC#^}PGO*TjeP#rI=_H}M{TBcANTn%LX6ryPp;8~
zknIp1adAbh=+g-Sa{R|E5YrJxV*IzWLL`)zj@W#~spk_dqeVKJ?$2$MX{CaJnh{bw
zyRTNXwFi=-;h_=KO9hL3ATyd4u()7#5URm=fIUT>k5wk};X~Ka*=)gs4h-_;eqmmV
z>wQ7&LHBu(W=cv89;^~!LDV}r_6AQP&(;YSPph19@vh##hbomiOWHo+O(mAN+gW!P
zhdD@DnI>>3aPhju(T5d9pFQrO-*^oLFU--&E>NN5Z2)=qoBHvm?cyPzCWw=Y`RBsq
zQB9}!xzm4^Ve+^MECe;-;}tik!~$|ZAuMrm7zZMw+}z$V7NAY7(P_56Q(%DMxN9CSeI78h`VD3KI6!;oapi#ii|muy=@>)yN>k4iN7S+GMNG3)ChN4FOu3_<1S+Ol%9F+7xq@0ZgMe8YzwLG8$bpU0G7uhtCC~|7&{wGA?|L5
z(vAY>4t*#P?x>4a-(zT(k?+*b)JJ-o#j-_vx6b8|Z#&Cq^XRD|($-LlrT6dT#lLIYcqa_rriHJgH+(wfyT7#Lp!gTl
zgiI;h0!q{(-gy@>yJ|@3Doozzr%?ucSJGamoG~t&>0?_n8&5GCwnE;JjJv1E`6N(1
z60W{jOHMpxmdsBYj@8(D=qt*?-Ewks`o9=FS6vqofsZf-DRcaLim;>32XYCr5om-}
z6A5NQF}2wx5S767PQ4g)Xyx`|L}$oDYYQwrrB^Jyd8b;Mg!M0J!=Ht#hZbiq{l&!}hOwxM&+#cg>3aB$2a@CEaT5LCZJavn
zJWiYsXb++nSQ?tVH*XlEM4_xEr=VU$y5m7)9NMN^wDV~0z#N<24ia~@>p3J7)v2M)%T7ax
ztz)WRP8Z{Fv$?==`8R|yr%nt>TgHH)YA>%A@b8fFwD4QvtF)N(xAGwRu(El0I0#<3
zD`1;Pkgiq?H#{$V}Q;M5!V-~-JrrG+@RuiaT
zD}FGpomBVz@2^4m)t&(3u2HVoj1MUbLRu{b{bCf;jWjy}aQ$jwGHiwa6+;QaAxwICf8QX*&aY$=qfrg~BFJ3_d$jtXu!zUx3~N*Kp9Fdr{E?o>!&cH2eWfsG
zQCA5xOZ{z2863nJ01p^tvbh`lU5_sDh!Ay_k|j7J{JWiXGx8a|Q&S*GniC}vt7w@C|<$q4emZR%#4Itj*FCQ5I-ZI>s
z`hH)1E$waS5X8otN60Low^G*ssLH{wj%%r)+aZ^9gu5H2sRz63@akZ=QwY4{602?k
zyMy^TBkc8Xcl@zvEGqo?i0p@Ed6MJ^bJtAVSWGax!7MS7%35Ilc9+zNzeiht6WRrb
z{U@|h(~{)~mS64hFGk4_Nd!`#D&#)}Vr=jsM8tl{nCkDSAati7x5+iUc|_=`IDAR3
zmF+Cm3%WnqQ&%ae6;vz)JI?h#%O|7@L6f;%@oOoB%$gY4pc>1cQzB28tIDa>9POfV
zJ)`0=ar+6+>^>oG9291p7C?2P6IipLOfW)vmnQLsiv`car?wAqbvOH;}Us1(I=F9I$5q%GJTi4t0;R@L^vhfAWHvOHylc=%dP&KzxC42-ly5S-8M&-CnHy
z@HrJl)*dScXCYoL+}Us)HInL*^FiCPP`nuREGi>ics%_$%k7!K6rIA&4Iu@jF2rv&$c!
zR}
z7fj+P8wd|;AK8;`(}
zW^5sTA}1YNkj|Phcx)Gw#}3;EK62pfZ1bV)k<{@%n{ii#Dkga~T8Q5g2IbA@V4q^d
z0;R>7uQ6jE5VKxP3*6_u^ICLa-LXr2~JP@fpTHRo$wxv{+-3JR22#U
z8*E`H>MBfF*|~6jm=D_y!^wgMWy&
zp&Pk5^)W&+!2D^flnfxrV3HHA8$d$EB7tgHr!P}G{in2TG
zu+CA>lq-m;)eBRd_4@)DJvvkVKi=M~H?AYu8r4rBAmBdS(|wzR2AlA0z?RfLMq4dI
zvb)b4Q6ftek2!S}XZHmmDq;l=@zKtu{#
z)OO|;3cTk$XyCGU3OwFb@^99IUUtqq#m0>K?Fr8}h%vm7B$}?l*dGe1FW#(9VHVK8
zt1Fn!WMH(^`lmB_^d|Z6L4b!dkMwtqoA2%(9z1*|@-N>n*Xx_>!;T2A{2iYRxzslv
zN{a`?*UhP8;%4yT9X|S&Y~}P}8}_^A
zf!AV4f(O@r<1Zb2MSM(zckrmEz&k$fpJ@fAY4J4ns#n9v2H
zkOJ68LdL+|Fr8_YGw;qg@jNmTra0GE{7PD2fb#;f(61sUD2Y2>?eL?D#>3!x%qeTe
zXo=57ys8LRu|gA~Cszb8P~|-}1qGO=S8$spCIiDl;qqEiW~?YGvV%KcxLQpMxV~$A
z1;3c?T{s}iiy=(#_51j~b3>e`X=fzO8_fFq61>xw#J{Cm|M4-*Gy1K)kHwRbp%0JI
zYFnS?84CivS`NE|yS#6%ohGgkQ>c9@_;1JrhpjQKhpzL|{R!nrusUWg`S8BKxw)lf
zFl;%Q>$Vf;1yW%WXh2118zBwpyL{0z{IkOqqBSBFz#yG~KJ3N+KdiZh1GMcKS)1?Z
zLhqg*c+mzONC9Mmy`$`kJCDn*4jzP}2e9c4=HL{K9!;MyjUINK`xQQ7o#CFNKu8o}fYie-AeAmH&bgP|k8;?h`CG3-RhRIZhm*>x9)Wz#9Q5WnyL?A3K
zbqUwi9>--$Av~kr{rJ6n$S%ZcdOd-&H^h2fb~{F4K(I&3!8E-{p9l9&80_8E%QneP
zRD0}}6g$$cNDrbNRWvEL_^t+_ARx*h!PSu3
z;!blG@Ui8)7ci!(SHZlswz(j~gkV%Nzf#;}HeLdk8;N4A+v%4gEz(t5nLYG&rtOO=
z4%qrQnT(`QhQ)q_lsp0U6ZaV(keDF}5;)-0+%d-tzyYTHr!DVEkk648yHzG6Ss(Xl42|Ss2kZ^W8~&
zZ8KTZkAIO?4hx9I@z>zRn^IcV*+EJT8&?~5)X&KH7uSrsVx>9~al5&{T;AO+(}65Q
zxy#qAai0_&%4L&R9EL{%(n4h;cMu;@C-qwiQx<9eELdnKkiW9X>3O119pJq(Fa)y5
zvvi3td`o({WeI%zDQ+trU0}#*)H=Jwb^7K|U&If~btQ>MjJQiQPaH83N(^1KquBcg
zK}QQ@w;G2E&Ef72u#qN>PL?Sm-8m<=xmA-V7-(-r+j4#;Dt0-_!f$2FPOCe&?E{(L
z&}a^N`sHq4FSRXuTB6F;%}cM>Ez9wbVUnxVvQM3-&r&K`#ZT%dO%?d2Hq|!6
zrYbPC>InKE8DFb|H*MOdmca-y$i{YjMctcI3T*=A7*jW0`xJlFqnbZidrm9%Xd)|o~R@eC~)ATBPLBHp|T(6AQMNz2D}t_p@0DaCrDls8_M
zX{EFfqTm9mh&*nYJjezMLc*|H6tAF8eQ^!6v2iXaL|jW(vT96WA0WXcA#XW
z)&}9@+hl7eiLI=FqMxpsaaW7Gfm70QJOuzFwfso?lWttwJLUg~9z?MXq=X=Xe6
zN)x@)*%=&y
zwIGtRN+n_!#~=a6lXnDpKx>8sCDY71blRdAAH3&^#5lV69scH4Q(43+x-1o1
zTtR*zXm|Er!4~=y6(ABC1UM4io26Je82FH>eBa~C5X_t-(5!xzE1>UYR>3N`B9e3X
z1xq25?r*89R5QjokqXxNWY}2IwTW4fu@2i>6HRTmu_}g1&T*p(92q4XJ0@G}fo^Y>
zPK;=UYNK83J!X=$hTGN%5#fg7ivF}Qpn!%}u%{ZViXIURil?a6G~36)1`V`&Zx4A0
zy-u5X25rQQZ7{?P;;vm7?=_r)NnnCA(D#fQc*d=%e$uMyLVzZauH)UKRtX$KIlSlR
zKOMvBYcmUXL?8(D%X6SEy~MBfew^b@2Du<2fv^j!(qmaUKj7{hgQ$`b6k;MzZKT)m
z$MW+l*vrbCj@2nfr1w*@5V0fTZ)huROd0Vijh1hsLFQ-Uf^WzJhsXW|ksvqG1Q3Lq
zmuSJL7JpS22i&7|7GgrhxBE`6D#}1h640B;yIYV6^zqM2K$RCOvexo)vgS+LNfHJ>e2-i=E914e)1@M&;F;S+gc7Rd|=KJ%JL2hr@CYq%&aS()Me870F-oU8V|b
zePWcwe=DXyUVAGc?I$0Zkxa5!D$z>QMh#l1x*O(D1csXe1vXv^)-YY=W7+Z5qrJJYE$3kyAKtxE(3?aw2s!jGggp}H=dlIk2{bczeEu)
z{-`GJuPn5x36l`inBs734Jib5N8k`73m{H@{vnYC%G=eR)^i1>&M64jfpKSm*Rr=x
zQw9WE4=gV-8g81j@&4t*{180t28xZW0&Q{HU+Yy)ab-M0~SClzbJYf#I_e@Gj(m
zsA+jq!|&n0x?7y@y@P-M^ltC%^1~8eusB^#vj>LU2?Xu*B?P-b!PFv{eV{8ayo7G_
zD%0JEDp)v;;_88K7^-SOD_8^^B7S@vU-vR0L8c{>LO+$tf{-0(dy|!&9yO%{&`^7s
zs(WZrmnzb4w^||U>8d2LY3cx9;6u8ZG=td`i|wV{?-?S6IUMo+(er5WZd`+8D|sOw
z{f&>7RrvaH?xmBWhUh<-Zg5ht-p`ZoW=GaRJ7P<0KYA!J4RQgB8zaa>lu9H!TrD>M
z=TUMHcwzwRYgY>`V{hr{1h3wBvHrfX1I9oP(&KF7PB97G%Rs~hoJc#Dd7UB1kXwmR
z0W#NsKVrj>>;vvUC%1RShvwIk5RSS+fn+<_R)V~QyR+pl1B(Kg14wam`kI6rr3`K=
z599l@!Lx*jsG8+OMAd8~pe-eIe%~zb7Fob94E#jZ6h=mkg}QIFhV!fZz?#i-hv$aFJCM1B
zvJV;VpRR!z1E@y{`B>-Xkynb+BmO?Nqfq$C|CK!=bNJy6pD9M)Cq=Cmzmm2j$|w)Y
z+F-cxrR2C8t%^uhPeOJ;>sKAiFLx&R^S(?pe^Fj~s9Q(0v114r`h%E+WG0dAD5d2L
zcTTZpOnoN1$!Y3wyh3_hX*I06bZaK*us=j=>x3x-iugd~wgVc54QzdPar#ba{Jy?E
zdwBuO=wSY$(((Ev?Vof;yjK(cmC8^3IX5BR8S?>F^W{Im3|Ml`#A1_Wn
zmOl`^8=6eY;=(7LZoMXJ{w69CqRt2yM%El+KycqG^&9^&;KCw%pMutcneP|L=$m*M
zq2GvKhYSL_41a$pSJ<8;j|IJYN0J57bO~u7832W0p{0=#%0Jx&@jb7Jr?p)OYUB?tc({`#kZHDHS6nPkEA-j6Vumg5T)fLwb4Pn}kn_$DRI5geLj_
zglObllk21+Te*J@jwJhlNkXF(Gp)kJAGHYkBdvGMPAlO2QR{>nvPtVoCKdapO6KZE
zlv6-F;qSUU4v`*{KRx>*r~xh7$=5$3%Xv(yC{!bsZNvzZeS{qS_~c6Iegi4m2-!9rEbMoPegeVH^9DI^~j$g&k?o;pDzrK2>|0wl8##yv@c
zV4#=nnc@U|B18}RD!^h|)YQudM+_wYYq|JY-2rzgw@nIJ-d-+F<@1?sr?FN-$TJ}P
zYkO_Ajr@-|uO`dRR{4akzK;%N;W4D7$8!YZi_P%1Vs|TNw#IY@jXV01;h9ip!J+<{
zc2wkLOsYJ5CV4MJ`ok*ITAJF2vjG+|k+PYa*;{U&%~P)`kYRlf9!UMZ#nIJ#IqdG^
zQtRpRlWlxC>=h<*empDRcdOxK8fb0%V01<2XayXaGmJ;;?BXMhtu-#3r=ytX(K!+
zRUE!|a41Ox4tG{WwYZ^!hpww`!aFw|!yWFB`(uJEOX&q+JYi(Ym~ascA|1exc27lR
z0F8%DQyQ^MFCeCXew5&UNM}Ds%f7Jd;y$8y=Q2a0=%)QpS>0U#UllhcLA)HS<^oe2
z&C+??K_vwcdOiz3;ByW~<_D~%4`<#cl0c!GX4q0m0@;P}i%lB#{ef_}>ivbUzc6z+
zJ5DG(1j7!Nfl@W9!W3jmDw=`djC#(wT|+Th|N05raE%=c+obt12IU_JW3B@fbs8ir
zVk-iz2?NM7az14HHY+RhEC6;ION3m)&JBnHW#LSrD&+i8VaG&&y(Qai^F`Jop6%kDB~DmDE%{zzZh|%g_M)sC9Bmic~^(s2+b1dK73f(j&WM
zjeDr?gcW3Bpy6O&y5{8zIt8UE`cEkwzM<18`(XbGSO2TRPRQv@5yui>cV<+-c(c0W
zW?y(8i4BNZQdeAn0h=a>5X^ZLo@HAAe$Y(a#$S0ny(!DScQ=q!bFunpoo>P?E`On}
z6=mnV{95`1-Pkb`%KphMBu5iV6dqY{MvAY8I3QL?-5A{h_Jw@Dx)AGKngt^!ww;_%
zDnbhgR_SyeBeZRxE0n89AMi0JF{y||LG#_Gw#)oXsp2e`moGs6vZkM1OqmpH87NSv
z3_=QtzK}aadceBCqtD%I1An0$ix4A!VPiZL;eMY!l&ud!wWYxK`WUs3)+@|Ay
z{TC|-&-j?qke>;}QYaW|qefHgX(R3`@S}<80%>W<8(aOw(+K9^v|fq=!k**Jo$h
z3s8SNMhs?5h#>`HfFXL;!-p~?-iwchV4SSrS+KkE~X%drqR22~DP1&7ew@
zNxQea5uac=jBFx{kz8CG8d3EbXD-BGNsQT-7N?on9yq{F&L?A4G`cDW9jYquZ{}ff
zGADHUkRXwkhpB1Dt$dN!tdR8;0wPSoxmYpO~T@h;$0%8CgrjEB*o72Tl>W0i%&`P$GQhU}R3P-pC2$9E`6^GTR5
zF!0`{G|+gOj)p~($$Hpi;zY9ZyEgI{a%1*FmWj1{eEjD9{|ZrDoN=XaU2HQA-(URGug%u{~A@qePOv8n<57iQ0^hNJX
zF}E<6VtS;oqISJ5?r*=wzC_nw{bqi}83^@=vOAY|u>UQCH)WmpuOwCT5ti*-Ui`=X)q8#bb!NuvT4SEqBBi|-6)s$Z@XjkyVpD+u4Pne4
z(fbG32vaT0t(1%JI0xBn=U2$tYoX7NnB0h9b~Pe15gw4GM)AMvhb&9740
zjKsYyWN00=vNttpPu@{Cd9Q5oMN~9#3Z@rZCP55YMW**y#$6Rd*Oo*2=@J|O80
zV?eY7vfJ!(`Rvt5$?n90Uj{@z6ly>?c_l`b(qL_w0x93US2GB!Z&jGb9X%2Kw6d^o
zrK0Ph1c_yZLf*`!G-BxJR-VpE%7wq5T!V|>wsH;9Xsrc@N$zOHCH?+6@!v2BG|Edz
zy_pO(u+W@xd=u&JoaCGNpi3vixO2*olBPoO2SS@U0Ccl)N
z;xVNz{-kdAD4D-VbeIc^>{PSlJzldlRktXm1xlSdeJzG#p58`nj$7qKWa+5^&j2H$
ztWK8OSdm^w+T5vWbpK-MWf{xJ8vWqF*9CwQKU-Md&T9-Iq6ZKW8t>q!TK`6r1y0vg
zGsay=FNSZ~xawnz|w=;jub|&R|
zQ!`~LP}CgY8cmABHhC{Zk0(9U9WtR!;;}rUauFJ&wJBR`)u2=9<+P1Je%imERL$Wj
zM2hSQQT)-dW>RXol3VCzCeIx(q~&p_Uq`x`?{<*l&1u|y7zJLPO5-@W@%q=7=Qp!w
z&n;B&3*n-oDpmUUChl{1(>qbh!4*MoOa$QITY=tZ{$l2jM#Uhooy|~G4|K&<{0FjC
zn3FiYiKn$2likq(YOo4w7D4e_#I*L(>kEU_2Hs2?@Z4?yiCHBzbv94
zxx+rMfH|LuRAWqpbRyfESg#v-2x%SJyJC?4_wq8Wgse85fRI2|1dy6MLNFnwsIzVr
zd{mz`b>Bh{FgAzkR%chVHN@JAexfd2h#>pvkg9s
zfl#WuxFYr72Z@N(rI(oymmUnjBJyvfZrYZNyZQ>f@PZN4IW%kBU=5WOsu-iksO;c|
zfF8!~MacC?RtZl>ztRsE;~1M&8lOxQ1!bwndtlm_8XDI{IL$c~?m6v?R1rvv4gw8r
z;Y67OVnLGs*z{`k_z<(?fh<<$kdCkqf^Os`WDt}HH1l@Fzr6yuGO72dG+qT7c0%q}
ziem$MwmXyxo(;F$`eagvmdcq>XtF1%CKW8sN6(5*A+^CEluCHu%f)jF9{qjdbh`#^
zp%y$yyvzQ+hPN;(J7y+CU5!=HDG4hE-3;P8Il0hU=9A9lH*Bp*Nogj78~=Fu1K13b
z-&o9}T|OB>y<|iHU!W%yNCD6e;}Zj*!E^5gTAk=|x9@X9UcV{v`booXE~BC5CPbk<
zrJ*cwk{KQ!!=#*IHPrd2$q+cdaMLNohB(mh^(^F9;JV2mp%(?Bn+b-)w5bG&a>E@U
z;VSD3K)9AekDwI15=m4cVLBvkJAZe57k-iU!c23q^@`9#k%Y#1sQ@7KvMLDK0^T3E
z3n+yDW{=1LO?C){+^Cj~P}=e#XP%JG?E|Tr^oyR5B+xrTI*C%dEp8AI>%AZY;Zfsy
zp9c*!)HC}8#%@0r+&csWbJWO>3hpJjReX1iW8D%8b=J53+th76-fx&
zxRMzD?P9gQ`vHnZ;@H;{haqQ7DHS1idOTVgZRTz4WpY%+TX95CmEc}3>Bq8Vjq^tS
znI)Lvgo6nGlYM;ogc&Gmmw?WRfu4nIN&^jm4R%krS4%j2iyT&^wJWl+Wcp!GwF+@n
z=XNc!7ok@)*k~s;#Z95r)3u|iMGVe2AlnC}`s@X0m3gmnI_-SUqaM6Wkm>`Rv^RH)
zORbsUgmb0ZaKFsFqt>LEbEP>y>WvuOGD%&~3VNjF_ju{`06=ySi8F051
zA6al3nsrY|cR_CHX6kKHM7RO0^2v|BuJGf-OOX)|Ufsk01&V;Oo$%0UVdTk&Wl{nW
zOC|$9PwQhs`9x7jyS#bSG-AkF=t4xSiP_S?)wC`{ra~;`+=0$lSeM)J5u!*XWN3&8
z8PkMEBBVDk59Xqg>uVgbN%j&*t!59c0rvoFzqnt42ooPrxLj5^j|zQXhK#@!zUcce
zU%Fmgg_l~Ss*M-5gph&sv6s+m9(8n_ekmedTRmb=UWAZHOoLS*bDDE7u>PnxjsNC>
z>-H1?w7{}zu{YxeSHvy+8WR1$3_{!@Wei${Hk3R%MVTC;=@8C?XLKM)F6b|eIW;_%o
z!;{}`kXTs8pXQTgMu2y)s-7iD=&SkTvn4wMn~T~>KQ8Vc%vU(BtZZHZ*JLH-?vJye
zvJBC#{OVa)6DAPdUA-#pu80U1x3`z^o$e-Q!=KxvS23r_z%ER5M4gr+P7vzB1_zgXMH>3I?%;bpd+5Z||r
zlV}%yLS)W-x-MKM+>GLv&y4`d+QLZTFuea684GRNs9{lY7P4b@AuCKL^B?9ctka8P
z%A`@OGK|Xnkt*YaSzWvbvC_@;STMa%w5(A#yhczD|4^V0BAPL(Px)7SyRAI|nnpNu;vH>b+&g3o5-Fa~9^R
z#VbRe!dMQqy2Z<6{mP85N~``nRUFx#T92Ok!WxpoK_{HvtuB!cNVk4s>f=-?#Deth
zDcl{-RnU06x&9tt;}@{_ygJh~g|zQmfk!#H{TR!g`F7PKuk)CykmgF_CLH$EfTu8Rl%A(I7%OJqeFmOFTjMCoS{ltl
z5!D{X2Elvv8_6Cxi~UC>k|_zf3R4mJJ(;7TF{lTJ?d-S*E$Y-W5UT#&7zfX8lJoBU
zm~2ph9~E6-xuSW4dQL#tpw{vY#Dk$=JI!F|LndVi8p$B~QqwN=|N9ph_JJ8+a?pe+
zO@5Z}Z%>sbJcB|DM^-hV|0~pREqTnN*VuNhaV&3_5IOQ3u9s^t%C%xljRg|~
z-?f_$QbD~iztu=)Xe<1Pi9uJl%9N-KYWUR`^62f&r^V%4d_s>&rYruy{{pntB(FxU
zX(1J~+|x~*f)btPiACzX_|fTpeSdj(!8@2zDPmpWw_Kytk{c)Nw?9n;lTQZdLufedqTCHwY
zua}GUJ-*JtF+W-I379?P(LjRS232Nh+Ao+-3hFi?4T9qV%oDzMwQc0Ad&V=USafYN
zA_HgqX7)g(WMA+~I@C$4LGs(O%~02Il9!N`5^kbWDLvyG;VsmJUy#GhOum#Q$h~^-
zm<_}v5CgHw8yq$6sqmv&Djre<^q-5|O6mSVk^Fg(w=x*-F9nWF=$1kzC_hC$_~fae+4=I#
z<=I={Ik%7%3V*^>{(ik$(~V@%;Rh1nOi_BN=4O(@gFO9F=mYzDP`vd`%enk@d)Kbx)c@C(i#36gav_Bv3^@ne{5
zTP2k#4cE)Eg_=Rj&7*(n6&>#y!a$-?oGOx+_Asf`WS2cVr+W
zfStR)-7b3cC3k6xB1Tsr46`eIs0#Xq{^|Lnbw}<{Y<_=RB3M
zCWySW?YVg%ouF@6s(Ul#WpCoL1~lA>2UQz|X_xSWr#IJ_QUxtF(!gEh2O}j^;G_Lg
zHHa-vQWSC+0F~B!L|vr-UhB_xdFiW!d;5!mp;$Tv||BB_2i5A1H-jOHCP`{!wxQ%)hnt!xuLJSzA$JA<~?
zRHrPjOGeqF#DhHb`=_c7j;&^{$=1o!$01MtPl_1aX&|;QWOWW7`aswbFM$**fTfX?
zFzzAni&19SSp#|$nI<6Q)WYlG!p&zZ<;;maERT(wLp*4>5QYuTZ&sh!4tqA}G@%_P
zu)^UD?UGT1M1h73s&?=Nt0r)du-NJqqbfA=KG2|?W1=C!G)5{kJU&oyurHNJSc$F~
z_?tr}MjDPpgP|E5*dYDqP=_@1*+I1P7zks8y`y_@`fV+l8vrG7!1zI?J(ELN$q$(ytspDoI
zLKY@h))cVTV+Cc!hw<9-p!sF`&RGfTA_j4Pb)q3dT$9!;zX~9>YPefSayzaS5o|My
zwVrrqb<}R!;(W$U|EKH4>J$BhsD}oLR;-Oin1)^_vD*9a4kI>7OlWgK^~@nF%4pW8Yjq*~&urP;a`
zGihMyVhBwqSDjg52N
zeEO2*GkcPo%l~A33#gMcHYSOwtfB{LZ?0+t3$cnD_&~F2<(sKHRI5m6ji90?8|0*I
z9{CKo(@ZyA}dM-4J38Hk5;$_|2m{4#RAkwC%t9BV>eW7*m{UV&rnzOS>0<1J=EU%>Y|`
zQ-OCutT{x`06{@%>@vu1!d>@nsq};u7G2OoS{m%3nE1+4m^vy`6H@O+MndWHjc(~+*v8zUa{U4-bu6csvjC#zY+nl=`i#~Hq9|vlI8O|{ECY1u``uI#S+5pxJ`}QCxo7Xu+R2;1)KZ1t-?Ds`I1=AknHPjTXCf
zY5jjc+&__JxV#K^lPIvCS-d4IWcj|R8s@?zH)JM6Avvncl`Pi4pJsodwx;ou16~@H
z_R3s>rkq6adXB=WPn%Cu7Ail2unoTUBAttH
zCG>F&e!C~p7QDYx4*uVYZ8dN3T*3-(m|ZiZ#~v%zT)HK
zVw6Wy@s7of+br>eA*W#Is)NwpF&i|}Z_?Llx<4jWReH?(k5wPa_2ICc@8#=srK1wB
z4TYn178b7B)pZeFnzh^@QFFz1w4ySF@rMWj01tuCZu&g3$X!&a^!Tp3uS1p_(hr~~
z)Y!x3?yrh3jkONfNJ-T}Ro~(>PgP}2u20FAme#V3Xo|8-^>CkJFW;GBH&sEJ3m`G?
zBZFDX?h^Z(j%KQ89k{oMP2K(t%!E2qdPQy2YMw%yKUL^zg4?p=0Dvp08kwwQV|6-B
z$ZVJT?rH0)1=k!!nB2-3HMs0yDpiDp(5CzxVkgYLBSQ`R(%CZd+Nr0@>sP`pT19IC
z-!Wps`puen(B2;aC~WWsC<-l0VHZ<&B*l7DQlS%_5J^vR$jy5!jziYfJl-Yh
zDs`hA$P?VwgqjiBuIrN^(VZW(Z8~Khzg~$L&OcQdIx+r`4g^Oz;H^hCjZgH*#XfBo#$u7F9LtF
zp>;YBP@X!bj8`Dn9Bp?kgEsJQNHuAV6)D-WA8DhATD&MQ``3%x%D<4`#y1RN4QB0|
zr~ySkT4nx
z?FNq0VQDHkxc3#gQVsfev>Gxmb}3m46!C^&uuQP%%P~V>q4vA`_)5=^BBsY6kYS@g
zxX#U_f$(W~PwdDYnB+bigJRLe(MqdEUgoQJhs3yTF;
z9JAnOTc)`F<-~c+n}%3WTC+R{1k`I4%^7kHR(?Cj@Hy+?$t~zbF7JW`AtU>oc~Csi
zE{v1_xbHvV6OsyO_;9&6Ke_t|*YM5t<)@R2^@%u7X|f=mgb%Nu-2IA`Dj&sxZ!WCS
zRF-xdK6PRHMMqN@?F0;H1N|TwsV28@7^}`$h2Cw+2d#=;)|h)x&ZF1gew%WxXAkie
z4EOUc&zdVqi3yPreZz34R-wTvfGTu(qs)XBtC?MJAt|gPH_#R+OWtc5;>Lur?C%O8
z2^Xl6zBG@#8*P`hQ#(rPa7-pOsY65;!cD~#T`c}-@w?xV`d^(=qUq2PoMUcyJg{d{zWmBANa4Aejz>Y9IqEp_Jcc~72&o_v!>V$~3slP-sC5;ee
zT0H|r4<;>)4ij+DB^J2tYP)e4di#=w@%CVi^{=AfOe;sx*Z6M7BD7nH+7Xc7f}B-K-{`qdrVks44J8~7X`9CLdl}~zuk23plSaKl{R5Bihj)6p7Z#PNlv0tMr6%BqH~3`Agg*nM}ba`YJAwz7-++qHrMo53x1FaS~~Sgchr_
z4Md5ubyZ;y%E?7HkF#oT7yjrMau4E
zG>OTSY0^b(r)?y_mWTmzV#T`0Yvp-IukuPP%_p
zuPl&W!58A%s|`qR;&0;C|FEQqJq*L}5=
zMf#F8jo^eDFAYheujk#k5}BsN%wVIi??x3ilI9LOQGHvxI@4)5MjpmMDzAMNES*lg
z^n5O^L^Xt?cc*C*Wt?(a)i%g*lVJ5Lf|MU~h@6H{3`5pzo~Uu>)OlN#_epIlB!B5V
zoxN~bRYV!Ewc4zQjv!8aSFs)PMB4D@+?S!^WIZNBOkMDqIT1lZ_u=9&83W#@6M>$b15Dl_s_K4X?{iB7rz1W1NPZ9awRodH;ZDC`+h~S
zSpD=C_e6_wC3NU-DVTL&;j;(YdG0LKt^k&`LGR-T*+R0Ivog25ih~Jv1>4j30E={PpsC
zpqY75Zw2pRcoP)#9M1l$U$m5hRn6xHW8x&ER!hi*d%{c=epq8B~kU
zc?J~+9bHIa)24gkK&N9O+LkaW`)+VYUC1!BxFC0Bd;46Fq*30=Xan
z-Y`MC$Z0Fxzdfsx%}{NdDHxUfaVqbHv}bTaOWmq$m1+7{%#*`?ncCm{kE~;Cf~*X1
zj=#z8b~Nx;NiHcadcHix*{FnCZ?DfZ_5n+InFTH7
zZ6RMgqT3-Qt|XZu^&+<^A!H#!U$ON87s&0zpDjm4ugPuaK+_Y)`qwD^QBnx|ZjR2w
zFSuwVf1pGE*P*Ss8V`;*xp8SN+r3%E`Icq6#+%ERM04uErto6|s+ss?Pdz*0{xncA
zc!(FZt0uKQ^?r|l{&uM+`<4oXKwm*^%p-8zry0y4iK$}X*R6Fu5KgI>ZQn>D5S*T8
z|9cNCw#3p~C9r)eqm3KTmpNyMU~Wt0X8(kJ_6Auf4h*JN%rM^C1V7wL@%`)NkNlq!!Pge@dQdRnC4xVe
z1kl*RP*PMOWn5YWs+D3b4>>hzTxmPO3NqB(7XvK^Pk6W|TqW#+Q>HC1PsIPaW_1!s
za-d@W8M~|bqBF&|Q7j5cY>U@}T*NHU=iTworpx|VPKJcQKx*N|wQQD3{v2?NLA9SD
zZB)Q4k4*nfL0xhEmw$4g4Qn;%D5c|TKu!=TXr+O~zOV@5AVT~X
zLk#W$zCLAz>sF2TxL6eqla5)6an14%!=h+66>tkI@$&fslxMINTzZft)?d&S(2*b&
z)#Xcp90dU~DEDw*$^|In?-PcVYS1|RK*52Sd~9Dwp#ze`_6V9LJXGSvK8{0sN68IsO|uueSWa6V
zo(p0v0pL@%&ZyGVXfL(Z0aPfCjqv!Dj#J%~yLrd@Am78nYWH5AkUW)Z*3G
z>biZ8DkJzl*w4UG2y3YLT#7pCayA0#l8itdT?HMvR^QRp#{%`}CjFaI!Gp^u4r90KTIo%xG=
zRHDS6=(jTqL2Y);AVkWIvNl!uGwwge^kKFmFc!gCD5KzUk>g{DkwoJ=mcj%b?)(me
zIZ#|LZFG(e=)}86UX2MYyt)-FoXTJA&B~cGWjr=4##pq#Mp?f2cyoh1*x9ixQwKW+
zNu(;QYV%*flSce`_eh&)kHe$Z2O4J+9i~0-t33fq&0$Bo7ZTZkW@*K+ILrYro;)8B
z^SNhU!+5ti>v7YX-HoQuo%lEsv>R=eI+7?=B7=o685+vM>YTHMG(}&Sww2GwVhB(^
z65wv{K6<4s(x4*@4wm|+FF5`ajr4@ffWA-wZ7pvh-3E7+5Q=qe5|O
zY(s0AL4G5u!eK|F#5k|C6B3xQ6g_0Tuqg){>
zWcb}LUpmwP-cV193FS*mR3gWSilj{CF62dRHJl|?V$4M-AOi_BO2CE@$0UPaTA-j*
z<+aI#8(wnCHiCL=xcCbRS>-}jDNAp5bBj#+t%J&icB4MVz
z6Zr5>6ohE3M%1JO^`FtK#6wsp?>xN53$a+{@pf_tYrn5#ija*^<6ZTu`5osMG@tdr
zLRkAt8LjtN_lHC}*q65acgNo+i$H>K8txmGM@XPV{K~uyA!QqsJ`*Kd*#}Ga$;+8)
za8Oy6I-(p*=Z^N$XJj7a=>v~GK4DhD%Q0*{^`Q2Ga0|Xz-GF&rfbf_|yActxM|`Kt
zK~AoVm??E=lgm^FgL_XFa-}(lNb})=X#u2T;y*+^lIqH&9il
zIPAXqe8v`}cVL`drIfJ&!#@-to(-ZQDi)2fA
zwsv%l$ALR7F@t+uGwPAM#)8on9vp>`ql=$)P*
zrGsp5k!?F7&nFZg&Tzb~UXZHl7j<5{g!EYLkQ`OUS9g3+yC?*LDD#!rts>P4%t#9xHTD(x-5^7*hV^)O;j_8fV^CGhDLzZTg
zVjl|-KWl&knF<&Vu~|@yYh0!@KfZPN2rAbR%Q<(b$I+mN72_N^l@3>|8nI@BMKy=_eDZuc?B74
zwJzKzw{j6mdDF$xbZbZmn+K_`I0;(cVw~Q%0~Er+knl&^6Eb<&@eLDU7TC%#SOVH1
z(=iMtuW5xfv51$?;ripAc_4r+$LH8V6!i;|KC#Kmxz!bk1tG7fB=)Kp9>apXq&tfK
z($U3!lgCB|#0)neEkgA90~(F6~B+L9Z3u
zt61IVxN=wdx6&fZOALZp6cSLETo-!CvH3cKY}JGKBb=IudBHpOS*Qhl{z-L8z(}3>
zZKW(fAi3}L6;9tQJ|QSQT(t&W3wXo#LI%iHj;(PvXP}h1l`Jq5kJ1?;tG*{CEQ8Ne
zIM@Oai+FSUgExjdVZ|A!oOKBTMCIvcmL$MHKtW!Tbv%aib@Tbv5G)WMIf@)1ul-od
zo5QXXHCT@d2?7bl?YxJ>87^OdZT9iH5^dqB%!UQOzbWIy18S|9subprDp2Vycp
zwr~P+(FPgdz)ORx2u9m-H#OBsaa0J9S#NW|yNBMA0<1#dtZj;xPD;VhBwbl;97Vnw
zL3K-MnZ>Qju#V6Qv<17lr*kgZjn4R&M7A>ejXG(9%1_$&l3zVxcEWex%{CP>hzzWL
zCl@w_68MZ$(MkHE0l<{dgNXvQxyZ~SX03so$%wTNDp&>zy$}j0oU{gkosk&lFUrDy3ixh(
zyQV1qo4NGBY}JU4s@Vu7k_8lL{($x(&eAG3fOrs+z?1`_6D)Py?miI7-g_{RAGPv*
zCrN`I70&nR&N0R^`>V9v#T!u=N$L9%V>!n82LyY^#~r=V#q}iB9uNAM{J=(%KQGOC
z+&L1Z9t%uldfaiU2en|cNhjwug$m7HEiz4`2PISAg>l}l7+S)SAXT7O4EPLL#F^is8sNh2%N~VW|5GBV0M&05S8fp_h_Kt
zN=Sk|2P;o8@dewJA($UXyqDl}jU}MKVnY>WV?YCzf=b?G`>KMDc`y8Ej%yy4{Ihc0
z<$~klNl|1tM)9`8rR#&1PqMtm{HAG86z~Yq(q}LDPzyNLRsF%?4lcf>dpjyViOrQ8
zJe_z_tNEW_v+I4h`)pf>PMgy{2k~|d++e>XzPjP1tU`^KdCyor1&djIeEjord7FyC
zr{}YU{a64?4lD<)Cu$e3JF?tYl{ez$i(J1(q_0_;FXOh95>oWgKNz-8W
zbFZai-VjU6L2u@q1g)OjuZ=RV3#p-kAMP*9r|TE#f|K$V1dTeAI?oqK
zFz@BTj@$>GQN?H^xm{hgptd7F9&z%WAGv--DfF=0UBfl0MaBz4GF3jFpuwc5RA$6W
zu9ta?cs_-ErohWB&3tvAg9%S67t9eq7Jwl?oLxbX&Nk8CrP+(7zN@3nluVA&I5qL=az!7;
z`tIWNKgxB7T%fzv@)R$eoYn@5x>5^A9qlD!mEl<{2cnOjan#W?s=hf7
zB%-gSqRE%z&}uMETusVXQ|3GEN<^ox77w{cB4&NH=r53ck`($zGaZ=?5H1Xld6&PI
zMTmi?ip$Hz?Rr^2-F65LVdAIdT}OJ`aj1<{eXqaf0XqMa1xkvCiR1{q`Gk0q7+=`#
zjB=E1jFBBv;Ym$v(C~0LhhH+saaU0d9Us5HSVU(VXPvhwKICVA!u3#r8d^_#++s28
zP(=3Do7;lg^p-J?3n8nD%g*O2Bw`?iWX^t8^7Zh^{Q{E4W!KwHEb~0!zZf>jW%7K1
zf?P(K{+wyBU~yM|0}6&$Z)Ul$Xv*>?ZP<{W!p>l@a15W7eSZ_5U2Oght6kKX-#IMS
zKn09=7@6IHD&9kO-+H~g!tr+otBt0HQQCRQ4lwoN1?LdAHScIm6zoTb>4Mtbzkdm8
zV9O}PVN8iA$X^2l8o?{}uKs_UYp67Jg+ET|=>}7j3(8s=4xe;_cD}-X$*P
zO^?p#)2_j<_2yQY)Pz+_(mGq_6Q`>qr5#|p0~W1E%1ftNk>JWiP9#3jf&cG|tTH1v
zanT|F^Z=>-H6tCW(DKnW^lZjP2fJUY6O?pgYPg!14i>O-2&x!XOd+P@9|ofBABGS<>I|U?<+WFL+z}
zNk0rh$4v0f#X=aU^q_iMQDzD&mz~0MPUGH6VRB_1Q)s5BcZ>*Jpgt
zW|Yz0=F=P>OWId`UW%$J0}H27GgsL9CxUNhK2+GLYGan_w5d{RZMLe|2a-~R&BH7~
zQvkdtzD1H8Rs-Q7n_N4R+-zG}wBb;A5=z2LRrkUwH(h1Vds*DxUVf53OX)6yvXl!^
z3+Yl!IC^59Px8q<$d7Px8SLp~eol8&mNfm7iI7~S!Vkp?m64vzeQoZ6-c9KrFac!C2M1Pt^>TpLu19@8_@8D0B!KlwQ1mI&?`?5EXN@S
zr?q17WV@axn%BbWIO)%JsUtZ8*oZ(X%wmu`_=43Qbiz59C8R(8hVN9o6PD1f8m&#l
z-S`U|4S&0tgIq30%-sRh(OKSfJEF0DcYjMs*mwR%+mZ%~WH+Ls#HdNpEnA>WIzWa=
zLB(&-{qX748**IW6!NE13wvcS;QLRx=J2{Xr*+N&SsYm9R!jwUV2ER9{v$zqrBa*e
z;DmRwg6O_ut{D5YhUT`FBW}T_S8)f{T#$xW2bho`OPcYO*Hv6IQ8%WR99Igj@<2jJ;XERRa|b
z!f>GA;2E7634JH7UXaO9Iv{rg$$jC?ZCzTF%PDvxK_TGVgcyU41Qwg1?U4&X*%=dP
z0r@)xx;}^g?Qnot3gCp)!>|s6mOPOQ1Pk}Gz!^B$5doAK2p@^11!4TBpwJZXv`z5v
zNrA7$S<)iIwy8J}4lW+Z20#)CoW%Vmeju!mjuyfmY$zbe7yxJ_w=YMRVsaeRBiCC9
z7C=t=D(2v#iv1`U;M5_B)5DUDsb!iGj@wC@9TgcPL}*axM>z1M`li8L~irN2?Gqa6xx3;2(y0J4#uaGxlr0qG!(Dq0c
zzO=CN=xtdQ5%h(v>^xdp$~o6erI5@u^(hdxW{qiRdvYhUB!70P8yEqvj#
zOkoXutSG1fj&9v>lF6}$0|C=;d1iO?cJ#YY#Ha?(IVM0^6bd(J5vH9#`T5CRqo>C+o<8m^+lua54g{JqRp4{&kFl{8Hn$YdhrKSAcr@bT3R`j;%a`D>JLIv={YrnxdzUh&
zywvvbDuJWw>vetI4)GC-T0$V#{AJ3XPiKW+2sU=iQYDdGS)_oOHs#%2?Y--AUo;}fE(vNxDY8pbR^O&}+-LkRyic)!-
zp(1!z*0_JDA77`4Qc;1mjXU=mpRPK&13ojFpD5g_?{WVjGB;mEU04M-t6`Mj~-25#FOE15s(aIpZ6-n)VLo)D}WF<`PDo
z=99U_M$R0{rF`=$^vI(Me2@s*G(s6K3w0ZU*7ogPf=y6yBWJTtNYMB4DWo#>WQBW_
zD$z7377*u{!7m;Q%LaM`BZG@rRDs^yGM>-kcz)-!Yvw&3)x}?G7eq|Y-6`6VEHiw&
zFq)leHpv&%x$fQ$ip{QKb{
zz#q8^xXQs)Az~d_MLW>7B^{rIwGGoUhX%RsWRbTIqi_0nW9ggRz%1^NlHKXtqO}tW
zKO3vtU(=3MwXigfZjV6-*TOG0_?uYV5-dwXt79@Z6vMcyD6D|)D@(HG7sS0|e^4TxY4CHRx?eQCRv9ST%k;ZW)4OCy=Q`wRxREG)vsMUF_E&0=?e9FtXUyH
z>4q5AguP;{Zpe~C$Sz@z(ZNpgqXc7k*ZJIrPA-Tv+-`B*E`OtEK}g5*X~WV{1xaqoNz4N)}g4PavOFZR1Ij|DqwUr{J^PkaW=&>~(bR&!xJ;vhwi177XF`q)F3E#Y3UArrOGinr2YBMX4-YJZcwW!QZfgZ3WzL)Zr4w
z+YDZu?IcIn;Pf-nQqdOs`9GHDARI`Q8BF!-Nm@B+_Fe*{fm|-yk??3!sL#vren;?SLaS11==qDXsb)?Z~4qDLeXfuFW6eZl;{Z!@dhaN?hj80L6p7QiO}4y$QI
zmSLFzY{1vD<+BaGi;_F-CryY|ryZB8e}%R2<87vqt8@-Ol5IQEB%2%>g!=rQAQ!7m
z2Y4~zMa$Smtc5D5*yQ?Q2-dgGI+vICTuW5MXHp1v6^N}V5;o~@Udb#3d
zN2=?}kRt@IW|BD0&E`=f-}A=tcz_gqBAO>~a*AW?{ATqjB(=aL-!m{gZV3{Azpub1
z4uz-vZ$4D1sL9zSoi%Nrd4aB`zPW2nO$sOg)?jeKaq-52wkgvQ$fbe{wOoC(WxIh8
z;a*aZP!HUklH|jhS@K#
zo&-?xv0M|OMNl@qH`@~nN}0TkmsA2Ayfnp*kCjJGJ~a{jR+0aWrEyhqx>C!P%B2^LDEneLSy*EW*w)>)PGafc{X3l=l&Z)Wi{s!{6fxjAsSG01h
zpQl9NdkxD|&23Bl5g8I%j`%eyDePW9=B{rgV&5WLTxE3x6&&g0e0*lG%9T#zo7gG2
zdukOzV@)n6(X3?xNdj}Lox4M3#w#ro4LAiK`)udY6E
z@kWQ?FQ{}uc-?aTIAj)Hk2^(h$NUMjY`GlBeg+XB$DHiB#
zNC?M%c)Ki7CN15Th;Fb~;;Xd4s-G->JN-z9f(u8X#yN+`0w?$kLb|ip3j}9=8wUR^sXw@_i9gj*#2Mb4n+F~3f4cXS!S7uCbHm<%hR7F
zd^bP%fn<&LyH-lm2}+Cu-HkrzBb9j00?R#F+!Q6Bi52_m#&Md;V>{H9jr187De
zfJ*h}FPT@UJq%vBG=%y(5}f&uDAC_Wm|mQaZ%7bVQqM4v+6?BqKfnI=)d5Elgd?Dg
zQ=&LN7$h2!Ebgs-8X4hm3Kgg8OuZ
zDb!^fKY9lmyz8@XF7AqY%osk9jeV>W-<7=ki(taAx6u3Yh)+%qQwL8j
zm)Ga%lVfcmOavA_i%~Ww7Hp@;1N0+JLb4-?jW`n_tT`K_oay}|qBb;u%j=@Ny@gKh
zkh}_JXQj+L6lB&_PP!Xa@Cm(ySQXzduHK(5_2g_}o?Fd~gQA0{jJrq(q101
z$SK<13EQ5+OM`R-IX3^arxzl!GdVd_>F>=vb6?09=2Q#syDBF_j?T75()Bd-s)Q10
zOfB3`9_>m=WuV1QnMt-e<%iVe$c;r|x0Kk*I44AP8duljPV;IhyM=2`2zi)zhU?jS
znL|4vJV`Y7oSpJkN|2UmS)*PMov)vd%Jc@!=+LsGNSN0QXG^87bk99KbZOHPk$&R1nrE9nvZU24kpu>h+lH
zjHg27!_LS7WD8--uz700pf8^Yy`=PI3Z$3b^(Wh_apZdJT-`2n;PiYNb<-_D`f%J_
zsANs)I^_R*2~%^7Xl#Rc>mJ?i_yl9y8^ux|bkhEFTJ6;4yI}Q`6``gr``}Z0(ttW{
zspag3hfi)(k-adg$kPH`HWzmh2*C76NM<<7&E#?)?>~IFRO+|k6hDwPmLXbQ*98n~
zQ0SrZ_+@~wIXBtH8FX`O=_K8p_!1->No|4l9k%6ANWbcPwRGGTxqXoXlE6siZs9;$
z{Tt63=ryTp`iTJeEr4Gcx;u^wt1|3L{5TJId8WLzEr(@PI(zObDWKVwq68n=Kj}y&YRgx5=6wl|A
zv~)sJRxFHy3t>Yc0ON9!lulL`i_7Q?-FGYqEl`ZM%^^V}jRo23eW&g}kph4-0N5eH
z6ezTbkS^*Lzz=i@L(Qmf^GvF+g{n@jI@nvW(F(ReWH1l7$q{SNHqytU4dk=tjsX}*
z9Y|WGg~ug8&$2ukj*V5i3qjh>VT3|;^DrZz#JP1)=x!ESR9b@AZRsed2~8J4hOl!K
zdMK#(b&D)Zoh>ZfzK?ny%C)-*-S!tqL|${ucA#iqNF%GrDx2Zq*;0{+t`2k@?9V^5^Y<2Z6X1MOrBvQ-bo5EGs){-87i7U0`$(-kL>r{2wv5ron^L4@w
zIR_N<7h>=$pyv5D~XPoFn68
z&vf}QSzRD8K0jd{A!Xe5?YkNcQg1VTU4TUXIE$S}($zCD0Eqwv0+&UJ8F3YiS?uKg
zeepY)q@}kpU)>#C%ys6`-61e=cXj!ANu%PQJFwRs`5=m`mu_Y+NIbs5S?BKQh_`i*
zLbmvSyV#qHa985-T5y*9*-2l>&c%jFtgpOE)1y$(7gQTLbV?uNOqqxF)
z74}LOqda`{)88!6qt*_FaL$*^Prz??Vv>#8dILm%U{l-7e8Vl(ZYA#B93+?>W^Ez~*6fz{E*-Mgzi7yMM4qQ{hm|-0
zXjTew`!wlYrUo15jWb9wptM8(Fc-PWj(!kfUN|)htJLzgs2pv
zI&2rpQ#WwgMQ@`5^7eLGJ5(3+c2TX&XeawqM`Z_3Z1XIn@4!0_E3ic;a0BmxIfzS0
zC`T_{^;g>UFIAAIEJwN931J=VI!*5b{p&?!vjAy&bB`M26hA>8_VKNLd7|oL_=qeq
zu3GG@lEerQS!%Z7rV7WKzPMVRqc4`LHzF{48_Qnmz)7=_&@P1MQrWS`;k#7^JMMn*
zE0oC#636k)4lfF%7GKMS6s}A0c28)RAPc+j+IgGp<0C$ClaE+;m-K2>gm3xg<1sQ{
z5Gx?l6KtZ3qG?+N{D`=lyPRRD->+87L=ywaa5z^|L0-2O)JfD$ekS6&QVa!*v2L_K
zs@V1Y6>`P2B!Nk5n>w1hrnmt|T`JZ&>JU4q;U`-68h=ERI+^Uf|HMZLIr+GQ@yN$j
zrqouJcoQd*Y1ceURhOVrmryT-x6#Mmo`KD{t|N*(RCCv59S%|f0&5*sXQRQ+n`ZpA}_*i&~=clDgijX=fHhlZo<~PX+LBLu8!bxHS|xT;~+3*#;Yic
zLW4QBQKNcUpR@5a1a0+F`7s_At7}3_njSVAqYNxGwklz(M)F4hwzPC3h;k_zpr)aFYnzrKEkCE0d&h2i*0fF`c&R
zn?QA)@UAU~s%NH@ZJtXLl`9p?ah~ZaEjqHhFLfyPw0WVW9-&q)gfy-hZzo#1G~on<
z>DCPhK9G*MO0>ZUj}EBm%2U76GmBf^^CwzvdD>jy)i*&`6U_4+c;o&}j+|r|po6JI
ziR!om#xHL+Wh&Y_7A}(k9h*@K33XgS6AXG>!47600u467P6HNf&SnWg3~dk*b`LZz
z9bpmio}HD5A91%@xni1I)=EEAljVBz;lr8;f;iJ1C{fNP?)^Ioa{Vp4Tv!F7RE7u$ba4>@&H_bLi`e+6|<6d;^C;xCfIGoFf*t{MFvjH_u<31RHO>s-FU
z=rb-F%)cp}-J7>y%E07@S857<2RWM$o83f7@QG$qW1C}Wz3mt>%Eg&1Cvb(zpPeIXC
z;z~7zoy~$==OlLyS@YS6hb_T|WP?b*vna#t;vcPw
zl9i3@|GmE!1L()))h%IEdvBK?&=rWsCM6;oJ&3vSdhuKAZH6|oCm}gSTxSv%ZRcpJ
zR(sOv@ECk)N9tge3>~ekOGqIVoGFJ{ZD2T+hxB!vgcH1V{r0|vwvJAMe>h)V>q5dE
zM!hUrb#cpRQUNZ9*3F~37ibo4nj>ebstEbP$lYW1%$Sj9
zK|5C^UQHv{yuATm(>?;TfbadEmxm4~ocCGfpB7&qj7-NVWYj_ysj2AHNN?Hb26N#G
z9@7yIowQVW=uSW0U;k_wdRG+_UG_gIaNZ(eagL8;VDmp@M#@t1DHCLR9IT@UrJ3BJR>9*vYaB_)F$<~Gg)r|q6Ip1wv
z#4)74W@@2~75GDJasUb&==9z7;&%P<=5ErDl;Ef9@@{=L7FAy7BA_pMBggKwMwt4m!ztiV3>1owYc=kHZrwCPHWwSi={qLXr>|oSub56F&bnyXLmB3{6459^B8aRV
z?0smD18;RDEz&2x9?UZ*yTe|MXZ98wMp+=uI;|@tF@1XzOje3iHV_g$e&)~8-Ac&d
z!k)d3Z#Jsr&y5u=-LF=
z4nbJHisblkv0C3DJQ}V95vy!v!7n+n+}+0|DH@`6jw{zik&l-KhRz+hdDN&G)j9Xo
zET%bIQ8k?1CZ=QB(MDSl7)N{AF44m-b=metosLvf@QT(5EBG^-O6*_#cA?caiK&U@JFY)E|DPuOJJ_hx&`MH?L?&UwgA{KFh`$p`s|
zsph`Dd|!Eujm?d{M>-)su`XJsoCAEugw)}	Mbd+_3SFyd&5;^wKEJZ$GTb;3w%ebMPb*+G_!;j9gRg=
zX)ndaWB~i&W?Q^a9lab%t9a#Rg8=aP
z0bh*>+enf`nx{T;xz`7*j`F|V^4hBvX8Tl9}9Qf
zZl82+N->i?f6zI1gw~O#Hp(7Ucpdytl~sqg{}ZHicECY>$=Im|f%!T?Jf|;%eoo)P
znYV#%uB1S@I{iIho1?{t5Ou{f$8U_BaJPuP92f8b67{Dshvt>=TPx(0z-$g(s34SA*j;}w4^La1Q%JLmzOVqsbBLLj>AWjm?VZ<
z7K-H7H#~KSGSe`Lx=v8l(fe2D((AW{?qJMpW%>gk*y8yKULO2EM^X*{ee%W8pdy~?M;GKMe-A6ca~tPS-SO}l<$LnP8$HMCT>%>@
z@V=ziC3*CzU;_=_Q*MnKD`qgF+N~+Mg%a(V<3BUC?li<
zde%JDCO?pxY^T^0MTw(a^Zpw`^0o@>j`nKI+WNC{+O~4+Or=mOc@*h_Bo=aJ)@yn~
zvv@Ys>wQTiX2p)D-r7c0okud!$NNgpmJ>?8a^62O|C!RSq^E10gGnSj5}MVaA1XwL
zO>*#k!L6#?L%I9)iN}=Q%Eu>kgNg}wt4QZt++MgrbPw4Gb++goaWHfT&t$S7nGQ=l
zF1aaomXu7A^?jLltt2q$G8qA$?z56TqycSq#-JHTvYe^5C-JL^jKqonN(csn(K7V4
zJdlBHY5ds7?K5pGYKU{X*K?>71l8hMAThh;8P%|+>5*%pdrhk~q@z$C5uH3$II^NT
zk|t{GZ&0VF!Uf3+WUK((E|QL79X=`kIIhyw6
z%mN(5sQv^!t3Mj~e(ot7lL)WWqAqZ2ur7m^{LgEAg5tD<8Q7a*uH#;Zfv7>tr6d~j
zFj*RW@@NLh9twTL?4m2>Uq#87(@&;cLf>|1Tns9@ng){qaYu!Uz08CedR=$~1FCw<
zQio%-FB3pvuiQV?vLSAjG!C+RHa!Yec)fwX_Rm;ig8&`W_CQQg$4H)hCt?AJ9Eco!
z!C6&f4z<=D$gq`$T+8Se7K-u8S$+rlYedU*AjxFq#7H=e4>y-*I}rTIwFKh%$k>S?
z?}^d#ew+bLiPzlCc7t#47
zf8SG{p=Dl7qi#@FsDP=ukwaP4L}~u^H@u!hxNl;O(Xh
z6%h;{_B~DH2&%@vS#^u54g~j~u&23zjV7=ydLv~Zd-}!Q>hgunJ~JOq@$iJBq^8=?
zj>v&6R``c$;tBMaX;DVIi=&r*c1mcBmAGbV
zc#)vNGm1Lce7Y|+q0uvkHBkH>S_KnrqsE9*>nIOs1NAQ(i24UF=&$5_7AqF(}X39RY_(4LE5Y6btnue{h2TFz#l;0F|FK+6v(XxUi=frpQNJh{C%{TZKITHga2qV$gM(6rOLy+Oh#
zF4z2o)!m6nshBjQj6Ph4RoKLu+{8{)#C!iUQ3axKe3vt^9iYPasonhh;gb{gbQ7KF
zz^h}bKxPl>{1y%7^LV+uz5B@J>JyaW;elzn04Y4p0?0ML>F=qKCIDo!v6|l6TI2k~
z)=)D9es_(`N$kkA)=m6?pF|^g0f)1CU2z1awbjr9${yQ1OLf?ZDo}=`!j()@1k!HA
zx2VAah|i;o{dWt7Qu_VIx-Y5yrud
z9)=481`lukdi@n`u$s}z5g}n}X#M>v*?xEDB@BHz;L0^S-X`mCE6;fygKUmef#9##
z>*W=UQ-suZVksO~ENOcvS)mVCZg31&)j%C!#J>8l`LKI7(G;eASfbI;nhyJwo%CW7
z$_pz%6c&j($Y06qD)Qzgxgx15WZ^5fpxP<3jUJ4re0fdn2;brZ
zr?ZPDAt@xdNA*BApU^c?phN8wZC803FP4oYzDXV-A{$-tyJcI=w^6>kI~yUQ$AChR
zl!lr3y#+!@g#Fd*Lwb*F5+xvo4^{)C&`$AsQo?-LeYnHgDLUM>jUZYS{-i40R7n)5
zu7ZmLxo+Z^bU)xmEv~Z3Oauu4#-}u*>IUn;xxX7P;q2Mu$Pt^8z+{7A^L85qJur=R>I6f|$QYv=R
z)$=%;n6B$#6oatS=THpFK(a#0N+?e7=uP>9_KPIlN}cpg{Bv>juZz2nBg(tr7Zf~H
z(O>!}To<=VzZl?93QP__DG1ZS4+mt7p@n0P{B=i~!O}wLEx==o5{SuHe>w;iA|?ot
z=xby{)NF&aQM7(V59!2Ujp2?Q7J99q%%~!{s0aop*dO(!nqn|nSg62Era`G}1y}L~
zoj3;5Mz9;zpl>vrFiut?_C*F*YsNua#fgbGybzcIuQQvVyj=P07)~XyNn+iRnVPm4
z)nUPTUexO+KFv*)2kpza(NClzqkXYR`4~r!beO7f?RTXUJiAFQ3<59>>a27%H(C{@
z6MfF-rErHVsyqTFIsnuxq_(lWr1%f6a_JOGlcJ*|Y&-!|goNCR5<(7yg!ONqkrQl$
zvPZfCcy>gNIcGZZ84aYQ4Fnzx5$>pZF#=!u<9FNC`vy
z+iw%}emGzqY_N=(YzoRvxC{&67L7-dWqM`{1rVtzk4vdIdCvhwO!ez53!BcW-=G7hem*5H`eE=~U*PE%?yk
z3g-UYFc+pSd?0~grD10t!zBG#=nT#7Dd1OMs0MtsZKeF3yUE5^2}$59xQf|fy7R~A
z247m!dhI2=t#NXBjT7d!W-;_GD_C8&q5QKIE;}?$Eq@sR`^|5s>4YE-T|VMV*>*gX
zo0z;iIM}2PqOQsxYL|*?84?<%^``Zz6isce(+U%bXwk=w=ppom=uvH1QqX#mtsdM=
zs*O;*{k^!cl;gu@oS3_l8bau(nk8%c5Mxdr_0vMx
z0TY0mles{#70_)J7N9Uv=LFU5^V-)!!cWt2NXMV`V6r(CMP24xw~H!(`|q~S;o$)Z
zq5bk^sE&^2Fs&Na-LpxH)oLFq~R3MOA@a7V{
zA_cOZFJEY=nc(6#x3K^MH?MVD@#@eJ8)A$T_qa-o*bT#+j!%Mquo@WpUS}K5t3U18
zqxjdWH*@Z*j@AD+R+T%QeIA(F@B<9S({;2i0FJ6@5NjM?g1NX(l;JL!Jl;x&G@v}B
zuEKI?E5^rZivLjVd{+6AVZh1NJPJK*x>B4F0ueeDK8u#h@vC)qd!9nYjxe-#$@&d-isy&+nm@9l7BT
zFIG3}^?xJInLa>&_UXDn?`lli;~*rQ!*b}OA9*><#PP~mT25NA%5n%}a=8Kq`2s%h
z$3X}r7;`gL&)+Kodj1<7kkTkSojX%fq%UKT=zGvYDIil0q&9N^3&(y
zKIDzf@ZJey)w^r->m!8Tz|C_$;mh}5Kt=8;NBUah2t=!b?T>ybk7dW%HS7$jW6
z*LN4E?-nmBTUpUZ-(KFlPvmt_6A~xu1rqO8K`yT|M$9~@E{t4UZ1JmV6El{a>5wA`
zn#1E`r4-T^ajGfZp;lNA!~}w$oQ9f*2jo35@~EiM!J(rN&~A7StwX(X2y72|4`Zjb
zs5nosEC#y(d=>O-G_!sp9e+4jr#GAF40(t;o#DW~!H0hUT=hz@?|jj}__#d%S)#zO
z?EV0)Atuww_44BUW3+yP*pRiYnFB~;i*NJddwjnqWb>HWFuL3_=Da}9mD8@~&xX(N
z{l%gjn)b&Q3nG&hGc{2dlFu)GM`@U>%nx0VFy)g@_1_PVBw+voX5kG7loQ>|8I{a_
zbx7|>Xed?e1H~xDweuCjyfSbGya$kiG$T@rnlEvuz8)|dX1Ph8LKF)?<%W&uJ^ozp
zM6@6)rb4k?tLR^Wb>+`Ra#lG`wS;J;=qXU`c49(q^-Ol0y}2_VQsHn^$3<9b0lKz?^SFFhjkG7B%9&IKol;E8Z4ok`LbI=ImCVba36RtP$62cV^
ztGjRo@<%&f`X^H_6;Wcrli)t=`>Z7;lwvTf15!dQv>Wp8;fB8lapsSLs-o!0WqE|j
z0%Z806O5qnupul2wc(hs@Sm3{2^EW_qYtz_uI&}(&I`D8lx$krbr=
zyIB5Oz1gfFzLe8D{5bY5tkOJA;shS`s^(a1Cl3@B(sI4i=mPAqb`RN39w_`p8n=HN
zpyW=E-_@ku=l&z!9p0XN_w+tcHVzszGODv2zPU+5L;=EC8
z;tQ0%D$yuuW{In{VLH<{*;7x2#)>Mc7`-4FwhBKvAiT79d3uX!iYqD%*
zMy0s;V&K^YDhMsVnj?I8z-@)Xp31Vdz=Ico+Zjb6T~)G+
zNXrzoUkt**Y<|KiL-4xu1~&H=)K*aIn+XJ;b5Q_5-4Y01Tmz~bJxv}clqV23
zOgQIk`dQ=?
zGT#2zf}D@@nFVEoQzWce#RdH;KBd8=-9O~%0g;AX
zup0IT-Z@ZnDCeLf9#4Rnl;m#UGLbuT_lez|@QwowN77w2#~`ITsNg_$UkDgmD4%Y3
zmvHMXR>E1fhEc;0OgE#8Qp)LqtyvDL_3^RU{;UE#;?o=ZGvSbeWIj`NqT_pFjDQ(;
zRw3WE)#2zlCnxHF{}gcFPV$GsQ3hc$_2C^~SM0NDb@qChMP#RdK
z$uuN}RatJO8Wg(fj7;H4m4CDUDv-*cGn7WTNGbIoj@VOJz5icxSGF71k!1NP9O$t<
zGc1x?;d#(lveCfU5-hcQ-iV@DA`9Y%B4u~`>*t(^j3t+Qt0)PL0c4o>){V%>Ju;S)
z8!Yn6^UR|e@UlvBVJSf&IijQ1&on@#`0GbP2q0Ptn1SVzEnBS~+wcapIU)o@S|c8%
zA{a~N^B##INBd#;16y(yV^B~*tH=Qs=+OdLprt41#2u8p5UsFr@wZy;s`c~_7#&Cz
z;EunCvbEftIZ9IVN`z}2`XhdisTsU3SNw^m{=ZlE%R;Ws?*W;DeQ)!Dvw?slA`YgL
zp%%#@Cb~)TYhzeoqKk9(@}u5DUBn45_dq0V;_!IFCk3A;4P&G>m*;>`4_VDs(Lw{S
zncUAdm=|)GssRWEK(B)ztW8p2oBc{0!ugq{!ZQ^vrjfXUC5j1@V(;TgILtv43Z|>9
zOuFw$G+tW_xa4FLGNprKs16
  

+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for 
  

+Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | Related Pages  | Search for